diff --git a/.github/workflows/ci.yml b/.github/workflows/ci.yml
index 8c54f4dd7..4e44f6ab5 100644
--- a/.github/workflows/ci.yml
+++ b/.github/workflows/ci.yml
@@ -26,6 +26,28 @@ jobs:
         with:
           command: check
 
+  # Test that "cargo package" works. This make sure it's publishable,
+  # since we had issues where "cargo build" worked but "package" didn't.
+  package:
+    name: Package
+    runs-on: ubuntu-latest
+    strategy:
+      matrix:
+        rust:
+          - stable
+          - nightly
+    steps:
+      - uses: actions/checkout@v1
+        with:
+          submodules: true
+      - uses: actions-rs/toolchain@v1
+        with:
+          toolchain: ${{ matrix.rust }}
+          override: true
+      - uses: actions-rs/cargo@v1
+        with:
+          command: package
+
   test-versions:
     name: Test Suite
     runs-on: ubuntu-latest
diff --git a/.gitmodules b/.gitmodules
deleted file mode 100644
index 1ccd6bfdc..000000000
--- a/.gitmodules
+++ /dev/null
@@ -1,4 +0,0 @@
-[submodule "depend/zcash"]
-	path = depend/zcash
-	url = https://github.com/zcash/zcash.git
-	branch = master
diff --git a/CHANGELOG.md b/CHANGELOG.md
index eeab7a112..b1cffc7cf 100644
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -6,6 +6,8 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 
 <!-- next-header -->
 
+## [Unreleased] - ReleaseDate
+
 ## [0.1.6] - 2022-05-16
 
 ### Changed
@@ -41,7 +43,8 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 - Updated `bindgen` to a non yanked version
 
 <!-- next-url -->
-[Unreleased]: https://github.com/ZcashFoundation/zcash_script/compare/v0.1.5...HEAD
+[Unreleased]: https://github.com/ZcashFoundation/zcash_script/compare/v0.1.6...HEAD
+[0.1.6]: https://github.com/ZcashFoundation/zcash_script/compare/v0.1.5...v0.1.6
 [0.1.5]: https://github.com/ZcashFoundation/zcash_script/compare/v0.1.4...v0.1.5
 [0.1.4]: https://github.com/ZcashFoundation/zcash_script/compare/v0.1.3...v0.1.4
 [0.1.3]: https://github.com/ZcashFoundation/zcash_script/compare/v0.1.2...v0.1.3
diff --git a/Cargo.toml b/Cargo.toml
index 23ff08091..57d18c55b 100644
--- a/Cargo.toml
+++ b/Cargo.toml
@@ -10,17 +10,12 @@ description = "ffi bindings to zcashd's zcash_script library"
 documentation = "https://docs.rs/zcash_script"
 repository = "https://github.com/ZcashFoundation/zcash_script"
 include = [
-    "/.github/workflows/ci.yml",
-    "/.gitignore",
-    "/.gitmodules",
     "Cargo.toml",
-    "Cargo.toml.orig",
     "/LICENSE",
     "/README.md",
     "build.rs",
-    "depend/check_uint128_t.c",
-    "src/blake2b.rs",
-    "src/lib.rs",
+    "src/*.rs",
+    "/depend/check_uint128_t.c",
     "/depend/zcash/src/script/zcash_script.h",
     "/depend/zcash/src/script/zcash_script.cpp",
     "/depend/zcash/src/utilstrencodings.cpp",
diff --git a/README.md b/README.md
index 8eac4c6fd..112b08711 100644
--- a/README.md
+++ b/README.md
@@ -30,42 +30,39 @@ To do that, check for versions in:
 - `librustzcash/Cargo.toml` in the revision pointed to by `zcash` (also check for patches)
 - `librustzcash/<crate>/Cargo.toml` in the revision pointed to by `zcash`
 
-### Cloning and checking out `depend/zcash`
+### Updating `depend/zcash`
 
-Clone this repository using:
-```console
-git clone --recurse-submodules
-```
+We keep a copy of the zcash source in `depend/zcash` with the help of `git subtree`.
+It has one single difference that must be enforced everytime it's updated: the root
+`Cargo.toml` must be deleted, since otherwise cargo will ignore the entire folder
+when publishing the crate (see https://github.com/rust-lang/cargo/issues/8597).
 
-Or if you've already cloned:
-```console
-git submodule update --init
-```
+If you need to update the zcash source, run:
 
-To pull the latest version, use:
 ```console
-git pull --recurse-submodules
+git subtree pull -P depend/zcash https://github.com/zcash/zcash.git <ref> --squash
 ```
 
-### Updating `depend/zcash`
-
-If you need to change the submodule's base branch:
-```console
-git config -f .gitmodules submodule.depend/zcash.branch <branch-name>
-```
+where `<ref>` is a reference to a branch, tag or commit (it should be a tag when preparing
+a release, but it will be likely a branch or commit when testing).
 
-To pull in recent changes from the upstream repo:
+The command will likely report a conflict due to the deleted `Cargo.toml` file.
+Just run
 
 ```console
-git submodule update --remote
+git rm depend/zcash/Cargo.toml
 ```
 
-To use a specific commit:
+and then commit the updates. Note: after updating zcash, the PR that includes it must *not* be
+squashed-and-merged, due to how subtree works. Otherwise you will get errors
+when trying to update zcash again.
+
+If that ends up happening, you can always `git rm depend/zcash` and start over
+(run the same command as above, but with `add` instead of `pull`);
+our usage of `subtree` is to just have a convenient way of pulling copies of `zcash`.
+(Unfortunately, switching to submodules is not a good solution due to the need of
+deleting the `Cargo.toml`.)
 
-```console
-cd depend/zcash
-git checkout <commit-hash>
-```
 
 ### Publishing New Releases
 
@@ -75,6 +72,7 @@ Releases for `zcash-script` are made with the help of [cargo release](https://gi
 
 * create a new branch batch the release commits into a PR
 * update `CHANGELOG.md` to document any major changes since the last release
+  https://github.com/rust-lang/cargo/issues/8597)
 * open a PR to merge your branch into `master`
 * locally run `cargo release -- <level>` where `level` can be `patch`, `minor`, or `major` ([source](https://github.com/sunng87/cargo-release/blob/master/docs/reference.md#bump-level))
 
diff --git a/depend/zcash b/depend/zcash
deleted file mode 160000
index 16b49eadd..000000000
--- a/depend/zcash
+++ /dev/null
@@ -1 +0,0 @@
-Subproject commit 16b49eadd56086aae10f2907e5b8e77b773f1813
diff --git a/depend/zcash/.cargo/config.offline b/depend/zcash/.cargo/config.offline
new file mode 100644
index 000000000..8b7762d20
--- /dev/null
+++ b/depend/zcash/.cargo/config.offline
@@ -0,0 +1,8 @@
+[target.aarch64-unknown-linux-gnu]
+linker = "aarch64-linux-gnu-gcc"
+
+[source.crates-io]
+replace-with = "vendored-sources"
+
+[source.vendored-sources]
+# The directory for this source is set to RUST_VENDORED_SOURCES by src/Makefile.am
diff --git a/depend/zcash/.gitattributes b/depend/zcash/.gitattributes
new file mode 100644
index 000000000..c9cf4a7d9
--- /dev/null
+++ b/depend/zcash/.gitattributes
@@ -0,0 +1 @@
+src/clientversion.cpp export-subst
diff --git a/depend/zcash/.github/ISSUE_TEMPLATE/bug-report.md b/depend/zcash/.github/ISSUE_TEMPLATE/bug-report.md
new file mode 100644
index 000000000..447787404
--- /dev/null
+++ b/depend/zcash/.github/ISSUE_TEMPLATE/bug-report.md
@@ -0,0 +1,65 @@
+---
+name: Bug report
+about: Create a report about a bug in zcashd.
+title: ''
+labels: 'bug'
+assignees: ''
+
+---
+
+<!--
+This issue tracker is only for technical issues related to zcashd.
+
+General Zcash questions and/or support requests and are best directed to the
+Zcash Forum: https://forum.zcashcommunity.com/
+
+For reporting security vulnerabilities or for sensitive discussions with our
+security team, please email security@z.cash . You can use this GPG key to send
+an encrypted message:
+    https://z.cash/gpg-pubkeys/security.asc
+    fingerprint: AF85 0445 546C 18B7 86F9  2C62 88FB 8B86 D8B5 A68C
+
+The key and fingerprint are duplicated on our Public Keys page:
+https://z.cash/support/pubkeys.html
+-->
+
+### Describe the issue
+Please provide a general summary of the issue you're experiencing
+
+### Can you reliably reproduce the issue?
+#### If so, please list the steps to reproduce below:
+1. 
+2. 
+3. 
+
+### Expected behaviour
+Tell us what should happen
+
+### Actual behaviour + errors
+Tell us what happens instead including any noticeable error output (any messages
+displayed on-screen when e.g. a crash occurred)
+
+### The version of Zcash you were using:
+Run `zcashd --version` to find out
+
+### Machine specs:
+- OS name + version:
+- CPU:
+- RAM:
+- Disk size:
+- Disk Type (HD/SDD):
+- Linux kernel version (uname -a):
+- Compiler version (gcc --version):
+- Linker version (ld -v):
+- Assembler version (as --version):
+
+### Any extra information that might be useful in the debugging process.
+This includes the relevant contents of `~/.zcash/debug.log`. You can paste raw
+text, attach the file directly in the issue or link to the text via a pastebin
+type site. Please also include any non-standard things you did during
+compilation (extra flags, dependency version changes etc.) if applicable.
+
+### Do you have a backup of `~/.zcash` directory and/or take a VM snapshot?
+- Backing up / making a copy of the `~/.zcash` directory might help make the
+  problem reproducible. Please redact appropriately.
+- Taking a VM snapshot is really helpful for interactively testing fixes
diff --git a/depend/zcash/.github/ISSUE_TEMPLATE/feature-request.md b/depend/zcash/.github/ISSUE_TEMPLATE/feature-request.md
new file mode 100644
index 000000000..57abb7286
--- /dev/null
+++ b/depend/zcash/.github/ISSUE_TEMPLATE/feature-request.md
@@ -0,0 +1,22 @@
+---
+name: Feature request
+about: Suggest an idea for zcashd.
+title: ''
+labels: 'use case'
+assignees: ''
+
+---
+
+## Is your feature request related to a problem? Please describe.
+A clear and concise description of what the problem is. Example: I'm always
+frustrated when [...]
+
+## Describe the solution you'd like
+A clear and concise description of what you want to happen.
+
+## Alternatives you've considered
+A clear and concise description of any alternative solutions or features you've
+considered.
+
+## Additional context
+Add any other context or screenshots about the feature request here.
diff --git a/depend/zcash/.github/ISSUE_TEMPLATE/ux-report.md b/depend/zcash/.github/ISSUE_TEMPLATE/ux-report.md
new file mode 100644
index 000000000..118db34a2
--- /dev/null
+++ b/depend/zcash/.github/ISSUE_TEMPLATE/ux-report.md
@@ -0,0 +1,17 @@
+---
+name: UX report
+about: Was zcashd hard to use? It's not you, it's us. We want to hear about it.
+title: 'UX: '
+labels: 'usability'
+assignees: ''
+
+---
+
+<!-- Did zcashd not do what you expected?
+Was it hard to figure out how to do something?
+Could an error message be more helpful?
+It's not you, it's us. We want to hear about it. -->
+
+## What were you trying to do
+
+## What happened
diff --git a/depend/zcash/.github/dependabot.yml b/depend/zcash/.github/dependabot.yml
new file mode 100644
index 000000000..5c4156c6a
--- /dev/null
+++ b/depend/zcash/.github/dependabot.yml
@@ -0,0 +1,14 @@
+version: 2
+updates:
+- package-ecosystem: github-actions
+  directory: "/"
+  schedule:
+    interval: daily
+    timezone: Etc/UTC
+  open-pull-requests-limit: 10
+  reviewers:
+  - str4d
+  assignees:
+  - str4d
+  labels:
+  - "A-CI"
diff --git a/depend/zcash/.github/pull_request_template.md b/depend/zcash/.github/pull_request_template.md
new file mode 100644
index 000000000..fcb24062c
--- /dev/null
+++ b/depend/zcash/.github/pull_request_template.md
@@ -0,0 +1,5 @@
+Please ensure this checklist is followed for any pull requests for this repo. This checklist must be checked by both the PR creator and by anyone who reviews the PR.
+* [ ] Relevant documentation for this PR has to be completed and reviewed by @mdr0id before the PR can be merged
+* [ ] A test plan for the PR must be documented in the PR notes and included in the test plan for the next regular release
+
+As a note, all buildbot tests need to be passing and all appropriate code reviews need to be done before this PR can be merged
diff --git a/depend/zcash/.github/workflows/book.yml b/depend/zcash/.github/workflows/book.yml
new file mode 100644
index 000000000..12112f122
--- /dev/null
+++ b/depend/zcash/.github/workflows/book.yml
@@ -0,0 +1,32 @@
+name: zcashd book
+
+on:
+  push:
+    branches:
+      - master
+
+jobs:
+  deploy:
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@v3
+
+      - name: Setup mdBook
+        uses: peaceiris/actions-mdbook@v1
+        with:
+          mdbook-version: 'latest'
+
+      - name: Install mdbook-katex
+        uses: actions-rs/cargo@v1
+        with:
+          command: install
+          args: mdbook-katex
+
+      - name: Build zcashd book
+        run: mdbook build doc/book/
+
+      - name: Deploy to GitHub Pages
+        uses: peaceiris/actions-gh-pages@v3
+        with:
+          github_token: ${{ secrets.GITHUB_TOKEN }}
+          publish_dir: ./doc/book/book
diff --git a/depend/zcash/.github/workflows/lints.yml b/depend/zcash/.github/workflows/lints.yml
new file mode 100644
index 000000000..9310129cb
--- /dev/null
+++ b/depend/zcash/.github/workflows/lints.yml
@@ -0,0 +1,106 @@
+name: Lints
+
+# We only run these lints on trial-merges of PRs to reduce noise.
+on: pull_request
+
+jobs:
+  commit-script-check:
+    name: Scripted diffs
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@v3
+        with:
+          fetch-depth: 0
+          ref: ${{ github.event.pull_request.head.sha }}
+      - name: Check scripted diffs
+        run: ./test/lint/commit-script-check.sh ${{ github.event.pull_request.base.sha }}..${{ github.event.pull_request.head.sha }}
+
+  general-lints:
+    name: General
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@v3
+
+      - name: Cargo patches
+        run: ./test/lint/lint-cargo-patches.sh
+        if: always()
+
+      - name: Include guards
+        run: ./test/lint/lint-include-guards.sh
+        if: always()
+
+      - name: Includes
+        run: ./test/lint/lint-includes.sh
+        if: always()
+
+      - name: Locale dependence
+        run: ./test/lint/lint-locale-dependence.sh
+        if: always()
+        continue-on-error: true # Temporary until we get this passing
+
+      - name: Shebang
+        run: ./test/lint/lint-shebang.sh
+        if: always()
+        continue-on-error: true # Temporary until we get this passing
+
+      - name: Shell locale
+        run: ./test/lint/lint-shell-locale.sh
+        if: always()
+        continue-on-error: true # Temporary until we get this passing
+
+      - name: Shellcheck
+        run: ./test/lint/lint-shell.sh
+        if: always()
+        continue-on-error: true # Temporary until we get this passing
+
+      - name: Whitespace
+        run: ./test/lint/lint-whitespace.sh
+        if: always()
+
+  python:
+    name: Python
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@v3
+      - name: Install dependencies
+        run: sudo python3 -m pip install pyflakes
+
+      - name: Pyflakes
+        run: pyflakes qa src zcutil
+        if: always()
+
+      - name: UTF-8 encoding
+        run: ./test/lint/lint-python-utf8-encoding.sh
+        if: always()
+
+  rust-clippy:
+    name: Clippy (1.59.0)
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@v3
+      - uses: actions-rs/toolchain@v1
+        with:
+          toolchain: 1.59.0
+          components: clippy
+          override: true
+      - name: Run clippy
+        uses: actions-rs/clippy-check@v1
+        with:
+          name: Clippy (1.59.0)
+          token: ${{ secrets.GITHUB_TOKEN }}
+          args: --all-features --all-targets -- -D warnings
+
+  rustfmt:
+    name: Rustfmt
+    runs-on: ubuntu-latest
+    steps:
+      - uses: actions/checkout@v3
+      - uses: actions-rs/toolchain@v1
+        with:
+          toolchain: 1.59.0
+          override: true
+      - run: rustup component add rustfmt
+      - uses: actions-rs/cargo@v1
+        with:
+          command: fmt
+          args: -- --check
diff --git a/depend/zcash/.gitignore b/depend/zcash/.gitignore
new file mode 100644
index 000000000..bc02b55db
--- /dev/null
+++ b/depend/zcash/.gitignore
@@ -0,0 +1,129 @@
+*.tar.gz
+*.deb
+*.exe
+src/bitcoin
+src/zcashd
+src/zcashd-wallet-tool
+src/zcash-cli
+src/zcash-gtest
+src/zcash-tx
+src/test/test_bitcoin
+zcutil/bin/
+
+*zcashTest.pk
+*zcashTest.vk
+
+# autoreconf
+Makefile.in
+aclocal.m4
+autom4te.cache/
+build-aux/config.guess
+build-aux/config.sub
+build-aux/depcomp
+build-aux/install-sh
+build-aux/ltmain.sh
+build-aux/m4/libtool.m4
+build-aux/m4/lt~obsolete.m4
+build-aux/m4/ltoptions.m4
+build-aux/m4/ltsugar.m4
+build-aux/m4/ltversion.m4
+build-aux/missing
+build-aux/compile
+build-aux/test-driver
+config.log
+config.status
+configure
+libtool
+src/config/bitcoin-config.h
+src/config/bitcoin-config.h.in
+src/config/stamp-h1
+share/setup.nsi
+confdefs.h
+conftest.cpp
+conftest.err
+
+cache/
+venv-mnf/
+src/univalue/gen
+
+.deps
+.dirstamp
+.libs
+.*.swp
+*.*~*
+*.bak
+*.rej
+*.orig
+*.pyc
+*.o
+*.o.tmp
+*.o-*
+.zcash
+*.a
+*.lib
+*.pb.cc
+*.pb.h
+.vscode
+
+*.log
+*.trs
+*.dmg
+
+*.json.h
+*.raw.h
+
+#libtool object files
+*.lo
+*.la
+
+# Compilation
+Makefile
+
+# Rust
+.cargo/.configured-for-*
+.cargo/config
+target/
+
+# Unit-tests
+Makefile.test
+src/test/buildenv.py
+
+# Resources cpp
+qrc_*.cpp
+
+# Mac specific
+.DS_Store
+build
+
+#lcov
+*.gcno
+*.gcda
+/*.info
+test_bitcoin.coverage/
+zcash-gtest.coverage/
+total.coverage/
+coverage_percent.txt
+afl-temp
+
+#build tests
+linux-coverage-build
+linux-build
+win32-build
+qa/pull-tester/tests_config.py
+qa/pull-tester/tests_config.ini
+qa/cache/*
+
+!src/leveldb*/Makefile
+
+/doc/doxygen/
+
+libzcash_script.pc
+
+contrib/debian/files
+contrib/debian/substvars
+
+src/fuzzing/*/input
+src/fuzzing/*/output
+src/fuzz.cpp
+
+.updatecheck-token
diff --git a/depend/zcash/CONTRIBUTING.md b/depend/zcash/CONTRIBUTING.md
new file mode 100644
index 000000000..ba01490e4
--- /dev/null
+++ b/depend/zcash/CONTRIBUTING.md
@@ -0,0 +1 @@
+Please read [our Development Guidelines](https://zcash.readthedocs.io/en/latest/rtd_pages/development_guidelines.html).
diff --git a/depend/zcash/COPYING b/depend/zcash/COPYING
new file mode 100644
index 000000000..e6e8c782d
--- /dev/null
+++ b/depend/zcash/COPYING
@@ -0,0 +1,44 @@
+Copyright (c) 2016-2022 The Zcash developers
+Copyright (c) 2009-2022 The Bitcoin Core developers
+Copyright (c) 2009-2022 Bitcoin Developers
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+
+
+The MIT software license (https://www.opensource.org/licenses/mit-license.php)
+above applies to the code directly included in this source distribution, with
+the exception of certain Autoconf macros. Dependencies downloaded as part of
+the build process may be covered by other open-source licenses. The MIT-licensed
+source code is not considered a derived work of these Autoconf macros or of the
+dependencies. For further details see 'contrib/debian/copyright'.
+
+
+Although almost all of the Zcash code is licensed under "permissive" open source
+licenses, users and distributors should note that when built using the default
+build options, Zcash depends on Oracle Berkeley DB 6.2.x, which is licensed
+under the GNU Affero General Public License.
+
+
+Contributors should understand licensing implications before modifying the
+following files in build-aux/m4 (see https://github.com/zcash/zcash/issues/2827):
+
+ * ax_check_compile_flag.m4
+ * ax_check_link_flag.m4
+ * ax_check_preproc_flag.m4
+ * ax_pthread.m4
diff --git a/depend/zcash/Cargo.lock b/depend/zcash/Cargo.lock
new file mode 100644
index 000000000..2080a8daa
--- /dev/null
+++ b/depend/zcash/Cargo.lock
@@ -0,0 +1,2407 @@
+# This file is automatically @generated by Cargo.
+# It is not intended for manual editing.
+version = 3
+
+[[package]]
+name = "addr2line"
+version = "0.17.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b9ecd88a8c8378ca913a680cd98f0f13ac67383d35993f86c90a70e3f137816b"
+dependencies = [
+ "gimli",
+]
+
+[[package]]
+name = "adler"
+version = "1.0.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f26201604c87b1e01bd3d98f8d5d9a8fcbb815e8cedb41ffccbeb4bf593a35fe"
+
+[[package]]
+name = "aead"
+version = "0.4.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0b613b8e1e3cf911a086f53f03bf286f52fd7a7258e4fa606f0ef220d39d8877"
+dependencies = [
+ "generic-array",
+]
+
+[[package]]
+name = "aes"
+version = "0.7.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9e8b47f52ea9bae42228d07ec09eb676433d7c4ed1ebdf0f1d1c29ed446f1ab8"
+dependencies = [
+ "cfg-if 1.0.0",
+ "cipher",
+ "cpufeatures",
+ "opaque-debug",
+]
+
+[[package]]
+name = "ahash"
+version = "0.7.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "fcb51a0695d8f838b1ee009b3fbf66bda078cd64590202a864a8f3e8c4315c47"
+dependencies = [
+ "getrandom 0.2.6",
+ "once_cell",
+ "version_check",
+]
+
+[[package]]
+name = "aho-corasick"
+version = "0.7.18"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1e37cfd5e7657ada45f742d6e99ca5788580b5c529dc78faf11ece6dc702656f"
+dependencies = [
+ "memchr",
+]
+
+[[package]]
+name = "ansi_term"
+version = "0.12.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d52a9bb7ec0cf484c551830a7ce27bd20d67eac647e1befb56b0be4ee39a55d2"
+dependencies = [
+ "winapi",
+]
+
+[[package]]
+name = "anyhow"
+version = "1.0.56"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4361135be9122e0870de935d7c439aef945b9f9ddd4199a553b5270b49c82a27"
+
+[[package]]
+name = "arrayref"
+version = "0.3.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a4c527152e37cf757a3f78aae5a06fbeefdb07ccc535c980a3208ee3060dd544"
+
+[[package]]
+name = "arrayvec"
+version = "0.5.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "23b62fc65de8e4e7f52534fb52b0f3ed04746ae267519eef2a83941e8085068b"
+
+[[package]]
+name = "arrayvec"
+version = "0.7.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8da52d66c7071e2e3fa2a1e5c6d088fec47b593032b254f5e980de8ea54454d6"
+
+[[package]]
+name = "atomic-shim"
+version = "0.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "67cd4b51d303cf3501c301e8125df442128d3c6d7c69f71b27833d253de47e77"
+dependencies = [
+ "crossbeam-utils",
+]
+
+[[package]]
+name = "autocfg"
+version = "1.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d468802bab17cbc0cc575e9b053f41e72aa36bfa6b7f55e3529ffa43161b97fa"
+
+[[package]]
+name = "backtrace"
+version = "0.3.64"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5e121dee8023ce33ab248d9ce1493df03c3b38a659b240096fcbd7048ff9c31f"
+dependencies = [
+ "addr2line",
+ "cc",
+ "cfg-if 1.0.0",
+ "libc",
+ "miniz_oxide",
+ "object",
+ "rustc-demangle",
+]
+
+[[package]]
+name = "base64ct"
+version = "1.0.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8a32fd6af2b5827bce66c29053ba0e7c42b9dcab01835835058558c10851a46b"
+
+[[package]]
+name = "bech32"
+version = "0.8.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "cf9ff0bbfd639f15c74af777d81383cf53efb7c93613f6cab67c6c11e05bbf8b"
+
+[[package]]
+name = "bellman"
+version = "0.13.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0d96d7f4f3dc9a699bdef1d19648f6f20ef966b51892d224582a4475be669cb5"
+dependencies = [
+ "bitvec",
+ "blake2s_simd",
+ "byteorder",
+ "crossbeam-channel",
+ "ff",
+ "group",
+ "lazy_static",
+ "log",
+ "num_cpus",
+ "pairing",
+ "rand_core 0.6.3",
+ "rayon",
+ "subtle",
+]
+
+[[package]]
+name = "bip0039"
+version = "0.9.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d0830ae4cc96b0617cc912970c2b17e89456fecbf55e8eed53a956f37ab50c41"
+dependencies = [
+ "hmac",
+ "pbkdf2",
+ "rand 0.8.5",
+ "sha2",
+ "unicode-normalization",
+ "zeroize",
+]
+
+[[package]]
+name = "bitflags"
+version = "1.3.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "bef38d45163c2f1dde094a7dfd33ccf595c92905c8f8f4fdc18d06fb1037718a"
+
+[[package]]
+name = "bitvec"
+version = "1.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1489fcb93a5bb47da0462ca93ad252ad6af2145cce58d10d46a83931ba9f016b"
+dependencies = [
+ "funty",
+ "radium",
+ "tap",
+ "wyz",
+]
+
+[[package]]
+name = "blake2b_simd"
+version = "0.5.11"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "afa748e348ad3be8263be728124b24a24f268266f6f5d58af9d75f6a40b5c587"
+dependencies = [
+ "arrayref",
+ "arrayvec 0.5.2",
+ "constant_time_eq",
+]
+
+[[package]]
+name = "blake2b_simd"
+version = "1.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "72936ee4afc7f8f736d1c38383b56480b5497b4617b4a77bdbf1d2ababc76127"
+dependencies = [
+ "arrayref",
+ "arrayvec 0.7.2",
+ "constant_time_eq",
+]
+
+[[package]]
+name = "blake2s_simd"
+version = "1.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "db539cc2b5f6003621f1cd9ef92d7ded8ea5232c7de0f9faa2de251cd98730d4"
+dependencies = [
+ "arrayref",
+ "arrayvec 0.7.2",
+ "constant_time_eq",
+]
+
+[[package]]
+name = "block-buffer"
+version = "0.9.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4152116fd6e9dadb291ae18fc1ec3575ed6d84c29642d97890f4b4a3417297e4"
+dependencies = [
+ "generic-array",
+]
+
+[[package]]
+name = "block-buffer"
+version = "0.10.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0bf7fe51849ea569fd452f37822f606a5cabb684dc918707a0193fd4664ff324"
+dependencies = [
+ "generic-array",
+]
+
+[[package]]
+name = "block-modes"
+version = "0.8.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2cb03d1bed155d89dce0f845b7899b18a9a163e148fd004e1c28421a783e2d8e"
+dependencies = [
+ "block-padding",
+ "cipher",
+]
+
+[[package]]
+name = "block-padding"
+version = "0.2.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8d696c370c750c948ada61c69a0ee2cbbb9c50b1019ddb86d9317157a99c2cae"
+
+[[package]]
+name = "bls12_381"
+version = "0.7.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "62250ece575fa9b22068b3a8d59586f01d426dd7785522efd97632959e71c986"
+dependencies = [
+ "ff",
+ "group",
+ "pairing",
+ "rand_core 0.6.3",
+ "subtle",
+]
+
+[[package]]
+name = "bs58"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "771fe0050b883fcc3ea2359b1a96bcfbc090b7116eae7c3c512c7a083fdf23d3"
+dependencies = [
+ "sha2",
+]
+
+[[package]]
+name = "bumpalo"
+version = "3.8.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8f1e260c3a9040a7c19a12468758f4c16f31a81a1fe087482be9570ec864bb6c"
+
+[[package]]
+name = "byte-slice-cast"
+version = "1.2.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "87c5fdd0166095e1d463fc6cc01aa8ce547ad77a4e84d42eb6762b084e28067e"
+
+[[package]]
+name = "byteorder"
+version = "1.4.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "14c189c53d098945499cdfa7ecc63567cf3886b3332b312a5b4585d8d3a6a610"
+
+[[package]]
+name = "bytes"
+version = "1.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c4872d67bab6358e59559027aa3b9157c53d9358c51423c17554809a8858e0f8"
+
+[[package]]
+name = "cc"
+version = "1.0.73"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2fff2a6927b3bb87f9595d67196a70493f627687a71d87a0d692242c33f58c11"
+
+[[package]]
+name = "cfg-if"
+version = "0.1.10"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4785bdd1c96b2a846b2bd7cc02e86b6b3dbf14e7e53446c4f54c92a361040822"
+
+[[package]]
+name = "cfg-if"
+version = "1.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "baf1de4339761588bc0619e3cbc0120ee582ebb74b53b4efbf79117bd2da40fd"
+
+[[package]]
+name = "chacha20"
+version = "0.8.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "01b72a433d0cf2aef113ba70f62634c56fddb0f244e6377185c56a7cadbd8f91"
+dependencies = [
+ "cfg-if 1.0.0",
+ "cipher",
+ "cpufeatures",
+ "zeroize",
+]
+
+[[package]]
+name = "chacha20poly1305"
+version = "0.9.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3b84ed6d1d5f7aa9bdde921a5090e0ca4d934d250ea3b402a5fab3a994e28a2a"
+dependencies = [
+ "aead",
+ "chacha20",
+ "cipher",
+ "poly1305",
+ "zeroize",
+]
+
+[[package]]
+name = "cipher"
+version = "0.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7ee52072ec15386f770805afd189a01c8841be8696bed250fa2f13c4c0d6dfb7"
+dependencies = [
+ "generic-array",
+]
+
+[[package]]
+name = "clearscreen"
+version = "1.0.9"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a7ed49b0e894fe6264a58496c7ec4e9d3c46f66b59efae527cd5bee429d0a418"
+dependencies = [
+ "nix",
+ "terminfo",
+ "thiserror",
+ "which",
+ "winapi",
+]
+
+[[package]]
+name = "constant_time_eq"
+version = "0.1.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "245097e9a4535ee1e3e3931fcfcd55a796a44c643e8596ff6566d68f09b87bbc"
+
+[[package]]
+name = "cpufeatures"
+version = "0.2.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "59a6001667ab124aebae2a495118e11d30984c3a653e99d86d58971708cf5e4b"
+dependencies = [
+ "libc",
+]
+
+[[package]]
+name = "crossbeam-channel"
+version = "0.5.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5aaa7bd5fb665c6864b5f963dd9097905c54125909c7aa94c9e18507cdbe6c53"
+dependencies = [
+ "cfg-if 1.0.0",
+ "crossbeam-utils",
+]
+
+[[package]]
+name = "crossbeam-deque"
+version = "0.8.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6455c0ca19f0d2fbf751b908d5c55c1f5cbc65e03c4225427254b46890bdde1e"
+dependencies = [
+ "cfg-if 1.0.0",
+ "crossbeam-epoch",
+ "crossbeam-utils",
+]
+
+[[package]]
+name = "crossbeam-epoch"
+version = "0.9.8"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1145cf131a2c6ba0615079ab6a638f7e1973ac9c2634fcbeaaad6114246efe8c"
+dependencies = [
+ "autocfg",
+ "cfg-if 1.0.0",
+ "crossbeam-utils",
+ "lazy_static",
+ "memoffset",
+ "scopeguard",
+]
+
+[[package]]
+name = "crossbeam-utils"
+version = "0.8.8"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0bf124c720b7686e3c2663cf54062ab0f68a88af2fb6a030e87e30bf721fcb38"
+dependencies = [
+ "cfg-if 1.0.0",
+ "lazy_static",
+]
+
+[[package]]
+name = "crunchy"
+version = "0.2.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7a81dae078cea95a014a339291cec439d2f232ebe854a9d672b796c6afafa9b7"
+
+[[package]]
+name = "crypto-common"
+version = "0.1.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "57952ca27b5e3606ff4dd79b0020231aaf9d6aa76dc05fd30137538c50bd3ce8"
+dependencies = [
+ "generic-array",
+ "typenum",
+]
+
+[[package]]
+name = "crypto-mac"
+version = "0.11.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b1d1a86f49236c215f271d40892d5fc950490551400b02ef360692c29815c714"
+dependencies = [
+ "generic-array",
+ "subtle",
+]
+
+[[package]]
+name = "curve25519-dalek"
+version = "3.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0b9fdf9972b2bd6af2d913799d9ebc165ea4d2e65878e329d9c6b372c4491b61"
+dependencies = [
+ "byteorder",
+ "digest 0.9.0",
+ "rand_core 0.5.1",
+ "subtle",
+ "zeroize",
+]
+
+[[package]]
+name = "dashmap"
+version = "4.0.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e77a43b28d0668df09411cb0bc9a8c2adc40f9a048afe863e05fd43251e8e39c"
+dependencies = [
+ "cfg-if 1.0.0",
+ "num_cpus",
+]
+
+[[package]]
+name = "digest"
+version = "0.9.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d3dd60d1080a57a05ab032377049e0591415d2b31afd7028356dbf3cc6dcb066"
+dependencies = [
+ "generic-array",
+]
+
+[[package]]
+name = "digest"
+version = "0.10.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f2fb860ca6fafa5552fb6d0e816a69c8e49f0908bf524e30a90d97c85892d506"
+dependencies = [
+ "block-buffer 0.10.2",
+ "crypto-common",
+]
+
+[[package]]
+name = "directories"
+version = "4.0.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f51c5d4ddabd36886dd3e1438cb358cdcb0d7c499cb99cb4ac2e38e18b5cb210"
+dependencies = [
+ "dirs-sys",
+]
+
+[[package]]
+name = "dirs"
+version = "2.0.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "13aea89a5c93364a98e9b37b2fa237effbb694d5cfe01c5b70941f7eb087d5e3"
+dependencies = [
+ "cfg-if 0.1.10",
+ "dirs-sys",
+]
+
+[[package]]
+name = "dirs-sys"
+version = "0.3.7"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1b1d1d91c932ef41c0f2663aa8b0ca0342d444d842c06914aa0a7e352d0bada6"
+dependencies = [
+ "libc",
+ "redox_users",
+ "winapi",
+]
+
+[[package]]
+name = "ed25519-zebra"
+version = "3.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "403ef3e961ab98f0ba902771d29f842058578bb1ce7e3c59dad5a6a93e784c69"
+dependencies = [
+ "curve25519-dalek",
+ "hex",
+ "rand_core 0.6.3",
+ "serde",
+ "sha2",
+ "thiserror",
+ "zeroize",
+]
+
+[[package]]
+name = "either"
+version = "1.6.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e78d4f1cc4ae33bbfc157ed5d5a5ef3bc29227303d595861deb238fcec4e9457"
+
+[[package]]
+name = "endian-type"
+version = "0.1.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c34f04666d835ff5d62e058c3995147c06f42fe86ff053337632bca83e42702d"
+
+[[package]]
+name = "equihash"
+version = "0.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4127688f6177e3f57521881cb1cfd90d1228214f9dc43b8efe6f6c6948cd8280"
+dependencies = [
+ "blake2b_simd 0.5.11",
+ "byteorder",
+]
+
+[[package]]
+name = "f4jumble"
+version = "0.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0a83e8d7fd0c526af4aad893b7c9fe41e2699ed8a776a6c74aecdeafe05afc75"
+dependencies = [
+ "blake2b_simd 1.0.0",
+]
+
+[[package]]
+name = "ff"
+version = "0.12.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "df689201f395c6b90dfe87127685f8dbfc083a5e779e613575d8bd7314300c3e"
+dependencies = [
+ "bitvec",
+ "rand_core 0.6.3",
+ "subtle",
+]
+
+[[package]]
+name = "fixed-hash"
+version = "0.7.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "cfcf0ed7fe52a17a03854ec54a9f76d6d84508d1c0e66bc1793301c73fc8493c"
+dependencies = [
+ "byteorder",
+ "rand 0.8.5",
+ "rustc-hex",
+ "static_assertions",
+]
+
+[[package]]
+name = "fnv"
+version = "1.0.7"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3f9eec918d3f24069decb9af1554cad7c880e2da24a9afd88aca000531ab82c1"
+
+[[package]]
+name = "fpe"
+version = "0.5.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "cd910db5f9ca4dc3116f8c46367825807aa2b942f72565f16b4be0b208a00a9e"
+dependencies = [
+ "block-modes",
+ "cipher",
+ "libm",
+ "num-bigint",
+ "num-integer",
+ "num-traits",
+]
+
+[[package]]
+name = "funty"
+version = "2.0.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e6d5a32815ae3f33302d95fdcb2ce17862f8c65363dcfd29360480ba1001fc9c"
+
+[[package]]
+name = "futures-channel"
+version = "0.3.21"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c3083ce4b914124575708913bca19bfe887522d6e2e6d0952943f5eac4a74010"
+dependencies = [
+ "futures-core",
+]
+
+[[package]]
+name = "futures-core"
+version = "0.3.21"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0c09fd04b7e4073ac7156a9539b57a484a8ea920f79c7c675d05d289ab6110d3"
+
+[[package]]
+name = "futures-task"
+version = "0.3.21"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "57c66a976bf5909d801bbef33416c41372779507e7a6b3a5e25e4749c58f776a"
+
+[[package]]
+name = "futures-util"
+version = "0.3.21"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d8b7abd5d659d9b90c8cba917f6ec750a74e2dc23902ef9cd4cc8c8b22e6036a"
+dependencies = [
+ "futures-core",
+ "futures-task",
+ "pin-project-lite",
+ "pin-utils",
+]
+
+[[package]]
+name = "generic-array"
+version = "0.14.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "fd48d33ec7f05fbfa152300fdad764757cbded343c1aa1cff2fbaf4134851803"
+dependencies = [
+ "typenum",
+ "version_check",
+]
+
+[[package]]
+name = "getrandom"
+version = "0.1.16"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8fc3cb4d91f53b50155bdcfd23f6a4c39ae1969c2ae85982b135750cccaf5fce"
+dependencies = [
+ "cfg-if 1.0.0",
+ "libc",
+ "wasi 0.9.0+wasi-snapshot-preview1",
+]
+
+[[package]]
+name = "getrandom"
+version = "0.2.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9be70c98951c83b8d2f8f60d7065fa6d5146873094452a1008da8c2f1e4205ad"
+dependencies = [
+ "cfg-if 1.0.0",
+ "libc",
+ "wasi 0.10.2+wasi-snapshot-preview1",
+]
+
+[[package]]
+name = "gimli"
+version = "0.26.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "78cc372d058dcf6d5ecd98510e7fbc9e5aec4d21de70f65fea8fecebcd881bd4"
+
+[[package]]
+name = "group"
+version = "0.12.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7391856def869c1c81063a03457c676fbcd419709c3dfb33d8d319de484b154d"
+dependencies = [
+ "byteorder",
+ "ff",
+ "rand_core 0.6.3",
+ "subtle",
+]
+
+[[package]]
+name = "gumdrop"
+version = "0.8.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5bc700f989d2f6f0248546222d9b4258f5b02a171a431f8285a81c08142629e3"
+dependencies = [
+ "gumdrop_derive",
+]
+
+[[package]]
+name = "gumdrop_derive"
+version = "0.8.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "729f9bd3449d77e7831a18abfb7ba2f99ee813dfd15b8c2167c9a54ba20aa99d"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "halo2_gadgets"
+version = "0.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "13f3914f58cc4af5e4fe83d48b02d582be18976bc7e96c3151aa2bf1c98e9f60"
+dependencies = [
+ "arrayvec 0.7.2",
+ "bitvec",
+ "ff",
+ "group",
+ "halo2_proofs",
+ "lazy_static",
+ "pasta_curves",
+ "rand 0.8.5",
+ "subtle",
+ "uint",
+]
+
+[[package]]
+name = "halo2_proofs"
+version = "0.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e925780549adee8364c7f2b685c753f6f3df23bde520c67416e93bf615933760"
+dependencies = [
+ "blake2b_simd 1.0.0",
+ "ff",
+ "group",
+ "pasta_curves",
+ "rand_core 0.6.3",
+ "rayon",
+]
+
+[[package]]
+name = "hashbrown"
+version = "0.11.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ab5ef0d4909ef3724cc8cce6ccc8572c5c817592e9285f5464f8e86f8bd3726e"
+dependencies = [
+ "ahash",
+]
+
+[[package]]
+name = "hdwallet"
+version = "0.3.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9cd89bf343be18dbe1e505100e48168bbd084760e842a8fed0317d2361470193"
+dependencies = [
+ "lazy_static",
+ "rand_core 0.6.3",
+ "ring",
+ "secp256k1",
+]
+
+[[package]]
+name = "hermit-abi"
+version = "0.1.19"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "62b467343b94ba476dcb2500d242dadbb39557df889310ac77c5d99100aaac33"
+dependencies = [
+ "libc",
+]
+
+[[package]]
+name = "hex"
+version = "0.4.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7f24254aa9a54b5c858eaee2f5bccdb46aaf0e486a595ed5fd8f86ba55232a70"
+
+[[package]]
+name = "hmac"
+version = "0.11.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2a2a2320eb7ec0ebe8da8f744d7812d9fc4cb4d09344ac01898dbcb6a20ae69b"
+dependencies = [
+ "crypto-mac",
+ "digest 0.9.0",
+]
+
+[[package]]
+name = "http"
+version = "0.2.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "31f4c6746584866f0feabcc69893c5b51beef3831656a968ed7ae254cdc4fd03"
+dependencies = [
+ "bytes",
+ "fnv",
+ "itoa",
+]
+
+[[package]]
+name = "http-body"
+version = "0.4.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1ff4f84919677303da5f147645dbea6b1881f368d03ac84e1dc09031ebd7b2c6"
+dependencies = [
+ "bytes",
+ "http",
+ "pin-project-lite",
+]
+
+[[package]]
+name = "httparse"
+version = "1.6.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9100414882e15fb7feccb4897e5f0ff0ff1ca7d1a86a23208ada4d7a18e6c6c4"
+
+[[package]]
+name = "httpdate"
+version = "1.0.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c4a1e36c821dbe04574f602848a19f742f4fb3c98d40449f11bcad18d6b17421"
+
+[[package]]
+name = "hyper"
+version = "0.14.18"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b26ae0a80afebe130861d90abf98e3814a4f28a4c6ffeb5ab8ebb2be311e0ef2"
+dependencies = [
+ "bytes",
+ "futures-channel",
+ "futures-core",
+ "futures-util",
+ "http",
+ "http-body",
+ "httparse",
+ "httpdate",
+ "itoa",
+ "pin-project-lite",
+ "socket2",
+ "tokio",
+ "tower-service",
+ "tracing",
+ "want",
+]
+
+[[package]]
+name = "impl-codec"
+version = "0.6.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ba6a270039626615617f3f36d15fc827041df3b78c439da2cadfa47455a77f2f"
+dependencies = [
+ "parity-scale-codec",
+]
+
+[[package]]
+name = "impl-trait-for-tuples"
+version = "0.2.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "11d7a9f6330b71fea57921c9b61c47ee6e84f72d394754eff6163ae67e7395eb"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "incrementalmerkletree"
+version = "0.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "068c5bdd31006d55536655cf1eb0d22d84d28de7c725b419480fd5d005c83216"
+dependencies = [
+ "serde",
+]
+
+[[package]]
+name = "indexmap"
+version = "1.8.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0f647032dfaa1f8b6dc29bd3edb7bbef4861b8b8007ebb118d6db284fd59f6ee"
+dependencies = [
+ "autocfg",
+ "hashbrown",
+]
+
+[[package]]
+name = "instant"
+version = "0.1.12"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7a5bbe824c507c5da5956355e86a746d82e0e1464f65d862cc5e71da70e94b2c"
+dependencies = [
+ "cfg-if 1.0.0",
+]
+
+[[package]]
+name = "ipnet"
+version = "2.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "35e70ee094dc02fd9c13fdad4940090f22dbd6ac7c9e7094a46cf0232a50bc7c"
+
+[[package]]
+name = "itoa"
+version = "1.0.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1aab8fc367588b89dcee83ab0fd66b72b50b72fa1904d7095045ace2b0c81c35"
+
+[[package]]
+name = "js-sys"
+version = "0.3.57"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "671a26f820db17c2a2750743f1dd03bafd15b98c9f30c7c2628c024c05d73397"
+dependencies = [
+ "wasm-bindgen",
+]
+
+[[package]]
+name = "jubjub"
+version = "0.9.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a575df5f985fe1cd5b2b05664ff6accfc46559032b954529fd225a2168d27b0f"
+dependencies = [
+ "bitvec",
+ "bls12_381",
+ "ff",
+ "group",
+ "rand_core 0.6.3",
+ "subtle",
+]
+
+[[package]]
+name = "lazy_static"
+version = "1.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e2abad23fbc42b3700f2f279844dc832adb2b2eb069b2df918f455c4e18cc646"
+
+[[package]]
+name = "libc"
+version = "0.2.122"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ec647867e2bf0772e28c8bcde4f0d19a9216916e890543b5a03ed8ef27b8f259"
+
+[[package]]
+name = "libm"
+version = "0.2.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "33a33a362ce288760ec6a508b94caaec573ae7d3bbbd91b87aa0bad4456839db"
+
+[[package]]
+name = "librustzcash"
+version = "0.2.0"
+dependencies = [
+ "anyhow",
+ "backtrace",
+ "bellman",
+ "blake2b_simd 1.0.0",
+ "blake2s_simd",
+ "bls12_381",
+ "byteorder",
+ "clearscreen",
+ "ed25519-zebra",
+ "group",
+ "gumdrop",
+ "incrementalmerkletree",
+ "ipnet",
+ "jubjub",
+ "libc",
+ "memuse",
+ "metrics",
+ "metrics-exporter-prometheus",
+ "nonempty",
+ "orchard",
+ "rand 0.8.5",
+ "rand_core 0.6.3",
+ "secp256k1",
+ "secrecy",
+ "subtle",
+ "thiserror",
+ "time",
+ "tracing",
+ "tracing-appender",
+ "tracing-core",
+ "tracing-subscriber",
+ "zcash_address",
+ "zcash_encoding",
+ "zcash_history",
+ "zcash_note_encryption",
+ "zcash_primitives",
+ "zcash_proofs",
+ "zeroize",
+]
+
+[[package]]
+name = "lock_api"
+version = "0.4.7"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "327fa5b6a6940e4699ec49a9beae1ea4845c6bab9314e4f84ac68742139d8c53"
+dependencies = [
+ "autocfg",
+ "scopeguard",
+]
+
+[[package]]
+name = "log"
+version = "0.4.16"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6389c490849ff5bc16be905ae24bc913a9c8892e19b2341dbc175e14c341c2b8"
+dependencies = [
+ "cfg-if 1.0.0",
+]
+
+[[package]]
+name = "mach"
+version = "0.3.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b823e83b2affd8f40a9ee8c29dbc56404c1e34cd2710921f2801e2cf29527afa"
+dependencies = [
+ "libc",
+]
+
+[[package]]
+name = "matchers"
+version = "0.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8263075bb86c5a1b1427b5ae862e8889656f126e9f77c484496e8b47cf5c5558"
+dependencies = [
+ "regex-automata",
+]
+
+[[package]]
+name = "memchr"
+version = "2.4.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "308cc39be01b73d0d18f82a0e7b2a3df85245f84af96fdddc5d202d27e47b86a"
+
+[[package]]
+name = "memoffset"
+version = "0.6.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5aa361d4faea93603064a027415f07bd8e1d5c88c9fbf68bf56a285428fd79ce"
+dependencies = [
+ "autocfg",
+]
+
+[[package]]
+name = "memuse"
+version = "0.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f69d25cd7528769ad3d897e99eb942774bff8b23165012af490351a44c5b583b"
+dependencies = [
+ "nonempty",
+]
+
+[[package]]
+name = "metrics"
+version = "0.17.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "55586aa936c35f34ba8aa5d97356d554311206e1ce1f9e68fe7b07288e5ad827"
+dependencies = [
+ "ahash",
+ "metrics-macros",
+]
+
+[[package]]
+name = "metrics-exporter-prometheus"
+version = "0.6.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "343a5ceb38235928e7a5687412590f07e6d281522dcd9ff51246f8856eef5fe5"
+dependencies = [
+ "hyper",
+ "ipnet",
+ "metrics",
+ "metrics-util",
+ "parking_lot",
+ "quanta",
+ "thiserror",
+ "tokio",
+]
+
+[[package]]
+name = "metrics-macros"
+version = "0.4.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "0daa0ab3a0ae956d0e2c1f42511422850e577d36a255357d1a7d08d45ee3a2f1"
+dependencies = [
+ "lazy_static",
+ "proc-macro2",
+ "quote",
+ "regex",
+ "syn",
+]
+
+[[package]]
+name = "metrics-util"
+version = "0.10.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1174223789e331d9d47a4a953dac36e397db60fa8d2a111ac505388c6c7fe32e"
+dependencies = [
+ "ahash",
+ "aho-corasick",
+ "atomic-shim",
+ "crossbeam-epoch",
+ "crossbeam-utils",
+ "dashmap",
+ "hashbrown",
+ "indexmap",
+ "metrics",
+ "num_cpus",
+ "ordered-float",
+ "parking_lot",
+ "quanta",
+ "radix_trie",
+ "sketches-ddsketch",
+]
+
+[[package]]
+name = "miniz_oxide"
+version = "0.4.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a92518e98c078586bc6c934028adcca4c92a53d6a958196de835170a01d84e4b"
+dependencies = [
+ "adler",
+ "autocfg",
+]
+
+[[package]]
+name = "mio"
+version = "0.8.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "52da4364ffb0e4fe33a9841a98a3f3014fb964045ce4f7a45a398243c8d6b0c9"
+dependencies = [
+ "libc",
+ "log",
+ "miow",
+ "ntapi",
+ "wasi 0.11.0+wasi-snapshot-preview1",
+ "winapi",
+]
+
+[[package]]
+name = "miow"
+version = "0.3.7"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b9f1c5b025cda876f66ef43a113f91ebc9f4ccef34843000e0adf6ebbab84e21"
+dependencies = [
+ "winapi",
+]
+
+[[package]]
+name = "nibble_vec"
+version = "0.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "77a5d83df9f36fe23f0c3648c6bbb8b0298bb5f1939c8f2704431371f4b84d43"
+dependencies = [
+ "smallvec",
+]
+
+[[package]]
+name = "nix"
+version = "0.22.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e4916f159ed8e5de0082076562152a76b7a1f64a01fd9d1e0fea002c37624faf"
+dependencies = [
+ "bitflags",
+ "cc",
+ "cfg-if 1.0.0",
+ "libc",
+ "memoffset",
+]
+
+[[package]]
+name = "nom"
+version = "5.1.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ffb4262d26ed83a1c0a33a38fe2bb15797329c85770da05e6b828ddb782627af"
+dependencies = [
+ "memchr",
+ "version_check",
+]
+
+[[package]]
+name = "nonempty"
+version = "0.7.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e9e591e719385e6ebaeb5ce5d3887f7d5676fceca6411d1925ccc95745f3d6f7"
+
+[[package]]
+name = "ntapi"
+version = "0.3.7"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c28774a7fd2fbb4f0babd8237ce554b73af68021b5f695a3cebd6c59bac0980f"
+dependencies = [
+ "winapi",
+]
+
+[[package]]
+name = "num-bigint"
+version = "0.4.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f93ab6289c7b344a8a9f60f88d80aa20032336fe78da341afc91c8a2341fc75f"
+dependencies = [
+ "autocfg",
+ "num-integer",
+ "num-traits",
+]
+
+[[package]]
+name = "num-integer"
+version = "0.1.44"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d2cc698a63b549a70bc047073d2949cce27cd1c7b0a4a862d08a8031bc2801db"
+dependencies = [
+ "autocfg",
+ "num-traits",
+]
+
+[[package]]
+name = "num-traits"
+version = "0.2.14"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9a64b1ec5cda2586e284722486d802acf1f7dbdc623e2bfc57e65ca1cd099290"
+dependencies = [
+ "autocfg",
+]
+
+[[package]]
+name = "num_cpus"
+version = "1.13.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "19e64526ebdee182341572e50e9ad03965aa510cd94427a4549448f285e957a1"
+dependencies = [
+ "hermit-abi",
+ "libc",
+]
+
+[[package]]
+name = "num_threads"
+version = "0.1.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "aba1801fb138d8e85e11d0fc70baf4fe1cdfffda7c6cd34a854905df588e5ed0"
+dependencies = [
+ "libc",
+]
+
+[[package]]
+name = "object"
+version = "0.27.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "67ac1d3f9a1d3616fd9a60c8d74296f22406a238b6a72f5cc1e6f314df4ffbf9"
+dependencies = [
+ "memchr",
+]
+
+[[package]]
+name = "once_cell"
+version = "1.10.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "87f3e037eac156d1775da914196f0f37741a274155e34a0b7e427c35d2a2ecb9"
+
+[[package]]
+name = "opaque-debug"
+version = "0.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "624a8340c38c1b80fd549087862da4ba43e08858af025b236e509b6649fc13d5"
+
+[[package]]
+name = "orchard"
+version = "0.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f918076e191a68d55c5517a16e075ecfe58fc63ed112408263f3d6194597bfcf"
+dependencies = [
+ "aes",
+ "bitvec",
+ "blake2b_simd 1.0.0",
+ "ff",
+ "fpe",
+ "group",
+ "halo2_gadgets",
+ "halo2_proofs",
+ "hex",
+ "incrementalmerkletree",
+ "lazy_static",
+ "memuse",
+ "nonempty",
+ "pasta_curves",
+ "rand 0.8.5",
+ "reddsa",
+ "serde",
+ "subtle",
+ "zcash_note_encryption",
+]
+
+[[package]]
+name = "ordered-float"
+version = "2.10.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7940cf2ca942593318d07fcf2596cdca60a85c9e7fab408a5e21a4f9dcd40d87"
+dependencies = [
+ "num-traits",
+]
+
+[[package]]
+name = "pairing"
+version = "0.22.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "135590d8bdba2b31346f9cd1fb2a912329f5135e832a4f422942eb6ead8b6b3b"
+dependencies = [
+ "group",
+]
+
+[[package]]
+name = "parity-scale-codec"
+version = "3.1.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e8b44461635bbb1a0300f100a841e571e7d919c81c73075ef5d152ffdb521066"
+dependencies = [
+ "arrayvec 0.7.2",
+ "bitvec",
+ "byte-slice-cast",
+ "impl-trait-for-tuples",
+ "parity-scale-codec-derive",
+ "serde",
+]
+
+[[package]]
+name = "parity-scale-codec-derive"
+version = "3.1.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c45ed1f39709f5a89338fab50e59816b2e8815f5bb58276e7ddf9afd495f73f8"
+dependencies = [
+ "proc-macro-crate",
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "parking_lot"
+version = "0.11.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7d17b78036a60663b797adeaee46f5c9dfebb86948d1255007a1d6be0271ff99"
+dependencies = [
+ "instant",
+ "lock_api",
+ "parking_lot_core",
+]
+
+[[package]]
+name = "parking_lot_core"
+version = "0.8.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d76e8e1493bcac0d2766c42737f34458f1c8c50c0d23bcb24ea953affb273216"
+dependencies = [
+ "cfg-if 1.0.0",
+ "instant",
+ "libc",
+ "redox_syscall",
+ "smallvec",
+ "winapi",
+]
+
+[[package]]
+name = "password-hash"
+version = "0.3.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1d791538a6dcc1e7cb7fe6f6b58aca40e7f79403c45b2bc274008b5e647af1d8"
+dependencies = [
+ "base64ct",
+ "rand_core 0.6.3",
+ "subtle",
+]
+
+[[package]]
+name = "pasta_curves"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "369d7785168ad7ff0cbe467d968ca3e19a927d8536b11ef9c21b4e454b15ba42"
+dependencies = [
+ "blake2b_simd 1.0.0",
+ "ff",
+ "group",
+ "lazy_static",
+ "rand 0.8.5",
+ "static_assertions",
+ "subtle",
+]
+
+[[package]]
+name = "pbkdf2"
+version = "0.9.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f05894bce6a1ba4be299d0c5f29563e08af2bc18bb7d48313113bed71e904739"
+dependencies = [
+ "crypto-mac",
+ "password-hash",
+]
+
+[[package]]
+name = "phf"
+version = "0.8.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3dfb61232e34fcb633f43d12c58f83c1df82962dcdfa565a4e866ffc17dafe12"
+dependencies = [
+ "phf_shared",
+]
+
+[[package]]
+name = "phf_codegen"
+version = "0.8.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "cbffee61585b0411840d3ece935cce9cb6321f01c45477d30066498cd5e1a815"
+dependencies = [
+ "phf_generator",
+ "phf_shared",
+]
+
+[[package]]
+name = "phf_generator"
+version = "0.8.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "17367f0cc86f2d25802b2c26ee58a7b23faeccf78a396094c13dced0d0182526"
+dependencies = [
+ "phf_shared",
+ "rand 0.7.3",
+]
+
+[[package]]
+name = "phf_shared"
+version = "0.8.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c00cf8b9eafe68dde5e9eaa2cef8ee84a9336a47d566ec55ca16589633b65af7"
+dependencies = [
+ "siphasher",
+]
+
+[[package]]
+name = "pin-project-lite"
+version = "0.2.8"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e280fbe77cc62c91527259e9442153f4688736748d24660126286329742b4c6c"
+
+[[package]]
+name = "pin-utils"
+version = "0.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8b870d8c151b6f2fb93e84a13146138f05d02ed11c7e7c54f8826aaaf7c9f184"
+
+[[package]]
+name = "poly1305"
+version = "0.7.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "048aeb476be11a4b6ca432ca569e375810de9294ae78f4774e78ea98a9246ede"
+dependencies = [
+ "cpufeatures",
+ "opaque-debug",
+ "universal-hash",
+]
+
+[[package]]
+name = "ppv-lite86"
+version = "0.2.16"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "eb9f9e6e233e5c4a35559a617bf40a4ec447db2e84c20b55a6f83167b7e57872"
+
+[[package]]
+name = "primitive-types"
+version = "0.11.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e28720988bff275df1f51b171e1b2a18c30d194c4d2b61defdacecd625a5d94a"
+dependencies = [
+ "fixed-hash",
+ "impl-codec",
+ "uint",
+]
+
+[[package]]
+name = "proc-macro-crate"
+version = "1.1.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e17d47ce914bf4de440332250b0edd23ce48c005f59fab39d3335866b114f11a"
+dependencies = [
+ "thiserror",
+ "toml",
+]
+
+[[package]]
+name = "proc-macro2"
+version = "1.0.37"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ec757218438d5fda206afc041538b2f6d889286160d649a86a24d37e1235afd1"
+dependencies = [
+ "unicode-xid",
+]
+
+[[package]]
+name = "quanta"
+version = "0.9.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "20afe714292d5e879d8b12740aa223c6a88f118af41870e8b6196e39a02238a8"
+dependencies = [
+ "crossbeam-utils",
+ "libc",
+ "mach",
+ "once_cell",
+ "raw-cpuid",
+ "wasi 0.10.2+wasi-snapshot-preview1",
+ "web-sys",
+ "winapi",
+]
+
+[[package]]
+name = "quote"
+version = "1.0.17"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "632d02bff7f874a36f33ea8bb416cd484b90cc66c1194b1a1110d067a7013f58"
+dependencies = [
+ "proc-macro2",
+]
+
+[[package]]
+name = "radium"
+version = "0.7.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "dc33ff2d4973d518d823d61aa239014831e521c75da58e3df4840d3f47749d09"
+
+[[package]]
+name = "radix_trie"
+version = "0.2.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c069c179fcdc6a2fe24d8d18305cf085fdbd4f922c041943e203685d6a1c58fd"
+dependencies = [
+ "endian-type",
+ "nibble_vec",
+]
+
+[[package]]
+name = "rand"
+version = "0.7.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6a6b1679d49b24bbfe0c803429aa1874472f50d9b363131f0e89fc356b544d03"
+dependencies = [
+ "getrandom 0.1.16",
+ "libc",
+ "rand_chacha 0.2.2",
+ "rand_core 0.5.1",
+ "rand_hc",
+ "rand_pcg",
+]
+
+[[package]]
+name = "rand"
+version = "0.8.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "34af8d1a0e25924bc5b7c43c079c942339d8f0a8b57c39049bef581b46327404"
+dependencies = [
+ "libc",
+ "rand_chacha 0.3.1",
+ "rand_core 0.6.3",
+]
+
+[[package]]
+name = "rand_chacha"
+version = "0.2.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f4c8ed856279c9737206bf725bf36935d8666ead7aa69b52be55af369d193402"
+dependencies = [
+ "ppv-lite86",
+ "rand_core 0.5.1",
+]
+
+[[package]]
+name = "rand_chacha"
+version = "0.3.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e6c10a63a0fa32252be49d21e7709d4d4baf8d231c2dbce1eaa8141b9b127d88"
+dependencies = [
+ "ppv-lite86",
+ "rand_core 0.6.3",
+]
+
+[[package]]
+name = "rand_core"
+version = "0.5.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "90bde5296fc891b0cef12a6d03ddccc162ce7b2aff54160af9338f8d40df6d19"
+dependencies = [
+ "getrandom 0.1.16",
+]
+
+[[package]]
+name = "rand_core"
+version = "0.6.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d34f1408f55294453790c48b2f1ebbb1c5b4b7563eb1f418bcfcfdbb06ebb4e7"
+dependencies = [
+ "getrandom 0.2.6",
+]
+
+[[package]]
+name = "rand_hc"
+version = "0.2.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ca3129af7b92a17112d59ad498c6f81eaf463253766b90396d39ea7a39d6613c"
+dependencies = [
+ "rand_core 0.5.1",
+]
+
+[[package]]
+name = "rand_pcg"
+version = "0.2.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "16abd0c1b639e9eb4d7c50c0b8100b0d0f849be2349829c740fe8e6eb4816429"
+dependencies = [
+ "rand_core 0.5.1",
+]
+
+[[package]]
+name = "raw-cpuid"
+version = "10.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "738bc47119e3eeccc7e94c4a506901aea5e7b4944ecd0829cbebf4af04ceda12"
+dependencies = [
+ "bitflags",
+]
+
+[[package]]
+name = "rayon"
+version = "1.5.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c06aca804d41dbc8ba42dfd964f0d01334eceb64314b9ecf7c5fad5188a06d90"
+dependencies = [
+ "autocfg",
+ "crossbeam-deque",
+ "either",
+ "rayon-core",
+]
+
+[[package]]
+name = "rayon-core"
+version = "1.9.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d78120e2c850279833f1dd3582f730c4ab53ed95aeaaaa862a2a5c71b1656d8e"
+dependencies = [
+ "crossbeam-channel",
+ "crossbeam-deque",
+ "crossbeam-utils",
+ "lazy_static",
+ "num_cpus",
+]
+
+[[package]]
+name = "reddsa"
+version = "0.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4cc8038c8b7e481bdf688d0585d4897ed0e9e0cee10aa365dde51238c20e4182"
+dependencies = [
+ "blake2b_simd 1.0.0",
+ "byteorder",
+ "group",
+ "jubjub",
+ "pasta_curves",
+ "rand_core 0.6.3",
+ "serde",
+ "thiserror",
+ "zeroize",
+]
+
+[[package]]
+name = "redox_syscall"
+version = "0.2.13"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "62f25bc4c7e55e0b0b7a1d43fb893f4fa1361d0abe38b9ce4f323c2adfe6ef42"
+dependencies = [
+ "bitflags",
+]
+
+[[package]]
+name = "redox_users"
+version = "0.4.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b033d837a7cf162d7993aded9304e30a83213c648b6e389db233191f891e5c2b"
+dependencies = [
+ "getrandom 0.2.6",
+ "redox_syscall",
+ "thiserror",
+]
+
+[[package]]
+name = "regex"
+version = "1.5.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1a11647b6b25ff05a515cb92c365cec08801e83423a235b51e231e1808747286"
+dependencies = [
+ "aho-corasick",
+ "memchr",
+ "regex-syntax",
+]
+
+[[package]]
+name = "regex-automata"
+version = "0.1.10"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6c230d73fb8d8c1b9c0b3135c5142a8acee3a0558fb8db5cf1cb65f8d7862132"
+dependencies = [
+ "regex-syntax",
+]
+
+[[package]]
+name = "regex-syntax"
+version = "0.6.25"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f497285884f3fcff424ffc933e56d7cbca511def0c9831a7f9b5f6153e3cc89b"
+
+[[package]]
+name = "ring"
+version = "0.16.20"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3053cf52e236a3ed746dfc745aa9cacf1b791d846bdaf412f60a8d7d6e17c8fc"
+dependencies = [
+ "cc",
+ "libc",
+ "once_cell",
+ "spin",
+ "untrusted",
+ "web-sys",
+ "winapi",
+]
+
+[[package]]
+name = "ripemd"
+version = "0.1.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1facec54cb5e0dc08553501fa740091086d0259ad0067e0d4103448e4cb22ed3"
+dependencies = [
+ "digest 0.10.3",
+]
+
+[[package]]
+name = "rustc-demangle"
+version = "0.1.21"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7ef03e0a2b150c7a90d01faf6254c9c48a41e95fb2a8c2ac1c6f0d2b9aefc342"
+
+[[package]]
+name = "rustc-hex"
+version = "2.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3e75f6a532d0fd9f7f13144f392b6ad56a32696bfcd9c78f797f16bbb6f072d6"
+
+[[package]]
+name = "scopeguard"
+version = "1.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d29ab0c6d3fc0ee92fe66e2d99f700eab17a8d57d1c1d3b748380fb20baa78cd"
+
+[[package]]
+name = "secp256k1"
+version = "0.21.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9c42e6f1735c5f00f51e43e28d6634141f2bcad10931b2609ddd74a86d751260"
+dependencies = [
+ "secp256k1-sys",
+]
+
+[[package]]
+name = "secp256k1-sys"
+version = "0.4.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "957da2573cde917463ece3570eab4a0b3f19de6f1646cde62e6fd3868f566036"
+dependencies = [
+ "cc",
+]
+
+[[package]]
+name = "secrecy"
+version = "0.8.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9bd1c54ea06cfd2f6b63219704de0b9b4f72dcc2b8fdef820be6cd799780e91e"
+dependencies = [
+ "zeroize",
+]
+
+[[package]]
+name = "serde"
+version = "1.0.136"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ce31e24b01e1e524df96f1c2fdd054405f8d7376249a5110886fb4b658484789"
+dependencies = [
+ "serde_derive",
+]
+
+[[package]]
+name = "serde_derive"
+version = "1.0.136"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "08597e7152fcd306f41838ed3e37be9eaeed2b61c42e2117266a554fab4662f9"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "sha2"
+version = "0.9.9"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4d58a1e1bf39749807d89cf2d98ac2dfa0ff1cb3faa38fbb64dd88ac8013d800"
+dependencies = [
+ "block-buffer 0.9.0",
+ "cfg-if 1.0.0",
+ "cpufeatures",
+ "digest 0.9.0",
+ "opaque-debug",
+]
+
+[[package]]
+name = "sharded-slab"
+version = "0.1.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "900fba806f70c630b0a382d0d825e17a0f19fcd059a2ade1ff237bcddf446b31"
+dependencies = [
+ "lazy_static",
+]
+
+[[package]]
+name = "siphasher"
+version = "0.3.10"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7bd3e3206899af3f8b12af284fafc038cc1dc2b41d1b89dd17297221c5d225de"
+
+[[package]]
+name = "sketches-ddsketch"
+version = "0.1.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "76a77a8fd93886010f05e7ea0720e569d6d16c65329dbe3ec033bbbccccb017b"
+
+[[package]]
+name = "smallvec"
+version = "1.8.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f2dd574626839106c320a323308629dcb1acfc96e32a8cba364ddc61ac23ee83"
+
+[[package]]
+name = "socket2"
+version = "0.4.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "66d72b759436ae32898a2af0a14218dbf55efde3feeb170eb623637db85ee1e0"
+dependencies = [
+ "libc",
+ "winapi",
+]
+
+[[package]]
+name = "spin"
+version = "0.5.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6e63cff320ae2c57904679ba7cb63280a3dc4613885beafb148ee7bf9aa9042d"
+
+[[package]]
+name = "static_assertions"
+version = "1.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a2eb9349b6444b326872e140eb1cf5e7c522154d69e7a0ffb0fb81c06b37543f"
+
+[[package]]
+name = "subtle"
+version = "2.4.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "6bdef32e8150c2a081110b42772ffe7d7c9032b606bc226c8260fd97e0976601"
+
+[[package]]
+name = "syn"
+version = "1.0.91"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b683b2b825c8eef438b77c36a06dc262294da3d5a5813fac20da149241dcd44d"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "unicode-xid",
+]
+
+[[package]]
+name = "synstructure"
+version = "0.12.6"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "f36bdaa60a83aca3921b5259d5400cbf5e90fc51931376a9bd4a0eb79aa7210f"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+ "unicode-xid",
+]
+
+[[package]]
+name = "tap"
+version = "1.0.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "55937e1799185b12863d447f42597ed69d9928686b8d88a1df17376a097d8369"
+
+[[package]]
+name = "terminfo"
+version = "0.7.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "76971977e6121664ec1b960d1313aacfa75642adc93b9d4d53b247bd4cb1747e"
+dependencies = [
+ "dirs",
+ "fnv",
+ "nom",
+ "phf",
+ "phf_codegen",
+]
+
+[[package]]
+name = "thiserror"
+version = "1.0.30"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "854babe52e4df1653706b98fcfc05843010039b406875930a70e4d9644e5c417"
+dependencies = [
+ "thiserror-impl",
+]
+
+[[package]]
+name = "thiserror-impl"
+version = "1.0.30"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "aa32fd3f627f367fe16f893e2597ae3c05020f8bba2666a4e6ea73d377e5714b"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "thread_local"
+version = "1.1.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5516c27b78311c50bf42c071425c560ac799b11c30b31f87e3081965fe5e0180"
+dependencies = [
+ "once_cell",
+]
+
+[[package]]
+name = "time"
+version = "0.3.9"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "c2702e08a7a860f005826c6815dcac101b19b5eb330c27fe4a5928fec1d20ddd"
+dependencies = [
+ "itoa",
+ "libc",
+ "num_threads",
+ "time-macros",
+]
+
+[[package]]
+name = "time-macros"
+version = "0.2.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "42657b1a6f4d817cda8e7a0ace261fe0cc946cf3a80314390b22cc61ae080792"
+
+[[package]]
+name = "tinyvec"
+version = "1.5.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2c1c1d5a42b6245520c249549ec267180beaffcc0615401ac8e31853d4b6d8d2"
+dependencies = [
+ "tinyvec_macros",
+]
+
+[[package]]
+name = "tinyvec_macros"
+version = "0.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "cda74da7e1a664f795bb1f8a87ec406fb89a02522cf6e50620d016add6dbbf5c"
+
+[[package]]
+name = "tokio"
+version = "1.17.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2af73ac49756f3f7c01172e34a23e5d0216f6c32333757c2c61feb2bbff5a5ee"
+dependencies = [
+ "libc",
+ "mio",
+ "pin-project-lite",
+ "socket2",
+ "tokio-macros",
+ "winapi",
+]
+
+[[package]]
+name = "tokio-macros"
+version = "1.7.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b557f72f448c511a979e2564e55d74e6c4432fc96ff4f6241bc6bded342643b7"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "toml"
+version = "0.5.9"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8d82e1a7758622a465f8cee077614c73484dac5b836c02ff6a40d5d1010324d7"
+dependencies = [
+ "serde",
+]
+
+[[package]]
+name = "tower-service"
+version = "0.3.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "360dfd1d6d30e05fda32ace2c8c70e9c0a9da713275777f5a4dbb8a1893930c6"
+
+[[package]]
+name = "tracing"
+version = "0.1.32"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "4a1bdf54a7c28a2bbf701e1d2233f6c77f473486b94bee4f9678da5a148dca7f"
+dependencies = [
+ "cfg-if 1.0.0",
+ "pin-project-lite",
+ "tracing-attributes",
+ "tracing-core",
+]
+
+[[package]]
+name = "tracing-appender"
+version = "0.2.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "09d48f71a791638519505cefafe162606f706c25592e4bde4d97600c0195312e"
+dependencies = [
+ "crossbeam-channel",
+ "time",
+ "tracing-subscriber",
+]
+
+[[package]]
+name = "tracing-attributes"
+version = "0.1.20"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "2e65ce065b4b5c53e73bb28912318cb8c9e9ad3921f1d669eb0e68b4c8143a2b"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+]
+
+[[package]]
+name = "tracing-core"
+version = "0.1.24"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "90442985ee2f57c9e1b548ee72ae842f4a9a20e3f417cc38dbc5dc684d9bb4ee"
+dependencies = [
+ "lazy_static",
+ "valuable",
+]
+
+[[package]]
+name = "tracing-subscriber"
+version = "0.3.10"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "b9df98b037d039d03400d9dd06b0f8ce05486b5f25e9a2d7d36196e142ebbc52"
+dependencies = [
+ "ansi_term",
+ "lazy_static",
+ "matchers",
+ "regex",
+ "sharded-slab",
+ "thread_local",
+ "time",
+ "tracing",
+ "tracing-core",
+]
+
+[[package]]
+name = "try-lock"
+version = "0.2.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "59547bce71d9c38b83d9c0e92b6066c4253371f15005def0c30d9657f50c7642"
+
+[[package]]
+name = "typenum"
+version = "1.15.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "dcf81ac59edc17cc8697ff311e8f5ef2d99fcbd9817b34cec66f90b6c3dfd987"
+
+[[package]]
+name = "uint"
+version = "0.9.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "12f03af7ccf01dd611cc450a0d10dbc9b745770d096473e2faf0ca6e2d66d1e0"
+dependencies = [
+ "byteorder",
+ "crunchy",
+ "hex",
+ "static_assertions",
+]
+
+[[package]]
+name = "unicode-normalization"
+version = "0.1.19"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d54590932941a9e9266f0832deed84ebe1bf2e4c9e4a3554d393d18f5e854bf9"
+dependencies = [
+ "tinyvec",
+]
+
+[[package]]
+name = "unicode-xid"
+version = "0.2.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "8ccb82d61f80a663efe1f787a51b16b5a51e3314d6ac365b08639f52387b33f3"
+
+[[package]]
+name = "universal-hash"
+version = "0.4.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9f214e8f697e925001e66ec2c6e37a4ef93f0f78c2eed7814394e10c62025b05"
+dependencies = [
+ "generic-array",
+ "subtle",
+]
+
+[[package]]
+name = "untrusted"
+version = "0.7.1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "a156c684c91ea7d62626509bce3cb4e1d9ed5c4d978f7b4352658f96a4c26b4a"
+
+[[package]]
+name = "valuable"
+version = "0.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "830b7e5d4d90034032940e4ace0d9a9a057e7a45cd94e6c007832e39edb82f6d"
+
+[[package]]
+name = "version_check"
+version = "0.9.4"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "49874b5167b65d7193b8aba1567f5c7d93d001cafc34600cee003eda787e483f"
+
+[[package]]
+name = "want"
+version = "0.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "1ce8a968cb1cd110d136ff8b819a556d6fb6d919363c61534f6860c7eb172ba0"
+dependencies = [
+ "log",
+ "try-lock",
+]
+
+[[package]]
+name = "wasi"
+version = "0.9.0+wasi-snapshot-preview1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "cccddf32554fecc6acb585f82a32a72e28b48f8c4c1883ddfeeeaa96f7d8e519"
+
+[[package]]
+name = "wasi"
+version = "0.10.2+wasi-snapshot-preview1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "fd6fbd9a79829dd1ad0cc20627bf1ed606756a7f77edff7b66b7064f9cb327c6"
+
+[[package]]
+name = "wasi"
+version = "0.11.0+wasi-snapshot-preview1"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9c8d87e72b64a3b4db28d11ce29237c246188f4f51057d65a7eab63b7987e423"
+
+[[package]]
+name = "wasm-bindgen"
+version = "0.2.80"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "27370197c907c55e3f1a9fbe26f44e937fe6451368324e009cba39e139dc08ad"
+dependencies = [
+ "cfg-if 1.0.0",
+ "wasm-bindgen-macro",
+]
+
+[[package]]
+name = "wasm-bindgen-backend"
+version = "0.2.80"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "53e04185bfa3a779273da532f5025e33398409573f348985af9a1cbf3774d3f4"
+dependencies = [
+ "bumpalo",
+ "lazy_static",
+ "log",
+ "proc-macro2",
+ "quote",
+ "syn",
+ "wasm-bindgen-shared",
+]
+
+[[package]]
+name = "wasm-bindgen-macro"
+version = "0.2.80"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "17cae7ff784d7e83a2fe7611cfe766ecf034111b49deb850a3dc7699c08251f5"
+dependencies = [
+ "quote",
+ "wasm-bindgen-macro-support",
+]
+
+[[package]]
+name = "wasm-bindgen-macro-support"
+version = "0.2.80"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "99ec0dc7a4756fffc231aab1b9f2f578d23cd391390ab27f952ae0c9b3ece20b"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+ "wasm-bindgen-backend",
+ "wasm-bindgen-shared",
+]
+
+[[package]]
+name = "wasm-bindgen-shared"
+version = "0.2.80"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d554b7f530dee5964d9a9468d95c1f8b8acae4f282807e7d27d4b03099a46744"
+
+[[package]]
+name = "web-sys"
+version = "0.3.57"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "7b17e741662c70c8bd24ac5c5b18de314a2c26c32bf8346ee1e6f53de919c283"
+dependencies = [
+ "js-sys",
+ "wasm-bindgen",
+]
+
+[[package]]
+name = "which"
+version = "4.2.5"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5c4fb54e6113b6a8772ee41c3404fb0301ac79604489467e0a9ce1f3e97c24ae"
+dependencies = [
+ "either",
+ "lazy_static",
+ "libc",
+]
+
+[[package]]
+name = "winapi"
+version = "0.3.9"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "5c839a674fcd7a98952e593242ea400abe93992746761e38641405d28b00f419"
+dependencies = [
+ "winapi-i686-pc-windows-gnu",
+ "winapi-x86_64-pc-windows-gnu",
+]
+
+[[package]]
+name = "winapi-i686-pc-windows-gnu"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "ac3b87c63620426dd9b991e5ce0329eff545bccbbb34f3be09ff6fb6ab51b7b6"
+
+[[package]]
+name = "winapi-x86_64-pc-windows-gnu"
+version = "0.4.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "712e227841d057c1ee1cd2fb22fa7e5a5461ae8e48fa2ca79ec42cfc1931183f"
+
+[[package]]
+name = "wyz"
+version = "0.5.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "30b31594f29d27036c383b53b59ed3476874d518f0efb151b27a4c275141390e"
+dependencies = [
+ "tap",
+]
+
+[[package]]
+name = "zcash_address"
+version = "0.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d1322a31b757f0087f110cc4a85dc5c6ccf83d0533bac04c4d3d1ce9112cc602"
+dependencies = [
+ "bech32",
+ "bs58",
+ "f4jumble",
+ "zcash_encoding",
+]
+
+[[package]]
+name = "zcash_encoding"
+version = "0.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "9fb61ea88eb539bc0ac2068e5da99411dd4978595b3d7ff6a4b1562ddc8e8710"
+dependencies = [
+ "byteorder",
+ "nonempty",
+]
+
+[[package]]
+name = "zcash_history"
+version = "0.3.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "eb611a28a4e13ac715ee712f4344d6b279b767daf6345dafefb2c4bf582b6679"
+dependencies = [
+ "blake2b_simd 1.0.0",
+ "byteorder",
+ "primitive-types",
+]
+
+[[package]]
+name = "zcash_note_encryption"
+version = "0.1.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "33f84ae538f05a8ac74c82527f06b77045ed9553a0871d9db036166a4c344e3a"
+dependencies = [
+ "chacha20",
+ "chacha20poly1305",
+ "rand_core 0.6.3",
+ "subtle",
+]
+
+[[package]]
+name = "zcash_primitives"
+version = "0.6.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "dcb1ef5719fb24b42450dcd6b10e6155793be5668f0d962ad8132b6e4d108635"
+dependencies = [
+ "aes",
+ "bip0039",
+ "bitvec",
+ "blake2b_simd 1.0.0",
+ "blake2s_simd",
+ "bls12_381",
+ "bs58",
+ "byteorder",
+ "chacha20poly1305",
+ "equihash",
+ "ff",
+ "fpe",
+ "group",
+ "hdwallet",
+ "hex",
+ "incrementalmerkletree",
+ "jubjub",
+ "lazy_static",
+ "memuse",
+ "nonempty",
+ "orchard",
+ "rand 0.8.5",
+ "rand_core 0.6.3",
+ "ripemd",
+ "secp256k1",
+ "sha2",
+ "subtle",
+ "zcash_encoding",
+ "zcash_note_encryption",
+]
+
+[[package]]
+name = "zcash_proofs"
+version = "0.6.0"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "e67054525b4897a97386ce562240f08ac9bcad07183130fe8d797224d712112d"
+dependencies = [
+ "bellman",
+ "blake2b_simd 1.0.0",
+ "bls12_381",
+ "byteorder",
+ "directories",
+ "ff",
+ "group",
+ "jubjub",
+ "lazy_static",
+ "rand_core 0.6.3",
+ "zcash_primitives",
+]
+
+[[package]]
+name = "zeroize"
+version = "1.4.3"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "d68d9dcec5f9b43a30d38c49f91dfedfaac384cb8f085faca366c26207dd1619"
+dependencies = [
+ "zeroize_derive",
+]
+
+[[package]]
+name = "zeroize_derive"
+version = "1.3.2"
+source = "registry+https://github.com/rust-lang/crates.io-index"
+checksum = "3f8f187641dad4f680d25c4bfc4225b418165984179f26ca76ec4fb6441d3a17"
+dependencies = [
+ "proc-macro2",
+ "quote",
+ "syn",
+ "synstructure",
+]
diff --git a/depend/zcash/INSTALL b/depend/zcash/INSTALL
new file mode 100644
index 000000000..eecfe36e1
--- /dev/null
+++ b/depend/zcash/INSTALL
@@ -0,0 +1,5 @@
+Building Zcash
+
+See the Zcash documentation wiki (https://zcash.readthedocs.io/en/latest/rtd_pages/user_guide.html) for instructions on building zcashd,
+the intended-for-services, no-graphical-interface, reference
+implementation of Zcash.
diff --git a/depend/zcash/Makefile.am b/depend/zcash/Makefile.am
new file mode 100644
index 000000000..d5a8eac63
--- /dev/null
+++ b/depend/zcash/Makefile.am
@@ -0,0 +1,176 @@
+# Copyright (c) 2016-2019 The Zcash developers
+# Copyright (c) 2013-2019 The Bitcoin Core developers
+# Copyright (c) 2013-2019 Bitcoin Developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+# Pattern rule to print variables, e.g. make print-top_srcdir
+print-%:
+	@echo $* = $($*)
+
+ACLOCAL_AMFLAGS = -I build-aux/m4
+SUBDIRS = src
+if ENABLE_MAN
+SUBDIRS += doc/man
+endif
+.PHONY: deploy FORCE
+
+GZIP_ENV="-9n"
+
+if BUILD_BITCOIN_LIBS
+pkgconfigdir = $(libdir)/pkgconfig
+pkgconfig_DATA = libzcash_script.pc
+endif
+
+BITCOIND_BIN=$(top_builddir)/src/$(BITCOIN_DAEMON_NAME)$(EXEEXT)
+BITCOIN_CLI_BIN=$(top_builddir)/src/$(BITCOIN_CLI_NAME)$(EXEEXT)
+
+DIST_DOCS = $(wildcard doc/*.md) $(wildcard doc/release-notes/*.md)
+
+BIN_CHECKS=$(top_srcdir)/contrib/devtools/symbol-check.py \
+           $(top_srcdir)/contrib/devtools/security-check.py
+
+COVERAGE_INFO = baseline_filtered_combined.info baseline.info \
+  leveldb_baseline.info test_bitcoin_filtered.info total_coverage.info \
+  baseline_filtered.info \
+  leveldb_baseline_filtered.info test_bitcoin_coverage.info test_bitcoin.info \
+  zcash-gtest.info zcash-gtest_filtered.info zcash-gtest_coverage.info
+
+dist-hook:
+	-$(GIT) archive --format=tar HEAD -- src/clientversion.cpp | $(AMTAR) -C $(top_distdir) -xf -
+
+$(if $(findstring src/,$(MAKECMDGOALS)),$(MAKECMDGOALS), none): FORCE
+	$(MAKE) -C src $(patsubst src/%,%,$@)
+
+$(BITCOIND_BIN): FORCE
+	$(MAKE) -C src $(@F)
+
+$(BITCOIN_CLI_BIN): FORCE
+	$(MAKE) -C src $(@F)
+
+check-security: FORCE
+	$(MAKE) -C src check-security
+
+check-symbols: FORCE
+	$(MAKE) -C src check-symbols
+
+if USE_LCOV
+
+baseline.info:
+	$(LCOV) -c -i -d $(abs_builddir)/src -o $@
+
+baseline_filtered.info: baseline.info
+	$(LCOV) -r $< "/usr/include/*" \
+                      "$(abs_builddir)/depends/x86_64-pc-linux-gnu/include/*.h" \
+                      "$(abs_builddir)/depends/x86_64-pc-linux-gnu/include/boost/*" \
+                      "$(abs_builddir)/depends/x86_64-pc-linux-gnu/include/gmock/*" \
+                      "$(abs_builddir)/depends/x86_64-pc-linux-gnu/include/gtest/*" \
+                      "$(abs_builddir)/src/gtest/*" \
+                      "$(abs_builddir)/src/test/*" \
+                      "$(abs_builddir)/src/wallet/gtest/*" \
+                      "$(abs_builddir)/src/wallet/test/*" \
+                      -o $@
+
+leveldb_baseline.info: baseline_filtered.info
+	$(LCOV) -c -i -d $(abs_builddir)/src/leveldb -b $(abs_builddir)/src/leveldb -o $@
+
+leveldb_baseline_filtered.info: leveldb_baseline.info
+	$(LCOV) -r $< "/usr/include/*" \
+                      "$(abs_builddir)/depends/x86_64-pc-linux-gnu/include/*.h" \
+                      "$(abs_builddir)/depends/x86_64-pc-linux-gnu/include/boost/*" \
+                      "$(abs_builddir)/depends/x86_64-pc-linux-gnu/include/gmock/*" \
+                      "$(abs_builddir)/depends/x86_64-pc-linux-gnu/include/gtest/*" \
+                      "$(abs_builddir)/src/gtest/*" \
+                      "$(abs_builddir)/src/test/*" \
+                      "$(abs_builddir)/src/wallet/gtest/*" \
+                      "$(abs_builddir)/src/wallet/test/*" \
+                      -o $@
+
+baseline_filtered_combined.info: leveldb_baseline_filtered.info baseline_filtered.info
+	$(LCOV) -a leveldb_baseline_filtered.info -a baseline_filtered.info -o $@
+
+test_bitcoin.info: baseline_filtered_combined.info
+	$(MAKE) -C src/ bitcoin_test_check
+	$(LCOV) -c -d $(abs_builddir)/src -t test_bitcoin -o $@
+	$(LCOV) -z -d $(abs_builddir)/src
+	$(LCOV) -z -d $(abs_builddir)/src/leveldb
+
+test_bitcoin_filtered.info: test_bitcoin.info
+	$(LCOV) -r $< "/usr/include/*" \
+                      "$(abs_builddir)/depends/x86_64-pc-linux-gnu/include/*.h" \
+                      "$(abs_builddir)/depends/x86_64-pc-linux-gnu/include/boost/*" \
+                      "$(abs_builddir)/depends/x86_64-pc-linux-gnu/include/gmock/*" \
+                      "$(abs_builddir)/depends/x86_64-pc-linux-gnu/include/gtest/*" \
+                      "$(abs_builddir)/src/gtest/*" \
+                      "$(abs_builddir)/src/test/*" \
+                      "$(abs_builddir)/src/wallet/gtest/*" \
+                      "$(abs_builddir)/src/wallet/test/*" \
+                      -o $@
+
+zcash-gtest.info: baseline_filtered_combined.info
+	$(MAKE) -C src/ zcash-gtest_check
+	$(LCOV) -c -d $(abs_builddir)/src -t zcash-gtest -o $@
+	$(LCOV) -z -d $(abs_builddir)/src
+	$(LCOV) -z -d $(abs_builddir)/src/leveldb
+
+zcash-gtest_filtered.info: zcash-gtest.info
+	$(LCOV) -r $< "/usr/include/*" \
+                      "$(abs_builddir)/depends/x86_64-pc-linux-gnu/include/*.h" \
+                      "$(abs_builddir)/depends/x86_64-pc-linux-gnu/include/boost/*" \
+                      "$(abs_builddir)/depends/x86_64-pc-linux-gnu/include/gmock/*" \
+                      "$(abs_builddir)/depends/x86_64-pc-linux-gnu/include/gtest/*" \
+                      "$(abs_builddir)/src/gtest/*" \
+                      "$(abs_builddir)/src/test/*" \
+                      "$(abs_builddir)/src/wallet/gtest/*" \
+                      "$(abs_builddir)/src/wallet/test/*" \
+                      -o $@
+
+test_bitcoin_coverage.info: baseline_filtered_combined.info test_bitcoin_filtered.info
+	$(LCOV) -a baseline_filtered.info -a leveldb_baseline_filtered.info -a test_bitcoin_filtered.info -o $@
+
+zcash-gtest_coverage.info: baseline_filtered_combined.info zcash-gtest_filtered.info
+	$(LCOV) -a baseline_filtered.info -a leveldb_baseline_filtered.info -a zcash-gtest_filtered.info -o $@
+
+total_coverage.info:  baseline_filtered_combined.info test_bitcoin_filtered.info zcash-gtest_filtered.info
+	$(LCOV) -a baseline_filtered.info -a leveldb_baseline_filtered.info -a test_bitcoin_filtered.info -a zcash-gtest_filtered.info -o $@ | $(GREP) "\%" | $(AWK) '{ print substr($$3,2,50) "/" $$5 }' > coverage_percent.txt
+
+test_bitcoin.coverage/.dirstamp:  test_bitcoin_coverage.info
+	$(GENHTML) -s $< -o $(@D)
+	@touch $@
+
+zcash-gtest.coverage/.dirstamp:  zcash-gtest_coverage.info
+	$(GENHTML) -s $< -o $(@D)
+	@touch $@
+
+cov-zcash: zcash-gtest.coverage/.dirstamp
+
+total.coverage/.dirstamp: total_coverage.info
+	$(GENHTML) -s $< -o $(@D)
+	@touch $@
+
+cov: test_bitcoin.coverage/.dirstamp cov-zcash total.coverage/.dirstamp
+
+endif
+
+dist_bin_SCRIPTS = zcutil/fetch-params.sh
+dist_noinst_SCRIPTS = autogen.sh zcutil/build-debian-package.sh zcutil/build.sh
+
+RUST_DIST = $(top_srcdir)/.cargo $(top_srcdir)/Cargo.toml $(top_srcdir)/Cargo.lock rust-toolchain
+
+EXTRA_DIST = $(top_srcdir)/share/genbuild.sh qa/pull-tester/rpc-tests.py qa/rpc-tests qa/zcash $(DIST_DOCS) $(BIN_CHECKS) $(RUST_DIST)
+
+install-exec-hook:
+	mv $(DESTDIR)$(bindir)/fetch-params.sh $(DESTDIR)$(bindir)/zcash-fetch-params
+
+.INTERMEDIATE: $(COVERAGE_INFO)
+
+DISTCHECK_CONFIGURE_FLAGS = --enable-man
+
+clean-local:
+	rm -rf test_bitcoin.coverage/ zcash-gtest.coverage/ total.coverage/
+	rm -rf afl-temp
+	rm -rf qa/pull-tester/__pycache__
+
+distclean-local:
+	rm -f zcutil/bin/db_*
+	rmdir zcutil/bin 2>/dev/null || true
diff --git a/depend/zcash/README.md b/depend/zcash/README.md
new file mode 100644
index 000000000..016b0b7a2
--- /dev/null
+++ b/depend/zcash/README.md
@@ -0,0 +1,66 @@
+Zcash 5.0.0
+<img align="right" width="120" height="80" src="doc/imgs/logo.png">
+===========
+
+What is Zcash?
+--------------
+
+[Zcash](https://z.cash/) is an implementation of the "Zerocash" protocol.
+Based on Bitcoin's code, Zcash intends to offer a far higher standard of privacy
+through a sophisticated zero-knowledge proving scheme that preserves
+confidentiality of transaction metadata. More technical details are available
+in our [Protocol Specification](https://zips.z.cash/protocol/protocol.pdf).
+
+This software is the Zcash client. It downloads and stores the entire history
+of Zcash transactions; depending on the speed of your computer and network
+connection, the synchronization process could take a day or more once the
+blockchain has reached a significant size.
+
+<p align="center">
+  <img src="doc/imgs/zcashd_screen.gif" height="500">
+</p>
+
+#### :lock: Security Warnings
+
+See important security warnings on the
+[Security Information page](https://z.cash/support/security/).
+
+**Zcash is experimental and a work in progress.** Use it at your own risk.
+
+####  :ledger: Deprecation Policy
+
+This release is considered deprecated 16 weeks after the release day. There
+is an automatic deprecation shutdown feature which will halt the node some
+time after this 16-week period. The automatic feature is based on block
+height.
+
+## Getting Started
+
+Please see our [user guide](https://zcash.readthedocs.io/en/latest/rtd_pages/rtd_docs/user_guide.html) for joining the main Zcash network.
+
+### Need Help?
+
+* :blue_book: See the documentation at the [ReadTheDocs](https://zcash.readthedocs.io)
+  for help and more information.
+* :incoming_envelope: Ask for help on the [Zcash](https://forum.z.cash/) forum.
+* :speech_balloon: Join our community on [Discord](https://discordapp.com/invite/PhJY6Pm)
+
+Participation in the Zcash project is subject to a
+[Code of Conduct](code_of_conduct.md).
+
+### Building
+
+Build Zcash along with most dependencies from source by running the following command:
+
+```
+./zcutil/build.sh -j$(nproc)
+```
+
+Currently, Zcash is only officially supported on Debian and Ubuntu. See the
+[Debian / Ubuntu build](https://zcash.readthedocs.io/en/latest/rtd_pages/Debian-Ubuntu-build.html)
+for detailed instructions.
+
+License
+-------
+
+For license information see the file [COPYING](COPYING).
diff --git a/depend/zcash/SECURITY.md b/depend/zcash/SECURITY.md
new file mode 100644
index 000000000..22f991c92
--- /dev/null
+++ b/depend/zcash/SECURITY.md
@@ -0,0 +1,66 @@
+This page is copyright The Electric Coin Company, 2019. It is posted in order to conform to this standard: https://github.com/RD-Crypto-Spec/Responsible-Disclosure/tree/d47a5a3dafa5942c8849a93441745fdd186731e6
+
+# Security Disclosures
+## Receiving Disclosures
+
+The Electric Coin Company is committed to working with researchers who submit security vulnerability notifications to us to resolve those issues on an appropriate timeline and perform a coordinated release, giving credit to the reporter if they would like.
+
+Please submit issues to security@z.cash, using the following PGP key:
+
+```
+-----BEGIN PGP PUBLIC KEY BLOCK-----
+
+mQENBFaegcoBCAC+G82ZBYYm1GoVn4dKa0WiLYD/Q+BuU89PS1X7A4eOOy8g9yS4
+wJKMzB0AxFsH/t85P7pPZwHw3i2gmiJKeIqEGhEBL08D3id2u6ZyCnwDuWs0i6My
+MXWTwK5shvE61ZI/KPbjemoOG6MPF5QdrouNqei2Vk+4RjbRCyyS0A59GQi2dNZX
+BMwTnHnUZ5qi6T0RFelqJ3dE5Nc/UwJPdAcg71c3b3dMOHjaDBMPB6+fTLBeidV6
+5B72nGO3eIYkMUNj+qCQmM/esRkmGmlDH/9WGMBOKCq7Yw3LyEoPOi5cba1m8SN2
+xFlNzkUGrlVrwZMF+1UdjvN7BGDypA3Dr/STABEBAAG0JVpjYXNoIFNlY3VyaXR5
+IFRlYW0gPHNlY3VyaXR5QHouY2FzaD6JATcEEwEIACEFAlaegcoCGwMFCwkIBwIG
+FQgJCgsCBBYCAwECHgECF4AACgkQiPuLhti1poxlRAf/bZ6fhUby5bAbViAO4TzQ
+yfbD0ksGeF8MHicPz7HqOYuXAE9GrKnVAOFptwRo94O+iRC5aXhW8OAP+38IWorv
+gsAuag7Y8k0nlfNdrJRqqJpjyxtiuv+cd2o5dre8E9PVNE5IPv9qEJA4Zag3snmC
+a+O4HAqKeXYddunFq2drLkTRlOwuFkGXJzwi3VSNVYCuuGyezFDuaD45ltmsXgid
+jZSdnnc6L1BrEd9LVzahvFV0+fT4bNKQHQDk+f0RTnHed+m9NqAoC9K8ftPTQ/i4
+5+W/dXJATztWDrJ7ZevHXGR+RAhMNsT1psvnQsJzMkUz1GMdQOtk4PfuZLGSIiTM
+ErkBDQRWnoHKAQgAp+w+xsPJWFdadE6Ok1aZC0Lk1J9xU/cqX1aBlkwi5SynwOkV
+Eg1xNHLJMelp13bgDjLRsvaMbsseaCVk3goNln4atNbZpqz6FoM/f8pJx52LFD0j
+CFFOVUlGEF0h+KdFr+3JHI+mg+3ifXTD4Dajj4lpu8kR/FQjftcxyttByz01wLRO
+sK5BDC856WzHXAJuX6TpX4sGJujzKoLXR5V0SkUopqn9g4aJGnWuNh4kyOQI6fd7
+YZyPZhWDrXdgInCKAKAgq8r6hgSDMYFvmflp6+reCfeOe1VFF8q3Foio02YPIrQW
+WjjH0w6nOvOKCEtxistz1sP6ZoYq4gR41LOwIQARAQABiQEfBBgBCAAJBQJWnoHK
+AhsMAAoJEIj7i4bYtaaMiA4IALIy4xP/Btu86yT3b53t8cfYZddFSO8Nlg+y3EMu
+1LchdSOpWgpXCvQ7d4ndWGsuBSmQ+jaRwU2UIkq2iIxf5cg63dJz9grAcF6MXCrO
+t5BSowFC4m3RFaEaG6G6SjDVIA0ZEdEMFd9Gzc1ikqbVLyNuJXKmzz0evvbAJgVO
+D0nht5ifwLjQxM4olvYHUwtT0wPhniH69ghFo8LQiMgncjaukDzbgANiuj07QYy/
+DlzhQUsp1qZvqZnVKqUJ3lFb86b6zoqoRNiUnvP9JB2v3kLG0T39UlcXUFnZJ/4H
+CDHCrwSovQRMHtoOWZijBNobO2y1d0FkUpzNlNw44Ssw0Vo=
+=6GYS
+-----END PGP PUBLIC KEY BLOCK-----
+```
+
+## Sending Disclosures
+
+In the case where we become aware of security issues affecting other projects that has never affected Zcash, our intention is to inform those projects of security issues on a best effort basis.
+
+In the case where we fix a security issue in Zcash that also affects the following neighboring projects, our intention is to engage in responsible disclosures with them as described in https://github.com/RD-Crypto-Spec/Responsible-Disclosure, subject to the deviations described in the section at the bottom of this document.
+
+## Bilateral Responsible Disclosure Agreements
+
+We have set up agreements with the following neighboring projects to share vulnerability information, subject to the deviations described in the next section.
+
+Specifically, we have agreed to engage in responsible disclosures for security issues affecting this repository with the following contacts:
+
+- Zcash Foundation https://github.com/ZcashFoundation/zebra/security/policy
+- Horizen security@horizen.com via PGP
+- Komodo ca333@komodoplatform.com via PGP
+- BitcoinABC https://github.com/Bitcoin-ABC/bitcoin-abc/blob/master/DISCLOSURE_POLICY.md
+
+## Deviations from the Standard
+
+Zcash is a technology that provides strong privacy. Notes are encrypted to their destination, and then the monetary base is kept via zero-knowledge proofs intended to only be creatable by the real holder of Zcash. If this fails, and a counterfeiting bug results, that counterfeiting bug might be exploited without any way for blockchain analyzers to identify the perpetrator or which data in the blockchain has been used to exploit the bug. Rollbacks before that point, such as have been executed in some other projects in such cases, are therefore impossible.
+
+The standard describes reporters of vulnerabilities including full details of an issue, in order to reproduce it. This is necessary for instance in the case of an external researcher both demonstrating and proving that there really is a security issue, and that security issue really has the impact that they say it has - allowing the development team to accurately prioritize and resolve the issue.
+
+In the case of a counterfeiting bug, however, just like in CVE-2019-7167, we might decide not to include those details with our reports to partners ahead of coordinated release, so long as we are sure that they are vulnerable.
+
diff --git a/depend/zcash/autogen.sh b/depend/zcash/autogen.sh
new file mode 100755
index 000000000..69a20dc46
--- /dev/null
+++ b/depend/zcash/autogen.sh
@@ -0,0 +1,16 @@
+#!/bin/sh
+# Copyright (c) 2016-2019 The Zcash developers
+# Copyright (c) 2013-2019 The Bitcoin Core developers
+# Copyright (c) 2013-2019 Bitcoin Developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+export LC_ALL=C
+set -e
+srcdir="$(dirname $0)"
+cd "$srcdir"
+if [ -z ${LIBTOOLIZE} ] && GLIBTOOLIZE="$(command -v glibtoolize)"; then
+  LIBTOOLIZE="${GLIBTOOLIZE}"
+  export LIBTOOLIZE
+fi
+autoreconf --install --force --warnings=all
diff --git a/depend/zcash/build-aux/m4/ax_boost_base.m4 b/depend/zcash/build-aux/m4/ax_boost_base.m4
new file mode 100644
index 000000000..296e05558
--- /dev/null
+++ b/depend/zcash/build-aux/m4/ax_boost_base.m4
@@ -0,0 +1,291 @@
+# ===========================================================================
+#       http://www.gnu.org/software/autoconf-archive/ax_boost_base.html
+# ===========================================================================
+#
+# SYNOPSIS
+#
+#   AX_BOOST_BASE([MINIMUM-VERSION], [ACTION-IF-FOUND], [ACTION-IF-NOT-FOUND])
+#
+# DESCRIPTION
+#
+#   Test for the Boost C++ libraries of a particular version (or newer)
+#
+#   If no path to the installed boost library is given the macro searches
+#   under /usr, /usr/local, /opt and /opt/local and evaluates the
+#   $BOOST_ROOT environment variable. Further documentation is available at
+#   <http://randspringer.de/boost/index.html>.
+#
+#   This macro calls:
+#
+#     AC_SUBST(BOOST_CPPFLAGS) / AC_SUBST(BOOST_LDFLAGS)
+#
+#   And sets:
+#
+#     HAVE_BOOST
+#
+# LICENSE
+#
+#   Copyright (c) 2008 Thomas Porschberg <thomas@randspringer.de>
+#   Copyright (c) 2009 Peter Adolphs
+#
+#   Copying and distribution of this file, with or without modification, are
+#   permitted in any medium without royalty provided the copyright notice
+#   and this notice are preserved. This file is offered as-is, without any
+#   warranty.
+
+#serial 26
+
+AC_DEFUN([AX_BOOST_BASE],
+[
+AC_ARG_WITH([boost],
+  [AS_HELP_STRING([--with-boost@<:@=ARG@:>@],
+    [use Boost library from a standard location (ARG=yes),
+     from the specified location (ARG=<path>),
+     or disable it (ARG=no)
+     @<:@ARG=yes@:>@ ])],
+    [
+    if test "$withval" = "no"; then
+        want_boost="no"
+    elif test "$withval" = "yes"; then
+        want_boost="yes"
+        ac_boost_path=""
+    else
+        want_boost="yes"
+        ac_boost_path="$withval"
+    fi
+    ],
+    [want_boost="yes"])
+
+
+AC_ARG_WITH([boost-libdir],
+        AS_HELP_STRING([--with-boost-libdir=LIB_DIR],
+        [Force given directory for boost libraries. Note that this will override library path detection, so use this parameter only if default library detection fails and you know exactly where your boost libraries are located.]),
+        [
+        if test -d "$withval"
+        then
+                ac_boost_lib_path="$withval"
+        else
+                AC_MSG_ERROR(--with-boost-libdir expected directory name)
+        fi
+        ],
+        [ac_boost_lib_path=""]
+)
+
+if test "x$want_boost" = "xyes"; then
+    boost_lib_version_req=ifelse([$1], ,1.20.0,$1)
+    boost_lib_version_req_shorten=`expr $boost_lib_version_req : '\([[0-9]]*\.[[0-9]]*\)'`
+    boost_lib_version_req_major=`expr $boost_lib_version_req : '\([[0-9]]*\)'`
+    boost_lib_version_req_minor=`expr $boost_lib_version_req : '[[0-9]]*\.\([[0-9]]*\)'`
+    boost_lib_version_req_sub_minor=`expr $boost_lib_version_req : '[[0-9]]*\.[[0-9]]*\.\([[0-9]]*\)'`
+    if test "x$boost_lib_version_req_sub_minor" = "x" ; then
+        boost_lib_version_req_sub_minor="0"
+        fi
+    WANT_BOOST_VERSION=`expr $boost_lib_version_req_major \* 100000 \+  $boost_lib_version_req_minor \* 100 \+ $boost_lib_version_req_sub_minor`
+    AC_MSG_CHECKING(for boostlib >= $boost_lib_version_req)
+    succeeded=no
+
+    dnl On 64-bit systems check for system libraries in both lib64 and lib.
+    dnl The former is specified by FHS, but e.g. Debian does not adhere to
+    dnl this (as it rises problems for generic multi-arch support).
+    dnl The last entry in the list is chosen by default when no libraries
+    dnl are found, e.g. when only header-only libraries are installed!
+    libsubdirs="lib"
+    ax_arch=`uname -m`
+    case $ax_arch in
+      x86_64)
+        libsubdirs="lib64 libx32 lib lib64"
+        ;;
+      ppc64|s390x|sparc64|aarch64|ppc64le)
+        libsubdirs="lib64 lib lib64 ppc64le"
+        ;;
+    esac
+
+    dnl allow for real multi-arch paths e.g. /usr/lib/x86_64-linux-gnu. Give
+    dnl them priority over the other paths since, if libs are found there, they
+    dnl are almost assuredly the ones desired.
+    AC_REQUIRE([AC_CANONICAL_HOST])
+    libsubdirs="lib/${host_cpu}-${host_os} $libsubdirs"
+
+    case ${host_cpu} in
+      i?86)
+        libsubdirs="lib/i386-${host_os} $libsubdirs"
+        ;;
+    esac
+
+    dnl some arches may advertise a cpu type that doesn't line up with their
+    dnl prefix's cpu type. For example, uname may report armv7l while libs are
+    dnl installed to /usr/lib/arm-linux-gnueabihf. Try getting the compiler's
+    dnl value for an extra chance of finding the correct path.
+    libsubdirs="lib/`$CXX -dumpmachine 2>/dev/null` $libsubdirs"
+
+    dnl first we check the system location for boost libraries
+    dnl this location is chosen if boost libraries are installed with the --layout=system option
+    dnl or if you install boost with RPM
+    if test "$ac_boost_path" != ""; then
+        BOOST_CPPFLAGS="-I$ac_boost_path/include"
+        for ac_boost_path_tmp in $libsubdirs; do
+                if test -d "$ac_boost_path"/"$ac_boost_path_tmp" ; then
+                        BOOST_LDFLAGS="-L$ac_boost_path/$ac_boost_path_tmp"
+                        break
+                fi
+        done
+    elif test "$cross_compiling" != yes; then
+        for ac_boost_path_tmp in /usr /usr/local /opt /opt/local ; do
+            if test -d "$ac_boost_path_tmp/include/boost" && test -r "$ac_boost_path_tmp/include/boost"; then
+                for libsubdir in $libsubdirs ; do
+                    if ls "$ac_boost_path_tmp/$libsubdir/libboost_"* >/dev/null 2>&1 ; then break; fi
+                done
+                BOOST_LDFLAGS="-L$ac_boost_path_tmp/$libsubdir"
+                BOOST_CPPFLAGS="-I$ac_boost_path_tmp/include"
+                break;
+            fi
+        done
+    fi
+
+    dnl overwrite ld flags if we have required special directory with
+    dnl --with-boost-libdir parameter
+    if test "$ac_boost_lib_path" != ""; then
+       BOOST_LDFLAGS="-L$ac_boost_lib_path"
+    fi
+
+    CPPFLAGS_SAVED="$CPPFLAGS"
+    CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
+    export CPPFLAGS
+
+    LDFLAGS_SAVED="$LDFLAGS"
+    LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
+    export LDFLAGS
+
+    AC_REQUIRE([AC_PROG_CXX])
+    AC_LANG_PUSH(C++)
+        AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[
+    @%:@include <boost/version.hpp>
+    ]], [[
+    #if BOOST_VERSION >= $WANT_BOOST_VERSION
+    // Everything is okay
+    #else
+    #  error Boost version is too old
+    #endif
+    ]])],[
+        AC_MSG_RESULT(yes)
+    succeeded=yes
+    found_system=yes
+        ],[
+        ])
+    AC_LANG_POP([C++])
+
+
+
+    dnl if we found no boost with system layout we search for boost libraries
+    dnl built and installed without the --layout=system option or for a staged(not installed) version
+    if test "x$succeeded" != "xyes"; then
+        CPPFLAGS="$CPPFLAGS_SAVED"
+        LDFLAGS="$LDFLAGS_SAVED"
+        BOOST_CPPFLAGS=
+        BOOST_LDFLAGS=
+        _version=0
+        if test "$ac_boost_path" != ""; then
+            if test -d "$ac_boost_path" && test -r "$ac_boost_path"; then
+                for i in `ls -d $ac_boost_path/include/boost-* 2>/dev/null`; do
+                    _version_tmp=`echo $i | sed "s#$ac_boost_path##" | sed 's/\/include\/boost-//' | sed 's/_/./'`
+                    V_CHECK=`expr $_version_tmp \> $_version`
+                    if test "$V_CHECK" = "1" ; then
+                        _version=$_version_tmp
+                    fi
+                    VERSION_UNDERSCORE=`echo $_version | sed 's/\./_/'`
+                    BOOST_CPPFLAGS="-I$ac_boost_path/include/boost-$VERSION_UNDERSCORE"
+                done
+                dnl if nothing found search for layout used in Windows distributions
+                if test -z "$BOOST_CPPFLAGS"; then
+                    if test -d "$ac_boost_path/boost" && test -r "$ac_boost_path/boost"; then
+                        BOOST_CPPFLAGS="-I$ac_boost_path"
+                    fi
+                fi
+            fi
+        else
+            if test "$cross_compiling" != yes; then
+                for ac_boost_path in /usr /usr/local /opt /opt/local ; do
+                    if test -d "$ac_boost_path" && test -r "$ac_boost_path"; then
+                        for i in `ls -d $ac_boost_path/include/boost-* 2>/dev/null`; do
+                            _version_tmp=`echo $i | sed "s#$ac_boost_path##" | sed 's/\/include\/boost-//' | sed 's/_/./'`
+                            V_CHECK=`expr $_version_tmp \> $_version`
+                            if test "$V_CHECK" = "1" ; then
+                                _version=$_version_tmp
+                                best_path=$ac_boost_path
+                            fi
+                        done
+                    fi
+                done
+
+                VERSION_UNDERSCORE=`echo $_version | sed 's/\./_/'`
+                BOOST_CPPFLAGS="-I$best_path/include/boost-$VERSION_UNDERSCORE"
+                if test "$ac_boost_lib_path" = ""; then
+                    for libsubdir in $libsubdirs ; do
+                        if ls "$best_path/$libsubdir/libboost_"* >/dev/null 2>&1 ; then break; fi
+                    done
+                    BOOST_LDFLAGS="-L$best_path/$libsubdir"
+                fi
+            fi
+
+            if test "x$BOOST_ROOT" != "x"; then
+                for libsubdir in $libsubdirs ; do
+                    if ls "$BOOST_ROOT/stage/$libsubdir/libboost_"* >/dev/null 2>&1 ; then break; fi
+                done
+                if test -d "$BOOST_ROOT" && test -r "$BOOST_ROOT" && test -d "$BOOST_ROOT/stage/$libsubdir" && test -r "$BOOST_ROOT/stage/$libsubdir"; then
+                    version_dir=`expr //$BOOST_ROOT : '.*/\(.*\)'`
+                    stage_version=`echo $version_dir | sed 's/boost_//' | sed 's/_/./g'`
+                        stage_version_shorten=`expr $stage_version : '\([[0-9]]*\.[[0-9]]*\)'`
+                    V_CHECK=`expr $stage_version_shorten \>\= $_version`
+                    if test "$V_CHECK" = "1" -a "$ac_boost_lib_path" = "" ; then
+                        AC_MSG_NOTICE(We will use a staged boost library from $BOOST_ROOT)
+                        BOOST_CPPFLAGS="-I$BOOST_ROOT"
+                        BOOST_LDFLAGS="-L$BOOST_ROOT/stage/$libsubdir"
+                    fi
+                fi
+            fi
+        fi
+
+        CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
+        export CPPFLAGS
+        LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
+        export LDFLAGS
+
+        AC_LANG_PUSH(C++)
+            AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[
+        @%:@include <boost/version.hpp>
+        ]], [[
+        #if BOOST_VERSION >= $WANT_BOOST_VERSION
+        // Everything is okay
+        #else
+        #  error Boost version is too old
+        #endif
+        ]])],[
+            AC_MSG_RESULT(yes)
+        succeeded=yes
+        found_system=yes
+            ],[
+            ])
+        AC_LANG_POP([C++])
+    fi
+
+    if test "$succeeded" != "yes" ; then
+        if test "$_version" = "0" ; then
+            AC_MSG_NOTICE([[We could not detect the boost libraries (version $boost_lib_version_req_shorten or higher). If you have a staged boost library (still not installed) please specify \$BOOST_ROOT in your environment and do not give a PATH to --with-boost option.  If you are sure you have boost installed, then check your version number looking in <boost/version.hpp>. See http://randspringer.de/boost for more documentation.]])
+        else
+            AC_MSG_NOTICE([Your boost libraries seems to old (version $_version).])
+        fi
+        # execute ACTION-IF-NOT-FOUND (if present):
+        ifelse([$3], , :, [$3])
+    else
+        AC_SUBST(BOOST_CPPFLAGS)
+        AC_SUBST(BOOST_LDFLAGS)
+        AC_DEFINE(HAVE_BOOST,,[define if the Boost library is available])
+        # execute ACTION-IF-FOUND (if present):
+        ifelse([$2], , :, [$2])
+    fi
+
+    CPPFLAGS="$CPPFLAGS_SAVED"
+    LDFLAGS="$LDFLAGS_SAVED"
+fi
+
+])
diff --git a/depend/zcash/build-aux/m4/ax_boost_chrono.m4 b/depend/zcash/build-aux/m4/ax_boost_chrono.m4
new file mode 100644
index 000000000..318ecea17
--- /dev/null
+++ b/depend/zcash/build-aux/m4/ax_boost_chrono.m4
@@ -0,0 +1,119 @@
+# ===========================================================================
+#      http://www.gnu.org/software/autoconf-archive/ax_boost_chrono.html
+# ===========================================================================
+#
+# SYNOPSIS
+#
+#   AX_BOOST_CHRONO
+#
+# DESCRIPTION
+#
+#   Test for System library from the Boost C++ libraries. The macro requires
+#   a preceding call to AX_BOOST_BASE. Further documentation is available at
+#   <http://randspringer.de/boost/index.html>.
+#
+#   This macro calls:
+#
+#     AC_SUBST(BOOST_CHRONO_LIB)
+#
+#   And sets:
+#
+#     HAVE_BOOST_CHRONO
+#
+# LICENSE
+#
+#   Copyright (c) 2012 Xiyue Deng <manphiz@gmail.com>
+#
+#   Copying and distribution of this file, with or without modification, are
+#   permitted in any medium without royalty provided the copyright notice
+#   and this notice are preserved. This file is offered as-is, without any
+#   warranty.
+
+#serial 1
+
+AC_DEFUN([AX_BOOST_CHRONO],
+[
+	AC_ARG_WITH([boost-chrono],
+	AS_HELP_STRING([--with-boost-chrono@<:@=special-lib@:>@],
+                   [use the Chrono library from boost - it is possible to specify a certain library for the linker
+                        e.g. --with-boost-chrono=boost_chrono-gcc-mt ]),
+        [
+        if test "$withval" = "no"; then
+			want_boost="no"
+        elif test "$withval" = "yes"; then
+            want_boost="yes"
+            ax_boost_user_chrono_lib=""
+        else
+		    want_boost="yes"
+		ax_boost_user_chrono_lib="$withval"
+		fi
+        ],
+        [want_boost="yes"]
+	)
+
+	if test "x$want_boost" = "xyes"; then
+        AC_REQUIRE([AC_PROG_CC])
+        AC_REQUIRE([AC_CANONICAL_BUILD])
+		CPPFLAGS_SAVED="$CPPFLAGS"
+		CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
+		export CPPFLAGS
+
+		LDFLAGS_SAVED="$LDFLAGS"
+		LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
+		export LDFLAGS
+
+        AC_CACHE_CHECK(whether the Boost::Chrono library is available,
+					   ax_cv_boost_chrono,
+        [AC_LANG_PUSH([C++])
+			 CXXFLAGS_SAVE=$CXXFLAGS
+
+			 AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[@%:@include <boost/chrono.hpp>]],
+                                   [[boost::chrono::system_clock::time_point time;]])],
+                   ax_cv_boost_chrono=yes, ax_cv_boost_chrono=no)
+			 CXXFLAGS=$CXXFLAGS_SAVE
+             AC_LANG_POP([C++])
+		])
+		if test "x$ax_cv_boost_chrono" = "xyes"; then
+			AC_SUBST(BOOST_CPPFLAGS)
+
+			AC_DEFINE(HAVE_BOOST_CHRONO,,[define if the Boost::Chrono library is available])
+            BOOSTLIBDIR=`echo $BOOST_LDFLAGS | sed -e 's/@<:@^\/@:>@*//'`
+
+			LDFLAGS_SAVE=$LDFLAGS
+            if test "x$ax_boost_user_chrono_lib" = "x"; then
+                ax_lib=
+                for libextension in `ls $BOOSTLIBDIR/libboost_chrono*.so* $BOOSTLIBDIR/libboost_chrono*.dylib* $BOOSTLIBDIR/libboost_chrono*.a* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^lib\(boost_chrono.*\)\.so.*$;\1;' -e 's;^lib\(boost_chrono.*\)\.dylib.*$;\1;' -e 's;^lib\(boost_chrono.*\)\.a.*$;\1;'` ; do
+                     ax_lib=${libextension}
+				    AC_CHECK_LIB($ax_lib, exit,
+                                 [BOOST_CHRONO_LIB="-l$ax_lib"; AC_SUBST(BOOST_CHRONO_LIB) link_chrono="yes"; break],
+                                 [link_chrono="no"])
+				done
+                if test "x$link_chrono" != "xyes"; then
+                for libextension in `ls $BOOSTLIBDIR/boost_chrono*.dll* $BOOSTLIBDIR/boost_chrono*.a* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^\(boost_chrono.*\)\.dll.*$;\1;' -e 's;^\(boost_chrono.*\)\.a.*$;\1;'` ; do
+                     ax_lib=${libextension}
+				    AC_CHECK_LIB($ax_lib, exit,
+                                 [BOOST_CHRONO_LIB="-l$ax_lib"; AC_SUBST(BOOST_CHRONO_LIB) link_chrono="yes"; break],
+                                 [link_chrono="no"])
+				done
+                fi
+
+            else
+               for ax_lib in $ax_boost_user_chrono_lib boost_chrono-$ax_boost_user_chrono_lib; do
+				      AC_CHECK_LIB($ax_lib, exit,
+                                   [BOOST_CHRONO_LIB="-l$ax_lib"; AC_SUBST(BOOST_CHRONO_LIB) link_chrono="yes"; break],
+                                   [link_chrono="no"])
+                  done
+
+            fi
+            if test "x$ax_lib" = "x"; then
+                AC_MSG_ERROR(Could not find a version of the boost_chrono library!)
+            fi
+			if test "x$link_chrono" = "xno"; then
+				AC_MSG_ERROR(Could not link against $ax_lib !)
+			fi
+		fi
+
+		CPPFLAGS="$CPPFLAGS_SAVED"
+	LDFLAGS="$LDFLAGS_SAVED"
+	fi
+])
diff --git a/depend/zcash/build-aux/m4/ax_boost_filesystem.m4 b/depend/zcash/build-aux/m4/ax_boost_filesystem.m4
new file mode 100644
index 000000000..f5c9d5647
--- /dev/null
+++ b/depend/zcash/build-aux/m4/ax_boost_filesystem.m4
@@ -0,0 +1,119 @@
+# ===========================================================================
+#    http://www.gnu.org/software/autoconf-archive/ax_boost_filesystem.html
+# ===========================================================================
+#
+# SYNOPSIS
+#
+#   AX_BOOST_FILESYSTEM
+#
+# DESCRIPTION
+#
+#   Test for Filesystem library from the Boost C++ libraries. The macro
+#   requires a preceding call to AX_BOOST_BASE. Further documentation is
+#   available at <http://randspringer.de/boost/index.html>.
+#
+#   This macro calls:
+#
+#     AC_SUBST(BOOST_FILESYSTEM_LIB)
+#
+#   And sets:
+#
+#     HAVE_BOOST_FILESYSTEM
+#
+# LICENSE
+#
+#   Copyright (c) 2009 Thomas Porschberg <thomas@randspringer.de>
+#   Copyright (c) 2009 Michael Tindal
+#   Copyright (c) 2009 Roman Rybalko <libtorrent@romanr.info>
+#
+#   Copying and distribution of this file, with or without modification, are
+#   permitted in any medium without royalty provided the copyright notice
+#   and this notice are preserved. This file is offered as-is, without any
+#   warranty.
+
+#serial 26
+
+AC_DEFUN([AX_BOOST_FILESYSTEM],
+[
+	AC_ARG_WITH([boost-filesystem],
+	AS_HELP_STRING([--with-boost-filesystem@<:@=special-lib@:>@],
+                   [use the Filesystem library from boost - it is possible to specify a certain library for the linker
+                        e.g. --with-boost-filesystem=boost_filesystem-gcc-mt ]),
+        [
+        if test "$withval" = "no"; then
+			want_boost="no"
+        elif test "$withval" = "yes"; then
+            want_boost="yes"
+            ax_boost_user_filesystem_lib=""
+        else
+		    want_boost="yes"
+		ax_boost_user_filesystem_lib="$withval"
+		fi
+        ],
+        [want_boost="yes"]
+	)
+
+	if test "x$want_boost" = "xyes"; then
+        AC_REQUIRE([AC_PROG_CC])
+		CPPFLAGS_SAVED="$CPPFLAGS"
+		CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
+		export CPPFLAGS
+
+		LDFLAGS_SAVED="$LDFLAGS"
+		LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
+		export LDFLAGS
+
+		LIBS_SAVED=$LIBS
+		LIBS="$LIBS $BOOST_SYSTEM_LIB"
+		export LIBS
+
+        AC_CACHE_CHECK(whether the Boost::Filesystem library is available,
+					   ax_cv_boost_filesystem,
+        [AC_LANG_PUSH([C++])
+         AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[@%:@include <boost/filesystem/path.hpp>]],
+                                   [[using namespace boost::filesystem;
+                                   path my_path( "foo/bar/data.txt" );
+                                   return 0;]])],
+					       ax_cv_boost_filesystem=yes, ax_cv_boost_filesystem=no)
+         AC_LANG_POP([C++])
+		])
+		if test "x$ax_cv_boost_filesystem" = "xyes"; then
+			AC_DEFINE(HAVE_BOOST_FILESYSTEM,,[define if the Boost::Filesystem library is available])
+            BOOSTLIBDIR=`echo $BOOST_LDFLAGS | sed -e 's/@<:@^\/@:>@*//'`
+            ax_lib=
+            if test "x$ax_boost_user_filesystem_lib" = "x"; then
+                for libextension in `ls -r $BOOSTLIBDIR/libboost_filesystem* 2>/dev/null | sed 's,.*/lib,,' | sed 's,\..*,,'` ; do
+                     ax_lib=${libextension}
+				    AC_CHECK_LIB($ax_lib, exit,
+                                 [BOOST_FILESYSTEM_LIB="-l$ax_lib"; AC_SUBST(BOOST_FILESYSTEM_LIB) link_filesystem="yes"; break],
+                                 [link_filesystem="no"])
+				done
+                if test "x$link_filesystem" != "xyes"; then
+                for libextension in `ls -r $BOOSTLIBDIR/boost_filesystem* 2>/dev/null | sed 's,.*/,,' | sed -e 's,\..*,,'` ; do
+                     ax_lib=${libextension}
+				    AC_CHECK_LIB($ax_lib, exit,
+                                 [BOOST_FILESYSTEM_LIB="-l$ax_lib"; AC_SUBST(BOOST_FILESYSTEM_LIB) link_filesystem="yes"; break],
+                                 [link_filesystem="no"])
+				done
+		    fi
+            else
+               for ax_lib in $ax_boost_user_filesystem_lib boost_filesystem-$ax_boost_user_filesystem_lib; do
+				      AC_CHECK_LIB($ax_lib, exit,
+                                   [BOOST_FILESYSTEM_LIB="-l$ax_lib"; AC_SUBST(BOOST_FILESYSTEM_LIB) link_filesystem="yes"; break],
+                                   [link_filesystem="no"])
+                  done
+
+            fi
+            if test "x$ax_lib" = "x"; then
+                AC_MSG_ERROR(Could not find a version of the boost_filesystem library!)
+            fi
+			if test "x$link_filesystem" != "xyes"; then
+				AC_MSG_ERROR(Could not link against $ax_lib !)
+			fi
+		fi
+
+		CPPFLAGS="$CPPFLAGS_SAVED"
+		LDFLAGS="$LDFLAGS_SAVED"
+		LIBS="$LIBS_SAVED"
+	fi
+])
diff --git a/depend/zcash/build-aux/m4/ax_boost_program_options.m4 b/depend/zcash/build-aux/m4/ax_boost_program_options.m4
new file mode 100644
index 000000000..2bdb59371
--- /dev/null
+++ b/depend/zcash/build-aux/m4/ax_boost_program_options.m4
@@ -0,0 +1,108 @@
+# ============================================================================
+#  http://www.gnu.org/software/autoconf-archive/ax_boost_program_options.html
+# ============================================================================
+#
+# SYNOPSIS
+#
+#   AX_BOOST_PROGRAM_OPTIONS
+#
+# DESCRIPTION
+#
+#   Test for program options library from the Boost C++ libraries. The macro
+#   requires a preceding call to AX_BOOST_BASE. Further documentation is
+#   available at <http://randspringer.de/boost/index.html>.
+#
+#   This macro calls:
+#
+#     AC_SUBST(BOOST_PROGRAM_OPTIONS_LIB)
+#
+#   And sets:
+#
+#     HAVE_BOOST_PROGRAM_OPTIONS
+#
+# LICENSE
+#
+#   Copyright (c) 2009 Thomas Porschberg <thomas@randspringer.de>
+#
+#   Copying and distribution of this file, with or without modification, are
+#   permitted in any medium without royalty provided the copyright notice
+#   and this notice are preserved. This file is offered as-is, without any
+#   warranty.
+
+#serial 24
+
+AC_DEFUN([AX_BOOST_PROGRAM_OPTIONS],
+[
+	AC_ARG_WITH([boost-program-options],
+		AS_HELP_STRING([--with-boost-program-options@<:@=special-lib@:>@],
+                       [use the program options library from boost - it is possible to specify a certain library for the linker
+                        e.g. --with-boost-program-options=boost_program_options-gcc-mt-1_33_1 ]),
+        [
+        if test "$withval" = "no"; then
+			want_boost="no"
+        elif test "$withval" = "yes"; then
+            want_boost="yes"
+            ax_boost_user_program_options_lib=""
+        else
+		    want_boost="yes"
+		ax_boost_user_program_options_lib="$withval"
+		fi
+        ],
+        [want_boost="yes"]
+	)
+
+	if test "x$want_boost" = "xyes"; then
+        AC_REQUIRE([AC_PROG_CC])
+	    export want_boost
+		CPPFLAGS_SAVED="$CPPFLAGS"
+		CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
+		export CPPFLAGS
+		LDFLAGS_SAVED="$LDFLAGS"
+		LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
+		export LDFLAGS
+		AC_CACHE_CHECK([whether the Boost::Program_Options library is available],
+					   ax_cv_boost_program_options,
+					   [AC_LANG_PUSH(C++)
+				AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[@%:@include <boost/program_options/errors.hpp>
+                                                          ]],
+                                  [[boost::program_options::error err("Error message");
+                                   return 0;]])],
+                           ax_cv_boost_program_options=yes, ax_cv_boost_program_options=no)
+					AC_LANG_POP([C++])
+		])
+		if test "$ax_cv_boost_program_options" = yes; then
+				AC_DEFINE(HAVE_BOOST_PROGRAM_OPTIONS,,[define if the Boost::PROGRAM_OPTIONS library is available])
+                  BOOSTLIBDIR=`echo $BOOST_LDFLAGS | sed -e 's/@<:@^\/@:>@*//'`
+                if test "x$ax_boost_user_program_options_lib" = "x"; then
+                for libextension in `ls $BOOSTLIBDIR/libboost_program_options*.so* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^lib\(boost_program_options.*\)\.so.*$;\1;'` `ls $BOOSTLIBDIR/libboost_program_options*.dylib* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^lib\(boost_program_options.*\)\.dylib.*$;\1;'` `ls $BOOSTLIBDIR/libboost_program_options*.a* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^lib\(boost_program_options.*\)\.a.*$;\1;'` ; do
+                     ax_lib=${libextension}
+				    AC_CHECK_LIB($ax_lib, exit,
+                                 [BOOST_PROGRAM_OPTIONS_LIB="-l$ax_lib"; AC_SUBST(BOOST_PROGRAM_OPTIONS_LIB) link_program_options="yes"; break],
+                                 [link_program_options="no"])
+				done
+                if test "x$link_program_options" != "xyes"; then
+                for libextension in `ls $BOOSTLIBDIR/boost_program_options*.dll* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^\(boost_program_options.*\)\.dll.*$;\1;'` `ls $BOOSTLIBDIR/boost_program_options*.a* 2>/dev/null | sed 's,.*/,,' | sed -e 's;^\(boost_program_options.*\)\.a.*$;\1;'` ; do
+                     ax_lib=${libextension}
+				    AC_CHECK_LIB($ax_lib, exit,
+                                 [BOOST_PROGRAM_OPTIONS_LIB="-l$ax_lib"; AC_SUBST(BOOST_PROGRAM_OPTIONS_LIB) link_program_options="yes"; break],
+                                 [link_program_options="no"])
+				done
+                fi
+                else
+                  for ax_lib in $ax_boost_user_program_options_lib boost_program_options-$ax_boost_user_program_options_lib; do
+				      AC_CHECK_LIB($ax_lib, main,
+                                   [BOOST_PROGRAM_OPTIONS_LIB="-l$ax_lib"; AC_SUBST(BOOST_PROGRAM_OPTIONS_LIB) link_program_options="yes"; break],
+                                   [link_program_options="no"])
+                  done
+                fi
+            if test "x$ax_lib" = "x"; then
+                AC_MSG_ERROR(Could not find a version of the boost_program_options library!)
+            fi
+				if test "x$link_program_options" != "xyes"; then
+					AC_MSG_ERROR([Could not link against [$ax_lib] !])
+				fi
+		fi
+		CPPFLAGS="$CPPFLAGS_SAVED"
+	LDFLAGS="$LDFLAGS_SAVED"
+	fi
+])
diff --git a/depend/zcash/build-aux/m4/ax_boost_system.m4 b/depend/zcash/build-aux/m4/ax_boost_system.m4
new file mode 100644
index 000000000..1c05450cb
--- /dev/null
+++ b/depend/zcash/build-aux/m4/ax_boost_system.m4
@@ -0,0 +1,122 @@
+# ===========================================================================
+#      http://www.gnu.org/software/autoconf-archive/ax_boost_system.html
+# ===========================================================================
+#
+# SYNOPSIS
+#
+#   AX_BOOST_SYSTEM
+#
+# DESCRIPTION
+#
+#   Test for System library from the Boost C++ libraries. The macro requires
+#   a preceding call to AX_BOOST_BASE. Further documentation is available at
+#   <http://randspringer.de/boost/index.html>.
+#
+#   This macro calls:
+#
+#     AC_SUBST(BOOST_SYSTEM_LIB)
+#
+#   And sets:
+#
+#     HAVE_BOOST_SYSTEM
+#
+# LICENSE
+#
+#   Copyright (c) 2008 Thomas Porschberg <thomas@randspringer.de>
+#   Copyright (c) 2008 Michael Tindal
+#   Copyright (c) 2008 Daniel Casimiro <dan.casimiro@gmail.com>
+#
+#   Copying and distribution of this file, with or without modification, are
+#   permitted in any medium without royalty provided the copyright notice
+#   and this notice are preserved. This file is offered as-is, without any
+#   warranty.
+
+#serial 18
+
+AC_DEFUN([AX_BOOST_SYSTEM],
+[
+	AC_ARG_WITH([boost-system],
+	AS_HELP_STRING([--with-boost-system@<:@=special-lib@:>@],
+                   [use the System library from boost - it is possible to specify a certain library for the linker
+                        e.g. --with-boost-system=boost_system-gcc-mt ]),
+        [
+        if test "$withval" = "no"; then
+			want_boost="no"
+        elif test "$withval" = "yes"; then
+            want_boost="yes"
+            ax_boost_user_system_lib=""
+        else
+		    want_boost="yes"
+		ax_boost_user_system_lib="$withval"
+		fi
+        ],
+        [want_boost="yes"]
+	)
+
+	if test "x$want_boost" = "xyes"; then
+        AC_REQUIRE([AC_PROG_CC])
+        AC_REQUIRE([AC_CANONICAL_BUILD])
+		CPPFLAGS_SAVED="$CPPFLAGS"
+		CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
+		export CPPFLAGS
+
+		LDFLAGS_SAVED="$LDFLAGS"
+		LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
+		export LDFLAGS
+
+        AC_CACHE_CHECK(whether the Boost::System library is available,
+					   ax_cv_boost_system,
+        [AC_LANG_PUSH([C++])
+			 CXXFLAGS_SAVE=$CXXFLAGS
+			 CXXFLAGS=
+
+			 AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[@%:@include <boost/system/error_code.hpp>]],
+				    [[boost::system::error_category *a = 0;]])],
+                   ax_cv_boost_system=yes, ax_cv_boost_system=no)
+			 CXXFLAGS=$CXXFLAGS_SAVE
+             AC_LANG_POP([C++])
+		])
+		if test "x$ax_cv_boost_system" = "xyes"; then
+			AC_SUBST(BOOST_CPPFLAGS)
+
+			AC_DEFINE(HAVE_BOOST_SYSTEM,,[define if the Boost::System library is available])
+            BOOSTLIBDIR=`echo $BOOST_LDFLAGS | sed -e 's/@<:@^\/@:>@*//'`
+
+			LDFLAGS_SAVE=$LDFLAGS
+            if test "x$ax_boost_user_system_lib" = "x"; then
+                ax_lib=
+                for libextension in `ls -r $BOOSTLIBDIR/libboost_system* 2>/dev/null | sed 's,.*/lib,,' | sed 's,\..*,,'` ; do
+                     ax_lib=${libextension}
+				    AC_CHECK_LIB($ax_lib, exit,
+                                 [BOOST_SYSTEM_LIB="-l$ax_lib"; AC_SUBST(BOOST_SYSTEM_LIB) link_system="yes"; break],
+                                 [link_system="no"])
+				done
+                if test "x$link_system" != "xyes"; then
+                for libextension in `ls -r $BOOSTLIBDIR/boost_system* 2>/dev/null | sed 's,.*/,,' | sed -e 's,\..*,,'` ; do
+                     ax_lib=${libextension}
+				    AC_CHECK_LIB($ax_lib, exit,
+                                 [BOOST_SYSTEM_LIB="-l$ax_lib"; AC_SUBST(BOOST_SYSTEM_LIB) link_system="yes"; break],
+                                 [link_system="no"])
+				done
+                fi
+
+            else
+               for ax_lib in $ax_boost_user_system_lib boost_system-$ax_boost_user_system_lib; do
+				      AC_CHECK_LIB($ax_lib, exit,
+                                   [BOOST_SYSTEM_LIB="-l$ax_lib"; AC_SUBST(BOOST_SYSTEM_LIB) link_system="yes"; break],
+                                   [link_system="no"])
+                  done
+
+            fi
+            if test "x$ax_lib" = "x"; then
+                AC_MSG_ERROR(Could not find a version of the boost_system library!)
+            fi
+			if test "x$link_system" = "xno"; then
+				AC_MSG_ERROR(Could not link against $ax_lib !)
+			fi
+		fi
+
+		CPPFLAGS="$CPPFLAGS_SAVED"
+	LDFLAGS="$LDFLAGS_SAVED"
+	fi
+])
diff --git a/depend/zcash/build-aux/m4/ax_boost_thread.m4 b/depend/zcash/build-aux/m4/ax_boost_thread.m4
new file mode 100644
index 000000000..9f0bd0b23
--- /dev/null
+++ b/depend/zcash/build-aux/m4/ax_boost_thread.m4
@@ -0,0 +1,150 @@
+# ===========================================================================
+#      http://www.gnu.org/software/autoconf-archive/ax_boost_thread.html
+# ===========================================================================
+#
+# SYNOPSIS
+#
+#   AX_BOOST_THREAD
+#
+# DESCRIPTION
+#
+#   Test for Thread library from the Boost C++ libraries. The macro requires
+#   a preceding call to AX_BOOST_BASE. Further documentation is available at
+#   <http://randspringer.de/boost/index.html>.
+#
+#   This macro calls:
+#
+#     AC_SUBST(BOOST_THREAD_LIB)
+#
+#   And sets:
+#
+#     HAVE_BOOST_THREAD
+#
+# LICENSE
+#
+#   Copyright (c) 2009 Thomas Porschberg <thomas@randspringer.de>
+#   Copyright (c) 2009 Michael Tindal
+#
+#   Copying and distribution of this file, with or without modification, are
+#   permitted in any medium without royalty provided the copyright notice
+#   and this notice are preserved. This file is offered as-is, without any
+#   warranty.
+
+#serial 27
+
+AC_DEFUN([AX_BOOST_THREAD],
+[
+	AC_ARG_WITH([boost-thread],
+	AS_HELP_STRING([--with-boost-thread@<:@=special-lib@:>@],
+                   [use the Thread library from boost - it is possible to specify a certain library for the linker
+                        e.g. --with-boost-thread=boost_thread-gcc-mt ]),
+        [
+        if test "$withval" = "no"; then
+			want_boost="no"
+        elif test "$withval" = "yes"; then
+            want_boost="yes"
+            ax_boost_user_thread_lib=""
+        else
+		    want_boost="yes"
+		ax_boost_user_thread_lib="$withval"
+		fi
+        ],
+        [want_boost="yes"]
+	)
+
+	if test "x$want_boost" = "xyes"; then
+        AC_REQUIRE([AC_PROG_CC])
+        AC_REQUIRE([AC_CANONICAL_BUILD])
+		CPPFLAGS_SAVED="$CPPFLAGS"
+		CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
+		export CPPFLAGS
+
+		LDFLAGS_SAVED="$LDFLAGS"
+		LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
+		export LDFLAGS
+
+        AC_CACHE_CHECK(whether the Boost::Thread library is available,
+					   ax_cv_boost_thread,
+        [AC_LANG_PUSH([C++])
+			 CXXFLAGS_SAVE=$CXXFLAGS
+
+			 if test "x$host_os" = "xsolaris" ; then
+				 CXXFLAGS="-pthreads $CXXFLAGS"
+			 elif test "x$host_os" = "xmingw32" ; then
+				 CXXFLAGS="-mthreads $CXXFLAGS"
+			 else
+				CXXFLAGS="-pthread $CXXFLAGS"
+			 fi
+			 AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[@%:@include <boost/thread/thread.hpp>]],
+                                   [[boost::thread_group thrds;
+                                   return 0;]])],
+                   ax_cv_boost_thread=yes, ax_cv_boost_thread=no)
+			 CXXFLAGS=$CXXFLAGS_SAVE
+             AC_LANG_POP([C++])
+		])
+		if test "x$ax_cv_boost_thread" = "xyes"; then
+           if test "x$host_os" = "xsolaris" ; then
+			  BOOST_CPPFLAGS="-pthreads $BOOST_CPPFLAGS"
+		   elif test "x$host_os" = "xmingw32" ; then
+			  BOOST_CPPFLAGS="-mthreads $BOOST_CPPFLAGS"
+		   else
+			  BOOST_CPPFLAGS="-pthread $BOOST_CPPFLAGS"
+		   fi
+
+			AC_SUBST(BOOST_CPPFLAGS)
+
+			AC_DEFINE(HAVE_BOOST_THREAD,,[define if the Boost::Thread library is available])
+            BOOSTLIBDIR=`echo $BOOST_LDFLAGS | sed -e 's/@<:@^\/@:>@*//'`
+
+			LDFLAGS_SAVE=$LDFLAGS
+                        case "x$host_os" in
+                          *bsd* )
+                               LDFLAGS="-pthread $LDFLAGS"
+                          break;
+                          ;;
+                        esac
+            if test "x$ax_boost_user_thread_lib" = "x"; then
+                ax_lib=
+                for libextension in `ls -r $BOOSTLIBDIR/libboost_thread* 2>/dev/null | sed 's,.*/lib,,' | sed 's,\..*,,'`; do
+                     ax_lib=${libextension}
+				    AC_CHECK_LIB($ax_lib, exit,
+                                 [BOOST_THREAD_LIB="-l$ax_lib"; AC_SUBST(BOOST_THREAD_LIB) link_thread="yes"; break],
+                                 [link_thread="no"])
+				done
+                if test "x$link_thread" != "xyes"; then
+                for libextension in `ls -r $BOOSTLIBDIR/boost_thread* 2>/dev/null | sed 's,.*/,,' | sed 's,\..*,,'`; do
+                     ax_lib=${libextension}
+				    AC_CHECK_LIB($ax_lib, exit,
+                                 [BOOST_THREAD_LIB="-l$ax_lib"; AC_SUBST(BOOST_THREAD_LIB) link_thread="yes"; break],
+                                 [link_thread="no"])
+				done
+                fi
+
+            else
+               for ax_lib in $ax_boost_user_thread_lib boost_thread-$ax_boost_user_thread_lib; do
+				      AC_CHECK_LIB($ax_lib, exit,
+                                   [BOOST_THREAD_LIB="-l$ax_lib"; AC_SUBST(BOOST_THREAD_LIB) link_thread="yes"; break],
+                                   [link_thread="no"])
+                  done
+
+            fi
+            if test "x$ax_lib" = "x"; then
+                AC_MSG_ERROR(Could not find a version of the boost_thread library!)
+            fi
+			if test "x$link_thread" = "xno"; then
+				AC_MSG_ERROR(Could not link against $ax_lib !)
+                        else
+                           case "x$host_os" in
+                              *bsd* )
+				BOOST_LDFLAGS="-pthread $BOOST_LDFLAGS"
+                              break;
+                              ;;
+                           esac
+
+			fi
+		fi
+
+		CPPFLAGS="$CPPFLAGS_SAVED"
+	LDFLAGS="$LDFLAGS_SAVED"
+	fi
+])
diff --git a/depend/zcash/build-aux/m4/ax_boost_unit_test_framework.m4 b/depend/zcash/build-aux/m4/ax_boost_unit_test_framework.m4
new file mode 100644
index 000000000..4efd1e2f1
--- /dev/null
+++ b/depend/zcash/build-aux/m4/ax_boost_unit_test_framework.m4
@@ -0,0 +1,138 @@
+# ================================================================================
+#  http://www.gnu.org/software/autoconf-archive/ax_boost_unit_test_framework.html
+# ================================================================================
+#
+# SYNOPSIS
+#
+#   AX_BOOST_UNIT_TEST_FRAMEWORK
+#
+# DESCRIPTION
+#
+#   Test for Unit_Test_Framework library from the Boost C++ libraries. The
+#   macro requires a preceding call to AX_BOOST_BASE. Further documentation
+#   is available at <http://randspringer.de/boost/index.html>.
+#
+#   This macro calls:
+#
+#     AC_SUBST(BOOST_UNIT_TEST_FRAMEWORK_LIB)
+#
+#   And sets:
+#
+#     HAVE_BOOST_UNIT_TEST_FRAMEWORK
+#
+# LICENSE
+#
+#   Copyright (c) 2008 Thomas Porschberg <thomas@randspringer.de>
+#
+#   Copying and distribution of this file, with or without modification, are
+#   permitted in any medium without royalty provided the copyright notice
+#   and this notice are preserved. This file is offered as-is, without any
+#   warranty.
+
+#serial 19
+
+AC_DEFUN([AX_BOOST_UNIT_TEST_FRAMEWORK],
+[
+	AC_ARG_WITH([boost-unit-test-framework],
+	AS_HELP_STRING([--with-boost-unit-test-framework@<:@=special-lib@:>@],
+                   [use the Unit_Test_Framework library from boost - it is possible to specify a certain library for the linker
+                        e.g. --with-boost-unit-test-framework=boost_unit_test_framework-gcc ]),
+        [
+        if test "$withval" = "no"; then
+			want_boost="no"
+        elif test "$withval" = "yes"; then
+            want_boost="yes"
+            ax_boost_user_unit_test_framework_lib=""
+        else
+		    want_boost="yes"
+		ax_boost_user_unit_test_framework_lib="$withval"
+		fi
+        ],
+        [want_boost="yes"]
+	)
+
+	if test "x$want_boost" = "xyes"; then
+        AC_REQUIRE([AC_PROG_CC])
+		CPPFLAGS_SAVED="$CPPFLAGS"
+		CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
+		export CPPFLAGS
+
+		LDFLAGS_SAVED="$LDFLAGS"
+		LDFLAGS="$LDFLAGS $BOOST_LDFLAGS"
+		export LDFLAGS
+
+        AC_CACHE_CHECK(whether the Boost::Unit_Test_Framework library is available,
+					   ax_cv_boost_unit_test_framework,
+        [AC_LANG_PUSH([C++])
+			 AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[@%:@include <boost/test/unit_test.hpp>]],
+                                    [[using boost::unit_test::test_suite;
+							 test_suite* test= BOOST_TEST_SUITE( "Unit test example 1" ); return 0;]])],
+                   ax_cv_boost_unit_test_framework=yes, ax_cv_boost_unit_test_framework=no)
+         AC_LANG_POP([C++])
+		])
+		if test "x$ax_cv_boost_unit_test_framework" = "xyes"; then
+			AC_DEFINE(HAVE_BOOST_UNIT_TEST_FRAMEWORK,,[define if the Boost::Unit_Test_Framework library is available])
+            BOOSTLIBDIR=`echo $BOOST_LDFLAGS | sed -e 's/@<:@^\/@:>@*//'`
+
+            if test "x$ax_boost_user_unit_test_framework_lib" = "x"; then
+			saved_ldflags="${LDFLAGS}"
+                ax_lib=
+                for monitor_library in `ls $BOOSTLIBDIR/libboost_unit_test_framework*.so* $BOOSTLIBDIR/libboost_unit_test_framework*.dylib* $BOOSTLIBDIR/libboost_unit_test_framework*.a* 2>/dev/null` ; do
+                    if test -r $monitor_library ; then
+                       libextension=`echo $monitor_library | sed 's,.*/,,' | sed -e 's;^lib\(boost_unit_test_framework.*\)\.so.*$;\1;' -e 's;^lib\(boost_unit_test_framework.*\)\.dylib.*$;\1;' -e 's;^lib\(boost_unit_test_framework.*\)\.a.*$;\1;'`
+                       ax_lib=${libextension}
+                       link_unit_test_framework="yes"
+                    else
+                       link_unit_test_framework="no"
+                    fi
+
+			    if test "x$link_unit_test_framework" = "xyes"; then
+                      BOOST_UNIT_TEST_FRAMEWORK_LIB="-l$ax_lib"
+                      AC_SUBST(BOOST_UNIT_TEST_FRAMEWORK_LIB)
+					  break
+				    fi
+                done
+                if test "x$link_unit_test_framework" != "xyes"; then
+                for libextension in `ls $BOOSTLIBDIR/boost_unit_test_framework*.dll* $BOOSTLIBDIR/boost_unit_test_framework*.a* 2>/dev/null  | sed 's,.*/,,' | sed -e 's;^\(boost_unit_test_framework.*\)\.dll.*$;\1;' -e 's;^\(boost_unit_test_framework.*\)\.a.*$;\1;'` ; do
+                     ax_lib=${libextension}
+				    AC_CHECK_LIB($ax_lib, exit,
+                                 [BOOST_UNIT_TEST_FRAMEWORK_LIB="-l$ax_lib"; AC_SUBST(BOOST_UNIT_TEST_FRAMEWORK_LIB) link_unit_test_framework="yes"; break],
+                                 [link_unit_test_framework="no"])
+				done
+                fi
+            else
+                link_unit_test_framework="no"
+			saved_ldflags="${LDFLAGS}"
+                for ax_lib in boost_unit_test_framework-$ax_boost_user_unit_test_framework_lib $ax_boost_user_unit_test_framework_lib ; do
+                   if test "x$link_unit_test_framework" = "xyes"; then
+                      break;
+                   fi
+                   for unittest_library in `ls $BOOSTLIBDIR/lib${ax_lib}.so* $BOOSTLIBDIR/lib${ax_lib}.a* 2>/dev/null` ; do
+                   if test -r $unittest_library ; then
+                       libextension=`echo $unittest_library | sed 's,.*/,,' | sed -e 's;^lib\(boost_unit_test_framework.*\)\.so.*$;\1;' -e 's;^lib\(boost_unit_test_framework.*\)\.a*$;\1;'`
+                       ax_lib=${libextension}
+                       link_unit_test_framework="yes"
+                    else
+                       link_unit_test_framework="no"
+                    fi
+
+				if test "x$link_unit_test_framework" = "xyes"; then
+                        BOOST_UNIT_TEST_FRAMEWORK_LIB="-l$ax_lib"
+                        AC_SUBST(BOOST_UNIT_TEST_FRAMEWORK_LIB)
+					    break
+				    fi
+                  done
+               done
+            fi
+            if test "x$ax_lib" = "x"; then
+                AC_MSG_ERROR(Could not find a version of the boost_unit_test_framework library!)
+            fi
+			if test "x$link_unit_test_framework" != "xyes"; then
+				AC_MSG_ERROR(Could not link against $ax_lib !)
+			fi
+		fi
+
+		CPPFLAGS="$CPPFLAGS_SAVED"
+	LDFLAGS="$LDFLAGS_SAVED"
+	fi
+])
diff --git a/depend/zcash/build-aux/m4/ax_check_compile_flag.m4 b/depend/zcash/build-aux/m4/ax_check_compile_flag.m4
new file mode 100644
index 000000000..ca3639715
--- /dev/null
+++ b/depend/zcash/build-aux/m4/ax_check_compile_flag.m4
@@ -0,0 +1,74 @@
+# ===========================================================================
+#   http://www.gnu.org/software/autoconf-archive/ax_check_compile_flag.html
+# ===========================================================================
+#
+# SYNOPSIS
+#
+#   AX_CHECK_COMPILE_FLAG(FLAG, [ACTION-SUCCESS], [ACTION-FAILURE], [EXTRA-FLAGS], [INPUT])
+#
+# DESCRIPTION
+#
+#   Check whether the given FLAG works with the current language's compiler
+#   or gives an error.  (Warnings, however, are ignored)
+#
+#   ACTION-SUCCESS/ACTION-FAILURE are shell commands to execute on
+#   success/failure.
+#
+#   If EXTRA-FLAGS is defined, it is added to the current language's default
+#   flags (e.g. CFLAGS) when the check is done.  The check is thus made with
+#   the flags: "CFLAGS EXTRA-FLAGS FLAG".  This can for example be used to
+#   force the compiler to issue an error when a bad flag is given.
+#
+#   INPUT gives an alternative input source to AC_COMPILE_IFELSE.
+#
+#   NOTE: Implementation based on AX_CFLAGS_GCC_OPTION. Please keep this
+#   macro in sync with AX_CHECK_{PREPROC,LINK}_FLAG.
+#
+# LICENSE
+#
+#   Copyright (c) 2008 Guido U. Draheim <guidod@gmx.de>
+#   Copyright (c) 2011 Maarten Bosmans <mkbosmans@gmail.com>
+#
+#   This program is free software: you can redistribute it and/or modify it
+#   under the terms of the GNU General Public License as published by the
+#   Free Software Foundation, either version 3 of the License, or (at your
+#   option) any later version.
+#
+#   This program is distributed in the hope that it will be useful, but
+#   WITHOUT ANY WARRANTY; without even the implied warranty of
+#   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
+#   Public License for more details.
+#
+#   You should have received a copy of the GNU General Public License along
+#   with this program. If not, see <http://www.gnu.org/licenses/>.
+#
+#   As a special exception, the respective Autoconf Macro's copyright owner
+#   gives unlimited permission to copy, distribute and modify the configure
+#   scripts that are the output of Autoconf when processing the Macro. You
+#   need not follow the terms of the GNU General Public License when using
+#   or distributing such scripts, even though portions of the text of the
+#   Macro appear in them. The GNU General Public License (GPL) does govern
+#   all other use of the material that constitutes the Autoconf Macro.
+#
+#   This special exception to the GPL applies to versions of the Autoconf
+#   Macro released by the Autoconf Archive. When you make and distribute a
+#   modified version of the Autoconf Macro, you may extend this special
+#   exception to the GPL to apply to your modified version as well.
+
+#serial 4
+
+AC_DEFUN([AX_CHECK_COMPILE_FLAG],
+[AC_PREREQ(2.64)dnl for _AC_LANG_PREFIX and AS_VAR_IF
+AS_VAR_PUSHDEF([CACHEVAR],[ax_cv_check_[]_AC_LANG_ABBREV[]flags_$4_$1])dnl
+AC_CACHE_CHECK([whether _AC_LANG compiler accepts $1], CACHEVAR, [
+  ax_check_save_flags=$[]_AC_LANG_PREFIX[]FLAGS
+  _AC_LANG_PREFIX[]FLAGS="$[]_AC_LANG_PREFIX[]FLAGS $4 $1"
+  AC_COMPILE_IFELSE([m4_default([$5],[AC_LANG_PROGRAM()])],
+    [AS_VAR_SET(CACHEVAR,[yes])],
+    [AS_VAR_SET(CACHEVAR,[no])])
+  _AC_LANG_PREFIX[]FLAGS=$ax_check_save_flags])
+AS_VAR_IF(CACHEVAR,yes,
+  [m4_default([$2], :)],
+  [m4_default([$3], :)])
+AS_VAR_POPDEF([CACHEVAR])dnl
+])dnl AX_CHECK_COMPILE_FLAGS
diff --git a/depend/zcash/build-aux/m4/ax_check_link_flag.m4 b/depend/zcash/build-aux/m4/ax_check_link_flag.m4
new file mode 100644
index 000000000..eb01a6ce1
--- /dev/null
+++ b/depend/zcash/build-aux/m4/ax_check_link_flag.m4
@@ -0,0 +1,74 @@
+# ===========================================================================
+#    http://www.gnu.org/software/autoconf-archive/ax_check_link_flag.html
+# ===========================================================================
+#
+# SYNOPSIS
+#
+#   AX_CHECK_LINK_FLAG(FLAG, [ACTION-SUCCESS], [ACTION-FAILURE], [EXTRA-FLAGS], [INPUT])
+#
+# DESCRIPTION
+#
+#   Check whether the given FLAG works with the linker or gives an error.
+#   (Warnings, however, are ignored)
+#
+#   ACTION-SUCCESS/ACTION-FAILURE are shell commands to execute on
+#   success/failure.
+#
+#   If EXTRA-FLAGS is defined, it is added to the linker's default flags
+#   when the check is done.  The check is thus made with the flags: "LDFLAGS
+#   EXTRA-FLAGS FLAG".  This can for example be used to force the linker to
+#   issue an error when a bad flag is given.
+#
+#   INPUT gives an alternative input source to AC_LINK_IFELSE.
+#
+#   NOTE: Implementation based on AX_CFLAGS_GCC_OPTION. Please keep this
+#   macro in sync with AX_CHECK_{PREPROC,COMPILE}_FLAG.
+#
+# LICENSE
+#
+#   Copyright (c) 2008 Guido U. Draheim <guidod@gmx.de>
+#   Copyright (c) 2011 Maarten Bosmans <mkbosmans@gmail.com>
+#
+#   This program is free software: you can redistribute it and/or modify it
+#   under the terms of the GNU General Public License as published by the
+#   Free Software Foundation, either version 3 of the License, or (at your
+#   option) any later version.
+#
+#   This program is distributed in the hope that it will be useful, but
+#   WITHOUT ANY WARRANTY; without even the implied warranty of
+#   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
+#   Public License for more details.
+#
+#   You should have received a copy of the GNU General Public License along
+#   with this program. If not, see <http://www.gnu.org/licenses/>.
+#
+#   As a special exception, the respective Autoconf Macro's copyright owner
+#   gives unlimited permission to copy, distribute and modify the configure
+#   scripts that are the output of Autoconf when processing the Macro. You
+#   need not follow the terms of the GNU General Public License when using
+#   or distributing such scripts, even though portions of the text of the
+#   Macro appear in them. The GNU General Public License (GPL) does govern
+#   all other use of the material that constitutes the Autoconf Macro.
+#
+#   This special exception to the GPL applies to versions of the Autoconf
+#   Macro released by the Autoconf Archive. When you make and distribute a
+#   modified version of the Autoconf Macro, you may extend this special
+#   exception to the GPL to apply to your modified version as well.
+
+#serial 4
+
+AC_DEFUN([AX_CHECK_LINK_FLAG],
+[AC_PREREQ(2.64)dnl for _AC_LANG_PREFIX and AS_VAR_IF
+AS_VAR_PUSHDEF([CACHEVAR],[ax_cv_check_ldflags_$4_$1])dnl
+AC_CACHE_CHECK([whether the linker accepts $1], CACHEVAR, [
+  ax_check_save_flags=$LDFLAGS
+  LDFLAGS="$LDFLAGS $4 $1"
+  AC_LINK_IFELSE([m4_default([$5],[AC_LANG_PROGRAM()])],
+    [AS_VAR_SET(CACHEVAR,[yes])],
+    [AS_VAR_SET(CACHEVAR,[no])])
+  LDFLAGS=$ax_check_save_flags])
+AS_VAR_IF(CACHEVAR,yes,
+  [m4_default([$2], :)],
+  [m4_default([$3], :)])
+AS_VAR_POPDEF([CACHEVAR])dnl
+])dnl AX_CHECK_LINK_FLAGS
diff --git a/depend/zcash/build-aux/m4/ax_check_preproc_flag.m4 b/depend/zcash/build-aux/m4/ax_check_preproc_flag.m4
new file mode 100644
index 000000000..ca1d5ee2b
--- /dev/null
+++ b/depend/zcash/build-aux/m4/ax_check_preproc_flag.m4
@@ -0,0 +1,74 @@
+# ===========================================================================
+#   http://www.gnu.org/software/autoconf-archive/ax_check_preproc_flag.html
+# ===========================================================================
+#
+# SYNOPSIS
+#
+#   AX_CHECK_PREPROC_FLAG(FLAG, [ACTION-SUCCESS], [ACTION-FAILURE], [EXTRA-FLAGS], [INPUT])
+#
+# DESCRIPTION
+#
+#   Check whether the given FLAG works with the current language's
+#   preprocessor or gives an error.  (Warnings, however, are ignored)
+#
+#   ACTION-SUCCESS/ACTION-FAILURE are shell commands to execute on
+#   success/failure.
+#
+#   If EXTRA-FLAGS is defined, it is added to the preprocessor's default
+#   flags when the check is done.  The check is thus made with the flags:
+#   "CPPFLAGS EXTRA-FLAGS FLAG".  This can for example be used to force the
+#   preprocessor to issue an error when a bad flag is given.
+#
+#   INPUT gives an alternative input source to AC_PREPROC_IFELSE.
+#
+#   NOTE: Implementation based on AX_CFLAGS_GCC_OPTION. Please keep this
+#   macro in sync with AX_CHECK_{COMPILE,LINK}_FLAG.
+#
+# LICENSE
+#
+#   Copyright (c) 2008 Guido U. Draheim <guidod@gmx.de>
+#   Copyright (c) 2011 Maarten Bosmans <mkbosmans@gmail.com>
+#
+#   This program is free software: you can redistribute it and/or modify it
+#   under the terms of the GNU General Public License as published by the
+#   Free Software Foundation, either version 3 of the License, or (at your
+#   option) any later version.
+#
+#   This program is distributed in the hope that it will be useful, but
+#   WITHOUT ANY WARRANTY; without even the implied warranty of
+#   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
+#   Public License for more details.
+#
+#   You should have received a copy of the GNU General Public License along
+#   with this program. If not, see <http://www.gnu.org/licenses/>.
+#
+#   As a special exception, the respective Autoconf Macro's copyright owner
+#   gives unlimited permission to copy, distribute and modify the configure
+#   scripts that are the output of Autoconf when processing the Macro. You
+#   need not follow the terms of the GNU General Public License when using
+#   or distributing such scripts, even though portions of the text of the
+#   Macro appear in them. The GNU General Public License (GPL) does govern
+#   all other use of the material that constitutes the Autoconf Macro.
+#
+#   This special exception to the GPL applies to versions of the Autoconf
+#   Macro released by the Autoconf Archive. When you make and distribute a
+#   modified version of the Autoconf Macro, you may extend this special
+#   exception to the GPL to apply to your modified version as well.
+
+#serial 4
+
+AC_DEFUN([AX_CHECK_PREPROC_FLAG],
+[AC_PREREQ(2.64)dnl for _AC_LANG_PREFIX and AS_VAR_IF
+AS_VAR_PUSHDEF([CACHEVAR],[ax_cv_check_[]_AC_LANG_ABBREV[]cppflags_$4_$1])dnl
+AC_CACHE_CHECK([whether _AC_LANG preprocessor accepts $1], CACHEVAR, [
+  ax_check_save_flags=$CPPFLAGS
+  CPPFLAGS="$CPPFLAGS $4 $1"
+  AC_PREPROC_IFELSE([m4_default([$5],[AC_LANG_PROGRAM()])],
+    [AS_VAR_SET(CACHEVAR,[yes])],
+    [AS_VAR_SET(CACHEVAR,[no])])
+  CPPFLAGS=$ax_check_save_flags])
+AS_VAR_IF(CACHEVAR,yes,
+  [m4_default([$2], :)],
+  [m4_default([$3], :)])
+AS_VAR_POPDEF([CACHEVAR])dnl
+])dnl AX_CHECK_PREPROC_FLAGS
diff --git a/depend/zcash/build-aux/m4/ax_cxx_compile_stdcxx.m4 b/depend/zcash/build-aux/m4/ax_cxx_compile_stdcxx.m4
new file mode 100644
index 000000000..43087b2e6
--- /dev/null
+++ b/depend/zcash/build-aux/m4/ax_cxx_compile_stdcxx.m4
@@ -0,0 +1,951 @@
+# ===========================================================================
+#  https://www.gnu.org/software/autoconf-archive/ax_cxx_compile_stdcxx.html
+# ===========================================================================
+#
+# SYNOPSIS
+#
+#   AX_CXX_COMPILE_STDCXX(VERSION, [ext|noext], [mandatory|optional])
+#
+# DESCRIPTION
+#
+#   Check for baseline language coverage in the compiler for the specified
+#   version of the C++ standard.  If necessary, add switches to CXX and
+#   CXXCPP to enable support.  VERSION may be '11' (for the C++11 standard)
+#   or '14' (for the C++14 standard).
+#
+#   The second argument, if specified, indicates whether you insist on an
+#   extended mode (e.g. -std=gnu++11) or a strict conformance mode (e.g.
+#   -std=c++11).  If neither is specified, you get whatever works, with
+#   preference for an extended mode.
+#
+#   The third argument, if specified 'mandatory' or if left unspecified,
+#   indicates that baseline support for the specified C++ standard is
+#   required and that the macro should error out if no mode with that
+#   support is found.  If specified 'optional', then configuration proceeds
+#   regardless, after defining HAVE_CXX${VERSION} if and only if a
+#   supporting mode is found.
+#
+# LICENSE
+#
+#   Copyright (c) 2008 Benjamin Kosnik <bkoz@redhat.com>
+#   Copyright (c) 2012 Zack Weinberg <zackw@panix.com>
+#   Copyright (c) 2013 Roy Stogner <roystgnr@ices.utexas.edu>
+#   Copyright (c) 2014, 2015 Google Inc.; contributed by Alexey Sokolov <sokolov@google.com>
+#   Copyright (c) 2015 Paul Norman <penorman@mac.com>
+#   Copyright (c) 2015 Moritz Klammler <moritz@klammler.eu>
+#   Copyright (c) 2016, 2018 Krzesimir Nowak <qdlacz@gmail.com>
+#   Copyright (c) 2019 Enji Cooper <yaneurabeya@gmail.com>
+#
+#   Copying and distribution of this file, with or without modification, are
+#   permitted in any medium without royalty provided the copyright notice
+#   and this notice are preserved.  This file is offered as-is, without any
+#   warranty.
+
+#serial 11
+
+dnl  This macro is based on the code from the AX_CXX_COMPILE_STDCXX_11 macro
+dnl  (serial version number 13).
+
+AC_DEFUN([AX_CXX_COMPILE_STDCXX], [dnl
+  m4_if([$1], [11], [ax_cxx_compile_alternatives="11 0x"],
+        [$1], [14], [ax_cxx_compile_alternatives="14 1y"],
+        [$1], [17], [ax_cxx_compile_alternatives="17 1z"],
+        [m4_fatal([invalid first argument `$1' to AX_CXX_COMPILE_STDCXX])])dnl
+  m4_if([$2], [], [],
+        [$2], [ext], [],
+        [$2], [noext], [],
+        [m4_fatal([invalid second argument `$2' to AX_CXX_COMPILE_STDCXX])])dnl
+  m4_if([$3], [], [ax_cxx_compile_cxx$1_required=true],
+        [$3], [mandatory], [ax_cxx_compile_cxx$1_required=true],
+        [$3], [optional], [ax_cxx_compile_cxx$1_required=false],
+        [m4_fatal([invalid third argument `$3' to AX_CXX_COMPILE_STDCXX])])
+  AC_LANG_PUSH([C++])dnl
+  ac_success=no
+
+  m4_if([$2], [noext], [], [dnl
+  if test x$ac_success = xno; then
+    for alternative in ${ax_cxx_compile_alternatives}; do
+      switch="-std=gnu++${alternative}"
+      cachevar=AS_TR_SH([ax_cv_cxx_compile_cxx$1_$switch])
+      AC_CACHE_CHECK(whether $CXX supports C++$1 features with $switch,
+                     $cachevar,
+        [ac_save_CXX="$CXX"
+         CXX="$CXX $switch"
+         AC_COMPILE_IFELSE([AC_LANG_SOURCE([_AX_CXX_COMPILE_STDCXX_testbody_$1])],
+          [eval $cachevar=yes],
+          [eval $cachevar=no])
+         CXX="$ac_save_CXX"])
+      if eval test x\$$cachevar = xyes; then
+        CXX="$CXX $switch"
+        if test -n "$CXXCPP" ; then
+          CXXCPP="$CXXCPP $switch"
+        fi
+        ac_success=yes
+        break
+      fi
+    done
+  fi])
+
+  m4_if([$2], [ext], [], [dnl
+  if test x$ac_success = xno; then
+    dnl HP's aCC needs +std=c++11 according to:
+    dnl http://h21007.www2.hp.com/portal/download/files/unprot/aCxx/PDF_Release_Notes/769149-001.pdf
+    dnl Cray's crayCC needs "-h std=c++11"
+    for alternative in ${ax_cxx_compile_alternatives}; do
+      for switch in -std=c++${alternative} +std=c++${alternative} "-h std=c++${alternative}"; do
+        cachevar=AS_TR_SH([ax_cv_cxx_compile_cxx$1_$switch])
+        AC_CACHE_CHECK(whether $CXX supports C++$1 features with $switch,
+                       $cachevar,
+          [ac_save_CXX="$CXX"
+           CXX="$CXX $switch"
+           AC_COMPILE_IFELSE([AC_LANG_SOURCE([_AX_CXX_COMPILE_STDCXX_testbody_$1])],
+            [eval $cachevar=yes],
+            [eval $cachevar=no])
+           CXX="$ac_save_CXX"])
+        if eval test x\$$cachevar = xyes; then
+          CXX="$CXX $switch"
+          if test -n "$CXXCPP" ; then
+            CXXCPP="$CXXCPP $switch"
+          fi
+          ac_success=yes
+          break
+        fi
+      done
+      if test x$ac_success = xyes; then
+        break
+      fi
+    done
+  fi])
+  AC_LANG_POP([C++])
+  if test x$ax_cxx_compile_cxx$1_required = xtrue; then
+    if test x$ac_success = xno; then
+      AC_MSG_ERROR([*** A compiler with support for C++$1 language features is required.])
+    fi
+  fi
+  if test x$ac_success = xno; then
+    HAVE_CXX$1=0
+    AC_MSG_NOTICE([No compiler with C++$1 support was found])
+  else
+    HAVE_CXX$1=1
+    AC_DEFINE(HAVE_CXX$1,1,
+              [define if the compiler supports basic C++$1 syntax])
+  fi
+  AC_SUBST(HAVE_CXX$1)
+])
+
+
+dnl  Test body for checking C++11 support
+
+m4_define([_AX_CXX_COMPILE_STDCXX_testbody_11],
+  _AX_CXX_COMPILE_STDCXX_testbody_new_in_11
+)
+
+
+dnl  Test body for checking C++14 support
+
+m4_define([_AX_CXX_COMPILE_STDCXX_testbody_14],
+  _AX_CXX_COMPILE_STDCXX_testbody_new_in_11
+  _AX_CXX_COMPILE_STDCXX_testbody_new_in_14
+)
+
+m4_define([_AX_CXX_COMPILE_STDCXX_testbody_17],
+  _AX_CXX_COMPILE_STDCXX_testbody_new_in_11
+  _AX_CXX_COMPILE_STDCXX_testbody_new_in_14
+  _AX_CXX_COMPILE_STDCXX_testbody_new_in_17
+)
+
+dnl  Tests for new features in C++11
+
+m4_define([_AX_CXX_COMPILE_STDCXX_testbody_new_in_11], [[
+
+// If the compiler admits that it is not ready for C++11, why torture it?
+// Hopefully, this will speed up the test.
+
+#ifndef __cplusplus
+
+#error "This is not a C++ compiler"
+
+#elif __cplusplus < 201103L
+
+#error "This is not a C++11 compiler"
+
+#else
+
+namespace cxx11
+{
+
+  namespace test_static_assert
+  {
+
+    template <typename T>
+    struct check
+    {
+      static_assert(sizeof(int) <= sizeof(T), "not big enough");
+    };
+
+  }
+
+  namespace test_final_override
+  {
+
+    struct Base
+    {
+      virtual ~Base() {}
+      virtual void f() {}
+    };
+
+    struct Derived : public Base
+    {
+      virtual ~Derived() override {}
+      virtual void f() override {}
+    };
+
+  }
+
+  namespace test_double_right_angle_brackets
+  {
+
+    template < typename T >
+    struct check {};
+
+    typedef check<void> single_type;
+    typedef check<check<void>> double_type;
+    typedef check<check<check<void>>> triple_type;
+    typedef check<check<check<check<void>>>> quadruple_type;
+
+  }
+
+  namespace test_decltype
+  {
+
+    int
+    f()
+    {
+      int a = 1;
+      decltype(a) b = 2;
+      return a + b;
+    }
+
+  }
+
+  namespace test_type_deduction
+  {
+
+    template < typename T1, typename T2 >
+    struct is_same
+    {
+      static const bool value = false;
+    };
+
+    template < typename T >
+    struct is_same<T, T>
+    {
+      static const bool value = true;
+    };
+
+    template < typename T1, typename T2 >
+    auto
+    add(T1 a1, T2 a2) -> decltype(a1 + a2)
+    {
+      return a1 + a2;
+    }
+
+    int
+    test(const int c, volatile int v)
+    {
+      static_assert(is_same<int, decltype(0)>::value == true, "");
+      static_assert(is_same<int, decltype(c)>::value == false, "");
+      static_assert(is_same<int, decltype(v)>::value == false, "");
+      auto ac = c;
+      auto av = v;
+      auto sumi = ac + av + 'x';
+      auto sumf = ac + av + 1.0;
+      static_assert(is_same<int, decltype(ac)>::value == true, "");
+      static_assert(is_same<int, decltype(av)>::value == true, "");
+      static_assert(is_same<int, decltype(sumi)>::value == true, "");
+      static_assert(is_same<int, decltype(sumf)>::value == false, "");
+      static_assert(is_same<int, decltype(add(c, v))>::value == true, "");
+      return (sumf > 0.0) ? sumi : add(c, v);
+    }
+
+  }
+
+  namespace test_noexcept
+  {
+
+    int f() { return 0; }
+    int g() noexcept { return 0; }
+
+    static_assert(noexcept(f()) == false, "");
+    static_assert(noexcept(g()) == true, "");
+
+  }
+
+  namespace test_constexpr
+  {
+
+    template < typename CharT >
+    unsigned long constexpr
+    strlen_c_r(const CharT *const s, const unsigned long acc) noexcept
+    {
+      return *s ? strlen_c_r(s + 1, acc + 1) : acc;
+    }
+
+    template < typename CharT >
+    unsigned long constexpr
+    strlen_c(const CharT *const s) noexcept
+    {
+      return strlen_c_r(s, 0UL);
+    }
+
+    static_assert(strlen_c("") == 0UL, "");
+    static_assert(strlen_c("1") == 1UL, "");
+    static_assert(strlen_c("example") == 7UL, "");
+    static_assert(strlen_c("another\0example") == 7UL, "");
+
+  }
+
+  namespace test_rvalue_references
+  {
+
+    template < int N >
+    struct answer
+    {
+      static constexpr int value = N;
+    };
+
+    answer<1> f(int&)       { return answer<1>(); }
+    answer<2> f(const int&) { return answer<2>(); }
+    answer<3> f(int&&)      { return answer<3>(); }
+
+    void
+    test()
+    {
+      int i = 0;
+      const int c = 0;
+      static_assert(decltype(f(i))::value == 1, "");
+      static_assert(decltype(f(c))::value == 2, "");
+      static_assert(decltype(f(0))::value == 3, "");
+    }
+
+  }
+
+  namespace test_uniform_initialization
+  {
+
+    struct test
+    {
+      static const int zero {};
+      static const int one {1};
+    };
+
+    static_assert(test::zero == 0, "");
+    static_assert(test::one == 1, "");
+
+  }
+
+  namespace test_lambdas
+  {
+
+    void
+    test1()
+    {
+      auto lambda1 = [](){};
+      auto lambda2 = lambda1;
+      lambda1();
+      lambda2();
+    }
+
+    int
+    test2()
+    {
+      auto a = [](int i, int j){ return i + j; }(1, 2);
+      auto b = []() -> int { return '0'; }();
+      auto c = [=](){ return a + b; }();
+      auto d = [&](){ return c; }();
+      auto e = [a, &b](int x) mutable {
+        const auto identity = [](int y){ return y; };
+        for (auto i = 0; i < a; ++i)
+          a += b--;
+        return x + identity(a + b);
+      }(0);
+      return a + b + c + d + e;
+    }
+
+    int
+    test3()
+    {
+      const auto nullary = [](){ return 0; };
+      const auto unary = [](int x){ return x; };
+      using nullary_t = decltype(nullary);
+      using unary_t = decltype(unary);
+      const auto higher1st = [](nullary_t f){ return f(); };
+      const auto higher2nd = [unary](nullary_t f1){
+        return [unary, f1](unary_t f2){ return f2(unary(f1())); };
+      };
+      return higher1st(nullary) + higher2nd(nullary)(unary);
+    }
+
+  }
+
+  namespace test_variadic_templates
+  {
+
+    template <int...>
+    struct sum;
+
+    template <int N0, int... N1toN>
+    struct sum<N0, N1toN...>
+    {
+      static constexpr auto value = N0 + sum<N1toN...>::value;
+    };
+
+    template <>
+    struct sum<>
+    {
+      static constexpr auto value = 0;
+    };
+
+    static_assert(sum<>::value == 0, "");
+    static_assert(sum<1>::value == 1, "");
+    static_assert(sum<23>::value == 23, "");
+    static_assert(sum<1, 2>::value == 3, "");
+    static_assert(sum<5, 5, 11>::value == 21, "");
+    static_assert(sum<2, 3, 5, 7, 11, 13>::value == 41, "");
+
+  }
+
+  // http://stackoverflow.com/questions/13728184/template-aliases-and-sfinae
+  // Clang 3.1 fails with headers of libstd++ 4.8.3 when using std::function
+  // because of this.
+  namespace test_template_alias_sfinae
+  {
+
+    struct foo {};
+
+    template<typename T>
+    using member = typename T::member_type;
+
+    template<typename T>
+    void func(...) {}
+
+    template<typename T>
+    void func(member<T>*) {}
+
+    void test();
+
+    void test() { func<foo>(0); }
+
+  }
+
+}  // namespace cxx11
+
+#endif  // __cplusplus >= 201103L
+
+]])
+
+
+dnl  Tests for new features in C++14
+
+m4_define([_AX_CXX_COMPILE_STDCXX_testbody_new_in_14], [[
+
+// If the compiler admits that it is not ready for C++14, why torture it?
+// Hopefully, this will speed up the test.
+
+#ifndef __cplusplus
+
+#error "This is not a C++ compiler"
+
+#elif __cplusplus < 201402L
+
+#error "This is not a C++14 compiler"
+
+#else
+
+namespace cxx14
+{
+
+  namespace test_polymorphic_lambdas
+  {
+
+    int
+    test()
+    {
+      const auto lambda = [](auto&&... args){
+        const auto istiny = [](auto x){
+          return (sizeof(x) == 1UL) ? 1 : 0;
+        };
+        const int aretiny[] = { istiny(args)... };
+        return aretiny[0];
+      };
+      return lambda(1, 1L, 1.0f, '1');
+    }
+
+  }
+
+  namespace test_binary_literals
+  {
+
+    constexpr auto ivii = 0b0000000000101010;
+    static_assert(ivii == 42, "wrong value");
+
+  }
+
+  namespace test_generalized_constexpr
+  {
+
+    template < typename CharT >
+    constexpr unsigned long
+    strlen_c(const CharT *const s) noexcept
+    {
+      auto length = 0UL;
+      for (auto p = s; *p; ++p)
+        ++length;
+      return length;
+    }
+
+    static_assert(strlen_c("") == 0UL, "");
+    static_assert(strlen_c("x") == 1UL, "");
+    static_assert(strlen_c("test") == 4UL, "");
+    static_assert(strlen_c("another\0test") == 7UL, "");
+
+  }
+
+  namespace test_lambda_init_capture
+  {
+
+    int
+    test()
+    {
+      auto x = 0;
+      const auto lambda1 = [a = x](int b){ return a + b; };
+      const auto lambda2 = [a = lambda1(x)](){ return a; };
+      return lambda2();
+    }
+
+  }
+
+  namespace test_digit_separators
+  {
+
+    constexpr auto ten_million = 100'000'000;
+    static_assert(ten_million == 100000000, "");
+
+  }
+
+  namespace test_return_type_deduction
+  {
+
+    auto f(int& x) { return x; }
+    decltype(auto) g(int& x) { return x; }
+
+    template < typename T1, typename T2 >
+    struct is_same
+    {
+      static constexpr auto value = false;
+    };
+
+    template < typename T >
+    struct is_same<T, T>
+    {
+      static constexpr auto value = true;
+    };
+
+    int
+    test()
+    {
+      auto x = 0;
+      static_assert(is_same<int, decltype(f(x))>::value, "");
+      static_assert(is_same<int&, decltype(g(x))>::value, "");
+      return x;
+    }
+
+  }
+
+}  // namespace cxx14
+
+#endif  // __cplusplus >= 201402L
+
+]])
+
+
+dnl  Tests for new features in C++17
+
+m4_define([_AX_CXX_COMPILE_STDCXX_testbody_new_in_17], [[
+
+// If the compiler admits that it is not ready for C++17, why torture it?
+// Hopefully, this will speed up the test.
+
+#ifndef __cplusplus
+
+#error "This is not a C++ compiler"
+
+#elif __cplusplus < 201703L
+
+#error "This is not a C++17 compiler"
+
+#else
+
+#include <initializer_list>
+#include <utility>
+#include <type_traits>
+
+namespace cxx17
+{
+
+  namespace test_constexpr_lambdas
+  {
+
+    constexpr int foo = [](){return 42;}();
+
+  }
+
+  namespace test::nested_namespace::definitions
+  {
+
+  }
+
+  namespace test_fold_expression
+  {
+
+    template<typename... Args>
+    int multiply(Args... args)
+    {
+      return (args * ... * 1);
+    }
+
+    template<typename... Args>
+    bool all(Args... args)
+    {
+      return (args && ...);
+    }
+
+  }
+
+  namespace test_extended_static_assert
+  {
+
+    static_assert (true);
+
+  }
+
+  namespace test_auto_brace_init_list
+  {
+
+    auto foo = {5};
+    auto bar {5};
+
+    static_assert(std::is_same<std::initializer_list<int>, decltype(foo)>::value);
+    static_assert(std::is_same<int, decltype(bar)>::value);
+  }
+
+  namespace test_typename_in_template_template_parameter
+  {
+
+    template<template<typename> typename X> struct D;
+
+  }
+
+  namespace test_fallthrough_nodiscard_maybe_unused_attributes
+  {
+
+    int f1()
+    {
+      return 42;
+    }
+
+    [[nodiscard]] int f2()
+    {
+      [[maybe_unused]] auto unused = f1();
+
+      switch (f1())
+      {
+      case 17:
+        f1();
+        [[fallthrough]];
+      case 42:
+        f1();
+      }
+      return f1();
+    }
+
+  }
+
+  namespace test_extended_aggregate_initialization
+  {
+
+    struct base1
+    {
+      int b1, b2 = 42;
+    };
+
+    struct base2
+    {
+      base2() {
+        b3 = 42;
+      }
+      int b3;
+    };
+
+    struct derived : base1, base2
+    {
+        int d;
+    };
+
+    derived d1 {{1, 2}, {}, 4};  // full initialization
+    derived d2 {{}, {}, 4};      // value-initialized bases
+
+  }
+
+  namespace test_general_range_based_for_loop
+  {
+
+    struct iter
+    {
+      int i;
+
+      int& operator* ()
+      {
+        return i;
+      }
+
+      const int& operator* () const
+      {
+        return i;
+      }
+
+      iter& operator++()
+      {
+        ++i;
+        return *this;
+      }
+    };
+
+    struct sentinel
+    {
+      int i;
+    };
+
+    bool operator== (const iter& i, const sentinel& s)
+    {
+      return i.i == s.i;
+    }
+
+    bool operator!= (const iter& i, const sentinel& s)
+    {
+      return !(i == s);
+    }
+
+    struct range
+    {
+      iter begin() const
+      {
+        return {0};
+      }
+
+      sentinel end() const
+      {
+        return {5};
+      }
+    };
+
+    void f()
+    {
+      range r {};
+
+      for (auto i : r)
+      {
+        [[maybe_unused]] auto v = i;
+      }
+    }
+
+  }
+
+  namespace test_lambda_capture_asterisk_this_by_value
+  {
+
+    struct t
+    {
+      int i;
+      int foo()
+      {
+        return [*this]()
+        {
+          return i;
+        }();
+      }
+    };
+
+  }
+
+  namespace test_enum_class_construction
+  {
+
+    enum class byte : unsigned char
+    {};
+
+    byte foo {42};
+
+  }
+
+  namespace test_constexpr_if
+  {
+
+    template <bool cond>
+    int f ()
+    {
+      if constexpr(cond)
+      {
+        return 13;
+      }
+      else
+      {
+        return 42;
+      }
+    }
+
+  }
+
+  namespace test_selection_statement_with_initializer
+  {
+
+    int f()
+    {
+      return 13;
+    }
+
+    int f2()
+    {
+      if (auto i = f(); i > 0)
+      {
+        return 3;
+      }
+
+      switch (auto i = f(); i + 4)
+      {
+      case 17:
+        return 2;
+
+      default:
+        return 1;
+      }
+    }
+
+  }
+
+  namespace test_template_argument_deduction_for_class_templates
+  {
+
+    template <typename T1, typename T2>
+    struct pair
+    {
+      pair (T1 p1, T2 p2)
+        : m1 {p1},
+          m2 {p2}
+      {}
+
+      T1 m1;
+      T2 m2;
+    };
+
+    void f()
+    {
+      [[maybe_unused]] auto p = pair{13, 42u};
+    }
+
+  }
+
+  namespace test_non_type_auto_template_parameters
+  {
+
+    template <auto n>
+    struct B
+    {};
+
+    B<5> b1;
+    B<'a'> b2;
+
+  }
+
+  namespace test_structured_bindings
+  {
+
+    int arr[2] = { 1, 2 };
+    std::pair<int, int> pr = { 1, 2 };
+
+    auto f1() -> int(&)[2]
+    {
+      return arr;
+    }
+
+    auto f2() -> std::pair<int, int>&
+    {
+      return pr;
+    }
+
+    struct S
+    {
+      int x1 : 2;
+      volatile double y1;
+    };
+
+    S f3()
+    {
+      return {};
+    }
+
+    auto [ x1, y1 ] = f1();
+    auto& [ xr1, yr1 ] = f1();
+    auto [ x2, y2 ] = f2();
+    auto& [ xr2, yr2 ] = f2();
+    const auto [ x3, y3 ] = f3();
+
+  }
+
+  namespace test_exception_spec_type_system
+  {
+
+    struct Good {};
+    struct Bad {};
+
+    void g1() noexcept;
+    void g2();
+
+    template<typename T>
+    Bad
+    f(T*, T*);
+
+    template<typename T1, typename T2>
+    Good
+    f(T1*, T2*);
+
+    static_assert (std::is_same_v<Good, decltype(f(g1, g2))>);
+
+  }
+
+  namespace test_inline_variables
+  {
+
+    template<class T> void f(T)
+    {}
+
+    template<class T> inline T g(T)
+    {
+      return T{};
+    }
+
+    template<> inline void f<>(int)
+    {}
+
+    template<> int g<>(int)
+    {
+      return 5;
+    }
+
+  }
+
+}  // namespace cxx17
+
+#endif  // __cplusplus < 201703L
+
+]])
diff --git a/depend/zcash/build-aux/m4/ax_gcc_func_attribute.m4 b/depend/zcash/build-aux/m4/ax_gcc_func_attribute.m4
new file mode 100644
index 000000000..02b597357
--- /dev/null
+++ b/depend/zcash/build-aux/m4/ax_gcc_func_attribute.m4
@@ -0,0 +1,223 @@
+# ===========================================================================
+#   http://www.gnu.org/software/autoconf-archive/ax_gcc_func_attribute.html
+# ===========================================================================
+#
+# SYNOPSIS
+#
+#   AX_GCC_FUNC_ATTRIBUTE(ATTRIBUTE)
+#
+# DESCRIPTION
+#
+#   This macro checks if the compiler supports one of GCC's function
+#   attributes; many other compilers also provide function attributes with
+#   the same syntax. Compiler warnings are used to detect supported
+#   attributes as unsupported ones are ignored by default so quieting
+#   warnings when using this macro will yield false positives.
+#
+#   The ATTRIBUTE parameter holds the name of the attribute to be checked.
+#
+#   If ATTRIBUTE is supported define HAVE_FUNC_ATTRIBUTE_<ATTRIBUTE>.
+#
+#   The macro caches its result in the ax_cv_have_func_attribute_<attribute>
+#   variable.
+#
+#   The macro currently supports the following function attributes:
+#
+#    alias
+#    aligned
+#    alloc_size
+#    always_inline
+#    artificial
+#    cold
+#    const
+#    constructor
+#    constructor_priority for constructor attribute with priority
+#    deprecated
+#    destructor
+#    dllexport
+#    dllimport
+#    error
+#    externally_visible
+#    flatten
+#    format
+#    format_arg
+#    gnu_inline
+#    hot
+#    ifunc
+#    leaf
+#    malloc
+#    noclone
+#    noinline
+#    nonnull
+#    noreturn
+#    nothrow
+#    optimize
+#    pure
+#    unused
+#    used
+#    visibility
+#    warning
+#    warn_unused_result
+#    weak
+#    weakref
+#
+#   Unsupported function attributes will be tested with a prototype returning
+#   an int and not accepting any arguments and the result of the check might
+#   be wrong or meaningless so use with care.
+#
+# LICENSE
+#
+#   Copyright (c) 2013 Gabriele Svelto <gabriele.svelto@gmail.com>
+#
+#   Copying and distribution of this file, with or without modification, are
+#   permitted in any medium without royalty provided the copyright notice
+#   and this notice are preserved.  This file is offered as-is, without any
+#   warranty.
+
+#serial 3
+
+AC_DEFUN([AX_GCC_FUNC_ATTRIBUTE], [
+    AS_VAR_PUSHDEF([ac_var], [ax_cv_have_func_attribute_$1])
+
+    AC_CACHE_CHECK([for __attribute__(($1))], [ac_var], [
+        AC_LINK_IFELSE([AC_LANG_PROGRAM([
+            m4_case([$1],
+                [alias], [
+                    int foo( void ) { return 0; }
+                    int bar( void ) __attribute__(($1("foo")));
+                ],
+                [aligned], [
+                    int foo( void ) __attribute__(($1(32)));
+                ],
+                [alloc_size], [
+                    void *foo(int a) __attribute__(($1(1)));
+                ],
+                [always_inline], [
+                    inline __attribute__(($1)) int foo( void ) { return 0; }
+                ],
+                [artificial], [
+                    inline __attribute__(($1)) int foo( void ) { return 0; }
+                ],
+                [cold], [
+                    int foo( void ) __attribute__(($1));
+                ],
+                [const], [
+                    int foo( void ) __attribute__(($1));
+                ],
+                [constructor_priority], [
+                    int foo( void ) __attribute__((__constructor__(65535/2)));
+                ],
+                [constructor], [
+                    int foo( void ) __attribute__(($1));
+                ],
+                [deprecated], [
+                    int foo( void ) __attribute__(($1("")));
+                ],
+                [destructor], [
+                    int foo( void ) __attribute__(($1));
+                ],
+                [dllexport], [
+                    __attribute__(($1)) int foo( void ) { return 0; }
+                ],
+                [dllimport], [
+                    int foo( void ) __attribute__(($1));
+                ],
+                [error], [
+                    int foo( void ) __attribute__(($1("")));
+                ],
+                [externally_visible], [
+                    int foo( void ) __attribute__(($1));
+                ],
+                [flatten], [
+                    int foo( void ) __attribute__(($1));
+                ],
+                [format], [
+                    int foo(const char *p, ...) __attribute__(($1(printf, 1, 2)));
+                ],
+                [format_arg], [
+                    char *foo(const char *p) __attribute__(($1(1)));
+                ],
+                [gnu_inline], [
+                    inline __attribute__(($1)) int foo( void ) { return 0; }
+                ],
+                [hot], [
+                    int foo( void ) __attribute__(($1));
+                ],
+                [ifunc], [
+                    int my_foo( void ) { return 0; }
+                    static int (*resolve_foo(void))(void) { return my_foo; }
+                    int foo( void ) __attribute__(($1("resolve_foo")));
+                ],
+                [leaf], [
+                    __attribute__(($1)) int foo( void ) { return 0; }
+                ],
+                [malloc], [
+                    void *foo( void ) __attribute__(($1));
+                ],
+                [noclone], [
+                    int foo( void ) __attribute__(($1));
+                ],
+                [noinline], [
+                    __attribute__(($1)) int foo( void ) { return 0; }
+                ],
+                [nonnull], [
+                    int foo(char *p) __attribute__(($1(1)));
+                ],
+                [noreturn], [
+                    void foo( void ) __attribute__(($1));
+                ],
+                [nothrow], [
+                    int foo( void ) __attribute__(($1));
+                ],
+                [optimize], [
+                    __attribute__(($1(3))) int foo( void ) { return 0; }
+                ],
+                [pure], [
+                    int foo( void ) __attribute__(($1));
+                ],
+                [unused], [
+                    int foo( void ) __attribute__(($1));
+                ],
+                [used], [
+                    int foo( void ) __attribute__(($1));
+                ],
+                [visibility], [
+                    int foo_def( void ) __attribute__(($1("default")));
+                    int foo_hid( void ) __attribute__(($1("hidden")));
+                    int foo_int( void ) __attribute__(($1("internal")));
+                    int foo_pro( void ) __attribute__(($1("protected")));
+                ],
+                [warning], [
+                    int foo( void ) __attribute__(($1("")));
+                ],
+                [warn_unused_result], [
+                    int foo( void ) __attribute__(($1));
+                ],
+                [weak], [
+                    int foo( void ) __attribute__(($1));
+                ],
+                [weakref], [
+                    static int foo( void ) { return 0; }
+                    static int bar( void ) __attribute__(($1("foo")));
+                ],
+                [
+                 m4_warn([syntax], [Unsupported attribute $1, the test may fail])
+                 int foo( void ) __attribute__(($1));
+                ]
+            )], [])
+            ],
+            dnl GCC doesn't exit with an error if an unknown attribute is
+            dnl provided but only outputs a warning, so accept the attribute
+            dnl only if no warning were issued.
+            [AS_IF([test -s conftest.err],
+                [AS_VAR_SET([ac_var], [no])],
+                [AS_VAR_SET([ac_var], [yes])])],
+            [AS_VAR_SET([ac_var], [no])])
+    ])
+
+    AS_IF([test yes = AS_VAR_GET([ac_var])],
+        [AC_DEFINE_UNQUOTED(AS_TR_CPP(HAVE_FUNC_ATTRIBUTE_$1), 1,
+            [Define to 1 if the system has the `$1' function attribute])], [])
+
+    AS_VAR_POPDEF([ac_var])
+])
diff --git a/depend/zcash/build-aux/m4/ax_pthread.m4 b/depend/zcash/build-aux/m4/ax_pthread.m4
new file mode 100644
index 000000000..d218d1af7
--- /dev/null
+++ b/depend/zcash/build-aux/m4/ax_pthread.m4
@@ -0,0 +1,485 @@
+# ===========================================================================
+#        http://www.gnu.org/software/autoconf-archive/ax_pthread.html
+# ===========================================================================
+#
+# SYNOPSIS
+#
+#   AX_PTHREAD([ACTION-IF-FOUND[, ACTION-IF-NOT-FOUND]])
+#
+# DESCRIPTION
+#
+#   This macro figures out how to build C programs using POSIX threads. It
+#   sets the PTHREAD_LIBS output variable to the threads library and linker
+#   flags, and the PTHREAD_CFLAGS output variable to any special C compiler
+#   flags that are needed. (The user can also force certain compiler
+#   flags/libs to be tested by setting these environment variables.)
+#
+#   Also sets PTHREAD_CC to any special C compiler that is needed for
+#   multi-threaded programs (defaults to the value of CC otherwise). (This
+#   is necessary on AIX to use the special cc_r compiler alias.)
+#
+#   NOTE: You are assumed to not only compile your program with these flags,
+#   but also to link with them as well. For example, you might link with
+#   $PTHREAD_CC $CFLAGS $PTHREAD_CFLAGS $LDFLAGS ... $PTHREAD_LIBS $LIBS
+#
+#   If you are only building threaded programs, you may wish to use these
+#   variables in your default LIBS, CFLAGS, and CC:
+#
+#     LIBS="$PTHREAD_LIBS $LIBS"
+#     CFLAGS="$CFLAGS $PTHREAD_CFLAGS"
+#     CC="$PTHREAD_CC"
+#
+#   In addition, if the PTHREAD_CREATE_JOINABLE thread-attribute constant
+#   has a nonstandard name, this macro defines PTHREAD_CREATE_JOINABLE to
+#   that name (e.g. PTHREAD_CREATE_UNDETACHED on AIX).
+#
+#   Also HAVE_PTHREAD_PRIO_INHERIT is defined if pthread is found and the
+#   PTHREAD_PRIO_INHERIT symbol is defined when compiling with
+#   PTHREAD_CFLAGS.
+#
+#   ACTION-IF-FOUND is a list of shell commands to run if a threads library
+#   is found, and ACTION-IF-NOT-FOUND is a list of commands to run it if it
+#   is not found. If ACTION-IF-FOUND is not specified, the default action
+#   will define HAVE_PTHREAD.
+#
+#   Please let the authors know if this macro fails on any platform, or if
+#   you have any other suggestions or comments. This macro was based on work
+#   by SGJ on autoconf scripts for FFTW (http://www.fftw.org/) (with help
+#   from M. Frigo), as well as ac_pthread and hb_pthread macros posted by
+#   Alejandro Forero Cuervo to the autoconf macro repository. We are also
+#   grateful for the helpful feedback of numerous users.
+#
+#   Updated for Autoconf 2.68 by Daniel Richard G.
+#
+# LICENSE
+#
+#   Copyright (c) 2008 Steven G. Johnson <stevenj@alum.mit.edu>
+#   Copyright (c) 2011 Daniel Richard G. <skunk@iSKUNK.ORG>
+#
+#   This program is free software: you can redistribute it and/or modify it
+#   under the terms of the GNU General Public License as published by the
+#   Free Software Foundation, either version 3 of the License, or (at your
+#   option) any later version.
+#
+#   This program is distributed in the hope that it will be useful, but
+#   WITHOUT ANY WARRANTY; without even the implied warranty of
+#   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
+#   Public License for more details.
+#
+#   You should have received a copy of the GNU General Public License along
+#   with this program. If not, see <http://www.gnu.org/licenses/>.
+#
+#   As a special exception, the respective Autoconf Macro's copyright owner
+#   gives unlimited permission to copy, distribute and modify the configure
+#   scripts that are the output of Autoconf when processing the Macro. You
+#   need not follow the terms of the GNU General Public License when using
+#   or distributing such scripts, even though portions of the text of the
+#   Macro appear in them. The GNU General Public License (GPL) does govern
+#   all other use of the material that constitutes the Autoconf Macro.
+#
+#   This special exception to the GPL applies to versions of the Autoconf
+#   Macro released by the Autoconf Archive. When you make and distribute a
+#   modified version of the Autoconf Macro, you may extend this special
+#   exception to the GPL to apply to your modified version as well.
+
+#serial 22
+
+AU_ALIAS([ACX_PTHREAD], [AX_PTHREAD])
+AC_DEFUN([AX_PTHREAD], [
+AC_REQUIRE([AC_CANONICAL_HOST])
+AC_REQUIRE([AC_PROG_CC])
+AC_REQUIRE([AC_PROG_SED])
+AC_LANG_PUSH([C])
+ax_pthread_ok=no
+
+# We used to check for pthread.h first, but this fails if pthread.h
+# requires special compiler flags (e.g. on Tru64 or Sequent).
+# It gets checked for in the link test anyway.
+
+# First of all, check if the user has set any of the PTHREAD_LIBS,
+# etcetera environment variables, and if threads linking works using
+# them:
+if test "x$PTHREAD_CFLAGS$PTHREAD_LIBS" != "x"; then
+	ax_pthread_save_CC="$CC"
+	ax_pthread_save_CFLAGS="$CFLAGS"
+	ax_pthread_save_LIBS="$LIBS"
+	AS_IF([test "x$PTHREAD_CC" != "x"], [CC="$PTHREAD_CC"])
+	CFLAGS="$CFLAGS $PTHREAD_CFLAGS"
+	LIBS="$PTHREAD_LIBS $LIBS"
+	AC_MSG_CHECKING([for pthread_join using $CC $PTHREAD_CFLAGS $PTHREAD_LIBS])
+	AC_LINK_IFELSE([AC_LANG_CALL([], [pthread_join])], [ax_pthread_ok=yes])
+	AC_MSG_RESULT([$ax_pthread_ok])
+	if test "x$ax_pthread_ok" = "xno"; then
+		PTHREAD_LIBS=""
+		PTHREAD_CFLAGS=""
+	fi
+	CC="$ax_pthread_save_CC"
+	CFLAGS="$ax_pthread_save_CFLAGS"
+	LIBS="$ax_pthread_save_LIBS"
+fi
+
+# We must check for the threads library under a number of different
+# names; the ordering is very important because some systems
+# (e.g. DEC) have both -lpthread and -lpthreads, where one of the
+# libraries is broken (non-POSIX).
+
+# Create a list of thread flags to try.  Items starting with a "-" are
+# C compiler flags, and other items are library names, except for "none"
+# which indicates that we try without any flags at all, and "pthread-config"
+# which is a program returning the flags for the Pth emulation library.
+
+ax_pthread_flags="pthreads none -Kthread -pthread -pthreads -mthreads pthread --thread-safe -mt pthread-config"
+
+# The ordering *is* (sometimes) important.  Some notes on the
+# individual items follow:
+
+# pthreads: AIX (must check this before -lpthread)
+# none: in case threads are in libc; should be tried before -Kthread and
+#       other compiler flags to prevent continual compiler warnings
+# -Kthread: Sequent (threads in libc, but -Kthread needed for pthread.h)
+# -pthread: Linux/gcc (kernel threads), BSD/gcc (userland threads), Tru64
+#           (Note: HP C rejects this with "bad form for `-t' option")
+# -pthreads: Solaris/gcc (Note: HP C also rejects)
+# -mt: Sun Workshop C (may only link SunOS threads [-lthread], but it
+#      doesn't hurt to check since this sometimes defines pthreads and
+#      -D_REENTRANT too), HP C (must be checked before -lpthread, which
+#      is present but should not be used directly; and before -mthreads,
+#      because the compiler interprets this as "-mt" + "-hreads")
+# -mthreads: Mingw32/gcc, Lynx/gcc
+# pthread: Linux, etcetera
+# --thread-safe: KAI C++
+# pthread-config: use pthread-config program (for GNU Pth library)
+
+case $host_os in
+
+	freebsd*)
+
+	# -kthread: FreeBSD kernel threads (preferred to -pthread since SMP-able)
+	# lthread: LinuxThreads port on FreeBSD (also preferred to -pthread)
+
+	ax_pthread_flags="-kthread lthread $ax_pthread_flags"
+	;;
+
+	hpux*)
+
+	# From the cc(1) man page: "[-mt] Sets various -D flags to enable
+	# multi-threading and also sets -lpthread."
+
+	ax_pthread_flags="-mt -pthread pthread $ax_pthread_flags"
+	;;
+
+	openedition*)
+
+	# IBM z/OS requires a feature-test macro to be defined in order to
+	# enable POSIX threads at all, so give the user a hint if this is
+	# not set. (We don't define these ourselves, as they can affect
+	# other portions of the system API in unpredictable ways.)
+
+	AC_EGREP_CPP([AX_PTHREAD_ZOS_MISSING],
+	    [
+#	     if !defined(_OPEN_THREADS) && !defined(_UNIX03_THREADS)
+	     AX_PTHREAD_ZOS_MISSING
+#	     endif
+	    ],
+	    [AC_MSG_WARN([IBM z/OS requires -D_OPEN_THREADS or -D_UNIX03_THREADS to enable pthreads support.])])
+	;;
+
+	solaris*)
+
+	# On Solaris (at least, for some versions), libc contains stubbed
+	# (non-functional) versions of the pthreads routines, so link-based
+	# tests will erroneously succeed. (N.B.: The stubs are missing
+	# pthread_cleanup_push, or rather a function called by this macro,
+	# so we could check for that, but who knows whether they'll stub
+	# that too in a future libc.)  So we'll check first for the
+	# standard Solaris way of linking pthreads (-mt -lpthread).
+
+	ax_pthread_flags="-mt,pthread pthread $ax_pthread_flags"
+	;;
+esac
+
+# GCC generally uses -pthread, or -pthreads on some platforms (e.g. SPARC)
+
+AS_IF([test "x$GCC" = "xyes"],
+      [ax_pthread_flags="-pthread -pthreads $ax_pthread_flags"])
+
+# The presence of a feature test macro requesting re-entrant function
+# definitions is, on some systems, a strong hint that pthreads support is
+# correctly enabled
+
+case $host_os in
+	darwin* | hpux* | linux* | osf* | solaris*)
+	ax_pthread_check_macro="_REENTRANT"
+	;;
+
+	aix* | freebsd*)
+	ax_pthread_check_macro="_THREAD_SAFE"
+	;;
+
+	*)
+	ax_pthread_check_macro="--"
+	;;
+esac
+AS_IF([test "x$ax_pthread_check_macro" = "x--"],
+      [ax_pthread_check_cond=0],
+      [ax_pthread_check_cond="!defined($ax_pthread_check_macro)"])
+
+# Are we compiling with Clang?
+
+AC_CACHE_CHECK([whether $CC is Clang],
+    [ax_cv_PTHREAD_CLANG],
+    [ax_cv_PTHREAD_CLANG=no
+     # Note that Autoconf sets GCC=yes for Clang as well as GCC
+     if test "x$GCC" = "xyes"; then
+	AC_EGREP_CPP([AX_PTHREAD_CC_IS_CLANG],
+	    [/* Note: Clang 2.7 lacks __clang_[a-z]+__ */
+#	     if defined(__clang__) && defined(__llvm__)
+	     AX_PTHREAD_CC_IS_CLANG
+#	     endif
+	    ],
+	    [ax_cv_PTHREAD_CLANG=yes])
+     fi
+    ])
+ax_pthread_clang="$ax_cv_PTHREAD_CLANG"
+
+ax_pthread_clang_warning=no
+
+# Clang needs special handling, because older versions handle the -pthread
+# option in a rather... idiosyncratic way
+
+if test "x$ax_pthread_clang" = "xyes"; then
+
+	# Clang takes -pthread; it has never supported any other flag
+
+	# (Note 1: This will need to be revisited if a system that Clang
+	# supports has POSIX threads in a separate library.  This tends not
+	# to be the way of modern systems, but it's conceivable.)
+
+	# (Note 2: On some systems, notably Darwin, -pthread is not needed
+	# to get POSIX threads support; the API is always present and
+	# active.  We could reasonably leave PTHREAD_CFLAGS empty.  But
+	# -pthread does define _REENTRANT, and while the Darwin headers
+	# ignore this macro, third-party headers might not.)
+
+	PTHREAD_CFLAGS="-pthread"
+	PTHREAD_LIBS=
+
+	ax_pthread_ok=yes
+
+	# However, older versions of Clang make a point of warning the user
+	# that, in an invocation where only linking and no compilation is
+	# taking place, the -pthread option has no effect ("argument unused
+	# during compilation").  They expect -pthread to be passed in only
+	# when source code is being compiled.
+	#
+	# Problem is, this is at odds with the way Automake and most other
+	# C build frameworks function, which is that the same flags used in
+	# compilation (CFLAGS) are also used in linking.  Many systems
+	# supported by AX_PTHREAD require exactly this for POSIX threads
+	# support, and in fact it is often not straightforward to specify a
+	# flag that is used only in the compilation phase and not in
+	# linking.  Such a scenario is extremely rare in practice.
+	#
+	# Even though use of the -pthread flag in linking would only print
+	# a warning, this can be a nuisance for well-run software projects
+	# that build with -Werror.  So if the active version of Clang has
+	# this misfeature, we search for an option to squash it.
+
+	AC_CACHE_CHECK([whether Clang needs flag to prevent "argument unused" warning when linking with -pthread],
+	    [ax_cv_PTHREAD_CLANG_NO_WARN_FLAG],
+	    [ax_cv_PTHREAD_CLANG_NO_WARN_FLAG=unknown
+	     # Create an alternate version of $ac_link that compiles and
+	     # links in two steps (.c -> .o, .o -> exe) instead of one
+	     # (.c -> exe), because the warning occurs only in the second
+	     # step
+	     ax_pthread_save_ac_link="$ac_link"
+	     ax_pthread_sed='s/conftest\.\$ac_ext/conftest.$ac_objext/g'
+	     ax_pthread_link_step=`$as_echo "$ac_link" | sed "$ax_pthread_sed"`
+	     ax_pthread_2step_ac_link="($ac_compile) && (echo ==== >&5) && ($ax_pthread_link_step)"
+	     ax_pthread_save_CFLAGS="$CFLAGS"
+	     for ax_pthread_try in '' -Qunused-arguments -Wno-unused-command-line-argument unknown; do
+		AS_IF([test "x$ax_pthread_try" = "xunknown"], [break])
+		CFLAGS="-Werror -Wunknown-warning-option $ax_pthread_try -pthread $ax_pthread_save_CFLAGS"
+		ac_link="$ax_pthread_save_ac_link"
+		AC_LINK_IFELSE([AC_LANG_SOURCE([[int main(void){return 0;}]])],
+		    [ac_link="$ax_pthread_2step_ac_link"
+		     AC_LINK_IFELSE([AC_LANG_SOURCE([[int main(void){return 0;}]])],
+			 [break])
+		    ])
+	     done
+	     ac_link="$ax_pthread_save_ac_link"
+	     CFLAGS="$ax_pthread_save_CFLAGS"
+	     AS_IF([test "x$ax_pthread_try" = "x"], [ax_pthread_try=no])
+	     ax_cv_PTHREAD_CLANG_NO_WARN_FLAG="$ax_pthread_try"
+	    ])
+
+	case "$ax_cv_PTHREAD_CLANG_NO_WARN_FLAG" in
+		no | unknown) ;;
+		*) PTHREAD_CFLAGS="$ax_cv_PTHREAD_CLANG_NO_WARN_FLAG $PTHREAD_CFLAGS" ;;
+	esac
+
+fi # $ax_pthread_clang = yes
+
+if test "x$ax_pthread_ok" = "xno"; then
+for ax_pthread_try_flag in $ax_pthread_flags; do
+
+	case $ax_pthread_try_flag in
+		none)
+		AC_MSG_CHECKING([whether pthreads work without any flags])
+		;;
+
+		-mt,pthread)
+		AC_MSG_CHECKING([whether pthreads work with -mt -lpthread])
+		PTHREAD_CFLAGS="-mt"
+		PTHREAD_LIBS="-lpthread"
+		;;
+
+		-*)
+		AC_MSG_CHECKING([whether pthreads work with $ax_pthread_try_flag])
+		PTHREAD_CFLAGS="$ax_pthread_try_flag"
+		;;
+
+		pthread-config)
+		AC_CHECK_PROG([ax_pthread_config], [pthread-config], [yes], [no])
+		AS_IF([test "x$ax_pthread_config" = "xno"], [continue])
+		PTHREAD_CFLAGS="`pthread-config --cflags`"
+		PTHREAD_LIBS="`pthread-config --ldflags` `pthread-config --libs`"
+		;;
+
+		*)
+		AC_MSG_CHECKING([for the pthreads library -l$ax_pthread_try_flag])
+		PTHREAD_LIBS="-l$ax_pthread_try_flag"
+		;;
+	esac
+
+	ax_pthread_save_CFLAGS="$CFLAGS"
+	ax_pthread_save_LIBS="$LIBS"
+	CFLAGS="$CFLAGS $PTHREAD_CFLAGS"
+	LIBS="$PTHREAD_LIBS $LIBS"
+
+	# Check for various functions.  We must include pthread.h,
+	# since some functions may be macros.  (On the Sequent, we
+	# need a special flag -Kthread to make this header compile.)
+	# We check for pthread_join because it is in -lpthread on IRIX
+	# while pthread_create is in libc.  We check for pthread_attr_init
+	# due to DEC craziness with -lpthreads.  We check for
+	# pthread_cleanup_push because it is one of the few pthread
+	# functions on Solaris that doesn't have a non-functional libc stub.
+	# We try pthread_create on general principles.
+
+	AC_LINK_IFELSE([AC_LANG_PROGRAM([#include <pthread.h>
+#			if $ax_pthread_check_cond
+#			 error "$ax_pthread_check_macro must be defined"
+#			endif
+			static void routine(void *a) { a = 0; }
+			static void *start_routine(void *a) { return a; }],
+		       [pthread_t th; pthread_attr_t attr;
+			pthread_create(&th, 0, start_routine, 0);
+			pthread_join(th, 0);
+			pthread_attr_init(&attr);
+			pthread_cleanup_push(routine, 0);
+			pthread_cleanup_pop(0) /* ; */])],
+	    [ax_pthread_ok=yes],
+	    [])
+
+	CFLAGS="$ax_pthread_save_CFLAGS"
+	LIBS="$ax_pthread_save_LIBS"
+
+	AC_MSG_RESULT([$ax_pthread_ok])
+	AS_IF([test "x$ax_pthread_ok" = "xyes"], [break])
+
+	PTHREAD_LIBS=""
+	PTHREAD_CFLAGS=""
+done
+fi
+
+# Various other checks:
+if test "x$ax_pthread_ok" = "xyes"; then
+	ax_pthread_save_CFLAGS="$CFLAGS"
+	ax_pthread_save_LIBS="$LIBS"
+	CFLAGS="$CFLAGS $PTHREAD_CFLAGS"
+	LIBS="$PTHREAD_LIBS $LIBS"
+
+	# Detect AIX lossage: JOINABLE attribute is called UNDETACHED.
+	AC_CACHE_CHECK([for joinable pthread attribute],
+	    [ax_cv_PTHREAD_JOINABLE_ATTR],
+	    [ax_cv_PTHREAD_JOINABLE_ATTR=unknown
+	     for ax_pthread_attr in PTHREAD_CREATE_JOINABLE PTHREAD_CREATE_UNDETACHED; do
+		 AC_LINK_IFELSE([AC_LANG_PROGRAM([#include <pthread.h>],
+						 [int attr = $ax_pthread_attr; return attr /* ; */])],
+				[ax_cv_PTHREAD_JOINABLE_ATTR=$ax_pthread_attr; break],
+				[])
+	     done
+	    ])
+	AS_IF([test "x$ax_cv_PTHREAD_JOINABLE_ATTR" != "xunknown" && \
+	       test "x$ax_cv_PTHREAD_JOINABLE_ATTR" != "xPTHREAD_CREATE_JOINABLE" && \
+	       test "x$ax_pthread_joinable_attr_defined" != "xyes"],
+	      [AC_DEFINE_UNQUOTED([PTHREAD_CREATE_JOINABLE],
+				  [$ax_cv_PTHREAD_JOINABLE_ATTR],
+				  [Define to necessary symbol if this constant
+				   uses a non-standard name on your system.])
+	       ax_pthread_joinable_attr_defined=yes
+	      ])
+
+	AC_CACHE_CHECK([whether more special flags are required for pthreads],
+	    [ax_cv_PTHREAD_SPECIAL_FLAGS],
+	    [ax_cv_PTHREAD_SPECIAL_FLAGS=no
+	     case $host_os in
+	     solaris*)
+	     ax_cv_PTHREAD_SPECIAL_FLAGS="-D_POSIX_PTHREAD_SEMANTICS"
+	     ;;
+	     esac
+	    ])
+	AS_IF([test "x$ax_cv_PTHREAD_SPECIAL_FLAGS" != "xno" && \
+	       test "x$ax_pthread_special_flags_added" != "xyes"],
+	      [PTHREAD_CFLAGS="$ax_cv_PTHREAD_SPECIAL_FLAGS $PTHREAD_CFLAGS"
+	       ax_pthread_special_flags_added=yes])
+
+	AC_CACHE_CHECK([for PTHREAD_PRIO_INHERIT],
+	    [ax_cv_PTHREAD_PRIO_INHERIT],
+	    [AC_LINK_IFELSE([AC_LANG_PROGRAM([[#include <pthread.h>]],
+					     [[int i = PTHREAD_PRIO_INHERIT;]])],
+			    [ax_cv_PTHREAD_PRIO_INHERIT=yes],
+			    [ax_cv_PTHREAD_PRIO_INHERIT=no])
+	    ])
+	AS_IF([test "x$ax_cv_PTHREAD_PRIO_INHERIT" = "xyes" && \
+	       test "x$ax_pthread_prio_inherit_defined" != "xyes"],
+	      [AC_DEFINE([HAVE_PTHREAD_PRIO_INHERIT], [1], [Have PTHREAD_PRIO_INHERIT.])
+	       ax_pthread_prio_inherit_defined=yes
+	      ])
+
+	CFLAGS="$ax_pthread_save_CFLAGS"
+	LIBS="$ax_pthread_save_LIBS"
+
+	# More AIX lossage: compile with *_r variant
+	if test "x$GCC" != "xyes"; then
+	    case $host_os in
+		aix*)
+		AS_CASE(["x/$CC"],
+		    [x*/c89|x*/c89_128|x*/c99|x*/c99_128|x*/cc|x*/cc128|x*/xlc|x*/xlc_v6|x*/xlc128|x*/xlc128_v6],
+		    [#handle absolute path differently from PATH based program lookup
+		     AS_CASE(["x$CC"],
+			 [x/*],
+			 [AS_IF([AS_EXECUTABLE_P([${CC}_r])],[PTHREAD_CC="${CC}_r"])],
+			 [AC_CHECK_PROGS([PTHREAD_CC],[${CC}_r],[$CC])])])
+		;;
+	    esac
+	fi
+fi
+
+test -n "$PTHREAD_CC" || PTHREAD_CC="$CC"
+
+AC_SUBST([PTHREAD_LIBS])
+AC_SUBST([PTHREAD_CFLAGS])
+AC_SUBST([PTHREAD_CC])
+
+# Finally, execute ACTION-IF-FOUND/ACTION-IF-NOT-FOUND:
+if test "x$ax_pthread_ok" = "xyes"; then
+	ifelse([$1],,[AC_DEFINE([HAVE_PTHREAD],[1],[Define if you have POSIX threads libraries and header files.])],[$1])
+	:
+else
+	ax_pthread_ok=no
+	$2
+fi
+AC_LANG_POP
+])dnl AX_PTHREAD
diff --git a/depend/zcash/build-aux/m4/bitcoin_find_bdb.m4 b/depend/zcash/build-aux/m4/bitcoin_find_bdb.m4
new file mode 100644
index 000000000..e6c365271
--- /dev/null
+++ b/depend/zcash/build-aux/m4/bitcoin_find_bdb.m4
@@ -0,0 +1,72 @@
+dnl Copyright (c) 2016-2019 The Zcash developers
+dnl Copyright (c) 2013-2019 The Bitcoin Core developers
+dnl Copyright (c) 2013-2019 Bitcoin Developers
+dnl Distributed under the MIT software license, see the accompanying
+dnl file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+AC_DEFUN([BITCOIN_FIND_BDB62],[
+  AC_MSG_CHECKING([for Berkeley DB C++ headers])
+  BDB_CPPFLAGS=
+  BDB_LIBS=
+  bdbpath=X
+  bdb62path=X
+  bdbdirlist=
+  for _vn in 6.2 62 6 ''; do
+    for _pfx in b lib ''; do
+      bdbdirlist="$bdbdirlist ${_pfx}db${_vn}"
+    done
+  done
+  for searchpath in $bdbdirlist ''; do
+    test -n "${searchpath}" && searchpath="${searchpath}/"
+    AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[
+      #include <${searchpath}db_cxx.h>
+    ]],[[
+      #if !((DB_VERSION_MAJOR == 6 && DB_VERSION_MINOR >= 2) || DB_VERSION_MAJOR > 6)
+        #error "failed to find bdb 6.2+"
+      #endif
+    ]])],[
+      if test "x$bdbpath" = "xX"; then
+        bdbpath="${searchpath}"
+      fi
+    ],[
+      continue
+    ])
+    AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[
+      #include <${searchpath}db_cxx.h>
+    ]],[[
+      #if !(DB_VERSION_MAJOR == 6 && DB_VERSION_MINOR == 2)
+        #error "failed to find bdb 6.2"
+      #endif
+    ]])],[
+      bdb62path="${searchpath}"
+      break
+    ],[])
+  done
+  if test "x$bdbpath" = "xX"; then
+    AC_MSG_RESULT([no])
+    AC_MSG_ERROR([libdb_cxx headers missing, Bitcoin Core requires this library for wallet functionality (--disable-wallet to disable wallet functionality)])
+  elif test "x$bdb62path" = "xX"; then
+    BITCOIN_SUBDIR_TO_INCLUDE(BDB_CPPFLAGS,[${bdbpath}],db_cxx)
+    AC_ARG_WITH([incompatible-bdb],[AS_HELP_STRING([--with-incompatible-bdb], [allow using a bdb version other than 6.2])],[
+      AC_MSG_WARN([Found Berkeley DB other than 6.2; wallets opened by this build will not be portable!])
+    ],[
+      AC_MSG_ERROR([Found Berkeley DB other than 6.2, required for portable wallets (--with-incompatible-bdb to ignore or --disable-wallet to disable wallet functionality)])
+    ])
+  else
+    BITCOIN_SUBDIR_TO_INCLUDE(BDB_CPPFLAGS,[${bdb62path}],db_cxx)
+    bdbpath="${bdb62path}"
+  fi
+  AC_SUBST(BDB_CPPFLAGS)
+  
+  # TODO: Ideally this could find the library version and make sure it matches the headers being used
+  for searchlib in db_cxx-6.2 db_cxx; do
+    AC_CHECK_LIB([$searchlib],[main],[
+      BDB_LIBS="-l${searchlib}"
+      break
+    ])
+  done
+  if test "x$BDB_LIBS" = "x"; then
+      AC_MSG_ERROR([libdb_cxx missing, Bitcoin Core requires this library for wallet functionality (--disable-wallet to disable wallet functionality)])
+  fi
+  AC_SUBST(BDB_LIBS)
+])
diff --git a/depend/zcash/build-aux/m4/bitcoin_subdir_to_include.m4 b/depend/zcash/build-aux/m4/bitcoin_subdir_to_include.m4
new file mode 100644
index 000000000..52da5ef9f
--- /dev/null
+++ b/depend/zcash/build-aux/m4/bitcoin_subdir_to_include.m4
@@ -0,0 +1,20 @@
+dnl Copyright (c) 2016-2019 The Zcash developers
+dnl Copyright (c) 2013-2019 The Bitcoin Core developers
+dnl Copyright (c) 2013-2019 Bitcoin Developers
+dnl Distributed under the MIT software license, see the accompanying
+dnl file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+dnl BITCOIN_SUBDIR_TO_INCLUDE([CPPFLAGS-VARIABLE-NAME],[SUBDIRECTORY-NAME],[HEADER-FILE])
+dnl SUBDIRECTORY-NAME must end with a path separator
+AC_DEFUN([BITCOIN_SUBDIR_TO_INCLUDE],[
+  if test "x$2" = "x"; then
+    AC_MSG_RESULT([default])
+  else
+    echo "#include <$2$3.h>" >conftest.cpp
+    newinclpath=`${CXXCPP} ${CPPFLAGS} -M conftest.cpp 2>/dev/null | [ tr -d '\\n\\r\\\\' | sed -e 's/^.*[[:space:]:]\(\/[^[:space:]]*\)]$3[\.h[[:space:]].*$/\1/' -e t -e d`]
+    AC_MSG_RESULT([${newinclpath}])
+    if test "x${newinclpath}" != "x"; then
+      eval "$1=\"\$$1\"' -I${newinclpath}'"
+    fi
+  fi
+])
diff --git a/depend/zcash/build-aux/m4/l_atomic.m4 b/depend/zcash/build-aux/m4/l_atomic.m4
new file mode 100644
index 000000000..75c43f9a9
--- /dev/null
+++ b/depend/zcash/build-aux/m4/l_atomic.m4
@@ -0,0 +1,46 @@
+dnl Copyright (c) 2015 Tim Kosse <tim.kosse@filezilla-project.org>
+dnl Copying and distribution of this file, with or without modification, are
+dnl permitted in any medium without royalty provided the copyright notice
+dnl and this notice are preserved. This file is offered as-is, without any
+dnl warranty.
+
+# Some versions of gcc/libstdc++ require linking with -latomic if
+# using the C++ atomic library.
+#
+# Sourced from http://bugs.debian.org/797228
+
+m4_define([_CHECK_ATOMIC_testbody], [[
+  #include <atomic>
+  #include <cstdint>
+
+  int main() {
+    std::atomic<int64_t> a{};
+
+    int64_t v = 5;
+    int64_t r = a.fetch_add(v);
+    return static_cast<int>(r);
+  }
+]])
+
+AC_DEFUN([CHECK_ATOMIC], [
+
+  AC_LANG_PUSH(C++)
+
+  AC_MSG_CHECKING([whether std::atomic can be used without link library])
+
+  AC_LINK_IFELSE([AC_LANG_SOURCE([_CHECK_ATOMIC_testbody])],[
+      AC_MSG_RESULT([yes])
+    ],[
+      AC_MSG_RESULT([no])
+      LIBS="$LIBS -latomic"
+      AC_MSG_CHECKING([whether std::atomic needs -latomic])
+      AC_LINK_IFELSE([AC_LANG_SOURCE([_CHECK_ATOMIC_testbody])],[
+          AC_MSG_RESULT([yes])
+        ],[
+          AC_MSG_RESULT([no])
+          AC_MSG_FAILURE([cannot figure out how to use std::atomic])
+        ])
+    ])
+
+  AC_LANG_POP
+])
diff --git a/depend/zcash/code_of_conduct.md b/depend/zcash/code_of_conduct.md
new file mode 100644
index 000000000..07e751de7
--- /dev/null
+++ b/depend/zcash/code_of_conduct.md
@@ -0,0 +1,65 @@
+# Contributor Code of Conduct
+
+As contributors and maintainers of this project, and in the interest of
+fostering an open and welcoming community, we pledge to respect all people who
+contribute through reporting issues, posting feature requests, updating
+documentation, submitting pull requests or patches, and other activities.
+
+We are committed to making participation in this project a harassment-free
+experience for everyone, regardless of level of experience, gender, gender
+identity and expression, sexual orientation, disability, personal appearance,
+body size, race, ethnicity, age, religion, or nationality.
+
+Examples of unacceptable behavior by participants include:
+
+* The use of sexualized language or imagery
+* The use of language or imagery that originates with, or has been
+  adopted as a symbol or "dog-whistle" for, any of: right-wing extremism,
+  anti-Semitism, Islamophobia, white supremacism, eugenics, homophobia, or
+  transphobia (whether or not the use by itself falls into those categories)
+* Personal attacks
+* Trolling or insulting/derogatory comments
+* Public or private harassment
+* Publishing other's private information, such as physical or electronic
+  addresses, without explicit permission
+* Other unethical or unprofessional conduct
+
+Project maintainers have the right and responsibility to remove, edit, or
+reject comments, commits, code, wiki edits, issues, and other contributions
+that are not aligned to this Code of Conduct, or to ban temporarily or
+permanently any contributor for other behaviors that they deem inappropriate,
+threatening, offensive, or harmful. Note that contributors may be volunteers
+who do not represent Electric Coin Company. They are free to express their own
+opinions so long as they adhere to these guidelines.
+
+By adopting this Code of Conduct, project maintainers commit themselves to
+fairly and consistently applying these principles to every aspect of managing
+this project. Project maintainers who do not follow or enforce the Code of
+Conduct may be permanently removed from the project team.
+
+This Code of Conduct applies both within project spaces and in public spaces
+when an individual is representing the project or its community.
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported by contacting a project maintainer (see below). All
+complaints will be reviewed and investigated and will result in a response that
+is deemed necessary and appropriate to the circumstances. Maintainers are
+obligated to maintain confidentiality with regard to the reporter of an
+incident.
+
+You may send reports to [our Conduct email](mailto:conduct@z.cash).
+
+If you wish to contact specific maintainers directly, the following have made
+themselves available for conduct issues:
+
+- Daira Hopwood (daira at z.cash)
+- Sean Bowe (sean at z.cash)
+
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage],
+version 1.3.0, available at
+[https://www.contributor-covenant.org/version/1/3/0/][version]
+
+[homepage]: https://www.contributor-covenant.org
+[version]: https://www.contributor-covenant.org/version/1/3/0/
+
diff --git a/depend/zcash/configure.ac b/depend/zcash/configure.ac
new file mode 100644
index 000000000..2d602f60f
--- /dev/null
+++ b/depend/zcash/configure.ac
@@ -0,0 +1,1058 @@
+dnl require autoconf 2.60 (AS_ECHO/AS_ECHO_N)
+AC_PREREQ([2.60])
+define(_CLIENT_VERSION_MAJOR, 5)
+define(_CLIENT_VERSION_MINOR, 0)
+define(_CLIENT_VERSION_REVISION, 0)
+define(_CLIENT_VERSION_BUILD, 50)
+define(_ZC_BUILD_VAL, m4_if(m4_eval(_CLIENT_VERSION_BUILD < 25), 1, m4_incr(_CLIENT_VERSION_BUILD), m4_eval(_CLIENT_VERSION_BUILD < 50), 1, m4_eval(_CLIENT_VERSION_BUILD - 24), m4_eval(_CLIENT_VERSION_BUILD == 50), 1, , m4_eval(_CLIENT_VERSION_BUILD - 50)))
+define(_CLIENT_VERSION_SUFFIX, m4_if(m4_eval(_CLIENT_VERSION_BUILD < 25), 1, _CLIENT_VERSION_REVISION-beta$1, m4_eval(_CLIENT_VERSION_BUILD < 50), 1, _CLIENT_VERSION_REVISION-rc$1, m4_eval(_CLIENT_VERSION_BUILD == 50), 1, _CLIENT_VERSION_REVISION, _CLIENT_VERSION_REVISION-$1)))
+define(_CLIENT_VERSION_IS_RELEASE, true)
+define(_COPYRIGHT_YEAR, 2022)
+AC_INIT([Zcash],[_CLIENT_VERSION_MAJOR._CLIENT_VERSION_MINOR._CLIENT_VERSION_SUFFIX(_ZC_BUILD_VAL)],[https://github.com/zcash/zcash/issues],[zcash])
+AC_CONFIG_SRCDIR([src/main.cpp])
+AC_CONFIG_HEADERS([src/config/bitcoin-config.h])
+AC_CONFIG_AUX_DIR([build-aux])
+AC_CONFIG_MACRO_DIR([build-aux/m4])
+
+BITCOIN_DAEMON_NAME=zcashd
+BITCOIN_CLI_NAME=zcash-cli
+BITCOIN_TX_NAME=zcash-tx
+
+dnl Unless the user specified ARFLAGS, force it to be cr
+AC_ARG_VAR(ARFLAGS, [Flags for the archiver, defaults to <cr> if not set])
+if test "x${ARFLAGS+set}" != "xset"; then
+  ARFLAGS="cr"
+fi
+
+AC_CANONICAL_HOST
+
+AH_TOP([#ifndef BITCOIN_CONFIG_H])
+AH_TOP([#define BITCOIN_CONFIG_H])
+AH_BOTTOM([#endif //BITCOIN_CONFIG_H])
+
+dnl faketime breaks configure and is only needed for make. Disable it here.
+unset FAKETIME
+
+dnl Automake init set-up and checks
+AM_INIT_AUTOMAKE([no-define subdir-objects foreign tar-pax])
+
+dnl faketime messes with timestamps and causes configure to be re-run.
+dnl --disable-maintainer-mode can be used to bypass this.
+AM_MAINTAINER_MODE([enable])
+
+dnl make the compilation flags quiet unless V=1 is used
+m4_ifdef([AM_SILENT_RULES], [AM_SILENT_RULES([yes])])
+
+dnl Compiler checks (here before libtool).
+if test "x${CXXFLAGS+set}" = "xset"; then
+  CXXFLAGS_overridden=yes
+else
+  CXXFLAGS_overridden=no
+fi
+
+AC_PROG_CXX
+m4_ifdef([AC_PROG_OBJCXX],[AC_PROG_OBJCXX])
+
+dnl By default, libtool for mingw refuses to link static libs into a dll for
+dnl fear of mixing pic/non-pic objects, and import/export complications. Since
+dnl we have those under control, re-enable that functionality.
+case $host in
+  *mingw*)
+     lt_cv_deplibs_check_method="pass_all"
+  ;;
+esac
+dnl Require C++17 compiler (no GNU extensions)
+AX_CXX_COMPILE_STDCXX([17], [noext], [mandatory])
+dnl Check if -latomic is required for <std::atomic>
+CHECK_ATOMIC
+
+dnl Libtool init checks.
+LT_INIT([pic-only])
+
+dnl Zcash macros for required programs. Configure exits with error if
+dnl they are not detected.
+AC_DEFUN(
+  ZC_REQUIRE_TOOL,
+  [
+    AC_PATH_TOOL($1, $2, $2_notfound)
+    if test x${$1} = x$2_notfound
+    then
+      AC_MSG_ERROR("Required tool $2 was not found")
+    fi
+  ]
+)
+
+AC_DEFUN(
+  ZC_REQUIRE_PROG,
+  [
+    AC_PATH_PROG($1, $2, $2_notfound)
+    if test x${$1} = x$2_notfound
+    then
+      AC_MSG_ERROR("Required program $2 was not found")
+    fi
+  ]
+)
+
+dnl Check/return PATH for base programs.
+dnl Required tools and programs:
+ZC_REQUIRE_TOOL(AR, ar)
+ZC_REQUIRE_TOOL(RANLIB, ranlib)
+ZC_REQUIRE_TOOL(STRIP, strip)
+ZC_REQUIRE_PROG([GIT], [git])
+ZC_REQUIRE_PROG(RUSTC, rustc)
+ZC_REQUIRE_PROG(CARGO, cargo)
+dnl This one is still optional and checked by complicated logic below:
+AC_PATH_PROG(CCACHE,ccache)
+dnl This one is not currently used anywhere, thus not required:
+AC_PATH_PROG(XGETTEXT,xgettext)
+ZC_REQUIRE_PROG(HEXDUMP,hexdump)
+AC_PATH_PROG(READELF,readelf)
+ZC_REQUIRE_TOOL(CPPFILT,c++filt)
+
+AC_ARG_ENABLE([online-rust],
+  [AS_HELP_STRING([--enable-online-rust],
+  [enable Rust to fetch dependencies from the network (default is to use vendored dependencies)])],
+  [enable_online_rust=$enableval],
+  [enable_online_rust=no])
+AM_CONDITIONAL(ENABLE_ONLINE_RUST, test "$enable_online_rust" != no)
+
+# Enable wallet
+AC_ARG_ENABLE([wallet],
+  [AS_HELP_STRING([--disable-wallet],
+  [disable wallet (enabled by default)])],
+  [enable_wallet=$enableval],
+  [enable_wallet=yes])
+
+AC_ARG_ENABLE([mining],
+  [AS_HELP_STRING([--enable-mining],
+  [enable mining (default is yes)])],
+  [enable_mining=$enableval],
+  [enable_mining=yes])
+
+AC_ARG_ENABLE(tests,
+    AS_HELP_STRING([--disable-tests],[do not compile tests (default is to compile)]),
+    [use_tests=$enableval],
+    [use_tests=yes])
+
+AC_ARG_ENABLE(bench,
+    AS_HELP_STRING([--enable-bench],[compile benchmarks (default is yes)]),
+    [use_bench=$enableval],
+    [use_bench=yes])
+
+AC_ARG_ENABLE([fuzz-main],
+  [AS_HELP_STRING([--enable-fuzz-main],
+  [Replace main() with a stub for fuzzing (default is no)])],
+  [use_fuzz_main=$enableval],
+  [use_fuzz_main=no])
+
+AC_ARG_ENABLE([hardening],
+  [AS_HELP_STRING([--disable-hardening],
+  [do not attempt to harden the resulting executables (default is to harden when possible)])],
+  [use_hardening=$enableval],
+  [use_hardening=auto])
+
+AC_ARG_ENABLE([reduce-exports],
+  [AS_HELP_STRING([--enable-reduce-exports],
+  [attempt to reduce exported symbols in the resulting executables (default is no)])],
+  [use_reduce_exports=$enableval],
+  [use_reduce_exports=no])
+
+AC_ARG_ENABLE([ccache],
+  [AS_HELP_STRING([--disable-ccache],
+  [do not use ccache for building (default is to use if found)])],
+  [use_ccache=$enableval],
+  [use_ccache=auto])
+
+AC_ARG_ENABLE([lcov],
+  [AS_HELP_STRING([--enable-lcov],
+  [enable lcov testing (default is no)])],
+  [use_lcov=yes],
+  [use_lcov=no])
+
+AC_ARG_ENABLE([glibc-back-compat],
+  [AS_HELP_STRING([--enable-glibc-back-compat],
+  [enable backwards compatibility with glibc])],
+  [use_glibc_compat=$enableval],
+  [use_glibc_compat=no])
+
+AC_ARG_ENABLE([zmq],
+  [AS_HELP_STRING([--disable-zmq],
+  [disable ZMQ notifications])],
+  [use_zmq=$enableval],
+  [use_zmq=yes])
+
+AC_ARG_WITH([protoc-bindir],[AS_HELP_STRING([--with-protoc-bindir=BIN_DIR],[specify protoc bin path])], [protoc_bin_path=$withval], [])
+
+AC_ARG_ENABLE(man,
+    [AS_HELP_STRING([--disable-man],
+                    [do not install man pages (default is to install)])],,
+    enable_man=yes)
+AM_CONDITIONAL(ENABLE_MAN, test "$enable_man" != no)
+
+# Enable debug
+AC_ARG_ENABLE([debug],
+    [AS_HELP_STRING([--enable-debug],
+                    [use compiler flags and macros suited for debugging (default is no)])],
+    [enable_debug=$enableval],
+    [enable_debug=no])
+
+# Enable different -fsanitize options
+AC_ARG_WITH([sanitizers],
+    [AS_HELP_STRING([--with-sanitizers],
+                    [comma separated list of extra sanitizers to build with (default is none enabled)])],
+    [use_sanitizers=$withval])
+
+# Enable gprof profiling
+AC_ARG_ENABLE([gprof],
+    [AS_HELP_STRING([--enable-gprof],
+                    [use gprof profiling compiler flags (default is no)])],
+    [enable_gprof=$enableval],
+    [enable_gprof=no])
+
+# Turn warnings into errors
+AC_ARG_ENABLE([werror],
+    [AS_HELP_STRING([--enable-werror],
+                    [Treat all compiler warnings as errors (default is no)])],
+    [enable_werror=$enableval],
+    [enable_werror=no])
+
+AC_LANG_PUSH([C++])
+AX_CHECK_COMPILE_FLAG([-Werror],[CXXFLAG_WERROR="-Werror"],[CXXFLAG_WERROR=""])
+
+if test "x$enable_debug" = xyes; then
+  # Clear default -g -O2 flags
+  if test "x$CXXFLAGS_overridden" = xno; then
+	CXXFLAGS=""
+  fi
+
+  # Disable all optimizations
+  AX_CHECK_COMPILE_FLAG([-O0], [[DEBUG_CXXFLAGS="$DEBUG_CXXFLAGS -O0"]],,[[$CXXFLAG_WERROR]])
+
+  # Prefer -g3, fall back to -g if that is unavailable.
+  AX_CHECK_COMPILE_FLAG(
+    [-g3],
+    [[DEBUG_CXXFLAGS="$DEBUG_CXXFLAGS -g3"]],
+    [AX_CHECK_COMPILE_FLAG([-g],[[DEBUG_CXXFLAGS="$DEBUG_CXXFLAGS -g"]],,[[$CXXFLAG_WERROR]])],
+    [[$CXXFLAG_WERROR]])
+
+  AX_CHECK_PREPROC_FLAG([-DDEBUG],[[DEBUG_CPPFLAGS="$DEBUG_CPPFLAGS -DDEBUG"]],,[[$CXXFLAG_WERROR]])
+  AX_CHECK_PREPROC_FLAG([-DDEBUG_LOCKORDER],[[DEBUG_CPPFLAGS="$DEBUG_CPPFLAGS -DDEBUG_LOCKORDER"]],,[[$CXXFLAG_WERROR]])
+  AX_CHECK_COMPILE_FLAG([-ftrapv],[DEBUG_CXXFLAGS="$DEBUG_CXXFLAGS -ftrapv"],,[[$CXXFLAG_WERROR]])
+else
+  # Even with enable_debug=no we build with standard debug symbols
+  AX_CHECK_COMPILE_FLAG([-g],[[DEBUG_CXXFLAGS="$DEBUG_CXXFLAGS -g"]],,[[$CXXFLAG_WERROR]])
+
+  # -ftrapv and -fwrapv conflict, so we only set this if enable_debug=no
+  AX_CHECK_COMPILE_FLAG([-fwrapv],[CXXFLAGS="$CXXFLAGS -fwrapv"],,[[$CXXFLAG_WERROR]])
+fi
+
+if test x$use_sanitizers != x; then
+  # First check if the compiler accepts flags. If an incompatible pair like
+  # -fsanitize=address,thread is used here, this check will fail. This will also
+  # fail if a bad argument is passed, e.g. -fsanitize=undfeined
+  AX_CHECK_COMPILE_FLAG(
+    [[-fsanitize=$use_sanitizers]],
+    [[SANITIZER_CXXFLAGS=-fsanitize=$use_sanitizers]],
+    [AC_MSG_ERROR([compiler did not accept requested flags])])
+
+  # Some compilers (e.g. GCC) require additional libraries like libasan,
+  # libtsan, libubsan, etc. Make sure linking still works with the sanitize
+  # flag. This is a separate check so we can give a better error message when
+  # the sanitize flags are supported by the compiler but the actual sanitizer
+  # libs are missing.
+  AX_CHECK_LINK_FLAG(
+    [[-fsanitize=$use_sanitizers]],
+    [[SANITIZER_LDFLAGS=-fsanitize=$use_sanitizers]],
+    [AC_MSG_ERROR([linker did not accept requested flags, you are missing required libraries])])
+
+  AX_CHECK_COMPILE_FLAG(
+    [-fno-omit-frame-pointer],
+    [SANITIZER_CXXFLAGS="$SANITIZER_CXXFLAGS -fno-omit-frame-pointer"],
+    [AC_MSG_ERROR(Cannot enable -fno-omit-frame-pointer)])
+
+  # libc/libstdc++ static linking is not supported for TSan
+  case $use_sanitizers in
+    *thread*)
+      ;;
+    *)
+      AX_CHECK_LINK_FLAG(
+        [-static-libstdc++],
+        [SANITIZER_LDFLAGS="$SANITIZER_LDFLAGS -static-libstdc++"],
+        [AC_MSG_ERROR(Cannot statically link -static-libstdc++)])
+      ;;
+  esac
+
+  case $use_sanitizers in
+    *address*)
+      AX_CHECK_LINK_FLAG(
+        [-static-libasan],
+        [SANITIZER_LDFLAGS="$SANITIZER_LDFLAGS -static-libasan"],
+        [AC_MSG_ERROR(Cannot statically link -static-libasan)])
+      ;;
+    *)
+      ;;
+  esac
+fi
+
+ERROR_CXXFLAGS=
+if test "x$enable_werror" = "xyes"; then
+  if test "x$CXXFLAG_WERROR" = "x"; then
+    AC_MSG_ERROR("enable-werror set but -Werror is not usable")
+  fi
+  ERROR_CXXFLAGS="$ERROR_CXXFLAGS -Werror"
+fi
+
+if test "x$CXXFLAGS_overridden" = "xno"; then
+  AX_CHECK_COMPILE_FLAG([-Wall],[CXXFLAGS="$CXXFLAGS -Wall"],,[[$CXXFLAG_WERROR]])
+  AX_CHECK_COMPILE_FLAG([-Wextra],[CXXFLAGS="$CXXFLAGS -Wextra"],,[[$CXXFLAG_WERROR]])
+  AX_CHECK_COMPILE_FLAG([-Wformat],[CXXFLAGS="$CXXFLAGS -Wformat"],,[[$CXXFLAG_WERROR]])
+  AX_CHECK_COMPILE_FLAG([-Wvla],[CXXFLAGS="$CXXFLAGS -Wvla"],,[[$CXXFLAG_WERROR]])
+  AX_CHECK_COMPILE_FLAG([-Wformat-security],[CXXFLAGS="$CXXFLAGS -Wformat-security"],,[[$CXXFLAG_WERROR]])
+
+  ## Some compilers (gcc) ignore unknown -Wno-* options, but warn about all
+  ## unknown options if any other warning is produced. Test the -Wfoo case, and
+  ## set the -Wno-foo case if it works.
+  AX_CHECK_COMPILE_FLAG([-Wunused-parameter],[CXXFLAGS="$CXXFLAGS -Wno-unused-parameter"],,[[$CXXFLAG_WERROR]])
+  AX_CHECK_COMPILE_FLAG([-Wself-assign],[CXXFLAGS="$CXXFLAGS -Wno-self-assign"],,[[$CXXFLAG_WERROR]])
+  AX_CHECK_COMPILE_FLAG([-Wunused-local-typedef],[CXXFLAGS="$CXXFLAGS -Wno-unused-local-typedef"],,[[$CXXFLAG_WERROR]])
+  AX_CHECK_COMPILE_FLAG([-Wdeprecated-register],[CXXFLAGS="$CXXFLAGS -Wno-deprecated-register"],,[[$CXXFLAG_WERROR]])
+
+  # Check for optional instruction set support. Enabling these does _not_ imply that all code will
+  # be compiled with them, rather that specific objects/libs may use them after checking for runtime
+  # compatibility.
+  AX_CHECK_COMPILE_FLAG([-msse4.2],[[SSE42_CXXFLAGS="-msse4.2"]],,[[$CXXFLAG_WERROR]])
+
+fi
+
+TEMP_CXXFLAGS="$CXXFLAGS"
+CXXFLAGS="$CXXFLAGS $SSE42_CXXFLAGS"
+AC_MSG_CHECKING(for assembler crc32 support)
+AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[
+    #include <stdint.h>
+    #if defined(_MSC_VER)
+    #include <intrin.h>
+    #elif defined(__GNUC__) && defined(__SSE4_2__)
+    #include <nmmintrin.h>
+    #endif
+  ]],[[
+    uint64_t l = 0;
+    l = _mm_crc32_u8(l, 0);
+    l = _mm_crc32_u32(l, 0);
+    l = _mm_crc32_u64(l, 0);
+    return l;
+  ]])],
+ [ AC_MSG_RESULT(yes); enable_hwcrc32=yes],
+ [ AC_MSG_RESULT(no)]
+)
+CXXFLAGS="$TEMP_CXXFLAGS"
+
+CPPFLAGS="$CPPFLAGS -DHAVE_BUILD_INFO -D__STDC_FORMAT_MACROS"
+
+AC_ARG_WITH([utils],
+  [AS_HELP_STRING([--with-utils],
+  [build zcash-cli zcash-tx (default=yes)])],
+  [build_bitcoin_utils=$withval],
+  [build_bitcoin_utils=yes])
+
+AC_ARG_WITH([libs],
+  [AS_HELP_STRING([--with-libs],
+  [build libraries (default=no)])],
+  [build_bitcoin_libs=$withval],
+  [build_bitcoin_libs=no])
+
+AC_ARG_WITH([daemon],
+  [AS_HELP_STRING([--with-daemon],
+  [build bitcoind daemon (default=yes)])],
+  [build_bitcoind=$withval],
+  [build_bitcoind=yes])
+
+use_pkgconfig=yes
+case $host in
+  *mingw*)
+
+     dnl pkgconfig does more harm than good with MinGW
+     use_pkgconfig=no
+
+     TARGET_OS=windows
+     AC_CHECK_LIB([kernel32],   [GetModuleFileNameA],,      AC_MSG_ERROR(libkernel32 missing))
+     AC_CHECK_LIB([user32],     [main],,                    AC_MSG_ERROR(libuser32 missing))
+     AC_CHECK_LIB([gdi32],      [main],,                    AC_MSG_ERROR(libgdi32 missing))
+     AC_CHECK_LIB([comdlg32],   [main],,                    AC_MSG_ERROR(libcomdlg32 missing))
+     AC_CHECK_LIB([winmm],      [main],,                    AC_MSG_ERROR(libwinmm missing))
+     AC_CHECK_LIB([shell32],    [SHGetSpecialFolderPathW],, AC_MSG_ERROR(libshell32 missing))
+     AC_CHECK_LIB([comctl32],   [main],,                    AC_MSG_ERROR(libcomctl32 missing))
+     AC_CHECK_LIB([ole32],      [CoCreateInstance],,        AC_MSG_ERROR(libole32 missing))
+     AC_CHECK_LIB([oleaut32],   [main],,                    AC_MSG_ERROR(liboleaut32 missing))
+     AC_CHECK_LIB([uuid],       [main],,                    AC_MSG_ERROR(libuuid missing))
+     AC_CHECK_LIB([advapi32],   [CryptAcquireContextW],,    AC_MSG_ERROR(libadvapi32 missing))
+     AC_CHECK_LIB([ws2_32],     [WSAStartup],,              AC_MSG_ERROR(libws2_32 missing))
+     AC_CHECK_LIB([shlwapi],    [PathRemoveFileSpecW],,     AC_MSG_ERROR(libshlwapi missing))
+     AC_CHECK_LIB([iphlpapi],   [GetAdaptersAddresses],,    AC_MSG_ERROR(libiphlpapi missing))
+     AC_CHECK_LIB([ntdll],      [main],,                    AC_MSG_ERROR(libntdll missing))
+     AC_CHECK_LIB([bcrypt],     [main],,                    AC_MSG_ERROR(libbcrypt missing))
+
+     dnl -static is interpreted by libtool, where it has a different meaning.
+     dnl In libtool-speak, it's -all-static.
+     AX_CHECK_LINK_FLAG([[-static]],[LIBTOOL_APP_LDFLAGS="$LIBTOOL_APP_LDFLAGS -all-static"])
+
+     AC_PATH_PROG([MAKENSIS], [makensis], none)
+     if test x$MAKENSIS = xnone; then
+       AC_MSG_WARN("makensis not found. Cannot create installer.")
+     fi
+
+     ZC_REQUIRE_TOOL(WINDRES, windres)
+
+     CPPFLAGS="$CPPFLAGS -D_MT -DWIN32 -D_WINDOWS -DBOOST_THREAD_USE_LIB -D_WIN32_WINNT=0x0601 -D_WIN32_IE=0x0501 -DWIN32_LEAN_AND_MEAN"
+     LEVELDB_TARGET_FLAGS="-DOS_WINDOWS"
+
+     dnl libtool insists upon adding -nostdlib and a list of objects/libs to link against.
+     dnl That breaks our ability to build dll's with static libgcc/libstdc++/libssp. Override
+     dnl its command here, with the predeps/postdeps removed, and -static inserted. Postdeps are
+     dnl also overridden to prevent their insertion later.
+     dnl This should only affect dll's.
+     archive_cmds_CXX="\$CC -shared \$libobjs \$deplibs \$compiler_flags -static -o \$output_objdir/\$soname \${wl}--enable-auto-image-base -Xlinker --out-implib -Xlinker \$lib"
+     postdeps_CXX=
+
+     dnl We require Windows 7 (NT 6.1) or later
+     AX_CHECK_LINK_FLAG([[-Wl,--major-subsystem-version -Wl,6 -Wl,--minor-subsystem-version -Wl,1]],[LDFLAGS="$LDFLAGS -Wl,--major-subsystem-version -Wl,6 -Wl,--minor-subsystem-version -Wl,1"],,[[$LDFLAG_WERROR]])
+     ;;
+  *darwin*)
+     TARGET_OS=darwin
+     LEVELDB_TARGET_FLAGS="-DOS_MACOSX"
+     if  test x$cross_compiling != xyes; then
+       BUILD_OS=darwin
+       AC_CHECK_PROG([PORT],port, port)
+       if test x$PORT = xport; then
+         dnl add default macports paths
+         CPPFLAGS="$CPPFLAGS -isystem /opt/local/include"
+         LIBS="$LIBS -L/opt/local/lib"
+         if test -d /opt/local/include/db62; then
+           CPPFLAGS="$CPPFLAGS -I/opt/local/include/db62"
+           LIBS="$LIBS -L/opt/local/lib/db62"
+         fi
+       fi
+
+       AC_CHECK_PROG([BREW],brew, brew)
+       if test x$BREW = xbrew; then
+         dnl These Homebrew packages may be keg-only, meaning that they won't be found
+         dnl in expected paths because they may conflict with system files. Ask
+         dnl Homebrew where each one is located, then adjust paths accordingly.
+         dnl It's safe to add these paths even if the functionality is disabled by
+         dnl the user (--without-wallet for example).
+
+         bdb_prefix=`$BREW --prefix berkeley-db4 2>/dev/null`
+         if test x$bdb_prefix != x; then
+           CPPFLAGS="$CPPFLAGS -I$bdb_prefix/include"
+           LIBS="$LIBS -L$bdb_prefix/lib"
+         fi
+       fi
+     else
+       case $build_os in
+         *darwin*)
+           BUILD_OS=darwin
+           ;;
+         *)
+           AC_PATH_TOOL([INSTALLNAMETOOL], [install_name_tool], install_name_tool)
+           AC_PATH_TOOL([OTOOL], [otool], otool)
+           AC_PATH_PROGS([GENISOIMAGE], [genisoimage mkisofs],genisoimage)
+
+           dnl libtool will try to strip the static lib, which is a problem for
+           dnl cross-builds because strip attempts to call a hard-coded ld,
+           dnl which may not exist in the path. Stripping the .a is not
+           dnl necessary, so just disable it.
+           old_striplib=
+           ;;
+       esac
+     fi
+
+     AX_CHECK_LINK_FLAG([[-Wl,-headerpad_max_install_names]], [LDFLAGS="$LDFLAGS -Wl,-headerpad_max_install_names"])
+     CPPFLAGS="$CPPFLAGS -DMAC_OSX"
+     OBJCXXFLAGS="$CXXFLAGS"
+     ;;
+   *android*)
+     dnl make sure android stays above linux for hosts like *linux-android*
+     TARGET_OS=android
+     LEVELDB_TARGET_FLAGS="-DOS_ANDROID"
+     ;;
+   *linux*)
+     TARGET_OS=linux
+     LEVELDB_TARGET_FLAGS="-DOS_LINUX"
+     ;;
+   *kfreebsd*)
+     LEVELDB_TARGET_FLAGS="-DOS_KFREEBSD"
+     ;;
+   *freebsd*)
+     LEVELDB_TARGET_FLAGS="-DOS_FREEBSD"
+     ;;
+   *openbsd*)
+     LEVELDB_TARGET_FLAGS="-DOS_OPENBSD"
+     ;;
+   *netbsd*)
+     LEVELDB_TARGET_FLAGS="-DOS_NETBSD"
+     ;;
+   *dragonfly*)
+     LEVELDB_TARGET_FLAGS="-DOS_DRAGONFLYBSD"
+     ;;
+   *solaris*)
+     LEVELDB_TARGET_FLAGS="-DOS_SOLARIS"
+     ;;
+   *hpux*)
+     LEVELDB_TARGET_FLAGS="-DOS_HPUX"
+     ;;
+   *)
+     AC_MSG_ERROR(Cannot build leveldb for $host. Please file a bug report.)
+     ;;
+esac
+
+if test x$use_pkgconfig = xyes; then
+  m4_ifndef([PKG_PROG_PKG_CONFIG], [AC_MSG_ERROR(PKG_PROG_PKG_CONFIG macro not found. Please install pkg-config and re-run autogen.sh.)])
+  m4_ifdef([PKG_PROG_PKG_CONFIG], [
+  PKG_PROG_PKG_CONFIG
+  if test x"$PKG_CONFIG" = "x"; then
+    AC_MSG_ERROR(pkg-config not found.)
+  fi
+  ])
+fi
+
+if test x$use_lcov = xyes; then
+  ZC_REQUIRE_TOOL(GCOV, gcov)
+  ZC_REQUIRE_PROG(LCOV, lcov)
+  ZC_REQUIRE_PROG(GENHTML, genhtml)
+
+  LCOV="$LCOV --gcov-tool=$GCOV --rc lcov_branch_coverage=1"
+  GENHTML="$GENHTML --branch-coverage"
+  AX_CHECK_COMPILE_FLAG([--coverage],[CXXFLAGS="$CXXFLAGS --coverage"],
+    [AC_MSG_ERROR("lcov testing requested but --coverage flag does not work")])
+fi
+
+dnl Check for endianness
+AC_C_BIGENDIAN
+
+dnl Check for pthread compile/link requirements
+AX_PTHREAD
+
+# The following macro will add the necessary defines to bitcoin-config.h, but
+# they also need to be passed down to any subprojects. Pull the results out of
+# the cache and add them to CPPFLAGS.
+AC_SYS_LARGEFILE
+# detect POSIX or GNU variant of strerror_r
+AC_FUNC_STRERROR_R
+
+if test x$ac_cv_sys_file_offset_bits != x &&
+   test x$ac_cv_sys_file_offset_bits != xno &&
+   test x$ac_cv_sys_file_offset_bits != xunknown; then
+  CPPFLAGS="$CPPFLAGS -D_FILE_OFFSET_BITS=$ac_cv_sys_file_offset_bits"
+fi
+
+if test x$ac_cv_sys_large_files != x &&
+   test x$ac_cv_sys_large_files != xno &&
+   test x$ac_cv_sys_large_files != xunknown; then
+  CPPFLAGS="$CPPFLAGS -D_LARGE_FILES=$ac_cv_sys_large_files"
+fi
+
+AX_GCC_FUNC_ATTRIBUTE([visibility])
+AX_GCC_FUNC_ATTRIBUTE([dllexport])
+AX_GCC_FUNC_ATTRIBUTE([dllimport])
+
+if test x$use_glibc_compat != xno; then
+
+  #glibc absorbed clock_gettime in 2.17. librt (its previous location) is safe to link
+  #in anyway for back-compat.
+  AC_CHECK_LIB([rt],[clock_gettime],, AC_MSG_ERROR(lib missing))
+
+  #__fdelt_chk's params and return type have changed from long unsigned int to long int.
+  # See which one is present here.
+  AC_MSG_CHECKING(__fdelt_chk type)
+  AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[#ifdef _FORTIFY_SOURCE
+                    #undef _FORTIFY_SOURCE
+                  #endif
+                  #define _FORTIFY_SOURCE 2
+                  #include <sys/select.h>
+     extern "C" long unsigned int __fdelt_warn(long unsigned int);]],[[]])],
+    [ fdelt_type="long unsigned int"],
+    [ fdelt_type="long int"])
+  AC_MSG_RESULT($fdelt_type)
+  AC_DEFINE_UNQUOTED(FDELT_TYPE, $fdelt_type,[parameter and return value type for __fdelt_chk])
+else
+  AC_SEARCH_LIBS([clock_gettime],[rt])
+fi
+
+if test "x$enable_gprof" = xyes; then
+    dnl -pg is incompatible with -pie. Since hardening and profiling together doesn't make sense,
+    dnl we simply make them mutually exclusive here. Additionally, hardened toolchains may force
+    dnl -pie by default, in which case it needs to be turned off with -no-pie.
+
+    if test x$use_hardening = xyes; then
+        AC_MSG_ERROR(gprof profiling is not compatible with hardening. Reconfigure with --disable-hardening or --disable-gprof)
+    fi
+    use_hardening=no
+    AX_CHECK_COMPILE_FLAG([-pg],[GPROF_CXXFLAGS="-pg"],
+        [AC_MSG_ERROR(gprof profiling requested but not available)], [[$CXXFLAG_WERROR]])
+
+    AX_CHECK_LINK_FLAG([[-no-pie]], [GPROF_LDFLAGS="-no-pie"])
+    AX_CHECK_LINK_FLAG([[-pg]],[GPROF_LDFLAGS="$GPROF_LDFLAGS -pg"],
+        [AC_MSG_ERROR(gprof profiling requested but not available)], [[$GPROF_LDFLAGS]])
+fi
+
+if test x$TARGET_OS != xwindows; then
+  # All windows code is PIC, forcing it on just adds useless compile warnings
+  AX_CHECK_COMPILE_FLAG([-fPIC],[PIC_FLAGS="-fPIC"])
+fi
+
+if test x$use_fuzz_main == xyes; then
+    CFLAGS="$CFLAGS -DZCASH_FUZZ=1"
+    CXXFLAGS="$CXXFLAGS -DZCASH_FUZZ=1"
+fi
+
+if test x$use_hardening != xno; then
+  use_hardening=yes
+  AX_CHECK_COMPILE_FLAG([-Wformat],[HARDENED_CXXFLAGS="$HARDENED_CXXFLAGS -Wformat"],[AC_MSG_ERROR(Cannot enable -Wformat)])
+  AX_CHECK_COMPILE_FLAG([-Wformat-security],[HARDENED_CXXFLAGS="$HARDENED_CXXFLAGS -Wformat-security"],[AC_MSG_ERROR(Cannot enable -Wformat-security)],[-Wformat])
+  AX_CHECK_COMPILE_FLAG([-Wstack-protector],[HARDENED_CXXFLAGS="$HARDENED_CXXFLAGS -Wstack-protector"],[AC_MSG_ERROR(Cannot enable -Wstack-protector)])
+  AX_CHECK_COMPILE_FLAG([-fstack-protector-all],[HARDENED_CXXFLAGS="$HARDENED_CXXFLAGS -fstack-protector-all"],[AC_MSG_ERROR(Cannot enable -fstack-protector-all)])
+
+  AX_CHECK_PREPROC_FLAG([-D_FORTIFY_SOURCE=2],[
+    AX_CHECK_PREPROC_FLAG([-U_FORTIFY_SOURCE],[
+      HARDENED_CPPFLAGS="$HARDENED_CPPFLAGS -U_FORTIFY_SOURCE"
+    ],[AC_MSG_ERROR(Cannot enable -U_FORTIFY_SOURCE)])
+    HARDENED_CPPFLAGS="$HARDENED_CPPFLAGS -D_FORTIFY_SOURCE=2"
+  ],[AC_MSG_ERROR(Cannot enable -D_FORTIFY_SOURCE=2)])
+
+  if test x$TARGET_OS = xdarwin || test x$TARGET_OS = xwindows; then
+    # Xcode's ld (at least ld64-302.3) doesn't support -z
+    # mingw-w64's ld (at least mingw-w64 4.0.4-2) also appears to not support -z
+    AX_CHECK_LINK_FLAG([[-Wl,-z,relro]], [HARDENED_LDFLAGS="$HARDENED_LDFLAGS -Wl,-z,relro"],[AC_MSG_WARN(Cannot enable RELRO)])
+    AX_CHECK_LINK_FLAG([[-Wl,-z,now]], [HARDENED_LDFLAGS="$HARDENED_LDFLAGS -Wl,-z,now"],[AC_MSG_WARN(Cannot enable BIND_NOW)])
+  else
+    AX_CHECK_LINK_FLAG([[-Wl,-z,relro]], [HARDENED_LDFLAGS="$HARDENED_LDFLAGS -Wl,-z,relro"],[AC_MSG_ERROR(Cannot enable RELRO)])
+    AX_CHECK_LINK_FLAG([[-Wl,-z,now]], [HARDENED_LDFLAGS="$HARDENED_LDFLAGS -Wl,-z,now"],[AC_MSG_ERROR(Cannot enable BIND_NOW)])
+  fi
+
+  if test x$TARGET_OS != xwindows; then
+    # All windows code is PIC, forcing it on just adds useless compile warnings
+    AX_CHECK_COMPILE_FLAG([-fPIE],[PIE_FLAGS="-fPIE"],[AC_MSG_ERROR(Cannot enable -fPIE)])
+    if test x$BUILD_OS = xdarwin; then
+      AX_CHECK_LINK_FLAG([[-Wl,-pie]], [HARDENED_LDFLAGS="$HARDENED_LDFLAGS -Wl,-pie"],[AC_MSG_ERROR(Cannot enable -Wl,-pie)])
+    else
+      AX_CHECK_LINK_FLAG([[-pie]], [HARDENED_LDFLAGS="$HARDENED_LDFLAGS -pie"],[AC_MSG_ERROR(Cannot enable -pie)])
+    fi
+  else
+    # These are only available on Windows.
+    AX_CHECK_LINK_FLAG([[-Wl,--dynamicbase]], [HARDENED_LDFLAGS="$HARDENED_LDFLAGS -Wl,--dynamicbase"],[AC_MSG_ERROR(Cannot enable --dynamicbase)])
+    AX_CHECK_LINK_FLAG([[-Wl,--nxcompat]], [HARDENED_LDFLAGS="$HARDENED_LDFLAGS -Wl,--nxcompat"],[AC_MSG_ERROR(Cannot enable --nxcompat)])
+    AX_CHECK_LINK_FLAG([[-Wl,--high-entropy-va]], [HARDENED_LDFLAGS="$HARDENED_LDFLAGS -Wl,--high-entropy-va"],[AC_MSG_ERROR(Cannot enable ASLR)])
+  fi
+
+  case $host in
+    *mingw*)
+       AC_CHECK_LIB([ssp],      [main],, AC_MSG_ERROR(lib missing))
+    ;;
+  esac
+fi
+
+dnl this flag screws up non-darwin gcc even when the check fails. special-case it.
+if test x$TARGET_OS = xdarwin; then
+  AX_CHECK_LINK_FLAG([[-Wl,-dead_strip]], [LDFLAGS="$LDFLAGS -Wl,-dead_strip"])
+fi
+
+AC_CHECK_HEADERS([endian.h sys/endian.h byteswap.h stdio.h stdlib.h unistd.h strings.h sys/types.h sys/stat.h sys/select.h sys/prctl.h])
+AC_SEARCH_LIBS([getaddrinfo_a], [anl], [AC_DEFINE(HAVE_GETADDRINFO_A, 1, [Define this symbol if you have getaddrinfo_a])])
+AC_SEARCH_LIBS([inet_pton], [nsl resolv], [AC_DEFINE(HAVE_INET_PTON, 1, [Define this symbol if you have inet_pton])])
+
+AC_CHECK_DECLS([strnlen])
+
+AC_CHECK_DECLS([le16toh, le32toh, le64toh, htole16, htole32, htole64, be16toh, be32toh, be64toh, htobe16, htobe32, htobe64],,,
+		[#if HAVE_ENDIAN_H
+                 #include <endian.h>
+                 #elif HAVE_SYS_ENDIAN_H
+                 #include <sys/endian.h>
+                 #endif])
+
+AC_CHECK_DECLS([bswap_16, bswap_32, bswap_64],,,
+		[#if HAVE_BYTESWAP_H
+                 #include <byteswap.h>
+                 #endif])
+
+AC_CHECK_DECLS([__builtin_clz, __builtin_clzl, __builtin_clzll])
+
+dnl Check for MSG_NOSIGNAL
+AC_MSG_CHECKING(for MSG_NOSIGNAL)
+AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[#include <sys/socket.h>]],
+ [[ int f = MSG_NOSIGNAL; ]])],
+ [ AC_MSG_RESULT(yes); AC_DEFINE(HAVE_MSG_NOSIGNAL, 1,[Define this symbol if you have MSG_NOSIGNAL]) ],
+ [ AC_MSG_RESULT(no)]
+)
+
+AC_MSG_CHECKING([for visibility attribute])
+AC_LINK_IFELSE([AC_LANG_SOURCE([
+  int foo_def( void ) __attribute__((visibility("default")));
+  int main(){}
+  ])],
+  [
+    AC_DEFINE(HAVE_VISIBILITY_ATTRIBUTE,1,[Define if the visibility attribute is supported.])
+    AC_MSG_RESULT(yes)
+  ],
+  [
+    AC_MSG_RESULT(no)
+    if test x$use_reduce_exports = xyes; then
+      AC_MSG_ERROR([Cannot find a working visibility attribute. Use --disable-reduce-exports.])
+    fi
+  ]
+)
+
+if test x$use_reduce_exports = xyes; then
+  AX_CHECK_COMPILE_FLAG([-fvisibility=hidden],[RE_CXXFLAGS="-fvisibility=hidden"],
+  [AC_MSG_ERROR([Cannot set default symbol visibility. Use --disable-reduce-exports.])])
+fi
+
+LEVELDB_CPPFLAGS=
+LIBLEVELDB=
+LIBMEMENV=
+AM_CONDITIONAL([EMBEDDED_LEVELDB],[true])
+AC_SUBST(LEVELDB_CPPFLAGS)
+AC_SUBST(LIBLEVELDB)
+AC_SUBST(LIBMEMENV)
+
+if test x$enable_wallet != xno; then
+    dnl Check for libdb_cxx only if wallet enabled
+    BITCOIN_FIND_BDB62
+fi
+
+if test x$build_bitcoin_utils$build_bitcoind$use_tests = xnonono; then
+    use_boost=no
+else
+    use_boost=yes
+fi
+
+if test x$use_boost = xyes; then
+
+dnl Check for boost libs
+dnl We need Boost >= 1.62 to fix a potential security bug (https://github.com/zcash/zcash/issues/1241)
+AX_BOOST_BASE([1.62])
+AX_BOOST_SYSTEM
+AX_BOOST_FILESYSTEM
+AX_BOOST_PROGRAM_OPTIONS
+AX_BOOST_THREAD
+AX_BOOST_CHRONO
+
+fi
+
+if test x$use_reduce_exports = xyes; then
+    CXXFLAGS="$CXXFLAGS $RE_CXXFLAGS"
+    AX_CHECK_LINK_FLAG([[-Wl,--exclude-libs,ALL]], [RELDFLAGS="-Wl,--exclude-libs,ALL"])
+fi
+
+if test x$use_tests = xyes; then
+
+  if test x$HEXDUMP = x; then
+    AC_MSG_ERROR(hexdump is required for tests)
+  fi
+
+
+  if test x$use_boost = xyes; then
+
+  AX_BOOST_UNIT_TEST_FRAMEWORK
+
+  dnl Determine if -DBOOST_TEST_DYN_LINK is needed
+  AC_MSG_CHECKING([for dynamic linked boost test])
+  TEMP_LIBS="$LIBS"
+  LIBS="$LIBS $BOOST_LDFLAGS $BOOST_UNIT_TEST_FRAMEWORK_LIB"
+  TEMP_CPPFLAGS="$CPPFLAGS"
+  CPPFLAGS="$CPPFLAGS $BOOST_CPPFLAGS"
+  AC_LINK_IFELSE([AC_LANG_SOURCE([
+       #define BOOST_TEST_DYN_LINK
+       #define BOOST_TEST_MAIN
+        #include <boost/test/unit_test.hpp>
+
+       ])],
+    [AC_MSG_RESULT(yes)]
+    [TESTDEFS="$TESTDEFS -DBOOST_TEST_DYN_LINK"],
+    [AC_MSG_RESULT(no)])
+  LIBS="$TEMP_LIBS"
+  CPPFLAGS="$TEMP_CPPFLAGS"
+
+  fi
+fi
+
+if test x$use_boost = xyes; then
+BOOST_LIBS="$BOOST_LDFLAGS $BOOST_SYSTEM_LIB $BOOST_FILESYSTEM_LIB $BOOST_PROGRAM_OPTIONS_LIB $BOOST_THREAD_LIB $BOOST_CHRONO_LIB"
+fi
+
+if test x$use_pkgconfig = xyes; then
+  : dnl
+  m4_ifdef(
+    [PKG_CHECK_MODULES],
+    [
+      if test x$build_bitcoin_utils$build_bitcoind$bitcoin_enable_qt$use_tests != xnononono; then
+        PKG_CHECK_MODULES([EVENT], [libevent],, [AC_MSG_ERROR(libevent not found.)])
+        if test x$TARGET_OS != xwindows; then
+          PKG_CHECK_MODULES([EVENT_PTHREADS], [libevent_pthreads],, [AC_MSG_ERROR(libevent_pthreads not found.)])
+        fi
+      fi
+
+      if test "x$use_zmq" = "xyes"; then
+        PKG_CHECK_MODULES([ZMQ],[libzmq >= 4],
+          [AC_DEFINE([ENABLE_ZMQ],[1],[Define to 1 to enable ZMQ functions])],
+          [AC_DEFINE([ENABLE_ZMQ],[0],[Define to 1 to enable ZMQ functions])
+           AC_MSG_WARN([libzmq version 4.x or greater not found, disabling])
+           use_zmq=no])
+      else
+          AC_DEFINE_UNQUOTED([ENABLE_ZMQ],[0],[Define to 1 to enable ZMQ functions])
+      fi
+    ]
+  )
+else
+
+  if test x$build_bitcoin_utils$build_bitcoind$bitcoin_enable_qt$use_tests != xnononono; then
+    AC_CHECK_HEADER([event2/event.h],, AC_MSG_ERROR(libevent headers missing),)
+    AC_CHECK_LIB([event],[main],EVENT_LIBS=-levent,AC_MSG_ERROR(libevent missing))
+    if test x$TARGET_OS != xwindows; then
+      AC_CHECK_LIB([event_pthreads],[main],EVENT_PTHREADS_LIBS=-levent_pthreads,AC_MSG_ERROR(libevent_pthreads missing))
+    fi
+  fi
+
+  if test "x$use_zmq" = "xyes"; then
+     AC_CHECK_HEADER([zmq.h],
+       [AC_DEFINE([ENABLE_ZMQ],[1],[Define to 1 to enable ZMQ functions])],
+       [AC_MSG_WARN([zmq.h not found, disabling zmq support])
+        use_zmq=no
+        AC_DEFINE([ENABLE_ZMQ],[0],[Define to 1 to enable ZMQ functions])])
+     AC_CHECK_LIB([zmq],[zmq_ctx_shutdown],ZMQ_LIBS=-lzmq,
+       [AC_MSG_WARN([libzmq >= 4.0 not found, disabling zmq support])
+        use_zmq=no
+        AC_DEFINE([ENABLE_ZMQ],[0],[Define to 1 to enable ZMQ functions])])
+  else
+    AC_DEFINE_UNQUOTED([ENABLE_ZMQ],[0],[Define to 1 to enable ZMQ functions])
+  fi
+
+  if test "x$use_zmq" = "xyes"; then
+    dnl Assume libzmq was built for static linking
+    case $host in
+      *mingw*)
+        ZMQ_CFLAGS="$ZMQ_CFLAGS -DZMQ_STATIC"
+      ;;
+    esac
+  fi
+fi
+
+RUST_LIBS=""
+case $host in
+  *mingw*)
+    RUST_LIBS="$RUST_LIBS -luserenv"
+    ;;
+  *)
+    RUST_LIBS="$RUST_LIBS -ldl"
+    ;;
+esac
+
+# Additional Zcash flags
+AX_CHECK_COMPILE_FLAG([-fno-strict-aliasing],[CXXFLAGS="$CXXFLAGS -fno-strict-aliasing"])
+AX_CHECK_COMPILE_FLAG([-Wno-builtin-declaration-mismatch],[CXXFLAGS="$CXXFLAGS -Wno-builtin-declaration-mismatch"],,[[$CXXFLAG_WERROR]])
+
+LIBZCASH_LIBS="$BOOST_SYSTEM_LIB -lsodium $RUST_LIBS"
+
+AC_MSG_CHECKING([whether to build bitcoind])
+AM_CONDITIONAL([BUILD_BITCOIND], [test x$build_bitcoind = xyes])
+AC_MSG_RESULT($build_bitcoind)
+
+AC_MSG_CHECKING([whether to build utils (zcash-cli zcash-tx)])
+AM_CONDITIONAL([BUILD_BITCOIN_UTILS], [test x$build_bitcoin_utils = xyes])
+AC_MSG_RESULT($build_bitcoin_utils)
+
+AC_MSG_CHECKING([whether to build libraries])
+AM_CONDITIONAL([BUILD_BITCOIN_LIBS], [test x$build_bitcoin_libs = xyes])
+if test x$build_bitcoin_libs = xyes; then
+  AC_DEFINE(HAVE_SCRIPT_LIB, 1, [Define this symbol if the script lib has been built])
+  AC_CONFIG_FILES([libzcash_script.pc:libzcash_script.pc.in])
+fi
+
+AC_MSG_RESULT($build_bitcoin_libs)
+
+AC_LANG_POP
+
+if test "x$use_ccache" != "xno"; then
+  AC_MSG_CHECKING(if ccache should be used)
+  if test x$CCACHE = x; then
+    if test "x$use_ccache" = "xyes"; then
+      AC_MSG_ERROR([ccache not found.]);
+    else
+      use_ccache=no
+    fi
+  else
+    use_ccache=yes
+    CC="$ac_cv_path_CCACHE $CC"
+    CXX="$ac_cv_path_CCACHE $CXX"
+  fi
+  AC_MSG_RESULT($use_ccache)
+fi
+if test "x$use_ccache" = "xyes"; then
+    AX_CHECK_PREPROC_FLAG([-Qunused-arguments],[CPPFLAGS="-Qunused-arguments $CPPFLAGS"])
+fi
+
+dnl enable wallet
+AC_MSG_CHECKING([if wallet should be enabled])
+if test x$enable_wallet != xno; then
+  AC_MSG_RESULT(yes)
+  AC_DEFINE_UNQUOTED([ENABLE_WALLET],[1],[Define to 1 to enable wallet functions])
+
+else
+  AC_MSG_RESULT(no)
+fi
+
+dnl enable mining
+AC_MSG_CHECKING([if mining should be enabled])
+if test x$enable_mining != xno; then
+  AC_MSG_RESULT(yes)
+  AC_DEFINE(ENABLE_MINING, 1, [Define to 1 to enable mining functions])
+
+else
+  AC_MSG_RESULT(no)
+fi
+
+AM_CONDITIONAL([ENABLE_ZMQ], [test "x$use_zmq" = "xyes"])
+
+AC_MSG_CHECKING([whether to build test_bitcoin])
+if test x$use_tests = xyes; then
+  AC_MSG_RESULT([yes])
+  BUILD_TEST="yes"
+else
+  AC_MSG_RESULT([no])
+  BUILD_TEST=""
+fi
+
+AC_MSG_CHECKING([whether to reduce exports])
+if test x$use_reduce_exports = xyes; then
+  AC_MSG_RESULT([yes])
+else
+  AC_MSG_RESULT([no])
+fi
+
+if test x$build_bitcoin_utils$build_bitcoin_libs$build_bitcoind$use_tests = xnononono; then
+  AC_MSG_ERROR([No targets! Please specify at least one of: --with-utils --with-libs --with-daemon or --enable-tests])
+fi
+
+AM_CONDITIONAL([TARGET_DARWIN], [test x$TARGET_OS = xdarwin])
+AM_CONDITIONAL([BUILD_DARWIN], [test x$BUILD_OS = xdarwin])
+AM_CONDITIONAL([TARGET_WINDOWS], [test x$TARGET_OS = xwindows])
+AM_CONDITIONAL([ENABLE_WALLET],[test x$enable_wallet = xyes])
+AM_CONDITIONAL([ENABLE_MINING],[test x$enable_mining = xyes])
+AM_CONDITIONAL([ENABLE_TESTS],[test x$BUILD_TEST = xyes])
+AM_CONDITIONAL([ENABLE_BENCH],[test x$use_bench = xyes])
+AM_CONDITIONAL([USE_LCOV],[test x$use_lcov = xyes])
+AM_CONDITIONAL([GLIBC_BACK_COMPAT],[test x$use_glibc_compat = xyes])
+AM_CONDITIONAL([HARDEN],[test x$use_hardening = xyes])
+AM_CONDITIONAL([ENABLE_HWCRC32],[test x$enable_hwcrc32 = xyes])
+
+AC_DEFINE(CLIENT_VERSION_MAJOR, _CLIENT_VERSION_MAJOR, [Major version])
+AC_DEFINE(CLIENT_VERSION_MINOR, _CLIENT_VERSION_MINOR, [Minor version])
+AC_DEFINE(CLIENT_VERSION_REVISION, _CLIENT_VERSION_REVISION, [Build revision])
+AC_DEFINE(CLIENT_VERSION_BUILD, _CLIENT_VERSION_BUILD, [Version Build])
+AC_DEFINE(CLIENT_VERSION_IS_RELEASE, _CLIENT_VERSION_IS_RELEASE, [Version is release])
+AC_DEFINE(COPYRIGHT_YEAR, _COPYRIGHT_YEAR, [Version is release])
+AC_SUBST(CLIENT_VERSION_MAJOR, _CLIENT_VERSION_MAJOR)
+AC_SUBST(CLIENT_VERSION_MINOR, _CLIENT_VERSION_MINOR)
+AC_SUBST(CLIENT_VERSION_REVISION, _CLIENT_VERSION_REVISION)
+AC_SUBST(CLIENT_VERSION_BUILD, _CLIENT_VERSION_BUILD)
+AC_SUBST(CLIENT_VERSION_IS_RELEASE, _CLIENT_VERSION_IS_RELEASE)
+AC_SUBST(COPYRIGHT_YEAR, _COPYRIGHT_YEAR)
+AC_SUBST(BITCOIN_DAEMON_NAME)
+AC_SUBST(BITCOIN_CLI_NAME)
+AC_SUBST(BITCOIN_TX_NAME)
+
+AC_SUBST(RUST_TARGET)
+AC_SUBST(RUST_VENDORED_SOURCES)
+AC_SUBST(RELDFLAGS)
+AC_SUBST(DEBUG_CPPFLAGS)
+AC_SUBST(DEBUG_CXXFLAGS)
+AC_SUBST(ERROR_CXXFLAGS)
+AC_SUBST(GPROF_CXXFLAGS)
+AC_SUBST(GPROF_LDFLAGS)
+AC_SUBST(HARDENED_CXXFLAGS)
+AC_SUBST(HARDENED_CPPFLAGS)
+AC_SUBST(HARDENED_LDFLAGS)
+AC_SUBST(PIC_FLAGS)
+AC_SUBST(PIE_FLAGS)
+AC_SUBST(SANITIZER_CXXFLAGS)
+AC_SUBST(SANITIZER_LDFLAGS)
+AC_SUBST(SSE42_CXXFLAGS)
+AC_SUBST(LIBTOOL_APP_LDFLAGS)
+AC_SUBST(BOOST_LIBS)
+AC_SUBST(TESTDEFS)
+AC_SUBST(LEVELDB_TARGET_FLAGS)
+AC_SUBST(EVENT_LIBS)
+AC_SUBST(EVENT_PTHREADS_LIBS)
+AC_SUBST(ZMQ_LIBS)
+AC_SUBST(LIBZCASH_LIBS)
+AC_CONFIG_FILES([Makefile src/Makefile doc/man/Makefile src/test/buildenv.py])
+AC_CONFIG_FILES([qa/pull-tester/tests_config.ini],[chmod +x qa/pull-tester/tests_config.ini])
+AC_CONFIG_LINKS([qa/pull-tester/rpc-tests.py:qa/pull-tester/rpc-tests.py])
+
+dnl boost's m4 checks do something really nasty: they export these vars. As a
+dnl result, they leak into secp256k1's configure and crazy things happen.
+dnl Until this is fixed upstream and we've synced, we'll just un-export them.
+CPPFLAGS_TEMP="$CPPFLAGS"
+unset CPPFLAGS
+CPPFLAGS="$CPPFLAGS_TEMP"
+
+LDFLAGS_TEMP="$LDFLAGS"
+unset LDFLAGS
+LDFLAGS="$LDFLAGS_TEMP"
+
+LIBS_TEMP="$LIBS"
+unset LIBS
+LIBS="$LIBS_TEMP"
+
+PKGCONFIG_PATH_TEMP="$PKG_CONFIG_PATH"
+unset PKG_CONFIG_PATH
+PKG_CONFIG_PATH="$PKGCONFIG_PATH_TEMP"
+
+PKGCONFIG_LIBDIR_TEMP="$PKG_CONFIG_LIBDIR"
+unset PKG_CONFIG_LIBDIR
+PKG_CONFIG_LIBDIR="$PKGCONFIG_LIBDIR_TEMP"
+
+ac_configure_args="${ac_configure_args} --disable-shared --with-pic --enable-benchmark=no --with-bignum=no --enable-module-recovery"
+AC_CONFIG_SUBDIRS([src/secp256k1 src/univalue])
+
+AC_OUTPUT
+
+dnl Taken from https://wiki.debian.org/RpathIssue
+case $host in
+   *-*-linux-gnu)
+     AC_MSG_RESULT([Fixing libtool for -rpath problems.])
+     sed < libtool > libtool-2 \
+     's/^hardcode_libdir_flag_spec.*$'/'hardcode_libdir_flag_spec=" -D__LIBTOOL_IS_A_FOOL__ "/'
+     mv libtool-2 libtool
+     chmod 755 libtool
+   ;;
+esac
+
+dnl Replace the BUILDDIR path with the correct Windows path if compiling on Native Windows
+case ${OS} in
+   *Windows*)
+     sed  's/BUILDDIR="\/\([[a-z]]\)/BUILDDIR="\1:/'  qa/pull-tester/tests_config.py > qa/pull-tester/tests_config-2.py
+     mv qa/pull-tester/tests_config-2.py qa/pull-tester/tests_config.py
+     chmod +x qa/pull-tester/tests_config.py
+   ;;
+esac
+
+echo 
+echo "Options used to compile and link:"
+echo "  with wallet   = $enable_wallet"
+echo "  with zmq      = $use_zmq"
+echo "  with test     = $use_tests"
+echo "  sanitizers    = $use_sanitizers"
+echo "  debug enabled = $enable_debug"
+echo "  gprof enabled = $enable_gprof"
+echo "  werror        = $enable_werror"
+echo 
+echo "  target os     = $TARGET_OS"
+echo "  build os      = $BUILD_OS"
+echo
+echo "  CC            = $CC"
+echo "  CFLAGS        = $CFLAGS"
+echo "  CPPFLAGS      = $DEBUG_CPPFLAGS $HARDENED_CPPFLAGS $CPPFLAGS"
+echo "  CXX           = $CXX"
+echo "  CXXFLAGS      = $DEBUG_CXXFLAGS $HARDENED_CXXFLAGS $ERROR_CXXFLAGS $GPROF_CXXFLAGS $CXXFLAGS"
+echo "  LDFLAGS       = $PTHREAD_CFLAGS $HARDENED_LDFLAGS $GPROF_LDFLAGS $LDFLAGS"
+echo "  ARFLAGS       = $ARFLAGS"
+echo 
diff --git a/depend/zcash/contrib/README.md b/depend/zcash/contrib/README.md
new file mode 100644
index 000000000..4ec9fffa5
--- /dev/null
+++ b/depend/zcash/contrib/README.md
@@ -0,0 +1,43 @@
+*** Warning: This document has not been updated for Zcash and may be inaccurate. ***
+
+Wallet Tools
+---------------------
+
+### [BitRPC](/contrib/bitrpc) ###
+Allows for sending of all standard Bitcoin commands via RPC rather than as command line args.
+
+Repository Tools
+---------------------
+
+### [Developer tools](/contrib/devtools) ###
+Specific tools for developers working on this repository.
+Contains the script `github-merge.sh` for merging github pull requests securely and signing them using GPG.
+
+### [Linearize](/contrib/linearize) ###
+Construct a linear, no-fork, best version of the blockchain.
+
+### [Qos](/contrib/qos) ###
+
+A Linux bash script that will set up traffic control (tc) to limit the outgoing bandwidth for connections to the Bitcoin network. This means one can have an always-on bitcoind instance running, and another local bitcoind/bitcoin-qt instance which connects to this node and receives blocks from it.
+
+### [Seeds](/contrib/seeds) ###
+Utility to generate the pnSeed[] array that is compiled into the client.
+
+Build Tools and Keys
+---------------------
+
+### [Debian](/contrib/debian) ###
+Contains files used to package bitcoind/bitcoin-qt
+for Debian-based Linux systems. If you compile bitcoind/bitcoin-qt yourself, there are some useful files here.
+
+### [Gitian-descriptors](/contrib/gitian-descriptors) ###
+Gavin's notes on getting gitian builds up and running using KVM.
+
+### [Gitian-downloader](/contrib/gitian-downloader)
+Various PGP files of core developers. 
+
+Test and Verify Tools 
+---------------------
+
+### [TestGen](/contrib/testgen) ###
+Utilities to generate test vectors for the data-driven Bitcoin tests.
\ No newline at end of file
diff --git a/depend/zcash/contrib/bitrpc/README.md b/depend/zcash/contrib/bitrpc/README.md
new file mode 100644
index 000000000..f5ef2f040
--- /dev/null
+++ b/depend/zcash/contrib/bitrpc/README.md
@@ -0,0 +1,8 @@
+### BitRPC
+Allows for sending of all standard Bitcoin commands via RPC rather than as command line args.
+
+### Looking for Wallet Tools?
+BitRPC.py is able to do the exact same thing as `walletchangepass.py` and `walletunlock.py`. Their respective commands in BitRPC.py are:
+
+	bitrpc.py walletpassphrasechange
+	bitrpc.py walletpassphrase
\ No newline at end of file
diff --git a/depend/zcash/contrib/bitrpc/bitrpc.py b/depend/zcash/contrib/bitrpc/bitrpc.py
new file mode 100644
index 000000000..1c3d40f22
--- /dev/null
+++ b/depend/zcash/contrib/bitrpc/bitrpc.py
@@ -0,0 +1,335 @@
+from jsonrpc import ServiceProxy
+import sys
+import string
+import getpass
+
+# ===== BEGIN USER SETTINGS =====
+# if you do not set these you will be prompted for a password for every command
+rpcuser = ""
+rpcpass = ""
+# ====== END USER SETTINGS ======
+
+
+if rpcpass == "":
+    access = ServiceProxy("http://127.0.0.1:8232")
+else:
+    access = ServiceProxy("http://"+rpcuser+":"+rpcpass+"@127.0.0.1:8232")
+cmd = sys.argv[1].lower()
+
+if cmd == "backupwallet":
+    try:
+        path = raw_input("Enter destination path/filename: ")
+        print access.backupwallet(path)
+    except Exception as inst:
+        print inst
+
+elif cmd == "encryptwallet":
+    try:
+        pwd = getpass.getpass(prompt="Enter passphrase: ")
+        pwd2 = getpass.getpass(prompt="Repeat passphrase: ")
+        if pwd == pwd2:
+            access.encryptwallet(pwd)
+            print "\n---Wallet encrypted. Server stopping, restart to run with encrypted wallet---\n"
+        else:
+            print "\n---Passphrases do not match---\n"
+    except Exception as inst:
+        print inst
+
+elif cmd == "getaccount":
+    try:
+        addr = raw_input("Enter a Bitcoin address: ")
+        print access.getaccount(addr)
+    except Exception as inst:
+        print inst
+
+elif cmd == "getaccountaddress":
+    try:
+        acct = raw_input("Enter an account name: ")
+        print access.getaccountaddress(acct)
+    except Exception as inst:
+        print inst
+
+elif cmd == "getaddressesbyaccount":
+    try:
+        acct = raw_input("Enter an account name: ")
+        print access.getaddressesbyaccount(acct)
+    except Exception as inst:
+        print inst
+
+elif cmd == "getbalance":
+    try:
+        acct = raw_input("Enter an account (optional): ")
+        mc = raw_input("Minimum confirmations (optional): ")
+        try:
+            print access.getbalance(acct, mc)
+        except:
+            print access.getbalance()
+    except Exception as inst:
+        print inst
+
+elif cmd == "getblockbycount":
+    try:
+        height = raw_input("Height: ")
+        print access.getblockbycount(height)
+    except Exception as inst:
+        print inst
+
+elif cmd == "getblockcount":
+    try:
+        print access.getblockcount()
+    except Exception as inst:
+        print inst
+
+elif cmd == "getblocknumber":
+    try:
+        print access.getblocknumber()
+    except Exception as inst:
+        print inst
+
+elif cmd == "getconnectioncount":
+    try:
+        print access.getconnectioncount()
+    except Exception as inst:
+        print inst
+
+elif cmd == "getdifficulty":
+    try:
+        print access.getdifficulty()
+    except Exception as inst:
+        print inst
+
+elif cmd == "getgenerate":
+    try:
+        print access.getgenerate()
+    except Exception as inst:
+        print inst
+
+elif cmd == "gethashespersec":
+    try:
+        print access.gethashespersec()
+    except Exception as inst:
+        print inst
+
+elif cmd == "getinfo":
+    try:
+        print access.getinfo()
+    except Exception as inst:
+        print inst
+
+elif cmd == "getnewaddress":
+    try:
+        acct = raw_input("Enter an account name: ")
+        try:
+            print access.getnewaddress(acct)
+        except:
+            print access.getnewaddress()
+    except Exception as inst:
+        print inst
+
+elif cmd == "getreceivedbyaccount":
+    try:
+        acct = raw_input("Enter an account (optional): ")
+        mc = raw_input("Minimum confirmations (optional): ")
+        try:
+            print access.getreceivedbyaccount(acct, mc)
+        except:
+            print access.getreceivedbyaccount()
+    except Exception as inst:
+        print inst
+
+elif cmd == "getreceivedbyaddress":
+    try:
+        addr = raw_input("Enter a Bitcoin address (optional): ")
+        mc = raw_input("Minimum confirmations (optional): ")
+        try:
+            print access.getreceivedbyaddress(addr, mc)
+        except:
+            print access.getreceivedbyaddress()
+    except Exception as inst:
+        print inst
+
+elif cmd == "gettransaction":
+    try:
+        txid = raw_input("Enter a transaction ID: ")
+        print access.gettransaction(txid)
+    except Exception as inst:
+        print inst
+
+elif cmd == "getwork":
+    try:
+        data = raw_input("Data (optional): ")
+        try:
+            print access.gettransaction(data)
+        except:
+            print access.gettransaction()
+    except Exception as inst:
+        print inst
+
+elif cmd == "help":
+    try:
+        cmd = raw_input("Command (optional): ")
+        try:
+            print access.help(cmd)
+        except:
+            print access.help()
+    except Exception as inst:
+        print inst
+
+elif cmd == "listaccounts":
+    try:
+        mc = raw_input("Minimum confirmations (optional): ")
+        try:
+            print access.listaccounts(mc)
+        except:
+            print access.listaccounts()
+    except Exception as inst:
+        print inst
+
+elif cmd == "listreceivedbyaccount":
+    try:
+        mc = raw_input("Minimum confirmations (optional): ")
+        incemp = raw_input("Include empty? (true/false, optional): ")
+        try:
+            print access.listreceivedbyaccount(mc, incemp)
+        except:
+            print access.listreceivedbyaccount()
+    except Exception as inst:
+        print inst
+
+elif cmd == "listreceivedbyaddress":
+    try:
+        mc = raw_input("Minimum confirmations (optional): ")
+        incemp = raw_input("Include empty? (true/false, optional): ")
+        try:
+            print access.listreceivedbyaddress(mc, incemp)
+        except:
+            print access.listreceivedbyaddress()
+    except Exception as inst:
+        print inst
+
+elif cmd == "listtransactions":
+    try:
+        acct = raw_input("Account (optional): ")
+        count = raw_input("Number of transactions (optional): ")
+        frm = raw_input("Skip (optional):")
+        try:
+            print access.listtransactions(acct, count, frm)
+        except:
+            print access.listtransactions()
+    except Exception as inst:
+        print inst
+
+elif cmd == "move":
+    try:
+        frm = raw_input("From: ")
+        to = raw_input("To: ")
+        amt = raw_input("Amount:")
+        mc = raw_input("Minimum confirmations (optional): ")
+        comment = raw_input("Comment (optional): ")
+        try:
+            print access.move(frm, to, amt, mc, comment)
+        except:
+            print access.move(frm, to, amt)
+    except Exception as inst:
+        print inst
+
+elif cmd == "sendfrom":
+    try:
+        frm = raw_input("From: ")
+        to = raw_input("To: ")
+        amt = raw_input("Amount:")
+        mc = raw_input("Minimum confirmations (optional): ")
+        comment = raw_input("Comment (optional): ")
+        commentto = raw_input("Comment-to (optional): ")
+        try:
+            print access.sendfrom(frm, to, amt, mc, comment, commentto)
+        except:
+            print access.sendfrom(frm, to, amt)
+    except Exception as inst:
+        print inst
+
+elif cmd == "sendmany":
+    try:
+        frm = raw_input("From: ")
+        to = raw_input("To (in format address1:amount1,address2:amount2,...): ")
+        mc = raw_input("Minimum confirmations (optional): ")
+        comment = raw_input("Comment (optional): ")
+        try:
+            print access.sendmany(frm,to,mc,comment)
+        except:
+            print access.sendmany(frm,to)
+    except Exception as inst:
+        print inst
+
+elif cmd == "sendtoaddress":
+    try:
+        to = raw_input("To (in format address1:amount1,address2:amount2,...): ")
+        amt = raw_input("Amount:")
+        comment = raw_input("Comment (optional): ")
+        commentto = raw_input("Comment-to (optional): ")
+        try:
+            print access.sendtoaddress(to,amt,comment,commentto)
+        except:
+            print access.sendtoaddress(to,amt)
+    except Exception as inst:
+        print inst
+
+elif cmd == "setaccount":
+    try:
+        addr = raw_input("Address: ")
+        acct = raw_input("Account:")
+        print access.setaccount(addr,acct)
+    except Exception as inst:
+        print inst
+
+elif cmd == "setgenerate":
+    try:
+        gen= raw_input("Generate? (true/false): ")
+        cpus = raw_input("Max processors/cores (-1 for unlimited, optional):")
+        try:
+            print access.setgenerate(gen, cpus)
+        except:
+            print access.setgenerate(gen)
+    except Exception as inst:
+        print inst
+
+elif cmd == "settxfee":
+    try:
+        amt = raw_input("Amount:")
+        print access.settxfee(amt)
+    except Exception as inst:
+        print inst
+
+elif cmd == "stop":
+    try:
+        print access.stop()
+    except Exception as inst:
+        print inst
+
+elif cmd == "validateaddress":
+    try:
+        addr = raw_input("Address: ")
+        print access.validateaddress(addr)
+    except Exception as inst:
+        print inst
+
+elif cmd == "walletpassphrase":
+    try:
+        pwd = getpass.getpass(prompt="Enter wallet passphrase: ")
+        access.walletpassphrase(pwd, 60)
+        print "\n---Wallet unlocked---\n"
+    except Exception as inst:
+        print inst
+
+elif cmd == "walletpassphrasechange":
+    try:
+        pwd = getpass.getpass(prompt="Enter old wallet passphrase: ")
+        pwd2 = getpass.getpass(prompt="Enter new wallet passphrase: ")
+        access.walletpassphrasechange(pwd, pwd2)
+        print
+        print "\n---Passphrase changed---\n"
+    except Exception as inst:
+        print inst
+
+else:
+    print "Command not found or not supported"
diff --git a/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-bbworker.apt b/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-bbworker.apt
new file mode 100644
index 000000000..40ee4b8a4
--- /dev/null
+++ b/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-bbworker.apt
@@ -0,0 +1,42 @@
+ARG FROMBASEOS
+ARG FROMBASEOS_BUILD_TAG=latest
+FROM electriccoinco/zcashd-build-$FROMBASEOS$FROMBASEOS_BUILD_TAG
+
+ARG DUMBINIT_VERSION=1.2.2
+RUN wget -O /usr/bin/dumb-init https://github.com/Yelp/dumb-init/releases/download/v${DUMBINIT_VERSION}/dumb-init_${DUMBINIT_VERSION}_amd64
+RUN chmod +x /usr/bin/dumb-init
+
+# Buildbot user
+ARG BUILDBOT_USER=zcbbworker
+ARG BUILDBOT_UID=2001
+RUN useradd --home-dir /home/$BUILDBOT_USER \
+            --shell /bin/bash \
+            --create-home \
+            --uid $BUILDBOT_UID\
+            $BUILDBOT_USER
+
+USER $BUILDBOT_USER
+WORKDIR /home/$BUILDBOT_USER
+
+ADD bbworker-requirements.txt requirements.txt
+RUN python -m venv venv \
+    && . venv/bin/activate \
+    && python -m pip install wheel \
+    && python -m pip install -r requirements.txt
+
+# Buildbot worker
+ARG BASEOS
+ENV BUILDBOT_WORKER_NAME=$BASEOS-docker
+ENV BUILDBOT_WORKER_PASS=thisgetssetwhenpodisstarted
+ENV BUILDBOT_MASTER_HOST=dev-ci.z.cash
+ENV BUILDBOT_MASTER_PORT=9899
+
+WORKDIR /home/$BUILDBOT_USER
+RUN venv/bin/buildbot-worker create-worker $BUILDBOT_WORKER_NAME \
+      $BUILDBOT_MASTER_HOST:$BUILDBOT_MASTER_PORT \
+      $BUILDBOT_WORKER_NAME $BUILDBOT_WORKER_PASS \
+    && echo "OS: $BASEOS" > $BUILDBOT_WORKER_NAME/info/host
+ADD bbworker-buildbot.tac $BUILDBOT_WORKER_NAME/buildbot.tac
+
+WORKDIR /home/$BUILDBOT_USER/$BUILDBOT_WORKER_NAME
+CMD ["/usr/bin/dumb-init", "../venv/bin/twistd", "--pidfile=", "-ny", "buildbot.tac"]
diff --git a/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-bbworker.arch b/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-bbworker.arch
new file mode 100644
index 000000000..c3e6ff9d7
--- /dev/null
+++ b/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-bbworker.arch
@@ -0,0 +1,35 @@
+FROM electriccoinco/zcashd-build-arch
+
+# Buildbot user
+ARG BUILDBOT_USER=zcbbworker
+ARG BUILDBOT_UID=2001
+RUN useradd --home-dir /home/$BUILDBOT_USER \
+            --shell /bin/bash \
+            --create-home \
+            --uid $BUILDBOT_UID\
+            $BUILDBOT_USER
+
+USER $BUILDBOT_USER
+WORKDIR /home/$BUILDBOT_USER
+
+ADD bbworker-requirements.txt requirements.txt
+RUN python -m venv venv \
+    && . venv/bin/activate \
+    && python -m pip install wheel \
+    && python -m pip install -r requirements.txt
+
+# Buildbot worker
+ARG BUILDBOT_WORKER_NAME=arch-docker
+ARG BUILDBOT_WORKER_PASS=thisgetssetwhenpodisstarted
+ARG BUILDBOT_MASTER_HOST=dev-ci.z.cash
+ARG BUILDBOT_MASTER_PORT=9899
+
+WORKDIR /home/$BUILDBOT_USER
+RUN venv/bin/buildbot-worker create-worker $BUILDBOT_WORKER_NAME \
+      $BUILDBOT_MASTER_HOST:$BUILDBOT_MASTER_PORT \
+      $BUILDBOT_WORKER_NAME $BUILDBOT_WORKER_PASS \
+    && echo "OS: Centos 8" > $BUILDBOT_WORKER_NAME/info/host
+ADD bbworker-buildbot.tac $BUILDBOT_WORKER_NAME/buildbot.tac
+
+WORKDIR /home/$BUILDBOT_USER/$BUILDBOT_WORKER_NAME
+CMD ["/usr/bin/dumb-init", "../venv/bin/twistd", "--pidfile=", "-ny", "buildbot.tac"]
diff --git a/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-bbworker.centos8 b/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-bbworker.centos8
new file mode 100644
index 000000000..fbc02101b
--- /dev/null
+++ b/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-bbworker.centos8
@@ -0,0 +1,35 @@
+FROM electriccoinco/zcashd-build-centos8
+
+# Buildbot user
+ARG BUILDBOT_USER=zcbbworker
+ARG BUILDBOT_UID=2001
+RUN useradd --home-dir /home/$BUILDBOT_USER \
+            --shell /bin/bash \
+            --create-home \
+            --uid $BUILDBOT_UID\
+            $BUILDBOT_USER
+
+USER $BUILDBOT_USER
+WORKDIR /home/$BUILDBOT_USER
+
+ADD bbworker-requirements.txt requirements.txt
+RUN python3 -m venv venv \
+    && . venv/bin/activate \
+    && python -m pip install wheel \
+    && python -m pip install -r requirements.txt
+
+# Buildbot worker
+ARG BUILDBOT_WORKER_NAME=centos8-docker
+ARG BUILDBOT_WORKER_PASS=thisgetssetwhenpodisstarted
+ARG BUILDBOT_MASTER_HOST=dev-ci.z.cash
+ARG BUILDBOT_MASTER_PORT=9899
+
+WORKDIR /home/$BUILDBOT_USER
+RUN venv/bin/buildbot-worker create-worker $BUILDBOT_WORKER_NAME \
+      $BUILDBOT_MASTER_HOST:$BUILDBOT_MASTER_PORT \
+      $BUILDBOT_WORKER_NAME $BUILDBOT_WORKER_PASS \
+    && echo "OS: Centos 8" > $BUILDBOT_WORKER_NAME/info/host
+ADD bbworker-buildbot.tac $BUILDBOT_WORKER_NAME/buildbot.tac
+
+WORKDIR /home/$BUILDBOT_USER/$BUILDBOT_WORKER_NAME
+CMD ["/usr/bin/dumb-init", "../venv/bin/twistd", "--pidfile=", "-ny", "buildbot.tac"]
diff --git a/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-build-python.apt b/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-build-python.apt
new file mode 100644
index 000000000..8b73e9bb7
--- /dev/null
+++ b/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-build-python.apt
@@ -0,0 +1,30 @@
+ARG FROMBASEOS
+ARG FROMBASEOS_BUILD_TAG
+FROM $FROMBASEOS:$FROMBASEOS_BUILD_TAG
+ARG DEBIAN_FRONTEND=noninteractive
+
+ADD apt-package-list.txt /tmp/apt-package-list.txt
+RUN apt-get update \
+    && apt-get install -y $(tr "\n" " " < /tmp/apt-package-list.txt) \
+    && update-alternatives --install /usr/bin/python python /usr/bin/python3 1
+
+ARG PYTHONVERSION=3.7.5
+RUN apt-get install -y \
+       build-essential \
+       zlib1g-dev \
+       libncurses5-dev \
+       libgdbm-dev \
+       libnss3-dev \
+       libssl-dev \
+       libreadline-dev \
+       libffi-dev \
+       curl
+WORKDIR /tmp
+RUN curl https://www.python.org/ftp/python/$PYTHONVERSION/Python-$PYTHONVERSION.tar.xz -o python.tar.xz \
+  && tar -xf python.tar.xz \
+  && cd Python-$PYTHONVERSION \
+  && ./configure --enable-optimizations \
+  && make -j 8 \
+  && make altinstall \
+  && update-alternatives --install /usr/bin/python python /usr/local/bin/python3.7 1
+RUN update-alternatives --install /usr/bin/python3 python3 /usr/local/bin/python3.7 1
\ No newline at end of file
diff --git a/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-build.apt b/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-build.apt
new file mode 100644
index 000000000..3b7fd9541
--- /dev/null
+++ b/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-build.apt
@@ -0,0 +1,9 @@
+ARG FROMBASEOS
+ARG FROMBASEOS_BUILD_TAG
+FROM $FROMBASEOS:$FROMBASEOS_BUILD_TAG
+ARG DEBIAN_FRONTEND=noninteractive
+
+ADD apt-package-list.txt /tmp/apt-package-list.txt
+RUN apt-get update \
+    && apt-get install -y $(tr "\n" " " < /tmp/apt-package-list.txt) \
+    && update-alternatives --install /usr/bin/python python /usr/bin/python3 1
diff --git a/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-build.arch b/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-build.arch
new file mode 100644
index 000000000..c75f5a190
--- /dev/null
+++ b/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-build.arch
@@ -0,0 +1,23 @@
+ARG ARCHLINUX_TAG
+FROM archlinux:$ARCHLINUX_TAG
+
+RUN pacman -Syyu --noconfirm \
+    && pacman -S --noconfirm \
+      base-devel \
+      git \
+      python3 \
+      python-pip \
+      wget
+
+RUN wget -O /usr/bin/dumb-init https://github.com/Yelp/dumb-init/releases/download/v1.2.2/dumb-init_1.2.2_amd64
+RUN chmod +x /usr/bin/dumb-init
+RUN python -m pip install virtualenv
+# AUR for libtinfo5 Source: https://dev.to/cloudx/testing-our-package-build-in-the-docker-world-34p0
+RUN useradd builduser -m \
+  && passwd -d builduser \
+  && cd /home/builduser \
+  && git clone "https://aur.archlinux.org/ncurses5-compat-libs.git" ncurses5-compat-libs \
+  && chown builduser -R ncurses5-compat-libs \
+  && (printf 'builduser ALL=(ALL) ALL\n' | tee -a /etc/sudoers) \
+  && sudo -u builduser bash -c 'gpg --keyserver pool.sks-keyservers.net --recv-keys 702353E0F7E48EDB' \
+  && sudo -u builduser bash -c 'cd ~/ncurses5-compat-libs && makepkg -si --noconfirm'
\ No newline at end of file
diff --git a/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-build.centos8 b/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-build.centos8
new file mode 100644
index 000000000..b5fb3eb20
--- /dev/null
+++ b/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-build.centos8
@@ -0,0 +1,14 @@
+FROM centos:8
+
+RUN yum update -y \
+    && dnf group install -y "Development Tools" \
+    && yum install -y \
+      ncurses-compat-libs \
+      python3 \
+      python3-devel \
+      wget
+
+RUN wget -O /usr/bin/dumb-init https://github.com/Yelp/dumb-init/releases/download/v1.2.2/dumb-init_1.2.2_amd64
+RUN chmod +x /usr/bin/dumb-init
+RUN alternatives --set  python /usr/bin/python3 \
+    && python3 -m pip install virtualenv
diff --git a/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-gitian.apt b/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-gitian.apt
new file mode 100644
index 000000000..5ca2a8757
--- /dev/null
+++ b/depend/zcash/contrib/ci-builders/buildbot/Dockerfile-gitian.apt
@@ -0,0 +1,8 @@
+ARG FROMBASEOS
+ARG FROMBASEOS_BUILD_TAG=latest
+FROM electriccoinco/zcashd-build-$FROMBASEOS$FROMBASEOS_BUILD_TAG
+
+RUN useradd -ms /bin/bash -U debian
+USER debian:debian
+WORKDIR /home/debian
+CMD ["sleep", "infinity"]
\ No newline at end of file
diff --git a/depend/zcash/contrib/ci-builders/buildbot/README.md b/depend/zcash/contrib/ci-builders/buildbot/README.md
new file mode 100644
index 000000000..46cd3affb
--- /dev/null
+++ b/depend/zcash/contrib/ci-builders/buildbot/README.md
@@ -0,0 +1,42 @@
+# zcashd ci Docker images
+
+These Dockerfiles can be used to build zcashd.
+
+The current objective is to build a base image for each distribution that includes the system packages to build zcashd. From `build` images, more targeted images are created.
+
+The process is meant to be automated, but an example `docker-build.sh` script is included.
+
+
+## build images
+`apt-package-list.txt` contains the required packages for debian based systems.
+
+`Dockerfile-build.apt` uses that file, and some build time arguments, to build apt based build images.
+
+Currently available images are hosted at
+https://hub.docker.com/r/electriccoinco/zcashd-build/tags
+
+
+## gitian images
+
+`Dockerfile-gitian.apt` uses the build images to generate images for use with [gitian-builder](https://github.com/devrandom/gitian-builder)
+
+Currently available images are hosted at https://hub.docker.com/r/electriccoinco/zcashd-gitian/tags
+
+
+## bbworker images
+
+`Dockerfile-bbworker.apt` uses the build images for use with [buildbot](https://buildbot.net)
+
+- bbworker-buildbot.tac is a required worker boot file (most is overridden at instancitation)
+- bbworker-requirements.txt is the python package requirements for the buildbot worker
+
+Currently available images are hosted at https://hub.docker.com/r/electriccoinco/zcashd-bbworker/tags
+
+
+### Stand alone, best effort images
+
+Additional buildbot workers for Centos8 and Arch.
+
+- Dockerfile-bbworker.arch
+- Dockerfile-bbworker.centos8
+
diff --git a/depend/zcash/contrib/ci-builders/buildbot/apt-package-list.txt b/depend/zcash/contrib/ci-builders/buildbot/apt-package-list.txt
new file mode 100644
index 000000000..484f31953
--- /dev/null
+++ b/depend/zcash/contrib/ci-builders/buildbot/apt-package-list.txt
@@ -0,0 +1,23 @@
+autoconf
+bsdmainutils
+build-essential
+cmake
+curl
+g++-aarch64-linux-gnu
+git
+lcov
+libcap-dev
+libffi-dev
+libtinfo5
+libtool
+libssl-dev
+libz-dev
+libbz2-dev
+mingw-w64
+pkg-config
+python3
+python3-dev
+python3-venv
+valgrind
+wget
+zstd
diff --git a/depend/zcash/contrib/ci-builders/buildbot/bbworker-buildbot.tac b/depend/zcash/contrib/ci-builders/buildbot/bbworker-buildbot.tac
new file mode 100644
index 000000000..477ae27d3
--- /dev/null
+++ b/depend/zcash/contrib/ci-builders/buildbot/bbworker-buildbot.tac
@@ -0,0 +1,40 @@
+import fnmatch
+import os
+import sys
+
+from twisted.application import service
+from twisted.python.log import FileLogObserver
+from twisted.python.log import ILogObserver
+
+from buildbot_worker.bot import Worker
+
+# setup worker
+basedir = os.environ.get("BUILDBOT_BASEDIR",
+    os.path.abspath(os.path.dirname(__file__)))
+application = service.Application('buildbot-worker')
+
+
+application.setComponent(ILogObserver, FileLogObserver(sys.stdout).emit)
+# and worker on the same process!
+buildmaster_host = os.environ.get("BUILDMASTER", 'localhost')
+port = int(os.environ.get("BUILDMASTER_PORT", 9989))
+workername = os.environ.get("WORKERNAME", 'docker')
+passwd = os.environ.get("WORKERPASS")
+
+# delete the password from the environ so that it is not leaked in the log
+blacklist = os.environ.get("WORKER_ENVIRONMENT_BLACKLIST", "WORKERPASS").split()
+for name in list(os.environ.keys()):
+    for toremove in blacklist:
+        if fnmatch.fnmatch(name, toremove):
+            del os.environ[name]
+
+keepalive = 600
+umask = None
+maxdelay = 300
+allow_shutdown = None
+maxretries = 10
+
+s = Worker(buildmaster_host, port, workername, passwd, basedir,
+           keepalive, umask=umask, maxdelay=maxdelay,
+           allow_shutdown=allow_shutdown, maxRetries=maxretries)
+s.setServiceParent(application)
diff --git a/depend/zcash/contrib/ci-builders/buildbot/bbworker-requirements.txt b/depend/zcash/contrib/ci-builders/buildbot/bbworker-requirements.txt
new file mode 100644
index 000000000..012268cae
--- /dev/null
+++ b/depend/zcash/contrib/ci-builders/buildbot/bbworker-requirements.txt
@@ -0,0 +1,9 @@
+buildbot-worker
+pyblake2
+pyflakes
+pyutil
+pyzmq
+requests
+simplejson
+twisted[tls]
+wheel
diff --git a/depend/zcash/contrib/ci-builders/buildbot/docker-build.sh b/depend/zcash/contrib/ci-builders/buildbot/docker-build.sh
new file mode 100755
index 000000000..fb806e8dc
--- /dev/null
+++ b/depend/zcash/contrib/ci-builders/buildbot/docker-build.sh
@@ -0,0 +1,62 @@
+#!/usr/bin/env bash
+
+export LC_ALL=C
+set -exo pipefail
+
+# Debian 9
+docker build . -f Dockerfile-build-python.apt --build-arg FROMBASEOS=debian --build-arg FROMBASEOS_BUILD_TAG=9 -t electriccoinco/zcashd-build-debian9
+docker push electriccoinco/zcashd-build-debian9
+docker build . -f Dockerfile-bbworker.apt --build-arg BASEOS=debian --build-arg FROMBASEOS=debian --build-arg FROMBASEOS_BUILD_TAG=9 -t electriccoinco/zcashd-bbworker-debian9
+docker push electriccoinco/zcashd-bbworker-debian9
+
+# Debian 10
+docker build . -f Dockerfile-build.apt --build-arg FROMBASEOS=debian --build-arg FROMBASEOS_BUILD_TAG=10 -t electriccoinco/zcashd-build-debian10
+docker push electriccoinco/zcashd-build-debian10
+docker build . -f Dockerfile-gitian.apt --build-arg FROMBASEOS=debian --build-arg FROMBASEOS_BUILD_TAG=10 -t electriccoinco/zcashd-gitian-debian10
+docker push electriccoinco/zcashd-gitian-debian10
+docker build . -f Dockerfile-bbworker.apt --build-arg BASEOS=debian --build-arg FROMBASEOS=debian --build-arg FROMBASEOS_BUILD_TAG=10 -t electriccoinco/zcashd-bbworker-debian10
+docker push electriccoinco/zcashd-bbworker-debian10
+
+# Debian 11
+docker build . -f Dockerfile-build.apt --build-arg FROMBASEOS=debian --build-arg FROMBASEOS_BUILD_TAG=bullseye -t electriccoinco/zcashd-build-debian11
+docker push electriccoinco/zcashd-build-debian11
+docker build . -f Dockerfile-gitian.apt --build-arg FROMBASEOS=debian --build-arg FROMBASEOS_BUILD_TAG=bullseye -t electriccoinco/zcashd-gitian-debian11
+docker push electriccoinco/zcashd-gitian-debian11
+docker build . -f Dockerfile-bbworker.apt --build-arg BASEOS=debian --build-arg FROMBASEOS=debian --build-arg FROMBASEOS_BUILD_TAG=bullseye -t electriccoinco/zcashd-bbworker-debian11
+docker push electriccoinco/zcashd-bbworker-debian11
+
+# Ubuntu 16.04
+docker build . -f Dockerfile-build.apt --build-arg FROMBASEOS=ubuntu --build-arg FROMBASEOS_BUILD_TAG=16.04 -t electriccoinco/zcashd-build-ubuntu1604
+docker push electriccoinco/zcashd-build-ubuntu1604
+docker build . -f Dockerfile-gitian.apt --build-arg FROMBASEOS=ubuntu --build-arg FROMBASEOS_BUILD_TAG=1604 -t electriccoinco/zcashd-gitian-ubuntu1604
+docker push electriccoinco/zcashd-gitian-ubuntu1604
+docker build . -f Dockerfile-bbworker.apt --build-arg BASEOS=ubuntu --build-arg FROMBASEOS=ubuntu --build-arg FROMBASEOS_BUILD_TAG=1604 -t electriccoinco/zcashd-bbworker-ubuntu1604
+docker push electriccoinco/zcashd-bbworker-ubuntu1604
+
+# Ubuntu 18.04
+docker build . -f Dockerfile-build.apt --build-arg FROMBASEOS=ubuntu --build-arg FROMBASEOS_BUILD_TAG=18.04 -t electriccoinco/zcashd-build-ubuntu1804
+docker push electriccoinco/zcashd-build-ubuntu1804
+docker build . -f Dockerfile-gitian.apt --build-arg FROMBASEOS=ubuntu --build-arg FROMBASEOS_BUILD_TAG=1804 -t electriccoinco/zcashd-gitian-ubuntu1804
+docker push electriccoinco/zcashd-gitian-ubuntu1804
+docker build . -f Dockerfile-bbworker.apt --build-arg BASEOS=ubuntu --build-arg FROMBASEOS=ubuntu --build-arg FROMBASEOS_BUILD_TAG=1804 -t electriccoinco/zcashd-bbworker-ubuntu1804
+docker push electriccoinco/zcashd-bbworker-ubuntu1804
+
+# Ubuntu 20.04
+docker build . -f Dockerfile-build.apt --build-arg FROMBASEOS=ubuntu --build-arg FROMBASEOS_BUILD_TAG=20.04 -t electriccoinco/zcashd-build-ubuntu2004
+docker push electriccoinco/zcashd-build-ubuntu2004
+docker build . -f Dockerfile-gitian.apt --build-arg FROMBASEOS=ubuntu --build-arg FROMBASEOS_BUILD_TAG=2004 -t electriccoinco/zcashd-gitian-ubuntu2004
+docker push electriccoinco/zcashd-gitian-ubuntu2004
+docker build . -f Dockerfile-bbworker.apt --build-arg BASEOS=ubuntu --build-arg FROMBASEOS=ubuntu --build-arg FROMBASEOS_BUILD_TAG=2004 -t electriccoinco/zcashd-bbworker-ubuntu2004
+docker push electriccoinco/zcashd-bbworker-ubuntu2004
+
+# Centos8
+docker build . -f Dockerfile-build.centos8 -t electriccoinco/zcashd-build-centos8
+docker build . -f Dockerfile-bbworker.centos8  -t electriccoinco/zcashd-bbworker-centos8
+docker push electriccoinco/zcashd-build-centos8
+docker push electriccoinco/zcashd-bbworker-centos8
+
+# Arch 20200908
+docker build . -f Dockerfile-build.arch --build-arg ARCHLINUX_TAG=20200908 -t electriccoinco/zcashd-build-arch
+docker build . -f Dockerfile-bbworker.arch  -t electriccoinco/zcashd-bbworker-arch
+docker push electriccoinco/zcashd-build-arch
+docker push electriccoinco/zcashd-bbworker-arch
\ No newline at end of file
diff --git a/depend/zcash/contrib/ci-builders/tekton/Dockerfile-build.apt b/depend/zcash/contrib/ci-builders/tekton/Dockerfile-build.apt
new file mode 100644
index 000000000..3b7fd9541
--- /dev/null
+++ b/depend/zcash/contrib/ci-builders/tekton/Dockerfile-build.apt
@@ -0,0 +1,9 @@
+ARG FROMBASEOS
+ARG FROMBASEOS_BUILD_TAG
+FROM $FROMBASEOS:$FROMBASEOS_BUILD_TAG
+ARG DEBIAN_FRONTEND=noninteractive
+
+ADD apt-package-list.txt /tmp/apt-package-list.txt
+RUN apt-get update \
+    && apt-get install -y $(tr "\n" " " < /tmp/apt-package-list.txt) \
+    && update-alternatives --install /usr/bin/python python /usr/bin/python3 1
diff --git a/depend/zcash/contrib/ci-builders/tekton/Dockerfile-build.arch b/depend/zcash/contrib/ci-builders/tekton/Dockerfile-build.arch
new file mode 100644
index 000000000..f1a1666b2
--- /dev/null
+++ b/depend/zcash/contrib/ci-builders/tekton/Dockerfile-build.arch
@@ -0,0 +1,14 @@
+ARG FROMBASEOS
+ARG FROMBASEOS_BUILD_TAG
+FROM $FROMBASEOS:$FROMBASEOS_BUILD_TAG
+
+RUN pacman -Syyu --noconfirm \
+    && pacman -S --noconfirm \
+      base-devel \
+      git \
+      python3 \
+      python-pip \
+      ncurses \
+      wget
+
+RUN sudo link /lib/libtinfo.so.6 /lib/libtinfo.so.5
diff --git a/depend/zcash/contrib/ci-builders/tekton/Dockerfile-build.centos8 b/depend/zcash/contrib/ci-builders/tekton/Dockerfile-build.centos8
new file mode 100644
index 000000000..b5fb3eb20
--- /dev/null
+++ b/depend/zcash/contrib/ci-builders/tekton/Dockerfile-build.centos8
@@ -0,0 +1,14 @@
+FROM centos:8
+
+RUN yum update -y \
+    && dnf group install -y "Development Tools" \
+    && yum install -y \
+      ncurses-compat-libs \
+      python3 \
+      python3-devel \
+      wget
+
+RUN wget -O /usr/bin/dumb-init https://github.com/Yelp/dumb-init/releases/download/v1.2.2/dumb-init_1.2.2_amd64
+RUN chmod +x /usr/bin/dumb-init
+RUN alternatives --set  python /usr/bin/python3 \
+    && python3 -m pip install virtualenv
diff --git a/depend/zcash/contrib/ci-builders/tekton/Dockerfile-tekton-worker b/depend/zcash/contrib/ci-builders/tekton/Dockerfile-tekton-worker
new file mode 100644
index 000000000..6e880dd46
--- /dev/null
+++ b/depend/zcash/contrib/ci-builders/tekton/Dockerfile-tekton-worker
@@ -0,0 +1,11 @@
+ARG FROMBASEOS
+ARG FROMBASEOS_BUILD_TAG
+FROM electriccoinco/zcashd-build-$FROMBASEOS$FROMBASEOS_BUILD_TAG
+
+ADD requirements.txt requirements.txt
+RUN python -m venv venv \
+    && . venv/bin/activate \
+    && pip install --upgrade pip \
+    && python -m pip install -r requirements.txt
+
+ADD ./zcash-params /home/.zcash-params
diff --git a/depend/zcash/contrib/ci-builders/tekton/README.md b/depend/zcash/contrib/ci-builders/tekton/README.md
new file mode 100644
index 000000000..667caf5ab
--- /dev/null
+++ b/depend/zcash/contrib/ci-builders/tekton/README.md
@@ -0,0 +1,35 @@
+# zcashd ci Docker images
+
+These Dockerfiles can be used to build zcashd.
+
+The current objective is to build a base image for each distribution that includes the system packages to build zcashd. From `build` images, more targeted images are created.
+
+The process is meant to be automated, but an example `docker-build.sh` script is included.
+
+
+## build images
+`apt-package-tekton-list.txt` contains the required packages for debian based systems.
+
+`Dockerfile-build.apt` uses that file, and some build time arguments, to build apt based build images.
+
+Currently available images are hosted at
+https://hub.docker.com/r/electriccoinco/zcashd-build/tags
+
+
+
+## Tekton worker images
+
+`Dockerfile-tekton-worker` uses the above build images as a base and layers on toolchains needed for testing
+
+- requirements.txt is the python package requirements for the tekton worker
+
+Currently available images are hosted at https://hub.docker.com/r/electriccoinco
+
+
+### Stand alone, best effort images
+
+Additional Tekton base builders for Centos8 and Arch. Can be used with `Dockerfile-tekton-worker` to create Tekton workers.
+
+- Dockerfile-build.arch
+- Dockerfile-build.centos8
+
diff --git a/depend/zcash/contrib/ci-builders/tekton/apt-package-tekton-list.txt b/depend/zcash/contrib/ci-builders/tekton/apt-package-tekton-list.txt
new file mode 100644
index 000000000..002363de3
--- /dev/null
+++ b/depend/zcash/contrib/ci-builders/tekton/apt-package-tekton-list.txt
@@ -0,0 +1,24 @@
+autoconf
+bsdmainutils
+build-essential
+cmake
+curl
+g++-aarch64-linux-gnu
+git
+lcov
+libcap-dev
+libffi-dev
+libtinfo5
+libtool
+libssl-dev
+libz-dev
+libbz2-dev
+mingw-w64
+pkg-config
+python3
+python3-pip
+python3-dev
+python3-venv
+valgrind
+wget
+zstd
diff --git a/depend/zcash/contrib/ci-builders/tekton/docker-build.sh b/depend/zcash/contrib/ci-builders/tekton/docker-build.sh
new file mode 100755
index 000000000..1f7c4eb8f
--- /dev/null
+++ b/depend/zcash/contrib/ci-builders/tekton/docker-build.sh
@@ -0,0 +1,60 @@
+#!/usr/bin/env bash
+
+export LC_ALL=C
+set -exo pipefail
+
+# Debian 9
+docker build . -f Dockerfile-build-python.apt --build-arg FROMBASEOS=debian --build-arg FROMBASEOS_BUILD_TAG=9 -t electriccoinco/zcashd-build-debian9
+docker push electriccoinco/zcashd-build-debian9
+
+docker build . -f Dockerfile-tekton-worker --build-arg BASEOS=debian --build-arg FROMBASEOS=debian --build-arg FROMBASEOS_BUILD_TAG=9 -t electriccoinco/zcashd-worker-debian9
+docker push electriccoinco/zcashd-worker-debian9
+
+# Debian 10
+docker build . -f Dockerfile-build.apt --build-arg FROMBASEOS=debian --build-arg FROMBASEOS_BUILD_TAG=10 -t electriccoinco/zcashd-build-debian10
+docker push electriccoinco/zcashd-build-debian10
+
+docker build . -f Dockerfile-tekton-worker --build-arg BASEOS=debian --build-arg FROMBASEOS=debian --build-arg FROMBASEOS_BUILD_TAG=10 -t electriccoinco/zcashd-worker-debian10
+docker push electriccoinco/zcashd-worker-debian10
+
+# Debian 11
+docker build . -f Dockerfile-build.apt --build-arg FROMBASEOS=debian --build-arg FROMBASEOS_BUILD_TAG=bullseye -t electriccoinco/zcashd-build-debian11
+docker push electriccoinco/zcashd-build-debian11
+
+docker build . -f Dockerfile-tekton-worker --build-arg FROMBASEOS=debian --build-arg FROMBASEOS_BUILD_TAG=11 -t electriccoinco/zcashd-worker-debian11
+docker push electriccoinco/zcashd-worker-debian11
+
+# Ubuntu 16.04
+docker build . -f Dockerfile-build.apt --build-arg FROMBASEOS=ubuntu --build-arg FROMBASEOS_BUILD_TAG=16.04 -t electriccoinco/zcashd-build-ubuntu1604
+docker push electriccoinco/zcashd-build-ubuntu1604
+
+docker build . -f Dockerfile-tekton-worker --build-arg BASEOS=ubuntu --build-arg FROMBASEOS=ubuntu --build-arg FROMBASEOS_BUILD_TAG=1604 -t electriccoinco/zcashd-worker-ubuntu1604
+docker push electriccoinco/zcashd-worker-ubuntu1604
+
+# Ubuntu 18.04
+docker build . -f Dockerfile-build.apt --build-arg FROMBASEOS=ubuntu --build-arg FROMBASEOS_BUILD_TAG=18.04 -t electriccoinco/zcashd-build-ubuntu1804
+docker push electriccoinco/zcashd-build-ubuntu1804
+
+docker build . -f Dockerfile-tekton-worker --build-arg BASEOS=ubuntu --build-arg FROMBASEOS=ubuntu --build-arg FROMBASEOS_BUILD_TAG=1804 -t electriccoinco/zcashd-worker-ubuntu1804
+docker push electriccoinco/zcashd-worker-ubuntu1804
+
+# Ubuntu 20.04
+docker build . -f Dockerfile-build.apt --build-arg FROMBASEOS=ubuntu --build-arg FROMBASEOS_BUILD_TAG=20.04 -t electriccoinco/zcashd-build-ubuntu2004
+docker push electriccoinco/zcashd-build-ubuntu2004
+
+docker build . -f Dockerfile-tekton-worker --build-arg BASEOS=ubuntu --build-arg FROMBASEOS=ubuntu --build-arg FROMBASEOS_BUILD_TAG=2004 -t electriccoinco/zcashd-worker-ubuntu2004
+docker push electriccoinco/zcashd-worker-ubuntu2004
+
+# Centos8
+docker build . -f Dockerfile-build.centos8 -t electriccoinco/zcashd-build-centos8
+docker push electriccoinco/zcashd-build-centos8
+
+docker build . -f Dockerfile-tekton-worker --build-arg FROMBASEOS=centos --build-arg FROMBASEOS_BUILD_TAG=8  -t electriccoinco/zcashd-worker-centos8
+docker push electriccoinco/zcashd-worker-centos8
+
+# Arch 20210418.0.20194
+docker build . -f Dockerfile-build.arch --build-arg FROMBASEOS=archlinux --build-arg FROMBASEOS_BUILD_TAG=base-20210418.0.20194 -t electriccoinco/zcashd-build-archlinux
+docker push electriccoinco/zcashd-build-archlinux
+
+docker build . -f Dockerfile-tekton-worker --build-arg FROMBASEOS=archlinux -t electriccoinco/zcashd-worker-archlinux
+docker push electriccoinco/zcashd-worker-archlinux
\ No newline at end of file
diff --git a/depend/zcash/contrib/ci-builders/tekton/requirements.txt b/depend/zcash/contrib/ci-builders/tekton/requirements.txt
new file mode 100644
index 000000000..14f84708a
--- /dev/null
+++ b/depend/zcash/contrib/ci-builders/tekton/requirements.txt
@@ -0,0 +1,8 @@
+wheel
+pyblake2
+pyflakes
+pyutil
+pyzmq
+requests
+simplejson
+twisted[tls]
diff --git a/depend/zcash/contrib/ci-workers/README.md b/depend/zcash/contrib/ci-workers/README.md
new file mode 100644
index 000000000..8ce9dc764
--- /dev/null
+++ b/depend/zcash/contrib/ci-workers/README.md
@@ -0,0 +1,62 @@
+# Zcash CI workers
+
+This folder contains the Ansible playbooks for configuring a fresh OS
+installation for use as a Buildbot worker in Zcash's CI.
+
+# Criteria for Adding Workers
+
+a. Don't add workers until users complain about a problem on a platform that
+   doesn't yet have workers. However, if we anticipate many users will use a
+   platform, we may pre-emptively add an unsupported worker for it.
+
+b. Prioritize the platforms that seem to have the most users.
+
+c. When adding workers, start by adding workers for the "most common" variant of
+   any distro. Then if users later encounter problems with a sub-variant, we can
+   consider adding new workers at that point. Example: add Ubuntu Desktop before
+   Xubuntu, on the assumption the former has a larger population base, and the
+   latter only materially differs in the GUI.
+
+# Setting up a latent worker on Amazon EC2
+
+1. Add a regular (non-latent) worker to the master.cfg for dev-ci.z.cash, and
+   deploy the changes.
+  - This enables the Ansible playbook to run to completion, ending in the worker
+    connecting to the master.
+
+2. Start a basic EC2 instance using the template AMI for the target OS.
+  - Choose the smallest instance size, it won't be used for building Zcash.
+
+3. Figure out which user to log into the instance with.
+  - E.g. for the Ubuntu template, use "ubuntu" instead of "root"
+  - If you get an Ansible error later with a message like "Failed to connect to
+    the host via ssh: Received message too long 1349281121\r\n", that means the
+    instance is sending a text string in response to the SSH connection, and the
+    Ansible protocol is balking. Try manually logging in with the same
+    credentials to diagnose.
+
+4. Create `inventory/hosts` containing the following:
+
+    [zcash-ci-worker-unix]
+    some-name ansible_host=<INSTANCE_IP> ansible_ssh_user=<USERNAME>
+
+5. Run `ansible-playbook -e buildbot_worker_host_template=templates/host.ec2.j2 -i inventory/hosts unix.yml`,
+   passing in the worker's Buildbot name and password.
+  - After a successful run, the worker should be connected to dev-ci.z.cash and
+    visible in its worker list.
+
+6. Create an AMI from the instance. This is the worker AMI to put into the
+   master.cfg for dev-ci.z.cash.
+  - 16 GB of storage should be sufficient.
+
+7. SSH into the instance, and edit the worker config to connect to ci.z.cash.
+
+8. Create an AMI from the instance. This is the worker AMI to put into the
+   master.cfg for ci.z.cash.
+  - 16 GB of storage should be sufficient.
+
+9. Delete the instance (it is no longer needed).
+
+10. Edit the master.cfg to turn the new worker into a latent (using the new AMI
+    IDs), add it to the appropriate worker groups, set up new builders etc.
+  - Deploy this via the normal PR review process.
diff --git a/depend/zcash/contrib/ci-workers/ansible.cfg b/depend/zcash/contrib/ci-workers/ansible.cfg
new file mode 100644
index 000000000..c58fea3c0
--- /dev/null
+++ b/depend/zcash/contrib/ci-workers/ansible.cfg
@@ -0,0 +1,2 @@
+[ssh_connection]
+pipelining = True
diff --git a/depend/zcash/contrib/ci-workers/files/bashrc b/depend/zcash/contrib/ci-workers/files/bashrc
new file mode 100644
index 000000000..aaad18b92
--- /dev/null
+++ b/depend/zcash/contrib/ci-workers/files/bashrc
@@ -0,0 +1,2 @@
+export PATH=$HOME/venv/bin:/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin
+export EDITOR=vim
diff --git a/depend/zcash/contrib/ci-workers/grind.yml b/depend/zcash/contrib/ci-workers/grind.yml
new file mode 100644
index 000000000..ef7e5758e
--- /dev/null
+++ b/depend/zcash/contrib/ci-workers/grind.yml
@@ -0,0 +1,27 @@
+---
+# Configure a Buildbot worker
+- include: unix.yml
+
+- name: Install grind-specific worker dependencies
+  hosts: zcash-ci-worker-unix
+  become: true
+
+  vars_files:
+    - vars/default.yml
+
+  tasks:
+    - name: Get dependencies for distribution
+      include_vars: "{{ item }}"
+      with_first_found:
+        - files:
+            - "vars/{{ ansible_distribution }}-{{ ansible_distribution_version }}.yml"
+            - "vars/{{ ansible_distribution }}-{{ ansible_distribution_major_version | int }}.yml"
+            - "vars/{{ ansible_distribution }}.yml"
+            - "vars/{{ ansible_os_family }}.yml"
+          skip: true
+
+    - name: Install required packages
+      package:
+        name: "{{ item }}"
+        state: present
+      with_items: "{{ grind_deps }}"
diff --git a/depend/zcash/contrib/ci-workers/tasks/install-brew.yml b/depend/zcash/contrib/ci-workers/tasks/install-brew.yml
new file mode 100644
index 000000000..5faedad0b
--- /dev/null
+++ b/depend/zcash/contrib/ci-workers/tasks/install-brew.yml
@@ -0,0 +1,10 @@
+---
+- name: Check if brew is installed
+  stat:
+    path: /usr/local/bin/brew
+  register: brew_check
+
+- name: Fail if brew is unavailable
+  fail:
+    msg: 'brew is not installed! Please install Homebrew: https://docs.brew.sh/Installation.html'
+  when: not brew_check.stat.exists
diff --git a/depend/zcash/contrib/ci-workers/tasks/install-pip.yml b/depend/zcash/contrib/ci-workers/tasks/install-pip.yml
new file mode 100644
index 000000000..8beff50ef
--- /dev/null
+++ b/depend/zcash/contrib/ci-workers/tasks/install-pip.yml
@@ -0,0 +1,8 @@
+---
+- name: Fetch pip installer
+  get_url:
+    url: https://bootstrap.pypa.io/get-pip.py
+    dest: /tmp/get-pip.py
+
+- name: Install pip
+  command: "{{ ansible_python.executable }} /tmp/get-pip.py"
diff --git a/depend/zcash/contrib/ci-workers/templates/buildbot-worker.plist.j2 b/depend/zcash/contrib/ci-workers/templates/buildbot-worker.plist.j2
new file mode 100644
index 000000000..225c73b8a
--- /dev/null
+++ b/depend/zcash/contrib/ci-workers/templates/buildbot-worker.plist.j2
@@ -0,0 +1,23 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple Computer//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
+<plist version="1.0">
+<dict>
+	<key>Label</key>
+	<string>net.buildbot.worker</string>
+	<key>ProgramArguments</key>
+	<array>
+		<string>{{ buildbot_worker_dir }}/venv/bin/buildbot-worker</string>
+		<string>start</string>
+		<string>{{ buildbot_worker_name }}</string>
+	</array>
+	<key>WorkingDirectory</key>
+	<string>{{ buildbot_worker_dir }}</string>
+	<key>UserName</key>
+	<string>{{ buildbot_worker_user }}</string>
+	<key>KeepAlive</key>
+	<dict>
+		<key>NetworkState</key>
+		<true/>
+	</dict>
+</dict>
+</plist>
diff --git a/depend/zcash/contrib/ci-workers/templates/buildbot-worker.service.j2 b/depend/zcash/contrib/ci-workers/templates/buildbot-worker.service.j2
new file mode 100644
index 000000000..625323be6
--- /dev/null
+++ b/depend/zcash/contrib/ci-workers/templates/buildbot-worker.service.j2
@@ -0,0 +1,17 @@
+[Unit]
+Description=Buildbot worker
+Wants=network.target
+After=network.target
+
+[Service]
+Type=forking
+PIDFile={{ buildbot_worker_dir }}/{{ buildbot_worker_name }}/twistd.pid
+WorkingDirectory={{ buildbot_worker_dir }}
+ExecStart={{ buildbot_worker_dir }}/venv/bin/buildbot-worker start {{ buildbot_worker_name }}
+ExecReload={{ buildbot_worker_dir }}/venv/bin/buildbot-worker restart {{ buildbot_worker_name }}
+ExecStop={{ buildbot_worker_dir }}/venv/bin/buildbot-worker stop {{ buildbot_worker_name }}
+Restart=always
+User={{ buildbot_worker_user }}
+
+[Install]
+WantedBy=multi-user.target
diff --git a/depend/zcash/contrib/ci-workers/templates/host.ec2.j2 b/depend/zcash/contrib/ci-workers/templates/host.ec2.j2
new file mode 100644
index 000000000..dee692e02
--- /dev/null
+++ b/depend/zcash/contrib/ci-workers/templates/host.ec2.j2
@@ -0,0 +1 @@
+OS: {{ ansible_distribution }} {{ ansible_distribution_version }}
diff --git a/depend/zcash/contrib/ci-workers/templates/host.j2 b/depend/zcash/contrib/ci-workers/templates/host.j2
new file mode 100644
index 000000000..65c4cb709
--- /dev/null
+++ b/depend/zcash/contrib/ci-workers/templates/host.j2
@@ -0,0 +1,3 @@
+OS: {{ ansible_distribution }} {{ ansible_distribution_version }}
+Memory: {{ ansible_memtotal_mb }} MB
+CPU: {{ ansible_processor if ansible_processor is string else ansible_processor[1] }} ({{ ansible_processor_cores }} cores)
diff --git a/depend/zcash/contrib/ci-workers/unix.yml b/depend/zcash/contrib/ci-workers/unix.yml
new file mode 100644
index 000000000..cbb693401
--- /dev/null
+++ b/depend/zcash/contrib/ci-workers/unix.yml
@@ -0,0 +1,209 @@
+---
+- name: Configure a Buildbot worker for Zcash CI
+  hosts: zcash-ci-worker-unix
+  become: true
+  gather_facts: False
+
+  vars_files:
+    - vars/default.yml
+    - vars/buildbot.yml
+
+  vars_prompt:
+    - name: "buildbot_worker_admin"
+      prompt: "Admin details"
+      default: "Zcash <sysadmin@z.cash>"
+    - name: "buildbot_worker_name"
+      prompt: "Buildbot worker name (provided by ZECC)"
+      private: no
+    - name: "buildbot_worker_password"
+      prompt: "Buildbot worker password (provided by ZECC)"
+
+  pre_tasks:
+    - name: Install Python 2.7 for Ansible and Buildbot
+      raw: test -e /usr/bin/python || test -e /usr/bin/python2 || test -e /usr/bin/python2.7 || test -e /usr/local/bin/python2.7 || (test -e /usr/bin/apt && apt -qqy update && apt install -qqy python) || (test -e /usr/bin/dnf && dnf install -qqy python2) || (test -e /usr/sbin/pkg && pkg install -qqy python2)
+      register: output
+      changed_when:
+        - output.stdout != ""
+        - output.stdout != "\r\n"
+
+    - name: Check if Python is in the configured location
+      raw: test -e {{ ansible_python_interpreter }}
+      ignore_errors: true
+      register: python_check
+      when: ansible_python_interpreter is defined
+
+    - name: Fail if configured Python is unavailable
+      fail:
+        msg: "Python is not accessible at {{ ansible_python_interpreter }} on this host! Please set the inventory variable 'ansible_python_interpreter' to the location of the Python 2.7 binary."
+      when: ansible_python_interpreter is defined and python_check.rc == 1
+
+    - name: Check if Python is in the default location
+      raw: test -e /usr/bin/python
+      ignore_errors: true
+      register: python_check
+      when: ansible_python_interpreter is undefined
+
+    - name: Fail if default Python is unavailable
+      fail:
+        msg: Python is not accessible at /usr/bin/python on this host! Please set the inventory variable 'ansible_python_interpreter' to the location of the Python 2.7 binary.
+      when: ansible_python_interpreter is undefined and python_check.rc == 1
+
+    - name: Gathering Facts
+      setup:
+      tags: deps
+
+    - name: Fail if Python is the wrong version
+      fail:
+        msg: "The Python binary at {{ ansible_python.executable }} is version {{ ansible_python_version }}! Please set the inventory variable 'ansible_python_interpreter' to the location of the Python 2.7 binary."
+      when: ansible_python.version.major != 2 or ansible_python.version.minor != 7
+
+  tasks:
+    - name: Get dependencies for distribution
+      include_vars: "{{ item }}"
+      with_first_found:
+        - files:
+            - "vars/{{ ansible_distribution }}-{{ ansible_distribution_version }}.yml"
+            - "vars/{{ ansible_distribution }}-{{ ansible_distribution_major_version | int }}.yml"
+            - "vars/{{ ansible_distribution }}.yml"
+            - "vars/{{ ansible_os_family }}.yml"
+          skip: true
+      tags: deps
+
+    - name: Collate dependencies
+      set_fact:
+        package_deps: "{{ buildbot_deps + fetch_deps + conf_deps + build_deps + link_deps + dist_deps }}"
+        python_modules: "{{ buildbot_modules + rpc_test_modules }}"
+      tags: deps
+
+    - name: Install Homebrew [MacOSX]
+      include: tasks/install-brew.yml
+      when: ansible_distribution == 'MacOSX'
+      tags: deps
+
+    - name: Update rolling release [Arch Linux]
+      pacman:
+        update_cache: yes
+        upgrade: yes
+      when: ansible_distribution == 'Archlinux'
+      tags: deps
+
+    - name: Install required packages
+      package:
+        name: "{{ item }}"
+        state: present
+      with_items: "{{ package_deps }}"
+      become_user: "{{ ansible_ssh_user if ansible_distribution == 'MacOSX' else 'root' }}"
+      tags: deps
+
+    - name: Install pip [CentOS, MacOSX]
+      include: tasks/install-pip.yml
+      when: ansible_distribution in ['CentOS', 'MacOSX']
+
+    - name: Install required Python system modules
+      pip:
+        name: "{{ item }}"
+        state: latest
+        executable: "{{ '/usr/local/bin/pip' if ansible_distribution == 'MacOSX' else omit }}"
+      with_items: "{{ system_modules }}"
+
+    - name: Set up the Buildbot worker user
+      user:
+        name: "{{ buildbot_worker_user }}"
+        comment: Buildbot worker
+        shell: /bin/bash
+        state: present
+
+    - name: Get absolute path to Buildbot worker home directory
+      command: echo ~
+      register: homedir
+      become_user: "{{ buildbot_worker_user }}"
+
+    - name: Save absolute path to Buildbot worker home directory
+      set_fact:
+        buildbot_worker_dir: "{{ homedir.stdout }}"
+
+    - name: Install required Python modules
+      pip:
+        name: "{{ item }}"
+        state: latest
+        virtualenv: "~{{ buildbot_worker_user }}/venv"
+        virtualenv_command: "{{ '/usr/local/bin/virtualenv' if ansible_distribution == 'MacOSX' else omit }}"
+      with_items: "{{ python_modules }}"
+      become_user: "{{ buildbot_worker_user }}"
+      notify: restart buildbot-worker
+
+    - name: Create Buildbot worker
+      command: >
+        ~{{ buildbot_worker_user }}/venv/bin/buildbot-worker create-worker ~/{{ buildbot_worker_name }}
+        {{ buildbot_master_host }}:{{ buildbot_master_port }}
+        {{ buildbot_worker_name|quote }} {{ buildbot_worker_password|quote }}
+      args:
+        creates: "~/{{ buildbot_worker_name }}/buildbot.tac"
+      become_user: "{{ buildbot_worker_user }}"
+
+    - name: Set admin details for Buildbot worker
+      copy:
+        content: "{{ buildbot_worker_admin }}"
+        dest: "~{{ buildbot_worker_user }}/{{ buildbot_worker_name }}/info/admin"
+        owner: "{{ buildbot_worker_user }}"
+        group: "{{ omit if ansible_distribution == 'MacOSX' else buildbot_worker_user }}"
+        mode: "0644"
+
+    - name: Set host details for Buildbot worker
+      template:
+        src: "{{ buildbot_worker_host_template }}"
+        dest: "~{{ buildbot_worker_user }}/{{ buildbot_worker_name }}/info/host"
+        owner: "{{ buildbot_worker_user }}"
+        group: "{{ omit if ansible_distribution == 'MacOSX' else buildbot_worker_user }}"
+        mode: "0644"
+
+    - name: Install custom bashrc for virtualenv
+      copy:
+        src: bashrc
+        dest: "~{{ buildbot_worker_user }}/.bashrc"
+        owner: "{{ buildbot_worker_user }}"
+        group: "{{ omit if ansible_distribution == 'MacOSX' else buildbot_worker_user }}"
+        mode: "0644"
+
+    - name: Copy Buildbot worker systemd service unit
+      template:
+        src: templates/buildbot-worker.service.j2
+        dest: "/etc/systemd/system/buildbot-worker.service"
+        owner: root
+        group: root
+        mode: "0644"
+      when: ansible_distribution != 'MacOSX'
+      notify: reload systemd
+
+    - name: Copy Buildbot worker launchd service unit
+      template:
+        src: templates/buildbot-worker.plist.j2
+        dest: "/Library/LaunchDaemons/net.buildbot.worker.plist"
+        owner: root
+        group: wheel
+        mode: "0644"
+      when: ansible_distribution == 'MacOSX'
+
+    - name: Start Buildbot worker
+      service:
+        name: buildbot-worker
+        state: started
+        enabled: yes
+      when: ansible_distribution != 'MacOSX'
+
+    - name: Load Buildbot worker service [MacOSX]
+      command: launchctl load /Library/LaunchDaemons/net.buildbot.worker.plist
+      when: ansible_distribution == 'MacOSX'
+
+    - name: Start Buildbot worker [MacOSX]
+      command: launchctl start net.buildbot.worker
+      when: ansible_distribution == 'MacOSX'
+
+  handlers:
+    - name: restart buildbot-worker
+      service:
+        name: buildbot-worker
+        state: restarted
+
+    - name: reload systemd
+      command: /bin/systemctl daemon-reload
diff --git a/depend/zcash/contrib/ci-workers/vars/Archlinux.yml b/depend/zcash/contrib/ci-workers/vars/Archlinux.yml
new file mode 100644
index 000000000..50e5577c3
--- /dev/null
+++ b/depend/zcash/contrib/ci-workers/vars/Archlinux.yml
@@ -0,0 +1,7 @@
+---
+buildbot_deps:
+  - python2-pip
+build_deps:
+  - cmake
+  - multilib/gcc
+  - make
diff --git a/depend/zcash/contrib/ci-workers/vars/CentOS.yml b/depend/zcash/contrib/ci-workers/vars/CentOS.yml
new file mode 100644
index 000000000..f577af5c0
--- /dev/null
+++ b/depend/zcash/contrib/ci-workers/vars/CentOS.yml
@@ -0,0 +1,13 @@
+---
+buildbot_deps: [] # Empty to remove python-pip
+build_deps:
+  - bzip2
+  - cmake
+  - gcc
+  - gcc-c++
+  - make
+  - patch
+dist_deps:
+  - pkgconfig # Required until b556beda264308e040f8d88aca4f2f386a0183d9 is pulled in
+  - python-devel
+  - redhat-rpm-config
diff --git a/depend/zcash/contrib/ci-workers/vars/Debian.yml b/depend/zcash/contrib/ci-workers/vars/Debian.yml
new file mode 100644
index 000000000..b6a46f0cd
--- /dev/null
+++ b/depend/zcash/contrib/ci-workers/vars/Debian.yml
@@ -0,0 +1,6 @@
+---
+build_deps:
+  - build-essential # Depends on g++, libc6-dev, make
+  - cmake
+dist_deps:
+  - python-dev
diff --git a/depend/zcash/contrib/ci-workers/vars/Fedora.yml b/depend/zcash/contrib/ci-workers/vars/Fedora.yml
new file mode 100644
index 000000000..2a7351c69
--- /dev/null
+++ b/depend/zcash/contrib/ci-workers/vars/Fedora.yml
@@ -0,0 +1,11 @@
+---
+build_deps:
+  - cmake
+  - gcc
+  - gcc-c++
+  - make
+  - patch
+dist_deps:
+  - pkgconfig # Required until b556beda264308e040f8d88aca4f2f386a0183d9 is pulled in
+  - python-devel
+  - redhat-rpm-config
diff --git a/depend/zcash/contrib/ci-workers/vars/FreeBSD.yml b/depend/zcash/contrib/ci-workers/vars/FreeBSD.yml
new file mode 100644
index 000000000..4b1f01997
--- /dev/null
+++ b/depend/zcash/contrib/ci-workers/vars/FreeBSD.yml
@@ -0,0 +1,10 @@
+---
+buildbot_deps:
+  - py27-pip
+build_deps:
+  - cmake
+  - gcc
+  - gmake
+dist_deps:
+  - bash
+  - pkgconf # Required until b556beda264308e040f8d88aca4f2f386a0183d9 is pulled in
diff --git a/depend/zcash/contrib/ci-workers/vars/MacOSX.yml b/depend/zcash/contrib/ci-workers/vars/MacOSX.yml
new file mode 100644
index 000000000..80b1ae608
--- /dev/null
+++ b/depend/zcash/contrib/ci-workers/vars/MacOSX.yml
@@ -0,0 +1,6 @@
+---
+buildbot_deps:
+  - coreutils # For gnproc etc.
+# Most are already installed
+build_deps:
+  - cmake
diff --git a/depend/zcash/contrib/ci-workers/vars/Ubuntu.yml b/depend/zcash/contrib/ci-workers/vars/Ubuntu.yml
new file mode 100644
index 000000000..0d0f584b4
--- /dev/null
+++ b/depend/zcash/contrib/ci-workers/vars/Ubuntu.yml
@@ -0,0 +1,4 @@
+---
+build_deps:
+  - build-essential # Depends on g++, libc6-dev, make
+  - cmake
diff --git a/depend/zcash/contrib/ci-workers/vars/buildbot.yml b/depend/zcash/contrib/ci-workers/vars/buildbot.yml
new file mode 100644
index 000000000..38e3fd25a
--- /dev/null
+++ b/depend/zcash/contrib/ci-workers/vars/buildbot.yml
@@ -0,0 +1,5 @@
+---
+buildbot_worker_user: zcbbworker
+buildbot_master_host: dev-ci.z.cash
+buildbot_master_port: 9899
+buildbot_worker_host_template: templates/host.j2
diff --git a/depend/zcash/contrib/ci-workers/vars/default.yml b/depend/zcash/contrib/ci-workers/vars/default.yml
new file mode 100644
index 000000000..a0b0da9e6
--- /dev/null
+++ b/depend/zcash/contrib/ci-workers/vars/default.yml
@@ -0,0 +1,53 @@
+---
+# These variables can be overridden in distribution files.
+
+# Dependencies required to install Buildbot
+buildbot_deps:
+  - python-pip # So we can install Python modules
+
+# Dependencies required to download files
+fetch_deps:
+  - curl # For depends/
+  - git
+  - wget # For zcutil/fetch-params.sh
+
+# Dependencies required to configure Zcash
+conf_deps:
+  - autoconf
+  - automake
+  - m4
+  - pkg-config
+
+# Dependencies required to compile Zcash
+build_deps:
+  - cmake
+  - g++
+  - gcc
+  - make
+
+# Dependencies required to link Zcash
+link_deps:
+  - libtool
+
+# Additional distribution-specific dependencies
+dist_deps: []
+
+# Additional grind-specific dependencies
+grind_deps:
+  - lcov
+  - valgrind
+
+# Python modules required on the system
+system_modules:
+  - virtualenv
+
+# Python modules required for a Zcash Buildbot worker
+buildbot_modules:
+  - pip # Needs to be updated first so Buildbot installs
+  - buildbot-worker
+  - pyflakes
+
+# Python modules required to run the Zcash RPC test suite
+rpc_test_modules:
+  - pyblake2
+  - pyzmq
diff --git a/depend/zcash/contrib/debian/changelog b/depend/zcash/contrib/debian/changelog
new file mode 100644
index 000000000..00834e186
--- /dev/null
+++ b/depend/zcash/contrib/debian/changelog
@@ -0,0 +1,593 @@
+zcash (5.0.0) stable; urgency=medium
+
+  * 5.0.0 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Tue, 10 May 2022 19:52:28 -0600
+
+zcash (5.0.0~rc1) stable; urgency=medium
+
+  * 5.0.0-rc1 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Mon, 09 May 2022 15:35:33 +0000
+
+zcash (4.7.0) stable; urgency=medium
+
+  * 4.7.0 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Wed, 13 Apr 2022 22:04:00 -0600
+
+zcash (4.6.0+2) stable; urgency=medium
+
+  * 4.6.0-2 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Mon, 04 Apr 2022 21:53:34 +0000
+
+zcash (4.7.0~rc1) stable; urgency=medium
+
+  * 4.7.0-rc1 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Tue, 22 Mar 2022 21:14:02 +0000
+
+zcash (4.6.0+1) stable; urgency=medium
+
+  * 4.6.0-1 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Wed, 05 Jan 2022 20:18:43 +0000
+
+zcash (4.6.0) stable; urgency=medium
+
+  * 4.6.0 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Thu, 23 Dec 2021 00:35:41 +0000
+
+zcash (4.6.0~rc1) stable; urgency=medium
+
+  * 4.6.0-rc1 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Sat, 18 Dec 2021 04:25:50 +0000
+
+zcash (4.5.1+1) stable; urgency=medium
+
+  * 4.5.1-1 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Fri, 08 Oct 2021 17:03:31 +0000
+
+zcash (4.5.1) stable; urgency=medium
+
+  * 4.5.1 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Wed, 29 Sep 2021 01:49:51 +0100
+
+zcash (4.5.0) stable; urgency=medium
+
+  * 4.5.0 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Thu, 23 Sep 2021 04:20:16 +0100
+
+zcash (4.5.0~rc1) stable; urgency=medium
+
+  * 4.5.0-rc1 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Thu, 16 Sep 2021 23:34:14 +0100
+
+zcash (4.4.1) stable; urgency=medium
+
+  * 4.4.1 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Wed, 09 Jun 2021 23:19:49 +0100
+
+zcash (4.4.1~rc1) stable; urgency=medium
+
+  * 4.4.1-rc1 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Tue, 08 Jun 2021 22:45:20 +0100
+
+zcash (4.4.0) stable; urgency=medium
+
+  * 4.4.0 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Thu, 15 Apr 2021 16:55:39 +1200
+
+zcash (4.4.0~rc1) stable; urgency=medium
+
+  * 4.4.0-rc1 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Fri, 09 Apr 2021 17:40:36 +1200
+
+zcash (4.3.0) stable; urgency=medium
+
+  * 4.3.0 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Wed, 24 Feb 2021 20:17:10 +0000
+
+zcash (4.3.0~rc1) stable; urgency=medium
+
+  * 4.3.0-rc1 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Fri, 19 Feb 2021 22:05:06 +0000
+
+zcash (4.2.0) stable; urgency=medium
+
+  * 4.2.0 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Mon, 21 Dec 2020 12:55:52 -0700
+
+zcash (4.2.0~rc1) stable; urgency=medium
+
+  * 4.2.0-rc1 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Sat, 19 Dec 2020 09:53:28 -0700
+
+zcash (4.1.1) stable; urgency=medium
+
+  * 4.1.1 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Mon, 16 Nov 2020 10:23:40 -0700
+
+zcash (4.1.0) stable; urgency=medium
+
+  * 4.1.0 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Mon, 02 Nov 2020 13:40:54 -0700
+
+zcash (4.1.0~rc1) stable; urgency=medium
+
+  * 4.1.0-rc1 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Wed, 28 Oct 2020 02:51:45 +0800
+
+zcash (4.0.0) stable; urgency=medium
+
+  * 4.0.0 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Tue, 01 Sep 2020 13:31:19 -0600
+
+zcash (4.0.0~rc1) stable; urgency=medium
+
+  * 4.0.0-rc1 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Wed, 26 Aug 2020 10:17:07 -0600
+
+zcash (3.1.0) stable; urgency=medium
+
+  * 3.1.0 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Tue, 28 Jul 2020 07:02:06 +0800
+
+zcash (3.1.0~rc2) stable; urgency=medium
+
+  * 3.1.0-rc2 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Wed, 15 Jul 2020 21:51:09 +0800
+
+zcash (3.1.0~rc1) stable; urgency=medium
+
+  * 3.1.0-rc1 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Tue, 14 Jul 2020 14:38:11 +0800
+
+zcash (3.0.0) stable; urgency=medium
+
+  * 3.0.0 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Fri, 22 May 2020 11:48:24 -0600
+
+zcash (3.0.0~rc1) stable; urgency=medium
+
+  * 3.0.0-rc1 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Thu, 21 May 2020 07:34:53 -0600
+
+zcash (2.1.2+3) stable; urgency=medium
+
+  * 2.1.2-3 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Fri, 08 May 2020 12:41:23 -0600
+
+zcash (2.1.2+2) stable; urgency=medium
+
+  * 2.1.2-2 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Fri, 08 May 2020 11:43:55 -0600
+
+zcash (2.1.2+1) stable; urgency=medium
+
+  * 2.1.2-1 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Wed, 06 May 2020 10:52:57 -0600
+
+zcash (2.1.2) stable; urgency=medium
+
+  * 2.1.2 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Wed, 22 Apr 2020 10:46:06 -0600
+
+zcash (2.1.2~rc1) stable; urgency=medium
+
+  * 2.1.2-rc1 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Wed, 15 Apr 2020 17:47:45 -0600
+
+zcash (2.1.1+1) stable; urgency=critical
+
+  * 2.1.1-1 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Thu, 06 Feb 2020 16:53:19 -0700
+
+zcash (2.1.1) stable; urgency=medium
+
+  * 2.1.1 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Fri, 17 Jan 2020 10:27:31 -0700
+
+zcash (2.1.1~rc2) stable; urgency=medium
+
+  * 2.1.1-rc2 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Mon, 13 Jan 2020 17:56:29 -0700
+
+zcash (2.1.1~rc1) stable; urgency=medium
+
+  * 2.1.1-rc1 release.
+
+ -- Electric Coin Company <team@electriccoin.co>  Tue, 07 Jan 2020 20:13:52 -0700
+
+zcash (2.1.0+1) stable; urgency=medium
+
+  * 2.1.0-1 release.
+
+ -- Electric Coin Company <team@z.cash>  Fri, 08 Nov 2019 18:56:32 +0000
+
+zcash (2.1.0) stable; urgency=medium
+
+  * 2.1.0 release.
+
+ -- Electric Coin Company <team@z.cash>  Sat, 02 Nov 2019 11:01:00 -0600
+
+zcash (2.1.0~rc1) stable; urgency=medium
+
+  * 2.1.0-rc1 release.
+
+ -- Electric Coin Company <team@z.cash>  Tue, 22 Oct 2019 14:52:02 -0600
+
+zcash (2.0.7+3) stable; urgency=critical
+
+  * 2.0.7-3 release.
+
+ -- Electric Coin Company <team@z.cash>  Tue, 24 Sep 2019 21:01:13 +0100
+
+zcash (2.0.7+2) stable; urgency=medium
+
+  * 2.0.7-2 release.
+
+ -- Electric Coin Company <team@z.cash>  Fri, 30 Aug 2019 17:47:52 -0600
+
+zcash (2.0.7+1) stable; urgency=medium
+
+  * 2.0.7-1 release.
+
+ -- Electric Coin Company <team@z.cash>  Thu, 29 Aug 2019 13:07:52 -0600
+
+zcash (2.0.7) stable; urgency=medium
+
+  * 2.0.7 release.
+
+ -- Electric Coin Company <team@z.cash>  Mon, 19 Aug 2019 15:09:14 -0600
+
+zcash (2.0.7~rc1) stable; urgency=medium
+
+  * 2.0.7-rc1 release.
+
+ -- Electric Coin Company <team@z.cash>  Fri, 09 Aug 2019 17:05:51 -0600
+
+zcash (2.0.6) stable; urgency=medium
+
+  * 2.0.6 release.
+
+ -- Electric Coin Company <team@z.cash>  Wed, 19 Jun 2019 00:28:06 +0100
+
+zcash (2.0.6~rc1) stable; urgency=medium
+
+  * 2.0.6-rc1 release.
+
+ -- Electric Coin Company <team@z.cash>  Wed, 12 Jun 2019 16:36:57 +0100
+
+zcash (2.0.5+2) stable; urgency=medium
+
+  * 2.0.5-2 release.
+
+ -- Electric Coin Company <team@z.cash>  Wed, 15 May 2019 09:56:01 -0600
+
+zcash (2.0.5+1) stable; urgency=medium
+
+  * 2.0.5-1 release.
+
+ -- Electric Coin Company <team@z.cash>  Wed, 08 May 2019 06:57:28 -0600
+
+zcash (2.0.5) stable; urgency=medium
+
+  * 2.0.5 release.
+
+ -- Electric Coin Company <team@z.cash>  Fri, 03 May 2019 16:35:30 -0600
+
+zcash (2.0.5~rc1) stable; urgency=medium
+
+  * 2.0.5-rc1 release.
+
+ -- Electric Coin Company <team@z.cash>  Wed, 01 May 2019 14:16:08 -0600
+
+zcash (2.0.4) stable; urgency=medium
+
+  * 2.0.4 release.
+
+ -- Electric Coin Company <team@z.cash>  Tue, 26 Mar 2019 11:29:21 -0700
+
+zcash (2.0.4~rc1) stable; urgency=medium
+
+  * 2.0.4-rc1 release.
+
+ -- Zcash Company <team@z.cash>  Wed, 20 Mar 2019 09:39:43 -0700
+
+zcash (2.0.3) stable; urgency=medium
+
+  * 2.0.3 release.
+
+ -- Zcash Company <team@z.cash>  Mon, 11 Feb 2019 09:16:09 -0800
+
+zcash (2.0.3~rc1) stable; urgency=medium
+
+  * 2.0.3-rc1 release.
+
+ -- Zcash Company <team@z.cash>  Mon, 04 Feb 2019 12:05:43 -0800
+
+zcash (2.0.2) stable; urgency=medium
+
+  * 2.0.2 release.
+
+ -- Zcash Company <team@z.cash>  Wed, 28 Nov 2018 11:09:08 -0800
+
+zcash (2.0.2~rc1) stable; urgency=medium
+
+  * 2.0.2-rc1 release.
+
+ -- Zcash Company <team@z.cash>  Sun, 18 Nov 2018 10:19:49 -0800
+
+zcash (2.0.1) stable; urgency=medium
+
+  * 2.0.1 release.
+
+ -- Zcash Company <team@z.cash>  Sun, 14 Oct 2018 13:40:30 -0700
+
+zcash (2.0.1~rc1) stable; urgency=medium
+
+  * 2.0.1-rc1 release.
+
+ -- Zcash Company <team@z.cash>  Mon, 08 Oct 2018 12:40:54 -0700
+
+zcash (2.0.0) stable; urgency=medium
+
+  * 2.0.0 release.
+
+ -- Zcash Company <team@z.cash>  Wed, 15 Aug 2018 17:57:50 -0700
+
+zcash (2.0.0~rc1) stable; urgency=medium
+
+  * 2.0.0-rc1 release.
+
+ -- Zcash Company <team@z.cash>  Thu, 09 Aug 2018 16:56:56 +0000
+
+zcash (1.1.2) stable; urgency=medium
+
+  * 1.1.2 release.
+
+ -- Zcash Company <team@z.cash>  Sun, 01 Jul 2018 20:12:33 -0700
+
+zcash (1.1.2~rc1) stable; urgency=medium
+
+  * 1.1.2-rc1 release.
+
+ -- Zcash Company <team@z.cash>  Fri, 22 Jun 2018 17:03:41 -0700
+
+zcash (1.1.1) stable; urgency=medium
+
+  * 1.1.1 release.
+
+ -- Zcash Company <team@z.cash>  Fri, 25 May 2018 15:49:34 +1200
+
+zcash (1.1.1~rc2) stable; urgency=medium
+
+  * 1.1.1-rc2 release.
+
+ -- Zcash Company <team@z.cash>  Wed, 23 May 2018 09:28:50 -0700
+
+zcash (1.1.1~rc1) stable; urgency=medium
+
+  * 1.1.1-rc1 release.
+
+ -- Zcash Company <team@z.cash>  Sat, 19 May 2018 10:16:14 +1200
+
+zcash (1.1.0) stable; urgency=medium
+
+  * 1.1.0 release.
+
+ -- Zcash Company <team@z.cash>  Wed, 11 Apr 2018 20:15:29 -0600
+
+zcash (1.1.0~rc1) stable; urgency=medium
+
+  * 1.1.0-rc1 release.
+
+ -- Zcash Company <team@z.cash>  Thu, 05 Apr 2018 03:26:17 +0100
+
+zcash (1.0.15) stable; urgency=medium
+
+  * 1.0.15 release.
+
+ -- Zcash Company <team@z.cash>  Wed, 28 Feb 2018 16:58:19 +0000
+
+zcash (1.0.15~rc1) stable; urgency=medium
+
+  * 1.0.15-rc1 release.
+
+ -- Zcash Company <team@z.cash>  Sat, 24 Feb 2018 04:20:05 +0000
+
+zcash (1.0.14) stable; urgency=medium
+
+  * 1.0.14 release.
+
+ -- Zcash Company <team@z.cash>  Wed, 03 Jan 2018 23:54:16 +0100
+
+zcash (1.0.14~rc1) stable; urgency=medium
+
+  * 1.0.14-rc1 release.
+
+ -- Zcash Company <team@z.cash>  Fri, 22 Dec 2017 10:12:41 +0000
+
+zcash (1.0.13) stable; urgency=medium
+
+  * 1.0.13 release.
+
+ -- Zcash Company <team@z.cash>  Mon, 20 Nov 2017 12:31:53 +0000
+
+zcash (1.0.13~rc2) stable; urgency=medium
+
+  * 1.0.13-rc2 release.
+
+ -- Zcash Company <team@z.cash>  Fri, 17 Nov 2017 18:01:08 +0000
+
+zcash (1.0.13~rc1) stable; urgency=medium
+
+  * 1.0.13-rc1 release.
+
+ -- Zcash Company <team@z.cash>  Wed, 15 Nov 2017 00:02:21 +0000
+
+zcash (1.0.12) stable; urgency=medium
+
+  * 1.0.12 release.
+
+ -- Zcash Company <team@z.cash>  Thu, 28 Sep 2017 01:26:44 +0100
+
+zcash (1.0.12~rc1) stable; urgency=medium
+
+  * 1.0.12-rc1 release.
+
+ -- Zcash Company <team@z.cash>  Sat, 23 Sep 2017 10:51:36 +0100
+
+zcash (1.0.11) stable; urgency=medium
+
+  * 1.0.11 release.
+
+ -- Zcash Company <team@z.cash>  Tue, 15 Aug 2017 10:06:25 +0100
+
+zcash (1.0.11~rc1) stable; urgency=medium
+
+  * 1.0.11-rc1 release.
+
+ -- Zcash Company <team@z.cash>  Tue, 01 Aug 2017 17:12:52 +0200
+
+zcash (1.0.10+1) stable; urgency=medium
+
+  * 1.0.10-1 release.
+
+ -- Zcash Company <team@z.cash>  Fri, 23 Jun 2017 19:50:41 -0700
+
+zcash (1.0.10) stable; urgency=medium
+
+  * 1.0.10 release.
+
+ -- Zcash Company <team@z.cash>  Thu, 22 Jun 2017 15:13:04 +1200
+
+zcash (1.0.9) stable; urgency=medium
+
+  * 1.0.9 release.
+
+ -- Zcash Company <team@z.cash>  Wed, 24 May 2017 12:51:06 -0700
+
+zcash (1.0.8+1) jessie; urgency=high
+
+  * 1.0.8-1 release.
+
+ -- Zcash Company <team@z.cash>  Thu, 13 Apr 2017 20:20:37 -0700
+
+zcash (1.0.8) jessie; urgency=medium
+
+  * 1.0.8 release.
+
+ -- Zcash Company <team@z.cash>  Mon, 27 Mar 2017 21:30:07 +0100
+
+zcash (1.0.7+1) jessie; urgency=medium
+
+  * 1.0.7-1 release.
+
+ -- Zcash Company <team@z.cash>  Wed, 08 Mar 2017 13:51:11 -0800
+
+zcash (1.0.7) jessie; urgency=medium
+
+  * 1.0.7 release.
+
+ -- Zcash Company <team@z.cash>  Fri, 03 Mar 2017 20:55:04 -0800
+
+zcash (1.0.6) jessie; urgency=medium
+
+  * 1.0.6 release.
+
+ -- Zcash Company <team@z.cash>  Fri, 10 Feb 2017 10:23:00 -0800
+
+zcash (1.0.5) jessie; urgency=medium
+
+  * 1.0.5 release.
+
+ -- Zcash Company <team@z.cash>  Thu, 19 Jan 2017 19:23:40 -0700
+
+zcash (1.0.4) jessie; urgency=medium
+
+  * 1.0.4 release.
+
+ -- Zcash Company <team@z.cash>  Thu, 15 Dec 2016 16:46:14 +1300
+
+zcash (1.0.3) jessie; urgency=medium
+
+  * 1.0.3 release.
+
+ -- Zcash Company <team@z.cash>  Wed, 17 Nov 2016 15:56:00 -0700
+
+zcash (1.0.2) jessie; urgency=medium
+
+  * 1.0.2 release.
+
+ -- Zcash Company <team@z.cash>  Mon, 07 Nov 2016 19:01:35 -0600
+
+zcash (1.0.1) jessie; urgency=medium
+
+  * 1.0.1 release.
+
+ -- Zcash Company <team@z.cash>  Thu, 03 Nov 2016 23:21:09 -0500
+
+zcash (1.0.0-sprout) jessie; urgency=medium
+
+  * 1.0.0 release.
+
+ -- Zcash Company <team@z.cash>  Fri, 28 Oct 2016 03:00:50 -0700
+
+zcash (1.0.0-rc4) jessie; urgency=medium
+
+  * 1.0.0-rc4 release.
+
+ -- Zcash Company <team@z.cash>  Thu, 27 Oct 2016 13:36:00 +0100
+
+zcash (1.0.0-rc3) jessie; urgency=medium
+
+  * 1.0.0-rc3 release.
+
+ -- Zcash Company <team@z.cash>  Wed, 26 Oct 2016 23:17:03 +0100
+
+zcash (1.0.0-rc2) jessie; urgency=medium
+
+  * 1.0.0-rc2 release.
+
+ -- Zcash Company <team@z.cash>  Sun, 23 Oct 2016 01:51:27 +0100
+
+zcash (1.0.0-rc1) jessie; urgency=medium
+
+  * Initial packaging for Debian.
+
+ -- Zcash Company <team@z.cash>  Mon, 17 Oct 2016 11:47:02 -0700
diff --git a/depend/zcash/contrib/debian/compat b/depend/zcash/contrib/debian/compat
new file mode 100644
index 000000000..ec635144f
--- /dev/null
+++ b/depend/zcash/contrib/debian/compat
@@ -0,0 +1 @@
+9
diff --git a/depend/zcash/contrib/debian/control b/depend/zcash/contrib/debian/control
new file mode 100644
index 000000000..31f40c2c8
--- /dev/null
+++ b/depend/zcash/contrib/debian/control
@@ -0,0 +1,22 @@
+Source: zcash
+Section: utils
+Priority: optional
+Maintainer: Electric Coin Company <team@electriccoin.co>
+Homepage: https://z.cash
+Build-Depends: autoconf, automake, bsdmainutils, build-essential,
+ git, g++-multilib, libc6-dev, libtool,
+ m4, ncurses-dev, pkg-config, python,
+ unzip, wget, zlib1g-dev
+Vcs-Git: https://github.com/zcash/zcash.git
+Vcs-Browser: https://github.com/zcash/zcash
+
+Package: zcash
+Architecture: amd64
+Depends: ${shlibs:Depends}
+Description: Zcash libraries and tools
+ Based on Bitcoin's code, it intends to offer a far higher standard
+ of privacy and anonymity through a sophisticiated zero-knowledge
+ proving scheme which preserves confidentiality of transaction metadata.
+ Think of it as HTTPS for money.
+ This package provides the daemon, zcashd, and the CLI tool,
+ zcash-cli, to interact with the daemon.
diff --git a/depend/zcash/contrib/debian/copyright b/depend/zcash/contrib/debian/copyright
new file mode 100644
index 000000000..79105d8af
--- /dev/null
+++ b/depend/zcash/contrib/debian/copyright
@@ -0,0 +1,1891 @@
+Format: http://svn.debian.org/wsvn/dep/web/deps/dep5.mdwn?rev=174
+Upstream-Name: Zcash
+Upstream-Contact: Electric Coin Company <team@electriccoin.co>
+Source: https://github.com/zcash/zcash
+
+Files: *
+Copyright: 2016-2022, The Zcash developers
+ 2009-2022, Bitcoin Core developers
+ 2009-2022, Bitcoin Developers
+License: Expat
+Comment: The Bitcoin Core developers encompasses the current developers listed on
+ bitcoin.org, as well as the numerous contributors to the project.
+ The Zcash developers are listed at https://z.cash/team.html and in doc/authors.md.
+ This copyright entry excludes files explicitly listed below.
+ We do not explicitly list Rust crates that have Expat/MIT as a licensing option
+ (as determined by "cargo license").
+
+Files: build-aux/m4/ax_boost_base.m4
+Copyright: 2008, Thomas Porschberg <thomas@randspringer.de>
+ 2009, Peter Adolphs
+License: GNU-All-permissive-License
+
+Files: build-aux/m4/ax_boost_chrono.m4
+Copyright: 2012, Xiyue Deng <manphiz@gmail.com>
+License: GNU-All-permissive-License
+
+Files: build-aux/m4/ax_boost_filesystem.m4
+Copyright: 2009, Thomas Porschberg <thomas@randspringer.de>
+ 2009, Michael Tindal
+ 2009, Roman Rybalko <libtorrent@romanr.info>
+License: GNU-All-permissive-License
+
+Files: build-aux/m4/ax_boost_program_options.m4
+Copyright: 2009, Thomas Porschberg <thomas@randspringer.de>
+License: GNU-All-permissive-License
+
+Files: build-aux/m4/ax_boost_system.m4
+Copyright: 2008, Thomas Porschberg <thomas@randspringer.de>
+ 2008, Michael Tindal
+ 2008, Daniel Casimiro <dan.casimiro@gmail.com>
+License: GNU-All-permissive-License
+
+Files: build-aux/m4/ax_boost_thread.m4
+Copyright: 2009, Thomas Porschberg <thomas@randspringer.de>
+ 2009, Michael Tindal
+License: GNU-All-permissive-License
+
+Files: build-aux/m4/ax_boost_unit_test_framework.m4
+Copyright: 2008, Thomas Porschberg <thomas@randspringer.de>
+License: GNU-All-permissive-License
+
+Files: build-aux/m4/ax_cxx_compile_stdcxx.m4
+Copyright: 2008, Benjamin Kosnik <bkoz@redhat.com>
+ 2012, Zack Weinberg <zackw@panix.com>
+ 2013, Roy Stogner <roystgnr@ices.utexas.edu>
+ 2014-2015, Google Inc.; contributed by Alexey Sokolov <sokolov@google.com>
+ 2015, Paul Norman <penorman@mac.com>
+ 2015, Moritz Klammler <moritz@klammler.eu>
+ 2016, 2018 Krzesimir Nowak <qdlacz@gmail.com>
+ 2019 Enji Cooper <yaneurabeya@gmail.com>
+License: GNU-All-permissive-License
+
+Files: build-aux/m4/ax_gcc_func_attribute.m4
+Copyright: 2013, Gabriele Svelto <gabriele.svelto@gmail.com>
+License: GNU-All-permissive-License
+
+Files: build-aux/m4/l_atomic.m4
+Copyright: 2015, Tim Kosse <tim.kosse@filezilla-project.org>
+License: GNU-All-permissive-License
+
+Files: build-aux/m4/ax_check_compile_flag.m4
+ build-aux/m4/ax_check_link_flag.m4
+ build-aux/m4/ax_check_preproc_flag.m4
+Copyright: 2008, Guido U. Draheim <guidod@gmx.de>
+ 2011, Maarten Bosmans <mkbosmans@gmail.com>
+License: GPL-3+ with Autoconf exception
+
+Files: build-aux/m4/ax_pthread.m4
+Copyright: 2008, Steven G. Johnson <stevenj@alum.mit.edu>
+ 2011, Daniel Richard G. <skunk@iSKUNK.ORG>
+License: GPL-3+ with Autoconf exception
+
+Files: build-aux/m4/libtool.m4
+Copyright: 1996-2001, 2003-2015 Free Software Foundation, Inc.
+ Written by Gordon Matzigkeit, 1996
+License: GNU-All-permissive-License or GPL-2+ with Libtool exception
+
+Files: build-aux/m4/lt~obsolete.m4
+Copyright: 2004-2005, 2007, 2009, 2011-2015 Free Software Foundation, Inc.
+ Written by Scott James Remnant, 2004.
+License: GNU-All-permissive-License
+
+Files: build-aux/m4/ltoptions.m4
+ build-aux/m4/ltsugar.m4
+Copyright: 2004-2005, 2007-2009, 2011-2015 Free Software Foundation, Inc.
+ Written by Gary V. Vaughan, 2004
+License: GNU-All-permissive-License
+
+Files: build-aux/m4/ltversion.m4
+Copyright: 2004, 2011-2015 Free Software Foundation, Inc.
+ Written by Scott James Remnant, 2004
+License: GNU-All-permissive-License
+
+Files: qa/zcash/checksec.sh
+Copyright: 2014-2015, Brian Davis
+ 2013, Robin David
+ 2009-2011, Tobias Klein
+License: BSD-3-clause-Tobias-Klein
+
+Files: depends/sources/libsodium-*.tar.gz
+Copyright: 2013-2022 Frank Denis
+License: ISC
+
+Files: depends/sources/boost_*.tar.gz
+Copyright: 2008 Beman Dawes
+License: Boost-Software-License-1.0
+
+Files: depends/sources/clang-llvm-*.tar.xz
+Copyright: The libc++ Authors
+License: Apache-2 with LLVM exception
+Comment: This entry is specifically for the libc++ library. The libc++ Authors
+ are listed in https://github.com/llvm/llvm-project/blob/main/libcxx/CREDITS.TXT .
+
+Files: depends/sources/db-*.tar.gz
+Copyright: 1990, 2016 Oracle and/or its affiliates;
+ 1990, 1993, 1994, 1995 The Regents of the University of California;
+ 1995, 1996 The President and Fellows of Harvard University;
+ 2000-2005 INRIA, France Telecom
+License: BDB
+
+Files: depends/sources/libevent-*.tar.gz
+Copyright: 2000-2007 Niels Provos <provos@citi.umich.edu>
+ 2007-2012 Niels Provos and Nick Mathewson
+ 2000 Dug Song <dugsong@monkey.org>
+ 1993 The Regents of the University of California.
+ 1998 Todd C. Miller <Todd.Miller@courtesan.com>
+ 2003 Michael A. Davis <mike@datanerds.net>
+ 2007 Sun Microsystems
+ 2002 Christopher Clark
+ 2006 Maxim Yegorushkin <maxim.yegorushkin@gmail.com>
+License: BSD-3-clause
+
+Files: depends/sources/zeromq-*.tar.gz
+Copyright: 1994, 1995, 1996, 1999, 2000, 2001, 2002, 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
+ 2007-2014 iMatix Corporation
+ 2009-2011 250bpm s.r.o.
+ 2010-2011 Miru Limited
+ 2011 VMware, Inc.
+ 2012 Spotify AB
+ 2013 Ericsson AB
+ 2014 AppDynamics Inc.
+ 2015-2016 Brocade Communications Systems Inc.
+License: LGPL-3+ with ZeroMQ exception
+
+Files: depends/sources/google*.tar.gz
+Copyright: 2008 Google Inc.
+License: BSD-3-clause-Google
+
+Files: depends/sources/utfcpp-*.tar.gz
+Copyright: 2006 Nemanja Trifunovic
+License: Boost-Software-License-1.0
+
+Files: depends/*/vendored-sources/halo2/*
+ depends/*/vendored-sources/orchard/*
+Copyright: 2020-2022 The Electric Coin Company
+License: BOSL-1+ with Zcash exception
+
+Files: depends/*/vendored-sources/sketches-ddsketch/*
+Copyright: 2019-2020 Mike Heffner <mikeh@fesnel.com>
+License: Apache-2.0
+
+Files: depends/*/vendored-sources/arrayref/*
+Copyright: 2015-2022 David Roundy <roundyd@physics.oregonstate.edu>
+License: BSD-2-clause
+
+Files: depends/*/vendored-sources/mach/*
+Copyright: 2015-2022 Nick Fitzgerald
+License: BSD-2-clause
+
+Files: depends/*/vendored-sources/curve25519-dalek/*
+Copyright: 2016-2021 isis agora lovecruft
+ 2016-2021 Henry de Valence
+ 2012-2017 Adam Langley
+ 2012 The Go Authors
+License: BSD-3-clause and BSD-3-clause-Google
+
+Files: depends/*/vendored-sources/instant/*
+Copyright: 2019 Sébastien Crozet
+License: BSD-3-clause
+
+Files: depends/*/vendored-sources/parity-scale-codec/*
+Copyright: 2018-2022 Parity Technologies
+License: Apache-2.0
+
+Files: depends/*/vendored-sources/parity-scale-codec-derive/*
+Copyright: 2018-2022 Parity Technologies
+License: Apache-2.0
+
+Files: depends/*/vendored-sources/subtle/*
+Copyright: 2016-2017 isis agora lovecruft, Henry de Valence
+License: BSD-3-clause
+
+Files: depends/*/vendored-sources/constant_time_eq/*
+Copyright: 2015-2022 Cesar Eduardo Barros <cesarb@cesarb.eti.br>
+License: CC0-1.0
+
+Files: depends/*/vendored-sources/secp256k1/*
+Copyright: 2014-2022 Dawid Ciężarkiewicz <dpc@ucore.info>, Andrew Poelstra <apoelstra@wpsoftware.net>
+License: CC0-1.0
+
+Files: depends/*/vendored-sources/secp256k1-sys/*
+Copyright: 2014-2022 Dawid Ciężarkiewicz <dpc@ucore.info>, Andrew Poelstra <apoelstra@wpsoftware.net>, Steven Roose <steven@stevenroose.org>
+License: CC0-1.0
+
+Files: depends/*/vendored-sources/untrusted/*
+Copyright: 2015-2016 Brian Smith
+License: ISC
+
+Files: depends/*/vendored-sources/ring/*
+Copyright: 2015-2016 Brian Smith
+ 1998-2011 The OpenSSL Project
+ 1995-1998 Eric Young <eay@cryptsoft.com>
+ 2015 Google Inc.
+ 2015-2016 the fiat-crypto authors
+License: Ring-BoringSSL
+
+Files: depends/*/vendored-sources/terminfo/*
+Copyright: 2016-2020 meh <meh@schizofreni.co>
+License: WTFPL
+
+Files: src/crypto/ctaes/*
+Copyright: 2016 Pieter Wuille
+License: Expat
+
+Files: src/rust/include/rust/map.h
+Copyright: 2012 William Swanson
+ 2020 The Zcash developers
+License: Expat-with-advertising-clause
+
+Files: src/rust/include/rust/VA_OPT.hpp
+Copyright: 2019 Will Wray
+ 2020 The Zcash developers
+License: Boost-Software-License-1.0
+
+Files: src/secp256k1/*
+Copyright: 2013 Pieter Wuille
+License: Expat
+Comment: This copyright entry excludes files explicitly listed below.
+
+Files: src/secp256k1/build-aux/m4/ax_jni_include_dir.m4
+Copyright: 2008 Don Anderson <dda@sleepycat.com>
+License: GNU-All-permissive-License
+
+Files: src/secp256k1/build-aux/m4/ax_prog_cc_for_build.m4
+Copyright: 2008 Paolo Bonzini <bonzini@gnu.org>
+License: GNU-All-permissive-License
+
+Files: src/leveldb/*
+Copyright: 2011 The LevelDB Authors
+License: BSD-3-clause-Google
+Comment: The LevelDB Authors are listed in src/leveldb/AUTHORS.
+
+License: Apache-2.0
+ On Debian systems, the full text of the Apache License v2.0 can be found in the
+ file `/usr/share/common-licenses/Apache-2.0`.
+
+License: Apache-2 with LLVM exception
+ ==============================================================================
+ The LLVM Project is under the Apache License v2.0 with LLVM Exceptions:
+ ==============================================================================
+ .
+ On Debian systems, the full text of the Apache License v2.0 can be found in the
+ file `/usr/share/common-licenses/Apache-2.0`.
+ .
+ ---- LLVM Exceptions to the Apache 2.0 License ----
+ .
+ As an exception, if, as a result of your compiling your source code, portions
+ of this Software are embedded into an Object form of such source code, you
+ may redistribute such embedded portions in such Object form without complying
+ with the conditions of Sections 4(a), 4(b) and 4(d) of the License.
+ .
+ In addition, if you combine or link compiled forms of this Software with
+ software that is licensed under the GPLv2 ("Combined Software") and if a
+ court of competent jurisdiction determines that the patent provision (Section
+ 3), the indemnity provision (Section 9) or other Section of the License
+ conflicts with the conditions of the GPLv2, you may retroactively and
+ prospectively choose to deem waived or otherwise exclude such Section(s) of
+ the License, but only in their entirety and only with respect to the Combined
+ Software.
+
+License: Boost-Software-License-1.0
+ Permission is hereby granted, free of charge, to any person or organization
+ obtaining a copy of the software and accompanying documentation covered by
+ this license (the "Software") to use, reproduce, display, distribute,
+ execute, and transmit the Software, and to prepare derivative works of the
+ Software, and to permit third-parties to whom the Software is furnished to
+ do so, all subject to the following:
+ .
+ The copyright notices in the Software and this entire statement, including
+ the above license grant, this restriction and the following disclaimer,
+ must be included in all copies of the Software, in whole or in part, and
+ all derivative works of the Software, unless such copies or derivative
+ works are solely in the form of machine-executable object code generated by
+ a source language processor.
+ .
+ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
+ SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
+ FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
+ ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+ DEALINGS IN THE SOFTWARE.
+
+License: BDB
+ /*
+ * The Oracle Berkeley DB product is licensed
+ * under the GNU AFFERO GENERAL PUBLIC LICENSE:
+ *
+ *
+ *                  GNU AFFERO GENERAL PUBLIC LICENSE
+ *                     Version 3, 19 November 2007
+ *
+ * Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ * Everyone is permitted to copy and distribute verbatim copies
+ * of this license document, but changing it is not allowed.
+ *
+ *                          Preamble
+ *
+ *  The GNU Affero General Public License is a free, copyleft license for
+ * software and other kinds of works, specifically designed to ensure
+ * cooperation with the community in the case of network server software.
+ *
+ *  The licenses for most software and other practical works are designed
+ * to take away your freedom to share and change the works.  By contrast,
+ * our General Public Licenses are intended to guarantee your freedom to
+ * share and change all versions of a program--to make sure it remains free
+ * software for all its users.
+ *
+ *  When we speak of free software, we are referring to freedom, not
+ * price.  Our General Public Licenses are designed to make sure that you
+ * have the freedom to distribute copies of free software (and charge for
+ * them if you wish), that you receive source code or can get it if you
+ * want it, that you can change the software or use pieces of it in new
+ * free programs, and that you know you can do these things.
+ *
+ *  Developers that use our General Public Licenses protect your rights
+ * with two steps: (1) assert copyright on the software, and (2) offer
+ * you this License which gives you legal permission to copy, distribute
+ * and/or modify the software.
+ *
+ *  A secondary benefit of defending all users' freedom is that
+ * improvements made in alternate versions of the program, if they
+ * receive widespread use, become available for other developers to
+ * incorporate.  Many developers of free software are heartened and
+ * encouraged by the resulting cooperation.  However, in the case of
+ * software used on network servers, this result may fail to come about.
+ * The GNU General Public License permits making a modified version and
+ * letting the public access it on a server without ever releasing its
+ * source code to the public.
+ *
+ *  The GNU Affero General Public License is designed specifically to
+ * ensure that, in such cases, the modified source code becomes available
+ * to the community.  It requires the operator of a network server to
+ * provide the source code of the modified version running there to the
+ * users of that server.  Therefore, public use of a modified version, on
+ * a publicly accessible server, gives the public access to the source
+ * code of the modified version.
+ *
+ *  An older license, called the Affero General Public License and
+ * published by Affero, was designed to accomplish similar goals.  This is
+ * a different license, not a version of the Affero GPL, but Affero has
+ * released a new version of the Affero GPL which permits relicensing under
+ * this license.
+ *
+ *  The precise terms and conditions for copying, distribution and
+ * modification follow.
+ *
+ *                     TERMS AND CONDITIONS
+ *
+ *  0. Definitions.
+ *
+ *  "This License" refers to version 3 of the GNU Affero General Public License.
+ *
+ *  "Copyright" also means copyright-like laws that apply to other kinds of
+ * works, such as semiconductor masks.
+ *
+ *  "The Program" refers to any copyrightable work licensed under this
+ * License.  Each licensee is addressed as "you".  "Licensees" and
+ * "recipients" may be individuals or organizations.
+ *
+ *  To "modify" a work means to copy from or adapt all or part of the work
+ * in a fashion requiring copyright permission, other than the making of an
+ * exact copy.  The resulting work is called a "modified version" of the
+ * earlier work or a work "based on" the earlier work.
+ *
+ *  A "covered work" means either the unmodified Program or a work based
+ * on the Program.
+ *
+ *  To "propagate" a work means to do anything with it that, without
+ * permission, would make you directly or secondarily liable for
+ * infringement under applicable copyright law, except executing it on a
+ * computer or modifying a private copy.  Propagation includes copying,
+ * distribution (with or without modification), making available to the
+ * public, and in some countries other activities as well.
+ *
+ *  To "convey" a work means any kind of propagation that enables other
+ * parties to make or receive copies.  Mere interaction with a user through
+ * a computer network, with no transfer of a copy, is not conveying.
+ *
+ *  An interactive user interface displays "Appropriate Legal Notices"
+ * to the extent that it includes a convenient and prominently visible
+ * feature that (1) displays an appropriate copyright notice, and (2)
+ * tells the user that there is no warranty for the work (except to the
+ * extent that warranties are provided), that licensees may convey the
+ * work under this License, and how to view a copy of this License.  If
+ * the interface presents a list of user commands or options, such as a
+ * menu, a prominent item in the list meets this criterion.
+ *
+ *  1. Source Code.
+ *
+ *  The "source code" for a work means the preferred form of the work
+ * for making modifications to it.  "Object code" means any non-source
+ * form of a work.
+ *
+ *  A "Standard Interface" means an interface that either is an official
+ * standard defined by a recognized standards body, or, in the case of
+ * interfaces specified for a particular programming language, one that
+ * is widely used among developers working in that language.
+ *
+ *  The "System Libraries" of an executable work include anything, other
+ * than the work as a whole, that (a) is included in the normal form of
+ * packaging a Major Component, but which is not part of that Major
+ * Component, and (b) serves only to enable use of the work with that
+ * Major Component, or to implement a Standard Interface for which an
+ * implementation is available to the public in source code form.  A
+ * "Major Component", in this context, means a major essential component
+ * (kernel, window system, and so on) of the specific operating system
+ * (if any) on which the executable work runs, or a compiler used to
+ * produce the work, or an object code interpreter used to run it.
+ *
+ *  The "Corresponding Source" for a work in object code form means all
+ * the source code needed to generate, install, and (for an executable
+ * work) run the object code and to modify the work, including scripts to
+ * control those activities.  However, it does not include the work's
+ * System Libraries, or general-purpose tools or generally available free
+ * programs which are used unmodified in performing those activities but
+ * which are not part of the work.  For example, Corresponding Source
+ * includes interface definition files associated with source files for
+ * the work, and the source code for shared libraries and dynamically
+ * linked subprograms that the work is specifically designed to require,
+ * such as by intimate data communication or control flow between those
+ * subprograms and other parts of the work.
+ *
+ *  The Corresponding Source need not include anything that users
+ * can regenerate automatically from other parts of the Corresponding
+ * Source.
+ *
+ *  The Corresponding Source for a work in source code form is that
+ * same work.
+ *
+ *  2. Basic Permissions.
+ *
+ *  All rights granted under this License are granted for the term of
+ * copyright on the Program, and are irrevocable provided the stated
+ * conditions are met.  This License explicitly affirms your unlimited
+ * permission to run the unmodified Program.  The output from running a
+ * covered work is covered by this License only if the output, given its
+ * content, constitutes a covered work.  This License acknowledges your
+ * rights of fair use or other equivalent, as provided by copyright law.
+ *
+ * You may make, run and propagate covered works that you do not
+ * convey, without conditions so long as your license otherwise remains
+ * in force.  You may convey covered works to others for the sole purpose
+ * of having them make modifications exclusively for you, or provide you
+ * with facilities for running those works, provided that you comply with
+ * the terms of this License in conveying all material for which you do
+ * not control copyright.  Those thus making or running the covered works
+ * for you must do so exclusively on your behalf, under your direction
+ * and control, on terms that prohibit them from making any copies of
+ * your copyrighted material outside their relationship with you.
+ *
+ *   Conveying under any other circumstances is permitted solely under
+ * the conditions stated below.  Sublicensing is not allowed; section 10
+ * makes it unnecessary.
+ *
+ *   3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+ *
+ *   No covered work shall be deemed part of an effective technological
+ * measure under any applicable law fulfilling obligations under article
+ * 11 of the WIPO copyright treaty adopted on 20 December 1996, or
+ * similar laws prohibiting or restricting circumvention of such
+ * measures.
+ *
+ *   When you convey a covered work, you waive any legal power to forbid
+ * circumvention of technological measures to the extent such circumvention
+ * is effected by exercising rights under this License with respect to
+ * the covered work, and you disclaim any intention to limit operation or
+ * modification of the work as a means of enforcing, against the work's
+ * users, your or third parties' legal rights to forbid circumvention of
+ * technological measures.
+ *
+ *   4. Conveying Verbatim Copies.
+ *
+ *   You may convey verbatim copies of the Program's source code as you
+ * receive it, in any medium, provided that you conspicuously and
+ * appropriately publish on each copy an appropriate copyright notice;
+ * keep intact all notices stating that this License and any
+ * non-permissive terms added in accord with section 7 apply to the code;
+ * keep intact all notices of the absence of any warranty; and give all
+ * recipients a copy of this License along with the Program.
+ *
+ *   You may charge any price or no price for each copy that you convey,
+ * and you may offer support or warranty protection for a fee.
+ *
+ *   5. Conveying Modified Source Versions.
+ *
+ *   You may convey a work based on the Program, or the modifications to
+ * produce it from the Program, in the form of source code under the
+ * terms of section 4, provided that you also meet all of these conditions:
+ *
+ *     a) The work must carry prominent notices stating that you modified
+ *     it, and giving a relevant date.
+ *
+ *     b) The work must carry prominent notices stating that it is
+ *     released under this License and any conditions added under section
+ *     7.  This requirement modifies the requirement in section 4 to
+ *     "keep intact all notices".
+ *
+ *     c) You must license the entire work, as a whole, under this
+ *     License to anyone who comes into possession of a copy.  This
+ *     License will therefore apply, along with any applicable section 7
+ *     additional terms, to the whole of the work, and all its parts,
+ *     regardless of how they are packaged.  This License gives no
+ *     permission to license the work in any other way, but it does not
+ *     invalidate such permission if you have separately received it.
+ *
+ *     d) If the work has interactive user interfaces, each must display
+ *     Appropriate Legal Notices; however, if the Program has interactive
+ *     interfaces that do not display Appropriate Legal Notices, your
+ *     work need not make them do so.
+ *
+ *  A compilation of a covered work with other separate and independent
+ * works, which are not by their nature extensions of the covered work,
+ * and which are not combined with it such as to form a larger program,
+ * in or on a volume of a storage or distribution medium, is called an
+ * "aggregate" if the compilation and its resulting copyright are not
+ * used to limit the access or legal rights of the compilation's users
+ * beyond what the individual works permit.  Inclusion of a covered work
+ * in an aggregate does not cause this License to apply to the other
+ * parts of the aggregate.
+ *
+ *   6. Conveying Non-Source Forms.
+ *
+ *   You may convey a covered work in object code form under the terms
+ * of sections 4 and 5, provided that you also convey the
+ * machine-readable Corresponding Source under the terms of this License,
+ * in one of these ways:
+ *
+ *     a) Convey the object code in, or embodied in, a physical product
+ *     (including a physical distribution medium), accompanied by the
+ *     Corresponding Source fixed on a durable physical medium
+ *     customarily used for software interchange.
+ *
+ *     b) Convey the object code in, or embodied in, a physical product
+ *     (including a physical distribution medium), accompanied by a
+ *     written offer, valid for at least three years and valid for as
+ *     long as you offer spare parts or customer support for that product
+ *     model, to give anyone who possesses the object code either (1) a
+ *     copy of the Corresponding Source for all the software in the
+ *     product that is covered by this License, on a durable physical
+ *     medium customarily used for software interchange, for a price no
+ *     more than your reasonable cost of physically performing this
+ *     conveying of source, or (2) access to copy the
+ *     Corresponding Source from a network server at no charge.
+ *
+ *     c) Convey individual copies of the object code with a copy of the
+ *     written offer to provide the Corresponding Source.  This
+ *     alternative is allowed only occasionally and noncommercially, and
+ *     only if you received the object code with such an offer, in accord
+ *     with subsection 6b.
+ *
+ *     d) Convey the object code by offering access from a designated
+ *     place (gratis or for a charge), and offer equivalent access to the
+ *     Corresponding Source in the same way through the same place at no
+ *     further charge.  You need not require recipients to copy the
+ *     Corresponding Source along with the object code.  If the place to
+ *     copy the object code is a network server, the Corresponding Source
+ *     may be on a different server (operated by you or a third party)
+ *     that supports equivalent copying facilities, provided you maintain
+ *     clear directions next to the object code saying where to find the
+ *     Corresponding Source.  Regardless of what server hosts the
+ *     Corresponding Source, you remain obligated to ensure that it is
+ *     available for as long as needed to satisfy these requirements.
+ *
+ *     e) Convey the object code using peer-to-peer transmission, provided
+ *     you inform other peers where the object code and Corresponding
+ *     Source of the work are being offered to the general public at no
+ *     charge under subsection 6d.
+ *
+ *   A separable portion of the object code, whose source code is excluded
+ * from the Corresponding Source as a System Library, need not be
+ * included in conveying the object code work.
+ *
+ *   A "User Product" is either (1) a "consumer product", which means any
+ * tangible personal property which is normally used for personal, family,
+ * or household purposes, or (2) anything designed or sold for incorporation
+ * into a dwelling.  In determining whether a product is a consumer product,
+ * doubtful cases shall be resolved in favor of coverage.  For a particular
+ * product received by a particular user, "normally used" refers to a
+ * typical or common use of that class of product, regardless of the status
+ * of the particular user or of the way in which the particular user
+ * actually uses, or expects or is expected to use, the product.  A product
+ * is a consumer product regardless of whether the product has substantial
+ * commercial, industrial or non-consumer uses, unless such uses represent
+ * the only significant mode of use of the product.
+ *
+ *   "Installation Information" for a User Product means any methods,
+ * procedures, authorization keys, or other information required to install
+ * and execute modified versions of a covered work in that User Product from
+ * a modified version of its Corresponding Source.  The information must
+ * suffice to ensure that the continued functioning of the modified object
+ * code is in no case prevented or interfered with solely because
+ * modification has been made.
+ *
+ *   If you convey an object code work under this section in, or with, or
+ * specifically for use in, a User Product, and the conveying occurs as
+ * part of a transaction in which the right of possession and use of the
+ * User Product is transferred to the recipient in perpetuity or for a
+ * fixed term (regardless of how the transaction is characterized), the
+ * Corresponding Source conveyed under this section must be accompanied
+ * by the Installation Information.  But this requirement does not apply
+ * if neither you nor any third party retains the ability to install
+ * modified object code on the User Product (for example, the work has
+ * been installed in ROM).
+ *
+ *   The requirement to provide Installation Information does not include a
+ * requirement to continue to provide support service, warranty, or updates
+ * for a work that has been modified or installed by the recipient, or for
+ * the User Product in which it has been modified or installed.  Access to a
+ * network may be denied when the modification itself materially and
+ * adversely affects the operation of the network or violates the rules and
+ * protocols for communication across the network.
+ *
+ *   Corresponding Source conveyed, and Installation Information provided,
+ * in accord with this section must be in a format that is publicly
+ * documented (and with an implementation available to the public in
+ * source code form), and must require no special password or key for
+ * unpacking, reading or copying.
+ *
+ *   7. Additional Terms.
+ *
+ *   "Additional permissions" are terms that supplement the terms of this
+ * License by making exceptions from one or more of its conditions.
+ * Additional permissions that are applicable to the entire Program shall
+ * be treated as though they were included in this License, to the extent
+ * that they are valid under applicable law.  If additional permissions
+ * apply only to part of the Program, that part may be used separately
+ * under those permissions, but the entire Program remains governed by
+ * this License without regard to the additional permissions.
+ *
+ *   When you convey a copy of a covered work, you may at your option
+ * remove any additional permissions from that copy, or from any part of
+ * it.  (Additional permissions may be written to require their own
+ * removal in certain cases when you modify the work.)  You may place
+ * additional permissions on material, added by you to a covered work,
+ * for which you have or can give appropriate copyright permission.
+ *
+ *   Notwithstanding any other provision of this License, for material you
+ * add to a covered work, you may (if authorized by the copyright holders of
+ * that material) supplement the terms of this License with terms:
+ *
+ *     a) Disclaiming warranty or limiting liability differently from the
+ *     terms of sections 15 and 16 of this License; or
+ *
+ *     b) Requiring preservation of specified reasonable legal notices or
+ *     author attributions in that material or in the Appropriate Legal
+ *     Notices displayed by works containing it; or
+ *
+ *     c) Prohibiting misrepresentation of the origin of that material, or
+ *     requiring that modified versions of such material be marked in
+ *     reasonable ways as different from the original version; or
+ *
+ *     d) Limiting the use for publicity purposes of names of licensors or
+ *     authors of the material; or
+ *
+ *     e) Declining to grant rights under trademark law for use of some
+ *     trade names, trademarks, or service marks; or
+ *
+ *     f) Requiring indemnification of licensors and authors of that
+ *     material by anyone who conveys the material (or modified versions of
+ *     it) with contractual assumptions of liability to the recipient, for
+ *     any liability that these contractual assumptions directly impose on
+ *     those licensors and authors.
+ *
+ *   All other non-permissive additional terms are considered "further
+ * restrictions" within the meaning of section 10.  If the Program as you
+ * received it, or any part of it, contains a notice stating that it is
+ * governed by this License along with a term that is a further
+ * restriction, you may remove that term.  If a license document contains
+ * a further restriction but permits relicensing or conveying under this
+ * License, you may add to a covered work material governed by the terms
+ * of that license document, provided that the further restriction does
+ * not survive such relicensing or conveying.
+ *
+ *   If you add terms to a covered work in accord with this section, you
+ * must place, in the relevant source files, a statement of the
+ * additional terms that apply to those files, or a notice indicating
+ * where to find the applicable terms.
+ *
+ *   Additional terms, permissive or non-permissive, may be stated in the
+ * form of a separately written license, or stated as exceptions;
+ * the above requirements apply either way.
+ *
+ *   8. Termination.
+ *
+ *   You may not propagate or modify a covered work except as expressly
+ * provided under this License.  Any attempt otherwise to propagate or
+ * modify it is void, and will automatically terminate your rights under
+ * this License (including any patent licenses granted under the third
+ * paragraph of section 11).
+ *
+ *   However, if you cease all violation of this License, then your
+ * license from a particular copyright holder is reinstated (a)
+ * provisionally, unless and until the copyright holder explicitly and
+ * finally terminates your license, and (b) permanently, if the copyright
+ * holder fails to notify you of the violation by some reasonable means
+ * prior to 60 days after the cessation.
+ *
+ *   Moreover, your license from a particular copyright holder is
+ * reinstated permanently if the copyright holder notifies you of the
+ * violation by some reasonable means, this is the first time you have
+ * received notice of violation of this License (for any work) from that
+ * copyright holder, and you cure the violation prior to 30 days after
+ * your receipt of the notice.
+ *
+ *   Termination of your rights under this section does not terminate the
+ * licenses of parties who have received copies or rights from you under
+ * this License.  If your rights have been terminated and not permanently
+ * reinstated, you do not qualify to receive new licenses for the same
+ * material under section 10.
+ *
+ *   9. Acceptance Not Required for Having Copies.
+ *
+ *   You are not required to accept this License in order to receive or
+ * run a copy of the Program.  Ancillary propagation of a covered work
+ * occurring solely as a consequence of using peer-to-peer transmission
+ * to receive a copy likewise does not require acceptance.  However,
+ * nothing other than this License grants you permission to propagate or
+ * modify any covered work.  These actions infringe copyright if you do
+ * not accept this License.  Therefore, by modifying or propagating a
+ * covered work, you indicate your acceptance of this License to do so.
+ *
+ *   10. Automatic Licensing of Downstream Recipients.
+ *
+ *   Each time you convey a covered work, the recipient automatically
+ * receives a license from the original licensors, to run, modify and
+ * propagate that work, subject to this License.  You are not responsible
+ * for enforcing compliance by third parties with this License.
+ *
+ *   An "entity transaction" is a transaction transferring control of an
+ * organization, or substantially all assets of one, or subdividing an
+ * organization, or merging organizations.  If propagation of a covered
+ * work results from an entity transaction, each party to that
+ * transaction who receives a copy of the work also receives whatever
+ * licenses to the work the party's predecessor in interest had or could
+ * give under the previous paragraph, plus a right to possession of the
+ * Corresponding Source of the work from the predecessor in interest, if
+ * the predecessor has it or can get it with reasonable efforts.
+ *
+ *   You may not impose any further restrictions on the exercise of the
+ * rights granted or affirmed under this License.  For example, you may
+ * not impose a license fee, royalty, or other charge for exercise of
+ * rights granted under this License, and you may not initiate litigation
+ * (including a cross-claim or counterclaim in a lawsuit) alleging that
+ * any patent claim is infringed by making, using, selling, offering for
+ * sale, or importing the Program or any portion of it.
+ *
+ *   11. Patents.
+ *
+ *   A "contributor" is a copyright holder who authorizes use under this
+ * License of the Program or a work on which the Program is based.  The
+ * work thus licensed is called the contributor's "contributor version".
+ *
+ *   A contributor's "essential patent claims" are all patent claims
+ * owned or controlled by the contributor, whether already acquired or
+ * hereafter acquired, that would be infringed by some manner, permitted
+ * by this License, of making, using, or selling its contributor version,
+ * but do not include claims that would be infringed only as a
+ * consequence of further modification of the contributor version.  For
+ * purposes of this definition, "control" includes the right to grant
+ * patent sublicenses in a manner consistent with the requirements of
+ * this License.
+ *
+ *   Each contributor grants you a non-exclusive, worldwide, royalty-free
+ * patent license under the contributor's essential patent claims, to
+ * make, use, sell, offer for sale, import and otherwise run, modify and
+ * propagate the contents of its contributor version.
+ *
+ *   In the following three paragraphs, a "patent license" is any express
+ * agreement or commitment, however denominated, not to enforce a patent
+ * (such as an express permission to practice a patent or covenant not to
+ * sue for patent infringement).  To "grant" such a patent license to a
+ * party means to make such an agreement or commitment not to enforce a
+ * patent against the party.
+ *
+ *   If you convey a covered work, knowingly relying on a patent license,
+ * and the Corresponding Source of the work is not available for anyone
+ * to copy, free of charge and under the terms of this License, through a
+ * publicly available network server or other readily accessible means,
+ * then you must either (1) cause the Corresponding Source to be so
+ * available, or (2) arrange to deprive yourself of the benefit of the
+ * patent license for this particular work, or (3) arrange, in a manner
+ * consistent with the requirements of this License, to extend the patent
+ * license to downstream recipients.  "Knowingly relying" means you have
+ * actual knowledge that, but for the patent license, your conveying the
+ * covered work in a country, or your recipient's use of the covered work
+ * in a country, would infringe one or more identifiable patents in that
+ * country that you have reason to believe are valid.
+ *
+ *   If, pursuant to or in connection with a single transaction or
+ * arrangement, you convey, or propagate by procuring conveyance of, a
+ * covered work, and grant a patent license to some of the parties
+ * receiving the covered work authorizing them to use, propagate, modify
+ * or convey a specific copy of the covered work, then the patent license
+ * you grant is automatically extended to all recipients of the covered
+ * work and works based on it.
+ *
+ *   A patent license is "discriminatory" if it does not include within
+ * the scope of its coverage, prohibits the exercise of, or is
+ * conditioned on the non-exercise of one or more of the rights that are
+ * specifically granted under this License.  You may not convey a covered
+ * work if you are a party to an arrangement with a third party that is
+ * in the business of distributing software, under which you make payment
+ * to the third party based on the extent of your activity of conveying
+ * the work, and under which the third party grants, to any of the
+ * parties who would receive the covered work from you, a discriminatory
+ * patent license (a) in connection with copies of the covered work
+ * conveyed by you (or copies made from those copies), or (b) primarily
+ * for and in connection with specific products or compilations that
+ * contain the covered work, unless you entered into that arrangement,
+ * or that patent license was granted, prior to 28 March 2007.
+ *
+ *   Nothing in this License shall be construed as excluding or limiting
+ * any implied license or other defenses to infringement that may
+ * otherwise be available to you under applicable patent law.
+ *
+ *   12. No Surrender of Others' Freedom.
+ *
+ *   If conditions are imposed on you (whether by court order, agreement or
+ * otherwise) that contradict the conditions of this License, they do not
+ * excuse you from the conditions of this License.  If you cannot convey a
+ * covered work so as to satisfy simultaneously your obligations under this
+ * License and any other pertinent obligations, then as a consequence you may
+ * not convey it at all.  For example, if you agree to terms that obligate you
+ * to collect a royalty for further conveying from those to whom you convey
+ * the Program, the only way you could satisfy both those terms and this
+ * License would be to refrain entirely from conveying the Program.
+ *
+ *   13. Remote Network Interaction; Use with the GNU General Public License.
+ *
+ *   Notwithstanding any other provision of this License, if you modify the
+ * Program, your modified version must prominently offer all users
+ * interacting with it remotely through a computer network (if your version
+ * supports such interaction) an opportunity to receive the Corresponding
+ * Source of your version by providing access to the Corresponding Source
+ * from a network server at no charge, through some standard or customary
+ * means of facilitating copying of software.  This Corresponding Source
+ * shall include the Corresponding Source for any work covered by version 3
+ * of the GNU General Public License that is incorporated pursuant to the
+ * following paragraph.
+ *
+ *   Notwithstanding any other provision of this License, you have
+ * permission to link or combine any covered work with a work licensed
+ * under version 3 of the GNU General Public License into a single
+ * combined work, and to convey the resulting work.  The terms of this
+ * License will continue to apply to the part which is the covered work,
+ * but the work with which it is combined will remain governed by version
+ * 3 of the GNU General Public License.
+ *
+ *   14. Revised Versions of this License.
+ *
+ *   The Free Software Foundation may publish revised and/or new versions of
+ * the GNU Affero General Public License from time to time.  Such new versions
+ * will be similar in spirit to the present version, but may differ in detail to
+ * address new problems or concerns.
+ *
+ *   Each version is given a distinguishing version number.  If the
+ * Program specifies that a certain numbered version of the GNU Affero General
+ * Public License "or any later version" applies to it, you have the
+ * option of following the terms and conditions either of that numbered
+ * version or of any later version published by the Free Software
+ * Foundation.  If the Program does not specify a version number of the
+ * GNU Affero General Public License, you may choose any version ever published
+ * by the Free Software Foundation.
+ *
+ *   If the Program specifies that a proxy can decide which future
+ * versions of the GNU Affero General Public License can be used, that proxy's
+ * public statement of acceptance of a version permanently authorizes you
+ * to choose that version for the Program.
+ *
+ *   Later license versions may give you additional or different
+ * permissions.  However, no additional obligations are imposed on any
+ * author or copyright holder as a result of your choosing to follow a
+ * later version.
+ *
+ *   15. Disclaimer of Warranty.
+ *
+ *   THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+ * APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+ * HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+ * OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+ * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+ * IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ * ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+ *
+ *   16. Limitation of Liability.
+ *
+ *   IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+ * WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+ * THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+ * GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+ * USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+ * DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+ * PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+ * EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGES.
+ *
+ *   17. Interpretation of Sections 15 and 16.
+ *
+ *   If the disclaimer of warranty and limitation of liability provided
+ * above cannot be given local legal effect according to their terms,
+ * reviewing courts shall apply local law that most closely approximates
+ * an absolute waiver of all civil liability in connection with the
+ * Program, unless a warranty or assumption of liability accompanies a
+ * copy of the Program in return for a fee.
+ *
+ *                      END OF TERMS AND CONDITIONS
+ *
+ *             How to Apply These Terms to Your New Programs
+ *
+ *   If you develop a new program, and you want it to be of the greatest
+ * possible use to the public, the best way to achieve this is to make it
+ * free software which everyone can redistribute and change under these terms.
+ *
+ *   To do so, attach the following notices to the program.  It is safest
+ * to attach them to the start of each source file to most effectively
+ * state the exclusion of warranty; and each file should have at least
+ * the "copyright" line and a pointer to where the full notice is found.
+ *
+ *     <one line to give the program's name and a brief idea of what it does.>
+ *     Copyright (C) <year>  <name of author>
+ *
+ *     This program is free software: you can redistribute it and/or modify
+ *   it under the terms of the GNU Affero General Public License as published by
+ *   the Free Software Foundation, either version 3 of the License, or
+ *   (at your option) any later version.
+ *
+ *     This program is distributed in the hope that it will be useful,
+ *     but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *     GNU Affero General Public License for more details.
+ *
+ *     You should have received a copy of the GNU Affero General Public License
+ *     along with this program.  If not, see <http://www.gnu.org/licenses/>.
+ *
+ * Also add information on how to contact you by electronic and paper mail.
+ *
+ *   If your software can interact with users remotely through a computer
+ * network, you should also make sure that it provides a way for users to
+ * get its source.  For example, if your program is a web application, its
+ * interface could display a "Source" link that leads users to an archive
+ * of the code.  There are many ways you could offer source, and different
+ * solutions will be better for different programs; see section 13 for the
+ * specific requirements.
+ *
+ *   You should also get your employer (if you work as a programmer) or school,
+ * if any, to sign a "copyright disclaimer" for the program, if necessary.
+ * For more information on this, and how to apply and follow the GNU AGPL, see
+ * <http://www.gnu.org/licenses/>.
+ */
+ .
+ ADDITIONAL THIRD PARTY NOTICES:
+ .
+ =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
+ /*
+ * Copyright (c) 1990, 1993, 1994, 1995
+ *      The Regents of the University of California.  All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ * 3. Neither the name of the University nor the names of its contributors
+ *    may be used to endorse or promote products derived from this software
+ *    without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ */
+ /*
+ * Copyright (c) 1995, 1996
+ *      The President and Fellows of Harvard University.  All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ * 3. Neither the name of the University nor the names of its contributors
+ *    may be used to endorse or promote products derived from this software
+ *    without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY HARVARD AND ITS CONTRIBUTORS ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED.  IN NO EVENT SHALL HARVARD OR ITS CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ */
+ =-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
+ /***
+ * ASM: a very small and fast Java bytecode manipulation framework
+ * Copyright (c) 2000-2005 INRIA, France Telecom
+ * All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ * 3. Neither the name of the copyright holders nor the names of its
+ *    contributors may be used to endorse or promote products derived from
+ *    this software without specific prior written permission.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
+ * THE POSSIBILITY OF SUCH DAMAGE.
+ */
+
+License: BSD-2-clause
+ Redistribution and use in source and binary forms, with or without
+ modification, are permitted provided that the following conditions are
+ met:
+ .
+ 1. Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer.
+ .
+ 2. Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer in the
+    documentation and/or other materials provided with the
+    distribution.
+ .
+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+License: BSD-3-clause
+ Redistribution and use in source and binary forms, with or without
+ modification, are permitted provided that the following conditions are met:
+ .
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+ * Redistributions in binary form must reproduce the above copyright notice,
+ this list of conditions and the following disclaimer in the documentation
+ and/or other materials provided with the distribution.
+ * The name of the author may not be used to endorse or promote products
+ derived from this software without specific prior written permission.
+ .
+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ POSSIBILITY OF SUCH DAMAGE.
+
+License: Expat
+ Permission is hereby granted, free of charge, to any person obtaining a
+ copy of this software and associated documentation files (the
+ "Software"), to deal in the Software without restriction, including
+ without limitation the rights to use, copy, modify, merge, publish,
+ distribute, sublicense, and/or sell copies of the Software, and to
+ permit persons to whom the Software is furnished to do so, subject to
+ the following conditions:
+ .
+ The above copyright notice and this permission notice shall be included
+ in all copies or substantial portions of the Software.
+ .
+ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
+ OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+ IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+ CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+ TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+ SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+License: BSD-3-clause-Google
+ Redistribution and use in source and binary forms, with or without
+ modification, are permitted provided that the following conditions are
+ met:
+ .
+    * Redistributions of source code must retain the above copyright
+      notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above
+      copyright notice, this list of conditions and the following disclaimer
+      in the documentation and/or other materials provided with the
+      distribution.
+    * Neither the name of Google Inc. nor the names of its
+      contributors may be used to endorse or promote products derived from
+      this software without specific prior written permission.
+ .
+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+ OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+ LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+ THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+ (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+License: BSD-3-clause-Tobias-Klein
+ Redistribution and use in source and binary forms, with or without
+ modification, are permitted provided that the following conditions are met:
+ .
+ * Redistributions of source code must retain the above copyright notice,
+ this list of conditions and the following disclaimer.
+ * Redistributions in binary form must reproduce the above copyright notice,
+ this list of conditions and the following disclaimer in the documentation
+ and/or other materials provided with the distribution.
+ * Neither the name of Tobias Klein nor the name of trapkit.de may be used
+ to endorse or promote products derived from this software without specific
+ prior written permission.
+ .
+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+ LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+ CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+ SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+ INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+ CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+ POSSIBILITY OF SUCH DAMAGE.
+
+License: ISC
+ Permission to use, copy, modify, and distribute this software for any
+ purpose with or without fee is hereby granted, provided that the above
+ copyright notice and this permission notice appear in all copies.
+ .
+ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL
+ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED
+ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR
+ BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES
+ OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
+ WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION,
+ ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS
+ SOFTWARE.
+
+License: LGPL
+ GNU LESSER GENERAL PUBLIC LICENSE
+ Version 3, 29 June 2007
+ .
+ On Debian systems the GNU Lesser General Public License (LGPL) is
+ located in '/usr/share/common-licenses/LGPL'.
+ .
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ GNU General Public License for more details.
+Comment:
+ You should have received a copy of the GNU General Public License
+ along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+License: LGPL-3+ with ZeroMQ exception
+ GNU LESSER GENERAL PUBLIC LICENSE
+ Version 3, 29 June 2007
+ .
+ On Debian systems the GNU Lesser General Public License (LGPL) is
+ located in '/usr/share/common-licenses/LGPL'.
+ .
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ GNU General Public License for more details.
+ --------------------------------------------------------------------------------
+ SPECIAL EXCEPTION GRANTED BY COPYRIGHT HOLDERS
+ .
+ As a special exception, copyright holders give you permission to link this
+ library with independent modules to produce an executable, regardless of
+ the license terms of these independent modules, and to copy and distribute
+ the resulting executable under terms of your choice, provided that you also
+ meet, for each linked independent module, the terms and conditions of
+ the license of that module. An independent module is a module which is not
+ derived from or based on this library. If you modify this library, you must
+ extend this exception to your version of the library.
+  
+ Note: this exception relieves you of any obligations under sections 4 and 5
+ of this license, and section 6 of the GNU General Public License.
+Comment:
+ You should have received a copy of the GNU General Public License
+ along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+License: GNU-All-permissive-License
+ Copying and distribution of this file, with or without modification, are
+ permitted in any medium without royalty provided the copyright notice
+ and this notice are preserved. This file is offered as-is, without any
+ warranty.
+
+License: GPL-3+ with Autoconf exception
+ This program is free software: you can redistribute it and/or modify it
+ under the terms of the GNU General Public License as published by the
+ Free Software Foundation, either version 3 of the License, or (at your
+ option) any later version.
+ .
+ This program is distributed in the hope that it will be useful, but
+ WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
+ Public License for more details.
+ .
+ You should have received a copy of the GNU General Public License along
+ with this program. If not, see <http://www.gnu.org/licenses/>.
+ .
+ On Debian systems, the full text of the GNU General Public License
+ version 3 can be found in the file `/usr/share/common-licenses/GPL-3'.
+ .
+ As a special exception, the respective Autoconf Macro's copyright owner
+ gives unlimited permission to copy, distribute and modify the configure
+ scripts that are the output of Autoconf when processing the Macro. You
+ need not follow the terms of the GNU General Public License when using
+ or distributing such scripts, even though portions of the text of the
+ Macro appear in them. The GNU General Public License (GPL) does govern
+ all other use of the material that constitutes the Autoconf Macro.
+ .
+ This special exception to the GPL applies to versions of the Autoconf
+ Macro released by the Autoconf Archive. When you make and distribute a
+ modified version of the Autoconf Macro, you may extend this special
+ exception to the GPL to apply to your modified version as well.
+Comment:
+ The "special exception" is extended to the versions of files covered by
+ this license that are distributed with this software.
+
+License: GPL-2+ with Libtool exception
+ This is free software; see the source for copying conditions.  There is NO
+ warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ .
+ GNU Libtool is free software; you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation; either version 2 of of the License, or
+ (at your option) any later version.
+ .
+ As a special exception to the GNU General Public License, if you
+ distribute this file as part of a program or library that is built
+ using GNU Libtool, you may include this file under the  same
+ distribution terms that you use for the rest of that program.
+ .
+ GNU Libtool is distributed in the hope that it will be useful, but
+ WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ GNU General Public License for more details.
+ .
+ You should have received a copy of the GNU General Public License
+ along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+License: Expat-with-advertising-clause
+ Permission is hereby granted, free of charge, to any person
+ obtaining a copy of this software and associated documentation
+ files (the "Software"), to deal in the Software without
+ restriction, including without limitation the rights to use, copy,
+ modify, merge, publish, distribute, sublicense, and/or sell copies
+ of the Software, and to permit persons to whom the Software is
+ furnished to do so, subject to the following conditions:
+
+ The above copyright notice and this permission notice shall be
+ included in all copies or substantial portions of the Software.
+
+ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+ NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY
+ CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
+ CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+ WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+ Except as contained in this notice, the names of the authors or
+ their institutions shall not be used in advertising or otherwise to
+ promote the sale, use or other dealings in this Software without
+ prior written authorization from the authors.
+
+License: CC0-1.0
+ Creative Commons Legal Code
+ .
+ CC0 1.0 Universal
+ .
+     CREATIVE COMMONS CORPORATION IS NOT A LAW FIRM AND DOES NOT PROVIDE
+     LEGAL SERVICES. DISTRIBUTION OF THIS DOCUMENT DOES NOT CREATE AN
+     ATTORNEY-CLIENT RELATIONSHIP. CREATIVE COMMONS PROVIDES THIS
+     INFORMATION ON AN "AS-IS" BASIS. CREATIVE COMMONS MAKES NO WARRANTIES
+     REGARDING THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS
+     PROVIDED HEREUNDER, AND DISCLAIMS LIABILITY FOR DAMAGES RESULTING FROM
+     THE USE OF THIS DOCUMENT OR THE INFORMATION OR WORKS PROVIDED
+     HEREUNDER.
+ .
+ Statement of Purpose
+ .
+ The laws of most jurisdictions throughout the world automatically confer
+ exclusive Copyright and Related Rights (defined below) upon the creator
+ and subsequent owner(s) (each and all, an "owner") of an original work of
+ authorship and/or a database (each, a "Work").
+ .
+ Certain owners wish to permanently relinquish those rights to a Work for
+ the purpose of contributing to a commons of creative, cultural and
+ scientific works ("Commons") that the public can reliably and without fear
+ of later claims of infringement build upon, modify, incorporate in other
+ works, reuse and redistribute as freely as possible in any form whatsoever
+ and for any purposes, including without limitation commercial purposes.
+ These owners may contribute to the Commons to promote the ideal of a free
+ culture and the further production of creative, cultural and scientific
+ works, or to gain reputation or greater distribution for their Work in
+ part through the use and efforts of others.
+ .
+ For these and/or other purposes and motivations, and without any
+ expectation of additional consideration or compensation, the person
+ associating CC0 with a Work (the "Affirmer"), to the extent that he or she
+ is an owner of Copyright and Related Rights in the Work, voluntarily
+ elects to apply CC0 to the Work and publicly distribute the Work under its
+ terms, with knowledge of his or her Copyright and Related Rights in the
+ Work and the meaning and intended legal effect of CC0 on those rights.
+ .
+ 1. Copyright and Related Rights. A Work made available under CC0 may be
+ protected by copyright and related or neighboring rights ("Copyright and
+ Related Rights"). Copyright and Related Rights include, but are not
+ limited to, the following:
+ .
+   i. the right to reproduce, adapt, distribute, perform, display,
+      communicate, and translate a Work;
+  ii. moral rights retained by the original author(s) and/or performer(s);
+ iii. publicity and privacy rights pertaining to a person's image or
+      likeness depicted in a Work;
+  iv. rights protecting against unfair competition in regards to a Work,
+      subject to the limitations in paragraph 4(a), below;
+   v. rights protecting the extraction, dissemination, use and reuse of data
+      in a Work;
+  vi. database rights (such as those arising under Directive 96/9/EC of the
+      European Parliament and of the Council of 11 March 1996 on the legal
+      protection of databases, and under any national implementation
+      thereof, including any amended or successor version of such
+      directive); and
+ vii. other similar, equivalent or corresponding rights throughout the
+      world based on applicable law or treaty, and any national
+      implementations thereof.
+ .
+ 2. Waiver. To the greatest extent permitted by, but not in contravention
+ of, applicable law, Affirmer hereby overtly, fully, permanently,
+ irrevocably and unconditionally waives, abandons, and surrenders all of
+ Affirmer's Copyright and Related Rights and associated claims and causes
+ of action, whether now known or unknown (including existing as well as
+ future claims and causes of action), in the Work (i) in all territories
+ worldwide, (ii) for the maximum duration provided by applicable law or
+ treaty (including future time extensions), (iii) in any current or future
+ medium and for any number of copies, and (iv) for any purpose whatsoever,
+ including without limitation commercial, advertising or promotional
+ purposes (the "Waiver"). Affirmer makes the Waiver for the benefit of each
+ member of the public at large and to the detriment of Affirmer's heirs and
+ successors, fully intending that such Waiver shall not be subject to
+ revocation, rescission, cancellation, termination, or any other legal or
+ equitable action to disrupt the quiet enjoyment of the Work by the public
+ as contemplated by Affirmer's express Statement of Purpose.
+ .
+ 3. Public License Fallback. Should any part of the Waiver for any reason
+ be judged legally invalid or ineffective under applicable law, then the
+ Waiver shall be preserved to the maximum extent permitted taking into
+ account Affirmer's express Statement of Purpose. In addition, to the
+ extent the Waiver is so judged Affirmer hereby grants to each affected
+ person a royalty-free, non transferable, non sublicensable, non exclusive,
+ irrevocable and unconditional license to exercise Affirmer's Copyright and
+ Related Rights in the Work (i) in all territories worldwide, (ii) for the
+ maximum duration provided by applicable law or treaty (including future
+ time extensions), (iii) in any current or future medium and for any number
+ of copies, and (iv) for any purpose whatsoever, including without
+ limitation commercial, advertising or promotional purposes (the
+ "License"). The License shall be deemed effective as of the date CC0 was
+ applied by Affirmer to the Work. Should any part of the License for any
+ reason be judged legally invalid or ineffective under applicable law, such
+ partial invalidity or ineffectiveness shall not invalidate the remainder
+ of the License, and in such case Affirmer hereby affirms that he or she
+ will not (i) exercise any of his or her remaining Copyright and Related
+ Rights in the Work or (ii) assert any associated claims and causes of
+ action with respect to the Work, in either case contrary to Affirmer's
+ express Statement of Purpose.
+ .
+ 4. Limitations and Disclaimers.
+ .
+  a. No trademark or patent rights held by Affirmer are waived, abandoned,
+     surrendered, licensed or otherwise affected by this document.
+  b. Affirmer offers the Work as-is and makes no representations or
+     warranties of any kind concerning the Work, express, implied,
+     statutory or otherwise, including without limitation warranties of
+     title, merchantability, fitness for a particular purpose, non
+     infringement, or the absence of latent or other defects, accuracy, or
+     the present or absence of errors, whether or not discoverable, all to
+     the greatest extent permissible under applicable law.
+  c. Affirmer disclaims responsibility for clearing rights of other persons
+     that may apply to the Work or any use thereof, including without
+     limitation any person's Copyright and Related Rights in the Work.
+     Further, Affirmer disclaims responsibility for obtaining any necessary
+     consents, permissions or other rights required for any use of the
+     Work.
+  d. Affirmer understands and acknowledges that Creative Commons is not a
+     party to this document and has no duty or obligation with respect to
+     this CC0 or use of the Work.
+
+License: WTFPL
+            DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
+                    Version 2, December 2004
+ .
+ Copyright (C) 2004 Sam Hocevar <sam@hocevar.net>
+ .
+ Everyone is permitted to copy and distribute verbatim or modified
+ copies of this license document, and changing it is allowed as long
+ as the name is changed.
+ .
+            DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+ .
+ 0. You just DO WHAT THE FUCK YOU WANT TO.
+
+License: Ring-BoringSSL
+ Note that it is easy for this file to get out of sync with the licenses in the
+ source code files. It's recommended to compare the licenses in the source code
+ with what's mentioned here.
+ .
+ *ring* is derived from BoringSSL, so the licensing situation in *ring* is
+ similar to BoringSSL.
+ .
+ *ring* uses an ISC-style license like BoringSSL for code in new files,
+ including in particular all the Rust code:
+ .
+    Copyright 2015-2016 Brian Smith.
+ .
+    Permission to use, copy, modify, and/or distribute this software for any
+    purpose with or without fee is hereby granted, provided that the above
+    copyright notice and this permission notice appear in all copies.
+ .
+    THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHORS DISCLAIM ALL WARRANTIES
+    WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+    MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY
+    SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+    WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
+    OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
+    CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+ .
+ BoringSSL is a fork of OpenSSL. As such, large parts of it fall under OpenSSL
+ licensing. Files that are completely new have a Google copyright and an ISC
+ license. This license is reproduced at the bottom of this file.
+ .
+ Contributors to BoringSSL are required to follow the CLA rules for Chromium:
+ https://cla.developers.google.com/clas
+ .
+ Files in third_party/ have their own licenses, as described therein. The MIT
+ license, for third_party/fiat, which, unlike other third_party directories, is
+ compiled into non-test libraries, is included below.
+ .
+ The OpenSSL toolkit stays under a dual license, i.e. both the conditions of the
+ OpenSSL License and the original SSLeay license apply to the toolkit. See below
+ for the actual license texts. Actually both licenses are BSD-style Open Source
+ licenses. In case of any license issues related to OpenSSL please contact
+ openssl-core@openssl.org.
+ .
+ The following are Google-internal bug numbers where explicit permission from
+ some authors is recorded for use of their work:
+   27287199
+   27287880
+   27287883
+ .
+   OpenSSL License
+   ---------------
+ .
+ /* ====================================================================
+  * Copyright (c) 1998-2011 The OpenSSL Project.  All rights reserved.
+  *
+  * Redistribution and use in source and binary forms, with or without
+  * modification, are permitted provided that the following conditions
+  * are met:
+  *
+  * 1. Redistributions of source code must retain the above copyright
+  *    notice, this list of conditions and the following disclaimer.
+  *
+  * 2. Redistributions in binary form must reproduce the above copyright
+  *    notice, this list of conditions and the following disclaimer in
+  *    the documentation and/or other materials provided with the
+  *    distribution.
+  *
+  * 3. All advertising materials mentioning features or use of this
+  *    software must display the following acknowledgment:
+  *    "This product includes software developed by the OpenSSL Project
+  *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
+  *
+  * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
+  *    endorse or promote products derived from this software without
+  *    prior written permission. For written permission, please contact
+  *    openssl-core@openssl.org.
+  *
+  * 5. Products derived from this software may not be called "OpenSSL"
+  *    nor may "OpenSSL" appear in their names without prior written
+  *    permission of the OpenSSL Project.
+  *
+  * 6. Redistributions of any form whatsoever must retain the following
+  *    acknowledgment:
+  *    "This product includes software developed by the OpenSSL Project
+  *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
+  *
+  * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
+  * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
+  * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
+  * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
+  * OF THE POSSIBILITY OF SUCH DAMAGE.
+  * ====================================================================
+  *
+  * This product includes cryptographic software written by Eric Young
+  * (eay@cryptsoft.com).  This product includes software written by Tim
+  * Hudson (tjh@cryptsoft.com).
+  *
+  */
+ .
+ Original SSLeay License
+ -----------------------
+ .
+ /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
+  * All rights reserved.
+  *
+  * This package is an SSL implementation written
+  * by Eric Young (eay@cryptsoft.com).
+  * The implementation was written so as to conform with Netscapes SSL.
+  *
+  * This library is free for commercial and non-commercial use as long as
+  * the following conditions are aheared to.  The following conditions
+  * apply to all code found in this distribution, be it the RC4, RSA,
+  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
+  * included with this distribution is covered by the same copyright terms
+  * except that the holder is Tim Hudson (tjh@cryptsoft.com).
+  *
+  * Copyright remains Eric Young's, and as such any Copyright notices in
+  * the code are not to be removed.
+  * If this package is used in a product, Eric Young should be given attribution
+  * as the author of the parts of the library used.
+  * This can be in the form of a textual message at program startup or
+  * in documentation (online or textual) provided with the package.
+  *
+  * Redistribution and use in source and binary forms, with or without
+  * modification, are permitted provided that the following conditions
+  * are met:
+  * 1. Redistributions of source code must retain the copyright
+  *    notice, this list of conditions and the following disclaimer.
+  * 2. Redistributions in binary form must reproduce the above copyright
+  *    notice, this list of conditions and the following disclaimer in the
+  *    documentation and/or other materials provided with the distribution.
+  * 3. All advertising materials mentioning features or use of this software
+  *    must display the following acknowledgement:
+  *    "This product includes cryptographic software written by
+  *     Eric Young (eay@cryptsoft.com)"
+  *    The word 'cryptographic' can be left out if the rouines from the library
+  *    being used are not cryptographic related :-).
+  * 4. If you include any Windows specific code (or a derivative thereof) from
+  *    the apps directory (application code) you must include an acknowledgement:
+  *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
+  *
+  * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
+  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+  * SUCH DAMAGE.
+  *
+  * The licence and distribution terms for any publically available version or
+  * derivative of this code cannot be changed.  i.e. this code cannot simply be
+  * copied and put under another distribution licence
+  * [including the GNU Public Licence.]
+  */
+ .
+ ISC license used for completely new code in BoringSSL:
+ .
+ /* Copyright (c) 2015, Google Inc.
+  *
+  * Permission to use, copy, modify, and/or distribute this software for any
+  * purpose with or without fee is hereby granted, provided that the above
+  * copyright notice and this permission notice appear in all copies.
+  *
+  * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+  * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+  * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
+  * SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+  * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION
+  * OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN
+  * CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. */
+ .
+ The code in third_party/fiat carries the MIT license:
+ .
+ Copyright (c) 2015-2016 the fiat-crypto authors (see
+ https://github.com/mit-plv/fiat-crypto/blob/master/AUTHORS).
+ .
+ Permission is hereby granted, free of charge, to any person obtaining a copy
+ of this software and associated documentation files (the "Software"), to deal
+ in the Software without restriction, including without limitation the rights
+ to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ copies of the Software, and to permit persons to whom the Software is
+ furnished to do so, subject to the following conditions:
+ .
+ The above copyright notice and this permission notice shall be included in all
+ copies or substantial portions of the Software.
+ .
+ THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+ SOFTWARE.
+
+License: BOSL-1+ with Zcash exception
+ This package ("Original Work") is licensed under the terms of the Bootstrap Open
+ Source License, version 1.0, or at your option, any later version ("BOSL"). See
+ the file ./LICENSE-BOSL for the terms of the Bootstrap Open Source Licence,
+ version 1.0.
+ .
+ Only if this Original Work is included as part of the distribution of one of the
+ following projects ("the Project"):
+ .
+ - The Zcash projects published by the Electric Coin Company,
+ - The Zebra project published by the Zcash Foundation,
+ .
+ then License is granted to use this package under the BOSL as modified by the
+ following clarification and special exception. This exception applies only to
+ the Original Work when linked or combined with the Project and not to the
+ Original Work when linked, combined, or included in or with any other software
+ or project or on a standalone basis.
+ .
+     Under the terms of the BOSL, linking or combining this Original Work with
+     the Project creates a Derivative Work based upon the Original Work and the
+     terms of the BOSL thus apply to both the Original Work and that Derivative
+     Work. As a special exception to the BOSL, and to allow this Original Work to
+     be linked and combined with the Project without having to apply the BOSL to
+     the other portions of the Project, you are granted permission to link or
+     combine this Original Work with the Project and to copy and distribute the
+     resulting work ("Resulting Work") under the open source license applicable
+     to the Project ("Project License"), provided that any portions of this
+     Original Work included in the Resulting Work remain subject to the BOSL. For
+     clarity, you may continue to treat all other portions of the Project under
+     the Project License, provided that you comply with the BOSL with respect to
+     the Original Work. If you modify this Original Work, your version of the
+     Original Work must remain under the BOSL. You may also extend this exception
+     to your version, but you are not obligated to do so. If you do not wish to
+     do so, delete this exception statement from your version.
+
+License: BOSL-1
+ =======================================================
+ Bootstrap Open Source Licence ("BOSL") v. 1.0
+ =======================================================
+ This Bootstrap Open Source Licence (the "License") applies to any original work
+ of authorship (the "Original Work") whose owner (the "Licensor") has placed the
+ following licensing notice adjacent to the copyright notice for the Original
+ Work:
+ .
+ *Licensed under the Bootstrap Open Source Licence version 1.0*
+ .
+ 1.  **Grant of Copyright License.** Licensor grants You a worldwide,
+     royalty-free, non-exclusive, sublicensable license, for the duration of the
+     copyright in the Original Work, to do the following:
+ .
+         a. to reproduce the Original Work in copies, either alone or as part of
+         a collective work;
+ .
+         b. to translate, adapt, alter, transform, modify, or arrange the
+         Original Work, thereby creating derivative works ("Derivative Works")
+         based upon the Original Work;
+ .
+         c. to distribute or communicate copies of the Original Work and
+         Derivative Works to the public, provided that prior to any such
+         distribution or communication You first place a machine-readable copy
+         of the Source Code of the Original Work and such Derivative Works that
+         You intend to distribute or communicate in an information repository
+         reasonably calculated to permit inexpensive and convenient access
+         thereto by the public (“Information Repository�) for as long as You
+         continue to distribute or communicate said copies, accompanied by an
+         irrevocable offer to license said copies to the public free of charge
+         under this License, said offer valid starting no later than 12 months
+         after You first distribute or communicate said copies;
+ .
+     d. to perform the Original Work publicly; and
+ .
+     e. to display the Original Work publicly.
+ .
+ 2.  **Grant of Patent License.** Licensor grants You a worldwide, royalty-free,
+ non-exclusive, sublicensable license, under patent claims owned or controlled
+ by the Licensor that are embodied in the Original Work as furnished by the
+ Licensor, for the duration of the patents, to make, use, sell, offer for sale,
+ have made, and import the Original Work and Derivative Works.
+ .
+ 3.  **Grant of Source Code License.** The "Source Code" for a work means the
+ preferred form of the work for making modifications to it and all available
+ documentation describing how to modify the work. Licensor agrees to provide a
+ machine-readable copy of the Source Code of the Original Work along with each
+ copy of the Original Work that Licensor distributes. Licensor reserves the
+ right to satisfy this obligation by placing a machine-readable copy of said
+ Source Code in an Information Repository for as long as Licensor continues to
+ distribute the Original Work.
+ .
+ 4.  **Exclusions From License Grant.** Neither the names of Licensor, nor the
+ names of any contributors to the Original Work, nor any of their trademarks or
+ service marks, may be used to endorse or promote products derived from this
+ Original Work without express prior permission of the Licensor. Except as
+ expressly stated herein, nothing in this License grants any license to
+ Licensor's trademarks, copyrights, patents, trade secrets or any other
+ intellectual property. No patent license is granted to make, use, sell, offer
+ for sale, have made, or import embodiments of any patent claims other than the
+ licensed claims defined in Section 2. No license is granted to the trademarks
+ of Licensor even if such marks are included in the Original Work. Nothing in
+ this License shall be interpreted to prohibit Licensor from licensing under
+ terms different from this License any Original Work that Licensor otherwise
+ would have a right to license.
+ .
+ 5.  **External Deployment.** The term "External Deployment" means the use,
+ distribution, or communication of the Original Work or Derivative Works in any
+ way such that the Original Work or Derivative Works may be used by anyone other
+ than You, whether those works are distributed or communicated to those persons
+ or made available as an application intended for use over a network. As an
+ express condition for the grants of license hereunder, You must treat any
+ External Deployment by You of the Original Work or a Derivative Work as a
+ distribution under section 1(c).
+ .
+ 6.  **Attribution Rights.** You must retain, in the Source Code of any
+ Derivative Works that You create, all copyright, patent, or trademark notices
+ from the Source Code of the Original Work, as well as any notices of licensing
+ and any descriptive text identified therein as an "Attribution Notice." You
+ must cause the Source Code for any Derivative Works that You create to carry a
+ prominent Attribution Notice reasonably calculated to inform recipients that
+ You have modified the Original Work.
+ .
+ 7.  **Warranty of Provenance and Disclaimer of Warranty.** Licensor warrants
+ that the copyright in and to the Original Work and the patent rights granted
+ herein by Licensor are owned by the Licensor or are sublicensed to You under
+ the terms of this License with the permission of the contributor(s) of those
+ copyrights and patent rights. Except as expressly stated in the immediately
+ preceding sentence, the Original Work is provided under this License on an "AS
+ IS" BASIS and WITHOUT WARRANTY, either express or implied, including, without
+ limitation, the warranties of non-infringement, merchantability or fitness for
+ a particular purpose. THE ENTIRE RISK AS TO THE QUALITY OF THE ORIGINAL WORK IS
+ WITH YOU. This DISCLAIMER OF WARRANTY constitutes an essential part of this
+ License. No license to the Original Work is granted by this License except
+ under this disclaimer.
+ .
+ 8.  **Limitation of Liability.** Under no circumstances and under no legal
+ theory, whether in tort (including negligence), contract, or otherwise, shall
+ the Licensor be liable to anyone for any indirect, special, incidental, or
+ consequential damages of any character arising as a result of this License or
+ the use of the Original Work including, without limitation, damages for loss of
+ goodwill, work stoppage, computer failure or malfunction, or any and all other
+ commercial damages or losses. This limitation of liability shall not apply to
+ the extent applicable law prohibits such limitation.
+ .
+ 9.  **Acceptance and Termination.** If, at any time, You expressly assented to
+ this License, that assent indicates your clear and irrevocable acceptance of
+ this License and all of its terms and conditions. If You distribute or
+ communicate copies of the Original Work or a Derivative Work, You must make a
+ reasonable effort under the circumstances to obtain the express assent of
+ recipients to the terms of this License. This License conditions your rights to
+ undertake the activities listed in Section 1, including your right to create
+ Derivative Works based upon the Original Work, and doing so without honoring
+ these terms and conditions is prohibited by copyright law and international
+ treaty. Nothing in this License is intended to affect copyright exceptions and
+ limitations (including 'fair use' or 'fair dealing'). This License shall
+ terminate immediately and You may no longer exercise any of the rights granted
+ to You by this License upon your failure to honor the conditions in Section
+ 1(c).
+ .
+ 10.  **Termination for Patent Action.** This License shall terminate
+ automatically and You may no longer exercise any of the rights granted to You
+ by this License as of the date You commence an action, including a cross-claim
+ or counterclaim, against Licensor or any licensee alleging that the Original
+ Work infringes a patent. This termination provision shall not apply for an
+ action alleging patent infringement by combinations of the Original Work with
+ other software or hardware.
+ .
+ 11.  **Jurisdiction, Venue and Governing Law.** Any action or suit relating to
+ this License may be brought only in the courts of a jurisdiction wherein the
+ Licensor resides or in which Licensor conducts its primary business, and under
+ the laws of that jurisdiction excluding its conflict-of-law provisions. The
+ application of the United Nations Convention on Contracts for the International
+ Sale of Goods is expressly excluded. Any use of the Original Work outside the
+ scope of this License or after its termination shall be subject to the
+ requirements and penalties of copyright or patent law in the appropriate
+ jurisdiction. This section shall survive the termination of this License.
+ .
+ 12.  **Attorneys' Fees.** In any action to enforce the terms of this License or
+ seeking damages relating thereto, the prevailing party shall be entitled to
+ recover its costs and expenses, including, without limitation, reasonable
+ attorneys' fees and costs incurred in connection with such action, including
+ any appeal of such action. This section shall survive the termination of this
+ License.
+ .
+ 13.  **Miscellaneous.** If any provision of this License is held to be
+ unenforceable, such provision shall be reformed only to the extent necessary to
+ make it enforceable.
+ .
+ 14.  **Definition of "You" in This License.** "You" throughout this License,
+ whether in upper or lower case, means an individual or a legal entity
+ exercising rights under, and complying with all of the terms of, this License.
+ For legal entities, "You" includes any entity that controls, is controlled by,
+ or is under common control with you. For purposes of this definition, "control"
+ means (i) the power, direct or indirect, to cause the direction or management
+ of such entity, whether by contract or otherwise, or (ii) ownership of fifty
+ percent (50%) or more of the outstanding shares, or (iii) beneficial ownership
+ of such entity.
+ .
+ 15.  **Right to Use.** You may use the Original Work in all ways not otherwise
+ restricted or conditioned by this License or by law, and Licensor promises not
+ to interfere with or be responsible for such uses by You.
+ .
+ 16.  **Modification of This License.** This License is Copyright © 2007 Zooko
+ Wilcox-O'Hearn. Permission is granted to copy, distribute, or communicate this
+ License without modification. Nothing in this License permits You to modify
+ this License as applied to the Original Work or to Derivative Works. However,
+ You may modify the text of this License and copy, distribute or communicate
+ your modified version (the "Modified License") and apply it to other original
+ works of authorship subject to the following conditions: (i) You may not
+ indicate in any way that your Modified License is the "Bootstrap Open Source
+ Licence" or "BOSL" and you may not use those names in the name of your Modified
+ License; and (ii) You must replace the notice specified in the first paragraph
+ above with the notice "Licensed under <insert your license name here>" or with
+ a notice of your own that is not confusingly similar to the notice in this
+ License.
diff --git a/depend/zcash/contrib/debian/examples/zcash.conf b/depend/zcash/contrib/debian/examples/zcash.conf
new file mode 100644
index 000000000..0293500d0
--- /dev/null
+++ b/depend/zcash/contrib/debian/examples/zcash.conf
@@ -0,0 +1,129 @@
+##
+## zcash.conf configuration file. Lines beginning with # are comments.
+##
+
+# Network-related settings:
+
+# Run on the test network instead of the real zcash network.
+#testnet=0
+
+# Run a regression test network
+#regtest=0
+
+# Connect via a SOCKS5 proxy
+#proxy=127.0.0.1:9050
+
+# Bind to given address and always listen on it. Use [host]:port notation for IPv6
+#bind=<addr>
+
+# Bind to given address and whitelist peers connecting to it. Use [host]:port notation for IPv6
+#whitebind=<addr>
+
+##############################################################
+##            Quick Primer on addnode vs connect            ##
+##  Let's say for instance you use addnode=4.2.2.4          ##
+##  addnode will connect you to and tell you about the      ##
+##    nodes connected to 4.2.2.4.  In addition it will tell ##
+##    the other nodes connected to it that you exist so     ##
+##    they can connect to you.                              ##
+##  connect will not do the above when you 'connect' to it. ##
+##    It will *only* connect you to 4.2.2.4 and no one else.##
+##                                                          ##
+##  So if you're behind a firewall, or have other problems  ##
+##  finding nodes, add some using 'addnode'.                ##
+##                                                          ##
+##  If you want to stay private, use 'connect' to only      ##
+##  connect to "trusted" nodes.                             ##
+##                                                          ##
+##  If you run multiple nodes on a LAN, there's no need for ##
+##  all of them to open lots of connections.  Instead       ##
+##  'connect' them all to one node that is port forwarded   ##
+##  and has lots of connections.                            ##
+##       Thanks goes to [Noodle] on Freenode.               ##
+##############################################################
+
+# Use as many addnode= settings as you like to connect to specific peers
+#addnode=69.164.218.197
+#addnode=10.0.0.2:8233
+
+# Alternatively use as many connect= settings as you like to connect ONLY to specific peers
+#connect=69.164.218.197
+#connect=10.0.0.1:8233
+
+# Listening mode, enabled by default except when 'connect' is being used
+#listen=1
+
+# Maximum number of inbound+outbound connections.
+#maxconnections=
+
+#
+# JSON-RPC options (for controlling a running Zcash/zcashd process)
+#
+
+# server=1 tells zcashd to accept JSON-RPC commands (set as default if not specified)
+#server=1
+
+# Bind to given address to listen for JSON-RPC connections. Use [host]:port notation for IPv6.
+# This option can be specified multiple times (default: bind to all interfaces)
+#rpcbind=<addr>
+
+# You must set rpcuser and rpcpassword to secure the JSON-RPC api
+#rpcuser=Ulysses
+#rpcpassword=YourSuperGreatPasswordNumber_DO_NOT_USE_THIS_OR_YOU_WILL_GET_ROBBED_385593
+
+# How many seconds zcash will wait for a complete RPC HTTP request.
+# after the HTTP connection is established. 
+#rpcclienttimeout=30
+
+# By default, only RPC connections from localhost are allowed.
+# Specify as many rpcallowip= settings as you like to allow connections from other hosts,
+# either as a single IPv4/IPv6 or with a subnet specification.
+
+# NOTE: opening up the RPC port to hosts outside your local trusted network is NOT RECOMMENDED,
+# because the rpcpassword is transmitted over the network unencrypted and also because anyone 
+# that can authenticate on the RPC port can steal your keys + take over the account running zcashd
+# For more information see https://github.com/zcash/zcash/issues/1497
+
+#rpcallowip=10.1.1.34/255.255.255.0
+#rpcallowip=1.2.3.4/24
+#rpcallowip=2001:db8:85a3:0:0:8a2e:370:7334/96
+
+# Listen for RPC connections on this TCP port:
+#rpcport=8232
+
+# You can use Zcash or zcashd to send commands to Zcash/zcashd
+# running on another host using this option:
+#rpcconnect=127.0.0.1
+
+# Transaction Fee
+
+# Send transactions as zero-fee transactions if possible (default: 0)
+#sendfreetransactions=0
+
+# Create transactions that have enough fees (or priority) so they are likely to # begin confirmation within n blocks (default: 1).
+# This setting is overridden by the -paytxfee option.
+#txconfirmtarget=n
+
+# Miscellaneous options
+
+# Enable attempt to mine zcash.
+#gen=0
+
+# Set the number of threads to be used for mining zcash (-1 = all cores).
+#genproclimit=1
+
+# Specify a different Equihash solver (e.g. "tromp") to try to mine zcash
+# faster when gen=1.
+#equihashsolver=default
+
+# Pre-generate this many public/private key pairs, so wallet backups will be valid for
+# both prior transactions and several dozen future transactions.
+#keypool=100
+
+# Pay an optional transaction fee every time you send zcash.  Transactions with fees
+# are more likely than free transactions to be included in generated blocks, so may
+# be validated sooner. This setting does not affect private transactions created with 
+# 'z_sendmany'.
+#paytxfee=0.00
+
+
diff --git a/depend/zcash/contrib/debian/postinst b/depend/zcash/contrib/debian/postinst
new file mode 100755
index 000000000..2e6ff8a8d
--- /dev/null
+++ b/depend/zcash/contrib/debian/postinst
@@ -0,0 +1,39 @@
+#!/bin/sh
+# postinst script for zcash
+#
+# see: dh_installdeb(1)
+
+set -e
+
+# summary of how this script can be called:
+#        * <postinst> `configure' <most-recently-configured-version>
+#        * <old-postinst> `abort-upgrade' <new version>
+#        * <conflictor's-postinst> `abort-remove' `in-favour' <package>
+#          <new-version>
+#        * <postinst> `abort-remove'
+#        * <deconfigured's-postinst> `abort-deconfigure' `in-favour'
+#          <failed-install-package> <version> `removing'
+#          <conflicting-package> <version>
+# for details, see https://www.debian.org/doc/debian-policy/ or
+# the debian-policy package
+
+
+case "$1" in
+    configure)
+    ;;
+
+    abort-upgrade|abort-remove|abort-deconfigure)
+    ;;
+
+    *)
+        echo "postinst called with unknown argument \`$1'" >&2
+        exit 1
+    ;;
+esac
+
+# dh_installdeb will replace this with shell code automatically
+# generated by other debhelper scripts.
+
+#DEBHELPER#
+
+exit 0
diff --git a/depend/zcash/contrib/debian/postrm b/depend/zcash/contrib/debian/postrm
new file mode 100755
index 000000000..bb442a682
--- /dev/null
+++ b/depend/zcash/contrib/debian/postrm
@@ -0,0 +1,37 @@
+#!/bin/sh
+# postrm script for zcash
+#
+# see: dh_installdeb(1)
+
+set -e
+
+# summary of how this script can be called:
+#        * <postrm> `remove'
+#        * <postrm> `purge'
+#        * <old-postrm> `upgrade' <new-version>
+#        * <new-postrm> `failed-upgrade' <old-version>
+#        * <new-postrm> `abort-install'
+#        * <new-postrm> `abort-install' <old-version>
+#        * <new-postrm> `abort-upgrade' <old-version>
+#        * <disappearer's-postrm> `disappear' <overwriter>
+#          <overwriter-version>
+# for details, see https://www.debian.org/doc/debian-policy/ or
+# the debian-policy package
+
+
+case "$1" in
+    purge|remove|upgrade|failed-upgrade|abort-install|abort-upgrade|disappear)
+    ;;
+
+    *)
+        echo "postrm called with unknown argument \`$1'" >&2
+        exit 1
+    ;;
+esac
+
+# dh_installdeb will replace this with shell code automatically
+# generated by other debhelper scripts.
+
+#DEBHELPER#
+
+exit 0
diff --git a/depend/zcash/contrib/debian/preinst b/depend/zcash/contrib/debian/preinst
new file mode 100755
index 000000000..7587b4a88
--- /dev/null
+++ b/depend/zcash/contrib/debian/preinst
@@ -0,0 +1,35 @@
+#!/bin/sh
+# preinst script for zcash
+#
+# see: dh_installdeb(1)
+
+set -e
+
+# summary of how this script can be called:
+#        * <new-preinst> `install'
+#        * <new-preinst> `install' <old-version>
+#        * <new-preinst> `upgrade' <old-version>
+#        * <old-preinst> `abort-upgrade' <new-version>
+# for details, see https://www.debian.org/doc/debian-policy/ or
+# the debian-policy package
+
+
+case "$1" in
+    install|upgrade)
+    ;;
+
+    abort-upgrade)
+    ;;
+
+    *)
+        echo "preinst called with unknown argument \`$1'" >&2
+        exit 1
+    ;;
+esac
+
+# dh_installdeb will replace this with shell code automatically
+# generated by other debhelper scripts.
+
+#DEBHELPER#
+
+exit 0
diff --git a/depend/zcash/contrib/debian/prerm b/depend/zcash/contrib/debian/prerm
new file mode 100755
index 000000000..6a4f8c033
--- /dev/null
+++ b/depend/zcash/contrib/debian/prerm
@@ -0,0 +1,38 @@
+#!/bin/sh
+# prerm script for zcash
+#
+# see: dh_installdeb(1)
+
+set -e
+
+# summary of how this script can be called:
+#        * <prerm> `remove'
+#        * <old-prerm> `upgrade' <new-version>
+#        * <new-prerm> `failed-upgrade' <old-version>
+#        * <conflictor's-prerm> `remove' `in-favour' <package> <new-version>
+#        * <deconfigured's-prerm> `deconfigure' `in-favour'
+#          <package-being-installed> <version> `removing'
+#          <conflicting-package> <version>
+# for details, see https://www.debian.org/doc/debian-policy/ or
+# the debian-policy package
+
+
+case "$1" in
+    remove|upgrade|deconfigure)
+    ;;
+
+    failed-upgrade)
+    ;;
+
+    *)
+        echo "prerm called with unknown argument \`$1'" >&2
+        exit 1
+    ;;
+esac
+
+# dh_installdeb will replace this with shell code automatically
+# generated by other debhelper scripts.
+
+#DEBHELPER#
+
+exit 0
diff --git a/depend/zcash/contrib/debian/rules b/depend/zcash/contrib/debian/rules
new file mode 100755
index 000000000..b79cce595
--- /dev/null
+++ b/depend/zcash/contrib/debian/rules
@@ -0,0 +1,25 @@
+#!/usr/bin/make -f
+# See debhelper(7) (uncomment to enable)
+# output every command that modifies files on the build system.
+#export DH_VERBOSE = 1
+
+
+# see FEATURE AREAS in dpkg-buildflags(1)
+#export DEB_BUILD_MAINT_OPTIONS = hardening=+all
+
+# see ENVIRONMENT in dpkg-buildflags(1)
+# package maintainers to append CFLAGS
+#export DEB_CFLAGS_MAINT_APPEND  = -Wall -pedantic
+# package maintainers to append LDFLAGS
+#export DEB_LDFLAGS_MAINT_APPEND = -Wl,--as-needed
+
+
+%:
+	dh $@ --with autotools_dev
+
+
+# dh_make generated override targets
+# This is example for Cmake (See https://bugs.debian.org/641051 )
+#override_dh_auto_configure:
+#	dh_auto_configure -- #	-DCMAKE_LIBRARY_PATH=$(DEB_HOST_MULTIARCH)
+
diff --git a/depend/zcash/contrib/debian/zcash.examples b/depend/zcash/contrib/debian/zcash.examples
new file mode 100644
index 000000000..924659c02
--- /dev/null
+++ b/depend/zcash/contrib/debian/zcash.examples
@@ -0,0 +1 @@
+DEBIAN/examples/zcash.conf
diff --git a/depend/zcash/contrib/debian/zcash.install b/depend/zcash/contrib/debian/zcash.install
new file mode 100644
index 000000000..b39eaeeb3
--- /dev/null
+++ b/depend/zcash/contrib/debian/zcash.install
@@ -0,0 +1,3 @@
+usr/bin/zcashd
+usr/bin/zcash-cli
+usr/bin/zcash-fetch-params
diff --git a/depend/zcash/contrib/debian/zcash.manpages b/depend/zcash/contrib/debian/zcash.manpages
new file mode 100644
index 000000000..a1115f679
--- /dev/null
+++ b/depend/zcash/contrib/debian/zcash.manpages
@@ -0,0 +1,2 @@
+DEBIAN/manpages/zcash-cli.1
+DEBIAN/manpages/zcashd.1
diff --git a/depend/zcash/contrib/devtools/README.md b/depend/zcash/contrib/devtools/README.md
new file mode 100644
index 000000000..e16e6b5b0
--- /dev/null
+++ b/depend/zcash/contrib/devtools/README.md
@@ -0,0 +1,102 @@
+Contents
+===========
+This directory contains tools for developers working on this repository.
+
+github-merge.sh
+==================
+
+A small script to automate merging pull-requests securely and sign them with GPG.
+
+For example:
+
+  ./github-merge.sh bitcoin/bitcoin 3077
+
+(in any git repository) will help you merge pull request #3077 for the
+bitcoin/bitcoin repository.
+
+What it does:
+* Fetch master and the pull request.
+* Locally construct a merge commit.
+* Show the diff that merge results in.
+* Ask you to verify the resulting source tree (so you can do a make
+check or whatever).
+* Ask you whether to GPG sign the merge commit.
+* Ask you whether to push the result upstream.
+
+This means that there are no potential race conditions (where a
+pullreq gets updated while you're reviewing it, but before you click
+merge), and when using GPG signatures, that even a compromised github
+couldn't mess with the sources.
+
+Setup
+---------
+Configuring the github-merge tool for the bitcoin repository is done in the following way:
+
+    git config githubmerge.repository bitcoin/bitcoin
+    git config githubmerge.testcmd "make -j4 check" (adapt to whatever you want to use for testing)
+    git config --global user.signingkey mykeyid (if you want to GPG sign)
+
+fix-copyright-headers.py
+===========================
+
+Every year newly updated files need to have its copyright headers updated to reflect the current year.
+If you run this script from src/ it will automatically update the year on the copyright header for all
+.cpp and .h files if these have a git commit from the current year.
+
+For example a file changed in 2014 (with 2014 being the current year):
+```// Copyright (c) 2009-2013 The Bitcoin Core developers```
+
+would be changed to:
+```// Copyright (c) 2009-2014 The Bitcoin Core developers```
+
+symbol-check.py
+==================
+
+A script to check that the (Linux) executables produced by gitian only contain
+allowed gcc, glibc and libstdc++ version symbols.  This makes sure they are
+still compatible with the minimum supported Linux distribution versions.
+
+Example usage after a gitian build:
+
+    find ../gitian-builder/build -type f -executable | xargs python contrib/devtools/symbol-check.py 
+
+If only supported symbols are used the return value will be 0 and the output will be empty.
+
+If there are 'unsupported' symbols, the return value will be 1 a list like this will be printed:
+
+    .../64/test_bitcoin: symbol memcpy from unsupported version GLIBC_2.14
+    .../64/test_bitcoin: symbol __fdelt_chk from unsupported version GLIBC_2.15
+    .../64/test_bitcoin: symbol std::out_of_range::~out_of_range() from unsupported version GLIBCXX_3.4.15
+    .../64/test_bitcoin: symbol _ZNSt8__detail15_List_nod from unsupported version GLIBCXX_3.4.15
+
+update-translations.py
+=======================
+
+Run this script from the root of the repository to update all translations from transifex.
+It will do the following automatically:
+
+- fetch all translations
+- post-process them into valid and committable format
+- add missing translations to the build system (TODO)
+
+See doc/translation-process.md for more information.
+
+gen-manpages.sh
+===============
+
+A small script to automatically create manpages in ../../doc/man by running the release binaries with the -help option.
+This requires help2man which can be found at: https://www.gnu.org/software/help2man/
+
+git-subtree-check.sh
+====================
+
+Run this script from the root of the repository to verify that a subtree matches the contents of
+the commit it claims to have been updated to.
+
+To use, make sure that you have fetched the upstream repository branch in which the subtree is
+maintained:
+* for src/secp256k1: https://github.com/bitcoin/secp256k1.git (branch master)
+* for sec/leveldb: https://github.com/bitcoin/leveldb.git (branch bitcoin-fork)
+
+Usage: git-subtree-check.sh DIR COMMIT
+COMMIT may be omitted, in which case HEAD is used.
diff --git a/depend/zcash/contrib/devtools/fix-copyright-headers.py b/depend/zcash/contrib/devtools/fix-copyright-headers.py
new file mode 100755
index 000000000..14b6de706
--- /dev/null
+++ b/depend/zcash/contrib/devtools/fix-copyright-headers.py
@@ -0,0 +1,53 @@
+#!/usr/bin/env python3
+'''
+Run this script inside of src/ and it will look for all the files
+that were changed this year that still have the last year in the
+copyright headers, and it will fix the headers on that file using
+a perl regex one liner.
+
+For example: if it finds something like this and we're in 2014
+
+// Copyright (c) 2009-2013 The Bitcoin Core developers
+
+it will change it to
+
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+
+It will do this for all the files in the folder and its children.
+
+Author: @gubatron
+'''
+import os
+import time
+
+year = time.gmtime()[0]
+last_year = year - 1
+command = "perl -pi -e 's/%s The Bitcoin/%s The Bitcoin/' %s"
+listFilesCommand = "find . | grep %s"
+
+extensions = [".cpp",".h"]
+
+def getLastGitModifiedDate(filePath):
+  gitGetLastCommitDateCommand = "git log " + filePath +" | grep Date | head -n 1"
+  p = os.popen(gitGetLastCommitDateCommand)
+  result = ""
+  for l in p:
+    result = l
+    break
+  result = result.replace("\n","")
+  return result
+
+n=1
+for extension in extensions:
+  foundFiles = os.popen(listFilesCommand % extension)
+  for filePath in foundFiles:
+    filePath = filePath[1:-1]
+    if filePath.endswith(extension):
+      filePath = os.getcwd() + filePath
+      modifiedTime = getLastGitModifiedDate(filePath)
+      if len(modifiedTime) > 0 and str(year) in modifiedTime:
+        print(n,"Last Git Modified: ", modifiedTime, " - ", filePath)
+        os.popen(command % (last_year,year,filePath))
+        n = n + 1
+
+
diff --git a/depend/zcash/contrib/devtools/gen-manpages.sh b/depend/zcash/contrib/devtools/gen-manpages.sh
new file mode 100755
index 000000000..fb9496b54
--- /dev/null
+++ b/depend/zcash/contrib/devtools/gen-manpages.sh
@@ -0,0 +1,40 @@
+#!/usr/bin/env bash
+
+export LC_ALL=C
+TOPDIR=${TOPDIR:-$(git rev-parse --show-toplevel)}
+SRCDIR=${SRCDIR:-$TOPDIR/src}
+MANDIR=${MANDIR:-$TOPDIR/doc/man}
+
+ZCASHD=${ZCASHD:-$SRCDIR/zcashd}
+ZCASHD_WALLET_TOOL=${ZCASHD_WALLET_TOOL:-$SRCDIR/zcashd-wallet-tool}
+ZCASHCLI=${ZCASHCLI:-$SRCDIR/zcash-cli}
+ZCASHTX=${ZCASHTX:-$SRCDIR/zcash-tx}
+
+[ ! -x $ZCASHD ] && echo "$ZCASHD not found or not executable." && exit 1
+
+# The autodetected version git tag can screw up manpage output a little bit
+read -r -a ZECVERSTR <<< "$($ZCASHCLI --version | head -n1 | awk '{ print $NF }')"
+read -r -a ZECVER <<< "$(echo $ZECVERSTR | awk -F- '{ OFS="-"; NF--; print $0; }')"
+read -r -a ZECCOMMIT <<< "$(echo $ZECVERSTR | awk -F- '{ print $NF }')"
+
+# Create a footer file with copyright content.
+# This gets autodetected fine for zcashd if --version-string is not set,
+# but has different outcomes for zcash-cli.
+echo "[COPYRIGHT]" > footer.h2m
+$ZCASHD --version | sed -n '1!p' >> footer.h2m
+grep -v "Bitcoin Core Developers" footer.h2m >footer-no-bitcoin-copyright.h2m
+
+for cmd in $ZCASHD $ZCASHCLI $ZCASHTX; do
+  cmdname="${cmd##*/}"
+  help2man -N --version-string=$ZECVER --include=footer.h2m -o ${MANDIR}/${cmdname}.1 ${cmd}
+  sed -i "s/\\\-$ZECCOMMIT//g" ${MANDIR}/${cmdname}.1
+done
+
+for cmd in $ZCASHD_WALLET_TOOL; do
+  cmdname="${cmd##*/}"
+  help2man -N --version-string=$ZECVER --include=footer-no-bitcoin-copyright.h2m -o ${MANDIR}/${cmdname}.1 ${cmd}
+  sed -i "s/\\\-$ZECCOMMIT//g" ${MANDIR}/${cmdname}.1
+done
+
+rm -f footer.h2m
+rm -f footer-no-bitcoin-copyright.h2m
diff --git a/depend/zcash/contrib/devtools/github-merge.sh b/depend/zcash/contrib/devtools/github-merge.sh
new file mode 100755
index 000000000..ec7a1f4c4
--- /dev/null
+++ b/depend/zcash/contrib/devtools/github-merge.sh
@@ -0,0 +1,181 @@
+#!/bin/bash
+
+# This script will locally construct a merge commit for a pull request on a
+# github repository, inspect it, sign it and optionally push it.
+
+# The following temporary branches are created/overwritten and deleted:
+# * pull/$PULL/base (the current master we're merging onto)
+# * pull/$PULL/head (the current state of the remote pull request)
+# * pull/$PULL/merge (github's merge)
+# * pull/$PULL/local-merge (our merge)
+
+# In case of a clean merge that is accepted by the user, the local branch with
+# name $BRANCH is overwritten with the merged result, and optionally pushed.
+
+REPO="$(git config --get githubmerge.repository)"
+if [[ "d$REPO" == "d" ]]; then
+  echo "ERROR: No repository configured. Use this command to set:" >&2
+  echo "git config githubmerge.repository <owner>/<repo>" >&2
+  echo "In addition, you can set the following variables:" >&2
+  echo "- githubmerge.host (default git@github.com)" >&2
+  echo "- githubmerge.branch (default master)" >&2
+  echo "- githubmerge.testcmd (default none)" >&2
+  exit 1
+fi
+
+HOST="$(git config --get githubmerge.host)"
+if [[ "d$HOST" == "d" ]]; then
+  HOST="git@github.com"
+fi
+
+BRANCH="$(git config --get githubmerge.branch)"
+if [[ "d$BRANCH" == "d" ]]; then
+  BRANCH="master"
+fi
+
+TESTCMD="$(git config --get githubmerge.testcmd)"
+
+PULL="$1"
+
+if [[ "d$PULL" == "d" ]]; then
+  echo "Usage: $0 pullnumber [branch]" >&2
+  exit 2
+fi
+
+if [[ "d$2" != "d" ]]; then
+  BRANCH="$2"
+fi
+
+# Initialize source branches.
+git checkout -q "$BRANCH"
+if git fetch -q "$HOST":"$REPO" "+refs/pull/$PULL/*:refs/heads/pull/$PULL/*"; then
+  if ! git log -q -1 "refs/heads/pull/$PULL/head" >/dev/null 2>&1; then
+    echo "ERROR: Cannot find head of pull request #$PULL on $HOST:$REPO." >&2
+    exit 3
+  fi
+  if ! git log -q -1 "refs/heads/pull/$PULL/merge" >/dev/null 2>&1; then
+    echo "ERROR: Cannot find merge of pull request #$PULL on $HOST:$REPO." >&2
+    exit 3
+  fi
+else
+  echo "ERROR: Cannot find pull request #$PULL on $HOST:$REPO." >&2
+  exit 3
+fi
+if git fetch -q "$HOST":"$REPO" +refs/heads/"$BRANCH":refs/heads/pull/"$PULL"/base; then
+  true
+else
+  echo "ERROR: Cannot find branch $BRANCH on $HOST:$REPO." >&2
+  exit 3
+fi
+git checkout -q pull/"$PULL"/base
+git branch -q -D pull/"$PULL"/local-merge 2>/dev/null
+git checkout -q -b pull/"$PULL"/local-merge
+TMPDIR="$(mktemp -d -t ghmXXXXX)"
+
+function cleanup() {
+  git checkout -q "$BRANCH"
+  git branch -q -D pull/"$PULL"/head 2>/dev/null
+  git branch -q -D pull/"$PULL"/base 2>/dev/null
+  git branch -q -D pull/"$PULL"/merge 2>/dev/null
+  git branch -q -D pull/"$PULL"/local-merge 2>/dev/null
+  rm -rf "$TMPDIR"
+}
+
+# Create unsigned merge commit.
+(
+  echo "Merge pull request #$PULL"
+  echo ""
+  git log --no-merges --topo-order --pretty='format:%h %s (%an)' pull/"$PULL"/base..pull/"$PULL"/head
+)>"$TMPDIR/message"
+if git merge -q --commit --no-edit --no-ff -m "$(<"$TMPDIR/message")" pull/"$PULL"/head; then
+  if [ "d$(git log --pretty='format:%s' -n 1)" != "dMerge pull request #$PULL" ]; then
+    echo "ERROR: Creating merge failed (already merged?)." >&2
+    cleanup
+    exit 4
+  fi
+else
+  echo "ERROR: Cannot be merged cleanly." >&2
+  git merge --abort
+  cleanup
+  exit 4
+fi
+
+# Run test command if configured.
+if [[ "d$TESTCMD" != "d" ]]; then
+  # Go up to the repository's root.
+  while [ ! -d .git ]; do cd ..; done
+  if ! $TESTCMD; then
+    echo "ERROR: Running $TESTCMD failed." >&2
+    cleanup
+    exit 5
+  fi
+  # Show the created merge.
+  git diff pull/"$PULL"/merge..pull/"$PULL"/local-merge >"$TMPDIR"/diff
+  git diff pull/"$PULL"/base..pull/"$PULL"/local-merge
+  if [[ "$(<"$TMPDIR"/diff)" != "" ]]; then
+    echo "WARNING: merge differs from github!" >&2
+    read -p "Type 'ignore' to continue. " -r >&2
+    if [[ "d$REPLY" =~ ^d[iI][gG][nN][oO][rR][eE]$ ]]; then
+      echo "Difference with github ignored." >&2
+    else
+      cleanup
+      exit 6
+    fi
+  fi
+  read -p "Press 'd' to accept the diff. " -n 1 -r >&2
+  echo
+  if [[ "d$REPLY" =~ ^d[dD]$ ]]; then
+    echo "Diff accepted." >&2
+  else
+    echo "ERROR: Diff rejected." >&2
+    cleanup
+    exit 6
+  fi
+else
+  # Verify the result.
+  echo "Dropping you on a shell so you can try building/testing the merged source." >&2
+  echo "Run 'git diff HEAD~' to show the changes being merged." >&2
+  echo "Type 'exit' when done." >&2
+  if [[ -f /etc/debian_version ]]; then # Show pull number in prompt on Debian default prompt
+      export debian_chroot="$PULL"
+  fi
+  bash -i
+  read -p "Press 'm' to accept the merge. " -n 1 -r >&2
+  echo
+  if [[ "d$REPLY" =~ ^d[Mm]$ ]]; then
+    echo "Merge accepted." >&2
+  else
+    echo "ERROR: Merge rejected." >&2
+    cleanup
+    exit 7
+  fi
+fi
+
+# Sign the merge commit.
+read -p "Press 's' to sign off on the merge. " -n 1 -r >&2
+echo
+if [[ "d$REPLY" =~ ^d[Ss]$ ]]; then
+  if [[ "$(git config --get user.signingkey)" == "" ]]; then
+    echo "ERROR: No GPG signing key set, not signing. Set one using:" >&2
+    echo "git config --global user.signingkey <key>" >&2
+    cleanup
+    exit 1
+  else
+    git commit -q --gpg-sign --amend --no-edit
+  fi
+else
+  echo "Not signing off on merge, exiting."
+  cleanup
+  exit 1
+fi
+
+# Clean up temporary branches, and put the result in $BRANCH.
+git checkout -q "$BRANCH"
+git reset -q --hard pull/"$PULL"/local-merge
+cleanup
+
+# Push the result.
+read -p "Type 'push' to push the result to $HOST:$REPO, branch $BRANCH. " -r >&2
+if [[ "d$REPLY" =~ ^d[Pp][Uu][Ss][Hh]$ ]]; then
+  git push "$HOST":"$REPO" refs/heads/"$BRANCH"
+fi
diff --git a/depend/zcash/contrib/devtools/optimize-pngs.py b/depend/zcash/contrib/devtools/optimize-pngs.py
new file mode 100755
index 000000000..3cfd10d24
--- /dev/null
+++ b/depend/zcash/contrib/devtools/optimize-pngs.py
@@ -0,0 +1,73 @@
+#!/usr/bin/env python3
+
+import os
+import sys
+import subprocess
+import hashlib
+from PIL import Image
+
+def file_hash(filename):
+    '''Return hash of raw file contents'''
+    with open(filename, 'rb') as f:
+        return hashlib.sha256(f.read()).hexdigest()
+
+def content_hash(filename):
+    '''Return hash of RGBA contents of image'''
+    i = Image.open(filename)
+    i = i.convert('RGBA')
+    data = i.tostring()
+    return hashlib.sha256(data).hexdigest()
+
+#optimize png, remove various color profiles, remove ancillary chunks (alla) and text chunks (text)
+#pngcrush -brute -ow -rem gAMA -rem cHRM -rem iCCP -rem sRGB -rem alla -rem text
+
+pngcrush = 'pngcrush'
+git = 'git'
+folders = ["src/qt/res/movies", "src/qt/res/icons", "src/qt/res/images"]
+basePath = subprocess.check_output([git, 'rev-parse', '--show-toplevel']).rstrip('\n')
+totalSaveBytes = 0
+
+outputArray = []
+for folder in folders:
+    absFolder=os.path.join(basePath, folder)
+    for file in os.listdir(absFolder):
+        extension = os.path.splitext(file)[1]
+        if extension.lower() == '.png':
+            print("optimizing "+file+"..."),
+            file_path = os.path.join(absFolder, file)
+            fileMetaMap = {'file' : file, 'osize': os.path.getsize(file_path), 'sha256Old' : file_hash(file_path)};
+            fileMetaMap['contentHashPre'] = content_hash(file_path)
+        
+            pngCrushOutput = ""
+            try:
+                pngCrushOutput = subprocess.check_output(
+                        [pngcrush, "-brute", "-ow", "-rem", "gAMA", "-rem", "cHRM", "-rem", "iCCP", "-rem", "sRGB", "-rem", "alla", "-rem", "text", file_path],
+                        stderr=subprocess.STDOUT).rstrip('\n')
+            except:
+                print("pngcrush is not installed, aborting...")
+                sys.exit(0)
+        
+            #verify
+            if "Not a PNG file" in subprocess.check_output([pngcrush, "-n", "-v", file_path], stderr=subprocess.STDOUT):
+                print("PNG file "+file+" is corrupted after crushing, check out pngcursh version")
+                sys.exit(1)
+            
+            fileMetaMap['sha256New'] = file_hash(file_path)
+            fileMetaMap['contentHashPost'] = content_hash(file_path)
+
+            if fileMetaMap['contentHashPre'] != fileMetaMap['contentHashPost']:
+                print("Image contents of PNG file "+file+" before and after crushing don't match")
+                sys.exit(1)
+
+            fileMetaMap['psize'] = os.path.getsize(file_path)
+            outputArray.append(fileMetaMap)
+            print("done\n"),
+
+print("summary:\n+++++++++++++++++")
+for fileDict in outputArray:
+    oldHash = fileDict['sha256Old']
+    newHash = fileDict['sha256New']
+    totalSaveBytes += fileDict['osize'] - fileDict['psize']
+    print(fileDict['file']+"\n  size diff from: "+str(fileDict['osize'])+" to: "+str(fileDict['psize'])+"\n  old sha256: "+oldHash+"\n  new sha256: "+newHash+"\n")
+    
+print("completed. Total reduction: "+str(totalSaveBytes)+" bytes")
diff --git a/depend/zcash/contrib/devtools/rust-deps-graph.sh b/depend/zcash/contrib/devtools/rust-deps-graph.sh
new file mode 100755
index 000000000..7e7804f1c
--- /dev/null
+++ b/depend/zcash/contrib/devtools/rust-deps-graph.sh
@@ -0,0 +1,18 @@
+#!/usr/bin/env bash
+
+export LC_ALL=C
+
+# default arguments are --no-transitive-deps
+ARGS="${*:---no-transitive-deps}"
+echo "Using args: $ARGS"
+
+cargo deps $ARGS | dot \
+    -Earrowhead=vee \
+    -Gratio=0.45 \
+    -Gsize=50 \
+    -Nheight=0.8 \
+    -Nfillcolor=LavenderBlush \
+    -Nstyle=filled \
+    -Nfontsize=18 \
+    -Nmargin=0.05,0.05 \
+    -Tpng > rust-dependency-graph.png
diff --git a/depend/zcash/contrib/devtools/security-check.py b/depend/zcash/contrib/devtools/security-check.py
new file mode 100755
index 000000000..ca1a6e0ea
--- /dev/null
+++ b/depend/zcash/contrib/devtools/security-check.py
@@ -0,0 +1,224 @@
+#!/usr/bin/env python
+'''
+Perform basic ELF security checks on a series of executables.
+Exit status will be 0 if successful, and the program will be silent.
+Otherwise the exit status will be 1 and it will log which executables failed which checks.
+Needs `readelf` (for ELF) and `objdump` (for PE).
+'''
+from __future__ import division,print_function,unicode_literals
+import struct
+import subprocess
+import sys
+import os
+
+READELF_CMD = os.getenv('READELF', '/usr/bin/readelf')
+OBJDUMP_CMD = os.getenv('OBJDUMP', '/usr/bin/objdump')
+NONFATAL = {'HIGH_ENTROPY_VA'} # checks which are non-fatal for now but only generate a warning
+
+def check_ELF_PIE(executable):
+    '''
+    Check for position independent executable (PIE), allowing for address space randomization.
+    '''
+    p = subprocess.Popen([READELF_CMD, '-h', '-W', executable], stdout=subprocess.PIPE, stderr=subprocess.PIPE, stdin=subprocess.PIPE)
+    (stdout, stderr) = p.communicate()
+    if p.returncode:
+        raise IOError('Error opening file')
+
+    ok = False
+    for line in stdout.split(b'\n'):
+        line = line.split()
+        if len(line)>=2 and line[0] == b'Type:' and line[1] == b'DYN':
+            ok = True
+    return ok
+
+def get_ELF_program_headers(executable):
+    '''Return type and flags for ELF program headers'''
+    p = subprocess.Popen([READELF_CMD, '-l', '-W', executable], stdout=subprocess.PIPE, stderr=subprocess.PIPE, stdin=subprocess.PIPE)
+    (stdout, stderr) = p.communicate()
+    if p.returncode:
+        raise IOError('Error opening file')
+    in_headers = False
+    count = 0
+    headers = []
+    for line in stdout.split(b'\n'):
+        if line.startswith(b'Program Headers:'):
+            in_headers = True
+        if line == b'':
+            in_headers = False
+        if in_headers:
+            if count == 1: # header line
+                ofs_typ = line.find(b'Type')
+                ofs_offset = line.find(b'Offset')
+                ofs_flags = line.find(b'Flg')
+                ofs_align = line.find(b'Align')
+                if ofs_typ == -1 or ofs_offset == -1 or ofs_flags == -1 or ofs_align  == -1:
+                    raise ValueError('Cannot parse elfread -lW output')
+            elif count > 1:
+                typ = line[ofs_typ:ofs_offset].rstrip()
+                flags = line[ofs_flags:ofs_align].rstrip()
+                headers.append((typ, flags))
+            count += 1
+    return headers
+
+def check_ELF_NX(executable):
+    '''
+    Check that no sections are writable and executable (including the stack)
+    '''
+    have_wx = False
+    have_gnu_stack = False
+    for (typ, flags) in get_ELF_program_headers(executable):
+        if typ == b'GNU_STACK':
+            have_gnu_stack = True
+        if b'W' in flags and b'E' in flags: # section is both writable and executable
+            have_wx = True
+    return have_gnu_stack and not have_wx
+
+def check_ELF_RELRO(executable):
+    '''
+    Check for read-only relocations.
+    GNU_RELRO program header must exist
+    Dynamic section must have BIND_NOW flag
+    '''
+    have_gnu_relro = False
+    for (typ, flags) in get_ELF_program_headers(executable):
+        # Note: not checking flags == 'R': here as linkers set the permission differently
+        # This does not affect security: the permission flags of the GNU_RELRO program header are ignored, the PT_LOAD header determines the effective permissions.
+        # However, the dynamic linker need to write to this area so these are RW.
+        # Glibc itself takes care of mprotecting this area R after relocations are finished.
+        # See also http://permalink.gmane.org/gmane.comp.gnu.binutils/71347
+        if typ == b'GNU_RELRO':
+            have_gnu_relro = True
+
+    have_bindnow = False
+    p = subprocess.Popen([READELF_CMD, '-d', '-W', executable], stdout=subprocess.PIPE, stderr=subprocess.PIPE, stdin=subprocess.PIPE)
+    (stdout, stderr) = p.communicate()
+    if p.returncode:
+        raise IOError('Error opening file')
+    for line in stdout.split(b'\n'):
+        tokens = line.split()
+        if len(tokens)>1 and tokens[1] == b'(BIND_NOW)' or (len(tokens)>2 and tokens[1] == b'(FLAGS)' and b'BIND_NOW' in tokens[2:]):
+            have_bindnow = True
+    return have_gnu_relro and have_bindnow
+
+def check_ELF_Canary(executable):
+    '''
+    Check for use of stack canary
+    '''
+    p = subprocess.Popen([READELF_CMD, '--dyn-syms', '-W', executable], stdout=subprocess.PIPE, stderr=subprocess.PIPE, stdin=subprocess.PIPE)
+    (stdout, stderr) = p.communicate()
+    if p.returncode:
+        raise IOError('Error opening file')
+    ok = False
+    for line in stdout.split(b'\n'):
+        if b'__stack_chk_fail' in line:
+            ok = True
+    return ok
+
+def get_PE_dll_characteristics(executable):
+    '''
+    Get PE DllCharacteristics bits.
+    Returns a tuple (arch,bits) where arch is 'i386:x86-64' or 'i386'
+    and bits is the DllCharacteristics value.
+    '''
+    p = subprocess.Popen([OBJDUMP_CMD, '-x',  executable], stdout=subprocess.PIPE, stderr=subprocess.PIPE, stdin=subprocess.PIPE)
+    (stdout, stderr) = p.communicate()
+    if p.returncode:
+        raise IOError('Error opening file')
+    arch = ''
+    bits = 0
+    for line in stdout.split('\n'):
+        tokens = line.split()
+        if len(tokens)>=2 and tokens[0] == 'architecture:':
+            arch = tokens[1].rstrip(',')
+        if len(tokens)>=2 and tokens[0] == 'DllCharacteristics':
+            bits = int(tokens[1],16)
+    return (arch,bits)
+
+IMAGE_DLL_CHARACTERISTICS_HIGH_ENTROPY_VA = 0x0020
+IMAGE_DLL_CHARACTERISTICS_DYNAMIC_BASE    = 0x0040
+IMAGE_DLL_CHARACTERISTICS_NX_COMPAT       = 0x0100
+
+def check_PE_DYNAMIC_BASE(executable):
+    '''PIE: DllCharacteristics bit 0x40 signifies dynamicbase (ASLR)'''
+    (arch,bits) = get_PE_dll_characteristics(executable)
+    reqbits = IMAGE_DLL_CHARACTERISTICS_DYNAMIC_BASE
+    return (bits & reqbits) == reqbits
+
+# On 64 bit, must support high-entropy 64-bit address space layout randomization in addition to DYNAMIC_BASE
+# to have secure ASLR.
+def check_PE_HIGH_ENTROPY_VA(executable):
+    '''PIE: DllCharacteristics bit 0x20 signifies high-entropy ASLR'''
+    (arch,bits) = get_PE_dll_characteristics(executable)
+    if arch == 'i386:x86-64': 
+        reqbits = IMAGE_DLL_CHARACTERISTICS_HIGH_ENTROPY_VA
+    else: # Unnecessary on 32-bit
+        assert(arch == 'i386')
+        reqbits = 0
+    return (bits & reqbits) == reqbits
+
+def check_PE_NX(executable):
+    '''NX: DllCharacteristics bit 0x100 signifies nxcompat (DEP)'''
+    (arch,bits) = get_PE_dll_characteristics(executable)
+    return (bits & IMAGE_DLL_CHARACTERISTICS_NX_COMPAT) == IMAGE_DLL_CHARACTERISTICS_NX_COMPAT
+
+CHECKS = {
+'ELF': [
+    ('PIE', check_ELF_PIE),
+    ('NX', check_ELF_NX),
+    ('RELRO', check_ELF_RELRO),
+    ('Canary', check_ELF_Canary)
+],
+'PE': [
+    ('DYNAMIC_BASE', check_PE_DYNAMIC_BASE),
+    ('HIGH_ENTROPY_VA', check_PE_HIGH_ENTROPY_VA),
+    ('NX', check_PE_NX)
+],
+'MachO64': [
+]
+}
+
+def identify_executable(executable):
+    with open(filename, 'rb') as f:
+        magic = f.read(4)
+    if magic.startswith(b'MZ'):
+        return 'PE'
+    elif magic.startswith(b'\x7fELF'):
+        return 'ELF'
+    elif struct.unpack('I', magic)[0] == 0xFEEDFACF:
+        return 'MachO64'
+    return None
+
+if __name__ == '__main__':
+    args = sys.argv[1:]
+    allow_no_canary = "--allow-no-canary" in args
+    files = [arg for arg in args if not arg.startswith("--")]
+
+    retval = 0
+    for filename in files:
+        try:
+            etype = identify_executable(filename)
+            if etype is None:
+                print('%s: unknown format' % filename)
+                retval = 1
+                continue
+
+            failed = []
+            warning = []
+            for (name, func) in CHECKS[etype]:
+                if name == "Canary" and allow_no_canary:
+                    continue
+                if not func(filename):
+                    if name in NONFATAL:
+                        warning.append(name)
+                    else:
+                        failed.append(name)
+            if failed:
+                print('%s: failed %s' % (filename, ' '.join(failed)))
+                retval = 1
+            if warning:
+                print('%s: warning %s' % (filename, ' '.join(warning)))
+        except IOError:
+            print('%s: cannot open' % filename)
+            retval = 1
+    exit(retval)
+
diff --git a/depend/zcash/contrib/devtools/split-debug.sh b/depend/zcash/contrib/devtools/split-debug.sh
new file mode 100755
index 000000000..16fda3005
--- /dev/null
+++ b/depend/zcash/contrib/devtools/split-debug.sh
@@ -0,0 +1,10 @@
+#!/bin/sh
+
+if [ $# -ne 3 ];
+    then echo "usage: $0 <input> <stripped-binary> <debug-binary>"
+fi
+
+/usr/bin/objcopy --enable-deterministic-archives -p --only-keep-debug $1 $3
+/usr/bin/objcopy --enable-deterministic-archives -p --strip-debug $1 $2
+/usr/bin/strip --enable-deterministic-archives -p -s $2
+/usr/bin/objcopy --enable-deterministic-archives -p --add-gnu-debuglink=$3 $2
diff --git a/depend/zcash/contrib/devtools/symbol-check.py b/depend/zcash/contrib/devtools/symbol-check.py
new file mode 100755
index 000000000..92cf59f8f
--- /dev/null
+++ b/depend/zcash/contrib/devtools/symbol-check.py
@@ -0,0 +1,194 @@
+#!/usr/bin/env python
+# Copyright (c) 2014 Wladimir J. van der Laan
+# Copyright (c) 2016-2020 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+'''
+A script to check that the (Linux) executables produced by gitian only contain
+allowed gcc and glibc version symbols.  This makes sure they are still compatible
+with the minimum supported Linux distribution versions.
+
+Example usage:
+
+    find ../gitian-builder/build -type f -executable | xargs python contrib/devtools/symbol-check.py
+'''
+from __future__ import division, print_function
+import subprocess
+import re
+import sys
+import os
+
+# Ubuntu 16.04 LTS (Xenial Xerus; End of Standard Support April 2021, EOL April 2022) has:
+#
+# - g++ version 4.5.3 (https://packages.ubuntu.com/search?suite=all&searchon=names&keywords=g%2B%2B)
+# - libc6 version 2.23 (https://packages.ubuntu.com/search?suite=all&searchon=names&keywords=libc6)
+#
+# Debian 9 (Stretch; EOL 2020-07-06, LTS EOL in 2022) has:
+#
+# - g++ version 6.3.0 (https://packages.debian.org/search?suite=default&section=all&arch=any&searchon=names&keywords=g%2B%2B)
+# - libc6 version 2.24 (https://packages.debian.org/search?suite=default&section=all&arch=any&searchon=names&keywords=libc6)
+#
+# RedHat Enterprise Linux 8 (EOL: long and complicated) is based on Fedora 28 (EOL 2019-05-28) and uses the same base packages:
+#
+# - g++ version 8.0.1 (https://archives.fedoraproject.org/pub/archive/fedora/linux/releases/28/Everything/x86_64/os/Packages/g/ search for gcc-)
+# - libc6 version 2.27 (https://archives.fedoraproject.org/pub/archive/fedora/linux/releases/28/Everything/x86_64/os/Packages/g/ search for glibc)
+#
+# CentOS 8 (Full update EOL May 2024, Maintenance EOL 2029-05-31) has:
+#
+# - g++ version 8.3.1 (https://centos.pkgs.org/8/centos-baseos-x86_64/ search for libgcc)
+# - libc6 version 2.28 (https://centos.pkgs.org/8/centos-baseos-x86_64/ search for glibc)
+#
+# Fedora 31 (EOL ~November 2020) has:
+#
+# - g++ version 9.2.1 (https://dl.fedoraproject.org/pub/fedora/linux/releases/31/Everything/x86_64/os/Packages/g/ search for gcc-)
+# - libc6 version 2.30 (https://dl.fedoraproject.org/pub/fedora/linux/releases/31/Everything/x86_64/os/Packages/g/ search for glibc)
+#
+# Arch is a rolling release, and as of October 2020 has packages for:
+#
+# - g++ version 8.4.0 / 9.3.0 / 10.2.0 (https://www.archlinux.org/packages/?q=gcc)
+# - libc6 version 2.32 (https://www.archlinux.org/packages/?q=glibc)
+#
+# We take the minimum of these as our target. In practice, if we build on Xenial without
+# upgrading GCC or libc, then we should get a binary that works for all these systems, and
+# later ones.
+#
+# According to the GNU ABI document (https://gcc.gnu.org/onlinedocs/libstdc++/manual/abi.html) this corresponds to:
+#   GCC 4.5.3: GCC_4.5.0, GLIBCXX_3.4.14, CXXABI_1.3.4
+#   libc6:     GLIBC_2_23
+
+# We statically link libc++ and libc++abi in our builds. Set this to allow dynamic linking to libstdc++.
+ALLOW_DYNAMIC_LIBSTDCXX = False
+
+MAX_VERSIONS = {
+    'GCC':   (4,5,0),
+    'GLIBC': (2,23),
+}
+if ALLOW_DYNAMIC_LIBSTDCXX:
+    MAX_VERSIONS.update({
+        'GLIBCXX': (3,4,14),
+        'CXXABI':  (1,3,4),
+    })
+
+# See here for a description of _IO_stdin_used:
+# https://bugs.debian.org/cgi-bin/bugreport.cgi?bug=634261#109
+
+# Ignore symbols that are exported as part of every executable
+IGNORE_EXPORTS = {
+    '_edata', '_end', '_init', '__bss_start', '_fini', '_IO_stdin_used'
+}
+READELF_CMD = os.getenv('READELF', '/usr/bin/readelf')
+CPPFILT_CMD = os.getenv('CPPFILT', '/usr/bin/c++filt')
+
+# Allowed NEEDED libraries
+ALLOWED_LIBRARIES = {
+    # zcashd
+    'libgcc_s.so.1',        # GCC support library (also used by clang)
+    'libc.so.6',            # C library
+    'libpthread.so.0',      # threading
+    'libanl.so.1',          # DNS resolver
+    'libm.so.6',            # math library
+    'librt.so.1',           # real-time (POSIX compatibility)
+    'ld-linux-x86-64.so.2', # 64-bit dynamic linker
+    'ld-linux.so.2',        # 32-bit dynamic linker
+    'libdl.so.2'            # programming interface to dynamic linker
+}
+if ALLOW_DYNAMIC_LIBSTDCXX:
+    ALLOWED_LIBRARIES.add('libstdc++.so.6')  # C++ standard library
+
+
+class CPPFilt(object):
+    '''
+    Demangle C++ symbol names.
+
+    Use a pipe to the 'c++filt' command.
+    '''
+    def __init__(self):
+        self.proc = subprocess.Popen(CPPFILT_CMD, stdin=subprocess.PIPE, stdout=subprocess.PIPE)
+
+    def __call__(self, mangled):
+        self.proc.stdin.write(mangled + '\n')
+        return self.proc.stdout.readline().rstrip()
+
+    def close(self):
+        self.proc.stdin.close()
+        self.proc.stdout.close()
+        self.proc.wait()
+
+def read_symbols(executable, imports=True):
+    '''
+    Parse an ELF executable and return a list of (symbol,version) tuples
+    for dynamic, imported symbols.
+    '''
+    p = subprocess.Popen([READELF_CMD, '--dyn-syms', '-W', executable], stdout=subprocess.PIPE, stderr=subprocess.PIPE, stdin=subprocess.PIPE)
+    (stdout, stderr) = p.communicate()
+    if p.returncode:
+        raise IOError('Could not read symbols for %s: %s' % (executable, stderr.strip()))
+    syms = []
+    for line in stdout.split('\n'):
+        line = line.split()
+        if len(line)>7 and re.match('[0-9]+:$', line[0]):
+            (sym, _, version) = line[7].partition('@')
+            is_import = line[6] == 'UND'
+            if version.startswith('@'):
+                version = version[1:]
+            if is_import == imports:
+                syms.append((sym, version))
+    return syms
+
+def check_version(max_versions, version):
+    if '_' in version:
+        (lib, _, ver) = version.rpartition('_')
+    else:
+        lib = version
+        ver = '0'
+    ver = tuple([int(x) for x in ver.split('.')])
+    if not lib in max_versions:
+        return False
+    return ver <= max_versions[lib]
+
+def read_libraries(filename):
+    p = subprocess.Popen([READELF_CMD, '-d', '-W', filename], stdout=subprocess.PIPE, stderr=subprocess.PIPE, stdin=subprocess.PIPE)
+    (stdout, stderr) = p.communicate()
+    if p.returncode:
+        raise IOError('Error opening file')
+    libraries = []
+    for line in stdout.split('\n'):
+        tokens = line.split()
+        if len(tokens)>2 and tokens[1] == '(NEEDED)':
+            match = re.match('^Shared library: \[(.*)\]$', ' '.join(tokens[2:]))
+            if match:
+                libraries.append(match.group(1))
+            else:
+                raise ValueError('Unparseable (NEEDED) specification')
+    return libraries
+
+if __name__ == '__main__':
+    cppfilt = CPPFilt()
+    retval = 0
+    for filename in sys.argv[1:]:
+        print("Checking %s..." % (filename,))
+        # Check imported symbols
+        for sym,version in read_symbols(filename, True):
+            if version and not check_version(MAX_VERSIONS, version):
+                print('%s: symbol %s from unsupported version %s' % (filename, cppfilt(sym), version))
+                retval = 1
+        # Check exported symbols
+        for sym,version in read_symbols(filename, False):
+            if sym in IGNORE_EXPORTS:
+                continue
+            print('%s: export of symbol %s not allowed' % (filename, cppfilt(sym)))
+            retval = 1
+        # Check dependency libraries
+        for library_name in read_libraries(filename):
+            if library_name not in ALLOWED_LIBRARIES:
+                print('%s: NEEDED library %s is not allowed' % (filename, library_name))
+                retval = 1
+        print()
+
+    if retval == 0:
+        print("Everything OK")
+    else:
+        print("Note: this script is intended to ensure that Gitian builds meet our compatibility policy.")
+        print("The above warnings do not necessarily mean the program(s) will not work on your system.")
+
+    exit(retval)
diff --git a/depend/zcash/contrib/devtools/test-security-check.py b/depend/zcash/contrib/devtools/test-security-check.py
new file mode 100755
index 000000000..b16d9aee3
--- /dev/null
+++ b/depend/zcash/contrib/devtools/test-security-check.py
@@ -0,0 +1,62 @@
+#!/usr/bin/env python3
+# Copyright (c) 2015-2017 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+'''
+Test script for security-check.py
+'''
+import subprocess
+import sys
+import unittest
+
+def write_testcode(filename):
+    with open(filename, 'w', encoding="utf8") as f:
+        f.write('''
+    #include <stdio.h>
+    int main()
+    {
+        printf("the quick brown fox jumps over the lazy god\\n");
+        return 0;
+    }
+    ''')
+
+def call_security_check(cc, source, executable, options):
+    subprocess.check_call([cc,source,'-o',executable] + options)
+    p = subprocess.Popen(['./security-check.py',executable], stdout=subprocess.PIPE, stderr=subprocess.PIPE, stdin=subprocess.PIPE, universal_newlines=True)
+    (stdout, stderr) = p.communicate()
+    return (p.returncode, stdout.rstrip())
+
+class TestSecurityChecks(unittest.TestCase):
+    def test_ELF(self):
+        source = 'test1.c'
+        executable = 'test1'
+        cc = 'gcc'
+        write_testcode(source)
+
+        self.assertEqual(call_security_check(cc, source, executable, ['-Wl,-zexecstack','-fno-stack-protector','-Wl,-znorelro']), 
+                (1, executable+': failed PIE NX RELRO Canary'))
+        self.assertEqual(call_security_check(cc, source, executable, ['-Wl,-znoexecstack','-fno-stack-protector','-Wl,-znorelro']), 
+                (1, executable+': failed PIE RELRO Canary'))
+        self.assertEqual(call_security_check(cc, source, executable, ['-Wl,-znoexecstack','-fstack-protector-all','-Wl,-znorelro']), 
+                (1, executable+': failed PIE RELRO'))
+        self.assertEqual(call_security_check(cc, source, executable, ['-Wl,-znoexecstack','-fstack-protector-all','-Wl,-znorelro','-pie','-fPIE']), 
+                (1, executable+': failed RELRO'))
+        self.assertEqual(call_security_check(cc, source, executable, ['-Wl,-znoexecstack','-fstack-protector-all','-Wl,-zrelro','-Wl,-z,now','-pie','-fPIE']), 
+                (0, ''))
+
+    def test_PE(self):
+        source = 'test1.c'
+        executable = 'test1.exe'
+        cc = 'i686-w64-mingw32-gcc'
+        write_testcode(source)
+
+        self.assertEqual(call_security_check(cc, source, executable, []), 
+                (1, executable+': failed PIE NX'))
+        self.assertEqual(call_security_check(cc, source, executable, ['-Wl,--nxcompat']), 
+                (1, executable+': failed PIE'))
+        self.assertEqual(call_security_check(cc, source, executable, ['-Wl,--nxcompat','-Wl,--dynamicbase']), 
+                (0, ''))
+
+if __name__ == '__main__':
+    unittest.main()
+
diff --git a/depend/zcash/contrib/devtools/update-rust-hashes.sh b/depend/zcash/contrib/devtools/update-rust-hashes.sh
new file mode 100755
index 000000000..ad036bebf
--- /dev/null
+++ b/depend/zcash/contrib/devtools/update-rust-hashes.sh
@@ -0,0 +1,37 @@
+#!/usr/bin/env bash
+
+export LC_ALL=C
+
+SCRIPT_DIR=$( cd -- "$( dirname -- "${BASH_SOURCE[0]}" )" &> /dev/null && pwd )
+RUST_PACKAGE="$SCRIPT_DIR/../../depends/packages/native_rust.mk"
+
+RUST_VERSION=$( cat $RUST_PACKAGE | grep -oP "_version=\K.*" )
+
+update_hash() {
+    url="https://static.rust-lang.org/dist/$1-$RUST_VERSION-$2.tar.gz"
+    echo "Fetching $url"
+    hash=$( curl $url | sha256sum | awk '{print $1}' )
+    sed -i "/\$(package)_$3_$4=/c\\\$(package)_$3_$4=$hash" $RUST_PACKAGE
+}
+
+update_rust_hash() {
+    update_hash rust $1 sha256_hash $2
+}
+
+update_stdlib_hash() {
+    update_hash rust-std $1 rust_std_sha256_hash $1
+}
+
+# For native targets
+# update_rust_hash RUST_TARGET MAKEFILE_PACKAGE_IDENTIFIER
+update_rust_hash aarch64-unknown-linux-gnu aarch64_linux
+update_rust_hash x86_64-apple-darwin darwin
+update_rust_hash x86_64-unknown-linux-gnu linux
+update_rust_hash x86_64-unknown-freebsd freebsd
+
+# For cross-compilation targets
+# update_stdlib_hash RUST_TARGET
+update_stdlib_hash aarch64-unknown-linux-gnu
+update_stdlib_hash x86_64-apple-darwin
+update_stdlib_hash x86_64-pc-windows-gnu
+update_stdlib_hash x86_64-unknown-freebsd
diff --git a/depend/zcash/contrib/docker/.dockerignore b/depend/zcash/contrib/docker/.dockerignore
new file mode 100644
index 000000000..4e5cdf953
--- /dev/null
+++ b/depend/zcash/contrib/docker/.dockerignore
@@ -0,0 +1,2 @@
+./zcash-data-dir/
+./zcash-params-dir/
diff --git a/depend/zcash/contrib/docker/.env.example b/depend/zcash/contrib/docker/.env.example
new file mode 100644
index 000000000..52321b17e
--- /dev/null
+++ b/depend/zcash/contrib/docker/.env.example
@@ -0,0 +1,12 @@
+ZCASHD_NETWORK=testnet
+ZCASHD_LOGIPS=1
+ZCASHD_EXPERIMENTALFEATURES=1
+ZCASHD_GEN=0
+ZCASHD_RPCUSER=zcashrpc
+ZCASHD_RPCPASSWORD=notsecure
+ZCASHD_RPCBIND=0.0.0.0
+ZCASHD_ALLOWIP=0.0.0.0/0
+ZCASHD_TXINDEX=1
+ZCASHD_INSIGHTEXPLORER=1
+ZCASHD_ZMQPORT=9994
+ZCASHD_ZMQBIND=0.0.0.0
diff --git a/depend/zcash/contrib/docker/.gitignore b/depend/zcash/contrib/docker/.gitignore
new file mode 100644
index 000000000..6c33f2d41
--- /dev/null
+++ b/depend/zcash/contrib/docker/.gitignore
@@ -0,0 +1,3 @@
+./zcash-data-dir/
+./zcash-params-dir/
+.env
diff --git a/depend/zcash/contrib/docker/Dockerfile b/depend/zcash/contrib/docker/Dockerfile
new file mode 100644
index 000000000..1062a87a0
--- /dev/null
+++ b/depend/zcash/contrib/docker/Dockerfile
@@ -0,0 +1,37 @@
+FROM debian:11
+
+RUN apt-get update \
+  && apt-get install -y gnupg2 apt-transport-https curl
+
+ARG ZCASH_SIGNING_KEY_ID=6DEF3BAF272766C0
+
+ARG ZCASH_VERSION=
+# The empty string for ZCASH_VERSION will install the apt default version,
+# which should be the latest stable release. To install a specific
+# version, pass `--build-arg 'ZCASH_VERSION=<version>'` to `docker build`.
+
+ARG ZCASHD_USER=zcashd
+ARG ZCASHD_UID=2001
+
+RUN apt-key adv --keyserver hkp://keyserver.ubuntu.com:80 --recv-keys $ZCASH_SIGNING_KEY_ID \
+  && echo "deb [arch=amd64] https://apt.z.cash/ bullseye main" > /etc/apt/sources.list.d/zcash.list \
+  && apt-get update
+
+RUN if [ -z "$ZCASH_VERSION" ]; \
+    then apt-get install -y zcash; \
+    else apt-get install -y zcash=$ZCASH_VERSION; \
+    fi; \
+    zcashd --version
+
+RUN useradd --home-dir /srv/$ZCASHD_USER \
+            --shell /bin/bash \
+            --create-home \
+            --uid $ZCASHD_UID\
+            $ZCASHD_USER
+USER $ZCASHD_USER
+WORKDIR /srv/$ZCASHD_USER
+RUN mkdir -p /srv/$ZCASHD_USER/.zcash/ \
+    && touch /srv/$ZCASHD_USER/.zcash/zcash.conf
+
+ADD entrypoint.sh /entrypoint.sh
+ENTRYPOINT ["/entrypoint.sh"]
diff --git a/depend/zcash/contrib/docker/README.md b/depend/zcash/contrib/docker/README.md
new file mode 100644
index 000000000..69f5b7e9d
--- /dev/null
+++ b/depend/zcash/contrib/docker/README.md
@@ -0,0 +1,87 @@
+# zcash Dockerfile
+
+This is an example Dockerfile to run the zcashd daemon in a containerized Debian base OS. The image pulls the apt package built by Electric Coin Company.
+
+The output of building this image should be accessible at https://hub.docker.com/r/electriccoinco/zcashd
+
+## Defaults
+
+The image will run as a non-root user, `zcashd` with uid `2001`. When mapping volumes from the host into the container, these permissions must be used, or rebuild the image with your custom values.
+
+## Run time configuration
+
+The goal is to follow the default zcashd startup behavior as closely as possible.
+
+At startup, the image will execute the [./entrypoint.sh](./entrypoint.sh) script. This script uses environmental variables to configure the command line parameters, do a little house cleaning, and start zcashd.
+
+### Available environment variables
+
+If defined, the value is assigned to the value of the corresponding flag.
+
+```
+ZCASHD_NETWORK
+ZCASHD_LOGIPS
+ZCASHD_EXPERIMENTALFEATURES
+ZCASHD_GEN
+ZCASHD_ZSHIELDCOINBASE
+ZCASHD_RPCUSER
+ZCASHD_RPCPASSWORD
+ZCASHD_RPCBIND
+ZCASHD_ALLOWIP
+ZCASHD_TXINDEX
+ZCASHD_INSIGHTEXPLORER
+ZCASHD_ZMQPORT
+ZCASHD_ZMQBIND
+```
+
+### Additional configuration
+
+Any provided command line parameters are passed from the entrypoint.sh script to zcashd.
+
+You can skip using environmental variables at all, and instead provide a fully configured `zcash.conf` file and map to `/srv/zcashd/.zcash/zcash.conf` at startup.
+
+## Examples
+
+### See the installed version
+
+This command will create a container, print the version information of the zcashd software installed and then exit and remove the container.
+
+Run
+```
+docker run --rm electriccoinco/zcashd --version
+```
+
+Output
+```
+Zcash Daemon version v2.1.0-1
+
+In order to ensure you are adequately protecting your privacy when using Zcash,
+please see <https://z.cash/support/security/>.
+
+Copyright (C) 2009-2019 The Bitcoin Core Developers
+Copyright (C) 2015-2019 The Zcash Developers
+
+This is experimental software.
+
+Distributed under the MIT software license, see the accompanying file COPYING
+or <https://www.opensource.org/licenses/mit-license.php>.
+```
+
+### Persist data to the host
+
+For this example, we'll create a place for zcashd to store the blockchain data, create a new container that uses that location, and run it in the background.
+
+```
+mkdir {./zcash-params-dir,./zcash-data-dir}
+sudo chown -R 2001.2001 {./zcash-params-dir,./zcash-data-dir}
+docker run -d --name my_zcashd \
+  -v $(pwd)/zcash-data-dir:/srv/zcashd/.zcash \
+  -v $(pwd)/zcash-params-dir:/srv/zcashd/.zcash-params \
+  electriccoinco/zcashd
+```  
+
+Follow the logs to see its activity.
+
+```
+docker logs -f my_zcashd
+```
diff --git a/depend/zcash/contrib/docker/docker-compose.yml b/depend/zcash/contrib/docker/docker-compose.yml
new file mode 100644
index 000000000..7d0bf5fee
--- /dev/null
+++ b/depend/zcash/contrib/docker/docker-compose.yml
@@ -0,0 +1,11 @@
+---
+version: '3'
+
+services:
+  zcashd:
+    build: .
+    env_file:
+      - .env
+    volumes:
+      - ./zcash-params-dir:/srv/zcashd/.zcash-params
+      - ./zcash-data-dir:/srv/zcashd/.zcash
diff --git a/depend/zcash/contrib/docker/entrypoint.sh b/depend/zcash/contrib/docker/entrypoint.sh
new file mode 100755
index 000000000..adcbbf8fc
--- /dev/null
+++ b/depend/zcash/contrib/docker/entrypoint.sh
@@ -0,0 +1,56 @@
+#!/usr/bin/env bash
+
+export LC_ALL=C
+set -eo pipefail
+
+if [[ ${1} == "--version" ]];then
+  zcashd --version
+  exit 0
+fi
+
+env | sort | grep ZCASHD || true
+export ZCASHD_CMD='zcashd -printtoconsole'
+
+if [[ ! -n ${ZCASHD_NETWORK} ]];then
+  export ZCASHD_NETWORK=mainnet
+fi
+
+case ${ZCASHD_NETWORK} in
+  testnet)
+    ZCASHD_CMD+=" -testnet -addnode=testnet.z.cash "
+    ;;
+  mainnet)
+    ZCASHD_CMD+=" -addnode=mainnet.z.cash "
+    ;;
+  *)
+    echo "Error, unknown network: ${ZCASHD_NETWORK}"
+    exit 1
+    ;;
+esac
+
+if [[ -n "${ZCASHD_SHOWMETRICS}" ]];then ZCASHD_CMD+=" -showmetrics=${ZCASHD_SHOWMETRICS}";fi
+if [[ -n "${ZCASHD_LOGIPS}" ]];then ZCASHD_CMD+=" -logips=${ZCASHD_LOGIPS}";fi
+if [[ -n "${ZCASHD_EXPERIMENTALFEATURES}" ]];then ZCASHD_CMD+=" -experimentalfeatures=${ZCASHD_EXPERIMENTALFEATURES}";fi
+if [[ -n "${ZCASHD_GEN}" ]];then ZCASHD_CMD+=" -gen=${ZCASHD_GEN}";fi
+if [[ -n "${ZCASHD_ZSHIELDCOINBASE}" ]];then ZCASHD_CMD+=" -zshieldcoinbase=${ZCASHD_ZSHIELDCOINBASE}";fi
+if [[ -n "${ZCASHD_RPCUSER}" ]];then ZCASHD_CMD+=" -rpcuser=${ZCASHD_RPCUSER}";fi
+if [[ -n "${ZCASHD_RPCPASSWORD}" ]];then ZCASHD_CMD+=" -rpcpassword=${ZCASHD_RPCPASSWORD}";fi
+if [[ -n "${ZCASHD_RPCBIND}" ]];then ZCASHD_CMD+=" -rpcbind=${ZCASHD_RPCBIND}";fi
+if [[ -n "${ZCASHD_RPCPORT}" ]];then ZCASHD_CMD+=" -rpcport=${ZCASHD_RPCPORT}";fi
+if [[ -n "${ZCASHD_ALLOWIP}" ]];then ZCASHD_CMD+=" -rpcallowip=${ZCASHD_ALLOWIP}";fi
+if [[ -n "${ZCASHD_TXINDEX}" ]];then ZCASHD_CMD+=" -txindex";fi
+if [[ -n "${ZCASHD_INSIGHTEXPLORER}" ]];then ZCASHD_CMD+=" -insightexplorer";fi
+if [[ -n "${ZCASHD_PROMETHEUSPORT}" ]];then ZCASHD_CMD+=" -prometheusport=${ZCASHD_PROMETHEUSPORT}";fi
+if [[ -n "${ZCASHD_METRICSIP}" ]];then ZCASHD_CMD+=" -metricsallowip=${ZCASHD_METRICSIP}";fi
+if [[ -n "${ZCASHD_ZMQPORT}" && -n "${ZCASHD_ZMQBIND}" ]];then
+  ZCASHD_CMD+=" -zmqpubhashblock=tcp://${ZCASHD_ZMQBIND}:${ZCASHD_ZMQPORT}"
+  ZCASHD_CMD+=" -zmqpubhashtx=tcp://${ZCASHD_ZMQBIND}:${ZCASHD_ZMQPORT}"
+  ZCASHD_CMD+=" -zmqpubrawblock=tcp://${ZCASHD_ZMQBIND}:${ZCASHD_ZMQPORT}"
+  ZCASHD_CMD+=" -zmqpubrawtx=tcp://${ZCASHD_ZMQBIND}:${ZCASHD_ZMQPORT}"
+  ZCASHD_CMD+=" -zmqpubhashblock=tcp://${ZCASHD_ZMQBIND}:${ZCASHD_ZMQPORT}"
+fi
+
+zcash-fetch-params
+touch .zcash/zcash.conf
+echo "Starting: ${ZCASHD_CMD}"
+eval exec "${ZCASHD_CMD}" "${@}"
diff --git a/depend/zcash/contrib/gitian-descriptors/README.md b/depend/zcash/contrib/gitian-descriptors/README.md
new file mode 100644
index 000000000..8ca2347e0
--- /dev/null
+++ b/depend/zcash/contrib/gitian-descriptors/README.md
@@ -0,0 +1,65 @@
+### Gavin's notes on getting gitian builds up and running using KVM
+
+These instructions distilled from
+[https://help.ubuntu.com/community/KVM/Installation](https://help.ubuntu.com/community/KVM/Installation).
+
+You need the right hardware: you need a 64-bit-capable CPU with hardware virtualization support (Intel VT-x or AMD-V). Not all modern CPUs support hardware virtualization.
+
+You probably need to enable hardware virtualization in your machine's BIOS.
+
+You need to be running a recent version of 64-bit-Ubuntu, and you need to install several prerequisites:
+
+	sudo apt-get install ruby apache2 git apt-cacher-ng python-vm-builder qemu-kvm
+
+Sanity checks:
+
+	sudo service apt-cacher-ng status  # Should return apt-cacher-ng is running
+	ls -l /dev/kvm   # Should show a /dev/kvm device
+
+
+Once you've got the right hardware and software:
+
+    git clone git://github.com/bitcoin/bitcoin.git
+    git clone git://github.com/devrandom/gitian-builder.git
+    mkdir gitian-builder/inputs
+    cd gitian-builder/inputs
+
+    # Create base images
+    cd gitian-builder
+    bin/make-base-vm --suite trusty --arch amd64
+    cd ..
+
+    # Get inputs (see doc/release-process.md for exact inputs needed and where to get them)
+    ...
+
+    # For further build instructions see doc/release-process.md
+    ...
+
+---------------------
+
+`gitian-builder` now also supports building using LXC. See
+[help.ubuntu.com](https://ubuntu.com/server/docs/containers-lxc)
+for how to get LXC up and running under Ubuntu.
+
+If your main machine is a 64-bit Mac or PC with a few gigabytes of memory
+and at least 10 gigabytes of free disk space, you can `gitian-build` using
+LXC running inside a virtual machine.
+
+Here's a description of Gavin's setup on OSX 10.6:
+
+1. Download and install VirtualBox from [https://www.virtualbox.org/](https://www.virtualbox.org/)
+
+2. Download the 64-bit Ubuntu Desktop 12.04 LTS .iso CD image from
+   [https://ubuntu.com/](https://ubuntu.com)
+
+3. Run VirtualBox and create a new virtual machine, using the Ubuntu .iso (see the [VirtualBox documentation](https://www.virtualbox.org/wiki/Documentation) for details). Create it with at least 2 gigabytes of memory and a disk that is at least 20 gigabytes big.
+
+4. Inside the running Ubuntu desktop, install:
+
+	sudo apt-get install debootstrap lxc ruby apache2 git apt-cacher-ng python-vm-builder
+
+5. Still inside Ubuntu, tell gitian-builder to use LXC, then follow the "Once you've got the right hardware and software" instructions above:
+
+	export USE_LXC=1
+	git clone git://github.com/bitcoin/bitcoin.git
+	... etc
diff --git a/depend/zcash/contrib/gitian-descriptors/gitian-linux.yml b/depend/zcash/contrib/gitian-descriptors/gitian-linux.yml
new file mode 100644
index 000000000..9e03c1767
--- /dev/null
+++ b/depend/zcash/contrib/gitian-descriptors/gitian-linux.yml
@@ -0,0 +1,141 @@
+---
+name: "zcash-5.0.0"
+enable_cache: true
+distro: "debian"
+suites:
+- "buster"
+- "bullseye"
+architectures:
+- "amd64"
+packages:
+- "curl"
+- "autoconf"
+- "automake"
+- "bsdmainutils"
+- "binutils-gold"
+- "ca-certificates"
+- "faketime"
+- "g++-multilib"
+- "git-core"
+- "libc6-dev"
+- "libtinfo5"
+- "libtool"
+- "libxml2"
+- "m4"
+- "ncurses-dev"
+- "pkg-config"
+- "python"
+- "unzip"
+- "wget"
+- "zlib1g-dev"
+remotes:
+- "url": "https://github.com/zcash/zcash.git"
+  "dir": "zcash"
+files: []
+script: |
+  WRAP_DIR=$HOME/wrapped
+  HOSTS="x86_64-linux-gnu"
+  CONFIGFLAGS="--enable-glibc-back-compat --enable-reduce-exports --disable-bench --enable-hardening --enable-werror"
+  MAKEOPTS="V=1"
+  FAKETIME_HOST_PROGS=""
+  FAKETIME_PROGS="date ar ranlib nm strip objcopy"
+  HOST_CFLAGS=""
+  HOST_CXXFLAGS=""
+  HOST_LDFLAGS=-static-libstdc++
+
+  export QT_RCC_TEST=0
+  export GZIP="-9n"
+  export TAR_OPTIONS="--mtime="$REFERENCE_DATE\\\ $REFERENCE_TIME""
+  export TZ="UTC"
+  export BUILD_DIR=`pwd`
+  mkdir -p ${WRAP_DIR}
+  if test -n "$GBUILD_CACHE_ENABLED"; then
+    export SOURCES_PATH=${GBUILD_COMMON_CACHE}
+    export BASE_CACHE=${GBUILD_PACKAGE_CACHE}
+    mkdir -p ${BASE_CACHE} ${SOURCES_PATH}
+  fi
+
+  function create_global_faketime_wrappers {
+  for prog in ${FAKETIME_PROGS}; do
+    echo '#!/usr/bin/env bash' > ${WRAP_DIR}/${prog}
+    echo "REAL=\`which -a ${prog} | grep -v ${WRAP_DIR}/${prog} | head -1\`" >> ${WRAP_DIR}/${prog}
+    echo 'export LD_PRELOAD=/usr/lib/x86_64-linux-gnu/faketime/libfaketime.so.1' >> ${WRAP_DIR}/${prog}
+    echo "export FAKETIME=\"$1\"" >> ${WRAP_DIR}/${prog}
+    echo "\$REAL \$@" >> $WRAP_DIR/${prog}
+    chmod +x ${WRAP_DIR}/${prog}
+  done
+  }
+
+  function create_per-host_faketime_wrappers {
+  for i in $HOSTS; do
+    for prog in ${FAKETIME_HOST_PROGS}; do
+        echo '#!/usr/bin/env bash' > ${WRAP_DIR}/${i}-${prog}
+        echo "REAL=\`which -a ${i}-${prog} | grep -v ${WRAP_DIR}/${i}-${prog} | head -1\`" >> ${WRAP_DIR}/${i}-${prog}
+        echo 'export LD_PRELOAD=/usr/lib/x86_64-linux-gnu/faketime/libfaketime.so.1' >> ${WRAP_DIR}/${i}-${prog}
+        echo "export FAKETIME=\"$1\"" >> ${WRAP_DIR}/${i}-${prog}
+        echo "\$REAL \$@" >> $WRAP_DIR/${i}-${prog}
+        chmod +x ${WRAP_DIR}/${i}-${prog}
+    done
+  done
+  }
+
+  export PATH=${WRAP_DIR}:${PATH}
+
+  # Faketime for depends so intermediate results are comparable
+  create_global_faketime_wrappers "2000-01-01 12:00:00"
+  create_per-host_faketime_wrappers "2000-01-01 12:00:00"
+
+  cd zcash
+  BASEPREFIX=`pwd`/depends
+  # Build dependencies for each host
+  for i in $HOSTS; do
+    make ${MAKEOPTS} -C ${BASEPREFIX} HOST="${i}"
+  done
+
+  # Faketime for binaries
+  create_global_faketime_wrappers "${REFERENCE_DATETIME}"
+  create_per-host_faketime_wrappers "${REFERENCE_DATETIME}"
+
+  # Create the release tarball using (arbitrarily) the first host
+  ./autogen.sh
+  CONFIG_SITE=${BASEPREFIX}/`echo "${HOSTS}" | awk '{print $1;}'`/share/config.site ./configure --prefix=/
+  make dist
+  SOURCEDIST=`echo zcash-*.tar.gz`
+  DISTNAME=`echo ${SOURCEDIST} | sed 's/.tar.*//'`
+  # Correct tar file order
+  mkdir -p temp
+  pushd temp
+  tar xf ../$SOURCEDIST
+  find zcash* | sort | tar --no-recursion --mode='u+rw,go+r-w,a+X' --owner=0 --group=0 -c -T - | gzip -9n > ../$SOURCEDIST
+  popd
+
+  ORIGPATH="$PATH"
+  # Extract the release tarball into a dir for each host and build
+  for i in ${HOSTS}; do
+    export PATH=${BASEPREFIX}/${i}/native/bin:${ORIGPATH}
+    mkdir -p distsrc-${i}
+    cd distsrc-${i}
+    INSTALLPATH=`pwd`/installed/${DISTNAME}
+    mkdir -p ${INSTALLPATH}
+    tar --strip-components=1 -xf ../$SOURCEDIST
+
+    CONFIG_SITE=${BASEPREFIX}/${i}/share/config.site ./configure --prefix=/ --disable-ccache --disable-maintainer-mode --disable-dependency-tracking ${CONFIGFLAGS} CFLAGS="${HOST_CFLAGS}" CXXFLAGS="${HOST_CXXFLAGS}" LDFLAGS="${HOST_LDFLAGS}"
+    make ${MAKEOPTS}
+    make ${MAKEOPTS} -C src check-security
+    make install DESTDIR=${INSTALLPATH}
+    cd installed
+    find . -name "lib*.la" -delete
+    find . -name "lib*.a" -delete
+    rm -rf ${DISTNAME}/lib/pkgconfig
+    find ${DISTNAME}/bin -type f -executable -exec objcopy --only-keep-debug {} {}.dbg \; -exec strip -s {} \; -exec objcopy --add-gnu-debuglink={}.dbg {} \;
+    # Commented out while we don't build any libraries
+    #find ${DISTNAME}/lib -type f -exec objcopy --only-keep-debug {} {}.dbg \; -exec strip -s {} \; -exec objcopy --add-gnu-debuglink={}.dbg {} \;
+    find ${DISTNAME} -not -name "*.dbg" | sort | tar --no-recursion --mode='u+rw,go+r-w,a+X' --owner=0 --group=0 -c -T - | gzip -9n > ${OUTDIR}/${DISTNAME}-${i}.tar.gz
+    find ${DISTNAME} -name "*.dbg" | sort | tar --no-recursion --mode='u+rw,go+r-w,a+X' --owner=0 --group=0 -c -T - | gzip -9n > ${OUTDIR}/${DISTNAME}-${i}-debug.tar.gz
+    cd ../../
+    rm -rf distsrc-${i}
+  done
+  mkdir -p $OUTDIR/src
+  mv $SOURCEDIST $OUTDIR/src
+  mv ${OUTDIR}/${DISTNAME}-x86_64-*-debug.tar.gz ${OUTDIR}/${DISTNAME}-linux64-debug.tar.gz
+  mv ${OUTDIR}/${DISTNAME}-x86_64-*.tar.gz ${OUTDIR}/${DISTNAME}-linux64.tar.gz
diff --git a/depend/zcash/contrib/gitian-descriptors/gitian-osx-signer.yml b/depend/zcash/contrib/gitian-descriptors/gitian-osx-signer.yml
new file mode 100644
index 000000000..73a2f12f3
--- /dev/null
+++ b/depend/zcash/contrib/gitian-descriptors/gitian-osx-signer.yml
@@ -0,0 +1,37 @@
+---
+name: "bitcoin-dmg-signer"
+suites:
+- "trusty"
+architectures:
+- "amd64"
+packages:
+- "libc6:i386"
+- "faketime"
+remotes:
+- "url": "https://github.com/bitcoin/bitcoin-detached-sigs.git"
+  "dir": "signature"
+files:
+- "bitcoin-osx-unsigned.tar.gz"
+script: |
+  WRAP_DIR=$HOME/wrapped
+  mkdir -p ${WRAP_DIR}
+  export PATH=`pwd`:$PATH
+  FAKETIME_PROGS="dmg genisoimage"
+
+  # Create global faketime wrappers
+  for prog in ${FAKETIME_PROGS}; do
+    echo '#!/usr/bin/env bash' > ${WRAP_DIR}/${prog}
+    echo "REAL=\`which -a ${prog} | grep -v ${WRAP_DIR}/${prog} | head -1\`" >> ${WRAP_DIR}/${prog}
+    echo 'export LD_PRELOAD=/usr/lib/x86_64-linux-gnu/faketime/libfaketime.so.1' >> ${WRAP_DIR}/${prog}
+    echo "export FAKETIME=\"${REFERENCE_DATETIME}\"" >> ${WRAP_DIR}/${prog}
+    echo "\$REAL \$@" >> $WRAP_DIR/${prog}
+    chmod +x ${WRAP_DIR}/${prog}
+  done
+
+  UNSIGNED=bitcoin-osx-unsigned.tar.gz
+  SIGNED=bitcoin-osx-signed.dmg
+
+  tar -xf ${UNSIGNED}
+  ./detached-sig-apply.sh ${UNSIGNED} signature/osx
+  ${WRAP_DIR}/genisoimage -no-cache-inodes -D -l -probe -V "Bitcoin-Core" -no-pad -r -apple -o uncompressed.dmg signed-app
+  ${WRAP_DIR}/dmg dmg uncompressed.dmg ${OUTDIR}/${SIGNED}
diff --git a/depend/zcash/contrib/gitian-descriptors/gitian-osx.yml b/depend/zcash/contrib/gitian-descriptors/gitian-osx.yml
new file mode 100644
index 000000000..65533d060
--- /dev/null
+++ b/depend/zcash/contrib/gitian-descriptors/gitian-osx.yml
@@ -0,0 +1,146 @@
+---
+name: "bitcoin-osx-0.11"
+enable_cache: true
+suites:
+- "trusty"
+architectures:
+- "amd64"
+packages:
+- "g++"
+- "git-core"
+- "pkg-config"
+- "autoconf"
+- "libtool"
+- "automake"
+- "faketime"
+- "bsdmainutils"
+- "cmake"
+- "libcap-dev"
+- "libz-dev"
+- "libbz2-dev"
+- "ca-certificates"
+- "python"
+remotes:
+- "url": "https://github.com/bitcoin/bitcoin.git"
+  "dir": "bitcoin"
+files:
+- "Xcode-11.3.1-11C505-extracted-SDK-with-libcxx-headers.tar.gz"
+script: |
+  WRAP_DIR=$HOME/wrapped
+  HOSTS="x86_64-apple-darwin18"
+  CONFIGFLAGS="--enable-reduce-exports --disable-bench GENISOIMAGE=$WRAP_DIR/genisoimage"
+  FAKETIME_HOST_PROGS=""
+  FAKETIME_PROGS="ar ranlib date dmg genisoimage"
+
+  export QT_RCC_TEST=1
+  export GZIP="-9n"
+  export TAR_OPTIONS="--mtime="$REFERENCE_DATE\\\ $REFERENCE_TIME""
+  export TZ="UTC"
+  export BUILD_DIR=`pwd`
+  mkdir -p ${WRAP_DIR}
+  if test -n "$GBUILD_CACHE_ENABLED"; then
+    export SOURCES_PATH=${GBUILD_COMMON_CACHE}
+    export BASE_CACHE=${GBUILD_PACKAGE_CACHE}
+    mkdir -p ${BASE_CACHE} ${SOURCES_PATH}
+  fi
+
+  export ZERO_AR_DATE=1
+
+  function create_global_faketime_wrappers {
+  for prog in ${FAKETIME_PROGS}; do
+    echo '#!/usr/bin/env bash' > ${WRAP_DIR}/${prog}
+    echo "REAL=\`which -a ${prog} | grep -v ${WRAP_DIR}/${prog} | head -1\`" >> ${WRAP_DIR}/${prog}
+    echo 'export LD_PRELOAD=/usr/lib/x86_64-linux-gnu/faketime/libfaketime.so.1' >> ${WRAP_DIR}/${prog}
+    echo "export FAKETIME=\"$1\"" >> ${WRAP_DIR}/${prog}
+    echo "\$REAL \$@" >> $WRAP_DIR/${prog}
+    chmod +x ${WRAP_DIR}/${prog}
+  done
+  }
+
+  function create_per-host_faketime_wrappers {
+  for i in $HOSTS; do
+    for prog in ${FAKETIME_HOST_PROGS}; do
+        echo '#!/usr/bin/env bash' > ${WRAP_DIR}/${i}-${prog}
+        echo "REAL=\`which -a ${i}-${prog} | grep -v ${WRAP_DIR}/${i}-${prog} | head -1\`" >> ${WRAP_DIR}/${i}-${prog}
+        echo 'export LD_PRELOAD=/usr/lib/x86_64-linux-gnu/faketime/libfaketime.so.1' >> ${WRAP_DIR}/${i}-${prog}
+        echo "export FAKETIME=\"$1\"" >> ${WRAP_DIR}/${i}-${prog}
+        echo "\$REAL \$@" >> $WRAP_DIR/${i}-${prog}
+        chmod +x ${WRAP_DIR}/${i}-${prog}
+    done
+  done
+  }
+
+  export PATH=${WRAP_DIR}:${PATH}
+
+  # Faketime for depends so intermediate results are comparable
+  create_global_faketime_wrappers "2000-01-01 12:00:00"
+  create_per-host_faketime_wrappers "2000-01-01 12:00:00"
+
+  cd bitcoin
+  BASEPREFIX=`pwd`/depends
+
+  mkdir -p ${BASEPREFIX}/SDKs
+  tar -C ${BASEPREFIX}/SDKs -xf ${BUILD_DIR}/Xcode-11.3.1-11C505-extracted-SDK-with-libcxx-headers.tar.gz
+
+  # Build dependencies for each host
+  for i in $HOSTS; do
+    make ${MAKEOPTS} -C ${BASEPREFIX} HOST="${i}"
+  done
+
+  # Faketime for binaries
+  create_global_faketime_wrappers "${REFERENCE_DATETIME}"
+  create_per-host_faketime_wrappers "${REFERENCE_DATETIME}"
+
+  # Create the release tarball using (arbitrarily) the first host
+  ./autogen.sh
+  CONFIG_SITE=${BASEPREFIX}/`echo "${HOSTS}" | awk '{print $1;}'`/share/config.site ./configure --prefix=/
+  make dist
+  SOURCEDIST=`echo bitcoin-*.tar.gz`
+  DISTNAME=`echo ${SOURCEDIST} | sed 's/.tar.*//'`
+
+  # Correct tar file order
+  mkdir -p temp
+  pushd temp
+  tar xf ../$SOURCEDIST
+  find bitcoin-* | sort | tar --no-recursion --mode='u+rw,go+r-w,a+X' --owner=0 --group=0 -c -T - | gzip -9n > ../$SOURCEDIST
+  popd
+
+  ORIGPATH="$PATH"
+  # Extract the release tarball into a dir for each host and build
+  for i in ${HOSTS}; do
+    export PATH=${BASEPREFIX}/${i}/native/bin:${ORIGPATH}
+    mkdir -p distsrc-${i}
+    cd distsrc-${i}
+    INSTALLPATH=`pwd`/installed/${DISTNAME}
+    mkdir -p ${INSTALLPATH}
+    tar --strip-components=1 -xf ../$SOURCEDIST
+
+    CONFIG_SITE=${BASEPREFIX}/${i}/share/config.site ./configure --prefix=/ --disable-ccache --disable-maintainer-mode --disable-dependency-tracking ${CONFIGFLAGS}
+    make ${MAKEOPTS}
+    make install-strip DESTDIR=${INSTALLPATH}
+
+    make deploydir
+    mkdir -p unsigned-app-${i}
+    cp contrib/macdeploy/detached-sig-apply.sh unsigned-app-${i}
+    cp contrib/macdeploy/detached-sig-create.sh unsigned-app-${i}
+    cp ${BASEPREFIX}/${i}/native/bin/dmg ${BASEPREFIX}/${i}/native/bin/genisoimage unsigned-app-${i}
+    cp ${BASEPREFIX}/${i}/native/bin/${i}-codesign_allocate unsigned-app-${i}/codesign_allocate
+    cp ${BASEPREFIX}/${i}/native/bin/${i}-pagestuff unsigned-app-${i}/pagestuff
+    mv dist unsigned-app-${i}
+    pushd unsigned-app-${i}
+    find . | sort | tar --no-recursion --mode='u+rw,go+r-w,a+X' --owner=0 --group=0 -c -T - | gzip -9n > ${OUTDIR}/${DISTNAME}-osx-unsigned.tar.gz
+    popd
+
+    make deploy
+    ${WRAP_DIR}/dmg dmg Bitcoin-Core.dmg ${OUTDIR}/${DISTNAME}-osx-unsigned.dmg
+
+    cd installed
+    find . -name "lib*.la" -delete
+    find . -name "lib*.a" -delete
+    rm -rf ${DISTNAME}/lib/pkgconfig
+    find ${DISTNAME} | sort | tar --no-recursion --mode='u+rw,go+r-w,a+X' --owner=0 --group=0 -c -T - | gzip -9n > ${OUTDIR}/${DISTNAME}-${i}.tar.gz
+    cd ../../
+  done
+  mkdir -p $OUTDIR/src
+  mv $SOURCEDIST $OUTDIR/src
+  mv ${OUTDIR}/${DISTNAME}-x86_64-*.tar.gz ${OUTDIR}/${DISTNAME}-osx64.tar.gz
diff --git a/depend/zcash/contrib/gitian-descriptors/gitian-win-signer.yml b/depend/zcash/contrib/gitian-descriptors/gitian-win-signer.yml
new file mode 100644
index 000000000..6b53b89b6
--- /dev/null
+++ b/depend/zcash/contrib/gitian-descriptors/gitian-win-signer.yml
@@ -0,0 +1,38 @@
+---
+name: "bitcoin-win-signer"
+suites:
+- "trusty"
+architectures:
+- "amd64"
+packages:
+- "libssl-dev"
+- "autoconf"
+remotes:
+- "url": "https://github.com/bitcoin/bitcoin-detached-sigs.git"
+  "dir": "signature"
+files:
+- "osslsigncode-1.7.1.tar.gz"
+- "osslsigncode-Backports-to-1.7.1.patch"
+- "bitcoin-win-unsigned.tar.gz"
+script: |
+  BUILD_DIR=`pwd`
+  SIGDIR=${BUILD_DIR}/signature/win
+  UNSIGNED_DIR=${BUILD_DIR}/unsigned
+
+  echo "f9a8cdb38b9c309326764ebc937cba1523a3a751a7ab05df3ecc99d18ae466c9  osslsigncode-1.7.1.tar.gz" | sha256sum -c
+  echo "a8c4e9cafba922f89de0df1f2152e7be286aba73f78505169bc351a7938dd911  osslsigncode-Backports-to-1.7.1.patch" | sha256sum -c
+
+  mkdir -p ${UNSIGNED_DIR}
+  tar -C ${UNSIGNED_DIR} -xf bitcoin-win-unsigned.tar.gz
+
+  tar xf osslsigncode-1.7.1.tar.gz
+  cd osslsigncode-1.7.1
+  patch -p1 < ${BUILD_DIR}/osslsigncode-Backports-to-1.7.1.patch
+
+  ./configure --without-gsf --without-curl --disable-dependency-tracking
+  make
+  find ${UNSIGNED_DIR} -name "*-unsigned.exe" | while read i; do
+    INFILE="`basename "${i}"`"
+    OUTFILE="`echo "${INFILE}" | sed s/-unsigned//`"
+    ./osslsigncode attach-signature -in "${i}" -out "${OUTDIR}/${OUTFILE}" -sigin "${SIGDIR}/${INFILE}.pem"
+  done
diff --git a/depend/zcash/contrib/gitian-descriptors/gitian-win.yml b/depend/zcash/contrib/gitian-descriptors/gitian-win.yml
new file mode 100644
index 000000000..cab6187fa
--- /dev/null
+++ b/depend/zcash/contrib/gitian-descriptors/gitian-win.yml
@@ -0,0 +1,166 @@
+---
+name: "bitcoin-win-0.11"
+enable_cache: true
+suites:
+- "trusty"
+architectures:
+- "amd64"
+packages:
+- "g++"
+- "git-core"
+- "pkg-config"
+- "autoconf"
+- "libtool"
+- "automake"
+- "faketime"
+- "bsdmainutils"
+- "mingw-w64"
+- "g++-mingw-w64"
+- "nsis"
+- "zip"
+- "ca-certificates"
+- "python"
+remotes:
+- "url": "https://github.com/bitcoin/bitcoin.git"
+  "dir": "bitcoin"
+files: []
+script: |
+  WRAP_DIR=$HOME/wrapped
+  HOSTS="x86_64-w64-mingw32 i686-w64-mingw32"
+  CONFIGFLAGS="--enable-reduce-exports --disable-bench"
+  FAKETIME_HOST_PROGS="g++ ar ranlib nm windres strip objcopy"
+  FAKETIME_PROGS="date makensis zip"
+  HOST_CFLAGS="-O2 -g"
+  HOST_CXXFLAGS="-O2 -g"
+
+  export QT_RCC_TEST=1
+  export GZIP="-9n"
+  export TAR_OPTIONS="--mtime="$REFERENCE_DATE\\\ $REFERENCE_TIME""
+  export TZ="UTC"
+  export BUILD_DIR=`pwd`
+  mkdir -p ${WRAP_DIR}
+  if test -n "$GBUILD_CACHE_ENABLED"; then
+    export SOURCES_PATH=${GBUILD_COMMON_CACHE}
+    export BASE_CACHE=${GBUILD_PACKAGE_CACHE}
+    mkdir -p ${BASE_CACHE} ${SOURCES_PATH}
+  fi
+
+  function create_global_faketime_wrappers {
+  for prog in ${FAKETIME_PROGS}; do
+    echo '#!/usr/bin/env bash' > ${WRAP_DIR}/${prog}
+    echo "REAL=\`which -a ${prog} | grep -v ${WRAP_DIR}/${prog} | head -1\`" >> ${WRAP_DIR}/${prog}
+    echo 'export LD_PRELOAD=/usr/lib/x86_64-linux-gnu/faketime/libfaketime.so.1' >> ${WRAP_DIR}/${prog}
+    echo "export FAKETIME=\"$1\"" >> ${WRAP_DIR}/${prog}
+    echo "\$REAL \$@" >> $WRAP_DIR/${prog}
+    chmod +x ${WRAP_DIR}/${prog}
+  done
+  }
+
+  function create_per-host_faketime_wrappers {
+  for i in $HOSTS; do
+    for prog in ${FAKETIME_HOST_PROGS}; do
+        echo '#!/usr/bin/env bash' > ${WRAP_DIR}/${i}-${prog}
+        echo "REAL=\`which -a ${i}-${prog} | grep -v ${WRAP_DIR}/${i}-${prog} | head -1\`" >> ${WRAP_DIR}/${i}-${prog}
+        echo 'export LD_PRELOAD=/usr/lib/x86_64-linux-gnu/faketime/libfaketime.so.1' >> ${WRAP_DIR}/${i}-${prog}
+        echo "export FAKETIME=\"$1\"" >> ${WRAP_DIR}/${i}-${prog}
+        echo "\$REAL \$@" >> $WRAP_DIR/${i}-${prog}
+        chmod +x ${WRAP_DIR}/${i}-${prog}
+    done
+  done
+  }
+
+  function create_per-host_linker_wrapper {
+  # This is only needed for trusty, as the mingw linker leaks a few bytes of
+  # heap, causing non-determinism. See discussion in https://github.com/bitcoin/bitcoin/pull/6900
+  for i in $HOSTS; do
+    mkdir -p ${WRAP_DIR}/${i}
+    for prog in collect2; do
+        echo '#!/usr/bin/env bash' > ${WRAP_DIR}/${i}/${prog}
+        REAL=$(${i}-gcc -print-prog-name=${prog})
+        echo "export MALLOC_PERTURB_=255" >> ${WRAP_DIR}/${i}/${prog}
+        echo "${REAL} \$@" >> $WRAP_DIR/${i}/${prog}
+        chmod +x ${WRAP_DIR}/${i}/${prog}
+    done
+    for prog in gcc g++; do
+        echo '#!/usr/bin/env bash' > ${WRAP_DIR}/${i}-${prog}
+        echo "REAL=\`which -a ${i}-${prog} | grep -v ${WRAP_DIR}/${i}-${prog} | head -1\`" >> ${WRAP_DIR}/${i}-${prog}
+        echo 'export LD_PRELOAD=/usr/lib/x86_64-linux-gnu/faketime/libfaketime.so.1' >> ${WRAP_DIR}/${i}-${prog}
+        echo "export FAKETIME=\"$1\"" >> ${WRAP_DIR}/${i}-${prog}
+        echo "export COMPILER_PATH=${WRAP_DIR}/${i}" >> ${WRAP_DIR}/${i}-${prog}
+        echo "\$REAL \$@" >> $WRAP_DIR/${i}-${prog}
+        chmod +x ${WRAP_DIR}/${i}-${prog}
+    done
+  done
+  }
+
+  export PATH=${WRAP_DIR}:${PATH}
+
+  # Faketime for depends so intermediate results are comparable
+  create_global_faketime_wrappers "2000-01-01 12:00:00"
+  create_per-host_faketime_wrappers "2000-01-01 12:00:00"
+  create_per-host_linker_wrapper "2000-01-01 12:00:00"
+
+  cd bitcoin
+  BASEPREFIX=`pwd`/depends
+  # Build dependencies for each host
+  for i in $HOSTS; do
+    make ${MAKEOPTS} -C ${BASEPREFIX} HOST="${i}"
+  done
+
+  # Faketime for binaries
+  create_global_faketime_wrappers "${REFERENCE_DATETIME}"
+  create_per-host_faketime_wrappers "${REFERENCE_DATETIME}"
+  create_per-host_linker_wrapper "${REFERENCE_DATETIME}"
+
+  # Create the release tarball using (arbitrarily) the first host
+  ./autogen.sh
+  CONFIG_SITE=${BASEPREFIX}/`echo "${HOSTS}" | awk '{print $1;}'`/share/config.site ./configure --prefix=/
+  make dist
+  SOURCEDIST=`echo bitcoin-*.tar.gz`
+  DISTNAME=`echo ${SOURCEDIST} | sed 's/.tar.*//'`
+
+  # Correct tar file order
+  mkdir -p temp
+  pushd temp
+  tar xf ../$SOURCEDIST
+  find bitcoin-* | sort | tar --no-recursion --mode='u+rw,go+r-w,a+X' --owner=0 --group=0 -c -T - | gzip -9n > ../$SOURCEDIST
+  mkdir -p $OUTDIR/src
+  cp ../$SOURCEDIST $OUTDIR/src
+  popd
+
+  ORIGPATH="$PATH"
+  # Extract the release tarball into a dir for each host and build
+  for i in ${HOSTS}; do
+    export PATH=${BASEPREFIX}/${i}/native/bin:${ORIGPATH}
+    mkdir -p distsrc-${i}
+    cd distsrc-${i}
+    INSTALLPATH=`pwd`/installed/${DISTNAME}
+    mkdir -p ${INSTALLPATH}
+    tar --strip-components=1 -xf ../$SOURCEDIST
+
+    CONFIG_SITE=${BASEPREFIX}/${i}/share/config.site ./configure --prefix=/ --disable-ccache --disable-maintainer-mode --disable-dependency-tracking ${CONFIGFLAGS} CFLAGS="${HOST_CFLAGS}" CXXFLAGS="${HOST_CXXFLAGS}"
+    make ${MAKEOPTS}
+    make ${MAKEOPTS} -C src check-security
+    make deploy
+    make install DESTDIR=${INSTALLPATH}
+    cp -f bitcoin-*setup*.exe $OUTDIR/
+    cd installed
+    mv ${DISTNAME}/bin/*.dll ${DISTNAME}/lib/
+    find . -name "lib*.la" -delete
+    find . -name "lib*.a" -delete
+    rm -rf ${DISTNAME}/lib/pkgconfig
+    find ${DISTNAME}/bin -type f -executable -exec ${i}-objcopy --only-keep-debug {} {}.dbg \; -exec ${i}-strip -s {} \; -exec ${i}-objcopy --add-gnu-debuglink={}.dbg {} \;
+    # Commented out while we don't build any libraries
+    #find ${DISTNAME}/lib -type f -exec ${i}-objcopy --only-keep-debug {} {}.dbg \; -exec ${i}-strip -s {} \; -exec ${i}-objcopy --add-gnu-debuglink={}.dbg {} \;
+    find ${DISTNAME} -not -name "*.dbg"  -type f | sort | zip -X@ ${OUTDIR}/${DISTNAME}-${i}.zip
+    find ${DISTNAME} -name "*.dbg"  -type f | sort | zip -X@ ${OUTDIR}/${DISTNAME}-${i}-debug.zip
+    cd ../../
+    rm -rf distsrc-${i}
+  done
+  cd $OUTDIR
+  rename 's/-setup\.exe$/-setup-unsigned.exe/' *-setup.exe
+  find . -name "*-setup-unsigned.exe" | sort | tar --no-recursion --mode='u+rw,go+r-w,a+X' --owner=0 --group=0 -c -T - | gzip -9n > ${OUTDIR}/${DISTNAME}-win-unsigned.tar.gz
+  mv ${OUTDIR}/${DISTNAME}-x86_64-*-debug.zip ${OUTDIR}/${DISTNAME}-win64-debug.zip
+  mv ${OUTDIR}/${DISTNAME}-i686-*-debug.zip ${OUTDIR}/${DISTNAME}-win32-debug.zip
+  mv ${OUTDIR}/${DISTNAME}-x86_64-*.zip ${OUTDIR}/${DISTNAME}-win64.zip
+  mv ${OUTDIR}/${DISTNAME}-i686-*.zip ${OUTDIR}/${DISTNAME}-win32.zip
diff --git a/depend/zcash/contrib/gitian-downloader/daira.asc b/depend/zcash/contrib/gitian-downloader/daira.asc
new file mode 100644
index 000000000..e60a2bbcb
--- /dev/null
+++ b/depend/zcash/contrib/gitian-downloader/daira.asc
@@ -0,0 +1,70 @@
+-----BEGIN PGP PUBLIC KEY BLOCK-----
+Version: SKS 1.1.5
+Comment: Hostname: pgp.mit.edu
+
+mQENBE1/p5cBCAC/lwYzI6Na3nrh8VIRWDYAZNYZbiZd/QqNaD7BSyyjOM1Eef5uqKKnJbbI
+gcROcGjpV/oWtXrysXe8pGOgDPEBXI6uJQhlm70pTue+Pd7eT5VgQMggVHNFiteWR+r3Dz27
+2D7lubWQ5Ii91a0HG/TLGdwmBNFFqxZaXNtpGE/vUK4F9XxjbVYBKf2U21s3waDAFu4umRrL
+Qwd/MyOw/kTJHp0A5zI77fPo49V2g38P+zkz5wZsAhsPbBNyYF23y1tY1LFEQWwmM9bTcFQP
+wzqzIlbHcNXqHsx5RXaprowHgLJuDxEGqEgw99B+KmoekyD2BFOndW1ixRBoXM7B2i8zABEB
+AAG0L0RhdmlkLVNhcmFoIEhvcHdvb2QgPGRhdmlkLXNhcmFoQGphY2FyYW5kYS5vcmc+iQE+
+BBMBAgAoBQJNf6eXAhsjBQkJZgGABgsJCAcDAgYVCAIJCgsEFgIDAQIeAQIXgAAKCRAGf0kg
+mM8nYksDB/sFuErdPkBx6ZTy5NWq5tKLAkscRZ1005Zbu24bjTPRjo8PuXfTbNTVNmWvBvaE
+NKdmZNobZ0uX/LzJPKf1CQ1POFdFp7Y0o3BU6BFtKxLU8TX3DQ3TdGTFDPRjiK6u65BVTLbI
+C/nCpgfOJFOiuaMQB3aEbC4OSEIHAAH1Wf7mfpeh7qMce7v6wwhuwlpUagl237wr/QURGB5g
+zAvjErcJ5JTk+sXkbz49+K8kzn4ZzLkmQEJU7alyZLvXsK5SVnSQhbtviIY18EDdQG4W86a4
+KegOB85+WqLdZ4643fztiSovy/DdiUh/+sWc3G3A4trm+WruU9/3NLLKOPtflVwniQFbBDAB
+AgBFBQJTJIugPh0gSSBubyBsb25nZXIgdXNlIHRoaXMgbmFtZS4gTXkgY3VycmVudCBuYW1l
+IGlzIERhaXJhIEhvcHdvb2QuAAoJEAZ/SSCYzydiyXUH/1GGNPv/G96LJ8ZNu7KEI/puxxPd
+VhgaoIfS204NEWTLZUqN4qDLAF1LaZ715yTKaMyas+XrPrNFwZ6gBS+FWPqcZZsvUL7RWhGT
+KujazXhsbEdmU2K89OJy7I/S8pH32WcH4iVT/X6SwY+x4TiOMv1MT7/yfl+NytDDUBbvf6Am
+GlyXRaYbp3lCGOtxA5YyPcfxcLl7IC+GQBWzCgr3ZCydO26rbWK6010/w7egNZHb6PcZA2hO
+8dwlIHay+dGH6YTmEESzkP/h2aEfOUVh/IJEcLdht+zairDjwNgYbZbtik92HM6msQtgM+1M
+9FXpn/K63bM5fCAJOKHbmZ4tCRqJAhwEEgEKAAYFAlG3eFEACgkQtXSJZ4CvB9Oq1w//ZNEH
+PNUJ+j0VaWojLg1iiehzRDQsxNA71OdSfTPy3PqFgfDoHLfXqhAU6k74zpA8vU43d7hx5TA2
+13akrWO8cvbluMxQrqZXXq6IDWkzC3KnR9dDEwqwiwua0OGxThORMYRP2q2C4TRqThmKsyej
+lS1ZT57ofrtdieibv06krHPnSFGFLRgDUibrcbCwiaGBO8qjGVxJKGGY7WfRXxvWk1fr9apo
+bfOCZJ1ACY3+jT6nIgDEAepebonkVMAx69I6kWHdFYByMtApBUI3qCb1BrmAMmISjdwVmbs1
+kMEedwndCfIds2txGakAiJzFrCrsaZSyyeKld6NEVwnGjlwuHAgHVVSkB14rqC/XzTsqp0lj
+xx9f1o779j/HH90+xN3+Ted7QsZ+0hHG/aKGgi7e32onu5BaOuzoBUdp2nVzIu/xLNQSLZbz
+NRPLqSWok85uVQqK2hHCWv6dFLUxVcRdjHxda/pmObmvWnUx72IdCbH8bygFndNAh2HMcC1b
+ZI4Y1wD0ukr44lgGuywh7C0p0juZD7k3gMf9CvCf87WjRreLKnOEk9Ll+D0galgnstUWgbLk
+SdmHlvwBUukkVQBSdoyyK+QGki4P6sUSsWA75x7Kh9hNe5R8k1HuwLZR3W2J8l5WnlRmYIWo
+MguvMlKmS2tihmyepn1QKHrWFG3mpw+0M0RhaXJhIEhvcHdvb2QgKHByZWZlcnJlZCBrZXkp
+IDxkYWlyYUBqYWNhcmFuZGEub3JnPokBPgQTAQIAKAIbIwYLCQgHAwIGFQgCCQoLBBYCAwEC
+HgECF4AFAlbm/ZsFCQ0pvNgACgkQBn9JIJjPJ2Kpagf+ObNemLIIpgm8a731zmvDU7VMMTCQ
+ZApVrgPT7OSUHUnGCtb+d3OP8jel7lsMZqMGnqtgfz2wfmdiwsOR7JJ647jU8dUcuc5sjjBx
+A7WV0N9WiRIBKrb9MM36PArQX9MXmRcQA00fe1grQV7ZdB6PJYyjO9x6/qXarC7igExo5YH/
+etn7D4sPQcTJoMJP0FQH0c17GtuVJsf1NdfoI6/lZJMWf3J2lSRXKdlb4CWv4jNo1K/+ogDM
+aYcAUCBVEJ28uKrGaBTRvZVfwjBfk+ckiq1V72xW1H0nZIa0NrYF8Miv/XXfWAqJiMi39/O1
+u1ZTCpu4MXOIofGXDJw1+UiPF4kBPgQTAQIAKAIbIwYLCQgHAwIGFQgCCQoLBBYCAwECHgEC
+F4AFAlbpc5IFCQ0sMvcACgkQBn9JIJjPJ2Ku2wf9FXsNDJckYwvAOhfGlzgAQ4HrcR8xwyFz
+LozEsh9zH4UABUAmAciUEN96Dl3R7Oa26AgHtI0gf+KqEgYXtsjEP+lQmDqU0cll6AwULoYG
+VptAzEJsw8+IXs0NCzLhPGNNv0aItFcdtqErXXJBkiMjn9KiF0n3LM5knP0HJXugDQJYwNJS
+yk6hedOP7Cf5mu/Uve3oyNoRO5OmmNiA6KoQunFq+Rp5SkFtWazu6jum+l8FIdcpN7oohmhg
+8/cP+1MU50L0qsPcXIeOYElCi3AsJ/9b8SfNkF4SSGWOzj9KfvNGltWExXa0c+Hz2pgpXt4y
+/SuWMW5C+9jNxb6y99iZiIkBPgQTAQIAKAUCUySKqgIbIwUJCWYBgAYLCQgHAwIGFQgCCQoL
+BBYCAwECHgECF4AACgkQBn9JIJjPJ2Jc8Af+N+2PgQeCJFGzgqoIRrWdHxeoKKva8OWqLtOe
+qpeyEbHYPHBu78KO8YcJ3cM2O334+iMbBNrAonjC+CAh8uxwOwJK6HoXgFRD58enO4tfd2c0
++fHi2QlFAe6Hibnkp+bxSNmxhotTtfHH+qX9QcWRSfvy9KSWEFViP9x0p1YoLpBr0yitM49l
+19EUGWiGBMjXRU7VLrTngoq5n/NoM+N5uaKWaCMTXJT4MPRswM/saiAUojYLWOJoCAueAg7R
+UJXlA9798hIseHHeCg8bkcE1cm4VDCQgEvjar8t3AKKUq2Xmt/pSz3AQLaVe/Ia7TOruN1Aw
+UQl5X9nBqp3KHOMjDrkBDQRNf6eXAQgAqu0gf53n1lKFLWa0uKbx3P4yH+4zxpTYCYlJQuG3
+ggql/UN9ydank3PpXiyW+oqkGvlO8lsqE+YjraGHO51TA2+w1OwIRKiVyAShKY0zMSPBvUgr
+WH4Yo1rkoQX+k/EJ+DXKEDx6txGBqPyyzU/LSH/n9juxYKoQ8c+6NvRAaI3NKKTVxpIhcrZy
+J42p0trPf5Dpw8vPI6KnlkvECgPtp7Z9ZQhQARruoJsCSH0ZbDku/hFPxz4ablIg2enLAfKg
+M0J7ZxTj/fFaE+sZ2AAMxTwNYcWA3wUo6lYysuqFVduHjl3wm+gZjLHUB8BVoWJAmyJ7jPfB
+pCXJ/a2qZc98fwARAQABiQElBBgBAgAPAhsMBQJW6XODBQkNLDLOAAoJEAZ/SSCYzydiWJ4H
+/jkG5I0nybIpI1sHNmVvFayYn67SeVN2uyN73HtweJ5XAtiuRtcBKVC1m8NNtWXI+oVAOevr
+7hSqKwUdHfMwOEyXVU5+g1ul7BW+2OBGmyDl4QUvh9XppHgoawfy9PZv8N3XL4Zxnf5FVIwZ
+8NLkAevSnwH1Gavd/6dRQV20ymou6b2PRfmc9RNVWMh9MgyoO2mlDKt6t0LU65wI1cM98DLR
+X86XlgViqDc2Z6h38wQX8UaLLwalRH6Ynvrqdy7q1PA7Qz/rdxXcdiYgNyc78hQGfVpuVPP9
+qzrqmjPQWD119ZGT4e5MY0fU+ASk3AMHX8Lx4xf8i6qL/I9nO9VE21iJASUEGAECAA8FAk1/
+p5cCGwwFCQlmAYAACgkQBn9JIJjPJ2LXjAgApw+jxj2Z27Kb0NsQEABCvG/j6to0+hkI6xqM
+/K7YbXII/DzQrfvYLGodrzlfhws2dr1n6me7noLXwPwKCUFJy2OXAMXrf/Hy5i0bCawY92ww
+0IhpSyi+/SZHFsg2Z+j2X603aoOq5I3Sw+CeeledEeWHO0VlJynLHR5XSBCtqQfZWYxEF3BV
+XDeauq2tLRPmI+MU6gUFdOPVB4/0M3IvhX8k/hSFW0bzANHBNefXb3d0KSgAw1qTjYlyt1zU
+pjun2oif3S9pi8yX4PAsJq6LGKMBuF82N3ABzQ1nXO+1lacgLNgeU2FJnqtvByo5oVVabb3z
+eCJPlVdlz6Oj1tV2kw==
+=E8LJ
+-----END PGP PUBLIC KEY BLOCK-----
diff --git a/depend/zcash/contrib/gitian-downloader/jack.asc b/depend/zcash/contrib/gitian-downloader/jack.asc
new file mode 100644
index 000000000..db9967233
--- /dev/null
+++ b/depend/zcash/contrib/gitian-downloader/jack.asc
@@ -0,0 +1,449 @@
+-----BEGIN PGP PUBLIC KEY BLOCK-----
+
+mQINBFMfofkBEADlyw6v1hGBtnIISujt/18RJcVTLAxYtfe3DsGhWqYZN3iKGGWb
+NJ5vZcV65FVH/70NFnmKlvYp+tVNJcoRtEYpfwiNG7nIyOC4GgaSLwkNVgLcFZhV
+mNj2RIJphjN5qsWm6ut9p9CyhWkVNJYDP65gqwShZQ2lPboo9s0XjUF78SrSshy2
+iVij0xu6oqdjwqn1B7L3lXVYCwxReCvSdFnBMpjGUEgGnbt7euhrViFk8FrUkAje
+2tZA5FAUA/t2Mnc9JREe6WlbZ44mLApOjFdw0g415FdcnS2GGaYuXNG1lJ1yOA33
+n9JXT7A31wPyiw5yz7fxgl7ZNYZr2TsRjBlqEhf2SCPfqU9UlhJ9NqApaPyCEr+8
+oZQfZ9r6stc98MlnmdQ7p4SmKRwCLiBtgmrB8mbgYV+iOwaKztqEoma3FoO2EJ+j
+Gx+UrJ0bIFVr6sL0ulfneYlY76wWWRpB/pLLgIMmZw83uB+JDBQyZFXcAHj9jMQ7
+ZNn0MNQ/I+qcmX+CRAyl2+cQHUVbbQWDjB3crZlpK5TGw/x7w0YxBYAH8Us5JqJH
+QOsact8ADnE4IiKm5gVefFmNX6vsljkNESdpAMxnB7Ckl2XV/r5sKwrdxxUbFSxp
+IKGx2uKGUs4oUffOzpKULhGBWypN+3fVwvP+q896Il9hgyx6SCQ8AgPHRwARAQAB
+tClzdHI0ZCAoaHR0cDovL3N0cjRkLmkycCkgPHN0cjRkQG1haWwuaTJwPokCQAQT
+AQoAKgIbAwUJCWYBgAULCgkIBwYVCgkIAwIEFgMCAQIeAQIXgAUCUx/ZQgIZAQAK
+CRAOxR/NqU+1Pk9EEADHdpsmrA6ZKU4EmBZNbw62D7tAo00Fh25m8OuIkXtOqEbF
+/guTZiZM4nbhZpPFG9sCN1bXS8VslA7isOedbznkKnSK0BJcrzldwKzW25cwptoQ
+CCqTUarYbhcIzEOKNetYqICWrVTy2Yuc37maA66PnRLphV7pP3Fj7eN6aMtqwtpJ
+YukIU4LAjKOMJ6gwy7tjsZYbAqgSE8wRJm7i1MfO1W864a1l2a68Gooz03NC6mfY
+J8aW0y1F87xMJIgZeN7OyHf2AC4/Tp/cL+Gd3HcUuoRjmWBgaxH8tVNgfxSIUMNH
+5pTdDs5VlRolwlOEcTW5VxOSu5C7ZbuKyFmbI0DSevDVGS0rxSSizjlyGmnxkLU1
+ozpeIwTbwTUzvd26+k8cidGodKqoNoyAXzjaiBXYKgIrVeXBMHxCGeQtGeEhQR+L
+OXs8cEX6xpt9g7nKbNki0Cfv/lx9Byn+0v9RvMJKDa1mOSKbNOx3NJ8+ewdTVkTs
+iYFTZwpJexbfovPYqTdisiO7dv0i5teE8sEj25icdPtKYvn/55JCT67E8MVZaeyU
+YOaMPtgsiOX0v68NtrC1L37UuBykQlm7FdobN4Sg5FnLTt4IWktf0/vsaLdhRozD
+KsbTmsumCrScAwZfa0H3S8WqK6yCEKjPi+J4xG1OZP1WptlV41wLnFKkeFaZRIkB
+HAQTAQoABgUCUx/Y+AAKCRDV3jiWlKRlsmU0B/96eiPHIIvapoXKoZSt23OFjXG+
+3xp/Zzf2Ug0384FYZJ1eX/R2IWsh64CVvOR0LMFvHvPU7SCMu2OreNHfPx/B/kn8
+MmusGy6JHP25A4BWzs1eeyKgYQTFz7vSCeAnytmcdBot1s099upIRw4usCLhdxzv
+Qyx6TogAacGC3YFj7o0agz+ApPnCQZ68kZpDOCDrtOe/DRted1LLXM661Cp15d5R
+d+91ZSKfQ9xjK1d2k8iMYJqWYll50DalGtzPGDB335gX7agliI5dYiu2XSLyynhw
+/7f8d0Bz8KVj7pgCroAVjTSdHvZfVcZJU4HST/jHx5hilVUzkr9NK5YONJ8SiQQc
+BBABCgAGBQJTKlm2AAoJEPvivaOtdGgqmGAgALl0eAcUSF7IuloPT4VyJeNGMuOb
+7aN4yYrGBM+y7Ij/dTWSS1yjlcixsqd+s0dqGse6RtJkyhkisEmNdS7Sf62okGDl
+ZbmhjvMQteUO1zw+CREdfx5oMpW/eCHq/Pzw8KRdp6qY0wBRj10GFMAaMX8XCNOh
+6B6Ti0AQ/424yEvcPpA0zXwvLGylFozRxjK6qWEHEmW/+knxYYN/W+8TERuwVJSN
+F3jBYl73DTVBZ4bzpu5jMSydhRD02nV2LbnolhbCzGllLkhQw6iFW36br8600Tba
+loQhcJU+cmuCId/B6xXcF+fyWqmMmm+b0UFoHGRBnXCf4gBcjCK0UwJ1lUOTY5qg
+IYJTrBpCrGAoGTd9s+1CtnnZFlIcwFJB7NwMZEsTWvOvO6sZPYP33ktcUwWAKqNj
+3sSjy43kdfUeVip0jzV0K5uStC+DiVq8VwH7uNIH2UbkQZato67WgShUCCaSvf2p
+HapSRdrmwIaoANQuEluhytdafX7yqJXGkhYI0Ylh2FH3oZyTnz1XoB5y5T1OpFpi
+I7CgjRO677aieRsf6HACHPX5mWcq8zJQ8fuxoHZ5GJ8FEyk6ULUgFJ3u9SgG5k5I
+vP4pK8+lP/d90Zf98Uaq4aMgAoIlrtwz68Bv/KUlpwVWhiIgo89C5UwcTUNQOmi3
+0PxCpamM81NwGPxjZAqr/+0YP3NBtJOITL0oqRCxcHCJ9N8gmqUmUEgEffP+glsJ
+p/mQeJEacmR9loz6WAB6GT9mu5TvX6bZ5EawnluQ1mI6Tn+v6ltjhKzPzaVhOo6d
+iKriQFZhcelX1qDnE3zs7driBeacuKGt4URV8A+UDGJBeIAEfrlszor3FQ0qOUPs
+plbcbB4YudUOhlH1REtGx7zWVFefuy80ZC7abHsPhWkJow2axWlvPqjSsd/KgpjG
+IAHIZxiYAozNJqDNluGx1+qa1d7/YINthZKefhkG3XDLuhgxvD8rAovyAFW/8Vy0
+S+GpzUVtC8HY9FZf2gRkVtZQGboZck2uFyIaU/Ni4ahX8Z9IvtsU9JPLzp0HRgAv
+9kz9EyRZt1viueeIVcmadHirUe1IKqndeslcXOX4dUF0nrqP1+shYhebgq93rMPR
+yH3EsoXtAP1KCN8tWPdnlDnMY0Zpy32mfCL0hMMnH+CY5rARssSbiFP9HeWk/CN+
+yES7FY705QmV/2SV4rEngqnIcrcqEJFp49JPihC1pSikHCItzSVFaODbUl4qhTjn
+Tjtl0pdFQc9ksA/6IEOH/bufDwtxCLwAjUpqyNGEH/8FnxtwotsTmhmTWMe9vxYe
+YStdTLkAvJFMVEU0W+H2ZZG481P5/8tqFS9cHEU++3VvuYxfipwjpIQhm5WJARwE
+EAEKAAYFAlMuEVwACgkQq+DDGd8KChpPGwf/QL66k12OzqI40KQL+UbzW25vxbmE
+OyZ1MT9SuUVt6Th9zdoNm9Cosi9kOiq+DPLFFT751Lmm1hcM0rDDNeN+l8wpLwX9
+EifD/bQ7Q5esM8NJmGVyhA/Cd3wkp5yYNdZPOu9/0xpe/Px4YgficRErhgyVh2Vs
+svQRQ0WcTYbgbmQFpOUsjNVOchJMFERSJaQxWgN3olYd5DTDxPDLztt3vdBCIkz0
+4OAotZqbqdnmvlkjKjzrJylfCkyo9bOU471v6Hs3mfUQXo9nXC9zGETFWsvB4WCC
+QdWEyj+2K+PcdZU0FEPonfTouVcsR9oTqQqqfg21M7HUHSmlrOyCLqNnZ4kCHAQQ
+AQIABgUCU2vk5AAKCRDuYMDI7nJWqGIzD/9vdI3uUUYGCaURAprGEo4kk6JP2TcS
+AmyO9Pr8bBdpmt/DVFK0zWllQ+69QAWLFoCmgjOgWUPRNWA+ldG5lzExjuuP38P1
+4HupPMh0yOd+QUod4Gdi+hqPCuFT4/oErWZcOGGXAw4ZcvdEGKY9E975D+3yd7sG
+HGskvGB/UmLIBQ2XfQOoqk0A9eXz55wLN1ia1imHd/0NkPkQOHkjTdOtHhcBhuoc
+ttex9HcmYy2g5oorG+7wx0EtHxIhuCcRq1wQgXm2JtbiFHXiH0MpLfBr29kpzH7y
+8jompGgAJsK8uRwTC8UFWHnx0VxnFQ+4vinqlgj7/O+WMZ/siDlOZDo2RC3ts+Ct
+91kYNFHsycrkJYuoPzNcMy7mmixQFj5L2VIG1Ne3OTdEPVWE5jIQ/w5IX0aYxNt4
+ANIZJA/r1AqDqDEhto6gdnkrVZSJN+Mvd7yj7XTbrErpTmQeNkGgb9ult4XaEOdm
+bjAjE6rTQqFD3Tn8SeXNgkJFr0Zb8lZypmOL6cxU4vTG66blJPLZGuaH3yCrtA1i
+ynZPrV2TYiET+fhg2TBEXbjLkWHQnA+7sFFOTgK5WOqc6vK29h5ssEQKIFodDh4a
+e88tiGLW9lSc+YWRpKHgEc8QDXIuBrV18hZEvbITvLZnnf5uIFXJV5ZCHG+o6I+Y
+jQrPY4oC2HGrMIkBIgQQAQoADAUCVRRYygWDB4YfgAAKCRCFZ1M6Yr7+XbxwB/42
+Kbk6DpZueEK0qtdoLUh7H+dWfwA0Gsh/vCoS6RM9iXjKPBoQGlbCBpsBpqCJkGd/
+iXH+tnkU2dq4BvGc/igSHadNYmYq077l1vu3pJjDjxfQ2qZSF9D27EUzlXLd4Q6s
+hysZ18HoTehxr3AG33N1tEm9kBUfZjeMZxk7zbty3Lo7tK/UYN+4mIgYqLc97XIe
+40Z3IyFcb4A23kLi7AjFVFto+JdEBQzS4KIdU3ZjhOlg2uGQdqGpjSeCN9MjkYYD
+lhepjGEQzFU76x5yynruV+U/Wn+TvGhGMJhcNrebNRCZbNsvTCPMA0UlSoxusbYR
+HX1Fcy6qzYt/Ax9ehAItiQIcBBABAgAGBQJUI6eeAAoJEBCd1EKVjp1/eucP/2eA
+4jDnQcd2Hv1i43XXcXjUIAhggr4dGuXzQqUzjpzxyh02pJuCxf/VEjug0kE94xrB
+ZEKpHyDyo1IlFUnnoz+LT51iiUMmM0IAadMKl4cuvFzO6BH8bPnybEaw8b/fXBkX
+R/n+t6TQJMqkjR6gWX71HLHwy+8Z6+ospDq2IKnZuwX811rd5u/H18vgHpJ5x26G
+MoyucHrduEyec9E8GVZnkwwBK6pi4srvr9qLTd67djr3y2snhkAyAu0ehox9YBEH
+zsgM4WI4K8AujiFLxBe7qrNAQeWRWUbLw7zHo3gYRzu4Sv/1rKGSB+wVZpgYIgm9
+Lhdtd9kd42XrV9yRgnDb8OvG8IW9KI5kLln9v0QHOR/ctuqnn5oBCTqpk6bkGidt
+k/vFePyhQkVn7pxcomxeyPTXmakuTXG76S4z3AgXfY5nq33i7Xs0nxGE0Ak4MXnD
+GoNYsFnmuQL0x53m3BI6jVoLa6hmm2q1NNDhcnXVr4vW2mzRBTnu4Efgg25GJZcp
+SAKLbf3+tMnbfoilo0LbPoQXBY5oDV24rv9lU012J7ryyGgetSWDX4Kq51tl+kMK
+bUtoC7Ew+xTkghr/MrAAL/SmJN+qJI/upHcPaRHpkvyb2vHNuAqpkKZP7Woq1AP4
+cSNHCTuGqLoCU3WV7DJK9IYY6Nx0lcGaVoMpeXzciQQiBBIBAgAMBQJUtIPWBYMH
+hh+AAAoJELQxtndw5Ko4p6UgAKS53UyHIDowFgBQC19Iae//3p6W2MP3JuKUSd2K
+SpydYNsKKq6sTQnUrSJqDS198ozqrLbAZCoV+3PkDDQrshXCOjyyKvGpe0kys7RD
+PakQbtytthoqMXShFwUox6t7l1Fcu/PPgePV/IGsnRxcH/2GeMCnPzUafS3j1QXN
+R5c2NoDDMVVeyEOaIz9kn9R0BB8L3AzLpPAkm0VM+hEt3My6ySKK+ZFMvnZ6hEDa
+G+0Jr+GUKCDuQoNjXiaFMW0RzvAdRysU7Sa6wQ4QqLmNo4yuMS0VP54y5OAJjIIk
+vvaYmc4NmbSmUDBW/0g5DS0tvWBDKkFre6WRBCgBG3zNZRw/HAxXiYvAIVdugTtS
+X38cwNZVTD04w1hgbHRSAKX37/Xbiz5+CMi/LZtyKVLUVIxmXGd8LD720QXnENOx
+RnNIfcQmaAB8/nLutGxyiWMEchhbGkh1LOS9dknb00i/0+vIIhJHYDW0hbWZ7AQN
+UFBHLqXGjf+ozwiMeeCHGkfrnN3fG+s0vy9fH0Nnx1d9v2fjzKkr0qEFpbPOl8p5
+g37B0bFRtIJkYtuYXJhfZv/3g635MC00jKNM5qlC4EwTlt4xk9RNwkuMcwYstSG/
+1RG6SxCxJefG/KJFCwDXG8Ts13OdgS5pwD4yE+3MDdFBTAXMBs3kNos6r1qcS4fX
+wyWR9r3ZgBI/ZNJ6miDMWlI4knN/m0uneqGfu8t7rlDg1Jl5l3vmiWgc89TirReT
+nucGlonAn+J5PKr+pR1bRYlA6orX15B0/jJ2iy15n8YxTf4yRtgMpkcCvxSyIqYb
+07XNk3RcWGU0YU9XhSE4iwp1k+hmCNMdpwN5sLHDdJfx/lIcNUYNzrhgvbAGJp33
+SmwfQoeD+zKUZudOGS7YxGxIUL2gAOdtpMCzHGFWFL+r66QRh284mXqOUq8bUFd0
+vWgG+zD2espSk2tKZI3LVY5ib6kXr/ThGWenm0wE4KIzcRRD6FCHB/aWDpCap4Sy
++yT7mxZ1yhTvU5nNdwsZZjvfHigdcD6YP1lriIKo71qqS+TYu0yoBxMrH3Jovlj8
+l2reohJ4ayfYNJM5foSlJEPOCTPmrfGiXV+e6qC5RmLJjEQUlQ4jYkPeACXESLMY
+MEQiYsZQMZl4j081hsKsVbZo9087PkU7AR72kUn/YEfFkd7cQbmkXMP20SDt5MHK
+DGsXJYdQTSedwUJQe4gd23CguuHQ9rOvdHgSKqQjHhSmv3HFhi2Hfjw28RVM/AU0
++uOUYOFcyzbLhDONa2/ku9p7CxAfkKVGtaRavNvntKwi74R+kvwfwsSmxAQGb4a7
+5R7t923xTHXQJDmw4fPg7Nzk3EWkVpIO5bbONoihLl6Sm0CJARwEEgEIAAYFAlZr
+l/IACgkQWArpO7HFY1mt7Qf+N77wpV82ixI0p4noJI2q0SFVCa60P4rj09xCGbWk
+xHxXPakX8toBc+QR09f7nPWrzNTXcxfeCGpEu15ncJtsOcNrTW0n1i7DxnpkBqdS
+nzj1++PZtTzwEsusbLeH74hnhUskskyiKDRpDb0yOuMlX4AVlRPusFtKMXeJBqDF
+AqNoCQDteplNAJ0JQbG5SUMUATRSbdwJOZcibpH8Rm+ZOP+piIqnnQGAqtIv3s8W
+0zEQxRAVjX9z/WeUPuHxOvQkUuxz9baXjKNNHaDUqg9a2tdeDRPqmIYm4+uHmmwh
+CC3F3vFaspFCmGJy20z3nwR1Nd5IujEa8e8MGXGcXRNfpYkCHAQQAQgABgUCVmsx
+CwAKCRCEi69bm+JmOZ3zEACwW6XvzYqcjbKqodWII0nQJa1OrOOTo5RaCM4H/CtZ
+mrFBI+yLZKFuSlGVu+rwUofjjFTv8anPjwh5afuQfz5/OxMpVaQ6IP8sxFsMJGIi
+GQ/VQ9dErvGXfZmm7PE2UKb0D103DxqOwUJVJzg2uRbywltqFQlOsucNdgPngvcn
+sdcCclmS40RMs/SWA+FhBZeNAW4OEYilYqGA8eHBSQAfbJCSoKjdM3jgOKC+ew9O
+dtpId6zdzkMhKtzIDtkN6318UknZA63z8OGx82o9o0waeECaHlkQxXly185K0/SD
+lMgTogNyN4uo2GlzkWfdslEHnj8BtYGZKTF0hNCK1fUAnlG4u1T+E47xwilaOygc
+K9rj8a1y6Dx1AtHBag5nsKKsdNispX/n/K62ahfFI1pyp05+mowoUZAsQqrPi2x8
+vWaZc+w4df3jHOszhU78x3J8grnQ5PduHY34UkorudLp0zm8kRxqNTT1qEIeuVhw
+75J1Jp7oinODKhXeJHgsckslzgOM8/9h+L0a0dmfSE8/wFUbU1hy4dmLnFD+UpYc
+TbB9WlxFT4EdChCnPQSAkRr+V/B334JkS65ehVUJZeTvrwgL5UW8dPGScFShwr+8
+sJBP1Z6grNx7xKNm18PbgYPrNC5zaddbBr3JjnphZXzpUvJgPfYLcpp0S6EOe+pi
+I4kCHAQQAQoABgUCVmkkJQAKCRCU4aHsQ9QWWGVbD/0VuHM/LMo9WKEL6vO4CFVY
+kt0gRE2OuTZaxZLeJk+RqH7ds8jc54sYOi7VBQ4IXN7Z//2e+j51elnhCR34jr8/
+7l2Rc/m8qriy1y8t/DbakeCvpwBhidIMNpCbMvehO8wXmi9jmAt6OToNVtqBZdX2
+a+ImK0Gb0Wc4/Sb312y4E1CYw/f+exlE0LGoOf0BeF7dVhBw7uBq5SG0Dz0NohIO
+FL7wJfjQyyuyz7x9gYL0gQN+2uP6ANzY3iNBAhchx6SvGiwRFs7Lo3tNgb/MpUkD
+yzhUNTGcT+dePwk67x5GZcwCv+i1Nx6BtNbVWek5A6iTeioIkBu9naP5BmYqGBsJ
+2tBztHPc1U3Bsl7Z9eJc47u9n/WR97YmJ48nsADQ9gR8WI0EBlSd4hiMUHp5EG0e
+Udhjl9P/dP5AwExbF30a+fhEVHlHlwolu6Qdch/Esrikw+gBUI0xuLf0T6a4x4po
+nYITIrUrOsFURGw4FJKCalHHfp8wCJ+YkGGoBcg2uJRUvXiIXVOx0YtLKtwWtBXm
+e0Ejp2cksyCrdA7kyQVhyJdy8yaTR+1xLSJXGWS/rZuSWQCimWtOUA3tulI9+x97
+O4YAg4uxlENOqfKCuXy2JdYsP5PqC3MVSHiNdihLtqCYiDt3zUMCzx7IEjREL+IJ
+iZrScqkHYYcoNgljhUui3YkCPQQTAQoAJwUCUx+h+QIbAwUJCWYBgAULCgkIBwYV
+CgkIAwIEFgMCAQIeAQIXgAAKCRAOxR/NqU+1PsY8D/sELW/w1NqLepsNUKuhS0ox
+67gaZZ2++I6yQr//gmmajV2VjDxzLXdE8B3UqbAXUvpuY7Hg3aiqMH317oDGyY5u
+dhd/59j2PeSX+1X3/WvIUmLfWqj37x0g6jq+/M7rVa6T+Y94VnCvrdr599i64oa1
+8h4XLDx0G0RgJBQKO58nbdswuxTKPKkqdPwbOdM68I+Lfct3NKoi/5xxRgOw4FAf
+zvPrWsxYGCGqYRsjL6Y4T7GohfP7pQ3nbIzdU+zyNyINzvLg+e7NJLD0Qbb6CC1S
+3o5EKW9VWa6FnuSt3h8hi0DHH1MNkJAiHv2zPgUp6B0dZ2ARV61vkBYthMEn+/Hr
+9+aBUhMDKGmxDHaesCYgDUS2PDBMNLrtA5qqQIMQGNEyYM409JoBHU/QeBYX74+8
+vKazxEaaHWaDuOqyCVMip5RyyfNhxftrxLWp7CHTB+nRcwwBwkJWmuLAjNoH25Mt
++MmQrBbjd7j9p/j0OJfck1qgHPZz/6vI63Z7m48MDYtxdGAuD3Cb3yJuxeHytyhF
++8ynt70oVWcdyOsA9ZZxIXS0qaxuLlNQc0MTM7k6UjYQrSyOI1OWzEgl3SQFDBYt
+ST12Ggyoh7dfqxZhYOpXvG+VIiPzvnu6j4Wq64Tw3RirD+ojt1EldqzLHwIxb2L+
+6q/oOynPBnHC4MfSfPCzWbQZc3RyNGQgPHN0cjRkQGkycG1haWwub3JnPokCPQQT
+AQoAJwUCUx+7EgIbAwUJCWYBgAULCgkIBwYVCgkIAwIEFgMCAQIeAQIXgAAKCRAO
+xR/NqU+1PgdMEACCJCQJgvttBHE7WVJ0FYz+pGUi8vs5au4+MtUVctodLcsHQXUE
+bIvfNBeh8KetTQqpLJtN0T1uc976UGA1kHGGXxSKll1q7uiluiXnPhRgZNO7CxHC
+Kp+nQ8l/W12etUrkIFSug4Yzbvv/gWNraDDn+cm/s5nfNTgM+EbfAHmr5/batSus
+hdNMJn5ysUn7qKL3dBAnR7LWu42SkI/fOtF4TOwQwoNWPjvs722r2XwnKtreibX3
+n9xveWLecILHmf1O7lUi34YGlddYHJYp1T4/W4gwZduqtniscMHEOnFquEabUKoL
+V62zpaWa5KIpuFotxvaOjKkdSlr1TB6bEdOR3NJOr96rkVdxzqEhxiZlePlbQA9N
+F1RLsAWrE0wR4t5qZ7EKAV5hhfVMhkMONCUv3EwFitiyY1p7cfj25dMa4EjDlKHL
+6dye5OTM1Q0GIfidL28ysPMn1I9Eel9a7R372uVkOXfArvuDh0BmlzCmYik0GUDY
+FRVby94SZB2QzAB7GL3fEmpmySRull89RuYBZEvE5zNn7P7rnCDtsdorSfp9rLX3
+8w7mFhTYFBwJx0dtadP6/PDnJtsnZSzUzUWVmk9pxotQQiwHG+eQrNlubfeD+HZb
+fqRSH7ZUBEr6wQF7yQ4pK6+Av0D9oda6izIEgO9C5OW6jj/mJ99cEixy0YkBHAQT
+AQoABgUCUx/Y+AAKCRDV3jiWlKRlsrMzB/44uAsSoKAutktML0R7O2ZFA5cIpEti
+m+gwG0XhRny/FdHqC1TicxFaa8pne7lpiFPvvbZTf7c6brQlC60/f6uPIeZ2AQBi
+SDYYyMktTn+1YhaqutXeCySZGK49as4m0LYvsqZU/SYor8L6CYDcupdtwDHuKUTv
+MKhvWsqvcEBEleG4j/MG3sRi94ErApbjtLvVisb3ljdiJiP8sjIdtR9HADo20Mxu
+kXXXEf2PB5mBoLHtb6QO2vhi6c8jt0IQylEAMwCycBpSGuCOxwq9Qoj7axQcTL1+
+BDr6fj27yOQgOBv10tz7iHIayaRgxqC74Nb8Qa+LzyGm4bOmTkR5GjGBiQQcBBAB
+CgAGBQJTKlm8AAoJEPvivaOtdGgqEakgALu/zw1rrDXtS14HclEikrxdCWoG1HyS
+o4YWoNOUyE85FBj0fG60a7DaEIhFoAj80S+yA5ZboXwbEECoSqHiblj37f21kIAU
+kV4DfoaJ1A1sOtCgvnjFsYHhui1lSsCuZIEH4GfBnPM6gZ/MScjbYxpHyTtAAJin
+xdHWkkgV4gQkKX/xdNGV1Ru61KoT/cqY4sjYQaDTrApSgR5Bm2I35kg0vPzib7z6
+pfzX5RFQ0QClwIdeOBEZr7EHs8EDhj9i3AZxokCoXsCnXAP7PSLVYm7KuMNvpNAy
+9SKo2gXLaaTkhw2R27Vr1n7/74kcQQiEuvFYYiXTmdKcdnhrSM+HrxXu3PV95sSB
+wlzYOrHdvtvWkc5IRu/DP1yU+M2b3J5C7Qb9SlJSDe4dFxYcPqdzdTnoRdbe3WbU
+KF5u1echNX0skVDvqHsTVhGnfIhhuWc053wwdVaGIflhAo3y7k/PLjDZr4KZgnVh
+ItxmR62j77+qHSLaCKW3Q7HroBHLzcvNNTknUiKPGRxcy6ot3e1PJNJelMcRWZZp
+/VxtY5441Nvc+CMWFQD860sVYbMi14tlRV1P4vlTwvNRLTdqat/WHRL+NOJc2D1g
+/QPAuzym1xC0j2Lgq6DZ1hjGVekjQ1Bt5pp9sIP+04s5F0Jt5c7cwUY+xFpA6ag8
+3fRWGJHkKwmaJqJOCAxq5Fljg2x6h9O+oAppsAf65k+cGbIV8rT/kuZ5mwf1vBif
+x2DN/GeZ3+gAqqJluqeazKSnDrU333tPwMDwPKdGlveiDtoEO4m0gyA45lrOEGcA
+yaUrAg7Z/ZRHVKHyNhK9+nZL7EYvuZOqKZltou8DS0x6lddM3I98VHQe9vYhymzV
+19cijary2JLCfTjd9QXhlh6AVND6lksZQRppiek1CTjK3KEuw6bWYJl/+paHaczf
+cKVk35d/pGKi6NptZwypV4Hiez0yt1cF87eNiObhLJ+lOTXe/SgQ+y13x6xkDB6V
+oxIZODrDfGubt8ur0REjZtms6WRuVPU2YR/BGD6RtCy7zwObGSuuS3opsyy8MsiQ
+9ssQ/iue1wIJtyztO6WcHDwjG6wm4cT8uqiTcPmmih8P58h6xDzXUyz2846OnZCf
+nUNvMbKgEkG0ZfLCVMA9F5Fxx4osKEVe0DDnMHB/TCHF31nK1VW+Q8bAzYpZu190
+HjrUk2l5kU5hRadRG1O0GpsMZ8Hn7hIWILuqmvmfvQjrWECJjVB7BP0xhScAnOaw
+YYCup3ii2jjFWzC8rNXsySiWDJ3M7XZ689muMgvX88oOA1NlhWQhqv3Wv9MOyouk
+S86K1TFIQGyvgqgj9rTUF9kGveJUXYv0YpEXAT610a0Zcc6s6njip5qJARwEEAEK
+AAYFAlMuEVwACgkQq+DDGd8KChoJAQf/SqM7GIzfSLgHGDvdAf0xYywvBfq92eFv
+eqXE8GpFnBfPasEqVZw6avD1IahVKGVFbnFn2xak3TF97/Uu6akFm4kH4bejxjeg
+pnqotx9vaYLVacwRqLuc5Ha3Tf5nxFlchgrsZRYvbvYRnfq9/gNzYlscRUJLnpUT
+WkSMUF8L2tnFuRQ4MavzgOsGonAk2snrH52yyZf3PObi9ysh7esYnYTEzp4VxUHk
+PCuEcRYfOalkZhXU+87/fwBsn04uGQko0y4U1qEUMDnHrz8qLe5Y4slFEjmce+3Y
+YXyRn/SiLtgCF3U+JaYkXmnB8WWF6RB8kGNMFeRDCAPnZUKp0F1NsYkCHAQQAQIA
+BgUCU2vk5AAKCRDuYMDI7nJWqLqaD/9ce4f99fAwyhOqI1sqXhqdc+OK417pW8j5
+781Lw9HhPsIZyDEqVOFGEzYnWmw/Ni1B8Z9QssNwdPgDGDXGBW+EwoMEIXY57j5l
+HoqinBR6c4fsI3aid4sOiH6AlY41pilyn8I29LTjpzKTZ/F4BYgAPhcoqFjLhJA6
+KNoXwXzqRIB7WiK0Or4X5Re+44o54XzaCnyDq2S9xPgnUIwTIzOp7KH0y4zXt9qB
+MtHxS1ECxat/qIlE7+u8ZMzjT3KKDJ2wHpkq+a3gdH9L7+EuISkanioQylMiK9TP
+jihmhfPU5ec8p/AtMHMnHmdAdDTA9jGS1mfNhpNvNkoD6/9WLYLv/TL6EjNdX45U
++BSG8zU6EzvtMtJHXTXgayCsauusnEY8CIYoxRvgJPczgIstoHrz7wCfeEkRez8y
+J8+JFcRvOHT8cfHEKV/BXjzVrYDld/0oAtbs8tmXLx5du2oaD5l6t5RayvjH2+RZ
+eKvTp20y03lyTeGXHgi0Yvw6aMdeg1eQ7QdW+wOoHzy9XEx+3AE2kMtTSvqJnocF
+YFcAwPfTBZGSKSYeVLO0REEFiimZqAn2x0utQihqz3yOb8IgnoC21sl/iHIBOjhx
+NH07Cn2ZE984TbUEP42abtASjPsH9aZyAEoZXBmdRypRI4InOH1/I1pcNjYZ/AZV
+8osY7eULgIkBIgQQAQoADAUCVRRY0QWDB4YfgAAKCRCFZ1M6Yr7+XdDRB/0Z72zX
+Cftf2XhhXduwKTRuSVfJ7cXOc3Ha9/njgW3c1s872gXLRxI318HBOxHrszUs1bK5
+FXnEGnNWRr3FbwoH390C9uqu7yXDI6HvO1nc1EtIC2XjVd6YCy0tjfBa3fpUVk2C
+K6WgD+0BCMZmeZ/8CS4wkrswjXuUCpKYpMlNzAYplwssJ4XdpguNROF81l0aCz/5
+NKtLzmD9RMityeeKD69MIp9QEMr6rahzHI0wDjiAyC2FHn6MCGGeblcG50IYzLpN
+nV2AGBreqBcyNVcl77DCNhJb1+WToB6aYGYeye7neU8926WFEh4a3MamwukrjsbJ
+wTsnMR80qRklZrD8iQIcBBABAgAGBQJUI6eeAAoJEBCd1EKVjp1/m7cP/2sinC99
+7uSNCyEU2bWzFW4EJVe2yUO0e5fI0j6utHIvFV1wVYXoIUT05YIi4YyXwU+cjOhH
++niyn8fMwMIAuBSwGCf2P7j3ToKSjKMeI9NBHLq6FBkOPo58NwRlXdlbuhkQK5g0
+PdHXrzoRKegHnookviDF5DLolIWhb/f7B5LezBtc6m6llhr7natTx3mks4KwVd26
+VaHFJ2NEF9JRi9/wzZlkuVX0a8e8EbEGXNA8eGwIp0+W+I9e8RrbM/3fEqV43r/z
+CgvRUAA3ZG7nLKgMMZc2P5P733MIwC9cSOnDX9L9Qj/7LwYVMhExbNyJC2X1d308
+77Q1dZX/LWNb88pkRVC/9MWtIN40+1F3UAxVrnKNNpjX6aFrffDqT17/Yhv1Vtn2
+NY44DyCl6+F9dD8nOPVoIW9kskHn4ejX9WUGm/kuOB98bEYltwI/xZcOsEkv9Ngo
+QX6H91jNvL2Jy9e1Pn/t71hmfSfzU6pd0UehWRp4wBD4OkdYM1Y/vjxMQoeoVa7j
+8x8xG125kWxECZYEHtoDj5LJNKRNdZYJMHgkC0nQDsBGyt+p11K99AMXR49KmwnE
+3SMz12S+P7D9gk2fm7KJRjt8O1Sk9ybtQhzTE0iGwBSWtrS/9qO8N5v1JHYSJ513
+CRumqKiid/CkrCsgpGFrmunLNoSTBIvqQcMfiQQiBBIBAgAMBQJUtIPWBYMHhh+A
+AAoJELQxtndw5Ko4oE4f/14d4Wm9BvBoDo3fjLt0CZpzttq/h0OOGAEcJLW6hyNg
+MEYIXMfTozFdL3PXwJgv3j/lgnOBd8o3KQh/rWXncKpujnLAsGjhALgzt4fH9B0p
+UlJLVjrIddzEMSjZS8c6qK+pG5egBAStw0MKwql/Ma4h9aQ3HEzvDzhkvuGEYaeo
+PLzvxMYT0Q4DCgSY7ees0w2BkzdOFIgUHRXatqUPusmKYWVZZLdmD1Em2K22u7Ki
+DDvCjuh+XbPX0uOjN43T+Sdoq/kZQcapFFQRciRrdMlf7rpU3ncVjXmH5kPMJRqS
+XjN6lH0G+4t1NNt3Og3uIXRMFCf1tOuYPeCsLqIVi6nGzBG8rf/wbHhXZ2XGjtLd
+erHAgg8OQ50xNb/qUK5dC3y2RpRtK3CHMufFIpUfUdQgsP8ffzNKe7B7XVcwVmDp
+lqHMLSSMRD2/cM3Ujx2NkZgC9B8/TL/4TY4ym2P//vMiH94N9Xeu4tCH/nzeVowb
+AXFuPiDoY8gui7sNnV1uh8XxZ+3EAsx80Ncey+zTME2WpJk3NKKdOLPcmizN5YaZ
+FfQq7JkNoKhD+AwGNsPGisn5rQ1SBFjAmBQlbjmlMjVfcwj6oJsKBNGC8g03OimM
+k1evgwde4sP9KHywZFaPRgPSeoDx+gWXeHT4W3/1M1tzYJ42WZA/EoLmke7eHeVG
+FlhHaTmWMQWc5WLXDnk5DROUmuu1H6SGpYV/feEE0J7RSWcFUFyfLADECF+eWz3R
+LZe9qh4SP09RJ2mB4bhNylKmSc1D+Q0vDRC/nZtJ73JZ1FA3IB7fFnXZGN9DewZf
+ALu+D0MDQRH15JIlvfZ/ikO1RtuXc+YP7ZeDi2V3Y2kN4DLRuuJ0CUFcdWQ01j+x
++i8LEJG/5Ap++HlYybdBNqgo3eKnf6kexWhzDAauGCqzMCTiK1spL7Q0biYBq+qF
+BXbvBqhD0luKYK9mKL7SkO+DYekPSFR9UY6m8DyBGKzNe4mjY6WsXrmjg8KFLWBS
+Z6lq2u474uUvh4ClKN8aTtK2U9e/UFceL07MZcjxFW0iMSRy3SnEgOiWRi5chBdD
+97Xhh52e3Du3+8cy1Cv1NIJgMWYIul7MHWayhq28Z498U84PFVaqnAdN5bOEtpdU
+kfW/1d/qSQIVTOOtVqlWyib8XbILhnfXe9B7IRHI86U9Su9KodcnAzxYj0uBiOyK
+ujWjPjZpOo0cUTttycW9D0NouhvdR+ymmQ3TcNpvFR04SBitx1s7rUPcEQtbRN5l
+RR7EfkPXrYlOzDx1HAhcjfxXBmUaKLjC7KstYIYzZVnx3vCtn7p2mqg9JgDHi2E9
+IX1eAxtJZqHP4lxFrFAUUTHMIqFQTsBeTkYBHMAiJEOJARwEEgEIAAYFAlZrl/8A
+CgkQWArpO7HFY1nRdggAhyaD5GnOsTxhV5LMAQDye6AJi/luEhM2KAyKNpSuqtMS
+6vZwAlaZvZOzyJbkQ8uEhnaXfQxnu9anpxRr6Xp6qbpndiihB94OfgIFutjZ64Kf
+DxnEJcFF8XxD7U5GWpwAylOnGl7VeqAP+Lw+S2OJ73fw+EkHuFjw4D5cLYX2uRmU
+dYtZD1GXzZVGEyx5vcGUtkaK7A0yMKaSpo0NZmqLv0jse5DUYven+1DcEtCjMhtg
+hKITq6JY1+zbG9jLYQWJv9utwT0dkHYS0+KTsy0Rvem5fy7tacdC4wFZFME3WuO8
+gdSTs2F2QECfuc0S+bxLUjzHma37SaRLBptcRUYafokCHAQQAQgABgUCVmsxCwAK
+CRCEi69bm+JmOdP9EADHTRAx4FRqzphFhdMzy2Ok1XvTr5ZBThtTEnaz5G6wm0Kf
+7X8qP1RLYh3poYDppEpNfdeQgREmrDPxWKvE0GThjc3PhdfC8V+hBa9XK7BibfBO
+HFEK8NUp0ePrvtY/gFMK7Ng1fU/RC1utiH1SSIxIOB7nDCcXrFD5f9oXqTsvWZ/t
+eL0UVmHHm006xnupswcUNgmg0q2rrM0Qod1Reos9MZtFEY4K048ghAJ05p8LqYQK
+ySh1Q7OIWOWOGybACZCe5mek8q4yzfwR4tOTSfNe9S0n8ZmgBCisU+GSiTAdQ4i8
+S2Eo+cmJaWfUPSxrPe4RR0RAK9EN8pX8+RCYNGMp1QvPnxItBFJ8KOTDzQ6MIWj6
+PGl9uPMMBSI9Py/P2lvhg9XBkRrlbB9NRtC4llYxDLtECOzLJfi8A6Am4RiERn+F
+McT2319jauDjECp0ZrwYCPUfY38C9NMXzNAJoTvQfIYDN5v4a6MPBV/oDdGWuTWA
+AsEMMpzoK+VYAjgODA0YRCvwqMdiaWH/a56jrRJ89Q4vR+3nb+7QamO10VPl0anW
+5rH/ADpbJrF04AlsD1MMEEfWcUSGFvNGCdNXzZLSct62YIM6W0IZSDdhuiSxwsYJ
+GSEz523JPMImO6J17m5XGa/qnd7IGB7jHkexTiBJiIpiRtQBPX82OnMiFN98HokC
+HAQQAQoABgUCVmkkJQAKCRCU4aHsQ9QWWB/tD/9yBMnTjwf9C3rLx/XaSI+v/nRE
+YSUNtbWP6A9+R2sL823b/grGlrnDq2lRgBJQ2a4rZjC50HSWpKrlo5kdzjcGE1Jt
+vRDZhfT2tp/wuGyZWpDP6NYtSyh9bE+0m1k76yZxRKwPgjMPXkUXX8pi4ashZGkO
+9Hj5FGcp+F3UiQJZIfVUNyCj4g05KdwnspVLoY4esb0uMUzFXsVGd2EtvnN2goAu
+fNJ/uoFobd2x/N7dfi7IWjFz6rUL2edhzGIJGmwbvqya/puol76OcvGu2bkqP3bK
+N0rQKrdByZFVIpU2J8jAYfNFsf4zVVsUyAWTX3PxtDuZrMUFtW4yKPRqoXIDYr/1
+xSQP98O1msHjf8UrltQdL0/XZNGe8izfFzHppIyzQ0m6n6EI75lwwoHQOhOxWvB4
+eKBK5VReJJHWL3EcQq5bXknf0674p9PcRdmof5ooaD6/qKmDK6/eQKerhDQIsrV6
+ATh2513PkyuHwlhWDshGhZKXzHdcnjK1Yq2xxMJM+EKnfIyGPejZYmNhRzEH+p2Q
+woQ0q1YeCQUQIYgxjiU4SinvGcdARZbcyPeaFQK3hhrWu8d+W2Twj1C16VH6wRYi
+XxClNx2dFW0PPGglhLHgIrzWnbiqQ4CrqDZwJQgiJWRe810SnvivfpN0QMswgeaI
+sb2kWBGHyzdY/NVDJ7kCDQRTH6NBARAAvp82js9BWIpNk9szcXNADLRckmjPuOCw
+ZoZe4vW5uSnNimKsEswkGVCUly+Dna0R97WtsyEeSDrc3FB3NJP4AxjyNabTsk9e
++OAvzLmLf8iKRSMOQFb2Ja1OwSGIeAwVH1q/tvON8EZ8GjZSDYFrivi0VbRO9Fml
+mLDyoTuoO+uRZeXiF+yGuMN9xImXll3lemmxpXxIKwXGwmLNnyF87b2eUsIZ//tE
+sT7AAfKyDnx0mJAf/teNw766rrpqZkZYdSeaeBH7Gld+Q7niLfGiciVBadRv7+/p
+2LW0fZ9NJseqtW3zNNnEFDAWSMASUQzSYeWNjSEzPNnXN1uJq81WYII5E4r/9xS5
+mLA+KNpllnucykvOWwH24DXkPW1l8SSttEzW5yr8gbrvoI05Q5Y/NyNpuFOHjJak
+3PIY2YNFwR/3imvCiGRv/4iIV8h3q0L4iT3fjiZd8SKFR72k5zJ9OlEugilZ9ucH
+F1wuEchJP4lNTN0luhqVMKFnpiBwBUKGQXkhrntLrrWUeQ66ylMAgfQ17QEtyHZG
+G5XO+1lgUj2RMNt7KW8ZohJmvVrksWR+myaQaQDuhORpTA1CHKmPVU8XL8RwHuX1
+yDHdxLJqLDd+P4IasrSK8YHa7sq/dnxdKoGcH6Q+9jDA0Qc4Eh08N5tZMD0gW3Ty
+IVl5Dq72gqMAEQEAAYkCJQQYAQoADwUCUx+jQQIbDAUJAeEzgAAKCRAOxR/NqU+1
+PjF5D/4xwHr1Ztyg3ZHoVPZvcfDZhEgg5RPNwMKigKCy8H7P8qocV+DWbmizD+i0
+EzZ/fVT+MaaYfxyz9E1AxFVF3e1makUfEUVo4GWQRArV+z2hlCsYmvA2emqvi8Kc
+ertvK5Zo2o5rIkzrGR2+Xt0hmnd7/H25RXdjgYeFDLx5LnoXNL7vB3opl/0WuCjE
+T0DruHEaY7NaDopEV4bfP6jt5yBAaQAsb/PynQfmM0LgyvN4wPLMShUEXyeaniux
+DzVMchREsmY7HXy7wYZYNARZRL7DttjWp6K0qcuQ4HgJE2xKo4NKkJxR9yAh9BtO
+oUaibnmjikIajRrL3w1CXUjFU0q0WpSSNu6A7WbdWO299gFgFjmrpp0EadmuNtSD
+Jelvc+W0f3Uk2ZVOLmX3Y7AxN8rNqZTpE7iz5Z55TtnCIIsQOTiZkN8z4ruslrmb
+ly2DzBENfMxk70Od7iVwANrXbq/Oj6lpZjCFMobYkV1ALtjyQl2uF7jbcSj4MjHc
+uvoHv943l3c5Q/5YbCMh/JmldFxYVU3MuSjt4g3IfXwKRYTWv4EPyzb/cDPmhNE7
+OWtv/kZZasMs/EKFmWRzlzfPTofAIoPU06EF/mGn9oHJ/1Jq6iJE53do/v29zqzK
+D6gXGc2b3sq6l17OMscJCbC6CKsjTijZ7bnuDWvvv6vXQuxoE7kCDQRTH6QKARAA
+rplAiigM2ygOeUIj5QzgZW59H7i9JfiduiFE0jyxp8Tv4Lj9+rB5475rSB5qjCR6
+q7g61yfoYpd1HnddBy7c287hyD9BLlMoert2Lh4ixBowmTwzxXt5jcWlUg7EP6xs
+w4TInEaQWWUT97KXQ8X2O4ZgcHBUjShcj3IiELrZNiXq99HaaGvQtArRNp3Za1Pd
+VqqAxf8HfScVSeZKBTNSNdXJiMU6DIvUsd/ldLax5CSc0DIY7Qu0vgrdKms88tbz
+Fw5KRJx/WrYnniBPEaTtRNXSiEPoFEph0IOw5ZIM2ENohYrVpcIG2O4e3OOWbEy8
+wLYTqXhX92Zb5P17UcgRT66nCvcimH2ndqMkecB0kVeKPqxUhZRG+Xxk/G2L1q5K
+qtBNqdTM9gzCeB6iRfS56jJ92ZZ5MEXvwKkC3BZ/X5yE3NYMS+2U1gHS2HgArBYO
+x6LU7FqBQNRDbunQKpPzqdM1wkVMYTLknovPB4rq9iJf1ekJS3am9aFL9UWtHVa8
+m2UbD8kenByOdz6/fMmuo/PmiZMvXmXBVGunr0PoccryzLkLQpqwKid6Yq4muUfA
+lW7NwAUbQKcq7g8tsib7dii8LXKUradQbqUeWCudKwQoGhZQuaLu/mJvECX3uc8o
+EEZe/HxCwG0BY+88rXq0yGlhbSr7C+0MWf7B2++W7e8AEQEAAYkERAQYAQoADwUC
+Ux+kCgIbAgUJAeEzgAIpCRAOxR/NqU+1PsFdIAQZAQoABgUCUx+kCgAKCRCAPe5J
+GjRz5ypBD/4n2SJAh+1dVnkuTJbPKIqZcEWM0ns7g2Hqjh/LaMk/9v9QyzQp/ICi
+CxKMPJn1bSW2wchvjDIVKFwmfoM0yfnRkFrv4Z3LQPWIb7C9GCY3AhLicJe5GRZW
++iG7FCabcupbS6nVbp73BRSFEMrYacBXTWAfRfWjTT7M0g3oMHZJBkk+vu2rvjna
+tjiWLW1yxAhxOvPtdLigpYsdfLzPV7lGTqfJ0EK2EXk+oe3TF/bnj7jgyk8V/+zt
+cNSZQhOZVUtNgkcRL79HA35Aatbih66hdocenGcUQiIu796aHhfGHKJ78b2tfCGz
+s8I2Vum+dBZBfsh7sTSG/gBIshCyuYo3iernpgYn0AYEUKv0X5kSxNFYvisZZhHR
+Sv00J2UrEdY4xzL1VlHAdbBzIDy8yVLjSUFwcPz77t7J2NldX1VMET40Sfl1hLAF
+m7zLVmEmPqDRkTXcDc/Lv3LCqtFOli5i4/a2LNcbx7X51wkgryIyi1V+N/WzO0wX
+ZOLc2bjYiPNQMEa9Ybur3So2wJtR28UsqpIvuv2/7iXMfplzekjRuPQ2M0yOzcBR
+hRRIRm8k3qNscR4sL25JrntAMM1B+8mCzxm2QYZm6Mli103XgLmqklCt9ZdzwzZ3
+MJqfwMtEMvZCXgqettbTOi+5RYUOMjNFuLlyP4QCWc2X4qnMgn+zAE6zEAC3rplI
+VTflzpf7u1rHAJx4uSkIYUy3s30S7BjqfHFEpbmPocNfHqaWyc4omDSszINhDkTr
+i4BPYJiO0oOlLwMzppa/fAXAFnE5JGLp2CsTV25s3tjf9PnK3kAnaS4un00t+/gj
+5Txzvpw6kXvjZU7m8Pq6XcXjrrhoDF97lpDxd877IaF0SFI5jTIi4nQ7bLRpKQl/
+VzsQMBm2sBDcTLj9vY5nrRxvyHij6rahxuND5hePYW1dx5jXp5nfkzW4Nse4ttMO
+Mj33YN0eq0DJXBIvt7h14+ECjm97c9RV58guuPf6oNvgl4yGGSA6HI6sLIxHfZ4l
+FHjZ7V8r+1loXhIjYW/G8UgfmaABB47oB3bLdP3WQI4KthuHDtKPu3f2OBnFr4YU
+NXgfBij0SAzDA3dfdjGpaFK18bvWWYIyXybERxKyfwX5WgGaSAgP9i1QqbBeKhuG
+0GZGSbeGZ9JnGy9ilMzvWfu0cbzSn1N7MzNA6afSPW064QXDfFKHZA0mASonK74X
+6HT2BTURI6UoqKndIEMnXHVxteSVn7YAMEdB67k/pnOUwaaw/grq0rtc+Fnulb3J
+5h/oRWHbuRxPgh90VXHYbm57XtUClbPNVReZ2NEO7V7KuBqdAHJaaT3fDKNl9Hr7
+5XeLsOaUzJxfPmpOtFEKhuFj+k935Ta/LObmcbkCDQRVIbsWARAA3A9jM7deQCnR
+YasTjuApYMuF0gTvptoFdHEHM5F+z/i25aoBFzi+1vh8BYvTC+8v7rOQ8eNH0zcY
+GUEmw5XrG0sAdHvrsiNGjQ1YHswAJvG9TiI94YPXojKRvtxZrce8RcZwqCII7p7A
+eo9h67jHe58aPxlaW7AWVLISdsAQj88k0+DVbYWliImOmEQJSzkv5bFwWfmLIIkJ
+axjsTTwz0oETBkfw16I3c9C5yIv9DQXSjPMAXqlL4TbcSXSEjqpGeRKO5rE0jGId
++oUXK5QHpEh3HCWUef5Mb3J5Qy2Hpt7Dsdrb/obqV9qJQ3G/ODqX8jkq7rg4sf65
+BtKUMlUoiVLk8mdd23o5RLVwO9HA99gQHRSnwzhpKQwKZzp4E7VzyIGvKWIG/7jn
+bSp2tCqvsvRyDjznWlaUJH493Dz+EW4V/aXpePl0SUahtrnl6SoKHzCxz1YVwbGl
+ooxBbjNS2Y8hi4o+Z6K6jHFOced0i5w1m+2CIPuMjERyqu8TUCOuqhp+DnRVhQS7
+ot/byFVF4o452ElnnKbQsGoF2kMir6MAZbd4FMfZL29PJQT+McxiuC3/VbpZ8dtg
+GYwzNnIJvduqZ2B+rRWn1HP0d1GfyijcqmlPAU8T9MBluwSsGafSrHDUF+RzwiGM
+EfjLDTcYXvopPprF45CZJYhTiYUWMn8AEQEAAYkCJQQYAQoADwUCVSG7FgIbDAUJ
+AeEzgAAKCRAOxR/NqU+1Pl61EAC4xkoVCNXX9D5eYavNZ12Oo7jbfP2idA1xeGSd
+Xf273HMbYbLKDCY6d/PflnxyMmDsBNY+YMonj7hba+VxHUoDj4sIve794M2ekFhA
+93cEGFcR/ZGxsKslBnw1RhCuisLUPeUocm9cZiDqJaKEoS1qN++mNjfEsie9que2
+LhU2w8/0D30x8MxiV/QpBg1Yky9aXViSPzp79wxZ93WDcrxuTd8Qn4wPNWv4+2ZE
+ktcBY5lqjFMOrx8tt7g0mvNfGyuTGq6nOkm0iXmwGAAuLo2OCyAvr+e05TW4VejH
+aRe+fJz9atS/0uXl4d2mRaRcmFnDJ/N11L/3sHHsN7Vy3kSu1AZpv0GRp8/e24JE
+WKa9vRCQNLNlmi0YUkwqwblHqs0NhiHzQWlgv3dopaR/g008a+97Imeu8uxMlau7
+Ds5pHybQB2A4jjHhwpVcMT1wR1E6Zwd49Uwav4ERqhz3fmvFLHD/eowFI1PKAQ+H
+NiZbXFBpw2yFAqycixsUeDTS9v2wjww28eixtw7YYIi14weRijIQlkaE9ZG92K+1
+CYv5EyDnbDlTa5iwakZWWXm3QlDuvbkLoTOcFnSuDNKbF6q1D2M52qRpxA+qLKcx
+TeObo/bgC5/v+zQebCWHwGxnr2ppFfpbLO0gJ18Xev8d+M573ESy/kkYF+H8OQE2
+QSp8TbkCDQRVIbwGARAAqO4jwsrbtksrRl5iPakRosyPkLpRfDSEi5gjfvSE0pNu
+HUALQ3J3JOayGm9XUbiqBbtiZwkbiJRwNVriy+zRYZjoMV+Fkk1cLOpWEp04ouPd
+CS+wUDk653zGVktfzHLo+Qr1+dYbJjZtiNqQEP/V9ukaqZ3d2M43aRgTB8mxf7NF
+fAlywZUE0SmO5eRxIPLfZ0vXiJvqshA5l2yCV7BK94trWLd3nr7g5Cwc/Ov8xhhM
+SbTiWah1ZWbVfOm7WDzqN0fX+9yAfNHTC9nls+dIujXCizyiXDF8HyWoY33htFna
+N0r+rQfauA/39IhZ5S5V2aXY26LlDTGYVnng2byweIwxa5UUw9tJR22utT/FtAem
+VhK0aec0lJdUd+WfhHZa6Il27EjgqtCFzvdzdfYhUUD6u+aCKBMhlNLuZLTP3QBS
+kzEP54Gz9v41bvoH8KQTeTKlbLhIH+xRH+6wwe3q5qqu1SSYFPQkXdjMUHMNTysA
+EH2+dZpKAJ4sKlkD5XyXfxp32rLIVntC9r58Fb1n7aAUANyZ2N/gPpbHWL1JFOBF
+B0F7jrwvc5ywIlllb0qQf/OpwmnSXe58FTV3BUvZbs8vNTt017ovDbNhXd2XtysH
+CwyfWdc8bdMjAK0UhXDV161E8vyNCjPwVlU5JvrtuSNLS4CojzLgIpowg+YR/NkA
+EQEAAYkERAQYAQoADwIbAgUCVSHCKQUJAeE5owIpwV0gBBkBCgAGBQJVIbwGAAoJ
+EBO17ljAn7Pg374P/1TVk0iTHAuhjeBIUyIVp2j1lB6G1nIHSUiQ1ZYCvGfx+UiK
+GtGEpVkW9BeqIkgEbDqKiOrYrnLZmwxkRm6GOPkyeJ/ZO7EZOLF+cgxZq40c14Ut
+0S0LW9f9PTdSMADr5oROKALoYxm1Y2BnmLh6jk0S5ZVshkoZImQ7c9SfI+6SfGsz
+51Uf2Xwds6tONZfb2s85EhVxWOirtTbihkIMevDBs1Ls38fvhSvowzreZeleVVYP
+mrVvLQp6b5tgu4KeGW4YkjQtRYJCLwjEiI733srBbNB5do6ZQR3mq7uNqLPvGFLg
+NaH9XBDMi0Ue1tpyyjWTWRPm8/fzXddNUATluYB9hC5h1acxLDS9GQqBRmzXU6WC
+r8luUy2x8u9aip+Y7XpUPsIo9TcOz58Iw7lUKcE5NJDOzpk6XXGH4hw/3nVyeSGO
+RpXsIBNhkoIukrlTQuEbDinLunY88BImaxEjAmG1UDJb3HrztUR/KDMhqIz4v0ej
+8DutE4v1zbn8MGVcwHVtEhULcjkgFYAMkwgBm8FUc5JdpmQNnpsyyIo0+0XVP7gA
+OYtY6ySUdBOtI6zAgz7NyRFOxuJvhtegVyWrFblOLAIu4MojhIEVEq7gZP1O10c9
+cdD4XmTGg2bLW1inOAERq7/JJFwRJ8EQ9ieYDXRUnsVBEcubgLJTt2wErQXYCRAO
+xR/NqU+1Ph9IEACYCPeW5kwuOoDB/JjZWLtsxGSx4xxDLANBNPKRywdxFzYwXTYE
+IQe1lO/K75A478Ez3v0jUQuWZPFEJ88YNy/mzSUXEYrhT9ezpT5MWcW3hqfSZdrE
+2KKuck8gY+1mBD4dPbX4596pUmPS8HV+vfQys4OJdpCIeLIGBA5mkuNPIE0bMpD7
+G/7IcW139cV3xAcjd1KpuXH3pENOmANOlW19gy7gS21P06A50ZacrRFFvCLN6Umv
+8415TVX6oXotCCctikghSIoAbkoFtp+Cp2naqyYDlumcmbMF6osYCxK8rhbh2IeO
+XgKMr+EPQ7Pw3IaHN9cMzju8NEce9dERI/t7pAI2UQZ2L9HrokHukhOCXeB2mJ3T
+s463G2eyk24+UspTklMenD6Nca/TL7TCEj38FBO51T7FHHdLHQzEqRnSvUQ8BmzP
+zXHLKL7bHmyxpiM1/vF0EOVja36twHJsrUJHPWXTBc+vS3i9qhCgk9ywge4xbeIx
+C+KuUHCkPQ7RzofX467xh/yVjBcFBkT5NsI/X84Ps600O8UhDt9bMm4ZNG+teuY1
+X9RcDRS3/VduH8JkSNEKGM2Hi0/I4PuvkvbtUkYCxueiVrx5xEONge5vtO17AYcE
+U6LiVX8APsn54+GFdyQJ1fbCwIteaSE7ItjeveGgNp8jv9eHuA8/XHmCYbkCDQRX
+JTk5ARAAzu5KktSksrN0/60Gcdc/Hlmt3qZyrpUpWyF/IBv+gEgynQuhuRh4CCxJ
+X4FAbXE6xnDEODehqaYk7WQvskqspPBFVfBsVDjNfGfevnV9p7BgrAFOy8OP2RNL
+yeQ5R/8gY/kZMuTApFwfJja3sIoxvUv8pOFeH6paR9A8JyhzQflbOn7fEEMBBJpF
+LgPbcrWHIrNDL8xCNLmkBgblxDcUQFShxqvq5MZI818Vu2xj1qMW1S5SSrDkr2aa
+6190sRay903P1BOSN6SmzsWO58zJhK4bo6RlBTfzH98/6cWfdb05w55QNQQEraaH
+Iy/L8RGq94+Ave4Cy1dyhmf2y/m7UO7jQNs3zH9s2IDYM4DQWQdd7DETRdL6kA9q
+mlx4TdQynrgNeL60TDEi22WsEDNvIwdUG4T76FPniUx4NQkhFkITz5rcmNgjdRTf
+tJDeRMOmirUVA0Hq8AW/HUBUw1TyrGkdHYFppYdLh04uMR64CwB8QkR2afMXBdN0
+mps8Xo7MOKOkulXXJkYnVYRABxPWlAGFXB/Ax2NcznF2NJDmPHy8DPtD6smfyYf7
+bVMHxqL2nYms+xpCvODpWG57dZQtQ6EZdZbjDxPC/xlIGDQgXVsNGjO9qCra2bl8
+ss468EYWi9CfGiieVn9dvKcWEEXPbPi0YWuG+2KAFcr1PyUk5gsAEQEAAYkCJQQY
+AQoADwUCVyU5OQIbDAUJAeEzgAAKCRAOxR/NqU+1PodDD/9zdc1Y6c6dPlI8Xe9p
+krnBSWtIc7oBAC5Yp5QZpfcoElKok65hZPqvoVbydiQ5tfHD1LiGB+lVOCT0oxiS
+cQC9nMKjZCzMRKmpz3DK36u0tkyXchs2BhCP2KdQJmPSq4+pdg75Hk6ZtpVYWj+M
+78Uulh1vSqZFbyGpMMZ7dwPUFGx9Hecdwp2ItxCoLkQXghpScXDLrIJ6pvNrETvh
+cMNCUN/gVXDND1v9hLVKF7gAwbRVzme+E8SEX1xxArovqHeduh6kt0uk31cvovDr
+wVUH946KjZjxR/Hoc29jg6AGS1vYWQNXOppKhF9arjqDwVbDiRmTgc8HCrmdJdi4
+wUXz22HI9779rsEX06vogQY9zpPAzgmKoXc0cIw50fDO9abqH2wnHNf+NnNJEyE/
+uyGRY4D9PICZorPLh9Ga5AFhaXjM8u0Dhj7ode7KTobg7UDckyMZWXDsw0/7Q769
+jIndvXBG+RAVyS7FeewHM4/BC+uomUrksNNvdJOayJ0/FyqNVZkvuum288ETBttr
+Nz2znmQdffdq3KswEDuq+5E99z2JN/i1qLBr95U8JZqc4omSKhVU0wSVgd/fh4U1
+oTJMljqLSYiwOi/sA5mB1vO+jhbNqOrOspMb9i/5gls/wUYzPfkY4uenKXT42dJY
+aafdYIihHqyXQu+s5YT4Z8A++rkCDQRXJTsUARAAyQYaA3MapXyZj/lNW/5sMEf1
+askuCoCwmSTNkEF+rRcu0FG7cUbFdMwKLqT1Y9D7p7dxWCctw76tLye5PQvQ5pTm
+3yEa75skPF/yk5PUwMXdof2xMdXjBHv03GQGFF8LzUWyCxntR+va2s3sslFKVkIg
+ivqE4RmpPNkV7eg+VYQi+rvsFKxqHmx9KzzoGGNVLr8FgI0kFog3x9duT2iziB6/
+ATa4yTuSmT9OllnwSfLJ6tmJ5R2TcyCnjEBQrf6k7d1JMCFGGp2ID4JHmF4FeXLc
+unMSUEQqhzL7x5iYOaLDlemOGKPrVLwcakT1i3UV5kS+Z5w8xnK45BXWPWvoNU63
+D8owpm9sUp7VfNsCG4RqM7MWF3sR97n3HSdTybS0tjmor2Wv9zwowmshHP/QD1vJ
+HQM3P9iWfP/tr2ioOFcZx5DM3/tBZFtP/s8F/mJ7egAMSWSDcPT6aO6SRHp2JzZ5
+bjEqIIRT7HdR/nsOWlyU0yhIu7RXTzEmnwuzxwOYTwvWDfYSrEKPkL02T+Tri+Sm
+CNrCy31GoE3CVZxXTSeNT+/o6AjaxgSHSRj0umHUdWjFqsBnlTbrozb0jjLPeGHJ
+iR9jkVlv+ZMrP6GURN69yTxyFxNqJ6T5C6TCSp4zQDuOZ/Ezo78/QzJNMy4ClftA
+DnIchgHHwbCCxBpEn3cAEQEAAYkERAQYAQoADwUCVyU7FAIbAgUJAeEzgAIpCRAO
+xR/NqU+1PsFdIAQZAQoABgUCVyU7FAAKCRBqaRTa++oA2pPUD/4kA/LjiSTcONYX
+7tuvP7jYXnxKNV5/wvn/pRmG7uDgarguvH6hsZeUOJ2DfbdvfyK1ZvAmFcU/QK0i
+Ps0doq1zA9z9ij/hbiTQX3VoO/tVMhu4HAar2AKbB687+k1PhguogNfRO98aB9cc
+OAt2XyX/JsvxyKLi2xQq4e9QBh7i+fGiHClHtdDQPGQI7il8BClX9PyBhhiXfmtD
+bqTZyXIK5IQO3myYqe2LaiqX0vgWvjJIis3+/5QU5tTQ2abjltjCyDQUxnhmNMU2
+JwT0JNDanYtkZ4wh1xiZlpmyILHosRhTjOoVDBW16GyfRjv25Hy3vDvOxxCpSz38
+lyb24bExb22PtcKnf7pcnA5wp/icnjgWxjrOWC7F61UluzbQELdiYRJFR9Cmx7Vh
+lRW6DWpuXhV7n+Sy/4maQmYqaWVjD8lEjr/4TwAPkhmTFCmT6Ts5sp8Z/PDOFf7r
+M+MeK+EuCnS+RzaY2+EwkFsniy3v8mFJS5XQCtGjdtY4mExnzHa80xWS4IqiX+ps
+0P/jSCAHNUOM1H6egWkYsbYjie8ot+rEDCzz4lMc5z7fDBLVhmDbDusWrgPi8aFE
+d6n3lAfEiLp0HWj5pYz2xi3Fn7KKLPujEhBLT24PnE1AKR/Zo4rDIjXUyR2jjeFY
+mQDaBibNw5NK4OmXEChfoh8imc2/+eWAEAC7EWDn7fVTqOUphkgtQDAsApg1MXmO
+jzqfNEWnoPe2Du/55A81tTnTv8zGOR2Yfa21YsfkOs4OZlUUyqxmXhqTIYVDz0pB
+eR5UAe8c3mp8EwM/LPIhYV6MD8LwThEjATlKM01evYV/p/UrhcdLJ8iraGQa9uWV
+MJ6AV4xMuYF8e06TwE84wNKGqfBJMvNZWe9fJPkdjyfI7dlYBFhqICEOUaXJ/Cnl
+s58xLovThEpelqOl/PTPEE5v4SRhI1ODHl+dK8LrM4T3v6tIK6VIomouHXVNQ7Fq
+HSCyUde5D92jNIkfq+sVX6eliMixOa41s2gkPQwZrKzZDj8sHU3VXq/r4nK7Cdci
+qm+TujawJdAdPsDrKe/flqCXtHyATs2mmObksiMO5u3McjxewIE5ZC36LdS58t8O
+iC9xt5yNyC4tefIDnma0jxVhOOXy18w7mb+K2NtQliebVuyJEmjP++j9qerngrCw
+jWQ2rqXldxX/+DHe8cuNl4iEgr3EP/4hqoY+KsUPhBXb9/bFWV28OzizyHAUl3MJ
+2ExL6OZFi+UGpT3nKa5ArG0rdcwAQNzzLYYcOBOcCB5+NTgOHvZhA2DfFiYVvIJB
+cuy8ESi3hgiPHPQzXqnRF9gq0yguSob0jBlCQB3/6Uq33BBB3KTSa3ilaMzd8AmE
+HifqTn/z+qdV2A==
+=phy7
+-----END PGP PUBLIC KEY BLOCK-----
diff --git a/depend/zcash/contrib/gitian-downloader/kevin.asc b/depend/zcash/contrib/gitian-downloader/kevin.asc
new file mode 100644
index 000000000..13a39ee7f
--- /dev/null
+++ b/depend/zcash/contrib/gitian-downloader/kevin.asc
@@ -0,0 +1,171 @@
+-----BEGIN PGP PUBLIC KEY BLOCK-----
+
+mQINBFUCi1MBEADXqCpI25eGupdiyZRcF3iIPxxw8DuQAsDXZ1IZUHYv4VHk68wM
+D/3CRJL0uLZ73VQu4a8R/JrdX0ByArWeo/YYbuSWqhDRIU2zXKP82Es5nLkSzTov
+b8Kd2vnqeSMVS4E6hcMs0SAUqIExxxI1sOvgeoO/j4SsIzYOc+r1ci78xz2j7oWr
+jiMgCy9wjzw6dc6z/gHDbx6oDDmLSQPlxFdpB6fwLUj2NskNF3BnvMFnP3RZDT68
+mbgIUHiMA7Mx/DxwiqHNjiwpIIlfpHZzpg/RXKD0+aXlN4lP70rDfuQMValrNuj4
+HmOJrgNnb1Cb+sjcJbikval8BRJcQhM6s3TBzUMJZSTlpQJGJ8f2EO3B5lyPODVB
+bmBdeojfYszts9GYHfB2/qCy36ObzdUS8KUhM+fT43SDw+qr0Zz4biTdmv+3jHOF
+eDTA1KUt6RPNcizAydV9EExoIN2XJ/KCs1WFpiQsffGXgSW8U4nD8ystAVRd0mJo
+f9oudOSrgyIEqpX8Zhn0At/Y3NP8MEhq4mdjdYI3sCRN/d4U9pf+4VBHS5ECTeIb
+GSakPVNmk4gmtb9eivzUgOPEh8uD+7+awmHvqYV6c1v0ofSrjXr4qvYM3RsLBf4U
+drziqXS/yGXsmSl6vn9cyxcKXdHgSGWO2CuIMpIKKR4jhBbQhIJUlWeyKQARAQAB
+tCdLZXZpbiBNLiBHYWxsYWdoZXIgPGtldmlubWdAcmlzZXVwLm5ldD6JAj0EEwEK
+ACcFAlUCi3ECGwEFCQlmAYAFCwkIBwMFFQoJCAsFFgIDAQACHgECF4AACgkQtgTD
+KtXXxtiFvg/+ObH8fgGJWpToZaNS62RV1jZhpg31Uv1S+FY/Kh42rOra4ywGfzcX
+Ahas7FeCepmOtQ+cWkZKgjcL+c7B0/mow12mrqTmMANOZpgYvBMYTdXXllXYI0Bf
+RJBv7P2Rqd2N4Djfu94gE8aD0yUFo0rpXBHCw1YREu03OPaT+IY0CLirJyjQQtmB
+tqIeskZfTq4oY4is0UksuQB/elNfOfiJ0Yz0RW0tJL1UzjGbyh1U9AWtXUBp2tq2
+NhsHOhsdnPQyGG+ggHWUiT8Wg7cyZwJwa/DCV0ovDm50XkbY3WCRkZiX1Dks9CND
+3fS/tA3fU39XgNURmAjSOLGXXkQgev3AO+TCQBpBtaEwjXyvsOY02Wn+eL5TVZZi
+bQFrWwj7CUB0bXoBbtDXRonzYM2qx6/+7HPmZZMqTlOBvhHYmmTNKL+WbguHW/MZ
+7ptmxB7t0lYWD1SQdr2aowvYshndWwnVV9BWbp389MchURDXzExEAgatqbdTAeRy
+cOv4+baCN2remVEOmEM73XC2BYQ6c7H9jLyoy5B1jHR61Ol5w6ZXtYeHCzQ9sxFh
+Eg/Zunu2tBjsa5894sexvpe7QzXrWa2hSYoFOSZVkwao3shhHdQ0h/G8C0R5Hx4f
+p4EX+F1/lUNNs1w3JcycQMNQyktfVOxLQGHodxEQwP+NjWoxW39f5pe0KEtldmlu
+IE0uIEdhbGxhZ2hlciA8a2V2aW5AZnJlZWRvbS5wcmVzcz6JAh8EMAECAAkFAld1
+mc0CHSAACgkQtgTDKtXXxthjpw//TGUb77+BXhqiUIBNH2CCCY8N9FW1VYJ8NP/F
+Q+F4SKI8CG1s+Fy1VUAs6d2HIfJKmNUoWWrbeF8TkOuWtrHGim+R3cRTJxGtJ7k/
+x6dmR2oQsO8+aTepFe6reya4/+r4B/6og8frV1i3Qhg6jaFpKvrQeITxAFCUjAtZ
+rNohNLIUl1ibSJvVc3gpfKsa2lIytnJ6QPeQQxh14/UJJMpdFfPRa/lgoZm8cH0v
+ko9TZdTbBcfdNd+exctbsj/MxwaFFJTNGh6gDdL/lUI8uBEaGGSp8cIaNzraggAq
+IPZOZT2ENj4JTyLz7AAbYgfMSxsckddJ1V5uwTzKPxnItf8s/0zABxG8Oz5zWrZb
+xe7ZwtxLoUMstTUVPBZGnf7VMkZ4zmRjZkKEv4TPz2ODmDuueRqhUih48l8cyiJf
+Sr5HihXEv0AtLpU7aBEiwndYeetqOJecy+kyjcJIUr6Iv+lY7P5ZpFWs4dak1NIW
+joG/nMYKSnGV6efxF7Mcdl+S0CBSH4FhF0Hp1pgVUKN853LkejyKf1PtVMS6JNaQ
+hfyW8owLBmQsua0JCTQQL3wHIL6PSleO+oohU0EN1849+fiSnjF2AOVRowkxHfeu
+Xu5Bi5Co4SLNrPQNeH4UnfXPjK0XSdoD78abhYI6rRt9YJoALvGBLCWkd9qWuXca
+U3DzNJG0MktldmluIE0uIEdhbGxhZ2hlciA8a2V2aW5AdHJhbnNwYXJlbmN5dG9v
+bGtpdC5vcmc+iQI9BBMBCgAnBQJVAouNAhsBBQkJZgGABQsJCAcDBRUKCQgLBRYC
+AwEAAh4BAheAAAoJELYEwyrV18bYEx0QAJIeY68pc3d/OyA59lJjSOm+Hvrnf142
+XNLqjZka5jXCDytVxVH7JBSUtkXM7jK/dYHXZgWXTt9urNwaHFOqPxKGyIrpQO3J
+UNnBrxz9EAu1FP6/BGo19nsk2oIZlwcwyW9tTW5vlM1tBccVic6E9kYRaDT28p6p
+WnS5PyKu1I6l7apXQqWfo+cSUX8pRIZSmAo1edjuX2C6lIRlGbT3xOav7PSPWyuW
+ketEchmml91y/u5P/CghsSsjy63PElB/uZYtENQY9wEodslK5sifN+Vh7T/WvfJg
+pT8sxCgAyN+oBQb3HK9GIXBoQ2jne69QwWpgeu2OUDYl/LOhoeuMNeTnvPEc7xmy
+k181O6TwdSmS5+KYQyMTDnWFDu03DTz9flOzpd4k7+iFyVl7Ip8ci1azSdm2Dwzf
+KkbFYIHu7177TlBphRA1BWNh3+xy1xgxxiT5b7DoWg1VTtnNqtwq+Uf2spxiHsze
+PBZP1rv5ZGmYaje2b/yUZah8NeHT9YYm6bsyJfd2hZglTOmVyZFX6a+VxtzcEVhI
+sOJUC+PCer4CF8HBOer3qqp1tiOwtcKjRMKxU4kqJCcP+jXmVXsSisOoo8j2dEF0
+2GEMJFOAkzVxCb+8tlp/CypOZodbhzb24RTNzPapLSeDAivPRmyX42jsBaKHXvQm
+xpobqBvopy61tDRLZXZpbiBNLiBHYWxsYWdoZXIgPGtldmluQGxpYnJhcnlmcmVl
+ZG9tcHJvamVjdC5vcmc+iQI9BBMBCgAnBQJVAouDAhsBBQkJZgGABQsJCAcDBRUK
+CQgLBRYCAwEAAh4BAheAAAoJELYEwyrV18bY358QAK9r3gmNb0CiZ8tnDB4XZ8g3
+q+DT2BXtw8PABjrhEMxE5W8BFE1/kz6g28Je/49Z/CJK5THvhD3uzszfEG+G5Zgs
+G8y6Ep6ZZj4i/t56KN5ZI7WruPq2XmmlQpwlbOrzqLcj41nAq3zV2wj19tioKHwE
+UOBR4hTYNf0Wb8qVRWPGuBmdCHm9GbcM/CbWs1V5twY3i8o9Gw+wnuTpMDT3RaZz
+3c9Or2gqp9A2kMKjKq6MGNibBl/V8DTNXIDVorQPScxhAqF7yA6wfn9E0DNQH68t
+/YEBLAEoVI+7M7IBXYjgmHF/FJgPCUzgb5zWDiKDq4EJTd8kkfhCjOJ/KRIPMnhQ
+fFqXOdsMTm2DwIaz94s0uiJ76nKv1NgP2G3BYpFxf97pq5oFAWjDGeZcH8+7EBy7
+r2oGrrvFWd6rzV/b4u8PWRf+r2XU2KupYmDlh78mteI7N8G/VcarYjkAWlpRK8lD
+jYYJ+fl+3Q5/Y8Nf6f3cUZGItMB+kSJTirE+tYbJ9cf2l4AciQ2/b49s4jzh6Ia2
+vI0H5JFwLoKyEKSWwl2PuBrBpFnbkRca4fimg4JlWqGOcoZwrOue9HTv+zqfE6c+
+PG29k4LAWnOva8A+W185MNzHb6cNGwDks1y1iMU5TnbaDUhydg/c/zvnuMS/hYMF
+orkZHPxDbDTnyDMBhw3itC1LZXZpbiBNLiBHYWxsYWdoZXIgPGtldmluZ2FsbGFn
+aGVyQGdtYWlsLmNvbT6JAkEEEwECACsCGwEFCQlmAYAGCwkIBwMCBhUIAgkKCwQW
+AgMBAh4BAheABQJXdZoHAhkBAAoJELYEwyrV18bYzSIQAIMBEy15VIB+wlNSB6hF
+3qPRzVvEQQRKUi49Bse/HFYCGiTWPz0PSu26/nRCNQwQh348SXWMzh+yaslEjcTW
+m/C0XNAqDrOnN3xpiBzOW/9YOg4Qb8Spp1nPBGR3QPT7OSCBgLbU16WrlZeeRHpI
+3Z7Sk7FF+QPBhPHoBvZ1s+TxMS6Vv/KKWebkC4rhSSpGEVWHD51VyyssHEVbMt9X
+CoQU6HwvwlBMHaKo/Yvz+vRVZKKSPlg2fmAuV2bR9dW2Sscyh7X3wSoUf7BxkhVC
+CJzMw7oySEL/7N7NibfLFe8CrgxHyDLJdc3B3dHFFS0tq5ZD6wOjPzWoj8v/6XrW
+1ph48yzzBogwDIW7H/B6GjGH+ng187MuD3zQQiPoBNrVPSOO2x00dsROYKHpDc7X
+t9Z2LRGi9OSVCUHO8lNNWpHmScPikhUYDq70xuUaQjuywZb+R++i7Idi/ZMo5tbu
+JIqef4YKFwbf28nE/nShJim2zE0qmLWuv/bal+Z267Rp967hQU9u2DwR64/001Uk
+gumqQz+DQ56By79j1tbM8wdXEdmsos/QQXxrEi0uf1ZSPlbc/vgEPeposUj6TZRN
+6WC1eb5U70mrH2IfSQxJBQTOLlQidcMU1h8F2dK2RlpumgjsfKCODfcKZ54XZzB3
+X4bM1XY13HTSFk0RBrHopHROtCFLZXZpbiBNLiBHYWxsYWdoZXIgPGtldmluQHou
+Y2FzaD6JAj4EEwECACgFAlfDplsCGwEFCQlmAYAGCwkIBwMCBhUIAgkKCwQWAgMB
+Ah4BAheAAAoJELYEwyrV18bYzNsP/38vUVhqJLJynuVtj9x/jVpskZDk/IL1H2T+
+04OrHRSJDyT5pUyAyS88U2X6qv6ni0P3zAYbuWsiHzG06XQ2tgAA0ijrDCP3TZBD
+OQOmDYKBfjzYFOrQS9wKNdjmv5MBO+eGQrScLDaZ/sS1BlFuDgjC8u38TRqsTtP/
+yjpFFtvK5QDc0O8QIMVlnKU1B9+u67mJCLgFwL37+lALBUnYYOeunL/MZVFMBlFT
+u2U3QzyolGrVbvOAld/6MumSd50BBnaWF+YeXQLuyLwwGYRbp0ic77vUhVTRAFhy
+oK9DfZXGhVqJyZbG+eGI/zkiZ4xZdMXePSBuvRBjOiMyz7oh/RENs3ECY2gwa0Xg
+k9mcJjYUIt1fP2jNUE8lFOqBklit+AFNHdSiF2fMOPwm8tbnjrRT+RrpYHN5H/Qc
+RLum2toDYvK5Q7rHiFNtjxJqNUEKI9ntavHRv8cCOn+QIGmnCrJ/hYXEt9wSJUk/
+8PDA5Lw18dXxxPxQ3vpHTRHlXgmCAcJ7FdvRBEGVF3lfr6/J+p6Q3nbtuxb3Z7Vc
+XMmHCjXJRpRSaNgM2QIQTMW7DHfmtlX8z9+O6bUu7qPa41FMRQNgGan2As2oYFH/
+hwY5/nA6dTk/ONdOkCHlr+bdQp70eQTwQjp8hQwYIF8guOf+Isb1HFFafR6+X6Co
+WGyJoSxCuQINBFUCi7QBEADa/ctOkyAgR1IT5thlzuB0Hzp0UXMrzC50wLUwgL6M
+X3P5ifyxxXDH/T+lrbsCknFy68fPMmwecrfBUxM8KI8huNyrqnrClUlwJxRbGCQD
+/Qe+VVuWIGwqZLkDph6zhNS2OiQbxnPYt8HLR928LnWnBhQjZPEMIbmUeLxXoUxt
+X3JhxWs7a2ujA/aFpckOrMo3VU0YvRea7UWks8d/ajEQjawOaqTz56WnyDSw6Agg
+Rfk5nPEfK2NP6chC9Ndrk0EID3WG0XMeZHbIZi6QQU+Do9YyDVPnj9UWCn6psXB9
+bkb5JcS5iVDQztK+YUVmFOP5MpGf0uZ+uZhLo7EFC4umeq2LSIOHpTgc/FjwxHCz
+q+rCIK6SXkdF9ovfQi6eqltfDjFlgx/0ee6oRASaYWNt5G+SQcbSUEzki1m5+Xjl
+F31EW6Sak2HLKri5pMZUren/scHMpxc2b7E9QzwVcrNtCBNQ4alZzjXcaie5DCb5
+WIiOHLrh0xjrXO6wf8hBlq1onsGWSI0beb7B/pq3uKNYaqYgzr4SgEQw0C5ZVOUs
+D7NnedcPC/axO9S2aNgz1AKA1cTv9k/g0Ru3Zn9p5NBg9rhV91qLiLrxlhmPn47N
+ywHvHYCNuQDrrqk6kHf9q92weZ64vFvGbJBm3YlP+Ajyr4G963qZPFTREDoPOLea
+FwARAQABiQREBBgBCgAPBQJVAou0AhsCBQkJZgGAAikJELYEwyrV18bYwV0gBBkB
+CgAGBQJVAou0AAoJEPh1kvNTM9RPrtEP/0sWMmm7MCII3HHANAsERJWUjH8CC4eI
+U1VaiPLjcCli+b/yFwlSO32HbA2bvcFwTb4jWW0SEDBZOHIgPZ1BWfIGj18NRy0H
+n2JoJIFr0JSohJfeD8DXFk+Sk3gyScgQXPpKhbp8g0MKP3BtyvKJCfu5mGiBOst1
+J5m0zbOS+B6JKsAyVDkAQOlcQG2EGVv8hxC73sz8EEwbGyHdQGwizDpVrUYBipn1
+vt6fGa6NmhaUMkeYXlAEKIZCXkF1Fgq/T/MFYKKJV8AvJzBcb62V1R3NkevDgwxj
+49ktzQITFnk3hGA/Glg/TyAsN908o9yZjAjm3Czjsm4J256ahTnr3qVhUUFWtGz7
+U2FYGq/BX8jy90BVKlwSQkH5J/X4fkOkSAe+XMlYvP48/tVXrO2PUPEW/+ofMSxj
+ePW8WNxPzZueKYFBvNiONrPNT1/7I03Pq5ehJ1EI7LLcz4m8KB7Kvbl5b/Lkexlj
+eraM8zuYngYKa2V6QQ6u7B/f7xg8iyn0GB8ae04zn35CpEqgPRlBUXq9Sr85rluh
+0ElXFOrkcGbEQ1TcR66qtoN+47NlFvs21QaQ68LUNCiDPOiSTdvChCuMU5N9upSc
+ZekM4GTxB3BN+hFR4fzR51OXO6mcKMHw5hCrnd51/2/CUQ4WUXr8Wg1KmaY4YBqB
+sbJXAZmDM3W3JT8P/0oNDA4uDubo8BE5az3MCAztrNQYof3rRoVP2uMt3/4Tsj5M
+GRTxtngo+Y4/NPyNQND4YwWXTGczN0fmdDk9Ld3qABwWJVYmMIBtMqwq47UlyqtH
+hKcHtY/DgGQ852Aa8Buhp3XtHaMDKGSP6dGQz0JL/cX0rjPajwzO5Px0lXG3nlTc
+VuZTNPFCxef1jgjmCaTWHtSXIJMkSBVem0dj2FDwJCVC/60u++tFCPuGpYsknVkX
+zdadMZ8YXEt/747HOX0GvIkFUScT+XlkADPK+jcW+jvoC16wCB4shozUtUInsp1a
+RHkhMzrc4nAzIyL984Ia5VfESVlCLUMAGOvYjTijlAvDvquel0In9Kxu4f/90zRE
+M57ebUDJIjjjWdZV3qjbZhsG+gkTA4tFW7JAqH2fC2dVHKhTAkq0Ikd1hml56SIy
+dxeU/+LJ4bxS31ajyvu7j/DZYY+ubLo8ad2+/uqeaR8w0TjASTet6vti4BbGvysH
+MJExwUgudT3U4hTOmq3PWTIKOTVOQR0bc+cmHrBcOt22szUrZ0Ryk+xCU/DQkjC4
+AVgIqylw/d2AjtpUvN3ih3nVExP4Fi1yfAj+3UpiX0aXoF7jQqK6Rd/PUUUbOOr4
+S39IfRdOcxWq/H+mUfsaEGuDDAuDc83bZx/V2MYr3nzmxfTQecMghFJq06YhuQIN
+BFUCi7wBEACylkrqTFzWQZvXNwDc41V998StsG5B0I98c1fyRlUq+s02GDlQ8dRO
+DOuSAVc0njcWXtT7ekLM7K0n9prLzBTwZp+whGsYY0BFfBRYdcnGoX+jY7P5IqgG
+T7zBE0UpvkuZy4W5mfNy5I6RlpLioxmMuX7GNBzqMlOnUP5yxFx5C2a4otihxRZ/
+HGaZCC60ckxbxQjEw6dOy98l8dWQMcC1+vLritO8A3J+wInXccZXNb19xrEaWIXh
+TCk/qHkuZJrUs46OcgGq/5e8w7qwma2xHWN9sWcEpNQF9ecC+lB741+gu2iZdwPD
+3S2SBEfMgApXUIUn3QdoAfw2UQoA7KodnvlHn7ve/mxlTUlN5d2GiBdkQBUtyf+Z
+lfZy4hkJaMriMt+HIcwdr11j732I3d5vqxdpaABfnvH9kfF9Y8oOk61ngkmu4lIf
+R38iBk6SxnZR6Ds0CRlYNeUuudP2p3Ux2ZrsRLLHxeMyNt0VR/1P8yX42sZo/b4U
+Td3y1fYfB7Q62+GYXWnOjkXF37Po3c5O6oXBJhFFzRITqWnlvp2jojw0/5xrFv3H
+mKfbO4gKlyQAIV3fBzfnzrpWDmzgXxh6xEdu6ibQqbFD+LDQg+S3YRogDwIAxsDb
+Jl9fWDW4bLJq1TMiFwy3sxfx2NxheYkOuGy8v4MFw/+hsbDTq4DEHwARAQABiQIl
+BBgBCgAPBQJVAou8AhsMBQkJZgGAAAoJELYEwyrV18bYU0AQALMF2NODxEwnY6no
+pIK6Tqjgmx52O/WvkRO2J9/MwzWdipVU9qyP3JPu2JhAe6fbKbzxOutQu69mGgJ9
+OK1j58ffKjOVffLFvPHAtL/8jjXeS9icJlTlBd8i0tg5JNJ3tKIGDeZhCl1jKZZL
+AZ6W50HUIEXb9rYLZGFGWfnBqRF9wwLQ9LEp6vososbKIbm/F+uoSwJXC9XY+zgJ
+Nx4N4Ml+KPVo/pJ7777CV4cOieEZL8q4pxBMEhO/3vf3Aq9NmFPvZjKrLtQkiDCP
+0YXzdFub46240x+AwXhwn1sbtyqcXjpUPcI+QPa5vvL21nORZaStR2vWFERy1J6L
++Ksh3atxv42kTxlfg7SBWxbiM3lgGFUJCGWvcpwHr0pMwcnBJV/0Ss7ukY7kGPLh
+iY4aNGabK9JQU3v3MgC74WNhlHfsFf+gQfTLoOyki7SA5A92edaw93BZq32dO6dM
+IaGhJPbvGBT8gTe5v7T8h/K7VIEZC2WAnG1bAgUqVGsd9Bp1FzY1yBYMUr7SsPfn
++W+JY1eKj2fcGNN+MJUkZQrDHXT5VQxlKTzGxrHCayNQ/nZPDWFuWuRWgyOaKHzI
+cnbTUxX5lxgqo0ORnamu9IZsnnFzQJsqMkRK6vIdOGThpUnDw58XTV5hIsN8HBDY
+dU6RB7ci5A23cKTBLtCW2jqoPm33uQINBFUCi8UBEADuVtxIS4QI8D939rpG4b4T
+HdtqJQaRtjRjA0pZ9wQfSUv4A+A2h1JEYlfCmju0cRm5+pwUHHqA6mmDjcTP1qQa
+YllwDh3freLH6wEGckB62ZvW9SxZ/3PPJvtNpZH0zoXfj5FxCgZwRVS3pvXzREQq
+2evlKoqWo6u5ok3Jzl2mKf/KiJt7ihevC/ln/DINrXVNPRNsyRlPrsGMd6XY8VF9
+6pU6MHfdWwoydaUl2zD65SSIxjn2E40kg2fJ+s+k2wIL3VwFvmCDeUooSdIoa0MO
+mC0nhl7EFVf+YSIENHqAVQGLlMti2N5qtMtPmM4ZRFNnJv+PR/k8Si2vkJ9gzccb
+WJLx6Dv4vjuu6sFu0dylXRk5QDNaTyHYYtLExmMZLAIa8KLyG4LCheMAcqtsqHYC
+ApgTc420vVdpBF8k9MGr7ClsVnTprnaxT2Ijdvj9L/MTdzWdMZbSw4Vz0WAhCrA8
+fgGsaAPUmD5niXR92Wub+eDpYr4Cm0i5u5WhTohMn4QHxi21akzn2V0wEgYqIuom
+HVnb6y+qVpWKX3yYoIZIYf0I8Um3GBn8B8Qxd2zxPM387kzFMsiDYoct9UNhYijc
+k2gHIuV+icg3+8zbW6L/E6lr913uaGqRBeMLN/NwYxsd4yttnHPPeTa9U8uij8E7
+Q07WiZRvi7qcfKV7/Wat3wARAQABiQIlBBgBCgAPBQJVAovFAhsgBQkJZgGAAAoJ
+ELYEwyrV18bY9w4QAMUzxsTnd80QOcq4keCwkUYISgsA+EqKtldTmWIpL2J6BMUO
+o+nHeKsz8CjgZfWoohXxUTxIprLkReG4QwxA0r8Nf5gCP3UUQGCjjf+z1ZtrGE8I
+1YPZL9RlAnJOK7z2zvBcX3mAhS8drNLhciIj78A9SDmyu0G94kDN+V4Pt5TZSsNh
+hETfq3qr3MdMPmuY0JRbWsUEVN6Vf2IQhl8B5gYNqVCBgwASHHNGe60o9rFOIIPd
+tOZ5+lfJHMpfMG1/OV+tcgXoiZkboruWChdtkx3VVUQLSIAX4kQHtWkI2Pw6iFkX
+mITT26jjwdLN0FdwAaXIysRdqzBcK0cncGQFNl/JtrOcKev5vz1ByEs7dmKUbs+U
+Z7CC+gT77gwrkLYzDNGKD0gaSOlUM03A5WRYazZxO/R+4e+p+RY7/m7GL3Sca/8P
+G0EvXvcTh+jcAVP+gBbRTVHKea7mr9r/wYA9vEl8ZMRuJ16xrHl8DUkmbSHA6x87
+h8eHI5nThqebokeAzcx/wdKDyUkRpXbRTqBS/YOTwsSIAv3b0x5BNl8Pc8CwZZXT
+puDaRPlSaJBwUjAb9oI6FVEjPzmdXQ7+m1pGpvr14xn3f9fqrma9pgoYMM5K+WrX
+zkp8ECBslT7qVsIeMKxZ9h0ph6jzMASu772WLzb94QrJfBB61ePI+Bp5o+ui
+=qSqw
+-----END PGP PUBLIC KEY BLOCK-----
diff --git a/depend/zcash/contrib/gitian-downloader/nathan.asc b/depend/zcash/contrib/gitian-downloader/nathan.asc
new file mode 100644
index 000000000..2a2be1ee9
--- /dev/null
+++ b/depend/zcash/contrib/gitian-downloader/nathan.asc
@@ -0,0 +1,52 @@
+-----BEGIN PGP PUBLIC KEY BLOCK-----
+Version: GnuPG v1
+
+mQINBFfPXJsBEACwNO57V3pX47/GfSU6QUBwNUpm3tw4nAafd8KSyclw0LlPSfaD
+yu4UG5Jp/YCtLu1cnlCjd7tOcFISMSmrzmD+83qjUfoy6Q6y0kC80/e9n4s6tTqA
+c5SRZkuKFeBj+QCAqgEOoO00e7StvhFTk3NAHgeh7p0a76eLzrg+ectn8KM1iqwY
+7pJiqqsfdsREWWlABCT6TM1B7qCOlIVNEL6vmwdy0iG0NhLyl4dN/BJnwIlj/EnZ
+iuNOUHJc/4V5+22Mzbx7E/vODtJf466rSaE6j02JtngBfYhG7FJfaU4J7fZtV7CX
+HwSYoFKLCZR5/xS4fWrtj5PPnvO8fFYLaV0dgC/TBdlJ4qTFE3BOLp+U1ZyNBVdL
+um5VBVopdjNJzMN5jX+4KkQeRcStFPbABzdyWHkaHPtzLOjcmq17ZCtyi9/s3ZKB
+frmFwftJhzj8MLSJu6mSyx1AxAoeynsqRhki4ppZrXUB1oZQKdUSo66PiI9c37bm
+CpfFgAEVfba8cmRsNYo566R0QmVjtuFNAHdT/SIxTx7U5cL9qK0Xg9ceInIQ425k
+kMC1e4DJSbqh0CcMmc9e+NFhsib6uXeVRMDzzJaHZywpCmBAgHBzPjW6ZrJRELn6
+hy0x7zYPu6dz27W0h3N2+HaEt9Brdo378eKm8BIXx/XIYb/TF0X65kFjYQARAQAB
+tB1OYXRoYW4gV2lsY294IDxuYXRoYW5Aei5jYXNoPokCPgQTAQIAKAUCV89cmwIb
+AwUJAeEzgAYLCQgHAwIGFQgCCQoLBBYCAwECHgECF4AACgkQ7UF/vnnJnoxXdw/9
+GByxP6J7zybTAeiByNEh+nIhNchhk5h47MPcyb/eLABif3puccjWYTbbClay/Eci
+Sj7Bfiq4lFuerdydhqMBmdjUC7oACyr5yNbJqlIlAuBLgVcsRYCM0tZrXuHIMY6a
+YCfSZsewK9f+tY5RlVuTCG0GzPGyFwMJpiY0WItZfrqi4bZ36KQxOEbrWqNq2+VZ
+0y5imSy0uyw2twfocxLiofVD/PS35iVZauK4p7lK816cWNUZPS/XEiBR+3HrGI/d
+sphn+IDJPifkImsk4LnE+Ek1lYlxC9HKkvjwBfNGS9h5EJmQwlPRn+emETnj2or+
+Ynxc274mvIxJzh9C3usmPKKRM67zqh2J7NvUi4zJQX3oanY+nYZphPpPYiosWhfh
+5c8j/h6W/YX79/KtxUwWe+Owxyeo3gUpryftDo9oYhUYzv2Cc7RxjKKiDJgIqf2g
+4Ni0NE8VpIryYB21m70fnuBcmNw0sRrbsz0TbRboTcCh7dsN1nAyudQj7khHj88D
+FbVPZ53FifBVyEX+WDv1nDNE0B3SLVGLzPSVLA3G+iptr3uy+GHmB+IzQU2j4bLq
+vMn/b6DkvAgDnzsRanHHYZNgeuEVvTeY+aiQ9id66JE5QOLPWwwLg6ZanD5So2Rs
+n+4joCXv7Ybj5e1uaw7gtCpwnbLAyvLoZVOD93h7rGO5Ag0EV89cmwEQAOBqIdl8
+109TmyQqAZLGpTo5i6ogpe5jI1KKKOhLZwpvGNKSnLIq2s8m1mTMhJrhGuPDf5US
+LTkR3JeaKAnCI9b1tYxoumSuiu4efCVrmBRA3yOfbqsWFlPF5mF4Ih8YSbfEZVtC
+2VTJXAl00M24xPMKk7sUn/vvs2Go8v1dJtWizwNHTkvjdp9gMzCgLh7oh/0Dl24W
+IrNSer0076GLvmUFPgyfabKtZ+E4oMczbDN0R7KoMRNB10FfYjO+JQfyZOZYTKeJ
+KA3IfRW2fp6YDvQlMKCBy+zK6aDu9gPmudWzVIHrXJESY1e/zXwqDg2wpt6IuxpN
+IOrHI64AB4vRRGlJvPrIm5JRrr1QekJUf/vjy4VTC/r9LNXFwa5FdINoiEHyq3sG
+IHgXobruF86pYQIyRaeuiJFTDFg7I57F82/Ck0/uq+hkFoYxfuAkyX1W9UzgBCTd
+D1lGF4xzTuQMDZqRvOZWbA0BlZlENV7oYvL/6tX86Ei6BFb48x9sy3WHXzwfmQlD
+agMzodkAjrpEHKuHkmJz+B+BvKhWmYjMgAOaMFcV+9yje0+/FIWdQaks7zjumO0/
+OpPh5nnIxM6kJr8mCT0YpGBvHh5x5Sxp/CYMMqNrbYarIa5V4JzawUMX2Qb1m50x
+dysa1F3+56OYzqDfzcf7nroCKa6+8LnsMtZtABEBAAGJAiUEGAECAA8FAlfPXJsC
+GwwFCQHhM4AACgkQ7UF/vnnJnoxrZw//TuIsITFk0YPlWZRFawt2SFF7XzuAgCZX
+xA8hf4i+eulKpqM4qxW/yaCLTTCtxTtF09WgPXfYOa7OuPADzYmawzjwn8oJhcVb
+d3AN9NmRXIrSdO+ZEph29U65U3owbrcGkYqokt2ipeYmWpT0BvUesOxKxBM5FZBT
+GWb/OXZhRyw6N3dKbT4N/BU/JWohSRtx87D5TL1AocsAJ9Nt+2TGYyGlHZ1kMhUY
+sGciY/eClvKU1x4e0ynR8Pqe/WmlJIcjsH5azBPHrWYVgExjczo4uHxx/fJItdjr
+Jq93Pr+OoJL8sT3/V3v892czKr2i2Cm30xVwdjytLyyDnBZZzYa1+CojL5zQOlQg
+ne0/YxvU2siUTzIiwzzIvTCsG9q09cgpUWN7V4zw3wEueT2G5AoQEaeCvu79v4P8
+2DQ9H5qtyriqqlrKfyeiUO27ZnjmUsn1VxbuKW6NqhegYHyMfEW/TQutt3ktnf99
+O8JCtCwnAo+PINpW0zd8PhCbQmDsnA6Xz3ejDlidk5qA9M9t8tZEFCVeYSmsnwex
+9gtZ+x/FMBGC4zx2kcvAMSUz4jFCYD/S+YCDVPBoNynnnjBpCP1mX7ogmoDQAFbj
+jXMXFZogTinHxjJBfoSUy1lZYRx4I2dj0F6u2qt4WSKAqFc/99b/FV5sPgw9HAIj
+JfmuGLm2Czs=
+=kUB4
+-----END PGP PUBLIC KEY BLOCK-----
diff --git a/depend/zcash/contrib/gitian-downloader/sean.asc b/depend/zcash/contrib/gitian-downloader/sean.asc
new file mode 100644
index 000000000..9b710ff5f
--- /dev/null
+++ b/depend/zcash/contrib/gitian-downloader/sean.asc
@@ -0,0 +1,51 @@
+-----BEGIN PGP PUBLIC KEY BLOCK-----
+Version: GnuPG v2
+
+mQINBFN/6CcBEADJ7y3ejKFq5FDvK+IlSgXpZQicX4DBKjWAVKI57iIVJ2iRpUSn
+q/RnF+pW5WuKYV0uu+JueyaPo2tjYTqx8Eah3LOMlC9Kui4bmHsQHmLecSWZqrUX
+jrilfSHHMLOzdp3ufZ6BfgbrMIQEycQygjDXY4FNfkHKkm5iyW0NznhYZr2Iv6wC
+h4I4lA4hSYTcU+BLoI3ENNX4OdeBN5sXOJsyYGXOzGskYDa1Pk1iZbeba2Eg7U3b
+6ItGymJjgLRbDiZQzBhAH7yfR2VkI5MycNtnuLk4M5j53Aangb8bkzv1/z0KwQYE
+N9xXcr2GceJ1ShbdqRiVwtOeRupBPOtL2J0o/bJuigAG0UcugcYgj4XbZ0JU7yPT
+fuXqdSBdodTM2mwhBI1gTBp7HnmIUlX3hHNjRahRxYVJi7oT2hALiZOyHZdf1ylg
+Cz+TKTl4kTg+P8dHW/PrPlPbbcQlHuEfbINzvpyS9nndxyQM7P8cuUwqvLzU6xhB
+6DR/XLbrY3Ho/sYyKyzcAufh6x+7/xfggJ1oyO3qJtJwa68sccj/TcShF6TlgEPk
+9LOKdWIHv1xI0CpbNJpC8LmTp4D3P4WSkXDit4/K5MkYT+c+C7RkbHnVC2EMaDfI
+ZphwMZ5QadDxA6lRMREAfBgRIMUKOAPEVtSEgZalxwFfoThS+8vCV3zUqwARAQAB
+tCFTZWFuIEJvd2UgPGV3aWxsYmVmdWxsQGdtYWlsLmNvbT6JAjgEEwECACIFAlN/
+6CcCGwMGCwkIBwMCBhUIAgkKCwQWAgMBAh4BAheAAAoJEJVoQlfY+LAxit0P+wRK
+s9Btsu6/rfS34CoOj2xwfNqGhzjPAFEWvXFZ5Q45ydtofOQ6fUm1Rw63Qb7RfEhl
+Te0AiyPTxjCFh6VVE+DLPArk9LwgeinihUb9hgt8LCjIacH0Y9wAqHpmveeyd4aS
+ZiQXToNS5KOZ40mp2BObuGmFr+X7kqW/YTIpptbUiUB9MmeDE+pxZ6fM+zK0RNmf
+x6T5gs/dh/o3l8Xh772YT6DRzg87nemt66jSs8yi+wJyYDP/YMlOczTyV0pciYPL
+mavvuoB+ZzySVdig/7vbddqvJCSgGVb1WDZZWp+EBpZu50+zjpHnfz75//pEkhwo
+nRIF6iNqZg5Ot+UKsneLir+tVPUkf9jy7gSXZr+78m0WQII+RZtU9kXDIrK7dGMy
+QCs5lCtYDpbZVy2IwRUwi4C7JuC20wZ2NByKUbH6OogzOng4os/4HIFdPMixNnFd
+J6fGhoB7t8zWz3w+/iuPy2bJdRblUC2JKKmkqga6ZNLmHs5RJvdv5HmO9JFpJuPM
+he4Fn3txK3a88XV+SSZmv46rsoWHlYB65GhMc45soLpWTsDlJFE6V++CtoxTVFLk
+eF1TrrVsn/edX4zht5l9VIa2V4udSf6QrhnRUK+oWPdSNkmEV5OjfYbFaVIDvk3X
+P1c8aj+SNnrEQcpLP3TlPOjQQ2KIAPZbxjP8pkiVuQINBFN/6CcBEAC4K57I/Pi6
+DzW6UMw1OHkui8oPjxdQOxjLP8ymM0e4T52iXyPklArLyFfoafYV28of0Y2xy5Z0
+sE+BGjHiDN7xGDz9RhtpOQ90NzYGnfdZx+3mIhDm/cvbynZ8JTzD7jNVCzAI/tqA
+kVxTyq40/QP+BetHvfA7MjcuyuzSRDSqKiISy5cCPTmmp4mH56MrSRoL6QNupEHl
+M6bZ2CypOyVUv/rYSxFmveZGWwBoInFjTJaYaWgQoDqeueVvQFToUq/HHMvCvv9V
+UXytHq2xgXEyLsJhnbKBosTHsM6Fbo6fTnUIvaBxFnNnK9UUYVdtNJbve8vvhL/b
+zOjjA3uthTWFNYswAG3ugtOwlMcljYgGSW7Ile/AWgyLk8I0uJfJEerROZfphU93
+PaikOFwC31v+AgOCV3kVFTnxiamwVrwyD63Ol7JF16vpIZI15HBbIp9WbE9Zhnai
+GdmtDjkQa7FyJmzCdFnCm83vlV8WLCdxFTWKc/eci9oyrhymx7sTAOdBbldXmMLj
+4lfEXIfLemYeD17oBYuUvWXXnMdGLXxLzPLxKbTJhndA5wl4iGfPF1sCPU5cDw2N
+b7DMJVLHzYTK4mLBPQLF84TeN4kWdd7bK18jE9XK2efcXR3f+J7X/KnX4R/4gLLs
+CVOtDYWi6b8xFGW/fpqcC7I25VqWGFe97wARAQABiQIfBBgBAgAJBQJTf+gnAhsM
+AAoJEJVoQlfY+LAx/0oP/RTjO7YvE1rDePbrNynQhc5ImyME4yJrhvOMj1vqvn0f
+Z+z21YNOUs4rC1zTRQO5Fypg7ILWtU1leZ0oV+z2cA5IJa0WMu45mXfgIS7sXkU+
+/BC3tP1kj6We+IVcmKbNKNqtSszb/Ls5mw6/ADNRxcJ12btMKiGFC7ahEHjGMBX/
+OQe5uFoPPNYtL3fEuroPk3/rGSRG9nECa37UA5PLmvq9xuRLf6cbEQ7gnu1aZ1Kx
+9li5FU16O3xRUBGcJlovtzZfnm/fyc1jt8Su7v3Vuot9Bty3O8uLzfKqqV4DrkrH
+dLKFh0NLCnApdRmGzWyFFTMFW1otMCOqLsfyjzkKVuouNl9HqOEmvG9PvW1b04DP
+FgdWdpclvhFc/32q+gWi6s6M8oz3dTerydET/1QU/ADkpidDvq7BqHWdsuFTHBF0
+Pie3AfkQv7/1Tb44f0GjFAOLk5GjufHCwLy1ihACFQ/fXfIqDA8fgdu34vhq3Wkr
+VEKANOT8lFuhr8TbKEiwsNrOTorQj0nuybIXNNBZehb+XiMgd8265utw4g50hXoy
+HbqIb2eL44k7TDK0w6g/1SATegplFcqi+USXNTKDGV7aTj1PUePKVMdUG3aDoP9t
+e6RMNnbUmII/VPfFfw+LqX7qB7+OYLEPnZ5zG3bxQRdsYTqQKBpYQqDGpDLhH3/J
+=0DUx
+-----END PGP PUBLIC KEY BLOCK-----
diff --git a/depend/zcash/contrib/gitian-downloader/simon.asc b/depend/zcash/contrib/gitian-downloader/simon.asc
new file mode 100644
index 000000000..3cbf0f57c
--- /dev/null
+++ b/depend/zcash/contrib/gitian-downloader/simon.asc
@@ -0,0 +1,47 @@
+-----BEGIN PGP PUBLIC KEY BLOCK-----
+Version: SKS 1.1.5
+Comment: Hostname: pgp.mit.edu
+
+mQINBFeNa5kBEADXOwQSFGy5mSfm5enqT480t8z/RjcUnURbZsf1iXMZ9UlQh5zByXZaXEg7
+iHrBqpFx/GmETQRXTOBl8UGrr/ex0WvzMu4Jpc03BedwCH4hoSBWvFvMH4jsU0LTJLwAqpDa
+KVnUD5TpOFjEGv0MkUideoiA7iSYqa4KIl1gu8bP64hA7qo/wEbBZ4VPgizO3oKUvampjQLR
+MEBDfiKvocJJ44KLeaxVzFWty1lzHtCPAxqt4M5/hJ+Gk32ZJaZZRBVppPb+Moe246QGEXNF
+1p5X8sTts3+TLZ63AM7VXbOoRCSpLxbhXdCvit75FZdpizIMhQLvgiKqsRrB0e6G1Oysahdd
+P3YVj/P1mtcqlvAkExc+1nmKv6MAHhc19Uwn84l51hGwdXdXOALnAYKbNIS5E94QRCUbmhKO
+mNypQiIPIN/HSVEi4et18bLgCUY8ALXwS5HJeNLqe8pJe22/ht8T+oPtymNSHvMs8UzF7PqL
+fKjSEv3ISbBL6I6t7PTXmYh6P3qJRNEstK4GZwsiiOuF0fu+k31JYjLmHgPhC2+aJ+wUwaTa
+CpkPXxJKXVX5JyPlwpDYE0zqIn5ulJ6SQoXqooQeGHk2zTfk1AwRTSCB6wZDMX0FnbU0w6A1
+V8tq/VI58+k2hi+hQntcSkXp6tagMoOl9OAz3S4DfIxB0Ho4PwARAQABtBRTaW1vbiA8c2lt
+b25Aei5jYXNoPokCOAQTAQIAIgUCV41rmQIbAwYLCQgHAwIGFQgCCQoLBBYCAwECHgECF4AA
+CgkQyPScCB86xsQCSw/+LIyjbAq7Ua+AJtSTiGvae97QCe6vrpg5hGA1nX1HLjC2gUrydHH7
+PR/aWcwHnxq6OJzIA5UtoYMmDLU/9u/JRgv5Cr2j71sjWTnqWfO4k03w240mRS4ukcAQJyoU
+ef5x74Fj1GFbAK1lUPWRp84ZzVJfV7mK7J6Sx9fYV+vwr4IBakDL8KY2c6UbIx36u9JxyjwN
+vHIROmPj98ErKou3XctK/T4b2bD+G0sCeUjtafo2hmIihkIzfLuch7V/G7drn4t5vyRihF2a
+RskrUIySfY0vUucp1gpVQc3mmqHQK8XDpsR/s/swm4zBwuU/q36ikO22yGMP+V+YmjSH2RuI
+TFEdrmSIrwYgmu47eh9aHouM/eG8YYOow+HD69XWtf7RleM302ssRC7nts6Gj1mTnnyYj5cQ
+TXiX/CUdBTuBFco35PQLKzYd72FcBxZ9acJlpMjtp6Lr+VaffJ5wt/cWyowCNSWeHqJGiVPU
+LSuBt2Gj7wJfT/EWN3NSAK2JMPYUEYuzLF+dcfBWQaDLsR/KBpSJI0VuS8MqnwLy39BeBGQD
+dz+9YU+0iPfvSiJ5vFFnO7SfMLnc+Sbja5MsvxN+O+pFf5Du3hPIfjiwd76jFTUho7uWDOnK
+Tl7m1DlzNFBQhgt05E/xtk5/OqpLhT/RRvpoG04Lc1uX84yqKn1lrt+5Ag0EV41rmQEQANri
+TekWLBV/ZFThl9Xvbqs+KBC1uAHH1U6b/mpQPF2d0/+JRvmP+oohQm0cEOj3/Ldj5Ap2RJc9
+0jiixOKqg5HDAWIe8iq5b08RGMqryyGHfo8/+GyN7iDhW3RVht+G4XSk1eM1vXyWw1x/DEd0
+1tWE2/udwTbUoX9A25zx7l+vJQ7x9oYjTXZ/ZZE31knR9iVYWzsMfFH4QgsTyWPPZbWsBj+0
+HbR7hdQLG1IQw9EH3j+NHJ4rxlO9UslnhNeEkQvJ7WLafhFCFtRgKJmgN5EUiunNC8/coiLZ
+54uKj+PVo0pn+cQ2GaRFxj+NlA4CprNnRtg8dI3iZjM3Tcl78FWtse9hyQdQ3EScclkRZMdZ
+4CmlNBT9KDQi7kFEHfxVriR63mXrzvom4+UKQOxQyyrXKNr8eqlcmKFhaeh+H++BU3GxtVfV
+tScLrfaZQjA8CL/lC+w/UxgSKMRbLRnvecQdp1asOFw46gLjuCvJWUW0uNmc3P4F4bUlI+xS
+BBa6P2KL8syRhodhy/+aL0OgPVEq+JC1RtX3e1gYldn/3MYIfWyW5jSbTO61VVy2cBXuaVz6
+sCdC8swZEf2x2kBVmODN43zldmgdfPU1P11OL0Ul/k0V7fvGEiRlhuBHzHLHed3Wilqz0tEE
+tY6JIg/wF1Kp3xv9WOTJAXVsXdbFj7/ZABEBAAGJAh8EGAECAAkFAleNa5kCGwwACgkQyPSc
+CB86xsRd2w/+PDe1ZzGchaPATRdr87clKsfVjDajI2WSCw9LaM89J+7l0crpIjk0dm8//jaB
+49P5teBaqkjEVbdzOfzvv/YOb6wZURHxIeiXztxKV9CfPReQdHsagRcf5yFHeJfxMRRnB4TH
+/Uvdf6hS1n/GaJmwkpYwCEYE5qG+Mwfmq6DkQUYZSITRovSTSjfSfK96CmE8CgZBM0ZmS/dP
+vYCkjDzGaU3IsFUFbf51hYMwMvbaia22Qu5nQ+o7edCZVuzgAqO5UchzNVTP8RUyIbJZQOce
+9VSVXZnSTzQi5fQIQDCN+5K2PkQGfB9EiRys784td3JljHHj3SgVngHRtSxAexJRhCKogIHJ
+XW0h/e4TPMHhqRtFAN7k2CT/47S6n1875r36CQgZlIv1O9F3I+1FEbbLuVl5yK/lJa6st+BY
+QhqV5iFc/HWRDg+ETITPQ3tZptsvEJTu4ypeahLpUJ2xW+h/j4QY+jnAQOTrann2dgFkXR/h
+jZRbelUSl2ptj9Wxi9gWJ8Paolfc/DbZV2eP/wgS4bvegdZAIyQKe88pp+1CODkBAmlRN6e2
+HxPg1fOuXje0kDONqAKMweLXZL/FhtDcsXZ0dfeUobPuxZzxl+89dt3wGYToRGqQQhtdEbrY
+sByqeURg4gzgcw7WjJGKgzqdksOWjJybrGnTvdld/75oYxY=
+=nZf9
+-----END PGP PUBLIC KEY BLOCK-----
diff --git a/depend/zcash/contrib/linearize/README.md b/depend/zcash/contrib/linearize/README.md
new file mode 100644
index 000000000..06f278f3b
--- /dev/null
+++ b/depend/zcash/contrib/linearize/README.md
@@ -0,0 +1,33 @@
+# Linearize
+Construct a linear, no-fork, best version of the blockchain.
+
+## Step 1: Download hash list
+
+    $ ./linearize-hashes.py linearize.cfg > hashlist.txt
+
+Required configuration file settings for linearize-hashes:
+* RPC: rpcuser, rpcpassword
+
+Optional config file setting for linearize-hashes:
+* RPC: host, port
+* Block chain: min_height, max_height
+
+## Step 2: Copy local block data
+
+    $ ./linearize-data.py linearize.cfg
+
+Required configuration file settings:
+* "input": bitcoind blocks/ directory containing blkNNNNN.dat
+* "hashlist": text file containing list of block hashes, linearized-hashes.py
+output.
+* "output_file": bootstrap.dat
+      or
+* "output": output directory for linearized blocks/blkNNNNN.dat output
+
+Optional config file setting for linearize-data:
+* "netmagic": network magic number
+* "max_out_sz": maximum output file size (default `1000*1000*1000`)
+* "split_timestamp": Split files when a new month is first seen, in addition to
+reaching a maximum file size.
+* "file_timestamp": Set each file's last-modified time to that of the
+most recent block in that file.
diff --git a/depend/zcash/contrib/linearize/example-linearize.cfg b/depend/zcash/contrib/linearize/example-linearize.cfg
new file mode 100644
index 000000000..4c5596deb
--- /dev/null
+++ b/depend/zcash/contrib/linearize/example-linearize.cfg
@@ -0,0 +1,29 @@
+
+# bitcoind RPC settings (linearize-hashes)
+rpcuser=someuser
+rpcpassword=somepassword
+host=127.0.0.1
+port=8232
+#port=18232
+
+# bootstrap.dat hashlist settings (linearize-hashes)
+max_height=313000
+
+# bootstrap.dat input/output settings (linearize-data)
+
+# mainnet
+netmagic=f9beb4d9
+genesis=000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f
+input=/home/example/.bitcoin/blocks
+
+# testnet
+#netmagic=0b110907
+#genesis=000000000933ea01ad0ee984209779baaec3ced90fa3f408719526f8d77f4943
+#input=/home/example/.bitcoin/testnet3/blocks
+
+output_file=/home/example/Downloads/bootstrap.dat
+hashlist=hashlist.txt
+split_year=1
+
+# Maxmimum size in bytes of out-of-order blocks cache in memory
+out_of_order_cache_sz = 100000000
diff --git a/depend/zcash/contrib/linearize/linearize-data.py b/depend/zcash/contrib/linearize/linearize-data.py
new file mode 100755
index 000000000..bd2fd3b5d
--- /dev/null
+++ b/depend/zcash/contrib/linearize/linearize-data.py
@@ -0,0 +1,303 @@
+#!/usr/bin/env python
+#
+# linearize-data.py: Construct a linear, no-fork version of the chain.
+#
+# Copyright (c) 2013-2014 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+#
+
+from __future__ import print_function, division
+import json
+import struct
+import re
+import os
+import os.path
+import base64
+import httplib
+import sys
+import hashlib
+import datetime
+import time
+from collections import namedtuple
+
+settings = {}
+
+def uint32(x):
+	return x & 0xffffffffL
+
+def bytereverse(x):
+	return uint32(( ((x) << 24) | (((x) << 8) & 0x00ff0000) |
+		       (((x) >> 8) & 0x0000ff00) | ((x) >> 24) ))
+
+def bufreverse(in_buf):
+	out_words = []
+	for i in range(0, len(in_buf), 4):
+		word = struct.unpack('@I', in_buf[i:i+4])[0]
+		out_words.append(struct.pack('@I', bytereverse(word)))
+	return ''.join(out_words)
+
+def wordreverse(in_buf):
+	out_words = []
+	for i in range(0, len(in_buf), 4):
+		out_words.append(in_buf[i:i+4])
+	out_words.reverse()
+	return ''.join(out_words)
+
+def calc_hdr_hash(blk_hdr):
+	hash1 = hashlib.sha256()
+	hash1.update(blk_hdr)
+	hash1_o = hash1.digest()
+
+	hash2 = hashlib.sha256()
+	hash2.update(hash1_o)
+	hash2_o = hash2.digest()
+
+	return hash2_o
+
+def calc_hash_str(blk_hdr):
+	hash = calc_hdr_hash(blk_hdr)
+	hash = bufreverse(hash)
+	hash = wordreverse(hash)
+	hash_str = hash.encode('hex')
+	return hash_str
+
+def get_blk_dt(blk_hdr):
+	members = struct.unpack("<I", blk_hdr[68:68+4])
+	nTime = members[0]
+	dt = datetime.datetime.fromtimestamp(nTime)
+	dt_ym = datetime.datetime(dt.year, dt.month, 1)
+	return (dt_ym, nTime)
+
+def get_block_hashes(settings):
+	blkindex = []
+	f = open(settings['hashlist'], "r", encoding="utf8")
+	for line in f:
+		line = line.rstrip()
+		blkindex.append(line)
+
+	print("Read " + str(len(blkindex)) + " hashes")
+
+	return blkindex
+
+def mkblockmap(blkindex):
+	blkmap = {}
+	for height,hash in enumerate(blkindex):
+		blkmap[hash] = height
+	return blkmap
+
+# Block header and extent on disk
+BlockExtent = namedtuple('BlockExtent', ['fn', 'offset', 'inhdr', 'blkhdr', 'size'])
+
+class BlockDataCopier:
+	def __init__(self, settings, blkindex, blkmap):
+		self.settings = settings
+		self.blkindex = blkindex
+		self.blkmap = blkmap
+
+		self.inFn = 0
+		self.inF = None
+		self.outFn = 0
+		self.outsz = 0
+		self.outF = None
+		self.outFname = None
+		self.blkCountIn = 0
+		self.blkCountOut = 0
+
+		self.lastDate = datetime.datetime(2000, 1, 1)
+		self.highTS = 1408893517 - 315360000
+		self.timestampSplit = False
+		self.fileOutput = True
+		self.setFileTime = False
+		self.maxOutSz = settings['max_out_sz']
+		if 'output' in settings:
+			self.fileOutput = False
+		if settings['file_timestamp'] != 0:
+			self.setFileTime = True
+		if settings['split_timestamp'] != 0:
+			self.timestampSplit = True
+		# Extents and cache for out-of-order blocks
+		self.blockExtents = {}
+		self.outOfOrderData = {}
+		self.outOfOrderSize = 0 # running total size for items in outOfOrderData
+
+	def writeBlock(self, inhdr, blk_hdr, rawblock):
+		blockSizeOnDisk = len(inhdr) + len(blk_hdr) + len(rawblock)
+		if not self.fileOutput and ((self.outsz + blockSizeOnDisk) > self.maxOutSz):
+			self.outF.close()
+			if self.setFileTime:
+				os.utime(outFname, (int(time.time()), highTS))
+			self.outF = None
+			self.outFname = None
+			self.outFn = self.outFn + 1
+			self.outsz = 0
+
+		(blkDate, blkTS) = get_blk_dt(blk_hdr)
+		if self.timestampSplit and (blkDate > self.lastDate):
+			print("New month " + blkDate.strftime("%Y-%m") + " @ " + hash_str)
+			lastDate = blkDate
+			if outF:
+				outF.close()
+				if setFileTime:
+					os.utime(outFname, (int(time.time()), highTS))
+				self.outF = None
+				self.outFname = None
+				self.outFn = self.outFn + 1
+				self.outsz = 0
+
+		if not self.outF:
+			if self.fileOutput:
+				outFname = self.settings['output_file']
+			else:
+				outFname = os.path.join(self.settings['output'], "blk%05d.dat" % self.outFn)
+			print("Output file " + outFname)
+			self.outF = open(outFname, "wb")
+
+		self.outF.write(inhdr)
+		self.outF.write(blk_hdr)
+		self.outF.write(rawblock)
+		self.outsz = self.outsz + len(inhdr) + len(blk_hdr) + len(rawblock)
+
+		self.blkCountOut = self.blkCountOut + 1
+		if blkTS > self.highTS:
+			self.highTS = blkTS
+
+		if (self.blkCountOut % 1000) == 0:
+			print('%i blocks scanned, %i blocks written (of %i, %.1f%% complete)' % 
+					(self.blkCountIn, self.blkCountOut, len(self.blkindex), 100.0 * self.blkCountOut / len(self.blkindex)))
+
+	def inFileName(self, fn):
+		return os.path.join(self.settings['input'], "blk%05d.dat" % fn)
+
+	def fetchBlock(self, extent):
+		'''Fetch block contents from disk given extents'''
+		with open(self.inFileName(extent.fn), "rb") as f:
+			f.seek(extent.offset)
+			return f.read(extent.size)
+
+	def copyOneBlock(self):
+		'''Find the next block to be written in the input, and copy it to the output.'''
+		extent = self.blockExtents.pop(self.blkCountOut)
+		if self.blkCountOut in self.outOfOrderData:
+			# If the data is cached, use it from memory and remove from the cache
+			rawblock = self.outOfOrderData.pop(self.blkCountOut)
+			self.outOfOrderSize -= len(rawblock)
+		else: # Otherwise look up data on disk
+			rawblock = self.fetchBlock(extent)
+
+		self.writeBlock(extent.inhdr, extent.blkhdr, rawblock)
+
+	def run(self):
+		while self.blkCountOut < len(self.blkindex):
+			if not self.inF:
+				fname = self.inFileName(self.inFn)
+				print("Input file " + fname)
+				try:
+					self.inF = open(fname, "rb")
+				except IOError:
+					print("Premature end of block data")
+					return
+
+			inhdr = self.inF.read(8)
+			if (not inhdr or (inhdr[0] == "\0")):
+				self.inF.close()
+				self.inF = None
+				self.inFn = self.inFn + 1
+				continue
+
+			inMagic = inhdr[:4]
+			if (inMagic != self.settings['netmagic']):
+				print("Invalid magic: " + inMagic.encode('hex'))
+				return
+			inLenLE = inhdr[4:]
+			su = struct.unpack("<I", inLenLE)
+			inLen = su[0] - 80 # length without header
+			blk_hdr = self.inF.read(80)
+			inExtent = BlockExtent(self.inFn, self.inF.tell(), inhdr, blk_hdr, inLen)
+
+			hash_str = calc_hash_str(blk_hdr)
+			if not hash_str in blkmap:
+				print("Skipping unknown block " + hash_str)
+				self.inF.seek(inLen, os.SEEK_CUR)
+				continue
+
+			blkHeight = self.blkmap[hash_str]
+			self.blkCountIn += 1
+
+			if self.blkCountOut == blkHeight:
+				# If in-order block, just copy
+				rawblock = self.inF.read(inLen)
+				self.writeBlock(inhdr, blk_hdr, rawblock)
+
+				# See if we can catch up to prior out-of-order blocks
+				while self.blkCountOut in self.blockExtents:
+					self.copyOneBlock()
+
+			else: # If out-of-order, skip over block data for now
+				self.blockExtents[blkHeight] = inExtent
+				if self.outOfOrderSize < self.settings['out_of_order_cache_sz']:
+					# If there is space in the cache, read the data
+					# Reading the data in file sequence instead of seeking and fetching it later is preferred,
+					# but we don't want to fill up memory
+					self.outOfOrderData[blkHeight] = self.inF.read(inLen)
+					self.outOfOrderSize += inLen
+				else: # If no space in cache, seek forward
+					self.inF.seek(inLen, os.SEEK_CUR)
+
+		print("Done (%i blocks written)" % (self.blkCountOut))
+
+if __name__ == '__main__':
+	if len(sys.argv) != 2:
+		print("Usage: linearize-data.py CONFIG-FILE")
+		sys.exit(1)
+
+	f = open(sys.argv[1], encoding="utf8")
+	for line in f:
+		# skip comment lines
+		m = re.search('^\s*#', line)
+		if m:
+			continue
+
+		# parse key=value lines
+		m = re.search('^(\w+)\s*=\s*(\S.*)$', line)
+		if m is None:
+			continue
+		settings[m.group(1)] = m.group(2)
+	f.close()
+
+	if 'netmagic' not in settings:
+		settings['netmagic'] = 'f9beb4d9'
+	if 'genesis' not in settings:
+		settings['genesis'] = '000000000019d6689c085ae165831e934ff763ae46a2a6c172b3f1b60a8ce26f'
+	if 'input' not in settings:
+		settings['input'] = 'input'
+	if 'hashlist' not in settings:
+		settings['hashlist'] = 'hashlist.txt'
+	if 'file_timestamp' not in settings:
+		settings['file_timestamp'] = 0
+	if 'split_timestamp' not in settings:
+		settings['split_timestamp'] = 0
+	if 'max_out_sz' not in settings:
+		settings['max_out_sz'] = 1000L * 1000 * 1000
+	if 'out_of_order_cache_sz' not in settings:
+		settings['out_of_order_cache_sz'] = 100 * 1000 * 1000
+
+	settings['max_out_sz'] = long(settings['max_out_sz'])
+	settings['split_timestamp'] = int(settings['split_timestamp'])
+	settings['file_timestamp'] = int(settings['file_timestamp'])
+	settings['netmagic'] = settings['netmagic'].decode('hex')
+	settings['out_of_order_cache_sz'] = int(settings['out_of_order_cache_sz'])
+
+	if 'output_file' not in settings and 'output' not in settings:
+		print("Missing output file / directory")
+		sys.exit(1)
+
+	blkindex = get_block_hashes(settings)
+	blkmap = mkblockmap(blkindex)
+
+	if not settings['genesis'] in blkmap:
+		print("Genesis block not found in hashlist")
+	else:
+		BlockDataCopier(settings, blkindex, blkmap).run()
+
+
diff --git a/depend/zcash/contrib/linearize/linearize-hashes.py b/depend/zcash/contrib/linearize/linearize-hashes.py
new file mode 100755
index 000000000..d8229f53e
--- /dev/null
+++ b/depend/zcash/contrib/linearize/linearize-hashes.py
@@ -0,0 +1,113 @@
+#!/usr/bin/env python
+#
+# linearize-hashes.py:  List blocks in a linear, no-fork version of the chain.
+#
+# Copyright (c) 2013-2014 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+#
+
+from __future__ import print_function
+import json
+import struct
+import re
+import base64
+import httplib
+import sys
+
+settings = {}
+
+class BitcoinRPC:
+	def __init__(self, host, port, username, password):
+		authpair = "%s:%s" % (username, password)
+		self.authhdr = "Basic %s" % (base64.b64encode(authpair))
+		self.conn = httplib.HTTPConnection(host, port, False, 30)
+
+	def execute(self, obj):
+		self.conn.request('POST', '/', json.dumps(obj),
+			{ 'Authorization' : self.authhdr,
+			  'Content-type' : 'application/json' })
+
+		resp = self.conn.getresponse()
+		if resp is None:
+			print("JSON-RPC: no response", file=sys.stderr)
+			return None
+
+		body = resp.read()
+		resp_obj = json.loads(body)
+		return resp_obj
+
+	@staticmethod
+	def build_request(idx, method, params):
+		obj = { 'version' : '1.1',
+			'method' : method,
+			'id' : idx }
+		if params is None:
+			obj['params'] = []
+		else:
+			obj['params'] = params
+		return obj
+
+	@staticmethod
+	def response_is_error(resp_obj):
+		return 'error' in resp_obj and resp_obj['error'] is not None
+
+def get_block_hashes(settings, max_blocks_per_call=10000):
+	rpc = BitcoinRPC(settings['host'], settings['port'],
+			 settings['rpcuser'], settings['rpcpassword'])
+
+	height = settings['min_height']
+	while height < settings['max_height']+1:
+		num_blocks = min(settings['max_height']+1-height, max_blocks_per_call)
+		batch = []
+		for x in range(num_blocks):
+			batch.append(rpc.build_request(x, 'getblockhash', [height + x]))
+
+		reply = rpc.execute(batch)
+
+		for x,resp_obj in enumerate(reply):
+			if rpc.response_is_error(resp_obj):
+				print('JSON-RPC: error at height', height+x, ': ', resp_obj['error'], file=sys.stderr)
+				exit(1)
+			assert(resp_obj['id'] == x) # assume replies are in-sequence
+			print(resp_obj['result'])
+
+		height += num_blocks
+
+if __name__ == '__main__':
+	if len(sys.argv) != 2:
+		print("Usage: linearize-hashes.py CONFIG-FILE")
+		sys.exit(1)
+
+	f = open(sys.argv[1], encoding="utf8")
+	for line in f:
+		# skip comment lines
+		m = re.search('^\s*#', line)
+		if m:
+			continue
+
+		# parse key=value lines
+		m = re.search('^(\w+)\s*=\s*(\S.*)$', line)
+		if m is None:
+			continue
+		settings[m.group(1)] = m.group(2)
+	f.close()
+
+	if 'host' not in settings:
+		settings['host'] = '127.0.0.1'
+	if 'port' not in settings:
+		settings['port'] = 8232
+	if 'min_height' not in settings:
+		settings['min_height'] = 0
+	if 'max_height' not in settings:
+		settings['max_height'] = 313000
+	if 'rpcuser' not in settings or 'rpcpassword' not in settings:
+		print("Missing username and/or password in cfg file", file=stderr)
+		sys.exit(1)
+
+	settings['port'] = int(settings['port'])
+	settings['min_height'] = int(settings['min_height'])
+	settings['max_height'] = int(settings['max_height'])
+
+	get_block_hashes(settings)
+
diff --git a/depend/zcash/contrib/macdeploy/README.md b/depend/zcash/contrib/macdeploy/README.md
new file mode 100644
index 000000000..ab670c6e4
--- /dev/null
+++ b/depend/zcash/contrib/macdeploy/README.md
@@ -0,0 +1,123 @@
+# MacOS Deployment
+
+## SDK Extraction
+
+### Step 1: Obtaining `Xcode.app`
+
+Our current macOS SDK
+(`Xcode-11.3.1-11C505-extracted-SDK-with-libcxx-headers.tar.gz`) can be
+extracted from
+[Xcode_11.3.1.xip](https://download.developer.apple.com/Developer_Tools/Xcode_11.3.1/Xcode_11.3.1.xip).
+In order to download this, you may need to first
+[log in with an Apple ID here](https://developer.apple.com/download/more/).
+
+The file is ~7.8 GB.
+
+After Xcode version 7.x, Apple started shipping the `Xcode.app` in a `.xip`
+archive. This makes the SDK less-trivial to extract on non-macOS machines. One
+approach (tested on Debian Buster) is outlined below:
+
+```bash
+# Install/clone tools needed for extracting Xcode.app
+apt install cpio
+git clone https://github.com/bitcoin-core/apple-sdk-tools.git
+
+# Unpack Xcode_11.3.1.xip and place the resulting Xcode.app in your current
+# working directory
+python3 apple-sdk-tools/extract_xcode.py -f Xcode_11.3.1.xip | cpio -d -i
+```
+
+On macOS the process is more straightforward:
+
+```bash
+xip -x Xcode_11.3.1.xip
+```
+
+The extracted files require ~17 GB of disk space.
+
+### Step 2: Generating `Xcode-11.3.1-11C505-extracted-SDK-with-libcxx-headers.tar.gz` from `Xcode.app`
+
+To generate `Xcode-11.3.1-11C505-extracted-SDK-with-libcxx-headers.tar.gz`, run
+the script [`gen-sdk`](./gen-sdk) with the path to `Xcode.app` (extracted in the
+previous stage) as the first argument.
+
+```bash
+# Generate a Xcode-11.3.1-11C505-extracted-SDK-with-libcxx-headers.tar.gz from
+# the supplied Xcode.app
+./contrib/macdeploy/gen-sdk '/path/to/Xcode.app'
+```
+
+## Deterministic macOS DMG Notes
+Working macOS DMGs are created in Linux by combining a recent `clang`, the Apple
+`binutils` (`ld`, `ar`, etc) and DMG authoring tools.
+
+Apple uses `clang` extensively for development and has upstreamed the necessary
+functionality so that a vanilla clang can take advantage. It supports the use of `-F`,
+`-target`, `-mmacosx-version-min`, and `--sysroot`, which are all necessary when
+building for macOS.
+
+Apple's version of `binutils` (called `cctools`) contains lots of functionality missing in the
+FSF's `binutils`. In addition to extra linker options for frameworks and sysroots, several
+other tools are needed as well such as `install_name_tool`, `lipo`, and `nmedit`. These
+do not build under Linux, so they have been patched to do so. The work here was used as
+a starting point: [mingwandroid/toolchain4](https://github.com/mingwandroid/toolchain4).
+
+In order to build a working toolchain, the following source packages are needed from
+Apple: `cctools`, `dyld`, and `ld64`.
+
+These tools inject timestamps by default, which produce non-deterministic binaries. The
+`ZERO_AR_DATE` environment variable is used to disable that.
+
+This version of `cctools` has been patched to use the current version of `clang`'s headers
+and its `libLTO.so` rather than those from `llvmgcc`, as it was originally done in `toolchain4`.
+
+To complicate things further, all builds must target a macOS SDK. These SDKs are free to
+download, but are contained in an Xcode archive that is not redistributable. Instructions
+on how to obtain this archive (Xcode_11.3.1.xip) were given earlier.
+
+This file is many gigabytes in size, but most (but not all) of what we need is
+contained only in a single directory:
+
+```bash
+Xcode.app/Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX.sdk
+```
+
+See the SDK Extraction notes above for how to obtain it.
+
+The Gitian descriptors build 2 sets of files: Linux tools, then Apple binaries which are
+created using these tools. The build process has been designed to avoid including the
+SDK's files in Gitian's outputs. All interim tarballs are fully deterministic and may be freely
+redistributed.
+
+Note: the documentation below may be outdated.
+
+`genisoimage` is used to create the initial DMG. It is not deterministic as-is, so it has been
+patched. A system `genisoimage` will work fine, but it will not be deterministic because
+the file-order will change between invocations. The patch can be seen here: [cdrkit-deterministic.patch](https://github.com/bitcoin/bitcoin/blob/master/depends/patches/native_cdrkit/cdrkit-deterministic.patch).
+No effort was made to fix this cleanly, so it likely leaks memory badly, however it's only used for
+a single invocation, so that's no real concern.
+
+`genisoimage` cannot compress DMGs, so afterwards, the DMG tool from the
+`libdmg-hfsplus` project is used to compress it. There are several bugs in this tool and its
+maintainer has seemingly abandoned the project.
+
+The DMG tool has the ability to create DMGs from scratch as well, but this functionality is
+broken. Only the compression feature is currently used. Ideally, the creation could be fixed
+and `genisoimage` would no longer be necessary.
+
+Background images and other features can be added to DMG files by inserting a
+`.DS_Store` before creation. This is generated by the script `contrib/macdeploy/custom_dsstore.py`.
+
+As of OS X 10.9 Mavericks, using an Apple-blessed key to sign binaries is a requirement in
+order to satisfy the new Gatekeeper requirements. Because this private key cannot be
+shared, we'll have to be a bit creative in order for the build process to remain somewhat
+deterministic. Here's how it works:
+
+- Builders use Gitian to create an unsigned release. This outputs an unsigned DMG which
+  users may choose to bless and run. It also outputs an unsigned app structure in the form
+  of a tarball, which also contains all of the tools that have been previously (deterministically)
+  built in order to create a final DMG.
+- The Apple keyholder uses this unsigned app to create a detached signature, using the
+  script that is also included there. Detached signatures are available from this [repository](https://github.com/bitcoin-core/bitcoin-detached-sigs).
+- Builders feed the unsigned app + detached signature back into Gitian. It uses the
+  pre-built tools to recombine the pieces into a deterministic DMG.
diff --git a/depend/zcash/contrib/macdeploy/gen-sdk b/depend/zcash/contrib/macdeploy/gen-sdk
new file mode 100755
index 000000000..7af726937
--- /dev/null
+++ b/depend/zcash/contrib/macdeploy/gen-sdk
@@ -0,0 +1,94 @@
+#!/usr/bin/env python3
+import argparse
+import plistlib
+import pathlib
+import sys
+import tarfile
+import gzip
+import os
+import contextlib
+
+@contextlib.contextmanager
+def cd(path):
+    """Context manager that restores PWD even if an exception was raised."""
+    old_pwd = os.getcwd()
+    os.chdir(str(path))
+    try:
+        yield
+    finally:
+        os.chdir(old_pwd)
+
+def run():
+    parser = argparse.ArgumentParser(
+        description=__doc__, formatter_class=argparse.RawTextHelpFormatter)
+
+    parser.add_argument('xcode_app', metavar='XCODEAPP', nargs=1)
+    parser.add_argument("-o", metavar='OUTSDKTGZ', nargs=1, dest='out_sdktgz', required=False)
+
+    args = parser.parse_args()
+
+    xcode_app = pathlib.Path(args.xcode_app[0]).resolve()
+    assert xcode_app.is_dir(), "The supplied Xcode.app path '{}' either does not exist or is not a directory".format(xcode_app)
+
+    xcode_app_plist = xcode_app.joinpath("Contents/version.plist")
+    with xcode_app_plist.open('rb') as fp:
+        pl = plistlib.load(fp)
+        xcode_version = pl['CFBundleShortVersionString']
+        xcode_build_id = pl['ProductBuildVersion']
+    print("Found Xcode (version: {xcode_version}, build id: {xcode_build_id})".format(xcode_version=xcode_version, xcode_build_id=xcode_build_id))
+
+    sdk_dir = xcode_app.joinpath("Contents/Developer/Platforms/MacOSX.platform/Developer/SDKs/MacOSX.sdk")
+    sdk_plist = sdk_dir.joinpath("System/Library/CoreServices/SystemVersion.plist")
+    with sdk_plist.open('rb') as fp:
+        pl = plistlib.load(fp)
+        sdk_version = pl['ProductVersion']
+        sdk_build_id = pl['ProductBuildVersion']
+    print("Found MacOSX SDK (version: {sdk_version}, build id: {sdk_build_id})".format(sdk_version=sdk_version, sdk_build_id=sdk_build_id))
+
+    out_name = "Xcode-{xcode_version}-{xcode_build_id}-extracted-SDK-with-libcxx-headers".format(xcode_version=xcode_version, xcode_build_id=xcode_build_id)
+
+    xcode_libcxx_dir = xcode_app.joinpath("Contents/Developer/Toolchains/XcodeDefault.xctoolchain/usr/include/c++/v1")
+    assert xcode_libcxx_dir.is_dir()
+
+    if args.out_sdktgz:
+        out_sdktgz_path = pathlib.Path(args.out_sdktgz_path)
+    else:
+        # Construct our own out_sdktgz if not specified on the command line
+        out_sdktgz_path = pathlib.Path("./{}.tar.gz".format(out_name))
+
+    def tarfp_add_with_base_change(tarfp, dir_to_add, alt_base_dir):
+        """Add all files in dir_to_add to tarfp, but prepend MEMBERPREFIX to the files'
+        names
+
+        e.g. if the only file under /root/bazdir is /root/bazdir/qux, invoking:
+
+            tarfp_add_with_base_change(tarfp, "foo/bar", "/root/bazdir")
+
+        would result in the following members being added to tarfp:
+
+            foo/bar/             -> corresponding to /root/bazdir
+            foo/bar/qux          -> corresponding to /root/bazdir/qux
+
+        """
+        def change_tarinfo_base(tarinfo):
+            if tarinfo.name and tarinfo.name.startswith("./"):
+                tarinfo.name = str(pathlib.Path(alt_base_dir, tarinfo.name))
+            if tarinfo.linkname and tarinfo.linkname.startswith("./"):
+                tarinfo.linkname = str(pathlib.Path(alt_base_dir, tarinfo.linkname))
+            return tarinfo
+        with cd(dir_to_add):
+            tarfp.add(".", recursive=True, filter=change_tarinfo_base)
+
+    print("Creating output .tar.gz file...")
+    with out_sdktgz_path.open("wb") as fp:
+        with gzip.GzipFile(fileobj=fp, compresslevel=9, mtime=0) as gzf:
+            with tarfile.open(mode="w", fileobj=gzf) as tarfp:
+                print("Adding MacOSX SDK {} files...".format(sdk_version))
+                tarfp_add_with_base_change(tarfp, sdk_dir, out_name)
+                print("Adding libc++ headers...")
+                tarfp_add_with_base_change(tarfp, xcode_libcxx_dir, "{}/usr/include/c++/v1".format(out_name))
+    print("Done! Find the resulting gzipped tarball at:")
+    print(out_sdktgz_path.resolve())
+
+if __name__ == '__main__':
+    run()
diff --git a/depend/zcash/contrib/metrics/prometheus.yaml b/depend/zcash/contrib/metrics/prometheus.yaml
new file mode 100644
index 000000000..77d08e5b4
--- /dev/null
+++ b/depend/zcash/contrib/metrics/prometheus.yaml
@@ -0,0 +1,6 @@
+scrape_configs:
+  - job_name: 'zcashd'
+    scrape_interval: 500ms
+    metrics_path: '/'
+    static_configs:
+      - targets: ['127.0.0.1:9969']
diff --git a/depend/zcash/contrib/qos/README.md b/depend/zcash/contrib/qos/README.md
new file mode 100644
index 000000000..c8cbc0264
--- /dev/null
+++ b/depend/zcash/contrib/qos/README.md
@@ -0,0 +1,5 @@
+### Qos ###
+
+This is a Linux bash script that will set up tc to limit the outgoing bandwidth for connections to the Bitcoin network. It limits outbound TCP traffic with a source or destination port of 8233, but not if the destination IP is within a LAN (defined as 192.168.x.x).
+
+This means one can have an always-on bitcoind instance running, and another local bitcoind/bitcoin-qt instance which connects to this node and receives blocks from it.
diff --git a/depend/zcash/contrib/qos/tc.sh b/depend/zcash/contrib/qos/tc.sh
new file mode 100644
index 000000000..2376013b5
--- /dev/null
+++ b/depend/zcash/contrib/qos/tc.sh
@@ -0,0 +1,48 @@
+#!/usr/bin/env bash
+#
+# Copyright (c) 2017 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+export LC_ALL=C
+#network interface on which to limit traffic
+IF="eth0"
+#limit of the network interface in question
+LINKCEIL="1gbit"
+#limit outbound Bitcoin protocol traffic to this rate
+LIMIT="160kbit"
+#defines the address space for which you wish to disable rate limiting
+LOCALNET="192.168.0.0/16"
+
+#delete existing rules
+tc qdisc del dev ${IF} root
+
+#add root class
+tc qdisc add dev ${IF} root handle 1: htb default 10
+
+#add parent class
+tc class add dev ${IF} parent 1: classid 1:1 htb rate ${LINKCEIL} ceil ${LINKCEIL}
+
+#add our two classes. one unlimited, another limited
+tc class add dev ${IF} parent 1:1 classid 1:10 htb rate ${LINKCEIL} ceil ${LINKCEIL} prio 0
+tc class add dev ${IF} parent 1:1 classid 1:11 htb rate ${LIMIT} ceil ${LIMIT} prio 1
+
+#add handles to our classes so packets marked with <x> go into the class with "... handle <x> fw ..."
+tc filter add dev ${IF} parent 1: protocol ip prio 1 handle 1 fw classid 1:10
+tc filter add dev ${IF} parent 1: protocol ip prio 2 handle 2 fw classid 1:11
+
+#delete any existing rules
+#disable for now
+#ret=0
+#while [ $ret -eq 0 ]; do
+#	iptables -t mangle -D OUTPUT 1
+#	ret=$?
+#done
+
+#limit outgoing traffic to and from port 8233. but not when dealing with a host on the local network
+#	(defined by $LOCALNET)
+#	--set-mark marks packages matching these criteria with the number "2"
+#	these packages are filtered by the tc filter with "handle 2"
+#	this filter sends the packages into the 1:11 class, and this class is limited to ${LIMIT}
+iptables -t mangle -A OUTPUT -p tcp -m tcp --dport 8233 ! -d ${LOCALNET} -j MARK --set-mark 0x2
+iptables -t mangle -A OUTPUT -p tcp -m tcp --sport 8233 ! -d ${LOCALNET} -j MARK --set-mark 0x2
diff --git a/depend/zcash/contrib/seeds/README.md b/depend/zcash/contrib/seeds/README.md
new file mode 100644
index 000000000..0a9d59d88
--- /dev/null
+++ b/depend/zcash/contrib/seeds/README.md
@@ -0,0 +1,4 @@
+### Seeds ###
+
+Utility to generate the seeds.txt list that is compiled into the client
+(see [src/chainparamsseeds.h](/src/chainparamsseeds.h) and other utilities in [contrib/seeds](/contrib/seeds)).
\ No newline at end of file
diff --git a/depend/zcash/contrib/seeds/generate-seeds.py b/depend/zcash/contrib/seeds/generate-seeds.py
new file mode 100755
index 000000000..5c9bd5475
--- /dev/null
+++ b/depend/zcash/contrib/seeds/generate-seeds.py
@@ -0,0 +1,138 @@
+#!/usr/bin/env python
+# Copyright (c) 2014 Wladimir J. van der Laan
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+'''
+Script to generate list of seed nodes for chainparams.cpp.
+
+This script expects two text files in the directory that is passed as an
+argument:
+
+    nodes_main.txt
+    nodes_test.txt
+
+These files must consist of lines in the format 
+
+    <ip>
+    <ip>:<port>
+    [<ipv6>]
+    [<ipv6>]:<port>
+    <onion>.onion
+    0xDDBBCCAA (IPv4 little-endian old pnSeeds format)
+
+The output will be two data structures with the peers in binary format:
+
+   static SeedSpec6 pnSeed6_main[]={
+   ...
+   }
+   static SeedSpec6 pnSeed6_test[]={
+   ...
+   }
+
+These should be pasted into `src/chainparamsseeds.h`.
+'''
+from __future__ import print_function, division
+from base64 import b32decode
+from binascii import a2b_hex
+import sys, os
+import re
+
+# ipv4 in ipv6 prefix
+pchIPv4 = bytearray([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0xff, 0xff])
+# tor-specific ipv6 prefix
+pchOnionCat = bytearray([0xFD,0x87,0xD8,0x7E,0xEB,0x43])
+
+def name_to_ipv6(addr):
+    if len(addr)>6 and addr.endswith('.onion'):
+        vchAddr = b32decode(addr[0:-6], True)
+        if len(vchAddr) != 16-len(pchOnionCat):
+            raise ValueError('Invalid onion %s' % s)
+        return pchOnionCat + vchAddr
+    elif '.' in addr: # IPv4
+        return pchIPv4 + bytearray((int(x) for x in addr.split('.')))
+    elif ':' in addr: # IPv6
+        sub = [[], []] # prefix, suffix
+        x = 0
+        addr = addr.split(':')
+        for i,comp in enumerate(addr):
+            if comp == '':
+                if i == 0 or i == (len(addr)-1): # skip empty component at beginning or end
+                    continue
+                x += 1 # :: skips to suffix
+                assert(x < 2)
+            else: # two bytes per component
+                val = int(comp, 16)
+                sub[x].append(val >> 8)
+                sub[x].append(val & 0xff)
+        nullbytes = 16 - len(sub[0]) - len(sub[1])
+        assert((x == 0 and nullbytes == 0) or (x == 1 and nullbytes > 0))
+        return bytearray(sub[0] + ([0] * nullbytes) + sub[1])
+    elif addr.startswith('0x'): # IPv4-in-little-endian
+        return pchIPv4 + bytearray(reversed(a2b_hex(addr[2:])))
+    else:
+        raise ValueError('Could not parse address %s' % addr)
+
+def parse_spec(s, defaultport):
+    match = re.match('\[([0-9a-fA-F:]+)\](?::([0-9]+))?$', s)
+    if match: # ipv6
+        host = match.group(1)
+        port = match.group(2)
+    elif s.count(':') > 1: # ipv6, no port
+        host = s
+        port = ''
+    else:
+        (host,_,port) = s.partition(':')
+
+    if not port:
+        port = defaultport
+    else:
+        port = int(port)
+
+    host = name_to_ipv6(host)
+
+    return (host,port)
+
+def process_nodes(g, f, structname, defaultport):
+    g.write('static SeedSpec6 %s[] = {\n' % structname)
+    first = True
+    for line in f:
+        comment = line.find('#')
+        if comment != -1:
+            line = line[0:comment]
+        line = line.strip()
+        if not line:
+            continue
+        if not first:
+            g.write(',\n')
+        first = False
+
+        (host,port) = parse_spec(line, defaultport)
+        hoststr = ','.join(('0x%02x' % b) for b in host)
+        g.write('    {{%s}, %i}' % (hoststr, port))
+    g.write('\n};\n')
+
+def main():
+    if len(sys.argv)<2:
+        print(('Usage: %s <path_to_nodes_txt>' % sys.argv[0]), file=sys.stderr)
+        exit(1)
+    g = sys.stdout
+    indir = sys.argv[1]
+    g.write('#ifndef BITCOIN_CHAINPARAMSSEEDS_H\n')
+    g.write('#define BITCOIN_CHAINPARAMSSEEDS_H\n')
+    g.write('/**\n')
+    g.write(' * List of fixed seed nodes for the bitcoin network\n')
+    g.write(' * AUTOGENERATED by contrib/seeds/generate-seeds.py\n')
+    g.write(' *\n')
+    g.write(' * Each line contains a 16-byte IPv6 address and a port.\n')
+    g.write(' * IPv4 as well as onion addresses are wrapped inside a IPv6 address accordingly.\n')
+    g.write(' */\n')
+    with open(os.path.join(indir,'nodes_main.txt'),'r', encoding="utf8") as f:
+        process_nodes(g, f, 'pnSeed6_main', 8233)
+    g.write('\n')
+    with open(os.path.join(indir,'nodes_test.txt'),'r', encoding="utf8") as f:
+        process_nodes(g, f, 'pnSeed6_test', 18233)
+    g.write('#endif // BITCOIN_CHAINPARAMSSEEDS_H\n')
+            
+if __name__ == '__main__':
+    main()
+
diff --git a/depend/zcash/contrib/seeds/makeseeds.py b/depend/zcash/contrib/seeds/makeseeds.py
new file mode 100755
index 000000000..041f83e2b
--- /dev/null
+++ b/depend/zcash/contrib/seeds/makeseeds.py
@@ -0,0 +1,169 @@
+#!/usr/bin/env python
+#
+# Generate seeds.txt from Pieter's DNS seeder
+#
+
+NSEEDS=512
+
+MAX_SEEDS_PER_ASN=2
+
+MIN_BLOCKS = 337600
+
+# These are hosts that have been observed to be behaving strangely (e.g.
+# aggressively connecting to every node).
+SUSPICIOUS_HOSTS = set([
+    "130.211.129.106", "178.63.107.226",
+    "83.81.130.26", "88.198.17.7", "148.251.238.178", "176.9.46.6",
+    "54.173.72.127", "54.174.10.182", "54.183.64.54", "54.194.231.211",
+    "54.66.214.167", "54.66.220.137", "54.67.33.14", "54.77.251.214",
+    "54.94.195.96", "54.94.200.247"
+])
+
+import re
+import sys
+import dns.resolver
+import collections
+
+PATTERN_IPV4 = re.compile(r"^((\d{1,3})\.(\d{1,3})\.(\d{1,3})\.(\d{1,3})):(\d+)$")
+PATTERN_IPV6 = re.compile(r"^\[([0-9a-z:]+)\]:(\d+)$")
+PATTERN_ONION = re.compile(r"^([abcdefghijklmnopqrstuvwxyz234567]{16}\.onion):(\d+)$")
+PATTERN_AGENT = re.compile(r"^(\/MagicBean:([0-9a-z-.]+)\/)$")
+
+def parseline(line):
+    sline = line.split()
+    if len(sline) < 11:
+       return None
+    m = PATTERN_IPV4.match(sline[0])
+    sortkey = None
+    ip = None
+    if m is None:
+        m = PATTERN_IPV6.match(sline[0])
+        if m is None:
+            m = PATTERN_ONION.match(sline[0])
+            if m is None:
+                return None
+            else:
+                net = 'onion'
+                ipstr = sortkey = m.group(1)
+                port = int(m.group(2))
+        else:
+            net = 'ipv6'
+            if m.group(1) in ['::']: # Not interested in localhost
+                return None
+            ipstr = m.group(1)
+            sortkey = ipstr # XXX parse IPv6 into number, could use name_to_ipv6 from generate-seeds
+            port = int(m.group(2))
+    else:
+        # Do IPv4 sanity check
+        ip = 0
+        for i in range(0,4):
+            if int(m.group(i+2)) < 0 or int(m.group(i+2)) > 255:
+                return None
+            ip = ip + (int(m.group(i+2)) << (8*(3-i)))
+        if ip == 0:
+            return None
+        net = 'ipv4'
+        sortkey = ip
+        ipstr = m.group(1)
+        port = int(m.group(6))
+    # Skip bad results.
+    if sline[1] == 0:
+        return None
+    # Extract uptime %.
+    uptime30 = float(sline[7][:-1])
+    # Extract Unix timestamp of last success.
+    lastsuccess = int(sline[2])
+    # Extract protocol version.
+    version = int(sline[10])
+    # Extract user agent.
+    agent = sline[11][1:-1]
+    # Extract service flags.
+    service = int(sline[9], 16)
+    # Extract blocks.
+    blocks = int(sline[8])
+    # Construct result.
+    return {
+        'net': net,
+        'ip': ipstr,
+        'port': port,
+        'ipnum': ip,
+        'uptime': uptime30,
+        'lastsuccess': lastsuccess,
+        'version': version,
+        'agent': agent,
+        'service': service,
+        'blocks': blocks,
+        'sortkey': sortkey,
+    }
+
+def filtermultiport(ips):
+    '''Filter out hosts with more nodes per IP'''
+    hist = collections.defaultdict(list)
+    for ip in ips:
+        hist[ip['sortkey']].append(ip)
+    return [value[0] for (key,value) in hist.items() if len(value)==1]
+
+# Based on Greg Maxwell's seed_filter.py
+def filterbyasn(ips, max_per_asn, max_total):
+    # Sift out ips by type
+    ips_ipv4 = [ip for ip in ips if ip['net'] == 'ipv4']
+    ips_ipv6 = [ip for ip in ips if ip['net'] == 'ipv6']
+    ips_onion = [ip for ip in ips if ip['net'] == 'onion']
+
+    # Filter IPv4 by ASN
+    result = []
+    asn_count = {}
+    for ip in ips_ipv4:
+        if len(result) == max_total:
+            break
+        try:
+            asn = int([x.to_text() for x in dns.resolver.query('.'.join(reversed(ip['ip'].split('.'))) + '.origin.asn.cymru.com', 'TXT').response.answer][0].split('\"')[1].split(' ')[0])
+            if asn not in asn_count:
+                asn_count[asn] = 0
+            if asn_count[asn] == max_per_asn:
+                continue
+            asn_count[asn] += 1
+            result.append(ip)
+        except:
+            sys.stderr.write('ERR: Could not resolve ASN for "' + ip['ip'] + '"\n')
+
+    # TODO: filter IPv6 by ASN
+
+    # Add back non-IPv4
+    result.extend(ips_ipv6)
+    result.extend(ips_onion)
+    return result
+
+def main():
+    lines = sys.stdin.readlines()
+    ips = [parseline(line) for line in lines]
+
+    # Skip entries with valid address.
+    ips = [ip for ip in ips if ip is not None]
+    # Skip entries from suspicious hosts.
+    ips = [ip for ip in ips if ip['ip'] not in SUSPICIOUS_HOSTS]
+    # Enforce minimal number of blocks.
+    ips = [ip for ip in ips if ip['blocks'] >= MIN_BLOCKS]
+    # Require service bit 1.
+    ips = [ip for ip in ips if (ip['service'] & 1) == 1]
+    # Require at least 50% 30-day uptime.
+    ips = [ip for ip in ips if ip['uptime'] > 50]
+    # Require a known and recent user agent.
+    ips = [ip for ip in ips if PATTERN_AGENT.match(ip['agent'])]
+    # Sort by availability (and use last success as tie breaker)
+    ips.sort(key=lambda x: (x['uptime'], x['lastsuccess'], x['ip']), reverse=True)
+    # Filter out hosts with multiple bitcoin ports, these are likely abusive
+    ips = filtermultiport(ips)
+    # Look up ASNs and limit results, both per ASN and globally.
+    ips = filterbyasn(ips, MAX_SEEDS_PER_ASN, NSEEDS)
+    # Sort the results by IP address (for deterministic output).
+    ips.sort(key=lambda x: (x['net'], x['sortkey']))
+
+    for ip in ips:
+        if ip['net'] == 'ipv6':
+            print '[%s]:%i' % (ip['ip'], ip['port'])
+        else:
+            print '%s:%i' % (ip['ip'], ip['port'])
+
+if __name__ == '__main__':
+    main()
diff --git a/depend/zcash/contrib/simulations/worstcase.py b/depend/zcash/contrib/simulations/worstcase.py
new file mode 100755
index 000000000..3018cd053
--- /dev/null
+++ b/depend/zcash/contrib/simulations/worstcase.py
@@ -0,0 +1,246 @@
+#!/usr/bin/env python3
+import csv
+import os
+import subprocess
+
+#
+# Constants
+#
+
+MAX_BLOCK_SIZE = 2000000
+
+#
+# Verification times
+#
+
+def collect_times():
+    # Find bench_bitcoin binary
+    script_dir = os.path.dirname(os.path.realpath(__file__))
+    base_dir = os.path.dirname(os.path.dirname(script_dir))
+    bench_bitcoin = os.path.join(base_dir, 'src', 'bench', 'bench_bitcoin')
+
+    # Run bench_bitcoin binary
+    try:
+        result = subprocess.run([bench_bitcoin], stdout=subprocess.PIPE, universal_newlines=True)
+        result.check_returncode()
+        result = result.stdout
+    except AttributeError:
+        # Use the older API
+        result = subprocess.check_output([bench_bitcoin], universal_newlines=True)
+
+    # Collect benchmarks
+    benchmarks = {}
+    for row in result.strip().split('\n')[1:]: # Skip the headings
+        parts = row.split(',')
+        benchmarks[parts[0]] = int(parts[2])
+
+    return {
+        'proof': benchmarks['SaplingOutput'],
+        'ecdsa': benchmarks['ECDSA'],
+        'redjubjub': benchmarks['SaplingSpend'] - benchmarks['SaplingOutput'],
+        'ed25519': benchmarks['JoinSplitSig'],
+    }
+
+#
+# Size calculations
+#
+
+def compact_size_size(nSize):
+    if nSize < 253:
+        return 1
+    elif nSize <= 0xFFFF:
+        return 3
+    elif nSize <= 0xFFFFFFFF:
+        return 5
+    else:
+        return 9
+
+def script_size(script):
+    return (
+        compact_size_size(len(script)) +
+        len(script)
+    )
+
+def tx_in_size(scriptSig):
+    return (
+        32 + # prevout.hash
+        4  + # prevout.n
+        script_size(scriptSig) +
+        4    # nSequence
+    )
+
+def tx_out_size(scriptPubKey):
+    return (
+        8 + # nValue
+        script_size(scriptPubKey)
+    )
+
+def v4_tx_size(vin, vout, nShieldedSpend, nShieldedOutput, nJoinSplit):
+    return (
+        4 + # header
+        4 + # nVersionGroupId
+        compact_size_size(len(vin)) +
+        sum([tx_in_size(scriptSig) for scriptSig in vin]) +
+        compact_size_size(len(vout)) +
+        sum([tx_out_size(scriptPubKey) for scriptPubKey in vout]) +
+        4 + # lock_time
+        4 + # nExpiryHeight
+        4 + # valueBalance
+        compact_size_size(nShieldedSpend) +
+        (384 * nShieldedSpend) +
+        compact_size_size(nShieldedOutput) +
+        (948 * nShieldedOutput) +
+        compact_size_size(nJoinSplit) +
+        (1698 * nJoinSplit) +
+        ((32 + 64) if nJoinSplit > 0 else 0) + # joinSplitPubKey + joinSplitSig
+        (64 if (nShieldedSpend + nShieldedOutput) > 0 else 0) # bindingSig
+    )
+
+def block_size(vtx):
+    return (
+        4  + # nVersion
+        32 + # hashPrevBlock
+        32 + # hashMerkleRoot
+        32 + # hashFinalSaplingRoot
+        4  + # nTime
+        4  + # nBits
+        32 + # nNonce
+        compact_size_size(1344) + # solutionSize
+        1344 + # solution
+        compact_size_size(len(vtx)) +
+        sum([v4_tx_size(**tx) for tx in vtx])
+    )
+
+#
+# Runners
+#
+
+def worst_case_many_identical_txs(tx):
+    vtx = []
+    while True:
+        vtx.append(tx)
+        if block_size(vtx) > MAX_BLOCK_SIZE:
+            # Keep under the size limit
+            vtx.pop()
+            break
+    return vtx
+
+def worst_case_one_tx_containing(item):
+    vtx = [{
+        'vin': [],
+        'vout': [],
+        'nShieldedSpend': 0,
+        'nShieldedOutput': 0,
+        'nJoinSplit': 0,
+    }]
+    while True:
+        vtx[0][item] += 1
+        if block_size(vtx) > MAX_BLOCK_SIZE:
+            # Keep under the size limit
+            vtx[0][item] -= 1
+            break
+    return vtx
+
+def print_makeup(vtx, times):
+    # One proof per Sapling spend, Sapling output, and JoinSplit
+    proofs = sum([tx['nShieldedSpend'] + tx['nShieldedOutput'] + tx['nJoinSplit'] for tx in vtx])
+
+    # One ECDSA signature per transparent input
+    ecdsa_sigs = sum([len(tx['vin']) for tx in vtx])
+
+    # One RedJubjub signature per Sapling spend (spendAuthSig) and per transaction (bindingSig)
+    redjubjub_sigs = sum([tx['nShieldedSpend'] + (
+        1 if tx['nShieldedSpend'] + tx['nShieldedOutput'] > 0 else 0) for tx in vtx])
+
+    # One Ed25519 signature per transaction that contains JoinSplits
+    ed25519_sigs = sum([1 if tx['nJoinSplit'] > 0 else 0 for tx in vtx])
+
+    print('- Block size:          ', block_size(vtx), 'bytes')
+    print('- Transactions:        ', len(vtx))
+    print('- Proofs:              ', proofs)
+    print('- ECDSA signatures:    ', ecdsa_sigs)
+    print('- RedJubjub signatures:', redjubjub_sigs)
+    print('- Ed25519 signatures:  ', ed25519_sigs)
+    print('- Verification time:    %0.2f seconds' % (float(
+        (times['proof'] * proofs) +
+        (times['ecdsa'] * ecdsa_sigs) +
+        (times['redjubjub'] * redjubjub_sigs) +
+        (times['ed25519'] * ed25519_sigs)
+    ) / 10**9))
+
+#
+# Worst-case scenarios
+#
+
+def worst_case_one_sapling_spend_per_tx(times):
+    vtx = worst_case_many_identical_txs({
+        'vin': [],
+        'vout': [],
+        'nShieldedSpend': 1,
+        'nShieldedOutput': 0,
+        'nJoinSplit': 0,
+    })
+    print('One Sapling spend per transaction:')
+    print_makeup(vtx, times)
+    print()
+
+def worst_case_one_tx_containing_sapling_spends(times):
+    vtx = worst_case_one_tx_containing('nShieldedSpend')
+    print('One transaction containing Sapling spends:')
+    print_makeup(vtx, times)
+    print()
+
+def worst_case_one_sapling_output_per_tx(times):
+    vtx = worst_case_many_identical_txs({
+        'vin': [],
+        'vout': [],
+        'nShieldedSpend': 0,
+        'nShieldedOutput': 1,
+        'nJoinSplit': 0,
+    })
+    print('One Sapling output per transaction:')
+    print_makeup(vtx, times)
+    print()
+
+def worst_case_one_tx_containing_sapling_outputs(times):
+    vtx = worst_case_one_tx_containing('nShieldedOutput')
+    print('One transaction containing Sapling outputs:')
+    print_makeup(vtx, times)
+    print()
+
+def worst_case_one_joinsplit_per_tx(times):
+    vtx = worst_case_many_identical_txs({
+        'vin': [],
+        'vout': [],
+        'nShieldedSpend': 0,
+        'nShieldedOutput': 0,
+        'nJoinSplit': 1,
+    })
+    print('One JoinSplit per transaction:')
+    print_makeup(vtx, times)
+    print()
+
+def worst_case_one_tx_containing_joinsplits(times):
+    vtx = worst_case_one_tx_containing('nJoinSplit')
+    print('One transaction containing JoinSplits:')
+    print_makeup(vtx, times)
+    print()
+
+
+def run():
+    print('Collecting benchmarks...')
+    times = collect_times()
+    # times = hard_coded_times()
+    print('Times (ns):', times)
+    print()
+
+    print('Running worst-case simulations...')
+    worst_case_one_sapling_spend_per_tx(times)
+    worst_case_one_tx_containing_sapling_spends(times)
+    worst_case_one_sapling_output_per_tx(times)
+    worst_case_one_tx_containing_sapling_outputs(times)
+    worst_case_one_joinsplit_per_tx(times)
+    worst_case_one_tx_containing_joinsplits(times)
+
+if __name__ == '__main__':
+    run()
diff --git a/depend/zcash/contrib/testgen/README.md b/depend/zcash/contrib/testgen/README.md
new file mode 100644
index 000000000..83624f443
--- /dev/null
+++ b/depend/zcash/contrib/testgen/README.md
@@ -0,0 +1,8 @@
+### TestGen ###
+
+Utilities to generate test vectors for the data-driven Bitcoin tests.
+
+Usage: 
+
+    gen_base58_test_vectors.py valid 50 > ../../src/test/data/base58_keys_valid.json
+    gen_base58_test_vectors.py invalid 50 > ../../src/test/data/base58_keys_invalid.json
\ No newline at end of file
diff --git a/depend/zcash/contrib/testgen/base58.py b/depend/zcash/contrib/testgen/base58.py
new file mode 100644
index 000000000..b71649514
--- /dev/null
+++ b/depend/zcash/contrib/testgen/base58.py
@@ -0,0 +1,104 @@
+'''
+Bitcoin base58 encoding and decoding.
+
+Based on https://bitcointalk.org/index.php?topic=1026.0 (public domain)
+'''
+import hashlib
+
+# for compatibility with following code...
+class SHA256:
+    new = hashlib.sha256
+
+if str != bytes:
+    # Python 3.x
+    def ord(c):
+        return c
+    def chr(n):
+        return bytes( (n,) )
+
+__b58chars = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz'
+__b58base = len(__b58chars)
+b58chars = __b58chars
+
+def b58encode(v):
+    """ encode v, which is a string of bytes, to base58.
+    """
+    long_value = 0
+    for (i, c) in enumerate(v[::-1]):
+        long_value += (256**i) * ord(c)
+
+    result = ''
+    while long_value >= __b58base:
+        div, mod = divmod(long_value, __b58base)
+        result = __b58chars[mod] + result
+        long_value = div
+    result = __b58chars[long_value] + result
+
+    # Bitcoin does a little leading-zero-compression:
+    # leading 0-bytes in the input become leading-1s
+    nPad = 0
+    for c in v:
+        if c == '\0': nPad += 1
+        else: break
+
+    return (__b58chars[0]*nPad) + result
+
+def b58decode(v, length = None):
+    """ decode v into a string of len bytes
+    """
+    long_value = 0
+    for (i, c) in enumerate(v[::-1]):
+        long_value += __b58chars.find(c) * (__b58base**i)
+
+    result = bytes()
+    while long_value >= 256:
+        div, mod = divmod(long_value, 256)
+        result = chr(mod) + result
+        long_value = div
+    result = chr(long_value) + result
+
+    nPad = 0
+    for c in v:
+        if c == __b58chars[0]: nPad += 1
+        else: break
+
+    result = chr(0)*nPad + result
+    if length is not None and len(result) != length:
+        return None
+
+    return result
+
+def checksum(v):
+    """Return 32-bit checksum based on SHA256"""
+    return SHA256.new(SHA256.new(v).digest()).digest()[0:4]
+
+def b58encode_chk(v):
+    """b58encode a string, with 32-bit checksum"""
+    return b58encode(v + checksum(v))
+
+def b58decode_chk(v):
+    """decode a base58 string, check and remove checksum"""
+    result = b58decode(v)
+    if result is None:
+        return None
+    h3 = checksum(result[:-4])
+    if result[-4:] == checksum(result[:-4]):
+        return result[:-4]
+    else:
+        return None
+
+def get_bcaddress_version(strAddress):
+    """ Returns None if strAddress is invalid.  Otherwise returns integer version of address. """
+    addr = b58decode_chk(strAddress)
+    if addr is None or len(addr)!=21: return None
+    version = addr[0]
+    return ord(version)
+
+if __name__ == '__main__':
+    # Test case (from http://gitorious.org/bitcoin/python-base58.git)
+    assert get_bcaddress_version('15VjRaDX9zpbA8LVnbrCAFzrVzN7ixHNsC') is 0
+    _ohai = 'o hai'.encode('ascii')
+    _tmp = b58encode(_ohai)
+    assert _tmp == 'DYB3oMS'
+    assert b58decode(_tmp, 5) == _ohai
+    print("Tests passed")
diff --git a/depend/zcash/contrib/testgen/gen_base58_test_vectors.py b/depend/zcash/contrib/testgen/gen_base58_test_vectors.py
new file mode 100755
index 000000000..17b85667a
--- /dev/null
+++ b/depend/zcash/contrib/testgen/gen_base58_test_vectors.py
@@ -0,0 +1,126 @@
+#!/usr/bin/env python
+'''
+Generate valid and invalid base58 address and private key test vectors.
+
+Usage: 
+    gen_base58_test_vectors.py valid 50 > ../../src/test/data/base58_keys_valid.json
+    gen_base58_test_vectors.py invalid 50 > ../../src/test/data/base58_keys_invalid.json
+'''
+# 2012 Wladimir J. van der Laan
+# Released under MIT License
+import os
+from itertools import islice
+from base58 import b58encode, b58decode, b58encode_chk, b58decode_chk, b58chars
+import random
+from binascii import b2a_hex
+
+# key types
+PUBKEY_ADDRESS = (0x1C, 0xB8)
+SCRIPT_ADDRESS = (0x1C, 0xBD)
+PUBKEY_ADDRESS_TEST = (0x1D, 0x25)
+SCRIPT_ADDRESS_TEST = (0x1C, 0xBA)
+PRIVKEY = 128
+PRIVKEY_TEST = 239
+
+metadata_keys = ['isPrivkey', 'isTestnet', 'addrType', 'isCompressed']
+# templates for valid sequences
+templates = [
+  # prefix, payload_size, suffix, metadata
+  #                                  None = N/A
+  (PUBKEY_ADDRESS,         20, (),   (False, False, 'pubkey', None)),
+  (SCRIPT_ADDRESS,         20, (),   (False, False, 'script',  None)),
+  (PUBKEY_ADDRESS_TEST,    20, (),   (False, True,  'pubkey', None)),
+  (SCRIPT_ADDRESS_TEST,    20, (),   (False, True,  'script',  None)),
+  ((PRIVKEY,),             32, (),   (True,  False, None,  False)),
+  ((PRIVKEY,),             32, (1,), (True,  False, None,  True)),
+  ((PRIVKEY_TEST,),        32, (),   (True,  True,  None,  False)),
+  ((PRIVKEY_TEST,),        32, (1,), (True,  True,  None,  True))
+]
+
+def is_valid(v):
+    '''Check vector v for validity'''
+    result = b58decode_chk(v)
+    if result is None:
+        return False
+    valid = False
+    for template in templates:
+        prefix = str(bytearray(template[0]))
+        suffix = str(bytearray(template[2]))
+        if result.startswith(prefix) and result.endswith(suffix):
+            if (len(result) - len(prefix) - len(suffix)) == template[1]:
+                return True
+    return False
+
+def gen_valid_vectors():
+    '''Generate valid test vectors'''
+    while True:
+        for template in templates:
+            prefix = str(bytearray(template[0]))
+            payload = os.urandom(template[1]) 
+            suffix = str(bytearray(template[2]))
+            rv = b58encode_chk(prefix + payload + suffix)
+            assert is_valid(rv)
+            metadata = dict([(x,y) for (x,y) in zip(metadata_keys,template[3]) if y is not None])
+            yield (rv, b2a_hex(payload), metadata)
+
+def gen_invalid_vector(template, corrupt_prefix, randomize_payload_size, corrupt_suffix):
+    '''Generate possibly invalid vector'''
+    if corrupt_prefix:
+        prefix = os.urandom(1)
+    else:
+        prefix = str(bytearray(template[0]))
+    
+    if randomize_payload_size:
+        payload = os.urandom(max(int(random.expovariate(0.5)), 50))
+    else:
+        payload = os.urandom(template[1])
+    
+    if corrupt_suffix:
+        suffix = os.urandom(len(template[2]))
+    else:
+        suffix = str(bytearray(template[2]))
+
+    return b58encode_chk(prefix + payload + suffix)
+
+def randbool(p = 0.5):
+    '''Return True with P(p)'''
+    return random.random() < p
+
+def gen_invalid_vectors():
+    '''Generate invalid test vectors'''
+    # start with some manual edge-cases
+    yield "",
+    yield "x",
+    while True:
+        # kinds of invalid vectors:
+        #   invalid prefix
+        #   invalid payload length
+        #   invalid (randomized) suffix (add random data)
+        #   corrupt checksum
+        for template in templates:
+            val = gen_invalid_vector(template, randbool(0.2), randbool(0.2), randbool(0.2))
+            if random.randint(0,10)<1: # line corruption
+                if randbool(): # add random character to end
+                    val += random.choice(b58chars)
+                else: # replace random character in the middle
+                    n = random.randint(0, len(val))
+                    val = val[0:n] + random.choice(b58chars) + val[n+1:]
+            if not is_valid(val):
+                yield val,
+
+if __name__ == '__main__':
+    import sys, json
+    iters = {'valid':gen_valid_vectors, 'invalid':gen_invalid_vectors}
+    try:
+        uiter = iters[sys.argv[1]]
+    except IndexError:
+        uiter = gen_valid_vectors
+    try:
+        count = int(sys.argv[2])
+    except IndexError:
+        count = 0
+   
+    data = list(islice(uiter(), count))
+    json.dump(data, sys.stdout, sort_keys=True, indent=4)
+    sys.stdout.write('\n')
+
diff --git a/depend/zcash/contrib/tidy_datadir.sh b/depend/zcash/contrib/tidy_datadir.sh
new file mode 100755
index 000000000..7861e6e6e
--- /dev/null
+++ b/depend/zcash/contrib/tidy_datadir.sh
@@ -0,0 +1,62 @@
+#!/bin/bash
+# Copyright (c) 2013 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+if [ -d "$1" ]; then
+  cd "$1" || exit 1
+else
+  echo "Usage: $0 <datadir>" >&2
+  echo "Removes obsolete Bitcoin database files" >&2
+  exit 1
+fi
+
+LEVEL=0
+if [ -f wallet.dat -a -f addr.dat -a -f blkindex.dat -a -f blk0001.dat ]; then LEVEL=1; fi
+if [ -f wallet.dat -a -f peers.dat -a -f blkindex.dat -a -f blk0001.dat ]; then LEVEL=2; fi
+if [ -f wallet.dat -a -f peers.dat -a -f coins/CURRENT -a -f blktree/CURRENT -a -f blocks/blk00000.dat ]; then LEVEL=3; fi
+if [ -f wallet.dat -a -f peers.dat -a -f chainstate/CURRENT -a -f blocks/index/CURRENT -a -f blocks/blk00000.dat ]; then LEVEL=4; fi
+
+case $LEVEL in
+  0)
+    echo "Error: no Bitcoin datadir detected."
+    exit 1
+    ;;
+  1)
+    echo "Detected old Bitcoin datadir (before 0.7)."
+    echo "Nothing to do."
+    exit 0
+    ;;
+  2)
+    echo "Detected Bitcoin 0.7 datadir."
+    ;;
+  3)
+    echo "Detected Bitcoin pre-0.8 datadir."
+    ;;
+  4)
+    echo "Detected Bitcoin 0.8 datadir."
+    ;;
+esac
+
+FILES=""
+DIRS=""
+
+if [ $LEVEL -ge 3 ]; then FILES=$(echo $FILES blk????.dat blkindex.dat); fi
+if [ $LEVEL -ge 2 ]; then FILES=$(echo $FILES addr.dat); fi
+if [ $LEVEL -ge 4 ]; then DIRS=$(echo $DIRS coins blktree); fi
+
+for FILE in $FILES; do
+  if [ -f $FILE ]; then
+    echo "Deleting: $FILE"
+    rm -f $FILE
+  fi
+done
+
+for DIR in $DIRS; do
+  if [ -d $DIR ]; then
+    echo "Deleting: $DIR/"
+    rm -rf $DIR
+  fi
+done
+
+echo "Done."
diff --git a/depend/zcash/contrib/zcash-cli.bash-completion b/depend/zcash/contrib/zcash-cli.bash-completion
new file mode 100644
index 000000000..264ba86f4
--- /dev/null
+++ b/depend/zcash/contrib/zcash-cli.bash-completion
@@ -0,0 +1,161 @@
+# bash programmable completion for zcash-cli(1)
+# Copyright (c) 2012-2016 The Bitcoin Core developers
+# Copyright (c) 2016-2019 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+# call $zcash-cli for RPC
+_zcash_rpc() {
+    # determine already specified args necessary for RPC
+    local rpcargs=()
+    for i in ${COMP_LINE}; do
+        case "$i" in
+            -conf=*|-datadir=*|-regtest|-rpc*|-testnet)
+                rpcargs=( "${rpcargs[@]}" "$i" )
+                ;;
+        esac
+    done
+    $zcash_cli "${rpcargs[@]}" "$@"
+}
+
+# Add wallet accounts to COMPREPLY
+_zcash_accounts() {
+    local accounts
+    # Accounts are deprecated in Zcash
+    #accounts=$(_zcash_rpc listaccounts | awk -F '"' '{ print $2 }')
+    accounts="\\\"\\\""
+    COMPREPLY=( "${COMPREPLY[@]}" $( compgen -W "$accounts" -- "$cur" ) )
+}
+
+_zcash_cli() {
+    local cur prev words=() cword
+    local zcash_cli
+
+    # save and use original argument to invoke zcash-cli for -help, help and RPC
+    # as zcash-cli might not be in $PATH
+    zcash_cli="$1"
+
+    COMPREPLY=()
+    _get_comp_words_by_ref -n = cur prev words cword
+
+    if ((cword > 5)); then
+        case ${words[cword-5]} in
+            sendtoaddress)
+                COMPREPLY=( $( compgen -W "true false" -- "$cur" ) )
+                return 0
+                ;;
+        esac
+    fi
+
+    if ((cword > 4)); then
+        case ${words[cword-4]} in
+            importaddress|listtransactions|setban)
+                COMPREPLY=( $( compgen -W "true false" -- "$cur" ) )
+                return 0
+                ;;
+            signrawtransaction)
+                COMPREPLY=( $( compgen -W "ALL NONE SINGLE ALL|ANYONECANPAY NONE|ANYONECANPAY SINGLE|ANYONECANPAY" -- "$cur" ) )
+                return 0
+                ;;
+        esac
+    fi
+
+    if ((cword > 3)); then
+        case ${words[cword-3]} in
+            addmultisigaddress)
+                _zcash_accounts
+                return 0
+                ;;
+            getbalance|gettxout|importaddress|importpubkey|importprivkey|listreceivedbyaccount|listreceivedbyaddress|listsinceblock)
+                COMPREPLY=( $( compgen -W "true false" -- "$cur" ) )
+                return 0
+                ;;
+        esac
+    fi
+
+    if ((cword > 2)); then
+        case ${words[cword-2]} in
+            addnode)
+                COMPREPLY=( $( compgen -W "add remove onetry" -- "$cur" ) )
+                return 0
+                ;;
+            setban)
+                COMPREPLY=( $( compgen -W "add remove" -- "$cur" ) )
+                return 0
+                ;;
+            fundrawtransaction|getblock|getblockheader|getmempoolancestors|getmempooldescendants|getrawtransaction|gettransaction|listaccounts|listreceivedbyaccount|listreceivedbyaddress|sendrawtransaction)
+                COMPREPLY=( $( compgen -W "true false" -- "$cur" ) )
+                return 0
+                ;;
+            z_importkey|z_importviewingkey)
+                COMPREPLY=( $( compgen -W "yes no whenkeyisnew" -- "$cur" ) )
+                return 0
+                ;;
+            move|setaccount)
+                _zcash_accounts
+                return 0
+                ;;
+        esac
+    fi
+
+    case "$prev" in
+        backupwallet|dumpwallet|importwallet|z_exportwallet|z_importwallet)
+            _filedir
+            return 0
+            ;;
+        getaddednodeinfo|getrawmempool|lockunspent|setgenerate)
+            COMPREPLY=( $( compgen -W "true false" -- "$cur" ) )
+            return 0
+            ;;
+        getaccountaddress|getaddressesbyaccount|getbalance|getnewaddress|getreceivedbyaccount|listtransactions|move|sendfrom|sendmany)
+            _zcash_accounts
+            return 0
+            ;;
+    esac
+
+    case "$cur" in
+        -conf=*)
+            cur="${cur#*=}"
+            _filedir
+            return 0
+            ;;
+        -datadir=*)
+            cur="${cur#*=}"
+            _filedir -d
+            return 0
+            ;;
+        -*=*)	# prevent nonsense completions
+            return 0
+            ;;
+        *)
+            local helpopts commands
+
+            # only parse -help if senseful
+            if [[ -z "$cur" || "$cur" =~ ^- ]]; then
+                helpopts=$($zcash_cli -help 2>&1 | awk '$1 ~ /^-/ { sub(/=.*/, "="); print $1 }' )
+            fi
+
+            # only parse help if senseful
+            if [[ -z "$cur" || "$cur" =~ ^[a-z] ]]; then
+                commands=$(_zcash_rpc help 2>/dev/null | awk '$1 ~ /^[a-z]/ { print $1; }')
+            fi
+
+            COMPREPLY=( $( compgen -W "$helpopts $commands" -- "$cur" ) )
+
+            # Prevent space if an argument is desired
+            if [[ $COMPREPLY == *= ]]; then
+                compopt -o nospace
+            fi
+            return 0
+            ;;
+    esac
+} &&
+complete -F _zcash_cli zcash-cli
+
+# Local variables:
+# mode: shell-script
+# sh-basic-offset: 4
+# sh-indent-comment: t
+# indent-tabs-mode: nil
+# End:
+# ex: ts=4 sw=4 et filetype=sh
diff --git a/depend/zcash/contrib/zcash-tx.bash-completion b/depend/zcash/contrib/zcash-tx.bash-completion
new file mode 100644
index 000000000..b6a0cf434
--- /dev/null
+++ b/depend/zcash/contrib/zcash-tx.bash-completion
@@ -0,0 +1,58 @@
+# bash programmable completion for zcash-tx(1)
+# Copyright (c) 2016 The Bitcoin Core developers
+# Copyright (c) 2016-2019 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+_zcash_tx() {
+    local cur prev words=() cword
+    local zcash_tx
+
+    # save and use original argument to invoke zcash-tx for -help
+    # it might not be in $PATH
+    zcash_tx="$1"
+
+    COMPREPLY=()
+    _get_comp_words_by_ref -n =: cur prev words cword
+
+    case "$cur" in
+        load=*:*)
+            cur="${cur#load=*:}"
+            _filedir
+            return 0
+            ;;
+        *=*)	# prevent attempts to complete other arguments
+            return 0
+            ;;
+    esac
+
+    if [[ "$cword" == 1 || ( "$prev" != "-create" && "$prev" == -* ) ]]; then
+        # only options (or an uncompletable hex-string) allowed
+        # parse zcash-tx -help for options
+        local helpopts
+        helpopts=$($zcash_tx -help | sed -e '/^  -/ p' -e d )
+        COMPREPLY=( $( compgen -W "$helpopts" -- "$cur" ) )
+    else
+        # only commands are allowed
+        # parse -help for commands
+        local helpcmds
+        helpcmds=$($zcash_tx -help | sed -e '1,/Commands:/d' -e 's/=.*/=/' -e '/^  [a-z]/ p' -e d )
+        COMPREPLY=( $( compgen -W "$helpcmds" -- "$cur" ) )
+    fi
+
+    # Prevent space if an argument is desired
+    if [[ $COMPREPLY == *= ]]; then
+        compopt -o nospace
+    fi
+
+    return 0
+} &&
+complete -F _zcash_tx zcash-tx
+
+# Local variables:
+# mode: shell-script
+# sh-basic-offset: 4
+# sh-indent-comment: t
+# indent-tabs-mode: nil
+# End:
+# ex: ts=4 sw=4 et filetype=sh
diff --git a/depend/zcash/contrib/zcashd.bash-completion b/depend/zcash/contrib/zcashd.bash-completion
new file mode 100644
index 000000000..d5135350a
--- /dev/null
+++ b/depend/zcash/contrib/zcashd.bash-completion
@@ -0,0 +1,57 @@
+# bash programmable completion for zcashd(1)
+# Copyright (c) 2012-2017 The Bitcoin Core developers
+# Copyright (c) 2016-2019 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+_zcashd() {
+    local cur prev words=() cword
+    local zcashd
+
+    # save and use original argument to invoke zcashd for -help
+    # it might not be in $PATH
+    zcashd="$1"
+
+    COMPREPLY=()
+    _get_comp_words_by_ref -n = cur prev words cword
+
+    case "$cur" in
+        -conf=*|-pid=*|-loadblock=*|-rpccookiefile=*|-wallet=*)
+            cur="${cur#*=}"
+            _filedir
+            return 0
+            ;;
+        -datadir=*|-exportdir=*)
+            cur="${cur#*=}"
+            _filedir -d
+            return 0
+            ;;
+        -*=*)	# prevent nonsense completions
+            return 0
+            ;;
+        *)
+
+            # only parse -help if senseful
+            if [[ -z "$cur" || "$cur" =~ ^- ]]; then
+                local helpopts
+                helpopts=$($zcashd -help 2>&1 | awk '$1 ~ /^-/ { sub(/=.*/, "="); print $1 }' )
+                COMPREPLY=( $( compgen -W "$helpopts" -- "$cur" ) )
+            fi
+
+            # Prevent space if an argument is desired
+            if [[ $COMPREPLY == *= ]]; then
+                compopt -o nospace
+            fi
+            return 0
+            ;;
+    esac
+} &&
+complete -F _zcashd zcashd
+
+# Local variables:
+# mode: shell-script
+# sh-basic-offset: 4
+# sh-indent-comment: t
+# indent-tabs-mode: nil
+# End:
+# ex: ts=4 sw=4 et filetype=sh
diff --git a/depend/zcash/contrib/zmq/zmq_sub.py b/depend/zcash/contrib/zmq/zmq_sub.py
new file mode 100755
index 000000000..6df3e0838
--- /dev/null
+++ b/depend/zcash/contrib/zmq/zmq_sub.py
@@ -0,0 +1,48 @@
+#!/usr/bin/env python2
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+import array
+import binascii
+import zmq
+import struct
+
+port = 28332
+
+zmqContext = zmq.Context()
+zmqSubSocket = zmqContext.socket(zmq.SUB)
+zmqSubSocket.setsockopt(zmq.SUBSCRIBE, "hashblock")
+zmqSubSocket.setsockopt(zmq.SUBSCRIBE, "hashtx")
+zmqSubSocket.setsockopt(zmq.SUBSCRIBE, "rawblock")
+zmqSubSocket.setsockopt(zmq.SUBSCRIBE, "rawtx")
+zmqSubSocket.setsockopt(zmq.SUBSCRIBE, "checkedblock")
+zmqSubSocket.connect("tcp://127.0.0.1:%i" % port)
+
+try:
+    while True:
+        msg = zmqSubSocket.recv_multipart()
+        topic = str(msg[0])
+        body = msg[1]
+        sequence = "Unknown";
+        if len(msg[-1]) == 4:
+          msgSequence = struct.unpack('<I', msg[-1])[-1]
+          sequence = str(msgSequence)
+        if topic == "hashblock":
+            print '- HASH BLOCK ('+sequence+') -'
+            print binascii.hexlify(body)
+        elif topic == "hashtx":
+            print '- HASH TX  ('+sequence+') -'
+            print binascii.hexlify(body)
+        elif topic == "rawblock":
+            print '- RAW BLOCK HEADER ('+sequence+') -'
+            print binascii.hexlify(body[:80])
+        elif topic == "rawtx":
+            print '- RAW TX ('+sequence+') -'
+            print binascii.hexlify(body)
+        elif topic == "checkedblock":
+            print '- CHECKED BLOCK ('+sequence+') -'
+            print binascii.hexlify(body[:80])
+
+except KeyboardInterrupt:
+    zmqContext.destroy()
diff --git a/depend/zcash/depends/.gitignore b/depend/zcash/depends/.gitignore
new file mode 100644
index 000000000..3cb4b9ac1
--- /dev/null
+++ b/depend/zcash/depends/.gitignore
@@ -0,0 +1,10 @@
+SDKs/
+work/
+built/
+sources/
+config.site
+x86_64*
+i686*
+mips*
+arm*
+aarch64*
diff --git a/depend/zcash/depends/Makefile b/depend/zcash/depends/Makefile
new file mode 100644
index 000000000..85401b502
--- /dev/null
+++ b/depend/zcash/depends/Makefile
@@ -0,0 +1,210 @@
+.NOTPARALLEL :
+
+# Pattern rule to print variables, e.g. make print-top_srcdir
+print-%:
+	@echo $* = $($*)
+
+# When invoking a sub-make, keep only the command line variable definitions
+# matching the pattern in the filter function.
+#
+# e.g. invoking:
+#   $ make A=1 C=1 print-MAKEOVERRIDES print-MAKEFLAGS
+#
+# with the following in the Makefile:
+#   MAKEOVERRIDES := $(filter A=% B=%,$(MAKEOVERRIDES))
+#
+# will print:
+#   MAKEOVERRIDES = A=1
+#   MAKEFLAGS = -- A=1
+#
+# this is because as the GNU make manual says:
+#   The command line variable definitions really appear in the variable
+#   MAKEOVERRIDES, and MAKEFLAGS contains a reference to this variable.
+#
+# and since the GNU make manual also says:
+#   variables defined on the command line are passed to the sub-make through
+#   MAKEFLAGS
+#
+# this means that sub-makes will be invoked as if:
+#   $(MAKE) A=1 blah blah
+MAKEOVERRIDES := $(filter V=%,$(MAKEOVERRIDES))
+SOURCES_PATH ?= $(BASEDIR)/sources
+BASE_CACHE ?= $(BASEDIR)/built
+SDK_PATH ?= $(BASEDIR)/SDKs
+NO_WALLET ?=
+FALLBACK_DOWNLOAD_PATH ?= https://download.z.cash/depends-sources
+
+BUILD ?= $(shell ./config.guess)
+HOST ?= $(BUILD)
+PATCHES_PATH = $(BASEDIR)/patches
+BASEDIR = $(CURDIR)
+HASH_LENGTH:=11
+DOWNLOAD_CONNECT_TIMEOUT:=10
+DOWNLOAD_RETRIES:=3
+CRATE_REGISTRY:=vendored-sources
+CRATE_ARCHIVE = $(SOURCES_PATH)/vendored-crates.tar.gz
+
+host:=$(BUILD)
+ifneq ($(HOST),)
+host:=$(HOST)
+host_toolchain:=$(HOST)-
+endif
+
+ifneq ($(DEBUG),)
+release_type=debug
+else
+release_type=release
+endif
+
+base_build_dir=$(BASEDIR)/work/build
+base_staging_dir=$(BASEDIR)/work/staging
+base_download_dir=$(BASEDIR)/work/download
+canonical_host:=$(shell ./config.sub $(HOST))
+build:=$(shell ./config.sub $(BUILD))
+
+build_arch =$(firstword $(subst -, ,$(build)))
+build_vendor=$(word 2,$(subst -, ,$(build)))
+full_build_os:=$(subst $(build_arch)-$(build_vendor)-,,$(build))
+build_os:=$(findstring linux,$(full_build_os))
+build_os+=$(findstring darwin,$(full_build_os))
+build_os+=$(findstring freebsd,$(full_build_os))
+build_os:=$(strip $(build_os))
+ifeq ($(build_os),)
+build_os=$(full_build_os)
+endif
+
+host_arch=$(firstword $(subst -, ,$(canonical_host)))
+host_vendor=$(word 2,$(subst -, ,$(canonical_host)))
+full_host_os:=$(subst $(host_arch)-$(host_vendor)-,,$(canonical_host))
+host_os:=$(findstring linux,$(full_host_os))
+host_os+=$(findstring darwin,$(full_host_os))
+host_os+=$(findstring freebsd,$(full_host_os))
+host_os+=$(findstring mingw32,$(full_host_os))
+host_os:=$(strip $(host_os))
+ifeq ($(host_os),)
+host_os=$(full_host_os)
+endif
+
+$(host_arch)_$(host_os)_prefix=$(BASEDIR)/$(host)
+$(host_arch)_$(host_os)_host=$(host)
+host_prefix=$($(host_arch)_$(host_os)_prefix)
+build_prefix=$(host_prefix)/native
+build_host=$(build)
+
+AT_$(V):=
+AT_:=@
+AT:=$(AT_$(V))
+
+all: install
+
+include hosts/$(host_os).mk
+include hosts/default.mk
+include builders/$(build_os).mk
+include builders/default.mk
+include packages/packages.mk
+
+wallet_packages_$(NO_WALLET) = $(wallet_packages)
+
+packages += $($(host_arch)_$(host_os)_packages) $($(host_os)_packages) $(wallet_packages_)
+native_packages += $($(host_arch)_$(host_os)_native_packages) $($(host_os)_native_packages)
+all_packages = $(packages) $(native_packages)
+
+meta_depends = Makefile funcs.mk builders/default.mk hosts/default.mk hosts/$(host_os).mk builders/$(build_os).mk
+
+$(host_arch)_$(host_os)_native_binutils?=$($(host_os)_native_binutils)
+$(host_arch)_$(host_os)_native_toolchain?=$($(host_os)_native_toolchain)
+
+include funcs.mk
+
+binutils_path=$($($(host_arch)_$(host_os)_native_binutils)_prefixbin)
+toolchain_path=$($($(host_arch)_$(host_os)_native_toolchain)_prefixbin)
+final_build_id_long+=$(shell $(build_SHA256SUM) config.site.in)
+final_build_id+=$(shell echo -n $(final_build_id_long) | $(build_SHA256SUM) | cut -c-$(HASH_LENGTH))
+$(host_prefix)/.stamp_$(final_build_id): $(native_packages) $(packages)
+	$(AT)rm -rf $(@D)
+	$(AT)mkdir -p $(@D)
+	$(AT)echo copying packages: $^
+	$(AT)echo to: $(@D)
+	$(AT)cd $(@D); $(foreach package,$^, tar xf $($(package)_cached); )
+	$(AT)if test -f "$(CRATE_ARCHIVE)"; \
+	then echo Extracting pre-vendored crates from $(CRATE_ARCHIVE)...; \
+		tar xf $(CRATE_ARCHIVE) -C $(@D); \
+	else echo Vendoring crates...; \
+		$(@D)/native/bin/cargo vendor --locked --manifest-path $(BASEDIR)/../Cargo.toml $(@D)/$(CRATE_REGISTRY); \
+	fi
+	$(AT)touch $@
+
+$(host_prefix)/share/config.site : config.site.in $(host_prefix)/.stamp_$(final_build_id)
+	$(AT)@mkdir -p $(@D)
+	$(AT)sed -e 's|@HOST@|$(host)|' \
+            -e 's|@CC@|$(toolchain_path)$(host_CC)|' \
+            -e 's|@CXX@|$(toolchain_path)$(host_CXX)|' \
+            -e 's|@AR@|$(binutils_path)$(host_AR)|' \
+            -e 's|@RANLIB@|$(binutils_path)$(host_RANLIB)|' \
+            -e 's|@NM@|$(binutils_path)$(host_NM)|' \
+            -e 's|@STRIP@|$(binutils_path)$(host_STRIP)|' \
+            -e 's|@build_os@|$(build_os)|' \
+            -e 's|@host_os@|$(host_os)|' \
+            -e 's|@CFLAGS@|$(strip $(host_CFLAGS) $(host_$(release_type)_CFLAGS))|' \
+            -e 's|@CXXFLAGS@|$(strip $(host_CXXFLAGS) $(host_$(release_type)_CXXFLAGS))|' \
+            -e 's|@CPPFLAGS@|$(strip $(host_CPPFLAGS) $(host_$(release_type)_CPPFLAGS))|' \
+            -e 's|@LDFLAGS@|$(strip $(host_LDFLAGS) $(host_$(release_type)_LDFLAGS))|' \
+            -e 's|@rust_target@|$(call rust_target,native_rust,$(canonical_host),$(host_os))|' \
+            -e 's|@no_wallet@|$(NO_WALLET)|' \
+            -e 's|@debug@|$(DEBUG)|' \
+            $< > $@
+	$(AT)touch $@
+
+
+define check_or_remove_cached
+  mkdir -p $(BASE_CACHE)/$(host)/$(package) && cd $(BASE_CACHE)/$(host)/$(package); \
+  $(build_SHA256SUM) -c $($(package)_cached_checksum) >/dev/null 2>/dev/null || \
+  ( rm -f $($(package)_cached_checksum); \
+    if test -f "$($(package)_cached)"; then echo "Checksum mismatch for $(package). Forcing rebuild.."; rm -f $($(package)_cached_checksum) $($(package)_cached); fi )
+endef
+
+define check_or_remove_sources
+  mkdir -p $($(package)_source_dir); cd $($(package)_source_dir); \
+  $(build_SHA256SUM) -c $($(package)_fetched) >/dev/null 2>/dev/null || \
+    ( test -z "$($(package)_all_sources)" || ( echo $($(package)_all_sources) | xargs -n 1 test ! -f ) || echo "Checksum missing or mismatched for $(package) source. Forcing re-download."; \
+      rm -f $($(package)_all_sources) $($(1)_fetched))
+endef
+
+check-packages:
+	@$(foreach package,$(packages),$(call check_or_remove_cached,$(package));)
+	@$(foreach package,$(rust_crates),$(call check_or_remove_cached,$(package));)
+	@$(foreach package,$(native_packages),$(call check_or_remove_cached,$(package));)
+check-sources:
+	@$(foreach package,$(packages),$(call check_or_remove_sources,$(package));)
+	@$(foreach package,$(rust_crates),$(call check_or_remove_sources,$(package));)
+	@$(foreach package,$(native_packages),$(call check_or_remove_sources,$(package));)
+
+$(host_prefix)/share/config.site: check-packages
+
+check-packages: check-sources
+
+install: check-packages $(host_prefix)/share/config.site
+
+
+crates_download_dir=$(base_download_dir)/crates
+download-crates: native_rust
+	$(AT)echo Vendoring crates...
+	$(AT)mkdir -p $(SOURCES_PATH)
+	$(AT)rm -rf $(crates_download_dir)
+	$(AT)mkdir -p $(crates_download_dir)
+	$(AT)tar xf $(native_rust_cached) -C $(crates_download_dir)
+	$(AT)$(crates_download_dir)/native/bin/cargo vendor --locked --manifest-path $(BASEDIR)/../Cargo.toml $(crates_download_dir)/$(CRATE_REGISTRY)
+	$(AT)cd $(crates_download_dir); find $(CRATE_REGISTRY) | sort | tar --no-recursion -czf $(CRATE_ARCHIVE) -T -
+	$(AT)rm -rf $(crates_download_dir)
+
+download-one: check-sources $(all_sources)
+
+download-osx:
+	@$(MAKE) -s HOST=x86_64-apple-darwin14 download-one
+download-linux:
+	@$(MAKE) -s HOST=x86_64-pc-linux-gnu download-one
+download-win:
+	@$(MAKE) -s HOST=x86_64-w64-mingw32 download-one
+download: download-crates download-osx download-linux download-win
+
+.PHONY: install cached download-crates download-one download-osx download-linux download-win download check-packages check-sources
diff --git a/depend/zcash/depends/README.md b/depend/zcash/depends/README.md
new file mode 100644
index 000000000..cf88a425f
--- /dev/null
+++ b/depend/zcash/depends/README.md
@@ -0,0 +1,57 @@
+### Usage
+
+To build dependencies for the current arch+OS:
+
+    make
+
+To build for another arch/OS:
+
+    make HOST=host-platform-triplet
+
+For example:
+
+    make HOST=x86_64-w64-mingw32 -j4
+
+A prefix will be generated that's suitable for plugging into Bitcoin's
+configure. In the above example, a dir named x86_64-w64-mingw32 will be
+created. To use it for Bitcoin:
+
+    ./configure --prefix=`pwd`/depends/x86_64-w64-mingw32
+
+Common `host-platform-triplets` for cross compilation are:
+
+- `i686-w64-mingw32` for Win32
+- `x86_64-w64-mingw32` for Win64
+- `x86_64-apple-darwin18` for macOS
+- `arm-linux-gnueabihf` for Linux ARM 32 bit
+- `aarch64-linux-gnu` for Linux ARM 64 bit
+- `riscv32-linux-gnu` for Linux RISC-V 32 bit
+- `riscv64-linux-gnu` for Linux RISC-V 64 bit
+
+No other options are needed, the paths are automatically configured.
+
+Dependency Options:
+The following can be set when running make: make FOO=bar
+
+    SOURCES_PATH: downloaded sources will be placed here
+    BASE_CACHE: built packages will be placed here
+    SDK_PATH: Path where sdk's can be found (used by OSX)
+    FALLBACK_DOWNLOAD_PATH: If a source file can't be fetched, try here before giving up
+    NO_WALLET: Don't download/build/cache libs needed to enable the wallet
+    DEBUG: disable some optimizations and enable more runtime checking
+
+If some packages are not built, for example `make NO_WALLET=1`, the appropriate
+options will be passed to bitcoin's configure. In this case, `--disable-wallet`.
+
+Additional targets:
+
+    download: run 'make download' to fetch all sources without building them
+    download-osx: run 'make download-osx' to fetch all sources needed for osx builds
+    download-win: run 'make download-win' to fetch all sources needed for win builds
+    download-linux: run 'make download-linux' to fetch all sources needed for linux builds
+
+### Other documentation
+
+- [description.md](description.md): General description of the depends system
+- [packages.md](packages.md): Steps for adding packages
+
diff --git a/depend/zcash/depends/builders/darwin.mk b/depend/zcash/depends/builders/darwin.mk
new file mode 100644
index 000000000..bcb02b782
--- /dev/null
+++ b/depend/zcash/depends/builders/darwin.mk
@@ -0,0 +1,23 @@
+build_darwin_CC: = $(shell xcrun -f clang)
+build_darwin_CXX: = $(shell xcrun -f clang++)
+build_darwin_AR: = $(shell xcrun -f ar)
+build_darwin_RANLIB: = $(shell xcrun -f ranlib)
+build_darwin_STRIP: = $(shell xcrun -f strip)
+build_darwin_OTOOL: = $(shell xcrun -f otool)
+build_darwin_NM: = $(shell xcrun -f nm)
+build_darwin_INSTALL_NAME_TOOL:=$(shell xcrun -f install_name_tool)
+build_darwin_SHA256SUM = shasum -a 256
+build_darwin_DOWNLOAD = curl --location --fail --connect-timeout $(DOWNLOAD_CONNECT_TIMEOUT) --retry $(DOWNLOAD_RETRIES) -o
+
+#darwin host on darwin builder. overrides darwin host preferences.
+darwin_CC=$(shell xcrun -f clang) -mmacosx-version-min=$(OSX_MIN_VERSION) -fvisibility=hidden -fvisibility-inlines-hidden --sysroot $(shell xcrun --show-sdk-path)
+darwin_CXX:=$(shell xcrun -f clang++) -mmacosx-version-min=$(OSX_MIN_VERSION) -fvisibility=hidden -fvisibility-inlines-hidden -stdlib=libc++ --sysroot $(shell xcrun --show-sdk-path)
+darwin_AR:=$(shell xcrun -f ar)
+darwin_RANLIB:=$(shell xcrun -f ranlib)
+darwin_STRIP:=$(shell xcrun -f strip)
+darwin_LIBTOOL:=$(shell xcrun -f libtool)
+darwin_OTOOL:=$(shell xcrun -f otool)
+darwin_NM:=$(shell xcrun -f nm)
+darwin_INSTALL_NAME_TOOL:=$(shell xcrun -f install_name_tool)
+darwin_native_binutils=
+darwin_native_toolchain=
diff --git a/depend/zcash/depends/builders/default.mk b/depend/zcash/depends/builders/default.mk
new file mode 100644
index 000000000..f097db65d
--- /dev/null
+++ b/depend/zcash/depends/builders/default.mk
@@ -0,0 +1,20 @@
+default_build_CC = gcc
+default_build_CXX = g++
+default_build_AR = ar
+default_build_RANLIB = ranlib
+default_build_STRIP = strip
+default_build_NM = nm
+default_build_OTOOL = otool
+default_build_INSTALL_NAME_TOOL = install_name_tool
+
+define add_build_tool_func
+build_$(build_os)_$1 ?= $$(default_build_$1)
+build_$(build_arch)_$(build_os)_$1 ?= $$(build_$(build_os)_$1)
+build_$1=$$(build_$(build_arch)_$(build_os)_$1)
+endef
+$(foreach var,CC CXX AR RANLIB NM STRIP SHA256SUM DOWNLOAD OTOOL INSTALL_NAME_TOOL,$(eval $(call add_build_tool_func,$(var))))
+define add_build_flags_func
+build_$(build_arch)_$(build_os)_$1 += $(build_$(build_os)_$1)
+build_$1=$$(build_$(build_arch)_$(build_os)_$1)
+endef
+$(foreach flags, CFLAGS CXXFLAGS LDFLAGS, $(eval $(call add_build_flags_func,$(flags))))
diff --git a/depend/zcash/depends/builders/freebsd.mk b/depend/zcash/depends/builders/freebsd.mk
new file mode 100644
index 000000000..7a61043e9
--- /dev/null
+++ b/depend/zcash/depends/builders/freebsd.mk
@@ -0,0 +1,4 @@
+build_freebsd_CC = clang
+build_freebsd_CXX = clang++
+build_freebsd_SHA256SUM = shasum -a 256
+build_freebsd_DOWNLOAD = curl --location --fail --connect-timeout $(DOWNLOAD_CONNECT_TIMEOUT) --retry $(DOWNLOAD_RETRIES) -o
diff --git a/depend/zcash/depends/builders/linux.mk b/depend/zcash/depends/builders/linux.mk
new file mode 100644
index 000000000..b03f42401
--- /dev/null
+++ b/depend/zcash/depends/builders/linux.mk
@@ -0,0 +1,2 @@
+build_linux_SHA256SUM = sha256sum
+build_linux_DOWNLOAD = curl --location --fail --connect-timeout $(DOWNLOAD_CONNECT_TIMEOUT) --retry $(DOWNLOAD_RETRIES) -o
diff --git a/depend/zcash/depends/config.guess b/depend/zcash/depends/config.guess
new file mode 100755
index 000000000..8d70ec2b2
--- /dev/null
+++ b/depend/zcash/depends/config.guess
@@ -0,0 +1,1685 @@
+#! /bin/sh
+# Attempt to guess a canonical system name.
+#   Copyright 1992-2020 Free Software Foundation, Inc.
+
+timestamp='2020-09-19'
+
+# This file is free software; you can redistribute it and/or modify it
+# under the terms of the GNU General Public License as published by
+# the Free Software Foundation; either version 3 of the License, or
+# (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program; if not, see <https://www.gnu.org/licenses/>.
+#
+# As a special exception to the GNU General Public License, if you
+# distribute this file as part of a program that contains a
+# configuration script generated by Autoconf, you may include it under
+# the same distribution terms that you use for the rest of that
+# program.  This Exception is an additional permission under section 7
+# of the GNU General Public License, version 3 ("GPLv3").
+#
+# Originally written by Per Bothner; maintained since 2000 by Ben Elliston.
+#
+# You can get the latest version of this script from:
+# https://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.guess
+#
+# Please send patches to <config-patches@gnu.org>.
+
+
+me=`echo "$0" | sed -e 's,.*/,,'`
+
+usage="\
+Usage: $0 [OPTION]
+
+Output the configuration name of the system \`$me' is run on.
+
+Options:
+  -h, --help         print this help, then exit
+  -t, --time-stamp   print date of last modification, then exit
+  -v, --version      print version number, then exit
+
+Report bugs and patches to <config-patches@gnu.org>."
+
+version="\
+GNU config.guess ($timestamp)
+
+Originally written by Per Bothner.
+Copyright 1992-2020 Free Software Foundation, Inc.
+
+This is free software; see the source for copying conditions.  There is NO
+warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE."
+
+help="
+Try \`$me --help' for more information."
+
+# Parse command line
+while test $# -gt 0 ; do
+  case $1 in
+    --time-stamp | --time* | -t )
+       echo "$timestamp" ; exit ;;
+    --version | -v )
+       echo "$version" ; exit ;;
+    --help | --h* | -h )
+       echo "$usage"; exit ;;
+    -- )     # Stop option processing
+       shift; break ;;
+    - )	# Use stdin as input.
+       break ;;
+    -* )
+       echo "$me: invalid option $1$help" >&2
+       exit 1 ;;
+    * )
+       break ;;
+  esac
+done
+
+if test $# != 0; then
+  echo "$me: too many arguments$help" >&2
+  exit 1
+fi
+
+# CC_FOR_BUILD -- compiler used by this script. Note that the use of a
+# compiler to aid in system detection is discouraged as it requires
+# temporary files to be created and, as you can see below, it is a
+# headache to deal with in a portable fashion.
+
+# Historically, `CC_FOR_BUILD' used to be named `HOST_CC'. We still
+# use `HOST_CC' if defined, but it is deprecated.
+
+# Portable tmp directory creation inspired by the Autoconf team.
+
+tmp=
+# shellcheck disable=SC2172
+trap 'test -z "$tmp" || rm -fr "$tmp"' 0 1 2 13 15
+
+set_cc_for_build() {
+    # prevent multiple calls if $tmp is already set
+    test "$tmp" && return 0
+    : "${TMPDIR=/tmp}"
+    # shellcheck disable=SC2039
+    { tmp=`(umask 077 && mktemp -d "$TMPDIR/cgXXXXXX") 2>/dev/null` && test -n "$tmp" && test -d "$tmp" ; } ||
+	{ test -n "$RANDOM" && tmp=$TMPDIR/cg$$-$RANDOM && (umask 077 && mkdir "$tmp" 2>/dev/null) ; } ||
+	{ tmp=$TMPDIR/cg-$$ && (umask 077 && mkdir "$tmp" 2>/dev/null) && echo "Warning: creating insecure temp directory" >&2 ; } ||
+	{ echo "$me: cannot create a temporary directory in $TMPDIR" >&2 ; exit 1 ; }
+    dummy=$tmp/dummy
+    case ${CC_FOR_BUILD-},${HOST_CC-},${CC-} in
+	,,)    echo "int x;" > "$dummy.c"
+	       for driver in cc gcc c89 c99 ; do
+		   if ($driver -c -o "$dummy.o" "$dummy.c") >/dev/null 2>&1 ; then
+		       CC_FOR_BUILD="$driver"
+		       break
+		   fi
+	       done
+	       if test x"$CC_FOR_BUILD" = x ; then
+		   CC_FOR_BUILD=no_compiler_found
+	       fi
+	       ;;
+	,,*)   CC_FOR_BUILD=$CC ;;
+	,*,*)  CC_FOR_BUILD=$HOST_CC ;;
+    esac
+}
+
+# This is needed to find uname on a Pyramid OSx when run in the BSD universe.
+# (ghazi@noc.rutgers.edu 1994-08-24)
+if test -f /.attbin/uname ; then
+	PATH=$PATH:/.attbin ; export PATH
+fi
+
+UNAME_MACHINE=`(uname -m) 2>/dev/null` || UNAME_MACHINE=unknown
+UNAME_RELEASE=`(uname -r) 2>/dev/null` || UNAME_RELEASE=unknown
+UNAME_SYSTEM=`(uname -s) 2>/dev/null`  || UNAME_SYSTEM=unknown
+UNAME_VERSION=`(uname -v) 2>/dev/null` || UNAME_VERSION=unknown
+
+case "$UNAME_SYSTEM" in
+Linux|GNU|GNU/*)
+	# If the system lacks a compiler, then just pick glibc.
+	# We could probably try harder.
+	LIBC=gnu
+
+	set_cc_for_build
+	cat <<-EOF > "$dummy.c"
+	#include <features.h>
+	#if defined(__UCLIBC__)
+	LIBC=uclibc
+	#elif defined(__dietlibc__)
+	LIBC=dietlibc
+	#else
+	#include <stdarg.h>
+	#ifdef __DEFINED_va_list
+	LIBC=musl
+	#else
+	LIBC=gnu
+	#endif
+	#endif
+	EOF
+	eval "`$CC_FOR_BUILD -E "$dummy.c" 2>/dev/null | grep '^LIBC' | sed 's, ,,g'`"
+	;;
+esac
+
+# Note: order is significant - the case branches are not exclusive.
+
+case "$UNAME_MACHINE:$UNAME_SYSTEM:$UNAME_RELEASE:$UNAME_VERSION" in
+    *:NetBSD:*:*)
+	# NetBSD (nbsd) targets should (where applicable) match one or
+	# more of the tuples: *-*-netbsdelf*, *-*-netbsdaout*,
+	# *-*-netbsdecoff* and *-*-netbsd*.  For targets that recently
+	# switched to ELF, *-*-netbsd* would select the old
+	# object file format.  This provides both forward
+	# compatibility and a consistent mechanism for selecting the
+	# object file format.
+	#
+	# Note: NetBSD doesn't particularly care about the vendor
+	# portion of the name.  We always set it to "unknown".
+	sysctl="sysctl -n hw.machine_arch"
+	UNAME_MACHINE_ARCH=`(uname -p 2>/dev/null || \
+	    "/sbin/$sysctl" 2>/dev/null || \
+	    "/usr/sbin/$sysctl" 2>/dev/null || \
+	    echo unknown)`
+	case "$UNAME_MACHINE_ARCH" in
+	    armeb) machine=armeb-unknown ;;
+	    arm*) machine=arm-unknown ;;
+	    sh3el) machine=shl-unknown ;;
+	    sh3eb) machine=sh-unknown ;;
+	    sh5el) machine=sh5le-unknown ;;
+	    earmv*)
+		arch=`echo "$UNAME_MACHINE_ARCH" | sed -e 's,^e\(armv[0-9]\).*$,\1,'`
+		endian=`echo "$UNAME_MACHINE_ARCH" | sed -ne 's,^.*\(eb\)$,\1,p'`
+		machine="${arch}${endian}"-unknown
+		;;
+	    *) machine="$UNAME_MACHINE_ARCH"-unknown ;;
+	esac
+	# The Operating System including object format, if it has switched
+	# to ELF recently (or will in the future) and ABI.
+	case "$UNAME_MACHINE_ARCH" in
+	    earm*)
+		os=netbsdelf
+		;;
+	    arm*|i386|m68k|ns32k|sh3*|sparc|vax)
+		set_cc_for_build
+		if echo __ELF__ | $CC_FOR_BUILD -E - 2>/dev/null \
+			| grep -q __ELF__
+		then
+		    # Once all utilities can be ECOFF (netbsdecoff) or a.out (netbsdaout).
+		    # Return netbsd for either.  FIX?
+		    os=netbsd
+		else
+		    os=netbsdelf
+		fi
+		;;
+	    *)
+		os=netbsd
+		;;
+	esac
+	# Determine ABI tags.
+	case "$UNAME_MACHINE_ARCH" in
+	    earm*)
+		expr='s/^earmv[0-9]/-eabi/;s/eb$//'
+		abi=`echo "$UNAME_MACHINE_ARCH" | sed -e "$expr"`
+		;;
+	esac
+	# The OS release
+	# Debian GNU/NetBSD machines have a different userland, and
+	# thus, need a distinct triplet. However, they do not need
+	# kernel version information, so it can be replaced with a
+	# suitable tag, in the style of linux-gnu.
+	case "$UNAME_VERSION" in
+	    Debian*)
+		release='-gnu'
+		;;
+	    *)
+		release=`echo "$UNAME_RELEASE" | sed -e 's/[-_].*//' | cut -d. -f1,2`
+		;;
+	esac
+	# Since CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM:
+	# contains redundant information, the shorter form:
+	# CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM is used.
+	echo "$machine-${os}${release}${abi-}"
+	exit ;;
+    *:Bitrig:*:*)
+	UNAME_MACHINE_ARCH=`arch | sed 's/Bitrig.//'`
+	echo "$UNAME_MACHINE_ARCH"-unknown-bitrig"$UNAME_RELEASE"
+	exit ;;
+    *:OpenBSD:*:*)
+	UNAME_MACHINE_ARCH=`arch | sed 's/OpenBSD.//'`
+	echo "$UNAME_MACHINE_ARCH"-unknown-openbsd"$UNAME_RELEASE"
+	exit ;;
+    *:LibertyBSD:*:*)
+	UNAME_MACHINE_ARCH=`arch | sed 's/^.*BSD\.//'`
+	echo "$UNAME_MACHINE_ARCH"-unknown-libertybsd"$UNAME_RELEASE"
+	exit ;;
+    *:MidnightBSD:*:*)
+	echo "$UNAME_MACHINE"-unknown-midnightbsd"$UNAME_RELEASE"
+	exit ;;
+    *:ekkoBSD:*:*)
+	echo "$UNAME_MACHINE"-unknown-ekkobsd"$UNAME_RELEASE"
+	exit ;;
+    *:SolidBSD:*:*)
+	echo "$UNAME_MACHINE"-unknown-solidbsd"$UNAME_RELEASE"
+	exit ;;
+    *:OS108:*:*)
+	echo "$UNAME_MACHINE"-unknown-os108_"$UNAME_RELEASE"
+	exit ;;
+    macppc:MirBSD:*:*)
+	echo powerpc-unknown-mirbsd"$UNAME_RELEASE"
+	exit ;;
+    *:MirBSD:*:*)
+	echo "$UNAME_MACHINE"-unknown-mirbsd"$UNAME_RELEASE"
+	exit ;;
+    *:Sortix:*:*)
+	echo "$UNAME_MACHINE"-unknown-sortix
+	exit ;;
+    *:Twizzler:*:*)
+	echo "$UNAME_MACHINE"-unknown-twizzler
+	exit ;;
+    *:Redox:*:*)
+	echo "$UNAME_MACHINE"-unknown-redox
+	exit ;;
+    mips:OSF1:*.*)
+	echo mips-dec-osf1
+	exit ;;
+    alpha:OSF1:*:*)
+	case $UNAME_RELEASE in
+	*4.0)
+		UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $3}'`
+		;;
+	*5.*)
+		UNAME_RELEASE=`/usr/sbin/sizer -v | awk '{print $4}'`
+		;;
+	esac
+	# According to Compaq, /usr/sbin/psrinfo has been available on
+	# OSF/1 and Tru64 systems produced since 1995.  I hope that
+	# covers most systems running today.  This code pipes the CPU
+	# types through head -n 1, so we only detect the type of CPU 0.
+	ALPHA_CPU_TYPE=`/usr/sbin/psrinfo -v | sed -n -e 's/^  The alpha \(.*\) processor.*$/\1/p' | head -n 1`
+	case "$ALPHA_CPU_TYPE" in
+	    "EV4 (21064)")
+		UNAME_MACHINE=alpha ;;
+	    "EV4.5 (21064)")
+		UNAME_MACHINE=alpha ;;
+	    "LCA4 (21066/21068)")
+		UNAME_MACHINE=alpha ;;
+	    "EV5 (21164)")
+		UNAME_MACHINE=alphaev5 ;;
+	    "EV5.6 (21164A)")
+		UNAME_MACHINE=alphaev56 ;;
+	    "EV5.6 (21164PC)")
+		UNAME_MACHINE=alphapca56 ;;
+	    "EV5.7 (21164PC)")
+		UNAME_MACHINE=alphapca57 ;;
+	    "EV6 (21264)")
+		UNAME_MACHINE=alphaev6 ;;
+	    "EV6.7 (21264A)")
+		UNAME_MACHINE=alphaev67 ;;
+	    "EV6.8CB (21264C)")
+		UNAME_MACHINE=alphaev68 ;;
+	    "EV6.8AL (21264B)")
+		UNAME_MACHINE=alphaev68 ;;
+	    "EV6.8CX (21264D)")
+		UNAME_MACHINE=alphaev68 ;;
+	    "EV6.9A (21264/EV69A)")
+		UNAME_MACHINE=alphaev69 ;;
+	    "EV7 (21364)")
+		UNAME_MACHINE=alphaev7 ;;
+	    "EV7.9 (21364A)")
+		UNAME_MACHINE=alphaev79 ;;
+	esac
+	# A Pn.n version is a patched version.
+	# A Vn.n version is a released version.
+	# A Tn.n version is a released field test version.
+	# A Xn.n version is an unreleased experimental baselevel.
+	# 1.2 uses "1.2" for uname -r.
+	echo "$UNAME_MACHINE"-dec-osf"`echo "$UNAME_RELEASE" | sed -e 's/^[PVTX]//' | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz`"
+	# Reset EXIT trap before exiting to avoid spurious non-zero exit code.
+	exitcode=$?
+	trap '' 0
+	exit $exitcode ;;
+    Amiga*:UNIX_System_V:4.0:*)
+	echo m68k-unknown-sysv4
+	exit ;;
+    *:[Aa]miga[Oo][Ss]:*:*)
+	echo "$UNAME_MACHINE"-unknown-amigaos
+	exit ;;
+    *:[Mm]orph[Oo][Ss]:*:*)
+	echo "$UNAME_MACHINE"-unknown-morphos
+	exit ;;
+    *:OS/390:*:*)
+	echo i370-ibm-openedition
+	exit ;;
+    *:z/VM:*:*)
+	echo s390-ibm-zvmoe
+	exit ;;
+    *:OS400:*:*)
+	echo powerpc-ibm-os400
+	exit ;;
+    arm:RISC*:1.[012]*:*|arm:riscix:1.[012]*:*)
+	echo arm-acorn-riscix"$UNAME_RELEASE"
+	exit ;;
+    arm*:riscos:*:*|arm*:RISCOS:*:*)
+	echo arm-unknown-riscos
+	exit ;;
+    SR2?01:HI-UX/MPP:*:* | SR8000:HI-UX/MPP:*:*)
+	echo hppa1.1-hitachi-hiuxmpp
+	exit ;;
+    Pyramid*:OSx*:*:* | MIS*:OSx*:*:* | MIS*:SMP_DC-OSx*:*:*)
+	# akee@wpdis03.wpafb.af.mil (Earle F. Ake) contributed MIS and NILE.
+	if test "`(/bin/universe) 2>/dev/null`" = att ; then
+		echo pyramid-pyramid-sysv3
+	else
+		echo pyramid-pyramid-bsd
+	fi
+	exit ;;
+    NILE*:*:*:dcosx)
+	echo pyramid-pyramid-svr4
+	exit ;;
+    DRS?6000:unix:4.0:6*)
+	echo sparc-icl-nx6
+	exit ;;
+    DRS?6000:UNIX_SV:4.2*:7* | DRS?6000:isis:4.2*:7*)
+	case `/usr/bin/uname -p` in
+	    sparc) echo sparc-icl-nx7; exit ;;
+	esac ;;
+    s390x:SunOS:*:*)
+	echo "$UNAME_MACHINE"-ibm-solaris2"`echo "$UNAME_RELEASE" | sed -e 's/[^.]*//'`"
+	exit ;;
+    sun4H:SunOS:5.*:*)
+	echo sparc-hal-solaris2"`echo "$UNAME_RELEASE"|sed -e 's/[^.]*//'`"
+	exit ;;
+    sun4*:SunOS:5.*:* | tadpole*:SunOS:5.*:*)
+	echo sparc-sun-solaris2"`echo "$UNAME_RELEASE" | sed -e 's/[^.]*//'`"
+	exit ;;
+    i86pc:AuroraUX:5.*:* | i86xen:AuroraUX:5.*:*)
+	echo i386-pc-auroraux"$UNAME_RELEASE"
+	exit ;;
+    i86pc:SunOS:5.*:* | i86xen:SunOS:5.*:*)
+	set_cc_for_build
+	SUN_ARCH=i386
+	# If there is a compiler, see if it is configured for 64-bit objects.
+	# Note that the Sun cc does not turn __LP64__ into 1 like gcc does.
+	# This test works for both compilers.
+	if test "$CC_FOR_BUILD" != no_compiler_found; then
+	    if (echo '#ifdef __amd64'; echo IS_64BIT_ARCH; echo '#endif') | \
+		(CCOPTS="" $CC_FOR_BUILD -E - 2>/dev/null) | \
+		grep IS_64BIT_ARCH >/dev/null
+	    then
+		SUN_ARCH=x86_64
+	    fi
+	fi
+	echo "$SUN_ARCH"-pc-solaris2"`echo "$UNAME_RELEASE"|sed -e 's/[^.]*//'`"
+	exit ;;
+    sun4*:SunOS:6*:*)
+	# According to config.sub, this is the proper way to canonicalize
+	# SunOS6.  Hard to guess exactly what SunOS6 will be like, but
+	# it's likely to be more like Solaris than SunOS4.
+	echo sparc-sun-solaris3"`echo "$UNAME_RELEASE"|sed -e 's/[^.]*//'`"
+	exit ;;
+    sun4*:SunOS:*:*)
+	case "`/usr/bin/arch -k`" in
+	    Series*|S4*)
+		UNAME_RELEASE=`uname -v`
+		;;
+	esac
+	# Japanese Language versions have a version number like `4.1.3-JL'.
+	echo sparc-sun-sunos"`echo "$UNAME_RELEASE"|sed -e 's/-/_/'`"
+	exit ;;
+    sun3*:SunOS:*:*)
+	echo m68k-sun-sunos"$UNAME_RELEASE"
+	exit ;;
+    sun*:*:4.2BSD:*)
+	UNAME_RELEASE=`(sed 1q /etc/motd | awk '{print substr($5,1,3)}') 2>/dev/null`
+	test "x$UNAME_RELEASE" = x && UNAME_RELEASE=3
+	case "`/bin/arch`" in
+	    sun3)
+		echo m68k-sun-sunos"$UNAME_RELEASE"
+		;;
+	    sun4)
+		echo sparc-sun-sunos"$UNAME_RELEASE"
+		;;
+	esac
+	exit ;;
+    aushp:SunOS:*:*)
+	echo sparc-auspex-sunos"$UNAME_RELEASE"
+	exit ;;
+    # The situation for MiNT is a little confusing.  The machine name
+    # can be virtually everything (everything which is not
+    # "atarist" or "atariste" at least should have a processor
+    # > m68000).  The system name ranges from "MiNT" over "FreeMiNT"
+    # to the lowercase version "mint" (or "freemint").  Finally
+    # the system name "TOS" denotes a system which is actually not
+    # MiNT.  But MiNT is downward compatible to TOS, so this should
+    # be no problem.
+    atarist[e]:*MiNT:*:* | atarist[e]:*mint:*:* | atarist[e]:*TOS:*:*)
+	echo m68k-atari-mint"$UNAME_RELEASE"
+	exit ;;
+    atari*:*MiNT:*:* | atari*:*mint:*:* | atarist[e]:*TOS:*:*)
+	echo m68k-atari-mint"$UNAME_RELEASE"
+	exit ;;
+    *falcon*:*MiNT:*:* | *falcon*:*mint:*:* | *falcon*:*TOS:*:*)
+	echo m68k-atari-mint"$UNAME_RELEASE"
+	exit ;;
+    milan*:*MiNT:*:* | milan*:*mint:*:* | *milan*:*TOS:*:*)
+	echo m68k-milan-mint"$UNAME_RELEASE"
+	exit ;;
+    hades*:*MiNT:*:* | hades*:*mint:*:* | *hades*:*TOS:*:*)
+	echo m68k-hades-mint"$UNAME_RELEASE"
+	exit ;;
+    *:*MiNT:*:* | *:*mint:*:* | *:*TOS:*:*)
+	echo m68k-unknown-mint"$UNAME_RELEASE"
+	exit ;;
+    m68k:machten:*:*)
+	echo m68k-apple-machten"$UNAME_RELEASE"
+	exit ;;
+    powerpc:machten:*:*)
+	echo powerpc-apple-machten"$UNAME_RELEASE"
+	exit ;;
+    RISC*:Mach:*:*)
+	echo mips-dec-mach_bsd4.3
+	exit ;;
+    RISC*:ULTRIX:*:*)
+	echo mips-dec-ultrix"$UNAME_RELEASE"
+	exit ;;
+    VAX*:ULTRIX*:*:*)
+	echo vax-dec-ultrix"$UNAME_RELEASE"
+	exit ;;
+    2020:CLIX:*:* | 2430:CLIX:*:*)
+	echo clipper-intergraph-clix"$UNAME_RELEASE"
+	exit ;;
+    mips:*:*:UMIPS | mips:*:*:RISCos)
+	set_cc_for_build
+	sed 's/^	//' << EOF > "$dummy.c"
+#ifdef __cplusplus
+#include <stdio.h>  /* for printf() prototype */
+	int main (int argc, char *argv[]) {
+#else
+	int main (argc, argv) int argc; char *argv[]; {
+#endif
+	#if defined (host_mips) && defined (MIPSEB)
+	#if defined (SYSTYPE_SYSV)
+	  printf ("mips-mips-riscos%ssysv\\n", argv[1]); exit (0);
+	#endif
+	#if defined (SYSTYPE_SVR4)
+	  printf ("mips-mips-riscos%ssvr4\\n", argv[1]); exit (0);
+	#endif
+	#if defined (SYSTYPE_BSD43) || defined(SYSTYPE_BSD)
+	  printf ("mips-mips-riscos%sbsd\\n", argv[1]); exit (0);
+	#endif
+	#endif
+	  exit (-1);
+	}
+EOF
+	$CC_FOR_BUILD -o "$dummy" "$dummy.c" &&
+	  dummyarg=`echo "$UNAME_RELEASE" | sed -n 's/\([0-9]*\).*/\1/p'` &&
+	  SYSTEM_NAME=`"$dummy" "$dummyarg"` &&
+	    { echo "$SYSTEM_NAME"; exit; }
+	echo mips-mips-riscos"$UNAME_RELEASE"
+	exit ;;
+    Motorola:PowerMAX_OS:*:*)
+	echo powerpc-motorola-powermax
+	exit ;;
+    Motorola:*:4.3:PL8-*)
+	echo powerpc-harris-powermax
+	exit ;;
+    Night_Hawk:*:*:PowerMAX_OS | Synergy:PowerMAX_OS:*:*)
+	echo powerpc-harris-powermax
+	exit ;;
+    Night_Hawk:Power_UNIX:*:*)
+	echo powerpc-harris-powerunix
+	exit ;;
+    m88k:CX/UX:7*:*)
+	echo m88k-harris-cxux7
+	exit ;;
+    m88k:*:4*:R4*)
+	echo m88k-motorola-sysv4
+	exit ;;
+    m88k:*:3*:R3*)
+	echo m88k-motorola-sysv3
+	exit ;;
+    AViiON:dgux:*:*)
+	# DG/UX returns AViiON for all architectures
+	UNAME_PROCESSOR=`/usr/bin/uname -p`
+	if test "$UNAME_PROCESSOR" = mc88100 || test "$UNAME_PROCESSOR" = mc88110
+	then
+	    if test "$TARGET_BINARY_INTERFACE"x = m88kdguxelfx || \
+	       test "$TARGET_BINARY_INTERFACE"x = x
+	    then
+		echo m88k-dg-dgux"$UNAME_RELEASE"
+	    else
+		echo m88k-dg-dguxbcs"$UNAME_RELEASE"
+	    fi
+	else
+	    echo i586-dg-dgux"$UNAME_RELEASE"
+	fi
+	exit ;;
+    M88*:DolphinOS:*:*)	# DolphinOS (SVR3)
+	echo m88k-dolphin-sysv3
+	exit ;;
+    M88*:*:R3*:*)
+	# Delta 88k system running SVR3
+	echo m88k-motorola-sysv3
+	exit ;;
+    XD88*:*:*:*) # Tektronix XD88 system running UTekV (SVR3)
+	echo m88k-tektronix-sysv3
+	exit ;;
+    Tek43[0-9][0-9]:UTek:*:*) # Tektronix 4300 system running UTek (BSD)
+	echo m68k-tektronix-bsd
+	exit ;;
+    *:IRIX*:*:*)
+	echo mips-sgi-irix"`echo "$UNAME_RELEASE"|sed -e 's/-/_/g'`"
+	exit ;;
+    ????????:AIX?:[12].1:2)   # AIX 2.2.1 or AIX 2.1.1 is RT/PC AIX.
+	echo romp-ibm-aix     # uname -m gives an 8 hex-code CPU id
+	exit ;;               # Note that: echo "'`uname -s`'" gives 'AIX '
+    i*86:AIX:*:*)
+	echo i386-ibm-aix
+	exit ;;
+    ia64:AIX:*:*)
+	if test -x /usr/bin/oslevel ; then
+		IBM_REV=`/usr/bin/oslevel`
+	else
+		IBM_REV="$UNAME_VERSION.$UNAME_RELEASE"
+	fi
+	echo "$UNAME_MACHINE"-ibm-aix"$IBM_REV"
+	exit ;;
+    *:AIX:2:3)
+	if grep bos325 /usr/include/stdio.h >/dev/null 2>&1; then
+		set_cc_for_build
+		sed 's/^		//' << EOF > "$dummy.c"
+		#include <sys/systemcfg.h>
+
+		main()
+			{
+			if (!__power_pc())
+				exit(1);
+			puts("powerpc-ibm-aix3.2.5");
+			exit(0);
+			}
+EOF
+		if $CC_FOR_BUILD -o "$dummy" "$dummy.c" && SYSTEM_NAME=`"$dummy"`
+		then
+			echo "$SYSTEM_NAME"
+		else
+			echo rs6000-ibm-aix3.2.5
+		fi
+	elif grep bos324 /usr/include/stdio.h >/dev/null 2>&1; then
+		echo rs6000-ibm-aix3.2.4
+	else
+		echo rs6000-ibm-aix3.2
+	fi
+	exit ;;
+    *:AIX:*:[4567])
+	IBM_CPU_ID=`/usr/sbin/lsdev -C -c processor -S available | sed 1q | awk '{ print $1 }'`
+	if /usr/sbin/lsattr -El "$IBM_CPU_ID" | grep ' POWER' >/dev/null 2>&1; then
+		IBM_ARCH=rs6000
+	else
+		IBM_ARCH=powerpc
+	fi
+	if test -x /usr/bin/lslpp ; then
+		IBM_REV=`/usr/bin/lslpp -Lqc bos.rte.libc |
+			   awk -F: '{ print $3 }' | sed s/[0-9]*$/0/`
+	else
+		IBM_REV="$UNAME_VERSION.$UNAME_RELEASE"
+	fi
+	echo "$IBM_ARCH"-ibm-aix"$IBM_REV"
+	exit ;;
+    *:AIX:*:*)
+	echo rs6000-ibm-aix
+	exit ;;
+    ibmrt:4.4BSD:*|romp-ibm:4.4BSD:*)
+	echo romp-ibm-bsd4.4
+	exit ;;
+    ibmrt:*BSD:*|romp-ibm:BSD:*)            # covers RT/PC BSD and
+	echo romp-ibm-bsd"$UNAME_RELEASE"   # 4.3 with uname added to
+	exit ;;                             # report: romp-ibm BSD 4.3
+    *:BOSX:*:*)
+	echo rs6000-bull-bosx
+	exit ;;
+    DPX/2?00:B.O.S.:*:*)
+	echo m68k-bull-sysv3
+	exit ;;
+    9000/[34]??:4.3bsd:1.*:*)
+	echo m68k-hp-bsd
+	exit ;;
+    hp300:4.4BSD:*:* | 9000/[34]??:4.3bsd:2.*:*)
+	echo m68k-hp-bsd4.4
+	exit ;;
+    9000/[34678]??:HP-UX:*:*)
+	HPUX_REV=`echo "$UNAME_RELEASE"|sed -e 's/[^.]*.[0B]*//'`
+	case "$UNAME_MACHINE" in
+	    9000/31?)            HP_ARCH=m68000 ;;
+	    9000/[34]??)         HP_ARCH=m68k ;;
+	    9000/[678][0-9][0-9])
+		if test -x /usr/bin/getconf; then
+		    sc_cpu_version=`/usr/bin/getconf SC_CPU_VERSION 2>/dev/null`
+		    sc_kernel_bits=`/usr/bin/getconf SC_KERNEL_BITS 2>/dev/null`
+		    case "$sc_cpu_version" in
+		      523) HP_ARCH=hppa1.0 ;; # CPU_PA_RISC1_0
+		      528) HP_ARCH=hppa1.1 ;; # CPU_PA_RISC1_1
+		      532)                      # CPU_PA_RISC2_0
+			case "$sc_kernel_bits" in
+			  32) HP_ARCH=hppa2.0n ;;
+			  64) HP_ARCH=hppa2.0w ;;
+			  '') HP_ARCH=hppa2.0 ;;   # HP-UX 10.20
+			esac ;;
+		    esac
+		fi
+		if test "$HP_ARCH" = ""; then
+		    set_cc_for_build
+		    sed 's/^		//' << EOF > "$dummy.c"
+
+		#define _HPUX_SOURCE
+		#include <stdlib.h>
+		#include <unistd.h>
+
+		int main ()
+		{
+		#if defined(_SC_KERNEL_BITS)
+		    long bits = sysconf(_SC_KERNEL_BITS);
+		#endif
+		    long cpu  = sysconf (_SC_CPU_VERSION);
+
+		    switch (cpu)
+			{
+			case CPU_PA_RISC1_0: puts ("hppa1.0"); break;
+			case CPU_PA_RISC1_1: puts ("hppa1.1"); break;
+			case CPU_PA_RISC2_0:
+		#if defined(_SC_KERNEL_BITS)
+			    switch (bits)
+				{
+				case 64: puts ("hppa2.0w"); break;
+				case 32: puts ("hppa2.0n"); break;
+				default: puts ("hppa2.0"); break;
+				} break;
+		#else  /* !defined(_SC_KERNEL_BITS) */
+			    puts ("hppa2.0"); break;
+		#endif
+			default: puts ("hppa1.0"); break;
+			}
+		    exit (0);
+		}
+EOF
+		    (CCOPTS="" $CC_FOR_BUILD -o "$dummy" "$dummy.c" 2>/dev/null) && HP_ARCH=`"$dummy"`
+		    test -z "$HP_ARCH" && HP_ARCH=hppa
+		fi ;;
+	esac
+	if test "$HP_ARCH" = hppa2.0w
+	then
+	    set_cc_for_build
+
+	    # hppa2.0w-hp-hpux* has a 64-bit kernel and a compiler generating
+	    # 32-bit code.  hppa64-hp-hpux* has the same kernel and a compiler
+	    # generating 64-bit code.  GNU and HP use different nomenclature:
+	    #
+	    # $ CC_FOR_BUILD=cc ./config.guess
+	    # => hppa2.0w-hp-hpux11.23
+	    # $ CC_FOR_BUILD="cc +DA2.0w" ./config.guess
+	    # => hppa64-hp-hpux11.23
+
+	    if echo __LP64__ | (CCOPTS="" $CC_FOR_BUILD -E - 2>/dev/null) |
+		grep -q __LP64__
+	    then
+		HP_ARCH=hppa2.0w
+	    else
+		HP_ARCH=hppa64
+	    fi
+	fi
+	echo "$HP_ARCH"-hp-hpux"$HPUX_REV"
+	exit ;;
+    ia64:HP-UX:*:*)
+	HPUX_REV=`echo "$UNAME_RELEASE"|sed -e 's/[^.]*.[0B]*//'`
+	echo ia64-hp-hpux"$HPUX_REV"
+	exit ;;
+    3050*:HI-UX:*:*)
+	set_cc_for_build
+	sed 's/^	//' << EOF > "$dummy.c"
+	#include <unistd.h>
+	int
+	main ()
+	{
+	  long cpu = sysconf (_SC_CPU_VERSION);
+	  /* The order matters, because CPU_IS_HP_MC68K erroneously returns
+	     true for CPU_PA_RISC1_0.  CPU_IS_PA_RISC returns correct
+	     results, however.  */
+	  if (CPU_IS_PA_RISC (cpu))
+	    {
+	      switch (cpu)
+		{
+		  case CPU_PA_RISC1_0: puts ("hppa1.0-hitachi-hiuxwe2"); break;
+		  case CPU_PA_RISC1_1: puts ("hppa1.1-hitachi-hiuxwe2"); break;
+		  case CPU_PA_RISC2_0: puts ("hppa2.0-hitachi-hiuxwe2"); break;
+		  default: puts ("hppa-hitachi-hiuxwe2"); break;
+		}
+	    }
+	  else if (CPU_IS_HP_MC68K (cpu))
+	    puts ("m68k-hitachi-hiuxwe2");
+	  else puts ("unknown-hitachi-hiuxwe2");
+	  exit (0);
+	}
+EOF
+	$CC_FOR_BUILD -o "$dummy" "$dummy.c" && SYSTEM_NAME=`"$dummy"` &&
+		{ echo "$SYSTEM_NAME"; exit; }
+	echo unknown-hitachi-hiuxwe2
+	exit ;;
+    9000/7??:4.3bsd:*:* | 9000/8?[79]:4.3bsd:*:*)
+	echo hppa1.1-hp-bsd
+	exit ;;
+    9000/8??:4.3bsd:*:*)
+	echo hppa1.0-hp-bsd
+	exit ;;
+    *9??*:MPE/iX:*:* | *3000*:MPE/iX:*:*)
+	echo hppa1.0-hp-mpeix
+	exit ;;
+    hp7??:OSF1:*:* | hp8?[79]:OSF1:*:*)
+	echo hppa1.1-hp-osf
+	exit ;;
+    hp8??:OSF1:*:*)
+	echo hppa1.0-hp-osf
+	exit ;;
+    i*86:OSF1:*:*)
+	if test -x /usr/sbin/sysversion ; then
+	    echo "$UNAME_MACHINE"-unknown-osf1mk
+	else
+	    echo "$UNAME_MACHINE"-unknown-osf1
+	fi
+	exit ;;
+    parisc*:Lites*:*:*)
+	echo hppa1.1-hp-lites
+	exit ;;
+    C1*:ConvexOS:*:* | convex:ConvexOS:C1*:*)
+	echo c1-convex-bsd
+	exit ;;
+    C2*:ConvexOS:*:* | convex:ConvexOS:C2*:*)
+	if getsysinfo -f scalar_acc
+	then echo c32-convex-bsd
+	else echo c2-convex-bsd
+	fi
+	exit ;;
+    C34*:ConvexOS:*:* | convex:ConvexOS:C34*:*)
+	echo c34-convex-bsd
+	exit ;;
+    C38*:ConvexOS:*:* | convex:ConvexOS:C38*:*)
+	echo c38-convex-bsd
+	exit ;;
+    C4*:ConvexOS:*:* | convex:ConvexOS:C4*:*)
+	echo c4-convex-bsd
+	exit ;;
+    CRAY*Y-MP:*:*:*)
+	echo ymp-cray-unicos"$UNAME_RELEASE" | sed -e 's/\.[^.]*$/.X/'
+	exit ;;
+    CRAY*[A-Z]90:*:*:*)
+	echo "$UNAME_MACHINE"-cray-unicos"$UNAME_RELEASE" \
+	| sed -e 's/CRAY.*\([A-Z]90\)/\1/' \
+	      -e y/ABCDEFGHIJKLMNOPQRSTUVWXYZ/abcdefghijklmnopqrstuvwxyz/ \
+	      -e 's/\.[^.]*$/.X/'
+	exit ;;
+    CRAY*TS:*:*:*)
+	echo t90-cray-unicos"$UNAME_RELEASE" | sed -e 's/\.[^.]*$/.X/'
+	exit ;;
+    CRAY*T3E:*:*:*)
+	echo alphaev5-cray-unicosmk"$UNAME_RELEASE" | sed -e 's/\.[^.]*$/.X/'
+	exit ;;
+    CRAY*SV1:*:*:*)
+	echo sv1-cray-unicos"$UNAME_RELEASE" | sed -e 's/\.[^.]*$/.X/'
+	exit ;;
+    *:UNICOS/mp:*:*)
+	echo craynv-cray-unicosmp"$UNAME_RELEASE" | sed -e 's/\.[^.]*$/.X/'
+	exit ;;
+    F30[01]:UNIX_System_V:*:* | F700:UNIX_System_V:*:*)
+	FUJITSU_PROC=`uname -m | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz`
+	FUJITSU_SYS=`uname -p | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz | sed -e 's/\///'`
+	FUJITSU_REL=`echo "$UNAME_RELEASE" | sed -e 's/ /_/'`
+	echo "${FUJITSU_PROC}-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}"
+	exit ;;
+    5000:UNIX_System_V:4.*:*)
+	FUJITSU_SYS=`uname -p | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz | sed -e 's/\///'`
+	FUJITSU_REL=`echo "$UNAME_RELEASE" | tr ABCDEFGHIJKLMNOPQRSTUVWXYZ abcdefghijklmnopqrstuvwxyz | sed -e 's/ /_/'`
+	echo "sparc-fujitsu-${FUJITSU_SYS}${FUJITSU_REL}"
+	exit ;;
+    i*86:BSD/386:*:* | i*86:BSD/OS:*:* | *:Ascend\ Embedded/OS:*:*)
+	echo "$UNAME_MACHINE"-pc-bsdi"$UNAME_RELEASE"
+	exit ;;
+    sparc*:BSD/OS:*:*)
+	echo sparc-unknown-bsdi"$UNAME_RELEASE"
+	exit ;;
+    *:BSD/OS:*:*)
+	echo "$UNAME_MACHINE"-unknown-bsdi"$UNAME_RELEASE"
+	exit ;;
+    arm:FreeBSD:*:*)
+	UNAME_PROCESSOR=`uname -p`
+	set_cc_for_build
+	if echo __ARM_PCS_VFP | $CC_FOR_BUILD -E - 2>/dev/null \
+	    | grep -q __ARM_PCS_VFP
+	then
+	    echo "${UNAME_PROCESSOR}"-unknown-freebsd"`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`"-gnueabi
+	else
+	    echo "${UNAME_PROCESSOR}"-unknown-freebsd"`echo ${UNAME_RELEASE}|sed -e 's/[-(].*//'`"-gnueabihf
+	fi
+	exit ;;
+    *:FreeBSD:*:*)
+	UNAME_PROCESSOR=`/usr/bin/uname -p`
+	case "$UNAME_PROCESSOR" in
+	    amd64)
+		UNAME_PROCESSOR=x86_64 ;;
+	    i386)
+		UNAME_PROCESSOR=i586 ;;
+	esac
+	echo "$UNAME_PROCESSOR"-unknown-freebsd"`echo "$UNAME_RELEASE"|sed -e 's/[-(].*//'`"
+	exit ;;
+    i*:CYGWIN*:*)
+	echo "$UNAME_MACHINE"-pc-cygwin
+	exit ;;
+    *:MINGW64*:*)
+	echo "$UNAME_MACHINE"-pc-mingw64
+	exit ;;
+    *:MINGW*:*)
+	echo "$UNAME_MACHINE"-pc-mingw32
+	exit ;;
+    *:MSYS*:*)
+	echo "$UNAME_MACHINE"-pc-msys
+	exit ;;
+    i*:PW*:*)
+	echo "$UNAME_MACHINE"-pc-pw32
+	exit ;;
+    *:Interix*:*)
+	case "$UNAME_MACHINE" in
+	    x86)
+		echo i586-pc-interix"$UNAME_RELEASE"
+		exit ;;
+	    authenticamd | genuineintel | EM64T)
+		echo x86_64-unknown-interix"$UNAME_RELEASE"
+		exit ;;
+	    IA64)
+		echo ia64-unknown-interix"$UNAME_RELEASE"
+		exit ;;
+	esac ;;
+    i*:UWIN*:*)
+	echo "$UNAME_MACHINE"-pc-uwin
+	exit ;;
+    amd64:CYGWIN*:*:* | x86_64:CYGWIN*:*:*)
+	echo x86_64-pc-cygwin
+	exit ;;
+    prep*:SunOS:5.*:*)
+	echo powerpcle-unknown-solaris2"`echo "$UNAME_RELEASE"|sed -e 's/[^.]*//'`"
+	exit ;;
+    *:GNU:*:*)
+	# the GNU system
+	echo "`echo "$UNAME_MACHINE"|sed -e 's,[-/].*$,,'`-unknown-$LIBC`echo "$UNAME_RELEASE"|sed -e 's,/.*$,,'`"
+	exit ;;
+    *:GNU/*:*:*)
+	# other systems with GNU libc and userland
+	echo "$UNAME_MACHINE-unknown-`echo "$UNAME_SYSTEM" | sed 's,^[^/]*/,,' | tr "[:upper:]" "[:lower:]"``echo "$UNAME_RELEASE"|sed -e 's/[-(].*//'`-$LIBC"
+	exit ;;
+    *:Minix:*:*)
+	echo "$UNAME_MACHINE"-unknown-minix
+	exit ;;
+    aarch64:Linux:*:*)
+	echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"
+	exit ;;
+    aarch64_be:Linux:*:*)
+	UNAME_MACHINE=aarch64_be
+	echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"
+	exit ;;
+    alpha:Linux:*:*)
+	case `sed -n '/^cpu model/s/^.*: \(.*\)/\1/p' /proc/cpuinfo 2>/dev/null` in
+	  EV5)   UNAME_MACHINE=alphaev5 ;;
+	  EV56)  UNAME_MACHINE=alphaev56 ;;
+	  PCA56) UNAME_MACHINE=alphapca56 ;;
+	  PCA57) UNAME_MACHINE=alphapca56 ;;
+	  EV6)   UNAME_MACHINE=alphaev6 ;;
+	  EV67)  UNAME_MACHINE=alphaev67 ;;
+	  EV68*) UNAME_MACHINE=alphaev68 ;;
+	esac
+	objdump --private-headers /bin/sh | grep -q ld.so.1
+	if test "$?" = 0 ; then LIBC=gnulibc1 ; fi
+	echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"
+	exit ;;
+    arc:Linux:*:* | arceb:Linux:*:*)
+	echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"
+	exit ;;
+    arm*:Linux:*:*)
+	set_cc_for_build
+	if echo __ARM_EABI__ | $CC_FOR_BUILD -E - 2>/dev/null \
+	    | grep -q __ARM_EABI__
+	then
+	    echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"
+	else
+	    if echo __ARM_PCS_VFP | $CC_FOR_BUILD -E - 2>/dev/null \
+		| grep -q __ARM_PCS_VFP
+	    then
+		echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"eabi
+	    else
+		echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"eabihf
+	    fi
+	fi
+	exit ;;
+    avr32*:Linux:*:*)
+	echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"
+	exit ;;
+    cris:Linux:*:*)
+	echo "$UNAME_MACHINE"-axis-linux-"$LIBC"
+	exit ;;
+    crisv32:Linux:*:*)
+	echo "$UNAME_MACHINE"-axis-linux-"$LIBC"
+	exit ;;
+    e2k:Linux:*:*)
+	echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"
+	exit ;;
+    frv:Linux:*:*)
+	echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"
+	exit ;;
+    hexagon:Linux:*:*)
+	echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"
+	exit ;;
+    i*86:Linux:*:*)
+	echo "$UNAME_MACHINE"-pc-linux-"$LIBC"
+	exit ;;
+    ia64:Linux:*:*)
+	echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"
+	exit ;;
+    k1om:Linux:*:*)
+	echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"
+	exit ;;
+    m32r*:Linux:*:*)
+	echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"
+	exit ;;
+    m68*:Linux:*:*)
+	echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"
+	exit ;;
+    mips:Linux:*:* | mips64:Linux:*:*)
+	set_cc_for_build
+	IS_GLIBC=0
+	test x"${LIBC}" = xgnu && IS_GLIBC=1
+	sed 's/^	//' << EOF > "$dummy.c"
+	#undef CPU
+	#undef mips
+	#undef mipsel
+	#undef mips64
+	#undef mips64el
+	#if ${IS_GLIBC} && defined(_ABI64)
+	LIBCABI=gnuabi64
+	#else
+	#if ${IS_GLIBC} && defined(_ABIN32)
+	LIBCABI=gnuabin32
+	#else
+	LIBCABI=${LIBC}
+	#endif
+	#endif
+
+	#if ${IS_GLIBC} && defined(__mips64) && defined(__mips_isa_rev) && __mips_isa_rev>=6
+	CPU=mipsisa64r6
+	#else
+	#if ${IS_GLIBC} && !defined(__mips64) && defined(__mips_isa_rev) && __mips_isa_rev>=6
+	CPU=mipsisa32r6
+	#else
+	#if defined(__mips64)
+	CPU=mips64
+	#else
+	CPU=mips
+	#endif
+	#endif
+	#endif
+
+	#if defined(__MIPSEL__) || defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL)
+	MIPS_ENDIAN=el
+	#else
+	#if defined(__MIPSEB__) || defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB)
+	MIPS_ENDIAN=
+	#else
+	MIPS_ENDIAN=
+	#endif
+	#endif
+EOF
+	eval "`$CC_FOR_BUILD -E "$dummy.c" 2>/dev/null | grep '^CPU\|^MIPS_ENDIAN\|^LIBCABI'`"
+	test "x$CPU" != x && { echo "$CPU${MIPS_ENDIAN}-unknown-linux-$LIBCABI"; exit; }
+	;;
+    mips64el:Linux:*:*)
+	echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"
+	exit ;;
+    openrisc*:Linux:*:*)
+	echo or1k-unknown-linux-"$LIBC"
+	exit ;;
+    or32:Linux:*:* | or1k*:Linux:*:*)
+	echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"
+	exit ;;
+    padre:Linux:*:*)
+	echo sparc-unknown-linux-"$LIBC"
+	exit ;;
+    parisc64:Linux:*:* | hppa64:Linux:*:*)
+	echo hppa64-unknown-linux-"$LIBC"
+	exit ;;
+    parisc:Linux:*:* | hppa:Linux:*:*)
+	# Look for CPU level
+	case `grep '^cpu[^a-z]*:' /proc/cpuinfo 2>/dev/null | cut -d' ' -f2` in
+	  PA7*) echo hppa1.1-unknown-linux-"$LIBC" ;;
+	  PA8*) echo hppa2.0-unknown-linux-"$LIBC" ;;
+	  *)    echo hppa-unknown-linux-"$LIBC" ;;
+	esac
+	exit ;;
+    ppc64:Linux:*:*)
+	echo powerpc64-unknown-linux-"$LIBC"
+	exit ;;
+    ppc:Linux:*:*)
+	echo powerpc-unknown-linux-"$LIBC"
+	exit ;;
+    ppc64le:Linux:*:*)
+	echo powerpc64le-unknown-linux-"$LIBC"
+	exit ;;
+    ppcle:Linux:*:*)
+	echo powerpcle-unknown-linux-"$LIBC"
+	exit ;;
+    riscv32:Linux:*:* | riscv64:Linux:*:*)
+	echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"
+	exit ;;
+    s390:Linux:*:* | s390x:Linux:*:*)
+	echo "$UNAME_MACHINE"-ibm-linux-"$LIBC"
+	exit ;;
+    sh64*:Linux:*:*)
+	echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"
+	exit ;;
+    sh*:Linux:*:*)
+	echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"
+	exit ;;
+    sparc:Linux:*:* | sparc64:Linux:*:*)
+	echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"
+	exit ;;
+    tile*:Linux:*:*)
+	echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"
+	exit ;;
+    vax:Linux:*:*)
+	echo "$UNAME_MACHINE"-dec-linux-"$LIBC"
+	exit ;;
+    x86_64:Linux:*:*)
+	set_cc_for_build
+	LIBCABI=$LIBC
+	if test "$CC_FOR_BUILD" != no_compiler_found; then
+	    if (echo '#ifdef __ILP32__'; echo IS_X32; echo '#endif') | \
+		(CCOPTS="" $CC_FOR_BUILD -E - 2>/dev/null) | \
+		grep IS_X32 >/dev/null
+	    then
+		LIBCABI="$LIBC"x32
+	    fi
+	fi
+	echo "$UNAME_MACHINE"-pc-linux-"$LIBCABI"
+	exit ;;
+    xtensa*:Linux:*:*)
+	echo "$UNAME_MACHINE"-unknown-linux-"$LIBC"
+	exit ;;
+    i*86:DYNIX/ptx:4*:*)
+	# ptx 4.0 does uname -s correctly, with DYNIX/ptx in there.
+	# earlier versions are messed up and put the nodename in both
+	# sysname and nodename.
+	echo i386-sequent-sysv4
+	exit ;;
+    i*86:UNIX_SV:4.2MP:2.*)
+	# Unixware is an offshoot of SVR4, but it has its own version
+	# number series starting with 2...
+	# I am not positive that other SVR4 systems won't match this,
+	# I just have to hope.  -- rms.
+	# Use sysv4.2uw... so that sysv4* matches it.
+	echo "$UNAME_MACHINE"-pc-sysv4.2uw"$UNAME_VERSION"
+	exit ;;
+    i*86:OS/2:*:*)
+	# If we were able to find `uname', then EMX Unix compatibility
+	# is probably installed.
+	echo "$UNAME_MACHINE"-pc-os2-emx
+	exit ;;
+    i*86:XTS-300:*:STOP)
+	echo "$UNAME_MACHINE"-unknown-stop
+	exit ;;
+    i*86:atheos:*:*)
+	echo "$UNAME_MACHINE"-unknown-atheos
+	exit ;;
+    i*86:syllable:*:*)
+	echo "$UNAME_MACHINE"-pc-syllable
+	exit ;;
+    i*86:LynxOS:2.*:* | i*86:LynxOS:3.[01]*:* | i*86:LynxOS:4.[02]*:*)
+	echo i386-unknown-lynxos"$UNAME_RELEASE"
+	exit ;;
+    i*86:*DOS:*:*)
+	echo "$UNAME_MACHINE"-pc-msdosdjgpp
+	exit ;;
+    i*86:*:4.*:*)
+	UNAME_REL=`echo "$UNAME_RELEASE" | sed 's/\/MP$//'`
+	if grep Novell /usr/include/link.h >/dev/null 2>/dev/null; then
+		echo "$UNAME_MACHINE"-univel-sysv"$UNAME_REL"
+	else
+		echo "$UNAME_MACHINE"-pc-sysv"$UNAME_REL"
+	fi
+	exit ;;
+    i*86:*:5:[678]*)
+	# UnixWare 7.x, OpenUNIX and OpenServer 6.
+	case `/bin/uname -X | grep "^Machine"` in
+	    *486*)	     UNAME_MACHINE=i486 ;;
+	    *Pentium)	     UNAME_MACHINE=i586 ;;
+	    *Pent*|*Celeron) UNAME_MACHINE=i686 ;;
+	esac
+	echo "$UNAME_MACHINE-unknown-sysv${UNAME_RELEASE}${UNAME_SYSTEM}${UNAME_VERSION}"
+	exit ;;
+    i*86:*:3.2:*)
+	if test -f /usr/options/cb.name; then
+		UNAME_REL=`sed -n 's/.*Version //p' </usr/options/cb.name`
+		echo "$UNAME_MACHINE"-pc-isc"$UNAME_REL"
+	elif /bin/uname -X 2>/dev/null >/dev/null ; then
+		UNAME_REL=`(/bin/uname -X|grep Release|sed -e 's/.*= //')`
+		(/bin/uname -X|grep i80486 >/dev/null) && UNAME_MACHINE=i486
+		(/bin/uname -X|grep '^Machine.*Pentium' >/dev/null) \
+			&& UNAME_MACHINE=i586
+		(/bin/uname -X|grep '^Machine.*Pent *II' >/dev/null) \
+			&& UNAME_MACHINE=i686
+		(/bin/uname -X|grep '^Machine.*Pentium Pro' >/dev/null) \
+			&& UNAME_MACHINE=i686
+		echo "$UNAME_MACHINE"-pc-sco"$UNAME_REL"
+	else
+		echo "$UNAME_MACHINE"-pc-sysv32
+	fi
+	exit ;;
+    pc:*:*:*)
+	# Left here for compatibility:
+	# uname -m prints for DJGPP always 'pc', but it prints nothing about
+	# the processor, so we play safe by assuming i586.
+	# Note: whatever this is, it MUST be the same as what config.sub
+	# prints for the "djgpp" host, or else GDB configure will decide that
+	# this is a cross-build.
+	echo i586-pc-msdosdjgpp
+	exit ;;
+    Intel:Mach:3*:*)
+	echo i386-pc-mach3
+	exit ;;
+    paragon:*:*:*)
+	echo i860-intel-osf1
+	exit ;;
+    i860:*:4.*:*) # i860-SVR4
+	if grep Stardent /usr/include/sys/uadmin.h >/dev/null 2>&1 ; then
+	  echo i860-stardent-sysv"$UNAME_RELEASE" # Stardent Vistra i860-SVR4
+	else # Add other i860-SVR4 vendors below as they are discovered.
+	  echo i860-unknown-sysv"$UNAME_RELEASE"  # Unknown i860-SVR4
+	fi
+	exit ;;
+    mini*:CTIX:SYS*5:*)
+	# "miniframe"
+	echo m68010-convergent-sysv
+	exit ;;
+    mc68k:UNIX:SYSTEM5:3.51m)
+	echo m68k-convergent-sysv
+	exit ;;
+    M680?0:D-NIX:5.3:*)
+	echo m68k-diab-dnix
+	exit ;;
+    M68*:*:R3V[5678]*:*)
+	test -r /sysV68 && { echo 'm68k-motorola-sysv'; exit; } ;;
+    3[345]??:*:4.0:3.0 | 3[34]??A:*:4.0:3.0 | 3[34]??,*:*:4.0:3.0 | 3[34]??/*:*:4.0:3.0 | 4400:*:4.0:3.0 | 4850:*:4.0:3.0 | SKA40:*:4.0:3.0 | SDS2:*:4.0:3.0 | SHG2:*:4.0:3.0 | S7501*:*:4.0:3.0)
+	OS_REL=''
+	test -r /etc/.relid \
+	&& OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid`
+	/bin/uname -p 2>/dev/null | grep 86 >/dev/null \
+	  && { echo i486-ncr-sysv4.3"$OS_REL"; exit; }
+	/bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \
+	  && { echo i586-ncr-sysv4.3"$OS_REL"; exit; } ;;
+    3[34]??:*:4.0:* | 3[34]??,*:*:4.0:*)
+	/bin/uname -p 2>/dev/null | grep 86 >/dev/null \
+	  && { echo i486-ncr-sysv4; exit; } ;;
+    NCR*:*:4.2:* | MPRAS*:*:4.2:*)
+	OS_REL='.3'
+	test -r /etc/.relid \
+	    && OS_REL=.`sed -n 's/[^ ]* [^ ]* \([0-9][0-9]\).*/\1/p' < /etc/.relid`
+	/bin/uname -p 2>/dev/null | grep 86 >/dev/null \
+	    && { echo i486-ncr-sysv4.3"$OS_REL"; exit; }
+	/bin/uname -p 2>/dev/null | /bin/grep entium >/dev/null \
+	    && { echo i586-ncr-sysv4.3"$OS_REL"; exit; }
+	/bin/uname -p 2>/dev/null | /bin/grep pteron >/dev/null \
+	    && { echo i586-ncr-sysv4.3"$OS_REL"; exit; } ;;
+    m68*:LynxOS:2.*:* | m68*:LynxOS:3.0*:*)
+	echo m68k-unknown-lynxos"$UNAME_RELEASE"
+	exit ;;
+    mc68030:UNIX_System_V:4.*:*)
+	echo m68k-atari-sysv4
+	exit ;;
+    TSUNAMI:LynxOS:2.*:*)
+	echo sparc-unknown-lynxos"$UNAME_RELEASE"
+	exit ;;
+    rs6000:LynxOS:2.*:*)
+	echo rs6000-unknown-lynxos"$UNAME_RELEASE"
+	exit ;;
+    PowerPC:LynxOS:2.*:* | PowerPC:LynxOS:3.[01]*:* | PowerPC:LynxOS:4.[02]*:*)
+	echo powerpc-unknown-lynxos"$UNAME_RELEASE"
+	exit ;;
+    SM[BE]S:UNIX_SV:*:*)
+	echo mips-dde-sysv"$UNAME_RELEASE"
+	exit ;;
+    RM*:ReliantUNIX-*:*:*)
+	echo mips-sni-sysv4
+	exit ;;
+    RM*:SINIX-*:*:*)
+	echo mips-sni-sysv4
+	exit ;;
+    *:SINIX-*:*:*)
+	if uname -p 2>/dev/null >/dev/null ; then
+		UNAME_MACHINE=`(uname -p) 2>/dev/null`
+		echo "$UNAME_MACHINE"-sni-sysv4
+	else
+		echo ns32k-sni-sysv
+	fi
+	exit ;;
+    PENTIUM:*:4.0*:*)	# Unisys `ClearPath HMP IX 4000' SVR4/MP effort
+			# says <Richard.M.Bartel@ccMail.Census.GOV>
+	echo i586-unisys-sysv4
+	exit ;;
+    *:UNIX_System_V:4*:FTX*)
+	# From Gerald Hewes <hewes@openmarket.com>.
+	# How about differentiating between stratus architectures? -djm
+	echo hppa1.1-stratus-sysv4
+	exit ;;
+    *:*:*:FTX*)
+	# From seanf@swdc.stratus.com.
+	echo i860-stratus-sysv4
+	exit ;;
+    i*86:VOS:*:*)
+	# From Paul.Green@stratus.com.
+	echo "$UNAME_MACHINE"-stratus-vos
+	exit ;;
+    *:VOS:*:*)
+	# From Paul.Green@stratus.com.
+	echo hppa1.1-stratus-vos
+	exit ;;
+    mc68*:A/UX:*:*)
+	echo m68k-apple-aux"$UNAME_RELEASE"
+	exit ;;
+    news*:NEWS-OS:6*:*)
+	echo mips-sony-newsos6
+	exit ;;
+    R[34]000:*System_V*:*:* | R4000:UNIX_SYSV:*:* | R*000:UNIX_SV:*:*)
+	if test -d /usr/nec; then
+		echo mips-nec-sysv"$UNAME_RELEASE"
+	else
+		echo mips-unknown-sysv"$UNAME_RELEASE"
+	fi
+	exit ;;
+    BeBox:BeOS:*:*)	# BeOS running on hardware made by Be, PPC only.
+	echo powerpc-be-beos
+	exit ;;
+    BeMac:BeOS:*:*)	# BeOS running on Mac or Mac clone, PPC only.
+	echo powerpc-apple-beos
+	exit ;;
+    BePC:BeOS:*:*)	# BeOS running on Intel PC compatible.
+	echo i586-pc-beos
+	exit ;;
+    BePC:Haiku:*:*)	# Haiku running on Intel PC compatible.
+	echo i586-pc-haiku
+	exit ;;
+    x86_64:Haiku:*:*)
+	echo x86_64-unknown-haiku
+	exit ;;
+    SX-4:SUPER-UX:*:*)
+	echo sx4-nec-superux"$UNAME_RELEASE"
+	exit ;;
+    SX-5:SUPER-UX:*:*)
+	echo sx5-nec-superux"$UNAME_RELEASE"
+	exit ;;
+    SX-6:SUPER-UX:*:*)
+	echo sx6-nec-superux"$UNAME_RELEASE"
+	exit ;;
+    SX-7:SUPER-UX:*:*)
+	echo sx7-nec-superux"$UNAME_RELEASE"
+	exit ;;
+    SX-8:SUPER-UX:*:*)
+	echo sx8-nec-superux"$UNAME_RELEASE"
+	exit ;;
+    SX-8R:SUPER-UX:*:*)
+	echo sx8r-nec-superux"$UNAME_RELEASE"
+	exit ;;
+    SX-ACE:SUPER-UX:*:*)
+	echo sxace-nec-superux"$UNAME_RELEASE"
+	exit ;;
+    Power*:Rhapsody:*:*)
+	echo powerpc-apple-rhapsody"$UNAME_RELEASE"
+	exit ;;
+    *:Rhapsody:*:*)
+	echo "$UNAME_MACHINE"-apple-rhapsody"$UNAME_RELEASE"
+	exit ;;
+    arm64:Darwin:*:*)
+	echo aarch64-apple-darwin"$UNAME_RELEASE"
+	exit ;;
+    *:Darwin:*:*)
+	UNAME_PROCESSOR=`uname -p`
+	case $UNAME_PROCESSOR in
+	    unknown) UNAME_PROCESSOR=powerpc ;;
+	esac
+	if command -v xcode-select > /dev/null 2> /dev/null && \
+		! xcode-select --print-path > /dev/null 2> /dev/null ; then
+	    # Avoid executing cc if there is no toolchain installed as
+	    # cc will be a stub that puts up a graphical alert
+	    # prompting the user to install developer tools.
+	    CC_FOR_BUILD=no_compiler_found
+	else
+	    set_cc_for_build
+	fi
+	if test "$CC_FOR_BUILD" != no_compiler_found; then
+	    if (echo '#ifdef __LP64__'; echo IS_64BIT_ARCH; echo '#endif') | \
+		   (CCOPTS="" $CC_FOR_BUILD -E - 2>/dev/null) | \
+		   grep IS_64BIT_ARCH >/dev/null
+	    then
+		case $UNAME_PROCESSOR in
+		    i386) UNAME_PROCESSOR=x86_64 ;;
+		    powerpc) UNAME_PROCESSOR=powerpc64 ;;
+		esac
+	    fi
+	    # On 10.4-10.6 one might compile for PowerPC via gcc -arch ppc
+	    if (echo '#ifdef __POWERPC__'; echo IS_PPC; echo '#endif') | \
+		   (CCOPTS="" $CC_FOR_BUILD -E - 2>/dev/null) | \
+		   grep IS_PPC >/dev/null
+	    then
+		UNAME_PROCESSOR=powerpc
+	    fi
+	elif test "$UNAME_PROCESSOR" = i386 ; then
+	    # uname -m returns i386 or x86_64
+	    UNAME_PROCESSOR=$UNAME_MACHINE
+	fi
+	echo "$UNAME_PROCESSOR"-apple-darwin"$UNAME_RELEASE"
+	exit ;;
+    *:procnto*:*:* | *:QNX:[0123456789]*:*)
+	UNAME_PROCESSOR=`uname -p`
+	if test "$UNAME_PROCESSOR" = x86; then
+		UNAME_PROCESSOR=i386
+		UNAME_MACHINE=pc
+	fi
+	echo "$UNAME_PROCESSOR"-"$UNAME_MACHINE"-nto-qnx"$UNAME_RELEASE"
+	exit ;;
+    *:QNX:*:4*)
+	echo i386-pc-qnx
+	exit ;;
+    NEO-*:NONSTOP_KERNEL:*:*)
+	echo neo-tandem-nsk"$UNAME_RELEASE"
+	exit ;;
+    NSE-*:NONSTOP_KERNEL:*:*)
+	echo nse-tandem-nsk"$UNAME_RELEASE"
+	exit ;;
+    NSR-*:NONSTOP_KERNEL:*:*)
+	echo nsr-tandem-nsk"$UNAME_RELEASE"
+	exit ;;
+    NSV-*:NONSTOP_KERNEL:*:*)
+	echo nsv-tandem-nsk"$UNAME_RELEASE"
+	exit ;;
+    NSX-*:NONSTOP_KERNEL:*:*)
+	echo nsx-tandem-nsk"$UNAME_RELEASE"
+	exit ;;
+    *:NonStop-UX:*:*)
+	echo mips-compaq-nonstopux
+	exit ;;
+    BS2000:POSIX*:*:*)
+	echo bs2000-siemens-sysv
+	exit ;;
+    DS/*:UNIX_System_V:*:*)
+	echo "$UNAME_MACHINE"-"$UNAME_SYSTEM"-"$UNAME_RELEASE"
+	exit ;;
+    *:Plan9:*:*)
+	# "uname -m" is not consistent, so use $cputype instead. 386
+	# is converted to i386 for consistency with other x86
+	# operating systems.
+	# shellcheck disable=SC2154
+	if test "$cputype" = 386; then
+	    UNAME_MACHINE=i386
+	else
+	    UNAME_MACHINE="$cputype"
+	fi
+	echo "$UNAME_MACHINE"-unknown-plan9
+	exit ;;
+    *:TOPS-10:*:*)
+	echo pdp10-unknown-tops10
+	exit ;;
+    *:TENEX:*:*)
+	echo pdp10-unknown-tenex
+	exit ;;
+    KS10:TOPS-20:*:* | KL10:TOPS-20:*:* | TYPE4:TOPS-20:*:*)
+	echo pdp10-dec-tops20
+	exit ;;
+    XKL-1:TOPS-20:*:* | TYPE5:TOPS-20:*:*)
+	echo pdp10-xkl-tops20
+	exit ;;
+    *:TOPS-20:*:*)
+	echo pdp10-unknown-tops20
+	exit ;;
+    *:ITS:*:*)
+	echo pdp10-unknown-its
+	exit ;;
+    SEI:*:*:SEIUX)
+	echo mips-sei-seiux"$UNAME_RELEASE"
+	exit ;;
+    *:DragonFly:*:*)
+	echo "$UNAME_MACHINE"-unknown-dragonfly"`echo "$UNAME_RELEASE"|sed -e 's/[-(].*//'`"
+	exit ;;
+    *:*VMS:*:*)
+	UNAME_MACHINE=`(uname -p) 2>/dev/null`
+	case "$UNAME_MACHINE" in
+	    A*) echo alpha-dec-vms ; exit ;;
+	    I*) echo ia64-dec-vms ; exit ;;
+	    V*) echo vax-dec-vms ; exit ;;
+	esac ;;
+    *:XENIX:*:SysV)
+	echo i386-pc-xenix
+	exit ;;
+    i*86:skyos:*:*)
+	echo "$UNAME_MACHINE"-pc-skyos"`echo "$UNAME_RELEASE" | sed -e 's/ .*$//'`"
+	exit ;;
+    i*86:rdos:*:*)
+	echo "$UNAME_MACHINE"-pc-rdos
+	exit ;;
+    i*86:AROS:*:*)
+	echo "$UNAME_MACHINE"-pc-aros
+	exit ;;
+    x86_64:VMkernel:*:*)
+	echo "$UNAME_MACHINE"-unknown-esx
+	exit ;;
+    amd64:Isilon\ OneFS:*:*)
+	echo x86_64-unknown-onefs
+	exit ;;
+    *:Unleashed:*:*)
+	echo "$UNAME_MACHINE"-unknown-unleashed"$UNAME_RELEASE"
+	exit ;;
+esac
+
+# No uname command or uname output not recognized.
+set_cc_for_build
+cat > "$dummy.c" <<EOF
+#ifdef _SEQUENT_
+#include <sys/types.h>
+#include <sys/utsname.h>
+#endif
+#if defined(ultrix) || defined(_ultrix) || defined(__ultrix) || defined(__ultrix__)
+#if defined (vax) || defined (__vax) || defined (__vax__) || defined(mips) || defined(__mips) || defined(__mips__) || defined(MIPS) || defined(__MIPS__)
+#include <signal.h>
+#if defined(_SIZE_T_) || defined(SIGLOST)
+#include <sys/utsname.h>
+#endif
+#endif
+#endif
+main ()
+{
+#if defined (sony)
+#if defined (MIPSEB)
+  /* BFD wants "bsd" instead of "newsos".  Perhaps BFD should be changed,
+     I don't know....  */
+  printf ("mips-sony-bsd\n"); exit (0);
+#else
+#include <sys/param.h>
+  printf ("m68k-sony-newsos%s\n",
+#ifdef NEWSOS4
+  "4"
+#else
+  ""
+#endif
+  ); exit (0);
+#endif
+#endif
+
+#if defined (NeXT)
+#if !defined (__ARCHITECTURE__)
+#define __ARCHITECTURE__ "m68k"
+#endif
+  int version;
+  version=`(hostinfo | sed -n 's/.*NeXT Mach \([0-9]*\).*/\1/p') 2>/dev/null`;
+  if (version < 4)
+    printf ("%s-next-nextstep%d\n", __ARCHITECTURE__, version);
+  else
+    printf ("%s-next-openstep%d\n", __ARCHITECTURE__, version);
+  exit (0);
+#endif
+
+#if defined (MULTIMAX) || defined (n16)
+#if defined (UMAXV)
+  printf ("ns32k-encore-sysv\n"); exit (0);
+#else
+#if defined (CMU)
+  printf ("ns32k-encore-mach\n"); exit (0);
+#else
+  printf ("ns32k-encore-bsd\n"); exit (0);
+#endif
+#endif
+#endif
+
+#if defined (__386BSD__)
+  printf ("i386-pc-bsd\n"); exit (0);
+#endif
+
+#if defined (sequent)
+#if defined (i386)
+  printf ("i386-sequent-dynix\n"); exit (0);
+#endif
+#if defined (ns32000)
+  printf ("ns32k-sequent-dynix\n"); exit (0);
+#endif
+#endif
+
+#if defined (_SEQUENT_)
+  struct utsname un;
+
+  uname(&un);
+  if (strncmp(un.version, "V2", 2) == 0) {
+    printf ("i386-sequent-ptx2\n"); exit (0);
+  }
+  if (strncmp(un.version, "V1", 2) == 0) { /* XXX is V1 correct? */
+    printf ("i386-sequent-ptx1\n"); exit (0);
+  }
+  printf ("i386-sequent-ptx\n"); exit (0);
+#endif
+
+#if defined (vax)
+#if !defined (ultrix)
+#include <sys/param.h>
+#if defined (BSD)
+#if BSD == 43
+  printf ("vax-dec-bsd4.3\n"); exit (0);
+#else
+#if BSD == 199006
+  printf ("vax-dec-bsd4.3reno\n"); exit (0);
+#else
+  printf ("vax-dec-bsd\n"); exit (0);
+#endif
+#endif
+#else
+  printf ("vax-dec-bsd\n"); exit (0);
+#endif
+#else
+#if defined(_SIZE_T_) || defined(SIGLOST)
+  struct utsname un;
+  uname (&un);
+  printf ("vax-dec-ultrix%s\n", un.release); exit (0);
+#else
+  printf ("vax-dec-ultrix\n"); exit (0);
+#endif
+#endif
+#endif
+#if defined(ultrix) || defined(_ultrix) || defined(__ultrix) || defined(__ultrix__)
+#if defined(mips) || defined(__mips) || defined(__mips__) || defined(MIPS) || defined(__MIPS__)
+#if defined(_SIZE_T_) || defined(SIGLOST)
+  struct utsname *un;
+  uname (&un);
+  printf ("mips-dec-ultrix%s\n", un.release); exit (0);
+#else
+  printf ("mips-dec-ultrix\n"); exit (0);
+#endif
+#endif
+#endif
+
+#if defined (alliant) && defined (i860)
+  printf ("i860-alliant-bsd\n"); exit (0);
+#endif
+
+  exit (1);
+}
+EOF
+
+$CC_FOR_BUILD -o "$dummy" "$dummy.c" 2>/dev/null && SYSTEM_NAME=`$dummy` &&
+	{ echo "$SYSTEM_NAME"; exit; }
+
+# Apollos put the system type in the environment.
+test -d /usr/apollo && { echo "$ISP-apollo-$SYSTYPE"; exit; }
+
+echo "$0: unable to guess system type" >&2
+
+case "$UNAME_MACHINE:$UNAME_SYSTEM" in
+    mips:Linux | mips64:Linux)
+	# If we got here on MIPS GNU/Linux, output extra information.
+	cat >&2 <<EOF
+
+NOTE: MIPS GNU/Linux systems require a C compiler to fully recognize
+the system type. Please install a C compiler and try again.
+EOF
+	;;
+esac
+
+cat >&2 <<EOF
+
+This script (version $timestamp), has failed to recognize the
+operating system you are using. If your script is old, overwrite *all*
+copies of config.guess and config.sub with the latest versions from:
+
+  https://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.guess
+and
+  https://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.sub
+EOF
+
+year=`echo $timestamp | sed 's,-.*,,'`
+# shellcheck disable=SC2003
+if test "`expr "\`date +%Y\`" - "$year"`" -lt 3 ; then
+   cat >&2 <<EOF
+
+If $0 has already been updated, send the following data and any
+information you think might be pertinent to config-patches@gnu.org to
+provide the necessary information to handle your system.
+
+config.guess timestamp = $timestamp
+
+uname -m = `(uname -m) 2>/dev/null || echo unknown`
+uname -r = `(uname -r) 2>/dev/null || echo unknown`
+uname -s = `(uname -s) 2>/dev/null || echo unknown`
+uname -v = `(uname -v) 2>/dev/null || echo unknown`
+
+/usr/bin/uname -p = `(/usr/bin/uname -p) 2>/dev/null`
+/bin/uname -X     = `(/bin/uname -X) 2>/dev/null`
+
+hostinfo               = `(hostinfo) 2>/dev/null`
+/bin/universe          = `(/bin/universe) 2>/dev/null`
+/usr/bin/arch -k       = `(/usr/bin/arch -k) 2>/dev/null`
+/bin/arch              = `(/bin/arch) 2>/dev/null`
+/usr/bin/oslevel       = `(/usr/bin/oslevel) 2>/dev/null`
+/usr/convex/getsysinfo = `(/usr/convex/getsysinfo) 2>/dev/null`
+
+UNAME_MACHINE = "$UNAME_MACHINE"
+UNAME_RELEASE = "$UNAME_RELEASE"
+UNAME_SYSTEM  = "$UNAME_SYSTEM"
+UNAME_VERSION = "$UNAME_VERSION"
+EOF
+fi
+
+exit 1
+
+# Local variables:
+# eval: (add-hook 'before-save-hook 'time-stamp)
+# time-stamp-start: "timestamp='"
+# time-stamp-format: "%:y-%02m-%02d"
+# time-stamp-end: "'"
+# End:
diff --git a/depend/zcash/depends/config.site.in b/depend/zcash/depends/config.site.in
new file mode 100644
index 000000000..ba96d9f45
--- /dev/null
+++ b/depend/zcash/depends/config.site.in
@@ -0,0 +1,78 @@
+depends_prefix="`dirname ${ac_site_file}`/.."
+
+cross_compiling=maybe
+host_alias=@HOST@
+ac_tool_prefix=${host_alias}-
+
+if test -z $with_boost; then
+  with_boost=$depends_prefix
+fi
+
+
+if test -z $enable_wallet && test -n "@no_wallet@"; then
+  enable_wallet=no
+fi
+
+RUST_TARGET="@rust_target@"
+RUST_VENDORED_SOURCES="$depends_prefix/vendored-sources"
+
+if test x@host_os@ = xdarwin; then
+  BREW=no
+  PORT=no
+fi
+
+PATH=$depends_prefix/native/bin:$PATH
+PKG_CONFIG="`which pkg-config` --static"
+
+# These two need to remain exported because pkg-config does not see them
+# otherwise. That means they must be unexported at the end of configure.ac to
+# avoid ruining the cache. Sigh.
+
+export PKG_CONFIG_LIBDIR=$depends_prefix/lib/pkgconfig
+export PKG_CONFIG_PATH=$depends_prefix/share/pkgconfig
+
+CPPFLAGS="-I$depends_prefix/include/ $CPPFLAGS"
+
+if test x@host_os@ = xfreebsd; then
+  LDFLAGS="-L$depends_prefix/lib $LDFLAGS -static-libstdc++ -lcxxrt"
+else
+  LDFLAGS="-L$depends_prefix/lib $LDFLAGS -static-libstdc++ -lc++abi"
+fi
+
+CC="@CC@"
+CXX="@CXX@"
+OBJC="${CC}"
+OBJCXX="${CXX}"
+CCACHE=$depends_prefix/native/bin/ccache
+
+if test -n "@AR@"; then
+  AR=@AR@
+  ac_cv_path_ac_pt_AR=${AR}
+fi
+
+if test -n "@RANLIB@"; then
+  RANLIB=@RANLIB@
+  ac_cv_path_ac_pt_RANLIB=${RANLIB}
+fi
+
+if test -n "@NM@"; then
+  NM=@NM@
+  ac_cv_path_ac_pt_NM=${NM}
+fi
+
+if test -n "@debug@"; then
+  enable_reduce_exports=no
+fi
+
+if test -n "@CFLAGS@"; then
+  CFLAGS="@CFLAGS@ $CFLAGS"
+fi
+if test -n "@CXXFLAGS@"; then
+  CXXFLAGS="@CXXFLAGS@ $CXXFLAGS"
+fi
+if test -n "@CPPFLAGS@"; then
+  CPPFLAGS="@CPPFLAGS@ $CPPFLAGS"
+fi
+if test -n "@LDFLAGS@"; then
+  LDFLAGS="@LDFLAGS@ $LDFLAGS"
+fi
diff --git a/depend/zcash/depends/config.sub b/depend/zcash/depends/config.sub
new file mode 100755
index 000000000..780c2bbaa
--- /dev/null
+++ b/depend/zcash/depends/config.sub
@@ -0,0 +1,1845 @@
+#! /bin/sh
+# Configuration validation subroutine script.
+#   Copyright 1992-2020 Free Software Foundation, Inc.
+
+timestamp='2020-09-08'
+
+# This file is free software; you can redistribute it and/or modify it
+# under the terms of the GNU General Public License as published by
+# the Free Software Foundation; either version 3 of the License, or
+# (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program; if not, see <https://www.gnu.org/licenses/>.
+#
+# As a special exception to the GNU General Public License, if you
+# distribute this file as part of a program that contains a
+# configuration script generated by Autoconf, you may include it under
+# the same distribution terms that you use for the rest of that
+# program.  This Exception is an additional permission under section 7
+# of the GNU General Public License, version 3 ("GPLv3").
+
+
+# Please send patches to <config-patches@gnu.org>.
+#
+# Configuration subroutine to validate and canonicalize a configuration type.
+# Supply the specified configuration type as an argument.
+# If it is invalid, we print an error message on stderr and exit with code 1.
+# Otherwise, we print the canonical config type on stdout and succeed.
+
+# You can get the latest version of this script from:
+# https://git.savannah.gnu.org/gitweb/?p=config.git;a=blob_plain;f=config.sub
+
+# This file is supposed to be the same for all GNU packages
+# and recognize all the CPU types, system types and aliases
+# that are meaningful with *any* GNU software.
+# Each package is responsible for reporting which valid configurations
+# it does not support.  The user should be able to distinguish
+# a failure to support a valid configuration from a meaningless
+# configuration.
+
+# The goal of this file is to map all the various variations of a given
+# machine specification into a single specification in the form:
+#	CPU_TYPE-MANUFACTURER-OPERATING_SYSTEM
+# or in some cases, the newer four-part form:
+#	CPU_TYPE-MANUFACTURER-KERNEL-OPERATING_SYSTEM
+# It is wrong to echo any other type of specification.
+
+me=`echo "$0" | sed -e 's,.*/,,'`
+
+usage="\
+Usage: $0 [OPTION] CPU-MFR-OPSYS or ALIAS
+
+Canonicalize a configuration name.
+
+Options:
+  -h, --help         print this help, then exit
+  -t, --time-stamp   print date of last modification, then exit
+  -v, --version      print version number, then exit
+
+Report bugs and patches to <config-patches@gnu.org>."
+
+version="\
+GNU config.sub ($timestamp)
+
+Copyright 1992-2020 Free Software Foundation, Inc.
+
+This is free software; see the source for copying conditions.  There is NO
+warranty; not even for MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE."
+
+help="
+Try \`$me --help' for more information."
+
+# Parse command line
+while test $# -gt 0 ; do
+  case $1 in
+    --time-stamp | --time* | -t )
+       echo "$timestamp" ; exit ;;
+    --version | -v )
+       echo "$version" ; exit ;;
+    --help | --h* | -h )
+       echo "$usage"; exit ;;
+    -- )     # Stop option processing
+       shift; break ;;
+    - )	# Use stdin as input.
+       break ;;
+    -* )
+       echo "$me: invalid option $1$help" >&2
+       exit 1 ;;
+
+    *local*)
+       # First pass through any local machine types.
+       echo "$1"
+       exit ;;
+
+    * )
+       break ;;
+  esac
+done
+
+case $# in
+ 0) echo "$me: missing argument$help" >&2
+    exit 1;;
+ 1) ;;
+ *) echo "$me: too many arguments$help" >&2
+    exit 1;;
+esac
+
+# Split fields of configuration type
+# shellcheck disable=SC2162
+IFS="-" read field1 field2 field3 field4 <<EOF
+$1
+EOF
+
+# Separate into logical components for further validation
+case $1 in
+	*-*-*-*-*)
+		echo Invalid configuration \`"$1"\': more than four components >&2
+		exit 1
+		;;
+	*-*-*-*)
+		basic_machine=$field1-$field2
+		basic_os=$field3-$field4
+		;;
+	*-*-*)
+		# Ambiguous whether COMPANY is present, or skipped and KERNEL-OS is two
+		# parts
+		maybe_os=$field2-$field3
+		case $maybe_os in
+			nto-qnx* | linux-* | uclinux-uclibc* \
+			| uclinux-gnu* | kfreebsd*-gnu* | knetbsd*-gnu* | netbsd*-gnu* \
+			| netbsd*-eabi* | kopensolaris*-gnu* | cloudabi*-eabi* \
+			| storm-chaos* | os2-emx* | rtmk-nova*)
+				basic_machine=$field1
+				basic_os=$maybe_os
+				;;
+			android-linux)
+				basic_machine=$field1-unknown
+				basic_os=linux-android
+				;;
+			*)
+				basic_machine=$field1-$field2
+				basic_os=$field3
+				;;
+		esac
+		;;
+	*-*)
+		# A lone config we happen to match not fitting any pattern
+		case $field1-$field2 in
+			decstation-3100)
+				basic_machine=mips-dec
+				basic_os=
+				;;
+			*-*)
+				# Second component is usually, but not always the OS
+				case $field2 in
+					# Prevent following clause from handling this valid os
+					sun*os*)
+						basic_machine=$field1
+						basic_os=$field2
+						;;
+					# Manufacturers
+					dec* | mips* | sequent* | encore* | pc533* | sgi* | sony* \
+					| att* | 7300* | 3300* | delta* | motorola* | sun[234]* \
+					| unicom* | ibm* | next | hp | isi* | apollo | altos* \
+					| convergent* | ncr* | news | 32* | 3600* | 3100* \
+					| hitachi* | c[123]* | convex* | sun | crds | omron* | dg \
+					| ultra | tti* | harris | dolphin | highlevel | gould \
+					| cbm | ns | masscomp | apple | axis | knuth | cray \
+					| microblaze* | sim | cisco \
+					| oki | wec | wrs | winbond)
+						basic_machine=$field1-$field2
+						basic_os=
+						;;
+					*)
+						basic_machine=$field1
+						basic_os=$field2
+						;;
+				esac
+			;;
+		esac
+		;;
+	*)
+		# Convert single-component short-hands not valid as part of
+		# multi-component configurations.
+		case $field1 in
+			386bsd)
+				basic_machine=i386-pc
+				basic_os=bsd
+				;;
+			a29khif)
+				basic_machine=a29k-amd
+				basic_os=udi
+				;;
+			adobe68k)
+				basic_machine=m68010-adobe
+				basic_os=scout
+				;;
+			alliant)
+				basic_machine=fx80-alliant
+				basic_os=
+				;;
+			altos | altos3068)
+				basic_machine=m68k-altos
+				basic_os=
+				;;
+			am29k)
+				basic_machine=a29k-none
+				basic_os=bsd
+				;;
+			amdahl)
+				basic_machine=580-amdahl
+				basic_os=sysv
+				;;
+			amiga)
+				basic_machine=m68k-unknown
+				basic_os=
+				;;
+			amigaos | amigados)
+				basic_machine=m68k-unknown
+				basic_os=amigaos
+				;;
+			amigaunix | amix)
+				basic_machine=m68k-unknown
+				basic_os=sysv4
+				;;
+			apollo68)
+				basic_machine=m68k-apollo
+				basic_os=sysv
+				;;
+			apollo68bsd)
+				basic_machine=m68k-apollo
+				basic_os=bsd
+				;;
+			aros)
+				basic_machine=i386-pc
+				basic_os=aros
+				;;
+			aux)
+				basic_machine=m68k-apple
+				basic_os=aux
+				;;
+			balance)
+				basic_machine=ns32k-sequent
+				basic_os=dynix
+				;;
+			blackfin)
+				basic_machine=bfin-unknown
+				basic_os=linux
+				;;
+			cegcc)
+				basic_machine=arm-unknown
+				basic_os=cegcc
+				;;
+			convex-c1)
+				basic_machine=c1-convex
+				basic_os=bsd
+				;;
+			convex-c2)
+				basic_machine=c2-convex
+				basic_os=bsd
+				;;
+			convex-c32)
+				basic_machine=c32-convex
+				basic_os=bsd
+				;;
+			convex-c34)
+				basic_machine=c34-convex
+				basic_os=bsd
+				;;
+			convex-c38)
+				basic_machine=c38-convex
+				basic_os=bsd
+				;;
+			cray)
+				basic_machine=j90-cray
+				basic_os=unicos
+				;;
+			crds | unos)
+				basic_machine=m68k-crds
+				basic_os=
+				;;
+			da30)
+				basic_machine=m68k-da30
+				basic_os=
+				;;
+			decstation | pmax | pmin | dec3100 | decstatn)
+				basic_machine=mips-dec
+				basic_os=
+				;;
+			delta88)
+				basic_machine=m88k-motorola
+				basic_os=sysv3
+				;;
+			dicos)
+				basic_machine=i686-pc
+				basic_os=dicos
+				;;
+			djgpp)
+				basic_machine=i586-pc
+				basic_os=msdosdjgpp
+				;;
+			ebmon29k)
+				basic_machine=a29k-amd
+				basic_os=ebmon
+				;;
+			es1800 | OSE68k | ose68k | ose | OSE)
+				basic_machine=m68k-ericsson
+				basic_os=ose
+				;;
+			gmicro)
+				basic_machine=tron-gmicro
+				basic_os=sysv
+				;;
+			go32)
+				basic_machine=i386-pc
+				basic_os=go32
+				;;
+			h8300hms)
+				basic_machine=h8300-hitachi
+				basic_os=hms
+				;;
+			h8300xray)
+				basic_machine=h8300-hitachi
+				basic_os=xray
+				;;
+			h8500hms)
+				basic_machine=h8500-hitachi
+				basic_os=hms
+				;;
+			harris)
+				basic_machine=m88k-harris
+				basic_os=sysv3
+				;;
+			hp300 | hp300hpux)
+				basic_machine=m68k-hp
+				basic_os=hpux
+				;;
+			hp300bsd)
+				basic_machine=m68k-hp
+				basic_os=bsd
+				;;
+			hppaosf)
+				basic_machine=hppa1.1-hp
+				basic_os=osf
+				;;
+			hppro)
+				basic_machine=hppa1.1-hp
+				basic_os=proelf
+				;;
+			i386mach)
+				basic_machine=i386-mach
+				basic_os=mach
+				;;
+			isi68 | isi)
+				basic_machine=m68k-isi
+				basic_os=sysv
+				;;
+			m68knommu)
+				basic_machine=m68k-unknown
+				basic_os=linux
+				;;
+			magnum | m3230)
+				basic_machine=mips-mips
+				basic_os=sysv
+				;;
+			merlin)
+				basic_machine=ns32k-utek
+				basic_os=sysv
+				;;
+			mingw64)
+				basic_machine=x86_64-pc
+				basic_os=mingw64
+				;;
+			mingw32)
+				basic_machine=i686-pc
+				basic_os=mingw32
+				;;
+			mingw32ce)
+				basic_machine=arm-unknown
+				basic_os=mingw32ce
+				;;
+			monitor)
+				basic_machine=m68k-rom68k
+				basic_os=coff
+				;;
+			morphos)
+				basic_machine=powerpc-unknown
+				basic_os=morphos
+				;;
+			moxiebox)
+				basic_machine=moxie-unknown
+				basic_os=moxiebox
+				;;
+			msdos)
+				basic_machine=i386-pc
+				basic_os=msdos
+				;;
+			msys)
+				basic_machine=i686-pc
+				basic_os=msys
+				;;
+			mvs)
+				basic_machine=i370-ibm
+				basic_os=mvs
+				;;
+			nacl)
+				basic_machine=le32-unknown
+				basic_os=nacl
+				;;
+			ncr3000)
+				basic_machine=i486-ncr
+				basic_os=sysv4
+				;;
+			netbsd386)
+				basic_machine=i386-pc
+				basic_os=netbsd
+				;;
+			netwinder)
+				basic_machine=armv4l-rebel
+				basic_os=linux
+				;;
+			news | news700 | news800 | news900)
+				basic_machine=m68k-sony
+				basic_os=newsos
+				;;
+			news1000)
+				basic_machine=m68030-sony
+				basic_os=newsos
+				;;
+			necv70)
+				basic_machine=v70-nec
+				basic_os=sysv
+				;;
+			nh3000)
+				basic_machine=m68k-harris
+				basic_os=cxux
+				;;
+			nh[45]000)
+				basic_machine=m88k-harris
+				basic_os=cxux
+				;;
+			nindy960)
+				basic_machine=i960-intel
+				basic_os=nindy
+				;;
+			mon960)
+				basic_machine=i960-intel
+				basic_os=mon960
+				;;
+			nonstopux)
+				basic_machine=mips-compaq
+				basic_os=nonstopux
+				;;
+			os400)
+				basic_machine=powerpc-ibm
+				basic_os=os400
+				;;
+			OSE68000 | ose68000)
+				basic_machine=m68000-ericsson
+				basic_os=ose
+				;;
+			os68k)
+				basic_machine=m68k-none
+				basic_os=os68k
+				;;
+			paragon)
+				basic_machine=i860-intel
+				basic_os=osf
+				;;
+			parisc)
+				basic_machine=hppa-unknown
+				basic_os=linux
+				;;
+			psp)
+				basic_machine=mipsallegrexel-sony
+				basic_os=psp
+				;;
+			pw32)
+				basic_machine=i586-unknown
+				basic_os=pw32
+				;;
+			rdos | rdos64)
+				basic_machine=x86_64-pc
+				basic_os=rdos
+				;;
+			rdos32)
+				basic_machine=i386-pc
+				basic_os=rdos
+				;;
+			rom68k)
+				basic_machine=m68k-rom68k
+				basic_os=coff
+				;;
+			sa29200)
+				basic_machine=a29k-amd
+				basic_os=udi
+				;;
+			sei)
+				basic_machine=mips-sei
+				basic_os=seiux
+				;;
+			sequent)
+				basic_machine=i386-sequent
+				basic_os=
+				;;
+			sps7)
+				basic_machine=m68k-bull
+				basic_os=sysv2
+				;;
+			st2000)
+				basic_machine=m68k-tandem
+				basic_os=
+				;;
+			stratus)
+				basic_machine=i860-stratus
+				basic_os=sysv4
+				;;
+			sun2)
+				basic_machine=m68000-sun
+				basic_os=
+				;;
+			sun2os3)
+				basic_machine=m68000-sun
+				basic_os=sunos3
+				;;
+			sun2os4)
+				basic_machine=m68000-sun
+				basic_os=sunos4
+				;;
+			sun3)
+				basic_machine=m68k-sun
+				basic_os=
+				;;
+			sun3os3)
+				basic_machine=m68k-sun
+				basic_os=sunos3
+				;;
+			sun3os4)
+				basic_machine=m68k-sun
+				basic_os=sunos4
+				;;
+			sun4)
+				basic_machine=sparc-sun
+				basic_os=
+				;;
+			sun4os3)
+				basic_machine=sparc-sun
+				basic_os=sunos3
+				;;
+			sun4os4)
+				basic_machine=sparc-sun
+				basic_os=sunos4
+				;;
+			sun4sol2)
+				basic_machine=sparc-sun
+				basic_os=solaris2
+				;;
+			sun386 | sun386i | roadrunner)
+				basic_machine=i386-sun
+				basic_os=
+				;;
+			sv1)
+				basic_machine=sv1-cray
+				basic_os=unicos
+				;;
+			symmetry)
+				basic_machine=i386-sequent
+				basic_os=dynix
+				;;
+			t3e)
+				basic_machine=alphaev5-cray
+				basic_os=unicos
+				;;
+			t90)
+				basic_machine=t90-cray
+				basic_os=unicos
+				;;
+			toad1)
+				basic_machine=pdp10-xkl
+				basic_os=tops20
+				;;
+			tpf)
+				basic_machine=s390x-ibm
+				basic_os=tpf
+				;;
+			udi29k)
+				basic_machine=a29k-amd
+				basic_os=udi
+				;;
+			ultra3)
+				basic_machine=a29k-nyu
+				basic_os=sym1
+				;;
+			v810 | necv810)
+				basic_machine=v810-nec
+				basic_os=none
+				;;
+			vaxv)
+				basic_machine=vax-dec
+				basic_os=sysv
+				;;
+			vms)
+				basic_machine=vax-dec
+				basic_os=vms
+				;;
+			vsta)
+				basic_machine=i386-pc
+				basic_os=vsta
+				;;
+			vxworks960)
+				basic_machine=i960-wrs
+				basic_os=vxworks
+				;;
+			vxworks68)
+				basic_machine=m68k-wrs
+				basic_os=vxworks
+				;;
+			vxworks29k)
+				basic_machine=a29k-wrs
+				basic_os=vxworks
+				;;
+			xbox)
+				basic_machine=i686-pc
+				basic_os=mingw32
+				;;
+			ymp)
+				basic_machine=ymp-cray
+				basic_os=unicos
+				;;
+			*)
+				basic_machine=$1
+				basic_os=
+				;;
+		esac
+		;;
+esac
+
+# Decode 1-component or ad-hoc basic machines
+case $basic_machine in
+	# Here we handle the default manufacturer of certain CPU types.  It is in
+	# some cases the only manufacturer, in others, it is the most popular.
+	w89k)
+		cpu=hppa1.1
+		vendor=winbond
+		;;
+	op50n)
+		cpu=hppa1.1
+		vendor=oki
+		;;
+	op60c)
+		cpu=hppa1.1
+		vendor=oki
+		;;
+	ibm*)
+		cpu=i370
+		vendor=ibm
+		;;
+	orion105)
+		cpu=clipper
+		vendor=highlevel
+		;;
+	mac | mpw | mac-mpw)
+		cpu=m68k
+		vendor=apple
+		;;
+	pmac | pmac-mpw)
+		cpu=powerpc
+		vendor=apple
+		;;
+
+	# Recognize the various machine names and aliases which stand
+	# for a CPU type and a company and sometimes even an OS.
+	3b1 | 7300 | 7300-att | att-7300 | pc7300 | safari | unixpc)
+		cpu=m68000
+		vendor=att
+		;;
+	3b*)
+		cpu=we32k
+		vendor=att
+		;;
+	bluegene*)
+		cpu=powerpc
+		vendor=ibm
+		basic_os=cnk
+		;;
+	decsystem10* | dec10*)
+		cpu=pdp10
+		vendor=dec
+		basic_os=tops10
+		;;
+	decsystem20* | dec20*)
+		cpu=pdp10
+		vendor=dec
+		basic_os=tops20
+		;;
+	delta | 3300 | motorola-3300 | motorola-delta \
+	      | 3300-motorola | delta-motorola)
+		cpu=m68k
+		vendor=motorola
+		;;
+	dpx2*)
+		cpu=m68k
+		vendor=bull
+		basic_os=sysv3
+		;;
+	encore | umax | mmax)
+		cpu=ns32k
+		vendor=encore
+		;;
+	elxsi)
+		cpu=elxsi
+		vendor=elxsi
+		basic_os=${basic_os:-bsd}
+		;;
+	fx2800)
+		cpu=i860
+		vendor=alliant
+		;;
+	genix)
+		cpu=ns32k
+		vendor=ns
+		;;
+	h3050r* | hiux*)
+		cpu=hppa1.1
+		vendor=hitachi
+		basic_os=hiuxwe2
+		;;
+	hp3k9[0-9][0-9] | hp9[0-9][0-9])
+		cpu=hppa1.0
+		vendor=hp
+		;;
+	hp9k2[0-9][0-9] | hp9k31[0-9])
+		cpu=m68000
+		vendor=hp
+		;;
+	hp9k3[2-9][0-9])
+		cpu=m68k
+		vendor=hp
+		;;
+	hp9k6[0-9][0-9] | hp6[0-9][0-9])
+		cpu=hppa1.0
+		vendor=hp
+		;;
+	hp9k7[0-79][0-9] | hp7[0-79][0-9])
+		cpu=hppa1.1
+		vendor=hp
+		;;
+	hp9k78[0-9] | hp78[0-9])
+		# FIXME: really hppa2.0-hp
+		cpu=hppa1.1
+		vendor=hp
+		;;
+	hp9k8[67]1 | hp8[67]1 | hp9k80[24] | hp80[24] | hp9k8[78]9 | hp8[78]9 | hp9k893 | hp893)
+		# FIXME: really hppa2.0-hp
+		cpu=hppa1.1
+		vendor=hp
+		;;
+	hp9k8[0-9][13679] | hp8[0-9][13679])
+		cpu=hppa1.1
+		vendor=hp
+		;;
+	hp9k8[0-9][0-9] | hp8[0-9][0-9])
+		cpu=hppa1.0
+		vendor=hp
+		;;
+	i*86v32)
+		cpu=`echo "$1" | sed -e 's/86.*/86/'`
+		vendor=pc
+		basic_os=sysv32
+		;;
+	i*86v4*)
+		cpu=`echo "$1" | sed -e 's/86.*/86/'`
+		vendor=pc
+		basic_os=sysv4
+		;;
+	i*86v)
+		cpu=`echo "$1" | sed -e 's/86.*/86/'`
+		vendor=pc
+		basic_os=sysv
+		;;
+	i*86sol2)
+		cpu=`echo "$1" | sed -e 's/86.*/86/'`
+		vendor=pc
+		basic_os=solaris2
+		;;
+	j90 | j90-cray)
+		cpu=j90
+		vendor=cray
+		basic_os=${basic_os:-unicos}
+		;;
+	iris | iris4d)
+		cpu=mips
+		vendor=sgi
+		case $basic_os in
+		    irix*)
+			;;
+		    *)
+			basic_os=irix4
+			;;
+		esac
+		;;
+	miniframe)
+		cpu=m68000
+		vendor=convergent
+		;;
+	*mint | mint[0-9]* | *MiNT | *MiNT[0-9]*)
+		cpu=m68k
+		vendor=atari
+		basic_os=mint
+		;;
+	news-3600 | risc-news)
+		cpu=mips
+		vendor=sony
+		basic_os=newsos
+		;;
+	next | m*-next)
+		cpu=m68k
+		vendor=next
+		case $basic_os in
+		    openstep*)
+		        ;;
+		    nextstep*)
+			;;
+		    ns2*)
+		      basic_os=nextstep2
+			;;
+		    *)
+		      basic_os=nextstep3
+			;;
+		esac
+		;;
+	np1)
+		cpu=np1
+		vendor=gould
+		;;
+	op50n-* | op60c-*)
+		cpu=hppa1.1
+		vendor=oki
+		basic_os=proelf
+		;;
+	pa-hitachi)
+		cpu=hppa1.1
+		vendor=hitachi
+		basic_os=hiuxwe2
+		;;
+	pbd)
+		cpu=sparc
+		vendor=tti
+		;;
+	pbb)
+		cpu=m68k
+		vendor=tti
+		;;
+	pc532)
+		cpu=ns32k
+		vendor=pc532
+		;;
+	pn)
+		cpu=pn
+		vendor=gould
+		;;
+	power)
+		cpu=power
+		vendor=ibm
+		;;
+	ps2)
+		cpu=i386
+		vendor=ibm
+		;;
+	rm[46]00)
+		cpu=mips
+		vendor=siemens
+		;;
+	rtpc | rtpc-*)
+		cpu=romp
+		vendor=ibm
+		;;
+	sde)
+		cpu=mipsisa32
+		vendor=sde
+		basic_os=${basic_os:-elf}
+		;;
+	simso-wrs)
+		cpu=sparclite
+		vendor=wrs
+		basic_os=vxworks
+		;;
+	tower | tower-32)
+		cpu=m68k
+		vendor=ncr
+		;;
+	vpp*|vx|vx-*)
+		cpu=f301
+		vendor=fujitsu
+		;;
+	w65)
+		cpu=w65
+		vendor=wdc
+		;;
+	w89k-*)
+		cpu=hppa1.1
+		vendor=winbond
+		basic_os=proelf
+		;;
+	none)
+		cpu=none
+		vendor=none
+		;;
+	leon|leon[3-9])
+		cpu=sparc
+		vendor=$basic_machine
+		;;
+	leon-*|leon[3-9]-*)
+		cpu=sparc
+		vendor=`echo "$basic_machine" | sed 's/-.*//'`
+		;;
+
+	*-*)
+		# shellcheck disable=SC2162
+		IFS="-" read cpu vendor <<EOF
+$basic_machine
+EOF
+		;;
+	# We use `pc' rather than `unknown'
+	# because (1) that's what they normally are, and
+	# (2) the word "unknown" tends to confuse beginning users.
+	i*86 | x86_64)
+		cpu=$basic_machine
+		vendor=pc
+		;;
+	# These rules are duplicated from below for sake of the special case above;
+	# i.e. things that normalized to x86 arches should also default to "pc"
+	pc98)
+		cpu=i386
+		vendor=pc
+		;;
+	x64 | amd64)
+		cpu=x86_64
+		vendor=pc
+		;;
+	# Recognize the basic CPU types without company name.
+	*)
+		cpu=$basic_machine
+		vendor=unknown
+		;;
+esac
+
+unset -v basic_machine
+
+# Decode basic machines in the full and proper CPU-Company form.
+case $cpu-$vendor in
+	# Here we handle the default manufacturer of certain CPU types in canonical form. It is in
+	# some cases the only manufacturer, in others, it is the most popular.
+	craynv-unknown)
+		vendor=cray
+		basic_os=${basic_os:-unicosmp}
+		;;
+	c90-unknown | c90-cray)
+		vendor=cray
+		basic_os=${Basic_os:-unicos}
+		;;
+	fx80-unknown)
+		vendor=alliant
+		;;
+	romp-unknown)
+		vendor=ibm
+		;;
+	mmix-unknown)
+		vendor=knuth
+		;;
+	microblaze-unknown | microblazeel-unknown)
+		vendor=xilinx
+		;;
+	rs6000-unknown)
+		vendor=ibm
+		;;
+	vax-unknown)
+		vendor=dec
+		;;
+	pdp11-unknown)
+		vendor=dec
+		;;
+	we32k-unknown)
+		vendor=att
+		;;
+	cydra-unknown)
+		vendor=cydrome
+		;;
+	i370-ibm*)
+		vendor=ibm
+		;;
+	orion-unknown)
+		vendor=highlevel
+		;;
+	xps-unknown | xps100-unknown)
+		cpu=xps100
+		vendor=honeywell
+		;;
+
+	# Here we normalize CPU types with a missing or matching vendor
+	dpx20-unknown | dpx20-bull)
+		cpu=rs6000
+		vendor=bull
+		basic_os=${basic_os:-bosx}
+		;;
+
+	# Here we normalize CPU types irrespective of the vendor
+	amd64-*)
+		cpu=x86_64
+		;;
+	blackfin-*)
+		cpu=bfin
+		basic_os=linux
+		;;
+	c54x-*)
+		cpu=tic54x
+		;;
+	c55x-*)
+		cpu=tic55x
+		;;
+	c6x-*)
+		cpu=tic6x
+		;;
+	e500v[12]-*)
+		cpu=powerpc
+		basic_os=${basic_os}"spe"
+		;;
+	mips3*-*)
+		cpu=mips64
+		;;
+	ms1-*)
+		cpu=mt
+		;;
+	m68knommu-*)
+		cpu=m68k
+		basic_os=linux
+		;;
+	m9s12z-* | m68hcs12z-* | hcs12z-* | s12z-*)
+		cpu=s12z
+		;;
+	openrisc-*)
+		cpu=or32
+		;;
+	parisc-*)
+		cpu=hppa
+		basic_os=linux
+		;;
+	pentium-* | p5-* | k5-* | k6-* | nexgen-* | viac3-*)
+		cpu=i586
+		;;
+	pentiumpro-* | p6-* | 6x86-* | athlon-* | athalon_*-*)
+		cpu=i686
+		;;
+	pentiumii-* | pentium2-* | pentiumiii-* | pentium3-*)
+		cpu=i686
+		;;
+	pentium4-*)
+		cpu=i786
+		;;
+	pc98-*)
+		cpu=i386
+		;;
+	ppc-* | ppcbe-*)
+		cpu=powerpc
+		;;
+	ppcle-* | powerpclittle-*)
+		cpu=powerpcle
+		;;
+	ppc64-*)
+		cpu=powerpc64
+		;;
+	ppc64le-* | powerpc64little-*)
+		cpu=powerpc64le
+		;;
+	sb1-*)
+		cpu=mipsisa64sb1
+		;;
+	sb1el-*)
+		cpu=mipsisa64sb1el
+		;;
+	sh5e[lb]-*)
+		cpu=`echo "$cpu" | sed 's/^\(sh.\)e\(.\)$/\1\2e/'`
+		;;
+	spur-*)
+		cpu=spur
+		;;
+	strongarm-* | thumb-*)
+		cpu=arm
+		;;
+	tx39-*)
+		cpu=mipstx39
+		;;
+	tx39el-*)
+		cpu=mipstx39el
+		;;
+	x64-*)
+		cpu=x86_64
+		;;
+	xscale-* | xscalee[bl]-*)
+		cpu=`echo "$cpu" | sed 's/^xscale/arm/'`
+		;;
+	arm64-*)
+		cpu=aarch64
+		;;
+
+	# Recognize the canonical CPU Types that limit and/or modify the
+	# company names they are paired with.
+	cr16-*)
+		basic_os=${basic_os:-elf}
+		;;
+	crisv32-* | etraxfs*-*)
+		cpu=crisv32
+		vendor=axis
+		;;
+	cris-* | etrax*-*)
+		cpu=cris
+		vendor=axis
+		;;
+	crx-*)
+		basic_os=${basic_os:-elf}
+		;;
+	neo-tandem)
+		cpu=neo
+		vendor=tandem
+		;;
+	nse-tandem)
+		cpu=nse
+		vendor=tandem
+		;;
+	nsr-tandem)
+		cpu=nsr
+		vendor=tandem
+		;;
+	nsv-tandem)
+		cpu=nsv
+		vendor=tandem
+		;;
+	nsx-tandem)
+		cpu=nsx
+		vendor=tandem
+		;;
+	mipsallegrexel-sony)
+		cpu=mipsallegrexel
+		vendor=sony
+		;;
+	tile*-*)
+		basic_os=${basic_os:-linux-gnu}
+		;;
+
+	*)
+		# Recognize the canonical CPU types that are allowed with any
+		# company name.
+		case $cpu in
+			1750a | 580 \
+			| a29k \
+			| aarch64 | aarch64_be \
+			| abacus \
+			| alpha | alphaev[4-8] | alphaev56 | alphaev6[78] \
+			| alpha64 | alpha64ev[4-8] | alpha64ev56 | alpha64ev6[78] \
+			| alphapca5[67] | alpha64pca5[67] \
+			| am33_2.0 \
+			| amdgcn \
+			| arc | arceb \
+			| arm | arm[lb]e | arme[lb] | armv* \
+			| avr | avr32 \
+			| asmjs \
+			| ba \
+			| be32 | be64 \
+			| bfin | bpf | bs2000 \
+			| c[123]* | c30 | [cjt]90 | c4x \
+			| c8051 | clipper | craynv | csky | cydra \
+			| d10v | d30v | dlx | dsp16xx \
+			| e2k | elxsi | epiphany \
+			| f30[01] | f700 | fido | fr30 | frv | ft32 | fx80 \
+			| h8300 | h8500 \
+			| hppa | hppa1.[01] | hppa2.0 | hppa2.0[nw] | hppa64 \
+			| hexagon \
+			| i370 | i*86 | i860 | i960 | ia16 | ia64 \
+			| ip2k | iq2000 \
+			| k1om \
+			| le32 | le64 \
+			| lm32 \
+			| m32c | m32r | m32rle \
+			| m5200 | m68000 | m680[012346]0 | m68360 | m683?2 | m68k \
+			| m6811 | m68hc11 | m6812 | m68hc12 | m68hcs12x \
+			| m88110 | m88k | maxq | mb | mcore | mep | metag \
+			| microblaze | microblazeel \
+			| mips | mipsbe | mipseb | mipsel | mipsle \
+			| mips16 \
+			| mips64 | mips64eb | mips64el \
+			| mips64octeon | mips64octeonel \
+			| mips64orion | mips64orionel \
+			| mips64r5900 | mips64r5900el \
+			| mips64vr | mips64vrel \
+			| mips64vr4100 | mips64vr4100el \
+			| mips64vr4300 | mips64vr4300el \
+			| mips64vr5000 | mips64vr5000el \
+			| mips64vr5900 | mips64vr5900el \
+			| mipsisa32 | mipsisa32el \
+			| mipsisa32r2 | mipsisa32r2el \
+			| mipsisa32r6 | mipsisa32r6el \
+			| mipsisa64 | mipsisa64el \
+			| mipsisa64r2 | mipsisa64r2el \
+			| mipsisa64r6 | mipsisa64r6el \
+			| mipsisa64sb1 | mipsisa64sb1el \
+			| mipsisa64sr71k | mipsisa64sr71kel \
+			| mipsr5900 | mipsr5900el \
+			| mipstx39 | mipstx39el \
+			| mmix \
+			| mn10200 | mn10300 \
+			| moxie \
+			| mt \
+			| msp430 \
+			| nds32 | nds32le | nds32be \
+			| nfp \
+			| nios | nios2 | nios2eb | nios2el \
+			| none | np1 | ns16k | ns32k | nvptx \
+			| open8 \
+			| or1k* \
+			| or32 \
+			| orion \
+			| picochip \
+			| pdp10 | pdp11 | pj | pjl | pn | power \
+			| powerpc | powerpc64 | powerpc64le | powerpcle | powerpcspe \
+			| pru \
+			| pyramid \
+			| riscv | riscv32 | riscv64 \
+			| rl78 | romp | rs6000 | rx \
+			| s390 | s390x \
+			| score \
+			| sh | shl \
+			| sh[1234] | sh[24]a | sh[24]ae[lb] | sh[23]e | she[lb] | sh[lb]e \
+			| sh[1234]e[lb] |  sh[12345][lb]e | sh[23]ele | sh64 | sh64le \
+			| sparc | sparc64 | sparc64b | sparc64v | sparc86x | sparclet \
+			| sparclite \
+			| sparcv8 | sparcv9 | sparcv9b | sparcv9v | sv1 | sx* \
+			| spu \
+			| tahoe \
+			| tic30 | tic4x | tic54x | tic55x | tic6x | tic80 \
+			| tron \
+			| ubicom32 \
+			| v70 | v850 | v850e | v850e1 | v850es | v850e2 | v850e2v3 \
+			| vax \
+			| visium \
+			| w65 \
+			| wasm32 | wasm64 \
+			| we32k \
+			| x86 | x86_64 | xc16x | xgate | xps100 \
+			| xstormy16 | xtensa* \
+			| ymp \
+			| z8k | z80)
+				;;
+
+			*)
+				echo Invalid configuration \`"$1"\': machine \`"$cpu-$vendor"\' not recognized 1>&2
+				exit 1
+				;;
+		esac
+		;;
+esac
+
+# Here we canonicalize certain aliases for manufacturers.
+case $vendor in
+	digital*)
+		vendor=dec
+		;;
+	commodore*)
+		vendor=cbm
+		;;
+	*)
+		;;
+esac
+
+# Decode manufacturer-specific aliases for certain operating systems.
+
+if test x$basic_os != x
+then
+
+# First recognize some ad-hoc caes, or perhaps split kernel-os, or else just
+# set os.
+case $basic_os in
+	gnu/linux*)
+		kernel=linux
+		os=`echo $basic_os | sed -e 's|gnu/linux|gnu|'`
+		;;
+	nto-qnx*)
+		kernel=nto
+		os=`echo $basic_os | sed -e 's|nto-qnx|qnx|'`
+		;;
+	*-*)
+		# shellcheck disable=SC2162
+		IFS="-" read kernel os <<EOF
+$basic_os
+EOF
+		;;
+	# Default OS when just kernel was specified
+	nto*)
+		kernel=nto
+		os=`echo $basic_os | sed -e 's|nto|qnx|'`
+		;;
+	linux*)
+		kernel=linux
+		os=`echo $basic_os | sed -e 's|linux|gnu|'`
+		;;
+	*)
+		kernel=
+		os=$basic_os
+		;;
+esac
+
+# Now, normalize the OS (knowing we just have one component, it's not a kernel,
+# etc.)
+case $os in
+	# First match some system type aliases that might get confused
+	# with valid system types.
+	# solaris* is a basic system type, with this one exception.
+	auroraux)
+		os=auroraux
+		;;
+	bluegene*)
+		os=cnk
+		;;
+	solaris1 | solaris1.*)
+		os=`echo $os | sed -e 's|solaris1|sunos4|'`
+		;;
+	solaris)
+		os=solaris2
+		;;
+	unixware*)
+		os=sysv4.2uw
+		;;
+	# es1800 is here to avoid being matched by es* (a different OS)
+	es1800*)
+		os=ose
+		;;
+	# Some version numbers need modification
+	chorusos*)
+		os=chorusos
+		;;
+	isc)
+		os=isc2.2
+		;;
+	sco6)
+		os=sco5v6
+		;;
+	sco5)
+		os=sco3.2v5
+		;;
+	sco4)
+		os=sco3.2v4
+		;;
+	sco3.2.[4-9]*)
+		os=`echo $os | sed -e 's/sco3.2./sco3.2v/'`
+		;;
+	sco*v* | scout)
+		# Don't match below
+		;;
+	sco*)
+		os=sco3.2v2
+		;;
+	psos*)
+		os=psos
+		;;
+	qnx*)
+		os=qnx
+		;;
+	hiux*)
+		os=hiuxwe2
+		;;
+	lynx*178)
+		os=lynxos178
+		;;
+	lynx*5)
+		os=lynxos5
+		;;
+	lynxos*)
+		# don't get caught up in next wildcard
+		;;
+	lynx*)
+		os=lynxos
+		;;
+	mac[0-9]*)
+		os=`echo "$os" | sed -e 's|mac|macos|'`
+		;;
+	opened*)
+		os=openedition
+		;;
+	os400*)
+		os=os400
+		;;
+	sunos5*)
+		os=`echo "$os" | sed -e 's|sunos5|solaris2|'`
+		;;
+	sunos6*)
+		os=`echo "$os" | sed -e 's|sunos6|solaris3|'`
+		;;
+	wince*)
+		os=wince
+		;;
+	utek*)
+		os=bsd
+		;;
+	dynix*)
+		os=bsd
+		;;
+	acis*)
+		os=aos
+		;;
+	atheos*)
+		os=atheos
+		;;
+	syllable*)
+		os=syllable
+		;;
+	386bsd)
+		os=bsd
+		;;
+	ctix* | uts*)
+		os=sysv
+		;;
+	nova*)
+		os=rtmk-nova
+		;;
+	ns2)
+		os=nextstep2
+		;;
+	# Preserve the version number of sinix5.
+	sinix5.*)
+		os=`echo $os | sed -e 's|sinix|sysv|'`
+		;;
+	sinix*)
+		os=sysv4
+		;;
+	tpf*)
+		os=tpf
+		;;
+	triton*)
+		os=sysv3
+		;;
+	oss*)
+		os=sysv3
+		;;
+	svr4*)
+		os=sysv4
+		;;
+	svr3)
+		os=sysv3
+		;;
+	sysvr4)
+		os=sysv4
+		;;
+	ose*)
+		os=ose
+		;;
+	*mint | mint[0-9]* | *MiNT | MiNT[0-9]*)
+		os=mint
+		;;
+	dicos*)
+		os=dicos
+		;;
+	pikeos*)
+		# Until real need of OS specific support for
+		# particular features comes up, bare metal
+		# configurations are quite functional.
+		case $cpu in
+		    arm*)
+			os=eabi
+			;;
+		    *)
+			os=elf
+			;;
+		esac
+		;;
+	*)
+		# No normalization, but not necessarily accepted, that comes below.
+		;;
+esac
+
+else
+
+# Here we handle the default operating systems that come with various machines.
+# The value should be what the vendor currently ships out the door with their
+# machine or put another way, the most popular os provided with the machine.
+
+# Note that if you're going to try to match "-MANUFACTURER" here (say,
+# "-sun"), then you have to tell the case statement up towards the top
+# that MANUFACTURER isn't an operating system.  Otherwise, code above
+# will signal an error saying that MANUFACTURER isn't an operating
+# system, and we'll never get to this point.
+
+kernel=
+case $cpu-$vendor in
+	score-*)
+		os=elf
+		;;
+	spu-*)
+		os=elf
+		;;
+	*-acorn)
+		os=riscix1.2
+		;;
+	arm*-rebel)
+		kernel=linux
+		os=gnu
+		;;
+	arm*-semi)
+		os=aout
+		;;
+	c4x-* | tic4x-*)
+		os=coff
+		;;
+	c8051-*)
+		os=elf
+		;;
+	clipper-intergraph)
+		os=clix
+		;;
+	hexagon-*)
+		os=elf
+		;;
+	tic54x-*)
+		os=coff
+		;;
+	tic55x-*)
+		os=coff
+		;;
+	tic6x-*)
+		os=coff
+		;;
+	# This must come before the *-dec entry.
+	pdp10-*)
+		os=tops20
+		;;
+	pdp11-*)
+		os=none
+		;;
+	*-dec | vax-*)
+		os=ultrix4.2
+		;;
+	m68*-apollo)
+		os=domain
+		;;
+	i386-sun)
+		os=sunos4.0.2
+		;;
+	m68000-sun)
+		os=sunos3
+		;;
+	m68*-cisco)
+		os=aout
+		;;
+	mep-*)
+		os=elf
+		;;
+	mips*-cisco)
+		os=elf
+		;;
+	mips*-*)
+		os=elf
+		;;
+	or32-*)
+		os=coff
+		;;
+	*-tti)	# must be before sparc entry or we get the wrong os.
+		os=sysv3
+		;;
+	sparc-* | *-sun)
+		os=sunos4.1.1
+		;;
+	pru-*)
+		os=elf
+		;;
+	*-be)
+		os=beos
+		;;
+	*-ibm)
+		os=aix
+		;;
+	*-knuth)
+		os=mmixware
+		;;
+	*-wec)
+		os=proelf
+		;;
+	*-winbond)
+		os=proelf
+		;;
+	*-oki)
+		os=proelf
+		;;
+	*-hp)
+		os=hpux
+		;;
+	*-hitachi)
+		os=hiux
+		;;
+	i860-* | *-att | *-ncr | *-altos | *-motorola | *-convergent)
+		os=sysv
+		;;
+	*-cbm)
+		os=amigaos
+		;;
+	*-dg)
+		os=dgux
+		;;
+	*-dolphin)
+		os=sysv3
+		;;
+	m68k-ccur)
+		os=rtu
+		;;
+	m88k-omron*)
+		os=luna
+		;;
+	*-next)
+		os=nextstep
+		;;
+	*-sequent)
+		os=ptx
+		;;
+	*-crds)
+		os=unos
+		;;
+	*-ns)
+		os=genix
+		;;
+	i370-*)
+		os=mvs
+		;;
+	*-gould)
+		os=sysv
+		;;
+	*-highlevel)
+		os=bsd
+		;;
+	*-encore)
+		os=bsd
+		;;
+	*-sgi)
+		os=irix
+		;;
+	*-siemens)
+		os=sysv4
+		;;
+	*-masscomp)
+		os=rtu
+		;;
+	f30[01]-fujitsu | f700-fujitsu)
+		os=uxpv
+		;;
+	*-rom68k)
+		os=coff
+		;;
+	*-*bug)
+		os=coff
+		;;
+	*-apple)
+		os=macos
+		;;
+	*-atari*)
+		os=mint
+		;;
+	*-wrs)
+		os=vxworks
+		;;
+	*)
+		os=none
+		;;
+esac
+
+fi
+
+# Now, validate our (potentially fixed-up) OS.
+case $os in
+	# Sometimes we do "kernel-abi", so those need to count as OSes.
+	musl* | newlib* | uclibc*)
+		;;
+	# Likewise for "kernel-libc"
+	eabi | eabihf | gnueabi | gnueabihf)
+		;;
+	# Now accept the basic system types.
+	# The portable systems comes first.
+	# Each alternative MUST end in a * to match a version number.
+	gnu* | android* | bsd* | mach* | minix* | genix* | ultrix* | irix* \
+	     | *vms* | esix* | aix* | cnk* | sunos | sunos[34]* \
+	     | hpux* | unos* | osf* | luna* | dgux* | auroraux* | solaris* \
+	     | sym* |  plan9* | psp* | sim* | xray* | os68k* | v88r* \
+	     | hiux* | abug | nacl* | netware* | windows* \
+	     | os9* | macos* | osx* | ios* \
+	     | mpw* | magic* | mmixware* | mon960* | lnews* \
+	     | amigaos* | amigados* | msdos* | newsos* | unicos* | aof* \
+	     | aos* | aros* | cloudabi* | sortix* | twizzler* \
+	     | nindy* | vxsim* | vxworks* | ebmon* | hms* | mvs* \
+	     | clix* | riscos* | uniplus* | iris* | isc* | rtu* | xenix* \
+	     | mirbsd* | netbsd* | dicos* | openedition* | ose* \
+	     | bitrig* | openbsd* | solidbsd* | libertybsd* | os108* \
+	     | ekkobsd* | freebsd* | riscix* | lynxos* | os400* \
+	     | bosx* | nextstep* | cxux* | aout* | elf* | oabi* \
+	     | ptx* | coff* | ecoff* | winnt* | domain* | vsta* \
+	     | udi* | lites* | ieee* | go32* | aux* | hcos* \
+	     | chorusrdb* | cegcc* | glidix* \
+	     | cygwin* | msys* | pe* | moss* | proelf* | rtems* \
+	     | midipix* | mingw32* | mingw64* | mint* \
+	     | uxpv* | beos* | mpeix* | udk* | moxiebox* \
+	     | interix* | uwin* | mks* | rhapsody* | darwin* \
+	     | openstep* | oskit* | conix* | pw32* | nonstopux* \
+	     | storm-chaos* | tops10* | tenex* | tops20* | its* \
+	     | os2* | vos* | palmos* | uclinux* | nucleus* | morphos* \
+	     | scout* | superux* | sysv* | rtmk* | tpf* | windiss* \
+	     | powermax* | dnix* | nx6 | nx7 | sei* | dragonfly* \
+	     | skyos* | haiku* | rdos* | toppers* | drops* | es* \
+	     | onefs* | tirtos* | phoenix* | fuchsia* | redox* | bme* \
+	     | midnightbsd* | amdhsa* | unleashed* | emscripten* | wasi* \
+	     | nsk* | powerunix* | genode* | zvmoe* | qnx* )
+		;;
+	# This one is extra strict with allowed versions
+	sco3.2v2 | sco3.2v[4-9]* | sco5v6*)
+		# Don't forget version if it is 3.2v4 or newer.
+		;;
+	none)
+		;;
+	*)
+		echo Invalid configuration \`"$1"\': OS \`"$os"\' not recognized 1>&2
+		exit 1
+		;;
+esac
+
+# As a final step for OS-related things, validate the OS-kernel combination
+# (given a valid OS), if there is a kernel.
+case $kernel-$os in
+	linux-gnu* | linux-dietlibc* | linux-android* | linux-newlib* | linux-musl* | linux-uclibc* )
+		;;
+	-dietlibc* | -newlib* | -musl* | -uclibc* )
+		# These are just libc implementations, not actual OSes, and thus
+		# require a kernel.
+		echo "Invalid configuration \`$1': libc \`$os' needs explicit kernel." 1>&2
+		exit 1
+		;;
+	kfreebsd*-gnu* | kopensolaris*-gnu*)
+		;;
+	nto-qnx*)
+		;;
+	*-eabi* | *-gnueabi*)
+		;;
+	-*)
+		# Blank kernel with real OS is always fine.
+		;;
+	*-*)
+		echo "Invalid configuration \`$1': Kernel \`$kernel' not known to work with OS \`$os'." 1>&2
+		exit 1
+		;;
+esac
+
+# Here we handle the case where we know the os, and the CPU type, but not the
+# manufacturer.  We pick the logical manufacturer.
+case $vendor in
+	unknown)
+		case $cpu-$os in
+			*-riscix*)
+				vendor=acorn
+				;;
+			*-sunos*)
+				vendor=sun
+				;;
+			*-cnk* | *-aix*)
+				vendor=ibm
+				;;
+			*-beos*)
+				vendor=be
+				;;
+			*-hpux*)
+				vendor=hp
+				;;
+			*-mpeix*)
+				vendor=hp
+				;;
+			*-hiux*)
+				vendor=hitachi
+				;;
+			*-unos*)
+				vendor=crds
+				;;
+			*-dgux*)
+				vendor=dg
+				;;
+			*-luna*)
+				vendor=omron
+				;;
+			*-genix*)
+				vendor=ns
+				;;
+			*-clix*)
+				vendor=intergraph
+				;;
+			*-mvs* | *-opened*)
+				vendor=ibm
+				;;
+			*-os400*)
+				vendor=ibm
+				;;
+			s390-* | s390x-*)
+				vendor=ibm
+				;;
+			*-ptx*)
+				vendor=sequent
+				;;
+			*-tpf*)
+				vendor=ibm
+				;;
+			*-vxsim* | *-vxworks* | *-windiss*)
+				vendor=wrs
+				;;
+			*-aux*)
+				vendor=apple
+				;;
+			*-hms*)
+				vendor=hitachi
+				;;
+			*-mpw* | *-macos*)
+				vendor=apple
+				;;
+			*-*mint | *-mint[0-9]* | *-*MiNT | *-MiNT[0-9]*)
+				vendor=atari
+				;;
+			*-vos*)
+				vendor=stratus
+				;;
+		esac
+		;;
+esac
+
+echo "$cpu-$vendor-${kernel:+$kernel-}$os"
+exit
+
+# Local variables:
+# eval: (add-hook 'before-save-hook 'time-stamp)
+# time-stamp-start: "timestamp='"
+# time-stamp-format: "%:y-%02m-%02d"
+# time-stamp-end: "'"
+# End:
diff --git a/depend/zcash/depends/description.md b/depend/zcash/depends/description.md
new file mode 100644
index 000000000..74f9ef3f2
--- /dev/null
+++ b/depend/zcash/depends/description.md
@@ -0,0 +1,53 @@
+This is a system of building and caching dependencies necessary for building Bitcoin. 
+There are several features that make it different from most similar systems:
+
+### It is designed to be builder and host agnostic
+
+In theory, binaries for any target OS/architecture can be created, from a
+builder running any OS/architecture. In practice, build-side tools must be
+specified when the defaults don't fit, and packages must be amended to work
+on new hosts. For now, a build architecture of x86_64 is assumed, either on
+Linux or OSX.
+
+### No reliance on timestamps
+
+File presence is used to determine what needs to be built. This makes the
+results distributable and easily digestable by automated builders.
+
+### Each build only has its specified dependencies available at build-time.
+
+For each build, the sysroot is wiped and the (recursive) dependencies are
+installed. This makes each build deterministic, since there will never be any
+unknown files available to cause side-effects.
+
+### Each package is cached and only rebuilt as needed.
+
+Before building, a unique build-id is generated for each package. This id
+consists of a hash of all files used to build the package (Makefiles, packages,
+etc), and as well as a hash of the same data for each recursive dependency. If
+any portion of a package's build recipe changes, it will be rebuilt as well as
+any other package that depends on it. If any of the main makefiles (Makefile, 
+funcs.mk, etc) are changed, all packages will be rebuilt. After building, the
+results are cached into a tarball that can be re-used and distributed.
+
+### Package build results are (relatively) deterministic.
+
+Each package is configured and patched so that it will yield the same
+build-results with each consequent build, within a reasonable set of
+constraints. Some things like timestamp insertion are unavoidable, and are
+beyond the scope of this system. Additionally, the toolchain itself must be
+capable of deterministic results. When revisions are properly bumped, a cached
+build should represent an exact single payload.
+
+### Sources are fetched and verified automatically
+
+Each package must define its source location and checksum. The build will fail
+if the fetched source does not match. Sources may be pre-seeded and/or cached
+as desired.
+
+### Self-cleaning
+
+Build and staging dirs are wiped after use, and any previous version of a
+cached result is removed following a successful build. Automated builders
+should be able to build each revision and store the results with no further
+intervention.
diff --git a/depend/zcash/depends/funcs.mk b/depend/zcash/depends/funcs.mk
new file mode 100644
index 000000000..c0c118285
--- /dev/null
+++ b/depend/zcash/depends/funcs.mk
@@ -0,0 +1,249 @@
+define int_vars
+#Set defaults for vars which may be overridden per-package
+$(1)_cc=$($($(1)_type)_CC)
+$(1)_cxx=$($($(1)_type)_CXX)
+$(1)_objc=$($($(1)_type)_OBJC)
+$(1)_objcxx=$($($(1)_type)_OBJCXX)
+$(1)_ar=$($($(1)_type)_AR)
+$(1)_ranlib=$($($(1)_type)_RANLIB)
+$(1)_libtool=$($($(1)_type)_LIBTOOL)
+$(1)_nm=$($($(1)_type)_NM)
+$(1)_cflags=$($($(1)_type)_CFLAGS) $($($(1)_type)_$(release_type)_CFLAGS)
+$(1)_cxxflags=$($($(1)_type)_CXXFLAGS) $($($(1)_type)_$(release_type)_CXXFLAGS)
+$(1)_ldflags=$($($(1)_type)_LDFLAGS) $($($(1)_type)_$(release_type)_LDFLAGS) -L$($($(1)_type)_prefix)/lib
+$(1)_cppflags=$($($(1)_type)_CPPFLAGS) $($($(1)_type)_$(release_type)_CPPFLAGS) -I$($($(1)_type)_prefix)/include
+$(1)_recipe_hash:=
+endef
+
+define int_get_all_dependencies
+$(sort $(foreach dep,$(2),$(2) $(call int_get_all_dependencies,$(1),$($(dep)_dependencies))))
+endef
+
+define download_and_check_file
+($(build_DOWNLOAD) "$(1)/$(2).temp" $(3) && echo "$(4)  $(1)/$(2).temp" > $(1)/.$(2).hash && $(build_SHA256SUM) -c $(1)/.$(2).hash)
+endef
+
+define fetch_file
+(test -f $$($(1)_source_dir)/$(4) || \
+  ( mkdir -p $$($(1)_download_dir) && echo Fetching $(1)... && \
+  ( $(call download_and_check_file,$$($(1)_download_dir),$(4),"$(2)/$(3)",$(5)) || \
+    $(call download_and_check_file,$$($(1)_download_dir),$(4),"$(FALLBACK_DOWNLOAD_PATH)/$(4)",$(5)) ) && \
+    mv $$($(1)_download_dir)/$(4).temp $$($(1)_source_dir)/$(4) && \
+    rm -rf $$($(1)_download_dir) ))
+endef
+
+define int_get_build_recipe_hash
+$(eval $(1)_all_file_checksums:=$(shell $(build_SHA256SUM) $(meta_depends) packages/$(1).mk $(addprefix $(PATCHES_PATH)/$(1)/,$($(1)_patches)) | cut -d" " -f1))
+$(eval $(1)_recipe_hash:=$(shell echo -n "$($(1)_all_file_checksums)" | $(build_SHA256SUM) | cut -d" " -f1))
+endef
+
+define int_get_build_id
+$(eval $(1)_dependencies += $($(1)_$(host_arch)_$(host_os)_dependencies) $($(1)_$(host_os)_dependencies))
+$(eval $(1)_all_dependencies:=$(call int_get_all_dependencies,$(1),$($($(1)_type)_native_toolchain) $($($(1)_type)_native_binutils) $($(1)_dependencies)))
+$(foreach dep,$($(1)_all_dependencies),$(eval $(1)_build_id_deps+=$(dep)-$($(dep)_version)-$($(dep)_recipe_hash)))
+$(eval $(1)_build_id_long:=$(1)-$($(1)_version)-$($(1)_recipe_hash)-$(release_type) $($(1)_build_id_deps))
+$(eval $(1)_build_id:=$(shell echo -n "$($(1)_build_id_long)" | $(build_SHA256SUM) | cut -c-$(HASH_LENGTH)))
+final_build_id_long+=$($(package)_build_id_long)
+
+#override platform specific files and hashes
+$(eval $(1)_file_name=$(if $($(1)_exact_file_name),$($(1)_exact_file_name),$(if $($(1)_file_name_$(host_arch)_$(host_os)),$($(1)_file_name_$(host_arch)_$(host_os)),$(if $($(1)_file_name_$(host_os)),$($(1)_file_name_$(host_os)),$($(1)_file_name)))))
+$(eval $(1)_sha256_hash=$(if $($(1)_exact_sha256_hash),$($(1)_exact_sha256_hash),$(if $($(1)_sha256_hash_$(host_arch)_$(host_os)),$($(1)_sha256_hash_$(host_arch)_$(host_os)),$(if $($(1)_sha256_hash_$(host_os)),$($(1)_sha256_hash_$(host_os)),$($(1)_sha256_hash)))))
+$(eval $(1)_download_file=$(if $($(1)_exact_download_file),$($(1)_exact_download_file),$(if $($(1)_download_file_$(host_arch)_$(host_os)),$($(1)_download_file_$(host_arch)_$(host_os)),$(if $($(1)_download_file_$(host_os)),$($(1)_download_file_$(host_os)),$(if $($(1)_download_file),$($(1)_download_file),$($(1)_file_name))))))
+$(eval $(1)_download_path=$(if $($(1)_exact_download_path),$($(1)_exact_download_path),$(if $($(1)_download_path_$(host_arch)_$(host_os)),$($(1)_download_path_$(host_arch)_$(host_os)),$(if $($(1)_download_path_$(host_os)),$($(1)_download_path_$(host_os)),$($(1)_download_path)))))
+
+#compute package-specific paths
+$(1)_build_subdir?=.
+$(1)_source_dir:=$(SOURCES_PATH)
+$(1)_source:=$$($(1)_source_dir)/$($(1)_file_name)
+$(1)_staging_dir=$(base_staging_dir)/$(host)/$(1)/$($(1)_version)-$($(1)_build_id)
+$(1)_staging_prefix_dir:=$$($(1)_staging_dir)$($($(1)_type)_prefix)
+$(1)_extract_dir:=$(base_build_dir)/$(host)/$(1)/$($(1)_version)-$($(1)_build_id)
+$(1)_download_dir:=$(base_download_dir)/$(1)-$($(1)_version)
+$(1)_build_dir:=$$($(1)_extract_dir)/$$($(1)_build_subdir)
+$(1)_cached_checksum:=$(BASE_CACHE)/$(host)/$(1)/$(1)-$($(1)_version)-$($(1)_build_id).tar.gz.hash
+$(1)_patch_dir:=$(base_build_dir)/$(host)/$(1)/$($(1)_version)-$($(1)_build_id)/.patches-$($(1)_build_id)
+$(1)_prefixbin:=$($($(1)_type)_prefix)/bin/
+$(1)_cached:=$(BASE_CACHE)/$(host)/$(1)/$(1)-$($(1)_version)-$($(1)_build_id).tar.gz
+$(1)_all_sources=$($(1)_file_name) $($(1)_extra_sources)
+
+#stamps
+$(1)_fetched=$(SOURCES_PATH)/download-stamps/.stamp_fetched-$(1)-$($(1)_file_name).hash
+$(1)_extracted=$$($(1)_extract_dir)/.stamp_extracted
+$(1)_preprocessed=$$($(1)_extract_dir)/.stamp_preprocessed
+$(1)_cleaned=$$($(1)_extract_dir)/.stamp_cleaned
+$(1)_built=$$($(1)_build_dir)/.stamp_built
+$(1)_configured=$$($(1)_build_dir)/.stamp_configured
+$(1)_staged=$$($(1)_staging_dir)/.stamp_staged
+$(1)_postprocessed=$$($(1)_staging_prefix_dir)/.stamp_postprocessed
+$(1)_download_path_fixed=$(subst :,\:,$$($(1)_download_path))
+
+
+#default commands
+# The default behavior for tar will try to set ownership when running as uid 0 and may not succeed, --no-same-owner disables this behavior
+$(1)_fetch_cmds ?= $(call fetch_file,$(1),$(subst \:,:,$$($(1)_download_path_fixed)),$$($(1)_download_file),$($(1)_file_name),$($(1)_sha256_hash))
+$(1)_extract_cmds ?= mkdir -p $$($(1)_extract_dir) && echo "$$($(1)_sha256_hash)  $$($(1)_source)" > $$($(1)_extract_dir)/.$$($(1)_file_name).hash &&  $(build_SHA256SUM) -c $$($(1)_extract_dir)/.$$($(1)_file_name).hash && tar --no-same-owner --strip-components=1 -xf $$($(1)_source)
+$(1)_preprocess_cmds ?=
+$(1)_build_cmds ?=
+$(1)_config_cmds ?=
+$(1)_stage_cmds ?=
+$(1)_set_vars ?=
+
+
+all_sources+=$$($(1)_fetched)
+endef
+#$(foreach dep_target,$($(1)_all_dependencies),$(eval $(1)_dependency_targets=$($(dep_target)_cached)))
+
+
+define int_config_attach_build_config
+$(eval $(call $(1)_set_vars,$(1)))
+$(1)_cflags+=$($(1)_cflags_$(release_type))
+$(1)_cflags+=$($(1)_cflags_$(host_arch)) $($(1)_cflags_$(host_arch)_$(release_type))
+$(1)_cflags+=$($(1)_cflags_$(host_os)) $($(1)_cflags_$(host_os)_$(release_type))
+$(1)_cflags+=$($(1)_cflags_$(host_arch)_$(host_os)) $($(1)_cflags_$(host_arch)_$(host_os)_$(release_type))
+
+$(1)_cxxflags+=$($(1)_cxxflags_$(release_type))
+$(1)_cxxflags+=$($(1)_cxxflags_$(host_arch)) $($(1)_cxxflags_$(host_arch)_$(release_type))
+$(1)_cxxflags+=$($(1)_cxxflags_$(host_os)) $($(1)_cxxflags_$(host_os)_$(release_type))
+$(1)_cxxflags+=$($(1)_cxxflags_$(host_arch)_$(host_os)) $($(1)_cxxflags_$(host_arch)_$(host_os)_$(release_type))
+
+$(1)_cppflags+=$($(1)_cppflags_$(release_type))
+$(1)_cppflags+=$($(1)_cppflags_$(host_arch)) $($(1)_cppflags_$(host_arch)_$(release_type))
+$(1)_cppflags+=$($(1)_cppflags_$(host_os)) $($(1)_cppflags_$(host_os)_$(release_type))
+$(1)_cppflags+=$($(1)_cppflags_$(host_arch)_$(host_os)) $($(1)_cppflags_$(host_arch)_$(host_os)_$(release_type))
+
+$(1)_ldflags+=$($(1)_ldflags_$(release_type))
+$(1)_ldflags+=$($(1)_ldflags_$(host_arch)) $($(1)_ldflags_$(host_arch)_$(release_type))
+$(1)_ldflags+=$($(1)_ldflags_$(host_os)) $($(1)_ldflags_$(host_os)_$(release_type))
+$(1)_ldflags+=$($(1)_ldflags_$(host_arch)_$(host_os)) $($(1)_ldflags_$(host_arch)_$(host_os)_$(release_type))
+
+$(1)_build_opts+=$$($(1)_build_opts_$(release_type))
+$(1)_build_opts+=$$($(1)_build_opts_$(host_arch)) $$($(1)_build_opts_$(host_arch)_$(release_type))
+$(1)_build_opts+=$$($(1)_build_opts_$(host_os)) $$($(1)_build_opts_$(host_os)_$(release_type))
+$(1)_build_opts+=$$($(1)_build_opts_$(host_arch)_$(host_os)) $$($(1)_build_opts_$(host_arch)_$(host_os)_$(release_type))
+
+$(1)_config_opts+=$$($(1)_config_opts_$(release_type))
+$(1)_config_opts+=$$($(1)_config_opts_$(host_arch)) $$($(1)_config_opts_$(host_arch)_$(release_type))
+$(1)_config_opts+=$$($(1)_config_opts_$(host_os)) $$($(1)_config_opts_$(host_os)_$(release_type))
+$(1)_config_opts+=$$($(1)_config_opts_$(host_arch)_$(host_os)) $$($(1)_config_opts_$(host_arch)_$(host_os)_$(release_type))
+
+$(1)_config_env+=$$($(1)_config_env_$(release_type))
+$(1)_config_env+=$($(1)_config_env_$(host_arch)) $($(1)_config_env_$(host_arch)_$(release_type))
+$(1)_config_env+=$($(1)_config_env_$(host_os)) $($(1)_config_env_$(host_os)_$(release_type))
+$(1)_config_env+=$($(1)_config_env_$(host_arch)_$(host_os)) $($(1)_config_env_$(host_arch)_$(host_os)_$(release_type))
+
+$(1)_config_env+=PKG_CONFIG_LIBDIR=$($($(1)_type)_prefix)/lib/pkgconfig
+$(1)_config_env+=PKG_CONFIG_PATH=$($($(1)_type)_prefix)/share/pkgconfig
+$(1)_config_env+=PATH="$(build_prefix)/bin:$(PATH)"
+$(1)_build_env+=PATH="$(build_prefix)/bin:$(PATH)"
+$(1)_stage_env+=PATH="$(build_prefix)/bin:$(PATH)"
+$(1)_autoconf=./configure --host=$($($(1)_type)_host) --prefix=$($($(1)_type)_prefix) $$($(1)_config_opts) CC="$$($(1)_cc)" CXX="$$($(1)_cxx)"
+
+ifneq ($($(1)_nm),)
+$(1)_autoconf += NM="$$($(1)_nm)"
+endif
+ifneq ($($(1)_ranlib),)
+$(1)_autoconf += RANLIB="$$($(1)_ranlib)"
+endif
+ifneq ($($(1)_ar),)
+$(1)_autoconf += AR="$$($(1)_ar)"
+endif
+ifneq ($($(1)_cflags),)
+$(1)_autoconf += CFLAGS="$$($(1)_cflags)"
+endif
+ifneq ($($(1)_cxxflags),)
+$(1)_autoconf += CXXFLAGS="$$($(1)_cxxflags)"
+endif
+ifneq ($($(1)_cppflags),)
+$(1)_autoconf += CPPFLAGS="$$($(1)_cppflags)"
+endif
+ifneq ($($(1)_ldflags),)
+$(1)_autoconf += LDFLAGS="$$($(1)_ldflags)"
+endif
+endef
+
+define int_add_cmds
+$($(1)_fetched):
+	$(AT)mkdir -p $$(@D) $(SOURCES_PATH)
+	$(AT)rm -f $$@
+	$(AT)touch $$@
+	$(AT)cd $$(@D); $(call $(1)_fetch_cmds,$(1))
+	$(AT)cd $($(1)_source_dir); $(foreach source,$($(1)_all_sources),$(build_SHA256SUM) $(source) >> $$(@);)
+	$(AT)touch $$@
+$($(1)_extracted): | $($(1)_fetched)
+	$(AT)echo Extracting $(1)...
+	$(AT)mkdir -p $$(@D)
+	$(AT)cd $$(@D); $(call $(1)_extract_cmds,$(1))
+	$(AT)touch $$@
+$($(1)_preprocessed): | $($(1)_dependencies) $($(1)_extracted)
+	$(AT)echo Preprocessing $(1)...
+	$(AT)mkdir -p $$(@D) $($(1)_patch_dir)
+	$(AT)$(foreach patch,$($(1)_patches),cd $(PATCHES_PATH)/$(1); cp $(patch) $($(1)_patch_dir) ;)
+	$(AT)cd $$(@D); $(call $(1)_preprocess_cmds, $(1))
+	$(AT)touch $$@
+$($(1)_configured): | $($(1)_preprocessed)
+	$(AT)echo Configuring $(1)...
+	$(AT)rm -rf $(host_prefix); mkdir -p $(host_prefix)/lib; cd $(host_prefix); $(foreach package,$($(1)_all_dependencies), tar --no-same-owner -xf $($(package)_cached); )
+	$(AT)mkdir -p $$(@D)
+	$(AT)+cd $$(@D); $($(1)_config_env) $(call $(1)_config_cmds, $(1))
+	$(AT)touch $$@
+$($(1)_built): | $($(1)_configured)
+	$(AT)echo Building $(1)...
+	$(AT)mkdir -p $$(@D)
+	$(AT)+cd $$(@D); $($(1)_build_env) $(call $(1)_build_cmds, $(1))
+	$(AT)touch $$@
+$($(1)_staged): | $($(1)_built)
+	$(AT)echo Staging $(1)...
+	$(AT)mkdir -p $($(1)_staging_dir)/$(host_prefix)
+	$(AT)cd $($(1)_build_dir); $($(1)_stage_env) $(call $(1)_stage_cmds, $(1))
+	$(AT)rm -rf $($(1)_extract_dir)
+	$(AT)touch $$@
+$($(1)_postprocessed): | $($(1)_staged)
+	$(AT)echo Postprocessing $(1)...
+	$(AT)cd $($(1)_staging_prefix_dir); $(call $(1)_postprocess_cmds)
+	$(AT)touch $$@
+$($(1)_cached): | $($(1)_dependencies) $($(1)_postprocessed)
+	$(AT)echo Caching $(1)...
+	$(AT)cd $$($(1)_staging_dir)/$(host_prefix); find . | sort | tar --no-recursion -czf $$($(1)_staging_dir)/$$(@F) -T -
+	$(AT)mkdir -p $$(@D)
+	$(AT)rm -rf $$(@D) && mkdir -p $$(@D)
+	$(AT)mv $$($(1)_staging_dir)/$$(@F) $$(@)
+	$(AT)rm -rf $($(1)_staging_dir)
+$($(1)_cached_checksum): $($(1)_cached)
+	$(AT)cd $$(@D); $(build_SHA256SUM) $$(<F) > $$(@)
+
+.PHONY: $(1)
+$(1): | $($(1)_cached_checksum)
+.SECONDARY: $($(1)_cached) $($(1)_postprocessed) $($(1)_staged) $($(1)_built) $($(1)_configured) $($(1)_preprocessed) $($(1)_extracted) $($(1)_fetched)
+
+endef
+
+# These functions create the build targets for each package. They must be
+# broken down into small steps so that each part is done for all packages
+# before moving on to the next step. Otherwise, a package's info
+# (build-id for example) would only be available to another package if it
+# happened to be computed already.
+
+#set the type for host/build packages.
+$(foreach native_package,$(native_packages),$(eval $(native_package)_type=build))
+$(foreach package,$(packages),$(eval $(package)_type=$(host_arch)_$(host_os)))
+
+#set overridable defaults
+$(foreach package,$(all_packages),$(eval $(call int_vars,$(package))))
+
+#include package files
+$(foreach package,$(all_packages),$(eval include packages/$(package).mk))
+
+#compute a hash of all files that comprise this package's build recipe
+$(foreach package,$(all_packages),$(eval $(call int_get_build_recipe_hash,$(package))))
+
+#generate a unique id for this package, incorporating its dependencies as well
+$(foreach package,$(all_packages),$(eval $(call int_get_build_id,$(package))))
+
+#compute final vars after reading package vars
+$(foreach package,$(all_packages),$(eval $(call int_config_attach_build_config,$(package))))
+
+#create build targets
+$(foreach package,$(all_packages),$(eval $(call int_add_cmds,$(package))))
+
+#special exception: if a toolchain package exists, all non-native packages depend on it
+$(foreach package,$(packages),$(eval $($(package)_unpacked): |$($($(host_arch)_$(host_os)_native_toolchain)_cached) $($($(host_arch)_$(host_os)_native_binutils)_cached) ))
diff --git a/depend/zcash/depends/hosts/darwin.mk b/depend/zcash/depends/hosts/darwin.mk
new file mode 100644
index 000000000..78d696a7a
--- /dev/null
+++ b/depend/zcash/depends/hosts/darwin.mk
@@ -0,0 +1,43 @@
+OSX_MIN_VERSION=10.14
+XCODE_VERSION=11.3.1
+XCODE_BUILD_ID=11C505
+LD64_VERSION=530
+
+OSX_SDK=$(SDK_PATH)/Xcode-$(XCODE_VERSION)-$(XCODE_BUILD_ID)-extracted-SDK-with-libcxx-headers
+
+# Flag explanations:
+#
+#     -mlinker-version
+#
+#         Ensures that modern linker features are enabled. See here for more
+#         details: https://github.com/bitcoin/bitcoin/pull/19407.
+#
+#     -B$(build_prefix)/bin
+#
+#         Explicitly point to our binaries (e.g. cctools) so that they are
+#         ensured to be found and preferred over other possibilities.
+#
+#     -nostdinc++ -isystem $(OSX_SDK)/usr/include/c++/v1
+#
+#         Forces clang to use the libc++ headers from our SDK and completely
+#         forget about the libc++ headers from the standard directories
+#
+#         TODO: Once we start requiring a clang version that has the
+#         -stdlib++-isystem<directory> flag first introduced here:
+#         https://reviews.llvm.org/D64089, we should use that instead. Read the
+#         differential summary there for more details.
+#
+darwin_CC=clang -target $(host) -mmacosx-version-min=$(OSX_MIN_VERSION) --sysroot $(OSX_SDK) -mlinker-version=$(LD64_VERSION) -B$(build_prefix)/bin
+darwin_CXX=clang++ -target $(host) -mmacosx-version-min=$(OSX_MIN_VERSION) --sysroot $(OSX_SDK) -stdlib=libc++ -mlinker-version=$(LD64_VERSION) -B$(build_prefix)/bin -nostdinc++ -isystem $(OSX_SDK)/usr/include/c++/v1
+
+darwin_CFLAGS=-pipe
+darwin_CXXFLAGS=$(darwin_CFLAGS)
+
+darwin_release_CFLAGS=-O3
+darwin_release_CXXFLAGS=$(darwin_release_CFLAGS)
+
+darwin_debug_CFLAGS=-O0
+darwin_debug_CXXFLAGS=$(darwin_debug_CFLAGS)
+
+darwin_native_binutils=native_cctools
+darwin_native_toolchain=native_cctools
diff --git a/depend/zcash/depends/hosts/default.mk b/depend/zcash/depends/hosts/default.mk
new file mode 100644
index 000000000..ec9ca3e63
--- /dev/null
+++ b/depend/zcash/depends/hosts/default.mk
@@ -0,0 +1,45 @@
+# Flag explanations:
+#
+#     -B$(build_prefix)/bin
+#
+#         Explicitly point to our binaries (e.g. cctools) so that they are
+#         ensured to be found and preferred over other possibilities.
+#
+default_host_CC = clang -target $(host) -B$(build_prefix)/bin
+default_host_CXX = clang++ -target $(host) -B$(build_prefix)/bin -stdlib=libc++
+default_host_AR = llvm-ar
+default_host_RANLIB = llvm-ranlib
+default_host_STRIP = llvm-strip
+default_host_LIBTOOL = $(host_toolchain)libtool
+default_host_INSTALL_NAME_TOOL = $(host_toolchain)install_name_tool
+default_host_OTOOL = $(host_toolchain)otool
+default_host_NM = llvm-nm
+
+$(host_os)_native_binutils?=native_clang
+$(host_os)_native_toolchain?=native_clang
+
+define add_host_tool_func
+ifneq ($(filter $(origin $1),undefined default),)
+# Do not consider the well-known var $1 if it is undefined or is taking a value
+# that is predefined by "make" (e.g. the make variable "CC" has a predefined
+# value of "cc")
+$(host_os)_$1?=$$(default_host_$1)
+$(host_arch)_$(host_os)_$1?=$$($(host_os)_$1)
+$(host_arch)_$(host_os)_$(release_type)_$1?=$$($(host_os)_$1)
+else
+$(host_os)_$1=$(or $($1),$($(host_os)_$1),$(default_host_$1))
+$(host_arch)_$(host_os)_$1=$(or $($1),$($(host_arch)_$(host_os)_$1),$$($(host_os)_$1))
+$(host_arch)_$(host_os)_$(release_type)_$1=$(or $($1),$($(host_arch)_$(host_os)_$(release_type)_$1),$$($(host_os)_$1))
+endif
+host_$1=$$($(host_arch)_$(host_os)_$1)
+endef
+
+define add_host_flags_func
+$(host_arch)_$(host_os)_$1 += $($(host_os)_$1)
+$(host_arch)_$(host_os)_$(release_type)_$1 += $($(host_os)_$(release_type)_$1)
+host_$1 = $$($(host_arch)_$(host_os)_$1)
+host_$(release_type)_$1 = $$($(host_arch)_$(host_os)_$(release_type)_$1)
+endef
+
+$(foreach tool,CC CXX AR RANLIB STRIP NM LIBTOOL OTOOL INSTALL_NAME_TOOL,$(eval $(call add_host_tool_func,$(tool))))
+$(foreach flags,CFLAGS CXXFLAGS CPPFLAGS LDFLAGS, $(eval $(call add_host_flags_func,$(flags))))
diff --git a/depend/zcash/depends/hosts/freebsd.mk b/depend/zcash/depends/hosts/freebsd.mk
new file mode 100644
index 000000000..a8d5c0171
--- /dev/null
+++ b/depend/zcash/depends/hosts/freebsd.mk
@@ -0,0 +1,20 @@
+freebsd_CFLAGS=-pipe
+freebsd_CXXFLAGS=$(freebsd_CFLAGS)
+
+freebsd_release_CFLAGS=-O3
+freebsd_release_CXXFLAGS=$(freebsd_release_CFLAGS)
+
+freebsd_debug_CFLAGS=-O0
+freebsd_debug_CXXFLAGS=$(freebsd_debug_CFLAGS)
+
+freebsd_debug_CPPFLAGS=-D_GLIBCXX_DEBUG -D_GLIBCXX_DEBUG_PEDANTIC
+
+# Changes below have not been tested. If you try to build on FreeBSD,
+# please let us know how it goes.
+
+freebsd_LDFLAGS?=-fuse-ld=lld
+
+i686_freebsd_CC=$(default_host_CC) -m32
+i686_freebsd_CXX=$(default_host_CXX) -m32
+x86_64_freebsd_CC=$(default_host_CC) -m64
+x86_64_freebsd_CXX=$(default_host_CXX) -m64
diff --git a/depend/zcash/depends/hosts/linux.mk b/depend/zcash/depends/hosts/linux.mk
new file mode 100644
index 000000000..160bdbb91
--- /dev/null
+++ b/depend/zcash/depends/hosts/linux.mk
@@ -0,0 +1,25 @@
+linux_CFLAGS=-pipe
+linux_CXXFLAGS=$(linux_CFLAGS)
+
+linux_release_CFLAGS=-O3
+linux_release_CXXFLAGS=$(linux_release_CFLAGS)
+
+linux_debug_CFLAGS=-O0
+linux_debug_CXXFLAGS=$(linux_debug_CFLAGS)
+
+linux_debug_CPPFLAGS=-D_GLIBCXX_DEBUG -D_GLIBCXX_DEBUG_PEDANTIC
+
+linux_LDFLAGS?=-fuse-ld=lld
+
+i686_linux_CC=$(default_host_CC) -m32
+i686_linux_CXX=$(default_host_CXX) -m32
+x86_64_linux_CC=$(default_host_CC) -m64
+x86_64_linux_CXX=$(default_host_CXX) -m64
+
+# Clang doesn't appear to find these multilib paths by default,
+# so help it out if we are cross-compiling.
+ifneq ($(canonical_host),$(build))
+  # CFLAGS is copied to CXXFLAGS after it is fully-evaluated.
+  linux_CFLAGS += -idirafter /usr/$(host)/include
+  linux_LDFLAGS += -L/usr/$(host)/lib
+endif
diff --git a/depend/zcash/depends/hosts/mingw32.mk b/depend/zcash/depends/hosts/mingw32.mk
new file mode 100644
index 000000000..e48546cce
--- /dev/null
+++ b/depend/zcash/depends/hosts/mingw32.mk
@@ -0,0 +1,12 @@
+mingw32_CFLAGS=-pipe
+mingw32_CXXFLAGS=$(mingw32_CFLAGS) -isystem $(host_prefix)/include/c++/v1
+
+mingw32_LDFLAGS?=-fuse-ld=lld
+
+mingw32_release_CFLAGS=-O3
+mingw32_release_CXXFLAGS=$(mingw32_release_CFLAGS)
+
+mingw32_debug_CFLAGS=-O0
+mingw32_debug_CXXFLAGS=$(mingw32_debug_CFLAGS)
+
+mingw32_debug_CPPFLAGS=-D_GLIBCXX_DEBUG -D_GLIBCXX_DEBUG_PEDANTIC
diff --git a/depend/zcash/depends/packages.md b/depend/zcash/depends/packages.md
new file mode 100644
index 000000000..14bb8f3d9
--- /dev/null
+++ b/depend/zcash/depends/packages.md
@@ -0,0 +1,186 @@
+Each recipe consists of 3 main parts: defining identifiers, setting build
+variables, and defining build commands.
+
+The package "mylib" will be used here as an example
+
+General tips:
+- mylib_foo is written as $(package)_foo in order to make recipes more similar.
+- Secondary dependency packages relative to the Zcash binaries/libraries (i.e.
+  those not in `ALLOWED_LIBRARIES` in `contrib/devtools/symbol-check.py`) should
+  be built statically. See [below](#secondary-dependencies) for more details.
+
+## Identifiers
+Each package is required to define at least these variables:
+
+    $(package)_version:
+    Version of the upstream library or program. If there is no version, a
+    placeholder such as 1.0 can be used.
+
+    $(package)_download_path:
+    Location of the upstream source, without the file-name. Usually http, https
+    or ftp. Secure transmission options like https should be preferred if
+    available.
+
+    $(package)_file_name:
+    The upstream source filename available at the download path.
+
+    $(package)_sha256_hash:
+    The sha256 hash of the upstream file
+
+These variables are optional:
+
+    $(package)_build_subdir:
+    cd to this dir before running configure/build/stage commands.
+    
+    $(package)_download_file:
+    The file-name of the upstream source if it differs from how it should be
+    stored locally. This can be used to avoid storing file-names with strange
+    characters.
+    
+    $(package)_dependencies:
+    Names of any other packages that this one depends on.
+    
+    $(package)_patches:
+    Filenames of any patches needed to build the package
+
+    $(package)_extra_sources:
+    Any extra files that will be fetched via $(package)_fetch_cmds. These are
+    specified so that they can be fetched and verified via 'make download'.
+
+
+## Build Variables:
+After defining the main identifiers, build variables may be added or customized
+before running the build commands. They should be added to a function called
+$(package)_set_vars. For example:
+
+    define $(package)_set_vars
+    ...
+    endef
+
+Most variables can be prefixed with the host, architecture, or both, to make
+the modifications specific to that case. For example:
+
+    Universal:     $(package)_cc=gcc
+    Linux only:    $(package)_linux_cc=gcc
+    x86_64 only:       $(package)_x86_64_cc = gcc
+    x86_64 linux only: $(package)_x86_64_linux_cc = gcc
+
+These variables may be set to override or append their default values.
+
+    $(package)_cc
+    $(package)_cxx
+    $(package)_objc
+    $(package)_objcxx
+    $(package)_ar
+    $(package)_ranlib
+    $(package)_libtool
+    $(package)_nm
+    $(package)_cflags
+    $(package)_cxxflags
+    $(package)_ldflags
+    $(package)_cppflags
+    $(package)_config_env
+    $(package)_build_env
+    $(package)_stage_env
+    $(package)_build_opts
+    $(package)_config_opts
+
+The *_env variables are used to add environment variables to the respective
+commands.
+
+Many variables respect a debug/release suffix as well, in order to use them for
+only the appropriate build config. For example:
+
+    $(package)_cflags_release = -O3
+    $(package)_cflags_i686_debug = -g
+    $(package)_config_opts_release = --disable-debug
+
+These will be used in addition to the options that do not specify
+debug/release. All builds are considered to be release unless DEBUG=1 is set by
+the user. Other variables may be defined as needed.
+
+## Build commands:
+
+  For each build, a unique build dir and staging dir are created. For example,
+  `work/build/mylib/1.0-1adac830f6e` and `work/staging/mylib/1.0-1adac830f6e`.
+
+  The following build commands are available for each recipe:
+
+    $(package)_fetch_cmds:
+    Runs from: build dir
+    Fetch the source file. If undefined, it will be fetched and verified
+    against its hash.
+
+    $(package)_extract_cmds:
+    Runs from: build dir
+    Verify the source file against its hash and extract it. If undefined, the
+    source is assumed to be a tarball.
+
+    $(package)_preprocess_cmds:
+    Runs from: build dir/$(package)_build_subdir
+    Preprocess the source as necessary. If undefined, does nothing.
+
+    $(package)_config_cmds:
+    Runs from: build dir/$(package)_build_subdir
+    Configure the source. If undefined, does nothing.
+
+    $(package)_build_cmds:
+    Runs from: build dir/$(package)_build_subdir
+    Build the source. If undefined, does nothing.
+
+    $(package)_stage_cmds:
+    Runs from: build dir/$(package)_build_subdir
+    Stage the build results. If undefined, does nothing.
+
+  The following variables are available for each recipe:
+    
+    $(1)_staging_dir: package's destination sysroot path
+    $(1)_staging_prefix_dir: prefix path inside of the package's staging dir
+    $(1)_extract_dir: path to the package's extracted sources
+    $(1)_build_dir: path where configure/build/stage commands will be run
+    $(1)_patch_dir: path where the package's patches (if any) are found
+
+Notes on build commands:
+
+For packages built with autotools, $($(package)_autoconf) can be used in the
+configure step to (usually) correctly configure automatically. Any
+$($(package)_config_opts) will be appended.
+
+Most autotools projects can be properly staged using:
+
+    $(MAKE) DESTDIR=$($(package)_staging_dir) install
+
+## Build outputs:
+
+In general, the output of a depends package should not contain any libtool
+archives. Instead, the package should output `.pc` (`pkg-config`) files where
+possible.
+
+From the [Gentoo Wiki entry](https://wiki.gentoo.org/wiki/Project:Quality_Assurance/Handling_Libtool_Archives):
+
+>  Libtool pulls in all direct and indirect dependencies into the .la files it
+>  creates. This leads to massive overlinking, which is toxic to the Gentoo
+>  ecosystem, as it leads to a massive number of unnecessary rebuilds.
+
+## Secondary dependencies:
+
+Secondary dependency packages relative to the Zcash binaries/libraries (i.e.
+those not in `ALLOWED_LIBRARIES` in `contrib/devtools/symbol-check.py`)
+should be built statically. The arguments for statically linking secondary
+dependencies are similar to those for primary dependencies: it is preferable
+for promptness of security updates; consensus compatibility; ease of
+debugging and reproduction of user issues; avoiding unintended breakage
+due to incompatible changes; and portability across OS distributions. It also
+improves general build reliability as illustrated by the following example:
+
+When linking an executable against a shared library `libprimary` that has its
+own shared dependency `libsecondary`, we may need to specify the path to
+`libsecondary` on the link command using the `-rpath/-rpath-link` options, it is
+not sufficient to just say `libprimary`.
+
+For us, it's much easier to just link a static `libsecondary` into a shared
+`libprimary`. Especially because in our case, we are linking against a dummy
+`libprimary` anyway that we'll throw away. We don't care if the end-user has a
+static or dynamic `libseconday`, that's not our concern. With a static
+`libseconday`, when we need to link `libprimary` into our executable, there's no
+dependency chain to worry about as `libprimary` has all the symbols.
diff --git a/depend/zcash/depends/packages/bdb.mk b/depend/zcash/depends/packages/bdb.mk
new file mode 100644
index 000000000..350816eeb
--- /dev/null
+++ b/depend/zcash/depends/packages/bdb.mk
@@ -0,0 +1,53 @@
+package=bdb
+$(package)_version=6.2.23
+$(package)_download_path=https://download.oracle.com/berkeley-db
+$(package)_file_name=db-$($(package)_version).tar.gz
+$(package)_sha256_hash=47612c8991aa9ac2f6be721267c8d3cdccf5ac83105df8e50809daea24e95dc7
+$(package)_build_subdir=build_unix
+$(package)_patches=clang-12-stpcpy-issue.diff winioctl-and-atomic_init_db.patch
+
+ifneq ($(host_os),darwin)
+$(package)_dependencies=libcxx
+endif
+
+define $(package)_set_vars
+$(package)_config_opts=--disable-shared --enable-cxx --disable-replication --enable-option-checking
+$(package)_config_opts_mingw32=--enable-mingw
+$(package)_config_opts_linux=--with-pic
+$(package)_config_opts_freebsd=--with-pic
+ifneq ($(build_os),darwin)
+$(package)_config_opts_darwin=--disable-atomicsupport
+endif
+$(package)_config_opts_aarch64=--disable-atomicsupport
+$(package)_cxxflags+=-std=c++17
+
+ifeq ($(host_os),freebsd)
+  $(package)_ldflags+=-static-libstdc++ -lcxxrt
+else
+  $(package)_ldflags+=-static-libstdc++ -lc++abi
+endif
+
+endef
+
+define $(package)_preprocess_cmds
+  patch -p1 <$($(package)_patch_dir)/clang-12-stpcpy-issue.diff && \
+  patch -p1 <$($(package)_patch_dir)/winioctl-and-atomic_init_db.patch
+endef
+
+define $(package)_config_cmds
+  ../dist/$($(package)_autoconf)
+endef
+
+define $(package)_build_cmds
+  $(MAKE) libdb_cxx-6.2.a libdb-6.2.a
+endef
+
+define $(package)_stage_cmds
+  $(MAKE) DESTDIR=$($(package)_staging_dir) install
+endef
+
+define $(package)_postprocess_cmds
+  cd $(BASEDIR)/../zcutil && \
+  mkdir -p bin && \
+  mv -f $($(package)_staging_dir)$(host_prefix)/bin/db_* bin
+endef
diff --git a/depend/zcash/depends/packages/boost.mk b/depend/zcash/depends/packages/boost.mk
new file mode 100644
index 000000000..d94be2d67
--- /dev/null
+++ b/depend/zcash/depends/packages/boost.mk
@@ -0,0 +1,66 @@
+package=boost
+$(package)_version=1_79_0
+$(package)_download_path=https://boostorg.jfrog.io/artifactory/main/release/$(subst _,.,$($(package)_version))/source/
+$(package)_file_name=boost_$($(package)_version).tar.bz2
+$(package)_sha256_hash=475d589d51a7f8b3ba2ba4eda022b170e562ca3b760ee922c146b6c65856ef39
+$(package)_dependencies=native_b2
+
+ifneq ($(host_os),darwin)
+$(package)_dependencies+=libcxx
+endif
+
+define $(package)_set_vars
+$(package)_config_opts_release=variant=release
+$(package)_config_opts_debug=variant=debug
+$(package)_config_opts=--layout=system --user-config=user-config.jam
+$(package)_config_opts+=threading=multi link=static -sNO_COMPRESSION=1
+$(package)_config_opts_linux=target-os=linux threadapi=pthread runtime-link=shared
+$(package)_config_opts_freebsd=cxxflags=-fPIC
+$(package)_config_opts_darwin=target-os=darwin runtime-link=shared
+$(package)_config_opts_mingw32=target-os=windows binary-format=pe threadapi=win32 runtime-link=static
+$(package)_config_opts_x86_64=architecture=x86 address-model=64
+$(package)_config_opts_i686=architecture=x86 address-model=32
+$(package)_config_opts_aarch64=address-model=64
+$(package)_config_opts_armv7a=address-model=32
+ifneq (,$(findstring clang,$($(package)_cxx)))
+$(package)_toolset_$(host_os)=clang
+else
+$(package)_toolset_$(host_os)=gcc
+endif
+$(package)_config_libraries=chrono,filesystem,program_options,system,thread,test
+$(package)_cxxflags+=-std=c++17 -fvisibility=hidden
+$(package)_cxxflags_linux=-fPIC
+$(package)_cxxflags_freebsd=-fPIC
+
+ifeq ($(host_os),freebsd)
+  $(package)_ldflags+=-static-libstdc++ -lcxxrt
+else
+  $(package)_ldflags+=-static-libstdc++ -lc++abi
+endif
+
+endef
+
+define $(package)_preprocess_cmds
+  echo "using $($(package)_toolset_$(host_os)) : : $($(package)_cxx) : <cflags>\"$($(package)_cflags)\" <cxxflags>\"$($(package)_cxxflags)\" <compileflags>\"$($(package)_cppflags)\" <linkflags>\"$($(package)_ldflags)\" <archiver>\"$($(package)_ar)\" <striper>\"$(host_STRIP)\"  <ranlib>\"$(host_RANLIB)\" <rc>\"$(host_WINDRES)\" : ;" > user-config.jam
+endef
+
+define $(package)_config_cmds
+  ./bootstrap.sh --without-icu --with-libraries=$($(package)_config_libraries) --with-toolset=$($(package)_toolset_$(host_os)) --with-bjam=b2
+endef
+
+define $(package)_build_cmds
+  b2 -d2 -j2 -d1 --prefix=$($(package)_staging_prefix_dir) $($(package)_config_opts) toolset=$($(package)_toolset_$(host_os)) stage
+endef
+
+define $(package)_stage_cmds
+  b2 -d0 -j4 --prefix=$($(package)_staging_prefix_dir) $($(package)_config_opts) toolset=$($(package)_toolset_$(host_os)) install
+endef
+
+# Boost uses the MSVC convention of libboost_foo.lib as the naming pattern when
+# compiling for Windows, even though we use MinGW which follows the libfoo.a
+# convention. This causes issues with lld, so we rename all .lib files to .a.
+ifeq ($(host_os),mingw32)
+define $(package)_postprocess_cmds
+  for f in lib/*.lib; do mv -- "$$$$f" "$$$${f%.lib}.a"; done
+endef
+endif
diff --git a/depend/zcash/depends/packages/googletest.mk b/depend/zcash/depends/packages/googletest.mk
new file mode 100644
index 000000000..51c49e311
--- /dev/null
+++ b/depend/zcash/depends/packages/googletest.mk
@@ -0,0 +1,36 @@
+package=googletest
+$(package)_version=1.8.1
+$(package)_download_path=https://github.com/google/$(package)/archive/
+$(package)_file_name=$(package)-$($(package)_version).tar.gz
+$(package)_download_file=release-$($(package)_version).tar.gz
+$(package)_sha256_hash=9bf1fe5182a604b4135edc1a425ae356c9ad15e9b23f9f12a02e80184c3a249c
+
+ifneq ($(host_os),darwin)
+$(package)_dependencies=libcxx
+endif
+
+define $(package)_set_vars
+$(package)_cxxflags+=-std=c++17
+$(package)_cxxflags_linux=-fPIC
+$(package)_cxxflags_freebsd=-fPIC
+
+ifeq ($(host_os),freebsd)
+  $(package)_ldflags+=-static-libstdc++ -lcxxrt
+else
+  $(package)_ldflags+=-static-libstdc++ -lc++abi
+endif
+
+endef
+
+define $(package)_build_cmds
+  $(MAKE) -C googlemock/make CC="$($(package)_cc)" CXX="$($(package)_cxx)" AR="$($(package)_ar)" CXXFLAGS="$($(package)_cxxflags)" gmock.a && \
+  $($(package)_build_env) $(MAKE) -C googletest/make CC="$($(package)_cc)" CXX="$($(package)_cxx)" AR="$($(package)_ar)" CXXFLAGS="$($(package)_cxxflags)" gtest.a
+endef
+
+define $(package)_stage_cmds
+  mkdir -p $($(package)_staging_dir)$(host_prefix)/lib && \
+  install ./googlemock/make/gmock.a $($(package)_staging_dir)$(host_prefix)/lib/libgmock.a && \
+  install ./googletest/make/gtest.a $($(package)_staging_dir)$(host_prefix)/lib/libgtest.a && \
+  cp -a ./googlemock/include $($(package)_staging_dir)$(host_prefix)/ && \
+  cp -a ./googletest/include $($(package)_staging_dir)$(host_prefix)/
+endef
diff --git a/depend/zcash/depends/packages/libcxx.mk b/depend/zcash/depends/packages/libcxx.mk
new file mode 100644
index 000000000..bbadd228e
--- /dev/null
+++ b/depend/zcash/depends/packages/libcxx.mk
@@ -0,0 +1,75 @@
+package=libcxx
+$(package)_version=$(native_clang_version)
+
+ifneq ($(canonical_host),$(build))
+ifneq ($(host_os),mingw32)
+# Clang is provided pre-compiled for a bunch of targets; fetch the one we need
+# and stage its copies of the static libraries.
+$(package)_download_path=$(native_clang_download_path)
+$(package)_download_file_aarch64_linux=clang+llvm-$($(package)_version)-aarch64-linux-gnu.tar.xz
+$(package)_file_name_aarch64_linux=clang-llvm-$($(package)_version)-aarch64-linux-gnu.tar.xz
+$(package)_sha256_hash_aarch64_linux=15ff2db12683e69e552b6668f7ca49edaa01ce32cb1cbc8f8ed2e887ab291069
+$(package)_download_file_linux=clang+llvm-$($(package)_version)-x86_64-linux-gnu-ubuntu-18.04.tar.xz
+$(package)_file_name_linux=clang-llvm-$($(package)_version)-x86_64-linux-gnu-ubuntu-18.04.tar.xz
+$(package)_sha256_hash_linux=84a54c69781ad90615d1b0276a83ff87daaeded99fbc64457c350679df7b4ff0
+
+define $(package)_stage_cmds
+  mkdir -p $($(package)_staging_prefix_dir)/lib && \
+  cp lib/libc++.a $($(package)_staging_prefix_dir)/lib && \
+  cp lib/libc++abi.a $($(package)_staging_prefix_dir)/lib
+endef
+
+else
+# For Windows cross-compilation, use the MSYS2 binaries.
+# Using 13.0.0-3 because 13.0.1-1 has missing `new` and `delete` symbols.
+$(package)_download_path=https://repo.msys2.org/mingw/x86_64
+$(package)_download_file=mingw-w64-x86_64-libc++-13.0.0-3-any.pkg.tar.zst
+$(package)_file_name=mingw-w64-x86_64-libcxx-13.0.0-3-any.pkg.tar.zst
+$(package)_sha256_hash=0f8819e88273579f7c9262456c6b8f4d73e1693095c2364d1192c61c5f6a1a4f
+
+$(package)_libcxxabi_download_file=mingw-w64-x86_64-libc++abi-13.0.0-3-any.pkg.tar.zst
+$(package)_libcxxabi_file_name=mingw-w64-x86_64-libcxxabi-13.0.0-3-any.pkg.tar.zst
+$(package)_libcxxabi_sha256_hash=7224a7252a566938afe91ea8f130682abd29b10e13c9a3c2347af523ca0d7c42
+
+$(package)_extra_sources += $($(package)_libcxxabi_file_name)
+
+define $(package)_fetch_cmds
+$(call fetch_file,$(package),$($(package)_download_path),$($(package)_download_file),$($(package)_file_name),$($(package)_sha256_hash)) && \
+$(call fetch_file,$(package),$($(package)_download_path),$($(package)_libcxxabi_download_file),$($(package)_libcxxabi_file_name),$($(package)_libcxxabi_sha256_hash))
+endef
+
+define $(package)_extract_cmds
+  mkdir -p $($(package)_extract_dir) && \
+  echo "$($(package)_sha256_hash)  $($(package)_source)" > $($(package)_extract_dir)/.$($(package)_file_name).hash && \
+  echo "$($(package)_libcxxabi_sha256_hash)  $($(package)_source_dir)/$($(package)_libcxxabi_file_name)" >> $($(package)_extract_dir)/.$($(package)_file_name).hash && \
+  $(build_SHA256SUM) -c $($(package)_extract_dir)/.$($(package)_file_name).hash && \
+  mkdir -p libcxxabi && \
+  tar --no-same-owner --strip-components=1 -C libcxxabi -xf $($(package)_source_dir)/$($(package)_libcxxabi_file_name) && \
+  tar --no-same-owner --strip-components=1 -xf $($(package)_source)
+endef
+
+define $(package)_stage_cmds
+  mkdir -p $($(package)_staging_prefix_dir)/lib && \
+  mv include/ $($(package)_staging_prefix_dir) && \
+  cp lib/libc++.a $($(package)_staging_prefix_dir)/lib && \
+  cp libcxxabi/lib/libc++abi.a $($(package)_staging_prefix_dir)/lib
+endef
+endif
+
+else
+# For native compilation, use the static libraries from native_clang.
+# We explicitly stage them so that subsequent dependencies don't link to the
+# shared libraries distributed with Clang.
+define $(package)_fetch_cmds
+endef
+
+define $(package)_extract_cmds
+endef
+
+define $(package)_stage_cmds
+  mkdir -p $($(package)_staging_prefix_dir)/lib && \
+  cp $(build_prefix)/lib/libc++.a $($(package)_staging_prefix_dir)/lib && \
+  if [ -f "$(build_prefix)/lib/libc++abi.a" ]; then cp $(build_prefix)/lib/libc++abi.a $($(package)_staging_prefix_dir)/lib; fi
+endef
+
+endif
diff --git a/depend/zcash/depends/packages/libevent.mk b/depend/zcash/depends/packages/libevent.mk
new file mode 100644
index 000000000..1f1c305aa
--- /dev/null
+++ b/depend/zcash/depends/packages/libevent.mk
@@ -0,0 +1,40 @@
+package=libevent
+$(package)_version=2.1.12
+$(package)_download_path=https://github.com/libevent/libevent/archive/
+$(package)_file_name=$(package)-$($(package)_version).tar.gz
+$(package)_download_file=release-$($(package)_version)-stable.tar.gz
+$(package)_sha256_hash=7180a979aaa7000e1264da484f712d403fcf7679b1e9212c4e3d09f5c93efc24
+$(package)_patches=0001-fix-windows-getaddrinfo.patch
+
+define $(package)_preprocess_cmds
+   patch -p1 < $($(package)_patch_dir)/0001-fix-windows-getaddrinfo.patch && \
+  ./autogen.sh
+endef
+
+# When building for Windows, we set _WIN32_WINNT to target the same Windows
+# version as we do in configure. Due to quirks in libevents build system, this
+# is also required to enable support for ipv6. See #19375.
+define $(package)_set_vars
+  $(package)_config_opts=--disable-shared --disable-openssl --disable-libevent-regress
+  $(package)_config_opts += --disable-dependency-tracking --enable-option-checking
+  $(package)_config_opts_release=--disable-debug-mode
+  $(package)_config_opts_linux=--with-pic
+  $(package)_config_opts_freebsd=--with-pic
+  $(package)_cppflags_mingw32=-D_WIN32_WINNT=0x0601
+endef
+
+define $(package)_config_cmds
+  $($(package)_autoconf)
+endef
+
+define $(package)_build_cmds
+  $(MAKE)
+endef
+
+define $(package)_stage_cmds
+  $(MAKE) DESTDIR=$($(package)_staging_dir) install
+endef
+
+define $(package)_postprocess_cmds
+  rm lib/*.la
+endef
diff --git a/depend/zcash/depends/packages/libsodium.mk b/depend/zcash/depends/packages/libsodium.mk
new file mode 100644
index 000000000..332072577
--- /dev/null
+++ b/depend/zcash/depends/packages/libsodium.mk
@@ -0,0 +1,26 @@
+package=libsodium
+$(package)_version=1.0.18
+$(package)_download_path=https://download.libsodium.org/libsodium/releases/
+$(package)_file_name=$(package)-$($(package)_version).tar.gz
+$(package)_sha256_hash=6f504490b342a4f8a4c4a02fc9b866cbef8622d5df4e5452b46be121e46636c1
+$(package)_dependencies=
+$(package)_patches=1.0.15-pubkey-validation.diff 1.0.15-signature-validation.diff
+$(package)_config_opts=
+
+define $(package)_preprocess_cmds
+  patch -p1 < $($(package)_patch_dir)/1.0.15-pubkey-validation.diff && \
+  patch -p1 < $($(package)_patch_dir)/1.0.15-signature-validation.diff && \
+  cd $($(package)_build_subdir); DO_NOT_UPDATE_CONFIG_SCRIPTS=1 ./autogen.sh
+endef
+
+define $(package)_config_cmds
+  $($(package)_autoconf) --enable-static --disable-shared
+endef
+
+define $(package)_build_cmds
+  $(MAKE)
+endef
+
+define $(package)_stage_cmds
+  $(MAKE) DESTDIR=$($(package)_staging_dir) install
+endef
diff --git a/depend/zcash/depends/packages/native_b2.mk b/depend/zcash/depends/packages/native_b2.mk
new file mode 100644
index 000000000..aaa37cdcf
--- /dev/null
+++ b/depend/zcash/depends/packages/native_b2.mk
@@ -0,0 +1,20 @@
+package=native_b2
+$(package)_version=$(boost_version)
+$(package)_download_path=$(boost_download_path)
+$(package)_file_name=$(boost_file_name)
+$(package)_sha256_hash=$(boost_sha256_hash)
+$(package)_build_subdir=tools/build/src/engine
+ifneq (,$(findstring clang,$($(package)_cxx)))
+$(package)_toolset_$(host_os)=clang
+else
+$(package)_toolset_$(host_os)=gcc
+endif
+
+define $(package)_build_cmds
+  CXX="$($(package)_cxx)" CXXFLAGS="$($(package)_cxxflags)" ./build.sh "$($(package)_toolset_$(host_os))"
+endef
+
+define $(package)_stage_cmds
+  mkdir -p "$($(package)_staging_prefix_dir)"/bin/ && \
+  cp b2 "$($(package)_staging_prefix_dir)"/bin/
+endef
diff --git a/depend/zcash/depends/packages/native_ccache.mk b/depend/zcash/depends/packages/native_ccache.mk
new file mode 100644
index 000000000..4c5dde76d
--- /dev/null
+++ b/depend/zcash/depends/packages/native_ccache.mk
@@ -0,0 +1,25 @@
+package=native_ccache
+$(package)_version=3.7.12
+$(package)_download_path=https://github.com/ccache/ccache/releases/download/v$($(package)_version)
+$(package)_file_name=ccache-$($(package)_version).tar.gz
+$(package)_sha256_hash=d2abe88d4c283ce960e233583061127b156ffb027c6da3cf10770fc0c7244194
+
+define $(package)_set_vars
+$(package)_config_opts=
+endef
+
+define $(package)_config_cmds
+  $($(package)_autoconf)
+endef
+
+define $(package)_build_cmds
+  $(MAKE)
+endef
+
+define $(package)_stage_cmds
+  $(MAKE) DESTDIR=$($(package)_staging_dir) install
+endef
+
+define $(package)_postprocess_cmds
+  rm -rf lib include
+endef
diff --git a/depend/zcash/depends/packages/native_cctools.mk b/depend/zcash/depends/packages/native_cctools.mk
new file mode 100644
index 000000000..5febaa3b9
--- /dev/null
+++ b/depend/zcash/depends/packages/native_cctools.mk
@@ -0,0 +1,62 @@
+package=native_cctools
+$(package)_version=55562e4073dea0fbfd0b20e0bf69ffe6390c7f97
+$(package)_download_path=https://github.com/tpoechtrager/cctools-port/archive
+$(package)_file_name=$($(package)_version).tar.gz
+$(package)_sha256_hash=e51995a843533a3dac155dd0c71362dd471597a2d23f13dff194c6285362f875
+$(package)_build_subdir=cctools
+$(package)_dependencies=native_clang
+$(package)_patches=ignore-otool.diff
+
+$(package)_libtapi_version=3efb201881e7a76a21e0554906cf306432539cef
+$(package)_libtapi_download_path=https://github.com/tpoechtrager/apple-libtapi/archive
+$(package)_libtapi_download_file=$($(package)_libtapi_version).tar.gz
+$(package)_libtapi_file_name=$($(package)_libtapi_version).tar.gz
+$(package)_libtapi_sha256_hash=380c1ca37cfa04a8699d0887a8d3ee1ad27f3d08baba78887c73b09485c0fbd3
+
+$(package)_extra_sources += $($(package)_libtapi_file_name)
+
+define $(package)_fetch_cmds
+$(call fetch_file,$(package),$($(package)_download_path),$($(package)_download_file),$($(package)_file_name),$($(package)_sha256_hash)) && \
+$(call fetch_file,$(package),$($(package)_libtapi_download_path),$($(package)_libtapi_download_file),$($(package)_libtapi_file_name),$($(package)_libtapi_sha256_hash))
+endef
+
+define $(package)_extract_cmds
+  mkdir -p $($(package)_extract_dir) && \
+  echo "$($(package)_sha256_hash)  $($(package)_source)" > $($(package)_extract_dir)/.$($(package)_file_name).hash && \
+  echo "$($(package)_libtapi_sha256_hash)  $($(package)_source_dir)/$($(package)_libtapi_file_name)" >> $($(package)_extract_dir)/.$($(package)_file_name).hash && \
+  $(build_SHA256SUM) -c $($(package)_extract_dir)/.$($(package)_file_name).hash && \
+  mkdir -p libtapi && \
+  tar --no-same-owner --strip-components=1 -C libtapi -xf $($(package)_source_dir)/$($(package)_libtapi_file_name) && \
+  tar --no-same-owner --strip-components=1 -xf $($(package)_source)
+endef
+
+define $(package)_set_vars
+  $(package)_config_opts=--target=$(host) --with-libtapi=$($(package)_extract_dir)
+  $(package)_ldflags+=-Wl,-rpath=\\$$$$$$$$\$$$$$$$$ORIGIN/../lib
+  $(package)_config_opts+=--enable-lto-support --with-llvm-config=$(build_prefix)/bin/llvm-config
+  $(package)_cc=$(build_prefix)/bin/clang
+  $(package)_cxx=$(build_prefix)/bin/clang++
+endef
+
+define $(package)_preprocess_cmds
+  patch -p1 < $($(package)_patch_dir)/ignore-otool.diff && \
+  cd $($(package)_build_subdir); DO_NOT_UPDATE_CONFIG_SCRIPTS=1 ./autogen.sh
+endef
+
+define $(package)_config_cmds
+  rm -f $(build_prefix)/lib/libc++abi.so* && \
+  CC=$($(package)_cc) CXX=$($(package)_cxx) INSTALLPREFIX=$($(package)_extract_dir) ../libtapi/build.sh && \
+  CC=$($(package)_cc) CXX=$($(package)_cxx) INSTALLPREFIX=$($(package)_extract_dir) ../libtapi/install.sh && \
+  $($(package)_config_env) $($(package)_autoconf)
+endef
+
+define $(package)_build_cmds
+  $(MAKE)
+endef
+
+define $(package)_stage_cmds
+  $(MAKE) DESTDIR=$($(package)_staging_dir) install && \
+  mkdir -p $($(package)_staging_prefix_dir)/lib/ && \
+  cd $($(package)_extract_dir) && \
+  cp lib/libtapi.so.6 $($(package)_staging_prefix_dir)/lib/
+endef
diff --git a/depend/zcash/depends/packages/native_clang.mk b/depend/zcash/depends/packages/native_clang.mk
new file mode 100644
index 000000000..662e088eb
--- /dev/null
+++ b/depend/zcash/depends/packages/native_clang.mk
@@ -0,0 +1,51 @@
+package=native_clang
+$(package)_major_version=13
+$(package)_version=13.0.1
+$(package)_download_path=https://github.com/llvm/llvm-project/releases/download/llvmorg-$($(package)_version)
+$(package)_download_path_linux=https://github.com/llvm/llvm-project/releases/download/llvmorg-$($(package)_version)
+$(package)_download_file_linux=clang+llvm-$($(package)_version)-x86_64-linux-gnu-ubuntu-18.04.tar.xz
+$(package)_file_name_linux=clang-llvm-$($(package)_version)-x86_64-linux-gnu-ubuntu-18.04.tar.xz
+$(package)_sha256_hash_linux=84a54c69781ad90615d1b0276a83ff87daaeded99fbc64457c350679df7b4ff0
+$(package)_download_path_darwin=https://github.com/llvm/llvm-project/releases/download/llvmorg-$($(package)_version)
+$(package)_download_file_darwin=clang+llvm-$($(package)_version)-x86_64-apple-darwin.tar.xz
+$(package)_file_name_darwin=clang-llvm-$($(package)_version)-x86_64-apple-darwin.tar.xz
+$(package)_sha256_hash_darwin=dec02d17698514d0fc7ace8869c38937851c542b02adf102c4e898f027145a4d
+$(package)_download_path_freebsd=https://github.com/llvm/llvm-project/releases/download/llvmorg-$($(package)_version)
+$(package)_download_file_freebsd=clang+llvm-$($(package)_version)-amd64-unknown-freebsd12.tar.xz
+$(package)_file_name_freebsd=clang-llvm-$($(package)_version)-amd64-unknown-freebsd12.tar.xz
+$(package)_sha256_hash_freebsd=8101c8d3a920bf930b33987ada5373f43537c5de8c194be0ea10530fd0ad5617
+$(package)_download_file_aarch64_linux=clang+llvm-$($(package)_version)-aarch64-linux-gnu.tar.xz
+$(package)_file_name_aarch64_linux=clang-llvm-$($(package)_version)-aarch64-linux-gnu.tar.xz
+$(package)_sha256_hash_aarch64_linux=15ff2db12683e69e552b6668f7ca49edaa01ce32cb1cbc8f8ed2e887ab291069
+
+ifneq (,$(wildcard /etc/arch-release))
+$(package)_dependencies=native_libtinfo
+endif
+
+# Ensure we have clang native to the builder, not the target host
+ifneq ($(canonical_host),$(build))
+$(package)_exact_download_path=$($(package)_download_path_$(build_os))
+$(package)_exact_download_file=$($(package)_download_file_$(build_os))
+$(package)_exact_file_name=$($(package)_file_name_$(build_os))
+$(package)_exact_sha256_hash=$($(package)_sha256_hash_$(build_os))
+endif
+
+define $(package)_stage_cmds
+  mkdir -p $($(package)_staging_prefix_dir)/bin && \
+  cp bin/clang-$($(package)_major_version) $($(package)_staging_prefix_dir)/bin && \
+  cp bin/lld $($(package)_staging_prefix_dir)/bin && \
+  cp bin/llvm-ar $($(package)_staging_prefix_dir)/bin && \
+  cp bin/llvm-config $($(package)_staging_prefix_dir)/bin && \
+  cp bin/llvm-nm $($(package)_staging_prefix_dir)/bin && \
+  cp bin/llvm-objcopy $($(package)_staging_prefix_dir)/bin && \
+  cp -P bin/clang $($(package)_staging_prefix_dir)/bin && \
+  cp -P bin/clang++ $($(package)_staging_prefix_dir)/bin && \
+  cp -P bin/ld.lld $($(package)_staging_prefix_dir)/bin && \
+  cp -P bin/ld64.lld $($(package)_staging_prefix_dir)/bin && \
+  cp -P bin/lld-link $($(package)_staging_prefix_dir)/bin && \
+  cp -P bin/llvm-ranlib $($(package)_staging_prefix_dir)/bin && \
+  cp -P bin/llvm-strip $($(package)_staging_prefix_dir)/bin && \
+  mv include/ $($(package)_staging_prefix_dir) && \
+  mv lib/ $($(package)_staging_prefix_dir) && \
+  mv libexec/ $($(package)_staging_prefix_dir)
+endef
diff --git a/depend/zcash/depends/packages/native_libtinfo.mk b/depend/zcash/depends/packages/native_libtinfo.mk
new file mode 100644
index 000000000..d3c200660
--- /dev/null
+++ b/depend/zcash/depends/packages/native_libtinfo.mk
@@ -0,0 +1,22 @@
+package=native_tinfo
+$(package)_version=5.6.0
+$(package)_download_path_linux=http://ftp.debian.org/debian/pool/main/n/ncurses/
+$(package)_download_file_linux=libtinfo5_6.0+20161126-1+deb9u2_amd64.deb
+$(package)_file_name_linux=libtinfo5_6.0+20161126-1+deb9u2_amd64.deb
+$(package)_sha256_hash_linux=1d249a3193568b5ef785ad8993b9ba6d6fdca0eb359204c2355532b82d25e9f5
+
+define $(package)_extract_cmds
+	mkdir -p $($(package)_extract_dir) && \
+	echo "$($(package)_sha256_hash)  $($(package)_source)" > $($(package)_extract_dir)/.$($(package)_file_name).hash && \
+	$(build_SHA256SUM) -c $($(package)_extract_dir)/.$($(package)_file_name).hash && \
+	mkdir -p libtinfo5 && \
+	ar x --output libtinfo5 $($(package)_source_dir)/$($(package)_file_name) && \
+	cd libtinfo5 && \
+	tar xf data.tar.xz
+endef
+
+define $(package)_stage_cmds
+	pwd && \
+	mkdir -p $($(package)_staging_prefix_dir)/lib && \
+	cp libtinfo5/lib/x86_64-linux-gnu/libtinfo.so.5.9 $($(package)_staging_prefix_dir)/lib/libtinfo.so.5
+endef
diff --git a/depend/zcash/depends/packages/native_rust.mk b/depend/zcash/depends/packages/native_rust.mk
new file mode 100644
index 000000000..a1901a8fe
--- /dev/null
+++ b/depend/zcash/depends/packages/native_rust.mk
@@ -0,0 +1,61 @@
+package=native_rust
+$(package)_version=1.59.0
+$(package)_download_path=https://static.rust-lang.org/dist
+$(package)_file_name_linux=rust-$($(package)_version)-x86_64-unknown-linux-gnu.tar.gz
+$(package)_sha256_hash_linux=0c1c2da3fa26372e5178123aa5bb0fdcd4933fbad9bfb268ffbd71807182ecae
+$(package)_file_name_darwin=rust-$($(package)_version)-x86_64-apple-darwin.tar.gz
+$(package)_sha256_hash_darwin=d82204f536af0c7bfd2ea2213dc46b99911860cfc5517f7321244412ae96f159
+$(package)_file_name_freebsd=rust-$($(package)_version)-x86_64-unknown-freebsd.tar.gz
+$(package)_sha256_hash_freebsd=83f9c49b6e9025b712fc5d65e49f1b6ad959966534cd39c8dc2ce2c85a6ca484
+$(package)_file_name_aarch64_linux=rust-$($(package)_version)-aarch64-unknown-linux-gnu.tar.gz
+$(package)_sha256_hash_aarch64_linux=ab5da30a3de5433e26cbc74c56b9d97b569769fc2e456fc54378adc8baaee4f0
+
+# Mapping from GCC canonical hosts to Rust targets
+# If a mapping is not present, we assume they are identical, unless $host_os is
+# "darwin", in which case we assume x86_64-apple-darwin.
+$(package)_rust_target_x86_64-pc-linux-gnu=x86_64-unknown-linux-gnu
+$(package)_rust_target_x86_64-w64-mingw32=x86_64-pc-windows-gnu
+
+# Mapping from Rust targets to SHA-256 hashes
+$(package)_rust_std_sha256_hash_aarch64-unknown-linux-gnu=81dbd37919f631f962ac0798111803eb8f06ffde608f0e5dd3682d701cf5566d
+$(package)_rust_std_sha256_hash_x86_64-apple-darwin=959af8bafbc9f3916a1d1111d7378fdd7aa459410cdd2d3bbfc2d9d9a6db0683
+$(package)_rust_std_sha256_hash_x86_64-pc-windows-gnu=9a67ae84e9e75efb57eeeab617e32379a555de336a30bb74a476e575cd38f63a
+$(package)_rust_std_sha256_hash_x86_64-unknown-freebsd=cf5e4303dd7c3b70a738a2336097c9f2189c8b702a89a8c453d83ac0dee4602c
+
+define rust_target
+$(if $($(1)_rust_target_$(2)),$($(1)_rust_target_$(2)),$(if $(findstring darwin,$(3)),x86_64-apple-darwin,$(if $(findstring freebsd,$(3)),x86_64-unknown-freebsd,$(2))))
+endef
+
+ifneq ($(canonical_host),$(build))
+$(package)_rust_target=$(call rust_target,$(package),$(canonical_host),$(host_os))
+$(package)_exact_file_name=rust-std-$($(package)_version)-$($(package)_rust_target).tar.gz
+$(package)_exact_sha256_hash=$($(package)_rust_std_sha256_hash_$($(package)_rust_target))
+$(package)_build_subdir=buildos
+$(package)_extra_sources=$($(package)_file_name_$(build_os))
+
+define $(package)_fetch_cmds
+$(call fetch_file,$(package),$($(package)_download_path),$($(package)_download_file),$($(package)_file_name),$($(package)_sha256_hash)) && \
+$(call fetch_file,$(package),$($(package)_download_path),$($(package)_file_name_$(build_os)),$($(package)_file_name_$(build_os)),$($(package)_sha256_hash_$(build_os)))
+endef
+
+define $(package)_extract_cmds
+  mkdir -p $($(package)_extract_dir) && \
+  echo "$($(package)_sha256_hash)  $($(package)_source)" > $($(package)_extract_dir)/.$($(package)_file_name).hash && \
+  echo "$($(package)_sha256_hash_$(build_os))  $($(package)_source_dir)/$($(package)_file_name_$(build_os))" >> $($(package)_extract_dir)/.$($(package)_file_name).hash && \
+  $(build_SHA256SUM) -c $($(package)_extract_dir)/.$($(package)_file_name).hash && \
+  mkdir $(canonical_host) && \
+  tar --strip-components=1 -xf $($(package)_source) -C $(canonical_host) && \
+  mkdir buildos && \
+  tar --strip-components=1 -xf $($(package)_source_dir)/$($(package)_file_name_$(build_os)) -C buildos
+endef
+
+define $(package)_stage_cmds
+  bash ./install.sh --without=rust-docs --destdir=$($(package)_staging_dir) --prefix=$(build_prefix) --disable-ldconfig && \
+  ../$(canonical_host)/install.sh --destdir=$($(package)_staging_dir) --prefix=$(build_prefix) --disable-ldconfig
+endef
+else
+
+define $(package)_stage_cmds
+  bash ./install.sh --without=rust-docs --destdir=$($(package)_staging_dir) --prefix=$(build_prefix) --disable-ldconfig
+endef
+endif
diff --git a/depend/zcash/depends/packages/packages.mk b/depend/zcash/depends/packages/packages.mk
new file mode 100644
index 000000000..2d85c3226
--- /dev/null
+++ b/depend/zcash/depends/packages/packages.mk
@@ -0,0 +1,20 @@
+zcash_packages := libsodium utfcpp
+packages := boost libevent zeromq $(zcash_packages) googletest
+native_packages := native_clang native_ccache native_rust
+
+ifneq (,$(wildcard /etc/arch-release))
+native_packages += native_libtinfo
+endif
+
+wallet_packages=bdb
+
+$(host_arch)_$(host_os)_native_packages += native_b2
+
+ifneq ($(build_os),darwin)
+darwin_native_packages=native_cctools
+endif
+
+# We use a complete SDK for Darwin, which includes libc++.
+ifneq ($(host_os),darwin)
+packages += libcxx
+endif
diff --git a/depend/zcash/depends/packages/utfcpp.mk b/depend/zcash/depends/packages/utfcpp.mk
new file mode 100644
index 000000000..2a0620e21
--- /dev/null
+++ b/depend/zcash/depends/packages/utfcpp.mk
@@ -0,0 +1,10 @@
+package=utfcpp
+$(package)_version=3.2.1
+$(package)_download_path=https://github.com/nemtrif/$(package)/archive/
+$(package)_file_name=$(package)-$($(package)_version).tar.gz
+$(package)_download_file=v$($(package)_version).tar.gz
+$(package)_sha256_hash=8d6aa7d77ad0abb35bb6139cb9a33597ac4c5b33da6a004ae42429b8598c9605
+
+define $(package)_stage_cmds
+  cp -a ./source $($(package)_staging_dir)$(host_prefix)/include
+endef
diff --git a/depend/zcash/depends/packages/zeromq.mk b/depend/zcash/depends/packages/zeromq.mk
new file mode 100644
index 000000000..c067cfa32
--- /dev/null
+++ b/depend/zcash/depends/packages/zeromq.mk
@@ -0,0 +1,47 @@
+package=zeromq
+$(package)_version=4.3.4
+$(package)_download_path=https://github.com/zeromq/libzmq/releases/download/v$($(package)_version)/
+$(package)_file_name=$(package)-$($(package)_version).tar.gz
+$(package)_sha256_hash=c593001a89f5a85dd2ddf564805deb860e02471171b3f204944857336295c3e5
+$(package)_patches=windows-unused-variables.diff
+
+ifneq ($(host_os),darwin)
+$(package)_dependencies=libcxx
+endif
+
+define $(package)_set_vars
+  $(package)_config_opts=--without-docs --disable-shared --disable-curve --disable-curve-keygen --disable-perf
+  $(package)_config_opts += --without-libgssapi_krb5 --without-pgm --without-norm --without-vmci
+  $(package)_config_opts += --disable-libunwind --disable-radix-tree --without-gcov --disable-dependency-tracking
+  $(package)_config_opts += --disable-drafts --enable-option-checking
+  $(package)_config_opts_linux=--with-pic
+  $(package)_config_opts_freebsd=--with-pic
+  $(package)_cxxflags+=-std=c++17
+
+  ifeq ($(host_os),freebsd)
+    $(package)_ldflags+=-static-libstdc++ -lcxxrt
+  else
+    $(package)_ldflags+=-static-libstdc++ -lc++abi
+  endif
+
+endef
+
+define $(package)_preprocess_cmds
+  patch -p1 < $($(package)_patch_dir)/windows-unused-variables.diff
+endef
+
+define $(package)_config_cmds
+  $($(package)_autoconf)
+endef
+
+define $(package)_build_cmds
+  $(MAKE) src/libzmq.la
+endef
+
+define $(package)_stage_cmds
+  $(MAKE) DESTDIR=$($(package)_staging_dir) install-libLTLIBRARIES install-includeHEADERS install-pkgconfigDATA
+endef
+
+define $(package)_postprocess_cmds
+  rm -rf bin share lib/*.la
+endef
diff --git a/depend/zcash/depends/patches/bdb/clang-12-stpcpy-issue.diff b/depend/zcash/depends/patches/bdb/clang-12-stpcpy-issue.diff
new file mode 100644
index 000000000..671938e0b
--- /dev/null
+++ b/depend/zcash/depends/patches/bdb/clang-12-stpcpy-issue.diff
@@ -0,0 +1,17 @@
+diff -ur db-6.2.23-orig/src/blob/blob_util.c db-6.2.23/src/blob/blob_util.c
+--- db-6.2.23-orig/src/blob/blob_util.c	2016-03-28 20:45:53.000000000 +0100
++++ db-6.2.23/src/blob/blob_util.c	2021-07-30 19:52:37.082811600 +0100
+@@ -544,7 +544,12 @@
+ 		goto err;
+ 
+ 	memset(path, 0, len);
+-	name_len += sprintf(path, "%s", blob_sub_dir);
++	// Clang 12 introduced an "libcall optimization" that lowers the above
++	// to stpcpy to avoid the machinery involved in parsing format strings.
++	// This causes build problems when cross-compiling to Windows with the
++	// version of mingw-w64 that Zcash supports. We haven't figured out why
++	// but in the meantime using "%s%s" inhibits the optimization.
++	name_len += sprintf(path, "%s%s", blob_sub_dir, "");
+ 
+ 	__blob_calculate_dirs(blob_id, path, &name_len, &depth);
+ 
diff --git a/depend/zcash/depends/patches/bdb/winioctl-and-atomic_init_db.patch b/depend/zcash/depends/patches/bdb/winioctl-and-atomic_init_db.patch
new file mode 100644
index 000000000..788da5be4
--- /dev/null
+++ b/depend/zcash/depends/patches/bdb/winioctl-and-atomic_init_db.patch
@@ -0,0 +1,136 @@
+diff --git a/src/dbinc/atomic.h b/src/dbinc/atomic.h
+index e4420aa..4799b5f 100644
+--- a/src/dbinc/atomic.h
++++ b/src/dbinc/atomic.h
+@@ -70,7 +70,7 @@ typedef struct {
+  * These have no memory barriers; the caller must include them when necessary.
+  */
+ #define	atomic_read(p)		((p)->value)
+-#define	atomic_init(p, val)	((p)->value = (val))
++#define	atomic_init_db(p, val)	((p)->value = (val))
+ 
+ #ifdef HAVE_ATOMIC_SUPPORT
+ 
+@@ -225,7 +225,7 @@ static inline int __atomic_compare_exchange_int(
+ #define	atomic_dec(env, p)	(--(p)->value)
+ #define	atomic_compare_exchange(env, p, oldval, newval)		\
+ 	(DB_ASSERT(env, atomic_read(p) == (oldval)),		\
+-	atomic_init(p, (newval)), 1)
++	atomic_init_db(p, (newval)), 1)
+ #else
+ #define	atomic_inc(env, p)	__atomic_inc_int(env, p)
+ #define	atomic_dec(env, p)	__atomic_dec_int(env, p)
+diff --git a/src/dbinc/win_db.h b/src/dbinc/win_db.h
+index f5228f4..6e44659 100644
+--- a/src/dbinc/win_db.h
++++ b/src/dbinc/win_db.h
+@@ -51,7 +51,7 @@
+ #include <windows.h>
+ #include <winsock2.h>
+ #ifndef DB_WINCE
+-#include <WinIoCtl.h>
++#include <winioctl.h>
+ #endif
+ 
+ #ifdef HAVE_GETADDRINFO
+diff --git a/src/mp/mp_fget.c b/src/mp/mp_fget.c
+index 59fe9fe..fa4ced7 100644
+--- a/src/mp/mp_fget.c
++++ b/src/mp/mp_fget.c
+@@ -654,7 +654,7 @@ alloc:		/* Allocate a new buffer header and data space. */
+ 
+ 		/* Initialize enough so we can call __memp_bhfree. */
+ 		alloc_bhp->flags = 0;
+-		atomic_init(&alloc_bhp->ref, 1);
++		atomic_init_db(&alloc_bhp->ref, 1);
+ #ifdef DIAGNOSTIC
+ 		if ((uintptr_t)alloc_bhp->buf & (sizeof(size_t) - 1)) {
+ 			__db_errx(env, DB_STR("3025",
+@@ -969,7 +969,7 @@ alloc:		/* Allocate a new buffer header and data space. */
+ 			MVCC_MPROTECT(bhp->buf, mfp->pagesize,
+ 			    PROT_READ);
+ 
+-		atomic_init(&alloc_bhp->ref, 1);
++		atomic_init_db(&alloc_bhp->ref, 1);
+ 		MUTEX_LOCK(env, alloc_bhp->mtx_buf);
+ 		alloc_bhp->priority = bhp->priority;
+ 		alloc_bhp->pgno = bhp->pgno;
+diff --git a/src/mp/mp_mvcc.c b/src/mp/mp_mvcc.c
+index 83c4d72..0a47202 100644
+--- a/src/mp/mp_mvcc.c
++++ b/src/mp/mp_mvcc.c
+@@ -281,7 +281,7 @@ __memp_bh_freeze(dbmp, infop, hp, bhp, need_frozenp)
+ #else
+ 	memcpy(frozen_bhp, bhp, SSZA(BH, buf));
+ #endif
+-	atomic_init(&frozen_bhp->ref, 0);
++	atomic_init_db(&frozen_bhp->ref, 0);
+ 	if (mutex != MUTEX_INVALID)
+ 		frozen_bhp->mtx_buf = mutex;
+ 	else if ((ret = __mutex_alloc(env, MTX_MPOOL_BH,
+@@ -440,7 +440,7 @@ __memp_bh_thaw(dbmp, infop, hp, frozen_bhp, alloc_bhp)
+ #endif
+ 		alloc_bhp->mtx_buf = mutex;
+ 		MUTEX_LOCK(env, alloc_bhp->mtx_buf);
+-		atomic_init(&alloc_bhp->ref, 1);
++		atomic_init_db(&alloc_bhp->ref, 1);
+ 		F_CLR(alloc_bhp, BH_FROZEN);
+ 	}
+ 
+diff --git a/src/mp/mp_region.c b/src/mp/mp_region.c
+index 4d95e4f..e97459c 100644
+--- a/src/mp/mp_region.c
++++ b/src/mp/mp_region.c
+@@ -278,7 +278,7 @@ __memp_init(env, dbmp, reginfo_off, htab_buckets, max_nreg)
+ 			     MTX_MPOOL_FILE_BUCKET, 0, &htab[i].mtx_hash)) != 0)
+ 				return (ret);
+ 			SH_TAILQ_INIT(&htab[i].hash_bucket);
+-			atomic_init(&htab[i].hash_page_dirty, 0);
++			atomic_init_db(&htab[i].hash_page_dirty, 0);
+ 		}
+ 
+ 		mtx_base = mtx_prev = MUTEX_INVALID;
+@@ -332,7 +332,7 @@ no_prealloc:
+ 		    DB_MUTEX_SHARED, &hp->mtx_hash)) != 0)
+ 			return (ret);
+ 		SH_TAILQ_INIT(&hp->hash_bucket);
+-		atomic_init(&hp->hash_page_dirty, 0);
++		atomic_init_db(&hp->hash_page_dirty, 0);
+ #ifdef HAVE_STATISTICS
+ 		hp->hash_io_wait = 0;
+ 		hp->hash_frozen = hp->hash_thawed = hp->hash_frozen_freed = 0;
+diff --git a/src/mutex/mut_method.c b/src/mutex/mut_method.c
+index 72b34de..a9f9868 100644
+--- a/src/mutex/mut_method.c
++++ b/src/mutex/mut_method.c
+@@ -501,7 +501,7 @@ __atomic_compare_exchange_int(env, v, oldval, newval)
+ 	MUTEX_LOCK(env, mtx);
+ 	ret = atomic_read(v) == oldval;
+ 	if (ret)
+-		atomic_init(v, newval);
++		atomic_init_db(v, newval);
+ 	MUTEX_UNLOCK(env, mtx);
+ 
+ 	return (ret);
+diff --git a/src/mutex/mut_tas.c b/src/mutex/mut_tas.c
+index 7899c4b..d9420fa 100644
+--- a/src/mutex/mut_tas.c
++++ b/src/mutex/mut_tas.c
+@@ -47,7 +47,7 @@ __db_tas_mutex_init(env, mutex, flags)
+ 
+ #ifdef HAVE_SHARED_LATCHES
+ 	if (F_ISSET(mutexp, DB_MUTEX_SHARED))
+-		atomic_init(&mutexp->sharecount, 0);
++		atomic_init_db(&mutexp->sharecount, 0);
+ 	else
+ #endif
+ 	if (MUTEX_INIT(&mutexp->tas)) {
+@@ -643,7 +643,7 @@ was_not_locked:
+ 			F_CLR(mutexp, DB_MUTEX_LOCKED);
+ 			/* Flush flag update before zeroing count */
+ 			MEMBAR_EXIT();
+-			atomic_init(&mutexp->sharecount, 0);
++			atomic_init_db(&mutexp->sharecount, 0);
+ 		} else {
+ 			DB_ASSERT(env, sharecount > 0);
+ 			MEMBAR_EXIT();
diff --git a/depend/zcash/depends/patches/libevent/0001-fix-windows-getaddrinfo.patch b/depend/zcash/depends/patches/libevent/0001-fix-windows-getaddrinfo.patch
new file mode 100644
index 000000000..a98cd90bd
--- /dev/null
+++ b/depend/zcash/depends/patches/libevent/0001-fix-windows-getaddrinfo.patch
@@ -0,0 +1,15 @@
+diff -ur libevent-2.1.8-stable.orig/configure.ac libevent-2.1.8-stable/configure.ac
+--- libevent-2.1.8-stable.orig/configure.ac	2017-01-29 17:51:00.000000000 +0000
++++ libevent-2.1.8-stable/configure.ac	2020-03-07 01:11:16.311335005 +0000
+@@ -389,6 +389,10 @@
+ 		#ifdef HAVE_NETDB_H
+ 		#include <netdb.h>
+ 		#endif
++#ifdef _WIN32
++#include <winsock2.h>
++#include <ws2tcpip.h>
++#endif
+ 	    ]],
+ 	    [[
+ 		getaddrinfo;
+Only in libevent-2.1.8-stable: configure.ac~
diff --git a/depend/zcash/depends/patches/libsodium/1.0.15-pubkey-validation.diff b/depend/zcash/depends/patches/libsodium/1.0.15-pubkey-validation.diff
new file mode 100644
index 000000000..3a9b7ea86
--- /dev/null
+++ b/depend/zcash/depends/patches/libsodium/1.0.15-pubkey-validation.diff
@@ -0,0 +1,17 @@
+diff -ur libsodium-1.0.18-orig/src/libsodium/crypto_sign/ed25519/ref10/open.c libsodium-1.0.18/src/libsodium/crypto_sign/ed25519/ref10/open.c
+--- libsodium-1.0.18-orig/src/libsodium/crypto_sign/ed25519/ref10/open.c	2019-05-18 16:32:11.000000000 -0400
++++ libsodium-1.0.18/src/libsodium/crypto_sign/ed25519/ref10/open.c	2020-01-21 18:55:22.474233831 -0500
+@@ -32,8 +32,11 @@
+         ge25519_has_small_order(sig) != 0) {
+         return -1;
+     }
+-    if (ge25519_is_canonical(pk) == 0 ||
+-        ge25519_has_small_order(pk) != 0) {
++    unsigned char d = 0;
++    for (int i = 0; i < 32; ++i) {
++        d |= pk[i];
++    }
++    if (d == 0) {
+         return -1;
+     }
+ #endif
diff --git a/depend/zcash/depends/patches/libsodium/1.0.15-signature-validation.diff b/depend/zcash/depends/patches/libsodium/1.0.15-signature-validation.diff
new file mode 100644
index 000000000..87bae480c
--- /dev/null
+++ b/depend/zcash/depends/patches/libsodium/1.0.15-signature-validation.diff
@@ -0,0 +1,78 @@
+diff -ur libsodium-1.0.18-orig/src/libsodium/crypto_sign/ed25519/ref10/open.c libsodium-1.0.18/src/libsodium/crypto_sign/ed25519/ref10/open.c
+--- libsodium-1.0.18-orig/src/libsodium/crypto_sign/ed25519/ref10/open.c	2019-05-18 21:32:11.000000000 +0100
++++ libsodium-1.0.18/src/libsodium/crypto_sign/ed25519/ref10/open.c	2020-02-18 00:00:08.544107613 +0000
+@@ -10,6 +10,65 @@
+ #include "private/ed25519_ref10.h"
+ #include "utils.h"
+ 
++#ifndef ED25519_COMPAT
++int
++_crypto_sign_ed25519_small_order(const unsigned char p[32])
++{
++    CRYPTO_ALIGN(16)
++    static const unsigned char blacklist[][32] = {
++        { 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
++          0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
++          0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 },
++        { 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
++          0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
++          0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 },
++        { 0x26, 0xe8, 0x95, 0x8f, 0xc2, 0xb2, 0x27, 0xb0, 0x45, 0xc3, 0xf4,
++          0x89, 0xf2, 0xef, 0x98, 0xf0, 0xd5, 0xdf, 0xac, 0x05, 0xd3, 0xc6,
++          0x33, 0x39, 0xb1, 0x38, 0x02, 0x88, 0x6d, 0x53, 0xfc, 0x05 },
++        { 0xc7, 0x17, 0x6a, 0x70, 0x3d, 0x4d, 0xd8, 0x4f, 0xba, 0x3c, 0x0b,
++          0x76, 0x0d, 0x10, 0x67, 0x0f, 0x2a, 0x20, 0x53, 0xfa, 0x2c, 0x39,
++          0xcc, 0xc6, 0x4e, 0xc7, 0xfd, 0x77, 0x92, 0xac, 0x03, 0x7a },
++        { 0x13, 0xe8, 0x95, 0x8f, 0xc2, 0xb2, 0x27, 0xb0, 0x45, 0xc3, 0xf4,
++          0x89, 0xf2, 0xef, 0x98, 0xf0, 0xd5, 0xdf, 0xac, 0x05, 0xd3, 0xc6,
++          0x33, 0x39, 0xb1, 0x38, 0x02, 0x88, 0x6d, 0x53, 0xfc, 0x85 },
++        { 0xb4, 0x17, 0x6a, 0x70, 0x3d, 0x4d, 0xd8, 0x4f, 0xba, 0x3c, 0x0b,
++          0x76, 0x0d, 0x10, 0x67, 0x0f, 0x2a, 0x20, 0x53, 0xfa, 0x2c, 0x39,
++          0xcc, 0xc6, 0x4e, 0xc7, 0xfd, 0x77, 0x92, 0xac, 0x03, 0xfa },
++        { 0xec, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
++          0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
++          0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x7f },
++        { 0xed, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
++          0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
++          0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x7f },
++        { 0xee, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
++          0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
++          0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x7f },
++        { 0xd9, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
++          0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
++          0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff },
++        { 0xda, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
++          0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
++          0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff },
++        { 0xdb, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
++          0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
++          0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff }
++    };
++    size_t        i, j;
++    unsigned char c;
++
++    for (i = 0; i < sizeof blacklist / sizeof blacklist[0]; i++) {
++        c = 0;
++        for (j = 0; j < 32; j++) {
++            c |= p[j] ^ blacklist[i][j];
++        }
++        if (c == 0) {
++            return 1;
++        }
++    }
++    return 0;
++}
++#endif
++
+ int
+ _crypto_sign_ed25519_verify_detached(const unsigned char *sig,
+                                      const unsigned char *m,
+@@ -29,7 +88,7 @@
+     }
+ #else
+     if (sc25519_is_canonical(sig + 32) == 0 ||
+-        ge25519_has_small_order(sig) != 0) {
++        _crypto_sign_ed25519_small_order(sig) != 0) {
+         return -1;
+     }
+     if (ge25519_is_canonical(pk) == 0 ||
diff --git a/depend/zcash/depends/patches/native_cctools/ignore-otool.diff b/depend/zcash/depends/patches/native_cctools/ignore-otool.diff
new file mode 100644
index 000000000..fdb348ede
--- /dev/null
+++ b/depend/zcash/depends/patches/native_cctools/ignore-otool.diff
@@ -0,0 +1,24 @@
+diff -ur cctools-port-55562e4073dea0fbfd0b20e0bf69ffe6390c7f97-orig/cctools/Makefile.am cctools-port-55562e4073dea0fbfd0b20e0bf69ffe6390c7f97/cctools/Makefile.am
+--- cctools-port-55562e4073dea0fbfd0b20e0bf69ffe6390c7f97-orig/cctools/Makefile.am	2020-07-30 15:01:05.680000000 +0100
++++ cctools-port-55562e4073dea0fbfd0b20e0bf69ffe6390c7f97/cctools/Makefile.am	2020-07-30 15:01:34.900000000 +0100
+@@ -1,7 +1,7 @@
+ if ISDARWIN
+-SUBDIRS=libstuff libmacho ar as misc otool efitools ld64 man
++SUBDIRS=libstuff libmacho ar as misc efitools ld64 man
+ else
+-SUBDIRS=libobjc2 libstuff libmacho ar as misc otool efitools ld64 man
++SUBDIRS=libobjc2 libstuff libmacho ar as misc efitools ld64 man
+ endif
+ 
+ ACLOCAL_AMFLAGS = -I m4
+diff -ur cctools-port-55562e4073dea0fbfd0b20e0bf69ffe6390c7f97-orig/cctools/configure.ac cctools-port-55562e4073dea0fbfd0b20e0bf69ffe6390c7f97/cctools/configure.ac
+--- cctools-port-55562e4073dea0fbfd0b20e0bf69ffe6390c7f97-orig/cctools/configure.ac	2020-07-30 15:01:05.680000000 +0100
++++ cctools-port-55562e4073dea0fbfd0b20e0bf69ffe6390c7f97/cctools/configure.ac	2020-07-30 15:01:47.330000000 +0100
+@@ -466,7 +466,6 @@
+ AC_CONFIG_FILES([as/ppc64/Makefile])
+ AC_CONFIG_FILES([man/Makefile])
+ AC_CONFIG_FILES([misc/Makefile])
+-AC_CONFIG_FILES([otool/Makefile])
+ AC_CONFIG_FILES([efitools/Makefile])
+ AC_CONFIG_FILES([libobjc2/Makefile])
+ AC_CONFIG_FILES([ld64/Makefile])
diff --git a/depend/zcash/depends/patches/zeromq/windows-unused-variables.diff b/depend/zcash/depends/patches/zeromq/windows-unused-variables.diff
new file mode 100644
index 000000000..8526ee5f9
--- /dev/null
+++ b/depend/zcash/depends/patches/zeromq/windows-unused-variables.diff
@@ -0,0 +1,17 @@
+diff -ur zeromq-4.3.3-orig/src/clock.cpp zeromq-4.3.3/src/clock.cpp
+--- zeromq-4.3.3-orig/src/clock.cpp	2020-10-13 13:44:04.190000000 +0100
++++ zeromq-4.3.3/src/clock.cpp	2020-10-13 13:47:04.170000000 +0100
+@@ -126,9 +126,13 @@
+   init_compatible_get_tick_count64 ();
+ #endif
+ 
++#ifndef ZMQ_HAVE_WINDOWS
+ const uint64_t usecs_per_msec = 1000;
++#endif
+ const uint64_t usecs_per_sec = 1000000;
++#if !defined(ZMQ_HAVE_WINDOWS) && !defined(ZMQ_HAVE_FREEBSD)
+ const uint64_t nsecs_per_usec = 1000;
++#endif
+ 
+ zmq::clock_t::clock_t () :
+     _last_tsc (rdtsc ()),
diff --git a/depend/zcash/doc/Doxyfile b/depend/zcash/doc/Doxyfile
new file mode 100644
index 000000000..dc7be6658
--- /dev/null
+++ b/depend/zcash/doc/Doxyfile
@@ -0,0 +1,1752 @@
+# Doxyfile 1.7.4
+
+# !!! Invoke doxygen from project root using: 
+#    doxygen doc/Doxyfile
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project
+#
+# All text after a hash (#) is considered a comment and will be ignored
+# The format is:
+#       TAG = value [value, ...]
+# For lists items can also be appended using:
+#       TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (" ")
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file 
+# that follow. The default is UTF-8 which is also the encoding used for all 
+# text before the first occurrence of this tag. Doxygen uses libiconv (or the 
+# iconv built into libc) for the transcoding. See 
+# https://www.gnu.org/software/libiconv/ for the list of possible encodings.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded 
+# by quotes) that should identify the project.
+
+PROJECT_NAME           = Bitcoin
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. 
+# This could be handy for archiving the generated documentation or 
+# if some version control system is used.
+
+PROJECT_NUMBER         = 0.11.2
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description 
+# for a project that appears at the top of each page and should give viewer 
+# a quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          = "P2P Digital Currency"
+
+# With the PROJECT_LOGO tag one can specify an logo or icon that is 
+# included in the documentation. The maximum height of the logo should not 
+# exceed 55 pixels and the maximum width should not exceed 200 pixels. 
+# Doxygen will copy the logo to the output directory.
+
+PROJECT_LOGO           = doc/bitcoin_logo_doxygen.png
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) 
+# base path where the generated documentation will be put. 
+# If a relative path is entered, it will be relative to the location 
+# where doxygen was started. If left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = doc/doxygen
+
+# If the CREATE_SUBDIRS tag is set to YES, then doxygen will create 
+# 4096 sub-directories (in 2 levels) under the output directory of each output 
+# format and will distribute the generated files over these directories. 
+# Enabling this option can be useful when feeding doxygen a huge amount of 
+# source files, where putting all generated files in the same directory would 
+# otherwise cause performance problems for the file system.
+
+CREATE_SUBDIRS         = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all 
+# documentation generated by doxygen is written. Doxygen will use this 
+# information to generate all constant output in the proper language. 
+# The default language is English, other supported languages are: 
+# Afrikaans, Arabic, Brazilian, Catalan, Chinese, Chinese-Traditional, 
+# Croatian, Czech, Danish, Dutch, Esperanto, Farsi, Finnish, French, German, 
+# Greek, Hungarian, Italian, Japanese, Japanese-en (Japanese with English 
+# messages), Korean, Korean-en, Lithuanian, Norwegian, Macedonian, Persian, 
+# Polish, Portuguese, Romanian, Russian, Serbian, Serbian-Cyrillic, Slovak, 
+# Slovene, Spanish, Swedish, Ukrainian, and Vietnamese.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES (the default) Doxygen will 
+# include brief member descriptions after the members that are listed in 
+# the file and class documentation (similar to JavaDoc). 
+# Set to NO to disable this.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES (the default) Doxygen will prepend 
+# the brief description of a member or function before the detailed description. 
+# Note: if both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the 
+# brief descriptions will be completely suppressed.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator 
+# that is used to form the text in various listings. Each string 
+# in this list, if found as the leading text of the brief description, will be 
+# stripped from the text and the result after processing the whole list, is 
+# used as the annotated text. Otherwise, the brief description is used as-is. 
+# If left blank, the following values are used ("$name" is automatically 
+# replaced with the name of the entity): "The $name class" "The $name widget" 
+# "The $name file" "is" "provides" "specifies" "contains" 
+# "represents" "a" "an" "the"
+
+ABBREVIATE_BRIEF       = "The $name class" \
+                         "The $name widget" \
+                         "The $name file" \
+                         is \
+                         provides \
+                         specifies \
+                         contains \
+                         represents \
+                         a \
+                         an \
+                         the
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then 
+# Doxygen will generate a detailed section even if there is only a brief 
+# description.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all 
+# inherited members of a class in the documentation of that class as if those 
+# members were ordinary class members. Constructors, destructors and assignment 
+# operators of the base classes will not be shown.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES then Doxygen will prepend the full 
+# path before files name in the file list and in the header files. If set 
+# to NO the shortest path that makes the file name unique will be used.
+
+FULL_PATH_NAMES        = YES
+
+# If the FULL_PATH_NAMES tag is set to YES then the STRIP_FROM_PATH tag 
+# can be used to strip a user-defined part of the path. Stripping is 
+# only done if one of the specified strings matches the left-hand part of 
+# the path. The tag can be used to show relative paths in the file list. 
+# If left blank the directory from which doxygen is run is used as the 
+# path to strip.
+
+STRIP_FROM_PATH        = 
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of 
+# the path mentioned in the documentation of a class, which tells 
+# the reader which header file to include in order to use a class. 
+# If left blank only the name of the header file containing the class 
+# definition is used. Otherwise one should specify the include paths that 
+# are normally passed to the compiler using the -I flag.
+
+STRIP_FROM_INC_PATH    = 
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter 
+# (but less readable) file names. This can be useful if your file system 
+# doesn't support long names like on DOS, Mac, or CD-ROM.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then Doxygen 
+# will interpret the first line (until the first dot) of a JavaDoc-style 
+# comment as the brief description. If set to NO, the JavaDoc 
+# comments will behave just like regular Qt-style comments 
+# (thus requiring an explicit @brief command for a brief description.)
+
+JAVADOC_AUTOBRIEF      = YES
+
+# If the QT_AUTOBRIEF tag is set to YES then Doxygen will 
+# interpret the first line (until the first dot) of a Qt-style 
+# comment as the brief description. If set to NO, the comments 
+# will behave just like regular Qt-style comments (thus requiring 
+# an explicit \brief command for a brief description.)
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make Doxygen 
+# treat a multi-line C++ special comment block (i.e. a block of //! or /// 
+# comments) as a brief description. This used to be the default behaviour. 
+# The new default is to treat a multi-line C++ comment block as a detailed 
+# description. Set this tag to YES if you prefer the old behaviour instead.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES (the default) then an undocumented 
+# member inherits the documentation from any documented member that it 
+# re-implements.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce 
+# a new page for each member. If set to NO, the documentation of a member will 
+# be part of the file/class/namespace that contains it.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. 
+# Doxygen uses this value to replace tabs by spaces in code fragments.
+
+TAB_SIZE               = 8
+
+# This tag can be used to specify a number of aliases that acts 
+# as commands in the documentation. An alias has the form "name=value". 
+# For example adding "sideeffect=\par Side Effects:\n" will allow you to 
+# put the command \sideeffect (or @sideeffect) in the documentation, which 
+# will result in a user-defined paragraph with heading "Side Effects:". 
+# You can put \n in the value part of an alias to insert newlines.
+
+ALIASES                = 
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C 
+# sources only. Doxygen will then generate output that is more tailored for C. 
+# For instance, some of the names that are used will be different. The list 
+# of all members will be omitted, etc.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java 
+# sources only. Doxygen will then generate output that is more tailored for 
+# Java. For instance, namespaces will be presented as packages, qualified 
+# scopes will look different, etc.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran 
+# sources only. Doxygen will then generate output that is more tailored for 
+# Fortran.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL 
+# sources. Doxygen will then generate output that is tailored for 
+# VHDL.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it 
+# parses. With this tag you can assign which parser to use for a given extension. 
+# Doxygen has a built-in mapping, but you can override or extend it using this 
+# tag. The format is ext=language, where ext is a file extension, and language 
+# is one of the parsers supported by doxygen: IDL, Java, Javascript, CSharp, C, 
+# C++, D, PHP, Objective-C, Python, Fortran, VHDL, C, C++. For instance to make 
+# doxygen treat .inc files as Fortran files (default is PHP), and .f files as C 
+# (default is Fortran), use: inc=Fortran f=C. Note that for custom extensions 
+# you also need to set FILE_PATTERNS otherwise the files are not read by doxygen.
+
+EXTENSION_MAPPING      = 
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want 
+# to include (a tag file for) the STL sources as input, then you should 
+# set this tag to YES in order to let doxygen match functions declarations and 
+# definitions whose arguments contain STL classes (e.g. func(std::string); v.s. 
+# func(std::string) {}). This also makes the inheritance and collaboration 
+# diagrams that involve STL classes more complete and accurate.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to 
+# enable parsing support.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip sources only. 
+# Doxygen will parse them like normal C++ but will assume all classes use public 
+# instead of private inheritance when no explicit protection keyword is present.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate getter 
+# and setter methods for a property. Setting this option to YES (the default) 
+# will make doxygen replace the get and set methods by a property in the 
+# documentation. This will only work if the methods are indeed getting or 
+# setting a simple type. If this is not the case, or you want to show the 
+# methods anyway, you should set this option to NO.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC 
+# tag is set to YES, then doxygen will reuse the documentation of the first 
+# member in the group (if any) for the other members of the group. By default 
+# all members of a group must be documented explicitly.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# Set the SUBGROUPING tag to YES (the default) to allow class member groups of 
+# the same type (for instance a group of public functions) to be put as a 
+# subgroup of that type (e.g. under the Public Functions section). Set it to 
+# NO to prevent subgrouping. Alternatively, this can be done per class using 
+# the \nosubgrouping command.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and 
+# unions are shown inside the group in which they are included (e.g. using 
+# @ingroup) instead of on a separate page (for HTML and Man pages) or 
+# section (for LaTeX and RTF).
+
+INLINE_GROUPED_CLASSES = NO
+
+# When TYPEDEF_HIDES_STRUCT is enabled, a typedef of a struct, union, or enum 
+# is documented as struct, union, or enum with the name of the typedef. So 
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct 
+# with name TypeT. When disabled the typedef will appear as a member of a file, 
+# namespace, or class. And the struct will be named TypeS. This can typically 
+# be useful for C code in case the coding convention dictates that all compound 
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The SYMBOL_CACHE_SIZE determines the size of the internal cache use to 
+# determine which symbols to keep in memory and which to flush to disk. 
+# When the cache is full, less often used symbols will be written to disk. 
+# For small to medium size projects (<1000 input files) the default value is 
+# probably good enough. For larger projects a too small cache size can cause 
+# doxygen to be busy swapping symbols to and from disk most of the time 
+# causing a significant performance penalty. 
+# If the system has enough physical memory increasing the cache will improve the 
+# performance by keeping more symbols in memory. Note that the value works on 
+# a logarithmic scale so increasing the size by one will roughly double the 
+# memory usage. The cache size is given by this formula: 
+# 2^(16+SYMBOL_CACHE_SIZE). The valid range is 0..9, the default is 0, 
+# corresponding to a cache size of 2^16 = 65536 symbols
+
+SYMBOL_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in 
+# documentation are documented, even if no documentation was available. 
+# Private class members and static file members will be hidden unless 
+# the EXTRACT_PRIVATE and EXTRACT_STATIC tags are set to YES
+
+EXTRACT_ALL            = YES
+
+# If the EXTRACT_PRIVATE tag is set to YES all private members of a class 
+# will be included in the documentation.
+
+EXTRACT_PRIVATE        = YES
+
+# If the EXTRACT_STATIC tag is set to YES all static members of a file 
+# will be included in the documentation.
+
+EXTRACT_STATIC         = NO
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs) 
+# defined locally in source files will be included in the documentation. 
+# If set to NO only classes defined in header files are included.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. When set to YES local 
+# methods, which are defined in the implementation section but not in 
+# the interface are included in the documentation. 
+# If set to NO (the default) only methods in the interface are included.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be 
+# extracted and appear in the documentation as a namespace called 
+# 'anonymous_namespace{file}', where file will be replaced with the base 
+# name of the file that contains the anonymous namespace. By default 
+# anonymous namespaces are hidden.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, Doxygen will hide all 
+# undocumented members of documented classes, files or namespaces. 
+# If set to NO (the default) these members will be included in the 
+# various overviews, but no documentation section is generated. 
+# This option has no effect if EXTRACT_ALL is enabled.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, Doxygen will hide all 
+# undocumented classes that are normally visible in the class hierarchy. 
+# If set to NO (the default) these classes will be included in the various 
+# overviews. This option has no effect if EXTRACT_ALL is enabled.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, Doxygen will hide all 
+# friend (class|struct|union) declarations. 
+# If set to NO (the default) these declarations will be included in the 
+# documentation.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, Doxygen will hide any 
+# documentation blocks found inside the body of a function. 
+# If set to NO (the default) these blocks will be appended to the 
+# function's detailed documentation block.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation 
+# that is typed after a \internal command is included. If the tag is set 
+# to NO (the default) then the documentation will be excluded. 
+# Set it to YES to include the internal documentation.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then Doxygen will only generate 
+# file names in lower-case letters. If set to YES upper-case letters are also 
+# allowed. This is useful if you have classes or files whose names only differ 
+# in case and if your file system supports case sensitive file names. Windows 
+# and Mac users are advised to set this option to NO.
+
+CASE_SENSE_NAMES       = NO
+
+# If the HIDE_SCOPE_NAMES tag is set to NO (the default) then Doxygen 
+# will show members with their full class and namespace scopes in the 
+# documentation. If set to YES the scope will be hidden.
+
+HIDE_SCOPE_NAMES       = NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES (the default) then Doxygen 
+# will put a list of the files that are included by a file in the documentation 
+# of that file.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then Doxygen 
+# will list include files with double quotes in the documentation 
+# rather than with sharp brackets.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES (the default) then a tag [inline] 
+# is inserted in the documentation for inline members.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES (the default) then doxygen 
+# will sort the (detailed) documentation of file and class members 
+# alphabetically by member name. If set to NO the members will appear in 
+# declaration order.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the 
+# brief documentation of file, namespace and class members alphabetically 
+# by member name. If set to NO (the default) the members will appear in 
+# declaration order.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen 
+# will sort the (brief and detailed) documentation of class members so that 
+# constructors and destructors are listed first. If set to NO (the default) 
+# the constructors will appear in the respective orders defined by 
+# SORT_MEMBER_DOCS and SORT_BRIEF_DOCS. 
+# This tag will be ignored for brief docs if SORT_BRIEF_DOCS is set to NO 
+# and ignored for detailed docs if SORT_MEMBER_DOCS is set to NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the 
+# hierarchy of group names into alphabetical order. If set to NO (the default) 
+# the group names will appear in their defined order.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be 
+# sorted by fully-qualified names, including namespaces. If set to 
+# NO (the default), the class list will be sorted only by class name, 
+# not including the namespace part. 
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES. 
+# Note: This option applies only to the class list, not to the 
+# alphabetical list.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to 
+# do proper type resolution of all parameters of a function it will reject a 
+# match between the prototype and the implementation of a member function even 
+# if there is only one candidate or it is obvious which candidate to choose 
+# by doing a simple string match. By disabling STRICT_PROTO_MATCHING doxygen 
+# will still accept a match between prototype and implementation in such cases.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or 
+# disable (NO) the todo list. This list is created by putting \todo 
+# commands in the documentation.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or 
+# disable (NO) the test list. This list is created by putting \test 
+# commands in the documentation.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or 
+# disable (NO) the bug list. This list is created by putting \bug 
+# commands in the documentation.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or 
+# disable (NO) the deprecated list. This list is created by putting 
+# \deprecated commands in the documentation.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional 
+# documentation sections, marked by \if sectionname ... \endif.
+
+ENABLED_SECTIONS       = 
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines 
+# the initial value of a variable or macro consists of for it to appear in 
+# the documentation. If the initializer consists of more lines than specified 
+# here it will be hidden. Use a value of 0 to hide initializers completely. 
+# The appearance of the initializer of individual variables and macros in the 
+# documentation can be controlled using \showinitializer or \hideinitializer 
+# command in the documentation regardless of this setting.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated 
+# at the bottom of the documentation of classes and structs. If set to YES the 
+# list will mention the files that were used to generate the documentation.
+
+SHOW_USED_FILES        = YES
+
+# If the sources in your project are distributed over multiple directories 
+# then setting the SHOW_DIRECTORIES tag to YES will show the directory hierarchy 
+# in the documentation. The default is NO.
+
+SHOW_DIRECTORIES       = NO
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. 
+# This will remove the Files entry from the Quick Index and from the 
+# Folder Tree View (if specified). The default is YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the 
+# Namespaces page.  This will remove the Namespaces entry from the Quick Index 
+# and from the Folder Tree View (if specified). The default is YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that 
+# doxygen should invoke to get the current version for each file (typically from 
+# the version control system). Doxygen will invoke the program by executing (via 
+# popen()) the command <command> <input-file>, where <command> is the value of 
+# the FILE_VERSION_FILTER tag, and <input-file> is the name of an input file 
+# provided by doxygen. Whatever the program writes to standard output 
+# is used as the file version. See the manual for examples.
+
+FILE_VERSION_FILTER    = 
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed 
+# by doxygen. The layout file controls the global structure of the generated 
+# output files in an output format independent way. The create the layout file 
+# that represents doxygen's defaults, run doxygen with the -l option. 
+# You can optionally specify a file name after the option, if omitted 
+# DoxygenLayout.xml will be used as the name of the layout file.
+
+LAYOUT_FILE            = 
+
+#---------------------------------------------------------------------------
+# configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated 
+# by doxygen. Possible values are YES and NO. If left blank NO is used.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are 
+# generated by doxygen. Possible values are YES and NO. If left blank 
+# NO is used.
+
+WARNINGS               = YES
+
+# If WARN_IF_UNDOCUMENTED is set to YES, then doxygen will generate warnings 
+# for undocumented members. If EXTRACT_ALL is set to YES then this flag will 
+# automatically be disabled.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If WARN_IF_DOC_ERROR is set to YES, doxygen will generate warnings for 
+# potential errors in the documentation, such as not documenting some 
+# parameters in a documented function, or documenting parameters that 
+# don't exist or using markup commands wrongly.
+
+WARN_IF_DOC_ERROR      = YES
+
+# The WARN_NO_PARAMDOC option can be enabled to get warnings for 
+# functions that are documented, but have no documentation for their parameters 
+# or return value. If set to NO (the default) doxygen will only warn about 
+# wrong or incomplete parameter documentation, but not about the absence of 
+# documentation.
+
+WARN_NO_PARAMDOC       = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that 
+# doxygen can produce. The string should contain the $file, $line, and $text 
+# tags, which will be replaced by the file and line number from which the 
+# warning originated and the warning text. Optionally the format may contain 
+# $version, which will be replaced by the version of the file (if it could 
+# be obtained via FILE_VERSION_FILTER)
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning 
+# and error messages should be written. If left blank the output is written 
+# to stderr.
+
+WARN_LOGFILE           = 
+
+#---------------------------------------------------------------------------
+# configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag can be used to specify the files and/or directories that contain 
+# documented source files. You may enter file names like "myfile.cpp" or 
+# directories like "/usr/src/myproject". Separate the files or directories 
+# with spaces.
+
+INPUT                  = src
+
+# This tag can be used to specify the character encoding of the source files 
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding, which is 
+# also the default input encoding. Doxygen uses libiconv (or the iconv built 
+# into libc) for the transcoding. See https://www.gnu.org/software/libiconv for 
+# the list of possible encodings.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the 
+# FILE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp 
+# and *.h) to filter out the source-files in the directories. If left 
+# blank the following patterns are tested: 
+# *.c *.cc *.cxx *.cpp *.c++ *.d *.java *.ii *.ixx *.ipp *.i++ *.inl *.h *.hh 
+# *.hxx *.hpp *.h++ *.idl *.odl *.cs *.php *.php3 *.inc *.m *.mm *.dox *.py 
+# *.f90 *.f *.for *.vhd *.vhdl
+
+FILE_PATTERNS          = *.c \
+                         *.cc \
+                         *.cxx \
+                         *.cpp \
+                         *.c++ \
+                         *.d \
+                         *.java \
+                         *.ii \
+                         *.ixx \
+                         *.ipp \
+                         *.i++ \
+                         *.inl \
+                         *.h \
+                         *.hh \
+                         *.hxx \
+                         *.hpp \
+                         *.h++ \
+                         *.idl \
+                         *.odl \
+                         *.cs \
+                         *.php \
+                         *.php3 \
+                         *.inc \
+                         *.m \
+                         *.mm \
+                         *.dox \
+                         *.py \
+                         *.f90 \
+                         *.f \
+                         *.for \
+                         *.vhd \
+                         *.vhdl
+
+# The RECURSIVE tag can be used to turn specify whether or not subdirectories 
+# should be searched for input files as well. Possible values are YES and NO. 
+# If left blank NO is used.
+
+RECURSIVE              = YES
+
+# The EXCLUDE tag can be used to specify files and/or directories that should 
+# excluded from the INPUT source files. This way you can easily exclude a 
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+
+EXCLUDE                = src/leveldb src/json src/test /src/qt/test
+
+# The EXCLUDE_SYMLINKS tag can be used select whether or not files or 
+# directories that are symbolic links (a Unix file system feature) are excluded 
+# from the input.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the 
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude 
+# certain files from those directories. Note that the wildcards are matched 
+# against the file with absolute path, so to exclude all test directories 
+# for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       = 
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names 
+# (namespaces, classes, functions, etc.) that should be excluded from the 
+# output. The symbol name can be a fully qualified name, a word, or if the 
+# wildcard * is used, a substring. Examples: ANamespace, AClass, 
+# AClass::ANamespace, ANamespace::*Test
+
+EXCLUDE_SYMBOLS        = boost google
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or 
+# directories that contain example code fragments that are included (see 
+# the \include command).
+
+EXAMPLE_PATH           = 
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the 
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp 
+# and *.h) to filter out the source-files in the directories. If left 
+# blank all files are included.
+
+EXAMPLE_PATTERNS       = *
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be 
+# searched for input files to be used with the \include or \dontinclude 
+# commands irrespective of the value of the RECURSIVE tag. 
+# Possible values are YES and NO. If left blank NO is used.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or 
+# directories that contain image that are included in the documentation (see 
+# the \image command).
+
+IMAGE_PATH             = 
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should 
+# invoke to filter for each input file. Doxygen will invoke the filter program 
+# by executing (via popen()) the command <filter> <input-file>, where <filter> 
+# is the value of the INPUT_FILTER tag, and <input-file> is the name of an 
+# input file. Doxygen will then use the output that the filter program writes 
+# to standard output.  If FILTER_PATTERNS is specified, this tag will be 
+# ignored.
+
+INPUT_FILTER           = 
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern 
+# basis.  Doxygen will compare the file name with each pattern and apply the 
+# filter if there is a match.  The filters are a list of the form: 
+# pattern=filter (like *.cpp=my_cpp_filter). See INPUT_FILTER for further 
+# info on how filters are used. If FILTER_PATTERNS is empty or if 
+# non of the patterns match the file name, INPUT_FILTER is applied.
+
+FILTER_PATTERNS        = 
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using 
+# INPUT_FILTER) will be used to filter the input files when producing source 
+# files to browse (i.e. when SOURCE_BROWSER is set to YES).
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file 
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) 
+# and it is also possible to disable source filtering for a specific pattern 
+# using *.ext= (so without naming a filter). This option only has effect when 
+# FILTER_SOURCE_FILES is enabled.
+
+FILTER_SOURCE_PATTERNS = 
+
+#---------------------------------------------------------------------------
+# configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will 
+# be generated. Documented entities will be cross-referenced with these sources. 
+# Note: To get rid of all source code in the generated output, make sure also 
+# VERBATIM_HEADERS is set to NO.
+
+SOURCE_BROWSER         = YES
+
+# Setting the INLINE_SOURCES tag to YES will include the body 
+# of functions and classes directly in the documentation.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES (the default) will instruct 
+# doxygen to hide any special comment blocks from generated source code 
+# fragments. Normal C and C++ comments will always remain visible.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES 
+# then for each documented function all documented 
+# functions referencing it will be listed.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES 
+# then for each documented function all documented entities 
+# called/used by that function will be listed.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES (the default) 
+# and SOURCE_BROWSER tag is set to YES, then the hyperlinks from 
+# functions in REFERENCES_RELATION and REFERENCED_BY_RELATION lists will 
+# link to the source code.  Otherwise they will link to the documentation.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code 
+# will point to the HTML generated by the htags(1) tool instead of doxygen 
+# built-in source browser. The htags tool is part of GNU's global source 
+# tagging system (see https://www.gnu.org/software/global/global.html). You 
+# will need version 4.8.6 or higher.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set to YES (the default) then Doxygen 
+# will generate a verbatim copy of the header file for each class for 
+# which an include is specified. Set to NO to disable this.
+
+VERBATIM_HEADERS       = YES
+
+#---------------------------------------------------------------------------
+# configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index 
+# of all compounds will be generated. Enable this if the project 
+# contains a lot of classes, structs, unions or interfaces.
+
+ALPHABETICAL_INDEX     = YES
+
+# If the alphabetical index is enabled (see ALPHABETICAL_INDEX) then 
+# the COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns 
+# in which this list will be split (can be a number in the range [1..20])
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all 
+# classes will be put under the same header in the alphabetical index. 
+# The IGNORE_PREFIX tag can be used to specify one or more prefixes that 
+# should be ignored while generating the index headers.
+
+IGNORE_PREFIX          = 
+
+#---------------------------------------------------------------------------
+# configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES (the default) Doxygen will 
+# generate HTML output.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. 
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be 
+# put in front of it. If left blank `html' will be used as the default path.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for 
+# each generated HTML page (for example: .htm,.php,.asp). If it is left blank 
+# doxygen will generate files with .html extension.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a personal HTML header for 
+# each generated HTML page. If it is left blank doxygen will generate a 
+# standard header. Note that when using a custom header you are responsible 
+# for the proper inclusion of any scripts and style sheets that doxygen 
+# needs, which is dependent on the configuration options used. 
+# It is advised to generate a default header using "doxygen -w html 
+# header.html footer.html stylesheet.css YourConfigFile" and then modify 
+# that header. Note that the header is subject to change so you typically 
+# have to redo this when upgrading to a newer version of doxygen or when
+# changing the value of configuration settings such as GENERATE_TREEVIEW!
+
+HTML_HEADER            = 
+
+# The HTML_FOOTER tag can be used to specify a personal HTML footer for 
+# each generated HTML page. If it is left blank doxygen will generate a 
+# standard footer.
+
+HTML_FOOTER            = 
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading 
+# style sheet that is used by each HTML page. It can be used to 
+# fine-tune the look of the HTML output. If the tag is left blank doxygen 
+# will generate a default style sheet. Note that doxygen will try to copy 
+# the style sheet file to the HTML output directory, so don't put your own 
+# stylesheet in the HTML output directory as well, or it will be erased!
+
+HTML_STYLESHEET        = 
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or 
+# other source files which should be copied to the HTML output directory. Note 
+# that these files will be copied to the base HTML output directory. Use the 
+# $relpath$ marker in the HTML_HEADER and/or HTML_FOOTER files to load these 
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that 
+# the files will be copied as-is; there are no commands or markers available.
+
+HTML_EXTRA_FILES       = 
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. 
+# Doxygen will adjust the colors in the stylesheet and background images 
+# according to this color. Hue is specified as an angle on a colorwheel, 
+# see https://en.wikipedia.org/wiki/Hue for more information. 
+# For instance the value 0 represents red, 60 is yellow, 120 is green, 
+# 180 is cyan, 240 is blue, 300 purple, and 360 is red again. 
+# The allowed range is 0 to 359.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of 
+# the colors in the HTML output. For a value of 0 the output will use 
+# grayscales only. A value of 255 will produce the most vivid colors.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to 
+# the luminance component of the colors in the HTML output. Values below 
+# 100 gradually make the output lighter, whereas values above 100 make 
+# the output darker. The value divided by 100 is the actual gamma applied, 
+# so 80 represents a gamma of 0.8, The value 220 represents a gamma of 2.2, 
+# and 100 does not change the gamma.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML 
+# page will contain the date and time when the page was generated. Setting 
+# this to NO can help when comparing the output of multiple runs.
+
+HTML_TIMESTAMP         = YES
+
+# If the HTML_ALIGN_MEMBERS tag is set to YES, the members of classes, 
+# files or namespaces will be aligned in HTML using tables. If set to 
+# NO a bullet list will be used.
+
+HTML_ALIGN_MEMBERS     = YES
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML 
+# documentation will contain sections that can be hidden and shown after the 
+# page has loaded. For this to work a browser that supports 
+# JavaScript and DHTML is required (for instance Mozilla 1.0+, Firefox 
+# Netscape 6.0+, Internet explorer 5.0+, Konqueror, or Safari).
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files 
+# will be generated that can be used as input for Apple's Xcode 3 
+# integrated development environment, introduced with OSX 10.5 (Leopard). 
+# To create a documentation set, doxygen will generate a Makefile in the 
+# HTML output directory. Running make will produce the docset in that 
+# directory and running "make install" will install the docset in 
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find 
+# it at startup. 
+# See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html 
+# for more information.
+
+GENERATE_DOCSET        = NO
+
+# When GENERATE_DOCSET tag is set to YES, this tag determines the name of the 
+# feed. A documentation feed provides an umbrella under which multiple 
+# documentation sets from a single provider (such as a company or product suite) 
+# can be grouped.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# When GENERATE_DOCSET tag is set to YES, this tag specifies a string that 
+# should uniquely identify the documentation set bundle. This should be a 
+# reverse domain-name style string, e.g. com.mycompany.MyDocSet. Doxygen 
+# will append .docset to the name.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# When GENERATE_PUBLISHER_ID tag specifies a string that should uniquely identify 
+# the documentation publisher. This should be a reverse domain-name style 
+# string, e.g. com.mycompany.MyDocSet.documentation.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The GENERATE_PUBLISHER_NAME tag identifies the documentation publisher.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES, additional index files 
+# will be generated that can be used as input for tools like the 
+# Microsoft HTML help workshop to generate a compiled HTML help file (.chm) 
+# of the generated HTML documentation.
+
+GENERATE_HTMLHELP      = NO
+
+# If the GENERATE_HTMLHELP tag is set to YES, the CHM_FILE tag can 
+# be used to specify the file name of the resulting .chm file. You 
+# can add a path in front of the file if the result should not be 
+# written to the html output directory.
+
+CHM_FILE               = 
+
+# If the GENERATE_HTMLHELP tag is set to YES, the HHC_LOCATION tag can 
+# be used to specify the location (absolute path including file name) of 
+# the HTML help compiler (hhc.exe). If non-empty doxygen will try to run 
+# the HTML help compiler on the generated index.hhp.
+
+HHC_LOCATION           = 
+
+# If the GENERATE_HTMLHELP tag is set to YES, the GENERATE_CHI flag 
+# controls if a separate .chi index file is generated (YES) or that 
+# it should be included in the master .chm file (NO).
+
+GENERATE_CHI           = NO
+
+# If the GENERATE_HTMLHELP tag is set to YES, the CHM_INDEX_ENCODING 
+# is used to encode HtmlHelp index (hhk), content (hhc) and project file 
+# content.
+
+CHM_INDEX_ENCODING     = 
+
+# If the GENERATE_HTMLHELP tag is set to YES, the BINARY_TOC flag 
+# controls whether a binary table of contents is generated (YES) or a 
+# normal table of contents (NO) in the .chm file.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members 
+# to the contents of the HTML help documentation and to the tree view.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and 
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated 
+# that can be used as input for Qt's qhelpgenerator to generate a 
+# Qt Compressed Help (.qch) of the generated HTML documentation.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can 
+# be used to specify the file name of the resulting .qch file. 
+# The path specified is relative to the HTML output folder.
+
+QCH_FILE               = 
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating 
+# Qt Help Project output. For more information please see 
+# http://doc.trolltech.com/qthelpproject.html#namespace
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating 
+# Qt Help Project output. For more information please see 
+# http://doc.trolltech.com/qthelpproject.html#virtual-folders
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If QHP_CUST_FILTER_NAME is set, it specifies the name of a custom filter to 
+# add. For more information please see 
+# http://doc.trolltech.com/qthelpproject.html#custom-filters
+
+QHP_CUST_FILTER_NAME   = 
+
+# The QHP_CUST_FILT_ATTRS tag specifies the list of the attributes of the 
+# custom filter to add. For more information please see 
+# <a href="http://doc.trolltech.com/qthelpproject.html#custom-filters"> 
+# Qt Help Project / Custom Filters</a>.
+
+QHP_CUST_FILTER_ATTRS  = 
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this 
+# project's 
+# filter section matches. 
+# <a href="http://doc.trolltech.com/qthelpproject.html#filter-attributes"> 
+# Qt Help Project / Filter Attributes</a>.
+
+QHP_SECT_FILTER_ATTRS  = 
+
+# If the GENERATE_QHP tag is set to YES, the QHG_LOCATION tag can 
+# be used to specify the location of Qt's qhelpgenerator. 
+# If non-empty doxygen will try to run qhelpgenerator on the generated 
+# .qhp file.
+
+QHG_LOCATION           = 
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files  
+# will be generated, which together with the HTML files, form an Eclipse help 
+# plugin. To install this plugin and make it available under the help contents 
+# menu in Eclipse, the contents of the directory containing the HTML and XML 
+# files needs to be copied into the plugins directory of eclipse. The name of 
+# the directory within the plugins directory should be the same as 
+# the ECLIPSE_DOC_ID value. After copying Eclipse needs to be restarted before 
+# the help appears.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the eclipse help plugin. When installing the plugin 
+# the directory name containing the HTML and XML files should also have 
+# this name.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# The DISABLE_INDEX tag can be used to turn on/off the condensed index at 
+# top of each HTML page. The value NO (the default) enables the index and 
+# the value YES disables it.
+
+DISABLE_INDEX          = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values 
+# (range [0,1..20]) that doxygen will group on one line in the generated HTML 
+# documentation. Note that a value of 0 will completely suppress the enum 
+# values from appearing in the overview section.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index 
+# structure should be generated to display hierarchical information. 
+# If the tag value is set to YES, a side panel will be generated 
+# containing a tree-like index structure (just like the one that 
+# is generated for HTML Help). For this to work a browser that supports 
+# JavaScript, DHTML, CSS and frames is required (i.e. any modern browser). 
+# Windows users are probably better off using the HTML help feature.
+
+GENERATE_TREEVIEW      = NO
+
+# By enabling USE_INLINE_TREES, doxygen will generate the Groups, Directories, 
+# and Class Hierarchy pages using a tree view instead of an ordered list.
+
+USE_INLINE_TREES       = NO
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be 
+# used to set the initial width (in pixels) of the frame in which the tree 
+# is shown.
+
+TREEVIEW_WIDTH         = 250
+
+# When the EXT_LINKS_IN_WINDOW option is set to YES doxygen will open 
+# links to external symbols imported via tag files in a separate window.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of Latex formulas included 
+# as images in the HTML documentation. The default is 10. Note that 
+# when you change the font size after a successful doxygen run you need 
+# to manually remove any form_*.png images from the HTML output directory 
+# to force them to be regenerated.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images 
+# generated for formulas are transparent PNGs. Transparent PNGs are 
+# not supported properly for IE 6.0, but are supported on all modern browsers. 
+# Note that when changing this option you need to delete any form_*.png files 
+# in the HTML output before the changes have effect.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax 
+# (see http://www.mathjax.org) which uses client side Javascript for the 
+# rendering instead of using prerendered bitmaps. Use this if you do not 
+# have LaTeX installed or if you want to formulas look prettier in the HTML 
+# output. When enabled you also need to install MathJax separately and 
+# configure the path to it using the MATHJAX_RELPATH option.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you need to specify the location relative to the 
+# HTML output directory using the MATHJAX_RELPATH option. The destination 
+# directory should contain the MathJax.js script. For instance, if the mathjax 
+# directory is located at the same level as the HTML output directory, then 
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the 
+# mathjax.org site, so you can quickly see the result without installing 
+# MathJax, but it is strongly recommended to install a local copy of MathJax 
+# before deployment.
+
+MATHJAX_RELPATH        = http://www.mathjax.org/mathjax
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box 
+# for the HTML output. The underlying search engine uses javascript 
+# and DHTML and should work on any modern browser. Note that when using 
+# HTML help (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets 
+# (GENERATE_DOCSET) there is already a search function so this one should 
+# typically be disabled. For large projects the javascript based search engine 
+# can be slow, then enabling SERVER_BASED_SEARCH may provide a better solution.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be 
+# implemented using a PHP enabled web server instead of at the web client 
+# using Javascript. Doxygen will generate the search PHP script and index 
+# file to put on the web server. The advantage of the server 
+# based approach is that it scales better to large projects and allows 
+# full text search. The disadvantages are that it is more difficult to setup 
+# and does not have live searching capabilities.
+
+SERVER_BASED_SEARCH    = NO
+
+#---------------------------------------------------------------------------
+# configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES (the default) Doxygen will 
+# generate Latex output.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. 
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be 
+# put in front of it. If left blank `latex' will be used as the default path.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be 
+# invoked. If left blank `latex' will be used as the default command name. 
+# Note that when enabling USE_PDFLATEX this option is only used for 
+# generating bitmaps for formulas in the HTML output, but not in the 
+# Makefile that is written to the output directory.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to 
+# generate index for LaTeX. If left blank `makeindex' will be used as the 
+# default command name.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES Doxygen generates more compact 
+# LaTeX documents. This may be useful for small projects and may help to 
+# save some trees in general.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used 
+# by the printer. Possible values are: a4, letter, legal and 
+# executive. If left blank a4wide will be used.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be to specify one or more names of LaTeX 
+# packages that should be included in the LaTeX output.
+
+EXTRA_PACKAGES         = 
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for 
+# the generated latex document. The header should contain everything until 
+# the first chapter. If it is left blank doxygen will generate a 
+# standard header. Notice: only use this tag if you know what you are doing!
+
+LATEX_HEADER           = 
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for 
+# the generated latex document. The footer should contain everything after 
+# the last chapter. If it is left blank doxygen will generate a 
+# standard footer. Notice: only use this tag if you know what you are doing!
+
+LATEX_FOOTER           = 
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated 
+# is prepared for conversion to pdf (using ps2pdf). The pdf file will 
+# contain links (just like the HTML output) instead of page references 
+# This makes the output suitable for online browsing using a pdf viewer.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, pdflatex will be used instead of 
+# plain latex in the generated Makefile. Set this option to YES to get a 
+# higher quality PDF documentation.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \\batchmode. 
+# command to the generated LaTeX files. This will instruct LaTeX to keep 
+# running if errors occur, instead of asking the user for help. 
+# This option is also used when generating formulas in HTML.
+
+LATEX_BATCHMODE        = NO
+
+# If LATEX_HIDE_INDICES is set to YES then doxygen will not 
+# include the index chapters (such as File Index, Compound Index, etc.) 
+# in the output.
+
+LATEX_HIDE_INDICES     = NO
+
+# If LATEX_SOURCE_CODE is set to YES then doxygen will include 
+# source code with syntax highlighting in the LaTeX output. 
+# Note that which sources are shown also depends on other settings 
+# such as SOURCE_BROWSER.
+
+LATEX_SOURCE_CODE      = NO
+
+#---------------------------------------------------------------------------
+# configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES Doxygen will generate RTF output 
+# The RTF output is optimized for Word 97 and may not look very pretty with 
+# other RTF readers or editors.
+
+GENERATE_RTF           = NO
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. 
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be 
+# put in front of it. If left blank `rtf' will be used as the default path.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES Doxygen generates more compact 
+# RTF documents. This may be useful for small projects and may help to 
+# save some trees in general.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated 
+# will contain hyperlink fields. The RTF file will 
+# contain links (just like the HTML output) instead of page references. 
+# This makes the output suitable for online browsing using WORD or other 
+# programs which support those fields. 
+# Note: wordpad (write) and others do not support links.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's 
+# config file, i.e. a series of assignments. You only have to provide 
+# replacements, missing definitions are set to their default value.
+
+RTF_STYLESHEET_FILE    = 
+
+# Set optional variables used in the generation of an rtf document. 
+# Syntax is similar to doxygen's config file.
+
+RTF_EXTENSIONS_FILE    = 
+
+#---------------------------------------------------------------------------
+# configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES (the default) Doxygen will 
+# generate man pages
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. 
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be 
+# put in front of it. If left blank `man' will be used as the default path.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to 
+# the generated man pages (default is the subroutine's section .3)
+
+MAN_EXTENSION          = .3
+
+# If the MAN_LINKS tag is set to YES and Doxygen generates man output, 
+# then it will generate one additional man file for each entity 
+# documented in the real man page(s). These additional files 
+# only source the real man page, but without them the man command 
+# would be unable to find the correct page. The default is NO.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES Doxygen will 
+# generate an XML file that captures the structure of 
+# the code including all documentation.
+
+GENERATE_XML           = NO
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. 
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be 
+# put in front of it. If left blank `xml' will be used as the default path.
+
+XML_OUTPUT             = xml
+
+# The XML_SCHEMA tag can be used to specify an XML schema, 
+# which can be used by a validating XML parser to check the 
+# syntax of the XML files.
+
+XML_SCHEMA             = 
+
+# The XML_DTD tag can be used to specify an XML DTD, 
+# which can be used by a validating XML parser to check the 
+# syntax of the XML files.
+
+XML_DTD                = 
+
+# If the XML_PROGRAMLISTING tag is set to YES Doxygen will 
+# dump the program listings (including syntax highlighting 
+# and cross-referencing information) to the XML output. Note that 
+# enabling this will significantly increase the size of the XML output.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES Doxygen will 
+# generate an AutoGen Definitions (see autogen.sf.net) file 
+# that captures the structure of the code including all 
+# documentation. Note that this feature is still experimental 
+# and incomplete at the moment.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES Doxygen will 
+# generate a Perl module file that captures the structure of 
+# the code including all documentation. Note that this 
+# feature is still experimental and incomplete at the 
+# moment.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES Doxygen will generate 
+# the necessary Makefile rules, Perl scripts and LaTeX code to be able 
+# to generate PDF and DVI output from the Perl module output.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES the Perl module output will be 
+# nicely formatted so it can be parsed by a human reader.  This is useful 
+# if you want to understand what is going on.  On the other hand, if this 
+# tag is set to NO the size of the Perl module output will be much smaller 
+# and Perl will parse it just the same.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file 
+# are prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. 
+# This is useful so different doxyrules.make files included by the same 
+# Makefile don't overwrite each other's variables.
+
+PERLMOD_MAKEVAR_PREFIX = 
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES (the default) Doxygen will 
+# evaluate all C-preprocessor directives found in the sources and include 
+# files.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES Doxygen will expand all macro 
+# names in the source code. If set to NO (the default) only conditional 
+# compilation will be performed. Macro expansion can be done in a controlled 
+# way by setting EXPAND_ONLY_PREDEF to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES 
+# then the macro expansion is limited to the macros specified with the 
+# PREDEFINED and EXPAND_AS_DEFINED tags.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES (the default) the includes files 
+# pointed to by INCLUDE_PATH will be searched when a #include is found.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that 
+# contain include files that are not input files but should be processed by 
+# the preprocessor.
+
+INCLUDE_PATH           = 
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard 
+# patterns (like *.h and *.hpp) to filter out the header-files in the 
+# directories. If left blank, the patterns specified with FILE_PATTERNS will 
+# be used.
+
+INCLUDE_FILE_PATTERNS  = 
+
+# The PREDEFINED tag can be used to specify one or more macro names that 
+# are defined before the preprocessor is started (similar to the -D option of 
+# gcc). The argument of the tag is a list of macros of the form: name 
+# or name=definition (no spaces). If the definition and the = are 
+# omitted =1 is assumed. To prevent a macro definition from being 
+# undefined via #undef or recursively expanded use the := operator 
+# instead of the = operator.
+
+PREDEFINED             = 
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then 
+# this tag can be used to specify a list of macro names that should be expanded. 
+# The macro definition that is found in the sources will be used. 
+# Use the PREDEFINED tag if you want to use a different macro definition that 
+# overrules the definition found in the source code.
+
+EXPAND_AS_DEFINED      = 
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES (the default) then 
+# doxygen's preprocessor will remove all references to function-like macros 
+# that are alone on a line, have an all uppercase name, and do not end with a 
+# semicolon, because these will confuse the parser if not removed.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration::additions related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES option can be used to specify one or more tagfiles. 
+# Optionally an initial location of the external documentation 
+# can be added for each tagfile. The format of a tag file without 
+# this location is as follows: 
+#   TAGFILES = file1 file2 ... 
+# Adding location for the tag files is done as follows: 
+#   TAGFILES = file1=loc1 "file2 = loc2" ... 
+# where "loc1" and "loc2" can be relative or absolute paths or 
+# URLs. If a location is present for each tag, the installdox tool 
+# does not have to be run to correct the links. 
+# Note that each tag file must have a unique name 
+# (where the name does NOT include the path) 
+# If a tag file is not located in the directory in which doxygen 
+# is run, you must also specify the path to the tagfile here.
+
+TAGFILES               = 
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create 
+# a tag file that is based on the input files it reads.
+
+GENERATE_TAGFILE       = 
+
+# If the ALLEXTERNALS tag is set to YES all external classes will be listed 
+# in the class index. If set to NO only the inherited external classes 
+# will be listed.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed 
+# in the modules index. If set to NO, only the current project's groups will 
+# be listed.
+
+EXTERNAL_GROUPS        = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script 
+# interpreter (i.e. the result of `which perl').
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES (the default) Doxygen will 
+# generate a inheritance diagram (in HTML, RTF and LaTeX) for classes with base 
+# or super classes. Setting the tag to NO turns the diagrams off. Note that 
+# this option also works with HAVE_DOT disabled, but it is recommended to 
+# install and use dot, since it yields more powerful graphs.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc 
+# command. Doxygen will then run the mscgen tool (see 
+# http://www.mcternan.me.uk/mscgen/) to produce the chart and insert it in the 
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where 
+# the mscgen tool resides. If left empty the tool is assumed to be found in the 
+# default search path.
+
+MSCGEN_PATH            = 
+
+# If set to YES, the inheritance and collaboration graphs will hide 
+# inheritance and usage relations if the target is undocumented 
+# or is not a class.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is 
+# available from the path. This tool is part of Graphviz, a graph visualization 
+# toolkit from AT&T and Lucent Bell Labs. The other options in this section 
+# have no effect if this option is set to NO (the default)
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is 
+# allowed to run in parallel. When set to 0 (the default) doxygen will 
+# base this on the number of processors available in the system. You can set it 
+# explicitly to a value larger than 0 to get control over the balance 
+# between CPU load and processing speed.
+
+DOT_NUM_THREADS        = 0
+
+# By default doxygen will write a font called Helvetica to the output 
+# directory and reference it in all dot files that doxygen generates. 
+# When you want a differently looking font you can specify the font name 
+# using DOT_FONTNAME. You need to make sure dot is able to find the font, 
+# which can be done by putting it in a standard location or by setting the 
+# DOTFONTPATH environment variable or by setting DOT_FONTPATH to the directory 
+# containing the font.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size of the font of dot graphs. 
+# The default size is 10pt.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the output directory to look for the 
+# FreeSans.ttf font (which doxygen will put there itself). If you specify a 
+# different font using DOT_FONTNAME you can set the path where dot 
+# can find it using this tag.
+
+DOT_FONTPATH           = 
+
+# If the CLASS_GRAPH and HAVE_DOT tags are set to YES then doxygen 
+# will generate a graph for each documented class showing the direct and 
+# indirect inheritance relations. Setting this tag to YES will force the 
+# the CLASS_DIAGRAMS tag to NO.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH and HAVE_DOT tags are set to YES then doxygen 
+# will generate a graph for each documented class showing the direct and 
+# indirect implementation dependencies (inheritance, containment, and 
+# class references variables) of the class with other documented classes.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS and HAVE_DOT tags are set to YES then doxygen 
+# will generate a graph for groups, showing the direct groups dependencies
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES doxygen will generate inheritance and 
+# collaboration diagrams in a style similar to the OMG's Unified Modeling 
+# Language.
+
+UML_LOOK               = NO
+
+# If set to YES, the inheritance and collaboration graphs will show the 
+# relations between templates and their instances.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDE_GRAPH, and HAVE_DOT 
+# tags are set to YES then doxygen will generate a graph for each documented 
+# file showing the direct and indirect include dependencies of the file with 
+# other documented files.
+
+INCLUDE_GRAPH          = YES
+
+# If the ENABLE_PREPROCESSING, SEARCH_INCLUDES, INCLUDED_BY_GRAPH, and 
+# HAVE_DOT tags are set to YES then doxygen will generate a graph for each 
+# documented header file showing the documented files that directly or 
+# indirectly include this file.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH and HAVE_DOT options are set to YES then 
+# doxygen will generate a call dependency graph for every global function 
+# or class method. Note that enabling this option will significantly increase 
+# the time of a run. So in most cases it will be better to enable call graphs 
+# for selected functions only using the \callgraph command.
+
+CALL_GRAPH             = YES
+
+# If the CALLER_GRAPH and HAVE_DOT tags are set to YES then 
+# doxygen will generate a caller dependency graph for every global function 
+# or class method. Note that enabling this option will significantly increase 
+# the time of a run. So in most cases it will be better to enable caller 
+# graphs for selected functions only using the \callergraph command.
+
+CALLER_GRAPH           = YES
+
+# If the GRAPHICAL_HIERARCHY and HAVE_DOT tags are set to YES then doxygen 
+# will generate a graphical hierarchy of all classes instead of a textual one.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH, SHOW_DIRECTORIES and HAVE_DOT tags are set to YES 
+# then doxygen will show the dependencies a directory has on other directories 
+# in a graphical way. The dependency relations are determined by the #include 
+# relations between the files in the directories.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images 
+# generated by dot. Possible values are svg, png, jpg, or gif. 
+# If left blank png will be used.
+
+DOT_IMAGE_FORMAT       = svg
+
+# The tag DOT_PATH can be used to specify the path where the dot tool can be 
+# found. If left blank, it is assumed the dot tool can be found in the path.
+
+DOT_PATH               = 
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that 
+# contain dot files that are included in the documentation (see the 
+# \dotfile command).
+
+DOTFILE_DIRS           = 
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that 
+# contain msc files that are included in the documentation (see the 
+# \mscfile command).
+
+MSCFILE_DIRS           = 
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of 
+# nodes that will be shown in the graph. If the number of nodes in a graph 
+# becomes larger than this value, doxygen will truncate the graph, which is 
+# visualized by representing a node as a red box. Note that doxygen if the 
+# number of direct children of the root node in a graph is already larger than 
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note 
+# that the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the 
+# graphs generated by dot. A depth value of 3 means that only nodes reachable 
+# from the root by following a path via at most 3 edges will be shown. Nodes 
+# that lay further from the root node will be omitted. Note that setting this 
+# option to 1 or 2 may greatly reduce the computation time needed for large 
+# code bases. Also note that the size of a graph can be further restricted by 
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent 
+# background. This is disabled by default, because dot on Windows does not 
+# seem to support this out of the box. Warning: Depending on the platform used, 
+# enabling this option may lead to badly anti-aliased labels on the edges of 
+# a graph (i.e. they become hard to read).
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output 
+# files in one run (i.e. multiple -o and -T options on the command line). This 
+# makes dot run faster, but since only newer versions of dot (>1.8.10) 
+# support this, this feature is disabled by default.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES (the default) Doxygen will 
+# generate a legend page explaining the meaning of the various boxes and 
+# arrows in the dot generated graphs.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES (the default) Doxygen will 
+# remove the intermediate dot files that are used to generate 
+# the various graphs.
+
+DOT_CLEANUP            = YES
diff --git a/depend/zcash/doc/authors.md b/depend/zcash/doc/authors.md
new file mode 100644
index 000000000..5700307b9
--- /dev/null
+++ b/depend/zcash/doc/authors.md
@@ -0,0 +1,252 @@
+Zcash Contributors
+==================
+
+Jack Grigg (1142)
+Kris Nuttycombe (524)
+Simon Liu (460)
+Sean Bowe (379)
+Daira Hopwood (325)
+Eirik Ogilvie-Wigley (216)
+Wladimir J. van der Laan (150)
+Alfredo Garcia (119)
+Taylor Hornby (118)
+Marshall Gaucher (112)
+Pieter Wuille (106)
+Jonas Schnelli (90)
+Jay Graber (89)
+Larry Ruane (88)
+Ying Tong Lai (87)
+Marco Falke (82)
+Cory Fields (75)
+Nathan Wilcox (56)
+Matt Corallo (52)
+sasha (51)
+practicalswift (38)
+Kevin Gallagher (38)
+Dimitris Apostolou (38)
+fanquake (36)
+Carl Dong (26)
+Gregory Maxwell (23)
+Jorge Timón (22)
+John Newbery (22)
+Luke Dashjr (21)
+Jonathan "Duke" Leto (18)
+syd (16)
+Patick Strateman (16)
+furszy (15)
+Charlie O'Keefe (15)
+avnish (14)
+Per Grön (14)
+Benjamin Winston (13)
+Steven Smith (12)
+Pavel Janík (12)
+Patrick Strateman (12)
+Ariel Gabizon (12)
+Suhas Daftuar (11)
+Paige Peterson (11)
+Kaz Wesley (11)
+Alex Morcos (11)
+Philip Kaufmann (10)
+Peter Todd (10)
+Marius Kjærstad (10)
+João Barbosa (10)
+ying tong (9)
+teor (9)
+nomnombtc (9)
+kozyilmaz (8)
+Zancas Wilcox (8)
+Jeremy Rubin (8)
+Jeff Garzik (8)
+Ben Wilson (8)
+Karl-Johan Alm (7)
+James O'Beirne (6)
+David Mercer (6)
+Daniel Kraft (6)
+Daniel Cousens (6)
+Chun Kuan Lee (6)
+Casey Rodarmor (6)
+jnewbery (5)
+ca333 (5)
+Sasha (5)
+MeshCollider (5)
+Johnathan Corgan (5)
+George Tankersley (5)
+Gavin Andresen (5)
+Gareth Davies (5)
+Alex Wied (5)
+sandakersmann (4)
+gladcow (4)
+WO (4)
+Sjors Provoost (4)
+Russell Yanofsky (4)
+Nate Wilcox (4)
+mruddy (3)
+lpescher (3)
+isle2983 (3)
+elbandi (3)
+NikVolf (3)
+Martin Ankerl (3)
+Julian Fleischer (3)
+Jim Posen (3)
+Jason Davies (3)
+Evan Klitzke (3)
+Ethan Heilman (3)
+Eric Lombrozo (3)
+Danny Willems (3)
+Anthony Towns (3)
+Alfie John (3)
+whythat (2)
+rofl0r (2)
+ptschip (2)
+noname45688@gmail.com (2)
+kpcyrd (2)
+kobake (2)
+hexabot (2)
+face (2)
+aniemerg (2)
+Yuri Zhykin (2)
+UdjinM6 (2)
+Tim Ruffing (2)
+Thomas Snider (2)
+Solar Designer (2)
+Sebastian Falbesoner (2)
+Scott (2)
+S. Matthew English (2)
+Robert C. Seacord (2)
+Pejvan (2)
+Pavol Rusnak (2)
+Pavel Vasin (2)
+Mustafa (2)
+Matthew King (2)
+Mary Moore-Simmons (2)
+Marek (2)
+Joe Turgeon (2)
+Jeffrey Czyz (2)
+Jack Gavigan (2)
+ITH4Coinomia (2)
+Dagur Valberg Johannsson (2)
+Conrado Gouvea (2)
+Bryant Eisenbach (2)
+Brad Miller (2)
+Bjorn Hjortsberg (2)
+Ben Woosley (2)
+Amgad Abdelhafez (2)
+Alex Tsankov (2)
+Akio Nakamura (2)
+Aditya Kulkarni (2)
+ロ�ン ダル (1)
+zathras-crypto (1)
+vim88 (1)
+unsystemizer (1)
+tulip (1)
+tpantin (1)
+sgmoore (1)
+randy-waterhouse (1)
+plutoforever (1)
+murrayn (1)
+mrbandrews (1)
+kirkalx (1)
+kazcw (1)
+jeff-liang (1)
+jc (1)
+instagibbs (1)
+glowang (1)
+ewillbefull@gmail.com (1)
+emilrus (1)
+dexX7 (1)
+dependabot[bot] (1)
+daniel (1)
+codetriage-readme-bot (1)
+calebogden (1)
+ayleph (1)
+avnish98 (1)
+adityapk00 (1)
+Za Wilcox (1)
+William M Peaster (1)
+Vidar Holen (1)
+Vasil Dimov (1)
+Ulrich Kempken (1)
+Tom Ritter (1)
+Tom Harding (1)
+Technetium (1)
+Stephen (1)
+Shaul Kfir (1)
+Ross Nicoll (1)
+Rod Vagg (1)
+Robert McLaughlin (1)
+Richard Littauer (1)
+René Nyffenegger (1)
+R E Broadley (1)
+Puru (1)
+Peter Pratscher (1)
+Peter Bushnell (1)
+Pedro Branco (1)
+Paul Georgiou (1)
+Paragon Initiative Enterprises, LLC (1)
+NicolasDorier (1)
+Nicolas DORIER (1)
+Nick (1)
+Nathaniel Mahieu (1)
+Murilo Santana (1)
+Miles Manley (1)
+Maxwell Gubler (1)
+Matt Quinn (1)
+Marko Bencun (1)
+Mark Friedenbach (1)
+Luv Khemani (1)
+Louis Nyffenegger (1)
+LongShao007 (1)
+LitecoinZ (1)
+Leo Arias (1)
+Lauda (1)
+Lars-Magnus Skog (1)
+Kristaps Kaupe (1)
+Kevin Pan (1)
+Karel Bilek (1)
+Josh Lehan (1)
+Josh Ellithorpe (1)
+Jonas Nick (1)
+Jesse Cohen (1)
+Jeffrey Walton (1)
+Janito Vaqueiro Ferreira Filho (1)
+Jainan-Tandel (1)
+Igor Cota (1)
+Ian T (1)
+Ian Munoz (1)
+Ian Kelling (1)
+Hennadii Stepanov (1)
+Gregory Sanders (1)
+Gaurav Rana (1)
+Forrest Voight (1)
+Florian Schmaus (1)
+Eran Tromer (1)
+Elliot Olds (1)
+Dimitris Tsapakidis (1)
+DesWurstes (1)
+Denis Lukianov (1)
+David Llop (1)
+Dan Raviv (1)
+Christian von Roques (1)
+Chirag Davé (1)
+Cameron Boehmer (1)
+BtcDrak (1)
+Bryan Stitt (1)
+Bruno Arueira (1)
+Braydon Fuller (1)
+Boris Hajduk (1)
+Bob McElrath (1)
+Bitcoin Error Log (1)
+Bernhard M. Wiedemann (1)
+Ashley Holman (1)
+Andrew Chow (1)
+Allan Niemerg (1)
+Alex van der Peet (1)
+Alex (1)
+Ahmad Kazi (1)
+Adam Weiss (1)
+Adam Langley (1)
+Adam Brown (1)
+Aaron Clauson (1)
+4ZEC (1)
+251 (1)
+21E14 (1)
diff --git a/depend/zcash/doc/bips.md b/depend/zcash/doc/bips.md
new file mode 100644
index 000000000..14c7e372f
--- /dev/null
+++ b/depend/zcash/doc/bips.md
@@ -0,0 +1,4 @@
+BIPs that are implemented by Zcash (up-to-date up to **v1.1.0**):
+
+* Numerous historic BIPs were present in **v1.0.0** at launch; see [the protocol spec](https://github.com/zcash/zips/blob/master/protocol/protocol.pdf) for details.
+* [`BIP 111`](https://github.com/bitcoin/bips/blob/master/bip-0111.mediawiki): `NODE_BLOOM` service bit added, but only enforced for peer versions `>=170004` as of **v1.1.0** ([PR #2814](https://github.com/zcash/zcash/pull/2814)).
diff --git a/depend/zcash/doc/book/.gitignore b/depend/zcash/doc/book/.gitignore
new file mode 100644
index 000000000..7585238ef
--- /dev/null
+++ b/depend/zcash/doc/book/.gitignore
@@ -0,0 +1 @@
+book
diff --git a/depend/zcash/doc/book/book.toml b/depend/zcash/doc/book/book.toml
new file mode 100644
index 000000000..a67147b67
--- /dev/null
+++ b/depend/zcash/doc/book/book.toml
@@ -0,0 +1,6 @@
+[book]
+authors = ["Jack Grigg"]
+language = "en"
+multilingual = false
+src = "src"
+title = "The zcashd Book"
diff --git a/depend/zcash/doc/book/src/README.md b/depend/zcash/doc/book/src/README.md
new file mode 100644
index 000000000..3bad00702
--- /dev/null
+++ b/depend/zcash/doc/book/src/README.md
@@ -0,0 +1 @@
+{{#include ../../../README.md}}
diff --git a/depend/zcash/doc/book/src/SUMMARY.md b/depend/zcash/doc/book/src/SUMMARY.md
new file mode 100644
index 000000000..b886446f3
--- /dev/null
+++ b/depend/zcash/doc/book/src/SUMMARY.md
@@ -0,0 +1,14 @@
+# The zcashd Book
+
+[zcashd](README.md)
+- [User Documentation](user.md)
+  - [Metrics](user/metrics.md)
+  - [Deprecated Features](user/deprecation.md)
+- [Developer Documentation](dev.md)
+  - [Rust in `zcashd`](dev/rust.md)
+  - [Regtest tips and hints](dev/regtest.md)
+  - [Deprecation Procedure](dev/deprecation.md)
+- [Design](design.md)
+  - [Chain state](design/chain-state.md)
+  - ["Coins" view](design/coins-view.md)
+  - [P2P data propagation](design/p2p-data-propagation.md)
diff --git a/depend/zcash/doc/book/src/design.md b/depend/zcash/doc/book/src/design.md
new file mode 100644
index 000000000..643207e11
--- /dev/null
+++ b/depend/zcash/doc/book/src/design.md
@@ -0,0 +1,9 @@
+# Design
+
+Zcash was originally a fork of Bitcoin 0.11.2, and as such the `zcashd` node architecture
+is very similar to `bitcoind`. There are however several differences, most notably the
+addition of shielded pools to the consensus logic and full node state.
+
+In this section of the book, we describe the overall architecture that we inherit from
+`bitcoind`, the changes we have made to the inherited components, and the new components
+we have introduced.
diff --git a/depend/zcash/doc/book/src/design/chain-state.md b/depend/zcash/doc/book/src/design/chain-state.md
new file mode 100644
index 000000000..0e5057f13
--- /dev/null
+++ b/depend/zcash/doc/book/src/design/chain-state.md
@@ -0,0 +1,3 @@
+# Chain state
+
+TBD
diff --git a/depend/zcash/doc/book/src/design/coins-view.md b/depend/zcash/doc/book/src/design/coins-view.md
new file mode 100644
index 000000000..79a44fdf2
--- /dev/null
+++ b/depend/zcash/doc/book/src/design/coins-view.md
@@ -0,0 +1,10 @@
+# "Coins" view
+
+TBD
+
+## Notes
+
+- This is the main context in which `CTxOut::IsNull()` is used. The other is a
+  single spot in the mempool code. Once we've backported the
+  [per-txout CoinsDB](https://github.com/bitcoin/bitcoin/pull/10195) we can
+  hopefully eliminate this method.
diff --git a/depend/zcash/doc/book/src/design/p2p-data-propagation.md b/depend/zcash/doc/book/src/design/p2p-data-propagation.md
new file mode 100644
index 000000000..6296e9df1
--- /dev/null
+++ b/depend/zcash/doc/book/src/design/p2p-data-propagation.md
@@ -0,0 +1,43 @@
+# P2P data propagation
+
+This page contains notes about how block and transaction data is tracked and propagated by
+`zcashd`. Most of this behaviour is inherited from Bitcoin Core, but some differences have
+developed.
+
+Some of this content is duplicated from in-code comments, but assembling this summary in
+one place is generally useful for understanding the overall dynamic :)
+
+## `recentRejects`
+
+When a transaction is rejected by `AcceptToMemoryPool`, the transaction is added to the
+`recentRejects` Bloom filter, so that we don't process it again. The Bloom filter resets
+whenever the chain tip changes, as previously invalid transactions might become valid.
+
+To prevent DoS attacks against wallets submitting transactions, `recentRejects` needs to
+store a commitment to the entire transaction. This ensures that if a transaction is
+malleated by a network peer to invalidate its authorizing data, the node will ignore
+future advertisements of that specific transaction, but still request alternative versions
+of the same txid (which might have valid authorizing data).
+
+- For pre-v5 transactions, the txid commits to the entire transaction, and the wtxid is
+  the txid with a globally-fixed (all-ones) suffix.
+- For v5+ transactions, the wtxid commits to the entire transaction.
+
+## `mapOrphanTransactions`
+
+Upstream uses this map to store transactions that are rejected by `AcceptToMemoryPool`
+because the node doesn't have their transparent inputs. `zcashd` inherits this behaviour
+but limits it to purely-transparent transactions (that is, if a transaction contains any
+shielded components, the node rejects it as invalid and adds it to `recentRejects`).
+
+`mapOrphanTransactions` indexes transactions by txid. This means that if an orphan
+transaction is received (spending transparent UTXOs the node does not know about), and it
+also happens to be invalid for other reasons (subsequent `AcceptToMemoryPool` rules that
+haven't yet been checked), then the node will not request any v5+ transactions with the
+same txid but different authorizing data. This does not create a DoS problem for wallets,
+because an adversary that manipulated an orphan transaction to be invalid under the above
+constraints would also need to prevent the orphan's parent from entering the mempool, and
+eventually a parent is reached that is not an orphan. Once the orphan's direct parent is
+accepted, the orphan is re-evaluated, and if it had been manipulated to be invalid, its
+wtxid is added to `recentRejects` while its txid is removed from `mapOrphanTransactions`,
+enabling the wallet to rebroadcast the unmodified transaction.
diff --git a/depend/zcash/doc/book/src/dev.md b/depend/zcash/doc/book/src/dev.md
new file mode 100644
index 000000000..8fcbaddd0
--- /dev/null
+++ b/depend/zcash/doc/book/src/dev.md
@@ -0,0 +1,3 @@
+# Developer Documentation
+
+This section contains documentation aimed at contributors to the `zcashd` codebase.
diff --git a/depend/zcash/doc/book/src/dev/deprecation.md b/depend/zcash/doc/book/src/dev/deprecation.md
new file mode 100644
index 000000000..16e68e9f3
--- /dev/null
+++ b/depend/zcash/doc/book/src/dev/deprecation.md
@@ -0,0 +1,38 @@
+Deprecation Procedure
+=====================
+
+From time to time, features of `zcashd` and its associated wallet and RPC API are
+deprecated to allow eventual removal of functionality that has been superseded
+by more recent improvements. Deprecation follows a process whereby deprecate
+features can be explicitly turned on or off using the
+`-allowdeprecated=<feature>` CLI argument.
+
+`zcashd` internally supports two sets of deprecated feature flags in
+`src/deprecation.h`:
+- `DEFAULT_ALLOW_DEPRECATED` contains the set of features that remain available
+  for use without having to be specifically enabled using `-allowdeprecated`.
+- `DEFAULT_DENY_DEPRECATED` contains the set of features that are not enabled
+  by default, and must be explicitly enabled using `-allowdeprecated`.
+
+Deprecation of a feature occurs as a 3-step process:
+
+1. A deprecation flag is selected for the feature, and added to
+   `DEFAULT_ALLOW_DEPRECATED`. The fact of its deprecation is announced, and
+   any functionality that supersedes the deprecated feature (if any) is
+   documented, in the release notes. The string `DEPRECATED` is added to
+   user-facing API documentation and CLI help text.
+2. The deprecation flag is removed from `DEFAULT_ALLOW_DEPRECATED` and added to
+   `DEFAULT_DENY_DEPRECATED`.
+3. The deprecated feature is removed entirely, and its deprecation flag is
+   removed.
+
+Features that enter Stage 1 in a particular release should be disabled by
+default after no fewer than 3 releases that update `zcashd`'s
+minor-version, and features should only be fully removed after a total of 6 minor-version
+updates. `zcashd`'s release schedule intends to produce a release that updates
+the minor version every 6 weeks, so deprecated features remain accessible by
+default for approximately 18 weeks, and then can be expected to be removed no
+less than 36 weeks from their initial deprecation. The deprecation timeline for
+each newly deprecated feature should be documented in
+[../user/deprecation.md](../user/deprecation.md).
+
diff --git a/depend/zcash/doc/book/src/dev/regtest.md b/depend/zcash/doc/book/src/dev/regtest.md
new file mode 100644
index 000000000..649d9107c
--- /dev/null
+++ b/depend/zcash/doc/book/src/dev/regtest.md
@@ -0,0 +1,165 @@
+# Regtest
+
+_Regtest_ ("regression test") is one of the three _network types_
+supported by Zcash, the others being `testnet` and `mainnet`.
+Regtest is an entirely local, self-contained mode -- your node or nodes
+do not talk with peers out in the world. It gives you complete
+control of the state of the blockchain and the sequence of events.
+You start with an empty blockchain (just the genesis block, block 0).
+Blocks can be mined instantly, and must be created explicitly. 
+
+You can run one or more regtest nodes on the same system.
+The [RPC tests](https://github.com/zcash/zcash/tree/master/qa/rpc-tests)
+use `regtest` mode (usually starting multiple nodes), but you may use it
+manually and interactively to learn, test, and experiment. Most often
+just one node is used in this case.
+
+## Example session
+
+Here's a sample session (after you've built `zcashd` and `zcash-cli`):
+
+```
+$ mkdir /tmp/regtest-datadir
+$ cat <<EOF >/tmp/regtest-datadir/zcash.conf
+regtest=1
+rpcuser=u
+rpcpassword=p
+rpcport=18132
+EOF
+$ src/zcashd -daemon -datadir=/tmp/regtest-datadir
+```
+
+Watch `tmp/regtest-datadir/regtest/debug.log` to see what `zcashd` is doing.
+It may also be useful to start `zcashd` with `-debug` to generate much
+more logging. Now we can send RPCs to the node:
+
+```
+$ src/zcash-cli -datadir=/tmp/regtest-datadir getblockchaininfo
+{
+  "chain": "regtest",
+  "blocks": 0,
+  "initial_block_download_complete": false,
+  "headers": 0,
+  (...)
+}
+# Generate (mine) three blocks:
+$ src/zcash-cli -datadir=/tmp/regtest-datadir generate 3
+[
+  "05040271f43f78e3870a88697eba201aa361ea5802c69eadaf920ff376787242",
+  "0469f2df43dda69d521c482679b2db3c637b1721222511302584ac75e057c859",
+  "0ab7a26e7b3b5dfca077728de90da0cfd1c49e1edbc130a52de4062b1aecac75"
+]
+$ src/zcash-cli -datadir=/tmp/regtest-datadir getblockchaininfo
+{
+  "chain": "regtest",
+  "blocks": 3,
+  "initial_block_download_complete": true,
+  "headers": 3,
+  (...)
+}
+$ src/zcash-cli -datadir=/tmp/regtest-datadir stop
+Zcash server stopping
+$ 
+```
+## Network upgrades
+
+Zcash has adopted a series of
+[network upgrades](https://github.com/zcash/zcash/blob/master/src/consensus/upgrades.cpp).
+On `mainnet` and `testnet`, these activate at
+fixed, known block heights ([example](https://github.com/zcash/zcash/blob/master/src/chainparams.cpp#L117)).
+In `regtest` mode, you determine the activation heights. Upgrades may occur at
+any height greater than 0, and multiple upgrades can occur at the same height. The upgrades
+have a strict ordering (as shown in the upgrades source file); for example, Canopy can't
+be activated before Blossom. 
+
+You specify the upgrade heights using multiple `-nuparams=`_\<branch-id\>_ arguments.
+(The branch IDs are available in the
+[upgrades.cpp file](https://github.com/zcash/zcash/blob/master/src/consensus/upgrades.cpp))
+It's convenient to add these to the configuration file, for example:
+```
+$ cat <<EOF >>/tmp/regtest-datadir/zcash.conf
+nuparams=76b809bb:1
+nuparams=f5b9230b:5
+EOF
+```
+(Alternatively, you can specify these on the `zcashd` command line.)
+You need not activate every upgrade explicitly. The example activates Sapling
+(branchID 76b809bb) at height 1; activating Sapling implies activating Overwinter, so this
+is done automatically. Similarly, activating Heartwood at height 5
+also simultaneously activates Blossom. Since no later upgrades are specified, none
+of them will activate, regardless of height reached.
+
+**IMPORTANT**: if you change the network upgrade heights from one
+test run to the next, it's almost always necessary to start fresh
+by removing the data directory, otherwise you'll encounter strange errors.
+
+You can see which network upgrades are currently active and which are pending
+(using the above `nuparams` settings as an example):
+```
+$ src/zcash-cli -datadir=/tmp/regtest-datadir generate 2
+$ src/zcash-cli -datadir=/tmp/regtest-datadir getblockchaininfo
+{
+  "blocks": 2,
+  (...)
+    "upgrades": {
+    "5ba81b19": {
+      "name": "Overwinter",
+      "activationheight": 1,
+      "status": "active",
+      "info": "See https://z.cash/upgrade/overwinter/ for details."
+    },
+    "76b809bb": {
+      "name": "Sapling",
+      "activationheight": 1,
+      "status": "active",
+      "info": "See https://z.cash/upgrade/sapling/ for details."
+    },
+    "2bb40e60": {
+      "name": "Blossom",
+      "activationheight": 5,
+      "status": "pending",
+      "info": "See https://z.cash/upgrade/blossom/ for details."
+    },
+    "f5b9230b": {
+      "name": "Heartwood",
+      "activationheight": 5,
+      "status": "pending",
+      "info": "See https://z.cash/upgrade/heartwood/ for details."
+    }
+  },
+  (...)
+}
+```
+
+## Manual testing within an RPC (Python) test run
+
+It is often useful, either when debugging an issue or simply when you want to put
+the node into a certain state, to use the RPC test framework to produce the desired
+state and then be able to manually interrogate and modify that state using `zcash-cli` 
+to execute RPC calls. An easy way to do that is as follows:
+
+Add the line `import time; time.sleep(999999)` (the units are seconds) somewhere
+within an RPC test to pause its execution at that point. Start the test, and then:
+
+```
+$ ps alx | grep zcashd
+0  1000   96247   96246  20   0 1426304 123952 futex_ SLl+ pts/12   0:18 /g/zcash/src/zcashd -datadir=/tmp/test9d907s8a/96246/node0 -keypool=1 -discover=0 -rest -nuparams=5ba81b19:1 -nuparams=76b809bb:1 -debug=mempool -mempooltxcostlimit=8000
+0  1000   96274   96246  20   0 744092 85568 -      RLl+ pts/12     0:05 /g/zcash/src/zcashd -datadir=/tmp/test9d907s8a/96246/node1 -keypool=1 -discover=0 -rest -nuparams=5ba81b19:1 -nuparams=76b809bb:1 -debug=mempool -mempooltxcostlimit=8000
+$ 
+```
+Now you can interact with the running test node by copy-and-pasting its
+`-datadir` argument, for example:
+
+```
+$ src/zcash-cli -datadir=/tmp/test9d907s8a/96246/node0 getblockchaininfo
+```
+(The other `zcashd` command-line arguments are generally not needed by
+`zcash-cli`.) You can see the running node's debug log file:
+```
+$ cat /tmp/test9d907s8a/96246/node0/regtest/debug.log
+```
+or look at its configuration file.
+```
+$ cat /tmp/test9d907s8a/96246/node0/zcash.conf
+```
+In this way, the RPC test framework can teach us more about running `regtest` nodes.
\ No newline at end of file
diff --git a/depend/zcash/doc/book/src/dev/rust.md b/depend/zcash/doc/book/src/dev/rust.md
new file mode 100644
index 000000000..cae406f3a
--- /dev/null
+++ b/depend/zcash/doc/book/src/dev/rust.md
@@ -0,0 +1,56 @@
+# Rust in `zcashd`
+
+`zcashd` is primarily a C++ codebase, but most new code is being written in Rust
+where possible.
+
+## Adding new dependencies in online-Rust mode
+
+The `zcashd` build system pins all dependencies, and in order to facilitate
+deterministic builds, `cargo` is configured to run in offline mode with vendored
+crates. This means that if, for example, you add the `foobar` crate to
+`Cargo.toml`, you will likely see an error similar to this:
+
+```
+$ cargo check
+error: no matching package named `foobar` found
+location searched: registry `https://github.com/rust-lang/crates.io-index`
+required by package `librustzcash v0.2.0 (/path/to/zcash)`
+```
+
+Instead, you first need to build `zcashd` in online-Rust mode:
+```
+CONFIGURE_FLAGS=--enable-online-rust ./zcutil/build.sh
+```
+
+After doing so, you can add a new dependency as follows:
+
+1. Add the new dependency to `Cargo.toml`.
+2. Run `cargo check` to update the `Cargo.lock` file.
+3. Commit `Cargo.toml` and `Cargo.lock`.
+
+## Using a local Rust dependency
+
+During development, you can use a locally checked out version of a dependency
+by applying a [`cargo` patch](https://doc.rust-lang.org/cargo/reference/overriding-dependencies.html#the-patch-section).
+
+For example, to use a local version of the `orchard` crate that includes a new
+API, add the following patch to `Cargo.toml`:
+
+```
+[dependencies]
+# This dependency is listed with a version, meaning it comes from crates.io; the
+# patch goes into a [patch.crates-io] section.
+orchard = "0.0"
+...
+
+[patch.crates-io]
+# Comment out any existing patch, if present.
+# orchard = { git = "https://github.com/zcash/orchard.git", rev = "..." }
+
+# Add this patch (both relative and absolute paths work):
+orchard = { path = "../relative/path/to/orchard" }
+```
+
+Usually you can apply a patch to use a locally checked out dependency without
+needing to build `zcashd` in online-Rust mode. However, if your local changes
+include a new dependency, you will need to ensure you are in online-Rust mode.
diff --git a/depend/zcash/doc/book/src/doc/imgs/logo.png b/depend/zcash/doc/book/src/doc/imgs/logo.png
new file mode 120000
index 000000000..15d77010f
--- /dev/null
+++ b/depend/zcash/doc/book/src/doc/imgs/logo.png
@@ -0,0 +1 @@
+../../../../imgs/logo.png
\ No newline at end of file
diff --git a/depend/zcash/doc/book/src/doc/imgs/zcashd_screen.gif b/depend/zcash/doc/book/src/doc/imgs/zcashd_screen.gif
new file mode 120000
index 000000000..c16cb866f
--- /dev/null
+++ b/depend/zcash/doc/book/src/doc/imgs/zcashd_screen.gif
@@ -0,0 +1 @@
+../../../../imgs/zcashd_screen.gif
\ No newline at end of file
diff --git a/depend/zcash/doc/book/src/user.md b/depend/zcash/doc/book/src/user.md
new file mode 100644
index 000000000..e23cdcf42
--- /dev/null
+++ b/depend/zcash/doc/book/src/user.md
@@ -0,0 +1,6 @@
+# User Documentation
+
+This section contains user documentation specific to `zcashd`.
+
+See [here](https://zcash.readthedocs.io/) for more general Zcash documentation, as well as
+installation instructions for `zcashd`.
diff --git a/depend/zcash/doc/book/src/user/deprecation.md b/depend/zcash/doc/book/src/user/deprecation.md
new file mode 100644
index 000000000..f0c55da38
--- /dev/null
+++ b/depend/zcash/doc/book/src/user/deprecation.md
@@ -0,0 +1,71 @@
+Deprecated Features
+===================
+
+In order to support the continuous improvement of `zcashd`, features are
+periodically deprecated and removed when they have been superseded or are no
+longer useful.  Deprecation follows a 3-stage process:
+
+1. Initially, a feature will be marked as DEPRECATED in the release notes and
+   user-facing documentation, but no other changes are made; the feature
+   continues to be available and function as normal. While features at this
+   stage remain enabled by default, they may be explicitly disabled by
+   specifying `-allowdeprecated=none` on the command line when starting the
+   node, or by including `allowdeprecated=none` as a line in the `zcash.conf`
+   file. 
+2. In the next stage of deprecation, the feature will be disabled by default.
+   Disabled features may be reenabled via use of the `-allowdeprecated` flag.
+3. In the third stage, the feature is fully removed and is no longer available.
+
+Features that enter Stage 1 in a particular release will be disabled by default
+after no fewer than 3 releases that update `zcashd`'s minor-version, and
+features will only be fully removed after a total of at least 6 minor-version updates.
+`zcashd`'s release schedule intends to produce a release that updates the minor
+version every 6 weeks, so deprecated features remain accessible by default for
+approximately 18 weeks, and then can be expected to be removed no less than 36
+weeks after their initial deprecation. Deprecation and removal timelines might
+be extended beyond this on a case-by-case basis to satisfy user requirements. 
+
+Currently Deprecated
+====================
+
+Stage 1
+-------
+
+The following features are deprecated, but remain enabled by default. These features
+will be disabled if `-allowdeprecated=none` is added to the CLI arguments when starting
+the node, or if an `allowdeprecated=none` line is added to `zcash.conf`.
+
+### Deprecated in 5.0.0
+
+The following features are deprecated as of release 5.0.0 and will be disabled by
+default as of release 5.3.0.
+
+  - `legacy_privacy` - The default "legacy" privacy policy for z_sendmany is
+    deprecated. Use `-allowdeprecated=none` to require the default behavior to
+    conform to the `FullPrivacy` directive in all cases instead of just for
+    transactions involving unified addresses. 
+  - `getnewaddress` - The `getnewaddress` RPC method is deprecated.
+  - `getrawchangeaddress` - The `getrawchangeaddress` RPC method is deprecated.
+  - `z_getbalance` - The `z_getbalance` RPC method is deprecated.
+  - `z_gettotalbalance` - The `z_gettotalbalance` RPC method is deprecated.
+  - `z_getnewaddress` - The `z_getnewaddress` RPC method is deprecated.
+  - `z_listaddresses` - The `z_listaddresses` RPC method is deprecated.
+  - `addrtype` - The `type` attribute is deprecated in the results of RPC
+    methods that return address metadata. It is recommended that applications
+    using this metadata be updated to use the `pool` or `address_type`
+    attributes, which have replaced the `type` attribute, as appropriate.
+
+Stage 2
+-------
+
+Each feature in the lists below may be enabled by adding `-allowdeprecated=<feature>`
+to the CLI arguments when starting the node, or by adding an `allowdeprecated=<feature>`
+line to `zcash.conf`.
+
+### Disabled in 5.0.0
+
+The following features are disabled by default, and will be removed in release 5.3.0.
+
+  - `zcrawreceive` - The `zcrawreceive` RPC method is disabled.
+  - `zcrawjoinsplit` - The `zcrawjoinsplit` RPC method is disabled.
+  - `zcrawkeygen` - The `zcrawkeygen` RPC method is disabled.
diff --git a/depend/zcash/doc/book/src/user/metrics.md b/depend/zcash/doc/book/src/user/metrics.md
new file mode 100644
index 000000000..3775b0f4f
--- /dev/null
+++ b/depend/zcash/doc/book/src/user/metrics.md
@@ -0,0 +1,85 @@
+# zcashd metrics
+
+## Metrics UI
+
+This is the user interface that `zcashd` displays by default when run. It
+displays a small selection of interesting metrics, but is not intended for
+programmatic consumption.
+
+## RPC methods
+
+`zcashd` provides the following JSON-RPC methods that expose node metrics:
+
+- Chain:
+  - `getblockchaininfo`: Various state info regarding block chain processing.
+  - `gettxoutsetinfo`: Statistics about the unspent transparent transaction output set.
+  - `getmempoolinfo`: Details on the active state of the TX memory pool.
+- P2P network:
+  - `getnetworkinfo`: Various state info regarding P2P networking.
+  - `getpeerinfo`: Data about each connected network node.
+  - `getdeprecationinfo`: The current node version and deprecation block height.
+- Miscellaneous
+  - `getmemoryinfo`: Information about memory usage.
+  - `getmininginfo`: Mining-related information.
+  - `getinfo` (deprecated): A small subset of the above metrics.
+
+You can see what each method provides with `zcash-cli help METHOD_NAME`.
+
+## Prometheus support
+
+`zcashd` can optionally expose an HTTP server that acts as a Prometheus scrape
+endpoint. The server will respond to `GET` requests on any request path.
+
+To enable the endpoint, add `-prometheusport=<port>` to your `zcashd`
+configuration (either in `zcash.conf` or on the command line). After
+restarting `zcashd` you can then test the endpoint by querying it:
+
+```
+$ curl http://127.0.0.1:<port>
+# TYPE zcash_net_out_messages counter
+zcash_net_out_messages 181
+
+# TYPE zcash_net_in_bytes_total counter
+zcash_net_in_bytes_total 3701998
+
+# TYPE zcash_net_in_messages counter
+zcash_net_in_messages 184
+
+# TYPE zcashd_build_info counter
+zcashd_build_info{version="v4.2.0"} 1
+
+# TYPE zcash_chain_verified_block_total counter
+zcash_chain_verified_block_total 162
+...
+```
+
+By default, access is restricted to localhost. This can be expanded with
+`-metricsallowip=<ip>`, which can specify IPs or subnets. Note that HTTPS is not
+supported, and therefore connections to the endpoint are not encrypted or
+authenticated. Access to the endpoint should be assumed to compromise the
+privacy of node operations, by the provided metrics and/or by timing side
+channels. Non-localhost access is **strongly discouraged** if the node has a
+wallet holding live funds.
+
+### Example metrics collection with Docker
+
+The example instructions below were tested on Windows 10 using Docker Desktop
+with the WSL 2 backend, connected to a `zcashd` running inside WSL2 (but not
+inside Docker):
+
+```
+# Create a storage volume for Grafana (once)
+docker volume create grafana-storage
+
+# Create a storage volume for Prometheus (once)
+docker volume create prometheus-storage
+
+# Run Prometheus
+# You will need to modify ~/contrib/metrics/prometheus.yaml to match the
+# port configured with -prometheusport and -metricsbind / -metricsallowip
+# (and possibly also for your Docker network setup).
+docker run --detach -p 9090:9090 --volume prometheus-storage:/prometheus --volume ~/contrib/metrics/prometheus.yaml:/etc/prometheus/prometheus.yml  prom/prometheus
+
+# Run Grafana
+docker run --detach -p 3030:3030 --env GF_SERVER_HTTP_PORT=3030 --volume grafana-storage:/var/lib/grafana grafana/grafana
+```
diff --git a/depend/zcash/doc/developer-notes.md b/depend/zcash/doc/developer-notes.md
new file mode 100644
index 000000000..a4139ee2b
--- /dev/null
+++ b/depend/zcash/doc/developer-notes.md
@@ -0,0 +1,369 @@
+Coding
+====================
+
+Various coding styles have been used during the history of the codebase,
+and the result is not very consistent. However, we're now trying to converge to
+a single style, so please use it in new code. Old code will be converted
+gradually.
+- Basic rules specified in src/.clang-format. Use a recent clang-format-3.5 to format automatically.
+  - Braces on new lines for namespaces, classes, functions, methods.
+  - Braces on the same line for everything else.
+  - 4 space indentation (no tabs) for every block except namespaces.
+  - No indentation for public/protected/private or for namespaces.
+  - No extra spaces inside parenthesis; don't do ( this )
+  - No space after function names; one space after if, for and while.
+
+Block style example:
+```c++
+namespace foo
+{
+class Class
+{
+    bool Function(char* psz, int n)
+    {
+        // Comment summarising what this section of code does
+        for (int i = 0; i < n; i++) {
+            // When something fails, return early
+            if (!Something())
+                return false;
+            ...
+        }
+
+        // Success return is usually at the end
+        return true;
+    }
+}
+}
+```
+
+Doxygen comments
+-----------------
+
+To facilitate the generation of documentation, use doxygen-compatible comment blocks for functions, methods and fields.
+
+For example, to describe a function use:
+```c++
+/**
+ * ... text ...
+ * @param[in] arg1    A description
+ * @param[in] arg2    Another argument description
+ * @pre Precondition for function...
+ */
+bool function(int arg1, const char *arg2)
+```
+A complete list of `@xxx` commands can be found at http://www.stack.nl/~dimitri/doxygen/manual/commands.html.
+As Doxygen recognizes the comments by the delimiters (`/**` and `*/` in this case), you don't
+*need* to provide any commands for a comment to be valid; just a description text is fine.
+
+To describe a class use the same construct above the class definition:
+```c++
+/**
+ * Alerts are for notifying old versions if they become too obsolete and
+ * need to upgrade. The message is displayed in the status bar.
+ * @see GetWarnings()
+ */
+class CAlert
+{
+```
+
+To describe a member or variable use:
+```c++
+int var; //!< Detailed description after the member
+```
+
+or
+```cpp
+//! Description before the member
+int var;
+```
+
+Also OK:
+```c++
+///
+/// ... text ...
+///
+bool function2(int arg1, const char *arg2)
+```
+
+Not OK (used plenty in the current source, but not picked up):
+```c++
+//
+// ... text ...
+//
+```
+
+A full list of comment syntaxes picked up by doxygen can be found at http://www.stack.nl/~dimitri/doxygen/manual/docblocks.html,
+but if possible use one of the above styles.
+
+Development tips and tricks
+---------------------------
+
+**compiling for debugging**
+
+Run configure with the --enable-debug option, then make. Or run configure with
+CXXFLAGS="-g -ggdb -O0" or whatever debug flags you need.
+
+**compiling for gprof profiling**
+
+Run configure with the --enable-gprof option, then make.
+
+**debug.log**
+
+If the code is behaving strangely, take a look in the debug.log file in the data directory;
+error and debugging messages are written there.
+
+The -debug=... command-line option controls debugging; running with just -debug or -debug=1 will turn
+on all categories (and give you a very large debug.log file).
+
+**testnet and regtest modes**
+
+Run with the -testnet option to run with "play zcash" on the test network, if you
+are testing multi-machine code that needs to operate across the internet.
+
+If you are testing something that can run on one machine, run with the -regtest option.
+In regression test mode, blocks can be created on-demand; see qa/rpc-tests/ for tests
+that run in -regtest mode.
+
+**DEBUG_LOCKORDER**
+
+Zcash is a multithreaded application, and deadlocks or other multithreading bugs
+can be very difficult to track down. Compiling with -DDEBUG_LOCKORDER (configure
+CXXFLAGS="-DDEBUG_LOCKORDER -g") inserts run-time checks to keep track of which locks
+are held, and adds warnings to the debug.log file if inconsistencies are detected.
+
+**Sanitizers**
+
+Bitcoin can be compiled with various "sanitizers" enabled, which add
+instrumentation for issues regarding things like memory safety, thread race
+conditions, or undefined behavior. This is controlled with the
+`--with-sanitizers` configure flag, which should be a comma separated list of
+sanitizers to enable. The sanitizer list should correspond to supported
+`-fsanitize=` options in your compiler. These sanitizers have runtime overhead,
+so they are most useful when testing changes or producing debugging builds.
+
+Some examples:
+
+```bash
+# Enable both the address sanitizer and the undefined behavior sanitizer
+./configure --with-sanitizers=address,undefined
+
+# Enable the thread sanitizer
+./configure --with-sanitizers=thread
+```
+
+If you are compiling with GCC you will typically need to install corresponding
+"san" libraries to actually compile with these flags, e.g. libasan for the
+address sanitizer, libtsan for the thread sanitizer, and libubsan for the
+undefined sanitizer. If you are missing required libraries, the configure script
+will fail with a linker error when testing the sanitizer flags.
+
+The test suite should pass cleanly with the `thread` and `undefined` sanitizers,
+but there are a number of known problems when using the `address` sanitizer. The
+address sanitizer is known to fail in
+[sha256_sse4::Transform](/src/crypto/sha256_sse4.cpp) which makes it unusable
+unless you also use `--disable-asm` when running configure. We would like to fix
+sanitizer issues, so please send pull requests if you can fix any errors found
+by the address sanitizer (or any other sanitizer).
+
+Not all sanitizer options can be enabled at the same time, e.g. trying to build
+with `--with-sanitizers=address,thread` will fail in the configure script as
+these sanitizers are mutually incompatible. Refer to your compiler manual to
+learn more about these options and which sanitizers are supported by your
+compiler.
+
+Additional resources:
+
+ * [AddressSanitizer](https://clang.llvm.org/docs/AddressSanitizer.html)
+ * [LeakSanitizer](https://clang.llvm.org/docs/LeakSanitizer.html)
+ * [MemorySanitizer](https://clang.llvm.org/docs/MemorySanitizer.html)
+ * [ThreadSanitizer](https://clang.llvm.org/docs/ThreadSanitizer.html)
+ * [UndefinedBehaviorSanitizer](https://clang.llvm.org/docs/UndefinedBehaviorSanitizer.html)
+ * [GCC Instrumentation Options](https://gcc.gnu.org/onlinedocs/gcc/Instrumentation-Options.html)
+ * [Google Sanitizers Wiki](https://github.com/google/sanitizers/wiki)
+ * [Issue #12691: Enable -fsanitize flags in Travis](https://github.com/bitcoin/bitcoin/issues/12691)
+
+Locking/mutex usage notes
+-------------------------
+
+The code is multi-threaded, and uses mutexes and the
+LOCK/TRY_LOCK macros to protect data structures.
+
+Deadlocks due to inconsistent lock ordering (thread 1 locks cs_main
+and then cs_wallet, while thread 2 locks them in the opposite order:
+result, deadlock as each waits for the other to release its lock) are
+a problem. Compile with -DDEBUG_LOCKORDER to get lock order
+inconsistencies reported in the debug.log file.
+
+Re-architecting the core code so there are better-defined interfaces
+between the various components is a goal, with any necessary locking
+done by the components (e.g. see the self-contained CKeyStore class
+and its cs_KeyStore lock for example).
+
+Threads
+-------
+
+- ThreadScriptCheck : Verifies block scripts.
+
+- ThreadImport : Loads blocks from blk*.dat files or bootstrap.dat.
+
+- StartNode : Starts other threads.
+
+- ThreadDNSAddressSeed : Loads addresses of peers from the DNS.
+
+- ThreadMapPort : Universal plug-and-play startup/shutdown
+
+- ThreadSocketHandler : Sends/Receives data from peers on port 8233.
+
+- ThreadOpenAddedConnections : Opens network connections to added nodes.
+
+- ThreadOpenConnections : Initiates new connections to peers.
+
+- ThreadMessageHandler : Higher-level message handling (sending and receiving).
+
+- DumpAddresses : Dumps IP addresses of nodes to peers.dat.
+
+- ThreadFlushWalletDB : Close the wallet.dat file if it hasn't been used in 500ms.
+
+- ThreadRPCServer : Remote procedure call handler, listens on port 8232 for connections and services them.
+
+- ZcashMiner : Generates zcash (if wallet is enabled).
+
+- Shutdown : Does an orderly shutdown of everything.
+
+Pull Request Terminology
+------------------------
+
+Concept ACK - Agree with the idea and overall direction, but have neither reviewed nor tested the code changes.
+
+utACK (untested ACK) - Reviewed and agree with the code changes but haven't actually tested them.
+
+Tested ACK - Reviewed the code changes and have verified the functionality or bug fix.
+
+ACK -  A loose ACK can be confusing. It's best to avoid them unless it's a documentation/comment only change in which case there is nothing to test/verify; therefore the tested/untested distinction is not there.
+
+NACK - Disagree with the code changes/concept. Should be accompanied by an explanation.
+
+See the [Development Guidelines](https://zcash.readthedocs.io/en/latest/rtd_pages/development_guidelines.html) documentation for preferred workflows, information on continuous integration and release versioning.
+
+Strings and formatting
+------------------------
+
+- Avoid using locale dependent functions if possible. You can use the provided
+  [`lint-locale-dependence.sh`](../test/lint/lint-locale-dependence.sh)
+  to check for accidental use of locale-dependent functions.
+
+  - *Rationale*: Unnecessary locale dependence can cause bugs that are very tricky to isolate and fix.
+
+  - These functions are known to be locale-dependent:
+    `alphasort`, `asctime`, `asprintf`, `atof`, `atoi`, `atol`, `atoll`, `atoq`,
+    `btowc`, `ctime`, `dprintf`, `fgetwc`, `fgetws`, `fprintf`, `fputwc`,
+    `fputws`, `fscanf`, `fwprintf`, `getdate`, `getwc`, `getwchar`, `isalnum`,
+    `isalpha`, `isblank`, `iscntrl`, `isdigit`, `isgraph`, `islower`, `isprint`,
+    `ispunct`, `isspace`, `isupper`, `iswalnum`, `iswalpha`, `iswblank`,
+    `iswcntrl`, `iswctype`, `iswdigit`, `iswgraph`, `iswlower`, `iswprint`,
+    `iswpunct`, `iswspace`, `iswupper`, `iswxdigit`, `isxdigit`, `mblen`,
+    `mbrlen`, `mbrtowc`, `mbsinit`, `mbsnrtowcs`, `mbsrtowcs`, `mbstowcs`,
+    `mbtowc`, `mktime`, `putwc`, `putwchar`, `scanf`, `snprintf`, `sprintf`,
+    `sscanf`, `stoi`, `stol`, `stoll`, `strcasecmp`, `strcasestr`, `strcoll`,
+    `strfmon`, `strftime`, `strncasecmp`, `strptime`, `strtod`, `strtof`,
+    `strtoimax`, `strtol`, `strtold`, `strtoll`, `strtoq`, `strtoul`,
+    `strtoull`, `strtoumax`, `strtouq`, `strxfrm`, `swprintf`, `tolower`,
+    `toupper`, `towctrans`, `towlower`, `towupper`, `ungetwc`, `vasprintf`,
+    `vdprintf`, `versionsort`, `vfprintf`, `vfscanf`, `vfwprintf`, `vprintf`,
+    `vscanf`, `vsnprintf`, `vsprintf`, `vsscanf`, `vswprintf`, `vwprintf`,
+    `wcrtomb`, `wcscasecmp`, `wcscoll`, `wcsftime`, `wcsncasecmp`, `wcsnrtombs`,
+    `wcsrtombs`, `wcstod`, `wcstof`, `wcstoimax`, `wcstol`, `wcstold`,
+    `wcstoll`, `wcstombs`, `wcstoul`, `wcstoull`, `wcstoumax`, `wcswidth`,
+    `wcsxfrm`, `wctob`, `wctomb`, `wctrans`, `wctype`, `wcwidth`, `wprintf`
+
+Scripts
+--------------------------
+
+### Shebang
+
+- Use `#!/usr/bin/env bash` instead of obsolete `#!/bin/bash`.
+
+  - [*Rationale*](https://github.com/dylanaraps/pure-bash-bible#shebang):
+
+    `#!/bin/bash` assumes it is always installed to /bin/ which can cause issues;
+
+    `#!/usr/bin/env bash` searches the user's PATH to find the bash binary.
+
+  OK:
+
+```bash
+#!/usr/bin/env bash
+```
+
+  Wrong:
+
+```bash
+#!/bin/bash
+```
+
+Source code organization
+--------------------------
+
+- Use include guards to avoid the problem of double inclusion. The header file
+  `foo/bar.h` should use the include guard identifier `ZCASH_FOO_BAR_H`, e.g.
+
+```c++
+#ifndef ZCASH_FOO_BAR_H
+#define ZCASH_FOO_BAR_H
+...
+#endif // ZCASH_FOO_BAR_H
+```
+
+Subtrees
+----------
+
+Several parts of the repository are subtrees of software maintained elsewhere.
+
+Some of these are maintained by active developers of Zcash or Bitcoin Core, in which case changes should probably go
+directly upstream without being PRed directly against the project. They will be merged back in the next
+subtree merge.
+
+Others are external projects without a tight relationship with our project. Changes to these should also
+be sent upstream, but bugfixes may also be prudent to PR against Zcash and/or Bitcoin Core so that they can be integrated
+quickly. Cosmetic changes should be purely taken upstream.
+
+There is a tool in `test/lint/git-subtree-check.sh` ([instructions](../test/lint#git-subtree-checksh)) to check a subtree directory for consistency with
+its upstream repository.
+
+Current subtrees include:
+
+- src/leveldb
+  - Upstream at https://github.com/google/leveldb ; Maintained by Google, but
+    open important PRs to Core to avoid delay.
+  - **Note**: Follow the instructions in [Upgrading LevelDB](#upgrading-leveldb) when
+    merging upstream changes to the LevelDB subtree.
+
+- src/secp256k1
+  - Upstream at https://github.com/bitcoin-core/secp256k1/ ; actively maintained by Core contributors.
+
+- src/crypto/ctaes
+  - Upstream at https://github.com/bitcoin-core/ctaes ; actively maintained by Core contributors.
+
+- src/univalue
+  - Upstream at https://github.com/bitcoin-core/univalue ; actively maintained by Core contributors, deviates from upstream https://github.com/jgarzik/univalue
+
+Scripted diffs
+--------------
+
+For reformatting and refactoring commits where the changes can be easily automated using a bash script, we use
+scripted-diff commits. The bash script is included in the commit message and our Travis CI job checks that
+the result of the script is identical to the commit. This aids reviewers since they can verify that the script
+does exactly what it's supposed to do. It is also helpful for rebasing (since the same script can just be re-run
+on the new master commit).
+
+To create a scripted-diff:
+
+- start the commit message with `scripted-diff:` (and then a description of the diff on the same line)
+- in the commit message include the bash script between lines containing just the following text:
+
+    - `-BEGIN VERIFY SCRIPT-`
+    - `-END VERIFY SCRIPT-`
+
+The scripted-diff is verified by the tool `test/lint/commit-script-check.sh`
+
+Commit `ccd074a5` is an example of a scripted-diff.
diff --git a/depend/zcash/doc/dnsseed-policy.md b/depend/zcash/doc/dnsseed-policy.md
new file mode 100644
index 000000000..54d739a9a
--- /dev/null
+++ b/depend/zcash/doc/dnsseed-policy.md
@@ -0,0 +1,6 @@
+Expectations for DNS Seed operators
+====================================
+
+This document has been relocated to https://zcash.readthedocs.io/en/latest/rtd_pages/dnsseed_policy.html
+
+The source for this document is available at https://gitlab.com/zcash-docs/zcash-docs/blob/master/source/rtd_pages/dnsseed_policy.rst
\ No newline at end of file
diff --git a/depend/zcash/doc/files.md b/depend/zcash/doc/files.md
new file mode 100644
index 000000000..b29865e58
--- /dev/null
+++ b/depend/zcash/doc/files.md
@@ -0,0 +1,5 @@
+# Data Directory Files
+
+This document has been relocated to https://zcash.readthedocs.io/en/latest/rtd_pages/files.html
+
+The source for this document is available at https://gitlab.com/zcash-docs/zcash-docs/blob/master/source/rtd_pages/files.rst
diff --git a/depend/zcash/doc/hotfix-process.md b/depend/zcash/doc/hotfix-process.md
new file mode 100644
index 000000000..1dd60d7ae
--- /dev/null
+++ b/depend/zcash/doc/hotfix-process.md
@@ -0,0 +1,49 @@
+Hotfix Release Process
+======================
+
+Hotfix releases are versioned by incrementing the patch number of the latest
+release. For example:
+
+    First hotfix:  v1.0.0 -> v1.0.1
+    Second hotfix: v1.0.1 -> v1.0.2
+
+In the commands below, <RELEASE> and <RELEASE_PREV> are prefixed with a v, ie.
+v1.0.2 (not 1.0.2).
+
+## Create a hotfix branch
+
+Create a hotfix branch from the previous release tag, and push it to the main
+repository:
+
+    $ git branch hotfix-<RELEASE> <RELEASE_PREV>
+    $ git push 'git@github.com:zcash/zcash' hotfix-<RELEASE>
+
+## Implement hotfix changes
+
+Hotfix changes are implemented the same way as regular changes (developers work
+in separate branches per change, and push the branches to their own repositories),
+except that the branches are based on the hotfix branch instead of master:
+
+    $ git checkout hotfix-<RELEASE>
+    $ git checkout -b <BRANCH_NAME>
+
+## Merge hotfix PRs
+
+Hotfix PRs are created like regular PRs, except using the hotfix branch as the
+base instead of `master`. Each PR should be reviewed and merged as normal.
+
+## Release process
+
+The majority of this process is identical to the standard release process.
+Release candidates for hotfixes should be created and tested as normal, using
+the `hotfix-<RELEASE>` branch in place of the release stabilization branch,
+with a couple of minor differences:
+
+- When running the release script, use the `--hotfix` flag. Provide the hash of 
+  the commit to be released as the first argument:
+
+    $ ./zcutil/make-release.py --hotfix <COMMIT_ID> <RELEASE> <RELEASE_PREV> <APPROX_RELEASE_HEIGHT>
+
+- To review the automated changes in git:
+
+    $ git log hotfix-<RELEASE>..HEAD
diff --git a/depend/zcash/doc/imgs/logo.png b/depend/zcash/doc/imgs/logo.png
new file mode 100644
index 000000000..52ea66ec3
Binary files /dev/null and b/depend/zcash/doc/imgs/logo.png differ
diff --git a/depend/zcash/doc/imgs/zcashd_screen.gif b/depend/zcash/doc/imgs/zcashd_screen.gif
new file mode 100644
index 000000000..2eebc1cba
Binary files /dev/null and b/depend/zcash/doc/imgs/zcashd_screen.gif differ
diff --git a/depend/zcash/doc/imgs/zcashd_screenshot.png b/depend/zcash/doc/imgs/zcashd_screenshot.png
new file mode 100644
index 000000000..cdb8a20b8
Binary files /dev/null and b/depend/zcash/doc/imgs/zcashd_screenshot.png differ
diff --git a/depend/zcash/doc/man/Makefile.am b/depend/zcash/doc/man/Makefile.am
new file mode 100644
index 000000000..27917a208
--- /dev/null
+++ b/depend/zcash/doc/man/Makefile.am
@@ -0,0 +1 @@
+dist_man1_MANS=zcashd.1 zcash-cli.1 zcash-fetch-params.1 zcash-tx.1
diff --git a/depend/zcash/doc/man/zcash-cli.1 b/depend/zcash/doc/man/zcash-cli.1
new file mode 100644
index 000000000..38c89ee81
--- /dev/null
+++ b/depend/zcash/doc/man/zcash-cli.1
@@ -0,0 +1,88 @@
+.\" DO NOT MODIFY THIS FILE!  It was generated by help2man 1.49.1.
+.TH ZCASH-CLI "1" "May 2022" "zcash-cli v5.0.0" "User Commands"
+.SH NAME
+zcash-cli \- manual page for zcash-cli v5.0.0
+.SH DESCRIPTION
+Zcash RPC client version v5.0.0
+.PP
+In order to ensure you are adequately protecting your privacy when using Zcash,
+please see <https://z.cash/support/security/>.
+.SS "Usage:"
+.TP
+zcash\-cli [options] <command> [params]
+Send command to Zcash
+.TP
+zcash\-cli [options] help
+List commands
+.TP
+zcash\-cli [options] help <command>
+Get help for a command
+.SH OPTIONS
+.HP
+\-?
+.IP
+This help message
+.HP
+\fB\-conf=\fR<file>
+.IP
+Specify configuration file (default: zcash.conf)
+.HP
+\fB\-datadir=\fR<dir>
+.IP
+Specify data directory (this path cannot use '~')
+.HP
+\fB\-stdin\fR
+.IP
+Read extra arguments from standard input, one per line until EOF/Ctrl\-D
+(recommended for sensitive information such as passphrases). If first
+extra argument is `walletpassphrase` then the first line(password) will
+not be echoed.
+.PP
+Chain selection options:
+.HP
+\fB\-testnet\fR
+.IP
+Use the test chain
+.HP
+\fB\-regtest\fR
+.IP
+Enter regression test mode, which uses a special chain in which blocks
+can be solved instantly. This is intended for regression testing tools
+and app development.
+.HP
+\fB\-rpcconnect=\fR<ip>
+.IP
+Send commands to node running on <ip> (default: 127.0.0.1)
+.HP
+\fB\-rpcport=\fR<port>
+.IP
+Connect to JSON\-RPC on <port> (default: 8232 or testnet: 18232)
+.HP
+\fB\-rpcwait\fR
+.IP
+Wait for RPC server to start
+.HP
+\fB\-rpcuser=\fR<user>
+.IP
+Username for JSON\-RPC connections
+.HP
+\fB\-rpcpassword=\fR<pw>
+.IP
+Password for JSON\-RPC connections
+.HP
+\fB\-rpcclienttimeout=\fR<n>
+.IP
+Timeout in seconds during HTTP requests, or 0 for no timeout. (default:
+900)
+.SH COPYRIGHT
+
+In order to ensure you are adequately protecting your privacy when using Zcash,
+please see <https://z.cash/support/security/>.
+
+Copyright (C) 2009-2022 The Bitcoin Core Developers
+Copyright (C) 2015-2022 The Zcash Developers
+
+This is experimental software.
+
+Distributed under the MIT software license, see the accompanying file COPYING
+or <https://www.opensource.org/licenses/mit-license.php>.
diff --git a/depend/zcash/doc/man/zcash-fetch-params.1 b/depend/zcash/doc/man/zcash-fetch-params.1
new file mode 100644
index 000000000..76dab4c23
--- /dev/null
+++ b/depend/zcash/doc/man/zcash-fetch-params.1
@@ -0,0 +1,28 @@
+.\" DO NOT MODIFY THIS FILE!  It was generated by help2man 1.47.3.
+.TH ZCASH-FETCH-PARAMS "1" "January 2017" "Zcash - zcash-fetch-params" "User Commands"
+.SH NAME
+zcash-fetch-params \- Downloads the Zcash network parameters
+.SH DESCRIPTION
+Zcash \- zcash-fetch\-params
+.PP
+This script will fetch the Zcash zkSNARK parameters and verify their
+integrity with sha256sum.
+.PP
+If they already exist locally, it will exit now and do nothing else.
+.PP
+This script will fetch the Zcash zkSNARK parameters and verify their
+integrity with sha256sum.
+.PP
+If they already exist locally, it will exit now and do nothing else.
+.SH "SEE ALSO"
+The full documentation for
+.B Zcash
+is maintained as a Texinfo manual.  If the
+.B info
+and
+.B Zcash
+programs are properly installed at your site, the command
+.IP
+.B info Zcash
+.PP
+should give you access to the complete manual.
diff --git a/depend/zcash/doc/man/zcash-tx.1 b/depend/zcash/doc/man/zcash-tx.1
new file mode 100644
index 000000000..79863fa8d
--- /dev/null
+++ b/depend/zcash/doc/man/zcash-tx.1
@@ -0,0 +1,100 @@
+.\" DO NOT MODIFY THIS FILE!  It was generated by help2man 1.49.1.
+.TH ZCASH-TX "1" "May 2022" "zcash-tx v5.0.0" "User Commands"
+.SH NAME
+zcash-tx \- manual page for zcash-tx v5.0.0
+.SH DESCRIPTION
+Zcash zcash\-tx utility version v5.0.0
+.SS "Usage:"
+.TP
+zcash\-tx [options] <hex\-tx> [commands]
+Update hex\-encoded zcash transaction
+.TP
+zcash\-tx [options] \fB\-create\fR [commands]
+Create hex\-encoded zcash transaction
+.SH OPTIONS
+.HP
+\-?
+.IP
+This help message
+.HP
+\fB\-create\fR
+.IP
+Create new, empty TX.
+.HP
+\fB\-json\fR
+.IP
+Select JSON output
+.HP
+\fB\-txid\fR
+.IP
+Output only the hex\-encoded transaction id of the resultant transaction.
+.PP
+Chain selection options:
+.HP
+\fB\-testnet\fR
+.IP
+Use the test chain
+.HP
+\fB\-regtest\fR
+.IP
+Enter regression test mode, which uses a special chain in which blocks
+can be solved instantly. This is intended for regression testing tools
+and app development.
+.PP
+Commands:
+.IP
+delin=N
+.IP
+Delete input N from TX
+.IP
+delout=N
+.IP
+Delete output N from TX
+.IP
+in=TXID:VOUT(:SEQUENCE_NUMBER)
+.IP
+Add input to TX
+.IP
+locktime=N
+.IP
+Set TX lock time to N
+.IP
+nversion=N
+.IP
+Set TX version to N
+.IP
+outaddr=VALUE:ADDRESS
+.IP
+Add address\-based output to TX
+.IP
+outscript=VALUE:SCRIPT
+.IP
+Add raw script output to TX
+.IP
+sign=HEIGHT:SIGHASH\-FLAGS
+.IP
+Add zero or more signatures to transaction. This command requires JSON
+registers:prevtxs=JSON object, privatekeys=JSON object. See
+signrawtransaction docs for format of sighash flags, JSON objects.
+.PP
+Register Commands:
+.IP
+load=NAME:FILENAME
+.IP
+Load JSON file FILENAME into register NAME
+.IP
+set=NAME:JSON\-STRING
+.IP
+Set register NAME to given JSON\-STRING
+.SH COPYRIGHT
+
+In order to ensure you are adequately protecting your privacy when using Zcash,
+please see <https://z.cash/support/security/>.
+
+Copyright (C) 2009-2022 The Bitcoin Core Developers
+Copyright (C) 2015-2022 The Zcash Developers
+
+This is experimental software.
+
+Distributed under the MIT software license, see the accompanying file COPYING
+or <https://www.opensource.org/licenses/mit-license.php>.
diff --git a/depend/zcash/doc/man/zcashd-wallet-tool.1 b/depend/zcash/doc/man/zcashd-wallet-tool.1
new file mode 100644
index 000000000..4adf72a35
--- /dev/null
+++ b/depend/zcash/doc/man/zcashd-wallet-tool.1
@@ -0,0 +1,53 @@
+.\" DO NOT MODIFY THIS FILE!  It was generated by help2man 1.49.1.
+.TH ZCASHD-WALLET-TOOL "1" "May 2022" "zcashd-wallet-tool v5.0.0" "User Commands"
+.SH NAME
+zcashd-wallet-tool \- manual page for zcashd-wallet-tool v5.0.0
+.SH SYNOPSIS
+.B zcashd-wallet-tool
+[\fI\,OPTIONS\/\fR]
+.SH DESCRIPTION
+.SS "Optional arguments:"
+.TP
+\fB\-\-help\fR
+Print this help output
+.TP
+\fB\-\-conf\fR FILENAME
+Specify configuration filename, relative to the data directory (default: zcash.conf)
+.TP
+\fB\-\-datadir\fR PATH
+Specify data directory (this path cannot use '~')
+.TP
+\fB\-\-testnet\fR
+Use the test chain
+.TP
+\fB\-\-rpcconnect\fR IPADDR
+Send commands to node running on IPADDR (default: 127.0.0.1)
+.TP
+\fB\-\-rpcport\fR PORT
+Connect to JSON\-RPC on PORT (default: 8232 or testnet: 18232)
+.TP
+\fB\-\-rpcuser\fR USERNAME
+Username for JSON\-RPC connections
+.TP
+\fB\-\-rpcpassword\fR PASSWORD
+Password for JSON\-RPC connections
+.TP
+\fB\-\-rpcclienttimeout\fR SECONDS
+Timeout in seconds during HTTP requests, or 0 for no timeout. (default: 900)
+.PP
+Options can be given in GNU style (`\-\-conf=CONF` or `\-\-conf CONF`),
+or in Bitcoin style with a single hyphen (`\-conf=CONF`).
+.PP
+The environment variable RUST_LOG controls debug output, e.g.
+`RUST_LOG=debug`.
+.SH COPYRIGHT
+
+In order to ensure you are adequately protecting your privacy when using Zcash,
+please see <https://z.cash/support/security/>.
+
+Copyright (C) 2015-2022 The Zcash Developers
+
+This is experimental software.
+
+Distributed under the MIT software license, see the accompanying file COPYING
+or <https://www.opensource.org/licenses/mit-license.php>.
diff --git a/depend/zcash/doc/man/zcashd.1 b/depend/zcash/doc/man/zcashd.1
new file mode 100644
index 000000000..186b1518a
--- /dev/null
+++ b/depend/zcash/doc/man/zcashd.1
@@ -0,0 +1,593 @@
+.\" DO NOT MODIFY THIS FILE!  It was generated by help2man 1.49.1.
+.TH ZCASHD "1" "May 2022" "zcashd v5.0.0" "User Commands"
+.SH NAME
+zcashd \- manual page for zcashd v5.0.0
+.SH DESCRIPTION
+Zcash Daemon version v5.0.0
+.PP
+In order to ensure you are adequately protecting your privacy when using Zcash,
+please see <https://z.cash/support/security/>.
+.SS "Usage:"
+.TP
+zcashd [options]
+Start Zcash Daemon
+.SH OPTIONS
+.HP
+\-?
+.IP
+This help message
+.HP
+\fB\-alerts\fR
+.IP
+Receive and display P2P network alerts (default: 1)
+.HP
+\fB\-alertnotify=\fR<cmd>
+.IP
+Execute command when a relevant alert is received or we see a really
+long fork (%s in cmd is replaced by message)
+.HP
+\fB\-allowdeprecated=\fR<feature>
+.IP
+Explicitly allow the use of the specified deprecated feature. Multiple
+instances of this parameter are permitted; values for <feature> must be
+selected from among {"none", "addrtype", "getnewaddress",
+"getrawchangeaddress", "legacy_privacy", "z_getbalance",
+"z_getnewaddress", "z_gettotalbalance", "z_listaddresses",
+"zcrawjoinsplit", "zcrawkeygen", "zcrawreceive"}
+.HP
+\fB\-blocknotify=\fR<cmd>
+.IP
+Execute command when the best block changes (%s in cmd is replaced by
+block hash)
+.HP
+\fB\-checkblocks=\fR<n>
+.IP
+How many blocks to check at startup (default: 288, 0 = all)
+.HP
+\fB\-checklevel=\fR<n>
+.IP
+How thorough the block verification of \fB\-checkblocks\fR is (0\-4, default: 3)
+.HP
+\fB\-conf=\fR<file>
+.IP
+Specify configuration file (default: zcash.conf)
+.HP
+\fB\-daemon\fR
+.IP
+Run in the background as a daemon and accept commands
+.HP
+\fB\-datadir=\fR<dir>
+.IP
+Specify data directory (this path cannot use '~')
+.HP
+\fB\-paramsdir=\fR<dir>
+.IP
+Specify Zcash network parameters directory
+.HP
+\fB\-dbcache=\fR<n>
+.IP
+Set database cache size in megabytes (4 to 16384, default: 450)
+.HP
+\fB\-debuglogfile=\fR<file>
+.IP
+Specify location of debug log file: this can be an absolute path or a
+path relative to the data directory (default: debug.log)
+.HP
+\fB\-exportdir=\fR<dir>
+.IP
+Specify directory to be used when exporting data
+.HP
+\fB\-ibdskiptxverification\fR
+.IP
+Skip transaction verification during initial block download up to the
+last checkpoint height. Incompatible with flags that disable
+checkpoints. (default = 0)
+.HP
+\fB\-loadblock=\fR<file>
+.IP
+Imports blocks from external blk000??.dat file on startup
+.HP
+\fB\-maxorphantx=\fR<n>
+.IP
+Keep at most <n> unconnectable transactions in memory (default: 100)
+.HP
+\fB\-par=\fR<n>
+.IP
+Set the number of script verification threads (\fB\-16\fR to 16, 0 = auto, <0 =
+leave that many cores free, default: 0)
+.HP
+\fB\-pid=\fR<file>
+.IP
+Specify pid file (default: zcashd.pid)
+.HP
+\fB\-prune=\fR<n>
+.IP
+Reduce storage requirements by pruning (deleting) old blocks. This mode
+disables wallet support and is incompatible with \fB\-txindex\fR. Warning:
+Reverting this setting requires re\-downloading the entire blockchain.
+(default: 0 = disable pruning blocks, >550 = target size in MiB to use
+for block files)
+.HP
+\fB\-reindex\-chainstate\fR
+.IP
+Rebuild chain state from the currently indexed blocks (implies \fB\-rescan\fR
+unless pruning or unless \fB\-rescan\fR=\fI\,0\/\fR is explicitly specified)
+.HP
+\fB\-reindex\fR
+.IP
+Rebuild chain state and block index from the blk*.dat files on disk
+(implies \fB\-rescan\fR unless pruning or unless \fB\-rescan\fR=\fI\,0\/\fR is explicitly
+specified)
+.HP
+\fB\-sysperms\fR
+.IP
+Create new files with system default permissions, instead of umask 077
+(only effective with disabled wallet functionality)
+.HP
+\fB\-txexpirynotify=\fR<cmd>
+.IP
+Execute command when transaction expires (%s in cmd is replaced by
+transaction id)
+.HP
+\fB\-txindex\fR
+.IP
+Maintain a full transaction index, used by the getrawtransaction rpc
+call (default: 0)
+.PP
+Connection options:
+.HP
+\fB\-addnode=\fR<ip>
+.IP
+Add a node to connect to and attempt to keep the connection open
+.HP
+\fB\-banscore=\fR<n>
+.IP
+Threshold for disconnecting misbehaving peers (default: 100)
+.HP
+\fB\-bantime=\fR<n>
+.IP
+Number of seconds to keep misbehaving peers from reconnecting (default:
+86400)
+.HP
+\fB\-bind=\fR<addr>
+.IP
+Bind to given address and always listen on it. Use [host]:port notation
+for IPv6
+.HP
+\fB\-connect=\fR<ip>
+.IP
+Connect only to the specified node(s); \fB\-noconnect\fR or \fB\-connect\fR=\fI\,0\/\fR alone to
+disable automatic connections
+.HP
+\fB\-discover\fR
+.IP
+Discover own IP addresses (default: 1 when listening and no \fB\-externalip\fR
+or \fB\-proxy\fR)
+.HP
+\fB\-dns\fR
+.IP
+Allow DNS lookups for \fB\-addnode\fR, \fB\-seednode\fR and \fB\-connect\fR (default: 1)
+.HP
+\fB\-dnsseed\fR
+.IP
+Query for peer addresses via DNS lookup, if low on addresses (default: 1
+unless \fB\-connect\fR/\-noconnect)
+.HP
+\fB\-externalip=\fR<ip>
+.IP
+Specify your own public address
+.HP
+\fB\-forcednsseed\fR
+.IP
+Always query for peer addresses via DNS lookup (default: 0)
+.HP
+\fB\-listen\fR
+.IP
+Accept connections from outside (default: 1 if no \fB\-proxy\fR or
+\fB\-connect\fR/\-noconnect)
+.HP
+\fB\-listenonion\fR
+.IP
+Automatically create Tor hidden service (default: 1)
+.HP
+\fB\-maxconnections=\fR<n>
+.IP
+Maintain at most <n> connections to peers (default: 125)
+.HP
+\fB\-maxreceivebuffer=\fR<n>
+.IP
+Maximum per\-connection receive buffer, <n>*1000 bytes (default: 5000)
+.HP
+\fB\-maxsendbuffer=\fR<n>
+.IP
+Maximum per\-connection send buffer, <n>*1000 bytes (default: 1000)
+.HP
+\fB\-mempoolevictionmemoryminutes=\fR<n>
+.IP
+The number of minutes before allowing rejected transactions to re\-enter
+the mempool. (default: 60)
+.HP
+\fB\-mempooltxcostlimit=\fR<n>
+.IP
+An upper bound on the maximum size in bytes of all transactions in the
+mempool. (default: 80000000)
+.HP
+\fB\-onion=\fR<ip:port>
+.IP
+Use separate SOCKS5 proxy to reach peers via Tor hidden services
+(default: \fB\-proxy\fR)
+.HP
+\fB\-onlynet=\fR<net>
+.IP
+Only connect to nodes in network <net> (ipv4, ipv6 or onion)
+.HP
+\fB\-permitbaremultisig\fR
+.IP
+Relay non\-P2SH multisig (default: 1)
+.HP
+\fB\-peerbloomfilters\fR
+.IP
+Support filtering of blocks and transaction with bloom filters (default:
+1)
+.HP
+\fB\-port=\fR<port>
+.IP
+Listen for connections on <port> (default: 8233 or testnet: 18233)
+.HP
+\fB\-proxy=\fR<ip:port>
+.IP
+Connect through SOCKS5 proxy
+.HP
+\fB\-proxyrandomize\fR
+.IP
+Randomize credentials for every proxy connection. This enables Tor
+stream isolation (default: 1)
+.HP
+\fB\-seednode=\fR<ip>
+.IP
+Connect to a node to retrieve peer addresses, and disconnect
+.HP
+\fB\-timeout=\fR<n>
+.IP
+Specify connection timeout in milliseconds (minimum: 1, default: 5000)
+.HP
+\fB\-torcontrol=\fR<ip>:<port>
+.IP
+Tor control port to use if onion listening enabled (default:
+127.0.0.1:9051)
+.HP
+\fB\-torpassword=\fR<pass>
+.IP
+Tor control port password (default: empty)
+.HP
+\fB\-whitebind=\fR<addr>
+.IP
+Bind to given address and whitelist peers connecting to it. Use
+[host]:port notation for IPv6
+.HP
+\fB\-whitelist=\fR<netmask>
+.IP
+Whitelist peers connecting from the given netmask or IP address. Can be
+specified multiple times. Whitelisted peers cannot be DoS banned and
+their transactions are always relayed, even if they are already in the
+mempool, useful e.g. for a gateway
+.HP
+\fB\-whitelistrelay\fR
+.IP
+Accept relayed transactions received from whitelisted inbound peers even
+when not relaying transactions (default: 1)
+.HP
+\fB\-whitelistforcerelay\fR
+.IP
+Force relay of transactions from whitelisted inbound peers even they
+violate local relay policy (default: 1)
+.HP
+\fB\-maxuploadtarget=\fR<n>
+.IP
+Tries to keep outbound traffic under the given target (in MiB per 24h),
+0 = no limit (default: 0)
+.PP
+Wallet options:
+.HP
+\fB\-disablewallet\fR
+.IP
+Do not load the wallet and disable wallet RPC calls
+.HP
+\fB\-keypool=\fR<n>
+.IP
+Set key pool size to <n> (default: 100)
+.HP
+\fB\-migration\fR
+.IP
+Enable the Sprout to Sapling migration
+.HP
+\fB\-migrationdestaddress=\fR<zaddr>
+.IP
+Set the Sapling migration address
+.HP
+\fB\-mintxfee=\fR<amt>
+.IP
+Fees (in ZEC/kB) smaller than this are considered zero fee for
+transaction creation (default: 0.00001)
+.HP
+\fB\-orchardactionlimit=\fR<n>
+.IP
+Set the maximum number of Orchard actions permitted in a transaction
+(default 50)
+.HP
+\fB\-paytxfee=\fR<amt>
+.IP
+Fee (in ZEC/kB) to add to transactions you send (default: 0.00)
+.HP
+\fB\-rescan\fR
+.IP
+Rescan the block chain for missing wallet transactions on startup
+.HP
+\fB\-salvagewallet\fR
+.IP
+Attempt to recover private keys from a corrupt wallet on startup
+(implies \fB\-rescan\fR)
+.HP
+\fB\-sendfreetransactions\fR
+.IP
+Send transactions as zero\-fee transactions if possible (default: 0)
+.HP
+\fB\-spendzeroconfchange\fR
+.IP
+Spend unconfirmed change when sending transactions (default: 1)
+.HP
+\fB\-txconfirmtarget=\fR<n>
+.IP
+If paytxfee is not set, include enough fee so transactions begin
+confirmation on average within n blocks (default: 2)
+.HP
+\fB\-txexpirydelta\fR
+.IP
+Set the number of blocks after which a transaction that has not been
+mined will become invalid (min: 4, default: 20 (pre\-Blossom) or 40
+(post\-Blossom))
+.HP
+\fB\-upgradewallet\fR
+.IP
+Upgrade wallet to latest format on startup
+.HP
+\fB\-wallet=\fR<file>
+.IP
+Specify wallet file absolute path or a path relative to the data
+directory (default: wallet.dat)
+.HP
+\fB\-walletbroadcast\fR
+.IP
+Make the wallet broadcast transactions (default: 1)
+.HP
+\fB\-walletnotify=\fR<cmd>
+.IP
+Execute command when a wallet transaction changes (%s in cmd is replaced
+by TxID)
+.HP
+\fB\-zapwallettxes=\fR<mode>
+.IP
+Delete all wallet transactions and only recover those parts of the
+blockchain through \fB\-rescan\fR on startup (1 = keep tx meta data e.g.
+account owner and payment request information, 2 = drop tx meta data)
+.HP
+\fB\-walletrequirebackup=\fR<bool>
+.IP
+By default, the wallet will not allow generation of new spending keys &
+addresses from the mnemonic seed until the backup of that seed has been
+confirmed with the `zcashd\-wallet\-tool` utility. A user may start zcashd
+with `\-walletrequirebackup=false` to allow generation of spending keys
+even if the backup has not yet been confirmed.
+.PP
+ZeroMQ notification options:
+.HP
+\fB\-zmqpubhashblock=\fR<address>
+.IP
+Enable publish hash block in <address>
+.HP
+\fB\-zmqpubhashtx=\fR<address>
+.IP
+Enable publish hash transaction in <address>
+.HP
+\fB\-zmqpubrawblock=\fR<address>
+.IP
+Enable publish raw block in <address>
+.HP
+\fB\-zmqpubrawtx=\fR<address>
+.IP
+Enable publish raw transaction in <address>
+.PP
+Monitoring options:
+.HP
+\fB\-metricsallowip=\fR<ip>
+.IP
+Allow metrics connections from specified source. Valid for <ip> are a
+single IP (e.g. 1.2.3.4), a network/netmask (e.g. 1.2.3.4/255.255.255.0)
+or a network/CIDR (e.g. 1.2.3.4/24). This option can be specified
+multiple times. (default: only localhost)
+.HP
+\fB\-metricsbind=\fR<addr>
+.IP
+Bind to given address to listen for metrics connections. (default: bind
+to all interfaces)
+.HP
+\fB\-prometheusport=\fR<port>
+.IP
+Expose node metrics in the Prometheus exposition format. An HTTP
+listener will be started on <port>, which responds to GET requests on
+any request path. Use \fB\-metricsallowip\fR and \fB\-metricsbind\fR to control
+access.
+.PP
+Debugging/Testing options:
+.HP
+\fB\-debug=\fR<category>
+.IP
+Output debugging information (default: 0, supplying <category> is
+optional). If <category> is not supplied or if <category> = 1, output
+all debugging information. <category> can be: addrman, alert, bench,
+coindb, db, estimatefee, http, libevent, lock, mempool, mempoolrej, net,
+partitioncheck, pow, proxy, prune, rand, receiveunsafe, reindex, rpc,
+selectcoins, tor, zmq, zrpc, zrpcunsafe (implies zrpc). For multiple
+specific categories use \fB\-debug=\fR<category> multiple times.
+.HP
+\fB\-experimentalfeatures\fR
+.IP
+Enable use of experimental features
+.HP
+\fB\-help\-debug\fR
+.IP
+Show all debugging options (usage: \fB\-\-help\fR \fB\-help\-debug\fR)
+.HP
+\fB\-logips\fR
+.IP
+Include IP addresses in debug output (default: 0)
+.HP
+\fB\-logtimestamps\fR
+.IP
+Prepend debug output with timestamp (default: 1)
+.HP
+\fB\-minrelaytxfee=\fR<amt>
+.IP
+Fees (in ZEC/kB) smaller than this are considered zero fee for relaying,
+mining and transaction creation (default: 0.000001)
+.HP
+\fB\-maxtxfee=\fR<amt>
+.IP
+Maximum total fees (in ZEC) to use in a single wallet transaction or raw
+transaction; setting this too low may abort large transactions (default:
+0.10)
+.HP
+\fB\-printtoconsole\fR
+.IP
+Send trace/debug info to console instead of debug.log file
+.PP
+Chain selection options:
+.HP
+\fB\-testnet\fR
+.IP
+Use the test chain
+.PP
+Node relay options:
+.HP
+\fB\-datacarrier\fR
+.IP
+Relay and mine data carrier transactions (default: 1)
+.HP
+\fB\-datacarriersize\fR
+.IP
+Maximum size of data in data carrier transactions we relay and mine
+(default: 83)
+.PP
+Block creation options:
+.HP
+\fB\-blockminsize=\fR<n>
+.IP
+Set minimum block size in bytes (default: 0)
+.HP
+\fB\-blockmaxsize=\fR<n>
+.IP
+Set maximum block size in bytes (default: 2000000)
+.HP
+\fB\-blockprioritysize=\fR<n>
+.IP
+Set maximum size of high\-priority/low\-fee transactions in bytes
+(default: 1000000)
+.PP
+Mining options:
+.HP
+\fB\-gen\fR
+.IP
+Generate coins (default: 0)
+.HP
+\fB\-genproclimit=\fR<n>
+.IP
+Set the number of threads for coin generation if enabled (\fB\-1\fR = all
+cores, default: 1)
+.HP
+\fB\-equihashsolver=\fR<name>
+.IP
+Specify the Equihash solver to be used if enabled (default: "default")
+.HP
+\fB\-mineraddress=\fR<addr>
+.IP
+Send mined coins to a specific single address
+.HP
+\fB\-minetolocalwallet\fR
+.IP
+Require that mined blocks use a coinbase address in the local wallet
+(default: 1)
+.PP
+RPC server options:
+.HP
+\fB\-server\fR
+.IP
+Accept command line and JSON\-RPC commands
+.HP
+\fB\-rest\fR
+.IP
+Accept public REST requests (default: 0)
+.HP
+\fB\-rpcbind=\fR<addr>
+.IP
+Bind to given address to listen for JSON\-RPC connections. Use
+[host]:port notation for IPv6. This option can be specified multiple
+times (default: bind to all interfaces)
+.HP
+\fB\-rpcuser=\fR<user>
+.IP
+Username for JSON\-RPC connections
+.HP
+\fB\-rpcpassword=\fR<pw>
+.IP
+Password for JSON\-RPC connections
+.HP
+\fB\-rpcauth=\fR<userpw>
+.IP
+Username and hashed password for JSON\-RPC connections. The field
+<userpw> comes in the format: <USERNAME>:<SALT>$<HASH>. A canonical
+python script is included in share/rpcuser. This option can be specified
+multiple times
+.HP
+\fB\-rpcport=\fR<port>
+.IP
+Listen for JSON\-RPC connections on <port> (default: 8232 or testnet:
+18232)
+.HP
+\fB\-rpcallowip=\fR<ip>
+.IP
+Allow JSON\-RPC connections from specified source. Valid for <ip> are a
+single IP (e.g. 1.2.3.4), a network/netmask (e.g. 1.2.3.4/255.255.255.0)
+or a network/CIDR (e.g. 1.2.3.4/24). This option can be specified
+multiple times
+.HP
+\fB\-rpcthreads=\fR<n>
+.IP
+Set the number of threads to service RPC calls (default: 4)
+.PP
+Metrics Options (only if \fB\-daemon\fR and \fB\-printtoconsole\fR are not set):
+.HP
+\fB\-showmetrics\fR
+.IP
+Show metrics on stdout (default: 1 if running in a console, 0 otherwise)
+.HP
+\fB\-metricsui\fR
+.IP
+Set to 1 for a persistent metrics screen, 0 for sequential metrics
+output (default: 1 if running in a console, 0 otherwise)
+.HP
+\fB\-metricsrefreshtime\fR
+.IP
+Number of seconds between metrics refreshes (default: 1 if running in a
+console, 600 otherwise)
+.SH COPYRIGHT
+
+In order to ensure you are adequately protecting your privacy when using Zcash,
+please see <https://z.cash/support/security/>.
+
+Copyright (C) 2009-2022 The Bitcoin Core Developers
+Copyright (C) 2015-2022 The Zcash Developers
+
+This is experimental software.
+
+Distributed under the MIT software license, see the accompanying file COPYING
+or <https://www.opensource.org/licenses/mit-license.php>.
diff --git a/depend/zcash/doc/payment-api.md b/depend/zcash/doc/payment-api.md
new file mode 100644
index 000000000..786fb6f3c
--- /dev/null
+++ b/depend/zcash/doc/payment-api.md
@@ -0,0 +1,5 @@
+# Zcash Payment API
+
+This document has been relocated to https://zcash.readthedocs.io/en/latest/rtd_pages/payment_api.html
+
+The source for this document is available at https://gitlab.com/zcash-docs/zcash-docs/blob/master/source/rtd_pages/payment_api.rst
\ No newline at end of file
diff --git a/depend/zcash/doc/payment-disclosure.md b/depend/zcash/doc/payment-disclosure.md
new file mode 100644
index 000000000..d0aa68a96
--- /dev/null
+++ b/depend/zcash/doc/payment-disclosure.md
@@ -0,0 +1,107 @@
+# Payment Disclosure (Experimental Feature)
+
+**Summary**
+
+Use RPC calls `z_getpaymentdisclosure` and `z_validatepaymentdisclosure` to reveal details of a shielded payment.
+
+**Who should read this document**
+
+Frequent users of shielded transactions, payment processors, exchanges, block explorer
+
+### Experimental Feature
+
+This is an experimental feature.  Enable it by launching `zcashd` with flags:
+
+    zcashd -experimentalfeatures -paymentdisclosure -debug=paymentdisclosure -txindex=1
+
+These flags can also be set as options in `zcash.conf`.
+
+All nodes that generate or validate payment disclosures must run with `txindex=1` enabled.
+
+### Background
+
+Payment Disclosure is an implementation of the work-in-progress Payment Disclosure ZIP [1].
+
+The ZIP describes a method of proving that a payment was sent to a shielded address. In the typical case, this means enabling a sender to present a proof that they transferred funds to a recipient's shielded address. 
+
+[1] https://github.com/zcash/zips/pull/119
+
+### Example Use Case
+
+Alice the customer sends 10 ZEC to Bob the merchant at the shielded address shown on their website.  However, Bob is not sure if he received the funds.
+
+Alice's node is running with payment disclosure enabled, so Alice generates a payment disclosure and provides it to Bob, who verifies the payment was made.
+
+If Bob is a bad merchant, Alice can present the payment disclosure to a third party to validate that payment was indeed made.
+
+### Solution
+
+A payment disclosure can be generated for any output of a JoinSplit using the RPC call:
+
+    z_getpaymentdisclosure txid js_index output_index (message)
+
+An optional message can be supplied.  This could be used for a refund address or some other reference, as currently it is not common practice to (ahead of time) include a refund address in the memo field when making a payment.
+
+To validate a payment disclosure, the following RPC call can be used:
+
+    z_validatepaymentdisclosure hexdata
+
+### Example
+
+Generate a payment disclosure for the first joinsplit, second output (index starts from zero):
+
+    zcash-cli z_getpaymentdisclosure 79189528d611e811a1c7bb0358dd31343033d14b4c1e998d7c4799c40f8b652b 0 1 "Hello"
+    
+This returns a payment disclosure in the form of a hex string:
+
+    706462ff000a3722aafa8190cdf9710bfad6da2af6d3a74262c1fc96ad47df814b0cd5641c2b658b0fc499477c8d991e4c4bd133303431dd5803bbc7a111e811d6289518790000000000000000017e861adb829d8cb1cbcf6330b8c2e25fb0d08041a67a857815a136f0227f8a5342bce5b3c0d894e2983000eb594702d3c1580817d0374e15078528e56bb6f80c0548656c6c6f59a7085395c9e706d82afe3157c54ad4ae5bf144fcc774a8d9c921c58471402019c156ec5641e2173c4fb6467df5f28530dc4636fa71f4d0e48fc5c560fac500
+
+To validate the payment disclosure:
+
+    zcash-cli z_validatepaymentdisclosure HEXDATA
+    
+This returns data related to the payment and the payment disclosure:
+
+    {
+      "txid": "79189528d611e811a1c7bb0358dd31343033d14b4c1e998d7c4799c40f8b652b",
+      "jsIndex": 0,
+      "outputIndex": 1,
+      "version": 0,
+      "onetimePrivKey": "1c64d50c4b81df47ad96fcc16242a7d3f62adad6fa0b71f9cd9081faaa22370a",
+      "message": "Hello",
+      "joinSplitPubKey": "d1c465d16166b602992479acfac18e87dc18065f6cefde6a002e70bc371b9faf",
+      "signatureVerified": true,
+      "paymentAddress": "ztaZJXy8iX8nrk2ytXKDBoTWqPkhQcj6E2ifARnD3wfkFwsxXs5SoX7NGmrjkzSiSKn8VtLHTJae48vX5NakvmDhtGNY5eb",
+      "memo": "f600000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+      "value": 12.49900000,
+      "commitmentMatch": true,
+      "valid": true
+    }
+
+The `signatureVerified` field confirms that the payment disclosure was generated and signed with the joinSplitPrivKey, which should only be known by the node generating and sending the transaction 7918...652b in question.
+
+### Where is the data stored?
+
+For all nodes, payment disclosure does not touch `wallet.dat` in any way.
+
+For nodes that only validate payment disclosures, no data is stored locally.
+
+For nodes that generate payment disclosures, a LevelDB database is created in the node's datadir.  For most users, this would be in the folder:
+
+    $HOME/.zcash/paymentdisclosure
+    
+If you decide you don't want to use payment disclosure, it is safe to shut down your node and delete the database folder.
+
+### Security Properties
+
+Please consult the work-in-progress ZIP for details about the protocol, security properties and caveats.
+
+### Reminder
+
+Feedback is most welcome!
+
+This is an experimental feature so there are no guarantees that the protocol, database format, RPC interface etc. will remain the same in the future.
+
+### Notes
+
+Currently there is no user friendly way to help senders identify which joinsplit output index maps to a given payment they made.  It is possible to construct this from `debug.log`.  Ideas and feedback are most welcome on how to improve the user experience.
diff --git a/depend/zcash/doc/reduce-traffic.md b/depend/zcash/doc/reduce-traffic.md
new file mode 100644
index 000000000..e5ccd8ca2
--- /dev/null
+++ b/depend/zcash/doc/reduce-traffic.md
@@ -0,0 +1,55 @@
+Reduce Traffic
+==============
+
+Some node operators need to deal with bandwidth caps imposed by their ISPs.
+
+By default, bitcoin-core allows up to 125 connections to different peers, 8 of
+which are outbound. You can therefore, have at most 117 inbound connections.
+
+The default settings can result in relatively significant traffic consumption.
+
+Ways to reduce traffic:
+
+## 1. Use `-maxuploadtarget=<MiB per day>`
+
+A major component of the traffic is caused by serving historic blocks to other nodes
+during the initial blocks download phase (syncing up a new node).
+This option can be specified in MiB per day and is turned off by default.
+This is *not* a hard limit; only a threshold to minimize the outbound
+traffic. When the limit is about to be reached, the uploaded data is cut by no
+longer serving historic blocks (blocks older than one week).
+Keep in mind that new nodes require other nodes that are willing to serve
+historic blocks. **The recommended minimum is 1152 blocks per day (max. 2304MB
+per day)**
+
+Whitelisted peers will never be disconnected, although their traffic counts for
+calculating the target.
+
+## 2. Disable "listening" (`-listen=0`)
+
+Disabling listening will result in fewer nodes connected (remember the maximum of 8
+outbound peers). Fewer nodes will result in less traffic usage as you are relaying
+blocks and transactions to fewer nodes.
+
+## 3. Reduce maximum connections (`-maxconnections=<num>`)
+
+Reducing the maximum connected nodes to a minimum could be desirable if traffic
+limits are tiny. Keep in mind that bitcoin's trustless model works best if you are
+connected to a handful of nodes.
+
+## 4. Turn off transaction relay (`-blocksonly`)
+
+Forwarding transactions to peers increases the P2P traffic. To only sync blocks
+with other peers, you can disable transaction relay.
+
+Be reminded of the effects of this setting.
+
+- Fee estimation will no longer work.
+- It sets the flag "-walletbroadcast" to be "0", only if it is currently unset.
+  Doing so disables the automatic broadcasting of transactions from the wallet. Not
+  relaying other's transactions could hurt your privacy if used while the wallet
+  is loaded or if you use the node to broadcast transactions.
+- If a peer is whitelisted and "-whitelistforcerelay" is set to "1" (which will
+  also set "whitelistrelay" to "1"), we will still receive and relay their transactions.
+- It makes block propagation slower because compact block relay can only be
+  used when transaction relay is enabled.
diff --git a/depend/zcash/doc/reducing-memory-usage.md b/depend/zcash/doc/reducing-memory-usage.md
new file mode 100644
index 000000000..333ea0086
--- /dev/null
+++ b/depend/zcash/doc/reducing-memory-usage.md
@@ -0,0 +1,8 @@
+In-memory caches
+----------------
+
+The size of some in-memory caches can be reduced. As caches trade off memory usage for performance, usually reducing these have a negative effect on performance.
+
+- `-dbcache=<n>` - the UTXO database cache size, this defaults to `450` (`100` before 1.0.15). The unit is MiB (where 1 GiB = 1024 MiB).
+  - The minimum value for `-dbcache` is 4.
+  - A lower dbcache make initial sync time much longer. After the initial sync, the effect is less pronounced for most use-cases, unless fast validation of blocks is important such as for mining.
diff --git a/depend/zcash/doc/release-notes.md b/depend/zcash/doc/release-notes.md
new file mode 100644
index 000000000..a29094b51
--- /dev/null
+++ b/depend/zcash/doc/release-notes.md
@@ -0,0 +1,6 @@
+(note: this is a temporary file, to be added-to by anybody, and moved to
+release-notes at release time)
+
+Notable changes
+===============
+
diff --git a/depend/zcash/doc/release-notes/release-notes-0.11.2.z2.md b/depend/zcash/doc/release-notes/release-notes-0.11.2.z2.md
new file mode 100644
index 000000000..107a86c7a
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-0.11.2.z2.md
@@ -0,0 +1,35 @@
+Daira Hopwood (2):
+      Add Code of Conduct. fixes #802
+      Specify Sean as the second contact for conduct issues.
+
+Jack Grigg (6):
+      Implement validator and basic solver for Equihash
+      Add test vectors for Equihash
+      Use Equihash for Proof-of-Work
+      Adjust genesis blocks to have valid solutions and hashes
+      Fix tests that depend on old block header format
+      Fix pow_tests to work with Equihash
+
+Nathan Wilcox (4):
+      Log all failing rpc tests concisely.
+      Apply a patch from Sean to update wallet to use our new founders-reward aware balances.
+      Fix (most) rpc tests by updating balances. zcpour, zcpourdoublespend, and txn_doublespend currently fail.
+      Update a bunch of docs by adding a banner, delete a bunch of known bitrot docs; does not update release-process.md.
+
+Sean Bowe (5):
+      Fix miner_tests to work with equihash
+      Add missing synchronization that causes race condition in test.
+      Implementation of Founders' Reward.
+      Fix remaining RPC tests.
+      Change pchMessageStart for new testnet.
+
+Taylor Hornby (8):
+      Add automated performance measurement system.
+      Add equihash solving benchmarks
+      Add JoinSplit verification benchmarks
+      Add verify equihash benchmark
+      Don't leave massif.out lying around after the benchmarks
+      Use a separate datadir for the benchmarks
+      Make benchmark specified by command-line arguments
+      Benchmark a random equihash input.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-0.11.2.z3.md b/depend/zcash/doc/release-notes/release-notes-0.11.2.z3.md
new file mode 100644
index 000000000..656c0df7d
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-0.11.2.z3.md
@@ -0,0 +1,69 @@
+Daira Hopwood (1):
+      zkSNARK: Add constraint that the total value in a JoinSplit is a 64-bit integer.
+
+Nathan Wilcox (4):
+      Add a depends description for googletest.
+      Add a zcash-gtest binary to our build with a single tautological test.
+      Add coverage support scoped to only the zcash-gtest run; invoke with make zcash-cov; make cov is a superset.
+      Add googlemock 1.7.0 dependency.
+
+Sean Bowe (49):
+      Add serialization for primitive boost::optional<T>.
+      New implementation of incremental merkle tree
+      Integrate new incremental merkle tree implementation into consensus.
+      Test old tree along with new tree as much as possible.
+      Deprecate the old tree and remove old tree tests from the test suite.
+      Initialize curve/field parameters in case another test hasn't done so.
+      Improve well-formedness checks and add additional serialization/deserialization tests.
+      Add more well-formedness checks/tests to tree.
+      Make appending algorithm more succinct.
+      Move incremental merkle tree tests to zcash-gtest.
+      NoteEncryption implementation and integration, removal of ECIES and crypto++ dependencies.
+      Move NoteEncryption tests to gtest suite.
+      Add additional tests for ephemeral key behavior.
+      Clarify the usage of decryption API.
+      Check exception has specific string message.
+      Small nit fixes
+      Run `zcash-gtest` in `make check` and fix performance tests.
+      Perform zerocash tests as part of full-test-suite, in preparation for removal of zerocash waterfall.
+      Distinguish the failure cases of wfcheck in tree.
+      Change ciphertext length to match protocol spec, and refactor the use of constants.
+      Initialize libsodium in the gtest suite.
+      Introduce new `libzcash` Zcash protocol API and crypto constructions surrounding the zkSNARK circuit.
+      zkSNARK: Foundations of circuit design and verification logic.
+      zkSNARK: Add "zero" constant variable.
+      zkSNARK: Enforce spend-authority of input notes.
+      zkSNARK: Enforce disclosure of input note nullifiers
+      zkSNARK: Authenticate h_sig with a_sk
+      zkSNARK: Enforce that new output notes have unique `rho` to prevent faerie gold attack.
+      zkSNARK: Enforce disclosure of commitments to output notes.
+      zkSNARK: Ensure that values balance correctly.
+      zkSNARK: Witness commitments to input notes.
+      zkSNARK: Enforce merkle authentication path from nonzero-valued public inputs to root.
+      libzcash: Add tests for API
+      Remove scriptPubKey/scriptSig from CPourTx, and add randomSeed.
+      Transplant of libzcash.
+      Added public zkSNARK parameter generation utility.
+      Stop testing old tree against new tree.
+      Remove nearly all of libzerocash.
+      Update public zkSNARK parameters for new circuit.
+      Fix performance measurements due to modified transaction structure.
+      Remove the zerocash tests from the full test suite.
+      Protect-style joinsplits should anchor to the latest root for now, until #604 is resolved.
+      Use inheritance for PRF gadgets.
+      Rename ZCASH_ constants to ZC_.
+      Rename hmac -> mac in circuit.
+      `Note` values should be little-endian byte order.
+      Update zkSNARK proving/verifying keys.
+      Add h_sig test vectors.
+      Change testnet network magics.
+
+Taylor Hornby (7):
+      Add check that vpubs are not both nonzero and test it.
+      Fix sighash tests
+      Add empty merkle/noteencryption tests so Sean can rebase.
+      Fix RPC tests
+      Rename bitcoin.conf and bitcoind.pid to zcash.conf and zcashd.pid in qa/ and src/
+      Trivial change: Capitalize the Z in Zerocash
+      Remove the Merkle tree hash function's fixed point.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-0.11.2.z4.md b/depend/zcash/doc/release-notes/release-notes-0.11.2.z4.md
new file mode 100644
index 000000000..cbdbafc26
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-0.11.2.z4.md
@@ -0,0 +1,70 @@
+Alex (1):
+      add sha256sum support for Mac OS X
+
+Alfie John (1):
+      Rename libzerocash to libzcash
+
+Jack Grigg (21):
+      Implement mining slow start with a linear ramp
+      Update subsidy tests to account for mining slow start
+      Update miner tests to account for mining slow start
+      Disable mining slow start in regtest mode
+      Fix failing miner test
+      Add Zcash revision to version strings
+      Bitcoin -> Zcash in version and help text
+      Add Zcash Developers to CLI copyright notice
+      Minor error message tweak
+      Refactor StepRow to make optimisation easier
+      Cleanups
+      Implement index-truncation Equihash optimisation
+      Store truncated indices in the same char* as the hash (H/T tromp for the idea!)
+      Use template parameters to statically initialise Equihash
+      Merge *StepRow XOR and trimming operations
+      Use comparator object for sorting StepRows
+      Store full indices in the same char* as the hash
+      Use fixed-width array for storing hash and indices
+      Use optimised Equihash solver for miner and benchmarks
+      Fix comment
+      Fix nits after review
+
+Nathan Wilcox (1):
+      Fix a test name bug so that ``make cov-zcash`` correctly runs the ``zcash-gtest`` binary. Fixes #946.
+
+Sean Bowe (14):
+      Refactor PRF_gadget to hand responsibility to PRF_addr_a_pk_gadget for creating the '0' argument to the PRF.
+      Enforce first four bits are zero for all spending keys and phi.
+      Enable binary serializations of proofs and r1cs keys, and make the `CPourTx` proof field fixed-size.
+      Reorder fields of CPourTx to reflect the spec.
+      Update proving key and tests that depend on transaction structure changes
+      Enable MULTICORE proving behavior with omp.
+      Pass `-fopenmp` at compile-time to enable MULTICORE.
+      Switch to Ed25519 for cryptographic binding of joinsplits to transactions.
+      Enforce that the `S` value of the ed25519 signature is smaller than the group order to prevent malleability attacks.
+      Use joinsplit_sig_t in more places.
+      Wrap lines in *CTransaction constructors.
+      Change error for invalid joinsplit signature for consistency.
+      Add additional assertions.
+      Update performance measurement transaction.
+
+Simon (2):
+      Remove Bitcoin testnet seeds.
+      Remove Bitcoin mainnet seeds.
+
+Taylor Hornby (16):
+      Fix build warnings in sighash tests.
+      Fix FORTIFY_SOURCE build errors.
+      Use HARDENED_CPPFLAGS in the Makefile consistently.
+      Use left shift instead of floating-point pow() in equihash.
+      Ignore deprecated declaration warnings.
+      Remove unused code in libzerocash util.cpp
+      Turn on -Werror for the Zcash build.
+      Patch libsnark to build with my compiler. Upstream PR #35.
+      Hide new Boost warnings on GCC 6.
+      Add ability to run things under valgrind.
+      Pass -DPURIFY to OpenSSL so it doesn't clutter valgrind output.
+      Enable -v for valgrind so we can see counts for each error.
+      Sign JoinSplit transactions
+      We don't want to benchmark signature creation / verification.
+      Implement signature verification in CheckTransaction
+      Fix tests for JoinSplit signatures
+
diff --git a/depend/zcash/doc/release-notes/release-notes-0.11.2.z5.md b/depend/zcash/doc/release-notes/release-notes-0.11.2.z5.md
new file mode 100644
index 000000000..5c86083ff
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-0.11.2.z5.md
@@ -0,0 +1,78 @@
+Ethan Heilman (1):
+      Increase test coverage for addrman and addrinfo
+
+EthanHeilman (1):
+      Creates unittests for addrman, makes addrman testable. Adds several unittests for addrman to verify it works as expected. Makes small modifications to addrman to allow deterministic and targeted tests.
+
+Jack Grigg (24):
+      Use depth-first scan for eliminating partial solutions instead of breadth-first
+      Add a 256-bit reserved field to the block header
+      Set -relaypriority default to false
+      Regenerate genesis blocks
+      Update tests to account for reserved field
+      Update RPC tests to account for reserved field
+      Decrease block interval to 2.5 minutes
+      Update tests to account for decreased block interval
+      Update RPC tests to account for decreased block interval
+      Updated a hard-coded number of blocks to account for decreased block interval
+      Fix failing tests
+      Increase Equihash parameters to n = 96, k = 3 (about 430 MiB)
+      Update tests to account for new Equihash parameters
+      Speed up FullStepRow index comparison by leveraging big-endian byte layout
+      Use little-endian for hash personalisation and hashing indices
+      Use htole32 and htobe32 for endian conversions
+      Regenerate genesis blocks
+      Update miner tests for platform-independent Equihash
+      Tweaks after review
+      Implement new difficulty algorithm (#931)
+      Update tests for new difficulty algorithm
+      Improve comments per review
+      Handle full Zcash version string in AC_INIT
+      Fix bug in network hashrate lookup window configuration
+
+Patrick Strateman (1):
+      CAddrMan::Deserialize handle corrupt serializations better.
+
+Philip Kaufmann (1):
+      remove using namespace std from addrman.cpp
+
+Sean Bowe (28):
+      Move new coins tests to within coins_tests test suite.
+      Ensure merkle tree fixed point removal is tested against inside coins_tests.
+      Allow pours to be anchored to intermediate treestates of a transaction.
+      Test behavior of chained pour consensus rules.
+      Remove redundant constraints.
+      Change merkle tree depth to 29.
+      Update the zkSNARK parameters.
+      Add test to ensure parent treestates only can appear earlier in the transaction or in the global state, not later.
+      Minor changes to coins_tests.
+      Rename `CheckInputs` to `ContextualCheckInputs` since it relies on a global variable and assumes calling conditions.
+      Refactor contextual and noncontextual input checks.
+      Prevent coinbases from being spent to transparent outputs.
+      Disable coinbase-must-be-protected rule on regtest.
+      Ensure mempool integrity checks don't trip on chained joinsplits.
+      Enforce BIP16 and BIP30 unconditionally to all blocks.
+      Enforce remaining softfork activation rules unconditionally.
+      Ensure NonContextualCheckInputs runs before routines in ContextualCheckInputs.
+      Rename to `fCoinbaseMustBeProtected`.
+      Disable enforced coinbase protection in miner_tests.
+      Do not encode leading bytes in `PaymentAddress` serialization; this is a task for a higher-level API.
+      Use base58check to encode Zcash payment addresses, such that the first two bytes are "zc".
+      Add tests for `CZCPaymentAddress`.
+      Fix test against merkle tree root.
+      Added encoding for Zcash spending keys.
+      Guarantee first two bytes of spending key are SK
+      Make testnet addresses always start with 'tn'.
+      Add test to ensure spending keys always encode with 'SK' at beginning.
+      Testnet spending keys should start with 'TK'.
+
+Simon (5):
+      Fix issue #717 where if addrman is starved of addresses (e.g. on testnet) the Select_() function will loop endlessly trying to find an address, and therefore eat up 100% cpu time on the 'opencon' thread.
+      Declare constants for the maximum number of retries, when to sleep between retries and how long for.
+      Implement issue #997 to reduce time for test_bitcoin due to sleeps in addrman.  Related to issue #717.
+      Update to DistinctIndices function (for issue #857). Replaces pull request #974.
+      Update variable name.
+
+Taylor Hornby (1):
+      Enable -alertnotify for hard fork detection. Test it.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-0.11.2.z6.md b/depend/zcash/doc/release-notes/release-notes-0.11.2.z6.md
new file mode 100644
index 000000000..5d6054509
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-0.11.2.z6.md
@@ -0,0 +1,18 @@
+Jack Grigg (4):
+      Equihash: Only compare the first n/(k+1) bits when sorting.
+      Randomise the nonce in the block header.
+      Clear mempool before using it for benchmark test, fix parameter name.
+      Fix memory leak in large tx benchmark.
+
+Sean Bowe (5):
+      Increase block size to 2MB and update performance test.
+      Make sigop limit `20000` just as in Bitcoin, ignoring our change to the blocksize limit.
+      Remove the mainnet checkpoints.
+      Fix performance test for block verification.
+      Make `validatelargetx` test more accurate.
+
+Taylor Hornby (1):
+      Add example mock test of CheckTransaction.
+
+aniemerg (1):
+      Suppress Libsnark Debugging Info.
diff --git a/depend/zcash/doc/release-notes/release-notes-0.11.2.z7.md b/depend/zcash/doc/release-notes/release-notes-0.11.2.z7.md
new file mode 100644
index 000000000..a6a14af96
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-0.11.2.z7.md
@@ -0,0 +1,90 @@
+Daira Hopwood (2):
+      .clang-format: change standard to C++11
+      Bucket -> note.
+
+Jack Grigg (4):
+      Collect all permutations of final solutions
+      Add test case that requires the fix
+      Reinstate previous testnet adjustment behaviour
+      Hardfork to the previous testnet difficulty adjustment behaviour at block 43400
+
+Nathan Wilcox (1):
+      A script to remove "unofficial" tags from a remote, such as github.
+
+Sean Bowe (36):
+      Flush to disk more consistently by accounting memory usage of serials/anchors in cache.
+      Always check valid joinsplits during performance tests, and avoid recomputing them every time we change the circuit.
+      Remove the rest of libzerocash.
+      Update tests with cache usage computations
+      Reorder initialization routines to ensure verifying key log messages appear in debug.log.
+      Remove zerocash tests from full-test-suite.
+      Rename samplepour to samplejoinsplit
+      Update libsnark to our fork.
+      Initialize libsodium in this routine, which is now necessary because libsnark uses its PRNG.
+      Pass our constraint system to libsnark, so that it doesn't need to (de)serialize it in the proving key.
+      Rename CPourTx to JSDescription.
+      Rename vpour to vjoinsplit.
+      Rename JSDescription's `serials` to `nullifiers`.
+      Test fixes.
+      Rename GetPourValueIn to GetJoinSplitValueIn
+      Rename HavePourRequirements to HaveJoinSplitRequirements.
+      Rename GetSerial to GetNullifier.
+      Renaming SetSerial to SetNullifier.
+      Rename CSerialsMap to CNullifiersMap.
+      Rename mapSerials to mapNullifiers.
+      Rename some usage of 'pour'.
+      Rename more usage of `serial`.
+      Rename cacheSerials to cacheNullifiers and fix tests.
+      Rename CSerialsCacheEntry.
+      Change encryptedbucket1 to encryptednote1.
+      Rename pour RPC tests
+      Fix tests
+      Remove more usage of `serial`.
+      Fixes for indentation and local variable names.
+      Change `serial` to `nf` in txdb.
+      Rename `pour` in RPC tests.
+      Remove the constraint system from the alpha proving key.
+      Introduce `zcsamplejoinsplit` for creating a raw joinsplit description, and use it to construct the joinsplit for the performance tests that verify joinsplits.
+      Bump the (minimum) protocol version to avoid invoking legacy behavior from upstream.
+      Remove more from libsnark, and fix potential remote-DoS.
+      Add test for non-intuitive merkle tree gadget witnessing behavior.
+
+bitcartel (15):
+      Disable USE_ASM when building libsnark (issue 932).
+      Add getblocksubsidy RPC command to return the block reward for a given block, taking into account the mining slow start.
+      Replace index with height in help message for getblocksubsidy RPC call.
+      Narrow scope of lock.
+      Add founders reward to output.
+      Use new public/private key pairs for alert system.
+      Add sendalert.cpp to repo.
+      Fixes to integrate sendalert.cpp. Add sendalert.cpp to build process. Add alertkeys.h as a placeholder for private keys.
+      Disable QT alert message.
+      Update comments.
+      Update alert ID start value and URL in comment.
+      Update alert protocol version comment.
+      Update URL for zcash alert IDs.
+      Remove QT alert message box.
+      New alert test data generated for new alert key pair. Added test fixture to create new test data. Added instructions for developer.
+      Update tor.md for Zcash
+
+Taylor Hornby (17):
+      WIP: Add mock test coverage of CheckTransaction
+      Split JoinSplit proof verification out of CheckTransaction.
+      More testing of CheckTransaction
+      Test non-canonical ed25519 signature check
+      Rename zerocash to zcash in some places.
+      Remove references to libzerocash in .gitignore
+      Rename qa/zerocash to qa/zcash in Makefile.am
+      Rename zerocash_packages to zcash_packages in packages.mk
+      Add security warnings doc with warning about side channels.
+      Add another security warning
+      Add the results of #784 to security warnings.
+      Fix bad_txns_oversize test for increased block size.
+      Note that the actual secret spending key may be leaked.
+      Mention physical access / close proximity
+      Remove in-band error signalling from SignatureHash, fixing the SIGHASH_SINGLE bug.
+      Fix the tests that the SIGHASH_SINGLE bugfix breaks.
+      Remove insecurely-downloaded dependencies that we don't currently use.
+
+aniemerg (1):
+      Update GetDifficulty() to use consensus.powLimit from consensus parameters. Fixes #1032.
diff --git a/depend/zcash/doc/release-notes/release-notes-0.11.2.z8.md b/depend/zcash/doc/release-notes/release-notes-0.11.2.z8.md
new file mode 100644
index 000000000..073d771f1
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-0.11.2.z8.md
@@ -0,0 +1,61 @@
+Daira Hopwood (1):
+      README.md: simplify the title, drop "Core"
+
+Jack Grigg (23):
+      Make Equihash solvers cancellable
+      Add tests that exercise the cancellation code branches
+      Fix segfault by indirectly monitoring chainActive.Tip(), locking on mutex
+      Move initialisations to simplify cancelled checks
+      Use std::shared_ptr to deallocate partialSolns automatically
+      Equihash: Pass each obtained solution to a callback for immediate checking
+      Remove hardfork from special testnet difficulty rules
+      Fix bug in 'generate' RPC method that caused it to fail with high probability
+      Add thread parameter to solveequihash benchmark
+      Eliminate some of the duplicates caused by truncating indices
+      Use fixed-size array in IsProbablyDuplicate to avoid stack protector warning
+      Eliminate probably duplicates in final round
+      Simplify IsProbablyDuplicate()
+      Add missing assert
+      Simplify optional parameters
+      Fix previous commit
+      Remove the assumption that n/(k+1) is a multiple of 8.
+      Add Equihash support for n = 200, k = 9
+      Add test showing bug in IsProbablyDuplicate()
+      Fix bug in IsProbablyDuplicate()
+      Change Equihash parameters to n = 200, k = 9 (about 563-700 MiB)
+      Update tests to account for new Equihash parameters
+      Ignore duplicate entries after partial recreation
+
+Simon (21):
+      Inform user that zcraw... rpc calls are being deprecated.
+      Add GetTxid() which returns a non-malleable txid.
+      Update genesis blocks.
+      Update precomputed equihash solutions used in test.
+      Update block and tx data used in bloom filter tests.
+      Updated test data for script_tests by uncommenting UPDATE_JSON_TESTS flag.
+      Rename GetHash() method to GetSerializeHash().
+      Replace calls to GetHash() with GetTxid() for transaction objects.
+      Set nLockTime in CreateNewBlock() so coinbase txs do not have the same txid. Update test data in miner_tests.
+      Refactor GetTxid() into UpdateTxid() to match coding style of hash member variable.
+      Revert "Set nLockTime in CreateNewBlock() so coinbase txs do not have the same txid."
+      Fix issue where a coinbase tx should have it's sigscript hashed to avoid duplicate txids, as discussed in BIP34 and BIP30.
+      Update genesis block hashes and test data.
+      Make txid const.
+      Update deprecation message for zcraw api.
+      Fix comment.
+      Update comment.
+      Extend try catch block around calls to libsnark, per discussion in #1126.
+      Remove GetSerializeHash() method.
+      Use -O1 opimitization flag when building libzcash. Continuation of #1064 and related to #1168.
+      Add test for non-malleable txids.  To run just this test: ./zcash-gtest --gtest_filter="txid_tests*"
+
+Taylor Hornby (8):
+      Make the --enable-hardening flag explicit.
+      Enable -O1 for better FORTIFY_SOURCE protections.
+      Add checksec.sh from http://www.trapkit.de/tools/checksec.html
+      Add tests for security hardening features
+      Pull in upstream's make check-security, based on upstream PR #6854 and #7424.
+      Make security options in configure.ac fail if unavailable.
+      Put hardened stuff in libzcash CPPFLAGS.
+      Add more commands to run unit tests under valgrind.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-0.11.2.z9.md b/depend/zcash/doc/release-notes/release-notes-0.11.2.z9.md
new file mode 100644
index 000000000..3c45b9d9a
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-0.11.2.z9.md
@@ -0,0 +1,55 @@
+Sean Bowe (6):
+      Change memo field size and relocate `ciphertexts` field of JoinSplit description.
+      Implement zkSNARK compression.
+      Perform curve parameter initialization at start of gtest suite.
+      Update libsnark dependency.
+      Enable MONTGOMERY_OUTPUT everywhere.
+      Update proving/verifying keys.
+
+Jack Grigg (11):
+      Add support for spending keys to the basic key store.
+      Merge AddSpendingKeyPaymentAddress into AddSpendingKey to simplify API.
+      Add methods for byte array expansion and compression.
+      Update Equihash hash generation to match the Zcash spec.
+      Extend byte array expansion and compression methods with optional padding.
+      Store the Equihash solution in minimal representation in the block header.
+      Enable branch coverage in coverage reports.
+      Add gtest coverage and intermediates to files deleted by "make clean".
+      Remove non-libsnark dependencies and test harness code from coverage reports.
+      Add separate lock for SpendingKey key store operations.
+      Test conversion between solution indices and minimal representation.
+
+Daira Hopwood (6):
+      Move bigint arithmetic implementations to libsnark.
+      Add mostly-static checks on consistency of Equihash parameters, MAX_HEADERS_RESULTS, and MAX_PROTOCOL_MESSAGE_LENGTH.
+      Change some asserts in equihash.cpp to be static.
+      Decrease MAX_HEADERS_RESULTS to 160. fixes #1289
+      Increment version numbers for z9 release.
+      Add these release notes for z9.
+
+Taylor Hornby (5):
+      Disable hardening when building for coverage reports.
+      Upgrade libsodium for AVX2-detection bugfix.
+      Fix inconsistent optimization flags; single source of truth.
+      Add -fwrapv -fno-strict-aliasing; fix libzcash flags.
+      Use libsodium's s < L check, instead checking that libsodium checks that.
+
+Simon Liu (3):
+      Fixes #1193 so that during verification benchmarking it does not unncessarily create thousands of CTransaction objects.
+      Closes #701 by adding documentation about the Payment RPC interface.
+      Add note about zkey and encrypted wallets.
+
+Gaurav Rana (1):
+      Update zcash-cli stop message.
+
+Tom Ritter (1):
+      Clarify comment about nonce space for Note Encryption.
+
+Robert C. Seacord (1):
+      Memory safety and correctness fixes found in NCC audit.
+
+Patrick Strateman (1):
+      Pull in some DoS mitigations from upstream. (#1258)
+
+Wladimir J. van der Laan (1):
+      net: correctly initialize nMinPingUsecTime.
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.0-beta1.md b/depend/zcash/doc/release-notes/release-notes-1.0.0-beta1.md
new file mode 100644
index 000000000..8c28b92aa
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.0-beta1.md
@@ -0,0 +1,159 @@
+Daira Hopwood (1):
+      Update steps after D
+
+Jack Grigg (43):
+      Undo debugging change from 5be6abbf84c46e8fc4c8ef9be987a44de22d0d05
+      Output Equihash solution in RPC results as a hex string
+      Add optional bool to disable computation of proof in JSDescription constructor
+      Add wallet method for finding spendable notes in a CTransaction
+      Store mapping between notes and PaymentAddresses in CWalletTx
+      Keep track of spent notes, and detect and report conflicts
+      Create mapping from nullifiers to received notes
+      Add caching of incremental witnesses for spendable notes
+      Update cached incremental witnesses when the active block chain tip changes
+      Test solution output of blockToJSON()
+      Pass ZCIncrementalMerkleTree to wallet to prevent race conditions
+      Remove GetNoteDecryptors(), lock inside FindMyNotes() instead
+      Replace vAnchorCache with a cache size counter
+      mapNullifiers -> mapNullifiersToNotes for clarity
+      Set witness cache size equal to coinbase maturity duration
+      Add transactions to wallet if we spend notes in them
+      Add test for GetNoteDecryptor()
+      Keep any existing cached witnesses when updating transactions
+      Changes after review
+      Add test showing that the witness cache isn't being serialised
+      Fix the failing test!
+      Increase coverage of GetNoteDecryptor()
+      Add coverage of the assertion inside GetNoteWitnesses()
+      Separate concepts of block difficulty and network difficulty in RPC
+      Add test comparing GetDifficulty() with GetNetworkDifficulty()
+      Remove mainnet DNS seeds, set checkpoint to genesis
+      Fix failing test
+      Adjust from average difficulty instead of previous difficulty
+      Remove testnet-only difficulty rules
+      Add comments explaining changed semantics of pow_tests
+      Expand bounds on difficulty adjustment
+      Remove accidental double-semicolon (harmless but odd)
+      Add test of difficulty averaging
+      Simplify difficulty averaging code
+      Restrict powLimit due to difficulty averaging
+      Regenerate genesis blocks for new powLimits
+      Update tests for new genesis blocks
+      Adjust test to avoid spurious failures
+      Remove unnecessary method
+      Adjust test to account for integer division precision loss
+      Refactor wallet note code for testing
+      Add tests for refactored wallet code
+      Remove .z# suffix from version
+
+Lars-Magnus Skog (1):
+      changed module name from "bitcoin" to "Zcash" in FormatException()
+
+Sean Bowe (7):
+      Deallocate the public parameters during Shutdown.
+      Update libsnark again.
+      Fix CheckTransaction bugs.
+      Remove TODO 808.
+      Fix transaction test in test_bitcoin.
+      Change version to 1.0.0. This is just a beta.
+      Update pchMessageStart and add testnet DNS boostrapper.
+
+Simon (91):
+      Implemented RPC calls z_importkey, z_exportkey, z_getnewaddress. Modified RPC calls dumpwallet and importwallet to include spending keys.
+      Add z_importwallet and z_exportwallet to handle keys for both taddr and zaddr.  Restore behaviour of dumpwallet and importwallet to only handle taddr.
+      Implemented z_listaddresses to return all the zaddr in the wallet.
+      Add gtest to cover new methods in: CWallet - GenerateNewZKey() - AddZKey() - LoadZKey() - LoadZKeyMetadata() CWalletDB - WriteZKey()
+      Don't mark wallet as dirty if key already exists. Fix incorrect method name used in error message.
+      Added wallet rpc tests to cover: z_importwallet, z_exportwallet z_importkey, z_exportkey z_listaddresses
+      Add test coverage for RPC call z_getnewaddress.
+      Fix comment.
+      Remove one line of dead code.
+      Add "zkey" to list of key types (used by the wallet to decide whether or not it can be recovered if it detects bad records).
+      Fix comments.
+      Rename methods to avoid using prefix of _ underscore which is reserved. Added logging of explicit exception rather than a catch all. Removed redundant spending key check. Updated user facing help message.
+      Fixes #1122 where json_spirit could stack overflow because there was no maximum limit set on the number of nested compound elements.
+      Throw a domain error as json_spirit is a third-party library.
+      Closes #1315.  RPC getblocksubsidy height parameter is now optional and a test has been added to verify parameter input and results.
+      Remove #1144 from transaction.h.
+      Remove #1144 from transaction.cpp by reverting back to commit 942bc46.
+      Remove #1144 from bloom_tests by reverting to commit 5012190.
+      Remove #1144 from input data of script_tests.
+      Update txid gtest to verify #1144 has been removed: GetTxid() and GetHash() return the same result.
+      Refactor: replace calls to GetTxid() with GetHash()
+      Remove GetTxid() from CTransaction and update test_txid
+      Replace GetTxid() with GetHash() after rebase on latest.
+      Add async RPC queue and operation classes. Add z_getoperationstatus RPC command. Add z_sendmany RPC command (dummy implementation, does not send actual coins).
+      Add prefix to async operation id so it is easier to manage on cli.
+      Add config option 'rpcasyncthreads' to specify number of async rpc workers. Default is 1.
+      Add public field 'memo' to JSOutput to enable creation of notes with custom memos.
+      Implement z_sendmany RPC call.
+      Update find_unspent_notes() as mapNoteAddrs_t has been replaced by mapNoteData_t.
+      z_sendmany from a taddr now routes change to a new address instead of back to the sender's taddr,
+      Successful result of z_sendmany returns txid so it doesn't need to return raw hex.
+      Add public method to get state as a human readable string from an AsyncRPCOperation.
+      Add public method to AsycnRPCQueue to retrieve all the known operation ids.
+      Implement RPC call z_listoperationids and update z_getoperationstatus to take a list parameter.
+      Refactoring and small improvements to async rpc operations.
+      Closes #1293 by adding z_getoperationresult and making z_getoperationstatus idempotent.
+      Add chaining of JoinSplits within a transaction.
+      Disable option to allow multiple async rpc workers.
+      Coinbase utxos can only be spent when sending to a single zaddr. Change from the transaction will be sent to the same zaddr.
+      Fix bug where call to sign and send a transaction was in wrong scope.
+      Added option to close a queue and wait for queued up operations to finish, rather than just closing a queue and immediately cancelling all operations.
+      Fix bug where wallet was not persisting witnesses to disk. Author: str4d
+      Refactor to use wallet note tracking from commit a72379
+      Clear the operation queue when closing it.
+      Add test for AsyncRPCQueue and AsyncRPCOperation.
+      Add shared queue to AsynRPCQueue.
+      Update RPCServer to use AsyncRPCQueue's shared queue.
+      Remove redundant check when getting spending key for a payment address.
+      Add tests for async queue and rpc commands: z_getoperationstatus, z_getoperationresult, z_listoperationids, z_sendmany
+      Remove redundant call.
+      Add logging under the category "asyncrpc".
+      Add extra checking of memo data in hexadecimal string format.
+      Add friend class for testing private members of AsyncRPCOperation_sendmany.
+      Add z_getbalance and z_gettotalbalance RPC calls to close #1201.
+      Fix typo in error message
+      Disable proof generation when testmode is enabled in async SendMany operation.
+      Reduce use of global pzcashParams with private member variable
+      Revert "Reduce use of global pzcashParams with private member variable"
+      Replace zcashParams_ with global.
+      Add tests to try and improve coverage of perform_joinsplit.
+      Add GetUnspentNotes to wallet.
+      Add test for GetUnspentNotes() in wallet.
+      Refactor async sendmany and getbalance calls to use GetUnspentNotes().
+      Add more logging.
+      Disable z_sendmany in safe mode
+      Rename GetUnspentNotes to GetFilteredNotes
+      Add z_listreceivedbyaddress RPC call
+      Add 'DEPRECATED' to help message of zcraw* commands
+      Update formatting and documentation.
+      Move lock guard to start of addOperation to protect isClosed() and isFinishing()
+      Fix formatting
+      Add lock guard to getNumberOfWorkers()
+      Replace unique_lock with lock_guard, where appropriate, for consistency
+      Add extra RPC parameter checks for minconf<0 and zaddr not belonging to wallet.
+      Add test for calling RPC z_getbalance, z_gettotalbalance, z_listreceivedbyaddress with invalid parameters.
+      Fix formatting
+      Update log statement to include fee.
+      Fix incorrect default value for argument of GetFilteredNotes.
+      Formatting and updated test per review.
+      Add lock for member variables. Clean up and clarify that id_ and creation_time_ are never to be mutated anywhere. Fix incomplete copy/assignment constructors.
+      Remove unused varible.
+      Add ticket number to issues raised in comment.
+      Add assert for two mutually exclusive member variables.
+      Improve error reporting when attempting to spend coinbase utxos.
+      Use zcash constants
+      Fix formatting
+      Add assert
+      Update comment with ticket issue number
+      Remove line of commented out code we don't need
+      Improve check that user supplied memo field is too long.
+      Replace GetTxid() with GetHash()
+      Update payment-api.md
+      Update security-warnings.md about REST interface
+      Update payment API documentation for beta 1
+
+Taylor Hornby (2):
+      Add -Wformat -Wformat-security
+      Use -Wformat in the test for -Wformat-security
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.0-beta2.md b/depend/zcash/doc/release-notes/release-notes-1.0.0-beta2.md
new file mode 100644
index 000000000..90d9286a9
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.0-beta2.md
@@ -0,0 +1,119 @@
+Alfie John (2):
+      Typo in params README
+      Updating wording to match Beta Guide
+
+Bryan Stitt (1):
+      Link to beta guide
+
+Daira Hopwood (9):
+      Benchmark 50 iterations of solveequihash
+      Remove FindAndDelete. refs #1386
+      Update my email address in the Code of Conduct.
+      Repair FormatSubVersion tests. refs #1138
+      WIP: update address prefixes. refs #812
+      Reencode keys in JSON test data. refs #812
+      CBitcoinAddress should use nVersionBytes == 2.
+      Repair bitcoin-util-test.
+      Repair rpc-tests/signrawtransactions.py.
+
+Gregory Maxwell (1):
+      Limit setAskFor and retire requested entries only when a getdata returns.
+
+Jack Grigg (43):
+      Add support for encrypting spending keys
+      Check we haven't trashed the first key entry with the second
+      Move serialized Zcash address length constants into zcash/Address.hpp
+      Measure multithreaded solveequihash time per-thread
+      Add a make command for checking expected failures
+      Enable high-priority alerts to put the RPC into safe mode
+      Fix test
+      Add wallet method to clear the note witness cache
+      Clear note witness caches on reindex
+      Write note witness cache atomically to disk to avoid corruption
+      Test that invalid keys fail to unlock the keystore
+      Implement CSecureDataStream for streaming CKeyingMaterial
+      Cache note decryptors in encrypted keystore
+      Use correct lock for spending keys
+      Upgrade Boost to 1.62.0
+      Upgrade libgmp to 6.1.1
+      Upgrade OpenSSL to 1.1.0b
+      Upgrade miniupnpc to 2.0
+      Upgrade ccache to 3.3.1
+      Release process: check dependencies for updates
+      Fix auto_ptr deprecation warning in Boost
+      Replace auto_ptr with unique_ptr
+      Re-enable disabled compiler warnings
+      Disable nearly everything in OpenSSL
+      Add libsnark to pre-release dependency checks
+      Assert that new OpenSSL allocators succeed
+      Remove no-autoalginit and no-autoerrinit OpenSSL flags
+      Use asserts to check allocation errors in CECKey::Recover
+      Simplify ClearNoteWitnessCache()
+      Add tests for alerts enabling RPC safe mode
+      Ensure correctness if asserts are compiled out
+      Disable OP_CODESEPARATOR
+      Remove OP_CODESEPARATOR from tests
+      Downgrade bdb to 5.3.28
+      Use CLIENT_VERSION_BUILD to represent -beta and -rc in client version
+      Update release process with version schema
+      Formatting fix
+      Mark previously-valid test data as invalid
+      Re-encode hard-coded addresses in tests
+      Re-encode Founders' Reward keys
+      Fix secp256k1 test compilation
+      Fix zkey test
+      Update address in Founders' Reward gtest
+
+Jay Graber (4):
+      Link to z.cash on security-warnings.md
+      Add section abt confs and reorgs to security-warnings.md
+      Update wording
+      Final edits
+
+Kevin Gallagher (5):
+      Lock to prevent parallel execution of fetch-params.sh
+      Updates dns.testnet.z.cash -> dnsseed.testnet.z.cash
+      Verify TLS certificates w/ wget in fetch-params.sh
+      Inserts some notes related to testnet deployment
+      Adds note about updating guide during testnet deployment
+
+Pieter Wuille (1):
+      Fix and improve relay from whitelisted peers
+
+Robert C. Seacord (1):
+      Changes to upgrade bdb to 6.2.23
+
+Sean Bowe (1):
+      Update to `beta2` public parameters, remove `regtest`/`testnet3` parameters     subdirectories.
+
+Simon (20):
+      Replace %i format specifier with more commonly used %d.
+      Fix GetFilteredNotes to use int for minDepth like upstream and avoid casting problems. Don't use FindMyNotes as mapNoteData has already been set on wallet tx.
+      Update test to filter and find notes.
+      Add support for spending keys to the encrypted wallet.
+      Update to use new API in CCryptoKeyStore and store a viewing key in walletdb.
+      Fix comment and formatting per review
+      Add founders reward to ChainParams.     Fix bug where subsidy slow shift was ignored.
+      Founders reward: changed index computation, added new test and some refactoring.
+      Founders reward: Refactor test and formatting per review.
+      Refactor to add test to verify number of rewards each mainnet address will receive
+      Refactor and fix per review
+      Update comment per review
+      Update founders reward test to output path of temporary wallet.dat file which contains keys which can be used for testing founders reward addresses.
+      Update testnet founders reward addresses
+      Add mainnet 2-of-3 multisig addresses for testing.
+      Add field fMinerTestModeForFoundersRewardScript to chainparams
+      Update mainnet addresses used for testing to have the correct number
+      Fixes #1345 so that UTXO debit and credits are computed correctly for a transaction.
+      Closes #1371 by updating signed message
+      Modify message string so we don't need to backport commits which implement FormatStateMessage and GetDebugMessage and involve changes to consensus/validation.h
+
+Wladimir J. van der Laan (1):
+      build: remove libressl check
+
+fanquake (1):
+      [depends] OpenSSL 1.0.1k - update config_opts
+
+kazcw (1):
+      prevent peer flooding request queue for an inv
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.0-rc1.md b/depend/zcash/doc/release-notes/release-notes-1.0.0-rc1.md
new file mode 100644
index 000000000..4d9763ec7
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.0-rc1.md
@@ -0,0 +1,121 @@
+4ZEC (1):
+      Correct line swap
+
+Cory Fields (7):
+      release: add _IO_stdin_used to ignored exports
+      release: add check-symbols and check-security make targets
+      release: always link librt for glibc back-compat builds
+      release: add security/symbol checks to gitian
+      depends: allow for CONFIG_SITE to be used rather than stealing prefix
+      gitian: use CONFIG_SITE rather than hijacking the prefix
+      gitian: create debug packages for linux/windows
+
+Daira Hopwood (6):
+      Fix RPC tests to not rely on accounts.
+      Cosmetics in RPC tests.
+      Fix blank lines in DEBIAN/copyright license texts.
+      Move the increment of nWitnessCacheSize to make the later assertions correct.
+      Add another assertion to narrow down where the bug occurs.
+      Add another assertion about the witness cache.
+
+Jack Grigg (25):
+      Update release process to sign release tags
+      WriteWitnessCache: Catch errors and abort transaction
+      Throw an RPC error for all accounts except the default
+      Update tests for account deprecation
+      Deprecated -> Unsupported in RPC error
+      Correct docstring
+      Add unit tests for WriteWitnessCache
+      Document CWalletTx::FindMyNotes
+      Refactor test to clarify expectations
+      Add unit test that fails when calling FindMyNotes on a locked wallet
+      Add RPC test showing correct handling of JS txns from blockchain
+      Break the RPC test by encrypting the mirroring wallet
+      Delay caching of nullifiers when wallet is locked
+      Update comments
+      Only ignore runtime errors caused by failed note decryption
+      Remaining changes from bitcoin/bitcoin#6854
+      [gitian] Don't call "make check-symbols"
+      Fix Makefiles so "make dist" will run
+      Render full version correctly in configure.ac
+      Update libsnark to include determinism fix
+      Address review comments
+      Add more asserts to track down the bug
+      Increment witnesses for new transactions on rescan
+      Add clear error message for upgrading users
+      Set CBlockIndex.hashAnchor correctly in ConnectBlock
+
+Jay Graber (17):
+      Document wallet reindexing for z_importkey description in payment-api.md
+      Rm beta 1 release note about encrypted wallets
+      Note that Coinbase maturity interval does not protect JoinSplits
+      Refer to Zcash wiki in INSTALL
+      Rm bitcoin logo
+      Rm build-unix.md, to keep single copy of build instructions for Zcash on github wiki
+      Rm Bitcoin-specific documentation
+      Add note that document is not updated for Zcash to translation policy
+      Rm doc for disabled REST interface
+      Change alpha to beta testnet, add zcash hidden service
+      Improve documentation on connecting to zcash hidden server
+      Improve documentation on connecting to zcash hidden server
+      Update tor.md
+      Distinguish between connecting to 1 vs multiple tor nodes
+      Revert "Rm Bitcoin-specific documentation"
+      Mv btc release notes to doc/bitcoin-release-notes
+      Reword joinsplit anchor paragraph
+
+Kevin Gallagher (24):
+      Set wget retry options for fetching parameters
+      Increases timeout to 30s, wait before retry to 3s
+      Initial packaging for Debian
+      Moves zcash-fetch-params to /usr/bin
+      Adds newline between source and package definition
+      Adds copyright file back to Debian package
+      Updates Linux gitian descriptor file for Zcash
+      Updates trusty -> jessie in Gitian Linux descriptor
+      Adds distro: debian to gitian-linux.yml
+      Updates Gitian descriptor for Zcash
+      Removes Windows and OSX packaging from EXTRA_DIST
+      Moves V=1 and NO_QT=1 to MAKEOPTS
+      Include contrib/devtools/split-debug.sh from upstream
+      Adds faketime to Gitian build dependencies
+      Inlude crypto/equihash.tcc in list of sources for dist
+      Adds zcash/Zcash.h to LIBZCASH sources
+      Adds zcash/Proof.hpp to LIBZCASH_H
+      Add alertkeys.h to libbitcoin_server_a_SOURCES
+      Adds files in src/zcash/circuit to libzcash_a_SOURCES
+      Adds zcbenchmarks.h to libbitcoin_wallet_a_SOURCES
+      Adds json_test_vectors.h to zcash_gtest_SOURCES
+      Adds additional licenses to Debian copyright file
+      Updates Zcash Core developers -> Zcash developers
+      Adds . to blank lines in Google license
+
+MarcoFalke (3):
+      [gitian] Set reference date to something more recent
+      [gitian] Default reference_datetime to commit author date
+      [gitian] hardcode datetime for depends
+
+Sean Bowe (1):
+      Make 100KB transaction size limit a consensus rule, rather than a standard rule.
+
+Simon (11):
+      Add vjoinsplit to JSON output of RPC call gettransaction
+      Fixes #1478 by ensuring wallet tests have the -datadir environment set appropriately.
+      Fixes #1491 by updating help message for rpc call z_importkey
+      Fix incorrect check of number of parameters for z_getnewaddress.
+      Add tests to verify that all z_* rpc calls return an error if there are too many input parameters.
+      Rename client identifier from Satoshi to MagicBean (closes #1481)
+      Use -debug=zrpc for z_* rpc calls (#1504)
+      Document CWallet::GetFilteredNotes and fix return type which should be void.
+      Fix test so that the encrypted wallet is output to the test_bitcoin -datadir folder.
+      Reorder gtests in zcash-gtest.
+      Return improved error message when trying to spend Coinbase coins (#1373).
+
+Wladimir J. van der Laan (6):
+      devtools: add libraries for bitcoin-qt to symbol check
+      gitian: use trusty for building
+      gitian: make windows build deterministic
+      gitian: Need `ca-certificates` and `python` for LXC builds
+      build: Remove unnecessary executables from gitian release
+      gitian: Add --disable-bench to config flags for windows
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.0-rc2.md b/depend/zcash/doc/release-notes/release-notes-1.0.0-rc2.md
new file mode 100644
index 000000000..27f115a75
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.0-rc2.md
@@ -0,0 +1,106 @@
+Daira Hopwood (22):
+      Add link to protocol specification.
+      Add tests for IsStandardTx applied to v2 transactions.
+      Make v2 transactions standard. This also corrects a rule about admitting large orphan transactions into the mempool, to account for v2-specific fields.
+      Changes to build on Alpine Linux.
+      Add Tromp's implementation of Equihash solver (as of tromp/equihash commit 690fc5eff453bc0c1ec66b283395c9df87701e93).
+      Integrate Tromp solver into miner code and remove its dependency on extra BLAKE2b implementation.
+      Minor edits to dnsseed-policy.md.
+      Avoid boost::posix_time functions that have potential out-of-bounds read bugs. ref #1459
+      Add help for -equihashsolver= option.
+      Assert that the Equihash solver is a supported option.
+      Repair check-security-hardening.sh.
+      Revert "Avoid boost::posix_time functions that have potential out-of-bounds read bugs. ref #1459"
+      Fix race condition in rpc-tests/wallet_protectcoinbase.py. closes #1597
+      Fix other potential race conditions similar to ref #1597 in RPC tests.
+      Update the error message string for tx version too low. ref #1600
+      Static assertion that standard and network min tx versions are consistent.
+      Update comments in chainparams.cpp.
+      Update unit-tests documentation. closes #1530
+      Address @str4d's comments on unit-tests doc. ref #1530
+      Remove copyright entries for some files we deleted.
+      Update license text in README.md. closes #38
+      Bump version numbers to 1.0.0-rc2.
+
+David Mercer (4):
+      explicitly pass HOST and BUILD to ./configure
+      allow both HOST and BUILD to be passed in from the zcutil/build.sh
+      pass in both HOST and BUILD to depends system, needed for deterministic builds
+      explicitly pass HOST and BUILD to libgmp ./configure
+
+Gregory Maxwell (1):
+      Only send one GetAddr response per connection.
+
+Jack Grigg (31):
+      Implement MappedShuffle for tracking the permutation of an array
+      Implement static method for creating a randomized JSDescription
+      Randomize JoinSplits in z_sendmany
+      Refactor test code to better test JSDescription::Randomized()
+      Remove stale comment
+      Rename libbitcoinconsensus to libzcashconsensus
+      Rename bitcoin-tx to zcash-tx
+      Remove the RC 1 block index error message
+      Disable wallet encryption
+      Add more assertions, throw if find_output params are invalid
+      Clear witness cache when re-witnessing notes
+      Add heights to log output
+      Throw an error when encryptwallet is disabled
+      Document that wallet encryption is disabled
+      Document another wallet encryption concern
+      Improve security documentation
+      Fix RPC tests that require wallet encryption
+      Add test that encryptwallet is disabled
+      Revert "Revert "Avoid boost::posix_time functions that have potential out-of-bounds read bugs. ref #1459""
+      GBT: Support coinbasetxn instead of coinbasevalue
+      GBT: Add informational founders' reward value to coinbasetxn
+      GBT: Correct block header in proposals RPC test
+      GBT: Add RPC tests
+      Disallow v0 transactions as a consensus rule
+      Reject block versions lower than 4
+      Regenerate genesis blocks with nVersion = 4
+      Use tromp's solver to regenerate miner tests
+      Update tests for new genesis blocks
+      Enforce standard transaction rules on testnet
+      Update sighash tests for new consensus rule
+      Fix RPC test
+
+Jay Graber (7):
+      Rm bitcoin dev keys from gitian-downloader, add zcash dev keys
+      Rm bips.md
+      Update files.md for zcash
+      Update dnsseed-policy.md
+      Developer notes still relevant
+      Document RPC interface security assumptions in security-warnings.md
+      Update RPC interfaces warnings language
+
+Patrick Strateman (1):
+      CDataStream::ignore Throw exception instead of assert on negative nSize.
+
+Pieter Wuille (4):
+      Introduce constant for maximum CScript length
+      Treat overly long scriptPubKeys as unspendable
+      Fix OOM bug: UTXO entries with invalid script length
+      Add tests for CCoins deserialization
+
+Simon (17):
+      Fixes CID 1147436 uninitialized scalar field.
+      Fixes CID 1352706 uninitialized scalar field.
+      Fixes CID 1352698 uninitialized scalar field.
+      Fixes CID 1352687 uninitialized scalar field.
+      Fixes CID 1352715 uninitialized scalar field.
+      Fixes CID 1352686 uninitialized scalar variable.
+      Fixes CID 1352599 unitialized scalar variable
+      Fixes CID 1352727 uninitialized scalar variable.
+      Fixes CID 1352714 uninitialized scalar variable.
+      Add security warning about logging of z_* calls.
+      Add debug option "zrpcunsafe" to be used when logging more sensitive information such as the memo field of a note.
+      Closes #1583 by setting up the datadir for the wallet gtest.
+      Fix issue where z_sendmany is too strict and does not allow integer based amount e.g. 1 which is the same as 1.0
+      Update test to use integer amount as well as decimal amount when calling z_sendmany
+      Fix build problem with coins_tests
+      Workaround g++ 5.x bug with brace enclosed initializer.
+      Patch backport of upstream 1588 as we don't (yet) use the NetMsgType namespace
+
+Wladimir J. van der Laan (1):
+      net: Ignore `notfound` P2P messages
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.0-rc3.md b/depend/zcash/doc/release-notes/release-notes-1.0.0-rc3.md
new file mode 100644
index 000000000..863df2000
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.0-rc3.md
@@ -0,0 +1,51 @@
+Chirag Davé (1):
+      fReopenDebugLog and fRequestShutdown should be type sig_atomic_t
+
+Daira Hopwood (9):
+      Refactor README docs to avoid duplication.
+      Fix licensing to comply with OpenSSL and Berkeley DB licenses.
+      Changes to upgrade bdb to 6.2.23
+      util: Update tinyformat
+      Tweak descriptions of mining parameters for example zcash.conf.
+      Update dnsseeds for mainnet. closes #1369
+      Minor update to release process.
+      Remove the override of nMaxTipAge that effectively disables it on testnet.
+      Update version numbers for rc3.
+
+Jack Grigg (2):
+      Disable metrics screen in performance-measurements.sh
+      Link to #826 in doc/security-warnings.md, link to new Security website page
+
+Joe Turgeon (2):
+      Fixing floating point exception caused by metrics. Using default column width unless in a TTY.
+      Adding handling for ioctl failure. Updates from code review in PR #1615.
+
+Kevin Gallagher (2):
+      Prefer sha256sum but fall back to shasum if not available
+      Adds libgomp1 to Debian package depends
+
+Louis Nyffenegger (1):
+      Fix typo in README.md
+
+Paige Peterson (3):
+      add zcash.config
+      fix per Jack's mod suggestions
+      fix per Daira's suggestions
+
+Pieter Wuille (3):
+      Include signal.h for sig_atomic_t in WIN32
+      Revert "Include signal.h for sig_atomic_t in WIN32"
+      Use std::atomic for fRequestShutdown and fReopenDebugLog
+
+Sean Bowe (1):
+      Add manpages for zcashd and zcash-cli binaries for debian.
+
+Simon (4):
+      Fix incorrect error message in z_sendmany
+      Add z_sendmany rule that when sending coinbase utxos to a zaddr they must be consumed entirely, without any change, since there is currently no way to specify a change address in z_sendmany.
+      Add assert to AsyncRPCOperation_sendmany
+      Bump version number in sendalert.cpp
+
+bitcartel (1):
+      Update payment-api.md
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.0-rc4.md b/depend/zcash/doc/release-notes/release-notes-1.0.0-rc4.md
new file mode 100644
index 000000000..0a51dfb92
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.0-rc4.md
@@ -0,0 +1,14 @@
+Daira Hopwood (3):
+      Update pchMessageStart for mainnet and testnet.
+      Update version numbers for 1.0.0-rc4.
+      Add release notes for 1.0.0-rc4.
+
+Jack Grigg (4):
+      Integrate production Founders' Reward keys
+      Remove Founders' Reward override from #1398
+      Regenerate mainnet and testnet genesis blocks for nMaxTipAge change
+      Update tests for new genesis blocks
+
+Sean Bowe (1):
+      Zcash zk-SNARK public parameters for 1.0 "Sprout".
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.0.md b/depend/zcash/doc/release-notes/release-notes-1.0.0.md
new file mode 100644
index 000000000..f95d53d4e
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.0.md
@@ -0,0 +1,18 @@
+Jack Grigg (8):
+      Rework zcutil/build-debian-package.sh to place files correctly
+      Add lintian check to zcutil/build-debian-package.sh
+      Fix DEBIAN/control errors raised by lintian
+      Build libsnark with -march=x86-64 instead of -march=native
+      Disable the metrics screen on regtest
+      Add the Zcash genesis blocks
+      Update tests for new genesis blocks
+      Update version strings to 1.0.0
+
+Kevin Gallagher (6):
+      Use fakeroot to build Debian package
+      Update Debian package maintainer scripts
+      Fixes executable mode of maintainer scripts
+      Add DEBIAN/rules file (required by policy)
+      Adds zcash.examples and zcash.manpages
+      Run Lintian after built package is copied to $SRC_PATH
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.1.md b/depend/zcash/doc/release-notes/release-notes-1.0.1.md
new file mode 100644
index 000000000..8ee772bf7
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.1.md
@@ -0,0 +1,34 @@
+Cameron Boehmer (1):
+      point "where do i begin?" readme link to 1.0 guide
+
+Jack Grigg (15):
+      Track mined blocks to detect and report orphans and mining revenue
+      Refresh mining status to detect setgenerate changes
+      Add network stats to metrics screen
+      Show mining info once the node has finished loading
+      Improve locking in metrics
+      Adjust consensus rule to accept genesis block without height in coinbase
+      Fix previous commit
+      Ensure that no tracked blocks are skipped during orphan detection
+      Add build scripts and fetch-params.sh to "make install" and "make dist"
+      Use uint64_t for AtomicCounter
+      Fix gtest issue introduced into master
+      Fix whitespace in Makefile.gtest.include
+      Initialise walletdb system in a temp dir for all gtests
+      Revert "Initialise walletdb system in a temp dir for all gtests"
+      Change execution order of gtests to avoid bug
+
+Kevin Gallagher (1):
+      Improves usability of fetch-params.sh
+
+Sean Bowe (6):
+      Properly account for joinsplit value when deciding if a transaction should be placed in a mined block.
+      Add checkpoint at block 2500.
+      Throw more descriptive exceptions when the constraint system is violated.
+      Test that a pure joinsplit will mine if other transactions are in the mempool.
+      1.0.1 release.
+      Update man pages.
+
+Simon (1):
+      Closes #1746. Add rpc call z_validateaddress to validate zaddrs.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.10-1.md b/depend/zcash/doc/release-notes/release-notes-1.0.10-1.md
new file mode 100644
index 000000000..fea2f5156
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.10-1.md
@@ -0,0 +1,11 @@
+Jack Grigg (1):
+      Disable building Proton in Gitian
+
+Sean Bowe (2):
+      Revert "Remove an unneeded version workaround as per @str4d's review comment."
+      Revert "Delete old protocol version constants and simplify code that used them."
+
+Simon Liu (2):
+      make-release.py: Versioning changes for 1.0.10-1.
+      make-release.py: Updated manpages for 1.0.10-1.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.10.md b/depend/zcash/doc/release-notes/release-notes-1.0.10.md
new file mode 100644
index 000000000..16d2a62ba
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.10.md
@@ -0,0 +1,79 @@
+Notable changes
+===============
+
+Signature validation using libsecp256k1
+---------------------------------------
+
+ECDSA signatures inside Zcash transactions now use validation using
+[https://github.com/bitcoin/secp256k1](libsecp256k1) instead of OpenSSL.
+
+Depending on the platform, this means a significant speedup for raw signature
+validation speed. The advantage is largest on x86_64, where validation is over
+five times faster. In practice, this translates to a raw reindexing and new
+block validation times that are less than half of what it was before.
+
+Libsecp256k1 has undergone very extensive testing and validation upstream.
+
+A side effect of this change is that libconsensus no longer depends on OpenSSL.
+
+Changelog
+=========
+
+Boris Hajduk (1):
+      documentatin z_validateaddress was missing param
+
+Daira Hopwood (8):
+      Delete old protocol version constants and simplify code that used them.     fixes #2244
+      Remove an unneeded version workaround as per @str4d's review comment.
+      Remove unneeded lax ECDSA signature verification.
+      Strict DER signatures are always enforced; remove the flag and code that used it.
+      Repair tests for strict DER signatures.     While we're at it, repair a similar test for CLTV, and make the repaired RPC tests run by default.
+      Make transaction test failures print the comments preceding the test JSON.
+      Fix a comment that was made stale before launch by #1016 (commit 542da61).
+      Delete test that is redundant and inapplicable to Zcash.
+
+Jack Grigg (20):
+      Fix incorrect locking in CCryptoKeyStore
+      Use AtomicTimer for metrics screen thread count
+      Revert "Fix secp256k1 test compilation"
+      Squashed 'src/secp256k1/' changes from 22f60a6..84973d3
+      Fix potential overflows in ECDSA DER parsers
+      Rename FALLBACK_DOWNLOAD_PATH to PRIORITY_DOWNLOAD_PATH
+      Add test for incorrect consensus logic
+      Correct consensus logic in ContextualCheckInputs
+      Add comments
+      Update Debian copyright list
+      Specify ECDSA constant sizes as constants
+      Remove redundant `= 0` initialisations
+      Ensure that ECDSA constant sizes are correctly-sized
+      Add test for -mempooltxinputlimit
+      Hold an ECCVerifyHandle in zcash-gtest
+      Additional testing of -mempooltxinputlimit
+      Fix comment
+      Use sendfrom for both t-addr calls
+      make-release.py: Versioning changes for 1.0.10.
+      make-release.py: Updated manpages for 1.0.10.
+
+Kevin Pan (1):
+      "getblocktemplate" could work without wallet
+
+Pieter Wuille (2):
+      Update key.cpp to new secp256k1 API
+      Switch to libsecp256k1-based validation for ECDSA
+
+Simon Liu (5):
+      Fix intermediate vpub_new leakage in multi joinsplit tx (#1360)
+      Add option 'mempooltxinputlimit' so the mempool can reject a transaction     based on the number of transparent inputs.
+      Check mempooltxinputlimit when creating a transaction to avoid local     mempool rejection.
+      Partial revert & fix for commit 9e84b5a ; code block in wrong location.
+      Fix #b1eb4f2 so test checks sendfrom as originally intended.
+
+Wladimir J. van der Laan (2):
+      Use real number of cores for default -par, ignore virtual cores
+      Remove ChainParams::DefaultMinerThreads
+
+kozyilmaz (3):
+      [macOS] system linker does not support “--version� option but only “-v�
+      option to disable building libraries (zcutil/build.sh)
+      support per platform filename and hash setting for dependencies
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.11-rc1.md b/depend/zcash/doc/release-notes/release-notes-1.0.11-rc1.md
new file mode 100644
index 000000000..4542a448c
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.11-rc1.md
@@ -0,0 +1,44 @@
+Changelog
+=========
+
+Ariel Gabizon (2):
+      make-release.py: Versioning changes for 1.0.11-rc1.
+      make-release.py: Updated manpages for 1.0.11-rc1.
+
+Daira Hopwood (7):
+      Clean up imports to be pyflakes-checkable. fixes #2450
+      For unused variables reported by pyflakes, either remove the variable,     suppress the warning, or fix a bug (if the wrong variable was used).     refs #2450
+      Cosmetics (trailing whitespace, comment conventions, etc.)
+      Alert 1004 (version 1.0.10 only)
+      Remove UPnP support. fixes #2500
+      Change wording in Security Warnings section of README.md.
+      Document our criteria for adding CI workers. closes #2499
+
+Jack Grigg (15):
+      Pull in temporary release notes during the release process
+      Ansible playbook for installing Zcash dependencies and Buildbot worker
+      Variable overrides for Debian, Ubuntu and Fedora
+      Variable overrides for FreeBSD
+      Simplify Python installation, inform user if they need to manually configure
+      Add test for issue #2444
+      Add Buildbot worker setup to Ansible playbook
+      Add steps for setting up a latent worker on Amazon EC2
+      Add pyblake2 to required Python modules
+      Remove Buildbot version from host file
+      Add a separate Buildbot host info template for EC2
+      Add pyflakes to required Python modules
+      Add block download progress to metrics UI
+      Correct and extend EstimateNetHeightInner tests
+      Improve network height estimation
+
+Simon Liu (3):
+      Closes #2446 by adding generated field to listunspent.
+      Fixes #2519. When sending from a zaddr, minconf cannot be zero.
+      Fixes #2480. Null entry in map was dereferenced leading to a segfault.
+
+Wladimir J. van der Laan (1):
+      rpc: Add WWW-Authenticate header to 401 response
+
+practicalswift (1):
+      Net: Fix resource leak in ReadBinaryFile(...)
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.11.md b/depend/zcash/doc/release-notes/release-notes-1.0.11.md
new file mode 100644
index 000000000..d5a12a222
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.11.md
@@ -0,0 +1,47 @@
+Changelog
+=========
+
+Ariel Gabizon (3):
+      make-release.py: Versioning changes for 1.0.11-rc1.
+      make-release.py: Updated manpages for 1.0.11-rc1.
+      make-release.py: Updated release notes and changelog for 1.0.11-rc1.
+
+Daira Hopwood (7):
+      Clean up imports to be pyflakes-checkable. fixes #2450
+      For unused variables reported by pyflakes, either remove the variable,     suppress the warning, or fix a bug (if the wrong variable was used).     refs #2450
+      Cosmetics (trailing whitespace, comment conventions, etc.)
+      Alert 1004 (version 1.0.10 only)
+      Remove UPnP support. fixes #2500
+      Change wording in Security Warnings section of README.md.
+      Document our criteria for adding CI workers. closes #2499
+
+Jack Grigg (17):
+      Pull in temporary release notes during the release process
+      Ansible playbook for installing Zcash dependencies and Buildbot worker
+      Variable overrides for Debian, Ubuntu and Fedora
+      Variable overrides for FreeBSD
+      Simplify Python installation, inform user if they need to manually configure
+      Add test for issue #2444
+      Add Buildbot worker setup to Ansible playbook
+      Add steps for setting up a latent worker on Amazon EC2
+      Add pyblake2 to required Python modules
+      Remove Buildbot version from host file
+      Add a separate Buildbot host info template for EC2
+      Add pyflakes to required Python modules
+      Add block download progress to metrics UI
+      Correct and extend EstimateNetHeightInner tests
+      Improve network height estimation
+      make-release.py: Versioning changes for 1.0.11.
+      make-release.py: Updated manpages for 1.0.11.
+
+Simon Liu (3):
+      Closes #2446 by adding generated field to listunspent.
+      Fixes #2519. When sending from a zaddr, minconf cannot be zero.
+      Fixes #2480. Null entry in map was dereferenced leading to a segfault.
+
+Wladimir J. van der Laan (1):
+      rpc: Add WWW-Authenticate header to 401 response
+
+practicalswift (1):
+      Net: Fix resource leak in ReadBinaryFile(...)
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.12-rc1.md b/depend/zcash/doc/release-notes/release-notes-1.0.12-rc1.md
new file mode 100644
index 000000000..27d36b7e7
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.12-rc1.md
@@ -0,0 +1,57 @@
+Changelog
+=========
+
+Ariel (1):
+      add examples to z_getoperationresult
+
+Ariel Gabizon (1):
+      add load-wallet benchmark
+
+Bjorn Hjortsberg (2):
+      Do not warn on built in declaration mismatch
+      Remove deprecated exception specification
+
+Jack Grigg (20):
+      ci-workers: Enable pipelining, and use root to set admin and host details
+      Variable overrides for Arch Linux
+      Rationalize currency unit to "ZEC"
+      ci-workers: Fail if Python is not version 2.7
+      ci-workers: Variable overrides and process tweaks for CentOS 7
+      Add build progress to the release script if progressbar module is available
+      Add hotfix support to release script
+      Document the hotfix release process
+      Enforce sequential hotfix versioning
+      Benchmark time to call sendtoaddress with many UTXOs
+      Fix bug in benchmark data generation script
+      Adjust instructions for UTXO dataset creation
+      Add GitHub release notes to release process
+      Clarify branching and force-building operations in hotfix process
+      Update user guide translations as part of release process
+      make-release.py: Send stderr to stdout
+      List dependencies for release script in release process doc
+      Additional test cases for importprivkey RPC test
+      make-release.py: Versioning changes for 1.0.12-rc1.
+      make-release.py: Updated manpages for 1.0.12-rc1.
+
+Jason Davies (1):
+      Fix deprecation policy comment.
+
+Nathan Wilcox (5):
+      key_import_export rpc-test: verify that UTXO view co-evolves for nodes sharing a key.
+      Add a new rpc-test-specified requirement: `importprivkey` outputs the associated address. (Test fails.)
+      [tests pass] Output address on new key import.
+      Add a new requirement that `importprivkey` API is idempotent.
+      [tests pass] Ensure `importprivkey` outputs the address in case key is already imported.
+
+Ross Nicoll (1):
+      Rationalize currency unit to "BTC"
+
+Simon Liu (3):
+      Closes #2583. Exclude watch-only utxos from z_sendmany coin selection.
+      Set up a clean chain.     Delete redundant method wait_until_miner_sees() via use of sync_all().
+      Implement RPC shield_coinbase #2448.
+
+kpcyrd (2):
+      Fetch params from ipfs if possible
+      Prefer wget over ipfs
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.12.md b/depend/zcash/doc/release-notes/release-notes-1.0.12.md
new file mode 100644
index 000000000..6aa6cd651
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.12.md
@@ -0,0 +1,65 @@
+Changelog
+=========
+
+Ariel (1):
+      add examples to z_getoperationresult
+
+Ariel Gabizon (1):
+      add load-wallet benchmark
+
+Bjorn Hjortsberg (2):
+      Do not warn on built in declaration mismatch
+      Remove deprecated exception specification
+
+Jack Grigg (26):
+      ci-workers: Enable pipelining, and use root to set admin and host details
+      Variable overrides for Arch Linux
+      Rationalize currency unit to "ZEC"
+      ci-workers: Fail if Python is not version 2.7
+      ci-workers: Variable overrides and process tweaks for CentOS 7
+      Add build progress to the release script if progressbar module is available
+      Add hotfix support to release script
+      Document the hotfix release process
+      Enforce sequential hotfix versioning
+      Benchmark time to call sendtoaddress with many UTXOs
+      Fix bug in benchmark data generation script
+      Adjust instructions for UTXO dataset creation
+      Add GitHub release notes to release process
+      Clarify branching and force-building operations in hotfix process
+      Update user guide translations as part of release process
+      make-release.py: Send stderr to stdout
+      List dependencies for release script in release process doc
+      Additional test cases for importprivkey RPC test
+      make-release.py: Versioning changes for 1.0.12-rc1.
+      make-release.py: Updated manpages for 1.0.12-rc1.
+      make-release.py: Updated release notes and changelog for 1.0.12-rc1.
+      Fix pyflakes warnings in RPC tests
+      Individualise performance-measurements.sh errors for debugging
+      Fix incorrect failure in memory benchmark
+      make-release.py: Versioning changes for 1.0.12.
+      make-release.py: Updated manpages for 1.0.12.
+
+Jason Davies (1):
+      Fix deprecation policy comment.
+
+Nathan Wilcox (5):
+      key_import_export rpc-test: verify that UTXO view co-evolves for nodes sharing a key.
+      Add a new rpc-test-specified requirement: `importprivkey` outputs the associated address. (Test fails.)
+      [tests pass] Output address on new key import.
+      Add a new requirement that `importprivkey` API is idempotent.
+      [tests pass] Ensure `importprivkey` outputs the address in case key is already imported.
+
+Ross Nicoll (1):
+      Rationalize currency unit to "BTC"
+
+Simon Liu (5):
+      Closes #2583. Exclude watch-only utxos from z_sendmany coin selection.
+      Set up a clean chain.     Delete redundant method wait_until_miner_sees() via use of sync_all().
+      Implement RPC shield_coinbase #2448.
+      Update which lock to synchronize on when calling GetBestAnchor().
+      Closes #2637. Make z_shieldcoinbase an experimental feature where it     can be enabled with: zcashd -experimentalfeatures -zshieldcoinbase.
+
+kpcyrd (2):
+      Fetch params from ipfs if possible
+      Prefer wget over ipfs
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.13-rc1.md b/depend/zcash/doc/release-notes/release-notes-1.0.13-rc1.md
new file mode 100644
index 000000000..4d8a37a7c
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.13-rc1.md
@@ -0,0 +1,88 @@
+Changelog
+=========
+
+Ariel Gabizon (1):
+      boost::format -> tinyformat
+
+Bruno Arueira (1):
+      Removes out bitcoin mention in favor for zcash
+
+Cory Fields (1):
+      httpserver: explicitly detach worker threads
+
+Duke Leto (1):
+      Update performance-measurements.sh
+
+Jack Grigg (37):
+      Squashed 'src/snark/' content from commit 9ada3f8
+      Add libsnark compile flag to not copy DEPINST to PREFIX
+      Add Ansible playbook for grind workers
+      Add connections in BIP65 and BIP66 tests to the test manager
+      Add benchmark for listunspent
+      [Test] MiniNode: Implement JSDescription parsing
+      [Test] MiniNode: Implement v2 CTransaction parsing
+      [Test] MiniNode: Implement Zcash block parsing
+      [Test] MiniNode: Update protocol version and network magics
+      [Test] MiniNode: Use Zcash PoW
+      [Test] MiniNode: Fix coinbase creation
+      [Test] MiniNode: Coerce OP_PUSHDATA bytearrays to bytes
+      [Test] MiniNode: Implement Zcash coinbase
+      Fix BIP65 and BIP66 tests
+      Un-indent RPC test output in test runner
+      Replace full-test-suite.sh with a new test suite driver script
+      Move ensure-no-dot-so-in-depends.py into full_test_suite.py
+      Move check-security-hardening.sh into full_test_suite.py
+      Add memory benchmark for validatelargetx
+      Migrate libsnark test code to Google Test
+      Remove test code corresponding to removed code
+      Add alt_bn128 to QAP and Merkle tree gadget tests
+      Update libsnark LDLIBS
+      Add "make check" to libsnark that runs the Google Tests
+      Add "make libsnark-tests" that runs libsnark's "make check"
+      Changes to get test_r1cs_ppzksnark passing
+      Add bitcoin-util-test.py to full_test_suite.py
+      Add stdout notice if any stage fails
+      Add libsnark to "make clean"
+      Ensure that libsnark is built first, so its headers are available
+      Remove OpenSSL libraries from libsnark LDLIBS
+      Add libsnark tests to full_test_suite.py
+      Add --list-stages argument to full_test_suite.py
+      Fix NPE in rpc_wallet_tests
+      make-release.py: Versioning changes for 1.0.13-rc1.
+      make-release.py: Updated manpages for 1.0.13-rc1.
+      Change auto-senescence cycle to 16 weeks
+
+Jason Davies (1):
+      Replace "bitcoin" with "Zcash".
+
+Jay Graber (1):
+      s/zcash/Zcash
+
+Jonathan "Duke" Leto (1):
+      Fix bug where performance-measurements.sh fails hards when given no args
+
+João Barbosa (1):
+      Improve shutdown process
+
+Sean Bowe (5):
+      Remove libsnark from depends system and integrate it into build system.
+      Remove crusty old "loadVerifyingKey"/"loadProvingKey" APIs and associated invariants.
+      Refactor proof generation function.
+      Add streaming prover.
+      Integrate low memory prover.
+
+Simon Liu (7):
+      Replace 'bitcoin address' with 'zcash address'.
+      Closes #2639. z_shieldcoinbase is now supported, no longer experimental.
+      Closes #2263 fixing broken pipe error.
+      Closes #2576. Update link to security info on z.cash website.
+      Closes #2639. Adds optional limit parameter with a default value of 50.
+      Fix an issue where qa test wallet_shieldcoinbase could hang.
+      Add payment disclosure as experimental feature.
+
+Wladimir J. van der Laan (4):
+      Make HTTP server shutdown more graceful
+      http: Wait for worker threads to exit
+      http: Force-exit event loop after predefined time
+      http: speed up shutdown
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.13-rc2.md b/depend/zcash/doc/release-notes/release-notes-1.0.13-rc2.md
new file mode 100644
index 000000000..6ade7d922
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.13-rc2.md
@@ -0,0 +1,95 @@
+Changelog
+=========
+
+Ariel Gabizon (1):
+      boost::format -> tinyformat
+
+Bruno Arueira (1):
+      Removes out bitcoin mention in favor for zcash
+
+Cory Fields (1):
+      httpserver: explicitly detach worker threads
+
+Duke Leto (1):
+      Update performance-measurements.sh
+
+Jack Grigg (44):
+      Squashed 'src/snark/' content from commit 9ada3f8
+      Add libsnark compile flag to not copy DEPINST to PREFIX
+      Add Ansible playbook for grind workers
+      Add connections in BIP65 and BIP66 tests to the test manager
+      Add benchmark for listunspent
+      [Test] MiniNode: Implement JSDescription parsing
+      [Test] MiniNode: Implement v2 CTransaction parsing
+      [Test] MiniNode: Implement Zcash block parsing
+      [Test] MiniNode: Update protocol version and network magics
+      [Test] MiniNode: Use Zcash PoW
+      [Test] MiniNode: Fix coinbase creation
+      [Test] MiniNode: Coerce OP_PUSHDATA bytearrays to bytes
+      [Test] MiniNode: Implement Zcash coinbase
+      Fix BIP65 and BIP66 tests
+      Un-indent RPC test output in test runner
+      Replace full-test-suite.sh with a new test suite driver script
+      Move ensure-no-dot-so-in-depends.py into full_test_suite.py
+      Move check-security-hardening.sh into full_test_suite.py
+      Add memory benchmark for validatelargetx
+      Migrate libsnark test code to Google Test
+      Remove test code corresponding to removed code
+      Add alt_bn128 to QAP and Merkle tree gadget tests
+      Update libsnark LDLIBS
+      Add "make check" to libsnark that runs the Google Tests
+      Add "make libsnark-tests" that runs libsnark's "make check"
+      Changes to get test_r1cs_ppzksnark passing
+      Add bitcoin-util-test.py to full_test_suite.py
+      Add stdout notice if any stage fails
+      Add libsnark to "make clean"
+      Ensure that libsnark is built first, so its headers are available
+      Remove OpenSSL libraries from libsnark LDLIBS
+      Add libsnark tests to full_test_suite.py
+      Add --list-stages argument to full_test_suite.py
+      Fix NPE in rpc_wallet_tests
+      make-release.py: Versioning changes for 1.0.13-rc1.
+      make-release.py: Updated manpages for 1.0.13-rc1.
+      make-release.py: Updated release notes and changelog for 1.0.13-rc1.
+      Change auto-senescence cycle to 16 weeks
+      Move libsnark from DIST_SUBDIRS into EXTRA_DIST
+      Pass correct dependencies path to libsnark from both Gitian and build.sh
+      Mark libsnark includes as library includes
+      Add the tar-pax option to automake
+      make-release.py: Versioning changes for 1.0.13-rc2.
+      make-release.py: Updated manpages for 1.0.13-rc2.
+
+Jason Davies (1):
+      Replace "bitcoin" with "Zcash".
+
+Jay Graber (1):
+      s/zcash/Zcash
+
+Jonathan "Duke" Leto (1):
+      Fix bug where performance-measurements.sh fails hards when given no args
+
+João Barbosa (1):
+      Improve shutdown process
+
+Sean Bowe (5):
+      Remove libsnark from depends system and integrate it into build system.
+      Remove crusty old "loadVerifyingKey"/"loadProvingKey" APIs and associated invariants.
+      Refactor proof generation function.
+      Add streaming prover.
+      Integrate low memory prover.
+
+Simon Liu (7):
+      Replace 'bitcoin address' with 'zcash address'.
+      Closes #2639. z_shieldcoinbase is now supported, no longer experimental.
+      Closes #2263 fixing broken pipe error.
+      Closes #2576. Update link to security info on z.cash website.
+      Closes #2639. Adds optional limit parameter with a default value of 50.
+      Fix an issue where qa test wallet_shieldcoinbase could hang.
+      Add payment disclosure as experimental feature.
+
+Wladimir J. van der Laan (4):
+      Make HTTP server shutdown more graceful
+      http: Wait for worker threads to exit
+      http: Force-exit event loop after predefined time
+      http: speed up shutdown
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.13.md b/depend/zcash/doc/release-notes/release-notes-1.0.13.md
new file mode 100644
index 000000000..3a1a950a9
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.13.md
@@ -0,0 +1,98 @@
+Changelog
+=========
+
+Ariel Gabizon (1):
+      boost::format -> tinyformat
+
+Bruno Arueira (1):
+      Removes out bitcoin mention in favor for zcash
+
+Cory Fields (1):
+      httpserver: explicitly detach worker threads
+
+Duke Leto (1):
+      Update performance-measurements.sh
+
+Jack Grigg (47):
+      Squashed 'src/snark/' content from commit 9ada3f8
+      Add libsnark compile flag to not copy DEPINST to PREFIX
+      Add Ansible playbook for grind workers
+      Add connections in BIP65 and BIP66 tests to the test manager
+      Add benchmark for listunspent
+      [Test] MiniNode: Implement JSDescription parsing
+      [Test] MiniNode: Implement v2 CTransaction parsing
+      [Test] MiniNode: Implement Zcash block parsing
+      [Test] MiniNode: Update protocol version and network magics
+      [Test] MiniNode: Use Zcash PoW
+      [Test] MiniNode: Fix coinbase creation
+      [Test] MiniNode: Coerce OP_PUSHDATA bytearrays to bytes
+      [Test] MiniNode: Implement Zcash coinbase
+      Fix BIP65 and BIP66 tests
+      Un-indent RPC test output in test runner
+      Replace full-test-suite.sh with a new test suite driver script
+      Move ensure-no-dot-so-in-depends.py into full_test_suite.py
+      Move check-security-hardening.sh into full_test_suite.py
+      Add memory benchmark for validatelargetx
+      Migrate libsnark test code to Google Test
+      Remove test code corresponding to removed code
+      Add alt_bn128 to QAP and Merkle tree gadget tests
+      Update libsnark LDLIBS
+      Add "make check" to libsnark that runs the Google Tests
+      Add "make libsnark-tests" that runs libsnark's "make check"
+      Changes to get test_r1cs_ppzksnark passing
+      Add bitcoin-util-test.py to full_test_suite.py
+      Add stdout notice if any stage fails
+      Add libsnark to "make clean"
+      Ensure that libsnark is built first, so its headers are available
+      Remove OpenSSL libraries from libsnark LDLIBS
+      Add libsnark tests to full_test_suite.py
+      Add --list-stages argument to full_test_suite.py
+      Fix NPE in rpc_wallet_tests
+      make-release.py: Versioning changes for 1.0.13-rc1.
+      make-release.py: Updated manpages for 1.0.13-rc1.
+      make-release.py: Updated release notes and changelog for 1.0.13-rc1.
+      Change auto-senescence cycle to 16 weeks
+      Move libsnark from DIST_SUBDIRS into EXTRA_DIST
+      Pass correct dependencies path to libsnark from both Gitian and build.sh
+      Mark libsnark includes as library includes
+      Add the tar-pax option to automake
+      make-release.py: Versioning changes for 1.0.13-rc2.
+      make-release.py: Updated manpages for 1.0.13-rc2.
+      make-release.py: Updated release notes and changelog for 1.0.13-rc2.
+      make-release.py: Versioning changes for 1.0.13.
+      make-release.py: Updated manpages for 1.0.13.
+
+Jason Davies (1):
+      Replace "bitcoin" with "Zcash".
+
+Jay Graber (1):
+      s/zcash/Zcash
+
+Jonathan "Duke" Leto (1):
+      Fix bug where performance-measurements.sh fails hards when given no args
+
+João Barbosa (1):
+      Improve shutdown process
+
+Sean Bowe (5):
+      Remove libsnark from depends system and integrate it into build system.
+      Remove crusty old "loadVerifyingKey"/"loadProvingKey" APIs and associated invariants.
+      Refactor proof generation function.
+      Add streaming prover.
+      Integrate low memory prover.
+
+Simon Liu (7):
+      Replace 'bitcoin address' with 'zcash address'.
+      Closes #2639. z_shieldcoinbase is now supported, no longer experimental.
+      Closes #2263 fixing broken pipe error.
+      Closes #2576. Update link to security info on z.cash website.
+      Closes #2639. Adds optional limit parameter with a default value of 50.
+      Fix an issue where qa test wallet_shieldcoinbase could hang.
+      Add payment disclosure as experimental feature.
+
+Wladimir J. van der Laan (4):
+      Make HTTP server shutdown more graceful
+      http: Wait for worker threads to exit
+      http: Force-exit event loop after predefined time
+      http: speed up shutdown
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.14-rc1.md b/depend/zcash/doc/release-notes/release-notes-1.0.14-rc1.md
new file mode 100644
index 000000000..1654bf483
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.14-rc1.md
@@ -0,0 +1,156 @@
+Notable changes
+===============
+
+Incoming viewing keys
+---------------------
+
+Support for incoming viewing keys, as described in
+[the Zcash protocol spec](https://github.com/zcash/zips/blob/master/protocol/protocol.pdf),
+has been added to the wallet.
+
+Use the `z_exportviewingkey` RPC method to obtain the incoming viewing key for a
+z-address in a node's wallet. For Sprout z-addresses, these always begin with
+"ZiVK" (or "ZiVt" for testnet z-addresses). Use `z_importviewingkey` to import
+these into another node.
+
+A node that possesses an incoming viewing key for a z-address can view all past
+transactions received by that address, as well as all future transactions sent
+to it, by using `z_listreceivedbyaddress`. They cannot spend any funds from the
+address. This is similar to the behaviour of "watch-only" t-addresses.
+
+`z_gettotalbalance` now has an additional boolean parameter for including the
+balance of "watch-only" addresses (both transparent and shielded), which is set
+to `false` by default. `z_getbalance` has also been updated to work with
+watch-only addresses.
+
+- **Caution:** for z-addresses, these balances will **not** be accurate if any
+  funds have been sent from the address. This is because incoming viewing keys
+  cannot detect spends, and so the "balance" is just the sum of all received
+  notes, including ones that have been spent. Some future use-cases for incoming
+  viewing keys will include synchronization data to keep their balances accurate
+  (e.g. [#2542](https://github.com/zcash/zcash/issues/2542)).
+
+Changelog
+=========
+
+Anthony Towns (1):
+      Add configure check for -latomic
+
+Cory Fields (12):
+      c++11: don't throw from the reverselock destructor
+      c++11: CAccountingEntry must be defined before use in a list
+      c++11: fix libbdb build against libc++ in c++11 mode
+      depends: use c++11
+      depends: bump OSX toolchain
+      build: Split hardening/fPIE options out
+      build: define base filenames for use elsewhere in the buildsystem
+      build: quiet annoying warnings without adding new ones
+      build: fix Windows builds without pkg-config
+      build: force a c++ standard to be specified
+      build: warn about variable length arrays
+      build: add --enable-werror option
+
+Jack Grigg (36):
+      Squashed 'src/secp256k1/' changes from 84973d3..6ad5cdb
+      Use g-prefixed coreutils commands if they are available
+      Replace hard-coded defaults for HOST and BUILD with config.guess
+      Remove manual -std=c++11 flag
+      Replace "install -D" with "mkdir -p && install"
+      Check if OpenMP is available before using it
+      [libsnark] Use POSIX-compliant ar arguments
+      Include endian-ness compatibility layer in Equihash implementation
+      build: Split hardening/fPIE options out in Zcash-specific binaries
+      Change --enable-werror to apply to all warnings, use it in build.sh
+      Move Zcash flags into configure.ac
+      ViewingKey -> ReceivingKey per zcash/zips#117
+      Implement viewing key storage in the keystore
+      Factor out common logic from CZCPaymentAddress and CZCSpendingKey
+      Track net value entering and exiting the Sprout circuit
+      Add Sprout value pool to getblock and getblockchaininfo
+      Apply -fstack-protector-all to libsnark
+      Add Rust and Proton to configure options printout
+      Clarify operator precedence in serialization of nSproutValue
+      Remove nSproutValue TODO from CDiskBlockIndex
+      Add Base58 encoding of viewing keys
+      Implement viewing key storage in the wallet
+      Add RPC methods for exporting/importing viewing keys
+      Update wallet logic to account for viewing keys
+      Add watch-only support to Zcash RPC methods
+      Modify zcrawkeygen RPC method to set "zcviewingkey" to the viewing key
+      Cleanup: Add braces for clarity
+      Add cautions to z_getbalance and z_gettotalbalance help text about viewing keys
+      Add release notes for incoming viewing keys
+      Create release notes starting from the previous non-beta non-RC release
+      release-notes.py: Remove unnecessary parameter
+      Regenerate previous release notes to conform to new format
+      Exclude beta and RC release notes from author tallies
+      Fix pyflakes warnings in zkey_import_export RPC test
+      make-release.py: Versioning changes for 1.0.14-rc1.
+      make-release.py: Updated manpages for 1.0.14-rc1.
+
+Jay Graber (3):
+      Add cli and rpc examples for z_sendmany
+      Fix cli help result for z_shieldcoinbase
+      Add rpc test that exercises z_importkey
+
+Jonas Schnelli (1):
+      Add compile and link options echo to configure
+
+Luke Dashjr (4):
+      depends: Use curl for fetching on Linux
+      Travis: Use curl rather than wget for Mac SDK
+      Bugfix: depends/Travis: Use --location (follow redirects) and --fail [on HTTP error response] with curl
+      Travis: Use Blue Box VMs for IPv6 loopback support
+
+MarcoFalke (2):
+      Fix url in .travis.yml
+      [depends] builders: No need to set -L and --location for curl
+
+Per Grön (2):
+      Deduplicate test utility method wait_and_assert_operationid_status
+      Print result of RPC call in test only when PYTHON_DEBUG is set
+
+René Nyffenegger (1):
+      Use AC_ARG_VAR to set ARFLAGS.
+
+Simon Liu (5):
+      RPC dumpwallet and z_exportwallet updated to no longer allow     overwriting an existing file.
+      Add documentation for shielding coinbase utxos.
+      Add documentation for payment disclosure.
+      Closes #2759. Fixes broken pipe error with QA test wallet.py.
+      Closes #2746. Payment disclosure blobs now use 'zpd:' prefix.
+
+Wladimir J. van der Laan (6):
+      build: Enable C++11 build, require C++11 compiler
+      build: update ax_cxx_compile_stdcxx to serial 4
+      test: Remove java comparison tool
+      build: Remove check for `openssl/ec.h`
+      devtools: Check for high-entropy ASLR in 64-bit PE executables
+      build: supply `-Wl,--high-entropy-va`
+
+daniel (1):
+      add powerpc build support for openssl lib
+
+fanquake (3):
+      [build-aux] Update Boost & check macros to latest serials
+      [depends] Add -stdlib=libc++ to darwin CXX flags
+      [depends] Set OSX_MIN_VERSION to 10.8
+
+kozyilmaz (1):
+      empty spaces in PATH variable cause build failure
+
+syd (13):
+      Upgrade googletest to 1.8.0
+      Get the sec-hard tests to run correctly.
+      Update libsodium from 1.0.11 to 1.0.15
+      Remove Boost conditional compilation.
+      Update to address @daira comments wrt fixing configure.ac
+      Get rid of consensus.fPowAllowMinDifficultyBlocks.
+      Don't compile libgtest.a when building libsnark.
+      Add gtests to .gitignore
+      Get rid of fp3 from libsnark, it is not used.
+      InitGoogleMock instead of InitGoogleTest per CR
+      Get rid of underscore prefixes for include guards.
+      Rename bash completion files so that they refer to zcash and not bitcoin.
+      Fix libsnark test failure.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.14.md b/depend/zcash/doc/release-notes/release-notes-1.0.14.md
new file mode 100644
index 000000000..4b9cd0810
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.14.md
@@ -0,0 +1,160 @@
+Notable changes
+===============
+
+Incoming viewing keys
+---------------------
+
+Support for incoming viewing keys, as described in
+[the Zcash protocol spec](https://github.com/zcash/zips/blob/master/protocol/protocol.pdf),
+has been added to the wallet.
+
+Use the `z_exportviewingkey` RPC method to obtain the incoming viewing key for a
+z-address in a node's wallet. For Sprout z-addresses, these always begin with
+"ZiVK" (or "ZiVt" for testnet z-addresses). Use `z_importviewingkey` to import
+these into another node.
+
+A node that possesses an incoming viewing key for a z-address can view all past
+transactions received by that address, as well as all future transactions sent
+to it, by using `z_listreceivedbyaddress`. They cannot spend any funds from the
+address. This is similar to the behaviour of "watch-only" t-addresses.
+
+`z_gettotalbalance` now has an additional boolean parameter for including the
+balance of "watch-only" addresses (both transparent and shielded), which is set
+to `false` by default. `z_getbalance` has also been updated to work with
+watch-only addresses.
+
+- **Caution:** for z-addresses, these balances will **not** be accurate if any
+  funds have been sent from the address. This is because incoming viewing keys
+  cannot detect spends, and so the "balance" is just the sum of all received
+  notes, including ones that have been spent. Some future use-cases for incoming
+  viewing keys will include synchronization data to keep their balances accurate
+  (e.g. [#2542](https://github.com/zcash/zcash/issues/2542)).
+
+Changelog
+=========
+
+Anthony Towns (1):
+      Add configure check for -latomic
+
+Cory Fields (12):
+      c++11: don't throw from the reverselock destructor
+      c++11: CAccountingEntry must be defined before use in a list
+      c++11: fix libbdb build against libc++ in c++11 mode
+      depends: use c++11
+      depends: bump OSX toolchain
+      build: Split hardening/fPIE options out
+      build: define base filenames for use elsewhere in the buildsystem
+      build: quiet annoying warnings without adding new ones
+      build: fix Windows builds without pkg-config
+      build: force a c++ standard to be specified
+      build: warn about variable length arrays
+      build: add --enable-werror option
+
+Jack Grigg (40):
+      Squashed 'src/secp256k1/' changes from 84973d3..6ad5cdb
+      Use g-prefixed coreutils commands if they are available
+      Replace hard-coded defaults for HOST and BUILD with config.guess
+      Remove manual -std=c++11 flag
+      Replace "install -D" with "mkdir -p && install"
+      Check if OpenMP is available before using it
+      [libsnark] Use POSIX-compliant ar arguments
+      Include endian-ness compatibility layer in Equihash implementation
+      build: Split hardening/fPIE options out in Zcash-specific binaries
+      Change --enable-werror to apply to all warnings, use it in build.sh
+      Move Zcash flags into configure.ac
+      ViewingKey -> ReceivingKey per zcash/zips#117
+      Implement viewing key storage in the keystore
+      Factor out common logic from CZCPaymentAddress and CZCSpendingKey
+      Track net value entering and exiting the Sprout circuit
+      Add Sprout value pool to getblock and getblockchaininfo
+      Apply -fstack-protector-all to libsnark
+      Add Rust and Proton to configure options printout
+      Clarify operator precedence in serialization of nSproutValue
+      Remove nSproutValue TODO from CDiskBlockIndex
+      Add Base58 encoding of viewing keys
+      Implement viewing key storage in the wallet
+      Add RPC methods for exporting/importing viewing keys
+      Update wallet logic to account for viewing keys
+      Add watch-only support to Zcash RPC methods
+      Modify zcrawkeygen RPC method to set "zcviewingkey" to the viewing key
+      Cleanup: Add braces for clarity
+      Add cautions to z_getbalance and z_gettotalbalance help text about viewing keys
+      Add release notes for incoming viewing keys
+      Create release notes starting from the previous non-beta non-RC release
+      release-notes.py: Remove unnecessary parameter
+      Regenerate previous release notes to conform to new format
+      Exclude beta and RC release notes from author tallies
+      Fix pyflakes warnings in zkey_import_export RPC test
+      make-release.py: Versioning changes for 1.0.14-rc1.
+      make-release.py: Updated manpages for 1.0.14-rc1.
+      make-release.py: Updated release notes and changelog for 1.0.14-rc1.
+      Update release process
+      make-release.py: Versioning changes for 1.0.14.
+      make-release.py: Updated manpages for 1.0.14.
+
+Jay Graber (3):
+      Add cli and rpc examples for z_sendmany
+      Fix cli help result for z_shieldcoinbase
+      Add rpc test that exercises z_importkey
+
+Jonas Schnelli (1):
+      Add compile and link options echo to configure
+
+Luke Dashjr (4):
+      depends: Use curl for fetching on Linux
+      Travis: Use curl rather than wget for Mac SDK
+      Bugfix: depends/Travis: Use --location (follow redirects) and --fail [on HTTP error response] with curl
+      Travis: Use Blue Box VMs for IPv6 loopback support
+
+MarcoFalke (2):
+      Fix url in .travis.yml
+      [depends] builders: No need to set -L and --location for curl
+
+Per Grön (2):
+      Deduplicate test utility method wait_and_assert_operationid_status
+      Print result of RPC call in test only when PYTHON_DEBUG is set
+
+René Nyffenegger (1):
+      Use AC_ARG_VAR to set ARFLAGS.
+
+Simon Liu (5):
+      RPC dumpwallet and z_exportwallet updated to no longer allow     overwriting an existing file.
+      Add documentation for shielding coinbase utxos.
+      Add documentation for payment disclosure.
+      Closes #2759. Fixes broken pipe error with QA test wallet.py.
+      Closes #2746. Payment disclosure blobs now use 'zpd:' prefix.
+
+Wladimir J. van der Laan (6):
+      build: Enable C++11 build, require C++11 compiler
+      build: update ax_cxx_compile_stdcxx to serial 4
+      test: Remove java comparison tool
+      build: Remove check for `openssl/ec.h`
+      devtools: Check for high-entropy ASLR in 64-bit PE executables
+      build: supply `-Wl,--high-entropy-va`
+
+daniel (1):
+      add powerpc build support for openssl lib
+
+fanquake (3):
+      [build-aux] Update Boost & check macros to latest serials
+      [depends] Add -stdlib=libc++ to darwin CXX flags
+      [depends] Set OSX_MIN_VERSION to 10.8
+
+kozyilmaz (1):
+      empty spaces in PATH variable cause build failure
+
+syd (13):
+      Upgrade googletest to 1.8.0
+      Get the sec-hard tests to run correctly.
+      Update libsodium from 1.0.11 to 1.0.15
+      Remove Boost conditional compilation.
+      Update to address @daira comments wrt fixing configure.ac
+      Get rid of consensus.fPowAllowMinDifficultyBlocks.
+      Don't compile libgtest.a when building libsnark.
+      Add gtests to .gitignore
+      Get rid of fp3 from libsnark, it is not used.
+      InitGoogleMock instead of InitGoogleTest per CR
+      Get rid of underscore prefixes for include guards.
+      Rename bash completion files so that they refer to zcash and not bitcoin.
+      Fix libsnark test failure.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.15-rc1.md b/depend/zcash/doc/release-notes/release-notes-1.0.15-rc1.md
new file mode 100644
index 000000000..b4b0b2f0a
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.15-rc1.md
@@ -0,0 +1,165 @@
+Notable changes
+===============
+
+UTXO and note merging
+---------------------
+
+In order to simplify the process of combining many small UTXOs and notes into a
+few larger ones, a new RPC method `z_mergetoaddress` has been added. It merges
+funds from t-addresses, z-addresses, or both, and sends them to a single
+t-address or z-address.
+
+Unlike most other RPC methods, `z_mergetoaddress` operates over a particular
+quantity of UTXOs and notes, instead of a particular amount of ZEC. By default,
+it will merge 50 UTXOs and 10 notes at a time; these limits can be adjusted with
+the parameters `transparent_limit` and `shielded_limit`.
+
+`z_mergetoaddress` also returns the number of UTXOs and notes remaining in the
+given addresses, which can be used to automate the merging process (for example,
+merging until the number of UTXOs falls below some value).
+
+UTXO memory accounting
+----------------------
+
+The default -dbcache has been changed in this release to 450MiB. Users can set -dbcache to a higher value (e.g. to keep the UTXO set more fully cached in memory). Users on low-memory systems (such as systems with 1GB or less) should consider specifying a lower value for this parameter.
+
+Additional information relating to running on low-memory systems can be found here: [reducing-memory-usage.md](https://github.com/zcash/zcash/blob/master/doc/reducing-memory-usage.md).
+
+Changelog
+=========
+
+21E14 (1):
+      Remove obsolete reference to CValidationState from UpdateCoins.
+
+Alex Morcos (1):
+      Implement helper class for CTxMemPoolEntry constructor
+
+Ariel (2):
+      add blake2b writer
+      update SignatureHash according to Overwinter spec
+
+Ashley Holman (1):
+      TxMemPool: Change mapTx to a boost::multi_index_container
+
+Cory Fields (2):
+      chainparams: move CCheckpointData into chainparams.h
+      chainparams: don't use std namespace
+
+Daniel Kraft (1):
+      Clean up chainparams some more.
+
+Jack Grigg (38):
+      Scope the ECDSA constant sizes to CPubKey / CKey classes
+      Enable Bash completion for -exportdir
+      Check chainValueZat when checking value pool monitoring
+      Add missing namespace for boost::get
+      Add viewing key prefix to regtest parameters
+      zkey_import_export: Synchronize mempools before mining
+      Use JoinSplitTestingSetup for Boost sighash tests
+      Network upgrade activation mechanism
+      Allow changing network upgrade parameters on regtest
+      Test network upgrade logic
+      Adjust rewind logic to use the network upgrade mechanism
+      Add Overwinter to upgrade list
+      Add method for fetching the next activation height after a given block height
+      Use a boost::optional for nCachedBranchId
+      Change UI/log status message for block rewinding
+      Update quote from ZIP 200
+      Update SignatureHash tests for transaction format changes
+      Implement roll-back limit for reorganisation
+      Add rollback limit to block index rewinding
+      Remove mempool transactions which commit to an unmineable branch ID
+      Remove P2WPKH and P2WSH from signing logic
+      Add consensus branch ID parameter to SignatureHash, remove SigVersion parameter
+      Cleanup: Wrap function arguments
+      Regenerate SignatureHash tests
+      Make number of inputs configurable in validatelargetx test
+      Use v3 transactions with caching for validatelargetx benchmark
+      Extend CWallet::GetFilteredNotes to enable filtering on a set of addresses
+      Add branch IDs for current and next block to getblockchaininfo
+      Check Equihash solution when loading block index
+      Implement z_mergetoaddress for combining UTXOs and notes
+      Gate z_mergetoaddress as an experimental feature
+      Add z_mergetoaddress to release notes
+      Check upgrade status in wallet_overwintertx RPC test
+      Document that consensus.chaintip != consensus.nextblock just before an upgrade
+      Regenerate sighash tests
+      wallet_mergetoaddress: Add additional syncs to prevent race conditions
+      make-release.py: Versioning changes for 1.0.15-rc1.
+      make-release.py: Updated manpages for 1.0.15-rc1.
+
+Jay Graber (8):
+      Add getdeprecationinfo rpc call to return current version and deprecation block height.
+      Make applicable only on mainnet
+      Add upgrades field to RPC call getblockchaininfo
+      Implement transaction expiry for Overwinter
+      Add -txexpirydelta cli option
+      Add mempool_tx_expiry.py test
+      Add expiry to z_mergetoaddress
+      Change rpc_tests to 21
+
+Jonas Nick (1):
+      Reduce unnecessary hashing in signrawtransaction
+
+Jorge Timón (3):
+      Chainparams: Introduce CreateGenesisBlock() static function
+      Chainparams: CTestNetParams and CRegTestParams extend directly from CChainParams
+      Mempool: Use Consensus::CheckTxInputs direclty over main::CheckInputs
+
+Marius Kjærstad (1):
+      Changed http:// to https:// on some links
+
+Mark Friedenbach (1):
+      Explicitly set tx.nVersion for the genesis block and mining tests
+
+Matt Corallo (5):
+      Add failing test checking timelocked-txn removal during reorg
+      Fix removal of time-locked transactions during reorg
+      Fix comment in removeForReorg
+      Make indentation in ActivateBestChainStep readable
+      removeForReorg calls once-per-disconnect-> once-per-reorg
+
+Maxwell Gubler (1):
+      Fix syntax examples for z_importwallet and export
+
+Nicolas DORIER (1):
+      Unit test for sighash caching
+
+Pavel Vasin (1):
+      remove unused NOBLKS_VERSION_{START,END} constants
+
+Pieter Wuille (8):
+      Add rewind logic to deal with post-fork software updates
+      Support -checkmempool=N, which runs checks on average once every N transactions
+      Report non-mandatory script failures correctly
+      Refactor script validation to observe amounts
+      BIP143: Verification logic
+      BIP143: Signing logic
+      Precompute sighashes
+      Rename to PrecomputedTransactionData
+
+Simon Liu (11):
+      Fixes #2793. Backport commit f33afd3 to increase dbcache default.
+      Add documentation about dbcache.
+      Add note about dbcache to 1.0.15 release notes.
+      Remove redundant service flag NODE_GETUTXO meant for Bitcoin XT.
+      Implementation of Overwinter transaction format ZIP 202.
+      Add test to check malformed v1 transaction against Overwinter tx parser
+      Closes #2964. z_sendmany once again makes v1 tx for taddr to taddr.
+      Closes #2954 and #2959.  Fixes Overwinter issues in sighash_tests.
+      Add field nProtocolVersion to struct NetworkUpgrade.
+      Overwinter peer management and network handshaking.
+      Add python qa test overwinter_peer_management.
+
+Suhas Daftuar (3):
+      Track coinbase spends in CTxMemPoolEntry
+      Don't call removeForReorg if DisconnectTip fails
+      Fix removeForReorg to use MedianTimePast
+
+jc (1):
+      read hashReserved from disk block index
+
+syd (2):
+      Fix libsnark dependency build.
+      Remove OSX and Windows files from Makefile + share directory.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.15.md b/depend/zcash/doc/release-notes/release-notes-1.0.15.md
new file mode 100644
index 000000000..3195c955a
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.15.md
@@ -0,0 +1,209 @@
+Notable changes
+===============
+
+Overwinter network upgrade
+--------------------------
+
+The code preparations for the Overwinter network upgrade, as described in [ZIP
+200](https://github.com/zcash/zips/blob/master/zip-0200.rst), [ZIP
+201](https://github.com/zcash/zips/blob/master/zip-0201.rst), [ZIP
+202](https://github.com/zcash/zips/blob/master/zip-0202.rst), [ZIP
+203](https://github.com/zcash/zips/blob/master/zip-0203.rst), and [ZIP
+143](https://github.com/zcash/zips/blob/master/zip-0143.rst) are
+finished and included in this release. Overwinter will activate on testnet at
+height 207500, and can also be activated at a specific height in regtest mode
+by setting the config option `-nuparams=5ba81b19:HEIGHT`.
+
+However, because the Overwinter activation height is not yet specified for
+mainnet, version 1.0.15 will behave similarly as other pre-Overwinter releases
+even after a future activation of Overwinter on the network. Upgrading from
+1.0.15 will be required in order to follow the Overwinter network upgrade on
+mainnet.
+
+Overwinter transaction format
+-----------------------------
+
+Once Overwinter has activated, transactions must use the new v3 format
+(including coinbase transactions). All RPC methods that create new transactions
+(such as `createrawtransaction` and `getblocktemplate`) will create v3
+transactions once the Overwinter activation height has been reached.
+
+Overwinter transaction expiry
+-----------------------------
+
+Overwinter transactions created by `zcashd` will also have a default expiry
+height set (the block height after which the transaction becomes invalid) of 20
+blocks after the height of the next block. This can be configured with the
+config option `-txexpirydelta`.
+
+UTXO and note merging
+---------------------
+
+In order to simplify the process of combining many small UTXOs and notes into a
+few larger ones, a new RPC method `z_mergetoaddress` has been added. It merges
+funds from t-addresses, z-addresses, or both, and sends them to a single
+t-address or z-address.
+
+Unlike most other RPC methods, `z_mergetoaddress` operates over a particular
+quantity of UTXOs and notes, instead of a particular amount of ZEC. By default,
+it will merge 50 UTXOs and 10 notes at a time; these limits can be adjusted with
+the parameters `transparent_limit` and `shielded_limit`.
+
+`z_mergetoaddress` also returns the number of UTXOs and notes remaining in the
+given addresses, which can be used to automate the merging process (for example,
+merging until the number of UTXOs falls below some value).
+
+UTXO memory accounting
+----------------------
+
+The default `-dbcache` has been changed in this release to 450MiB. Users can set
+`-dbcache` to a higher value (e.g. to keep the UTXO set more fully cached in
+memory). Users on low-memory systems (such as systems with 1GB or less) should
+consider specifying a lower value for this parameter.
+
+Additional information relating to running on low-memory systems can be found
+here: [reducing-memory-usage.md](https://github.com/zcash/zcash/blob/master/doc/reducing-memory-usage.md).
+
+Changelog
+=========
+
+21E14 (1):
+      Remove obsolete reference to CValidationState from UpdateCoins.
+
+Alex Morcos (1):
+      Implement helper class for CTxMemPoolEntry constructor
+
+Ariel (2):
+      add blake2b writer
+      update SignatureHash according to Overwinter spec
+
+Ashley Holman (1):
+      TxMemPool: Change mapTx to a boost::multi_index_container
+
+Cory Fields (2):
+      chainparams: move CCheckpointData into chainparams.h
+      chainparams: don't use std namespace
+
+Daniel Kraft (1):
+      Clean up chainparams some more.
+
+Jack Grigg (43):
+      Scope the ECDSA constant sizes to CPubKey / CKey classes
+      Enable Bash completion for -exportdir
+      Check chainValueZat when checking value pool monitoring
+      Add missing namespace for boost::get
+      Add viewing key prefix to regtest parameters
+      zkey_import_export: Synchronize mempools before mining
+      Use JoinSplitTestingSetup for Boost sighash tests
+      Network upgrade activation mechanism
+      Allow changing network upgrade parameters on regtest
+      Test network upgrade logic
+      Adjust rewind logic to use the network upgrade mechanism
+      Add Overwinter to upgrade list
+      Add method for fetching the next activation height after a given block height
+      Use a boost::optional for nCachedBranchId
+      Change UI/log status message for block rewinding
+      Update quote from ZIP 200
+      Update SignatureHash tests for transaction format changes
+      Implement roll-back limit for reorganisation
+      Add rollback limit to block index rewinding
+      Remove mempool transactions which commit to an unmineable branch ID
+      Remove P2WPKH and P2WSH from signing logic
+      Add consensus branch ID parameter to SignatureHash, remove SigVersion parameter
+      Cleanup: Wrap function arguments
+      Regenerate SignatureHash tests
+      Make number of inputs configurable in validatelargetx test
+      Use v3 transactions with caching for validatelargetx benchmark
+      Extend CWallet::GetFilteredNotes to enable filtering on a set of addresses
+      Add branch IDs for current and next block to getblockchaininfo
+      Check Equihash solution when loading block index
+      Implement z_mergetoaddress for combining UTXOs and notes
+      Gate z_mergetoaddress as an experimental feature
+      Add z_mergetoaddress to release notes
+      Check upgrade status in wallet_overwintertx RPC test
+      Document that consensus.chaintip != consensus.nextblock just before an upgrade
+      Regenerate sighash tests
+      wallet_mergetoaddress: Add additional syncs to prevent race conditions
+      make-release.py: Versioning changes for 1.0.15-rc1.
+      make-release.py: Updated manpages for 1.0.15-rc1.
+      make-release.py: Updated release notes and changelog for 1.0.15-rc1.
+      Use block hash comparison for consistency check when loading block index
+      Overwinter release notes and testnet activation height
+      make-release.py: Versioning changes for 1.0.15.
+      make-release.py: Updated manpages for 1.0.15.
+
+Jay Graber (8):
+      Add getdeprecationinfo rpc call to return current version and deprecation block height.
+      Make applicable only on mainnet
+      Add upgrades field to RPC call getblockchaininfo
+      Implement transaction expiry for Overwinter
+      Add -txexpirydelta cli option
+      Add mempool_tx_expiry.py test
+      Add expiry to z_mergetoaddress
+      Change rpc_tests to 21
+
+Jonas Nick (1):
+      Reduce unnecessary hashing in signrawtransaction
+
+Jorge Timón (3):
+      Chainparams: Introduce CreateGenesisBlock() static function
+      Chainparams: CTestNetParams and CRegTestParams extend directly from CChainParams
+      Mempool: Use Consensus::CheckTxInputs direclty over main::CheckInputs
+
+Marius Kjærstad (1):
+      Changed http:// to https:// on some links
+
+Mark Friedenbach (1):
+      Explicitly set tx.nVersion for the genesis block and mining tests
+
+Matt Corallo (5):
+      Add failing test checking timelocked-txn removal during reorg
+      Fix removal of time-locked transactions during reorg
+      Fix comment in removeForReorg
+      Make indentation in ActivateBestChainStep readable
+      removeForReorg calls once-per-disconnect-> once-per-reorg
+
+Maxwell Gubler (1):
+      Fix syntax examples for z_importwallet and export
+
+Nicolas DORIER (1):
+      Unit test for sighash caching
+
+Pavel Vasin (1):
+      remove unused NOBLKS_VERSION_{START,END} constants
+
+Pieter Wuille (8):
+      Add rewind logic to deal with post-fork software updates
+      Support -checkmempool=N, which runs checks on average once every N transactions
+      Report non-mandatory script failures correctly
+      Refactor script validation to observe amounts
+      BIP143: Verification logic
+      BIP143: Signing logic
+      Precompute sighashes
+      Rename to PrecomputedTransactionData
+
+Simon Liu (11):
+      Fixes #2793. Backport commit f33afd3 to increase dbcache default.
+      Add documentation about dbcache.
+      Add note about dbcache to 1.0.15 release notes.
+      Remove redundant service flag NODE_GETUTXO meant for Bitcoin XT.
+      Implementation of Overwinter transaction format ZIP 202.
+      Add test to check malformed v1 transaction against Overwinter tx parser
+      Closes #2964. z_sendmany once again makes v1 tx for taddr to taddr.
+      Closes #2954 and #2959.  Fixes Overwinter issues in sighash_tests.
+      Add field nProtocolVersion to struct NetworkUpgrade.
+      Overwinter peer management and network handshaking.
+      Add python qa test overwinter_peer_management.
+
+Suhas Daftuar (3):
+      Track coinbase spends in CTxMemPoolEntry
+      Don't call removeForReorg if DisconnectTip fails
+      Fix removeForReorg to use MedianTimePast
+
+jc (1):
+      read hashReserved from disk block index
+
+syd (2):
+      Fix libsnark dependency build.
+      Remove OSX and Windows files from Makefile + share directory.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.2.md b/depend/zcash/doc/release-notes/release-notes-1.0.2.md
new file mode 100644
index 000000000..2625cb909
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.2.md
@@ -0,0 +1,16 @@
+ITH4Coinomia (2):
+      Update security-warnings.md
+      Update init.cpp
+
+S. Matthew English (1):
+      enforcing consistency 'tor' to 'Tor'
+
+Sean Bowe (1):
+      Write R1CS output to file in GenerateParams.
+
+Simon (4):
+      Fixes #1762 segfault when miner is interrupted.
+      Fixes #1779 so that sending to multiple zaddrs no longer fails.
+      Add GenIdentity, an identity function for MappedShuffle.
+      Add transaction size and zaddr output limit checks to z_sendmany.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.3.md b/depend/zcash/doc/release-notes/release-notes-1.0.3.md
new file mode 100644
index 000000000..ae4e25b25
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.3.md
@@ -0,0 +1,35 @@
+Jack Grigg (5):
+      Add --disable-tests flag to zcutils/build.sh
+      Correctly set CNoteData::witnessHeight when decrementing witness caches
+      Copy over CNoteData::witnessHeight when updating wallet tx
+      Add code comments about CNoteData::witnessHeight
+      Clear witnessHeight and nWitnessCacheSize in ClearNoteWitnessCache
+
+Jay Graber (4):
+      Document z_sendmany error code messages in payment-api.md
+      s/Bitcoin/Zcash in JSONRPCError
+      Change format of z_sendmany error code documentation.
+      Release-notes.py script to generate release notes and add contributors to authors.md
+
+Sean Bowe (7):
+      Regression test for constraint system violation.
+      Improve accuracy of constraint system violation diagnostics.
+      Add tests for witness `element` and tree `last` methods. Strengthen testing by inserting a different commitment into the tree at each step.
+      Initialize after profiling messages are suppressed.
+      Process verification keys to perform online verification.
+      Add test that `last` and `element` will throw exception when the tree is blank.
+      Anchors and nullifiers should always be inherited from the parent cache.
+
+Simon (8):
+      Closes #1833.  Format currency amounts in z_sendmany error message.
+      Closes #1680, temporary fix for rpc deadlock inherited from upstream.
+      Set default minrelaytxfee to 1000 zatoshis to match upstream.
+      Mempool will accept tx with joinsplits and the default z_sendmany fee.
+      Track the correct change witness across chained joinsplits
+      Closes #1854. z_sendmany selects more utxos to avoid dust change output.
+      Partial revert of bd87e8c: file release-notes-1.0.2.md to 343b0d6.
+      Fix threading issue when initializing public params.
+
+ayleph (1):
+      Correct spelling error in z_sendmany error output
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.4.md b/depend/zcash/doc/release-notes/release-notes-1.0.4.md
new file mode 100644
index 000000000..1cb73c393
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.4.md
@@ -0,0 +1,75 @@
+Bitcoin Error Log (1):
+      Edit for grammar: "block chain"
+
+Christian von Roques (1):
+      bash-completion: Adapt for 0.12 and 0.13
+
+Jack Grigg (32):
+      Add getlocalsolps and getnetworksolps RPC calls, show them in getmininginfo
+      Add benchmark for attempting decryption of notes
+      Add benchmark for incrementing note witnesses
+      Add -metricsui flag to toggle between persistent screen and rolling metrics
+      Add -metricsrefreshtime option
+      Only show metrics by default if stdout is a TTY
+      Document metrics screen options
+      Clarify that metrics options are only useful without -daemon and -printtoconsole
+      Increase length of metrics divider
+      Write witness caches when writing the best block
+      Apply miniupnpc patches to enable compilation on Solaris 11
+      Add an upstream miniupnpc patch revision
+      Address review comments, tweak strings
+      Change function names to not clash with Bitcoin, apply to correct binaries
+      Add bash completion files to Debian package
+      Always bash-complete the default account
+      Add Zcash RPC commands to CLI argument completion
+      Document behaviour of CWallet::SetBestChain
+      Fix indentation
+      Generate JS for trydecryptnotes, make number of addresses a variable
+      Add JS to second block to ensure witnesses are incremented
+      Skip JoinSplit verification before the last checkpoint
+      Add a reindex test that fails because of a bug in decrementing witness caches
+      Make the test pass by fixing the bug!
+      Only check cache validity for witnesses being incremented or decremented
+      Fix bug in wallet tests
+      Extract block-generation wallet test code into a function
+      Rewrite reindex test to check beyond the max witness cache size
+      Fix bug in IncrementNoteWitness()
+      Update payment API docs to recommend -rescan for fixing witness errors
+      Update version to 1.0.4
+      Update man pages
+
+Jay Graber (2):
+      Replace bitcoin with zcash in rpcprotocol.cpp
+      Gather release notes from previous release to HEAD
+
+Jeffrey Walton (1):
+      Add porter dev overrides for CC, CXX, MAKE, BUILD, HOST
+
+Scott (1):
+      Metrics - Don't exclaim unless > 1
+
+Sean Bowe (8):
+      Isolate verification to a `ProofVerifier` context object that allows verification behavior to be tuned by the caller.
+      Regression test.
+      Ensure cache contains valid entry when anchor is popped.
+      Ensure ProofVerifier cannot be accidentally copied.
+      Rename Dummy to Disabled.
+      Add more tests for ProofVerifier.
+      ASSERT_TRUE -> ASSERT_FALSE
+      Check that E' points are actually in G2 by ensuring they are of order r.
+
+Simon Liu (8):
+      Fix stale comment referencing upstream block interval
+      Add checkpoint at block height 15000
+      Closes #1857. Fixes bug where tx spending only notes had priority of 0.
+      Closes #1901. Increase default settings for the max block size when     mining and the amount of space available for priority transactions.
+      Closes #1903. Add fee parameter to z_sendmany.
+      Fixes #1823. Witness anchors for input notes no longer cross block boundaries.
+      Increase timeout as laptops on battery power have cpu throttling.
+      WitnessAnchorData only needs to store one witness per JSOutPoint.
+
+lpescher (3):
+      Make command line option to show all debugging consistent with similar options
+      Update documentation to match the #4219 change
+      Update help message to match the #4219 change
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.5.md b/depend/zcash/doc/release-notes/release-notes-1.0.5.md
new file mode 100644
index 000000000..7e2c6e1c8
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.5.md
@@ -0,0 +1,58 @@
+Eran Tromer (1):
+      CreateJoinSplit: add start_profiling() call
+
+Jack Grigg (22):
+      Extend createjoinsplit to benchmark parallel JoinSplits
+      Add total number of commitments to getblockchaininfo
+      Only enable getblocktemplate when wallet is enabled
+      Only run wallet tests when wallet is enabled
+      Add a tool for profiling the creation of JoinSplits
+      Exclude test binaries from make install
+      Scan the whole chain whenever a z-key is imported
+      Instruct users to run zcash-fetch-params if network params aren't available
+      Trigger metrics UI refresh on new messages
+      Strip out the SECURE flag in metrics UI so message style is detected
+      Handle newlines in UI messages
+      Suggest ./zcutil/fetch-params.sh as well
+      Update debug categories
+      Rename build-aux/m4/bitcoin_find_bdb48.m4 to remove version
+      Throw an error if zcash.conf is missing
+      Show a friendly message explaining why zcashd needs a zcash.conf
+      Fix gtest ordering broken by #1949
+      Debian package lint
+      Generate Debian control file to fix shlibs lint
+      Create empty zcash.conf during performance measurements
+      Create empty zcash.conf during coverage checks
+      Coverage build system tweaks
+
+Jay Graber (1):
+      Update release process to check in with users who opened resolved issues
+
+Paige Peterson (2):
+      Create ISSUE_TEMPLATE.md
+      move template to subdirectory, fix typo, include prompt under describing issue section, include uploading file directly to github ticket as option for sharing logs
+
+Sean Bowe (4):
+      Add test for IncrementalMerkleTree::size().
+      Add 'CreateJoinSplit' standalone utility to gitignore.
+      Add test for z_importkey rescanning from beginning of chain.
+      Bump version to 1.0.5.
+
+Simon Liu (13):
+      Fixes #1964 to catch general exception in z_sendmany and catch exceptions as reference-to-const.
+      Fixes #1967 by adding age of note to z_sendmany logging.
+      Fixes a bug where the unsigned transaction was logged by z_sendmany after a successful sign and send, meaning that the logged hash fragment would be different from the txid logged by "AddToWallet".  This issue occured when sending from transparent addresses, as utxo inputs must be signed.  It did not occur when sending from shielded addresses.
+      Bump COPYRIGHT_YEAR from 2016 to 2017.
+      Closes #1780. Result of z_getoperationstatus now sorted by creation time of operation
+      Remove UTF-8 BOM efbbbf from zcash.conf to avoid problems with command line tools
+      Closes #1097 so zcash-cli now displays license info like zcashd.
+      Fixes #1497 ZCA-009 by restricting data exporting to user defined folder.
+      Closes #1957 by adding tx serialization size to listtransactions output.
+      Fixes #1960: z_getoperationstatus/result now includes operation details.
+      Update walletbackup.py qa test to use -exportdir option
+      Add missing header required by std::accumulate
+      Increase timeout for z_sendmany transaction in wallet.py qa test
+
+Wladimir J. van der Laan (1):
+      rpc: Implement random-cookie based authentication
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.6.md b/depend/zcash/doc/release-notes/release-notes-1.0.6.md
new file mode 100644
index 000000000..c1ae03605
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.6.md
@@ -0,0 +1,148 @@
+Cory Fields (4):
+      Depends: Add ZeroMQ package
+      travis: install a recent libzmq and pyzmq for tests
+      build: Make use of ZMQ_CFLAGS
+      build: match upstream build change
+
+Daira Hopwood (2):
+      Better error reporting for the !ENABLE_WALLET && ENABLE_MINING case.
+      Address @str4d's comment about the case where -gen is not set. Also avoid shadowing mineToLocalWallet variable.
+
+Daniel Cousens (3):
+      init: amend ZMQ flag names
+      init: add zmq to debug categories
+      zmq: prepend zmq to debug messages
+
+Jack Grigg (33):
+      Update comment
+      Remove OpenSSL PRNG reseeding
+      Address review comments
+      Fix linking error in CreateJoinSplit
+      Add compile flag to disable compilation of mining code
+      Upgrade OpenSSL to 1.1.0d
+      Show all JoinSplit components in getrawtransaction and decoderawtransaction
+      Use a more specific exception class for note decryption failure
+      Switch miner to P2PKH, add -mineraddress option
+      Update help text for mining options
+      Correct #ifdef nesting of miner headers and helper functions
+      Add ZMQ libs to zcash-gtest
+      Fix python syntax in ZMQ RPC test
+      [qa] py2: Unfiddle strings into bytes explicitly in ZMQ RPC test
+      Bitcoin -> Zcash in ZMQ docs
+      Add ZeroMQ license to contrib/debian/copyright
+      [depends] ZeroMQ 4.2.1
+      Clarify that user only needs libzmq if not using depends system
+      Bump suggested ZMQ Debian package to 4.1 series
+      Add -minetolocalwallet flag, enforced on -mineraddress
+      Add test to check for presence of vpub_old & vpub_new in getrawtransaction
+      Add a flag for enabling experimental features
+      Require -experimentalmode for wallet encryption
+      Migrate Zcash-specific code to UniValue
+      Manually iterate over UniValue arrays in tests
+      Remove JSON Spirit from contrib/debian/copyright
+      unsigned int -> size_t for comparing with UniValue.size()
+      [cleanup] Remove unused import
+      [cleanup] Simplify test code
+      Squashed 'src/univalue/' content from commit 9ef5b78
+      Update UniValue includes in Zcash-specific code
+      UniValue::getValues const reference
+      Get rid of fPlus argument to FormatMoney in Zcash-specific code
+
+Jeff Garzik (4):
+      Add ZeroMQ support. Notify blocks and transactions via ZeroMQ
+      UniValue: prefer .size() to .count(), to harmonize w/ existing tree
+      UniValue: export NullUniValue global constant
+      Convert tree to using univalue. Eliminate all json_spirit uses.
+
+Johnathan Corgan (5):
+      zmq: require version 4.x or newer of libzmq
+      zmq: update and cleanup build-unix, release-notes, and zmq docs
+      autotools: move checking for zmq library to common area in configure.ac
+      zmq: update docs to reflect feature is compiled in automatically if possible
+      zmq: point API link to 4.0 as that is what we are conforming to [Trivial]
+
+Jonas Schnelli (24):
+      QA: Add ZeroMQ RPC test
+      depends: fix platform specific packages variable
+      [travis] add zmq python module
+      use CBlockIndex* insted of uint256 for UpdatedBlockTip signal
+      [ZMQ] refactor message string
+      [ZMQ] append a message sequence number to every ZMQ notification
+      fix rpc-tests.sh
+      extend conversion to UniValue
+      expicit set UniValue type to avoid empty values
+      special threatment for null,true,false because they are non valid json
+      univalue: add support for real, fix percision and make it json_spirit compatible
+      univalue: correct bool support
+      fix rpc unit test, plain numbers are not JSON compatible object
+      remove JSON Spirit UniValue wrapper
+      Remove JSON Spirit wrapper, remove JSON Spirit leftovers
+      fix rpc batching univalue issue
+      fix missing univalue types during constructing
+      fix univalue json parse tests
+      univalue: add type check unit tests
+      fix util_tests.cpp clang warnings
+      fix rpcmining/getblocktemplate univalue transition logic error
+      remove univalue, prepare for subtree
+      [Univalue] add univalue over subtree
+      remove $(@F) and subdirs from univalue make
+
+João Barbosa (2):
+      Add UpdatedBlockTip signal to CMainSignals and CValidationInterface
+      Fix ZMQ Notification initialization and shutdown
+
+Paragon Initiative Enterprises, LLC (1):
+      Use libsodium's CSPRNG instead of OpenSSL's
+
+Scott (1):
+      Update random.h
+
+Sean Bowe (3):
+      Bump protocol version in release process if necessary.
+      Fix use after free in transaction_tests.
+      Update libsnark.
+
+Simon Liu (16):
+      Closes #2057 by adding extra zrpcunsafe logging
+      Update z_sendmany logging
+      Add test to verify z_sendmany logging
+      Update test to verify order of zrpcunsafe log messages
+      Closes #2045 by allowing z_sendmany with 0 fee
+      Closes #2024 by documenting and testing method field in z_getoperationstatus
+      Add parameter interaction, where zrpcunsafe implies zrpc
+      Update zrpc vs zrpcunsafe logging in z_sendmany operation
+      Add test for z_sendmany with fee of 0
+      Update test to check for more joinsplit related fields in getrawtransaction
+      Add comment about fix for #2026.
+      Update test to check for updated error messages in AmountFromValue().
+      Bump version to 1.0.6 as part of release process
+      Debian man pages updated as part of release process
+      Update release notes as part of release process
+      Update debian changelog as part of release process
+
+Wladimir J. van der Laan (10):
+      Simplify RPCclient, adapt json_parse_error test
+      util: Add ParseInt64 and ParseDouble functions
+      univalue: add strict type checking
+      Don't go through double in AmountFromValue and ValueFromAmount
+      Get rid of fPlus argument to FormatMoney
+      Changes necessary now that zero values accepted in AmountFromValue
+      rpc: Accept scientific notation for monetary amounts in JSON
+      rpc: Make ValueFromAmount always return 8 decimals
+      univalue: Avoid unnecessary roundtrip through double for numbers
+      util: use locale-independent parsing in ParseDouble
+
+fanquake (3):
+      [depends] zeromq 4.0.7
+      [depends] ZeroMQ 4.1.4
+      [depends] ZeroMQ 4.1.5
+
+isle2983 (1):
+      [copyright] add MIT License copyright header to zmq_sub.py
+
+mrbandrews (1):
+      Fixes ZMQ startup with bad arguments.
+
+paveljanik (1):
+      [Trivial] start the help texts with lowercase
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.7-1.md b/depend/zcash/doc/release-notes/release-notes-1.0.7-1.md
new file mode 100644
index 000000000..6474eb628
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.7-1.md
@@ -0,0 +1,4 @@
+Jay Graber (3):
+      Add -t to git fetch for release-notes.py
+      Update version to 1.0.7-1
+      Update auto-generated manpages to 1.0.7-1
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.7.md b/depend/zcash/doc/release-notes/release-notes-1.0.7.md
new file mode 100644
index 000000000..94681f0d8
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.7.md
@@ -0,0 +1,165 @@
+Adam Weiss (1):
+      Buffer log messages and explicitly open logs
+
+Alex van der Peet (1):
+      New RPC command disconnectnode
+
+Allan Niemerg (1):
+      Pause mining during joinsplit creation
+
+Casey Rodarmor (1):
+      Don't share objects between TestInstances
+
+Cory Fields (2):
+      locking: teach Clang's -Wthread-safety to cope with our scoped lock macros
+      locking: add a quick example of GUARDED_BY
+
+Daira Hopwood (1):
+      Don't assume sizes of unsigned short and unsigned int in GetSizeOfCompactSize and WriteCompactSize. Fixes #2137
+
+Daniel Kraft (1):
+      Fix univalue handling of \u0000 characters.
+
+Florian Schmaus (1):
+      Add BITCOIND_SIGTERM_TIMEOUT to OpenRC init scripts
+
+Forrest Voight (1):
+      When processing RPC commands during warmup phase, parse the request object before returning an error so that id value can be used in the response.
+
+Gavin Andresen (2):
+      configure --enable-debug changes
+      Testing infrastructure: mocktime fixes
+
+Jack Grigg (11):
+      Remove reference to -reindex-chainstate
+      Treat metrics screen as non-interactive for now
+      Adjust gen-manpages.sh for Zcash, use in Debian builds
+      Regenerate and collate Zcash manpages, delete Bitcoin ones
+      Update release process with gen-manpages.sh
+      Adjust blockheaderToJSON() for Zcash block header
+      Adjust fundrawtransaction RPC test for Zcash
+      Re-encode t-addrs in disablewallet.py with Zcash prefixes
+      BTC -> ZEC in paytxfee RPC docs
+      Update default RPC port in help strings
+      Fix typo in listbanned RPC keys
+
+Jay Graber (4):
+      Add rpc test for prioritisetransaction
+      Inc num of txs in test mempool
+      Update release to 1.0.7, generate manpages
+      Add 1.0.7 release notes and update authors.md
+
+Jonas Schnelli (23):
+      [net] extend core functionallity for ban/unban/listban
+      [RPC] add setban/listbanned/clearbanned RPC commands
+      [QA] add setban/listbanned/clearbanned tests
+      [net] remove unused return type bool from CNode::Ban()
+      [RPC] extend setban to allow subnets
+      rename json field "bannedtill" to "banned_until"
+      setban: rewrite to UniValue, allow absolute bantime
+      fix CSubNet comparison operator
+      setban: add RPCErrorCode
+      add RPC tests for setban & disconnectnode
+      fix missing lock in CNode::ClearBanned()
+      setban: add IPv6 tests
+      fix lock issue for QT node diconnect and RPC disconnectnode
+      fundrawtransaction tests
+      UniValue: don't escape solidus, keep espacing of reverse solidus
+      [REST] add JSON support for /rest/headers/
+      [QA] fix possible reorg issue in rawtransaction.py/fundrawtransaction.py RPC test
+      [QA] remove rawtransactions.py from the extended test list
+      [QA] add testcases for parsing strings as values
+      [bitcoin-cli] improve error output
+      fix and extend CBitcoinExtKeyBase template
+      extend bip32 tests to cover Base58c/CExtKey decode
+      don't try to decode invalid encoded ext keys
+
+Jorge Timón (1):
+      Consensus: Refactor: Separate Consensus::CheckTxInputs and GetSpendHeight in CheckInputs
+
+Leo Arias (1):
+      Fix the path to the example configuration
+
+Luke Dashjr (1):
+      Fix various warnings
+
+Matt Corallo (4):
+      Small tweaks to CCoinControl for fundrawtransaction
+      Add FundTransaction method to wallet
+      Add fundrawtransaction RPC method
+      Assert on probable deadlocks if the second lock isnt try_lock
+
+Murilo Santana (1):
+      Fix sha256sum on busybox by using -c instead of --check
+
+Paul Georgiou (1):
+      Update Linearize tool to support Windows paths
+
+Pavel Vasin (1):
+      remove unused inv from ConnectTip()
+
+Peter Todd (2):
+      Add getblockheader RPC call
+      Improve comment explaining purpose of MAX_MONEY constant
+
+Philip Kaufmann (3):
+      use const references where appropriate
+      [init] add -blockversion help and extend -upnp help
+      make CAddrMan::size() return the correct type of size_t
+
+Pieter Wuille (3):
+      Do not ask a UI question from bitcoind
+      Add DummySignatureCreator which just creates zeroed sigs
+      Reduce checkpoints' effect on consensus.
+
+Simon Liu (14):
+      Alert 1000
+      Alert 1001
+      Add assert to check alert message length is valid
+      Fix bug where test was generating but not saving keys to wallet on disk.
+      Update founders reward addresses for testnet
+      Keep first three original testnet fr addresses so existing coinbase transactions on testnet remain valid during upgrade.  New addresses will be used starting from block 53127.
+      Closes #2083 and #2088. Update release process documentation
+      Closes #2084. Fix incorrect year in timestamp.
+      Closes #2112 where z_getoperationresult could return stale status.
+      Add mainnet checkpoint at block 67500
+      Add testnet checkpoint at block 38000
+      Closes #1969. Default fee now sufficient for large shielded tx.
+      Part of #1969. Changing min fee calculation also changes the dust threshold.
+      Part of #1969. Update tests to avoid error 'absurdly high fee' from change in min fee calc.
+
+Stephen (1):
+      Add paytxfee to getwalletinfo, warnings to getnetworkinfo
+
+Wladimir J. van der Laan (10):
+      rpc: make `gettxoutsettinfo` run lock-free
+      test: Move reindex test to standard tests
+      rpc: Remove chain-specific RequireRPCPassword
+      univalue: Avoid unnecessary roundtrip through double for numbers
+      rpc: Accept strings in AmountFromValue
+      Fix crash in validateaddress with -disablewallet
+      Improve proxy initialization
+      tests: Extend RPC proxy tests
+      build: Remove -DBOOST_SPIRIT_THREADSAFE
+      tests: Fix bitcoin-tx signing testcase
+
+dexX7 (1):
+      Return all available information via validateaddress
+
+mruddy (1):
+      add tests for the decodescript rpc. add mention of the rpc regression tests to the testing seciton of the main readme.
+
+nomnombtc (9):
+      add script to generate manpages with help2man
+      add gen-manpages.sh description to README.md
+      add autogenerated manpages by help2man
+      add doc/man/Makefile.am to include manpages
+      add doc/man to subdir if configure flag --enable-man is set
+      add conditional for --enable-man, default is yes
+      change help string --enable-man to --disable-man
+      regenerated all manpages with commit tag stripped, also add bitcoin-tx
+      improved gen-manpages.sh, includes bitcoin-tx and strips commit tag, now also runs binaries from build dir by default, added variables for more control
+
+zathras-crypto (1):
+      Exempt unspendable transaction outputs from dust checks
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.8-1.md b/depend/zcash/doc/release-notes/release-notes-1.0.8-1.md
new file mode 100644
index 000000000..4650f552c
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.8-1.md
@@ -0,0 +1,16 @@
+Daira Hopwood (3):
+      Don't rely on a finite upper bound on fee rate or priority.
+      Simplify JoinSplit priority calculation. refs 1896
+      Add check for JoinSplit priority as calculated by CCoinsViewCache::GetPriority.
+
+Jack Grigg (1):
+      Use a larger -rpcclienttimeout for slow performance measurements
+
+Nathan Wilcox (2):
+      Bump version numbers for v1.0.8-1.
+      Commit the changes from gen-manpages.sh, except manually tweak the version strings.
+
+str4d (2):
+      Update tests to check actual infinity as well as INF_FEERATE
+      Add unit test for security issue 2017-04-11.a
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.8.md b/depend/zcash/doc/release-notes/release-notes-1.0.8.md
new file mode 100644
index 000000000..7d6460c88
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.8.md
@@ -0,0 +1,170 @@
+Adam Brown (1):
+      [doc] Update port in tor.md
+
+Bob McElrath (1):
+      Add explicit shared_ptr constructor due to C++11 error
+
+Cory Fields (2):
+      libevent: add depends
+      libevent: Windows reuseaddr workaround in depends
+
+Daira Hopwood (15):
+      Remove src/qt.
+      License updates for removal of src/qt.
+      Correct license text for LGPL.
+      Remove QT gunk from Makefiles.
+      Remove some more QT-related stragglers.
+      Update documentation for QT removal.
+      Update which libraries are allowed to be linked to zcashd by symbol-check.py.
+      Remove NO_QT make option.
+      .gitignore cache/ and venv-mnf/
+      Remove unused packages and patches.
+      Delete -rootcertificates from bash completion script.
+      Line-wrap privacy notice. Use <> around URL and end sentence with '.'. Include privacy notice in help text for zcashd -help.
+      Update version numbers.
+      Improvement to release process doc.
+      Generate man pages.
+
+Daniel Cousens (1):
+      torcontrol: only output disconnect if -debug=tor
+
+Gregory Maxwell (3):
+      Avoid a compile error on hosts with libevent too old for EVENT_LOG_WARN.
+      Do not absolutely protect local peers from eviction.
+      Decide eviction group ties based on time.
+
+Ian Kelling (1):
+      Docs: add details to -rpcclienttimeout doc
+
+Jack Gavigan (2):
+      Removed markdown from COPYING
+      Updated the Bitcoin Core copyright statement
+
+Jack Grigg (25):
+      Add anchor to output of getblock
+      Migrate IncrementalMerkleTree memory usage calls
+      Add tests for getmempoolinfo
+      Usability improvements for z_importkey
+      Implement an AtomicTimer
+      Use AtomicTimer for more accurate local solution rate
+      Metrics: Move local solution rate into stats
+      Metrics: Improve mining status
+      Expand on reasons for mining being paused
+      Simplify z_importkey by making rescan a string
+      Revert "Closes #1680, temporary fix for rpc deadlock inherited from upstream."
+      Add libevent to zcash-gtest
+      [depends] libevent 2.1.8
+      Test boolean fallback in z_importkey
+      Require that z_importkey height parameter be in valid range
+      Update LocalSolPS test
+      Add AtomicTimer tests
+      Revert "Revert "rpc-tests: re-enable rpc-tests for Windows""
+      Wrap error string
+      Fix typo
+      torcontrol: Improve comments
+      torcontrol: Add unit tests for Tor reply parsers
+      torcontrol: Fix ParseTorReplyMapping
+      torcontrol: Check for reading errors in ReadBinaryFile
+      torcontrol: Log invalid parameters in Tor reply strings where meaningful
+
+Jay Graber (5):
+      Document returned results of submitblock
+      Edit release-process.md for clarity
+      Add security warning to zcash-cli --help and --version message output
+      Add security warning to zcashd metrics display
+      Add security message to license text, rm url from translation string
+
+Jonas Schnelli (1):
+      Fix torcontrol.cpp unused private field warning
+
+Karl-Johan Alm (4):
+      Added std::unique_ptr<> wrappers with deleters for libevent modules.
+      Switched bitcoin-cli.cpp to use RAII unique pointers with deleters.
+      Added some simple tests for the RAII-style events.
+      Added EVENT_CFLAGS to test makefile to explicitly include libevent headers.
+
+Luke Dashjr (1):
+      Skip RAII event tests if libevent is built without event_set_mem_functions
+
+MarcoFalke (2):
+      [doc] [tor] Clarify when to use bind
+      torcontrol debug: Change to a blanket message that covers both cases
+
+Matt Quinn (1):
+      Consolidate individual references to the current maximum peer connection value of 125 into a single constant declaration.
+
+Nathaniel Mahieu (1):
+      Clarify documentation for running a tor node
+
+Patrick Strateman (1):
+      Remove vfReachable and modify IsReachable to only use vfLimited.
+
+Pavel Janík (3):
+      Implement REST mempool API, add test and documentation.
+      Prevent -Wshadow warnings with gcc versions 4.8.5, 5.3.1 and 6.2.1.
+      Make some global variables less-global (static)
+
+Peter Todd (2):
+      Better error message if Tor version too old
+      Connect to Tor hidden services by default
+
+Pieter Wuille (3):
+      Implement accurate memory accounting for mempool
+      Separate core memory usage computation in core_memusage.h
+      Fix interrupted HTTP RPC connection workaround for Python 3.5+
+
+Sean Bowe (2):
+      Introduce librustzcash and Rust to depends system.
+      Allow Rust-language related assets to be disabled with `--disable-rust`.
+
+Simon Liu (4):
+      Remove stale Qt comments and dead code
+      Remove QT translation support files
+      Remove redundant gui options from build scripts
+      Closes #2186. RPC getblock now accepts height or hash.
+
+Wladimir J. van der Laan (28):
+      doc: remove documentation for rpcssl
+      qa: Remove -rpckeepalive tests from httpbasics
+      Remove rpc_boostasiotocnetaddr test
+      build: build-system changes for libevent
+      tests: GET requests cannot have request body, use POST in rest.py
+      evhttpd implementation
+      Implement RPCTimerHandler for Qt RPC console
+      Document options for new HTTP/RPC server in --help
+      Fix race condition between starting HTTP server thread and setting EventBase()
+      Move windows socket init to utility function
+      Revert "rpc-tests: re-enable rpc-tests for Windows"
+      init: Ignore SIGPIPE
+      http: Disable libevent debug logging, if not explicitly enabled
+      rpc: Split option -rpctimeout into -rpcservertimeout and -rpcclienttimeout
+      Make RPC tests cope with server-side timeout between requests
+      chain: define enum used as bit field as uint32_t
+      auto_ptr → unique_ptr
+      bitcoin-cli: More detailed error reporting
+      depends: Add libevent compatibility patch for windows
+      bitcoin-cli: Make error message less confusing
+      test: Avoid ConnectionResetErrors during RPC tests
+      net: Automatically create hidden service, listen on Tor
+      torcontrol improvements and fixes
+      doc: update docs for Tor listening
+      tests: Disable Tor interaction
+      Fix memleak in TorController [rework]
+      tor: Change auth order to only use HASHEDPASSWORD if -torpassword
+      torcontrol: Explicitly request RSA1024 private key
+
+calebogden (1):
+      Fixing typos on security-check.py and torcontrol.cpp
+
+fanquake (1):
+      [depends] libevent 2.1.7rc
+
+instagibbs (1):
+      Add common failure cases for rpc server connection failure
+
+paveljanik (1):
+      [TRIVIAL] Fix typo: exactmath -> exactmatch
+
+unsystemizer (1):
+      Clarify `listenonion`
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.0.9.md b/depend/zcash/doc/release-notes/release-notes-1.0.9.md
new file mode 100644
index 000000000..a1335ec97
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.0.9.md
@@ -0,0 +1,90 @@
+Amgad Abdelhafez (2):
+      Update timedata.cpp
+      Update timedata.cpp
+
+Daira Hopwood (4):
+      Fix an error reporting bug due to BrokenPipeError and ConnectionResetError not existing in Python 2. refs #2263
+      Alert 1002 (versions 1.0.0-1.0.2 inclusive).
+      Alert 1003 (versions 1.0.3-1.0.8 inclusive).
+      Disable building Proton by default.
+
+Jack Grigg (14):
+      Fix prioritisetransaction RPC test
+      torcontrol: Handle escapes in Tor QuotedStrings
+      torcontrol: Add missing copyright header
+      Convert Zcash versions to Debian format
+      [manpage] Handle build numbers in versions
+      Address Daira's comments
+      Address Daira's further comments
+      Correctly handle three-digit octals with leading digit 4-7
+      Check that >3-digit octals are truncated.
+      Implement automatic shutdown of deprecated Zcash versions
+      Wrap messages nicely on metrics screen
+      Regenerate miner tests
+      Add a benchmark for calling ConnectBlock on a block with many inputs
+      Remove additional sources of determinism from benchmark archive
+
+Jay Graber (2):
+      Change help text examples to use Zcash addresses
+      Poll on getblocktemplate result rather than use bare sleep to avoid race condition.
+
+Nathan Wilcox (39):
+      [Direct master commit] Fix a release snafu in debian version string.
+      Show toolchain versions in build.sh.
+      Start on a make-release.py script; currently just arg parsing and unittests [unittests fail].
+      Update version spec by altering test; also update regex to pass single 0 digits in major/minor/patch.
+      Add another case from debian-style versions.
+      Add all of the zcash release tags in my current repo as positive test vector.
+      Add support for beta/rc release versions.
+      Add version sorting, assert that RELEASE_PREV is the most recent release.
+      Make SystemExit errors less redundant in output; verify clean git status on master.
+      Always run unittests prior to actual runs.
+      Make --help output clean by not running self-test.
+      Add an option to run against a different repo directory.
+      Make sure to pull the latest master.
+      Exit instead of raising an unexpected exception, since it's already logged.
+      Implement `PathPatcher` abstraction, `clientversion.h` rewrite, and build numbering w/ unittests.
+      Implement the IS_RELEASE rule for betas.
+      Generalize buildnum patching for both `clientversion.h` and `configure.ac`.
+      Modify the `APPROX_RELEASE_HEIGHT`.
+      Remove portions of `./doc/release-process.md` now implemented in `make-release.py`.
+      Switch from `sh_out_logged` to `sh_log`.
+      Shorten the arg log line.
+      Commit the version changes and build.
+      Generate manpages; commit that; improve error output in sh_log.
+      Polish logging a bit more.
+      Tidy up / systematize logging output a bit more.
+      First full-release-branch version of script; rewrite large swatch of release-process.md. [Manually tested.]
+      Enable set -u mode.
+      Fix a variable name typo.
+      Reuse zcash_rpc.
+      Do not use `-rpcwait` on all `zcash_rpc` invocations, only block when starting zcashd.
+      Fix `release-process.md` doc usage for `make-release.py` to have correct arguments and order.
+      Include release version in commit comments.
+      Examine all future versions which are assumed to follow the same Version parser schema.
+      Consider both beta and rc versions to be `IS_RELEASE == false`.
+      Add a few more version strings to positive parser test.
+      Define the deprecation policy for 1.0.9.
+      Clarify that the feature is automated *shutdown*.
+      make-release.py: Versioning changes for 1.0.9.
+      make-release.py: Updated manpages for 1.0.9.
+
+Paige Peterson (4):
+      wallet backup instructions
+      typo and rewording edits
+      str4d and Ariel's suggestions
+      specify exportdir being within homedirectory
+
+Sean Bowe (1):
+      Check that pairings work properly when the G1 point is at infinity.
+
+Simon Liu (5):
+      Add AMQP 1.0 support via Apache Qpid Proton C++ API 0.17.0
+      Add --disable-proton flag to build.sh.  Proton has build/linker issues with gcc 4.9.2 and requires gcc 5.x.
+      Fix proton build issue with debian jessie, as used on CI servers.
+      Change regtest port to 18344.  Closes #2269.
+      Patch to build Proton with minimal dependencies.
+
+emilrus (1):
+      Replace bitcoind with zcashd
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.1.0-rc1.md b/depend/zcash/doc/release-notes/release-notes-1.1.0-rc1.md
new file mode 100644
index 000000000..a769b97cf
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.1.0-rc1.md
@@ -0,0 +1,180 @@
+Notable changes
+===============
+
+`-mempooltxinputlimit` deprecation
+----------------------------------
+
+The configuration option `-mempooltxinputlimit` was added in release 1.0.10 as a
+short-term fix for the quadratic hashing problem inherited from Bitcoin. At the
+time, transactions with many inputs were causing performance issues for miners.
+Since then, several performance improvements have been merged from the Bitcoin
+Core codebase that significantly reduce these issues.
+
+The Overwinter network upgrade includes changes that solve the quadratic hashing
+problem, and so `-mempooltxinputlimit` will no longer be needed - a transaction
+with 1000 inputs will take just as long to validate as 10 transactions with 100
+inputs each. Starting from this release, `-mempooltxinputlimit` will be enforced
+before the Overwinter activation height is reached, but will be ignored once
+Overwinter activates. The option will be removed entirely in a future release
+after Overwinter has activated.
+
+`NODE_BLOOM` service bit
+------------------------
+
+Support for the `NODE_BLOOM` service bit, as described in [BIP
+111](https://github.com/bitcoin/bips/blob/master/bip-0111.mediawiki), has been
+added to the P2P protocol code.
+
+BIP 111 defines a service bit to allow peers to advertise that they support
+Bloom filters (such as used by SPV clients) explicitly. It also bumps the protocol
+version to allow peers to identify old nodes which allow Bloom filtering of the
+connection despite lacking the new service bit.
+
+In this version, it is only enforced for peers that send protocol versions
+`>=170004`. For the next major version it is planned that this restriction will be
+removed. It is recommended to update SPV clients to check for the `NODE_BLOOM`
+service bit for nodes that report version 170004 or newer.
+
+Changelog
+=========
+
+Brad Miller (2):
+      Clean up
+      Implement note locking for z_mergetoaddress
+
+Charlie O'Keefe (1):
+      Add filename and sha256 hash for windows rust package
+
+Daira Hopwood (5):
+      Squashed commit of the following:
+      pyflakes cleanups to RPC tests after Overwinter PRs.
+      Add support for Overwinter v3 transactions to mininode framework.
+      Test that receiving an expired transaction does not increase the peer's ban score.
+      Don't increase banscore if the transaction only just expired.
+
+Daniel Kraft (1):
+      trivial: use constants for db keys
+
+Jack Grigg (43):
+      Add environment variable for setting ./configure flags in zcutil/build.sh
+      Add configure flags for enabling ASan/UBSan and TSan
+      Split declaration and definition of SPROUT_BRANCH_ID constant
+      Add link to Overwinter info page
+      Notify users about auto-senescence via -alertnotify
+      test: Move wait_and_assert_operationid_status debug output before asserts
+      Don't require RELRO and BIND_NOW for Darwin
+      Only set multicore flags if OpenMP is available
+      Revert "remove -mt suffix from boost libraries built by depends"
+      Use correct Boost::System linker flag for libzcash
+      depends: Remove -mt suffix from Boost libraries
+      snark: Remove -mt suffix from Boost library
+      cleanup: Ensure code is pyflakes-clean for CI
+      Ignore -mempooltxinputlimit once Overwinter activates
+      depends: Explicitly download and vendor Rust dependencies
+      Make Rust compilation mandatory
+      Optimise serialization of MerklePath, avoiding ambiguity of std::vector<bool>
+      Use uint64_t instead of size_t for serialized indices into tx.vjoinsplit
+      Move explicit instantiation of IncrementalMerkleTree::emptyroots into header
+      libsnark: Don't set -static on Darwin
+      Set PLATFORM flag when compiling libsnark
+      Add base case to CurrentEpoch()
+      Cast ZCIncrementalMerkleTree::size() to uint64_t before passing to UniValue
+      rpcwallet.cpp: Cast size_t to uint64_t before passing to UniValue
+      wallet: Cast size_t to uint64_t before passing to UniValue
+      Test calling z_mergetoaddress to merge notes while a note merge is ongoing
+      depends: Fix regex bugs in cargo-checksum.sh
+      Fix z_importviewingkey startHeight parameter
+      Add RPC test of RewindBlockIndex
+      When rewinding, remove insufficiently-validated blocks
+      Adjust deprecation message to work in both UI and -alertnotify
+      Refactor Zcash changes to CCoinsViewDB
+      Update blockchain.py RPC test for Zcash
+      Update CBlockTreeDB::EraseBatchSync for dbwrapper refactor
+      Fix typo
+      test: Check return value of snprintf
+      test: Add missing Overwinter fields to mininode's CTransaction
+      Add RPC test for -enforcenodebloom
+      Fix NODE_BLOOM documentation errors
+      Move bloom filter filtering logic back into command "switch"
+      Update -enforcenodebloom RPC test with filterclear vs filteradd
+      make-release.py: Versioning changes for 1.1.0-rc1.
+      make-release.py: Updated manpages for 1.1.0-rc1.
+
+James O'Beirne (3):
+      Refactor leveldbwrapper
+      Minor bugfixes
+      Add tests for gettxoutsetinfo, CLevelDBBatch, CLevelDBIterator
+
+Jason Davies (1):
+      Fix typo in comment: should link to issue #1359.
+
+Jay Graber (1):
+      Set ban score for expired txs to 0
+
+Jeff Garzik (3):
+      leveldbwrapper: Remove unused .Prev(), .SeekToLast() methods
+      leveldbwrapper symbol rename: Remove "Level" from class, etc. names
+      leveldbwrapper file rename to dbwrapper.*
+
+Jonathan "Duke" Leto (7):
+      Fix references to Bitcoin in RPC tests readme
+      This library seems to not be used at all and all comments mentioning it are ghosts
+      Update awkward wording about blocks as per @daira
+      Regtest mining does have a founders reward, a single address t2FwcEhFdNXuFMv1tcYwaBJtYVtMj8b1uTg
+      Fix outdated comment about starting balance of nodes
+      Return JoinSplit and JoinSplitOutput indexes in z_listreceivedbyaddress
+      Add tests for new JoinSplit keys returned by z_listreceivedbyaddress
+
+Lauda (1):
+      [Trivial] Grammar and typo correction
+
+Matt Corallo (3):
+      Add test for dbwrapper iterators with same-prefix keys.
+      Add NODE_BLOOM service bit and bump protocol version
+      Don't do mempool lookups for "mempool" command without a filter
+
+Patick Strateman (3):
+      Move bloom filter filtering logic outside of command "switch" (giant if/else).
+      Add enforcenodebloom option.
+      Document both the peerbloomfilters and enforcenodebloom options.
+
+Pavel Janík (1):
+      Do not shadow members in dbwrapper
+
+Pieter Wuille (2):
+      Encapsulate CLevelDB iterators cleanly
+      Fix chainstate serialized_size computation
+
+R E Broadley (1):
+      Allow filterclear messages for enabling TX relay only.
+
+Simon Liu (13):
+      Code clean up. Remove use of X macro.
+      Enable mempool logging in tx expiry QA test.
+      Closes #3084. Log txid when removing expired txs from mempool.
+      Add qa test for cache invalidation bug found in v1.0.0 to v1.0.3.
+      Remove local function wait_and_assert_operationid_status which is     now defined in the test framework for shared usage.
+      Update boost to 1.66.0
+      Part of #2966, extending Sprout tests to other epochs.
+      Update boost package URL to match official download url on boost.org
+      Closes #3110.  Ensure user can see error message about absurdly high fees.
+      Closes #2910. Add z_listunspent RPC call.
+      Upgrade OpenSSL to 1.1.0h
+      Use range based for loop
+      Bump MIT Licence copyright header.
+
+Wladimir J. van der Laan (6):
+      dbwrapper: Pass parent CDBWrapper into CDBBatch and CDBIterator
+      dbwrapper: Move `HandleError` to `dbwrapper_private`
+      chain: Add assertion in case of missing records in index db
+      test: Add more thorough test for dbwrapper iterators
+      test: Replace remaining sprintf with snprintf
+      doc: update release-notes and bips.md for BIP111
+
+kozyilmaz (1):
+      Fix test/gtest bugs caught by latest macOS clang
+
+rofl0r (2):
+      fix build error due to usage of obsolete boost_system-mt
+      remove -mt suffix from boost libraries built by depends
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.1.0.md b/depend/zcash/doc/release-notes/release-notes-1.1.0.md
new file mode 100644
index 000000000..37f803e6f
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.1.0.md
@@ -0,0 +1,193 @@
+Notable changes
+===============
+
+Overwinter network upgrade
+--------------------------
+
+The activation height for the Overwinter network upgrade on mainnet is included
+in this release. Overwinter will activate on mainnet at height 347500, which is
+expected to be mined on the 25th of June 2018. Please upgrade to this release,
+or any subsequent release, in order to follow the Overwinter network upgrade.
+
+`-mempooltxinputlimit` deprecation
+----------------------------------
+
+The configuration option `-mempooltxinputlimit` was added in release 1.0.10 as a
+short-term fix for the quadratic hashing problem inherited from Bitcoin. At the
+time, transactions with many inputs were causing performance issues for miners.
+Since then, several performance improvements have been merged from the Bitcoin
+Core codebase that significantly reduce these issues.
+
+The Overwinter network upgrade includes changes that solve the quadratic hashing
+problem, and so `-mempooltxinputlimit` will no longer be needed - a transaction
+with 1000 inputs will take just as long to validate as 10 transactions with 100
+inputs each. Starting from this release, `-mempooltxinputlimit` will be enforced
+before the Overwinter activation height is reached, but will be ignored once
+Overwinter activates. The option will be removed entirely in a future release
+after Overwinter has activated.
+
+`NODE_BLOOM` service bit
+------------------------
+
+Support for the `NODE_BLOOM` service bit, as described in [BIP
+111](https://github.com/bitcoin/bips/blob/master/bip-0111.mediawiki), has been
+added to the P2P protocol code.
+
+BIP 111 defines a service bit to allow peers to advertise that they support
+Bloom filters (such as used by SPV clients) explicitly. It also bumps the protocol
+version to allow peers to identify old nodes which allow Bloom filtering of the
+connection despite lacking the new service bit.
+
+In this version, it is only enforced for peers that send protocol versions
+`>=170004`. For the next major version it is planned that this restriction will be
+removed. It is recommended to update SPV clients to check for the `NODE_BLOOM`
+service bit for nodes that report version 170004 or newer.
+
+Changelog
+=========
+
+Brad Miller (2):
+      Clean up
+      Implement note locking for z_mergetoaddress
+
+Charlie O'Keefe (1):
+      Add filename and sha256 hash for windows rust package
+
+Daira Hopwood (5):
+      Squashed commit of the following:
+      pyflakes cleanups to RPC tests after Overwinter PRs.
+      Add support for Overwinter v3 transactions to mininode framework.
+      Test that receiving an expired transaction does not increase the peer's ban score.
+      Don't increase banscore if the transaction only just expired.
+
+Daniel Kraft (1):
+      trivial: use constants for db keys
+
+Jack Grigg (47):
+      Add environment variable for setting ./configure flags in zcutil/build.sh
+      Add configure flags for enabling ASan/UBSan and TSan
+      Split declaration and definition of SPROUT_BRANCH_ID constant
+      Add link to Overwinter info page
+      Notify users about auto-senescence via -alertnotify
+      test: Move wait_and_assert_operationid_status debug output before asserts
+      Don't require RELRO and BIND_NOW for Darwin
+      Only set multicore flags if OpenMP is available
+      Revert "remove -mt suffix from boost libraries built by depends"
+      Use correct Boost::System linker flag for libzcash
+      depends: Remove -mt suffix from Boost libraries
+      snark: Remove -mt suffix from Boost library
+      cleanup: Ensure code is pyflakes-clean for CI
+      Ignore -mempooltxinputlimit once Overwinter activates
+      depends: Explicitly download and vendor Rust dependencies
+      Make Rust compilation mandatory
+      Optimise serialization of MerklePath, avoiding ambiguity of std::vector<bool>
+      Use uint64_t instead of size_t for serialized indices into tx.vjoinsplit
+      Move explicit instantiation of IncrementalMerkleTree::emptyroots into header
+      libsnark: Don't set -static on Darwin
+      Set PLATFORM flag when compiling libsnark
+      Add base case to CurrentEpoch()
+      Cast ZCIncrementalMerkleTree::size() to uint64_t before passing to UniValue
+      rpcwallet.cpp: Cast size_t to uint64_t before passing to UniValue
+      wallet: Cast size_t to uint64_t before passing to UniValue
+      Test calling z_mergetoaddress to merge notes while a note merge is ongoing
+      depends: Fix regex bugs in cargo-checksum.sh
+      Fix z_importviewingkey startHeight parameter
+      Add RPC test of RewindBlockIndex
+      When rewinding, remove insufficiently-validated blocks
+      Adjust deprecation message to work in both UI and -alertnotify
+      Refactor Zcash changes to CCoinsViewDB
+      Update blockchain.py RPC test for Zcash
+      Update CBlockTreeDB::EraseBatchSync for dbwrapper refactor
+      Fix typo
+      test: Check return value of snprintf
+      test: Add missing Overwinter fields to mininode's CTransaction
+      Add RPC test for -enforcenodebloom
+      Fix NODE_BLOOM documentation errors
+      Move bloom filter filtering logic back into command "switch"
+      Update -enforcenodebloom RPC test with filterclear vs filteradd
+      make-release.py: Versioning changes for 1.1.0-rc1.
+      make-release.py: Updated manpages for 1.1.0-rc1.
+      make-release.py: Updated release notes and changelog for 1.1.0-rc1.
+      Set Overwinter protocol version to 170005
+      make-release.py: Versioning changes for 1.1.0.
+      make-release.py: Updated manpages for 1.1.0.
+
+James O'Beirne (3):
+      Refactor leveldbwrapper
+      Minor bugfixes
+      Add tests for gettxoutsetinfo, CLevelDBBatch, CLevelDBIterator
+
+Jason Davies (1):
+      Fix typo in comment: should link to issue #1359.
+
+Jay Graber (1):
+      Set ban score for expired txs to 0
+
+Jeff Garzik (3):
+      leveldbwrapper: Remove unused .Prev(), .SeekToLast() methods
+      leveldbwrapper symbol rename: Remove "Level" from class, etc. names
+      leveldbwrapper file rename to dbwrapper.*
+
+Jonathan "Duke" Leto (7):
+      Fix references to Bitcoin in RPC tests readme
+      This library seems to not be used at all and all comments mentioning it are ghosts
+      Update awkward wording about blocks as per @daira
+      Regtest mining does have a founders reward, a single address t2FwcEhFdNXuFMv1tcYwaBJtYVtMj8b1uTg
+      Fix outdated comment about starting balance of nodes
+      Return JoinSplit and JoinSplitOutput indexes in z_listreceivedbyaddress
+      Add tests for new JoinSplit keys returned by z_listreceivedbyaddress
+
+Lauda (1):
+      [Trivial] Grammar and typo correction
+
+Matt Corallo (3):
+      Add test for dbwrapper iterators with same-prefix keys.
+      Add NODE_BLOOM service bit and bump protocol version
+      Don't do mempool lookups for "mempool" command without a filter
+
+Patick Strateman (3):
+      Move bloom filter filtering logic outside of command "switch" (giant if/else).
+      Add enforcenodebloom option.
+      Document both the peerbloomfilters and enforcenodebloom options.
+
+Pavel Janík (1):
+      Do not shadow members in dbwrapper
+
+Pieter Wuille (2):
+      Encapsulate CLevelDB iterators cleanly
+      Fix chainstate serialized_size computation
+
+R E Broadley (1):
+      Allow filterclear messages for enabling TX relay only.
+
+Simon Liu (14):
+      Code clean up. Remove use of X macro.
+      Enable mempool logging in tx expiry QA test.
+      Closes #3084. Log txid when removing expired txs from mempool.
+      Add qa test for cache invalidation bug found in v1.0.0 to v1.0.3.
+      Remove local function wait_and_assert_operationid_status which is     now defined in the test framework for shared usage.
+      Update boost to 1.66.0
+      Part of #2966, extending Sprout tests to other epochs.
+      Update boost package URL to match official download url on boost.org
+      Closes #3110.  Ensure user can see error message about absurdly high fees.
+      Closes #2910. Add z_listunspent RPC call.
+      Upgrade OpenSSL to 1.1.0h
+      Use range based for loop
+      Bump MIT Licence copyright header.
+      Fix test to check for sanitized string from alertnotify.
+
+Wladimir J. van der Laan (6):
+      dbwrapper: Pass parent CDBWrapper into CDBBatch and CDBIterator
+      dbwrapper: Move `HandleError` to `dbwrapper_private`
+      chain: Add assertion in case of missing records in index db
+      test: Add more thorough test for dbwrapper iterators
+      test: Replace remaining sprintf with snprintf
+      doc: update release-notes and bips.md for BIP111
+
+kozyilmaz (1):
+      Fix test/gtest bugs caught by latest macOS clang
+
+rofl0r (2):
+      fix build error due to usage of obsolete boost_system-mt
+      remove -mt suffix from boost libraries built by depends
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.1.1-rc1.md b/depend/zcash/doc/release-notes/release-notes-1.1.1-rc1.md
new file mode 100644
index 000000000..bc209efc7
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.1.1-rc1.md
@@ -0,0 +1,286 @@
+Notable changes
+===============
+
+zcash-cli: arguments privacy
+----------------------------
+
+The RPC command line client gained a new argument, `-stdin`
+to read extra arguments from standard input, one per line until EOF/Ctrl-D.
+For example:
+
+    $ src/zcash-cli -stdin walletpassphrase
+    mysecretcode
+    120
+    ^D (Ctrl-D)
+
+It is recommended to use this for sensitive information such as private keys, as
+command-line arguments can usually be read from the process table by any user on
+the system.
+
+Asm representations of scriptSig signatures now contain SIGHASH type decodes
+----------------------------------------------------------------------------
+
+The `asm` property of each scriptSig now contains the decoded signature hash
+type for each signature that provides a valid defined hash type.
+
+The following items contain assembly representations of scriptSig signatures
+and are affected by this change:
+
+- RPC `getrawtransaction`
+- RPC `decoderawtransaction`
+- REST `/rest/tx/` (JSON format)
+- REST `/rest/block/` (JSON format when including extended tx details)
+- `zcash-tx -json`
+
+For example, the `scriptSig.asm` property of a transaction input that
+previously showed an assembly representation of:
+
+    304502207fa7a6d1e0ee81132a269ad84e68d695483745cde8b541e3bf630749894e342a022100c1f7ab20e13e22fb95281a870f3dcf38d782e53023ee313d741ad0cfbc0c509001
+
+now shows as:
+
+    304502207fa7a6d1e0ee81132a269ad84e68d695483745cde8b541e3bf630749894e342a022100c1f7ab20e13e22fb95281a870f3dcf38d782e53023ee313d741ad0cfbc0c5090[ALL]
+
+Note that the output of the RPC `decodescript` did not change because it is
+configured specifically to process scriptPubKey and not scriptSig scripts.
+
+Changelog
+=========
+
+Cory Fields (4):
+      serialization: teach serializers variadics
+      build: univalue subdir build fixups
+      don't throw std::bad_alloc when out of memory. Instead, terminate immediately
+      prevector: assert successful allocation
+
+Daira Hopwood (1):
+      Use https: for BDB backup download URL.
+
+David Llop (1):
+      Update Payment API
+
+Eirik Ogilvie-Wigley (7):
+      Clarify help text of dumpprivkey
+      Add sapling nullifier set
+      Add enum for nullifier type
+      Add sapling nullifiers to db and mempool
+      Rename nullifier caches and maps to indicate sprout nullifiers
+      Make sure transactions have non-empty outputs
+      Coinbase transactions can not have shielded spend or output
+
+Jack Grigg (50):
+      Disable building libzcashconsensus by default
+      depends: Upgrade Rust to 1.26.0-beta.3
+      depends: Add support for unpackaged Rust crates
+      depends: Update to latest librustzcash with sapling-crypto dependencies
+      Add Sapling to upgrade list
+      Add static asserts to ensure CONTINUE_EXECUTION doesn't collide
+      [Bitcoin-Tx] Adjust util-test test cases for Zcash
+      Handle usage of prevector for CScript in Zcash-specific code
+      GetSerializeSize changes in Zcash-specific code
+      Remove nType and nVersion from Zcash-specific code
+      Adjust consensus rules to require v4 transactions from Sapling activation
+      Implement basic Sapling v4 transaction parser
+      Add Sapling v4 transactions to IsStandard
+      Pass transaction header into correct SignatureHash serialization level
+      Remove now-unshadowed serialization lines that do nothing
+      Implement SpendDescription and OutputDescription datastructures
+      Add a constant for Overwinter's transaction version
+      Return result of boost::apply_visitor
+      Improve best-effort logging before termination on OOM
+      Attempt to log before terminating if prevector allocation fails
+      Fix -Wstring-plus-int warning on clang
+      Update mempool_nu_activation RPC test to exercise both Overwinter and Sapling
+      Use CBitcoinAddress wrappers in Zcash-specific code
+      Change JSOutPoint constructor to have js argument be uint64_t
+      Update CreateNewContextualCMutableTransaction to create Sapling transactions
+      Expire Overwinter transactions before the Sapling activation height
+      Remove obsolete CreateJoinSplit and GenerateParams binaries
+      Add missing include guard
+      Raise 100kB transaction size limit from Sapling activation
+      Benchmark the largest valid Sapling transaction in validatelargetx
+      Rename MAX_TX_SIZE to MAX_TX_SIZE_AFTER_SAPLING
+      Rework z_sendmany z-address recipient limit
+      Add test of Sapling transaction size boundary
+      Update tests for CreateNewContextualCMutableTransaction changes
+      wallet: Change IsLockedNote to take a JSOutPoint
+      wallet: Make some arguments const that can be
+      Implement Sapling signature hash (ZIP 243)
+      Update sighash tests
+      Introduce wrappers around CZCPaymentAddress
+      Introduce wrappers around CZCSpendingKey
+      Introduce wrappers around CZCViewingKey
+      Implement {Encode,Decode}PaymentAddress etc. without CZCEncoding
+      Add key_io includes to Zcash-specific code
+      Add valueBalance to value balances, and enforce its consensus rules
+      Track net value entering and exiting the Sapling circuit
+      Add contextual comment for GetValueOut() and GetShieldedValueIn()
+      Use boost::variant to represent shielded addresses and keys
+      Correctly serialize Groth16 JSDescription for verifyjoinsplit benchmark
+      make-release.py: Versioning changes for 1.1.1-rc1.
+      make-release.py: Updated manpages for 1.1.1-rc1.
+
+Jay Graber (1):
+      Add test for dependent txs to mempool_tx_expiry.py
+
+Jeremy Rubin (1):
+      Fix subscript[0] in base58.cpp
+
+Jonas Schnelli (4):
+      [RPC] createrawtransaction: add option to set the sequence number per input
+      [bitcoin-tx] allow to set nSequence number over the in= command
+      [Bitcoin-Tx] Add tests for sequence number support
+      add bip32 pubkey serialization
+
+João Barbosa (1):
+      Remove unused GetKeyID and IsScript methods from CBitcoinAddress
+
+Karl-Johan Alm (1):
+      Removed using namespace std from bitcoin-cli/-tx and added std:: in appropriate places.
+
+Kaz Wesley (1):
+      CBase58Data::SetString: cleanse the full vector
+
+Larry Ruane (1):
+      fix qa/zcash/full_test_suite.py pathname
+
+MarcoFalke (3):
+      [uacomment] Sanitize per BIP-0014
+      [rpcwallet] Don't use floating point
+      [test] Remove unused code
+
+Matt Corallo (1):
+      Add COMPACTSIZE wrapper similar to VARINT for serialization
+
+Pavel Janík (1):
+      [WIP] Remove unused statement in serialization
+
+Pavol Rusnak (2):
+      implement uacomment config parameter     which can add comments to user agent as per BIP-0014
+      limit total length of user agent comments
+
+Pedro Branco (1):
+      Prevent multiple calls to ExtractDestination
+
+Per Grön (1):
+      Make some globals static that can be
+
+Peter Pratscher (1):
+      Backported Bitcoin PR #8704 to optionally return full tx details in the getblock rpc call
+
+Pieter Wuille (22):
+      Prevector type
+      Remove unused ReadVersion and WriteVersion
+      Make streams' read and write return void
+      Make nType and nVersion private and sometimes const
+      Make GetSerializeSize a wrapper on top of CSizeComputer
+      Get rid of nType and nVersion
+      Avoid -Wshadow errors
+      Make CSerAction's ForRead() constexpr
+      Add optimized CSizeComputer serializers
+      Use fixed preallocation instead of costly GetSerializeSize
+      Add serialization for unique_ptr and shared_ptr
+      Add deserializing constructors to CTransaction and CMutableTransaction
+      Avoid unaligned access in crypto i/o
+      Fix some empty vector references
+      Introduce wrappers around CBitcoinAddress
+      Move CBitcoinAddress to base58.cpp
+      Implement {Encode,Decode}Destination without CBitcoinAddress
+      Import Bech32 C++ reference code & tests
+      Convert base58_tests from type/payload to scriptPubKey comparison
+      Replace CBitcoinSecret with {Encode,Decode}Secret
+      Stop using CBase58Data for ext keys
+      Split key_io (address/key encodings) off from base58
+
+Puru (1):
+      bitcoin-cli.cpp: Use symbolic constant for exit code
+
+Sean Bowe (49):
+      Switch to latest librustzcash
+      Invoke the merkle_hash API in librustzcash via test suite.
+      Link with -ldl
+      Update librustzcash hash
+      Load Sapling testnet parameters into memory.
+      Update librustzcash hash
+      Check that duplicate Sapling nullifiers don't exist within a transaction.
+      Abstract `uncommitted` and depth personalization for IncrementalMerkleTree.
+      Add implementation of Sapling merkle tree
+      Add regression tests and test vectors for Sapling merkle tree
+      Rename NullifierType to ShieldedType.
+      Specifically describe anchors as Sprout anchors.
+      Rename hashAnchor to hashSproutAnchor.
+      Rename hashReserved to hashSaplingAnchorEnd.
+      Add primitive implementation of GetSaplingAnchorEnd.
+      Rename DB_ANCHOR to DB_SPROUT_ANCHOR.
+      Rename GetAnchorAt to GetSproutAnchorAt.
+      Rename PushAnchor to PushSproutAnchor.
+      Introduce support for GetBestAnchor(SAPLING).
+      Generalize the PopAnchor implementation behavior.
+      Generalize the PushAnchor implementation behavior.
+      Remove underscores from gtest test names.
+      Rename hashSaplingAnchorEnd to hashFinalSaplingRoot to match spec.
+      Rename hashSproutAnchorEnd to hashFinalSproutRoot to be consistent.
+      Add support for Sapling anchors in coins/txdb.
+      Add support for PopAnchor(.., SPROUT/SAPLING)
+      Add `PushSaplingAnchor`
+      Add consensus support for Sapling merkle trees.
+      Add support for Sapling anchor checks in mempool consistency checks.
+      Calculate the correct hashFinalSaplingRoot in the miner.
+      Adjust tests to handle Sapling anchor cache
+      Evict transactions with obsolete anchors from the mempool
+      Fix outdated comment
+      Fix broken error messages.
+      Fix miner tests
+      Update sapling-crypto and librustzcash
+      Swap bit endianness of test vectors
+      Remove unnecessary IsCoinbase() check. Coinbases are guaranteed to have empty vjoinsplit.
+      Refactor so that dataToBeSigned can be used later in the function for other purposes.
+      Update to latest librustzcash
+      Check Sapling Spend/Output proofs and signatures.
+      Integrate Groth16 verification and proving.
+      Update librustzcash again
+      Adjust tests and benchmarks
+      Switch Rust to 1.26 Stable.
+      Update librustzcash
+      Update Sapling testnet parameters
+      Update merkle tree and pedersen hash tests to account for new encoding
+      Change txdb prefixes for sapling and avoid writing unnecessary information.
+
+Simon Liu (14):
+      Part of #2966, extending Sprout tests to other epochs.
+      Closes #3134 - Least Authority Issue E
+      Refactoring: libzcash::Note is now a subclass of libzcash::BaseNote.
+      Refactoring: Rename class libzcash::Note to libzcash::SproutNote.
+      Refactoring: SproutNote member variable value moved to BaseNote.
+      Add virtual destructor to SproutNote and BaseNote
+      Remove unused SproutNote variables.
+      Refactoring: rename NotePlaintext --> SproutNotePlaintext
+      Create class hierarchy for SproutNotePlaintext.
+      Move memo member varible from SproutNotePlaintext to BaseNotePlaintext.
+      Tweaks to d0a1d83 to complete backport of Bitcoin PR #8704
+      Closes #3178 by adding verbosity level improvements to getblock RPC.
+      Fix undefined behaviour, calling memcpy with NULL pointer.
+      Closes #3250. Memo getter should return by reference, not by value.
+
+Tom Harding (1):
+      Add optional locktime to createrawtransaction
+
+UdjinM6 (2):
+      Fix exit codes:
+      Every main()/exit() should return/use one of EXIT_ codes instead of magic numbers
+
+Wladimir J. van der Laan (2):
+      rpc: Input-from-stdin mode for bitcoin-cli
+      doc: mention bitcoin-cli -stdin in release notes
+
+ca333 (2):
+      [fix] proton download path
+      update proton.mk
+
+kozyilmaz (2):
+      [macOS] added curl method for param download
+      [macOS] use shlock instead of flock in fetch-params
+
+mruddy (1):
+      Resolve issue bitcoin/bitcoin#3166.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.1.1-rc2.md b/depend/zcash/doc/release-notes/release-notes-1.1.1-rc2.md
new file mode 100644
index 000000000..5d10ede47
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.1.1-rc2.md
@@ -0,0 +1,290 @@
+Notable changes
+===============
+
+zcash-cli: arguments privacy
+----------------------------
+
+The RPC command line client gained a new argument, `-stdin`
+to read extra arguments from standard input, one per line until EOF/Ctrl-D.
+For example:
+
+    $ src/zcash-cli -stdin walletpassphrase
+    mysecretcode
+    120
+    ^D (Ctrl-D)
+
+It is recommended to use this for sensitive information such as private keys, as
+command-line arguments can usually be read from the process table by any user on
+the system.
+
+Asm representations of scriptSig signatures now contain SIGHASH type decodes
+----------------------------------------------------------------------------
+
+The `asm` property of each scriptSig now contains the decoded signature hash
+type for each signature that provides a valid defined hash type.
+
+The following items contain assembly representations of scriptSig signatures
+and are affected by this change:
+
+- RPC `getrawtransaction`
+- RPC `decoderawtransaction`
+- REST `/rest/tx/` (JSON format)
+- REST `/rest/block/` (JSON format when including extended tx details)
+- `zcash-tx -json`
+
+For example, the `scriptSig.asm` property of a transaction input that
+previously showed an assembly representation of:
+
+    304502207fa7a6d1e0ee81132a269ad84e68d695483745cde8b541e3bf630749894e342a022100c1f7ab20e13e22fb95281a870f3dcf38d782e53023ee313d741ad0cfbc0c509001
+
+now shows as:
+
+    304502207fa7a6d1e0ee81132a269ad84e68d695483745cde8b541e3bf630749894e342a022100c1f7ab20e13e22fb95281a870f3dcf38d782e53023ee313d741ad0cfbc0c5090[ALL]
+
+Note that the output of the RPC `decodescript` did not change because it is
+configured specifically to process scriptPubKey and not scriptSig scripts.
+
+Changelog
+=========
+
+Cory Fields (4):
+      serialization: teach serializers variadics
+      build: univalue subdir build fixups
+      don't throw std::bad_alloc when out of memory. Instead, terminate immediately
+      prevector: assert successful allocation
+
+Daira Hopwood (1):
+      Use https: for BDB backup download URL.
+
+David Llop (1):
+      Update Payment API
+
+Eirik Ogilvie-Wigley (7):
+      Clarify help text of dumpprivkey
+      Add sapling nullifier set
+      Add enum for nullifier type
+      Add sapling nullifiers to db and mempool
+      Rename nullifier caches and maps to indicate sprout nullifiers
+      Make sure transactions have non-empty outputs
+      Coinbase transactions can not have shielded spend or output
+
+Jack Grigg (52):
+      Disable building libzcashconsensus by default
+      depends: Upgrade Rust to 1.26.0-beta.3
+      depends: Add support for unpackaged Rust crates
+      depends: Update to latest librustzcash with sapling-crypto dependencies
+      Add Sapling to upgrade list
+      Add static asserts to ensure CONTINUE_EXECUTION doesn't collide
+      [Bitcoin-Tx] Adjust util-test test cases for Zcash
+      Handle usage of prevector for CScript in Zcash-specific code
+      GetSerializeSize changes in Zcash-specific code
+      Remove nType and nVersion from Zcash-specific code
+      Adjust consensus rules to require v4 transactions from Sapling activation
+      Implement basic Sapling v4 transaction parser
+      Add Sapling v4 transactions to IsStandard
+      Pass transaction header into correct SignatureHash serialization level
+      Remove now-unshadowed serialization lines that do nothing
+      Implement SpendDescription and OutputDescription datastructures
+      Add a constant for Overwinter's transaction version
+      Return result of boost::apply_visitor
+      Improve best-effort logging before termination on OOM
+      Attempt to log before terminating if prevector allocation fails
+      Fix -Wstring-plus-int warning on clang
+      Update mempool_nu_activation RPC test to exercise both Overwinter and Sapling
+      Use CBitcoinAddress wrappers in Zcash-specific code
+      Change JSOutPoint constructor to have js argument be uint64_t
+      Update CreateNewContextualCMutableTransaction to create Sapling transactions
+      Expire Overwinter transactions before the Sapling activation height
+      Remove obsolete CreateJoinSplit and GenerateParams binaries
+      Add missing include guard
+      Raise 100kB transaction size limit from Sapling activation
+      Benchmark the largest valid Sapling transaction in validatelargetx
+      Rename MAX_TX_SIZE to MAX_TX_SIZE_AFTER_SAPLING
+      Rework z_sendmany z-address recipient limit
+      Add test of Sapling transaction size boundary
+      Update tests for CreateNewContextualCMutableTransaction changes
+      wallet: Change IsLockedNote to take a JSOutPoint
+      wallet: Make some arguments const that can be
+      Implement Sapling signature hash (ZIP 243)
+      Update sighash tests
+      Introduce wrappers around CZCPaymentAddress
+      Introduce wrappers around CZCSpendingKey
+      Introduce wrappers around CZCViewingKey
+      Implement {Encode,Decode}PaymentAddress etc. without CZCEncoding
+      Add key_io includes to Zcash-specific code
+      Add valueBalance to value balances, and enforce its consensus rules
+      Track net value entering and exiting the Sapling circuit
+      Add contextual comment for GetValueOut() and GetShieldedValueIn()
+      Use boost::variant to represent shielded addresses and keys
+      Correctly serialize Groth16 JSDescription for verifyjoinsplit benchmark
+      make-release.py: Versioning changes for 1.1.1-rc1.
+      make-release.py: Updated manpages for 1.1.1-rc1.
+      make-release.py: Updated release notes and changelog for 1.1.1-rc1.
+      Comment out Gitian library handling while we don't build any libraries
+
+Jay Graber (1):
+      Add test for dependent txs to mempool_tx_expiry.py
+
+Jeremy Rubin (1):
+      Fix subscript[0] in base58.cpp
+
+Jonas Schnelli (4):
+      [RPC] createrawtransaction: add option to set the sequence number per input
+      [bitcoin-tx] allow to set nSequence number over the in= command
+      [Bitcoin-Tx] Add tests for sequence number support
+      add bip32 pubkey serialization
+
+João Barbosa (1):
+      Remove unused GetKeyID and IsScript methods from CBitcoinAddress
+
+Karl-Johan Alm (1):
+      Removed using namespace std from bitcoin-cli/-tx and added std:: in appropriate places.
+
+Kaz Wesley (1):
+      CBase58Data::SetString: cleanse the full vector
+
+Larry Ruane (1):
+      fix qa/zcash/full_test_suite.py pathname
+
+MarcoFalke (3):
+      [uacomment] Sanitize per BIP-0014
+      [rpcwallet] Don't use floating point
+      [test] Remove unused code
+
+Matt Corallo (1):
+      Add COMPACTSIZE wrapper similar to VARINT for serialization
+
+Pavel Janík (1):
+      [WIP] Remove unused statement in serialization
+
+Pavol Rusnak (2):
+      implement uacomment config parameter     which can add comments to user agent as per BIP-0014
+      limit total length of user agent comments
+
+Pedro Branco (1):
+      Prevent multiple calls to ExtractDestination
+
+Per Grön (1):
+      Make some globals static that can be
+
+Peter Pratscher (1):
+      Backported Bitcoin PR #8704 to optionally return full tx details in the getblock rpc call
+
+Pieter Wuille (22):
+      Prevector type
+      Remove unused ReadVersion and WriteVersion
+      Make streams' read and write return void
+      Make nType and nVersion private and sometimes const
+      Make GetSerializeSize a wrapper on top of CSizeComputer
+      Get rid of nType and nVersion
+      Avoid -Wshadow errors
+      Make CSerAction's ForRead() constexpr
+      Add optimized CSizeComputer serializers
+      Use fixed preallocation instead of costly GetSerializeSize
+      Add serialization for unique_ptr and shared_ptr
+      Add deserializing constructors to CTransaction and CMutableTransaction
+      Avoid unaligned access in crypto i/o
+      Fix some empty vector references
+      Introduce wrappers around CBitcoinAddress
+      Move CBitcoinAddress to base58.cpp
+      Implement {Encode,Decode}Destination without CBitcoinAddress
+      Import Bech32 C++ reference code & tests
+      Convert base58_tests from type/payload to scriptPubKey comparison
+      Replace CBitcoinSecret with {Encode,Decode}Secret
+      Stop using CBase58Data for ext keys
+      Split key_io (address/key encodings) off from base58
+
+Puru (1):
+      bitcoin-cli.cpp: Use symbolic constant for exit code
+
+Sean Bowe (49):
+      Switch to latest librustzcash
+      Invoke the merkle_hash API in librustzcash via test suite.
+      Link with -ldl
+      Update librustzcash hash
+      Load Sapling testnet parameters into memory.
+      Update librustzcash hash
+      Check that duplicate Sapling nullifiers don't exist within a transaction.
+      Abstract `uncommitted` and depth personalization for IncrementalMerkleTree.
+      Add implementation of Sapling merkle tree
+      Add regression tests and test vectors for Sapling merkle tree
+      Rename NullifierType to ShieldedType.
+      Specifically describe anchors as Sprout anchors.
+      Rename hashAnchor to hashSproutAnchor.
+      Rename hashReserved to hashSaplingAnchorEnd.
+      Add primitive implementation of GetSaplingAnchorEnd.
+      Rename DB_ANCHOR to DB_SPROUT_ANCHOR.
+      Rename GetAnchorAt to GetSproutAnchorAt.
+      Rename PushAnchor to PushSproutAnchor.
+      Introduce support for GetBestAnchor(SAPLING).
+      Generalize the PopAnchor implementation behavior.
+      Generalize the PushAnchor implementation behavior.
+      Remove underscores from gtest test names.
+      Rename hashSaplingAnchorEnd to hashFinalSaplingRoot to match spec.
+      Rename hashSproutAnchorEnd to hashFinalSproutRoot to be consistent.
+      Add support for Sapling anchors in coins/txdb.
+      Add support for PopAnchor(.., SPROUT/SAPLING)
+      Add `PushSaplingAnchor`
+      Add consensus support for Sapling merkle trees.
+      Add support for Sapling anchor checks in mempool consistency checks.
+      Calculate the correct hashFinalSaplingRoot in the miner.
+      Adjust tests to handle Sapling anchor cache
+      Evict transactions with obsolete anchors from the mempool
+      Fix outdated comment
+      Fix broken error messages.
+      Fix miner tests
+      Update sapling-crypto and librustzcash
+      Swap bit endianness of test vectors
+      Remove unnecessary IsCoinbase() check. Coinbases are guaranteed to have empty vjoinsplit.
+      Refactor so that dataToBeSigned can be used later in the function for other purposes.
+      Update to latest librustzcash
+      Check Sapling Spend/Output proofs and signatures.
+      Integrate Groth16 verification and proving.
+      Update librustzcash again
+      Adjust tests and benchmarks
+      Switch Rust to 1.26 Stable.
+      Update librustzcash
+      Update Sapling testnet parameters
+      Update merkle tree and pedersen hash tests to account for new encoding
+      Change txdb prefixes for sapling and avoid writing unnecessary information.
+
+Simon Liu (16):
+      Part of #2966, extending Sprout tests to other epochs.
+      Closes #3134 - Least Authority Issue E
+      Refactoring: libzcash::Note is now a subclass of libzcash::BaseNote.
+      Refactoring: Rename class libzcash::Note to libzcash::SproutNote.
+      Refactoring: SproutNote member variable value moved to BaseNote.
+      Add virtual destructor to SproutNote and BaseNote
+      Remove unused SproutNote variables.
+      Refactoring: rename NotePlaintext --> SproutNotePlaintext
+      Create class hierarchy for SproutNotePlaintext.
+      Move memo member varible from SproutNotePlaintext to BaseNotePlaintext.
+      Tweaks to d0a1d83 to complete backport of Bitcoin PR #8704
+      Closes #3178 by adding verbosity level improvements to getblock RPC.
+      Fix undefined behaviour, calling memcpy with NULL pointer.
+      Closes #3250. Memo getter should return by reference, not by value.
+      make-release.py: Versioning changes for 1.1.1-rc2.
+      make-release.py: Updated manpages for 1.1.1-rc2.
+
+Tom Harding (1):
+      Add optional locktime to createrawtransaction
+
+UdjinM6 (2):
+      Fix exit codes:
+      Every main()/exit() should return/use one of EXIT_ codes instead of magic numbers
+
+Wladimir J. van der Laan (2):
+      rpc: Input-from-stdin mode for bitcoin-cli
+      doc: mention bitcoin-cli -stdin in release notes
+
+ca333 (2):
+      [fix] proton download path
+      update proton.mk
+
+kozyilmaz (2):
+      [macOS] added curl method for param download
+      [macOS] use shlock instead of flock in fetch-params
+
+mruddy (1):
+      Resolve issue bitcoin/bitcoin#3166.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.1.1.md b/depend/zcash/doc/release-notes/release-notes-1.1.1.md
new file mode 100644
index 000000000..90adec943
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.1.1.md
@@ -0,0 +1,336 @@
+Notable changes
+===============
+
+Sapling network upgrade
+-----------------------
+
+The consensus code preparations for the Sapling network upgrade, as described
+in [ZIP 243](https://github.com/zcash/zips/blob/master/zip-0243.rst) and the
+[Sapling spec](https://github.com/zcash/zips/blob/master/protocol/sapling.pdf)
+are finished and included in this release. Sapling support in the wallet and
+RPC is ongoing, and is expected to land in master over the next few weeks.
+
+The [Sapling MPC](https://blog.z.cash/announcing-the-sapling-mpc/) is currently
+working on producing the final Sapling parameters. In the meantime, Sapling will
+activate on testnet with dummy Sapling parameters at height 252500. This
+activation will be temporary, and the testnet will be rolled back by version
+2.0.0 so that both mainnet and testnet will be using the same parameters.
+Users who want to continue testing Overwinter should continue to run version
+1.1.0 on testnet, and then upgrade to 2.0.0 (which will be released after
+Overwinter activates).
+
+Sapling can also be activated at a specific height in regtest mode by
+setting the config options `-nuparams=5ba81b19:HEIGHT -nuparams=76b809bb:HEIGHT`.
+These config options will change when the testnet is rolled back for 2.0.0
+(because the branch ID for Sapling will change, due to us following the safe
+upgrade conventions we introduced in Overwinter).
+
+Users running testnet or regtest nodes will need to run
+`./zcutil/fetch-params.sh --testnet` (for users building from source) or
+`zcash-fetch-params --testnet` (for binary / Debian users).
+
+As a reminder, because the Sapling activation height is not yet specified for
+mainnet, version 1.1.1 will behave similarly as other pre-Sapling releases even
+after a future activation of Sapling on the network. Upgrading from 1.1.1 will
+be required in order to follow the Sapling network upgrade on mainnet.
+
+Sapling transaction format
+--------------------------
+
+Once Sapling has activated, transactions must use the new v4 format (including
+coinbase transactions). All RPC methods that create new transactions (such as
+`createrawtransaction` and `getblocktemplate`) will create v4 transactions once
+the Sapling activation height has been reached.
+
+zcash-cli: arguments privacy
+----------------------------
+
+The RPC command line client gained a new argument, `-stdin`
+to read extra arguments from standard input, one per line until EOF/Ctrl-D.
+For example:
+
+    $ src/zcash-cli -stdin walletpassphrase
+    mysecretcode
+    120
+    ^D (Ctrl-D)
+
+It is recommended to use this for sensitive information such as private keys, as
+command-line arguments can usually be read from the process table by any user on
+the system.
+
+Asm representations of scriptSig signatures now contain SIGHASH type decodes
+----------------------------------------------------------------------------
+
+The `asm` property of each scriptSig now contains the decoded signature hash
+type for each signature that provides a valid defined hash type.
+
+The following items contain assembly representations of scriptSig signatures
+and are affected by this change:
+
+- RPC `getrawtransaction`
+- RPC `decoderawtransaction`
+- REST `/rest/tx/` (JSON format)
+- REST `/rest/block/` (JSON format when including extended tx details)
+- `zcash-tx -json`
+
+For example, the `scriptSig.asm` property of a transaction input that
+previously showed an assembly representation of:
+
+    304502207fa7a6d1e0ee81132a269ad84e68d695483745cde8b541e3bf630749894e342a022100c1f7ab20e13e22fb95281a870f3dcf38d782e53023ee313d741ad0cfbc0c509001
+
+now shows as:
+
+    304502207fa7a6d1e0ee81132a269ad84e68d695483745cde8b541e3bf630749894e342a022100c1f7ab20e13e22fb95281a870f3dcf38d782e53023ee313d741ad0cfbc0c5090[ALL]
+
+Note that the output of the RPC `decodescript` did not change because it is
+configured specifically to process scriptPubKey and not scriptSig scripts.
+
+Changelog
+=========
+
+Cory Fields (4):
+      serialization: teach serializers variadics
+      build: univalue subdir build fixups
+      don't throw std::bad_alloc when out of memory. Instead, terminate immediately
+      prevector: assert successful allocation
+
+Daira Hopwood (1):
+      Use https: for BDB backup download URL.
+
+David Llop (1):
+      Update Payment API
+
+Eirik Ogilvie-Wigley (7):
+      Clarify help text of dumpprivkey
+      Add sapling nullifier set
+      Add enum for nullifier type
+      Add sapling nullifiers to db and mempool
+      Rename nullifier caches and maps to indicate sprout nullifiers
+      Make sure transactions have non-empty outputs
+      Coinbase transactions can not have shielded spend or output
+
+Jack Grigg (55):
+      Disable building libzcashconsensus by default
+      depends: Upgrade Rust to 1.26.0-beta.3
+      depends: Add support for unpackaged Rust crates
+      depends: Update to latest librustzcash with sapling-crypto dependencies
+      Add Sapling to upgrade list
+      Add static asserts to ensure CONTINUE_EXECUTION doesn't collide
+      [Bitcoin-Tx] Adjust util-test test cases for Zcash
+      Handle usage of prevector for CScript in Zcash-specific code
+      GetSerializeSize changes in Zcash-specific code
+      Remove nType and nVersion from Zcash-specific code
+      Adjust consensus rules to require v4 transactions from Sapling activation
+      Implement basic Sapling v4 transaction parser
+      Add Sapling v4 transactions to IsStandard
+      Pass transaction header into correct SignatureHash serialization level
+      Remove now-unshadowed serialization lines that do nothing
+      Implement SpendDescription and OutputDescription datastructures
+      Add a constant for Overwinter's transaction version
+      Return result of boost::apply_visitor
+      Improve best-effort logging before termination on OOM
+      Attempt to log before terminating if prevector allocation fails
+      Fix -Wstring-plus-int warning on clang
+      Update mempool_nu_activation RPC test to exercise both Overwinter and Sapling
+      Use CBitcoinAddress wrappers in Zcash-specific code
+      Change JSOutPoint constructor to have js argument be uint64_t
+      Update CreateNewContextualCMutableTransaction to create Sapling transactions
+      Expire Overwinter transactions before the Sapling activation height
+      Remove obsolete CreateJoinSplit and GenerateParams binaries
+      Add missing include guard
+      Raise 100kB transaction size limit from Sapling activation
+      Benchmark the largest valid Sapling transaction in validatelargetx
+      Rename MAX_TX_SIZE to MAX_TX_SIZE_AFTER_SAPLING
+      Rework z_sendmany z-address recipient limit
+      Add test of Sapling transaction size boundary
+      Update tests for CreateNewContextualCMutableTransaction changes
+      wallet: Change IsLockedNote to take a JSOutPoint
+      wallet: Make some arguments const that can be
+      Implement Sapling signature hash (ZIP 243)
+      Update sighash tests
+      Introduce wrappers around CZCPaymentAddress
+      Introduce wrappers around CZCSpendingKey
+      Introduce wrappers around CZCViewingKey
+      Implement {Encode,Decode}PaymentAddress etc. without CZCEncoding
+      Add key_io includes to Zcash-specific code
+      Add valueBalance to value balances, and enforce its consensus rules
+      Track net value entering and exiting the Sapling circuit
+      Add contextual comment for GetValueOut() and GetShieldedValueIn()
+      Use boost::variant to represent shielded addresses and keys
+      Correctly serialize Groth16 JSDescription for verifyjoinsplit benchmark
+      make-release.py: Versioning changes for 1.1.1-rc1.
+      make-release.py: Updated manpages for 1.1.1-rc1.
+      make-release.py: Updated release notes and changelog for 1.1.1-rc1.
+      Comment out Gitian library handling while we don't build any libraries
+      Add Sapling details to release notes
+      make-release.py: Versioning changes for 1.1.1.
+      make-release.py: Updated manpages for 1.1.1.
+
+Jay Graber (1):
+      Add test for dependent txs to mempool_tx_expiry.py
+
+Jeremy Rubin (1):
+      Fix subscript[0] in base58.cpp
+
+Jonas Schnelli (4):
+      [RPC] createrawtransaction: add option to set the sequence number per input
+      [bitcoin-tx] allow to set nSequence number over the in= command
+      [Bitcoin-Tx] Add tests for sequence number support
+      add bip32 pubkey serialization
+
+João Barbosa (1):
+      Remove unused GetKeyID and IsScript methods from CBitcoinAddress
+
+Karl-Johan Alm (1):
+      Removed using namespace std from bitcoin-cli/-tx and added std:: in appropriate places.
+
+Kaz Wesley (1):
+      CBase58Data::SetString: cleanse the full vector
+
+Larry Ruane (1):
+      fix qa/zcash/full_test_suite.py pathname
+
+MarcoFalke (3):
+      [uacomment] Sanitize per BIP-0014
+      [rpcwallet] Don't use floating point
+      [test] Remove unused code
+
+Matt Corallo (1):
+      Add COMPACTSIZE wrapper similar to VARINT for serialization
+
+Pavel Janík (1):
+      [WIP] Remove unused statement in serialization
+
+Pavol Rusnak (2):
+      implement uacomment config parameter     which can add comments to user agent as per BIP-0014
+      limit total length of user agent comments
+
+Pedro Branco (1):
+      Prevent multiple calls to ExtractDestination
+
+Per Grön (1):
+      Make some globals static that can be
+
+Peter Pratscher (1):
+      Backported Bitcoin PR #8704 to optionally return full tx details in the getblock rpc call
+
+Pieter Wuille (22):
+      Prevector type
+      Remove unused ReadVersion and WriteVersion
+      Make streams' read and write return void
+      Make nType and nVersion private and sometimes const
+      Make GetSerializeSize a wrapper on top of CSizeComputer
+      Get rid of nType and nVersion
+      Avoid -Wshadow errors
+      Make CSerAction's ForRead() constexpr
+      Add optimized CSizeComputer serializers
+      Use fixed preallocation instead of costly GetSerializeSize
+      Add serialization for unique_ptr and shared_ptr
+      Add deserializing constructors to CTransaction and CMutableTransaction
+      Avoid unaligned access in crypto i/o
+      Fix some empty vector references
+      Introduce wrappers around CBitcoinAddress
+      Move CBitcoinAddress to base58.cpp
+      Implement {Encode,Decode}Destination without CBitcoinAddress
+      Import Bech32 C++ reference code & tests
+      Convert base58_tests from type/payload to scriptPubKey comparison
+      Replace CBitcoinSecret with {Encode,Decode}Secret
+      Stop using CBase58Data for ext keys
+      Split key_io (address/key encodings) off from base58
+
+Puru (1):
+      bitcoin-cli.cpp: Use symbolic constant for exit code
+
+Sean Bowe (49):
+      Switch to latest librustzcash
+      Invoke the merkle_hash API in librustzcash via test suite.
+      Link with -ldl
+      Update librustzcash hash
+      Load Sapling testnet parameters into memory.
+      Update librustzcash hash
+      Check that duplicate Sapling nullifiers don't exist within a transaction.
+      Abstract `uncommitted` and depth personalization for IncrementalMerkleTree.
+      Add implementation of Sapling merkle tree
+      Add regression tests and test vectors for Sapling merkle tree
+      Rename NullifierType to ShieldedType.
+      Specifically describe anchors as Sprout anchors.
+      Rename hashAnchor to hashSproutAnchor.
+      Rename hashReserved to hashSaplingAnchorEnd.
+      Add primitive implementation of GetSaplingAnchorEnd.
+      Rename DB_ANCHOR to DB_SPROUT_ANCHOR.
+      Rename GetAnchorAt to GetSproutAnchorAt.
+      Rename PushAnchor to PushSproutAnchor.
+      Introduce support for GetBestAnchor(SAPLING).
+      Generalize the PopAnchor implementation behavior.
+      Generalize the PushAnchor implementation behavior.
+      Remove underscores from gtest test names.
+      Rename hashSaplingAnchorEnd to hashFinalSaplingRoot to match spec.
+      Rename hashSproutAnchorEnd to hashFinalSproutRoot to be consistent.
+      Add support for Sapling anchors in coins/txdb.
+      Add support for PopAnchor(.., SPROUT/SAPLING)
+      Add `PushSaplingAnchor`
+      Add consensus support for Sapling merkle trees.
+      Add support for Sapling anchor checks in mempool consistency checks.
+      Calculate the correct hashFinalSaplingRoot in the miner.
+      Adjust tests to handle Sapling anchor cache
+      Evict transactions with obsolete anchors from the mempool
+      Fix outdated comment
+      Fix broken error messages.
+      Fix miner tests
+      Update sapling-crypto and librustzcash
+      Swap bit endianness of test vectors
+      Remove unnecessary IsCoinbase() check. Coinbases are guaranteed to have empty vjoinsplit.
+      Refactor so that dataToBeSigned can be used later in the function for other purposes.
+      Update to latest librustzcash
+      Check Sapling Spend/Output proofs and signatures.
+      Integrate Groth16 verification and proving.
+      Update librustzcash again
+      Adjust tests and benchmarks
+      Switch Rust to 1.26 Stable.
+      Update librustzcash
+      Update Sapling testnet parameters
+      Update merkle tree and pedersen hash tests to account for new encoding
+      Change txdb prefixes for sapling and avoid writing unnecessary information.
+
+Simon Liu (18):
+      Part of #2966, extending Sprout tests to other epochs.
+      Closes #3134 - Least Authority Issue E
+      Refactoring: libzcash::Note is now a subclass of libzcash::BaseNote.
+      Refactoring: Rename class libzcash::Note to libzcash::SproutNote.
+      Refactoring: SproutNote member variable value moved to BaseNote.
+      Add virtual destructor to SproutNote and BaseNote
+      Remove unused SproutNote variables.
+      Refactoring: rename NotePlaintext --> SproutNotePlaintext
+      Create class hierarchy for SproutNotePlaintext.
+      Move memo member varible from SproutNotePlaintext to BaseNotePlaintext.
+      Tweaks to d0a1d83 to complete backport of Bitcoin PR #8704
+      Closes #3178 by adding verbosity level improvements to getblock RPC.
+      Fix undefined behaviour, calling memcpy with NULL pointer.
+      Closes #3250. Memo getter should return by reference, not by value.
+      make-release.py: Versioning changes for 1.1.1-rc2.
+      make-release.py: Updated manpages for 1.1.1-rc2.
+      make-release.py: Updated release notes and changelog for 1.1.1-rc2.
+      Closes #3301. Non-void function should not have empty definition.
+
+Tom Harding (1):
+      Add optional locktime to createrawtransaction
+
+UdjinM6 (2):
+      Fix exit codes:
+      Every main()/exit() should return/use one of EXIT_ codes instead of magic numbers
+
+Wladimir J. van der Laan (2):
+      rpc: Input-from-stdin mode for bitcoin-cli
+      doc: mention bitcoin-cli -stdin in release notes
+
+ca333 (2):
+      [fix] proton download path
+      update proton.mk
+
+kozyilmaz (2):
+      [macOS] added curl method for param download
+      [macOS] use shlock instead of flock in fetch-params
+
+mruddy (1):
+      Resolve issue bitcoin/bitcoin#3166.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.1.2-rc1.md b/depend/zcash/doc/release-notes/release-notes-1.1.2-rc1.md
new file mode 100644
index 000000000..91fdafd5a
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.1.2-rc1.md
@@ -0,0 +1,96 @@
+Notable changes
+===============
+
+`-disabledeprecation` removal
+-----------------------------
+
+In release 1.0.9 we implemented automatic deprecation of `zcashd` software
+versions made by the Zcash Company. The configuration option
+`-disabledeprecation` was added as a way for users to specifically choose to
+stay on a particular software version. However, it incorrectly implied that
+deprecated releases would still be supported.
+
+This release removes the `-disabledeprecation` option, so that `zcashd` software
+versions made by the Zcash Company will always shut down in accordance with the
+defined deprecation policy (currently 16 weeks after release). Users who wish to
+use a different policy must now specifically choose to either:
+
+- edit and compile the source code themselves, or
+- obtain a software version from someone else who has done so (and obtain
+  support from them).
+
+Either way, it is much clearer that the software they are running is not
+supported by the Zcash Company.
+
+Changelog
+=========
+
+Ariel Gabizon (1):
+      Improve/Fix variable names
+
+Daira Hopwood (1):
+      Update code_of_conduct.md
+
+Eirik Ogilvie-Wigley (5):
+      Add tests for sapling anchors
+      Add hashFinalSaplingRoot to getblocktemplate
+      Fix parsing parameters in getnetworksolps
+      Add BOOST_TEST_CONTEXT to distinguish sprout v. sapling
+      Rename typename
+
+Jack Grigg (16):
+      Replace boost::array with std::array
+      Add MacOS support to no-dot-so test
+      Whitespace cleanup
+      chainparams: Add Sapling Bech32 HRPs
+      ConvertBits() - convert from one power-of-2 number base to another.
+      Fix bech32::Encode() error handling
+      Implement encoding and decoding of Sapling keys and addresses
+      Add Mach-O 64-bit detection to security-check.py
+      Fix cached_witnesses_empty_chain test failure on MacOS
+      Skip ELF-only sec-hard checks on non-ELF binaries
+      Remove config option -disabledeprecation
+      Add release notes for -disabledeprecation removal
+      Add comment about size calculations for converted serialized keys
+      Add examples of ConvertBits transformation
+      Use CChainParams::Bech32HRP() in zs_address_test
+      Add hashFinalSaplingRoot to getblockheader and getblock output
+
+Jay Graber (8):
+      Add Sapling key classes to wallet, with new librustzcash APIs
+      Change librustzcash dependency hash to work for new Sapling classes
+      Update librustzcash dependency, address comments
+      Minimal sapling key test
+      Fix default_address()
+      s/SaplingInViewingKey/SaplingIncomingViewingKey
+      Make diversifier functions return option
+      Add json test vectors for Sapling key components.
+
+Jonathan "Duke" Leto (1):
+      Clarify help that signmessage only works on taddrs
+
+Larry Ruane (1):
+      (rpc-test) accurately account for fee without rounding error
+
+Matthew King (2):
+      Use portable #! in python scripts (/usr/bin/env)
+      Favour python over python2 as per PR #7723
+
+Paige Peterson (1):
+      include note about volunteers in CoC
+
+Pieter Wuille (2):
+      Generalize ConvertBits
+      Simplify Base32 and Base64 conversions
+
+Simon Liu (9):
+      Part of #3277. Add comment about deprecated txdb prefixes.
+      Remove now redundant Rust call to librustzcash_xor.
+      Add SaplingNote class and test_sapling_note unit test.
+      Refactor and replace factory method random() with constructor.
+      Return optional for Sapling commitments and nullifiers.
+      Closes #3328. Send alert to put non-Overwinter nodes into safe mode.
+      Fix pyflakes error in test zkey_import_export.
+      make-release.py: Versioning changes for 1.1.2-rc1.
+      make-release.py: Updated manpages for 1.1.2-rc1.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-1.1.2.md b/depend/zcash/doc/release-notes/release-notes-1.1.2.md
new file mode 100644
index 000000000..9041c1bb2
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-1.1.2.md
@@ -0,0 +1,99 @@
+Notable changes
+===============
+
+`-disabledeprecation` removal
+-----------------------------
+
+In release 1.0.9 we implemented automatic deprecation of `zcashd` software
+versions made by the Zcash Company. The configuration option
+`-disabledeprecation` was added as a way for users to specifically choose to
+stay on a particular software version. However, it incorrectly implied that
+deprecated releases would still be supported.
+
+This release removes the `-disabledeprecation` option, so that `zcashd` software
+versions made by the Zcash Company will always shut down in accordance with the
+defined deprecation policy (currently 16 weeks after release). Users who wish to
+use a different policy must now specifically choose to either:
+
+- edit and compile the source code themselves, or
+- obtain a software version from someone else who has done so (and obtain
+  support from them).
+
+Either way, it is much clearer that the software they are running is not
+supported by the Zcash Company.
+
+Changelog
+=========
+
+Ariel Gabizon (1):
+      Improve/Fix variable names
+
+Daira Hopwood (1):
+      Update code_of_conduct.md
+
+Eirik Ogilvie-Wigley (5):
+      Add tests for sapling anchors
+      Add hashFinalSaplingRoot to getblocktemplate
+      Fix parsing parameters in getnetworksolps
+      Add BOOST_TEST_CONTEXT to distinguish sprout v. sapling
+      Rename typename
+
+Jack Grigg (16):
+      Replace boost::array with std::array
+      Add MacOS support to no-dot-so test
+      Whitespace cleanup
+      chainparams: Add Sapling Bech32 HRPs
+      ConvertBits() - convert from one power-of-2 number base to another.
+      Fix bech32::Encode() error handling
+      Implement encoding and decoding of Sapling keys and addresses
+      Add Mach-O 64-bit detection to security-check.py
+      Fix cached_witnesses_empty_chain test failure on MacOS
+      Skip ELF-only sec-hard checks on non-ELF binaries
+      Remove config option -disabledeprecation
+      Add release notes for -disabledeprecation removal
+      Add comment about size calculations for converted serialized keys
+      Add examples of ConvertBits transformation
+      Use CChainParams::Bech32HRP() in zs_address_test
+      Add hashFinalSaplingRoot to getblockheader and getblock output
+
+Jay Graber (8):
+      Add Sapling key classes to wallet, with new librustzcash APIs
+      Change librustzcash dependency hash to work for new Sapling classes
+      Update librustzcash dependency, address comments
+      Minimal sapling key test
+      Fix default_address()
+      s/SaplingInViewingKey/SaplingIncomingViewingKey
+      Make diversifier functions return option
+      Add json test vectors for Sapling key components.
+
+Jonathan "Duke" Leto (1):
+      Clarify help that signmessage only works on taddrs
+
+Larry Ruane (1):
+      (rpc-test) accurately account for fee without rounding error
+
+Matthew King (2):
+      Use portable #! in python scripts (/usr/bin/env)
+      Favour python over python2 as per PR #7723
+
+Paige Peterson (1):
+      include note about volunteers in CoC
+
+Pieter Wuille (2):
+      Generalize ConvertBits
+      Simplify Base32 and Base64 conversions
+
+Simon Liu (12):
+      Part of #3277. Add comment about deprecated txdb prefixes.
+      Remove now redundant Rust call to librustzcash_xor.
+      Add SaplingNote class and test_sapling_note unit test.
+      Refactor and replace factory method random() with constructor.
+      Return optional for Sapling commitments and nullifiers.
+      Closes #3328. Send alert to put non-Overwinter nodes into safe mode.
+      Fix pyflakes error in test zkey_import_export.
+      make-release.py: Versioning changes for 1.1.2-rc1.
+      make-release.py: Updated manpages for 1.1.2-rc1.
+      make-release.py: Updated release notes and changelog for 1.1.2-rc1.
+      make-release.py: Versioning changes for 1.1.2.
+      make-release.py: Updated manpages for 1.1.2.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.0.0-rc1.md b/depend/zcash/doc/release-notes/release-notes-2.0.0-rc1.md
new file mode 100644
index 000000000..9033a31a6
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.0.0-rc1.md
@@ -0,0 +1,176 @@
+Changelog
+=========
+
+Alex Morcos (1):
+      Output line to debug.log when IsInitialBlockDownload latches to false
+
+Ariel Gabizon (1):
+      Extend Joinsplit tests to Groth
+
+Charlie OKeefe (1):
+      Remove extra slash from lockfile path
+
+Cory Fields (1):
+      crypter: shuffle Makefile so that crypto can be used by the wallet
+
+Daira Hopwood (1):
+      Support testnet rollback.
+
+Daniel Cousens (2):
+      move rpc* to rpc/
+      rpc: update inline comments to refer to new file paths
+
+Dimitris Apostolou (1):
+      Fix typos
+
+Duke Leto (3):
+      Fix absurd fee bug reported in #3281, with tests
+      Update comment as per @arielgabizon
+      Improve error message
+
+Eirik Ogilvie-Wigley (24):
+      Add more options when asserting in RPC tests
+      Add change indicator for notes
+      Fix test broken by change indicator
+      Rename note data to include sprout
+      Remove redundant curly braces
+      Consolidate for loops
+      Add out point for sapling note data
+      Add sapling note data and map
+      Decrement sapling note witnesses
+      Clear sapling witness cache
+      Extract method for copying previous witnesses
+      Extract methods for incrementing witnesses
+      Extract method for incrementing witness heights
+      Pass sapling merkle tree when incrementing witnesses
+      Increment sapling note witnesses
+      Rename sprout specific methods
+      Remove extra indentation
+      Add getter and setter for sapling note data and update tests
+      Add parameter for version in GetValidReceive
+      Rename Merkle Trees to include sprout or sapling
+      Rename Witnesses to include sprout or sapling
+      Rename test objects to include sprout or sapling
+      Only include the change field if we have a spending key
+      Fix assertion and comment
+
+Gregory Maxwell (2):
+      IBD check uses minimumchain work instead of checkpoints.
+      IsInitialBlockDownload no longer uses header-only timestamps.
+
+Jack Grigg (38):
+      Add some more checkpoints, up to the 1.1.0 release
+      Add Sapling support to z_validateaddress
+      Update payment-api.md with type field of z_validateaddress
+      Alter SaplingNote::nullifier() to take a SaplingFullViewingKey
+      Expose note position in IncrementalMerkleWitness
+      TransactionBuilder with support for creating Sapling-only transactions
+      TransactionBuilder: Check that all anchors in a transaction are identical
+      Formatting
+      test: Move ECC_Start() call into src/gtest/main.cpp
+      TransactionBuilder: Add support for transparent inputs and outputs
+      TransactionBuilder: Add change output to transaction
+      TransactionBuilder: Make fee configurable
+      Rename xsk to expsk
+      Implement CKeyStore::GetSaplingPaymentAddresses()
+      Raise the 90-character limit on Bech32 encodings
+      Add Sapling support to z_getnewaddress and z_listaddresses
+      Fix block hash for checkpoint at height 270000
+      Formatting
+      test: Deduplicate logic in wallet_addresses RPC test
+      test: Another assert in wallet_zkeys_tests.store_and_load_sapling_zkeys
+      test: Fix permissions of wallet_addresses
+      test: Update rpc_wallet_z_importexport to account for Sapling changes
+      Rename DecryptSpendingKey -> DecryptSproutSpendingKey
+      Rename CryptedSpendingKeyMap -> CryptedSproutSpendingKeyMap
+      Add Sapling decryption check to CCryptoKeyStore::Unlock()
+      Check for unencrypted Sapling keys in CCryptoKeyStore::SetCrypted()
+      Remove outdated comment
+      Add CWallet::AddCryptedSaplingSpendingKey() hook
+      Pass SaplingPaymentAddress to store through the CKeyStore
+      Rename SpendingKeyMap -> SproutSpendingKeyMap
+      Rename Serialized*Size -> SerializedSprout*Size
+      Rename *ViewingKey* -> *SproutViewingKey*
+      Formatting nits
+      Rename *SpendingKey -> *SproutSpendingKey
+      chainparams: Add BIP 44 coin type (as registered in SLIP 44)
+      Upgrade Rust to 1.28.0 stable
+      Adjust Makefile so that common can be used by the wallet
+      Move RewindBlockIndex log message inside rewindLength check
+
+Jay Graber (13):
+      Add Sapling Add/Have/Get to keystore
+      Add SaplingIncomingViewingKeys map, SaplingFullViewingKey methods
+      Add StoreAndRetrieveSaplingSpendingKey test
+      Change default_address to return SaplingPaymentAddr and not boost::optional
+      Add crypted keystore sapling add key
+      Discard sk if ivk == 0
+      Add Sapling support to z_exportkey
+      Add Sapling support to z_importkey
+      Add Sapling to rpc_wallet_z_importexport test
+      Refactor into visitors and throw errors for invalid key or address.
+      Take expiryheight as param to createrawtransaction
+      Add Sapling have/get sk crypter overrides
+      Add Sapling keys to CCryptoKeyStore::EncryptKeys
+
+Jonas Schnelli (2):
+      [RPC, Wallet] Move RPC dispatch table registration to wallet/ code
+      Fix test_bitcoin circular dependency issue
+
+Kaz Wesley (1):
+      IsInitialBlockDownload: usually avoid locking
+
+Larry Ruane (4):
+      Disable libsnark debug logging in Boost tests
+      add extra help how to enable experimental features
+      Add call to sync_all() after (z_sendmany, wait)
+      don't ban peers when loading pre-overwinter blocks
+
+Pejvan (2):
+      Update README.md
+      Update README.md
+
+Richard Littauer (1):
+      docs(LICENSE): update license year to 2018
+
+Sean Bowe (18):
+      Update librustzcash
+      Implementation of Sapling in-band secret distribution.
+      Swap types in OutputDescription to use new NoteEncryption interfaces.
+      Prevent nonce reuse in Sapling note encryption API.
+      Add get_esk() function to Sapling note encryption.
+      Minor edits
+      Decryption and tests of note/outgoing encryption.
+      Update librustzcash and sapling-crypto.
+      Fix bug in return value.
+      Ensure sum of valueBalance and all vpub_new's does not exceed MAX_MONEY inside of CheckTransactionWithoutProofVerification.
+      Move `extern params` to beginning of `test_checktransaction`.
+      Relocate ECC_Start() to avoid test failures.
+      Don't call ECC_Start/ECC_Stop outside the test harness.
+      Make changes to gtest ECC behavior suggested by @str4d.
+      Check the hash of the (Sapling+) zk-SNARK parameters during initialization.
+      Switch to use the official Sapling parameters.
+      make-release.py: Versioning changes for 2.0.0-rc1.
+      make-release.py: Updated manpages for 2.0.0-rc1.
+
+Simon Liu (9):
+      Add encryption of SaplingNotePlaintext and SaplingOutgoingPlaintext classes.
+      Update and fix per review comments, the test for absurd fee.
+      Minor update to address nits in review.
+      Implement Sapling note decryption using full viewing key.
+      Rename AttemptSaplingEncDecryptionUsingFullViewingKey and use function overloading.
+      Only check for a valid Sapling anchor after Sapling activation.
+      Clean up for rebase: rename mapNoteData to mapSproutNoteData.
+      Clean up help messages for RPC createrawtransaction.
+      Add tests for expiryheight parameter of RPC createrawtransaction.
+
+Wladimir J. van der Laan (2):
+      Make max tip age an option instead of chainparam
+      rpc: Register calls where they are defined
+
+kozyilmaz (1):
+      Add -Wl,-pie linker option for macOS and use it instead of -pie
+
+mdr0id (1):
+      Fix minor references to auto-senescence in code
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.0.0.md b/depend/zcash/doc/release-notes/release-notes-2.0.0.md
new file mode 100644
index 000000000..7dcbf5d6a
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.0.0.md
@@ -0,0 +1,199 @@
+Notable changes
+===============
+
+Sapling network upgrade
+-----------------------
+
+The activation height for the Sapling network upgrade on mainnet is included
+in this release. Sapling will activate on mainnet at height 419200, which is
+expected to be mined on the 28th of October 2018. Please upgrade to this release,
+or any subsequent release, in order to follow the Sapling network upgrade.
+
+The testnet is being rolled back in this release to Overwinter. Sapling will
+activate on testnet at height 280000. Please update your testnet nodes before
+then.
+
+Changelog
+=========
+
+Alex Morcos (1):
+      Output line to debug.log when IsInitialBlockDownload latches to false
+
+Ariel Gabizon (1):
+      Extend Joinsplit tests to Groth
+
+Charlie OKeefe (1):
+      Remove extra slash from lockfile path
+
+Cory Fields (1):
+      crypter: shuffle Makefile so that crypto can be used by the wallet
+
+Daira Hopwood (1):
+      Support testnet rollback.
+
+Daniel Cousens (2):
+      move rpc* to rpc/
+      rpc: update inline comments to refer to new file paths
+
+Dimitris Apostolou (1):
+      Fix typos
+
+Duke Leto (3):
+      Fix absurd fee bug reported in #3281, with tests
+      Update comment as per @arielgabizon
+      Improve error message
+
+Eirik Ogilvie-Wigley (24):
+      Add more options when asserting in RPC tests
+      Add change indicator for notes
+      Fix test broken by change indicator
+      Rename note data to include sprout
+      Remove redundant curly braces
+      Consolidate for loops
+      Add out point for sapling note data
+      Add sapling note data and map
+      Decrement sapling note witnesses
+      Clear sapling witness cache
+      Extract method for copying previous witnesses
+      Extract methods for incrementing witnesses
+      Extract method for incrementing witness heights
+      Pass sapling merkle tree when incrementing witnesses
+      Increment sapling note witnesses
+      Rename sprout specific methods
+      Remove extra indentation
+      Add getter and setter for sapling note data and update tests
+      Add parameter for version in GetValidReceive
+      Rename Merkle Trees to include sprout or sapling
+      Rename Witnesses to include sprout or sapling
+      Rename test objects to include sprout or sapling
+      Only include the change field if we have a spending key
+      Fix assertion and comment
+
+Gregory Maxwell (2):
+      IBD check uses minimumchain work instead of checkpoints.
+      IsInitialBlockDownload no longer uses header-only timestamps.
+
+Jack Grigg (41):
+      Add some more checkpoints, up to the 1.1.0 release
+      Add Sapling support to z_validateaddress
+      Update payment-api.md with type field of z_validateaddress
+      Alter SaplingNote::nullifier() to take a SaplingFullViewingKey
+      Expose note position in IncrementalMerkleWitness
+      TransactionBuilder with support for creating Sapling-only transactions
+      TransactionBuilder: Check that all anchors in a transaction are identical
+      Formatting
+      test: Move ECC_Start() call into src/gtest/main.cpp
+      TransactionBuilder: Add support for transparent inputs and outputs
+      TransactionBuilder: Add change output to transaction
+      TransactionBuilder: Make fee configurable
+      Rename xsk to expsk
+      Implement CKeyStore::GetSaplingPaymentAddresses()
+      Raise the 90-character limit on Bech32 encodings
+      Add Sapling support to z_getnewaddress and z_listaddresses
+      Fix block hash for checkpoint at height 270000
+      Formatting
+      test: Deduplicate logic in wallet_addresses RPC test
+      test: Another assert in wallet_zkeys_tests.store_and_load_sapling_zkeys
+      test: Fix permissions of wallet_addresses
+      test: Update rpc_wallet_z_importexport to account for Sapling changes
+      Rename DecryptSpendingKey -> DecryptSproutSpendingKey
+      Rename CryptedSpendingKeyMap -> CryptedSproutSpendingKeyMap
+      Add Sapling decryption check to CCryptoKeyStore::Unlock()
+      Check for unencrypted Sapling keys in CCryptoKeyStore::SetCrypted()
+      Remove outdated comment
+      Add CWallet::AddCryptedSaplingSpendingKey() hook
+      Pass SaplingPaymentAddress to store through the CKeyStore
+      Rename SpendingKeyMap -> SproutSpendingKeyMap
+      Rename Serialized*Size -> SerializedSprout*Size
+      Rename *ViewingKey* -> *SproutViewingKey*
+      Formatting nits
+      Rename *SpendingKey -> *SproutSpendingKey
+      chainparams: Add BIP 44 coin type (as registered in SLIP 44)
+      Upgrade Rust to 1.28.0 stable
+      Adjust Makefile so that common can be used by the wallet
+      Move RewindBlockIndex log message inside rewindLength check
+      test: gtest for Sapling encoding and decoding
+      test: Use regtest in key_tests/zs_address_test
+      Disable Sapling features on mainnet
+
+Jay Graber (13):
+      Add Sapling Add/Have/Get to keystore
+      Add SaplingIncomingViewingKeys map, SaplingFullViewingKey methods
+      Add StoreAndRetrieveSaplingSpendingKey test
+      Change default_address to return SaplingPaymentAddr and not boost::optional
+      Add crypted keystore sapling add key
+      Discard sk if ivk == 0
+      Add Sapling support to z_exportkey
+      Add Sapling support to z_importkey
+      Add Sapling to rpc_wallet_z_importexport test
+      Refactor into visitors and throw errors for invalid key or address.
+      Take expiryheight as param to createrawtransaction
+      Add Sapling have/get sk crypter overrides
+      Add Sapling keys to CCryptoKeyStore::EncryptKeys
+
+Jonas Schnelli (2):
+      [RPC, Wallet] Move RPC dispatch table registration to wallet/ code
+      Fix test_bitcoin circular dependency issue
+
+Kaz Wesley (1):
+      IsInitialBlockDownload: usually avoid locking
+
+Larry Ruane (4):
+      Disable libsnark debug logging in Boost tests
+      add extra help how to enable experimental features
+      Add call to sync_all() after (z_sendmany, wait)
+      don't ban peers when loading pre-overwinter blocks
+
+Pejvan (2):
+      Update README.md
+      Update README.md
+
+Richard Littauer (1):
+      docs(LICENSE): update license year to 2018
+
+Sean Bowe (21):
+      Update librustzcash
+      Implementation of Sapling in-band secret distribution.
+      Swap types in OutputDescription to use new NoteEncryption interfaces.
+      Prevent nonce reuse in Sapling note encryption API.
+      Add get_esk() function to Sapling note encryption.
+      Minor edits
+      Decryption and tests of note/outgoing encryption.
+      Update librustzcash and sapling-crypto.
+      Fix bug in return value.
+      Ensure sum of valueBalance and all vpub_new's does not exceed MAX_MONEY inside of CheckTransactionWithoutProofVerification.
+      Move `extern params` to beginning of `test_checktransaction`.
+      Relocate ECC_Start() to avoid test failures.
+      Don't call ECC_Start/ECC_Stop outside the test harness.
+      Make changes to gtest ECC behavior suggested by @str4d.
+      Check the hash of the (Sapling+) zk-SNARK parameters during initialization.
+      Switch to use the official Sapling parameters.
+      make-release.py: Versioning changes for 2.0.0-rc1.
+      make-release.py: Updated manpages for 2.0.0-rc1.
+      make-release.py: Updated release notes and changelog for 2.0.0-rc1.
+      Always write the empty root down as the best root, since we may roll back.
+      Sapling mainnet activation height
+
+Simon Liu (11):
+      Add encryption of SaplingNotePlaintext and SaplingOutgoingPlaintext classes.
+      Update and fix per review comments, the test for absurd fee.
+      Minor update to address nits in review.
+      Implement Sapling note decryption using full viewing key.
+      Rename AttemptSaplingEncDecryptionUsingFullViewingKey and use function overloading.
+      Only check for a valid Sapling anchor after Sapling activation.
+      Clean up for rebase: rename mapNoteData to mapSproutNoteData.
+      Clean up help messages for RPC createrawtransaction.
+      Add tests for expiryheight parameter of RPC createrawtransaction.
+      make-release.py: Versioning changes for 2.0.0.
+      make-release.py: Updated manpages for 2.0.0.
+
+Wladimir J. van der Laan (2):
+      Make max tip age an option instead of chainparam
+      rpc: Register calls where they are defined
+
+kozyilmaz (1):
+      Add -Wl,-pie linker option for macOS and use it instead of -pie
+
+mdr0id (1):
+      Fix minor references to auto-senescence in code
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.0.1-rc1.md b/depend/zcash/doc/release-notes/release-notes-2.0.1-rc1.md
new file mode 100644
index 000000000..683d5ed22
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.0.1-rc1.md
@@ -0,0 +1,244 @@
+Notable changes
+===============
+
+Hierarchical Deterministic Key Generation for Sapling
+-----------------------------------------------------
+All Sapling addresses will use hierarchical deterministic key generation
+according to ZIP 32 (keypath m/32'/133'/k' on mainnet). Transparent and
+Sprout addresses will still use traditional key generation.
+
+Backups of HD wallets, regardless of when they have been created, can
+therefore be used to re-generate all possible Sapling private keys, even the
+ones which haven't already been generated during the time of the backup.
+Regular backups are still necessary, however, in order to ensure that
+transparent and Sprout addresses are not lost.
+
+[Pull request](https://github.com/zcash/zcash/pull/3492), [ZIP 32](https://github.com/zcash/zips/blob/master/zip-0032.mediawiki)
+
+Changelog
+=========
+
+David Mercer (2):
+      libsnark: convert long long and unsigned long to C++11 fixed-width types
+      libsnark: convert 0ul to UINT64_C(0)
+
+Eirik Ogilvie-Wigley (22):
+      Rename map to include sprout
+      Add sapling spending keys to z_exportwallet
+      Rename AddZKey to include sprout
+      Move AddSpendingKeyToWallet
+      Return more information when adding a spending key
+      Add sapling support to z_importwallet
+      Export comment on HDSeed and fingerprint with wallet
+      Export zip32 metadata with sapling keys
+      Don't export empty zip32 metadata
+      Allow more information to be returned when an async rpc fails
+      Use utility method to wait for async operations
+      Remove unneeded semicolons
+      Remove unused imports
+      Allow passing timeout parameter to wait_and_assert_operationid_status
+      Add test for signing raw transactions offline
+      Incorporate APPROX_RELEASE_HEIGHT when determining what consensus branch to sign with
+      Allow passing branchId when calling signrawtransaction
+      Remove unused import
+      Address need not be optional when adding sapling keys
+      Use max priority for all shielded transfers
+      Move FIXME comment to where the fix should happen
+      Add newly discovered sapling addresses to the wallet
+
+George Tankersley (2):
+      Refactor ContextualCheckBlock tests (#3187)
+      Refactor ContextualCheckBlock tests
+
+Jack Grigg (83):
+      [ci-workers] Install Python modules in a virtualenv
+      [ci-workers] Handle user home directories outside /home
+      [ci-workers] Handle ansible_processor being either a string or a list
+      [ci-workers] Add support for MacOSX
+      [ci-workers] Add a tag for updating dependencies
+      [ci-workers] Add curl and cmake to dependencies
+      [ci-workers] README cleanups
+      [ci-workers] Add pkg-config to general dependencies
+      depends: Correctly configure Rust when cross-compiling
+      depends: Configure librustzcash for cross-compiling
+      depends: Fix BDB naming issue when cross-compiling
+      zcutil/build.sh: Use $HOST to specify the depends prefix
+      configure: Don't require RELRO and BIND_NOW when cross-compiling
+      Measure Windows console size for metrics UI
+      Use -O1 for darwin and mingw32 release builds
+      Clean up libzcash CPPFLAGS, CXXFLAGS, and LDFLAGS
+      zcutil/build.sh: Use config.site to set default ./configure settings
+      zcutil/build.sh: Remove --enable-werror from default configuration
+      Pass correct compiler, linker, and flags into libsnark
+      Use boost::filesystem::path::string() instead of path::native()
+      Metrics UI: Enable virtual terminal sequence processing on Windows
+      Metrics UI: Tell Windows users how to stop zcashd
+      depends: Pass correct compiler, linker, and flags into googletest
+      configure: Don't add -ldl to RUST_LIBS for mingw32
+      test: Fix comment in WalletTests.FindMySaplingNotes
+      Add Sapling support to GetFilteredNotes() and GetUnspentFilteredNotes()
+      Add Sapling support to z_getbalance and z_gettotalbalance
+      Metrics UI: Fall back to 80 cols if GetConsoleScreenBufferInfo() fails
+      libsnark: Adjust SHA256 K value type to match the constant
+      libsnark: Use mp_limb_t cast instead of uint64_t when masking bigint.data
+      libsnark: Fix stale comment
+      rpc: Clarify Sprout shielded addresses in help text
+      rpc: Clarify ivk balance issues in help text
+      Move GetSpendingKeyForPaymentAddress visitor into wallet.h
+      wallet: Add HaveSpendingKeyForPaymentAddress visitor
+      rpcwallet: Add TransactionBuilder argument to AsyncRPCOperation_sendmany
+      rpcwallet: Prevent use of both Sprout and Sapling addresses in z_sendmany
+      rpcwallet: Add Sapling support to z_sendmany
+      Define additional booleans for readability
+      Ensure SCOPED_TRACE falls out of scope when necessary
+      Revert NU activation heights in reverse order
+      Fix test after refactor to check bacd-cb-height rule on a genesis block
+      Rename GetFirstBlockTransaction() to GetFirstBlockCoinbaseTx()
+      libsnark: Force constants used in test comparisons to be unsigned
+      libsnark: Use format macro constants for printing fixed-width values
+      Rename z_inputs_ to z_sprout_inputs_
+      Minor cleanups
+      Fix RPC test that checks exact wording of cleaned-up error message
+      Fix file permissions of wallet_sapling RPC test
+      Update librustzcash with ZIP 32 APIs
+      ZIP 32 Sapling structs
+      Store HDSeed in CBasicKeyStore
+      Store HDSeed in CCryptoKeyStore
+      wallet: Store HDSeed and chain data
+      wallet: Store Sapling key metadata indexed by ivk
+      wallet: Switch from SaplingSpendingKey to SaplingExtendedSpendingKey
+      init: Generate a new HD seed on startup
+      wallet: Comment out HDSeed and CHDChain persistence to disk
+      Add ZIP 32 usage to release notes
+      wallet: Don't allow an HDSeed to be overwritten
+      Bugfix: Use time instead of block height for Sapling key metadata
+      net: Check against the current epoch's version when rejecting nodes
+      Extract a helper method for finding the next epoch
+      net: Check against the next epoch's version when evicting peers
+      net: Check against the current epoch's version when disconnecting peers
+      qa: Test both Overwinter and Sapling peer management
+      Use ovk directly in the TransactionBuilder API instead of fvk
+      Generate an ovk to encrypt outCiphertext for t-addr senders
+      Revert "Disable Sapling features on mainnet"
+      Use the correct empty memo for Sapling outputs
+      Add Sapling support to z_shieldcoinbase
+      Revert "Get rid of consensus.fPowAllowMinDifficultyBlocks."
+      Revert "Remove testnet-only difficulty rules"
+      Allow minimum-difficulty blocks on testnet and regtest
+      Only enable min-difficulty blocks on testnet from a particular height
+      Update wallet_listreceived test for now-correct empty Sapling memos
+      Rename min-difficulty flag to remove off-by-one in the name
+      Explicitly check the min-difficulty flag against boost::none
+      Position PoW.MinDifficultyRules test after rule activates
+      Fix pyflakes warnings
+      Store ExtFVK with encrypted Sapling spending key instead of FVK
+      Persist Sapling payment address to IVK map
+      Ignore decoding errors during -zapwallettxes
+
+Jay Graber (5):
+      s/jsoutindex/outindex for sapling outputs
+      z_listunspent sapling support - needs refactor
+      Add rpc test for sprout txs z_listunspent
+      Modify comments
+      Modify GetNullifiersForAddresses for Sapling
+
+Jonas Schnelli (3):
+      [Wallet] extend CKeyMetadata with HD keypath     Zcash: modified for zip32
+      [Wallet] print hd masterkeyid in getwalletinfo     Zcash: modified for zip32
+      [Wallet] ensure CKeyMetadata.hdMasterKeyID will be cleared during SetNull()     Zcash: modified for zip32
+
+Larry Ruane (5):
+      generalize mininode.py protocol versioning
+      Test peer banning logic in both pre- and post-initial block download states
+      Sapling support for z_listreceivedbyaddress
+      z_listunspent rpc unit test: add testing for Sapling
+      fix z_listunspent includeWatchonly logic
+
+Marius Kjærstad (3):
+      Fix for license not being valid
+      Update debian package copyright license
+      Missing comma in debian package copyright license
+
+Sean Bowe (1):
+      Check commitment validity within the decryption API for Sapling note plaintexts.
+
+Simon Liu (59):
+      Rename FindMyNotes to FindMySproutNotes.
+      Rename GetNoteNullifier to GetSproutNoteNullifier.
+      Rename mapNullifiersToNotes to mapSproutNullifiersToNotes.
+      Rename CWallet::AddToSpends methods for clarity.
+      Rename mapTxNullifiers to mapTxSproutNullifiers.
+      Add ivk member variable and equality comparators to SaplingNoteData class.
+      Update CWallet::MarkAffectedTransactionsDirty() for Sapling.
+      Update CWallet::UpdatedNoteData() for Sapling.
+      Create CWallet::AddToSaplingSpends() to track Sapling nullifiers.
+      Update test to pass in required cm to SaplingNotePlaintext::decrypt().
+      Create CWallet::FindMySaplingNotes()
+      Rename IsFromMe(nullifier) to IsSproutNullifierFromMe(nullifier).
+      Create CWallet::IsSaplingNullifierFromMe()
+      Remove dead code in CWalletTx::GetAmounts() as filed in issue #3434.
+      Cleanup CWalletTx::GetAmounts() for clarity.  No-op.
+      Update CWalletTx::GetAmounts() to return COutputEntry for Sapling valueBalance.
+      Add caching and updating of Sapling note nullifier.
+      Update CWallet::IsSpent() to check Sapling nullifiers.
+      Clean up names of unit tests in gtest/test_wallet.cpp.
+      Add test for CWalletTx::SetSaplingNoteData()
+      Iterate over mapSaplingFullViewingKeys with ivk->fvk mapping (1:1).
+      Refactor IsSpent(nullifier) for Sprout and Sapling domain separation.
+      Fix code review nits.
+      Add two new wallet tests: FindMySaplingNotes, SaplingNullifierIsSpent.
+      Add new wallet test: NavigateFromSaplingNullifierToNote
+      Add new wallet test: UpdatedSaplingNoteData.
+      Add new wallet tests: SpentSaplingNoteIsFromMe.
+      Rename wallet tests for clarity between Sprout and Sapling.
+      Fix typo in variable name in test.
+      Fix inaccurate comments in test.
+      Fix typo in parameter name.
+      Update CWallet::GetConflicts for Sapling.
+      Add new wallet test: SetSaplingNoteAddrsInCWalletTx.
+      Add new wallet test: GetConflictedSaplingNotes
+      Add new wallet test: MarkAffectedSaplingTransactionsDirty
+      Update wallet unit tests to revert upgraded network parameters.
+      Clean up wallet unit tests: replace .value() with .get() for clarity.
+      Fix comment in CWallet::SyncMetaData.
+      Refactor: rename setLockedNotes -> setLockedSproutNotes
+      Refactor: rename UnlockAllNotes -> UnlockAllSproutNotes
+      Refactor: rename ListLockedNotes -> ListLockedSproutNotes
+      Add methods to store SaplingOutPoint in setLockedSaplingNotes
+      Add unit test SaplingNoteLocking
+      Update comment for test ContextualCheckBlockTest.BlockSproutRulesRejectOtherTx
+      Add Sapling fields to JSON RPC output using TxToJSON.
+      Update qa test to check for Sapling related JSON fields.
+      Closes #3534. Do not use APPROX_RELEASE_HEIGHT to get consensus branch     id when in regtest mode.
+      For #3533. Replace asserts with JSON errors.
+      Update qa test as offline regtest nodes need branch id passed in.
+      Fix rebasing of CWallet::GetNullifiersForAddresses
+      Cleanup to address review comments.
+      Add test that Sapling shielded transactions have MAX_PRIORITY
+      Closes #3560. Update Sapling note data correctly when importing a key.
+      For #3546. Shielded tx with missing inputs are not treated as orphans.
+      For #3546. Improve estimated tx size for Sapling outputs.
+      Fix deadlock from calling CWallet::AddSaplingIncomingViewingKey instead of CBasicKeyStore::AddSaplingIncomingViewingKey
+      Fix file permissions of QA test wallet_persistence.py
+      Update wallet_persistence test to verify wallet txs are persisted across restarts.
+      Update wallet_persistence test to verify spending notes after restart.
+
+WO (4):
+      Fix a bug of Windows binary
+      Add an assert for num_bits function
+      long -> int64_t
+      The long data type is replaced with int64_t
+
+Za Wilcox (1):
+      Revise help output for z_sendmany
+
+mdr0id (8):
+      Resolve final edits for README
+      Revert "wallet: Comment out HDSeed and CHDChain persistence to disk"
+      Persist Sapling key material in the wallet to disk
+      Serialize Sapling data in CWalletTx
+      Adding in rpc wallet sap for test_bitcoin
+      Add gtest coverage of Sapling wallet persistence
+      make-release.py: Versioning changes for 2.0.1-rc1.
+      make-release.py: Updated manpages for 2.0.1-rc1.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.0.1.md b/depend/zcash/doc/release-notes/release-notes-2.0.1.md
new file mode 100644
index 000000000..b4dad7c25
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.0.1.md
@@ -0,0 +1,276 @@
+Notable changes
+===============
+
+Enabled Sapling features for mainnet
+------------------------------------
+This release adds significant support for Sapling to the wallet and RPC interface. Sapling will activate at block 419200, which is expected to be mined on the 28th of October 2018. Users running v2.0.0 nodes (which are consensus-compatible with Sapling) will follow the network upgrade, but must upgrade to v2.0.1 in order to send or receive Sapling shielded transactions.
+
+Minimum Difficulty Blocks allowed on testnet
+--------------------------------------------
+Sapling activated on testnet at block 280000. Users running v2.0.0 nodes should upgrade to v2.0.1 which introduces a consensus rule change to allow minimum difficulty blocks to be mined from block 299188, thereby splitting the chain.  In addition, users running v2.0.1 nodes no longer need to specify `-experimentalfeatures` and `-developersapling` to use Sapling functionality on testnet.
+
+[Pull request](https://github.com/zcash/zcash/pull/3559)
+
+Hierarchical Deterministic Key Generation for Sapling
+-----------------------------------------------------
+All Sapling addresses will use hierarchical deterministic key generation
+according to ZIP 32 (keypath m/32'/133'/k' on mainnet). Transparent and
+Sprout addresses will still use traditional key generation.
+
+Backups of HD wallets, regardless of when they have been created, can
+therefore be used to re-generate all possible Sapling private keys, even the
+ones which haven't already been generated during the time of the backup.
+Regular backups are still necessary, however, in order to ensure that
+transparent and Sprout addresses are not lost.
+
+[Pull request](https://github.com/zcash/zcash/pull/3492), [ZIP 32](https://github.com/zcash/zips/blob/master/zip-0032.mediawiki)
+
+Fix Signing Raw Transactions with Unsynced Offline Nodes
+--------------------------------------------------------
+With v2.0.0, in `signrawtransaction` the consensus branch ID (which is used to construct the transaction) was estimated using the chain height. With v2.0.1 this has been improved by also considering the `APPROX_RELEASE_HEIGHT` of the release, and a new parameter to allow the caller to manually override the consensus branch ID that zcashd will use.
+
+[Pull request](https://github.com/zcash/zcash/pull/3520)
+
+
+Changelog
+=========
+
+David Mercer (2):
+      libsnark: convert long long and unsigned long to C++11 fixed-width types
+      libsnark: convert 0ul to UINT64_C(0)
+
+Eirik Ogilvie-Wigley (24):
+      Rename map to include sprout
+      Add sapling spending keys to z_exportwallet
+      Rename AddZKey to include sprout
+      Move AddSpendingKeyToWallet
+      Return more information when adding a spending key
+      Add sapling support to z_importwallet
+      Export comment on HDSeed and fingerprint with wallet
+      Export zip32 metadata with sapling keys
+      Don't export empty zip32 metadata
+      Allow more information to be returned when an async rpc fails
+      Use utility method to wait for async operations
+      Remove unneeded semicolons
+      Remove unused imports
+      Allow passing timeout parameter to wait_and_assert_operationid_status
+      Add test for signing raw transactions offline
+      Incorporate APPROX_RELEASE_HEIGHT when determining what consensus branch to sign with
+      Allow passing branchId when calling signrawtransaction
+      Remove unused import
+      Address need not be optional when adding sapling keys
+      Use max priority for all shielded transfers
+      Move FIXME comment to where the fix should happen
+      Add newly discovered sapling addresses to the wallet
+      Fix HDSeed comment
+      Better error message when sending to both sprout and sapling
+
+George Tankersley (2):
+      Refactor ContextualCheckBlock tests (#3187)
+      Refactor ContextualCheckBlock tests
+
+Jack Grigg (83):
+      [ci-workers] Install Python modules in a virtualenv
+      [ci-workers] Handle user home directories outside /home
+      [ci-workers] Handle ansible_processor being either a string or a list
+      [ci-workers] Add support for MacOSX
+      [ci-workers] Add a tag for updating dependencies
+      [ci-workers] Add curl and cmake to dependencies
+      [ci-workers] README cleanups
+      [ci-workers] Add pkg-config to general dependencies
+      depends: Correctly configure Rust when cross-compiling
+      depends: Configure librustzcash for cross-compiling
+      depends: Fix BDB naming issue when cross-compiling
+      zcutil/build.sh: Use $HOST to specify the depends prefix
+      configure: Don't require RELRO and BIND_NOW when cross-compiling
+      Measure Windows console size for metrics UI
+      Use -O1 for darwin and mingw32 release builds
+      Clean up libzcash CPPFLAGS, CXXFLAGS, and LDFLAGS
+      zcutil/build.sh: Use config.site to set default ./configure settings
+      zcutil/build.sh: Remove --enable-werror from default configuration
+      Pass correct compiler, linker, and flags into libsnark
+      Use boost::filesystem::path::string() instead of path::native()
+      Metrics UI: Enable virtual terminal sequence processing on Windows
+      Metrics UI: Tell Windows users how to stop zcashd
+      depends: Pass correct compiler, linker, and flags into googletest
+      configure: Don't add -ldl to RUST_LIBS for mingw32
+      test: Fix comment in WalletTests.FindMySaplingNotes
+      Add Sapling support to GetFilteredNotes() and GetUnspentFilteredNotes()
+      Add Sapling support to z_getbalance and z_gettotalbalance
+      Metrics UI: Fall back to 80 cols if GetConsoleScreenBufferInfo() fails
+      libsnark: Adjust SHA256 K value type to match the constant
+      libsnark: Use mp_limb_t cast instead of uint64_t when masking bigint.data
+      libsnark: Fix stale comment
+      rpc: Clarify Sprout shielded addresses in help text
+      rpc: Clarify ivk balance issues in help text
+      Move GetSpendingKeyForPaymentAddress visitor into wallet.h
+      wallet: Add HaveSpendingKeyForPaymentAddress visitor
+      rpcwallet: Add TransactionBuilder argument to AsyncRPCOperation_sendmany
+      rpcwallet: Prevent use of both Sprout and Sapling addresses in z_sendmany
+      rpcwallet: Add Sapling support to z_sendmany
+      Define additional booleans for readability
+      Ensure SCOPED_TRACE falls out of scope when necessary
+      Revert NU activation heights in reverse order
+      Fix test after refactor to check bacd-cb-height rule on a genesis block
+      Rename GetFirstBlockTransaction() to GetFirstBlockCoinbaseTx()
+      libsnark: Force constants used in test comparisons to be unsigned
+      libsnark: Use format macro constants for printing fixed-width values
+      Rename z_inputs_ to z_sprout_inputs_
+      Minor cleanups
+      Fix RPC test that checks exact wording of cleaned-up error message
+      Fix file permissions of wallet_sapling RPC test
+      Update librustzcash with ZIP 32 APIs
+      ZIP 32 Sapling structs
+      Store HDSeed in CBasicKeyStore
+      Store HDSeed in CCryptoKeyStore
+      wallet: Store HDSeed and chain data
+      wallet: Store Sapling key metadata indexed by ivk
+      wallet: Switch from SaplingSpendingKey to SaplingExtendedSpendingKey
+      init: Generate a new HD seed on startup
+      wallet: Comment out HDSeed and CHDChain persistence to disk
+      Add ZIP 32 usage to release notes
+      wallet: Don't allow an HDSeed to be overwritten
+      Bugfix: Use time instead of block height for Sapling key metadata
+      net: Check against the current epoch's version when rejecting nodes
+      Extract a helper method for finding the next epoch
+      net: Check against the next epoch's version when evicting peers
+      net: Check against the current epoch's version when disconnecting peers
+      qa: Test both Overwinter and Sapling peer management
+      Use ovk directly in the TransactionBuilder API instead of fvk
+      Generate an ovk to encrypt outCiphertext for t-addr senders
+      Revert "Disable Sapling features on mainnet"
+      Use the correct empty memo for Sapling outputs
+      Add Sapling support to z_shieldcoinbase
+      Revert "Get rid of consensus.fPowAllowMinDifficultyBlocks."
+      Revert "Remove testnet-only difficulty rules"
+      Allow minimum-difficulty blocks on testnet and regtest
+      Only enable min-difficulty blocks on testnet from a particular height
+      Update wallet_listreceived test for now-correct empty Sapling memos
+      Rename min-difficulty flag to remove off-by-one in the name
+      Explicitly check the min-difficulty flag against boost::none
+      Position PoW.MinDifficultyRules test after rule activates
+      Fix pyflakes warnings
+      Store ExtFVK with encrypted Sapling spending key instead of FVK
+      Persist Sapling payment address to IVK map
+      Ignore decoding errors during -zapwallettxes
+
+Jay Graber (5):
+      s/jsoutindex/outindex for sapling outputs
+      z_listunspent sapling support - needs refactor
+      Add rpc test for sprout txs z_listunspent
+      Modify comments
+      Modify GetNullifiersForAddresses for Sapling
+
+Jonas Schnelli (3):
+      [Wallet] extend CKeyMetadata with HD keypath     Zcash: modified for zip32
+      [Wallet] print hd masterkeyid in getwalletinfo     Zcash: modified for zip32
+      [Wallet] ensure CKeyMetadata.hdMasterKeyID will be cleared during SetNull()     Zcash: modified for zip32
+
+Jonathan "Duke" Leto (1):
+      Fix some typos in rpc-tests readme
+
+Larry Ruane (5):
+      generalize mininode.py protocol versioning
+      Test peer banning logic in both pre- and post-initial block download states
+      Sapling support for z_listreceivedbyaddress
+      z_listunspent rpc unit test: add testing for Sapling
+      fix z_listunspent includeWatchonly logic
+
+Marius Kjærstad (3):
+      Fix for license not being valid
+      Update debian package copyright license
+      Missing comma in debian package copyright license
+
+Sean Bowe (1):
+      Check commitment validity within the decryption API for Sapling note plaintexts.
+
+Simon Liu (68):
+      Rename FindMyNotes to FindMySproutNotes.
+      Rename GetNoteNullifier to GetSproutNoteNullifier.
+      Rename mapNullifiersToNotes to mapSproutNullifiersToNotes.
+      Rename CWallet::AddToSpends methods for clarity.
+      Rename mapTxNullifiers to mapTxSproutNullifiers.
+      Add ivk member variable and equality comparators to SaplingNoteData class.
+      Update CWallet::MarkAffectedTransactionsDirty() for Sapling.
+      Update CWallet::UpdatedNoteData() for Sapling.
+      Create CWallet::AddToSaplingSpends() to track Sapling nullifiers.
+      Update test to pass in required cm to SaplingNotePlaintext::decrypt().
+      Create CWallet::FindMySaplingNotes()
+      Rename IsFromMe(nullifier) to IsSproutNullifierFromMe(nullifier).
+      Create CWallet::IsSaplingNullifierFromMe()
+      Remove dead code in CWalletTx::GetAmounts() as filed in issue #3434.
+      Cleanup CWalletTx::GetAmounts() for clarity.  No-op.
+      Update CWalletTx::GetAmounts() to return COutputEntry for Sapling valueBalance.
+      Add caching and updating of Sapling note nullifier.
+      Update CWallet::IsSpent() to check Sapling nullifiers.
+      Clean up names of unit tests in gtest/test_wallet.cpp.
+      Add test for CWalletTx::SetSaplingNoteData()
+      Iterate over mapSaplingFullViewingKeys with ivk->fvk mapping (1:1).
+      Refactor IsSpent(nullifier) for Sprout and Sapling domain separation.
+      Fix code review nits.
+      Add two new wallet tests: FindMySaplingNotes, SaplingNullifierIsSpent.
+      Add new wallet test: NavigateFromSaplingNullifierToNote
+      Add new wallet test: UpdatedSaplingNoteData.
+      Add new wallet tests: SpentSaplingNoteIsFromMe.
+      Rename wallet tests for clarity between Sprout and Sapling.
+      Fix typo in variable name in test.
+      Fix inaccurate comments in test.
+      Fix typo in parameter name.
+      Update CWallet::GetConflicts for Sapling.
+      Add new wallet test: SetSaplingNoteAddrsInCWalletTx.
+      Add new wallet test: GetConflictedSaplingNotes
+      Add new wallet test: MarkAffectedSaplingTransactionsDirty
+      Update wallet unit tests to revert upgraded network parameters.
+      Clean up wallet unit tests: replace .value() with .get() for clarity.
+      Fix comment in CWallet::SyncMetaData.
+      Refactor: rename setLockedNotes -> setLockedSproutNotes
+      Refactor: rename UnlockAllNotes -> UnlockAllSproutNotes
+      Refactor: rename ListLockedNotes -> ListLockedSproutNotes
+      Add methods to store SaplingOutPoint in setLockedSaplingNotes
+      Add unit test SaplingNoteLocking
+      Update comment for test ContextualCheckBlockTest.BlockSproutRulesRejectOtherTx
+      Add Sapling fields to JSON RPC output using TxToJSON.
+      Update qa test to check for Sapling related JSON fields.
+      Closes #3534. Do not use APPROX_RELEASE_HEIGHT to get consensus branch     id when in regtest mode.
+      For #3533. Replace asserts with JSON errors.
+      Update qa test as offline regtest nodes need branch id passed in.
+      Fix rebasing of CWallet::GetNullifiersForAddresses
+      Cleanup to address review comments.
+      Add test that Sapling shielded transactions have MAX_PRIORITY
+      Closes #3560. Update Sapling note data correctly when importing a key.
+      For #3546. Shielded tx with missing inputs are not treated as orphans.
+      For #3546. Improve estimated tx size for Sapling outputs.
+      Fix deadlock from calling CWallet::AddSaplingIncomingViewingKey instead of CBasicKeyStore::AddSaplingIncomingViewingKey
+      Fix file permissions of QA test wallet_persistence.py
+      Update wallet_persistence test to verify wallet txs are persisted across restarts.
+      Update wallet_persistence test to verify spending notes after restart.
+      Resolves Sapling nullifier persistence issue when importing a key.
+      Update test to verify Sapling nullifiers and witnesses persist correctly.
+      For #3359. RPCs transferring funds return error if Sapling addresses are used before Sapling activation.
+      For #3359. Return error if Sapling addresses passed to RPC z_mergetoaddress.
+      Update mainnet checkpoint for block 410100.
+      Update release notes for v2.0.1
+      Update release-notes.md for clarity.
+      make-release.py: Versioning changes for 2.0.1.
+      make-release.py: Updated manpages for 2.0.1.
+
+WO (4):
+      Fix a bug of Windows binary
+      Add an assert for num_bits function
+      long -> int64_t
+      The long data type is replaced with int64_t
+
+Za Wilcox (1):
+      Revise help output for z_sendmany
+
+mdr0id (9):
+      Resolve final edits for README
+      Revert "wallet: Comment out HDSeed and CHDChain persistence to disk"
+      Persist Sapling key material in the wallet to disk
+      Serialize Sapling data in CWalletTx
+      Adding in rpc wallet sap for test_bitcoin
+      Add gtest coverage of Sapling wallet persistence
+      make-release.py: Versioning changes for 2.0.1-rc1.
+      make-release.py: Updated manpages for 2.0.1-rc1.
+      make-release.py: Updated release notes and changelog for 2.0.1-rc1.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.0.2-rc1.md b/depend/zcash/doc/release-notes/release-notes-2.0.2-rc1.md
new file mode 100644
index 000000000..f79e0fd57
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.0.2-rc1.md
@@ -0,0 +1,106 @@
+Notable changes
+===============
+
+Other issues
+============
+
+Revoked key error when upgrading on Debian
+------------------------------------------
+
+If you see the following error when updating to a new version of zcashd:
+
+`The following signatures were invalid: REVKEYSIG AEFD26F966E279CD`
+
+Remove the key marked as revoked:
+
+`sudo apt-key del AEFD26F966E279CD`
+
+Then retrieve the updated key:
+
+`wget -qO - https://apt.z.cash/zcash.asc | sudo apt-key add -`
+
+Then update the package lists:
+
+`sudo apt-get update`
+
+[Issue](https://github.com/zcash/zcash/issues/3612)
+
+Changelog
+=========
+
+Charlie O'Keefe (2):
+      Save and restore current_path in TestingSetup constructor/destructor
+      Add a call to SetupNetworking in BasicTestingSetup
+
+Eirik Ogilvie-Wigley (17):
+      Rename GenerateNewZKey to include Sprout
+      GenerateNewSproutZKey can return a SproutPaymentAddress
+      Remove unnecessary call to IsValidPaymentAddress
+      Remove unspent note entry structs
+      Add functionality from GetUnspentFilteredNotes to GetFilteredNotes
+      Remove GetUnspentFilteredNotes
+      Wrap long line and update comments
+      Fix error message
+      Fix potentially misleading test failures
+      Fix z_mergetoaddress parameter tests
+      Add fail method to rpc test utils
+      Extend Sprout mergetoaddress rpc test to also work for Sapling
+      Add Sapling support to z_mergetoaddress
+      Add locking for Sapling notes
+      Better error messages when sending between Sprout and Sapling
+      Add additional z_mergetoaddress parameter tests
+      Adjust z_mergetoaddress assertions in Sapling rpc test
+
+Gareth Davies (2):
+      Add clarifying text for parameter size
+      Cleaning up RPC output
+
+Jack Grigg (7):
+      Update IncrementalMerkleTree test vectors to use valid commitments
+      Migrate to current librustzcash
+      Pass parameter paths as native strings to librustzcash
+      Build librustzcash package without changing directory
+      Set nSaplingValue in-memory when loading block index from disk
+      Comment in CDiskBlockIndex that LoadBlockIndexGuts also needs updating
+      Test Sapling value pool accounting
+
+Jonathan "Duke" Leto (2):
+      Clarify in sendmany/z_sendmany rpc docs that amounts are not floating point
+      Fix another instance of incorrectly saying amount is double precision, and s/ZC/ZEC/
+
+Larry Ruane (3):
+      sapling z_sendmany default memo 0xf6 + zeros
+      update bug in wallet_listreceived.py, now it highlights the fix
+      don't ban peers when loading pre-sapling (and pre-blossom) blocks
+
+Simon Liu (14):
+      Add test to verify final sapling root in block header is updated.
+      Closes #3467. Add benchmarks for Sapling spends and outputs.
+      Closes #3616.  Document revoked key error when upgrading on Debian.
+      Closes #3329. Send alert to put non-Sapling nodes into safe mode.
+      Closes #3597. TransactionBuilder checks tx version before adding Sapling spends and outputs.
+      Closes #3671 to make "sapling" the default for z_getnewaddress RPC.
+      Update rpc_wallet_tests for new "sapling" default for z_getnewaddress.
+      Update qa tests for new "sapling" default for z_getnewaddress.
+      Add support for "notfound" message to mininode.
+      For ZEC-013. Mitigate potential tx expiry height related DoS vector.
+      For ZEC-013. Don't propagate txs which are expiring soon in p2p messages.
+      For ZEC-013. RPC createrawtransaction returns error if tx expiring soon.
+      For ZEC-013. Update qa tests broken by expiring soon threshold.
+      For ZEC-013. RPC sendrawtransaction returns error if tx expiring soon.
+
+Suhas Daftuar (2):
+      Do not inv old or missing blocks when pruning
+      Enable block relay when pruning
+
+arielgabizon (2):
+      add test for sapling spend with transparent recipient
+      rename HaveJoinSplitRequirements for Sapling
+
+mdr0id (2):
+      make-release.py: Versioning changes for 2.0.2-rc1.
+      make-release.py: Updated manpages for 2.0.2-rc1.
+
+tpantin (1):
+      Updating copyright year from 2017 to 2018
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.0.2.md b/depend/zcash/doc/release-notes/release-notes-2.0.2.md
new file mode 100644
index 000000000..f7f0f6599
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.0.2.md
@@ -0,0 +1,110 @@
+Notable changes
+===============
+
+Other issues
+============
+
+Revoked key error when upgrading on Debian
+------------------------------------------
+
+If you see the following error when updating to a new version of zcashd:
+
+`The following signatures were invalid: REVKEYSIG AEFD26F966E279CD`
+
+Remove the key marked as revoked:
+
+`sudo apt-key del AEFD26F966E279CD`
+
+Then retrieve the updated key:
+
+`wget -qO - https://apt.z.cash/zcash.asc | sudo apt-key add -`
+
+Then update the package lists:
+
+`sudo apt-get update`
+
+[Issue](https://github.com/zcash/zcash/issues/3612)
+
+Changelog
+=========
+
+Charlie O'Keefe (2):
+      Save and restore current_path in TestingSetup constructor/destructor
+      Add a call to SetupNetworking in BasicTestingSetup
+
+Eirik Ogilvie-Wigley (17):
+      Rename GenerateNewZKey to include Sprout
+      GenerateNewSproutZKey can return a SproutPaymentAddress
+      Remove unnecessary call to IsValidPaymentAddress
+      Remove unspent note entry structs
+      Add functionality from GetUnspentFilteredNotes to GetFilteredNotes
+      Remove GetUnspentFilteredNotes
+      Wrap long line and update comments
+      Fix error message
+      Fix potentially misleading test failures
+      Fix z_mergetoaddress parameter tests
+      Add fail method to rpc test utils
+      Extend Sprout mergetoaddress rpc test to also work for Sapling
+      Add Sapling support to z_mergetoaddress
+      Add locking for Sapling notes
+      Better error messages when sending between Sprout and Sapling
+      Add additional z_mergetoaddress parameter tests
+      Adjust z_mergetoaddress assertions in Sapling rpc test
+
+Gareth Davies (2):
+      Add clarifying text for parameter size
+      Cleaning up RPC output
+
+Jack Grigg (7):
+      Update IncrementalMerkleTree test vectors to use valid commitments
+      Migrate to current librustzcash
+      Pass parameter paths as native strings to librustzcash
+      Build librustzcash package without changing directory
+      Set nSaplingValue in-memory when loading block index from disk
+      Comment in CDiskBlockIndex that LoadBlockIndexGuts also needs updating
+      Test Sapling value pool accounting
+
+Jonathan "Duke" Leto (2):
+      Clarify in sendmany/z_sendmany rpc docs that amounts are not floating point
+      Fix another instance of incorrectly saying amount is double precision, and s/ZC/ZEC/
+
+Larry Ruane (4):
+      sapling z_sendmany default memo 0xf6 + zeros
+      update bug in wallet_listreceived.py, now it highlights the fix
+      don't ban peers when loading pre-sapling (and pre-blossom) blocks
+      remove non-ascii characters from help text
+
+Simon Liu (14):
+      Add test to verify final sapling root in block header is updated.
+      Closes #3467. Add benchmarks for Sapling spends and outputs.
+      Closes #3616.  Document revoked key error when upgrading on Debian.
+      Closes #3329. Send alert to put non-Sapling nodes into safe mode.
+      Closes #3597. TransactionBuilder checks tx version before adding Sapling spends and outputs.
+      Closes #3671 to make "sapling" the default for z_getnewaddress RPC.
+      Update rpc_wallet_tests for new "sapling" default for z_getnewaddress.
+      Update qa tests for new "sapling" default for z_getnewaddress.
+      Add support for "notfound" message to mininode.
+      For ZEC-013. Mitigate potential tx expiry height related DoS vector.
+      For ZEC-013. Don't propagate txs which are expiring soon in p2p messages.
+      For ZEC-013. RPC createrawtransaction returns error if tx expiring soon.
+      For ZEC-013. Update qa tests broken by expiring soon threshold.
+      For ZEC-013. RPC sendrawtransaction returns error if tx expiring soon.
+
+Suhas Daftuar (2):
+      Do not inv old or missing blocks when pruning
+      Enable block relay when pruning
+
+arielgabizon (2):
+      add test for sapling spend with transparent recipient
+      rename HaveJoinSplitRequirements for Sapling
+
+mdr0id (5):
+      make-release.py: Versioning changes for 2.0.2-rc1.
+      make-release.py: Updated manpages for 2.0.2-rc1.
+      make-release.py: Updated release notes and changelog for 2.0.2-rc1.
+      make-release.py: Versioning changes for 2.0.2.
+      make-release.py: Updated manpages for 2.0.2.
+
+tpantin (1):
+      Updating copyright year from 2017 to 2018
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.0.3-rc1.md b/depend/zcash/doc/release-notes/release-notes-2.0.3-rc1.md
new file mode 100644
index 000000000..4291bf77f
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.0.3-rc1.md
@@ -0,0 +1,57 @@
+Changelog
+=========
+
+Alex Morcos (3):
+      ModifyNewCoins saves database lookups
+      Make CCoinsViewTest behave like CCoinsViewDB
+      Add unit test for UpdateCoins
+
+Charlie O'Keefe (1):
+      initialize pCurrentParams in TransactionBuilder tests
+
+Dimitris Apostolou (1):
+      Update zmq to 4.3.1
+
+Eirik Ogilvie-Wigley (11):
+      Remove --disable-libs flag from help output
+      Update z_mergetoaddress documentation
+      flake8 cleanup
+      Move common code to helper
+      Make variables local
+      Check entire contents of mempool
+      fail test if pong is not received
+      Extract helper methods
+      Strategically sync to prevent intermittent failures
+      Return more information when building a transaction fails
+      throw an exception rather than returning false when building invalid transactions
+
+George Tankersley (2):
+      zmq: add flag to publish all checked blocks
+      zmq: remove extraneous space from zmq_sub.py
+
+Jack Grigg (5):
+      Remove the testing of duplicate coinbase transactions
+      wallet: Skip transactions with no shielded data in CWallet::SetBestChain()
+      Use nullptr instead of NULL in wallet tests
+      Add Sapling test cases
+      Set Sprout note data in WalletTest.WriteWitnessCache
+
+Larry Ruane (1):
+      wait for miner threads to exit (join them)
+
+Pieter Wuille (3):
+      Make sigcache faster and more efficient
+      Evict sigcache entries that are seen in a block
+      Don't wipe the sigcache in TestBlockValidity
+
+Sean Bowe (1):
+      Allow user to ask server to save the Sprout R1CS out during startup.
+
+ca333 (1):
+      update libsodium dl-path
+
+mdr0id (3):
+      Make pythonisms consistent
+      make-release.py: Versioning changes for 2.0.3-rc1.
+      make-release.py: Updated manpages for 2.0.3-rc1.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.0.3.md b/depend/zcash/doc/release-notes/release-notes-2.0.3.md
new file mode 100644
index 000000000..9b59be0e3
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.0.3.md
@@ -0,0 +1,61 @@
+Changelog
+=========
+
+Alex Morcos (3):
+      ModifyNewCoins saves database lookups
+      Make CCoinsViewTest behave like CCoinsViewDB
+      Add unit test for UpdateCoins
+
+Charlie O'Keefe (1):
+      initialize pCurrentParams in TransactionBuilder tests
+
+Dimitris Apostolou (1):
+      Update zmq to 4.3.1
+
+Eirik Ogilvie-Wigley (11):
+      Remove --disable-libs flag from help output
+      Update z_mergetoaddress documentation
+      flake8 cleanup
+      Move common code to helper
+      Make variables local
+      Check entire contents of mempool
+      fail test if pong is not received
+      Extract helper methods
+      Strategically sync to prevent intermittent failures
+      Return more information when building a transaction fails
+      throw an exception rather than returning false when building invalid transactions
+
+George Tankersley (2):
+      zmq: add flag to publish all checked blocks
+      zmq: remove extraneous space from zmq_sub.py
+
+Jack Grigg (5):
+      Remove the testing of duplicate coinbase transactions
+      wallet: Skip transactions with no shielded data in CWallet::SetBestChain()
+      Use nullptr instead of NULL in wallet tests
+      Add Sapling test cases
+      Set Sprout note data in WalletTest.WriteWitnessCache
+
+Larry Ruane (1):
+      wait for miner threads to exit (join them)
+
+Pieter Wuille (3):
+      Make sigcache faster and more efficient
+      Evict sigcache entries that are seen in a block
+      Don't wipe the sigcache in TestBlockValidity
+
+Sean Bowe (1):
+      Allow user to ask server to save the Sprout R1CS out during startup.
+
+ca333 (1):
+      update libsodium dl-path
+
+mdr0id (7):
+      Make pythonisms consistent
+      make-release.py: Versioning changes for 2.0.3-rc1.
+      make-release.py: Updated manpages for 2.0.3-rc1.
+      make-release.py: Updated release notes and changelog for 2.0.3-rc1.
+      Update nMinimumChainWork with information from the getblockchaininfo RPC
+      make-release.py: Versioning changes for 2.0.3.
+      make-release.py: Updated manpages for 2.0.3.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.0.4-rc1.md b/depend/zcash/doc/release-notes/release-notes-2.0.4-rc1.md
new file mode 100644
index 000000000..a6ce81aa4
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.0.4-rc1.md
@@ -0,0 +1,132 @@
+Notable changes
+===============
+
+Sprout note validation bug fixed in wallet
+------------------------------------------
+We include a fix for a bug in the Zcashd wallet which could result in Sprout
+z-addresses displaying an incorrect balance. Sapling z-addresses are not
+impacted by this issue. This would occur if someone sending funds to a Sprout
+z-address intentionally sent a different amount in the note commitment of a
+Sprout output than the value provided in the ciphertext (the encrypted message
+from the sender).
+
+Users should install this update and then rescan the blockchain by invoking
+“zcashd -rescan�. Sprout address balances shown by the zcashd wallet should
+then be correct.
+
+Thank you to Alexis Enston for bringing this to our attention.
+
+[Security Announcement 2019-03-19](https://z.cash/support/security/announcements/security-announcement-2019-03-19/)
+
+[Pull request](https://github.com/zcash/zcash/pull/3897)
+
+Miner address selection behaviour fixed
+---------------------------------------
+Zcash inherited a bug from upstream Bitcoin Core where both the internal miner
+and RPC call `getblocktemplate` would use a fixed transparent address, until RPC
+`getnewaddress` was called, instead of using a new transparent address for each
+mined block.  This was fixed in Bitcoin 0.12 and we have now merged the change.
+
+Miners who wish to use the same address for every mined block, should use the
+`-mineraddress` option. 
+
+[Mining Guide](https://zcash.readthedocs.io/en/latest/rtd_pages/zcash_mining_guide.html)
+
+
+New consensus rule: Reject blocks that violate turnstile (Testnet only)
+-----------------------------------------------------------------------
+Testnet nodes will now enforce a consensus rule which marks blocks as invalid
+if they would lead to a turnstile violation in the Sprout or Sapling value
+pools. The motivations and deployment details can be found in the accompanying
+[ZIP draft](https://github.com/zcash/zips/pull/210).
+
+The consensus rule will be enforced on mainnet in a future release.
+
+[Pull request](https://github.com/zcash/zcash/pull/3885)
+
+
+Changelog
+=========
+
+Eirik Ogilvie-Wigley (14):
+      Rename methods to include Sprout
+      Add benchmark for decrypting sapling notes
+      Move reusable Sapling test setup to utiltest
+      Move test SaplingNote creation to utiltest
+      Add test method for generating master Sapling extended spending keys
+      Include Sapling transactions in increment note witness benchmark
+      Prevent header from being included multiple times
+      benchmarks do not require updating network parameters
+      FakeCoinsViewDB can inherit directly from CCoinsView
+      Add a method for generating a test CKey
+      Change to t->z transaction and create separate benchmark for sapling
+      Renaming and other minor cleanup
+      Improve some error messages when building a transaction fails
+      Add missing author aliases
+
+Gareth Davies (1):
+      Correcting logo on README
+
+Jack Grigg (6):
+      Add Sapling benchmarks to benchmark runner
+      test: Fetch coinbase address from coinbase UTXOs
+      test: Make expected_utxos optional in get_coinbase_address()
+      Add comments
+      Move utiltest.cpp from wallet to common
+      Move payment disclosure code and tests into wallet
+
+Jonas Schnelli (4):
+      detach wallet from miner
+      fix GetScriptForMining() CReserveKey::keepKey() issue
+      add CReserveScript to allow modular script keeping/returning
+      miner: rename UpdateRequestCount signal to ResetRequestCount
+
+Jonathan "Duke" Leto (2):
+      Backport size_on_disk to RPC call getblockchaininfo.
+      Add size_on_disk test
+
+Marius Kjærstad (1):
+      Update COPYRIGHT_YEAR in clientversion.h to 2019
+
+Paige Peterson (1):
+      redirect and update source documentation
+
+Pieter Wuille (1):
+      Simplify DisconnectBlock arguments/return value
+
+Sean Bowe (13):
+      (testnet) Fall back to hardcoded shielded pool balance to avoid reorgs.
+      (testnet) Reject blocks that result in turnstile violations
+      (testnet/regtest) Avoid mining transactions that would violate the turnstile.
+      Fix tallying for Sprout/Sapling value pools.
+      Consolidate logic to enable turnstile auditing for testnet/regtest/mainnet.
+      Use existing chainparams variable
+      Add newlines to turntile log messages for miner
+      Check blockhash of fallback block for Sprout value pool balance
+      Change SproutValuePoolCheckpointEnabled to ZIP209Activated
+      Only enforce Sapling turnstile if balance values have been populated.
+      Do not enable ZIP209 on regtest right now.
+      (minor) Remove added newline.
+      (wallet) Check that the commitment matches the note plaintext provided by the sender.
+
+Simon Liu (5):
+      Update nMinimumChainWork using block 497000.
+      Add checkpoint for block 497000.
+      Update release notes for 2.0.4
+      make-release.py: Versioning changes for 2.0.4-rc1.
+      make-release.py: Updated manpages for 2.0.4-rc1.
+
+Taylor Hornby (5):
+      Update OpenSSL from 1.1.0h to 1.1.1a. #3786
+      Update boost from v1.66.0 to v1.69.0. #3786
+      Update Rust from v1.28.0 to v1.32.0. #3786
+      Update Proton from 0.17.0 to 0.26.0. #3816, #3786
+      Patch Proton for a minimal build. #3786
+
+sandakersmann (1):
+      Update of copyright year to 2019
+
+zebambam (2):
+      Added documentation warnings about DNS rebinding attacks, issue #3841
+      Added responsible disclosure statement for issue #3869
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.0.4.md b/depend/zcash/doc/release-notes/release-notes-2.0.4.md
new file mode 100644
index 000000000..272a038dc
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.0.4.md
@@ -0,0 +1,139 @@
+Notable changes
+===============
+
+Sprout note validation bug fixed in wallet
+------------------------------------------
+We include a fix for a bug in the Zcashd wallet which could result in Sprout
+z-addresses displaying an incorrect balance. Sapling z-addresses are not
+impacted by this issue. This would occur if someone sending funds to a Sprout
+z-address intentionally sent a different amount in the note commitment of a
+Sprout output than the value provided in the ciphertext (the encrypted message
+from the sender).
+
+Users should install this update and then rescan the blockchain by invoking
+“zcashd -rescan�. Sprout address balances shown by the zcashd wallet should
+then be correct.
+
+Thank you to Alexis Enston for bringing this to our attention.
+
+[Security Announcement 2019-03-19](https://z.cash/support/security/announcements/security-announcement-2019-03-19/)
+
+[Pull request](https://github.com/zcash/zcash/pull/3897)
+
+Miner address selection behaviour fixed
+---------------------------------------
+Zcash inherited a bug from upstream Bitcoin Core where both the internal miner
+and RPC call `getblocktemplate` would use a fixed transparent address, until RPC
+`getnewaddress` was called, instead of using a new transparent address for each
+mined block.  This was fixed in Bitcoin 0.12 and we have now merged the change.
+
+Miners who wish to use the same address for every mined block, should use the
+`-mineraddress` option. 
+
+[Mining Guide](https://zcash.readthedocs.io/en/latest/rtd_pages/zcash_mining_guide.html)
+
+
+New consensus rule: Reject blocks that violate turnstile (Testnet only)
+-----------------------------------------------------------------------
+Testnet nodes will now enforce a consensus rule which marks blocks as invalid
+if they would lead to a turnstile violation in the Sprout or Sapling value
+pools. The motivations and deployment details can be found in the accompanying
+[ZIP draft](https://github.com/zcash/zips/pull/210).
+
+The consensus rule will be enforced on mainnet in a future release.
+
+[Pull request](https://github.com/zcash/zcash/pull/3885)
+
+
+Changelog
+=========
+
+Eirik Ogilvie-Wigley (14):
+      Rename methods to include Sprout
+      Add benchmark for decrypting sapling notes
+      Move reusable Sapling test setup to utiltest
+      Move test SaplingNote creation to utiltest
+      Add test method for generating master Sapling extended spending keys
+      Include Sapling transactions in increment note witness benchmark
+      Prevent header from being included multiple times
+      benchmarks do not require updating network parameters
+      FakeCoinsViewDB can inherit directly from CCoinsView
+      Add a method for generating a test CKey
+      Change to t->z transaction and create separate benchmark for sapling
+      Renaming and other minor cleanup
+      Improve some error messages when building a transaction fails
+      Add missing author aliases
+
+Gareth Davies (1):
+      Correcting logo on README
+
+Jack Grigg (6):
+      Add Sapling benchmarks to benchmark runner
+      test: Fetch coinbase address from coinbase UTXOs
+      test: Make expected_utxos optional in get_coinbase_address()
+      Add comments
+      Move utiltest.cpp from wallet to common
+      Move payment disclosure code and tests into wallet
+
+Jonas Schnelli (4):
+      detach wallet from miner
+      fix GetScriptForMining() CReserveKey::keepKey() issue
+      add CReserveScript to allow modular script keeping/returning
+      miner: rename UpdateRequestCount signal to ResetRequestCount
+
+Jonathan "Duke" Leto (2):
+      Backport size_on_disk to RPC call getblockchaininfo.
+      Add size_on_disk test
+
+Marius Kjærstad (1):
+      Update COPYRIGHT_YEAR in clientversion.h to 2019
+
+Paige Peterson (1):
+      redirect and update source documentation
+
+Pieter Wuille (1):
+      Simplify DisconnectBlock arguments/return value
+
+Sean Bowe (13):
+      (testnet) Fall back to hardcoded shielded pool balance to avoid reorgs.
+      (testnet) Reject blocks that result in turnstile violations
+      (testnet/regtest) Avoid mining transactions that would violate the turnstile.
+      Fix tallying for Sprout/Sapling value pools.
+      Consolidate logic to enable turnstile auditing for testnet/regtest/mainnet.
+      Use existing chainparams variable
+      Add newlines to turntile log messages for miner
+      Check blockhash of fallback block for Sprout value pool balance
+      Change SproutValuePoolCheckpointEnabled to ZIP209Activated
+      Only enforce Sapling turnstile if balance values have been populated.
+      Do not enable ZIP209 on regtest right now.
+      (minor) Remove added newline.
+      (wallet) Check that the commitment matches the note plaintext provided by the sender.
+
+Simon Liu (9):
+      Update nMinimumChainWork using block 497000.
+      Add checkpoint for block 497000.
+      Update release notes for 2.0.4
+      make-release.py: Versioning changes for 2.0.4-rc1.
+      make-release.py: Updated manpages for 2.0.4-rc1.
+      make-release.py: Updated release notes and changelog for 2.0.4-rc1.
+      Fix typo in release notes.
+      make-release.py: Versioning changes for 2.0.4.
+      make-release.py: Updated manpages for 2.0.4.
+
+Taylor Hornby (8):
+      Update OpenSSL from 1.1.0h to 1.1.1a. #3786
+      Update boost from v1.66.0 to v1.69.0. #3786
+      Update Rust from v1.28.0 to v1.32.0. #3786
+      Update Proton from 0.17.0 to 0.26.0. #3816, #3786
+      Patch Proton for a minimal build. #3786
+      Fix proton patch regression. #3916
+      Fix OpenSSL reproducible build regression
+      Patch out proton::url deprecation as workaround for build warnings
+
+sandakersmann (1):
+      Update of copyright year to 2019
+
+zebambam (2):
+      Added documentation warnings about DNS rebinding attacks, issue #3841
+      Added responsible disclosure statement for issue #3869
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.0.5-1.md b/depend/zcash/doc/release-notes/release-notes-2.0.5-1.md
new file mode 100644
index 000000000..ef02d80b5
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.0.5-1.md
@@ -0,0 +1,68 @@
+Notable changes
+===============
+
+Sprout to Sapling Migration Tool
+--------------------------------
+This release includes the addition of a tool that will enable users to migrate
+shielded funds from the Sprout pool to the Sapling pool while minimizing
+information leakage. 
+
+The migration can be enabled using the RPC `z_setmigration` or by including
+`-migration` in the `zcash.conf` file. Unless otherwise specified funds will be
+migrated to the wallet's default Sapling address; it is also possible to set the 
+receiving Sapling address using the `-migrationdestaddress` option in `zcash.conf`.
+
+See [ZIP308](https://github.com/zcash/zips/blob/master/zip-0308.rst) for full details.
+
+Sprout to Sapling Migration Tool Fixes
+--------------------------------------
+The 2.0.5-1 release includes fixes to the Sprout to Sapling Migration Tool
+found in testing. We resolved an issue which would cause the zcash daemon to
+crash if calling the RPC `z_getmigrationstatus` while a wallet's migration
+transactions are in the mempool.
+
+New consensus rule: Reject blocks that violate turnstile
+--------------------------------------------------------
+In the 2.0.4 release the consensus rules were changed on testnet to enforce a
+consensus rule which marks blocks as invalid if they would lead to a turnstile
+violation in the Sprout or Shielded value pools.
+**This release enforces the consensus rule change on mainnet**
+
+The motivations and deployment details can be found in the accompanying
+[ZIP draft](https://github.com/zcash/zips/pull/210) and
+[PR 3968](https://github.com/zcash/zcash/pull/3968).
+
+Developers can use a new experimental feature `-developersetpoolsizezero` to test
+Sprout and Sapling turnstile violations. See [PR 3964](https://github.com/zcash/zcash/pull/3964) for more details.
+
+
+64-bit ARMv8 support
+--------------------
+Added ARMv8 (AArch64) support. This enables users to build zcash on even more
+devices.
+
+For information on how to build see the [User Guide](https://zcash.readthedocs.io/en/latest/rtd_pages/user_guide.html#build)
+
+Users on the Zcash forum have reported successes with both the Pine64 Rock64Pro
+and Odroid C2 which contain 4GB and 2GB of RAM respectively.
+
+Just released, the Odroid N2 looks like a great solution with 4GB of RAM. The
+newly released Jetson Nano Developer Kit from Nvidia (also 4GB of RAM) is also
+worth a look. The NanoPC-T3 Plus is another option but for the simplest/best
+experience choose a board with 4GB of RAM. Just make sure before purchase that
+the CPU supports the 64-bit ARMv8 architecture.
+
+Changelog
+=========
+
+Eirik0 (9):
+      Correctly account for migration transactions in the mempool
+      Store the migration operation id rather than the operation iteslf
+      Rename variable and add comment
+      Notable changes for v2.0.5-1
+      Fix summing available funds
+      Add the amount migrated to the operation's result
+      coinsView is required when using TransactionBuilder if there may be Sprout change
+      make-release.py: Versioning changes for 2.0.5-1.
+      make-release.py: Updated manpages for 2.0.5-1.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.0.5-2.md b/depend/zcash/doc/release-notes/release-notes-2.0.5-2.md
new file mode 100644
index 000000000..8d7dc947a
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.0.5-2.md
@@ -0,0 +1,77 @@
+Notable changes
+===============
+
+Sprout to Sapling Migration Tool
+--------------------------------
+This release includes the addition of a tool that will enable users to migrate
+shielded funds from the Sprout pool to the Sapling pool while minimizing
+information leakage. 
+
+The migration can be enabled using the RPC `z_setmigration` or by including
+`migration=1` in the `zcash.conf` file. Unless otherwise specified funds will be
+migrated to the wallet's default Sapling address; it is also possible to set the 
+receiving Sapling address using the `migrationdestaddress=<zaddr>` option in
+`zcash.conf`.
+
+See [ZIP308](https://github.com/zcash/zips/blob/master/zip-0308.rst) for full details.
+
+Sprout to Sapling Migration Tool Fixes
+--------------------------------------
+The 2.0.5-1 and 2.0.5-2 releases include fixes to the Sprout to Sapling
+Migration Tool found in testing.
+
+For a complete list of changes in 2.0.5, 2.0.5-1 and 2.0.5-2, see the [2.0.5 milestone](https://github.com/zcash/zcash/milestone/79?closed=1).
+
+New consensus rule: Reject blocks that violate turnstile
+--------------------------------------------------------
+In the 2.0.4 release the consensus rules were changed on testnet to enforce a
+consensus rule which marks blocks as invalid if they would lead to a turnstile
+violation in the Sprout or Shielded value pools.
+**This release enforces the consensus rule change on mainnet.**
+
+The motivations and deployment details can be found in
+[ZIP209](https://github.com/zcash/zips/blob/master/zip-0209.rst) and
+[PR 3968](https://github.com/zcash/zcash/pull/3968).
+
+Developers can use a new experimental feature `-developersetpoolsizezero` to test
+Sprout and Sapling turnstile violations. See [PR 3964](https://github.com/zcash/zcash/pull/3964) for more details.
+
+64-bit ARMv8 support
+--------------------
+Added ARMv8 (AArch64) support. This enables users to build zcash on even more
+devices.
+
+For information on how to build see the [User Guide](https://zcash.readthedocs.io/en/latest/rtd_pages/user_guide.html#build).
+
+Users on the Zcash forum have reported successes with both the Pine64 Rock64Pro
+and Odroid C2 which contain 4GB and 2GB of RAM respectively.
+
+Just released, the Odroid N2 looks like a great solution with 4GB of RAM. The
+newly released Jetson Nano Developer Kit from Nvidia (also 4GB of RAM) is also
+worth a look. The NanoPC-T3 Plus is another option but for the simplest/best
+experience choose a board with 4GB of RAM. Just make sure before purchase that
+the CPU supports the 64-bit ARMv8 architecture.
+
+Changelog
+=========
+
+Daira Hopwood (5):
+      Generalize TransactionBuilder and CreateNewContextualCMutableTransaction to allow choosing the expiry delta.
+      Repair calls to TransactionBuilder from tests.
+      Change expiry delta for migration transactions to 450 blocks.
+      Test the expiry height of migration transactions.
+      Fix cosmetic spacing issue in z_setmigration help.
+
+Eirik0 (7):
+      Do not automatically remove async migration operations and return txids
+      Add logging for Sprout to Sapling migration transaction generation
+      Fix LogPrint statements
+      Notable changes for v2.0.5-2
+      Release notes wording and punctuation
+      make-release.py: Versioning changes for 2.0.5-2.
+      make-release.py: Updated manpages for 2.0.5-2.
+
+Simon Liu (2):
+      Remove unused specifier from format string.
+      Don't allow migration when node is syncing at launch or after waking up.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.0.5-rc1.md b/depend/zcash/doc/release-notes/release-notes-2.0.5-rc1.md
new file mode 100644
index 000000000..08640b1f4
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.0.5-rc1.md
@@ -0,0 +1,73 @@
+Changelog
+=========
+
+Braydon Fuller (1):
+      tests: adds unit test for IsPayToPublicKeyHash method
+
+Dimitris Apostolou (1):
+      Electric Coin Company
+
+Eirik0 (22):
+      Split test in to multiple parts
+      Use a custom error type if creating joinsplit descriptions fails
+      Rename and update comment
+      Add rpc to enable and disable Sprout to Sapling migration
+      Move migration logic to ChainTip
+      Documentation cleanup
+      Additional locking and race condition prevention
+      Refactor wait_and_assert_operationid_status to allow returning the result
+      Set min depth when selecting notes to migrate
+      Check for full failure message in test case
+      Add migration options to conf file
+      Create method for getting HD seed in RPCs
+      Add rpc to get Sprout to Sapling migration status
+      Fix help message
+      Test migration using both the parameter and the default Sapling address
+      Fix typos and update documentation
+      use -valueBalance rather than vpub_new to calculate migrated amount
+      Do not look at vin/vout when determining migration txs and other cleanup
+      Calculate the number of confimations in the canonical way
+      Do not throw an exception if HD Seed is not found when exporting wallet
+      make-release.py: Versioning changes for 2.0.5-rc1.
+      make-release.py: Updated manpages for 2.0.5-rc1.
+
+Gareth Davies (1):
+      Adding addressindex.h to Makefile.am
+
+Jack Grigg (9):
+      Add Sprout support to TransactionBuilder
+      depends: Use full path to cargo binary
+      depends: Generalise the rust package cross-compilation functions
+      depends: Add rust-std hash for aarch64-unknown-linux-gnu
+      depends: Compile bdb with --disable-atomics on aarch64
+      depends: Update .gitignore
+      configure: Guess -march for libsnark OPTFLAGS instead of hard-coding
+      Add Blossom to upgrade list
+      init: Fix new HD seed generation for previously-encrypted wallets
+
+Larry Ruane (6):
+      fix enable-debug build DB_COINS undefined
+      add -addressindex changes for bitcore insight block explorer
+      add -spentindex changes for bitcore insight block explorer
+      Update boost from v1.69.0 to v1.70.0. #3947
+      add -timestampindex for bitcore insight block explorer
+      3873 z_setmigration cli bool enable arg conversion
+
+Marius Kjærstad (1):
+      Update _COPYRIGHT_YEAR in configure.ac to 2019
+
+Mary Moore-Simmons (1):
+      Creates checklist template for new PRs being opened and addresses Str4d's suggestion for using GitHub handles
+
+Simon Liu (4):
+      Add testnet and regtest experimental feature: -developersetpoolsizezero
+      Add qa test for experimental feature: -developersetpoolsizezero
+      Enable ZIP209 on mainnet and set fallback Sprout pool balance.
+      Enable experimental feature -developersetpoolsizezero on mainnet.
+
+Jack Grigg (1):
+      remove extra hyphen
+
+zebambam (1):
+      Minor speling changes
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.0.5.md b/depend/zcash/doc/release-notes/release-notes-2.0.5.md
new file mode 100644
index 000000000..520060f17
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.0.5.md
@@ -0,0 +1,130 @@
+Notable changes
+===============
+
+Sprout to Sapling Migration Tool
+--------------------------------
+This release includes the addition of a tool that will enable users to migrate
+shielded funds from the Sprout pool to the Sapling pool while minimizing
+information leakage. 
+
+The migration can be enabled using the RPC `z_setmigration` or by including
+`-migration` in the `zcash.conf` file. Unless otherwise specified funds will be
+migrated to the wallet's default Sapling address; it is also possible to set the 
+receiving Sapling address using the `-migrationdestaddress` option in `zcash.conf`.
+
+See [ZIP308](https://github.com/zcash/zips/blob/master/zip-0308.rst) for full details. 
+
+
+New consensus rule: Reject blocks that violate turnstile
+--------------------------------------------------------
+In the 2.0.4 release the consensus rules were changed on testnet to enforce a
+consensus rule which marks blocks as invalid if they would lead to a turnstile
+violation in the Sprout or Shielded value pools.
+**This release enforces the consensus rule change on mainnet**
+
+The motivations and deployment details can be found in the accompanying
+[ZIP draft](https://github.com/zcash/zips/pull/210) and
+[PR 3968](https://github.com/zcash/zcash/pull/3968).
+
+Developers can use a new experimental feature `-developersetpoolsizezero` to test
+Sprout and Sapling turnstile violations. See [PR 3964](https://github.com/zcash/zcash/pull/3964) for more details.
+
+
+64-bit ARMv8 support
+--------------------
+Added ARMv8 (AArch64) support. This enables users to build zcash on even more
+devices.
+
+For information on how to build see the [User Guide](https://zcash.readthedocs.io/en/latest/rtd_pages/user_guide.html#build)
+
+Users on the Zcash forum have reported successes with both the Pine64 Rock64Pro
+and Odroid C2 which contain 4GB and 2GB of RAM respectively.
+
+Just released, the Odroid N2 looks like a great solution with 4GB of RAM. The
+newly released Jetson Nano Developer Kit from Nvidia (also 4GB of RAM) is also
+worth a look. The NanoPC-T3 Plus is another option but for the simplest/best
+experience choose a board with 4GB of RAM. Just make sure before purchase that
+the CPU supports the 64-bit ARMv8 architecture.
+
+Changelog
+=========
+
+Braydon Fuller (1):
+      tests: adds unit test for IsPayToPublicKeyHash method
+
+Dimitris Apostolou (1):
+      Electric Coin Company
+
+Eirik0 (27):
+      Split test in to multiple parts
+      Use a custom error type if creating joinsplit descriptions fails
+      Rename and update comment
+      Add rpc to enable and disable Sprout to Sapling migration
+      Move migration logic to ChainTip
+      Documentation cleanup
+      Additional locking and race condition prevention
+      Refactor wait_and_assert_operationid_status to allow returning the result
+      Set min depth when selecting notes to migrate
+      Check for full failure message in test case
+      Add migration options to conf file
+      Create method for getting HD seed in RPCs
+      Add rpc to get Sprout to Sapling migration status
+      Fix help message
+      Test migration using both the parameter and the default Sapling address
+      Fix typos and update documentation
+      use -valueBalance rather than vpub_new to calculate migrated amount
+      Do not look at vin/vout when determining migration txs and other cleanup
+      Calculate the number of confimations in the canonical way
+      Do not throw an exception if HD Seed is not found when exporting wallet
+      make-release.py: Versioning changes for 2.0.5-rc1.
+      make-release.py: Updated manpages for 2.0.5-rc1.
+      make-release.py: Updated release notes and changelog for 2.0.5-rc1.
+      Notable changes for v2.0.5
+      Add missing word to release notes
+      make-release.py: Versioning changes for 2.0.5.
+      make-release.py: Updated manpages for 2.0.5.
+
+Gareth Davies (1):
+      Adding addressindex.h to Makefile.am
+
+Ian Munoz (1):
+      add curl to package list for gitian lxc container
+
+Jack Grigg (9):
+      Add Sprout support to TransactionBuilder
+      depends: Use full path to cargo binary
+      depends: Generalise the rust package cross-compilation functions
+      depends: Add rust-std hash for aarch64-unknown-linux-gnu
+      depends: Compile bdb with --disable-atomics on aarch64
+      depends: Update .gitignore
+      configure: Guess -march for libsnark OPTFLAGS instead of hard-coding
+      Add Blossom to upgrade list
+      init: Fix new HD seed generation for previously-encrypted wallets
+
+Larry Ruane (6):
+      fix enable-debug build DB_COINS undefined
+      add -addressindex changes for bitcore insight block explorer
+      add -spentindex changes for bitcore insight block explorer
+      Update boost from v1.69.0 to v1.70.0. #3947
+      add -timestampindex for bitcore insight block explorer
+      3873 z_setmigration cli bool enable arg conversion
+
+Marius Kjærstad (1):
+      Update _COPYRIGHT_YEAR in configure.ac to 2019
+
+Mary Moore-Simmons (1):
+      Creates checklist template for new PRs being opened and addresses Str4d's suggestion for using GitHub handles
+
+Simon Liu (5):
+      Add testnet and regtest experimental feature: -developersetpoolsizezero
+      Add qa test for experimental feature: -developersetpoolsizezero
+      Enable ZIP209 on mainnet and set fallback Sprout pool balance.
+      Enable experimental feature -developersetpoolsizezero on mainnet.
+      Update chain work and checkpoint using block 525000.
+
+Jack Grigg (1):
+      remove extra hyphen
+
+zebambam (1):
+      Minor speling changes
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.0.6-rc1.md b/depend/zcash/doc/release-notes/release-notes-2.0.6-rc1.md
new file mode 100644
index 000000000..ce4014720
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.0.6-rc1.md
@@ -0,0 +1,62 @@
+Changelog
+=========
+
+Daira Hopwood (3):
+      Closes #3992. Remove obsolete warning message.
+      make-release.py: Versioning changes for 2.0.6-rc1.
+      make-release.py: Updated manpages for 2.0.6-rc1.
+
+Daniel Kraft (1):
+      Add some const declarations where they are appropriate.
+
+Eirik Ogilvie-Wigley (7):
+      Fix tree depth in comment
+      Update author aliases
+      Remove old mergetoaddress RPC test
+      Replace CSproutNotePlaintextEntry with SproutNoteEntry to match Sapling
+      z_getmigrationstatus help message wording change
+      Fix z_mergetoaddress sending from ANY_SPROUT/ANY_SAPLING when the wallet contains both note types
+      Clarify what combinations of from addresses can be used in z_mergetoaddress
+
+Jack Grigg (10):
+      Move Equihash parameters into consensus params
+      Globals: Remove Zcash-specific Params() calls from main.cpp
+      Globals: Explicitly pass const CChainParams& to IsStandardTx()
+      Globals: Explicit const CChainParams& arg for main:
+      Globals: Explicitly pass const CChainParams& to ContextualCheckTransaction()
+      Globals: Explicit const CChainParams& arg for main:
+      Globals: Explicitly pass const CChainParams& to DisconnectBlock()
+      Consistently use chainparams and consensusParams
+      Globals: Explicitly pass const CChainParams& to IsInitialBlockDownload()
+      Globals: Explicitly pass const CChainParams& to ReceivedBlockTransactions()
+
+Jorge Timón (6):
+      Globals: Explicit Consensus::Params arg for main:
+      Globals: Make AcceptBlockHeader static (Fix #6163)
+      Chainparams: Explicit CChainParams arg for main (pre miner):
+      Chainparams: Explicit CChainParams arg for miner:
+      Globals: Remove a bunch of Params() calls from main.cpp:
+      Globals: Explicitly pass const CChainParams& to UpdateTip()
+
+Larry Ruane (1):
+      add spentindex to getrawtransaction RPC results
+
+MarcoFalke (1):
+      [doc] Fix doxygen comments for members
+
+Peter Todd (1):
+      Improve block validity/ConnectBlock() comments
+
+Simon Liu (1):
+      Fix typo and clean up help message for RPC z_getmigrationstatus.
+
+Wladimir J. van der Laan (1):
+      Break circular dependency main ↔ txdb
+
+face (2):
+      Pass CChainParams to DisconnectTip()
+      Explicitly pass CChainParams to ConnectBlock
+
+Benjamin Winston (1):
+      Fixes #4013, added BitcoinABC as a disclosure partner
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.0.6.md b/depend/zcash/doc/release-notes/release-notes-2.0.6.md
new file mode 100644
index 000000000..f1beec511
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.0.6.md
@@ -0,0 +1,102 @@
+Notable changes
+===============
+
+Debian Stretch is now a Supported Platform
+------------------------------------------
+
+We now provide reproducible builds for Stretch as well as for Jessie.
+
+
+Fixed a bug in ``z_mergetoaddress``
+-----------------------------------
+
+We fixed a bug which prevented users sending from ``ANY_SPROUT`` or ``ANY_SAPLING``
+with ``z_mergetoaddress`` when a wallet contained both Sprout and Sapling notes.
+
+
+Insight Explorer
+----------------
+
+We have been incorporating changes to support the Insight explorer directly from
+``zcashd``. v2.0.6 includes the first change to an RPC method. If ``zcashd`` is
+run with the flag ``--insightexplorer``` (this requires an index rebuild), the
+RPC method ``getrawtransaction`` will now return additional information about
+spend indices.
+
+Changelog
+=========
+
+Charlie O'Keefe (1):
+      Add stretch to list of suites in gitian linux descriptors
+
+Daira Hopwood (9):
+      Closes #3992. Remove obsolete warning message.
+      make-release.py: Versioning changes for 2.0.6-rc1.
+      make-release.py: Updated manpages for 2.0.6-rc1.
+      make-release.py: Updated release notes and changelog for 2.0.6-rc1.
+      ld --version doesn't work on macOS.
+      Tweak author aliases.
+      Add coding declaration to zcutil/release-notes.py
+      make-release.py: Versioning changes for 2.0.6.
+      make-release.py: Updated manpages for 2.0.6.
+
+Daniel Kraft (1):
+      Add some const declarations where they are appropriate.
+
+Eirik Ogilvie-Wigley (1):
+      Notable changes for 2.0.6
+
+Eirik Ogilvie-Wigley (7):
+      Fix tree depth in comment
+      Update author aliases
+      Remove old mergetoaddress RPC test
+      Replace CSproutNotePlaintextEntry with SproutNoteEntry to match Sapling
+      z_getmigrationstatus help message wording change
+      Fix z_mergetoaddress sending from ANY_SPROUT/ANY_SAPLING when the wallet contains both note types
+      Clarify what combinations of from addresses can be used in z_mergetoaddress
+
+Jack Grigg (10):
+      Move Equihash parameters into consensus params
+      Globals: Remove Zcash-specific Params() calls from main.cpp
+      Globals: Explicitly pass const CChainParams& to IsStandardTx()
+      Globals: Explicit const CChainParams& arg for main:
+      Globals: Explicitly pass const CChainParams& to ContextualCheckTransaction()
+      Globals: Explicit const CChainParams& arg for main:
+      Globals: Explicitly pass const CChainParams& to DisconnectBlock()
+      Consistently use chainparams and consensusParams
+      Globals: Explicitly pass const CChainParams& to IsInitialBlockDownload()
+      Globals: Explicitly pass const CChainParams& to ReceivedBlockTransactions()
+
+Jorge Timón (6):
+      Globals: Explicit Consensus::Params arg for main:
+      Globals: Make AcceptBlockHeader static (Fix #6163)
+      Chainparams: Explicit CChainParams arg for main (pre miner):
+      Chainparams: Explicit CChainParams arg for miner:
+      Globals: Remove a bunch of Params() calls from main.cpp:
+      Globals: Explicitly pass const CChainParams& to UpdateTip()
+
+Larry Ruane (1):
+      add spentindex to getrawtransaction RPC results
+
+Marco Falke (1):
+      [doc] Fix doxygen comments for members
+
+Mary Moore-Simmons (1):
+      Fixes issue #3504: Changes to --version and adds a couple other useful commands.
+
+Peter Todd (1):
+      Improve block validity/ConnectBlock() comments
+
+Simon Liu (1):
+      Fix typo and clean up help message for RPC z_getmigrationstatus.
+
+Wladimir J. van der Laan (1):
+      Break circular dependency main ↔ txdb
+
+face (2):
+      Pass CChainParams to DisconnectTip()
+      Explicitly pass CChainParams to ConnectBlock
+
+Benjamin Winston (1):
+      Fixes #4013, added BitcoinABC as a disclosure partner
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.0.7-1.md b/depend/zcash/doc/release-notes/release-notes-2.0.7-1.md
new file mode 100644
index 000000000..997d4b9f4
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.0.7-1.md
@@ -0,0 +1,38 @@
+Notable changes
+===============
+
+Testnet Blossom Rewind
+----------------------
+Testnet users needed to upgrade to 2.0.7 before Blossom activated. The amount
+of notice given to these users was brief, so many were not able to upgrade in
+time. These users may now be on the wrong branch. v2.0.7-1 adds an "intended
+rewind" to prevent having to manually reindex when reconnecting to the correct
+chain.
+
+
+Insight Explorer Logging Fix
+----------------------------
+Fixed an issue where `ERROR: spent index not enabled` would be logged unnecessarily.
+
+Changelog
+=========
+
+Alex Tsankov (2):
+      Update INSTALL
+      Typo Fix
+
+Daira Hopwood (1):
+      Add intended rewind for Blossom on testnet.
+
+Eirik Ogilvie-Wigley (6):
+      Notable changes for v2.0.7-1
+      fix typo
+      Add note about logging fix
+      Better wording in release notes
+      make-release.py: Versioning changes for 2.0.7-1.
+      make-release.py: Updated manpages for 2.0.7-1.
+
+Larry Ruane (2):
+      #4114 don't call error() from GetSpentIndex()
+      better fix: make GetSpentIndex() consistent with others...
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.0.7-2.md b/depend/zcash/doc/release-notes/release-notes-2.0.7-2.md
new file mode 100644
index 000000000..f135ad733
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.0.7-2.md
@@ -0,0 +1,30 @@
+Notable changes
+===============
+
+
+Pre-Blossom EOS Halt
+--------------------
+v2.0.7-2 contains a shortened EOS halt so that is in alignment with v2.0.7. 
+
+
+Testnet Blossom Rewind
+----------------------
+Testnet users needed to upgrade to 2.0.7 before Blossom activated. The amount
+of notice given to these users was brief, so many were not able to upgrade in
+time. These users may now be on the wrong branch. v2.0.7-2 adds an "intended
+rewind" to prevent having to manually reindex when reconnecting to the correct
+chain.
+
+
+Insight Explorer Logging Fix
+----------------------------
+Fixed an issue where `ERROR: spent index not enabled` would be logged unnecessarily.
+
+Changelog
+=========
+
+Eirik Ogilvie-Wigley (3):
+      Notable changes for v2.0.7-2
+      make-release.py: Versioning changes for 2.0.7-2.
+      make-release.py: Updated manpages for 2.0.7-2.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.0.7-3.md b/depend/zcash/doc/release-notes/release-notes-2.0.7-3.md
new file mode 100644
index 000000000..baf7cac15
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.0.7-3.md
@@ -0,0 +1,35 @@
+Notable changes
+===============
+
+This release fixes a security issue described at
+https://z.cash/support/security/announcements/security-announcement-2019-09-24/ .
+
+The service period of this release is shorter than normal due to the upcoming
+v2.1.0 Blossom release. The End-of-Service of v2.0.7-3 will occur at block height
+653012, expected to be on 2019-12-10.
+
+
+Shrinking of debug.log files is temporarily disabled
+----------------------------------------------------
+
+In previous versions, `zcashd` would shrink the `debug.log` file to 200 KB on
+startup if it was larger than 10 MB. This behaviour, and the `-shrinkdebugfile`
+option that controlled it, has been disabled.
+
+Changelog
+=========
+
+Daira Hopwood (4):
+      Add hotfix release notes.
+      Make a note of the shorter service period in the release notes.
+      make-release.py: Versioning changes for 2.0.7-3.
+      make-release.py: Updated manpages for 2.0.7-3.
+
+Jack Grigg (6):
+      Disable -shrinkdebugfile command
+      SetMerkleBranch: remove unused code, remove cs_main lock requirement
+      Remove cs_main lock requirement from CWallet::SyncTransaction
+      Ignore exceptions when deserializing note plaintexts
+      Move mempool SyncWithWallets call into its own thread
+      Enable RPC tests to wait on mempool notifications
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.0.7-rc1.md b/depend/zcash/doc/release-notes/release-notes-2.0.7-rc1.md
new file mode 100644
index 000000000..ab448862a
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.0.7-rc1.md
@@ -0,0 +1,118 @@
+Changelog
+=========
+
+Daira Hopwood (10):
+      Add MIT license to Makefiles
+      Add MIT license to build-aux/m4/bitcoin_* scripts, and a permissive license to build-aux/m4/l_atomic.m4 .
+      Update copyright information for Zcash, leveldb, and libsnark.
+      Add license information for Autoconf macros. refs #2827
+      Update contrib/debian/copyright for ax_boost_thread.m4
+      Replace http with https: in links to the MIT license. Also change MIT/X11 to just MIT, since no distinction was intended.
+      qa/zcash/checksec.sh is under a BSD license, with a specialized non-endorsement clause.
+      Link to ticket #2827 using URL
+      Release process doc: add step to set the gpg key id.
+      Release process doc: mention the commit message.
+
+Dimitris Apostolou (5):
+      Rename vjoinsplit to vJoinSplit
+      Fix naming inconsistency
+      Rename joinsplit to shielded
+      Rename FindWalletTx to FindWalletTxToZap
+      Fix RPC undefined behavior.
+
+Eirik Ogilvie-Wigley (47):
+      Make nextHeight required in CalculateNextWorkRequired
+      Fix nondeterministic failure in sapling migration test
+      Clean up and fix typo
+      Apply suggestions from code review
+      Shorter block times rpc test
+      Update pow_tests for shorter block times
+      Update test_pow for shorter block times
+      Update block subsidy halving for zip208
+      Make NetworkUpgradeAvailable a method of Params
+      Temporarily disable test
+      Simplify PartitionCheck
+      Use static_assert
+      Add missing new line at end of file
+      pow test cleanup
+      Add message to static_assert
+      Update expiry height for shorter block times
+      Fix zip208 founders reward calculation and update test
+      PartitionCheck tests for shorter block times
+      Add test for Blossom default tx expiry delta
+      Update metrics block height estimation for shorter block times
+      Do not create transactions that will expire after the next epoch
+      Do not send migration transactions that would expire after a network upgrade
+      Fix integer truncation in Blossom halving calculation
+      Update main_tests for shorter block times
+      Use pre-Blossom max FR height when calculating address change interval
+      Make founders reward tests pass before and after Blossom activation height is set
+      Extract Halvings method and add tests
+      Add comments and fix typos
+      Improve EstimateNetHeight calculation
+      Fix check transaction tests
+      Make sure to deactivate blossom in test case
+      Fix parsing txexpirydelta argument
+      Do not add expiring soon threshold to expiry height of txs near NU activation
+      Fix/update comments
+      Make sure that expiry height is not less than height
+      Clarify documentation
+      Update PoW related assertions
+      Remove DefaultExpiryDelta method
+      Algebraic improvements related to halving
+      Distinguish between height and current header height on metrics screen
+      Test clean up and fixes
+      Add copyright info
+      NPE defense in metrics screen
+      Do not estimate height if there is no best header
+      Rename method and use int64_t
+      make-release.py: Versioning changes for 2.0.7-rc1.
+      make-release.py: Updated manpages for 2.0.7-rc1.
+
+Eirik Ogilvie-Wigley (8):
+      Use CommitTransaction() rather than sendrawtransaction()
+      Move reused async rpc send logic to separate file
+      Move reused sign and send logic
+      Do not shadow the return value when testmode is true
+      Inline sign_send_raw_transaction
+      Allow passing optional reserve key as a parameter to SendTransaction
+      Use reserve key for transparent change when sending to Sapling
+      Fix comment in mergetoaddress RPC test
+
+Jack Grigg (4):
+      test: Check for change t-addr reuse in z_sendmany
+      Use reserve key for transparent change when sending to Sprout
+      test: Fix permissions on wallet_changeaddresses RPC test
+      test: Fix pyflakes warnings
+
+Larry Ruane (6):
+      add addressindex related RPCs
+      add spentindex RPC for bitcore block explorer
+      add timestampindex related RPC getblockhashes
+      fix getblockdeltas documentation formatting
+      insightexplorer minor bug fixes
+      insightexplorer fix LogPrintf
+
+Luke Dashjr (2):
+      Add MIT license to autogen.sh and share/genbuild.sh
+      Trivial: build-aux/m4/l_atomic: Fix typo
+
+Simon Liu (8):
+      Redefine PoW functions to accept height parameter.
+      Remove use of redundant member nPowTargetSpacing.
+      Replace nPoWTargetSpacing -> PoWTargetSpacing()
+      Update PoW function calls to pass in height.
+      Update GetBlockTimeout() to take height parameter.
+      Replace nPoWTargetSpacing -> PoWTargetSpacing() in ProcessMessage()
+      Replace nPoWTargetSpacing -> PoWTargetSpacing() in tests
+      Modify PartitionCheck to be aware of pre & post Blossom target spacing.
+
+William M Peaster (1):
+      Handful of copyedits to README.md
+
+codetriage-readme-bot (1):
+      Link to development guidelines in CONTRIBUTING.md
+
+Jack Grigg (1):
+      Update README.md
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.0.7.md b/depend/zcash/doc/release-notes/release-notes-2.0.7.md
new file mode 100644
index 000000000..6c5e8bc9d
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.0.7.md
@@ -0,0 +1,149 @@
+Notable changes
+===============
+
+Shorter Block Times
+-------------------
+Shorter block times are coming to Zcash! In the v2.0.7 release we have implemented [ZIP208](https://github.com/zcash/zips/blob/master/zip-0208.rst) which will take effect when Blossom activates. Upon activation, the block times for Zcash will decrease from 150 seconds to 75 seconds, and the block reward will decrease accordingly. This affects at what block height halving events will occur, but should not affect the overall rate at which Zcash is mined. The total founders' reward stays the same, and the total supply of Zcash is decreased only microscopically due to rounding.
+
+Blossom Activation on Testnet
+-----------------------------
+The v2.0.7 release includes Blossom activation on testnet, bringing shorter block times. The testnet Blossom activation height is 584000.
+
+Insight Explorer
+----------------
+Changes needed for the Insight explorer have been incorporated into Zcash. *This is an experimental feature* and therefore is subject to change. To enable, add the `experimentalfeatures=1`, `txindex=1`, and `insightexplorer=1` flags to `zcash.conf`. This feature adds several RPCs to `zcashd` which allow the user to run an Insight explorer.
+
+Changelog
+=========
+
+Daira Hopwood (11):
+      Add MIT license to Makefiles
+      Add MIT license to build-aux/m4/bitcoin_* scripts, and a permissive license to build-aux/m4/l_atomic.m4 .
+      Update copyright information for Zcash, leveldb, and libsnark.
+      Add license information for Autoconf macros. refs #2827
+      Update contrib/debian/copyright for ax_boost_thread.m4
+      Replace http with https: in links to the MIT license. Also change MIT/X11 to just MIT, since no distinction was intended.
+      qa/zcash/checksec.sh is under a BSD license, with a specialized non-endorsement clause.
+      Link to ticket #2827 using URL
+      Release process doc: add step to set the gpg key id.
+      Release process doc: mention the commit message.
+      Add RPC test and test framework constants for Sapling->Blossom activation.
+
+Dimitris Apostolou (5):
+      Rename vjoinsplit to vJoinSplit
+      Fix naming inconsistency
+      Rename joinsplit to shielded
+      Rename FindWalletTx to FindWalletTxToZap
+      Fix RPC undefined behavior.
+
+Eirik Ogilvie-Wigley (56):
+      Make nextHeight required in CalculateNextWorkRequired
+      Fix nondeterministic failure in sapling migration test
+      Clean up and fix typo
+      Apply suggestions from code review
+      Shorter block times rpc test
+      Update pow_tests for shorter block times
+      Update test_pow for shorter block times
+      Update block subsidy halving for zip208
+      Make NetworkUpgradeAvailable a method of Params
+      Temporarily disable test
+      Simplify PartitionCheck
+      Use static_assert
+      Add missing new line at end of file
+      pow test cleanup
+      Add message to static_assert
+      Update expiry height for shorter block times
+      Fix zip208 founders reward calculation and update test
+      PartitionCheck tests for shorter block times
+      Add test for Blossom default tx expiry delta
+      Update metrics block height estimation for shorter block times
+      Do not create transactions that will expire after the next epoch
+      Do not send migration transactions that would expire after a network upgrade
+      Fix integer truncation in Blossom halving calculation
+      Update main_tests for shorter block times
+      Use pre-Blossom max FR height when calculating address change interval
+      Make founders reward tests pass before and after Blossom activation height is set
+      Extract Halvings method and add tests
+      Add comments and fix typos
+      Improve EstimateNetHeight calculation
+      Fix check transaction tests
+      Make sure to deactivate blossom in test case
+      Fix parsing txexpirydelta argument
+      Do not add expiring soon threshold to expiry height of txs near NU activation
+      Fix/update comments
+      Make sure that expiry height is not less than height
+      Clarify documentation
+      Update PoW related assertions
+      Remove DefaultExpiryDelta method
+      Algebraic improvements related to halving
+      Distinguish between height and current header height on metrics screen
+      Test clean up and fixes
+      Add copyright info
+      NPE defense in metrics screen
+      Do not estimate height if there is no best header
+      Rename method and use int64_t
+      make-release.py: Versioning changes for 2.0.7-rc1.
+      make-release.py: Updated manpages for 2.0.7-rc1.
+      make-release.py: Updated release notes and changelog for 2.0.7-rc1.
+      Update download path
+      Set testnet Blossom activation height
+      Notable changes for v2.0.7
+      Enable shorter block times rpc test
+      Grammatical fixes and improvements
+      Remove constant
+      make-release.py: Versioning changes for 2.0.7.
+      make-release.py: Updated manpages for 2.0.7.
+
+Eirik Ogilvie-Wigley (8):
+      Use CommitTransaction() rather than sendrawtransaction()
+      Move reused async rpc send logic to separate file
+      Move reused sign and send logic
+      Do not shadow the return value when testmode is true
+      Inline sign_send_raw_transaction
+      Allow passing optional reserve key as a parameter to SendTransaction
+      Use reserve key for transparent change when sending to Sapling
+      Fix comment in mergetoaddress RPC test
+
+Jack Grigg (5):
+      test: Check for change t-addr reuse in z_sendmany
+      Use reserve key for transparent change when sending to Sprout
+      test: Fix permissions on wallet_changeaddresses RPC test
+      test: Fix pyflakes warnings
+      test: Fix AuthServiceProxy closed conn detection
+
+Larry Ruane (6):
+      add addressindex related RPCs
+      add spentindex RPC for bitcore block explorer
+      add timestampindex related RPC getblockhashes
+      fix getblockdeltas documentation formatting
+      insightexplorer minor bug fixes
+      insightexplorer fix LogPrintf
+
+Luke Dashjr (2):
+      Add MIT license to autogen.sh and share/genbuild.sh
+      Trivial: build-aux/m4/l_atomic: Fix typo
+
+Simon Liu (8):
+      Redefine PoW functions to accept height parameter.
+      Remove use of redundant member nPowTargetSpacing.
+      Replace nPoWTargetSpacing -> PoWTargetSpacing()
+      Update PoW function calls to pass in height.
+      Update GetBlockTimeout() to take height parameter.
+      Replace nPoWTargetSpacing -> PoWTargetSpacing() in ProcessMessage()
+      Replace nPoWTargetSpacing -> PoWTargetSpacing() in tests
+      Modify PartitionCheck to be aware of pre & post Blossom target spacing.
+
+William M Peaster (1):
+      Handful of copyedits to README.md
+
+codetriage-readme-bot (1):
+      Link to development guidelines in CONTRIBUTING.md
+
+Jack Grigg (1):
+      Update README.md
+
+Benjamin Winston (3):
+      Updated location to new download server
+      Fixes 4097, improves caching on parameter downloads
+      Updated location to new download server, fixing #4100
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.1.0-1.md b/depend/zcash/doc/release-notes/release-notes-2.1.0-1.md
new file mode 100644
index 000000000..21b08f168
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.1.0-1.md
@@ -0,0 +1,10 @@
+Changelog
+=========
+
+Jack Grigg (2):
+      make-release.py: Versioning changes for 2.1.0-1.
+      make-release.py: Updated manpages for 2.1.0-1.
+
+Sean Bowe (1):
+      Fix of CVE-2017-18350
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.1.0-rc1.md b/depend/zcash/doc/release-notes/release-notes-2.1.0-rc1.md
new file mode 100644
index 000000000..e11a6c09c
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.1.0-rc1.md
@@ -0,0 +1,177 @@
+Notable changes
+===============
+
+DoS Mitigation: Mempool Size Limit and Random Drop
+--------------------------------------------------
+
+This release adds a mechanism for preventing nodes from running out of memory
+in the situation where an attacker is trying to overwhelm the network with
+transactions. This is achieved by keeping track of and limiting the total
+`cost` and `evictionWeight` of all transactions in the mempool. The `cost` of a
+transaction is determined by its size in bytes, and its `evictionWeight` is a
+function of the transaction's `cost` and its fee. The maximum total cost is 
+configurable via the parameter `mempooltxcostlimit` which defaults to
+80,000,000 (up to 20,000 txs). If a node's total mempool `cost` exceeds this
+limit the node will evict a random transaction, preferentially picking larger
+transactions and ones with below the standard fee. To prevent a node from
+re-accepting evicted transactions, it keeps track of ones that it has evicted
+recently. By default, a transaction will be considered recently evicted for 60
+minutes, but this can be configured with the parameter
+`mempoolevictionmemoryminutes`.
+
+For full details see ZIP 401.
+
+Fake chain detection during initial block download
+--------------------------------------------------
+
+One of the mechanisms that `zcashd` uses to detect whether it is in "initial
+block download" (IBD) mode is to compare the active chain's cumulative work
+against a hard-coded "minimum chain work" value. This mechanism (inherited from
+Bitcoin Core) means that once a node exits IBD mode, it is either on the main
+chain, or a fake alternate chain with similar amounts of work. In the latter
+case, the node has most likely become the victim of a 50% + 1 adversary.
+
+Starting from this release, `zcashd` additionally hard-codes the block hashes
+for the activation blocks of each past network upgrade (NU). During initial
+chain synchronization, and after the active chain has reached "minimum chain
+work", the node checks the blocks at each NU activation height against the
+hard-coded hashes. If any of them do not match, the node will immediately alert
+the user and **shut down for safety**.
+
+Disabling old Sprout proofs
+---------------------------
+
+As part of our ongoing work to clean up the codebase and minimise the security
+surface of `zcashd`, we are removing `libsnark` from the codebase, and dropping
+support for creating and verifying old Sprout proofs. Funds stored in Sprout
+addresses are not affected, as they are spent using the hybrid Sprout circuit
+(built using `bellman`) that was deployed during the Sapling network upgrade.
+
+This change has several implications:
+
+- `zcashd` no longer verifies old Sprout proofs, and will instead assume they
+  are valid. This has a minor implication for nodes: during initial block
+  download, an adversary could feed the node fake blocks containing invalid old
+  Sprout proofs, and the node would accept the fake chain as valid. However,
+  as soon as the active chain contains at least as much work as the hard-coded
+  "minimum chain work" value, the node will detect this situation and shut down.
+
+- Shielded transactions can no longer be created before Sapling has activated.
+  This does not affect Zcash itself, but will affect downstream codebases that
+  have not yet activated Sapling (or that start a new chain after this point and
+  do not activate Sapling from launch). Note that the old Sprout circuit is
+  [vulnerable to counterfeiting](https://z.cash/support/security/announcements/security-announcement-2019-02-05-cve-2019-7167/)
+  and should not be used in current deployments.
+
+- Starting from this release, the circuit parameters from the original Sprout
+  MPC are no longer required to start `zcashd`, and will not be downloaded by
+  `fetch-params.sh`. They are not being automatically deleted at this time.
+
+We would like to take a moment to thank the `libsnark` authors and contributors.
+It was vital to the success of Zcash, and the development of zero-knowledge
+proofs in general, to have this code available and usable.
+
+Changelog
+=========
+
+Bryant Eisenbach (2):
+      doc: Change Debian package description
+      doc: Move text prior to "This package provides..."
+
+Daira Hopwood (4):
+      Remove copyright entries for Autoconf macros that have been deleted.
+      Remove copyright entry for libsnark.
+      Test setting an expiry height of 0.
+      Fix setting an expiry height of 0. fixes #4132
+
+Eirik Ogilvie-Wigley (33):
+      Wrap metrics message in strprintf
+      DoS protection: Weighted random drop of txs if mempool full
+      Rebuild weighted list on removal and fix size calculation
+      Grammatical fixes
+      Remove transactions when ensuring size limit
+      Help message cleanup and add lock
+      Performance: Store weighted transactions in a tree
+      Fix naming conventions
+      No need to activate Overwinter/Sapling in rpc test
+      Fix recently evicted list size
+      Put size increment and decrement on their own lines
+      Prevent adding duplicate transactions
+      Move duplicate macro to reusable location
+      mempool_limit rpc test cleanup
+      Represent tx costs as signed integers
+      Fix comments
+      Rename variables for consistency
+      Use tx cost rather than evictionWeight when checking mempool capacity
+      Log rather than return error if a transaction is recently evicted
+      Represent recently evicted list as a deque
+      Rename files
+      Update release notes
+      Add test
+      minor rpc test clean up
+      Add explanatory comments
+      Wording and grammatical fixes
+      Update parameter names to match ZIP
+      Clarify the difference between cost and evictionWeight
+      Fix test cases: default mempool limiters
+      Remove dots and underscores from parameter names
+      Use same type when calling max
+      make-release.py: Versioning changes for 2.1.0-rc1.
+      make-release.py: Updated manpages for 2.1.0-rc1.
+
+Gareth Davies (1):
+      Updating IPFS link for chunking
+
+Jack Grigg (39):
+      depends: Add FreeBSD to hosts and builders
+      depends: Explicitly set Boost toolchain during configuration
+      depends: Add FreeBSD support to OpenSSL
+      depends: Patch libevent to detect arch4random_addrandom
+      depends: Add FreeBSD Rust binaries
+      depends: Explicitly call Rust install script using bash
+      depends: Use project-config.jam to configure Boost instead of user-config.jam
+      depends: Set PIC flags for FreeBSD
+      Always skip verification for old Sprout proofs
+      Remove ability to create non-Groth16 Sprout JSDescriptions
+      Use Sapling JSDescriptions in Boost tests
+      Remove non-Groth16 Sprout proofs from joinsplit gtests
+      Migrate test utilities to generate Sapling-type Sprout proofs
+      Use Sapling JSDescriptions in gtests
+      Revert "Allow user to ask server to save the Sprout R1CS out during startup."
+      Remove libsnark code for pre-Sapling Sprout proofs
+      Remove pre-Sapling Sprout circuit
+      Revert "configure: Guess -march for libsnark OPTFLAGS instead of hard-coding"
+      Revert "Check if OpenMP is available before using it"
+      Remove libsnark from build system
+      Remove libsnark
+      Remove libgmp
+      Remove libsnark unit tests from full test suite
+      test: Require minimum of Sapling for all RPC tests
+      test: Add Sapling v4 transactions to mininode framework
+      test: Add hashFinalSaplingProxy to create_block
+      test: Update RPC tests to use a minimum of Sapling
+      rpc: Use Sapling transactions in zc_raw_joinsplit
+      depends: Fix crate vendoring path
+      depends: Helper for vendoring new crates
+      depends: Add flag for building with a local librustzcash repo
+      tests: Clean up use of repr() in mininode
+      Remove makeGrothProof argument from JoinSplit::prove
+      Stop fetching old Sprout parameters
+      Add libsnark removal to notable changes
+      Move AbortNode to the top of main.cpp
+      Abort node if NU activations have unexpected hashes
+      Add block hashes for Overwinter, Sapling, and testnet Blossom
+      Update release notes with node abort behaviour
+
+Larry Ruane (4):
+      insightexplorer: formatting, pyflakes cleanups
+      precompute empty merkle roots
+      update unit tests to compute empty roots
+      access array element using at()
+
+jeff-liang (1):
+      Display which network the node is running on.
+
+Benjamin Winston (1):
+      Removed stale seeder, fixing #4153
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.1.0.md b/depend/zcash/doc/release-notes/release-notes-2.1.0.md
new file mode 100644
index 000000000..a34305b17
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.1.0.md
@@ -0,0 +1,215 @@
+Notable changes
+===============
+
+Blossom network upgrade
+-----------------------
+
+The mainnet activation of the Blossom network upgrade is supported by this
+release, with an activation height of 653600, which should occur in early
+December — roughly one day following the targeted EOS halt of our 2.0.7-3
+release. Please upgrade to this release, or any subsequent release, in order to
+follow the Blossom network upgrade.
+
+The Blossom network upgrade implements
+[ZIP208](https://github.com/zcash/zips/blob/master/zip-0208.rst) which shortens
+block times from 150s to 75s.
+
+DoS Mitigation: Mempool Size Limit and Random Drop
+--------------------------------------------------
+
+This release adds a mechanism for preventing nodes from running out of memory
+in the situation where an attacker is trying to overwhelm the network with
+transactions. This is achieved by keeping track of and limiting the total
+`cost` and `evictionWeight` of all transactions in the mempool. The `cost` of a
+transaction is determined by its size in bytes, and its `evictionWeight` is a
+function of the transaction's `cost` and its fee. The maximum total cost is 
+configurable via the parameter `mempooltxcostlimit` which defaults to
+80,000,000 (up to 20,000 txs). If a node's total mempool `cost` exceeds this
+limit the node will evict a random transaction, preferentially picking larger
+transactions and ones with below the standard fee. To prevent a node from
+re-accepting evicted transactions, it keeps track of ones that it has evicted
+recently. By default, a transaction will be considered recently evicted for 60
+minutes, but this can be configured with the parameter
+`mempoolevictionmemoryminutes`.
+
+For full details see ZIP 401.
+
+Asynchronous Operations Incorrectly Reporting Success
+-----------------------------------------------------
+We fixed an issue where asynchronous operations were sometimes reporting sucess
+when they had actually failed. One way this could occur was when trying to use
+`z_sendmany` to create a transaction spending coinbase funds in a way where
+change would be generated (not a valid use of `z_sendmany`). In this case the
+operation would erroneously report success, and the only way to see that the 
+transaction had actually failed was to look in the `debug.log` file. Such
+operations will now correctly report that they have failed.
+
+Fake chain detection during initial block download
+--------------------------------------------------
+
+One of the mechanisms that `zcashd` uses to detect whether it is in "initial
+block download" (IBD) mode is to compare the active chain's cumulative work
+against a hard-coded "minimum chain work" value. This mechanism (inherited from
+Bitcoin Core) means that once a node exits IBD mode, it is either on the main
+chain, or a fake alternate chain with similar amounts of work. In the latter
+case, the node has most likely become the victim of a 50% + 1 adversary.
+
+Starting from this release, `zcashd` additionally hard-codes the block hashes
+for the activation blocks of each past network upgrade (NU). During initial
+chain synchronization, and after the active chain has reached "minimum chain
+work", the node checks the blocks at each NU activation height against the
+hard-coded hashes. If any of them do not match, the node will immediately alert
+the user and **shut down for safety**.
+
+Disabling old Sprout proofs
+---------------------------
+
+As part of our ongoing work to clean up the codebase and minimise the security
+surface of `zcashd`, we are removing `libsnark` from the codebase, and dropping
+support for creating and verifying old Sprout proofs. Funds stored in Sprout
+addresses are not affected, as they are spent using the hybrid Sprout circuit
+(built using `bellman`) that was deployed during the Sapling network upgrade.
+
+This change has several implications:
+
+- `zcashd` no longer verifies old Sprout proofs, and will instead assume they
+  are valid. This has a minor implication for nodes: during initial block
+  download, an adversary could feed the node fake blocks containing invalid old
+  Sprout proofs, and the node would accept the fake chain as valid. However,
+  as soon as the active chain contains at least as much work as the hard-coded
+  "minimum chain work" value, the node will detect this situation and shut down.
+
+- Shielded transactions can no longer be created before Sapling has activated.
+  This does not affect Zcash itself, but will affect downstream codebases that
+  have not yet activated Sapling (or that start a new chain after this point and
+  do not activate Sapling from launch). Note that the old Sprout circuit is
+  [vulnerable to counterfeiting](https://z.cash/support/security/announcements/security-announcement-2019-02-05-cve-2019-7167/)
+  and should not be used in current deployments.
+
+- Starting from this release, the circuit parameters from the original Sprout
+  MPC are no longer required to start `zcashd`, and will not be downloaded by
+  `fetch-params.sh`. They are not being automatically deleted at this time.
+
+We would like to take a moment to thank the `libsnark` authors and contributors.
+It was vital to the success of Zcash, and the development of zero-knowledge
+proofs in general, to have this code available and usable.
+
+Changelog
+=========
+
+Bryant Eisenbach (2):
+      doc: Change Debian package description
+      doc: Move text prior to "This package provides..."
+
+Daira Hopwood (4):
+      Remove copyright entries for Autoconf macros that have been deleted.
+      Remove copyright entry for libsnark.
+      Test setting an expiry height of 0.
+      Fix setting an expiry height of 0. fixes #4132
+
+Dimitris Apostolou (1):
+      depends macOS: point --sysroot to SDK
+
+Eirik Ogilvie-Wigley (41):
+      Wrap metrics message in strprintf
+      DoS protection: Weighted random drop of txs if mempool full
+      Rebuild weighted list on removal and fix size calculation
+      Grammatical fixes
+      Remove transactions when ensuring size limit
+      Help message cleanup and add lock
+      Performance: Store weighted transactions in a tree
+      Fix naming conventions
+      No need to activate Overwinter/Sapling in rpc test
+      Fix recently evicted list size
+      Put size increment and decrement on their own lines
+      Prevent adding duplicate transactions
+      Move duplicate macro to reusable location
+      mempool_limit rpc test cleanup
+      Represent tx costs as signed integers
+      Fix comments
+      Rename variables for consistency
+      Use tx cost rather than evictionWeight when checking mempool capacity
+      Log rather than return error if a transaction is recently evicted
+      Represent recently evicted list as a deque
+      Rename files
+      Update release notes
+      Add test
+      minor rpc test clean up
+      Add explanatory comments
+      Wording and grammatical fixes
+      Update parameter names to match ZIP
+      Clarify the difference between cost and evictionWeight
+      Fix test cases: default mempool limiters
+      Remove dots and underscores from parameter names
+      Use same type when calling max
+      make-release.py: Versioning changes for 2.1.0-rc1.
+      make-release.py: Updated manpages for 2.1.0-rc1.
+      make-release.py: Updated release notes and changelog for 2.1.0-rc1.
+      Release notes for bug fix
+      Better wording in release notes
+      Fix wording
+      Fix getblocksubsidy tests
+      fix comment
+      make-release.py: Versioning changes for 2.1.0.
+      make-release.py: Updated manpages for 2.1.0.
+
+Gareth Davies (1):
+      Updating IPFS link for chunking
+
+Jack Grigg (39):
+      depends: Add FreeBSD to hosts and builders
+      depends: Explicitly set Boost toolchain during configuration
+      depends: Add FreeBSD support to OpenSSL
+      depends: Patch libevent to detect arch4random_addrandom
+      depends: Add FreeBSD Rust binaries
+      depends: Explicitly call Rust install script using bash
+      depends: Use project-config.jam to configure Boost instead of user-config.jam
+      depends: Set PIC flags for FreeBSD
+      Always skip verification for old Sprout proofs
+      Remove ability to create non-Groth16 Sprout JSDescriptions
+      Use Sapling JSDescriptions in Boost tests
+      Remove non-Groth16 Sprout proofs from joinsplit gtests
+      Migrate test utilities to generate Sapling-type Sprout proofs
+      Use Sapling JSDescriptions in gtests
+      Revert "Allow user to ask server to save the Sprout R1CS out during startup."
+      Remove libsnark code for pre-Sapling Sprout proofs
+      Remove pre-Sapling Sprout circuit
+      Revert "configure: Guess -march for libsnark OPTFLAGS instead of hard-coding"
+      Revert "Check if OpenMP is available before using it"
+      Remove libsnark from build system
+      Remove libsnark
+      Remove libgmp
+      Remove libsnark unit tests from full test suite
+      test: Require minimum of Sapling for all RPC tests
+      test: Add Sapling v4 transactions to mininode framework
+      test: Add hashFinalSaplingProxy to create_block
+      test: Update RPC tests to use a minimum of Sapling
+      rpc: Use Sapling transactions in zc_raw_joinsplit
+      depends: Fix crate vendoring path
+      depends: Helper for vendoring new crates
+      depends: Add flag for building with a local librustzcash repo
+      tests: Clean up use of repr() in mininode
+      Remove makeGrothProof argument from JoinSplit::prove
+      Stop fetching old Sprout parameters
+      Add libsnark removal to notable changes
+      Move AbortNode to the top of main.cpp
+      Abort node if NU activations have unexpected hashes
+      Add block hashes for Overwinter, Sapling, and testnet Blossom
+      Update release notes with node abort behaviour
+
+Larry Ruane (5):
+      insightexplorer: formatting, pyflakes cleanups
+      precompute empty merkle roots
+      update unit tests to compute empty roots
+      access array element using at()
+      #4175 z_sendmany coinbase to zaddr with change: report error status
+
+Sean Bowe (1):
+      Set mainnet activation of Blossom
+
+jeff-liang (1):
+      Display which network the node is running on.
+
+Benjamin Winston (1):
+      Removed stale seeder, fixing #4153
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.1.1-1.md b/depend/zcash/doc/release-notes/release-notes-2.1.1-1.md
new file mode 100644
index 000000000..5c764f24c
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.1.1-1.md
@@ -0,0 +1,43 @@
+Notable changes
+===============
+
+This release fixes a security issue described at
+https://z.cash/support/security/announcements/security-announcement-2020-02-06/ .
+
+This release also adds a `-maxtimeadjustment` option to set the maximum time, in
+seconds, by which the node's clock can be adjusted based on the clocks of its
+peer nodes. This option defaults to 0, meaning that no such adjustment is performed.
+This is a change from the previous behaviour, which was to adjust the clock by up
+to 70 minutes forward or backward. The maximum setting for this option is now
+25 minutes (1500 seconds).
+
+Fix for incorrect banning of nodes during syncing
+-------------------------------------------------
+After activation of the Blossom network upgrade, a node that is syncing the
+block chain from before Blossom would incorrectly ban peers that send it a
+Blossom transaction. This resulted in slower and less reliable syncing (#4283).
+
+Changelog
+=========
+
+Daira Hopwood (10):
+      Move check for block times that are too far ahead of adjusted time, to ContextualCheckBlock.
+      Improve messages for timestamp rules.
+      Add constant for how far a block timestamp can be ahead of adjusted time. Loosely based on https://github.com/bitcoin/bitcoin/commit/e57a1fd8999800b3fc744d45bb96354cae294032
+      Soft fork: restrict block timestamps to be no more than 90 minutes after the MTP of the previous block.
+      Adjust the miner to satisfy consensus regarding future timestamps relative to median-time-past.
+      Enable future timestamp soft fork at varying heights according to network.
+      Cosmetic: brace style in ContextualCheckBlockHeader.
+      Add -maxtimeadjustment with default of 0 instead of the 4200 seconds used in Bitcoin Core.
+      Fix ContextualCheckBlock test (the ban score should be 100 since these are mined transactions).
+      Add string argument to static_asserts to satisfy C++11.
+
+Jack Grigg (2):
+      test: Update RPC test cache generation to handle new consensus rule
+      Apply a consistent ban policy within ContextualCheckTransaction
+
+Sean Bowe (3):
+      Release notes for vulnerability and -maxtimeadjustment option.
+      make-release.py: Versioning changes for 2.1.1-1.
+      make-release.py: Updated manpages for 2.1.1-1.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.1.1-rc1.md b/depend/zcash/doc/release-notes/release-notes-2.1.1-rc1.md
new file mode 100644
index 000000000..9e286935b
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.1.1-rc1.md
@@ -0,0 +1,288 @@
+Notable changes
+===============
+
+`z_mergetoaddress` promoted out of experimental status
+------------------------------------------------------
+
+The `z_mergetoaddress` API merges funds from t-addresses, z-addresses, or both,
+and sends them to a single t-address or z-address. It was added in v1.0.15 as an
+experimental feature, to simplify the process of combining many small UTXOs and
+notes into a few larger ones.
+
+In this release we are promoting `z_mergetoaddress` out of experimental status.
+It is now a stable RPC, and any future changes to it will only be additive. See
+`zcash-cli help z_mergetoaddress` for API details and usage.
+
+Unlike most other RPC methods, `z_mergetoaddress` operates over a particular
+quantity of UTXOs and notes, instead of a particular amount of ZEC. By default,
+it will merge 50 UTXOs and 10 notes at a time; these limits can be adjusted with
+the parameters `transparent_limit` and `shielded_limit`.
+
+`z_mergetoaddress` also returns the number of UTXOs and notes remaining in the
+given addresses, which can be used to automate the merging process (for example,
+merging until the number of UTXOs falls below some value).
+
+Option parsing behavior
+-----------------------
+
+Command line options are now parsed strictly in the order in which they are
+specified. It used to be the case that `-X -noX` ends up, unintuitively, with X
+set, as `-X` had precedence over `-noX`. This is no longer the case. Like for
+other software, the last specified value for an option will hold.
+
+Low-level RPC changes
+---------------------
+
+- Bare multisig outputs to our keys are no longer automatically treated as
+  incoming payments. As this feature was only available for multisig outputs for
+  which you had all private keys in your wallet, there was generally no use for
+  them compared to single-key schemes. Furthermore, no address format for such
+  outputs is defined, and wallet software can't easily send to it. These outputs
+  will no longer show up in `listtransactions`, `listunspent`, or contribute to
+  your balance, unless they are explicitly watched (using `importaddress` or
+  `importmulti` with hex script argument). `signrawtransaction*` also still
+  works for them.
+
+Changelog
+=========
+
+Alfredo Garcia (19):
+      remove duplicated prefix in errors and warnings
+      Consensus: Decouple pow.cpp from util.h
+      change some wallet functions from bool to void
+      limit blockchain progress to a max of 1.000000
+      remove z_mergetoaddress from experimental
+      add version to thank you string
+      add next upgrade info to metrics console
+      change target spacing to up to upgrade height
+      create and use SecondsLeftToHeight to display next upgrade info
+      add NextUpgrade test case
+      fix spacing
+      add after blossom test
+      change var and function names for clarity, refactor function
+      reverse conditional, replace get_value_or(0) calls
+      remove redundant line from test
+      remove zmergetoaddress from experimental state in rpc-tests
+      get UPGRADE_TESTDUMMY back to default at the end of the test
+      remove dead code in init
+      readd create_directories
+
+Ben Woosley (1):
+      Assert CPubKey::ValidLength to the pubkey's header-relevent size
+
+Carl Dong (1):
+      depends: tar: Always extract as yourself
+
+Casey Rodarmor (1):
+      Give a better error message if system clock is bad
+
+Charlie O'Keefe (1):
+      Add check-depends step to STAGE_COMMANDS list
+
+Cory Fields (3):
+      depends: qt/cctools: fix checksum checksum tests
+      depends: bump OSX toolchain
+      depends: make osx output deterministic
+
+Dagur Valberg Johannsson (1):
+      Remove option mempooltxinputlimit
+
+Denis Lukianov (1):
+      Correct importaddress help reference to importpubkey
+
+Dimitris Apostolou (4):
+      Fix typo
+      Remove stale comment
+      Change "protect" terminology to "shield"
+      depends macOS: hide linker visibility warnings
+
+Eirik Ogilvie-Wigley (2):
+      Show time elapsed when running RPC tests
+      Update team email
+
+Gavin Andresen (1):
+      Unit test doublespends in new blocks
+
+Gregory Maxwell (1):
+      Make connect=0 disable automatic outbound connections.
+
+Gregory Sanders (1):
+      Added additional config option for multiple RPC users.
+
+Ian T (1):
+      Update RPC generate help for numblocks to include required
+
+Jack Grigg (32):
+      Upgrade librustzcash to 0.2.0
+      Migrate to librustzcash 0.2.0 API
+      Remove invalid address comparison from gtest
+      Cast uint8* in InterruptibleRecv to char* for recv
+      Add Heartwood to upgrade list
+      Initialize experimental mode in a separate function
+      Fix benchmarks after removal of SelectParamsFromCommandLine()
+      Handle Equihash and optional miner code in TestChain100Setup
+      Add tests covering the current interaction of alerts with subver comments
+      Parameterize zcash.conf in init error message
+      cleanup: Comments
+      Wrap long line
+      Match alerts both with and without comments
+      pyflakes fixes
+      Revert "Remove insecurely-downloaded dependencies that we don't currently use."
+      depends: Compile bdb with --disable-atomics when cross-compiling darwin
+      depends: Add Rust targets for cross-compiling darwin
+      configure: Don't require RELRO and BIND_NOW when cross-compiling darwin
+      depends: Manually apply build_env to second half of googletest build
+      Revert "depends: Explicitly set Boost toolchain during configuration"
+      Add z_mergetoaddress to release notes
+      ThreadNotifyRecentlyAdded -> ThreadNotifyWallets
+      Move mempool tx notifying logic out of CTxMemPool
+      Merge tree and boolean fields in ChainTip API
+      Move block-notifying logic into ThreadNotifyWallets
+      Tie sync_blocks in RPC tests to notifier thread
+      Extend comment with reason for taking care with locks
+      test: Add sync_all points after block generation to RPC tests
+      test: Remove genesis-block Sapling activation from shorter_block_times
+      test: Reverse hashtx and hashblock ordering at start of ZMQ RPC test
+      test: Add missing sync_all point
+      test: Update wallet RPC test with change to "absurdly high fee" limit
+
+Jainan-Tandel (1):
+      Cosmetic update to README.md .
+
+Jim Posen (3):
+      Comments: More comments on functions/globals in standard.h.
+      [script] Unit tests for script/standard functions
+      [script] Unit tests for IsMine
+
+Jonas Schnelli (9):
+      [autoprune] allow wallet in pruned mode
+      [RPC] disable import functions in pruned mode
+      [squashme] improve/corrects prune mode detection test for required wallet rescans
+      Refactor parameter interaction, call it before AppInit2()
+      Initialize logging before we do parameter interaction
+      [Wallet] move wallet help string creation to CWallet
+      [Wallet] move "load wallet phase" to CWallet
+      [Wallet] optimize return value of InitLoadWallet()
+      [Wallet] refactor wallet/init interaction
+
+Jorge Timón (4):
+      Chainparams: Replace CBaseChainParams::Network enum with string constants (suggested by Wladimir)
+      Chainparams: Translations: DRY: options and error strings
+      Globals: Decouple GetConfigFile and ReadConfigFile from global mapArgs
+      Policy: MOVEONLY: Create policy/policy.h with some constants
+
+Larry Ruane (5):
+      simplify locking, merge cs_SpendingKeyStore into cs_KeyStore
+      eliminate races: hold cs_KeyStore lock while reading fUseCrypto
+      revert CCryptoKeyStore::SetCrypted() return value
+      insightexplorer: LOCK(cs_main) during rpcs
+      fix tests for enable-debug build
+
+Luke Dashjr (8):
+      Bugfix: RPC: blockchain: Display correct defaults in help for verifychain method
+      Bugfix: Describe dblogsize option correctly (it refers to the wallet database, not memory pool)
+      Bugfix: If genproclimit is omitted to RPC setgenerate, don't change it; also show correct default in getmininginfo
+      Bugfix: Omit wallet-related options from -help when wallet is disabled
+      Constrain constant values to a single location in code
+      Bugfix: Omit wallet-related options from -help when wallet is not supported
+      Policy: MOVEONLY: 3 functions to policy.o:
+      Common argument defaults for NODE_BLOOM stuff and -wallet
+
+Marco Falke (20):
+      [trivial] Reuse translation and cleanup DEFAULT_* values
+      [qt] Move GUI related HelpMessage() part downstream
+      [trivial] init cleanup
+      [wallet] Refactor to use new MIN_CHANGE
+      [wallet] Add comments for doxygen
+      Init: Use DEFAULT_TRANSACTION_MINFEE in help message
+      [qt] Properly display required fee instead of minTxFee
+      Clarify what minrelaytxfee does
+      translations: Don't translate markdown or force English grammar
+      transaction_tests: Be more strict checking dust
+      [trivial] init: Use defaults MIN_RELAY_TX_FEE & TRANSACTION_MAXFEE
+      contrib: Del. gitian downloader config and update gitian README
+      rpcwallet: Clarify what settxfee does
+      HelpMessage: Don't hide -mintxfee behind showDebug
+      mempool: Replace maxFeeRate of 10000*minRelayTxFee with maxTxFee
+      [doxygen] Actually display comment
+      Fix doxygen comment for payTxFee
+      [doc] Fix markdown
+      Make sure LogPrintf strings are line-terminated
+      [wallet] Move hardcoded file name out of log messages
+
+Marshall Gaucher (3):
+      Update `import *` to unblock pyflakes from failing
+      Update z_sendmany calls passing int 0, instead of Decimal('0')
+      Update to stop random race error from assert
+
+Matt Corallo (10):
+      Also remove pay-2-pubkey from watch when adding a priv key
+      Split up importaddress into helper functions
+      Add p2sh option to importaddress to import redeemScripts
+      Add importpubkey method to import a watch-only pubkey
+      Update importaddress help to push its use to script-only
+      Add have-pubkey distinction to ISMINE flags
+      Add logic to track pubkeys as watch-only, not just scripts
+      Implement watchonly support in fundrawtransaction
+      SQUASH "Add have-pubkey distinction to ISMINE flags"
+      SQUASH "Implement watchonly support in fundrawtransaction"
+
+Peter Todd (3):
+      Make TX_SCRIPTHASH clear vSolutionsRet first
+      Add IsPushOnly(const_iterator pc)
+      Accept any sequence of PUSHDATAs in OP_RETURN outputs
+
+Pieter Wuille (9):
+      Remove template matching and pseudo opcodes
+      Stop treating importaddress'ed scripts as change
+      Make CScript -> CScriptID conversion explicit
+      Do not expose SigVersion argument to IsMine
+      Switch to a private version of SigVersion inside IsMine
+      Track difference between scriptPubKey and P2SH execution in IsMine
+      Do not treat bare multisig as IsMine
+      Mention removal of bare multisig IsMine in release notes
+      Use anonymous namespace instead of static functions
+
+Sean Bowe (2):
+      make-release.py: Versioning changes for 2.1.1-rc1.
+      make-release.py: Updated manpages for 2.1.1-rc1.
+
+Simon Liu (1):
+      Closes #3911. Fix help message of RPC getwalletinfo.
+
+Taylor Hornby (10):
+      Add AFL instrumentation scripts to zcutil.
+      Add configure option to replace main with a stub for fuzzing
+      Add all-in-one script for starting AFL fuzzing
+      Separate AFL build, run fuzz stages, and add afl argument pass-through
+      Have make clean delete fuzz.cpp
+      Pass AFL input file path to zcashd
+      Add fuzzing stub for AddrMan deserialization
+      Add fuzzing stub for ReadFeeEstimates
+      Add fuzzing stub for CheckBlock
+      Update proton from 0.26.0 to 0.30.0
+
+Ulrich Kempken (1):
+      depends: switch to secure download of all dependencies
+
+Wladimir J. van der Laan (7):
+      make proxy_test work on servers without ipv6
+      Fix argument parsing oddity with -noX
+      doc: mention change to option parsing behavior in release notes
+      test: move accounting_tests and rpc_wallet_tests to wallet/test
+      test: Create test fixture for wallet
+      wallet_ismine.h → script/ismine.h
+      test: Rename wallet.dat to wallet_test.dat
+
+sandakersmann (3):
+      Update of copyright year to 2020
+      Update COPYRIGHT_YEAR in clientversion.h to 2020
+      Update _COPYRIGHT_YEAR in configure.ac to 2020
+
+Jack Grigg (2):
+      Apply suggestions from code review
+      Apply suggestions from code review
+
+Benjamin Winston (1):
+      Added basic fuzzing to the monolith, see ticket #4155
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.1.1-rc2.md b/depend/zcash/doc/release-notes/release-notes-2.1.1-rc2.md
new file mode 100644
index 000000000..8d20d89d1
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.1.1-rc2.md
@@ -0,0 +1,298 @@
+Notable changes
+===============
+
+`z_mergetoaddress` promoted out of experimental status
+------------------------------------------------------
+
+The `z_mergetoaddress` API merges funds from t-addresses, z-addresses, or both,
+and sends them to a single t-address or z-address. It was added in v1.0.15 as an
+experimental feature, to simplify the process of combining many small UTXOs and
+notes into a few larger ones.
+
+In this release we are promoting `z_mergetoaddress` out of experimental status.
+It is now a stable RPC, and any future changes to it will only be additive. See
+`zcash-cli help z_mergetoaddress` for API details and usage.
+
+Unlike most other RPC methods, `z_mergetoaddress` operates over a particular
+quantity of UTXOs and notes, instead of a particular amount of ZEC. By default,
+it will merge 50 UTXOs and 10 notes at a time; these limits can be adjusted with
+the parameters `transparent_limit` and `shielded_limit`.
+
+`z_mergetoaddress` also returns the number of UTXOs and notes remaining in the
+given addresses, which can be used to automate the merging process (for example,
+merging until the number of UTXOs falls below some value).
+
+Option parsing behavior
+-----------------------
+
+Command line options are now parsed strictly in the order in which they are
+specified. It used to be the case that `-X -noX` ends up, unintuitively, with X
+set, as `-X` had precedence over `-noX`. This is no longer the case. Like for
+other software, the last specified value for an option will hold.
+
+Low-level RPC changes
+---------------------
+
+- Bare multisig outputs to our keys are no longer automatically treated as
+  incoming payments. As this feature was only available for multisig outputs for
+  which you had all private keys in your wallet, there was generally no use for
+  them compared to single-key schemes. Furthermore, no address format for such
+  outputs is defined, and wallet software can't easily send to it. These outputs
+  will no longer show up in `listtransactions`, `listunspent`, or contribute to
+  your balance, unless they are explicitly watched (using `importaddress` or
+  `importmulti` with hex script argument). `signrawtransaction*` also still
+  works for them.
+
+Changelog
+=========
+
+Alfredo Garcia (19):
+      remove duplicated prefix in errors and warnings
+      Consensus: Decouple pow.cpp from util.h
+      change some wallet functions from bool to void
+      limit blockchain progress to a max of 1.000000
+      remove z_mergetoaddress from experimental
+      add version to thank you string
+      add next upgrade info to metrics console
+      change target spacing to up to upgrade height
+      create and use SecondsLeftToHeight to display next upgrade info
+      add NextUpgrade test case
+      fix spacing
+      add after blossom test
+      change var and function names for clarity, refactor function
+      reverse conditional, replace get_value_or(0) calls
+      remove redundant line from test
+      remove zmergetoaddress from experimental state in rpc-tests
+      get UPGRADE_TESTDUMMY back to default at the end of the test
+      remove dead code in init
+      readd create_directories
+
+Ben Woosley (1):
+      Assert CPubKey::ValidLength to the pubkey's header-relevent size
+
+Carl Dong (1):
+      depends: tar: Always extract as yourself
+
+Casey Rodarmor (1):
+      Give a better error message if system clock is bad
+
+Charlie O'Keefe (1):
+      Add check-depends step to STAGE_COMMANDS list
+
+Cory Fields (3):
+      depends: qt/cctools: fix checksum checksum tests
+      depends: bump OSX toolchain
+      depends: make osx output deterministic
+
+Dagur Valberg Johannsson (1):
+      Remove option mempooltxinputlimit
+
+Daira Hopwood (1):
+      Remove temporary workaround for deprecation height.
+
+Denis Lukianov (1):
+      Correct importaddress help reference to importpubkey
+
+Dimitris Apostolou (4):
+      Fix typo
+      Remove stale comment
+      Change "protect" terminology to "shield"
+      depends macOS: hide linker visibility warnings
+
+Eirik Ogilvie-Wigley (2):
+      Show time elapsed when running RPC tests
+      Update team email
+
+Gavin Andresen (1):
+      Unit test doublespends in new blocks
+
+Gregory Maxwell (1):
+      Make connect=0 disable automatic outbound connections.
+
+Gregory Sanders (1):
+      Added additional config option for multiple RPC users.
+
+Ian T (1):
+      Update RPC generate help for numblocks to include required
+
+Jack Grigg (32):
+      Upgrade librustzcash to 0.2.0
+      Migrate to librustzcash 0.2.0 API
+      Remove invalid address comparison from gtest
+      Cast uint8* in InterruptibleRecv to char* for recv
+      Add Heartwood to upgrade list
+      Initialize experimental mode in a separate function
+      Fix benchmarks after removal of SelectParamsFromCommandLine()
+      Handle Equihash and optional miner code in TestChain100Setup
+      Add tests covering the current interaction of alerts with subver comments
+      Parameterize zcash.conf in init error message
+      cleanup: Comments
+      Wrap long line
+      Match alerts both with and without comments
+      pyflakes fixes
+      Revert "Remove insecurely-downloaded dependencies that we don't currently use."
+      depends: Compile bdb with --disable-atomics when cross-compiling darwin
+      depends: Add Rust targets for cross-compiling darwin
+      configure: Don't require RELRO and BIND_NOW when cross-compiling darwin
+      depends: Manually apply build_env to second half of googletest build
+      Revert "depends: Explicitly set Boost toolchain during configuration"
+      Add z_mergetoaddress to release notes
+      ThreadNotifyRecentlyAdded -> ThreadNotifyWallets
+      Move mempool tx notifying logic out of CTxMemPool
+      Merge tree and boolean fields in ChainTip API
+      Move block-notifying logic into ThreadNotifyWallets
+      Tie sync_blocks in RPC tests to notifier thread
+      Extend comment with reason for taking care with locks
+      test: Add sync_all points after block generation to RPC tests
+      test: Remove genesis-block Sapling activation from shorter_block_times
+      test: Reverse hashtx and hashblock ordering at start of ZMQ RPC test
+      test: Add missing sync_all point
+      test: Update wallet RPC test with change to "absurdly high fee" limit
+
+Jainan-Tandel (1):
+      Cosmetic update to README.md .
+
+Jim Posen (3):
+      Comments: More comments on functions/globals in standard.h.
+      [script] Unit tests for script/standard functions
+      [script] Unit tests for IsMine
+
+Jonas Schnelli (9):
+      [autoprune] allow wallet in pruned mode
+      [RPC] disable import functions in pruned mode
+      [squashme] improve/corrects prune mode detection test for required wallet rescans
+      Refactor parameter interaction, call it before AppInit2()
+      Initialize logging before we do parameter interaction
+      [Wallet] move wallet help string creation to CWallet
+      [Wallet] move "load wallet phase" to CWallet
+      [Wallet] optimize return value of InitLoadWallet()
+      [Wallet] refactor wallet/init interaction
+
+Jorge Timón (4):
+      Chainparams: Replace CBaseChainParams::Network enum with string constants (suggested by Wladimir)
+      Chainparams: Translations: DRY: options and error strings
+      Globals: Decouple GetConfigFile and ReadConfigFile from global mapArgs
+      Policy: MOVEONLY: Create policy/policy.h with some constants
+
+Larry Ruane (5):
+      simplify locking, merge cs_SpendingKeyStore into cs_KeyStore
+      eliminate races: hold cs_KeyStore lock while reading fUseCrypto
+      revert CCryptoKeyStore::SetCrypted() return value
+      insightexplorer: LOCK(cs_main) during rpcs
+      fix tests for enable-debug build
+
+Luke Dashjr (8):
+      Bugfix: RPC: blockchain: Display correct defaults in help for verifychain method
+      Bugfix: Describe dblogsize option correctly (it refers to the wallet database, not memory pool)
+      Bugfix: If genproclimit is omitted to RPC setgenerate, don't change it; also show correct default in getmininginfo
+      Bugfix: Omit wallet-related options from -help when wallet is disabled
+      Constrain constant values to a single location in code
+      Bugfix: Omit wallet-related options from -help when wallet is not supported
+      Policy: MOVEONLY: 3 functions to policy.o:
+      Common argument defaults for NODE_BLOOM stuff and -wallet
+
+Marco Falke (20):
+      [trivial] Reuse translation and cleanup DEFAULT_* values
+      [qt] Move GUI related HelpMessage() part downstream
+      [trivial] init cleanup
+      [wallet] Refactor to use new MIN_CHANGE
+      [wallet] Add comments for doxygen
+      Init: Use DEFAULT_TRANSACTION_MINFEE in help message
+      [qt] Properly display required fee instead of minTxFee
+      Clarify what minrelaytxfee does
+      translations: Don't translate markdown or force English grammar
+      transaction_tests: Be more strict checking dust
+      [trivial] init: Use defaults MIN_RELAY_TX_FEE & TRANSACTION_MAXFEE
+      contrib: Del. gitian downloader config and update gitian README
+      rpcwallet: Clarify what settxfee does
+      HelpMessage: Don't hide -mintxfee behind showDebug
+      mempool: Replace maxFeeRate of 10000*minRelayTxFee with maxTxFee
+      [doxygen] Actually display comment
+      Fix doxygen comment for payTxFee
+      [doc] Fix markdown
+      Make sure LogPrintf strings are line-terminated
+      [wallet] Move hardcoded file name out of log messages
+
+Marshall Gaucher (3):
+      Update `import *` to unblock pyflakes from failing
+      Update z_sendmany calls passing int 0, instead of Decimal('0')
+      Update to stop random race error from assert
+
+Matt Corallo (10):
+      Also remove pay-2-pubkey from watch when adding a priv key
+      Split up importaddress into helper functions
+      Add p2sh option to importaddress to import redeemScripts
+      Add importpubkey method to import a watch-only pubkey
+      Update importaddress help to push its use to script-only
+      Add have-pubkey distinction to ISMINE flags
+      Add logic to track pubkeys as watch-only, not just scripts
+      Implement watchonly support in fundrawtransaction
+      SQUASH "Add have-pubkey distinction to ISMINE flags"
+      SQUASH "Implement watchonly support in fundrawtransaction"
+
+Miles Manley (1):
+      Update libsodium download-path
+
+Peter Todd (3):
+      Make TX_SCRIPTHASH clear vSolutionsRet first
+      Add IsPushOnly(const_iterator pc)
+      Accept any sequence of PUSHDATAs in OP_RETURN outputs
+
+Pieter Wuille (9):
+      Remove template matching and pseudo opcodes
+      Stop treating importaddress'ed scripts as change
+      Make CScript -> CScriptID conversion explicit
+      Do not expose SigVersion argument to IsMine
+      Switch to a private version of SigVersion inside IsMine
+      Track difference between scriptPubKey and P2SH execution in IsMine
+      Do not treat bare multisig as IsMine
+      Mention removal of bare multisig IsMine in release notes
+      Use anonymous namespace instead of static functions
+
+Sean Bowe (5):
+      make-release.py: Versioning changes for 2.1.1-rc1.
+      make-release.py: Updated manpages for 2.1.1-rc1.
+      make-release.py: Updated release notes and changelog for 2.1.1-rc1.
+      make-release.py: Versioning changes for 2.1.1-rc2.
+      make-release.py: Updated manpages for 2.1.1-rc2.
+
+Simon Liu (1):
+      Closes #3911. Fix help message of RPC getwalletinfo.
+
+Taylor Hornby (11):
+      Add AFL instrumentation scripts to zcutil.
+      Add configure option to replace main with a stub for fuzzing
+      Add all-in-one script for starting AFL fuzzing
+      Separate AFL build, run fuzz stages, and add afl argument pass-through
+      Have make clean delete fuzz.cpp
+      Pass AFL input file path to zcashd
+      Add fuzzing stub for AddrMan deserialization
+      Add fuzzing stub for ReadFeeEstimates
+      Add fuzzing stub for CheckBlock
+      Update proton from 0.26.0 to 0.30.0
+      Fix broken proton build
+
+Ulrich Kempken (1):
+      depends: switch to secure download of all dependencies
+
+Wladimir J. van der Laan (7):
+      make proxy_test work on servers without ipv6
+      Fix argument parsing oddity with -noX
+      doc: mention change to option parsing behavior in release notes
+      test: move accounting_tests and rpc_wallet_tests to wallet/test
+      test: Create test fixture for wallet
+      wallet_ismine.h → script/ismine.h
+      test: Rename wallet.dat to wallet_test.dat
+
+sandakersmann (3):
+      Update of copyright year to 2020
+      Update COPYRIGHT_YEAR in clientversion.h to 2020
+      Update _COPYRIGHT_YEAR in configure.ac to 2020
+
+Jack Grigg (2):
+      Apply suggestions from code review
+      Apply suggestions from code review
+
+Benjamin Winston (1):
+      Added basic fuzzing to the monolith, see ticket #4155
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.1.1.md b/depend/zcash/doc/release-notes/release-notes-2.1.1.md
new file mode 100644
index 000000000..a51e29399
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.1.1.md
@@ -0,0 +1,301 @@
+Notable changes
+===============
+
+`z_mergetoaddress` promoted out of experimental status
+------------------------------------------------------
+
+The `z_mergetoaddress` API merges funds from t-addresses, z-addresses, or both,
+and sends them to a single t-address or z-address. It was added in v1.0.15 as an
+experimental feature, to simplify the process of combining many small UTXOs and
+notes into a few larger ones.
+
+In this release we are promoting `z_mergetoaddress` out of experimental status.
+It is now a stable RPC, and any future changes to it will only be additive. See
+`zcash-cli help z_mergetoaddress` for API details and usage.
+
+Unlike most other RPC methods, `z_mergetoaddress` operates over a particular
+quantity of UTXOs and notes, instead of a particular amount of ZEC. By default,
+it will merge 50 UTXOs and 10 notes at a time; these limits can be adjusted with
+the parameters `transparent_limit` and `shielded_limit`.
+
+`z_mergetoaddress` also returns the number of UTXOs and notes remaining in the
+given addresses, which can be used to automate the merging process (for example,
+merging until the number of UTXOs falls below some value).
+
+Option parsing behavior
+-----------------------
+
+Command line options are now parsed strictly in the order in which they are
+specified. It used to be the case that `-X -noX` ends up, unintuitively, with X
+set, as `-X` had precedence over `-noX`. This is no longer the case. Like for
+other software, the last specified value for an option will hold.
+
+Low-level RPC changes
+---------------------
+
+- Bare multisig outputs to our keys are no longer automatically treated as
+  incoming payments. As this feature was only available for multisig outputs for
+  which you had all private keys in your wallet, there was generally no use for
+  them compared to single-key schemes. Furthermore, no address format for such
+  outputs is defined, and wallet software can't easily send to it. These outputs
+  will no longer show up in `listtransactions`, `listunspent`, or contribute to
+  your balance, unless they are explicitly watched (using `importaddress` or
+  `importmulti` with hex script argument). `signrawtransaction*` also still
+  works for them.
+
+Changelog
+=========
+
+Alfredo Garcia (19):
+      remove duplicated prefix in errors and warnings
+      Consensus: Decouple pow.cpp from util.h
+      change some wallet functions from bool to void
+      limit blockchain progress to a max of 1.000000
+      remove z_mergetoaddress from experimental
+      add version to thank you string
+      add next upgrade info to metrics console
+      change target spacing to up to upgrade height
+      create and use SecondsLeftToHeight to display next upgrade info
+      add NextUpgrade test case
+      fix spacing
+      add after blossom test
+      change var and function names for clarity, refactor function
+      reverse conditional, replace get_value_or(0) calls
+      remove redundant line from test
+      remove zmergetoaddress from experimental state in rpc-tests
+      get UPGRADE_TESTDUMMY back to default at the end of the test
+      remove dead code in init
+      readd create_directories
+
+Ben Woosley (1):
+      Assert CPubKey::ValidLength to the pubkey's header-relevent size
+
+Carl Dong (1):
+      depends: tar: Always extract as yourself
+
+Casey Rodarmor (1):
+      Give a better error message if system clock is bad
+
+Charlie O'Keefe (1):
+      Add check-depends step to STAGE_COMMANDS list
+
+Cory Fields (3):
+      depends: qt/cctools: fix checksum checksum tests
+      depends: bump OSX toolchain
+      depends: make osx output deterministic
+
+Dagur Valberg Johannsson (1):
+      Remove option mempooltxinputlimit
+
+Daira Hopwood (1):
+      Remove temporary workaround for deprecation height.
+
+Denis Lukianov (1):
+      Correct importaddress help reference to importpubkey
+
+Dimitris Apostolou (4):
+      Fix typo
+      Remove stale comment
+      Change "protect" terminology to "shield"
+      depends macOS: hide linker visibility warnings
+
+Eirik Ogilvie-Wigley (2):
+      Show time elapsed when running RPC tests
+      Update team email
+
+Gavin Andresen (1):
+      Unit test doublespends in new blocks
+
+Gregory Maxwell (1):
+      Make connect=0 disable automatic outbound connections.
+
+Gregory Sanders (1):
+      Added additional config option for multiple RPC users.
+
+Ian T (1):
+      Update RPC generate help for numblocks to include required
+
+Jack Grigg (32):
+      Upgrade librustzcash to 0.2.0
+      Migrate to librustzcash 0.2.0 API
+      Remove invalid address comparison from gtest
+      Cast uint8* in InterruptibleRecv to char* for recv
+      Add Heartwood to upgrade list
+      Initialize experimental mode in a separate function
+      Fix benchmarks after removal of SelectParamsFromCommandLine()
+      Handle Equihash and optional miner code in TestChain100Setup
+      Add tests covering the current interaction of alerts with subver comments
+      Parameterize zcash.conf in init error message
+      cleanup: Comments
+      Wrap long line
+      Match alerts both with and without comments
+      pyflakes fixes
+      Revert "Remove insecurely-downloaded dependencies that we don't currently use."
+      depends: Compile bdb with --disable-atomics when cross-compiling darwin
+      depends: Add Rust targets for cross-compiling darwin
+      configure: Don't require RELRO and BIND_NOW when cross-compiling darwin
+      depends: Manually apply build_env to second half of googletest build
+      Revert "depends: Explicitly set Boost toolchain during configuration"
+      Add z_mergetoaddress to release notes
+      ThreadNotifyRecentlyAdded -> ThreadNotifyWallets
+      Move mempool tx notifying logic out of CTxMemPool
+      Merge tree and boolean fields in ChainTip API
+      Move block-notifying logic into ThreadNotifyWallets
+      Tie sync_blocks in RPC tests to notifier thread
+      Extend comment with reason for taking care with locks
+      test: Add sync_all points after block generation to RPC tests
+      test: Remove genesis-block Sapling activation from shorter_block_times
+      test: Reverse hashtx and hashblock ordering at start of ZMQ RPC test
+      test: Add missing sync_all point
+      test: Update wallet RPC test with change to "absurdly high fee" limit
+
+Jainan-Tandel (1):
+      Cosmetic update to README.md .
+
+Jim Posen (3):
+      Comments: More comments on functions/globals in standard.h.
+      [script] Unit tests for script/standard functions
+      [script] Unit tests for IsMine
+
+Jonas Schnelli (9):
+      [autoprune] allow wallet in pruned mode
+      [RPC] disable import functions in pruned mode
+      [squashme] improve/corrects prune mode detection test for required wallet rescans
+      Refactor parameter interaction, call it before AppInit2()
+      Initialize logging before we do parameter interaction
+      [Wallet] move wallet help string creation to CWallet
+      [Wallet] move "load wallet phase" to CWallet
+      [Wallet] optimize return value of InitLoadWallet()
+      [Wallet] refactor wallet/init interaction
+
+Jorge Timón (4):
+      Chainparams: Replace CBaseChainParams::Network enum with string constants (suggested by Wladimir)
+      Chainparams: Translations: DRY: options and error strings
+      Globals: Decouple GetConfigFile and ReadConfigFile from global mapArgs
+      Policy: MOVEONLY: Create policy/policy.h with some constants
+
+Larry Ruane (5):
+      simplify locking, merge cs_SpendingKeyStore into cs_KeyStore
+      eliminate races: hold cs_KeyStore lock while reading fUseCrypto
+      revert CCryptoKeyStore::SetCrypted() return value
+      insightexplorer: LOCK(cs_main) during rpcs
+      fix tests for enable-debug build
+
+Luke Dashjr (8):
+      Bugfix: RPC: blockchain: Display correct defaults in help for verifychain method
+      Bugfix: Describe dblogsize option correctly (it refers to the wallet database, not memory pool)
+      Bugfix: If genproclimit is omitted to RPC setgenerate, don't change it; also show correct default in getmininginfo
+      Bugfix: Omit wallet-related options from -help when wallet is disabled
+      Constrain constant values to a single location in code
+      Bugfix: Omit wallet-related options from -help when wallet is not supported
+      Policy: MOVEONLY: 3 functions to policy.o:
+      Common argument defaults for NODE_BLOOM stuff and -wallet
+
+Marco Falke (20):
+      [trivial] Reuse translation and cleanup DEFAULT_* values
+      [qt] Move GUI related HelpMessage() part downstream
+      [trivial] init cleanup
+      [wallet] Refactor to use new MIN_CHANGE
+      [wallet] Add comments for doxygen
+      Init: Use DEFAULT_TRANSACTION_MINFEE in help message
+      [qt] Properly display required fee instead of minTxFee
+      Clarify what minrelaytxfee does
+      translations: Don't translate markdown or force English grammar
+      transaction_tests: Be more strict checking dust
+      [trivial] init: Use defaults MIN_RELAY_TX_FEE & TRANSACTION_MAXFEE
+      contrib: Del. gitian downloader config and update gitian README
+      rpcwallet: Clarify what settxfee does
+      HelpMessage: Don't hide -mintxfee behind showDebug
+      mempool: Replace maxFeeRate of 10000*minRelayTxFee with maxTxFee
+      [doxygen] Actually display comment
+      Fix doxygen comment for payTxFee
+      [doc] Fix markdown
+      Make sure LogPrintf strings are line-terminated
+      [wallet] Move hardcoded file name out of log messages
+
+Marshall Gaucher (3):
+      Update `import *` to unblock pyflakes from failing
+      Update z_sendmany calls passing int 0, instead of Decimal('0')
+      Update to stop random race error from assert
+
+Matt Corallo (10):
+      Also remove pay-2-pubkey from watch when adding a priv key
+      Split up importaddress into helper functions
+      Add p2sh option to importaddress to import redeemScripts
+      Add importpubkey method to import a watch-only pubkey
+      Update importaddress help to push its use to script-only
+      Add have-pubkey distinction to ISMINE flags
+      Add logic to track pubkeys as watch-only, not just scripts
+      Implement watchonly support in fundrawtransaction
+      SQUASH "Add have-pubkey distinction to ISMINE flags"
+      SQUASH "Implement watchonly support in fundrawtransaction"
+
+Miles Manley (1):
+      Update libsodium download-path
+
+Peter Todd (3):
+      Make TX_SCRIPTHASH clear vSolutionsRet first
+      Add IsPushOnly(const_iterator pc)
+      Accept any sequence of PUSHDATAs in OP_RETURN outputs
+
+Pieter Wuille (9):
+      Remove template matching and pseudo opcodes
+      Stop treating importaddress'ed scripts as change
+      Make CScript -> CScriptID conversion explicit
+      Do not expose SigVersion argument to IsMine
+      Switch to a private version of SigVersion inside IsMine
+      Track difference between scriptPubKey and P2SH execution in IsMine
+      Do not treat bare multisig as IsMine
+      Mention removal of bare multisig IsMine in release notes
+      Use anonymous namespace instead of static functions
+
+Sean Bowe (8):
+      make-release.py: Versioning changes for 2.1.1-rc1.
+      make-release.py: Updated manpages for 2.1.1-rc1.
+      make-release.py: Updated release notes and changelog for 2.1.1-rc1.
+      make-release.py: Versioning changes for 2.1.1-rc2.
+      make-release.py: Updated manpages for 2.1.1-rc2.
+      make-release.py: Updated release notes and changelog for 2.1.1-rc2.
+      make-release.py: Versioning changes for 2.1.1.
+      make-release.py: Updated manpages for 2.1.1.
+
+Simon Liu (1):
+      Closes #3911. Fix help message of RPC getwalletinfo.
+
+Taylor Hornby (11):
+      Add AFL instrumentation scripts to zcutil.
+      Add configure option to replace main with a stub for fuzzing
+      Add all-in-one script for starting AFL fuzzing
+      Separate AFL build, run fuzz stages, and add afl argument pass-through
+      Have make clean delete fuzz.cpp
+      Pass AFL input file path to zcashd
+      Add fuzzing stub for AddrMan deserialization
+      Add fuzzing stub for ReadFeeEstimates
+      Add fuzzing stub for CheckBlock
+      Update proton from 0.26.0 to 0.30.0
+      Fix broken proton build
+
+Ulrich Kempken (1):
+      depends: switch to secure download of all dependencies
+
+Wladimir J. van der Laan (7):
+      make proxy_test work on servers without ipv6
+      Fix argument parsing oddity with -noX
+      doc: mention change to option parsing behavior in release notes
+      test: move accounting_tests and rpc_wallet_tests to wallet/test
+      test: Create test fixture for wallet
+      wallet_ismine.h → script/ismine.h
+      test: Rename wallet.dat to wallet_test.dat
+
+sandakersmann (3):
+      Update of copyright year to 2020
+      Update COPYRIGHT_YEAR in clientversion.h to 2020
+      Update _COPYRIGHT_YEAR in configure.ac to 2020
+
+Jack Grigg (2):
+      Apply suggestions from code review
+      Apply suggestions from code review
+
+Benjamin Winston (1):
+      Added basic fuzzing to the monolith, see ticket #4155
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.1.2-1.md b/depend/zcash/doc/release-notes/release-notes-2.1.2-1.md
new file mode 100644
index 000000000..02c101ea2
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.1.2-1.md
@@ -0,0 +1,17 @@
+Notable changes
+===============
+
+This release solves an issue where nodes that did not follow the Heartwood activation on testnet (by running a version prior to v2.1.2) but then upgraded to v2.1.2 or later would be incapable of rolling back and following the Heartwood activation without performing a reindex operation.
+
+Changelog
+=========
+
+Jack Grigg (1):
+      txdb/chain: Restrict Heartwood chain consistency check to block index objects that were created by Heartwood-unaware clients.
+
+Sean Bowe (4):
+      Add the intended testnet activation block of Heartwood to our intended rewind logic.
+      Don't throw exception in PopHistoryNode when popping from empty tree.
+      make-release.py: Versioning changes for 2.1.2-1.
+      make-release.py: Updated manpages for 2.1.2-1.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.1.2-2.md b/depend/zcash/doc/release-notes/release-notes-2.1.2-2.md
new file mode 100644
index 000000000..0f2871cce
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.1.2-2.md
@@ -0,0 +1,18 @@
+Notable changes
+===============
+
+This release fixes an issue that was identified by the Heartwood activation on testnet. v2.1.2 nodes that followed the Heartwood activation on testnet would crash on restart if, prior to shutdown, they had received a block from a miner that had not activated Heartwood, which is very likely. This release fixes that crash.
+
+Changelog
+=========
+
+Daira Hopwood (1):
+      txdb: log additional debug information.
+
+Jack Grigg (1):
+      txdb: More complete fix for the Heartwood chain consistency check issue.
+
+Sean Bowe (2):
+      make-release.py: Versioning changes for 2.1.2-2.
+      make-release.py: Updated manpages for 2.1.2-2.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.1.2-3.md b/depend/zcash/doc/release-notes/release-notes-2.1.2-3.md
new file mode 100644
index 000000000..02c66637e
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.1.2-3.md
@@ -0,0 +1,12 @@
+Notable changes
+===============
+
+This release sets the EOS halt date to roughly July 14th, which was our original intention.
+
+Changelog
+=========
+
+Sean Bowe (2):
+      make-release.py: Versioning changes for 2.1.2-3.
+      make-release.py: Updated manpages for 2.1.2-3.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.1.2-rc1.md b/depend/zcash/doc/release-notes/release-notes-2.1.2-rc1.md
new file mode 100644
index 000000000..328aaea07
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.1.2-rc1.md
@@ -0,0 +1,615 @@
+Notable changes
+===============
+
+Network Upgrade 3: Heartwood
+----------------------------
+
+The code preparations for the Heartwood network upgrade are finished and
+included in this release. The following ZIPs are being deployed:
+
+- [ZIP 213: Shielded Coinbase](https://zips.z.cash/zip-0213)
+- [ZIP 221: FlyClient - Consensus-Layer Changes](https://zips.z.cash/zip-0221)
+
+Heartwood will activate on testnet at height XXXXXX, and can also be activated
+at a specific height in regtest mode by setting the config option
+`-nuparams=f5b9230b:HEIGHT`.
+
+As a reminder, because the Heartwood activation height is not yet specified for
+mainnet, version 2.1.2 will behave similarly as other pre-Heartwood releases
+even after a future activation of Heartwood on the network. Upgrading from 2.1.2
+will be required in order to follow the Heartwood network upgrade on mainnet.
+
+See [ZIP 250](https://zips.z.cash/zip-0250) for additional information about the
+deployment process for Heartwood.
+
+### Mining to Sapling addresses
+
+Miners and mining pools that wish to test the new "shielded coinbase" support on
+the Heartwood testnet can generate a new Sapling address with `z_getnewaddress`,
+add the config option `mineraddress=SAPLING_ADDRESS` to their `zcash.conf` file,
+and then restart their `zcashd` node. `getblocktemplate` will then return
+coinbase transactions containing a shielded miner output.
+
+Note that `mineraddress` should only be set to a Sapling address after the
+Heartwood network upgrade has activated; setting a Sapling address prior to
+Heartwood activation will cause `getblocktemplate` to return block templates
+that cannot be mined.
+
+Sapling viewing keys support
+----------------------------
+
+Support for Sapling viewing keys (specifically, Sapling extended full viewing
+keys, as described in [ZIP 32](https://zips.z.cash/zip-0032)), has been added to
+the wallet. Nodes will track both sent and received transactions for any Sapling
+addresses associated with the imported Sapling viewing keys.
+
+- Use the `z_exportviewingkey` RPC method to obtain the viewing key for a
+  shielded address in a node's wallet. For Sapling addresses, these always begin
+  with "zxviews" (or "zxviewtestsapling" for testnet addresses).
+
+- Use `z_importviewingkey` to import a viewing key into another node.  Imported
+  Sapling viewing keys will be stored in the wallet, and remembered across
+  restarts.
+
+- `z_getbalance` will show the balance of a Sapling address associated with an
+  imported Sapling viewing key. Balances for Sapling viewing keys will be
+  included in the output of `z_gettotalbalance` when the `includeWatchonly`
+  parameter is set to `true`.
+
+- RPC methods for viewing shielded transaction information (such as
+  `z_listreceivedbyaddress`) will return information for Sapling addresses
+  associated with imported Sapling viewing keys.
+
+Details about what information can be viewed with these Sapling viewing keys,
+and what guarantees you have about that information, can be found in
+[ZIP 310](https://zips.z.cash/zip-0310).
+
+Removal of time adjustment and the -maxtimeadjustment= option
+-------------------------------------------------------------
+
+Prior to v2.1.1-1, `zcashd` would adjust the local time that it used by up
+to 70 minutes, according to a median of the times sent by the first 200 peers
+to connect to it. This mechanism was inherently insecure, since an adversary
+making multiple connections to the node could effectively control its time
+within that +/- 70 minute window (this is called a "timejacking attack").
+
+In the v2.1.1-1 security release, in addition to other mitigations for
+timejacking attacks, the maximum time adjustment was set to zero by default.
+This effectively disabled time adjustment; however, a `-maxtimeadjustment=`
+option was provided to override this default.
+
+As a simplification the time adjustment code has now been completely removed,
+together with `-maxtimeadjustment=`. Node operators should instead ensure that
+their local time is set reasonably accurately.
+
+If it appears that the node has a significantly different time than its peers,
+a warning will still be logged and indicated on the metrics screen if enabled.
+
+View shielded information in wallet transactions
+------------------------------------------------
+
+In previous `zcashd` versions, to obtain information about shielded transactions
+you would use either the `z_listreceivedbyaddress` RPC method (which returns all
+notes received by an address) or `z_listunspent` (which returns unspent notes,
+optionally filtered by addresses). There were no RPC methods that directly
+returned details about spends, or anything equivalent to the `gettransaction`
+method (which returns transparent information about in-wallet transactions).
+
+This release introduces a new RPC method `z_viewtransaction` to fill that gap.
+Given the ID of a transaction in the wallet, it decrypts the transaction and
+returns detailed shielded information for all decryptable new and spent notes,
+including:
+
+- The address that each note belongs to.
+- Values in both decimal ZEC and zatoshis.
+- The ID of the transaction that each spent note was received in.
+- An `outgoing` flag on each new note, which will be `true` if the output is not
+  for an address in the wallet.
+- A `memoStr` field for each new note, containing its text memo (if its memo
+  field contains a valid UTF-8 string).
+
+Information will be shown for any address that appears in `z_listaddresses`;
+this includes watch-only addresses linked to viewing keys imported with
+`z_importviewingkey`, as well as addresses with spending keys (both generated
+with `z_getnewaddress` and imported with `z_importkey`).
+
+Better error messages for rejected transactions after network upgrades
+----------------------------------------------------------------------
+
+The Zcash network upgrade process includes several features designed to protect
+users. One of these is the "consensus branch ID", which prevents transactions
+created after a network upgrade has activated from being replayed on another
+chain (that might have occurred due to, for example, a
+[friendly fork](https://electriccoin.co/blog/future-friendly-fork/)). This is
+known as "two-way replay protection", and is a core requirement by
+[various](https://blog.bitgo.com/bitgos-approach-to-handling-a-hard-fork-71e572506d7d?gi=3b80c02e027e)
+[members](https://trezor.io/support/general/hard-forks/) of the cryptocurrency
+ecosystem for supporting "hard fork"-style changes like our network upgrades.
+
+One downside of the way replay protection is implemented in Zcash, is that there
+is no visible difference between a transaction being rejected by a `zcashd` node
+due to targeting a different branch, and being rejected due to an invalid
+signature. This has caused issues in the past when a user had not upgraded their
+wallet software, or when a wallet lacked support for the new network upgrade's
+consensus branch ID; the resulting error messages when users tried to create
+transactions were non-intuitive, and particularly cryptic for transparent
+transactions.
+
+Starting from this release, `zcashd` nodes will re-verify invalid transparent
+and Sprout signatures against the consensus branch ID from before the most
+recent network upgrade. If the signature then becomes valid, the transaction
+will be rejected with the error message `old-consensus-branch-id`. This error
+can be handled specifically by wallet providers to inform the user that they
+need to upgrade their wallet software.
+
+Wallet software can also automatically obtain the latest consensus branch ID
+from their (up-to-date) `zcashd` node, by calling `getblockchaininfo` and
+looking at `{'consensus': {'nextblock': BRANCH_ID, ...}, ...}` in the JSON
+output.
+
+Expired transactions notifications
+----------------------------------
+
+A new config option `-txexpirynotify` has been added that will cause `zcashd` to
+execute a command when a transaction in the mempool expires. This can be used to
+notify external systems about transaction expiry, similar to the existing
+`-blocknotify` config option that notifies when the chain tip changes.
+
+RPC methods
+-----------
+
+- The `z_importkey` and `z_importviewingkey` RPC methods now return the type of
+  the imported spending or viewing key (`sprout` or `sapling`), and the
+  corresponding payment address.
+
+- Negative heights are now permitted in `getblock` and `getblockhash`, to select
+  blocks backwards from the chain tip. A height of `-1` corresponds to the last
+  known valid block on the main chain.
+
+- A new RPC method `getexperimentalfeatures` returns the list of enabled
+  experimental features.
+
+Build system
+------------
+
+- The `--enable-lcov`, `--disable-tests`, and `--disable-mining` flags for
+  `zcutil/build.sh` have been removed. You can pass these flags instead by using
+  the `CONFIGURE_FLAGS` environment variable. For example, to enable coverage
+  instrumentation (thus enabling "make cov" to work), call:
+
+  ```
+  CONFIGURE_FLAGS="--enable-lcov --disable-hardening" ./zcutil/build.sh
+  ```
+
+- The build system no longer defaults to verbose output. You can re-enable
+  verbose output with `./zcutil/build.sh V=1`
+
+Changelog
+=========
+
+Alfredo Garcia (40):
+      remove SignatureHash from python rpc tests
+      add negative height to getblock
+      allow negative index to getblockhash
+      update docs
+      add additional tests to rpc_wallet_z_getnewaddress
+      change convention
+      change regex
+      Return address and type of imported key in z_importkey
+      Delete travis file
+      dedup decode keys and addresses
+      remove unused imports
+      add txexpirynotify
+      fix rpx_wallet_tests
+      remove debug noise from 2 gtests
+      make type and size a pair in DecodeAny arguments
+      add missing calls to DecodeAny
+      add destination wrappers
+      change tuples to classes
+      change cm() to cmu() in SaplingNote class
+      change the cm member of OutputDescription to cmu
+      change maybe_cm to maybe_cmu
+      add getexperimentalfeatures rpc call
+      refactor experimental features
+      make fInsightExplorer a local
+      add check_node_log utility function
+      remove space after new line
+      move check_node_log framework test to a new file
+      use check_node_log in turnstile.py
+      add stop_node argument to check_node_log, use it in shieldingcoinbase
+      change constructors
+      minor comment fix
+      preserve test semantics
+      remove unused import
+      multiple debug categories documentation
+      return address info in z_importviewingkey
+      add expected address check to tests
+      change unclear wording in z_import calls address returned
+      Lock with cs_main inside gtests that call chainActive.Height()
+      add -lightwalletd experimental option
+      compute more structures in mempool DynamicMemoryUsage
+
+Carl Dong (1):
+      autoconf: Sane --enable-debug defaults.
+
+Chun Kuan Lee (1):
+      Reset default -g -O2 flags when enable debug
+
+Cory Fields (3):
+      bench: switch to std::chrono for time measurements
+      bench: prefer a steady clock if the resolution is no worse
+      build: Split hardening/fPIE options out
+
+Dagur Valberg Johannsson (1):
+      Improve z_getnewaddress tests
+
+Daira Hopwood (24):
+      Add missing cases for Blossom in ContextualCheckBlock tests.
+      Revert "Add -maxtimeadjustment with default of 0 instead of the 4200 seconds used in Bitcoin Core."
+      Remove uses of GetTimeOffset().
+      Replace time adjustment with warning only.
+      Update GetAdjustedTime() to GetTime().
+      Sort entries in zcash_gtest_SOURCES (other than test_tautology which is deliberately first).
+      Add release notes for removal of -maxtimeadjustment.
+      Resolve a race condition on `chainActive.Tip()` in initialization (introduced in #4379).
+      Setting a std::atomic variable in a signal handler only has defined behaviour if it is lock-free.
+      Add comment to `MilliSleep` documenting that it is an interruption point.
+      Exit init early if we request shutdown before having loaded the genesis block.
+      Fix typos/minor errors in comments, and wrap some lines.
+      Avoid a theoretical possibility of division-by-zero introduced in #4368.
+      Make the memo a mandatory argument for SendManyRecipient
+      Add a `zcutil/clean.sh` script that works (unlike `make clean`).
+      Split into clean.sh and distclean.sh.
+      Minor refactoring.
+      Executables end with .exe on Windows.
+      Avoid spurious error messages when cleaning up directories.
+      Address review comments.
+      Use `SA_RESTART` in `sa_flags` when setting up signal handlers.
+      Remove a redundant `rm -f` command.
+      Refer to altitude instead of height for history tree peaks
+      Address review comments: `target` and `depends/work` should be cleaned by clean.sh.
+
+Dimitris Apostolou (8):
+      Fix Boost compilation on macOS
+      Remove libsnark preprocessor flags
+      Fix typo
+      End diff with LF character
+      Remove stale comment
+      Point at support community on Discord
+      Update documentation info
+      Fix typos
+
+Eirik Ogilvie-Wigley (2):
+      Include shielded transaction data when calculating RecursiveDynamicUsage of transactions
+      Account for malloc overhead
+
+Evan Klitzke (2):
+      Add --with-sanitizers option to configure
+      Make --enable-debug to pick better options
+
+Gavin Andresen (2):
+      Simple benchmarking framework
+      Support very-fast-running benchmarks
+
+Gregory Maxwell (4):
+      Avoid integer division in the benchmark inner-most loop.
+      Move GetWarnings and related globals to util.
+      Eliminate data races for strMiscWarning and fLargeWork*Found.
+      Move GetWarnings() into its own file.
+
+Jack Grigg (94):
+      Revert "Add configure flags for enabling ASan/UBSan and TSan"
+      configure: Re-introduce additional sanitizer flags
+      RPC: z_viewtransaction
+      depends: Add utfcpp to dependencies
+      RPC: Display valid UTF-8 memos in z_viewtransaction
+      RPC: Use OutgoingViewingKeys to recover non-wallet Sapling outputs
+      test: Check z_viewtransaction output in wallet_listreceived RPC test
+      Benchmark Zcash verification operations
+      Simulate worst-case block verification
+      zcutil/build.sh: Remove lcov and mining flags
+      configure: Change default Proton to match build.sh
+      zcutil/build.sh: Turn off verbosity by default
+      Make -fwrapv conditional on --enable-debug=no
+      Move default -g flag into configure.ac behind --enable-debug=no
+      Add build system changes to release notes
+      test: Hard-code hex memo in wallet_listreceived for Python3 compatibility
+      test: Fix pyflakes warnings
+      bench: "Use" result of crypto_sign_verify_detached
+      Add test vectors for small-order Ed25519 pubkeys
+      Patch libsodium 1.0.15 pubkey validation onto 1.0.18
+      Patch libsodium 1.0.15 signature validation onto 1.0.18
+      Add release notes for z_viewtransaction
+      Deduplicate some wallet keystore logic
+      Move Sprout and Sapling address logic into separate files
+      Move ZIP 32 classes inside zcash/Address.hpp
+      SaplingFullViewingKey -> SaplingExtendedFullViewingKey in keystore maps
+      Remove default address parameter from Sapling keystore methods
+      test: Add test for CBasicKeyStore::AddSaplingFullViewingKey
+      Add encoding and decoding for Sapling extended full viewing keys
+      Add Sapling ExtFVK support to z_exportviewingkey
+      Add in-memory Sapling ExtFVK support to z_importviewingkey
+      Store imported Sapling ExtFVKs in wallet database
+      OutputDescriptionInfo::Build()
+      ZIP 213 consensus rules
+      Add support for Sapling addresses in -mineraddress
+      wallet: Include coinbase txs in Sapling note selection
+      Add regtest-only -nurejectoldversions option
+      test: Minor tweaks to comments in LibsodiumPubkeyValidation
+      test: RPC test for shielded coinbase
+      Adjust comments on ZIP 213 logic
+      Use DoS level constants and parameters for ZIP 213 rejections
+      test: Check that shielded coinbase can be spent to a t-address
+      init: Inform on error that -mineraddress must be Sapling or transparent
+      test: Explicitly check Sapling consensus rules apply to shielded coinbase
+      Migrate GitHub issue template to new format
+      Add GitHub issue templates for feature requests and UX reports
+      depends: Remove comments from libsodium signature validation patch
+      Bring in librustzcash crate
+      Bring in Cargo.lock from librustzcash repo
+      rust: Pin toolchain to 1.36.0, matching depends system
+      rust: Adjust Cargo.toml so that it compiles
+      Update .gitignore for Rust code
+      Replace librustzcash from depends system with src/rust
+      Move root of Rust crate into repo root
+      depends: Remove unused vendored crates
+      Fix Rust static library linking for Windows builds
+      test: Rename FakeCoinsViewDB -> ValidationFakeCoinsViewDB
+      test: Modify ValidationFakeCoinsViewDB to optionally contain a coin
+      test: Add missing parameter selection to Validation.ReceivedBlockTransactions
+      mempool: Check transparent signatures against the previous network upgrade
+      mempool: Remove duplicate consensusBranchId from AcceptToMemoryPool
+      test: Add Overwinter and Sapling support to GetValidTransaction() helper
+      consensus: Check JoinSplit signatures against the previous network upgrade
+      depends: Use Rust 1.42.0 toolchain
+      Bring in updates to librustzcash crate
+      depends: Define Rust target in a single location
+      depends: Hard-code Rust target for all Darwin hosts
+      Add ZIP 221 logic to block index
+      Add ZIP 221 support to miner and getblocktemplate
+      Implement ZIP 221 consensus rules
+      Return the correct root from librustzcash_mmr_{append, delete}
+      Use a C array for HistoryEntry instead of std::array
+      test: Verify ZIP 221 logic against reference implementation
+      build: Move cargo arguments into RUST_BUILD_OPTS
+      build: Correctly remove generated files from .cargo
+      test: Build Rust tests as part of qa/zcash/full_test_suite.py
+      build: Connect cargo verbosity to make verbosity
+      test: Assert that GetValidTransaction supports the given branch ID
+      Comment tweaks and cleanups
+      test: Add an extra assertion to feature_zip221.py
+      Remove unnecessary else case in CCoinsViewCache::PreloadHistoryTree
+      Improve documentation of CCoinsViewCache::PreloadHistoryTree
+      Truncate HistoryCache.appends correctly for zero-indexed entries
+      Comment clarifications and fixes
+      Make peak_pos zero-indexed in CCoinsViewCache::PreloadHistoryTree
+      test: Ignore timestamps in addressindex checks
+      test: Add a second Sapling note to WalletTests.ClearNoteWitnessCache
+      test: Run Equihash test vectors on both C++ and Rust validators
+      Pass the block height through to CheckEquihashSolution()
+      consensus: From Heartwood activation, use Rust Equihash validator
+      zcutil/make-release.py: Fix to run with Python 3
+      zcutil/make-release.py: Check for release dependencies
+      Update release notes for v2.1.2
+      zcutil/release-notes.py: Add Python 3 execution header
+
+James O'Beirne (1):
+      Add basic coverage reporting for RPC tests
+
+Jeremy Rubin (3):
+      Add Basic CheckQueue Benchmark
+      Address ryanofsky feedback on CCheckQueue benchmarks. Eliminated magic numbers, fixed scoping of vectors (and memory movement component of benchmark).
+      Add prevector destructor benchmark
+
+Karl-Johan Alm (1):
+      Refactoring: Removed using namespace <xxx> from bench/ and test/ source files.
+
+Larry Ruane (2):
+      zcutil/fetch-params.sh unneeded --testnet arg should warn user
+      util: CBufferedFile fixes
+
+LitecoinZ (1):
+      Fix issue #3772
+
+Marshall Gaucher (1):
+      Update qa/rpc-tests/addressindex.py
+
+Matt Corallo (2):
+      Remove countMaskInv caching in bench framework
+      Require a steady clock for bench with at least micro precision
+
+MeshCollider (3):
+      Fix race for mapBlockIndex in AppInitMain
+      Make fReindex atomic to avoid race
+      Consistent parameter names in txdb.h
+
+NicolasDorier (1):
+      [qa] assert_start_raises_init_error
+
+NikVolf (3):
+      push/pop history with tests
+      update chain history in ConnectBlock and DisconnectBlock
+      use iterative platform-independent log2i
+
+Patrick Strateman (1):
+      Acquire lock to check for genesis block.
+
+Pavel Janík (3):
+      Rewrite help texts for features enabled by default.
+      Ignore bench_bitcoin binary.
+      Prevent warning: variable 'x' is uninitialized
+
+Philip Kaufmann (1):
+      [Trivial] ensure minimal header conventions
+
+Pieter Wuille (3):
+      Benchmark rolling bloom filter
+      Introduce FastRandomContext::randbool()
+      FastRandom benchmark
+
+Sean Bowe (9):
+      Initialize ThreadNotifyWallets before additional blocks are imported.
+      Handle case of fresh wallets in ThreadNotifyWallets.
+      Clarify comment
+      Add librustzcash tests to the full test suite.
+      Add release profile optimizations and turn off panic unwinding in librustzcash.
+      Minor typo fixes.
+      Simplification for MacOS in rust-test.
+      make-release.py: Versioning changes for 2.1.2-rc1.
+      make-release.py: Updated manpages for 2.1.2-rc1.
+
+Taylor Hornby (15):
+      Make the equihash validator macro set its output to false when throwing an exception.
+      Add test for unused bits in the Equihash solution encoding.
+      Add Python script for checking if dependencies have updates.
+      Add GitHub API credential
+      Update list of dependencies to check
+      Wrap long lines
+      Cache releases to reduce network usage and improve performance
+      Make updatecheck.py compatible with python2
+      Have make clean delete temporary AFL build directory
+      Add AFL build directory to .gitignore
+      Have make clean delete AFL output directories.
+      Fix bug in updatecheck.py and add utfcpp to its dependency list
+      Fix typo in updatecheck.py
+      Update updatecheck.py with the new Rust dependencies and improve the error message in case the untracked dependency list becomes out of date.
+      Fix undefined behavior in CScriptNum
+
+Wladimir J. van der Laan (7):
+      bench: Add crypto hash benchmarks
+      Kill insecure_random and associated global state
+      bench: Fix subtle counting issue when rescaling iteration count
+      bench: Add support for measuring CPU cycles
+      bench: Fix initialization order in registration
+      util: Don't set strMiscWarning on every exception
+      test_framework: detect failure of bitcoind startup
+
+Yuri Zhykin (1):
+      bench: Added base58 encoding/decoding benchmarks
+
+avnish (14):
+      changed block_test to BlockTests
+      changed test names from _ to CamelCase
+      changed header_size_is_expected to HeaderSizeIsExpected
+      changed "equihash_tests" to EquihashTests
+      changed founders_reward_test to FoundersRewardTest
+      changes tests to camelcase
+      chnged keystore_tests to KeystoreTests
+      changed libzcash_utils to LibzcashUtils
+      changed test to CamelCase
+      changed test to CamelCase
+      changed test to CamelCase
+      changed  seven_eq_seven to SevenEqSeven
+      changed txid_tests to TxidTests
+      changed wallet_zkeys_test to WalletZkeysTest
+
+avnish98 (1):
+      requested changes are rectified
+
+ca333 (2):
+      update libsodium to v1.0.18
+      fix dead openssl download path
+
+gladcow (4):
+      Show reindex state in metrics
+      Use processed file size as progress in metrics during reindex
+      Byte sizes format
+      Move reindex progress globals to metrics.h/cpp
+
+Marshall Gaucher (74):
+      update /usr/bin/env; fix print conventions
+      update test_framework modules
+      Update rpc-test/test_framework to Py3 convention,modules,encoding
+      Update ignored testScriptsExt to Python3
+      Update python3 env path, remove python 2.7 assert
+      Update hexlify for encoding, update to py3 io module
+      Update py3 env path, remove py2 assert
+      Update py2 conventions to py3, remove py2 env and assert
+      Update py2 conventions to py3, update Decimal calls
+      Update py2 env path, remove py2 assert
+      Update py2 env path, remove py2 assert
+      Update py2 env path, remove py2 assert, update filter to return list for py3
+      Update py2 env path, remove py2 assert, update http module and assert encoding
+      Update cmp to py3 functions, update map return to list for py3
+      Standard py2 to py3 updates
+      Update py2 modules to py3, update encoding to be py3 compatible
+      Update to py3 conventions, update decimal calls to be consistent
+      Update to py3 conventions, update filter to return list
+      update to py3 conventions, update range to return list for py3
+      update to py3 convention, update execfile to py3 call
+      update to py3 conventions, update cmp to be py3 compatible, update map to return list for py3
+      update to py3 conventions, preserve ipv6 patch
+      update str cast to prevent address assert issues
+      clean up binascii call
+      Add keyerror execption
+      update to py3 env path
+      update to py3 conventions, update functions to be upstream consistent
+      update to py3 conventions, clean up code to be upstream consistent
+      update to py3 encodings
+      update encoding, decoding, serialize funcs for py3
+      Update type to be decimal
+      update to py3 conventions, BUG with last assert_equal
+      Update io modules for py3, ISSUE with create_transaction function
+      Update to py3, ISSUE with encoding
+      Update to py3, ISSUE with encoding
+      Update to py3, ISSUE with encoding in create_block
+      Update to py3, ISSUE with encoding in create_block
+      Clean up code not needed from upstream
+      update io module, fix py3 division, and string encoding
+      update remaining encoding issues, add pyblake2
+      Use more meaningful assert_equal from our original codebase
+      Clean up code from upstream we dont use
+      fix except bug for undefined url
+      Remove semi colons
+      make import urlparse module consistent,httplib update to py3
+      correct update to python3
+      clean-up imports, keep string notation consistent, remove spacing
+      clean up
+      Use upstream encoding for encodeDecimal
+      fix type issue
+      fix initialize statements for imports
+      clean up initiliaze statements from imports
+      update type for decimal 0
+      remove debug lines from prior commits
+      clean up to minimize diff
+      remove u encoding
+      Fix decimal 0 issues
+      Clean up import calls
+      clean up
+      clean up
+      clean up
+      fix url and port issue
+      cleanups and fixing odd casting
+      Update json to simplejson to remove unicode and str issue from py2 to py3
+      Update py3 division
+      fix pyflakes errors
+      clean up conventions and whitespace
+      fix string pattern issue on byte object
+      update comment regarding prior py2 exception
+      Fix remaining python3 conventions
+      Update remaining Python3 conventions
+      Updating remaining python3 conventions
+      Update #! env for python3
+      Update RPCs to support cross platform paths and libs
+
+murrayn (1):
+      Add build support for 'gprof' profiling.
+
+practicalswift (8):
+      build: Show enabled sanitizers in configure output
+      Add -ftrapv to DEBUG_CXXFLAGS when --enable-debug is used
+      Assert that what might look like a possible division by zero is actually unreachable
+      Replace boost::function with std::function (C++11)
+      Avoid static analyzer warnings regarding uninitialized arguments
+      Restore default format state of cout after printing with std::fixed/setprecision
+      Initialize recently introduced non-static class member lastCycles to zero in constructor
+      Replace boost::function with std::function (C++11)
+
+ptschip (1):
+      Enable python tests for Native Windows
+
+zancas (3):
+      update comment, to correctly specify number of methods injected
+      replace "virtual" with "override" in subclasses
+      Remove remaining instances of boost::function
+
diff --git a/depend/zcash/doc/release-notes/release-notes-2.1.2.md b/depend/zcash/doc/release-notes/release-notes-2.1.2.md
new file mode 100644
index 000000000..0a4aa45d4
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-2.1.2.md
@@ -0,0 +1,623 @@
+Notable changes
+===============
+
+Network Upgrade 3: Heartwood
+----------------------------
+
+The code preparations for the Heartwood network upgrade are finished and
+included in this release. The following ZIPs are being deployed:
+
+- [ZIP 213: Shielded Coinbase](https://zips.z.cash/zip-0213)
+- [ZIP 221: FlyClient - Consensus-Layer Changes](https://zips.z.cash/zip-0221)
+
+Heartwood will activate on testnet at height 903800, and can also be activated
+at a specific height in regtest mode by setting the config option
+`-nuparams=f5b9230b:HEIGHT`.
+
+As a reminder, because the Heartwood activation height is not yet specified for
+mainnet, version 2.1.2 will behave similarly as other pre-Heartwood releases
+even after a future activation of Heartwood on the network. Upgrading from 2.1.2
+will be required in order to follow the Heartwood network upgrade on mainnet.
+
+See [ZIP 250](https://zips.z.cash/zip-0250) for additional information about the
+deployment process for Heartwood.
+
+### Mining to Sapling addresses
+
+Miners and mining pools that wish to test the new "shielded coinbase" support on
+the Heartwood testnet can generate a new Sapling address with `z_getnewaddress`,
+add the config option `mineraddress=SAPLING_ADDRESS` to their `zcash.conf` file,
+and then restart their `zcashd` node. `getblocktemplate` will then return
+coinbase transactions containing a shielded miner output.
+
+Note that `mineraddress` should only be set to a Sapling address after the
+Heartwood network upgrade has activated; setting a Sapling address prior to
+Heartwood activation will cause `getblocktemplate` to return block templates
+that cannot be mined.
+
+Sapling viewing keys support
+----------------------------
+
+Support for Sapling viewing keys (specifically, Sapling extended full viewing
+keys, as described in [ZIP 32](https://zips.z.cash/zip-0032)), has been added to
+the wallet. Nodes will track both sent and received transactions for any Sapling
+addresses associated with the imported Sapling viewing keys.
+
+- Use the `z_exportviewingkey` RPC method to obtain the viewing key for a
+  shielded address in a node's wallet. For Sapling addresses, these always begin
+  with "zxviews" (or "zxviewtestsapling" for testnet addresses).
+
+- Use `z_importviewingkey` to import a viewing key into another node.  Imported
+  Sapling viewing keys will be stored in the wallet, and remembered across
+  restarts.
+
+- `z_getbalance` will show the balance of a Sapling address associated with an
+  imported Sapling viewing key. Balances for Sapling viewing keys will be
+  included in the output of `z_gettotalbalance` when the `includeWatchonly`
+  parameter is set to `true`.
+
+- RPC methods for viewing shielded transaction information (such as
+  `z_listreceivedbyaddress`) will return information for Sapling addresses
+  associated with imported Sapling viewing keys.
+
+Details about what information can be viewed with these Sapling viewing keys,
+and what guarantees you have about that information, can be found in
+[ZIP 310](https://zips.z.cash/zip-0310).
+
+Removal of time adjustment and the -maxtimeadjustment= option
+-------------------------------------------------------------
+
+Prior to v2.1.1-1, `zcashd` would adjust the local time that it used by up
+to 70 minutes, according to a median of the times sent by the first 200 peers
+to connect to it. This mechanism was inherently insecure, since an adversary
+making multiple connections to the node could effectively control its time
+within that +/- 70 minute window (this is called a "timejacking attack").
+
+In the v2.1.1-1 security release, in addition to other mitigations for
+timejacking attacks, the maximum time adjustment was set to zero by default.
+This effectively disabled time adjustment; however, a `-maxtimeadjustment=`
+option was provided to override this default.
+
+As a simplification the time adjustment code has now been completely removed,
+together with `-maxtimeadjustment=`. Node operators should instead ensure that
+their local time is set reasonably accurately.
+
+If it appears that the node has a significantly different time than its peers,
+a warning will still be logged and indicated on the metrics screen if enabled.
+
+View shielded information in wallet transactions
+------------------------------------------------
+
+In previous `zcashd` versions, to obtain information about shielded transactions
+you would use either the `z_listreceivedbyaddress` RPC method (which returns all
+notes received by an address) or `z_listunspent` (which returns unspent notes,
+optionally filtered by addresses). There were no RPC methods that directly
+returned details about spends, or anything equivalent to the `gettransaction`
+method (which returns transparent information about in-wallet transactions).
+
+This release introduces a new RPC method `z_viewtransaction` to fill that gap.
+Given the ID of a transaction in the wallet, it decrypts the transaction and
+returns detailed shielded information for all decryptable new and spent notes,
+including:
+
+- The address that each note belongs to.
+- Values in both decimal ZEC and zatoshis.
+- The ID of the transaction that each spent note was received in.
+- An `outgoing` flag on each new note, which will be `true` if the output is not
+  for an address in the wallet.
+- A `memoStr` field for each new note, containing its text memo (if its memo
+  field contains a valid UTF-8 string).
+
+Information will be shown for any address that appears in `z_listaddresses`;
+this includes watch-only addresses linked to viewing keys imported with
+`z_importviewingkey`, as well as addresses with spending keys (both generated
+with `z_getnewaddress` and imported with `z_importkey`).
+
+Better error messages for rejected transactions after network upgrades
+----------------------------------------------------------------------
+
+The Zcash network upgrade process includes several features designed to protect
+users. One of these is the "consensus branch ID", which prevents transactions
+created after a network upgrade has activated from being replayed on another
+chain (that might have occurred due to, for example, a
+[friendly fork](https://electriccoin.co/blog/future-friendly-fork/)). This is
+known as "two-way replay protection", and is a core requirement by
+[various](https://blog.bitgo.com/bitgos-approach-to-handling-a-hard-fork-71e572506d7d?gi=3b80c02e027e)
+[members](https://trezor.io/support/general/hard-forks/) of the cryptocurrency
+ecosystem for supporting "hard fork"-style changes like our network upgrades.
+
+One downside of the way replay protection is implemented in Zcash, is that there
+is no visible difference between a transaction being rejected by a `zcashd` node
+due to targeting a different branch, and being rejected due to an invalid
+signature. This has caused issues in the past when a user had not upgraded their
+wallet software, or when a wallet lacked support for the new network upgrade's
+consensus branch ID; the resulting error messages when users tried to create
+transactions were non-intuitive, and particularly cryptic for transparent
+transactions.
+
+Starting from this release, `zcashd` nodes will re-verify invalid transparent
+and Sprout signatures against the consensus branch ID from before the most
+recent network upgrade. If the signature then becomes valid, the transaction
+will be rejected with the error message `old-consensus-branch-id`. This error
+can be handled specifically by wallet providers to inform the user that they
+need to upgrade their wallet software.
+
+Wallet software can also automatically obtain the latest consensus branch ID
+from their (up-to-date) `zcashd` node, by calling `getblockchaininfo` and
+looking at `{'consensus': {'nextblock': BRANCH_ID, ...}, ...}` in the JSON
+output.
+
+Expired transactions notifications
+----------------------------------
+
+A new config option `-txexpirynotify` has been added that will cause `zcashd` to
+execute a command when a transaction in the mempool expires. This can be used to
+notify external systems about transaction expiry, similar to the existing
+`-blocknotify` config option that notifies when the chain tip changes.
+
+RPC methods
+-----------
+
+- The `z_importkey` and `z_importviewingkey` RPC methods now return the type of
+  the imported spending or viewing key (`sprout` or `sapling`), and the
+  corresponding payment address.
+
+- Negative heights are now permitted in `getblock` and `getblockhash`, to select
+  blocks backwards from the chain tip. A height of `-1` corresponds to the last
+  known valid block on the main chain.
+
+- A new RPC method `getexperimentalfeatures` returns the list of enabled
+  experimental features.
+
+Build system
+------------
+
+- The `--enable-lcov`, `--disable-tests`, and `--disable-mining` flags for
+  `zcutil/build.sh` have been removed. You can pass these flags instead by using
+  the `CONFIGURE_FLAGS` environment variable. For example, to enable coverage
+  instrumentation (thus enabling "make cov" to work), call:
+
+  ```
+  CONFIGURE_FLAGS="--enable-lcov --disable-hardening" ./zcutil/build.sh
+  ```
+
+- The build system no longer defaults to verbose output. You can re-enable
+  verbose output with `./zcutil/build.sh V=1`
+
+Changelog
+=========
+
+Alfredo Garcia (40):
+      remove SignatureHash from python rpc tests
+      add negative height to getblock
+      allow negative index to getblockhash
+      update docs
+      add additional tests to rpc_wallet_z_getnewaddress
+      change convention
+      change regex
+      Return address and type of imported key in z_importkey
+      Delete travis file
+      dedup decode keys and addresses
+      remove unused imports
+      add txexpirynotify
+      fix rpx_wallet_tests
+      remove debug noise from 2 gtests
+      make type and size a pair in DecodeAny arguments
+      add missing calls to DecodeAny
+      add destination wrappers
+      change tuples to classes
+      change cm() to cmu() in SaplingNote class
+      change the cm member of OutputDescription to cmu
+      change maybe_cm to maybe_cmu
+      add getexperimentalfeatures rpc call
+      refactor experimental features
+      make fInsightExplorer a local
+      add check_node_log utility function
+      remove space after new line
+      move check_node_log framework test to a new file
+      use check_node_log in turnstile.py
+      add stop_node argument to check_node_log, use it in shieldingcoinbase
+      change constructors
+      minor comment fix
+      preserve test semantics
+      remove unused import
+      multiple debug categories documentation
+      return address info in z_importviewingkey
+      add expected address check to tests
+      change unclear wording in z_import calls address returned
+      Lock with cs_main inside gtests that call chainActive.Height()
+      add -lightwalletd experimental option
+      compute more structures in mempool DynamicMemoryUsage
+
+Carl Dong (1):
+      autoconf: Sane --enable-debug defaults.
+
+Chun Kuan Lee (1):
+      Reset default -g -O2 flags when enable debug
+
+Cory Fields (3):
+      bench: switch to std::chrono for time measurements
+      bench: prefer a steady clock if the resolution is no worse
+      build: Split hardening/fPIE options out
+
+Dagur Valberg Johannsson (1):
+      Improve z_getnewaddress tests
+
+Daira Hopwood (25):
+      Add missing cases for Blossom in ContextualCheckBlock tests.
+      Revert "Add -maxtimeadjustment with default of 0 instead of the 4200 seconds used in Bitcoin Core."
+      Remove uses of GetTimeOffset().
+      Replace time adjustment with warning only.
+      Update GetAdjustedTime() to GetTime().
+      Sort entries in zcash_gtest_SOURCES (other than test_tautology which is deliberately first).
+      Add release notes for removal of -maxtimeadjustment.
+      Resolve a race condition on `chainActive.Tip()` in initialization (introduced in #4379).
+      Setting a std::atomic variable in a signal handler only has defined behaviour if it is lock-free.
+      Add comment to `MilliSleep` documenting that it is an interruption point.
+      Exit init early if we request shutdown before having loaded the genesis block.
+      Fix typos/minor errors in comments, and wrap some lines.
+      Avoid a theoretical possibility of division-by-zero introduced in #4368.
+      Make the memo a mandatory argument for SendManyRecipient
+      Add a `zcutil/clean.sh` script that works (unlike `make clean`).
+      Split into clean.sh and distclean.sh.
+      Minor refactoring.
+      Executables end with .exe on Windows.
+      Avoid spurious error messages when cleaning up directories.
+      Address review comments.
+      Use `SA_RESTART` in `sa_flags` when setting up signal handlers.
+      Remove a redundant `rm -f` command.
+      Refer to altitude instead of height for history tree peaks
+      Address review comments: `target` and `depends/work` should be cleaned by clean.sh.
+      Clarify definition of NETWORK_UPGRADE_PEER_PREFERENCE_BLOCK_PERIOD.
+
+Dimitris Apostolou (8):
+      Fix Boost compilation on macOS
+      Remove libsnark preprocessor flags
+      Fix typo
+      End diff with LF character
+      Remove stale comment
+      Point at support community on Discord
+      Update documentation info
+      Fix typos
+
+Eirik Ogilvie-Wigley (2):
+      Include shielded transaction data when calculating RecursiveDynamicUsage of transactions
+      Account for malloc overhead
+
+Evan Klitzke (2):
+      Add --with-sanitizers option to configure
+      Make --enable-debug to pick better options
+
+Gavin Andresen (2):
+      Simple benchmarking framework
+      Support very-fast-running benchmarks
+
+Gregory Maxwell (4):
+      Avoid integer division in the benchmark inner-most loop.
+      Move GetWarnings and related globals to util.
+      Eliminate data races for strMiscWarning and fLargeWork*Found.
+      Move GetWarnings() into its own file.
+
+Jack Grigg (95):
+      Revert "Add configure flags for enabling ASan/UBSan and TSan"
+      configure: Re-introduce additional sanitizer flags
+      RPC: z_viewtransaction
+      depends: Add utfcpp to dependencies
+      RPC: Display valid UTF-8 memos in z_viewtransaction
+      RPC: Use OutgoingViewingKeys to recover non-wallet Sapling outputs
+      test: Check z_viewtransaction output in wallet_listreceived RPC test
+      Benchmark Zcash verification operations
+      Simulate worst-case block verification
+      zcutil/build.sh: Remove lcov and mining flags
+      configure: Change default Proton to match build.sh
+      zcutil/build.sh: Turn off verbosity by default
+      Make -fwrapv conditional on --enable-debug=no
+      Move default -g flag into configure.ac behind --enable-debug=no
+      Add build system changes to release notes
+      test: Hard-code hex memo in wallet_listreceived for Python3 compatibility
+      test: Fix pyflakes warnings
+      bench: "Use" result of crypto_sign_verify_detached
+      Add test vectors for small-order Ed25519 pubkeys
+      Patch libsodium 1.0.15 pubkey validation onto 1.0.18
+      Patch libsodium 1.0.15 signature validation onto 1.0.18
+      Add release notes for z_viewtransaction
+      Deduplicate some wallet keystore logic
+      Move Sprout and Sapling address logic into separate files
+      Move ZIP 32 classes inside zcash/Address.hpp
+      SaplingFullViewingKey -> SaplingExtendedFullViewingKey in keystore maps
+      Remove default address parameter from Sapling keystore methods
+      test: Add test for CBasicKeyStore::AddSaplingFullViewingKey
+      Add encoding and decoding for Sapling extended full viewing keys
+      Add Sapling ExtFVK support to z_exportviewingkey
+      Add in-memory Sapling ExtFVK support to z_importviewingkey
+      Store imported Sapling ExtFVKs in wallet database
+      OutputDescriptionInfo::Build()
+      ZIP 213 consensus rules
+      Add support for Sapling addresses in -mineraddress
+      wallet: Include coinbase txs in Sapling note selection
+      Add regtest-only -nurejectoldversions option
+      test: Minor tweaks to comments in LibsodiumPubkeyValidation
+      test: RPC test for shielded coinbase
+      Adjust comments on ZIP 213 logic
+      Use DoS level constants and parameters for ZIP 213 rejections
+      test: Check that shielded coinbase can be spent to a t-address
+      init: Inform on error that -mineraddress must be Sapling or transparent
+      test: Explicitly check Sapling consensus rules apply to shielded coinbase
+      Migrate GitHub issue template to new format
+      Add GitHub issue templates for feature requests and UX reports
+      depends: Remove comments from libsodium signature validation patch
+      Bring in librustzcash crate
+      Bring in Cargo.lock from librustzcash repo
+      rust: Pin toolchain to 1.36.0, matching depends system
+      rust: Adjust Cargo.toml so that it compiles
+      Update .gitignore for Rust code
+      Replace librustzcash from depends system with src/rust
+      Move root of Rust crate into repo root
+      depends: Remove unused vendored crates
+      Fix Rust static library linking for Windows builds
+      test: Rename FakeCoinsViewDB -> ValidationFakeCoinsViewDB
+      test: Modify ValidationFakeCoinsViewDB to optionally contain a coin
+      test: Add missing parameter selection to Validation.ReceivedBlockTransactions
+      mempool: Check transparent signatures against the previous network upgrade
+      mempool: Remove duplicate consensusBranchId from AcceptToMemoryPool
+      test: Add Overwinter and Sapling support to GetValidTransaction() helper
+      consensus: Check JoinSplit signatures against the previous network upgrade
+      depends: Use Rust 1.42.0 toolchain
+      Bring in updates to librustzcash crate
+      depends: Define Rust target in a single location
+      depends: Hard-code Rust target for all Darwin hosts
+      Add ZIP 221 logic to block index
+      Add ZIP 221 support to miner and getblocktemplate
+      Implement ZIP 221 consensus rules
+      Return the correct root from librustzcash_mmr_{append, delete}
+      Use a C array for HistoryEntry instead of std::array
+      test: Verify ZIP 221 logic against reference implementation
+      build: Move cargo arguments into RUST_BUILD_OPTS
+      build: Correctly remove generated files from .cargo
+      test: Build Rust tests as part of qa/zcash/full_test_suite.py
+      build: Connect cargo verbosity to make verbosity
+      test: Assert that GetValidTransaction supports the given branch ID
+      Comment tweaks and cleanups
+      test: Add an extra assertion to feature_zip221.py
+      Remove unnecessary else case in CCoinsViewCache::PreloadHistoryTree
+      Improve documentation of CCoinsViewCache::PreloadHistoryTree
+      Truncate HistoryCache.appends correctly for zero-indexed entries
+      Comment clarifications and fixes
+      Make peak_pos zero-indexed in CCoinsViewCache::PreloadHistoryTree
+      test: Ignore timestamps in addressindex checks
+      test: Add a second Sapling note to WalletTests.ClearNoteWitnessCache
+      test: Run Equihash test vectors on both C++ and Rust validators
+      Pass the block height through to CheckEquihashSolution()
+      consensus: From Heartwood activation, use Rust Equihash validator
+      zcutil/make-release.py: Fix to run with Python 3
+      zcutil/make-release.py: Check for release dependencies
+      Update release notes for v2.1.2
+      zcutil/release-notes.py: Add Python 3 execution header
+      Set hashFinalSaplingRoot and hashChainHistoryRoot in AddToBlockIndex
+
+James O'Beirne (1):
+      Add basic coverage reporting for RPC tests
+
+Jeremy Rubin (3):
+      Add Basic CheckQueue Benchmark
+      Address ryanofsky feedback on CCheckQueue benchmarks. Eliminated magic numbers, fixed scoping of vectors (and memory movement component of benchmark).
+      Add prevector destructor benchmark
+
+Karl-Johan Alm (1):
+      Refactoring: Removed using namespace <xxx> from bench/ and test/ source files.
+
+Larry Ruane (2):
+      zcutil/fetch-params.sh unneeded --testnet arg should warn user
+      util: CBufferedFile fixes
+
+LitecoinZ (1):
+      Fix issue #3772
+
+Marshall Gaucher (1):
+      Update qa/rpc-tests/addressindex.py
+
+Matt Corallo (2):
+      Remove countMaskInv caching in bench framework
+      Require a steady clock for bench with at least micro precision
+
+MeshCollider (3):
+      Fix race for mapBlockIndex in AppInitMain
+      Make fReindex atomic to avoid race
+      Consistent parameter names in txdb.h
+
+NicolasDorier (1):
+      [qa] assert_start_raises_init_error
+
+NikVolf (3):
+      push/pop history with tests
+      update chain history in ConnectBlock and DisconnectBlock
+      use iterative platform-independent log2i
+
+Patrick Strateman (1):
+      Acquire lock to check for genesis block.
+
+Pavel Janík (3):
+      Rewrite help texts for features enabled by default.
+      Ignore bench_bitcoin binary.
+      Prevent warning: variable 'x' is uninitialized
+
+Philip Kaufmann (1):
+      [Trivial] ensure minimal header conventions
+
+Pieter Wuille (3):
+      Benchmark rolling bloom filter
+      Introduce FastRandomContext::randbool()
+      FastRandom benchmark
+
+Sean Bowe (15):
+      Initialize ThreadNotifyWallets before additional blocks are imported.
+      Handle case of fresh wallets in ThreadNotifyWallets.
+      Clarify comment
+      Add librustzcash tests to the full test suite.
+      Add release profile optimizations and turn off panic unwinding in librustzcash.
+      Minor typo fixes.
+      Simplification for MacOS in rust-test.
+      make-release.py: Versioning changes for 2.1.2-rc1.
+      make-release.py: Updated manpages for 2.1.2-rc1.
+      make-release.py: Updated release notes and changelog for 2.1.2-rc1.
+      Add Rust resources to distribution tarball.
+      Add test_random.h to distribution tarball.
+      Set Heartwood activation height for testnet to 903800.
+      make-release.py: Versioning changes for 2.1.2.
+      make-release.py: Updated manpages for 2.1.2.
+
+Taylor Hornby (15):
+      Make the equihash validator macro set its output to false when throwing an exception.
+      Add test for unused bits in the Equihash solution encoding.
+      Add Python script for checking if dependencies have updates.
+      Add GitHub API credential
+      Update list of dependencies to check
+      Wrap long lines
+      Cache releases to reduce network usage and improve performance
+      Make updatecheck.py compatible with python2
+      Have make clean delete temporary AFL build directory
+      Add AFL build directory to .gitignore
+      Have make clean delete AFL output directories.
+      Fix bug in updatecheck.py and add utfcpp to its dependency list
+      Fix typo in updatecheck.py
+      Update updatecheck.py with the new Rust dependencies and improve the error message in case the untracked dependency list becomes out of date.
+      Fix undefined behavior in CScriptNum
+
+Wladimir J. van der Laan (7):
+      bench: Add crypto hash benchmarks
+      Kill insecure_random and associated global state
+      bench: Fix subtle counting issue when rescaling iteration count
+      bench: Add support for measuring CPU cycles
+      bench: Fix initialization order in registration
+      util: Don't set strMiscWarning on every exception
+      test_framework: detect failure of bitcoind startup
+
+Yuri Zhykin (1):
+      bench: Added base58 encoding/decoding benchmarks
+
+avnish (14):
+      changed block_test to BlockTests
+      changed test names from _ to CamelCase
+      changed header_size_is_expected to HeaderSizeIsExpected
+      changed "equihash_tests" to EquihashTests
+      changed founders_reward_test to FoundersRewardTest
+      changes tests to camelcase
+      chnged keystore_tests to KeystoreTests
+      changed libzcash_utils to LibzcashUtils
+      changed test to CamelCase
+      changed test to CamelCase
+      changed test to CamelCase
+      changed  seven_eq_seven to SevenEqSeven
+      changed txid_tests to TxidTests
+      changed wallet_zkeys_test to WalletZkeysTest
+
+avnish98 (1):
+      requested changes are rectified
+
+ca333 (2):
+      update libsodium to v1.0.18
+      fix dead openssl download path
+
+gladcow (4):
+      Show reindex state in metrics
+      Use processed file size as progress in metrics during reindex
+      Byte sizes format
+      Move reindex progress globals to metrics.h/cpp
+
+Marshall Gaucher (74):
+      update /usr/bin/env; fix print conventions
+      update test_framework modules
+      Update rpc-test/test_framework to Py3 convention,modules,encoding
+      Update ignored testScriptsExt to Python3
+      Update python3 env path, remove python 2.7 assert
+      Update hexlify for encoding, update to py3 io module
+      Update py3 env path, remove py2 assert
+      Update py2 conventions to py3, remove py2 env and assert
+      Update py2 conventions to py3, update Decimal calls
+      Update py2 env path, remove py2 assert
+      Update py2 env path, remove py2 assert
+      Update py2 env path, remove py2 assert, update filter to return list for py3
+      Update py2 env path, remove py2 assert, update http module and assert encoding
+      Update cmp to py3 functions, update map return to list for py3
+      Standard py2 to py3 updates
+      Update py2 modules to py3, update encoding to be py3 compatible
+      Update to py3 conventions, update decimal calls to be consistent
+      Update to py3 conventions, update filter to return list
+      update to py3 conventions, update range to return list for py3
+      update to py3 convention, update execfile to py3 call
+      update to py3 conventions, update cmp to be py3 compatible, update map to return list for py3
+      update to py3 conventions, preserve ipv6 patch
+      update str cast to prevent address assert issues
+      clean up binascii call
+      Add keyerror execption
+      update to py3 env path
+      update to py3 conventions, update functions to be upstream consistent
+      update to py3 conventions, clean up code to be upstream consistent
+      update to py3 encodings
+      update encoding, decoding, serialize funcs for py3
+      Update type to be decimal
+      update to py3 conventions, BUG with last assert_equal
+      Update io modules for py3, ISSUE with create_transaction function
+      Update to py3, ISSUE with encoding
+      Update to py3, ISSUE with encoding
+      Update to py3, ISSUE with encoding in create_block
+      Update to py3, ISSUE with encoding in create_block
+      Clean up code not needed from upstream
+      update io module, fix py3 division, and string encoding
+      update remaining encoding issues, add pyblake2
+      Use more meaningful assert_equal from our original codebase
+      Clean up code from upstream we dont use
+      fix except bug for undefined url
+      Remove semi colons
+      make import urlparse module consistent,httplib update to py3
+      correct update to python3
+      clean-up imports, keep string notation consistent, remove spacing
+      clean up
+      Use upstream encoding for encodeDecimal
+      fix type issue
+      fix initialize statements for imports
+      clean up initiliaze statements from imports
+      update type for decimal 0
+      remove debug lines from prior commits
+      clean up to minimize diff
+      remove u encoding
+      Fix decimal 0 issues
+      Clean up import calls
+      clean up
+      clean up
+      clean up
+      fix url and port issue
+      cleanups and fixing odd casting
+      Update json to simplejson to remove unicode and str issue from py2 to py3
+      Update py3 division
+      fix pyflakes errors
+      clean up conventions and whitespace
+      fix string pattern issue on byte object
+      update comment regarding prior py2 exception
+      Fix remaining python3 conventions
+      Update remaining Python3 conventions
+      Updating remaining python3 conventions
+      Update #! env for python3
+      Update RPCs to support cross platform paths and libs
+
+murrayn (1):
+      Add build support for 'gprof' profiling.
+
+practicalswift (8):
+      build: Show enabled sanitizers in configure output
+      Add -ftrapv to DEBUG_CXXFLAGS when --enable-debug is used
+      Assert that what might look like a possible division by zero is actually unreachable
+      Replace boost::function with std::function (C++11)
+      Avoid static analyzer warnings regarding uninitialized arguments
+      Restore default format state of cout after printing with std::fixed/setprecision
+      Initialize recently introduced non-static class member lastCycles to zero in constructor
+      Replace boost::function with std::function (C++11)
+
+ptschip (1):
+      Enable python tests for Native Windows
+
+zancas (3):
+      update comment, to correctly specify number of methods injected
+      replace "virtual" with "override" in subclasses
+      Remove remaining instances of boost::function
+
diff --git a/depend/zcash/doc/release-notes/release-notes-3.0.0-rc1.md b/depend/zcash/doc/release-notes/release-notes-3.0.0-rc1.md
new file mode 100644
index 000000000..3a8acb93b
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-3.0.0-rc1.md
@@ -0,0 +1,120 @@
+Notable changes
+===============
+
+The mainnet activation of the Heartwood network upgrade is supported by this
+release, with an activation height of 903000, which should occur in the middle
+of July — following the targeted EOS halt of our 2.1.2-3 release. Please upgrade
+to this release, or any subsequent release, in order to follow the Heartwood
+network upgrade.
+
+The following two ZIPs are being deployed as part of this upgrade:
+
+- [ZIP 213: Shielded Coinbase](https://zips.z.cash/zip-0213)
+- [ZIP 221: FlyClient - Consensus-Layer Changes](https://zips.z.cash/zip-0221)
+
+In order to help the ecosystem prepare for the mainnet activiation, Heartwood
+has already been activated on the Zcash testnet. Any node version 2.1.2 or
+higher, including this release, supports the Heartwood activation on testnet.
+
+## Mining to Sapling addresses
+
+After the mainnet activation of Heartwood, miners can mine directly into a
+Sapling shielded address. Miners should wait until after Heartwood activation
+before they make changes to their configuration to leverage this new feature.
+After activation of Heartwood, miners can add `mineraddress=SAPLING_ADDRESS` to
+their `zcash.conf` file, where `SAPLING_ADDRESS` represents a Sapling address
+that can be generated locally with the `z_getnewaddress` RPC command. Restart
+your node, and block templates produced by the `getblocktemplate` RPC command
+will now have coinbase transactions that mine directly into this shielded
+address.
+Changelog
+=========
+
+Aaron Clauson (1):
+      Minimal code changes to allow msvc compilation.
+
+Adam Langley (1):
+      Switch memory_cleanse implementation to BoringSSL's to ensure memory clearing even with link-time optimization.
+
+Alfredo Garcia (12):
+      fix rpc testcase
+      add blockheight, blockindex and blocktime to z_listreceivedbyaddress
+      change time to blocktime in help
+      add status to transactions
+      minor fix
+      minor cleanup style, var names
+      Add a new safe chars rule for node version string
+      fix wallet nullifiers test
+      Fix typo
+      add a test case
+      implement z_getnotescount api call
+      remove not needed help parameters to dump and import impl
+
+Ben Wilson (4):
+      Added Dockerfile to contrib with README
+      Fixed README grammar, reuse Dockerfile vars
+      Fixed Docker README grammar
+      Dockerfiles for zcashd CI builds
+
+Daira Hopwood (2):
+      Fix a null pointer dereference that occurs when formatting an error message, if we haven't activated an upgrade as expected.
+      Explicitly assert that chainActive[upgrade.nActivationHeight] is non-null at this point.
+
+Dimitris Apostolou (1):
+      Fix typos
+
+Jack Grigg (5):
+      Use BOOST_SCOPE_EXIT_TPL to clean and free datValue in CDB::Read
+      Improve memory_cleanse documentation
+      Add NU4 to upgrade list
+      Add NU4 test helpers
+      Update URLs for prior network upgrades
+
+Jonathan "Duke" Leto (1):
+      Add confirmations to z_listreceivedbyaddress
+
+Kris Nuttycombe (21):
+      Add a test reproducing the off-by-one error.
+      Check network reunification.
+      Narrow down the test case.
+      Make the test reproduce the actual off-by-one error in rewind length.
+      Fix #4119.
+      The last valid height condition reads better flipped.
+      Restart node in a chain split state to allow the test to complete.
+      Trivial comment.
+      Remove option to load new blocks from ConnectTip
+      Make condition closer to original, Fix incorrect comment.
+      Ensure that we don't pass a null block pointer to ConnectTip.
+      Update all crates.
+      Update to the Cargo V2 lockfile format.
+      Clean up imports in sapling_rewind_check.py
+      Use `%x` formatter for branch id hex string in test_framework/util.py
+      Update qa/rpc-tests/test_framework/mininode.py
+      Update qa/rpc-tests/sapling_rewind_check.py
+      Add Zcash copyright to sapling_rewind_check.py
+      Update test description and clarify internal comments.
+      Revert "Update qa/rpc-tests/sapling_rewind_check.py"
+      Remove unused imports.
+
+Sean Bowe (6):
+      Update minimum chain work on testnet to reflect Heartwood activation.
+      Pass DO_NOT_UPDATE_CONFIG_SCRIPTS=1 to autogen.sh in libsodium dependency, to avoid updating config scripts over the network.
+      Set the Heartwood activation height to 903000.
+      Bump the protocol version, as this node supports Heartwood on mainnet.
+      make-release.py: Versioning changes for 3.0.0-rc1.
+      make-release.py: Updated manpages for 3.0.0-rc1.
+
+Taylor Hornby (2):
+      Add univalue to updatecheck.py and update univalue, removing calls to deprecated methods
+      Avoid names starting with __.
+
+Thomas Snider (1):
+      [wallet] Securely erase potentially sensitive keys/values
+
+Tim Ruffing (2):
+      Clean up logic in memory_cleanse() for MSVC
+      Improve documentation of memory_cleanse()
+
+therealyingtong (1):
+      Fix off-by-one error in CreateNewBlock()
+
diff --git a/depend/zcash/doc/release-notes/release-notes-3.0.0.md b/depend/zcash/doc/release-notes/release-notes-3.0.0.md
new file mode 100644
index 000000000..479636a56
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-3.0.0.md
@@ -0,0 +1,130 @@
+Notable changes
+===============
+
+The mainnet activation of the Heartwood network upgrade is supported by this
+release, with an activation height of 903000, which should occur in the middle
+of July — following the targeted EOS halt of our 2.1.2-3 release. Please upgrade
+to this release, or any subsequent release, in order to follow the Heartwood
+network upgrade.
+
+The following two ZIPs are being deployed as part of this upgrade:
+
+- [ZIP 213: Shielded Coinbase](https://zips.z.cash/zip-0213)
+- [ZIP 221: FlyClient - Consensus-Layer Changes](https://zips.z.cash/zip-0221)
+
+In order to help the ecosystem prepare for the mainnet activiation, Heartwood
+has already been activated on the Zcash testnet. Any node version 2.1.2 or
+higher, including this release, supports the Heartwood activation on testnet.
+
+## Mining to Sapling addresses
+
+After the mainnet activation of Heartwood, miners can mine directly into a
+Sapling shielded address. Miners should wait until after Heartwood activation
+before they make changes to their configuration to leverage this new feature.
+After activation of Heartwood, miners can add `mineraddress=SAPLING_ADDRESS` to
+their `zcash.conf` file, where `SAPLING_ADDRESS` represents a Sapling address
+that can be generated locally with the `z_getnewaddress` RPC command. Restart
+your node, and block templates produced by the `getblocktemplate` RPC command
+will now have coinbase transactions that mine directly into this shielded
+address.
+
+Changelog
+=========
+
+Aaron Clauson (1):
+      Minimal code changes to allow msvc compilation.
+
+Adam Langley (1):
+      Switch memory_cleanse implementation to BoringSSL's to ensure memory clearing even with link-time optimization.
+
+Alfredo Garcia (12):
+      fix rpc testcase
+      add blockheight, blockindex and blocktime to z_listreceivedbyaddress
+      change time to blocktime in help
+      add status to transactions
+      minor fix
+      minor cleanup style, var names
+      Add a new safe chars rule for node version string
+      fix wallet nullifiers test
+      Fix typo
+      add a test case
+      implement z_getnotescount api call
+      remove not needed help parameters to dump and import impl
+
+Ben Wilson (4):
+      Added Dockerfile to contrib with README
+      Fixed README grammar, reuse Dockerfile vars
+      Fixed Docker README grammar
+      Dockerfiles for zcashd CI builds
+
+Daira Hopwood (2):
+      Fix a null pointer dereference that occurs when formatting an error message, if we haven't activated an upgrade as expected.
+      Explicitly assert that chainActive[upgrade.nActivationHeight] is non-null at this point.
+
+Dimitris Apostolou (1):
+      Fix typos
+
+Jack Grigg (5):
+      Use BOOST_SCOPE_EXIT_TPL to clean and free datValue in CDB::Read
+      Improve memory_cleanse documentation
+      Add NU4 to upgrade list
+      Add NU4 test helpers
+      Update URLs for prior network upgrades
+
+Jonathan "Duke" Leto (1):
+      Add confirmations to z_listreceivedbyaddress
+
+Kris Nuttycombe (25):
+      Add a test reproducing the off-by-one error.
+      Check network reunification.
+      Narrow down the test case.
+      Make the test reproduce the actual off-by-one error in rewind length.
+      Fix #4119.
+      The last valid height condition reads better flipped.
+      Restart node in a chain split state to allow the test to complete.
+      Trivial comment.
+      Remove option to load new blocks from ConnectTip
+      Make condition closer to original, Fix incorrect comment.
+      Ensure that we don't pass a null block pointer to ConnectTip.
+      Update all crates.
+      Update to the Cargo V2 lockfile format.
+      Clean up imports in sapling_rewind_check.py
+      Use `%x` formatter for branch id hex string in test_framework/util.py
+      Update qa/rpc-tests/test_framework/mininode.py
+      Update qa/rpc-tests/sapling_rewind_check.py
+      Add Zcash copyright to sapling_rewind_check.py
+      Update test description and clarify internal comments.
+      Revert "Update qa/rpc-tests/sapling_rewind_check.py"
+      Remove unused imports.
+      Add baseline for golden testing across network upgrade boundaries.
+      Update golden test for heartwood network upgrade.
+      Fully remove the regtest tree from restored nodes.
+      Remove unused imports.
+
+Sean Bowe (11):
+      Add NU4 activation to golden test.
+      Update minimum chain work on testnet to reflect Heartwood activation.
+      Pass DO_NOT_UPDATE_CONFIG_SCRIPTS=1 to autogen.sh in libsodium dependency, to avoid updating config scripts over the network.
+      Set the Heartwood activation height to 903000.
+      Bump the protocol version, as this node supports Heartwood on mainnet.
+      make-release.py: Versioning changes for 3.0.0-rc1.
+      make-release.py: Updated manpages for 3.0.0-rc1.
+      make-release.py: Updated release notes and changelog for 3.0.0-rc1.
+      Set deprecation of 3.0.0 to target EOS halt mid-September.
+      make-release.py: Versioning changes for 3.0.0.
+      make-release.py: Updated manpages for 3.0.0.
+
+Taylor Hornby (2):
+      Add univalue to updatecheck.py and update univalue, removing calls to deprecated methods
+      Avoid names starting with __.
+
+Thomas Snider (1):
+      [wallet] Securely erase potentially sensitive keys/values
+
+Tim Ruffing (2):
+      Clean up logic in memory_cleanse() for MSVC
+      Improve documentation of memory_cleanse()
+
+therealyingtong (1):
+      Fix off-by-one error in CreateNewBlock()
+
diff --git a/depend/zcash/doc/release-notes/release-notes-3.1.0-rc1.md b/depend/zcash/doc/release-notes/release-notes-3.1.0-rc1.md
new file mode 100644
index 000000000..c994b5971
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-3.1.0-rc1.md
@@ -0,0 +1,243 @@
+Notable changes
+===============
+
+Network Upgrade 4: Canopy
+--------------------------
+
+The code preparations for the Canopy network upgrade are finished and included in this release. The following ZIPs are being deployed:
+
+- [ZIP 207: Funding Streams](https://zips.z.cash/zip-0207)
+- [ZIP 211: Disabling Addition of New Value to the Sprout Value Pool](https://zips.z.cash/zip-0211)
+- [ZIP 212: Allow Recipient to Derive Sapling Ephemeral Secret from Note Plaintext](https://zips.z.cash/zip-0212)
+- [ZIP 214: Consensus rules for a Zcash Development Fund](https://zips.z.cash/zip-0214)
+- [ZIP 215: Explicitly Defining and Modifying Ed25519 Validation Rules](https://zips.z.cash/zip-0215)
+
+Canopy will activate on testnet at height TODO, and can also be activated at a specific height in regtest mode by setting the config option `-nuparams=0xe9ff75a6:HEIGHT`.
+
+Canopy will activate on mainnet at height 1046400.
+
+See [ZIP 251](https://zips.z.cash/zip-0251) for additional information about the deployment process for Canopy.
+
+Flush witness data to disk only when it's consistent
+-----------------------------------------------------
+This fix prevents the wallet database from getting into an inconsistent state. By flushing witness data to disk from the wallet thread instead of the main thread, we ensure that the on-disk block height is always the same as the witness data height. Previously, the database occasionally got into a state where the latest block height was one ahead of the witness data. This then triggered an assertion failure in `CWallet::IncrementNoteWitnesses()` upon restarting after a zcashd shutdown.
+
+Note that this code change will not automatically repair a data directory that has been affected by this problem; that requires starting zcashd with the `-rescan` or `-reindex` options.
+
+New DNS seeders
+----------------
+DNS seeders hosted at "zfnd.org" and "yolo.money" have been added to the list in `chainparams.cpp`. They're running [CoreDNS](https://coredns.io) with a [Zcash crawler plugin](https://github.com/ZcashFoundation/dnsseeder), the result of a Zcash Foundation in-house development effort to replace `zcash-seeder` with something memory-safe and easier to maintain.
+
+These are validly operated seeders per the [existing policy](https://zcash.readthedocs.io/en/latest/rtd_pages/dnsseed_policy.html). For general questions related to either seeder, contact george@zfnd.org or mention @gtank in the Zcash Foundation's Discord. For bug reports, open an issue on the [dnsseeder](https://github.com/ZcashFoundation/dnsseeder) repo.
+
+Changed command-line options
+-----------------------------
+- `-debuglogfile=<file>` can be used to specify an alternative debug logging file.
+
+RPC methods
+------------
+- `joinSplitPubKey` and `joinSplitSig` have been added to verbose transaction outputs. This enables the transaction's binary form to be fully reconstructed from the RPC output.
+- The output of `getblockchaininfo` now includes an `estimatedheight` parameter. This can be shown in UIs as an indication of the current chain height while `zcashd` is syncing, but should not be relied upon when creating transactions.
+
+Metrics screen
+-----------------------
+- A progress bar is now visible when in Initial Block Download mode, showing both the prefetched headers and validated blocks. It is only printed for TTY output. Additionally, the "not mining" message is no longer shown on mainnet, as the built-in CPU miner is not effective at the current network difficulty.
+- The number of block headers prefetched during Initial Block Download is now displayed alongside the number of validated blocks. With current compile-time defaults, a Zcash node prefetches up to 160 block headers per request without a limit on how far it can prefetch, but only up to 16 full blocks at a time.
+
+Changelog
+=========
+
+Alfredo Garcia (28):
+      add estimatedheight to getblockchaininfo
+      add documentation and command line parsing to afl scripts
+      get fuzzing options from directory
+      add bool argument to get balance in satoshis to rpc getreceivedbyaddress
+      add documentation to flag
+      change argument name
+      add boolean inZat to getreceivedbyaccount
+      add boolean inZat to getbalance
+      add boolean inZat to z_getbalance
+      add amountZat field to listreceivedbyaddress and listreceivedbyaccount
+      add amountZat field to listtransactions, gettransaction and listsinceblock
+      add amountZat field to listunspent
+      add amountZat field to z_listreceivedbyaddress
+      replace with AssertionError assert_equal in receivedby.py
+      Fix casting in wallet.py
+      simplify inzat balances logic
+      Fix casting in listtransactions.py
+      add MINOR_CURRENCY_UNIT
+      remove additional not needed casts from py tests
+      change name of harden option
+      fix test cases
+      fix sort of options
+      remove not needed comments from wallet.py
+      update docs
+      add new parameters to rpc client and fix some bugs
+      initialize size_t
+      fix/improve docs
+      add log aporximation to metrics solution rates
+
+Anthony Towns (1):
+      test: Add tests for `-debuglogfile` with subdirs
+
+Daira Hopwood (15):
+      Rename NU4 to Canopy in constant and function names.
+      Rename golden/nu4.tar.gz to canopy.tar.gz.
+      Missing NU4->Canopy renames.
+      Remove unused import in qa/rpc-tests/listtransactions.py
+      Remove an unused CCriticalSection.
+      Add GetActiveFundingStreams function.
+      Tests for changes to getblocksubsidy.
+      Change getblocksubsidy RPC to take into account funding streams.
+      Use ValueFromAmount instead of double arithmetic, and improve variable names.
+      Cosmetic spacing changes.
+      Apply suggestions from code review
+      Change the format of `getblocksubsidy` output to use an array of funding stream objects.
+      Clean up some iterator usage.
+      Remove an unnecessary iterator increment.
+      Another cleanup.
+
+Danny Willems (3):
+      librustzcash: make the header C compatible
+      Use assert.h instead of define manually static_assert
+      Use preprocessor for ENTRY_SERIALIZED_LENGTH
+
+Eirik Ogilvie-Wigley (2):
+      Resolve decimal vs float issues
+      Various improvements
+
+George Tankersley (1):
+      Add ZF and gtank's DNS seeders
+
+Jack Grigg (18):
+      Use the cached consensusBranchId in DisconnectBlock
+      qa: Smoke test driver
+      qa: Run Zcash node for smoke tests
+      qa: Simple smoke tests
+      qa: Transaction chain smoke test
+      qa: Use slick-bitcoinrpc for smoke tests
+      qa: Don't allow smoke tests with mainnet wallet.dat
+      qa: Improve reliability of smoke tests
+      qa: Improve reliability of smoke test cleanup
+      metrics: Fix indents
+      metrics: Draw IBD progress bar showing headers and blocks
+      metrics: Don't show "not mining" text for mainnet
+      qa: Add --use-faucet flag to smoke tests
+      qa: Remove unused timeout configuration from wait_for_balance
+      qa: Add --automate flag to smoke tests
+      metrics: Switch to ANSI colour codes for progress bar
+      metrics: Only print IBD progress bar on TTY
+      Implement zip-207 and zip-214.
+
+Kris Nuttycombe (29):
+      Identify `-fundingstream` parameter as being regtest-only
+      Use for..: rather than BOOST_FOREACH
+      Trivial error message fix.
+      Minor fixes for ZIP-207 review comments.
+      Trivial copyright fix.
+      Replace BOOST_FOREACH with for..:
+      Qualified imports of std:: types
+      Capitalization fixes from code review
+      Minor naming change FundingStreamShare -> FundingStreamElement
+      Record-constructor syntax for funding stream initialization.
+      Update HalvingHeight documentation.
+      Fix pyflakes.
+      Fix funding stream end-height-exclusion bugs
+      Add `RegtestDeactivateCanopy` calls to restore shared regtest params.
+      Move test-only code into test sources.
+      Trivial comment correction.
+      Minor help message correction.
+      Pass by const reference where possible.
+      Use uint32_t for vFundingStreams indexing.
+      Fix incorrect subtraction of Halving(blossomActivationHeight) from halvingIndex
+      Fix ordering of transparent outputs such that miner reward is vout[0]
+      Remove assertion that was breaking regtest in the case that blossom activates after the halving.
+      Use for..in rather than an indexed loop.
+      Make evident the relationship between chainparams and key IO.
+      Rename KeyInfo -> KeyConstants and move out of Consensus namespace.
+      Fix typo in constant.
+      Fix assertion check in GetBlockSubsidy
+      Apply suggestions from code review
+      Trivial whitespace fix.
+
+Larry Ruane (7):
+      add python test to reproduce bug 4301
+      flush witness cache correctly
+      review, cleanup: eliminate uninitialized variable
+      self.sync_all(), not time.sleep(4)
+      fix pyflakes CI errors
+      undo flushing witness data on shutdown
+      sync before stopping nodes
+
+Rod Vagg (1):
+      Add joinSplitPubKey and joinSplitSig to RPC
+
+Sean Bowe (23):
+      Add implementations of PRF_expand calls that obtain esk and rcm.
+      Remove bare SaplingNote constructor.
+      Add a getter method to obtain rcm from a Sapling note plaintext.
+      Add support for receiving v2 Sapling note plaintexts.
+      Change transaction builder and miner to use v2 Sapling note plaintexts after Canopy activates.
+      Make ed25519-zebra available via librustzcash.
+      Change to version of ed25519-zebra crate which is compliant with ZIP 215.
+      Enforce ZIP 215 rules upon activation of Canopy.
+      Add test that a weird signature successfully validates.
+      Remove bincode crate.
+      Remove unused curve25519-dalek dev-dependency.
+      Minor adjustments to librustzcash and tests.
+      Redirect git checkouts of ebfull/ed25519-zebra through our vendored sources in offline mode.
+      Require that shielded coinbase output note plaintexts are version 2 if Canopy is active.
+      Make transaction builder take the next block height into account for use of v2 note plaintexts.
+      Turn return values for libsodium-like API into constants for clarity.
+      Add more exhaustive tests for ZIP 215 compatibility.
+      Cargo fmt
+      Remove unused imports from remove_sprout_shielding RPC test.
+      Migrate ZIP 215 test vectors to gtest suite.
+      Change LIBSODIUM_ERROR to -1.
+      Hash "Zcash" to align tests with ZIP 215 test vectors.
+      Remove outdated comment.
+
+Solar Designer (2):
+      Fix typos in ProcessMessage() "headers"
+      During initial blocks download, also report the number of headers
+
+Taylor Hornby (3):
+      Fix undefined behavior in gtest tests
+      Add missing <stdexcept> header for std::invalid_argument
+      Fix bug in CScheduler
+
+Wladimir J. van der Laan (3):
+      Add `-debuglogfile` option
+      test: Add test for `-debuglogfile`
+      doc: Update release notes for `-debuglogfile`
+
+Marshall Gaucher (1):
+      Add helpers for tapping and donating to the testnet faucet
+
+therealyingtong (22):
+      Add RPC tests for post-Heartwood rollback
+      Reject v1 plaintexts after grace period
+      Check epk vs esk whenever caller has esk
+      Refactor SaplingNotePlaintext::decrypt
+      Add gtests for v2 plaintexts
+      Add contextual check to main.cpp
+      Add gtests
+      Add checks to z_ methods in rpcwallet
+      Add RPC tests
+      Replace leadByte in SaplingNote with is_zip_212
+      Throw error in plaintext deserialization
+      Pass pindex to AddToWalletIfInvolvingMe()
+      Remove plaintext check from AddSaplingSpend
+      Remove plaintext check from GetFilteredNotes
+      Refactor bool is_zip_212 to enum Zip212Enabled
+      Minor changes
+      Remove old SaplingNote() constructor
+      Pass nHeight instead of pindex to AddToWalletIfInvolvingMe()
+      Directly call RegtestActivate* in gtests
+      Update release notes for v3.1.0
+      make-release.py: Versioning changes for 3.1.0-rc1.
+      make-release.py: Updated manpages for 3.1.0-rc1.
+
+ying tong (1):
+      Apply suggestions from code review
+
diff --git a/depend/zcash/doc/release-notes/release-notes-3.1.0-rc2.md b/depend/zcash/doc/release-notes/release-notes-3.1.0-rc2.md
new file mode 100644
index 000000000..e3ec7680a
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-3.1.0-rc2.md
@@ -0,0 +1,250 @@
+Notable changes
+===============
+
+Network Upgrade 4: Canopy
+--------------------------
+
+The code preparations for the Canopy network upgrade are finished and included in this release. The following ZIPs are being deployed:
+
+- [ZIP 207: Funding Streams](https://zips.z.cash/zip-0207)
+- [ZIP 211: Disabling Addition of New Value to the Sprout Value Pool](https://zips.z.cash/zip-0211)
+- [ZIP 212: Allow Recipient to Derive Sapling Ephemeral Secret from Note Plaintext](https://zips.z.cash/zip-0212)
+- [ZIP 214: Consensus rules for a Zcash Development Fund](https://zips.z.cash/zip-0214)
+- [ZIP 215: Explicitly Defining and Modifying Ed25519 Validation Rules](https://zips.z.cash/zip-0215)
+
+Canopy will activate on testnet at height TODO, and can also be activated at a specific height in regtest mode by setting the config option `-nuparams=0xe9ff75a6:HEIGHT`. Note that v3.1.0-rc2 does not enable Canopy support on the testnet.
+
+Canopy will activate on mainnet at height 1046400.
+
+See [ZIP 251](https://zips.z.cash/zip-0251) for additional information about the deployment process for Canopy.
+
+Flush witness data to disk only when it's consistent
+-----------------------------------------------------
+This fix prevents the wallet database from getting into an inconsistent state. By flushing witness data to disk from the wallet thread instead of the main thread, we ensure that the on-disk block height is always the same as the witness data height. Previously, the database occasionally got into a state where the latest block height was one ahead of the witness data. This then triggered an assertion failure in `CWallet::IncrementNoteWitnesses()` upon restarting after a zcashd shutdown.
+
+Note that this code change will not automatically repair a data directory that has been affected by this problem; that requires starting zcashd with the `-rescan` or `-reindex` options.
+
+New DNS seeders
+----------------
+DNS seeders hosted at "zfnd.org" and "yolo.money" have been added to the list in `chainparams.cpp`. They're running [CoreDNS](https://coredns.io) with a [Zcash crawler plugin](https://github.com/ZcashFoundation/dnsseeder), the result of a Zcash Foundation in-house development effort to replace `zcash-seeder` with something memory-safe and easier to maintain.
+
+These are validly operated seeders per the [existing policy](https://zcash.readthedocs.io/en/latest/rtd_pages/dnsseed_policy.html). For general questions related to either seeder, contact george@zfnd.org or mention @gtank in the Zcash Foundation's Discord. For bug reports, open an issue on the [dnsseeder](https://github.com/ZcashFoundation/dnsseeder) repo.
+
+Changed command-line options
+-----------------------------
+- `-debuglogfile=<file>` can be used to specify an alternative debug logging file.
+
+RPC methods
+------------
+- `joinSplitPubKey` and `joinSplitSig` have been added to verbose transaction outputs. This enables the transaction's binary form to be fully reconstructed from the RPC output.
+- The output of `getblockchaininfo` now includes an `estimatedheight` parameter. This can be shown in UIs as an indication of the current chain height while `zcashd` is syncing, but should not be relied upon when creating transactions.
+
+Metrics screen
+-----------------------
+- A progress bar is now visible when in Initial Block Download mode, showing both the prefetched headers and validated blocks. It is only printed for TTY output. Additionally, the "not mining" message is no longer shown on mainnet, as the built-in CPU miner is not effective at the current network difficulty.
+- The number of block headers prefetched during Initial Block Download is now displayed alongside the number of validated blocks. With current compile-time defaults, a Zcash node prefetches up to 160 block headers per request without a limit on how far it can prefetch, but only up to 16 full blocks at a time.
+
+Changelog
+=========
+
+Alfredo Garcia (28):
+      add estimatedheight to getblockchaininfo
+      add documentation and command line parsing to afl scripts
+      get fuzzing options from directory
+      add bool argument to get balance in satoshis to rpc getreceivedbyaddress
+      add documentation to flag
+      change argument name
+      add boolean inZat to getreceivedbyaccount
+      add boolean inZat to getbalance
+      add boolean inZat to z_getbalance
+      add amountZat field to listreceivedbyaddress and listreceivedbyaccount
+      add amountZat field to listtransactions, gettransaction and listsinceblock
+      add amountZat field to listunspent
+      add amountZat field to z_listreceivedbyaddress
+      replace with AssertionError assert_equal in receivedby.py
+      Fix casting in wallet.py
+      simplify inzat balances logic
+      Fix casting in listtransactions.py
+      add MINOR_CURRENCY_UNIT
+      remove additional not needed casts from py tests
+      change name of harden option
+      fix test cases
+      fix sort of options
+      remove not needed comments from wallet.py
+      update docs
+      add new parameters to rpc client and fix some bugs
+      initialize size_t
+      fix/improve docs
+      add log aporximation to metrics solution rates
+
+Anthony Towns (1):
+      test: Add tests for `-debuglogfile` with subdirs
+
+Daira Hopwood (17):
+      Rename NU4 to Canopy in constant and function names.
+      Rename golden/nu4.tar.gz to canopy.tar.gz.
+      Missing NU4->Canopy renames.
+      Remove unused import in qa/rpc-tests/listtransactions.py
+      Remove an unused CCriticalSection.
+      Add GetActiveFundingStreams function.
+      Tests for changes to getblocksubsidy.
+      Change getblocksubsidy RPC to take into account funding streams.
+      Use ValueFromAmount instead of double arithmetic, and improve variable names.
+      Cosmetic spacing changes.
+      Apply suggestions from code review
+      Change the format of `getblocksubsidy` output to use an array of funding stream objects.
+      Clean up some iterator usage.
+      Remove an unnecessary iterator increment.
+      Another cleanup.
+      Add key_constants.h to src/Makefile.am.
+      Fix an unintended consensus change in decryption of coinbase outputs.
+
+Danny Willems (3):
+      librustzcash: make the header C compatible
+      Use assert.h instead of define manually static_assert
+      Use preprocessor for ENTRY_SERIALIZED_LENGTH
+
+Eirik Ogilvie-Wigley (2):
+      Resolve decimal vs float issues
+      Various improvements
+
+George Tankersley (1):
+      Add ZF and gtank's DNS seeders
+
+Jack Grigg (18):
+      Use the cached consensusBranchId in DisconnectBlock
+      qa: Smoke test driver
+      qa: Run Zcash node for smoke tests
+      qa: Simple smoke tests
+      qa: Transaction chain smoke test
+      qa: Use slick-bitcoinrpc for smoke tests
+      qa: Don't allow smoke tests with mainnet wallet.dat
+      qa: Improve reliability of smoke tests
+      qa: Improve reliability of smoke test cleanup
+      metrics: Fix indents
+      metrics: Draw IBD progress bar showing headers and blocks
+      metrics: Don't show "not mining" text for mainnet
+      qa: Add --use-faucet flag to smoke tests
+      qa: Remove unused timeout configuration from wait_for_balance
+      qa: Add --automate flag to smoke tests
+      metrics: Switch to ANSI colour codes for progress bar
+      metrics: Only print IBD progress bar on TTY
+      Implement zip-207 and zip-214.
+
+Kris Nuttycombe (30):
+      Identify `-fundingstream` parameter as being regtest-only
+      Use for..: rather than BOOST_FOREACH
+      Trivial error message fix.
+      Minor fixes for ZIP-207 review comments.
+      Trivial copyright fix.
+      Replace BOOST_FOREACH with for..:
+      Qualified imports of std:: types
+      Capitalization fixes from code review
+      Minor naming change FundingStreamShare -> FundingStreamElement
+      Record-constructor syntax for funding stream initialization.
+      Update HalvingHeight documentation.
+      Fix pyflakes.
+      Fix funding stream end-height-exclusion bugs
+      Add `RegtestDeactivateCanopy` calls to restore shared regtest params.
+      Move test-only code into test sources.
+      Trivial comment correction.
+      Minor help message correction.
+      Pass by const reference where possible.
+      Use uint32_t for vFundingStreams indexing.
+      Fix incorrect subtraction of Halving(blossomActivationHeight) from halvingIndex
+      Fix ordering of transparent outputs such that miner reward is vout[0]
+      Use ed25519-zebra from crates.io.
+      Remove assertion that was breaking regtest in the case that blossom activates after the halving.
+      Use for..in rather than an indexed loop.
+      Make evident the relationship between chainparams and key IO.
+      Rename KeyInfo -> KeyConstants and move out of Consensus namespace.
+      Fix typo in constant.
+      Fix assertion check in GetBlockSubsidy
+      Apply suggestions from code review
+      Trivial whitespace fix.
+
+Larry Ruane (7):
+      add python test to reproduce bug 4301
+      flush witness cache correctly
+      review, cleanup: eliminate uninitialized variable
+      self.sync_all(), not time.sleep(4)
+      fix pyflakes CI errors
+      undo flushing witness data on shutdown
+      sync before stopping nodes
+
+Rod Vagg (1):
+      Add joinSplitPubKey and joinSplitSig to RPC
+
+Sean Bowe (23):
+      Add implementations of PRF_expand calls that obtain esk and rcm.
+      Remove bare SaplingNote constructor.
+      Add a getter method to obtain rcm from a Sapling note plaintext.
+      Add support for receiving v2 Sapling note plaintexts.
+      Change transaction builder and miner to use v2 Sapling note plaintexts after Canopy activates.
+      Make ed25519-zebra available via librustzcash.
+      Change to version of ed25519-zebra crate which is compliant with ZIP 215.
+      Enforce ZIP 215 rules upon activation of Canopy.
+      Add test that a weird signature successfully validates.
+      Remove bincode crate.
+      Remove unused curve25519-dalek dev-dependency.
+      Minor adjustments to librustzcash and tests.
+      Redirect git checkouts of ebfull/ed25519-zebra through our vendored sources in offline mode.
+      Require that shielded coinbase output note plaintexts are version 2 if Canopy is active.
+      Make transaction builder take the next block height into account for use of v2 note plaintexts.
+      Turn return values for libsodium-like API into constants for clarity.
+      Add more exhaustive tests for ZIP 215 compatibility.
+      Cargo fmt
+      Remove unused imports from remove_sprout_shielding RPC test.
+      Migrate ZIP 215 test vectors to gtest suite.
+      Change LIBSODIUM_ERROR to -1.
+      Hash "Zcash" to align tests with ZIP 215 test vectors.
+      Remove outdated comment.
+
+Solar Designer (2):
+      Fix typos in ProcessMessage() "headers"
+      During initial blocks download, also report the number of headers
+
+Taylor Hornby (3):
+      Fix undefined behavior in gtest tests
+      Add missing <stdexcept> header for std::invalid_argument
+      Fix bug in CScheduler
+
+Wladimir J. van der Laan (3):
+      Add `-debuglogfile` option
+      test: Add test for `-debuglogfile`
+      doc: Update release notes for `-debuglogfile`
+
+Marshall Gaucher (1):
+      Add helpers for tapping and donating to the testnet faucet
+
+therealyingtong (26):
+      Add RPC tests for post-Heartwood rollback
+      Reject v1 plaintexts after grace period
+      Check epk vs esk whenever caller has esk
+      Refactor SaplingNotePlaintext::decrypt
+      Add gtests for v2 plaintexts
+      Add contextual check to main.cpp
+      Add gtests
+      Add checks to z_ methods in rpcwallet
+      Add RPC tests
+      Replace leadByte in SaplingNote with is_zip_212
+      Throw error in plaintext deserialization
+      Pass pindex to AddToWalletIfInvolvingMe()
+      Remove plaintext check from AddSaplingSpend
+      Remove plaintext check from GetFilteredNotes
+      Refactor bool is_zip_212 to enum Zip212Enabled
+      Minor changes
+      Remove old SaplingNote() constructor
+      Pass nHeight instead of pindex to AddToWalletIfInvolvingMe()
+      Directly call RegtestActivate* in gtests
+      Update release notes for v3.1.0
+      make-release.py: Versioning changes for 3.1.0-rc1.
+      make-release.py: Updated manpages for 3.1.0-rc1.
+      make-release.py: Updated release notes and changelog for 3.1.0-rc1.
+      Undo manual DEPRECATION_HEIGHT
+      make-release.py: Versioning changes for 3.1.0-rc2.
+      make-release.py: Updated manpages for 3.1.0-rc2.
+
+ying tong (1):
+      Apply suggestions from code review
+
diff --git a/depend/zcash/doc/release-notes/release-notes-3.1.0.md b/depend/zcash/doc/release-notes/release-notes-3.1.0.md
new file mode 100644
index 000000000..b96995c95
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-3.1.0.md
@@ -0,0 +1,274 @@
+Notable changes
+===============
+
+Network Upgrade 4: Canopy
+--------------------------
+
+The code preparations for the Canopy network upgrade are finished and included in this release. The following ZIPs are being deployed:
+
+- [ZIP 207: Funding Streams](https://zips.z.cash/zip-0207)
+- [ZIP 211: Disabling Addition of New Value to the Sprout Value Pool](https://zips.z.cash/zip-0211)
+- [ZIP 212: Allow Recipient to Derive Sapling Ephemeral Secret from Note Plaintext](https://zips.z.cash/zip-0212)
+- [ZIP 214: Consensus rules for a Zcash Development Fund](https://zips.z.cash/zip-0214)
+- [ZIP 215: Explicitly Defining and Modifying Ed25519 Validation Rules](https://zips.z.cash/zip-0215)
+
+Canopy will activate on testnet at height 1028500, and can also be activated at a specific height in regtest mode by setting the config option `-nuparams=0xe9ff75a6:HEIGHT`. Note that v3.1.0 enables Canopy support on the testnet.
+
+Canopy will activate on mainnet at height 1046400.
+
+See [ZIP 251](https://zips.z.cash/zip-0251) for additional information about the deployment process for Canopy.
+
+Debian 8 "Jessie" will no longer be supported after v3.1.0, due to its [end-of-life](https://www.debian.org/News/2020/20200709#:~:text=The%20Debian%20Long%20Term%20Support,security%20updates%20for%20Debian%208) on June 30th, 2020. This will allow us to direct more resources to supporting Debian 10 Buster, other Linux distributions, and other platforms such as Windows and macOS.
+
+Flush witness data to disk only when it's consistent
+-----------------------------------------------------
+This fix prevents the wallet database from getting into an inconsistent state. By flushing witness data to disk from the wallet thread instead of the main thread, we ensure that the on-disk block height is always the same as the witness data height. Previously, the database occasionally got into a state where the latest block height was one ahead of the witness data. This then triggered an assertion failure in `CWallet::IncrementNoteWitnesses()` upon restarting after a zcashd shutdown.
+
+Note that this code change will not automatically repair a data directory that has been affected by this problem; that requires starting zcashd with the `-rescan` or `-reindex` options.
+
+New DNS seeders
+----------------
+DNS seeders hosted at "zfnd.org" and "yolo.money" have been added to the list in `chainparams.cpp`. They're running [CoreDNS](https://coredns.io) with a [Zcash crawler plugin](https://github.com/ZcashFoundation/dnsseeder), the result of a Zcash Foundation in-house development effort to replace `zcash-seeder` with something memory-safe and easier to maintain.
+
+These are validly operated seeders per the [existing policy](https://zcash.readthedocs.io/en/latest/rtd_pages/dnsseed_policy.html). For general questions related to either seeder, contact george@zfnd.org or mention @gtank in the Zcash Foundation's Discord. For bug reports, open an issue on the [dnsseeder](https://github.com/ZcashFoundation/dnsseeder) repo.
+
+Changed command-line options
+-----------------------------
+- `-debuglogfile=<file>` can be used to specify an alternative debug logging file.
+
+RPC methods
+------------
+- `joinSplitPubKey` and `joinSplitSig` have been added to verbose transaction outputs. This enables the transaction's binary form to be fully reconstructed from the RPC output.
+- The output of `getblockchaininfo` now includes an `estimatedheight` parameter. This can be shown in UIs as an indication of the current chain height while `zcashd` is syncing, but should not be relied upon when creating transactions.
+
+Metrics screen
+-----------------------
+- A progress bar is now visible when in Initial Block Download mode, showing both the prefetched headers and validated blocks. It is only printed for TTY output. Additionally, the "not mining" message is no longer shown on mainnet, as the built-in CPU miner is not effective at the current network difficulty.
+- The number of block headers prefetched during Initial Block Download is now displayed alongside the number of validated blocks. With current compile-time defaults, a Zcash node prefetches up to 160 block headers per request without a limit on how far it can prefetch, but only up to 16 full blocks at a time.
+
+Changelog
+=========
+
+Alfredo Garcia (28):
+      add estimatedheight to getblockchaininfo
+      add documentation and command line parsing to afl scripts
+      get fuzzing options from directory
+      add bool argument to get balance in satoshis to rpc getreceivedbyaddress
+      add documentation to flag
+      change argument name
+      add boolean inZat to getreceivedbyaccount
+      add boolean inZat to getbalance
+      add boolean inZat to z_getbalance
+      add amountZat field to listreceivedbyaddress and listreceivedbyaccount
+      add amountZat field to listtransactions, gettransaction and listsinceblock
+      add amountZat field to listunspent
+      add amountZat field to z_listreceivedbyaddress
+      replace with AssertionError assert_equal in receivedby.py
+      Fix casting in wallet.py
+      simplify inzat balances logic
+      Fix casting in listtransactions.py
+      add MINOR_CURRENCY_UNIT
+      remove additional not needed casts from py tests
+      change name of harden option
+      fix test cases
+      fix sort of options
+      remove not needed comments from wallet.py
+      update docs
+      add new parameters to rpc client and fix some bugs
+      initialize size_t
+      fix/improve docs
+      add log aporximation to metrics solution rates
+
+Anthony Towns (1):
+      test: Add tests for `-debuglogfile` with subdirs
+
+Daira Hopwood (24):
+      Rename NU4 to Canopy in constant and function names.
+      Rename golden/nu4.tar.gz to canopy.tar.gz.
+      Missing NU4->Canopy renames.
+      Remove unused import in qa/rpc-tests/listtransactions.py
+      Remove an unused CCriticalSection.
+      Add GetActiveFundingStreams function.
+      Tests for changes to getblocksubsidy.
+      Change getblocksubsidy RPC to take into account funding streams.
+      Use ValueFromAmount instead of double arithmetic, and improve variable names.
+      Cosmetic spacing changes.
+      Apply suggestions from code review
+      Change the format of `getblocksubsidy` output to use an array of funding stream objects.
+      Clean up some iterator usage.
+      Remove an unnecessary iterator increment.
+      Another cleanup.
+      Add key_constants.h to src/Makefile.am.
+      Fix an unintended consensus change in decryption of coinbase outputs.
+      More iterator cleanups.
+      src/metrics.cpp: cosmetic whitespace changes.
+      Metrics screen: display hash rates using SI prefixes rather than as powers of 2.
+      Add unit tests for DisplayDuration, DisplaySize, and DisplayHashRate.
+      Fix the formatting of the 3.0.0 release notes.
+      Fix --disable-mining build regression. closes #4634
+      Allow Equihash validation tests to be compiled with --disable-mining.
+
+Danny Willems (3):
+      librustzcash: make the header C compatible
+      Use assert.h instead of define manually static_assert
+      Use preprocessor for ENTRY_SERIALIZED_LENGTH
+
+Eirik Ogilvie-Wigley (2):
+      Resolve decimal vs float issues
+      Various improvements
+
+George Tankersley (1):
+      Add ZF and gtank's DNS seeders
+
+Jack Grigg (21):
+      Use the cached consensusBranchId in DisconnectBlock
+      qa: Smoke test driver
+      qa: Run Zcash node for smoke tests
+      qa: Simple smoke tests
+      qa: Transaction chain smoke test
+      qa: Use slick-bitcoinrpc for smoke tests
+      qa: Don't allow smoke tests with mainnet wallet.dat
+      qa: Improve reliability of smoke tests
+      qa: Improve reliability of smoke test cleanup
+      metrics: Fix indents
+      metrics: Draw IBD progress bar showing headers and blocks
+      metrics: Don't show "not mining" text for mainnet
+      qa: Add --use-faucet flag to smoke tests
+      qa: Remove unused timeout configuration from wait_for_balance
+      qa: Add --automate flag to smoke tests
+      metrics: Switch to ANSI colour codes for progress bar
+      metrics: Only print IBD progress bar on TTY
+      Implement zip-207 and zip-214.
+      Use Rust Equihash validator unconditionally
+      Remove C++ Equihash validator
+      Revert "Pass the block height through to CheckEquihashSolution()"
+
+Kris Nuttycombe (31):
+      Identify `-fundingstream` parameter as being regtest-only
+      Use for..: rather than BOOST_FOREACH
+      Trivial error message fix.
+      Minor fixes for ZIP-207 review comments.
+      Trivial copyright fix.
+      Replace BOOST_FOREACH with for..:
+      Qualified imports of std:: types
+      Capitalization fixes from code review
+      Minor naming change FundingStreamShare -> FundingStreamElement
+      Record-constructor syntax for funding stream initialization.
+      Update HalvingHeight documentation.
+      Fix pyflakes.
+      Fix funding stream end-height-exclusion bugs
+      Add `RegtestDeactivateCanopy` calls to restore shared regtest params.
+      Move test-only code into test sources.
+      Trivial comment correction.
+      Minor help message correction.
+      Pass by const reference where possible.
+      Use uint32_t for vFundingStreams indexing.
+      Fix incorrect subtraction of Halving(blossomActivationHeight) from halvingIndex
+      Fix ordering of transparent outputs such that miner reward is vout[0]
+      Use ed25519-zebra from crates.io.
+      Remove assertion that was breaking regtest in the case that blossom activates after the halving.
+      Use for..in rather than an indexed loop.
+      Make evident the relationship between chainparams and key IO.
+      Rename KeyInfo -> KeyConstants and move out of Consensus namespace.
+      Fix typo in constant.
+      Fix assertion check in GetBlockSubsidy
+      Apply suggestions from code review
+      Trivial whitespace fix.
+      Zero-initialize HistoryNode values.
+
+Larry Ruane (7):
+      add python test to reproduce bug 4301
+      flush witness cache correctly
+      review, cleanup: eliminate uninitialized variable
+      self.sync_all(), not time.sleep(4)
+      fix pyflakes CI errors
+      undo flushing witness data on shutdown
+      sync before stopping nodes
+
+Rod Vagg (1):
+      Add joinSplitPubKey and joinSplitSig to RPC
+
+Sean Bowe (23):
+      Add implementations of PRF_expand calls that obtain esk and rcm.
+      Remove bare SaplingNote constructor.
+      Add a getter method to obtain rcm from a Sapling note plaintext.
+      Add support for receiving v2 Sapling note plaintexts.
+      Change transaction builder and miner to use v2 Sapling note plaintexts after Canopy activates.
+      Make ed25519-zebra available via librustzcash.
+      Change to version of ed25519-zebra crate which is compliant with ZIP 215.
+      Enforce ZIP 215 rules upon activation of Canopy.
+      Add test that a weird signature successfully validates.
+      Remove bincode crate.
+      Remove unused curve25519-dalek dev-dependency.
+      Minor adjustments to librustzcash and tests.
+      Redirect git checkouts of ebfull/ed25519-zebra through our vendored sources in offline mode.
+      Require that shielded coinbase output note plaintexts are version 2 if Canopy is active.
+      Make transaction builder take the next block height into account for use of v2 note plaintexts.
+      Turn return values for libsodium-like API into constants for clarity.
+      Add more exhaustive tests for ZIP 215 compatibility.
+      Cargo fmt
+      Remove unused imports from remove_sprout_shielding RPC test.
+      Migrate ZIP 215 test vectors to gtest suite.
+      Change LIBSODIUM_ERROR to -1.
+      Hash "Zcash" to align tests with ZIP 215 test vectors.
+      Remove outdated comment.
+
+Solar Designer (2):
+      Fix typos in ProcessMessage() "headers"
+      During initial blocks download, also report the number of headers
+
+Taylor Hornby (3):
+      Fix undefined behavior in gtest tests
+      Add missing <stdexcept> header for std::invalid_argument
+      Fix bug in CScheduler
+
+Wladimir J. van der Laan (3):
+      Add `-debuglogfile` option
+      test: Add test for `-debuglogfile`
+      doc: Update release notes for `-debuglogfile`
+
+ewillbefull@gmail.com (1):
+      Add dev fund addresses for testnet NU4 activation.
+
+Marshall Gaucher (1):
+      Add helpers for tapping and donating to the testnet faucet
+
+therealyingtong (35):
+      Add RPC tests for post-Heartwood rollback
+      Reject v1 plaintexts after grace period
+      Check epk vs esk whenever caller has esk
+      Refactor SaplingNotePlaintext::decrypt
+      Add gtests for v2 plaintexts
+      Add contextual check to main.cpp
+      Add gtests
+      Add checks to z_ methods in rpcwallet
+      Add RPC tests
+      Replace leadByte in SaplingNote with is_zip_212
+      Throw error in plaintext deserialization
+      Pass pindex to AddToWalletIfInvolvingMe()
+      Remove plaintext check from AddSaplingSpend
+      Remove plaintext check from GetFilteredNotes
+      Refactor bool is_zip_212 to enum Zip212Enabled
+      Minor changes
+      Remove old SaplingNote() constructor
+      Pass nHeight instead of pindex to AddToWalletIfInvolvingMe()
+      Directly call RegtestActivate* in gtests
+      Update release notes for v3.1.0
+      make-release.py: Versioning changes for 3.1.0-rc1.
+      make-release.py: Updated manpages for 3.1.0-rc1.
+      make-release.py: Updated release notes and changelog for 3.1.0-rc1.
+      Undo manual DEPRECATION_HEIGHT
+      make-release.py: Versioning changes for 3.1.0-rc2.
+      make-release.py: Updated manpages for 3.1.0-rc2.
+      make-release.py: Updated release notes and changelog for 3.1.0-rc2.
+      Edit release notes to specify that rc2 does not enable Canopy support on the testnet
+      Set Canopy testnet activation height to 1020500
+      Set PROTOCOL_VERSION to 170012
+      Pass HistoryNode struct to librustzcash FFI
+      Delay testnet activation height by one week
+      Use 51 Testnet Dev Fund addresses, and adjust the end heights.
+      make-release.py: Versioning changes for 3.1.0.
+      make-release.py: Updated manpages for 3.1.0.
+
+ying tong (1):
+      Apply suggestions from code review
diff --git a/depend/zcash/doc/release-notes/release-notes-4.0.0-rc1.md b/depend/zcash/doc/release-notes/release-notes-4.0.0-rc1.md
new file mode 100644
index 000000000..b25b85ebd
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-4.0.0-rc1.md
@@ -0,0 +1,276 @@
+Notable changes
+===============
+
+The mainnet activation of the Canopy network upgrade is supported by the 4.0.0
+release, with an activation height of 1046400, which should occur roughly in the
+middle of November — following the targeted EOS halt of our 3.1.0 release.
+Please upgrade to this release, or any subsequent release, in order to follow
+the Canopy network upgrade.
+
+The following ZIPs are being deployed as part of this upgrade:
+
+* [ZIP 207: Funding Streams](https://zips.z.cash/zip-0207) in conjunction with [ZIP 214: Consensus rules for a Zcash Development Fund](https://zips.z.cash/zip-0214)
+* [ZIP 211: Disabling Addition of New Value to the Sprout Value Pool](https://zips.z.cash/zip-0211)
+* [ZIP 212: Allow Recipient to Derive Sapling Ephemeral Secret from Note Plaintext](https://zips.z.cash/zip-0212)
+* [ZIP 215: Explicitly Defining and Modifying Ed25519 Validation Rules](https://zips.z.cash/zip-0215)
+
+In order to help the ecosystem prepare for the mainnet activation, Canopy has
+already been activated on the Zcash testnet. Any node version 3.1.0 or higher,
+including this release, supports the Canopy activation on testnet.
+
+Disabling new value in the Sprout value pool
+--------------------------------------------
+
+After the mainnet activation of Canopy, it will not be possible to send funds to
+Sprout z-addresses from any _other_ kind of address, as described in [ZIP 211](https://zips.z.cash/zip-0211).
+It will still be possible to send funds _from_ a Sprout z-address and to send
+funds between Sprout addresses. Users of Sprout z-addresses are encouraged to
+use Sapling z-addresses instead, and to migrate their remaining Sprout funds
+into a Sapling z-address using the migration utility in zcashd: set `migrate=1`
+in your `zcash.conf` file, or use the `z_setmigration` RPC.
+
+New logging system
+------------------
+
+The `zcashd` logging system is now powered by the Rust `tracing` crate. This
+has two main benefits:
+
+- `tracing` supports the concept of "spans", which represent periods of time
+  with a beginning and end. These enable logging additional information about
+  temporality and causality of events. (Regular log lines, which represent
+  moments in time, are called `events` in `tracing`.)
+- Spans and events are structured, and can record typed data in addition to text
+  messages. This structure can then be filtered dynamically.
+
+The existing `-debug=target` config flags are mapped to `tracing` log filters,
+and will continue to correctly enable additional logging when starting `zcashd`.
+A new `setlogfilter` RPC method has been introduced that enables reconfiguring
+the log filter at runtime. See `zcash-cli help setlogfilter` for its syntax.
+
+As a minor note, `zcashd` no longer reopens the `debug.log` file on `SIGHUP`.
+This behaviour was originally introduced in upstream Bitcoin Core to support log
+rotation using external tools. `tracing` supports log rotation internally (which
+is currently disabled), as well as a variety of interesting backends (such as
+`journald` and OpenTelemetry integration); we are investigating how these might
+be exposed in future releases.
+
+Compatibility
+-------------
+macOS versions earlier than 10.12 (Sierra) are no longer supported.
+
+Changelog
+=========
+
+Alfredo Garcia (3):
+      only allow duplicates for certain options of the config
+      install bdb binaries
+      add more allowed duplicates
+
+Andrew Chow (1):
+      Fix naming of macOS SDK and clarify version
+
+Carl Dong (8):
+      contrib: macdeploy: Correctly generate macOS SDK
+      Adapt rest of tooling to new SDK naming scheme
+      native_cctools: Don't use libc++ from pinned clang
+      contrib: macdeploy: Use apple-sdk-tools instead of xar+pbzx
+      contrib: macdeploy: Remove historical extraction notes
+      depends: Decouple toolchain + binutils
+      depends: Specify path to native binaries as clang argument
+      depends: Add justifications for macOS clang flags
+
+Charlie O'Keefe (1):
+      Remove 'jessie' (debian 8) from suites list in linux gitian descriptors
+
+Cory Fields (14):
+      crypto: add AES 128/256 CBC classes
+      crypto: add aes cbc tests
+      crypter: fix the stored initialization vector size
+      crypter: constify encrypt/decrypt
+      crypter: hook up the new aes cbc classes
+      crypter: add a BytesToKey clone to replace the use of openssl
+      crypter: add tests for crypter
+      build: Enumerate ctaes rather than globbing
+      depends: bump MacOS toolchain
+      macos: Bump to xcode 11.3.1 and 10.15 SDK
+      darwin: pass mlinker-version so that clang enables new features
+      depends: specify libc++ header location for darwin
+      depends: enable lto support for Apple's ld64
+      depends: bump native_cctools for fixed lto with external clang
+
+Daira Hopwood (6):
+      zcutil/distclean.sh: remove BDB utility programs.
+      Update .gitignore.
+      Fix a return status issue.
+      Update Makefile.am
+      Newer version of checksec.sh from https://github.com/slimm609/checksec.sh/commit/a6df608ac077689b2160e521db6601abc7b9e26e
+      Repair full_test_suite.py for new checksec.sh.
+
+Dimitris Apostolou (1):
+      Remove deprecated contrib utilities
+
+Jack Grigg (67):
+      Move GrothProof and SproutProof definitions into zcash/Proof.hpp
+      Remove unused declarations left over from libsnark verification
+      Make ZCJoinSplit::prove static and remove ZCJoinSplit globals
+      Move ProofVerifier out of the libzcash namespace
+      Move JSDescription::Verify to ProofVerifier::VerifySprout
+      Skip Sprout proof verification for ProofVerifier::Disabled
+      Send alert to put pre-Heartwood nodes into safe mode.
+      Squashed 'src/crypto/ctaes/' content from commit 003a4acfc
+      build: shuffle gtest Makefile so that crypto can be used by the wallet
+      metrics: Collect general stats before clearing screen
+      Debian: Add copyright entries for ctaes and secp256k1
+      Revert "Rename FALLBACK_DOWNLOAD_PATH to PRIORITY_DOWNLOAD_PATH"
+      Revert "Try downloading from our mirror first to avoid headaches."
+      depends: Use FALLBACK_DOWNLOAD_PATH if the primary's hash doesn't match
+      test: Remove obsolete TransactionBuilder test
+      Add tracing to librustzcash dependencies
+      FFI wrapper around tracing crate
+      Replace C++ logging with tracing logging
+      Use a tracing EnvFilter directive for -debug flags
+      Add support for reloading the tracing filter
+      Add an RPC method for setting the tracing filter directives
+      Add support for tracing spans
+      Add some spans to the Zcash codebase
+      FFI: Extract common codeunit types into a rust/types.h header
+      tracing: Use 'static constexpr' hack in macros
+      wallet: Fix logging to satisfy constexpr requirements
+      FFI: Add missing <stddef.h> includes
+      init: Place additional constraints on pathDebug
+      rpc: Throw error in setlogfilter if filter reloading fails
+      tracing: Log field values that aren't valid UTF-8
+      tracing: Document macro arguments that MUST be static constant UTF-8 strings
+      doc: Update release notes for tracing backend
+      qa: Add tracing dependencies to updatecheck.py
+      depends: tracing-core 0.1.13
+      Revert "Add check-depends step to STAGE_COMMANDS list"
+      contrib: Update macdeploy README
+      depends: Rework Rust integration
+      depends: Add platform-specific overrides for download files
+      depends: Split check-packages and check-sources across categories
+      FFI: Fix tracing log path handling on Windows
+      tracing: Add MAP macro
+      tracing: Add support for event fields
+      tracing: Add support for span fields
+      tracing: Format field values with Display
+      Add fields to logging in CNode and UpdateTip
+      util: Use DEBUG level for LogPrint(), leaving INFO for LogPrintf()
+      tracing: Parse log_path into an Option<Path>
+      tracing: Rework tracing_init into a single function
+      init: Rework tracing_init call
+      init: Add spans for initialization and shutdown
+      Replace libsodium's randombytes_buf with rand_core::OsRng::fill_bytes
+      consensus: Add assertions for Params::HalvingHeight parameters
+      consensus: Document the empty conditional branch in ContextualCheckBlock
+      consensus: Statically check funding stream numerators and denominators
+      consensus: Clearly gate active funding stream elements on Canopy
+      Replace libsodium's crypto_sign with ed25519-zebra
+      ed25519: Panic (triggering abort) if nullptr passed into APIs
+      test: Update ZIP 215 test cases from ed25519-zebra
+      depends: Migrate to zcash_* 0.3.0 Rust crates
+      FFI: Remove circuit parameter hashes from librustzcash_init_zksnark_params
+      FFI: Migrate to bls12_381 and jubjub crates
+      depends: cargo update
+      qa: Update list of postponed crate versions
+      FFI: Rename to librustzcash_sapling_compute_cmu
+      FFI: Rename r to rcm
+      debian: Rename X11 to Expat-with-advertising-clause in copyright
+      Adjust GetActiveFundingStream* comments
+
+Kris Nuttycombe (13):
+      Remove amqp code and Proton library depenencies & flags.
+      Remove Proton license from contrib/debian/copyright
+      consensus: Clean up some whitespace and variable names
+      consensus: Refactor Sprout contextual rules to match the rest
+      consensus: Remove canopyActive gate around GetActiveFundingStreamElements
+      consensus: Combine heartwoodActive conditionals
+      consensus: Add a placeholder for !canopyActive
+      consensus: Move overwinterActive rules ahead of saplingActive rules
+      consensus: Combine saplingActive conditionals
+      consensus: Move Sapling-disabled Overwinter rules above Sapling rules
+      consensus: Reorder Overwinter+!Sapling rules
+      consensus: Remove redundant contextual consensus rules
+      Add comment in lieu of redundant overwinter version check & fix tests.
+
+Larry Ruane (2):
+      flush wallet db (SetBestChain()) on clean shutdown
+      wallet: lock cs_main while accessing chainActive
+
+LongShao007 (1):
+      fix bug of bdb.mk
+
+Per Grön (11):
+      Get rid of implicit hidden dependencies between test .cpp files
+      Add missing #includes to test_block.cpp
+      Add actual header file for utilities in gtest/utils.cpp
+      Fix linkage issue with consts in primitives/block.h
+      Remove Checkpoints_tests.cpp
+      libsnark: Don't (implicitly) rely on other tests initializing the public params
+      Add missing libsnark initialization call
+      Don't clobber cwd in rpc_wallet_tests.cpp
+      Include header files within the source tree using "" instead of <>
+      Be consistent about what path to include bitcoin-config.h with
+      Be consistent with how to #include test data headers
+
+Pieter Wuille (1):
+      Add ctaes-based constant time AES implementation
+
+Sean Bowe (4):
+      Postpone boost 1.74.0 update
+      Postpone rust updates
+      make-release.py: Versioning changes for 4.0.0-rc1.
+      make-release.py: Updated manpages for 4.0.0-rc1.
+
+Taylor Hornby (5):
+      Implement system for postponing dependency updates.
+      Change release instructions to block the release when dependencies are not updated and not postponed.
+      Enforce pre-release dependency update check in make-release.py
+      Extend deadline for postponing dependency updates
+      Add new dependencies to updatecheck.py, add a flag we can use to have our CI test it.
+
+Ariel Gabizon (1):
+      explain expiry error
+
+Benjamin Winston (2):
+      Added support for afl-clang-fast.
+      Added libfuzzer support.
+
+elbandi (3):
+      Allow configure params directory
+      Add paramsdir option for manpage
+      Throw error if -paramsdir not a valid directory
+
+fanquake (8):
+      depends: set OSX_MIN_VERSION to 10.10
+      doc: mention that macOS 10.10 is now required
+      scripted-diff: prefer MAC_OSX over __APPLE__
+      build: set minimum supported macOS to 10.12
+      depends: clang 6.0.1
+      depends: native_cctools 921, ld64 409.12, libtapi 1000.10.8
+      build: use macOS 10.14 SDK
+      doc: explain why passing -mlinker-version is required
+
+noname45688@gmail.com (2):
+      Updating to Python 3
+      Update to Python 3
+
+teor (1):
+      Fix a comment typo in pow.cpp
+
+Ying Tong Lai (11):
+      Add Debian8 deprecation to release notes
+      Add missing curly braces after if statement
+      Add test for garbage memory in history nodes
+      Add documentation specific to ZIP 212
+      Move esk derivation check to beginning of plaintext_checks_without_height()
+      Define PRF diversifiers in prf.h
+      assert(leadbyte == 0x02) after every if(leadbyte != 0x01)
+      Update doc/release-notes/release-notes-3.1.0.md
+      Make sure garbage bytes are different
+      Rename PRV_DIVERSIFIER to PRF_TAG
+      Add link to ZIP212 in coinbase comment
+
+Zancas Wilcox (1):
+      make deprecation.h include consensus/params.h
+
diff --git a/depend/zcash/doc/release-notes/release-notes-4.0.0.md b/depend/zcash/doc/release-notes/release-notes-4.0.0.md
new file mode 100644
index 000000000..cd675c434
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-4.0.0.md
@@ -0,0 +1,290 @@
+Notable changes
+===============
+
+The mainnet activation of the Canopy network upgrade is supported by the 4.0.0
+release, with an activation height of 1046400, which should occur roughly in the
+middle of November — following the targeted EOS halt of our 3.1.0 release.
+Please upgrade to this release, or any subsequent release, in order to follow
+the Canopy network upgrade.
+
+The following ZIPs are being deployed as part of this upgrade:
+
+* [ZIP 207: Funding Streams](https://zips.z.cash/zip-0207) in conjunction with [ZIP 214: Consensus rules for a Zcash Development Fund](https://zips.z.cash/zip-0214)
+* [ZIP 211: Disabling Addition of New Value to the Sprout Value Pool](https://zips.z.cash/zip-0211)
+* [ZIP 212: Allow Recipient to Derive Sapling Ephemeral Secret from Note Plaintext](https://zips.z.cash/zip-0212)
+* [ZIP 215: Explicitly Defining and Modifying Ed25519 Validation Rules](https://zips.z.cash/zip-0215)
+
+In order to help the ecosystem prepare for the mainnet activation, Canopy has
+already been activated on the Zcash testnet. Any node version 3.1.0 or higher,
+including this release, supports the Canopy activation on testnet.
+
+Disabling new value in the Sprout value pool
+--------------------------------------------
+
+After the mainnet activation of Canopy, it will not be possible to send funds to
+Sprout z-addresses from any _other_ kind of address, as described in [ZIP 211](https://zips.z.cash/zip-0211).
+It will still be possible to send funds _from_ a Sprout z-address and to send
+funds between Sprout addresses. Users of Sprout z-addresses are encouraged to
+use Sapling z-addresses instead, and to migrate their remaining Sprout funds
+into a Sapling z-address using the migration utility in zcashd: set `migrate=1`
+in your `zcash.conf` file, or use the `z_setmigration` RPC.
+
+New logging system
+------------------
+
+The `zcashd` logging system is now powered by the Rust `tracing` crate. This
+has two main benefits:
+
+- `tracing` supports the concept of "spans", which represent periods of time
+  with a beginning and end. These enable logging additional information about
+  temporality and causality of events. (Regular log lines, which represent
+  moments in time, are called `events` in `tracing`.)
+- Spans and events are structured, and can record typed data in addition to text
+  messages. This structure can then be filtered dynamically.
+
+The existing `-debug=target` config flags are mapped to `tracing` log filters,
+and will continue to correctly enable additional logging when starting `zcashd`.
+A new `setlogfilter` RPC method has been introduced that enables reconfiguring
+the log filter at runtime. See `zcash-cli help setlogfilter` for its syntax.
+
+As a minor note, `zcashd` no longer reopens the `debug.log` file on `SIGHUP`.
+This behaviour was originally introduced in upstream Bitcoin Core to support log
+rotation using external tools. `tracing` supports log rotation internally (which
+is currently disabled), as well as a variety of interesting backends (such as
+`journald` and OpenTelemetry integration); we are investigating how these might
+be exposed in future releases.
+
+Compatibility
+-------------
+macOS versions earlier than 10.12 (Sierra) are no longer supported.
+
+Changelog
+=========
+
+Alfredo Garcia (3):
+      only allow duplicates for certain options of the config
+      install bdb binaries
+      add more allowed duplicates
+
+Andrew Chow (1):
+      Fix naming of macOS SDK and clarify version
+
+Carl Dong (8):
+      contrib: macdeploy: Correctly generate macOS SDK
+      Adapt rest of tooling to new SDK naming scheme
+      native_cctools: Don't use libc++ from pinned clang
+      contrib: macdeploy: Use apple-sdk-tools instead of xar+pbzx
+      contrib: macdeploy: Remove historical extraction notes
+      depends: Decouple toolchain + binutils
+      depends: Specify path to native binaries as clang argument
+      depends: Add justifications for macOS clang flags
+
+Charlie O'Keefe (1):
+      Remove 'jessie' (debian 8) from suites list in linux gitian descriptors
+
+Cory Fields (14):
+      crypto: add AES 128/256 CBC classes
+      crypto: add aes cbc tests
+      crypter: fix the stored initialization vector size
+      crypter: constify encrypt/decrypt
+      crypter: hook up the new aes cbc classes
+      crypter: add a BytesToKey clone to replace the use of openssl
+      crypter: add tests for crypter
+      build: Enumerate ctaes rather than globbing
+      depends: bump MacOS toolchain
+      macos: Bump to xcode 11.3.1 and 10.15 SDK
+      darwin: pass mlinker-version so that clang enables new features
+      depends: specify libc++ header location for darwin
+      depends: enable lto support for Apple's ld64
+      depends: bump native_cctools for fixed lto with external clang
+
+Daira Hopwood (7):
+      zcutil/distclean.sh: remove BDB utility programs.
+      Update .gitignore.
+      Fix a return status issue.
+      Update Makefile.am
+      Newer version of checksec.sh from https://github.com/slimm609/checksec.sh/commit/a6df608ac077689b2160e521db6601abc7b9e26e
+      Repair full_test_suite.py for new checksec.sh.
+      Clarify a comment about the ZF and MG addresses
+
+Dimitris Apostolou (1):
+      Remove deprecated contrib utilities
+
+Jack Grigg (65):
+      Move GrothProof and SproutProof definitions into zcash/Proof.hpp
+      Remove unused declarations left over from libsnark verification
+      Make ZCJoinSplit::prove static and remove ZCJoinSplit globals
+      Move ProofVerifier out of the libzcash namespace
+      Move JSDescription::Verify to ProofVerifier::VerifySprout
+      Skip Sprout proof verification for ProofVerifier::Disabled
+      Send alert to put pre-Heartwood nodes into safe mode.
+      Squashed 'src/crypto/ctaes/' content from commit 003a4acfc
+      build: shuffle gtest Makefile so that crypto can be used by the wallet
+      metrics: Collect general stats before clearing screen
+      Debian: Add copyright entries for ctaes and secp256k1
+      Revert "Rename FALLBACK_DOWNLOAD_PATH to PRIORITY_DOWNLOAD_PATH"
+      Revert "Try downloading from our mirror first to avoid headaches."
+      depends: Use FALLBACK_DOWNLOAD_PATH if the primary's hash doesn't match
+      test: Remove obsolete TransactionBuilder test
+      Add tracing to librustzcash dependencies
+      FFI wrapper around tracing crate
+      Replace C++ logging with tracing logging
+      Use a tracing EnvFilter directive for -debug flags
+      Add support for reloading the tracing filter
+      Add an RPC method for setting the tracing filter directives
+      Add support for tracing spans
+      Add some spans to the Zcash codebase
+      FFI: Extract common codeunit types into a rust/types.h header
+      tracing: Use 'static constexpr' hack in macros
+      wallet: Fix logging to satisfy constexpr requirements
+      FFI: Add missing <stddef.h> includes
+      init: Place additional constraints on pathDebug
+      rpc: Throw error in setlogfilter if filter reloading fails
+      tracing: Log field values that aren't valid UTF-8
+      tracing: Document macro arguments that MUST be static constant UTF-8 strings
+      doc: Update release notes for tracing backend
+      qa: Add tracing dependencies to updatecheck.py
+      depends: tracing-core 0.1.13
+      Revert "Add check-depends step to STAGE_COMMANDS list"
+      contrib: Update macdeploy README
+      depends: Rework Rust integration
+      depends: Add platform-specific overrides for download files
+      depends: Split check-packages and check-sources across categories
+      FFI: Fix tracing log path handling on Windows
+      tracing: Add MAP macro
+      tracing: Add support for event fields
+      tracing: Add support for span fields
+      tracing: Format field values with Display
+      Add fields to logging in CNode and UpdateTip
+      util: Use DEBUG level for LogPrint(), leaving INFO for LogPrintf()
+      tracing: Parse log_path into an Option<Path>
+      tracing: Rework tracing_init into a single function
+      init: Rework tracing_init call
+      init: Add spans for initialization and shutdown
+      Replace libsodium's randombytes_buf with rand_core::OsRng::fill_bytes
+      consensus: Add assertions for Params::HalvingHeight parameters
+      consensus: Document the empty conditional branch in ContextualCheckBlock
+      consensus: Statically check funding stream numerators and denominators
+      consensus: Clearly gate active funding stream elements on Canopy
+      Replace libsodium's crypto_sign with ed25519-zebra
+      ed25519: Panic (triggering abort) if nullptr passed into APIs
+      test: Update ZIP 215 test cases from ed25519-zebra
+      depends: Migrate to zcash_* 0.3.0 Rust crates
+      FFI: Remove circuit parameter hashes from librustzcash_init_zksnark_params
+      FFI: Migrate to bls12_381 and jubjub crates
+      depends: cargo update
+      qa: Update list of postponed crate versions
+      FFI: Rename to librustzcash_sapling_compute_cmu
+      FFI: Rename r to rcm
+
+Kris Nuttycombe (13):
+      Remove amqp code and Proton library depenencies & flags.
+      Remove Proton license from contrib/debian/copyright
+      consensus: Clean up some whitespace and variable names
+      consensus: Refactor Sprout contextual rules to match the rest
+      consensus: Remove canopyActive gate around GetActiveFundingStreamElements
+      consensus: Combine heartwoodActive conditionals
+      consensus: Add a placeholder for !canopyActive
+      consensus: Move overwinterActive rules ahead of saplingActive rules
+      consensus: Combine saplingActive conditionals
+      consensus: Move Sapling-disabled Overwinter rules above Sapling rules
+      consensus: Reorder Overwinter+!Sapling rules
+      consensus: Remove redundant contextual consensus rules
+      Add comment in lieu of redundant overwinter version check & fix tests.
+
+Larry Ruane (2):
+      flush wallet db (SetBestChain()) on clean shutdown
+      wallet: lock cs_main while accessing chainActive
+
+LongShao007 (1):
+      fix bug of bdb.mk
+
+Per Grön (11):
+      Get rid of implicit hidden dependencies between test .cpp files
+      Add missing #includes to test_block.cpp
+      Add actual header file for utilities in gtest/utils.cpp
+      Fix linkage issue with consts in primitives/block.h
+      Remove Checkpoints_tests.cpp
+      libsnark: Don't (implicitly) rely on other tests initializing the public params
+      Add missing libsnark initialization call
+      Don't clobber cwd in rpc_wallet_tests.cpp
+      Include header files within the source tree using "" instead of <>
+      Be consistent about what path to include bitcoin-config.h with
+      Be consistent with how to #include test data headers
+
+Pieter Wuille (1):
+      Add ctaes-based constant time AES implementation
+
+Sean Bowe (13):
+      Postpone boost 1.74.0 update
+      Postpone rust updates
+      make-release.py: Versioning changes for 4.0.0-rc1.
+      make-release.py: Updated manpages for 4.0.0-rc1.
+      make-release.py: Updated release notes and changelog for 4.0.0-rc1.
+      Add release notes to describe the Canopy network upgrade.
+      Update names of contributors in release notes.
+      Specify 4.0.0 in release notes
+      Add dev fund addresses for mainnet.
+      Set activation height for Canopy on mainnet.
+      Postpone updates for dependencies until after 4.0.0 release.
+      make-release.py: Versioning changes for 4.0.0.
+      make-release.py: Updated manpages for 4.0.0.
+
+Taylor Hornby (5):
+      Implement system for postponing dependency updates.
+      Change release instructions to block the release when dependencies are not updated and not postponed.
+      Enforce pre-release dependency update check in make-release.py
+      Extend deadline for postponing dependency updates
+      Add new dependencies to updatecheck.py, add a flag we can use to have our CI test it.
+
+Ariel Gabizon (1):
+      explain expiry error
+
+Benjamin Winston (2):
+      Added support for afl-clang-fast.
+      Added libfuzzer support.
+
+elbandi (3):
+      Allow configure params directory
+      Add paramsdir option for manpage
+      Throw error if -paramsdir not a valid directory
+
+fanquake (8):
+      depends: set OSX_MIN_VERSION to 10.10
+      doc: mention that macOS 10.10 is now required
+      scripted-diff: prefer MAC_OSX over `__APPLE__`
+      build: set minimum supported macOS to 10.12
+      depends: clang 6.0.1
+      depends: native_cctools 921, ld64 409.12, libtapi 1000.10.8
+      build: use macOS 10.14 SDK
+      doc: explain why passing -mlinker-version is required
+
+noname45688@gmail.com (2):
+      Updating to Python 3
+      Update to Python 3
+
+Jack Grigg (2):
+      debian: Rename X11 to Expat-with-advertising-clause in copyright
+      Adjust GetActiveFundingStream* comments
+
+teor (1):
+      Fix a comment typo in pow.cpp
+
+Ying Tong Lai (7):
+      Add Debian8 deprecation to release notes
+      Add missing curly braces after if statement
+      Add test for garbage memory in history nodes
+      Add documentation specific to ZIP 212
+      Move esk derivation check to beginning of plaintext_checks_without_height()
+      Define PRF diversifiers in prf.h
+      assert(leadbyte == 0x02) after every if(leadbyte != 0x01)
+
+ying tong (4):
+      Update doc/release-notes/release-notes-3.1.0.md
+      Make sure garbage bytes are different
+      Rename PRV_DIVERSIFIER to PRF_TAG
+      Add link to ZIP212 in coinbase comment
+
+Zancas Wilcox (1):
+      make deprecation.h include consensus/params.h
+
diff --git a/depend/zcash/doc/release-notes/release-notes-4.1.0-rc1.md b/depend/zcash/doc/release-notes/release-notes-4.1.0-rc1.md
new file mode 100644
index 000000000..593f3305e
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-4.1.0-rc1.md
@@ -0,0 +1,382 @@
+Notable changes
+===============
+
+Migration to Clang and static libc++
+------------------------------------
+
+`zcashd` now builds its C++ (and C) dependencies entirely with a pinned version
+of Clang, and statically links libc++ instead of dynamically linking libstdc++.
+This migration enables us to reliably use newer C++ features while supporting
+older LTS platforms, be more confident in the compiler's optimisations, and
+leverage security features such as sanitisers and efficient fuzzing. In future,
+this will also allow optimizing across the boundary between Rust and C++.
+
+The system compiler is still used to compile a few native dependencies (used by
+the build machine to then compile `zcashd` for the target machine). These will
+likely also be migrated to use the pinned Clang in a future release.
+
+Fast sync for initial block download
+------------------------------------
+
+The `-ibdskiptxverification` flag allows faster synchronization during initial
+block sync, by skipping transaction verification and instead verifying only PoW.
+Note that this mode requires checkpoints to be enabled, to make sure that each
+block under inspection is an ancestor of the latest checkpoint.
+
+Convenient testing for invalid note plaintexts
+----------------------------------------------
+
+After the mainnet activation of Canopy (block 1046400), correct wallet software
+will no longer produce v1 note plaintexts (with a lead byte of `0x01`). However,
+v1 note plaintexts will continue to be accepted for a grace period of 32256
+blocks (about 4 weeks), as specified in [ZIP 212](https://zips.z.cash/zip-0212).
+The new `receiveunsafe` log category complains if an invalid note plaintext is
+received.
+
+Additional lightwalletd and light client RPCs
+---------------------------------------------
+
+- lightwalletd is now able to retrieve all UTXOs related to a t-address through
+the `getaddressutxos` RPC. (Previously, this was only available to the Insight
+Explorer.)
+- The new `z_gettreestate` RPC returns the Sprout and Sapling treestate at a
+given block height or block hash. This makes it easier for light clients to
+generate checkpoints.
+
+Update/removal of several cryptographic dependencies
+----------------------------------------------------
+
+This release updates secp256k1 to enable the GLV endomorphism optimisation by
+default, after the recent expiry of the GLV patents. It also removes OpenSSL,
+and replaces libsodium BLAKE2b usage with the [blake2b_simd Rust crate](https://github.com/oconnor663/blake2_simd).
+
+Changelog
+=========
+
+Aditya Kulkarni (1):
+      Add a config option to skip transaction verification in IBD mode
+
+Ahmad Kazi (1):
+      [Trivial] Add BITCOIN_FS_H endif footer in fs.h
+
+Alfredo Garcia (9):
+      add timestamp to warnings
+      change order of returned pair, fix compatibility issue
+      revert result key change, fix calls to getime
+      add shielded balance to getwalletinfo
+      Add null check to feof.
+      allow wallet file to be outside datadir
+      Apply suggestions from code review
+      simplify TestBlockValidity
+      update function comment
+
+Ben Wilson (4):
+      Added libtinfo5 to ci builder containers
+      Added Arch and Centos to script, added libtinfo5 for arch
+      Fixed Centos and Arch python requirements
+      Build python for debian9 and ubuntu16.04
+
+Carl Dong (3):
+      depends: Build secondary deps statically.
+      depends: Purge libtool archives
+      scripted-diff: Run scripted-diff in subshell
+
+Cory Fields (8):
+      leveldb: integrate leveldb into our buildsystem
+      build: No need to check for leveldb atomics
+      build: out-of-tree fixups
+      leveldb: enable runtime-detected crc32 instructions
+      build: verify that the assembler can handle crc32 functions
+      httpserver: use a future rather than relying on boost's try_join_for
+      httpserver: replace boost threads with std
+      devtools: add script to verify scriptable changes
+
+Daira Hopwood (29):
+      CBufferedFile: assert that Fill() is only called when nReadPos == nSrcPos, and simplify based on that assumption.
+      CBufferedFile: use eof() method rather than feof(src) in error message.
+      Make some conversions explicit to reduce sanitizer warnings.
+      Rename z_*_balance fields of getwalletinfo output to shielded_*_balance
+      Fix grammar in error messages.
+      Ensure that the absolute path used in the test definitely does not exist.
+      Line-wrap addition to README.md
+      Minor additional OpenSSL scouring.
+      Avoid undefined behaviour in scriptnum tests.
+      Add assertions for CScriptNum[10] +/- int64_t to avoid the possibility of UB.
+      It's unnecessary to pass int64_t by const reference.
+      Cosmetics in CScriptNum code and tests.
+      Add logging when we receive an invalid note plaintext (using the "receiveunsafe" log category).
+      Fix a new warning about use of boost::bind placeholders after updating Boost. closes #4774
+      Beef up the CoC to address use of dog-whistles.
+      Fix warnings surfaced by compiling with clang++.
+      Use the current time as the timestamp if we override a misc warning.
+      qa/zcash/full_test_suite.py: changes needed for macOS. fixes #4785
+      qa/zcash/full_test_suite.py: print immediately if a test fails.
+      log(x)/log(2.0) can be written as log2(x).
+      Fix integer types in DisplayDuration.
+      Rename `time` to `duration` in `DisplayDuration`.
+      Update contrib/devtools/symbol-check.py
+      contrib/devtools/symbol-check.py: add info about Fedora-based distributions.
+      Comment and error message cleanups for transaction checks.
+      Add new copyright entries for build-aux/m4/ax_cxx_compile_stdcxx.m4
+      Fix death gtests on macOS by switching to the threadsafe style.
+      Fix an error reporting bug in "Checksum missing or mismatched ..."
+      Rename the FS_ZIP214_ECC funding stream to FS_ZIP214_BP. See also https://github.com/zcash/zips/pull/412 .
+
+Dimitris Apostolou (5):
+      Remove reference to cargo-checksum.sh
+      Fix typos
+      Fix zeromq warning
+      Remove deprecated init.md
+      Remove Bitcoin release notes
+
+Dimitris Tsapakidis (1):
+      Fixed multiple typos
+
+Hennadii Stepanov (1):
+      Enable ShellCheck rules
+
+Jack Grigg (79):
+      Assorted small changes to the locked pool manager
+      wallet: Add ANY_TADDR special string to z_sendmany
+      Allow multiple nuparams options in config file
+      depends: Switch to `cargo vendor` for Rust dependencies
+      QA: Comment out Rust crate checks in updatecheck.py
+      depends: Ensure that SOURCES_PATH exists before vendoring crates
+      wallet: Ignore coinbase UTXOs with z_sendmany ANY_TADDR
+      rpc: Fix comma spacing in example z_sendmany commands
+      Squashed 'src/leveldb/' changes from 20ca81f08..a31c8aa40
+      Squashed 'src/leveldb/' changes from a31c8aa40..196962ff0
+      Squashed 'src/leveldb/' changes from 196962ff0..c521b3ac6
+      Squashed 'src/leveldb/' changes from c521b3ac6..64052c76c
+      Squashed 'src/leveldb/' changes from 64052c76c..524b7e36a
+      Squashed 'src/leveldb/' changes from 524b7e36a..f545dfabf
+      depends: Remove cargo-checksum.sh
+      Replace libsodium's crypto_generichash_blake2b with blake2b_simd
+      blake2b: Allow consuming partial BLAKE2b output
+      tracing: Correctly override tracing::Span move constructors
+      build: Remove Rust staticlib naming workaround
+      depends: Update to latest config.guess & config.sub
+      build: out-of-tree fixups
+      leveldb: Assert that ssize_t is the same size as size_t on Windows
+      LockedPool: Fix LockedPool::free(nullptr) to be a no-op
+      LockedPool: Make Arena::free and LockedPool::free noexcept
+      allocators: Apply Allocator named requirements to secure_allocator::deallocate
+      depends: Update map of GCC canonical hosts to Rust targets
+      QA: Switch to x86_64-pc-linux-gnu for hard-coded Linux HOST
+      build: Switch to x86_64-pc-linux-gnu for codecov filtering
+      gitian: Switch from x86_64-unknown-linux-gnu to x86_64-linux-gnu
+      util: Remove OpenSSL multithreading infrastructure
+      Remove remaining OpenSSL references
+      QA: Remove OpenSSL from updatecheck.py
+      build: Remove a stray -lcrypto
+      Squashed 'src/secp256k1/' changes from 6ad5cdb42..8ab24e8da
+      build: Use the endomorphism optimization for secp256k1
+      depends: libevent 2.1.12
+      depends: ccache 3.7.11
+      depends: googletest 1.8.1
+      depends: utfcpp 3.1.2
+      depends: Use correct HOST for download-linux target
+      QA: Fix backporting bugs in httpbasics.py
+      depends: Boost 1.74.0
+      depends: ccache 3.7.12
+      cargo update
+      depends: ZeroMQ 4.3.3
+      FFI: Merge librustzcash_init_zksnark_params variants into one function
+      depends: Postpone current and scheduled Rust releases until 2021
+      MOVEONLY: Move logging code from util.{h,cpp} to new files
+      depends: Add Clang 8.0.0
+      depends: Use vendored Clang for native compilation
+      depends: Use vendored Clang for macOS cross-compilation
+      depends: Vendor LLD and use it for linking
+      depends: Add libc++ as a dependency
+      depends: Don't replace default CXXFLAGS in C++ dependencies
+      depends: Add multilib paths for Linux cross-compile
+      build: Statically link libc++
+      build: Add missing LIBUNIVALUE to Makefile.bench.include LDADD
+      depends: Fix "unused variables" warning when compiling zeromq for Windows
+      depends: Rename Boost libraries to follow MinGW/GCC convention
+      depends: Fix boost::iostreams usage on Windows with libc++
+      build: Compile secp256k1 with C99
+      build: Add -lpthread to univalue test LDFLAGS
+      qa: Disable FORTIFY_SOURCE checks
+      QA: Add native_clang and libcxx to updatecheck.py
+      test: Fix various pyflakes warnings
+      doc: Add Clang and libc++ migration to release notes
+      build: Update AX_CXX_COMPILE_STDCXX macro
+      build: Require and build with C++ 17
+      depends: Build C++ dependencies with C++ 17
+      Switch from std::random_shuffle to std::shuffle
+      Squashed 'src/secp256k1/' changes from 8ab24e8da..c6b6b8f1b
+      build: Update secp256k1 configure flags
+      Improve reject reasons for unmet shielded requirements
+      Add logging to CCoinsViewCache::HaveShieldedRequirements
+      utils: Remove unnecessary GetTempPath()
+      Add txid to "shielded requirements not met" messages
+      test/lint: Check for working changes before checking scripted diffs
+      tests: Update chained_joinsplits test for HaveShieldedRequirements API change
+      scripted-diff: Remove BOOST_STATIC_ASSERT
+
+Jeffrey Czyz (2):
+      Fix compilation errors in support/lockedpool.cpp
+      Fix segfault in allocator_tests/arena_tests
+
+Jeremy Rubin (1):
+      Fix subscript[0] potential bugs in key.cpp
+
+John Newbery (1):
+      [docs] document scripted-diff
+
+Jonas Schnelli (2):
+      NotifyBlockTip signal: switch from hash (uint256) to CBlockIndex*
+      Move uiInterface.NotifyBlockTip signal above the core/wallet signal
+
+Kaz Wesley (3):
+      LockedPool: test handling of invalid allocations
+      LockedPool: fix explosion for illegal-sized alloc
+      LockedPool: avoid quadratic-time allocation
+
+Kris Nuttycombe (14):
+      Prevent creation of shielded transactions in initial block download.
+      Revert the move of the `getBalanceZaddr` block for ease of review.
+      Fix forward declaration.
+      Remove redundant CheckBlock calls.
+      Reduce diff complexity.
+      Apply style suggestions from code review
+      -ibdskiptxverification must imply -checkpoints
+      Apply suggestions from code review
+      Ensure conflicting flags are reported as an error.
+      Reject incompatible flags in "Step 2"
+      Rename IBDSkipTxVerification back to ShouldCheckTransaction
+      Fix command-line help for -ibdskiptxverification
+      Fix invocation of updatecheck.py in make-release.py
+      Replace invalid characters in log message decoding.
+
+Larry Ruane (4):
+      Flush witness data when consistent (part 2)
+      performance: auto params = CChainParams::GetConsensus()
+      allow getaddressutxos if -lightwalletd
+      add z_gettreestate rpc
+
+Luke Dashjr (2):
+      lockedpool: When possible, use madvise to avoid including sensitive information in core dumps
+      Add MIT license to Makefiles
+
+Marco Falke (3):
+      Limit scope of all global std::once_flag
+      Add extra LevelDB source to Makefile
+      test: Move linters to test/lint, add readme
+
+Martin Ankerl (2):
+      Use best-fit strategy in Arena, now O(log(n)) instead O(n)
+      fix nits: variable naming, typos
+
+Mustafa (2):
+      Add a source file for unit test utils.
+      Move GetTempPath() to testutil.
+
+Nate Wilcox (3):
+      Link the README.md to the specific readthedocs.io page for building on Debian/Ubuntu.
+      Convert a sed command to a static patch file.
+      depends: fix a logging bug for multi-archive packages.
+
+Nick (1):
+      [RPC] Add transaction size to JSON output
+
+Pavel Janík (2):
+      Do not shadow variable, use deprecated MAP_ANON if MAP_ANONYMOUS is not defined.
+      Do not include env_win.cc on non-Windows systems
+
+Pieter Wuille (2):
+      Remove some unused functions and methods
+      Fail on commit with VERIFY SCRIPT but no scripted-diff
+
+Sean Bowe (3):
+      Update Rust to 1.44.1.
+      cargo update
+      Update to latest zcash_* and zkcrypto crates.
+
+Taylor Hornby (3):
+      Fix buffer overflows in P2PKH tests
+      Add a missing % to a string interpolation in rpc test framework
+      Fix undefined behavior in the test_bitcoin tests
+
+Thomas Snider (1):
+      [trivial] Switched constants to sizeof()
+
+Vasil Dimov (1):
+      lockedpool: avoid sensitive data in core files (FreeBSD)
+
+Wladimir J. van der Laan (19):
+      wallet: Change CCrypter to use vectors with secure allocator
+      wallet: Get rid of LockObject and UnlockObject calls in key.h
+      support: Add LockedPool
+      rpc: Add `getmemoryinfo` call
+      bench: Add benchmark for lockedpool allocation/deallocation
+      http: Restrict maximum size of request line + headers
+      Replace scriptnum_test's normative ScriptNum implementation
+      build: remove libcrypto as internal dependency in libbitcoinconsensus.pc
+      http: Do a pending c++11 simplification
+      http: Add log message when work queue is full
+      http: Change boost::scoped_ptr to std::unique_ptr in HTTPRequest
+      http: use std::move to move HTTPRequest into HTTPWorkItem
+      Add fs.cpp/h
+      Replace includes of boost/filesystem.h with fs.h
+      Replace uses of boost::filesystem with fs
+      Use fsbridge for fopen and freopen
+      torcontrol: Use fs::path instead of std::string for private key path
+      Remove `namespace fs=fs`
+      test: Mention commit id in scripted diff error
+
+fanquake (8):
+      build: remove SSL lib detection
+      build: remove OpenSSL detection and libs
+      depends: remove OpenSSL package
+      doc: remove OpenSSL from build instructions and licensing info
+      depends: Disable unused ZeroMQ features
+      depends: zeromq: disable draft classes and methods
+      build: only pass --disable-dependency-tracking to packages that understand it
+      build: pass --enable-option-checking to applicable packages
+
+mruddy (1):
+      [depends, zmq, doc] avoid deprecated zeromq api functions
+
+practicalswift (7):
+      Fix out-of-bounds write in case of failing mmap(...) in PosixLockedPageAllocator::AllocateLocked
+      Improve readability by removing redundant casts to same type (on all platforms)
+      tests: Remove OldSetKeyFromPassphrase/OldEncrypt/OldDecrypt
+      Remove unused Boost includes
+      Add "export LC_ALL=C" to all shell scripts
+      Add error handling: exit if cd fails
+      Use bash instead of POSIX sh. POSIX sh does not support arrays.
+
+Jack Grigg (9):
+      Update license headers
+      leveldb: Fix typo
+      LockedPool: Switch to HTTPS URLs in licenses and comments
+      test: Fix LFSR period in comments
+      httpserver: Code style cleanups
+      depends: Update packages documentation for Zcash
+      depends: Add untested note to FreeBSD host
+      Update example scripted-diff comit in doc/developer-notes.md
+      Use HTTPS in script license headers
+
+syd (1):
+      Add assert_raises_message to the python test framework.
+
+Ying Tong Lai (9):
+      Add funding stream addresses to getblocksubsidy RPC output
+      Fix CScript encoding
+      Handle shielded address case
+      Minor cleanups
+      Only return address instead of CScript
+      Remove void declaration of ScriptPubKeyToJSON()
+      Postpone native_ccache 4.0
+      make-release.py: Versioning changes for 4.1.0-rc1.
+      make-release.py: Updated manpages for 4.1.0-rc1.
+
+ying tong (1):
+      Apply suggestions from code review
+
+Benjamin Winston (1):
+      Postponed dependency updates, refer to core team sync meeting.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-4.1.0.md b/depend/zcash/doc/release-notes/release-notes-4.1.0.md
new file mode 100644
index 000000000..d5d26eb9d
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-4.1.0.md
@@ -0,0 +1,387 @@
+Notable changes
+===============
+
+Migration to Clang and static libc++
+------------------------------------
+
+`zcashd` now builds its C++ (and C) dependencies entirely with a pinned version
+of Clang, and statically links libc++ instead of dynamically linking libstdc++.
+This migration enables us to reliably use newer C++ features while supporting
+older LTS platforms, be more confident in the compiler's optimisations, and
+leverage security features such as sanitisers and efficient fuzzing. In future,
+this will also allow optimizing across the boundary between Rust and C++.
+
+The system compiler is still used to compile a few native dependencies (used by
+the build machine to then compile `zcashd` for the target machine). These will
+likely also be migrated to use the pinned Clang in a future release.
+
+
+Fast sync for initial block download
+------------------------------------
+
+The `-ibdskiptxverification` flag allows faster synchronization during initial
+block sync, by skipping transaction verification and instead verifying only PoW.
+Note that this mode requires checkpoints to be enabled, to make sure that each
+block under inspection is an ancestor of the latest checkpoint.
+
+Convenient testing for invalid note plaintexts
+----------------------------------------------
+
+After the mainnet activation of Canopy (block 1046400), correct wallet software
+will no longer produce v1 note plaintexts (with a lead byte of `0x01`). However,
+v1 note plaintexts will continue to be accepted for a grace period of 32256
+blocks (about 4 weeks), as specified in [ZIP 212](https://zips.z.cash/zip-0212).
+The new `receiveunsafe` log category complains if an invalid note plaintext is
+received.
+
+Additional lightwalletd and light client RPCs
+---------------------------------------------
+
+- lightwalletd is now able to retrieve all UTXOs related to a t-address through
+the `getaddressutxos` RPC. (Previously, this was only available to the Insight
+Explorer.)
+- The new `z_gettreestate` RPC returns the Sprout and Sapling treestate at a
+given block height or block hash. This makes it easier for light clients to
+generate checkpoints.
+
+Update/removal of several cryptographic dependencies
+----------------------------------------------------
+
+This release updates secp256k1 to enable the GLV endomorphism optimisation by
+default, after the recent expiry of the GLV patents. It also removes OpenSSL,
+and replaces libsodium BLAKE2b usage with the [blake2b_simd Rust crate](https://github.com/oconnor663/blake2_simd).
+Changelog
+=========
+
+Aditya Kulkarni (1):
+      Add a config option to skip transaction verification in IBD mode
+
+Ahmad Kazi (1):
+      [Trivial] Add BITCOIN_FS_H endif footer in fs.h
+
+Alfredo Garcia (9):
+      add timestamp to warnings
+      change order of returned pair, fix compatibility issue
+      revert result key change, fix calls to getime
+      add shielded balance to getwalletinfo
+      Add null check to feof.
+      allow wallet file to be outside datadir
+      Apply suggestions from code review
+      simplify TestBlockValidity
+      update function comment
+
+Ben Wilson (4):
+      Added libtinfo5 to ci builder containers
+      Added Arch and Centos to script, added libtinfo5 for arch
+      Fixed Centos and Arch python requirements
+      Build python for debian9 and ubuntu16.04
+
+Carl Dong (3):
+      depends: Build secondary deps statically.
+      depends: Purge libtool archives
+      scripted-diff: Run scripted-diff in subshell
+
+Cory Fields (8):
+      leveldb: integrate leveldb into our buildsystem
+      build: No need to check for leveldb atomics
+      build: out-of-tree fixups
+      leveldb: enable runtime-detected crc32 instructions
+      build: verify that the assembler can handle crc32 functions
+      httpserver: use a future rather than relying on boost's try_join_for
+      httpserver: replace boost threads with std
+      devtools: add script to verify scriptable changes
+
+Daira Hopwood (30):
+      CBufferedFile: assert that Fill() is only called when nReadPos == nSrcPos, and simplify based on that assumption.
+      CBufferedFile: use eof() method rather than feof(src) in error message.
+      Make some conversions explicit to reduce sanitizer warnings.
+      Rename z_*_balance fields of getwalletinfo output to shielded_*_balance
+      Fix grammar in error messages.
+      Ensure that the absolute path used in the test definitely does not exist.
+      Line-wrap addition to README.md
+      Minor additional OpenSSL scouring.
+      Avoid undefined behaviour in scriptnum tests.
+      Add assertions for CScriptNum[10] +/- int64_t to avoid the possibility of UB.
+      It's unnecessary to pass int64_t by const reference.
+      Cosmetics in CScriptNum code and tests.
+      Add logging when we receive an invalid note plaintext (using the "receiveunsafe" log category).
+      Fix a new warning about use of boost::bind placeholders after updating Boost. closes #4774
+      Beef up the CoC to address use of dog-whistles.
+      Fix warnings surfaced by compiling with clang++.
+      Use the current time as the timestamp if we override a misc warning.
+      qa/zcash/full_test_suite.py: changes needed for macOS. fixes #4785
+      qa/zcash/full_test_suite.py: print immediately if a test fails.
+      log(x)/log(2.0) can be written as log2(x).
+      Fix integer types in DisplayDuration.
+      Rename `time` to `duration` in `DisplayDuration`.
+      Update contrib/devtools/symbol-check.py
+      contrib/devtools/symbol-check.py: add info about Fedora-based distributions.
+      Comment and error message cleanups for transaction checks.
+      Add new copyright entries for build-aux/m4/ax_cxx_compile_stdcxx.m4
+      Fix death gtests on macOS by switching to the threadsafe style.
+      Fix an error reporting bug in "Checksum missing or mismatched ..."
+      Rename the FS_ZIP214_ECC funding stream to FS_ZIP214_BP. See also https://github.com/zcash/zips/pull/412 .
+      Gitian builds: Remove manual CFLAGS and CXXFLAGS from descriptor.
+
+Dimitris Apostolou (5):
+      Remove reference to cargo-checksum.sh
+      Fix typos
+      Fix zeromq warning
+      Remove deprecated init.md
+      Remove Bitcoin release notes
+
+Dimitris Tsapakidis (1):
+      Fixed multiple typos
+
+Hennadii Stepanov (1):
+      Enable ShellCheck rules
+
+Jack Grigg (79):
+      Assorted small changes to the locked pool manager
+      wallet: Add ANY_TADDR special string to z_sendmany
+      Allow multiple nuparams options in config file
+      depends: Switch to `cargo vendor` for Rust dependencies
+      QA: Comment out Rust crate checks in updatecheck.py
+      depends: Ensure that SOURCES_PATH exists before vendoring crates
+      wallet: Ignore coinbase UTXOs with z_sendmany ANY_TADDR
+      rpc: Fix comma spacing in example z_sendmany commands
+      Squashed 'src/leveldb/' changes from 20ca81f08..a31c8aa40
+      Squashed 'src/leveldb/' changes from a31c8aa40..196962ff0
+      Squashed 'src/leveldb/' changes from 196962ff0..c521b3ac6
+      Squashed 'src/leveldb/' changes from c521b3ac6..64052c76c
+      Squashed 'src/leveldb/' changes from 64052c76c..524b7e36a
+      Squashed 'src/leveldb/' changes from 524b7e36a..f545dfabf
+      depends: Remove cargo-checksum.sh
+      Replace libsodium's crypto_generichash_blake2b with blake2b_simd
+      blake2b: Allow consuming partial BLAKE2b output
+      tracing: Correctly override tracing::Span move constructors
+      build: Remove Rust staticlib naming workaround
+      depends: Update to latest config.guess & config.sub
+      build: out-of-tree fixups
+      leveldb: Assert that ssize_t is the same size as size_t on Windows
+      LockedPool: Fix LockedPool::free(nullptr) to be a no-op
+      LockedPool: Make Arena::free and LockedPool::free noexcept
+      allocators: Apply Allocator named requirements to secure_allocator::deallocate
+      depends: Update map of GCC canonical hosts to Rust targets
+      QA: Switch to x86_64-pc-linux-gnu for hard-coded Linux HOST
+      build: Switch to x86_64-pc-linux-gnu for codecov filtering
+      gitian: Switch from x86_64-unknown-linux-gnu to x86_64-linux-gnu
+      util: Remove OpenSSL multithreading infrastructure
+      Remove remaining OpenSSL references
+      QA: Remove OpenSSL from updatecheck.py
+      build: Remove a stray -lcrypto
+      Squashed 'src/secp256k1/' changes from 6ad5cdb42..8ab24e8da
+      build: Use the endomorphism optimization for secp256k1
+      depends: libevent 2.1.12
+      depends: ccache 3.7.11
+      depends: googletest 1.8.1
+      depends: utfcpp 3.1.2
+      depends: Use correct HOST for download-linux target
+      QA: Fix backporting bugs in httpbasics.py
+      depends: Boost 1.74.0
+      depends: ccache 3.7.12
+      cargo update
+      depends: ZeroMQ 4.3.3
+      FFI: Merge librustzcash_init_zksnark_params variants into one function
+      depends: Postpone current and scheduled Rust releases until 2021
+      MOVEONLY: Move logging code from util.{h,cpp} to new files
+      depends: Add Clang 8.0.0
+      depends: Use vendored Clang for native compilation
+      depends: Use vendored Clang for macOS cross-compilation
+      depends: Vendor LLD and use it for linking
+      depends: Add libc++ as a dependency
+      depends: Don't replace default CXXFLAGS in C++ dependencies
+      depends: Add multilib paths for Linux cross-compile
+      build: Statically link libc++
+      build: Add missing LIBUNIVALUE to Makefile.bench.include LDADD
+      depends: Fix "unused variables" warning when compiling zeromq for Windows
+      depends: Rename Boost libraries to follow MinGW/GCC convention
+      depends: Fix boost::iostreams usage on Windows with libc++
+      build: Compile secp256k1 with C99
+      build: Add -lpthread to univalue test LDFLAGS
+      qa: Disable FORTIFY_SOURCE checks
+      QA: Add native_clang and libcxx to updatecheck.py
+      test: Fix various pyflakes warnings
+      doc: Add Clang and libc++ migration to release notes
+      build: Update AX_CXX_COMPILE_STDCXX macro
+      build: Require and build with C++ 17
+      depends: Build C++ dependencies with C++ 17
+      Switch from std::random_shuffle to std::shuffle
+      Squashed 'src/secp256k1/' changes from 8ab24e8da..c6b6b8f1b
+      build: Update secp256k1 configure flags
+      Improve reject reasons for unmet shielded requirements
+      Add logging to CCoinsViewCache::HaveShieldedRequirements
+      utils: Remove unnecessary GetTempPath()
+      Add txid to "shielded requirements not met" messages
+      test/lint: Check for working changes before checking scripted diffs
+      tests: Update chained_joinsplits test for HaveShieldedRequirements API change
+      scripted-diff: Remove BOOST_STATIC_ASSERT
+
+Jeffrey Czyz (2):
+      Fix compilation errors in support/lockedpool.cpp
+      Fix segfault in allocator_tests/arena_tests
+
+Jeremy Rubin (1):
+      Fix subscript[0] potential bugs in key.cpp
+
+John Newbery (1):
+      [docs] document scripted-diff
+
+Jonas Schnelli (2):
+      NotifyBlockTip signal: switch from hash (uint256) to CBlockIndex*
+      Move uiInterface.NotifyBlockTip signal above the core/wallet signal
+
+Kaz Wesley (3):
+      LockedPool: test handling of invalid allocations
+      LockedPool: fix explosion for illegal-sized alloc
+      LockedPool: avoid quadratic-time allocation
+
+Kris Nuttycombe (14):
+      Prevent creation of shielded transactions in initial block download.
+      Revert the move of the `getBalanceZaddr` block for ease of review.
+      Fix forward declaration.
+      Remove redundant CheckBlock calls.
+      Reduce diff complexity.
+      Apply style suggestions from code review
+      -ibdskiptxverification must imply -checkpoints
+      Apply suggestions from code review
+      Ensure conflicting flags are reported as an error.
+      Reject incompatible flags in "Step 2"
+      Rename IBDSkipTxVerification back to ShouldCheckTransaction
+      Fix command-line help for -ibdskiptxverification
+      Fix invocation of updatecheck.py in make-release.py
+      Replace invalid characters in log message decoding.
+
+Larry Ruane (4):
+      Flush witness data when consistent (part 2)
+      performance: auto params = CChainParams::GetConsensus()
+      allow getaddressutxos if -lightwalletd
+      add z_gettreestate rpc
+
+Luke Dashjr (2):
+      lockedpool: When possible, use madvise to avoid including sensitive information in core dumps
+      Add MIT license to Makefiles
+
+Marco Falke (3):
+      Limit scope of all global std::once_flag
+      Add extra LevelDB source to Makefile
+      test: Move linters to test/lint, add readme
+
+Martin Ankerl (2):
+      Use best-fit strategy in Arena, now O(log(n)) instead O(n)
+      fix nits: variable naming, typos
+
+Mustafa (2):
+      Add a source file for unit test utils.
+      Move GetTempPath() to testutil.
+
+Nate Wilcox (3):
+      Link the README.md to the specific readthedocs.io page for building on Debian/Ubuntu.
+      Convert a sed command to a static patch file.
+      depends: fix a logging bug for multi-archive packages.
+
+Nick (1):
+      [RPC] Add transaction size to JSON output
+
+Pavel Janík (2):
+      Do not shadow variable, use deprecated MAP_ANON if MAP_ANONYMOUS is not defined.
+      Do not include env_win.cc on non-Windows systems
+
+Pieter Wuille (2):
+      Remove some unused functions and methods
+      Fail on commit with VERIFY SCRIPT but no scripted-diff
+
+Sean Bowe (6):
+      Update Rust to 1.44.1.
+      cargo update
+      Update to latest zcash_* and zkcrypto crates.
+      Postpone clang and libc++ dependency updates until after the 4.1.0 release.
+      make-release.py: Versioning changes for 4.1.0.
+      make-release.py: Updated manpages for 4.1.0.
+
+Taylor Hornby (3):
+      Fix buffer overflows in P2PKH tests
+      Add a missing % to a string interpolation in rpc test framework
+      Fix undefined behavior in the test_bitcoin tests
+
+Thomas Snider (1):
+      [trivial] Switched constants to sizeof()
+
+Vasil Dimov (1):
+      lockedpool: avoid sensitive data in core files (FreeBSD)
+
+Wladimir J. van der Laan (19):
+      wallet: Change CCrypter to use vectors with secure allocator
+      wallet: Get rid of LockObject and UnlockObject calls in key.h
+      support: Add LockedPool
+      rpc: Add `getmemoryinfo` call
+      bench: Add benchmark for lockedpool allocation/deallocation
+      http: Restrict maximum size of request line + headers
+      Replace scriptnum_test's normative ScriptNum implementation
+      build: remove libcrypto as internal dependency in libbitcoinconsensus.pc
+      http: Do a pending c++11 simplification
+      http: Add log message when work queue is full
+      http: Change boost::scoped_ptr to std::unique_ptr in HTTPRequest
+      http: use std::move to move HTTPRequest into HTTPWorkItem
+      Add fs.cpp/h
+      Replace includes of boost/filesystem.h with fs.h
+      Replace uses of boost::filesystem with fs
+      Use fsbridge for fopen and freopen
+      torcontrol: Use fs::path instead of std::string for private key path
+      Remove `namespace fs=fs`
+      test: Mention commit id in scripted diff error
+
+fanquake (8):
+      build: remove SSL lib detection
+      build: remove OpenSSL detection and libs
+      depends: remove OpenSSL package
+      doc: remove OpenSSL from build instructions and licensing info
+      depends: Disable unused ZeroMQ features
+      depends: zeromq: disable draft classes and methods
+      build: only pass --disable-dependency-tracking to packages that understand it
+      build: pass --enable-option-checking to applicable packages
+
+mruddy (1):
+      [depends, zmq, doc] avoid deprecated zeromq api functions
+
+practicalswift (7):
+      Fix out-of-bounds write in case of failing mmap(...) in PosixLockedPageAllocator::AllocateLocked
+      Improve readability by removing redundant casts to same type (on all platforms)
+      tests: Remove OldSetKeyFromPassphrase/OldEncrypt/OldDecrypt
+      Remove unused Boost includes
+      Add "export LC_ALL=C" to all shell scripts
+      Add error handling: exit if cd fails
+      Use bash instead of POSIX sh. POSIX sh does not support arrays.
+
+Jack Grigg (9):
+      Update license headers
+      leveldb: Fix typo
+      LockedPool: Switch to HTTPS URLs in licenses and comments
+      test: Fix LFSR period in comments
+      httpserver: Code style cleanups
+      depends: Update packages documentation for Zcash
+      depends: Add untested note to FreeBSD host
+      Update example scripted-diff comit in doc/developer-notes.md
+      Use HTTPS in script license headers
+
+syd (1):
+      Add assert_raises_message to the python test framework.
+
+Ying Tong Lai (11):
+      Add funding stream addresses to getblocksubsidy RPC output
+      Fix CScript encoding
+      Handle shielded address case
+      Minor cleanups
+      Only return address instead of CScript
+      Remove void declaration of ScriptPubKeyToJSON()
+      Postpone native_ccache 4.0
+      make-release.py: Versioning changes for 4.1.0-rc1.
+      make-release.py: Updated manpages for 4.1.0-rc1.
+      make-release.py: Updated release notes and changelog for 4.1.0-rc1.
+      Update release-notes-4.1.0-rc1.md
+
+ying tong (1):
+      Apply suggestions from code review
+
+Benjamin Winston (1):
+      Postponed dependency updates, refer to core team sync meeting.
diff --git a/depend/zcash/doc/release-notes/release-notes-4.1.1.md b/depend/zcash/doc/release-notes/release-notes-4.1.1.md
new file mode 100644
index 000000000..46793955d
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-4.1.1.md
@@ -0,0 +1,156 @@
+Notable changes
+===============
+
+Optimize release build
+----------------------
+The release build now sets CLAGS/CXXFLAGS to use the -O3 optimization
+option, which turns on more optimization flags than the previously used
+-O1. This produces a faster build, addressing a performance regression in 
+v4.1.0.
+
+Correctly report Founders' Reward amount in `getblocktemplate`
+--------------------------------------------------------------
+This release correctly returns the `foundersreward` field from `getblocktemplate`
+output pre-Canopy and removes the field post-Canopy. (The Founders' Reward will
+expire exactly as Canopy activates, as specified in [ZIP 207](https://zips.z.cash/zip-0207).)
+To obtain information about funding stream amounts, use `getblocksubsidy HEIGHT`,
+passing in the height returned by the `getblocktemplate` API.
+
+Changelog
+=========
+
+Akio Nakamura (1):
+      [script] lint-whitespace: improve print linenumber
+
+Alfredo Garcia (1):
+      add myblockhash parameter to getrawtransaction
+
+Daira Hopwood (3):
+      Wording improvements to getrawtransaction RPC documentation
+      GetNextWorkRequired: clarify why this computation is equivalent to that in the protocol spec. refs https://github.com/zcash/zips/pull/418
+      Set release CFLAGS/CXXFLAGS to use -O3.
+
+Dan Raviv (1):
+      Fix header guards using reserved identifiers
+
+DesWurstes (1):
+      Obsolete #!/bin/bash shebang
+
+Evan Klitzke (1):
+      Add a lint check for trailing whitespace.
+
+Jack Grigg (14):
+      lints: Use Zcash-specific include guards for new files
+      lints: Update expected Boost imports
+      lints: Match `export LC_ALL="C"` in lint-shell-locale
+      test: Fix pyflakes warning in bitcoin-util-test.py
+      lint: Fix missing or inconsistent include guards
+      lint: Fix duplicate includes
+      python: Explicitly set encoding to utf8 when opening text files
+      lint: Use consistent shebangs
+      lint: Opt out of locale dependence in Zcash shell scripts
+      lint: Re-exclude subtrees from lint-include-guards.sh
+      lint: Apply include guard style to src/rust/include
+      lint: s/trim/lenTrim in src/crypto/equihash.[cpp,h]
+      lint: Fix minor shellcheck lints
+      cargo update
+
+John Newbery (4):
+      [contrib] convert test-security-check to python3
+      Clean up bctest.py and bitcoin-util-test.py
+      Improve logging in bctest.py if there is a formatting mismatch
+      [linter] Strip trailing / in path for git-subtree-check
+
+João Barbosa (1):
+      qa: Ignore shellcheck warning SC2236
+
+Julian Fleischer (3):
+      fix locale for lint-shell
+      use export LC_ALL=C.UTF-8
+      Run all lint scripts
+
+Kris Nuttycombe (6):
+      Change order of checks to skip IsInitialBlockDownload check if flag is unset.
+      Correctly report founder's reward amount in getblocktemplate prior to Canopy
+      Document how to get block subsidy information in getblocktemplate.
+      Update getblocktemplate documentation.
+      make-release.py: Versioning changes for 4.1.1.
+      make-release.py: Updated manpages for 4.1.1.
+
+Kristaps Kaupe (1):
+      Make lint-includes.sh work from any directory
+
+Marco Falke (4):
+      devtools: Exclude patches from lint-whitespace
+      Refine travis check for duplicate includes
+      test: Move linters to test/lint, add readme
+      Revert "Remove unused variable in shell script"
+
+MeshCollider (1):
+      Add tab char lint check and exclude imported dependencies
+
+Philip Kaufmann (1):
+      [Trivial] ensure minimal header conventions
+
+Pieter Wuille (1):
+      Improve git-subtree-check.sh
+
+Sjors Provoost (3):
+      [scripts] lint-whitespace: use perl instead of grep -P
+      [scripts] lint-whitespace: check last N commits or unstaged changes
+      doc: improve subtree check instructions
+
+Vidar Holen (1):
+      refactor/lint: Add ignored suggestions to an array
+
+Wladimir J. van der Laan (4):
+      contrib: Ignore historical release notes for whitespace check
+      test: Add format-dependent comparison to bctest
+      test: Explicitly set encoding to utf8 when opening text files
+      uint256: replace sprintf with HexStr and reverse-iterator
+
+adityapk00 (1):
+      Don't compile ehHashState::* if mining is disabled
+
+isle2983 (1):
+      [copyright] add MIT license headers to .sh scripts where missing
+
+jnewbery (5):
+      Add bitcoin-tx JSON tests
+      Add option to run bitcoin-util-test.py manually
+      bitcoin-util-test.py should fail if the output file is empty
+      add verbose mode to bitcoin-util-test.py
+      Add logging to bitcoin-util-test.py
+
+practicalswift (20):
+      Document include guard convention
+      Fix missing or inconsistent include guards
+      Add lint-include-guards.sh which checks include guard consistency
+      Add Travis check for duplicate includes
+      Add shell script linting: Check for shellcheck warnings in shell scripts
+      add lint tool to check python3 shebang
+      build: Guard against accidental introduction of new Boost dependencies
+      build: Add linter for checking accidental locale dependence
+      docs: Mention lint-locale-dependence.sh in developer-notes.md
+      Add "export LC_ALL=C" to all shell scripts
+      Add linter: Make sure all shell scripts opt out of locale dependence using "export LC_ALL=C"
+      Explicitly specify encoding when opening text files in Python code
+      Add linter: Make sure we explicitly open all text files using UTF-8 or ASCII encoding in Python
+      macOS fix: Work around empty (sub)expression error when using BSD grep
+      macOS fix: Add excludes for checks added in the newer shellcheck version installed by brew
+      Remove repeated suppression. Fix indentation.
+      Fix warnings introduced in shellcheck v0.6.0
+      Remove no longer needed shellcheck suppressions
+      Follow-up to #13454: Fix broken build by exporting LC_ALL=C
+      Remove unused variables in shell scripts.
+
+Jack Grigg (5):
+      Small documentation fixes
+      lints: Add a missing copyright header
+      lint: Allow stoi in src/rpc/blockchain.cpp
+      lint: Remove some subtrees from exclusion
+      doc: Adjust subtree developer notes to refer to Zcash
+
+vim88 (1):
+      Scripts and tools & Docs: Used #!/usr/bin/env bash instead of obsolete #!/bin/bash, added linting for .sh files shebang and updated the Developer Notes.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-4.2.0-rc1.md b/depend/zcash/doc/release-notes/release-notes-4.2.0-rc1.md
new file mode 100644
index 000000000..f8d721111
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-4.2.0-rc1.md
@@ -0,0 +1,242 @@
+Notable changes
+===============
+
+Switch to ed25519-zebra for consensus signature checks
+------------------------------------------------------
+This removes the zcashd dependency upon libsodium for ed25519
+signature checks and instead uses the Rust implementation in
+ed25519-zebra, which has been active for signature verification
+since the Canopy upgrade. For more information on the conditions
+that led to this change see https://hdevalence.ca/blog/2020-10-04-its-25519am
+
+Update default fees according to ZIP-313
+----------------------------------------
+Reduce default fees to 0.00001 ZEC as specified in ZIP-313 and 
+ensure that transactions paying at least the new minimum fee meet
+the transaction relay threshold irrespective of transaction size.
+
+Improve getblocktemplate rpc performance when using shielded coinbase
+---------------------------------------------------------------------
+This change precomputes future block templates to permit miners to
+begin working atop newly arrived blocks as quickly as possible, rather
+than waiting for a new template to be generated after a block has arrived.
+It also reduces the initial the wait time for incorporating new mempool 
+transactions into a block from 1 minute to 10 seconds; the previous value
+was inherited from the upstream bitcoin codebase but is inappropriate for
+our block timing.
+
+Migrate from rpc-tests.sh to rpc-tests.py
+-----------------------------------------
+This unifies and simplifies the RPC testing framework, as has
+been done in the upstream Bitcoin codebase.
+
+Changelog
+=========
+
+Alex Morcos (2):
+      Reorder RPC tests for running time
+      remove obsolete run-bitcoind-for-test.sh
+
+Alfredo Garcia (1):
+      add address to z_importviewingkey error
+
+Casey Rodarmor (1):
+      Add p2p-fullblocktest.py
+
+Chun Kuan Lee (2):
+      gui: get special folder in unicode
+      refactor: Drop boost::this_thread::interruption_point and boost::thread_interrupted in main thread
+
+Cory Fields (1):
+      build: a few ugly hacks to get the rpc tests working out-of-tree
+
+Daira Hopwood (5):
+      Windows cross-build generates .lib files, which should be ignored by git and removed by clean.
+      Partial revert of "Update links". See #4904
+      Fix a typo introduced in #4904.
+      Reduce the default fee for z_* operations, and the "low fee penalty" threshold for mempool limiting, to 1000 zatoshis.
+      Always allow transactions paying at least DEFAULT_FEE to be relayed, and do not rate-limit them. In other words, make sure that the "minimum relay fee" is no greater than DEFAULT_FEE.
+
+Daniel Kraft (1):
+      Fix crash when mining with empty keypool.
+
+Dimitris Apostolou (5):
+      Fix typo
+      readelf is Linux only
+      Fix readelf configuration
+      Update links
+      Remove workaround affecting old Boost version
+
+Elliot Olds (1):
+      Check if zmq is installed in tests, update docs
+
+Eric Lombrozo (1):
+      Added fPowNoRetargeting field to Consensus::Params that disables nBits recalculation.
+
+Jack Grigg (32):
+      test: Use default shielded address in RPC tests where the type is irrelevant
+      Revert "remove SignatureHash from python rpc tests"
+      test: Remove FindAndDelete from RPC test framework
+      test: Fix SignatureHash RPC test helper
+      test: Set hashFinalSaplingRoot default correctly in create_block
+      test: Re-enable regtest difficulty adjustment for unit tests that use it
+      test: Adjust some Zcash RPC tests to work with parallel runner
+      test: Run rpc-tests.py in full_test_suite.py
+      lint: Remove boost/foreach.hpp from allowed includes
+      test: Silence pyflakes unused import warning
+      test: Run shielding-heavy RPC tests in serial
+      Fix Hungarian notation nit from Daira
+      Switch to ed25519-zebra for consensus signature checks
+      test: Use ed25519_verify in ConsensusTests
+      Update minimum chain work and set activation block hashes for mainnet
+      Update minimum chain work and set activation block hashes for testnet
+      net: Rework CNode spans
+      rpc: Reload CNode spans after reloading the log filter
+      rpc: Log the new filter when we set it
+      mempool: Log all accepted txids at INFO level
+      Add <variant> header to files that will need it
+      scripted-diff: Migrate from boost::variant to std::variant
+      Finish migrating to std::variant
+      Migrate from boost::optional::get to boost::optional::value
+      Add <optional> header to files that will need it
+      scripted-diff: Migrate from boost::optional to std::optional
+      Finish migrating to std::optional
+      lint: Remove boost::variant and boost::optional from allowed includes
+      test: Fix test_bitcoin compilation on macOS High Sierra
+      cargo update
+      tracing: Remove unnecessary tracing_init_inner internal function
+      tracing: Simplify init logic using optional layers
+
+James O'Beirne (2):
+      Add tests for gettxoutsetinfo, CLevelDBBatch, CLevelDBIterator
+      Add basic coverage reporting for RPC tests
+
+Jeff Garzik (1):
+      qa/pull-tester/rpc-tests.py: chmod 0755
+
+Jesse Cohen (1):
+      [doc][trivial] no retargeting in regtest mode
+
+John Newbery (6):
+      Use configparser in rpc-tests.py
+      Use argparse in rpc_tests.py
+      Improve rpc-tests.py arguments
+      Refactor rpc-tests.py
+      Various review markups for rpc-tests.py improvements
+      Add exclude option to rpc-tests.py
+
+Jorge Timón (8):
+      Small preparations for Q_FOREACH, PAIRTYPE and #include <boost/foreach.hpp> removal
+      scripted-diff: Fully remove BOOST_FOREACH
+      scripted-diff: Remove PAIRTYPE
+      Introduce src/reverse_iterator.hpp and include it...
+      Fix const_reverse_iterator constructor (pass const ptr)
+      scripted-diff: Remove BOOST_REVERSE_FOREACH
+      scripted-diff: Remove #include <boost/foreach.hpp>
+      clang-format: Delete ForEachMacros
+
+Josh Ellithorpe (1):
+      Include transaction hex in verbose getblock output
+
+Kris Nuttycombe (7):
+      Write down the folklore about nSequence
+      Prefer explicit passing of CChainParams to the Params() global.
+      Remove vestigial OSX_SDK_VERSION from darwin build.
+      Update boost to 1.75, postpone other updates.
+      Don't log to stdout if a file logger is configured.
+      make-release.py: Versioning changes for 4.2.0-rc1.
+      make-release.py: Updated manpages for 4.2.0-rc1.
+
+Larry Ruane (2):
+      add more version information to getinfo rpc
+      improve getblocktemplate performance for shielded coinbase
+
+Luv Khemani (1):
+      Add autocomplete to bitcoin-qt's console window.
+
+Marco Falke (37):
+      [doc] trivial: fix markdown syntax in qa/rpc-tests/README.md
+      [rpc-tests] fundrawtransaction: Update fee after minRelayTxFee increase
+      [rpc-tests] Check return code
+      [qa] Split README.md to /qa and /qa/rpc-tests
+      [qa] Extend README.md
+      [qa] keypool: Fix white space to prepare transition to test framework
+      [qa] keypool: DRY: Use test framework
+      [qa] pull-tester: Cleanup (run keypool, tidy stdout)
+      [qa] Use python2/3 syntax
+      [qa] rpc-tests: Properly use integers, floats
+      [qa] mininode: Catch exceptions in got_data
+      [qa] pull-tester: Don't mute zmq ImportError
+      [qa] pull-tester: Exit early when no tests are run
+      [qa] rpc-tests: Fix link in comment and label error msg
+      [qa] Switch to py3
+      [qa] Refactor test_framework and pull tester
+      [qa] Update README.md
+      [qa] Stop other nodes, even when one fails to stop
+      [qa] pull-tester: Adjust comment
+      [qa] pull-tester: Run rpc test in parallel
+      [qa] Add option --portseed to test_framework
+      [qa] Remove hardcoded "4 nodes" from test_framework
+      [qa] test_framework: Append portseed to tmpdir
+      [qa] test_framework: Use different rpc_auth_pair for each node
+      [qa] pull-tester: Fix assertion and check for run_parallel
+      [qa] pull-tester: Start longest test first
+      [qa] Adjust timeouts for micro-optimization of run time
+      [qa] Use single cache dir for chains
+      [qa] Remove unused code
+      [qa] pull-tester: Don't mute zmq ImportError
+      [qa] create_cache: Delete temp dir when done
+      [qa] Refactor RPCTestHandler to prevent TimeoutExpired
+      [qa] pull-tester: Only print output when failed
+      [qa] test_framework: Exit when tmpdir exists
+      [qa] rpc-tests: Apply random offset to portseed
+      qa: Set correct path for binaries in rpc tests
+      util: Replace boost::signals2 with std::function
+
+Nate Wilcox (1):
+      configure.ac: Introduce macros to simplify requiring tools.
+
+Suhas Daftuar (2):
+      Remove unmaintained example test script_test.py
+      Tests: add timeout to sync_blocks() and sync_mempools()
+
+Wladimir J. van der Laan (2):
+      build: don't distribute tests_config.py
+      test: don't override BITCOIND and BITCOINCLI if they're set
+
+fanquake (4):
+      [doc] Add OS X ZMQ requirement to QA readme
+      [trivial] Add tests_config.ini to .gitignore
+      [qa][doc] Correct rpc test options in readme
+      build: set minimum supported macOS to 10.14
+
+furszy (15):
+      wallet:AvailableCoins fOnlySpendable filtering flag implemented + connected to sendmany async operation.
+      wallet:AvailableCoins nMinDepth filter implemented + connected to sendmany async operation.
+      asyncrpcoperation_sendmany::find_utxos removing a redundant coinbase check, coinbases are already being filtered by the AvailableCoins flag.
+      wallet:AvailableCoins filter by destination/s feature implemented + connected to sendmany async operation.
+      sendmany::find_utxo removing an unneeded recursive lock, AvailableCoins is already locking cs_main and cs_wallet.
+      wallet:COutput adding fIsCoinbase member.
+      COutput: implemented Value() method.
+      asyncRPCOperation_sendmany:find_utxos, removing a redundant loop over all of the available utxo in the wallet.
+      sendmany: removing now unused SendManyInputUTXO class.
+      move-only: asyncOp_sendmany, target amount calculation moved before find inputs (utxos and notes).
+      sendmany operation: Creating TxValues struct to store the transaction values in a more organized manner.
+      Improving asyncoperation_sendmany, removing another redundant for loop over all of the available utxos.
+      rpc_wallet_tests: changed "Insufficient funds" error message to a proper "Insufficient transparent funds". This is because we are now throwing the insufficient transparent balance rpc error inside load_utxo.
+      asyncOp sendmany: moved inputs total amount check inside load_utxo before the dust validation.
+      sendmany::find_unspent_notes removing an unneeded recursive lock, GetFilteredNotes is already locking cs_main and cs_wallet.
+
+isle2983 (1):
+      [doc] - clarify statement about parallel jobs in rpc-tests.py
+
+Marshall Gaucher (1):
+      Update expected fails for  Sprout txns flows on Canopy
+
+ptschip (1):
+      Migrated rpc-tests.sh to all python rpc-tests.py
+
+whythat (2):
+      [qa]: add parsing for '<host>:<port>' argument form to rpc_url()
+      [qa]: enable rpcbind_test
+
diff --git a/depend/zcash/doc/release-notes/release-notes-4.2.0.md b/depend/zcash/doc/release-notes/release-notes-4.2.0.md
new file mode 100644
index 000000000..aa7ed583f
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-4.2.0.md
@@ -0,0 +1,247 @@
+Notable changes
+===============
+
+Switch to ed25519-zebra for consensus signature checks
+------------------------------------------------------
+This removes the zcashd dependency upon libsodium for ed25519
+signature checks and instead uses the Rust implementation in
+ed25519-zebra, which has been active for signature verification
+since the Canopy upgrade. For more information on the conditions
+that led to this change see https://hdevalence.ca/blog/2020-10-04-its-25519am
+
+Update default fees according to ZIP-313
+----------------------------------------
+Reduce default fees to 0.00001 ZEC as specified in ZIP-313 and 
+ensure that transactions paying at least the new minimum fee meet
+the transaction relay threshold irrespective of transaction size.
+
+Improve getblocktemplate rpc performance when using shielded coinbase
+---------------------------------------------------------------------
+This change precomputes future block templates to permit miners to
+begin working atop newly arrived blocks as quickly as possible, rather
+than waiting for a new template to be generated after a block has arrived.
+It also reduces the initial the wait time for incorporating new mempool 
+transactions into a block from 1 minute to 10 seconds; the previous value
+was inherited from the upstream bitcoin codebase but is inappropriate for
+our block timing.
+
+Migrate from rpc-tests.sh to rpc-tests.py
+-----------------------------------------
+This unifies and simplifies the RPC testing framework, as has
+been done in the upstream Bitcoin codebase.
+
+Changelog
+=========
+
+Alex Morcos (2):
+      Reorder RPC tests for running time
+      remove obsolete run-bitcoind-for-test.sh
+
+Alfredo Garcia (1):
+      add address to z_importviewingkey error
+
+Casey Rodarmor (1):
+      Add p2p-fullblocktest.py
+
+Chun Kuan Lee (2):
+      gui: get special folder in unicode
+      refactor: Drop boost::this_thread::interruption_point and boost::thread_interrupted in main thread
+
+Cory Fields (1):
+      build: a few ugly hacks to get the rpc tests working out-of-tree
+
+Daira Hopwood (7):
+      Windows cross-build generates .lib files, which should be ignored by git and removed by clean.
+      Partial revert of "Update links". See #4904
+      Fix a typo introduced in #4904.
+      Reduce the default fee for z_* operations, and the "low fee penalty" threshold for mempool limiting, to 1000 zatoshis.
+      Always allow transactions paying at least DEFAULT_FEE to be relayed, and do not rate-limit them. In other words, make sure that the "minimum relay fee" is no greater than DEFAULT_FEE.
+      gtest/test_mempoollimit: the test failed to properly ensure that the "low fee penalty" threshold matches the new ZIP 313 fee.
+      Revert changes in #4916 that assumed arguments represent fees, when they are actually number of confirmations.
+
+Daniel Kraft (1):
+      Fix crash when mining with empty keypool.
+
+Dimitris Apostolou (5):
+      Fix typo
+      readelf is Linux only
+      Fix readelf configuration
+      Update links
+      Remove workaround affecting old Boost version
+
+Elliot Olds (1):
+      Check if zmq is installed in tests, update docs
+
+Eric Lombrozo (1):
+      Added fPowNoRetargeting field to Consensus::Params that disables nBits recalculation.
+
+Jack Grigg (32):
+      test: Use default shielded address in RPC tests where the type is irrelevant
+      Revert "remove SignatureHash from python rpc tests"
+      test: Remove FindAndDelete from RPC test framework
+      test: Fix SignatureHash RPC test helper
+      test: Set hashFinalSaplingRoot default correctly in create_block
+      test: Re-enable regtest difficulty adjustment for unit tests that use it
+      test: Adjust some Zcash RPC tests to work with parallel runner
+      test: Run rpc-tests.py in full_test_suite.py
+      lint: Remove boost/foreach.hpp from allowed includes
+      test: Silence pyflakes unused import warning
+      test: Run shielding-heavy RPC tests in serial
+      Fix Hungarian notation nit from Daira
+      Switch to ed25519-zebra for consensus signature checks
+      test: Use ed25519_verify in ConsensusTests
+      Update minimum chain work and set activation block hashes for mainnet
+      Update minimum chain work and set activation block hashes for testnet
+      net: Rework CNode spans
+      rpc: Reload CNode spans after reloading the log filter
+      rpc: Log the new filter when we set it
+      mempool: Log all accepted txids at INFO level
+      Add <variant> header to files that will need it
+      scripted-diff: Migrate from boost::variant to std::variant
+      Finish migrating to std::variant
+      Migrate from boost::optional::get to boost::optional::value
+      Add <optional> header to files that will need it
+      scripted-diff: Migrate from boost::optional to std::optional
+      Finish migrating to std::optional
+      lint: Remove boost::variant and boost::optional from allowed includes
+      test: Fix test_bitcoin compilation on macOS High Sierra
+      cargo update
+      tracing: Remove unnecessary tracing_init_inner internal function
+      tracing: Simplify init logic using optional layers
+
+James O'Beirne (2):
+      Add tests for gettxoutsetinfo, CLevelDBBatch, CLevelDBIterator
+      Add basic coverage reporting for RPC tests
+
+Jeff Garzik (1):
+      qa/pull-tester/rpc-tests.py: chmod 0755
+
+Jesse Cohen (1):
+      [doc][trivial] no retargeting in regtest mode
+
+John Newbery (6):
+      Use configparser in rpc-tests.py
+      Use argparse in rpc_tests.py
+      Improve rpc-tests.py arguments
+      Refactor rpc-tests.py
+      Various review markups for rpc-tests.py improvements
+      Add exclude option to rpc-tests.py
+
+Jorge Timón (8):
+      Small preparations for Q_FOREACH, PAIRTYPE and #include <boost/foreach.hpp> removal
+      scripted-diff: Fully remove BOOST_FOREACH
+      scripted-diff: Remove PAIRTYPE
+      Introduce src/reverse_iterator.hpp and include it...
+      Fix const_reverse_iterator constructor (pass const ptr)
+      scripted-diff: Remove BOOST_REVERSE_FOREACH
+      scripted-diff: Remove #include <boost/foreach.hpp>
+      clang-format: Delete ForEachMacros
+
+Josh Ellithorpe (1):
+      Include transaction hex in verbose getblock output
+
+Kris Nuttycombe (10):
+      Write down the folklore about nSequence
+      Prefer explicit passing of CChainParams to the Params() global.
+      Remove vestigial OSX_SDK_VERSION from darwin build.
+      Update boost to 1.75, postpone other updates.
+      Don't log to stdout if a file logger is configured.
+      make-release.py: Versioning changes for 4.2.0-rc1.
+      make-release.py: Updated manpages for 4.2.0-rc1.
+      make-release.py: Updated release notes and changelog for 4.2.0-rc1.
+      make-release.py: Versioning changes for 4.2.0.
+      make-release.py: Updated manpages for 4.2.0.
+
+Larry Ruane (2):
+      add more version information to getinfo rpc
+      improve getblocktemplate performance for shielded coinbase
+
+Luv Khemani (1):
+      Add autocomplete to bitcoin-qt's console window.
+
+Marco Falke (37):
+      [doc] trivial: fix markdown syntax in qa/rpc-tests/README.md
+      [rpc-tests] fundrawtransaction: Update fee after minRelayTxFee increase
+      [rpc-tests] Check return code
+      [qa] Split README.md to /qa and /qa/rpc-tests
+      [qa] Extend README.md
+      [qa] keypool: Fix white space to prepare transition to test framework
+      [qa] keypool: DRY: Use test framework
+      [qa] pull-tester: Cleanup (run keypool, tidy stdout)
+      [qa] Use python2/3 syntax
+      [qa] rpc-tests: Properly use integers, floats
+      [qa] mininode: Catch exceptions in got_data
+      [qa] pull-tester: Don't mute zmq ImportError
+      [qa] pull-tester: Exit early when no tests are run
+      [qa] rpc-tests: Fix link in comment and label error msg
+      [qa] Switch to py3
+      [qa] Refactor test_framework and pull tester
+      [qa] Update README.md
+      [qa] Stop other nodes, even when one fails to stop
+      [qa] pull-tester: Adjust comment
+      [qa] pull-tester: Run rpc test in parallel
+      [qa] Add option --portseed to test_framework
+      [qa] Remove hardcoded "4 nodes" from test_framework
+      [qa] test_framework: Append portseed to tmpdir
+      [qa] test_framework: Use different rpc_auth_pair for each node
+      [qa] pull-tester: Fix assertion and check for run_parallel
+      [qa] pull-tester: Start longest test first
+      [qa] Adjust timeouts for micro-optimization of run time
+      [qa] Use single cache dir for chains
+      [qa] Remove unused code
+      [qa] pull-tester: Don't mute zmq ImportError
+      [qa] create_cache: Delete temp dir when done
+      [qa] Refactor RPCTestHandler to prevent TimeoutExpired
+      [qa] pull-tester: Only print output when failed
+      [qa] test_framework: Exit when tmpdir exists
+      [qa] rpc-tests: Apply random offset to portseed
+      qa: Set correct path for binaries in rpc tests
+      util: Replace boost::signals2 with std::function
+
+Nate Wilcox (1):
+      configure.ac: Introduce macros to simplify requiring tools.
+
+Suhas Daftuar (2):
+      Remove unmaintained example test script_test.py
+      Tests: add timeout to sync_blocks() and sync_mempools()
+
+Wladimir J. van der Laan (2):
+      build: don't distribute tests_config.py
+      test: don't override BITCOIND and BITCOINCLI if they're set
+
+fanquake (4):
+      [doc] Add OS X ZMQ requirement to QA readme
+      [trivial] Add tests_config.ini to .gitignore
+      [qa][doc] Correct rpc test options in readme
+      build: set minimum supported macOS to 10.14
+
+furszy (15):
+      wallet:AvailableCoins fOnlySpendable filtering flag implemented + connected to sendmany async operation.
+      wallet:AvailableCoins nMinDepth filter implemented + connected to sendmany async operation.
+      asyncrpcoperation_sendmany::find_utxos removing a redundant coinbase check, coinbases are already being filtered by the AvailableCoins flag.
+      wallet:AvailableCoins filter by destination/s feature implemented + connected to sendmany async operation.
+      sendmany::find_utxo removing an unneeded recursive lock, AvailableCoins is already locking cs_main and cs_wallet.
+      wallet:COutput adding fIsCoinbase member.
+      COutput: implemented Value() method.
+      asyncRPCOperation_sendmany:find_utxos, removing a redundant loop over all of the available utxo in the wallet.
+      sendmany: removing now unused SendManyInputUTXO class.
+      move-only: asyncOp_sendmany, target amount calculation moved before find inputs (utxos and notes).
+      sendmany operation: Creating TxValues struct to store the transaction values in a more organized manner.
+      Improving asyncoperation_sendmany, removing another redundant for loop over all of the available utxos.
+      rpc_wallet_tests: changed "Insufficient funds" error message to a proper "Insufficient transparent funds". This is because we are now throwing the insufficient transparent balance rpc error inside load_utxo.
+      asyncOp sendmany: moved inputs total amount check inside load_utxo before the dust validation.
+      sendmany::find_unspent_notes removing an unneeded recursive lock, GetFilteredNotes is already locking cs_main and cs_wallet.
+
+isle2983 (1):
+      [doc] - clarify statement about parallel jobs in rpc-tests.py
+
+Marshall Gaucher (1):
+      Update expected fails for  Sprout txns flows on Canopy
+
+ptschip (1):
+      Migrated rpc-tests.sh to all python rpc-tests.py
+
+whythat (2):
+      [qa]: add parsing for '<host>:<port>' argument form to rpc_url()
+      [qa]: enable rpcbind_test
+
diff --git a/depend/zcash/doc/release-notes/release-notes-4.3.0-rc1.md b/depend/zcash/doc/release-notes/release-notes-4.3.0-rc1.md
new file mode 100644
index 000000000..bb43600e5
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-4.3.0-rc1.md
@@ -0,0 +1,320 @@
+Notable changes
+===============
+
+Reduce download traffic
+-----------------------
+
+We have made several changes to reduce the amount of data downloaded by `zcashd`
+during initial block download (IBD):
+
+- Significant time and bandwidth is spent in issuing `getheaders` P2P requests.
+  This results in noticeable bandwidth usage due to the large size of Zcash
+  block headers.
+
+  We now eliminate redundant requests in cases where we already know the last
+  header in the message. This optimization is enabled by default, but can be
+  disabled by setting the config option `-no-optimize-getheaders`.
+
+- Transactions in the mempool are no longer downloaded during IBD (`zcashd` will
+  only request block data).
+
+Reduce upload traffic
+---------------------
+
+A major part of the outbound traffic is caused by serving historic blocks to
+other nodes in initial block download state.
+
+It is now possible to reduce the total upload traffic via the `-maxuploadtarget`
+parameter. This is *not* a hard limit but a threshold to minimize the outbound
+traffic. When the limit is about to be reached, the uploaded data is cut by not
+serving historic blocks (blocks older than one week).
+Moreover, any SPV peer is disconnected when they request a filtered block.
+
+This option can be specified in MiB per day and is turned off by default
+(`-maxuploadtarget=0`).
+The recommended minimum is 1152 * MAX_BLOCK_SIZE (currently 2304MB) per day.
+
+Whitelisted peers will never be disconnected, although their traffic counts for
+calculating the target.
+
+A more detailed documentation about keeping traffic low can be found in
+[/doc/reduce-traffic.md](/doc/reduce-traffic.md).
+
+`libzcashconsensus` replaced by `libzcash_script`
+-------------------------------------------------
+
+The `libzcashconsensus` library inherited from upstream has been unusable since
+the Overwinter network upgrade in 2018. We made changes to signature digests
+similar to those made in Bitcoin's SegWit, which required additional per-input
+data that could not be added to the existing APIs without breaking backwards
+compatibility.
+
+Additionally, it has become increasingly inaccurately named; it only covers
+(Zcash's subset of) the Bitcoin scripting system, and not the myriad of other
+consensus changes: in particular, Zcash's shielded pools.
+
+We have now renamed the library to `libzcash_script`, and reworked it to instead
+focus on transparent script verification:
+
+- The script verification APIs are altered to take `consensusBranchId` and
+  `amount` fields.
+- New precomputing APIs have been added that enable multiple transparent inputs
+  on a single transaction to be verified more efficiently.
+- Equihash has been removed from the compiled library. The canonical Equihash
+  validator is the [`equihash` Rust crate](https://crates.io/crates/equihash)
+  since v3.1.0.
+
+The C++ library can be built by compiling `zcashd` with the environment variable
+`CONFIGURE_FLAGS=--with-libs`. It is also wrapped as the
+[`zcash_script` Rust crate](https://crates.io/crates/zcash_script)
+(maintained by the Zcash Foundation for use in `zebrad`).
+
+Other P2P Changes
+-----------------
+
+The list of banned peers is now stored on disk rather than in memory. Restarting
+`zcashd` will no longer clear out the list of banned peers; instead the
+`clearbanned` RPC call can be used to manually clear the list. The `setban` RPC
+call can also be used to manually ban or unban a peer.
+
+Build system updates
+--------------------
+
+- We now build with Clang 11 and Rust 1.49.
+- We have downgraded Boost to 1.74 to mitigate `statx`-related breakage in some
+  container environments.
+
+Changelog
+=========
+
+Alex Wied (3):
+      Add support for FreeBSD 12
+      Set rust_target for all FreeBSD versions
+      Use parentheses for defined in windows-unused-variables.diff
+
+Alfredo Garcia (3):
+      split wallet.py tests
+      hide password in -stdin `walletpassphrase` command
+      Apply suggestions from code review
+
+Bernhard M. Wiedemann (1):
+      Make tests pass after 2020
+
+BtcDrak (1):
+      Remove bad chain alert partition check
+
+Carl Dong (13):
+      build: Add variable printing target to Makefiles
+      depends: Propagate well-known vars into depends
+      depends: boost: Specify toolset to bootstrap.sh
+      depends: boost: Split target-os from toolset
+      depends: boost: Use clang toolset if clang in CXX
+      depends: Propagate only specific CLI variables to sub-makes
+      depends: boost: Refer to version in URL
+      depends: boost: Split into non-/native packages
+      depends: boost: Disable all compression
+      depends: boost: Cleanup architecture/address-model
+      depends: boost: Cleanup toolset selection
+      depends: boost: Remove unnecessary _archiver_
+      depends: boost: Specify cflags+compileflags
+
+Casey Rodarmor (3):
+      Make limited map actually respect max size
+      Disallow unlimited limited maps
+      Add limitedmap test
+
+Cory Fields (6):
+      depends: fix boost mac cross build with clang 9+
+      build: add missing leveldb defines
+      net: make Ban/Unban/ClearBan functionality consistent
+      net: No need to export DumpBanlist
+      net: move CBanDB and CAddrDB out of net.h/cpp
+      net: Drop CNodeRef for AttemptToEvictConnection
+
+Daira Hopwood (2):
+      qa/zcash/updatecheck.py: remove dead code; print instructions to run `cargo outdated` and `cargo update`.
+      Ensure that `CONFIGURE_FLAGS=--enable-debug` correctly uses -O0 for dependencies and main build.
+
+Daniel Kraft (1):
+      doc: add comment explaining initial header request
+
+Dimitris Apostolou (1):
+      Discord invite instead of direct link
+
+Ethan Heilman (1):
+      Fix de-serialization bug where AddrMan is corrupted after exception * CAddrDB modified so that when de-serialization code throws an exception Addrman is reset to a clean state * CAddrDB modified to make unit tests possible * Regression test created to ensure bug is fixed * StartNode modifed to clear adrman if CAddrDB::Read returns an error code.
+
+Gregory Maxwell (2):
+      Return early in IsBanned.
+      Disconnect on mempool requests from peers when over the upload limit.
+
+Igor Cota (1):
+      Define TARGET_OS when host is android
+
+Jack Grigg (41):
+      Add JSDescriptionInfo for constructing JSDescriptions
+      Remove JSDescription::h_sig
+      prevector: Terminate without logging on failed allocation
+      Remove init_and_check_sodium from crypto/common.h
+      Store inputs and outputs by reference in JSDescriptionInfo
+      depends: Update Rust to 1.49.0
+      rust: Use renamed broken_intra_doc_links lint
+      depends: cargo update
+      depends: Move to Clang 11
+      depends: Fix Boost warnings under Clang 11
+      depends: Allow per-host package download paths
+      depends: Ensure the native_clang download path is for the builder
+      Revert "Update boost to 1.75, postpone other updates."
+      qa: Postpone Boost and native_b2 updates
+      QA: Remove unused update postponements
+      QA: Postpone BDB update again
+      depends: ZeroMQ 4.3.4
+      depends: Postpone updates that require adding CMake
+      cargo update
+      Squashed 'src/univalue/' changes from 9ef5b78c1..98fadc090
+      Remove crypto/equihash from libzcashconsensus
+      Add amount and consensus branch ID to zcashconsensus_verify_script
+      Rename src/script/zcashconsensus.* -> src/script/zcash_script.*
+      Rename zcashconsensus_* -> zcash_script_* in APIs
+      Rename libzcashconsensus.la -> libzcash_script.la
+      Set up an mdbook in which we can document zcashd's architecture design
+      Actions: Add a workflow to deploy the zcashd book
+      Show README as root of zcashd book
+      Link to zips.z.cash for protocol spec
+      test: Convert Bech32 test vectors into known-answer test vectors
+      zcash_script: Add API to verify scripts with precomputed tx data
+      test: Migrate maxuploadtarget.py to Python 3
+      Pass current PoWTargetSpacing() into CNode::OutboundTargetReached()
+      init: Pass post-Blossom spacing into CNode::SetMaxOutboundTarget()
+      Fix some typos
+      zcash_script: Clarify return values in docs
+      Rename responsible_disclosure.md to SECURITY.md
+      Add IBD download traffic reduction to release notes
+      Fill out the rest of the 4.3.0 release notes
+      make-release.py: Versioning changes for 4.3.0-rc1.
+      make-release.py: Updated manpages for 4.3.0-rc1.
+
+Jeremy Rubin (1):
+      Minimal fix to slow prevector tests as stopgap measure
+
+Jonas Schnelli (14):
+      banlist.dat: store banlist on disk
+      CAddrDB/CBanDB: change filesize variables from int to uint64_t
+      use CBanEntry as object container for banned nodes
+      Adding CSubNet constructor over a single CNetAddr
+      [Qt] add ui signal for banlist changes
+      [Qt] banlist, UI optimizing and better signal handling
+      net: use CIDR notation in CSubNet::ToString()
+      [QA] fix netbase tests because of new CSubNet::ToString() output
+      Introduce -maxuploadtarget
+      [doc] add documentation how to reduce traffic
+      don't enforce maxuploadtargets disconnect for whitelisted peers
+      [docs] rename reducetraffic.md to reduce-traffic.md
+      add documentation for exluding whitelistes peer from maxuploadtarget
+      add (max)uploadtarget infos to getnettotals RPC help
+
+Josh Lehan (1):
+      Re-organize -maxconnections option handling
+
+Karel Bilek (1):
+      scripted-diff: Use UniValue.pushKV instead of push_back(Pair())
+
+Kaz Wesley (4):
+      fix race that could fail to persist a ban
+      prevector: destroy elements only via erase()
+      test prevector::swap
+      prevector::swap: fix (unreached) data corruption
+
+Kris Nuttycombe (4):
+      Skip "tx" messages during initial block download.
+      Fix pyflakes complaints
+      Whitespace-only fix in chainparams.cpp
+      Update the maxuploadtarget.py tests to accommodate zcash.
+
+Larry Ruane (1):
+      #4624 improve IBD sync by eliminating getheaders requests
+
+Marco Falke (3):
+      [net] Cleanup maxuploadtarget
+      [doc] Add -maxuploadtarget release notes
+      [walletdb] Add missing LOCK() in Recover() for dummyWallet
+
+Marius Kjærstad (3):
+      Update _COPYRIGHT_YEAR in configure.ac to 2021
+      Update COPYRIGHT_YEAR in clientversion.h to 2021
+      Update of copyright year to 2021
+
+Matt Corallo (6):
+      Default to defining endian-conversion DECLs in compat w/o config
+      Make fDisconnect an std::atomic
+      Make fImporting an std::atomic
+      Fix AddrMan locking
+      Remove double brackets in addrman
+      Fix unlocked access to vNodes.size()
+
+Patrick Strateman (1):
+      Avoid recalculating vchKeyedNetGroup in eviction logic.
+
+Peter Bushnell (1):
+      depends: Consistent use of package variable
+
+Peter Todd (1):
+      Remove LOCK(cs_main) from decodescript
+
+Philip Kaufmann (4):
+      banlist: update set dirty to be more fine grained
+      banlist: better handling of banlist in StartNode()
+      banlist: add more banlist infos to log / add GUI signal
+      banlist (bugfix): allow CNode::SweepBanned() to run on interval
+
+Pieter Wuille (11):
+      Add SipHash-2-4 primitives to hash
+      Use SipHash-2-4 for CCoinsCache index
+      Switch CTxMempool::mapTx to use a hash index for txids
+      Use SipHash-2-4 for address relay selection
+      Add extra message to avoid a long 'Loading banlist'
+      Support SipHash with arbitrary byte writes
+      Use 64-bit SipHash of netgroups in eviction
+      Use C++11 thread-safe static initializers
+      Add ChaCha20
+      Switch FastRandomContext to ChaCha20
+      Add a FastRandomContext::randrange and use it
+
+Suhas Daftuar (1):
+      Add RPC test for -maxuploadtarget
+
+Taylor Hornby (2):
+      Move the github API token out of updatecheck.py into an untracked file.
+      Document the required .updatecheck-token file in the release docs
+
+Wladimir J. van der Laan (6):
+      build: Updates for OpenBSD
+      net: Fix CIDR notation in ToString()
+      test: Add more test vectors for siphash
+      timedata: Prevent warning overkill
+      Always allow getheaders from whitelisted peers
+      rpc: remove cs_main lock from `createrawtransaction`
+
+fanquake (2):
+      [build] Add NETBSD leveldb target to configure.ac
+      [doc] Improve lanaguge in reducetraffic.md
+
+kirkalx (1):
+      peers.dat, banlist.dat recreated when missing
+
+randy-waterhouse (1):
+      Re-instate TARGET_OS=linux in configure.ac. Removed by 351abf9e035.
+
+Jack Grigg (1):
+      Update URL for Zcash Foundation security policy
+
+Ying Tong Lai (2):
+      Cargo update
+      Postpone dependencies
+
+tulip (1):
+      Move time data log print to 'net' category to reduce log noise
+
+Benjamin Winston (1):
+      Added foundation to responsible_disclosure.md
+
diff --git a/depend/zcash/doc/release-notes/release-notes-4.3.0.md b/depend/zcash/doc/release-notes/release-notes-4.3.0.md
new file mode 100644
index 000000000..7bfbff125
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-4.3.0.md
@@ -0,0 +1,331 @@
+Notable changes
+===============
+
+Reduce download traffic
+-----------------------
+
+We have made several changes to reduce the amount of data downloaded by `zcashd`
+during initial block download (IBD):
+
+- Significant time and bandwidth is spent in issuing `getheaders` P2P requests.
+  This results in noticeable bandwidth usage due to the large size of Zcash
+  block headers.
+
+  We now eliminate redundant requests in cases where we already know the last
+  header in the message. This optimization is enabled by default, but can be
+  disabled by setting the config option `-nooptimize-getheaders`.
+
+- Transactions in the mempool are no longer downloaded during IBD (`zcashd` will
+  only request block data).
+
+Reduce upload traffic
+---------------------
+
+A major part of the outbound traffic is caused by serving historic blocks to
+other nodes in initial block download state.
+
+It is now possible to reduce the total upload traffic via the `-maxuploadtarget`
+parameter. This is *not* a hard limit but a threshold to minimize the outbound
+traffic. When the limit is about to be reached, the uploaded data is cut by not
+serving historic blocks (blocks older than one week).
+Moreover, any SPV peer is disconnected when they request a filtered block.
+
+This option can be specified in MiB per day and is turned off by default
+(`-maxuploadtarget=0`).
+The recommended minimum is 1152 * MAX_BLOCK_SIZE (currently 2304MB) per day.
+
+Whitelisted peers will never be disconnected, although their traffic counts for
+calculating the target.
+
+A more detailed documentation about keeping traffic low can be found in
+[/doc/reduce-traffic.md](/doc/reduce-traffic.md).
+
+`libzcashconsensus` replaced by `libzcash_script`
+-------------------------------------------------
+
+The `libzcashconsensus` library inherited from upstream has been unusable since
+the Overwinter network upgrade in 2018. We made changes to signature digests
+similar to those made in Bitcoin's SegWit, which required additional per-input
+data that could not be added to the existing APIs without breaking backwards
+compatibility.
+
+Additionally, it has become increasingly inaccurately named; it only covers
+(Zcash's subset of) the Bitcoin scripting system, and not the myriad of other
+consensus changes: in particular, Zcash's shielded pools.
+
+We have now renamed the library to `libzcash_script`, and reworked it to instead
+focus on transparent script verification:
+
+- The script verification APIs are altered to take `consensusBranchId` and
+  `amount` fields.
+- New precomputing APIs have been added that enable multiple transparent inputs
+  on a single transaction to be verified more efficiently.
+- Equihash has been removed from the compiled library. The canonical Equihash
+  validator is the [`equihash` Rust crate](https://crates.io/crates/equihash)
+  since v3.1.0.
+
+The C++ library can be built by compiling `zcashd` with the environment variable
+`CONFIGURE_FLAGS=--with-libs`. It is also wrapped as the
+[`zcash_script` Rust crate](https://crates.io/crates/zcash_script)
+(maintained by the Zcash Foundation for use in `zebrad`).
+
+Other P2P Changes
+-----------------
+
+The list of banned peers is now stored on disk rather than in memory. Restarting
+`zcashd` will no longer clear out the list of banned peers; instead the
+`clearbanned` RPC method can be used to manually clear the list. The `setban`
+RPC method can also be used to manually ban or unban a peer.
+
+Build system updates
+--------------------
+
+- We now build with Clang 11 and Rust 1.49.
+- We have downgraded Boost to 1.74 to mitigate `statx`-related breakage in some
+  container environments.
+
+Changelog
+=========
+
+Alex Wied (3):
+      Add support for FreeBSD 12
+      Set rust_target for all FreeBSD versions
+      Use parentheses for defined in windows-unused-variables.diff
+
+Alfredo Garcia (3):
+      split wallet.py tests
+      hide password in -stdin `walletpassphrase` command
+      Apply suggestions from code review
+
+Bernhard M. Wiedemann (1):
+      Make tests pass after 2020
+
+BtcDrak (1):
+      Remove bad chain alert partition check
+
+Carl Dong (13):
+      build: Add variable printing target to Makefiles
+      depends: Propagate well-known vars into depends
+      depends: boost: Specify toolset to bootstrap.sh
+      depends: boost: Split target-os from toolset
+      depends: boost: Use clang toolset if clang in CXX
+      depends: Propagate only specific CLI variables to sub-makes
+      depends: boost: Refer to version in URL
+      depends: boost: Split into non-/native packages
+      depends: boost: Disable all compression
+      depends: boost: Cleanup architecture/address-model
+      depends: boost: Cleanup toolset selection
+      depends: boost: Remove unnecessary _archiver_
+      depends: boost: Specify cflags+compileflags
+
+Casey Rodarmor (3):
+      Make limited map actually respect max size
+      Disallow unlimited limited maps
+      Add limitedmap test
+
+Cory Fields (6):
+      depends: fix boost mac cross build with clang 9+
+      build: add missing leveldb defines
+      net: make Ban/Unban/ClearBan functionality consistent
+      net: No need to export DumpBanlist
+      net: move CBanDB and CAddrDB out of net.h/cpp
+      net: Drop CNodeRef for AttemptToEvictConnection
+
+Daira Hopwood (2):
+      qa/zcash/updatecheck.py: remove dead code; print instructions to run `cargo outdated` and `cargo update`.
+      Ensure that `CONFIGURE_FLAGS=--enable-debug` correctly uses -O0 for dependencies and main build.
+
+Daniel Kraft (1):
+      doc: add comment explaining initial header request
+
+Dimitris Apostolou (1):
+      Discord invite instead of direct link
+
+Ethan Heilman (1):
+      Fix de-serialization bug where AddrMan is corrupted after exception * CAddrDB modified so that when de-serialization code throws an exception Addrman is reset to a clean state * CAddrDB modified to make unit tests possible * Regression test created to ensure bug is fixed * StartNode modifed to clear adrman if CAddrDB::Read returns an error code.
+
+Gregory Maxwell (2):
+      Return early in IsBanned.
+      Disconnect on mempool requests from peers when over the upload limit.
+
+Igor Cota (1):
+      Define TARGET_OS when host is android
+
+Jack Grigg (46):
+      Add JSDescriptionInfo for constructing JSDescriptions
+      Remove JSDescription::h_sig
+      prevector: Terminate without logging on failed allocation
+      Remove init_and_check_sodium from crypto/common.h
+      Store inputs and outputs by reference in JSDescriptionInfo
+      depends: Update Rust to 1.49.0
+      rust: Use renamed broken_intra_doc_links lint
+      depends: cargo update
+      depends: Move to Clang 11
+      depends: Fix Boost warnings under Clang 11
+      depends: Allow per-host package download paths
+      depends: Ensure the native_clang download path is for the builder
+      Revert "Update boost to 1.75, postpone other updates."
+      qa: Postpone Boost and native_b2 updates
+      QA: Remove unused update postponements
+      QA: Postpone BDB update again
+      depends: ZeroMQ 4.3.4
+      depends: Postpone updates that require adding CMake
+      cargo update
+      Squashed 'src/univalue/' changes from 9ef5b78c1..98fadc090
+      Remove crypto/equihash from libzcashconsensus
+      Add amount and consensus branch ID to zcashconsensus_verify_script
+      Rename src/script/zcashconsensus.* -> src/script/zcash_script.*
+      Rename zcashconsensus_* -> zcash_script_* in APIs
+      Rename libzcashconsensus.la -> libzcash_script.la
+      Set up an mdbook in which we can document zcashd's architecture design
+      Actions: Add a workflow to deploy the zcashd book
+      Show README as root of zcashd book
+      Link to zips.z.cash for protocol spec
+      test: Convert Bech32 test vectors into known-answer test vectors
+      zcash_script: Add API to verify scripts with precomputed tx data
+      test: Migrate maxuploadtarget.py to Python 3
+      Pass current PoWTargetSpacing() into CNode::OutboundTargetReached()
+      init: Pass post-Blossom spacing into CNode::SetMaxOutboundTarget()
+      Fix some typos
+      zcash_script: Clarify return values in docs
+      Rename responsible_disclosure.md to SECURITY.md
+      Add IBD download traffic reduction to release notes
+      Fill out the rest of the 4.3.0 release notes
+      make-release.py: Versioning changes for 4.3.0-rc1.
+      make-release.py: Updated manpages for 4.3.0-rc1.
+      make-release.py: Updated release notes and changelog for 4.3.0-rc1.
+      cargo update
+      rust: Pin funty =1.1.0
+      make-release.py: Versioning changes for 4.3.0.
+      make-release.py: Updated manpages for 4.3.0.
+
+Jeremy Rubin (1):
+      Minimal fix to slow prevector tests as stopgap measure
+
+Jonas Schnelli (14):
+      banlist.dat: store banlist on disk
+      CAddrDB/CBanDB: change filesize variables from int to uint64_t
+      use CBanEntry as object container for banned nodes
+      Adding CSubNet constructor over a single CNetAddr
+      [Qt] add ui signal for banlist changes
+      [Qt] banlist, UI optimizing and better signal handling
+      net: use CIDR notation in CSubNet::ToString()
+      [QA] fix netbase tests because of new CSubNet::ToString() output
+      Introduce -maxuploadtarget
+      [doc] add documentation how to reduce traffic
+      don't enforce maxuploadtargets disconnect for whitelisted peers
+      [docs] rename reducetraffic.md to reduce-traffic.md
+      add documentation for exluding whitelistes peer from maxuploadtarget
+      add (max)uploadtarget infos to getnettotals RPC help
+
+Josh Lehan (1):
+      Re-organize -maxconnections option handling
+
+Karel Bilek (1):
+      scripted-diff: Use UniValue.pushKV instead of push_back(Pair())
+
+Kaz Wesley (4):
+      fix race that could fail to persist a ban
+      prevector: destroy elements only via erase()
+      test prevector::swap
+      prevector::swap: fix (unreached) data corruption
+
+Kris Nuttycombe (4):
+      Skip "tx" messages during initial block download.
+      Fix pyflakes complaints
+      Whitespace-only fix in chainparams.cpp
+      Update the maxuploadtarget.py tests to accommodate zcash.
+
+Larry Ruane (1):
+      #4624 improve IBD sync by eliminating getheaders requests
+
+Marco Falke (3):
+      [net] Cleanup maxuploadtarget
+      [doc] Add -maxuploadtarget release notes
+      [walletdb] Add missing LOCK() in Recover() for dummyWallet
+
+Marius Kjærstad (3):
+      Update _COPYRIGHT_YEAR in configure.ac to 2021
+      Update COPYRIGHT_YEAR in clientversion.h to 2021
+      Update of copyright year to 2021
+
+Marshall Gaucher (1):
+      add libxml2
+
+Matt Corallo (6):
+      Default to defining endian-conversion DECLs in compat w/o config
+      Make fDisconnect an std::atomic
+      Make fImporting an std::atomic
+      Fix AddrMan locking
+      Remove double brackets in addrman
+      Fix unlocked access to vNodes.size()
+
+Patrick Strateman (1):
+      Avoid recalculating vchKeyedNetGroup in eviction logic.
+
+Peter Bushnell (1):
+      depends: Consistent use of package variable
+
+Peter Todd (1):
+      Remove LOCK(cs_main) from decodescript
+
+Philip Kaufmann (4):
+      banlist: update set dirty to be more fine grained
+      banlist: better handling of banlist in StartNode()
+      banlist: add more banlist infos to log / add GUI signal
+      banlist (bugfix): allow CNode::SweepBanned() to run on interval
+
+Pieter Wuille (11):
+      Add SipHash-2-4 primitives to hash
+      Use SipHash-2-4 for CCoinsCache index
+      Switch CTxMempool::mapTx to use a hash index for txids
+      Use SipHash-2-4 for address relay selection
+      Add extra message to avoid a long 'Loading banlist'
+      Support SipHash with arbitrary byte writes
+      Use 64-bit SipHash of netgroups in eviction
+      Use C++11 thread-safe static initializers
+      Add ChaCha20
+      Switch FastRandomContext to ChaCha20
+      Add a FastRandomContext::randrange and use it
+
+Suhas Daftuar (1):
+      Add RPC test for -maxuploadtarget
+
+Taylor Hornby (2):
+      Move the github API token out of updatecheck.py into an untracked file.
+      Document the required .updatecheck-token file in the release docs
+
+Wladimir J. van der Laan (6):
+      build: Updates for OpenBSD
+      net: Fix CIDR notation in ToString()
+      test: Add more test vectors for siphash
+      timedata: Prevent warning overkill
+      Always allow getheaders from whitelisted peers
+      rpc: remove cs_main lock from `createrawtransaction`
+
+fanquake (2):
+      [build] Add NETBSD leveldb target to configure.ac
+      [doc] Improve lanaguge in reducetraffic.md
+
+kirkalx (1):
+      peers.dat, banlist.dat recreated when missing
+
+Marshall Gaucher (1):
+      add zstd package
+
+randy-waterhouse (1):
+      Re-instate TARGET_OS=linux in configure.ac. Removed by 351abf9e035.
+
+Jack Grigg (1):
+      Update URL for Zcash Foundation security policy
+
+Ying Tong Lai (2):
+      Cargo update
+      Postpone dependencies
+
+tulip (1):
+      Move time data log print to 'net' category to reduce log noise
+
+Benjamin Winston (1):
+      Added foundation to responsible_disclosure.md
+
diff --git a/depend/zcash/doc/release-notes/release-notes-4.4.0-rc1.md b/depend/zcash/doc/release-notes/release-notes-4.4.0-rc1.md
new file mode 100644
index 000000000..6a84fc879
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-4.4.0-rc1.md
@@ -0,0 +1,187 @@
+Notable changes
+===============
+
+Prometheus metrics
+------------------
+
+`zcashd` can now be configured to optionally expose an HTTP server that acts as
+a Prometheus scrape endpoint. The server will respond to `GET` requests on any
+request path.
+
+To enable the endpoint, add `-prometheusport=<port>` to your `zcashd`
+configuration (either in `zcash.conf` or on the command line). After
+restarting `zcashd` you can then test the endpoint by querying it with e.g.
+`curl http://127.0.0.1:<port>`.
+
+By default, access is restricted to localhost. This can be expanded with
+`-metricsallowip=<ip>`, which can specify IPs or subnets. Note that HTTPS is not
+supported, and therefore connections to the endpoint are not encrypted or
+authenticated. Access to the endpoint should be assumed to compromise the
+privacy of node operations, by the provided metrics and/or by timing side
+channels. Non-localhost access is **strongly discouraged** if the node has a
+wallet holding live funds.
+
+The specific metrics names may change in subsequent releases, in particular to
+improve interoperability with `zebrad`.
+
+Changelog
+=========
+
+Cory Fields (3):
+      net: rearrange so that socket accesses can be grouped together
+      net: add a lock around hSocket
+      net: fix a few races. Credit @TheBlueMatt
+
+Daira Hopwood (6):
+      Fix regression introduced in e286250ce49309bfa931b622fabfc37100246266 by adding #include <atomic>. fixes #5014
+      native_rust: don't install Rust docs. This speeds up builds, especially native builds on macOS. fixes #5042
+      Delete spare mainnet Founders' Reward addresses that will never be used.
+      configure.ac: Add check for ntdll on Windows.
+      configure.ac: tidy up spacing.
+      Cleanup: get the definition of ENABLE_VIRTUAL_TERMINAL_PROCESSING from wincon.h.
+
+Gregory Maxwell (5):
+      Replace setInventoryKnown with a rolling bloom filter.
+      Remove mruset as it is no longer used.
+      Actually only use filterInventoryKnown with MSG_TX inventory messages.
+      Add whitelistforcerelay to control forced relaying.
+      Blacklist -whitelistalwaysrelay; replaced by -whitelistrelay.
+
+Jack Grigg (39):
+      Squashed 'src/secp256k1/' changes from c6b6b8f1bb..3967d96bf1
+      Squashed 'src/secp256k1/' changes from 3967d96bf1..a4abaab793
+      CI: Correctly build zcashd book
+      cargo update
+      rust: zcash_{primitives, proofs} 0.5.0
+      depends: Update Rust to 1.51.0
+      qa: Update BerkeleyDB downloads page URL
+      rust: Implement FFI interface to metrics crate
+      rust: Add a Prometheus metrics exporter
+      Add some metrics that match existing zebrad metrics
+      metrics: Add documentation and example configs
+      tracing: Merge TracingSpanFields macro into TracingSpan
+      rust: Move helper macros into rust/helpers.h
+      metrics: Add support for labels
+      metrics: Expose binary metadata
+      Add more detailed metrics
+      rust: Use consistent include guards in header files
+      rust: Check for invalid UTF-8 in -prometheusmetrics argument
+      Add -prometheusmetrics to release notes
+      Mention in release notes that metrics names may still change
+      metrics: Implement IP access control on Prometheus scrape endpoint
+      rust: Pin hyper 0.14.2
+      metrics: Move documentation into zcashd book
+      metrics: Enable gauges with fully-static labels
+      metrics: Use labels for pool statistics
+      metrics: Rename metrics with consistent naming scheme
+      metrics: Remove zcash.sync.* metrics
+      metrics: Rework pool metrics in anticipation of transparent pool
+      net: Clear CNode::strSendCommand if a message is aborted
+      rust: Add license header to metrics_ffi::prometheus
+      book: Fix typo in metrics documentation
+      metrics: Don't assert that the Sprout tree is accessible
+      Remove usage of local from fetch-params.sh
+      lint: Fix false positive
+      qa: Point univalue update checker at correct upstream
+      qa: Postpone updates that require CMake in the build system
+      qa: Postpone Boost 1.75.0
+      make-release.py: Versioning changes for 4.4.0-rc1.
+      make-release.py: Updated manpages for 4.4.0-rc1.
+
+Jeremy Rubin (2):
+      Fix CCheckQueue IsIdle (potential) race condition and remove dangerous constructors.
+      Add CheckQueue Tests
+
+Jonas Schnelli (1):
+      Move -blocksonly parameter interaction to the new ParameterInteraction() function
+
+Kaz Wesley (2):
+      lock cs_main for State/Misbehaving
+      lock cs_main for chainActive
+
+Kris Nuttycombe (14):
+      Ignore temporary build artifacts.
+      Add feature flagging infrastructure to consensus parameters.
+      Relocate contextual Sapling version checks
+      Add TxVersionInfo for feature/future-base transaction construction.
+      Move sapling version group checks back inside of saplingActive check.
+      Add future version group & version checks
+      Use SPROUT_MAX_CURRENT_VERSION
+      Apply suggestions from code review
+      Add feature flagging tests.
+      Document FeatureSet type.
+      Document UPGRADE_ZFUTURE
+      Ensure that Sapling version range checks are always guarded by SAPLING_VERSION_GROUP_ID
+      Address review comments.
+      CurrentTxVersionInfo should return SPROUT_MIN_CURRENT_VERSION pre-overwinter.
+
+Marco Falke (2):
+      Move blocksonly parameter interaction to InitParameterInteraction()
+      doc: Mention blocksonly in reduce-traffic.md, unhide option
+
+Matt Corallo (13):
+      Fix race when accessing std::locale::classic()
+      Lock mapArgs/mapMultiArgs access in util
+      Ensure cs_vNodes is held when using the return value from FindNode
+      Access WorkQueue::running only within the cs lock.
+      Make nTimeConnected const in CNode
+      Avoid copying CNodeStats to make helgrind OK with buggy std::string
+      Access fRelayTxes with cs_filter lock in copyStats
+      Make nStartingHeight atomic
+      Make nServices atomic
+      Move [clean|str]SubVer writes/copyStats into a lock
+      Make nTimeBestReceived atomic
+      Move CNode::addrName accesses behind locked accessors
+      Move CNode::addrLocal access behind locked accessors
+
+Patick Strateman (13):
+      Add blocksonly mode
+      Do not process tx inv's in blocksonly mode
+      Add whitelistalwaysrelay option
+      Add help text for blocksonly and whitelistalwaysrelay
+      Use DEFAULT_BLOCKSONLY and DEFAULT_WHITELISTALWAYSRELAY constants
+      Display DEFAULT_WHITELISTALWAYSRELAY in help text
+      Fix fRelayTxs comment
+      Fix comment for blocksonly parameter interactions
+      Fix relay mechanism for whitelisted peers under blocks only mode.
+      Bail early in processing transactions in blocks only mode.
+      Improve log messages for blocks only violations.
+      Rename setInventoryKnown filterInventoryKnown
+      Only use filterInventoryKnown with MSG_TX inventory messages.
+
+Patrick Strateman (1):
+      Make nWalletDBUpdated atomic to avoid a potential race.
+
+Pavel Janík (2):
+      Notify other serviceQueue thread we are finished to prevent deadlocks.
+      Do not shadow LOCK's criticalblock variable for LOCK inside LOCK
+
+Peter Todd (1):
+      Add relaytxes status to getpeerinfo
+
+Pieter Wuille (2):
+      Clean up lockorder data of destroyed mutexes
+      Fix some locks
+
+Russell Yanofsky (1):
+      Add missing cs_wallet lock that triggers new lock held assertion
+
+Sjors Provoost (1):
+      [doc] mention whitelist is inbound, and applies to blocksonly
+
+Steven Smith (1):
+      Adding base NU5 declarations and logic
+
+Yuri Zhykin (1):
+      Fix for incorrect locking in GetPubKey() (keystore.cpp)
+
+glowang (1):
+      Update -blocksonly documentation
+
+plutoforever (1):
+      removed bashisms from build scripts
+
+Jack Grigg (2):
+      Add security warnings for -prometheusmetrics option
+      Clean up comment
+
diff --git a/depend/zcash/doc/release-notes/release-notes-4.4.0.md b/depend/zcash/doc/release-notes/release-notes-4.4.0.md
new file mode 100644
index 000000000..2bae0c2c7
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-4.4.0.md
@@ -0,0 +1,197 @@
+Notable changes
+===============
+
+Prometheus metrics
+------------------
+
+`zcashd` can now be configured to optionally expose an HTTP server that acts as
+a Prometheus scrape endpoint. The server will respond to `GET` requests on any
+request path.
+
+To enable the endpoint, add `-prometheusport=<port>` to your `zcashd`
+configuration (either in `zcash.conf` or on the command line). After
+restarting `zcashd` you can then test the endpoint by querying it with e.g.
+`curl http://127.0.0.1:<port>`.
+
+By default, access is restricted to localhost. This can be expanded with
+`-metricsallowip=<ip>`, which can specify IPs or subnets. Note that HTTPS is not
+supported, and therefore connections to the endpoint are not encrypted or
+authenticated. Access to the endpoint should be assumed to compromise the
+privacy of node operations, by the provided metrics and/or by timing side
+channels. Non-localhost access is **strongly discouraged** if the node has a
+wallet holding live funds.
+
+The specific metrics names may change in subsequent releases, in particular to
+improve interoperability with `zebrad`.
+
+Changelog
+=========
+
+Cory Fields (3):
+      net: rearrange so that socket accesses can be grouped together
+      net: add a lock around hSocket
+      net: fix a few races. Credit @TheBlueMatt
+
+Daira Hopwood (6):
+      Fix regression introduced in e286250ce49309bfa931b622fabfc37100246266 by adding #include <atomic>. fixes #5014
+      native_rust: don't install Rust docs. This speeds up builds, especially native builds on macOS. fixes #5042
+      Delete spare mainnet Founders' Reward addresses that will never be used.
+      configure.ac: Add check for ntdll on Windows.
+      configure.ac: tidy up spacing.
+      Cleanup: get the definition of ENABLE_VIRTUAL_TERMINAL_PROCESSING from wincon.h.
+
+Gregory Maxwell (5):
+      Replace setInventoryKnown with a rolling bloom filter.
+      Remove mruset as it is no longer used.
+      Actually only use filterInventoryKnown with MSG_TX inventory messages.
+      Add whitelistforcerelay to control forced relaying.
+      Blacklist -whitelistalwaysrelay; replaced by -whitelistrelay.
+
+Jack Grigg (49):
+      Squashed 'src/secp256k1/' changes from c6b6b8f1bb..3967d96bf1
+      Squashed 'src/secp256k1/' changes from 3967d96bf1..a4abaab793
+      CI: Correctly build zcashd book
+      cargo update
+      rust: zcash_{primitives, proofs} 0.5.0
+      depends: Update Rust to 1.51.0
+      qa: Update BerkeleyDB downloads page URL
+      rust: Implement FFI interface to metrics crate
+      rust: Add a Prometheus metrics exporter
+      Add some metrics that match existing zebrad metrics
+      metrics: Add documentation and example configs
+      tracing: Merge TracingSpanFields macro into TracingSpan
+      rust: Move helper macros into rust/helpers.h
+      metrics: Add support for labels
+      metrics: Expose binary metadata
+      Add more detailed metrics
+      rust: Use consistent include guards in header files
+      rust: Check for invalid UTF-8 in -prometheusmetrics argument
+      Add -prometheusmetrics to release notes
+      Mention in release notes that metrics names may still change
+      metrics: Implement IP access control on Prometheus scrape endpoint
+      rust: Pin hyper 0.14.2
+      metrics: Move documentation into zcashd book
+      metrics: Enable gauges with fully-static labels
+      metrics: Use labels for pool statistics
+      metrics: Rename metrics with consistent naming scheme
+      metrics: Remove zcash.sync.* metrics
+      metrics: Rework pool metrics in anticipation of transparent pool
+      net: Clear CNode::strSendCommand if a message is aborted
+      rust: Add license header to metrics_ffi::prometheus
+      book: Fix typo in metrics documentation
+      metrics: Don't assert that the Sprout tree is accessible
+      Remove usage of local from fetch-params.sh
+      lint: Fix false positive
+      qa: Point univalue update checker at correct upstream
+      qa: Postpone updates that require CMake in the build system
+      qa: Postpone Boost 1.75.0
+      make-release.py: Versioning changes for 4.4.0-rc1.
+      make-release.py: Updated manpages for 4.4.0-rc1.
+      make-release.py: Updated release notes and changelog for 4.4.0-rc1.
+      scripted-diff: Remove direct usages of boost::filesystem
+      Remove duplicate / unused includes
+      Fix include guards
+      python: Use UTF-8 encodings for opened files
+      clean.sh: Remove secp256k1 test log
+      Postpone Clang 12
+      book: Fix comment in metrics example, and clarify usage
+      make-release.py: Versioning changes for 4.4.0.
+      make-release.py: Updated manpages for 4.4.0.
+
+Jeremy Rubin (2):
+      Fix CCheckQueue IsIdle (potential) race condition and remove dangerous constructors.
+      Add CheckQueue Tests
+
+Jonas Schnelli (1):
+      Move -blocksonly parameter interaction to the new ParameterInteraction() function
+
+Kaz Wesley (2):
+      lock cs_main for State/Misbehaving
+      lock cs_main for chainActive
+
+Kris Nuttycombe (14):
+      Ignore temporary build artifacts.
+      Add feature flagging infrastructure to consensus parameters.
+      Relocate contextual Sapling version checks
+      Add TxVersionInfo for feature/future-base transaction construction.
+      Move sapling version group checks back inside of saplingActive check.
+      Add future version group & version checks
+      Use SPROUT_MAX_CURRENT_VERSION
+      Apply suggestions from code review
+      Add feature flagging tests.
+      Document FeatureSet type.
+      Document UPGRADE_ZFUTURE
+      Ensure that Sapling version range checks are always guarded by SAPLING_VERSION_GROUP_ID
+      Address review comments.
+      CurrentTxVersionInfo should return SPROUT_MIN_CURRENT_VERSION pre-overwinter.
+
+Marco Falke (2):
+      Move blocksonly parameter interaction to InitParameterInteraction()
+      doc: Mention blocksonly in reduce-traffic.md, unhide option
+
+Matt Corallo (13):
+      Fix race when accessing std::locale::classic()
+      Lock mapArgs/mapMultiArgs access in util
+      Ensure cs_vNodes is held when using the return value from FindNode
+      Access WorkQueue::running only within the cs lock.
+      Make nTimeConnected const in CNode
+      Avoid copying CNodeStats to make helgrind OK with buggy std::string
+      Access fRelayTxes with cs_filter lock in copyStats
+      Make nStartingHeight atomic
+      Make nServices atomic
+      Move [clean|str]SubVer writes/copyStats into a lock
+      Make nTimeBestReceived atomic
+      Move CNode::addrName accesses behind locked accessors
+      Move CNode::addrLocal access behind locked accessors
+
+Patick Strateman (13):
+      Add blocksonly mode
+      Do not process tx inv's in blocksonly mode
+      Add whitelistalwaysrelay option
+      Add help text for blocksonly and whitelistalwaysrelay
+      Use DEFAULT_BLOCKSONLY and DEFAULT_WHITELISTALWAYSRELAY constants
+      Display DEFAULT_WHITELISTALWAYSRELAY in help text
+      Fix fRelayTxs comment
+      Fix comment for blocksonly parameter interactions
+      Fix relay mechanism for whitelisted peers under blocks only mode.
+      Bail early in processing transactions in blocks only mode.
+      Improve log messages for blocks only violations.
+      Rename setInventoryKnown filterInventoryKnown
+      Only use filterInventoryKnown with MSG_TX inventory messages.
+
+Patrick Strateman (1):
+      Make nWalletDBUpdated atomic to avoid a potential race.
+
+Pavel Janík (2):
+      Notify other serviceQueue thread we are finished to prevent deadlocks.
+      Do not shadow LOCK's criticalblock variable for LOCK inside LOCK
+
+Peter Todd (1):
+      Add relaytxes status to getpeerinfo
+
+Pieter Wuille (2):
+      Clean up lockorder data of destroyed mutexes
+      Fix some locks
+
+Russell Yanofsky (1):
+      Add missing cs_wallet lock that triggers new lock held assertion
+
+Sjors Provoost (1):
+      [doc] mention whitelist is inbound, and applies to blocksonly
+
+Steven Smith (1):
+      Adding base NU5 declarations and logic
+
+Yuri Zhykin (1):
+      Fix for incorrect locking in GetPubKey() (keystore.cpp)
+
+glowang (1):
+      Update -blocksonly documentation
+
+plutoforever (1):
+      removed bashisms from build scripts
+
+Jack Grigg (2):
+      Add security warnings for -prometheusmetrics option
+      Clean up comment
+
diff --git a/depend/zcash/doc/release-notes/release-notes-4.4.1-rc1.md b/depend/zcash/doc/release-notes/release-notes-4.4.1-rc1.md
new file mode 100644
index 000000000..5c65bb924
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-4.4.1-rc1.md
@@ -0,0 +1,128 @@
+Notable changes
+===============
+
+Build system changes
+--------------------
+
+- Cross-compilation support for Windows XP, Windows Vista, and 32-bit Windows
+  binaries, has been removed. Cross-compiled Windows binaries are now 64-bit
+  only, and target a minimum of Windows 7.
+
+Changelog
+=========
+
+251 (1):
+      Removes unsed `CBloomFilter` constructor.
+
+Akio Nakamura (1):
+      Prevent mutex lock fail even if --enable-debug
+
+Anthony Towns (1):
+      doc: clarify CRollingBloomFilter size estimate
+
+Ben Woosley (1):
+      Drop defunct Windows compat fixes
+
+Chun Kuan Lee (3):
+      windows: Set _WIN32_WINNT to 0x0601 (Windows 7)
+      windows: Call SetProcessDEPPolicy directly
+      build: Remove WINVER pre define in Makefile.leveldb.inlcude
+
+Cory Fields (2):
+      rpc: work-around an upstream libevent bug
+      rpc: further constrain the libevent workaround
+
+Jack Grigg (7):
+      build: Link to libbcrypt on Windows
+      doc: Add Windows version support change to release notes
+      Postpone dependency updates until after 4.4.1
+      Fix Rust dependency name in postponed-updates.txt
+      Postpone native_ccache 4.3
+      make-release.py: Versioning changes for 4.4.1-rc1.
+      make-release.py: Updated manpages for 4.4.1-rc1.
+
+João Barbosa (5):
+      bench: Add benchmark for CRollingBloomFilter::reset
+      refactor: Improve CRollingBloomFilter::reset by using std::fill
+      wallet: Remove unnecessary mempool lock in ReacceptWalletTransactions
+      [rpc] Reduce scope of cs_main and cs_wallet locks in listtransactions
+      [wallet] Make CWallet::ListCoins atomic
+
+Karl-Johan Alm (1):
+      Refactor: Remove using namespace <xxx> from src/*.cpp.
+
+Larry Ruane (1):
+      when rewinding, set pindexBestHeader to the highest-work block index
+
+Luke Dashjr (2):
+      depends: Patch libevent build to fix IPv6 -rpcbind on Windows
+      Move Win32 defines to configure.ac to ensure they are globally defined
+
+Marko Bencun (1):
+      keystore GetKeys(): return result instead of writing to reference
+
+Martin Ankerl (1):
+      replace modulus with FastMod
+
+Matt Corallo (4):
+      Add ability to assert a lock is not held in DEBUG_LOCKORDER
+      Remove redundant pwallet nullptr check
+      Hold mempool.cs for the duration of ATMP.
+      Add braces to meet code style on line-after-the-one-changed.
+
+MeshCollider (1):
+      Make fUseCrypto atomic
+
+Pavel Janík (1):
+      Do not shadow variables
+
+Pieter Wuille (3):
+      Switch to a more efficient rolling Bloom filter
+      Fix formatting of NOPs for generated script tests
+      More efficient bitsliced rolling Bloom filter
+
+Robert McLaughlin (1):
+      trivial: fix bloom filter init to isEmpty = true
+
+Russell Yanofsky (1):
+      Acquire cs_main lock before cs_wallet during wallet initialization
+
+S. Matthew English (1):
+      unification of Bloom filter representation
+
+Sebastian Falbesoner (2):
+      refactor: Remove unused methods CBloomFilter::reset()/clear()
+      net: remove is{Empty,Full} flags from CBloomFilter, clarify CVE fix
+
+Wladimir J. van der Laan (3):
+      http: Join worker threads before deleting work queue
+      http: Remove WaitExit from WorkQueue
+      http: Remove numThreads and ThreadCounter
+
+fanquake (6):
+      build: remove WINDOWS_BITS from build system
+      build: remove configure checks for win libraries we don't link against
+      build: remove --large-address-aware linker flag
+      build: don't pass -w when building for Windows
+      build: enforce minimum required Windows version (7)
+      build: pass _WIN32_WINNT=0x0601 when building libevent for Windows
+
+kobake (2):
+      Fix msvc compiler error C4146 (minus operator applied to unsigned type)
+      Fix msvc compiler error C4146 (unary minus operator applied to unsigned type)
+
+Marshall Gaucher (3):
+      Add Debian 11 ci-builder
+      clean up ubuntu 18.04 and 20.04 commands
+      add tekton build/worker docker, organize legacy buildbot docker
+
+practicalswift (2):
+      addrman: Add missing lock in Clear() (CAddrMan)
+      Add missing cs_main locks when calling blockToJSON/blockheaderToJSON
+
+Jack Grigg (1):
+      doc: Add removal of 32-bit Windows binaries to release notes
+
+ロ�ン ダル (1):
+      param variables made const
+
diff --git a/depend/zcash/doc/release-notes/release-notes-4.4.1.md b/depend/zcash/doc/release-notes/release-notes-4.4.1.md
new file mode 100644
index 000000000..8cc5f3224
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-4.4.1.md
@@ -0,0 +1,156 @@
+Notable changes
+===============
+
+Fixed chain sync stall bug
+--------------------------
+
+The 4.3.0 release included a change to prevent redundant `getheaders` P2P
+requests, to reduce node bandwith usage. This behaviour could be disabled by
+setting the config option `-nooptimize-getheaders`.
+
+It turns out that these redundant requests were masking an unrelated bug in the
+chain-rewinding logic that is used when the node detects a change to the
+consensus rules (for example, if a user forgets to upgrade their `zcashd` node
+before a network upgrade activates, and temporarily follows an un-upgraded chain
+before restarting with the latest version).
+
+In certain uncommon scenarios, a node could end up in a situation where it would
+believe that the best header it knew about was more than 160 blocks behind its
+actual best-known block. The redundant `getheaders` requests meant that this did
+not cause an issue, because the node would continue requesting headers until it
+found new blocks. After the `getheaders` optimizations, if a peer returned a
+`headers` message that was entirely known to the node, it would stop requesting
+more headers from that peer; this eventually caused node synchronization to
+stall. Restarting with the `-nooptimize-getheaders` config option would enable
+the node to continue syncing.
+
+This release fixes the bug at its source, but the `-nooptimize-getheaders`
+config option remains available if necessary.
+
+Build system changes
+--------------------
+
+- Cross-compilation support for Windows XP, Windows Vista, and 32-bit Windows
+  binaries, has been removed. Cross-compiled Windows binaries are now 64-bit
+  only, and target a minimum of Windows 7.
+
+Changelog
+=========
+
+251 (1):
+      Removes unsed `CBloomFilter` constructor.
+
+Akio Nakamura (1):
+      Prevent mutex lock fail even if --enable-debug
+
+Anthony Towns (1):
+      doc: clarify CRollingBloomFilter size estimate
+
+Ben Woosley (1):
+      Drop defunct Windows compat fixes
+
+Chun Kuan Lee (3):
+      windows: Set _WIN32_WINNT to 0x0601 (Windows 7)
+      windows: Call SetProcessDEPPolicy directly
+      build: Remove WINVER pre define in Makefile.leveldb.inlcude
+
+Cory Fields (2):
+      rpc: work-around an upstream libevent bug
+      rpc: further constrain the libevent workaround
+
+Jack Grigg (10):
+      build: Link to libbcrypt on Windows
+      doc: Add Windows version support change to release notes
+      Postpone dependency updates until after 4.4.1
+      Fix Rust dependency name in postponed-updates.txt
+      Postpone native_ccache 4.3
+      make-release.py: Versioning changes for 4.4.1-rc1.
+      make-release.py: Updated manpages for 4.4.1-rc1.
+      make-release.py: Updated release notes and changelog for 4.4.1-rc1.
+      make-release.py: Versioning changes for 4.4.1.
+      make-release.py: Updated manpages for 4.4.1.
+
+João Barbosa (5):
+      bench: Add benchmark for CRollingBloomFilter::reset
+      refactor: Improve CRollingBloomFilter::reset by using std::fill
+      wallet: Remove unnecessary mempool lock in ReacceptWalletTransactions
+      [rpc] Reduce scope of cs_main and cs_wallet locks in listtransactions
+      [wallet] Make CWallet::ListCoins atomic
+
+Karl-Johan Alm (1):
+      Refactor: Remove using namespace <xxx> from src/*.cpp.
+
+Larry Ruane (1):
+      when rewinding, set pindexBestHeader to the highest-work block index
+
+Luke Dashjr (2):
+      depends: Patch libevent build to fix IPv6 -rpcbind on Windows
+      Move Win32 defines to configure.ac to ensure they are globally defined
+
+Marko Bencun (1):
+      keystore GetKeys(): return result instead of writing to reference
+
+Martin Ankerl (1):
+      replace modulus with FastMod
+
+Matt Corallo (4):
+      Add ability to assert a lock is not held in DEBUG_LOCKORDER
+      Remove redundant pwallet nullptr check
+      Hold mempool.cs for the duration of ATMP.
+      Add braces to meet code style on line-after-the-one-changed.
+
+MeshCollider (1):
+      Make fUseCrypto atomic
+
+Pavel Janík (1):
+      Do not shadow variables
+
+Pieter Wuille (3):
+      Switch to a more efficient rolling Bloom filter
+      Fix formatting of NOPs for generated script tests
+      More efficient bitsliced rolling Bloom filter
+
+Robert McLaughlin (1):
+      trivial: fix bloom filter init to isEmpty = true
+
+Russell Yanofsky (1):
+      Acquire cs_main lock before cs_wallet during wallet initialization
+
+S. Matthew English (1):
+      unification of Bloom filter representation
+
+Sebastian Falbesoner (2):
+      refactor: Remove unused methods CBloomFilter::reset()/clear()
+      net: remove is{Empty,Full} flags from CBloomFilter, clarify CVE fix
+
+Wladimir J. van der Laan (3):
+      http: Join worker threads before deleting work queue
+      http: Remove WaitExit from WorkQueue
+      http: Remove numThreads and ThreadCounter
+
+fanquake (6):
+      build: remove WINDOWS_BITS from build system
+      build: remove configure checks for win libraries we don't link against
+      build: remove --large-address-aware linker flag
+      build: don't pass -w when building for Windows
+      build: enforce minimum required Windows version (7)
+      build: pass _WIN32_WINNT=0x0601 when building libevent for Windows
+
+kobake (2):
+      Fix msvc compiler error C4146 (minus operator applied to unsigned type)
+      Fix msvc compiler error C4146 (unary minus operator applied to unsigned type)
+
+Marshall Gaucher (3):
+      Add Debian 11 ci-builder
+      clean up ubuntu 18.04 and 20.04 commands
+      add tekton build/worker docker, organize legacy buildbot docker
+
+practicalswift (2):
+      addrman: Add missing lock in Clear() (CAddrMan)
+      Add missing cs_main locks when calling blockToJSON/blockheaderToJSON
+
+Jack Grigg (1):
+      doc: Add removal of 32-bit Windows binaries to release notes
+
+ロ�ン ダル (1):
+      param variables made const
diff --git a/depend/zcash/doc/release-notes/release-notes-4.5.0-rc1.md b/depend/zcash/doc/release-notes/release-notes-4.5.0-rc1.md
new file mode 100644
index 000000000..c91384283
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-4.5.0-rc1.md
@@ -0,0 +1,311 @@
+Changelog
+=========
+
+Aditya Kulkarni (1):
+      Sort taddr txns by txindex in addition to height
+
+Alex Morcos (4):
+      Store the total sig op count of a tx.
+      Add a score index to the mempool.
+      Add TxPriority class and comparator
+      tidy up CInv::GetCommand
+
+Daira Hopwood (8):
+      Improve error message when a block would overfill the Orchard commitment tree.
+      More precise terminology: "lock free" -> "unlocked"
+      ZIP 339 support.
+      Update URL for Boost source download (from dl.bintray.com to boostorg.jfrog.io).
+      Cargo.toml: use librustzcash after the merge of https://github.com/zcash/librustzcash/pull/424 .
+      Update unified address test data to take account of HRPs in padding (https://github.com/zcash/librustzcash/pull/419).
+      Avoid need to cast away const in the C caller of zip339_free_phrase.
+      Update authors of librustzcash to everyone currently and formerly on Core team (in alphabetical order).
+
+Eric Lombrozo (2):
+      Removed ppszTypeName from protocol.cpp
+      getdata enum issue fix
+
+Ethan Heilman (1):
+      Fix typo adddrman to addrman as requested in #8070
+
+Ethan Heilman (1):
+      Remove non-determinism which is breaking net_tests #8069
+
+Gregory Maxwell (4):
+      Eliminate TX trickle bypass, sort TX invs for privacy and priority.
+      Move bloom and feerate filtering to just prior to tx sending.
+      Do not use mempool for GETDATA for tx accepted after the last mempool req.
+      Defer inserting into maprelay until just before relaying.
+
+Jack Grigg (109):
+      Re-include reading blocks from disk in block connection benchmark
+      cargo update
+      Migrate to latest zcash_* crates
+      metrics 0.16 and metrics-exporter-prometheus 0.5
+      Implement ZIP 216 consensus rules
+      Extract SpendDescriptionV5 and OutputDescriptionV5 classes
+      rust: Enable C++ streams to be passed into Rust code
+      ZIP 225 tx format constants
+      v5 transaction format parser
+      contrib: Add BOSL to contrib/debian/copyright
+      Remove early return logic from transaction parsing
+      rust: Document read_callback_t and write_callback_t
+      CTransaction: Make new ZIP 225 fields non-const and private
+      ZIP 244 transaction digests
+      ZIP 244 signature digests
+      ZIP 244 hashAuthDataRoot computation
+      Fix tests that assume CTxOuts can be "null"
+      test: Generate valid Sapling types
+      test: Small fixes to sighash test vector generation
+      test: Regenerate sighash.json after generator fixes
+      Throw an exception instead of asserting if Rust tx parser fails
+      CI: Publish correct book directory
+      CI: Build book with latest mdbook
+      rust: Documentation improvements to FFI methods
+      Implement Orchard authorization batch validator
+      Implement Orchard signature validation consensus rules
+      rust: Fix patched dependencies
+      book: Add dev guide page about Rust dependencies
+      Rename hashLightClientRoot to hashBlockCommitments in block header
+      ZIP 244 hashBlockCommitments implementation
+      test: Check for valid hashBlockCommitments construction post-NU5
+      Skip hashBlockCommitments check when testing block templates
+      test: Check hashBlockCommitments before, at, and after NU5 activation
+      ConnectBlock: Check NU activation when deriving block commitments
+      Copy authDigest in CTransaction::operator=(const CTransaction &tx)
+      rust: Move history tree FFI logic into a module
+      rust: Migrate to zcash_history with versioned trees
+      rust: Move history tree FFI declarations into a separate header
+      test: Use valid consensus branch IDs in history tree tests
+      Use V2 history trees from NU5 onward
+      test: Check history trees across Canopy and NU5 activations
+      rpc: Document getblock RPC finalorchardroot field, omit before NU5
+      rust: Document some requirements for history tree FFI methods
+      test: Add test case for popping from an empty history tree
+      Implement Orchard pool value tracking
+      rust: Load Orchard circuit parameters at startup
+      Check Orchard bundle-specific consensus rules, i.e. proofs
+      test: Update CCoinsViewTest with changes to CCoinsView interface
+      Include Orchard bundle in transaction dynamic usage
+      ZIP 203: Enforce coinbase nExpiryHeight consensus rule from NU5
+      test: Check for updated empty-tx reject messages in transaction tests
+      test: Fix OverwinterExpiryHeight test after ZIP 203 contextual changes
+      miner: Set coinbase expiry height to block height from NU5 activation
+      Introduce libzcash::RawAddress type
+      Use `libzcash::RawAddress` in `CWallet::GetFilteredNotes`
+      Use a visitor for handling -mineraddress config option
+      Add support for decoding and encoding Unified Addresses
+      Pass network type through to UA address handling logic
+      CI: Add workflow that runs general lints
+      CI: Check scripted diffs
+      CI: Add Rust lints
+      Document why a nested call to ExtractMinerAddress is not recursive
+      Add constants for UA typecodes
+      Postpone dependency updates we aren't doing in this release
+      depends: Update Rust to 1.54.0
+      depends: Update Clang / libcxx to LLVM 12
+      depends: Update utfcpp to 3.2.1
+      depends: Fix issue cross-compiling BDB to Windows with Clang 12
+      rust: cargo update
+      rust: metrics 0.17
+      CI: Use Rust 1.54 for lints
+      cargo fmt
+      test: Wait for transaction propagation in shorter_block_times RPC test
+      test: Fix race condition in p2p_txexpiringsoon
+      Revert "Remove reference to -reindex-chainstate"
+      test: Flush wallet in WriteCryptedSaplingZkeyDirectToDb before reopening
+      qa: Bump `sync_mempool` timeout for `prioritisetransaction.py`
+      ProcessGetData(): Rework IsExpiringSoon check
+      test: Print reject reason if RPC test block rejected instead of accepted
+      test: Fix pyflakes warnings
+      CI: Ignore errors from general lints we don't yet have passing
+      lint: remove duplicate include
+      lint: Add missing include guards
+      test: Add NU5 test cases to existing RPC tests
+      builder: Generate v5 transactions from NU5 activation
+      Print `nConsensusBranchId` in `CTransaction::ToString`
+      Separate the consensus and internal consistency checks for branch ID
+      Parse consensus branch ID when reading v5 transaction format
+      test: Use correct field of getnetworkinfo to read protocol version
+      CI: Add Dependabot config to keep Actions up-to-date
+      Introduce a WTxId struct
+      Implement CInv message type MSG_WTX
+      test: Fix bugs in mininode transaction parser
+      test: Add v5 tx support to mininode
+      ProcessGetData: Respond to MSG_WTX requests
+      Add MSG_WTX support to inv messages
+      Use wtxid for peer state management
+      test: Implement CInv.__eq__() for mininode to simplify RPC test
+      Postpone dependency updates that require CMake
+      depends: Update Rust to 1.54.0
+      test: Fix bug in mininode.SpendDescription.deserialize
+      Add named constants for legacy tx authDigest placeholder value
+      qa: Boost 1.77.0
+      cargo update
+      Migrate to latest revisions of Zcash Rust crates
+      test: Set up mininodes at the start of feature_zip239
+      net: Reject unknown CInv message types
+      make-release.py: Versioning changes for 4.5.0-rc1.
+      make-release.py: Updated manpages for 4.5.0-rc1.
+
+John Newbery (10):
+      [tests] Remove wallet accounts test
+      [wallet] GetBalance can take an isminefilter filter.
+      [wallet] Factor out GetWatchOnlyBalance()
+      [wallet] deduplicate GetAvailableCredit logic
+      [wallet] factor out GetAvailableWatchOnlyBalance()
+      [wallet] GetBalance can take a min_depth argument.
+      [RPC] [wallet] allow getbalance to use min_conf and watch_only without accounts.
+      [wallet] Remove wallet account RPCs
+      [wallet] Kill accounts
+      [net] split PushInventory()
+
+Jonas Schnelli (1):
+      fix locking issue with new mempool limiting
+
+Kris Nuttycombe (46):
+      Update transaction auth commitments for pre-v5 transactions.
+      Move OrchardBundle to its own header file.
+      Implement the Rust side of the incremental merkle tree FFI.
+      Orchard changes to coins & consensus.
+      Return std::optional for GetAnchor
+      Check nullifiers length against bundle actions length.
+      Add Orchard bundle commitments to merkle tree.
+      Add Orchard merkle tree anchor tests.
+      Documentation cleanup.
+      Update orchard dependency.
+      Update to released version of incrementalmerkletree
+      Apply suggestions from code review
+      Apply suggestions from code review
+      Fix Orchard incremental Merkle tree empty root.
+      Fix header guards for incremental_sinsemilla_tree.h
+      Apply style suggestions.
+      Consistently panic on null commitment tree pointers.
+      Fix implmentation of OrchardMerkleTree.DynamicMemoryUsage
+      Document source of Orchard merkle tree test data.
+      Apply suggestions from code review
+      Add consensus check for duplicate Orchard nullifiers within a single transaction.
+      Add Orchard nullifiers to nullifiers cache.
+      Apply suggestions from code review
+      Ensure Sapling versions are valid after NU5
+      Make CTransaction::nConsensusBranchId a std::optional
+      Add NU5 upper bound check on nSpendsSapling, nOutputsSapling, nActionsOrchard
+      Check consensus branch ID for V5 transactions.
+      Rename tx.valueBalance -> tx.valueBalanceSapling
+      Make valueBalanceSapling a private non-const member of CTransaction.
+      Add Orchard value balance checks.
+      Account for Orchard balance in GetValueOut and GetShieldedValueIn.
+      Retract partial Orchard test support.
+      Add check that v5 transactions have empty Sprout joinsplits.
+      Prevent undefined behaviour in `CTransaction::GetValueOut()`
+      ZIP 213: Add checks to support Orchard shielded coinbase outputs.
+      Add check for consistency between nActionsOrchard and Orchard flags.
+      Ensure that the Orchard note commitment tree does not exceed its maximum size.
+      Update Orchard commitment tree hashes to use total MerkleCRH^Orchard.
+      Apply suggestions from code review
+      Make Sapling Spend and Ouput count, and Orchard Action count checks be noncontextual.
+      Use DOS level 100 for noncontextual checks.
+      Fix error strings to correctly reflect context.
+      Remove unused account-related wallet methods.
+      Use manual serialization for Merkle frontiers rather than bincode.
+      Fix clippy complaints.
+      Lock the wallet in SetBestChainINTERNAL
+
+Larry Ruane (1):
+      ZIP 225: v5 transaction check rules
+
+Luke Dashjr (1):
+      Optimisation: Store transaction list order in memory rather than compute it every need
+
+Marco Falke (1):
+      [qa] py2: Unfiddle strings into bytes explicitly
+
+Matt Corallo (4):
+      Fix calling mempool directly, instead of pool, in ATMP
+      Track (and define) ::minRelayTxFee in CTxMemPool
+      Add CFeeRate += operator
+      Print mempool size in KB when adding txn
+
+Patrick Strateman (5):
+      Fix insanity of CWalletDB::WriteTx and CWalletTx::WriteToDisk
+      Add CWallet::ListAccountCreditDebit
+      Add CWallet::ReorderTransactions and use in accounting_tests.cpp
+      Move CWalletDB::ReorderTransactions to CWallet
+      Move GetAccountBalance from rpcwallet.cpp into CWallet::GetAccountBalance
+
+Pieter Wuille (16):
+      Replace trickle nodes with per-node/message Poisson delays
+      Change mapRelay to store CTransactions
+      Make ProcessNewBlock dbp const and update comment
+      Switch reindexing to AcceptBlock in-loop and ActivateBestChain afterwards
+      Optimize ActivateBestChain for long chains
+      Add -reindex-chainstate that does not rebuild block index
+      Report reindexing progress in GUI
+      Split up and optimize transaction and block inv queues
+      Handle mempool requests in send loop, subject to trickle
+      Return mempool queries in dependency order
+      Add support for unique_ptr and shared_ptr to memusage
+      Switch CTransaction storage in mempool to std::shared_ptr
+      Optimize the relay map to use shared_ptr's
+      Optimization: don't check the mempool at all if no mempool req ever
+      Optimization: use usec in expiration and reuse nNow
+      Get rid of CTxMempool::lookup() entirely
+
+Russell Yanofsky (2):
+      [wallet] Add GetLegacyBalance method to simplify getbalance RPC
+      [wallet] Remove unneeded legacy getbalance code
+
+Shaul Kfir (1):
+      Add absurdly high fee message to validation state (for RPC propagation)
+
+Suhas Daftuar (3):
+      Use txid as key in mapAlreadyAskedFor
+      Reverse the sort on the mempool's feerate index
+      Only use AddInventoryKnown for transactions
+
+Technetium (1):
+      add missing aarch64 build deps
+
+Wladimir J. van der Laan (17):
+      streams: Add data() method to CDataStream
+      streams: Remove special cases for ancient MSVC
+      dbwrapper: Use new .data() method of CDataStream
+      wallet: Use CDataStream.data()
+      net: Consistent checksum handling
+      net: Hardcode protocol sizes and use fixed-size types
+      protocol.h: Move MESSAGE_START_SIZE into CMessageHeader
+      protocol.h: Make enums in GetDataMsg concrete values
+      Add assertion and cast before sending reject code
+      Add debug message to CValidationState for optional extra information
+      Introduce REJECT_INTERNAL codes for local AcceptToMempool errors
+      Add function to convert CValidationState to a human-readable message
+      Remove most logging from transaction validation
+      Add information to errors in ConnectBlock, CheckBlock
+      Move mempool rejections to new debug category
+      net: Fix sent reject messages for blocks and transactions
+      test: Add basic test for `reject` code
+
+hexabot (2):
+      Update depends/packages/native_clang.mk
+      Update depends/packages/native_rust.mk
+
+Marshall Gaucher (5):
+      Remove sprout funding flow logic
+      Add fix and note for timing issue
+      Update funding logic bug
+      Add usage documentation for manual and faucet driven tests
+      Update funding logic
+
+Jack Grigg (12):
+      Document next_pow2 effects and algorithm source
+      Improvements to CBlock::BuildAuthDataMerkleTree
+      rust: Explicitly return null hash for pre-v5 auth digests
+      book: Note that cargo patches work with absolute paths
+      Improve docs about setting CBlockIndex hash fields
+      test: Cleanups to ZIP 221 Python test code
+      Minor fixes to documentation and formatting
+      Fix typo in method documentation
+      Track lengths when copying receiver data from C++ to Rust
+      depends: Greatly simplify the Clang 12 patch
+      Adjust code comments to remove topological-sort references
+      Fix typos
+
diff --git a/depend/zcash/doc/release-notes/release-notes-4.5.0.md b/depend/zcash/doc/release-notes/release-notes-4.5.0.md
new file mode 100644
index 000000000..94453bd74
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-4.5.0.md
@@ -0,0 +1,387 @@
+Notable changes
+===============
+
+Network Upgrade 5
+-----------------
+
+The code preparations for the Network Upgrade 5 consensus rules are finished and
+included in this release. The following ZIPs are being deployed:
+
+- [ZIP 216: Require Canonical Jubjub Point Encodings](https://zips.z.cash/zip-0216)
+- [ZIP 224: Orchard Shielded Protocol](https://zips.z.cash/zip-0224)
+- [ZIP 225: Version 5 Transaction Format](https://zips.z.cash/zip-0225)
+- [ZIP 239: Relay of Version 5 Transactions](https://zips.z.cash/zip-0239)
+- [ZIP 244: Transaction Identifier Non-Malleability](https://zips.z.cash/zip-0244)
+
+NU5 will activate on testnet at height **1,590,000**, and can also be activated
+at a specific height in regtest mode by setting the config option
+`-nuparams=f919a198:HEIGHT`.
+
+The testnet activation of NU5, and `zcashd` v4.5.0 itself, is aimed at enabling
+existing Zcash users to test their software and make the necessary changes to be
+compatible with the new consensus rules. In particular:
+
+- Wallets should start adding support for v5 transactions.
+- Miners and mining pools should ensure that their software is compatible with
+  the semantic change to the block header specified in
+  [ZIP 244](https://zips.z.cash/zip-0244#block-header-changes)
+
+A subsequent v4.5.1 release in the coming weeks will add support for generating
+and using Unified Addresses ([ZIP 316](https://zips.z.cash/zip-0316)), which
+will enable `zcashd` wallets to interact with the Orchard shielded pool.
+
+As with previous network upgrades, it is possible that backwards-incompatible
+changes might be made to the consensus rules in this testing phase, prior to
+setting the mainnet activation height. In the event that this happens, testnet
+will be rolled back in v5.0.0 and a second testnet activation will occur.
+
+See [ZIP 252](https://zips.z.cash/zip-0252) for additional information about the
+deployment process for NU5.
+
+Rejecting unknown `CInv` message types
+--------------------------------------
+
+Previously, if `zcashd` received an `inv` or `getdata` message containing
+unknown `CInv` message types, it would ignore them and process the remainder of
+the message. Starting with v4.5.0, `zcashd` will instead drop the entire `inv`
+or `getdata` message and reply with a `reject` message. This will enable node
+operators to discover whether their nodes are sending unexpected `CInv` types;
+in particular, node operators should ensure their software does not produce the
+`MSG_WTX` CInv message type intended for the Bitcoin network, which is
+incompatible with the `MSG_WTX` CInv message type defined in ZIP 239 (which will
+be used from NU5 activation for advertising v5 transactions).
+
+Deprecated or removed RPCs
+--------------------------
+
+- The 'account' API inherited from Bitcoin Core has been disabled since the
+  launch of Zcash. Following its deprecation in Bitcoin Core v0.17 and removal
+  in Bitcoin Core v0.18, we have now removed the API from `zcashd`.
+
+
+Changelog
+=========
+
+Aditya Kulkarni (1):
+      Sort taddr txns by txindex in addition to height
+
+Alex Morcos (4):
+      Store the total sig op count of a tx.
+      Add a score index to the mempool.
+      Add TxPriority class and comparator
+      tidy up CInv::GetCommand
+
+Daira Hopwood (8):
+      Improve error message when a block would overfill the Orchard commitment tree.
+      More precise terminology: "lock free" -> "unlocked"
+      ZIP 339 support.
+      Update URL for Boost source download (from dl.bintray.com to boostorg.jfrog.io).
+      Cargo.toml: use librustzcash after the merge of https://github.com/zcash/librustzcash/pull/424 .
+      Update unified address test data to take account of HRPs in padding (https://github.com/zcash/librustzcash/pull/419).
+      Avoid need to cast away const in the C caller of zip339_free_phrase.
+      Update authors of librustzcash to everyone currently and formerly on Core team (in alphabetical order).
+
+Eric Lombrozo (2):
+      Removed ppszTypeName from protocol.cpp
+      getdata enum issue fix
+
+Ethan Heilman (1):
+      Fix typo adddrman to addrman as requested in #8070
+
+Ethan Heilman (1):
+      Remove non-determinism which is breaking net_tests #8069
+
+Gregory Maxwell (4):
+      Eliminate TX trickle bypass, sort TX invs for privacy and priority.
+      Move bloom and feerate filtering to just prior to tx sending.
+      Do not use mempool for GETDATA for tx accepted after the last mempool req.
+      Defer inserting into maprelay until just before relaying.
+
+Jack Grigg (124):
+      Re-include reading blocks from disk in block connection benchmark
+      cargo update
+      Migrate to latest zcash_* crates
+      metrics 0.16 and metrics-exporter-prometheus 0.5
+      Implement ZIP 216 consensus rules
+      Extract SpendDescriptionV5 and OutputDescriptionV5 classes
+      rust: Enable C++ streams to be passed into Rust code
+      ZIP 225 tx format constants
+      v5 transaction format parser
+      contrib: Add BOSL to contrib/debian/copyright
+      Remove early return logic from transaction parsing
+      rust: Document read_callback_t and write_callback_t
+      CTransaction: Make new ZIP 225 fields non-const and private
+      ZIP 244 transaction digests
+      ZIP 244 signature digests
+      ZIP 244 hashAuthDataRoot computation
+      Fix tests that assume CTxOuts can be "null"
+      test: Generate valid Sapling types
+      test: Small fixes to sighash test vector generation
+      test: Regenerate sighash.json after generator fixes
+      Throw an exception instead of asserting if Rust tx parser fails
+      CI: Publish correct book directory
+      CI: Build book with latest mdbook
+      rust: Documentation improvements to FFI methods
+      Implement Orchard authorization batch validator
+      Implement Orchard signature validation consensus rules
+      rust: Fix patched dependencies
+      book: Add dev guide page about Rust dependencies
+      Rename hashLightClientRoot to hashBlockCommitments in block header
+      ZIP 244 hashBlockCommitments implementation
+      test: Check for valid hashBlockCommitments construction post-NU5
+      Skip hashBlockCommitments check when testing block templates
+      test: Check hashBlockCommitments before, at, and after NU5 activation
+      ConnectBlock: Check NU activation when deriving block commitments
+      Copy authDigest in CTransaction::operator=(const CTransaction &tx)
+      rust: Move history tree FFI logic into a module
+      rust: Migrate to zcash_history with versioned trees
+      rust: Move history tree FFI declarations into a separate header
+      test: Use valid consensus branch IDs in history tree tests
+      Use V2 history trees from NU5 onward
+      test: Check history trees across Canopy and NU5 activations
+      rpc: Document getblock RPC finalorchardroot field, omit before NU5
+      rust: Document some requirements for history tree FFI methods
+      test: Add test case for popping from an empty history tree
+      Implement Orchard pool value tracking
+      rust: Load Orchard circuit parameters at startup
+      Check Orchard bundle-specific consensus rules, i.e. proofs
+      test: Update CCoinsViewTest with changes to CCoinsView interface
+      Include Orchard bundle in transaction dynamic usage
+      ZIP 203: Enforce coinbase nExpiryHeight consensus rule from NU5
+      test: Check for updated empty-tx reject messages in transaction tests
+      test: Fix OverwinterExpiryHeight test after ZIP 203 contextual changes
+      miner: Set coinbase expiry height to block height from NU5 activation
+      Introduce libzcash::RawAddress type
+      Use `libzcash::RawAddress` in `CWallet::GetFilteredNotes`
+      Use a visitor for handling -mineraddress config option
+      Add support for decoding and encoding Unified Addresses
+      Pass network type through to UA address handling logic
+      CI: Add workflow that runs general lints
+      CI: Check scripted diffs
+      CI: Add Rust lints
+      Document why a nested call to ExtractMinerAddress is not recursive
+      Add constants for UA typecodes
+      Postpone dependency updates we aren't doing in this release
+      depends: Update Rust to 1.54.0
+      depends: Update Clang / libcxx to LLVM 12
+      depends: Update utfcpp to 3.2.1
+      depends: Fix issue cross-compiling BDB to Windows with Clang 12
+      rust: cargo update
+      rust: metrics 0.17
+      CI: Use Rust 1.54 for lints
+      cargo fmt
+      test: Wait for transaction propagation in shorter_block_times RPC test
+      test: Fix race condition in p2p_txexpiringsoon
+      Revert "Remove reference to -reindex-chainstate"
+      test: Flush wallet in WriteCryptedSaplingZkeyDirectToDb before reopening
+      qa: Bump `sync_mempool` timeout for `prioritisetransaction.py`
+      ProcessGetData(): Rework IsExpiringSoon check
+      test: Print reject reason if RPC test block rejected instead of accepted
+      test: Fix pyflakes warnings
+      CI: Ignore errors from general lints we don't yet have passing
+      lint: remove duplicate include
+      lint: Add missing include guards
+      test: Add NU5 test cases to existing RPC tests
+      builder: Generate v5 transactions from NU5 activation
+      Print `nConsensusBranchId` in `CTransaction::ToString`
+      Separate the consensus and internal consistency checks for branch ID
+      Parse consensus branch ID when reading v5 transaction format
+      test: Use correct field of getnetworkinfo to read protocol version
+      CI: Add Dependabot config to keep Actions up-to-date
+      Introduce a WTxId struct
+      Implement CInv message type MSG_WTX
+      test: Fix bugs in mininode transaction parser
+      test: Add v5 tx support to mininode
+      ProcessGetData: Respond to MSG_WTX requests
+      Add MSG_WTX support to inv messages
+      Use wtxid for peer state management
+      test: Implement CInv.__eq__() for mininode to simplify RPC test
+      Postpone dependency updates that require CMake
+      depends: Update Rust to 1.54.0
+      test: Fix bug in mininode.SpendDescription.deserialize
+      Add named constants for legacy tx authDigest placeholder value
+      qa: Boost 1.77.0
+      cargo update
+      Migrate to latest revisions of Zcash Rust crates
+      test: Set up mininodes at the start of feature_zip239
+      net: Reject unknown CInv message types
+      make-release.py: Versioning changes for 4.5.0-rc1.
+      make-release.py: Updated manpages for 4.5.0-rc1.
+      make-release.py: Updated release notes and changelog for 4.5.0-rc1.
+      Migrate to latest revisions of orchard and the zcash_* crates
+      contrib: Add script for generating a graph of our Rust dependencies
+      cargo update
+      build: Add primitives/orchard.h to list of header files
+      build: Ensure that cargo uses vendored dependencies for git repos
+      build: Add missing source file to zcash_gtest_SOURCES
+      rust: Move Orchard batch logic into BatchValidator methods
+      wallet: Batch-validate all Orchard signatures in the wallet on load
+      rust: Skip running the Orchard batch validator on an empty batch
+      bench: Add Orchard logic to zcbenchmarks
+      cargo update
+      Update halo2 and orchard dependencies with BOSL Zcash exception
+      make-release.py: Versioning changes for 4.5.0.
+      make-release.py: Updated manpages for 4.5.0.
+
+John Newbery (10):
+      [tests] Remove wallet accounts test
+      [wallet] GetBalance can take an isminefilter filter.
+      [wallet] Factor out GetWatchOnlyBalance()
+      [wallet] deduplicate GetAvailableCredit logic
+      [wallet] factor out GetAvailableWatchOnlyBalance()
+      [wallet] GetBalance can take a min_depth argument.
+      [RPC] [wallet] allow getbalance to use min_conf and watch_only without accounts.
+      [wallet] Remove wallet account RPCs
+      [wallet] Kill accounts
+      [net] split PushInventory()
+
+Jonas Schnelli (1):
+      fix locking issue with new mempool limiting
+
+Kris Nuttycombe (46):
+      Update transaction auth commitments for pre-v5 transactions.
+      Move OrchardBundle to its own header file.
+      Implement the Rust side of the incremental merkle tree FFI.
+      Orchard changes to coins & consensus.
+      Return std::optional for GetAnchor
+      Check nullifiers length against bundle actions length.
+      Add Orchard bundle commitments to merkle tree.
+      Add Orchard merkle tree anchor tests.
+      Documentation cleanup.
+      Update orchard dependency.
+      Update to released version of incrementalmerkletree
+      Apply suggestions from code review
+      Apply suggestions from code review
+      Fix Orchard incremental Merkle tree empty root.
+      Fix header guards for incremental_sinsemilla_tree.h
+      Apply style suggestions.
+      Consistently panic on null commitment tree pointers.
+      Fix implmentation of OrchardMerkleTree.DynamicMemoryUsage
+      Document source of Orchard merkle tree test data.
+      Apply suggestions from code review
+      Add consensus check for duplicate Orchard nullifiers within a single transaction.
+      Add Orchard nullifiers to nullifiers cache.
+      Apply suggestions from code review
+      Ensure Sapling versions are valid after NU5
+      Make CTransaction::nConsensusBranchId a std::optional
+      Add NU5 upper bound check on nSpendsSapling, nOutputsSapling, nActionsOrchard
+      Check consensus branch ID for V5 transactions.
+      Rename tx.valueBalance -> tx.valueBalanceSapling
+      Make valueBalanceSapling a private non-const member of CTransaction.
+      Add Orchard value balance checks.
+      Account for Orchard balance in GetValueOut and GetShieldedValueIn.
+      Retract partial Orchard test support.
+      Add check that v5 transactions have empty Sprout joinsplits.
+      Prevent undefined behaviour in `CTransaction::GetValueOut()`
+      ZIP 213: Add checks to support Orchard shielded coinbase outputs.
+      Add check for consistency between nActionsOrchard and Orchard flags.
+      Ensure that the Orchard note commitment tree does not exceed its maximum size.
+      Update Orchard commitment tree hashes to use total MerkleCRH^Orchard.
+      Apply suggestions from code review
+      Make Sapling Spend and Ouput count, and Orchard Action count checks be noncontextual.
+      Use DOS level 100 for noncontextual checks.
+      Fix error strings to correctly reflect context.
+      Remove unused account-related wallet methods.
+      Use manual serialization for Merkle frontiers rather than bincode.
+      Fix clippy complaints.
+      Lock the wallet in SetBestChainINTERNAL
+
+Larry Ruane (1):
+      ZIP 225: v5 transaction check rules
+
+Luke Dashjr (1):
+      Optimisation: Store transaction list order in memory rather than compute it every need
+
+Marco Falke (1):
+      [qa] py2: Unfiddle strings into bytes explicitly
+
+Matt Corallo (4):
+      Fix calling mempool directly, instead of pool, in ATMP
+      Track (and define) ::minRelayTxFee in CTxMemPool
+      Add CFeeRate += operator
+      Print mempool size in KB when adding txn
+
+Patrick Strateman (5):
+      Fix insanity of CWalletDB::WriteTx and CWalletTx::WriteToDisk
+      Add CWallet::ListAccountCreditDebit
+      Add CWallet::ReorderTransactions and use in accounting_tests.cpp
+      Move CWalletDB::ReorderTransactions to CWallet
+      Move GetAccountBalance from rpcwallet.cpp into CWallet::GetAccountBalance
+
+Pieter Wuille (16):
+      Replace trickle nodes with per-node/message Poisson delays
+      Change mapRelay to store CTransactions
+      Make ProcessNewBlock dbp const and update comment
+      Switch reindexing to AcceptBlock in-loop and ActivateBestChain afterwards
+      Optimize ActivateBestChain for long chains
+      Add -reindex-chainstate that does not rebuild block index
+      Report reindexing progress in GUI
+      Split up and optimize transaction and block inv queues
+      Handle mempool requests in send loop, subject to trickle
+      Return mempool queries in dependency order
+      Add support for unique_ptr and shared_ptr to memusage
+      Switch CTransaction storage in mempool to std::shared_ptr
+      Optimize the relay map to use shared_ptr's
+      Optimization: don't check the mempool at all if no mempool req ever
+      Optimization: use usec in expiration and reuse nNow
+      Get rid of CTxMempool::lookup() entirely
+
+Russell Yanofsky (2):
+      [wallet] Add GetLegacyBalance method to simplify getbalance RPC
+      [wallet] Remove unneeded legacy getbalance code
+
+Shaul Kfir (1):
+      Add absurdly high fee message to validation state (for RPC propagation)
+
+Suhas Daftuar (3):
+      Use txid as key in mapAlreadyAskedFor
+      Reverse the sort on the mempool's feerate index
+      Only use AddInventoryKnown for transactions
+
+Technetium (1):
+      add missing aarch64 build deps
+
+Wladimir J. van der Laan (17):
+      streams: Add data() method to CDataStream
+      streams: Remove special cases for ancient MSVC
+      dbwrapper: Use new .data() method of CDataStream
+      wallet: Use CDataStream.data()
+      net: Consistent checksum handling
+      net: Hardcode protocol sizes and use fixed-size types
+      protocol.h: Move MESSAGE_START_SIZE into CMessageHeader
+      protocol.h: Make enums in GetDataMsg concrete values
+      Add assertion and cast before sending reject code
+      Add debug message to CValidationState for optional extra information
+      Introduce REJECT_INTERNAL codes for local AcceptToMempool errors
+      Add function to convert CValidationState to a human-readable message
+      Remove most logging from transaction validation
+      Add information to errors in ConnectBlock, CheckBlock
+      Move mempool rejections to new debug category
+      net: Fix sent reject messages for blocks and transactions
+      test: Add basic test for `reject` code
+
+hexabot (2):
+      Update depends/packages/native_clang.mk
+      Update depends/packages/native_rust.mk
+
+Marshall Gaucher (5):
+      Remove sprout funding flow logic
+      Add fix and note for timing issue
+      Update funding logic bug
+      Add usage documentation for manual and faucet driven tests
+      Update funding logic
+
+Jack Grigg (12):
+      Document next_pow2 effects and algorithm source
+      Improvements to CBlock::BuildAuthDataMerkleTree
+      rust: Explicitly return null hash for pre-v5 auth digests
+      book: Note that cargo patches work with absolute paths
+      Improve docs about setting CBlockIndex hash fields
+      test: Cleanups to ZIP 221 Python test code
+      Minor fixes to documentation and formatting
+      Fix typo in method documentation
+      Track lengths when copying receiver data from C++ to Rust
+      depends: Greatly simplify the Clang 12 patch
+      Adjust code comments to remove topological-sort references
+      Fix typos
+
diff --git a/depend/zcash/doc/release-notes/release-notes-4.5.1-1.md b/depend/zcash/doc/release-notes/release-notes-4.5.1-1.md
new file mode 100644
index 000000000..f7847c3bc
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-4.5.1-1.md
@@ -0,0 +1,46 @@
+Notable changes
+===============
+
+Added v5 transactions to standard rules
+---------------------------------------
+
+In v4.5.0 we added the v5 transaction format to the NU5 consensus rules for
+testnet. However, it was omitted from the standard rules, which meant that
+`zcashd` testnet nodes would not accept v5 transactions into their mempools,
+causing them to not be propagated or mined. This release updates the `zcashd`
+standard rules to accept v5 transactions alongside v4 transactions.
+
+New `listaddresses` RPC method
+------------------------------
+
+The `listaddresses` endpoint has been added to the RPC API. This method
+allows the caller to obtain addresses managed by the wallet, grouped
+by the source of the address, including both those addresses generated
+by the wallet and those associated with imported viewing or spending
+keys. This provides functionality that replaces and subsumes the 
+previously-removed `getaddressesbyaccount` method.
+
+Changelog
+=========
+
+Jack Grigg (6):
+      Mark v5 transaction format as standard for NU5
+      Fix comment
+      cargo update
+      depends: Postpone dependency updates
+      make-release.py: Versioning changes for 4.5.1-1.
+      make-release.py: Updated manpages for 4.5.1-1.
+
+Kris Nuttycombe (11):
+      Add `listaddresses` RPC method.
+      Categorize listaddresses result by source type.
+      Correctly handle imported Sapling addresses
+      Apply suggestions from code review
+      Apply suggestions from code review
+      Group legacy_hdseed Sapling addresses by account ID.
+      Update release notes for v4.5.1-1 to reflect the addition of `listaddresses`
+      Include `ImportedWatchOnly` as a PaymentAddressSource result.
+      Add listaddresses check to wallet_addresses.py
+      Consistently group Sapling addresses by IVK for every source.
+      Use lowerCamelCase for listaddresses JSON
+
diff --git a/depend/zcash/doc/release-notes/release-notes-4.5.1.md b/depend/zcash/doc/release-notes/release-notes-4.5.1.md
new file mode 100644
index 000000000..c0229a5e7
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-4.5.1.md
@@ -0,0 +1,80 @@
+Notable changes
+===============
+
+Fixed bugs in the testnet Orchard circuit
+-----------------------------------------
+
+In the `zcashd v4.5.0` release notes we indicated that a testnet rollback might
+occur to update the consensus rules, if we needed to make backwards-incompatible
+changes. Shortly after `zcashd v4.5.0` was released, during another internal
+review of the Orchard circuit, we identified two bugs that would affect the
+upcoming testnet activation of NU5:
+
+- The diversifier base `g_d_old`, for the note being spent, is required to be a
+  non-identity point. A note created from a payment address with `g_d` set to
+  the identity (via collaboration between sender and recipient) could be spent
+  multiple times with different nullifiers (corresponding to different `ivk`s).
+  The code outside the circuit correctly enforced the non-identity requirement,
+  but the circuit did not correctly constrain this, and allowed the prover to
+  witness the identity.
+
+- SinsemillaCommit can be modeled as a Pedersen commitment to an output of
+  SinsemillaHash: `SinsemillaCommit(r, M) = SinsemillaHashToPoint(M) + [r] R`.
+  The specification used incomplete addition here, matching its use inside
+  SinsemillaHash. However, unlike in SinsemillaHash, an exceptional case can be
+  produced here when `r = 0`. The derivations of `rivk` (for computing `ivk`)
+  and `rcm` (for computing the note commitment) normally ensure that `r = 0`
+  can only occur with negligible probability, but these derivations are not
+  checked by the circuit for efficiency; thus SinsemillaCommit needs to use
+  complete addition.
+
+These bugs do not affect mainnet, as `zcashd v4.5.0` only set the activation
+height for NU5 on testnet for testing purposes. Nevertheless, in the interest of
+keeping the testnet environment as close to mainnet as possible, we are fixing
+these bugs immediately. This means a change to the NU5 consensus rules, and a
+new testnet activation height for NU5.
+
+To this end, the following changes are made in `zcashd v4.5.1`:
+
+- The consensus branch ID for NU5 is changed to `0x37519621`.
+- The protocol version indicating NU5-aware testnet nodes is set to `170015`.
+- The testnet activation height for NU5 is set to **1,599,200**.
+
+Testnet nodes that upgrade to `zcashd v4.5.1` prior to block height 1,590,000
+will follow the new testnet network upgrade. Testnet nodes that are running
+`zcashd v4.5.0` at that height will need to upgrade to `v4.5.1` and then run
+with `-reindex`.
+
+As always, it is possible that further backwards-incompatible changes might be
+made to the NU5 consensus rules in this testing phase, prior to setting the
+mainnet activation height, as we continue to conduct additional internal review.
+In the event that this happens, testnet will be rolled back in (or prior to)
+v5.0.0, and a new testnet activation will occur.
+
+Fixed regression in `getbalance` RPC method
+-------------------------------------------
+
+`zcashd v4.5.0` removed the account API from the wallet, following its
+deprecation and removal in upstream Bitcoin Core. As part of the upstream
+changes, the `getbalance` RPC method was altered from using two custom balance
+computation methods, to instead relying on `CWallet::GetBalance`. This method
+internally relies on `CWalletTx::IsFromMe` as part of identifying "trusted"
+zero-confirmation transactions to include in the balance calculation.
+
+There is an equivalent and closely-named `CWallet::IsFromMe` method, which is
+used throughout the wallet, and had been updated before Zcash launched to be
+aware of spent shielded notes. The change to `getbalance` exposed a bug:
+`CWalletTx::IsFromMe` had not been similarly updated, which caused `getbalance`
+to ignore wallet-internal (sent between two addresses in the node's wallet)
+unshielding transactions with zero confirmations. This release fixes the bug.
+
+Changelog
+=========
+
+Jack Grigg (5):
+      wallet: Check spent shielded notes in CWalletTx::IsFromMe
+      Fix bugs in testnet Orchard circuit
+      depends: Postpone native_ccache 4.4.2
+      make-release.py: Versioning changes for 4.5.1.
+      make-release.py: Updated manpages for 4.5.1.
+
diff --git a/depend/zcash/doc/release-notes/release-notes-4.6.0-1.md b/depend/zcash/doc/release-notes/release-notes-4.6.0-1.md
new file mode 100644
index 000000000..975376aa1
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-4.6.0-1.md
@@ -0,0 +1,37 @@
+`getblocktemplate` regression fix
+=================================
+
+We added support for the NU5 consensus rules in v4.5.0, which alters the
+block header to contain a `hashBlockCommitments` value instead of the
+chain history root. However, the output of `getblocktemplate` wasn't
+returning this value; once NU5 activated, the `blockcommitmentshash`
+field was being set to "null" (all-zeroes).
+
+In v4.6.0 we added full NU5 support to `getblocktemplate`, by adding a
+`defaultroots` field that gave default values for `hashBlockCommitments`
+and the components required to derive it. However, in doing so we
+introduced a regression in the (now-deprecated) legacy fields, where
+prior to NU5 activation they contained nonsense.
+
+This release fixes the output of `getblocktemplate` to have the intended
+semantics for all fields:
+
+- The `blockcommitmentshash` and `authdataroot` fields in `defaultroots`
+  are now omitted from block templates for heights before NU5 activation.
+
+- The legacy fields now always contain the default value to be placed
+  into the block header (regaining their previous semantics).
+
+Changelog
+=========
+
+Jack Grigg (3):
+      rpc: Fix regression in getblocktemplate output
+      make-release.py: Versioning changes for 4.6.0-1.
+      make-release.py: Updated manpages for 4.6.0-1.
+
+Larry Ruane (3):
+      assert that the return value of submitblock is None
+      test: check getblocktemplate output before and after NU5
+      test: Fix ZIP 244 implementation
+
diff --git a/depend/zcash/doc/release-notes/release-notes-4.6.0-2.md b/depend/zcash/doc/release-notes/release-notes-4.6.0-2.md
new file mode 100644
index 000000000..ae6f649f5
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-4.6.0-2.md
@@ -0,0 +1,47 @@
+This is a bugfix release that also bumps the End-of-Support height to May 16th.
+It backports bugfixes from v4.7.0-rc1, including a `getblocktemplate` deadlock
+fix, and several portability fixes.
+
+Debian 9 "Stretch" is no longer supported from v4.6.0-2, due to its
+[end-of-life](https://wiki.debian.org/LTS/Stretch) on June 30th, 2022. This will
+allow us to direct more resources to supporting Debian 11 Bullseye, other Linux
+distributions, and other platforms such as Windows and macOS.
+
+Changelog
+=========
+
+Charlie O'Keefe (2):
+      Update base image used by Dockerfile from debian 10 to debian 11
+      Remove stretch (debian 9), add bullseye (debian 11) in gitian descriptor
+
+Daira Hopwood (4):
+      Avoid a warning by explicitly calling drop.
+      Replace call to drop with zeroization.
+      qa/zcash/updatecheck.py: print status code and response of failed http requests.
+      Postpone native_clang and libcxx 14.0.0.
+
+Jack Grigg (9):
+      qa: Bump all postponed dependencies
+      qa: Postpone recent CCache release
+      depends: Update Rust to 1.59.0
+      depends: Update Clang / libcxx to LLVM 13.0.1
+      rust: Fix clippy lint
+      depends: Revert to `libc++ 13.0.0-3` for Windows cross-compile
+      qa: Exclude `native_libtinfo` from dependency update checks
+      make-release.py: Versioning changes for 4.6.0-2.
+      make-release.py: Updated manpages for 4.6.0-2.
+
+Larry Ruane (1):
+      document global variables
+
+Pieter Wuille (2):
+      Fix csBestBlock/cvBlockChange waiting in rpc/mining
+      Modernize best block mutex/cv/hash variable naming
+
+Taylor Hornby (1):
+      Untested, not working yet, use libtinfo from the debian packages
+
+sasha (2):
+      on Arch only, use Debian's libtinfo5_6.0 to satisfy clang
+      remove superfluous space at end of native_packages line
+
diff --git a/depend/zcash/doc/release-notes/release-notes-4.6.0-rc1.md b/depend/zcash/doc/release-notes/release-notes-4.6.0-rc1.md
new file mode 100644
index 000000000..1bfd543d0
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-4.6.0-rc1.md
@@ -0,0 +1,111 @@
+Notable changes
+===============
+
+Wallet
+------
+
+From this release, newly-created wallets will save the chain name ("Zcash") and
+network identifier (e.g. "main") to the `wallet.dat` file. This will enable the
+`zcashd` node to check on subsequent starts that the `wallet.dat` file matches
+the node's configuration. Existing wallets will start saving this information in
+a later release.
+
+`libzcash_script`
+-----------------
+
+Two new APIs have been added to this library (`zcash_script_legacy_sigop_count`
+and `zcash_script_legacy_sigop_count_precomputed`), for counting the number of
+signature operations in the transparent inputs and outputs of a transaction.
+The presence of these APIs is indicated by a library API version of 2.
+
+Updated RPCs
+------------
+
+- Fixed an issue where `ERROR: spent index not enabled` would be logged
+  unnecessarily on nodes that have either insightexplorer or lightwalletd
+  configuration options enabled.
+
+- The `getmininginfo` RPC now omits `currentblockize` and `currentblocktx`
+  when a block was never assembled via RPC on this node during its current
+  process instantiation. (#5404)
+
+Changelog
+=========
+
+Alex Wied (1):
+      Update support for FreeBSD
+
+Charlie O'Keefe (1):
+      Add buster to the list of suites used by gitian
+
+Dimitris Apostolou (1):
+      Fix typos
+
+Jack Grigg (22):
+      contrib: Update Debian copyright file to follow the v1 format
+      contrib: Add license information for libc++ and libevent
+      cargo update
+      tracing-subscriber 0.3
+      Bump all postponed dependencies
+      depends: Update Rust to 1.56.1
+      depends: Update Clang / libcxx to LLVM 13
+      rust: Move `incremental_sinsemilla_tree_ffi` into crate root
+      CI: Add Pyflakes to lints workflow
+      cargo update
+      ed25519-zebra 3
+      cargo update
+      cargo update
+      depends: Update Boost to 1.78.0
+      depends Update Rust to 1.57.0
+      qa: Postpone recent CCache releases
+      Revert "lint: Fix false positive"
+      rust: Remove misleading log message
+      Migrate to latest revisions of Zcash Rust crates
+      Update release notes
+      make-release.py: Versioning changes for 4.6.0-rc1.
+      make-release.py: Updated manpages for 4.6.0-rc1.
+
+Janito Vaqueiro Ferreira Filho (1):
+      Move `CurrentTxVersionInfo` into a new file
+
+Kris Nuttycombe (7):
+      Add BIP 44 coin type to persisted wallet state.
+      Persist network id string instead of bip44 coin type.
+      Add a check to test that wallet load fails if we're on the wrong network.
+      Remove unused `AddDestData` method.
+      Fix wallet-related wording in doc/reduce-traffic.md
+      Rename OrchardMerkleTree -> OrchardMerkleFrontier
+      Batch-verify Orchard transactions at the block level.
+
+Larry Ruane (6):
+      add TestSetIBD(bool) for testing
+      Disable IBD for all boost tests
+      better wallet network info error handling
+      test: automatically add missing nuparams
+      Don't log 'ERROR: spent index not enabled'
+      getblocktemplate: add NU5 commitments to new `defaultroots` section
+
+Marco Falke (1):
+      [rpc] mining: Omit uninitialized currentblockweight, currentblocktx
+
+Marshall Gaucher (1):
+      Update entrypoint.sh
+
+Sasha (1):
+      fix typo in docker run's volume argument
+
+sgmoore (1):
+      Update reduce-traffic.md - add one word
+
+Jack Grigg (1):
+      contrib: Add space between URL and period
+
+teor (7):
+      Add sigop count functions to zcash_script library
+      Increment the zcash_script API version
+      Remove an unused header
+      Use correct copyright header
+      Remove redundant variable
+      Explain UINT_MAX error return value
+      Explain how to get rid of a tiny duplicated function
+
diff --git a/depend/zcash/doc/release-notes/release-notes-4.6.0.md b/depend/zcash/doc/release-notes/release-notes-4.6.0.md
new file mode 100644
index 000000000..26e1f3652
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-4.6.0.md
@@ -0,0 +1,126 @@
+Notable changes
+===============
+
+Wallet
+------
+
+From this release, newly-created wallets will save the chain name ("Zcash") and
+network identifier (e.g. "main") to the `wallet.dat` file. This will enable the
+`zcashd` node to check on subsequent starts that the `wallet.dat` file matches
+the node's configuration. Existing wallets will start saving this information in
+a later release.
+
+`libzcash_script`
+-----------------
+
+Two new APIs have been added to this library (`zcash_script_legacy_sigop_count`
+and `zcash_script_legacy_sigop_count_precomputed`), for counting the number of
+signature operations in the transparent inputs and outputs of a transaction.
+The presence of these APIs is indicated by a library API version of 2.
+
+Updated RPCs
+------------
+
+- The `getblocktemplate` RPC method output now includes a `defaultroots` field,
+  which provides various tree roots and block commitments matching the contents
+  of the block template. If any part of the block template marked as `mutable`
+  in the RPC method output is mutated, these roots may need to be recomputed.
+  For more information on the derivation process, see the block header changes
+  in [ZIP 244](https://zips.z.cash/zip-0244#block-header-changes).
+
+- Fixed an issue where `ERROR: spent index not enabled` would be logged
+  unnecessarily on nodes that have either `-insightexplorer` or `-lightwalletd`
+  configuration options enabled.
+
+- The `getmininginfo` RPC now omits `currentblocksize` and `currentblocktx`
+  when a block was never assembled via RPC on this node during its current
+  process instantiation. (#5404)
+
+Changelog
+=========
+
+Alex Wied (1):
+      Update support for FreeBSD
+
+Charlie O'Keefe (2):
+      Add buster to the list of suites used by gitian
+      Add libtinfo5 to gitian packages list
+
+Dimitris Apostolou (1):
+      Fix typos
+
+Jack Grigg (23):
+      contrib: Update Debian copyright file to follow the v1 format
+      contrib: Add license information for libc++ and libevent
+      cargo update
+      tracing-subscriber 0.3
+      Bump all postponed dependencies
+      depends: Update Rust to 1.56.1
+      depends: Update Clang / libcxx to LLVM 13
+      rust: Move `incremental_sinsemilla_tree_ffi` into crate root
+      CI: Add Pyflakes to lints workflow
+      cargo update
+      ed25519-zebra 3
+      cargo update
+      cargo update
+      depends: Update Boost to 1.78.0
+      depends Update Rust to 1.57.0
+      qa: Postpone recent CCache releases
+      Revert "lint: Fix false positive"
+      rust: Remove misleading log message
+      Migrate to latest revisions of Zcash Rust crates
+      Update release notes
+      make-release.py: Versioning changes for 4.6.0-rc1.
+      make-release.py: Updated manpages for 4.6.0-rc1.
+      make-release.py: Updated release notes and changelog for 4.6.0-rc1.
+
+Janito Vaqueiro Ferreira Filho (1):
+      Move `CurrentTxVersionInfo` into a new file
+
+Kris Nuttycombe (7):
+      Add BIP 44 coin type to persisted wallet state.
+      Persist network id string instead of bip44 coin type.
+      Add a check to test that wallet load fails if we're on the wrong network.
+      Remove unused `AddDestData` method.
+      Fix wallet-related wording in doc/reduce-traffic.md
+      Rename OrchardMerkleTree -> OrchardMerkleFrontier
+      Batch-verify Orchard transactions at the block level.
+
+Larry Ruane (8):
+      add TestSetIBD(bool) for testing
+      Disable IBD for all boost tests
+      better wallet network info error handling
+      test: automatically add missing nuparams
+      Don't log 'ERROR: spent index not enabled'
+      getblocktemplate: add NU5 commitments to new `defaultroots` section
+      test: fix bugs in test framework
+      test: Use result of getblocktemplate to submitblock
+
+Marco Falke (1):
+      [rpc] mining: Omit uninitialized currentblockweight, currentblocktx
+
+Marshall Gaucher (1):
+      Update entrypoint.sh
+
+Sasha (5):
+      fix typo in docker run's volume argument
+      update hash for librustzcash
+      only librustzcash in config.offline
+      make-release.py: Versioning changes for 4.6.0.
+      make-release.py: Updated manpages for 4.6.0.
+
+sgmoore (1):
+      Update reduce-traffic.md - add one word
+
+Jack Grigg (1):
+      contrib: Add space between URL and period
+
+teor (7):
+      Add sigop count functions to zcash_script library
+      Increment the zcash_script API version
+      Remove an unused header
+      Use correct copyright header
+      Remove redundant variable
+      Explain UINT_MAX error return value
+      Explain how to get rid of a tiny duplicated function
+
diff --git a/depend/zcash/doc/release-notes/release-notes-4.7.0-rc1.md b/depend/zcash/doc/release-notes/release-notes-4.7.0-rc1.md
new file mode 100644
index 000000000..d428fa1d1
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-4.7.0-rc1.md
@@ -0,0 +1,538 @@
+Notable changes
+===============
+
+Mnemonic Recovery Phrases
+-------------------------
+
+The zcashd wallet has been modified to support BIP 39, which describes how to
+derive the wallet's HD seed from a mnemonic phrase.  The mnemonic phrase will
+be generated on load of the wallet, or the first time the wallet is unlocked,
+and is available via the `z_exportwallet` RPC call. All new addresses produced
+by the wallet are now derived from this seed using the HD wallet functionality
+described in ZIP 32 and ZIP 316. For users upgrading an existing Zcashd wallet,
+it is recommended that the wallet be backed up prior to upgrading to the 4.7.0
+Zcashd release.
+
+Following the upgrade to 4.7.0, Zcashd will require that the user confirm that
+they have backed up their new emergency recovery phrase, which may be obtained
+from the output of the `z_exportwallet` RPC call. This confirmation can be
+performed manually using the `zcashd-wallet-tool` utility that is supplied
+with this release (built or installed in the same directory as `zcashd`).
+The wallet will not allow the generation of new addresses until this
+confirmation has been performed. It is recommended that after this upgrade,
+that funds tied to preexisting addresses be migrated to newly generated
+addresses so that all wallet funds are recoverable using the emergency
+recovery phrase going forward. If you choose not to migrate funds in this
+fashion, you will continue to need to securely back up the entire `wallet.dat`
+file to ensure that you do not lose access to existing funds; EXISTING FUNDS
+WILL NOT BE RECOVERABLE USING THE EMERGENCY RECOVERY PHRASE UNLESS THEY HAVE
+BEEN MOVED TO A NEWLY GENERATED ADDRESS FOLLOWING THE 4.7.0 UPGRADE.
+
+New RPC Methods
+---------------
+
+- 'walletconfirmbackup' This newly created API checks a provided emergency
+  recovery phrase against the wallet's emergency recovery phrase; if the phrases
+  match then it updates the wallet state to allow the generation of new addresses.
+  This backup confirmation workflow can be disabled by starting zcashd with 
+  `-requirewalletbackup=false` but this is not recommended unless you know what
+  you're doing (and have otherwise backed up the wallet's recovery phrase anyway).
+  For security reasons, this RPC method is not intended for use via zcash-cli 
+  but is provided to enable `zcashd-wallet-tool` and other third-party wallet 
+  interfaces to satisfy the backup confirmation requirement. Use of the 
+  `walletconfirmbackup` API via zcash-cli would risk that the recovery phrase 
+  being confirmed might be leaked via the user's shell history or the system
+  process table; `zcashd-wallet-tool` is specifically provided to avoid this
+  problem.
+- 'z_getbalanceforviewingkey' This newly created API allows a user to obtain
+  balance information for funds visible to a Sapling or Unified full
+  viewing key; if a Sprout viewing key is provided, this method allows 
+  retrieval of the balance only in the case that the wallet controls the
+  corresponding spending key.
+
+RPC Changes
+-----------
+
+- The results of the 'dumpwallet' and 'z_exportwallet' RPC methods have been modified
+  to now include the wallet's newly generated emergency recovery phrase as part of the
+  exported data.
+
+- The results of the 'getwalletinfo' RPC have been modified to return two new fields:
+  `mnemonic_seedfp` and `legacy_seedfp`, the latter of which replaces the field that
+  was previously named `seedfp`. 
+
+Wallet
+------
+
+'z_sendmany'
+------------
+
+- The 'z_sendmany' RPC call no longer permits Sprout recipients in the 
+  list of recipient addresses. Transactions spending Sprout funds will
+  still result in change being sent back into the Sprout pool, but no
+  other `Sprout->Sprout` transactions will be constructed by the Zcashd
+  wallet. 
+
+- The restriction that prohibited `Sprout->Sapling` transactions has been 
+  lifted; however, since such transactions reveal the amount crossing 
+  pool boundaries, they must be explicitly enabled via a parameter to
+  the 'z_sendmany' call.
+
+- A new string parameter, `privacyPolicy`, has been added to the list of
+  arguments accepted by `z_sendmany`. This parameter enables the caller to
+  control what kind of information they permit `zcashd` to reveal when creating
+  the transaction. If the transaction can only be created by revealing more
+  information than the given strategy permits, `z_sendmany` will return an
+  error. The parameter defaults to `LegacyCompat`, which applies the most
+  restrictive strategy `FullPrivacy` when a Unified Address is present as the
+  sender or a recipient, and otherwise preserves existing behaviour (which
+  corresponds to the `AllowFullyTransparent` policy).
+
+- Since Sprout outputs are no longer created (with the exception of change)
+  'z_sendmany' no longer generates payment disclosures (which were only 
+  available for Sprout outputs) when the `-paymentdisclosure` experimental
+  feature flag is set.
+
+Changelog
+=========
+
+Charlie O'Keefe (2):
+      Update base image used by Dockerfile from debian 10 to debian 11
+      Remove stretch (debian 9), add bullseye (debian 11) in gitian descriptor
+
+Conrado Gouvea (1):
+      Add comment to zcash_script_new_precomputed_tx about references to input buffers
+
+Daira Hopwood (25):
+      Avoid a warning by explicitly calling drop.
+      Replace call to drop with zeroization.
+      contrib/devtools/rust-deps-graph.sh: allow overriding the arguments to `cargo deps`.
+      Cosmetic whitespace change
+      Make a zcashd-wallet-tool executable.
+      Attempt to fix linking problem on ARM.
+      Add some text about choosing location of the physical backup. Add TODO for better handling of file not found and permission errors.
+      Move `wallet_tool.rs` from `src/rust/src` into `src/rust/bin`. Also add a brief description of `zcashd-wallet-tool` to `src/rust/README.md`.
+      Improved error handling.
+      The recovery phrase confirmation and `zcashd-wallet-tool` are being introduced in zcashd v4.7.0.
+      Refactor use of `export_path` as suggested.
+      Tweak the wording of the fallback messages when the terminal cannot be automatically cleared.
+      Simplify extraction of recovery phrase.
+      Improve memory hygiene, and use -stdin to pass the recovery phrase to the child zcash-cli process.
+      Cleanups to error handling for the first invocation of zcash-cli.
+      Use the tracing crate for debugging.
+      Improve error message when the config file cannot be found, taking into account -conf and -datadir.
+      Ensure the buffer used in `prompt` is zeroized even on error.
+      Document that '~' cannot be used in `-datadir` (see #5661).
+      Set `meta` for `-datadir` option.
+      Simplify debug tracing.
+      Correct the fallback instruction for how to clear the terminal on macOS: pressing Command + K also clears scrollback.
+      Include $(bin_SCRIPTS) in `check-symbols`, `check-security`, and `clean` targets. Checking for stack canaries in `check-security` is disabled for Rust executables (Rust does support `-Z stack-protector=all` but only for the nightly compiler).
+      qa/zcash/full_test_suite.py: enable `test_rpath_runpath` for Rust binaries, and reenable `test_fortify_source` for C++ binaries.
+      Tweaks to message text.
+
+Dimitris Apostolou (1):
+      Fix typos
+
+Jack Grigg (65):
+      wallet: Implement `z_getnewaccount`
+      wallet: Implement `z_getaddressforaccount`
+      wallet: Implement `z_listunifiedreceivers`
+      wallet: Show UAs owned by the wallet in `z_viewtransaction`
+      wallet: Reverse order of arguments to z_getaddressforaccount
+      rust: Add missing Orchard receiver check in UA parsing
+      rust: Add missing checks for shielded UFVK items
+      rust: Add missing checks for transparent UFVK items
+      wallet: Implement `z_getbalanceforaccount`
+      wallet: Fix account generation bug
+      wallet: Implement `z_getbalanceforaddress`
+      wallet: Don't show Sapling receivers from UAs in `z_listaddresses`
+      wallet: Show UAs instead of Sapling receivers in `z_listunspent`
+      wallet: Remove `CWallet::GetKeyFromPool`
+      wallet: Store internal transparent keys in the keypool
+      wallet: Separate counters for external and internal transparent keys
+      Add Orchard recipient support to the transaction builder
+      Make `TransactionBuilder::AddOrchardOutput` memo optional
+      Return UFVK from `CWallet::GenerateNewUnifiedSpendingKey`
+      Rename to `ZcashdUnifiedSpendingKey::GetSaplingKey` for consistency
+      Trial-decrypt candidate Sapling receivers with all wallet UFVKs
+      Add mappings from Orchard receivers to IVKs to the wallet
+      Add Orchard to default UA receiver types
+      Fix semantic merge conflicts
+      Select Orchard receivers preferentially from UAs
+      Regenerate `TxDigests` after rebuilding tx with Orchard bundle
+      qa: Bump all postponed dependencies
+      qa: Postpone recent CCache release
+      depends: Update Rust to 1.59.0
+      depends: Update Clang / libcxx to LLVM 13.0.1
+      cargo update
+      rust: Fix clippy lint
+      Ensure the view's best Orchard anchor matches the previous block
+      Add missing `view.PopAnchor(_, ORCHARD)` in `DisconnectBlock`
+      Add RPC test for the Orchard commitment tree bug on first NU5 testnet
+      Use `std::optional` in `CValidationInterface::GetAddressForMining`
+      Select Orchard receivers from UA miner addresses once NU5 activates
+      miner: Manually add dummy Orchard output with Orchard miner address
+      rpc: Handle keypool exhaustion separately in `generate` RPC
+      depends: Revert to `libc++ 13.0.0-3` for Windows cross-compile
+      Add Orchard spend support to the transaction builder
+      wallet: Alter `OrchardWallet::GetSpendInfo` to return the spending key
+      Improve FFI interface documentation
+      Refactor `CWallet::GenerateChangeAddressForAccount`
+      Add unit tests for `SpendableInputs::LimitToAmount`
+      Fix bug in `SpendableInputs::LimitToAmount`
+      Select spendable inputs based on recipient and change pool types
+      Implement opportunistic shielding in `SpendableInputs::LimitToAmount`
+      Add Orchard cases to note selection logic
+      Add Orchard to change address generation
+      Add support for sending Orchard funds in `z_sendmany`
+      Set default Orchard anchor confirmations to 1
+      build: Fix `zcash/address/orchard.hpp` filename in `src/Makefile.am`
+      z_sendmany: Replace `allowRevealedAmount` with `privacyStrategy`
+      z_sendmany: Expand `privacyPolicy` cases
+      build: Add missing `util/match.h` to `src/Makefile.am`
+      wallet: Add seedfp to transparent keys in dumpwallet / z_exportwallet
+      Fix bugs in wallet_addresses RPC test
+      wallet: Fix bugs in `listaddresses`
+      wallet: Fix Sapling address bug in `listaddresses`
+      wallet: Fix expected `listaddresses` sources in `rpc_wallet_tests`
+      qa: Exclude `native_libtinfo` from dependency update checks
+      cargo update
+      make-release.py: Versioning changes for 4.7.0-rc1.
+      make-release.py: Updated manpages for 4.7.0-rc1.
+
+John Newbery (1):
+      Log calls to getblocktemplate
+
+Jonas Schnelli (1):
+      [Wallet] add HD xpriv to dumpwallet
+
+Kris Nuttycombe (243):
+      Derive random HD seeds from ZIP-339 seed phrases.
+      Add support for externally searching for valid Sapling diversifiers.
+      Adds basic unified spending key derivation.
+      Add unified full viewing keys and Zcash-internal unified addresses.
+      Use the default UA-based Sapling address for the saplingmigration tool.
+      Fix tests for wallet operations on legacy Sapling keys.
+      Remove unused forward declaration.
+      Update librustzcash dependency version.
+      Apply suggestions from code review
+      Derive transparent keys from mnemonic seed.
+      Generate legacy Sapling addresses from the mnemonic seed.
+      Replace account ID with ZIP-0032 key path in listaddresses output.
+      Use legacy address for Sapling migration until UA functionality is available to the RPC tests.
+      Revert change to the type of GenerateNewKey
+      Fix wallet import/export test
+      Use 0x7FFFFFFF for the legacy account ID.
+      Require backup of the emergency recovery phrase.
+      Use hardened derivation for the legacy Sapling key at the address index level.
+      Address comments from code review.
+      Restore legacy HD seed storage & retrieval tests.
+      Fix spurious test passage.
+      Move CKeyMetadata back to wallet.h
+      Clean up format of recovery information in the wallet dump.
+      Use SecureString for mnemonic phrase.
+      Apply suggestions from code review
+      Fix diversifier_index_t less than operator.
+      Restore FindAddress comment
+      Fix transparent BIP-44 keypaths.
+      Fix naming of unified spending & full viewing keys
+      Fix max transparent diversifier index.
+      Clean up handling of mnemonic seed metadata.
+      Restore legacy HDSeed encryption tests.
+      Style fix in BIP 32 path account parsing test.
+      Do not strip quotes when verifying mnemonic seed.
+      Apply suggestions from code review
+      Fix name of menmonic entropy length constant.
+      Fix polymorphism of string serialization.
+      Document mnemonic-seed-related RPC method changes & update changelog.
+      Minor cleanup of the code that searches for a valid transparent key.
+      Generalize keypath parsing over account id.
+      Update documentation for GenerateNewSeed.
+      Use MnemonicSeed instead of HDSeed where appropriate.
+      Add diversifier_index_t::ToTransparentChildIndex
+      Only maintain CKeyID for the transparent part of ZcashdUnifiedAddress
+      Minor naming fixes
+      Parameterize HD keypath parsing by coin type.
+      Fix error message text to refer to zcashd-wallet-tool rather than the RPC method.
+      Apply suggestions from code review
+      Minor textual fixes to release notes.
+      Improve documentation of the `-walletrequirebackup` zcashd wallet configuration option.
+      Add libzcash::AccountId type.
+      Adds Orchard Address, IncomingViewingKey, FullViewingKey, and SpendingKey types.
+      Apply suggestions from code review
+      Update orchard & librustzcash dependency versions.
+      Remove incorrect FFI method documentation.
+      Remove Orchard spending key equality implementation.
+      Refine structure of Zcash address generation.
+      Use CKeyID and CScriptID instead of new P2PKH/P2SHAddress classes.
+      Remove ZcashdUnifiedAddress in favor of UnifiedAddress
+      Update to ufvk zcash_address build.
+      Adds SaplingDiversifiableFullViewingKey
+      Add Rust FFI components for unified full viewing keys.
+      Add UnifiedFullViewingKey type.
+      Apply suggestions from code review
+      Add tests for ufvk roundtrip serialization.
+      Apply suggestions from code review
+      Apply suggestions from code review
+      Apply suggestions from code review
+      Add functions for generating BIP-44 and ZIP-32 keypaths
+      Check the output of zip339_phrase_to_seed in MnemonicSeed initialization.
+      Compute key id for UFVKs.
+      Add ZcashdUnifiedKeyMetadata and libzcash::ReceiverType
+      Add unified key components to the transparent & Sapling wallet parts.
+      Store ufvks to the wallet database.
+      Add unified address tracking to KeyStore
+      Load unified full viewing keys from the walletdb.
+      Add key metadata to walletdb.
+      Add unified address generation.
+      AddTransparentSecretKey does not need to take a CExtKey
+      Add newly generated transparent UA receivers to the wallet.
+      Add CWallet::GetUnifiedForReceiver
+      Add tests for keystore storage and retrieval of UFVKs.
+      Add test for wallet UA generation & detection.
+      Add test for CKeyStore::AddUnifiedAddress
+      Fix handling of unified full viewing key metadata.
+      Apply suggestions from code review
+      Only derive ZcashdUnifiedFullViewingKey from UnifiedFullViewingKey
+      Rename `ZcashdUnifiedSpendingKeyMetadata` -> `ZcashdUnifiedAccount`
+      Remove unused ufvkid argument from AddTransparentSecretKey
+      Ensure that unified address metadata is always correctly populated.
+      Apply suggestions from code review
+      Make `FindAddress` correctly check for maximum transparent child index.
+      Use Bip44TransparentAccountKeyPath() for Bip44AccountChains keypath construction.
+      Improve documentation of UFVK/UA metadata storage semantics.
+      Apply suggestions from code review
+      Fix encoding order of unified addresses.
+      Remove the `InvalidEncoding` type from key & address variants.
+      Use CKeyID and CScriptID instead of new P2PKH/P2SHAddress classes.
+      Remove spurious uses of HaveSpendingKeyForPaymentAddress
+      Add raw transparent address types to PaymentAddress
+      Remove spurious variant from asyncrpcoperation_sendmany
+      Remove `RawAddress`
+      Replace `DecodeDestination` in `GetMinerAddress` with `DecodePaymentAddress`
+      Remove uses of KeyIO::DecodeDestination
+      Remove a use of KeyIO::DecodeDestination in z_shieldcoinbase
+      Use libzcash::PaymentAddress instead of std::string in mergetoaddress
+      Improve error messages in the case of taddr decoding failure.
+      Apply suggestions from code review
+      Apply suggestions from code review
+      Use transaction builder for asyncrpcoperation_sendmany.
+      Transaction builder must not set consensus branch ID for V4 transactions.
+      Fix conditions around dust thresholds.
+      Require an explicit flag to allow cross-pool transfers in z_sendmany.
+      Apply suggestions from code review
+      Return z_sendmany errors synchronously when possible.
+      Update release notes to reflect z_sendmany changes
+      Move FindSpendableInputs to CWallet
+      Replace the badly-named `PaymentSource` with `ZTXOSelector`
+      Add support for unified addresses to CWallet::ToZTXOSelector
+      Replace `HaveSpendingKeyForAddress` with checks at ZTXOSelector construction.
+      Modify CWallet::FindSpendableInputs to use ZTXOSelector
+      Add CWallet::FindAccountForSelector
+      Add RecipientAddress type.
+      Use libzcash::RecipientAddress for z_sendmany recipients.
+      Apply suggestions from code review
+      Rename ZTXOSelector::SpendingKeysAvailable -> RequireSpendingKeys
+      Make `FindSpendableInputs` respect `ZTXOSelector::RequireSpendingKeys()`
+      Clarify documentation of CWallet::FindAccountForSelector
+      Use `ZTXOSelector::IncludesSapling` rather than selector internals.
+      Add documentation for `UnifiedAddress::GetPreferredRecipientAddress`
+      Add correct selection of change addresses to z_sendmany
+      Add a first-class type for transparent full viewing keys.
+      Implement OVK selection for z_sendmany.
+      Implement derivation of the internal Sapling spending key.
+      Use a BIP 44 change address for change when sending from legacy t-addrs.
+      Add a check for internal vs. external outputs to wallet_listreceived test.
+      Fix z_sendmany handling of transparent OVK derivation in the ANY_TADDR case.
+      Simplify determination of valid change types.
+      Add failing tests for z_sendmany ANY_TADDR -> UA and UA -> <legacy_taddr>
+      Add gtest for change address derivation.
+      Fix variable shadowing in change address derivation & add change IVK to the keystore.
+      GenerateLegacySaplingZKey only needs to return an address, not an extfvk.
+      Rename AddSaplingIncomingViewingKey -> AddSaplingPaymentAddress
+      Do not add Sapling addresses to the wallet by default when adding extfvks.
+      Fix a bug in the generation of addresses from UFVKs
+      Add accessor method for Sapling IVKs to SaplingDiversifiableFullViewingKey
+      Address TODOs in rpc-tests/wallet-accounts.py
+      Add a few additional cases to z_sendmany RPC tests.
+      Update librustzcash dependency.
+      Fix nondeterministic test error (checking for the wrong error case).
+      Use z_shieldcoinbase for Sprout funds in wallet_listreceived tests.
+      Apply suggestions from code review
+      Apply suggestions from code review.
+      Fix nondeterministic test failure in wallet_listreceivedby.py
+      Fix locking in z_getbalanceforaddress and z_getbalanceforaccount
+      Replace z_getbalanceforaddress with z_getbalanceforviewingkey
+      Clarify documentation of z_getbalanceforviewingkey for Sprout viewing keys.
+      Implement PaymentAddressBelongsToWallet for unified addresses.
+      Add unified address support to GetSourceForPaymentAddress
+      Address comments from review.
+      Add change field to z_listreceivedbyaddress for transparent addrs.
+      Fix missing std::variant header that was breaking Darwin builds.
+      Add test vectors for UFVK derivation
+      Rename sapling-specific zip32 FFI methods.
+      Make SaveRecipientMappings polymorphic in RecipientMapping type.
+      Add Rust backend for Orchard components of the wallet.
+      Add GetFilteredNotes to Orchard wallet.
+      Add test for Orchard wallet note detection.
+      Move parsing of unified addresses to UnifiedAddress.
+      Remove txid field from TxNotes
+      Apply suggestions from code review
+      Add various bits of documentation
+      Add Orchard components to unified address
+      Add Orchard components to unified full viewing keys
+      Add Orchard components to unified spending keys
+      Remove OrchardSpendingKey serialization code
+      Select Orchard notes in FindSpendableInputs
+      GenerateNewKey must be guarded by a cs_wallet lock
+      Filter returned Orchard notes by minimum confirmations.
+      Log outpoint for failed Sapling witness lookup.
+      Add a roundtrip test for Orchard merkle frontier serialization from the C++ side.
+      Add test for Orchard contribution to z_gettotalbalance
+      Respect minDepth argument for Orchard notes in GetFilteredNotes
+      Update MSRV for lints.
+      Update incrementalmerkletree version
+      Split LoadWalletTx from AddToWallet
+      Fix missing locks for GenerateNewUnifiedSpendingKey tests.
+      Record when notes are detected as being spent in the Orchard wallet.
+      Reset Orchard wallet state when rescanning from below NU5 activation.
+      Check wallet latest anchor against hashFinalOrchardRoot in ChainTip.
+      Remove assertions that require Orchard wallet persistence to satisfy.
+      Add a test for Orchard note detection.
+      Assert we never attempt to checkpoint the Orchard wallet at a negative block height.
+      Apply suggestions from code review
+      Add an `InPoint` type to the Orchard wallet to fix incorrect conflict data.
+      Apply suggestions from code review
+      Fix missing update to `last_checkpoint` on rewind.
+      Track mined-ness instead of spent-ness of notes in the Orchard wallet.
+      Apply suggestions from code review
+      Respect maxDepth for Orchard notes in GetFilteredNotes
+      Set number of confirmations for Orchard notes returned by FindSpendableInputs
+      Update walletTx with decrypted Orchard action metadata.
+      Persist Orchard action index/IVK mappings in CWalletTx
+      Restore decrypted notes to the wallet.
+      Update tests with rollback checks.
+      Apply suggestions from code review
+      Restore mined block heights when restoring decrypted notes.
+      Apply suggestions from code review
+      Return std::optional<CExtKey> from CExtKey::Master
+      Ensure that Orchard spentness information is repopulated by LoadUnifiedCaches.
+      Modify `join_network` in tests to skip mempool resync.
+      Address suggestions from code review on #5637
+      Apply suggestions from code review
+      Serialize the Orchard note commitment tree to the wallet.
+      Update orchard_wallet_add_notes_from_bundle documentation.
+      Derive the new mnemonic seed from the legacy HD seed, if one is available.
+      Fix indentation.
+      Apply suggestions from code review
+      Explicitly specify the change address in the Sapling migration.
+      Add TODO for Orchard z_listunspent integration.
+      Document that z_getnewaccount and z_getaddressforaccount replace z_getnewaddress.
+      Add orchard support to z_getnotescount
+      Document that Orchard keys are not supported in z_importkey help
+      Return the correct error for `z_getbalance` if a UA does not correspond to an account in the wallet..
+      Update documentation of z_importviewingkey and z_exportviewingkey to address unified keys.
+      Add UnifiedAddress variant to ZTXOSelector
+      Eliminate redundancy between the wallet and the keystore.
+      Simplify retrieval of unified account by address.
+      Add OrchardWallet::GetTxActions
+      Apply suggestions from code review
+      Update z_viewtransaction documentation to correctly represent field names.
+      Add debug printing for receivers and recipient addresses.
+      Correctly report change outputs in z_viewtransaction.
+      Return the default unified address if we have the UFVK but no address metadata.
+      Fix missing AllowRevealedSenders flag in test.
+      Uncomment addtional tests that depend on z_viewtransaction.
+      Minor rename & documentation improvement.
+      Add RecipientType to GetPaymentAddressForRecipient result.
+      Make CWallet::DefaultReceiverTypes height-dependent.
+      Return failure rather than asserting on WriteRecipientMapping failure.
+      Lock cs_main for accesses to chainActive in GetPaymentAddressForRecipient.
+      Fix legacy address handling in CWallet::GetPaymentAddressForRecipient
+      Documentation fix for UnifiedAddressForReciever (+ spelling corrections.)
+
+Larry Ruane (12):
+      add ParseArbitraryInt() for diversifier index
+      add -orchardwallet experimental feature flag
+      Add new and modify existing Orchard RPCs, non-functional
+      mining: submitblock: log detailed equihash solution error
+      allow UA as z_shieldcoinbase destination
+      fix minconf parsing for z_getbalanceforaccount and z_getbalanceforaddress
+      Update z_listreceivedbyaddress to support unified addresses (5467)
+      fix wallet_listreceived.py, add blockdata to taddr output
+      z_listreceivedbyaddress: reject UA component addr (#5537)
+      add functional test
+      document global variables
+      update listaddresses RPC for UAs, Orchard
+
+Marius Kjærstad (1):
+      Update copyright year to 2022
+
+Pieter Wuille (2):
+      Fix csBestBlock/cvBlockChange waiting in rpc/mining
+      Modernize best block mutex/cv/hash variable naming
+
+Sean Bowe (5):
+      wallet: consolidate unified key/address/account map reconstruction
+      wallet: restore Orchard secret keys from mnemonic seed
+      wallet: restore orchard address to IVK mappings during wallet loading
+      wallet: rather than assert, error in case of inconsistency between FVK and address
+      wallet: add logging for failure cases in unified cache loading
+
+Steven Smith (8):
+      Lock cs_main prior to calling blockToJSON
+      Mark z_gettotalbalance and dumpwallet as deprecated
+      Add Orchard support to the z_gettreestate RPC
+      Update transaction size estimation to include V5 transactions
+      Extend uniqueness check in z_sendmany to UA receivers
+      Load previously persisted sent transaction recipient metadata back into the wallet.
+      Add Orchard & unified address support to z_viewtransaction.
+      Ensure z_viewtransaction returns Orchard details
+
+Taylor Hornby (1):
+      Untested, not working yet, use libtinfo from the debian packages
+
+sasha (12):
+      on Arch only, use Debian's libtinfo5_6.0 to satisfy clang
+      explain the 0x0f0f[..]0f0f powLimit constant for regtest
+      remove superfluous space at end of native_packages line
+      gtests ordering: change wallet filename in WriteZkeyDirectToDb
+      gtests ordering: ContextualCheckBlockTest's TearDown deactivates Blossom
+      gtests ordering: CheckBlock.VersionTooLow calls SelectParams(MAIN)
+      implement AtomicTimer::zeroize() that resets start_time and total_time
+      gtests ordering: make Metrics.GetLocalSolPS idempotent
+      gtests ordering: clean up wallet files before each WalletZkeysTest
+      make librustzcash_init_zksnark_params idempotent
+      move proof parameter loading out of gtest/main.cpp and into utiltest.cpp
+      Call LoadProofParameters() in gtests that need proofs
+
+Ying Tong Lai (18):
+      Move SendManyRecipient to wallet.h and introduce optional ua field.
+      SendTransaction: Introduce recipients argument.
+      Implement read and write for (txid, recipient) -> ua mapping.
+      z_sendmany: Only get ua if decoded is ua variant.
+      ShieldToAddress: Factor out static shieldToAddress() helper.
+      Docfixes.
+      CSerializeRecipientAddress: add Read method and make constructor private.
+      WriteRecipientMapping: Check that receiver exists in UA.
+      wallet_sendmany_any_taddr.py: Test sending from a change taddr.
+      wallet_sendmany_any_taddr.py: Test sending output from expired tx.
+      FindSpendableInputs: Add nDepth < 0 check.
+      wallet_sendmany_any_taddr.py: Expect expired tx to be ignored.
+      Orchard: invalidate mempool transactions that use orphaned anchors.
+      coins_tests.cpp: Add Orchard nullifier to TxWithNullifiers().
+      coins_tests: Update tests to include Orchard case.
+      CWallet::GetConflictS: Handle conflicting Orchard spends.
+      z_getbalance: Handle Unified Address case.
+      Adapt RPC tests to use z_getbalance for UAs.
+
+ying tong (2):
+      Apply docfixes from code review
+      Style improvements in RPC tests.
+
+Zancas Wilcox (4):
+      blake2b/s is integrated into hashlib, drop external python package dependency
+      update doctest in gtest suite to prefer hashlib
+      enforce usage of the get_tests comptool interface as ComparisonTestFramework method
+      All implementations of ComparisonTestFramework were overriding num_nodes
+
diff --git a/depend/zcash/doc/release-notes/release-notes-4.7.0.md b/depend/zcash/doc/release-notes/release-notes-4.7.0.md
new file mode 100644
index 000000000..cd8da43c8
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-4.7.0.md
@@ -0,0 +1,869 @@
+Notable changes
+===============
+
+Changes to Testnet NU5 Consensus Rules
+--------------------------------------
+
+NOTE: All testnet nodes that have been running on testnet above height 1,599,200 will need
+to upgrade to `v4.7.0` and then run with `-reindex` and `-rescan`.
+
+- In order to better support hardware wallets, transparent signature hash construction as
+  defined in [ZIP 244](https://zips.z.cash/zip-0244) has been modified to include a hash
+  of the serialization of the amounts of all outputs being spent, along with a hash of all
+  spent outputs `scriptPubKeys` values, except in the case that the `ANYONECANPAY` flag is
+  set. This allows hardware wallet devices to verify the UTXO amounts without having to
+  stream all the previous transactions containing the outputs being spent to the device.
+  Also as part of these changes, the transparent signature hash digest now commits
+  directly, rather than implicitly, to the sighash type, and the sighash type is
+  restricted to a fixed set of valid values. The change to ZIP 244 can be seen 
+  [here](https://github.com/zcash/zips/commit/ac9dd97f77869b9191dc9592faa3ebf45475c341).
+- This release fixes a bug in `v4.6.0` that caused a consensus failure on the Zcash
+  testnet at height `1,779,200`. For details see
+  <https://github.com/zcash/zcash/commit/5990853de3e9f04f28b7a4d59ef9e549eb4b4cca>.
+- There have been changes to the Halo2 proving system to improve consistency between the
+  specification and the implementation, and these may break compatibility. See for example
+  <https://github.com/zcash/halo2/commit/247cd620eeb434e7f86dc8579774b30384ae02b2>.
+- There have been numerous changes to the Orchard circuit implementation since `v4.6.0`.
+  See <https://github.com/zcash/orchard/issues?q=label%3AM-consensus-change-since-0.1.0-beta-1>
+  for a complete list.
+- A potential Faerie Gold vulnerability affecting the previous activation of NU5 on
+  testnet and existing since `v4.6.0` has been mitigated.
+
+NU5 Testnet Reactivation
+------------------------
+
+To support the aforementioned testnet consensus changes, the following changes are made in
+`zcashd v4.7.0`:
+
+- The consensus branch ID for NU5 is changed to `0xC2D6D0B4`.
+- The protocol version indicating NU5-aware testnet nodes is set to `170050`.
+- The testnet reactivation height for NU5 is set to **1,842,420**.
+
+As mentioned above, all testnet nodes that have been running on testnet above height
+1,599,200 will need to upgrade to `v4.7.0` and then run with `-reindex` and `-rescan`.
+
+Emergency Recovery Phrases
+--------------------------
+
+The zcashd wallet has been modified to support BIP 39, which describes how to derive the
+wallet's HD seed from a mnemonic phrase, hereafter known as the wallet's "emergency
+recovery phrase". The emergency recovery phrase will be generated on load of the wallet,
+or the first time the wallet is unlocked, and is available via the `z_exportwallet` RPC
+call. All new addresses produced by the wallet are now derived from this seed using the HD
+wallet functionality described in ZIP 32 and ZIP 316. For users upgrading an existing
+Zcashd wallet, it is recommended that the wallet be backed up prior to upgrading to the
+4.7.0 Zcashd release. In the remainder of this document, the HD seed derived from the 
+emergency recovery phrase will be termed the wallet's "mnemonic seed".
+
+Following the upgrade to 4.7.0, Zcashd will require that the user confirm that they have
+backed up their new emergency recovery phrase, which may be obtained from the output of
+the `z_exportwallet` RPC call. This confirmation can be performed manually using the
+`zcashd-wallet-tool` utility that is supplied with this release (built or installed in the
+same directory as `zcashd`).  The wallet will not allow the generation of new addresses
+until this confirmation has been performed. It is recommended that after this upgrade,
+funds tied to preexisting addresses be migrated to newly generated addresses so that all
+wallet funds are recoverable using the emergency recovery phrase going forward. If you
+choose not to migrate funds in this fashion, you will continue to need to securely back up
+the entire `wallet.dat` file to ensure that you do not lose access to existing funds;
+EXISTING FUNDS WILL NOT BE RECOVERABLE USING THE EMERGENCY RECOVERY PHRASE UNLESS THEY
+HAVE BEEN MOVED TO A NEWLY GENERATED ADDRESS FOLLOWING THE 4.7.0 UPGRADE.
+
+In the case that your wallet previously contained a Sapling HD seed, the emergency
+recovery phrase is constructed using the bytes of that seed, such that it is possible to
+reconstruct keys generated using that legacy seed if you know the emergency recovery
+phrase. HOWEVER, THIS RECONSTRUCTION DOES NOT FOLLOW THE NORMAL PROCESS OF DERIVATION FROM
+THE EMERGENCY RECOVERY PHRASE. Instead, to recover a legacy Sapling key from the emergency
+recovery phrase, it is necessary to reconstruct the bytes of the legacy seed by conversion
+of the phrase back to its source randomness instead of by hashing as is specified in BIP
+39. Only keys and addresses produced after the upgrade can be obtained by normal
+derivation of a ZIP 32 or BIP 32 master seed using BIP 39.
+
+Wallet Updates
+--------------
+
+The zcashd wallet now supports the Orchard shielded protocol.
+
+The zcashd wallet has been modified to alter the way that change is handled. In the case
+that funds are being spent from a unified account, change is sent to a wallet-internal
+change address for that account instead of sending change amounts back to the original
+address where a note being spent was received.  The rationale for this change is that it
+improves the security that is provided to the user of the wallet when supplying incoming
+viewing keys to third parties; previously, an incoming viewing key could effectively be
+used to detect when a note was spent (hence violating the "incoming" restriction) by
+observing change outputs that were sent back to the address where the spent note was
+originally received.
+
+New RPC Methods
+---------------
+
+- `walletconfirmbackup` This newly created API checks a provided emergency recovery phrase 
+  against the wallet's emergency recovery phrase; if the phrases match then it updates the
+  wallet state to allow the generation of new addresses.  This backup confirmation
+  workflow can be disabled by starting zcashd with `-walletrequirebackup=false` but this
+  is not recommended unless you know what you're doing (and have otherwise backed up the
+  wallet's emergency recovery phrase anyway).  For security reasons, this RPC method is
+  not intended for use via `zcash-cli` but is provided to enable `zcashd-wallet-tool` and
+  other third-party wallet interfaces to satisfy the backup confirmation requirement. Use
+  of the `walletconfirmbackup` API via `zcash-cli` would risk that the emergency recovery
+  phrase being confirmed might be leaked via the user's shell history or the system
+  process table; `zcashd-wallet-tool` is provided specifically to avoid this problem.
+- `z_getnewaccount` This API allows for creation of new BIP 44 / ZIP 32 accounts using HD
+  derivation from the wallet's mnemonic seed. Each account represents a separate spending
+  authority and source of funds. A single account may contain funds in the Sapling and
+  Orchard shielded pools, as well as funds held in transparent addresses.
+- `z_listaccounts` This API returns the list of BIP 44 / ZIP 32 accounts that are being
+  tracked by the wallet.
+- `z_getaddressforaccount` This API allows for creation of diversified unified addresses 
+  under a single account. Each call to this API will, by default, create a new diversified
+  unified address containing transparent p2pkh, Sapling, and Orchard receivers. Additional
+  arguments to this API may be provided to request the address to be created with a
+  user-specified set of receiver types and diversifier index.
+- `z_getbalanceforaccount` This API makes it possible to obtain balance information on a 
+  per-account basis.
+- `z_getbalanceforviewingkey` This API allows a user to obtain balance
+  information for funds visible to a Sapling or Unified full viewing key; if a Sprout
+  viewing key is provided, this method allows retrieval of the balance only in the case
+  that the wallet controls the corresponding spending key.  This API has been added to
+  supplement (and largely supplant) `z_getbalance`. Querying for balance by a single
+  address returns only the amount received by that address, and omits value sent to other
+  diversified addresses derived from the same full viewing key; by using
+  `z_getbalanceforviewingkey` it is possible to obtain a correct balance that includes all
+  amounts controlled by a single spending key, including both those sent to external
+  diversified addresses and to wallet-internal change addresses.
+- `z_listunifiedreceivers` This API allows the caller to extract the individual component
+  receivers from a unified address. This is useful if one needs to provide a bare Sapling
+  or transparent p2pkh address to a service that does not yet support unified addresses.
+
+RPC Changes
+-----------
+
+- The result type for the `listaddresses` endpoint has been modified:
+  - The `keypool` source type has been removed; it was reserved but not used.
+  - In the `sapling` address results, the `zip32AccountId` attribute has been removed in
+    favor of `zip32KeyPath`. This is to allow distinct key paths to be reported for
+    addresses derived from the legacy account under different child spending authorities,
+    as are produced by `z_getnewaddress`.
+  - Addresses derived from the wallet's mnemonic seed are now included in
+    `listaddresses` output.
+- The results of the `dumpwallet` and `z_exportwallet` RPC methods have been modified
+  to now include the wallet's newly generated emergency recovery phrase as part of the
+  exported data. Also, the seed fingerprint and HD keypath information are now included in
+  the output of these methods for all HD-derived keys.
+- The results of the `getwalletinfo` RPC have been modified to return two new fields:
+  `mnemonic_seedfp` and `legacy_seedfp`, the latter of which replaces the field that
+  was previously named `seedfp`.
+- A new `pool` attribute has been added to each element returned by `z_listunspent` to
+  indicate which value pool the unspent note controls funds in.
+- `z_listreceivedbyaddress` 
+  - A `pool` attribute has been added to each result to indicate what pool the received
+    funds are held in. 
+  - A boolean-valued `change` attribute has been added to indicate whether the output is
+    change.
+  - Block metadata attributes `blockheight`, `blockindex`, and `blocktime` have been
+    added to the result.
+- `z_viewtransaction` has been updated to include attributes that provide information
+  about Orchard components of the transaction. Also, the `type` attribute for spend and
+  output values has been deprecated and replaced by the `pool` attribute.
+- `z_getnotescount` now also returns information for Orchard notes.
+- The output format of `z_exportwallet` has been changed. The exported file now includes
+  the mnemonic seed for the wallet, and HD keypaths are now exported for transparent
+  addresses when available.
+- The result value for `z_importviewingkey` now includes an `address_type` field that
+  replaces the now-deprecated `type` key.
+- `z_listunspent` has been updated to render unified addresses for Sapling and 
+  Orchard outputs when those outputs are controlled by unified spending keys.  Outputs
+  received by unified internal addresses do not include the `address` field.
+- Legacy transparent address generation using `getnewaddress` no longer uses a
+  preallocated keypool, but instead performs HD derivation from the wallet's mnemonic seed
+  according to BIP 39 and BIP 44 under account ID `0x7FFFFFFF`.
+- `z_gettreestate` has been updated to include information about the Orchard note
+  commitment tree.
+
+### 'z_sendmany'
+
+- The `z_sendmany` RPC call no longer permits Sprout recipients in the list of recipient
+  addresses. Transactions spending Sprout funds will still result in change being sent
+  back into the Sprout pool, but no other `Sprout->Sprout` transactions will be
+  constructed by the Zcashd wallet.
+- The restriction that prohibited `Sprout->Sapling` transactions has been lifted; however, 
+  since such transactions reveal the amount crossing pool boundaries, they must be
+  explicitly enabled via a parameter to the `z_sendmany` call.
+- A new string parameter, `privacyPolicy`, has been added to the list of arguments
+  accepted by `z_sendmany`. This parameter enables the caller to control what kind of
+  information they permit `zcashd` to reveal on-chain when creating the transaction. If the
+  transaction can only be created by revealing more information than the given strategy
+  permits, `z_sendmany` will return an error. The parameter defaults to `LegacyCompat`,
+  which applies the most restrictive strategy `FullPrivacy` when a Unified Address is
+  present as the sender or a recipient, and otherwise preserves existing behaviour (which
+  corresponds to the `AllowFullyTransparent` policy). In cases where it is possible to do
+  so without revealing additional information, and where it is permitted by the privacy
+  policy, the wallet will now opportunistically shield funds to the most current pool.
+- Since Sprout outputs are no longer created (with the exception of change)
+  `z_sendmany` no longer generates payment disclosures (which were only available for
+  Sprout outputs) when the `-paymentdisclosure` experimental feature flag is set.
+- Outgoing viewing keys used for shielded outputs are now produced as 
+  described in [ZIP 316](https://zips.z.cash/zip-0316#usage-of-outgoing-viewing-keys)
+- When sending from or to one or more unified addresses, change outputs
+  are now always sent to addresses controlled by the wallet's internal spending keys, as
+  described in [ZIP 316](https://zips.z.cash/zip-0316#deriving-internal-keys).  These
+  addresses are not returned by any RPC API, as they are intended to never be shared with
+  any third party, and are for wallet-internal use only. This change improves the privacy
+  properties that may be maintained when sharing a unified internal viewing key for an
+  account in the wallet.
+- In cases where `z_sendmany` might produce transparent change UTXOs, those UTXOs are
+  sent to addresses derived from the wallet's mnemonic seed via the BIP 44 `change`
+  derivation path.
+
+RPC Deprecations
+----------------
+
+- `z_getnewaddress` has been deprecated in favor of `z_getnewaccount` and
+  `z_getaddressforaccount`.
+- `z_listaddresses` has been deprecated. Use `listaddresses` instead.
+- `z_getbalance` has been deprecated. Use `z_getbalanceforviewingkey` instead.
+  See the discussion of how change is now handled under the `Wallet` heading for
+  additional background.
+- `z_gettotalbalance` has been deprecated. Use `z_getbalanceforaccount` instead.
+- `dumpwallet` has been deprecated. Use `z_exportwallet` instead.
+
+Build System
+------------
+
+- Clang has been updated to use LLVM 13.0.1.
+- libc++ has been updated to use LLVM 13.0.1, except on Windows where it uses 13.0.0-3.
+- The Rust toolchain dependency has been updated to version 1.59.0.
+
+Platform Support
+----------------
+
+- Debian 9 has been removed from the list of supported platforms.
+- Debian 11 (Bullseye) has been added to the list of supported platforms.
+- A build issue (a missing header file) has been fixed for macOS targets.
+- On Arch Linux only, a copy of Debian's libtinfo5_6.0 is used to fix a build
+  regression.
+
+Mining
+------
+
+- Mining to Orchard recipients is now supported on testnet. 
+- It is now possible to mine to a Sapling receiver of a unified address.
+- Concurrency bugs related to `getblocktemplate` have been fixed via backports from
+  Bitcoin Core.
+
+Licenses
+--------
+
+- License information in `contrib/debian/copyright` has been updated to be more accurate.
+
+Changelog
+=========
+
+Alfredo Garcia (3):
+      change error message
+      fix grammar in message
+      remove final dot from error msg
+
+Charlie O'Keefe (2):
+      Update base image used by Dockerfile from debian 10 to debian 11
+      Remove stretch (debian 9), add bullseye (debian 11) in gitian descriptor
+
+Conrado Gouvea (2):
+      Add comment to zcash_script_new_precomputed_tx about references to input buffers
+      Add zcash_script V5 functions
+
+Daira Hopwood (42):
+      Avoid a warning by explicitly calling drop.
+      Replace call to drop with zeroization.
+      contrib/devtools/rust-deps-graph.sh: allow overriding the arguments to `cargo deps`.
+      Cosmetic whitespace change
+      Make a zcashd-wallet-tool executable.
+      Attempt to fix linking problem on ARM.
+      Add some text about choosing location of the physical backup. Add TODO for better handling of file not found and permission errors.
+      Move `wallet_tool.rs` from `src/rust/src` into `src/rust/bin`. Also add a brief description of `zcashd-wallet-tool` to `src/rust/README.md`.
+      Improved error handling.
+      The recovery phrase confirmation and `zcashd-wallet-tool` are being introduced in zcashd v4.7.0.
+      Refactor use of `export_path` as suggested.
+      Tweak the wording of the fallback messages when the terminal cannot be automatically cleared.
+      Simplify extraction of recovery phrase.
+      Improve memory hygiene, and use -stdin to pass the recovery phrase to the child zcash-cli process.
+      Cleanups to error handling for the first invocation of zcash-cli.
+      Use the tracing crate for debugging.
+      Improve error message when the config file cannot be found, taking into account -conf and -datadir.
+      Ensure the buffer used in `prompt` is zeroized even on error.
+      Document that '~' cannot be used in `-datadir` (see #5661).
+      Set `meta` for `-datadir` option.
+      Simplify debug tracing.
+      Correct the fallback instruction for how to clear the terminal on macOS: pressing Command + K also clears scrollback.
+      Include $(bin_SCRIPTS) in `check-symbols`, `check-security`, and `clean` targets. Checking for stack canaries in `check-security` is disabled for Rust executables (Rust does support `-Z stack-protector=all` but only for the nightly compiler).
+      qa/zcash/full_test_suite.py: enable `test_rpath_runpath` for Rust binaries, and reenable `test_fortify_source` for C++ binaries.
+      Tweaks to message text.
+      zcashd-wallet-tool: add man page generation. fixes #5729
+      zcashd-wallet-tool: warn that wallet.dat needs to be backed up. fixes #5704
+      zcashd-wallet-tool: adjust man page to correct copyright information.
+      Start with an empty banlist if -reindex is set. fixes #5739
+      contrib/debian/copyright: add license entries for Libtool macros.
+      contrib/debian/copyright: minor corrections and formatting
+      contrib/debian/copyright: add licenses of Rust dependencies that do not have Expat/MIT as an option.
+      contrib/debian/copyright: add license for Apache-2.0.
+      Switch Jack Grigg's copyright on src/rust/{include/tracing.h, src/tracing_ffi.rs} to the Zcash developers (with his permission).
+      Repair `feature_zip239` RPC test by checking the debug log of node 0 rather than its stderr.
+      qa/zcash/updatecheck.py: print status code and response of failed http requests.
+      Postpone native_clang and libcxx 14.0.0.
+      Fix an incorrect preprocessor symbol. Also repair the lint-includes-guards.sh script that was checking for the incorrect symbol.
+      .gitignore: add files temporarily created by autoconf.
+      This check done for Sprout and Sapling (which is separate from consensus nullifier checks) was not being done for Orchard.
+      AcceptToMemoryPool: Remove initial nullifier checks for Sprout and Sapling (within the mempool only), that are redundant with checks in HaveShieldedRequirements. The latter take into account nullifiers in the chain (using CCoinsViewMemPool::GetNullifier) and include Orchard.
+      Revert "rpc: Reload CNode spans after reloading the log filter". fixes #5863
+
+Dimitris Apostolou (2):
+      Fix typos
+      Fix typos
+
+Jack Grigg (111):
+      wallet: Implement `z_getnewaccount`
+      wallet: Implement `z_getaddressforaccount`
+      wallet: Implement `z_listunifiedreceivers`
+      wallet: Show UAs owned by the wallet in `z_viewtransaction`
+      wallet: Reverse order of arguments to z_getaddressforaccount
+      rust: Add missing Orchard receiver check in UA parsing
+      rust: Add missing checks for shielded UFVK items
+      rust: Add missing checks for transparent UFVK items
+      wallet: Implement `z_getbalanceforaccount`
+      wallet: Fix account generation bug
+      wallet: Implement `z_getbalanceforaddress`
+      wallet: Don't show Sapling receivers from UAs in `z_listaddresses`
+      wallet: Show UAs instead of Sapling receivers in `z_listunspent`
+      wallet: Remove `CWallet::GetKeyFromPool`
+      wallet: Store internal transparent keys in the keypool
+      wallet: Separate counters for external and internal transparent keys
+      Move shielded signature checks out of `ContextualCheckTransaction`
+      Make `PrecomputedTransactionData` a required argument of `SignatureHash`
+      Update ZIP 244 test vectors
+      Add Orchard recipient support to the transaction builder
+      Update ZIP 244 implementation
+      Enforce ZIP 244 consensus rules on sighash type
+      Make `TransactionBuilder::AddOrchardOutput` memo optional
+      Enforce length constraints on allPrevOutputs
+      ZIP 244: Address review comments
+      Return UFVK from `CWallet::GenerateNewUnifiedSpendingKey`
+      Rename to `ZcashdUnifiedSpendingKey::GetSaplingKey` for consistency
+      Trial-decrypt candidate Sapling receivers with all wallet UFVKs
+      Add mappings from Orchard receivers to IVKs to the wallet
+      Add Orchard to default UA receiver types
+      Fix semantic merge conflicts
+      Select Orchard receivers preferentially from UAs
+      Regenerate `TxDigests` after rebuilding tx with Orchard bundle
+      Migrate to `orchard` crate revision with circuit changes
+      qa: Bump all postponed dependencies
+      qa: Postpone recent CCache release
+      depends: Update Rust to 1.59.0
+      depends: Update Clang / libcxx to LLVM 13.0.1
+      cargo update
+      rust: Fix clippy lint
+      Ensure the view's best Orchard anchor matches the previous block
+      Add missing `view.PopAnchor(_, ORCHARD)` in `DisconnectBlock`
+      Add RPC test for the Orchard commitment tree bug on first NU5 testnet
+      Use `std::optional` in `CValidationInterface::GetAddressForMining`
+      Select Orchard receivers from UA miner addresses once NU5 activates
+      miner: Manually add dummy Orchard output with Orchard miner address
+      rpc: Handle keypool exhaustion separately in `generate` RPC
+      libzcash_script: Add more granular errors to the new APIs
+      depends: Revert to `libc++ 13.0.0-3` for Windows cross-compile
+      Add Orchard spend support to the transaction builder
+      wallet: Alter `OrchardWallet::GetSpendInfo` to return the spending key
+      Improve FFI interface documentation
+      Refactor `CWallet::GenerateChangeAddressForAccount`
+      Add unit tests for `SpendableInputs::LimitToAmount`
+      Fix bug in `SpendableInputs::LimitToAmount`
+      Select spendable inputs based on recipient and change pool types
+      Implement opportunistic shielding in `SpendableInputs::LimitToAmount`
+      Add Orchard cases to note selection logic
+      Add Orchard to change address generation
+      Add support for sending Orchard funds in `z_sendmany`
+      Set default Orchard anchor confirmations to 1
+      build: Fix `zcash/address/orchard.hpp` filename in `src/Makefile.am`
+      z_sendmany: Replace `allowRevealedAmount` with `privacyStrategy`
+      z_sendmany: Expand `privacyPolicy` cases
+      build: Add missing `util/match.h` to `src/Makefile.am`
+      wallet: Add seedfp to transparent keys in dumpwallet / z_exportwallet
+      Fix bugs in wallet_addresses RPC test
+      wallet: Fix bugs in `listaddresses`
+      wallet: Fix Sapling address bug in `listaddresses`
+      wallet: Fix expected `listaddresses` sources in `rpc_wallet_tests`
+      qa: Exclude `native_libtinfo` from dependency update checks
+      cargo update
+      make-release.py: Versioning changes for 4.7.0-rc1.
+      make-release.py: Updated manpages for 4.7.0-rc1.
+      make-release.py: Updated release notes and changelog for 4.7.0-rc1.
+      Migrate to latest `zcash/librustzcash` revision
+      Fix logical merge conflicts after merging 4.7.0-rc1
+      builder: Use correct `PrecomputedTransactionData` for transparent sigs
+      Set NU5 protocol version for regtest to 170040, bump protocol version
+      qa: Remove hard-coded consensus branch IDs from RPC tests
+      qa: Remove pinned action indices from wallet_listreceived
+      Test Orchard shielded coinbase rules
+      test: Print all logged errors to stdout during gtests
+      builder: Handle `std::ios_base::failure` exceptions during sighash
+      test: Improve gtest handling of `TransactionBuilderResult::GetTxOrThrow`
+      rust: Improve `PrecomputedTransactionData` construction errors
+      test: Fix `WalletTests.GetConflictedOrchardNotes` gtest
+      qa: Add RPC test testing Orchard note position persistence
+      wallet: Move Orchard note position data into a separate map
+      wallet: Persist Orchard note positions with the witness tree
+      wallet: Add version information to Orchard commitment tree data
+      wallet: Persist Orchard tx height alongside note positions
+      qa: Add test for Orchard support in `z_listunspent`
+      wallet: Treat `mnemonichdchain` records as key material
+      wallet: Initialise ThreadNotifyWallets with wallet's best block
+      Apply `HaveShieldedRequirements` to coinbase transactions
+      mempool: Remove duplicated anchor and nullifier assertions
+      AcceptToMemoryPool: Re-add missing code comment
+      wallet: Rename `CWallet::GetBestBlock` to `GetPersistedBestBlock`
+      Add trace-level logging to the Orchard wallet
+      wallet: Add assertions during Orchard wallet bundle appends
+      wallet: Remove duplicate nullifier insertion into Orchard wallet
+      lint: Add check that every Cargo patch has a matching replacement
+      qa: Postpone update to Rust 1.60
+      wallet: Bump a trace log message to error in `Wallet::checkpoint`
+      rpc: Document that enabling trace-level logging is unsafe
+      test: Capture gtest log output and only print on error
+      qa: Update Berkeley DB release listener regex
+      cargo update
+      depends: Remove `hyper 0.14.2` pin
+      depends: Remove direct `tokio` dependency
+
+John Newbery (1):
+      Log calls to getblocktemplate
+
+Jonas Schnelli (1):
+      [Wallet] add HD xpriv to dumpwallet
+
+Kris Nuttycombe (303):
+      Derive random HD seeds from ZIP-339 seed phrases.
+      Add support for externally searching for valid Sapling diversifiers.
+      Adds basic unified spending key derivation.
+      Add unified full viewing keys and Zcash-internal unified addresses.
+      Use the default UA-based Sapling address for the saplingmigration tool.
+      Fix tests for wallet operations on legacy Sapling keys.
+      Remove unused forward declaration.
+      Update librustzcash dependency version.
+      Apply suggestions from code review
+      Derive transparent keys from mnemonic seed.
+      Generate legacy Sapling addresses from the mnemonic seed.
+      Replace account ID with ZIP-0032 key path in listaddresses output.
+      Use legacy address for Sapling migration until UA functionality is available to the RPC tests.
+      Revert change to the type of GenerateNewKey
+      Fix wallet import/export test
+      Use 0x7FFFFFFF for the legacy account ID.
+      Require backup of the emergency recovery phrase.
+      Use hardened derivation for the legacy Sapling key at the address index level.
+      Address comments from code review.
+      Restore legacy HD seed storage & retrieval tests.
+      Fix spurious test passage.
+      Move CKeyMetadata back to wallet.h
+      Clean up format of recovery information in the wallet dump.
+      Use SecureString for mnemonic phrase.
+      Apply suggestions from code review
+      Fix diversifier_index_t less than operator.
+      Restore FindAddress comment
+      Fix transparent BIP-44 keypaths.
+      Fix naming of unified spending & full viewing keys
+      Fix max transparent diversifier index.
+      Clean up handling of mnemonic seed metadata.
+      Restore legacy HDSeed encryption tests.
+      Style fix in BIP 32 path account parsing test.
+      Do not strip quotes when verifying mnemonic seed.
+      Apply suggestions from code review
+      Fix name of menmonic entropy length constant.
+      Fix polymorphism of string serialization.
+      Document mnemonic-seed-related RPC method changes & update changelog.
+      Minor cleanup of the code that searches for a valid transparent key.
+      Generalize keypath parsing over account id.
+      Update documentation for GenerateNewSeed.
+      Use MnemonicSeed instead of HDSeed where appropriate.
+      Add diversifier_index_t::ToTransparentChildIndex
+      Only maintain CKeyID for the transparent part of ZcashdUnifiedAddress
+      Minor naming fixes
+      Parameterize HD keypath parsing by coin type.
+      Fix error message text to refer to zcashd-wallet-tool rather than the RPC method.
+      Apply suggestions from code review
+      Minor textual fixes to release notes.
+      Improve documentation of the `-walletrequirebackup` zcashd wallet configuration option.
+      Add libzcash::AccountId type.
+      Adds Orchard Address, IncomingViewingKey, FullViewingKey, and SpendingKey types.
+      Apply suggestions from code review
+      Update orchard & librustzcash dependency versions.
+      Remove incorrect FFI method documentation.
+      Remove Orchard spending key equality implementation.
+      Refine structure of Zcash address generation.
+      Use CKeyID and CScriptID instead of new P2PKH/P2SHAddress classes.
+      Remove ZcashdUnifiedAddress in favor of UnifiedAddress
+      Update to ufvk zcash_address build.
+      Adds SaplingDiversifiableFullViewingKey
+      Add Rust FFI components for unified full viewing keys.
+      Add UnifiedFullViewingKey type.
+      Apply suggestions from code review
+      Add tests for ufvk roundtrip serialization.
+      Apply suggestions from code review
+      Apply suggestions from code review
+      Apply suggestions from code review
+      Add functions for generating BIP-44 and ZIP-32 keypaths
+      Check the output of zip339_phrase_to_seed in MnemonicSeed initialization.
+      Compute key id for UFVKs.
+      Add ZcashdUnifiedKeyMetadata and libzcash::ReceiverType
+      Add unified key components to the transparent & Sapling wallet parts.
+      Store ufvks to the wallet database.
+      Add unified address tracking to KeyStore
+      Load unified full viewing keys from the walletdb.
+      Add key metadata to walletdb.
+      Add unified address generation.
+      AddTransparentSecretKey does not need to take a CExtKey
+      Add newly generated transparent UA receivers to the wallet.
+      Add CWallet::GetUnifiedForReceiver
+      Add tests for keystore storage and retrieval of UFVKs.
+      Add test for wallet UA generation & detection.
+      Add test for CKeyStore::AddUnifiedAddress
+      Fix handling of unified full viewing key metadata.
+      Apply suggestions from code review
+      Only derive ZcashdUnifiedFullViewingKey from UnifiedFullViewingKey
+      Rename `ZcashdUnifiedSpendingKeyMetadata` -> `ZcashdUnifiedAccount`
+      Remove unused ufvkid argument from AddTransparentSecretKey
+      Ensure that unified address metadata is always correctly populated.
+      Apply suggestions from code review
+      Make `FindAddress` correctly check for maximum transparent child index.
+      Use Bip44TransparentAccountKeyPath() for Bip44AccountChains keypath construction.
+      Improve documentation of UFVK/UA metadata storage semantics.
+      Apply suggestions from code review
+      Fix encoding order of unified addresses.
+      Remove the `InvalidEncoding` type from key & address variants.
+      Use CKeyID and CScriptID instead of new P2PKH/P2SHAddress classes.
+      Remove spurious uses of HaveSpendingKeyForPaymentAddress
+      Add raw transparent address types to PaymentAddress
+      Remove spurious variant from asyncrpcoperation_sendmany
+      Remove `RawAddress`
+      Replace `DecodeDestination` in `GetMinerAddress` with `DecodePaymentAddress`
+      Remove uses of KeyIO::DecodeDestination
+      Remove a use of KeyIO::DecodeDestination in z_shieldcoinbase
+      Use libzcash::PaymentAddress instead of std::string in mergetoaddress
+      Improve error messages in the case of taddr decoding failure.
+      Apply suggestions from code review
+      Apply suggestions from code review
+      Use transaction builder for asyncrpcoperation_sendmany.
+      Transaction builder must not set consensus branch ID for V4 transactions.
+      Fix conditions around dust thresholds.
+      Require an explicit flag to allow cross-pool transfers in z_sendmany.
+      Apply suggestions from code review
+      Return z_sendmany errors synchronously when possible.
+      Update release notes to reflect z_sendmany changes
+      Move FindSpendableInputs to CWallet
+      Replace the badly-named `PaymentSource` with `ZTXOSelector`
+      Add support for unified addresses to CWallet::ToZTXOSelector
+      Replace `HaveSpendingKeyForAddress` with checks at ZTXOSelector construction.
+      Modify CWallet::FindSpendableInputs to use ZTXOSelector
+      Add CWallet::FindAccountForSelector
+      Add RecipientAddress type.
+      Use libzcash::RecipientAddress for z_sendmany recipients.
+      Apply suggestions from code review
+      Rename ZTXOSelector::SpendingKeysAvailable -> RequireSpendingKeys
+      Make `FindSpendableInputs` respect `ZTXOSelector::RequireSpendingKeys()`
+      Clarify documentation of CWallet::FindAccountForSelector
+      Use `ZTXOSelector::IncludesSapling` rather than selector internals.
+      Add documentation for `UnifiedAddress::GetPreferredRecipientAddress`
+      Add correct selection of change addresses to z_sendmany
+      Add a first-class type for transparent full viewing keys.
+      Implement OVK selection for z_sendmany.
+      Implement derivation of the internal Sapling spending key.
+      Use a BIP 44 change address for change when sending from legacy t-addrs.
+      Add a check for internal vs. external outputs to wallet_listreceived test.
+      Fix z_sendmany handling of transparent OVK derivation in the ANY_TADDR case.
+      Simplify determination of valid change types.
+      Add failing tests for z_sendmany ANY_TADDR -> UA and UA -> <legacy_taddr>
+      Add gtest for change address derivation.
+      Fix variable shadowing in change address derivation & add change IVK to the keystore.
+      GenerateLegacySaplingZKey only needs to return an address, not an extfvk.
+      Rename AddSaplingIncomingViewingKey -> AddSaplingPaymentAddress
+      Do not add Sapling addresses to the wallet by default when adding extfvks.
+      Fix a bug in the generation of addresses from UFVKs
+      Add accessor method for Sapling IVKs to SaplingDiversifiableFullViewingKey
+      Address TODOs in rpc-tests/wallet-accounts.py
+      Add a few additional cases to z_sendmany RPC tests.
+      Update librustzcash dependency.
+      Fix nondeterministic test error (checking for the wrong error case).
+      Use z_shieldcoinbase for Sprout funds in wallet_listreceived tests.
+      Apply suggestions from code review
+      Apply suggestions from code review.
+      Fix nondeterministic test failure in wallet_listreceivedby.py
+      Fix locking in z_getbalanceforaddress and z_getbalanceforaccount
+      Replace z_getbalanceforaddress with z_getbalanceforviewingkey
+      Clarify documentation of z_getbalanceforviewingkey for Sprout viewing keys.
+      Implement PaymentAddressBelongsToWallet for unified addresses.
+      Add unified address support to GetSourceForPaymentAddress
+      Address comments from review.
+      Add change field to z_listreceivedbyaddress for transparent addrs.
+      Fix missing std::variant header that was breaking Darwin builds.
+      Add test vectors for UFVK derivation
+      Rename sapling-specific zip32 FFI methods.
+      Make SaveRecipientMappings polymorphic in RecipientMapping type.
+      Add Rust backend for Orchard components of the wallet.
+      Add GetFilteredNotes to Orchard wallet.
+      Add test for Orchard wallet note detection.
+      Move parsing of unified addresses to UnifiedAddress.
+      Remove txid field from TxNotes
+      Apply suggestions from code review
+      Add various bits of documentation
+      Add Orchard components to unified address
+      Add Orchard components to unified full viewing keys
+      Add Orchard components to unified spending keys
+      Remove OrchardSpendingKey serialization code
+      Select Orchard notes in FindSpendableInputs
+      GenerateNewKey must be guarded by a cs_wallet lock
+      Filter returned Orchard notes by minimum confirmations.
+      Log outpoint for failed Sapling witness lookup.
+      Add a roundtrip test for Orchard merkle frontier serialization from the C++ side.
+      Add test for Orchard contribution to z_gettotalbalance
+      Respect minDepth argument for Orchard notes in GetFilteredNotes
+      Update MSRV for lints.
+      Update incrementalmerkletree version
+      Split LoadWalletTx from AddToWallet
+      Fix missing locks for GenerateNewUnifiedSpendingKey tests.
+      Record when notes are detected as being spent in the Orchard wallet.
+      Reset Orchard wallet state when rescanning from below NU5 activation.
+      Check wallet latest anchor against hashFinalOrchardRoot in ChainTip.
+      Remove assertions that require Orchard wallet persistence to satisfy.
+      Add a test for Orchard note detection.
+      Assert we never attempt to checkpoint the Orchard wallet at a negative block height.
+      Apply suggestions from code review
+      Add an `InPoint` type to the Orchard wallet to fix incorrect conflict data.
+      Apply suggestions from code review
+      Fix missing update to `last_checkpoint` on rewind.
+      Track mined-ness instead of spent-ness of notes in the Orchard wallet.
+      Apply suggestions from code review
+      Respect maxDepth for Orchard notes in GetFilteredNotes
+      Set number of confirmations for Orchard notes returned by FindSpendableInputs
+      Update walletTx with decrypted Orchard action metadata.
+      Persist Orchard action index/IVK mappings in CWalletTx
+      Restore decrypted notes to the wallet.
+      Update tests with rollback checks.
+      Apply suggestions from code review
+      Restore mined block heights when restoring decrypted notes.
+      Apply suggestions from code review
+      Return std::optional<CExtKey> from CExtKey::Master
+      Ensure that Orchard spentness information is repopulated by LoadUnifiedCaches.
+      Modify `join_network` in tests to skip mempool resync.
+      Address suggestions from code review on #5637
+      Apply suggestions from code review
+      Serialize the Orchard note commitment tree to the wallet.
+      Update orchard_wallet_add_notes_from_bundle documentation.
+      Derive the new mnemonic seed from the legacy HD seed, if one is available.
+      Fix indentation.
+      Apply suggestions from code review
+      Explicitly specify the change address in the Sapling migration.
+      Add TODO for Orchard z_listunspent integration.
+      Document that z_getnewaccount and z_getaddressforaccount replace z_getnewaddress.
+      Add orchard support to z_getnotescount
+      Document that Orchard keys are not supported in z_importkey help
+      Return the correct error for `z_getbalance` if a UA does not correspond to an account in the wallet..
+      Update documentation of z_importviewingkey and z_exportviewingkey to address unified keys.
+      Add UnifiedAddress variant to ZTXOSelector
+      Eliminate redundancy between the wallet and the keystore.
+      Simplify retrieval of unified account by address.
+      Add OrchardWallet::GetTxActions
+      Apply suggestions from code review
+      Update z_viewtransaction documentation to correctly represent field names.
+      Add debug printing for receivers and recipient addresses.
+      Correctly report change outputs in z_viewtransaction.
+      Return the default unified address if we have the UFVK but no address metadata.
+      Fix missing AllowRevealedSenders flag in test.
+      Uncomment addtional tests that depend on z_viewtransaction.
+      Minor rename & documentation improvement.
+      Add RecipientType to GetPaymentAddressForRecipient result.
+      Make CWallet::DefaultReceiverTypes height-dependent.
+      Return failure rather than asserting on WriteRecipientMapping failure.
+      Lock cs_main for accesses to chainActive in GetPaymentAddressForRecipient.
+      Fix legacy address handling in CWallet::GetPaymentAddressForRecipient
+      Documentation fix for UnifiedAddressForReciever (+ spelling corrections.)
+      Restore legacy default Sapling addresses to the keystore.
+      Assert that pindexStart cannot be null in CWallet::ScanForWalletTransactions
+      Rename unifiedaddress->address in z_getaddressforaccount results
+      Add undocumented components to getinfo API.
+      Improve consistency of RPC parameter and result attribute naming.
+      Correctly return p2pkh/p2sh labels for z_listunifiedreceivers
+      Add test for rollback of an Orchard spend.
+      Add missing filter to ensure only fully-transparent transactions end up in mapOrphans.
+      Apply suggestions from code review
+      Improve error message for when a UA is only usable after a future NU.
+      Improve error logging in walletdb.cpp
+      Add an RPC test that attempts a double-spend.
+      Fix overzealous matching of Orchard FVKs to addresses.
+      Guard against invalid coercion of int to u32 in FindSpendableInputs
+      Apply suggestions from code review
+      Ensure that legacy imported addresses are properly restored to the wallet.
+      Add a test verifying the default addr is added when importing a Sapling key.
+      Update release notes to include all RPC changes since 4.6.0
+      Note that Debian 9 has been removed from the list of supported platforms.
+      Add independent wallet persistence tests.
+      Apply suggestions from code review
+      Add Orchard support to z_listunspent.
+      Update incrementalmerkletree version to fix GC bug & use updated API.
+      Add account ID to z_listunspent results.
+      Add a test demonstrating that z_listaddresses reveals internal addrs.
+      Do not display internal addresses in z_listaddresses.
+      Adds a test demonstrating an Orchard wallet initialization bug.
+      Refactor ChainTip to take a struct of Merkle trees instead of a pair.
+      Fix a bug in initialization of the Orchard wallet after NU5 activation.
+      Improve error output from OrchardWallet::get_spend_info
+      Update test to verify rewind behavior.
+      Omit check of Orchard commitment root after rewind past first checkpoint.
+      Only check nWitnessCacheSize on rewind if we've ever witnessed a Sprout or Sapling note.
+      Add a test demonstrating that change may cross the pool boundary without permission.
+      Add logging to the miner to provide more detail on tx selection.
+      Check privacy strategy when setting allowed change types.
+      Update to orchard-0.1.0-beta.3, incrementalmerkletree 0.3.0-beta.2, secp256k1-0.21
+      Make all privacy policy checks after note selection.
+      Add 'AllowRevealedAmounts' in tests where it is now necessary.
+      Return MAX_PRIORITY when transactions contain an Orchard bundle.
+      Use DEFAULT_FEE consistently in wallet_unified_change test
+      Never consider transactions that pay the default fee to be free.
+      Fix assertion in wallet initialization when wallet best block is ahead of the main chain.
+      Apply suggestions from code review
+      Apply suggestions from code review
+      Fix error in z_listaccounts help text.
+      Ensure pindexPrev is not null before mining against it.
+      Make Orchard `finalState` serialization format match Sapling.
+      Fix missing null initialization of `pindexLastTip` pointer in ThreadStartWalletNotifier
+      Fix uninitialized sleep variable.
+      Don't advance the wallet init timer until past reindex.
+      Defensively check for a null pindex in `FindFork`
+      Set NU5 testnet reactivation height.
+      Update protocol version to 170050 for v4.7.0 release.
+      Update the release notes to describe consensus changes since v4.6.0
+      Apply suggestions from code review
+      Push back NU5 testnet release height to 1842420
+      qa: postpone native_clang, libcxx, boost, and native_b2 upgrades before 4.7.0 release
+      make-release.py: Versioning changes for 4.7.0.
+      make-release.py: Updated manpages for 4.7.0.
+
+Larry Ruane (13):
+      add ParseArbitraryInt() for diversifier index
+      add -orchardwallet experimental feature flag
+      Add new and modify existing Orchard RPCs, non-functional
+      mining: submitblock: log detailed equihash solution error
+      allow UA as z_shieldcoinbase destination
+      fix minconf parsing for z_getbalanceforaccount and z_getbalanceforaddress
+      Update z_listreceivedbyaddress to support unified addresses (5467)
+      fix wallet_listreceived.py, add blockdata to taddr output
+      z_listreceivedbyaddress: reject UA component addr (#5537)
+      add functional test
+      document global variables
+      update listaddresses RPC for UAs, Orchard
+      Add regtest documentation to book
+
+Marius Kjærstad (1):
+      Update copyright year to 2022
+
+Marshall Gaucher (1):
+      Update Dockerfile
+
+Pieter Wuille (2):
+      Fix csBestBlock/cvBlockChange waiting in rpc/mining
+      Modernize best block mutex/cv/hash variable naming
+
+Sean Bowe (12):
+      wallet: consolidate unified key/address/account map reconstruction
+      wallet: restore Orchard secret keys from mnemonic seed
+      wallet: restore orchard address to IVK mappings during wallet loading
+      wallet: rather than assert, error in case of inconsistency between FVK and address
+      wallet: add logging for failure cases in unified cache loading
+      AddBogusOrchardSpends
+      Add test that checks if a bundle containing duplicate Orchard nullifiers is rejected.
+      Hardcode transaction data for DuplicateOrchardNullifier test.
+      Revert "AddBogusOrchardSpends"
+      Activate NU5 at start of DuplicateOrchardNullifier test.
+      Rename constant in include file to avoid conflicts with btest
+      Fix logic for deciding whether to perform Orchard updates during rescan
+
+Steven Smith (9):
+      Lock cs_main prior to calling blockToJSON
+      Mark z_gettotalbalance and dumpwallet as deprecated
+      Add Orchard support to the z_gettreestate RPC
+      Update transaction size estimation to include V5 transactions
+      Extend uniqueness check in z_sendmany to UA receivers
+      Load previously persisted sent transaction recipient metadata back into the wallet.
+      Add Orchard & unified address support to z_viewtransaction.
+      Ensure z_viewtransaction returns Orchard details
+      Remove the fExperimentalOrchardWallet flag and related logic
+
+Taylor Hornby (2):
+      Untested, not working yet, use libtinfo from the debian packages
+      Only send exceptions to the log, not stderr
+
+sasha (21):
+      on Arch only, use Debian's libtinfo5_6.0 to satisfy clang
+      explain the 0x0f0f[..]0f0f powLimit constant for regtest
+      remove superfluous space at end of native_packages line
+      gtests ordering: change wallet filename in WriteZkeyDirectToDb
+      gtests ordering: ContextualCheckBlockTest's TearDown deactivates Blossom
+      gtests ordering: CheckBlock.VersionTooLow calls SelectParams(MAIN)
+      implement AtomicTimer::zeroize() that resets start_time and total_time
+      gtests ordering: make Metrics.GetLocalSolPS idempotent
+      gtests ordering: clean up wallet files before each WalletZkeysTest
+      make librustzcash_init_zksnark_params idempotent
+      move proof parameter loading out of gtest/main.cpp and into utiltest.cpp
+      Call LoadProofParameters() in gtests that need proofs
+      Add missing wallet/orchard.h to src/Makefile.am
+      Add missing gtest/test_transaction_builder.h to Makefile.gtest.include
+      Prevent a pindex == NULL case in the ScanForWalletTransactions traversal
+      Disallow testnet peers with a protocol version older than 170040
+      Fix test_wallet_zkeys failures by increasing diversifier search offset
+      Fix sporadic failures in StoreAndRetrieveMnemonicSeedInEncryptedStore
+      Fix the exception message for SetSeedFromMnemonic failure
+      add walletrequirebackup=false to the zcash argument list in smoke_tests.py
+      fix smoke_tests.py accounting math to remove the warning before test 4r
+
+Jack Grigg (1):
+      Apply suggestions from code review
+
+Ying Tong Lai (31):
+      Move SendManyRecipient to wallet.h and introduce optional ua field.
+      SendTransaction: Introduce recipients argument.
+      Implement read and write for (txid, recipient) -> ua mapping.
+      z_sendmany: Only get ua if decoded is ua variant.
+      ShieldToAddress: Factor out static shieldToAddress() helper.
+      Docfixes.
+      CSerializeRecipientAddress: add Read method and make constructor private.
+      WriteRecipientMapping: Check that receiver exists in UA.
+      wallet_sendmany_any_taddr.py: Test sending from a change taddr.
+      wallet_sendmany_any_taddr.py: Test sending output from expired tx.
+      FindSpendableInputs: Add nDepth < 0 check.
+      wallet_sendmany_any_taddr.py: Expect expired tx to be ignored.
+      Orchard: invalidate mempool transactions that use orphaned anchors.
+      coins_tests.cpp: Add Orchard nullifier to TxWithNullifiers().
+      coins_tests: Update tests to include Orchard case.
+      CWallet::GetConflictS: Handle conflicting Orchard spends.
+      z_getbalance: Handle Unified Address case.
+      Adapt RPC tests to use z_getbalance for UAs.
+      test_wallet: Test GetConflictedOrchardNotes.
+      Fix GetConflictedOrchardNotes test.
+      Introduce OrchardWallet::GetPotentialSpendsFromNullifier method.
+      Update FFI to use scoped APIs for viewing keys and addresses
+      Introduce CWallet::HaveOrchardSpendingKeyForAddress.
+      Introduce push_orchard_result in z_listreceivedbyaddress.
+      IsNoteSaplingChange: Inline internal recipient check.
+      Correctly derive UAs for unknown Orchard receivers.
+      Add z_listaccounts RPC.
+      Inline z_listaccounts check in wallet_accounts.py
+      Use height of latest network upgrade in -mineraddress validation.
+      Fix >= bound when iterating over network upgrades.
+      Check for overflow in IncrementAccountCounter().
+
+ying tong (3):
+      Apply docfixes from code review
+      Style improvements in RPC tests.
+      orchard_wallet_get_potential_spends: Do not use uint256 type.
+
+Zancas Wilcox (4):
+      blake2b/s is integrated into hashlib, drop external python package dependency
+      update doctest in gtest suite to prefer hashlib
+      enforce usage of the get_tests comptool interface as ComparisonTestFramework method
+      All implementations of ComparisonTestFramework were overriding num_nodes
+
diff --git a/depend/zcash/doc/release-notes/release-notes-5.0.0-rc1.md b/depend/zcash/doc/release-notes/release-notes-5.0.0-rc1.md
new file mode 100644
index 000000000..df92993b5
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-5.0.0-rc1.md
@@ -0,0 +1,215 @@
+Notable changes
+===============
+
+Feature Deprecation and removal
+-------------------------------
+
+`zcashd` now has a [process](https://zcash.github.io/zcash/user/deprecation.html)
+for how features of the public API may be deprecated and removed. Feature
+deprecation follows a series of steps whereby, over a series of releases,
+features first remain enabled by default (but may be explicitly disabled), then
+switch to being disabled by default, and eventually are removed entirely.
+
+A new string-valued option, `-allowdeprecated` has been introduced to allow a
+user to explicitly manage the availability of deprecated `zcashd` features.  This
+flag makes it possible for users to reenable deprecated methods and features
+api that are currently disabled by default, or alternately to explicitly
+disable all deprecated features if they so choose. Multiple instances of this
+argument may be provided. A user may disable deprecated features entirely
+by providing the string `none` as the argument to this parameter. In the case
+that `none` is specified, multiple invocations of `-allowdeprecated` are not
+permitted.
+
+Deprecated
+----------
+
+As of this release, the following features are deprecated, but remain 
+available by default. These features may be disabled by setting 
+`-allowdeprecated=none`. After release 5.3.0, these features will be
+disabled by default and the following flags to `-allowdeprecated` will
+be required to permit their continued use:
+
+  - `legacy_privacy` - the default "legacy" privacy policy for z_sendmany
+    is deprecated. When disabled, the default behavior of z_sendmany will
+    conform to the `FullPrivacy` directive (introduced in 4.7.0) in all cases
+    instead of just for transactions involving unified addresses.
+  - `getnewaddress` - controls availability of the `getnewaddress` RPC method.
+  - `z_getnewaddress` - controls availability of the `z_getnewaddress` RPC method.
+  - `addrtype` - controls availability of the deprecated `type` attribute
+    returned by RPC methods that return address metadata. 
+
+As of this release, the following previously deprecated features are disabled
+by default, but may be be reenabled using `-allowdeprecated=<feature>`.
+
+  - The `zcrawreceive` RPC method is disabled. It may be reenabled with
+    `allowdeprecated=zcrawreceive`
+  - The `zcrawjoinsplit` RPC method is disabled. It may be reenabled with
+    `allowdeprecated=zcrawjoinsplit`
+  - The `zcrawkeygen` RPC method is disabled. It may be reenabled with
+    `allowdeprecated=zcrawkeygen`
+
+Option handling
+---------------
+
+- The `-reindex` and `-reindex-chainstate` options now imply `-rescan`
+  (provided that the wallet is enabled and pruning is disabled, and unless
+  `-rescan=0` is specified explicitly).
+- A new `-anchorconfirmations` argument has been added to allow the user
+  to specify the number of blocks back from the chain tip that anchors will be
+  selected from when spending notes. By default, anchors will now be selected
+  to have 3 confirmations. Values greater than 100 are not supported.
+- A new `-orchardactionlimit` option has been added to allow the user to
+  override the default maximum of 50 Orchard actions per transaction. 
+  Transactions that contain large numbers of Orchard actions can use 
+  large amounts of memory for proving, so the 50-action default limit is
+  imposed to guard against memory exhaustion. Systems with more than 16G
+  of memory can safely set this parameter to allow 200 actions or more.
+
+RPC Interface
+-------------
+
+- The default `minconf` value for `z_sendmany` is now 10 confirmations instead
+  of 1. If `minconf` and specifies a value less than that provided for
+  `-anchorconfirmations`, it will also override that value as it is not
+  possible to spend notes that are more recent than the anchor. Selecting
+  `minconf` values less than 3 is not recommended, as it allows the transaction
+  to be distinguished from transactions using the default for
+  `-anchorconfirmations`.
+
+RPC Changes
+-----------
+
+- The deprecated `zcrawkeygen`, `zcrawreceive`, and `zcrawjoinsplit` RPC
+  methods are now disabled by default. Use `-allowdeprecated=<feature>`
+  to select individual features if you wish to continue using these APIs.
+
+Build system
+------------
+
+- `zcutil/build.sh` now automatically runs `zcutil/clean.sh` to remove
+  files created by previous builds. We previously recommended to do this
+  manually.
+
+Dependencies
+------------
+
+- The `boost` and `native_b2` dependencies have been updated to version 1.79.0
+
+Tests
+-----
+
+- The environment variable that allows users of the rpc (Python) tests to
+  override the default path to the `zcashd` executable has been changed
+  from `BITCOIND` to `ZCASHD`.
+
+Changelog
+=========
+
+Alex Wied (1):
+      Cargo.toml: Rename hdwallet source
+
+Charlie O'Keefe (1):
+      Use bullseye apt source in Dockerfile to match debian:11 base image
+
+Daira Hopwood (9):
+      Fix to 4.7.0 release notes: testnet nodes that upgrade prior to height 1,842,420 actually still need to run with -reindex and -rescan.
+      zcutil/build.sh: Run zcutil/clean.sh before building. fixes #3625
+      Make `-reindex` and `-reindex-chainstate` imply `-rescan` (provided that the wallet is enabled and pruning is disabled, and unless `-rescan=0` is specified explicitly).
+      zcutil/build-debian-package.sh: copy executable and man page for zcashd-wallet-tool.
+      zcashd-wallet-tool: improve the error message for an invalid logging filter directive.
+      Change the numbering convention for hotfixes to increment the patch number, not the hyphen number. fixes #4364
+      Rename nOrchardAnchorConfirmations -> nAnchorConfirmations
+      Select an anchor and notes that have 10 confirmations.
+      Fix WalletTests.CachedWitnessesEmptyChain for new anchor selection.
+
+Dimitris Apostolou (1):
+      Fix typo
+
+Jack Grigg (3):
+      Update minimum chain work and set NU5 activation block hash for testnet
+      make-release.py: Versioning changes for 5.0.0-rc1.
+      make-release.py: Updated manpages for 5.0.0-rc1.
+
+Kris Nuttycombe (30):
+      Update boost dependencies to version 1.79.0
+      Default to error logging if we can't parse the log filter.
+      Fix boolean initialization in Orchard transaction builder.
+      Use fallible version parsing for tags.
+      Allow deprecated wallet features to be preemptively disabled.
+      Remove zcrawreceive, zcrawjoinsplit, zcrawkeygen from default-allowed deprecated methods.
+      Add deprecation policy to the zcashd book.
+      Use ERROR level logging for fatal errors in main/init
+      Remove `-allowdeprecated=all`
+      Clarify documentation of the deprecation process.
+      Select Orchard anchors at `-orchardanchorconfirmations` depth.
+      Add anchor depth parameter to Get*NoteWitnesses
+      Disallow -anchorconfirmations values > 100
+      Add -anchorconfirmations to the release notes
+      Fix RPC tests that depend upon -anchorconfirmations=1
+      Apply suggestions from code review
+      Gracefully handle Get(Sprout/Sapling)NoteWitnesses failure.
+      Add parity-scale-codec licenses to contrib/debian/copyright
+      Ensure transaction integer fields are zero-initialized.
+      Build releases from a commit hash, rather than a named branch.
+      Apply suggestions from code review
+      Update release process documentation to clarify the use of release stabilization branches.
+      Fix missing handling for imported transparent multisig addresses.
+      Change default anchor depth from 10 confirmations to 3
+      Use default anchor confirmations for minconf in z_mergetoaddress.
+      Add -orchardactionlimit parameter to guard against memory exhaustion.
+      Add -orchardactionlimit help text.
+      Postpone dependency updates prior to v5.0.0-rc1
+      Set RELEASE_TO_DEPRECATION_WEEKS to 2 weeks to provide RC EOS halt.
+      Fix a typo in the release script.
+
+Larry Ruane (2):
+      Allow rpc python tests to be run standalone
+      ThreadStartWalletNotifier: wait until !IBD, rather than !reindex
+
+Marek (2):
+      Document the block time in the `z_gettreestate` RPC response
+      Specify the format and epoch
+
+Steven Smith (2):
+      Add orchard pool metrics
+      Require wallet recovery phrase to be backed up for z_getnewaccount and z_getaddressforaccount
+
+Taylor Hornby (1):
+      Reproduce an assertion failure in the listaddresses RPC
+
+dependabot[bot] (1):
+      Bump actions/checkout from 2 to 3
+
+sasha (28):
+      Move LoadProofParameters to gtest/utils.cpp
+      add tx-orchard-duplicate-nullifiers.h to Makefile.gtest.include
+      Closing #1539 simplifies gtest Makefile.
+      remove JoinSplitTestingSetup from sighash_tests -- it doesn't need it
+      Make a LoadGlobalWallet and UnloadGlobalWallet for gtests
+      Remove proof parameter loading from btests
+      Separate test suite from tests, inspired by upstream's #12926
+      Allow parallel btest runs using make as the parallelization tool.
+      btest parallelization work: tag #if'd out test suites
+      Port btest test_basic_joinsplit_verification to gtest suite Joinsplit
+      Create a new gtest group WalletRPCTests
+      Port btest rpc_z_shieldcoinbase_internals to gtest suite WalletRPCTests
+      Port btest rpc_z_mergetoaddress_internals to gtest suite WalletRPCTests
+      Port btest rpc_z_sendmany_taddr_to_sapling to gtest suite WalletRPCTests
+      Downgrade btest suite coins_test to BasicTestingSetup
+      Make [seed_]insecure_rand available to the gtests
+      Create a new gtest suite CoinsTests
+      Port CCoinsViewTest to gtest suite CoinsTests
+      Port nullifier_regression_test to gtest suite CoinsTests
+      Port anchor_pop_regression_test to gtest suite CoinsTests
+      Port anchor_regression_test to gtest suite CoinsTests
+      Port nullifiers_test to gtest suite CoinsTests
+      Port anchors_flush_test to gtest suite CoinsTests
+      Port anchors_test to gtest suite CoinsTests
+      Update copyright header
+      Update comments in newly-ported gtests to be more consistent with current codebase
+      Tidy up spacing in newly-ported gtests
+      Remove -developersapling since it hasn't been implemented for a long time
+
+teor (1):
+      Fix typo in getaddressbalance RPC help
+
diff --git a/depend/zcash/doc/release-notes/release-notes-5.0.0.md b/depend/zcash/doc/release-notes/release-notes-5.0.0.md
new file mode 100644
index 000000000..50013b592
--- /dev/null
+++ b/depend/zcash/doc/release-notes/release-notes-5.0.0.md
@@ -0,0 +1,253 @@
+Notable changes
+===============
+
+The mainnet activation of the NU5 network upgrade is supported by the 5.0.0
+release, with an activation height of 1687104, which should occur on
+approximately May 31, 2022. Please upgrade to this release, or any subsequent
+release, in order to follow the NU5 network upgrade.
+
+The following ZIPs are being deployed, or have been updated, as part of this upgrade:
+
+* [ZIP 32 : Shielded Hierarchical Deterministic Wallets (updated)](https://zips.z.cash/zip_0032)
+* [ZIP 203: Transaction Expiry (updated)](https://zips.z.cash/zip_0203)
+* [ZIP 209: Prohibit Negative Shielded Chain Value Pool Balances (updated)](https://zips.z.cash/zip_0209)
+* [ZIP 212: Allow Recipient to Derive Ephemeral Secret from Note Plaintext (updated)](https://zips.z.cash/zip_0212)
+* [ZIP 213: Shielded Coinbase (updated)](https://zips.z.cash/zip_0213)
+* [ZIP 216: Require Canonical Jubjub Point Encodings](https://zips.z.cash/zip_0216)
+* [ZIP 221: FlyClient - Consensus-Layer Changes (updated)](https://zips.z.cash/zip_0221)
+* [ZIP 224: Orchard Shielded Protocol](https://zips.z.cash/zip_0224)
+* [ZIP 225: Version 5 Transaction Format](https://zips.z.cash/zip_0225)
+* [ZIP 239: Relay of Version 5 Transactions](https://zips.z.cash/zip_0239)
+* [ZIP 244: Transaction Identifier Non-Malleability](https://zips.z.cash/zip_0244)
+* [ZIP 252: Deployment of the NU5 Network Upgrade](https://zips.z.cash/zip_0252)
+* [ZIP 316: Unified Addresses and Unified Viewing Keys](https://zips.z.cash/zip_0316)
+* [ZIP 401: Addressing Mempool Denial-of-Service (clarified)](https://zips.z.cash/zip_0401)
+
+Feature Deprecation and removal
+-------------------------------
+
+`zcashd` now has a [process](https://zcash.github.io/zcash/user/deprecation.html)
+for how features of the public API may be deprecated and removed. Feature
+deprecation follows a series of steps whereby, over a series of releases,
+features first remain enabled by default (but may be explicitly disabled), then
+switch to being disabled by default, and eventually are removed entirely.
+
+A new string-valued option, `-allowdeprecated` has been introduced to allow a
+user to explicitly manage the availability of deprecated `zcashd` features.  This
+flag makes it possible for users to reenable deprecated methods and features
+api that are currently disabled by default, or alternately to explicitly
+disable all deprecated features if they so choose. Multiple instances of this
+argument may be provided. A user may disable deprecated features entirely
+by providing the string `none` as the argument to this parameter. In the case
+that `none` is specified, multiple invocations of `-allowdeprecated` are not
+permitted.
+
+Deprecated
+----------
+
+As of this release, the following features are deprecated, but remain
+available by default. These features may be disabled by setting
+`-allowdeprecated=none`. After release 5.3.0, these features will be
+disabled by default and the following flags to `-allowdeprecated` will
+be required to permit their continued use:
+
+  - `legacy_privacy` - the default "legacy" privacy policy for z_sendmany
+    is deprecated. When disabled, the default behavior of z_sendmany will
+    conform to the `FullPrivacy` directive (introduced in 4.7.0) in all cases
+    instead of just for transactions involving unified addresses.
+  - `getnewaddress` - controls availability of the `getnewaddress` RPC method.
+  - `getrawchangeaddress` - controls availability of the `getrawchangeaddress` RPC method.
+  - `z_getbalance` - controls availability of the `z_getbalance` RPC method.
+  - `z_gettotalbalance` - controls availability of the `z_gettotalbalance` RPC method.
+  - `z_getnewaddress` - controls availability of the `z_getnewaddress` RPC method.
+  - `z_listaddresses` - controls availability of the `z_listaddresses` RPC method.
+  - `addrtype` - controls availability of the deprecated `type` attribute
+    returned by RPC methods that return address metadata.
+
+As of this release, the following previously deprecated features are disabled
+by default, but may be be reenabled using `-allowdeprecated=<feature>`.
+
+  - The `zcrawreceive` RPC method is disabled. It may be reenabled with
+    `allowdeprecated=zcrawreceive`
+  - The `zcrawjoinsplit` RPC method is disabled. It may be reenabled with
+    `allowdeprecated=zcrawjoinsplit`
+  - The `zcrawkeygen` RPC method is disabled. It may be reenabled with
+    `allowdeprecated=zcrawkeygen`
+
+Option handling
+---------------
+
+- The `-reindex` and `-reindex-chainstate` options now imply `-rescan`
+  (provided that the wallet is enabled and pruning is disabled, and unless
+  `-rescan=0` is specified explicitly).
+- A new `-anchorconfirmations` argument has been added to allow the user
+  to specify the number of blocks back from the chain tip that anchors will be
+  selected from when spending notes. By default, anchors will now be selected
+  to have 3 confirmations. Values greater than 100 are not supported.
+- A new `-orchardactionlimit` option has been added to allow the user to
+  override the default maximum of 50 Orchard actions per transaction.
+  Transactions that contain large numbers of Orchard actions can use
+  large amounts of memory for proving, so the 50-action default limit is
+  imposed to guard against memory exhaustion. Systems with more than 16G
+  of memory can safely set this parameter to allow 200 actions or more.
+
+RPC Interface
+-------------
+
+- The default `minconf` value for `z_sendmany` is now 10 confirmations instead
+  of 1. If `minconf` specifies a value less than that provided for
+  `-anchorconfirmations`, it will also override that value as it is not
+  possible to spend notes that are more recent than the anchor. Selecting
+  `minconf` values less than 3 is not recommended, as it allows the transaction
+  to be distinguished from transactions using the default for
+  `-anchorconfirmations`.
+
+RPC Changes
+-----------
+
+- The deprecated `zcrawkeygen`, `zcrawreceive`, and `zcrawjoinsplit` RPC
+  methods are now disabled by default. Use `-allowdeprecated=<feature>`
+  to select individual features if you wish to continue using these APIs.
+
+Build system
+------------
+
+- `zcutil/build.sh` now automatically runs `zcutil/clean.sh` to remove
+  files created by previous builds. We previously recommended to do this
+  manually.
+
+Dependencies
+------------
+
+- The `boost` and `native_b2` dependencies have been updated to version 1.79.0
+
+Tests
+-----
+
+- The environment variable that allows users of the rpc (Python) tests to
+  override the default path to the `zcashd` executable has been changed
+  from `BITCOIND` to `ZCASHD`.
+
+Changelog
+=========
+
+Alex Wied (1):
+      Cargo.toml: Rename hdwallet source
+
+Charlie O'Keefe (1):
+      Use bullseye apt source in Dockerfile to match debian:11 base image
+
+Daira Hopwood (9):
+      Fix to 4.7.0 release notes: testnet nodes that upgrade prior to height 1,842,420 actually still need to run with -reindex and -rescan.
+      zcutil/build.sh: Run zcutil/clean.sh before building. fixes #3625
+      Make `-reindex` and `-reindex-chainstate` imply `-rescan` (provided that the wallet is enabled and pruning is disabled, and unless `-rescan=0` is specified explicitly).
+      zcutil/build-debian-package.sh: copy executable and man page for zcashd-wallet-tool.
+      zcashd-wallet-tool: improve the error message for an invalid logging filter directive.
+      Change the numbering convention for hotfixes to increment the patch number, not the hyphen number. fixes #4364
+      Rename nOrchardAnchorConfirmations -> nAnchorConfirmations
+      Select an anchor and notes that have 10 confirmations.
+      Fix WalletTests.CachedWitnessesEmptyChain for new anchor selection.
+
+Dimitris Apostolou (1):
+      Fix typo
+
+Jack Grigg (5):
+      Update minimum chain work and set NU5 activation block hash for testnet
+      make-release.py: Versioning changes for 5.0.0-rc1.
+      make-release.py: Updated manpages for 5.0.0-rc1.
+      make-release.py: Updated release notes and changelog for 5.0.0-rc1.
+      Migrate to `zcash_primitives 0.6` et al
+
+Kris Nuttycombe (40):
+      Update boost dependencies to version 1.79.0
+      Default to error logging if we can't parse the log filter.
+      Fix boolean initialization in Orchard transaction builder.
+      Use fallible version parsing for tags.
+      Allow deprecated wallet features to be preemptively disabled.
+      Remove zcrawreceive, zcrawjoinsplit, zcrawkeygen from default-allowed deprecated methods.
+      Add deprecation policy to the zcashd book.
+      Use ERROR level logging for fatal errors in main/init
+      Remove `-allowdeprecated=all`
+      Clarify documentation of the deprecation process.
+      Select Orchard anchors at `-orchardanchorconfirmations` depth.
+      Add anchor depth parameter to Get*NoteWitnesses
+      Disallow -anchorconfirmations values > 100
+      Add -anchorconfirmations to the release notes
+      Fix RPC tests that depend upon -anchorconfirmations=1
+      Add z_get(total)balance to deprecation flags.
+      Apply suggestions from code review
+      Gracefully handle Get(Sprout/Sapling)NoteWitnesses failure.
+      Add parity-scale-codec licenses to contrib/debian/copyright
+      Ensure transaction integer fields are zero-initialized.
+      Build releases from a commit hash, rather than a named branch.
+      Apply suggestions from code review
+      Update release process documentation to clarify the use of release stabilization branches.
+      Fix missing handling for imported transparent multisig addresses.
+      Change default anchor depth from 10 confirmations to 3
+      Use default anchor confirmations for minconf in z_mergetoaddress.
+      Add -orchardactionlimit parameter to guard against memory exhaustion.
+      Add -orchardactionlimit help text.
+      Postpone dependency updates prior to v5.0.0-rc1
+      Set RELEASE_TO_DEPRECATION_WEEKS to 2 weeks to provide RC EOS halt.
+      Fix a typo in the release script.
+      Fix typos in release notes & Orchard wallet internal API doc.
+      Add missing parenthesis to -reindex help.
+      Include getbalance in recommendations for z_getbalance and z_gettotalbalance replacements.
+      Add tests to check auth data commitments committing to Orchard actions.
+      Deprecate `getrawchangeaddress` and `z_listaddresses`
+      Update rpcwallet help to better distinguish transparent-only APIs.
+      Revert "Set RELEASE_TO_DEPRECATION_WEEKS to 2 weeks to provide RC EOS halt."
+      make-release.py: Versioning changes for 5.0.0.
+      make-release.py: Updated manpages for 5.0.0.
+
+Larry Ruane (2):
+      Allow rpc python tests to be run standalone
+      ThreadStartWalletNotifier: wait until !IBD, rather than !reindex
+
+Marek (2):
+      Document the block time in the `z_gettreestate` RPC response
+      Specify the format and epoch
+
+Steven Smith (2):
+      Add orchard pool metrics
+      Require wallet recovery phrase to be backed up for z_getnewaccount and z_getaddressforaccount
+
+Taylor Hornby (1):
+      Reproduce an assertion failure in the listaddresses RPC
+
+dependabot[bot] (1):
+      Bump actions/checkout from 2 to 3
+
+sasha (28):
+      Move LoadProofParameters to gtest/utils.cpp
+      add tx-orchard-duplicate-nullifiers.h to Makefile.gtest.include
+      Closing #1539 simplifies gtest Makefile.
+      remove JoinSplitTestingSetup from sighash_tests -- it doesn't need it
+      Make a LoadGlobalWallet and UnloadGlobalWallet for gtests
+      Remove proof parameter loading from btests
+      Separate test suite from tests, inspired by upstream's #12926
+      Allow parallel btest runs using make as the parallelization tool.
+      btest parallelization work: tag #if'd out test suites
+      Port btest test_basic_joinsplit_verification to gtest suite Joinsplit
+      Create a new gtest group WalletRPCTests
+      Port btest rpc_z_shieldcoinbase_internals to gtest suite WalletRPCTests
+      Port btest rpc_z_mergetoaddress_internals to gtest suite WalletRPCTests
+      Port btest rpc_z_sendmany_taddr_to_sapling to gtest suite WalletRPCTests
+      Downgrade btest suite coins_test to BasicTestingSetup
+      Make [seed_]insecure_rand available to the gtests
+      Create a new gtest suite CoinsTests
+      Port CCoinsViewTest to gtest suite CoinsTests
+      Port nullifier_regression_test to gtest suite CoinsTests
+      Port anchor_pop_regression_test to gtest suite CoinsTests
+      Port anchor_regression_test to gtest suite CoinsTests
+      Port nullifiers_test to gtest suite CoinsTests
+      Port anchors_flush_test to gtest suite CoinsTests
+      Port anchors_test to gtest suite CoinsTests
+      Update copyright header
+      Update comments in newly-ported gtests to be more consistent with current codebase
+      Tidy up spacing in newly-ported gtests
+      Remove -developersapling since it hasn't been implemented for a long time
+
+teor (1):
+      Fix typo in getaddressbalance RPC help
+
diff --git a/depend/zcash/doc/release-process.md b/depend/zcash/doc/release-process.md
new file mode 100644
index 000000000..90506e8ef
--- /dev/null
+++ b/depend/zcash/doc/release-process.md
@@ -0,0 +1,223 @@
+Release Process
+====================
+Meta: There should always be a single release engineer to disambiguate responsibility.
+
+If this is a hotfix release, please see the [Hotfix Release
+Process](https://github.com/zcash/zcash/blob/master/doc/hotfix-process.md) documentation
+before proceeding.
+
+## Pre-release
+
+### Github Milestone
+
+Ensure all goals for the github milestone are met. If not, remove tickets
+or PRs with a comment as to why it is not included. (Running out of time
+is a common reason.)
+
+### Pre-release checklist:
+
+Check that dependencies are properly hosted.
+
+Check that there are no surprising performance regressions.
+
+Update `src/chainparams.cpp` nMinimumChainWork with information from the getblockchaininfo rpc.
+
+Check that dependencies are up-to-date or have been postponed:
+
+```
+$ ./qa/zcash/updatecheck.py
+```
+
+If you are missing the `.updatecheck-token` file required to run this script,
+please ask Taylor or another Zcash developer for a copy, or create an
+unprivileged personal access token for a github account and save it to the
+file in the format `username:hex-token`.
+
+If there are updates that have not been postponed, review their changelogs
+for urgent security fixes, and if there aren't any, postpone the update by
+adding a line to `qa/zcash/postponed-updates.txt`.
+
+### Protocol Safety Checks:
+
+If this release changes the behavior of the protocol or fixes a serious
+bug, verify that a pre-release PR merge updated `PROTOCOL_VERSION` in
+`version.h` correctly.
+
+If this release breaks backwards compatibility or needs to prevent
+interaction with software forked projects, change the network magic
+numbers. Set the four `pchMessageStart` in `CTestNetParams` in
+`chainparams.cpp` to random values.
+
+Both of these should be done in standard PRs ahead of the release
+process. If these were not anticipated correctly, this could block the
+release, so if you suspect this is necessary, double check with the
+whole engineering team.
+
+## Release dependencies
+
+The release script has the following dependencies:
+
+- `help2man`
+- `debchange` (part of the devscripts Debian package)
+
+You can optionally install the `progressbar2` Python module with pip to have a
+progress bar displayed during the build process.
+
+## Versioning
+
+Zcash version identifiers have the format `vX.Y.Z` with the following conventions:
+
+* Increments to the `X` component (the "major version") correspond to network
+  upgrades. A network upgrade occurs only when there is a change to the
+  consensus rules.
+* Increments to the `Y` component (the "minor version") correspond to regular
+  Zcash releases. These occur approximately every 6 weeks and may include breaking
+  changes to public APIs.
+* Increments to the `Z` component occur only in the case of hotfix releases.
+
+## Release candidate & release process
+
+Identify the commit from which the release stabilization branch will be made.
+Release stabilization branches are used so that development can proceed
+unblocked on the `master` branch during the release candidate testing and
+bug-fixing process. By convention, release stabilization branches are named
+`version-X.Y.0` where `X` and `Y` are the major and minor versions for the
+release.
+
+In the commands below, <RELEASE> and <RELEASE_PREV> must identify `git` tags
+prefixed with the character `v`, i.e. `v1.0.9` (not `1.0.9`). <COMMIT_ID> is a
+`git` hash identifying the commit on which a release stabilization or release
+branch will be based. It is recommended to use the entire hash value to
+identify the commit, although a prefix of at least 10 characters is also
+permitted.
+
+### Create the release stabilization branch
+
+Having identified the commit from which the release will be made, the release
+manager constructs the release stabilization branch as follows:
+
+    $ git checkout -b version-X.Y.0 <COMMIT_ID>
+    $ git push 'git@github.com:zcash/zcash' $(git rev-parse --abbrev-ref HEAD)
+
+### Create the release candidate branch
+
+Run the release script to create the first release candidate. This will create
+a branch based upon the specified commit ID, then commit standard automated
+changes to that branch locally:
+
+    $ ./zcutil/make-release.py <COMMIT_ID> <RELEASE> <RELEASE_PREV> <RELEASE_FROM> <APPROX_RELEASE_HEIGHT>
+
+Examples:
+
+    $ ./zcutil/make-release.py 600c4acee1 v1.1.0-rc1 v1.0.0 v1.0.0 280300
+    $ ./zcutil/make-release.py b89b48cda1 v1.1.0 v1.1.0-rc1 v1.0.0 300600
+
+### Create, Review, and Merge the release branch pull request
+
+Review the automated changes in git:
+
+    $ git log version-X.Y.0..HEAD
+
+Push the resulting branch to github:
+
+    $ git push 'git@github.com:$YOUR_GITHUB_NAME/zcash' $(git rev-parse --abbrev-ref HEAD)
+
+Then create the PR on github targeting the `version-X.Y.0` branch. Complete the
+standard review process and wait for CI to complete. 
+
+## Make a tag for the tip of the release candidate branch
+
+NOTE: This has changed from the previously recommended process. The tag should
+be created at the tip of the automatically-generated release branch created by
+the release script; this ensures that any changes made to the release
+stabilization branch since the initiation of the release process are not
+accidentally tagged as being part of the release as a consequence of having
+been included in a merge commit.
+
+Check the last commit on the local and remote versions of the release branch to
+make sure they are the same:
+
+    $ git log -1
+
+If you haven't previously done so, set the gpg key id you intend to use for
+signing:
+
+    git config --global user.signingkey <keyid>
+
+Then create the git tag. The `-s` means the release tag will be signed.  Enter
+"Release <version>." and save when prompted for a commit message.  **CAUTION:**
+Remember the `v` at the beginning here:
+
+    $ git tag -s vX.Y.Z-rcN
+    $ git push origin vX.Y.Z-rcN
+
+## Merge the release candidate branch to the release stabilization branch
+
+Once CI has completed and the release candidate branch has sufficient approving
+reviews, merge the release candidate branch back to the release stabilization
+branch. Testing proceeds as normal. Any changes that need to be made during the
+release candidate period are made by submitting PRs targeting the release 
+stabilization branch.
+
+Subsequent release candidates, and the creation of the final release, follow
+the same process as for release candidates, omitting the `-rcN` suffix for the
+final release. 
+
+## Make and deploy deterministic builds
+
+- Run the [Gitian deterministic build environment](https://github.com/zcash/zcash-gitian)
+- Compare the uploaded [build manifests on gitian.sigs](https://github.com/zcash/gitian.sigs)
+- If all is well, the DevOps engineer will build the Debian packages and update the
+  [apt.z.cash package repository](https://apt.z.cash).
+
+## Add release notes to GitHub
+
+- Go to the [GitHub tags page](https://github.com/zcash/zcash/tags).
+- Click "Add release notes" beside the tag for this release.
+- Copy the release blog post into the release description, and edit to suit
+  publication on GitHub. See previous release notes for examples.
+- Click "Publish release" if publishing the release blog post now, or
+  "Save draft" to store the notes internally (and then return later to publish
+  once the blog post is up).
+
+Note that some GitHub releases are marked as "Verified", and others as
+"Unverified". This is related to the GPG signature on the release tag - in
+particular, GitHub needs the corresponding public key to be uploaded to a
+corresponding GitHub account. If this release is marked as "Unverified", click
+the marking to see what GitHub wants to be done.
+
+## Post Release Task List
+
+### Merge the release stabilization branch
+
+Once the final release branch has merged to the release stabilization branch, a
+new PR should be opened for merging the release stabilization branch into
+master. This may require fixing merge conflicts (e.g. changing the version
+number in the release stabilization branch to match master, if master is
+ahead). Such conflicts **MUST** be addressed with additional commits to the
+release stabilization branch; specifically, the branch **MUST NOT** be rebased
+on master.
+
+Once any conflicts have been resolved, the release stabilization branch should
+be merged back to the `master` branch, and then deleted.
+
+### Deploy testnet
+
+Notify the Zcash DevOps engineer/sysadmin that the release has been tagged. They update
+some variables in the company's automation code and then run an Ansible playbook, which:
+
+* builds Zcash based on the specified branch
+* deploys it as a public service (e.g. testnet.z.cash, mainnet.z.cash)
+* often the same server can be re-used, and the role idempotently handles upgrades, but if
+  not then they also need to update DNS records
+* possible manual steps: blowing away the `testnet3` dir, deleting old parameters,
+  restarting DNS seeder.
+
+Verify that nodes can connect to the mainnet and testnet servers.
+
+Update the [Zcashd Full Node and CLI](https://zcash.readthedocs.io/en/latest/rtd_pages/zcashd.html)
+documentation on ReadTheDocs to give the new version number.
+
+### Publish the release announcement (blog, github, zcash-dev, slack)
+
+## Celebrate
diff --git a/depend/zcash/doc/security-warnings.md b/depend/zcash/doc/security-warnings.md
new file mode 100644
index 000000000..53da5206e
--- /dev/null
+++ b/depend/zcash/doc/security-warnings.md
@@ -0,0 +1,6 @@
+Security Warnings
+====================
+
+This document has been relocated to https://zcash.readthedocs.io/en/latest/rtd_pages/security_warnings.html
+
+The source for this document is available at https://gitlab.com/zcash-docs/zcash-docs/blob/master/source/rtd_pages/security_warnings.rst
\ No newline at end of file
diff --git a/depend/zcash/doc/shield-coinbase.md b/depend/zcash/doc/shield-coinbase.md
new file mode 100644
index 000000000..f023915b0
--- /dev/null
+++ b/depend/zcash/doc/shield-coinbase.md
@@ -0,0 +1,5 @@
+# Shielding Coinbase UTXOs
+
+This document has been relocated to https://zcash.readthedocs.io/en/latest/rtd_pages/shield_coinbase.html
+
+The source for this document is available at https://gitlab.com/zcash-docs/zcash-docs/blob/master/source/rtd_pages/shield_coinbase.rst
\ No newline at end of file
diff --git a/depend/zcash/doc/tor.md b/depend/zcash/doc/tor.md
new file mode 100644
index 000000000..970c6f12f
--- /dev/null
+++ b/depend/zcash/doc/tor.md
@@ -0,0 +1,6 @@
+TOR SUPPORT IN ZCASH
+====================
+
+This document has been relocated to https://zcash.readthedocs.io/en/latest/rtd_pages/tor.html
+
+The source for this document is available at https://gitlab.com/zcash-docs/zcash-docs/blob/master/source/rtd_pages/tor.rst
\ No newline at end of file
diff --git a/depend/zcash/doc/translation_strings_policy.md b/depend/zcash/doc/translation_strings_policy.md
new file mode 100644
index 000000000..c370dba24
--- /dev/null
+++ b/depend/zcash/doc/translation_strings_policy.md
@@ -0,0 +1,71 @@
+*** Warning: This document has not been updated for Zcash and may be inaccurate. ***
+
+Translation Strings Policy
+===========================
+
+This document provides guidelines for internationalization of the Bitcoin Core software.
+
+How to translate?
+------------------
+
+To mark a message as translatable
+
+- In non-GUI source code (under `src`): use `_("...")`
+
+No internationalization is used for e.g. developer scripts outside `src`.
+
+Strings to be translated
+-------------------------
+
+On a high level, these strings are to be translated:
+
+- GUI strings, anything that appears in a dialog or window
+
+- Command-line option documentation
+
+### GUI strings
+
+Anything that appears to the user in the GUI is to be translated. This includes labels, menu items, button texts, tooltips and window titles.
+This includes messages passed to the GUI through the UI interface through `InitMessage`, `ThreadSafeMessageBox` or `ShowProgress`.
+
+### Command-line options
+
+Documentation for the command line options in the output of `--help` should be translated as well.
+
+Make sure that default values do not end up in the string, but use string formatting like `strprintf(_("Threshold for disconnecting misbehaving peers (default: %u)"), 100)`. Putting default values in strings has led to accidental translations in the past, and forces the string to be retranslated every time the value changes.
+
+Do not translate messages that are only shown to developers, such as those that only appear when `--help-debug` is used.
+
+General recommendations
+------------------------
+
+### Avoid unnecessary translation strings
+
+Try not to burden translators with translating messages that are e.g. slight variations of other messages.
+In the GUI, avoid the use of text where an icon or symbol will do.
+Make sure that placeholder texts in forms don't end up in the list of strings to be translated (use `<string notr="true">`).
+
+### Make translated strings understandable
+
+Try to write translation strings in an understandable way, for both the user and the translator. Avoid overly technical or detailed messages
+
+### Do not translate internal errors
+
+Do not translate internal errors, or log messages, or messages that appear on the RPC interface. If an error is to be shown to the user,
+use a generic message, then log the detailed message to the log. E.g. "Error: A fatal internal error occurred, see debug.log for details".
+This helps troubleshooting; if the error is the same for everyone, the likelihood is increased that it can be found using a search engine.
+
+### Avoid fragments
+
+Avoid dividing up a message into fragments. Translators see every string separately, so may misunderstand the context if the messages are not self-contained.
+
+### Avoid HTML in translation strings
+
+There have been difficulties with use of HTML in translation strings; translators should not be able to accidentally affect the formatting of messages.
+This may sometimes be at conflict with the recommendation in the previous section.
+
+### String freezes
+
+During a string freeze (often before a major release), no translation strings are to be added, modified or removed.
+
+This can be checked by executing `make translate` in the `src` directory, then verifying that `bitcoin_en.ts` remains unchanged.
diff --git a/depend/zcash/doc/unit-tests.md b/depend/zcash/doc/unit-tests.md
new file mode 100644
index 000000000..1864240ed
--- /dev/null
+++ b/depend/zcash/doc/unit-tests.md
@@ -0,0 +1,6 @@
+Compiling/running automated tests
+---------------------------------
+
+This document has been relocated to https://zcash.readthedocs.io/en/latest/rtd_pages/development_guidelines.html#testing
+
+The source for this document is available at https://gitlab.com/zcash-docs/zcash-docs/blob/master/source/rtd_pages/development_guidelines.rst
diff --git a/depend/zcash/doc/wallet-backup.md b/depend/zcash/doc/wallet-backup.md
new file mode 100644
index 000000000..e83139cae
--- /dev/null
+++ b/depend/zcash/doc/wallet-backup.md
@@ -0,0 +1,5 @@
+# Wallet Backup Instructions
+
+This document has been relocated to https://zcash.readthedocs.io/en/latest/rtd_pages/wallet_backup.html
+
+The source for this document is available at https://gitlab.com/zcash-docs/zcash-docs/blob/master/source/rtd_pages/wallet_backup.rst
\ No newline at end of file
diff --git a/depend/zcash/doc/zmq.md b/depend/zcash/doc/zmq.md
new file mode 100644
index 000000000..25a649ffe
--- /dev/null
+++ b/depend/zcash/doc/zmq.md
@@ -0,0 +1,122 @@
+# Block and Transaction Broadcasting With ZeroMQ
+
+[ZeroMQ](https://zeromq.org) is a lightweight wrapper around TCP
+connections, inter-process communication, and shared-memory, providing
+various message-oriented semantics such as publish/subscribe,
+request/reply, and push/pull.
+
+The Zcash daemon can be configured to act as a trusted "border
+router", implementing the Zcash wire protocol and relay, making
+consensus decisions, maintaining the local blockchain database,
+broadcasting locally generated transactions into the network, and
+providing a queryable RPC interface to interact on a polled basis for
+requesting blockchain related data. However, there exists only a
+limited service to notify external software of events like the arrival
+of new blocks or transactions.
+
+The ZeroMQ facility implements a notification interface through a set
+of specific notifiers. Currently there are notifiers that publish
+blocks and transactions. This read-only facility requires only the
+connection of a corresponding ZeroMQ subscriber port in receiving
+software; it is not authenticated nor is there any two-way protocol
+involvement. Therefore, subscribers should validate the received data
+since it may be out of date, incomplete or even invalid.
+
+ZeroMQ sockets are self-connecting and self-healing; that is,
+connections made between two endpoints will be automatically restored
+after an outage, and either end may be freely started or stopped in
+any order.
+
+Because ZeroMQ is message oriented, subscribers receive transactions
+and blocks all-at-once and do not need to implement any sort of
+buffering or reassembly.
+
+## Prerequisites
+
+The ZeroMQ feature in Zcash requires the ZeroMQ API >= 4.0.0
+[libzmq](https://github.com/zeromq/libzmq/releases), which you will
+need to install if you are not using the depends system.
+Typically, it is packaged by distributions as something like
+*libzmq5-dev*. The C++ wrapper for ZeroMQ is *not* needed.
+
+In order to run the example Python client scripts in contrib/ one must
+also install *python3-zmq*, though this is not necessary for daemon
+operation.
+
+## Security WARNING
+
+Enabling this feature even on the loopback interface only (e.g. binding
+it to localhost or 127.0.0.1) will still expose it to the wilds of the
+Internet, because of an attack vector called DNS rebinding. DNS
+rebinding allows an attacker located remotely on the Internet to trick
+applications that you're running on the same computer as zcashd to
+contact your supposedly localhost-only ZMQ port, then, depending on the
+program they may be able to attempt to attack it.
+
+Do not enable this feature unless you are sure that you know what you
+are doing, and that you have a strong reason for thinking that you are
+not vulnerable to this type of attack.
+
+## Enabling
+
+By default, the ZeroMQ feature is automatically compiled in if the
+necessary prerequisites are found.  To disable, use --disable-zmq
+during the *configure* step of building zcashd:
+
+    $ ./configure --disable-zmq (other options)
+
+To actually enable operation, one must set the appropriate options on
+the commandline or in the configuration file.
+
+## Usage
+
+Currently, the following notifications are supported:
+
+    -zmqpubhashtx=address
+    -zmqpubhashblock=address
+    -zmqpubrawblock=address
+    -zmqpubrawtx=address
+
+The socket type is PUB and the address must be a valid ZeroMQ socket
+address. The same address can be used in more than one notification.
+
+For instance:
+
+    $ zcashd -zmqpubhashtx=tcp://127.0.0.1:28332 \
+               -zmqpubrawtx=ipc:///tmp/zcashd.tx.raw
+
+Each PUB notification has a topic and body, where the header
+corresponds to the notification type. For instance, for the
+notification `-zmqpubhashtx` the topic is `hashtx` (no null
+terminator) and the body is the hexadecimal transaction hash (32
+bytes).
+
+These options can also be provided in zcash.conf.
+
+ZeroMQ endpoint specifiers for TCP (and others) are documented in the
+[ZeroMQ API](http://api.zeromq.org/4-0:_start).
+
+Client side, then, the ZeroMQ subscriber socket must have the
+ZMQ_SUBSCRIBE option set to one or either of these prefixes (for
+instance, just `hash`); without doing so will result in no messages
+arriving. Please see `contrib/zmq/zmq_sub.py` for a working example.
+
+## Remarks
+
+From the perspective of zcashd, the ZeroMQ socket is write-only; PUB
+sockets don't even have a read function. Thus, there is no state
+introduced into zcashd directly. Furthermore, no information is
+broadcast that wasn't already received from the public P2P network.
+
+No authentication or authorization is done on connecting clients; it
+is assumed that the ZeroMQ port is exposed only to trusted entities,
+using other means such as firewalling.
+
+Note that when the block chain tip changes, a reorganisation may occur
+and just the tip will be notified. It is up to the subscriber to
+retrieve the chain from the last known block to the new tip.
+
+There are several possibilities that ZMQ notification can get lost
+during transmission depending on the communication type you are
+using. zcashd appends an up-counting sequence number to each
+notification which allows listeners to detect lost notifications.
diff --git a/depend/zcash/libzcash_script.pc.in b/depend/zcash/libzcash_script.pc.in
new file mode 100644
index 000000000..bd288484f
--- /dev/null
+++ b/depend/zcash/libzcash_script.pc.in
@@ -0,0 +1,10 @@
+prefix=@prefix@
+exec_prefix=@exec_prefix@
+libdir=@libdir@
+includedir=@includedir@
+
+Name: Zcash transparent script verification library
+Description: Library for verifying scripts against the Zcash consensus protocol.
+Version: @PACKAGE_VERSION@
+Libs: -L${libdir} -lzcash_script
+Cflags: -I${includedir}
diff --git a/depend/zcash/qa/README.md b/depend/zcash/qa/README.md
new file mode 100644
index 000000000..6cca07d2d
--- /dev/null
+++ b/depend/zcash/qa/README.md
@@ -0,0 +1,87 @@
+The [pull-tester](/qa/pull-tester/) folder contains a script to call
+multiple tests from the [rpc-tests](/qa/rpc-tests/) folder.
+
+Every pull request to the zcash repository is built and run through
+the regression test suite. You can also run all or only individual
+tests locally.
+
+Test dependencies
+=================
+Before running the tests, the following must be installed.
+
+Unix
+----
+The python3-zmq library is required. On Ubuntu or Debian it can be installed via:
+```
+sudo apt-get install python3-zmq
+```
+
+OS X
+------
+```
+pip3 install pyzmq
+```
+
+Running tests
+=============
+
+You can run any single test by calling
+
+    qa/pull-tester/rpc-tests.py <testname>
+
+Or you can run any combination of tests by calling
+
+    qa/pull-tester/rpc-tests.py <testname1> <testname2> <testname3> ...
+
+Run the regression test suite with
+
+    qa/pull-tester/rpc-tests.py
+
+Run all possible tests with
+
+    qa/pull-tester/rpc-tests.py --extended
+
+By default, tests will be run in parallel. To specify how many jobs to run,
+append `--jobs=n` (default n=4).
+
+If you want to create a basic coverage report for the RPC test suite, append `--coverage`.
+
+Possible options, which apply to each individual test run:
+
+```
+  -h, --help            show this help message and exit
+  --nocleanup           Leave zcashds and test.* datadir on exit or error
+  --noshutdown          Don't stop zcashds after the test execution
+  --srcdir=SRCDIR       Source directory containing zcashd/zcash-cli
+                        (default: ../../src)
+  --tmpdir=TMPDIR       Root directory for datadirs
+  --tracerpc            Print out all RPC calls as they are made
+  --coveragedir=COVERAGEDIR
+                        Write tested RPC commands into this directory
+```
+
+If you set the environment variable `PYTHON_DEBUG=1` you will get some debug
+output (example: `PYTHON_DEBUG=1 qa/pull-tester/rpc-tests.py wallet`).
+
+A 200-block -regtest blockchain and wallets for four nodes
+is created the first time a regression test is run and
+is stored in the cache/ directory.  Each node has the miner
+subsidy from 25 mature blocks (25*10=250 ZEC) in its wallet.
+
+After the first run, the cache/ blockchain and wallets are
+copied into a temporary directory and used as the initial
+test state.
+
+If you get into a bad state, you should be able
+to recover with:
+
+```bash
+rm -rf cache
+killall zcashd
+```
+
+Writing tests
+=============
+You are encouraged to write tests for new or existing features.
+Further information about the test framework and individual RPC
+tests is found in [qa/rpc-tests](/qa/rpc-tests).
diff --git a/depend/zcash/qa/pull-tester/rpc-tests.py b/depend/zcash/qa/pull-tester/rpc-tests.py
new file mode 100755
index 000000000..0e61bee21
--- /dev/null
+++ b/depend/zcash/qa/pull-tester/rpc-tests.py
@@ -0,0 +1,454 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+"""
+rpc-tests.py - run regression test suite
+
+This module calls down into individual test cases via subprocess. It will
+forward all unrecognized arguments onto the individual test scripts.
+
+RPC tests are disabled on Windows by default. Use --force to run them anyway.
+
+For a description of arguments recognized by test scripts, see
+`qa/pull-tester/test_framework/test_framework.py:BitcoinTestFramework.main`.
+
+"""
+
+import argparse
+import configparser
+import os
+import time
+import shutil
+import sys
+import subprocess
+import tempfile
+import re
+
+SERIAL_SCRIPTS = [
+    # These tests involve enough shielded spends (consuming all CPU
+    # cores) that we can't run them in parallel.
+    'mergetoaddress_sapling.py',
+    'mergetoaddress_sprout.py',
+    'wallet_shieldingcoinbase.py',
+]
+
+BASE_SCRIPTS= [
+    # Scripts that are run by the travis build process
+    # Longest test should go first, to favor running tests in parallel
+    # vv Tests less than 5m vv
+    'wallet.py',
+    'wallet_shieldcoinbase_sprout.py',
+    'sprout_sapling_migration.py',
+    'remove_sprout_shielding.py',
+    'zcjoinsplitdoublespend.py',
+    # vv Tests less than 2m vv
+    'zcjoinsplit.py',
+    'mergetoaddress_mixednotes.py',
+    'wallet_shieldcoinbase_sapling.py',
+    'wallet_shieldcoinbase_ua_sapling.py',
+    'wallet_shieldcoinbase_ua_nu5.py',
+    'turnstile.py',
+    'walletbackup.py',
+    'zkey_import_export.py',
+    'prioritisetransaction.py',
+    'wallet_changeaddresses.py',
+    'wallet_listreceived.py',
+    'mempool_tx_expiry.py',
+    'finalsaplingroot.py',
+    'wallet_orchard.py',
+    'wallet_overwintertx.py',
+    'wallet_persistence.py',
+    'wallet_listnotes.py',
+    # vv Tests less than 60s vv
+    'orchard_reorg.py',
+    'fundrawtransaction.py',
+    'reorg_limit.py',
+    'mempool_limit.py',
+    'p2p-fullblocktest.py',
+    # vv Tests less than 30s vv
+    'wallet_1941.py',
+    'wallet_accounts.py',
+    'wallet_addresses.py',
+    'wallet_anchorfork.py',
+    'wallet_changeindicator.py',
+    'wallet_deprecation.py',
+    'wallet_doublespend.py',
+    'wallet_import_export.py',
+    'wallet_isfromme.py',
+    'wallet_orchard_change.py',
+    'wallet_orchard_init.py',
+    'wallet_orchard_persistence.py',
+    'wallet_nullifiers.py',
+    'wallet_sapling.py',
+    'wallet_sendmany_any_taddr.py',
+    'wallet_treestate.py',
+    'wallet_unified_change.py',
+    'listtransactions.py',
+    'mempool_resurrect_test.py',
+    'txn_doublespend.py',
+    'txn_doublespend.py --mineblock',
+    'getchaintips.py',
+    'rawtransactions.py',
+    'getrawtransaction_insight.py',
+    'rest.py',
+    'mempool_spendcoinbase.py',
+    'mempool_reorg.py',
+    'mempool_nu_activation.py',
+    'httpbasics.py',
+    'multi_rpc.py',
+    'zapwallettxes.py',
+    'proxy_test.py',
+    'merkle_blocks.py',
+    'signrawtransactions.py',
+    'signrawtransaction_offline.py',
+    'key_import_export.py',
+    'nodehandling.py',
+    'reindex.py',
+    'addressindex.py',
+    'spentindex.py',
+    'timestampindex.py',
+    'decodescript.py',
+    'blockchain.py',
+    'disablewallet.py',
+    'keypool.py',
+    'getblocktemplate.py',
+    'getmininginfo.py',
+    'bip65-cltv-p2p.py',
+    'bipdersig-p2p.py',
+    'invalidblockrequest.py',
+    'invalidtxrequest.py',
+    'p2p_nu_peer_management.py',
+    'rewind_index.py',
+    'p2p_txexpiry_dos.py',
+    'p2p_txexpiringsoon.py',
+    'p2p_node_bloom.py',
+    'regtest_signrawtransaction.py',
+    'shorter_block_times.py',
+    'mining_shielded_coinbase.py',
+    'coinbase_funding_streams.py',
+    'framework.py',
+    'sapling_rewind_check.py',
+    'feature_zip221.py',
+    'feature_zip239.py',
+    'feature_zip244_blockcommitments.py',
+    'upgrade_golden.py',
+    'nuparams.py',
+    'post_heartwood_rollback.py',
+    'feature_logging.py',
+    'feature_walletfile.py',
+    'wallet_parsing_amounts.py',
+    'wallet_broadcast.py',
+    'wallet_z_sendmany.py',
+    'wallet_zero_value.py',
+    'threeofthreerestore.py',
+]
+
+ZMQ_SCRIPTS = [
+    # ZMQ test can only be run if bitcoin was built with zmq-enabled.
+    # call rpc_tests.py with -nozmq to explicitly exclude these tests.
+    "zmq_test.py"]
+
+EXTENDED_SCRIPTS = [
+    # These tests are not run by the travis build process.
+    # Longest test should go first, to favor running tests in parallel
+    'pruning.py',
+    # vv Tests less than 20m vv
+    'smartfees.py',
+    # vv Tests less than 5m vv
+    # vv Tests less than 2m vv
+    'getblocktemplate_longpoll.py',
+    # vv Tests less than 60s vv
+    'rpcbind_test.py',
+    # vv Tests less than 30s vv
+    'getblocktemplate_proposals.py',
+    'forknotify.py',
+    'hardforkdetection.py',
+    'invalidateblock.py',
+    'receivedby.py',
+    'maxblocksinflight.py',
+#    'forknotify.py',
+    'p2p-acceptblock.py',
+    'maxuploadtarget.py',
+    'wallet_db_flush.py',
+]
+
+ALL_SCRIPTS = SERIAL_SCRIPTS + BASE_SCRIPTS + ZMQ_SCRIPTS + EXTENDED_SCRIPTS
+
+def main():
+    # Parse arguments and pass through unrecognised args
+    parser = argparse.ArgumentParser(add_help=False,
+                                     usage='%(prog)s [rpc-test.py options] [script options] [scripts]',
+                                     description=__doc__,
+                                     epilog='''
+    Help text and arguments for individual test script:''',
+                                     formatter_class=argparse.RawTextHelpFormatter)
+    parser.add_argument('--coverage', action='store_true', help='generate a basic coverage report for the RPC interface')
+    parser.add_argument('--exclude', '-x', help='specify a comma-seperated-list of scripts to exclude. Do not include the .py extension in the name.')
+    parser.add_argument('--extended', action='store_true', help='run the extended test suite in addition to the basic tests')
+    parser.add_argument('--force', '-f', action='store_true', help='run tests even on platforms where they are disabled by default (e.g. windows).')
+    parser.add_argument('--help', '-h', '-?', action='store_true', help='print help text and exit')
+    parser.add_argument('--jobs', '-j', type=int, default=4, help='how many test scripts to run in parallel. Default=4.')
+    parser.add_argument('--nozmq', action='store_true', help='do not run the zmq tests')
+    args, unknown_args = parser.parse_known_args()
+
+    # Create a set to store arguments and create the passon string
+    tests = set(arg for arg in unknown_args if arg[:2] != "--")
+    passon_args = [arg for arg in unknown_args if arg[:2] == "--"]
+
+    # Read config generated by configure.
+    config = configparser.ConfigParser()
+    config.read_file(open(os.path.dirname(__file__) + "/tests_config.ini"))
+
+    enable_wallet = config["components"].getboolean("ENABLE_WALLET")
+    enable_utils = config["components"].getboolean("ENABLE_UTILS")
+    enable_bitcoind = config["components"].getboolean("ENABLE_BITCOIND")
+    enable_zmq = config["components"].getboolean("ENABLE_ZMQ") and not args.nozmq
+
+    if config["environment"]["EXEEXT"] == ".exe" and not args.force:
+        # https://github.com/bitcoin/bitcoin/commit/d52802551752140cf41f0d9a225a43e84404d3e9
+        # https://github.com/bitcoin/bitcoin/pull/5677#issuecomment-136646964
+        print("Tests currently disabled on Windows by default. Use --force option to enable")
+        sys.exit(0)
+
+    if not (enable_wallet and enable_utils and enable_bitcoind):
+        print("No rpc tests to run. Wallet, utils, and bitcoind must all be enabled")
+        print("Rerun `configure` with -enable-wallet, -with-utils and -with-daemon and rerun make")
+        sys.exit(0)
+
+    # python3-zmq may not be installed. Handle this gracefully and with some helpful info
+    if enable_zmq:
+        try:
+            import zmq
+            zmq # Silences pyflakes
+        except ImportError:
+            print("ERROR: \"import zmq\" failed. Use -nozmq to run without the ZMQ tests."
+                  "To run zmq tests, see dependency info in /qa/README.md.")
+            raise
+
+    # Build list of tests
+    if tests:
+        # Individual tests have been specified. Run specified tests that exist
+        # in the ALL_SCRIPTS list. Accept the name with or without .py extension.
+        test_list = [t for t in ALL_SCRIPTS if
+                (t in tests or re.sub(".py$", "", t) in tests)]
+
+        print("Running individually selected tests: ")
+        for t in test_list:
+            print("\t" + t)
+    else:
+        # No individual tests have been specified. Run base tests, and
+        # optionally ZMQ tests and extended tests.
+        test_list = SERIAL_SCRIPTS + BASE_SCRIPTS
+        if enable_zmq:
+            test_list += ZMQ_SCRIPTS
+        if args.extended:
+            test_list += EXTENDED_SCRIPTS
+            # TODO: BASE_SCRIPTS and EXTENDED_SCRIPTS are sorted by runtime
+            # (for parallel running efficiency). This combined list will is no
+            # longer sorted.
+
+    # Remove the test cases that the user has explicitly asked to exclude.
+    if args.exclude:
+        for exclude_test in args.exclude.split(','):
+            if exclude_test + ".py" in test_list:
+                test_list.remove(exclude_test + ".py")
+
+    if not test_list:
+        print("No valid test scripts specified. Check that your test is in one "
+              "of the test lists in rpc-tests.py, or run rpc-tests.py with no arguments to run all tests")
+        sys.exit(0)
+
+    if args.help:
+        # Print help for rpc-tests.py, then print help of the first script and exit.
+        parser.print_help()
+        subprocess.check_call((config["environment"]["SRCDIR"] + '/qa/rpc-tests/' + test_list[0]).split() + ['-h'])
+        sys.exit(0)
+
+    run_tests(test_list, config["environment"]["SRCDIR"], config["environment"]["BUILDDIR"], config["environment"]["EXEEXT"], args.jobs, args.coverage, passon_args)
+
+def run_tests(test_list, src_dir, build_dir, exeext, jobs=1, enable_coverage=False, args=[]):
+    BOLD = ("","")
+    if os.name == 'posix':
+        # primitive formatting on supported
+        # terminal via ANSI escape sequences:
+        BOLD = ('\033[0m', '\033[1m')
+
+    #Set env vars
+    if "ZCASHD" not in os.environ:
+        os.environ["ZCASHD"] = build_dir + '/src/zcashd' + exeext
+
+    tests_dir = src_dir + '/qa/rpc-tests/'
+
+    flags = ["--srcdir={}/src".format(build_dir)] + args
+    flags.append("--cachedir=%s/qa/cache" % build_dir)
+
+    if enable_coverage:
+        coverage = RPCCoverage()
+        flags.append(coverage.flag)
+        print("Initializing coverage directory at %s\n" % coverage.dir)
+    else:
+        coverage = None
+
+    if len(test_list) > 1 and jobs > 1:
+        # Populate cache
+        subprocess.check_output([tests_dir + 'create_cache.py'] + flags)
+
+    #Run Tests
+    all_passed = True
+    time_sum = 0
+    time0 = time.time()
+
+    job_queue = RPCTestHandler(jobs, tests_dir, test_list, flags)
+
+    max_len_name = len(max(test_list, key=len))
+    results = BOLD[1] + "%s | %s | %s\n\n" % ("TEST".ljust(max_len_name), "PASSED", "DURATION") + BOLD[0]
+    for _ in range(len(test_list)):
+        (name, stdout, stderr, passed, duration) = job_queue.get_next()
+        all_passed = all_passed and passed
+        time_sum += duration
+
+        print('\n' + BOLD[1] + name + BOLD[0] + ":")
+        print('' if passed else stdout + '\n', end='')
+        print('' if stderr == '' else 'stderr:\n' + stderr + '\n', end='')
+        print("Pass: %s%s%s, Duration: %s s\n" % (BOLD[1], passed, BOLD[0], duration))
+
+        results += "%s | %s | %s s\n" % (name.ljust(max_len_name), str(passed).ljust(6), duration)
+
+    results += BOLD[1] + "\n%s | %s | %s s (accumulated)" % ("ALL".ljust(max_len_name), str(all_passed).ljust(6), time_sum) + BOLD[0]
+    print(results)
+    print("\nRuntime: %s s" % (int(time.time() - time0)))
+
+    if coverage:
+        coverage.report_rpc_coverage()
+
+        print("Cleaning up coverage data")
+        coverage.cleanup()
+
+    sys.exit(not all_passed)
+
+class RPCTestHandler:
+    """
+    Trigger the testscrips passed in via the list.
+    """
+
+    def __init__(self, num_tests_parallel, tests_dir, test_list=None, flags=None):
+        assert(num_tests_parallel >= 1)
+        self.num_jobs = num_tests_parallel
+        self.tests_dir = tests_dir
+        self.test_list = test_list
+        self.flags = flags
+        self.num_running = 0
+        # In case there is a graveyard of zombie bitcoinds, we can apply a
+        # pseudorandom offset to hopefully jump over them.
+        # (625 is PORT_RANGE/MAX_NODES)
+        self.portseed_offset = int(time.time() * 1000) % 625
+        self.jobs = []
+
+    def get_next(self):
+        while self.num_running < self.num_jobs and self.test_list:
+            # Add tests
+            self.num_running += 1
+            t = self.test_list.pop(0)
+            port_seed = ["--portseed={}".format(len(self.test_list) + self.portseed_offset)]
+            log_stdout = tempfile.SpooledTemporaryFile(max_size=2**16)
+            log_stderr = tempfile.SpooledTemporaryFile(max_size=2**16)
+            self.jobs.append((t,
+                              time.time(),
+                              subprocess.Popen((self.tests_dir + t).split() + self.flags + port_seed,
+                                               universal_newlines=True,
+                                               stdout=log_stdout,
+                                               stderr=log_stderr),
+                              log_stdout,
+                              log_stderr))
+            # Run serial scripts on their own. We always run these first,
+            # so we won't have added any other jobs yet.
+            if t in SERIAL_SCRIPTS:
+                break
+        if not self.jobs:
+            raise IndexError('pop from empty list')
+        while True:
+            # Return first proc that finishes
+            time.sleep(.5)
+            for j in self.jobs:
+                (name, time0, proc, log_out, log_err) = j
+                if proc.poll() is not None:
+                    log_out.seek(0), log_err.seek(0)
+                    [stdout, stderr] = [l.read().decode('utf-8') for l in (log_out, log_err)]
+                    log_out.close(), log_err.close()
+                    passed = stderr == "" and proc.returncode == 0
+                    self.num_running -= 1
+                    self.jobs.remove(j)
+                    return name, stdout, stderr, passed, int(time.time() - time0)
+            print('.', end='', flush=True)
+
+
+class RPCCoverage(object):
+    """
+    Coverage reporting utilities for pull-tester.
+
+    Coverage calculation works by having each test script subprocess write
+    coverage files into a particular directory. These files contain the RPC
+    commands invoked during testing, as well as a complete listing of RPC
+    commands per `bitcoin-cli help` (`rpc_interface.txt`).
+
+    After all tests complete, the commands run are combined and diff'd against
+    the complete list to calculate uncovered RPC commands.
+
+    See also: qa/rpc-tests/test_framework/coverage.py
+
+    """
+    def __init__(self):
+        self.dir = tempfile.mkdtemp(prefix="coverage")
+        self.flag = '--coveragedir=%s' % self.dir
+
+    def report_rpc_coverage(self):
+        """
+        Print out RPC commands that were unexercised by tests.
+
+        """
+        uncovered = self._get_uncovered_rpc_commands()
+
+        if uncovered:
+            print("Uncovered RPC commands:")
+            print("".join(("  - %s\n" % i) for i in sorted(uncovered)))
+        else:
+            print("All RPC commands covered.")
+
+    def cleanup(self):
+        return shutil.rmtree(self.dir)
+
+    def _get_uncovered_rpc_commands(self):
+        """
+        Return a set of currently untested RPC commands.
+
+        """
+        # This is shared from `qa/rpc-tests/test-framework/coverage.py`
+        reference_filename = 'rpc_interface.txt'
+        coverage_file_prefix = 'coverage.'
+
+        coverage_ref_filename = os.path.join(self.dir, reference_filename)
+        coverage_filenames = set()
+        all_cmds = set()
+        covered_cmds = set()
+
+        if not os.path.isfile(coverage_ref_filename):
+            raise RuntimeError("No coverage reference found")
+
+        with open(coverage_ref_filename, 'r', encoding='utf8') as f:
+            all_cmds.update([i.strip() for i in f.readlines()])
+
+        for root, dirs, files in os.walk(self.dir):
+            for filename in files:
+                if filename.startswith(coverage_file_prefix):
+                    coverage_filenames.add(os.path.join(root, filename))
+
+        for filename in coverage_filenames:
+            with open(filename, 'r', encoding='utf8') as f:
+                covered_cmds.update([i.strip() for i in f.readlines()])
+
+        return all_cmds - covered_cmds
+
+
+if __name__ == '__main__':
+    main()
diff --git a/depend/zcash/qa/pull-tester/tests_config.ini.in b/depend/zcash/qa/pull-tester/tests_config.ini.in
new file mode 100644
index 000000000..69a262d78
--- /dev/null
+++ b/depend/zcash/qa/pull-tester/tests_config.ini.in
@@ -0,0 +1,18 @@
+# Copyright (c) 2013-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+# These environment variables are set by the build process and read by
+# rpc-tests.py
+
+[environment]
+SRCDIR=@abs_top_srcdir@
+BUILDDIR=@abs_top_builddir@
+EXEEXT=@EXEEXT@
+
+[components]
+# Which components are enabled. These are commented out by `configure` if they were disabled when running config.
+@ENABLE_WALLET_TRUE@ENABLE_WALLET=true
+@BUILD_BITCOIN_UTILS_TRUE@ENABLE_UTILS=true
+@BUILD_BITCOIND_TRUE@ENABLE_BITCOIND=true
+@ENABLE_ZMQ_TRUE@ENABLE_ZMQ=true
diff --git a/depend/zcash/qa/rpc-tests/.gitignore b/depend/zcash/qa/rpc-tests/.gitignore
new file mode 100644
index 000000000..cb41d9442
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/.gitignore
@@ -0,0 +1,2 @@
+*.pyc
+cache
diff --git a/depend/zcash/qa/rpc-tests/README.md b/depend/zcash/qa/rpc-tests/README.md
new file mode 100644
index 000000000..315feae71
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/README.md
@@ -0,0 +1,108 @@
+Regression tests
+================
+
+### [test_framework/test_framework.py](test_framework/test_framework.py)
+Base class for RPC regression tests.
+
+### [test_framework/util.py](test_framework/util.py)
+Generally useful functions.
+
+### [test_framework/mininode.py](test_framework/mininode.py)
+Basic code to support p2p connectivity to a bitcoind.
+
+### [test_framework/comptool.py](test_framework/comptool.py)
+Framework for comparison-tool style, p2p tests.
+
+### [test_framework/script.py](test_framework/script.py)
+Utilities for manipulating transaction scripts (originally from python-bitcoinlib)
+
+### [test_framework/blockstore.py](test_framework/blockstore.py)
+Implements disk-backed block and tx storage.
+
+### [test_framework/key.py](test_framework/key.py)
+Wrapper around OpenSSL EC_Key (originally from python-bitcoinlib)
+
+### [test_framework/bignum.py](test_framework/bignum.py)
+Helpers for script.py
+
+### [test_framework/blocktools.py](test_framework/blocktools.py)
+Helper functions for creating blocks and transactions.
+
+P2P test design notes
+---------------------
+
+## Mininode
+
+* ```mininode.py``` contains all the definitions for objects that pass
+over the network (```CBlock```, ```CTransaction```, etc, along with the network-level
+wrappers for them, ```msg_block```, ```msg_tx```, etc).
+
+* P2P tests have two threads.  One thread handles all network communication
+with the bitcoind(s) being tested (using python's asyncore package); the other
+implements the test logic.
+
+* ```NodeConn``` is the class used to connect to a bitcoind.  If you implement
+a callback class that derives from ```NodeConnCB``` and pass that to the
+```NodeConn``` object, your code will receive the appropriate callbacks when
+events of interest arrive.  NOTE: be sure to call
+```self.create_callback_map()``` in your derived classes' ```__init__```
+function, so that the correct mappings are set up between p2p messages and your
+callback functions.
+
+* You can pass the same handler to multiple ```NodeConn```'s if you like, or pass
+different ones to each -- whatever makes the most sense for your test.
+
+* Call ```NetworkThread.start()``` after all ```NodeConn``` objects are created to
+start the networking thread.  (Continue with the test logic in your existing
+thread.)
+
+* RPC calls are available in p2p tests.
+
+* Can be used to write free-form tests, where specific p2p-protocol behavior
+is tested.  Examples: ```p2p-accept-block.py```, ```maxblocksinflight.py```.
+
+## Comptool
+
+* Testing framework for writing tests that compare the block/tx acceptance
+behavior of a bitcoind against 1 or more other bitcoind instances, or against
+known outcomes, or both.
+
+* Set the ```num_nodes``` variable (defined in ```ComparisonTestFramework```) to start up
+1 or more nodes.  If using 1 node, then ```--testbinary``` can be used as a command line
+option to change the bitcoind binary used by the test.  If using 2 or more nodes,
+then ```--refbinary``` can be optionally used to change the bitcoind that will be used
+on nodes 2 and up.
+
+* Implement a (generator) function called ```get_tests()``` which yields ```TestInstance```s.
+Each ```TestInstance``` consists of:
+  - a list of ```[object, outcome, hash]``` entries
+    * ```object``` is a ```CBlock```, ```CTransaction```, or
+    ```CBlockHeader```.  ```CBlock```'s and ```CTransaction```'s are tested for
+    acceptance.  ```CBlockHeader```s can be used so that the test runner can deliver
+    complete headers-chains when requested from the bitcoind, to allow writing
+    tests where blocks can be delivered out of order but still processed by
+    headers-first bitcoind's.
+    * ```outcome``` is ```True```, ```False```, or ```None```.  If ```True```
+    or ```False```, the tip is compared with the expected tip -- either the
+    block passed in, or the hash specified as the optional 3rd entry.  If
+    ```None``` is specified, then the test will compare all the bitcoind's
+    being tested to see if they all agree on what the best tip is.
+    * ```hash``` is the block hash of the tip to compare against. Optional to
+    specify; if left out then the hash of the block passed in will be used as
+    the expected tip.  This allows for specifying an expected tip while testing
+    the handling of either invalid blocks or blocks delivered out of order,
+    which complete a longer chain.
+  - ```sync_every_block```: ```True/False```.  If ```False```, then all blocks
+    are inv'ed together, and the test runner waits until the node receives the
+    last one, and tests only the last block for tip acceptance using the
+    outcome and specified tip.  If ```True```, then each block is tested in
+    sequence and synced (this is slower when processing many blocks).
+  - ```sync_every_transaction```: ```True/False```.  Analogous to
+    ```sync_every_block```, except if the outcome on the last tx is "None",
+    then the contents of the entire mempool are compared across all bitcoind
+    connections.  If ```True``` or ```False```, then only the last tx's
+    acceptance is tested against the given outcome.
+
+* For examples of tests written in this framework, see
+  ```invalidblockrequest.py``` and ```p2p-fullblocktest.py```.
+
diff --git a/depend/zcash/qa/rpc-tests/addressindex.py b/depend/zcash/qa/rpc-tests/addressindex.py
new file mode 100755
index 000000000..e655f9bc6
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/addressindex.py
@@ -0,0 +1,382 @@
+#!/usr/bin/env python3
+# Copyright (c) 2019 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+#
+# Test addressindex generation and fetching for insightexplorer or lightwalletd
+# 
+# RPCs tested here:
+#
+#   getaddresstxids
+#   getaddressbalance
+#   getaddressdeltas
+#   getaddressutxos
+#   getaddressmempool
+
+
+from test_framework.test_framework import BitcoinTestFramework
+
+from test_framework.util import (
+    assert_equal,
+    start_nodes,
+    stop_nodes,
+    connect_nodes,
+    wait_bitcoinds
+)
+
+from test_framework.script import (
+    CScript,
+    OP_HASH160,
+    OP_EQUAL,
+    OP_DUP,
+    OP_DROP,
+)
+
+from test_framework.mininode import (
+    COIN,
+    CTransaction,
+    CTxIn, CTxOut, COutPoint,
+)
+
+from binascii import hexlify, unhexlify
+
+
+class AddressIndexTest(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 4
+        self.setup_clean_chain = True
+
+    def setup_network(self):
+        # -insightexplorer causes addressindex to be enabled (fAddressIndex = true)
+        args_insight = ('-debug', '-txindex', '-experimentalfeatures', '-insightexplorer')
+        # -lightwallet also causes addressindex to be enabled
+        args_lightwallet = ('-debug', '-txindex', '-experimentalfeatures', '-lightwalletd')
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir, [args_insight] * 3 + [args_lightwallet])
+
+        connect_nodes(self.nodes[0], 1)
+        connect_nodes(self.nodes[0], 2)
+        connect_nodes(self.nodes[0], 3) # node3 is only for testing lightwalletd
+
+        self.is_network_split = False
+        self.sync_all()
+
+    def run_test(self):
+
+        # helper functions
+        def getaddresstxids(node_index, addresses, start, end):
+            return self.nodes[node_index].getaddresstxids({
+                'addresses': addresses,
+                'start': start,
+                'end': end
+            })
+
+        def getaddressdeltas(node_index, addresses, start, end, chainInfo=None):
+            params = {
+                'addresses': addresses,
+                'start': start,
+                'end': end,
+            }
+            if chainInfo is not None:
+                params.update({'chainInfo': chainInfo})
+            return self.nodes[node_index].getaddressdeltas(params)
+
+        # default received value is the balance value
+        def check_balance(node_index, address, expected_balance, expected_received=None):
+            if isinstance(address, list):
+                bal = self.nodes[node_index].getaddressbalance({'addresses': address})
+            else:
+                bal = self.nodes[node_index].getaddressbalance(address)
+            assert_equal(bal['balance'], expected_balance)
+            if expected_received is None:
+                expected_received = expected_balance
+            assert_equal(bal['received'], expected_received)
+
+        # begin test
+
+        self.nodes[0].generate(105)
+        self.sync_all()
+        assert_equal(self.nodes[0].getbalance(), 5 * 10)
+        assert_equal(self.nodes[1].getblockcount(), 105)
+        assert_equal(self.nodes[1].getbalance(), 0)
+
+        # only the oldest 5; subsequent are not yet mature
+        unspent_txids = [u['txid'] for u in self.nodes[0].listunspent()]
+
+        # Currently our only unspents are coinbase transactions, choose any one
+        tx = self.nodes[0].getrawtransaction(unspent_txids[0], 1)
+
+        # It just so happens that the first output is the mining reward,
+        # which has type pay-to-public-key-hash, and the second output
+        # is the founders' reward, which has type pay-to-script-hash.
+        addr_p2pkh = tx['vout'][0]['scriptPubKey']['addresses'][0]
+        addr_p2sh = tx['vout'][1]['scriptPubKey']['addresses'][0]
+
+        # Check that balances from mining are correct (105 blocks mined); in
+        # regtest, all mining rewards from a single call to generate() are sent
+        # to the same pair of addresses.
+        check_balance(1, addr_p2pkh, 105 * 10 * COIN)
+        check_balance(1, addr_p2sh, 105 * 2.5 * COIN)
+
+        # Multiple address arguments, results are the sum
+        check_balance(1, [addr_p2sh, addr_p2pkh], 105 * 12.5 * COIN)
+
+        assert_equal(len(self.nodes[1].getaddresstxids(addr_p2pkh)), 105)
+        assert_equal(len(self.nodes[1].getaddresstxids(addr_p2sh)), 105)
+        # test getaddresstxids for lightwalletd
+        assert_equal(len(self.nodes[3].getaddresstxids(addr_p2pkh)), 105)
+        assert_equal(len(self.nodes[3].getaddresstxids(addr_p2sh)), 105)
+
+        # only the oldest 5 transactions are in the unspent list,
+        # dup addresses are ignored
+        height_txids = getaddresstxids(1, [addr_p2pkh, addr_p2pkh], 1, 5)
+        assert_equal(sorted(height_txids), sorted(unspent_txids))
+
+        height_txids = getaddresstxids(1, [addr_p2sh], 1, 5)
+        assert_equal(sorted(height_txids), sorted(unspent_txids))
+
+        # each txid should appear only once
+        height_txids = getaddresstxids(1, [addr_p2pkh, addr_p2sh], 1, 5)
+        assert_equal(sorted(height_txids), sorted(unspent_txids))
+
+        # do some transfers, make sure balances are good
+        txids_a1 = []
+        addr1 = self.nodes[1].getnewaddress()
+        expected = 0
+        expected_deltas = []  # for checking getaddressdeltas (below)
+        for i in range(5):
+            # first transaction happens at height 105, mined in block 106
+            txid = self.nodes[0].sendtoaddress(addr1, i + 1)
+            txids_a1.append(txid)
+            self.nodes[0].generate(1)
+            self.sync_all()
+            expected += i + 1
+            expected_deltas.append({
+                'height': 106 + i,
+                'satoshis': (i + 1) * COIN,
+                'txid': txid,
+            })
+        check_balance(1, addr1, expected * COIN)
+        assert_equal(sorted(self.nodes[0].getaddresstxids(addr1)), sorted(txids_a1))
+        assert_equal(sorted(self.nodes[1].getaddresstxids(addr1)), sorted(txids_a1))
+
+        # Restart all nodes to ensure indices are saved to disk and recovered
+        stop_nodes(self.nodes)
+        wait_bitcoinds()
+        self.setup_network()
+
+        bal = self.nodes[1].getaddressbalance(addr1)
+        assert_equal(bal['balance'], expected * COIN)
+        assert_equal(bal['received'], expected * COIN)
+        assert_equal(sorted(self.nodes[0].getaddresstxids(addr1)), sorted(txids_a1))
+        assert_equal(sorted(self.nodes[1].getaddresstxids(addr1)), sorted(txids_a1))
+
+        # Send 3 from addr1, but -- subtlety alert! -- addr1 at this
+        # time has 4 UTXOs, with values 1, 2, 3, 4. Sending value 3 requires
+        # using up the value 4 UTXO, because of the tx fee
+        # (the 3 UTXO isn't quite large enough).
+        #
+        # The txid from sending *from* addr1 is also added to the list of
+        # txids associated with that address (test will verify below).
+
+        addr2 = self.nodes[2].getnewaddress()
+        txid = self.nodes[1].sendtoaddress(addr2, 3)
+        self.sync_all()
+
+        # the one tx in the mempool refers to addresses addr1 and addr2,
+        # check that duplicate addresses are processed correctly
+        mempool = self.nodes[0].getaddressmempool({'addresses': [addr2, addr1, addr2]})
+        assert_equal(len(mempool), 3)
+        # test getaddressmempool for lightwalletd node
+        mempool = self.nodes[3].getaddressmempool({'addresses': [addr2, addr1, addr2]})
+        assert_equal(len(mempool), 3)
+
+        # addr2 (first arg)
+        assert_equal(mempool[0]['address'], addr2)
+        assert_equal(mempool[0]['satoshis'], 3 * COIN)
+        assert_equal(mempool[0]['txid'], txid)
+
+        # addr1 (second arg)
+        assert_equal(mempool[1]['address'], addr1)
+        assert_equal(mempool[1]['satoshis'], (-4) * COIN)
+        assert_equal(mempool[1]['txid'], txid)
+
+        # addr2 (third arg)
+        assert_equal(mempool[2]['address'], addr2)
+        assert_equal(mempool[2]['satoshis'], 3 * COIN)
+        assert_equal(mempool[2]['txid'], txid)
+
+        # a single address can be specified as a string (not json object)
+        addr1_mempool = self.nodes[0].getaddressmempool(addr1)
+        assert_equal(len(addr1_mempool), 1)
+        # Don't check the timestamp; it's local to the node, and can mismatch
+        # due to propagation delay.
+        del addr1_mempool[0]['timestamp']
+        for key in addr1_mempool[0].keys():
+            assert_equal(mempool[1][key], addr1_mempool[0][key])
+
+        tx = self.nodes[0].getrawtransaction(txid, 1)
+        assert_equal(tx['vin'][0]['address'], addr1)
+        assert_equal(tx['vin'][0]['value'], 4)
+        assert_equal(tx['vin'][0]['valueSat'], 4 * COIN)
+
+        txids_a1.append(txid)
+        expected_deltas.append({
+            'height': 111,
+            'satoshis': (-4) * COIN,
+            'txid': txid,
+        })
+        self.sync_all()  # ensure transaction is included in the next block
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # the send to addr2 tx is now in a mined block, no longer in the mempool
+        mempool = self.nodes[0].getaddressmempool({'addresses': [addr2, addr1]})
+        assert_equal(len(mempool), 0)
+
+        # Test DisconnectBlock() by invalidating the most recent mined block
+        tip = self.nodes[1].getchaintips()[0]
+        for i in range(self.num_nodes):
+            node = self.nodes[i]
+            # the value 4 UTXO is no longer in our balance
+            check_balance(i, addr1, (expected - 4) * COIN, expected * COIN)
+            check_balance(i, addr2, 3 * COIN)
+
+            assert_equal(node.getblockcount(), 111)
+            node.invalidateblock(tip['hash'])
+            assert_equal(node.getblockcount(), 110)
+
+            mempool = node.getaddressmempool({'addresses': [addr2, addr1]})
+            assert_equal(len(mempool), 2)
+
+            check_balance(i, addr1, expected * COIN)
+            check_balance(i, addr2, 0)
+
+        # now re-mine the addr1 to addr2 send
+        self.nodes[0].generate(1)
+        self.sync_all()
+        for node in self.nodes:
+            assert_equal(node.getblockcount(), 111)
+
+        mempool = self.nodes[0].getaddressmempool({'addresses': [addr2, addr1]})
+        assert_equal(len(mempool), 0)
+
+        # the value 4 UTXO is no longer in our balance
+        check_balance(2, addr1, (expected - 4) * COIN, expected * COIN)
+
+        # Ensure the change from that transaction appears
+        tx = self.nodes[0].getrawtransaction(txid, 1)
+        change_vout = list(filter(lambda v: v['valueZat'] != 3 * COIN, tx['vout']))
+        change = change_vout[0]['scriptPubKey']['addresses'][0]
+
+        # test getaddressbalance
+        for node in (2, 3):
+            bal = self.nodes[node].getaddressbalance(change)
+            assert(bal['received'] > 0)
+
+        # the inequality is due to randomness in the tx fee
+        assert(bal['received'] < (4 - 3) * COIN)
+        assert_equal(bal['received'], bal['balance'])
+        assert_equal(self.nodes[2].getaddresstxids(change), [txid])
+
+        # Further checks that limiting by height works
+
+        # various ranges
+        for i in range(5):
+            height_txids = getaddresstxids(1, [addr1], 106, 106 + i)
+            assert_equal(height_txids, txids_a1[0:i+1])
+
+        height_txids = getaddresstxids(1, [addr1], 1, 108)
+        assert_equal(height_txids, txids_a1[0:3])
+
+        # Further check specifying multiple addresses
+        txids_all = list(txids_a1)
+        txids_all += self.nodes[1].getaddresstxids(addr_p2pkh)
+        txids_all += self.nodes[1].getaddresstxids(addr_p2sh)
+        multitxids = self.nodes[1].getaddresstxids({
+            'addresses': [addr1, addr_p2sh, addr_p2pkh]
+        })
+        # No dups in return list from getaddresstxids
+        assert_equal(len(multitxids), len(set(multitxids)))
+
+        # set(txids_all) removes its (expected) duplicates
+        assert_equal(set(multitxids), set(txids_all))
+
+        # test getaddressdeltas
+        for node in (1, 3):
+            deltas = self.nodes[node].getaddressdeltas({'addresses': [addr1]})
+            assert_equal(len(deltas), len(expected_deltas))
+            for i in range(len(deltas)):
+                assert_equal(deltas[i]['address'],  addr1)
+                assert_equal(deltas[i]['height'],   expected_deltas[i]['height'])
+                assert_equal(deltas[i]['satoshis'], expected_deltas[i]['satoshis'])
+                assert_equal(deltas[i]['txid'],     expected_deltas[i]['txid'])
+
+        # 106-111 is the full range (also the default)
+        deltas_limited = getaddressdeltas(1, [addr1], 106, 111)
+        assert_equal(deltas_limited, deltas)
+
+        # only the first element missing
+        deltas_limited = getaddressdeltas(1, [addr1], 107, 111)
+        assert_equal(deltas_limited, deltas[1:])
+
+        deltas_limited = getaddressdeltas(1, [addr1], 109, 109)
+        assert_equal(deltas_limited, deltas[3:4])
+
+        # the full range (also the default)
+        deltas_info = getaddressdeltas(1, [addr1], 106, 111, chainInfo=True)
+        assert_equal(deltas_info['deltas'], deltas)
+
+        # check the additional items returned by chainInfo
+        assert_equal(deltas_info['start']['height'], 106)
+        block_hash = self.nodes[1].getblockhash(106)
+        assert_equal(deltas_info['start']['hash'], block_hash)
+
+        assert_equal(deltas_info['end']['height'], 111)
+        block_hash = self.nodes[1].getblockhash(111)
+        assert_equal(deltas_info['end']['hash'], block_hash)
+
+        # Test getaddressutxos by comparing results with deltas
+        utxos = self.nodes[3].getaddressutxos(addr1)
+
+        # The value 4 note was spent, so won't show up in the utxo list,
+        # so for comparison, remove the 4 (and -4 for output) from the
+        # deltas list
+        deltas = self.nodes[1].getaddressdeltas({'addresses': [addr1]})
+        deltas = list(filter(lambda d: abs(d['satoshis']) != 4 * COIN, deltas))
+        assert_equal(len(utxos), len(deltas))
+        for i in range(len(utxos)):
+            assert_equal(utxos[i]['address'],   addr1)
+            assert_equal(utxos[i]['height'],    deltas[i]['height'])
+            assert_equal(utxos[i]['satoshis'],  deltas[i]['satoshis'])
+            assert_equal(utxos[i]['txid'],      deltas[i]['txid'])
+
+        # Check that outputs with the same address in the same tx return one txid
+        # (can't use createrawtransaction() as it combines duplicate addresses)
+        addr = "t2LMJ6Arw9UWBMWvfUr2QLHM4Xd9w53FftS"
+        addressHash = unhexlify("97643ce74b188f4fb6bbbb285e067a969041caf2")
+        scriptPubKey = CScript([OP_HASH160, addressHash, OP_EQUAL])
+        # Add an unrecognized script type to vout[], a legal script that pays,
+        # but won't modify the addressindex (since the address can't be extracted).
+        # (This extra output has no effect on the rest of the test.)
+        scriptUnknown = CScript([OP_HASH160, OP_DUP, OP_DROP, addressHash, OP_EQUAL])
+        unspent = list(filter(lambda u: u['amount'] >= 4, self.nodes[0].listunspent()))
+        tx = CTransaction()
+        tx.vin = [CTxIn(COutPoint(int(unspent[0]['txid'], 16), unspent[0]['vout']))]
+        tx.vout = [
+            CTxOut(1 * COIN, scriptPubKey),
+            CTxOut(2 * COIN, scriptPubKey),
+            CTxOut(7 * COIN, scriptUnknown),
+        ]
+        tx = self.nodes[0].signrawtransaction(hexlify(tx.serialize()).decode('utf-8'))
+        txid = self.nodes[0].sendrawtransaction(tx['hex'], True)
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        assert_equal(self.nodes[1].getaddresstxids(addr), [txid])
+        check_balance(2, addr, 3 * COIN)
+
+
+if __name__ == '__main__':
+    AddressIndexTest().main()
diff --git a/depend/zcash/qa/rpc-tests/bip65-cltv-p2p.py b/depend/zcash/qa/rpc-tests/bip65-cltv-p2p.py
new file mode 100755
index 000000000..2fb02ab3c
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/bip65-cltv-p2p.py
@@ -0,0 +1,94 @@
+#!/usr/bin/env python3
+# Copyright (c) 2015-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import ComparisonTestFramework
+from test_framework.util import hex_str_to_bytes, start_nodes
+from test_framework.mininode import CTransaction, NetworkThread
+from test_framework.blocktools import create_coinbase, create_block
+from test_framework.comptool import TestInstance, TestManager
+from test_framework.script import CScript, OP_1NEGATE, OP_NOP2, OP_DROP
+from io import BytesIO
+
+'''
+This test is meant to exercise BIP65 (CHECKLOCKTIMEVERIFY).
+Connect to a single node.
+Mine a coinbase block, and then ...
+Mine 1 version 4 block.
+Check that the CLTV rules are enforced.
+
+TODO: factor out common code from {bipdersig-p2p,bip65-cltv-p2p}.py.
+'''
+
+class BIP65Test(ComparisonTestFramework):
+
+    def setup_network(self):
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir,
+                                 extra_args=[['-debug', '-whitelist=127.0.0.1']],
+                                 binary=[self.options.testbinary])
+        self.is_network_split = False
+
+    def run_test(self):
+        test = TestManager(self, self.options.tmpdir)
+        test.add_all_connections(self.nodes)
+        NetworkThread().start() # Start up network handling in another thread
+        test.run()
+
+    def create_transaction(self, node, coinbase, to_address, amount):
+        from_txid = node.getblock(coinbase)['tx'][0]
+        inputs = [{ "txid" : from_txid, "vout" : 0}]
+        outputs = { to_address : amount }
+        rawtx = node.createrawtransaction(inputs, outputs)
+        signresult = node.signrawtransaction(rawtx)
+        tx = CTransaction()
+        f = BytesIO(hex_str_to_bytes(signresult['hex']))
+        tx.deserialize(f)
+        return tx
+
+    def invalidate_transaction(self, tx):
+        '''
+        Modify the signature in vin 0 of the tx to fail CLTV
+
+        Prepends -1 CLTV DROP in the scriptSig itself.
+        '''
+        tx.vin[0].scriptSig = CScript([OP_1NEGATE, OP_NOP2, OP_DROP] +
+                                      list(CScript(tx.vin[0].scriptSig)))
+
+    def get_tests(self):
+        self.coinbase_blocks = self.nodes[0].generate(1)
+        self.nodes[0].generate(100)
+        height = 102  # height of the next block to build
+        hashTip = self.nodes[0].getbestblockhash()
+        hashFinalSaplingRoot = int("0x" + self.nodes[0].getblock(hashTip)['finalsaplingroot'] , 0)
+        self.tip = int("0x" + hashTip , 0)
+        self.nodeaddress = self.nodes[0].getnewaddress()
+
+        '''Check that the rules are enforced.'''
+        for valid in (True, False):
+            spendtx = self.create_transaction(self.nodes[0],
+                                              self.coinbase_blocks[0],
+                                              self.nodeaddress, 1.0)
+            if not valid:
+                self.invalidate_transaction(spendtx)
+                spendtx.rehash()
+
+            gbt = self.nodes[0].getblocktemplate()
+            self.block_time = gbt["mintime"] + 1
+            self.block_bits = int("0x" + gbt["bits"], 0)
+
+            block = create_block(self.tip, create_coinbase(height),
+                                 self.block_time, self.block_bits,
+                                 hashFinalSaplingRoot)
+            block.nVersion = 4
+            block.vtx.append(spendtx)
+            block.hashMerkleRoot = block.calc_merkle_root()
+            block.rehash()
+            block.solve()
+            self.block_time += 1
+            self.tip = block.sha256
+            yield TestInstance([[block, valid]])
+
+
+if __name__ == '__main__':
+    BIP65Test().main()
diff --git a/depend/zcash/qa/rpc-tests/bipdersig-p2p.py b/depend/zcash/qa/rpc-tests/bipdersig-p2p.py
new file mode 100755
index 000000000..e61813c8c
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/bipdersig-p2p.py
@@ -0,0 +1,101 @@
+#!/usr/bin/env python3
+# Copyright (c) 2015-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import ComparisonTestFramework
+from test_framework.util import hex_str_to_bytes, start_nodes
+from test_framework.mininode import CTransaction, NetworkThread
+from test_framework.blocktools import create_coinbase, create_block
+from test_framework.comptool import TestInstance, TestManager
+from test_framework.script import CScript
+from io import BytesIO
+
+
+'''
+This test is meant to exercise BIP66 (DER SIG).
+Connect to a single node.
+Mine a coinbase block, and then ...
+Mine 1 version 4 block.
+Check that the DERSIG rules are enforced.
+
+TODO: factor out common code from {bipdersig-p2p,bip65-cltv-p2p}.py.
+'''
+class BIP66Test(ComparisonTestFramework):
+
+    def setup_network(self):
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir,
+                                 extra_args=[['-debug', '-whitelist=127.0.0.1']],
+                                 binary=[self.options.testbinary])
+        self.is_network_split = False
+
+    def run_test(self):
+        test = TestManager(self, self.options.tmpdir)
+        test.add_all_connections(self.nodes)
+        NetworkThread().start() # Start up network handling in another thread
+        test.run()
+
+    def create_transaction(self, node, coinbase, to_address, amount):
+        from_txid = node.getblock(coinbase)['tx'][0]
+        inputs = [{ "txid" : from_txid, "vout" : 0}]
+        outputs = { to_address : amount }
+        rawtx = node.createrawtransaction(inputs, outputs)
+        signresult = node.signrawtransaction(rawtx)
+        tx = CTransaction()
+        f = BytesIO(hex_str_to_bytes(signresult['hex']))
+        tx.deserialize(f)
+        return tx
+
+    def invalidate_transaction(self, tx):
+        '''
+        Make the signature in vin 0 of a tx non-DER-compliant,
+        by adding padding after the S-value.
+
+        A canonical signature consists of:
+        <30> <total len> <02> <len R> <R> <02> <len S> <S> <hashtype>
+        '''
+        scriptSig = CScript(tx.vin[0].scriptSig)
+        newscript = []
+        for i in scriptSig:
+            if (len(newscript) == 0):
+                newscript.append(i[0:-1] + '\0' + i[-1])
+            else:
+                newscript.append(i)
+        tx.vin[0].scriptSig = CScript(newscript)
+
+    def get_tests(self):
+        self.coinbase_blocks = self.nodes[0].generate(1)
+        self.nodes[0].generate(100)
+        height = 102  # height of the next block to build
+        hashTip = self.nodes[0].getbestblockhash()
+        hashFinalSaplingRoot = int("0x" + self.nodes[0].getblock(hashTip)['finalsaplingroot'], 0)
+        self.tip = int("0x"+hashTip , 0)
+        self.nodeaddress = self.nodes[0].getnewaddress()
+
+        '''Check that the rules are enforced.'''
+        for valid in (True, False):
+            spendtx = self.create_transaction(self.nodes[0],
+                                              self.coinbase_blocks[0],
+                                              self.nodeaddress, 1.0)
+            if not valid:
+                self.invalidate_transaction(spendtx)
+                spendtx.rehash()
+
+            gbt = self.nodes[0].getblocktemplate()
+            self.block_time = gbt["mintime"] + 1
+            self.block_bits = int("0x" + gbt["bits"], 0)
+
+            block = create_block(self.tip, create_coinbase(height),
+                                 self.block_time, self.block_bits,
+                                 hashFinalSaplingRoot)
+            block.nVersion = 4
+            block.vtx.append(spendtx)
+            block.hashMerkleRoot = block.calc_merkle_root()
+            block.rehash()
+            block.solve()
+            self.tip = block.sha256
+            yield TestInstance([[block, valid]])
+
+
+if __name__ == '__main__':
+    BIP66Test().main()
diff --git a/depend/zcash/qa/rpc-tests/blockchain.py b/depend/zcash/qa/rpc-tests/blockchain.py
new file mode 100755
index 000000000..7f65063a1
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/blockchain.py
@@ -0,0 +1,53 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Test RPC calls related to blockchain state. Tests correspond to code in
+# rpc/blockchain.cpp.
+#
+
+import decimal
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    assert_equal,
+    start_nodes,
+    connect_nodes_bi,
+)
+
+class BlockchainTest(BitcoinTestFramework):
+    """
+    Test blockchain-related RPC calls:
+
+        - gettxoutsetinfo
+
+    """
+
+    def __init__(self):
+        super().__init__()
+        self.setup_clean_chain = False
+        self.num_nodes = 2
+
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir)
+        connect_nodes_bi(self.nodes, 0, 1)
+        self.is_network_split = False
+        self.sync_all()
+
+    def run_test(self):
+        node = self.nodes[0]
+        res = node.gettxoutsetinfo()
+
+        assert_equal(res['total_amount'], decimal.Decimal('2143.75000000')) # 144*12.5 + 55*6.25
+        assert_equal(res['transactions'], 200)
+        assert_equal(res['height'], 200)
+        assert_equal(res['txouts'], 343) # 144*2 + 55
+        assert_equal(res['bytes_serialized'], 14819), # 32*199 + 48*90 + 49*54 + 27*55
+        assert_equal(len(res['bestblock']), 64)
+        assert_equal(len(res['hash_serialized']), 64)
+
+
+if __name__ == '__main__':
+    BlockchainTest().main()
diff --git a/depend/zcash/qa/rpc-tests/coinbase_funding_streams.py b/depend/zcash/qa/rpc-tests/coinbase_funding_streams.py
new file mode 100755
index 000000000..0fd6e84c8
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/coinbase_funding_streams.py
@@ -0,0 +1,101 @@
+#!/usr/bin/env python3
+# Copyright (c) 2020 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.mininode import (
+    nuparams,
+    fundingstream,
+)
+from test_framework.util import (
+    assert_equal,
+    bitcoind_processes,
+    connect_nodes,
+    start_node,
+    BLOSSOM_BRANCH_ID,
+    HEARTWOOD_BRANCH_ID,
+    CANOPY_BRANCH_ID,
+)
+
+class CoinbaseFundingStreamsTest (BitcoinTestFramework):
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 2
+        self.setup_clean_chain = True
+
+    def start_node_with(self, index, extra_args=[]):
+        args = [
+            nuparams(BLOSSOM_BRANCH_ID, 1),
+            nuparams(HEARTWOOD_BRANCH_ID, 2),
+            nuparams(CANOPY_BRANCH_ID, 5),
+            "-nurejectoldversions=false",
+        ]
+        return start_node(index, self.options.tmpdir, args + extra_args)
+
+    def setup_network(self, split=False):
+        self.nodes = []
+        self.nodes.append(self.start_node_with(0))
+        self.nodes.append(self.start_node_with(1))
+        connect_nodes(self.nodes[1], 0)
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test (self):
+        # Generate a shielded address for node 1 for miner rewards,
+        miner_addr = self.nodes[1].z_getnewaddress('sapling')
+
+        # Generate a shielded address (belonging to node 0) for funding stream
+        # rewards.
+        fs_addr = self.nodes[0].z_getnewaddress('sapling')
+
+        # Generate past heartwood activation we won't need node 1 from this
+        # point onward except to check miner reward balances
+        self.nodes[1].generate(2) 
+        self.sync_all()
+
+        # Restart node 0 with funding streams.
+        self.nodes[0].stop()
+        bitcoind_processes[0].wait()
+        self.nodes[0] = self.start_node_with(0, [
+            "-mineraddress=%s" % miner_addr,
+            "-minetolocalwallet=0",
+            fundingstream(0, 5, 9, [fs_addr, fs_addr, fs_addr]),
+            fundingstream(1, 5, 9, [fs_addr, fs_addr, fs_addr]),
+            fundingstream(2, 5, 9, [fs_addr, fs_addr, fs_addr]),
+        ])
+        connect_nodes(self.nodes[1], 0)
+        self.sync_all()
+
+        print("Generate to just prior to Canopy activation")
+        self.nodes[0].generate(2)
+        self.sync_all()
+
+        # All miner addresses belong to node 1; check balances
+        walletinfo = self.nodes[1].getwalletinfo()
+        assert_equal(walletinfo['immature_balance'], 10)
+        assert_equal(walletinfo['balance'], 0)
+        assert_equal(self.nodes[1].z_getbalance(miner_addr, 0), 10)
+        assert_equal(self.nodes[1].z_getbalance(miner_addr), 10)
+
+        print("Activating Canopy")
+        self.nodes[0].generate(4)
+        self.sync_all()
+
+        # check that miner payments made it to node 1's wallet
+        walletinfo = self.nodes[1].getwalletinfo()
+        assert_equal(walletinfo['immature_balance'], 10)
+        assert_equal(walletinfo['balance'], 0)
+        assert_equal(self.nodes[1].z_getbalance(miner_addr, 0), 30)
+        assert_equal(self.nodes[1].z_getbalance(miner_addr), 30)
+
+        # check that the node 0 private balance has been augmented by the
+        # funding stream payments
+        assert_equal(self.nodes[0].z_getbalance(fs_addr, 0), 5)
+        assert_equal(self.nodes[0].z_getbalance(fs_addr), 5)
+        assert_equal(self.nodes[0].z_gettotalbalance()['private'], '5.00')
+        assert_equal(self.nodes[0].z_gettotalbalance()['total'], '5.00')
+
+if __name__ == '__main__':
+    CoinbaseFundingStreamsTest().main()
+
diff --git a/depend/zcash/qa/rpc-tests/create_cache.py b/depend/zcash/qa/rpc-tests/create_cache.py
new file mode 100755
index 000000000..f93aab04e
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/create_cache.py
@@ -0,0 +1,29 @@
+#!/usr/bin/env python3
+# Copyright (c) 2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Helper script to create the cache
+# (see BitcoinTestFramework.setup_chain)
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+
+class CreateCache(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+
+        # Test network and test nodes are not required:
+        self.num_nodes = 0
+        self.nodes = []
+
+    def setup_network(self):
+        pass
+
+    def run_test(self):
+        pass
+
+if __name__ == '__main__':
+    CreateCache().main()
diff --git a/depend/zcash/qa/rpc-tests/decodescript.py b/depend/zcash/qa/rpc-tests/decodescript.py
new file mode 100755
index 000000000..9523c96aa
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/decodescript.py
@@ -0,0 +1,187 @@
+#!/usr/bin/env python3
+# Copyright (c) 2015-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, \
+    start_nodes, hex_str_to_bytes, bytes_to_hex_str
+from test_framework.mininode import CTransaction
+from io import BytesIO
+
+
+class DecodeScriptTest(BitcoinTestFramework):
+    """Tests decoding scripts via RPC command "decodescript"."""
+
+    def __init__(self):
+        super().__init__()
+        self.setup_clean_chain = True
+        self.num_nodes = 1
+
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir)
+        self.is_network_split = False
+
+    def decodescript_script_sig(self):
+        signature = '304502207fa7a6d1e0ee81132a269ad84e68d695483745cde8b541e3bf630749894e342a022100c1f7ab20e13e22fb95281a870f3dcf38d782e53023ee313d741ad0cfbc0c509001'
+        push_signature = '48' + signature
+        public_key = '03b0da749730dc9b4b1f4a14d6902877a92541f5368778853d9c4a0cb7802dcfb2'
+        push_public_key = '21' + public_key
+
+        # below are test cases for all of the standard transaction types
+
+        # 1) P2PK scriptSig
+        # the scriptSig of a public key scriptPubKey simply pushes a signature onto the stack
+        rpc_result = self.nodes[0].decodescript(push_signature)
+        assert_equal(signature, rpc_result['asm'])
+
+        # 2) P2PKH scriptSig
+        rpc_result = self.nodes[0].decodescript(push_signature + push_public_key)
+        assert_equal(signature + ' ' + public_key, rpc_result['asm'])
+
+        # 3) multisig scriptSig
+        # this also tests the leading portion of a P2SH multisig scriptSig
+        # OP_0 <A sig> <B sig>
+        rpc_result = self.nodes[0].decodescript('00' + push_signature + push_signature)
+        assert_equal('0 ' + signature + ' ' + signature, rpc_result['asm'])
+
+        # 4) P2SH scriptSig
+        # an empty P2SH redeemScript is valid and makes for a very simple test case.
+        # thus, such a spending scriptSig would just need to pass the outer redeemScript
+        # hash test and leave true on the top of the stack.
+        rpc_result = self.nodes[0].decodescript('5100')
+        assert_equal('1 0', rpc_result['asm'])
+
+        # 5) null data scriptSig - no such thing because null data scripts can not be spent.
+        # thus, no test case for that standard transaction type is here.
+
+    def decodescript_script_pub_key(self):
+        public_key = '03b0da749730dc9b4b1f4a14d6902877a92541f5368778853d9c4a0cb7802dcfb2'
+        push_public_key = '21' + public_key
+        public_key_hash = '11695b6cd891484c2d49ec5aa738ec2b2f897777'
+        push_public_key_hash = '14' + public_key_hash
+
+        # below are test cases for all of the standard transaction types
+
+        # 1) P2PK scriptPubKey
+        # <pubkey> OP_CHECKSIG
+        rpc_result = self.nodes[0].decodescript(push_public_key + 'ac')
+        assert_equal(public_key + ' OP_CHECKSIG', rpc_result['asm'])
+
+        # 2) P2PKH scriptPubKey
+        # OP_DUP OP_HASH160 <PubKeyHash> OP_EQUALVERIFY OP_CHECKSIG
+        rpc_result = self.nodes[0].decodescript('76a9' + push_public_key_hash + '88ac')
+        assert_equal('OP_DUP OP_HASH160 ' + public_key_hash + ' OP_EQUALVERIFY OP_CHECKSIG', rpc_result['asm'])
+
+        # 3) multisig scriptPubKey
+        # <m> <A pubkey> <B pubkey> <C pubkey> <n> OP_CHECKMULTISIG
+        # just imagine that the pub keys used below are different.
+        # for our purposes here it does not matter that they are the same even though it is unrealistic.
+        rpc_result = self.nodes[0].decodescript('52' + push_public_key + push_public_key + push_public_key + '53ae')
+        assert_equal('2 ' + public_key + ' ' + public_key + ' ' + public_key +  ' 3 OP_CHECKMULTISIG', rpc_result['asm'])
+
+        # 4) P2SH scriptPubKey
+        # OP_HASH160 <Hash160(redeemScript)> OP_EQUAL.
+        # push_public_key_hash here should actually be the hash of a redeem script.
+        # but this works the same for purposes of this test.
+        rpc_result = self.nodes[0].decodescript('a9' + push_public_key_hash + '87')
+        assert_equal('OP_HASH160 ' + public_key_hash + ' OP_EQUAL', rpc_result['asm'])
+
+        # 5) null data scriptPubKey
+        # use a signature look-alike here to make sure that we do not decode random data as a signature.
+        # this matters if/when signature sighash decoding comes along.
+        # would want to make sure that no such decoding takes place in this case.
+        signature_imposter = '48304502207fa7a6d1e0ee81132a269ad84e68d695483745cde8b541e3bf630749894e342a022100c1f7ab20e13e22fb95281a870f3dcf38d782e53023ee313d741ad0cfbc0c509001'
+        # OP_RETURN <data>
+        rpc_result = self.nodes[0].decodescript('6a' + signature_imposter)
+        assert_equal('OP_RETURN ' + signature_imposter[2:], rpc_result['asm'])
+
+        # 6) a CLTV redeem script. redeem scripts are in-effect scriptPubKey scripts, so adding a test here.
+        # OP_NOP2 is also known as OP_CHECKLOCKTIMEVERIFY.
+        # just imagine that the pub keys used below are different.
+        # for our purposes here it does not matter that they are the same even though it is unrealistic.
+        #
+        # OP_IF
+        #   <receiver-pubkey> OP_CHECKSIGVERIFY
+        # OP_ELSE
+        #   <lock-until> OP_NOP2 OP_DROP
+        # OP_ENDIF
+        # <sender-pubkey> OP_CHECKSIG
+        #
+        # lock until block 500,000
+        rpc_result = self.nodes[0].decodescript('63' + push_public_key + 'ad670320a107b17568' + push_public_key + 'ac')
+        assert_equal('OP_IF ' + public_key + ' OP_CHECKSIGVERIFY OP_ELSE 500000 OP_NOP2 OP_DROP OP_ENDIF ' + public_key + ' OP_CHECKSIG', rpc_result['asm'])
+
+    def decoderawtransaction_asm_sighashtype(self):
+        """Tests decoding scripts via RPC command "decoderawtransaction".
+
+        This test is in with the "decodescript" tests because they are testing the same "asm" script decodes.
+        """
+
+        # this test case uses a random plain vanilla mainnet transaction with a single P2PKH input and output
+        tx = '0100000001696a20784a2c70143f634e95227dbdfdf0ecd51647052e70854512235f5986ca010000008a47304402207174775824bec6c2700023309a168231ec80b82c6069282f5133e6f11cbb04460220570edc55c7c5da2ca687ebd0372d3546ebc3f810516a002350cac72dfe192dfb014104d3f898e6487787910a690410b7a917ef198905c27fb9d3b0a42da12aceae0544fc7088d239d9a48f2828a15a09e84043001f27cc80d162cb95404e1210161536ffffffff0100e1f505000000001976a914eb6c6e0cdb2d256a32d97b8df1fc75d1920d9bca88ac00000000'
+        rpc_result = self.nodes[0].decoderawtransaction(tx)
+        assert_equal('304402207174775824bec6c2700023309a168231ec80b82c6069282f5133e6f11cbb04460220570edc55c7c5da2ca687ebd0372d3546ebc3f810516a002350cac72dfe192dfb[ALL] 04d3f898e6487787910a690410b7a917ef198905c27fb9d3b0a42da12aceae0544fc7088d239d9a48f2828a15a09e84043001f27cc80d162cb95404e1210161536', rpc_result['vin'][0]['scriptSig']['asm'])
+
+        # this test case uses a mainnet transaction that has a P2SH input and both P2PKH and P2SH outputs.
+        # it's from James D'Angelo's awesome introductory videos about multisig: https://www.youtube.com/watch?v=zIbUSaZBJgU and https://www.youtube.com/watch?v=OSA1pwlaypc
+        # verify that we have not altered scriptPubKey decoding.
+        tx = '01000000018d1f5635abd06e2c7e2ddf58dc85b3de111e4ad6e0ab51bb0dcf5e84126d927300000000fdfe0000483045022100ae3b4e589dfc9d48cb82d41008dc5fa6a86f94d5c54f9935531924602730ab8002202f88cf464414c4ed9fa11b773c5ee944f66e9b05cc1e51d97abc22ce098937ea01483045022100b44883be035600e9328a01b66c7d8439b74db64187e76b99a68f7893b701d5380220225bf286493e4c4adcf928c40f785422572eb232f84a0b83b0dea823c3a19c75014c695221020743d44be989540d27b1b4bbbcfd17721c337cb6bc9af20eb8a32520b393532f2102c0120a1dda9e51a938d39ddd9fe0ebc45ea97e1d27a7cbd671d5431416d3dd87210213820eb3d5f509d7438c9eeecb4157b2f595105e7cd564b3cdbb9ead3da41eed53aeffffffff02611e0000000000001976a914dc863734a218bfe83ef770ee9d41a27f824a6e5688acee2a02000000000017a9142a5edea39971049a540474c6a99edf0aa4074c588700000000'
+        rpc_result = self.nodes[0].decoderawtransaction(tx)
+        assert_equal('8e3730608c3b0bb5df54f09076e196bc292a8e39a78e73b44b6ba08c78f5cbb0', rpc_result['txid'])
+        assert_equal('0 3045022100ae3b4e589dfc9d48cb82d41008dc5fa6a86f94d5c54f9935531924602730ab8002202f88cf464414c4ed9fa11b773c5ee944f66e9b05cc1e51d97abc22ce098937ea[ALL] 3045022100b44883be035600e9328a01b66c7d8439b74db64187e76b99a68f7893b701d5380220225bf286493e4c4adcf928c40f785422572eb232f84a0b83b0dea823c3a19c75[ALL] 5221020743d44be989540d27b1b4bbbcfd17721c337cb6bc9af20eb8a32520b393532f2102c0120a1dda9e51a938d39ddd9fe0ebc45ea97e1d27a7cbd671d5431416d3dd87210213820eb3d5f509d7438c9eeecb4157b2f595105e7cd564b3cdbb9ead3da41eed53ae', rpc_result['vin'][0]['scriptSig']['asm'])
+        assert_equal('OP_DUP OP_HASH160 dc863734a218bfe83ef770ee9d41a27f824a6e56 OP_EQUALVERIFY OP_CHECKSIG', rpc_result['vout'][0]['scriptPubKey']['asm'])
+        assert_equal('OP_HASH160 2a5edea39971049a540474c6a99edf0aa4074c58 OP_EQUAL', rpc_result['vout'][1]['scriptPubKey']['asm'])
+        txSave = CTransaction()
+        txSave.deserialize(BytesIO(hex_str_to_bytes(tx)))
+
+        # make sure that a specifically crafted op_return value will not pass all the IsDERSignature checks and then get decoded as a sighash type
+        tx = '01000000015ded05872fdbda629c7d3d02b194763ce3b9b1535ea884e3c8e765d42e316724020000006b48304502204c10d4064885c42638cbff3585915b322de33762598321145ba033fc796971e2022100bb153ad3baa8b757e30a2175bd32852d2e1cb9080f84d7e32fcdfd667934ef1b012103163c0ff73511ea1743fb5b98384a2ff09dd06949488028fd819f4d83f56264efffffffff0200000000000000000b6a0930060201000201000180380100000000001976a9141cabd296e753837c086da7a45a6c2fe0d49d7b7b88ac00000000'
+        rpc_result = self.nodes[0].decoderawtransaction(tx)
+        assert_equal('OP_RETURN 300602010002010001', rpc_result['vout'][0]['scriptPubKey']['asm'])
+
+        # verify that we have not altered scriptPubKey processing even of a specially crafted P2PKH pubkeyhash and P2SH redeem script hash that is made to pass the der signature checks
+        tx = '01000000018d1f5635abd06e2c7e2ddf58dc85b3de111e4ad6e0ab51bb0dcf5e84126d927300000000fdfe0000483045022100ae3b4e589dfc9d48cb82d41008dc5fa6a86f94d5c54f9935531924602730ab8002202f88cf464414c4ed9fa11b773c5ee944f66e9b05cc1e51d97abc22ce098937ea01483045022100b44883be035600e9328a01b66c7d8439b74db64187e76b99a68f7893b701d5380220225bf286493e4c4adcf928c40f785422572eb232f84a0b83b0dea823c3a19c75014c695221020743d44be989540d27b1b4bbbcfd17721c337cb6bc9af20eb8a32520b393532f2102c0120a1dda9e51a938d39ddd9fe0ebc45ea97e1d27a7cbd671d5431416d3dd87210213820eb3d5f509d7438c9eeecb4157b2f595105e7cd564b3cdbb9ead3da41eed53aeffffffff02611e0000000000001976a914301102070101010101010102060101010101010188acee2a02000000000017a91430110207010101010101010206010101010101018700000000'
+        rpc_result = self.nodes[0].decoderawtransaction(tx)
+        assert_equal('OP_DUP OP_HASH160 3011020701010101010101020601010101010101 OP_EQUALVERIFY OP_CHECKSIG', rpc_result['vout'][0]['scriptPubKey']['asm'])
+        assert_equal('OP_HASH160 3011020701010101010101020601010101010101 OP_EQUAL', rpc_result['vout'][1]['scriptPubKey']['asm'])
+
+        # some more full transaction tests of varying specific scriptSigs. used instead of
+        # tests in decodescript_script_sig because the decodescript RPC is specifically
+        # for working on scriptPubKeys (argh!).
+        push_signature = bytes_to_hex_str(txSave.vin[0].scriptSig)[2:(0x48*2+4)]
+        signature = push_signature[2:]
+        der_signature = signature[:-2]
+        signature_sighash_decoded = der_signature + '[ALL]'
+        signature_2 = der_signature + '82'
+        push_signature_2 = '48' + signature_2
+        signature_2_sighash_decoded = der_signature + '[NONE|ANYONECANPAY]'
+
+        # 1) P2PK scriptSig
+        txSave.vin[0].scriptSig = hex_str_to_bytes(push_signature)
+        rpc_result = self.nodes[0].decoderawtransaction(bytes_to_hex_str(txSave.serialize()))
+        assert_equal(signature_sighash_decoded, rpc_result['vin'][0]['scriptSig']['asm'])
+
+        # make sure that the sighash decodes come out correctly for a more complex / lesser used case.
+        txSave.vin[0].scriptSig = hex_str_to_bytes(push_signature_2)
+        rpc_result = self.nodes[0].decoderawtransaction(bytes_to_hex_str(txSave.serialize()))
+        assert_equal(signature_2_sighash_decoded, rpc_result['vin'][0]['scriptSig']['asm'])
+
+        # 2) multisig scriptSig
+        txSave.vin[0].scriptSig = hex_str_to_bytes('00' + push_signature + push_signature_2)
+        rpc_result = self.nodes[0].decoderawtransaction(bytes_to_hex_str(txSave.serialize()))
+        assert_equal('0 ' + signature_sighash_decoded + ' ' + signature_2_sighash_decoded, rpc_result['vin'][0]['scriptSig']['asm'])
+
+        # 3) test a scriptSig that contains more than push operations.
+        # in fact, it contains an OP_RETURN with data specially crafted to cause improper decode if the code does not catch it.
+        txSave.vin[0].scriptSig = hex_str_to_bytes('6a143011020701010101010101020601010101010101')
+        rpc_result = self.nodes[0].decoderawtransaction(bytes_to_hex_str(txSave.serialize()))
+        assert_equal('OP_RETURN 3011020701010101010101020601010101010101', rpc_result['vin'][0]['scriptSig']['asm'])
+
+    def run_test(self):
+        self.decodescript_script_sig()
+        self.decodescript_script_pub_key()
+        self.decoderawtransaction_asm_sighashtype()
+
+if __name__ == '__main__':
+    DecodeScriptTest().main()
diff --git a/depend/zcash/qa/rpc-tests/disablewallet.py b/depend/zcash/qa/rpc-tests/disablewallet.py
new file mode 100755
index 000000000..f29820414
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/disablewallet.py
@@ -0,0 +1,34 @@
+#!/usr/bin/env python3
+# Copyright (c) 2015-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Exercise API with -disablewallet.
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import start_nodes
+
+
+class DisableWalletTest (BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.setup_clean_chain = True
+        self.num_nodes = 1
+
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir, [['-disablewallet']])
+        self.is_network_split = False
+        self.sync_all()
+
+    def run_test (self):
+        # Check regression: https://github.com/bitcoin/bitcoin/issues/6963#issuecomment-154548880
+        x = self.nodes[0].validateaddress('t3b1jtLvxCstdo1pJs9Tjzc5dmWyvGQSZj8')
+        assert(x['isvalid'] == False)
+        x = self.nodes[0].validateaddress('tmGqwWtL7RsbxikDSN26gsbicxVr2xJNe86')
+        assert(x['isvalid'] == True)
+
+if __name__ == '__main__':
+    DisableWalletTest ().main ()
diff --git a/depend/zcash/qa/rpc-tests/feature_logging.py b/depend/zcash/qa/rpc-tests/feature_logging.py
new file mode 100755
index 000000000..0e0977ef9
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/feature_logging.py
@@ -0,0 +1,59 @@
+#!/usr/bin/env python3
+# Copyright (c) 2017 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+"""Test debug logging."""
+
+import os
+
+from test_framework.util import start_node, stop_node, assert_start_raises_init_error
+
+from test_framework.test_framework import BitcoinTestFramework
+
+class LoggingTest(BitcoinTestFramework):
+    def set_test_params(self):
+        self.num_nodes = 1
+        self.setup_clean_chain = True
+
+    def run_test(self):
+        # test default log file name
+        assert os.path.isfile(os.path.join(self.options.tmpdir, "node0", "regtest", "debug.log"))
+
+        # test alternative log file name in datadir
+        stop_node(self.nodes[0], 0)
+        self.nodes[0] = start_node(0, self.options.tmpdir, ["-debuglogfile=foo.log"])
+        assert os.path.isfile(os.path.join(self.options.tmpdir, "node0", "regtest", "foo.log"))
+
+        # test alternative log file name outside datadir
+        tempname = os.path.join(self.options.tmpdir, "foo.log")
+        stop_node(self.nodes[0], 0)
+        self.nodes[0] = start_node(0, self.options.tmpdir, ["-debuglogfile=%s" % tempname])
+        assert os.path.isfile(tempname)
+
+        # check that invalid log (relative) will cause error
+        invdir = os.path.join(self.options.tmpdir, "node0", "regtest", "foo")
+        invalidname = os.path.join("foo", "foo.log")
+        stop_node(self.nodes[0], 0)
+        assert_start_raises_init_error(0, "-debuglogfile=%s" % (invalidname),
+                                           "Error: Could not open debug log file")
+        assert not os.path.isfile(os.path.join(invdir, "foo.log"))
+
+        # check that invalid log (relative) works after path exists
+        os.mkdir(invdir)
+        self.nodes[0] = start_node(0, self.options.tmpdir, ["-debuglogfile=%s" % (invalidname)])
+        assert os.path.isfile(os.path.join(invdir, "foo.log"))
+
+        # check that invalid log (absolute) will cause error
+        stop_node(self.nodes[0], 0)
+        invdir = os.path.join(self.options.tmpdir, "foo")
+        invalidname = os.path.join(invdir, "foo.log")
+        assert_start_raises_init_error(0, "-debuglogfile=%s" % invalidname,
+                                          "Error: Could not open debug log file")
+
+        # check that invalid log (absolute) works after path exists
+        os.mkdir(invdir)
+        self.nodes[0] = start_node(0, self.options.tmpdir, ["-debuglogfile=%s" % invalidname])
+        assert os.path.isfile(os.path.join(invdir, "foo.log"))
+
+if __name__ == '__main__':
+    LoggingTest().main()
diff --git a/depend/zcash/qa/rpc-tests/feature_walletfile.py b/depend/zcash/qa/rpc-tests/feature_walletfile.py
new file mode 100755
index 000000000..085624ff0
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/feature_walletfile.py
@@ -0,0 +1,50 @@
+#!/usr/bin/env python3
+# Copyright (c) 2017 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+"""Test wallet file location."""
+
+import os
+
+from test_framework.util import start_node, stop_node, assert_start_raises_init_error
+
+from test_framework.test_framework import BitcoinTestFramework
+
+class WalletFileTest(BitcoinTestFramework):
+    def set_test_params(self):
+        self.num_nodes = 1
+        self.setup_clean_chain = True
+
+    def run_test(self):
+        # test default wallet location
+        assert os.path.isfile(os.path.join(self.options.tmpdir, "node0", "regtest", "wallet.dat"))
+
+        # test alternative wallet file name in datadir
+        stop_node(self.nodes[0], 0)
+        self.nodes[0] = start_node(0, self.options.tmpdir, ["-wallet=altwallet.dat"])
+        assert os.path.isfile(os.path.join(self.options.tmpdir, "node0", "regtest", "altwallet.dat"))
+
+        # test wallet file outside datadir
+        tempname = os.path.join(self.options.tmpdir, "outsidewallet.dat")
+        stop_node(self.nodes[0], 0)
+        self.nodes[0] = start_node(0, self.options.tmpdir, ["-wallet=%s" % tempname])
+        assert os.path.isfile(tempname)
+
+        # test the case where absolute path does not exist
+        assert not os.path.isdir("/this_directory_must_not_exist")
+        invalidpath = os.path.join("/this_directory_must_not_exist/", "foo.dat")
+        stop_node(self.nodes[0], 0)
+        assert_start_raises_init_error(0, "-wallet=%s" % invalidpath,
+            "Error: Absolute path %s does not exist")
+
+        # relative path does not exist
+        invalidpath = os.path.join("wallet", "foo.dat")
+        assert_start_raises_init_error(0, "-wallet=%s" % invalidpath,
+            "Error: Relative path %s does not exist")
+
+        # create dir and retry
+        os.mkdir(os.path.join(self.options.tmpdir, "node0", "regtest", "wallet"))
+        self.nodes[0] = start_node(0, self.options.tmpdir, ["-wallet=%s" % invalidpath])
+
+if __name__ == '__main__':
+    WalletFileTest().main()
diff --git a/depend/zcash/qa/rpc-tests/feature_zip221.py b/depend/zcash/qa/rpc-tests/feature_zip221.py
new file mode 100755
index 000000000..e2e6bdcc4
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/feature_zip221.py
@@ -0,0 +1,190 @@
+#!/usr/bin/env python3
+# Copyright (c) 2020 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+
+from test_framework.flyclient import (ZcashMMRNode, append, delete, make_root_commitment)
+from test_framework.mininode import (CBlockHeader)
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    BLOSSOM_BRANCH_ID,
+    HEARTWOOD_BRANCH_ID,
+    CANOPY_BRANCH_ID,
+    NU5_BRANCH_ID,
+    assert_equal,
+    bytes_to_hex_str,
+    hex_str_to_bytes,
+    nuparams,
+    start_nodes,
+)
+
+from io import BytesIO
+
+NULL_FIELD = "00" * 32
+CHAIN_HISTORY_ROOT_VERSION = 2010200
+
+# Verify block header field 'hashLightClientRoot' is set correctly for Heartwood blocks.
+class Zip221Test(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 4
+        self.setup_clean_chain = True
+
+    def setup_nodes(self):
+        return start_nodes(self.num_nodes, self.options.tmpdir, extra_args=[[
+            nuparams(BLOSSOM_BRANCH_ID, 1),
+            nuparams(HEARTWOOD_BRANCH_ID, 10),
+            nuparams(CANOPY_BRANCH_ID, 32),
+            nuparams(NU5_BRANCH_ID, 35),
+            '-nurejectoldversions=false',
+        ]] * self.num_nodes)
+
+    def node_for_block(self, height):
+        if height >= 35:
+            epoch = NU5_BRANCH_ID
+        elif height >= 32:
+            epoch = CANOPY_BRANCH_ID
+        else:
+            epoch = HEARTWOOD_BRANCH_ID
+
+        block_header = CBlockHeader()
+        block_header.deserialize(BytesIO(hex_str_to_bytes(
+            self.nodes[0].getblock(str(height), 0))))
+        sapling_root = hex_str_to_bytes(
+            self.nodes[0].getblock(str(height))["finalsaplingroot"])[::-1]
+
+        if height >= 35:
+            orchard_root = hex_str_to_bytes(
+                self.nodes[0].getblock(str(height))["finalorchardroot"])[::-1]
+            v2_data = (orchard_root, 0)
+        else:
+            v2_data = None
+
+        return ZcashMMRNode.from_block(
+            block_header, height, sapling_root, 0, epoch, v2_data)
+
+    def new_tree(self, height):
+        newRoot = self.node_for_block(height - 1)
+        assert_equal(
+            self.nodes[0].getblock(str(height))["chainhistoryroot"],
+            bytes_to_hex_str(make_root_commitment(newRoot)[::-1]))
+        return newRoot
+
+    def update_tree(self, root, height):
+        leaf = self.node_for_block(height - 1)
+        root = append(root, leaf)
+        assert_equal(
+            self.nodes[0].getblock(str(height))["chainhistoryroot"],
+            bytes_to_hex_str(make_root_commitment(root)[::-1]))
+        return root
+
+    def run_test(self):
+        self.nodes[0].generate(10)
+        self.sync_all()
+
+        # Verify all blocks up to and including Heartwood activation set
+        # hashChainHistoryRoot to null.
+        print("Verifying blocks up to and including Heartwood activation")
+        blockcount = self.nodes[0].getblockcount()
+        assert_equal(blockcount, 10)
+        for height in range(0, blockcount + 1):
+            blk = self.nodes[0].getblock(str(height))
+            assert_equal(blk["chainhistoryroot"], NULL_FIELD)
+
+
+        # Create the initial history tree, containing a single node.
+        root = self.node_for_block(10)
+
+        # Generate the first block that contains a non-null chain history root.
+        print("Verifying first non-null chain history root")
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # Verify that hashChainHistoryRoot is set correctly.
+        assert_equal(
+            self.nodes[0].getblock('11')["chainhistoryroot"],
+            bytes_to_hex_str(make_root_commitment(root)[::-1]))
+
+        # Generate 9 more blocks on node 0, and verify their chain history roots.
+        print("Mining 9 blocks on node 0")
+        self.nodes[0].generate(9)
+        self.sync_all()
+
+        print("Verifying node 0's chain history")
+        for height in range(12, 21):
+            leaf = self.node_for_block(height - 1)
+            root = append(root, leaf)
+            assert_equal(
+                self.nodes[0].getblock(str(height))["chainhistoryroot"],
+                bytes_to_hex_str(make_root_commitment(root)[::-1]))
+
+        # The rest of the test only applies to Heartwood-aware node versions.
+        # Earlier versions won't serialize chain history roots in the block
+        # index, and splitting the network below requires restarting the nodes.
+        if self.nodes[0].getnetworkinfo()["version"] < CHAIN_HISTORY_ROOT_VERSION:
+            print("Node's block index is not Heartwood-aware, skipping reorg test")
+            return
+
+        # Split the network so we can test the effect of a reorg.
+        print("Splitting the network")
+        self.split_network()
+
+        # Generate 10 more blocks on node 0, and verify their chain history roots.
+        print("Mining 10 more blocks on node 0")
+        self.nodes[0].generate(10)
+        self.sync_all()
+
+        print("Verifying node 0's chain history")
+        for height in range(21, 31):
+            leaf = self.node_for_block(height - 1)
+            root = append(root, leaf)
+            assert_equal(
+                self.nodes[0].getblock(str(height))["chainhistoryroot"],
+                bytes_to_hex_str(make_root_commitment(root)[::-1]))
+
+        # Generate 11 blocks on node 2.
+        print("Mining alternate chain on node 2")
+        self.nodes[2].generate(11)
+        self.sync_all()
+
+        # Reconnect the nodes; node 0 will re-org to node 2's chain.
+        print("Re-joining the network so that node 0 reorgs")
+        self.join_network()
+
+        # Verify that node 0's chain history was correctly updated.
+        print("Deleting orphaned blocks from the expected chain history")
+        for _ in range(10):
+            root = delete(root)
+
+        print("Verifying that node 0 is now on node 1's chain history")
+        for height in range(21, 32):
+            leaf = self.node_for_block(height - 1)
+            root = append(root, leaf)
+            assert_equal(
+                self.nodes[2].getblock(str(height))["chainhistoryroot"],
+                bytes_to_hex_str(make_root_commitment(root)[::-1]))
+
+        # Generate 6 blocks on node 0 to activate Canopy and NU5.
+        print("Mining 6 blocks on node 0")
+        self.nodes[0].generate(6)
+        self.sync_all()
+
+        # The Canopy activation block should commit to the final Heartwood tree.
+        root = self.update_tree(root, 32)
+
+        # The two blocks after Canopy activation should be a new tree.
+        canopyRoot = self.new_tree(33)
+        canopyRoot = self.update_tree(canopyRoot, 34)
+
+        # The NU5 activation block should commit to the final Heartwood tree.
+        canopyRoot = self.update_tree(canopyRoot, 35)
+
+        # The two blocks after NU5 activation should be a V2 tree.
+        nu5Root = self.new_tree(36)
+        nu5Root = self.update_tree(nu5Root, 37)
+
+
+if __name__ == '__main__':
+    Zip221Test().main()
diff --git a/depend/zcash/qa/rpc-tests/feature_zip239.py b/depend/zcash/qa/rpc-tests/feature_zip239.py
new file mode 100755
index 000000000..6824d9ff1
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/feature_zip239.py
@@ -0,0 +1,266 @@
+#!/usr/bin/env python3
+# Copyright (c) 2021 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.mininode import (
+    NU5_PROTO_VERSION,
+    CInv,
+    NetworkThread,
+    NodeConn,
+    mininode_lock,
+    msg_getdata,
+    msg_mempool,
+    msg_reject,
+    uint256_from_str,
+)
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    BLOSSOM_BRANCH_ID,
+    HEARTWOOD_BRANCH_ID,
+    CANOPY_BRANCH_ID,
+    NU5_BRANCH_ID,
+    assert_equal,
+    assert_false,
+    assert_true,
+    fail,
+    hex_str_to_bytes,
+    nuparams,
+    p2p_port,
+    start_node,
+    wait_and_assert_operationid_status,
+)
+from tx_expiry_helper import TestNode
+
+import os.path
+import time
+
+# Test ZIP 239 behaviour before and after NU5.
+class Zip239Test(BitcoinTestFramework):
+    def setup_nodes(self):
+        extra_args=[
+            # Enable Canopy at height 205 to allow shielding Sprout funds first.
+            nuparams(BLOSSOM_BRANCH_ID, 205),
+            nuparams(HEARTWOOD_BRANCH_ID, 205),
+            nuparams(CANOPY_BRANCH_ID, 205),
+            nuparams(NU5_BRANCH_ID, 210),
+        ]
+
+        nodes = []
+        nodes.append(start_node(0, self.options.tmpdir, extra_args))
+        nodes.append(start_node(1, self.options.tmpdir, extra_args))
+        nodes.append(start_node(2, self.options.tmpdir, extra_args))
+        nodes.append(start_node(3, self.options.tmpdir, extra_args))
+        return nodes
+
+    def cinv_for(self, txid, authDigest=None):
+        if authDigest is not None:
+            return CInv(5, txid, authDigest)
+        else:
+            return CInv(1, txid)
+
+    def verify_inv(self, testnode, txs):
+        # Make sure we are synced before sending the mempool message
+        testnode.sync_with_ping()
+
+        # Send p2p message "mempool" to receive contents from zcashd node in "inv" message
+        with mininode_lock:
+            testnode.last_inv = None
+            testnode.send_message(msg_mempool())
+
+        # Sync up with node after p2p messages delivered
+        testnode.sync_with_ping(waiting_for=lambda x: x.last_inv)
+
+        with mininode_lock:
+            msg = testnode.last_inv
+            assert_equal(len(msg.inv), len(txs))
+
+            expected_invs = sorted(txs, key=lambda inv: (inv.type, inv.hash, inv.hash_aux))
+            actual_invs = sorted(msg.inv, key=lambda inv: (inv.type, inv.hash, inv.hash_aux))
+
+            for (expected, actual) in zip(expected_invs, actual_invs):
+                assert_equal(expected, actual)
+
+    def send_data_message(self, testnode, txid, authDigest=None):
+        # Send p2p message "getdata" to verify tx gets sent in "tx" message
+        getdatamsg = msg_getdata()
+        getdatamsg.inv = [self.cinv_for(txid, authDigest)]
+        with mininode_lock:
+            testnode.last_tx = None
+            testnode.last_notfound = None
+            testnode.send_message(getdatamsg)
+
+    def verify_last_tx(self, testnode, txid, authDigest=None):
+        # Sync up with node after p2p messages delivered
+        testnode.sync_with_ping()
+
+        # Verify data received in "tx" message is for tx
+        with mininode_lock:
+            assert_true(testnode.last_notfound is None, "'%r' is not None" % testnode.last_notfound)
+            assert_false(testnode.last_tx is None, "No tx received")
+            incoming_tx = testnode.last_tx.tx
+            incoming_tx.rehash()
+            assert_equal(txid, incoming_tx.sha256)
+
+    def verify_last_notfound(self, testnode, txid, authDigest=None):
+        # Sync up with node after p2p messages delivered
+        testnode.sync_with_ping()
+
+        # Verify data received in "notfound" message is for tx
+        with mininode_lock:
+            assert_true(testnode.last_tx is None, "'%r' is not None" % testnode.last_tx)
+            assert_false(testnode.last_notfound is None, "notfound not received")
+            assert_equal(len(testnode.last_notfound.inv), 1)
+            assert_equal(testnode.last_notfound.inv[0], self.cinv_for(txid, authDigest))
+
+    def verify_invalid_cinv(self, testnode, conn, msg_type, expected_msg):
+        # Send p2p message "getdata" containing an invalid CInv message
+        getdatamsg = msg_getdata()
+        getdatamsg.inv = [CInv(msg_type, 1)]
+        with mininode_lock:
+            testnode.last_tx = None
+            testnode.last_notfound = None
+            testnode.send_message(getdatamsg)
+
+        # Sync up with node after p2p messages delivered
+        testnode.sync_with_ping()
+
+        # Verify that we get a reject message
+        expected = msg_reject()
+        expected.message = b"getdata"
+        expected.code = msg_reject.REJECT_MALFORMED
+        expected.reason = b"error parsing message"
+        assert_equal(conn.rejectMessage, expected)
+
+        # Verify that we see the expected error in the debug log of node 0
+        log_path = os.path.join(self.options.tmpdir, 'node0', 'regtest', 'debug.log')
+        with open(log_path, 'r', encoding='utf-8') as log_file:
+            log_content = log_file.read()
+
+        if expected_msg not in log_content:
+            raise AssertionError("Expected error \"" + expected_msg + "\" not found in:\n" + log_content)
+
+    def verify_disconnected(self, testnode, timeout=30):
+        sleep_time = 0.05
+        while timeout > 0:
+            with mininode_lock:
+                if testnode.conn_closed:
+                    return
+            time.sleep(sleep_time)
+            timeout -= sleep_time
+        fail("Should have received pong")
+
+    def run_test(self):
+        # Set up test nodes.
+        # - test_nodes[0] will only request v4 transactions
+        # - test_nodes[1] will only request v5 transactions
+        # - test_nodes[2] will test invalid v4 request using MSG_WTXID
+        # - test_nodes[3] will test invalid v5 request using MSG_TX
+        test_nodes = []
+        connections = []
+
+        for i in range(4):
+            test_nodes.append(TestNode())
+            connections.append(NodeConn(
+                '127.0.0.1', p2p_port(0), self.nodes[0], test_nodes[i],
+                protocol_version=NU5_PROTO_VERSION))
+            test_nodes[i].add_connection(connections[i])
+
+        NetworkThread().start() # Start up network handling in another thread
+        [x.wait_for_verack() for x in test_nodes]
+
+        net_version = self.nodes[0].getnetworkinfo()["protocolversion"]
+        if net_version < NU5_PROTO_VERSION:
+            # Sending a getdata message containing a MSG_WTX CInv message type
+            # results in a reject message.
+            self.verify_invalid_cinv(
+                test_nodes[0], connections[0], 5,
+                "Negotiated protocol version does not support CInv message type MSG_WTX",
+            )
+
+            # Sending a getdata message containing an invalid CInv message type
+            # results in a reject message.
+            self.verify_invalid_cinv(
+                test_nodes[1], connections[1], 0xffff, "Unknown CInv message type")
+
+            print("Node's block index is not NU5-aware, skipping remaining tests")
+            return
+
+        # Load funds into the Sprout address
+        sproutzaddr = self.nodes[0].z_getnewaddress('sprout')
+        result = self.nodes[2].z_shieldcoinbase("*", sproutzaddr, 0)
+        wait_and_assert_operationid_status(self.nodes[2], result['opid'])
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        # Activate NU5. Block height after this is 210.
+        self.nodes[0].generate(9)
+        self.sync_all()
+
+        # Add v4 transaction to the mempool.
+        node1_taddr = self.nodes[1].getnewaddress()
+        opid = self.nodes[0].z_sendmany(sproutzaddr, [{
+            'address': node1_taddr,
+            'amount': 1,
+        }])
+        v4_txid = uint256_from_str(hex_str_to_bytes(
+            wait_and_assert_operationid_status(self.nodes[0], opid)
+        )[::-1])
+
+        # Add v5 transaction to the mempool.
+        v5_txid = self.nodes[0].sendtoaddress(node1_taddr, 1, "", "", True)
+        v5_tx = self.nodes[0].getrawtransaction(v5_txid, 1)
+        assert_equal(v5_tx['version'], 5)
+        v5_txid = uint256_from_str(hex_str_to_bytes(v5_txid)[::-1])
+        v5_auth_digest = uint256_from_str(hex_str_to_bytes(v5_tx['authdigest'])[::-1])
+
+        # Wait for the mempools to sync.
+        self.sync_all()
+
+        #
+        # inv
+        #
+
+        # On a mempool request, nodes should return an inv message containing:
+        # - the v4 tx, with type MSG_TX.
+        # - the v5 tx, with type MSG_WTX.
+        for testnode in test_nodes:
+            self.verify_inv(testnode, [
+                self.cinv_for(v4_txid),
+                self.cinv_for(v5_txid, v5_auth_digest),
+            ])
+
+        #
+        # getdata
+        #
+
+        # We can request a v4 transaction with MSG_TX.
+        self.send_data_message(test_nodes[0], v4_txid)
+        self.verify_last_tx(test_nodes[0], v4_txid)
+
+        # We can request a v5 transaction with MSG_WTX.
+        self.send_data_message(test_nodes[1], v5_txid, v5_auth_digest)
+        self.verify_last_tx(test_nodes[1], v5_txid, v5_auth_digest)
+
+        # Requesting with a different authDigest results in a notfound.
+        self.send_data_message(test_nodes[1], v5_txid, 1)
+        self.verify_last_notfound(test_nodes[1], v5_txid, 1)
+
+        # Requesting a v4 transaction with MSG_WTX causes a disconnect.
+        self.send_data_message(test_nodes[2], v4_txid, (1 << 256) - 1)
+        self.verify_disconnected(test_nodes[2])
+
+        # Requesting a v5 transaction with MSG_TX causes a disconnect.
+        self.send_data_message(test_nodes[3], v5_txid)
+        self.verify_disconnected(test_nodes[3])
+
+        # Sending a getdata message containing an invalid CInv message type
+        # results in a reject message.
+        self.verify_invalid_cinv(
+            test_nodes[0], connections[0], 0xffff, "Unknown CInv message type")
+
+        [c.disconnect_node() for c in connections]
+
+if __name__ == '__main__':
+    Zip239Test().main()
diff --git a/depend/zcash/qa/rpc-tests/feature_zip244_blockcommitments.py b/depend/zcash/qa/rpc-tests/feature_zip244_blockcommitments.py
new file mode 100755
index 000000000..a0a5bde45
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/feature_zip244_blockcommitments.py
@@ -0,0 +1,68 @@
+#!/usr/bin/env python3
+# Copyright (c) 2020 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+
+from test_framework.blocktools import derive_block_commitments_hash
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    BLOSSOM_BRANCH_ID,
+    CANOPY_BRANCH_ID,
+    HEARTWOOD_BRANCH_ID,
+    NU5_BRANCH_ID,
+    assert_equal,
+    bytes_to_hex_str,
+    hex_str_to_bytes,
+    nuparams,
+    start_nodes,
+)
+
+TERMINATOR = b'\x00' * 32
+
+# Verify block header field 'hashLightClientRoot' is set correctly for NU5 blocks.
+class AuthDataRootTest(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 4
+
+    def setup_nodes(self):
+        return start_nodes(self.num_nodes, self.options.tmpdir, extra_args=[[
+            nuparams(BLOSSOM_BRANCH_ID, 201),
+            nuparams(HEARTWOOD_BRANCH_ID, 201),
+            nuparams(CANOPY_BRANCH_ID, 201),
+            nuparams(NU5_BRANCH_ID, 205),
+            '-nurejectoldversions=false',
+        ]] * self.num_nodes)
+
+    def run_test(self):
+        # Generate a block so we are on Canopy rules.
+        self.nodes[0].generate(2)
+        self.sync_all()
+
+        # For blocks prior to NU5 activation, the hashBlockCommitments field of
+        # the block header contains the root of the ZIP 221 history tree.
+        for i in range(3):
+            block_before = self.nodes[0].getblock('%d' % (202 + i))
+            assert_equal(block_before['blockcommitments'], block_before['chainhistoryroot'])
+
+            self.nodes[0].generate(1)
+            self.sync_all()
+
+        # From NU5 activation, the hashBlockCommitments field of the block
+        # header contains a hash of various block commitments (per ZIP 244).
+        for i in range(2):
+            block_after = self.nodes[0].getblock('%d' % (205 + i))
+            block_commitments = bytes_to_hex_str(derive_block_commitments_hash(
+                hex_str_to_bytes(block_after['chainhistoryroot'])[::-1],
+                hex_str_to_bytes(block_after['authdataroot'])[::-1],
+            )[::-1])
+            assert_equal(block_after['blockcommitments'], block_commitments)
+
+            self.nodes[0].generate(1)
+            self.sync_all()
+
+
+if __name__ == '__main__':
+    AuthDataRootTest().main()
diff --git a/depend/zcash/qa/rpc-tests/finalsaplingroot.py b/depend/zcash/qa/rpc-tests/finalsaplingroot.py
new file mode 100755
index 000000000..b028947c0
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/finalsaplingroot.py
@@ -0,0 +1,232 @@
+#!/usr/bin/env python3
+# Copyright (c) 2018 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    NU5_BRANCH_ID,
+    assert_equal,
+    connect_nodes_bi,
+    get_coinbase_address,
+    nuparams,
+    start_nodes,
+    wait_and_assert_operationid_status,
+)
+
+from decimal import Decimal
+
+SPROUT_TREE_EMPTY_ROOT = "59d2cde5e65c1414c32ba54f0fe4bdb3d67618125286e6a191317917c812c6d7"
+SAPLING_TREE_EMPTY_ROOT = "3e49b5f954aa9d3545bc6c37744661eea48d7c34e3000d82b7f0010c30f4c2fb"
+ORCHARD_TREE_EMPTY_ROOT = "2fd8e51a03d9bbe2dd809831b1497aeb68a6e37ddf707ced4aa2d8dff13529ae"
+NULL_FIELD = "0000000000000000000000000000000000000000000000000000000000000000"
+
+# Verify block header field 'hashFinalSaplingRoot' (returned in rpc as 'finalsaplingroot')
+# is updated when Sapling transactions with outputs (commitments) are mined into a block.
+class FinalSaplingRootTest(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 2
+        self.setup_clean_chain = True
+
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir, extra_args=[[
+            '-txindex',                # Avoid JSONRPC error: No information available about transaction
+            nuparams(NU5_BRANCH_ID, 210),
+            '-debug',
+            ]] * self.num_nodes)
+        connect_nodes_bi(self.nodes,0,1)
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test(self):
+        self.nodes[0].generate(200)
+        self.sync_all()
+
+        # Verify genesis block contains null field for what is now called the final sapling root field.
+        blk = self.nodes[0].getblock("0")
+        assert_equal(blk["finalsaplingroot"], NULL_FIELD)
+        treestate = self.nodes[0].z_gettreestate("0")
+        assert_equal(treestate["height"], 0)
+        assert_equal(treestate["hash"], self.nodes[0].getblockhash(0))
+
+        assert_equal(treestate["sprout"]["commitments"]["finalRoot"], SPROUT_TREE_EMPTY_ROOT)
+        assert_equal(treestate["sprout"]["commitments"]["finalState"], "000000")
+        assert "skipHash" not in treestate["sprout"]
+
+        assert_equal(treestate["sapling"]["commitments"]["finalRoot"], NULL_FIELD)
+        # There is no sapling state tree yet, and trying to find it in an earlier
+        # block won't succeed (we're at genesis block), so skipHash is absent.
+        assert "finalState" not in treestate["sapling"]
+        assert "skipHash" not in treestate["sapling"]
+
+        assert_equal(treestate["orchard"]["commitments"]["finalRoot"], NULL_FIELD)
+        # There is no orchard state tree yet, and trying to find it in an earlier
+        # block won't succeed (we're at genesis block), so skipHash is absent.
+        assert "finalState" not in treestate["orchard"]
+        assert "skipHash" not in treestate["orchard"]
+
+        # Verify all generated blocks contain the empty root of the Sapling tree.
+        blockcount = self.nodes[0].getblockcount()
+        for height in range(1, blockcount + 1):
+            blk = self.nodes[0].getblock(str(height))
+            assert_equal(blk["finalsaplingroot"], SAPLING_TREE_EMPTY_ROOT)
+
+            treestate = self.nodes[0].z_gettreestate(str(height))
+            assert_equal(treestate["height"], height)
+            assert_equal(treestate["hash"], self.nodes[0].getblockhash(height))
+
+            assert "skipHash" not in treestate["sprout"]
+            assert_equal(treestate["sprout"]["commitments"]["finalRoot"], SPROUT_TREE_EMPTY_ROOT)
+            assert_equal(treestate["sprout"]["commitments"]["finalState"], "000000")
+
+
+            assert "skipHash" not in treestate["sapling"]
+            assert_equal(treestate["sapling"]["commitments"]["finalRoot"], SAPLING_TREE_EMPTY_ROOT)
+            assert_equal(treestate["sapling"]["commitments"]["finalState"], "000000")
+
+            assert "skipHash" not in treestate["orchard"]
+            assert_equal(treestate["orchard"]["commitments"]["finalRoot"], NULL_FIELD)
+
+        # Node 0 shields some funds
+        taddr0 = get_coinbase_address(self.nodes[0])
+        saplingAddr0 = self.nodes[0].z_getnewaddress('sapling')
+        recipients = []
+        recipients.append({"address": saplingAddr0, "amount": Decimal('20')})
+        myopid = self.nodes[0].z_sendmany(taddr0, recipients, 1, 0)
+        mytxid = wait_and_assert_operationid_status(self.nodes[0], myopid)
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # Verify the final Sapling root has changed
+        blk = self.nodes[0].getblock("201")
+        root = blk["finalsaplingroot"]
+        assert root is not SAPLING_TREE_EMPTY_ROOT
+        assert root is not NULL_FIELD
+
+        # Verify there is a Sapling output description (its commitment was added to tree)
+        result = self.nodes[0].getrawtransaction(mytxid, 1)
+        assert_equal(len(result["vShieldedOutput"]), 1)
+
+        # Since there is a now sapling shielded input in the blockchain,
+        # the sapling values should have changed
+        new_treestate = self.nodes[0].z_gettreestate(str(-1))
+        assert_equal(new_treestate["sapling"]["commitments"]["finalRoot"], root)
+        assert_equal(new_treestate["sprout"], treestate["sprout"])
+        assert new_treestate["sapling"]["commitments"]["finalRoot"] != treestate["sapling"]["commitments"]["finalRoot"]
+        assert new_treestate["sapling"]["commitments"]["finalState"] != treestate["sapling"]["commitments"]["finalState"]
+        assert_equal(len(new_treestate["sapling"]["commitments"]["finalRoot"]), 64)
+        assert_equal(len(new_treestate["sapling"]["commitments"]["finalState"]), 70)
+        treestate = new_treestate
+
+        # Mine an empty block and verify the final Sapling root does not change
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+        assert_equal(root, self.nodes[0].getblock("202")["finalsaplingroot"])
+
+        # Mine a block with a transparent tx and verify the final Sapling root does not change
+        taddr1 = self.nodes[1].getnewaddress()
+        self.nodes[0].sendtoaddress(taddr1, Decimal("1.23"))
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        assert_equal(len(self.nodes[0].getblock("203")["tx"]), 2)
+        assert_equal(self.nodes[1].z_getbalance(taddr1), Decimal("1.23"))
+        assert_equal(root, self.nodes[0].getblock("203")["finalsaplingroot"])
+
+        # Mine a block with a Sprout shielded tx and verify the final Sapling root does not change
+        zaddr1 = self.nodes[1].z_getnewaddress('sprout')
+        result = self.nodes[0].z_shieldcoinbase(taddr0, zaddr1, 0, 1)
+        wait_and_assert_operationid_status(self.nodes[0], result['opid'])
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        assert_equal(len(self.nodes[0].getblock("204")["tx"]), 2)
+        assert_equal(self.nodes[1].z_getbalance(zaddr1), Decimal("10"))
+        assert_equal(root, self.nodes[0].getblock("204")["finalsaplingroot"])
+
+        new_treestate = self.nodes[0].z_gettreestate(str(-1))
+        assert_equal(new_treestate["sapling"]["commitments"]["finalRoot"], root)
+        assert_equal(new_treestate["sapling"], treestate["sapling"])
+        assert new_treestate["sprout"]["commitments"]["finalRoot"] != treestate["sprout"]["commitments"]["finalRoot"]
+        assert new_treestate["sprout"]["commitments"]["finalState"] != treestate["sprout"]["commitments"]["finalState"]
+        assert_equal(len(new_treestate["sprout"]["commitments"]["finalRoot"]), 64)
+        assert_equal(len(new_treestate["sprout"]["commitments"]["finalState"]), 134)
+        treestate = new_treestate
+
+        # Mine a block with a Sapling shielded recipient and verify the final Sapling root changes
+        saplingAddr1 = self.nodes[1].z_getnewaddress("sapling")
+        recipients = []
+        recipients.append({"address": saplingAddr1, "amount": Decimal('12.34')})
+        myopid = self.nodes[0].z_sendmany(saplingAddr0, recipients, 1, 0)
+        mytxid = wait_and_assert_operationid_status(self.nodes[0], myopid)
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        assert_equal(len(self.nodes[0].getblock("205")["tx"]), 2)
+        assert_equal(self.nodes[1].z_getbalance(saplingAddr1), Decimal("12.34"))
+        assert root is not self.nodes[0].getblock("205")["finalsaplingroot"]
+
+        # Verify there is a Sapling output description (its commitment was added to tree)
+        result = self.nodes[0].getrawtransaction(mytxid, 1)
+        assert_equal(len(result["vShieldedOutput"]), 2)  # there is Sapling shielded change
+
+        new_treestate = self.nodes[0].z_gettreestate(str(-1))
+        assert_equal(new_treestate["sprout"], treestate["sprout"])
+        assert new_treestate["sapling"]["commitments"]["finalRoot"] != treestate["sapling"]["commitments"]["finalRoot"]
+        assert new_treestate["sapling"]["commitments"]["finalState"] != treestate["sapling"]["commitments"]["finalState"]
+        assert_equal(len(new_treestate["sapling"]["commitments"]["finalRoot"]), 64)
+        assert_equal(len(new_treestate["sapling"]["commitments"]["finalState"]), 136)
+        treestate = new_treestate
+
+        # Mine a block with a Sapling shielded sender and transparent recipient and verify the final Sapling root doesn't change
+        taddr2 = self.nodes[0].getnewaddress()
+        recipients = []
+        recipients.append({"address": taddr2, "amount": Decimal('12.34')})
+        myopid = self.nodes[1].z_sendmany(saplingAddr1, recipients, 1, 0)
+        mytxid = wait_and_assert_operationid_status(self.nodes[1], myopid)
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        assert_equal(len(self.nodes[0].getblock("206")["tx"]), 2)
+        assert_equal(self.nodes[0].z_getbalance(taddr2), Decimal("12.34"))
+
+        blk = self.nodes[0].getblock("206")
+        root = blk["finalsaplingroot"]
+        assert_equal(root, self.nodes[0].getblock("205")["finalsaplingroot"])
+
+        new_treestate = self.nodes[0].z_gettreestate(str(-1))
+        assert_equal(new_treestate["sprout"], treestate["sprout"])
+        assert_equal(new_treestate["sapling"], treestate["sapling"])
+
+        # Activate NU5; more testing should be added once we can mine orchard transactions.
+        self.sync_all()
+        self.nodes[0].generate(4)
+        self.sync_all()
+        new_treestate = self.nodes[0].z_gettreestate(str(-1))
+
+        # sprout and sapling results should not change
+        assert_equal(new_treestate["sprout"], treestate["sprout"])
+        assert_equal(new_treestate["sapling"], treestate["sapling"])
+
+        assert "skipHash" not in treestate["orchard"]
+        assert_equal(new_treestate["orchard"]["commitments"]["finalRoot"], ORCHARD_TREE_EMPTY_ROOT)
+        assert_equal(new_treestate["orchard"]["commitments"]["finalState"], "000000")
+        pass
+
+
+if __name__ == '__main__':
+    FinalSaplingRootTest().main()
diff --git a/depend/zcash/qa/rpc-tests/forknotify.py b/depend/zcash/qa/rpc-tests/forknotify.py
new file mode 100755
index 000000000..b97d1fb77
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/forknotify.py
@@ -0,0 +1,68 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Test -alertnotify 
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import start_node, connect_nodes
+
+import os
+
+class ForkNotifyTest(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 2
+        self.setup_clean_chain = False
+
+    alert_filename = None  # Set by setup_network
+
+    def setup_network(self):
+        self.nodes = []
+        self.alert_filename = os.path.join(self.options.tmpdir, "alert.txt")
+        with open(self.alert_filename, 'w', encoding='utf8'):
+            pass  # Just open then close to create zero-length file
+        self.nodes.append(start_node(0, self.options.tmpdir,
+                            ["-blockversion=2", "-alertnotify=echo %s >> \"" + self.alert_filename + "\""]))
+        # Node1 mines block.version=211 blocks
+        self.nodes.append(start_node(1, self.options.tmpdir,
+                                ["-blockversion=211"]))
+        connect_nodes(self.nodes[1], 0)
+
+        self.is_network_split = False
+        self.sync_all()
+
+    def run_test(self):
+        # Mine 51 up-version blocks
+        self.nodes[1].generate(51)
+        self.sync_all()
+        # -alertnotify should trigger on the 51'st,
+        # but mine and sync another to give
+        # -alertnotify time to write
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        with open(self.alert_filename, 'r', encoding='utf8') as f:
+            alert_text = f.read()
+
+        if len(alert_text) == 0:
+            raise AssertionError("-alertnotify did not warn of up-version blocks")
+
+        # Mine more up-version blocks, should not get more alerts:
+        self.nodes[1].generate(1)
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        with open(self.alert_filename, 'r', encoding='utf8') as f:
+            alert_text2 = f.read()
+
+        if alert_text != alert_text2:
+            raise AssertionError("-alertnotify excessive warning of up-version blocks")
+
+if __name__ == '__main__':
+    ForkNotifyTest().main()
diff --git a/depend/zcash/qa/rpc-tests/framework.py b/depend/zcash/qa/rpc-tests/framework.py
new file mode 100755
index 000000000..7a6765160
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/framework.py
@@ -0,0 +1,51 @@
+#!/usr/bin/env python3
+# Copyright (c) 2020 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    assert_raises,
+    connect_nodes,
+    start_node,
+    check_node_log,
+)
+
+class FrameworkTest (BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 2
+        self.setup_clean_chain = True
+
+    def start_node_with(self, index, extra_args=[]):
+        args = []
+        return start_node(index, self.options.tmpdir, args + extra_args)
+
+    def setup_network(self, split=False):
+        self.nodes = []
+        self.nodes.append(self.start_node_with(0))
+        self.nodes.append(self.start_node_with(1))
+        connect_nodes(self.nodes[1], 0)
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test (self):
+
+        # Test the check_node_log utility function
+        string_to_find = "Zcash version"
+        check_node_log(self, 1, string_to_find)
+
+        # Node 1 was stopped to check the logs, need to be restarted
+        self.nodes[1] = self.start_node_with(1, [])
+        connect_nodes(self.nodes[1], 0)
+
+        assert_raises(AssertionError, check_node_log, self, 1, "Will not be found")
+
+        # Need to start node 1 before leaving the test
+        self.nodes[1] = self.start_node_with(1, [])
+        connect_nodes(self.nodes[1], 0)
+
+
+if __name__ == '__main__':
+    FrameworkTest().main()
diff --git a/depend/zcash/qa/rpc-tests/fundrawtransaction.py b/depend/zcash/qa/rpc-tests/fundrawtransaction.py
new file mode 100755
index 000000000..f75470306
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/fundrawtransaction.py
@@ -0,0 +1,606 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.authproxy import JSONRPCException
+from test_framework.util import assert_equal, assert_greater_than, \
+    start_nodes, connect_nodes_bi, stop_nodes, \
+    wait_bitcoinds
+
+from decimal import Decimal
+
+# Create one-input, one-output, no-fee transaction:
+class RawTransactionsTest(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.setup_clean_chain = True
+        self.num_nodes = 4
+
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir,
+                           extra_args=[['-experimentalfeatures', '-developerencryptwallet']] * 4)
+
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,0,2)
+        connect_nodes_bi(self.nodes,0,3)
+
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test(self):
+        print("Mining blocks...")
+
+        min_relay_tx_fee = self.nodes[0].getnetworkinfo()['relayfee']
+        # if the fee's positive delta is higher than this value tests will fail,
+        # neg. delta always fail the tests.
+        # The size of the signature of every input may be at most 2 bytes larger
+        # than a minimum sized signature.
+
+        #            = 2 bytes * minRelayTxFeePerByte
+        feeTolerance = max(2 * min_relay_tx_fee/1000, Decimal("0.00000001"))
+
+        self.nodes[2].generate(1)
+        self.sync_all()
+        self.nodes[0].generate(201)
+        self.sync_all()
+
+        watchonly_address = self.nodes[0].getnewaddress()
+        watchonly_pubkey = self.nodes[0].validateaddress(watchonly_address)["pubkey"]
+        watchonly_amount = Decimal(200)
+        self.nodes[3].importpubkey(watchonly_pubkey, "", True)
+        watchonly_txid = self.nodes[0].sendtoaddress(watchonly_address, watchonly_amount)
+        self.nodes[0].sendtoaddress(self.nodes[3].getnewaddress(), watchonly_amount / 10)
+
+        self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(),1.5)
+        self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(),1.0)
+        self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(),5.0)
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        ###############
+        # simple test #
+        ###############
+        inputs  = [ ]
+        outputs = { self.nodes[0].getnewaddress() : 1.0 }
+        rawtx   = self.nodes[2].createrawtransaction(inputs, outputs)
+        dec_tx  = self.nodes[2].decoderawtransaction(rawtx)
+        rawtxfund = self.nodes[2].fundrawtransaction(rawtx)
+        fee = rawtxfund['fee']
+        dec_tx  = self.nodes[2].decoderawtransaction(rawtxfund['hex'])
+        assert_equal(len(dec_tx['vin']) > 0, True) #test if we have enough inputs
+
+        ##############################
+        # simple test with two coins #
+        ##############################
+        inputs  = [ ]
+        outputs = { self.nodes[0].getnewaddress() : 2.2 }
+        rawtx   = self.nodes[2].createrawtransaction(inputs, outputs)
+        dec_tx  = self.nodes[2].decoderawtransaction(rawtx)
+
+        rawtxfund = self.nodes[2].fundrawtransaction(rawtx)
+        fee = rawtxfund['fee']
+        dec_tx  = self.nodes[2].decoderawtransaction(rawtxfund['hex'])
+        assert_equal(len(dec_tx['vin']) > 0, True) #test if we have enough inputs
+
+        ##############################
+        # simple test with two coins #
+        ##############################
+        inputs  = [ ]
+        outputs = { self.nodes[0].getnewaddress() : 2.6 }
+        rawtx   = self.nodes[2].createrawtransaction(inputs, outputs)
+        dec_tx  = self.nodes[2].decoderawtransaction(rawtx)
+
+        rawtxfund = self.nodes[2].fundrawtransaction(rawtx)
+        fee = rawtxfund['fee']
+        dec_tx  = self.nodes[2].decoderawtransaction(rawtxfund['hex'])
+        assert_equal(len(dec_tx['vin']) > 0, True)
+        assert_equal(dec_tx['vin'][0]['scriptSig']['hex'], '')
+
+
+        ################################
+        # simple test with two outputs #
+        ################################
+        inputs  = [ ]
+        outputs = { self.nodes[0].getnewaddress() : 2.6, self.nodes[1].getnewaddress() : 2.5 }
+        rawtx   = self.nodes[2].createrawtransaction(inputs, outputs)
+        dec_tx  = self.nodes[2].decoderawtransaction(rawtx)
+
+        rawtxfund = self.nodes[2].fundrawtransaction(rawtx)
+        fee = rawtxfund['fee']
+        dec_tx  = self.nodes[2].decoderawtransaction(rawtxfund['hex'])
+        totalOut = 0
+        for out in dec_tx['vout']:
+            totalOut += out['value']
+
+        assert_equal(len(dec_tx['vin']) > 0, True)
+        assert_equal(dec_tx['vin'][0]['scriptSig']['hex'], '')
+
+
+        #########################################################################
+        # test a fundrawtransaction with a VIN greater than the required amount #
+        #########################################################################
+        utx = False
+        listunspent = self.nodes[2].listunspent()
+        for aUtx in listunspent:
+            if aUtx['amount'] == 5.0:
+                utx = aUtx
+                break
+
+        assert_equal(utx!=False, True)
+
+        inputs  = [ {'txid' : utx['txid'], 'vout' : utx['vout']}]
+        outputs = { self.nodes[0].getnewaddress() : Decimal('1.0') }
+        rawtx   = self.nodes[2].createrawtransaction(inputs, outputs)
+        dec_tx  = self.nodes[2].decoderawtransaction(rawtx)
+        assert_equal(utx['txid'], dec_tx['vin'][0]['txid'])
+
+        rawtxfund = self.nodes[2].fundrawtransaction(rawtx)
+        fee = rawtxfund['fee']
+        dec_tx  = self.nodes[2].decoderawtransaction(rawtxfund['hex'])
+        totalOut = 0
+        for out in dec_tx['vout']:
+            totalOut += out['value']
+
+        assert_equal(fee + totalOut, utx['amount']) #compare vin total and totalout+fee
+
+
+        #####################################################################
+        # test a fundrawtransaction with which will not get a change output #
+        #####################################################################
+        utx = False
+        listunspent = self.nodes[2].listunspent()
+        for aUtx in listunspent:
+            if aUtx['amount'] == 5.0:
+                utx = aUtx
+                break
+
+        assert_equal(utx!=False, True)
+
+        inputs  = [ {'txid' : utx['txid'], 'vout' : utx['vout']}]
+        outputs = { self.nodes[0].getnewaddress() : Decimal('5.0') - fee - feeTolerance }
+        rawtx   = self.nodes[2].createrawtransaction(inputs, outputs)
+        dec_tx  = self.nodes[2].decoderawtransaction(rawtx)
+        assert_equal(utx['txid'], dec_tx['vin'][0]['txid'])
+
+        rawtxfund = self.nodes[2].fundrawtransaction(rawtx)
+        fee = rawtxfund['fee']
+        dec_tx  = self.nodes[2].decoderawtransaction(rawtxfund['hex'])
+        totalOut = 0
+        for out in dec_tx['vout']:
+            totalOut += out['value']
+
+        assert_equal(rawtxfund['changepos'], -1)
+        assert_equal(fee + totalOut, utx['amount']) #compare vin total and totalout+fee
+
+
+        #########################################################################
+        # test a fundrawtransaction with a VIN smaller than the required amount #
+        #########################################################################
+        utx = False
+        listunspent = self.nodes[2].listunspent()
+        for aUtx in listunspent:
+            if aUtx['amount'] == 1.0:
+                utx = aUtx
+                break
+
+        assert_equal(utx!=False, True)
+
+        inputs  = [ {'txid' : utx['txid'], 'vout' : utx['vout']}]
+        outputs = { self.nodes[0].getnewaddress() : Decimal('1.0') }
+        rawtx   = self.nodes[2].createrawtransaction(inputs, outputs)
+
+        # 4-byte version + 4-byte versionGroupId + 1-byte vin count + 36-byte prevout then script_len
+        rawtx = rawtx[:90] + "0100" + rawtx[92:]
+
+        dec_tx  = self.nodes[2].decoderawtransaction(rawtx)
+        assert_equal(utx['txid'], dec_tx['vin'][0]['txid'])
+        assert_equal("00", dec_tx['vin'][0]['scriptSig']['hex'])
+
+        rawtxfund = self.nodes[2].fundrawtransaction(rawtx)
+        fee = rawtxfund['fee']
+        dec_tx  = self.nodes[2].decoderawtransaction(rawtxfund['hex'])
+        totalOut = 0
+        matchingOuts = 0
+        for i, out in enumerate(dec_tx['vout']):
+            totalOut += out['value']
+            if out['scriptPubKey']['addresses'][0] in outputs:
+                matchingOuts+=1
+            else:
+                assert_equal(i, rawtxfund['changepos'])
+
+        assert_equal(utx['txid'], dec_tx['vin'][0]['txid'])
+        assert_equal("00", dec_tx['vin'][0]['scriptSig']['hex'])
+
+        assert_equal(matchingOuts, 1)
+        assert_equal(len(dec_tx['vout']), 2)
+
+
+        ###########################################
+        # test a fundrawtransaction with two VINs #
+        ###########################################
+        utx  = False
+        utx2 = False
+        listunspent = self.nodes[2].listunspent()
+        for aUtx in listunspent:
+            if aUtx['amount'] == 1.0:
+                utx = aUtx
+            if aUtx['amount'] == 5.0:
+                utx2 = aUtx
+
+
+        assert_equal(utx!=False, True)
+
+        inputs  = [ {'txid' : utx['txid'], 'vout' : utx['vout']},{'txid' : utx2['txid'], 'vout' : utx2['vout']} ]
+        outputs = { self.nodes[0].getnewaddress() : 6.0 }
+        rawtx   = self.nodes[2].createrawtransaction(inputs, outputs)
+        dec_tx  = self.nodes[2].decoderawtransaction(rawtx)
+        assert_equal(utx['txid'], dec_tx['vin'][0]['txid'])
+
+        rawtxfund = self.nodes[2].fundrawtransaction(rawtx)
+        fee = rawtxfund['fee']
+        dec_tx  = self.nodes[2].decoderawtransaction(rawtxfund['hex'])
+        totalOut = 0
+        matchingOuts = 0
+        for out in dec_tx['vout']:
+            totalOut += out['value']
+            if out['scriptPubKey']['addresses'][0] in outputs:
+                matchingOuts+=1
+
+        assert_equal(matchingOuts, 1)
+        assert_equal(len(dec_tx['vout']), 2)
+
+        matchingIns = 0
+        for vinOut in dec_tx['vin']:
+            for vinIn in inputs:
+                if vinIn['txid'] == vinOut['txid']:
+                    matchingIns+=1
+
+        assert_equal(matchingIns, 2) #we now must see two vins identical to vins given as params
+
+        #########################################################
+        # test a fundrawtransaction with two VINs and two vOUTs #
+        #########################################################
+        utx  = False
+        utx2 = False
+        listunspent = self.nodes[2].listunspent()
+        for aUtx in listunspent:
+            if aUtx['amount'] == 1.0:
+                utx = aUtx
+            if aUtx['amount'] == 5.0:
+                utx2 = aUtx
+
+
+        assert_equal(utx!=False, True)
+
+        inputs  = [ {'txid' : utx['txid'], 'vout' : utx['vout']},{'txid' : utx2['txid'], 'vout' : utx2['vout']} ]
+        outputs = { self.nodes[0].getnewaddress() : 6.0, self.nodes[0].getnewaddress() : 1.0 }
+        rawtx   = self.nodes[2].createrawtransaction(inputs, outputs)
+        dec_tx  = self.nodes[2].decoderawtransaction(rawtx)
+        assert_equal(utx['txid'], dec_tx['vin'][0]['txid'])
+
+        rawtxfund = self.nodes[2].fundrawtransaction(rawtx)
+        fee = rawtxfund['fee']
+        dec_tx  = self.nodes[2].decoderawtransaction(rawtxfund['hex'])
+        totalOut = 0
+        matchingOuts = 0
+        for out in dec_tx['vout']:
+            totalOut += out['value']
+            if out['scriptPubKey']['addresses'][0] in outputs:
+                matchingOuts+=1
+
+        assert_equal(matchingOuts, 2)
+        assert_equal(len(dec_tx['vout']), 3)
+
+        ##############################################
+        # test a fundrawtransaction with invalid vin #
+        ##############################################
+        listunspent = self.nodes[2].listunspent()
+        inputs  = [ {'txid' : "1c7f966dab21119bac53213a2bc7532bff1fa844c124fd750a7d0b1332440bd1", 'vout' : 0} ] #invalid vin!
+        outputs = { self.nodes[0].getnewaddress() : 1.0}
+        rawtx   = self.nodes[2].createrawtransaction(inputs, outputs)
+        dec_tx  = self.nodes[2].decoderawtransaction(rawtx)
+
+        errorString = ""
+        try:
+            rawtxfund = self.nodes[2].fundrawtransaction(rawtx)
+        except JSONRPCException as e:
+            errorString = e.error['message']
+
+        assert_equal("Insufficient" in errorString, True)
+
+
+
+        ############################################################
+        #compare fee of a standard pubkeyhash transaction
+        inputs = []
+        outputs = {self.nodes[1].getnewaddress():1.1}
+        rawTx = self.nodes[0].createrawtransaction(inputs, outputs)
+        fundedTx = self.nodes[0].fundrawtransaction(rawTx)
+
+        #create same transaction over sendtoaddress
+        txId = self.nodes[0].sendtoaddress(self.nodes[1].getnewaddress(), 1.1)
+        signedFee = self.nodes[0].getrawmempool(True)[txId]['fee']
+
+        #compare fee
+        feeDelta = Decimal(fundedTx['fee']) - Decimal(signedFee)
+        assert(feeDelta >= 0 and feeDelta <= feeTolerance)
+        ############################################################
+
+        ############################################################
+        #compare fee of a standard pubkeyhash transaction with multiple outputs
+        inputs = []
+        outputs = {self.nodes[1].getnewaddress():1.1,self.nodes[1].getnewaddress():1.2,self.nodes[1].getnewaddress():0.1,self.nodes[1].getnewaddress():1.3,self.nodes[1].getnewaddress():0.2,self.nodes[1].getnewaddress():0.3}
+        rawTx = self.nodes[0].createrawtransaction(inputs, outputs)
+        fundedTx = self.nodes[0].fundrawtransaction(rawTx)
+        #create same transaction over sendtoaddress
+        txId = self.nodes[0].sendmany("", outputs)
+        signedFee = self.nodes[0].getrawmempool(True)[txId]['fee']
+
+        #compare fee
+        feeDelta = Decimal(fundedTx['fee']) - Decimal(signedFee)
+        assert(feeDelta >= 0 and feeDelta <= feeTolerance)
+        ############################################################
+
+
+        ############################################################
+        #compare fee of a 2of2 multisig p2sh transaction
+
+        # create 2of2 addr
+        addr1 = self.nodes[1].getnewaddress()
+        addr2 = self.nodes[1].getnewaddress()
+
+        addr1Obj = self.nodes[1].validateaddress(addr1)
+        addr2Obj = self.nodes[1].validateaddress(addr2)
+
+        mSigObj = self.nodes[1].addmultisigaddress(2, [addr1Obj['pubkey'], addr2Obj['pubkey']])
+
+        inputs = []
+        outputs = {mSigObj:1.1}
+        rawTx = self.nodes[0].createrawtransaction(inputs, outputs)
+        fundedTx = self.nodes[0].fundrawtransaction(rawTx)
+
+        #create same transaction over sendtoaddress
+        txId = self.nodes[0].sendtoaddress(mSigObj, 1.1)
+        signedFee = self.nodes[0].getrawmempool(True)[txId]['fee']
+
+        #compare fee
+        feeDelta = Decimal(fundedTx['fee']) - Decimal(signedFee)
+        assert(feeDelta >= 0 and feeDelta <= feeTolerance)
+        ############################################################
+
+
+        ############################################################
+        #compare fee of a standard pubkeyhash transaction
+
+        # create 4of5 addr
+        addr1 = self.nodes[1].getnewaddress()
+        addr2 = self.nodes[1].getnewaddress()
+        addr3 = self.nodes[1].getnewaddress()
+        addr4 = self.nodes[1].getnewaddress()
+        addr5 = self.nodes[1].getnewaddress()
+
+        addr1Obj = self.nodes[1].validateaddress(addr1)
+        addr2Obj = self.nodes[1].validateaddress(addr2)
+        addr3Obj = self.nodes[1].validateaddress(addr3)
+        addr4Obj = self.nodes[1].validateaddress(addr4)
+        addr5Obj = self.nodes[1].validateaddress(addr5)
+
+        mSigObj = self.nodes[1].addmultisigaddress(4, [addr1Obj['pubkey'], addr2Obj['pubkey'], addr3Obj['pubkey'], addr4Obj['pubkey'], addr5Obj['pubkey']])
+
+        inputs = []
+        outputs = {mSigObj:1.1}
+        rawTx = self.nodes[0].createrawtransaction(inputs, outputs)
+        fundedTx = self.nodes[0].fundrawtransaction(rawTx)
+
+        #create same transaction over sendtoaddress
+        txId = self.nodes[0].sendtoaddress(mSigObj, 1.1)
+        signedFee = self.nodes[0].getrawmempool(True)[txId]['fee']
+
+        #compare fee
+        feeDelta = Decimal(fundedTx['fee']) - Decimal(signedFee)
+        assert(feeDelta >= 0 and feeDelta <= feeTolerance)
+        ############################################################
+
+
+        ############################################################
+        # spend a 2of2 multisig transaction over fundraw
+
+        # create 2of2 addr
+        addr1 = self.nodes[2].getnewaddress()
+        addr2 = self.nodes[2].getnewaddress()
+
+        addr1Obj = self.nodes[2].validateaddress(addr1)
+        addr2Obj = self.nodes[2].validateaddress(addr2)
+
+        mSigObj = self.nodes[2].addmultisigaddress(2, [addr1Obj['pubkey'], addr2Obj['pubkey']])
+
+
+        # send 1.2 BTC to msig addr
+        txId = self.nodes[0].sendtoaddress(mSigObj, 1.2)
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        oldBalance = self.nodes[1].getbalance()
+        inputs = []
+        outputs = {self.nodes[1].getnewaddress():1.1}
+        rawTx = self.nodes[2].createrawtransaction(inputs, outputs)
+        fundedTx = self.nodes[2].fundrawtransaction(rawTx)
+
+        signedTx = self.nodes[2].signrawtransaction(fundedTx['hex'])
+        txId = self.nodes[2].sendrawtransaction(signedTx['hex'])
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        # make sure funds are received at node1
+        assert_equal(oldBalance+Decimal('1.10000000'), self.nodes[1].getbalance())
+
+        ############################################################
+        # locked wallet test
+        self.nodes[1].encryptwallet("test")
+        self.nodes.pop(1)
+        stop_nodes(self.nodes)
+        wait_bitcoinds()
+
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir)
+
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,0,2)
+        connect_nodes_bi(self.nodes,0,3)
+        self.is_network_split=False
+        self.sync_all()
+
+        error = False
+        try:
+            self.nodes[1].sendtoaddress(self.nodes[0].getnewaddress(), 1.2)
+        except:
+            error = True
+        assert(error)
+
+        oldBalance = self.nodes[0].getbalance()
+
+        inputs = []
+        outputs = {self.nodes[0].getnewaddress():1.1}
+        rawTx = self.nodes[1].createrawtransaction(inputs, outputs)
+        fundedTx = self.nodes[1].fundrawtransaction(rawTx)
+
+        #now we need to unlock
+        self.nodes[1].walletpassphrase("test", 100)
+        signedTx = self.nodes[1].signrawtransaction(fundedTx['hex'])
+        txId = self.nodes[1].sendrawtransaction(signedTx['hex'])
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        # make sure funds are received at node1
+        assert_equal(oldBalance+Decimal('11.10000000'), self.nodes[0].getbalance())
+
+
+        ###############################################
+        # multiple (~19) inputs tx test | Compare fee #
+        ###############################################
+
+        #empty node1, send some small coins from node0 to node1
+        self.nodes[1].sendtoaddress(self.nodes[0].getnewaddress(), self.nodes[1].getbalance(), "", "", True)
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        for i in range(0,20):
+            self.nodes[0].sendtoaddress(self.nodes[1].getnewaddress(), 0.01)
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        #fund a tx with ~20 small inputs
+        inputs = []
+        outputs = {self.nodes[0].getnewaddress():0.15,self.nodes[0].getnewaddress():0.04}
+        rawTx = self.nodes[1].createrawtransaction(inputs, outputs)
+        fundedTx = self.nodes[1].fundrawtransaction(rawTx)
+
+        #create same transaction over sendtoaddress
+        txId = self.nodes[1].sendmany("", outputs)
+        signedFee = self.nodes[1].getrawmempool(True)[txId]['fee']
+
+        #compare fee
+        feeDelta = Decimal(fundedTx['fee']) - Decimal(signedFee)
+        assert(feeDelta >= 0 and feeDelta <= feeTolerance*19) #~19 inputs
+
+
+        #############################################
+        # multiple (~19) inputs tx test | sign/send #
+        #############################################
+
+        #again, empty node1, send some small coins from node0 to node1
+        self.nodes[1].sendtoaddress(self.nodes[0].getnewaddress(), self.nodes[1].getbalance(), "", "", True)
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        for i in range(0,20):
+            self.nodes[0].sendtoaddress(self.nodes[1].getnewaddress(), 0.01)
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        #fund a tx with ~20 small inputs
+        oldBalance = self.nodes[0].getbalance()
+
+        inputs = []
+        outputs = {self.nodes[0].getnewaddress():0.15,self.nodes[0].getnewaddress():0.04}
+        rawTx = self.nodes[1].createrawtransaction(inputs, outputs)
+        fundedTx = self.nodes[1].fundrawtransaction(rawTx)
+        fundedAndSignedTx = self.nodes[1].signrawtransaction(fundedTx['hex'])
+        txId = self.nodes[1].sendrawtransaction(fundedAndSignedTx['hex'])
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+        assert_equal(oldBalance+Decimal('10.19000000'), self.nodes[0].getbalance()) #0.19+block reward
+
+        #####################################################
+        # test fundrawtransaction with OP_RETURN and no vin #
+        #####################################################
+
+        rawtx   = "0100000000010000000000000000066a047465737400000000"
+        dec_tx  = self.nodes[2].decoderawtransaction(rawtx)
+
+        assert_equal(len(dec_tx['vin']), 0)
+        assert_equal(len(dec_tx['vout']), 1)
+
+        rawtxfund = self.nodes[2].fundrawtransaction(rawtx)
+        dec_tx  = self.nodes[2].decoderawtransaction(rawtxfund['hex'])
+
+        assert_greater_than(len(dec_tx['vin']), 0) # at least one vin
+        assert_equal(len(dec_tx['vout']), 2) # one change output added
+
+
+        ##################################################
+        # test a fundrawtransaction using only watchonly #
+        ##################################################
+
+        inputs = []
+        outputs = {self.nodes[2].getnewaddress() : watchonly_amount / 2}
+        rawtx = self.nodes[3].createrawtransaction(inputs, outputs)
+
+        result = self.nodes[3].fundrawtransaction(rawtx, True)
+        res_dec = self.nodes[0].decoderawtransaction(result["hex"])
+        assert_equal(len(res_dec["vin"]), 1)
+        assert_equal(res_dec["vin"][0]["txid"], watchonly_txid)
+
+        assert_equal("fee" in result.keys(), True)
+        assert_greater_than(result["changepos"], -1)
+
+        ###############################################################
+        # test fundrawtransaction using the entirety of watched funds #
+        ###############################################################
+
+        inputs = []
+        outputs = {self.nodes[2].getnewaddress() : watchonly_amount}
+        rawtx = self.nodes[3].createrawtransaction(inputs, outputs)
+
+        result = self.nodes[3].fundrawtransaction(rawtx, True)
+        res_dec = self.nodes[0].decoderawtransaction(result["hex"])
+        assert_equal(len(res_dec["vin"]), 2)
+        assert(res_dec["vin"][0]["txid"] == watchonly_txid or res_dec["vin"][1]["txid"] == watchonly_txid)
+
+        assert_greater_than(result["fee"], 0)
+        assert_greater_than(result["changepos"], -1)
+        assert_equal(result["fee"] + res_dec["vout"][result["changepos"]]["value"], watchonly_amount / 10)
+
+        signedtx = self.nodes[3].signrawtransaction(result["hex"])
+        assert(not signedtx["complete"])
+        signedtx = self.nodes[0].signrawtransaction(signedtx["hex"])
+        assert(signedtx["complete"])
+        self.nodes[0].sendrawtransaction(signedtx["hex"])
+
+
+if __name__ == '__main__':
+    RawTransactionsTest().main()
diff --git a/depend/zcash/qa/rpc-tests/getblocktemplate.py b/depend/zcash/qa/rpc-tests/getblocktemplate.py
new file mode 100755
index 000000000..ac2240b67
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/getblocktemplate.py
@@ -0,0 +1,214 @@
+#!/usr/bin/env python3
+# Copyright (c) 2016 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from io import BytesIO
+import codecs
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    assert_equal,
+    CANOPY_BRANCH_ID,
+    NU5_BRANCH_ID,
+    get_coinbase_address,
+    hex_str_to_bytes,
+    nuparams,
+    nustr,
+    start_nodes,
+    wait_and_assert_operationid_status,
+)
+from test_framework.mininode import (
+    CTransaction,
+)
+from test_framework.blocktools import (
+    create_block
+)
+from decimal import Decimal
+
+class GetBlockTemplateTest(BitcoinTestFramework):
+    '''
+    Test getblocktemplate, ensure that a block created from its result
+    can be submitted and accepted.
+    '''
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 1
+        self.setup_clean_chain = True
+
+    def setup_network(self, split=False):
+        args = [
+            nuparams(CANOPY_BRANCH_ID, 115),
+            nuparams(NU5_BRANCH_ID, 130),
+        ]
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir, [args] * self.num_nodes)
+        self.is_network_split = False
+        self.node = self.nodes[0]
+
+    def add_nu5_v4_tx_to_mempool(self):
+        node = self.node
+        # sprout to transparent (v4)
+        recipients = [{"address": self.transparent_addr, "amount": Decimal('0.1')}]
+        myopid = node.z_sendmany(self.sprout_addr, recipients, 1)
+        wait_and_assert_operationid_status(node, myopid)
+
+    def add_nu5_v5_tx_to_mempool(self):
+        node = self.node
+        recipients = [{"address": self.unified_addr, "amount": Decimal('9.99999')}]
+        myopid = node.z_sendmany(get_coinbase_address(node), recipients, 1, Decimal('0.00001'), 'AllowRevealedSenders')
+        wait_and_assert_operationid_status(node, myopid)
+
+    def add_transparent_tx_to_mempool(self):
+        node = self.node
+        # transparent to transparent (v5 after nu5)
+        outputs = {self.transparent_addr: 0.1}
+        node.sendmany('', outputs)
+
+    def gbt_submitblock(self, nu5_active):
+        node = self.node
+        mempool_tx_list = node.getrawmempool()
+
+        gbt = node.getblocktemplate()
+
+        # make sure no transactions were left out (or added)
+        assert_equal(len(mempool_tx_list), len(gbt['transactions']))
+        assert_equal(set(mempool_tx_list), set([tx['hash'] for tx in gbt['transactions']]))
+
+        prevhash = int(gbt['previousblockhash'], 16)
+        nTime = gbt['mintime']
+        nBits = int(gbt['bits'], 16)
+
+        if nu5_active:
+            blockcommitmentshash = int(gbt['defaultroots']['blockcommitmentshash'], 16)
+        else:
+            blockcommitmentshash = int(gbt['defaultroots']['chainhistoryroot'], 16)
+            assert 'blockcommitmentshash' not in gbt['defaultroots']
+        # Confirm that the legacy fields match this default value.
+        assert_equal(blockcommitmentshash, int(gbt['blockcommitmentshash'], 16))
+        assert_equal(blockcommitmentshash, int(gbt['lightclientroothash'], 16))
+        assert_equal(blockcommitmentshash, int(gbt['finalsaplingroothash'], 16))
+
+        f = BytesIO(hex_str_to_bytes(gbt['coinbasetxn']['data']))
+        coinbase = CTransaction()
+        coinbase.deserialize(f)
+        coinbase.calc_sha256()
+        assert_equal(coinbase.hash, gbt['coinbasetxn']['hash'])
+        assert_equal(coinbase.auth_digest_hex, gbt['coinbasetxn']['authdigest'])
+
+        block = create_block(prevhash, coinbase, nTime, nBits, blockcommitmentshash)
+
+        # copy the non-coinbase transactions from the block template to the block
+        for gbt_tx in gbt['transactions']:
+            f = BytesIO(hex_str_to_bytes(gbt_tx['data']))
+            tx = CTransaction()
+            tx.deserialize(f)
+            tx.calc_sha256()
+            assert_equal(tx.hash, gbt_tx['hash'])
+            assert_equal(tx.auth_digest_hex, node.getrawtransaction(tx.hash, 1)['authdigest'])
+            block.vtx.append(tx)
+        block.hashMerkleRoot = int(gbt['defaultroots']['merkleroot'], 16)
+        assert_equal(block.hashMerkleRoot, block.calc_merkle_root(), "merkleroot")
+        assert_equal(len(block.vtx), len(gbt['transactions']) + 1, "number of transactions")
+        assert_equal(block.hashPrevBlock, int(gbt['previousblockhash'], 16), "prevhash")
+        if nu5_active:
+            block.hashAuthDataRoot = int(gbt['defaultroots']['authdataroot'], 16)
+            assert_equal(block.hashAuthDataRoot, block.calc_auth_data_root(), "authdataroot")
+        else:
+            assert 'authdataroot' not in gbt['defaultroots']
+        block.solve()
+        block.calc_sha256()
+
+        submitblock_reply = node.submitblock(codecs.encode(block.serialize(), 'hex_codec'))
+        assert_equal(None, submitblock_reply)
+        assert_equal(block.hash, node.getbestblockhash())
+        # Wait until the wallet has been notified of all blocks, so that it doesn't try to
+        # double-spend transparent coins in subsequent test phases.
+        self.sync_all()
+
+    def run_test(self):
+        node = self.node
+
+        # Generate Sprout funds before Canopy activates; using the Sprout address will
+        # force the generation of v4 transactions from NU5.
+        print("Generating pre-Canopy blocks to create sprout funds")
+        # coinbase only becomes mature after 100 blocks, so make one mature.
+        node.generate(105)
+
+        self.sprout_addr = node.z_getnewaddress('sprout')
+        myopid = node.z_shieldcoinbase('*', self.sprout_addr)['opid']
+        wait_and_assert_operationid_status(node, myopid)
+
+        self.transparent_addr = node.getnewaddress()
+        account = node.z_getnewaccount()['account']
+        self.unified_addr = node.z_getaddressforaccount(account)['address']
+        node.generate(15)
+
+        # at height 120, NU5 is not active
+        assert_equal(node.getblockchaininfo()['upgrades'][nustr(NU5_BRANCH_ID)]['status'], 'pending')
+
+        print("Testing getblocktemplate for pre-NU5")
+
+        # Only the coinbase; this covers the case where the Merkle root
+        # is equal to the coinbase txid.
+        print("- only coinbase")
+        self.gbt_submitblock(False)
+
+        # Adding one transaction triggering a single Merkle digest.
+        print("- one transaction (plus coinbase)")
+        self.add_transparent_tx_to_mempool()
+        self.gbt_submitblock(False)
+
+        # Adding two transactions to trigger hash Merkle root edge case.
+        print("- two transactions (plus coinbase)")
+        self.add_transparent_tx_to_mempool()
+        self.add_transparent_tx_to_mempool()
+        self.gbt_submitblock(False)
+
+        # Activate NU5, repeat the above cases
+        node.generate(7)
+        assert_equal(node.getblockchaininfo()['upgrades'][nustr(NU5_BRANCH_ID)]['status'], 'active')
+
+        print("Testing getblocktemplate for post-NU5")
+
+        # Only the coinbase; this covers the case where the block authdata root
+        # is equal to the coinbase authdata
+        print("- only coinbase")
+        self.gbt_submitblock(True)
+
+        # Adding one transaction triggering a single Merkle digest.
+        print("- one transaction (plus coinbase)")
+        self.add_transparent_tx_to_mempool()
+        self.gbt_submitblock(True)
+
+        # Adding two transactions to trigger hash Merkle root edge case.
+        print("- two transactions (plus coinbase)")
+        self.add_transparent_tx_to_mempool()
+        self.add_transparent_tx_to_mempool()
+        self.gbt_submitblock(True)
+
+        # Adding both v4 and v5 to cover legacy auth digest (without full auth digest subtree).
+        print("- both v4 and v5 transactions (plus coinbase)")
+        self.add_nu5_v4_tx_to_mempool()
+        self.add_transparent_tx_to_mempool()
+        self.gbt_submitblock(True)
+
+        # Adding both v4 and v5 to cover legacy auth digest (with full auth digest subtree).
+        print("- both v4 and v5 transactions (plus coinbase)")
+        self.add_nu5_v4_tx_to_mempool()
+        self.add_transparent_tx_to_mempool()
+        self.add_transparent_tx_to_mempool()
+        self.gbt_submitblock(True)
+
+        print("- block with 6 Orchard transactions (plus coinbase)")
+        for i in range(0, 6):
+            print(str(node.z_getbalance(self.transparent_addr)))
+            self.add_nu5_v5_tx_to_mempool()
+        self.gbt_submitblock(True)
+
+        print("- block with 7 Orchard transactions (plus coinbase)")
+        for i in range(0, 7):
+            self.add_nu5_v5_tx_to_mempool()
+        self.gbt_submitblock(True)
+
+if __name__ == '__main__':
+    GetBlockTemplateTest().main()
diff --git a/depend/zcash/qa/rpc-tests/getblocktemplate_longpoll.py b/depend/zcash/qa/rpc-tests/getblocktemplate_longpoll.py
new file mode 100755
index 000000000..89f5394f2
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/getblocktemplate_longpoll.py
@@ -0,0 +1,97 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import get_rpc_proxy, random_transaction
+
+from decimal import Decimal
+
+def check_array_result(object_array, to_match, expected):
+    """
+    Pass in array of JSON objects, a dictionary with key/value pairs
+    to match against, and another dictionary with expected key/value
+    pairs.
+    """
+    num_matched = 0
+    for item in object_array:
+        all_match = True
+        for key,value in to_match.items():
+            if item[key] != value:
+                all_match = False
+        if not all_match:
+            continue
+        for key,value in expected.items():
+            if item[key] != value:
+                raise AssertionError("%s : expected %s=%s"%(str(item), str(key), str(value)))
+            num_matched = num_matched+1
+    if num_matched == 0:
+        raise AssertionError("No objects matched %s"%(str(to_match)))
+
+import threading
+
+class LongpollThread(threading.Thread):
+    def __init__(self, node):
+        threading.Thread.__init__(self)
+        # query current longpollid
+        templat = node.getblocktemplate()
+        self.longpollid = templat['longpollid']
+        # create a new connection to the node, we can't use the same
+        # connection from two threads
+        self.node = get_rpc_proxy(node.url, 1, timeout=600)
+
+    def run(self):
+        self.node.getblocktemplate({'longpollid':self.longpollid})
+
+class GetBlockTemplateLPTest(BitcoinTestFramework):
+    '''
+    Test longpolling with getblocktemplate.
+    '''
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 4
+        self.setup_clean_chain = False
+
+    def run_test(self):
+        print("Warning: this test will take about 70 seconds in the best case. Be patient.")
+        self.nodes[0].generate(10)
+        templat = self.nodes[0].getblocktemplate()
+        longpollid = templat['longpollid']
+        # longpollid should not change between successive invocations if nothing else happens
+        templat2 = self.nodes[0].getblocktemplate()
+        assert(templat2['longpollid'] == longpollid)
+
+        # Test 1: test that the longpolling wait if we do nothing
+        thr = LongpollThread(self.nodes[0])
+        thr.start()
+        # check that thread still lives
+        thr.join(5)  # wait 5 seconds or until thread exits
+        assert(thr.is_alive())
+
+        # Test 2: test that longpoll will terminate if another node generates a block
+        self.nodes[1].generate(1)  # generate a block on another node
+        # check that thread will exit now that new transaction entered mempool
+        thr.join(5)  # wait 5 seconds or until thread exits
+        assert(not thr.is_alive())
+
+        # Test 3: test that longpoll will terminate if we generate a block ourselves
+        thr = LongpollThread(self.nodes[0])
+        thr.start()
+        self.nodes[0].generate(1)  # generate a block on another node
+        thr.join(5)  # wait 5 seconds or until thread exits
+        assert(not thr.is_alive())
+
+        # Test 4: test that introducing a new transaction into the mempool will terminate the longpoll
+        thr = LongpollThread(self.nodes[0])
+        thr.start()
+        # generate a random transaction and submit it
+        (txid, txhex, fee) = random_transaction(self.nodes, Decimal("1.1"), Decimal("0.0"), Decimal("0.001"), 20)
+        # after one minute, every 10 seconds the mempool is probed, so in 80 seconds it should have returned
+        thr.join(60 + 20)
+        assert(not thr.is_alive())
+
+if __name__ == '__main__':
+    GetBlockTemplateLPTest().main()
+
diff --git a/depend/zcash/qa/rpc-tests/getblocktemplate_proposals.py b/depend/zcash/qa/rpc-tests/getblocktemplate_proposals.py
new file mode 100755
index 000000000..262753d5e
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/getblocktemplate_proposals.py
@@ -0,0 +1,194 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.authproxy import JSONRPCException
+from test_framework.util import connect_nodes_bi
+
+from binascii import a2b_hex, b2a_hex
+from hashlib import sha256
+from struct import pack
+
+
+def check_array_result(object_array, to_match, expected):
+    """
+    Pass in array of JSON objects, a dictionary with key/value pairs
+    to match against, and another dictionary with expected key/value
+    pairs.
+    """
+    num_matched = 0
+    for item in object_array:
+        all_match = True
+        for key,value in to_match.items():
+            if item[key] != value:
+                all_match = False
+        if not all_match:
+            continue
+        for key,value in expected.items():
+            if item[key] != value:
+                raise AssertionError("%s : expected %s=%s"%(str(item), str(key), str(value)))
+            num_matched = num_matched+1
+    if num_matched == 0:
+        raise AssertionError("No objects matched %s"%(str(to_match)))
+
+def b2x(b):
+    return b2a_hex(b).decode('ascii')
+
+# NOTE: This does not work for signed numbers (set the high bit) or zero (use b'\0')
+def encodeUNum(n):
+    s = bytearray(b'\1')
+    while n > 127:
+        s[0] += 1
+        s.append(n % 256)
+        n //= 256
+    s.append(n)
+    return bytes(s)
+
+def varlenEncode(n):
+    if n < 0xfd:
+        return pack('<B', n)
+    if n <= 0xffff:
+        return b'\xfd' + pack('<H', n)
+    if n <= 0xffffffff:
+        return b'\xfe' + pack('<L', n)
+    return b'\xff' + pack('<Q', n)
+
+def dblsha(b):
+    return sha256(sha256(b).digest()).digest()
+
+def genmrklroot(leaflist):
+    cur = leaflist
+    while len(cur) > 1:
+        n = []
+        if len(cur) & 1:
+            cur.append(cur[-1])
+        for i in range(0, len(cur), 2):
+            n.append(dblsha(cur[i] + cur[i+1]))
+        cur = n
+    return cur[0]
+
+def template_to_bytearray(tmpl, txlist):
+    blkver = pack('<L', tmpl['version'])
+    mrklroot = genmrklroot(list(dblsha(a) for a in txlist))
+    reserved = b'\0'*32
+    timestamp = pack('<L', tmpl['curtime'])
+    nonce = b'\0'*32
+    soln = b'\0'
+    blk = blkver + a2b_hex(tmpl['previousblockhash'])[::-1] + mrklroot + reserved + timestamp + a2b_hex(tmpl['bits'])[::-1] + nonce + soln
+    blk += varlenEncode(len(txlist))
+    for tx in txlist:
+        blk += tx
+    return bytearray(blk)
+
+def template_to_hex(tmpl, txlist):
+    return b2x(template_to_bytearray(tmpl, txlist))
+
+def assert_template(node, tmpl, txlist, expect):
+    rsp = node.getblocktemplate({'data':template_to_hex(tmpl, txlist),'mode':'proposal'})
+    if rsp != expect:
+        raise AssertionError('unexpected: %s' % (rsp,))
+
+class GetBlockTemplateProposalTest(BitcoinTestFramework):
+    '''
+    Test block proposals with getblocktemplate.
+    '''
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 2
+        self.setup_clean_chain = False
+
+    def setup_network(self):
+        self.nodes = self.setup_nodes()
+        connect_nodes_bi(self.nodes, 0, 1)
+
+    def run_test(self):
+        node = self.nodes[0]
+        node.generate(1) # Mine a block to leave initial block download
+        tmpl = node.getblocktemplate()
+        if 'coinbasetxn' not in tmpl:
+            rawcoinbase = encodeUNum(tmpl['height'])
+            rawcoinbase += b'\x01-'
+            hexcoinbase = b2x(rawcoinbase)
+            hexoutval = b2x(pack('<Q', tmpl['coinbasevalue']))
+            tmpl['coinbasetxn'] = {'data': '01000000' + '01' + '0000000000000000000000000000000000000000000000000000000000000000ffffffff' + ('%02x' % (len(rawcoinbase),)) + hexcoinbase + 'fffffffe' + '01' + hexoutval + '00' + '00000000'}
+        txlist = list(bytearray(a2b_hex(a['data'])) for a in (tmpl['coinbasetxn'],) + tuple(tmpl['transactions']))
+
+        # Test 0: Capability advertised
+        assert('proposal' in tmpl['capabilities'])
+
+        # NOTE: This test currently FAILS (regtest mode doesn't enforce block height in coinbase)
+        ## Test 1: Bad height in coinbase
+        #txlist[0][4+1+36+1+1] += 1
+        #assert_template(node, tmpl, txlist, 'FIXME')
+        #txlist[0][4+1+36+1+1] -= 1
+
+        # Test 2: Bad input hash for gen tx
+        txlist[0][4+1] += 1
+        assert_template(node, tmpl, txlist, 'bad-cb-missing')
+        txlist[0][4+1] -= 1
+
+        # Test 3: Truncated final tx
+        lastbyte = txlist[-1].pop()
+        try:
+            assert_template(node, tmpl, txlist, 'n/a')
+        except JSONRPCException:
+            pass  # Expected
+        txlist[-1].append(lastbyte)
+
+        # Test 4: Add an invalid tx to the end (duplicate of gen tx)
+        txlist.append(txlist[0])
+        assert_template(node, tmpl, txlist, 'bad-txns-duplicate')
+        txlist.pop()
+
+        # Test 5: Add an invalid tx to the end (non-duplicate)
+        txlist.append(bytearray(txlist[0]))
+        txlist[-1][4+1] = 0xff
+        assert_template(node, tmpl, txlist, 'bad-txns-inputs-missingorspent')
+        txlist.pop()
+
+        # Test 6: Future tx lock time
+        txlist[0][-4:] = b'\xff\xff\xff\xff'
+        assert_template(node, tmpl, txlist, 'bad-txns-nonfinal')
+        txlist[0][-4:] = b'\0\0\0\0'
+
+        # Test 7: Bad tx count
+        txlist.append(b'')
+        try:
+            assert_template(node, tmpl, txlist, 'n/a')
+        except JSONRPCException:
+            pass  # Expected
+        txlist.pop()
+
+        # Test 8: Bad bits
+        realbits = tmpl['bits']
+        tmpl['bits'] = '1c0000ff'  # impossible in the real world
+        assert_template(node, tmpl, txlist, 'bad-diffbits')
+        tmpl['bits'] = realbits
+
+        # Test 9: Bad merkle root
+        rawtmpl = template_to_bytearray(tmpl, txlist)
+        rawtmpl[4+32] = (rawtmpl[4+32] + 1) % 0x100
+        rsp = node.getblocktemplate({'data':b2x(rawtmpl),'mode':'proposal'})
+        if rsp != 'bad-txnmrklroot':
+            raise AssertionError('unexpected: %s' % (rsp,))
+
+        # Test 10: Bad timestamps
+        realtime = tmpl['curtime']
+        tmpl['curtime'] = 0x7fffffff
+        assert_template(node, tmpl, txlist, 'time-too-new')
+        tmpl['curtime'] = 0
+        assert_template(node, tmpl, txlist, 'time-too-old')
+        tmpl['curtime'] = realtime
+
+        # Test 11: Valid block
+        assert_template(node, tmpl, txlist, None)
+
+        # Test 12: Orphan block
+        tmpl['previousblockhash'] = 'ff00' * 16
+        assert_template(node, tmpl, txlist, 'inconclusive-not-best-prevblk')
+
+if __name__ == '__main__':
+    GetBlockTemplateProposalTest().main()
diff --git a/depend/zcash/qa/rpc-tests/getchaintips.py b/depend/zcash/qa/rpc-tests/getchaintips.py
new file mode 100755
index 000000000..63543f48c
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/getchaintips.py
@@ -0,0 +1,63 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+# Exercise the getchaintips API.  We introduce a network split, work
+# on chains of different lengths, and join the network together again.
+# This gives us two tips, verify that it works.
+
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal
+
+class GetChainTipsTest (BitcoinTestFramework):
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 4
+        self.setup_clean_chain = False
+
+    def run_test (self):
+
+        tips = self.nodes[0].getchaintips ()
+        assert_equal (len (tips), 1)
+        assert_equal (tips[0]['branchlen'], 0)
+        assert_equal (tips[0]['height'], 200)
+        assert_equal (tips[0]['status'], 'active')
+
+        # Split the network and build two chains of different lengths.
+        self.split_network ()
+        self.nodes[0].generate(10);
+        self.nodes[2].generate(20);
+        self.sync_all ()
+
+        tips = self.nodes[1].getchaintips ()
+        assert_equal (len (tips), 1)
+        shortTip = tips[0]
+        assert_equal (shortTip['branchlen'], 0)
+        assert_equal (shortTip['height'], 210)
+        assert_equal (tips[0]['status'], 'active')
+
+        tips = self.nodes[3].getchaintips ()
+        assert_equal (len (tips), 1)
+        longTip = tips[0]
+        assert_equal (longTip['branchlen'], 0)
+        assert_equal (longTip['height'], 220)
+        assert_equal (tips[0]['status'], 'active')
+
+        # Join the network halves and check that we now have two tips
+        # (at least at the nodes that previously had the short chain).
+        self.join_network ()
+
+        tips = self.nodes[0].getchaintips ()
+        assert_equal (len (tips), 2)
+        assert_equal (tips[0], longTip)
+
+        assert_equal (tips[1]['branchlen'], 10)
+        assert_equal (tips[1]['status'], 'valid-fork')
+        tips[1]['branchlen'] = 0
+        tips[1]['status'] = 'active'
+        assert_equal (tips[1], shortTip)
+
+if __name__ == '__main__':
+    GetChainTipsTest ().main ()
diff --git a/depend/zcash/qa/rpc-tests/getmininginfo.py b/depend/zcash/qa/rpc-tests/getmininginfo.py
new file mode 100755
index 000000000..a1edaf12e
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/getmininginfo.py
@@ -0,0 +1,47 @@
+#!/usr/bin/env python3
+# Copyright (c) 2021 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import start_nodes
+
+
+class GetMiningInfoTest(BitcoinTestFramework):
+    '''
+    Test getmininginfo.
+    '''
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 1
+        self.setup_clean_chain = True
+
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir)
+        self.is_network_split = False
+        self.sync_all()
+
+    def run_test(self):
+        node = self.nodes[0]
+
+        info = node.getmininginfo()
+        assert(info['blocks'] == 0)
+        # No blocks have been mined yet, so these fields should not be present.
+        assert('currentblocksize' not in info)
+        assert('currentblocktx' not in info)
+
+        node.generate(1)
+
+        info = node.getmininginfo()
+        assert(info['blocks'] == 1)
+        # One block has been mined, so these fields should now be present.
+        assert('currentblocksize' in info)
+        assert('currentblocktx' in info)
+        assert(info['currentblocksize'] > 0)
+        # The transaction count doesn't include the coinbase
+        assert(info['currentblocktx'] == 0)
+
+
+if __name__ == '__main__':
+    GetMiningInfoTest().main()
diff --git a/depend/zcash/qa/rpc-tests/getrawtransaction_insight.py b/depend/zcash/qa/rpc-tests/getrawtransaction_insight.py
new file mode 100755
index 000000000..f54bf85ee
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/getrawtransaction_insight.py
@@ -0,0 +1,105 @@
+#!/usr/bin/env python3
+# Copyright (c) 2019 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Test the new fields added to the output of getrawtransaction
+# RPC for the Insight Explorer by the new spentindex
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+
+from test_framework.util import assert_equal
+from test_framework.util import start_nodes, stop_nodes, connect_nodes
+from test_framework.util import wait_bitcoinds
+
+from test_framework.mininode import COIN
+
+
+class GetrawtransactionTest(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 3
+        self.setup_clean_chain = True
+
+    def setup_network(self):
+        # -insightexplorer causes spentindex to be enabled (fSpentIndex = true)
+
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir,
+            [['-debug', '-txindex', '-experimentalfeatures', '-insightexplorer']] * self.num_nodes)
+        connect_nodes(self.nodes[0], 1)
+        connect_nodes(self.nodes[0], 2)
+
+        self.is_network_split = False
+        self.sync_all()
+
+    def run_test(self):
+        self.nodes[0].generate(105)
+        self.sync_all()
+
+        chain_height = self.nodes[1].getblockcount()
+        assert_equal(chain_height, 105)
+
+        # Test getrawtransaction changes and the getspentinfo RPC
+
+        # send coinbase to address a
+        a = self.nodes[1].getnewaddress()
+        txid_a = self.nodes[0].sendtoaddress(a, 2)
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # send from a to b
+        # (the only utxo on node 1 is from address a)
+        b = self.nodes[2].getnewaddress()
+        txid_b = self.nodes[1].sendtoaddress(b, 1)
+        self.sync_all()
+
+        # a to b transaction is not confirmed, so it has no height
+        tx_b = self.nodes[2].getrawtransaction(txid_b, 1)
+        assert('height' not in tx_b)
+
+        self.sync_all()
+        tx_a = self.nodes[2].getrawtransaction(txid_a, 1)
+
+        # txid_b is not yet confirmed, so height is invalid (-1)
+        vout = list(filter(lambda o: o['value'] == 2, tx_a['vout']))
+        assert_equal(vout[0]['spentTxId'], txid_b)
+        assert_equal(vout[0]['spentIndex'], 0)
+        assert_equal(vout[0]['spentHeight'], -1)
+
+        # confirm txid_b (a to b transaction)
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # Restart all nodes to ensure index files are saved to disk and recovered
+        stop_nodes(self.nodes)
+        wait_bitcoinds()
+        self.setup_network()
+
+        # Check new fields added to getrawtransaction
+        tx_a = self.nodes[2].getrawtransaction(txid_a, 1)
+        assert_equal(tx_a['vin'][0]['value'], 10) # coinbase
+        assert_equal(tx_a['vin'][0]['valueSat'], 10*COIN)
+        # we want the non-change (payment) output
+        vout = list(filter(lambda o: o['value'] == 2, tx_a['vout']))
+        assert_equal(vout[0]['spentTxId'], txid_b)
+        assert_equal(vout[0]['spentIndex'], 0)
+        assert_equal(vout[0]['spentHeight'], 107)
+        assert_equal(tx_a['height'], 106)
+
+        tx_b = self.nodes[2].getrawtransaction(txid_b, 1)
+        assert_equal(tx_b['vin'][0]['address'], a)
+        assert_equal(tx_b['vin'][0]['value'], 2)
+        assert_equal(tx_b['vin'][0]['valueSat'], 2*COIN)
+        # since this transaction's outputs haven't yet been
+        # spent, these fields should not be present
+        assert('spentTxId' not in tx_b['vout'][0])
+        assert('spentIndex' not in tx_b['vout'][0])
+        assert('spentHeight' not in tx_b['vout'][0])
+        assert_equal(tx_b['height'], 107)
+
+if __name__ == '__main__':
+    GetrawtransactionTest().main()
diff --git a/depend/zcash/qa/rpc-tests/golden/blossom.tar.gz b/depend/zcash/qa/rpc-tests/golden/blossom.tar.gz
new file mode 100644
index 000000000..feaad9438
Binary files /dev/null and b/depend/zcash/qa/rpc-tests/golden/blossom.tar.gz differ
diff --git a/depend/zcash/qa/rpc-tests/golden/heartwood.tar.gz b/depend/zcash/qa/rpc-tests/golden/heartwood.tar.gz
new file mode 100644
index 000000000..56173ae82
Binary files /dev/null and b/depend/zcash/qa/rpc-tests/golden/heartwood.tar.gz differ
diff --git a/depend/zcash/qa/rpc-tests/hardforkdetection.py b/depend/zcash/qa/rpc-tests/hardforkdetection.py
new file mode 100755
index 000000000..01374573f
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/hardforkdetection.py
@@ -0,0 +1,69 @@
+#!/usr/bin/env python3
+
+#
+# Test hard fork detection
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.authproxy import JSONRPCException
+from test_framework.util import assert_equal, start_node
+
+import os
+
+class HardForkDetectionTest(BitcoinTestFramework):
+
+    alert_filename = None  # Set by setup_network
+
+    def setup_network(self):
+        self.nodes = []
+        self.alert_filename = os.path.join(self.options.tmpdir, "alert.txt")
+        with open(self.alert_filename, 'w', encoding='utf8'):
+            pass  # Just open then close to create zero-length file
+        self.nodes.append(start_node(0, self.options.tmpdir,
+                            ["-blockversion=2", "-alertnotify=echo %s >> \"" + self.alert_filename + "\""]))
+
+    def assert_safemode_off(self):
+        self.nodes[0].getbalance()
+
+    def assert_safemode_on(self, requiredMessage):
+        errorString = ""
+        try:
+            self.nodes[0].getbalance()
+        except JSONRPCException as e:
+            errorString = e.error['message']
+
+        assert_equal("Safe mode:" in errorString, True)
+        assert_equal(requiredMessage in errorString, True)
+
+    def run_test(self):
+        # Generate 10 blocks
+        self.nodes[0].generate(100)
+
+        # Invalidate all of them.
+        for block_height in range(100, 0, -1):
+            block_hash = self.nodes[0].getblockhash(block_height)
+            self.nodes[0].invalidateblock(block_hash)
+
+        # Check that safe mode is on.
+        self.assert_safemode_on("We do not appear to fully agree with our peers!")
+
+        # Check that an -alertnotify was triggered.
+        with open(self.alert_filename, 'r', encoding='utf8') as f:
+            alert_text = f.read()
+
+        if len(alert_text) == 0:
+            raise AssertionError("-alertnotify did not warn of detected hard fork")
+
+        # If our chain keeps growing, but the hard forking chain remains longer,
+        # safe mode should stay on.
+        self.nodes[0].generate(50)
+        self.assert_safemode_on("We do not appear to fully agree with our peers!")
+
+        # If we're on the longer side of the hard fork, safe mode should get
+        # turned off.
+        self.nodes[0].generate(50)
+        self.assert_safemode_off()
+
+
+if __name__ == '__main__':
+    HardForkDetectionTest().main()
diff --git a/depend/zcash/qa/rpc-tests/httpbasics.py b/depend/zcash/qa/rpc-tests/httpbasics.py
new file mode 100755
index 000000000..ba01583dd
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/httpbasics.py
@@ -0,0 +1,113 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Test rpc http basics
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, str_to_b64str
+
+import http.client
+import urllib.parse
+
+class HTTPBasicsTest (BitcoinTestFramework):
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 3
+        self.setup_clean_chain = False
+
+    def setup_network(self):
+        self.nodes = self.setup_nodes()
+
+    def run_test(self):
+
+        #################################################
+        # lowlevel check for http persistent connection #
+        #################################################
+        url = urllib.parse.urlparse(self.nodes[0].url)
+        authpair = url.username + ':' + url.password
+        headers = {"Authorization": "Basic " + str_to_b64str(authpair)}
+
+        conn = http.client.HTTPConnection(url.hostname, url.port)
+        conn.connect()
+        conn.request('POST', '/', '{"method": "getbestblockhash"}', headers)
+        out1 = conn.getresponse().read()
+        assert_equal(b'"error":null' in out1, True)
+        assert_equal(conn.sock!=None, True) # according to http/1.1 connection must still be open!
+
+        # send 2nd request without closing connection
+        conn.request('POST', '/', '{"method": "getchaintips"}', headers)
+        out2 = conn.getresponse().read()
+        assert_equal(b'"error":null' in out2, True) # must also response with a correct json-rpc message
+        assert_equal(conn.sock!=None, True) # according to http/1.1 connection must still be open!
+        conn.close()
+
+        # same should be if we add keep-alive because this should be the std. behaviour
+        headers = {"Authorization": "Basic " + str_to_b64str(authpair), "Connection": "keep-alive"}
+
+        conn = http.client.HTTPConnection(url.hostname, url.port)
+        conn.connect()
+        conn.request('POST', '/', '{"method": "getbestblockhash"}', headers)
+        out1 = conn.getresponse().read()
+        assert_equal(b'"error":null' in out1, True)
+        assert_equal(conn.sock!=None, True) # according to http/1.1 connection must still be open!
+
+        # send 2nd request without closing connection
+        conn.request('POST', '/', '{"method": "getchaintips"}', headers)
+        out2 = conn.getresponse().read()
+        assert_equal(b'"error":null' in out2, True) # must also response with a correct json-rpc message
+        assert_equal(conn.sock!=None, True) # according to http/1.1 connection must still be open!
+        conn.close()
+
+        # now do the same with "Connection: close"
+        headers = {"Authorization": "Basic " + str_to_b64str(authpair), "Connection":"close"}
+
+        conn = http.client.HTTPConnection(url.hostname, url.port)
+        conn.connect()
+        conn.request('POST', '/', '{"method": "getbestblockhash"}', headers)
+        out1 = conn.getresponse().read()
+        assert_equal(b'"error":null' in out1, True)
+        assert_equal(conn.sock!=None, False) # now the connection must be closed after the response
+
+        # node1 (2nd node) is running with disabled keep-alive option
+        urlNode1 = urllib.parse.urlparse(self.nodes[1].url)
+        authpair = urlNode1.username + ':' + urlNode1.password
+        headers = {"Authorization": "Basic " + str_to_b64str(authpair)}
+
+        conn = http.client.HTTPConnection(urlNode1.hostname, urlNode1.port)
+        conn.connect()
+        conn.request('POST', '/', '{"method": "getbestblockhash"}', headers)
+        out1 = conn.getresponse().read()
+        assert_equal(b'"error":null' in out1, True)
+
+        # node2 (third node) is running with standard keep-alive parameters which means keep-alive is on
+        urlNode2 = urllib.parse.urlparse(self.nodes[2].url)
+        authpair = urlNode2.username + ':' + urlNode2.password
+        headers = {"Authorization": "Basic " + str_to_b64str(authpair)}
+
+        conn = http.client.HTTPConnection(urlNode2.hostname, urlNode2.port)
+        conn.connect()
+        conn.request('POST', '/', '{"method": "getbestblockhash"}', headers)
+        out1 = conn.getresponse().read()
+        assert_equal(b'"error":null' in out1, True)
+        assert_equal(conn.sock!=None, True) # connection must be closed because bitcoind should use keep-alive by default
+
+        # Check excessive request size
+        conn = http.client.HTTPConnection(urlNode2.hostname, urlNode2.port)
+        conn.connect()
+        conn.request('GET', '/' + ('x'*1000), '', headers)
+        out1 = conn.getresponse()
+        assert_equal(out1.status, http.client.NOT_FOUND)
+
+        conn = http.client.HTTPConnection(urlNode2.hostname, urlNode2.port)
+        conn.connect()
+        conn.request('GET', '/' + ('x'*10000), '', headers)
+        out1 = conn.getresponse()
+        assert_equal(out1.status, http.client.BAD_REQUEST)
+
+
+if __name__ == '__main__':
+    HTTPBasicsTest().main()
diff --git a/depend/zcash/qa/rpc-tests/invalidateblock.py b/depend/zcash/qa/rpc-tests/invalidateblock.py
new file mode 100755
index 000000000..6907dc21d
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/invalidateblock.py
@@ -0,0 +1,77 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Test InvalidateBlock code
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import start_node, \
+    connect_nodes_bi, sync_blocks
+
+import time
+
+class InvalidateTest(BitcoinTestFramework):
+    def __init__(self):
+        super().__init__()
+        self.setup_clean_chain = True
+        self.num_nodes = 3
+
+    def setup_network(self):
+        self.nodes = []
+        self.is_network_split = False
+        self.nodes.append(start_node(0, self.options.tmpdir, ["-debug"]))
+        self.nodes.append(start_node(1, self.options.tmpdir, ["-debug"]))
+        self.nodes.append(start_node(2, self.options.tmpdir, ["-debug"]))
+
+    def run_test(self):
+        print("Make sure we repopulate setBlockIndexCandidates after InvalidateBlock:")
+        print("Mine 4 blocks on Node 0")
+        self.nodes[0].generate(4)
+        assert(self.nodes[0].getblockcount() == 4)
+        besthash = self.nodes[0].getbestblockhash()
+
+        print("Mine competing 6 blocks on Node 1")
+        self.nodes[1].generate(6)
+        assert(self.nodes[1].getblockcount() == 6)
+
+        print("Connect nodes to force a reorg")
+        connect_nodes_bi(self.nodes,0,1)
+        sync_blocks(self.nodes[0:2])
+        assert(self.nodes[0].getblockcount() == 6)
+        badhash = self.nodes[1].getblockhash(2)
+
+        print("Invalidate block 2 on node 0 and verify we reorg to node 0's original chain")
+        self.nodes[0].invalidateblock(badhash)
+        newheight = self.nodes[0].getblockcount()
+        newhash = self.nodes[0].getbestblockhash()
+        if (newheight != 4 or newhash != besthash):
+            raise AssertionError("Wrong tip for node0, hash %s, height %d"%(newhash,newheight))
+
+        print("\nMake sure we won't reorg to a lower work chain:")
+        connect_nodes_bi(self.nodes,1,2)
+        print("Sync node 2 to node 1 so both have 6 blocks")
+        sync_blocks(self.nodes[1:3])
+        assert(self.nodes[2].getblockcount() == 6)
+        print("Invalidate block 5 on node 1 so its tip is now at 4")
+        self.nodes[1].invalidateblock(self.nodes[1].getblockhash(5))
+        assert(self.nodes[1].getblockcount() == 4)
+        print("Invalidate block 3 on node 2, so its tip is now 2")
+        self.nodes[2].invalidateblock(self.nodes[2].getblockhash(3))
+        assert(self.nodes[2].getblockcount() == 2)
+        print("..and then mine a block")
+        self.nodes[2].generate(1)
+        print("Verify all nodes are at the right height")
+        time.sleep(5)
+        for i in range(3):
+            print(i,self.nodes[i].getblockcount())
+        assert(self.nodes[2].getblockcount() == 3)
+        assert(self.nodes[0].getblockcount() == 4)
+        node1height = self.nodes[1].getblockcount()
+        if node1height < 4:
+            raise AssertionError("Node 1 reorged to a lower height: %d"%node1height)
+
+if __name__ == '__main__':
+    InvalidateTest().main()
diff --git a/depend/zcash/qa/rpc-tests/invalidblockrequest.py b/depend/zcash/qa/rpc-tests/invalidblockrequest.py
new file mode 100755
index 000000000..4fb916e10
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/invalidblockrequest.py
@@ -0,0 +1,115 @@
+#!/usr/bin/env python3
+# Copyright (c) 2015-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import ComparisonTestFramework
+from test_framework.util import assert_equal
+from test_framework.comptool import TestManager, TestInstance, RejectResult
+from test_framework.mininode import NetworkThread
+from test_framework.blocktools import create_block, create_coinbase, create_transaction
+
+import copy
+import time
+
+
+'''
+In this test we connect to one node over p2p, and test block requests:
+1) Valid blocks should be requested and become chain tip.
+2) Invalid block with duplicated transaction should be re-requested.
+3) Invalid block with bad coinbase value should be rejected and not
+re-requested.
+'''
+
+# Use the ComparisonTestFramework with 1 node: only use --testbinary.
+class InvalidBlockRequestTest(ComparisonTestFramework):
+
+    ''' Can either run this test as 1 node with expected answers, or two and compare them.
+        Change the "outcome" variable from each TestInstance object to only do the comparison. '''
+    def run_test(self):
+        test = TestManager(self, self.options.tmpdir)
+        test.add_all_connections(self.nodes)
+        self.tip = None
+        self.block_time = None
+        NetworkThread().start() # Start up network handling in another thread
+        test.run()
+
+    def get_tests(self):
+        if self.tip is None:
+            self.tip = int("0x" + self.nodes[0].getbestblockhash(), 0)
+        self.block_time = int(time.time())+1
+
+        '''
+        Create a new block with an anyone-can-spend coinbase
+        '''
+        height = 1
+        block = create_block(self.tip, create_coinbase(height), self.block_time)
+        self.block_time += 1
+        block.solve()
+        # Save the coinbase for later
+        self.block1 = block
+        self.tip = block.sha256
+        height += 1
+        yield TestInstance([[block, True]])
+
+        '''
+        Now we need that block to mature so we can spend the coinbase.
+        '''
+        test = TestInstance(sync_every_block=False)
+        for i in range(100):
+            block = create_block(self.tip, create_coinbase(height), self.block_time)
+            block.solve()
+            self.tip = block.sha256
+            self.block_time += 1
+            test.blocks_and_transactions.append([block, True])
+            height += 1
+        yield test
+
+        '''
+        Now we use merkle-root malleability to generate an invalid block with
+        same blockheader.
+        Manufacture a block with 3 transactions (coinbase, spend of prior
+        coinbase, spend of that spend).  Duplicate the 3rd transaction to 
+        leave merkle root and blockheader unchanged but invalidate the block.
+        '''
+        block2 = create_block(self.tip, create_coinbase(height), self.block_time)
+        self.block_time += 1
+
+        # b'0x51' is OP_TRUE
+        tx1 = create_transaction(self.block1.vtx[0], 0, b'\x51', 10*100000000)
+        tx2 = create_transaction(tx1, 0, b'\x51', 10*100000000)
+
+        block2.vtx.extend([tx1, tx2])
+        block2.hashMerkleRoot = block2.calc_merkle_root()
+        block2.rehash()
+        block2.solve()
+        orig_hash = block2.sha256
+        block2_orig = copy.deepcopy(block2)
+
+        # Mutate block 2
+        block2.vtx.append(tx2)
+        assert_equal(block2.hashMerkleRoot, block2.calc_merkle_root())
+        assert_equal(orig_hash, block2.rehash())
+        assert(block2_orig.vtx != block2.vtx)
+
+        self.tip = block2.sha256
+        yield TestInstance([[block2, RejectResult(16, b'bad-txns-duplicate')], [block2_orig, True]])
+        height += 1
+
+        '''
+        Make sure that a totally screwed up block is not valid.
+        '''
+        block3 = create_block(self.tip, create_coinbase(height), self.block_time)
+        self.block_time += 1
+        block3.vtx[0].vout[0].nValue = 100*100000000 # Too high!
+        block3.vtx[0].sha256=None
+        block3.vtx[0].calc_sha256()
+        block3.hashMerkleRoot = block3.calc_merkle_root()
+        block3.rehash()
+        block3.solve()
+
+        yield TestInstance([[block3, RejectResult(16, b'bad-cb-amount')]])
+
+
+if __name__ == '__main__':
+    InvalidBlockRequestTest().main()
diff --git a/depend/zcash/qa/rpc-tests/invalidtxrequest.py b/depend/zcash/qa/rpc-tests/invalidtxrequest.py
new file mode 100755
index 000000000..8ec448f50
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/invalidtxrequest.py
@@ -0,0 +1,70 @@
+#!/usr/bin/env python3
+#
+# Distributed under the MIT/X11 software license, see the accompanying
+# file COPYING or http://www.opensource.org/licenses/mit-license.php.
+#
+
+from test_framework.test_framework import ComparisonTestFramework
+from test_framework.comptool import TestManager, TestInstance, RejectResult
+from test_framework.mininode import NetworkThread
+from test_framework.blocktools import create_block, create_coinbase, create_transaction
+import time
+
+
+'''
+In this test we connect to one node over p2p, and test tx requests.
+'''
+
+# Use the ComparisonTestFramework with 1 node: only use --testbinary.
+class InvalidTxRequestTest(ComparisonTestFramework):
+
+    ''' Can either run this test as 1 node with expected answers, or two and compare them. 
+        Change the "outcome" variable from each TestInstance object to only do the comparison. '''
+    def run_test(self):
+        test = TestManager(self, self.options.tmpdir)
+        test.add_all_connections(self.nodes)
+        self.tip = None
+        self.block_time = None
+        NetworkThread().start() # Start up network handling in another thread
+        test.run()
+
+    def get_tests(self):
+        if self.tip is None:
+            self.tip = int("0x" + self.nodes[0].getbestblockhash(), 0)
+        self.block_time = int(time.time())+1
+
+        '''
+        Create a new block with an anyone-can-spend coinbase
+        '''
+        height = 1
+        block = create_block(self.tip, create_coinbase(height), self.block_time)
+        self.block_time += 1
+        block.solve()
+        # Save the coinbase for later
+        self.block1 = block
+        self.tip = block.sha256
+        height += 1
+        yield TestInstance([[block, True]])
+
+        '''
+        Now we need that block to mature so we can spend the coinbase.
+        '''
+        test = TestInstance(sync_every_block=False)
+        for i in range(100):
+            block = create_block(self.tip, create_coinbase(height), self.block_time)
+            block.solve()
+            self.tip = block.sha256
+            self.block_time += 1
+            test.blocks_and_transactions.append([block, True])
+            height += 1
+        yield test
+
+        # b'\x64' is OP_NOTIF
+        # Transaction will be rejected with code 16 (REJECT_INVALID)
+        tx1 = create_transaction(self.block1.vtx[0], 0, b'\x64', 10*100000000)
+        yield TestInstance([[tx1, RejectResult(16, b'mandatory-script-verify-flag-failed')]])
+
+        # TODO: test further transactions...
+
+if __name__ == '__main__':
+    InvalidTxRequestTest().main()
diff --git a/depend/zcash/qa/rpc-tests/key_import_export.py b/depend/zcash/qa/rpc-tests/key_import_export.py
new file mode 100755
index 000000000..186e72261
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/key_import_export.py
@@ -0,0 +1,111 @@
+#!/usr/bin/env python3
+# Copyright (c) 2017 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from decimal import Decimal
+from functools import reduce
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, assert_greater_than, start_nodes, connect_nodes_bi
+
+import logging
+import sys
+
+logging.basicConfig(format='%(levelname)s: %(message)s', level=logging.INFO, stream=sys.stdout)
+
+
+class KeyImportExportTest (BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 4
+        self.setup_clean_chain = True
+
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir )
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,0,2)
+        connect_nodes_bi(self.nodes,0,3)
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test(self):
+        [alice, bob, charlie, miner] = self.nodes
+
+        def alice_to_bob(amount):
+            alice.sendtoaddress(addr, Decimal(amount))
+            self.sync_all()
+            miner.generate(1)
+            self.sync_all()
+
+        def verify_utxos(node, amounts):
+            utxos = node.listunspent(1, 10**9, [addr])
+            utxos.sort(key=lambda x: x["confirmations"])
+            utxos.reverse()
+
+            try:
+                assert_equal(amounts, [utxo["amount"] for utxo in utxos])
+            except AssertionError:
+                logging.error(
+                    'Expected amounts: %r; utxos: %r',
+                    amounts, utxos)
+                raise
+
+        # Seed Alice with some funds
+        alice.generate(10)
+        self.sync_all()
+        miner.generate(100)
+        self.sync_all()
+
+        # Now get a pristine address for receiving transfers:
+        addr = bob.getnewaddress()
+        verify_utxos(bob, [])
+        verify_utxos(charlie, [])
+
+        # the amounts of each txn embodied which generates a single UTXO:
+        amounts = list(map(Decimal, ['2.3', '3.7', '0.1', '0.5', '1.0', '0.19']))
+
+        # Internal test consistency assertion:
+        assert_greater_than(
+            alice.getbalance(),
+            reduce(Decimal.__add__, amounts))
+
+        logging.info("Sending pre-export txns...")
+        for amount in amounts[0:2]:
+            alice_to_bob(amount)
+
+        logging.info("Exporting privkey from bob...")
+        privkey = bob.dumpprivkey(addr)
+
+        logging.info("Sending post-export txns...")
+        for amount in amounts[2:4]:
+            alice_to_bob(amount)
+
+        verify_utxos(bob, amounts[:4])
+        verify_utxos(charlie, [])
+
+        logging.info("Importing privkey into charlie...")
+        ipkaddr = charlie.importprivkey(privkey, '', True)
+        assert_equal(addr, ipkaddr)
+
+        # importprivkey should have rescanned, so this should pass:
+        verify_utxos(charlie, amounts[:4])
+
+        # Verify idempotent behavior:
+        ipkaddr2 = charlie.importprivkey(privkey, '', True)
+        assert_equal(addr, ipkaddr2)
+
+        # amounts should be unchanged
+        verify_utxos(charlie, amounts[:4])
+
+        logging.info("Sending post-import txns...")
+        for amount in amounts[4:]:
+            alice_to_bob(amount)
+
+        verify_utxos(bob, amounts)
+        verify_utxos(charlie, amounts)
+
+
+if __name__ == '__main__':
+    KeyImportExportTest().main()
diff --git a/depend/zcash/qa/rpc-tests/keypool.py b/depend/zcash/qa/rpc-tests/keypool.py
new file mode 100755
index 000000000..d567be3a5
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/keypool.py
@@ -0,0 +1,96 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+# Exercise the wallet keypool, and interaction with wallet encryption/locking
+
+from test_framework.authproxy import JSONRPCException
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, \
+    start_nodes, start_node, bitcoind_processes
+
+def check_array_result(object_array, to_match, expected):
+    """
+    Pass in array of JSON objects, a dictionary with key/value pairs
+    to match against, and another dictionary with expected key/value
+    pairs.
+    """
+    num_matched = 0
+    for item in object_array:
+        all_match = True
+        for key,value in to_match.items():
+            if item[key] != value:
+                all_match = False
+        if not all_match:
+            continue
+        for key,value in expected.items():
+            if item[key] != value:
+                raise AssertionError("%s : expected %s=%s"%(str(item), str(key), str(value)))
+            num_matched = num_matched+1
+    if num_matched == 0:
+        raise AssertionError("No objects matched %s"%(str(to_match)))
+
+class KeyPoolTest(BitcoinTestFramework):
+
+    def run_test(self):
+        nodes = self.nodes
+        # Encrypt wallet and wait to terminate
+        nodes[0].encryptwallet('test')
+        bitcoind_processes[0].wait()
+        # Restart node 0
+        nodes[0] = start_node(0, self.options.tmpdir)
+        # We can't create any external addresses, which don't use the keypool.
+        # We should get an error that we need to unlock the wallet.
+        try:
+            addr = nodes[0].getnewaddress()
+            raise AssertionError('Wallet should be locked.')
+        except JSONRPCException as e:
+            assert_equal(e.error['code'], -13)
+
+        # put three new keys in the keypool
+        nodes[0].walletpassphrase('test', 12000)
+        nodes[0].keypoolrefill(3)
+        nodes[0].walletlock()
+
+        # drain the keys
+        addr = set()
+        addr.add(nodes[0].getrawchangeaddress())
+        addr.add(nodes[0].getrawchangeaddress())
+        addr.add(nodes[0].getrawchangeaddress())
+        addr.add(nodes[0].getrawchangeaddress())
+        # assert that four unique addresses were returned
+        assert(len(addr) == 4)
+        # the next one should fail
+        try:
+            addr = nodes[0].getrawchangeaddress()
+            raise AssertionError('Keypool should be exhausted after three addresses')
+        except JSONRPCException as e:
+            assert(e.error['code']==-12)
+
+        # refill keypool with three new addresses
+        nodes[0].walletpassphrase('test', 12000)
+        nodes[0].keypoolrefill(3)
+        nodes[0].walletlock()
+
+        # drain them by mining
+        nodes[0].generate(1)
+        nodes[0].generate(1)
+        nodes[0].generate(1)
+        nodes[0].generate(1)
+        try:
+            nodes[0].generate(1)
+            raise AssertionError('Keypool should be exhausted after three addesses')
+        except JSONRPCException as e:
+            assert_equal(e.error['code'], -12)
+
+    def __init__(self):
+        super().__init__()
+        self.setup_clean_chain = False
+        self.num_nodes = 1
+
+    def setup_network(self):
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir, extra_args=[['-experimentalfeatures', '-developerencryptwallet']])
+
+if __name__ == '__main__':
+    KeyPoolTest().main()
diff --git a/depend/zcash/qa/rpc-tests/listtransactions.py b/depend/zcash/qa/rpc-tests/listtransactions.py
new file mode 100755
index 000000000..64876d733
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/listtransactions.py
@@ -0,0 +1,115 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+# Exercise the listtransactions API
+
+from test_framework.test_framework import BitcoinTestFramework
+
+from decimal import Decimal
+
+def check_array_result(object_array, to_match, expected):
+    """
+    Pass in array of JSON objects, a dictionary with key/value pairs
+    to match against, and another dictionary with expected key/value
+    pairs.
+    """
+    num_matched = 0
+    for item in object_array:
+        all_match = True
+        for key,value in to_match.items():
+            if item[key] != value:
+                all_match = False
+        if not all_match:
+            continue
+        for key,value in expected.items():
+            if item[key] != value:
+                raise AssertionError("%s : expected %s=%s"%(str(item), str(key), str(value)))
+            num_matched = num_matched+1
+    if num_matched == 0:
+        raise AssertionError("No objects matched %s"%(str(to_match)))
+
+class ListTransactionsTest(BitcoinTestFramework):
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 4
+        self.setup_clean_chain = False
+
+    def run_test(self):
+        # Simple send, 0 to 1:
+        txid = self.nodes[0].sendtoaddress(self.nodes[1].getnewaddress(), 0.1)
+        self.sync_all()
+        check_array_result(self.nodes[0].listtransactions(),
+                           {"txid":txid},
+                           {"category":"send","amount":Decimal("-0.1"),"amountZat":-10000000,"confirmations":0})
+        check_array_result(self.nodes[1].listtransactions(),
+                           {"txid":txid},
+                           {"category":"receive","amount":Decimal("0.1"),"amountZat":10000000,"confirmations":0})
+
+        # mine a block, confirmations should change:
+        self.nodes[0].generate(1)
+        self.sync_all()
+        check_array_result(self.nodes[0].listtransactions(),
+                           {"txid":txid},
+                           {"category":"send","amount":Decimal("-0.1"),"amountZat":-10000000,"confirmations":1})
+        check_array_result(self.nodes[1].listtransactions(),
+                           {"txid":txid},
+                           {"category":"receive","amount":Decimal("0.1"),"amountZat":10000000,"confirmations":1})
+
+        # send-to-self:
+        txid = self.nodes[0].sendtoaddress(self.nodes[0].getnewaddress(), 0.2)
+        check_array_result(self.nodes[0].listtransactions(),
+                           {"txid":txid, "category":"send"},
+                           {"amount":Decimal("-0.2"),"amountZat":-20000000})
+        check_array_result(self.nodes[0].listtransactions(),
+                           {"txid":txid, "category":"receive"},
+                           {"amount":Decimal("0.2"),"amountZat":20000000})
+
+        # sendmany from node1: twice to self, twice to node2:
+        node_0_addr_0 = self.nodes[0].getnewaddress()
+        node_0_addr_1 = self.nodes[0].getnewaddress()
+        node_1_addr_0 = self.nodes[1].getnewaddress()
+        node_1_addr_1 = self.nodes[1].getnewaddress()
+        send_to = { node_0_addr_0 : 0.11,
+                    node_1_addr_0 : 0.22,
+                    node_0_addr_1 : 0.33,
+                    node_1_addr_1 : 0.44 }
+        txid = self.nodes[1].sendmany("", send_to)
+        self.sync_all()
+        check_array_result(self.nodes[1].listtransactions(),
+                           {"category":"send","amount":Decimal("-0.11"),"amountZat":-11000000},
+                           {"txid":txid} )
+        check_array_result(self.nodes[0].listtransactions(),
+                           {"category":"receive","amount":Decimal("0.11"),"amountZat":11000000},
+                           {"txid":txid} )
+        check_array_result(self.nodes[1].listtransactions(),
+                           {"category":"send","amount":Decimal("-0.22"),"amountZat":-22000000},
+                           {"txid":txid} )
+        check_array_result(self.nodes[1].listtransactions(),
+                           {"category":"receive","amount":Decimal("0.22"),"amountZat":22000000},
+                           {"txid":txid} )
+        check_array_result(self.nodes[1].listtransactions(),
+                           {"category":"send","amount":Decimal("-0.33"),"amountZat":-33000000},
+                           {"txid":txid} )
+        check_array_result(self.nodes[0].listtransactions(),
+                           {"category":"receive","amount":Decimal("0.33"),"amountZat":33000000},
+                           {"txid":txid} )
+        check_array_result(self.nodes[1].listtransactions(),
+                           {"category":"send","amount":Decimal("-0.44"),"amountZat":-44000000},
+                           {"txid":txid} )
+        check_array_result(self.nodes[1].listtransactions(),
+                           {"category":"receive","amount":Decimal("0.44"),"amountZat":44000000},
+                           {"txid":txid} )
+
+        multisig = self.nodes[1].createmultisig(1, [self.nodes[1].getnewaddress()])
+        self.nodes[0].importaddress(multisig["redeemScript"], "watchonly", False, True)
+        txid = self.nodes[1].sendtoaddress(multisig["address"], 0.1)
+        self.nodes[1].generate(1)
+        self.sync_all()
+        check_array_result(self.nodes[0].listtransactions("*", 100, 0, True),
+                           {"category":"receive","amount":Decimal("0.1"),"amountZat":10000000},
+                           {"txid":txid, "involvesWatchonly": True} )
+
+if __name__ == '__main__':
+    ListTransactionsTest().main()
diff --git a/depend/zcash/qa/rpc-tests/maxblocksinflight.py b/depend/zcash/qa/rpc-tests/maxblocksinflight.py
new file mode 100755
index 000000000..9b4cd2048
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/maxblocksinflight.py
@@ -0,0 +1,105 @@
+#!/usr/bin/env python3
+# Copyright (c) 2015-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.mininode import NodeConn, NodeConnCB, NetworkThread, \
+    EarlyDisconnectError, CInv, msg_inv, mininode_lock
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import ZCASHD_BINARY, start_nodes, p2p_port
+
+import os
+import time
+import random
+import logging
+
+'''
+In this test we connect to one node over p2p, send it numerous inv's, and
+compare the resulting number of getdata requests to a max allowed value.  We
+test for exceeding 128 blocks in flight, which was the limit an 0.9 client will
+reach. [0.10 clients shouldn't request more than 16 from a single peer.]
+'''
+MAX_REQUESTS = 128
+
+class TestManager(NodeConnCB):
+    # set up NodeConnCB callbacks, overriding base class
+    def on_getdata(self, conn, message):
+        self.log.debug("got getdata %s" % repr(message))
+        # Log the requests
+        for inv in message.inv:
+            if inv.hash not in self.blockReqCounts:
+                self.blockReqCounts[inv.hash] = 0
+            self.blockReqCounts[inv.hash] += 1
+
+    def on_close(self, conn):
+        if not self.disconnectOkay:
+            raise EarlyDisconnectError(0)
+
+    def __init__(self):
+        NodeConnCB.__init__(self)
+        self.log = logging.getLogger("BlockRelayTest")
+        self.create_callback_map()
+
+    def add_new_connection(self, connection):
+        self.connection = connection
+        self.blockReqCounts = {}
+        self.disconnectOkay = False
+
+    def run(self):
+        try:
+            self.connection.rpc.generate(1) # Leave IBD
+
+            numBlocksToGenerate = [ 8, 16, 128, 1024 ]
+            for count in range(len(numBlocksToGenerate)):
+                current_invs = []
+                for i in range(numBlocksToGenerate[count]):
+                    current_invs.append(CInv(2, random.randrange(0, 1<<256)))
+                    if len(current_invs) >= 50000:
+                        self.connection.send_message(msg_inv(current_invs))
+                        current_invs = []
+                if len(current_invs) > 0:
+                    self.connection.send_message(msg_inv(current_invs))
+
+                # Wait and see how many blocks were requested
+                time.sleep(2)
+
+                total_requests = 0
+                with mininode_lock:
+                    for key in self.blockReqCounts:
+                        total_requests += self.blockReqCounts[key]
+                        if self.blockReqCounts[key] > 1:
+                            raise AssertionError("Error, test failed: block %064x requested more than once" % key)
+                if total_requests > MAX_REQUESTS:
+                    raise AssertionError("Error, too many blocks (%d) requested" % total_requests)
+                print("Round %d: success (total requests: %d)" % (count, total_requests))
+        except AssertionError as e:
+            print("TEST FAILED: ", e.args)
+
+        self.disconnectOkay = True
+        self.connection.disconnect_node()
+
+
+class MaxBlocksInFlightTest(BitcoinTestFramework):
+    def add_options(self, parser):
+        parser.add_option("--testbinary", dest="testbinary",
+                          default=os.getenv("ZCASHD", ZCASHD_BINARY),
+                          help="Binary to test max block requests behavior")
+
+    def __init__(self):
+        super().__init__()
+        self.setup_clean_chain = True
+        self.num_nodes = 1
+
+    def setup_network(self):
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir,
+                                 extra_args=[['-debug', '-whitelist=127.0.0.1']],
+                                 binary=[self.options.testbinary])
+
+    def run_test(self):
+        test = TestManager()
+        test.add_new_connection(NodeConn('127.0.0.1', p2p_port(0), self.nodes[0], test))
+        NetworkThread().start()  # Start up network handling in another thread
+        test.run()
+
+if __name__ == '__main__':
+    MaxBlocksInFlightTest().main()
diff --git a/depend/zcash/qa/rpc-tests/maxuploadtarget.py b/depend/zcash/qa/rpc-tests/maxuploadtarget.py
new file mode 100755
index 000000000..74cce7469
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/maxuploadtarget.py
@@ -0,0 +1,305 @@
+#!/usr/bin/env python3
+#
+# Distributed under the MIT/X11 software license, see the accompanying
+# file COPYING or http://www.opensource.org/licenses/mit-license.php.
+#
+
+from test_framework.mininode import ( \
+        NodeConn, NodeConnCB, CInv, NetworkThread, \
+        msg_ping, msg_pong, msg_getdata, \
+        BLOSSOM_PROTO_VERSION
+        )
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import ( \
+        ZCASHD_BINARY, assert_equal, initialize_chain_clean, \
+        start_node, stop_node, \
+        p2p_port, \
+        )
+from test_framework.comptool import wait_until
+from decimal import Decimal
+import os
+import time
+
+'''
+Test behavior of -maxuploadtarget.
+
+* Verify that getdata requests for old blocks (>1week) are dropped
+if uploadtarget has been reached.
+* Verify that getdata requests for recent blocks are respected even
+if uploadtarget has been reached.
+* Verify that the upload counters are reset after 24 hours.
+'''
+
+# TestNode: bare-bones "peer".  Used mostly as a conduit for a test to sending
+# p2p messages to a node, generating the messages in the main testing logic.
+class TestNode(NodeConnCB):
+    def __init__(self):
+        NodeConnCB.__init__(self)
+        self.create_callback_map()
+        self.connection = None
+        self.ping_counter = 1
+        self.last_pong = msg_pong()
+        self.block_receive_map = {}
+
+    def add_connection(self, conn):
+        self.connection = conn
+        self.peer_disconnected = False
+
+    def on_inv(self, conn, message):
+        pass
+
+    # Track the last getdata message we receive (used in the test)
+    def on_getdata(self, conn, message):
+        self.last_getdata = message
+
+    def on_block(self, conn, message):
+        message.block.calc_sha256()
+        try:
+            self.block_receive_map[message.block.sha256] += 1
+        except KeyError:
+            self.block_receive_map[message.block.sha256] = 1
+
+    # Spin until verack message is received from the node.
+    # We use this to signal that our test can begin. This
+    # is called from the testing thread, so it needs to acquire
+    # the global lock.
+    def wait_for_verack(self):
+        def veracked():
+            return self.verack_received
+        return wait_until(veracked, timeout=10)
+
+    def wait_for_disconnect(self):
+        def disconnected():
+            return self.peer_disconnected
+        return wait_until(disconnected, timeout=10)
+
+    # Wrapper for the NodeConn's send_message function
+    def send_message(self, message):
+        self.connection.send_message(message)
+
+    def on_pong(self, conn, message):
+        self.last_pong = message
+
+    def on_close(self, conn):
+        self.peer_disconnected = True
+
+    # Sync up with the node after delivery of a block
+    def sync_with_ping(self, timeout=30):
+        def received_pong():
+            return (self.last_pong.nonce == self.ping_counter)
+        self.connection.send_message(msg_ping(nonce=self.ping_counter))
+        success = wait_until(received_pong, timeout)
+        self.ping_counter += 1
+        return success
+
+class MaxUploadTest(BitcoinTestFramework):
+    def __init__(self):
+        self.utxo = []
+
+        # Some pre-processing to create a bunch of OP_RETURN txouts to insert into transactions we create
+        # So we have big transactions and full blocks to fill up our block files
+        # create one script_pubkey
+        script_pubkey = "6a4d0200" #OP_RETURN OP_PUSH2 512 bytes
+        for _ in range(512):
+            script_pubkey = script_pubkey + "01"
+        # concatenate 128 txouts of above script_pubkey which we'll insert before the txout for change
+        self.txouts = "81"
+        for _ in range(128):
+            # add txout value
+            self.txouts = self.txouts + "0000000000000000"
+            # add length of script_pubkey
+            self.txouts = self.txouts + "fd0402"
+            # add script_pubkey
+            self.txouts = self.txouts + script_pubkey
+
+    def add_options(self, parser):
+        parser.add_option("--testbinary", dest="testbinary",
+                          default=os.getenv("ZCASHD", ZCASHD_BINARY),
+                          help="zcashd binary to test")
+
+    def setup_chain(self):
+        initialize_chain_clean(self.options.tmpdir, 2)
+
+    def setup_network(self):
+        # Start a node with maxuploadtarget of 200 MB (/24h)
+        self.nodes = []
+        self.nodes.append(start_node(0, self.options.tmpdir, [
+            "-debug",
+            '-nuparams=2bb40e60:1', # Blossom
+            "-maxuploadtarget=2200"]))
+
+    def mine_full_block(self, node, address):
+        # Want to create a full block
+        # We'll generate a 66k transaction below, and 28 of them is close to the 2MB block limit
+        for _ in range(28):
+            if len(self.utxo) < 28:
+                self.utxo = node.listunspent()
+            inputs=[]
+            outputs = {}
+            t = self.utxo.pop()
+            inputs.append({ "txid" : t["txid"], "vout" : t["vout"]})
+            remchange = t["amount"] - Decimal("0.001000")
+            outputs[address]=remchange
+            # Create a basic transaction that will send change back to ourself after account for a fee
+            # and then insert the 128 generated transaction outs in the middle. rawtx[100] is where the
+            # number of txouts is stored and is the only thing we overwrite from the original transaction
+            rawtx = node.createrawtransaction(inputs, outputs)
+            newtx = rawtx[0:100]
+            newtx = newtx + self.txouts
+            newtx = newtx + rawtx[102:]
+            # Appears to be ever so slightly faster to sign with SIGHASH_NONE
+            signresult = node.signrawtransaction(newtx,None,None,"NONE")
+            node.sendrawtransaction(signresult["hex"], True)
+        # Mine a full sized block which will be these transactions we just created
+        node.generate(1)
+
+    def run_test(self):
+        # Before we connect anything, we first set the time on the node
+        # to be in the past, otherwise things break because the CNode
+        # time counters can't be reset backward after initialization
+        old_time = int(time.time() - 60*60*24*9)
+        self.nodes[0].setmocktime(old_time)
+
+        # Generate some old blocks
+        self.nodes[0].generate(260)
+
+        # test_nodes[0] will only request old blocks
+        # test_nodes[1] will only request new blocks
+        # test_nodes[2] will test resetting the counters
+        test_nodes = []
+        connections = []
+
+        for i in range(3):
+            test_nodes.append(TestNode())
+            connections.append(NodeConn('127.0.0.1', p2p_port(0), self.nodes[0], test_nodes[i], protocol_version=BLOSSOM_PROTO_VERSION))
+            test_nodes[i].add_connection(connections[i])
+
+        NetworkThread().start() # Start up network handling in another thread
+        [x.wait_for_verack() for x in test_nodes]
+
+        # Test logic begins here
+
+        # Now mine a big block
+        self.mine_full_block(self.nodes[0], self.nodes[0].getnewaddress())
+
+        # Store the hash; we'll request this later
+        big_old_block = self.nodes[0].getbestblockhash()
+        old_block_size = self.nodes[0].getblock(big_old_block, True)['size']
+        big_old_block = int(big_old_block, 16)
+
+        # Advance to two days ago
+        self.nodes[0].setmocktime(int(time.time()) - 2*60*60*24)
+
+        # Generate interim blocks. Due to the "max MTP" soft-forked rule, block timestamps
+        # can be no more than 1.5 hours ahead of the chain tip's MTP. Thus we need to mine
+        # enough blocks to advance the MTP forward to the desired mocked time.
+        self.nodes[0].generate(1000)
+
+        # Mine one more block, so that the prior block looks old
+        self.mine_full_block(self.nodes[0], self.nodes[0].getnewaddress())
+
+        # We'll be requesting this new block too
+        big_new_block = self.nodes[0].getbestblockhash()
+        big_new_block = int(big_new_block, 16)
+
+        # test_nodes[0] will test what happens if we just keep requesting the
+        # the same big old block too many times (expect: disconnect)
+
+        getdata_request = msg_getdata()
+        getdata_request.inv.append(CInv(2, big_old_block))
+
+        max_bytes_per_day = 2200*1024*1024
+        daily_buffer = 1152 * 2000000
+        max_bytes_available = max_bytes_per_day - daily_buffer
+        success_count = max_bytes_available / old_block_size
+
+        # 2304GB will be reserved for relaying new blocks, so expect this to
+        # succeed for ~14 tries.
+        for i in range(int(success_count)):
+            test_nodes[0].send_message(getdata_request)
+            test_nodes[0].sync_with_ping()
+            assert_equal(test_nodes[0].block_receive_map[big_old_block], i+1)
+
+        assert_equal(len(self.nodes[0].getpeerinfo()), 3)
+        # At most a couple more tries should succeed (depending on how long
+        # the test has been running so far).
+        for i in range(3):
+            test_nodes[0].send_message(getdata_request)
+        test_nodes[0].wait_for_disconnect()
+        assert_equal(len(self.nodes[0].getpeerinfo()), 2)
+        print("Peer 0 disconnected after downloading old block too many times")
+
+        # Requesting the current block on test_nodes[1] should succeed indefinitely,
+        # even when over the max upload target.
+        # We'll try 200 times
+        getdata_request.inv = [CInv(2, big_new_block)]
+        for i in range(200):
+            test_nodes[1].send_message(getdata_request)
+            test_nodes[1].sync_with_ping()
+            assert_equal(test_nodes[1].block_receive_map[big_new_block], i+1)
+
+        print("Peer 1 able to repeatedly download new block")
+
+        # But if test_nodes[1] tries for an old block, it gets disconnected too.
+        getdata_request.inv = [CInv(2, big_old_block)]
+        test_nodes[1].send_message(getdata_request)
+        test_nodes[1].wait_for_disconnect()
+        assert_equal(len(self.nodes[0].getpeerinfo()), 1)
+
+        print("Peer 1 disconnected after trying to download old block")
+
+        print("Advancing system time on node to clear counters...")
+
+        # If we advance the time by 24 hours, then the counters should reset,
+        # and test_nodes[2] should be able to retrieve the old block.
+        self.nodes[0].setmocktime(int(time.time()))
+        test_nodes[2].sync_with_ping()
+        test_nodes[2].send_message(getdata_request)
+        test_nodes[2].sync_with_ping()
+        assert_equal(test_nodes[2].block_receive_map[big_old_block], 1)
+
+        print("Peer 2 able to download old block")
+
+        [c.disconnect_node() for c in connections]
+
+        #stop and start node 0 with 1MB maxuploadtarget, whitelist 127.0.0.1
+        print("Restarting nodes with -whitelist=127.0.0.1")
+        stop_node(self.nodes[0], 0)
+        self.nodes[0] = start_node(0, self.options.tmpdir, [
+            "-debug",
+            '-nuparams=2bb40e60:1', # Blossom
+            "-whitelist=127.0.0.1",
+            "-maxuploadtarget=1",
+        ])
+
+        #recreate/reconnect 3 test nodes
+        test_nodes = []
+        connections = []
+
+        for i in range(3):
+            test_nodes.append(TestNode())
+            connections.append(NodeConn('127.0.0.1', p2p_port(0), self.nodes[0], test_nodes[i], protocol_version=BLOSSOM_PROTO_VERSION))
+            test_nodes[i].add_connection(connections[i])
+
+        NetworkThread().start() # Start up network handling in another thread
+        [x.wait_for_verack() for x in test_nodes]
+
+        #retrieve 20 blocks which should be enough to break the 1MB limit
+        getdata_request.inv = [CInv(2, big_new_block)]
+        for i in range(20):
+            test_nodes[1].send_message(getdata_request)
+            test_nodes[1].sync_with_ping()
+            assert_equal(test_nodes[1].block_receive_map[big_new_block], i+1)
+
+        getdata_request.inv = [CInv(2, big_old_block)]
+        test_nodes[1].send_message(getdata_request)
+        test_nodes[1].wait_for_disconnect()
+        assert_equal(len(self.nodes[0].getpeerinfo()), 3) #node is still connected because of the whitelist
+
+        print("Peer 1 still connected after trying to download old block (whitelisted)")
+
+        [c.disconnect_node() for c in connections]
+
+if __name__ == '__main__':
+    MaxUploadTest().main()
diff --git a/depend/zcash/qa/rpc-tests/mempool_limit.py b/depend/zcash/qa/rpc-tests/mempool_limit.py
new file mode 100755
index 000000000..f230d25b7
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/mempool_limit.py
@@ -0,0 +1,106 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    assert_equal,
+    get_coinbase_address,
+    fail,
+    start_nodes,
+    wait_and_assert_operationid_status,
+    DEFAULT_FEE
+)
+
+from decimal import Decimal
+from time import sleep
+
+# Test wallet behaviour with Sapling addresses
+class MempoolLimit(BitcoinTestFramework):
+    def setup_nodes(self):
+        extra_args = [
+            ["-debug=mempool", '-mempooltxcostlimit=8000'], # 2 transactions at min cost
+            ["-debug=mempool", '-mempooltxcostlimit=8000'], # 2 transactions at min cost
+            ["-debug=mempool", '-mempooltxcostlimit=8000'], # 2 transactions at min cost
+            # Let node 3 hold one more transaction
+            ["-debug=mempool", '-mempooltxcostlimit=12000'], # 3 transactions at min cost
+        ]
+        return start_nodes(self.num_nodes, self.options.tmpdir, extra_args)
+
+    def check_mempool_sizes(self, expected_size, check_node3=True):
+        for i in range(self.num_nodes if check_node3 else self.num_nodes - 1):
+            mempool = self.nodes[i].getrawmempool()
+            if len(mempool) != expected_size:
+                # print all nodes' mempools before failing
+                for i in range(self.num_nodes):
+                    print("Mempool for node {}: {}".format(i, mempool))
+                fail("Fail: Mempool for node {}: size={}, expected={}".format(i, len(mempool), expected_size))
+
+    def __init__(self):
+        super().__init__()
+        self.setup_clean_chain = True
+        self.num_nodes = 4
+
+    def run_test(self):
+        print("Mining blocks...")
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+        self.nodes[2].generate(1)
+        self.sync_all()
+        self.nodes[3].generate(1)
+        self.sync_all()
+        self.nodes[0].generate(100)
+        self.sync_all()
+        assert_equal(Decimal("10.00"), Decimal(self.nodes[1].z_gettotalbalance()['transparent']))
+        assert_equal(Decimal("10.00"), Decimal(self.nodes[2].z_gettotalbalance()['transparent']))
+        assert_equal(Decimal("10.00"), Decimal(self.nodes[3].z_gettotalbalance()['transparent']))
+
+        zaddr1 = self.nodes[0].z_getnewaddress('sapling')
+        zaddr2 = self.nodes[0].z_getnewaddress('sapling')
+        zaddr3 = self.nodes[0].z_getnewaddress('sapling')
+
+        print("Filling mempool...")
+        opid1 = self.nodes[1].z_sendmany(get_coinbase_address(self.nodes[1]), [{"address": zaddr1, "amount": Decimal('10.0') - DEFAULT_FEE}])
+        wait_and_assert_operationid_status(self.nodes[1], opid1)
+        opid2 = self.nodes[2].z_sendmany(get_coinbase_address(self.nodes[2]), [{"address": zaddr2, "amount": Decimal('10.0') - DEFAULT_FEE}])
+        wait_and_assert_operationid_status(self.nodes[2], opid2)
+        self.sync_all()
+
+        self.check_mempool_sizes(2)
+
+        print("Adding one more transaction...")
+        opid3 = self.nodes[3].z_sendmany(get_coinbase_address(self.nodes[3]), [{"address": zaddr3, "amount": Decimal('10.0') - DEFAULT_FEE}])
+        wait_and_assert_operationid_status(self.nodes[3], opid3)
+        # The mempools are no longer guaranteed to be in a consistent state, so we cannot sync
+        sleep(5)
+        mempool_node3 = self.nodes[3].getrawmempool()
+        assert_equal(3, len(mempool_node3), "node {}".format(3))
+
+        print("Checking mempool size...")
+        # Due to the size limit, there should only be 2 transactions in the mempool
+        self.check_mempool_sizes(2, False)
+
+        self.nodes[3].generate(1)
+        self.sync_all()
+
+        # The mempool sizes should be reset
+        print("Checking mempool size reset after block mined...")
+        self.check_mempool_sizes(0)
+        zaddr4 = self.nodes[0].z_getnewaddress('sapling')
+        opid4 = self.nodes[0].z_sendmany(zaddr1, [{"address": zaddr4, "amount": Decimal('10.0') - 2*DEFAULT_FEE}], 1)
+        wait_and_assert_operationid_status(self.nodes[0], opid4)
+        opid5 = self.nodes[0].z_sendmany(zaddr2, [{"address": zaddr4, "amount": Decimal('10.0') - 2*DEFAULT_FEE}], 1)
+        wait_and_assert_operationid_status(self.nodes[0], opid5)
+        self.sync_all()
+
+        self.check_mempool_sizes(2)
+
+        # Make sure the transactions are mined without error
+        self.nodes[3].generate(1)
+        self.sync_all()
+
+
+if __name__ == '__main__':
+    MempoolLimit().main()
diff --git a/depend/zcash/qa/rpc-tests/mempool_nu_activation.py b/depend/zcash/qa/rpc-tests/mempool_nu_activation.py
new file mode 100755
index 000000000..14d5df2c2
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/mempool_nu_activation.py
@@ -0,0 +1,208 @@
+#!/usr/bin/env python3
+# Copyright (c) 2018 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.mininode import NU5_PROTO_VERSION
+from test_framework.util import (
+    BLOSSOM_BRANCH_ID,
+    CANOPY_BRANCH_ID,
+    HEARTWOOD_BRANCH_ID,
+    NU5_BRANCH_ID,
+    assert_equal, assert_true,
+    nuparams,
+    start_node, connect_nodes, wait_and_assert_operationid_status,
+    get_coinbase_address
+)
+
+from decimal import Decimal
+
+# Test mempool behaviour around network upgrade activation
+class MempoolUpgradeActivationTest(BitcoinTestFramework):
+
+    alert_filename = None  # Set by setup_network
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 2
+        self.setup_clean_chain = True
+
+    def setup_network(self):
+        args = ["-checkmempool", "-debug=mempool", "-blockmaxsize=4000",
+            nuparams(BLOSSOM_BRANCH_ID, 200),
+            nuparams(HEARTWOOD_BRANCH_ID, 210),
+            nuparams(CANOPY_BRANCH_ID, 220),
+            nuparams(NU5_BRANCH_ID, 230),
+        ]
+        self.nodes = []
+        self.nodes.append(start_node(0, self.options.tmpdir, args))
+        self.nodes.append(start_node(1, self.options.tmpdir, args))
+        connect_nodes(self.nodes[1], 0)
+        self.is_network_split = False
+        self.sync_all
+
+    def run_test(self):
+        self.nodes[1].generate(100)
+        self.sync_all()
+
+        # Mine 97 blocks. After this, nodes[1] blocks
+        # 1 to 97 are spend-able.
+        self.nodes[0].generate(94)
+        self.sync_all()
+
+        # Shield some ZEC
+        node1_taddr = get_coinbase_address(self.nodes[1])
+        node0_zaddr = self.nodes[0].z_getnewaddress('sapling')
+        recipients = [{'address': node0_zaddr, 'amount': Decimal('10')}]
+        myopid = self.nodes[1].z_sendmany(node1_taddr, recipients, 1, 0)
+        print(wait_and_assert_operationid_status(self.nodes[1], myopid))
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # Mempool checks for activation of upgrade Y at height H on base X
+        def nu_activation_checks():
+            # Start at block H - 5. After this, the mempool expects block H - 4, which is
+            # the last height at which we can create transactions for X blocks (due to the
+            # expiring-soon restrictions).
+
+            # Mempool should be empty.
+            assert_equal(set(self.nodes[0].getrawmempool()), set())
+
+            # Check node 0 shielded balance
+            assert_equal(self.nodes[0].z_getbalance(node0_zaddr), Decimal('10'))
+
+            # Fill the mempool with more transactions than can fit into 4 blocks
+            node0_taddr = self.nodes[0].getnewaddress()
+            x_txids = []
+            while self.nodes[1].getmempoolinfo()['bytes'] < 8 * 4000:
+                x_txids.append(self.nodes[1].sendtoaddress(node0_taddr, Decimal('0.001')))
+            self.sync_all()
+
+            # Spends should be in the mempool
+            x_mempool = set(self.nodes[0].getrawmempool())
+            assert_equal(x_mempool, set(x_txids))
+            assert_equal(set(self.nodes[1].getrawmempool()), set(x_txids))
+
+            blocks = []
+
+            # Mine block H - 4. After this, the mempool expects
+            # block H - 3, which is an X block.
+            self.nodes[0].generate(1)
+            self.sync_all()
+            blocks.append(self.nodes[0].getblock(self.nodes[0].getbestblockhash())['tx'])
+
+            # mempool should not be empty.
+            assert_true(len(set(self.nodes[0].getrawmempool())) > 0)
+            assert_true(len(set(self.nodes[1].getrawmempool())) > 0)
+
+            # Mine block H - 3. After this, the mempool expects
+            # block H - 2, which is an X block.
+            self.nodes[0].generate(1)
+            self.sync_all()
+            blocks.append(self.nodes[0].getblock(self.nodes[0].getbestblockhash())['tx'])
+
+            # mempool should not be empty.
+            assert_true(len(set(self.nodes[0].getrawmempool())) > 0)
+            assert_true(len(set(self.nodes[1].getrawmempool())) > 0)
+
+            # Mine block H - 2. After this, the mempool expects
+            # block H - 1, which is an X block.
+            self.nodes[0].generate(1)
+            self.sync_all()
+            blocks.append(self.nodes[0].getblock(self.nodes[0].getbestblockhash())['tx'])
+
+            # mempool should not be empty.
+            assert_true(len(set(self.nodes[0].getrawmempool())) > 0)
+            assert_true(len(set(self.nodes[1].getrawmempool())) > 0)
+
+            # Mine block H - 1. After this, the mempool expects
+            # block H, which is the first Y block.
+            self.nodes[0].generate(1)
+            self.sync_all()
+            blocks.append(self.nodes[0].getblock(self.nodes[0].getbestblockhash())['tx'])
+
+            # mempool should be empty.
+            assert_equal(set(self.nodes[0].getrawmempool()), set())
+            assert_equal(set(self.nodes[1].getrawmempool()), set())
+
+            # Blocks [H - 4..H - 1] should contain a subset of the original mempool
+            # (with all other transactions having been dropped)
+            assert(sum([len(block_txids) for block_txids in blocks]) < len(x_txids))
+            for block_txids in blocks:
+                for txid in block_txids[1:]: # Exclude coinbase
+                    assert(txid in x_txids)
+
+            # Create some transparent Y transactions
+            y_txids = [self.nodes[1].sendtoaddress(node0_taddr, Decimal('0.001')) for i in range(10)]
+            self.sync_all()
+
+            # Create a shielded Y transaction
+            recipients = [{'address': node0_zaddr, 'amount': Decimal('10')}]
+            myopid = self.nodes[0].z_sendmany(node0_zaddr, recipients, 1,0)
+            shielded = wait_and_assert_operationid_status(self.nodes[0], myopid)
+            assert(shielded != None)
+            y_txids.append(shielded)
+            self.sync_all()
+
+            # Spends should be in the mempool
+            assert_equal(set(self.nodes[0].getrawmempool()), set(y_txids))
+            assert_equal(set(self.nodes[1].getrawmempool()), set(y_txids))
+
+            # Node 0 note should be unspendable
+            assert_equal(self.nodes[0].z_getbalance(node0_zaddr), Decimal('0'))
+
+            # Invalidate block H - 1.
+            block_hm1 = self.nodes[0].getbestblockhash()
+            self.nodes[0].invalidateblock(block_hm1)
+
+            # BUG: Ideally, the mempool should now only contain the transactions
+            # that were in block H - 1, the Y transactions having been dropped.
+            # However, because chainActive is not updated until after the transactions
+            # in the disconnected block have been re-added to the mempool, the height
+            # seen by AcceptToMemoryPool is one greater than it should be. This causes
+            # the block H - 1 transactions to be validated against the Y rules,
+            # and rejected because they (obviously) fail.
+            #assert_equal(set(self.nodes[0].getrawmempool()), set(block_txids[1:]))
+            assert_equal(set(self.nodes[0].getrawmempool()), set())
+
+            # Node 1's mempool is unaffected because it still considers block H - 1 valid.
+            assert_equal(set(self.nodes[1].getrawmempool()), set(y_txids))
+
+            # Node 0 note should be spendable again
+            assert_equal(self.nodes[0].z_getbalance(node0_zaddr), Decimal('10'))
+
+            # Reconsider block H - 1.
+            self.nodes[0].reconsiderblock(block_hm1)
+
+            # Mine blocks on node 1, so that the Y transactions in its mempool
+            # will be cleared.
+            self.nodes[1].generate(6)
+            self.sync_all()
+
+        net_version = self.nodes[0].getnetworkinfo()["protocolversion"]
+
+        print('Testing Sapling -> Blossom activation boundary')
+        # Current height = 195
+        nu_activation_checks()
+        # Current height = 205
+
+        print('Testing Blossom -> Heartwood activation boundary')
+        nu_activation_checks()
+        # Current height = 215
+
+        print('Testing Heartwood -> Canopy activation boundary')
+        nu_activation_checks()
+        # Current height = 225
+
+        if net_version < NU5_PROTO_VERSION:
+            print("Node's block index is not NU5-aware, skipping remaining tests")
+            return
+
+        print('Testing Canopy -> NU5 activation boundary')
+        nu_activation_checks()
+        # Current height = 235
+
+if __name__ == '__main__':
+    MempoolUpgradeActivationTest().main()
diff --git a/depend/zcash/qa/rpc-tests/mempool_reorg.py b/depend/zcash/qa/rpc-tests/mempool_reorg.py
new file mode 100755
index 000000000..e809195dc
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/mempool_reorg.py
@@ -0,0 +1,109 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Test re-org scenarios with a mempool that contains transactions
+# that spend (directly or indirectly) coinbase transactions.
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.authproxy import JSONRPCException
+from test_framework.util import assert_equal, assert_raises, start_node, connect_nodes
+
+
+# Create one-input, one-output, no-fee transaction:
+class MempoolCoinbaseTest(BitcoinTestFramework):
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 2
+        self.setup_clean_chain = False
+
+    alert_filename = None  # Set by setup_network
+
+    def setup_network(self):
+        args = ["-checkmempool", "-debug=mempool"]
+        self.nodes = []
+        self.nodes.append(start_node(0, self.options.tmpdir, args))
+        self.nodes.append(start_node(1, self.options.tmpdir, args))
+        connect_nodes(self.nodes[1], 0)
+        self.is_network_split = False
+        self.sync_all
+
+    def create_tx(self, from_txid, to_address, amount):
+        inputs = [{ "txid" : from_txid, "vout" : 0}]
+        outputs = { to_address : amount }
+        rawtx = self.nodes[0].createrawtransaction(inputs, outputs)
+        signresult = self.nodes[0].signrawtransaction(rawtx)
+        assert_equal(signresult["complete"], True)
+        return signresult["hex"]
+
+    def run_test(self):
+        # Mine three blocks. After this, nodes[0] blocks
+        # 101, 102, and 103 are spend-able.
+        new_blocks = self.nodes[1].generate(4)
+        self.sync_all()
+
+        node0_address = self.nodes[0].getnewaddress()
+        node1_address = self.nodes[1].getnewaddress()
+
+        # Three scenarios for re-orging coinbase spends in the memory pool:
+        # 1. Direct coinbase spend  :  spend_101
+        # 2. Indirect (coinbase spend in chain, child in mempool) : spend_102 and spend_102_1
+        # 3. Indirect (coinbase and child both in chain) : spend_103 and spend_103_1
+        # Use invalidatblock to make all of the above coinbase spends invalid (immature coinbase),
+        # and make sure the mempool code behaves correctly.
+        b = [ self.nodes[0].getblockhash(n) for n in range(101, 105) ]
+        coinbase_txids = [ self.nodes[0].getblock(h)['tx'][0] for h in b ]
+        spend_101_raw = self.create_tx(coinbase_txids[1], node1_address, 10)
+        spend_102_raw = self.create_tx(coinbase_txids[2], node0_address, 10)
+        spend_103_raw = self.create_tx(coinbase_txids[3], node0_address, 10)
+
+        # Create a block-height-locked transaction which will be invalid after reorg
+        timelock_tx = self.nodes[0].createrawtransaction([{"txid": coinbase_txids[0], "vout": 0}], {node0_address: 10})
+        # Set the time lock, ensuring we don't clobber the rest of the Sapling v4 tx format
+        timelock_tx = timelock_tx.replace("ffffffff", "11111111", 1)
+        timelock_tx = timelock_tx[:-38] + hex(self.nodes[0].getblockcount() + 2)[2:] + "000000" + timelock_tx[-30:]
+        timelock_tx = self.nodes[0].signrawtransaction(timelock_tx)["hex"]
+        assert_raises(JSONRPCException, self.nodes[0].sendrawtransaction, timelock_tx)
+
+        # Broadcast and mine spend_102 and 103:
+        spend_102_id = self.nodes[0].sendrawtransaction(spend_102_raw)
+        spend_103_id = self.nodes[0].sendrawtransaction(spend_103_raw)
+        self.nodes[0].generate(1)
+        assert_raises(JSONRPCException, self.nodes[0].sendrawtransaction, timelock_tx)
+
+        # Create 102_1 and 103_1:
+        spend_102_1_raw = self.create_tx(spend_102_id, node1_address, 10)
+        spend_103_1_raw = self.create_tx(spend_103_id, node1_address, 10)
+
+        # Broadcast and mine 103_1:
+        spend_103_1_id = self.nodes[0].sendrawtransaction(spend_103_1_raw)
+        last_block = self.nodes[0].generate(1)
+        timelock_tx_id = self.nodes[0].sendrawtransaction(timelock_tx)
+
+        # ... now put spend_101 and spend_102_1 in memory pools:
+        spend_101_id = self.nodes[0].sendrawtransaction(spend_101_raw)
+        spend_102_1_id = self.nodes[0].sendrawtransaction(spend_102_1_raw)
+
+        self.sync_all()
+
+        assert_equal(set(self.nodes[0].getrawmempool()), set([ spend_101_id, spend_102_1_id, timelock_tx_id ]))
+
+        for node in self.nodes:
+            node.invalidateblock(last_block[0])
+        assert_equal(set(self.nodes[0].getrawmempool()), set([ spend_101_id, spend_102_1_id, spend_103_1_id ]))
+
+        # Use invalidateblock to re-org back and make all those coinbase spends
+        # immature/invalid:
+        for node in self.nodes:
+            node.invalidateblock(new_blocks[0])
+
+        self.sync_all()
+
+        # mempool should be empty.
+        assert_equal(set(self.nodes[0].getrawmempool()), set())
+
+if __name__ == '__main__':
+    MempoolCoinbaseTest().main()
diff --git a/depend/zcash/qa/rpc-tests/mempool_resurrect_test.py b/depend/zcash/qa/rpc-tests/mempool_resurrect_test.py
new file mode 100755
index 000000000..45b1a6704
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/mempool_resurrect_test.py
@@ -0,0 +1,95 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Test resurrection of mined transactions when
+# the blockchain is re-organized.
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, start_node, DEFAULT_FEE
+
+from decimal import Decimal
+
+
+# Create one-input, one-output, no-fee transaction:
+class MempoolCoinbaseTest(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 1
+        self.setup_clean_chain = False
+
+    def setup_network(self):
+        # Just need one node for this test
+        args = ["-checkmempool", "-debug=mempool"]
+        self.nodes = []
+        self.nodes.append(start_node(0, self.options.tmpdir, args))
+        self.is_network_split = False
+
+    def create_tx(self, from_txid, to_address, amount):
+        inputs = [{ "txid" : from_txid, "vout" : 0}]
+        outputs = { to_address : amount }
+        rawtx = self.nodes[0].createrawtransaction(inputs, outputs)
+        signresult = self.nodes[0].signrawtransaction(rawtx)
+        assert_equal(signresult["complete"], True)
+        return signresult["hex"]
+
+    def run_test(self):
+        node0_address = self.nodes[0].getnewaddress()
+        # Spend block 1/2/3's coinbase transactions
+        # Mine a block.
+        # Create three more transactions, spending the spends
+        # Mine another block.
+        # ... make sure all the transactions are confirmed
+        # Invalidate both blocks
+        # ... make sure all the transactions are put back in the mempool
+        # Mine a new block
+        # ... make sure all the transactions are confirmed again.
+
+        b = [ self.nodes[0].getblockhash(n) for n in range(1, 4) ]
+        coinbase_txids = [ self.nodes[0].getblock(h)['tx'][0] for h in b ]
+        spends1_raw = [ self.create_tx(txid, node0_address, 10) for txid in coinbase_txids ]
+        spends1_id = [ self.nodes[0].sendrawtransaction(tx) for tx in spends1_raw ]
+
+        blocks = []
+        blocks.extend(self.nodes[0].generate(1))
+
+        spends2_raw = [ self.create_tx(txid, node0_address, Decimal('10.0') - DEFAULT_FEE) for txid in spends1_id ]
+        spends2_id = [ self.nodes[0].sendrawtransaction(tx) for tx in spends2_raw ]
+
+        blocks.extend(self.nodes[0].generate(1))
+        self.sync_all()
+
+        # mempool should be empty, all txns confirmed
+        assert_equal(set(self.nodes[0].getrawmempool()), set())
+        for txid in spends1_id+spends2_id:
+            tx = self.nodes[0].gettransaction(txid)
+            assert(tx["confirmations"] > 0)
+
+        # Use invalidateblock to re-org back; all transactions should
+        # end up unconfirmed and back in the mempool
+        for node in self.nodes:
+            node.invalidateblock(blocks[0])
+
+        # mempool should be empty, all txns confirmed
+        assert_equal(set(self.nodes[0].getrawmempool()), set(spends1_id+spends2_id))
+        for txid in spends1_id+spends2_id:
+            tx = self.nodes[0].gettransaction(txid)
+            assert(tx["confirmations"] == 0)
+
+        # Generate another block, they should all get mined
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # mempool should be empty, all txns confirmed
+        assert_equal(set(self.nodes[0].getrawmempool()), set())
+        for txid in spends1_id+spends2_id:
+            tx = self.nodes[0].gettransaction(txid)
+            assert(tx["confirmations"] > 0)
+
+
+if __name__ == '__main__':
+    MempoolCoinbaseTest().main()
diff --git a/depend/zcash/qa/rpc-tests/mempool_spendcoinbase.py b/depend/zcash/qa/rpc-tests/mempool_spendcoinbase.py
new file mode 100755
index 000000000..b692cd513
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/mempool_spendcoinbase.py
@@ -0,0 +1,90 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Test spending coinbase transactions.
+# The coinbase transaction in block N can appear in block
+# N+100... so is valid in the mempool when the best block
+# height is N+99.
+# This test makes sure coinbase spends that will be mature
+# in the next block are accepted into the memory pool,
+# but less mature coinbase spends are NOT.
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.authproxy import JSONRPCException
+from test_framework.util import assert_equal, assert_greater_than, assert_raises, \
+    start_node
+
+
+# Create one-input, one-output, no-fee transaction:
+class MempoolSpendCoinbaseTest(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 1
+        self.setup_clean_chain = False
+
+    def setup_network(self):
+        # Just need one node for this test
+        args = ["-checkmempool", "-debug=mempool"]
+        self.nodes = []
+        self.nodes.append(start_node(0, self.options.tmpdir, args))
+        self.is_network_split = False
+
+    def create_tx(self, from_txid, to_address, amount):
+        inputs = [{ "txid" : from_txid, "vout" : 0}]
+        outputs = { to_address : amount }
+        rawtx = self.nodes[0].createrawtransaction(inputs, outputs)
+        signresult = self.nodes[0].signrawtransaction(rawtx)
+        assert_equal(signresult["complete"], True)
+        return signresult["hex"]
+
+    def run_test(self):
+        chain_height = self.nodes[0].getblockcount()
+        assert_equal(chain_height, 200)
+        node0_address = self.nodes[0].getnewaddress()
+
+        # Coinbase at height chain_height-100+1 ok in mempool, should
+        # get mined. Coinbase at height chain_height-100+2 is
+        # is too immature to spend.
+        b = [ self.nodes[0].getblockhash(n) for n in range(101, 103) ]
+        coinbase_txids = [ self.nodes[0].getblock(h)['tx'][0] for h in b ]
+        spends_raw = [ self.create_tx(txid, node0_address, 10) for txid in coinbase_txids ]
+
+        spend_101_id = self.nodes[0].sendrawtransaction(spends_raw[0])
+
+        # coinbase at height 102 should be too immature to spend
+        assert_raises(JSONRPCException, self.nodes[0].sendrawtransaction, spends_raw[1])
+
+        # mempool should have just spend_101:
+        mempoolinfo = self.nodes[0].getmempoolinfo()
+        assert_equal(mempoolinfo['size'], 1)
+        assert_equal(self.nodes[0].getrawmempool(), [ spend_101_id ])
+
+        # the size of the memory pool should be greater than 1x ~100 bytes
+        assert_greater_than(mempoolinfo['bytes'], 100)
+        # the actual memory usage should be strictly greater than the size
+        # of the memory pool
+        assert_greater_than(mempoolinfo['usage'], mempoolinfo['bytes'])
+
+        # mine a block, spend_101 should get confirmed
+        self.nodes[0].generate(1)
+        mempoolinfo = self.nodes[0].getmempoolinfo()
+        assert_equal(mempoolinfo['size'], 0)
+        assert_equal(mempoolinfo['bytes'], 0)
+        assert_equal(mempoolinfo['usage'], 0)
+        assert_equal(set(self.nodes[0].getrawmempool()), set())
+
+        # ... and now height 102 can be spent:
+        spend_102_id = self.nodes[0].sendrawtransaction(spends_raw[1])
+        mempoolinfo = self.nodes[0].getmempoolinfo()
+        assert_equal(mempoolinfo['size'], 1)
+        assert_equal(self.nodes[0].getrawmempool(), [ spend_102_id ])
+        assert_greater_than(mempoolinfo['bytes'], 100)
+        assert_greater_than(mempoolinfo['usage'], mempoolinfo['bytes'])
+
+if __name__ == '__main__':
+    MempoolSpendCoinbaseTest().main()
diff --git a/depend/zcash/qa/rpc-tests/mempool_tx_expiry.py b/depend/zcash/qa/rpc-tests/mempool_tx_expiry.py
new file mode 100755
index 000000000..4e4aec95d
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/mempool_tx_expiry.py
@@ -0,0 +1,268 @@
+#!/usr/bin/env python3
+# Copyright (c) 2018 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Test proper expiry for transactions >= version 4
+#
+
+from test_framework.authproxy import JSONRPCException
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, \
+    connect_nodes_bi, sync_blocks, start_nodes, \
+    wait_and_assert_operationid_status, DEFAULT_FEE
+
+from decimal import Decimal
+
+TX_EXPIRING_SOON_THRESHOLD = 3
+TX_EXPIRY_DELTA = 10
+
+class MempoolTxExpiryTest(BitcoinTestFramework):
+
+    def setup_nodes(self):
+        return start_nodes(self.num_nodes, self.options.tmpdir,
+            [[
+                "-txexpirydelta=%d" % TX_EXPIRY_DELTA,
+                "-debug=mempool"
+            ]] * self.num_nodes)
+
+    # Test before, at, and after expiry block
+    # chain is at block height 199 when run_test executes
+    def run_test(self):
+        alice = self.nodes[0].getnewaddress()
+        z_alice = self.nodes[0].z_getnewaddress('sapling')
+        bob = self.nodes[2].getnewaddress()
+        z_bob = self.nodes[2].z_getnewaddress('sapling')
+
+        print("Splitting network...")
+        self.split_network()
+
+        # Test dependent txs
+        firstTx = self.nodes[0].sendtoaddress(alice, 0.1)
+        firstTxInfo = self.nodes[0].getrawtransaction(firstTx, 1)
+        assert_equal(firstTxInfo["version"], 4)
+        assert_equal(firstTxInfo["overwintered"], True)
+        assert("expiryheight" in firstTxInfo)
+        print("First tx expiry height:", firstTxInfo['expiryheight'])
+        # Mine first transaction
+        self.nodes[0].generate(1)
+        for outpoint in firstTxInfo['vout']:
+            if outpoint['value'] == Decimal('0.10000000'):
+                vout = outpoint
+                break
+        inputs = [{'txid': firstTx, 'vout': vout['n'], 'scriptPubKey': vout['scriptPubKey']['hex']}]
+        outputs = {alice: 0.1}
+        rawTx = self.nodes[0].createrawtransaction(inputs, outputs)
+        rawTxSigned = self.nodes[0].signrawtransaction(rawTx)
+        assert(rawTxSigned['complete'])
+        secondTx = self.nodes[0].sendrawtransaction(rawTxSigned['hex'])
+        secondTxInfo = self.nodes[0].getrawtransaction(secondTx, 1)
+        print("Second tx expiry height:", secondTxInfo['expiryheight'])
+        # Mine second, dependent transaction
+        self.nodes[0].generate(1)
+        print("Mine %d competing blocks on Node 2..." % (2 + TX_EXPIRY_DELTA))
+        blocks = self.nodes[2].generate(2 + TX_EXPIRY_DELTA)
+        print("Connect nodes to force a reorg")
+        connect_nodes_bi(self.nodes,0,2)
+        self.is_network_split = False
+        print("Syncing blocks")
+        sync_blocks(self.nodes)
+        print("Ensure that both txs are dropped from mempool of node 0")
+        print("Blockheight node 0:", self.nodes[0].getblockchaininfo()['blocks'])
+        print("Blockheight node 2:", self.nodes[2].getblockchaininfo()['blocks'])
+        assert_equal(set(self.nodes[0].getrawmempool()), set())
+        assert_equal(set(self.nodes[2].getrawmempool()), set())
+
+        ## Shield one of Alice's coinbase funds to her zaddr
+        res = self.nodes[0].z_shieldcoinbase("*", z_alice, DEFAULT_FEE, 1)
+        wait_and_assert_operationid_status(self.nodes[0], res['opid'])
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # Get balance on node 0
+        bal = self.nodes[0].z_gettotalbalance()
+        print("Balance before zsend, after shielding 10: ", bal)
+        assert_equal(Decimal(bal["private"]), Decimal('10.0') - DEFAULT_FEE)
+
+        print("Splitting network...")
+        self.split_network()
+
+        # Create transactions
+        blockheight = self.nodes[0].getblockchaininfo()['blocks']
+        zsendamount = Decimal('1.0') - DEFAULT_FEE
+        recipients = []
+        recipients.append({"address": z_bob, "amount": zsendamount})
+        myopid = self.nodes[0].z_sendmany(z_alice, recipients, 1)
+        persist_shielded = wait_and_assert_operationid_status(self.nodes[0], myopid)
+        persist_transparent = self.nodes[0].sendtoaddress(bob, 0.01)
+        # Verify transparent transaction is version 4 intended for Sapling branch
+        rawtx = self.nodes[0].getrawtransaction(persist_transparent, 1)
+        assert_equal(rawtx["version"], 4)
+        assert_equal(rawtx["overwintered"], True)
+        assert_equal(rawtx["expiryheight"], blockheight + 1 + TX_EXPIRY_DELTA)
+        print("Blockheight at persist_transparent & persist_shielded creation:", self.nodes[0].getblockchaininfo()['blocks'])
+        print("Expiryheight of persist_transparent:", rawtx['expiryheight'])
+        # Verify shielded transaction is version 4 intended for Sapling branch
+        rawtx = self.nodes[0].getrawtransaction(persist_shielded, 1)
+        print("Expiryheight of persist_shielded", rawtx['expiryheight'])
+        assert_equal(rawtx["version"], 4)
+        assert_equal(rawtx["overwintered"], True)
+        assert_equal(rawtx["expiryheight"], blockheight + 1 + TX_EXPIRY_DELTA)
+
+        print("\nBlockheight advances to less than expiry block height. After reorg, txs should persist in mempool")
+        assert(persist_transparent in self.nodes[0].getrawmempool())
+        assert(persist_shielded in self.nodes[0].getrawmempool())
+        assert_equal(set(self.nodes[2].getrawmempool()), set())
+        print("mempool node 0:", self.nodes[0].getrawmempool())
+        print("mempool node 2:", self.nodes[2].getrawmempool())
+        bal = self.nodes[0].z_gettotalbalance()
+        print("Printing balance before persist_shielded & persist_transparent are initially mined from mempool", bal)
+        # Txs are mined on node 0; will later be rolled back
+        self.nodes[0].generate(1)
+        print("Node 0 generated 1 block")
+        print("Node 0 height:", self.nodes[0].getblockchaininfo()['blocks'])
+        print("Node 2 height:", self.nodes[2].getblockchaininfo()['blocks'])
+        bal = self.nodes[0].z_gettotalbalance()
+        print("Printing balance after persist_shielded & persist_transparent are mined:", bal)
+        assert_equal(set(self.nodes[0].getrawmempool()), set())
+
+        print("Mine 2 competing blocks on Node 2...")
+        blocks = self.nodes[2].generate(2)
+        for block in blocks:
+            blk = self.nodes[2].getblock(block)
+            print("Height: {0}, Mined block txs: {1}".format(blk["height"], blk["tx"]))
+        print("Connect nodes to force a reorg")
+        connect_nodes_bi(self.nodes,0,2)
+        self.is_network_split = False
+
+        print("Syncing blocks")
+        sync_blocks(self.nodes)
+
+        print("Ensure that txs are back in mempool of node 0")
+        print("Blockheight node 0:", self.nodes[0].getblockchaininfo()['blocks'])
+        print("Blockheight node 2:", self.nodes[2].getblockchaininfo()['blocks'])
+        print("mempool node 0: ", self.nodes[0].getrawmempool())
+        print("mempool node 2: ", self.nodes[2].getrawmempool())
+        assert(persist_transparent in self.nodes[0].getrawmempool())
+        assert(persist_shielded in self.nodes[0].getrawmempool())
+        bal = self.nodes[0].z_gettotalbalance()
+        # Mine txs to get them out of the way of mempool sync in split_network()
+        print("Generating another block on node 0 to clear txs from mempool")
+        self.nodes[0].generate(1)
+        assert_equal(set(self.nodes[0].getrawmempool()), set())
+        sync_blocks(self.nodes)
+
+        print("Splitting network...")
+        self.split_network()
+
+        print("\nBlockheight advances to equal expiry block height. After reorg, txs should persist in mempool")
+        myopid = self.nodes[0].z_sendmany(z_alice, recipients, 1)
+        persist_shielded_2 = wait_and_assert_operationid_status(self.nodes[0], myopid)
+        persist_transparent_2 = self.nodes[0].sendtoaddress(bob, 0.01)
+        rawtx_trans = self.nodes[0].getrawtransaction(persist_transparent_2, 1)
+        rawtx_shield = self.nodes[0].getrawtransaction(persist_shielded_2, 1)
+        print("Blockheight node 0 at persist_transparent_2 creation:", self.nodes[0].getblockchaininfo()['blocks'])
+        print("Blockheight node 2 at persist_transparent_2 creation:", self.nodes[2].getblockchaininfo()['blocks'])
+        print("Expiryheight of persist_transparent_2:", rawtx_trans['expiryheight'])
+        print("Expiryheight of persist_shielded_2:", rawtx_shield['expiryheight'])
+        blocks = self.nodes[2].generate(4)
+        for block in blocks:
+            blk = self.nodes[2].getblock(block)
+            print("Height: {0}, Mined block txs: {1}".format(blk["height"], blk["tx"]))
+        print("Connect nodes to force a reorg")
+        connect_nodes_bi(self.nodes, 0, 2)
+        self.is_network_split = False
+        sync_blocks(self.nodes)
+        print("Ensure that persist_transparent_2 & persist_shielded_2 are in mempool at expiry block height")
+        print("Blockheight node 0:", self.nodes[0].getblockchaininfo()['blocks'])
+        print("Blockheight node 2:", self.nodes[2].getblockchaininfo()['blocks'])
+        print("mempool node 0: ", self.nodes[0].getrawmempool())
+        print("mempool node 2: ", self.nodes[2].getrawmempool())
+        assert(persist_transparent_2 in self.nodes[0].getrawmempool())
+        assert(persist_shielded_2 in self.nodes[0].getrawmempool())
+        # Mine persist txs to get them out of the way of mempool sync in split_network()
+        self.nodes[0].generate(1)
+        assert_equal(set(self.nodes[0].getrawmempool()), set())
+        sync_blocks(self.nodes)
+        print("Balance after persist_shielded_2 is mined to remove from mempool: ", self.nodes[0].z_gettotalbalance())
+
+        print("Splitting network...")
+        self.split_network()
+
+        print("\nBlockheight advances to greater than expiry block height. After reorg, txs should expire from mempool")
+        print("Balance before expire_shielded is sent: ", self.nodes[0].z_gettotalbalance())
+        myopid = self.nodes[0].z_sendmany(z_alice, recipients, 1)
+        expire_shielded = wait_and_assert_operationid_status(self.nodes[0], myopid)
+        expire_transparent = self.nodes[0].sendtoaddress(bob, 0.01)
+        print("Blockheight node 0 at expire_transparent creation:", self.nodes[0].getblockchaininfo()['blocks'])
+        print("Blockheight node 2 at expire_shielded creation:", self.nodes[2].getblockchaininfo()['blocks'])
+        print("Expiryheight of expire_transparent:", self.nodes[0].getrawtransaction(expire_transparent, 1)['expiryheight'])
+        print("Expiryheight of expire_shielded:", self.nodes[0].getrawtransaction(expire_shielded, 1)['expiryheight'])
+        assert(expire_transparent in self.nodes[0].getrawmempool())
+        assert(expire_shielded in self.nodes[0].getrawmempool())
+        blocks = self.nodes[2].generate(1 + TX_EXPIRY_DELTA + 1)
+        for block in blocks:
+            blk = self.nodes[2].getblock(block)
+            print("Height: {0}, Mined block txs: {1}".format(blk["height"], blk["tx"]))
+        print("Connect nodes to force a reorg")
+        connect_nodes_bi(self.nodes, 0, 2)
+        self.is_network_split = False
+        sync_blocks(self.nodes)
+        print("Ensure that expire_transparent & expire_shielded are not in mempool after expiry block height")
+        print("mempool node 0: ", self.nodes[0].getrawmempool())
+        print("mempool node 2: ", self.nodes[2].getrawmempool())
+        assert_equal(set(self.nodes[0].getrawmempool()), set())
+        print("Ensure balance of node 0 is correct")
+        bal = self.nodes[0].z_gettotalbalance()
+        print("Balance after expire_shielded has expired: ", bal)
+        assert_equal(Decimal(bal["private"]), Decimal('8.0') - DEFAULT_FEE)
+
+        print("Splitting network...")
+        self.split_network()
+
+        print("\nBlockheight advances to just before expiring soon threshold.  Txs should be rejected from entering mempool.")
+        print("Balance before expire_shielded is sent: ", self.nodes[0].z_gettotalbalance())
+        myopid = self.nodes[0].z_sendmany(z_alice, recipients, 1)
+        expire_shielded = wait_and_assert_operationid_status(self.nodes[0], myopid)
+        expire_transparent = self.nodes[0].sendtoaddress(bob, 0.01)
+        print("Blockheight node 0 at expire_transparent creation:", self.nodes[0].getblockchaininfo()['blocks'])
+        print("Blockheight node 2 at expire_shielded creation:", self.nodes[2].getblockchaininfo()['blocks'])
+        print("Expiryheight of expire_transparent:", self.nodes[0].getrawtransaction(expire_transparent, 1)['expiryheight'])
+        print("Expiryheight of expire_shielded:", self.nodes[0].getrawtransaction(expire_shielded, 1)['expiryheight'])
+        assert(expire_transparent in self.nodes[0].getrawmempool())
+        assert(expire_shielded in self.nodes[0].getrawmempool())
+        blocks = self.nodes[2].generate(1 + TX_EXPIRY_DELTA - TX_EXPIRING_SOON_THRESHOLD - 1)
+        for block in blocks:
+            blk = self.nodes[2].getblock(block)
+            print("Height: {0}, Mined block txs: {1}".format(blk["height"], blk["tx"]))
+        print("Connect nodes to force a reorg")
+        connect_nodes_bi(self.nodes, 0, 2)
+        self.is_network_split = False
+        sync_blocks(self.nodes)
+        print("Ensure that expire_transparent & expire_shielded are in node 0 mempool but not node 2 mempool")
+        print("mempool node 0: ", self.nodes[0].getrawmempool())
+        print("mempool node 2: ", self.nodes[2].getrawmempool())
+        assert(expire_transparent in self.nodes[0].getrawmempool())
+        assert(expire_shielded in self.nodes[0].getrawmempool())
+        assert(expire_transparent not in self.nodes[2].getrawmempool())
+        assert(expire_shielded not in self.nodes[2].getrawmempool())
+
+        # Now try to add the transactions to Node 2 mempool.
+        # Node 2 mempool will accept a transaction since block height has not reached the expiring soon threshold.
+        rawtx = self.nodes[0].getrawtransaction(expire_transparent)
+        self.nodes[2].sendrawtransaction(rawtx)
+
+        # Generate a block and enter the expiring soon threshold.
+        self.nodes[2].generate(1)
+        # Node 2 mempool will reject a transaction which is expiring soon.
+        try:
+            rawtx = self.nodes[0].getrawtransaction(expire_shielded)
+            self.nodes[2].sendrawtransaction(rawtx)
+            assert(False)
+        except JSONRPCException as e:
+            errorString = e.error['message']
+            assert("tx-expiring-soon" in errorString)
+
+if __name__ == '__main__':
+    MempoolTxExpiryTest().main()
diff --git a/depend/zcash/qa/rpc-tests/mergetoaddress_helper.py b/depend/zcash/qa/rpc-tests/mergetoaddress_helper.py
new file mode 100755
index 000000000..50f28c8fd
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/mergetoaddress_helper.py
@@ -0,0 +1,365 @@
+#!/usr/bin/env python3
+# Copyright (c) 2018 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Common code for testing z_mergetoaddress before and after sapling activation
+#
+
+from test_framework.authproxy import JSONRPCException
+from test_framework.util import assert_equal, connect_nodes_bi, fail, \
+    initialize_chain_clean, start_node, sync_blocks, sync_mempools, \
+    wait_and_assert_operationid_status, DEFAULT_FEE
+
+from decimal import Decimal
+
+
+def assert_mergetoaddress_exception(expected_error_msg, merge_to_address_lambda):
+    try:
+        merge_to_address_lambda()
+    except JSONRPCException as e:
+        assert_equal(expected_error_msg, e.error['message'])
+    except Exception as e:
+        fail("Expected JSONRPCException. Found %s" % repr(e))
+    else:
+        fail("Expected exception: %s" % expected_error_msg)
+
+
+class MergeToAddressHelper:
+
+    def __init__(self, addr_type, any_zaddr, utxos_to_generate, utxos_in_tx1, utxos_in_tx2):
+        self.addr_type = addr_type
+        self.any_zaddr = [any_zaddr]
+        self.any_zaddr_or_utxo = [any_zaddr, "ANY_TADDR"]
+        # utxos_to_generate, utxos_in_tx1, utxos_in_tx2 have to do with testing transaction size limits
+        self.utxos_to_generate = utxos_to_generate
+        self.utxos_in_tx1 = utxos_in_tx1
+        self.utxos_in_tx2 = utxos_in_tx2
+
+    def setup_chain(self, test):
+        print("Initializing test directory "+test.options.tmpdir)
+        initialize_chain_clean(test.options.tmpdir, 4)
+
+    def setup_network(self, test, additional_args=[]):
+        args = ['-debug=zrpcunsafe']
+        args += additional_args
+        test.nodes = []
+        test.nodes.append(start_node(0, test.options.tmpdir, args))
+        test.nodes.append(start_node(1, test.options.tmpdir, args))
+        args2 = ['-debug=zrpcunsafe']
+        args2 += additional_args
+        test.nodes.append(start_node(2, test.options.tmpdir, args2))
+        connect_nodes_bi(test.nodes, 0, 1)
+        connect_nodes_bi(test.nodes, 1, 2)
+        connect_nodes_bi(test.nodes, 0, 2)
+        test.is_network_split = False
+        test.sync_all()
+
+    def run_test(self, test):
+        print("Mining blocks...")
+
+        test.nodes[0].generate(1)
+        do_not_shield_taddr = test.nodes[0].getnewaddress()
+
+        test.nodes[0].generate(4)
+        test.sync_all()
+        walletinfo = test.nodes[0].getwalletinfo()
+        assert_equal(walletinfo['immature_balance'], 50)
+        assert_equal(walletinfo['balance'], 0)
+        test.sync_all()
+        test.nodes[2].generate(1)
+        test.nodes[2].getnewaddress()
+        test.nodes[2].generate(1)
+        test.nodes[2].getnewaddress()
+        test.nodes[2].generate(1)
+        test.sync_all()
+        test.nodes[1].generate(101)
+        test.sync_all()
+        assert_equal(test.nodes[0].getbalance(), 50)
+        assert_equal(test.nodes[1].getbalance(), 10)
+        assert_equal(test.nodes[2].getbalance(), 30)
+
+        # Shield the coinbase
+        myzaddr = test.nodes[0].z_getnewaddress(self.addr_type)
+        result = test.nodes[0].z_shieldcoinbase("*", myzaddr, 0)
+        wait_and_assert_operationid_status(test.nodes[0], result['opid'])
+        test.sync_all()
+        test.nodes[1].generate(1)
+        test.sync_all()
+
+        # Prepare some UTXOs and notes for merging
+        mytaddr = test.nodes[0].getnewaddress()
+        mytaddr2 = test.nodes[0].getnewaddress()
+        mytaddr3 = test.nodes[0].getnewaddress()
+        result = test.nodes[0].z_sendmany(myzaddr, [
+            {'address': do_not_shield_taddr, 'amount': 10},
+            {'address': mytaddr, 'amount': 10},
+            {'address': mytaddr2, 'amount': 10},
+            {'address': mytaddr3, 'amount': 10},
+            ], 1, 0)
+        wait_and_assert_operationid_status(test.nodes[0], result)
+        test.sync_all()
+        test.nodes[1].generate(1)
+        test.sync_all()
+
+        # Merging will fail because from arguments need to be in an array
+        assert_mergetoaddress_exception(
+            "JSON value is not an array as expected",
+            lambda: test.nodes[0].z_mergetoaddress("notanarray", myzaddr))
+
+        # Merging will fail when trying to spend from watch-only address
+        test.nodes[2].importaddress(mytaddr)
+        assert_mergetoaddress_exception(
+            "Could not find any funds to merge.",
+            lambda: test.nodes[2].z_mergetoaddress([mytaddr], myzaddr))
+
+        # Merging will fail because fee is negative
+        assert_mergetoaddress_exception(
+            "Amount out of range",
+            lambda: test.nodes[0].z_mergetoaddress(self.any_zaddr_or_utxo, myzaddr, -1))
+
+        # Merging will fail because fee is larger than MAX_MONEY
+        assert_mergetoaddress_exception(
+            "Amount out of range",
+            lambda: test.nodes[0].z_mergetoaddress(self.any_zaddr_or_utxo, myzaddr, Decimal('21000000.00000001')))
+
+        # Merging will fail because fee is larger than sum of UTXOs
+        assert_mergetoaddress_exception(
+            "Insufficient funds, have 50.00, which is less than miners fee 999.00",
+            lambda: test.nodes[0].z_mergetoaddress(self.any_zaddr_or_utxo, myzaddr, 999))
+
+        # Merging will fail because transparent limit parameter must be at least 0
+        assert_mergetoaddress_exception(
+            "Limit on maximum number of UTXOs cannot be negative",
+            lambda: test.nodes[0].z_mergetoaddress(self.any_zaddr_or_utxo, myzaddr, Decimal('0.001'), -1))
+
+        # Merging will fail because transparent limit parameter is absurdly large
+        assert_mergetoaddress_exception(
+            "JSON integer out of range",
+            lambda: test.nodes[0].z_mergetoaddress(self.any_zaddr_or_utxo, myzaddr, Decimal('0.001'), 99999999999999))
+
+        # Merging will fail because shielded limit parameter must be at least 0
+        assert_mergetoaddress_exception(
+            "Limit on maximum number of notes cannot be negative",
+            lambda: test.nodes[0].z_mergetoaddress(self.any_zaddr_or_utxo, myzaddr, Decimal('0.001'), 50, -1))
+
+        # Merging will fail because shielded limit parameter is absurdly large
+        assert_mergetoaddress_exception(
+            "JSON integer out of range",
+            lambda: test.nodes[0].z_mergetoaddress(self.any_zaddr_or_utxo, myzaddr, Decimal('0.001'), 50, 99999999999999))
+
+        # Merging will fail for this specific case where it would spend a fee and do nothing
+        assert_mergetoaddress_exception(
+            "Destination address is also the only source address, and all its funds are already merged.",
+            lambda: test.nodes[0].z_mergetoaddress([mytaddr], mytaddr))
+
+        # Merging will fail if we try to specify from Sprout AND Sapling
+        assert_mergetoaddress_exception(
+            "Cannot send from both Sprout and Sapling addresses using z_mergetoaddress",
+            lambda: test.nodes[0].z_mergetoaddress(["ANY_SPROUT", "ANY_SAPLING"], mytaddr))
+
+        # Merge UTXOs from node 0 of value 30, default fee
+        result = test.nodes[0].z_mergetoaddress([mytaddr, mytaddr2, mytaddr3], myzaddr)
+        wait_and_assert_operationid_status(test.nodes[0], result['opid'])
+        test.sync_all()
+        test.nodes[1].generate(1)
+        test.sync_all()
+
+        # Confirm balances and that do_not_shield_taddr containing funds of 10 was left alone
+        assert_equal(test.nodes[0].getbalance(), 10)
+        assert_equal(test.nodes[0].z_getbalance(do_not_shield_taddr), Decimal('10.0'))
+        assert_equal(test.nodes[0].z_getbalance(myzaddr), Decimal('40.0') - DEFAULT_FEE)
+        assert_equal(test.nodes[1].getbalance(), 40)
+        assert_equal(test.nodes[2].getbalance(), 30)
+
+        # Shield all notes to another z-addr
+        myzaddr2 = test.nodes[0].z_getnewaddress(self.addr_type)
+        result = test.nodes[0].z_mergetoaddress(self.any_zaddr, myzaddr2, 0)
+        assert_equal(result["mergingUTXOs"], Decimal('0'))
+        assert_equal(result["remainingUTXOs"], Decimal('0'))
+        assert_equal(result["mergingNotes"], Decimal('2'))
+        assert_equal(result["remainingNotes"], Decimal('0'))
+        wait_and_assert_operationid_status(test.nodes[0], result['opid'])
+        test.sync_all()
+        blockhash = test.nodes[1].generate(1)
+        test.sync_all()
+
+        assert_equal(len(test.nodes[0].getblock(blockhash[0])['tx']), 2)
+        assert_equal(test.nodes[0].z_getbalance(myzaddr), 0)
+        assert_equal(test.nodes[0].z_getbalance(myzaddr2), Decimal('40.0') - DEFAULT_FEE)
+
+        # Shield coinbase UTXOs from any node 2 taddr, and set fee to 0
+        result = test.nodes[2].z_shieldcoinbase("*", myzaddr, 0)
+        wait_and_assert_operationid_status(test.nodes[2], result['opid'])
+        test.sync_all()
+        test.nodes[1].generate(1)
+        test.sync_all()
+
+        assert_equal(test.nodes[0].getbalance(), 10)
+        assert_equal(test.nodes[0].z_getbalance(myzaddr), Decimal('30'))
+        assert_equal(test.nodes[0].z_getbalance(myzaddr2), Decimal('40.0') - DEFAULT_FEE)
+        assert_equal(test.nodes[1].getbalance(), 60)
+        assert_equal(test.nodes[2].getbalance(), 0)
+
+        # Merge all notes from node 0 into a node 0 taddr, and set fee to 0
+        result = test.nodes[0].z_mergetoaddress(self.any_zaddr, mytaddr, 0)
+        wait_and_assert_operationid_status(test.nodes[0], result['opid'])
+        test.sync_all()
+        test.nodes[1].generate(1)
+        test.sync_all()
+
+        assert_equal(test.nodes[0].getbalance(), Decimal('80.0') - DEFAULT_FEE)
+        assert_equal(test.nodes[0].z_getbalance(do_not_shield_taddr), Decimal('10.0'))
+        assert_equal(test.nodes[0].z_getbalance(mytaddr), Decimal('70.0') - DEFAULT_FEE)
+        assert_equal(test.nodes[0].z_getbalance(myzaddr), 0)
+        assert_equal(test.nodes[0].z_getbalance(myzaddr2), 0)
+        assert_equal(test.nodes[1].getbalance(), 70)
+        assert_equal(test.nodes[2].getbalance(), 0)
+
+        # Merge all node 0 UTXOs together into a node 1 taddr, and set fee to 0
+        test.nodes[1].getnewaddress()  # Ensure we have an empty address
+        n1taddr = test.nodes[1].getnewaddress()
+        result = test.nodes[0].z_mergetoaddress(["ANY_TADDR"], n1taddr, 0)
+        wait_and_assert_operationid_status(test.nodes[0], result['opid'])
+        test.sync_all()
+        test.nodes[1].generate(1)
+        test.sync_all()
+
+        assert_equal(test.nodes[0].getbalance(), 0)
+        assert_equal(test.nodes[0].z_getbalance(do_not_shield_taddr), 0)
+        assert_equal(test.nodes[0].z_getbalance(mytaddr), 0)
+        assert_equal(test.nodes[0].z_getbalance(myzaddr), 0)
+        assert_equal(test.nodes[1].getbalance(), Decimal('160.0') - DEFAULT_FEE)
+        assert_equal(test.nodes[1].z_getbalance(n1taddr), Decimal('80.0') - DEFAULT_FEE)
+        assert_equal(test.nodes[2].getbalance(), 0)
+
+        # Generate self.utxos_to_generate regular UTXOs on node 0, and 20 regular UTXOs on node 2
+        mytaddr = test.nodes[0].getnewaddress()
+        n2taddr = test.nodes[2].getnewaddress()
+        test.nodes[1].generate(1000)
+        test.sync_all()
+        for i in range(self.utxos_to_generate):
+            test.nodes[1].sendtoaddress(mytaddr, 1)
+        for i in range(20):
+            test.nodes[1].sendtoaddress(n2taddr, 1)
+        test.nodes[1].generate(1)
+        test.sync_all()
+
+        # Merging the UTXOs will conditionally occur over two transactions, since max tx size is 100,000 bytes before Sapling and 2,000,000 after.
+        # We don't verify mergingTransparentValue as UTXOs are not selected in any specific order, so value can change on each test run.
+        # We set an unrealistically high limit parameter of 99999, to verify that max tx size will constrain the number of UTXOs.
+        result = test.nodes[0].z_mergetoaddress([mytaddr], myzaddr, 0, 99999)
+        assert_equal(result["mergingUTXOs"], self.utxos_in_tx1)
+        assert_equal(result["remainingUTXOs"], self.utxos_in_tx2)
+        assert_equal(result["mergingNotes"], Decimal('0'))
+        assert_equal(result["mergingShieldedValue"], Decimal('0'))
+        assert_equal(result["remainingNotes"], Decimal('0'))
+        assert_equal(result["remainingShieldedValue"], Decimal('0'))
+        remainingTransparentValue = result["remainingTransparentValue"]
+        wait_and_assert_operationid_status(test.nodes[0], result['opid'])
+
+        # For sapling we do not check that this occurs over two transactions because of the time that it would take
+        if self.utxos_in_tx2 > 0:
+            # Verify that UTXOs are locked (not available for selection) by queuing up another merging operation
+            result = test.nodes[0].z_mergetoaddress([mytaddr], myzaddr, 0, 0)
+            assert_equal(result["mergingUTXOs"], self.utxos_in_tx2)
+            assert_equal(result["mergingTransparentValue"], Decimal(remainingTransparentValue))
+            assert_equal(result["remainingUTXOs"], Decimal('0'))
+            assert_equal(result["remainingTransparentValue"], Decimal('0'))
+            assert_equal(result["mergingNotes"], Decimal('0'))
+            assert_equal(result["mergingShieldedValue"], Decimal('0'))
+            assert_equal(result["remainingNotes"], Decimal('0'))
+            assert_equal(result["remainingShieldedValue"], Decimal('0'))
+            wait_and_assert_operationid_status(test.nodes[0], result['opid'])
+
+        # sync_all() invokes sync_mempool() but node 2's mempool limit will cause tx1 and tx2 to be rejected.
+        # So instead, we sync on blocks and mempool for node 0 and node 1, and after a new block is generated
+        # which mines tx1 and tx2, all nodes will have an empty mempool which can then be synced.
+        sync_blocks(test.nodes[:2])
+        sync_mempools(test.nodes[:2])
+        # Generate enough blocks to ensure all transactions are mined
+        while test.nodes[1].getmempoolinfo()['size'] > 0:
+            test.nodes[1].generate(1)
+        test.sync_all()
+
+        # Verify maximum number of UTXOs which node 2 can shield is not limited
+        # when the limit parameter is set to 0.
+        expected_to_merge = 20
+        expected_remaining = 0
+
+        result = test.nodes[2].z_mergetoaddress([n2taddr], myzaddr, DEFAULT_FEE, 0)
+        assert_equal(result["mergingUTXOs"], expected_to_merge)
+        assert_equal(result["remainingUTXOs"], expected_remaining)
+        assert_equal(result["mergingNotes"], Decimal('0'))
+        assert_equal(result["remainingNotes"], Decimal('0'))
+        wait_and_assert_operationid_status(test.nodes[2], result['opid'])
+        test.sync_all()
+        test.nodes[1].generate(1)
+        test.sync_all()
+
+        # Verify maximum number of UTXOs which node 0 can shield is set by default limit parameter of 50
+        mytaddr = test.nodes[0].getnewaddress()
+        for i in range(100):
+            test.nodes[1].sendtoaddress(mytaddr, 1)
+        test.nodes[1].generate(1)
+        test.sync_all()
+        result = test.nodes[0].z_mergetoaddress([mytaddr], myzaddr, DEFAULT_FEE)
+        assert_equal(result["mergingUTXOs"], Decimal('50'))
+        assert_equal(result["remainingUTXOs"], Decimal('50'))
+        assert_equal(result["mergingNotes"], Decimal('0'))
+        # Remaining notes are only counted if we are trying to merge any notes
+        assert_equal(result["remainingNotes"], Decimal('0'))
+        wait_and_assert_operationid_status(test.nodes[0], result['opid'])
+
+        # Verify maximum number of UTXOs which node 0 can shield can be set by the limit parameter
+        result = test.nodes[0].z_mergetoaddress([mytaddr], myzaddr, DEFAULT_FEE, 33)
+        assert_equal(result["mergingUTXOs"], Decimal('33'))
+        assert_equal(result["remainingUTXOs"], Decimal('17'))
+        assert_equal(result["mergingNotes"], Decimal('0'))
+        # Remaining notes are only counted if we are trying to merge any notes
+        assert_equal(result["remainingNotes"], Decimal('0'))
+        wait_and_assert_operationid_status(test.nodes[0], result['opid'])
+        # Don't sync node 2 which rejects the tx due to its mempooltxinputlimit
+        sync_blocks(test.nodes[:2])
+        sync_mempools(test.nodes[:2])
+        test.nodes[1].generate(1)
+        test.sync_all()
+
+        # Verify maximum number of notes which node 0 can shield can be set by the limit parameter
+        # Also check that we can set off a second merge before the first one is complete
+
+        # myzaddr will have 5 notes if testing before to Sapling activation and 4 otherwise
+        num_notes = len(test.nodes[0].z_listunspent(0))
+        result1 = test.nodes[0].z_mergetoaddress([myzaddr], myzaddr, DEFAULT_FEE, 50, 2)
+        result2 = test.nodes[0].z_mergetoaddress([myzaddr], myzaddr, DEFAULT_FEE, 50, 2)
+
+        # First merge should select from all notes
+        assert_equal(result1["mergingUTXOs"], Decimal('0'))
+        # Remaining UTXOs are only counted if we are trying to merge any UTXOs
+        assert_equal(result1["remainingUTXOs"], Decimal('0'))
+        assert_equal(result1["mergingNotes"], Decimal('2'))
+        assert_equal(result1["remainingNotes"], num_notes - 2)
+
+        # Second merge should ignore locked notes
+        assert_equal(result2["mergingUTXOs"], Decimal('0'))
+        assert_equal(result2["remainingUTXOs"], Decimal('0'))
+        assert_equal(result2["mergingNotes"], Decimal('2'))
+        assert_equal(result2["remainingNotes"], num_notes - 4)
+        wait_and_assert_operationid_status(test.nodes[0], result1['opid'])
+        wait_and_assert_operationid_status(test.nodes[0], result2['opid'])
+
+        test.sync_all()
+        test.nodes[1].generate(1)
+        test.sync_all()
+
+        # Shield both UTXOs and notes to a z-addr
+        result = test.nodes[0].z_mergetoaddress(self.any_zaddr_or_utxo, myzaddr, 0, 10, 2)
+        assert_equal(result["mergingUTXOs"], Decimal('10'))
+        assert_equal(result["remainingUTXOs"], Decimal('7'))
+        assert_equal(result["mergingNotes"], Decimal('2'))
+        assert_equal(result["remainingNotes"], num_notes - 4)
+        wait_and_assert_operationid_status(test.nodes[0], result['opid'])
+        test.sync_all()
+        test.nodes[1].generate(1)
+        test.sync_all()
diff --git a/depend/zcash/qa/rpc-tests/mergetoaddress_mixednotes.py b/depend/zcash/qa/rpc-tests/mergetoaddress_mixednotes.py
new file mode 100755
index 000000000..59e01e5dd
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/mergetoaddress_mixednotes.py
@@ -0,0 +1,77 @@
+#!/usr/bin/env python3
+# Copyright (c) 2019 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from decimal import Decimal
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, get_coinbase_address, \
+    initialize_chain_clean, start_nodes, wait_and_assert_operationid_status
+from mergetoaddress_helper import assert_mergetoaddress_exception
+
+
+class MergeToAddressMixedNotes(BitcoinTestFramework):
+    def setup_nodes(self):
+        self.num_nodes = 4
+        return start_nodes(self.num_nodes, self.options.tmpdir, extra_args=[['-anchorconfirmations=1']] * self.num_nodes)
+
+    def setup_chain(self):
+        print("Initializing test directory " + self.options.tmpdir)
+        initialize_chain_clean(self.options.tmpdir, 4)
+
+    def run_test(self):
+        print("Mining blocks...")
+        self.nodes[0].generate(102)
+        self.sync_all()
+
+        # Send some ZEC to Sprout/Sapling addresses
+        coinbase_addr = get_coinbase_address(self.nodes[0])
+        sproutAddr = self.nodes[0].z_getnewaddress('sprout')
+        saplingAddr = self.nodes[0].z_getnewaddress('sapling')
+        t_addr = self.nodes[1].getnewaddress()
+
+        result = self.nodes[0].z_shieldcoinbase(coinbase_addr, sproutAddr, 0, 1)
+        wait_and_assert_operationid_status(self.nodes[0], result['opid'])
+        self.nodes[0].generate(1)
+        self.sync_all()
+        assert_equal(self.nodes[0].z_getbalance(sproutAddr), Decimal('10'))
+        assert_equal(self.nodes[0].z_getbalance(saplingAddr), Decimal('0'))
+        assert_equal(Decimal(self.nodes[1].z_gettotalbalance()["transparent"]), Decimal('0'))
+        # Make sure we cannot use "ANY_SPROUT" and "ANY_SAPLING" even if we only have Sprout Notes
+        assert_mergetoaddress_exception(
+            "Cannot send from both Sprout and Sapling addresses using z_mergetoaddress",
+            lambda: self.nodes[0].z_mergetoaddress(["ANY_SPROUT", "ANY_SAPLING"], t_addr))
+        opid = self.nodes[0].z_sendmany(coinbase_addr, [{"address": saplingAddr, "amount": Decimal('10')}], 1, 0)
+        wait_and_assert_operationid_status(self.nodes[0], opid)
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        assert_equal(Decimal(self.nodes[1].z_gettotalbalance()["transparent"]), Decimal('0'))
+
+        # Merge Sprout -> taddr
+        result = self.nodes[0].z_mergetoaddress(["ANY_SPROUT"], t_addr, 0)
+        wait_and_assert_operationid_status(self.nodes[0], result['opid'])
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        assert_equal(self.nodes[0].z_getbalance(sproutAddr), Decimal('0'))
+        assert_equal(self.nodes[0].z_getbalance(saplingAddr), Decimal('10'))
+        assert_equal(Decimal(self.nodes[1].z_gettotalbalance()["transparent"]), Decimal('10'))
+
+        # Make sure we cannot use "ANY_SPROUT" and "ANY_SAPLING" even if we only have Sapling Notes
+        assert_mergetoaddress_exception(
+            "Cannot send from both Sprout and Sapling addresses using z_mergetoaddress",
+            lambda: self.nodes[0].z_mergetoaddress(["ANY_SPROUT", "ANY_SAPLING"], t_addr))
+        # Merge Sapling -> taddr
+        result = self.nodes[0].z_mergetoaddress(["ANY_SAPLING"], t_addr, 0)
+        wait_and_assert_operationid_status(self.nodes[0], result['opid'])
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        assert_equal(self.nodes[0].z_getbalance(sproutAddr), Decimal('0'))
+        assert_equal(self.nodes[0].z_getbalance(saplingAddr), Decimal('0'))
+        assert_equal(Decimal(self.nodes[1].z_gettotalbalance()["transparent"]), Decimal('20'))
+
+
+if __name__ == '__main__':
+    MergeToAddressMixedNotes().main()
diff --git a/depend/zcash/qa/rpc-tests/mergetoaddress_sapling.py b/depend/zcash/qa/rpc-tests/mergetoaddress_sapling.py
new file mode 100755
index 000000000..80c6d9a17
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/mergetoaddress_sapling.py
@@ -0,0 +1,26 @@
+#!/usr/bin/env python3
+# Copyright (c) 2018 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from mergetoaddress_helper import MergeToAddressHelper
+
+
+class MergeToAddressSapling (BitcoinTestFramework):
+    # 13505 would be the maximum number of utxos based on the transaction size limits for Sapling
+    # but testing this causes the test to take an indeterminately long time to run.
+    helper = MergeToAddressHelper('sapling', 'ANY_SAPLING', 800, 800, 0)
+
+    def setup_chain(self):
+        self.helper.setup_chain(self)
+
+    def setup_network(self, split=False):
+        self.helper.setup_network(self, ['-anchorconfirmations=1'])
+
+    def run_test(self):
+        self.helper.run_test(self)
+
+
+if __name__ == '__main__':
+    MergeToAddressSapling().main()
diff --git a/depend/zcash/qa/rpc-tests/mergetoaddress_sprout.py b/depend/zcash/qa/rpc-tests/mergetoaddress_sprout.py
new file mode 100755
index 000000000..5ca4b0e5f
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/mergetoaddress_sprout.py
@@ -0,0 +1,26 @@
+#!/usr/bin/env python3
+# Copyright (c) 2018 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from mergetoaddress_helper import MergeToAddressHelper
+
+
+class MergeToAddressSprout (BitcoinTestFramework):
+    # 13505 would be the maximum number of utxos based on the transaction size limits for Sapling
+    # but testing this causes the test to take an indeterminately long time to run.
+    helper = MergeToAddressHelper('sprout', 'ANY_SPROUT', 800, 800, 0)
+
+    def setup_chain(self):
+        self.helper.setup_chain(self)
+
+    def setup_network(self, split=False):
+        self.helper.setup_network(self, ['-anchorconfirmations=1'])
+
+    def run_test(self):
+        self.helper.run_test(self)
+
+
+if __name__ == '__main__':
+    MergeToAddressSprout().main()
diff --git a/depend/zcash/qa/rpc-tests/merkle_blocks.py b/depend/zcash/qa/rpc-tests/merkle_blocks.py
new file mode 100755
index 000000000..2945861b3
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/merkle_blocks.py
@@ -0,0 +1,116 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Test merkleblock fetch/validation
+#
+
+import string
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.authproxy import JSONRPCException
+from test_framework.util import assert_equal, assert_raises, \
+    start_node, connect_nodes
+
+
+class MerkleBlockTest(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.setup_clean_chain = True
+        self.num_nodes = 4
+
+    def setup_network(self):
+        self.nodes = []
+        # Nodes 0/1 are "wallet" nodes
+        self.nodes.append(start_node(0, self.options.tmpdir, ["-debug"]))
+        self.nodes.append(start_node(1, self.options.tmpdir, ["-debug"]))
+        # Nodes 2/3 are used for testing
+        self.nodes.append(start_node(2, self.options.tmpdir, ["-debug"]))
+        self.nodes.append(start_node(3, self.options.tmpdir, ["-debug", "-txindex"]))
+        connect_nodes(self.nodes[0], 1)
+        connect_nodes(self.nodes[0], 2)
+        connect_nodes(self.nodes[0], 3)
+
+        self.is_network_split = False
+        self.sync_all()
+
+    def run_test(self):
+        print("Mining blocks...")
+        self.nodes[0].generate(105)
+        self.sync_all()
+
+        chain_height = self.nodes[1].getblockcount()
+        assert_equal(chain_height, 105)
+        assert_equal(self.nodes[1].getbalance(), 0)
+        assert_equal(self.nodes[2].getbalance(), 0)
+
+        node0utxos = self.nodes[0].listunspent(1)
+        tx1 = self.nodes[0].createrawtransaction([node0utxos.pop()], {self.nodes[1].getnewaddress(): 10})
+        txid1 = self.nodes[0].sendrawtransaction(self.nodes[0].signrawtransaction(tx1)["hex"])
+        tx2 = self.nodes[0].createrawtransaction([node0utxos.pop()], {self.nodes[1].getnewaddress(): 10})
+        txid2 = self.nodes[0].sendrawtransaction(self.nodes[0].signrawtransaction(tx2)["hex"])
+        assert_raises(JSONRPCException, self.nodes[0].gettxoutproof, [txid1])
+
+        self.nodes[0].generate(1)
+        blockhash = self.nodes[0].getblockhash(chain_height + 1)
+        self.sync_all()
+
+        txlist = []
+        blocktxn = self.nodes[0].getblock(blockhash, True)["tx"]
+        txlist.append(blocktxn[1])
+        txlist.append(blocktxn[2])
+
+        assert_equal(self.nodes[2].verifytxoutproof(self.nodes[2].gettxoutproof([txid1])), [txid1])
+        assert_equal(self.nodes[2].verifytxoutproof(self.nodes[2].gettxoutproof([txid1, txid2])), txlist)
+        assert_equal(self.nodes[2].verifytxoutproof(self.nodes[2].gettxoutproof([txid1, txid2], blockhash)), txlist)
+
+        txin_spent = self.nodes[1].listunspent(1).pop()
+        tx3 = self.nodes[1].createrawtransaction([txin_spent], {self.nodes[0].getnewaddress(): 10})
+        self.nodes[0].sendrawtransaction(self.nodes[1].signrawtransaction(tx3)["hex"])
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        txid_spent = txin_spent["txid"]
+        txid_unspent = txid1 if txin_spent["txid"] != txid1 else txid2
+
+        # We can't find the block from a fully-spent tx
+        assert_raises(JSONRPCException, self.nodes[2].gettxoutproof, [txid_spent])
+        # ...but we can if we specify the block
+        assert_equal(self.nodes[2].verifytxoutproof(self.nodes[2].gettxoutproof([txid_spent], blockhash)), [txid_spent])
+        # ...or if the first tx is not fully-spent
+        assert_equal(self.nodes[2].verifytxoutproof(self.nodes[2].gettxoutproof([txid_unspent])), [txid_unspent])
+        try:
+            assert_equal(self.nodes[2].verifytxoutproof(self.nodes[2].gettxoutproof([txid1, txid2])), txlist)
+        except JSONRPCException:
+            assert_equal(self.nodes[2].verifytxoutproof(self.nodes[2].gettxoutproof([txid2, txid1])), txlist)
+        # ...or if we have a -txindex
+        assert_equal(self.nodes[2].verifytxoutproof(self.nodes[3].gettxoutproof([txid_spent])), [txid_spent])
+
+        # Quick test of getblock using blockhash and different levels of verbosity
+        result = self.nodes[0].getblock(blockhash, 2)
+        coinbase_txid = result["tx"][0]["txid"]
+        result = self.nodes[0].getblock(blockhash, 1)
+        assert_equal(coinbase_txid, result["tx"][0])  # verbosity 1 only lists txids
+        result = self.nodes[0].getblock(blockhash, 0)
+        assert(c in string.hexdigits for c in result) # verbosity 0 returns raw hex
+
+        # Test getblock heights including negatives relative to the head
+        assert_equal(self.nodes[0].getblock("0")["height"], 0)
+        assert_raises(JSONRPCException, self.nodes[0].getblock, ["108"])
+        assert_equal(self.nodes[0].getblock("107")["height"], 107)
+        assert_equal(self.nodes[0].getblock("-1")["height"], 107)
+        assert_equal(self.nodes[0].getblock("-2")["height"], 106)
+        assert_equal(self.nodes[0].getblock("-20")["height"], 88)
+        assert_equal(self.nodes[0].getblock("-107")["height"], 1)
+        assert_equal(self.nodes[0].getblock("-108")["height"], 0)
+        assert_raises(JSONRPCException, self.nodes[0].getblock, ["-109"])
+        assert_raises(JSONRPCException, self.nodes[0].getblock, ["-0"])
+
+        # Test getblockhash negative heights
+        assert_equal(self.nodes[0].getblockhash(-1), self.nodes[0].getblockhash(107))
+        assert_equal(self.nodes[0].getblockhash(-2), self.nodes[0].getblockhash(106))
+
+if __name__ == '__main__':
+    MerkleBlockTest().main()
diff --git a/depend/zcash/qa/rpc-tests/mining_shielded_coinbase.py b/depend/zcash/qa/rpc-tests/mining_shielded_coinbase.py
new file mode 100755
index 000000000..3dee057e3
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/mining_shielded_coinbase.py
@@ -0,0 +1,170 @@
+#!/usr/bin/env python3
+# Copyright (c) 2019 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from decimal import Decimal
+from test_framework.authproxy import JSONRPCException
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.mininode import COIN, nuparams
+from test_framework.util import (
+    BLOSSOM_BRANCH_ID,
+    HEARTWOOD_BRANCH_ID,
+    CANOPY_BRANCH_ID,
+    NU5_BRANCH_ID,
+    assert_equal,
+    assert_raises,
+    bitcoind_processes,
+    connect_nodes,
+    start_node,
+    wait_and_assert_operationid_status,
+    check_node_log,
+)
+
+class ShieldCoinbaseTest (BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 4
+        self.setup_clean_chain = True
+
+    def start_node_with(self, index, extra_args=[]):
+        args = [
+            nuparams(BLOSSOM_BRANCH_ID, 1),
+            nuparams(HEARTWOOD_BRANCH_ID, 10),
+            nuparams(CANOPY_BRANCH_ID, 20),
+            nuparams(NU5_BRANCH_ID, 20),
+            "-nurejectoldversions=false",
+        ]
+        return start_node(index, self.options.tmpdir, args + extra_args)
+
+    def setup_network(self, split=False):
+        self.nodes = []
+        self.nodes.append(self.start_node_with(0))
+        self.nodes.append(self.start_node_with(1))
+        connect_nodes(self.nodes[1], 0)
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test (self):
+        # Generate a Sapling address for node 1
+        node1_zaddr = self.nodes[1].z_getnewaddress('sapling')
+
+        self.nodes[1].stop()
+        bitcoind_processes[1].wait()
+        self.nodes[1] = self.start_node_with(1, [
+            "-mineraddress=%s" % node1_zaddr,
+        ])
+        connect_nodes(self.nodes[1], 0)
+
+        # Node 0 can mine blocks, because it is targeting a transparent address
+        print("Mining block with node 0")
+        self.nodes[0].generate(1)
+        self.sync_all()
+        walletinfo = self.nodes[0].getwalletinfo()
+        assert_equal(walletinfo['immature_balance'], 5)
+        assert_equal(walletinfo['balance'], 0)
+
+        # Node 1 cannot mine blocks, because it is targeting a Sapling address
+        # but Heartwood is not yet active
+        print("Attempting to mine block with node 1")
+        assert_raises(JSONRPCException, self.nodes[1].generate, 1)
+        assert_equal(self.nodes[1].z_getbalance(node1_zaddr, 0), 0)
+        assert_equal(self.nodes[1].z_getbalance(node1_zaddr), 0)
+
+        # Stop node 1 and check logs to verify the block was rejected correctly
+        string_to_find = "CheckTransaction(): coinbase has output descriptions"
+        check_node_log(self, 1, string_to_find)
+
+        # Restart node 1
+        self.nodes[1] = self.start_node_with(1, ["-mineraddress=%s" % node1_zaddr])
+        connect_nodes(self.nodes[1], 0)
+
+        # Activate Heartwood
+        print("Activating Heartwood")
+        self.nodes[0].generate(8)
+        self.sync_all()
+
+        # Node 1 can now mine blocks!
+        print("Mining block with node 1")
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        # Transparent coinbase outputs are subject to coinbase maturity
+        assert_equal(self.nodes[0].getbalance(), Decimal('0'))
+        assert_equal(self.nodes[0].z_gettotalbalance()['transparent'], '0.00')
+        assert_equal(self.nodes[0].z_gettotalbalance()['private'], '0.00')
+        assert_equal(self.nodes[0].z_gettotalbalance()['total'], '0.00')
+
+        # Shielded coinbase outputs are not subject to coinbase maturity
+        assert_equal(self.nodes[1].z_getbalance(node1_zaddr, 0), 5)
+        assert_equal(self.nodes[1].z_getbalance(node1_zaddr), 5)
+        assert_equal(self.nodes[1].z_gettotalbalance()['private'], '5.00')
+        assert_equal(self.nodes[1].z_gettotalbalance()['total'], '5.00')
+
+        # Send from Sapling coinbase to Sapling address and transparent address
+        # (to check that a non-empty vout is allowed when spending shielded
+        # coinbase)
+        print("Sending Sapling coinbase to Sapling address")
+        node0_zaddr = self.nodes[0].z_getnewaddress('sapling')
+        node0_taddr = self.nodes[0].getnewaddress()
+        recipients = []
+        recipients.append({"address": node0_zaddr, "amount": Decimal('2')})
+        recipients.append({"address": node0_taddr, "amount": Decimal('2')})
+        myopid = self.nodes[1].z_sendmany(node1_zaddr, recipients, 1, 0)
+        wait_and_assert_operationid_status(self.nodes[1], myopid)
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        assert_equal(self.nodes[0].z_getbalance(node0_zaddr), 2)
+        assert_equal(self.nodes[0].z_getbalance(node0_taddr), 2)
+        assert_equal(self.nodes[1].z_getbalance(node1_zaddr), 1)
+
+        # Generate a Unified Address for node 1
+        self.nodes[1].z_getnewaccount()
+        node1_addr0 = self.nodes[1].z_getaddressforaccount(0)
+        assert_equal(node1_addr0['account'], 0)
+        assert_equal(set(node1_addr0['receiver_types']), set(['p2pkh', 'sapling', 'orchard']))
+        node1_ua = node1_addr0['address']
+
+        # Set node 1's miner address to the UA
+        self.nodes[1].stop()
+        bitcoind_processes[1].wait()
+        self.nodes[1] = self.start_node_with(1, [
+            "-mineraddress=%s" % node1_ua,
+        ])
+        connect_nodes(self.nodes[1], 0)
+
+        # The UA starts with zero balance.
+        assert_equal(self.nodes[1].z_getbalanceforaccount(0)['pools'], {})
+
+        # Node 1 can mine blocks because the miner selects the Sapling receiver
+        # of its UA.
+        print("Mining block with node 1")
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        # The UA balance should show that Sapling funds were received.
+        assert_equal(self.nodes[1].z_getbalanceforaccount(0)['pools'], {
+            'sapling': {'valueZat': 5 * COIN },
+        })
+
+        # Activate NU5
+        print("Activating NU5")
+        self.nodes[0].generate(7)
+        self.sync_all()
+
+        # Now any block mined by node 1 should use the Orchard receiver of its UA.
+        print("Mining block with node 1")
+        self.nodes[1].generate(1)
+        self.sync_all()
+        assert_equal(self.nodes[1].z_getbalanceforaccount(0)['pools'], {
+            'sapling': {'valueZat': 5 * COIN },
+            # 6.25 ZEC because the FR always ends when Canopy activates, and
+            # regtest has no defined funding streams.
+            'orchard': {'valueZat': 6.25 * COIN },
+        })
+
+if __name__ == '__main__':
+    ShieldCoinbaseTest().main()
diff --git a/depend/zcash/qa/rpc-tests/multi_rpc.py b/depend/zcash/qa/rpc-tests/multi_rpc.py
new file mode 100755
index 000000000..7263c0b2b
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/multi_rpc.py
@@ -0,0 +1,120 @@
+#!/usr/bin/env python3
+# Copyright (c) 2015-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Test multiple rpc user config option rpcauth
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import str_to_b64str, assert_equal
+
+import os
+import http.client
+import urllib.parse
+
+class HTTPBasicsTest (BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.setup_clean_chain = False
+        self.num_nodes = 1
+
+    def setup_chain(self):
+        super().setup_chain()
+        #Append rpcauth to zcash.conf before initialization
+        rpcauth = "rpcauth=rt:93648e835a54c573682c2eb19f882535$7681e9c5b74bdd85e78166031d2058e1069b3ed7ed967c93fc63abba06f31144"
+        rpcauth2 = "rpcauth=rt2:f8607b1a88861fac29dfccf9b52ff9f$ff36a0c23c8c62b4846112e50fa888416e94c17bfd4c42f88fd8f55ec6a3137e"
+        with open(os.path.join(self.options.tmpdir+"/node0", "zcash.conf"), 'a', encoding='utf8') as f:
+            f.write(rpcauth+"\n")
+            f.write(rpcauth2+"\n")
+
+    def setup_network(self):
+        self.nodes = self.setup_nodes()
+
+    def run_test(self):
+
+        ##################################################
+        # Check correctness of the rpcauth config option #
+        ##################################################
+        url = urllib.parse.urlparse(self.nodes[0].url)
+
+        #Old authpair
+        authpair = url.username + ':' + url.password
+
+        #New authpair generated via share/rpcuser tool
+        #rpcauth = "rpcauth=rt:93648e835a54c573682c2eb19f882535$7681e9c5b74bdd85e78166031d2058e1069b3ed7ed967c93fc63abba06f31144"
+        password = "cA773lm788buwYe4g4WT+05pKyNruVKjQ25x3n0DQcM="
+
+        #Second authpair with different username
+        #rpcauth2 = "rpcauth=rt2:f8607b1a88861fac29dfccf9b52ff9f$ff36a0c23c8c62b4846112e50fa888416e94c17bfd4c42f88fd8f55ec6a3137e"
+        password2 = "8/F3uMDw4KSEbw96U3CA1C4X05dkHDN2BPFjTgZW4KI="
+        authpairnew = "rt:"+password
+
+        headers = {"Authorization": "Basic " + str_to_b64str(authpair)}
+
+        conn = http.client.HTTPConnection(url.hostname, url.port)
+        conn.connect()
+        conn.request('POST', '/', '{"method": "getbestblockhash"}', headers)
+        resp = conn.getresponse()
+        assert_equal(resp.status==401, False)
+        conn.close()
+        
+        #Use new authpair to confirm both work
+        headers = {"Authorization": "Basic " + str_to_b64str(authpairnew)}
+
+        conn = http.client.HTTPConnection(url.hostname, url.port)
+        conn.connect()
+        conn.request('POST', '/', '{"method": "getbestblockhash"}', headers)
+        resp = conn.getresponse()
+        assert_equal(resp.status==401, False)
+        conn.close()
+
+        #Wrong login name with rt's password
+        authpairnew = "rtwrong:"+password
+        headers = {"Authorization": "Basic " + str_to_b64str(authpairnew)}
+
+        conn = http.client.HTTPConnection(url.hostname, url.port)
+        conn.connect()
+        conn.request('POST', '/', '{"method": "getbestblockhash"}', headers)
+        resp = conn.getresponse()
+        assert_equal(resp.status==401, True)
+        conn.close()
+
+        #Wrong password for rt
+        authpairnew = "rt:"+password+"wrong"
+        headers = {"Authorization": "Basic " + str_to_b64str(authpairnew)}
+
+        conn = http.client.HTTPConnection(url.hostname, url.port)
+        conn.connect()
+        conn.request('POST', '/', '{"method": "getbestblockhash"}', headers)
+        resp = conn.getresponse()
+        assert_equal(resp.status==401, True)
+        conn.close()
+
+        #Correct for rt2
+        authpairnew = "rt2:"+password2
+        headers = {"Authorization": "Basic " + str_to_b64str(authpairnew)}
+
+        conn = http.client.HTTPConnection(url.hostname, url.port)
+        conn.connect()
+        conn.request('POST', '/', '{"method": "getbestblockhash"}', headers)
+        resp = conn.getresponse()
+        assert_equal(resp.status==401, False)
+        conn.close()
+
+        #Wrong password for rt2
+        authpairnew = "rt2:"+password2+"wrong"
+        headers = {"Authorization": "Basic " + str_to_b64str(authpairnew)}
+
+        conn = http.client.HTTPConnection(url.hostname, url.port)
+        conn.connect()
+        conn.request('POST', '/', '{"method": "getbestblockhash"}', headers)
+        resp = conn.getresponse()
+        assert_equal(resp.status==401, True)
+        conn.close()
+
+
+if __name__ == '__main__':
+    HTTPBasicsTest ().main ()
diff --git a/depend/zcash/qa/rpc-tests/nodehandling.py b/depend/zcash/qa/rpc-tests/nodehandling.py
new file mode 100755
index 000000000..59cdbd60c
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/nodehandling.py
@@ -0,0 +1,87 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Test node handling
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, connect_nodes_bi, p2p_port, \
+    start_node, stop_node
+
+import time
+import urllib.parse
+
+class NodeHandlingTest (BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 4
+        self.setup_clean_chain = False
+
+    def run_test(self):
+        ###########################
+        # setban/listbanned tests #
+        ###########################
+        assert_equal(len(self.nodes[2].getpeerinfo()), 4) #we should have 4 nodes at this point
+        self.nodes[2].setban("127.0.0.1", "add")
+        time.sleep(3) #wait till the nodes are disconnected
+        assert_equal(len(self.nodes[2].getpeerinfo()), 0) #all nodes must be disconnected at this point
+        assert_equal(len(self.nodes[2].listbanned()), 1)
+        self.nodes[2].clearbanned()
+        assert_equal(len(self.nodes[2].listbanned()), 0)
+        self.nodes[2].setban("127.0.0.0/24", "add")
+        assert_equal(len(self.nodes[2].listbanned()), 1)
+        try:
+            self.nodes[2].setban("127.0.0.1", "add") #throws exception because 127.0.0.1 is within range 127.0.0.0/24
+        except:
+            pass
+        assert_equal(len(self.nodes[2].listbanned()), 1) #still only one banned ip because 127.0.0.1 is within the range of 127.0.0.0/24
+        try:
+            self.nodes[2].setban("127.0.0.1", "remove")
+        except:
+            pass
+        assert_equal(len(self.nodes[2].listbanned()), 1)
+        self.nodes[2].setban("127.0.0.0/24", "remove")
+        assert_equal(len(self.nodes[2].listbanned()), 0)
+        self.nodes[2].clearbanned()
+        assert_equal(len(self.nodes[2].listbanned()), 0)
+
+        ##test persisted banlist
+        self.nodes[2].setban("127.0.0.0/32", "add")
+        self.nodes[2].setban("127.0.0.0/24", "add")
+        self.nodes[2].setban("192.168.0.1", "add", 1) #ban for 1 seconds
+        self.nodes[2].setban("2001:4d48:ac57:400:cacf:e9ff:fe1d:9c63/19", "add", 1000) #ban for 1000 seconds
+        listBeforeShutdown = self.nodes[2].listbanned();
+        assert_equal("192.168.0.1/32", listBeforeShutdown[2]['address']) #must be here
+        time.sleep(2) #make 100% sure we expired 192.168.0.1 node time
+
+        #stop node
+        stop_node(self.nodes[2], 2)
+
+        self.nodes[2] = start_node(2, self.options.tmpdir)
+        listAfterShutdown = self.nodes[2].listbanned();
+        assert_equal("127.0.0.0/24", listAfterShutdown[0]['address'])
+        assert_equal("127.0.0.0/32", listAfterShutdown[1]['address'])
+        assert_equal("/19" in listAfterShutdown[2]['address'], True)
+
+        ###########################
+        # RPC disconnectnode test #
+        ###########################
+        url = urllib.parse.urlparse(self.nodes[1].url)
+        self.nodes[0].disconnectnode(url.hostname+":"+str(p2p_port(1)))
+        time.sleep(2) #disconnecting a node needs a little bit of time
+        for node in self.nodes[0].getpeerinfo():
+            assert(node['addr'] != url.hostname+":"+str(p2p_port(1)))
+
+        connect_nodes_bi(self.nodes,0,1) #reconnect the node
+        found = False
+        for node in self.nodes[0].getpeerinfo():
+            if node['addr'] == url.hostname+":"+str(p2p_port(1)):
+                found = True
+        assert(found)
+
+if __name__ == '__main__':
+    NodeHandlingTest ().main ()
diff --git a/depend/zcash/qa/rpc-tests/nuparams.py b/depend/zcash/qa/rpc-tests/nuparams.py
new file mode 100755
index 000000000..b90fee231
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/nuparams.py
@@ -0,0 +1,222 @@
+#!/usr/bin/env python3
+# Copyright (c) 2021 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    assert_equal,
+    start_nodes,
+    nuparams,
+    nustr,
+    OVERWINTER_BRANCH_ID,
+    SAPLING_BRANCH_ID,
+    BLOSSOM_BRANCH_ID,
+    HEARTWOOD_BRANCH_ID,
+    CANOPY_BRANCH_ID,
+    NU5_BRANCH_ID,
+)
+
+
+class NuparamsTest(BitcoinTestFramework):
+    '''
+    Test that unspecified network upgrades are activated automatically;
+    this is really more of a test of the test framework.
+    '''
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 1
+        self.setup_clean_chain = True
+
+    def setup_network(self, split=False):
+        args = [[
+            nuparams(HEARTWOOD_BRANCH_ID, 3),
+            nuparams(NU5_BRANCH_ID, 5),
+        ] * self.num_nodes]
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir, args)
+        self.is_network_split = False
+        self.sync_all()
+
+    def run_test(self):
+        node = self.nodes[0]
+        # No blocks have been created, only the genesis block exists (height 0)
+        bci = node.getblockchaininfo()
+        assert_equal(bci['blocks'], 0)
+        upgrades = bci['upgrades']
+
+        overwinter = upgrades[nustr(OVERWINTER_BRANCH_ID)]
+        assert_equal(overwinter['name'], 'Overwinter')
+        assert_equal(overwinter['activationheight'], 1)
+        assert_equal(overwinter['status'], 'pending')
+
+        sapling = upgrades[nustr(SAPLING_BRANCH_ID)]
+        assert_equal(sapling['name'], 'Sapling')
+        assert_equal(sapling['activationheight'], 1)
+        assert_equal(sapling['status'], 'pending')
+
+        blossom = upgrades[nustr(BLOSSOM_BRANCH_ID)]
+        assert_equal(blossom['name'], 'Blossom')
+        assert_equal(blossom['activationheight'], 3)
+        assert_equal(blossom['status'], 'pending')
+
+        heartwood = upgrades[nustr(HEARTWOOD_BRANCH_ID)]
+        assert_equal(heartwood['name'], 'Heartwood')
+        assert_equal(heartwood['activationheight'], 3)
+        assert_equal(heartwood['status'], 'pending')
+
+        canopy = upgrades[nustr(CANOPY_BRANCH_ID)]
+        assert_equal(canopy['name'], 'Canopy')
+        assert_equal(canopy['activationheight'], 5)
+        assert_equal(canopy['status'], 'pending')
+
+        nu5 = upgrades[nustr(NU5_BRANCH_ID)]
+        assert_equal(nu5['name'], 'NU5')
+        assert_equal(nu5['activationheight'], 5)
+        assert_equal(nu5['status'], 'pending')
+
+        node.generate(1)
+
+        # start_node() hardcodes Sapling and Overwinter to activate a height 1
+        bci = node.getblockchaininfo()
+        assert_equal(bci['blocks'], 1)
+        upgrades = bci['upgrades']
+
+        overwinter = upgrades[nustr(OVERWINTER_BRANCH_ID)]
+        assert_equal(overwinter['name'], 'Overwinter')
+        assert_equal(overwinter['activationheight'], 1)
+        assert_equal(overwinter['status'], 'active')
+
+        sapling = upgrades[nustr(SAPLING_BRANCH_ID)]
+        assert_equal(sapling['name'], 'Sapling')
+        assert_equal(sapling['activationheight'], 1)
+        assert_equal(sapling['status'], 'active')
+
+        blossom = upgrades[nustr(BLOSSOM_BRANCH_ID)]
+        assert_equal(blossom['name'], 'Blossom')
+        assert_equal(blossom['activationheight'], 3)
+        assert_equal(blossom['status'], 'pending')
+
+        heartwood = upgrades[nustr(HEARTWOOD_BRANCH_ID)]
+        assert_equal(heartwood['name'], 'Heartwood')
+        assert_equal(heartwood['activationheight'], 3)
+        assert_equal(heartwood['status'], 'pending')
+
+        canopy = upgrades[nustr(CANOPY_BRANCH_ID)]
+        assert_equal(canopy['name'], 'Canopy')
+        assert_equal(canopy['activationheight'], 5)
+        assert_equal(canopy['status'], 'pending')
+
+        nu5 = upgrades[nustr(NU5_BRANCH_ID)]
+        assert_equal(nu5['name'], 'NU5')
+        assert_equal(nu5['activationheight'], 5)
+        assert_equal(nu5['status'], 'pending')
+
+        node.generate(1)
+        bci = node.getblockchaininfo()
+        assert_equal(bci['blocks'], 2)
+        upgrades = bci['upgrades']
+
+        overwinter = upgrades[nustr(OVERWINTER_BRANCH_ID)]
+        assert_equal(overwinter['name'], 'Overwinter')
+        assert_equal(overwinter['activationheight'], 1)
+        assert_equal(overwinter['status'], 'active')
+
+        sapling = upgrades[nustr(SAPLING_BRANCH_ID)]
+        assert_equal(sapling['name'], 'Sapling')
+        assert_equal(sapling['activationheight'], 1)
+        assert_equal(sapling['status'], 'active')
+
+        blossom = upgrades[nustr(BLOSSOM_BRANCH_ID)]
+        assert_equal(blossom['name'], 'Blossom')
+        assert_equal(blossom['activationheight'], 3)
+        assert_equal(blossom['status'], 'pending')
+
+        heartwood = upgrades[nustr(HEARTWOOD_BRANCH_ID)]
+        assert_equal(heartwood['name'], 'Heartwood')
+        assert_equal(heartwood['activationheight'], 3)
+        assert_equal(heartwood['status'], 'pending')
+
+        canopy = upgrades[nustr(CANOPY_BRANCH_ID)]
+        assert_equal(canopy['name'], 'Canopy')
+        assert_equal(canopy['activationheight'], 5)
+        assert_equal(canopy['status'], 'pending')
+
+        nu5 = upgrades[nustr(NU5_BRANCH_ID)]
+        assert_equal(nu5['name'], 'NU5')
+        assert_equal(nu5['activationheight'], 5)
+        assert_equal(nu5['status'], 'pending')
+
+        node.generate(2)
+        bci = node.getblockchaininfo()
+        assert_equal(bci['blocks'], 4)
+        upgrades = bci['upgrades']
+
+        overwinter = upgrades[nustr(OVERWINTER_BRANCH_ID)]
+        assert_equal(overwinter['name'], 'Overwinter')
+        assert_equal(overwinter['activationheight'], 1)
+        assert_equal(overwinter['status'], 'active')
+
+        sapling = upgrades[nustr(SAPLING_BRANCH_ID)]
+        assert_equal(sapling['name'], 'Sapling')
+        assert_equal(sapling['activationheight'], 1)
+        assert_equal(sapling['status'], 'active')
+
+        blossom = upgrades[nustr(BLOSSOM_BRANCH_ID)]
+        assert_equal(blossom['name'], 'Blossom')
+        assert_equal(blossom['activationheight'], 3)
+        assert_equal(blossom['status'], 'active')
+
+        heartwood = upgrades[nustr(HEARTWOOD_BRANCH_ID)]
+        assert_equal(heartwood['name'], 'Heartwood')
+        assert_equal(heartwood['activationheight'], 3)
+        assert_equal(heartwood['status'], 'active')
+
+        canopy = upgrades[nustr(CANOPY_BRANCH_ID)]
+        assert_equal(canopy['name'], 'Canopy')
+        assert_equal(canopy['activationheight'], 5)
+        assert_equal(canopy['status'], 'pending')
+
+        nu5 = upgrades[nustr(NU5_BRANCH_ID)]
+        assert_equal(nu5['name'], 'NU5')
+        assert_equal(nu5['activationheight'], 5)
+        assert_equal(nu5['status'], 'pending')
+
+        node.generate(1)
+        bci = node.getblockchaininfo()
+        assert_equal(bci['blocks'], 5)
+        upgrades = bci['upgrades']
+
+        overwinter = upgrades[nustr(OVERWINTER_BRANCH_ID)]
+        assert_equal(overwinter['name'], 'Overwinter')
+        assert_equal(overwinter['activationheight'], 1)
+        assert_equal(overwinter['status'], 'active')
+
+        sapling = upgrades[nustr(SAPLING_BRANCH_ID)]
+        assert_equal(sapling['name'], 'Sapling')
+        assert_equal(sapling['activationheight'], 1)
+        assert_equal(sapling['status'], 'active')
+
+        blossom = upgrades[nustr(BLOSSOM_BRANCH_ID)]
+        assert_equal(blossom['name'], 'Blossom')
+        assert_equal(blossom['activationheight'], 3)
+        assert_equal(blossom['status'], 'active')
+
+        heartwood = upgrades[nustr(HEARTWOOD_BRANCH_ID)]
+        assert_equal(heartwood['name'], 'Heartwood')
+        assert_equal(heartwood['activationheight'], 3)
+        assert_equal(heartwood['status'], 'active')
+
+        canopy = upgrades[nustr(CANOPY_BRANCH_ID)]
+        assert_equal(canopy['name'], 'Canopy')
+        assert_equal(canopy['activationheight'], 5)
+        assert_equal(canopy['status'], 'active')
+
+        nu5 = upgrades[nustr(NU5_BRANCH_ID)]
+        assert_equal(nu5['name'], 'NU5')
+        assert_equal(nu5['activationheight'], 5)
+        assert_equal(nu5['status'], 'active')
+
+
+if __name__ == '__main__':
+    NuparamsTest().main()
diff --git a/depend/zcash/qa/rpc-tests/orchard_reorg.py b/depend/zcash/qa/rpc-tests/orchard_reorg.py
new file mode 100755
index 000000000..57f48ea14
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/orchard_reorg.py
@@ -0,0 +1,127 @@
+#!/usr/bin/env python3
+# Copyright (c) 2022 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Test the effect of reorgs on the Orchard commitment tree.
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    BLOSSOM_BRANCH_ID,
+    HEARTWOOD_BRANCH_ID,
+    CANOPY_BRANCH_ID,
+    NU5_BRANCH_ID,
+    assert_equal,
+    get_coinbase_address,
+    nuparams,
+    start_nodes,
+    wait_and_assert_operationid_status,
+)
+
+from finalsaplingroot import ORCHARD_TREE_EMPTY_ROOT
+
+from decimal import Decimal
+
+class OrchardReorgTest(BitcoinTestFramework):
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 4
+        self.setup_clean_chain = True
+
+    def setup_nodes(self):
+        return start_nodes(self.num_nodes, self.options.tmpdir, extra_args=[[
+            nuparams(BLOSSOM_BRANCH_ID, 1),
+            nuparams(HEARTWOOD_BRANCH_ID, 5),
+            nuparams(CANOPY_BRANCH_ID, 5),
+            nuparams(NU5_BRANCH_ID, 10),
+            '-nurejectoldversions=false',
+        ]] * self.num_nodes)
+
+    def run_test(self):
+        # Activate NU5 so we can test Orchard.
+        self.nodes[0].generate(10)
+        self.sync_all()
+
+        # Generate a UA with only an Orchard receiver.
+        account = self.nodes[0].z_getnewaccount()['account']
+        addr = self.nodes[0].z_getaddressforaccount(account, ['orchard'])
+        assert_equal(addr['account'], account)
+        assert_equal(set(addr['receiver_types']), set(['orchard']))
+        ua = addr['address']
+
+        # Before mining any Orchard notes, finalorchardroot should be the empty Orchard root.
+        assert_equal(
+            ORCHARD_TREE_EMPTY_ROOT,
+            self.nodes[0].getblock(self.nodes[0].getbestblockhash())['finalorchardroot'],
+        )
+
+        # finalorchardroot should not change if we mine additional blocks without Orchard notes.
+        self.nodes[0].generate(100)
+        self.sync_all()
+        assert_equal(
+            ORCHARD_TREE_EMPTY_ROOT,
+            self.nodes[0].getblock(self.nodes[0].getbestblockhash())['finalorchardroot'],
+        )
+
+        # Create an Orchard note.
+        recipients = [{'address': ua, 'amount': Decimal('12.5')}]
+        opid = self.nodes[0].z_sendmany(get_coinbase_address(self.nodes[0]), recipients, 1, 0, 'AllowRevealedSenders')
+        wait_and_assert_operationid_status(self.nodes[0], opid)
+
+        # After mining a block, finalorchardroot should have changed.
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+        orchardroot_oneleaf = self.nodes[0].getblock(self.nodes[0].getbestblockhash())['finalorchardroot']
+        print("Root of Orchard commitment tree with one leaf:", orchardroot_oneleaf)
+        assert(orchardroot_oneleaf != ORCHARD_TREE_EMPTY_ROOT)
+
+        # finalorchardroot should not change if we mine additional blocks without Orchard notes.
+        self.nodes[0].generate(4)
+        self.sync_all()
+        assert_equal(
+            orchardroot_oneleaf,
+            self.nodes[0].getblock(self.nodes[0].getbestblockhash())['finalorchardroot'],
+        )
+
+        # Split the network so we can test the effect of a reorg.
+        print("Splitting the network")
+        self.split_network()
+
+        # Create another Orchard note on node 0.
+        recipients = [{'address': ua, 'amount': Decimal('12.5')}]
+        opid = self.nodes[0].z_sendmany(get_coinbase_address(self.nodes[0]), recipients, 1, 0, 'AllowRevealedSenders')
+        wait_and_assert_operationid_status(self.nodes[0], opid)
+
+        # Mine two blocks on node 0.
+        print("Mining 2 blocks on node 0")
+        self.nodes[0].generate(2)
+        self.sync_all()
+        orchardroot_twoleaf = self.nodes[0].getblock(self.nodes[0].getbestblockhash())['finalorchardroot']
+        print("Root of Orchard commitment tree with two leaves:", orchardroot_twoleaf)
+        assert(orchardroot_twoleaf != ORCHARD_TREE_EMPTY_ROOT)
+        assert(orchardroot_twoleaf != orchardroot_oneleaf)
+
+        # Generate 10 blocks on node 2.
+        print("Mining alternate chain on node 2")
+        self.nodes[2].generate(10)
+        self.sync_all()
+        assert_equal(
+            orchardroot_oneleaf,
+            self.nodes[2].getblock(self.nodes[2].getbestblockhash())['finalorchardroot'],
+        )
+
+        # Reconnect the nodes; node 0 will re-org to node 2's chain.
+        print("Re-joining the network so that node 0 reorgs")
+        self.join_network()
+
+        # Verify that node 0's latest Orchard root matches what we expect.
+        orchardroot_postreorg = self.nodes[0].getblock(self.nodes[2].getbestblockhash())['finalorchardroot']
+        print("Root of Orchard commitment tree after reorg:", orchardroot_postreorg)
+        assert_equal(orchardroot_postreorg, orchardroot_oneleaf)
+
+
+if __name__ == '__main__':
+    OrchardReorgTest().main()
diff --git a/depend/zcash/qa/rpc-tests/p2p-acceptblock.py b/depend/zcash/qa/rpc-tests/p2p-acceptblock.py
new file mode 100755
index 000000000..83ef7ba97
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/p2p-acceptblock.py
@@ -0,0 +1,297 @@
+#!/usr/bin/env python3
+# Copyright (c) 2015-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.mininode import CBlockHeader, CInv, NodeConn, NodeConnCB, \
+    NetworkThread, msg_block, msg_headers, msg_inv, msg_ping, msg_pong, \
+    mininode_lock
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, \
+    start_node, p2p_port, ZCASHD_BINARY
+from test_framework.blocktools import create_block, create_coinbase
+
+import os
+import time
+
+'''
+AcceptBlockTest -- test processing of unrequested blocks.
+
+Since behavior differs when receiving unrequested blocks from whitelisted peers
+versus non-whitelisted peers, this tests the behavior of both (effectively two
+separate tests running in parallel).
+
+Setup: two nodes, node0 and node1, not connected to each other.  Node0 does not
+whitelist localhost, but node1 does. They will each be on their own chain for
+this test.
+
+We have one NodeConn connection to each, test_node and white_node respectively.
+
+The test:
+1. Generate one block on each node, to leave IBD.
+
+2. Mine a new block on each tip, and deliver to each node from node's peer.
+   The tip should advance.
+
+3. Mine a block that forks the previous block, and deliver to each node from
+   corresponding peer.
+   Node0 should not process this block (just accept the header), because it is
+   unrequested and doesn't have more work than the tip.
+   Node1 should process because this is coming from a whitelisted peer.
+
+4. Send another block that builds on the forking block.
+   Node0 should process this block but be stuck on the shorter chain, because
+   it's missing an intermediate block.
+   Node1 should reorg to this longer chain.
+
+4b.Send 288 more blocks on the longer chain.
+   Node0 should process all but the last block (too far ahead in height).
+   Send all headers to Node1, and then send the last block in that chain.
+   Node1 should accept the block because it's coming from a whitelisted peer.
+
+5. Send a duplicate of the block in #3 to Node0.
+   Node0 should not process the block because it is unrequested, and stay on
+   the shorter chain.
+
+6. Send Node0 an inv for the height 3 block produced in #4 above.
+   Node0 should figure out that Node0 has the missing height 2 block and send a
+   getdata.
+
+7. Send Node0 the missing block again.
+   Node0 should process and the tip should advance.
+'''
+
+# TestNode: bare-bones "peer".  Used mostly as a conduit for a test to sending
+# p2p messages to a node, generating the messages in the main testing logic.
+class TestNode(NodeConnCB):
+    def __init__(self):
+        NodeConnCB.__init__(self)
+        self.create_callback_map()
+        self.connection = None
+        self.ping_counter = 1
+        self.last_pong = msg_pong()
+
+    def add_connection(self, conn):
+        self.connection = conn
+
+    # Track the last getdata message we receive (used in the test)
+    def on_getdata(self, conn, message):
+        self.last_getdata = message
+
+    # Spin until verack message is received from the node.
+    # We use this to signal that our test can begin. This
+    # is called from the testing thread, so it needs to acquire
+    # the global lock.
+    def wait_for_verack(self):
+        while True:
+            with mininode_lock:
+                if self.verack_received:
+                    return
+            time.sleep(0.05)
+
+    # Wrapper for the NodeConn's send_message function
+    def send_message(self, message):
+        self.connection.send_message(message)
+
+    def on_pong(self, conn, message):
+        self.last_pong = message
+
+    # Sync up with the node after delivery of a block
+    def sync_with_ping(self, timeout=30):
+        self.connection.send_message(msg_ping(nonce=self.ping_counter))
+        received_pong = False
+        sleep_time = 0.05
+        while not received_pong and timeout > 0:
+            time.sleep(sleep_time)
+            timeout -= sleep_time
+            with mininode_lock:
+                if self.last_pong.nonce == self.ping_counter:
+                    received_pong = True
+        self.ping_counter += 1
+        return received_pong
+
+
+class AcceptBlockTest(BitcoinTestFramework):
+    def add_options(self, parser):
+        parser.add_option("--testbinary", dest="testbinary",
+                          default=os.getenv("ZCASHD", ZCASHD_BINARY),
+                          help="zcashd binary to test")
+
+    def __init__(self):
+        super().__init__()
+        self.setup_clean_chain = True
+        self.num_nodes = 2
+
+    def setup_network(self):
+        # Node0 will be used to test behavior of processing unrequested blocks
+        # from peers which are not whitelisted, while Node1 will be used for
+        # the whitelisted case.
+        self.nodes = []
+        self.nodes.append(start_node(0, self.options.tmpdir, ["-debug"],
+                                     binary=self.options.testbinary))
+        self.nodes.append(start_node(1, self.options.tmpdir,
+                                     ["-debug", "-whitelist=127.0.0.1"],
+                                     binary=self.options.testbinary))
+
+    def run_test(self):
+        # Setup the p2p connections and start up the network thread.
+        test_node = TestNode()   # connects to node0 (not whitelisted)
+        white_node = TestNode()  # connects to node1 (whitelisted)
+
+        connections = []
+        connections.append(NodeConn('127.0.0.1', p2p_port(0), self.nodes[0], test_node))
+        connections.append(NodeConn('127.0.0.1', p2p_port(1), self.nodes[1], white_node))
+        test_node.add_connection(connections[0])
+        white_node.add_connection(connections[1])
+
+        NetworkThread().start() # Start up network handling in another thread
+
+        # Test logic begins here
+        test_node.wait_for_verack()
+        white_node.wait_for_verack()
+
+        # 1. Have both nodes mine a block (leave IBD)
+        [ n.generate(1) for n in self.nodes ]
+        tips = [ int("0x" + n.getbestblockhash(), 0) for n in self.nodes ]
+
+        # 2. Send one block that builds on each tip.
+        # This should be accepted.
+        blocks_h2 = []  # the height 2 blocks on each node's chain
+        block_time = int(time.time()) + 1
+        for i in range(2):
+            blocks_h2.append(create_block(tips[i], create_coinbase(2), block_time))
+            blocks_h2[i].solve()
+            block_time += 1
+        test_node.send_message(msg_block(blocks_h2[0]))
+        white_node.send_message(msg_block(blocks_h2[1]))
+
+        [ x.sync_with_ping() for x in [test_node, white_node] ]
+        assert_equal(self.nodes[0].getblockcount(), 2)
+        assert_equal(self.nodes[1].getblockcount(), 2)
+        print("First height 2 block accepted by both nodes")
+
+        # 3. Send another block that builds on the original tip.
+        blocks_h2f = []  # Blocks at height 2 that fork off the main chain
+        for i in range(2):
+            blocks_h2f.append(create_block(tips[i], create_coinbase(2), blocks_h2[i].nTime+1))
+            blocks_h2f[i].solve()
+        test_node.send_message(msg_block(blocks_h2f[0]))
+        white_node.send_message(msg_block(blocks_h2f[1]))
+
+        [ x.sync_with_ping() for x in [test_node, white_node] ]
+        for x in self.nodes[0].getchaintips():
+            if x['hash'] == blocks_h2f[0].hash:
+                assert_equal(x['status'], "headers-only")
+
+        for x in self.nodes[1].getchaintips():
+            if x['hash'] == blocks_h2f[1].hash:
+                assert_equal(x['status'], "valid-headers")
+
+        print("Second height 2 block accepted only from whitelisted peer")
+
+        # 4. Now send another block that builds on the forking chain.
+        blocks_h3 = []
+        for i in range(2):
+            blocks_h3.append(create_block(blocks_h2f[i].sha256, create_coinbase(3), blocks_h2f[i].nTime+1))
+            blocks_h3[i].solve()
+        test_node.send_message(msg_block(blocks_h3[0]))
+        white_node.send_message(msg_block(blocks_h3[1]))
+
+        [ x.sync_with_ping() for x in [test_node, white_node] ]
+        # Since the earlier block was not processed by node0, the new block
+        # can't be fully validated.
+        for x in self.nodes[0].getchaintips():
+            if x['hash'] == blocks_h3[0].hash:
+                assert_equal(x['status'], "headers-only")
+
+        # But this block should be accepted by node0 since it has more work.
+        try:
+            self.nodes[0].getblock(blocks_h3[0].hash)
+            print("Unrequested more-work block accepted from non-whitelisted peer")
+        except:
+            raise AssertionError("Unrequested more work block was not processed")
+
+        # Node1 should have accepted and reorged.
+        assert_equal(self.nodes[1].getblockcount(), 3)
+        print("Successfully reorged to length 3 chain from whitelisted peer")
+
+        # 4b. Now mine 288 more blocks and deliver; all should be processed but
+        # the last (height-too-high) on node0.  Node1 should process the tip if
+        # we give it the headers chain leading to the tip.
+        tips = blocks_h3
+        headers_message = msg_headers()
+        all_blocks = []   # node0's blocks
+        for j in range(2):
+            for i in range(288):
+                next_block = create_block(tips[j].sha256, create_coinbase(i + 4), tips[j].nTime+1)
+                next_block.solve()
+                if j==0:
+                    test_node.send_message(msg_block(next_block))
+                    all_blocks.append(next_block)
+                else:
+                    headers_message.headers.append(CBlockHeader(next_block))
+                tips[j] = next_block
+
+        time.sleep(2)
+        for x in all_blocks:
+            try:
+                self.nodes[0].getblock(x.hash)
+                if x == all_blocks[287]:
+                    raise AssertionError("Unrequested block too far-ahead should have been ignored")
+            except:
+                if x == all_blocks[287]:
+                    print("Unrequested block too far-ahead not processed")
+                else:
+                    raise AssertionError("Unrequested block with more work should have been accepted")
+
+        headers_message.headers.pop() # Ensure the last block is unrequested
+        white_node.send_message(headers_message) # Send headers leading to tip
+        white_node.send_message(msg_block(tips[1]))  # Now deliver the tip
+        try:
+            white_node.sync_with_ping()
+            self.nodes[1].getblock(tips[1].hash)
+            print("Unrequested block far ahead of tip accepted from whitelisted peer")
+        except:
+            raise AssertionError("Unrequested block from whitelisted peer not accepted")
+
+        # 5. Test handling of unrequested block on the node that didn't process
+        # Should still not be processed (even though it has a child that has more
+        # work).
+        test_node.send_message(msg_block(blocks_h2f[0]))
+
+        # Here, if the sleep is too short, the test could falsely succeed (if the
+        # node hasn't processed the block by the time the sleep returns, and then
+        # the node processes it and incorrectly advances the tip).
+        # But this would be caught later on, when we verify that an inv triggers
+        # a getdata request for this block.
+        test_node.sync_with_ping()
+        assert_equal(self.nodes[0].getblockcount(), 2)
+        print("Unrequested block that would complete more-work chain was ignored")
+
+        # 6. Try to get node to request the missing block.
+        # Poke the node with an inv for block at height 3 and see if that
+        # triggers a getdata on block 2 (it should if block 2 is missing).
+        with mininode_lock:
+            # Clear state so we can check the getdata request
+            test_node.last_getdata = None
+            test_node.send_message(msg_inv([CInv(2, blocks_h3[0].sha256)]))
+
+        test_node.sync_with_ping()
+        with mininode_lock:
+            getdata = test_node.last_getdata
+
+        # Check that the getdata includes the right block
+        assert_equal(getdata.inv[0].hash, blocks_h2f[0].sha256)
+        print("Inv at tip triggered getdata for unprocessed block")
+
+        # 7. Send the missing block for the third time (now it is requested)
+        test_node.send_message(msg_block(blocks_h2f[0]))
+
+        test_node.sync_with_ping()
+        assert_equal(self.nodes[0].getblockcount(), 290)
+        print("Successfully reorged to longer chain from non-whitelisted peer")
+
+        [ c.disconnect_node() for c in connections ]
+
+if __name__ == '__main__':
+    AcceptBlockTest().main()
diff --git a/depend/zcash/qa/rpc-tests/p2p-fullblocktest.py b/depend/zcash/qa/rpc-tests/p2p-fullblocktest.py
new file mode 100755
index 000000000..17cc3572c
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/p2p-fullblocktest.py
@@ -0,0 +1,282 @@
+#!/usr/bin/env python3
+# Copyright (c) 2015-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import ComparisonTestFramework
+from test_framework.blocktools import (create_block, create_coinbase)
+from test_framework.comptool import TestManager, TestInstance
+from test_framework.key import CECKey
+from test_framework.mininode import (
+    CBlockHeader,
+    COutPoint,
+    CTransaction,
+    CTxIn,
+    CTxOut,
+    NetworkThread,
+)
+from test_framework.script import CScript, SignatureHash, SIGHASH_ALL, OP_CHECKSIG, OP_TRUE
+from test_framework.util import SAPLING_BRANCH_ID
+import random
+import time
+
+class PreviousSpendableOutput(object):
+    def __init__(self, tx = CTransaction(), n = -1):
+        self.tx = tx
+        self.n = n  # the output we're spending
+
+'''
+This reimplements tests from the bitcoinj/FullBlockTestGenerator used
+by the pull-tester.
+
+We use the testing framework in which we expect a particular answer from
+each test.
+'''
+
+class FullBlockTest(ComparisonTestFramework):
+
+    ''' Can either run this test as 1 node with expected answers, or two and compare them. 
+        Change the "outcome" variable from each TestInstance object to only do the comparison. '''
+    def __init__(self):
+        super().__init__()
+        self.block_heights = {}
+        self.coinbase_key = CECKey()
+        self.coinbase_key.set_secretbytes(b"horsebattery")
+        self.coinbase_pubkey = self.coinbase_key.get_pubkey()
+        self.block_time = int(time.time())+1
+        self.tip = None
+        self.blocks = {}
+
+    def run_test(self):
+        test = TestManager(self, self.options.tmpdir)
+        test.add_all_connections(self.nodes)
+        NetworkThread().start() # Start up network handling in another thread
+        test.run()
+
+    def add_transactions_to_block(self, block, tx_list):
+        [ tx.rehash() for tx in tx_list ]
+        block.vtx.extend(tx_list)
+        block.hashMerkleRoot = block.calc_merkle_root()
+        block.rehash()
+        return block
+    
+    # Create a block on top of self.tip, and advance self.tip to point to the new block
+    # if spend is specified, then 1 satoshi will be spent from that to an anyone-can-spend output,
+    # and rest will go to fees.
+    def next_block(self, number, spend=None, additional_coinbase_value=0, script=None):
+        if self.tip == None:
+            base_block_hash = self.genesis_hash
+        else:
+            base_block_hash = self.tip.sha256
+        # First create the coinbase
+        height = self.block_heights[base_block_hash] + 1
+        coinbase = create_coinbase(height, self.coinbase_pubkey)
+        coinbase.vout[0].nValue += additional_coinbase_value
+        if (spend != None):
+            coinbase.vout[0].nValue += spend.tx.vout[spend.n].nValue - 1 # all but one satoshi to fees
+        coinbase.rehash()
+        block = create_block(base_block_hash, coinbase, self.block_time)
+        if (spend != None):
+            tx = CTransaction()
+            tx.vin.append(CTxIn(COutPoint(spend.tx.sha256, spend.n), b"", 0xffffffff))  # no signature yet
+            # This copies the java comparison tool testing behavior: the first
+            # txout has a garbage scriptPubKey, "to make sure we're not
+            # pre-verifying too much" (?)
+            tx.vout.append(CTxOut(0, CScript([random.randint(0,255), height & 255])))
+            if script == None:
+                tx.vout.append(CTxOut(1, CScript([OP_TRUE])))
+            else:
+                tx.vout.append(CTxOut(1, script))
+            # Now sign it if necessary
+            scriptSig = b""
+            scriptPubKey = bytearray(spend.tx.vout[spend.n].scriptPubKey)
+            if (scriptPubKey[0] == OP_TRUE):  # looks like an anyone-can-spend
+                scriptSig = CScript([OP_TRUE])
+            else:
+                # We have to actually sign it
+                (sighash, err) = SignatureHash(
+                    spend.tx.vout[spend.n].scriptPubKey,
+                    tx,
+                    0,
+                    SIGHASH_ALL,
+                    spend.tx.vout[spend.n].nValue,
+                    SAPLING_BRANCH_ID,
+                )
+                scriptSig = CScript([self.coinbase_key.sign(sighash) + bytes(bytearray([SIGHASH_ALL]))])
+            tx.vin[0].scriptSig = scriptSig
+            # Now add the transaction to the block
+            block = self.add_transactions_to_block(block, [tx])
+        block.solve()
+        self.tip = block
+        self.block_heights[block.sha256] = height
+        self.block_time += 1
+        assert number not in self.blocks
+        self.blocks[number] = block
+        return block
+
+    def get_tests(self):
+        self.genesis_hash = int(self.nodes[0].getbestblockhash(), 16)
+        self.block_heights[self.genesis_hash] = 0
+        spendable_outputs = []
+
+        # save the current tip so it can be spent by a later block
+        def save_spendable_output():
+            spendable_outputs.append(self.tip)
+
+        # get an output that we previous marked as spendable
+        def get_spendable_output():
+            return PreviousSpendableOutput(spendable_outputs.pop(0).vtx[0], 0)
+
+        # returns a test case that asserts that the current tip was accepted
+        def accepted():
+            return TestInstance([[self.tip, True]])
+
+        # returns a test case that asserts that the current tip was rejected
+        def rejected():
+            return TestInstance([[self.tip, False]])
+       
+        # move the tip back to a previous block
+        def tip(number):
+            self.tip = self.blocks[number]
+
+        # creates a new block and advances the tip to that block
+        block = self.next_block
+
+
+        # Create a new block
+        block(0)
+        save_spendable_output()
+        yield accepted()
+
+
+        # Now we need that block to mature so we can spend the coinbase.
+        test = TestInstance(sync_every_block=False)
+        for i in range(100):
+            block(1000 + i)
+            test.blocks_and_transactions.append([self.tip, True])
+            save_spendable_output()
+        yield test
+
+
+        # Start by building a couple of blocks on top (which output is spent is in parentheses):
+        #     genesis -> b1 (0) -> b2 (1)
+        out0 = get_spendable_output()
+        block(1, spend=out0)
+        save_spendable_output()
+        yield accepted()
+
+        out1 = get_spendable_output()
+        block(2, spend=out1)
+        # Inv again, then deliver twice (shouldn't break anything).
+        yield accepted()
+
+
+        # so fork like this:
+        # 
+        #     genesis -> b1 (0) -> b2 (1)
+        #                      \-> b3 (1)
+        # 
+        # Nothing should happen at this point. We saw b2 first so it takes priority.
+        tip(1)
+        block(3, spend=out1)
+        # Deliver twice (should still not break anything)
+        yield rejected()
+
+
+        # Now we add another block to make the alternative chain longer.
+        # 
+        #     genesis -> b1 (0) -> b2 (1)
+        #                      \-> b3 (1) -> b4 (2)
+        out2 = get_spendable_output()
+        block(4, spend=out2)
+        yield accepted()
+
+
+        # ... and back to the first chain.
+        #     genesis -> b1 (0) -> b2 (1) -> b5 (2) -> b6 (3)
+        #                      \-> b3 (1) -> b4 (2)
+        tip(2)
+        block(5, spend=out2)
+        save_spendable_output()
+        yield rejected()
+
+        out3 = get_spendable_output()
+        block(6, spend=out3)
+        yield accepted()
+
+
+        # Try to create a fork that double-spends
+        #     genesis -> b1 (0) -> b2 (1) -> b5 (2) -> b6 (3)
+        #                                          \-> b7 (2) -> b8 (4)
+        #                      \-> b3 (1) -> b4 (2)
+        tip(5)
+        block(7, spend=out2)
+        yield rejected()
+
+        out4 = get_spendable_output()
+        block(8, spend=out4)
+        yield rejected()
+
+
+        # Try to create a block that has too much fee
+        #     genesis -> b1 (0) -> b2 (1) -> b5 (2) -> b6 (3)
+        #                                                    \-> b9 (4)
+        #                      \-> b3 (1) -> b4 (2)
+        tip(6)
+        block(9, spend=out4, additional_coinbase_value=1)
+        yield rejected()
+
+        
+        # Create a fork that ends in a block with too much fee (the one that causes the reorg)
+        #     genesis -> b1 (0) -> b2 (1) -> b5 (2) -> b6  (3)
+        #                                          \-> b10 (3) -> b11 (4)
+        #                      \-> b3 (1) -> b4 (2)
+        tip(5)
+        block(10, spend=out3)
+        yield rejected()
+
+        block(11, spend=out4, additional_coinbase_value=1)
+        yield rejected()
+
+
+        # Try again, but with a valid fork first
+        #     genesis -> b1 (0) -> b2 (1) -> b5 (2) -> b6  (3)
+        #                                          \-> b12 (3) -> b13 (4) -> b14 (5)
+        #                                              (b12 added last)
+        #                      \-> b3 (1) -> b4 (2)
+        tip(5)
+        b12 = block(12, spend=out3)
+        save_spendable_output()
+        #yield TestInstance([[b12, False]])
+        b13 = block(13, spend=out4)
+        # Deliver the block header for b12, and the block b13.
+        # b13 should be accepted but the tip won't advance until b12 is delivered.
+        yield TestInstance([[CBlockHeader(b12), None], [b13, False]])
+
+        save_spendable_output()
+        out5 = get_spendable_output()
+        # b14 is invalid, but the node won't know that until it tries to connect
+        # Tip still can't advance because b12 is missing
+        block(14, spend=out5, additional_coinbase_value=1)
+        yield rejected()
+
+        yield TestInstance([[b12, True, b13.sha256]]) # New tip should be b13.
+
+        
+        # Test that a block with a lot of checksigs is okay
+        lots_of_checksigs = CScript([OP_CHECKSIG] * (1000000 // 50 - 1))
+        tip(13)
+        block(15, spend=out5, script=lots_of_checksigs)
+        yield accepted()
+
+
+        # Test that a block with too many checksigs is rejected
+        out6 = get_spendable_output()
+        too_many_checksigs = CScript([OP_CHECKSIG] * (1000000 // 50))
+        block(16, spend=out6, script=too_many_checksigs)
+        yield rejected()
+
+
+
+if __name__ == '__main__':
+    FullBlockTest().main()
diff --git a/depend/zcash/qa/rpc-tests/p2p_node_bloom.py b/depend/zcash/qa/rpc-tests/p2p_node_bloom.py
new file mode 100755
index 000000000..505cf98a3
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/p2p_node_bloom.py
@@ -0,0 +1,111 @@
+#!/usr/bin/env python3
+# Copyright (c) 2018 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.mininode import NodeConn, NodeConnCB, NetworkThread, \
+    msg_filteradd, msg_filterclear, mininode_lock, SAPLING_PROTO_VERSION
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import initialize_chain_clean, start_nodes, \
+    p2p_port, assert_equal
+
+import time
+
+
+class TestNode(NodeConnCB):
+    def __init__(self):
+        NodeConnCB.__init__(self)
+        self.create_callback_map()
+        self.connection = None
+
+    def add_connection(self, conn):
+        self.connection = conn
+
+    # Spin until verack message is received from the node.
+    # We use this to signal that our test can begin. This
+    # is called from the testing thread, so it needs to acquire
+    # the global lock.
+    def wait_for_verack(self):
+        while True:
+            with mininode_lock:
+                if self.verack_received:
+                    return
+            time.sleep(0.05)
+
+    # Wrapper for the NodeConn's send_message function
+    def send_message(self, message):
+        self.connection.send_message(message)
+
+    def on_close(self, conn):
+        pass
+
+    def on_reject(self, conn, message):
+        conn.rejectMessage = message
+
+
+class NodeBloomTest(BitcoinTestFramework):
+
+    def setup_chain(self):
+        print("Initializing test directory "+self.options.tmpdir)
+        initialize_chain_clean(self.options.tmpdir, 2)
+
+    def setup_network(self):
+        self.nodes = start_nodes(2, self.options.tmpdir,
+                                 extra_args=[['-nopeerbloomfilters', '-enforcenodebloom'], []])
+
+    def run_test(self):
+        nobf_node = TestNode()
+        bf_node = TestNode()
+
+        connections = []
+        connections.append(NodeConn('127.0.0.1', p2p_port(0), self.nodes[0], nobf_node))
+        connections.append(NodeConn('127.0.0.1', p2p_port(1), self.nodes[1], bf_node))
+        nobf_node.add_connection(connections[0])
+        bf_node.add_connection(connections[1])
+
+        # Start up network handling in another thread
+        NetworkThread().start()
+
+        nobf_node.wait_for_verack()
+        bf_node.wait_for_verack()
+
+        # Verify mininodes are connected to zcashd nodes
+        peerinfo = self.nodes[0].getpeerinfo()
+        versions = [x["version"] for x in peerinfo]
+        assert_equal(1, versions.count(SAPLING_PROTO_VERSION))
+        peerinfo = self.nodes[1].getpeerinfo()
+        versions = [x["version"] for x in peerinfo]
+        assert_equal(1, versions.count(SAPLING_PROTO_VERSION))
+
+        # Mininodes send filterclear message to zcashd node.
+        nobf_node.send_message(msg_filterclear())
+        bf_node.send_message(msg_filterclear())
+
+        time.sleep(3)
+
+        # Verify mininodes are still connected to zcashd nodes
+        peerinfo = self.nodes[0].getpeerinfo()
+        versions = [x["version"] for x in peerinfo]
+        assert_equal(1, versions.count(SAPLING_PROTO_VERSION))
+        peerinfo = self.nodes[1].getpeerinfo()
+        versions = [x["version"] for x in peerinfo]
+        assert_equal(1, versions.count(SAPLING_PROTO_VERSION))
+
+        # Mininodes send filteradd message to zcashd node.
+        nobf_node.send_message(msg_filteradd())
+        bf_node.send_message(msg_filteradd())
+
+        time.sleep(3)
+
+        # Verify NoBF mininode has been dropped, and BF mininode is still connected.
+        peerinfo = self.nodes[0].getpeerinfo()
+        versions = [x["version"] for x in peerinfo]
+        assert_equal(0, versions.count(SAPLING_PROTO_VERSION))
+        peerinfo = self.nodes[1].getpeerinfo()
+        versions = [x["version"] for x in peerinfo]
+        assert_equal(1, versions.count(SAPLING_PROTO_VERSION))
+
+        [ c.disconnect_node() for c in connections ]
+
+if __name__ == '__main__':
+    NodeBloomTest().main()
diff --git a/depend/zcash/qa/rpc-tests/p2p_nu_peer_management.py b/depend/zcash/qa/rpc-tests/p2p_nu_peer_management.py
new file mode 100755
index 000000000..d06a815bb
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/p2p_nu_peer_management.py
@@ -0,0 +1,192 @@
+#!/usr/bin/env python3
+# Copyright (c) 2018 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.mininode import (
+    NodeConn,
+    NodeConnCB,
+    NetworkThread,
+    msg_ping,
+    SPROUT_PROTO_VERSION,
+    OVERWINTER_PROTO_VERSION,
+    SAPLING_PROTO_VERSION,
+)
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import initialize_chain_clean, start_nodes, \
+    p2p_port, assert_equal
+
+import time
+
+#
+# In this test we connect Sprout, Overwinter, and Sapling mininodes to a Zcashd
+# node which will activate Overwinter at block 10 and Sapling at block 15.
+#
+# We test:
+# 1. the mininodes stay connected to Zcash with Sprout consensus rules
+# 2. when Overwinter activates, the Sprout mininodes are dropped
+# 3. new Overwinter and Sapling nodes can connect to Zcash
+# 4. new Sprout nodes cannot connect to Zcash
+# 5. when Sapling activates, the Overwinter mininodes are dropped
+# 6. new Sapling nodes can connect to Zcash
+# 7. new Sprout and Overwinter nodes cannot connect to Zcash
+#
+# This test *does not* verify that prior to each activation, the Zcashd
+# node will prefer connections with NU-aware nodes, with an eviction process
+# that prioritizes non-NU-aware connections.
+#
+
+
+class TestManager(NodeConnCB):
+    def __init__(self):
+        NodeConnCB.__init__(self)
+        self.create_callback_map()
+
+    def on_close(self, conn):
+        pass
+
+    def on_reject(self, conn, message):
+        conn.rejectMessage = message
+
+
+class NUPeerManagementTest(BitcoinTestFramework):
+
+    def setup_chain(self):
+        print("Initializing test directory "+self.options.tmpdir)
+        initialize_chain_clean(self.options.tmpdir, 1)
+
+    def setup_network(self):
+        self.nodes = start_nodes(1, self.options.tmpdir, extra_args=[[
+            '-nuparams=5ba81b19:10', # Overwinter
+            '-nuparams=76b809bb:15', # Sapling
+            '-debug',
+            '-whitelist=127.0.0.1',
+        ]])
+
+    def run_test(self):
+        test = TestManager()
+
+        # Launch Sprout, Overwinter, and Sapling mininodes
+        nodes = []
+        for x in range(10):
+            nodes.append(NodeConn('127.0.0.1', p2p_port(0), self.nodes[0],
+                test, "regtest", SPROUT_PROTO_VERSION))
+            nodes.append(NodeConn('127.0.0.1', p2p_port(0), self.nodes[0],
+                test, "regtest", OVERWINTER_PROTO_VERSION))
+            nodes.append(NodeConn('127.0.0.1', p2p_port(0), self.nodes[0],
+                test, "regtest", SAPLING_PROTO_VERSION))
+
+        # Start up network handling in another thread
+        NetworkThread().start()
+
+        # Sprout consensus rules apply at block height 9
+        self.nodes[0].generate(9)
+        assert_equal(9, self.nodes[0].getblockcount())
+
+        # Verify mininodes are still connected to zcashd node
+        peerinfo = self.nodes[0].getpeerinfo()
+        versions = [x["version"] for x in peerinfo]
+        assert_equal(10, versions.count(SPROUT_PROTO_VERSION))
+        assert_equal(10, versions.count(OVERWINTER_PROTO_VERSION))
+        assert_equal(10, versions.count(SAPLING_PROTO_VERSION))
+
+        # Overwinter consensus rules activate at block height 10
+        self.nodes[0].generate(1)
+        assert_equal(10, self.nodes[0].getblockcount())
+        print('Overwinter active')
+
+        # Mininodes send ping message to zcashd node.
+        pingCounter = 1
+        for node in nodes:
+            node.send_message(msg_ping(pingCounter))
+            pingCounter = pingCounter + 1
+
+        time.sleep(3)
+
+        # Verify Sprout mininodes have been dropped, while Overwinter and
+        # Sapling mininodes are still connected.
+        peerinfo = self.nodes[0].getpeerinfo()
+        versions = [x["version"] for x in peerinfo]
+        assert_equal(0, versions.count(SPROUT_PROTO_VERSION))
+        assert_equal(10, versions.count(OVERWINTER_PROTO_VERSION))
+        assert_equal(10, versions.count(SAPLING_PROTO_VERSION))
+
+        # Extend the Overwinter chain with another block.
+        self.nodes[0].generate(1)
+
+        # Connect a new Overwinter mininode to the zcashd node, which is accepted.
+        nodes.append(NodeConn('127.0.0.1', p2p_port(0), self.nodes[0], test, "regtest", OVERWINTER_PROTO_VERSION))
+        time.sleep(3)
+        assert_equal(21, len(self.nodes[0].getpeerinfo()))
+
+        # Connect a new Sapling mininode to the zcashd node, which is accepted.
+        nodes.append(NodeConn('127.0.0.1', p2p_port(0), self.nodes[0], test, "regtest", SAPLING_PROTO_VERSION))
+        time.sleep(3)
+        assert_equal(22, len(self.nodes[0].getpeerinfo()))
+
+        # Try to connect a new Sprout mininode to the zcashd node, which is rejected.
+        sprout = NodeConn('127.0.0.1', p2p_port(0), self.nodes[0], test, "regtest", SPROUT_PROTO_VERSION)
+        nodes.append(sprout)
+        time.sleep(3)
+        assert("Version must be 170003 or greater" in str(sprout.rejectMessage))
+
+        # Verify that only Overwinter and Sapling mininodes are connected.
+        peerinfo = self.nodes[0].getpeerinfo()
+        versions = [x["version"] for x in peerinfo]
+        assert_equal(0, versions.count(SPROUT_PROTO_VERSION))
+        assert_equal(11, versions.count(OVERWINTER_PROTO_VERSION))
+        assert_equal(11, versions.count(SAPLING_PROTO_VERSION))
+
+        # Sapling consensus rules activate at block height 15
+        self.nodes[0].generate(4)
+        assert_equal(15, self.nodes[0].getblockcount())
+        print('Sapling active')
+
+        # Mininodes send ping message to zcashd node.
+        pingCounter = 1
+        for node in nodes:
+            node.send_message(msg_ping(pingCounter))
+            pingCounter = pingCounter + 1
+
+        time.sleep(3)
+
+        # Verify Sprout and Overwinter mininodes have been dropped, while
+        # Sapling mininodes are still connected.
+        peerinfo = self.nodes[0].getpeerinfo()
+        versions = [x["version"] for x in peerinfo]
+        assert_equal(0, versions.count(SPROUT_PROTO_VERSION))
+        assert_equal(0, versions.count(OVERWINTER_PROTO_VERSION))
+        assert_equal(11, versions.count(SAPLING_PROTO_VERSION))
+
+        # Extend the Sapling chain with another block.
+        self.nodes[0].generate(1)
+
+        # Connect a new Sapling mininode to the zcashd node, which is accepted.
+        nodes.append(NodeConn('127.0.0.1', p2p_port(0), self.nodes[0], test, "regtest", SAPLING_PROTO_VERSION))
+        time.sleep(3)
+        assert_equal(12, len(self.nodes[0].getpeerinfo()))
+
+        # Try to connect a new Sprout mininode to the zcashd node, which is rejected.
+        sprout = NodeConn('127.0.0.1', p2p_port(0), self.nodes[0], test, "regtest", SPROUT_PROTO_VERSION)
+        nodes.append(sprout)
+        time.sleep(3)
+        assert("Version must be 170006 or greater" in str(sprout.rejectMessage))
+
+        # Try to connect a new Overwinter mininode to the zcashd node, which is rejected.
+        sprout = NodeConn('127.0.0.1', p2p_port(0), self.nodes[0], test, "regtest", OVERWINTER_PROTO_VERSION)
+        nodes.append(sprout)
+        time.sleep(3)
+        assert("Version must be 170006 or greater" in str(sprout.rejectMessage))
+
+        # Verify that only Sapling mininodes are connected.
+        peerinfo = self.nodes[0].getpeerinfo()
+        versions = [x["version"] for x in peerinfo]
+        assert_equal(0, versions.count(SPROUT_PROTO_VERSION))
+        assert_equal(0, versions.count(OVERWINTER_PROTO_VERSION))
+        assert_equal(12, versions.count(SAPLING_PROTO_VERSION))
+
+        for node in nodes:
+            node.disconnect_node()
+
+if __name__ == '__main__':
+    NUPeerManagementTest().main()
diff --git a/depend/zcash/qa/rpc-tests/p2p_txexpiringsoon.py b/depend/zcash/qa/rpc-tests/p2p_txexpiringsoon.py
new file mode 100755
index 000000000..4cc4a38c7
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/p2p_txexpiringsoon.py
@@ -0,0 +1,211 @@
+#!/usr/bin/env python3
+# Copyright (c) 2018 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.authproxy import JSONRPCException
+from test_framework.mininode import NodeConn, NetworkThread, CInv, \
+    msg_mempool, msg_getdata, msg_tx, mininode_lock, SAPLING_PROTO_VERSION
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, connect_nodes_bi, fail, \
+    p2p_port, start_nodes, sync_blocks, sync_mempools
+from tx_expiry_helper import TestNode, create_transaction
+
+
+class TxExpiringSoonTest(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 3
+        self.setup_clean_chain = True
+
+    def setup_network(self):
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir)
+        connect_nodes_bi(self.nodes, 0, 1)
+        # We don't connect node 2
+
+    def send_transaction(self, testnode, block, address, expiry_height):
+        tx = create_transaction(self.nodes[0],
+                                block,
+                                address,
+                                10.0,
+                                expiry_height)
+        testnode.send_message(msg_tx(tx))
+
+        # Sync up with node after p2p messages delivered
+        testnode.sync_with_ping()
+
+        # Sync nodes 0 and 1
+        sync_blocks(self.nodes[:2])
+        sync_mempools(self.nodes[:2])
+
+        return tx
+
+    def verify_inv(self, testnode, tx):
+        # Make sure we are synced before sending the mempool message
+        testnode.sync_with_ping()
+
+        # Send p2p message "mempool" to receive contents from zcashd node in "inv" message
+        with mininode_lock:
+            testnode.last_inv = None
+            testnode.send_message(msg_mempool())
+
+        # Sync up with node after p2p messages delivered
+        testnode.sync_with_ping(waiting_for=lambda x: x.last_inv)
+
+        with mininode_lock:
+            msg = testnode.last_inv
+            assert_equal(len(msg.inv), 1)
+            assert_equal(tx.sha256, msg.inv[0].hash)
+
+    def send_data_message(self, testnode, tx):
+        # Send p2p message "getdata" to verify tx gets sent in "tx" message
+        getdatamsg = msg_getdata()
+        getdatamsg.inv = [CInv(1, tx.sha256)]
+        with mininode_lock:
+            testnode.last_notfound = None
+            testnode.last_tx = None
+            testnode.send_message(getdatamsg)
+
+    def verify_last_tx(self, testnode, tx):
+        # Sync up with node after p2p messages delivered
+        testnode.sync_with_ping()
+
+        # Verify data received in "tx" message is for tx
+        with mininode_lock:
+            incoming_tx = testnode.last_tx.tx
+            incoming_tx.rehash()
+            assert_equal(tx.sha256, incoming_tx.sha256)
+
+    def run_test(self):
+        testnode0 = TestNode()
+        connections = []
+        connections.append(NodeConn('127.0.0.1', p2p_port(0), self.nodes[0],
+                                    testnode0, "regtest", SAPLING_PROTO_VERSION))
+        testnode0.add_connection(connections[0])
+
+        # Start up network handling in another thread
+        NetworkThread().start()
+        testnode0.wait_for_verack()
+
+        # Verify mininodes are connected to zcashd nodes
+        peerinfo = self.nodes[0].getpeerinfo()
+        versions = [x["version"] for x in peerinfo]
+        assert_equal(1, versions.count(SAPLING_PROTO_VERSION))
+        assert_equal(0, peerinfo[0]["banscore"])
+
+        # Mine some blocks so we can spend
+        coinbase_blocks = self.nodes[0].generate(200)
+        node_address = self.nodes[0].getnewaddress()
+
+        # Sync nodes 0 and 1
+        sync_blocks(self.nodes[:2])
+        sync_mempools(self.nodes[:2])
+
+        # Verify block count
+        assert_equal(self.nodes[0].getblockcount(), 200)
+        assert_equal(self.nodes[1].getblockcount(), 200)
+        assert_equal(self.nodes[2].getblockcount(), 0)
+
+        # Mininodes send expiring soon transaction in "tx" message to zcashd node
+        self.send_transaction(testnode0, coinbase_blocks[0], node_address, 203)
+
+        # Assert that the tx is not in the mempool (expiring soon)
+        assert_equal([], self.nodes[0].getrawmempool())
+        assert_equal([], self.nodes[1].getrawmempool())
+        assert_equal([], self.nodes[2].getrawmempool())
+
+        # Mininodes send transaction in "tx" message to zcashd node
+        tx2 = self.send_transaction(testnode0, coinbase_blocks[1], node_address, 204)
+
+        # tx2 is not expiring soon
+        assert_equal([tx2.hash], self.nodes[0].getrawmempool())
+        assert_equal([tx2.hash], self.nodes[1].getrawmempool())
+        # node 2 is isolated
+        assert_equal([], self.nodes[2].getrawmempool())
+
+        # Verify txid for tx2
+        self.verify_inv(testnode0, tx2)
+        self.send_data_message(testnode0, tx2)
+        self.verify_last_tx(testnode0, tx2)
+
+        # Sync and mine an empty block with node 2, leaving tx in the mempool of node0 and node1
+        for blkhash in coinbase_blocks:
+            blk = self.nodes[0].getblock(blkhash, 0)
+            self.nodes[2].submitblock(blk)
+        self.nodes[2].generate(1)
+
+        # Verify block count
+        assert_equal(self.nodes[0].getblockcount(), 200)
+        assert_equal(self.nodes[1].getblockcount(), 200)
+        assert_equal(self.nodes[2].getblockcount(), 201)
+
+        # Reconnect node 2 to the network
+        connect_nodes_bi(self.nodes, 0, 2)
+
+        # Set up test node for node 2
+        testnode2 = TestNode()
+        connections.append(NodeConn('127.0.0.1', p2p_port(2), self.nodes[2],
+                                    testnode2, "regtest", SAPLING_PROTO_VERSION))
+        testnode2.add_connection(connections[-1])
+
+        # Verify block count
+        sync_blocks(self.nodes[:3])
+        assert_equal(self.nodes[0].getblockcount(), 201)
+        assert_equal(self.nodes[1].getblockcount(), 201)
+        assert_equal(self.nodes[2].getblockcount(), 201)
+
+        # Verify contents of mempool
+        assert_equal([tx2.hash], self.nodes[0].getrawmempool())
+        assert_equal([tx2.hash], self.nodes[1].getrawmempool())
+        assert_equal([], self.nodes[2].getrawmempool())
+
+        # Confirm tx2 cannot be submitted to a mempool because it is expiring soon.
+        try:
+            rawtx2 = tx2.serialize().hex()
+            self.nodes[2].sendrawtransaction(rawtx2)
+            fail("Sending transaction should have failed")
+        except JSONRPCException as e:
+            assert_equal(
+                "tx-expiring-soon: expiryheight is 204 but should be at least 205 to avoid transaction expiring soon",
+                e.error['message']
+            )
+
+        self.send_data_message(testnode0, tx2)
+
+        # Sync up with node after p2p messages delivered
+        testnode0.sync_with_ping()
+
+        # Verify node 0 does not reply to "getdata" by sending "tx" message, as tx2 is expiring soon
+        with mininode_lock:
+            assert_equal(testnode0.last_tx, None)
+
+        # Verify mininode received a "notfound" message containing the txid of tx2
+        with mininode_lock:
+            msg = testnode0.last_notfound
+            assert_equal(len(msg.inv), 1)
+            assert_equal(tx2.sha256, msg.inv[0].hash)
+
+        # Create a transaction to verify that processing of "getdata" messages is functioning
+        tx3 = self.send_transaction(testnode0, coinbase_blocks[2], node_address, 999)
+
+        self.send_data_message(testnode0, tx3)
+        self.verify_last_tx(testnode0, tx3)
+        # Verify txid for tx3 is returned in "inv", but tx2 which is expiring soon is not returned
+        self.verify_inv(testnode0, tx3)
+        self.verify_inv(testnode2, tx3)
+
+        # Verify contents of mempool
+        assert_equal({tx2.hash, tx3.hash}, set(self.nodes[0].getrawmempool()))
+        assert_equal({tx2.hash, tx3.hash}, set(self.nodes[1].getrawmempool()))
+        assert_equal({tx3.hash}, set(self.nodes[2].getrawmempool()))
+
+        # Verify banscore for nodes are still zero
+        assert_equal(0, sum(peer["banscore"] for peer in self.nodes[0].getpeerinfo()))
+        assert_equal(0, sum(peer["banscore"] for peer in self.nodes[2].getpeerinfo()))
+
+        [c.disconnect_node() for c in connections]
+
+
+if __name__ == '__main__':
+    TxExpiringSoonTest().main()
diff --git a/depend/zcash/qa/rpc-tests/p2p_txexpiry_dos.py b/depend/zcash/qa/rpc-tests/p2p_txexpiry_dos.py
new file mode 100755
index 000000000..e1b7e9e1e
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/p2p_txexpiry_dos.py
@@ -0,0 +1,82 @@
+#!/usr/bin/env python3
+# Copyright (c) 2018 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.mininode import NodeConn, NetworkThread, \
+    msg_tx, SAPLING_PROTO_VERSION
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import start_nodes, p2p_port, assert_equal
+from tx_expiry_helper import TestNode, create_transaction
+
+import time
+
+
+class TxExpiryDoSTest(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 1
+        self.setup_clean_chain = True
+
+    def setup_network(self):
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir)
+
+    def run_test(self):
+        test_node = TestNode()
+
+        connections = []
+        connections.append(NodeConn('127.0.0.1', p2p_port(0), self.nodes[0],
+                                    test_node, "regtest", SAPLING_PROTO_VERSION))
+        test_node.add_connection(connections[0])
+
+        # Start up network handling in another thread
+        NetworkThread().start()
+
+        test_node.wait_for_verack()
+
+        # Verify mininodes are connected to zcashd nodes
+        peerinfo = self.nodes[0].getpeerinfo()
+        versions = [x["version"] for x in peerinfo]
+        assert_equal(1, versions.count(SAPLING_PROTO_VERSION))
+        assert_equal(0, peerinfo[0]["banscore"])
+
+        coinbase_blocks = self.nodes[0].generate(1)
+        self.nodes[0].generate(100)
+        node_address = self.nodes[0].getnewaddress()
+
+        # Mininodes send transaction to zcashd node.
+        spendtx = create_transaction(self.nodes[0],
+                                     coinbase_blocks[0],
+                                     node_address,
+                                     1.0,
+                                     101)
+        test_node.send_message(msg_tx(spendtx))
+
+        time.sleep(3)
+
+        # Verify test mininode has not been dropped
+        # and still has a banscore of 0.
+        peerinfo = self.nodes[0].getpeerinfo()
+        versions = [x["version"] for x in peerinfo]
+        assert_equal(1, versions.count(SAPLING_PROTO_VERSION))
+        assert_equal(0, peerinfo[0]["banscore"])
+
+        # Mine a block and resend the transaction
+        self.nodes[0].generate(1)
+        test_node.send_message(msg_tx(spendtx))
+
+        time.sleep(3)
+
+        # Verify test mininode has not been dropped
+        # but has a banscore of 10.
+        peerinfo = self.nodes[0].getpeerinfo()
+        versions = [x["version"] for x in peerinfo]
+        assert_equal(1, versions.count(SAPLING_PROTO_VERSION))
+        assert_equal(10, peerinfo[0]["banscore"])
+
+        [c.disconnect_node() for c in connections]
+
+
+if __name__ == '__main__':
+    TxExpiryDoSTest().main()
diff --git a/depend/zcash/qa/rpc-tests/post_heartwood_rollback.py b/depend/zcash/qa/rpc-tests/post_heartwood_rollback.py
new file mode 100755
index 000000000..4f11545ea
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/post_heartwood_rollback.py
@@ -0,0 +1,115 @@
+#!/usr/bin/env python3
+# Copyright (c) 2019 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+'''
+Test rollbacks on post-Heartwood chains.
+'''
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    assert_equal,
+    bitcoind_processes,
+    connect_nodes_bi,
+    nuparams,
+    start_node,
+    start_nodes,
+    BLOSSOM_BRANCH_ID,
+    HEARTWOOD_BRANCH_ID,
+    CANOPY_BRANCH_ID,
+)
+
+import logging
+import time
+
+HAS_CANOPY = [nuparams(BLOSSOM_BRANCH_ID, 205), nuparams(HEARTWOOD_BRANCH_ID, 210), nuparams(CANOPY_BRANCH_ID, 220), '-nurejectoldversions=false']
+NO_CANOPY  = [nuparams(BLOSSOM_BRANCH_ID, 205), nuparams(HEARTWOOD_BRANCH_ID, 210), '-nurejectoldversions=false']
+
+class PostHeartwoodRollbackTest (BitcoinTestFramework):
+
+    def setup_nodes(self):
+        return start_nodes(self.num_nodes, self.options.tmpdir, extra_args=[
+            HAS_CANOPY,
+            HAS_CANOPY,
+            NO_CANOPY,
+            NO_CANOPY
+        ])
+
+    def run_test (self):
+
+        # Generate shared state beyond Heartwood activation
+        print("Generating shared state beyond Heartwood activation")
+        logging.info("Generating initial blocks.")
+        self.nodes[0].generate(15)
+        self.sync_all()
+
+        # Split network at block 215 (after Heartwood, before Canopy)
+        print("Splitting network at block 215 (after Heartwood, before Canopy)")
+        self.split_network()
+
+        # Activate Canopy on node 0
+        print("Activating Canopy on node 0")
+        self.nodes[0].generate(5)
+        self.sync_all()
+
+        # Mine past Canopy activation height on node 2
+        print("Mining past Canopy activation height on node 2 ")
+        self.nodes[2].generate(20)
+        self.sync_all()
+
+        # print("nodes[0].getblockcount()", self.nodes[0].getblockcount())
+        # print("nodes[2].getblockcount()", self.nodes[2].getblockcount())
+
+        # for i in range (0,3,2):
+        #     blockcount = self.nodes[i].getblockcount()
+        #     for j in range (201,blockcount + 1):
+        #         print("\n before shutdown node: ", i, "block: ", j, "\n")
+        #         print(self.nodes[i].getblock(str(j)))
+
+        # Upgrade node 2 and 3 to Canopy
+        print("Upgrading nodes 2 and 3 to Canopy")
+        self.nodes[2].stop()
+        bitcoind_processes[2].wait()
+        self.nodes[2] = start_node(2, self.options.tmpdir, extra_args=HAS_CANOPY)
+
+        self.nodes[3].stop()
+        bitcoind_processes[3].wait()
+        self.nodes[3] = start_node(3, self.options.tmpdir, extra_args=HAS_CANOPY)
+
+        # for i in range (0,3,2):
+        #     blockcount = self.nodes[i].getblockcount()
+        #     for j in range (201,blockcount + 1):
+        #         print("\n after shutdown node: ", i, "block: ", j, "\n")
+        #         print(self.nodes[i].getblock(str(j)))
+
+        # Join network
+        print("Joining network")
+        # (if we used self.sync_all() here and there was a bug, the test would hang)
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,0,2)
+        connect_nodes_bi(self.nodes,0,3)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,1,3)
+        connect_nodes_bi(self.nodes,2,3)
+
+        time.sleep(5)
+
+        # for i in range (0,3,2):
+        #     blockcount = self.nodes[i].getblockcount()
+        #     for j in range (201,blockcount + 1):
+        #         print("\n after sync node: ", i, "block: ", j, "\n")
+        #         print(self.nodes[i].getblock(str(j)))
+
+        node0_blockcount = self.nodes[0].getblockcount()
+        node2_blockcount = self.nodes[2].getblockcount()
+
+        assert_equal(node0_blockcount, node2_blockcount, "node 0 blockcount: " + str(node0_blockcount) + "node 2 blockcount: " + str(node2_blockcount))
+
+        node0_bestblockhash = self.nodes[0].getbestblockhash()
+        node2_bestblockhash = self.nodes[2].getbestblockhash()
+
+        assert_equal(node0_bestblockhash, node2_bestblockhash, "node 0 bestblockhash: " + str(node0_bestblockhash) + "node 2 bestblockhash: " + str(node2_blockcount))
+
+if __name__ == '__main__':
+    PostHeartwoodRollbackTest().main()
diff --git a/depend/zcash/qa/rpc-tests/prioritisetransaction.py b/depend/zcash/qa/rpc-tests/prioritisetransaction.py
new file mode 100755
index 000000000..a4d215702
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/prioritisetransaction.py
@@ -0,0 +1,140 @@
+#!/usr/bin/env python3
+# Copyright (c) 2017 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    assert_equal,
+    connect_nodes,
+    initialize_chain_clean,
+    start_node,
+    sync_blocks,
+    sync_mempools,
+)
+from test_framework.mininode import COIN
+
+import time
+
+
+class PrioritiseTransactionTest (BitcoinTestFramework):
+
+    def setup_chain(self):
+        print("Initializing test directory "+self.options.tmpdir)
+        initialize_chain_clean(self.options.tmpdir, 4)
+
+    def setup_network(self, split=False):
+        self.nodes = []
+        # Start nodes with tiny block size of 11kb
+        self.nodes.append(start_node(0, self.options.tmpdir, ["-blockprioritysize=7000", "-blockmaxsize=11000", "-maxorphantx=1000", "-relaypriority=true", "-printpriority=1"]))
+        self.nodes.append(start_node(1, self.options.tmpdir, ["-blockprioritysize=7000", "-blockmaxsize=11000", "-maxorphantx=1000", "-relaypriority=true", "-printpriority=1"]))
+        connect_nodes(self.nodes[1], 0)
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test (self):
+        # tx priority is calculated: priority = sum(input_value_in_base_units * input_age)/size_in_bytes
+
+        print("Mining 11kb blocks...")
+        self.nodes[0].generate(501)
+
+        base_fee = self.nodes[0].getnetworkinfo()['relayfee']
+
+        # 11 kb blocks will only hold about 50 txs, so this will fill mempool with older txs
+        taddr = self.nodes[1].getnewaddress()
+        for _ in range(900):
+            self.nodes[0].sendtoaddress(taddr, 0.1)
+        self.nodes[0].generate(1)
+        sync_blocks(self.nodes)
+        # With a rate of either 7tx/s or 14tx/s per peer (depending on whether
+        # the connection is inbound or outbound), syncing this many transactions
+        # could take up to 128s. So use a higher timeout on the mempool sync.
+        sync_mempools(self.nodes, timeout=200)
+
+        # Create tx of lower value to be prioritized on node 0
+        # Older transactions get mined first, so this lower value, newer tx is unlikely to be mined without prioritisation
+        priority_tx_0 = self.nodes[0].sendtoaddress(self.nodes[1].getnewaddress(), 0.1)
+
+        # Check that priority_tx_0 is not in block_template() prior to prioritisation
+        block_template = self.nodes[0].getblocktemplate()
+        in_block_template = False
+        for tx in block_template['transactions']:
+            if tx['hash'] == priority_tx_0:
+                in_block_template = True
+                break
+        assert_equal(in_block_template, False)
+
+        priority_success = self.nodes[0].prioritisetransaction(priority_tx_0, 1000, int(3 * base_fee * COIN))
+        assert(priority_success)
+
+        # Check that prioritized transaction is not in getblocktemplate()
+        # (not updated because no new txns)
+        in_block_template = False
+        block_template = self.nodes[0].getblocktemplate()
+        for tx in block_template['transactions']:
+            if tx['hash'] == priority_tx_0:
+                in_block_template = True
+                break
+        assert_equal(in_block_template, False)
+
+        # Sending a new transaction will make getblocktemplate refresh within 10s
+        self.nodes[0].sendtoaddress(self.nodes[1].getnewaddress(), 0.1)
+
+        # Check that prioritized transaction is not in getblocktemplate()
+        # (too soon)
+        in_block_template = False
+        block_template = self.nodes[0].getblocktemplate()
+        for tx in block_template['transactions']:
+            if tx['hash'] == priority_tx_0:
+                in_block_template = True
+                break
+        assert_equal(in_block_template, False)
+
+        # Check that prioritized transaction is in getblocktemplate()
+        # getblocktemplate() will refresh after 1 min, or after 10 sec if new transaction is added to mempool
+        # Mempool is probed every 10 seconds. We'll give getblocktemplate() a maximum of 30 seconds to refresh
+        block_template = self.nodes[0].getblocktemplate()
+        start = time.time();
+        in_block_template = False
+        while in_block_template == False:
+            for tx in block_template['transactions']:
+                if tx['hash'] == priority_tx_0:
+                    in_block_template = True
+                    break
+            if time.time() - start > 30:
+                raise AssertionError("Test timed out because prioritised transaction was not returned by getblocktemplate within 30 seconds.")
+            time.sleep(1)
+            block_template = self.nodes[0].getblocktemplate()
+
+        assert(in_block_template)
+
+        # Node 1 doesn't get the next block, so this *shouldn't* be mined despite being prioritized on node 1
+        priority_tx_1 = self.nodes[1].sendtoaddress(self.nodes[0].getnewaddress(), 0.1)
+        self.nodes[1].prioritisetransaction(priority_tx_1, 1000, int(3 * base_fee * COIN))
+
+        # Mine block on node 0
+        blk_hash = self.nodes[0].generate(1)
+        block = self.nodes[0].getblock(blk_hash[0])
+        self.sync_all()
+
+        # Check that priority_tx_0 was mined
+        mempool = self.nodes[0].getrawmempool()
+        assert_equal(priority_tx_0 in block['tx'], True)
+        assert_equal(priority_tx_0 in mempool, False)
+
+        # Check that priority_tx_1 was not mined
+        assert_equal(priority_tx_1 in mempool, True)
+        assert_equal(priority_tx_1 in block['tx'], False)
+
+        # Mine a block on node 1 and sync
+        blk_hash_1 = self.nodes[1].generate(1)
+        block_1 = self.nodes[1].getblock(blk_hash_1[0])
+        self.sync_all()
+
+        # Check to see if priority_tx_1 is now mined
+        mempool_1 = self.nodes[1].getrawmempool()
+        assert_equal(priority_tx_1 in mempool_1, False)
+        assert_equal(priority_tx_1 in block_1['tx'], True)
+
+if __name__ == '__main__':
+    PrioritiseTransactionTest().main()
diff --git a/depend/zcash/qa/rpc-tests/proxy_test.py b/depend/zcash/qa/rpc-tests/proxy_test.py
new file mode 100755
index 000000000..d26f90f7c
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/proxy_test.py
@@ -0,0 +1,195 @@
+#!/usr/bin/env python3
+# Copyright (c) 2015-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+import socket
+import os
+
+from test_framework.socks5 import Socks5Configuration, Socks5Command, Socks5Server, AddressType
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, start_nodes
+from test_framework.netutil import test_ipv6_local
+'''
+Test plan:
+- Start bitcoind's with different proxy configurations
+- Use addnode to initiate connections
+- Verify that proxies are connected to, and the right connection command is given
+- Proxy configurations to test on bitcoind side:
+    - `-proxy` (proxy everything)
+    - `-onion` (proxy just onions)
+    - `-proxyrandomize` Circuit randomization
+- Proxy configurations to test on proxy side,
+    - support no authentication (other proxy)
+    - support no authentication + user/pass authentication (Tor)
+    - proxy on IPv6
+
+- Create various proxies (as threads)
+- Create bitcoinds that connect to them
+- Manipulate the bitcoinds using addnode (onetry) an observe effects
+
+addnode connect to IPv4
+addnode connect to IPv6
+addnode connect to onion
+addnode connect to generic DNS name
+'''
+
+class ProxyTest(BitcoinTestFramework):        
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 4
+        self.setup_clean_chain = False
+
+        self.have_ipv6 = test_ipv6_local()
+        # Create two proxies on different ports
+        # ... one unauthenticated
+        self.conf1 = Socks5Configuration()
+        self.conf1.addr = ('127.0.0.1', 13000 + (os.getpid() % 1000))
+        self.conf1.unauth = True
+        self.conf1.auth = False
+        # ... one supporting authenticated and unauthenticated (Tor)
+        self.conf2 = Socks5Configuration()
+        self.conf2.addr = ('127.0.0.1', 14000 + (os.getpid() % 1000))
+        self.conf2.unauth = True
+        self.conf2.auth = True
+        if self.have_ipv6:
+            # ... one on IPv6 with similar configuration
+            self.conf3 = Socks5Configuration()
+            self.conf3.af = socket.AF_INET6
+            self.conf3.addr = ('::1', 15000 + (os.getpid() % 1000))
+            self.conf3.unauth = True
+            self.conf3.auth = True
+        else:
+            print("Warning: testing without local IPv6 support")
+
+        self.serv1 = Socks5Server(self.conf1)
+        self.serv1.start()
+        self.serv2 = Socks5Server(self.conf2)
+        self.serv2.start()
+        if self.have_ipv6:
+            self.serv3 = Socks5Server(self.conf3)
+            self.serv3.start()
+
+    def setup_nodes(self):
+        # Note: proxies are not used to connect to local nodes
+        # this is because the proxy to use is based on CService.GetNetwork(), which return NET_UNROUTABLE for localhost
+        args = [
+            ['-listen', '-debug=net', '-debug=proxy', '-proxy=%s:%i' % (self.conf1.addr),'-proxyrandomize=1'], 
+            ['-listen', '-debug=net', '-debug=proxy', '-proxy=%s:%i' % (self.conf1.addr),'-onion=%s:%i' % (self.conf2.addr),'-proxyrandomize=0'], 
+            ['-listen', '-debug=net', '-debug=proxy', '-proxy=%s:%i' % (self.conf2.addr),'-proxyrandomize=1'], 
+            []
+            ]
+        if self.have_ipv6:
+            args[3] = ['-listen', '-debug=net', '-debug=proxy', '-proxy=[%s]:%i' % (self.conf3.addr),'-proxyrandomize=0', '-noonion']
+        return start_nodes(self.num_nodes, self.options.tmpdir, extra_args=args)
+
+    def node_test(self, node, proxies, auth, test_onion=True):
+        rv = []
+        # Test: outgoing IPv4 connection through node
+        node.addnode("15.61.23.23:1234", "onetry")
+        cmd = proxies[0].queue.get()
+        assert(isinstance(cmd, Socks5Command))
+        # Note: bitcoind's SOCKS5 implementation only sends atyp DOMAINNAME, even if connecting directly to IPv4/IPv6
+        assert_equal(cmd.atyp, AddressType.DOMAINNAME)
+        assert_equal(cmd.addr, b"15.61.23.23")
+        assert_equal(cmd.port, 1234)
+        if not auth:
+            assert_equal(cmd.username, None)
+            assert_equal(cmd.password, None)
+        rv.append(cmd)
+
+        if self.have_ipv6:
+            # Test: outgoing IPv6 connection through node
+            node.addnode("[1233:3432:2434:2343:3234:2345:6546:4534]:5443", "onetry")
+            cmd = proxies[1].queue.get()
+            assert(isinstance(cmd, Socks5Command))
+            # Note: bitcoind's SOCKS5 implementation only sends atyp DOMAINNAME, even if connecting directly to IPv4/IPv6
+            assert_equal(cmd.atyp, AddressType.DOMAINNAME)
+            assert_equal(cmd.addr, b"1233:3432:2434:2343:3234:2345:6546:4534")
+            assert_equal(cmd.port, 5443)
+            if not auth:
+                assert_equal(cmd.username, None)
+                assert_equal(cmd.password, None)
+            rv.append(cmd)
+
+        if test_onion:
+            # Test: outgoing onion connection through node
+            node.addnode("bitcoinostk4e4re.onion:8333", "onetry")
+            cmd = proxies[2].queue.get()
+            assert(isinstance(cmd, Socks5Command))
+            assert_equal(cmd.atyp, AddressType.DOMAINNAME)
+            assert_equal(cmd.addr, b"bitcoinostk4e4re.onion")
+            assert_equal(cmd.port, 8333)
+            if not auth:
+                assert_equal(cmd.username, None)
+                assert_equal(cmd.password, None)
+            rv.append(cmd)
+
+        # Test: outgoing DNS name connection through node
+        node.addnode("node.noumenon:8333", "onetry")
+        cmd = proxies[3].queue.get()
+        assert(isinstance(cmd, Socks5Command))
+        assert_equal(cmd.atyp, AddressType.DOMAINNAME)
+        assert_equal(cmd.addr, b"node.noumenon")
+        assert_equal(cmd.port, 8333)
+        if not auth:
+            assert_equal(cmd.username, None)
+            assert_equal(cmd.password, None)
+        rv.append(cmd)
+
+        return rv
+
+    def run_test(self):
+        # basic -proxy
+        self.node_test(self.nodes[0], [self.serv1, self.serv1, self.serv1, self.serv1], False)
+
+        # -proxy plus -onion
+        self.node_test(self.nodes[1], [self.serv1, self.serv1, self.serv2, self.serv1], False)
+
+        # -proxy plus -onion, -proxyrandomize
+        rv = self.node_test(self.nodes[2], [self.serv2, self.serv2, self.serv2, self.serv2], True)
+        # Check that credentials as used for -proxyrandomize connections are unique
+        credentials = set((x.username,x.password) for x in rv)
+        assert_equal(len(credentials), len(rv))
+
+        if self.have_ipv6:
+            # proxy on IPv6 localhost
+            self.node_test(self.nodes[3], [self.serv3, self.serv3, self.serv3, self.serv3], False, False)
+
+        def networks_dict(d):
+            r = {}
+            for x in d['networks']:
+                r[x['name']] = x
+            return r
+
+        # test RPC getnetworkinfo
+        n0 = networks_dict(self.nodes[0].getnetworkinfo())
+        for net in ['ipv4','ipv6','onion']:
+            assert_equal(n0[net]['proxy'], '%s:%i' % (self.conf1.addr))
+            assert_equal(n0[net]['proxy_randomize_credentials'], True)
+        assert_equal(n0['onion']['reachable'], True)
+
+        n1 = networks_dict(self.nodes[1].getnetworkinfo())
+        for net in ['ipv4','ipv6']:
+            assert_equal(n1[net]['proxy'], '%s:%i' % (self.conf1.addr))
+            assert_equal(n1[net]['proxy_randomize_credentials'], False)
+        assert_equal(n1['onion']['proxy'], '%s:%i' % (self.conf2.addr))
+        assert_equal(n1['onion']['proxy_randomize_credentials'], False)
+        assert_equal(n1['onion']['reachable'], True)
+        
+        n2 = networks_dict(self.nodes[2].getnetworkinfo())
+        for net in ['ipv4','ipv6','onion']:
+            assert_equal(n2[net]['proxy'], '%s:%i' % (self.conf2.addr))
+            assert_equal(n2[net]['proxy_randomize_credentials'], True)
+        assert_equal(n2['onion']['reachable'], True)
+
+        if self.have_ipv6:
+            n3 = networks_dict(self.nodes[3].getnetworkinfo())
+            for net in ['ipv4','ipv6']:
+                assert_equal(n3[net]['proxy'], '[%s]:%i' % (self.conf3.addr))
+                assert_equal(n3[net]['proxy_randomize_credentials'], False)
+            assert_equal(n3['onion']['reachable'], False)
+
+if __name__ == '__main__':
+    ProxyTest().main()
+
diff --git a/depend/zcash/qa/rpc-tests/pruning.py b/depend/zcash/qa/rpc-tests/pruning.py
new file mode 100755
index 000000000..95a18ca92
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/pruning.py
@@ -0,0 +1,363 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Test pruning code
+# ********
+# WARNING:
+# This test uses 4GB of disk space.
+# This test takes 30 mins or more (up to 2 hours)
+# ********
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.authproxy import JSONRPCException
+from test_framework.util import start_node, \
+    connect_nodes, stop_node, sync_blocks
+
+import os.path
+import time
+
+def calc_usage(blockdir):
+    return sum(os.path.getsize(blockdir+f) for f in os.listdir(blockdir) if os.path.isfile(blockdir+f)) / (1024. * 1024.)
+
+class PruneTest(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.setup_clean_chain = True
+        self.num_nodes = 3
+
+        self.utxo = []
+        self.address = ["",""]
+
+        # Some pre-processing to create a bunch of OP_RETURN txouts to insert into transactions we create
+        # So we have big transactions and full blocks to fill up our block files
+
+        # create one script_pubkey
+        script_pubkey = "6a4d0200" #OP_RETURN OP_PUSH2 512 bytes
+        for i in range (512):
+            script_pubkey = script_pubkey + "01"
+        # concatenate 128 txouts of above script_pubkey which we'll insert before the txout for change
+        self.txouts = "81"
+        for k in range(128):
+            # add txout value
+            self.txouts = self.txouts + "0000000000000000"
+            # add length of script_pubkey
+            self.txouts = self.txouts + "fd0402"
+            # add script_pubkey
+            self.txouts = self.txouts + script_pubkey
+
+
+    def setup_network(self):
+        self.nodes = []
+        self.is_network_split = False
+
+        # Create nodes 0 and 1 to mine
+        self.nodes.append(start_node(0, self.options.tmpdir, ["-debug","-maxreceivebuffer=20000","-blockmaxsize=999000", "-checkblocks=5"], timewait=900))
+        self.nodes.append(start_node(1, self.options.tmpdir, ["-debug","-maxreceivebuffer=20000","-blockmaxsize=999000", "-checkblocks=5"], timewait=900))
+
+        # Create node 2 to test pruning
+        self.nodes.append(start_node(2, self.options.tmpdir, ["-debug","-maxreceivebuffer=20000","-prune=550"], timewait=900))
+        self.prunedir = self.options.tmpdir+"/node2/regtest/blocks/"
+
+        self.address[0] = self.nodes[0].getnewaddress()
+        self.address[1] = self.nodes[1].getnewaddress()
+
+        # Determine default relay fee
+        self.relayfee = self.nodes[0].getnetworkinfo()["relayfee"]
+
+        connect_nodes(self.nodes[0], 1)
+        connect_nodes(self.nodes[1], 2)
+        connect_nodes(self.nodes[2], 0)
+        sync_blocks(self.nodes[0:3])
+
+    def create_big_chain(self):
+        # Start by creating some coinbases we can spend later
+        self.nodes[1].generate(200)
+        sync_blocks(self.nodes[0:2])
+        self.nodes[0].generate(150)
+        # Then mine enough full blocks to create more than 550MiB of data
+        for i in range(645):
+            self.mine_full_block(self.nodes[0], self.address[0])
+
+        sync_blocks(self.nodes[0:3])
+
+    def test_height_min(self):
+        if not os.path.isfile(self.prunedir+"blk00000.dat"):
+            raise AssertionError("blk00000.dat is missing, pruning too early")
+        print("Success")
+        print("Though we're already using more than 550MiB, current usage:", calc_usage(self.prunedir))
+        print("Mining 25 more blocks should cause the first block file to be pruned")
+        # Pruning doesn't run until we're allocating another chunk, 20 full blocks past the height cutoff will ensure this
+        for i in range(25):
+            self.mine_full_block(self.nodes[0],self.address[0])
+
+        waitstart = time.time()
+        while os.path.isfile(self.prunedir+"blk00000.dat"):
+            time.sleep(0.1)
+            if time.time() - waitstart > 10:
+                raise AssertionError("blk00000.dat not pruned when it should be")
+
+        print("Success")
+        usage = calc_usage(self.prunedir)
+        print("Usage should be below target:", usage)
+        if (usage > 550):
+            raise AssertionError("Pruning target not being met")
+
+    def create_chain_with_staleblocks(self):
+        # Create stale blocks in manageable sized chunks
+        print("Mine 24 (stale) blocks on Node 1, followed by 25 (main chain) block reorg from Node 0, for 12 rounds")
+
+        for j in range(12):
+            # Disconnect node 0 so it can mine a longer reorg chain without knowing about node 1's soon-to-be-stale chain
+            # Node 2 stays connected, so it hears about the stale blocks and then reorg's when node0 reconnects
+            # Stopping node 0 also clears its mempool, so it doesn't have node1's transactions to accidentally mine
+            stop_node(self.nodes[0],0)
+            self.nodes[0]=start_node(0, self.options.tmpdir, ["-debug","-maxreceivebuffer=20000","-blockmaxsize=999000", "-checkblocks=5"], timewait=900)
+            # Mine 24 blocks in node 1
+            self.utxo = self.nodes[1].listunspent()
+            for i in range(24):
+                if j == 0:
+                    self.mine_full_block(self.nodes[1],self.address[1])
+                else:
+                    self.nodes[1].generate(1) #tx's already in mempool from previous disconnects
+
+            # Reorg back with 25 block chain from node 0
+            self.utxo = self.nodes[0].listunspent()
+            for i in range(25):
+                self.mine_full_block(self.nodes[0],self.address[0])
+
+            # Create connections in the order so both nodes can see the reorg at the same time
+            connect_nodes(self.nodes[1], 0)
+            connect_nodes(self.nodes[2], 0)
+            sync_blocks(self.nodes[0:3])
+
+        print("Usage can be over target because of high stale rate:", calc_usage(self.prunedir))
+
+    def reorg_test(self):
+        # Node 1 will mine a 300 block chain starting 287 blocks back from Node 0 and Node 2's tip
+        # This will cause Node 2 to do a reorg requiring 288 blocks of undo data to the reorg_test chain
+        # Reboot node 1 to clear its mempool (hopefully make the invalidate faster)
+        # Lower the block max size so we don't keep mining all our big mempool transactions (from disconnected blocks)
+        stop_node(self.nodes[1],1)
+        self.nodes[1]=start_node(1, self.options.tmpdir, ["-debug","-maxreceivebuffer=20000","-blockmaxsize=5000", "-checkblocks=5", "-disablesafemode"], timewait=900)
+
+        height = self.nodes[1].getblockcount()
+        print("Current block height:", height)
+
+        invalidheight = height-287
+        badhash = self.nodes[1].getblockhash(invalidheight)
+        print("Invalidating block at height:",invalidheight,badhash)
+        self.nodes[1].invalidateblock(badhash)
+
+        # We've now switched to our previously mined-24 block fork on node 1, but that's not what we want
+        # So invalidate that fork as well, until we're on the same chain as node 0/2 (but at an ancestor 288 blocks ago)
+        mainchainhash = self.nodes[0].getblockhash(invalidheight - 1)
+        curhash = self.nodes[1].getblockhash(invalidheight - 1)
+        while curhash != mainchainhash:
+            self.nodes[1].invalidateblock(curhash)
+            curhash = self.nodes[1].getblockhash(invalidheight - 1)
+
+        assert(self.nodes[1].getblockcount() == invalidheight - 1)
+        print("New best height", self.nodes[1].getblockcount())
+
+        # Reboot node1 to clear those giant tx's from mempool
+        stop_node(self.nodes[1],1)
+        self.nodes[1]=start_node(1, self.options.tmpdir, ["-debug","-maxreceivebuffer=20000","-blockmaxsize=5000", "-checkblocks=5", "-disablesafemode"], timewait=900)
+
+        print("Generating new longer chain of 300 more blocks")
+        self.nodes[1].generate(300)
+
+        print("Reconnect nodes")
+        connect_nodes(self.nodes[0], 1)
+        connect_nodes(self.nodes[2], 1)
+        sync_blocks(self.nodes[0:3])
+
+        print("Verify height on node 2:",self.nodes[2].getblockcount())
+        print("Usage possibly still high bc of stale blocks in block files:", calc_usage(self.prunedir))
+
+        print("Mine 220 more blocks so we have requisite history (some blocks will be big and cause pruning of previous chain)")
+        self.nodes[0].generate(220) #node 0 has many large tx's in its mempool from the disconnects
+        sync_blocks(self.nodes[0:3])
+
+        usage = calc_usage(self.prunedir)
+        print("Usage should be below target:", usage)
+        if (usage > 550):
+            raise AssertionError("Pruning target not being met")
+
+        return invalidheight,badhash
+
+    def reorg_back(self):
+        # Verify that a block on the old main chain fork has been pruned away
+        try:
+            self.nodes[2].getblock(self.forkhash)
+            raise AssertionError("Old block wasn't pruned so can't test redownload")
+        except JSONRPCException:
+            print("Will need to redownload block",self.forkheight)
+
+        # Verify that we have enough history to reorg back to the fork point
+        # Although this is more than 288 blocks, because this chain was written more recently
+        # and only its other 299 small and 220 large block are in the block files after it,
+        # its expected to still be retained
+        self.nodes[2].getblock(self.nodes[2].getblockhash(self.forkheight))
+
+        first_reorg_height = self.nodes[2].getblockcount()
+        curchainhash = self.nodes[2].getblockhash(self.mainchainheight)
+        self.nodes[2].invalidateblock(curchainhash)
+        goalbestheight = self.mainchainheight
+        goalbesthash = self.mainchainhash2
+
+        # As of 0.10 the current block download logic is not able to reorg to the original chain created in
+        # create_chain_with_stale_blocks because it doesn't know of any peer that's on that chain from which to
+        # redownload its missing blocks.
+        # Invalidate the reorg_test chain in node 0 as well, it can successfully switch to the original chain
+        # because it has all the block data.
+        # However it must mine enough blocks to have a more work chain than the reorg_test chain in order
+        # to trigger node 2's block download logic.
+        # At this point node 2 is within 288 blocks of the fork point so it will preserve its ability to reorg
+        if self.nodes[2].getblockcount() < self.mainchainheight:
+            blocks_to_mine = first_reorg_height + 1 - self.mainchainheight
+            print("Rewind node 0 to prev main chain to mine longer chain to trigger redownload. Blocks needed:", blocks_to_mine)
+            self.nodes[0].invalidateblock(curchainhash)
+            assert(self.nodes[0].getblockcount() == self.mainchainheight)
+            assert(self.nodes[0].getbestblockhash() == self.mainchainhash2)
+            goalbesthash = self.nodes[0].generate(blocks_to_mine)[-1]
+            goalbestheight = first_reorg_height + 1
+
+        print("Verify node 2 reorged back to the main chain, some blocks of which it had to redownload")
+        waitstart = time.time()
+        while self.nodes[2].getblockcount() < goalbestheight:
+            time.sleep(0.1)
+            if time.time() - waitstart > 900:
+                raise AssertionError("Node 2 didn't reorg to proper height")
+        assert(self.nodes[2].getbestblockhash() == goalbesthash)
+        # Verify we can now have the data for a block previously pruned
+        assert(self.nodes[2].getblock(self.forkhash)["height"] == self.forkheight)
+
+    def mine_full_block(self, node, address):
+        # Want to create a full block
+        # We'll generate a 66k transaction below, and 14 of them is close to the 1MB block limit
+        for j in range(14):
+            if len(self.utxo) < 14:
+                self.utxo = node.listunspent()
+            inputs=[]
+            outputs = {}
+            t = self.utxo.pop()
+            inputs.append({ "txid" : t["txid"], "vout" : t["vout"]})
+            remchange = t["amount"] - 100*self.relayfee # Fee must be above min relay rate for 66kb tx
+            outputs[address]=remchange
+            # Create a basic transaction that will send change back to ourself after account for a fee
+            # And then insert the 128 generated transaction outs in the middle rawtx[92] is where the #
+            # of txouts is stored and is the only thing we overwrite from the original transaction
+            rawtx = node.createrawtransaction(inputs, outputs)
+            newtx = rawtx[0:92]
+            newtx = newtx + self.txouts
+            newtx = newtx + rawtx[94:]
+            # Appears to be ever so slightly faster to sign with SIGHASH_NONE
+            signresult = node.signrawtransaction(newtx,None,None,"NONE")
+            node.sendrawtransaction(signresult["hex"], True)
+        # Mine a full sized block which will be these transactions we just created
+        node.generate(1)
+
+
+    def run_test(self):
+        print("Warning! This test requires 4GB of disk space and takes over 30 mins (up to 2 hours)")
+        print("Mining a big blockchain of 995 blocks")
+        self.create_big_chain()
+        # Chain diagram key:
+        # *   blocks on main chain
+        # +,&,$,@ blocks on other forks
+        # X   invalidated block
+        # N1  Node 1
+        #
+        # Start by mining a simple chain that all nodes have
+        # N0=N1=N2 **...*(995)
+
+        print("Check that we haven't started pruning yet because we're below PruneAfterHeight")
+        self.test_height_min()
+        # Extend this chain past the PruneAfterHeight
+        # N0=N1=N2 **...*(1020)
+
+        print("Check that we'll exceed disk space target if we have a very high stale block rate")
+        self.create_chain_with_staleblocks()
+        # Disconnect N0
+        # And mine a 24 block chain on N1 and a separate 25 block chain on N0
+        # N1=N2 **...*+...+(1044)
+        # N0    **...**...**(1045)
+        #
+        # reconnect nodes causing reorg on N1 and N2
+        # N1=N2 **...*(1020) *...**(1045)
+        #                   \
+        #                    +...+(1044)
+        #
+        # repeat this process until you have 12 stale forks hanging off the
+        # main chain on N1 and N2
+        # N0    *************************...***************************(1320)
+        #
+        # N1=N2 **...*(1020) *...**(1045) *..         ..**(1295) *...**(1320)
+        #                   \            \                      \
+        #                    +...+(1044)  &..                    $...$(1319)
+
+        # Save some current chain state for later use
+        self.mainchainheight = self.nodes[2].getblockcount()   #1320
+        self.mainchainhash2 = self.nodes[2].getblockhash(self.mainchainheight)
+
+        print("Check that we can survive a 288 block reorg still")
+        (self.forkheight,self.forkhash) = self.reorg_test() #(1033, )
+        # Now create a 288 block reorg by mining a longer chain on N1
+        # First disconnect N1
+        # Then invalidate 1033 on main chain and 1032 on fork so height is 1032 on main chain
+        # N1   **...*(1020) **...**(1032)X..
+        #                  \
+        #                   ++...+(1031)X..
+        #
+        # Now mine 300 more blocks on N1
+        # N1    **...*(1020) **...**(1032) @@...@(1332)
+        #                 \               \
+        #                  \               X...
+        #                   \                 \
+        #                    ++...+(1031)X..   ..
+        #
+        # Reconnect nodes and mine 220 more blocks on N1
+        # N1    **...*(1020) **...**(1032) @@...@@@(1552)
+        #                 \               \
+        #                  \               X...
+        #                   \                 \
+        #                    ++...+(1031)X..   ..
+        #
+        # N2    **...*(1020) **...**(1032) @@...@@@(1552)
+        #                 \               \
+        #                  \               *...**(1320)
+        #                   \                 \
+        #                    ++...++(1044)     ..
+        #
+        # N0    ********************(1032) @@...@@@(1552)
+        #                                 \
+        #                                  *...**(1320)
+
+        print("Test that we can rerequest a block we previously pruned if needed for a reorg")
+        self.reorg_back()
+        # Verify that N2 still has block 1033 on current chain (@), but not on main chain (*)
+        # Invalidate 1033 on current chain (@) on N2 and we should be able to reorg to
+        # original main chain (*), but will require redownload of some blocks
+        # In order to have a peer we think we can download from, must also perform this invalidation
+        # on N0 and mine a new longest chain to trigger.
+        # Final result:
+        # N0    ********************(1032) **...****(1553)
+        #                                 \
+        #                                  X@...@@@(1552)
+        #
+        # N2    **...*(1020) **...**(1032) **...****(1553)
+        #                 \               \
+        #                  \               X@...@@@(1552)
+        #                   \
+        #                    +..
+        #
+        # N1 doesn't change because 1033 on main chain (*) is invalid
+
+        print("Done")
+
+if __name__ == '__main__':
+    PruneTest().main()
diff --git a/depend/zcash/qa/rpc-tests/rawtransactions.py b/depend/zcash/qa/rpc-tests/rawtransactions.py
new file mode 100755
index 000000000..a32db8321
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/rawtransactions.py
@@ -0,0 +1,181 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Test re-org scenarios with a mempool that contains transactions
+# that spend (directly or indirectly) coinbase transactions.
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.authproxy import JSONRPCException
+from test_framework.util import assert_equal, \
+    start_nodes, connect_nodes_bi, assert_raises
+
+from decimal import Decimal
+
+# Create one-input, one-output, no-fee transaction:
+class RawTransactionsTest(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.setup_clean_chain = True
+        self.num_nodes = 3
+
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir)
+
+        #connect to a local machine for debugging
+        #url = "http://bitcoinrpc:DP6DvqZtqXarpeNWyN3LZTFchCCyCUuHwNF7E8pX99x1@%s:%d" % ('127.0.0.1', 18232)
+        #proxy = AuthServiceProxy(url)
+        #proxy.url = url # store URL on proxy for info
+        #self.nodes.append(proxy)
+
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,0,2)
+
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test(self):
+
+        #prepare some coins for multiple *rawtransaction commands
+        self.nodes[2].generate(1)
+        self.sync_all()
+        self.nodes[0].generate(101)
+        self.sync_all()
+        self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(),1.5);
+        self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(),1.0);
+        self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(),5.0);
+        self.sync_all()
+        self.nodes[0].generate(5)
+        self.sync_all()
+
+        #########################################
+        # sendrawtransaction with missing input #
+        #########################################
+        inputs  = [ {'txid' : "1d1d4e24ed99057e84c3f80fd8fbec79ed9e1acee37da269356ecea000000000", 'vout' : 1}] #won't exists
+        outputs = { self.nodes[0].getnewaddress() : 4.998 }
+        rawtx   = self.nodes[2].createrawtransaction(inputs, outputs)
+        rawtx   = self.nodes[2].signrawtransaction(rawtx)
+
+        errorString = ""
+        try:
+            rawtx   = self.nodes[2].sendrawtransaction(rawtx['hex'])
+        except JSONRPCException as e:
+            errorString = e.error['message']
+
+        assert_equal("Missing inputs" in errorString, True);
+
+        #####################################
+        # getrawtransaction with block hash #
+        #####################################
+
+        # make a tx by sending then generate 2 blocks; block1 has the tx in it
+        tx = self.nodes[2].sendtoaddress(self.nodes[1].getnewaddress(), 1)
+        block1, block2 = self.nodes[2].generate(2)
+        self.sync_all()
+        # We should be able to get the raw transaction by providing the correct block
+        gottx = self.nodes[0].getrawtransaction(tx, 1, block1)
+        assert_equal(gottx['txid'], tx)
+        assert_equal(gottx['in_active_chain'], True)
+        # We should not have the 'in_active_chain' flag when we don't provide a block
+        gottx = self.nodes[0].getrawtransaction(tx, 1)
+        assert_equal(gottx['txid'], tx)
+        assert 'in_active_chain' not in gottx
+        # We should have hex for the transaction from the getblock and getrawtransaction calls.
+        blk = self.nodes[0].getblock(block1, 2)
+        assert_equal(gottx['hex'], blk['tx'][1]['hex'])
+        # We should not get the tx if we provide an unrelated block
+        assert_raises(JSONRPCException, self.nodes[0].getrawtransaction, tx, 1, block2)
+        # An invalid block hash should raise errors
+        assert_raises(JSONRPCException, self.nodes[0].getrawtransaction, tx, 1, True)
+        assert_raises(JSONRPCException, self.nodes[0].getrawtransaction, tx, 1, "foobar")
+        assert_raises(JSONRPCException, self.nodes[0].getrawtransaction, tx, 1, "abcd1234")
+        assert_raises(JSONRPCException, self.nodes[0].getrawtransaction, tx, 1, "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa")
+
+        #########################
+        # RAW TX MULTISIG TESTS #
+        #########################
+        # 2of2 test
+        addr1 = self.nodes[2].getnewaddress()
+        addr2 = self.nodes[2].getnewaddress()
+
+        addr1Obj = self.nodes[2].validateaddress(addr1)
+        addr2Obj = self.nodes[2].validateaddress(addr2)
+
+        mSigObj = self.nodes[2].addmultisigaddress(2, [addr1Obj['pubkey'], addr2Obj['pubkey']])
+        mSigObjValid = self.nodes[2].validateaddress(mSigObj)
+
+        #use balance deltas instead of absolute values
+        bal = self.nodes[2].getbalance()
+
+        # send 1.2 BTC to msig adr
+        txId       = self.nodes[0].sendtoaddress(mSigObj, 1.2);
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+        assert_equal(self.nodes[2].getbalance(), bal+Decimal('1.20000000')) #node2 has both keys of the 2of2 ms addr., tx should affect the balance
+
+
+        # 2of3 test from different nodes
+        bal = self.nodes[2].getbalance()
+        addr1 = self.nodes[1].getnewaddress()
+        addr2 = self.nodes[2].getnewaddress()
+        addr3 = self.nodes[2].getnewaddress()
+
+        addr1Obj = self.nodes[1].validateaddress(addr1)
+        addr2Obj = self.nodes[2].validateaddress(addr2)
+        addr3Obj = self.nodes[2].validateaddress(addr3)
+
+        mSigObj = self.nodes[2].addmultisigaddress(2, [addr1Obj['pubkey'], addr2Obj['pubkey'], addr3Obj['pubkey']])
+        mSigObjValid = self.nodes[2].validateaddress(mSigObj)
+        assert_equal(mSigObjValid['isvalid'], True)
+
+        txId       = self.nodes[0].sendtoaddress(mSigObj, 2.2);
+        decTx = self.nodes[0].gettransaction(txId)
+        rawTx = self.nodes[0].decoderawtransaction(decTx['hex'])
+        sPK = rawTx['vout'][0]['scriptPubKey']['hex']
+        [sPK] # hush pyflakes
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # THIS IS A INCOMPLETE FEATURE
+        # NODE2 HAS TWO OF THREE KEY AND THE FUNDS SHOULD BE SPENDABLE AND COUNT AT BALANCE CALCULATION
+        assert_equal(self.nodes[2].getbalance(), bal) # for now, assume the funds of a 2of3 multisig tx are not marked as spendable
+
+        txDetails = self.nodes[0].gettransaction(txId, True)
+        rawTx = self.nodes[0].decoderawtransaction(txDetails['hex'])
+        vout = False
+        for outpoint in rawTx['vout']:
+            if outpoint['value'] == Decimal('2.20000000'):
+                vout = outpoint
+                break;
+
+        bal = self.nodes[0].getbalance()
+        inputs = [{ "txid" : txId, "vout" : vout['n'], "scriptPubKey" : vout['scriptPubKey']['hex'], "amount" : vout['value']}]
+        outputs = { self.nodes[0].getnewaddress() : 2.199 }
+        rawTx = self.nodes[2].createrawtransaction(inputs, outputs)
+        rawTxPartialSigned = self.nodes[1].signrawtransaction(rawTx, inputs)
+        assert_equal(rawTxPartialSigned['complete'], False) # node1 only has one key, can't comp. sign the tx
+
+        rawTxSigned = self.nodes[2].signrawtransaction(rawTx, inputs)
+        assert_equal(rawTxSigned['complete'], True) # node2 can sign the tx compl., own two of three keys
+        self.nodes[2].sendrawtransaction(rawTxSigned['hex'])
+        rawTx = self.nodes[0].decoderawtransaction(rawTxSigned['hex'])
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+        assert_equal(self.nodes[0].getbalance(), bal+Decimal('10.00000000')+Decimal('2.19900000')) #block reward + tx
+
+        inputs  = [ {'txid' : "1d1d4e24ed99057e84c3f80fd8fbec79ed9e1acee37da269356ecea000000000", 'vout' : 1, 'sequence' : 1000}]
+        outputs = { self.nodes[0].getnewaddress() : 1 }
+        rawtx   = self.nodes[0].createrawtransaction(inputs, outputs)
+        decrawtx= self.nodes[0].decoderawtransaction(rawtx)
+        assert_equal(decrawtx['vin'][0]['sequence'], 1000)
+
+if __name__ == '__main__':
+    RawTransactionsTest().main()
diff --git a/depend/zcash/qa/rpc-tests/receivedby.py b/depend/zcash/qa/rpc-tests/receivedby.py
new file mode 100755
index 000000000..e124b0fde
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/receivedby.py
@@ -0,0 +1,174 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+# Exercise the listreceivedbyaddress API
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal
+
+from decimal import Decimal
+
+def get_sub_array_from_array(object_array, to_match):
+    '''
+    Finds and returns a sub array from an array of arrays.
+    to_match should be a unique idetifier of a sub array
+    '''
+    for item in object_array:
+        all_match = True
+        for key,value in to_match.items():
+            if item[key] != value:
+                all_match = False
+        if not all_match:
+            continue
+        return item
+    return []
+
+def check_array_result(object_array, to_match, expected, should_not_find = False):
+    '''
+    Pass in array of JSON objects, a dictionary with key/value pairs
+    to match against, and another dictionary with expected key/value
+    pairs.
+    If the should_not_find flag is true, to_match should not be found in object_array
+    '''
+    if should_not_find == True:
+        expected = { }
+    num_matched = 0
+    for item in object_array:
+        all_match = True
+        for key,value in to_match.items():
+            if item[key] != value:
+                all_match = False
+        if not all_match:
+            continue
+        for key,value in expected.items():
+            if item[key] != value:
+                raise AssertionError("%s : expected %s=%s"%(str(item), str(key), str(value)))
+            num_matched = num_matched+1
+    if num_matched == 0 and should_not_find != True:
+        raise AssertionError("No objects matched %s"%(str(to_match)))
+    if num_matched > 0 and should_not_find == True:
+        raise AssertionError("Objects was matched %s"%(str(to_match)))
+
+class ReceivedByTest(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 4
+        self.setup_clean_chain = False
+
+    def run_test(self):
+        '''
+        listreceivedbyaddress Test
+        '''
+        # Send from node 0 to 1
+        addr = self.nodes[1].getnewaddress()
+        txid = self.nodes[0].sendtoaddress(addr, 0.1)
+        self.sync_all()
+
+        # Check not listed in listreceivedbyaddress because has 0 confirmations
+        check_array_result(self.nodes[1].listreceivedbyaddress(),
+                           {"address":addr},
+                           { },
+                           True)
+        # Bury Tx under 10 block so it will be returned by listreceivedbyaddress
+        self.nodes[1].generate(10)
+        self.sync_all()
+        check_array_result(self.nodes[1].listreceivedbyaddress(),
+                           {"address":addr},
+                           {"address":addr, "account":"", "amount":Decimal("0.1"), "amountZat":10000000, "confirmations":10, "txids":[txid,]})
+        # With min confidence < 10
+        check_array_result(self.nodes[1].listreceivedbyaddress(5),
+                           {"address":addr},
+                           {"address":addr, "account":"", "amount":Decimal("0.1"), "amountZat":10000000, "confirmations":10, "txids":[txid,]})
+        # With min confidence > 10, should not find Tx
+        check_array_result(self.nodes[1].listreceivedbyaddress(11),{"address":addr},{ },True)
+
+        # Empty Tx
+        addr = self.nodes[1].getnewaddress()
+        check_array_result(self.nodes[1].listreceivedbyaddress(0,True),
+                           {"address":addr},
+                           {"address":addr, "account":"", "amount":0, "confirmations":0, "amountZat":0, "txids":[]})
+
+        '''
+        getreceivedbyaddress Test
+        '''
+        # Send from node 0 to 1
+        addr = self.nodes[1].getnewaddress()
+        txid = self.nodes[0].sendtoaddress(addr, 0.1)
+        self.sync_all()
+
+        # Check balance is 0 because of 0 confirmations
+        balance = self.nodes[1].getreceivedbyaddress(addr)
+        assert_equal(balance, Decimal("0.0"), "Wrong balance returned by getreceivedbyaddress, %0.2f"%(balance))
+
+
+        # Check balance is 0.1
+        balance = self.nodes[1].getreceivedbyaddress(addr,0)
+        assert_equal(balance, Decimal("0.1"), "Wrong balance returned by getreceivedbyaddress, %0.2f"%(balance))
+
+        # Bury Tx under 10 block so it will be returned by the default getreceivedbyaddress
+        self.nodes[1].generate(10)
+        self.sync_all()
+        balance = self.nodes[1].getreceivedbyaddress(addr)
+        assert_equal(balance, Decimal("0.1"), "Wrong balance returned by getreceivedbyaddress, %0.2f"%(balance))
+
+        # Get balance as integer
+        balance = self.nodes[1].getreceivedbyaddress(addr, 1, True)
+        assert_equal(balance, 10000000, "Wrong balance returned by getreceivedbyaddress, %i"%(balance))
+
+        '''
+        listreceivedbyaccount + getreceivedbyaccount Test
+        '''
+        # set pre-state
+        addrArr = self.nodes[1].getnewaddress()
+        account = self.nodes[1].getaccount(addrArr)
+        received_by_account_json = get_sub_array_from_array(self.nodes[1].listreceivedbyaccount(),{"account":account})
+
+        if len(received_by_account_json) == 0:
+            raise AssertionError("No accounts found in node")
+        balance_by_account = self.nodes[1].getreceivedbyaccount(account)
+
+        txid = self.nodes[0].sendtoaddress(addr, 0.1)
+        self.sync_all()
+
+        # listreceivedbyaccount should return received_by_account_json because of 0 confirmations
+        check_array_result(self.nodes[1].listreceivedbyaccount(),
+                           {"account":account},
+                           received_by_account_json)
+
+        # getreceivedbyaccount should return same balance because of 0 confirmations
+        balance = self.nodes[1].getreceivedbyaccount(account)
+        assert_equal(balance, balance_by_account, "Wrong balance returned by getreceivedbyaccount, %0.2f"%(balance))
+
+        self.nodes[1].generate(10)
+        self.sync_all()
+        # listreceivedbyaccount should return updated account balance
+        check_array_result(self.nodes[1].listreceivedbyaccount(),
+                           {"account":account},
+                           {"account":received_by_account_json["account"], "amount":(received_by_account_json["amount"] + Decimal("0.1")), "amountZat":30000000})
+
+        # getreceivedbyaccount should return updates balance
+        balance = self.nodes[1].getreceivedbyaccount(account)
+        assert_equal(balance, balance_by_account + Decimal("0.1"), "Wrong balance returned by getreceivedbyaccount, %0.2f"%(balance))
+
+        # Get balance as integer
+        balance = self.nodes[1].getreceivedbyaccount(account, 1, True)
+        assert_equal(balance, 30000000, "Wrong balance returned by getreceivedbyaccount, %i"%(balance))
+
+        # Create a new account named "mynewaccount" that has a 0 balance
+        self.nodes[1].getaccountaddress("mynewaccount")
+        received_by_account_json = get_sub_array_from_array(self.nodes[1].listreceivedbyaccount(0,True),{"account":"mynewaccount"})
+        if len(received_by_account_json) == 0:
+            raise AssertionError("No accounts found in node")
+
+        # Test listreceivedbyaccount for 0 amount accounts
+        assert_equal(received_by_account_json["amount"], Decimal("0.0"), "Wrong balance returned by listreceivedbyaccount, %0.2f"%(received_by_account_json["amount"]))
+
+        # Test getreceivedbyaccount for 0 amount accounts
+        balance = self.nodes[1].getreceivedbyaccount("mynewaccount")
+        assert_equal(balance, Decimal("0.0"), "Wrong balance returned by getreceivedbyaccount, %0.2f"%(balance))
+
+if __name__ == '__main__':
+    ReceivedByTest().main()
diff --git a/depend/zcash/qa/rpc-tests/regtest_signrawtransaction.py b/depend/zcash/qa/rpc-tests/regtest_signrawtransaction.py
new file mode 100755
index 000000000..f2b1f0429
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/regtest_signrawtransaction.py
@@ -0,0 +1,27 @@
+#!/usr/bin/env python3
+# Copyright (c) 2018 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import wait_and_assert_operationid_status
+
+class RegtestSignrawtransactionTest (BitcoinTestFramework):
+
+    def run_test(self):
+        self.nodes[0].generate(1)
+        self.sync_all()
+        taddr = self.nodes[1].getnewaddress()
+        zaddr1 = self.nodes[1].z_getnewaddress()
+
+        self.nodes[0].sendtoaddress(taddr, 2.0)
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # Create and sign Sapling transaction.
+        # If the incorrect consensus branch id is selected, there will be a signing error. 
+        opid = self.nodes[1].z_sendmany(taddr, [{'address': zaddr1, 'amount': 1}], 1)
+        wait_and_assert_operationid_status(self.nodes[1], opid)
+
+if __name__ == '__main__':
+    RegtestSignrawtransactionTest().main()
diff --git a/depend/zcash/qa/rpc-tests/reindex.py b/depend/zcash/qa/rpc-tests/reindex.py
new file mode 100755
index 000000000..66e96a854
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/reindex.py
@@ -0,0 +1,45 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Test -reindex and -reindex-chainstate with CheckBlockIndex
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, \
+    start_node, stop_node, wait_bitcoinds
+import time
+
+class ReindexTest(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.setup_clean_chain = True
+        self.num_nodes = 1
+
+    def setup_network(self):
+        self.nodes = []
+        self.is_network_split = False
+        self.nodes.append(start_node(0, self.options.tmpdir))
+
+    def reindex(self, justchainstate=False):
+        self.nodes[0].generate(3)
+        blockcount = self.nodes[0].getblockcount()
+        stop_node(self.nodes[0], 0)
+        wait_bitcoinds()
+        self.nodes[0]=start_node(0, self.options.tmpdir, ["-debug", "-reindex-chainstate" if justchainstate else "-reindex", "-checkblockindex=1"])
+        while self.nodes[0].getblockcount() < blockcount:
+            time.sleep(0.1)
+        assert_equal(self.nodes[0].getblockcount(), blockcount)
+        print("Success")
+
+    def run_test(self):
+        self.reindex(False)
+        self.reindex(True)
+        self.reindex(False)
+        self.reindex(True)
+
+if __name__ == '__main__':
+    ReindexTest().main()
diff --git a/depend/zcash/qa/rpc-tests/remove_sprout_shielding.py b/depend/zcash/qa/rpc-tests/remove_sprout_shielding.py
new file mode 100755
index 000000000..d5d001700
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/remove_sprout_shielding.py
@@ -0,0 +1,139 @@
+#!/usr/bin/env python3
+# Copyright (c) 2020 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from decimal import Decimal
+from test_framework.authproxy import JSONRPCException
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    assert_equal,
+    assert_raises_message,
+    start_nodes, get_coinbase_address,
+    wait_and_assert_operationid_status,
+    nuparams,
+    BLOSSOM_BRANCH_ID,
+    HEARTWOOD_BRANCH_ID,
+    CANOPY_BRANCH_ID,
+    NU5_BRANCH_ID,
+)
+
+import logging
+
+HAS_CANOPY = [
+    '-nurejectoldversions=false', 
+    '-anchorconfirmations=1',
+    nuparams(BLOSSOM_BRANCH_ID, 205),
+    nuparams(HEARTWOOD_BRANCH_ID, 210),
+    nuparams(CANOPY_BRANCH_ID, 220),
+    nuparams(NU5_BRANCH_ID, 225),
+]
+
+class RemoveSproutShieldingTest (BitcoinTestFramework):
+
+    def setup_nodes(self):
+        return start_nodes(self.num_nodes, self.options.tmpdir, extra_args=[HAS_CANOPY] * self.num_nodes)
+
+    def run_test (self):
+
+        # Generate blocks up to Heartwood activation
+        logging.info("Generating initial blocks. Current height is 200, advance to 210 (activate Heartwood but not Canopy)")
+        self.nodes[0].generate(10)
+        self.sync_all()
+
+        # Shield coinbase to Sprout on node 0. Should pass
+        sprout_addr = self.nodes[0].z_getnewaddress('sprout')
+        sprout_addr_node2 = self.nodes[2].z_getnewaddress('sprout')
+        myopid = self.nodes[0].z_shieldcoinbase(get_coinbase_address(self.nodes[0]), sprout_addr, 0)['opid']
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+        print("taddr -> Sprout z_shieldcoinbase tx accepted before Canopy on node 0")
+
+        self.nodes[0].generate(1)
+        self.sync_all()
+        assert_equal(self.nodes[0].z_getbalance(sprout_addr), Decimal('10'))
+
+        # Fund taddr_0 from shielded coinbase on node 0
+        taddr_0 = self.nodes[0].getnewaddress()
+        for _ in range(3):
+            recipients = [{"address": taddr_0, "amount": Decimal('1')}]
+            myopid = self.nodes[0].z_sendmany(sprout_addr, recipients, 1, 0)
+            wait_and_assert_operationid_status(self.nodes[0], myopid)
+            self.sync_all()
+            self.nodes[0].generate(1)
+            self.sync_all()
+
+        # Create mergetoaddress taddr -> Sprout transaction and mine on node 0 before it is Canopy-aware. Should pass
+        merge_tx_0 = self.nodes[0].z_mergetoaddress(["ANY_TADDR"], self.nodes[1].z_getnewaddress('sprout'))
+        wait_and_assert_operationid_status(self.nodes[0], merge_tx_0['opid'])
+        print("taddr -> Sprout z_mergetoaddress tx accepted before Canopy on node 0")
+
+        # Mine to one block before Canopy activation on node 0; adding value
+        # to the Sprout pool will fail now since the transaction must be
+        # included in the next (or later) block, after Canopy has activated.
+        self.nodes[0].generate(5)
+        self.sync_all()
+        assert_equal(self.nodes[0].getblockchaininfo()['upgrades']['e9ff75a6']['status'], 'pending')
+
+        # Shield coinbase to Sprout on node 0. Should fail
+        sprout_addr = self.nodes[0].z_getnewaddress('sprout')
+        assert_raises_message(
+            JSONRPCException,
+            "Sprout shielding is not supported after Canopy",
+            self.nodes[0].z_shieldcoinbase,
+            get_coinbase_address(self.nodes[0]), sprout_addr, 0)
+        print("taddr -> Sprout z_shieldcoinbase tx rejected at Canopy activation on node 0")
+
+        # Create taddr -> Sprout z_sendmany transaction on node 0. Should fail
+        sprout_addr = self.nodes[1].z_getnewaddress('sprout')
+        assert_raises_message(
+            JSONRPCException,
+            "Sending funds into the Sprout value pool is not supported by z_sendmany",
+            self.nodes[0].z_sendmany,
+            taddr_0, [{"address": sprout_addr, "amount": 1}])
+        print("taddr -> Sprout z_sendmany tx rejected at Canopy activation on node 0")
+
+        # Create z_mergetoaddress [taddr, Sprout] -> Sprout transaction on node 0. Should fail
+        assert_raises_message(
+            JSONRPCException,
+            "Sprout shielding is not supported after Canopy",
+            self.nodes[0].z_mergetoaddress,
+            ["ANY_TADDR", "ANY_SPROUT"], self.nodes[1].z_getnewaddress('sprout'))
+        print("[taddr, Sprout] -> Sprout z_mergetoaddress tx rejected at Canopy activation on node 0")
+
+        # Create z_mergetoaddress Sprout -> Sprout transaction on node 0. Should pass
+        merge_tx_1 = self.nodes[0].z_mergetoaddress(["ANY_SPROUT"], self.nodes[1].z_getnewaddress('sprout'))
+        wait_and_assert_operationid_status(self.nodes[0], merge_tx_1['opid'])
+        print("Sprout -> Sprout z_mergetoaddress tx accepted at Canopy activation on node 0")
+
+        # Activate Canopy
+        self.nodes[0].generate(1)
+        self.sync_all()
+        assert_equal(self.nodes[0].getblockchaininfo()['upgrades']['e9ff75a6']['status'], 'active')
+
+        # Generating a Sprout address should fail after Canopy.
+        assert_raises_message(
+            JSONRPCException,
+            "Invalid address type, \"sprout\" is not allowed after Canopy",
+            self.nodes[0].z_getnewaddress, 'sprout')
+        print("Sprout z_getnewaddress rejected at Canopy activation on node 0")
+
+        # Shield coinbase to Sapling on node 0. Should pass
+        sapling_addr = self.nodes[0].z_getnewaddress('sapling')
+        myopid = self.nodes[0].z_shieldcoinbase(get_coinbase_address(self.nodes[0]), sapling_addr, 0)['opid']
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+        print("taddr -> Sapling z_shieldcoinbase tx accepted after Canopy on node 0")
+
+        # Mine to one block before NU5 activation.
+        self.nodes[0].generate(4)
+        self.sync_all()
+
+        # Create z_mergetoaddress Sprout -> Sprout transaction on node 1. Should pass
+        merge_tx_2 = self.nodes[1].z_mergetoaddress(["ANY_SPROUT"], sprout_addr_node2)
+        wait_and_assert_operationid_status(self.nodes[1], merge_tx_2['opid'])
+        print("Sprout -> Sprout z_mergetoaddress tx accepted at NU5 activation on node 1")
+
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+if __name__ == '__main__':
+    RemoveSproutShieldingTest().main()
diff --git a/depend/zcash/qa/rpc-tests/reorg_limit.py b/depend/zcash/qa/rpc-tests/reorg_limit.py
new file mode 100755
index 000000000..47286db13
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/reorg_limit.py
@@ -0,0 +1,107 @@
+#!/usr/bin/env python3
+# Copyright (c) 2017 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Test reorg limit
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    check_node,
+    connect_nodes_bi,
+    start_node,
+    sync_blocks,
+)
+
+import tempfile
+from time import sleep
+
+def check_stopped(i, timeout=10):
+    stopped = False
+    for x in range(1, timeout):
+        ret = check_node(i)
+        if ret is None:
+            sleep(1)
+        else:
+            stopped = True
+            break
+    return stopped
+
+class ReorgLimitTest(BitcoinTestFramework):
+
+    def setup_nodes(self):
+        self.log_stderr = tempfile.SpooledTemporaryFile(max_size=2**16)
+
+        nodes = []
+        nodes.append(start_node(0, self.options.tmpdir, stderr=self.log_stderr))
+        nodes.append(start_node(1, self.options.tmpdir))
+        nodes.append(start_node(2, self.options.tmpdir))
+        nodes.append(start_node(3, self.options.tmpdir))
+
+        return nodes
+
+    def run_test(self):
+        assert(self.nodes[0].getblockcount() == 200)
+        assert(self.nodes[2].getblockcount() == 200)
+
+        self.split_network()
+
+        print("Test the maximum-allowed reorg:")
+        print("Mine 99 blocks on Node 0")
+        self.nodes[0].generate(99)
+        assert(self.nodes[0].getblockcount() == 299)
+        assert(self.nodes[2].getblockcount() == 200)
+
+        print("Mine competing 100 blocks on Node 2")
+        self.nodes[2].generate(100)
+        assert(self.nodes[0].getblockcount() == 299)
+        assert(self.nodes[2].getblockcount() == 300)
+
+        print("Connect nodes to force a reorg")
+        connect_nodes_bi(self.nodes, 0, 2)
+        self.is_network_split = False
+        sync_blocks(self.nodes)
+
+        print("Check Node 0 is still running and on the correct chain")
+        assert(self.nodes[0].getblockcount() == 300)
+
+        self.split_network()
+
+        print("Test the minimum-rejected reorg:")
+        print("Mine 100 blocks on Node 0")
+        self.nodes[0].generate(100)
+        assert(self.nodes[0].getblockcount() == 400)
+        assert(self.nodes[2].getblockcount() == 300)
+
+        print("Mine competing 101 blocks on Node 2")
+        self.nodes[2].generate(101)
+        assert(self.nodes[0].getblockcount() == 400)
+        assert(self.nodes[2].getblockcount() == 401)
+
+        try:
+            print("Sync nodes to force a reorg")
+            connect_nodes_bi(self.nodes, 0, 2)
+            self.is_network_split = False
+            # sync_blocks uses RPC calls to wait for nodes to be synced, so don't
+            # call it here, because it will have a non-specific connection error
+            # when Node 0 stops. Instead, we explicitly check for the process itself
+            # to stop.
+
+            print("Check Node 0 is no longer running")
+            assert(check_stopped(0))
+
+            # Check that node 0 stopped for the expected reason.
+            self.log_stderr.seek(0)
+            stderr = self.log_stderr.read().decode('utf-8')
+            expected_msg = "A block chain reorganization has been detected that would roll back 100 blocks!"
+            if expected_msg not in stderr:
+                raise AssertionError("Expected error \"" + expected_msg + "\" not found in:\n" + stderr)
+        finally:
+            self.log_stderr.close()
+            # Dummy stop to enable the test to tear down
+            self.nodes[0].stop = lambda: True
+
+if __name__ == '__main__':
+    ReorgLimitTest().main()
diff --git a/depend/zcash/qa/rpc-tests/rest.py b/depend/zcash/qa/rpc-tests/rest.py
new file mode 100755
index 000000000..1cf49c60c
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/rest.py
@@ -0,0 +1,347 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Test REST interface
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, assert_greater_than, \
+    hex_str_to_bytes, start_nodes, connect_nodes_bi
+
+import struct
+import json
+from io import BytesIO
+from codecs import encode
+from decimal import Decimal
+
+import http.client
+import urllib.parse
+
+def deser_uint256(f):
+    r = 0
+    for i in range(8):
+        t = struct.unpack(b"<I", f.read(4))[0]
+        r += t << (i * 32)
+    return r
+
+# allows simple http get calls
+def http_get_call(host, port, path, response_object = 0):
+    conn = http.client.HTTPConnection(host, port)
+    conn.request('GET', path)
+
+    if response_object:
+        return conn.getresponse()
+
+    return conn.getresponse().read().decode('utf-8')
+
+# allows simple http post calls with a request body
+def http_post_call(host, port, path, requestdata = '', response_object = 0):
+    conn = http.client.HTTPConnection(host, port)
+    conn.request('POST', path, requestdata)
+
+    if response_object:
+        return conn.getresponse()
+
+    return conn.getresponse().read()
+
+class RESTTest (BitcoinTestFramework):
+    FORMAT_SEPARATOR = "."
+
+    def __init__(self):
+        super().__init__()
+        self.setup_clean_chain = True
+        self.num_nodes = 3
+
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir)
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,0,2)
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test(self):
+        url = urllib.parse.urlparse(self.nodes[0].url)
+        print("Mining blocks...")
+
+        self.nodes[0].generate(1)
+        self.sync_all()
+        self.nodes[2].generate(100)
+        self.sync_all()
+
+        assert_equal(self.nodes[0].getbalance(), 10)
+
+        txid = self.nodes[0].sendtoaddress(self.nodes[1].getnewaddress(), 0.1)
+        self.sync_all()
+        self.nodes[2].generate(1)
+        self.sync_all()
+        bb_hash = self.nodes[0].getbestblockhash()
+
+        assert_equal(self.nodes[1].getbalance(), Decimal("0.1")) # balance now should be 0.1 on node 1
+
+        # load the latest 0.1 tx over the REST API
+        json_string = http_get_call(url.hostname, url.port, '/rest/tx/'+txid+self.FORMAT_SEPARATOR+"json")
+        json_obj = json.loads(json_string)
+        vintx = json_obj['vin'][0]['txid'] # get the vin to later check for utxo (should be spent by then)
+        # get n of 0.1 outpoint
+        n = 0
+        for vout in json_obj['vout']:
+            if vout['value'] == 0.1:
+                n = vout['n']
+
+
+        #######################################
+        # GETUTXOS: query an unspent outpoint #
+        #######################################
+        json_request = '/checkmempool/'+txid+'-'+str(n)
+        json_string = http_get_call(url.hostname, url.port, '/rest/getutxos'+json_request+self.FORMAT_SEPARATOR+'json')
+        json_obj = json.loads(json_string)
+
+        #check chainTip response
+        assert_equal(json_obj['chaintipHash'], bb_hash)
+
+        #make sure there is one utxo
+        assert_equal(len(json_obj['utxos']), 1)
+        assert_equal(json_obj['utxos'][0]['value'], 0.1)
+
+
+        #################################################
+        # GETUTXOS: now query an already spent outpoint #
+        #################################################
+        json_request = '/checkmempool/'+vintx+'-0'
+        json_string = http_get_call(url.hostname, url.port, '/rest/getutxos'+json_request+self.FORMAT_SEPARATOR+'json')
+        json_obj = json.loads(json_string)
+
+        # check chainTip response
+        assert_equal(json_obj['chaintipHash'], bb_hash)
+
+        # make sure there is no utox in the response because this oupoint has been spent
+        assert_equal(len(json_obj['utxos']), 0)
+
+        # check bitmap
+        assert_equal(json_obj['bitmap'], "0")
+
+
+        ##################################################
+        # GETUTXOS: now check both with the same request #
+        ##################################################
+        json_request = '/checkmempool/'+txid+'-'+str(n)+'/'+vintx+'-0'
+        json_string = http_get_call(url.hostname, url.port, '/rest/getutxos'+json_request+self.FORMAT_SEPARATOR+'json')
+        json_obj = json.loads(json_string)
+        assert_equal(len(json_obj['utxos']), 1)
+        assert_equal(json_obj['bitmap'], "10")
+
+        # test binary response
+        bb_hash = self.nodes[0].getbestblockhash()
+
+        binaryRequest = b'\x01\x02'
+        binaryRequest += hex_str_to_bytes(txid)
+        binaryRequest += struct.pack("i", n);
+        binaryRequest += hex_str_to_bytes(vintx);
+        binaryRequest += struct.pack("i", 0);
+
+        bin_response = http_post_call(url.hostname, url.port, '/rest/getutxos'+self.FORMAT_SEPARATOR+'bin', binaryRequest)
+        output = BytesIO()
+        output.write(bin_response)
+        output.seek(0)
+        chainHeight = struct.unpack("i", output.read(4))[0]
+        hashFromBinResponse = hex(deser_uint256(output))[2:].zfill(64)
+
+        assert_equal(bb_hash, hashFromBinResponse) # check if getutxo's chaintip during calculation was fine
+        assert_equal(chainHeight, 102) # chain height must be 102
+
+
+        ############################
+        # GETUTXOS: mempool checks #
+        ############################
+
+        # do a tx and don't sync
+        txid = self.nodes[0].sendtoaddress(self.nodes[1].getnewaddress(), 0.1)
+        json_string = http_get_call(url.hostname, url.port, '/rest/tx/'+txid+self.FORMAT_SEPARATOR+"json")
+        json_obj = json.loads(json_string)
+        vintx = json_obj['vin'][0]['txid'] # get the vin to later check for utxo (should be spent by then)
+        # get n of 0.1 outpoint
+        n = 0
+        for vout in json_obj['vout']:
+            if vout['value'] == 0.1:
+                n = vout['n']
+
+        json_request = '/'+txid+'-'+str(n)
+        json_string = http_get_call(url.hostname, url.port, '/rest/getutxos'+json_request+self.FORMAT_SEPARATOR+'json')
+        json_obj = json.loads(json_string)
+        assert_equal(len(json_obj['utxos']), 0) # there should be an outpoint because it has just added to the mempool
+
+        json_request = '/checkmempool/'+txid+'-'+str(n)
+        json_string = http_get_call(url.hostname, url.port, '/rest/getutxos'+json_request+self.FORMAT_SEPARATOR+'json')
+        json_obj = json.loads(json_string)
+        assert_equal(len(json_obj['utxos']), 1) # there should be an outpoint because it has just added to the mempool
+
+        # do some invalid requests
+        json_request = '{"checkmempool'
+        response = http_post_call(url.hostname, url.port, '/rest/getutxos'+self.FORMAT_SEPARATOR+'json', json_request, True)
+        assert_equal(response.status, 500) # must be a 500 because we send an invalid json request
+
+        json_request = '{"checkmempool'
+        response = http_post_call(url.hostname, url.port, '/rest/getutxos'+self.FORMAT_SEPARATOR+'bin', json_request, True)
+        assert_equal(response.status, 500) # must be a 500 because we send an invalid bin request
+
+        response = http_post_call(url.hostname, url.port, '/rest/getutxos/checkmempool'+self.FORMAT_SEPARATOR+'bin', '', True)
+        assert_equal(response.status, 500) # must be a 500 because we send an invalid bin request
+
+        # test limits
+        json_request = '/checkmempool/'
+        for x in range(0, 20):
+            json_request += txid+'-'+str(n)+'/'
+        json_request = json_request.rstrip("/")
+        response = http_post_call(url.hostname, url.port, '/rest/getutxos'+json_request+self.FORMAT_SEPARATOR+'json', '', True)
+        assert_equal(response.status, 500) # must be a 500 because we exceeding the limits
+
+        json_request = '/checkmempool/'
+        for x in range(0, 15):
+            json_request += txid+'-'+str(n)+'/'
+        json_request = json_request.rstrip("/");
+        response = http_post_call(url.hostname, url.port, '/rest/getutxos'+json_request+self.FORMAT_SEPARATOR+'json', '', True)
+        assert_equal(response.status, 200) # must be a 500 because we exceeding the limits
+
+        self.nodes[0].generate(1) # generate block to not affect upcoming tests
+        self.sync_all()
+
+        ################
+        # /rest/block/ #
+        ################
+
+        # Block header length of 177 is:
+        # - 108 bytes: regular fields
+        # -  32 bytes: nonce
+        # -  37 bytes: Equihash solution:
+        #              - 1 byte length
+        #              - 2^k ((n/(k+1))+1)-bit indices.
+        #                For regtest parameters (n = 48, k = 5),
+        #                this is 32 9-bit indices
+
+        # check binary format
+        response = http_get_call(url.hostname, url.port, '/rest/block/'+bb_hash+self.FORMAT_SEPARATOR+"bin", True)
+        assert_equal(response.status, 200)
+        assert_greater_than(int(response.getheader('content-length')), 177)
+        response_str = response.read()
+
+        # compare with block header
+        response_header = http_get_call(url.hostname, url.port, '/rest/headers/1/'+bb_hash+self.FORMAT_SEPARATOR+"bin", True)
+        assert_equal(response_header.status, 200)
+        assert_equal(int(response_header.getheader('content-length')), 177)
+        response_header_str = response_header.read()
+        assert_equal(response_str[0:177], response_header_str)
+
+        # check block hex format
+        response_hex = http_get_call(url.hostname, url.port, '/rest/block/'+bb_hash+self.FORMAT_SEPARATOR+"hex", True)
+        assert_equal(response_hex.status, 200)
+        assert_greater_than(int(response_hex.getheader('content-length')), 354)
+        response_hex_str = response_hex.read()
+        assert_equal(encode(response_str, "hex_codec")[0:354], response_hex_str[0:354])
+
+        # compare with hex block header
+        response_header_hex = http_get_call(url.hostname, url.port, '/rest/headers/1/'+bb_hash+self.FORMAT_SEPARATOR+"hex", True)
+        assert_equal(response_header_hex.status, 200)
+        assert_greater_than(int(response_header_hex.getheader('content-length')), 354)
+        response_header_hex_str = response_header_hex.read()
+        assert_equal(response_hex_str[0:354], response_header_hex_str[0:354])
+        assert_equal(encode(response_header_str, "hex_codec")[0:354], response_header_hex_str[0:354])
+
+        # check json format
+        block_json_string = http_get_call(url.hostname, url.port, '/rest/block/'+bb_hash+self.FORMAT_SEPARATOR+'json')
+        block_json_obj = json.loads(block_json_string)
+        assert_equal(block_json_obj['hash'], bb_hash)
+
+        # compare with json block header
+        response_header_json = http_get_call(url.hostname, url.port, '/rest/headers/1/'+bb_hash+self.FORMAT_SEPARATOR+"json", True)
+        assert_equal(response_header_json.status, 200)
+        response_header_json_str = response_header_json.read().decode('utf-8')
+        json_obj = json.loads(response_header_json_str, parse_float=Decimal)
+        assert_equal(len(json_obj), 1) # ensure that there is one header in the json response
+        assert_equal(json_obj[0]['hash'], bb_hash) # request/response hash should be the same
+
+        # compare with normal RPC block response
+        rpc_block_json = self.nodes[0].getblock(bb_hash)
+        assert_equal(json_obj[0]['hash'],               rpc_block_json['hash'])
+        assert_equal(json_obj[0]['confirmations'],      rpc_block_json['confirmations'])
+        assert_equal(json_obj[0]['height'],             rpc_block_json['height'])
+        assert_equal(json_obj[0]['version'],            rpc_block_json['version'])
+        assert_equal(json_obj[0]['merkleroot'],         rpc_block_json['merkleroot'])
+        assert_equal(json_obj[0]['time'],               rpc_block_json['time'])
+        assert_equal(json_obj[0]['nonce'],              rpc_block_json['nonce'])
+        assert_equal(json_obj[0]['bits'],               rpc_block_json['bits'])
+        assert_equal(json_obj[0]['difficulty'],         rpc_block_json['difficulty'])
+        assert_equal(json_obj[0]['chainwork'],          rpc_block_json['chainwork'])
+        assert_equal(json_obj[0]['previousblockhash'],  rpc_block_json['previousblockhash'])
+
+        # see if we can get 5 headers in one response
+        self.nodes[1].generate(5)
+        self.sync_all()
+        response_header_json = http_get_call(url.hostname, url.port, '/rest/headers/5/'+bb_hash+self.FORMAT_SEPARATOR+"json", True)
+        assert_equal(response_header_json.status, 200)
+        response_header_json_str = response_header_json.read().decode('utf-8')
+        json_obj = json.loads(response_header_json_str)
+        assert_equal(len(json_obj), 5) # now we should have 5 header objects
+
+        # do tx test
+        tx_hash = block_json_obj['tx'][0]['txid'];
+        json_string = http_get_call(url.hostname, url.port, '/rest/tx/'+tx_hash+self.FORMAT_SEPARATOR+"json")
+        json_obj = json.loads(json_string)
+        assert_equal(json_obj['txid'], tx_hash)
+
+        # check hex format response
+        hex_string = http_get_call(url.hostname, url.port, '/rest/tx/'+tx_hash+self.FORMAT_SEPARATOR+"hex", True)
+        assert_equal(hex_string.status, 200)
+        assert_greater_than(int(response.getheader('content-length')), 10)
+
+
+        # check block tx details
+        # let's make 3 tx and mine them on node 1
+        txs = []
+        txs.append(self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(), 1))
+        txs.append(self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(), 1))
+        txs.append(self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(), 1))
+        self.sync_all()
+
+        # check that there are exactly 3 transactions in the TX memory pool before generating the block
+        json_string = http_get_call(url.hostname, url.port, '/rest/mempool/info'+self.FORMAT_SEPARATOR+'json')
+        json_obj = json.loads(json_string)
+        assert_equal(json_obj['size'], 3)
+        # the size of the memory pool should be greater than 3x ~100 bytes
+        assert_greater_than(json_obj['bytes'], 300)
+
+        # check that there are our submitted transactions in the TX memory pool
+        json_string = http_get_call(url.hostname, url.port, '/rest/mempool/contents'+self.FORMAT_SEPARATOR+'json')
+        json_obj = json.loads(json_string)
+        for tx in txs:
+            assert_equal(tx in json_obj, True)
+
+        # now mine the transactions
+        newblockhash = self.nodes[1].generate(1)
+        self.sync_all()
+
+        # check if the 3 tx show up in the new block
+        json_string = http_get_call(url.hostname, url.port, '/rest/block/'+newblockhash[0]+self.FORMAT_SEPARATOR+'json')
+        json_obj = json.loads(json_string)
+        for tx in json_obj['tx']:
+            if not 'coinbase' in tx['vin'][0]: # exclude coinbase
+                assert_equal(tx['txid'] in txs, True)
+
+        # check the same but without tx details
+        json_string = http_get_call(url.hostname, url.port, '/rest/block/notxdetails/'+newblockhash[0]+self.FORMAT_SEPARATOR+'json')
+        json_obj = json.loads(json_string)
+        for tx in txs:
+            assert_equal(tx in json_obj['tx'], True)
+
+        # test rest bestblock
+        bb_hash = self.nodes[0].getbestblockhash()
+
+        json_string = http_get_call(url.hostname, url.port, '/rest/chaininfo.json')
+        json_obj = json.loads(json_string)
+        assert_equal(json_obj['bestblockhash'], bb_hash)
+
+if __name__ == '__main__':
+    RESTTest().main()
diff --git a/depend/zcash/qa/rpc-tests/rewind_index.py b/depend/zcash/qa/rpc-tests/rewind_index.py
new file mode 100755
index 000000000..5c0c013c6
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/rewind_index.py
@@ -0,0 +1,93 @@
+#!/usr/bin/env python3
+# Copyright (c) 2018 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, \
+    start_nodes, start_node, connect_nodes_bi, bitcoind_processes, \
+    nuparams, sync_blocks, OVERWINTER_BRANCH_ID, SAPLING_BRANCH_ID
+
+import time
+
+FAKE_SPROUT = [nuparams(OVERWINTER_BRANCH_ID, 210), nuparams(SAPLING_BRANCH_ID, 220)]
+FAKE_OVERWINTER = [nuparams(OVERWINTER_BRANCH_ID, 10), nuparams(SAPLING_BRANCH_ID, 220)]
+
+class RewindBlockIndexTest (BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 3
+        self.setup_clean_chain = True
+
+    def setup_network(self, split=False):
+        # Node 0 - Overwinter, then Sprout, then Overwinter again
+        # Node 1 - Sprout
+        # Node 2 - Overwinter
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir, extra_args=[
+            FAKE_OVERWINTER,
+            FAKE_SPROUT,
+            FAKE_OVERWINTER,
+        ])
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,0,2)
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test (self):
+        # Bring all nodes to just before the activation block
+        print("Mining blocks...")
+        self.nodes[0].generate(8)
+        block9 = self.nodes[0].generate(1)[0]
+        self.sync_all()
+
+        assert_equal(self.nodes[0].getbestblockhash(), block9)
+        assert_equal(self.nodes[1].getbestblockhash(), block9)
+
+        print("Mining diverging blocks")
+        block10s = self.nodes[1].generate(1)[0]
+        block10o = self.nodes[2].generate(1)[0]
+        sync_blocks(self.nodes, allow_different_tips=True)
+
+        assert_equal(self.nodes[0].getbestblockhash(), block10o)
+        assert_equal(self.nodes[1].getbestblockhash(), block10s)
+        assert_equal(self.nodes[2].getbestblockhash(), block10o)
+
+        # Restart node 0 using Sprout instead of Overwinter
+        print("Switching node 0 from Overwinter to Sprout")
+        self.nodes[0].stop()
+        bitcoind_processes[0].wait()
+        self.nodes[0] = start_node(0, self.options.tmpdir, extra_args=FAKE_SPROUT)
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,0,2)
+
+        # Assume node 1 will send block10s to node 0 quickly
+        # (if we used self.sync_all() here and there was a bug, the test would hang)
+        time.sleep(2)
+
+        # Node 0 has rewound and is now on the Sprout chain
+        assert_equal(self.nodes[0].getblockcount(), 10)
+        assert_equal(self.nodes[0].getbestblockhash(), block10s)
+
+        # Restart node 0 using Overwinter instead of Sprout
+        print("Switching node 0 from Sprout to Overwinter")
+        self.nodes[0].stop()
+        bitcoind_processes[0].wait()
+        self.nodes[0] = start_node(0, self.options.tmpdir, extra_args=FAKE_OVERWINTER)
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,0,2)
+
+        # Assume node 2 will send block10o to node 0 quickly
+        # (if we used self.sync_all() here and there was a bug, the test would hang)
+        time.sleep(2)
+
+        # Node 0 has rewound and is now on the Overwinter chain again
+        assert_equal(self.nodes[0].getblockcount(), 10)
+        assert_equal(self.nodes[0].getbestblockhash(), block10o)
+
+
+if __name__ == '__main__':
+    RewindBlockIndexTest().main()
diff --git a/depend/zcash/qa/rpc-tests/rpcbind_test.py b/depend/zcash/qa/rpc-tests/rpcbind_test.py
new file mode 100755
index 000000000..a024cc03b
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/rpcbind_test.py
@@ -0,0 +1,124 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+# Test for -rpcbind, as well as -rpcallowip and -rpcconnect
+
+# Dependency: python-bitcoinrpc
+
+from test_framework.authproxy import JSONRPCException
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    assert_equal,
+    bitcoind_processes,
+    get_rpc_proxy,
+    rpc_port,
+    rpc_url,
+    start_nodes,
+    stop_nodes,
+    wait_bitcoinds,
+)
+from test_framework.netutil import addr_to_hex, get_bind_addrs, all_interfaces
+
+import sys
+
+
+class RPCBindTest(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.setup_clean_chain = True
+        self.num_nodes = 1
+
+    def setup_network(self):
+        pass
+
+    def setup_nodes(self):
+        pass
+
+    def run_bind_test(self, allow_ips, connect_to, addresses, expected):
+        '''
+        Start a node with requested rpcallowip and rpcbind parameters,
+        then try to connect, and check if the set of bound addresses
+        matches the expected set.
+        '''
+        expected = [(addr_to_hex(addr), port) for (addr, port) in expected]
+        base_args = ['-disablewallet', '-nolisten']
+        if allow_ips:
+            base_args += ['-rpcallowip=' + x for x in allow_ips]
+        binds = ['-rpcbind='+addr for addr in addresses]
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir, [base_args + binds], connect_to)
+        try:
+            pid = bitcoind_processes[0].pid
+            assert_equal(set(get_bind_addrs(pid)), set(expected))
+        finally:
+            stop_nodes(self.nodes)
+            wait_bitcoinds()
+
+    def run_allowip_test(self, allow_ips, rpchost, rpcport):
+        '''
+        Start a node with rpcwallow IP, and request getinfo
+        at a non-localhost IP.
+        '''
+        base_args = ['-disablewallet', '-nolisten'] + ['-rpcallowip='+x for x in allow_ips]
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir, [base_args])
+        try:
+            # connect to node through non-loopback interface
+            node = get_rpc_proxy(rpc_url(0, "%s:%d" % (rpchost, rpcport)), 0)
+            node.getinfo()
+        finally:
+            node = None # make sure connection will be garbage collected and closed
+            stop_nodes(self.nodes)
+            wait_bitcoinds()
+
+    def run_test(self):
+        # due to OS-specific network stats queries, this test works only on Linux
+        assert(sys.platform.startswith('linux'))
+        # find the first non-loopback interface for testing
+        non_loopback_ip = None
+        for name,ip in all_interfaces():
+            if ip != '127.0.0.1':
+                non_loopback_ip = ip
+                break
+        if non_loopback_ip is None:
+            assert(not 'This test requires at least one non-loopback IPv4 interface')
+        print("Using interface %s for testing" % non_loopback_ip)
+
+        defaultport = rpc_port(0)
+
+        # check default without rpcallowip (IPv4 and IPv6 localhost)
+        self.run_bind_test(None, '127.0.0.1', [],
+            [('127.0.0.1', defaultport), ('::1', defaultport)])
+        # check default with rpcallowip (IPv6 any)
+        self.run_bind_test(['127.0.0.1'], '127.0.0.1', [],
+            [('::0', defaultport)])
+        # check only IPv4 localhost (explicit)
+        self.run_bind_test(['127.0.0.1'], '127.0.0.1', ['127.0.0.1'],
+            [('127.0.0.1', defaultport)])
+        # check only IPv4 localhost (explicit) with alternative port
+        self.run_bind_test(['127.0.0.1'], '127.0.0.1:32171', ['127.0.0.1:32171'],
+            [('127.0.0.1', 32171)])
+        # check only IPv4 localhost (explicit) with multiple alternative ports on same host
+        self.run_bind_test(['127.0.0.1'], '127.0.0.1:32171', ['127.0.0.1:32171', '127.0.0.1:32172'],
+            [('127.0.0.1', 32171), ('127.0.0.1', 32172)])
+        # check only IPv6 localhost (explicit)
+        self.run_bind_test(['[::1]'], '[::1]', ['[::1]'],
+            [('::1', defaultport)])
+        # check both IPv4 and IPv6 localhost (explicit)
+        self.run_bind_test(['127.0.0.1'], '127.0.0.1', ['127.0.0.1', '[::1]'],
+            [('127.0.0.1', defaultport), ('::1', defaultport)])
+        # check only non-loopback interface
+        self.run_bind_test([non_loopback_ip], non_loopback_ip, [non_loopback_ip],
+            [(non_loopback_ip, defaultport)])
+
+        # Check that with invalid rpcallowip, we are denied
+        self.run_allowip_test([non_loopback_ip], non_loopback_ip, defaultport)
+        try:
+            self.run_allowip_test(['1.1.1.1'], non_loopback_ip, defaultport)
+            assert(not 'Connection not denied by rpcallowip as expected')
+        except JSONRPCException:
+            pass
+
+if __name__ == '__main__':
+    RPCBindTest().main()
diff --git a/depend/zcash/qa/rpc-tests/sapling_rewind_check.py b/depend/zcash/qa/rpc-tests/sapling_rewind_check.py
new file mode 100755
index 000000000..aa156848e
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/sapling_rewind_check.py
@@ -0,0 +1,109 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014 The Bitcoin Core developers
+# Copyright (c) 2020 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+"""
+Exercise the chain rewind code at the Blossom boundary.
+
+Test case is:
+
+3 nodes are initialized, two of which are aware of the Blossom network upgrade,
+and one of which is not. On each node, the chain is advanced to just prior to
+the Blossom activation; height then, the network is split and each branch of
+the network produces blocks into the range of the upgraded protocol.
+
+The node that is not aware of Blossom activation is advanced beyond the maximum
+reorg length of 99 blocks, then that node is shut down. When the node is
+restarted with knowledge of the network activation height the checks on startup
+identify a need to reorg to come into agreement with the rest of the network.
+However, since the rollback required is greater than the maximum reorg length,
+the node shuts down with an error as a precautionary measure. It was noticed in
+#4119 that the error message indicated an incorrect computation of the rollback
+length. This test reproduces that error, and the associated change in rollback
+length computation (40b5d5e3ea4b602c34c4efaba0b9f6171dddfef5) corrects the issue.
+
+"""
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (assert_equal, assert_true,
+    assert_start_raises_init_error,
+    start_nodes, start_node, connect_nodes_bi,
+    bitcoind_processes,
+    nuparams, OVERWINTER_BRANCH_ID, SAPLING_BRANCH_ID)
+
+import logging
+import sys
+
+logging.basicConfig(format='%(levelname)s: %(message)s', level=logging.INFO, stream=sys.stdout)
+
+HAS_SAPLING = [nuparams(OVERWINTER_BRANCH_ID, 10), nuparams(SAPLING_BRANCH_ID, 15)]
+NO_SAPLING = [nuparams(OVERWINTER_BRANCH_ID, 10), nuparams(SAPLING_BRANCH_ID, 150)]
+
+class SaplingRewindTest(BitcoinTestFramework):
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 3
+        self.setup_clean_chain = True
+
+    # This mirrors how the network was setup in the bash test
+    def setup_network(self, split=False):
+        logging.info("Initializing the network in "+self.options.tmpdir)
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir, extra_args=[
+                HAS_SAPLING, # The first two nodes have a correct view of the network,
+                HAS_SAPLING, # the third will rewind after upgrading.
+                NO_SAPLING
+        ])
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,0,2)
+        self.is_network_split=False 
+        self.sync_all()
+
+    def run_test(self):
+        # Generate shared state up to the network split
+        logging.info("Generating initial blocks.")
+        self.nodes[0].generate(13)
+        block14 = self.nodes[0].generate(1)[0]
+        logging.info("Syncing network after initial generation...")
+        self.sync_all() # Everyone is still on overwinter
+
+        logging.info("Checking overwinter block propagation.")
+        assert_equal(self.nodes[0].getbestblockhash(), block14)
+        assert_equal(self.nodes[1].getbestblockhash(), block14)
+        assert_equal(self.nodes[2].getbestblockhash(), block14)
+        logging.info("All nodes are on overwinter.")
+
+        logging.info("Generating network split...")
+        self.is_network_split=True 
+
+        # generate past the boundary into sapling; this will become the "canonical" branch
+        self.nodes[0].generate(50) 
+        expected = self.nodes[0].getbestblockhash()
+
+        # generate blocks into sapling beyond the maximum rewind length (99 blocks)
+        self.nodes[2].generate(120) 
+        self.sync_all()
+
+        assert_true(expected != self.nodes[2].getbestblockhash(), "Split chains have not diverged!")
+
+        # Stop the overwinter node to ensure state is flushed to disk.
+        logging.info("Shutting down lagging node...")
+        self.nodes[2].stop()
+        bitcoind_processes[2].wait()
+        
+        # Restart the nodes, reconnect, and sync the network. This succeeds if "-reindex" is passed.
+        logging.info("Reconnecting the network...")
+
+        # expect an exception; the node will refuse to fully start because its last point of
+        # agreement with the rest of the network was prior to the network upgrade activation
+        assert_start_raises_init_error(2, self.options.tmpdir, HAS_SAPLING, "roll back 120")
+
+        # restart the node with -reindex to allow the test to complete gracefully,
+        # otherwise the node shutdown call in test cleanup will throw an error since
+        # it can't connect
+        self.nodes[2] = start_node(2, self.options.tmpdir, extra_args=NO_SAPLING + ["-reindex"])
+
+if __name__ == '__main__':
+    SaplingRewindTest().main()
diff --git a/depend/zcash/qa/rpc-tests/shorter_block_times.py b/depend/zcash/qa/rpc-tests/shorter_block_times.py
new file mode 100755
index 000000000..41c25a6df
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/shorter_block_times.py
@@ -0,0 +1,73 @@
+#!/usr/bin/env python3
+# Copyright (c) 2019 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from decimal import Decimal
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    assert_equal,
+    get_coinbase_address,
+    start_nodes,
+    wait_and_assert_operationid_status,
+)
+
+
+class ShorterBlockTimes(BitcoinTestFramework):
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 4
+        self.setup_clean_chain = True
+
+    def setup_nodes(self):
+        return start_nodes(self.num_nodes, self.options.tmpdir, [[
+            '-nuparams=2bb40e60:106', # Blossom
+        ]] * self.num_nodes)
+
+    def run_test(self):
+        print("Mining blocks...")
+        self.nodes[0].generate(101)
+        self.sync_all()
+
+        # Sanity-check the block height
+        assert_equal(self.nodes[0].getblockcount(), 101)
+
+        node0_taddr = get_coinbase_address(self.nodes[0])
+        node0_zaddr = self.nodes[0].z_getnewaddress('sapling')
+        recipients = [{'address': node0_zaddr, 'amount': Decimal('10.0')}]
+        myopid = self.nodes[0].z_sendmany(node0_taddr, recipients, 1, 0)
+        txid = wait_and_assert_operationid_status(self.nodes[0], myopid)
+        assert_equal(105, self.nodes[0].getrawtransaction(txid, 1)['expiryheight'])  # Blossom activation - 1
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+        assert_equal(10, Decimal(self.nodes[0].z_gettotalbalance()['private']))
+
+        self.nodes[0].generate(2)
+        self.sync_all()
+        print("Mining last pre-Blossom blocks")
+        # Activate blossom
+        self.nodes[1].generate(1)
+        self.sync_all()
+        # Check that we received a pre-Blossom mining reward
+        assert_equal(10, Decimal(self.nodes[1].getwalletinfo()['immature_balance']))
+
+        # After blossom activation the block reward will be halved
+        print("Mining first Blossom block")
+        self.nodes[1].generate(1)
+        self.sync_all()
+        # Check that we received an additional Blossom mining reward
+        assert_equal(15, self.nodes[1].getwalletinfo()['immature_balance'])
+
+        # Send and mine a transaction after activation
+        myopid = self.nodes[0].z_sendmany(node0_taddr, recipients, 1, 0)
+        txid = wait_and_assert_operationid_status(self.nodes[0], myopid)
+        assert_equal(147, self.nodes[0].getrawtransaction(txid, 1)['expiryheight'])  # height + 1 + 40
+        self.sync_all() # Ensure the transaction has propagated to node 1
+        self.nodes[1].generate(1)
+        self.sync_all()
+        assert_equal(20, Decimal(self.nodes[0].z_gettotalbalance()['private']))
+
+
+if __name__ == '__main__':
+    ShorterBlockTimes().main()
diff --git a/depend/zcash/qa/rpc-tests/signrawtransaction_offline.py b/depend/zcash/qa/rpc-tests/signrawtransaction_offline.py
new file mode 100755
index 000000000..8a17a399e
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/signrawtransaction_offline.py
@@ -0,0 +1,60 @@
+#!/usr/bin/env python3
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, assert_true, initialize_chain_clean, start_node, DEFAULT_FEE
+from test_framework.authproxy import JSONRPCException
+
+from decimal import Decimal
+
+
+class SignOfflineTest (BitcoinTestFramework):
+    # Setup Methods
+    def setup_chain(self):
+        print("Initializing test directory " + self.options.tmpdir)
+        initialize_chain_clean(self.options.tmpdir, 2)
+
+    def setup_network(self):
+        self.nodes = [ start_node(0, self.options.tmpdir, ["-nuparams=2bb40e60:10"]) ]
+        self.is_network_split = False
+        self.sync_all()
+
+    # Tests
+    def run_test(self):
+        print("Mining blocks...")
+        self.nodes[0].generate(101)
+
+        offline_node = start_node(1, self.options.tmpdir, ["-maxconnections=0", "-nuparams=2bb40e60:10"])
+        self.nodes.append(offline_node)
+
+        assert_equal(0, len(offline_node.getpeerinfo())) # make sure node 1 has no peers
+
+        taddr = self.nodes[0].getnewaddress()
+
+        tx = self.nodes[0].listunspent()[0]
+        txid = tx['txid']
+        scriptpubkey = tx['scriptPubKey']
+        privkeys = [self.nodes[0].dumpprivkey(tx['address'])]
+
+        create_inputs = [{'txid': txid, 'vout': 0}]
+        sign_inputs = [{'txid': txid, 'vout': 0, 'scriptPubKey': scriptpubkey, 'amount': 10}]
+
+        create_hex = self.nodes[0].createrawtransaction(create_inputs, {taddr: Decimal('10.0') - DEFAULT_FEE})
+
+        # An offline regtest node does not rely on the approx release height of the software
+        # to determine the consensus rules to be used for signing.
+        try:
+            signed_tx = offline_node.signrawtransaction(create_hex, sign_inputs, privkeys)
+            self.nodes[0].sendrawtransaction(signed_tx['hex'])
+            assert(False)
+        except JSONRPCException:
+            pass
+
+        # Passing in the consensus branch id resolves the issue for offline regtest nodes.
+        signed_tx = offline_node.signrawtransaction(create_hex, sign_inputs, privkeys, "ALL", "2bb40e60")
+
+        # If we return the transaction hash, then we have have not thrown an error (success)
+        online_tx_hash = self.nodes[0].sendrawtransaction(signed_tx['hex'])
+        assert_true(len(online_tx_hash) > 0)
+
+if __name__ == '__main__':
+    SignOfflineTest().main()
diff --git a/depend/zcash/qa/rpc-tests/signrawtransactions.py b/depend/zcash/qa/rpc-tests/signrawtransactions.py
new file mode 100755
index 000000000..2c8e36817
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/signrawtransactions.py
@@ -0,0 +1,111 @@
+#!/usr/bin/env python3
+# Copyright (c) 2015-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, start_nodes
+
+
+class SignRawTransactionsTest(BitcoinTestFramework):
+    """Tests transaction signing via RPC command "signrawtransaction"."""
+
+    def __init__(self):
+        super().__init__()
+        self.setup_clean_chain = True
+        self.num_nodes = 1
+
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir)
+        self.is_network_split = False
+
+    def successful_signing_test(self):
+        """Creates and signs a valid raw transaction with one input.
+
+        Expected results:
+
+        1) The transaction has a complete set of signatures
+        2) No script verification error occurred"""
+        privKeys = ['cUeKHd5orzT3mz8P9pxyREHfsWtVfgsfDjiZZBcjUBAaGk1BTj7N']
+
+        inputs = [
+            # Valid pay-to-pubkey script
+            {'txid': '9b907ef1e3c26fc71fe4a4b3580bc75264112f95050014157059c736f0202e71', 'vout': 0,
+             'scriptPubKey': '76a91460baa0f494b38ce3c940dea67f3804dc52d1fb9488ac'}
+        ]
+
+        outputs = {'tmJXomn8fhYy3AFqDEteifjHRMUdKtBuTGM': 0.1}
+
+        # Also test setting an expiry height of 0.
+        rawTx = self.nodes[0].createrawtransaction(inputs, outputs, 0, 0)
+        rawTxSigned = self.nodes[0].signrawtransaction(rawTx, inputs, privKeys)
+
+        # 1) The transaction has a complete set of signatures
+        assert 'complete' in rawTxSigned
+        assert_equal(rawTxSigned['complete'], True)
+
+        # 2) No script verification error occurred
+        assert 'errors' not in rawTxSigned
+
+    def script_verification_error_test(self):
+        """Creates and signs a raw transaction with valid (vin 0), invalid (vin 1) and one missing (vin 2) input script.
+
+        Expected results:
+
+        3) The transaction has no complete set of signatures
+        4) Two script verification errors occurred
+        5) Script verification errors have certain properties ("txid", "vout", "scriptSig", "sequence", "error")
+        6) The verification errors refer to the invalid (vin 1) and missing input (vin 2)"""
+        privKeys = ['cUeKHd5orzT3mz8P9pxyREHfsWtVfgsfDjiZZBcjUBAaGk1BTj7N']
+
+        inputs = [
+            # Valid pay-to-pubkey script
+            {'txid': '9b907ef1e3c26fc71fe4a4b3580bc75264112f95050014157059c736f0202e71', 'vout': 0},
+            # Invalid script
+            {'txid': '5b8673686910442c644b1f4993d8f7753c7c8fcb5c87ee40d56eaeef25204547', 'vout': 7},
+            # Missing scriptPubKey
+            {'txid': '9b907ef1e3c26fc71fe4a4b3580bc75264112f95050014157059c736f0202e71', 'vout': 1},
+        ]
+
+        scripts = [
+            # Valid pay-to-pubkey script
+            {'txid': '9b907ef1e3c26fc71fe4a4b3580bc75264112f95050014157059c736f0202e71', 'vout': 0,
+             'scriptPubKey': '76a91460baa0f494b38ce3c940dea67f3804dc52d1fb9488ac'},
+            # Invalid script
+            {'txid': '5b8673686910442c644b1f4993d8f7753c7c8fcb5c87ee40d56eaeef25204547', 'vout': 7,
+             'scriptPubKey': 'badbadbadbad'}
+        ]
+
+        outputs = {'tmJXomn8fhYy3AFqDEteifjHRMUdKtBuTGM': 0.1}
+
+        rawTx = self.nodes[0].createrawtransaction(inputs, outputs)
+        rawTxSigned = self.nodes[0].signrawtransaction(rawTx, scripts, privKeys)
+
+        # 3) The transaction has no complete set of signatures
+        assert 'complete' in rawTxSigned
+        assert_equal(rawTxSigned['complete'], False)
+
+        # 4) Two script verification errors occurred
+        assert 'errors' in rawTxSigned
+        assert_equal(len(rawTxSigned['errors']), 2)
+
+        # 5) Script verification errors have certain properties
+        assert 'txid' in rawTxSigned['errors'][0]
+        assert 'vout' in rawTxSigned['errors'][0]
+        assert 'scriptSig' in rawTxSigned['errors'][0]
+        assert 'sequence' in rawTxSigned['errors'][0]
+        assert 'error' in rawTxSigned['errors'][0]
+
+        # 6) The verification errors refer to the invalid (vin 1) and missing input (vin 2)
+        assert_equal(rawTxSigned['errors'][0]['txid'], inputs[1]['txid'])
+        assert_equal(rawTxSigned['errors'][0]['vout'], inputs[1]['vout'])
+        assert_equal(rawTxSigned['errors'][1]['txid'], inputs[2]['txid'])
+        assert_equal(rawTxSigned['errors'][1]['vout'], inputs[2]['vout'])
+
+    def run_test(self):
+        self.successful_signing_test()
+        self.script_verification_error_test()
+
+
+if __name__ == '__main__':
+    SignRawTransactionsTest().main()
diff --git a/depend/zcash/qa/rpc-tests/smartfees.py b/depend/zcash/qa/rpc-tests/smartfees.py
new file mode 100755
index 000000000..cc3659dad
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/smartfees.py
@@ -0,0 +1,267 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Test fee estimation code
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import start_node, connect_nodes, \
+    sync_blocks, sync_mempools
+
+import random
+from decimal import Decimal, ROUND_DOWN
+
+# Construct 2 trivial P2SH's and the ScriptSigs that spend them
+# So we can create many transactions without needing to spend
+# time signing.
+P2SH_1 = "2MySexEGVzZpRgNQ1JdjdP5bRETznm3roQ2" # P2SH of "OP_1 OP_DROP"
+P2SH_2 = "2NBdpwq8Aoo1EEKEXPNrKvr5xQr3M9UfcZA" # P2SH of "OP_2 OP_DROP"
+# Associated ScriptSig's to spend satisfy P2SH_1 and P2SH_2
+# 4 bytes of OP_TRUE and push 2-byte redeem script of "OP_1 OP_DROP" or "OP_2 OP_DROP"
+SCRIPT_SIG = ["0451025175", "0451025275"]
+
+def satoshi_round(amount):
+    return  Decimal(amount).quantize(Decimal('0.00000001'), rounding=ROUND_DOWN)
+
+def small_txpuzzle_randfee(from_node, conflist, unconflist, amount, min_fee, fee_increment):
+    '''
+    Create and send a transaction with a random fee.
+    The transaction pays to a trivial P2SH script, and assumes that its inputs
+    are of the same form.
+    The function takes a list of confirmed outputs and unconfirmed outputs
+    and attempts to use the confirmed list first for its inputs.
+    It adds the newly created outputs to the unconfirmed list.
+    Returns (raw transaction, fee)
+    '''
+    # It's best to exponentially distribute our random fees
+    # because the buckets are exponentially spaced.
+    # Exponentially distributed from 1-128 * fee_increment
+    rand_fee = float(fee_increment)*(1.1892**random.randint(0,28))
+    # Total fee ranges from min_fee to min_fee + 127*fee_increment
+    fee = min_fee - fee_increment + satoshi_round(rand_fee)
+    inputs = []
+    total_in = Decimal("0.00000000")
+    while total_in <= (amount + fee) and len(conflist) > 0:
+        t = conflist.pop(0)
+        total_in += t["amount"]
+        inputs.append({ "txid" : t["txid"], "vout" : t["vout"]} )
+    if total_in <= amount + fee:
+        while total_in <= (amount + fee) and len(unconflist) > 0:
+            t = unconflist.pop(0)
+            total_in += t["amount"]
+            inputs.append({ "txid" : t["txid"], "vout" : t["vout"]} )
+        if total_in <= amount + fee:
+            raise RuntimeError("Insufficient funds: need %d, have %d"%(amount+fee, total_in))
+    outputs = {}
+    outputs[P2SH_1] = total_in - amount - fee
+    outputs[P2SH_2] = amount
+    rawtx = from_node.createrawtransaction(inputs, outputs)
+    # Createrawtransaction constructions a transaction that is ready to be signed
+    # These transactions don't need to be signed, but we still have to insert the ScriptSig
+    # that will satisfy the ScriptPubKey.
+    completetx = rawtx[0:10]
+    inputnum = 0
+    for inp in inputs:
+        completetx += rawtx[10+82*inputnum:82+82*inputnum]
+        completetx += SCRIPT_SIG[inp["vout"]]
+        completetx += rawtx[84+82*inputnum:92+82*inputnum]
+        inputnum += 1
+    completetx += rawtx[10+82*inputnum:]
+    txid = from_node.sendrawtransaction(completetx, True)
+    unconflist.append({ "txid" : txid, "vout" : 0 , "amount" : total_in - amount - fee})
+    unconflist.append({ "txid" : txid, "vout" : 1 , "amount" : amount})
+
+    return (completetx, fee)
+
+def split_inputs(from_node, txins, txouts, initial_split = False):
+    '''
+    We need to generate a lot of very small inputs so we can generate a ton of transactions
+    and they will have low priority.
+    This function takes an input from txins, and creates and sends a transaction
+    which splits the value into 2 outputs which are appended to txouts.
+    '''
+    prevtxout = txins.pop()
+    inputs = []
+    outputs = {}
+    inputs.append({ "txid" : prevtxout["txid"], "vout" : prevtxout["vout"] })
+    half_change = satoshi_round(prevtxout["amount"]/2)
+    rem_change = prevtxout["amount"] - half_change  - Decimal("0.00001000")
+    outputs[P2SH_1] = half_change
+    outputs[P2SH_2] = rem_change
+    rawtx = from_node.createrawtransaction(inputs, outputs)
+    # If this is the initial split we actually need to sign the transaction
+    # Otherwise we just need to insert the property ScriptSig
+    if (initial_split) :
+        completetx = from_node.signrawtransaction(rawtx)["hex"]
+    else :
+        completetx = rawtx[0:82] + SCRIPT_SIG[prevtxout["vout"]] + rawtx[84:]
+    txid = from_node.sendrawtransaction(completetx, True)
+    txouts.append({ "txid" : txid, "vout" : 0 , "amount" : half_change})
+    txouts.append({ "txid" : txid, "vout" : 1 , "amount" : rem_change})
+
+def check_estimates(node, fees_seen, max_invalid, print_estimates = True):
+    '''
+    This function calls estimatefee and verifies that the estimates
+    meet certain invariants.
+    '''
+    all_estimates = [ node.estimatefee(i) for i in range(1,26) ]
+    if print_estimates:
+        print([str(all_estimates[e-1]) for e in [1,2,3,6,15,25]])
+    delta = 1.0e-6 # account for rounding error
+    last_e = max(fees_seen)
+    for e in [x for x in all_estimates if x >= 0]:
+        # Estimates should be within the bounds of what transactions fees actually were:
+        if float(e)+delta < min(fees_seen) or float(e)-delta > max(fees_seen):
+            raise AssertionError("Estimated fee (%f) out of range (%f,%f)"
+                                 %(float(e), min(fees_seen), max(fees_seen)))
+        # Estimates should be monotonically decreasing
+        if float(e)-delta > last_e:
+            raise AssertionError("Estimated fee (%f) larger than last fee (%f) for lower number of confirms"
+                                 %(float(e),float(last_e)))
+        last_e = e
+    valid_estimate = False
+    invalid_estimates = 0
+    for e in all_estimates:
+        if e >= 0:
+            valid_estimate = True
+        else:
+            invalid_estimates += 1
+        # Once we're at a high enough confirmation count that we can give an estimate
+        # We should have estimates for all higher confirmation counts
+        if valid_estimate and e < 0:
+            raise AssertionError("Invalid estimate appears at higher confirm count than valid estimate")
+    # Check on the expected number of different confirmation counts
+    # that we might not have valid estimates for
+    if invalid_estimates > max_invalid:
+        raise AssertionError("More than (%d) invalid estimates"%(max_invalid))
+    return all_estimates
+
+
+class EstimateFeeTest(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 3
+        self.setup_clean_chain = False
+
+    def setup_network(self):
+        '''
+        We'll setup the network to have 3 nodes that all mine with different parameters.
+        But first we need to use one node to create a lot of small low priority outputs
+        which we will use to generate our transactions.
+        '''
+        self.nodes = []
+        # Use node0 to mine blocks for input splitting
+        self.nodes.append(start_node(0, self.options.tmpdir, ["-maxorphantx=1000",
+                                                              "-relaypriority=0", "-whitelist=127.0.0.1"]))
+
+        print("This test is time consuming, please be patient")
+        print("Splitting inputs to small size so we can generate low priority tx's")
+        self.txouts = []
+        self.txouts2 = []
+        # Split a coinbase into two transaction puzzle outputs
+        split_inputs(self.nodes[0], self.nodes[0].listunspent(0), self.txouts, True)
+
+        # Mine
+        while (len(self.nodes[0].getrawmempool()) > 0):
+            self.nodes[0].generate(1)
+
+        # Repeatedly split those 2 outputs, doubling twice for each rep
+        # Use txouts to monitor the available utxo, since these won't be tracked in wallet
+        reps = 0
+        while (reps < 5):
+            #Double txouts to txouts2
+            while (len(self.txouts)>0):
+                split_inputs(self.nodes[0], self.txouts, self.txouts2)
+            while (len(self.nodes[0].getrawmempool()) > 0):
+                self.nodes[0].generate(1)
+            #Double txouts2 to txouts
+            while (len(self.txouts2)>0):
+                split_inputs(self.nodes[0], self.txouts2, self.txouts)
+            while (len(self.nodes[0].getrawmempool()) > 0):
+                self.nodes[0].generate(1)
+            reps += 1
+        print("Finished splitting")
+
+        # Now we can connect the other nodes, didn't want to connect them earlier
+        # so the estimates would not be affected by the splitting transactions
+        # Node1 mines small blocks but that are bigger than the expected transaction rate,
+        # and allows free transactions.
+        # NOTE: the CreateNewBlock code starts counting block size at 1,000 bytes,
+        # (17k is room enough for 110 or so transactions)
+        self.nodes.append(start_node(1, self.options.tmpdir,
+                                     ["-blockprioritysize=1500", "-blockmaxsize=18000",
+                                      "-maxorphantx=1000", "-relaypriority=0", "-debug=estimatefee"]))
+        connect_nodes(self.nodes[1], 0)
+
+        # Node2 is a stingy miner, that
+        # produces too small blocks (room for only 70 or so transactions)
+        node2args = ["-blockprioritysize=0", "-blockmaxsize=12000", "-maxorphantx=1000", "-relaypriority=0"]
+
+        self.nodes.append(start_node(2, self.options.tmpdir, node2args))
+        connect_nodes(self.nodes[0], 2)
+        connect_nodes(self.nodes[2], 1)
+
+        self.is_network_split = False
+        self.sync_all()
+
+    def transact_and_mine(self, numblocks, mining_node):
+        min_fee = Decimal("0.00001")
+        # We will now mine numblocks blocks generating on average 100 transactions between each block
+        # We shuffle our confirmed txout set before each set of transactions
+        # small_txpuzzle_randfee will use the transactions that have inputs already in the chain when possible
+        # resorting to tx's that depend on the mempool when those run out
+        for i in range(numblocks):
+            random.shuffle(self.confutxo)
+            for j in range(random.randrange(100-50,100+50)):
+                from_index = random.randint(1,2)
+                (txhex, fee) = small_txpuzzle_randfee(self.nodes[from_index], self.confutxo,
+                                                      self.memutxo, Decimal("0.005"), min_fee, min_fee)
+                tx_kbytes = (len(txhex) // 2) / 1000.0
+                self.fees_per_kb.append(float(fee)/tx_kbytes)
+            sync_mempools(self.nodes[0:3],.1)
+            mined = mining_node.getblock(mining_node.generate(1)[0],True)["tx"]
+            sync_blocks(self.nodes[0:3],.1)
+            #update which txouts are confirmed
+            newmem = []
+            for utx in self.memutxo:
+                if utx["txid"] in mined:
+                    self.confutxo.append(utx)
+                else:
+                    newmem.append(utx)
+            self.memutxo = newmem
+
+    def run_test(self):
+        self.fees_per_kb = []
+        self.memutxo = []
+        self.confutxo = self.txouts # Start with the set of confirmed txouts after splitting
+        print("Checking estimates for 1/2/3/6/15/25 blocks")
+        print("Creating transactions and mining them with a huge block size")
+        # Create transactions and mine 20 big blocks with node 0 such that the mempool is always emptied
+        self.transact_and_mine(30, self.nodes[0])
+        check_estimates(self.nodes[1], self.fees_per_kb, 1)
+
+        print("Creating transactions and mining them with a block size that can't keep up")
+        # Create transactions and mine 30 small blocks with node 2, but create txs faster than we can mine
+        self.transact_and_mine(20, self.nodes[2])
+        check_estimates(self.nodes[1], self.fees_per_kb, 3)
+
+        print("Creating transactions and mining them at a block size that is just big enough")
+        # Generate transactions while mining 40 more blocks, this time with node1
+        # which mines blocks with capacity just above the rate that transactions are being created
+        self.transact_and_mine(40, self.nodes[1])
+        check_estimates(self.nodes[1], self.fees_per_kb, 2)
+
+        # Finish by mining a normal-sized block:
+        while len(self.nodes[1].getrawmempool()) > 0:
+            self.nodes[1].generate(1)
+
+        sync_blocks(self.nodes[0:3],.1)
+        print("Final estimates after emptying mempools")
+        check_estimates(self.nodes[1], self.fees_per_kb, 2)
+
+if __name__ == '__main__':
+    EstimateFeeTest().main()
diff --git a/depend/zcash/qa/rpc-tests/spentindex.py b/depend/zcash/qa/rpc-tests/spentindex.py
new file mode 100755
index 000000000..a152ddba5
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/spentindex.py
@@ -0,0 +1,185 @@
+#!/usr/bin/env python3
+# Copyright (c) 2019 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+#
+# Test spentindex generation and fetching for insightexplorer
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.authproxy import JSONRPCException
+
+from test_framework.util import (
+    assert_equal,
+    initialize_chain_clean,
+    start_nodes,
+    stop_nodes,
+    connect_nodes,
+    wait_bitcoinds,
+    fail,
+)
+
+from test_framework.mininode import COIN
+
+
+class SpentIndexTest(BitcoinTestFramework):
+
+    def setup_chain(self):
+        print("Initializing test directory "+self.options.tmpdir)
+        initialize_chain_clean(self.options.tmpdir, 3)
+
+    def setup_network(self):
+        # -insightexplorer causes spentindex to be enabled (fSpentIndex = true)
+
+        self.nodes = start_nodes(
+            3, self.options.tmpdir,
+            [['-debug', '-txindex', '-experimentalfeatures', '-insightexplorer']]*3)
+        connect_nodes(self.nodes[0], 1)
+        connect_nodes(self.nodes[0], 2)
+
+        self.is_network_split = False
+        self.sync_all()
+
+    def run_test(self):
+        self.nodes[0].generate(105)
+        self.sync_all()
+
+        chain_height = self.nodes[1].getblockcount()
+        assert_equal(chain_height, 105)
+
+        # Test getrawtransaction changes and the getspentinfo RPC
+
+        # send coinbase to address addr1
+        addr1 = self.nodes[1].getnewaddress()
+        txid1 = self.nodes[0].sendtoaddress(addr1, 2)
+        self.sync_all()
+        block_hash1 = self.nodes[0].generate(1)
+        self.sync_all()
+
+        # send from addr1 to addr2
+        # (the only utxo on node 1 is from address addr1)
+        addr2 = self.nodes[2].getnewaddress()
+        txid2 = self.nodes[1].sendtoaddress(addr2, 1)
+        self.sync_all()
+
+        # addr1 to addr2 transaction is not confirmed, so it has no height
+        tx2 = self.nodes[2].getrawtransaction(txid2, 1)
+        assert('height' not in tx2)
+
+        # confirm addr1 to addr2 transaction
+        block_hash2 = self.nodes[0].generate(1)
+        self.sync_all()
+
+        # Restart all nodes to ensure index files are saved to disk and recovered
+        stop_nodes(self.nodes)
+        wait_bitcoinds()
+        self.setup_network()
+
+        # Check new fields added to getrawtransaction
+        tx1 = self.nodes[2].getrawtransaction(txid1, 1)
+        assert_equal(tx1['vin'][0]['value'], 10)  # coinbase
+        assert_equal(tx1['vin'][0]['valueSat'], 10*COIN)
+        # we want the non-change (payment) output
+        vout = list(filter(lambda o: o['value'] == 2, tx1['vout']))
+        n = vout[0]['n']
+        assert_equal(vout[0]['spentTxId'], txid2)
+        assert_equal(vout[0]['spentIndex'], 0)
+        assert_equal(vout[0]['spentHeight'], 107)
+        assert_equal(tx1['height'], 106)
+
+        tx2 = self.nodes[2].getrawtransaction(txid2, 1)
+        assert_equal(tx2['vin'][0]['address'], addr1)
+        assert_equal(tx2['vin'][0]['value'], 2)
+        assert_equal(tx2['vin'][0]['valueSat'], 2*COIN)
+        # since this transaction's outputs haven't yet been
+        # spent, these fields should not be present
+        assert('spentTxId' not in tx2['vout'][0])
+        assert('spentIndex' not in tx2['vout'][0])
+        assert('spentHeight' not in tx2['vout'][0])
+        assert_equal(tx2['height'], 107)
+
+        # Given a transaction output, getspentinfo() returns a reference
+        # to the (later, confirmed) transaction that spent that output,
+        # that is, the transaction that used this output as an input.
+        spentinfo = self.nodes[2].getspentinfo({'txid': txid1, 'index': n})
+        assert_equal(spentinfo['height'], 107)
+        assert_equal(spentinfo['index'], 0)
+        assert_equal(spentinfo['txid'], txid2)
+
+        # specifying an output that hasn't been spent should fail
+        try:
+            self.nodes[1].getspentinfo({'txid': txid2, 'index': 0})
+            fail('getspentinfo should have thrown an exception')
+        except JSONRPCException as e:
+            assert_equal(e.error['message'], "Unable to get spent info")
+
+        block_hash_next = self.nodes[0].generate(1)
+        self.sync_all()
+
+        # Test the getblockdeltas RPC
+        blockdeltas = self.nodes[2].getblockdeltas(block_hash1[0])
+        assert_equal(blockdeltas['confirmations'], 3)
+        assert_equal(blockdeltas['height'], 106)
+        assert_equal(blockdeltas['version'], 4)
+        assert_equal(blockdeltas['hash'], block_hash1[0])
+        assert_equal(blockdeltas['nextblockhash'], block_hash2[0])
+        deltas = blockdeltas['deltas']
+        # block contains two transactions, coinbase, and earlier coinbase to addr1
+        assert_equal(len(deltas), 2)
+        coinbase_tx = deltas[0]
+        assert_equal(coinbase_tx['index'], 0)
+        assert_equal(len(coinbase_tx['inputs']), 0)
+        assert_equal(len(coinbase_tx['outputs']), 2)
+        assert_equal(coinbase_tx['outputs'][0]['index'], 0)
+        assert_equal(coinbase_tx['outputs'][1]['index'], 1)
+        assert_equal(coinbase_tx['outputs'][1]['satoshis'], 2.5*COIN)
+
+        to_a_tx = deltas[1]
+        assert_equal(to_a_tx['index'], 1)
+        assert_equal(to_a_tx['txid'], txid1)
+
+        assert_equal(len(to_a_tx['inputs']), 1)
+        assert_equal(to_a_tx['inputs'][0]['index'], 0)
+        assert_equal(to_a_tx['inputs'][0]['prevout'], 0)
+        assert_equal(to_a_tx['inputs'][0]['satoshis'], -10*COIN)
+
+        assert_equal(len(to_a_tx['outputs']), 2)
+        # find the nonchange output, which is the payment to addr1
+        out = list(filter(lambda o: o['satoshis'] == 2*COIN, to_a_tx['outputs']))
+        assert_equal(len(out), 1)
+        assert_equal(out[0]['address'], addr1)
+
+        blockdeltas = self.nodes[2].getblockdeltas(block_hash2[0])
+        assert_equal(blockdeltas['confirmations'], 2)
+        assert_equal(blockdeltas['height'], 107)
+        assert_equal(blockdeltas['version'], 4)
+        assert_equal(blockdeltas['hash'], block_hash2[0])
+        assert_equal(blockdeltas['previousblockhash'], block_hash1[0])
+        assert_equal(blockdeltas['nextblockhash'], block_hash_next[0])
+        deltas = blockdeltas['deltas']
+        assert_equal(len(deltas), 2)
+        coinbase_tx = deltas[0]
+        assert_equal(coinbase_tx['index'], 0)
+        assert_equal(len(coinbase_tx['inputs']), 0)
+        assert_equal(len(coinbase_tx['outputs']), 2)
+        assert_equal(coinbase_tx['outputs'][0]['index'], 0)
+        assert_equal(coinbase_tx['outputs'][1]['index'], 1)
+        assert_equal(coinbase_tx['outputs'][1]['satoshis'], 2.5*COIN)
+
+        to_b_tx = deltas[1]
+        assert_equal(to_b_tx['index'], 1)
+        assert_equal(to_b_tx['txid'], txid2)
+
+        assert_equal(len(to_b_tx['inputs']), 1)
+        assert_equal(to_b_tx['inputs'][0]['index'], 0)
+        assert_equal(to_b_tx['inputs'][0]['prevtxid'], txid1)
+        assert_equal(to_b_tx['inputs'][0]['satoshis'], -2*COIN)
+
+        assert_equal(len(to_b_tx['outputs']), 2)
+        # find the nonchange output, which is the payment to addr2
+        out = list(filter(lambda o: o['satoshis'] == 1*COIN, to_b_tx['outputs']))
+        assert_equal(len(out), 1)
+        assert_equal(out[0]['address'], addr2)
+
+
+if __name__ == '__main__':
+    SpentIndexTest().main()
diff --git a/depend/zcash/qa/rpc-tests/sprout_sapling_migration.py b/depend/zcash/qa/rpc-tests/sprout_sapling_migration.py
new file mode 100755
index 000000000..680e4a040
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/sprout_sapling_migration.py
@@ -0,0 +1,203 @@
+#!/usr/bin/env python3
+# Copyright (c) 2019 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from decimal import Decimal
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, assert_true, get_coinbase_address, \
+    start_nodes, wait_and_assert_operationid_status, \
+    wait_and_assert_operationid_status_result, DEFAULT_FEE
+
+SAPLING_ADDR = 'zregtestsapling1ssqj3f3majnl270985gqcdqedd9t4nlttjqskccwevj2v20sc25deqspv3masufnwcdy67cydyy'
+SAPLING_KEY = 'secret-extended-key-regtest1qv62zt2fqyqqpqrh2qzc08h7gncf4447jh9kvnnnhjg959fkwt7mhw9j8e9at7attx8z6u3953u86vcnsujdc2ckdlcmztjt44x3uxpah5mxtncxd0mqcnz9eq8rghh5m4j44ep5d9702sdvvwawqassulktfegrcp4twxgqdxx4eww3lau0mywuaeztpla2cmvagr5nj98elt45zh6fjznadl6wz52n2uyhdwcm2wlsu8fnxstrk6s4t55t8dy6jkgx5g0cwpchh5qffp8x5'
+
+DISABLED_NO_FUNDS = 0
+ENABLED_NO_FUNDS = 1
+DISABLED_BEFORE_MIGRATION = 2
+ENABLED_BEFORE_MIGRATION = 3
+DURING_MIGRATION = 4
+AFTER_MIGRATION = 5
+ALL_MIGRATION_STATES = [DISABLED_NO_FUNDS, ENABLED_NO_FUNDS, DISABLED_BEFORE_MIGRATION, ENABLED_BEFORE_MIGRATION, DURING_MIGRATION, AFTER_MIGRATION]
+
+
+def check_migration_status(node, destination_address, migration_state):
+    status = node.z_getmigrationstatus()
+    assert_equal(destination_address, status['destination_address'], "Migration destination address; status=%r" % status)
+    assert_true(migration_state in ALL_MIGRATION_STATES, "Unexpected migration state %r" % migration_state)
+
+    expected_enabled = migration_state not in [DISABLED_NO_FUNDS, DISABLED_BEFORE_MIGRATION]
+    expected_sprout_funds = migration_state in [DISABLED_BEFORE_MIGRATION, ENABLED_BEFORE_MIGRATION]
+    positive_unfinalized_amount = migration_state == DURING_MIGRATION
+    positive_finalized_amount = migration_state == AFTER_MIGRATION
+    num_migration_txids = 1 if migration_state in [DURING_MIGRATION, AFTER_MIGRATION] else 0
+    num_finalized_migration_transactions = 1 if migration_state == AFTER_MIGRATION else 0
+
+    assert_equal(expected_enabled, status['enabled'], "Expected enabled: %s" % expected_enabled)
+    # During and after the migration there may be no remaining sprout funds if
+    # we have randomly picked to migrate them all at once, so we only check
+    # this field in the one case.
+    if expected_sprout_funds:
+        assert_true(Decimal(status['unmigrated_amount']) > Decimal('0.00'), "Expected sprout funds; status=%r" % (status,))
+    # For the other two amount fields we know whether or not they will be positive
+    unfinalized_msg = "Positive unfinalized amount: %s; status=%r " % (positive_unfinalized_amount, status)
+    assert_equal(positive_unfinalized_amount, Decimal(status['unfinalized_migrated_amount']) > Decimal('0'), unfinalized_msg)
+    finalized_msg = "Positive finalized amount: %s; status=%r " % (positive_finalized_amount, status)
+    assert_equal(positive_finalized_amount, Decimal(status['finalized_migrated_amount']) > Decimal('0'), finalized_msg)
+    assert_equal(num_finalized_migration_transactions, status['finalized_migration_transactions'], "Num finalized transactions; status=%r" % (status,))
+    assert_equal(num_migration_txids, len(status['migration_txids']), "Num migration txids; status=%r" % (status,))
+
+
+class SproutSaplingMigration(BitcoinTestFramework):
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 4
+        self.setup_clean_chain = True
+
+    def setup_nodes(self):
+        extra_args = [[
+        ]] * self.num_nodes
+        # Add migration parameters to nodes[0]
+        extra_args[0] = extra_args[0] + [
+            '-migration',
+            '-migrationdestaddress=' + SAPLING_ADDR,
+            '-debug=zrpcunsafe'
+        ]
+        assert_equal(3, len(extra_args[0]))
+        assert_equal(0, len(extra_args[1]))
+        return start_nodes(self.num_nodes, self.options.tmpdir, extra_args)
+
+    def run_migration_test(self, node, sproutAddr, saplingAddr, target_height):
+        # Make sure we are in a good state to run the test
+        assert_equal(102, node.getblockcount() % 500, "Should be at block 102 % 500")
+        assert_equal(node.z_getbalance(sproutAddr), Decimal('10'))
+        assert_equal(node.z_getbalance(saplingAddr), Decimal('0'))
+        check_migration_status(node, saplingAddr, DISABLED_BEFORE_MIGRATION)
+
+        # Migrate
+        node.z_setmigration(True)
+        print("Mining to block 494 % 500...")
+        node.generate(392)  # 102 % 500 -> 494 % 500
+        self.sync_all()
+
+        # At 494 % 500 we should have no async operations
+        assert_equal(0, len(node.z_getoperationstatus()), "num async operations at 494 % 500")
+        check_migration_status(node, saplingAddr, ENABLED_BEFORE_MIGRATION)
+
+        node.generate(1)
+        self.sync_all()
+
+        # At 495 % 500 we should have an async operation
+        operationstatus = node.z_getoperationstatus()
+        print("migration operation: {}".format(operationstatus))
+        assert_equal(1, len(operationstatus), "num async operations at 495  % 500")
+        assert_equal('saplingmigration', operationstatus[0]['method'])
+        assert_equal(target_height, operationstatus[0]['target_height'])
+
+        result = wait_and_assert_operationid_status_result(node, operationstatus[0]['id'])
+        print("result: {}".format(result))
+        assert_equal('saplingmigration', result['method'])
+        assert_equal(target_height, result['target_height'])
+        assert_equal(1, result['result']['num_tx_created'])
+        assert_equal(1, len(result['result']['migration_txids']))
+        assert_true(Decimal(result['result']['amount_migrated']) > Decimal('0'))
+
+        assert_equal(0, len(node.getrawmempool()), "mempool size at 495 % 500")
+
+        node.generate(3)
+        self.sync_all()
+
+        # At 498 % 500 the mempool will be empty and no funds will have moved
+        assert_equal(0, len(node.getrawmempool()), "mempool size at 498 % 500")
+        assert_equal(node.z_getbalance(sproutAddr), Decimal('10'))
+        assert_equal(node.z_getbalance(saplingAddr), Decimal('0'))
+
+        node.generate(1)
+        self.sync_all()
+
+        # At 499 % 500 there will be a transaction in the mempool and the note will be locked
+        mempool = node.getrawmempool()
+        print("mempool: {}".format(mempool))
+        assert_equal(1, len(mempool), "mempool size at 499 % 500")
+        assert_equal(node.z_getbalance(sproutAddr), Decimal('0'))
+        assert_equal(node.z_getbalance(saplingAddr), Decimal('0'))
+        assert_true(node.z_getbalance(saplingAddr, 0) > Decimal('0'), "Unconfirmed sapling balance at 499 % 500")
+        # Check that unmigrated amount + unfinalized = starting balance - fee
+        status = node.z_getmigrationstatus()
+        print("status: {}".format(status))
+        assert_equal(Decimal('10.0') - DEFAULT_FEE, Decimal(status['unmigrated_amount']) + Decimal(status['unfinalized_migrated_amount']))
+
+        # The transaction in the mempool should be the one listed in migration_txids,
+        # and it should expire at the next 450 % 500.
+        assert_equal(1, len(status['migration_txids']))
+        txid = status['migration_txids'][0]
+        assert_equal(txid, mempool[0])
+        tx = node.getrawtransaction(txid, 1)
+        assert_equal(target_height + 450, tx['expiryheight'])
+
+        node.generate(1)
+        self.sync_all()
+
+        # At 0 % 500 funds will have moved
+        sprout_balance = node.z_getbalance(sproutAddr)
+        sapling_balance = node.z_getbalance(saplingAddr)
+        print("sprout balance: {}, sapling balance: {}".format(sprout_balance, sapling_balance))
+        assert_true(sprout_balance < Decimal('10'), "Should have less Sprout funds")
+        assert_true(sapling_balance > Decimal('0'), "Should have more Sapling funds")
+        assert_true(sprout_balance + sapling_balance, Decimal('10.0') - DEFAULT_FEE)
+
+        check_migration_status(node, saplingAddr, DURING_MIGRATION)
+        # At 10 % 500 the transactions will be considered 'finalized'
+        node.generate(10)
+        self.sync_all()
+        check_migration_status(node, saplingAddr, AFTER_MIGRATION)
+        # Check exact migration status amounts to make sure we account for fee
+        status = node.z_getmigrationstatus()
+        assert_equal(sprout_balance, Decimal(status['unmigrated_amount']))
+        assert_equal(sapling_balance, Decimal(status['finalized_migrated_amount']))
+
+    def send_to_sprout_zaddr(self, tAddr, sproutAddr):
+        # Send some ZEC to a Sprout address
+        result = self.nodes[0].z_shieldcoinbase(tAddr, sproutAddr, 0, 1)
+        wait_and_assert_operationid_status(self.nodes[0], result['opid'])
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+    def run_test(self):
+        # Check enabling via '-migration' and disabling via rpc
+        check_migration_status(self.nodes[0], SAPLING_ADDR, ENABLED_NO_FUNDS)
+        self.nodes[0].z_setmigration(False)
+        check_migration_status(self.nodes[0], SAPLING_ADDR, DISABLED_NO_FUNDS)
+
+        # 1. Test using self.nodes[0] which has the parameter
+        print("Running test using '-migrationdestaddress'...")
+        print("Mining blocks...")
+        self.nodes[0].generate(101)
+        self.sync_all()
+        tAddr = get_coinbase_address(self.nodes[0])
+
+        # Import a previously generated key to test '-migrationdestaddress'
+        self.nodes[0].z_importkey(SAPLING_KEY)
+        sproutAddr0 = self.nodes[0].z_getnewaddress('sprout')
+
+        self.send_to_sprout_zaddr(tAddr, sproutAddr0)
+        self.run_migration_test(self.nodes[0], sproutAddr0, SAPLING_ADDR, 500)
+        # Disable migration so only self.nodes[1] has a transaction in the mempool at block 999
+        self.nodes[0].z_setmigration(False)
+
+        # 2. Test using self.nodes[1] which will use the default Sapling address
+        print("Running test using default Sapling address...")
+        # Mine more blocks so we start at 102 % 500
+        print("Mining blocks...")
+        self.nodes[1].generate(91)  # 511 -> 602
+        self.sync_all()
+
+        sproutAddr1 = self.nodes[1].z_getnewaddress('sprout')
+        saplingAddr1 = self.nodes[1].z_getnewaddress('sapling')
+
+        self.send_to_sprout_zaddr(tAddr, sproutAddr1)
+        self.run_migration_test(self.nodes[1], sproutAddr1, saplingAddr1, 1000)
+
+
+if __name__ == '__main__':
+    SproutSaplingMigration().main()
diff --git a/depend/zcash/qa/rpc-tests/test_framework/__init__.py b/depend/zcash/qa/rpc-tests/test_framework/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/depend/zcash/qa/rpc-tests/test_framework/authproxy.py b/depend/zcash/qa/rpc-tests/test_framework/authproxy.py
new file mode 100644
index 000000000..391482c89
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/test_framework/authproxy.py
@@ -0,0 +1,166 @@
+"""
+  Copyright 2011 Jeff Garzik
+
+  AuthServiceProxy has the following improvements over python-jsonrpc's
+  ServiceProxy class:
+
+  - HTTP connections persist for the life of the AuthServiceProxy object
+    (if server supports HTTP/1.1)
+  - sends protocol 'version', per JSON-RPC 1.1
+  - sends proper, incrementing 'id'
+  - sends Basic HTTP authentication headers
+  - parses all JSON numbers that look like floats as Decimal
+  - uses standard Python json lib
+
+  Previous copyright, from python-jsonrpc/jsonrpc/proxy.py:
+
+  Copyright (c) 2007 Jan-Klaas Kollhof
+
+  This file is part of jsonrpc.
+
+  jsonrpc is free software; you can redistribute it and/or modify
+  it under the terms of the GNU Lesser General Public License as published by
+  the Free Software Foundation; either version 2.1 of the License, or
+  (at your option) any later version.
+
+  This software is distributed in the hope that it will be useful,
+  but WITHOUT ANY WARRANTY; without even the implied warranty of
+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+  GNU Lesser General Public License for more details.
+
+  You should have received a copy of the GNU Lesser General Public License
+  along with this software; if not, write to the Free Software
+  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+"""
+
+import base64
+import decimal
+import simplejson as json
+import logging
+from http.client import HTTPConnection, HTTPSConnection, BadStatusLine
+from urllib.parse import urlparse
+
+USER_AGENT = "AuthServiceProxy/0.1"
+
+HTTP_TIMEOUT = 600
+
+log = logging.getLogger("BitcoinRPC")
+
+class JSONRPCException(Exception):
+    def __init__(self, rpc_error):
+        Exception.__init__(self, rpc_error.get("message"))
+        self.error = rpc_error
+
+def EncodeDecimal(o):
+    if isinstance(o, decimal.Decimal):
+        return str(o)
+    raise TypeError(repr(o) + " is not JSON serializable")
+
+
+class AuthServiceProxy():
+    __id_count = 0
+
+    def __init__(self, service_url, service_name=None, timeout=HTTP_TIMEOUT, connection=None):
+        self.__service_url = service_url
+        self._service_name = service_name
+        self.__url =  urlparse(service_url)
+        (user, passwd) = (self.__url.username, self.__url.password)
+        try:
+            user = user.encode('utf8')
+        except AttributeError:
+            pass
+        try:
+            passwd = passwd.encode('utf8')
+        except AttributeError:
+            pass
+        authpair = user + b':' + passwd
+        self.__auth_header = b'Basic ' + base64.b64encode(authpair)
+
+        self.timeout = timeout
+        self._set_conn(connection)
+
+    def _set_conn(self, connection=None):
+        port = 80 if self.__url.port is None else self.__url.port
+        if connection:
+            self.__conn = connection
+            self.timeout = connection.timeout
+        elif self.__url.scheme == 'https':
+            self.__conn = HTTPSConnection(self.__url.hostname, port, timeout=self.timeout)
+        else:
+            self.__conn = HTTPConnection(self.__url.hostname, port, timeout=self.timeout)
+   
+    def __getattr__(self, name):
+        if name.startswith('__') and name.endswith('__'):
+            # Python internal stuff
+            raise AttributeError
+        if self._service_name is not None:
+            name = "%s.%s" % (self._service_name, name)
+        return AuthServiceProxy(self.__service_url, name, connection=self.__conn)
+
+    def _request(self, method, path, postdata):
+        '''
+        Do a HTTP request, with retry if we get disconnected (e.g. due to a timeout).
+        This is a workaround for https://bugs.python.org/issue3566 which is fixed in Python 3.5.
+        '''
+        headers = {'Host': self.__url.hostname,
+                   'User-Agent': USER_AGENT,
+                   'Authorization': self.__auth_header,
+                   'Content-type': 'application/json'}
+        try:
+            self.__conn.request(method, path, postdata, headers)
+            return self._get_response()
+        except Exception as e:
+            # If connection was closed, try again.
+            # Python 3.5+ raises BrokenPipeError instead of BadStatusLine when the connection was reset.
+            # ConnectionResetError happens on FreeBSD with Python 3.4.
+            # This can be simplified now that we depend on Python 3 (previously, we could not
+            # refer to BrokenPipeError or ConnectionResetError which did not exist on Python 2)
+            if ((isinstance(e, BadStatusLine) and e.line == "''")
+                or e.__class__.__name__ in ('BrokenPipeError', 'ConnectionResetError')):
+                self.__conn.close()
+                self.__conn.request(method, path, postdata, headers)
+                return self._get_response()
+            else:
+                raise
+
+    def __call__(self, *args):
+        AuthServiceProxy.__id_count += 1
+
+        log.debug("-%s-> %s %s"%(AuthServiceProxy.__id_count, self._service_name,
+                                 json.dumps(args, default=EncodeDecimal)))
+        postdata = json.dumps({'version': '1.1',
+                               'method': self._service_name,
+                               'params': args,
+                               'id': AuthServiceProxy.__id_count}, default=EncodeDecimal)
+        response = self._request('POST', self.__url.path, postdata)
+        if response['error'] is not None:
+            raise JSONRPCException(response['error'])
+        elif 'result' not in response:
+            raise JSONRPCException({
+                'code': -343, 'message': 'missing JSON-RPC result'})
+        else:
+            return response['result']
+
+    def _batch(self, rpc_call_list):
+        postdata = json.dumps(list(rpc_call_list), default=EncodeDecimal)
+        log.debug("--> "+postdata)
+        return self._request('POST', self.__url.path, postdata)
+
+    def _get_response(self):
+        http_response = self.__conn.getresponse()
+        if http_response is None:
+            raise JSONRPCException({
+                'code': -342, 'message': 'missing HTTP response from server'})
+        
+        content_type = http_response.getheader('Content-Type')
+        if content_type != 'application/json':
+            raise JSONRPCException({
+                'code': -342, 'message': 'non-JSON HTTP response with \'%i %s\' from server' % (http_response.status, http_response.reason)})
+
+        responsedata = http_response.read().decode('utf8')
+        response = json.loads(responsedata, parse_float=decimal.Decimal)
+        if "error" in response and response["error"] is None:
+            log.debug("<-%s- %s"%(response["id"], json.dumps(response["result"], default=EncodeDecimal)))
+        else:
+            log.debug("<-- "+responsedata)
+        return response
diff --git a/depend/zcash/qa/rpc-tests/test_framework/bignum.py b/depend/zcash/qa/rpc-tests/test_framework/bignum.py
new file mode 100644
index 000000000..f56cea98e
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/test_framework/bignum.py
@@ -0,0 +1,100 @@
+#!/usr/bin/env python3
+#
+# bignum.py
+#
+# This file is copied from python-bitcoinlib.
+#
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+#
+
+"""Bignum routines"""
+
+import struct
+
+
+# generic big endian MPI format
+
+def bn_bytes(v, have_ext=False):
+    ext = 0
+    if have_ext:
+        ext = 1
+    return ((v.bit_length()+7)//8) + ext
+
+def bn2bin(v):
+    s = bytearray()
+    i = bn_bytes(v)
+    while i > 0:
+        s.append((v >> ((i-1) * 8)) & 0xff)
+        i -= 1
+    return s
+
+def bin2bn(s):
+    l = 0
+    for ch in s:
+        l = (l << 8) | ch
+    return l
+
+def bn2mpi(v):
+    have_ext = False
+    if v.bit_length() > 0:
+        have_ext = (v.bit_length() & 0x07) == 0
+
+    neg = False
+    if v < 0:
+        neg = True
+        v = -v
+
+    s = struct.pack(b">I", bn_bytes(v, have_ext))
+    ext = bytearray()
+    if have_ext:
+        ext.append(0)
+    v_bin = bn2bin(v)
+    if neg:
+        if have_ext:
+            ext[0] |= 0x80
+        else:
+            v_bin[0] |= 0x80
+    return s + ext + v_bin
+
+def mpi2bn(s):
+    if len(s) < 4:
+        return None
+    s_size = bytes(s[:4])
+    v_len = struct.unpack(b">I", s_size)[0]
+    if len(s) != (v_len + 4):
+        return None
+    if v_len == 0:
+        return 0
+
+    v_str = bytearray(s[4:])
+    neg = False
+    i = v_str[0]
+    if i & 0x80:
+        neg = True
+        i &= ~0x80
+        v_str[0] = i
+
+    v = bin2bn(v_str)
+
+    if neg:
+        return -v
+    return v
+
+# bitcoin-specific little endian format, with implicit size
+def mpi2vch(s):
+    r = s[4:]           # strip size
+    r = r[::-1]         # reverse string, converting BE->LE
+    return r
+
+def bn2vch(v):
+    return bytes(mpi2vch(bn2mpi(v)))
+
+def vch2mpi(s):
+    r = struct.pack(b">I", len(s))   # size
+    r += s[::-1]            # reverse string, converting LE->BE
+    return r
+
+def vch2bn(s):
+    return mpi2bn(vch2mpi(s))
+
diff --git a/depend/zcash/qa/rpc-tests/test_framework/blockstore.py b/depend/zcash/qa/rpc-tests/test_framework/blockstore.py
new file mode 100644
index 000000000..e83ee5fab
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/test_framework/blockstore.py
@@ -0,0 +1,142 @@
+#!/usr/bin/env python3
+# BlockStore: a helper class that keeps a map of blocks and implements
+#             helper functions for responding to getheaders and getdata,
+#             and for constructing a getheaders message
+#
+
+from .mininode import CBlock, CBlockHeader, CBlockLocator, CTransaction, msg_block, msg_headers, msg_tx
+
+import sys
+from io import BytesIO
+import dbm.ndbm
+
+class BlockStore():
+    def __init__(self, datadir):
+        self.blockDB = dbm.ndbm.open(datadir + "/blocks", 'c')
+        self.currentBlock = 0
+        self.headers_map = dict()
+
+    def close(self):
+        self.blockDB.close()
+
+    def get(self, blockhash):
+        serialized_block = None
+        try:
+            serialized_block = self.blockDB[repr(blockhash)]
+        except KeyError:
+            return None
+        f = BytesIO(serialized_block)
+        ret = CBlock()
+        ret.deserialize(f)
+        ret.calc_sha256()
+        return ret
+
+    def get_header(self, blockhash):
+        try:
+            return self.headers_map[blockhash]
+        except KeyError:
+            return None
+
+    # Note: this pulls full blocks out of the database just to retrieve
+    # the headers -- perhaps we could keep a separate data structure
+    # to avoid this overhead.
+    def headers_for(self, locator, hash_stop, current_tip=None):
+        if current_tip is None:
+            current_tip = self.currentBlock
+        current_block_header = self.get_header(current_tip)
+        if current_block_header is None:
+            return None
+
+        response = msg_headers()
+        headersList = [ current_block_header ]
+        maxheaders = 2000
+        while (headersList[0].sha256 not in locator.vHave):
+            prevBlockHash = headersList[0].hashPrevBlock
+            prevBlockHeader = self.get_header(prevBlockHash)
+            if prevBlockHeader is not None:
+                headersList.insert(0, prevBlockHeader)
+            else:
+                break
+        headersList = headersList[:maxheaders] # truncate if we have too many
+        hashList = [x.sha256 for x in headersList]
+        index = len(headersList)
+        if (hash_stop in hashList):
+            index = hashList.index(hash_stop)+1
+        response.headers = headersList[:index]
+        return response
+
+    def add_block(self, block):
+        block.calc_sha256()
+        try:
+            self.blockDB[repr(block.sha256)] = bytes(block.serialize())
+        except TypeError as e:
+            print("Unexpected error: ", sys.exc_info()[0], e.args)
+        self.currentBlock = block.sha256
+        self.headers_map[block.sha256] = CBlockHeader(block)
+
+    def add_header(self, header):
+        self.headers_map[header.sha256] = header
+
+    def get_blocks(self, inv):
+        responses = []
+        for i in inv:
+            if (i.type == 2): # MSG_BLOCK
+                block = self.get(i.hash)
+                if block is not None:
+                    responses.append(msg_block(block))
+        return responses
+
+    def get_locator(self, current_tip=None):
+        if current_tip is None:
+            current_tip = self.currentBlock
+        r = []
+        counter = 0
+        step = 1
+        lastBlock = self.get(current_tip)
+        while lastBlock is not None:
+            r.append(lastBlock.hashPrevBlock)
+            for i in range(step):
+                lastBlock = self.get(lastBlock.hashPrevBlock)
+                if lastBlock is None:
+                    break
+            counter += 1
+            if counter > 10:
+                step *= 2
+        locator = CBlockLocator()
+        locator.vHave = r
+        return locator
+
+class TxStore(object):
+    def __init__(self, datadir):
+        self.txDB = dbm.ndbm.open(datadir + "/transactions", 'c')
+
+    def close(self):
+        self.txDB.close()
+
+    def get(self, txhash):
+        serialized_tx = None
+        try:
+            serialized_tx = self.txDB[repr(txhash)]
+        except KeyError:
+            return None
+        f = BytesIO(serialized_tx)
+        ret = CTransaction()
+        ret.deserialize(f)
+        ret.calc_sha256()
+        return ret
+
+    def add_transaction(self, tx):
+        tx.calc_sha256()
+        try:
+            self.txDB[repr(tx.sha256)] = bytes(tx.serialize())
+        except TypeError as e:
+            print("Unexpected error: ", sys.exc_info()[0], e.args)
+
+    def get_transactions(self, inv):
+        responses = []
+        for i in inv:
+            if (i.type == 1): # MSG_TX
+                tx = self.get(i.hash)
+                if tx is not None:
+                    responses.append(msg_tx(tx))
+        return responses
diff --git a/depend/zcash/qa/rpc-tests/test_framework/blocktools.py b/depend/zcash/qa/rpc-tests/test_framework/blocktools.py
new file mode 100644
index 000000000..107075aca
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/test_framework/blocktools.py
@@ -0,0 +1,96 @@
+#!/usr/bin/env python3
+# blocktools.py - utilities for manipulating blocks and transactions
+# Copyright (c) 2015-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from hashlib import blake2b
+
+from .mininode import CBlock, CTransaction, CTxIn, CTxOut, COutPoint
+from .script import CScript, OP_0, OP_EQUAL, OP_HASH160, OP_TRUE, OP_CHECKSIG
+
+# Create a block (with regtest difficulty)
+def create_block(hashprev, coinbase, nTime=None, nBits=None, hashFinalSaplingRoot=None):
+    block = CBlock()
+    if nTime is None:
+        import time
+        block.nTime = int(time.time()+600)
+    else:
+        block.nTime = nTime
+    block.hashPrevBlock = hashprev
+    if hashFinalSaplingRoot is None:
+        # By default NUs up to Sapling are active from block 1, so we set this to the empty root.
+        hashFinalSaplingRoot = 0x3e49b5f954aa9d3545bc6c37744661eea48d7c34e3000d82b7f0010c30f4c2fb
+    block.hashFinalSaplingRoot = hashFinalSaplingRoot
+    if nBits is None:
+        block.nBits = 0x200f0f0f # difficulty retargeting is disabled in REGTEST chainparams
+    else:
+        block.nBits = nBits
+    block.vtx.append(coinbase)
+    block.hashMerkleRoot = block.calc_merkle_root()
+    block.hashAuthDataRoot = block.calc_auth_data_root()
+    block.calc_sha256()
+    return block
+
+def derive_block_commitments_hash(chain_history_root, auth_data_root):
+    digest = blake2b(
+        digest_size=32,
+        person=b'ZcashBlockCommit')
+    digest.update(chain_history_root)
+    digest.update(auth_data_root)
+    digest.update(b'\x00' * 32)
+    return digest.digest()
+
+def serialize_script_num(value):
+    r = bytearray(0)
+    if value == 0:
+        return r
+    neg = value < 0
+    absvalue = -value if neg else value
+    while (absvalue):
+        r.append(int(absvalue & 0xff))
+        absvalue >>= 8
+    if r[-1] & 0x80:
+        r.append(0x80 if neg else 0)
+    elif neg:
+        r[-1] |= 0x80
+    return r
+
+# Create a coinbase transaction, assuming no miner fees.
+# If pubkey is passed in, the coinbase output will be a P2PK output;
+# otherwise an anyone-can-spend output.
+def create_coinbase(height, pubkey = None):
+    coinbase = CTransaction()
+    coinbase.vin.append(CTxIn(COutPoint(0, 0xffffffff),
+                CScript([height, OP_0]), 0xffffffff))
+    coinbaseoutput = CTxOut()
+    coinbaseoutput.nValue = int(12.5*100000000)
+    halvings = int(height/150) # regtest
+    coinbaseoutput.nValue >>= halvings
+    if (pubkey != None):
+        coinbaseoutput.scriptPubKey = CScript([pubkey, OP_CHECKSIG])
+    else:
+        coinbaseoutput.scriptPubKey = CScript([OP_TRUE])
+    coinbase.vout = [ coinbaseoutput ]
+    if halvings == 0: # regtest
+        froutput = CTxOut()
+        froutput.nValue = coinbaseoutput.nValue // 5
+        # regtest
+        fraddr = bytearray([0x67, 0x08, 0xe6, 0x67, 0x0d, 0xb0, 0xb9, 0x50,
+                            0xda, 0xc6, 0x80, 0x31, 0x02, 0x5c, 0xc5, 0xb6,
+                            0x32, 0x13, 0xa4, 0x91])
+        froutput.scriptPubKey = CScript([OP_HASH160, fraddr, OP_EQUAL])
+        coinbaseoutput.nValue -= froutput.nValue
+        coinbase.vout = [ coinbaseoutput, froutput ]
+    coinbase.calc_sha256()
+    return coinbase
+
+# Create a transaction with an anyone-can-spend output, that spends the
+# nth output of prevtx.
+def create_transaction(prevtx, n, sig, value):
+    tx = CTransaction()
+    assert(n < len(prevtx.vout))
+    tx.vin.append(CTxIn(COutPoint(prevtx.sha256, n), sig, 0xffffffff))
+    tx.vout.append(CTxOut(value, b""))
+    tx.calc_sha256()
+    return tx
diff --git a/depend/zcash/qa/rpc-tests/test_framework/comptool.py b/depend/zcash/qa/rpc-tests/test_framework/comptool.py
new file mode 100755
index 000000000..a09fbfe20
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/test_framework/comptool.py
@@ -0,0 +1,429 @@
+#!/usr/bin/env python3
+# Copyright (c) 2015-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from .blockstore import BlockStore, TxStore
+from .mininode import (
+    CBlock,
+    CBlockHeader,
+    CTransaction,
+    CInv,
+    msg_block,
+    msg_getheaders,
+    msg_inv,
+    msg_mempool,
+    msg_ping,
+    mininode_lock,
+    MAX_INV_SZ,
+    NodeConn,
+    NodeConnCB,
+)
+from .util import p2p_port
+
+import time
+
+'''
+This is a tool for comparing two or more bitcoinds to each other
+using a script provided.
+
+To use, create a class that implements get_tests(), and pass it in
+as the test generator to TestManager.  get_tests() should be a python
+generator that returns TestInstance objects.  See below for definition.
+
+In practice get_tests is always implemented on a subclass of ComparisonTestFramework.
+'''
+
+# TestNode behaves as follows:
+# Configure with a BlockStore and TxStore
+# on_inv: log the message but don't request
+# on_headers: log the chain tip
+# on_pong: update ping response map (for synchronization)
+# on_getheaders: provide headers via BlockStore
+# on_getdata: provide blocks via BlockStore
+
+def wait_until(predicate, attempts=float('inf'), timeout=float('inf')):
+    attempt = 0
+    elapsed = 0
+
+    while attempt < attempts and elapsed < timeout:
+        with mininode_lock:
+            if predicate():
+                return True
+        attempt += 1
+        elapsed += 0.05
+        time.sleep(0.05)
+
+    return False
+
+class RejectResult(object):
+    '''
+    Outcome that expects rejection of a transaction or block.
+    '''
+    def __init__(self, code, reason=b''):
+        self.code = code
+        self.reason = reason
+    def match(self, other):
+        if self.code != other.code:
+            return False
+        return other.reason.startswith(self.reason)
+    def __repr__(self):
+        return '%i:%s' % (self.code,self.reason or '*')
+
+class TestNode(NodeConnCB):
+
+    def __init__(self, block_store, tx_store):
+        NodeConnCB.__init__(self)
+        self.create_callback_map()
+        self.conn = None
+        self.bestblockhash = None
+        self.block_store = block_store
+        self.block_request_map = {}
+        self.tx_store = tx_store
+        self.tx_request_map = {}
+        self.block_reject_map = {}
+        self.tx_reject_map = {}
+
+        # When the pingmap is non-empty we're waiting for 
+        # a response
+        self.pingMap = {} 
+        self.lastInv = []
+        self.closed = False
+
+    def on_close(self, conn):
+        self.closed = True
+
+    def add_connection(self, conn):
+        self.conn = conn
+
+    def on_headers(self, conn, message):
+        if len(message.headers) > 0:
+            best_header = message.headers[-1]
+            best_header.calc_sha256()
+            self.bestblockhash = best_header.sha256
+
+    def on_getheaders(self, conn, message):
+        response = self.block_store.headers_for(message.locator, message.hashstop)
+        if response is not None:
+            conn.send_message(response)
+
+    def on_getdata(self, conn, message):
+        [conn.send_message(r) for r in self.block_store.get_blocks(message.inv)]
+        [conn.send_message(r) for r in self.tx_store.get_transactions(message.inv)]
+
+        for i in message.inv:
+            if i.type == 1:
+                self.tx_request_map[i.hash] = True
+            elif i.type == 2:
+                self.block_request_map[i.hash] = True
+
+    def on_inv(self, conn, message):
+        self.lastInv = [x.hash for x in message.inv]
+
+    def on_pong(self, conn, message):
+        try:
+            del self.pingMap[message.nonce]
+        except KeyError:
+            raise AssertionError("Got pong for unknown ping [%s]" % repr(message))
+
+    def on_reject(self, conn, message):
+        if message.message == b'tx':
+            self.tx_reject_map[message.data] = RejectResult(message.code, message.reason)
+        if message.message == b'block':
+            self.block_reject_map[message.data] = RejectResult(message.code, message.reason)
+
+    def send_inv(self, obj):
+        mtype = 2 if isinstance(obj, CBlock) else 1
+        self.conn.send_message(msg_inv([CInv(mtype, obj.sha256)]))
+
+    def send_getheaders(self):
+        # We ask for headers from their last tip.
+        m = msg_getheaders()
+        m.locator = self.block_store.get_locator(self.bestblockhash)
+        self.conn.send_message(m)
+
+    # This assumes BIP31
+    def send_ping(self, nonce):
+        self.pingMap[nonce] = True
+        self.conn.send_message(msg_ping(nonce))
+
+    def received_ping_response(self, nonce):
+        return nonce not in self.pingMap
+
+    def send_mempool(self):
+        self.lastInv = []
+        self.conn.send_message(msg_mempool())
+
+# TestInstance:
+#
+# Instances of these are generated by the test generator, and fed into the
+# comptool.
+#
+# "blocks_and_transactions" should be an array of
+#    [obj, True/False/None, hash/None]:
+#  - obj is either a CBlock, CBlockHeader, or a CTransaction, and
+#  - the second value indicates whether the object should be accepted
+#    into the blockchain or mempool (for tests where we expect a certain
+#    answer), or "None" if we don't expect a certain answer and are just
+#    comparing the behavior of the nodes being tested.
+#  - the third value is the hash to test the tip against (if None or omitted,
+#    use the hash of the block)
+#  - NOTE: if a block header, no test is performed; instead the header is
+#    just added to the block_store.  This is to facilitate block delivery
+#    when communicating with headers-first clients (when withholding an
+#    intermediate block).
+# sync_every_block: if True, then each block will be inv'ed, synced, and
+#    nodes will be tested based on the outcome for the block.  If False,
+#    then inv's accumulate until all blocks are processed (or max inv size
+#    is reached) and then sent out in one inv message.  Then the final block
+#    will be synced across all connections, and the outcome of the final 
+#    block will be tested.
+# sync_every_tx: analogous to behavior for sync_every_block, except if outcome
+#    on the final tx is None, then contents of entire mempool are compared
+#    across all connections.  (If outcome of final tx is specified as true
+#    or false, then only the last tx is tested against outcome.)
+
+class TestInstance(object):
+    def __init__(self, objects=None, sync_every_block=True, sync_every_tx=False):
+        self.blocks_and_transactions = objects if objects else []
+        self.sync_every_block = sync_every_block
+        self.sync_every_tx = sync_every_tx
+
+class TestManager(object):
+
+    def __init__(self, testgen, datadir):
+        self.test_generator = testgen
+        self.connections    = []
+        self.test_nodes     = []
+        self.block_store    = BlockStore(datadir)
+        self.tx_store       = TxStore(datadir)
+        self.ping_counter   = 1
+
+    def add_all_connections(self, nodes):
+        for i in range(len(nodes)):
+            # Create a p2p connection to each node
+            test_node = TestNode(self.block_store, self.tx_store)
+            self.test_nodes.append(test_node)
+            self.connections.append(NodeConn('127.0.0.1', p2p_port(i), nodes[i], test_node))
+            # Make sure the TestNode (callback class) has a reference to its
+            # associated NodeConn
+            test_node.add_connection(self.connections[-1])
+
+    def wait_for_disconnections(self):
+        def disconnected():
+            return all(node.closed for node in self.test_nodes)
+        return wait_until(disconnected, timeout=10)
+
+    def wait_for_verack(self):
+        def veracked():
+            return all(node.verack_received for node in self.test_nodes)
+        return wait_until(veracked, timeout=10)
+
+    def wait_for_pings(self, counter):
+        def received_pongs():
+            return all(node.received_ping_response(counter) for node in self.test_nodes)
+        return wait_until(received_pongs)
+
+    # sync_blocks: Wait for all connections to request the blockhash given
+    # then send get_headers to find out the tip of each node, and synchronize
+    # the response by using a ping (and waiting for pong with same nonce).
+    def sync_blocks(self, blockhash, num_blocks):
+        def blocks_requested():
+            return all(
+                blockhash in node.block_request_map and node.block_request_map[blockhash]
+                for node in self.test_nodes
+            )
+
+        # --> error if not requested
+        if not wait_until(blocks_requested, attempts=20*num_blocks):
+            # print [ c.cb.block_request_map for c in self.connections ]
+            raise AssertionError("Not all nodes requested block")
+
+        # Send getheaders message
+        [ c.cb.send_getheaders() for c in self.connections ]
+
+        # Send ping and wait for response -- synchronization hack
+        [ c.cb.send_ping(self.ping_counter) for c in self.connections ]
+        self.wait_for_pings(self.ping_counter)
+        self.ping_counter += 1
+
+    # Analogous to sync_block (see above)
+    def sync_transaction(self, txhash, num_events):
+        # Wait for nodes to request transaction (50ms sleep * 20 tries * num_events)
+        def transaction_requested():
+            return all(
+                txhash in node.tx_request_map and node.tx_request_map[txhash]
+                for node in self.test_nodes
+            )
+
+        # --> error if not requested
+        if not wait_until(transaction_requested, attempts=20*num_events):
+            # print [ c.cb.tx_request_map for c in self.connections ]
+            raise AssertionError("Not all nodes requested transaction")
+
+        # Get the mempool
+        [ c.cb.send_mempool() for c in self.connections ]
+
+        # Send ping and wait for response -- synchronization hack
+        [ c.cb.send_ping(self.ping_counter) for c in self.connections ]
+        self.wait_for_pings(self.ping_counter)
+        self.ping_counter += 1
+
+        # Sort inv responses from each node
+        with mininode_lock:
+            [ c.cb.lastInv.sort() for c in self.connections ]
+
+    # Verify that the tip of each connection all agree with each other, and
+    # with the expected outcome (if given)
+    def check_results(self, blockhash, outcome):
+        with mininode_lock:
+            for c in self.connections:
+                if outcome is None:
+                    if c.cb.bestblockhash != self.connections[0].cb.bestblockhash:
+                        return False
+                elif isinstance(outcome, RejectResult): # Check that block was rejected w/ code
+                    if c.cb.bestblockhash == blockhash:
+                        return False
+                    if blockhash not in c.cb.block_reject_map:
+                        print('Block not in reject map: %064x' % (blockhash))
+                        return False
+                    if not outcome.match(c.cb.block_reject_map[blockhash]):
+                        print('Block rejected with %s instead of expected %s: %064x' % (c.cb.block_reject_map[blockhash], outcome, blockhash))
+                        return False
+                elif ((c.cb.bestblockhash == blockhash) != outcome):
+                    if outcome is True and blockhash in c.cb.block_reject_map:
+                        print('Block rejected with %s instead of accepted: %064x' % (c.cb.block_reject_map[blockhash], blockhash))
+                    return False
+            return True
+
+    # Either check that the mempools all agree with each other, or that
+    # txhash's presence in the mempool matches the outcome specified.
+    # This is somewhat of a strange comparison, in that we're either comparing
+    # a particular tx to an outcome, or the entire mempools altogether;
+    # perhaps it would be useful to add the ability to check explicitly that
+    # a particular tx's existence in the mempool is the same across all nodes.
+    def check_mempool(self, txhash, outcome):
+        with mininode_lock:
+            for c in self.connections:
+                if outcome is None:
+                    # Make sure the mempools agree with each other
+                    if c.cb.lastInv != self.connections[0].cb.lastInv:
+                        # print c.rpc.getrawmempool()
+                        return False
+                elif isinstance(outcome, RejectResult): # Check that tx was rejected w/ code
+                    if txhash in c.cb.lastInv:
+                        return False
+                    if txhash not in c.cb.tx_reject_map:
+                        print('Tx not in reject map: %064x' % (txhash))
+                        return False
+                    if not outcome.match(c.cb.tx_reject_map[txhash]):
+                        print('Tx rejected with %s instead of expected %s: %064x' % (c.cb.tx_reject_map[txhash], outcome, txhash))
+                        return False
+                elif ((txhash in c.cb.lastInv) != outcome):
+                    # print c.rpc.getrawmempool(), c.cb.lastInv
+                    return False
+            return True
+
+    def run(self):
+        # Wait until verack is received
+        self.wait_for_verack()
+
+        test_number = 1
+        for test_instance in self.test_generator.get_tests():
+            # We use these variables to keep track of the last block
+            # and last transaction in the tests, which are used
+            # if we're not syncing on every block or every tx.
+            [ block, block_outcome, tip ] = [ None, None, None ]
+            [ tx, tx_outcome ] = [ None, None ]
+            invqueue = []
+
+            for test_obj in test_instance.blocks_and_transactions:
+                b_or_t = test_obj[0]
+                outcome = test_obj[1]
+                # Determine if we're dealing with a block or tx
+                if isinstance(b_or_t, CBlock):  # Block test runner
+                    block = b_or_t
+                    block_outcome = outcome
+                    tip = block.sha256
+                    # each test_obj can have an optional third argument
+                    # to specify the tip we should compare with
+                    # (default is to use the block being tested)
+                    if len(test_obj) >= 3:
+                        tip = test_obj[2]
+
+                    # Add to shared block_store, set as current block
+                    # If there was an open getdata request for the block
+                    # previously, and we didn't have an entry in the
+                    # block_store, then immediately deliver, because the
+                    # node wouldn't send another getdata request while
+                    # the earlier one is outstanding.
+                    first_block_with_hash = True
+                    if self.block_store.get(block.sha256) is not None:
+                        first_block_with_hash = False
+                    with mininode_lock:
+                        self.block_store.add_block(block)
+                        for c in self.connections:
+                            if first_block_with_hash and block.sha256 in c.cb.block_request_map and c.cb.block_request_map[block.sha256] == True:
+                                # There was a previous request for this block hash
+                                # Most likely, we delivered a header for this block
+                                # but never had the block to respond to the getdata
+                                c.send_message(msg_block(block))
+                            else:
+                                c.cb.block_request_map[block.sha256] = False
+                    # Either send inv's to each node and sync, or add
+                    # to invqueue for later inv'ing.
+                    if (test_instance.sync_every_block):
+                        [ c.cb.send_inv(block) for c in self.connections ]
+                        self.sync_blocks(block.sha256, 1)
+                        if (not self.check_results(tip, outcome)):
+                            raise AssertionError("Test failed at test %d" % test_number)
+                    else:
+                        invqueue.append(CInv(2, block.sha256))
+                elif isinstance(b_or_t, CBlockHeader):
+                    block_header = b_or_t
+                    self.block_store.add_header(block_header)
+                else:  # Tx test runner
+                    assert(isinstance(b_or_t, CTransaction))
+                    tx = b_or_t
+                    tx_outcome = outcome
+                    # Add to shared tx store and clear map entry
+                    with mininode_lock:
+                        self.tx_store.add_transaction(tx)
+                        for c in self.connections:
+                            c.cb.tx_request_map[tx.sha256] = False
+                    # Again, either inv to all nodes or save for later
+                    if (test_instance.sync_every_tx):
+                        [ c.cb.send_inv(tx) for c in self.connections ]
+                        self.sync_transaction(tx.sha256, 1)
+                        if (not self.check_mempool(tx.sha256, outcome)):
+                            raise AssertionError("Test failed at test %d" % test_number)
+                    else:
+                        invqueue.append(CInv(1, tx.sha256))
+                # Ensure we're not overflowing the inv queue
+                if len(invqueue) == MAX_INV_SZ:
+                    [ c.send_message(msg_inv(invqueue)) for c in self.connections ]
+                    invqueue = []
+
+            # Do final sync if we weren't syncing on every block or every tx.
+            if (not test_instance.sync_every_block and block is not None):
+                if len(invqueue) > 0:
+                    [ c.send_message(msg_inv(invqueue)) for c in self.connections ]
+                    invqueue = []
+                self.sync_blocks(block.sha256, len(test_instance.blocks_and_transactions))
+                if (not self.check_results(tip, block_outcome)):
+                    raise AssertionError("Block test failed at test %d" % test_number)
+            if (not test_instance.sync_every_tx and tx is not None):
+                if len(invqueue) > 0:
+                    [ c.send_message(msg_inv(invqueue)) for c in self.connections ]
+                    invqueue = []
+                self.sync_transaction(tx.sha256, len(test_instance.blocks_and_transactions))
+                if (not self.check_mempool(tx.sha256, tx_outcome)):
+                    raise AssertionError("Mempool test failed at test %d" % test_number)
+
+            print("Test %d: PASS" % test_number, [ c.rpc.getblockcount() for c in self.connections ])
+            test_number += 1
+
+        [ c.disconnect_node() for c in self.connections ]
+        self.wait_for_disconnections()
+        self.block_store.close()
+        self.tx_store.close()
diff --git a/depend/zcash/qa/rpc-tests/test_framework/coverage.py b/depend/zcash/qa/rpc-tests/test_framework/coverage.py
new file mode 100644
index 000000000..d36f14ab0
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/test_framework/coverage.py
@@ -0,0 +1,106 @@
+#!/usr/bin/env python3
+# Copyright (c) 2015-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+"""
+This module contains utilities for doing coverage analysis on the RPC
+interface.
+
+It provides a way to track which RPC commands are exercised during
+testing.
+
+"""
+import os
+
+
+REFERENCE_FILENAME = 'rpc_interface.txt'
+
+
+class AuthServiceProxyWrapper(object):
+    """
+    An object that wraps AuthServiceProxy to record specific RPC calls.
+
+    """
+    def __init__(self, auth_service_proxy_instance, coverage_logfile=None):
+        """
+        Kwargs:
+            auth_service_proxy_instance (AuthServiceProxy): the instance
+                being wrapped.
+            coverage_logfile (str): if specified, write each service_name
+                out to a file when called.
+
+        """
+        self.auth_service_proxy_instance = auth_service_proxy_instance
+        self.coverage_logfile = coverage_logfile
+
+    def __getattr__(self, *args, **kwargs):
+        return_val = self.auth_service_proxy_instance.__getattr__(
+            *args, **kwargs)
+
+        return AuthServiceProxyWrapper(return_val, self.coverage_logfile)
+
+    def __call__(self, *args, **kwargs):
+        """
+        Delegates to AuthServiceProxy, then writes the particular RPC method
+        called to a file.
+
+        """
+        return_val = self.auth_service_proxy_instance.__call__(*args, **kwargs)
+        rpc_method = self.auth_service_proxy_instance._service_name
+
+        if self.coverage_logfile:
+            with open(self.coverage_logfile, 'a+', encoding='utf8') as f:
+                f.write("%s\n" % rpc_method)
+
+        return return_val
+
+    @property
+    def url(self):
+        return self.auth_service_proxy_instance.url
+
+
+def get_filename(dirname, n_node):
+    """
+    Get a filename unique to the test process ID and node.
+
+    This file will contain a list of RPC commands covered.
+    """
+    pid = str(os.getpid())
+    return os.path.join(
+        dirname, "coverage.pid%s.node%s.txt" % (pid, str(n_node)))
+
+
+def write_all_rpc_commands(dirname, node):
+    """
+    Write out a list of all RPC functions available in `bitcoin-cli` for
+    coverage comparison. This will only happen once per coverage
+    directory.
+
+    Args:
+        dirname (str): temporary test dir
+        node (AuthServiceProxy): client
+
+    Returns:
+        bool. if the RPC interface file was written.
+
+    """
+    filename = os.path.join(dirname, REFERENCE_FILENAME)
+
+    if os.path.isfile(filename):
+        return False
+
+    help_output = node.help().split('\n')
+    commands = set()
+
+    for line in help_output:
+        line = line.strip()
+
+        # Ignore blanks and headers
+        if line and not line.startswith('='):
+            commands.add("%s\n" % line.split()[0])
+
+    with open(filename, 'w', encoding='utf8') as f:
+        f.writelines(list(commands))
+
+    return True
diff --git a/depend/zcash/qa/rpc-tests/test_framework/equihash.py b/depend/zcash/qa/rpc-tests/test_framework/equihash.py
new file mode 100755
index 000000000..e05544fb4
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/test_framework/equihash.py
@@ -0,0 +1,294 @@
+from operator import itemgetter
+import struct
+from functools import reduce
+
+DEBUG = False
+VERBOSE = False
+
+
+word_size = 32
+word_mask = (1<<word_size)-1
+
+def expand_array(inp, out_len, bit_len, byte_pad=0):
+    assert bit_len >= 8 and word_size >= 7+bit_len
+    bit_len_mask = (1<<bit_len)-1
+
+    out_width = (bit_len+7)//8 + byte_pad
+    assert out_len == 8*out_width*len(inp)//bit_len
+    out = bytearray(out_len)
+
+    bit_len_mask = (1 << bit_len) - 1
+
+    # The acc_bits least-significant bits of acc_value represent a bit sequence
+    # in big-endian order.
+    acc_bits = 0;
+    acc_value = 0;
+
+    j = 0
+    for i in range(len(inp)):
+        acc_value = ((acc_value << 8) & word_mask) | inp[i]
+        acc_bits += 8
+
+        # When we have bit_len or more bits in the accumulator, write the next
+        # output element.
+        if acc_bits >= bit_len:
+            acc_bits -= bit_len
+            for x in range(byte_pad, out_width):
+                out[j+x] = (
+                    # Big-endian
+                    acc_value >> (acc_bits+(8*(out_width-x-1)))
+                ) & (
+                    # Apply bit_len_mask across byte boundaries
+                    (bit_len_mask >> (8*(out_width-x-1))) & 0xFF
+                )
+            j += out_width
+
+    return out
+
+def compress_array(inp, out_len, bit_len, byte_pad=0):
+    assert bit_len >= 8 and word_size >= 7+bit_len
+
+    in_width = (bit_len+7)//8 + byte_pad
+    assert out_len == bit_len*len(inp)//(8*in_width)
+    out = bytearray(out_len)
+
+    bit_len_mask = (1 << bit_len) - 1
+
+    # The acc_bits least-significant bits of acc_value represent a bit sequence
+    # in big-endian order.
+    acc_bits = 0;
+    acc_value = 0;
+
+    j = 0
+    for i in range(out_len):
+        # When we have fewer than 8 bits left in the accumulator, read the next
+        # input element.
+        if acc_bits < 8:
+            acc_value = ((acc_value << bit_len) & word_mask) | inp[j]
+            for x in range(byte_pad, in_width):
+                acc_value = acc_value | (
+                    (
+                        # Apply bit_len_mask across byte boundaries
+                        inp[j+x] & ((bit_len_mask >> (8*(in_width-x-1))) & 0xFF)
+                    ) << (8*(in_width-x-1))); # Big-endian
+            j += in_width
+            acc_bits += bit_len
+
+        acc_bits -= 8
+        out[i] = (acc_value >> acc_bits) & 0xFF
+
+    return out
+
+def get_indices_from_minimal(minimal, bit_len):
+    eh_index_size = 4
+    assert (bit_len+7)//8 <= eh_index_size
+    len_indices = 8*eh_index_size*len(minimal)//bit_len
+    byte_pad = eh_index_size - (bit_len+7)//8
+    expanded = expand_array(minimal, len_indices, bit_len, byte_pad)
+    return [struct.unpack('>I', expanded[i:i+4])[0] for i in range(0, len_indices, eh_index_size)]
+
+def get_minimal_from_indices(indices, bit_len):
+    eh_index_size = 4
+    assert (bit_len+7)//8 <= eh_index_size
+    len_indices = len(indices)*eh_index_size
+    min_len = bit_len*len_indices//(8*eh_index_size)
+    byte_pad = eh_index_size - (bit_len+7)//8
+    byte_indices = bytearray(b''.join([struct.pack('>I', i) for i in indices]))
+    return compress_array(byte_indices, min_len, bit_len, byte_pad)
+
+
+def hash_nonce(digest, nonce):
+    for i in range(8):
+        digest.update(struct.pack('<I', nonce >> (32*i)))
+
+def hash_xi(digest, xi):
+    digest.update(struct.pack('<I', xi))
+    return digest # For chaining
+
+def count_zeroes(h):
+    # Convert to binary string
+    if type(h) == bytearray:
+        h = ''.join('{0:08b}'.format(x) for x in h)
+    else:
+        h = ''.join('{0:08b}'.format(ord(x)) for x in h)
+    # Count leading zeroes
+    return (h+'1').index('1')
+
+def has_collision(ha, hb, i, l):
+    res = [ha[j] == hb[j] for j in range((i-1)*l//8, i*l//8)]
+    return reduce(lambda x, y: x and y, res)
+
+def distinct_indices(a, b):
+    for i in a:
+        for j in b:
+            if i == j:
+                return False
+    return True
+
+def xor(ha, hb):
+    return bytearray(a^b for a,b in zip(ha,hb))
+
+def gbp_basic(digest, n, k):
+    '''Implementation of Basic Wagner's algorithm for the GBP.'''
+    validate_params(n, k)
+    collision_length = n//(k+1)
+    hash_length = (k+1)*((collision_length+7)//8)
+    indices_per_hash_output = 512//n
+
+    # 1) Generate first list
+    if DEBUG: print('Generating first list')
+    X = []
+    tmp_hash = b''
+    for i in range(0, 2**(collision_length+1)):
+        r = i % indices_per_hash_output
+        if r == 0:
+            # X_i = H(I||V||x_i)
+            curr_digest = digest.copy()
+            hash_xi(curr_digest, i//indices_per_hash_output)
+            tmp_hash = curr_digest.digest()
+        X.append((
+            expand_array(bytearray(tmp_hash[r*n//8:(r+1)*n//8]),
+                         hash_length, collision_length),
+            (i,)
+        ))
+
+    # 3) Repeat step 2 until 2n/(k+1) bits remain
+    for i in range(1, k):
+        if DEBUG: print('Round %d:' % i)
+
+        # 2a) Sort the list
+        if DEBUG: print('- Sorting list')
+        X.sort(key=itemgetter(0))
+        if DEBUG and VERBOSE:
+            for Xi in X[-32:]:
+                print('%s %s' % (print_hash(Xi[0]), Xi[1]))
+
+        if DEBUG: print('- Finding collisions')
+        Xc = []
+        while len(X) > 0:
+            # 2b) Find next set of unordered pairs with collisions on first n/(k+1) bits
+            j = 1
+            while j < len(X):
+                if not has_collision(X[-1][0], X[-1-j][0], i, collision_length):
+                    break
+                j += 1
+
+            # 2c) Store tuples (X_i ^ X_j, (i, j)) on the table
+            for l in range(0, j-1):
+                for m in range(l+1, j):
+                    # Check that there are no duplicate indices in tuples i and j
+                    if distinct_indices(X[-1-l][1], X[-1-m][1]):
+                        if X[-1-l][1][0] < X[-1-m][1][0]:
+                            concat = X[-1-l][1] + X[-1-m][1]
+                        else:
+                            concat = X[-1-m][1] + X[-1-l][1]
+                        Xc.append((xor(X[-1-l][0], X[-1-m][0]), concat))
+
+            # 2d) Drop this set
+            while j > 0:
+                X.pop(-1)
+                j -= 1
+        # 2e) Replace previous list with new list
+        X = Xc
+
+    # k+1) Find a collision on last 2n(k+1) bits
+    if DEBUG:
+        print('Final round:')
+        print('- Sorting list')
+    X.sort(key=itemgetter(0))
+    if DEBUG and VERBOSE:
+        for Xi in X[-32:]:
+            print('%s %s' % (print_hash(Xi[0]), Xi[1]))
+    if DEBUG: print('- Finding collisions')
+    solns = []
+    while len(X) > 0:
+        j = 1
+        while j < len(X):
+            if not (has_collision(X[-1][0], X[-1-j][0], k, collision_length) and
+                    has_collision(X[-1][0], X[-1-j][0], k+1, collision_length)):
+                break
+            j += 1
+
+        for l in range(0, j-1):
+            for m in range(l+1, j):
+                res = xor(X[-1-l][0], X[-1-m][0])
+                if count_zeroes(res) == 8*hash_length and distinct_indices(X[-1-l][1], X[-1-m][1]):
+                    if DEBUG and VERBOSE:
+                        print('Found solution:')
+                        print('- %s %s' % (print_hash(X[-1-l][0]), X[-1-l][1]))
+                        print('- %s %s' % (print_hash(X[-1-m][0]), X[-1-m][1]))
+                    if X[-1-l][1][0] < X[-1-m][1][0]:
+                        solns.append(list(X[-1-l][1] + X[-1-m][1]))
+                    else:
+                        solns.append(list(X[-1-m][1] + X[-1-l][1]))
+
+        # 2d) Drop this set
+        while j > 0:
+            X.pop(-1)
+            j -= 1
+    return [get_minimal_from_indices(soln, collision_length+1) for soln in solns]
+
+def gbp_validate(digest, minimal, n, k):
+    validate_params(n, k)
+    collision_length = n//(k+1)
+    hash_length = (k+1)*((collision_length+7)//8)
+    indices_per_hash_output = 512//n
+    solution_width = (1 << k)*(collision_length+1)//8
+
+    if len(minimal) != solution_width:
+        print('Invalid solution length: %d (expected %d)' % \
+            (len(minimal), solution_width))
+        return False
+
+    X = []
+    for i in get_indices_from_minimal(minimal, collision_length+1):
+        r = i % indices_per_hash_output
+        # X_i = H(I||V||x_i)
+        curr_digest = digest.copy()
+        hash_xi(curr_digest, i//indices_per_hash_output)
+        tmp_hash = curr_digest.digest()
+        X.append((
+            expand_array(bytearray(tmp_hash[r*n//8:(r+1)*n//8]),
+                         hash_length, collision_length),
+            (i,)
+        ))
+
+    for r in range(1, k+1):
+        Xc = []
+        for i in range(0, len(X), 2):
+            if not has_collision(X[i][0], X[i+1][0], r, collision_length):
+                print('Invalid solution: invalid collision length between StepRows')
+                return False
+            if X[i+1][1][0] < X[i][1][0]:
+                print('Invalid solution: Index tree incorrectly ordered')
+                return False
+            if not distinct_indices(X[i][1], X[i+1][1]):
+                print('Invalid solution: duplicate indices')
+                return False
+            Xc.append((xor(X[i][0], X[i+1][0]), X[i][1] + X[i+1][1]))
+        X = Xc
+
+    if len(X) != 1:
+        print('Invalid solution: incorrect length after end of rounds: %d' % len(X))
+        return False
+
+    if count_zeroes(X[0][0]) != 8*hash_length:
+        print('Invalid solution: incorrect number of zeroes: %d' % count_zeroes(X[0][0]))
+        return False
+
+    return True
+
+def zcash_person(n, k):
+    return b'ZcashPoW' + struct.pack('<II', n, k)
+
+def print_hash(h):
+    if type(h) == bytearray:
+        return ''.join('{0:02x}'.format(x) for x in h)
+    else:
+        return ''.join('{0:02x}'.format(ord(x)) for x in h)
+
+def validate_params(n, k):
+    if (k >= n):
+        raise ValueError('n must be larger than k')
+    if (((n//(k+1))+1) >= 32):
+        raise ValueError('Parameters must satisfy n/(k+1)+1 < 32')
diff --git a/depend/zcash/qa/rpc-tests/test_framework/flyclient.py b/depend/zcash/qa/rpc-tests/test_framework/flyclient.py
new file mode 100644
index 000000000..4e01cf76c
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/test_framework/flyclient.py
@@ -0,0 +1,210 @@
+from hashlib import blake2b
+import struct
+from typing import (List, Optional)
+
+from .mininode import (CBlockHeader, block_work_from_compact, ser_compactsize, ser_uint256)
+from .util import (
+    NU5_BRANCH_ID,
+    assert_equal,
+)
+
+def H(msg: bytes, consensusBranchId: int) -> bytes:
+    digest = blake2b(
+        digest_size=32,
+        person=b'ZcashHistory' + struct.pack("<I", consensusBranchId))
+    digest.update(msg)
+    return digest.digest()
+
+class ZcashMMRNode():
+    # leaf nodes have no children
+    left_child: Optional['ZcashMMRNode']
+    right_child: Optional['ZcashMMRNode']
+
+    # commitments
+    hashSubtreeCommitment: bytes
+    nEarliestTimestamp: int
+    nLatestTimestamp: int
+    nEarliestTargetBits: int
+    nLatestTargetBits: int
+    hashEarliestSaplingRoot: bytes # left child's sapling root
+    hashLatestSaplingRoot: bytes # right child's sapling root
+    nSubTreeTotalWork: int # total difficulty accumulated within each subtree
+    nEarliestHeight: int
+    nLatestHeight: int
+    nSaplingTxCount: int # number of Sapling transactions in block
+    # NU5 only.
+    hashEarliestOrchardRoot: Optional[bytes] # left child's Orchard root
+    hashLatestOrchardRoot: Optional[bytes] # right child's Orchard root
+    nOrchardTxCount: Optional[int] # number of Orchard transactions in block
+
+    consensusBranchId: bytes
+
+    @classmethod
+    def from_block(
+        Z, block: CBlockHeader, height,
+        sapling_root, sapling_tx_count,
+        consensusBranchId,
+        v2_data=None
+    ) -> 'ZcashMMRNode':
+        '''Create a leaf node from a block'''
+        if v2_data is not None:
+            assert_equal(consensusBranchId, NU5_BRANCH_ID)
+            orchard_root = v2_data[0]
+            orchard_tx_count = v2_data[1]
+        else:
+            orchard_root = None
+            orchard_tx_count = None
+
+        node = Z()
+        node.left_child = None
+        node.right_child = None
+        node.hashSubtreeCommitment = ser_uint256(block.rehash())
+        node.nEarliestTimestamp = block.nTime
+        node.nLatestTimestamp = block.nTime
+        node.nEarliestTargetBits = block.nBits
+        node.nLatestTargetBits = block.nBits
+        node.hashEarliestSaplingRoot = sapling_root
+        node.hashLatestSaplingRoot = sapling_root
+        node.nSubTreeTotalWork = block_work_from_compact(block.nBits)
+        node.nEarliestHeight = height
+        node.nLatestHeight = height
+        node.nSaplingTxCount = sapling_tx_count
+        node.hashEarliestOrchardRoot = orchard_root
+        node.hashLatestOrchardRoot = orchard_root
+        node.nOrchardTxCount = orchard_tx_count
+        node.consensusBranchId = consensusBranchId
+        return node
+
+    def serialize(self) -> bytes:
+        '''serializes a node'''
+        buf = b''
+        buf += self.hashSubtreeCommitment
+        buf += struct.pack("<I", self.nEarliestTimestamp)
+        buf += struct.pack("<I", self.nLatestTimestamp)
+        buf += struct.pack("<I", self.nEarliestTargetBits)
+        buf += struct.pack("<I", self.nLatestTargetBits)
+        buf += self.hashEarliestSaplingRoot
+        buf += self.hashLatestSaplingRoot
+        buf += ser_uint256(self.nSubTreeTotalWork)
+        buf += ser_compactsize(self.nEarliestHeight)
+        buf += ser_compactsize(self.nLatestHeight)
+        buf += ser_compactsize(self.nSaplingTxCount)
+        if self.hashEarliestOrchardRoot is not None:
+            buf += self.hashEarliestOrchardRoot
+            buf += self.hashLatestOrchardRoot
+            buf += ser_compactsize(self.nOrchardTxCount)
+        return buf
+
+def make_parent(
+        left_child: ZcashMMRNode,
+        right_child: ZcashMMRNode) -> ZcashMMRNode:
+    parent = ZcashMMRNode()
+    parent.left_child = left_child
+    parent.right_child = right_child
+    parent.hashSubtreeCommitment = H(
+        left_child.serialize() + right_child.serialize(),
+        left_child.consensusBranchId,
+    )
+    parent.nEarliestTimestamp = left_child.nEarliestTimestamp
+    parent.nLatestTimestamp = right_child.nLatestTimestamp
+    parent.nEarliestTargetBits = left_child.nEarliestTargetBits
+    parent.nLatestTargetBits = right_child.nLatestTargetBits
+    parent.hashEarliestSaplingRoot = left_child.hashEarliestSaplingRoot
+    parent.hashLatestSaplingRoot = right_child.hashLatestSaplingRoot
+    parent.nSubTreeTotalWork = left_child.nSubTreeTotalWork + right_child.nSubTreeTotalWork
+    parent.nEarliestHeight = left_child.nEarliestHeight
+    parent.nLatestHeight = right_child.nLatestHeight
+    parent.nSaplingTxCount = left_child.nSaplingTxCount + right_child.nSaplingTxCount
+    parent.hashEarliestOrchardRoot = left_child.hashEarliestOrchardRoot
+    parent.hashLatestOrchardRoot = right_child.hashLatestOrchardRoot
+    parent.nOrchardTxCount = (
+        left_child.nOrchardTxCount + right_child.nOrchardTxCount
+        if left_child.nOrchardTxCount is not None and right_child.nOrchardTxCount is not None
+        else None)
+    parent.consensusBranchId = left_child.consensusBranchId
+    return parent
+
+def make_root_commitment(root: ZcashMMRNode) -> bytes:
+    '''Makes the root commitment for a blockheader'''
+    return H(root.serialize(), root.consensusBranchId)
+
+def get_peaks(node: ZcashMMRNode) -> List[ZcashMMRNode]:
+    peaks: List[ZcashMMRNode] = []
+
+    # Get number of leaves.
+    leaves = node.nLatestHeight - (node.nEarliestHeight - 1)
+    assert(leaves > 0)
+
+    # Check if the number of leaves in this subtree is a power of two.
+    if (leaves & (leaves - 1)) == 0:
+        # This subtree is full, and therefore a single peak. This also covers
+        # the case of a single isolated leaf.
+        peaks.append(node)
+    else:
+        # This is one of the generated nodes; search within its children.
+        peaks.extend(get_peaks(node.left_child))
+        peaks.extend(get_peaks(node.right_child))
+
+    return peaks
+
+
+def bag_peaks(peaks: List[ZcashMMRNode]) -> ZcashMMRNode:
+    '''
+    "Bag" a list of peaks, and return the final root
+    '''
+    root = peaks[0]
+    for i in range(1, len(peaks)):
+        root = make_parent(root, peaks[i])
+    return root
+
+
+def append(root: ZcashMMRNode, leaf: ZcashMMRNode) -> ZcashMMRNode:
+    '''Append a leaf to an existing tree, return the new tree root'''
+    # recursively find a list of peaks in the current tree
+    peaks: List[ZcashMMRNode] = get_peaks(root)
+    merged: List[ZcashMMRNode] = []
+
+    # Merge peaks from right to left.
+    # This will produce a list of peaks in reverse order
+    current = leaf
+    for peak in peaks[::-1]:
+        current_leaves = current.nLatestHeight - (current.nEarliestHeight - 1)
+        peak_leaves = peak.nLatestHeight - (peak.nEarliestHeight - 1)
+
+        if current_leaves == peak_leaves:
+            current = make_parent(peak, current)
+        else:
+            merged.append(current)
+            current = peak
+    merged.append(current)
+
+    # finally, bag the merged peaks
+    return bag_peaks(merged[::-1])
+
+def delete(root: ZcashMMRNode) -> ZcashMMRNode:
+    '''
+    Delete the rightmost leaf node from an existing MMR
+    Return the new tree root
+    '''
+
+    n_leaves = root.nLatestHeight - (root.nEarliestHeight - 1)
+    # if there were an odd number of leaves,
+    # simply replace root with left_child
+    if n_leaves & 1:
+        return root.left_child
+
+    # otherwise, we need to re-bag the peaks.
+    else:
+        # first peak
+        peaks = [root.left_child]
+
+        # we do this traversing the right (unbalanced) side of the tree
+        # we keep the left side (balanced subtree or leaf) of each subtree
+        # until we reach a leaf
+        subtree_root = root.right_child
+        while subtree_root.left_child:
+            peaks.append(subtree_root.left_child)
+            subtree_root = subtree_root.right_child
+
+    new_root = bag_peaks(peaks)
+    return new_root
diff --git a/depend/zcash/qa/rpc-tests/test_framework/key.py b/depend/zcash/qa/rpc-tests/test_framework/key.py
new file mode 100644
index 000000000..ba3038fe0
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/test_framework/key.py
@@ -0,0 +1,215 @@
+# Copyright (c) 2011 Sam Rushing
+#
+# key.py - OpenSSL wrapper
+#
+# This file is modified from python-bitcoinlib.
+#
+
+"""ECC secp256k1 crypto routines
+
+WARNING: This module does not mlock() secrets; your private keys may end up on
+disk in swap! Use with caution!
+"""
+
+import ctypes
+import ctypes.util
+import hashlib
+import sys
+
+ssl = ctypes.cdll.LoadLibrary(ctypes.util.find_library ('ssl') or 'libeay32')
+
+ssl.BN_new.restype = ctypes.c_void_p
+ssl.BN_new.argtypes = []
+
+ssl.BN_bin2bn.restype = ctypes.c_void_p
+ssl.BN_bin2bn.argtypes = [ctypes.c_char_p, ctypes.c_int, ctypes.c_void_p]
+
+ssl.BN_CTX_free.restype = None
+ssl.BN_CTX_free.argtypes = [ctypes.c_void_p]
+
+ssl.BN_CTX_new.restype = ctypes.c_void_p
+ssl.BN_CTX_new.argtypes = []
+
+ssl.ECDH_compute_key.restype = ctypes.c_int
+ssl.ECDH_compute_key.argtypes = [ctypes.c_void_p, ctypes.c_int, ctypes.c_void_p, ctypes.c_void_p]
+
+ssl.ECDSA_sign.restype = ctypes.c_int
+ssl.ECDSA_sign.argtypes = [ctypes.c_int, ctypes.c_void_p, ctypes.c_int, ctypes.c_void_p, ctypes.c_void_p, ctypes.c_void_p]
+
+ssl.ECDSA_verify.restype = ctypes.c_int
+ssl.ECDSA_verify.argtypes = [ctypes.c_int, ctypes.c_void_p, ctypes.c_int, ctypes.c_void_p, ctypes.c_int, ctypes.c_void_p]
+
+ssl.EC_KEY_free.restype = None
+ssl.EC_KEY_free.argtypes = [ctypes.c_void_p]
+
+ssl.EC_KEY_new_by_curve_name.restype = ctypes.c_void_p
+ssl.EC_KEY_new_by_curve_name.argtypes = [ctypes.c_int]
+
+ssl.EC_KEY_get0_group.restype = ctypes.c_void_p
+ssl.EC_KEY_get0_group.argtypes = [ctypes.c_void_p]
+
+ssl.EC_KEY_get0_public_key.restype = ctypes.c_void_p
+ssl.EC_KEY_get0_public_key.argtypes = [ctypes.c_void_p]
+
+ssl.EC_KEY_set_private_key.restype = ctypes.c_int
+ssl.EC_KEY_set_private_key.argtypes = [ctypes.c_void_p, ctypes.c_void_p]
+
+ssl.EC_KEY_set_conv_form.restype = None
+ssl.EC_KEY_set_conv_form.argtypes = [ctypes.c_void_p, ctypes.c_int]
+
+ssl.EC_KEY_set_public_key.restype = ctypes.c_int
+ssl.EC_KEY_set_public_key.argtypes = [ctypes.c_void_p, ctypes.c_void_p]
+
+ssl.i2o_ECPublicKey.restype = ctypes.c_void_p
+ssl.i2o_ECPublicKey.argtypes = [ctypes.c_void_p, ctypes.c_void_p]
+
+ssl.EC_POINT_new.restype = ctypes.c_void_p
+ssl.EC_POINT_new.argtypes = [ctypes.c_void_p]
+
+ssl.EC_POINT_free.restype = None
+ssl.EC_POINT_free.argtypes = [ctypes.c_void_p]
+
+ssl.EC_POINT_mul.restype = ctypes.c_int
+ssl.EC_POINT_mul.argtypes = [ctypes.c_void_p, ctypes.c_void_p, ctypes.c_void_p, ctypes.c_void_p, ctypes.c_void_p, ctypes.c_void_p]
+
+# this specifies the curve used with ECDSA.
+NID_secp256k1 = 714 # from openssl/obj_mac.h
+
+# Thx to Sam Devlin for the ctypes magic 64-bit fix.
+def _check_result(val, func, args):
+    if val == 0:
+        raise ValueError
+    else:
+        return ctypes.c_void_p (val)
+
+ssl.EC_KEY_new_by_curve_name.restype = ctypes.c_void_p
+ssl.EC_KEY_new_by_curve_name.errcheck = _check_result
+
+class CECKey(object):
+    """Wrapper around OpenSSL's EC_KEY"""
+
+    POINT_CONVERSION_COMPRESSED = 2
+    POINT_CONVERSION_UNCOMPRESSED = 4
+
+    def __init__(self):
+        self.k = ssl.EC_KEY_new_by_curve_name(NID_secp256k1)
+
+    def __del__(self):
+        if ssl:
+            ssl.EC_KEY_free(self.k)
+        self.k = None
+
+    def set_secretbytes(self, secret):
+        priv_key = ssl.BN_bin2bn(secret, 32, ssl.BN_new())
+        group = ssl.EC_KEY_get0_group(self.k)
+        pub_key = ssl.EC_POINT_new(group)
+        ctx = ssl.BN_CTX_new()
+        if not ssl.EC_POINT_mul(group, pub_key, priv_key, None, None, ctx):
+            raise ValueError("Could not derive public key from the supplied secret.")
+        ssl.EC_POINT_mul(group, pub_key, priv_key, None, None, ctx)
+        ssl.EC_KEY_set_private_key(self.k, priv_key)
+        ssl.EC_KEY_set_public_key(self.k, pub_key)
+        ssl.EC_POINT_free(pub_key)
+        ssl.BN_CTX_free(ctx)
+        return self.k
+
+    def set_privkey(self, key):
+        self.mb = ctypes.create_string_buffer(key)
+        return ssl.d2i_ECPrivateKey(ctypes.byref(self.k), ctypes.byref(ctypes.pointer(self.mb)), len(key))
+
+    def set_pubkey(self, key):
+        self.mb = ctypes.create_string_buffer(key)
+        return ssl.o2i_ECPublicKey(ctypes.byref(self.k), ctypes.byref(ctypes.pointer(self.mb)), len(key))
+
+    def get_privkey(self):
+        size = ssl.i2d_ECPrivateKey(self.k, 0)
+        mb_pri = ctypes.create_string_buffer(size)
+        ssl.i2d_ECPrivateKey(self.k, ctypes.byref(ctypes.pointer(mb_pri)))
+        return mb_pri.raw
+
+    def get_pubkey(self):
+        size = ssl.i2o_ECPublicKey(self.k, 0)
+        mb = ctypes.create_string_buffer(size)
+        ssl.i2o_ECPublicKey(self.k, ctypes.byref(ctypes.pointer(mb)))
+        return mb.raw
+
+    def get_raw_ecdh_key(self, other_pubkey):
+        ecdh_keybuffer = ctypes.create_string_buffer(32)
+        r = ssl.ECDH_compute_key(ctypes.pointer(ecdh_keybuffer), 32,
+                                 ssl.EC_KEY_get0_public_key(other_pubkey.k),
+                                 self.k, 0)
+        if r != 32:
+            raise Exception('CKey.get_ecdh_key(): ECDH_compute_key() failed')
+        return ecdh_keybuffer.raw
+
+    def get_ecdh_key(self, other_pubkey, kdf=lambda k: hashlib.sha256(k).digest()):
+        # FIXME: be warned it's not clear what the kdf should be as a default
+        r = self.get_raw_ecdh_key(other_pubkey)
+        return kdf(r)
+
+    def sign(self, hash):
+        # FIXME: need unit tests for below cases
+        if not isinstance(hash, bytes):
+            raise TypeError('Hash must be bytes instance; got %r' % hash.__class__)
+        if len(hash) != 32:
+            raise ValueError('Hash must be exactly 32 bytes long')
+
+        sig_size0 = ctypes.c_uint32()
+        sig_size0.value = ssl.ECDSA_size(self.k)
+        mb_sig = ctypes.create_string_buffer(sig_size0.value)
+        result = ssl.ECDSA_sign(0, hash, len(hash), mb_sig, ctypes.byref(sig_size0), self.k)
+        assert 1 == result
+        return mb_sig.raw[:sig_size0.value]
+
+    def verify(self, hash, sig):
+        """Verify a DER signature"""
+        return ssl.ECDSA_verify(0, hash, len(hash), sig, len(sig), self.k) == 1
+
+    def set_compressed(self, compressed):
+        if compressed:
+            form = self.POINT_CONVERSION_COMPRESSED
+        else:
+            form = self.POINT_CONVERSION_UNCOMPRESSED
+        ssl.EC_KEY_set_conv_form(self.k, form)
+
+
+class CPubKey(bytes):
+    """An encapsulated public key
+
+    Attributes:
+
+    is_valid      - Corresponds to CPubKey.IsValid()
+    is_fullyvalid - Corresponds to CPubKey.IsFullyValid()
+    is_compressed - Corresponds to CPubKey.IsCompressed()
+    """
+
+    def __new__(cls, buf, _cec_key=None):
+        self = super(CPubKey, cls).__new__(cls, buf)
+        if _cec_key is None:
+            _cec_key = CECKey()
+        self._cec_key = _cec_key
+        self.is_fullyvalid = _cec_key.set_pubkey(self) != 0
+        return self
+
+    @property
+    def is_valid(self):
+        return len(self) > 0
+
+    @property
+    def is_compressed(self):
+        return len(self) == 33
+
+    def verify(self, hash, sig):
+        return self._cec_key.verify(hash, sig)
+
+    def __str__(self):
+        return repr(self)
+
+    def __repr__(self):
+        # Always have represent as b'<secret>' so test cases don't have to
+        # change for py2/3
+        if sys.version > '3':
+            return '%s(%s)' % (self.__class__.__name__, super(CPubKey, self).__repr__())
+        else:
+            return '%s(b%s)' % (self.__class__.__name__, super(CPubKey, self).__repr__())
+
diff --git a/depend/zcash/qa/rpc-tests/test_framework/mininode.py b/depend/zcash/qa/rpc-tests/test_framework/mininode.py
new file mode 100755
index 000000000..abbccf16a
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/test_framework/mininode.py
@@ -0,0 +1,2115 @@
+#!/usr/bin/env python3
+# Copyright (c) 2010 ArtForz -- public domain half-a-node
+# Copyright (c) 2012 Jeff Garzik
+# Copyright (c) 2010-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# mininode.py - Bitcoin P2P network half-a-node
+#
+# This python code was modified from ArtForz' public domain  half-a-node, as
+# found in the mini-node branch of https://github.com/jgarzik/pynode.
+#
+# NodeConn: an object which manages p2p connectivity to a bitcoin node
+# NodeConnCB: a base class that describes the interface for receiving
+#             callbacks with network messages from a NodeConn
+# CBlock, CTransaction, CBlockHeader, CTxIn, CTxOut, etc....:
+#     data structures that should map to corresponding structures in
+#     bitcoin/primitives
+# msg_block, msg_tx, msg_headers, etc.:
+#     data structures that represent network messages
+# ser_*, deser_*: functions that handle serialization/deserialization
+
+
+import struct
+import socket
+import asyncore
+import time
+import sys
+import random
+from binascii import hexlify
+from io import BytesIO
+from codecs import encode
+import hashlib
+from threading import RLock
+from threading import Thread
+import logging
+import copy
+from hashlib import blake2b
+
+from .equihash import (
+    gbp_basic,
+    gbp_validate,
+    hash_nonce,
+    zcash_person,
+)
+from .util import bytes_to_hex_str
+
+
+BIP0031_VERSION = 60000
+SPROUT_PROTO_VERSION = 170002  # past bip-31 for ping/pong
+OVERWINTER_PROTO_VERSION = 170003
+SAPLING_PROTO_VERSION = 170006
+BLOSSOM_PROTO_VERSION = 170008
+NU5_PROTO_VERSION = 170050
+
+MY_SUBVERSION = b"/python-mininode-tester:0.0.3/"
+
+SPROUT_VERSION_GROUP_ID = 0x00000000
+OVERWINTER_VERSION_GROUP_ID = 0x03C48270
+SAPLING_VERSION_GROUP_ID = 0x892F2085
+ZIP225_VERSION_GROUP_ID = 0x26A7270A
+# No transaction format change in Blossom.
+
+MAX_INV_SZ = 50000
+
+COIN = 100000000 # 1 zec in zatoshis
+
+# The placeholder value used for the auth digest of pre-v5 transactions.
+LEGACY_TX_AUTH_DIGEST = (1 << 256) - 1
+
+# Keep our own socket map for asyncore, so that we can track disconnects
+# ourselves (to workaround an issue with closing an asyncore socket when
+# using select)
+mininode_socket_map = dict()
+
+# One lock for synchronizing all data access between the networking thread (see
+# NetworkThread below) and the thread running the test logic.  For simplicity,
+# NodeConn acquires this lock whenever delivering a message to to a NodeConnCB,
+# and whenever adding anything to the send buffer (in send_message()).  This
+# lock should be acquired in the thread running the test logic to synchronize
+# access to any data shared with the NodeConnCB or NodeConn.
+mininode_lock = RLock()
+
+# Serialization/deserialization tools
+def sha256(s):
+    return hashlib.new('sha256', s).digest()
+
+def hash256(s):
+    return sha256(sha256(s))
+
+def nuparams(branch_id, height):
+    return '-nuparams=%x:%d' % (branch_id, height)
+
+def fundingstream(idx, start_height, end_height, addrs):
+    return '-fundingstream=%d:%d:%d:%s' % (idx, start_height, end_height, ",".join(addrs))
+
+def ser_compactsize(n):
+    if n < 253:
+        return struct.pack("B", n)
+    elif n < 0x10000:
+        return struct.pack("<BH", 253, n)
+    elif n < 0x100000000:
+        return struct.pack("<BI", 254, n)
+    return struct.pack("<BQ", 255, n)
+
+def deser_string(f):
+    nit = struct.unpack("<B", f.read(1))[0]
+    if nit == 253:
+        nit = struct.unpack("<H", f.read(2))[0]
+    elif nit == 254:
+        nit = struct.unpack("<I", f.read(4))[0]
+    elif nit == 255:
+        nit = struct.unpack("<Q", f.read(8))[0]
+    return f.read(nit)
+
+def ser_string(s):
+    if len(s) < 253:
+        return struct.pack("B", len(s)) + s
+    elif len(s) < 0x10000:
+        return struct.pack("<BH", 253, len(s)) + s
+    elif len(s) < 0x100000000:
+        return struct.pack("<BI", 254, len(s)) + s
+    return struct.pack("<BQ", 255, len(s)) + s
+
+def deser_uint256(f):
+    r = 0
+    for i in range(8):
+        t = struct.unpack("<I", f.read(4))[0]
+        r += t << (i * 32)
+    return r
+
+
+def ser_uint256(u):
+    rs = b""
+    for i in range(8):
+        rs += struct.pack("<I", u & 0xFFFFFFFF)
+        u >>= 32
+    return rs
+
+
+def uint256_from_str(s):
+    r = 0
+    t = struct.unpack("<IIIIIIII", s[:32])
+    for i in range(8):
+        r += t[i] << (i * 32)
+    return r
+
+
+def uint256_from_compact(c):
+    nbytes = (c >> 24) & 0xFF
+    v = (c & 0xFFFFFF) << (8 * (nbytes - 3))
+    return v
+
+
+def block_work_from_compact(c):
+    target = uint256_from_compact(c)
+    return 2**256 // (target + 1)
+
+
+def deser_vector(f, c):
+    nit = struct.unpack("<B", f.read(1))[0]
+    if nit == 253:
+        nit = struct.unpack("<H", f.read(2))[0]
+    elif nit == 254:
+        nit = struct.unpack("<I", f.read(4))[0]
+    elif nit == 255:
+        nit = struct.unpack("<Q", f.read(8))[0]
+    r = []
+    for i in range(nit):
+        t = c()
+        t.deserialize(f)
+        r.append(t)
+    return r
+
+
+def ser_vector(elems):
+    r = b""
+    r += ser_compact_size(len(elems))
+    for elem in elems:
+        r += elem.serialize()
+    return r
+
+
+def ser_compact_size(l):
+    if l < 253:
+        return struct.pack("B", l)
+    elif l < 0x10000:
+        return struct.pack("<BH", 253, l)
+    elif l < 0x100000000:
+        return struct.pack("<BI", 254, l)
+    else:
+        return struct.pack("<BQ", 255, l)
+
+
+def deser_uint256_vector(f):
+    nit = struct.unpack("<B", f.read(1))[0]
+    if nit == 253:
+        nit = struct.unpack("<H", f.read(2))[0]
+    elif nit == 254:
+        nit = struct.unpack("<I", f.read(4))[0]
+    elif nit == 255:
+        nit = struct.unpack("<Q", f.read(8))[0]
+    r = []
+    for i in range(nit):
+        t = deser_uint256(f)
+        r.append(t)
+    return r
+
+
+def ser_uint256_vector(l):
+    r = b""
+    if len(l) < 253:
+        r = struct.pack("B", len(l))
+    elif len(l) < 0x10000:
+        r = struct.pack("<BH", 253, len(l))
+    elif len(l) < 0x100000000:
+        r = struct.pack("<BI", 254, len(l))
+    else:
+        r = struct.pack("<BQ", 255, len(l))
+    for i in l:
+        r += ser_uint256(i)
+    return r
+
+
+def deser_string_vector(f):
+    nit = struct.unpack("<B", f.read(1))[0]
+    if nit == 253:
+        nit = struct.unpack("<H", f.read(2))[0]
+    elif nit == 254:
+        nit = struct.unpack("<I", f.read(4))[0]
+    elif nit == 255:
+        nit = struct.unpack("<Q", f.read(8))[0]
+    r = []
+    for i in range(nit):
+        t = deser_string(f)
+        r.append(t)
+    return r
+
+
+def ser_string_vector(l):
+    r = b""
+    if len(l) < 253:
+        r = struct.pack("B", len(l))
+    elif len(l) < 0x10000:
+        r = struct.pack("<BH", 253, len(l))
+    elif len(l) < 0x100000000:
+        r = struct.pack("<BI", 254, len(l))
+    else:
+        r = struct.pack("<BQ", 255, len(l))
+    for sv in l:
+        r += ser_string(sv)
+    return r
+
+
+def deser_int_vector(f):
+    nit = struct.unpack("<B", f.read(1))[0]
+    if nit == 253:
+        nit = struct.unpack("<H", f.read(2))[0]
+    elif nit == 254:
+        nit = struct.unpack("<I", f.read(4))[0]
+    elif nit == 255:
+        nit = struct.unpack("<Q", f.read(8))[0]
+    r = []
+    for i in range(nit):
+        t = struct.unpack("<i", f.read(4))[0]
+        r.append(t)
+    return r
+
+
+def ser_int_vector(l):
+    r = b""
+    if len(l) < 253:
+        r = struct.pack("B", len(l))
+    elif len(l) < 0x10000:
+        r = struct.pack("<BH", 253, len(l))
+    elif len(l) < 0x100000000:
+        r = struct.pack("<BI", 254, len(l))
+    else:
+        r = struct.pack("<BQ", 255, len(l))
+    for i in l:
+        r += struct.pack("<i", i)
+    return r
+
+def deser_char_vector(f):
+    nit = struct.unpack("<B", f.read(1))[0]
+    if nit == 253:
+        nit = struct.unpack("<H", f.read(2))[0]
+    elif nit == 254:
+        nit = struct.unpack("<I", f.read(4))[0]
+    elif nit == 255:
+        nit = struct.unpack("<Q", f.read(8))[0]
+    r = []
+    for i in range(nit):
+        t = struct.unpack("<B", f.read(1))[0]
+        r.append(t)
+    return r
+
+
+def ser_char_vector(l):
+    r = b""
+    if len(l) < 253:
+        r = struct.pack("B", len(l))
+    elif len(l) < 0x10000:
+        r = struct.pack("<BH", 253, len(l))
+    elif len(l) < 0x100000000:
+        r = struct.pack("<BI", 254, len(l))
+    else:
+        r = struct.pack("<BQ", 255, len(l))
+    for i in l:
+        r += struct.pack("B", i)
+    return r
+
+# Objects that map to bitcoind objects, which can be serialized/deserialized
+
+class CAddress(object):
+    def __init__(self):
+        self.nServices = 1
+        self.pchReserved = b"\x00" * 10 + b"\xff" * 2
+        self.ip = "0.0.0.0"
+        self.port = 0
+
+    def deserialize(self, f):
+        self.nServices = struct.unpack("<Q", f.read(8))[0]
+        self.pchReserved = f.read(12)
+        self.ip = socket.inet_ntoa(f.read(4))
+        self.port = struct.unpack(">H", f.read(2))[0]
+
+    def serialize(self):
+        r = b""
+        r += struct.pack("<Q", self.nServices)
+        r += self.pchReserved
+        r += socket.inet_aton(self.ip)
+        r += struct.pack(">H", self.port)
+        return r
+
+    def __repr__(self):
+        return "CAddress(nServices=%i ip=%s port=%i)" % (self.nServices,
+                                                         self.ip, self.port)
+
+
+class CInv(object):
+    typemap = {
+        0: b"Error",
+        1: b"TX",
+        2: b"Block",
+        5: b"WTX",
+    }
+
+    def __init__(self, t=0, h=0, h_aux=0):
+        self.type = t
+        self.hash = h
+        self.hash_aux = h_aux
+        if self.type == 1:
+            self.hash_aux = LEGACY_TX_AUTH_DIGEST
+
+    def deserialize(self, f):
+        self.type = struct.unpack("<i", f.read(4))[0]
+        self.hash = deser_uint256(f)
+        if self.type == 5:
+            self.hash_aux = deser_uint256(f)
+        elif self.type == 1:
+            self.hash_aux = LEGACY_TX_AUTH_DIGEST
+
+    def serialize(self):
+        r = b""
+        r += struct.pack("<i", self.type)
+        r += ser_uint256(self.hash)
+        if self.type == 5:
+            r += ser_uint256(self.hash_aux)
+        return r
+
+    def __eq__(self, other):
+        return (
+            (type(self) == type(other)) and
+            (self.type, self.hash, self.hash_aux) == (other.type, other.hash, other.hash_aux)
+        )
+
+    def __repr__(self):
+        return "CInv(type=%s hash=%064x hash_aux=%064x)" \
+            % (self.typemap.get(self.type, self.type), self.hash, self.hash_aux)
+
+
+class CBlockLocator(object):
+    def __init__(self):
+        self.nVersion = SPROUT_PROTO_VERSION
+        self.vHave = []
+
+    def deserialize(self, f):
+        self.nVersion = struct.unpack("<i", f.read(4))[0]
+        self.vHave = deser_uint256_vector(f)
+
+    def serialize(self):
+        r = b""
+        r += struct.pack("<i", self.nVersion)
+        r += ser_uint256_vector(self.vHave)
+        return r
+
+    def __repr__(self):
+        return "CBlockLocator(nVersion=%i vHave=%r)" \
+            % (self.nVersion, repr(self.vHave))
+
+
+class RedPallasSignature(object):
+    def __init__(self):
+        self.data = None
+
+    def deserialize(self, f):
+        self.data = f.read(64)
+
+    def serialize(self):
+        r = b""
+        r += self.data
+        return r
+
+    def __repr__(self):
+        return "RedPallasSignature(%s)" % bytes_to_hex_str(self.data)
+
+
+class OrchardAction(object):
+    def __init__(self):
+        self.cv = None
+        self.nullifier = None
+        self.rk = None
+        self.cmx = None
+        self.ephemeralKey = None
+        self.encCiphertext = None
+        self.outCiphertext = None
+
+    def deserialize(self, f):
+        self.cv = deser_uint256(f)
+        self.nullifier = deser_uint256(f)
+        self.rk = deser_uint256(f)
+        self.cmx = deser_uint256(f)
+        self.ephemeralKey = deser_uint256(f)
+        self.encCiphertext = f.read(580)
+        self.outCiphertext = f.read(80)
+
+    def serialize(self):
+        r = b""
+        r += ser_uint256(self.cv)
+        r += ser_uint256(self.nullifier)
+        r += ser_uint256(self.rk)
+        r += ser_uint256(self.cmx)
+        r += ser_uint256(self.ephemeralKey)
+        r += self.encCiphertext
+        r += self.outCiphertext
+        return r
+
+    def __repr__(self):
+        return "OrchardAction(cv=%064x, nullifier=%064x, rk=%064x, cmu=%064x, ephemeralKey=%064x, encCiphertext=%064x, outCiphertext=%064x)" \
+            % (
+                self.cv,
+                self.nullifier,
+                self.rk,
+                self.cmx,
+                self.ephemeralKey,
+                self.encCiphertext,
+                self.outCiphertext,
+            )
+
+
+ORCHARD_FLAGS_ENABLE_SPENDS = 0b00000001
+ORCHARD_FLAGS_ENABLE_OUTPUTS = 0b00000010
+
+class OrchardBundle(object):
+    def __init__(self):
+        self.actions = []
+        self.enableSpends = False
+        self.enableOutputs = False
+        self.valueBalance = 0
+        self.anchor = None
+        self.proofs = []
+        self.spendAuthSigs = []
+        self.bindingSig = None
+
+    def deserialize(self, f):
+        self.actions = deser_vector(f, OrchardAction)
+        if len(self.actions) > 0:
+            flags = struct.unpack("B", f.read(1))[0]
+            self.enableSpends = (flags & ORCHARD_FLAGS_ENABLE_SPENDS) != 0
+            self.enableOutputs = (flags & ORCHARD_FLAGS_ENABLE_OUTPUTS) != 0
+            self.valueBalance = struct.unpack("<q", f.read(8))[0]
+            self.anchor = deser_uint256(f)
+            self.proofs = deser_char_vector(f)
+            for i in range(len(self.actions)):
+                self.actions[i].spendAuthSig = RedPallasSignature()
+                self.actions[i].spendAuthSig.deserialize(f)
+            self.bindingSig = RedPallasSignature()
+            self.bindingSig.deserialize(f)
+
+    def serialize(self):
+        r = b""
+        r += ser_vector(self.actions)
+        if len(self.actions) > 0:
+            r += struct.pack("B", self.flags())
+            r += struct.pack("<q", self.valueBalance)
+            r += ser_uint256(self.anchor)
+            r += ser_compact_size(len(self.proofs))
+            r += bytes(self.proofs)
+            for i in range(len(self.actions)):
+                r += self.actions[i].spendAuthSig.serialize()
+            r += self.bindingSig.serialize()
+        return r
+
+    def flags(self):
+        return 0 ^ (
+            ORCHARD_FLAGS_ENABLE_SPENDS if self.enableSpends else 0
+        ) ^ (
+            ORCHARD_FLAGS_ENABLE_OUTPUTS if self.enableOutputs else 0
+        )
+
+    def __repr__(self):
+        return "OrchardBundle(actions=%r, enableSpends=%s, enableOutputs=%s, valueBalance=%i, proofs=%r, spendAuthSigs=%r, bindingSig=%r)" \
+            % (
+                self.actions,
+                self.enableSpends,
+                self.enableOutputs,
+                self.valueBalance,
+                self.proofs,
+                self.spendAuthSigs,
+                self.bindingSig,
+            )
+
+
+class Groth16Proof(object):
+    def __init__(self):
+        self.data = None
+
+    def deserialize(self, f):
+        self.data = f.read(192)
+
+    def serialize(self):
+        r = b""
+        r += self.data
+        return r
+
+    def __repr__(self):
+        return "Groth16Proof(%s)" % bytes_to_hex_str(self.data)
+
+
+class RedJubjubSignature(object):
+    def __init__(self):
+        self.data = None
+
+    def deserialize(self, f):
+        self.data = f.read(64)
+
+    def serialize(self):
+        r = b""
+        r += self.data
+        return r
+
+    def __repr__(self):
+        return "RedJubjubSignature(%s)" % bytes_to_hex_str(self.data)
+
+
+class SpendDescriptionV5(object):
+    def __init__(self):
+        self.cv = None
+        self.nullifier = None
+        self.rk = None
+        self.zkproof = None
+        self.spendAuthSig = None
+
+    def deserialize(self, f):
+        self.cv = deser_uint256(f)
+        self.nullifier = deser_uint256(f)
+        self.rk = deser_uint256(f)
+
+    def serialize(self):
+        r = b""
+        r += ser_uint256(self.cv)
+        r += ser_uint256(self.nullifier)
+        r += ser_uint256(self.rk)
+        return r
+
+    def __repr__(self):
+        return "SpendDescriptionV5(cv=%064x, nullifier=%064x, rk=%064x, zkproof=%r, spendAuthSig=%r)" \
+            % (self.cv, self.nullifier, self.rk, self.zkproof, self.spendAuthSig)
+
+
+class SpendDescription(object):
+    def __init__(self):
+        self.cv = None
+        self.anchor = None
+        self.nullifier = None
+        self.rk = None
+        self.zkproof = None
+        self.spendAuthSig = None
+
+    def deserialize(self, f):
+        self.cv = deser_uint256(f)
+        self.anchor = deser_uint256(f)
+        self.nullifier = deser_uint256(f)
+        self.rk = deser_uint256(f)
+        self.zkproof = Groth16Proof()
+        self.zkproof.deserialize(f)
+        self.spendAuthSig = RedJubjubSignature()
+        self.spendAuthSig.deserialize(f)
+
+    def serialize(self):
+        r = b""
+        r += ser_uint256(self.cv)
+        r += ser_uint256(self.anchor)
+        r += ser_uint256(self.nullifier)
+        r += ser_uint256(self.rk)
+        r += self.zkproof.serialize()
+        r += self.spendAuthSig.serialize()
+        return r
+
+    def __repr__(self):
+        return "SpendDescription(cv=%064x, anchor=%064x, nullifier=%064x, rk=%064x, zkproof=%r, spendAuthSig=%r)" \
+            % (self.cv, self.anchor, self.nullifier, self.rk, self.zkproof, self.spendAuthSig)
+
+
+class OutputDescriptionV5(object):
+    def __init__(self):
+        self.cv = None
+        self.cmu = None
+        self.ephemeralKey = None
+        self.encCiphertext = None
+        self.outCiphertext = None
+        self.zkproof = None
+
+    def deserialize(self, f):
+        self.cv = deser_uint256(f)
+        self.cmu = deser_uint256(f)
+        self.ephemeralKey = deser_uint256(f)
+        self.encCiphertext = f.read(580)
+        self.outCiphertext = f.read(80)
+
+    def serialize(self):
+        r = b""
+        r += ser_uint256(self.cv)
+        r += ser_uint256(self.cmu)
+        r += ser_uint256(self.ephemeralKey)
+        r += self.encCiphertext
+        r += self.outCiphertext
+        return r
+
+    def __repr__(self):
+        return "OutputDescription(cv=%064x, cmu=%064x, ephemeralKey=%064x, encCiphertext=%s, outCiphertext=%s, zkproof=%r)" \
+            % (
+                self.cv,
+                self.cmu,
+                self.ephemeralKey,
+                bytes_to_hex_str(self.encCiphertext),
+                bytes_to_hex_str(self.outCiphertext),
+                self.zkproof,
+            )
+
+
+class OutputDescription(object):
+    def __init__(self):
+        self.cv = None
+        self.cmu = None
+        self.ephemeralKey = None
+        self.encCiphertext = None
+        self.outCiphertext = None
+        self.zkproof = None
+
+    def deserialize(self, f):
+        self.cv = deser_uint256(f)
+        self.cmu = deser_uint256(f)
+        self.ephemeralKey = deser_uint256(f)
+        self.encCiphertext = f.read(580)
+        self.outCiphertext = f.read(80)
+        self.zkproof = Groth16Proof()
+        self.zkproof.deserialize(f)
+
+    def serialize(self):
+        r = b""
+        r += ser_uint256(self.cv)
+        r += ser_uint256(self.cmu)
+        r += ser_uint256(self.ephemeralKey)
+        r += self.encCiphertext
+        r += self.outCiphertext
+        r += self.zkproof.serialize()
+        return r
+
+    def __repr__(self):
+        return "OutputDescription(cv=%064x, cmu=%064x, ephemeralKey=%064x, encCiphertext=%s, outCiphertext=%s, zkproof=%r)" \
+            % (
+                self.cv,
+                self.cmu,
+                self.ephemeralKey,
+                bytes_to_hex_str(self.encCiphertext),
+                bytes_to_hex_str(self.outCiphertext),
+                self.zkproof,
+            )
+
+
+class SaplingBundle(object):
+    def __init__(self):
+        self.spends = []
+        self.outputs = []
+        self.valueBalance = 0
+        self.anchor = None
+        self.bindingSig = None
+
+    def deserialize(self, f):
+        self.spends = deser_vector(f, SpendDescriptionV5)
+        self.outputs = deser_vector(f, OutputDescriptionV5)
+        has_sapling = (len(self.spends) + len(self.outputs)) > 0
+        if has_sapling:
+            self.valueBalance = struct.unpack("<q", f.read(8))[0]
+        if len(self.spends) > 0:
+            self.anchor = deser_uint256(f)
+        for i in range(len(self.spends)):
+            self.spends[i].zkproof = Groth16Proof()
+            self.spends[i].zkproof.deserialize(f)
+        for i in range(len(self.spends)):
+            self.spends[i].spendAuthSig = RedJubjubSignature()
+            self.spends[i].spendAuthSig.deserialize(f)
+        for i in range(len(self.outputs)):
+            self.outputs[i].zkproof = Groth16Proof()
+            self.outputs[i].zkproof.deserialize(f)
+        if has_sapling:
+            self.bindingSig = RedJubjubSignature()
+            self.bindingSig.deserialize(f)
+
+    def serialize(self):
+        r = b""
+        r += ser_vector(self.spends)
+        r += ser_vector(self.outputs)
+        has_sapling = (len(self.spends) + len(self.outputs)) > 0
+        if has_sapling:
+            r += struct.pack("<q", self.valueBalance)
+        if len(self.spends) > 0:
+            r += ser_uint256(self.anchor)
+        for spend in self.spends:
+            r += spend.zkproof.serialize()
+        for spend in self.spends:
+            r += spend.spendAuthSig.serialize()
+        for output in self.outputs:
+            r += output.zkproof.serialize()
+        if has_sapling:
+            r += self.bindingSig.serialize()
+        return r
+
+    def __repr__(self):
+        return "SaplingBundle(spends=%r, outputs=%r, valueBalance=%i, bindingSig=%064x)" \
+            % (
+                self.spends,
+                self.outputs,
+                self.valueBalance,
+                self.bindingSig,
+            )
+
+
+G1_PREFIX_MASK = 0x02
+G2_PREFIX_MASK = 0x0a
+
+class ZCProof(object):
+    def __init__(self):
+        self.g_A = None
+        self.g_A_prime = None
+        self.g_B = None
+        self.g_B_prime = None
+        self.g_C = None
+        self.g_C_prime = None
+        self.g_K = None
+        self.g_H = None
+
+    def deserialize(self, f):
+        def deser_g1(self, f):
+            leadingByte = struct.unpack("<B", f.read(1))[0]
+            return {
+                'y_lsb': leadingByte & 1,
+                'x': f.read(32),
+            }
+        def deser_g2(self, f):
+            leadingByte = struct.unpack("<B", f.read(1))[0]
+            return {
+                'y_gt': leadingByte & 1,
+                'x': f.read(64),
+            }
+        self.g_A = deser_g1(f)
+        self.g_A_prime = deser_g1(f)
+        self.g_B = deser_g2(f)
+        self.g_B_prime = deser_g1(f)
+        self.g_C = deser_g1(f)
+        self.g_C_prime = deser_g1(f)
+        self.g_K = deser_g1(f)
+        self.g_H = deser_g1(f)
+
+    def serialize(self):
+        def ser_g1(self, p):
+            return chr(G1_PREFIX_MASK | p['y_lsb']) + p['x']
+        def ser_g2(self, p):
+            return chr(G2_PREFIX_MASK | p['y_gt']) + p['x']
+        r = b""
+        r += ser_g1(self.g_A)
+        r += ser_g1(self.g_A_prime)
+        r += ser_g2(self.g_B)
+        r += ser_g1(self.g_B_prime)
+        r += ser_g1(self.g_C)
+        r += ser_g1(self.g_C_prime)
+        r += ser_g1(self.g_K)
+        r += ser_g1(self.g_H)
+        return r
+
+    def __repr__(self):
+        return "ZCProof(g_A=%r g_A_prime=%r g_B=%r g_B_prime=%r g_C=%r g_C_prime=%r g_K=%r g_H=%r)" \
+            % (self.g_A, self.g_A_prime,
+               self.g_B, self.g_B_prime,
+               self.g_C, self.g_C_prime,
+               self.g_K, self.g_H)
+
+
+ZC_NUM_JS_INPUTS = 2
+ZC_NUM_JS_OUTPUTS = 2
+
+ZC_NOTEPLAINTEXT_LEADING = 1
+ZC_V_SIZE = 8
+ZC_RHO_SIZE = 32
+ZC_R_SIZE = 32
+ZC_MEMO_SIZE = 512
+
+ZC_NOTEPLAINTEXT_SIZE = (
+  ZC_NOTEPLAINTEXT_LEADING +
+  ZC_V_SIZE +
+  ZC_RHO_SIZE +
+  ZC_R_SIZE +
+  ZC_MEMO_SIZE
+)
+
+NOTEENCRYPTION_AUTH_BYTES = 16
+
+ZC_NOTECIPHERTEXT_SIZE = (
+  ZC_NOTEPLAINTEXT_SIZE +
+  NOTEENCRYPTION_AUTH_BYTES
+)
+
+class JSDescription(object):
+    def __init__(self):
+        self.vpub_old = 0
+        self.vpub_new = 0
+        self.anchor = 0
+        self.nullifiers = [0] * ZC_NUM_JS_INPUTS
+        self.commitments = [0] * ZC_NUM_JS_OUTPUTS
+        self.onetimePubKey = 0
+        self.randomSeed = 0
+        self.macs = [0] * ZC_NUM_JS_INPUTS
+        self.proof = None
+        self.ciphertexts = [None] * ZC_NUM_JS_OUTPUTS
+
+    def deserialize(self, f, use_groth16=True):
+        self.vpub_old = struct.unpack("<q", f.read(8))[0]
+        self.vpub_new = struct.unpack("<q", f.read(8))[0]
+        self.anchor = deser_uint256(f)
+
+        self.nullifiers = []
+        for i in range(ZC_NUM_JS_INPUTS):
+            self.nullifiers.append(deser_uint256(f))
+
+        self.commitments = []
+        for i in range(ZC_NUM_JS_OUTPUTS):
+            self.commitments.append(deser_uint256(f))
+
+        self.onetimePubKey = deser_uint256(f)
+        self.randomSeed = deser_uint256(f)
+
+        self.macs = []
+        for i in range(ZC_NUM_JS_INPUTS):
+            self.macs.append(deser_uint256(f))
+
+        if use_groth16:
+            self.proof = Groth16Proof()
+        else:
+            self.proof = ZCProof()
+        self.proof.deserialize(f)
+
+        self.ciphertexts = []
+        for i in range(ZC_NUM_JS_OUTPUTS):
+            self.ciphertexts.append(f.read(ZC_NOTECIPHERTEXT_SIZE))
+
+    def serialize(self):
+        r = b""
+        r += struct.pack("<q", self.vpub_old)
+        r += struct.pack("<q", self.vpub_new)
+        r += ser_uint256(self.anchor)
+        for i in range(ZC_NUM_JS_INPUTS):
+            r += ser_uint256(self.nullifiers[i])
+        for i in range(ZC_NUM_JS_OUTPUTS):
+            r += ser_uint256(self.commitments[i])
+        r += ser_uint256(self.onetimePubKey)
+        r += ser_uint256(self.randomSeed)
+        for i in range(ZC_NUM_JS_INPUTS):
+            r += ser_uint256(self.macs[i])
+        r += self.proof.serialize()
+        for i in range(ZC_NUM_JS_OUTPUTS):
+            r += self.ciphertexts[i]
+        return r
+
+    def __repr__(self):
+        return "JSDescription(vpub_old=%i vpub_new=%i anchor=%064x onetimePubKey=%064x randomSeed=%064x proof=%r)" \
+            % (self.vpub_old, self.vpub_new, self.anchor,
+               self.onetimePubKey, self.randomSeed, self.proof)
+
+class COutPoint(object):
+    def __init__(self, hash=0, n=0):
+        self.hash = hash
+        self.n = n
+
+    def deserialize(self, f):
+        self.hash = deser_uint256(f)
+        self.n = struct.unpack("<I", f.read(4))[0]
+
+    def serialize(self):
+        r = b""
+        r += ser_uint256(self.hash)
+        r += struct.pack("<I", self.n)
+        return r
+
+    def __repr__(self):
+        return "COutPoint(hash=%064x n=%i)" % (self.hash, self.n)
+
+
+class CTxIn(object):
+    def __init__(self, outpoint=None, scriptSig=b"", nSequence=0):
+        if outpoint is None:
+            self.prevout = COutPoint()
+        else:
+            self.prevout = outpoint
+        self.scriptSig = scriptSig
+        self.nSequence = nSequence
+
+    def deserialize(self, f):
+        self.prevout = COutPoint()
+        self.prevout.deserialize(f)
+        self.scriptSig = deser_string(f)
+        self.nSequence = struct.unpack("<I", f.read(4))[0]
+
+    def serialize(self):
+        r = b""
+        r += self.prevout.serialize()
+        r += ser_string(self.scriptSig)
+        r += struct.pack("<I", self.nSequence)
+        return r
+
+    def __repr__(self):
+        return "CTxIn(prevout=%s scriptSig=%s nSequence=%i)" \
+            % (repr(self.prevout), hexlify(self.scriptSig),
+               self.nSequence)
+
+
+class CTxOut(object):
+    def __init__(self, nValue=0, scriptPubKey=b""):
+        self.nValue = nValue
+        self.scriptPubKey = scriptPubKey
+
+    def deserialize(self, f):
+        self.nValue = struct.unpack("<q", f.read(8))[0]
+        self.scriptPubKey = deser_string(f)
+
+    def serialize(self):
+        r = b""
+        r += struct.pack("<q", self.nValue)
+        r += ser_string(self.scriptPubKey)
+        return r
+
+    def __repr__(self):
+        return "CTxOut(nValue=%i.%08i scriptPubKey=%s)" \
+            % (self.nValue // 100000000, self.nValue % 100000000,
+               hexlify(self.scriptPubKey))
+
+
+class CTransaction(object):
+    def __init__(self, tx=None):
+        if tx is None:
+            self.fOverwintered = True
+            self.nVersion = 4
+            self.nVersionGroupId = SAPLING_VERSION_GROUP_ID
+            self.vin = []
+            self.vout = []
+            self.nLockTime = 0
+            self.nExpiryHeight = 0
+            self.valueBalance = 0
+            self.saplingBundle = SaplingBundle()
+            self.orchardBundle = OrchardBundle()
+            self.shieldedSpends = []
+            self.shieldedOutputs = []
+            self.vJoinSplit = []
+            self.joinSplitPubKey = None
+            self.joinSplitSig = None
+            self.bindingSig = None
+            self.sha256 = None
+            self.hash = None
+        else:
+            self.fOverwintered = tx.fOverwintered
+            self.nVersion = tx.nVersion
+            self.nVersionGroupId = tx.nVersionGroupId
+            self.vin = copy.deepcopy(tx.vin)
+            self.vout = copy.deepcopy(tx.vout)
+            self.nLockTime = tx.nLockTime
+            self.nExpiryHeight = tx.nExpiryHeight
+            self.valueBalance = tx.valueBalance
+            self.saplingBundle = copy.deepcopy(tx.saplingBundle)
+            self.orchardBundle = copy.deepcopy(tx.orchardBundle)
+            self.shieldedSpends = copy.deepcopy(tx.shieldedSpends)
+            self.shieldedOutputs = copy.deepcopy(tx.shieldedOutputs)
+            self.vJoinSplit = copy.deepcopy(tx.vJoinSplit)
+            self.joinSplitPubKey = tx.joinSplitPubKey
+            self.joinSplitSig = tx.joinSplitSig
+            self.bindingSig = tx.bindingSig
+            self.sha256 = None
+            self.hash = None
+
+    def deserialize(self, f):
+        header = struct.unpack("<I", f.read(4))[0]
+        self.fOverwintered = bool(header >> 31)
+        self.nVersion = header & 0x7FFFFFFF
+        self.nVersionGroupId = (struct.unpack("<I", f.read(4))[0]
+                                if self.fOverwintered else 0)
+
+        isOverwinterV3 = (self.fOverwintered and
+                          self.nVersionGroupId == OVERWINTER_VERSION_GROUP_ID and
+                          self.nVersion == 3)
+        isSaplingV4 = (self.fOverwintered and
+                       self.nVersionGroupId == SAPLING_VERSION_GROUP_ID and
+                       self.nVersion == 4)
+        isNu5V5 = (self.fOverwintered and
+                       self.nVersionGroupId == ZIP225_VERSION_GROUP_ID and
+                       self.nVersion == 5)
+
+        if isNu5V5:
+            # Common transaction fields
+            self.nConsensusBranchId = struct.unpack("<I", f.read(4))[0]
+            self.nLockTime = struct.unpack("<I", f.read(4))[0]
+            self.nExpiryHeight = struct.unpack("<I", f.read(4))[0]
+
+            # Transparent transaction fields
+            self.vin = deser_vector(f, CTxIn)
+            self.vout = deser_vector(f, CTxOut)
+
+            # Sapling transaction fields
+            self.saplingBundle = SaplingBundle()
+            self.saplingBundle.deserialize(f)
+
+            # Orchard transaction fields
+            self.orchardBundle = OrchardBundle()
+            self.orchardBundle.deserialize(f)
+
+            return
+
+        self.vin = deser_vector(f, CTxIn)
+        self.vout = deser_vector(f, CTxOut)
+        self.nLockTime = struct.unpack("<I", f.read(4))[0]
+        if isOverwinterV3 or isSaplingV4:
+            self.nExpiryHeight = struct.unpack("<I", f.read(4))[0]
+
+        if isSaplingV4:
+            self.valueBalance = struct.unpack("<q", f.read(8))[0]
+            self.shieldedSpends = deser_vector(f, SpendDescription)
+            self.shieldedOutputs = deser_vector(f, OutputDescription)
+
+        if self.nVersion >= 2:
+            self.vJoinSplit = deser_vector(f, JSDescription)
+            if len(self.vJoinSplit) > 0:
+                self.joinSplitPubKey = deser_uint256(f)
+                self.joinSplitSig = f.read(64)
+
+        if isSaplingV4 and not (len(self.shieldedSpends) == 0 and len(self.shieldedOutputs) == 0):
+            self.bindingSig = RedJubjubSignature()
+            self.bindingSig.deserialize(f)
+
+        self.sha256 = None
+        self.hash = None
+
+    def serialize(self):
+        header = (int(self.fOverwintered)<<31) | self.nVersion
+        isOverwinterV3 = (self.fOverwintered and
+                          self.nVersionGroupId == OVERWINTER_VERSION_GROUP_ID and
+                          self.nVersion == 3)
+        isSaplingV4 = (self.fOverwintered and
+                       self.nVersionGroupId == SAPLING_VERSION_GROUP_ID and
+                       self.nVersion == 4)
+        isNu5V5 = (self.fOverwintered and
+                       self.nVersionGroupId == ZIP225_VERSION_GROUP_ID and
+                       self.nVersion == 5)
+
+        if isNu5V5:
+            r = b""
+
+            # Common transaction fields
+            r += struct.pack("<I", header)
+            r += struct.pack("<I", self.nVersionGroupId)
+            r += struct.pack("<I", self.nConsensusBranchId)
+            r += struct.pack("<I", self.nLockTime)
+            r += struct.pack("<I", self.nExpiryHeight)
+
+            # Transparent transaction fields
+            r += ser_vector(self.vin)
+            r += ser_vector(self.vout)
+
+            # Sapling transaction fields
+            r += self.saplingBundle.serialize()
+
+            # Orchard transaction fields
+            r += self.orchardBundle.serialize()
+
+            return r
+
+        r = b""
+        r += struct.pack("<I", header)
+        if self.fOverwintered:
+            r += struct.pack("<I", self.nVersionGroupId)
+        r += ser_vector(self.vin)
+        r += ser_vector(self.vout)
+        r += struct.pack("<I", self.nLockTime)
+        if isOverwinterV3 or isSaplingV4:
+            r += struct.pack("<I", self.nExpiryHeight)
+        if isSaplingV4:
+            r += struct.pack("<q", self.valueBalance)
+            r += ser_vector(self.shieldedSpends)
+            r += ser_vector(self.shieldedOutputs)
+        if self.nVersion >= 2:
+            r += ser_vector(self.vJoinSplit)
+            if len(self.vJoinSplit) > 0:
+                r += ser_uint256(self.joinSplitPubKey)
+                r += self.joinSplitSig
+        if isSaplingV4 and not (len(self.shieldedSpends) == 0 and len(self.shieldedOutputs) == 0):
+            r += self.bindingSig.serialize()
+        return r
+
+    def rehash(self):
+        self.sha256 = None
+        self.calc_sha256()
+
+    def calc_sha256(self):
+        if self.nVersion >= 5:
+            from . import zip244
+            txid = zip244.txid_digest(self)
+            self.auth_digest = zip244.auth_digest(self)
+        else:
+            txid = hash256(self.serialize())
+            self.auth_digest = b'\xFF'*32
+        if self.sha256 is None:
+            self.sha256 = uint256_from_str(txid)
+        self.hash = encode(txid[::-1], 'hex_codec').decode('ascii')
+        self.auth_digest_hex = encode(self.auth_digest[::-1], 'hex_codec').decode('ascii')
+
+    def is_valid(self):
+        self.calc_sha256()
+        for tout in self.vout:
+            if tout.nValue < 0 or tout.nValue > 21000000 * 100000000:
+                return False
+        return True
+
+    def __repr__(self):
+        r = ("CTransaction(fOverwintered=%r nVersion=%i nVersionGroupId=0x%08x "
+             "vin=%r vout=%r nLockTime=%i nExpiryHeight=%i "
+             "valueBalance=%i shieldedSpends=%r shieldedOutputs=%r"
+             % (self.fOverwintered, self.nVersion, self.nVersionGroupId,
+                self.vin, self.vout, self.nLockTime, self.nExpiryHeight,
+                self.valueBalance, self.shieldedSpends, self.shieldedOutputs))
+        if self.nVersion >= 2:
+            r += " vJoinSplit=%r" % (self.vJoinSplit,)
+            if len(self.vJoinSplit) > 0:
+                r += " joinSplitPubKey=%064x joinSplitSig=%s" \
+                    % (self.joinSplitPubKey, bytes_to_hex_str(self.joinSplitSig))
+        if len(self.shieldedSpends) > 0 or len(self.shieldedOutputs) > 0:
+            r += " bindingSig=%r" % self.bindingSig
+        r += ")"
+        return r
+
+
+class CBlockHeader(object):
+    def __init__(self, header=None):
+        if header is None:
+            self.set_null()
+        else:
+            self.nVersion = header.nVersion
+            self.hashPrevBlock = header.hashPrevBlock
+            self.hashMerkleRoot = header.hashMerkleRoot
+            self.hashFinalSaplingRoot = header.hashFinalSaplingRoot
+            self.nTime = header.nTime
+            self.nBits = header.nBits
+            self.nNonce = header.nNonce
+            self.nSolution = header.nSolution
+            self.sha256 = header.sha256
+            self.hash = header.hash
+            self.calc_sha256()
+
+    def set_null(self):
+        self.nVersion = 4
+        self.hashPrevBlock = 0
+        self.hashMerkleRoot = 0
+        self.hashFinalSaplingRoot = 0
+        self.nTime = 0
+        self.nBits = 0
+        self.nNonce = 0
+        self.nSolution = []
+        self.sha256 = None
+        self.hash = None
+
+    def deserialize(self, f):
+        self.nVersion = struct.unpack("<i", f.read(4))[0]
+        self.hashPrevBlock = deser_uint256(f)
+        self.hashMerkleRoot = deser_uint256(f)
+        self.hashFinalSaplingRoot = deser_uint256(f)
+        self.nTime = struct.unpack("<I", f.read(4))[0]
+        self.nBits = struct.unpack("<I", f.read(4))[0]
+        self.nNonce = deser_uint256(f)
+        self.nSolution = deser_char_vector(f)
+        self.sha256 = None
+        self.hash = None
+
+    def serialize(self):
+        r = b""
+        r += struct.pack("<i", self.nVersion)
+        r += ser_uint256(self.hashPrevBlock)
+        r += ser_uint256(self.hashMerkleRoot)
+        r += ser_uint256(self.hashFinalSaplingRoot)
+        r += struct.pack("<I", self.nTime)
+        r += struct.pack("<I", self.nBits)
+        r += ser_uint256(self.nNonce)
+        r += ser_char_vector(self.nSolution)
+        return r
+
+    def calc_sha256(self):
+        if self.sha256 is None:
+            r = b""
+            r += struct.pack("<i", self.nVersion)
+            r += ser_uint256(self.hashPrevBlock)
+            r += ser_uint256(self.hashMerkleRoot)
+            r += ser_uint256(self.hashFinalSaplingRoot)
+            r += struct.pack("<I", self.nTime)
+            r += struct.pack("<I", self.nBits)
+            r += ser_uint256(self.nNonce)
+            r += ser_char_vector(self.nSolution)
+            self.sha256 = uint256_from_str(hash256(r))
+            self.hash = encode(hash256(r)[::-1], 'hex_codec').decode('ascii')
+
+    def rehash(self):
+        self.sha256 = None
+        self.calc_sha256()
+        return self.sha256
+
+    def __repr__(self):
+        return "CBlockHeader(nVersion=%i hashPrevBlock=%064x hashMerkleRoot=%064x hashFinalSaplingRoot=%064x nTime=%s nBits=%08x nNonce=%064x nSolution=%r)" \
+            % (self.nVersion, self.hashPrevBlock, self.hashMerkleRoot, self.hashFinalSaplingRoot,
+               time.ctime(self.nTime), self.nBits, self.nNonce, self.nSolution)
+
+
+class CBlock(CBlockHeader):
+    def __init__(self, header=None):
+        super(CBlock, self).__init__(header)
+        self.vtx = []
+
+    def deserialize(self, f):
+        super(CBlock, self).deserialize(f)
+        self.vtx = deser_vector(f, CTransaction)
+
+    def serialize(self):
+        r = b""
+        r += super(CBlock, self).serialize()
+        r += ser_vector(self.vtx)
+        return r
+
+    def calc_merkle_root(self):
+        hashes = []
+        for tx in self.vtx:
+            tx.calc_sha256()
+            hashes.append(ser_uint256(tx.sha256))
+        while len(hashes) > 1:
+            newhashes = []
+            for i in range(0, len(hashes), 2):
+                i2 = min(i+1, len(hashes)-1)
+                newhashes.append(hash256(hashes[i] + hashes[i2]))
+            hashes = newhashes
+        return uint256_from_str(hashes[0])
+
+    def calc_auth_data_root(self):
+        hashes = []
+        nleaves = 0
+        for tx in self.vtx:
+            tx.calc_sha256()
+            hashes.append(tx.auth_digest)
+            nleaves += 1
+        # Continue adding leaves (of zeros) until reaching a power of 2
+        while nleaves & (nleaves-1) > 0:
+            hashes.append(b'\x00'*32)
+            nleaves += 1
+        while len(hashes) > 1:
+            newhashes = []
+            for i in range(0, len(hashes), 2):
+                digest = blake2b(digest_size=32, person=b'ZcashAuthDatHash')
+                digest.update(hashes[i])
+                digest.update(hashes[i+1])
+                newhashes.append(digest.digest())
+            hashes = newhashes
+        return uint256_from_str(hashes[0])
+
+    def is_valid(self, n=48, k=5):
+        # H(I||...
+        digest = blake2b(digest_size=(512//n)*n//8, person=zcash_person(n, k))
+        digest.update(super(CBlock, self).serialize()[:108])
+        hash_nonce(digest, self.nNonce)
+        if not gbp_validate(self.nSolution, digest, n, k):
+            return False
+        self.calc_sha256()
+        target = uint256_from_compact(self.nBits)
+        if self.sha256 > target:
+            return False
+        for tx in self.vtx:
+            if not tx.is_valid():
+                return False
+        if self.calc_merkle_root() != self.hashMerkleRoot:
+            return False
+        return True
+
+    def solve(self, n=48, k=5):
+        target = uint256_from_compact(self.nBits)
+        # H(I||...
+        digest = blake2b(digest_size=(512//n)*n//8, person=zcash_person(n, k))
+        digest.update(super(CBlock, self).serialize()[:108])
+        self.nNonce = 0
+        while True:
+            # H(I||V||...
+            curr_digest = digest.copy()
+            hash_nonce(curr_digest, self.nNonce)
+            # (x_1, x_2, ...) = A(I, V, n, k)
+            solns = gbp_basic(curr_digest, n, k)
+            for soln in solns:
+                assert(gbp_validate(curr_digest, soln, n, k))
+                self.nSolution = soln
+                self.rehash()
+                if self.sha256 <= target:
+                    return
+            self.nNonce += 1
+
+    def __repr__(self):
+        return "CBlock(nVersion=%i hashPrevBlock=%064x hashMerkleRoot=%064x hashFinalSaplingRoot=%064x nTime=%s nBits=%08x nNonce=%064x nSolution=%r vtx=%r)" \
+            % (self.nVersion, self.hashPrevBlock, self.hashMerkleRoot,
+               self.hashFinalSaplingRoot, time.ctime(self.nTime), self.nBits,
+               self.nNonce, self.nSolution, self.vtx)
+
+
+class CUnsignedAlert(object):
+    def __init__(self):
+        self.nVersion = 1
+        self.nRelayUntil = 0
+        self.nExpiration = 0
+        self.nID = 0
+        self.nCancel = 0
+        self.setCancel = []
+        self.nMinVer = 0
+        self.nMaxVer = 0
+        self.setSubVer = []
+        self.nPriority = 0
+        self.strComment = b""
+        self.strStatusBar = b""
+        self.strReserved = b""
+
+    def deserialize(self, f):
+        self.nVersion = struct.unpack("<i", f.read(4))[0]
+        self.nRelayUntil = struct.unpack("<q", f.read(8))[0]
+        self.nExpiration = struct.unpack("<q", f.read(8))[0]
+        self.nID = struct.unpack("<i", f.read(4))[0]
+        self.nCancel = struct.unpack("<i", f.read(4))[0]
+        self.setCancel = deser_int_vector(f)
+        self.nMinVer = struct.unpack("<i", f.read(4))[0]
+        self.nMaxVer = struct.unpack("<i", f.read(4))[0]
+        self.setSubVer = deser_string_vector(f)
+        self.nPriority = struct.unpack("<i", f.read(4))[0]
+        self.strComment = deser_string(f)
+        self.strStatusBar = deser_string(f)
+        self.strReserved = deser_string(f)
+
+    def serialize(self):
+        r = b""
+        r += struct.pack("<i", self.nVersion)
+        r += struct.pack("<q", self.nRelayUntil)
+        r += struct.pack("<q", self.nExpiration)
+        r += struct.pack("<i", self.nID)
+        r += struct.pack("<i", self.nCancel)
+        r += ser_int_vector(self.setCancel)
+        r += struct.pack("<i", self.nMinVer)
+        r += struct.pack("<i", self.nMaxVer)
+        r += ser_string_vector(self.setSubVer)
+        r += struct.pack("<i", self.nPriority)
+        r += ser_string(self.strComment)
+        r += ser_string(self.strStatusBar)
+        r += ser_string(self.strReserved)
+        return r
+
+    def __repr__(self):
+        return "CUnsignedAlert(nVersion %d, nRelayUntil %d, nExpiration %d, nID %d, nCancel %d, nMinVer %d, nMaxVer %d, nPriority %d, strComment %s, strStatusBar %s, strReserved %s)" \
+            % (self.nVersion, self.nRelayUntil, self.nExpiration, self.nID,
+               self.nCancel, self.nMinVer, self.nMaxVer, self.nPriority,
+               self.strComment, self.strStatusBar, self.strReserved)
+
+
+class CAlert(object):
+    def __init__(self):
+        self.vchMsg = b""
+        self.vchSig = b""
+
+    def deserialize(self, f):
+        self.vchMsg = deser_string(f)
+        self.vchSig = deser_string(f)
+
+    def serialize(self):
+        r = b""
+        r += ser_string(self.vchMsg)
+        r += ser_string(self.vchSig)
+        return r
+
+    def __repr__(self):
+        return "CAlert(vchMsg.sz %d, vchSig.sz %d)" \
+            % (len(self.vchMsg), len(self.vchSig))
+
+
+# Objects that correspond to messages on the wire
+class msg_version(object):
+    command = b"version"
+
+    def __init__(self, protocol_version=SPROUT_PROTO_VERSION):
+        self.nVersion = protocol_version
+        self.nServices = 1
+        self.nTime = int(time.time())
+        self.addrTo = CAddress()
+        self.addrFrom = CAddress()
+        self.nNonce = random.getrandbits(64)
+        self.strSubVer = MY_SUBVERSION
+        self.nStartingHeight = -1
+
+    def deserialize(self, f):
+        self.nVersion = struct.unpack("<i", f.read(4))[0]
+        if self.nVersion == 10300:
+            self.nVersion = 300
+        self.nServices = struct.unpack("<Q", f.read(8))[0]
+        self.nTime = struct.unpack("<q", f.read(8))[0]
+        self.addrTo = CAddress()
+        self.addrTo.deserialize(f)
+        if self.nVersion >= 106:
+            self.addrFrom = CAddress()
+            self.addrFrom.deserialize(f)
+            self.nNonce = struct.unpack("<Q", f.read(8))[0]
+            self.strSubVer = deser_string(f)
+            if self.nVersion >= 209:
+                self.nStartingHeight = struct.unpack("<i", f.read(4))[0]
+            else:
+                self.nStartingHeight = None
+        else:
+            self.addrFrom = None
+            self.nNonce = None
+            self.strSubVer = None
+            self.nStartingHeight = None
+
+    def serialize(self):
+        r = b""
+        r += struct.pack("<i", self.nVersion)
+        r += struct.pack("<Q", self.nServices)
+        r += struct.pack("<q", self.nTime)
+        r += self.addrTo.serialize()
+        r += self.addrFrom.serialize()
+        r += struct.pack("<Q", self.nNonce)
+        r += ser_string(self.strSubVer)
+        r += struct.pack("<i", self.nStartingHeight)
+        return r
+
+    def __repr__(self):
+        return 'msg_version(nVersion=%i nServices=%i nTime=%s addrTo=%s addrFrom=%s nNonce=0x%016X strSubVer=%s nStartingHeight=%i)' \
+            % (self.nVersion, self.nServices, time.ctime(self.nTime),
+               self.addrTo, self.addrFrom, self.nNonce,
+               self.strSubVer, self.nStartingHeight)
+
+
+class msg_verack(object):
+    command = b"verack"
+
+    def __init__(self):
+        pass
+
+    def deserialize(self, f):
+        pass
+
+    def serialize(self):
+        return b""
+
+    def __repr__(self):
+        return "msg_verack()"
+
+
+class msg_addr(object):
+    command = b"addr"
+
+    def __init__(self):
+        self.addrs = []
+
+    def deserialize(self, f):
+        self.addrs = deser_vector(f, CAddress)
+
+    def serialize(self):
+        return ser_vector(self.addrs)
+
+    def __repr__(self):
+        return "msg_addr(addrs=%r)" % (self.addrs,)
+
+
+class msg_alert(object):
+    command = b"alert"
+
+    def __init__(self):
+        self.alert = CAlert()
+
+    def deserialize(self, f):
+        self.alert = CAlert()
+        self.alert.deserialize(f)
+
+    def serialize(self):
+        r = b""
+        r += self.alert.serialize()
+        return r
+
+    def __repr__(self):
+        return "msg_alert(alert=%s)" % (repr(self.alert), )
+
+
+class msg_inv(object):
+    command = b"inv"
+
+    def __init__(self, inv=None):
+        if inv is None:
+            self.inv = []
+        else:
+            self.inv = inv
+
+    def deserialize(self, f):
+        self.inv = deser_vector(f, CInv)
+
+    def serialize(self):
+        return ser_vector(self.inv)
+
+    def __repr__(self):
+        return "msg_inv(inv=%s)" % (repr(self.inv))
+
+
+class msg_getdata(object):
+    command = b"getdata"
+
+    def __init__(self, inv=None):
+        self.inv = inv if inv != None else []
+
+    def deserialize(self, f):
+        self.inv = deser_vector(f, CInv)
+
+    def serialize(self):
+        return ser_vector(self.inv)
+
+    def __repr__(self):
+        return "msg_getdata(inv=%s)" % (repr(self.inv))
+
+
+class msg_notfound(object):
+    command = b"notfound"
+
+    def __init__(self):
+        self.inv = []
+
+    def deserialize(self, f):
+        self.inv = deser_vector(f, CInv)
+
+    def serialize(self):
+        return ser_vector(self.inv)
+
+    def __repr__(self):
+        return "msg_notfound(inv=%r)" % (self.inv,)
+
+
+class msg_getblocks(object):
+    command = b"getblocks"
+
+    def __init__(self):
+        self.locator = CBlockLocator()
+        self.hashstop = 0
+
+    def deserialize(self, f):
+        self.locator = CBlockLocator()
+        self.locator.deserialize(f)
+        self.hashstop = deser_uint256(f)
+
+    def serialize(self):
+        r = b""
+        r += self.locator.serialize()
+        r += ser_uint256(self.hashstop)
+        return r
+
+    def __repr__(self):
+        return "msg_getblocks(locator=%s hashstop=%064x)" \
+            % (repr(self.locator), self.hashstop)
+
+
+class msg_tx(object):
+    command = b"tx"
+
+    def __init__(self, tx=CTransaction()):
+        self.tx = tx
+
+    def deserialize(self, f):
+        self.tx.deserialize(f)
+
+    def serialize(self):
+        return self.tx.serialize()
+
+    def __repr__(self):
+        return "msg_tx(tx=%s)" % (repr(self.tx))
+
+
+class msg_block(object):
+    command = b"block"
+
+    def __init__(self, block=None):
+        if block is None:
+            self.block = CBlock()
+        else:
+            self.block = block
+
+    def deserialize(self, f):
+        self.block.deserialize(f)
+
+    def serialize(self):
+        return self.block.serialize()
+
+    def __repr__(self):
+        return "msg_block(block=%s)" % (repr(self.block))
+
+
+class msg_getaddr(object):
+    command = b"getaddr"
+
+    def __init__(self):
+        pass
+
+    def deserialize(self, f):
+        pass
+
+    def serialize(self):
+        return b""
+
+    def __repr__(self):
+        return "msg_getaddr()"
+
+
+class msg_ping_prebip31(object):
+    command = b"ping"
+
+    def __init__(self):
+        pass
+
+    def deserialize(self, f):
+        pass
+
+    def serialize(self):
+        return b""
+
+    def __repr__(self):
+        return "msg_ping() (pre-bip31)"
+
+
+class msg_ping(object):
+    command = b"ping"
+
+    def __init__(self, nonce=0):
+        self.nonce = nonce
+
+    def deserialize(self, f):
+        self.nonce = struct.unpack("<Q", f.read(8))[0]
+
+    def serialize(self):
+        r = b""
+        r += struct.pack("<Q", self.nonce)
+        return r
+
+    def __repr__(self):
+        return "msg_ping(nonce=%08x)" % self.nonce
+
+
+class msg_pong(object):
+    command = b"pong"
+
+    def __init__(self, nonce=0):
+        self.nonce = nonce
+
+    def deserialize(self, f):
+        self.nonce = struct.unpack("<Q", f.read(8))[0]
+
+    def serialize(self):
+        r = b""
+        r += struct.pack("<Q", self.nonce)
+        return r
+
+    def __repr__(self):
+        return "msg_pong(nonce=%08x)" % self.nonce
+
+
+class msg_mempool(object):
+    command = b"mempool"
+
+    def __init__(self):
+        pass
+
+    def deserialize(self, f):
+        pass
+
+    def serialize(self):
+        return b""
+
+    def __repr__(self):
+        return "msg_mempool()"
+
+
+# getheaders message has
+# number of entries
+# vector of hashes
+# hash_stop (hash of last desired block header, 0 to get as many as possible)
+class msg_getheaders(object):
+    command = b"getheaders"
+
+    def __init__(self):
+        self.locator = CBlockLocator()
+        self.hashstop = 0
+
+    def deserialize(self, f):
+        self.locator = CBlockLocator()
+        self.locator.deserialize(f)
+        self.hashstop = deser_uint256(f)
+
+    def serialize(self):
+        r = b""
+        r += self.locator.serialize()
+        r += ser_uint256(self.hashstop)
+        return r
+
+    def __repr__(self):
+        return "msg_getheaders(locator=%s, stop=%064x)" \
+            % (repr(self.locator), self.hashstop)
+
+
+# headers message has
+# <count> <vector of block headers>
+class msg_headers(object):
+    command = b"headers"
+
+    def __init__(self):
+        self.headers = []
+
+    def deserialize(self, f):
+        # comment in bitcoind indicates these should be deserialized as blocks
+        blocks = deser_vector(f, CBlock)
+        for x in blocks:
+            self.headers.append(CBlockHeader(x))
+
+    def serialize(self):
+        blocks = [CBlock(x) for x in self.headers]
+        return ser_vector(blocks)
+
+    def __repr__(self):
+        return "msg_headers(headers=%s)" % repr(self.headers)
+
+
+class msg_reject(object):
+    command = b"reject"
+    REJECT_MALFORMED = 1
+
+    def __init__(self):
+        self.message = b""
+        self.code = 0
+        self.reason = b""
+        self.data = 0
+
+    def deserialize(self, f):
+        self.message = deser_string(f)
+        self.code = struct.unpack("<B", f.read(1))[0]
+        self.reason = deser_string(f)
+        if (self.code != self.REJECT_MALFORMED and
+                (self.message == b"block" or self.message == b"tx")):
+            self.data = deser_uint256(f)
+
+    def serialize(self):
+        r = ser_string(self.message)
+        r += struct.pack("<B", self.code)
+        r += ser_string(self.reason)
+        if (self.code != self.REJECT_MALFORMED and
+                (self.message == b"block" or self.message == b"tx")):
+            r += ser_uint256(self.data)
+        return r
+
+    def __eq__(self, other):
+        return (
+            (type(self) == type(other)) and (
+                (self.message, self.code, self.reason, self.data) ==
+                (other.message, other.code, other.reason, other.data)
+            )
+        )
+
+    def __repr__(self):
+        return "msg_reject: %s %d %s [%064x]" \
+            % (self.message, self.code, self.reason, self.data)
+
+
+class msg_filteradd(object):
+    command = b"filteradd"
+
+    def __init__(self):
+        self.data = b""
+
+    def deserialize(self, f):
+        self.data = deser_string(f)
+
+    def serialize(self):
+        return ser_string(self.data)
+
+    def __repr__(self):
+        return "msg_filteradd(data=%r)" % (self.data,)
+
+
+class msg_filterclear(object):
+    command = b"filterclear"
+
+    def __init__(self):
+        pass
+
+    def deserialize(self, f):
+        pass
+
+    def serialize(self):
+        return b""
+
+    def __repr__(self):
+        return "msg_filterclear()"
+
+
+# This is what a callback should look like for NodeConn
+# Reimplement the on_* functions to provide handling for events
+class NodeConnCB(object):
+    def __init__(self):
+        self.verack_received = False
+
+    # Derived classes should call this function once to set the message map
+    # which associates the derived classes' functions to incoming messages
+    def create_callback_map(self):
+        self.cbmap = {
+            b"version": self.on_version,
+            b"verack": self.on_verack,
+            b"addr": self.on_addr,
+            b"alert": self.on_alert,
+            b"inv": self.on_inv,
+            b"getdata": self.on_getdata,
+            b"notfound": self.on_notfound,
+            b"getblocks": self.on_getblocks,
+            b"tx": self.on_tx,
+            b"block": self.on_block,
+            b"getaddr": self.on_getaddr,
+            b"ping": self.on_ping,
+            b"pong": self.on_pong,
+            b"headers": self.on_headers,
+            b"getheaders": self.on_getheaders,
+            b"reject": self.on_reject,
+            b"mempool": self.on_mempool
+        }
+
+    def deliver(self, conn, message):
+        with mininode_lock:
+            try:
+                self.cbmap[message.command](conn, message)
+            except:
+                print("ERROR delivering %r (%s)" % (message,
+                                                    sys.exc_info()[0]))
+
+    def on_version(self, conn, message):
+        if message.nVersion >= 209:
+            conn.send_message(msg_verack())
+        conn.ver_send = min(SPROUT_PROTO_VERSION, message.nVersion)
+        if message.nVersion < 209:
+            conn.ver_recv = conn.ver_send
+
+    def on_verack(self, conn, message):
+        conn.ver_recv = conn.ver_send
+        self.verack_received = True
+
+    def on_inv(self, conn, message):
+        want = msg_getdata()
+        for i in message.inv:
+            if i.type != 0:
+                want.inv.append(i)
+        if len(want.inv):
+            conn.send_message(want)
+
+    def on_addr(self, conn, message): pass
+    def on_alert(self, conn, message): pass
+    def on_getdata(self, conn, message): pass
+    def on_notfound(self, conn, message): pass
+    def on_getblocks(self, conn, message): pass
+    def on_tx(self, conn, message): pass
+    def on_block(self, conn, message): pass
+    def on_getaddr(self, conn, message): pass
+    def on_headers(self, conn, message): pass
+    def on_getheaders(self, conn, message): pass
+    def on_ping(self, conn, message):
+        if conn.ver_send > BIP0031_VERSION:
+            conn.send_message(msg_pong(message.nonce))
+    def on_reject(self, conn, message): pass
+    def on_close(self, conn): pass
+    def on_mempool(self, conn): pass
+    def on_pong(self, conn, message): pass
+
+
+# The actual NodeConn class
+# This class provides an interface for a p2p connection to a specified node
+class NodeConn(asyncore.dispatcher):
+    messagemap = {
+        b"version": msg_version,
+        b"verack": msg_verack,
+        b"addr": msg_addr,
+        b"alert": msg_alert,
+        b"inv": msg_inv,
+        b"getdata": msg_getdata,
+        b"notfound": msg_notfound,
+        b"getblocks": msg_getblocks,
+        b"tx": msg_tx,
+        b"block": msg_block,
+        b"getaddr": msg_getaddr,
+        b"ping": msg_ping,
+        b"pong": msg_pong,
+        b"headers": msg_headers,
+        b"getheaders": msg_getheaders,
+        b"reject": msg_reject,
+        b"mempool": msg_mempool
+    }
+    MAGIC_BYTES = {
+        "mainnet": b"\x24\xe9\x27\x64",   # mainnet
+        "testnet3": b"\xfa\x1a\xf9\xbf",  # testnet3
+        "regtest": b"\xaa\xe8\x3f\x5f"    # regtest
+    }
+
+    def __init__(self, dstaddr, dstport, rpc, callback, net="regtest", protocol_version=SAPLING_PROTO_VERSION):
+        asyncore.dispatcher.__init__(self, map=mininode_socket_map)
+        self.log = logging.getLogger("NodeConn(%s:%d)" % (dstaddr, dstport))
+        self.dstaddr = dstaddr
+        self.dstport = dstport
+        self.create_socket(socket.AF_INET, socket.SOCK_STREAM)
+        self.sendbuf = b""
+        self.recvbuf = b""
+        self.ver_send = 209
+        self.ver_recv = 209
+        self.last_sent = 0
+        self.state = "connecting"
+        self.network = net
+        self.cb = callback
+        self.disconnect = False
+
+        # stuff version msg into sendbuf
+        vt = msg_version(protocol_version)
+        vt.addrTo.ip = self.dstaddr
+        vt.addrTo.port = self.dstport
+        vt.addrFrom.ip = "0.0.0.0"
+        vt.addrFrom.port = 0
+        self.send_message(vt, True)
+        print('MiniNode: Connecting to Bitcoin Node IP # ' + dstaddr + ':' \
+            + str(dstport) + ' using version ' + str(protocol_version))
+
+        try:
+            self.connect((dstaddr, dstport))
+        except:
+            self.handle_close()
+        self.rpc = rpc
+
+    def show_debug_msg(self, msg):
+        self.log.debug(msg)
+
+    def handle_connect(self):
+        self.show_debug_msg("MiniNode: Connected & Listening: \n")
+        self.state = b"connected"
+
+    def handle_close(self):
+        self.show_debug_msg("MiniNode: Closing Connection to %s:%d... "
+                            % (self.dstaddr, self.dstport))
+        self.state = b"closed"
+        self.recvbuf = b""
+        self.sendbuf = b""
+        try:
+            self.close()
+        except:
+            pass
+        self.cb.on_close(self)
+
+    def handle_read(self):
+        try:
+            t = self.recv(8192)
+            if len(t) > 0:
+                self.recvbuf += t
+                self.got_data()
+        except:
+            pass
+
+    def readable(self):
+        return True
+
+    def writable(self):
+        with mininode_lock:
+            length = len(self.sendbuf)
+        return (length > 0)
+
+    def handle_write(self):
+        with mininode_lock:
+            try:
+                sent = self.send(self.sendbuf)
+            except:
+                self.handle_close()
+                return
+            self.sendbuf = self.sendbuf[sent:]
+
+    def got_data(self):
+        try:
+            while True:
+                if len(self.recvbuf) < 4:
+                    return
+                if self.recvbuf[:4] != self.MAGIC_BYTES[self.network]:
+                    raise ValueError("got garbage %r" % (self.recvbuf,))
+                if self.ver_recv < 209:
+                    if len(self.recvbuf) < 4 + 12 + 4:
+                        return
+                    command = self.recvbuf[4:4+12].split(b"\x00", 1)[0]
+                    msglen = struct.unpack("<i", self.recvbuf[4+12:4+12+4])[0]
+                    checksum = None
+                    if len(self.recvbuf) < 4 + 12 + 4 + msglen:
+                        return
+                    msg = self.recvbuf[4+12+4:4+12+4+msglen]
+                    self.recvbuf = self.recvbuf[4+12+4+msglen:]
+                else:
+                    if len(self.recvbuf) < 4 + 12 + 4 + 4:
+                        return
+                    command = self.recvbuf[4:4+12].split(b"\x00", 1)[0]
+                    msglen = struct.unpack("<i", self.recvbuf[4+12:4+12+4])[0]
+                    checksum = self.recvbuf[4+12+4:4+12+4+4]
+                    if len(self.recvbuf) < 4 + 12 + 4 + 4 + msglen:
+                        return
+                    msg = self.recvbuf[4+12+4+4:4+12+4+4+msglen]
+                    th = sha256(msg)
+                    h = sha256(th)
+                    if checksum != h[:4]:
+                        raise ValueError("got bad checksum %r" % (self.recvbuf,))
+                    self.recvbuf = self.recvbuf[4+12+4+4+msglen:]
+                if command in self.messagemap:
+                    f = BytesIO(msg)
+                    t = self.messagemap[command]()
+                    t.deserialize(f)
+                    self.got_message(t)
+                else:
+                    self.show_debug_msg("Unknown command: '" + command + "' " +
+                                        repr(msg))
+        except Exception as e:
+            print('got_data:', repr(e))
+            # import  traceback
+            # traceback.print_tb(sys.exc_info()[2])
+
+    def send_message(self, message, pushbuf=False):
+        if self.state != b"connected" and not pushbuf:
+            return
+        self.show_debug_msg("Send %s" % repr(message))
+        command = message.command
+        data = message.serialize()
+        tmsg = self.MAGIC_BYTES[self.network]
+        tmsg += command
+        tmsg += b"\x00" * (12 - len(command))
+        tmsg += struct.pack("<I", len(data))
+        if self.ver_send >= 209:
+            th = sha256(data)
+            h = sha256(th)
+            tmsg += h[:4]
+        tmsg += data
+        with mininode_lock:
+            self.sendbuf += tmsg
+            self.last_sent = time.time()
+
+    def got_message(self, message):
+        if message.command == b"version":
+            if message.nVersion <= BIP0031_VERSION:
+                self.messagemap[b'ping'] = msg_ping_prebip31
+        if self.last_sent + 30 * 60 < time.time():
+            self.send_message(self.messagemap[b'ping']())
+        self.show_debug_msg("Recv %s" % repr(message))
+        self.cb.deliver(self, message)
+
+    def disconnect_node(self):
+        self.disconnect = True
+
+
+class NetworkThread(Thread):
+    def run(self):
+        while mininode_socket_map:
+            # We check for whether to disconnect outside of the asyncore
+            # loop to workaround the behavior of asyncore when using
+            # select
+            disconnected = []
+            for fd, obj in mininode_socket_map.items():
+                if obj.disconnect:
+                    disconnected.append(obj)
+            [ obj.handle_close() for obj in disconnected ]
+            asyncore.loop(0.1, use_poll=True, map=mininode_socket_map, count=1)
+
+
+# An exception we can raise if we detect a potential disconnect
+# (p2p or rpc) before the test is complete
+class EarlyDisconnectError(Exception):
+    def __init__(self, value):
+        self.value = value
+
+    def __str__(self):
+        return repr(self.value)
diff --git a/depend/zcash/qa/rpc-tests/test_framework/netutil.py b/depend/zcash/qa/rpc-tests/test_framework/netutil.py
new file mode 100644
index 000000000..c8e69fbb2
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/test_framework/netutil.py
@@ -0,0 +1,156 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+# Linux network utilities
+
+import sys
+import socket
+import struct
+import array
+import os
+from binascii import unhexlify, hexlify
+
+# Roughly based on https://web.archive.org/web/20190424172231/http://voorloopnul.com:80/blog/a-python-netstat-in-less-than-100-lines-of-code/ by Ricardo Pascal
+STATE_ESTABLISHED = '01'
+STATE_SYN_SENT  = '02'
+STATE_SYN_RECV = '03'
+STATE_FIN_WAIT1 = '04'
+STATE_FIN_WAIT2 = '05'
+STATE_TIME_WAIT = '06'
+STATE_CLOSE = '07'
+STATE_CLOSE_WAIT = '08'
+STATE_LAST_ACK = '09'
+STATE_LISTEN = '0A'
+STATE_CLOSING = '0B'
+
+def get_socket_inodes(pid):
+    '''
+    Get list of socket inodes for process pid.
+    '''
+    base = '/proc/%i/fd' % pid
+    inodes = []
+    for item in os.listdir(base):
+        target = os.readlink(os.path.join(base, item))
+        if target.startswith('socket:'):
+            inodes.append(int(target[8:-1]))
+    return inodes
+
+def _remove_empty(array):
+    return [x for x in array if x !='']
+
+def _convert_ip_port(array):
+    host,port = array.split(':')
+    # convert host from mangled-per-four-bytes form as used by kernel
+    host = unhexlify(host)
+    host_out = ''
+    for x in range(0, len(host) // 4):
+        (val,) = struct.unpack('=I', host[x*4:(x+1)*4])
+        host_out += '%08x' % val
+
+    return host_out,int(port,16)
+
+def netstat(typ='tcp'):
+    '''
+    Function to return a list with status of tcp connections at linux systems
+    To get pid of all network process running on system, you must run this script
+    as superuser
+    '''
+    with open('/proc/net/'+typ,'r',encoding='utf8') as f:
+        content = f.readlines()
+        content.pop(0)
+    result = []
+    for line in content:
+        line_array = _remove_empty(line.split(' '))     # Split lines and remove empty spaces.
+        tcp_id = line_array[0]
+        l_addr = _convert_ip_port(line_array[1])
+        r_addr = _convert_ip_port(line_array[2])
+        state = line_array[3]
+        inode = int(line_array[9])                      # Need the inode to match with process pid.
+        nline = [tcp_id, l_addr, r_addr, state, inode]
+        result.append(nline)
+    return result
+
+def get_bind_addrs(pid):
+    '''
+    Get bind addresses as (host,port) tuples for process pid.
+    '''
+    inodes = get_socket_inodes(pid)
+    bind_addrs = []
+    for conn in netstat('tcp') + netstat('tcp6'):
+        if conn[3] == STATE_LISTEN and conn[4] in inodes:
+            bind_addrs.append(conn[1])
+    return bind_addrs
+
+# from: https://code.activestate.com/recipes/439093/
+def all_interfaces():
+    '''
+    Return all interfaces that are up
+    '''
+    import fcntl
+    
+    is_64bits = sys.maxsize > 2**32
+    struct_size = 40 if is_64bits else 32
+    s = socket.socket(socket.AF_INET, socket.SOCK_DGRAM)
+    max_possible = 8 # initial value
+    while True:
+        bytes = max_possible * struct_size
+        names = array.array('B', b'\0' * bytes)
+        outbytes = struct.unpack('iL', fcntl.ioctl(
+            s.fileno(),
+            0x8912,  # SIOCGIFCONF
+            struct.pack('iL', bytes, names.buffer_info()[0])
+        ))[0]
+        if outbytes == bytes:
+            max_possible *= 2
+        else:
+            break
+    namestr = names.tostring()
+    return [(namestr[i:i+16].split(b'\0', 1)[0],
+             socket.inet_ntoa(namestr[i+20:i+24]))
+            for i in range(0, outbytes, struct_size)]
+
+def addr_to_hex(addr):
+    '''
+    Convert string IPv4 or IPv6 address to binary address as returned by
+    get_bind_addrs.
+    Very naive implementation that certainly doesn't work for all IPv6 variants.
+    '''
+    if '.' in addr: # IPv4
+        addr = [int(x) for x in addr.split('.')]
+    elif ':' in addr: # IPv6
+        sub = [[], []] # prefix, suffix
+        x = 0
+        addr = addr.split(':')
+        for i,comp in enumerate(addr):
+            if comp == '':
+                if i == 0 or i == (len(addr)-1): # skip empty component at beginning or end
+                    continue
+                x += 1 # :: skips to suffix
+                assert(x < 2)
+            else: # two bytes per component
+                val = int(comp, 16)
+                sub[x].append(val >> 8)
+                sub[x].append(val & 0xff)
+        nullbytes = 16 - len(sub[0]) - len(sub[1])
+        assert((x == 0 and nullbytes == 0) or (x == 1 and nullbytes > 0))
+        addr = sub[0] + ([0] * nullbytes) + sub[1]
+    else:
+        raise ValueError('Could not parse address %s' % addr)
+    return hexlify(bytearray(addr)).decode('ascii')
+
+def test_ipv6_local():
+    '''
+    Check for (local) IPv6 support.
+    '''
+    import socket
+    # By using SOCK_DGRAM this will not actually make a connection, but it will
+    # fail if there is no route to IPv6 localhost.
+    have_ipv6 = True
+    try:
+        s = socket.socket(socket.AF_INET6, socket.SOCK_DGRAM)
+        s.connect(('::1', 0))
+    except socket.error:
+        have_ipv6 = False
+    return have_ipv6
diff --git a/depend/zcash/qa/rpc-tests/test_framework/script.py b/depend/zcash/qa/rpc-tests/test_framework/script.py
new file mode 100644
index 000000000..49192770d
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/test_framework/script.py
@@ -0,0 +1,978 @@
+#!/usr/bin/env python3
+# Copyright (c) 2015-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# script.py
+#
+# This file is modified from python-bitcoinlib.
+#
+
+"""Scripts
+
+Functionality to build scripts, as well as SignatureHash().
+"""
+
+import sys
+bchr = chr
+bord = ord
+if sys.version > '3':
+    long = int
+    bchr = lambda x: bytes([x])
+    bord = lambda x: x
+
+from hashlib import blake2b
+
+from binascii import hexlify
+import struct
+
+from test_framework.bignum import bn2vch
+from test_framework.mininode import (CTransaction, CTxOut, hash256, ser_string, ser_uint256)
+
+MAX_SCRIPT_SIZE = 10000
+MAX_SCRIPT_ELEMENT_SIZE = 520
+MAX_SCRIPT_OPCODES = 201
+
+OPCODE_NAMES = {}
+
+_opcode_instances = []
+class CScriptOp(int):
+    """A single script opcode"""
+    __slots__ = []
+
+    @staticmethod
+    def encode_op_pushdata(d):
+        """Encode a PUSHDATA op, returning bytes"""
+        if len(d) < 0x4c:
+            return b'' + struct.pack('B', len(d)) + d # OP_PUSHDATA
+        elif len(d) <= 0xff:
+            return b'\x4c' + struct.pack('B', len(d)) + d # OP_PUSHDATA1
+        elif len(d) <= 0xffff:
+            return b'\x4d' + struct.pack(b'<H', len(d)) + d # OP_PUSHDATA2
+        elif len(d) <= 0xffffffff:
+            return b'\x4e' + struct.pack(b'<I', len(d)) + d # OP_PUSHDATA4
+        else:
+            raise ValueError("Data too long to encode in a PUSHDATA op")
+
+    @staticmethod
+    def encode_op_n(n):
+        """Encode a small integer op, returning an opcode"""
+        if not (0 <= n <= 16):
+            raise ValueError('Integer must be in range 0 <= n <= 16, got %d' % n)
+
+        if n == 0:
+            return OP_0
+        else:
+            return CScriptOp(OP_1 + n-1)
+
+    def decode_op_n(self):
+        """Decode a small integer opcode, returning an integer"""
+        if self == OP_0:
+            return 0
+
+        if not (self == OP_0 or OP_1 <= self <= OP_16):
+            raise ValueError('op %r is not an OP_N' % self)
+
+        return int(self - OP_1+1)
+
+    def is_small_int(self):
+        """Return true if the op pushes a small integer to the stack"""
+        if 0x51 <= self <= 0x60 or self == 0:
+            return True
+        else:
+            return False
+
+    def __str__(self):
+        return repr(self)
+
+    def __repr__(self):
+        if self in OPCODE_NAMES:
+            return OPCODE_NAMES[self]
+        else:
+            return 'CScriptOp(0x%x)' % self
+
+    def __new__(cls, n):
+        try:
+            return _opcode_instances[n]
+        except IndexError:
+            assert len(_opcode_instances) == n
+            _opcode_instances.append(super(CScriptOp, cls).__new__(cls, n))
+            return _opcode_instances[n]
+
+# Populate opcode instance table
+for n in range(0xff+1):
+    CScriptOp(n)
+
+
+# push value
+OP_0 = CScriptOp(0x00)
+OP_FALSE = OP_0
+OP_PUSHDATA1 = CScriptOp(0x4c)
+OP_PUSHDATA2 = CScriptOp(0x4d)
+OP_PUSHDATA4 = CScriptOp(0x4e)
+OP_1NEGATE = CScriptOp(0x4f)
+OP_RESERVED = CScriptOp(0x50)
+OP_1 = CScriptOp(0x51)
+OP_TRUE=OP_1
+OP_2 = CScriptOp(0x52)
+OP_3 = CScriptOp(0x53)
+OP_4 = CScriptOp(0x54)
+OP_5 = CScriptOp(0x55)
+OP_6 = CScriptOp(0x56)
+OP_7 = CScriptOp(0x57)
+OP_8 = CScriptOp(0x58)
+OP_9 = CScriptOp(0x59)
+OP_10 = CScriptOp(0x5a)
+OP_11 = CScriptOp(0x5b)
+OP_12 = CScriptOp(0x5c)
+OP_13 = CScriptOp(0x5d)
+OP_14 = CScriptOp(0x5e)
+OP_15 = CScriptOp(0x5f)
+OP_16 = CScriptOp(0x60)
+
+# control
+OP_NOP = CScriptOp(0x61)
+OP_VER = CScriptOp(0x62)
+OP_IF = CScriptOp(0x63)
+OP_NOTIF = CScriptOp(0x64)
+OP_VERIF = CScriptOp(0x65)
+OP_VERNOTIF = CScriptOp(0x66)
+OP_ELSE = CScriptOp(0x67)
+OP_ENDIF = CScriptOp(0x68)
+OP_VERIFY = CScriptOp(0x69)
+OP_RETURN = CScriptOp(0x6a)
+
+# stack ops
+OP_TOALTSTACK = CScriptOp(0x6b)
+OP_FROMALTSTACK = CScriptOp(0x6c)
+OP_2DROP = CScriptOp(0x6d)
+OP_2DUP = CScriptOp(0x6e)
+OP_3DUP = CScriptOp(0x6f)
+OP_2OVER = CScriptOp(0x70)
+OP_2ROT = CScriptOp(0x71)
+OP_2SWAP = CScriptOp(0x72)
+OP_IFDUP = CScriptOp(0x73)
+OP_DEPTH = CScriptOp(0x74)
+OP_DROP = CScriptOp(0x75)
+OP_DUP = CScriptOp(0x76)
+OP_NIP = CScriptOp(0x77)
+OP_OVER = CScriptOp(0x78)
+OP_PICK = CScriptOp(0x79)
+OP_ROLL = CScriptOp(0x7a)
+OP_ROT = CScriptOp(0x7b)
+OP_SWAP = CScriptOp(0x7c)
+OP_TUCK = CScriptOp(0x7d)
+
+# splice ops
+OP_CAT = CScriptOp(0x7e)
+OP_SUBSTR = CScriptOp(0x7f)
+OP_LEFT = CScriptOp(0x80)
+OP_RIGHT = CScriptOp(0x81)
+OP_SIZE = CScriptOp(0x82)
+
+# bit logic
+OP_INVERT = CScriptOp(0x83)
+OP_AND = CScriptOp(0x84)
+OP_OR = CScriptOp(0x85)
+OP_XOR = CScriptOp(0x86)
+OP_EQUAL = CScriptOp(0x87)
+OP_EQUALVERIFY = CScriptOp(0x88)
+OP_RESERVED1 = CScriptOp(0x89)
+OP_RESERVED2 = CScriptOp(0x8a)
+
+# numeric
+OP_1ADD = CScriptOp(0x8b)
+OP_1SUB = CScriptOp(0x8c)
+OP_2MUL = CScriptOp(0x8d)
+OP_2DIV = CScriptOp(0x8e)
+OP_NEGATE = CScriptOp(0x8f)
+OP_ABS = CScriptOp(0x90)
+OP_NOT = CScriptOp(0x91)
+OP_0NOTEQUAL = CScriptOp(0x92)
+
+OP_ADD = CScriptOp(0x93)
+OP_SUB = CScriptOp(0x94)
+OP_MUL = CScriptOp(0x95)
+OP_DIV = CScriptOp(0x96)
+OP_MOD = CScriptOp(0x97)
+OP_LSHIFT = CScriptOp(0x98)
+OP_RSHIFT = CScriptOp(0x99)
+
+OP_BOOLAND = CScriptOp(0x9a)
+OP_BOOLOR = CScriptOp(0x9b)
+OP_NUMEQUAL = CScriptOp(0x9c)
+OP_NUMEQUALVERIFY = CScriptOp(0x9d)
+OP_NUMNOTEQUAL = CScriptOp(0x9e)
+OP_LESSTHAN = CScriptOp(0x9f)
+OP_GREATERTHAN = CScriptOp(0xa0)
+OP_LESSTHANOREQUAL = CScriptOp(0xa1)
+OP_GREATERTHANOREQUAL = CScriptOp(0xa2)
+OP_MIN = CScriptOp(0xa3)
+OP_MAX = CScriptOp(0xa4)
+
+OP_WITHIN = CScriptOp(0xa5)
+
+# crypto
+OP_RIPEMD160 = CScriptOp(0xa6)
+OP_SHA1 = CScriptOp(0xa7)
+OP_SHA256 = CScriptOp(0xa8)
+OP_HASH160 = CScriptOp(0xa9)
+OP_HASH256 = CScriptOp(0xaa)
+OP_CODESEPARATOR = CScriptOp(0xab)
+OP_CHECKSIG = CScriptOp(0xac)
+OP_CHECKSIGVERIFY = CScriptOp(0xad)
+OP_CHECKMULTISIG = CScriptOp(0xae)
+OP_CHECKMULTISIGVERIFY = CScriptOp(0xaf)
+
+# expansion
+OP_NOP1 = CScriptOp(0xb0)
+OP_NOP2 = CScriptOp(0xb1)
+OP_NOP3 = CScriptOp(0xb2)
+OP_NOP4 = CScriptOp(0xb3)
+OP_NOP5 = CScriptOp(0xb4)
+OP_NOP6 = CScriptOp(0xb5)
+OP_NOP7 = CScriptOp(0xb6)
+OP_NOP8 = CScriptOp(0xb7)
+OP_NOP9 = CScriptOp(0xb8)
+OP_NOP10 = CScriptOp(0xb9)
+
+# template matching params
+OP_SMALLINTEGER = CScriptOp(0xfa)
+OP_PUBKEYS = CScriptOp(0xfb)
+OP_PUBKEYHASH = CScriptOp(0xfd)
+OP_PUBKEY = CScriptOp(0xfe)
+
+OP_INVALIDOPCODE = CScriptOp(0xff)
+
+VALID_OPCODES = {
+    OP_1NEGATE,
+    OP_RESERVED,
+    OP_1,
+    OP_2,
+    OP_3,
+    OP_4,
+    OP_5,
+    OP_6,
+    OP_7,
+    OP_8,
+    OP_9,
+    OP_10,
+    OP_11,
+    OP_12,
+    OP_13,
+    OP_14,
+    OP_15,
+    OP_16,
+
+    OP_NOP,
+    OP_VER,
+    OP_IF,
+    OP_NOTIF,
+    OP_VERIF,
+    OP_VERNOTIF,
+    OP_ELSE,
+    OP_ENDIF,
+    OP_VERIFY,
+    OP_RETURN,
+
+    OP_TOALTSTACK,
+    OP_FROMALTSTACK,
+    OP_2DROP,
+    OP_2DUP,
+    OP_3DUP,
+    OP_2OVER,
+    OP_2ROT,
+    OP_2SWAP,
+    OP_IFDUP,
+    OP_DEPTH,
+    OP_DROP,
+    OP_DUP,
+    OP_NIP,
+    OP_OVER,
+    OP_PICK,
+    OP_ROLL,
+    OP_ROT,
+    OP_SWAP,
+    OP_TUCK,
+
+    OP_CAT,
+    OP_SUBSTR,
+    OP_LEFT,
+    OP_RIGHT,
+    OP_SIZE,
+
+    OP_INVERT,
+    OP_AND,
+    OP_OR,
+    OP_XOR,
+    OP_EQUAL,
+    OP_EQUALVERIFY,
+    OP_RESERVED1,
+    OP_RESERVED2,
+
+    OP_1ADD,
+    OP_1SUB,
+    OP_2MUL,
+    OP_2DIV,
+    OP_NEGATE,
+    OP_ABS,
+    OP_NOT,
+    OP_0NOTEQUAL,
+
+    OP_ADD,
+    OP_SUB,
+    OP_MUL,
+    OP_DIV,
+    OP_MOD,
+    OP_LSHIFT,
+    OP_RSHIFT,
+
+    OP_BOOLAND,
+    OP_BOOLOR,
+    OP_NUMEQUAL,
+    OP_NUMEQUALVERIFY,
+    OP_NUMNOTEQUAL,
+    OP_LESSTHAN,
+    OP_GREATERTHAN,
+    OP_LESSTHANOREQUAL,
+    OP_GREATERTHANOREQUAL,
+    OP_MIN,
+    OP_MAX,
+
+    OP_WITHIN,
+
+    OP_RIPEMD160,
+    OP_SHA1,
+    OP_SHA256,
+    OP_HASH160,
+    OP_HASH256,
+    OP_CHECKSIG,
+    OP_CHECKSIGVERIFY,
+    OP_CHECKMULTISIG,
+    OP_CHECKMULTISIGVERIFY,
+
+    OP_NOP1,
+    OP_NOP2,
+    OP_NOP3,
+    OP_NOP4,
+    OP_NOP5,
+    OP_NOP6,
+    OP_NOP7,
+    OP_NOP8,
+    OP_NOP9,
+    OP_NOP10,
+
+    OP_SMALLINTEGER,
+    OP_PUBKEYS,
+    OP_PUBKEYHASH,
+    OP_PUBKEY,
+}
+
+OPCODE_NAMES.update({
+    OP_0 : 'OP_0',
+    OP_PUSHDATA1 : 'OP_PUSHDATA1',
+    OP_PUSHDATA2 : 'OP_PUSHDATA2',
+    OP_PUSHDATA4 : 'OP_PUSHDATA4',
+    OP_1NEGATE : 'OP_1NEGATE',
+    OP_RESERVED : 'OP_RESERVED',
+    OP_1 : 'OP_1',
+    OP_2 : 'OP_2',
+    OP_3 : 'OP_3',
+    OP_4 : 'OP_4',
+    OP_5 : 'OP_5',
+    OP_6 : 'OP_6',
+    OP_7 : 'OP_7',
+    OP_8 : 'OP_8',
+    OP_9 : 'OP_9',
+    OP_10 : 'OP_10',
+    OP_11 : 'OP_11',
+    OP_12 : 'OP_12',
+    OP_13 : 'OP_13',
+    OP_14 : 'OP_14',
+    OP_15 : 'OP_15',
+    OP_16 : 'OP_16',
+    OP_NOP : 'OP_NOP',
+    OP_VER : 'OP_VER',
+    OP_IF : 'OP_IF',
+    OP_NOTIF : 'OP_NOTIF',
+    OP_VERIF : 'OP_VERIF',
+    OP_VERNOTIF : 'OP_VERNOTIF',
+    OP_ELSE : 'OP_ELSE',
+    OP_ENDIF : 'OP_ENDIF',
+    OP_VERIFY : 'OP_VERIFY',
+    OP_RETURN : 'OP_RETURN',
+    OP_TOALTSTACK : 'OP_TOALTSTACK',
+    OP_FROMALTSTACK : 'OP_FROMALTSTACK',
+    OP_2DROP : 'OP_2DROP',
+    OP_2DUP : 'OP_2DUP',
+    OP_3DUP : 'OP_3DUP',
+    OP_2OVER : 'OP_2OVER',
+    OP_2ROT : 'OP_2ROT',
+    OP_2SWAP : 'OP_2SWAP',
+    OP_IFDUP : 'OP_IFDUP',
+    OP_DEPTH : 'OP_DEPTH',
+    OP_DROP : 'OP_DROP',
+    OP_DUP : 'OP_DUP',
+    OP_NIP : 'OP_NIP',
+    OP_OVER : 'OP_OVER',
+    OP_PICK : 'OP_PICK',
+    OP_ROLL : 'OP_ROLL',
+    OP_ROT : 'OP_ROT',
+    OP_SWAP : 'OP_SWAP',
+    OP_TUCK : 'OP_TUCK',
+    OP_CAT : 'OP_CAT',
+    OP_SUBSTR : 'OP_SUBSTR',
+    OP_LEFT : 'OP_LEFT',
+    OP_RIGHT : 'OP_RIGHT',
+    OP_SIZE : 'OP_SIZE',
+    OP_INVERT : 'OP_INVERT',
+    OP_AND : 'OP_AND',
+    OP_OR : 'OP_OR',
+    OP_XOR : 'OP_XOR',
+    OP_EQUAL : 'OP_EQUAL',
+    OP_EQUALVERIFY : 'OP_EQUALVERIFY',
+    OP_RESERVED1 : 'OP_RESERVED1',
+    OP_RESERVED2 : 'OP_RESERVED2',
+    OP_1ADD : 'OP_1ADD',
+    OP_1SUB : 'OP_1SUB',
+    OP_2MUL : 'OP_2MUL',
+    OP_2DIV : 'OP_2DIV',
+    OP_NEGATE : 'OP_NEGATE',
+    OP_ABS : 'OP_ABS',
+    OP_NOT : 'OP_NOT',
+    OP_0NOTEQUAL : 'OP_0NOTEQUAL',
+    OP_ADD : 'OP_ADD',
+    OP_SUB : 'OP_SUB',
+    OP_MUL : 'OP_MUL',
+    OP_DIV : 'OP_DIV',
+    OP_MOD : 'OP_MOD',
+    OP_LSHIFT : 'OP_LSHIFT',
+    OP_RSHIFT : 'OP_RSHIFT',
+    OP_BOOLAND : 'OP_BOOLAND',
+    OP_BOOLOR : 'OP_BOOLOR',
+    OP_NUMEQUAL : 'OP_NUMEQUAL',
+    OP_NUMEQUALVERIFY : 'OP_NUMEQUALVERIFY',
+    OP_NUMNOTEQUAL : 'OP_NUMNOTEQUAL',
+    OP_LESSTHAN : 'OP_LESSTHAN',
+    OP_GREATERTHAN : 'OP_GREATERTHAN',
+    OP_LESSTHANOREQUAL : 'OP_LESSTHANOREQUAL',
+    OP_GREATERTHANOREQUAL : 'OP_GREATERTHANOREQUAL',
+    OP_MIN : 'OP_MIN',
+    OP_MAX : 'OP_MAX',
+    OP_WITHIN : 'OP_WITHIN',
+    OP_RIPEMD160 : 'OP_RIPEMD160',
+    OP_SHA1 : 'OP_SHA1',
+    OP_SHA256 : 'OP_SHA256',
+    OP_HASH160 : 'OP_HASH160',
+    OP_HASH256 : 'OP_HASH256',
+    OP_CODESEPARATOR : 'OP_CODESEPARATOR',
+    OP_CHECKSIG : 'OP_CHECKSIG',
+    OP_CHECKSIGVERIFY : 'OP_CHECKSIGVERIFY',
+    OP_CHECKMULTISIG : 'OP_CHECKMULTISIG',
+    OP_CHECKMULTISIGVERIFY : 'OP_CHECKMULTISIGVERIFY',
+    OP_NOP1 : 'OP_NOP1',
+    OP_NOP2 : 'OP_NOP2',
+    OP_NOP3 : 'OP_NOP3',
+    OP_NOP4 : 'OP_NOP4',
+    OP_NOP5 : 'OP_NOP5',
+    OP_NOP6 : 'OP_NOP6',
+    OP_NOP7 : 'OP_NOP7',
+    OP_NOP8 : 'OP_NOP8',
+    OP_NOP9 : 'OP_NOP9',
+    OP_NOP10 : 'OP_NOP10',
+    OP_SMALLINTEGER : 'OP_SMALLINTEGER',
+    OP_PUBKEYS : 'OP_PUBKEYS',
+    OP_PUBKEYHASH : 'OP_PUBKEYHASH',
+    OP_PUBKEY : 'OP_PUBKEY',
+    OP_INVALIDOPCODE : 'OP_INVALIDOPCODE',
+})
+
+OPCODES_BY_NAME = {
+    'OP_0' : OP_0,
+    'OP_PUSHDATA1' : OP_PUSHDATA1,
+    'OP_PUSHDATA2' : OP_PUSHDATA2,
+    'OP_PUSHDATA4' : OP_PUSHDATA4,
+    'OP_1NEGATE' : OP_1NEGATE,
+    'OP_RESERVED' : OP_RESERVED,
+    'OP_1' : OP_1,
+    'OP_2' : OP_2,
+    'OP_3' : OP_3,
+    'OP_4' : OP_4,
+    'OP_5' : OP_5,
+    'OP_6' : OP_6,
+    'OP_7' : OP_7,
+    'OP_8' : OP_8,
+    'OP_9' : OP_9,
+    'OP_10' : OP_10,
+    'OP_11' : OP_11,
+    'OP_12' : OP_12,
+    'OP_13' : OP_13,
+    'OP_14' : OP_14,
+    'OP_15' : OP_15,
+    'OP_16' : OP_16,
+    'OP_NOP' : OP_NOP,
+    'OP_VER' : OP_VER,
+    'OP_IF' : OP_IF,
+    'OP_NOTIF' : OP_NOTIF,
+    'OP_VERIF' : OP_VERIF,
+    'OP_VERNOTIF' : OP_VERNOTIF,
+    'OP_ELSE' : OP_ELSE,
+    'OP_ENDIF' : OP_ENDIF,
+    'OP_VERIFY' : OP_VERIFY,
+    'OP_RETURN' : OP_RETURN,
+    'OP_TOALTSTACK' : OP_TOALTSTACK,
+    'OP_FROMALTSTACK' : OP_FROMALTSTACK,
+    'OP_2DROP' : OP_2DROP,
+    'OP_2DUP' : OP_2DUP,
+    'OP_3DUP' : OP_3DUP,
+    'OP_2OVER' : OP_2OVER,
+    'OP_2ROT' : OP_2ROT,
+    'OP_2SWAP' : OP_2SWAP,
+    'OP_IFDUP' : OP_IFDUP,
+    'OP_DEPTH' : OP_DEPTH,
+    'OP_DROP' : OP_DROP,
+    'OP_DUP' : OP_DUP,
+    'OP_NIP' : OP_NIP,
+    'OP_OVER' : OP_OVER,
+    'OP_PICK' : OP_PICK,
+    'OP_ROLL' : OP_ROLL,
+    'OP_ROT' : OP_ROT,
+    'OP_SWAP' : OP_SWAP,
+    'OP_TUCK' : OP_TUCK,
+    'OP_CAT' : OP_CAT,
+    'OP_SUBSTR' : OP_SUBSTR,
+    'OP_LEFT' : OP_LEFT,
+    'OP_RIGHT' : OP_RIGHT,
+    'OP_SIZE' : OP_SIZE,
+    'OP_INVERT' : OP_INVERT,
+    'OP_AND' : OP_AND,
+    'OP_OR' : OP_OR,
+    'OP_XOR' : OP_XOR,
+    'OP_EQUAL' : OP_EQUAL,
+    'OP_EQUALVERIFY' : OP_EQUALVERIFY,
+    'OP_RESERVED1' : OP_RESERVED1,
+    'OP_RESERVED2' : OP_RESERVED2,
+    'OP_1ADD' : OP_1ADD,
+    'OP_1SUB' : OP_1SUB,
+    'OP_2MUL' : OP_2MUL,
+    'OP_2DIV' : OP_2DIV,
+    'OP_NEGATE' : OP_NEGATE,
+    'OP_ABS' : OP_ABS,
+    'OP_NOT' : OP_NOT,
+    'OP_0NOTEQUAL' : OP_0NOTEQUAL,
+    'OP_ADD' : OP_ADD,
+    'OP_SUB' : OP_SUB,
+    'OP_MUL' : OP_MUL,
+    'OP_DIV' : OP_DIV,
+    'OP_MOD' : OP_MOD,
+    'OP_LSHIFT' : OP_LSHIFT,
+    'OP_RSHIFT' : OP_RSHIFT,
+    'OP_BOOLAND' : OP_BOOLAND,
+    'OP_BOOLOR' : OP_BOOLOR,
+    'OP_NUMEQUAL' : OP_NUMEQUAL,
+    'OP_NUMEQUALVERIFY' : OP_NUMEQUALVERIFY,
+    'OP_NUMNOTEQUAL' : OP_NUMNOTEQUAL,
+    'OP_LESSTHAN' : OP_LESSTHAN,
+    'OP_GREATERTHAN' : OP_GREATERTHAN,
+    'OP_LESSTHANOREQUAL' : OP_LESSTHANOREQUAL,
+    'OP_GREATERTHANOREQUAL' : OP_GREATERTHANOREQUAL,
+    'OP_MIN' : OP_MIN,
+    'OP_MAX' : OP_MAX,
+    'OP_WITHIN' : OP_WITHIN,
+    'OP_RIPEMD160' : OP_RIPEMD160,
+    'OP_SHA1' : OP_SHA1,
+    'OP_SHA256' : OP_SHA256,
+    'OP_HASH160' : OP_HASH160,
+    'OP_HASH256' : OP_HASH256,
+    'OP_CODESEPARATOR' : OP_CODESEPARATOR,
+    'OP_CHECKSIG' : OP_CHECKSIG,
+    'OP_CHECKSIGVERIFY' : OP_CHECKSIGVERIFY,
+    'OP_CHECKMULTISIG' : OP_CHECKMULTISIG,
+    'OP_CHECKMULTISIGVERIFY' : OP_CHECKMULTISIGVERIFY,
+    'OP_NOP1' : OP_NOP1,
+    'OP_NOP2' : OP_NOP2,
+    'OP_NOP3' : OP_NOP3,
+    'OP_NOP4' : OP_NOP4,
+    'OP_NOP5' : OP_NOP5,
+    'OP_NOP6' : OP_NOP6,
+    'OP_NOP7' : OP_NOP7,
+    'OP_NOP8' : OP_NOP8,
+    'OP_NOP9' : OP_NOP9,
+    'OP_NOP10' : OP_NOP10,
+    'OP_SMALLINTEGER' : OP_SMALLINTEGER,
+    'OP_PUBKEYS' : OP_PUBKEYS,
+    'OP_PUBKEYHASH' : OP_PUBKEYHASH,
+    'OP_PUBKEY' : OP_PUBKEY,
+}
+
+class CScriptInvalidError(Exception):
+    """Base class for CScript exceptions"""
+    pass
+
+class CScriptTruncatedPushDataError(CScriptInvalidError):
+    """Invalid pushdata due to truncation"""
+    def __init__(self, msg, data):
+        self.data = data
+        super(CScriptTruncatedPushDataError, self).__init__(msg)
+
+# This is used, eg, for blockchain heights in coinbase scripts (bip34)
+class CScriptNum(object):
+    def __init__(self, d=0):
+        self.value = d
+
+    @staticmethod
+    def encode(obj):
+        r = bytearray(0)
+        if obj.value == 0:
+            return bytes(r)
+        neg = obj.value < 0
+        absvalue = -obj.value if neg else obj.value
+        while (absvalue):
+            r.append(absvalue & 0xff)
+            absvalue >>= 8
+        if r[-1] & 0x80:
+            r.append(0x80 if neg else 0)
+        elif neg:
+            r[-1] |= 0x80
+        return struct.pack("B", len(r)) + r
+
+
+class CScript(bytes):
+    """Serialized script
+
+    A bytes subclass, so you can use this directly whenever bytes are accepted.
+    Note that this means that indexing does *not* work - you'll get an index by
+    byte rather than opcode. This format was chosen for efficiency so that the
+    general case would not require creating a lot of little CScriptOP objects.
+
+    iter(script) however does iterate by opcode.
+    """
+    @classmethod
+    def __coerce_instance(cls, other):
+        # Coerce other into bytes
+        if isinstance(other, CScriptOp):
+            other = bytes([other])
+        elif isinstance(other, CScriptNum):
+            if (other.value == 0):
+                other = bytes([CScriptOp(OP_0)])
+            else:
+                other = CScriptNum.encode(other)
+        elif isinstance(other, int):
+            if 0 <= other <= 16:
+                other = bytes([CScriptOp.encode_op_n(other)])
+            elif other == -1:
+                other = bytes([OP_1NEGATE])
+            else:
+                other = CScriptOp.encode_op_pushdata(bn2vch(other))
+        elif isinstance(other, (bytes, bytearray)):
+            other = bytes(CScriptOp.encode_op_pushdata(other))
+        return other
+
+    def __add__(self, other):
+        # Do the coercion outside of the try block so that errors in it are
+        # noticed.
+        other = self.__coerce_instance(other)
+
+        try:
+            # bytes.__add__ always returns bytes instances unfortunately
+            return CScript(super(CScript, self).__add__(other))
+        except TypeError:
+            raise TypeError('Can not add a %r instance to a CScript' % other.__class__)
+
+    def join(self, iterable):
+        # join makes no sense for a CScript()
+        raise NotImplementedError
+
+    def __new__(cls, value=b''):
+        if isinstance(value, bytes) or isinstance(value, bytearray):
+            return super(CScript, cls).__new__(cls, value)
+        else:
+            def coerce_iterable(iterable):
+                for instance in iterable:
+                    yield cls.__coerce_instance(instance)
+            # Annoyingly on both python2 and python3 bytes.join() always
+            # returns a bytes instance even when subclassed.
+            return super(CScript, cls).__new__(cls, b''.join(coerce_iterable(value)))
+
+    def raw_iter(self):
+        """Raw iteration
+
+        Yields tuples of (opcode, data, sop_idx) so that the different possible
+        PUSHDATA encodings can be accurately distinguished, as well as
+        determining the exact opcode byte indexes. (sop_idx)
+        """
+        i = 0
+        while i < len(self):
+            sop_idx = i
+            opcode = bord(self[i])
+            i += 1
+
+            if opcode > OP_PUSHDATA4:
+                yield (opcode, None, sop_idx)
+            else:
+                datasize = None
+                pushdata_type = None
+                if opcode < OP_PUSHDATA1:
+                    pushdata_type = 'PUSHDATA(%d)' % opcode
+                    datasize = opcode
+
+                elif opcode == OP_PUSHDATA1:
+                    pushdata_type = 'PUSHDATA1'
+                    if i >= len(self):
+                        raise CScriptInvalidError('PUSHDATA1: missing data length')
+                    datasize = bord(self[i])
+                    i += 1
+
+                elif opcode == OP_PUSHDATA2:
+                    pushdata_type = 'PUSHDATA2'
+                    if i + 1 >= len(self):
+                        raise CScriptInvalidError('PUSHDATA2: missing data length')
+                    datasize = bord(self[i]) + (bord(self[i+1]) << 8)
+                    i += 2
+
+                elif opcode == OP_PUSHDATA4:
+                    pushdata_type = 'PUSHDATA4'
+                    if i + 3 >= len(self):
+                        raise CScriptInvalidError('PUSHDATA4: missing data length')
+                    datasize = bord(self[i]) + (bord(self[i+1]) << 8) + (bord(self[i+2]) << 16) + (bord(self[i+3]) << 24)
+                    i += 4
+
+                else:
+                    assert False # shouldn't happen
+
+
+                data = bytes(self[i:i+datasize])
+
+                # Check for truncation
+                if len(data) < datasize:
+                    raise CScriptTruncatedPushDataError('%s: truncated data' % pushdata_type, data)
+
+                i += datasize
+
+                yield (opcode, data, sop_idx)
+
+    def __iter__(self):
+        """'Cooked' iteration
+
+        Returns either a CScriptOP instance, an integer, or bytes, as
+        appropriate.
+
+        See raw_iter() if you need to distinguish the different possible
+        PUSHDATA encodings.
+        """
+        for (opcode, data, sop_idx) in self.raw_iter():
+            if data is not None:
+                yield data
+            else:
+                opcode = CScriptOp(opcode)
+
+                if opcode.is_small_int():
+                    yield opcode.decode_op_n()
+                else:
+                    yield CScriptOp(opcode)
+
+    def __repr__(self):
+        # For Python3 compatibility add b before strings so testcases don't
+        # need to change
+        def _repr(o):
+            if isinstance(o, bytes):
+                return b"x('%s')" % hexlify(o).decode('ascii')
+            else:
+                return repr(o)
+
+        ops = []
+        i = iter(self)
+        while True:
+            op = None
+            try:
+                op = _repr(next(i))
+            except CScriptTruncatedPushDataError as err:
+                op = '%s...<ERROR: %s>' % (_repr(err.data), err)
+                break
+            except CScriptInvalidError as err:
+                op = '<ERROR: %s>' % err
+                break
+            except StopIteration:
+                break
+            finally:
+                if op is not None:
+                    ops.append(op)
+
+        return "CScript([%s])" % ', '.join(ops)
+
+    def GetSigOpCount(self, fAccurate):
+        """Get the SigOp count.
+
+        fAccurate - Accurately count CHECKMULTISIG, see BIP16 for details.
+
+        Note that this is consensus-critical.
+        """
+        n = 0
+        lastOpcode = OP_INVALIDOPCODE
+        for (opcode, data, sop_idx) in self.raw_iter():
+            if opcode in (OP_CHECKSIG, OP_CHECKSIGVERIFY):
+                n += 1
+            elif opcode in (OP_CHECKMULTISIG, OP_CHECKMULTISIGVERIFY):
+                if fAccurate and (OP_1 <= lastOpcode <= OP_16):
+                    n += opcode.decode_op_n()
+                else:
+                    n += 20
+            lastOpcode = opcode
+        return n
+
+
+SIGHASH_ALL = 1
+SIGHASH_NONE = 2
+SIGHASH_SINGLE = 3
+SIGHASH_ANYONECANPAY = 0x80
+
+def getHashPrevouts(tx, person=b'ZcashPrevoutHash'):
+    digest = blake2b(digest_size=32, person=person)
+    for x in tx.vin:
+        digest.update(x.prevout.serialize())
+    return digest.digest()
+
+def getHashSequence(tx, person=b'ZcashSequencHash'):
+    digest = blake2b(digest_size=32, person=person)
+    for x in tx.vin:
+        digest.update(struct.pack('<I', x.nSequence))
+    return digest.digest()
+
+def getHashOutputs(tx, person=b'ZcashOutputsHash'):
+    digest = blake2b(digest_size=32, person=person)
+    for x in tx.vout:
+        digest.update(x.serialize())
+    return digest.digest()
+
+def getHashJoinSplits(tx):
+    digest = blake2b(digest_size=32, person=b'ZcashJSplitsHash')
+    for jsdesc in tx.vJoinSplit:
+        digest.update(jsdesc.serialize())
+    digest.update(tx.joinSplitPubKey)
+    return digest.digest()
+
+def getHashShieldedSpends(tx):
+    digest = blake2b(digest_size=32, person=b'ZcashSSpendsHash')
+    for desc in tx.shieldedSpends:
+        # We don't pass in serialized form of desc as spendAuthSig is not part of the hash
+        digest.update(ser_uint256(desc.cv))
+        digest.update(ser_uint256(desc.anchor))
+        digest.update(ser_uint256(desc.nullifier))
+        digest.update(ser_uint256(desc.rk))
+        digest.update(desc.proof)
+    return digest.digest()
+
+def getHashShieldedOutputs(tx):
+    digest = blake2b(digest_size=32, person=b'ZcashSOutputHash')
+    for desc in tx.shieldedOutputs:
+        digest.update(desc.serialize())
+    return digest.digest()
+
+
+def SignatureHash(script, txTo, inIdx, hashtype, amount, consensusBranchId):
+    """Consensus-correct SignatureHash"""
+    if inIdx >= len(txTo.vin):
+        raise ValueError("inIdx %d out of range (%d)" % (inIdx, len(txTo.vin)))
+
+    if consensusBranchId != 0:
+        # ZIP 243
+        hashPrevouts = b'\x00'*32
+        hashSequence = b'\x00'*32
+        hashOutputs = b'\x00'*32
+        hashJoinSplits = b'\x00'*32
+        hashShieldedSpends = b'\x00'*32
+        hashShieldedOutputs = b'\x00'*32
+
+        if not (hashtype & SIGHASH_ANYONECANPAY):
+            hashPrevouts = getHashPrevouts(txTo)
+
+        if (not (hashtype & SIGHASH_ANYONECANPAY)) and \
+            (hashtype & 0x1f) != SIGHASH_SINGLE and \
+            (hashtype & 0x1f) != SIGHASH_NONE:
+            hashSequence = getHashSequence(txTo)
+
+        if (hashtype & 0x1f) != SIGHASH_SINGLE and \
+            (hashtype & 0x1f) != SIGHASH_NONE:
+            hashOutputs = getHashOutputs(txTo)
+        elif (hashtype & 0x1f) == SIGHASH_SINGLE and \
+            0 <= inIdx and inIdx < len(txTo.vout):
+            digest = blake2b(digest_size=32, person=b'ZcashOutputsHash')
+            digest.update(txTo.vout[inIdx].serialize())
+            hashOutputs = digest.digest()
+
+        if len(txTo.vJoinSplit) > 0:
+            hashJoinSplits = getHashJoinSplits(txTo)
+
+        if len(txTo.shieldedSpends) > 0:
+            hashShieldedSpends = getHashShieldedSpends(txTo)
+
+        if len(txTo.shieldedOutputs) > 0:
+            hashShieldedOutputs = getHashShieldedOutputs(txTo)
+
+        digest = blake2b(
+            digest_size=32,
+            person=b'ZcashSigHash' + struct.pack('<I', consensusBranchId),
+        )
+
+        digest.update(struct.pack('<I', (int(txTo.fOverwintered)<<31) | txTo.nVersion))
+        digest.update(struct.pack('<I', txTo.nVersionGroupId))
+        digest.update(hashPrevouts)
+        digest.update(hashSequence)
+        digest.update(hashOutputs)
+        digest.update(hashJoinSplits)
+        digest.update(hashShieldedSpends)
+        digest.update(hashShieldedOutputs)
+        digest.update(struct.pack('<I', txTo.nLockTime))
+        digest.update(struct.pack('<I', txTo.nExpiryHeight))
+        digest.update(struct.pack('<Q', txTo.valueBalance))
+        digest.update(struct.pack('<I', hashtype))
+
+        if inIdx is not None:
+            digest.update(txTo.vin[inIdx].prevout.serialize())
+            digest.update(ser_string(script))
+            digest.update(struct.pack('<Q', amount))
+            digest.update(struct.pack('<I', txTo.vin[inIdx].nSequence))
+
+        return (digest.digest(), None)
+    else:
+        # Pre-Overwinter
+        txtmp = CTransaction(txTo)
+
+        for txin in txtmp.vin:
+            txin.scriptSig = b''
+        txtmp.vin[inIdx].scriptSig = script
+
+        if (hashtype & 0x1f) == SIGHASH_NONE:
+            txtmp.vout = []
+
+            for i in range(len(txtmp.vin)):
+                if i != inIdx:
+                    txtmp.vin[i].nSequence = 0
+
+        elif (hashtype & 0x1f) == SIGHASH_SINGLE:
+            outIdx = inIdx
+            if outIdx >= len(txtmp.vout):
+                raise ValueError("outIdx %d out of range (%d)" % (outIdx, len(txtmp.vout)))
+
+            tmp = txtmp.vout[outIdx]
+            txtmp.vout = []
+            for i in range(outIdx):
+                txtmp.vout.append(CTxOut())
+            txtmp.vout.append(tmp)
+
+            for i in range(len(txtmp.vin)):
+                if i != inIdx:
+                    txtmp.vin[i].nSequence = 0
+
+        if hashtype & SIGHASH_ANYONECANPAY:
+            tmp = txtmp.vin[inIdx]
+            txtmp.vin = []
+            txtmp.vin.append(tmp)
+
+        s = txtmp.serialize()
+        s += struct.pack(b"<I", hashtype)
+
+        hash = hash256(s)
+
+        return (hash, None)
diff --git a/depend/zcash/qa/rpc-tests/test_framework/socks5.py b/depend/zcash/qa/rpc-tests/test_framework/socks5.py
new file mode 100644
index 000000000..29b289b93
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/test_framework/socks5.py
@@ -0,0 +1,161 @@
+#!/usr/bin/env python3
+# Copyright (c) 2015-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+'''
+Dummy Socks5 server for testing.
+'''
+
+import socket, threading, queue
+import traceback, sys
+
+### Protocol constants
+class Command:
+    CONNECT = 0x01
+
+class AddressType:
+    IPV4 = 0x01
+    DOMAINNAME = 0x03
+    IPV6 = 0x04
+
+### Utility functions
+def recvall(s, n):
+    '''Receive n bytes from a socket, or fail'''
+    rv = bytearray()
+    while n > 0:
+        d = s.recv(n)
+        if not d:
+            raise IOError('Unexpected end of stream')
+        rv.extend(d)
+        n -= len(d)
+    return rv
+
+### Implementation classes
+class Socks5Configuration(object):
+    '''Proxy configuration'''
+    def __init__(self):
+        self.addr = None # Bind address (must be set)
+        self.af = socket.AF_INET # Bind address family
+        self.unauth = False  # Support unauthenticated
+        self.auth = False  # Support authentication
+
+class Socks5Command(object):
+    '''Information about an incoming socks5 command'''
+    def __init__(self, cmd, atyp, addr, port, username, password):
+        self.cmd = cmd # Command (one of Command.*)
+        self.atyp = atyp # Address type (one of AddressType.*)
+        self.addr = addr # Address
+        self.port = port # Port to connect to
+        self.username = username
+        self.password = password
+    def __repr__(self):
+        return 'Socks5Command(%s,%s,%s,%s,%s,%s)' % (self.cmd, self.atyp, self.addr, self.port, self.username, self.password)
+
+class Socks5Connection(object):
+    def __init__(self, serv, conn, peer):
+        self.serv = serv
+        self.conn = conn
+        self.peer = peer
+
+    def handle(self):
+        '''
+        Handle socks5 request according to RFC1928
+        '''
+        try:
+            # Verify socks version
+            ver = recvall(self.conn, 1)[0]
+            if ver != 0x05:
+                raise IOError('Invalid socks version %i' % ver)
+            # Choose authentication method
+            nmethods = recvall(self.conn, 1)[0]
+            methods = bytearray(recvall(self.conn, nmethods))
+            method = None
+            if 0x02 in methods and self.serv.conf.auth:
+                method = 0x02 # username/password
+            elif 0x00 in methods and self.serv.conf.unauth:
+                method = 0x00 # unauthenticated
+            if method is None:
+                raise IOError('No supported authentication method was offered')
+            # Send response
+            self.conn.sendall(bytearray([0x05, method]))
+            # Read authentication (optional)
+            username = None
+            password = None
+            if method == 0x02:
+                ver = recvall(self.conn, 1)[0]
+                if ver != 0x01:
+                    raise IOError('Invalid auth packet version %i' % ver)
+                ulen = recvall(self.conn, 1)[0]
+                username = str(recvall(self.conn, ulen))
+                plen = recvall(self.conn, 1)[0]
+                password = str(recvall(self.conn, plen))
+                # Send authentication response
+                self.conn.sendall(bytearray([0x01, 0x00]))
+
+            # Read connect request
+            (ver,cmd,rsv,atyp) = recvall(self.conn, 4)
+            if ver != 0x05:
+                raise IOError('Invalid socks version %i in connect request' % ver)
+            if cmd != Command.CONNECT:
+                raise IOError('Unhandled command %i in connect request' % cmd)
+
+            if atyp == AddressType.IPV4:
+                addr = recvall(self.conn, 4)
+            elif atyp == AddressType.DOMAINNAME:
+                n = recvall(self.conn, 1)[0]
+                addr = recvall(self.conn, n)
+            elif atyp == AddressType.IPV6:
+                addr = recvall(self.conn, 16)
+            else:
+                raise IOError('Unknown address type %i' % atyp)
+            port_hi,port_lo = recvall(self.conn, 2)
+            port = (port_hi << 8) | port_lo
+
+            # Send dummy response
+            self.conn.sendall(bytearray([0x05, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]))
+
+            cmdin = Socks5Command(cmd, atyp, addr, port, username, password)
+            self.serv.queue.put(cmdin)
+            print('Proxy: ', cmdin)
+            # Fall through to disconnect
+        except Exception as e:
+            traceback.print_exc(file=sys.stderr)
+            self.serv.queue.put(e)
+        finally:
+            self.conn.close()
+
+class Socks5Server(object):
+    def __init__(self, conf):
+        self.conf = conf
+        self.s = socket.socket(conf.af)
+        self.s.setsockopt(socket.SOL_SOCKET, socket.SO_REUSEADDR, 1)
+        self.s.bind(conf.addr)
+        self.s.listen(5)
+        self.running = False
+        self.thread = None
+        self.queue = queue.Queue() # report connections and exceptions to client
+
+    def run(self):
+        while self.running:
+            (sockconn, peer) = self.s.accept()
+            if self.running:
+                conn = Socks5Connection(self, sockconn, peer)
+                thread = threading.Thread(None, conn.handle)
+                thread.daemon = True
+                thread.start()
+    
+    def start(self):
+        assert(not self.running)
+        self.running = True
+        self.thread = threading.Thread(None, self.run)
+        self.thread.daemon = True
+        self.thread.start()
+
+    def stop(self):
+        self.running = False
+        # connect to self to end run loop
+        s = socket.socket(self.conf.af)
+        s.connect(self.conf.addr)
+        s.close()
+        self.thread.join()
+
diff --git a/depend/zcash/qa/rpc-tests/test_framework/test_framework.py b/depend/zcash/qa/rpc-tests/test_framework/test_framework.py
new file mode 100755
index 000000000..d83692504
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/test_framework/test_framework.py
@@ -0,0 +1,212 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+# Base class for RPC testing
+
+import logging
+import optparse
+import os
+import sys
+import shutil
+import tempfile
+import traceback
+
+from .authproxy import JSONRPCException
+from .util import (
+    ZCASHD_BINARY,
+    initialize_chain,
+    start_nodes,
+    connect_nodes_bi,
+    sync_blocks,
+    sync_mempools,
+    stop_nodes,
+    wait_bitcoinds,
+    enable_coverage,
+    check_json_precision,
+    initialize_chain_clean,
+    PortSeed,
+)
+
+
+class BitcoinTestFramework(object):
+
+    def __init__(self):
+        self.num_nodes = 4
+        self.setup_clean_chain = False
+        self.nodes = None
+
+    def run_test(self):
+        raise NotImplementedError
+
+    def add_options(self, parser):
+        pass
+
+    def setup_chain(self):
+        print("Initializing test directory "+self.options.tmpdir)
+        if self.setup_clean_chain:
+            initialize_chain_clean(self.options.tmpdir, self.num_nodes)
+        else:
+            initialize_chain(self.options.tmpdir, self.num_nodes, self.options.cachedir)
+
+    def setup_nodes(self):
+        return start_nodes(self.num_nodes, self.options.tmpdir)
+
+    def setup_network(self, split = False, do_mempool_sync = True):
+        self.nodes = self.setup_nodes()
+
+        # Connect the nodes as a "chain".  This allows us
+        # to split the network between nodes 1 and 2 to get
+        # two halves that can work on competing chains.
+
+        # If we joined network halves, connect the nodes from the joint
+        # on outward.  This ensures that chains are properly reorganised.
+        if not split:
+            connect_nodes_bi(self.nodes, 1, 2)
+            sync_blocks(self.nodes[1:3])
+            if do_mempool_sync:
+                sync_mempools(self.nodes[1:3])
+
+        connect_nodes_bi(self.nodes, 0, 1)
+        connect_nodes_bi(self.nodes, 2, 3)
+        self.is_network_split = split
+        self.sync_all(do_mempool_sync)
+
+    def split_network(self):
+        """
+        Split the network of four nodes into nodes 0/1 and 2/3.
+        """
+        assert not self.is_network_split
+        stop_nodes(self.nodes)
+        wait_bitcoinds()
+        self.setup_network(True)
+
+    def sync_all(self, do_mempool_sync = True):
+        if self.is_network_split:
+            sync_blocks(self.nodes[:2])
+            sync_blocks(self.nodes[2:])
+            if do_mempool_sync:
+                sync_mempools(self.nodes[:2])
+                sync_mempools(self.nodes[2:])
+        else:
+            sync_blocks(self.nodes)
+            if do_mempool_sync:
+                sync_mempools(self.nodes)
+
+    def join_network(self):
+        """
+        Join the (previously split) network halves together.
+        """
+        assert self.is_network_split
+        stop_nodes(self.nodes)
+        wait_bitcoinds()
+        self.setup_network(False, False)
+
+    def main(self):
+
+        parser = optparse.OptionParser(usage="%prog [options]")
+        parser.add_option("--nocleanup", dest="nocleanup", default=False, action="store_true",
+                          help="Leave bitcoinds and test.* datadir on exit or error")
+        parser.add_option("--noshutdown", dest="noshutdown", default=False, action="store_true",
+                          help="Don't stop bitcoinds after the test execution")
+        parser.add_option("--srcdir", dest="srcdir", default="../../src",
+                          help="Source directory containing bitcoind/bitcoin-cli (default: %default)")
+        parser.add_option("--cachedir", dest="cachedir", default=os.path.normpath(os.path.dirname(os.path.realpath(__file__))+"/../../cache"),
+                          help="Directory for caching pregenerated datadirs")
+        parser.add_option("--tmpdir", dest="tmpdir", default=tempfile.mkdtemp(prefix="test"),
+                          help="Root directory for datadirs")
+        parser.add_option("--tracerpc", dest="trace_rpc", default=False, action="store_true",
+                          help="Print out all RPC calls as they are made")
+        parser.add_option("--portseed", dest="port_seed", default=os.getpid(), type='int',
+                          help="The seed to use for assigning port numbers (default: current process id)")
+        parser.add_option("--coveragedir", dest="coveragedir",
+                          help="Write tested RPC commands into this directory")
+        self.add_options(parser)
+        (self.options, self.args) = parser.parse_args()
+
+        self.options.tmpdir += '/' + str(self.options.port_seed)
+
+        if self.options.trace_rpc:
+            logging.basicConfig(level=logging.DEBUG, stream=sys.stdout)
+
+        if self.options.coveragedir:
+            enable_coverage(self.options.coveragedir)
+
+        PortSeed.n = self.options.port_seed
+
+        os.environ['PATH'] = self.options.srcdir+":"+os.environ['PATH']
+
+        check_json_precision()
+
+        success = False
+        try:
+            os.makedirs(self.options.tmpdir, exist_ok=False)
+            self.setup_chain()
+            self.setup_network()
+            self.run_test()
+            success = True
+        except JSONRPCException as e:
+            print("JSONRPC error: "+e.error['message'])
+            traceback.print_tb(sys.exc_info()[2])
+        except AssertionError as e:
+            print("Assertion failed: " + str(e))
+            traceback.print_tb(sys.exc_info()[2])
+        except KeyError as e:
+            print("key not found: "+ str(e))
+            traceback.print_tb(sys.exc_info()[2])
+        except Exception as e:
+            print("Unexpected exception caught during testing: "+str(e))
+            traceback.print_tb(sys.exc_info()[2])
+        except KeyboardInterrupt as e:
+            print("Exiting after " + repr(e))
+
+        if not self.options.noshutdown:
+            print("Stopping nodes")
+            stop_nodes(self.nodes)
+            wait_bitcoinds()
+        else:
+            print("Note: bitcoinds were not stopped and may still be running")
+
+        if not self.options.nocleanup and not self.options.noshutdown:
+            print("Cleaning up")
+            shutil.rmtree(self.options.tmpdir)
+
+        if success:
+            print("Tests successful")
+            sys.exit(0)
+        else:
+            print("Failed")
+            sys.exit(1)
+
+
+# Test framework for doing p2p comparison testing, which sets up some bitcoind
+# binaries:
+# 1 binary: test binary
+# 2 binaries: 1 test binary, 1 ref binary
+# n>2 binaries: 1 test binary, n-1 ref binaries
+
+class ComparisonTestFramework(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 1
+        self.setup_clean_chain = True
+
+    def add_options(self, parser):
+        parser.add_option("--testbinary", dest="testbinary",
+                          default=os.getenv("ZCASHD", ZCASHD_BINARY),
+                          help="zcashd binary to test")
+        parser.add_option("--refbinary", dest="refbinary",
+                          default=os.getenv("ZCASHD", ZCASHD_BINARY),
+                          help="zcashd binary to use for reference nodes (if any)")
+
+    def setup_network(self):
+        self.nodes = start_nodes(
+            self.num_nodes, self.options.tmpdir,
+            extra_args=[['-debug', '-whitelist=127.0.0.1']] * self.num_nodes,
+            binary=[self.options.testbinary] +
+            [self.options.refbinary]*(self.num_nodes-1))
+
+    def get_tests(self):
+        raise NotImplementedError
diff --git a/depend/zcash/qa/rpc-tests/test_framework/util.py b/depend/zcash/qa/rpc-tests/test_framework/util.py
new file mode 100644
index 000000000..04cccee84
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/test_framework/util.py
@@ -0,0 +1,675 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+
+#
+# Helpful routines for regression testing
+#
+
+import os
+import sys
+
+from binascii import hexlify, unhexlify
+from base64 import b64encode
+from decimal import Decimal, ROUND_DOWN
+import json
+import http.client
+import random
+import shutil
+import subprocess
+import tempfile
+import time
+import re
+import errno
+
+from . import coverage
+from .authproxy import AuthServiceProxy, JSONRPCException
+
+ZCASHD_BINARY = os.path.join('src', 'zcashd')
+
+DEFAULT_FEE = Decimal('0.00001')
+DEFAULT_FEE_ZATS = 1000
+
+COVERAGE_DIR = None
+PRE_BLOSSOM_BLOCK_TARGET_SPACING = 150
+POST_BLOSSOM_BLOCK_TARGET_SPACING = 75
+
+SPROUT_BRANCH_ID = 0x00000000
+OVERWINTER_BRANCH_ID = 0x5BA81B19
+SAPLING_BRANCH_ID = 0x76B809BB
+BLOSSOM_BRANCH_ID = 0x2BB40E60
+HEARTWOOD_BRANCH_ID = 0xF5B9230B
+CANOPY_BRANCH_ID = 0xE9FF75A6
+NU5_BRANCH_ID = 0xC2D6D0B4
+
+# The maximum number of nodes a single test can spawn
+MAX_NODES = 8
+# Don't assign rpc or p2p ports lower than this
+PORT_MIN = 11000
+# The number of ports to "reserve" for p2p and rpc, each
+PORT_RANGE = 5000
+
+
+class PortSeed:
+    # Must be initialized with a unique integer for each process
+    n = None
+
+def enable_coverage(dirname):
+    """Maintain a log of which RPC calls are made during testing."""
+    global COVERAGE_DIR
+    COVERAGE_DIR = dirname
+
+
+def get_rpc_proxy(url, node_number, timeout=None):
+    """
+    Args:
+        url (str): URL of the RPC server to call
+        node_number (int): the node number (or id) that this calls to
+
+    Kwargs:
+        timeout (int): HTTP timeout in seconds
+
+    Returns:
+        AuthServiceProxy. convenience object for making RPC calls.
+
+    """
+    proxy_kwargs = {}
+    if timeout is not None:
+        proxy_kwargs['timeout'] = timeout
+
+    proxy = AuthServiceProxy(url, **proxy_kwargs)
+    proxy.url = url  # store URL on proxy for info
+
+    coverage_logfile = coverage.get_filename(
+        COVERAGE_DIR, node_number) if COVERAGE_DIR else None
+
+    return coverage.AuthServiceProxyWrapper(proxy, coverage_logfile)
+
+
+def p2p_port(n):
+    assert(n <= MAX_NODES)
+    return PORT_MIN + n + (MAX_NODES * PortSeed.n) % (PORT_RANGE - 1 - MAX_NODES)
+
+def rpc_port(n):
+    return PORT_MIN + PORT_RANGE + n + (MAX_NODES * PortSeed.n) % (PORT_RANGE - 1 - MAX_NODES)
+
+def check_json_precision():
+    """Make sure json library being used does not lose precision converting BTC values"""
+    n = Decimal("20000000.00000003")
+    satoshis = int(json.loads(json.dumps(float(n)))*1.0e8)
+    if satoshis != 2000000000000003:
+        raise RuntimeError("JSON encode/decode loses precision")
+
+def bytes_to_hex_str(byte_str):
+    return hexlify(byte_str).decode('ascii')
+
+def hex_str_to_bytes(hex_str):
+    return unhexlify(hex_str.encode('ascii'))
+
+def str_to_b64str(string):
+    return b64encode(string.encode('utf-8')).decode('ascii')
+
+def sync_blocks(rpc_connections, wait=0.125, timeout=60, allow_different_tips=False):
+    """
+    Wait until everybody has the same tip, and has notified
+    all internal listeners of them.
+
+    If allow_different_tips is True, waits until everyone has
+    the same block count.
+    """
+    while timeout > 0:
+        if allow_different_tips:
+            tips = [ x.getblockcount() for x in rpc_connections ]
+        else:
+            tips = [ x.getbestblockhash() for x in rpc_connections ]
+        if tips == [ tips[0] ]*len(tips):
+            break
+        time.sleep(wait)
+        timeout -= wait
+
+    # Now that the block counts are in sync, wait for the internal
+    # notifications to finish
+    while timeout > 0:
+        notified = [ x.getblockchaininfo()['fullyNotified'] for x in rpc_connections ]
+        if notified == [ True ] * len(notified):
+            return True
+        time.sleep(wait)
+        timeout -= wait
+
+    raise AssertionError("Block sync failed")
+
+def sync_mempools(rpc_connections, wait=0.5, timeout=60):
+    """
+    Wait until everybody has the same transactions in their memory
+    pools, and has notified all internal listeners of them
+    """
+    while timeout > 0:
+        pool = set(rpc_connections[0].getrawmempool())
+        num_match = 1
+        for i in range(1, len(rpc_connections)):
+            if set(rpc_connections[i].getrawmempool()) == pool:
+                num_match = num_match+1
+        if num_match == len(rpc_connections):
+            break
+        time.sleep(wait)
+        timeout -= wait
+
+    # Now that the mempools are in sync, wait for the internal
+    # notifications to finish
+    while timeout > 0:
+        notified = [ x.getmempoolinfo()['fullyNotified'] for x in rpc_connections ]
+        if notified == [ True ] * len(notified):
+            return True
+        time.sleep(wait)
+        timeout -= wait
+
+    raise AssertionError("Mempool sync failed")
+
+bitcoind_processes = {}
+
+def initialize_datadir(dirname, n):
+    datadir = os.path.join(dirname, "node"+str(n))
+    if not os.path.isdir(datadir):
+        os.makedirs(datadir)
+    rpc_u, rpc_p = rpc_auth_pair(n)
+    with open(os.path.join(datadir, "zcash.conf"), 'w', encoding='utf8') as f:
+        f.write("regtest=1\n")
+        f.write("showmetrics=0\n")
+        f.write("rpcuser=" + rpc_u + "\n")
+        f.write("rpcpassword=" + rpc_p + "\n")
+        f.write("port="+str(p2p_port(n))+"\n")
+        f.write("rpcport="+str(rpc_port(n))+"\n")
+        f.write("listenonion=0\n")
+    return datadir
+
+def rpc_auth_pair(n):
+    return 'rpcuser💻' + str(n), 'rpcpass🔑' + str(n)
+
+def rpc_url(i, rpchost=None):
+    rpc_u, rpc_p = rpc_auth_pair(i)
+    host = '127.0.0.1'
+    port = rpc_port(i)
+    if rpchost:
+        parts = rpchost.split(':')
+        if len(parts) == 2:
+            host, port = parts
+        else:
+            host = rpchost
+    return "http://%s:%s@%s:%d" % (rpc_u, rpc_p, host, int(port))
+
+def wait_for_bitcoind_start(process, url, i):
+    '''
+    Wait for bitcoind to start. This means that RPC is accessible and fully initialized.
+    Raise an exception if bitcoind exits during initialization.
+    '''
+    while True:
+        if process.poll() is not None:
+            raise Exception('bitcoind exited with status %i during initialization' % process.returncode)
+        try:
+            rpc = get_rpc_proxy(url, i)
+            rpc.getblockcount()
+            break # break out of loop on success
+        except IOError as e:
+            if e.errno != errno.ECONNREFUSED: # Port not yet open?
+                raise # unknown IO error
+        except JSONRPCException as e: # Initialization phase
+            if e.error['code'] != -28: # RPC in warmup?
+                raise # unknown JSON RPC exception
+        time.sleep(0.25)
+
+def initialize_chain(test_dir, num_nodes, cachedir):
+    """
+    Create a cache of a 200-block-long chain (with wallet) for MAX_NODES
+    Afterward, create num_nodes copies from the cache
+    """
+
+    # Due to the consensus change fix for the timejacking attack, we need to
+    # ensure that the cache is pretty fresh. Specifically, we need the median
+    # time past of the chain tip of the cache to be no more than 90 minutes
+    # behind the current local time, or else mined blocks will be rejected by
+    # all nodes, halting the test. With Sapling active by default, this requires
+    # the chain tip itself to be no more than 75 minutes behind the current
+    # local time.
+    #
+    # We address this here, by regenerating the cache if it is more than 60
+    # minutes old. This gives 15 minutes of slack initially that an RPC test has
+    # to complete in, if it is started right at the oldest cache time. Within an
+    # individual test, the first five calls to `generate` will each advance the
+    # median time past of the chain tip by 2.5 minutes (with Sapling active by
+    # default). Therefore, if the logic between the completion of any two
+    # adjacent calls to `generate` within a test takes longer than 2.5 minutes,
+    # the excess will subtract from the slack.
+    if os.path.isdir(os.path.join(cachedir, "node0")):
+        if os.stat(cachedir).st_mtime + (60 * 60) < time.time():
+            print("initialize_chain(): Removing stale cache")
+            shutil.rmtree(cachedir)
+
+    assert num_nodes <= MAX_NODES
+    create_cache = False
+    for i in range(MAX_NODES):
+        if not os.path.isdir(os.path.join(cachedir, 'node'+str(i))):
+            create_cache = True
+            break
+
+    if create_cache:
+
+        #find and delete old cache directories if any exist
+        for i in range(MAX_NODES):
+            if os.path.isdir(os.path.join(cachedir,"node"+str(i))):
+                shutil.rmtree(os.path.join(cachedir,"node"+str(i)))
+
+        # Create cache directories, run bitcoinds:
+        for i in range(MAX_NODES):
+            datadir=initialize_datadir(cachedir, i)
+            args = [ os.getenv("ZCASHD", ZCASHD_BINARY), "-keypool=1", "-datadir="+datadir, "-discover=0" ]
+            args.extend([
+                '-nuparams=5ba81b19:1', # Overwinter
+                '-nuparams=76b809bb:1', # Sapling
+            ])
+            if i > 0:
+                args.append("-connect=127.0.0.1:"+str(p2p_port(0)))
+            bitcoind_processes[i] = subprocess.Popen(args)
+            if os.getenv("PYTHON_DEBUG", ""):
+                print("initialize_chain: bitcoind started, waiting for RPC to come up")
+            wait_for_bitcoind_start(bitcoind_processes[i], rpc_url(i), i)
+            if os.getenv("PYTHON_DEBUG", ""):
+                print("initialize_chain: RPC successfully started")
+
+        rpcs = []
+        for i in range(MAX_NODES):
+            try:
+                rpcs.append(get_rpc_proxy(rpc_url(i), i))
+            except:
+                sys.stderr.write("Error connecting to "+rpc_url(i)+"\n")
+                sys.exit(1)
+
+        # Create a 200-block-long chain; each of the 4 first nodes
+        # gets 25 mature blocks and 25 immature.
+        # Note: To preserve compatibility with older versions of
+        # initialize_chain, only 4 nodes will generate coins.
+        #
+        # Blocks are created with timestamps 2.5 minutes apart (matching the
+        # chain defaulting above to Sapling active), starting 200 * 2.5 minutes
+        # before the current time.
+        block_time = int(time.time()) - (200 * PRE_BLOSSOM_BLOCK_TARGET_SPACING)
+        for i in range(2):
+            for peer in range(4):
+                for j in range(25):
+                    set_node_times(rpcs, block_time)
+                    rpcs[peer].generate(1)
+                    block_time += PRE_BLOSSOM_BLOCK_TARGET_SPACING
+                # Must sync before next peer starts generating blocks
+                sync_blocks(rpcs)
+        # Check that local time isn't going backwards
+        assert_greater_than(time.time() + 1, block_time)
+
+        # Shut them down, and clean up cache directories:
+        stop_nodes(rpcs)
+        wait_bitcoinds()
+        for i in range(MAX_NODES):
+            os.remove(log_filename(cachedir, i, "debug.log"))
+            os.remove(log_filename(cachedir, i, "db.log"))
+            os.remove(log_filename(cachedir, i, "peers.dat"))
+            os.remove(log_filename(cachedir, i, "fee_estimates.dat"))
+
+    for i in range(num_nodes):
+        from_dir = os.path.join(cachedir, "node"+str(i))
+        to_dir = os.path.join(test_dir,  "node"+str(i))
+        shutil.copytree(from_dir, to_dir)
+        initialize_datadir(test_dir, i) # Overwrite port/rpcport in zcash.conf
+
+def initialize_chain_clean(test_dir, num_nodes):
+    """
+    Create an empty blockchain and num_nodes wallets.
+    Useful if a test case wants complete control over initialization.
+    """
+    for i in range(num_nodes):
+        initialize_datadir(test_dir, i)
+
+
+def _rpchost_to_args(rpchost):
+    '''Convert optional IP:port spec to rpcconnect/rpcport args'''
+    if rpchost is None:
+        return []
+
+    match = re.match('(\[[0-9a-fA-f:]+\]|[^:]+)(?::([0-9]+))?$', rpchost)
+    if not match:
+        raise ValueError('Invalid RPC host spec ' + rpchost)
+
+    rpcconnect = match.group(1)
+    rpcport = match.group(2)
+
+    if rpcconnect.startswith('['): # remove IPv6 [...] wrapping
+        rpcconnect = rpcconnect[1:-1]
+
+    rv = ['-rpcconnect=' + rpcconnect]
+    if rpcport:
+        rv += ['-rpcport=' + rpcport]
+    return rv
+
+def start_node(i, dirname, extra_args=None, rpchost=None, timewait=None, binary=None, stderr=None):
+    """
+    Start a bitcoind and return RPC connection to it
+    """
+    datadir = os.path.join(dirname, "node"+str(i))
+    if binary is None:
+        binary = os.getenv("ZCASHD", ZCASHD_BINARY)
+    args = [ binary, "-datadir="+datadir, "-keypool=1", "-discover=0", "-rest" ]
+    args.extend([
+        '-nuparams=5ba81b19:1', # Overwinter
+        '-nuparams=76b809bb:1', # Sapling
+    ])
+    if extra_args is not None: args.extend(extra_args)
+    bitcoind_processes[i] = subprocess.Popen(args, stderr=stderr)
+    if os.getenv("PYTHON_DEBUG", ""):
+        print("start_node: bitcoind started, waiting for RPC to come up")
+    url = rpc_url(i, rpchost)
+    wait_for_bitcoind_start(bitcoind_processes[i], url, i)
+    if os.getenv("PYTHON_DEBUG", ""):
+        print("start_node: RPC successfully started")
+    proxy = get_rpc_proxy(url, i, timeout=timewait)
+
+    if COVERAGE_DIR:
+        coverage.write_all_rpc_commands(COVERAGE_DIR, proxy)
+
+    return proxy
+
+def assert_start_raises_init_error(i, dirname, extra_args=None, expected_msg=None):
+    with tempfile.SpooledTemporaryFile(max_size=2**16) as log_stderr:
+        try:
+            node = start_node(i, dirname, extra_args, stderr=log_stderr)
+            stop_node(node, i)
+        except Exception as e:
+            assert 'bitcoind exited' in str(e) #node must have shutdown
+            if expected_msg is not None:
+                log_stderr.seek(0)
+                stderr = log_stderr.read().decode('utf-8')
+                if expected_msg not in stderr:
+                    raise AssertionError("Expected error \"" + expected_msg + "\" not found in:\n" + stderr)
+        else:
+            if expected_msg is None:
+                assert_msg = "bitcoind should have exited with an error"
+            else:
+                assert_msg = "bitcoind should have exited with expected error " + expected_msg
+            raise AssertionError(assert_msg)
+
+def start_nodes(num_nodes, dirname, extra_args=None, rpchost=None, binary=None):
+    """
+    Start multiple bitcoinds, return RPC connections to them
+    """
+    if extra_args is None: extra_args = [ None for _ in range(num_nodes) ]
+    if binary is None: binary = [ None for _ in range(num_nodes) ]
+    rpcs = []
+    try:
+        for i in range(num_nodes):
+            rpcs.append(start_node(i, dirname, extra_args[i], rpchost, binary=binary[i]))
+    except: # If one node failed to start, stop the others
+        stop_nodes(rpcs)
+        raise
+    return rpcs
+
+def log_filename(dirname, n_node, logname):
+    return os.path.join(dirname, "node"+str(n_node), "regtest", logname)
+
+def check_node(i):
+    bitcoind_processes[i].poll()
+    return bitcoind_processes[i].returncode
+
+def stop_node(node, i):
+    try:
+        node.stop()
+    except http.client.CannotSendRequest as e:
+        print("WARN: Unable to stop node: " + repr(e))
+    bitcoind_processes[i].wait()
+    del bitcoind_processes[i]
+
+def stop_nodes(nodes):
+    for node in nodes:
+        try:
+            node.stop()
+        except http.client.CannotSendRequest as e:
+            print("WARN: Unable to stop node: " + repr(e))
+    del nodes[:] # Emptying array closes connections as a side effect
+
+def set_node_times(nodes, t):
+    for node in nodes:
+        node.setmocktime(t)
+
+def wait_bitcoinds():
+    # Wait for all bitcoinds to cleanly exit
+    for bitcoind in list(bitcoind_processes.values()):
+        bitcoind.wait()
+    bitcoind_processes.clear()
+
+def connect_nodes(from_connection, node_num):
+    ip_port = "127.0.0.1:"+str(p2p_port(node_num))
+    from_connection.addnode(ip_port, "onetry")
+    # poll until version handshake complete to avoid race conditions
+    # with transaction relaying
+    while any(peer['version'] == 0 for peer in from_connection.getpeerinfo()):
+        time.sleep(0.1)
+
+def connect_nodes_bi(nodes, a, b):
+    connect_nodes(nodes[a], b)
+    connect_nodes(nodes[b], a)
+
+def find_output(node, txid, amount):
+    """
+    Return index to output of txid with value amount
+    Raises exception if there is none.
+    """
+    txdata = node.getrawtransaction(txid, 1)
+    for i in range(len(txdata["vout"])):
+        if txdata["vout"][i]["value"] == amount:
+            return i
+    raise RuntimeError("find_output txid %s : %s not found"%(txid,str(amount)))
+
+
+def gather_inputs(from_node, amount_needed, confirmations_required=1):
+    """
+    Return a random set of unspent txouts that are enough to pay amount_needed
+    """
+    assert(confirmations_required >=0)
+    utxo = from_node.listunspent(confirmations_required)
+    random.shuffle(utxo)
+    inputs = []
+    total_in = Decimal("0.00000000")
+    while total_in < amount_needed and len(utxo) > 0:
+        t = utxo.pop()
+        total_in += t["amount"]
+        inputs.append({ "txid" : t["txid"], "vout" : t["vout"], "address" : t["address"] } )
+    if total_in < amount_needed:
+        raise RuntimeError("Insufficient funds: need %d, have %d"%(amount_needed, total_in))
+    return (total_in, inputs)
+
+def make_change(from_node, amount_in, amount_out, fee):
+    """
+    Create change output(s), return them
+    """
+    outputs = {}
+    amount = amount_out+fee
+    change = amount_in - amount
+    if change > amount*2:
+        # Create an extra change output to break up big inputs
+        change_address = from_node.getnewaddress()
+        # Split change in two, being careful of rounding:
+        outputs[change_address] = Decimal(change/2).quantize(Decimal('0.00000001'), rounding=ROUND_DOWN)
+        change = amount_in - amount - outputs[change_address]
+    if change > 0:
+        outputs[from_node.getnewaddress()] = change
+    return outputs
+
+def send_zeropri_transaction(from_node, to_node, amount, fee):
+    """
+    Create&broadcast a zero-priority transaction.
+    Returns (txid, hex-encoded-txdata)
+    Ensures transaction is zero-priority by first creating a send-to-self,
+    then using its output
+    """
+
+    # Create a send-to-self with confirmed inputs:
+    self_address = from_node.getnewaddress()
+    (total_in, inputs) = gather_inputs(from_node, amount+fee*2)
+    outputs = make_change(from_node, total_in, amount+fee, fee)
+    outputs[self_address] = float(amount+fee)
+
+    self_rawtx = from_node.createrawtransaction(inputs, outputs)
+    self_signresult = from_node.signrawtransaction(self_rawtx)
+    self_txid = from_node.sendrawtransaction(self_signresult["hex"], True)
+
+    vout = find_output(from_node, self_txid, amount+fee)
+    # Now immediately spend the output to create a 1-input, 1-output
+    # zero-priority transaction:
+    inputs = [ { "txid" : self_txid, "vout" : vout } ]
+    outputs = { to_node.getnewaddress() : float(amount) }
+
+    rawtx = from_node.createrawtransaction(inputs, outputs)
+    signresult = from_node.signrawtransaction(rawtx)
+    txid = from_node.sendrawtransaction(signresult["hex"], True)
+
+    return (txid, signresult["hex"])
+
+def random_zeropri_transaction(nodes, amount, min_fee, fee_increment, fee_variants):
+    """
+    Create a random zero-priority transaction.
+    Returns (txid, hex-encoded-transaction-data, fee)
+    """
+    from_node = random.choice(nodes)
+    to_node = random.choice(nodes)
+    fee = min_fee + fee_increment*random.randint(0,fee_variants)
+    (txid, txhex) = send_zeropri_transaction(from_node, to_node, amount, fee)
+    return (txid, txhex, fee)
+
+def random_transaction(nodes, amount, min_fee, fee_increment, fee_variants):
+    """
+    Create a random transaction.
+    Returns (txid, hex-encoded-transaction-data, fee)
+    """
+    from_node = random.choice(nodes)
+    to_node = random.choice(nodes)
+    fee = min_fee + fee_increment*random.randint(0,fee_variants)
+
+    (total_in, inputs) = gather_inputs(from_node, amount+fee)
+    outputs = make_change(from_node, total_in, amount, fee)
+    outputs[to_node.getnewaddress()] = float(amount)
+
+    rawtx = from_node.createrawtransaction(inputs, outputs)
+    signresult = from_node.signrawtransaction(rawtx)
+    txid = from_node.sendrawtransaction(signresult["hex"], True)
+
+    return (txid, signresult["hex"], fee)
+
+def assert_equal(expected, actual, message=""):
+    if expected != actual:
+        if message:
+            message = "; %s" % message
+        raise AssertionError("(left == right)%s\n  left: <%s>\n right: <%s>" % (message, str(expected), str(actual)))
+
+def assert_true(condition, message = ""):
+    if not condition:
+        raise AssertionError(message)
+
+def assert_false(condition, message = ""):
+    assert_true(not condition, message)
+
+def assert_greater_than(thing1, thing2):
+    if thing1 <= thing2:
+        raise AssertionError("%s <= %s"%(str(thing1),str(thing2)))
+
+def assert_raises(exc, fun, *args, **kwds):
+    assert_raises_message(exc, None, fun, *args, **kwds)
+
+def assert_raises_message(ExceptionType, errstr, func, *args, **kwargs):
+    """
+    Asserts that func throws and that the exception contains 'errstr'
+    in its message.
+    """
+    try:
+        func(*args, **kwargs)
+    except ExceptionType as e:
+        if errstr is not None and errstr not in str(e):
+            raise AssertionError("Invalid exception string: Couldn't find %r in %r" % (
+                errstr, str(e)))
+    except Exception as e:
+        raise AssertionError("Unexpected exception raised: " + type(e).__name__)
+    else:
+        raise AssertionError("No exception raised")
+
+def fail(message=""):
+    raise AssertionError(message)
+
+
+# Returns an async operation result
+def wait_and_assert_operationid_status_result(node, myopid, in_status='success', in_errormsg=None, timeout=300):
+    print('waiting for async operation {}'.format(myopid))
+    result = None
+    for _ in range(1, timeout):
+        results = node.z_getoperationresult([myopid])
+        if len(results) > 0:
+            result = results[0]
+            break
+        time.sleep(1)
+
+    assert_true(result is not None, "timeout occurred")
+    status = result['status']
+
+    debug = os.getenv("PYTHON_DEBUG", "")
+    if debug:
+        print('...returned status: {}'.format(status))
+
+    errormsg = None
+    if status == "failed":
+        errormsg = result['error']['message']
+        if debug:
+            print('...returned error: {}'.format(errormsg))
+        assert_equal(in_errormsg, errormsg)
+
+    assert_equal(in_status, status, "Operation returned mismatched status. Error Message: {}".format(errormsg))
+
+    return result
+
+
+# Returns txid if operation was a success or None
+def wait_and_assert_operationid_status(node, myopid, in_status='success', in_errormsg=None, timeout=300):
+    result = wait_and_assert_operationid_status_result(node, myopid, in_status, in_errormsg, timeout)
+    if result['status'] == "success":
+        return result['result']['txid']
+    else:
+        return None
+
+# Find a coinbase address on the node, filtering by the number of UTXOs it has.
+# If no filter is provided, returns the coinbase address on the node containing
+# the greatest number of spendable UTXOs.
+# The default cached chain has one address per coinbase output.
+def get_coinbase_address(node, expected_utxos=None):
+    addrs = [utxo['address'] for utxo in node.listunspent() if utxo['generated']]
+    assert(len(set(addrs)) > 0)
+
+    if expected_utxos is None:
+        addrs = [(addrs.count(a), a) for a in set(addrs)]
+        return sorted(addrs, reverse=True)[0][1]
+
+    addrs = [a for a in set(addrs) if addrs.count(a) == expected_utxos]
+    assert(len(addrs) > 0)
+    return addrs[0]
+
+def check_node_log(self, node_number, line_to_check, stop_node = True):
+    print("Checking node " + str(node_number) + " logs")
+    if stop_node:
+        self.nodes[node_number].stop()
+        bitcoind_processes[node_number].wait()
+    logpath = self.options.tmpdir + "/node" + str(node_number) + "/regtest/debug.log"
+    with open(logpath, "r", encoding="utf8") as myfile:
+        logdata = myfile.readlines()
+    for (n, logline) in enumerate(logdata):
+        if line_to_check in logline:
+            return n
+    raise AssertionError(repr(line_to_check) + " not found")
+
+def nustr(branch_id):
+    return '%08x' % branch_id
+
+def nuparams(branch_id, height):
+    return '-nuparams=%s:%d' % (nustr(branch_id), height)
diff --git a/depend/zcash/qa/rpc-tests/test_framework/zip244.py b/depend/zcash/qa/rpc-tests/test_framework/zip244.py
new file mode 100644
index 000000000..d8e1b7126
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/test_framework/zip244.py
@@ -0,0 +1,294 @@
+#!/usr/bin/env python3
+# Copyright (c) 2021 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# zip244.py
+#
+# Functionality to create txids, auth digests, and signature digests.
+#
+# This file is modified from zcash/zcash-test-vectors.
+#
+
+import struct
+
+from hashlib import blake2b
+
+from .mininode import ser_string, ser_uint256
+from .script import (
+    SIGHASH_ANYONECANPAY,
+    SIGHASH_NONE,
+    SIGHASH_SINGLE,
+    getHashOutputs,
+    getHashPrevouts,
+    getHashSequence,
+)
+
+
+# Transparent
+
+def transparent_digest(tx):
+    digest = blake2b(digest_size=32, person=b'ZTxIdTranspaHash')
+
+    if len(tx.vin) + len(tx.vout) > 0:
+        digest.update(getHashPrevouts(tx, b'ZTxIdPrevoutHash'))
+        digest.update(getHashSequence(tx, b'ZTxIdSequencHash'))
+        digest.update(getHashOutputs(tx, b'ZTxIdOutputsHash'))
+
+    return digest.digest()
+
+def transparent_scripts_digest(tx):
+    digest = blake2b(digest_size=32, person=b'ZTxAuthTransHash')
+    for x in tx.vin:
+        digest.update(ser_string(x.scriptSig))
+    return digest.digest()
+
+# Sapling
+
+def sapling_digest(saplingBundle):
+    digest = blake2b(digest_size=32, person=b'ZTxIdSaplingHash')
+
+    if len(saplingBundle.spends) + len(saplingBundle.outputs) > 0:
+        digest.update(sapling_spends_digest(saplingBundle))
+        digest.update(sapling_outputs_digest(saplingBundle))
+        digest.update(struct.pack('<q', saplingBundle.valueBalance))
+
+    return digest.digest()
+
+def sapling_auth_digest(saplingBundle):
+    digest = blake2b(digest_size=32, person=b'ZTxAuthSapliHash')
+
+    if len(saplingBundle.spends) + len(saplingBundle.outputs) > 0:
+        for desc in saplingBundle.spends:
+            digest.update(desc.zkproof.serialize())
+        for desc in saplingBundle.spends:
+            digest.update(desc.spendAuthSig.serialize())
+        for desc in saplingBundle.outputs:
+            digest.update(desc.zkproof.serialize())
+        digest.update(saplingBundle.bindingSig.serialize())
+
+    return digest.digest()
+
+# - Spends
+
+def sapling_spends_digest(saplingBundle):
+    digest = blake2b(digest_size=32, person=b'ZTxIdSSpendsHash')
+
+    if len(saplingBundle.spends) > 0:
+        digest.update(sapling_spends_compact_digest(saplingBundle))
+        digest.update(sapling_spends_noncompact_digest(saplingBundle))
+
+    return digest.digest()
+
+def sapling_spends_compact_digest(saplingBundle):
+    digest = blake2b(digest_size=32, person=b'ZTxIdSSpendCHash')
+    for desc in saplingBundle.spends:
+        digest.update(ser_uint256(desc.nullifier))
+    return digest.digest()
+
+def sapling_spends_noncompact_digest(saplingBundle):
+    digest = blake2b(digest_size=32, person=b'ZTxIdSSpendNHash')
+    for desc in saplingBundle.spends:
+        digest.update(ser_uint256(desc.cv))
+        digest.update(ser_uint256(desc.anchor))
+        digest.update(ser_uint256(desc.rk))
+    return digest.digest()
+
+# - Outputs
+
+def sapling_outputs_digest(saplingBundle):
+    digest = blake2b(digest_size=32, person=b'ZTxIdSOutputHash')
+
+    if len(saplingBundle.outputs) > 0:
+        digest.update(sapling_outputs_compact_digest(saplingBundle))
+        digest.update(sapling_outputs_memos_digest(saplingBundle))
+        digest.update(sapling_outputs_noncompact_digest(saplingBundle))
+
+    return digest.digest()
+
+def sapling_outputs_compact_digest(saplingBundle):
+    digest = blake2b(digest_size=32, person=b'ZTxIdSOutC__Hash')
+    for desc in saplingBundle.outputs:
+        digest.update(ser_uint256(desc.cmu))
+        digest.update(ser_uint256(desc.ephemeralKey))
+        digest.update(desc.encCiphertext[:52])
+    return digest.digest()
+
+def sapling_outputs_memos_digest(saplingBundle):
+    digest = blake2b(digest_size=32, person=b'ZTxIdSOutM__Hash')
+    for desc in saplingBundle.outputs:
+        digest.update(desc.encCiphertext[52:564])
+    return digest.digest()
+
+def sapling_outputs_noncompact_digest(saplingBundle):
+    digest = blake2b(digest_size=32, person=b'ZTxIdSOutN__Hash')
+    for desc in saplingBundle.outputs:
+        digest.update(ser_uint256(desc.cv))
+        digest.update(desc.encCiphertext[564:])
+        digest.update(desc.outCiphertext)
+    return digest.digest()
+
+# Orchard
+
+def orchard_digest(orchardBundle):
+    digest = blake2b(digest_size=32, person=b'ZTxIdOrchardHash')
+
+    if len(orchardBundle.actions) > 0:
+        digest.update(orchard_actions_compact_digest(orchardBundle))
+        digest.update(orchard_actions_memos_digest(orchardBundle))
+        digest.update(orchard_actions_noncompact_digest(orchardBundle))
+        digest.update(struct.pack('B', orchardBundle.flags()))
+        digest.update(struct.pack('<q', orchardBundle.valueBalance))
+        digest.update(ser_uint256(orchardBundle.anchor))
+
+    return digest.digest()
+
+def orchard_auth_digest(orchardBundle):
+    digest = blake2b(digest_size=32, person=b'ZTxAuthOrchaHash')
+
+    if len(orchardBundle.actions) > 0:
+        digest.update(bytes(orchardBundle.proofs))
+        for desc in orchardBundle.actions:
+            digest.update(desc.spendAuthSig.serialize())
+        digest.update(orchardBundle.bindingSig.serialize())
+
+    return digest.digest()
+
+# - Actions
+
+def orchard_actions_compact_digest(orchardBundle):
+    digest = blake2b(digest_size=32, person=b'ZTxIdOrcActCHash')
+    for desc in orchardBundle.actions:
+        digest.update(ser_uint256(desc.nullifier))
+        digest.update(ser_uint256(desc.cmx))
+        digest.update(ser_uint256(desc.ephemeralKey))
+        digest.update(desc.encCiphertext[:52])
+    return digest.digest()
+
+def orchard_actions_memos_digest(orchardBundle):
+    digest = blake2b(digest_size=32, person=b'ZTxIdOrcActMHash')
+    for desc in orchardBundle.actions:
+        digest.update(desc.encCiphertext[52:564])
+    return digest.digest()
+
+def orchard_actions_noncompact_digest(orchardBundle):
+    digest = blake2b(digest_size=32, person=b'ZTxIdOrcActNHash')
+    for desc in orchardBundle.actions:
+        digest.update(ser_uint256(desc.cv))
+        digest.update(ser_uint256(desc.rk))
+        digest.update(desc.encCiphertext[564:])
+        digest.update(desc.outCiphertext)
+    return digest.digest()
+
+# Transaction
+
+def header_digest(tx):
+    digest = blake2b(digest_size=32, person=b'ZTxIdHeadersHash')
+
+    digest.update(struct.pack('<I', (int(tx.fOverwintered)<<31) | tx.nVersion))
+    digest.update(struct.pack('<I', tx.nVersionGroupId))
+    digest.update(struct.pack('<I', tx.nConsensusBranchId))
+    digest.update(struct.pack('<I', tx.nLockTime))
+    digest.update(struct.pack('<I', tx.nExpiryHeight))
+
+    return digest.digest()
+
+def txid_digest(tx):
+    digest = blake2b(
+        digest_size=32,
+        person=b'ZcashTxHash_' + struct.pack('<I', tx.nConsensusBranchId),
+    )
+
+    digest.update(header_digest(tx))
+    digest.update(transparent_digest(tx))
+    digest.update(sapling_digest(tx.saplingBundle))
+    digest.update(orchard_digest(tx.orchardBundle))
+
+    return digest.digest()
+
+# Authorizing Data Commitment
+
+def auth_digest(tx):
+    digest = blake2b(
+        digest_size=32,
+        person=b'ZTxAuthHash_' + struct.pack('<I', tx.nConsensusBranchId),
+    )
+
+    digest.update(transparent_scripts_digest(tx))
+    digest.update(sapling_auth_digest(tx.saplingBundle))
+    digest.update(orchard_auth_digest(tx.orchardBundle))
+
+    return digest.digest()
+
+# Signatures
+
+def signature_digest(tx, nHashType, txin):
+    digest = blake2b(
+        digest_size=32,
+        person=b'ZcashTxHash_' + struct.pack('<I', tx.nConsensusBranchId),
+    )
+
+    digest.update(header_digest(tx))
+    digest.update(transparent_sig_digest(tx, nHashType, txin))
+    digest.update(sapling_digest(tx.saplingBundle))
+    digest.update(orchard_digest(tx.orchardBundle))
+
+    return digest.digest()
+
+def transparent_sig_digest(tx, nHashType, txin):
+    # Sapling Spend or Orchard Action
+    if txin is None:
+        return transparent_digest(tx)
+
+    digest = blake2b(digest_size=32, person=b'ZTxIdTranspaHash')
+
+    digest.update(prevouts_sig_digest(tx, nHashType))
+    digest.update(sequence_sig_digest(tx, nHashType))
+    digest.update(outputs_sig_digest(tx, nHashType, txin))
+    digest.update(txin_sig_digest(tx, txin))
+
+    return digest.digest()
+
+def prevouts_sig_digest(tx, nHashType):
+    # If the SIGHASH_ANYONECANPAY flag is not set:
+    if not (nHashType & SIGHASH_ANYONECANPAY):
+        return getHashPrevouts(tx, b'ZTxIdPrevoutHash')
+    else:
+        return blake2b(digest_size=32, person=b'ZTxIdPrevoutHash').digest()
+
+def sequence_sig_digest(tx, nHashType):
+    # if the SIGHASH_ANYONECANPAY flag is not set, and the sighash type is neither
+    # SIGHASH_SINGLE nor SIGHASH_NONE:
+    if (
+        (not (nHashType & SIGHASH_ANYONECANPAY)) and \
+        (nHashType & 0x1f) != SIGHASH_SINGLE and \
+        (nHashType & 0x1f) != SIGHASH_NONE
+    ):
+        return getHashSequence(tx, b'ZTxIdSequencHash')
+    else:
+        return blake2b(digest_size=32, person=b'ZTxIdSequencHash').digest()
+
+def outputs_sig_digest(tx, nHashType, txin):
+    # If the sighash type is neither SIGHASH_SINGLE nor SIGHASH_NONE:
+    if (nHashType & 0x1f) != SIGHASH_SINGLE and (nHashType & 0x1f) != SIGHASH_NONE:
+        return getHashOutputs(tx, b'ZTxIdOutputsHash')
+
+    # If the sighash type is SIGHASH_SINGLE and the signature hash is being computed for
+    # the transparent input at a particular index, and a transparent output appears in the
+    # transaction at that index:
+    elif (nHashType & 0x1f) == SIGHASH_SINGLE and 0 <= txin.nIn and txin.nIn < len(tx.vout):
+        digest = blake2b(digest_size=32, person=b'ZTxIdOutputsHash')
+        digest.update(bytes(tx.vout[txin.nIn]))
+        return digest.digest()
+
+    else:
+        return blake2b(digest_size=32, person=b'ZTxIdOutputsHash').digest()
+
+def txin_sig_digest(tx, txin):
+    digest = blake2b(digest_size=32, person=b'Zcash___TxInHash')
+    digest.update(bytes(tx.vin[txin.nIn].prevout))
+    digest.update(ser_string(txin.scriptCode))
+    digest.update(struct.pack('<Q', txin.amount))
+    digest.update(struct.pack('<I', tx.vin[txin.nIn].nSequence))
+    return digest.digest()
diff --git a/depend/zcash/qa/rpc-tests/threeofthreerestore.py b/depend/zcash/qa/rpc-tests/threeofthreerestore.py
new file mode 100755
index 000000000..ce79ae31d
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/threeofthreerestore.py
@@ -0,0 +1,59 @@
+#!/usr/bin/env python3
+# Copyright (c) 2022 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import start_nodes, connect_nodes_bi 
+
+class ThreeOfThreeRestoreTest(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.setup_clean_chain = True
+        self.num_nodes = 4
+
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir,
+                           extra_args=[['-experimentalfeatures', '-developerencryptwallet']] * 4)
+
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,0,2)
+        connect_nodes_bi(self.nodes,0,3)
+
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test(self):
+        addr1 = self.nodes[2].getnewaddress()
+        addr2 = self.nodes[2].getnewaddress()
+        addr3 = self.nodes[2].getnewaddress()
+
+        addr1Obj = self.nodes[2].validateaddress(addr1)
+        addr2Obj = self.nodes[2].validateaddress(addr2)
+        addr3Obj = self.nodes[2].validateaddress(addr3)
+
+        key1 = self.nodes[2].dumpprivkey(addr1)
+        key2 = self.nodes[2].dumpprivkey(addr2)
+        key3 = self.nodes[2].dumpprivkey(addr3)
+
+        self.nodes[3].importprivkey(key1, "", True)
+        self.nodes[3].importprivkey(key2, "", True)
+        self.nodes[3].importprivkey(key3, "", True)
+
+        mSigObj = self.nodes[3].addmultisigaddress(3, [addr1Obj['pubkey'], addr2Obj['pubkey'], addr3Obj['pubkey']])
+        validateObj = self.nodes[3].validateaddress(mSigObj)
+        assert(validateObj["isvalid"])
+        assert(validateObj["ismine"])
+
+        # Ensure that the multisig address is returned
+        list_result = self.nodes[3].listaddresses()
+
+        assert('imported' in obj['source'] for obj in list_result)
+        for obj in list_result:
+            if obj['source'] == 'imported':
+                assert(validateObj['address'] in obj['transparent']['addresses'])
+
+if __name__ == '__main__':
+    ThreeOfThreeRestoreTest().main()
diff --git a/depend/zcash/qa/rpc-tests/timestampindex.py b/depend/zcash/qa/rpc-tests/timestampindex.py
new file mode 100755
index 000000000..830d8b468
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/timestampindex.py
@@ -0,0 +1,92 @@
+#!/usr/bin/env python3
+# Copyright (c) 2019 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+#
+# Test timestampindex generation and fetching for insightexplorer
+
+import time
+
+from test_framework.test_framework import BitcoinTestFramework
+
+from test_framework.util import (
+    assert_equal,
+    initialize_chain_clean,
+    start_nodes,
+    stop_nodes,
+    connect_nodes,
+    wait_bitcoinds,
+)
+
+
+class TimestampIndexTest(BitcoinTestFramework):
+
+    def setup_chain(self):
+        print("Initializing test directory "+self.options.tmpdir)
+        initialize_chain_clean(self.options.tmpdir, 3)
+
+    def setup_network(self):
+        # -insightexplorer causes spentindex to be enabled (fSpentIndex = true)
+
+        self.nodes = start_nodes(
+            3, self.options.tmpdir,
+            [['-debug', '-txindex', '-experimentalfeatures', '-insightexplorer']]*3)
+        connect_nodes(self.nodes[0], 1)
+        connect_nodes(self.nodes[0], 2)
+
+        self.is_network_split = False
+        self.sync_all()
+
+    def run_test(self):
+        blockhashes = []
+        print("Mining blocks...")
+        for _ in range(8):
+            blockhashes.extend(self.nodes[0].generate(1))
+            time.sleep(1)
+        self.sync_all()
+        times = [self.nodes[1].getblock(b)['time'] for b in blockhashes]
+        assert_equal(blockhashes, self.nodes[1].getblockhashes(times[0]+100, 0))
+        # test various ranges; the api returns blocks have times LESS THAN
+        # 'high' (first argument), not less than or equal, hence the +1
+        assert_equal(blockhashes[0:8], self.nodes[1].getblockhashes(times[8-1]+1, times[0]))
+        assert_equal(blockhashes[2:6], self.nodes[1].getblockhashes(times[6-1]+1, times[2]))
+        assert_equal(blockhashes[5:8], self.nodes[1].getblockhashes(times[8-1]+1, times[5]))
+        assert_equal(blockhashes[6:7], self.nodes[1].getblockhashes(times[7-1]+1, times[6]))
+        assert_equal(blockhashes[4:6], self.nodes[1].getblockhashes(times[6-1]+1, times[4]))
+        assert_equal(blockhashes[1:1], self.nodes[1].getblockhashes(times[1-1]+1, times[1]))
+
+        # Restart all nodes to ensure indices are saved to disk and recovered
+        stop_nodes(self.nodes)
+        wait_bitcoinds()
+        self.setup_network()
+
+        # generating multiple blocks within the same second should
+        # result in timestamp index entries with unique times
+        # (not realistic but there is logic to ensure this)
+        blockhashes = self.nodes[0].generate(10)
+        self.sync_all()
+        firsttime = self.nodes[1].getblock(blockhashes[0])['time']
+        assert_equal(blockhashes, self.nodes[1].getblockhashes(firsttime+10+1, firsttime))
+
+        # the api can also return 'logical' times, which is the key of the
+        # timestamp index (the content being blockhash). Logical times are
+        # block times when possible, but since keys must be unique, and the
+        # previous 10 block were generated in much less than 10 seconds,
+        # each logical time should be one greater than the previous.
+        results = self.nodes[1].getblockhashes(
+            firsttime+10+1, firsttime,
+            {'logicalTimes': True})
+        ltimes = [r['logicalts'] for r in results]
+        assert_equal(ltimes, list(range(firsttime, firsttime+10)))
+
+        # there's also a flag to exclude orphaned blocks; results should
+        # be the same in this test
+        assert_equal(
+            results,
+            self.nodes[1].getblockhashes(
+                firsttime+10+1, firsttime,
+                {'logicalTimes': True, 'noOrphans': True}))
+
+
+if __name__ == '__main__':
+    TimestampIndexTest().main()
diff --git a/depend/zcash/qa/rpc-tests/turnstile.py b/depend/zcash/qa/rpc-tests/turnstile.py
new file mode 100755
index 000000000..53fbe50d0
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/turnstile.py
@@ -0,0 +1,187 @@
+#!/usr/bin/env python3
+# Copyright (c) 2019 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Test Sprout and Sapling turnstile violations
+#
+# Experimental feature -developersetpoolsizezero will, upon node launch,
+# set the in-memory size of shielded pools to zero.
+#
+# An unshielding operation can then be used to verify:
+# 1. Turnstile violating transactions are excluded by the miner
+# 2. Turnstile violating blocks are rejected by nodes
+#
+# By default, ZIP209 support is disabled in regtest mode, but gets enabled
+# when experimental feature -developersetpoolsizezero is switched on.
+#
+# To perform a manual turnstile test on testnet:
+# 1. Launch zcashd
+# 2. Shield transparent funds
+# 3. Wait for transaction to be mined
+# 4. Restart zcashd, enabling experimental feature -developersetpoolsizezero
+# 5. Unshield funds
+# 6. Wait for transaction to be mined (using testnet explorer or another node)
+# 7. Verify zcashd rejected the block
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    assert_equal,
+    fail,
+    get_coinbase_address,
+    start_node, start_nodes,
+    sync_blocks, sync_mempools,
+    connect_nodes_bi,
+    wait_and_assert_operationid_status,
+    bitcoind_processes,
+    check_node_log
+)
+from decimal import Decimal
+
+TURNSTILE_ARGS = ['-experimentalfeatures',
+                  '-developersetpoolsizezero']
+
+class TurnstileTest (BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 3
+        self.setup_clean_chain = True
+
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir)
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        self.is_network_split=False
+        self.sync_all()
+
+    # Helper method to verify the size of a shielded value pool for a given node
+    def assert_pool_balance(self, node, name, balance):
+        pools = node.getblockchaininfo()['valuePools']
+        for pool in pools:
+            if pool['id'] == name:
+                assert_equal(pool['chainValue'], balance, message="for pool named %r" % (name,))
+                return
+        assert False, "pool named %r not found" % (name,)
+
+    # Helper method to start a single node with extra args and sync to the network
+    def start_and_sync_node(self, index, args=[]):
+        self.nodes[index] = start_node(index, self.options.tmpdir, extra_args=args)
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,0,2)
+        self.sync_all()
+
+    # Helper method to stop and restart a single node with extra args and sync to the network
+    def restart_and_sync_node(self, index, args=[]):
+        self.nodes[index].stop()
+        bitcoind_processes[index].wait()
+        self.start_and_sync_node(index, args)
+
+    def run_test(self):
+        # Sanity-check the test harness
+        self.nodes[0].generate(101)
+        assert_equal(self.nodes[0].getblockcount(), 101)
+        self.sync_all()
+
+        # Node 0 shields some funds
+        dest_addr = self.nodes[0].z_getnewaddress(POOL_NAME.lower())
+        taddr0 = get_coinbase_address(self.nodes[0])
+        if (POOL_NAME == "SPROUT"):
+            myopid = self.nodes[0].z_shieldcoinbase(taddr0, dest_addr, 0, 1)['opid']
+        elif (POOL_NAME == "SAPLING"):
+            recipients = []
+            recipients.append({"address": dest_addr, "amount": Decimal('10')})
+            myopid = self.nodes[0].z_sendmany(taddr0, recipients, 1, 0)
+        else:
+            fail("Unrecognized pool name: " + POOL_NAME)
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+        assert_equal(self.nodes[0].z_getbalance(dest_addr), Decimal('10'))
+
+        # Verify size of shielded pool
+        self.assert_pool_balance(self.nodes[0], POOL_NAME.lower(), Decimal('10'))
+        self.assert_pool_balance(self.nodes[1], POOL_NAME.lower(), Decimal('10'))
+        self.assert_pool_balance(self.nodes[2], POOL_NAME.lower(), Decimal('10'))
+
+        # Relaunch node 0 with in-memory size of value pools set to zero.
+        self.restart_and_sync_node(0, TURNSTILE_ARGS)
+
+        # Verify size of shielded pool
+        self.assert_pool_balance(self.nodes[0], POOL_NAME.lower(), Decimal('0'))
+        self.assert_pool_balance(self.nodes[1], POOL_NAME.lower(), Decimal('10'))
+        self.assert_pool_balance(self.nodes[2], POOL_NAME.lower(), Decimal('10'))
+
+        # Node 0 creates an unshielding transaction
+        recipients = []
+        recipients.append({"address": taddr0, "amount": Decimal('1')})
+        myopid = self.nodes[0].z_sendmany(dest_addr, recipients, 1, 0)
+        mytxid = wait_and_assert_operationid_status(self.nodes[0], myopid)
+
+        # Verify transaction appears in mempool of nodes
+        self.sync_all()
+        assert(mytxid in self.nodes[0].getrawmempool())
+        assert(mytxid in self.nodes[1].getrawmempool())
+        assert(mytxid in self.nodes[2].getrawmempool())
+
+        # Node 0 mines a block
+        count = self.nodes[0].getblockcount()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # Verify the mined block does not contain the unshielding transaction
+        block = self.nodes[0].getblock(self.nodes[0].getbestblockhash())
+        assert_equal(len(block["tx"]), 1)
+        assert_equal(block["height"], count + 1)
+
+        # Stop node 0 and check logs to verify the miner excluded the transaction from the block
+        string_to_find = "CreateNewBlock: tx " + mytxid + " appears to violate " + POOL_NAME.capitalize() + " turnstile"
+        check_node_log(self, 0, string_to_find)
+
+        # Launch node 0 with in-memory size of value pools set to zero.
+        self.start_and_sync_node(0, TURNSTILE_ARGS)
+
+        # Node 1 mines a block
+        oldhash = self.nodes[0].getbestblockhash()
+        self.nodes[1].generate(1)
+        newhash = self.nodes[1].getbestblockhash()
+
+        # Verify block contains the unshielding transaction 
+        assert(mytxid in self.nodes[1].getblock(newhash)["tx"])
+
+        # Verify nodes 1 and 2 have accepted the block as valid
+        sync_blocks(self.nodes[1:3])
+        sync_mempools(self.nodes[1:3])
+        assert_equal(len(self.nodes[1].getrawmempool()), 0)
+        assert_equal(len(self.nodes[2].getrawmempool()), 0)
+
+        # Verify node 0 has not accepted the block
+        assert_equal(oldhash, self.nodes[0].getbestblockhash())
+        assert(mytxid in self.nodes[0].getrawmempool())
+        self.assert_pool_balance(self.nodes[0], POOL_NAME.lower(), Decimal('0'))
+
+        # Verify size of shielded pool
+        self.assert_pool_balance(self.nodes[0], POOL_NAME.lower(), Decimal('0'))
+        self.assert_pool_balance(self.nodes[1], POOL_NAME.lower(), Decimal('9'))
+        self.assert_pool_balance(self.nodes[2], POOL_NAME.lower(), Decimal('9'))
+
+        # Stop node 0 and check logs to verify the block was rejected as a turnstile violation
+        string_to_find1 = "ConnectBlock(): turnstile violation in " + POOL_NAME.capitalize() + " shielded value pool"
+        string_to_find2 = "InvalidChainFound: invalid block="
+        string_to_find3 = "ConnectTip(): ConnectBlock " + newhash + " failed"
+        check_node_log(self, 0, string_to_find1, True)
+        check_node_log(self, 0, string_to_find2, False)
+        check_node_log(self, 0, string_to_find3, False)
+        self.start_and_sync_node(0)
+
+        assert_equal(newhash, self.nodes[0].getbestblockhash())
+
+if __name__ == '__main__':
+    POOL_NAME = "SPROUT"
+    TurnstileTest().main()
+    POOL_NAME = "SAPLING"
+    TurnstileTest().main()
diff --git a/depend/zcash/qa/rpc-tests/tx_expiry_helper.py b/depend/zcash/qa/rpc-tests/tx_expiry_helper.py
new file mode 100755
index 000000000..60bd6eeec
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/tx_expiry_helper.py
@@ -0,0 +1,101 @@
+#!/usr/bin/env python3
+# Copyright (c) 2019 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Common code for testing transaction expiry
+#
+from test_framework.mininode import CTransaction, NodeConnCB, mininode_lock, msg_ping, \
+    msg_pong
+from test_framework.util import fail
+
+import io
+import time
+
+from binascii import unhexlify
+
+
+class TestNode(NodeConnCB):
+    def __init__(self):
+        NodeConnCB.__init__(self)
+        self.create_callback_map()
+        self.connection = None
+        self.ping_counter = 1
+        self.last_pong = msg_pong()
+        self.conn_closed = False
+
+    def add_connection(self, conn):
+        self.connection = conn
+
+    # Spin until verack message is received from the node.
+    # We use this to signal that our test can begin. This
+    # is called from the testing thread, so it needs to acquire
+    # the global lock.
+    def wait_for_verack(self):
+        while True:
+            with mininode_lock:
+                if self.verack_received:
+                    return
+            time.sleep(0.05)
+
+    # Wrapper for the NodeConn's send_message function
+    def send_message(self, message):
+        self.connection.send_message(message)
+
+    def on_close(self, conn):
+        self.conn_closed = True
+
+    def on_reject(self, conn, message):
+        conn.rejectMessage = message
+
+    # Track the last getdata message we receive (used in the test)
+    def on_getdata(self, conn, message):
+        self.last_getdata = message
+
+    def on_tx(self, conn, message):
+        self.last_tx = message
+
+    def on_inv(self, conn, message):
+        self.last_inv = message
+
+    def on_notfound(self, conn, message):
+        self.last_notfound = message
+
+    def on_pong(self, conn, message):
+        self.last_pong = message
+
+    # The following function is mostly copied from p2p-acceptblock.py
+    # Sync up with the node after delivery of a message
+    def sync_with_ping(self, timeout=30, waiting_for=None):
+        self.connection.send_message(msg_ping(nonce=self.ping_counter))
+        sleep_time = 0.05
+        while timeout > 0:
+            with mininode_lock:
+                ready = True if waiting_for is None else waiting_for(self) is not None
+                if ready and self.last_pong.nonce == self.ping_counter:
+                    self.ping_counter += 1
+                    return
+            time.sleep(sleep_time)
+            timeout -= sleep_time
+        fail("Should have received pong")
+
+
+def create_transaction(node, coinbase, to_address, amount, expiry_height):
+    from_txid = node.getblock(coinbase)['tx'][0]
+    inputs = [{"txid": from_txid, "vout": 0}]
+    outputs = {to_address: amount}
+    rawtx = node.createrawtransaction(inputs, outputs)
+    tx = CTransaction()
+
+    # Set the expiry height
+    f = io.BytesIO(unhexlify(rawtx))
+    tx.deserialize(f)
+    tx.nExpiryHeight = expiry_height
+    rawtx = tx.serialize().hex()
+
+    signresult = node.signrawtransaction(rawtx)
+    f = io.BytesIO(unhexlify(signresult['hex']))
+    tx.deserialize(f)
+    tx.rehash()
+    return tx
diff --git a/depend/zcash/qa/rpc-tests/txn_doublespend.py b/depend/zcash/qa/rpc-tests/txn_doublespend.py
new file mode 100755
index 000000000..b4879d441
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/txn_doublespend.py
@@ -0,0 +1,111 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Test proper accounting with malleable transactions
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, connect_nodes, \
+    sync_blocks, gather_inputs
+
+
+class TxnMallTest(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 4
+        self.setup_clean_chain = False
+
+    def add_options(self, parser):
+        parser.add_option("--mineblock", dest="mine_block", default=False, action="store_true",
+                          help="Test double-spend of 1-confirmed transaction")
+
+    def setup_network(self):
+        # Start with split network:
+        return super(TxnMallTest, self).setup_network(True)
+
+    def run_test(self):
+        mining_reward = 10
+        starting_balance = mining_reward * 25
+
+        for i in range(4):
+            assert_equal(self.nodes[i].getbalance(), starting_balance)
+            self.nodes[i].getnewaddress("")  # bug workaround, coins generated assigned to first getnewaddress!
+
+        # Coins are sent to node1_address
+        node1_address = self.nodes[1].getnewaddress("")
+
+        # First: use raw transaction API to send (starting_balance - (mining_reward - 2)) BTC to node1_address,
+        # but don't broadcast:
+        (total_in, inputs) = gather_inputs(self.nodes[0], (starting_balance - (mining_reward - 2)))
+        change_address = self.nodes[0].getnewaddress("")
+        outputs = {}
+        outputs[change_address] = (mining_reward - 2)
+        outputs[node1_address] = (starting_balance - (mining_reward - 2))
+        rawtx = self.nodes[0].createrawtransaction(inputs, outputs)
+        doublespend = self.nodes[0].signrawtransaction(rawtx)
+        assert_equal(doublespend["complete"], True)
+
+        # Create two transaction from node[0] to node[1]; the
+        # second must spend change from the first because the first
+        # spends all mature inputs:
+        txid1 = self.nodes[0].sendtoaddress(node1_address, (starting_balance - (mining_reward - 2)))
+        txid2 = self.nodes[0].sendtoaddress(node1_address, 5)
+
+        # Have node0 mine a block:
+        if (self.options.mine_block):
+            self.nodes[0].generate(1)
+            sync_blocks(self.nodes[0:2])
+
+        tx1 = self.nodes[0].gettransaction(txid1)
+        tx2 = self.nodes[0].gettransaction(txid2)
+
+        # Node0's balance should be starting balance, plus mining_reward for another
+        # matured block, minus (starting_balance - (mining_reward - 2)), minus 5, and minus transaction fees:
+        expected = starting_balance
+        if self.options.mine_block: expected += mining_reward
+        expected += tx1["amount"] + tx1["fee"]
+        expected += tx2["amount"] + tx2["fee"]
+        assert_equal(self.nodes[0].getbalance(), expected)
+
+        if self.options.mine_block:
+            assert_equal(tx1["confirmations"], 1)
+            assert_equal(tx2["confirmations"], 1)
+            # Node1's total balance should be its starting balance plus both transaction amounts:
+            assert_equal(self.nodes[1].getbalance("*"), starting_balance - (tx1["amount"]+tx2["amount"]))
+        else:
+            assert_equal(tx1["confirmations"], 0)
+            assert_equal(tx2["confirmations"], 0)
+
+        # Now give doublespend to miner:
+        self.nodes[2].sendrawtransaction(doublespend["hex"])
+        # ... mine a block...
+        self.nodes[2].generate(1)
+
+        # Reconnect the split network, and sync chain:
+        connect_nodes(self.nodes[1], 2)
+        self.nodes[2].generate(1)  # Mine another block to make sure we sync
+        sync_blocks(self.nodes)
+
+        # Re-fetch transaction info:
+        tx1 = self.nodes[0].gettransaction(txid1)
+        tx2 = self.nodes[0].gettransaction(txid2)
+
+        # Both transactions should be conflicted
+        assert_equal(tx1["confirmations"], -1)
+        assert_equal(tx2["confirmations"], -1)
+
+        # Node0's total balance should be starting balance, plus (mining_reward * 2) for
+        # two more matured blocks, minus (starting_balance - (mining_reward - 2)) for the double-spend:
+        expected = starting_balance + (mining_reward * 2) - (starting_balance - (mining_reward - 2))
+        assert_equal(self.nodes[0].getbalance(), expected)
+        assert_equal(self.nodes[0].getbalance("*"), expected)
+
+        # Node1's total balance should be its starting balance plus the amount of the mutated send:
+        assert_equal(self.nodes[1].getbalance("*"), starting_balance + (starting_balance - (mining_reward - 2)))
+
+if __name__ == '__main__':
+    TxnMallTest().main()
diff --git a/depend/zcash/qa/rpc-tests/upgrade_golden.py b/depend/zcash/qa/rpc-tests/upgrade_golden.py
new file mode 100755
index 000000000..b115b22a0
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/upgrade_golden.py
@@ -0,0 +1,96 @@
+#!/usr/bin/env python3
+#
+# Copyright (c) 2020 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    initialize_chain_clean, start_nodes, start_node, 
+    bitcoind_processes)
+from test_framework.util import (
+    nuparams,
+    OVERWINTER_BRANCH_ID, SAPLING_BRANCH_ID, BLOSSOM_BRANCH_ID, HEARTWOOD_BRANCH_ID, CANOPY_BRANCH_ID)
+
+import shutil
+import logging
+import tarfile
+import os
+import os.path
+
+HAS_SAPLING   = [nuparams(OVERWINTER_BRANCH_ID, 10), nuparams(SAPLING_BRANCH_ID, 20)]
+HAS_BLOSSOM   = HAS_SAPLING + [nuparams(BLOSSOM_BRANCH_ID, 30)]
+HAS_HEARTWOOD = HAS_BLOSSOM + [nuparams(HEARTWOOD_BRANCH_ID, 40)]
+HAS_CANOPY    = HAS_HEARTWOOD + [nuparams(CANOPY_BRANCH_ID, 50)]
+
+class Upgrade():
+    def __init__(self, h, p, a):
+        self.gen_height = h
+        self.tgz_path = p
+        self.extra_args = a
+
+class UpgradeGoldenTest(BitcoinTestFramework):
+    def setup_chain(self):
+        self.upgrades = [ Upgrade(35, os.path.dirname(os.path.realpath(__file__))+"/golden/blossom.tar.gz", HAS_BLOSSOM)
+                        , Upgrade(45, os.path.dirname(os.path.realpath(__file__))+"/golden/heartwood.tar.gz", HAS_HEARTWOOD)
+                        , Upgrade(55, os.path.dirname(os.path.realpath(__file__))+"/golden/canopy.tar.gz", HAS_CANOPY)
+                        ]
+
+        logging.info("Initializing test directory "+self.options.tmpdir)
+        initialize_chain_clean(self.options.tmpdir, len(self.upgrades) + 1)
+
+    # This mirrors how the network was setup in the bash test
+    def setup_network(self, split=False):
+        logging.info("Initializing the network in "+self.options.tmpdir)
+
+        # Node 0 will always be running with the most recent network upgrade version.
+        # The remaining nodes start with the network upgrade versions in order that they
+        # are specified in the upgrades list.
+        upgrade_args = [self.upgrades[-1].extra_args] + [u.extra_args for u in self.upgrades]
+        self.nodes = start_nodes(len(self.upgrades) + 1, self.options.tmpdir, extra_args=upgrade_args)
+
+    def capture_blocks(self, to_height, tgz_path):
+        # Generate past the upgrade activation height. 
+        self.nodes[0].generate(to_height)
+        self.nodes[0].stop()
+        bitcoind_processes[0].wait()
+
+        node_path = self.options.tmpdir + "/node0/regtest"
+        os.remove(node_path + "/peers.dat")
+        with tarfile.open(tgz_path, "w:gz") as tgz:
+            tgz.add(node_path, arcname="")
+
+        logging.info("Captured node state to "+tgz_path)
+
+    def run_test(self):
+        last_upgrade = self.upgrades[-1]
+        if not os.path.isfile(last_upgrade.tgz_path):
+            self.capture_blocks(last_upgrade.gen_height, last_upgrade.tgz_path)
+            # restart the node after capturing the state
+            self.nodes[0] = start_node(0, self.options.tmpdir, extra_args=last_upgrade.extra_args)
+
+        i = 1
+        for upgrade in self.upgrades:
+            if os.path.isfile(upgrade.tgz_path):
+                # shut down the node so we can replace its data dir(s)
+                self.nodes[i].stop()
+                bitcoind_processes[i].wait()
+
+                regtest_path = self.options.tmpdir+"/node"+ str(i)+"/regtest"
+                shutil.rmtree(regtest_path)
+                with tarfile.open(upgrade.tgz_path, "r:gz") as tgz:
+                    tgz.extractall(path = regtest_path)
+
+                    # Upgrade each node to the latest network version. If any fails to
+                    # start, this will fail the test.
+                    try:
+                        self.nodes[i] = start_node(i, self.options.tmpdir, extra_args=last_upgrade.extra_args)
+                    except:
+                        logging.error("An error occurred attempting to start node "+str(i))
+                        raise
+
+
+
+if __name__ == '__main__':
+    UpgradeGoldenTest().main()
+
diff --git a/depend/zcash/qa/rpc-tests/wallet.py b/depend/zcash/qa/rpc-tests/wallet.py
new file mode 100755
index 000000000..9cea66632
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet.py
@@ -0,0 +1,224 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.authproxy import JSONRPCException
+from test_framework.util import assert_equal, start_nodes, start_node, \
+    connect_nodes_bi, sync_blocks, sync_mempools
+
+from decimal import Decimal
+
+class WalletTest (BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.setup_clean_chain = True
+        self.num_nodes = 4
+
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(3, self.options.tmpdir)
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,0,2)
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test (self):
+        print("Mining blocks...")
+
+        self.nodes[0].generate(4)
+        self.sync_all()
+
+        walletinfo = self.nodes[0].getwalletinfo()
+        assert_equal(walletinfo['immature_balance'], 40)
+        assert_equal(walletinfo['balance'], 0)
+
+        blockchaininfo = self.nodes[0].getblockchaininfo()
+        assert_equal(blockchaininfo['estimatedheight'], 4)
+
+        self.sync_all()
+        self.nodes[1].generate(101)
+        self.sync_all()
+
+        assert_equal(self.nodes[0].getbalance(), 40)
+        assert_equal(self.nodes[1].getbalance(), 10)
+        assert_equal(self.nodes[2].getbalance(), 0)
+        assert_equal(self.nodes[0].getbalance("*"), 40)
+        assert_equal(self.nodes[1].getbalance("*"), 10)
+        assert_equal(self.nodes[2].getbalance("*"), 0)
+
+        # Send 21 ZEC from 0 to 2 using sendtoaddress call.
+        # Second transaction will be child of first, and will require a fee
+        self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(), 11)
+        self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(), 10)
+
+        walletinfo = self.nodes[0].getwalletinfo()
+        assert_equal(walletinfo['immature_balance'], 0)
+
+        blockchaininfo = self.nodes[0].getblockchaininfo()
+        assert_equal(blockchaininfo['estimatedheight'], 105)
+
+        # Have node0 mine a block, thus it will collect its own fee.
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # Have node1 generate 100 blocks (so node0 can recover the fee)
+        self.nodes[1].generate(100)
+        self.sync_all()
+
+        # node0 should end up with 50 ZEC in block rewards plus fees, but
+        # minus the 21 ZEC plus fees sent to node2
+        assert_equal(self.nodes[0].getbalance(), 50-21)
+        assert_equal(self.nodes[2].getbalance(), 21)
+        assert_equal(self.nodes[0].getbalance("*"), 50-21)
+        assert_equal(self.nodes[2].getbalance("*"), 21)
+
+        # Node0 should have three unspent outputs.
+        # Create a couple of transactions to send them to node2, submit them through
+        # node1, and make sure both node0 and node2 pick them up properly:
+        node0utxos = self.nodes[0].listunspent(1)
+        assert_equal(len(node0utxos), 3)
+
+        # Check 'generated' field of listunspent
+        # Node 0: has one coinbase utxo and two regular utxos
+        assert_equal(sum(int(uxto["generated"] is True) for uxto in node0utxos), 1)
+        # Node 1: has 101 coinbase utxos and no regular utxos
+        node1utxos = self.nodes[1].listunspent(1)
+        assert_equal(len(node1utxos), 101)
+        assert_equal(sum(int(uxto["generated"] is True) for uxto in node1utxos), 101)
+        # Node 2: has no coinbase utxos and two regular utxos
+        node2utxos = self.nodes[2].listunspent(1)
+        assert_equal(len(node2utxos), 2)
+        assert_equal(sum(int(uxto["generated"] is True) for uxto in node2utxos), 0)
+
+        # Catch an attempt to send a transaction with an absurdly high fee.
+        # Send 1.0 ZEC from an utxo of value 10.0 ZEC but don't specify a change output, so then
+        # the change of 9.0 ZEC becomes the fee, which is greater than estimated fee of 0.0021 ZEC.
+        inputs = []
+        outputs = {}
+        for utxo in node2utxos:
+            if utxo["amount"] == Decimal("10.0"):
+                break
+        assert_equal(utxo["amount"], Decimal("10.0"))
+        inputs.append({ "txid" : utxo["txid"], "vout" : utxo["vout"]})
+        outputs[self.nodes[2].getnewaddress("")] = Decimal("1.0")
+        raw_tx = self.nodes[2].createrawtransaction(inputs, outputs)
+        signed_tx = self.nodes[2].signrawtransaction(raw_tx)
+        try:
+            self.nodes[2].sendrawtransaction(signed_tx["hex"])
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert_equal(errorString, "256: absurdly-high-fee")
+
+        # create both transactions
+        txns_to_send = []
+        for utxo in node0utxos:
+            inputs = []
+            outputs = {}
+            inputs.append({ "txid" : utxo["txid"], "vout" : utxo["vout"]})
+            outputs[self.nodes[2].getnewaddress("")] = utxo["amount"]
+            raw_tx = self.nodes[0].createrawtransaction(inputs, outputs)
+            txns_to_send.append(self.nodes[0].signrawtransaction(raw_tx))
+
+        # Have node 1 (miner) send the transactions
+        self.nodes[1].sendrawtransaction(txns_to_send[0]["hex"], True)
+        self.nodes[1].sendrawtransaction(txns_to_send[1]["hex"], True)
+        self.nodes[1].sendrawtransaction(txns_to_send[2]["hex"], True)
+
+        # Have node1 mine a block to confirm transactions:
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        assert_equal(self.nodes[0].getbalance(), 0)
+        assert_equal(self.nodes[2].getbalance(), 50)
+        assert_equal(self.nodes[0].getbalance("*"), 0)
+        assert_equal(self.nodes[2].getbalance("*"), 50)
+
+        # Send 10 ZEC normally
+        address = self.nodes[0].getnewaddress("")
+        self.nodes[2].settxfee(Decimal('0.001'))  # not the default
+        self.nodes[2].sendtoaddress(address, 10, "", "", False)
+        self.sync_all()
+        self.nodes[2].generate(1)
+        self.sync_all()
+        assert_equal(self.nodes[2].getbalance(), Decimal('39.99900000'))
+        assert_equal(self.nodes[0].getbalance(), Decimal('10.00000000'))
+        assert_equal(self.nodes[2].getbalance("*"), Decimal('39.99900000'))
+        assert_equal(self.nodes[0].getbalance("*"), Decimal('10.00000000'))
+
+        # Send 10 ZEC with subtract fee from amount
+        self.nodes[2].sendtoaddress(address, 10, "", "", True)
+        self.sync_all()
+        self.nodes[2].generate(1)
+        self.sync_all()
+        assert_equal(self.nodes[2].getbalance(), Decimal('29.99900000'))
+        assert_equal(self.nodes[0].getbalance(), Decimal('19.99900000'))
+        assert_equal(self.nodes[2].getbalance("*"), Decimal('29.99900000'))
+        assert_equal(self.nodes[0].getbalance("*"), Decimal('19.99900000'))
+
+        # Sendmany 10 ZEC
+        self.nodes[2].sendmany("", {address: 10}, 0, "", [])
+        self.sync_all()
+        self.nodes[2].generate(1)
+        self.sync_all()
+        assert_equal(self.nodes[2].getbalance(), Decimal('19.99800000'))
+        assert_equal(self.nodes[0].getbalance(), Decimal('29.99900000'))
+        assert_equal(self.nodes[2].getbalance("*"), Decimal('19.99800000'))
+        assert_equal(self.nodes[0].getbalance("*"), Decimal('29.99900000'))
+
+        # Sendmany 10 ZEC with subtract fee from amount
+        self.nodes[2].sendmany("", {address: 10}, 0, "", [address])
+        self.sync_all()
+        self.nodes[2].generate(1)
+        self.sync_all()
+        assert_equal(self.nodes[2].getbalance(), Decimal('9.99800000'))
+        assert_equal(self.nodes[0].getbalance(), Decimal('39.99800000'))
+        assert_equal(self.nodes[2].getbalance("*"), Decimal('9.99800000'))
+        assert_equal(self.nodes[0].getbalance("*"), Decimal('39.99800000'))
+
+        # Test ResendWalletTransactions:
+        # Create a couple of transactions, then start up a fourth
+        # node (nodes[3]) and ask nodes[0] to rebroadcast.
+        # EXPECT: nodes[3] should have those transactions in its mempool.
+        txid1 = self.nodes[0].sendtoaddress(self.nodes[1].getnewaddress(), 1)
+        txid2 = self.nodes[1].sendtoaddress(self.nodes[0].getnewaddress(), 1)
+        sync_mempools(self.nodes)
+
+        self.nodes.append(start_node(3, self.options.tmpdir))
+        connect_nodes_bi(self.nodes, 0, 3)
+        sync_blocks(self.nodes)
+
+        relayed = self.nodes[0].resendwallettransactions()
+        assert_equal(set(relayed), set([txid1, txid2]))
+        sync_mempools(self.nodes)
+
+        assert(txid1 in self.nodes[3].getrawmempool())
+
+        # check integer balances from getbalance
+        assert_equal(self.nodes[2].getbalance("*", 1, False, True), 999800000)
+
+        # send from node 0 to node 2 taddr
+        mytaddr = self.nodes[2].getnewaddress()
+        mytxid = self.nodes[0].sendtoaddress(mytaddr, 10.0)
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        mybalance = self.nodes[2].z_getbalance(mytaddr)
+        assert_equal(mybalance, Decimal('10.0'))
+
+        # check integer balances from z_getbalance
+        assert_equal(self.nodes[2].z_getbalance(mytaddr, 1, True), 1000000000)
+
+        mytxdetails = self.nodes[2].gettransaction(mytxid)
+        myvjoinsplits = mytxdetails["vjoinsplit"]
+        assert_equal(0, len(myvjoinsplits))
+        assert("joinSplitPubKey" not in mytxdetails)
+        assert("joinSplitSig" not in mytxdetails)
+
+if __name__ == '__main__':
+    WalletTest ().main ()
diff --git a/depend/zcash/qa/rpc-tests/wallet_1941.py b/depend/zcash/qa/rpc-tests/wallet_1941.py
new file mode 100755
index 000000000..8aff2c5cd
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_1941.py
@@ -0,0 +1,103 @@
+#!/usr/bin/env python3
+# Copyright (c) 2016 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+# This is a regression test for #1941.
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, initialize_chain_clean, \
+    initialize_datadir, start_nodes, start_node, connect_nodes_bi, \
+    bitcoind_processes, wait_and_assert_operationid_status, \
+    get_coinbase_address, DEFAULT_FEE
+
+from decimal import Decimal
+
+starttime = 1388534400
+
+class Wallet1941RegressionTest (BitcoinTestFramework):
+
+    def setup_chain(self):
+        print("Initializing test directory "+self.options.tmpdir)
+        initialize_chain_clean(self.options.tmpdir, 1)
+
+    # Start nodes with -regtestshieldcoinbase to set fCoinbaseMustBeShielded to true.
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(1, self.options.tmpdir, extra_args=[['-regtestshieldcoinbase','-debug=zrpc']] )
+        self.is_network_split=False
+
+    def add_second_node(self):
+        initialize_datadir(self.options.tmpdir, 1)
+        self.nodes.append(start_node(1, self.options.tmpdir, extra_args=['-regtestshieldcoinbase','-debug=zrpc']))
+        self.nodes[1].setmocktime(starttime + 9000)
+        connect_nodes_bi(self.nodes,0,1)
+        self.sync_all()
+
+    def restart_second_node(self, extra_args=[]):
+        self.nodes[1].stop()
+        bitcoind_processes[1].wait()
+        self.nodes[1] = start_node(1, self.options.tmpdir, extra_args=['-regtestshieldcoinbase','-debug=zrpc'] + extra_args)
+        self.nodes[1].setmocktime(starttime + 9000)
+        connect_nodes_bi(self.nodes, 0, 1)
+        self.sync_all()
+
+    def run_test (self):
+        print("Mining blocks...")
+
+        self.nodes[0].setmocktime(starttime)
+        self.nodes[0].generate(101)
+        self.sync_all()
+
+        mytaddr = get_coinbase_address(self.nodes[0])
+        myzaddr = self.nodes[0].z_getnewaddress()
+
+        # Send 10 coins to our zaddr.
+        recipients = []
+        recipients.append({"address":myzaddr, "amount":Decimal('10.0') - DEFAULT_FEE})
+        myopid = self.nodes[0].z_sendmany(mytaddr, recipients)
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+        self.nodes[0].generate(1)
+
+        # Ensure the block times of the latest blocks exceed the variability
+        self.nodes[0].setmocktime(starttime + 3000)
+        self.nodes[0].generate(1)
+        self.nodes[0].setmocktime(starttime + 6000)
+        self.nodes[0].generate(1)
+        self.nodes[0].setmocktime(starttime + 9000)
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # Confirm the balance on node 0.
+        resp = self.nodes[0].z_getbalance(myzaddr)
+        assert_equal(Decimal(resp), Decimal('10.0') - DEFAULT_FEE)
+
+        # Export the key for the zaddr from node 0.
+        key = self.nodes[0].z_exportkey(myzaddr)
+
+        # Start the new wallet
+        self.add_second_node()
+        self.nodes[1].getnewaddress()
+        self.nodes[1].z_getnewaddress()
+        self.nodes[1].generate(101)
+        self.sync_all()
+
+        # Import the key on node 1, only scanning the last few blocks.
+        # (uses 'true' to test boolean fallback)
+        self.nodes[1].z_importkey(key, 'true', self.nodes[1].getblockchaininfo()['blocks'] - 100)
+
+        # Confirm that the balance on node 1 is zero, as we have not
+        # rescanned over the older transactions
+        resp = self.nodes[1].z_getbalance(myzaddr)
+        assert_equal(Decimal(resp), 0)
+
+        # Re-import the key on node 1, scanning from before the transaction.
+        self.nodes[1].z_importkey(key, 'yes', self.nodes[1].getblockchaininfo()['blocks'] - 110)
+
+        # Confirm that the balance on node 1 is valid now (node 1 must
+        # have rescanned)
+        resp = self.nodes[1].z_getbalance(myzaddr)
+        assert_equal(Decimal(resp), Decimal('10.0') - DEFAULT_FEE)
+
+
+if __name__ == '__main__':
+    Wallet1941RegressionTest().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_accounts.py b/depend/zcash/qa/rpc-tests/wallet_accounts.py
new file mode 100755
index 000000000..68ee79bb5
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_accounts.py
@@ -0,0 +1,251 @@
+#!/usr/bin/env python3
+# Copyright (c) 2022 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.authproxy import JSONRPCException
+from test_framework.mininode import COIN
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    NU5_BRANCH_ID,
+    assert_equal,
+    assert_raises_message,
+    assert_true,
+    get_coinbase_address,
+    nuparams,
+    start_nodes,
+    wait_and_assert_operationid_status,
+)
+
+from decimal import Decimal
+
+# Test wallet accounts behaviour
+class WalletAccountsTest(BitcoinTestFramework):
+    def setup_nodes(self):
+        return start_nodes(self.num_nodes, self.options.tmpdir, [[
+            nuparams(NU5_BRANCH_ID, 210),
+        ]] * self.num_nodes)
+
+    def check_receiver_types(self, ua, expected):
+        actual = self.nodes[0].z_listunifiedreceivers(ua)
+        assert_equal(set(expected), set(actual))
+
+    def check_z_listaccounts(self, node, acct_id, addr_id, ua):
+        accounts = self.nodes[node].z_listaccounts()
+        assert_equal(accounts[acct_id]['addresses'][addr_id]['ua'], ua['address'])
+        assert_equal(accounts[acct_id]['addresses'][addr_id]['diversifier_index'], ua['diversifier_index'])
+
+    # Check we only have balances in the expected pools.
+    # Remember that empty pools are omitted from the output.
+    def _check_balance_for_rpc(self, rpcmethod, node, account, expected, minconf):
+        rpc = getattr(self.nodes[node], rpcmethod)
+        actual = rpc(account, minconf)
+        assert_equal(set(expected), set(actual['pools']))
+        total_balance = 0
+        for pool in expected:
+            assert_equal(expected[pool] * COIN, actual['pools'][pool]['valueZat'])
+            total_balance += expected[pool]
+        assert_equal(actual['minimum_confirmations'], minconf)
+        return total_balance
+
+    def check_balance(self, node, account, address, expected, minconf=1):
+        acct_balance = self._check_balance_for_rpc('z_getbalanceforaccount', node, account, expected, minconf)
+        z_getbalance = self.nodes[node].z_getbalance(address, minconf)
+        assert_equal(acct_balance, z_getbalance)
+        fvk = self.nodes[node].z_exportviewingkey(address)
+        self._check_balance_for_rpc('z_getbalanceforviewingkey', node, fvk, expected, minconf)
+
+    def run_test(self):
+        # With a new wallet, the first account will be 0.
+        account0 = self.nodes[0].z_getnewaccount()
+        assert_equal(account0['account'], 0)
+
+        # Verify that just creating the account does not generate any visible addresses
+        addresses = self.nodes[0].z_listaddresses()
+        assert_equal([], addresses)
+        accounts = self.nodes[0].z_listaccounts()
+        assert_equal(len(accounts), 1)
+        assert_equal(accounts[0]['account'], 0)
+
+        # The next account will be 1.
+        account1 = self.nodes[0].z_getnewaccount()
+        assert_equal(account1['account'], 1)
+        accounts = self.nodes[0].z_listaccounts()
+        assert_equal(len(accounts), 2)
+        assert_equal(accounts[1]['account'], 1)
+
+        # Generate the first address for account 0.
+        addr0 = self.nodes[0].z_getaddressforaccount(0)
+        assert_equal(addr0['account'], 0)
+        assert_equal(set(addr0['receiver_types']), set(['p2pkh', 'sapling', 'orchard']))
+        ua0 = addr0['address']
+        self.check_z_listaccounts(0, 0, 0, addr0)
+
+        # We pick mnemonic phrases to ensure that we can always generate the default
+        # address in account 0; this is however not necessarily at diversifier index 0.
+        # We should be able to generate it directly and get the exact same data.
+        j = addr0['diversifier_index']
+        assert_equal(self.nodes[0].z_getaddressforaccount(0, [], j), addr0)
+        if j > 0:
+            # We should get an error if we generate the address at diversifier index 0.
+            assert_raises_message(
+                JSONRPCException,
+                'no address at diversifier index 0',
+                self.nodes[0].z_getaddressforaccount, 0, [], 0)
+
+        # The second address for account 0 is different to the first address.
+        addr0_2 = self.nodes[0].z_getaddressforaccount(0)
+        assert_equal(addr0_2['account'], 0)
+        assert_equal(set(addr0_2['receiver_types']), set(['p2pkh', 'sapling', 'orchard']))
+        ua0_2 = addr0_2['address']
+        assert(ua0 != ua0_2)
+        self.check_z_listaccounts(0, 0, 1, addr0_2)
+
+        # We can generate a fully-shielded address.
+        addr0_3 = self.nodes[0].z_getaddressforaccount(0, ['sapling', 'orchard'])
+        assert_equal(addr0_3['account'], 0)
+        assert_equal(set(addr0_3['receiver_types']), set(['sapling', 'orchard']))
+        ua0_3 = addr0_3['address']
+        self.check_z_listaccounts(0, 0, 2, addr0_3)
+
+        # We can generate an address without a Sapling receiver.
+        addr0_4 = self.nodes[0].z_getaddressforaccount(0, ['p2pkh', 'orchard'])
+        assert_equal(addr0_4['account'], 0)
+        assert_equal(set(addr0_4['receiver_types']), set(['p2pkh', 'orchard']))
+        ua0_4 = addr0_4['address']
+        self.check_z_listaccounts(0, 0, 3, addr0_4)
+
+        # The first address for account 1 is different to account 0.
+        addr1 = self.nodes[0].z_getaddressforaccount(1)
+        assert_equal(addr1['account'], 1)
+        assert_equal(set(addr1['receiver_types']), set(['p2pkh', 'sapling', 'orchard']))
+        ua1 = addr1['address']
+        assert(ua0 != ua1)
+        self.check_z_listaccounts(0, 1, 0, addr1)
+
+        # The UA contains the expected receiver kinds.
+        self.check_receiver_types(ua0,   ['p2pkh', 'sapling', 'orchard'])
+        self.check_receiver_types(ua0_2, ['p2pkh', 'sapling', 'orchard'])
+        self.check_receiver_types(ua0_3, [               'sapling', 'orchard'])
+        self.check_receiver_types(ua0_4, ['p2pkh',            'orchard'])
+        self.check_receiver_types(ua1,   ['p2pkh', 'sapling', 'orchard'])
+
+        # The balances of the accounts are all zero.
+        self.check_balance(0, 0, ua0, {})
+        self.check_balance(0, 1, ua1, {})
+
+        # Send coinbase funds to the UA.
+        print('Sending coinbase funds to account')
+        recipients = [{'address': ua0, 'amount': Decimal('10')}]
+        opid = self.nodes[0].z_sendmany(get_coinbase_address(self.nodes[0]), recipients, 1, 0, 'AllowRevealedSenders')
+        txid = wait_and_assert_operationid_status(self.nodes[0], opid)
+
+        # The wallet should detect the new note as belonging to the UA.
+        tx_details = self.nodes[0].z_viewtransaction(txid)
+        assert_equal(len(tx_details['outputs']), 1)
+        assert_equal(tx_details['outputs'][0]['type'], 'sapling')
+        assert_equal(tx_details['outputs'][0]['address'], ua0)
+
+        # The new balance should not be visible with the default minconf, but should be
+        # visible with minconf=0.
+        self.sync_all()
+        self.check_balance(0, 0, ua0, {})
+        self.check_balance(0, 0, ua0, {'sapling': 10}, 0)
+
+        self.nodes[2].generate(1)
+        self.sync_all()
+
+        # The default minconf should now detect the balance.
+        self.check_balance(0, 0, ua0, {'sapling': 10})
+
+        # Send Sapling funds from the UA.
+        print('Sending account funds to Sapling address')
+        node1sapling = self.nodes[1].z_getnewaddress('sapling')
+
+        recipients = [{'address': node1sapling, 'amount': Decimal('1')}]
+        opid = self.nodes[0].z_sendmany(ua0, recipients, 1, 0)
+        txid = wait_and_assert_operationid_status(self.nodes[0], opid)
+
+        # The wallet should detect the spent note as belonging to the UA.
+        tx_details = self.nodes[0].z_viewtransaction(txid)
+        assert_equal(len(tx_details['spends']), 1)
+        assert_equal(tx_details['spends'][0]['type'], 'sapling')
+        assert_equal(tx_details['spends'][0]['address'], ua0)
+
+        # The balances of the account should reflect whether zero-conf transactions are
+        # being considered. We will show either 0 (because the spent 10-ZEC note is never
+        # shown, as that transaction has been created and broadcast, and _might_ get mined
+        # up until the transaction expires), or 9 (if we include the unmined transaction).
+        self.sync_all()
+        self.check_balance(0, 0, ua0, {})
+        self.check_balance(0, 0, ua0, {'sapling': 9}, 0)
+
+        # Activate NU5
+        print('Activating NU5')
+        self.nodes[2].generate(9)
+        self.sync_all()
+        assert_equal(self.nodes[0].getblockchaininfo()['blocks'], 210)
+
+        # Send more coinbase funds to the UA.
+        print('Sending coinbase funds to account')
+        recipients = [{'address': ua0, 'amount': Decimal('10')}]
+        opid = self.nodes[0].z_sendmany(get_coinbase_address(self.nodes[0]), recipients, 1, 0, 'AllowRevealedSenders')
+        txid = wait_and_assert_operationid_status(self.nodes[0], opid)
+
+        # The wallet should detect the new note as belonging to the UA.
+        tx_details = self.nodes[0].z_viewtransaction(txid)
+        assert_equal(len(tx_details['outputs']), 1)
+        assert_equal(tx_details['outputs'][0]['type'], 'orchard')
+        assert_equal(tx_details['outputs'][0]['address'], ua0)
+
+        # The new balance should not be visible with the default minconf, but should be
+        # visible with minconf=0.
+        self.sync_all()
+        self.check_balance(0, 0, ua0, {'sapling': 9})
+        self.check_balance(0, 0, ua0, {'sapling': 9, 'orchard': 10}, 0)
+
+        # The total balance with the default minconf should be just the Sapling balance
+        assert_equal('9.00', self.nodes[0].z_gettotalbalance()['private'])
+        assert_equal('19.00', self.nodes[0].z_gettotalbalance(0)['private'])
+
+        self.nodes[2].generate(1)
+        self.sync_all()
+
+        # Send Orchard funds from the UA.
+        print('Sending account funds to Orchard-only UA')
+        node1account = self.nodes[1].z_getnewaccount()['account']
+        node1orchard = self.nodes[1].z_getaddressforaccount(node1account, ['orchard'])
+        self.check_z_listaccounts(1, 0, 0, node1orchard)
+        node1orchard = node1orchard['address']
+
+        recipients = [{'address': node1orchard, 'amount': Decimal('1')}]
+        opid = self.nodes[0].z_sendmany(ua0, recipients, 1, 0)
+        txid = wait_and_assert_operationid_status(self.nodes[0], opid)
+
+        # The wallet should detect the spent note as belonging to the UA.
+        tx_details = self.nodes[0].z_viewtransaction(txid)
+        assert_equal(len(tx_details['spends']), 1)
+        assert_equal(tx_details['spends'][0]['type'], 'orchard')
+        assert_equal(tx_details['spends'][0]['address'], ua0)
+
+        assert_equal(len(tx_details['outputs']), 2)
+        outputs = sorted(tx_details['outputs'], key=lambda x: x['valueZat'])
+        assert_equal(outputs[0]['type'], 'orchard')
+        assert_equal(outputs[0]['address'], node1orchard)
+        assert_equal(outputs[0]['valueZat'], 100000000)
+        # outputs[1] is change
+        assert_equal(outputs[1]['type'], 'orchard')
+        assert_true('address' not in outputs[1]) #
+
+        # The balances of the account should reflect whether zero-conf transactions are
+        # being considered. The Sapling balance should remain at 9, while the Orchard
+        # balance will show either 0 (because the spent 10-ZEC note is never shown, as
+        # that transaction has been created and broadcast, and _might_ get mined up until
+        # the transaction expires), or 9 (if we include the unmined transaction).
+        self.sync_all()
+        self.check_balance(0, 0, ua0, {'sapling': 9})
+        self.check_balance(0, 0, ua0, {'sapling': 9, 'orchard': 9}, 0)
+
+
+if __name__ == '__main__':
+    WalletAccountsTest().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_addresses.py b/depend/zcash/qa/rpc-tests/wallet_addresses.py
new file mode 100755
index 000000000..20ce16814
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_addresses.py
@@ -0,0 +1,191 @@
+#!/usr/bin/env python3
+# Copyright (c) 2018 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    assert_equal,
+    connect_nodes_bi,
+    start_nodes,
+    stop_nodes,
+    wait_bitcoinds,
+    NU5_BRANCH_ID,
+)
+from test_framework.mininode import nuparams
+
+# Test wallet address behaviour across network upgrades
+class WalletAddressesTest(BitcoinTestFramework):
+    def __init__(self):
+        super().__init__()
+        # need 2 nodes to import addresses
+        self.num_nodes = 2
+        self.setup_clean_chain = True
+
+    def setup_network(self):
+        self.nodes = start_nodes(
+            self.num_nodes, self.options.tmpdir,
+            extra_args=[[nuparams(NU5_BRANCH_ID, 2),]] * self.num_nodes)
+        connect_nodes_bi(self.nodes, 0, 1)
+        self.is_network_split = False
+        self.sync_all()
+
+    def list_addresses(self, node, expected_sources):
+        addrs = self.nodes[node].listaddresses()
+        sources = [s['source'] for s in addrs]
+        # Sources should be unique.
+        assert_equal(len(set(sources)), len(sources))
+        assert_equal(set(sources), set(expected_sources))
+
+        # Extract a list of all addresses from the output.
+        all_addrs = [
+            source.get('transparent', {}).get('addresses', []) +
+            source.get('transparent', {}).get('changeAddresses', []) +
+            source.get('sprout', {}).get('addresses', []) +
+            [s['addresses'] for s in source.get('sapling', [])] +
+            [[a['address'] for a in s['addresses']] for s in source.get('unified', [])]
+        for source in addrs]
+        all_addrs = [a for s in all_addrs for a in s]
+        all_addrs = [a if type(a) == list else [a] for a in all_addrs]
+        all_addrs = [a for s in all_addrs for a in s]
+
+        assert_equal(len(set(all_addrs)), len(all_addrs), "Duplicates in listaddresses output: %s" % addrs)
+        return addrs
+
+    def run_test(self):
+        def get_source(listed_addresses, source):
+            return next(src for src in listed_addresses if src['source'] == source)
+
+        print("Testing height 1 (Sapling)")
+        self.nodes[0].generate(1)
+        self.sync_all()
+        assert_equal(self.nodes[0].getblockcount(), 1)
+        listed_addresses = self.list_addresses(0, ['mnemonic_seed'])
+        # There should be a single address from the coinbase, which was derived
+        # from the mnemonic seed.
+        assert 'transparent' in get_source(listed_addresses, 'mnemonic_seed')
+
+        # If we import a t-address, we should see imported_watchonly as a source.
+        taddr_import = self.nodes[1].getnewaddress()
+        self.nodes[0].importaddress(taddr_import)
+        listed_addresses = self.list_addresses(0, ['imported_watchonly', 'mnemonic_seed'])
+        imported_watchonly_src = get_source(listed_addresses, 'imported_watchonly')
+        assert_equal(imported_watchonly_src['transparent']['addresses'][0], taddr_import)
+
+        account = self.nodes[0].z_getnewaccount()['account']
+        sprout_1 = self.nodes[0].z_getnewaddress('sprout')
+        sapling_1 = self.nodes[0].z_getnewaddress('sapling')
+        unified_1 = self.nodes[0].z_getaddressforaccount(account)['address']
+        types_and_addresses = [
+            ('sprout', sprout_1),
+            ('sapling', sapling_1),
+            ('unified', unified_1),
+        ]
+
+        for addr_type, addr in types_and_addresses:
+            res = self.nodes[0].z_validateaddress(addr)
+            assert res['isvalid']
+            # assert res['ismine'] # this isn't present for unified addresses
+            assert_equal(res['type'], addr_type)
+
+        # We should see the following sources:
+        # - imported_watchonly (for the previously-imported t-addr)
+        # - legacy_random (for the new Sprout address)
+        # - mnemonic_seed (for the previous t-addrs and the new Sapling and Unified addrs)
+        listed_addresses = self.list_addresses(0, ['imported_watchonly', 'legacy_random', 'mnemonic_seed'])
+        legacy_random_src = get_source(listed_addresses, 'legacy_random')
+        mnemonic_seed_src = get_source(listed_addresses, 'mnemonic_seed')
+
+        # Check Sprout addrs
+        assert_equal(legacy_random_src['sprout']['addresses'], [sprout_1])
+
+        # Check Sapling addrs
+        assert_equal(
+            set([(obj['zip32KeyPath'], x) for obj in mnemonic_seed_src['sapling'] for x in obj['addresses']]),
+            set([("m/32'/1'/2147483647'/0'", sapling_1)]),
+        )
+
+        # Check Unified addrs
+        unified_obj = mnemonic_seed_src['unified']
+        assert_equal(unified_obj[0]['account'], 0)
+        assert_equal(unified_obj[0]['addresses'][0]['address'], unified_1)
+        assert 'diversifier_index' in unified_obj[0]['addresses'][0]
+        assert_equal(unified_obj[0]['addresses'][0]['receiver_types'], ['p2pkh', 'sapling', 'orchard'])
+
+        # import the key for sapling_1 into node 1
+        sapling_1_key = self.nodes[0].z_exportkey(sapling_1)
+        self.nodes[1].z_importkey(sapling_1_key)
+
+        # verify that we see the imported source
+        listed_addresses = self.list_addresses(1, ['imported', 'mnemonic_seed'])
+        imported_src = get_source(listed_addresses, 'imported')
+        assert_equal(imported_src['sapling'][0]['addresses'], [sapling_1])
+
+        # stop the nodes & restart to ensure that the imported address
+        # still shows up in listaddresses output
+        stop_nodes(self.nodes)
+        wait_bitcoinds()
+        self.setup_network()
+
+        listed_addresses = self.list_addresses(1, ['imported', 'mnemonic_seed'])
+        imported_src = get_source(listed_addresses, 'imported')
+        assert_equal(imported_src['sapling'][0]['addresses'], [sapling_1])
+
+        print("Testing height 2 (NU5)")
+        self.nodes[0].generate(1)
+        self.sync_all()
+        assert_equal(self.nodes[0].getblockcount(), 2)
+        # Sprout address generation is no longer allowed
+        sapling_2 = self.nodes[0].z_getnewaddress('sapling')
+        unified_2 = self.nodes[0].z_getaddressforaccount(account)['address']
+        types_and_addresses = [
+            ('sapling', sapling_2),
+            ('unified', unified_2),
+        ]
+
+        for addr_type, addr in types_and_addresses:
+            res = self.nodes[0].z_validateaddress(addr)
+            assert res['isvalid']
+            # assert res['ismine'] # this isn't present for unified addresses
+            assert_equal(res['type'], addr_type)
+
+        # We should see the same sources (address generation does not change across the NU5 boundary).
+        listed_addresses = self.list_addresses(0, ['imported_watchonly', 'legacy_random', 'mnemonic_seed'])
+        legacy_random_src = get_source(listed_addresses, 'legacy_random')
+        mnemonic_seed_src = get_source(listed_addresses, 'mnemonic_seed')
+
+        # Check Sprout addrs
+        assert_equal(legacy_random_src['sprout']['addresses'], [sprout_1])
+
+        # Check Sapling addrs
+        assert_equal(
+            set([(obj['zip32KeyPath'], x) for obj in mnemonic_seed_src['sapling'] for x in obj['addresses']]),
+            set([
+                ("m/32'/1'/2147483647'/0'", sapling_1),
+                ("m/32'/1'/2147483647'/1'", sapling_2),
+            ]),
+        )
+
+        # Check Unified addrs
+        unified_obj = mnemonic_seed_src['unified']
+        assert_equal(unified_obj[0]['account'], 0)
+        assert_equal(
+            set([addr['address'] for addr in unified_obj[0]['addresses']]),
+            set([unified_1, unified_2]),
+        )
+        assert 'diversifier_index' in unified_obj[0]['addresses'][0]
+        assert 'diversifier_index' in unified_obj[0]['addresses'][1]
+        assert_equal(unified_obj[0]['addresses'][0]['receiver_types'], ['p2pkh', 'sapling', 'orchard'])
+        assert_equal(unified_obj[0]['addresses'][1]['receiver_types'], ['p2pkh', 'sapling', 'orchard'])
+
+        print("Generate mature coinbase, spend to create and detect change")
+        self.nodes[0].generate(100)
+        self.sync_all()
+        self.nodes[0].sendmany('', {taddr_import: 1})
+        listed_addresses = self.list_addresses(0, ['imported_watchonly', 'legacy_random', 'mnemonic_seed'])
+        mnemonic_seed_src = get_source(listed_addresses, 'mnemonic_seed')
+        assert len(mnemonic_seed_src['transparent']['changeAddresses']) > 0
+
+
+if __name__ == '__main__':
+    WalletAddressesTest().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_anchorfork.py b/depend/zcash/qa/rpc-tests/wallet_anchorfork.py
new file mode 100755
index 000000000..e259af27b
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_anchorfork.py
@@ -0,0 +1,119 @@
+#!/usr/bin/env python3
+# Copyright (c) 2018 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, initialize_chain_clean, \
+    start_nodes, stop_nodes, connect_nodes_bi, \
+    wait_and_assert_operationid_status, wait_bitcoinds, get_coinbase_address, \
+    sync_blocks, sync_mempools, DEFAULT_FEE
+from decimal import Decimal
+
+class WalletAnchorForkTest (BitcoinTestFramework):
+
+    def setup_chain(self):
+        print("Initializing test directory "+self.options.tmpdir)
+        initialize_chain_clean(self.options.tmpdir, 4)
+
+    # Start nodes with -regtestshieldcoinbase to set fCoinbaseMustBeShielded to true.
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(3, self.options.tmpdir, extra_args=[['-regtestshieldcoinbase', '-debug=zrpc']] * 3 )
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,0,2)
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test (self):
+        print("Mining blocks...")
+        self.nodes[0].generate(4)
+        self.sync_all()
+
+        walletinfo = self.nodes[0].getwalletinfo()
+        assert_equal(walletinfo['immature_balance'], 40)
+        assert_equal(walletinfo['balance'], 0)
+
+        self.sync_all()
+        self.nodes[1].generate(102)
+        self.sync_all()
+
+        assert_equal(self.nodes[0].getbalance(), 40)
+        assert_equal(self.nodes[1].getbalance(), 20)
+        assert_equal(self.nodes[2].getbalance(), 0)
+
+        # At this point in time, commitment tree is the empty root
+
+        # Node 0 creates a joinsplit transaction
+        mytaddr0 = get_coinbase_address(self.nodes[0])
+        myzaddr0 = self.nodes[0].z_getnewaddress()
+        recipients = []
+        recipients.append({"address":myzaddr0, "amount": Decimal('10.0') - DEFAULT_FEE})
+        myopid = self.nodes[0].z_sendmany(mytaddr0, recipients)
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+
+        # Sync up mempools and mine the transaction.  All nodes have the same anchor.
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # Stop nodes.
+        stop_nodes(self.nodes)
+        wait_bitcoinds()
+
+        # Relaunch nodes and partition network into two:
+        # A: node 0
+        # B: node 1, 2
+        self.nodes = start_nodes(3, self.options.tmpdir, extra_args=[['-regtestshieldcoinbase', '-debug=zrpc']] * 3 )
+        connect_nodes_bi(self.nodes,1,2)
+
+        # Partition B, node 1 mines an empty block
+        self.nodes[1].generate(1)
+
+        # Partition A, node 0 creates a joinsplit transaction
+        recipients = []
+        recipients.append({"address":myzaddr0, "amount": Decimal('10.0') - DEFAULT_FEE})
+        myopid = self.nodes[0].z_sendmany(mytaddr0, recipients)
+        txid = wait_and_assert_operationid_status(self.nodes[0], myopid)
+        rawhex = self.nodes[0].getrawtransaction(txid)
+
+        # Partition A, node 0 mines a block with the transaction
+        self.nodes[0].generate(1)
+        # Same as self.sync_all() but only for node 0
+        sync_blocks(self.nodes[:1])
+        sync_mempools(self.nodes[:1])
+
+        # Partition B, node 1 mines the same joinsplit transaction
+        txid2 = self.nodes[1].sendrawtransaction(rawhex)
+        assert_equal(txid, txid2)
+        self.nodes[1].generate(1)
+        # Same as self.sync_all() but only for nodes 1 and 2
+        sync_blocks(self.nodes[1:])
+        sync_mempools(self.nodes[1:])
+
+        # Check that Partition B is one block ahead and that they have different tips
+        assert_equal(self.nodes[0].getblockcount() + 1, self.nodes[1].getblockcount())
+        assert( self.nodes[0].getbestblockhash() != self.nodes[1].getbestblockhash())
+
+        # Shut down all nodes so any in-memory state is saved to disk
+        stop_nodes(self.nodes)
+        wait_bitcoinds()
+
+        # Relaunch nodes and reconnect the entire network
+        self.nodes = start_nodes(3, self.options.tmpdir, extra_args=[['-regtestshieldcoinbase', '-debug=zrpc']] * 3 )
+        connect_nodes_bi(self.nodes,0, 1)
+        connect_nodes_bi(self.nodes,1, 2)
+        connect_nodes_bi(self.nodes,0, 2)
+
+        # Mine a new block and let it propagate
+        self.nodes[1].generate(1)
+        
+        # Due to a bug in v1.0.0-1.0.3, node 0 will die with a tree root assertion, so sync_all() will throw an exception.
+        self.sync_all()
+      
+        # v1.0.4 will reach here safely
+        assert_equal( self.nodes[0].getbestblockhash(), self.nodes[1].getbestblockhash())
+        assert_equal( self.nodes[1].getbestblockhash(), self.nodes[2].getbestblockhash())
+
+if __name__ == '__main__':
+    WalletAnchorForkTest().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_broadcast.py b/depend/zcash/qa/rpc-tests/wallet_broadcast.py
new file mode 100755
index 000000000..f625c8aac
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_broadcast.py
@@ -0,0 +1,59 @@
+#!/usr/bin/env python3
+# Copyright (c) 2020 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, connect_nodes_bi, start_nodes, stop_nodes, sync_blocks, wait_bitcoinds
+from decimal import Decimal
+
+# Test wallet address behaviour across network upgrades
+class WalletBroadcastTest(BitcoinTestFramework):
+    def run_test(self):
+        #do some -walletbroadcast tests
+        stop_nodes(self.nodes)
+        wait_bitcoinds()
+        self.nodes = start_nodes(3, self.options.tmpdir, [["-walletbroadcast=0"]] * 3)
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,0,2)
+        self.sync_all()
+
+        txIdNotBroadcasted  = self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(), 2)
+        txObjNotBroadcasted = self.nodes[0].gettransaction(txIdNotBroadcasted)
+        self.sync_all()
+        self.nodes[1].generate(1) #mine a block, tx should not be in there
+        self.sync_all()
+        assert_equal(self.nodes[2].getbalance(), Decimal('250.00000000')) #default should not be changed because tx was not broadcasted
+        assert_equal(self.nodes[2].getbalance("*"), Decimal('250.00000000')) #default should not be changed because tx was not broadcasted
+
+        #now broadcast from another node, mine a block, sync, and check the balance
+        self.nodes[1].sendrawtransaction(txObjNotBroadcasted['hex'])
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+        txObjNotBroadcasted = self.nodes[0].gettransaction(txIdNotBroadcasted)
+        assert_equal(self.nodes[2].getbalance(), Decimal('252.00000000')) #should not be
+        assert_equal(self.nodes[2].getbalance("*"), Decimal('252.00000000')) #should not be
+
+        #create another tx
+        txIdNotBroadcasted  = self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(), 2)
+
+        #restart the nodes with -walletbroadcast=1
+        stop_nodes(self.nodes)
+        wait_bitcoinds()
+        self.nodes = start_nodes(3, self.options.tmpdir)
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,0,2)
+        sync_blocks(self.nodes)
+
+        self.nodes[0].generate(1)
+        sync_blocks(self.nodes)
+
+        # tx should be added to balance because after restarting the nodes tx should be broadcast
+        assert_equal(self.nodes[2].getbalance(), Decimal('254.00000000'))
+        assert_equal(self.nodes[2].getbalance("*"), Decimal('254.00000000'))
+
+if __name__ == '__main__':
+    WalletBroadcastTest().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_changeaddresses.py b/depend/zcash/qa/rpc-tests/wallet_changeaddresses.py
new file mode 100755
index 000000000..409e2b94e
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_changeaddresses.py
@@ -0,0 +1,93 @@
+#!/usr/bin/env python3
+# Copyright (c) 2019 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    connect_nodes_bi,
+    get_coinbase_address,
+    initialize_chain_clean,
+    start_node,
+    wait_and_assert_operationid_status,
+)
+
+from decimal import Decimal
+
+# Test wallet change address behaviour
+class WalletChangeAddressesTest(BitcoinTestFramework):
+
+    def setup_chain(self):
+        print("Initializing test directory " + self.options.tmpdir)
+        initialize_chain_clean(self.options.tmpdir, 2)
+
+    def setup_network(self):
+        args = [
+            '-nuparams=5ba81b19:1', # Overwinter
+            '-nuparams=76b809bb:1', # Sapling
+            '-txindex'              # Avoid JSONRPC error: No information available about transaction
+        ]
+        self.nodes = []
+        self.nodes.append(start_node(0, self.options.tmpdir, args))
+        self.nodes.append(start_node(1, self.options.tmpdir, args))
+        connect_nodes_bi(self.nodes,0,1)
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test(self):
+        self.nodes[0].generate(110)
+
+        # Obtain some transparent funds
+        midAddr = self.nodes[0].z_getnewaddress('sapling')
+        myopid = self.nodes[0].z_shieldcoinbase(get_coinbase_address(self.nodes[0]), midAddr, 0)['opid']
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+        
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+        taddrSource = self.nodes[0].getnewaddress()
+        for _ in range(6):
+            recipients = [{"address": taddrSource, "amount": Decimal('2')}]
+            myopid = self.nodes[0].z_sendmany(midAddr, recipients, 1, 0)
+            wait_and_assert_operationid_status(self.nodes[0], myopid)
+            self.sync_all()
+            self.nodes[1].generate(1)
+            self.sync_all()
+
+        def check_change_taddr_reuse(target):
+            recipients = [{"address": target, "amount": Decimal('1')}]
+
+            # Send funds to recipient address twice
+            myopid = self.nodes[0].z_sendmany(taddrSource, recipients, 1, 0)
+            txid1 = wait_and_assert_operationid_status(self.nodes[0], myopid)
+            self.nodes[1].generate(1)
+            self.sync_all()
+            myopid = self.nodes[0].z_sendmany(taddrSource, recipients, 1, 0)
+            txid2 = wait_and_assert_operationid_status(self.nodes[0], myopid)
+            self.nodes[1].generate(1)
+            self.sync_all()
+
+            # Verify that the two transactions used different change addresses
+            tx1 = self.nodes[0].getrawtransaction(txid1, 1)
+            tx2 = self.nodes[0].getrawtransaction(txid2, 1)
+            for i in range(len(tx1['vout'])):
+                tx1OutAddrs = tx1['vout'][i]['scriptPubKey']['addresses']
+                tx2OutAddrs = tx2['vout'][i]['scriptPubKey']['addresses']
+                if tx1OutAddrs != [target]:
+                    print('Source address:     %s' % taddrSource)
+                    print('TX1 change address: %s' % tx1OutAddrs[0])
+                    print('TX2 change address: %s' % tx2OutAddrs[0])
+                    assert(tx1OutAddrs != tx2OutAddrs)
+
+        taddr = self.nodes[0].getnewaddress()
+        saplingAddr = self.nodes[0].z_getnewaddress('sapling')
+
+        print()
+        print('Checking z_sendmany(taddr->Sapling)')
+        check_change_taddr_reuse(saplingAddr)
+        print()
+        print('Checking z_sendmany(taddr->taddr)')
+        check_change_taddr_reuse(taddr)
+
+if __name__ == '__main__':
+    WalletChangeAddressesTest().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_changeindicator.py b/depend/zcash/qa/rpc-tests/wallet_changeindicator.py
new file mode 100755
index 000000000..b091b2396
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_changeindicator.py
@@ -0,0 +1,77 @@
+#!/usr/bin/env python3
+# Copyright (c) 2018 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, assert_true, assert_false, wait_and_assert_operationid_status
+
+from decimal import Decimal
+
+class WalletChangeIndicatorTest (BitcoinTestFramework):
+    # Helper Methods
+    def generate_and_sync(self):
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+    # Tests
+    def run_test(self):
+        taddr = self.nodes[1].getnewaddress()
+        zaddr1 = self.nodes[1].z_getnewaddress()
+        zaddr2 = self.nodes[1].z_getnewaddress()
+
+        self.nodes[0].sendtoaddress(taddr, Decimal('1.0'))
+        self.generate_and_sync()
+
+        # Send 1 ZEC to a zaddr
+        wait_and_assert_operationid_status(self.nodes[1], self.nodes[1].z_sendmany(taddr, [{'address': zaddr1, 'amount': 1.0, 'memo': 'c0ffee01'}], 1, 0))
+        self.generate_and_sync()
+
+        # Check that we have received 1 note which is not change
+        receivedbyaddress = self.nodes[1].z_listreceivedbyaddress(zaddr1, 0)
+        listunspent = self.nodes[1].z_listunspent()
+        assert_equal(1, len(receivedbyaddress), "Should have received 1 note")
+        assert_false(receivedbyaddress[0]['change'], "Note should not be change")
+        assert_equal(1, len(listunspent), "Should have 1 unspent note")
+        assert_false(listunspent[0]['change'], "Unspent note should not be change")
+
+        # Generate some change
+        wait_and_assert_operationid_status(self.nodes[1], self.nodes[1].z_sendmany(zaddr1, [{'address': zaddr2, 'amount': 0.6, 'memo': 'c0ffee02'}], 1, 0))
+        self.generate_and_sync()
+
+        # Check zaddr1 received
+        sortedreceived1 = sorted(self.nodes[1].z_listreceivedbyaddress(zaddr1, 0), key = lambda received: received['amount'])
+        assert_equal(2, len(sortedreceived1), "zaddr1 Should have received 2 notes")
+        assert_equal(Decimal('0.4'), sortedreceived1[0]['amount'])
+        assert_true(sortedreceived1[0]['change'], "Note valued at 0.4 should be change")
+        assert_equal(Decimal('1.0'), sortedreceived1[1]['amount'])
+        assert_false(sortedreceived1[1]['change'], "Note valued at 1.0 should not be change")
+        # Check zaddr2 received
+        sortedreceived2 = sorted(self.nodes[1].z_listreceivedbyaddress(zaddr2, 0), key = lambda received: received['amount'])
+        assert_equal(1, len(sortedreceived2), "zaddr2 Should have received 1 notes")
+        assert_equal(Decimal('0.6'), sortedreceived2[0]['amount'])
+        assert_false(sortedreceived2[0]['change'], "Note valued at 0.6 should not be change")
+        # Check unspent
+        sortedunspent = sorted(self.nodes[1].z_listunspent(), key = lambda received: received['amount'])
+        assert_equal(2, len(sortedunspent), "Should have 2 unspent notes")
+        assert_equal(Decimal('0.4'), sortedunspent[0]['amount'])
+        assert_true(sortedunspent[0]['change'], "Unspent note valued at 0.4 should be change")
+        assert_equal(Decimal('0.6'), sortedunspent[1]['amount'])
+        assert_false(sortedunspent[1]['change'], "Unspent note valued at 0.6 should not be change")
+
+        # Give node 0 a viewing key
+        viewing_key = self.nodes[1].z_exportviewingkey(zaddr1)
+        self.nodes[0].z_importviewingkey(viewing_key)
+        received_node0 = self.nodes[0].z_listreceivedbyaddress(zaddr1, 0)
+        assert_equal(2, len(received_node0))
+        unspent_node0 = self.nodes[0].z_listunspent(1, 9999999, True)
+        # Sapling viewing keys correctly detect spends, so we only see the unspent note
+        assert_equal(1, len(unspent_node0))
+        # node 0 only has a viewing key so does not see the change field
+        assert_false('change' in received_node0[0])
+        assert_false('change' in received_node0[1])
+        assert_false('change' in unspent_node0[0])
+
+if __name__ == '__main__':
+    WalletChangeIndicatorTest().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_db_flush.py b/depend/zcash/qa/rpc-tests/wallet_db_flush.py
new file mode 100755
index 000000000..56fd83e9e
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_db_flush.py
@@ -0,0 +1,85 @@
+#!/usr/bin/env python3
+# Copyright (c) 2020 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+#
+# This test reproduces https://github.com/zcash/zcash/issues/4301
+# It takes an hour to run!
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    assert_equal,
+    bitcoind_processes,
+    initialize_chain_clean,
+    start_node,
+)
+import time
+
+class WalletDBFlush (BitcoinTestFramework):
+
+    def setup_chain(self):
+        print("Initializing test directory "+self.options.tmpdir)
+        initialize_chain_clean(self.options.tmpdir, 1)
+
+    def start_node_with(self, index, extra_args=[]):
+        args = [
+            "-nuparams=2bb40e60:1", # Blossom
+            "-nuparams=f5b9230b:2", # Heartwood
+            "-nurejectoldversions=false",
+        ]
+        return start_node(index, self.options.tmpdir, args + extra_args)
+
+    def setup_network(self, split=False):
+        self.nodes = []
+        self.nodes.append(self.start_node_with(0))
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test (self):
+        print("PLEASE NOTE: This test takes an hour to run!")
+
+        # This test requires shielded funds in the local wallet so
+        # there is witness data, and the easiest way to get shielded
+        # funds is to mine (since Heartwood, mining reward can go to
+        # a zaddr), so first create a Sapling address to mine to.
+        zaddr = self.nodes[0].z_getnewaddress('sapling')
+        self.nodes[0].generate(2)
+
+        self.nodes[0].stop()
+        bitcoind_processes[0].wait()
+
+        print("Start mining to address ", zaddr)
+        self.nodes[0] = self.start_node_with(0, [
+            "-mineraddress=%s" % zaddr,
+        ])
+        self.nodes[0].generate(1)
+        self.sync_all()
+        self.nodes[0].stop()
+        bitcoind_processes[0].wait()
+
+        # If you replace main.cpp:3129 DATABASE_WRITE_INTERVAL with
+        # 60 (seconds), then sleeptime here can be 80, and this test
+        # will fail (pre-PR) much faster.
+        sleeptime = 3620 # just over one hour (DATABASE_WRITE_INTERVAL)
+
+        print("Restart, sleep {}, mine (pre-PR will flush bad wallet state)".format(sleeptime))
+        self.nodes[0] = self.start_node_with(0, [
+            "-mineraddress=%s" % zaddr,
+        ])
+        assert_equal(self.nodes[0].z_getbalance(zaddr, 0), 5)
+        time.sleep(sleeptime)
+        self.nodes[0].generate(1)
+        self.sync_all()
+        self.nodes[0].stop()
+        bitcoind_processes[0].wait()
+
+        print("Restart, generate, expect assert in CopyPreviousWitnesses")
+        self.nodes[0] = self.start_node_with(0, [
+            "-mineraddress=%s" % zaddr,
+        ])
+        self.nodes[0].generate(1)
+        self.sync_all()
+        self.nodes[0].stop()
+
+if __name__ == '__main__':
+    WalletDBFlush().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_deprecation.py b/depend/zcash/qa/rpc-tests/wallet_deprecation.py
new file mode 100755
index 000000000..ee2c7842f
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_deprecation.py
@@ -0,0 +1,74 @@
+#!/usr/bin/env python3
+# Copyright (c) 2022 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    start_nodes,
+    stop_nodes,
+    wait_bitcoinds,
+)
+from test_framework.authproxy import JSONRPCException
+
+# Test wallet address behaviour across network upgrades
+class WalletDeprecationTest(BitcoinTestFramework):
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 1
+
+    def setup_network(self):
+        self.setup_network_internal([])
+
+    def setup_network_internal(self, allowed_deprecated = []):
+        dep_args = ["-allowdeprecated=" + v for v in allowed_deprecated]
+
+        self.nodes = start_nodes(
+            self.num_nodes, self.options.tmpdir,
+            extra_args=[dep_args] * self.num_nodes)
+
+    def run_test(self):
+        # z_getnewaddress is deprecated, but enabled by default so it should succeed
+        self.nodes[0].z_getnewaddress()
+
+        # zcrawkeygen is deprecated, and not enabled by default so it should fail
+        errorString = ''
+        try:
+            self.nodes[0].zcrawkeygen()
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert "DEPRECATED" in errorString
+
+        # restart with a specific selection of deprecated methods enabled
+        stop_nodes(self.nodes)
+        wait_bitcoinds()
+        self.setup_network_internal(["getnewaddress","zcrawkeygen"])
+
+        # z_getnewaddress is enabled by default, so it should succeed
+        self.nodes[0].z_getnewaddress()
+
+        # getnewaddress and zcrawkeygen are enabled so they should succeed.
+        self.nodes[0].getnewaddress()
+        self.nodes[0].zcrawkeygen()
+
+        # restart with no deprecated methods enabled
+        stop_nodes(self.nodes)
+        wait_bitcoinds()
+        self.setup_network_internal(["none"])
+
+        errorString = ''
+        try:
+            self.nodes[0].z_getnewaddress()
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert "DEPRECATED" in errorString
+
+        errorString = ''
+        try:
+            self.nodes[0].zcrawkeygen()
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert "DEPRECATED" in errorString
+
+if __name__ == '__main__':
+    WalletDeprecationTest().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_doublespend.py b/depend/zcash/qa/rpc-tests/wallet_doublespend.py
new file mode 100755
index 000000000..4654b58ed
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_doublespend.py
@@ -0,0 +1,162 @@
+#!/usr/bin/env python3
+# Copyright (c) 2022 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+import shutil
+import os.path
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    NU5_BRANCH_ID,
+    assert_equal,
+    get_coinbase_address,
+    nuparams,
+    start_nodes,
+    stop_nodes,
+    wait_bitcoinds,
+    wait_and_assert_operationid_status,
+)
+
+# Test wallet behaviour with the Orchard protocol
+class WalletDoubleSpendTest(BitcoinTestFramework):
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 4
+
+    def setup_nodes(self):
+        return start_nodes(self.num_nodes, self.options.tmpdir, [[
+            nuparams(NU5_BRANCH_ID, 201),
+        ]] * self.num_nodes)
+
+    def run_test_for_recipient_type(self, recipient_type):
+        # Get a couple of new accounts
+        acct0a = self.nodes[0].z_getnewaccount()['account']
+        ua0a = self.nodes[0].z_getaddressforaccount(acct0a, [recipient_type])['address']
+
+        acct0b = self.nodes[0].z_getnewaccount()['account']
+        ua0b = self.nodes[0].z_getaddressforaccount(acct0b, [recipient_type])['address']
+
+        # Get a new UA for account 1
+        acct1 = self.nodes[1].z_getnewaccount()['account']
+        addrRes1 = self.nodes[1].z_getaddressforaccount(acct1, [recipient_type])
+        ua1 = addrRes1['address']
+
+        # Create a note matching recipient_type on node 1
+        recipients = [{"address": ua1, "amount": 10}]
+        myopid = self.nodes[0].z_sendmany(get_coinbase_address(self.nodes[0]), recipients, 1, 0, 'AllowRevealedSenders')
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # Check the value sent to ua1 was received
+        assert_equal(
+                {'pools': {recipient_type: {'valueZat': 1000000000}}, 'minimum_confirmations': 1},
+                self.nodes[1].z_getbalanceforaccount(acct1))
+
+        # Shut down the nodes
+        stop_nodes(self.nodes)
+        wait_bitcoinds()
+
+        # Copy node 1's wallet to node 2
+        tmpdir = self.options.tmpdir
+        shutil.copyfile(
+                os.path.join(tmpdir, "node1", "regtest", "wallet.dat"), 
+                os.path.join(tmpdir, "node2", "regtest", "wallet.dat"))
+
+        # Restart with the network split
+        self.setup_network(True)
+
+        # Verify the balance on node 1
+        assert_equal(
+                {'pools': {recipient_type: {'valueZat': 1000000000}}, 'minimum_confirmations': 1},
+                self.nodes[1].z_getbalanceforaccount(acct1))
+
+        # Verify the balance on node 2, on the other side of the split
+        assert_equal(
+                {'pools': {recipient_type: {'valueZat': 1000000000}}, 'minimum_confirmations': 1},
+                self.nodes[2].z_getbalanceforaccount(acct1))
+
+        # Spend the note from node 1
+        recipients = [{"address": ua0a, "amount": 1}]
+        myopid = self.nodes[1].z_sendmany(ua1, recipients, 1, 0)
+        txa_id = wait_and_assert_operationid_status(self.nodes[1], myopid)
+
+        # Spend the note from node 2
+        recipients = [{"address": ua0b, "amount": 2}]
+        myopid = self.nodes[2].z_sendmany(ua1, recipients, 1, 0)
+        txb_id = wait_and_assert_operationid_status(self.nodes[2], myopid)
+
+        # Mine the conflicting notes in the split
+        self.sync_all()
+        self.nodes[0].generate(2)
+        self.nodes[3].generate(10)
+        self.sync_all()
+
+        # the remaining balance is visible on both sides of the split
+        assert_equal(
+                {'pools': {recipient_type: {'valueZat': 900000000}}, 'minimum_confirmations': 1},
+                self.nodes[1].z_getbalanceforaccount(acct1))
+
+        assert_equal(
+                {'pools': {recipient_type: {'valueZat': 800000000}}, 'minimum_confirmations': 1},
+                self.nodes[2].z_getbalanceforaccount(acct1))
+
+        # before re-joining the network, there is no recognition of the conflict
+        txa = self.nodes[1].gettransaction(txa_id)
+        txb = self.nodes[2].gettransaction(txb_id)
+        assert_equal(2, txa['confirmations']);
+        assert_equal(10, txb['confirmations']);
+        assert_equal([], txa['walletconflicts']);
+        assert_equal([], txb['walletconflicts']);
+
+        # acct0a will have received the transaction; it can't see node 2's send
+        assert_equal(
+                {'pools': {recipient_type: {'valueZat': 100000000}}, 'minimum_confirmations': 1},
+                self.nodes[0].z_getbalanceforaccount(acct0a))
+
+        self.join_network()
+
+        # after the network is re-joined, both transactions should be viewed as conflicted
+        txa = self.nodes[1].gettransaction(txa_id)
+        txb = self.nodes[1].gettransaction(txb_id)
+        assert_equal(-1, txa['confirmations']);
+        assert_equal(10, txb['confirmations']);
+        assert_equal([txb_id], txa['walletconflicts']);
+        assert_equal([txa_id], txb['walletconflicts']);
+
+        # After the reorg, node 2 wins, so its balance is the consensus for 
+        # both wallets
+        assert_equal(
+                {'pools': {recipient_type: {'valueZat': 800000000}}, 'minimum_confirmations': 1},
+                self.nodes[1].z_getbalanceforaccount(acct1))
+
+        assert_equal(
+                {'pools': {recipient_type: {'valueZat': 800000000}}, 'minimum_confirmations': 1},
+                self.nodes[2].z_getbalanceforaccount(acct1))
+
+        # acct0b will have received the transaction
+        assert_equal(
+                {'pools': {recipient_type: {'valueZat': 200000000}}, 'minimum_confirmations': 1},
+                self.nodes[0].z_getbalanceforaccount(acct0b))
+
+        # acct0a's note was un-mined
+        assert_equal(
+                {'pools': {}, 'minimum_confirmations': 1},
+                self.nodes[0].z_getbalanceforaccount(acct0a))
+
+    def run_test(self):
+        # Sanity-check the test harness
+        assert_equal(self.nodes[0].getblockcount(), 200)
+
+        # Activate NU5
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        self.run_test_for_recipient_type('sapling')
+        self.run_test_for_recipient_type('orchard')
+
+if __name__ == '__main__':
+    WalletDoubleSpendTest().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_import_export.py b/depend/zcash/qa/rpc-tests/wallet_import_export.py
new file mode 100755
index 000000000..b5d091ac3
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_import_export.py
@@ -0,0 +1,103 @@
+#!/usr/bin/env python3
+# Copyright (c) 2018 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.authproxy import JSONRPCException
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, assert_true, start_nodes
+
+class WalletImportExportTest (BitcoinTestFramework):
+    def setup_network(self, split=False):
+        num_nodes = 3
+        extra_args = [([
+            "-exportdir={}/export{}".format(self.options.tmpdir, i), 
+            ] + (["-walletrequirebackup"] if i == 0 else [])) for i in range(num_nodes)] 
+        self.nodes = start_nodes(num_nodes, self.options.tmpdir, extra_args)
+
+    def run_test(self):
+        sapling_address2 = self.nodes[2].z_getnewaddress('sapling')
+        privkey2 = self.nodes[2].z_exportkey(sapling_address2)
+        self.nodes[0].z_importkey(privkey2)
+
+        # test walletconfirmbackup
+        try:
+            self.nodes[0].getnewaddress()
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert_equal("Error: Please acknowledge that you have backed up" in errorString, True)
+        try:
+            self.nodes[0].z_getnewaddress('sapling')
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert_equal("Error: Please acknowledge that you have backed up" in errorString, True)
+        dump_path0 = self.nodes[0].z_exportwallet('walletdumpmnem')
+        (mnemonic, _, _, _) = parse_wallet_file(dump_path0)
+        self.nodes[0].walletconfirmbackup(mnemonic)
+
+        # Now that we've confirmed backup, we can generate addresses
+        sprout_address0 = self.nodes[0].z_getnewaddress('sprout')
+        sapling_address0 = self.nodes[0].z_getnewaddress('sapling')
+
+        # node 0 should have the keys
+        dump_path0 = self.nodes[0].z_exportwallet('walletdump')
+        (_, t_keys0, sprout_keys0, sapling_keys0) = parse_wallet_file(dump_path0)
+
+        sapling_line_lengths = [len(sapling_key0.split(' #')[0].split()) for sapling_key0 in sapling_keys0.splitlines()]
+        assert_equal(2, len(sapling_line_lengths), "Should have 2 sapling keys")
+        assert_true(2 in sapling_line_lengths, "Should have a key with 2 parameters")
+        assert_true(4 in sapling_line_lengths, "Should have a key with 4 parameters")
+
+        assert_true(sprout_address0 in sprout_keys0)
+        assert_true(sapling_address0 in sapling_keys0)
+        assert_true(sapling_address2 in sapling_keys0)
+
+        # node 1 should not have the keys
+        dump_path1 = self.nodes[1].z_exportwallet('walletdumpbefore')
+        (_, t_keys1, sprout_keys1, sapling_keys1) = parse_wallet_file(dump_path1)
+        
+        assert_true(sprout_address0 not in sprout_keys1)
+        assert_true(sapling_address0 not in sapling_keys1)
+
+        # import wallet to node 1
+        self.nodes[1].z_importwallet(dump_path0)
+
+        # node 1 should now have the keys
+        dump_path1 = self.nodes[1].z_exportwallet('walletdumpafter')
+        (_, t_keys1, sprout_keys1, sapling_keys1) = parse_wallet_file(dump_path1)
+        
+        assert_true(sprout_address0 in sprout_keys1)
+        assert_true(sapling_address0 in sapling_keys1)
+        assert_true(sapling_address2 in sapling_keys1)
+
+        # make sure we have preserved the metadata
+        for sapling_key0 in sapling_keys0.splitlines():
+            assert_true(sapling_key0 in sapling_keys1)
+
+# Helper functions
+def parse_wallet_file(dump_path):
+    file_lines = open(dump_path, "r", encoding="utf8").readlines()
+    # We expect information about the HDSeed and fingerpring in the header
+    assert_true("recovery_phrase" in file_lines[5], "Expected emergency recovery phrase")
+    assert_true("language" in file_lines[6], "Expected mnemonic seed language")
+    assert_true("fingerprint" in file_lines[7], "Expected mnemonic seed fingerprint")
+    mnemonic = file_lines[5].split("=")[1].replace("\"", "").strip()
+    (t_keys, i) = parse_wallet_file_lines(file_lines, 0)
+    (sprout_keys, i) = parse_wallet_file_lines(file_lines, i)
+    (sapling_keys, i) = parse_wallet_file_lines(file_lines, i)
+
+    return (mnemonic, t_keys, sprout_keys, sapling_keys)
+
+def parse_wallet_file_lines(file_lines, i):
+    keys = []
+    # skip blank lines and comments
+    while i < len(file_lines) and (file_lines[i] == '\n' or file_lines[i].startswith("#")):
+        i += 1
+    # add keys until we hit another blank line or comment
+    while  i < len(file_lines) and not (file_lines[i] == '\n' or file_lines[i].startswith("#")):
+        keys.append(file_lines[i])
+        i += 1
+    return ("".join(keys), i)
+
+if __name__ == '__main__':
+    WalletImportExportTest().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_isfromme.py b/depend/zcash/qa/rpc-tests/wallet_isfromme.py
new file mode 100755
index 000000000..aefef0677
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_isfromme.py
@@ -0,0 +1,93 @@
+#!/usr/bin/env python3
+# Copyright (c) 2021 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    BLOSSOM_BRANCH_ID,
+    CANOPY_BRANCH_ID,
+    HEARTWOOD_BRANCH_ID,
+    OVERWINTER_BRANCH_ID,
+    SAPLING_BRANCH_ID,
+    assert_equal,
+    get_coinbase_address,
+    initialize_chain_clean,
+    nuparams,
+    start_nodes,
+    wait_and_assert_operationid_status,
+)
+
+from decimal import Decimal
+
+class WalletIsFromMe(BitcoinTestFramework):
+    def setup_chain(self):
+        initialize_chain_clean(self.options.tmpdir, 1)
+
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(1, self.options.tmpdir, extra_args=[[
+            nuparams(OVERWINTER_BRANCH_ID, 1),
+            nuparams(SAPLING_BRANCH_ID, 1),
+            nuparams(BLOSSOM_BRANCH_ID, 1),
+            nuparams(HEARTWOOD_BRANCH_ID, 1),
+            nuparams(CANOPY_BRANCH_ID, 1),
+        ]])
+        self.is_network_split=False
+
+    def run_test (self):
+        node = self.nodes[0]
+
+        node.generate(101)
+        assert_equal(node.getbalance('', 0), Decimal('6.25'))
+
+        coinbase_addr = get_coinbase_address(node)
+
+        # Send all available funds to a z-address.
+        zaddr = node.z_getnewaddress()
+        wait_and_assert_operationid_status(
+            node,
+            node.z_sendmany(
+                coinbase_addr,
+                [
+                    {'address': zaddr, 'amount': Decimal('6.25')},
+                ],
+                0,
+                0,
+            ),
+        )
+        self.sync_all()
+        assert_equal(node.getbalance('', 0), 0)
+
+        # Mine the transaction; we get another coinbase output.
+        self.nodes[0].generate(1)
+        self.sync_all()
+        assert_equal(node.getbalance('', 0), Decimal('6.25'))
+
+        # Now send the funds back to a new t-address.
+        taddr = node.getnewaddress()
+        wait_and_assert_operationid_status(
+            node,
+            node.z_sendmany(
+                zaddr,
+                [
+                    {'address': taddr, 'amount': Decimal('6.25')},
+                ],
+                1,
+                0,
+            ),
+        )
+        self.sync_all()
+
+        # At this point we have created the conditions for the bug in
+        # https://github.com/zcash/zcash/issues/5325.
+
+        # listunspent should show the coinbase output, and optionally the
+        # newly-received unshielding output.
+        assert_equal(len(node.listunspent()), 1)
+        assert_equal(len(node.listunspent(0)), 2)
+
+        # "getbalance '' 0" should count both outputs. The bug failed here.
+        assert_equal(node.getbalance('', 0), Decimal('12.5'))
+
+if __name__ == '__main__':
+    WalletIsFromMe().main ()
diff --git a/depend/zcash/qa/rpc-tests/wallet_listnotes.py b/depend/zcash/qa/rpc-tests/wallet_listnotes.py
new file mode 100755
index 000000000..9e50376d6
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_listnotes.py
@@ -0,0 +1,221 @@
+#!/usr/bin/env python3
+# Copyright (c) 2018 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    NU5_BRANCH_ID,
+    assert_equal,
+    assert_true,
+    get_coinbase_address,
+    nuparams,
+    start_nodes,
+    wait_and_assert_operationid_status,
+    DEFAULT_FEE
+)
+
+from decimal import Decimal
+
+# Test wallet z_listunspent behaviour across network upgrades
+class WalletListNotes(BitcoinTestFramework):
+    def setup_nodes(self):
+        return start_nodes(4, self.options.tmpdir, [[
+            nuparams(NU5_BRANCH_ID, 215),
+        ]] * 4)
+
+    def run_test(self):
+        # Current height = 200 -> Sapling
+        assert_equal(200, self.nodes[0].getblockcount())
+        sproutzaddr = self.nodes[0].z_getnewaddress('sprout')
+
+        # we've got lots of coinbase (taddr) but no shielded funds yet
+        assert_equal(0, Decimal(self.nodes[0].z_gettotalbalance()['private']))
+
+        # Set current height to 201
+        self.nodes[0].generate(1)
+        self.sync_all()
+        assert_equal(201, self.nodes[0].getblockcount())
+
+        # Shield one coinbase output
+        receive_amount_1 = Decimal('10.0') - DEFAULT_FEE
+        result = self.nodes[0].z_shieldcoinbase('*', sproutzaddr, DEFAULT_FEE, 1)
+        txid_1 = wait_and_assert_operationid_status(self.nodes[0], result['opid'])
+        self.sync_all()
+
+        # No funds (with (default) one or more confirmations) in sproutzaddr yet
+        assert_equal(0, len(self.nodes[0].z_listunspent()))
+        assert_equal(0, len(self.nodes[0].z_listunspent(1)))
+
+        # no private balance because no confirmations yet
+        assert_equal(0, Decimal(self.nodes[0].z_gettotalbalance()['private']))
+
+        # list private unspent, this time allowing 0 confirmations
+        unspent_cb = self.nodes[0].z_listunspent(0)
+        assert_equal(1, len(unspent_cb))
+        assert_equal(False,             unspent_cb[0]['change'])
+        assert_equal(txid_1,            unspent_cb[0]['txid'])
+        assert_equal('sprout',          unspent_cb[0]['pool'])
+        assert_equal(True,              unspent_cb[0]['spendable'])
+        assert_equal(sproutzaddr,       unspent_cb[0]['address'])
+        assert_equal(receive_amount_1,  unspent_cb[0]['amount'])
+
+        # list unspent, filtering by address, should produce same result
+        unspent_cb_filter = self.nodes[0].z_listunspent(0, 9999, False, [sproutzaddr])
+        assert_equal(unspent_cb, unspent_cb_filter)
+
+        # Generate a block to confirm shield coinbase tx
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # Current height = 202
+        assert_equal(202, self.nodes[0].getblockcount())
+
+        # Send 1.0 minus default fee from sproutzaddr to a new Sapling zaddr
+        saplingzaddr = self.nodes[0].z_getnewaddress('sapling')
+        receive_amount_2 = Decimal('1.0')
+        change_amount_2 = receive_amount_1 - receive_amount_2 - DEFAULT_FEE
+        assert_equal('sapling', self.nodes[0].z_validateaddress(saplingzaddr)['type'])
+        recipients = [{"address": saplingzaddr, "amount":receive_amount_2}]
+        myopid = self.nodes[0].z_sendmany(sproutzaddr, recipients, 1, DEFAULT_FEE)
+        txid_2 = wait_and_assert_operationid_status(self.nodes[0], myopid)
+        self.sync_all()
+
+        # list unspent, allowing 0conf txs
+        unspent_tx = self.nodes[0].z_listunspent(0)
+        assert_equal(len(unspent_tx), 2)
+        # sort low-to-high by amount (order of returned entries is not guaranteed)
+        unspent_tx = sorted(unspent_tx, key=lambda k: k['amount'])
+        assert_equal(False,             unspent_tx[0]['change'])
+        assert_equal(txid_2,            unspent_tx[0]['txid'])
+        assert_equal('sapling',         unspent_tx[0]['pool'])
+        assert_equal(True,              unspent_tx[0]['spendable'])
+        assert_equal(saplingzaddr,      unspent_tx[0]['address'])
+        assert_equal(receive_amount_2,  unspent_tx[0]['amount'])
+
+        assert_equal(True,              unspent_tx[1]['change'])
+        assert_equal(txid_2,            unspent_tx[1]['txid'])
+        assert_equal('sprout',          unspent_tx[1]['pool'])
+        assert_equal(True,              unspent_tx[1]['spendable'])
+        assert_equal(sproutzaddr,       unspent_tx[1]['address'])
+        assert_equal(change_amount_2,   unspent_tx[1]['amount'])
+
+        unspent_tx_filter = self.nodes[0].z_listunspent(0, 9999, False, [saplingzaddr])
+        assert_equal(1, len(unspent_tx_filter))
+        assert_equal(unspent_tx[0], unspent_tx_filter[0])
+
+        unspent_tx_filter = self.nodes[0].z_listunspent(0, 9999, False, [sproutzaddr])
+        assert_equal(1, len(unspent_tx_filter))
+        assert_equal(unspent_tx[1], unspent_tx_filter[0])
+
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # Send 2.0 minus default fee to a new sapling zaddr
+        saplingzaddr2 = self.nodes[0].z_getnewaddress('sapling')
+        receive_amount_3 = Decimal('2.0')
+        change_amount_3 = change_amount_2 - receive_amount_3 - DEFAULT_FEE
+        recipients = [{"address": saplingzaddr2, "amount":receive_amount_3}]
+        myopid = self.nodes[0].z_sendmany(sproutzaddr, recipients, 1, DEFAULT_FEE)
+        txid_3 = wait_and_assert_operationid_status(self.nodes[0], myopid)
+        self.sync_all()
+        unspent_tx = self.nodes[0].z_listunspent(0)
+        assert_equal(3, len(unspent_tx))
+
+        # low-to-high in amount
+        unspent_tx = sorted(unspent_tx, key=lambda k: k['amount'])
+
+        assert_equal(False,             unspent_tx[0]['change'])
+        assert_equal(txid_2,            unspent_tx[0]['txid'])
+        assert_equal('sapling',         unspent_tx[0]['pool'])
+        assert_equal(True,              unspent_tx[0]['spendable'])
+        assert_equal(saplingzaddr,      unspent_tx[0]['address'])
+        assert_equal(receive_amount_2,  unspent_tx[0]['amount'])
+
+        assert_equal(False,             unspent_tx[1]['change'])
+        assert_equal(txid_3,            unspent_tx[1]['txid'])
+        assert_equal('sapling',         unspent_tx[1]['pool'])
+        assert_equal(True,              unspent_tx[1]['spendable'])
+        assert_equal(saplingzaddr2,     unspent_tx[1]['address'])
+        assert_equal(receive_amount_3,  unspent_tx[1]['amount'])
+
+        assert_equal(True,              unspent_tx[2]['change'])
+        assert_equal(txid_3,            unspent_tx[2]['txid'])
+        assert_equal('sprout',          unspent_tx[2]['pool'])
+        assert_equal(True,              unspent_tx[2]['spendable'])
+        assert_equal(sproutzaddr,       unspent_tx[2]['address'])
+        assert_equal(change_amount_3,   unspent_tx[2]['amount'])
+
+        unspent_tx_filter = self.nodes[0].z_listunspent(0, 9999, False, [saplingzaddr])
+        assert_equal(1, len(unspent_tx_filter))
+        assert_equal(unspent_tx[0], unspent_tx_filter[0])
+
+        # test that pre- and post-sapling can be filtered in a single call
+        unspent_tx_filter = self.nodes[0].z_listunspent(0, 9999, False,
+            [sproutzaddr, saplingzaddr])
+        assert_equal(2, len(unspent_tx_filter))
+        unspent_tx_filter = sorted(unspent_tx_filter, key=lambda k: k['amount'])
+        assert_equal(unspent_tx[0], unspent_tx_filter[0])
+        assert_equal(unspent_tx[2], unspent_tx_filter[1])
+
+        # so far, this node has no watchonly addresses, so results are the same
+        unspent_tx_watchonly = self.nodes[0].z_listunspent(0, 9999, True)
+        unspent_tx_watchonly = sorted(unspent_tx_watchonly, key=lambda k: k['amount'])
+        assert_equal(unspent_tx, unspent_tx_watchonly)
+
+        # TODO: use z_exportviewingkey, z_importviewingkey to test includeWatchonly
+        # but this requires Sapling support for those RPCs
+
+        # Set current height to 215 -> NU5
+        self.nodes[0].generate(12)
+        self.sync_all()
+        assert_equal(215, self.nodes[0].getblockcount())
+
+        # Create an Orchard note.
+        account0 = self.nodes[0].z_getnewaccount()['account']
+        ua0 = self.nodes[0].z_getaddressforaccount(account0)['address']
+        receive_amount_4 = Decimal('10.0')
+        recipients = [{"address": ua0, "amount": receive_amount_4}]
+        myopid = self.nodes[0].z_sendmany(get_coinbase_address(self.nodes[0]), recipients, 1, 0, 'AllowRevealedSenders')
+        txid_4 = wait_and_assert_operationid_status(self.nodes[0], myopid)
+        self.sync_all()
+
+        unspent_tx = self.nodes[0].z_listunspent(0)
+        assert_equal(4, len(unspent_tx))
+        # low-to-high in amount
+        unspent_tx = sorted(unspent_tx, key=lambda k: k['amount'])
+
+        assert_equal(False,             unspent_tx[0]['change'])
+        assert_equal(txid_2,            unspent_tx[0]['txid'])
+        assert_equal('sapling',         unspent_tx[0]['pool'])
+        assert_equal(True,              unspent_tx[0]['spendable'])
+        assert_true('account'    not in unspent_tx[0])
+        assert_equal(saplingzaddr,      unspent_tx[0]['address'])
+        assert_equal(receive_amount_2,  unspent_tx[0]['amount'])
+
+        assert_equal(False,             unspent_tx[1]['change'])
+        assert_equal(txid_3,            unspent_tx[1]['txid'])
+        assert_equal('sapling',         unspent_tx[1]['pool'])
+        assert_equal(True,              unspent_tx[1]['spendable'])
+        assert_true('account'    not in unspent_tx[1])
+        assert_equal(saplingzaddr2,     unspent_tx[1]['address'])
+        assert_equal(receive_amount_3,  unspent_tx[1]['amount'])
+
+        assert_equal(True,              unspent_tx[2]['change'])
+        assert_equal(txid_3,            unspent_tx[2]['txid'])
+        assert_equal('sprout',          unspent_tx[2]['pool'])
+        assert_equal(True,              unspent_tx[2]['spendable'])
+        assert_true('account'    not in unspent_tx[2])
+        assert_equal(sproutzaddr,       unspent_tx[2]['address'])
+        assert_equal(change_amount_3,   unspent_tx[2]['amount'])
+
+        assert_equal(False,             unspent_tx[3]['change'])
+        assert_equal(txid_4,            unspent_tx[3]['txid'])
+        assert_equal('orchard',         unspent_tx[3]['pool'])
+        assert_equal(True,              unspent_tx[3]['spendable'])
+        assert_equal(account0,          unspent_tx[3]['account'])
+        assert_equal(ua0,               unspent_tx[3]['address'])
+        assert_equal(receive_amount_4,  unspent_tx[3]['amount'])
+
+if __name__ == '__main__':
+    WalletListNotes().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_listreceived.py b/depend/zcash/qa/rpc-tests/wallet_listreceived.py
new file mode 100755
index 000000000..4df19ff50
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_listreceived.py
@@ -0,0 +1,553 @@
+#!/usr/bin/env python3
+# Copyright (c) 2018 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.authproxy import JSONRPCException
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    assert_equal,
+    assert_true,
+    assert_false,
+    assert_raises_message,
+    connect_nodes_bi,
+    get_coinbase_address,
+    nuparams,
+    DEFAULT_FEE,
+    DEFAULT_FEE_ZATS,
+    NU5_BRANCH_ID,
+)
+from test_framework.util import wait_and_assert_operationid_status, start_nodes
+from decimal import Decimal
+
+my_memo_str = 'c0ffee' # stay awake
+my_memo = '633066666565'
+my_memo = my_memo + '0'*(1024-len(my_memo))
+
+no_memo = 'f6' + ('0'*1022) # see section 5.5 of the protocol spec
+
+class ListReceivedTest (BitcoinTestFramework):
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 3
+        self.setup_clean_chain = True
+
+    def setup_network(self):
+        self.nodes = start_nodes(
+            self.num_nodes, self.options.tmpdir,
+            extra_args=[[
+                nuparams(NU5_BRANCH_ID, 225),
+            ]] * self.num_nodes
+            )
+        connect_nodes_bi(self.nodes, 0, 1)
+        connect_nodes_bi(self.nodes, 1, 2)
+        connect_nodes_bi(self.nodes, 0, 2)
+        self.is_network_split = False
+        self.sync_all()
+
+    def generate_and_sync(self, new_height):
+        current_height = self.nodes[0].getblockcount()
+        assert(new_height > current_height)
+        self.sync_all()
+        self.nodes[0].generate(new_height - current_height)
+        self.sync_all()
+        assert_equal(new_height, self.nodes[0].getblockcount())
+
+    def test_received_sprout(self, height):
+        self.generate_and_sync(height+2)
+
+        zaddr1 = self.nodes[1].z_getnewaddress('sprout')
+
+        # Send 10 ZEC each zaddr1 and zaddrExt via z_shieldcoinbase
+        result = self.nodes[0].z_shieldcoinbase(get_coinbase_address(self.nodes[0]), zaddr1, 0, 1)
+        txid_shielding1 = wait_and_assert_operationid_status(self.nodes[0], result['opid'])
+
+        zaddrExt = self.nodes[2].z_getnewaddress('sprout')
+        result = self.nodes[0].z_shieldcoinbase(get_coinbase_address(self.nodes[0]), zaddrExt, 0, 1)
+        txid_shieldingExt = wait_and_assert_operationid_status(self.nodes[0], result['opid'])
+
+        self.sync_all()
+
+        # Decrypted transaction details should not be visible on node 0
+        pt = self.nodes[0].z_viewtransaction(txid_shielding1)
+        assert_equal(pt['txid'], txid_shielding1)
+        assert_equal(len(pt['spends']), 0)
+        assert_equal(len(pt['outputs']), 0)
+
+        # Decrypted transaction details should be correct on node 1
+        pt = self.nodes[1].z_viewtransaction(txid_shielding1)
+        assert_equal(pt['txid'], txid_shielding1)
+        assert_equal(len(pt['spends']), 0)
+        assert_equal(len(pt['outputs']), 1)
+        assert_equal(pt['outputs'][0]['type'], 'sprout')
+        assert_equal(pt['outputs'][0]['js'], 0)
+        assert_equal(pt['outputs'][0]['address'], zaddr1)
+        assert_equal(pt['outputs'][0]['value'], Decimal('10'))
+        assert_equal(pt['outputs'][0]['valueZat'], 1000000000)
+        assert_equal(pt['outputs'][0]['memo'], no_memo)
+        jsOutputPrev = pt['outputs'][0]['jsOutput']
+
+        # Second transaction should not be known to node 1
+        assert_raises_message(
+            JSONRPCException,
+            "Invalid or non-wallet transaction id",
+            self.nodes[1].z_viewtransaction,
+            txid_shieldingExt)
+
+        # Second transaction should be visible on node0
+        pt = self.nodes[2].z_viewtransaction(txid_shieldingExt)
+        assert_equal(pt['txid'], txid_shieldingExt)
+        assert_equal(len(pt['spends']), 0)
+        assert_equal(len(pt['outputs']), 1)
+        assert_equal(pt['outputs'][0]['type'], 'sprout')
+        assert_equal(pt['outputs'][0]['js'], 0)
+        assert_equal(pt['outputs'][0]['address'], zaddrExt)
+        assert_equal(pt['outputs'][0]['value'], Decimal('10'))
+        assert_equal(pt['outputs'][0]['valueZat'], 1000000000)
+        assert_equal(pt['outputs'][0]['memo'], no_memo)
+
+        r = self.nodes[1].z_listreceivedbyaddress(zaddr1)
+        assert_equal(0, len(r), "Should have received no confirmed note")
+        c = self.nodes[1].z_getnotescount()
+        assert_equal(0, c['sprout'], "Count of confirmed notes should be 0")
+
+        # No confirmation required, one note should be present
+        r = self.nodes[1].z_listreceivedbyaddress(zaddr1, 0)
+        assert_equal(1, len(r), "Should have received one (unconfirmed) note")
+        assert_equal(txid_shielding1, r[0]['txid'])
+        assert_equal(10, r[0]['amount'])
+        assert_equal(1000000000, r[0]['amountZat'])
+        assert_false(r[0]['change'], "Note should not be change")
+        assert_equal(no_memo, r[0]['memo'])
+        assert_equal(0, r[0]['confirmations'])
+        assert_equal(-1, r[0]['blockindex'])
+        assert_equal(0, r[0]['blockheight'])
+
+        c = self.nodes[1].z_getnotescount(0)
+        assert_equal(1, c['sprout'], "Count of unconfirmed notes should be 1")
+
+        # Confirm transaction (10 ZEC shielded)
+        self.generate_and_sync(height+3)
+
+        # Require one confirmation, note should be present
+        r0 = self.nodes[1].z_listreceivedbyaddress(zaddr1)
+        assert_equal(1, len(r0), "Should have received one (unconfirmed) note")
+        assert_equal(txid_shielding1, r0[0]['txid'])
+        assert_equal(10, r0[0]['amount'])
+        assert_equal(1000000000, r0[0]['amountZat'])
+        assert_false(r0[0]['change'], "Note should not be change")
+        assert_equal(no_memo, r0[0]['memo'])
+        assert_equal(1, r0[0]['confirmations'])
+        assert_equal(height + 3, r0[0]['blockheight'])
+
+        taddr = self.nodes[1].getnewaddress()
+        # Generate some change by sending part of zaddr1 back to taddr
+        opid = self.nodes[1].z_sendmany(zaddr1, [{'address': taddr, 'amount': 0.6}], 1)
+        txid = wait_and_assert_operationid_status(self.nodes[1], opid)
+
+        self.generate_and_sync(height+4)
+
+        # Decrypted transaction details should be correct
+        pt = self.nodes[1].z_viewtransaction(txid)
+        assert_equal(pt['txid'], txid)
+        assert_equal(len(pt['spends']), 1)
+        # TODO: enable once z_viewtransaction displays transparent elements
+        # assert_equal(len(pt['outputs']), 2)
+        assert_equal(len(pt['outputs']), 1)
+
+        assert_equal(pt['spends'][0]['type'], 'sprout')
+        assert_equal(pt['spends'][0]['txidPrev'], txid_shielding1)
+        assert_equal(pt['spends'][0]['js'], 0)
+        assert_equal(pt['spends'][0]['jsPrev'], 0)
+        assert_equal(pt['spends'][0]['jsOutputPrev'], jsOutputPrev)
+        assert_equal(pt['spends'][0]['address'], zaddr1)
+        assert_equal(pt['spends'][0]['value'], Decimal('10.0'))
+        assert_equal(pt['spends'][0]['valueZat'], 1000000000)
+
+        # We expect a transparent output and a Sprout output, but the RPC does
+        # not define any particular ordering of these within the returned JSON.
+        outputs = [{
+            'type': output['type'],
+            'address': output['address'],
+            'value': output['value'],
+            'valueZat': output['valueZat'],
+        } for output in pt['outputs']]
+        for (i, output) in enumerate(pt['outputs']):
+            if 'memo' in output:
+                outputs[i]['memo'] = output['memo']
+
+        # TODO: enable once z_viewtransaction displays transparent elements
+        # assert({
+        #     'type': 'transparent',
+        #     'address': taddr,
+        #     'value': Decimal('0.6'),
+        #     'valueZat': 60000000,
+        # } in outputs)
+        assert({
+            'type': 'sprout',
+            'address': zaddr1,
+            'value': Decimal('9.4') - DEFAULT_FEE,
+            'valueZat': 940000000 - DEFAULT_FEE_ZATS,
+            'memo': no_memo,
+        } in outputs)
+
+        # zaddr1 should have a note with change
+        r = self.nodes[1].z_listreceivedbyaddress(zaddr1, 0)
+        assert_equal(2, len(r), "zaddr1 Should have received 2 notes")
+        r = sorted(r, key = lambda received: received['amount'])
+        assert_equal(txid, r[0]['txid'])
+        assert_equal(Decimal('9.4')-DEFAULT_FEE, r[0]['amount'])
+        assert_equal(940000000-DEFAULT_FEE_ZATS, r[0]['amountZat'])
+        assert_true(r[0]['change'], "Note valued at (9.4-"+str(DEFAULT_FEE)+") should be change")
+        assert_equal(no_memo, r[0]['memo'])
+
+        # The old note still exists (it's immutable), even though it is spent
+        assert_equal(Decimal('10.0'), r[1]['amount'])
+        assert_equal(1000000000, r[1]['amountZat'])
+        assert_false(r[1]['change'], "Note valued at 10.0 should not be change")
+        assert_equal(no_memo, r[1]['memo'])
+
+    def test_received_sapling(self, height):
+        self.generate_and_sync(height+1)
+        taddr = self.nodes[1].getnewaddress()
+        zaddr1 = self.nodes[1].z_getnewaddress('sapling')
+        zaddrExt = self.nodes[2].z_getnewaddress('sapling')
+
+        txid_taddr = self.nodes[0].sendtoaddress(taddr, 4.0)
+        self.generate_and_sync(height+2)
+
+        # Send 1 ZEC to zaddr1
+        opid = self.nodes[1].z_sendmany(taddr, [
+            {'address': zaddr1, 'amount': 1, 'memo': my_memo},
+            {'address': zaddrExt, 'amount': 2},
+        ], 1)
+        txid = wait_and_assert_operationid_status(self.nodes[1], opid)
+        self.sync_all()
+
+        # Decrypted transaction details should be correct
+        pt = self.nodes[1].z_viewtransaction(txid)
+
+        assert_equal(pt['txid'], txid)
+        assert_equal(len(pt['spends']), 0)
+        assert_equal(len(pt['outputs']), 2)
+
+        # Outputs are not returned in a defined order but the amounts are deterministic
+        outputs = sorted(pt['outputs'], key=lambda x: x['valueZat'])
+        assert_equal(outputs[0]['type'], 'sapling')
+        assert_equal(outputs[0]['address'], zaddr1)
+        assert_equal(outputs[0]['value'], Decimal('1'))
+        assert_equal(outputs[0]['valueZat'], 100000000)
+        assert_equal(outputs[0]['output'], 0)
+        assert_equal(outputs[0]['outgoing'], False)
+        assert_equal(outputs[0]['memo'], my_memo)
+        assert_equal(outputs[0]['memoStr'], my_memo_str)
+
+        assert_equal(outputs[1]['type'], 'sapling')
+        assert_equal(outputs[1]['address'], zaddrExt)
+        assert_equal(outputs[1]['value'], Decimal('2'))
+        assert_equal(outputs[1]['valueZat'], 200000000)
+        assert_equal(outputs[1]['output'], 1)
+        assert_equal(outputs[1]['outgoing'], True)
+        assert_equal(outputs[1]['memo'], no_memo)
+        assert 'memoStr' not in outputs[1]
+
+        r = self.nodes[1].z_listreceivedbyaddress(zaddr1)
+        assert_equal(0, len(r), "Should have received no confirmed note")
+        c = self.nodes[1].z_getnotescount()
+        assert_equal(0, c['sapling'], "Count of confirmed notes should be 0")
+
+        # No confirmation required, one note should be present
+        r = self.nodes[1].z_listreceivedbyaddress(zaddr1, 0)
+        assert_equal(1, len(r), "Should have received one (unconfirmed) note")
+        assert_equal(txid, r[0]['txid'])
+        assert_equal(1, r[0]['amount'])
+        assert_equal(100000000, r[0]['amountZat'])
+        assert_false(r[0]['change'], "Note should not be change")
+        assert_equal(my_memo, r[0]['memo'])
+        assert_equal(0, r[0]['confirmations'])
+        assert_equal(-1, r[0]['blockindex'])
+        assert_equal(0, r[0]['blockheight'])
+
+        c = self.nodes[1].z_getnotescount(0)
+        assert_equal(1, c['sapling'], "Count of unconfirmed notes should be 1")
+
+        # Confirm transaction (1 ZEC from taddr to zaddr1)
+        self.generate_and_sync(height+3)
+
+        # adjust confirmations
+        r[0]['confirmations'] = 1
+        # adjust blockindex
+        r[0]['blockindex'] = 1
+        # adjust height
+        r[0]['blockheight'] = height + 3
+
+        # Require one confirmation, note should be present
+        assert_equal(r, self.nodes[1].z_listreceivedbyaddress(zaddr1))
+
+        # Generate some change by sending part of zaddr1 to zaddr2
+        txidPrev = txid
+        zaddr2 = self.nodes[1].z_getnewaddress('sapling')
+        opid = self.nodes[1].z_sendmany(zaddr1, [{'address': zaddr2, 'amount': 0.6}], 1)
+        txid = wait_and_assert_operationid_status(self.nodes[1], opid)
+        self.sync_all()
+        self.generate_and_sync(height+4)
+
+        # Decrypted transaction details should be correct
+        pt = self.nodes[1].z_viewtransaction(txid)
+        assert_equal(pt['txid'], txid)
+        assert_equal(len(pt['spends']), 1)
+        assert_equal(len(pt['outputs']), 2)
+
+        assert_equal(pt['spends'][0]['type'], 'sapling')
+        assert_equal(pt['spends'][0]['txidPrev'], txidPrev)
+        assert_equal(pt['spends'][0]['spend'], 0)
+        assert_equal(pt['spends'][0]['outputPrev'], 0)
+        assert_equal(pt['spends'][0]['address'], zaddr1)
+        assert_equal(pt['spends'][0]['value'], Decimal('1.0'))
+        assert_equal(pt['spends'][0]['valueZat'], 100000000)
+
+        # Outputs are not returned in a defined order but the amounts are deterministic
+        outputs = sorted(pt['outputs'], key=lambda x: x['valueZat'])
+        assert_equal(outputs[0]['type'], 'sapling')
+        assert_equal(outputs[0]['address'], zaddr1)
+        assert_equal(outputs[0]['value'], Decimal('0.4') - DEFAULT_FEE)
+        assert_equal(outputs[0]['valueZat'], 40000000 - DEFAULT_FEE_ZATS)
+        assert_equal(outputs[0]['output'], 1)
+        assert_equal(outputs[0]['outgoing'], False)
+        assert_equal(outputs[0]['memo'], no_memo)
+        assert 'memoStr' not in outputs[0]
+
+        assert_equal(outputs[1]['type'], 'sapling')
+        assert_equal(outputs[1]['address'], zaddr2)
+        assert_equal(outputs[1]['value'], Decimal('0.6'))
+        assert_equal(outputs[1]['valueZat'], 60000000)
+        assert_equal(outputs[1]['output'], 0)
+        assert_equal(outputs[1]['outgoing'], False)
+        assert_equal(outputs[1]['memo'], no_memo)
+        assert 'memoStr' not in outputs[1]
+
+        # zaddr1 should have a note with change
+        r = self.nodes[1].z_listreceivedbyaddress(zaddr1, 0)
+        assert_equal(2, len(r), "zaddr1 Should have received 2 notes")
+        r = sorted(r, key = lambda received: received['amount'])
+        assert_equal(txid, r[0]['txid'])
+        assert_equal(Decimal('0.4')-DEFAULT_FEE, r[0]['amount'])
+        assert_equal(40000000-DEFAULT_FEE_ZATS, r[0]['amountZat'])
+        assert_equal(r[0]['change'], True, "Note valued at (0.4-"+str(DEFAULT_FEE)+") should be change")
+        assert_equal(no_memo, r[0]['memo'])
+
+        # The old note still exists (it's immutable), even though it is spent
+        assert_equal(Decimal('1.0'), r[1]['amount'])
+        assert_equal(100000000, r[1]['amountZat'])
+        assert_equal(r[1]['change'], False, "Note valued at 1.0 should not be change")
+        assert_equal(my_memo, r[1]['memo'])
+
+        # zaddr2 should not have change
+        r = self.nodes[1].z_listreceivedbyaddress(zaddr2, 0)
+        assert_equal(len(r), 1, "zaddr2 Should have received 1 notes")
+        r = sorted(r, key = lambda received: received['amount'])
+        assert_equal(r[0]['txid'], txid)
+        assert_equal(r[0]['amount'], Decimal('0.6'))
+        assert_equal(r[0]['amountZat'], 60000000)
+        assert_equal(r[0]['change'], False, "Note valued at 0.6 should not be change")
+        assert_equal(r[0]['memo'], no_memo)
+        assert 0 <= r[0]['outindex'] < 2
+
+        c = self.nodes[1].z_getnotescount(0)
+        assert_equal(c['sapling'], 3, "Count of unconfirmed notes should be 3(2 in zaddr1 + 1 in zaddr2)")
+
+        # As part of UA support, a transparent address is now accepted
+        r = self.nodes[1].z_listreceivedbyaddress(taddr, 0)
+        assert_equal(len(r), 1)
+        assert_equal(r[0]['pool'], 'transparent')
+        assert_equal(r[0]['txid'], txid_taddr)
+        assert_equal(r[0]['amount'], Decimal('4'))
+        assert_equal(r[0]['amountZat'], 400000000)
+        assert_equal(r[0]['confirmations'], 3)
+        assert 0 <= r[0]['outindex'] < 2
+
+        # Test unified address
+        node = self.nodes[1]
+
+        # Create a unified address on one node, try z_listreceivedbyaddress on another node
+        account = self.nodes[0].z_getnewaccount()['account']
+        r = self.nodes[0].z_getaddressforaccount(account)
+        unified_addr = r['address']
+        # this address isn't in node1's wallet
+        assert_raises_message(
+            JSONRPCException,
+            "From address does not belong to this node",
+            node.z_listreceivedbyaddress, unified_addr, 0)
+
+        # create a UA on node1
+        r = node.z_getnewaccount()
+        account = r['account']
+        r = node.z_getaddressforaccount(account)
+        unified_addr = r['address']
+        receivers = node.z_listunifiedreceivers(unified_addr)
+        assert_equal(len(receivers), 3)
+        assert 'p2pkh' in receivers
+        assert 'sapling' in receivers
+        assert 'orchard' in receivers
+        assert_raises_message(
+            JSONRPCException,
+            "The provided address is a bare receiver from a Unified Address in this wallet.",
+            node.z_listreceivedbyaddress, receivers['p2pkh'], 0)
+        assert_raises_message(
+            JSONRPCException,
+            "The provided address is a bare receiver from a Unified Address in this wallet.",
+            node.z_listreceivedbyaddress, receivers['sapling'], 0)
+
+        # Wallet contains no notes
+        r = node.z_listreceivedbyaddress(unified_addr, 0)
+        assert_equal(len(r), 0, "unified_addr should have received zero notes")
+
+        # Create a note in this UA on node1
+        opid = node.z_sendmany(zaddr1, [{'address': unified_addr, 'amount': 0.1}], 1)
+        txid_sapling = wait_and_assert_operationid_status(node, opid)
+        self.generate_and_sync(height+5)
+
+        # Create a UTXO that unified_address's transparent component references, on node1
+        outputs = {receivers['p2pkh']: 0.2}
+        txid_taddr = node.sendmany("", outputs)
+
+        r = node.z_listreceivedbyaddress(unified_addr, 0)
+        assert_equal(len(r), 2, "unified_addr should have received 2 payments")
+        # The return list order isn't defined, so sort by pool name
+        r = sorted(r, key=lambda x: x['pool'])
+        assert_equal(r[0]['pool'], 'sapling')
+        assert_equal(r[0]['txid'], txid_sapling)
+        assert_equal(r[0]['amount'], Decimal('0.1'))
+        assert_equal(r[0]['amountZat'], 10000000)
+        assert_equal(r[0]['memo'], no_memo)
+        assert 0 <= r[0]['outindex'] < 2
+        assert_equal(r[0]['confirmations'], 1)
+        assert_equal(r[0]['change'], False)
+        assert_equal(r[0]['blockheight'], height+5)
+        assert_equal(r[0]['blockindex'], 1)
+        assert 'blocktime' in r[0]
+
+        assert_equal(r[1]['pool'], 'transparent')
+        assert_equal(r[1]['txid'], txid_taddr)
+        assert_equal(r[1]['amount'], Decimal('0.2'))
+        assert_equal(r[1]['amountZat'], 20000000)
+        assert 0 <= r[1]['outindex'] < 2
+        assert_equal(r[1]['confirmations'], 0)
+        assert_equal(r[1]['change'], False)
+        assert 'memo' not in r[1]
+        assert_equal(r[1]['blockheight'], 0) # not yet mined
+        assert_equal(r[1]['blockindex'], -1) # not yet mined
+        assert 'blocktime' in r[1]
+
+    def test_received_orchard(self, height):
+        self.generate_and_sync(height+1)
+        taddr = self.nodes[1].getnewaddress()
+        acct1 = self.nodes[1].z_getnewaccount()['account']
+        acct2 = self.nodes[1].z_getnewaccount()['account']
+
+        addrResO = self.nodes[1].z_getaddressforaccount(acct1, ['orchard'])
+        assert_equal(addrResO['receiver_types'], ['orchard'])
+        uao = addrResO['address']
+
+        addrResSO = self.nodes[1].z_getaddressforaccount(acct2, ['sapling', 'orchard'])
+        assert_equal(addrResSO['receiver_types'], ['sapling', 'orchard'])
+        uaso = addrResSO['address']
+
+        self.nodes[0].sendtoaddress(taddr, 4.0)
+        self.generate_and_sync(height+2)
+
+        acct_node0 = self.nodes[0].z_getnewaccount()['account']
+        ua_node0 = self.nodes[0].z_getaddressforaccount(acct_node0, ['sapling', 'orchard'])['address']
+
+        opid = self.nodes[1].z_sendmany(taddr, [
+            {'address': uao, 'amount': 1, 'memo': my_memo},
+            {'address': uaso, 'amount': 2},
+        ], 1, 0, 'AllowRevealedSenders')
+        txid0 = wait_and_assert_operationid_status(self.nodes[1], opid)
+        self.sync_all()
+
+        # Decrypted transaction details should be correct, even though
+        # the transaction is still just in the mempool
+        pt = self.nodes[1].z_viewtransaction(txid0)
+
+        assert_equal(pt['txid'], txid0)
+        assert_equal(len(pt['spends']), 0)
+        assert_equal(len(pt['outputs']), 2)
+
+        # Outputs are not returned in a defined order but the amounts are deterministic
+        outputs = sorted(pt['outputs'], key=lambda x: x['valueZat'])
+        assert_equal(outputs[0]['type'], 'orchard')
+        assert_equal(outputs[0]['address'], uao)
+        assert_equal(outputs[0]['value'], Decimal('1'))
+        assert_equal(outputs[0]['valueZat'], 100000000)
+        assert_equal(outputs[0]['outgoing'], False)
+        assert_equal(outputs[0]['memo'], my_memo)
+        assert_equal(outputs[0]['memoStr'], my_memo_str)
+        actionToSpend = outputs[0]['action']
+
+        assert_equal(outputs[1]['type'], 'orchard')
+        assert_equal(outputs[1]['address'], uaso)
+        assert_equal(outputs[1]['value'], Decimal('2'))
+        assert_equal(outputs[1]['valueZat'], 200000000)
+        assert_equal(outputs[1]['outgoing'], False)
+        assert_equal(outputs[1]['memo'], no_memo)
+        assert 'memoStr' not in outputs[1]
+
+        self.generate_and_sync(height+3)
+
+        opid = self.nodes[1].z_sendmany(uao, [
+            {'address': uaso, 'amount': Decimal('0.3')},
+            {'address': ua_node0, 'amount': Decimal('0.2')}
+        ], 1)
+        txid1 = wait_and_assert_operationid_status(self.nodes[1], opid)
+        self.sync_all()
+
+        pt = self.nodes[1].z_viewtransaction(txid1)
+
+        assert_equal(pt['txid'], txid1)
+        assert_equal(len(pt['spends']), 1) # one spend we can see
+        assert_equal(len(pt['outputs']), 3) # one output + one change output we can see
+
+        spends = pt['spends']
+        assert_equal(spends[0]['type'], 'orchard')
+        assert_equal(spends[0]['txidPrev'], txid0)
+        assert_equal(spends[0]['actionPrev'], actionToSpend)
+        assert_equal(spends[0]['address'], uao)
+        assert_equal(spends[0]['value'], Decimal('1.0'))
+        assert_equal(spends[0]['valueZat'], 100000000)
+
+        outputs = sorted(pt['outputs'], key=lambda x: x['valueZat'])
+        assert_equal(outputs[0]['type'], 'orchard')
+        assert_equal(outputs[0]['address'], ua_node0)
+        assert_equal(outputs[0]['value'], Decimal('0.2'))
+        assert_equal(outputs[0]['valueZat'], 20000000)
+        assert_equal(outputs[0]['outgoing'], True)
+        assert_equal(outputs[0]['walletInternal'], False)
+        assert_equal(outputs[0]['memo'], no_memo)
+
+        assert_equal(outputs[1]['type'], 'orchard')
+        assert_equal(outputs[1]['address'], uaso)
+        assert_equal(outputs[1]['value'], Decimal('0.3'))
+        assert_equal(outputs[1]['valueZat'], 30000000)
+        assert_equal(outputs[1]['outgoing'], False)
+        assert_equal(outputs[1]['walletInternal'], False)
+        assert_equal(outputs[1]['memo'], no_memo)
+
+        # Verify that we observe the change output
+        assert_equal(outputs[2]['type'], 'orchard')
+        assert_equal(outputs[2]['value'], Decimal('0.49999'))
+        assert_equal(outputs[2]['valueZat'], 49999000)
+        assert_equal(outputs[2]['outgoing'], False)
+        assert_equal(outputs[2]['walletInternal'], True)
+        assert_equal(outputs[2]['memo'], no_memo)
+        # The change address should have been erased
+        assert_true('address' not in outputs[2])
+
+    def run_test(self):
+        self.test_received_sprout(200)
+        self.test_received_sapling(214)
+        self.test_received_orchard(230)
+
+
+if __name__ == '__main__':
+    ListReceivedTest().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_nullifiers.py b/depend/zcash/qa/rpc-tests/wallet_nullifiers.py
new file mode 100755
index 000000000..e9dc49b1e
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_nullifiers.py
@@ -0,0 +1,171 @@
+#!/usr/bin/env python3
+# Copyright (c) 2016 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, assert_true, bitcoind_processes, \
+    connect_nodes_bi, start_node, start_nodes, wait_and_assert_operationid_status, \
+    get_coinbase_address, DEFAULT_FEE
+
+from decimal import Decimal
+
+class WalletNullifiersTest (BitcoinTestFramework):
+
+    def setup_nodes(self):
+        return start_nodes(self.num_nodes, self.options.tmpdir,
+                           extra_args=[['-experimentalfeatures', '-developerencryptwallet']] * self.num_nodes)
+
+    def run_test (self):
+        # add zaddr to node 0
+        myzaddr0 = self.nodes[0].z_getnewaddress()
+
+        # send node 0 taddr to zaddr to get out of coinbase
+        # Tests using the default cached chain have one address per coinbase output
+        mytaddr = get_coinbase_address(self.nodes[0])
+        recipients = []
+        recipients.append({"address": myzaddr0, "amount": Decimal('10.0') - DEFAULT_FEE}) # utxo amount less fee
+
+        wait_and_assert_operationid_status(self.nodes[0], self.nodes[0].z_sendmany(mytaddr, recipients), timeout=120)
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # add zaddr to node 2
+        myzaddr = self.nodes[2].z_getnewaddress()
+
+        # import node 2 zaddr into node 1
+        myzkey = self.nodes[2].z_exportkey(myzaddr)
+        self.nodes[1].z_importkey(myzkey)
+
+        # encrypt node 1 wallet and wait to terminate
+        self.nodes[1].encryptwallet("test")
+        bitcoind_processes[1].wait()
+
+        # restart node 1
+        self.nodes[1] = start_node(1, self.options.tmpdir)
+        connect_nodes_bi(self.nodes, 0, 1)
+        connect_nodes_bi(self.nodes, 1, 2)
+        self.sync_all()
+
+        # send node 0 zaddr to note 2 zaddr
+        recipients = []
+        recipients.append({"address":myzaddr, "amount":7.0})
+
+        wait_and_assert_operationid_status(self.nodes[0], self.nodes[0].z_sendmany(myzaddr0, recipients, 1), timeout=120)
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # check zaddr balance
+        zsendmanynotevalue = Decimal('7.0')
+        assert_equal(self.nodes[2].z_getbalance(myzaddr), zsendmanynotevalue)
+        assert_equal(self.nodes[1].z_getbalance(myzaddr), zsendmanynotevalue)
+
+        # add zaddr to node 3
+        myzaddr3 = self.nodes[3].z_getnewaddress()
+
+        # send node 2 zaddr to note 3 zaddr
+        recipients = []
+        recipients.append({"address":myzaddr3, "amount":2.0})
+
+        wait_and_assert_operationid_status(self.nodes[2], self.nodes[2].z_sendmany(myzaddr, recipients, 1), timeout=120)
+
+        self.sync_all()
+        self.nodes[2].generate(1)
+        self.sync_all()
+
+        # check zaddr balance
+        zsendmany2notevalue = Decimal('2.0')
+        zsendmanyfee = DEFAULT_FEE
+        zaddrremaining = zsendmanynotevalue - zsendmany2notevalue - zsendmanyfee
+        assert_equal(self.nodes[3].z_getbalance(myzaddr3), zsendmany2notevalue)
+        assert_equal(self.nodes[2].z_getbalance(myzaddr), zaddrremaining)
+
+        # Parallel encrypted wallet can cache nullifiers for Sapling received notes
+        assert_equal(self.nodes[1].z_getbalance(myzaddr), zaddrremaining)
+
+        # send node 2 zaddr on node 1 to taddr
+        self.nodes[1].walletpassphrase("test", 600)
+        mytaddr1 = self.nodes[1].getnewaddress()
+        recipients = []
+        recipients.append({"address":mytaddr1, "amount":1.0})
+
+        wait_and_assert_operationid_status(self.nodes[1], self.nodes[1].z_sendmany(myzaddr, recipients, 1), timeout=120)
+
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        # check zaddr balance
+        zsendmany3notevalue = Decimal('1.0')
+        zaddrremaining2 = zaddrremaining - zsendmany3notevalue - zsendmanyfee
+        assert_equal(self.nodes[1].z_getbalance(myzaddr), zaddrremaining2)
+        assert_equal(self.nodes[2].z_getbalance(myzaddr), zaddrremaining2)
+
+        # Test viewing keys
+
+        node3mined = Decimal('250.0')
+        assert_equal({k: Decimal(v) for k, v in self.nodes[3].z_gettotalbalance().items()}, {
+            'transparent': node3mined,
+            'private': zsendmany2notevalue,
+            'total': node3mined + zsendmany2notevalue,
+        })
+
+        # Add node 1 address and node 2 viewing key to node 3
+        myzvkey = self.nodes[2].z_exportviewingkey(myzaddr)
+        self.nodes[3].importaddress(mytaddr1)
+        importvk_result = self.nodes[3].z_importviewingkey(myzvkey, 'whenkeyisnew', 1)
+
+        # Check results of z_importviewingkey
+        assert_equal(importvk_result["type"], "sapling")
+        assert_equal(importvk_result["address"], myzaddr)
+
+        # Check the address has been imported
+        assert_equal(myzaddr in self.nodes[3].z_listaddresses(), False)
+        assert_equal(myzaddr in self.nodes[3].z_listaddresses(True), True)
+
+        # Node 3 should see the same received notes as node 2; however, there are 2 things:
+        # - Some of the notes were change for node 2 but not for node 3.
+        # - Each node wallet store transaction time as received. As
+        #   `wait_and_assert_operationid_status` is called node 2 and 3 are off by a few seconds.
+        # Aside from that the received notes should be the same. So,
+        # group by txid and then check that all properties aside from
+        # change are equal.
+        node2Received = dict([r['txid'], r] for r in self.nodes[2].z_listreceivedbyaddress(myzaddr))
+        node3Received = dict([r['txid'], r] for r in self.nodes[3].z_listreceivedbyaddress(myzaddr))
+        assert_equal(len(node2Received), len(node2Received))
+        for txid in node2Received:
+            received2 = node2Received[txid]
+            received3 = node3Received[txid]
+            # the change field will be omitted for received3, but all other fields should be shared
+            assert_true(len(received2) >= len(received3))
+            for key in received2:
+                # check all the properties except for change and blocktime
+                if key != 'change' and key != 'blocktime':
+                    assert_equal(received2[key], received3[key])
+
+        # Node 3's balances should be unchanged without explicitly requesting
+        # to include watch-only balances
+        assert_equal({k: Decimal(v) for k, v in self.nodes[3].z_gettotalbalance().items()}, {
+            'transparent': node3mined,
+            'private': zsendmany2notevalue,
+            'total': node3mined + zsendmany2notevalue,
+        })
+
+        # Wallet can cache nullifiers for Sapling notes received by addresses it only has a
+        # viewing key for.
+        assert_equal({k: Decimal(v) for k, v in self.nodes[3].z_gettotalbalance(1, True).items()}, {
+            'transparent': node3mined + Decimal('1.0'),
+            'private': zsendmany2notevalue + zaddrremaining2,
+            'total': node3mined + Decimal('1.0') + zsendmany2notevalue + zaddrremaining2,
+        })
+
+        # Check individual balances reflect the above
+        assert_equal(self.nodes[3].z_getbalance(mytaddr1), Decimal('1.0'))
+        assert_equal(self.nodes[3].z_getbalance(myzaddr), zaddrremaining2)
+
+if __name__ == '__main__':
+    WalletNullifiersTest().main ()
diff --git a/depend/zcash/qa/rpc-tests/wallet_orchard.py b/depend/zcash/qa/rpc-tests/wallet_orchard.py
new file mode 100755
index 000000000..218c5e57b
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_orchard.py
@@ -0,0 +1,228 @@
+#!/usr/bin/env python3
+# Copyright (c) 2022 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    NU5_BRANCH_ID,
+    assert_equal,
+    get_coinbase_address,
+    nuparams,
+    start_nodes,
+    wait_and_assert_operationid_status,
+)
+
+from decimal import Decimal
+
+# Test wallet behaviour with the Orchard protocol
+class WalletOrchardTest(BitcoinTestFramework):
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 4
+
+    def setup_nodes(self):
+        return start_nodes(self.num_nodes, self.options.tmpdir, [[
+            nuparams(NU5_BRANCH_ID, 210),
+        ]] * self.num_nodes)
+
+    def run_test(self):
+        # Sanity-check the test harness
+        assert_equal(self.nodes[0].getblockcount(), 200)
+
+        # Get a new orchard-only unified address
+        acct1 = self.nodes[1].z_getnewaccount()['account']
+        addrRes1 = self.nodes[1].z_getaddressforaccount(acct1, ['orchard'])
+        assert_equal(acct1, addrRes1['account'])
+        assert_equal(addrRes1['receiver_types'], ['orchard'])
+        ua1 = addrRes1['address']
+
+        # Verify that we have only an Orchard component
+        receiver_types = self.nodes[0].z_listunifiedreceivers(ua1)
+        assert_equal(set(['orchard']), set(receiver_types))
+
+        # Verify balance
+        assert_equal({'pools': {}, 'minimum_confirmations': 1}, self.nodes[1].z_getbalanceforaccount(acct1))
+
+        # Send some sapling funds to node 2 for later spending after we split the network
+        acct2 = self.nodes[2].z_getnewaccount()['account']
+        addrRes2 = self.nodes[2].z_getaddressforaccount(acct2, ['sapling', 'orchard'])
+        assert_equal(acct2, addrRes2['account'])
+        ua2 = addrRes2['address']
+        saplingAddr2 = self.nodes[2].z_listunifiedreceivers(ua2)['sapling']
+
+        recipients = [{"address": saplingAddr2, "amount": Decimal('10')}]
+        myopid = self.nodes[0].z_sendmany(get_coinbase_address(self.nodes[0]), recipients, 1, 0, 'AllowRevealedSenders')
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+
+        # Mine the tx & activate NU5
+        self.sync_all()
+        self.nodes[0].generate(10)
+        self.sync_all()
+
+        # Check the value sent to saplingAddr2 was received in node 2's account
+        assert_equal(
+                {'pools': {'sapling': {'valueZat': Decimal('1000000000')}}, 'minimum_confirmations': 1},
+                self.nodes[2].z_getbalanceforaccount(acct2))
+
+        # Node 0 shields some funds
+        # t-coinbase -> Orchard
+        recipients = [{"address": ua1, "amount": Decimal('10')}]
+        myopid = self.nodes[0].z_sendmany(get_coinbase_address(self.nodes[0]), recipients, 1, 0, 'AllowRevealedSenders')
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': Decimal('1000000000')}}, 'minimum_confirmations': 1},
+                self.nodes[1].z_getbalanceforaccount(acct1))
+
+        # Split the network
+        self.split_network()
+
+        # Send another tx to ua1
+        recipients = [{"address": ua1, "amount": Decimal('10')}]
+        myopid = self.nodes[0].z_sendmany(get_coinbase_address(self.nodes[0]), recipients, 1, 0, 'AllowRevealedSenders')
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+
+        # Mine the tx & generate a majority chain on the 0/1 side of the split
+        self.sync_all()
+        self.nodes[0].generate(10)
+        self.sync_all()
+
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': Decimal('2000000000')}}, 'minimum_confirmations': 1},
+                self.nodes[1].z_getbalanceforaccount(acct1))
+
+        # On the other side of the split, send some funds to node 3
+        acct3 = self.nodes[3].z_getnewaccount()['account']
+        addrRes3 = self.nodes[3].z_getaddressforaccount(acct3, ['sapling', 'orchard'])
+        assert_equal(acct3, addrRes3['account'])
+        ua3 = addrRes3['address']
+
+        recipients = [{"address": ua3, "amount": Decimal('1')}]
+        myopid = self.nodes[2].z_sendmany(ua2, recipients, 1, 0, 'AllowRevealedAmounts')
+        rollback_tx = wait_and_assert_operationid_status(self.nodes[2], myopid)
+
+        self.sync_all()
+        self.nodes[2].generate(1)
+        self.sync_all()
+
+        # The remaining change from ua2's Sapling note has been sent to the
+        # account's internal Orchard change address.
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': Decimal('900000000')}}, 'minimum_confirmations': 1},
+                self.nodes[2].z_getbalanceforaccount(acct2))
+
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': Decimal('100000000')}}, 'minimum_confirmations': 1},
+                self.nodes[3].z_getbalanceforaccount(acct3))
+
+        # Check that the mempools are empty
+        for i in range(self.num_nodes):
+            assert_equal(set([]), set(self.nodes[i].getrawmempool()))
+
+        # Reconnect the nodes; nodes 2 and 3 will re-org to node 0's chain.
+        print("Re-joining the network so that nodes 2 and 3 reorg")
+        self.join_network()
+
+        # split 0/1's chain should have won, so their wallet balance should be consistent
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': Decimal('2000000000')}}, 'minimum_confirmations': 1},
+                self.nodes[1].z_getbalanceforaccount(acct1))
+
+        # split 2/3's chain should have been rolled back, so their txn should have been
+        # un-mined and returned to the mempool
+        assert_equal(set([rollback_tx]), set(self.nodes[2].getrawmempool()))
+
+        # acct2's sole Orchard note is spent by a transaction in the mempool, so our
+        # confirmed balance is currently 0
+        assert_equal(
+                {'pools': {}, 'minimum_confirmations': 1},
+                self.nodes[2].z_getbalanceforaccount(acct2))
+
+        # acct2's incoming change (unconfirmed, still in the mempool) is 9 zec
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': Decimal('900000000')}}, 'minimum_confirmations': 0},
+                self.nodes[2].z_getbalanceforaccount(acct2, 0))
+
+        # The transaction was un-mined, so acct3 should have no confirmed balance
+        assert_equal(
+                {'pools': {}, 'minimum_confirmations': 1},
+                self.nodes[3].z_getbalanceforaccount(acct3))
+
+        # acct3's unconfirmed balance is 1 zec
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': Decimal('100000000')}}, 'minimum_confirmations': 0},
+                self.nodes[3].z_getbalanceforaccount(acct3, 0))
+
+        # Manually resend the transaction in node 2's mempool
+        self.nodes[2].resendwallettransactions()
+
+        # Sync the network
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # The un-mined transaction should now have been re-mined
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': Decimal('900000000')}}, 'minimum_confirmations': 1},
+                self.nodes[2].z_getbalanceforaccount(acct2))
+
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': Decimal('100000000')}}, 'minimum_confirmations': 1},
+                self.nodes[3].z_getbalanceforaccount(acct3))
+
+        # Split the network again
+        self.split_network()
+
+        # Spend some of acct3's funds on the 2/3 side of the split
+        recipients = [{"address": ua2, "amount": Decimal('0.5')}]
+        myopid = self.nodes[3].z_sendmany(ua3, recipients, 1, 0)
+        rollback_tx = wait_and_assert_operationid_status(self.nodes[3], myopid)
+
+        self.sync_all()
+        self.nodes[2].generate(1)
+        self.sync_all()
+
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': Decimal('950000000')}}, 'minimum_confirmations': 1},
+                self.nodes[2].z_getbalanceforaccount(acct2))
+
+        # Generate a majority chain on the 0/1 side of the split, then 
+        # re-join the network.
+        self.nodes[1].generate(10)
+        self.join_network()
+
+        # split 2/3's chain should have been rolled back, so their txn should have been
+        # un-mined and returned to the mempool
+        assert_equal(set([rollback_tx]), set(self.nodes[3].getrawmempool()))
+
+        # acct2's balance is back to not contain the Orchard->Orchard value
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': Decimal('900000000')}}, 'minimum_confirmations': 1},
+                self.nodes[2].z_getbalanceforaccount(acct2))
+
+        # acct3's sole Orchard note is spent by a transaction in the mempool, so our
+        # confirmed balance is currently 0
+        assert_equal(
+                {'pools': {}, 'minimum_confirmations': 1},
+                self.nodes[3].z_getbalanceforaccount(acct3))
+
+        # Manually resend the transaction in node 3's mempool
+        self.nodes[2].resendwallettransactions()
+
+        # Sync the network
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # The un-mined transaction should now have been re-mined
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': Decimal('950000000')}}, 'minimum_confirmations': 1},
+                self.nodes[2].z_getbalanceforaccount(acct2))
+
+if __name__ == '__main__':
+    WalletOrchardTest().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_orchard_change.py b/depend/zcash/qa/rpc-tests/wallet_orchard_change.py
new file mode 100755
index 000000000..bded74614
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_orchard_change.py
@@ -0,0 +1,123 @@
+#!/usr/bin/env python3
+# Copyright (c) 2022 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    NU5_BRANCH_ID,
+    assert_equal,
+    get_coinbase_address,
+    nuparams,
+    start_nodes,
+    stop_nodes,
+    wait_and_assert_operationid_status,
+    wait_bitcoinds,
+)
+
+# Test wallet behaviour with the Orchard protocol
+class WalletOrchardChangeTest(BitcoinTestFramework):
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 4
+
+    def setup_nodes(self):
+        return start_nodes(self.num_nodes, self.options.tmpdir, [[
+            nuparams(NU5_BRANCH_ID, 205),
+            '-regtestwalletsetbestchaineveryblock',
+        ]] * self.num_nodes)
+
+    def check_has_output(self, node, tx, expected):
+        tx_outputs = self.nodes[0].z_viewtransaction(tx)['outputs']
+        tx_outputs = [{x: y for (x, y) in output.items() if x in expected} for output in tx_outputs]
+        found = False
+        for output in tx_outputs:
+            if output == expected:
+                found = True
+                break
+        assert found, 'Node %s is missing output %s in tx %s (actual: %s)' % (node, expected, tx, tx_outputs)
+
+    def run_test(self):
+        # Sanity-check the test harness.
+        assert_equal(self.nodes[0].getblockcount(), 200)
+
+        # Create an account with funds in the Sapling receiver.
+        acct0 = self.nodes[0].z_getnewaccount()['account']
+        ua0 = self.nodes[0].z_getaddressforaccount(acct0, ['sapling', 'orchard'])['address']
+
+        recipients = [{"address": ua0, "amount": 10}]
+        myopid = self.nodes[0].z_sendmany(get_coinbase_address(self.nodes[0]), recipients, 1, 0, 'AllowRevealedSenders')
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+
+        # Mine the tx & activate NU5.
+        self.sync_all()
+        self.nodes[0].generate(5)
+        self.sync_all()
+
+        assert_equal(
+            {'pools': {'sapling': {'valueZat': 10_0000_0000}}, 'minimum_confirmations': 1},
+            self.nodes[0].z_getbalanceforaccount(acct0),
+        )
+
+        # We want to generate an Orchard change note on node 0. We do this by
+        # sending funds to an Orchard-only UA on node 1.
+        acct1 = self.nodes[1].z_getnewaccount()['account']
+        ua1 = self.nodes[1].z_getaddressforaccount(acct1, ['orchard'])['address']
+
+        recipients = [{"address": ua1, "amount": 1}]
+        myopid = self.nodes[0].z_sendmany(ua0, recipients, 1, 0, 'AllowRevealedAmounts')
+        source_tx = wait_and_assert_operationid_status(self.nodes[0], myopid)
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # The nodes have the expected split of funds.
+        assert_equal(
+            {'pools': {'orchard': {'valueZat': 9_0000_0000}}, 'minimum_confirmations': 1},
+            self.nodes[0].z_getbalanceforaccount(acct0),
+        )
+        assert_equal(
+            {'pools': {'orchard': {'valueZat': 1_0000_0000}}, 'minimum_confirmations': 1},
+            self.nodes[1].z_getbalanceforaccount(acct1),
+        )
+
+        # The Orchard note for node 0 is a change note.
+        self.check_has_output(0, source_tx, {
+            'pool': 'orchard',
+            'outgoing': False,
+            'walletInternal': True,
+            'value': 9,
+            'valueZat': 9_0000_0000,
+        })
+
+        # Shut down the nodes, and restart so that we can check wallet load
+        stop_nodes(self.nodes)
+        wait_bitcoinds()
+        self.setup_network()
+
+        # The nodes have unaltered balances.
+        assert_equal(
+            {'pools': {'orchard': {'valueZat': 9_0000_0000}}, 'minimum_confirmations': 1},
+            self.nodes[0].z_getbalanceforaccount(acct0),
+        )
+        assert_equal(
+            {'pools': {'orchard': {'valueZat': 1_0000_0000}}, 'minimum_confirmations': 1},
+            self.nodes[1].z_getbalanceforaccount(acct1),
+        )
+
+        # Send another Orchard transaction from node 0 to node 1.
+        myopid = self.nodes[0].z_sendmany(ua0, recipients, 1, 0)
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        assert_equal(
+            {'pools': {'orchard': {'valueZat': 8_0000_0000}}, 'minimum_confirmations': 1},
+            self.nodes[0].z_getbalanceforaccount(acct0),
+        )
+
+if __name__ == '__main__':
+    WalletOrchardChangeTest().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_orchard_init.py b/depend/zcash/qa/rpc-tests/wallet_orchard_init.py
new file mode 100755
index 000000000..b5db9f4e1
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_orchard_init.py
@@ -0,0 +1,162 @@
+#!/usr/bin/env python3
+# Copyright (c) 2022 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+import os
+import os.path
+
+from decimal import Decimal
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    NU5_BRANCH_ID,
+    assert_equal,
+    get_coinbase_address,
+    nuparams,
+    start_nodes,
+    stop_nodes,
+    wait_bitcoinds,
+    wait_and_assert_operationid_status,
+)
+
+# Test wallet behaviour with the Orchard protocol
+class OrchardWalletInitTest(BitcoinTestFramework):
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 4
+
+    def setup_nodes(self):
+        return start_nodes(self.num_nodes, self.options.tmpdir, [[
+            nuparams(NU5_BRANCH_ID, 205),
+            '-regtestwalletsetbestchaineveryblock'
+        ]] * self.num_nodes)
+
+    def run_test(self):
+        # Sanity-check the test harness
+        assert_equal(self.nodes[0].getblockcount(), 200)
+        
+        # Get a new Orchard account on node 0
+        acct0 = self.nodes[0].z_getnewaccount()['account']
+        ua0 = self.nodes[0].z_getaddressforaccount(acct0, ['orchard'])['address']
+
+        # Activate NU5
+        self.nodes[0].generate(5)
+        self.sync_all()
+
+        # Get a recipient address
+        acct1 = self.nodes[1].z_getnewaccount()['account']
+        ua1 = self.nodes[1].z_getaddressforaccount(acct1, ['orchard'])['address']
+
+        # Send a transaction to node 1 so that it has an Orchard note to spend.
+        recipients = [{"address": ua1, "amount": 10}]
+        myopid = self.nodes[0].z_sendmany(get_coinbase_address(self.nodes[0]), recipients, 1, 0, 'AllowRevealedSenders')
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # Check the value sent to ua1 was received
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': 10_0000_0000}}, 'minimum_confirmations': 1},
+                self.nodes[1].z_getbalanceforaccount(acct1))
+
+        # Create an Orchard spend, so that the note commitment tree root gets altered.
+        recipients = [{"address": ua0, "amount": 1}]
+        myopid = self.nodes[1].z_sendmany(ua1, recipients, 1, 0)
+        wait_and_assert_operationid_status(self.nodes[1], myopid)
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # Verify the balance on both nodes
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': 9_0000_0000}}, 'minimum_confirmations': 1},
+                self.nodes[1].z_getbalanceforaccount(acct1))
+
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': 1_0000_0000}}, 'minimum_confirmations': 1},
+                self.nodes[0].z_getbalanceforaccount(acct0))
+
+        # Split the network. We'll advance the state of nodes 0/1 so that after 
+        # we re-join the network, we need to roll back more than one block after
+        # the wallet is restored, into a chain state that the wallet never observed.
+        self.split_network()
+
+        self.sync_all()
+        self.nodes[0].generate(2)
+        self.sync_all()
+
+        # Shut down the network and delete node 0's wallet
+        stop_nodes(self.nodes)
+        wait_bitcoinds()
+
+        tmpdir = self.options.tmpdir
+        os.remove(os.path.join(tmpdir, "node0", "regtest", "wallet.dat"))
+
+        # Restart the network, still split; the split here is note necessary to reproduce
+        # the error but it is sufficient, and we will later use the split to check the
+        # corresponding rewind.
+        self.setup_network(True)
+
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': 9_0000_0000}}, 'minimum_confirmations': 1},
+                self.nodes[1].z_getbalanceforaccount(acct1))
+
+        # Get a new account with an Orchard UA on node 0
+        acct0new = self.nodes[0].z_getnewaccount()['account']
+        ua0new = self.nodes[0].z_getaddressforaccount(acct0, ['orchard'])['address']
+
+        # Send a transaction to the Orchard account. When we mine this transaction,
+        # the bug causes the state of note commitment tree in the wallet to not match
+        # the state of the global note commitment tree.
+        recipients = [{"address": ua0new, "amount": 1}]
+        myopid = self.nodes[1].z_sendmany(ua1, recipients, 1, 0)
+        rollback_tx = wait_and_assert_operationid_status(self.nodes[1], myopid)
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': 1_0000_0000}}, 'minimum_confirmations': 1},
+                self.nodes[0].z_getbalanceforaccount(acct0new))
+
+        # Node 2 has no progress since the network was first split, so this should roll
+        # everything back to the original fork point.
+        self.nodes[2].generate(10)
+
+        # Re-join the network
+        self.join_network()
+
+        assert_equal(set([rollback_tx]), set(self.nodes[1].getrawmempool()))
+
+        # Resend un-mined transactions and sync the network
+        self.nodes[1].resendwallettransactions()
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': 1_0000_0000}}, 'minimum_confirmations': 1},
+                self.nodes[0].z_getbalanceforaccount(acct0new))
+
+        # Spend from the note that was just received
+        recipients = [{"address": ua1, "amount": Decimal('0.3')}]
+        myopid = self.nodes[0].z_sendmany(ua0new, recipients, 1, 0)
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': 8_3000_0000}}, 'minimum_confirmations': 1},
+                self.nodes[1].z_getbalanceforaccount(acct1))
+
+
+if __name__ == '__main__':
+    OrchardWalletInitTest().main()
+
diff --git a/depend/zcash/qa/rpc-tests/wallet_orchard_persistence.py b/depend/zcash/qa/rpc-tests/wallet_orchard_persistence.py
new file mode 100755
index 000000000..f27a94442
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_orchard_persistence.py
@@ -0,0 +1,107 @@
+#!/usr/bin/env python3
+# Copyright (c) 2022 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    NU5_BRANCH_ID,
+    assert_equal,
+    get_coinbase_address,
+    nuparams,
+    start_nodes,
+    stop_nodes,
+    wait_bitcoinds,
+    wait_and_assert_operationid_status,
+)
+
+from decimal import Decimal
+
+# Test wallet behaviour with the Orchard protocol
+class WalletOrchardPersistenceTest(BitcoinTestFramework):
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 4
+
+    def setup_nodes(self):
+        return start_nodes(self.num_nodes, self.options.tmpdir, [[
+            nuparams(NU5_BRANCH_ID, 201),
+        ]] * self.num_nodes)
+
+    def run_test(self):
+        # Sanity-check the test harness
+        assert_equal(self.nodes[0].getblockcount(), 200)
+
+        # activate NU5
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # Send some Orchard funds to node 2 for later spending after we split the network
+        acct0 = self.nodes[0].z_getnewaccount()['account']
+        ua0 = self.nodes[0].z_getaddressforaccount(acct0, ['sapling', 'orchard'])['address']
+
+        recipients = [{"address": ua0, "amount": 10}]
+        myopid = self.nodes[0].z_sendmany(get_coinbase_address(self.nodes[0]), recipients, 1, 0, 'AllowRevealedSenders')
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+
+        # Mine the tx 
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': 10_0000_0000}}, 'minimum_confirmations': 1},
+                self.nodes[0].z_getbalanceforaccount(acct0))
+
+        # Send to a new orchard-only unified address
+        acct1 = self.nodes[1].z_getnewaccount()['account']
+        ua1 = self.nodes[1].z_getaddressforaccount(acct1, ['orchard'])['address']
+
+        recipients = [{"address": ua1, "amount": 1}]
+        myopid = self.nodes[0].z_sendmany(ua0, recipients, 1, 0)
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': 9_0000_0000}}, 'minimum_confirmations': 1},
+                self.nodes[0].z_getbalanceforaccount(acct0))
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': 1_0000_0000}}, 'minimum_confirmations': 1},
+                self.nodes[1].z_getbalanceforaccount(acct1))
+
+        # Send another Orchard transaction from node 0 back to itself, so that the
+        # note commitment tree gets advanced.
+        recipients = [{"address": ua0, "amount": 1}]
+        myopid = self.nodes[0].z_sendmany(ua0, recipients, 1, 0)
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # Shut down the nodes, and restart so that we can check wallet load
+        stop_nodes(self.nodes);
+        wait_bitcoinds()
+        self.setup_network()
+
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': 9_0000_0000}}, 'minimum_confirmations': 1},
+                self.nodes[0].z_getbalanceforaccount(acct0))
+
+        recipients = [{"address": ua0, "amount": Decimal('0.5')}]
+        myopid = self.nodes[1].z_sendmany(ua1, recipients, 1, 0)
+        wait_and_assert_operationid_status(self.nodes[1], myopid)
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': 9_5000_0000}}, 'minimum_confirmations': 1},
+                self.nodes[0].z_getbalanceforaccount(acct0))
+
+if __name__ == '__main__':
+    WalletOrchardPersistenceTest().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_overwintertx.py b/depend/zcash/qa/rpc-tests/wallet_overwintertx.py
new file mode 100755
index 000000000..5ccdd57b4
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_overwintertx.py
@@ -0,0 +1,180 @@
+#!/usr/bin/env python3
+# Copyright (c) 2018 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    assert_equal,
+    assert_greater_than,
+    connect_nodes_bi,
+    get_coinbase_address,
+    start_nodes,
+    wait_and_assert_operationid_status,
+    DEFAULT_FEE
+)
+from test_framework.authproxy import JSONRPCException
+
+from decimal import Decimal
+
+class WalletOverwinterTxTest (BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 4
+        self.setup_clean_chain = True
+
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir, extra_args=[[
+            "-nuparams=2bb40e60:200",
+            "-debug=zrpcunsafe",
+            "-txindex",
+        ]] * self.num_nodes)
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,0,2)
+        connect_nodes_bi(self.nodes,0,3)
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test (self):
+        self.nodes[0].generate(100)
+        self.sync_all()
+        self.nodes[1].generate(95)
+        self.sync_all()
+        # Node 0 has reward from blocks 1 to 95 which are spendable.
+
+        taddr0 = get_coinbase_address(self.nodes[0])
+        taddr1 = self.nodes[1].getnewaddress()
+        taddr2 = self.nodes[2].getnewaddress()
+        zaddr2 = self.nodes[2].z_getnewaddress('sprout')
+        taddr3 = self.nodes[3].getnewaddress()
+        zaddr3 = self.nodes[3].z_getnewaddress('sprout')
+
+        #
+        # Currently at block 195. The next block to be mined 196 is a Sapling block
+        #
+        bci = self.nodes[0].getblockchaininfo()
+        assert_equal(bci['consensus']['chaintip'], '76b809bb')
+        assert_equal(bci['consensus']['nextblock'], '76b809bb')
+        assert_equal(bci['upgrades']['2bb40e60']['status'], 'pending')
+
+        # Node 0 sends transparent funds to Node 2
+        tsendamount = Decimal('1.0')
+        txid_transparent = self.nodes[0].sendtoaddress(taddr2, tsendamount)
+        self.sync_all()
+
+        # Node 2 sends the zero-confirmation transparent funds to Node 1 using z_sendmany
+        recipients = []
+        recipients.append({"address":taddr1, "amount": Decimal('0.5')})
+        myopid = self.nodes[2].z_sendmany(taddr2, recipients, 0)
+        txid_zsendmany = wait_and_assert_operationid_status(self.nodes[2], myopid)
+
+        # Node 0 shields to Node 2, a coinbase utxo of value 10.0 less default fee
+        zsendamount = Decimal('10.0') - DEFAULT_FEE
+        result = self.nodes[0].z_shieldcoinbase(taddr0, zaddr2, DEFAULT_FEE, 1)
+        txid_shielded = wait_and_assert_operationid_status(self.nodes[0], result['opid'])
+
+        # Skip over the three blocks prior to activation; no transactions can be mined
+        # in them due to the nearly-expiring restrictions.
+        self.sync_all()
+        self.nodes[0].generate(4)
+        self.sync_all()
+
+        # Verify balance
+        assert_equal(self.nodes[1].z_getbalance(taddr1), Decimal('0.5'))
+        assert_equal(self.nodes[2].getbalance(), Decimal('0.5') - DEFAULT_FEE)
+        assert_equal(self.nodes[2].z_getbalance(zaddr2), zsendamount)
+
+        # Verify transaction version is 4 (intended for Sapling+)
+        result = self.nodes[0].getrawtransaction(txid_transparent, 1)
+        assert_equal(result["version"], 4)
+        assert_equal(result["overwintered"], True)
+        result = self.nodes[0].getrawtransaction(txid_zsendmany, 1)
+        assert_equal(result["version"], 4)
+        assert_equal(result["overwintered"], True)
+        result = self.nodes[0].getrawtransaction(txid_shielded, 1)
+        assert_equal(result["version"], 4)
+        assert_equal(result["overwintered"], True)
+
+        #
+        # Currently at block 199. The next block to be mined 200 is a Blossom block
+        #
+        bci = self.nodes[0].getblockchaininfo()
+        assert_equal(bci['consensus']['chaintip'], '76b809bb')
+        assert_equal(bci['consensus']['nextblock'], '2bb40e60')
+        assert_equal(bci['upgrades']['2bb40e60']['status'], 'pending')
+
+        # Test using expiryheight parameter of createrawtransaction when Blossom is active in the next block
+        errorString = ""
+        try:
+            self.nodes[0].createrawtransaction([], {}, 0, 499999999)
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert_equal("", errorString)
+        try:
+            self.nodes[0].createrawtransaction([], {}, 0, -1)
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert_equal("Invalid parameter, expiryheight must be nonnegative and less than 500000000" in errorString, True)
+        try:
+            self.nodes[0].createrawtransaction([], {}, 0, 500000000)
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert_equal("Invalid parameter, expiryheight must be nonnegative and less than 500000000" in errorString, True)
+        try:
+            self.nodes[0].createrawtransaction([], {}, 0, 200)
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert_equal("Invalid parameter, expiryheight should be at least 203 to avoid transaction expiring soon" in errorString, True)
+
+        # Node 0 sends transparent funds to Node 3
+        tsendamount = Decimal('1.0')
+        txid_transparent = self.nodes[0].sendtoaddress(taddr3, tsendamount)
+        self.sync_all()
+
+        # Node 3 sends the zero-confirmation transparent funds to Node 1 using z_sendmany
+        recipients = []
+        recipients.append({"address":taddr1, "amount": Decimal('0.5')})
+        myopid = self.nodes[3].z_sendmany(taddr3, recipients, 0)
+        txid_zsendmany = wait_and_assert_operationid_status(self.nodes[3], myopid)
+
+        # Node 0 shields to Node 3, a coinbase utxo of value 10.0 less default fee
+        zsendamount = Decimal('10.0') - DEFAULT_FEE
+        result = self.nodes[0].z_shieldcoinbase(taddr0, zaddr3, DEFAULT_FEE, 1)
+        txid_shielded = wait_and_assert_operationid_status(self.nodes[0], result['opid'])
+
+        # Mine the first Blossom block
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+        bci = self.nodes[0].getblockchaininfo()
+
+        # size_on_disk should be > 0
+        assert_greater_than(bci['size_on_disk'], 0)
+
+        assert_equal(bci['consensus']['chaintip'], '2bb40e60')
+        assert_equal(bci['consensus']['nextblock'], '2bb40e60')
+        assert_equal(bci['upgrades']['2bb40e60']['status'], 'active')
+
+        # Verify balance
+        assert_equal(self.nodes[1].z_getbalance(taddr1), Decimal('1.0'))
+        assert_equal(self.nodes[3].getbalance(), Decimal('0.5') - DEFAULT_FEE)
+        assert_equal(self.nodes[3].z_getbalance(zaddr3), zsendamount)
+
+        # Verify transaction version is 4 (intended for Sapling+)
+        result = self.nodes[0].getrawtransaction(txid_transparent, 1)
+        assert_equal(result["version"], 4)
+        assert_equal(result["overwintered"], True)
+        assert_equal(result["versiongroupid"], "892f2085")
+        result = self.nodes[0].getrawtransaction(txid_zsendmany, 1)
+        assert_equal(result["version"], 4)
+        assert_equal(result["overwintered"], True)
+        assert_equal(result["versiongroupid"], "892f2085")
+        result = self.nodes[0].getrawtransaction(txid_shielded, 1)
+        assert_equal(result["version"], 4)
+        assert_equal(result["overwintered"], True)
+        assert_equal(result["versiongroupid"], "892f2085")
+
+if __name__ == '__main__':
+    WalletOverwinterTxTest().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_parsing_amounts.py b/depend/zcash/qa/rpc-tests/wallet_parsing_amounts.py
new file mode 100755
index 000000000..fd1718f9b
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_parsing_amounts.py
@@ -0,0 +1,113 @@
+#!/usr/bin/env python3
+# Copyright (c) 2020 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, connect_nodes_bi, start_nodes
+from test_framework.authproxy import JSONRPCException
+from decimal import Decimal
+
+# Test wallet address behaviour across network upgrades
+class WalletAmountParsingTest(BitcoinTestFramework):
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(3, self.options.tmpdir)
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,0,2)
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test(self):
+        #send a tx with value in a string (PR#6380 +)
+        txId  = self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(), "2")
+        txObj = self.nodes[0].gettransaction(txId)
+        assert_equal(txObj['amount'], Decimal('-2.00000000'))
+        assert_equal(txObj['amountZat'], -200000000)
+
+        txId  = self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(), "0.0001")
+        txObj = self.nodes[0].gettransaction(txId)
+        assert_equal(txObj['amount'], Decimal('-0.00010000'))
+        assert_equal(txObj['amountZat'], -10000)
+
+        #check if JSON parser can handle scientific notation in strings
+        txId  = self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(), "1e-4")
+        txObj = self.nodes[0].gettransaction(txId)
+        assert_equal(txObj['amount'], Decimal('-0.00010000'))
+        assert_equal(txObj['amountZat'], -10000)
+
+        #this should fail
+        errorString = ""
+        try:
+            txId  = self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(), "1f-4")
+        except JSONRPCException as e:
+            errorString = e.error['message']
+
+        assert_equal("Invalid amount" in errorString, True)
+
+        errorString = ""
+        try:
+            self.nodes[0].generate("2") #use a string to as block amount parameter must fail because it's not interpreted as amount
+        except JSONRPCException as e:
+            errorString = e.error['message']
+
+        assert_equal("not an integer" in errorString, True)
+
+        myzaddr     = self.nodes[0].z_getnewaddress()
+        recipients  = [ {"address": myzaddr, "amount": Decimal('0.0') } ]
+        errorString = ''
+
+        # Make sure that amount=0 transactions can use the default fee
+        # without triggering "absurd fee" errors
+        try:
+            myopid = self.nodes[0].z_sendmany(myzaddr, recipients)
+            assert(myopid)
+        except JSONRPCException as e:
+            errorString = e.error['message']
+            print(errorString)
+            assert(False)
+
+        # This fee is larger than the default fee and since amount=0
+        # it should trigger error
+        fee         = Decimal('0.1')
+        recipients  = [ {"address": myzaddr, "amount": Decimal('0.0') } ]
+        minconf     = 1
+        errorString = ''
+
+        try:
+            myopid = self.nodes[0].z_sendmany(myzaddr, recipients, minconf, fee)
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert('Small transaction amount' in errorString)
+
+        # This fee is less than default and greater than amount, but still valid
+        fee         = Decimal('0.0000001')
+        recipients  = [ {"address": myzaddr, "amount": Decimal('0.00000001') } ]
+        minconf     = 1
+        errorString = ''
+
+        try:
+            myopid = self.nodes[0].z_sendmany(myzaddr, recipients, minconf, fee)
+            assert(myopid)
+        except JSONRPCException as e:
+            errorString = e.error['message']
+            print(errorString)
+            assert(False)
+
+        # Make sure amount=0, fee=0 transaction are valid to add to mempool
+        # though miners decide whether to add to a block
+        fee         = Decimal('0.0')
+        minconf     = 1
+        recipients  = [ {"address": myzaddr, "amount": Decimal('0.0') } ]
+        errorString = ''
+
+        try:
+            myopid = self.nodes[0].z_sendmany(myzaddr, recipients, minconf, fee)
+            assert(myopid)
+        except JSONRPCException as e:
+            errorString = e.error['message']
+            print(errorString)
+            assert(False)
+
+if __name__ == '__main__':
+    WalletAmountParsingTest().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_persistence.py b/depend/zcash/qa/rpc-tests/wallet_persistence.py
new file mode 100755
index 000000000..7c8c34838
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_persistence.py
@@ -0,0 +1,145 @@
+#!/usr/bin/env python3
+# Copyright (c) 2018 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    assert_equal, assert_true,
+    get_coinbase_address,
+    start_nodes, stop_nodes,
+    initialize_chain_clean, connect_nodes_bi, wait_bitcoinds,
+    wait_and_assert_operationid_status
+)
+from decimal import Decimal
+
+class WalletPersistenceTest (BitcoinTestFramework):
+
+    def setup_chain(self):
+        print("Initializing test directory " + self.options.tmpdir)
+        initialize_chain_clean(self.options.tmpdir, 4)
+
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(4, self.options.tmpdir)
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,2,3)
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test(self):
+        # Sanity-check the test harness
+        self.nodes[0].generate(200)
+        assert_equal(self.nodes[0].getblockcount(), 200)
+        self.sync_all()
+
+        # Verify Sapling address is persisted in wallet
+        sapling_addr = self.nodes[0].z_getnewaddress('sapling')
+
+        # Make sure the node has the address
+        addresses = self.nodes[0].z_listaddresses()
+        assert_true(sapling_addr in addresses, "Should contain address before restart")
+
+        # Restart the nodes
+        stop_nodes(self.nodes)
+        wait_bitcoinds()
+        self.setup_network()
+
+        # Make sure we still have the address after restarting
+        addresses = self.nodes[0].z_listaddresses()
+        assert_true(sapling_addr in addresses, "Should contain address after restart")
+
+        # Node 0 shields funds to Sapling address
+        taddr0 = get_coinbase_address(self.nodes[0])
+        recipients = []
+        recipients.append({"address": sapling_addr, "amount": Decimal('20')})
+        myopid = self.nodes[0].z_sendmany(taddr0, recipients, 1, 0)
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # Verify shielded balance
+        assert_equal(self.nodes[0].z_getbalance(sapling_addr), Decimal('20'))
+
+        # Verify size of shielded pools
+        pools = self.nodes[0].getblockchaininfo()['valuePools']
+        assert_equal(pools[0]['chainValue'], Decimal('0'))  # Sprout
+        assert_equal(pools[1]['chainValue'], Decimal('20')) # Sapling
+
+        # Restart the nodes
+        stop_nodes(self.nodes)
+        wait_bitcoinds()
+        self.setup_network()
+
+        # Verify size of shielded pools
+        pools = self.nodes[0].getblockchaininfo()['valuePools']
+        assert_equal(pools[0]['chainValue'], Decimal('0'))  # Sprout
+        assert_equal(pools[1]['chainValue'], Decimal('20')) # Sapling
+
+        # Node 0 sends some shielded funds to Node 1
+        dest_addr = self.nodes[1].z_getnewaddress('sapling')
+        recipients = []
+        recipients.append({"address": dest_addr, "amount": Decimal('15')})
+        myopid = self.nodes[0].z_sendmany(sapling_addr, recipients, 1, 0)
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # Verify balances
+        assert_equal(self.nodes[0].z_getbalance(sapling_addr), Decimal('5'))
+        assert_equal(self.nodes[1].z_getbalance(dest_addr), Decimal('15'))
+
+        # Restart the nodes
+        stop_nodes(self.nodes)
+        wait_bitcoinds()
+        self.setup_network()
+
+        # Verify balances
+        assert_equal(self.nodes[0].z_getbalance(sapling_addr), Decimal('5'))
+        assert_equal(self.nodes[1].z_getbalance(dest_addr), Decimal('15'))
+
+        # Verify importing a spending key will update and persist the nullifiers and witnesses correctly
+        sk0 = self.nodes[0].z_exportkey(sapling_addr)
+        self.nodes[2].z_importkey(sk0, "yes")
+        assert_equal(self.nodes[2].z_getbalance(sapling_addr), Decimal('5'))
+
+        # Verify importing a viewing key will update and persist the nullifiers and witnesses correctly
+        extfvk0 = self.nodes[0].z_exportviewingkey(sapling_addr)
+        self.nodes[3].z_importviewingkey(extfvk0, "yes")
+        assert_equal(self.nodes[3].z_getbalance(sapling_addr), Decimal('5'))
+        assert_equal(self.nodes[3].z_gettotalbalance()['private'], '0.00')
+        assert_equal(self.nodes[3].z_gettotalbalance(1, True)['private'], '5.00')
+
+        # Restart the nodes
+        stop_nodes(self.nodes)
+        wait_bitcoinds()
+        self.setup_network()
+
+        # Verify nullifiers persisted correctly by checking balance
+        # Prior to PR #3590, there will be an error as spent notes are considered unspent:
+        #    Assertion failed: expected: <25.00000000> but was: <5>
+        assert_equal(self.nodes[2].z_getbalance(sapling_addr), Decimal('5'))
+        assert_equal(self.nodes[3].z_getbalance(sapling_addr), Decimal('5'))
+        assert_equal(self.nodes[3].z_gettotalbalance()['private'], '0.00')
+        assert_equal(self.nodes[3].z_gettotalbalance(1, True)['private'], '5.00')
+
+        # Verity witnesses persisted correctly by sending shielded funds
+        recipients = []
+        recipients.append({"address": dest_addr, "amount": Decimal('1')})
+        myopid = self.nodes[2].z_sendmany(sapling_addr, recipients, 1, 0)
+        wait_and_assert_operationid_status(self.nodes[2], myopid)
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # Verify balances
+        assert_equal(self.nodes[2].z_getbalance(sapling_addr), Decimal('4'))
+        assert_equal(self.nodes[1].z_getbalance(dest_addr), Decimal('16'))
+
+if __name__ == '__main__':
+    WalletPersistenceTest().main()
\ No newline at end of file
diff --git a/depend/zcash/qa/rpc-tests/wallet_sapling.py b/depend/zcash/qa/rpc-tests/wallet_sapling.py
new file mode 100755
index 000000000..28c86cae0
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_sapling.py
@@ -0,0 +1,175 @@
+#!/usr/bin/env python3
+# Copyright (c) 2018 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.authproxy import JSONRPCException
+from test_framework.util import (
+    assert_equal,
+    get_coinbase_address,
+    wait_and_assert_operationid_status,
+    DEFAULT_FEE
+)
+
+from decimal import Decimal
+
+# Test wallet behaviour with Sapling addresses
+class WalletSaplingTest(BitcoinTestFramework):
+
+    def run_test(self):
+        # Sanity-check the test harness
+        assert_equal(self.nodes[0].getblockcount(), 200)
+
+        taddr1 = self.nodes[1].getnewaddress()
+        saplingAddr0 = self.nodes[0].z_getnewaddress('sapling')
+        saplingAddr1 = self.nodes[1].z_getnewaddress('sapling')
+
+        # Verify addresses
+        assert(saplingAddr0 in self.nodes[0].z_listaddresses())
+        assert(saplingAddr1 in self.nodes[1].z_listaddresses())
+        assert_equal(self.nodes[0].z_validateaddress(saplingAddr0)['type'], 'sapling')
+        assert_equal(self.nodes[0].z_validateaddress(saplingAddr1)['type'], 'sapling')
+
+        # Verify balance
+        assert_equal(self.nodes[0].z_getbalance(saplingAddr0), Decimal('0'))
+        assert_equal(self.nodes[1].z_getbalance(saplingAddr1), Decimal('0'))
+        assert_equal(self.nodes[1].z_getbalance(taddr1), Decimal('0'))
+
+        # Node 0 shields some funds
+        # taddr -> Sapling
+        recipients = []
+        recipients.append({"address": saplingAddr0, "amount": Decimal('10')})
+        myopid = self.nodes[0].z_sendmany(get_coinbase_address(self.nodes[0]), recipients, 1, 0)
+        mytxid = wait_and_assert_operationid_status(self.nodes[0], myopid)
+
+        self.sync_all()
+
+        # Verify priority of tx is MAX_PRIORITY, defined as 1E+16 (10000000000000000)
+        mempool = self.nodes[0].getrawmempool(True)
+        assert(Decimal(mempool[mytxid]['startingpriority']) == Decimal('1E+16'))
+
+        # Shield another coinbase UTXO
+        myopid = self.nodes[0].z_sendmany(get_coinbase_address(self.nodes[0]), recipients, 1, 0)
+        mytxid = wait_and_assert_operationid_status(self.nodes[0], myopid)
+
+        self.sync_all()
+        self.nodes[2].generate(1)
+        self.sync_all()
+
+        # Verify balance
+        assert_equal(self.nodes[0].z_getbalance(saplingAddr0), Decimal('20'))
+        assert_equal(self.nodes[1].z_getbalance(saplingAddr1), Decimal('0'))
+        assert_equal(self.nodes[1].z_getbalance(taddr1), Decimal('0'))
+
+        # Node 0 sends some shielded funds to node 1
+        # Sapling -> Sapling
+        #         -> Sapling (change)
+        recipients = []
+        recipients.append({"address": saplingAddr1, "amount": Decimal('15')})
+        myopid = self.nodes[0].z_sendmany(saplingAddr0, recipients, 1, 0)
+        mytxid = wait_and_assert_operationid_status(self.nodes[0], myopid)
+
+        self.sync_all()
+
+        # Verify priority of tx is MAX_PRIORITY, defined as 1E+16 (10000000000000000)
+        mempool = self.nodes[0].getrawmempool(True)
+        assert(Decimal(mempool[mytxid]['startingpriority']) == Decimal('1E+16'))
+
+        self.nodes[2].generate(1)
+        self.sync_all()
+
+        # Verify balance
+        assert_equal(self.nodes[0].z_getbalance(saplingAddr0), Decimal('5'))
+        assert_equal(self.nodes[1].z_getbalance(saplingAddr1), Decimal('15'))
+        assert_equal(self.nodes[1].z_getbalance(taddr1), Decimal('0'))
+
+        # Node 1 sends some shielded funds to node 0, as well as unshielding
+        # Sapling -> Sapling
+        #         -> taddr
+        #         -> Sapling (change)
+        recipients = []
+        recipients.append({"address": saplingAddr0, "amount": Decimal('5')})
+        recipients.append({"address": taddr1, "amount": Decimal('5')})
+        myopid = self.nodes[1].z_sendmany(saplingAddr1, recipients, 1, 0)
+        mytxid = wait_and_assert_operationid_status(self.nodes[1], myopid)
+
+        self.sync_all()
+
+        # Verify priority of tx is MAX_PRIORITY, defined as 1E+16 (10000000000000000)
+        mempool = self.nodes[1].getrawmempool(True)
+        assert(Decimal(mempool[mytxid]['startingpriority']) == Decimal('1E+16'))
+
+        self.nodes[2].generate(1)
+        self.sync_all()
+
+        # Verify balance
+        assert_equal(self.nodes[0].z_getbalance(saplingAddr0), Decimal('10'))
+        assert_equal(self.nodes[1].z_getbalance(saplingAddr1), Decimal('5'))
+        assert_equal(self.nodes[1].z_getbalance(taddr1), Decimal('5'))
+
+        # Verify existence of Sapling related JSON fields
+        resp = self.nodes[0].getrawtransaction(mytxid, 1)
+        assert_equal(resp['valueBalance'], Decimal('5'))
+        assert(len(resp['vShieldedSpend']) == 1)
+        assert(len(resp['vShieldedOutput']) == 2)
+        assert('bindingSig' in resp)
+        shieldedSpend = resp['vShieldedSpend'][0]
+        assert('cv' in shieldedSpend)
+        assert('anchor' in shieldedSpend)
+        assert('nullifier' in shieldedSpend)
+        assert('rk' in shieldedSpend)
+        assert('proof' in shieldedSpend)
+        assert('spendAuthSig' in shieldedSpend)
+        shieldedOutput = resp['vShieldedOutput'][0]
+        assert('cv' in shieldedOutput)
+        assert('cmu' in shieldedOutput)
+        assert('ephemeralKey' in shieldedOutput)
+        assert('encCiphertext' in shieldedOutput)
+        assert('outCiphertext' in shieldedOutput)
+        assert('proof' in shieldedOutput)
+
+        # Verify importing a spending key will update the nullifiers and witnesses correctly
+        sk0 = self.nodes[0].z_exportkey(saplingAddr0)
+        saplingAddrInfo0 = self.nodes[2].z_importkey(sk0, "yes")
+        assert_equal(saplingAddrInfo0["type"], "sapling")
+        assert_equal(saplingAddrInfo0["address"], saplingAddr0)
+        assert_equal(self.nodes[2].z_getbalance(saplingAddrInfo0["address"]), Decimal('10'))
+        sk1 = self.nodes[1].z_exportkey(saplingAddr1)
+        saplingAddrInfo1 = self.nodes[2].z_importkey(sk1, "yes")
+        assert_equal(saplingAddrInfo1["type"], "sapling")
+        assert_equal(saplingAddrInfo1["address"], saplingAddr1)
+        assert_equal(self.nodes[2].z_getbalance(saplingAddrInfo1["address"]), Decimal('5'))
+
+        # Verify importing a viewing key will update the nullifiers and witnesses correctly
+        extfvk0 = self.nodes[0].z_exportviewingkey(saplingAddr0)
+        saplingAddrInfo0 = self.nodes[3].z_importviewingkey(extfvk0, "yes")
+        assert_equal(saplingAddrInfo0["type"], "sapling")
+        assert_equal(saplingAddrInfo0["address"], saplingAddr0)
+        assert_equal(self.nodes[3].z_getbalance(saplingAddrInfo0["address"]), Decimal('10'))
+        extfvk1 = self.nodes[1].z_exportviewingkey(saplingAddr1)
+        saplingAddrInfo1 = self.nodes[3].z_importviewingkey(extfvk1, "yes")
+        assert_equal(saplingAddrInfo1["type"], "sapling")
+        assert_equal(saplingAddrInfo1["address"], saplingAddr1)
+        assert_equal(self.nodes[3].z_getbalance(saplingAddrInfo1["address"]), Decimal('5'))
+
+        # Verify that z_gettotalbalance only includes watch-only addresses when requested
+        assert_equal(self.nodes[3].z_gettotalbalance()['private'], '0.00')
+        assert_equal(self.nodes[3].z_gettotalbalance(1, True)['private'], '15.00')
+
+        # Make sure we get a useful error when trying to send to both sprout and sapling
+        node4_sproutaddr = self.nodes[3].z_getnewaddress('sprout')
+        node4_saplingaddr = self.nodes[3].z_getnewaddress('sapling')
+        try:
+            self.nodes[1].z_sendmany(
+                taddr1,
+                [{'address': node4_sproutaddr, 'amount': Decimal('2.5')},
+                 {'address': node4_saplingaddr, 'amount': Decimal('2.5') - DEFAULT_FEE}],
+                1, DEFAULT_FEE
+            )
+            raise AssertionError("Should have thrown an exception")
+        except JSONRPCException as e:
+            assert_equal("Sending funds into the Sprout value pool is not supported by z_sendmany", e.error['message'])
+
+if __name__ == '__main__':
+    WalletSaplingTest().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_sendmany_any_taddr.py b/depend/zcash/qa/rpc-tests/wallet_sendmany_any_taddr.py
new file mode 100755
index 000000000..79846ccb8
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_sendmany_any_taddr.py
@@ -0,0 +1,129 @@
+#!/usr/bin/env python3
+# Copyright (c) 2020 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    assert_equal,
+    connect_nodes_bi,
+    start_nodes,
+    sync_blocks,
+    wait_and_assert_operationid_status,
+)
+
+TX_EXPIRY_DELTA = 10
+TX_EXPIRING_SOON_THRESHOLD = 3
+
+# Test ANY_TADDR special string in z_sendmany
+class WalletSendManyAnyTaddr(BitcoinTestFramework):
+    def setup_nodes(self):
+        return start_nodes(self.num_nodes, self.options.tmpdir,
+            [[
+                "-txexpirydelta=%d" % TX_EXPIRY_DELTA,
+            ]] * self.num_nodes)
+
+    def run_test(self):
+        # Sanity-check the test harness
+        assert_equal(self.nodes[0].getblockcount(), 200)
+
+        # Create the addresses we will be using.
+        recipient = self.nodes[1].z_getnewaddress()
+        node2zaddr = self.nodes[2].z_getnewaddress()
+        node2taddr1 = self.nodes[2].getnewaddress()
+        node3zaddr = self.nodes[3].z_getnewaddress()
+        node3taddr1 = self.nodes[3].getnewaddress()
+        node3taddr2 = self.nodes[3].getnewaddress()
+
+        # Prepare some non-coinbase UTXOs
+        wait_and_assert_operationid_status(
+            self.nodes[3],
+            self.nodes[3].z_shieldcoinbase("*", node3zaddr, 0)['opid'],
+        )
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+        assert_equal(self.nodes[3].z_getbalance(node3zaddr), 250)
+
+        wait_and_assert_operationid_status(
+            self.nodes[3],
+            self.nodes[3].z_sendmany(
+                node3zaddr,
+                [
+                    {'address': node3taddr1, 'amount': 60},
+                    {'address': node3taddr2, 'amount': 75},
+                ],
+                1
+            ),
+        )
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # Check the various balances.
+        assert_equal(self.nodes[1].z_getbalance(recipient), 0)
+        assert_equal(self.nodes[3].z_getbalance(node3taddr1), 60)
+        assert_equal(self.nodes[3].z_getbalance(node3taddr2), 75)
+
+        # We should be able to spend multiple UTXOs at once
+        wait_and_assert_operationid_status(
+            self.nodes[3],
+            self.nodes[3].z_sendmany('ANY_TADDR', [{'address': recipient, 'amount': 100}], 1),
+        )
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # The recipient has their funds!
+        assert_equal(self.nodes[1].z_getbalance(recipient), 100)
+
+        # Change is sent to a new t-address.
+        assert_equal(self.nodes[3].z_getbalance(node3taddr1), 0)
+        assert_equal(self.nodes[3].z_getbalance(node3taddr2), 0)
+
+        # Send from a change t-address.
+        wait_and_assert_operationid_status(
+            self.nodes[3],
+            self.nodes[3].z_sendmany('ANY_TADDR', [{'address': recipient, 'amount': 20}], 1),
+        )
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        # The recipient has their funds!
+        assert_equal(self.nodes[1].z_getbalance(recipient), 120)
+
+        # Check that ANY_TADDR note selection doesn't attempt a double-spend
+        myopid = self.nodes[3].z_sendmany('ANY_TADDR', [{'address': recipient, 'amount': 20}], 1)
+        wait_and_assert_operationid_status(self.nodes[3], myopid, "failed", "Insufficient funds: have 14.99998, need 20.00001")
+
+        # Create an expired transaction on node 3.
+        self.split_network()
+        expire_transparent = self.nodes[3].sendtoaddress(node2taddr1, 14)
+        assert(expire_transparent in self.nodes[3].getrawmempool())
+        self.sync_all()
+        assert_equal('waiting', self.nodes[2].gettransaction(expire_transparent)['status'])
+
+        self.nodes[0].generate(TX_EXPIRY_DELTA + TX_EXPIRING_SOON_THRESHOLD)
+        self.sync_all()
+        connect_nodes_bi(self.nodes, 1, 2)
+        sync_blocks(self.nodes[1:3])
+        assert_equal('expired', self.nodes[2].gettransaction(expire_transparent)['status'])
+
+        # Ensure that node 2 has no transparent funds.
+        self.nodes[2].generate(100) # To ensure node 2's pending coinbase is spendable
+        self.sync_all()
+        wait_and_assert_operationid_status(
+            self.nodes[2],
+            self.nodes[2].z_shieldcoinbase("*", node2zaddr, 0)['opid'],
+        )
+        self.sync_all()
+        assert_equal(0, self.nodes[2].getbalance())
+
+        # Check that ANY_TADDR doesn't select an expired output.
+        wait_and_assert_operationid_status(self.nodes[2], self.nodes[2].z_sendmany('ANY_TADDR', [{'address': recipient, 'amount': 13}]), "failed", "Insufficient funds: have 0.00, need 13.00001")
+
+if __name__ == '__main__':
+    WalletSendManyAnyTaddr().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_shieldcoinbase.py b/depend/zcash/qa/rpc-tests/wallet_shieldcoinbase.py
new file mode 100755
index 000000000..feb4b0aae
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_shieldcoinbase.py
@@ -0,0 +1,193 @@
+#!/usr/bin/env python3
+# Copyright (c) 2017 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.authproxy import JSONRPCException
+from test_framework.util import assert_equal, initialize_chain_clean, \
+    start_node, connect_nodes_bi, sync_blocks, sync_mempools, \
+    wait_and_assert_operationid_status, get_coinbase_address, DEFAULT_FEE, \
+    NU5_BRANCH_ID, nuparams
+
+from decimal import Decimal
+
+class WalletShieldCoinbaseTest (BitcoinTestFramework):
+    def setup_chain(self):
+        print("Initializing test directory "+self.options.tmpdir)
+        initialize_chain_clean(self.options.tmpdir, 4)
+
+    def setup_network(self, split=False):
+        args = [
+            '-regtestprotectcoinbase',
+            '-debug=zrpcunsafe',
+            nuparams(NU5_BRANCH_ID, self.nu5_activation),
+        ]
+        self.nodes = []
+        self.nodes.append(start_node(0, self.options.tmpdir, args))
+        self.nodes.append(start_node(1, self.options.tmpdir, args))
+        self.nodes.append(start_node(2, self.options.tmpdir, args))
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,0,2)
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test (self):
+        print("Mining blocks...")
+
+        self.nodes[0].generate(1)
+        self.nodes[0].generate(4)
+        self.sync_all()
+        walletinfo = self.nodes[0].getwalletinfo()
+        assert_equal(walletinfo['immature_balance'], 50)
+        assert_equal(walletinfo['balance'], 0)
+        self.sync_all()
+        self.nodes[2].generate(1)
+        self.nodes[2].generate(1)
+        self.nodes[2].generate(1)
+        self.sync_all()
+        self.nodes[1].generate(101)
+        self.sync_all()
+        assert_equal(self.nodes[0].getbalance(), 50)
+        assert_equal(self.nodes[1].getbalance(), 10)
+        assert_equal(self.nodes[2].getbalance(), 30)
+
+        # create one zaddr that is the target of all shielding
+        myzaddr = self.test_init_zaddr(self.nodes[0])
+
+        do_not_shield_taddr = get_coinbase_address(self.nodes[0], 1)
+
+        # Prepare to send taddr->zaddr
+        mytaddr = get_coinbase_address(self.nodes[0], 4)
+
+        # Shielding will fail when trying to spend from watch-only address
+        self.nodes[2].importaddress(mytaddr)
+        try:
+            self.nodes[2].z_shieldcoinbase(mytaddr, myzaddr)
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert_equal("Could not find any coinbase funds to shield" in errorString, True)
+
+        # Shielding will fail because fee is negative
+        try:
+            self.nodes[0].z_shieldcoinbase("*", myzaddr, -1)
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert_equal("Amount out of range" in errorString, True)
+
+        # Shielding will fail because fee is larger than MAX_MONEY
+        try:
+            self.nodes[0].z_shieldcoinbase("*", myzaddr, Decimal('21000000.00000001'))
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert_equal("Amount out of range" in errorString, True)
+
+        # Shielding will fail because fee is larger than sum of utxos
+        try:
+            self.nodes[0].z_shieldcoinbase("*", myzaddr, 999)
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert_equal("Insufficient coinbase funds" in errorString, True)
+
+        # Shielding will fail because limit parameter must be at least 0
+        try:
+            self.nodes[0].z_shieldcoinbase("*", myzaddr, Decimal('0.001'), -1)
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert_equal("Limit on maximum number of utxos cannot be negative" in errorString, True)
+
+        # Shielding will fail because limit parameter is absurdly large
+        try:
+            self.nodes[0].z_shieldcoinbase("*", myzaddr, Decimal('0.001'), 99999999999999)
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert_equal("JSON integer out of range" in errorString, True)
+
+        # Shield coinbase utxos from node 0 of value 40, standard fee
+        result = self.nodes[0].z_shieldcoinbase(mytaddr, myzaddr)
+        wait_and_assert_operationid_status(self.nodes[0], result['opid'])
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        # Confirm balances and that do_not_shield_taddr containing funds of 10 was left alone
+        assert_equal(self.nodes[0].getbalance(), 10)
+        assert_equal(self.nodes[0].z_getbalance(do_not_shield_taddr), Decimal('10.0'))
+        self.test_check_balance_zaddr(self.nodes[0], Decimal('40.0') - DEFAULT_FEE)
+        assert_equal(self.nodes[1].getbalance(), 20)
+        assert_equal(self.nodes[2].getbalance(), 30)
+
+        # Shield coinbase utxos from any node 2 taddr, and set fee to 0
+        result = self.nodes[2].z_shieldcoinbase("*", myzaddr, 0)
+        wait_and_assert_operationid_status(self.nodes[2], result['opid'])
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        assert_equal(self.nodes[0].getbalance(), 10)
+        self.test_check_balance_zaddr(self.nodes[0], Decimal('70.0') - DEFAULT_FEE)
+        assert_equal(self.nodes[1].getbalance(), 30)
+        assert_equal(self.nodes[2].getbalance(), 0)
+
+        # Generate 800 coinbase utxos on node 0, and 20 coinbase utxos on node 2
+        self.nodes[0].generate(800)
+        self.sync_all()
+        self.nodes[2].generate(20)
+        self.sync_all()
+        self.nodes[1].generate(100)
+        self.sync_all()
+        mytaddr = get_coinbase_address(self.nodes[0], 800)
+
+        def verify_locking(first, second, limit):
+            result = self.nodes[0].z_shieldcoinbase(mytaddr, myzaddr, 0, limit)
+            assert_equal(result["shieldingUTXOs"], Decimal(first))
+            assert_equal(result["remainingUTXOs"], Decimal(second))
+            remainingValue = result["remainingValue"]
+            opid1 = result['opid']
+
+            # Verify that utxos are locked (not available for selection) by queuing up another shielding operation
+            result = self.nodes[0].z_shieldcoinbase(mytaddr, myzaddr, 0, 0)
+            assert_equal(result["shieldingValue"], Decimal(remainingValue))
+            assert_equal(result["shieldingUTXOs"], Decimal(second))
+            assert_equal(result["remainingValue"], Decimal('0'))
+            assert_equal(result["remainingUTXOs"], Decimal('0'))
+            opid2 = result['opid']
+
+            # wait for both async operations to complete
+            wait_and_assert_operationid_status(self.nodes[0], opid1)
+            wait_and_assert_operationid_status(self.nodes[0], opid2)
+
+        # Shield the 800 utxos over two transactions
+        verify_locking('500', '300', 500)
+
+        # sync_all() invokes sync_mempool() but node 2's mempool limit will cause tx1 and tx2 to be rejected.
+        # So instead, we sync on blocks and mempool for node 0 and node 1, and after a new block is generated
+        # which mines tx1 and tx2, all nodes will have an empty mempool which can then be synced.
+        sync_blocks(self.nodes[:2])
+        sync_mempools(self.nodes[:2])
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        # Verify maximum number of utxos which node 0 can shield is set by default limit parameter of 50
+        self.nodes[0].generate(200)
+        self.sync_all()
+        mytaddr = get_coinbase_address(self.nodes[0], 100)
+        result = self.nodes[0].z_shieldcoinbase(mytaddr, myzaddr, DEFAULT_FEE)
+        assert_equal(result["shieldingUTXOs"], Decimal('50'))
+        assert_equal(result["remainingUTXOs"], Decimal('50'))
+        wait_and_assert_operationid_status(self.nodes[0], result['opid'])
+
+        # Verify maximum number of utxos which node 0 can shield can be set by the limit parameter
+        result = self.nodes[0].z_shieldcoinbase(mytaddr, myzaddr, DEFAULT_FEE, 33)
+        assert_equal(result["shieldingUTXOs"], Decimal('33'))
+        assert_equal(result["remainingUTXOs"], Decimal('17'))
+        wait_and_assert_operationid_status(self.nodes[0], result['opid'])
+        # Don't sync node 2 which rejects the tx due to its mempooltxinputlimit
+        sync_blocks(self.nodes[:2])
+        sync_mempools(self.nodes[:2])
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+# Note, no "if __name__ == '__main__" and call the test here; it's called from
+# pool-specific derived classes in wallet_shieldcoinbase_*.py
\ No newline at end of file
diff --git a/depend/zcash/qa/rpc-tests/wallet_shieldcoinbase_sapling.py b/depend/zcash/qa/rpc-tests/wallet_shieldcoinbase_sapling.py
new file mode 100755
index 000000000..5e3cc2a39
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_shieldcoinbase_sapling.py
@@ -0,0 +1,22 @@
+#!/usr/bin/env python3
+
+from wallet_shieldcoinbase import WalletShieldCoinbaseTest
+from test_framework.util import assert_equal
+
+class WalletShieldCoinbaseSapling(WalletShieldCoinbaseTest):
+    def __init__(self):
+        super(WalletShieldCoinbaseSapling, self).__init__()
+        self.nu5_activation = 99999
+
+    def test_init_zaddr(self, node):
+        self.addr = node.z_getnewaddress('sapling')
+        return self.addr
+
+    def test_check_balance_zaddr(self, node, expected):
+        balance = node.z_getbalance(self.addr)
+        assert_equal(balance, expected)
+
+
+if __name__ == '__main__':
+    print("Test shielding to a sapling address")
+    WalletShieldCoinbaseSapling().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_shieldcoinbase_sprout.py b/depend/zcash/qa/rpc-tests/wallet_shieldcoinbase_sprout.py
new file mode 100755
index 000000000..2e7fc7f7c
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_shieldcoinbase_sprout.py
@@ -0,0 +1,22 @@
+#!/usr/bin/env python3
+
+from wallet_shieldcoinbase import WalletShieldCoinbaseTest
+from test_framework.util import assert_equal
+
+class WalletShieldCoinbaseSprout(WalletShieldCoinbaseTest):
+    def __init__(self):
+        super(WalletShieldCoinbaseSprout, self).__init__()
+        self.nu5_activation = 99999
+
+    def test_init_zaddr(self, node):
+        self.addr = node.z_getnewaddress('sprout')
+        return self.addr
+
+    def test_check_balance_zaddr(self, node, expected):
+        balance = node.z_getbalance(self.addr)
+        assert_equal(balance, expected)
+
+
+if __name__ == '__main__':
+    print("Test shielding to a sapling address")
+    WalletShieldCoinbaseSprout().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_shieldcoinbase_ua_nu5.py b/depend/zcash/qa/rpc-tests/wallet_shieldcoinbase_ua_nu5.py
new file mode 100755
index 000000000..6d472462d
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_shieldcoinbase_ua_nu5.py
@@ -0,0 +1,49 @@
+#!/usr/bin/env python3
+
+from wallet_shieldcoinbase import WalletShieldCoinbaseTest
+from test_framework.util import assert_equal
+from test_framework.mininode import COIN
+
+class WalletShieldCoinbaseUANU5(WalletShieldCoinbaseTest):
+    def __init__(self):
+        super(WalletShieldCoinbaseUANU5, self).__init__()
+        self.account = None
+        # activate after initial setup, before the first z_shieldcoinbase RPC
+        self.nu5_activation = 109
+
+    def test_init_zaddr(self, node):
+        # this function may be called no more than once
+        assert(self.account is None)
+        self.account = node.z_getnewaccount()['account']
+        self.addr = node.z_getaddressforaccount(self.account)['address']
+        return self.addr
+
+    def test_check_balance_zaddr(self, node, expected):
+        balances = node.z_getbalanceforaccount(self.account)
+        assert('transparent' not in balances['pools'])
+        assert('sprout' not in balances['pools'])
+        # Remove the following after Orchard support is added to z_shieldcoinbase
+        sapling_balance = balances['pools']['sapling']['valueZat']
+        assert_equal(sapling_balance, expected * COIN)
+        # TODO: Uncomment after Orchard support is added to z_shieldcoinbase
+        #assert('sapling' not in balances['pools'])
+        #orchard_balance = balances['pools']['orchard']['valueZat']
+        #assert_equal(orchard_balance, expected * COIN)
+
+        # While we're at it, check that z_listunspent only shows outputs with
+        # the Unified Address (not the Orchard receiver), and of the expected
+        # type.
+        unspent = node.z_listunspent(1, 999999, False, [self.addr])
+        assert_equal(
+            # TODO: Fix after Orchard support is added to z_shieldcoinbase
+            #[{'type': 'orchard', 'address': self.addr} for _ in unspent],
+            [{'type': 'sapling', 'address': self.addr} for _ in unspent],
+            [{'type': x['type'], 'address': x['address']} for x in unspent],
+        )
+
+        total_balance = node.z_getbalance(self.addr) * COIN
+        assert_equal(total_balance, sapling_balance)
+
+if __name__ == '__main__':
+    print("Test shielding to a unified address with NU5 activated")
+    WalletShieldCoinbaseUANU5().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_shieldcoinbase_ua_sapling.py b/depend/zcash/qa/rpc-tests/wallet_shieldcoinbase_ua_sapling.py
new file mode 100755
index 000000000..3f1b88e4d
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_shieldcoinbase_ua_sapling.py
@@ -0,0 +1,42 @@
+#!/usr/bin/env python3
+
+from wallet_shieldcoinbase import WalletShieldCoinbaseTest
+from test_framework.util import assert_equal
+from test_framework.mininode import COIN
+
+class WalletShieldCoinbaseUASapling(WalletShieldCoinbaseTest):
+    def __init__(self):
+        super(WalletShieldCoinbaseUASapling, self).__init__()
+        self.account = None
+        self.nu5_activation = 99999
+
+    def test_init_zaddr(self, node):
+        # this function may be called no more than once
+        assert(self.account is None)
+        self.account = node.z_getnewaccount()['account']
+        self.addr = node.z_getaddressforaccount(self.account)['address']
+        return self.addr
+
+    def test_check_balance_zaddr(self, node, expected):
+        balances = node.z_getbalanceforaccount(self.account)
+        assert('transparent' not in balances['pools'])
+        assert('sprout' not in balances['pools'])
+        sapling_balance = balances['pools']['sapling']['valueZat']
+        assert_equal(sapling_balance, expected * COIN)
+        assert('orchard' not in balances['pools'])
+
+        # While we're at it, check that z_listunspent only shows outputs with
+        # the Unified Address (not the Sapling receiver), and of the expected
+        # type.
+        unspent = node.z_listunspent(1, 999999, False, [self.addr])
+        assert_equal(
+            [{'type': 'sapling', 'address': self.addr} for _ in unspent],
+            [{'type': x['type'], 'address': x['address']} for x in unspent],
+        )
+
+        total_balance = node.z_getbalance(self.addr) * COIN
+        assert_equal(total_balance, sapling_balance)
+
+if __name__ == '__main__':
+    print("Test shielding to a unified address with sapling activated (but not NU5)")
+    WalletShieldCoinbaseUASapling().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_shieldingcoinbase.py b/depend/zcash/qa/rpc-tests/wallet_shieldingcoinbase.py
new file mode 100755
index 000000000..c3261993a
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_shieldingcoinbase.py
@@ -0,0 +1,369 @@
+#!/usr/bin/env python3
+# Copyright (c) 2016 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.authproxy import JSONRPCException
+from test_framework.mininode import COIN
+from test_framework.util import assert_equal, initialize_chain_clean, \
+    start_nodes, connect_nodes_bi, wait_and_assert_operationid_status, \
+    wait_and_assert_operationid_status_result, get_coinbase_address, \
+    check_node_log, DEFAULT_FEE
+
+import sys
+import timeit
+from decimal import Decimal
+
+def check_value_pool(node, name, total):
+    value_pools = node.getblockchaininfo()['valuePools']
+    found = False
+    for pool in value_pools:
+        if pool['id'] == name:
+            found = True
+            assert_equal(pool['monitored'], True)
+            assert_equal(pool['chainValue'], total)
+            assert_equal(pool['chainValueZat'], total * COIN)
+    assert(found)
+
+class WalletShieldingCoinbaseTest (BitcoinTestFramework):
+
+    def setup_chain(self):
+        print("Initializing test directory "+self.options.tmpdir)
+        initialize_chain_clean(self.options.tmpdir, 4)
+
+    # Start nodes with -regtestshieldcoinbase to set fCoinbaseMustBeShielded to true.
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(4, self.options.tmpdir, extra_args=[['-regtestshieldcoinbase', '-debug=zrpcunsafe']] * 4 )
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,0,2)
+        connect_nodes_bi(self.nodes,0,3)
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test (self):
+        print("Mining blocks...")
+
+        self.nodes[0].generate(4)
+        self.sync_all()
+
+        walletinfo = self.nodes[0].getwalletinfo()
+        assert_equal(walletinfo['immature_balance'], 40)
+        assert_equal(walletinfo['balance'], 0)
+
+        self.sync_all()
+        self.nodes[1].generate(101)
+        self.sync_all()
+
+        assert_equal(self.nodes[0].getbalance(), 40)
+        assert_equal(self.nodes[1].getbalance(), 10)
+        assert_equal(self.nodes[2].getbalance(), 0)
+        assert_equal(self.nodes[3].getbalance(), 0)
+
+        check_value_pool(self.nodes[0], 'sapling', 0)
+        check_value_pool(self.nodes[1], 'sapling', 0)
+        check_value_pool(self.nodes[2], 'sapling', 0)
+        check_value_pool(self.nodes[3], 'sapling', 0)
+
+        # Send will fail because we are enforcing the consensus rule that
+        # coinbase utxos can only be sent to a zaddr.
+        errorString = ""
+        try:
+            self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(), 1)
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert_equal("Coinbase funds can only be sent to a zaddr" in errorString, True)
+
+        # Prepare to send taddr->zaddr
+        mytaddr = get_coinbase_address(self.nodes[0])
+        myzaddr = self.nodes[0].z_getnewaddress('sapling')
+
+        # Node 3 will test that watch only address utxos are not selected
+        self.nodes[3].importaddress(mytaddr)
+        recipients= [{"address":myzaddr, "amount": Decimal('1')}]
+        try:
+            myopid = self.nodes[3].z_sendmany(mytaddr, recipients)
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert_equal("Invalid from address, no payment source found for address.", errorString);
+
+        # This send will fail because our consensus does not allow transparent change when 
+        # shielding a coinbase utxo. 
+        # TODO: After upgrading to unified address support, change will be sent to the most
+        # recent shielded spend authority corresponding to the account of the source address
+        # and this send will succeed, causing this test to fail.
+        recipients = []
+        recipients.append({"address":myzaddr, "amount":Decimal('1.23456789')})
+
+        myopid = self.nodes[0].z_sendmany(mytaddr, recipients)
+        error_result = wait_and_assert_operationid_status_result(
+                self.nodes[0], 
+                myopid, "failed", 
+                "When shielding coinbase funds, the wallet does not allow any change. The proposed transaction would result in 8.76542211 in change.", 
+                10)
+
+        # Test that the returned status object contains a params field with the operation's input parameters
+        assert_equal(error_result["method"], "z_sendmany")
+        params = error_result["params"]
+        assert_equal(params["fee"], DEFAULT_FEE) # default
+        assert_equal(params["minconf"], Decimal('10')) # default
+        assert_equal(params["fromaddress"], mytaddr)
+        assert_equal(params["amounts"][0]["address"], myzaddr)
+        assert_equal(params["amounts"][0]["amount"], Decimal('1.23456789'))
+
+        # Add viewing key for myzaddr to Node 3
+        myviewingkey = self.nodes[0].z_exportviewingkey(myzaddr)
+        self.nodes[3].z_importviewingkey(myviewingkey, "no")
+
+        # This send will succeed.  We send two coinbase utxos totalling 20.0 less a default fee, with no change.
+        shieldvalue = Decimal('20.0') - DEFAULT_FEE
+        recipients = []
+        recipients.append({"address":myzaddr, "amount": shieldvalue})
+        myopid = self.nodes[0].z_sendmany(mytaddr, recipients)
+        mytxid = wait_and_assert_operationid_status(self.nodes[0], myopid)
+        self.sync_all()
+
+        # Verify that z_listunspent can return a note that has zero confirmations
+        results = self.nodes[0].z_listunspent()
+        assert(len(results) == 0)
+        results = self.nodes[0].z_listunspent(0) # set minconf to zero
+        assert(len(results) == 1)
+        assert_equal(results[0]["type"], "sapling")
+        assert_equal(results[0]["address"], myzaddr)
+        assert_equal(results[0]["amount"], shieldvalue)
+        assert_equal(results[0]["confirmations"], 0)
+
+        # Mine the tx
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        # Verify that z_listunspent returns one note which has been confirmed
+        results = self.nodes[0].z_listunspent()
+        assert(len(results) == 1)
+        assert_equal(results[0]["type"], "sapling")
+        assert_equal(results[0]["address"], myzaddr)
+        assert_equal(results[0]["amount"], shieldvalue)
+        assert_equal(results[0]["confirmations"], 1)
+        assert_equal(results[0]["spendable"], True)
+
+        # Verify that z_listunspent returns note for watchonly address on node 3.
+        results = self.nodes[3].z_listunspent(1, 999, True)
+        assert(len(results) == 1)
+        assert_equal(results[0]["type"], "sapling")
+        assert_equal(results[0]["address"], myzaddr)
+        assert_equal(results[0]["amount"], shieldvalue)
+        assert_equal(results[0]["confirmations"], 1)
+        assert_equal(results[0]["spendable"], False)
+
+        # Verify that z_listunspent returns error when address spending key from node 0 is not available in wallet of node 1.
+        try:
+            results = self.nodes[1].z_listunspent(1, 999, False, [myzaddr])
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert_equal("Invalid parameter, spending key for an address does not belong to the wallet.", errorString)
+
+        # Verify that debug=zrpcunsafe logs params, and that full txid is associated with opid
+        initialized_line = check_node_log(self, 0, myopid + ": z_sendmany initialized", False)
+        finished_line = check_node_log(self, 0, myopid + ": z_sendmany finished", False)
+        assert(initialized_line < finished_line)
+
+        # check balances (the z_sendmany consumes 3 coinbase utxos)
+        resp = self.nodes[0].z_gettotalbalance()
+        assert_equal(Decimal(resp["transparent"]), Decimal('20.0'))
+        assert_equal(Decimal(resp["private"]), Decimal('20.0') - DEFAULT_FEE)
+        assert_equal(Decimal(resp["total"]), Decimal('40.0') - DEFAULT_FEE)
+
+        # The Sprout value pool should reflect the send
+        saplingvalue = shieldvalue
+        check_value_pool(self.nodes[0], 'sapling', saplingvalue)
+
+        # A custom fee of 0 is okay.  Here the node will send the note value back to itself.
+        recipients = []
+        recipients.append({"address":myzaddr, "amount": Decimal('20.0') - DEFAULT_FEE})
+        myopid = self.nodes[0].z_sendmany(myzaddr, recipients, 1, Decimal('0.0'))
+        mytxid = wait_and_assert_operationid_status(self.nodes[0], myopid)
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+        resp = self.nodes[0].z_gettotalbalance()
+        assert_equal(Decimal(resp["transparent"]), Decimal('20.0'))
+        assert_equal(Decimal(resp["private"]), Decimal('20.0') - DEFAULT_FEE)
+        assert_equal(Decimal(resp["total"]), Decimal('40.0') - DEFAULT_FEE)
+
+        # The Sapling value pool should be unchanged
+        check_value_pool(self.nodes[0], 'sapling', saplingvalue)
+
+        # convert note to transparent funds
+        unshieldvalue = Decimal('10.0')
+        recipients = []
+        recipients.append({"address":mytaddr, "amount": unshieldvalue})
+        myopid = self.nodes[0].z_sendmany(myzaddr, recipients, 1)
+        mytxid = wait_and_assert_operationid_status(self.nodes[0], myopid)
+        assert(mytxid is not None)
+        self.sync_all()
+
+        # check that priority of the tx sending from a zaddr is not 0
+        mempool = self.nodes[0].getrawmempool(True)
+        assert(Decimal(mempool[mytxid]['startingpriority']) >= Decimal('1000000000000'))
+
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        # check balances
+        saplingvalue -= unshieldvalue + DEFAULT_FEE
+        resp = self.nodes[0].z_gettotalbalance()
+        assert_equal(Decimal(resp["transparent"]), Decimal('30.0'))
+        assert_equal(Decimal(resp["private"]), Decimal('10.0') - 2*DEFAULT_FEE)
+        assert_equal(Decimal(resp["total"]), Decimal('40.0') - 2*DEFAULT_FEE)
+        check_value_pool(self.nodes[0], 'sapling', saplingvalue)
+
+        # z_sendmany will return an error if there is transparent change output considered dust.
+        # UTXO selection in z_sendmany sorts in ascending order, so smallest utxos are consumed first.
+        # At this point in time, unspent notes all have a value of 10.0.
+        recipients = []
+        amount = Decimal('10.0') - DEFAULT_FEE - Decimal('0.00000001')    # this leaves change at 1 zatoshi less than dust threshold
+        recipients.append({"address":self.nodes[0].getnewaddress(), "amount":amount })
+        myopid = self.nodes[0].z_sendmany(mytaddr, recipients, 1)
+        wait_and_assert_operationid_status(self.nodes[0], myopid, "failed", "Insufficient funds: have 10.00, need 0.00000053 more to avoid creating invalid change output 0.00000001 (dust threshold is 0.00000054)")
+
+        # Send will fail because send amount is too big, even when including coinbase utxos
+        errorString = ""
+        try:
+            self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(), 99999)
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert_equal("Insufficient funds" in errorString, True)
+
+        # z_sendmany will fail because of insufficient funds
+        recipients = []
+        recipients.append({"address":self.nodes[1].getnewaddress(), "amount":Decimal('10000.0')})
+        myopid = self.nodes[0].z_sendmany(mytaddr, recipients, 1)
+        wait_and_assert_operationid_status(self.nodes[0], myopid, "failed", "Insufficient funds: have 10.00, need 10000.00001; note that coinbase outputs will not be selected if you specify ANY_TADDR or if any transparent recipients are included.")
+        myopid = self.nodes[0].z_sendmany(myzaddr, recipients, 1)
+        wait_and_assert_operationid_status(self.nodes[0], myopid, "failed", "Insufficient funds: have 9.99998, need 10000.00001; note that coinbase outputs will not be selected if you specify ANY_TADDR or if any transparent recipients are included.")
+
+        # Send will fail because of insufficient funds unless sender uses coinbase utxos
+        try:
+            self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(), 21)
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert_equal("Insufficient funds, coinbase funds can only be spent after they have been sent to a zaddr" in errorString, True)
+
+        # Verify that mempools accept tx with joinsplits which have at least the default z_sendmany fee.
+        # If this test passes, it confirms that issue #1851 has been resolved, where sending from
+        # a zaddr to 1385 taddr recipients fails because the default fee was considered too low
+        # given the tx size, resulting in mempool rejection.
+        errorString = ''
+        recipients = []
+        num_t_recipients = 2500
+        amount_per_recipient = Decimal('0.00000546') # dust threshold
+        # Note that regtest chainparams does not require standard tx, so setting the amount to be
+        # less than the dust threshold, e.g. 0.00000001 will not result in mempool rejection.
+        start_time = timeit.default_timer()
+        for i in range(0,num_t_recipients):
+            newtaddr = self.nodes[2].getnewaddress()
+            recipients.append({"address":newtaddr, "amount":amount_per_recipient})
+        elapsed = timeit.default_timer() - start_time
+        print("...invoked getnewaddress() {} times in {} seconds".format(num_t_recipients, elapsed))
+
+        # Issue #2263 Workaround START
+        # HTTP connection to node 0 may fall into a state, during the few minutes it takes to process
+        # loop above to create new addresses, that when z_sendmany is called with a large amount of
+        # rpc data in recipients, the connection fails with a 'broken pipe' error.  Making a RPC call
+        # to node 0 before calling z_sendmany appears to fix this issue, perhaps putting the HTTP
+        # connection into a good state to handle a large amount of data in recipients.
+        self.nodes[0].getinfo()
+        # Issue #2263 Workaround END
+
+        myopid = self.nodes[0].z_sendmany(myzaddr, recipients, 1)
+        try:
+            wait_and_assert_operationid_status(self.nodes[0], myopid)
+        except JSONRPCException as e:
+            print("JSONRPC error: "+e.error['message'])
+            assert(False)
+        except Exception as e:
+            print("Unexpected exception caught during testing: ", e.error['message'], str(sys.exc_info()[0]))
+            assert(False)
+
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        # check balance
+        node2balance = amount_per_recipient * num_t_recipients
+        saplingvalue -= node2balance + DEFAULT_FEE
+        assert_equal(self.nodes[2].getbalance(), node2balance)
+        check_value_pool(self.nodes[0], 'sapling', saplingvalue)
+
+        # Send will fail because fee is negative
+        try:
+            self.nodes[0].z_sendmany(myzaddr, recipients, 1, -1)
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert_equal("Amount out of range" in errorString, True)
+
+        # Send will fail because fee is larger than MAX_MONEY
+        try:
+            self.nodes[0].z_sendmany(myzaddr, recipients, 1, Decimal('21000000.00000001'))
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert_equal("Amount out of range" in errorString, True)
+
+        # Send will fail because fee is larger than sum of outputs
+        try:
+            self.nodes[0].z_sendmany(myzaddr, recipients, 1, (amount_per_recipient * num_t_recipients) + Decimal('0.00000001'))
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert_equal("is greater than the sum of outputs" in errorString, True)
+
+        # Send will succeed because the balance of non-coinbase utxos is 10.0
+        try:
+            self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(), 9)
+        except JSONRPCException:
+            assert(False)
+
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        # check balance
+        node2balance = node2balance + 9
+        assert_equal(self.nodes[2].getbalance(), node2balance)
+
+        # Check that chained joinsplits in a single tx are created successfully.
+        recipients = []
+        num_recipients = 3
+        amount_per_recipient = Decimal('0.002')
+        minconf = 1
+        send_amount = num_recipients * amount_per_recipient
+        custom_fee = Decimal('0.00012345')
+        zbalance = self.nodes[0].z_getbalance(myzaddr)
+        for i in range(0,num_recipients):
+            newzaddr = self.nodes[2].z_getnewaddress('sapling')
+            recipients.append({"address":newzaddr, "amount":amount_per_recipient})
+        myopid = self.nodes[0].z_sendmany(myzaddr, recipients, minconf, custom_fee)
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        # check balances and unspent notes
+        resp = self.nodes[2].z_gettotalbalance()
+        assert_equal(Decimal(resp["private"]), send_amount)
+
+        notes = self.nodes[2].z_listunspent()
+        sum_of_notes = sum([note["amount"] for note in notes])
+        assert_equal(Decimal(resp["private"]), sum_of_notes)
+
+        resp = self.nodes[0].z_getbalance(myzaddr)
+        assert_equal(Decimal(resp), zbalance - custom_fee - send_amount)
+        saplingvalue -= custom_fee
+        check_value_pool(self.nodes[0], 'sapling', saplingvalue)
+
+        notes = self.nodes[0].z_listunspent(1, 99999, False, [myzaddr])
+        sum_of_notes = sum([note["amount"] for note in notes])
+        assert_equal(Decimal(resp), sum_of_notes)
+
+if __name__ == '__main__':
+    WalletShieldingCoinbaseTest().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_treestate.py b/depend/zcash/qa/rpc-tests/wallet_treestate.py
new file mode 100755
index 000000000..c51097bb9
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_treestate.py
@@ -0,0 +1,105 @@
+#!/usr/bin/env python3
+# Copyright (c) 2016 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, initialize_chain_clean, \
+    start_nodes, connect_nodes_bi, wait_and_assert_operationid_status, \
+    get_coinbase_address, DEFAULT_FEE
+
+import time
+from decimal import Decimal
+
+class WalletTreeStateTest (BitcoinTestFramework):
+
+    def setup_chain(self):
+        print("Initializing test directory "+self.options.tmpdir)
+        initialize_chain_clean(self.options.tmpdir, 4)
+
+    # Start nodes with -regtestshieldcoinbase to set fCoinbaseMustBeShielded to true.
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(3, self.options.tmpdir, extra_args=[['-regtestshieldcoinbase','-debug=zrpc']] * 3 )
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,0,2)
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test (self):
+        print("Mining blocks...")
+
+        self.nodes[0].generate(100)
+        self.sync_all()
+        self.nodes[1].generate(101)
+        self.sync_all()
+
+        mytaddr = get_coinbase_address(self.nodes[0])
+        myzaddr = self.nodes[0].z_getnewaddress()
+
+        # Spend coinbase utxos to create three notes of 10 ZEC minus default fee each
+        recipients = []
+        recipients.append({"address": myzaddr, "amount": Decimal('10.0') - DEFAULT_FEE})
+        myopid = self.nodes[0].z_sendmany(mytaddr, recipients)
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+        myopid = self.nodes[0].z_sendmany(mytaddr, recipients)
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+        myopid = self.nodes[0].z_sendmany(mytaddr, recipients)
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        # Check balance
+        resp = self.nodes[0].z_getbalance(myzaddr)
+        assert_equal(Decimal(resp), (Decimal('10.0') - DEFAULT_FEE) * 3)
+
+        # We want to test a real-world situation where during the time spent creating a transaction
+        # with joinsplits, other transactions containing joinsplits have been mined into new blocks,
+        # which result in the treestate changing whilst creating the transaction.
+
+        # Tx 1 will change the treestate while Tx 2 containing chained joinsplits is still being generated
+        recipients = []
+        recipients.append({"address": self.nodes[2].z_getnewaddress(), "amount": Decimal('10.0') - DEFAULT_FEE})
+        myopid = self.nodes[0].z_sendmany(mytaddr, recipients)
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+
+        # Tx 2 will consume all three notes, which must take at least two joinsplits.  This is regardless of
+        # the z_sendmany implementation because there are only two inputs per joinsplit.
+        recipients = []
+        recipients.append({"address": self.nodes[2].z_getnewaddress(), "amount": Decimal('18.0')})
+        recipients.append({"address": self.nodes[2].z_getnewaddress(), "amount": Decimal('12.0') - 4*DEFAULT_FEE})
+        myopid = self.nodes[0].z_sendmany(myzaddr, recipients, 1)
+
+        # Wait for Tx 2 to begin executing...
+        for x in range(1, 60):
+            results = self.nodes[0].z_getoperationstatus([myopid])
+            status = results[0]["status"]
+            if status == "executing":
+                break
+            time.sleep(1)
+
+        # Now mine Tx 1 which will change global treestate before Tx 2's second joinsplit begins processing
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        # Wait for Tx 2 to be created
+        wait_and_assert_operationid_status(self.nodes[0], myopid)
+
+        # Note that a bug existed in v1.0.0-1.0.3 where Tx 2 creation would fail with an error:
+        # "Witness for spendable note does not have same anchor as change input"
+
+        # Check balance
+        resp = self.nodes[0].z_getbalance(myzaddr)
+        assert_equal(Decimal(resp), Decimal('0.0'))
+
+
+if __name__ == '__main__':
+    WalletTreeStateTest().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_unified_change.py b/depend/zcash/qa/rpc-tests/wallet_unified_change.py
new file mode 100755
index 000000000..1384d642d
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_unified_change.py
@@ -0,0 +1,115 @@
+#!/usr/bin/env python3
+# Copyright (c) 2022 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from decimal import Decimal
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    DEFAULT_FEE,
+    NU5_BRANCH_ID,
+    assert_equal,
+    get_coinbase_address,
+    nuparams,
+    start_nodes,
+    wait_and_assert_operationid_status,
+)
+
+# Test wallet accounts behaviour
+class WalletUnifiedChangeTest(BitcoinTestFramework):
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 4
+
+    def setup_nodes(self):
+        return start_nodes(self.num_nodes, self.options.tmpdir, [[
+            nuparams(NU5_BRANCH_ID, 201),
+        ]] * self.num_nodes)
+
+    def run_test(self):
+        # Activate Nu5
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        account0 = self.nodes[0].z_getnewaccount()['account']
+        ua0_sapling = self.nodes[0].z_getaddressforaccount(account0, ['sapling'])['address']
+        ua0_orchard = self.nodes[0].z_getaddressforaccount(account0, ['orchard'])['address']
+
+        account1 = self.nodes[1].z_getnewaccount()['account']
+        ua1_sapling = self.nodes[1].z_getaddressforaccount(account1, ['sapling'])['address']
+        ua1 = self.nodes[1].z_getaddressforaccount(account1)['address']
+
+        # Fund both of ua0_sapling and ua0_orchard
+        recipients = [{'address': ua0_sapling, 'amount': Decimal('9.99999000')}]
+        opid = self.nodes[0].z_sendmany(get_coinbase_address(self.nodes[0]), recipients, 1, DEFAULT_FEE, 'AllowRevealedSenders')
+        wait_and_assert_operationid_status(self.nodes[0], opid)
+
+        recipients = [{'address': ua0_orchard, 'amount': Decimal('9.99999000')}]
+        opid = self.nodes[0].z_sendmany(get_coinbase_address(self.nodes[0]), recipients, 1, DEFAULT_FEE, 'AllowRevealedSenders')
+        wait_and_assert_operationid_status(self.nodes[0], opid)
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        assert_equal(
+                {'pools': {'sapling': {'valueZat': 999999000}, 'orchard': {'valueZat': 999999000}}, 'minimum_confirmations': 1},
+                self.nodes[0].z_getbalanceforaccount(account0))
+
+        # Send both amounts to ua1 in fully-shielded transactions. This will result
+        # in account1 having both Sapling and Orchard balances.
+
+        recipients = [{'address': ua1_sapling, 'amount': 5}]
+        opid = self.nodes[0].z_sendmany(ua0_sapling, recipients, 1, DEFAULT_FEE)
+        txid_sapling = wait_and_assert_operationid_status(self.nodes[0], opid)
+
+        recipients = [{'address': ua1, 'amount': 5}]
+        opid = self.nodes[0].z_sendmany(ua0_orchard, recipients, 1, DEFAULT_FEE)
+        txid_orchard = wait_and_assert_operationid_status(self.nodes[0], opid)
+
+        assert_equal(set([txid_sapling, txid_orchard]), set(self.nodes[0].getrawmempool()))
+
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        assert_equal([], self.nodes[0].getrawmempool())
+        assert_equal(1, self.nodes[0].gettransaction(txid_orchard)['confirmations'])
+        assert_equal(1, self.nodes[0].gettransaction(txid_sapling)['confirmations'])
+
+        assert_equal(
+                {'pools': {'sapling': {'valueZat': 500000000}, 'orchard': {'valueZat': 500000000}}, 'minimum_confirmations': 1},
+                self.nodes[1].z_getbalanceforaccount(account1))
+
+        # Now send sapling->sapling, generating change.
+        recipients = [{'address': ua0_sapling, 'amount': Decimal('2.5')}]
+        opid = self.nodes[1].z_sendmany(ua1_sapling, recipients, 1, 0)
+        txid_sapling = wait_and_assert_operationid_status(self.nodes[1], opid)
+
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        # Since this is entirely sapling->sapling, change should be returned
+        # to the Sapling pool.
+        assert_equal(
+                {'pools': {'sapling': {'valueZat': 250000000}, 'orchard': {'valueZat': 500000000}}, 'minimum_confirmations': 1},
+                self.nodes[1].z_getbalanceforaccount(account1))
+
+        # If we send from an unrestricted UA, change should still not cross
+        # the pool boundary, since we can build a purely sapling->sapling tx.
+        recipients = [{'address': ua0_sapling, 'amount': Decimal('1.25')}]
+        opid = self.nodes[1].z_sendmany(ua1, recipients, 1, 0)
+        txid_sapling = wait_and_assert_operationid_status(self.nodes[1], opid)
+
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        assert_equal(
+                {'pools': {'sapling': {'valueZat': 125000000}, 'orchard': {'valueZat': 500000000}}, 'minimum_confirmations': 1},
+                self.nodes[1].z_getbalanceforaccount(account1))
+
+if __name__ == '__main__':
+    WalletUnifiedChangeTest().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_z_sendmany.py b/depend/zcash/qa/rpc-tests/wallet_z_sendmany.py
new file mode 100755
index 000000000..436e983be
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_z_sendmany.py
@@ -0,0 +1,448 @@
+#!/usr/bin/env python3
+# Copyright (c) 2020 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    DEFAULT_FEE,
+    NU5_BRANCH_ID,
+    assert_equal,
+    assert_greater_than,
+    assert_raises_message,
+    connect_nodes_bi,
+    nuparams,
+    start_nodes,
+    wait_and_assert_operationid_status,
+)
+from test_framework.authproxy import JSONRPCException
+from test_framework.mininode import COIN
+from decimal import Decimal
+
+# Test wallet address behaviour across network upgrades
+class WalletZSendmanyTest(BitcoinTestFramework):
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(3, self.options.tmpdir, [[
+            nuparams(NU5_BRANCH_ID, 238),
+        ]] * self.num_nodes)
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,0,2)
+        self.is_network_split=False
+        self.sync_all()
+
+    # Check we only have balances in the expected pools.
+    # Remember that empty pools are omitted from the output.
+    def _check_balance_for_rpc(self, rpcmethod, node, account, expected, minconf):
+        rpc = getattr(self.nodes[node], rpcmethod)
+        actual = rpc(account, minconf)
+        assert_equal(set(expected), set(actual['pools']))
+        total_balance = 0
+        for pool in expected:
+            assert_equal(expected[pool] * COIN, actual['pools'][pool]['valueZat'])
+            total_balance += expected[pool]
+        assert_equal(actual['minimum_confirmations'], minconf)
+        return total_balance
+
+    def check_balance(self, node, account, address, expected, minconf=1):
+        acct_balance = self._check_balance_for_rpc('z_getbalanceforaccount', node, account, expected, minconf)
+        z_getbalance = self.nodes[node].z_getbalance(address, minconf)
+        assert_equal(acct_balance, z_getbalance)
+        fvk = self.nodes[node].z_exportviewingkey(address)
+        self._check_balance_for_rpc('z_getbalanceforviewingkey', node, fvk, expected, minconf)
+
+    def run_test(self):
+        # z_sendmany is expected to fail if tx size breaks limit
+        myzaddr = self.nodes[0].z_getnewaddress()
+
+        recipients = []
+        num_t_recipients = 1000
+        num_z_recipients = 2100
+        amount_per_recipient = Decimal('0.00000001')
+        errorString = ''
+        for i in range(0,num_t_recipients):
+            newtaddr = self.nodes[2].getnewaddress()
+            recipients.append({"address":newtaddr, "amount":amount_per_recipient})
+        for i in range(0,num_z_recipients):
+            newzaddr = self.nodes[2].z_getnewaddress()
+            recipients.append({"address":newzaddr, "amount":amount_per_recipient})
+
+        # Issue #2759 Workaround START
+        # HTTP connection to node 0 may fall into a state, during the few minutes it takes to process
+        # loop above to create new addresses, that when z_sendmany is called with a large amount of
+        # rpc data in recipients, the connection fails with a 'broken pipe' error.  Making a RPC call
+        # to node 0 before calling z_sendmany appears to fix this issue, perhaps putting the HTTP
+        # connection into a good state to handle a large amount of data in recipients.
+        self.nodes[0].getinfo()
+        # Issue #2759 Workaround END
+
+        try:
+            self.nodes[0].z_sendmany(myzaddr, recipients)
+        except JSONRPCException as e:
+            errorString = e.error['message']
+        assert("size of raw transaction would be larger than limit" in errorString)
+
+        # add zaddr to node 2
+        myzaddr = self.nodes[2].z_getnewaddress()
+
+        # add taddr to node 2
+        mytaddr = self.nodes[2].getnewaddress()
+
+        # send from node 0 to node 2 taddr
+        mytxid = self.nodes[0].sendtoaddress(mytaddr, 10.0)
+        self.sync_all()
+        self.nodes[0].generate(10)
+        self.sync_all()
+
+        # send node 2 taddr to zaddr
+        recipients = []
+        recipients.append({"address":myzaddr, "amount":7})
+        opid = self.nodes[2].z_sendmany(mytaddr, recipients)
+        mytxid = wait_and_assert_operationid_status(self.nodes[2], opid)
+
+        self.sync_all()
+
+        # check balances
+        zsendmanynotevalue = Decimal('7.0')
+        zsendmanyfee = DEFAULT_FEE
+        node2utxobalance = Decimal('260.00000000') - zsendmanynotevalue - zsendmanyfee
+
+        # check shielded balance status with getwalletinfo
+        wallet_info = self.nodes[2].getwalletinfo()
+        assert_equal(Decimal(wallet_info["shielded_unconfirmed_balance"]), zsendmanynotevalue)
+        assert_equal(Decimal(wallet_info["shielded_balance"]), Decimal('0.0'))
+
+        self.nodes[2].generate(10)
+        self.sync_all()
+
+        assert_equal(self.nodes[2].getbalance(), node2utxobalance)
+        assert_equal(self.nodes[2].getbalance("*"), node2utxobalance)
+
+        # check zaddr balance with z_getbalance
+        zbalance = zsendmanynotevalue
+        assert_equal(self.nodes[2].z_getbalance(myzaddr), zbalance)
+
+        # check via z_gettotalbalance
+        resp = self.nodes[2].z_gettotalbalance()
+        assert_equal(Decimal(resp["transparent"]), node2utxobalance)
+        assert_equal(Decimal(resp["private"]), zbalance)
+        assert_equal(Decimal(resp["total"]), node2utxobalance + zbalance)
+
+        # check confirmed shielded balance with getwalletinfo
+        wallet_info = self.nodes[2].getwalletinfo()
+        assert_equal(Decimal(wallet_info["shielded_unconfirmed_balance"]), Decimal('0.0'))
+        assert_equal(Decimal(wallet_info["shielded_balance"]), zsendmanynotevalue)
+
+        # there should be at least one Sapling output
+        mytxdetails = self.nodes[2].getrawtransaction(mytxid, 1)
+        assert_greater_than(len(mytxdetails["vShieldedOutput"]), 0)
+        # the Sapling output should take in all the public value
+        assert_equal(mytxdetails["valueBalance"], -zsendmanynotevalue)
+
+        # send from private note to node 0 and node 2
+        node0balance = self.nodes[0].getbalance()
+        # The following assertion fails nondeterministically
+        # assert_equal(node0balance, Decimal('25.99798873'))
+        node2balance = self.nodes[2].getbalance()
+        # The following assertion might fail nondeterministically
+        # assert_equal(node2balance, Decimal('16.99799000'))
+
+        recipients = []
+        recipients.append({"address":self.nodes[0].getnewaddress(), "amount":1})
+        recipients.append({"address":self.nodes[2].getnewaddress(), "amount":1.0})
+
+        opid = self.nodes[2].z_sendmany(myzaddr, recipients)
+        wait_and_assert_operationid_status(self.nodes[2], opid)
+        zbalance -= Decimal('2.0') + zsendmanyfee
+
+        self.sync_all()
+        self.nodes[2].generate(1)
+        self.sync_all()
+
+        node0balance += Decimal('11.0')
+        node2balance += Decimal('1.0')
+        assert_equal(Decimal(self.nodes[0].getbalance()), node0balance)
+        assert_equal(Decimal(self.nodes[0].getbalance("*")), node0balance)
+        assert_equal(Decimal(self.nodes[2].getbalance()), node2balance)
+        assert_equal(Decimal(self.nodes[2].getbalance("*")), node2balance)
+
+        # Get a new unified account on node 2 & generate a UA
+        n0account0 = self.nodes[0].z_getnewaccount()['account']
+        n0ua0 = self.nodes[0].z_getaddressforaccount(n0account0)['address']
+
+        # Change went to a fresh address, so use `ANY_TADDR` which
+        # should hold the rest of our transparent funds.
+        source = 'ANY_TADDR'
+        recipients = []
+        recipients.append({"address":n0ua0, "amount":10})
+
+        # If we attempt to spend with the default privacy policy, z_sendmany
+        # fails because it needs to spend transparent coins in a transaction
+        # involving a Unified Address.
+        revealed_senders_msg = 'This transaction requires selecting transparent coins, which is not enabled by default because it will publicly reveal transaction senders and amounts. THIS MAY AFFECT YOUR PRIVACY. Resubmit with the `privacyPolicy` parameter set to `AllowRevealedSenders` or weaker if you wish to allow this transaction to proceed anyway.'
+        opid = self.nodes[2].z_sendmany(source, recipients, 1, 0)
+        wait_and_assert_operationid_status(self.nodes[2], opid, 'failed', revealed_senders_msg)
+
+        # We can't create a transaction with an unknown privacy policy.
+        assert_raises_message(
+            JSONRPCException,
+            'Unknown privacy policy name \'ZcashIsAwesome\'',
+            self.nodes[2].z_sendmany,
+            source, recipients, 1, 0, 'ZcashIsAwesome')
+
+        # If we set any policy that does not include AllowRevealedSenders,
+        # z_sendmany also fails.
+        for policy in [
+            'FullPrivacy',
+            'AllowRevealedAmounts',
+            'AllowRevealedRecipients',
+        ]:
+            opid = self.nodes[2].z_sendmany(source, recipients, 1, 0, policy)
+            wait_and_assert_operationid_status(self.nodes[2], opid, 'failed', revealed_senders_msg)
+
+        # By setting the correct policy, we can create the transaction.
+        opid = self.nodes[2].z_sendmany(source, recipients, 1, 0, 'AllowRevealedSenders')
+        wait_and_assert_operationid_status(self.nodes[2], opid)
+
+        self.nodes[2].generate(1)
+        self.sync_all()
+
+        node2balance -= Decimal('10.0')
+        node0balance += Decimal('10.0')
+        assert_equal(Decimal(self.nodes[2].getbalance()), node2balance)
+        assert_equal(Decimal(self.nodes[0].getbalance()), node0balance)
+        self.check_balance(0, 0, n0ua0, {'sapling': 10})
+
+        # Send some funds to a specific legacy taddr that we can spend from
+        recipients = []
+        recipients.append({"address":mytaddr, "amount":5})
+
+        # If we attempt to spend with the default privacy policy, z_sendmany
+        # returns an error because it needs to create a transparent recipient in
+        # a transaction involving a Unified Address.
+        revealed_recipients_msg = "This transaction would have transparent recipients, which is not enabled by default because it will publicly reveal transaction recipients and amounts. THIS MAY AFFECT YOUR PRIVACY. Resubmit with the `privacyPolicy` parameter set to `AllowRevealedRecipients` or weaker if you wish to allow this transaction to proceed anyway."
+        opid = self.nodes[0].z_sendmany(n0ua0, recipients, 1, 0)
+        wait_and_assert_operationid_status(self.nodes[0], opid, 'failed', revealed_recipients_msg)
+
+        # If we set any policy that does not include AllowRevealedRecipients,
+        # z_sendmany also returns an error.
+        for policy in [
+            'FullPrivacy',
+            'AllowRevealedAmounts',
+            'AllowRevealedSenders',
+            'AllowLinkingAccountAddresses',
+        ]:
+            opid = self.nodes[0].z_sendmany(n0ua0, recipients, 1, 0, policy)
+            wait_and_assert_operationid_status(self.nodes[0], opid, 'failed', revealed_recipients_msg)
+
+        # By setting the correct policy, we can create the transaction.
+        opid = self.nodes[0].z_sendmany(n0ua0, recipients, 1, 0, 'AllowRevealedRecipients')
+        wait_and_assert_operationid_status(self.nodes[0], opid)
+
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        node2balance += Decimal('5.0')
+        self.check_balance(0, 0, n0ua0, {'sapling': 5})
+        assert_equal(Decimal(self.nodes[2].getbalance()), node2balance)
+
+        # Send some funds to a legacy sapling address that we can spend from
+        recipients = []
+        recipients.append({"address":myzaddr, "amount":3})
+        opid = self.nodes[0].z_sendmany(n0ua0, recipients, 1, 0)
+        wait_and_assert_operationid_status(self.nodes[0], opid)
+
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        zbalance += Decimal('3.0')
+        self.check_balance(0, 0, n0ua0, {'sapling': 2})
+        assert_equal(Decimal(self.nodes[2].z_getbalance(myzaddr)), zbalance)
+
+        # Send funds back from the legacy taddr to the UA. This requires
+        # AllowRevealedSenders, but we can also use any weaker policy that
+        # includes it.
+        recipients = []
+        recipients.append({"address":n0ua0, "amount":4})
+        opid = self.nodes[2].z_sendmany(mytaddr, recipients, 1, 0, 'AllowFullyTransparent')
+        wait_and_assert_operationid_status(self.nodes[2], opid)
+
+        self.nodes[2].generate(1)
+        self.sync_all()
+
+        node2balance -= Decimal('4.0')
+        self.check_balance(0, 0, n0ua0, {'sapling': 6})
+        assert_equal(Decimal(self.nodes[2].getbalance()), node2balance)
+
+        # Send funds back from the legacy zaddr to the UA
+        recipients = []
+        recipients.append({"address":n0ua0, "amount":2})
+        opid = self.nodes[2].z_sendmany(myzaddr, recipients, 1, 0)
+        wait_and_assert_operationid_status(self.nodes[2], opid)
+
+        self.nodes[2].generate(1)
+        self.sync_all()
+
+        zbalance -= Decimal('2.0')
+        self.check_balance(0, 0, n0ua0, {'sapling': 8})
+        assert_equal(Decimal(self.nodes[2].z_getbalance(myzaddr)), zbalance)
+
+        #
+        # Test that z_sendmany avoids UA linkability unless we allow it.
+        #
+
+        # Generate a new account with two new addresses.
+        n1account = self.nodes[1].z_getnewaccount()['account']
+        n1ua0 = self.nodes[1].z_getaddressforaccount(n1account)['address']
+        n1ua1 = self.nodes[1].z_getaddressforaccount(n1account)['address']
+
+        # Send funds to the transparent receivers of both addresses.
+        for ua in [n1ua0, n1ua1]:
+            taddr = self.nodes[1].z_listunifiedreceivers(ua)['p2pkh']
+            self.nodes[0].sendtoaddress(taddr, 2)
+
+        self.sync_all()
+        self.nodes[2].generate(1)
+        self.sync_all()
+
+        # The account should see all funds.
+        assert_equal(
+            self.nodes[1].z_getbalanceforaccount(n1account)['pools'],
+            {'transparent': {'valueZat': 4 * COIN}},
+        )
+
+        # The addresses should see only the transparent funds sent to them.
+        assert_equal(self.nodes[1].z_getbalance(n1ua0), 2)
+        assert_equal(self.nodes[1].z_getbalance(n1ua1), 2)
+
+        # If we try to send 3 ZEC from n1ua0, it will fail with too-few funds.
+        recipients = [{"address":n0ua0, "amount":3}]
+        linked_addrs_msg = 'Insufficient funds: have 2.00, need 3.00 (This transaction may require selecting transparent coins that were sent to multiple Unified Addresses, which is not enabled by default because it would create a public link between the transparent receivers of these addresses. THIS MAY AFFECT YOUR PRIVACY. Resubmit with the `privacyPolicy` parameter set to `AllowLinkingAccountAddresses` or weaker if you wish to allow this transaction to proceed anyway.)'
+        opid = self.nodes[1].z_sendmany(n1ua0, recipients, 1, 0)
+        wait_and_assert_operationid_status(self.nodes[1], opid, 'failed', linked_addrs_msg)
+
+        # If we try it again with any policy that is too strong, it also fails.
+        for policy in [
+            'FullPrivacy',
+            'AllowRevealedAmounts',
+            'AllowRevealedRecipients',
+            'AllowRevealedSenders',
+            'AllowFullyTransparent',
+        ]:
+            opid = self.nodes[1].z_sendmany(n1ua0, recipients, 1, 0, policy)
+            wait_and_assert_operationid_status(self.nodes[1], opid, 'failed', linked_addrs_msg)
+
+        # Once we provide a sufficiently-weak policy, the transaction succeeds.
+        opid = self.nodes[1].z_sendmany(n1ua0, recipients, 1, 0, 'AllowLinkingAccountAddresses')
+        wait_and_assert_operationid_status(self.nodes[1], opid)
+
+        self.sync_all()
+        self.nodes[2].generate(1)
+        self.sync_all()
+
+        # The account should see the remaining funds, and they should have been
+        # sent to the Sapling change address (because NU5 is not active).
+        assert_equal(
+            self.nodes[1].z_getbalanceforaccount(n1account)['pools'],
+            {'sapling': {'valueZat': 1 * COIN}},
+        )
+
+        # The addresses should both show the same balance, as they both show the
+        # Sapling balance.
+        assert_equal(self.nodes[1].z_getbalance(n1ua0), 1)
+        assert_equal(self.nodes[1].z_getbalance(n1ua1), 1)
+
+        #
+        # Test NoPrivacy policy
+        #
+
+        # Send some legacy transparent funds to n1ua0, creating Sapling outputs.
+        recipients = [{"address":n1ua0, "amount":10}]
+        # This requires the AllowRevealedSenders policy...
+        opid = self.nodes[2].z_sendmany('ANY_TADDR', recipients, 1, 0)
+        wait_and_assert_operationid_status(self.nodes[2], opid, 'failed', revealed_senders_msg)
+        # ... which we can always override with the NoPrivacy policy.
+        opid = self.nodes[2].z_sendmany('ANY_TADDR', recipients, 1, 0, 'NoPrivacy')
+        wait_and_assert_operationid_status(self.nodes[2], opid)
+
+        self.sync_all()
+        self.nodes[2].generate(1)
+        self.sync_all()
+
+        # Send some funds from node 1's account to a transparent address.
+        recipients = [{"address":mytaddr, "amount":5}]
+        # This requires the AllowRevealedRecipients policy...
+        opid = self.nodes[1].z_sendmany(n1ua0, recipients, 1, 0)
+        wait_and_assert_operationid_status(self.nodes[1], opid, 'failed', revealed_recipients_msg)
+        # ... which we can always override with the NoPrivacy policy.
+        opid = self.nodes[1].z_sendmany(n1ua0, recipients, 1, 0, 'NoPrivacy')
+        wait_and_assert_operationid_status(self.nodes[1], opid)
+
+        # Activate NU5
+
+        self.sync_all()
+        self.nodes[1].generate(10)
+        self.sync_all()
+
+        #
+        # Test AllowRevealedAmounts policy
+        #
+
+        assert_equal(
+                {'pools': {'sapling': {'valueZat': 600000000}}, 'minimum_confirmations': 1},
+                self.nodes[1].z_getbalanceforaccount(n1account))
+
+        # Sending some funds to the Orchard pool in n0account0 ...
+        n0ua1 = self.nodes[0].z_getaddressforaccount(n0account0, ["orchard"])['address']
+        recipients = [{"address":n0ua1, "amount": 6}]
+
+        # Should fail under default and 'FullPrivacy' policies ... 
+        revealed_amounts_msg = 'Sending from the Sapling shielded pool to the Orchard shielded pool is not enabled by default because it will publicly reveal the transaction amount. THIS MAY AFFECT YOUR PRIVACY. Resubmit with the `privacyPolicy` parameter set to `AllowRevealedAmounts` or weaker if you wish to allow this transaction to proceed anyway.'
+        opid = self.nodes[1].z_sendmany(n1ua0, recipients, 1, 0)
+        wait_and_assert_operationid_status(self.nodes[1], opid, 'failed', revealed_amounts_msg)
+
+        opid = self.nodes[1].z_sendmany(n1ua0, recipients, 1, 0, 'FullPrivacy')
+        wait_and_assert_operationid_status(self.nodes[1], opid, 'failed', revealed_amounts_msg)
+
+        # Should succeed under 'AllowRevealedAmounts'
+        opid = self.nodes[1].z_sendmany(n1ua0, recipients, 1, 0, 'AllowRevealedAmounts')
+        wait_and_assert_operationid_status(self.nodes[1], opid)
+
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        assert_equal(
+                {'pools': {'sapling': {'valueZat': 1100000000}, 'orchard': {'valueZat': 600000000}}, 'minimum_confirmations': 1},
+                self.nodes[0].z_getbalanceforaccount(n0account0))
+
+        # A total that requires selecting from both pools should fail under default and
+        # FullPrivacy policies...
+
+        recipients = [{"address":n1ua0, "amount": 15}]
+        opid = self.nodes[0].z_sendmany(n0ua0, recipients, 1, 0)
+        wait_and_assert_operationid_status(self.nodes[0], opid, 'failed', revealed_amounts_msg)
+
+        opid = self.nodes[0].z_sendmany(n0ua0, recipients, 1, 0, 'FullPrivacy')
+        wait_and_assert_operationid_status(self.nodes[0], opid, 'failed', revealed_amounts_msg)
+
+        # Should succeed under 'AllowRevealedAmounts'
+        opid = self.nodes[0].z_sendmany(n0ua0, recipients, 1, 0, 'AllowRevealedAmounts')
+        wait_and_assert_operationid_status(self.nodes[0], opid)
+
+        self.sync_all()
+        self.nodes[1].generate(1)
+        self.sync_all()
+
+        # All funds should be received to the Orchard pool
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': 1500000000}}, 'minimum_confirmations': 1},
+                self.nodes[1].z_getbalanceforaccount(n1account))
+
+        # And all change should be optimistically shielded
+        assert_equal(
+                {'pools': {'orchard': {'valueZat': 200000000}}, 'minimum_confirmations': 1},
+                self.nodes[0].z_getbalanceforaccount(n0account0))
+
+if __name__ == '__main__':
+    WalletZSendmanyTest().main()
diff --git a/depend/zcash/qa/rpc-tests/wallet_zero_value.py b/depend/zcash/qa/rpc-tests/wallet_zero_value.py
new file mode 100755
index 000000000..00b1d76c2
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/wallet_zero_value.py
@@ -0,0 +1,49 @@
+#!/usr/bin/env python3
+# Copyright (c) 2020 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, connect_nodes_bi, start_nodes
+from decimal import Decimal
+
+# Test wallet address behaviour across network upgrades
+class WalletZeroValueTest(BitcoinTestFramework):
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(2, self.options.tmpdir)
+        connect_nodes_bi(self.nodes,0,1)
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test(self):
+        #check if we can list zero value tx as available coins
+        #1. create rawtx
+        #2. hex-changed one output to 0.0
+        #3. sign and send
+        #4. check if recipient (node0) can list the zero value tx
+        usp = self.nodes[1].listunspent()
+        inputs = [{"txid":usp[0]['txid'], "vout":usp[0]['vout']}]
+        outputs = {self.nodes[1].getnewaddress(): 9.998, self.nodes[0].getnewaddress(): 11.11}
+
+        rawTx = self.nodes[1].createrawtransaction(inputs, outputs).replace("c0833842", "00000000") #replace 11.11 with 0.0 (int32)
+        decRawTx = self.nodes[1].decoderawtransaction(rawTx)
+        signedRawTx = self.nodes[1].signrawtransaction(rawTx)
+        decRawTx = self.nodes[1].decoderawtransaction(signedRawTx['hex'])
+        zeroValueTxid= decRawTx['txid']
+        self.nodes[1].sendrawtransaction(signedRawTx['hex'])
+
+        self.sync_all()
+        self.nodes[1].generate(1) #mine a block
+        self.sync_all()
+
+        unspentTxs = self.nodes[0].listunspent() #zero value tx must be in listunspents output
+        found = False
+        for uTx in unspentTxs:
+            if uTx['txid'] == zeroValueTxid:
+                found = True
+                assert_equal(uTx['amount'], Decimal('0.00000000'))
+                assert_equal(uTx['amountZat'], 0)
+        assert(found)
+
+if __name__ == '__main__':
+    WalletZeroValueTest().main()
diff --git a/depend/zcash/qa/rpc-tests/walletbackup.py b/depend/zcash/qa/rpc-tests/walletbackup.py
new file mode 100755
index 000000000..ee2f88460
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/walletbackup.py
@@ -0,0 +1,247 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+"""
+Exercise the wallet backup code.  Ported from walletbackup.sh.
+
+Test case is:
+4 nodes. 1 2 and 3 send transactions between each other,
+fourth node is a miner.
+1 2 3 each mine a block to start, then
+Miner creates 100 blocks so 1 2 3 each have 40 mature
+coins to spend.
+Then 5 iterations of 1/2/3 sending coins amongst
+themselves to get transactions in the wallets,
+and the miner mining one block.
+
+Wallets are backed up using dumpwallet/backupwallet.
+Then 5 more iterations of transactions and mining a block.
+
+Miner then generates 101 more blocks, so any
+transaction fees paid mature.
+
+Sanity check:
+  Sum(1,2,3,4 balances) == 114*40
+
+1/2/3 are shutdown, and their wallets erased.
+Then restore using wallet.dat backup. And
+confirm 1/2/3/4 balances are same as before.
+
+Shutdown again, restore using importwallet,
+and confirm again balances are correct.
+"""
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.authproxy import JSONRPCException
+from test_framework.util import assert_equal, \
+    start_nodes, start_node, connect_nodes, stop_node, \
+    sync_blocks, sync_mempools
+
+import os
+import shutil
+from random import randint
+from decimal import Decimal
+import logging
+import sys
+
+logging.basicConfig(format='%(levelname)s: %(message)s', level=logging.INFO, stream=sys.stdout)
+
+class WalletBackupTest(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.setup_clean_chain = True
+        self.num_nodes = 4
+
+    # This mirrors how the network was setup in the bash test
+    def setup_network(self, split=False):
+        # -exportdir option means we must provide a valid path to the destination folder for wallet backups
+        ed0 = "-exportdir=" + self.options.tmpdir + "/node0"
+        ed1 = "-exportdir=" + self.options.tmpdir + "/node1"
+        ed2 = "-exportdir=" + self.options.tmpdir + "/node2"
+
+        # nodes 1, 2,3 are spenders, let's give them a keypool=100
+        extra_args = [["-keypool=100", ed0], ["-keypool=100", ed1], ["-keypool=100", ed2], []]
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir, extra_args)
+        connect_nodes(self.nodes[0], 3)
+        connect_nodes(self.nodes[1], 3)
+        connect_nodes(self.nodes[2], 3)
+        connect_nodes(self.nodes[2], 0)
+        self.is_network_split=False
+        self.sync_all()
+
+    def one_send(self, from_node, to_address):
+        if (randint(1,2) == 1):
+            amount = Decimal(randint(1,10)) / Decimal(10)
+            self.nodes[from_node].sendtoaddress(to_address, amount)
+
+    def do_one_round(self):
+        a0 = self.nodes[0].getnewaddress()
+        a1 = self.nodes[1].getnewaddress()
+        a2 = self.nodes[2].getnewaddress()
+
+        self.one_send(0, a1)
+        self.one_send(0, a2)
+        self.one_send(1, a0)
+        self.one_send(1, a2)
+        self.one_send(2, a0)
+        self.one_send(2, a1)
+
+        # Have the miner (node3) mine a block.
+        # Must sync mempools before mining.
+        sync_mempools(self.nodes)
+        self.nodes[3].generate(1)
+        self.sync_all()
+
+    # As above, this mirrors the original bash test.
+    def start_three(self, extra_args=None):
+        self.nodes[0] = start_node(0, self.options.tmpdir, extra_args)
+        self.nodes[1] = start_node(1, self.options.tmpdir, extra_args)
+        self.nodes[2] = start_node(2, self.options.tmpdir, extra_args)
+        connect_nodes(self.nodes[0], 3)
+        connect_nodes(self.nodes[1], 3)
+        connect_nodes(self.nodes[2], 3)
+        connect_nodes(self.nodes[2], 0)
+
+    def stop_three(self):
+        stop_node(self.nodes[0], 0)
+        stop_node(self.nodes[1], 1)
+        stop_node(self.nodes[2], 2)
+
+    def erase_three(self):
+        os.remove(self.options.tmpdir + "/node0/regtest/wallet.dat")
+        os.remove(self.options.tmpdir + "/node1/regtest/wallet.dat")
+        os.remove(self.options.tmpdir + "/node2/regtest/wallet.dat")
+
+    def run_test(self):
+        logging.info("Generating initial blockchain")
+        self.nodes[0].generate(1)
+        sync_blocks(self.nodes)
+        self.nodes[1].generate(1)
+        sync_blocks(self.nodes)
+        self.nodes[2].generate(1)
+        sync_blocks(self.nodes)
+        self.nodes[3].generate(100)
+        sync_blocks(self.nodes)
+
+        assert_equal(self.nodes[0].getbalance(), 10)
+        assert_equal(self.nodes[1].getbalance(), 10)
+        assert_equal(self.nodes[2].getbalance(), 10)
+        assert_equal(self.nodes[3].getbalance(), 0)
+
+        logging.info("Creating transactions")
+        # Five rounds of sending each other transactions.
+        for i in range(5):
+            self.do_one_round()
+
+        logging.info("Backing up")
+        tmpdir = self.options.tmpdir
+        self.nodes[0].backupwallet("walletbak")
+        self.nodes[0].dumpwallet("walletdump")
+        self.nodes[1].backupwallet("walletbak")
+        self.nodes[1].dumpwallet("walletdump")
+        self.nodes[2].backupwallet("walletbak")
+        self.nodes[2].dumpwallet("walletdump")
+
+        # Verify dumpwallet cannot overwrite an existing file
+        try:
+            self.nodes[2].dumpwallet("walletdump")
+            assert(False)
+        except JSONRPCException as e:
+            errorString = e.error['message']
+            assert("Cannot overwrite existing file" in errorString)
+
+        logging.info("More transactions")
+        for i in range(5):
+            self.do_one_round()
+
+        # Generate 101 more blocks, so any fees paid mature
+        self.nodes[3].generate(101)
+        self.sync_all()
+
+        balance0 = self.nodes[0].getbalance()
+        balance1 = self.nodes[1].getbalance()
+        balance2 = self.nodes[2].getbalance()
+        balance3 = self.nodes[3].getbalance()
+        total = balance0 + balance1 + balance2 + balance3
+
+        # At this point, there are 214 blocks (103 for setup, then 10 rounds, then 101.)
+        # 114 are mature, so the sum of all wallets should be 114 * 10 = 1140.
+        assert_equal(total, 1140)
+
+        ##
+        # Test restoring spender wallets from backups
+        ##
+        logging.info("Restoring using wallet.dat")
+        self.stop_three()
+        self.erase_three()
+
+        # Start node2 with no chain
+        shutil.rmtree(self.options.tmpdir + "/node2/regtest/blocks")
+        shutil.rmtree(self.options.tmpdir + "/node2/regtest/chainstate")
+
+        # Restore wallets from backup
+        shutil.copyfile(tmpdir + "/node0/walletbak", tmpdir + "/node0/regtest/wallet.dat")
+        shutil.copyfile(tmpdir + "/node1/walletbak", tmpdir + "/node1/regtest/wallet.dat")
+        shutil.copyfile(tmpdir + "/node2/walletbak", tmpdir + "/node2/regtest/wallet.dat")
+
+        logging.info("Re-starting nodes")
+        self.start_three()
+        sync_blocks(self.nodes)
+
+        # We made extra transactions that involved addresses generated after the
+        # backups were taken, and external addresses do not use the keypool, so
+        # the balances shouldn't line up.
+        balance0backup = self.nodes[0].getbalance()
+        balance1backup = self.nodes[1].getbalance()
+        balance2backup = self.nodes[2].getbalance()
+        assert(balance0backup != balance0)
+        assert(balance1backup != balance1)
+        assert(balance2backup != balance2)
+
+        # However, because addresses are derived deterministically, we can
+        # recover the balances by generating the extra addresses and then
+        # rescanning.
+        for i in range(5):
+            self.nodes[0].getnewaddress()
+            self.nodes[1].getnewaddress()
+            self.nodes[2].getnewaddress()
+
+        logging.info("Re-starting nodes with -rescan")
+        self.stop_three()
+        self.start_three(['-rescan'])
+        sync_blocks(self.nodes)
+
+        assert_equal(self.nodes[0].getbalance(), balance0)
+        assert_equal(self.nodes[1].getbalance(), balance1)
+        assert_equal(self.nodes[2].getbalance(), balance2)
+
+        logging.info("Restoring using dumped wallet")
+        self.stop_three()
+        self.erase_three()
+
+        #start node2 with no chain
+        shutil.rmtree(self.options.tmpdir + "/node2/regtest/blocks")
+        shutil.rmtree(self.options.tmpdir + "/node2/regtest/chainstate")
+
+        self.start_three()
+
+        assert_equal(self.nodes[0].getbalance(), 0)
+        assert_equal(self.nodes[1].getbalance(), 0)
+        assert_equal(self.nodes[2].getbalance(), 0)
+
+        self.nodes[0].importwallet(tmpdir + "/node0/walletdump")
+        self.nodes[1].importwallet(tmpdir + "/node1/walletdump")
+        self.nodes[2].importwallet(tmpdir + "/node2/walletdump")
+
+        sync_blocks(self.nodes)
+
+        assert_equal(self.nodes[0].getbalance(), balance0backup)
+        assert_equal(self.nodes[1].getbalance(), balance1backup)
+        assert_equal(self.nodes[2].getbalance(), balance2backup)
+
+
+if __name__ == '__main__':
+    WalletBackupTest().main()
diff --git a/depend/zcash/qa/rpc-tests/zapwallettxes.py b/depend/zcash/qa/rpc-tests/zapwallettxes.py
new file mode 100755
index 000000000..1f02234db
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/zapwallettxes.py
@@ -0,0 +1,85 @@
+#!/usr/bin/env python3
+# Copyright (c) 2014-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.authproxy import JSONRPCException
+from test_framework.util import assert_equal, \
+    start_nodes, start_node, connect_nodes_bi, bitcoind_processes
+
+
+class ZapWalletTXesTest (BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.setup_clean_chain = True
+        self.num_nodes = 3
+
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(self.num_nodes, self.options.tmpdir)
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,0,2)
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test (self):
+        print("Mining blocks...")
+        self.nodes[0].generate(4)
+        self.sync_all()
+        self.nodes[1].generate(101)
+        self.sync_all()
+
+        assert_equal(self.nodes[0].getbalance(), 40)
+
+        txid0 = self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(), 11)
+        txid1 = self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(), 10)
+        self.sync_all()
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        txid2 = self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(), 11)
+        txid3 = self.nodes[0].sendtoaddress(self.nodes[2].getnewaddress(), 5)
+
+        tx0 = self.nodes[0].gettransaction(txid0)
+        assert_equal(tx0['txid'], txid0) # tx0 must be available (confirmed)
+
+        tx1 = self.nodes[0].gettransaction(txid1)
+        assert_equal(tx1['txid'], txid1) # tx1 must be available (confirmed)
+
+        tx2 = self.nodes[0].gettransaction(txid2)
+        assert_equal(tx2['txid'], txid2) # tx2 must be available (unconfirmed)
+
+        tx3 = self.nodes[0].gettransaction(txid3)
+        assert_equal(tx3['txid'], txid3) # tx3 must be available (unconfirmed)
+
+        # restart zcashd
+        self.nodes[0].stop()
+        bitcoind_processes[0].wait()
+        self.nodes[0] = start_node(0,self.options.tmpdir)
+
+        tx3 = self.nodes[0].gettransaction(txid3)
+        assert_equal(tx3['txid'], txid3) # tx must be available (unconfirmed)
+
+        self.nodes[0].stop()
+        bitcoind_processes[0].wait()
+
+        # restart zcashd with zapwallettxes
+        self.nodes[0] = start_node(0,self.options.tmpdir, ["-zapwallettxes=1"])
+
+        aException = False
+        try:
+            tx3 = self.nodes[0].gettransaction(txid3)
+        except JSONRPCException as e:
+            print(e)
+            aException = True
+
+        assert_equal(aException, True) # there must be an exception because the unconfirmed wallet tx0 must be gone by now
+
+        tx0 = self.nodes[0].gettransaction(txid0)
+        assert_equal(tx0['txid'], txid0) # tx0 (confirmed) must still be available because it was confirmed
+
+
+if __name__ == '__main__':
+    ZapWalletTXesTest().main()
diff --git a/depend/zcash/qa/rpc-tests/zcjoinsplit.py b/depend/zcash/qa/rpc-tests/zcjoinsplit.py
new file mode 100755
index 000000000..718c5102a
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/zcjoinsplit.py
@@ -0,0 +1,65 @@
+#!/usr/bin/env python3
+
+#
+# Test joinsplit semantics
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, start_node, \
+    gather_inputs
+
+
+class JoinSplitTest(BitcoinTestFramework):
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 1
+
+    def setup_network(self):
+        self.nodes = []
+        self.is_network_split = False
+        self.nodes.append(start_node(0, self.options.tmpdir, 
+            ["-allowdeprecated=zcrawkeygen", "-allowdeprecated=zcrawjoinsplit", "-allowdeprecated=zcrawreceive"]
+            ))
+
+    def run_test(self):
+        zckeypair = self.nodes[0].zcrawkeygen()
+        zcsecretkey = zckeypair["zcsecretkey"]
+        zcaddress = zckeypair["zcaddress"]
+
+        (total_in, inputs) = gather_inputs(self.nodes[0], 40)
+        shield_tx = self.nodes[0].createrawtransaction(inputs, {})
+        joinsplit_result = self.nodes[0].zcrawjoinsplit(shield_tx, {}, {zcaddress:39.99}, 39.99, 0)
+
+        receive_result = self.nodes[0].zcrawreceive(zcsecretkey, joinsplit_result["encryptednote1"])
+        assert_equal(receive_result["exists"], False)
+
+        shield_tx = self.nodes[0].signrawtransaction(joinsplit_result["rawtxn"])
+        self.nodes[0].sendrawtransaction(shield_tx["hex"])
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        receive_result = self.nodes[0].zcrawreceive(zcsecretkey, joinsplit_result["encryptednote1"])
+        assert_equal(receive_result["exists"], True)
+
+        # The pure joinsplit we create should be mined in the next block
+        # despite other transactions being in the mempool.
+        addrtest = self.nodes[0].getnewaddress()
+        for xx in range(0,10):
+            self.nodes[0].generate(1)
+            self.sync_all()
+            for x in range(0,50):
+                self.nodes[0].sendtoaddress(addrtest, 0.01);
+
+        joinsplit_tx = self.nodes[0].createrawtransaction([], {})
+        joinsplit_result = self.nodes[0].zcrawjoinsplit(joinsplit_tx, {receive_result["note"] : zcsecretkey}, {zcaddress: 39.98}, 0, 0.01)
+
+        self.nodes[0].sendrawtransaction(joinsplit_result["rawtxn"])
+        self.nodes[0].generate(1)
+        self.sync_all()
+
+        print("Done!")
+        receive_result = self.nodes[0].zcrawreceive(zcsecretkey, joinsplit_result["encryptednote1"])
+        assert_equal(receive_result["exists"], True)
+
+if __name__ == '__main__':
+    JoinSplitTest().main()
diff --git a/depend/zcash/qa/rpc-tests/zcjoinsplitdoublespend.py b/depend/zcash/qa/rpc-tests/zcjoinsplitdoublespend.py
new file mode 100755
index 000000000..3543ad10b
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/zcjoinsplitdoublespend.py
@@ -0,0 +1,186 @@
+#!/usr/bin/env python3
+
+#
+# Tests a joinsplit double-spend and a subsequent reorg.
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.authproxy import JSONRPCException
+from test_framework.util import assert_equal, connect_nodes, \
+    gather_inputs, start_nodes, sync_blocks
+
+import time
+
+class JoinSplitTest(BitcoinTestFramework):
+    def setup_network(self):
+        # Start with split network:
+        return super(JoinSplitTest, self).setup_network(True)
+
+    def setup_nodes(self):
+        return start_nodes(self.num_nodes, self.options.tmpdir,
+                extra_args = [["-allowdeprecated=zcrawjoinsplit", "-allowdeprecated=zcrawkeygen", "-allowdeprecated=zcrawreceive"]] * self.num_nodes)
+
+    def txid_in_mempool(self, node, txid):
+        exception_triggered = False
+
+        try:
+            node.getrawtransaction(txid)
+        except JSONRPCException:
+            exception_triggered = True
+
+        return not exception_triggered
+
+    def cannot_joinsplit(self, node, txn):
+        exception_triggered = False
+
+        try:
+            node.sendrawtransaction(txn)
+        except JSONRPCException:
+            exception_triggered = True
+
+        return exception_triggered
+
+    def expect_cannot_joinsplit(self, node, txn):
+        assert_equal(self.cannot_joinsplit(node, txn), True)
+
+    def run_test(self):
+        # All nodes should start with 250 ZEC:
+        starting_balance = 250
+        for i in range(4):
+            assert_equal(self.nodes[i].getbalance(), starting_balance)
+            self.nodes[i].getnewaddress("")  # bug workaround, coins generated assigned to first getnewaddress!
+
+        # Generate zcaddress keypairs
+        zckeypair = self.nodes[0].zcrawkeygen()
+        zcsecretkey = zckeypair["zcsecretkey"]
+        zcaddress = zckeypair["zcaddress"]
+
+        pool = [0, 1, 2, 3]
+        for i in range(4):
+            (total_in, inputs) = gather_inputs(self.nodes[i], 40)
+            pool[i] = self.nodes[i].createrawtransaction(inputs, {})
+            pool[i] = self.nodes[i].zcrawjoinsplit(pool[i], {}, {zcaddress:39.99}, 39.99, 0)
+            signed = self.nodes[i].signrawtransaction(pool[i]["rawtxn"])
+
+            # send the tx to both halves of the network
+            self.nodes[0].sendrawtransaction(signed["hex"])
+            self.nodes[0].generate(1)
+            self.nodes[2].sendrawtransaction(signed["hex"])
+            self.nodes[2].generate(1)
+            pool[i] = pool[i]["encryptednote1"]
+
+        sync_blocks(self.nodes[0:2])
+        sync_blocks(self.nodes[2:4])
+
+        # Confirm that the protects have taken place
+        for i in range(4):
+            enc_note = pool[i]
+            receive_result = self.nodes[0].zcrawreceive(zcsecretkey, enc_note)
+            assert_equal(receive_result["exists"], True)
+            pool[i] = receive_result["note"]
+
+            # Extra confirmations
+            receive_result = self.nodes[1].zcrawreceive(zcsecretkey, enc_note)
+            assert_equal(receive_result["exists"], True)
+
+            receive_result = self.nodes[2].zcrawreceive(zcsecretkey, enc_note)
+            assert_equal(receive_result["exists"], True)
+
+            receive_result = self.nodes[3].zcrawreceive(zcsecretkey, enc_note)
+            assert_equal(receive_result["exists"], True)
+
+        blank_tx = self.nodes[0].createrawtransaction([], {})
+        # Create joinsplit {A, B}->{*}
+        joinsplit_AB = self.nodes[0].zcrawjoinsplit(blank_tx,
+                                               {pool[0] : zcsecretkey, pool[1] : zcsecretkey},
+                                               {zcaddress:(39.99*2)-0.01},
+                                               0, 0.01)
+
+        # Create joinsplit {B, C}->{*}
+        joinsplit_BC = self.nodes[0].zcrawjoinsplit(blank_tx,
+                                               {pool[1] : zcsecretkey, pool[2] : zcsecretkey},
+                                               {zcaddress:(39.99*2)-0.01},
+                                               0, 0.01)
+
+        # Create joinsplit {C, D}->{*}
+        joinsplit_CD = self.nodes[0].zcrawjoinsplit(blank_tx,
+                                               {pool[2] : zcsecretkey, pool[3] : zcsecretkey},
+                                               {zcaddress:(39.99*2)-0.01},
+                                               0, 0.01)
+
+        # Create joinsplit {A, D}->{*}
+        joinsplit_AD = self.nodes[0].zcrawjoinsplit(blank_tx,
+                                               {pool[0] : zcsecretkey, pool[3] : zcsecretkey},
+                                               {zcaddress:(39.99*2)-0.01},
+                                               0, 0.01)
+
+        # (a)    Node 0 will spend joinsplit AB, then attempt to
+        # double-spend it with BC. It should fail before and
+        # after Node 0 mines blocks.
+        #
+        # (b)    Then, Node 2 will spend BC, and mine 5 blocks.
+        # Node 1 connects, and AB will be reorg'd from the chain.
+        # Any attempts to spend AB or CD should fail for
+        # both nodes.
+        #
+        # (c)    Then, Node 0 will spend AD, which should work
+        # because the previous spend for A (AB) is considered
+        # invalid due to the reorg.
+
+        # (a)
+
+        AB_txid = self.nodes[0].sendrawtransaction(joinsplit_AB["rawtxn"])
+
+        self.expect_cannot_joinsplit(self.nodes[0], joinsplit_BC["rawtxn"])
+
+        # Wait until node[1] receives AB before we attempt to double-spend
+        # with BC.
+        print("Waiting for AB_txid...\n")
+        while True:
+            if self.txid_in_mempool(self.nodes[1], AB_txid):
+                break
+            time.sleep(0.2)
+        print("Done!\n")
+
+        self.expect_cannot_joinsplit(self.nodes[1], joinsplit_BC["rawtxn"])
+
+        # Generate a block
+        self.nodes[0].generate(1)
+        sync_blocks(self.nodes[0:2])
+
+        self.expect_cannot_joinsplit(self.nodes[0], joinsplit_BC["rawtxn"])
+        self.expect_cannot_joinsplit(self.nodes[1], joinsplit_BC["rawtxn"])
+
+        # (b)
+        self.nodes[2].sendrawtransaction(joinsplit_BC["rawtxn"])
+        self.nodes[2].generate(5)
+
+        # Connect the two nodes
+
+        connect_nodes(self.nodes[1], 2)
+        sync_blocks(self.nodes)
+
+        # AB and CD should all be impossible to spend for each node.
+        self.expect_cannot_joinsplit(self.nodes[0], joinsplit_AB["rawtxn"])
+        self.expect_cannot_joinsplit(self.nodes[0], joinsplit_CD["rawtxn"])
+
+        self.expect_cannot_joinsplit(self.nodes[1], joinsplit_AB["rawtxn"])
+        self.expect_cannot_joinsplit(self.nodes[1], joinsplit_CD["rawtxn"])
+
+        self.expect_cannot_joinsplit(self.nodes[2], joinsplit_AB["rawtxn"])
+        self.expect_cannot_joinsplit(self.nodes[2], joinsplit_CD["rawtxn"])
+
+        self.expect_cannot_joinsplit(self.nodes[3], joinsplit_AB["rawtxn"])
+        self.expect_cannot_joinsplit(self.nodes[3], joinsplit_CD["rawtxn"])
+
+        # (c)
+        # AD should be possible to send due to the reorg that
+        # tossed out AB.
+
+        self.nodes[0].sendrawtransaction(joinsplit_AD["rawtxn"])
+        self.nodes[0].generate(1)
+
+        sync_blocks(self.nodes)
+
+if __name__ == '__main__':
+    JoinSplitTest().main()
diff --git a/depend/zcash/qa/rpc-tests/zkey_import_export.py b/depend/zcash/qa/rpc-tests/zkey_import_export.py
new file mode 100755
index 000000000..979d97b6e
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/zkey_import_export.py
@@ -0,0 +1,160 @@
+#!/usr/bin/env python3
+# Copyright (c) 2017 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+from decimal import Decimal
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, assert_greater_than, start_nodes,\
+    initialize_chain_clean, connect_nodes_bi, wait_and_assert_operationid_status, \
+    DEFAULT_FEE
+from functools import reduce
+import logging
+import sys
+
+logging.basicConfig(format='%(levelname)s: %(message)s', level=logging.INFO, stream=sys.stdout)
+
+fee = DEFAULT_FEE # constant (but can be changed within reason)
+
+class ZkeyImportExportTest (BitcoinTestFramework):
+
+    def setup_chain(self):
+        print("Initializing test directory "+self.options.tmpdir)
+        initialize_chain_clean(self.options.tmpdir, 5)
+
+    def setup_network(self, split=False):
+        self.nodes = start_nodes(5, self.options.tmpdir)
+        connect_nodes_bi(self.nodes,0,1)
+        connect_nodes_bi(self.nodes,1,2)
+        connect_nodes_bi(self.nodes,0,2)
+        connect_nodes_bi(self.nodes,0,3)
+        connect_nodes_bi(self.nodes,0,4)
+        self.is_network_split=False
+        self.sync_all()
+
+    def run_test(self):
+        [alice, bob, charlie, david, miner] = self.nodes
+
+        # the sender loses 'amount' plus fee; to_addr receives exactly 'amount'
+        def z_send(from_node, from_addr, to_addr, amount):
+            global fee
+            
+            opid = from_node.z_sendmany(from_addr,
+                [{"address": to_addr, "amount": Decimal(amount)}], 1, int(fee))
+            wait_and_assert_operationid_status(from_node, opid)
+            self.sync_all()
+            miner.generate(1)
+            self.sync_all()
+
+        def verify_utxos(node, amts, zaddr):
+            amts.sort(reverse=True)
+            txs = node.z_listreceivedbyaddress(zaddr)
+            txs.sort(key=lambda x: x["amount"], reverse=True)
+            print("Sorted txs", txs)
+            print("amts", amts)
+
+            try:
+                assert_equal(amts, [tx["amount"] for tx in txs])
+                for tx in txs:
+                    # make sure Sapling outputs exist and have valid values
+                    assert_equal("outindex" in tx, True)
+                    assert_greater_than(tx["outindex"], -1)
+            except AssertionError:
+                logging.error(
+                    'Expected amounts: %r; txs: %r',
+                    amts, txs)
+                raise
+
+        def get_private_balance(node):
+            balance = node.z_gettotalbalance()
+            return balance['private']
+
+        # Seed Alice with some funds
+        alice.generate(10)
+        self.sync_all()
+        miner.generate(100)
+        self.sync_all()
+        # Shield Alice's coinbase funds to her zaddr
+        alice_zaddr = alice.z_getnewaddress()
+        res = alice.z_shieldcoinbase("*", alice_zaddr)
+        wait_and_assert_operationid_status(alice, res['opid'])
+        self.sync_all()
+        miner.generate(1)
+        self.sync_all()
+
+        # Now get a pristine z-address for receiving transfers:
+        bob_zaddr = bob.z_getnewaddress()
+        verify_utxos(bob, [], bob_zaddr)
+        # TODO: Verify that charlie doesn't have funds in addr
+        # verify_utxos(charlie, [])
+
+        # the amounts of each txn embodied which generates a single UTXO:
+        amounts = list(map(Decimal, ['2.3', '3.7', '0.1', '0.5', '1.0', '0.19']))
+
+        # Internal test consistency assertion:
+        assert_greater_than(
+            Decimal(get_private_balance(alice)),
+            reduce(Decimal.__add__, amounts))
+
+        logging.info("Sending pre-export txns...")
+        for amount in amounts[0:2]:
+            z_send(alice, alice_zaddr, bob_zaddr, amount)
+
+        logging.info("Exporting privkey from bob...")
+        bob_privkey = bob.z_exportkey(bob_zaddr)
+
+        logging.info("Sending post-export txns...")
+        for amount in amounts[2:4]:
+            z_send(alice, alice_zaddr, bob_zaddr, amount)
+
+        verify_utxos(bob, amounts[:4], bob_zaddr)
+        # verify_utxos(charlie, [])
+
+        logging.info("Importing bob_privkey into charlie...")
+        # z_importkey rescan defaults to "whenkeyisnew", so should rescan here
+        ipk_zaddr = charlie.z_importkey(bob_privkey)
+
+        # z_importkey should have rescanned for new key, so this should pass:
+        verify_utxos(charlie, amounts[:4], ipk_zaddr["address"])
+
+        # address is Sapling
+        assert_equal(ipk_zaddr["type"], "sapling")
+
+        # Verify idempotent behavior:
+        ipk_zaddr2 = charlie.z_importkey(bob_privkey)
+        assert_equal(ipk_zaddr["address"], ipk_zaddr2["address"])
+
+        # amounts should be unchanged
+        verify_utxos(charlie, amounts[:4], ipk_zaddr2["address"])
+
+        logging.info("Sending post-import txns...")
+        for amount in amounts[4:]:
+            z_send(alice, alice_zaddr, bob_zaddr, amount)
+
+        verify_utxos(bob, amounts, bob_zaddr)
+        verify_utxos(charlie, amounts, ipk_zaddr["address"])
+        verify_utxos(charlie, amounts, ipk_zaddr2["address"])
+
+        # keep track of the fees incurred by bob (his sends)
+        bob_fee = Decimal("0")
+
+        # Try to reproduce zombie balance reported in #1936
+        # At generated zaddr, receive ZEC, and send ZEC back out. bob -> alice
+        for amount in amounts[:2]:
+            print("Sending amount from bob to alice: ", amount)
+            z_send(bob, bob_zaddr, alice_zaddr, amount)
+            bob_fee += fee
+
+        bob_balance = sum(amounts[2:]) - int(bob_fee)
+        
+        assert_equal(bob.z_getbalance(bob_zaddr), bob_balance)
+
+        # z_import onto new node "david" (blockchain rescan, default or True?)
+        d_ipk_zaddr = david.z_importkey(bob_privkey)
+
+        # Check if amt bob spent is deducted for charlie and david
+        assert_equal(charlie.z_getbalance(ipk_zaddr["address"]), bob_balance)
+        assert_equal(david.z_getbalance(d_ipk_zaddr["address"]), bob_balance)
+
+if __name__ == '__main__':
+    ZkeyImportExportTest().main()
diff --git a/depend/zcash/qa/rpc-tests/zmq_test.py b/depend/zcash/qa/rpc-tests/zmq_test.py
new file mode 100755
index 000000000..c679bc8f7
--- /dev/null
+++ b/depend/zcash/qa/rpc-tests/zmq_test.py
@@ -0,0 +1,99 @@
+#!/usr/bin/env python3
+# Copyright (c) 2015-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Test ZMQ interface
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import assert_equal, bytes_to_hex_str, start_nodes
+
+import zmq
+import struct
+
+class ZMQTest(BitcoinTestFramework):
+
+    def __init__(self):
+        super().__init__()
+        self.num_nodes = 4
+
+    port = 28332
+
+    def setup_nodes(self):
+        self.zmqContext = zmq.Context()
+        self.zmqSubSocket = self.zmqContext.socket(zmq.SUB)
+        self.zmqSubSocket.setsockopt(zmq.SUBSCRIBE, b"hashblock")
+        self.zmqSubSocket.setsockopt(zmq.SUBSCRIBE, b"hashtx")
+        self.zmqSubSocket.connect("tcp://127.0.0.1:%i" % self.port)
+        return start_nodes(self.num_nodes, self.options.tmpdir, extra_args=[
+            ['-zmqpubhashtx=tcp://127.0.0.1:'+str(self.port), '-zmqpubhashblock=tcp://127.0.0.1:'+str(self.port)],
+            [],
+            [],
+            []
+            ])
+
+    def run_test(self):
+        self.sync_all()
+
+        genhashes = self.nodes[0].generate(1)
+        self.sync_all()
+
+        print("listen...")
+        msg = self.zmqSubSocket.recv_multipart()
+        topic = msg[0]
+        body = msg[1]
+        msgSequence = struct.unpack('<I', msg[-1])[-1]
+        assert_equal(msgSequence, 0) #must be sequence 0 on hashblock
+        blkhash = bytes_to_hex_str(body)
+
+        assert_equal(genhashes[0], blkhash) #blockhash from generate must be equal to the hash received over zmq
+
+        msg = self.zmqSubSocket.recv_multipart()
+        topic = msg[0]
+        assert_equal(topic, b"hashtx")
+        body = msg[1]
+        nseq = msg[2]
+        [nseq] # hush pyflakes
+        msgSequence = struct.unpack('<I', msg[-1])[-1]
+        assert_equal(msgSequence, 0) # must be sequence 0 on hashtx
+
+        n = 10
+        genhashes = self.nodes[1].generate(n)
+        self.sync_all()
+
+        zmqHashes = []
+        blockcount = 0
+        for x in range(0,n*2):
+            msg = self.zmqSubSocket.recv_multipart()
+            topic = msg[0]
+            body = msg[1]
+            if topic == b"hashblock":
+                zmqHashes.append(bytes_to_hex_str(body))
+                msgSequence = struct.unpack('<I', msg[-1])[-1]
+                assert_equal(msgSequence, blockcount+1)
+                blockcount += 1
+
+        for x in range(0,n):
+            assert_equal(genhashes[x], zmqHashes[x]) #blockhash from generate must be equal to the hash received over zmq
+
+        #test tx from a second node
+        hashRPC = self.nodes[1].sendtoaddress(self.nodes[0].getnewaddress(), 1.0)
+        self.sync_all()
+
+        # now we should receive a zmq msg because the tx was broadcast
+        msg = self.zmqSubSocket.recv_multipart()
+        topic = msg[0]
+        body = msg[1]
+        hashZMQ = ""
+        if topic == b"hashtx":
+            hashZMQ = bytes_to_hex_str(body)
+            msgSequence = struct.unpack('<I', msg[-1])[-1]
+            assert_equal(msgSequence, blockcount+1)
+
+        assert_equal(hashRPC, hashZMQ) #blockhash from generate must be equal to the hash received over zmq
+
+
+if __name__ == '__main__':
+    ZMQTest ().main ()
diff --git a/depend/zcash/qa/zcash/checksec.sh b/depend/zcash/qa/zcash/checksec.sh
new file mode 100755
index 000000000..be594ea61
--- /dev/null
+++ b/depend/zcash/qa/zcash/checksec.sh
@@ -0,0 +1,2057 @@
+#!/usr/bin/env bash
+#
+# The BSD License (https://opensource.org/licenses/bsd-license.php)
+# specifies the terms and conditions of use for checksec.sh:
+#
+# Copyright (c) 2014-2020, Brian Davis
+# Copyright (c) 2013, Robin David
+# Copyright (c) 2009-2011, Tobias Klein
+# All rights reserved.
+#
+# Redistribution and use in source and binary forms, with or without
+# modification, are permitted provided that the following conditions
+# are met:
+#
+# * Redistributions of source code must retain the above copyright
+#   notice, this list of conditions and the following disclaimer.
+# * Redistributions in binary form must reproduce the above copyright
+#   notice, this list of conditions and the following disclaimer in
+#   the documentation and/or other materials provided with the
+#   distribution.
+# * Neither the name of Tobias Klein nor the name of trapkit.de may be
+#   used to endorse or promote products derived from this software
+#   without specific prior written permission.
+#
+# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
+# FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
+# COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
+# INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
+# BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
+# OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
+# AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+# OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF
+# THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
+# DAMAGE.
+#
+# --- Modified Version ---
+# Name    : checksec.sh
+# Version : 1.7.0
+# Author  : Brian Davis
+# Date    : February 2014
+# Download: https://github.com/slimm609/checksec.sh
+#
+# --- Modified Version ---
+# Name    : checksec.sh
+# Version : based on 1.5
+# Author  : Robin David
+# Date    : October 2013
+# Download: https://github.com/RobinDavid/checksec
+#
+# --- Original version ---
+# Name    : checksec.sh
+# Version : 1.5
+# Author  : Tobias Klein
+# Date    : November 2011
+# Download: https://www.trapkit.de/tools/checksec.html
+# Changes : https://www.trapkit.de/tools/checksec_changes.txt
+
+#set global lang to C
+export LC_ALL="C"
+
+# global vars
+debug=false
+verbose=false
+format="cli"
+SCRIPT_NAME="checksec"
+SCRIPT_URL="https://github.com/slimm609/checksec.sh/raw/master/${SCRIPT_NAME}"
+SIG_URL="https://github.com/slimm609/checksec.sh/raw/master/$(basename ${SCRIPT_NAME} .sh).sig"
+SCRIPT_VERSION=2020071902
+SCRIPT_MAJOR=2
+SCRIPT_MINOR=3
+SCRIPT_REVISION=0
+pkg_release=false
+commandsmissing=false
+OPT=0
+extended_checks=false
+# FORTIFY_SOURCE vars
+FS_end=_chk
+FS_cnt_total=0
+FS_cnt_checked=0
+FS_cnt_unchecked=0
+FS_chk_func_libc=0
+FS_functions=0
+FS_libc=0
+
+# check for required files and deps first
+# check if command exists
+command_exists () {
+  type "${1}"  > /dev/null 2>&1;
+}
+
+if [[ $(id -u) != 0 ]]; then
+    export PATH=${PATH}:/sbin/:/usr/sbin/
+fi
+
+for command in cat awk sed sysctl uname mktemp openssl grep stat file find sort head ps readlink basename id which xargs; do
+    if ! (command_exists ${command}); then
+       >&2 echo -e "\e[31mWARNING: '${command}' not found! It's required for most checks.\e[0m"
+       commandsmissing=true
+    fi
+done
+
+if [[ ${commandsmissing} == true ]]; then
+    >&2 echo -e "\n\e[31mWARNING: Not all necessary commands found. Some tests might not work!\e[0m\n"
+    sleep 2
+fi
+
+if (command_exists readelf); then
+     readelf="readelf -W"
+elif (command_exists eu-readelf); then
+     readelf="eu-readelf -W"
+elif (command_exists greadelf); then
+     readelf="greadelf -W"
+else
+    echo -e "\n\e[31mERROR: readelf is a required tool for almost all tests. Aborting...\e[0m\n"
+    exit
+fi
+
+sysarch=$(uname -m)
+if [[ "${sysarch}" == "x86_64" ]]; then
+    arch="64"
+elif [[ "${sysarch}" == "i?86" ]]; then
+    arch="32"
+elif [[ "${sysarch}" =~ "arm" ]]; then
+    arch="arm"
+elif [[ "${sysarch}" =~ "aarch64" ]]; then
+    arch="aarch64"
+fi
+
+#openssl public key for verification of updates
+read -r PUBKEY <<EOF
+LS0tLS1CRUdJTiBQVUJMSUMgS0VZLS0tLS0KTUlJQklqQU5CZ2txaGtpRzl3MEJBUUVGQUFPQ0FROEFNSUlCQ2dLQ0FRRUF3Z25kcnk2WGJpNE8wR2w1T2UzSQp1eWRyMlZqR1hteDJFM0thd0wrK1F3a2FVT0RHOEVuT24weFZ1S1ZkZEphZjY3Rmxzd3pPYjh1RFRDTjdsWURnCnFKQXdmNllTOUFsdU5RRmlFQWhFRlgxL0dsMi9TSnFHYXhFVU9HTlV3NTI5a3BVR0MwNmN6SHhENEcvdWNBQlkKT05iWm9Vc1pIYmRnZUNueWs1dzZ0SWs3MEplNmZ2em5Da2JxbUZhS0UyQnhWTERLU0liSDBTak5XT3RSMmF6ZAp1V3p2RU1kVXFlZlZjYXErUDFjV0dLNy94VllSNkV3ME1aQTdWU0xkREhlRUVySW9Kc3UvM2VaeUR5ZDlaUlJvCmdpajM2R1N2SFREclU1ZVdXRlN0Q01UM29DRDhMSjVpbXBReWpWd3Z5M3Z4ZVNVYzVkdytZUDU0OU9jNHF2bzYKOXdJREFRQUIKLS0tLS1FTkQgUFVCTElDIEtFWS0tLS0tCg==
+EOF
+
+# Fetch the update
+fetch() {
+  if type wget > /dev/null 2>&1 ; then
+    ${debug} && echo "fetching update via wget"
+    wget --no-check-certificate -O "${2}" "${1}" >/dev/null 2>&1
+  elif type curl > /dev/null 2>&1 ; then
+    ${debug} && echo "fetching update via curl"
+    curl --insecure --remote-name -o "${2}" "${1}" >/dev/null 2>&1
+  else
+    echo 'Warning: Neither wget nor curl is available. online updates unavailable' >&2
+    exit 1
+  fi
+}
+
+# Version compare
+vercomp() {
+    if [[ "${1}" == "${2}" ]]
+    then
+        return 0
+    fi
+    local IFS=.
+    local i ver1="${1}" ver2="${2}"
+    # fill empty fields in ver1 with zeros
+    for ((i=${#ver1[@]}; i<${#ver2[@]}; i++))
+    do
+        ver1[i]=0
+    done
+    for ((i=0; i<${#ver1[@]}; i++))
+    do
+        if [[ -z ${ver2[i]} ]]
+        then
+            # fill empty fields in ver2 with zeros
+            ver2[i]=0
+        fi
+        if ((10#${ver1[i]} > 10#${ver2[i]}))
+        then
+            return 1
+        fi
+        if ((10#${ver1[i]} < 10#${ver2[i]}))
+        then
+            return 2
+        fi
+    done
+    return 0
+}
+
+# Update/Upgrade
+# shellcheck disable=SC2120
+upgrade() {
+  if ${pkg_release}; then
+      printf "\033[31mError: Unknown option '%s'.\033[m\n\n" "${1}"
+      help
+      exit 1
+    fi
+  umask 027
+  TMP_FILE=$(mktemp /tmp/checksec.XXXXXXXXXX)
+  SIG_FILE=$(mktemp /tmp/checksec_sig.XXXXXXXX)
+  PUBKEY_FILE=$(mktemp /tmp/checksec_pubkey.XXXXXXXXXX)
+    fetch "${SCRIPT_URL}" "${TMP_FILE}"
+    fetch "${SIG_URL}" "${SIG_FILE}"
+  echo "${PUBKEY}" | base64 -d > "${PUBKEY_FILE}"
+  if ! openssl dgst -sha256 -verify "${PUBKEY_FILE}" -signature "${SIG_FILE}" "${TMP_FILE}" >/dev/null 2>&1; then
+    echo "file signature does not match. Update may be tampered"
+    rm -f "${TMP_FILE}" "${SIG_FILE}" "${PUBKEY_FILE}" >/dev/null 2>&1
+    exit 1
+  fi
+  UPDATE_VERSION=$(grep "^SCRIPT_VERSION" "${TMP_FILE}" | awk -F"=" '{ print $2 }')
+  if [[ "${SCRIPT_VERSION}" != "${UPDATE_VERSION}" ]]; then
+    PERMS=$(stat -c "%a" "$0")
+    rm -f "${SIG_FILE}" "${PUBKEY_FILE}" >/dev/null 2>&1
+    mv "${TMP_FILE}" "$0" >/dev/null 2>&1
+    exit_status=$?
+    if [[ "${exit_status}" -eq "0" ]]; then
+      echo "checksec.sh updated - Rev. ${UPDATE_VERSION}"
+      chmod "${PERMS}" "${0}"
+    else
+      echo "Error: Could not update... Please check permissions"
+      rm -f "${TMP_FILE}" >/dev/null 2>&1
+      exit 1
+    fi
+  else
+    echo "checksec.sh not updated... Already on latest version"
+    rm -f "${TMP_FILE}" "${SIG_FILE}" "${PUBKEY_FILE}" >/dev/null 2>&1
+    exit 1
+    fi
+    exit 0
+}
+
+# version information
+version() {
+  echo "checksec v${SCRIPT_MAJOR}.${SCRIPT_MINOR}.${SCRIPT_REVISION}, Brian Davis, github.com/slimm609/checksec.sh, Dec 2015"
+  echo "Based off checksec v1.5, Tobias Klein, www.trapkit.de, November 2011"
+  echo
+}
+
+# help
+help() {
+  echo "Usage: checksec [--format={cli,csv,xml,json}] [OPTION]"
+  echo
+  echo
+  echo "Options:"
+  echo
+  echo " ## Checksec Options"
+  echo "  --file={file}"
+  echo "  --dir={directory}"
+  echo "  --proc={process name}"
+  echo "  --proc-all"
+  echo "  --proc-libs={process ID}"
+  echo "  --kernel[=kconfig]"
+  echo "  --fortify-file={executable-file}"
+  echo "  --fortify-proc={process ID}"
+  echo "  --version"
+  echo "  --help"
+  if ! ${pkg_release}; then
+    echo "  --update or --upgrade"
+  fi
+  echo
+  echo " ## Modifiers"
+  echo "  --debug"
+  echo "  --verbose"
+  echo "  --format={cli,csv,xml,json}"
+  echo "  --output={cli,csv,xml,json}"
+  echo "  --extended"
+  echo
+  echo "For more information, see:"
+  echo "  https://github.com/slimm609/checksec.sh"
+  echo
+}
+
+# format
+format () {
+  list="cli csv xml json"
+  if [[ -n "${output_format}" ]]; then
+    if [[ ! ${list} =~ ${output_format} ]]; then
+  printf "\033[31mError: Please provide a valid format {cli, csv, xml, json}.\033[m\n\n"
+  exit 1
+    fi
+  fi
+  if [[ "${output_format}" == "xml" ]]; then
+    echo '<?xml version="1.0" encoding="UTF-8"?>'
+  fi
+  format="${output_format}"
+}
+
+#run help if nothing is passed
+if [[ $# -lt 1 ]]; then
+  help
+  exit 1
+fi
+
+echo_message() {
+  if [[ ${format} == "csv" ]]; then
+      echo -n -e "$2"
+  elif [[ ${format} == "xml" ]]; then
+      echo -n -e "$3"
+  elif [[ ${format} == "json" ]]; then
+      echo -n -e "$4"
+  else #default to cli
+      echo -n -e "${1}"
+  fi
+}
+
+# check selinux status
+getsestatus() {
+  local status
+  ${debug} && echo -e "\n***function getsestatus"
+  if (command_exists getenforce); then
+    ${debug} && echo "***function getsestatus->getenforce"
+    sestatus=$(getenforce)
+    if [[ "${sestatus}" == "Disabled" ]]; then
+      status=0
+    elif [[ "${sestatus}" == "Permissive" ]]; then
+      status=1
+    elif [[ "${sestatus}" == "Enforcing" ]]; then
+      status=2
+    fi
+  elif (command_exists sestatus); then
+    ${debug} && echo "***function getsestatus->sestatus"
+    sestatus=$(sestatus | grep "SELinux status" | awk '{ print $3}')
+    if [[ "${sestatus}" == "disabled" ]]; then
+      status=0
+    elif [[ "${sestatus}" == "enabled" ]]; then
+      sestatus2=$(sestatus | grep "Current" | awk '{ print $3}')
+      if [[ "${sestatus2}" == "permissive" ]]; then
+        status=1
+      elif [[ "${sestatus2}" == "enforcing" ]]; then
+        status=2
+      fi
+    fi
+  fi
+return ${status}
+}
+
+# check if directory exists
+dir_exists () {
+  ${debug} && echo "function dir_exists"
+  if [[ -d "${1}" ]] ; then
+    return 0
+  else
+    return 1
+  fi
+}
+
+# check user privileges
+root_privs () {
+ ${debug} && echo "***function root_privs"
+  if [[ $(/usr/bin/id -u) -eq 0 ]] ; then
+    return 0
+  else
+    return 1
+  fi
+}
+
+# check if input is numeric
+isNumeric () {
+  ${debug} && echo "***function isNumeric"
+  echo "$@" | grep -q -v "[^0-9]"
+}
+
+# check if input is a string
+isString () {
+  ${debug} && echo "***function isString"
+  echo "$@" | grep -q -v "[^ A-Z_a-z]"
+}
+
+# check file(s)
+filecheck() {
+  ${debug} && echo "***function filecheck"
+  # check for RELRO support
+  ${debug} && echo "***function filecheck->RELRO"
+  if ${readelf} -l "${1}" 2>/dev/null | grep -q 'GNU_RELRO'; then
+    if ${readelf} -d "${1}" 2>/dev/null | grep -q 'BIND_NOW'; then
+      echo_message '\033[32mFull RELRO   \033[m   ' 'Full RELRO,' '<file relro="full"' " \"${1}\": { \"relro\":\"full\","
+    else
+      echo_message '\033[33mPartial RELRO\033[m   ' 'Partial RELRO,' '<file relro="partial"' " \"${1}\": { \"relro\":\"partial\","
+    fi
+  else
+    echo_message '\033[31mNo RELRO     \033[m   ' 'No RELRO,' '<file relro="no"' " \"${1}\": { \"relro\":\"no\","
+  fi
+
+  # check for stack canary support
+  ${debug} && echo -e "\n***function filecheck->canary"
+  if ${readelf} -s "${1}" 2>/dev/null | grep -Eq '__stack_chk_fail|__intel_security_cookie'; then
+    echo_message '\033[32mCanary found   \033[m   ' 'Canary found,' ' canary="yes"' '"canary":"yes",'
+  else
+    echo_message '\033[31mNo canary found\033[m   ' 'No Canary found,' ' canary="no"' '"canary":"no",'
+  fi
+
+  # check for NX support
+  ${debug} && echo -e "\n***function filecheck->nx"
+  if ${readelf} -l "${1}" 2>/dev/null | grep -q 'GNU_STACK'; then
+    if ${readelf} -l "${1}" 2>/dev/null | grep 'GNU_STACK' | grep -q 'RWE'; then
+      echo_message '\033[31mNX disabled\033[m   ' 'NX disabled,' ' nx="no"' '"nx":"no",'
+    else
+      echo_message '\033[32mNX enabled \033[m   ' 'NX enabled,' ' nx="yes"' '"nx":"yes",'
+    fi
+  else
+    echo_message '\033[31mNX disabled\033[m   ' 'NX disabled,' ' nx="no"' '"nx":"no",'
+  fi
+
+  # check for PIE support
+  ${debug} && echo -e "\n***function filecheck->pie"
+  if ${readelf} -h "${1}" 2>/dev/null | grep -q 'Type:[[:space:]]*EXEC'; then
+    echo_message '\033[31mNo PIE       \033[m   ' 'No PIE,' ' pie="no"' '"pie":"no",'
+  elif ${readelf} -h "${1}" 2>/dev/null | grep -q 'Type:[[:space:]]*DYN'; then
+    if ${readelf} -d "${1}" 2>/dev/null | grep -q 'DEBUG'; then
+      echo_message '\033[32mPIE enabled  \033[m   ' 'PIE enabled,' ' pie="yes"' '"pie":"yes",'
+    else
+      echo_message '\033[33mDSO          \033[m   ' 'DSO,' ' pie="dso"' '"pie":"dso",'
+    fi
+  elif ${readelf} -h "${1}" 2>/dev/null | grep -q 'Type:[[:space:]]*REL'; then
+    echo_message '\033[33mREL          \033[m   ' 'REL,' ' pie="rel"' '"pie":"rel",'
+  else
+    echo_message '\033[33mNot an ELF file\033[m   ' 'Not an ELF file,' ' pie="not_elf"' '"pie":"not_elf",'
+  fi
+  
+  if ${extended_checks}; then
+    # check for selfrando support
+    ${debug} && echo -e "\n***function filecheck->selfrando"
+    if ${readelf} -S "${1}" 2>/dev/null | grep -c txtrp | grep -q '1'; then
+      echo_message '\033[32mSelfrando enabled  \033[m   '
+    else
+      echo_message '\033[31mNo Selfrando       \033[m   '
+    fi
+  fi
+
+  if ${extended_checks}; then
+    # check if compiled with Clang CFI
+    ${debug} && echo -e "\n***function filecheck->clangcfi"
+    #if $readelf -s "$1" 2>/dev/null | grep -Eq '\.cfi'; then
+    read -r cfifunc <<< "$($readelf -s "${1}" 2>/dev/null | grep .cfi | awk '{ print $8 }')"
+    func=${cfifunc/.cfi/}
+    if [ -n "$cfifunc" ] && $readelf -s "$1" 2>/dev/null | grep -q "$func$"; then
+      echo_message '\033[32mClang CFI found   \033[m   ' 'with CFI,' ' clangcfi="yes"' '"clangcfi":"yes",'
+    else
+      echo_message '\033[31mNo Clang CFI found\033[m   ' 'without CFI,' ' clangcfi="no"' '"clangcfi":"no",'
+    fi
+
+    # check if compiled with Clang SafeStack
+    ${debug} && echo -e "\n***function filecheck->safestack"
+    if $readelf -s "$1" 2>/dev/null | grep -Eq '__safestack_init'; then
+      echo_message '\033[32mSafeStack found   \033[m   ' 'with SafeStack,' ' safestack="yes"' '"safestack":"yes",'
+    else
+      echo_message '\033[31mNo SafeStack found\033[m   ' 'without SafeStack,' ' safestack="no"' '"safestack":"no",'
+    fi
+  fi
+
+  # check for rpath / run path
+  ${debug} && echo -e "\n***function filecheck->rpath"
+  # search for a line that matches RPATH and extract the colon-separated path list within brackets
+  # example input: "0x000000000000000f (RPATH) Library rpath: [/lib/systemd:/lib/apparmor]"
+  IFS=: read -r -a rpath_array <<< "$(${readelf} -d "${1}" 2>/dev/null | awk -F'[][]' '/RPATH/ {print $2}')"
+  if [[ "${#rpath_array[@]}" -gt 0 ]]; then
+    if xargs stat -c %A <<< "${rpath_array[*]}" 2>/dev/null | grep -q 'rw'; then
+      echo_message '\033[31mRW-RPATH \033[m  ' 'RPATH,' ' rpath="yes"' '"rpath":"yes",'
+    else
+      echo_message '\033[31mRPATH   \033[m  ' 'RPATH,' ' rpath="yes"' '"rpath":"yes",'
+    fi
+  else
+    echo_message '\033[32mNo RPATH \033[m  ' 'No RPATH,' ' rpath="no"' '"rpath":"no",'
+  fi
+
+  ${debug} && echo -e "\n***function filecheck->runpath"
+  # search for a line that matches RUNPATH and extract the colon-separated path list within brackets
+  IFS=: read -r -a runpath_array <<< "$(${readelf} -d "${1}" 2>/dev/null | awk -F'[][]' '/RUNPATH/ {print $2}')"
+  if [[ "${#runpath_array[@]}" -gt 0 ]]; then
+    if xargs stat -c %A <<< "${runpath_array[*]}" 2>/dev/null | grep -q 'rw'; then
+      echo_message '\033[31mRW-RUNPATH \033[m  ' 'RUNPATH,' ' runpath="yes"' '"runpath":"yes",'
+    else
+      echo_message '\033[31mRUNPATH   \033[m  ' 'RUNPATH,' ' runpath="yes"' '"runpath":"yes",'
+    fi
+  else
+   echo_message '\033[32mNo RUNPATH \033[m  ' 'No RUNPATH,' ' runpath="no"' '"runpath":"no",'
+  fi
+
+  # check for stripped symbols in the binary
+  IFS=" " read -r -a SYM_cnt <<< "$(${readelf} --symbols "${1}" 2>/dev/null | grep '\.symtab' | cut -d' ' -f5 | cut -d: -f1))"
+  if ${readelf} --symbols "${1}" 2>/dev/null | grep -q '\.symtab'; then
+    echo_message "\033[31m${SYM_cnt[0]} Symbols\t\033[m  " 'Symbols,' ' symbols="yes"' '"symbols":"yes",'
+  else
+    echo_message '\033[32mNo Symbols\t\033[m  ' 'No Symbols,' ' symbols="no"' '"symbols":"no",'
+  fi
+
+  # check for FORTIFY SOURCE
+  ${debug} && echo "***function filecheck->fortify"
+  if [[ -e /lib/libc.so.6 ]] ; then
+    FS_libc=/lib/libc.so.6
+  elif [[ -e /lib/libc.so.7 ]] ; then
+    FS_libc=/lib/libc.so.7
+  elif [[ -e /lib/libc.so ]] ; then
+    FS_libc=/lib/libc.so
+  elif [[ -e /lib64/libc.so.6 ]] ; then
+    FS_libc=/lib64/libc.so.6
+  elif [[ -e /lib/i386-linux-gnu/libc.so.6 ]] ; then
+    FS_libc=/lib/i386-linux-gnu/libc.so.6
+  elif [[ -e /lib/x86_64-linux-gnu/libc.so.6 ]] ; then
+    FS_libc=/lib/x86_64-linux-gnu/libc.so.6
+  elif [[ -e /lib/arm-linux-gnueabihf/libc.so.6 ]] ; then
+    FS_libc=/lib/arm-linux-gnueabihf/libc.so.6
+  elif [[ -e /lib/aarch64-linux-gnu/libc.so.6 ]] ; then
+    FS_libc=/lib/aarch64-linux-gnu/libc.so.6
+  elif [[ -e /usr/x86_64-gentoo-linux-musl/bin/ld ]] ; then
+    FS_libc=/usr/x86_64-gentoo-linux-musl/bin/ld
+  else
+    printf "\033[31mError: libc not found.\033[m\n\n"
+    exit 1
+  fi
+
+  FS_chk_func_libc="$(${readelf} -s $FS_libc 2>/dev/null | sed -ne 's/.*__\(.*_chk\)@@.*/\1/p')"
+  FS_func_libc="${FS_chk_func_libc//_chk/}"
+  FS_functions="$(${readelf} --dyn-syms "${1}" 2>/dev/null | awk '{ print $8 }' | sed -e 's/_*//' -e 's/@.*//' -e '/^$/d')"
+  FS_cnt_checked=$(grep -cFxf <(sort <<< "${FS_chk_func_libc}") <(sort <<< "${FS_functions}"))
+  FS_cnt_unchecked=$(grep -cFxf <(sort <<< "${FS_func_libc}") <(sort <<< "${FS_functions}"))
+  FS_cnt_total=$((FS_cnt_unchecked+FS_cnt_checked))
+
+  if grep -q '_chk$' <<<"$FS_functions"; then
+    echo_message '\033[32mYes\033[m' 'Yes,' ' fortify_source="yes" ' '"fortify_source":"yes",'
+  else
+    echo_message "\033[31mNo\033[m" "No," ' fortify_source="no" ' '"fortify_source":"no",'
+  fi
+  echo_message "\t${FS_cnt_checked}\t" "${FS_cnt_checked}",  "fortified=\"${FS_cnt_checked}\" " "\"fortified\":\"${FS_cnt_checked}\","
+  echo_message "\t${FS_cnt_total}\t\t" "${FS_cnt_total}" "fortify-able=\"${FS_cnt_total}\"" "\"fortify-able\":\"${FS_cnt_total}\""
+}
+
+# check process(es)
+proccheck() {
+  ${debug} && echo -e "\n***function proccheck"
+  # check for RELRO support
+  ${debug} && echo "***function proccheck->RELRO"
+  if ${readelf} -l "${1}/exe" 2>/dev/null | grep -q 'Program Headers'; then
+    if ${readelf} -l "${1}/exe" 2>/dev/null | grep -q 'GNU_RELRO'; then
+      if ${readelf} -d "${1}/exe" 2>/dev/null | grep -q 'BIND_NOW'; then
+  echo_message '\033[32mFull RELRO   \033[m   ' 'Full RELRO,' ' relro="full"' '"relro":"full",'
+      else
+  echo_message '\033[33mPartial RELRO\033[m   ' 'Partial RELRO,' ' relro="partial"' '"relro":"partial",'
+      fi
+    else
+      echo_message '\033[31mNo RELRO     \033[m   ' 'No RELRO,' ' relro="no"' '"relro":"no",'
+    fi
+  else
+    echo -n -e '\033[31mPermission denied (please run as root)\033[m\n'
+    exit 1
+  fi
+
+  # check for stack canary support
+  ${debug} && echo -e "\n***function proccheck->canary"
+  if ${readelf} -s "${1}/exe" 2>/dev/null | grep -q 'Symbol table'; then
+    if ${readelf} -s "${1}/exe" 2>/dev/null | grep -Eq '__stack_chk_fail|__intel_security_cookie'; then
+      echo_message '\033[32mCanary found         \033[m   ' 'Canary found,' ' canary="yes"' '"canary":"yes",'
+    else
+      echo_message '\033[31mNo canary found      \033[m   ' 'No Canary found,' ' canary="no"' '"canary":"no",'
+    fi
+  else
+    if [[ "${1}" == "1" ]] ; then
+      echo_message '\033[33mPermission denied    \033[m   ' 'Permission denied,' ' canary="Permission denied"' '"canary":"Permission denied",'
+    else
+      echo_message '\033[33mNo symbol table found \033[m  ' 'No symbol table found,' ' canary="No symbol table found"' '"canary":"No symbol table found",'
+    fi
+  fi
+
+  if ${extended_checks}; then
+    # check if compiled with Clang CFI
+    $debug && echo -e "\n***function proccheck->clangcfi"
+    #if $readelf -s "$1" 2>/dev/null | grep -Eq '\.cfi'; then
+    read -r -a cfifunc <<< "$($readelf -s "$1/exe" 2>/dev/null | grep .cfi | awk '{ print $8 }')"
+    func=${cfifunc/.cfi/}
+    # TODO: fix this check properly, need more clang CFI files to be able to test properly
+    # shellcheck disable=SC2128
+    if [ -n "$cfifunc" ] && $readelf -s "$1/exe" 2>/dev/null | grep -q "$func$"; then
+      echo_message '\033[32mClang CFI found   \033[m   ' 'with CFI,' ' clangcfi="yes"' '"clangcfi":"yes",'
+    else
+      echo_message '\033[31mNo Clang CFI found\033[m   ' 'without CFI,' ' clangcfi="no"' '"clangcfi":"no",'
+    fi
+
+    # check if compiled with Clang SafeStack
+    $debug && echo -e "\n***function proccheck->safestack"
+    if $readelf -s "$1/exe" 2>/dev/null | grep -Eq '__safestack_init'; then
+      echo_message '\033[32mSafeStack found   \033[m   ' 'with SafeStack,' ' safestack="yes"' '"safestack":"yes",'
+    else
+      echo_message '\033[31mNo SafeStack found\033[m   ' 'without SafeStack,' ' safestack="no"' '"safestack":"no",'
+    fi
+  fi
+
+  # check for Seccomp mode
+  ${debug} && echo -e "\n***function proccheck->Seccomp"
+  seccomp=$(grep 'Seccomp:' "${1}/status" 2> /dev/null | cut -b10)
+  if [[ "${seccomp}" == "1" ]] ; then
+    echo_message '\033[32mSeccomp strict\033[m   ' 'Seccomp strict,' ' seccomp="strict"' '"seccomp":"strict",'
+  elif [[ "${seccomp}" == "2" ]] ; then
+    echo_message '\033[32mSeccomp-bpf   \033[m   ' 'Seccomp-bpf,' ' seccomp="bpf"' '"seccomp":"bpf",'
+  else
+    echo_message '\033[31mNo Seccomp    \033[m   ' 'No Seccomp,' ' seccomp="no"' '"seccomp":"no",'
+  fi
+
+  # first check for PaX support
+  ${debug} && echo -e "\n***function proccheck->PAX"
+  if grep -q 'PaX:' "${1}/status" 2> /dev/null ; then
+    pageexec=$(grep 'PaX:' "${1}/status" 2> /dev/null | cut -b6)
+    segmexec=$(grep 'PaX:' "${1}/status" 2> /dev/null | cut -b10)
+    mprotect=$(grep 'PaX:' "${1}/status" 2> /dev/null | cut -b8)
+    randmmap=$(grep 'PaX:' "${1}/status" 2> /dev/null | cut -b9)
+    if [[ "${pageexec}" = "P" || "${segmexec}" = "S" ]] && [[ "${mprotect}" = "M" && "${randmmap}" = "R" ]] ; then
+      echo_message '\033[32mPaX enabled\033[m   ' 'Pax enabled,' ' pax="yes"' '"pax":"yes",'
+    elif [[ "${pageexec}" = "p" && "${segmexec}" = "s" && "${randmmap}" = "R" ]] ; then
+      echo_message '\033[33mPaX ASLR only\033[m ' 'Pax ASLR only,' ' pax="aslr_only"' '"pax":"aslr_only",'
+    elif [[ "${pageexec}" = "P" || "${segmexec}" = "S" ]] && [[ "${mprotect}" = "m" && "${randmmap}" = "R" ]] ; then
+      echo_message '\033[33mPaX mprot off \033[m' 'Pax mprot off,' ' pax="mprot_off"' '"pax":"mprot_off",'
+    elif [[ "${pageexec}" = "P" || "${segmexec}" = "S" ]] && [[ "${mprotect}" = "M" && "${randmmap}" = "r" ]] ; then
+      echo_message '\033[33mPaX ASLR off\033[m  ' 'Pax ASLR off,' ' pax="aslr_off"' '"pax":"aslr_off",'
+    elif [[ "${pageexec}" = "P" || "${segmexec}" = "S" ]] && [[ "${mprotect}" = "m" && "${randmmap}" = "r" ]] ; then
+      echo_message '\033[33mPaX NX only\033[m   ' 'Pax NX only,' ' pax="nx_only"' '"pax":"nx_only",'
+    else
+      echo_message '\033[31mPaX disabled\033[m  ' 'Pax disabled,' ' pax="no"' '"pax":"no",'
+    fi
+  # fallback check for NX support
+  ${debug} && echo -e "\n***function proccheck->NX"
+  elif ${readelf} -l "${1}/exe" 2>/dev/null | grep 'GNU_STACK' | grep -q 'RWE'; then
+    echo_message '\033[31mNX disabled\033[m   ' 'NX disabled,' ' nx="no"' '"nx":"no",'
+  else
+    echo_message '\033[32mNX enabled \033[m   ' 'NX enabled,' ' pax="yes"' '"nx":"yes",'
+  fi
+
+  # check for PIE support
+  ${debug} && echo -e "\n***function proccheck->PIE"
+  if ${readelf} -h "${1}/exe" 2>/dev/null | grep -q 'Type:[[:space:]]*EXEC'; then
+    echo_message '\033[31mNo PIE               \033[m   ' 'No PIE,' ' pie="no"' '"pie":"no",'
+  elif ${readelf} -h "${1}/exe" 2>/dev/null | grep -q 'Type:[[:space:]]*DYN'; then
+    if ${readelf} -d "${1}/exe" 2>/dev/null | grep -q 'DEBUG'; then
+      echo_message '\033[32mPIE enabled          \033[m   ' 'PIE enabled,' ' pie="yes"' '"pie":"yes",'
+    else
+      echo_message '\033[33mDynamic Shared Object\033[m   ' 'Dynamic Shared Object,' ' pie="dso"' '"pie":"dso",'
+    fi
+  else
+    echo_message '\033[33mNot an ELF file      \033[m   ' 'Not an ELF file,' ' pie="not_elf"' '"pie":"not_elf",'
+  fi
+
+  if ${extended_checks}; then
+    # check for selfrando support
+    ${debug} && echo -e "\n***function proccheck->selfrando"
+    if ${readelf} -S "${1}/exe" 2>/dev/null | grep -c txtrp | grep -q '1'; then
+      echo_message '\033[32mSelfrando enabled    \033[m   '
+    else
+      echo_message '\033[31mNo Selfrando         \033[m   '
+    fi
+  fi 
+
+  #check for forifty source support
+  FS_functions="$(${readelf} -s "${1}/exe" 2>/dev/null | awk '{ print $8 }' | sed 's/_*//' | sed -e 's/@.*//')"
+  if grep -q '_chk$' <<<"$FS_functions"; then
+    echo_message '\033[32mYes\033[m' 'Yes' " fortify_source='yes'>" '"fortify_source":"yes" }'
+  else
+    echo_message "\033[31mNo\033[m" "No" " fortify_source='no'>" '"fortify_source":"no" }'
+  fi
+}
+
+# check mapped libraries
+libcheck() {
+  ${debug} && echo "***function libcheck"
+  IFS=" " read -r -a libs <<< "$(awk '{ print $6 }' "/proc/${1}/maps" | grep '/' | sort -u | xargs file | grep ELF | awk '{ print $1 }' | sed 's/:/ /')"
+  echo_message "\n* Loaded libraries (file information, # of mapped files: ${#libs[@]}):\n\n" "" "" "\"libs\": {"
+
+  for ((element=0; element<${#libs[@]}; element++))
+  do
+    echo_message "  ${libs[$element]}:\n" "${libs[$element]}," "" ""
+    echo_message "    " "" "    " ""
+    filecheck "${libs[$element]}"
+    if [[ ${element} == $((${#libs[@]} - 1)) ]]; then
+      echo_message "\n\n" "\n" " filename='${libs[$element]}' />\n" ""
+    else
+      echo_message "\n\n" "\n" " filename='${libs[$element]}' />\n" "},"
+    fi
+  done
+}
+
+# check for system-wide ASLR support
+aslrcheck() {
+  ${debug} && echo "***function aslrcheck"
+  # PaX ASLR support
+  ${debug} && echo -e "\n***function aslrcheck->PAX ASLR"
+  if ! (grep -q 'Name:' /proc/1/status 2> /dev/null) ; then
+    echo_message '\033[33m insufficient privileges for PaX ASLR checks\033[m\n' '' '' ''
+    echo_message '  Fallback to standard Linux ASLR check' '' '' ''
+  fi
+
+  if grep -q 'PaX:' /proc/1/status 2> /dev/null; then
+    if grep -q 'PaX:' /proc/1/status 2> /dev/null | grep -q 'R'; then
+      echo_message '\033[32mPaX ASLR enabled\033[m\n\n' '' '' ''
+    else
+      echo_message '\033[31mPaX ASLR disabled\033[m\n\n' '' '' ''
+    fi
+  else
+  ${debug} && echo -e "\n***function aslrcheck->randomize_va_space"
+    # standard Linux 'kernel.randomize_va_space' ASLR support
+    # (see the kernel file 'Documentation/sysctl/kernel.txt' for a detailed description)
+    echo_message " (kernel.randomize_va_space): " '' '' ''
+    if sysctl -a 2>/dev/null | grep -q 'kernel.randomize_va_space = 1'; then
+      echo_message '\033[33mPartial (Setting: 1)\033[m\n\n' '' '' ''
+      echo_message "  Description - Make the addresses of mmap base, stack and VDSO page randomized.\n" '' '' ''
+      echo_message "  This, among other things, implies that shared libraries will be loaded to \n" '' '' ''
+      echo_message "  random addresses. Also for PIE-linked binaries, the location of code start\n" '' '' ''
+      echo_message "  is randomized. Heap addresses are *not* randomized.\n\n" '' '' ''
+    elif sysctl -a 2>/dev/null | grep -q 'kernel.randomize_va_space = 2'; then
+      echo_message '\033[32mFull (Setting: 2)\033[m\n\n' '' '' ''
+      echo_message "  Description - Make the addresses of mmap base, heap, stack and VDSO page randomized.\n" '' '' ''
+      echo_message "  This, among other things, implies that shared libraries will be loaded to random \n" '' '' ''
+      echo_message "  addresses. Also for PIE-linked binaries, the location of code start is randomized.\n\n" '' '' ''
+    elif sysctl -a 2>/dev/null | grep -q 'kernel.randomize_va_space = 0'; then
+      echo_message '\033[31mNone (Setting: 0)\033[m\n' '' '' ''
+    else
+      echo_message '\033[31mNot supported\033[m\n' '' '' ''
+    fi
+    echo_message "  See the kernel file 'Documentation/sysctl/kernel.txt' for more details.\n\n" '' '' ''
+  fi
+}
+
+# check cpu nx flag
+nxcheck() {
+  ${debug} && echo -e "\n***function nxcheck"
+  if grep -qFw nx /proc/cpuinfo; then
+    echo_message '\033[32mYes\033[m\n\n' '' '' ''
+  else
+    echo_message '\033[31mNo\033[m\n\n' '' '' ''
+  fi
+}
+
+#Check core dumps restricted?
+coredumpcheck() {
+        ${debug} && echo -e "\n***function coredumpcheck"
+        coreValue=$(grep -Exic "hard[[:blank:]]+core[[:blank:]]+0" /etc/security/limits.conf)
+        coreValueDefault=$(grep -Exic "\*[[:blank:]]+hard[[:blank:]]+core[[:blank:]]+0" /etc/security/limits.conf)
+        dumpableValue=$(sysctl -b -e fs.suid_dumpable)
+        if { [[ "${coreValue}" == 1 ]] || [[ "${coreValueDefault}" == 1 ]]; } && { [[ "${dumpableValue}" == 0 ]] || [[ "${dumpableValue}" == 2 ]]; }; then
+                echo_message '\033[32mRestricted\033[m\n\n' '' '' ''
+        else
+                echo_message '\033[31mNot Restricted\033[m\n\n' '' '' ''
+        fi
+}
+
+# check for kernel protection mechanisms
+kernelcheck() {
+  ${debug} && echo "***function kernelcheck"
+  echo_message "  Description - List the status of kernel protection mechanisms. Rather than\n" '' '' ''
+  echo_message "  inspect kernel mechanisms that may aid in the prevention of exploitation of\n" '' '' ''
+  echo_message "  userspace processes, this option lists the status of kernel configuration\n" '' '' ''
+  echo_message "  options that harden the kernel itself against attack.\n\n" '' '' ''
+  echo_message "  Kernel config:\n" '' '' '{ "kernel": '
+
+  if [[ ! "${1}" == "" ]] ; then
+    kconfig="cat ${1}"
+    echo_message "  Warning: The config ${1} on disk may not represent running kernel config!\n\n" "${1}" "<kernel config=\"${1}\"" "{ \"KernelConfig\":\"${1}\""
+    # update the architecture based on the config rather than the system
+    if ${kconfig} | grep -qi 'CONFIG_ARM=y\|CONFIG_ARM=y'; then
+      arch="arm"
+    fi
+    if ${kconfig} | grep -qi 'CONFIG_ARM64=y'; then
+      arch="aarch64"
+    fi
+    if ${kconfig} | grep -qi 'CONFIG_X86_64=y'; then
+      arch="64"
+    fi
+    if ${kconfig} | grep -qi 'CONFIG_X86_32=y'; then
+      arch="32"
+    fi
+  elif [[ -f /proc/config.gz ]] ; then
+    kconfig="zcat /proc/config.gz"
+    echo_message "\033[32m/proc/config.gz\033[m\n\n" '/proc/config.gz' '<kernel config="/proc/config.gz"' '{ "KernelConfig":"/proc/config.gz"'
+  elif [[ -f /boot/config-"$(uname -r)" ]] ; then
+    kern=$(uname -r)
+    kconfig="cat /boot/config-${kern}"
+    echo_message "\033[33m    /boot/config-${kern}\033[m\n\n" "/boot/config-${kern}," "<kernel config='/boot/config-${kern}'" "{ \"KernelConfig\":\"/boot/config-${kern}\""
+    echo_message "  Warning: The config on disk may not represent running kernel config!\n           Running kernel: ${kern}\n\n" "" "" ""
+  elif [[ -f "${KBUILD_OUTPUT:-/usr/src/linux}"/.config ]] ; then
+    kconfig="cat ${KBUILD_OUTPUT:-/usr/src/linux}/.config"
+    echo_message "\033[33m${KBUILD_OUTPUT:-/usr/src/linux}/.config\033[m\n\n" "${KBUILD_OUTPUT:-/usr/src/linux}/.config," "<kernel config='${KBUILD_OUTPUT:-/usr/src/linux}/.config'" "{ \"KernelConfig\":\"${KBUILD_OUTPUT:-/usr/src/linux}/.config\""
+    echo_message "  Warning: The config on disk may not represent running kernel config!\n\n" "" "" ""
+  else
+    echo_message "\033[31mNOT FOUND\033[m\n\n" "NOT FOUND,,,,,,," "<kernel config='not_found' />" '{ "KernelConfig":"not_found" } }'
+    exit 0
+  fi
+  ${debug} && ${kconfig} | grep "CONFIG_GRKERNSEC"
+  ${debug} && ${kconfig} | grep "CONFIG_PAX"
+
+  echo_message "  Vanilla Kernel ASLR:                    " "" "" ""
+  randomize_va=$(sysctl -b -e kernel.randomize_va_space)
+  if [[ "x${randomize_va}" == "x2" ]]; then
+    echo_message "\033[32mFull\033[m\n" "Full," " randomize_va_space='full'" ', "randomize_va_space":"full"'
+  elif [[ "x${randomize_va}" == "x1" ]]; then
+    echo_message "\033[33mPartial\033[m\n" "Partial," " randomize_va_space='partial'" ', "randomize_va_space":"partial"'
+  else
+    echo_message "\033[31mNone\033[m\n" "None," " randomize_va_space='none'" ', "randomize_va_space":"none"'
+  fi
+
+  echo_message "  NX protection:                          " "" "" ""
+  if (command_exists dmesg) && (root_privs); then
+      nx_protection=$(dmesg -t 2>/dev/null | grep -Fw NX)
+    if [[ "x${nx_protection}" == "xNX (Execute Disable) protection: active" ]]; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " nx_protection='yes'" ', "nx_protection":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " nx_protection='no'" ', "nx_protection":"no"'
+    fi
+  else
+    echo_message "\033[33mSkipped\033[m\n" "Skipped," " nx_protection='skipped'" ', "nx_protection":"skipped"'
+  fi
+
+  echo_message "  Protected symlinks:                     " "" "" ""
+  symlink=$(sysctl -b -e fs.protected_symlinks)
+  if [[ "x${symlink}" == "x1" ]]; then
+    echo_message "\033[32mEnabled\033[m\n" "Enabled," " protect_symlinks='yes'" ', "protect_symlinks":"yes"'
+  else
+    echo_message "\033[31mDisabled\033[m\n" "Disabled," " protect_symlinks='no'" ', "protect_symlinks":"no"'
+  fi
+
+  echo_message "  Protected hardlinks:                    " "" "" ""
+  hardlink=$(sysctl -b -e fs.protected_hardlinks)
+  if [[ "x${hardlink}" == "x1" ]]; then
+    echo_message "\033[32mEnabled\033[m\n" "Enabled," " protect_hardlinks='yes'" ', "protect_hardlinks":"yes"'
+  else
+    echo_message "\033[31mDisabled\033[m\n" "Disabled," " protect_hardlinks='no'" ', "protect_hardlinks":"no"'
+  fi
+
+  echo_message "  Protected fifos:                        " "" "" ""
+  fifos=$(sysctl -b -e fs.protected_fifos)
+  if [[ "x${fifos}" == "x" ]]; then
+    echo_message "\033[33mUnsupported\033[m\n" "Unsupported," " protect_fifos='unsupported'" ', "protect_fifos":"unsupported"'
+  elif [[ "x${fifos}" == "x2" ]]; then
+    echo_message "\033[32mEnabled\033[m\n" "Enabled," " protect_fifos='yes'" ', "protect_fifos":"yes"'
+  else
+    echo_message "\033[31mDisabled\033[m\n" "Disabled," " protect_fifos='no'" ', "protect_fifos":"no"'
+  fi
+
+  echo_message "  Protected regular:                      " "" "" ""
+  regular=$(sysctl -b -e fs.protected_regular)
+  if [[ "x${regular}" == "x" ]]; then
+    echo_message "\033[33mUnsupported\033[m\n" "Unsupported," " protect_regular='unsupported'" ', "protect_regular":"unsupported"'
+  elif [[ "x${regular}" == "x2" ]]; then
+    echo_message "\033[32mEnabled\033[m\n" "Enabled," " protect_regular='yes'" ', "protect_regular":"yes"'
+  else
+    echo_message "\033[31mDisabled\033[m\n" "Disabled," " protect_regular='no'" ', "protect_regular":"no"'
+  fi
+
+  echo_message "  Ipv4 reverse path filtering:            " "" "" ""
+  ipv4_rpath=$(sysctl -b -e net.ipv4.conf.all.rp_filter)
+  if [[ "x${ipv4_rpath}" == "x1" ]]; then
+    echo_message "\033[32mEnabled\033[m\n" "Enabled," " ipv4_rpath='yes'" ', "ipv4_rpath":"yes"'
+  else
+    echo_message "\033[31mDisabled\033[m\n" "Disabled," " ipv4_rpath='no'" ', "ipv4_rpath":"no"'
+  fi
+
+  echo_message "  Kernel heap randomization:              " "" "" ""
+  # NOTE: y means it turns off kernel heap randomization for backwards compatibility (libc5)
+  if ${kconfig} | grep -qi 'CONFIG_COMPAT_BRK=y'; then
+    echo_message "\033[31mDisabled\033[m\n" "Disabled," " kernel_heap_randomization='no'" ', "kernel_heap_randomization":"no"'
+  else
+    echo_message "\033[32mEnabled\033[m\n" "Enabled," " kernel_heap_randomization='yes'" ', "kernel_heap_randomization":"yes"'
+  fi
+
+  if ${kconfig} | grep -qi 'CONFIG_CC_STACKPROTECTOR' || ${kconfig} | grep -qa 'CONFIG_STACKPROTECTOR'; then
+    echo_message "  GCC stack protector support:            " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_CC_STACKPROTECTOR=y' || ${kconfig} | grep -qi 'CONFIG_STACKPROTECTOR=y' ; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " gcc_stack_protector='yes'" ', "gcc_stack_protector":"yes"'
+
+      if ${kconfig} | grep -qi 'CONFIG_CC_STACKPROTECTOR_STRONG' || ${kconfig} | grep -qi 'CONFIG_STACKPROTECTOR_STRONG'; then
+        echo_message "  GCC stack protector strong:             " "" "" ""
+        if ${kconfig} | grep -qi 'CONFIG_CC_STACKPROTECTOR_STRONG=y' || ${kconfig} | grep -qi 'CONFIG_STACKPROTECTOR_STRONG=y'; then
+          echo_message "\033[32mEnabled\033[m\n" "Enabled," " gcc_stack_protector_strong='yes'" ', "gcc_stack_protector_strong":"yes"'
+        else
+          echo_message "\033[31mDisabled\033[m\n" "Disabled," " gcc_stack_protector_strong='no'" ', "gcc_stack_protector_strong":"no"'
+        fi
+      fi
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " gcc_stack_protector='no'" ', "gcc_stack_protector":"no"'
+    fi
+  fi
+
+  if ${kconfig} | grep -qi 'CONFIG_GCC_PLUGIN_STRUCTLEAK'; then
+    echo_message "  GCC structleak plugin:                  " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_GCC_PLUGIN_STRUCTLEAK=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " gcc_structleak='yes'" ', "gcc_structleak":"yes"'
+      echo_message "  GCC structleak by ref plugin:           " "" "" ""
+      if ${kconfig} | grep -qi 'CONFIG_GCC_PLUGIN_STRUCTLEAK_BYREF_ALL=y'; then
+        echo_message "\033[32mEnabled\033[m\n" "Enabled," " gcc_structleak_byref='yes'" ', "gcc_structleak_byref":"yes"'
+      else
+        echo_message "\033[32mEnabled\033[m\n" "Enabled," " gcc_structleak_byref='no'" ', "gcc_structleak_byref":"no"'
+      fi
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " gcc_structleak='no'" ', "gcc_structleak":"no"'
+    fi
+  fi
+
+  if ${kconfig} | grep -qi 'CONFIG_SLAB_FREELIST_RANDOM'; then
+    echo_message "  SLAB freelist randomization:            " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_SLAB_FREELIST_RANDOM=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " slab_freelist_randomization='yes'" ', "slab_freelist_randomization":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " slab_freelist_randomization='no'" ', "slab_freelist_randomization":"no"'
+    fi
+  fi
+
+  if ${kconfig} | grep -qi 'CPU_SW_DOMAIN_PAN=y'; then
+    echo_message "  Use CPU domains:                        " "" "" ""
+    if ${kconfig} | grep -qi 'CPU_SW_DOMAIN_PAN=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " cpu_sw_domain'yes'" ', "cpu_sw_domain":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " cpu_sw_domain='no'" ', "cpu_sw_domain":"no"'
+    fi
+  fi
+
+
+  if ${kconfig} | grep -qi 'CONFIG_VMAP_STACK'; then
+    echo_message "  Virtually-mapped kernel stack:          " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_VMAP_STACK=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " virtually_mapped_stack='yes'" ', "virtually_mapped_stack":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " virtually_mapped_stack='no'" ', "virtually_mapped_stack":"no"'
+    fi
+  fi
+
+
+  if ${kconfig} | grep -qi 'CONFIG_DEVMEM'; then
+    if ${kconfig} | grep -qi 'CONFIG_DEVMEM=y'; then
+      echo_message "  Restrict /dev/mem access:               " "" "" ""
+      if ${kconfig} | grep -qi 'CONFIG_STRICT_DEVMEM=y'; then
+        echo_message "\033[32mEnabled\033[m\n" "Enabled," " restrict_dev_mem_access='yes'" ', "restrict_dev_mem_access":"yes"'
+      else
+        echo_message "\033[31mDisabled\033[m\n" "Disabled," " restrict_dev_mem_access='no'" ', "restrict_dev_mem_access":"no"'
+      fi
+
+      echo_message "  Restrict I/O access to /dev/mem:        " "" "" ""
+      if ${kconfig} | grep -qi 'CONFIG_IO_STRICT_DEVMEM=y'; then
+        echo_message "\033[32mEnabled\033[m\n" "Enabled," " restrict_io_dev_mem_access='yes'" ', "restrict_io_dev_mem_access":"yes"'
+      else
+        echo_message "\033[31mDisabled\033[m\n" "Disabled," " restrict_io_dev_mem_access='no'" ', "restrict_io_dev_mem_access":"no"'
+      fi
+    fi
+  fi
+
+
+  if ! ${kconfig} | grep -qi 'CONFIG_PAX'; then
+    if ${kconfig} | grep -qi 'CONFIG_DEBUG_RODATA' || ${kconfig} | grep -qi '|CONFIG_STRICT_KERNEL_RWX'; then
+      echo_message "  Enforce read-only kernel data:          " "" "" ""
+      if ${kconfig} | grep -qi 'CONFIG_DEBUG_RODATA=y\|CONFIG_STRICT_KERNEL_RWX=y'; then
+        echo_message "\033[32mEnabled\033[m\n" "Enabled," " ro_kernel_data='yes'" ', "ro_kernel_data":"yes"'
+        echo_message "  Enforce read-only module data:          " "" "" ""
+        if ${kconfig} | grep -qi 'CONFIG_STRICT_MODULE_RWX=y\|CONFIG_DEBUG_SET_MODULE_RONX'; then
+          echo_message "\033[32mEnabled\033[m\n" "Enabled," " ro_module_data='yes'" ', "ro_module_data":"yes"'
+        else
+          echo_message "\033[31mDisabled\033[m\n" "Disabled," " ro_module_data='no'" ', "ro_module_data":"no"'
+        fi
+      else
+        echo_message "\033[31mDisabled\033[m\n" "Disabled," " ro_kernel_data='no'" ', "ro_kernel_data":"no"'
+      fi
+    fi
+  fi
+
+  if ${kconfig} | grep -qi 'CONFIG_REFCOUNT_FULL'; then
+    echo_message "  Full reference count validation:        " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_REFCOUNT_FULL=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " full_refcount_validation='yes'" ', "full_refcount_validation":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " full_refcount_validation='no'" ', "full_refcount_validation":"no"'
+    fi
+  fi
+
+  echo_message "  Exec Shield:                            " """" ""
+  execshield=$(sysctl -b -e kernel.exec-shield)
+  if [[ "x${execshield}" == "x" ]]; then
+    echo_message '\033[32mUnsupported\033[m\n\n' '' '' ''
+  elif [[ "x${execshield}" == "x1" ]]; then
+    echo_message '\033[32mEnabled\033[m\n\n' '' '' ''
+  else
+    echo_message '\033[31mDisabled\033[m\n\n' '' '' ''
+  fi
+
+  if ${kconfig} | grep -qi 'CONFIG_HARDENED_USERCOPY'; then
+    echo_message "  Hardened Usercopy:                      " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_HARDENED_USERCOPY=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " hardened_usercopy='yes'" ', "hardened_usercopy":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " hardened_usercopy='no'" ', "hardened_usercopy":"no"'
+    fi
+  fi
+
+  if ${kconfig} | grep -qi 'CONFIG_FORTIFY_SOURCE'; then
+    echo_message "  Harden str/mem functions:               " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_FORTIFY_SOURCE=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " fortify_source='yes'" ', "fortify_source":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " fortify_source='no'" ', "fortify_source":"no"'
+    fi
+  fi
+
+  if ${kconfig} | grep -qi 'CONFIG_DEVKMEM'; then
+    echo_message "  Restrict /dev/kmem access:              " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_DEVKMEM=y'; then
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " restrict_dev_kmem_access='no'" ', "restrict_dev_kmem_access":"no"'
+    else
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " restrict_dev_kmem_access='yes'" ', "restrict_dev_kmem_access":"yes"'
+    fi
+  fi
+
+  #x86 only
+  if [[ "${arch}" == "32" ]] || [[ "${arch}" == "64" ]]; then
+    echo_message "\n" "\n" "" ""
+    echo_message "* X86 only:            \n" "" "" ""
+
+    if ! ${kconfig} | grep -qi 'CONFIG_PAX_SIZE_OVERFLOW=y'; then
+      if ${kconfig} | grep -qi 'CONFIG_DEBUG_STRICT_USER_COPY_CHECKS'; then
+        echo_message "  Strict user copy checks:                " "" "" ""
+        if ${kconfig} | grep -qi 'CONFIG_DEBUG_STRICT_USER_COPY_CHECKS=y'; then
+          echo_message "\033[32mEnabled\033[m\n" "Enabled," " strict_user_copy_check='yes'" ', "strict_user_copy_check":"yes"'
+        else
+          echo_message "\033[31mDisabled\033[m\n" "Disabled," " strict_user_copy_check='no'" ', "strict_user_copy_check":"no"'
+        fi
+      fi
+    fi
+
+    if ${kconfig} | grep -qi 'CONFIG_RANDOMIZE_BASE' || ${kconfig} | grep -qi 'CONFIG_PAX_ASLR'; then
+      echo_message "  Address space layout randomization:     " "" "" ""
+      if ${kconfig} | grep -qi 'CONFIG_RANDOMIZE_BASE=y' || ${kconfig} | grep -qi 'CONFIG_PAX_ASLR=y'; then
+        echo_message "\033[32mEnabled\033[m\n" "Enabled," " random_address_space_layout='yes'" ', "random_address_space_layout":"yes"'
+      else
+        echo_message "\033[31mDisabled\033[m\n" "Disabled," " random_address_space_layout='no'" ', "random_address_space_layout":"no"'
+      fi
+    fi
+  fi
+
+  #ARM only
+  if [[ "${arch}" == "arm" ]]; then
+    echo_message "\n" "\n" "\n" ""
+    echo_message "* ARM only:            \n" "" "" ""
+
+    if ${kconfig} | grep -qi 'CONFIG_ARM_KERNMEM_PERMS'; then
+      echo_message "  Restrict kernel memory permissions:     " "" "" ""
+      if ${kconfig} | grep -qi 'CONFIG_ARM_KERNMEM_PERMS=y'; then
+        echo_message "\033[32mEnabled\033[m\n" "Enabled," " arm_kernmem_perms='yes'" ', "arm_kernmem_perms":"yes"'
+      else
+        echo_message "\033[31mDisabled\033[m\n" "Disabled," " arm_kernmem_perms='no'" ', "arm_kernmem_perms":"no"'
+      fi
+    fi
+
+    if ${kconfig} | grep -qi 'CONFIG_DEBUG_ALIGN_RODATA'; then
+      echo_message "  Make rodata strictly non-excutable:     " "" "" ""
+      if ${kconfig} | grep -qi 'CONFIG_DEBUG_ALIGN_RODATA=y'; then
+        echo_message "\033[32mEnabled\033[m\n" "Enabled," " arm_strict_rodata='yes'" ', "arm_strict_rodata":"yes"'
+      else
+        echo_message "\033[31mDisabled\033[m\n" "Disabled," " arm_strict_rodata='no'" ', "arm_strict_rodata":"no"'
+      fi
+    fi
+
+  fi
+
+  #ARM64 only
+  if [[ "${arch}" == "aarch64" ]]; then
+    echo_message "\n" "\n" "\n" ""
+    echo_message "* ARM64 only:            \n" "" "" ""
+
+    if ${kconfig} | grep -qi 'CONFIG_UNMAP_KERNEL_AT_EL0'; then
+      echo_message "  Unmap kernel in userspace (KAISER):     " "" "" ""
+      if ${kconfig} | grep -qi 'CONFIG_UNMAP_KERNEL_AT_EL0=y'; then
+        echo_message "\033[32mEnabled\033[m\n" "Enabled," " unmap_kernel_in_userspace='yes'" ', "unmap_kernel_in_userspace":"yes"'
+      else
+        echo_message "\033[31mDisabled\033[m\n" "Disabled," " unmap_kernel_in_userspace='no'" ', "unmap_kernel_in_userspace":"no"'
+      fi
+    fi
+
+    if ${kconfig} | grep -qi 'CONFIG_HARDEN_BRANCH_PREDICTOR'; then
+      echo_message "  Harden branch predictor:                " "" "" ""
+      if ${kconfig} | grep -qi 'CONFIG_HARDEN_BRANCH_PREDICTOR=y'; then
+        echo_message "\033[32mEnabled\033[m\n" "Enabled," " harden_branch_predictor='yes'" ', "harden_branch_predictor":"yes"'
+      else
+        echo_message "\033[31mDisabled\033[m\n" "Disabled," " harden_branch_predictor='no'" ', "harden_branch_predictor":"no"'
+      fi
+    fi
+
+    if ${kconfig} | grep -qi 'CONFIG_HARDEN_EL2_VECTORS'; then
+      echo_message "  Harden EL2 vector mapping:              " "" "" ""
+      if ${kconfig} | grep -qi 'CONFIG_HARDEN_EL2_VECTORS=y'; then
+        echo_message "\033[32mEnabled\033[m\n" "Enabled," " harden_el2_vector_mapping='yes'" ', "harden_el2_vector_mapping":"yes"'
+      else
+        echo_message "\033[31mDisabled\033[m\n" "Disabled," " harden_el2_vector_mapping='no'" ', "harden_el2_vector_mapping":"no"'
+      fi
+    fi
+
+    if ${kconfig} | grep -qi 'CONFIG_ARM64_SSBD'; then
+      echo_message "  Speculative store bypass disable:       " "" "" ""
+      if ${kconfig} | grep -qi 'CONFIG_ARM64_SSBD=y'; then
+        echo_message "\033[32mEnabled\033[m\n" "Enabled," " speculative_store_bypass_disable='yes'" ', "speculative_store_bypass_disable":"yes"'
+      else
+        echo_message "\033[31mDisabled\033[m\n" "Disabled," " speculative_store_bypass_disable='no'" ', "speculative_store_bypass_disable":"no"'
+      fi
+    fi
+
+    if ${kconfig} | grep -qi 'CONFIG_ARM64_SW_TTBR0_PAN'; then
+      echo_message "  Emulate privileged access never:        " "" "" ""
+      if ${kconfig} | grep -qi 'CONFIG_ARM64_SW_TTBR0_PAN=y'; then
+        echo_message "\033[32mEnabled\033[m\n" "Enabled," " emulate_privileged_access_never='yes'" ', "emulate_privileged_access_never":"yes"'
+      else
+        echo_message "\033[31mDisabled\033[m\n" "Disabled," " emulate_privileged_access_never='no'" ', "emulate_privileged_access_never":"no"'
+      fi
+    fi
+
+    if ${kconfig} | grep -qi 'CONFIG_RANDOMIZE_BASE'; then
+      echo_message "  Randomize address of kernel image:      " "" "" ""
+      if ${kconfig} | grep -qi 'CONFIG_RANDOMIZE_BASE=y'; then
+        echo_message "\033[32mEnabled\033[m\n" "Enabled," " randomize_kernel_address='yes'" ', "randomize_kernel_address":"yes"'
+      else
+        echo_message "\033[31mDisabled\033[m\n" "Disabled," " randomize_kernel_address='no'" ', "randomize_kernel_address":"no"'
+      fi
+    fi
+
+    if ${kconfig} | grep -qi 'CONFIG_RANDOMIZE_MODULE_REGION_FULL'; then
+      echo_message "  Randomize module region over 4GB:       " "" "" ""
+      if ${kconfig} | grep -qi 'CONFIG_RANDOMIZE_MODULE_REGION_FULL=y'; then
+        echo_message "\033[32mEnabled\033[m\n" "Enabled," " randomize_module_region_full='yes'" ', "randomize_module_region_full":"yes"'
+      else
+        echo_message "\033[31mDisabled\033[m\n" "Disabled," " randomize_module_region_full='no'" ', "randomize_module_region_full":"no"'
+      fi
+    fi
+  fi
+
+  echo_message "" "" ">" "},"
+  
+
+  echo_message "\n" "\n" "\n" ""
+  echo_message "* SELinux:                                " "" "" ""
+  if ${kconfig} | grep -qi 'CONFIG_SECURITY_SELINUX=y'; then
+  getsestatus
+  sestatus=$?
+  if [[ ${sestatus} == 0 ]]; then
+      echo_message "\033[31mDisabled\033[m\n" "Disabled,," "    <selinux enabled='no'" '"selinux":{ "enabled":"no"'
+      echo_message "\n  SELinux information available here: \n" "" "" ""
+      echo_message "    https://selinuxproject.org/\n" "" "" ""
+  elif [[ ${sestatus} == 1 ]]; then
+      echo_message "\033[33mPermissive\033[m\n" "Permissive," "    <selinux enabled='yes' mode='permissive'" '"selinux":{ "enabled":"yes", "mode":"permissive"'
+  elif [[ ${sestatus} == 2 ]]; then
+      echo_message "\033[32mEnforcing\033[m\n" "Enforcing," "    <selinux enabled='yes' mode='enforcing'" '"selinux":{ "enabled":"yes", "mode":"enforcing"'
+  fi
+  else
+    echo_message "\033[31mNo SELinux\033[m\n" "Disabled,," "    <selinux enabled='no'" '"selinux":{ "enabled":"no"'
+    echo_message "\n  SELinux information available here: \n" "" "" ""
+    echo_message "    https://selinuxproject.org/\n" "" "" ""
+  fi
+
+  if [[ ${sestatus} == 1 ]] || [[ ${sestatus} == 2 ]]; then
+    echo_message "  Checkreqprot:                         " "" "" ""
+    if [[ $(cat /sys/fs/selinux/checkreqprot) == 0 ]]; then
+      echo_message "\033[32m  Enabled\033[m\n" "Enabled," " checkreqprot='yes'" ', "checkreqprot":"yes"'
+    else
+      echo_message "\033[31m  Disabled\033[m\n" "Disabled," " checkreqprot='no'" ', "checkreqprot":"no"'
+    fi
+
+    echo_message "  Deny Unknown:                         " "" "" ""
+    if [[ $(cat /sys/fs/selinux/deny_unknown) == 1 ]]; then
+      echo_message "\033[32m  Enabled\033[m\n" "Enabled" " deny_unknown='yes'" ', "deny_unknown":"yes"'
+    else
+      echo_message "\033[31m  Disabled\033[m\n" "Disabled" " deny_unknown='no'" ', "deny_unknown":"no"'
+    fi
+  fi
+
+  echo_message "\n" "\n" " />\n" " }"
+  echo_message "* grsecurity / PaX:                       " "" "" ""
+
+  if ${kconfig} | grep -qi 'CONFIG_GRKERNSEC=y'; then
+    if ${kconfig} | grep -qi 'CONFIG_GRKERNSEC_HIGH=y'; then
+      echo_message "\033[32mHigh GRKERNSEC\033[m\n\n" "High GRKERNSEC," "    <grsecurity config='high'" '"grsecurity": { "grsecurity_config":"high"'
+    elif ${kconfig} | grep -qi 'CONFIG_GRKERNSEC_MEDIUM=y'; then
+      echo_message "\033[33mMedium GRKERNSEC\033[m\n\n" "Medium GRKERNSEC," "    <grsecurity config='medium'" '"grsecurity": { "grsecurity_config":"medium"'
+    elif ${kconfig} | grep -qi 'CONFIG_GRKERNSEC_LOW=y'; then
+      echo_message "\033[31mLow GRKERNSEC\033[m\n\n" "Low GRKERNSEC," "    <grsecurity config='low'" '"grsecurity": { "grsecurity_config":"low"'
+    elif ${kconfig} | grep -qi 'CONFIG_GRKERNSEC_CONFIG_AUTO=y'; then
+      echo_message "\033[33mAuto GRKERNSEC\033[m\n\n" "Auto GRKERNSEC," "    <grsecurity config='auto'" '"grsecurity": { "grsecurity_config":"auto"'
+    elif ${kconfig} | grep -qi 'CONFIG_GRKERNSEC_CONFIG_CUSTOM=y'; then
+      echo_message "\033[33mCustom GRKERNSEC\033[m\n\n" "Custom GRKERNSEC," "    <grsecurity config='custom'" '"grsecurity": { "grsecurity_config":"custom"'
+    else
+      echo_message "\033[33mCustom GRKERNSEC\033[m\n\n" "Custom GRKERNSEC," "    <grsecurity config='custom'" '"grsecurity": { "grsecurity_config":"custom"'
+    fi
+
+    echo_message "  Non-executable kernel pages:            " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_PAX_KERNEXEC=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " config_pax_kernexec='yes'" ', "config_pax_kernexec":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " config_pax_kernexec='no'" ', "config_pax_kernexec":"no"'
+    fi
+
+    echo_message "  Non-executable pages:                   " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_PAX_NOEXEC=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " config_pax_noexec='yes'" ', "config_pax_noexec":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " config_pax_noexec='no'" ', "config_pax_noexec":"no"'
+    fi
+
+    echo_message "  Paging Based Non-executable pages:      " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_PAX_PAGEEXEC=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " config_pax_pageexec='yes'" ', "config_pax_pageexec":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " config_pax_pageexec='no'" ', "config_pax_pageexec":"no"'
+    fi
+
+    echo_message "  Restrict MPROTECT:                      " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_PAX_MPROTECT=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " config_pax_mprotect='yes'" ', "config_pax_mprotect":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " config_pax_mprotect='no'" ', "config_pax_mprotect":"no"'
+    fi
+
+    echo_message "  Address Space Layout Randomization:     " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_PAX_ASLR=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " config_pax_aslr='yes'" ', "config_pax_aslr":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " config_pax_aslr='no'" ', "config_pax_aslr":"no"'
+    fi
+
+    echo_message "  Randomize Kernel Stack:                 " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_PAX_RANDKSTACK=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " config_pax_randkstack='yes'" ', "config_pax_randkstack":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " config_pax_randkstack='no'" ', "config_pax_randkstack":"no"'
+    fi
+
+    echo_message "  Randomize User Stack:                   " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_PAX_RANDUSTACK=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " config_pax_randustack='yes'" ', "config_pax_randustack":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " config_pax_randustack='no'" ', "config_pax_randustack":"no"'
+    fi
+
+    echo_message "  Randomize MMAP Stack:                   " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_PAX_RANDMMAP=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " config_pax_randmmap='yes'" ', "config_pax_randmmap":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " config_pax_randmmap='no'" ', "config_pax_randmmap":"no"'
+    fi
+
+    echo_message "  Sanitize freed memory:                  " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_PAX_MEMORY_SANITIZE=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " config_pax_memory_sanitize='yes'" ', "config_pax_memory_sanitize":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " config_pax_memory_sanitize='no'" ', "config_pax_memory_sanitize":"no"'
+    fi
+
+    echo_message "  Sanitize Kernel Stack:                  " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_PAX_MEMORY_STACKLEAK=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " config_pax_memory_stackleak='yes'" ', "config_pax_memory_stackleak":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " config_pax_memory_stackleak='no'" ', "config_pax_memory_stackleak":"no"'
+    fi
+
+    echo_message "  Prevent userspace pointer deref:        " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_PAX_MEMORY_UDEREF=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " config_pax_memory_uderef='yes'" ', "config_pax_memory_uderef":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " config_pax_memory_uderef='no'" ', "config_pax_memory_uderef":"no"'
+    fi
+
+    echo_message "  Prevent kobject refcount overflow:      " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_PAX_REFCOUNT=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " config_pax_refcount='yes'" ', "config_pax_refcount":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " config_pax_refcount='no'" ', "config_pax_refcount":"no"'
+    fi
+
+    echo_message "  Bounds check heap object copies:        " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_PAX_USERCOPY=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " config_pax_usercopy='yes'" ', "config_pax_usercopy":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " config_pax_usercopy='no'" ', "config_pax_usercopy":"no"'
+    fi
+
+    echo_message "  JIT Hardening:                          " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_GRKERNSEC_JIT_HARDEN=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " config_grkernsec_jit_harden='yes'" ', "config_grkernsec_jit_harden":"yes"'
+    else
+      if ${kconfig} | grep -qi 'CONFIG_BPF_JIT=y'; then
+        echo_message "\033[31mDisabled\033[m\n" "Disabled," " config_grkernsec_jit_harden='no'" ', "config_grkernsec_jit_harden":"no"'
+      else
+        echo_message "\033[32mNo BPF JIT\033[m\n" "No BPF JIT," " config_bpf_jit='no'" ', "config_bpf_jit":"no"'
+      fi
+    fi
+
+    echo_message "  Thread Stack Random Gaps:               " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_GRKERNSEC_RAND_THREADSTACK=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " config_grkernsec_rand_threadstack='yes'" ', "config_grkernsec_rand_threadstack":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " config_grkernsec_rand_threadstack='no'" ', "config_grkernsec_rand_threadstack":"no"'
+    fi
+
+    echo_message "  Disable writing to kmem/mem/port:       " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_GRKERNSEC_KMEM=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " config_grkernsec_kmem='yes'" ', "config_grkernsec_kmem":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " config_grkernsec_kmem='no'" ', "config_grkernsec_kmem":"no"'
+    fi
+
+    echo_message "  Disable privileged I/O:                 " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_GRKERNSEC_IO=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " config_grkernsec_io='yes'" ', "config_grkernsec_io":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " config_grkernsec_io='no'" ', "config_grkernsec_io":"no"'
+    fi
+
+    echo_message "  Harden module auto-loading:             " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_GRKERNSEC_MODHARDEN=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " config_grkernsec_modharden='yes'" ', "config_grkernsec_modharden":"yes"'
+    else
+      if ${kconfig} | grep -qi 'CONFIG_MODULES=y'; then
+        echo_message "\033[31mDisabled\033[m\n" "Disabled," " config_grkernsec_modharden='no'" ', "config_grkernsec_modharden":"no"'
+      else
+        echo_message "\033[32mNo module support\033[m\n" "No module support, " " config_modules='no'" ', "config_modules":"no"'
+      fi
+    fi
+
+    echo_message "  Chroot Protection:                      " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_GRKERNSEC_CHROOT=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " config_grkernsec_chroot='yes'" ', "config_grkernsec_chroot":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " config_grkernsec_chroot='no'" ', "config_grkernsec_chroot":"no"'
+    fi
+
+    echo_message "  Deter ptrace process snooping:          " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_GRKERNSEC_HARDEN_PTRACE=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " config_grkernsec_harden_ptrace='yes'" ', "config_grkernsec_harden_ptrace":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " config_grkernsec_harden_ptrace='no'" ', "config_grkernsec_harden_ptrace":"no"'
+    fi
+
+    echo_message "  Larger Entropy Pools:                   " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_GRKERNSEC_RANDNET=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " config_grkernsec_randnet='yes'" ', "config_grkernsec_randnet":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " config_grkernsec_randnet='no'" ', "config_grkernsec_randnet":"no"'
+    fi
+
+    echo_message "  TCP/UDP Blackhole:                      " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_GRKERNSEC_BLACKHOLE=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " config_grkernsec_blackhole='yes'" ', "config_grkernsec_blackhole":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " config_grkernsec_blackhole='no'" ', "config_grkernsec_blackhole":"no"'
+    fi
+
+    echo_message "  Deter Exploit Bruteforcing:             " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_GRKERNSEC_BRUTE=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled," " config_grkernsec_brute='yes'" ', "config_grkernsec_brute":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled," " config_grkernsec_brute='no'" ', "config_grkernsec_brute":"no"'
+    fi
+
+    echo_message "  Hide kernel symbols:                    " "" "" ""
+    if ${kconfig} | grep -qi 'CONFIG_GRKERNSEC_HIDESYM=y'; then
+      echo_message "\033[32mEnabled\033[m\n" "Enabled" " config_grkernsec_hidesym='yes'" ', "config_grkernsec_hidesym":"yes"'
+    else
+      echo_message "\033[31mDisabled\033[m\n" "Disabled" " config_grkernsec_hidesym='no'" ', "config_grkernsec_hidesym":"no"'
+    fi
+
+    echo_message "  Pax softmode:                           " "" "" ""
+    paxsoft=$(sysctl -b -e kernel.pax.softmode)
+    if [[ "x${paxsoft}" == "x1" ]]; then
+      echo_message "\033[31mEnabled\033[m\n" "Enabled" " pax_softmode='yes'" ', "pax_softmode":"yes" }'
+    else
+      echo_message "\033[32mDisabled\033[m\n" "Disabled" " pax_softmode='no'" ', "pax_softmode":"no" }'
+    fi
+
+    if ${kconfig} | grep -qi 'CONFIG_GRKERNSEC_SYSCTL=y'; then
+      echo_message "  Grsec sysctl options:\n" "" "" ', "grsecurity_sysctl": {'
+      for command in audit_chdir audit_gid audit_group audit_mount audit_ptrace chroot_caps chroot_deny_bad_rename chroot_deny_chmod chroot_deny_chroot chroot_deny_fchdir chroot_deny_mknod chroot_deny_mount chroot_deny_pivot chroot_deny_shmat chroot_deny_sysctl chroot_deny_unix chroot_enforce_chdir chroot_execlog chroot_findtask chroot_restrict_nice consistent_setxid deny_new_usb deter_bruteforce disable_priv_io dmesg enforce_symlinksifowner exec_logging fifo_restrictions forkfail_logging grsec_lock harden_ipc harden_ptrace ip_blackhole lastack_retries linking_restrictions ptrace_readexec resource_logging romount_protect rwxmap_logging signal_logging socket_all socket_all_gid socket_client socket_client_gid socket_server socket_server_gid symlinkown_gid timechange_logging harden_tty tpe tpe_gid tpe_invert tpe_restrict_all; do
+        if [[ $(echo grsecurity.${command} | wc -c) -gt 27 ]]; then
+          echo_message "    grsecurity.${command}:\t  " "" "" ""
+        elif [[ $(echo grsecurity.${command} | wc -c) -le 20 ]]; then
+          echo_message "    grsecurity.${command}:\t\t\t  " "" "" ""
+        else
+          echo_message "    grsecurity.${command}:\t\t  " "" "" ""
+        fi
+        grcheck=$(sysctl -b kernel.grsecurity.${command} 2>/dev/null || echo $?)
+        if [[ "x${grcheck}" != "x255" ]] && [[ "x${grcheck}" != "x0" ]]; then
+          echo_message "\033[32mEnabled\033[m\n" "Enabled," " grsec_sysctl_${command}='yes'" ", \"grsec_sysctl_${command}\":\"yes\""
+        else
+          echo_message "\033[31mDisabled\033[m\n" "Disabled," " grsec_sysctl_${command}='no'" ", \"grsec_sysctl_${command}\":\"no\""
+        fi
+        if [[ "${command}" == "tpe_restrict_all" ]]; then
+          echo_message "" "" "" " } }"
+        else
+          echo_message "" "" "" ""
+        fi
+      done
+      echo_message "" "" " />\n</kernel>\n" ""
+    fi
+  else
+    echo_message "\033[31mNo GRKERNSEC\033[m\n\n" "No GRKERNSEC,,,,,,,," "    <grsecurity config='no' />\n</kernel>\n" ', "grsecurity": { "grsecurity_config":"no" } }'
+    echo_message "  The grsecurity / PaX patchset is available here:\n" "" "" ""
+    echo_message "    https://grsecurity.net/\n" "" "" ""
+  fi
+}
+
+# --- FORTIFY_SOURCE subfunctions (start) ---
+# is FORTIFY_SOURCE supported by libc?
+FS_libc_check() {
+  ${debug} && echo "***function FS_libc_check"
+  echo_message "* FORTIFY_SOURCE support available (libc)    : " "" ""
+
+  if [[ "${#FS_chk_func_libc[@]}" != "0" ]] ; then
+    echo_message "\033[32mYes\033[m\n" "Yes," " libc_fortify_source='yes' " ', "libc_fortify_source":"yes"'
+  else
+    echo_message "\033[31mNo\033[m\n" "No," " libc_fortify_source='no' " ', "libc_fortify_source":"no"'
+    exit 1
+  fi
+}
+
+# was the binary compiled with FORTIFY_SOURCE?
+FS_binary_check() {
+  ${debug} && echo "***function FS_binary_check"
+  echo_message "* Binary compiled with FORTIFY_SOURCE support: " "" "" ""
+
+  for ((FS_elem_functions=0; FS_elem_functions<${#FS_functions[@]}; FS_elem_functions++))
+  do
+    if [[ ${FS_functions[$FS_elem_functions]} =~ _chk$ ]] ; then
+      echo_message "\033[32mYes\033[m\n" "Yes\n" " binary_compiled_with_fortify='yes'>\n" ', "binary_compiled_with_fortify":"yes"'
+      return
+    fi
+  done
+  echo_message "\033[31mNo\033[m\n" "No\n" " binary_compiled_with_fortify='no'>\n" ', "binary_compiled_with_fortify":"no"'
+  exit 1
+}
+
+FS_comparison() {
+  ${debug} && echo "***function FS_comparison"
+  echo_message "\n" "" ""
+  echo_message " ------ EXECUTABLE-FILE ------- . -------- LIBC --------\n" "" "" ""
+  echo_message " Fortifiable library functions | Checked function names\n" "" "" ""
+  echo_message " -------------------------------------------------------\n" "" "" ""
+
+  ${debug} && echo -e "\n***function FS_comparison->FS_elem_libc"
+  for ((FS_elem_libc=0; FS_elem_libc<${#FS_chk_func_libc[@]}; FS_elem_libc++))
+  do
+    ${debug} && echo -e "\n***function FS_comparison->FS_elem_libc->FS_elem_functions"
+    for ((FS_elem_functions=0; FS_elem_functions<${#FS_functions[@]}; FS_elem_functions++))
+    do
+      FS_tmp_func=${FS_functions[$FS_elem_functions]}
+      FS_tmp_libc=${FS_chk_func_libc[$FS_elem_libc]}
+
+  if [[ ${FS_tmp_func} =~ ^${FS_tmp_libc}$ ]] ; then
+    if [[ ${format} == "cli" ]]; then
+      printf " \033[31m%-30s\033[m | __%s%s\n" "${FS_tmp_func}" "${FS_tmp_libc}" "${FS_end}"
+    else
+      if [[ $FS_elem_functions == 0 ]]; then
+        echo_message "" "${FS_tmp_func},${FS_tmp_libc},yes\n" "    <function name='${FS_tmp_func}' libc='${FS_tmp_libc}' fortifiable='yes' />\n" ", \"function\": { \"name\":\"${FS_tmp_func}\", \"libc\":\"${FS_tmp_libc}\", \"fortifiable\":\"yes\" }"
+      elif [[ $FS_elem_functions == $((${#FS_functions[@]} - 1 )) ]]; then
+        echo_message "" "${FS_tmp_func},${FS_tmp_libc},yes\n" "    <function name='${FS_tmp_func}' libc='${FS_tmp_libc}' fortifiable='yes' />\n" ", \"function\": { \"name\":\"${FS_tmp_func}\", \"libc\":\"${FS_tmp_libc}\", \"fortifiable\":\"yes\" }"
+      else
+        echo_message "" "${FS_tmp_func},${FS_tmp_libc},yes\n" "    <function name='${FS_tmp_func}' libc='${FS_tmp_libc}' fortifiable='yes' />\n" ", \"function\": { \"name\":\"${FS_tmp_func}\", \"libc\":\"${FS_tmp_libc}\", \"fortifiable\":\"yes\" }"
+    fi
+  fi
+        (( FS_cnt_total++ ))
+        (( FS_cnt_unchecked++ ))
+   elif [[ ${FS_tmp_func} =~ ^${FS_tmp_libc}(_chk)$ ]] ; then
+     if [[ ${format} == "cli" ]]; then
+       printf " \033[32m%-30s\033[m | __%s%s\n" "${FS_tmp_func}" "${FS_tmp_libc}" "${FS_end}"
+     else
+      if [[ $FS_elem_functions == 0 ]]; then
+        echo_message "" "${FS_tmp_func},${FS_tmp_libc},no\n" "    <function name='${FS_tmp_func}' libc='${FS_tmp_libc}' fortifiable='no' />\n" ", \"function\": { \"name\":\"${FS_tmp_func}\", \"libc\":\"${FS_tmp_libc}\", \"fortifiable\":\"no\" }"
+      elif [[ $FS_elem_functions == $((${#FS_functions[@]} - 1 )) ]]; then
+        echo_message "" "${FS_tmp_func},${FS_tmp_libc},no\n" "    <function name='${FS_tmp_func}' libc='${FS_tmp_libc}' fortifiable='no' />\n" ", \"function\": { \"name\":\"${FS_tmp_func}\", \"libc\":\"${FS_tmp_libc}\", \"fortifiable\":\"no\" }"
+      else
+        echo_message "" "${FS_tmp_func},${FS_tmp_libc},no\n" "    <function name='${FS_tmp_func}' libc='${FS_tmp_libc}' fortifiable='no' />\n" ", \"function\": { \"name\":\"${FS_tmp_func}\", \"libc\":\"${FS_tmp_libc}\", \"fortifiable\":\"no\" }"
+      fi
+  fi
+        (( FS_cnt_total++ ))
+        (( FS_cnt_checked++ ))
+   fi
+
+    done
+  done
+}
+
+FS_summary() {
+  ${debug} && echo "***function FS_summary"
+  echo_message "\n" "" "\n" ""
+  echo_message "SUMMARY:\n\n" "" "" ""
+  echo_message "* Number of checked functions in libc                : ${#FS_chk_func_libc[@]}\n" "${#FS_chk_func_libc[@]}," "    <stats nb_libc_func='${#FS_chk_func_libc[@]}'" ", \"stats\": { \"nb_libc_func\":\"${#FS_chk_func_libc[@]}\""
+  echo_message "* Total number of library functions in the executable: ${#FS_functions[@]}\n" "${#FS_functions[@]}," " nb_total_func='${#FS_functions[@]}'" ", \"nb_total_func\":\"${#FS_functions[@]}\""
+  echo_message "* Number of Fortifiable functions in the executable : ${FS_cnt_total}\n"  "${FS_cnt_total}," " nb_fortifiable_func='${FS_cnt_total}'" ", \"nb_fortifiable_func\":\"${FS_cnt_total}\""
+  echo_message "* Number of checked functions in the executable      : \033[32m${FS_cnt_checked}\033[m\n" "${FS_cnt_checked}," " nb_checked_func='${FS_cnt_checked}'" ", \"nb_checked_func\":\"${FS_cnt_checked}\""
+  echo_message "* Number of unchecked functions in the executable    : \033[31m${FS_cnt_unchecked}\033[m\n" "${FS_cnt_unchecked}" " nb_unchecked_func='${FS_cnt_unchecked}' />" ", \"nb_unchecked_func\":\"${FS_cnt_unchecked}\" } "
+  echo_message "\n" "\n" "\n" ""
+}
+
+debug_report() {
+  echo "***** Checksec debug *****"
+  failed=false
+  id
+  uname -a
+
+  echo "checksec version: ${SCRIPT_MAJOR}.${SCRIPT_MINOR}.${SCRIPT_REVISION} -- ${SCRIPT_VERSION}"
+
+  if [[ -f /etc/os-release ]]; then
+    # freedesktop.org and systemd
+    # shellcheck disable=SC1091
+    source /etc/os-release
+    # shellcheck disable=SC2153
+    OS=${NAME}
+    VER=${VERSION_ID}
+  elif type lsb_release >/dev/null 2>&1; then
+    # linuxbase.org
+    OS=$(lsb_release -si)
+    VER=$(lsb_release -sr)
+  elif [[ -f /etc/lsb-release ]]; then
+    # For some versions of Debian/Ubuntu without lsb_release command
+    # shellcheck disable=SC1091
+    source /etc/lsb-release
+    OS=${DISTRIB_ID}
+    VER=${DISTRIB_RELEASE}
+  elif [[ -f /etc/debian_version ]]; then
+    # Older Debian/Ubuntu/etc.
+    OS=Debian
+    VER=$(cat /etc/debian_version)
+  elif [[ -f /etc/SuSe-release ]]; then
+    # Older SuSE/etc.
+    OS=$(cat /etc/SuSe-release)
+    VER=$(uname -r)
+  elif [[ -f /etc/redhat-release ]]; then
+    # Older Red Hat, CentOS, etc.
+    OS=$(cat /etc/redhat-release)
+    VER=$(uname -r)
+  else
+    # Fall back to uname, e.g. "Linux <version>", also works for BSD, etc.
+    OS=$(uname -s)
+    VER=$(uname -r)
+  fi
+
+  echo "OS=${OS}"
+  echo "VER=${VER}"
+
+  for command in cat awk sysctl uname mktemp openssl grep stat file find head ps readlink basename id which wget curl readelf eu-readelf; do
+    path="$(command -v ${command})"
+    if [[ -e "${path}" ]]; then
+      ls -l "${path}"
+      if [[ -L "${path}" ]]; then
+        absolutepath=$(readlink -f "${path}")
+        ls -l "${absolutepath}"
+        file "${absolutepath}"
+      else
+        file "${path}"
+      fi
+    else
+       echo "*** can not find command ${command}"
+       failed=true
+    fi
+  done
+
+  if [[ ${failed} ]]; then
+    exit 1
+ fi
+}
+
+chk_dir () {
+  if [[ -z "${CHK_DIR}" ]] ; then
+    printf "\033[31mError: Please provide a valid directory.\033[m\n\n"
+    exit 1
+  fi
+  # remove trailing slashes
+  tempdir=$(echo "${CHK_DIR}" | sed -e "s/\/*$//")
+  if [[ ! -d "${tempdir}" ]] ; then
+    printf "\033[31mError: The directory '%s' does not exist.\033[m\n\n" "${tempdir}"
+    exit 1
+  fi
+  if ${extended_checks}; then
+    echo_message "RELRO           STACK CANARY      NX            PIE             SELFRANDO             Clang CFI            SafeStack            RPATH      RUNPATH    Symbols      \tFORTIFY\tFortified\tFortifiable   Filename\n" '' "<dir name='$tempdir'>\n" "{ \"dir\": { \"name\":\"$tempdir\" }"
+  else
+    echo_message "RELRO           STACK CANARY      NX            PIE             RPATH      RUNPATH    Symbols      \tFORTIFY\tFortified\tFortifiable   Filename\n" '' "<dir name='$tempdir'>\n" "{ \"dir\": { \"name\":\"$tempdir\" }"
+  fi
+  fdircount=0
+  fdirtotal=0
+
+  while read -r N; do
+    if [[ "${N}" != "[A-Za-z1-0]*" ]]; then
+      out=$(file "$(readlink -f "${N}")")
+      if [[ ${out} =~ ELF ]] ; then
+        (( fdirtotal++ ))
+      fi
+    fi
+  done < <(find "${tempdir}" -type f 2>/dev/null)
+  if [[ $fdirtotal -gt 0 ]]; then 
+    echo_message "" "" "" ","
+  fi
+  while read -r N; do
+    if [[ "${N}" != "[A-Za-z1-0]*" ]]; then
+  # read permissions?
+  if [[ ! -r "${N}" ]]; then
+      printf "\033[31mError: No read permissions for '%s' (run as root).\033[m\n" ", ${N}"
+  else
+      # ELF executable?
+      out=$(file "$(readlink -f "${N}")")
+      if [[ ! ${out} =~ ELF ]] ; then
+        if [[ "${verbose}" = "true" ]] ; then
+            echo_message "\033[34m*** Not an ELF file: ${tempdir}/" "" "" ""
+              file "${N}"
+            echo_message "\033[m" "" "" ""
+        fi
+      else
+          (( fdircount++ ))
+        echo_message "" "" "    " ""
+        filecheck "${N}"
+        if [[ "$(find "${N}" \( -perm -004000 -o -perm -002000 \) -type f -print)" ]]; then
+            echo_message "\033[37;41m${N}\033[m\n" ",${N}\n" " filename='${N}' />\n" ", \"filename\":\"${N}\"}"
+        else
+            echo_message "${N}\n" ",${N}\n" " filename='${N}' />\n" ", \"filename\":\"${N}\"}"
+        fi
+        if [[ "${fdircount}" == "${fdirtotal}" ]]; then
+        echo_message "" "" "" ""
+      else
+        echo_message "" "" "" ","
+        fi
+      fi
+  fi
+    fi
+  done < <(find "${tempdir}" -type f 2>/dev/null)
+  echo_message "" "" "</dir>\n" "}"
+}
+
+chk_file () {
+  if [[ -z "${CHK_FILE}" ]] ; then
+    printf "\033[31mError: Please provide a valid file.\033[m\n\n"
+  exit 1
+  fi
+
+  # does the file exist?
+  if [[ ! -e "${CHK_FILE}" ]] ; then
+    printf "\033[31mError: The file '%s' does not exist.\033[m\n\n" "${CHK_FILE}"
+    exit 1
+  fi
+
+  # read permissions?
+  if [[ ! -r "${CHK_FILE}" ]] ; then
+    printf "\033[31mError: No read permissions for '%s' (run as root).\033[m\n\n" "${CHK_FILE}"
+    exit 1
+  fi
+
+  # ELF executable?
+  out=$(file "$(readlink -f "${CHK_FILE}")")
+  if [[ ! ${out} =~ ELF ]] ; then
+    printf "\033[31mError: Not an ELF file: "
+    file "${CHK_FILE}"
+    printf "\033[m\n"
+    exit 1
+  fi
+  if ${extended_checks}; then
+    echo_message "RELRO           STACK CANARY      NX            PIE             SELFRANDO             Clang CFI            SafeStack            RPATH      RUNPATH\tSymbols\t\tFORTIFY\tFortified\tFortifiable\tFILE\n" '' '' '{'
+  else
+    echo_message "RELRO           STACK CANARY      NX            PIE             RPATH      RUNPATH\tSymbols\t\tFORTIFY\tFortified\tFortifiable\tFILE\n" '' '' '{'
+  fi
+  filecheck "${CHK_FILE}"
+  if [[ "$(find "${CHK_FILE}" \( -perm -004000 -o -perm -002000 \) -type f -print)" ]] ; then
+    echo_message "\033[37;41m${CHK_FILE}\033[m\n" ",${CHK_FILE}\n" " filename='${CHK_FILE}'/>\n" " } }"
+  else
+    echo_message "${CHK_FILE}\n" ",${CHK_FILE}\n" " filename='${CHK_FILE}'/>\n" " } }"
+  fi
+}
+
+chk_proc_all () {
+  cd /proc || exit
+  echo_message "* System-wide ASLR" "" "" ""
+  aslrcheck
+  echo_message "* Does the CPU support NX: " "" "<procs>" ""
+  nxcheck
+  echo_message "* Core-Dumps access to all users: " "" "" ""
+  coredumpcheck
+  if ${extended_checks}; then
+    echo_message "         COMMAND    PID RELRO           STACK CANARY            Clang CFI            SafeStack            SECCOMP          NX/PaX        PIE                     SELFRANDO             FORTIFY\n" "" "" '{'
+  else
+    echo_message "         COMMAND    PID RELRO           STACK CANARY            SECCOMP          NX/PaX        PIE                     FORTIFY\n" "" "" '{'
+  fi
+  lastpid=0
+  currpid=0
+  for N in [1-9]*; do
+    if [[ "${N}" != "$$" ]] && readlink -q "${N}"/exe > /dev/null; then
+      (( lastpid++ ))
+    fi
+  done
+  for N in [1-9]*; do
+    if [[ "${N}" != "$$" ]] && readlink -q "${N}"/exe > /dev/null; then
+      (( currpid++ ))
+      name=$(head -1 "${N}"/status | cut -b 7-)
+      if [[ $format == "cli" ]]; then
+        printf "%16s" "${name}"
+        printf "%7d " "${N}"
+      else
+        echo_message "" "${N}," " <proc pid='${N}'" " \"${N}\": { "
+        echo_message "" "${name}," " name='${name}'" "\"name\":\"${name}\","
+      fi
+      proccheck "${N}"
+  if [[ "${lastpid}" == "${currpid}" ]]; then
+    echo_message "\n" "\n" "</proc>\n" ""
+  else
+    echo_message "\n" "\n" "</proc>\n" ","
+  fi
+    fi
+  done
+  echo_message "" "" "</procs>" " }\n"
+  if [[ ! -e /usr/bin/id ]] ; then
+    echo_message "\n\033[33mNote: If you are running 'checksec.sh' as an unprivileged user, you\n" "" "" ""
+    echo_message "      will not see all processes. Please run the script as root.\033[m\n\n" "" "" "\n"
+  else
+    if ! (root_privs) ; then
+      echo_message "\n\033[33mNote: You are running 'checksec.sh' as an unprivileged user.\n" "" "" ""
+      echo_message "      Too see all processes, please run the script as root.\033[m\n\n" "" "" "\n"
+    fi
+  fi
+}
+
+chk_proc () {
+  if [[ -z "${CHK_PROC}" ]] ; then
+    printf "\033[31mError: Please provide a valid process name.\033[m\n\n"
+    exit 1
+  fi
+  if ! (isString "${CHK_PROC}") ; then
+    printf "\033[31mError: Please provide a valid process name.\033[m\n\n"
+    exit 1
+  fi
+  cd /proc || exit
+  IFS=" " read -r -a fpids <<<"$(pgrep -d ' ' "${CHK_PROC}")"
+  if [[ ${#fpids} -eq 0 ]]; then
+    printf "\033[31mError: No process with the given name found.\033[m\n\n"
+    exit 1
+  fi
+  echo_message "* System-wide ASLR" '' '' ''
+  aslrcheck
+  echo_message "* Does the CPU support NX: " '' '' ''
+  nxcheck
+  if ${extended_checks}; then
+    echo_message "         COMMAND    PID RELRO           STACK CANARY            Clang CFI            SafeStack            SECCOMP          NX/PaX        PIE                     SELFRANDO             FORTIFY\n" "" "" '{'
+  else
+    echo_message "         COMMAND    PID RELRO           STACK CANARY            SECCOMP          NX/PaX        PIE                     FORTIFY\n" "" "" '{'
+  fi
+  pos=$(( ${#fpids[*]} - 1 ))
+  last=${fpids[$pos]}
+  for N in "${fpids[@]}"; do
+    if [[ -d "${N}" ]] ; then
+      name=$(head -1 "${N}"/status | cut -b 7-)
+      if [[ $format == "cli" ]]; then
+        printf "%16s" "${name}"
+        printf "%7d " "${N}"
+      else
+        echo_message "" "${N}," "<proc pid='${N}'" " \"${N}\": {"
+        echo_message "" "${name}," " name='${name}'" "\"name\":\"${name}\","
+      fi
+      if [[ ! -r "${N}/exe" ]] ; then
+        if ! (root_privs) ; then
+          printf "\033[31mNo read permissions for '/proc/%s/exe' (run as root).\033[m\n\n" "${N}"
+          exit 1
+        fi
+        if [[ ! "$(readlink "${N}/exe")" ]] ; then
+          printf "\033[31mPermission denied. Requested process ID belongs to a kernel thread.\033[m\n\n"
+          exit 1
+        fi
+        exit 1
+      fi
+      proccheck "${N}"
+      if [[ "${N}" == "$last" ]]; then
+        echo_message "\n" "\n" "</proc>\n" ""
+      else
+        echo_message "\n" "\n" "</proc>\n" ","
+      fi
+    fi
+  done
+  echo_message "\n" "\n" "\n" "}\n"
+}
+
+chk_proc_libs () {
+  if [[ -z "${CHK_PROC_LIBS}" ]] ; then
+    printf "\033[31mError: Please provide a valid process ID.\033[m\n\n"
+    exit 1
+  fi
+  if ! (isNumeric "${CHK_PROC_LIBS}") ; then
+    printf "\033[31mError: Please provide a valid process ID.\033[m\n\n"
+    exit 1
+  fi
+  cd /proc || exit
+  echo_message "* System-wide ASLR" '' '' ''
+  aslrcheck
+  echo_message "* Does the CPU support NX: " '' '' ''
+  nxcheck
+  echo_message "* Process information:\n\n" "" "" ""
+  if ${extended_checks}; then
+    echo_message "         COMMAND    PID RELRO           STACK CANARY            Clang CFI            SafeStack            SECCOMP        NX/PaX        PIE                     Fortify Source\n" '' '' ''
+  else
+    echo_message "         COMMAND    PID RELRO           STACK CANARY            SECCOMP        NX/PaX        PIE                     Fortify Source\n" '' '' ''
+  fi
+  N=${CHK_PROC_LIBS}
+  if [[ -d "${N}" ]] ; then
+    name=$(head -1 "${N}/status" | cut -b 7-)
+    if [[ "${format}" == "cli" ]]; then
+      printf "%16s" "${name}"
+      printf "%7d " "${N}"
+    else
+      echo_message "" "${name}," "<proc name='${name}'" "{ \"proc\": { \"name\":\"${name}\", "
+      echo_message "" "${N}," " pid='${N}'" "\"pid\":\"${N}\","
+    fi
+      # read permissions?
+    if [[ ! -r "${N}/exe" ]] ; then
+      if ! (root_privs) ; then
+        printf "\033[31mNo read permissions for '/proc/%s/exe' (run as root).\033[m\n\n" "${N}"
+        exit 1
+      fi
+      if [[ ! "$(readlink "${N}"/exe)" ]] ; then
+        printf "\033[31mPermission denied. Requested process ID belongs to a kernel thread.\033[m\n\n"
+        exit 1
+      fi
+      exit 1
+    fi
+    proccheck "${N}"
+    echo_message "\n\n\n" "\n" "\n" ","
+    if ${extended_checks}; then
+      echo_message "    RELRO           STACK CANARY   Clang CFI            SafeStack            NX/PaX        PIE            Clang CFI            SafeStack            RPath       RunPath   Fortify Fortified   Fortifiable\n" '' '' ''
+    else
+      echo_message "    RELRO           STACK CANARY   NX/PaX        PIE            RPath       RunPath   Fortify Fortified   Fortifiable\n" '' '' ''
+    fi
+    libcheck "${N}"
+    echo_message "\n" "\n" "</proc>\n" "} } }"
+  fi
+}
+
+chk_fortify_file () {
+  # if first char of pathname is '~' replace it with '${HOME}'
+  if [[ "${CHK_FORTIFY_FILE:0:1}" = '~' ]] ; then
+    CHK_FORTIFY_FILE=${HOME}/${CHK_FORTIFY_FILE:1}
+  fi
+
+  if [[ -z "${CHK_FORTIFY_FILE}" ]] ; then
+    printf "\033[31mError: Please provide a valid file.\033[m\n\n"
+  exit 1
+  fi
+  # does the file exist?
+  if [[ ! -f "${CHK_FORTIFY_FILE}" ]] ; then
+    printf "\033[31mError: The file '%s' does not exist.\033[m\n\n" "${CHK_FORTIFY_FILE}"
+    exit 1
+  fi
+  # read permissions?
+  if [[ ! -r "${CHK_FORTIFY_FILE}" ]] ; then
+    printf "\033[31mError: No read permissions for '%s' (run as root).\033[m\n\n" "${CHK_FORTIFY_FILE}"
+    exit 1
+  fi
+  # ELF executable?
+  out=$(file "$(readlink -f "${CHK_FORTIFY_FILE}")")
+  if [[ ! ${out} =~ ELF ]] ; then
+    printf "\033[31mError: Not an ELF file: "
+    file "${CHK_FORTIFY_FILE}"
+    printf "\033[m\n"
+    exit 1
+  fi
+
+  if [[ -e /lib/libc.so.6 ]] ; then
+    FS_libc=/lib/libc.so.6
+  elif [[ -e /lib64/libc.so.6 ]] ; then
+    FS_libc=/lib64/libc.so.6
+  elif [[ -e /lib/i386-linux-gnu/libc.so.6 ]] ; then
+    FS_libc=/lib/i386-linux-gnu/libc.so.6
+  elif [[ -e /lib/x86_64-linux-gnu/libc.so.6 ]] ; then
+    FS_libc=/lib/x86_64-linux-gnu/libc.so.6
+  elif [[ -e /lib/arm-linux-gnueabihf/libc.so.6 ]] ; then
+    FS_libc=/lib/arm-linux-gnueabihf/libc.so.6
+  elif [[ -e /lib/aarch64-linux-gnu/libc.so.6 ]] ; then
+    FS_libc=/lib/aarch64-linux-gnu/libc.so.6
+  else
+    printf "\033[31mError: libc not found.\033[m\n\n"
+    exit 1
+  fi
+
+  FS_chk_func_libc=()
+  FS_functions=()
+  while IFS='' read -r line; do FS_chk_func_libc+=("$line"); done < <(${readelf} -s ${FS_libc} 2>/dev/null | grep _chk@@ | awk '{ print $8 }' | cut -c 3- | sed -e 's/_chk@.*//')
+  while IFS='' read -r line; do FS_functions+=("$line"); done < <(${readelf} -s "${CHK_FORTIFY_FILE}" 2>/dev/null | awk '{ print $8 }' | sed 's/_*//' | sed -e 's/@.*//')
+  echo_message "" "" "<fortify-test name='${CHK_FORTIFY_FILE}' " "{ \"fortify-test\": { \"name\":\"${CHK_FORTIFY_FILE}\" "
+  FS_libc_check
+  FS_binary_check
+  FS_comparison
+  FS_summary
+  echo_message "" "" "</fortify-test>\n" "} }"
+}
+
+chk_fortify_proc () {
+  if [[ -z "${CHK_FORTIFY_PROC}" ]] ; then
+    printf "\033[31mError: Please provide a valid process ID.\033[m\n\n"
+    exit 1
+  fi
+  if ! (isNumeric "${CHK_FORTIFY_PROC}") ; then
+    printf "\033[31mError: Please provide a valid process ID.\033[m\n\n"
+    exit 1
+  fi
+  cd /proc || exit
+  N=${CHK_FORTIFY_PROC}
+  if [[ -d "${N}" ]] ; then
+    # read permissions?
+    if [[ ! -r "${N}/exe" ]] ; then
+      if ! (root_privs) ; then
+        printf "\033[31mNo read permissions for '/proc/%s/exe' (run as root).\033[m\n\n" "${N}"
+        exit 1
+      fi
+      if [[ ! "$(readlink "${N}/exe")" ]] ; then
+        printf "\033[31mPermission denied. Requested process ID belongs to a kernel thread.\033[m\n\n"
+        exit 1
+      fi
+      exit 1
+    fi
+    if [[ -e /lib/libc.so.6 ]] ; then
+      FS_libc=/lib/libc.so.6
+    elif [[ -e /lib64/libc.so.6 ]] ; then
+      FS_libc=/lib64/libc.so.6
+    elif [[ -e /lib/i386-linux-gnu/libc.so.6 ]] ; then
+      FS_libc=/lib/i386-linux-gnu/libc.so.6
+    elif [[ -e /lib/x86_64-linux-gnu/libc.so.6 ]] ; then
+      FS_libc=/lib/x86_64-linux-gnu/libc.so.6
+    else
+      printf "\033[31mError: libc not found.\033[m\n\n"
+      exit 1
+    fi
+    name=$(head -1 "${N}/status" | cut -b 7-)
+    echo_message  "* Process name (PID)                         : ${name} (${N})\n" "" "" ""
+
+    FS_chk_func_libc=()
+    FS_functions=()
+    while IFS='' read -r line; do FS_chk_func_libc+=("$line"); done < <(${readelf} -s $FS_libc 2>/dev/null | grep _chk@@ | awk '{ print $8 }' | cut -c 3- | sed -e 's/_chk@.*//')
+    while IFS='' read -r line; do FS_functions+=("$line"); done < <(${readelf} -s "${CHK_FORTIFY_PROC}/exe" 2>/dev/null | awk '{ print $8 }' | sed 's/_*//' | sed -e 's/@.*//')
+    echo_message "" "" "<fortify-test name='${name}' pid='${N}' " "{ \"fortify-test\": { \"name\":\"${name}\", \"pid\":\"${N}\" "
+    FS_libc_check
+    FS_binary_check
+    FS_comparison
+    FS_summary
+    echo_message "" "" "</fortify-test>\n" "} }"
+  fi
+}
+
+chk_kernel () {
+    if [[ ${CHK_KERNEL} == "kernel" ]]; then
+      CHK_KERNEL=""
+    fi
+    if [[ -e "${CHK_KERNEL}" ]] && [[ ! -d "${CHK_KERNEL}" ]]; then
+      if [[ -s "$(pwd -P)/${CHK_KERNEL}" ]]; then
+        configfile=$(pwd -P)/${CHK_KERNEL}
+      elif [[ -s "${CHK_KERNEL}" ]]; then
+        configfile=${CHK_KERNEL}
+      else
+        "Error: config file specified do not exist"
+        exit 1
+      fi
+      echo_message "* Kernel protection information for : $configfile \n\n" "" "" ""
+      cd /proc && kernelcheck "$configfile" || exit
+    else
+      cd /proc || exit
+      echo_message "* Kernel protection information:\n\n" "" "" ""
+      kernelcheck
+    fi
+}
+
+optspec=":h-:"
+while getopts "${optspec}" optchar; do
+    case "${optchar}" in
+        -)
+            case "${OPTARG}" in
+                version)
+                  version
+                  exit 0
+                  ;;
+                debug)
+                  debug=true
+                  ;;
+                trace)
+                  export BASH_XTRACEFD=5
+                  export PS4='(${BASH_SOURCE##*/}:${LINENO}): ${FUNCNAME[0]:+${FUNCNAME[0]}(): }'
+                  set -x
+                  ;;
+                help)
+                  help
+                  exit 0
+                  ;;
+                debug_report)
+                  debug_report
+                  exit 0
+                  ;;
+                update|upgrade)
+                  # shellcheck disable=SC2119
+                  upgrade
+                  exit 0
+                  ;;
+                format=*|output=*)
+                  output_format=${OPTARG#*=}
+                  format
+                  ;;
+                verbose)
+                  verbose=true
+                  ;;
+                extended)
+                  extended_checks=true
+                  ;;
+                dir=*|dir)
+                  CHK_DIR=${OPTARG#*=};
+                  OPT=$((OPT + 1))
+                  CHK_FUNCTION="chk_dir"
+                  ;;
+                file=*|file)
+                  CHK_FILE=${OPTARG#*=};
+                  OPT=$((OPT + 1))
+                  CHK_FUNCTION="chk_file"
+                  ;;
+                proc-all)
+                  OPT=$((OPT + 1))
+                  CHK_FUNCTION="chk_proc_all"
+                  ;;
+                proc=*|proc)
+                  CHK_PROC=${OPTARG#*=};
+                  OPT=$((OPT + 1))
+                  CHK_FUNCTION="chk_proc"
+                  ;;
+                proc-libs=*|proc-libs)
+                  CHK_PROC_LIBS=${OPTARG#*=};
+                  OPT=$((OPT + 1))
+                  CHK_FUNCTION="chk_proc_libs"
+                  ;;
+                fortify-file=*|fortify-file)
+                  CHK_FORTIFY_FILE=${OPTARG#*=};
+                  OPT=$((OPT + 1))
+                  CHK_FUNCTION="chk_fortify_file"
+                  ;;
+                fortify-proc=*|fortify-proc)
+                  CHK_FORTIFY_PROC=${OPTARG#*=};
+                  OPT=$((OPT + 1))
+                  CHK_FUNCTION="chk_fortify_proc"
+                  ;;
+                kernel=*|kernel)
+                  CHK_KERNEL=${OPTARG#*=};
+                  OPT=$((OPT + 1))
+                  CHK_FUNCTION="chk_kernel"
+                  ;;
+                *)
+                    printf "\033[31mError: Unknown option %s.\033[m\n\n" "${OPTARG}"
+                    exit 1
+                    ;;
+            esac;;
+        *)
+            help
+            exit 0
+            ;;
+    esac
+done
+
+if [[ "${OPT}" == 0 ]]; then
+  printf "\033[31mError: No option selected. Please select an option.\033[m\n\n"
+  exit 1
+elif [[ "${OPT}" != 1 ]]; then
+  printf "\033[31mError: To many options selected. Please select one at a time.\033[m\n\n"
+  exit 1
+fi
+
+for variable in CHK_DIR CHK_FILE CHK_FORTIFY_FILE CHK_FORTIFY_PROC CHK_PROC CHK_PROC_LIBS; do
+  if [[ -n ${!variable+x} ]]; then
+   if [[ -z "${!variable}" ]]; then
+     printf "\033[31mError: Option Required.\033[m\n\n"
+     help
+     exit 1
+   fi
+  fi
+done
+
+# call the function
+${CHK_FUNCTION}
diff --git a/depend/zcash/qa/zcash/create_benchmark_archive.py b/depend/zcash/qa/zcash/create_benchmark_archive.py
new file mode 100644
index 000000000..bc8633d42
--- /dev/null
+++ b/depend/zcash/qa/zcash/create_benchmark_archive.py
@@ -0,0 +1,262 @@
+import binascii
+import calendar
+import json
+import plyvel
+import progressbar
+import os
+import stat
+import subprocess
+import sys
+import tarfile
+import time
+
+ZCASH_CLI = './src/zcash-cli'
+USAGE = """
+Requirements:
+- find
+- xz
+- %s (edit ZCASH_CLI in this script to alter the path)
+- A running mainnet zcashd using the default datadir with -txindex=1
+
+Example usage:
+
+make -C src/leveldb/
+virtualenv venv
+. venv/bin/activate
+pip install --global-option=build_ext --global-option="-L$(pwd)/src/leveldb/" --global-option="-I$(pwd)/src/leveldb/include/" plyvel
+pip install progressbar2
+LD_LIBRARY_PATH=src/leveldb python qa/zcash/create_benchmark_archive.py
+""" % ZCASH_CLI
+
+def check_deps():
+    if subprocess.call(['which', 'find', 'xz', ZCASH_CLI], stdout=subprocess.PIPE):
+        print(USAGE)
+        sys.exit()
+
+def encode_varint(n):
+    v = bytearray()
+    l = 0
+    while True:
+        v.append((n & 0x7F) | (0x80 if l else 0x00))
+        if (n <= 0x7F):
+            break
+        n = (n >> 7) - 1
+        l += 1
+    return bytes(v)[::-1]
+
+def decode_varint(v):
+    n = 0
+    for ch in range(len(v)):
+        n = (n << 7) | (ord(v[ch]) & 0x7F)
+        if (ord(v[ch]) & 0x80):
+            n += 1
+        else:
+            return n
+
+def compress_amount(n):
+    if n == 0:
+        return 0
+    e = 0
+    while (((n % 10) == 0) and e < 9):
+        n /= 10
+        e += 1
+    if e < 9:
+        d = (n % 10)
+        assert(d >= 1 and d <= 9)
+        n /= 10
+        return 1 + (n*9 + d - 1)*10 + e
+    else:
+        return 1 + (n - 1)*10 + 9
+
+OP_DUP = 0x76
+OP_EQUAL = 0x87
+OP_EQUALVERIFY = 0x88
+OP_HASH160 = 0xa9
+OP_CHECKSIG = 0xac
+def to_key_id(script):
+    if len(script) == 25 and \
+            script[0] == OP_DUP and \
+            script[1] == OP_HASH160 and \
+            script[2] == 20 and \
+            script[23] == OP_EQUALVERIFY and \
+            script[24] == OP_CHECKSIG:
+        return script[3:23]
+    return bytes()
+
+def to_script_id(script):
+    if len(script) == 23 and \
+            script[0] == OP_HASH160 and \
+            script[1] == 20 and \
+            script[22] == OP_EQUAL:
+        return script[2:22]
+    return bytes()
+
+def to_pubkey(script):
+    if len(script) == 35 and \
+            script[0] == 33 and \
+            script[34] == OP_CHECKSIG and \
+            (script[1] == 0x02 or script[1] == 0x03):
+        return script[1:34]
+    if len(script) == 67 and \
+            script[0] == 65 and \
+            script[66] == OP_CHECKSIG and \
+            script[1] == 0x04:
+        return script[1:66] # assuming is fully valid
+    return bytes()
+
+def compress_script(script):
+    result = bytearray()
+
+    key_id = to_key_id(script)
+    if key_id:
+        result.append(0x00)
+        result.extend(key_id)
+        return bytes(result)
+
+    script_id = to_script_id(script)
+    if script_id:
+        result.append(0x01)
+        result.extend(script_id)
+        return bytes(result)
+
+    pubkey = to_pubkey(script)
+    if pubkey:
+        result.append(0x00)
+        result.extend(pubkey[1:33])
+        if pubkey[0] == 0x02 or pubkey[0] == 0x03:
+            result[0] = pubkey[0]
+            return bytes(result)
+        elif pubkey[0] == 0x04:
+            result[0] = 0x04 | (pubkey[64] & 0x01)
+            return bytes(result)
+
+    size = len(script) + 6
+    result.append(encode_varint(size))
+    result.extend(script)
+    return bytes(result)
+
+def deterministic_filter(tarinfo):
+    tarinfo.uid = tarinfo.gid = 0
+    tarinfo.uname = tarinfo.gname = "root"
+    tarinfo.mtime = calendar.timegm(time.strptime('2017-05-17', '%Y-%m-%d'))
+    tarinfo.mode |= stat.S_IRUSR | stat.S_IWUSR | stat.S_IRGRP
+    tarinfo.mode &= ~stat.S_IWGRP
+    if tarinfo.isdir():
+        tarinfo.mode |= \
+            stat.S_IXUSR | \
+            stat.S_IXGRP | \
+            stat.S_IXOTH
+    else:
+        tarinfo.mode &= \
+            ~stat.S_IXUSR & \
+            ~stat.S_IXGRP & \
+            ~stat.S_IXOTH
+    return tarinfo
+
+def create_benchmark_archive(blk_hash):
+    blk = json.loads(subprocess.check_output([ZCASH_CLI, 'getblock', blk_hash]))
+    print ('Height: %d' % blk['height'])
+    print ('Transactions: %d' % len(blk['tx']))
+
+    os.mkdir('benchmark')
+    with open('benchmark/block-%d.dat' % blk['height'], 'wb') as f:
+        f.write(binascii.unhexlify(subprocess.check_output([ZCASH_CLI, 'getblock', blk_hash, 'false']).strip()))
+
+    txs = [json.loads(subprocess.check_output([ZCASH_CLI, 'getrawtransaction', tx, '1'])
+                     ) for tx in blk['tx']]
+
+    js_txs = len([tx for tx in txs if len(tx['vjoinsplit']) > 0])
+    if js_txs:
+        print('Block contains %d JoinSplit-containing transactions' % js_txs)
+        return
+
+    inputs = [(x['txid'], x['vout']) for tx in txs for x in tx['vin'] if x.has_key('txid')]
+    print('Total inputs: %d' % len(inputs))
+
+    unique_inputs = {}
+    for i in sorted(inputs):
+        if unique_inputs.has_key(i[0]):
+            unique_inputs[i[0]].append(i[1])
+        else:
+            unique_inputs[i[0]] = [i[1]]
+    print('Unique input transactions: %d' % len(unique_inputs))
+
+    db_path = 'benchmark/block-%d-inputs' % blk['height']
+    db = plyvel.DB(db_path, create_if_missing=True)
+    wb = db.write_batch()
+    bar = progressbar.ProgressBar(redirect_stdout=True)
+    print('Collecting input coins for block')
+    for tx in bar(unique_inputs.keys()):
+        rawtx = json.loads(subprocess.check_output([ZCASH_CLI, 'getrawtransaction', tx, '1']))
+
+        mask_size = 0
+        mask_code = 0
+        b = 0
+        while 2+b*8 < len(rawtx['vout']):
+            zero = True
+            i = 0
+            while i < 8 and 2+b*8+i < len(rawtx['vout']):
+                if 2+b*8+i in unique_inputs[tx]:
+                    zero = False
+                i += 1
+            if not zero:
+                mask_size = b + 1
+                mask_code += 1
+            b += 1
+
+        coinbase = len(rawtx['vin']) == 1 and 'coinbase' in rawtx['vin'][0]
+        first = len(rawtx['vout']) > 0 and 0 in unique_inputs[tx]
+        second = len(rawtx['vout']) > 1 and 1 in unique_inputs[tx]
+        code = 8*(mask_code - (0 if first or second else 1)) + \
+            (1 if coinbase else 0) + \
+            (2 if first else 0) + \
+            (4 if second else 0)
+
+        coins = bytearray()
+        # Serialized format:
+        # - VARINT(nVersion)
+        coins.extend(encode_varint(rawtx['version']))
+        # - VARINT(nCode)
+        coins.extend(encode_varint(code))
+        # - unspentness bitvector, for vout[2] and further; least significant byte first
+        for b in range(mask_size):
+            avail = 0
+            i = 0
+            while i < 8 and 2+b*8+i < len(rawtx['vout']):
+                if 2+b*8+i in unique_inputs[tx]:
+                    avail |= (1 << i)
+                i += 1
+            coins.append(avail)
+        # - the non-spent CTxOuts (via CTxOutCompressor)
+        for i in range(len(rawtx['vout'])):
+            if i in unique_inputs[tx]:
+                coins.extend(encode_varint(compress_amount(int(rawtx['vout'][i]['valueZat']))))
+                coins.extend(compress_script(
+                    binascii.unhexlify(rawtx['vout'][i]['scriptPubKey']['hex'])))
+        # - VARINT(nHeight)
+        coins.extend(encode_varint(json.loads(
+            subprocess.check_output([ZCASH_CLI, 'getblockheader', rawtx['blockhash']])
+            )['height']))
+
+        db_key = b'c' + bytes(binascii.unhexlify(tx)[::-1])
+        db_val = bytes(coins)
+        wb.put(db_key, db_val)
+
+    wb.write()
+    db.close()
+
+    # Make reproducible archive
+    os.remove('%s/LOG' % db_path)
+    files = subprocess.check_output(['find', 'benchmark']).strip().split('\n')
+    archive_name = 'block-%d.tar' % blk['height']
+    tar = tarfile.open(archive_name, 'w')
+    for name in sorted(files):
+        tar.add(name, recursive=False, filter=deterministic_filter)
+    tar.close()
+    subprocess.check_call(['xz', '-6', archive_name])
+    print('Created archive %s.xz' % archive_name)
+    subprocess.call(['rm', '-r', 'benchmark'])
+
+if __name__ == '__main__':
+    check_deps()
+    create_benchmark_archive('0000000007cdb809e48e51dd0b530e8f5073e0a9e9bd7ae920fe23e874658c74')
diff --git a/depend/zcash/qa/zcash/create_wallet_200k_utxos.py b/depend/zcash/qa/zcash/create_wallet_200k_utxos.py
new file mode 100755
index 000000000..08c766e12
--- /dev/null
+++ b/depend/zcash/qa/zcash/create_wallet_200k_utxos.py
@@ -0,0 +1,60 @@
+#!/usr/bin/env python3
+# Copyright (c) 2017 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#
+# Create a large wallet
+#
+# To use:
+# - Copy to qa/rpc-tests/wallet_large.py
+# - Add wallet_large.py to RPC tests list
+# - ./qa/pull-tester/rpc-tests.sh wallet_large --nocleanup
+# - Archive the resulting /tmp/test###### directory
+#
+
+from test_framework.test_framework import BitcoinTestFramework
+from test_framework.util import (
+    assert_equal,
+    connect_nodes_bi,
+    initialize_chain_clean,
+    start_nodes,
+)
+
+from decimal import Decimal
+
+
+class LargeWalletTest(BitcoinTestFramework):
+
+    def setup_chain(self):
+        print("Initializing test directory "+self.options.tmpdir)
+        initialize_chain_clean(self.options.tmpdir, 2)
+
+    def setup_network(self):
+        self.nodes = start_nodes(2, self.options.tmpdir)
+        connect_nodes_bi(self.nodes, 0, 1)
+        self.is_network_split = False
+        self.sync_all()
+
+    def run_test(self):
+        self.nodes[1].generate(103)
+        self.sync_all()
+
+        inputs = []
+        for i in range(200000):
+            taddr = self.nodes[0].getnewaddress()
+            inputs.append(self.nodes[1].sendtoaddress(taddr, Decimal("0.001")))
+            if i % 1000 == 0:
+                self.nodes[1].generate(1)
+                self.sync_all()
+
+        self.nodes[1].generate(1)
+        self.sync_all()
+        print('Node 0: %d transactions, %d UTXOs' %
+              (len(self.nodes[0].listtransactions()), len(self.nodes[0].listunspent())))
+        print('Node 1: %d transactions, %d UTXOs' %
+              (len(self.nodes[1].listtransactions()), len(self.nodes[1].listunspent())))
+        assert_equal(len(self.nodes[0].listunspent()), len(inputs))
+
+if __name__ == '__main__':
+    LargeWalletTest().main()
diff --git a/depend/zcash/qa/zcash/full_test_suite.py b/depend/zcash/qa/zcash/full_test_suite.py
new file mode 100755
index 000000000..fd67a6945
--- /dev/null
+++ b/depend/zcash/qa/zcash/full_test_suite.py
@@ -0,0 +1,247 @@
+#!/usr/bin/env python3
+#
+# Execute all of the automated tests related to Zcash.
+#
+
+import argparse
+from glob import glob
+import os
+import re
+import subprocess
+import sys
+
+REPOROOT = os.path.dirname(
+    os.path.dirname(
+        os.path.dirname(
+            os.path.abspath(__file__)
+        )
+    )
+)
+
+def repofile(filename):
+    return os.path.join(REPOROOT, filename)
+
+def get_arch_dir():
+    depends_dir = os.path.join(REPOROOT, 'depends')
+
+    arch_dir = os.path.join(depends_dir, 'x86_64-pc-linux-gnu')
+    if os.path.isdir(arch_dir):
+        return arch_dir
+
+    # Not Linux, try MacOS
+    arch_dirs = glob(os.path.join(depends_dir, 'x86_64-apple-darwin*'))
+    if arch_dirs:
+        # Just try the first one; there will only be one in CI
+        return arch_dirs[0]
+
+    print("!!! cannot find architecture dir under depends/ !!!")
+    return None
+
+
+#
+# Custom test runners
+#
+
+RE_RPATH_RUNPATH = re.compile('No RPATH.*No RUNPATH')
+RE_FORTIFY_AVAILABLE = re.compile('FORTIFY_SOURCE support available.*Yes')
+RE_FORTIFY_USED = re.compile('Binary compiled with FORTIFY_SOURCE support.*Yes')
+
+CXX_BINARIES = [
+    'src/zcashd',
+    'src/zcash-cli',
+    'src/zcash-gtest',
+    'src/zcash-tx',
+    'src/test/test_bitcoin',
+]
+RUST_BINARIES = [
+    'src/zcashd-wallet-tool',
+]
+
+def test_rpath_runpath(filename):
+    output = subprocess.check_output(
+        [repofile('qa/zcash/checksec.sh'), '--file=' + repofile(filename)]
+    )
+    if RE_RPATH_RUNPATH.search(output.decode('utf-8')):
+        print('PASS: %s has no RPATH or RUNPATH.' % filename)
+        return True
+    else:
+        print('FAIL: %s has an RPATH or a RUNPATH.' % filename)
+        print(output)
+        return False
+
+def test_fortify_source(filename):
+    proc = subprocess.Popen(
+        [repofile('qa/zcash/checksec.sh'), '--fortify-file=' + repofile(filename)],
+        stdout=subprocess.PIPE,
+    )
+    line1 = proc.stdout.readline()
+    line2 = proc.stdout.readline()
+    proc.terminate()
+    if RE_FORTIFY_AVAILABLE.search(line1.decode('utf-8')) and RE_FORTIFY_USED.search(line2.decode('utf-8')):
+        print('PASS: %s has FORTIFY_SOURCE.' % filename)
+        return True
+    else:
+        print('FAIL: %s is missing FORTIFY_SOURCE.' % filename)
+        return False
+
+def check_security_hardening():
+    ret = True
+
+    # PIE, RELRO, Canary, and NX are tested by make check-security.
+    ret &= subprocess.call(['make', '-C', repofile('src'), 'check-security']) == 0
+
+    # The remaining checks are only for ELF binaries
+    # Assume that if zcashd is an ELF binary, they all are
+    with open(repofile('src/zcashd'), 'rb') as f:
+        magic = f.read(4)
+        if not magic.startswith(b'\x7fELF'):
+            return ret
+
+    for bin in CXX_BINARIES + RUST_BINARIES:
+        ret &= test_rpath_runpath(bin)
+
+    # NOTE: checksec.sh does not reliably determine whether FORTIFY_SOURCE
+    # is enabled for the entire binary. See issue #915.
+    # FORTIFY_SOURCE is not applicable to Rust binaries.
+    for bin in CXX_BINARIES:
+        ret &= test_fortify_source(bin)
+
+    return ret
+
+def ensure_no_dot_so_in_depends():
+    arch_dir = get_arch_dir()
+    if arch_dir is None:
+        return False
+
+    exit_code = 0
+
+    if os.path.isdir(arch_dir):
+        lib_dir = os.path.join(arch_dir, 'lib')
+        libraries = os.listdir(lib_dir)
+
+        for lib in libraries:
+            if lib.find(".so") != -1:
+                print(lib)
+                exit_code = 1
+    else:
+        exit_code = 2
+        print("arch-specific build dir not present")
+        print("Did you build the ./depends tree?")
+        print("Are you on a currently unsupported architecture?")
+
+    if exit_code == 0:
+        print("PASS.")
+    else:
+        print("FAIL.")
+
+    return exit_code == 0
+
+def util_test():
+    python = []
+    if os.path.isfile('/usr/local/bin/python3'):
+        python = ['/usr/local/bin/python3']
+
+    return subprocess.call(
+        python + [repofile('src/test/bitcoin-util-test.py')],
+        cwd=repofile('src'),
+        env={'PYTHONPATH': repofile('src/test'), 'srcdir': repofile('src')}
+    ) == 0
+
+def rust_test():
+    arch_dir = get_arch_dir()
+    if arch_dir is None:
+        return False
+
+    rust_env = os.environ.copy()
+    rust_env['RUSTC'] = os.path.join(arch_dir, 'native', 'bin', 'rustc')
+    return subprocess.call([
+        os.path.join(arch_dir, 'native', 'bin', 'cargo'),
+        'test',
+        '--manifest-path',
+        os.path.join(REPOROOT, 'Cargo.toml'),
+    ], env=rust_env) == 0
+
+#
+# Tests
+#
+
+STAGES = [
+    'rust-test',
+    'btest',
+    'gtest',
+    'sec-hard',
+    'no-dot-so',
+    'util-test',
+    'secp256k1',
+    'univalue',
+    'rpc',
+]
+
+STAGE_COMMANDS = {
+    'rust-test': rust_test,
+    'btest': [repofile('src/test/test_bitcoin'), '-p'],
+    'gtest': [repofile('src/zcash-gtest')],
+    'sec-hard': check_security_hardening,
+    'no-dot-so': ensure_no_dot_so_in_depends,
+    'util-test': util_test,
+    'secp256k1': ['make', '-C', repofile('src/secp256k1'), 'check'],
+    'univalue': ['make', '-C', repofile('src/univalue'), 'check'],
+    'rpc': [repofile('qa/pull-tester/rpc-tests.py')],
+}
+
+
+#
+# Test driver
+#
+
+def run_stage(stage):
+    print('Running stage %s' % stage)
+    print('=' * (len(stage) + 14))
+    print()
+
+    cmd = STAGE_COMMANDS[stage]
+    if type(cmd) == type([]):
+        ret = subprocess.call(cmd) == 0
+    else:
+        ret = cmd()
+
+    print()
+    print('-' * (len(stage) + 15))
+    print('Finished stage %s' % stage)
+    print()
+
+    return ret
+
+def main():
+    parser = argparse.ArgumentParser()
+    parser.add_argument('--list-stages', dest='list', action='store_true')
+    parser.add_argument('stage', nargs='*', default=STAGES,
+                        help='One of %s'%STAGES)
+    args = parser.parse_args()
+
+    # Check for list
+    if args.list:
+        for s in STAGES:
+            print(s)
+        sys.exit(0)
+
+    # Check validity of stages
+    for s in args.stage:
+        if s not in STAGES:
+            print("Invalid stage '%s' (choose from %s)" % (s, STAGES))
+            sys.exit(1)
+
+    # Run the stages
+    all_passed = True
+    for s in args.stage:
+        passed = run_stage(s)
+        if not passed:
+            print("!!! Stage %s failed !!!" % (s,))
+        all_passed &= passed
+
+    if not all_passed:
+        print("!!! One or more test stages failed !!!")
+        sys.exit(1)
+
+if __name__ == '__main__':
+    main()
diff --git a/depend/zcash/qa/zcash/performance-measurements.sh b/depend/zcash/qa/zcash/performance-measurements.sh
new file mode 100755
index 000000000..34ef268f0
--- /dev/null
+++ b/depend/zcash/qa/zcash/performance-measurements.sh
@@ -0,0 +1,379 @@
+#!/usr/bin/env bash
+
+export LC_ALL=C
+set -u
+
+
+DATADIR=./benchmark-datadir
+SHA256CMD="$(command -v sha256sum || echo shasum)"
+SHA256ARGS="$(command -v sha256sum >/dev/null || echo '-a 256')"
+
+function zcash_rpc {
+    ./src/zcash-cli -datadir="$DATADIR" -rpcuser=user -rpcpassword=password -rpcport=5983 "$@"
+}
+
+function zcash_rpc_slow {
+    # Timeout of 1 hour
+    zcash_rpc -rpcclienttimeout=3600 "$@"
+}
+
+function zcash_rpc_veryslow {
+    # Timeout of 2.5 hours
+    zcash_rpc -rpcclienttimeout=9000 "$@"
+}
+
+function zcash_rpc_wait_for_start {
+    zcash_rpc -rpcwait getinfo > /dev/null
+}
+
+function zcashd_generate {
+    zcash_rpc generate 101 > /dev/null
+}
+
+function extract_benchmark_datadir {
+    if [ -f "$1.tar.xz" ]; then
+        # Check the hash of the archive:
+        "$SHA256CMD" $SHA256ARGS -c <<EOF
+$2  $1.tar.xz
+EOF
+        ARCHIVE_RESULT=$?
+    else
+        echo "$1.tar.xz not found."
+        ARCHIVE_RESULT=1
+    fi
+    if [ $ARCHIVE_RESULT -ne 0 ]; then
+        zcashd_stop
+        echo
+        echo "Please download it and place it in the base directory of the repository."
+        exit 1
+    fi
+    xzcat "$1.tar.xz" | tar x
+}
+
+function use_200k_benchmark {
+    rm -rf benchmark-200k-UTXOs
+    extract_benchmark_datadir benchmark-200k-UTXOs dc8ab89eaa13730da57d9ac373c1f4e818a37181c1443f61fd11327e49fbcc5e
+    DATADIR="./benchmark-200k-UTXOs/node$1"
+}
+
+function zcashd_start {
+    case "$1" in
+        sendtoaddress|loadwallet|listunspent)
+            case "$2" in
+                200k-recv)
+                    use_200k_benchmark 0
+                    ;;
+                200k-send)
+                    use_200k_benchmark 1
+                    ;;
+                *)
+                    echo "Bad arguments to zcashd_start."
+                    exit 1
+            esac
+            ;;
+        *)
+            rm -rf "$DATADIR"
+            mkdir -p "$DATADIR/regtest"
+            touch "$DATADIR/zcash.conf"
+    esac
+    ./src/zcashd -regtest -datadir="$DATADIR" -rpcuser=user -rpcpassword=password -rpcport=5983 -showmetrics=0 &
+    ZCASHD_PID=$!
+    zcash_rpc_wait_for_start
+}
+
+function zcashd_stop {
+    zcash_rpc stop > /dev/null
+    wait $ZCASHD_PID
+}
+
+function zcashd_massif_start {
+    case "$1" in
+        sendtoaddress|loadwallet|listunspent)
+            case "$2" in
+                200k-recv)
+                    use_200k_benchmark 0
+                    ;;
+                200k-send)
+                    use_200k_benchmark 1
+                    ;;
+                *)
+                    echo "Bad arguments to zcashd_massif_start."
+                    exit 1
+            esac
+            ;;
+        *)
+            rm -rf "$DATADIR"
+            mkdir -p "$DATADIR/regtest"
+            touch "$DATADIR/zcash.conf"
+    esac
+    rm -f massif.out
+    valgrind --tool=massif --time-unit=ms --massif-out-file=massif.out ./src/zcashd -regtest -datadir="$DATADIR" -rpcuser=user -rpcpassword=password -rpcport=5983 -showmetrics=0 &
+    ZCASHD_PID=$!
+    zcash_rpc_wait_for_start
+}
+
+function zcashd_massif_stop {
+    zcash_rpc stop > /dev/null
+    wait $ZCASHD_PID
+    ms_print massif.out
+}
+
+function zcashd_valgrind_start {
+    rm -rf "$DATADIR"
+    mkdir -p "$DATADIR/regtest"
+    touch "$DATADIR/zcash.conf"
+    rm -f valgrind.out
+    valgrind --leak-check=yes -v --error-limit=no --log-file="valgrind.out" ./src/zcashd -regtest -datadir="$DATADIR" -rpcuser=user -rpcpassword=password -rpcport=5983 -showmetrics=0 &
+    ZCASHD_PID=$!
+    zcash_rpc_wait_for_start
+}
+
+function zcashd_valgrind_stop {
+    zcash_rpc stop > /dev/null
+    wait $ZCASHD_PID
+    cat valgrind.out
+}
+
+function extract_benchmark_data {
+    if [ -f "block-107134.tar.xz" ]; then
+        # Check the hash of the archive:
+        "$SHA256CMD" $SHA256ARGS -c <<EOF
+4bd5ad1149714394e8895fa536725ed5d6c32c99812b962bfa73f03b5ffad4bb  block-107134.tar.xz
+EOF
+        ARCHIVE_RESULT=$?
+    else
+        echo "block-107134.tar.xz not found."
+        ARCHIVE_RESULT=1
+    fi
+    if [ $ARCHIVE_RESULT -ne 0 ]; then
+        zcashd_stop
+        echo
+        echo "Please generate it using qa/zcash/create_benchmark_archive.py"
+        echo "and place it in the base directory of the repository."
+        echo "Usage details are inside the Python script."
+        exit 1
+    fi
+    xzcat block-107134.tar.xz | tar x -C "$DATADIR/regtest"
+}
+
+
+if [ $# -lt 2 ]
+then
+    echo "$0 : At least two arguments are required!"
+    exit 1
+fi
+
+# Precomputation
+case "$1" in
+    *)
+        case "$2" in
+            verifyjoinsplit)
+                zcashd_start "${@:2}"
+                RAWJOINSPLIT=$(zcash_rpc zcsamplejoinsplit)
+                zcashd_stop
+        esac
+esac
+
+case "$1" in
+    time)
+        zcashd_start "${@:2}"
+        case "$2" in
+            sleep)
+                zcash_rpc zcbenchmark sleep 10
+                ;;
+            parameterloading)
+                zcash_rpc zcbenchmark parameterloading 10
+                ;;
+            createsaplingspend)
+                zcash_rpc zcbenchmark createsaplingspend 10
+                ;;
+            verifysaplingspend)
+                zcash_rpc zcbenchmark verifysaplingspend 1000
+                ;;
+            createsaplingoutput)
+                zcash_rpc zcbenchmark createsaplingoutput 50
+                ;;
+            verifysaplingoutput)
+                zcash_rpc zcbenchmark verifysaplingoutput 1000
+                ;;
+            createjoinsplit)
+                zcash_rpc zcbenchmark createjoinsplit 10 "${@:3}"
+                ;;
+            verifyjoinsplit)
+                zcash_rpc zcbenchmark verifyjoinsplit 1000 "\"$RAWJOINSPLIT\""
+                ;;
+            solveequihash)
+                zcash_rpc_slow zcbenchmark solveequihash 50 "${@:3}"
+                ;;
+            verifyequihash)
+                zcash_rpc zcbenchmark verifyequihash 1000
+                ;;
+            validatelargetx)
+                zcash_rpc zcbenchmark validatelargetx 10 "${@:3}"
+                ;;
+            trydecryptnotes)
+                zcash_rpc zcbenchmark trydecryptnotes 1000 "${@:3}"
+                ;;
+            incnotewitnesses)
+                zcash_rpc zcbenchmark incnotewitnesses 100 "${@:3}"
+                ;;
+            connectblockslow)
+                extract_benchmark_data
+                zcash_rpc zcbenchmark connectblockslow 10
+                ;;
+            sendtoaddress)
+                zcash_rpc zcbenchmark sendtoaddress 10 "${@:4}"
+                ;;
+            loadwallet)
+                zcash_rpc zcbenchmark loadwallet 10 
+                ;;
+            listunspent)
+                zcash_rpc zcbenchmark listunspent 10
+                ;;
+            *)
+                zcashd_stop
+                echo "Bad arguments to time."
+                exit 1
+        esac
+        zcashd_stop
+        ;;
+    memory)
+        zcashd_massif_start "${@:2}"
+        case "$2" in
+            sleep)
+                zcash_rpc zcbenchmark sleep 1
+                ;;
+            parameterloading)
+                zcash_rpc zcbenchmark parameterloading 1
+                ;;
+            createsaplingspend)
+                zcash_rpc zcbenchmark createsaplingspend 1
+                ;;
+            verifysaplingspend)
+                zcash_rpc zcbenchmark verifysaplingspend 1
+                ;;
+            createsaplingoutput)
+                zcash_rpc zcbenchmark createsaplingoutput 1
+                ;;
+            verifysaplingoutput)
+                zcash_rpc zcbenchmark verifysaplingoutput 1
+                ;;
+            createjoinsplit)
+                zcash_rpc_slow zcbenchmark createjoinsplit 1 "${@:3}"
+                ;;
+            verifyjoinsplit)
+                zcash_rpc zcbenchmark verifyjoinsplit 1 "\"$RAWJOINSPLIT\""
+                ;;
+            solveequihash)
+                zcash_rpc_slow zcbenchmark solveequihash 1 "${@:3}"
+                ;;
+            verifyequihash)
+                zcash_rpc zcbenchmark verifyequihash 1
+                ;;
+            validatelargetx)
+                zcash_rpc zcbenchmark validatelargetx 1
+                ;;
+            trydecryptnotes)
+                zcash_rpc zcbenchmark trydecryptnotes 1 "${@:3}"
+                ;;
+            incnotewitnesses)
+                zcash_rpc zcbenchmark incnotewitnesses 1 "${@:3}"
+                ;;
+            connectblockslow)
+                extract_benchmark_data
+                zcash_rpc zcbenchmark connectblockslow 1
+                ;;
+            sendtoaddress)
+                zcash_rpc zcbenchmark sendtoaddress 1 "${@:4}"
+                ;;
+            loadwallet)
+                # The initial load is sufficient for measurement
+                ;;
+            listunspent)
+                zcash_rpc zcbenchmark listunspent 1
+                ;;
+            *)
+                zcashd_massif_stop
+                echo "Bad arguments to memory."
+                exit 1
+        esac
+        zcashd_massif_stop
+        rm -f massif.out
+        ;;
+    valgrind)
+        zcashd_valgrind_start
+        case "$2" in
+            sleep)
+                zcash_rpc zcbenchmark sleep 1
+                ;;
+            parameterloading)
+                zcash_rpc zcbenchmark parameterloading 1
+                ;;
+            createsaplingspend)
+                zcash_rpc zcbenchmark createsaplingspend 1
+                ;;
+            verifysaplingspend)
+                zcash_rpc zcbenchmark verifysaplingspend 1
+                ;;
+            createsaplingoutput)
+                zcash_rpc zcbenchmark createsaplingoutput 1
+                ;;
+            verifysaplingoutput)
+                zcash_rpc zcbenchmark verifysaplingoutput 1
+                ;;
+            createjoinsplit)
+                zcash_rpc_veryslow zcbenchmark createjoinsplit 1 "${@:3}"
+                ;;
+            verifyjoinsplit)
+                zcash_rpc zcbenchmark verifyjoinsplit 1 "\"$RAWJOINSPLIT\""
+                ;;
+            solveequihash)
+                zcash_rpc_veryslow zcbenchmark solveequihash 1 "${@:3}"
+                ;;
+            verifyequihash)
+                zcash_rpc zcbenchmark verifyequihash 1
+                ;;
+            trydecryptnotes)
+                zcash_rpc zcbenchmark trydecryptnotes 1 "${@:3}"
+                ;;
+            incnotewitnesses)
+                zcash_rpc zcbenchmark incnotewitnesses 1 "${@:3}"
+                ;;
+            connectblockslow)
+                extract_benchmark_data
+                zcash_rpc zcbenchmark connectblockslow 1
+                ;;
+            *)
+                zcashd_valgrind_stop
+                echo "Bad arguments to valgrind."
+                exit 1
+        esac
+        zcashd_valgrind_stop
+        rm -f valgrind.out
+        ;;
+    valgrind-tests)
+        case "$2" in
+            gtest)
+                rm -f valgrind.out
+                valgrind --leak-check=yes -v --error-limit=no --log-file="valgrind.out" ./src/zcash-gtest
+                cat valgrind.out
+                rm -f valgrind.out
+                ;;
+            test_bitcoin)
+                rm -f valgrind.out
+                valgrind --leak-check=yes -v --error-limit=no --log-file="valgrind.out" ./src/test/test_bitcoin
+                cat valgrind.out
+                rm -f valgrind.out
+                ;;
+            *)
+                echo "Bad arguments to valgrind-tests."
+                exit 1
+        esac
+        ;;
+    *)
+        echo "Invalid benchmark type."
+        exit 1
+esac
+
+# Cleanup
+rm -rf "$DATADIR"
diff --git a/depend/zcash/qa/zcash/postponed-updates.txt b/depend/zcash/qa/zcash/postponed-updates.txt
new file mode 100644
index 000000000..423e1c2f7
--- /dev/null
+++ b/depend/zcash/qa/zcash/postponed-updates.txt
@@ -0,0 +1,36 @@
+# List of Postponed Dependency Updates
+#
+# The format is: name version expiration, e.g.
+# bdb 18.1.40 2020-09-01
+#
+
+# Ccache 4.0 requires adding CMake to the depends system.
+native_ccache 4.0 2022-06-01
+native_ccache 4.1 2022-06-01
+native_ccache 4.2 2022-06-01
+native_ccache 4.2.1 2022-06-01
+native_ccache 4.3 2022-06-01
+native_ccache 4.4 2022-06-01
+native_ccache 4.4.1 2022-06-01
+native_ccache 4.4.2 2022-06-01
+native_ccache 4.5 2022-06-01
+native_ccache 4.5.1 2022-06-01
+native_ccache 4.6 2022-06-01
+
+# Clang and Rust are currently pinned to LLVM 13
+native_clang 14.0.0 2022-06-01
+native_clang 14.0.1 2022-06-01
+native_clang 14.0.2 2022-06-01
+native_clang 14.0.3 2022-06-01
+libcxx 14.0.0 2022-06-01
+libcxx 14.0.1 2022-06-01
+libcxx 14.0.2 2022-06-01
+libcxx 14.0.3 2022-06-01
+native_rust 1.60.0 2022-06-01
+
+# We're never updating to this version
+bdb 18.1.40 2024-02-01
+
+# Google Test 1.10.0 requires adding CMake to the depends system.
+googletest 1.10.0 2022-06-01
+googletest 1.11.0 2022-06-01
diff --git a/depend/zcash/qa/zcash/smoke_tests.py b/depend/zcash/qa/zcash/smoke_tests.py
new file mode 100755
index 000000000..755ddc6d1
--- /dev/null
+++ b/depend/zcash/qa/zcash/smoke_tests.py
@@ -0,0 +1,735 @@
+#!/usr/bin/env python3
+#
+# Execute the standard smoke tests for Zcash releases.
+#
+# Usage:
+#
+# ZCASHD=./src/zcashd ZCASHCLI=./src/zcash-cli ./qa/zcash/smoke_tests.py --wallet=wallet.smoketest.dat "$HOME/.zcash"
+# 
+# ZCASHD=./src/zcashd ZCASHCLI=./src/zcash-cli ./qa/zcash/smoke_tests.py --wallet=wallet.smoketest.dat "$HOME/.zcash" --automate --use-faucet
+#
+
+import argparse
+import datetime
+import os
+import requests
+import subprocess
+import sys
+import time
+import traceback
+
+from decimal import Decimal
+from slickrpc import Proxy
+from slickrpc.exc import RpcException
+
+DEFAULT_FEE = Decimal('0.00001')
+URL_FAUCET_DONATION = 'https://faucet.testnet.z.cash/donations'
+URL_FAUCET_TAP = 'https://faucet.testnet.z.cash/'
+
+#
+# Smoke test definitions
+#
+
+# (case, expected_mainnet, expected_testnet)
+SMOKE_TESTS = [
+    # zcashd start/stop/restart flows
+    ('1a', True, True), # zcashd start
+    ('1b', True, True), # Graceful zcashd stop
+    ('1c', True, True), # Ungraceful zcashd stop
+    ('1d', True, True), # zcashd start; graceful zcashd stop; zcashd start
+    ('1e', True, True), # zcashd start; ungraceful zcashd stop; zcashd start
+    # Control
+    ('2a', True, True), # Run getinfo
+    ('2b', True, True), # Run help
+    # Address generation
+    #('3a', True, True), # Generate a Sprout z-addr
+    #('3b', True, True), # Generate multiple Sprout z-addrs
+    ('3c', True, True), # Generate a t-addr
+    ('3d', True, True), # Generate multiple t-addrs
+    ('3e', True, True), # Generate a Sapling z-addr
+    ('3f', True, True), # Generate multiple Sapling z-addrs
+    # Transactions
+    #('4a', True,  True ), # Send funds from Sprout z-addr to same Sprout z-addr
+    #('4b', True,  True ), # Send funds from Sprout z-addr to a different Sprout z-addr
+    #('4c', True,  True ), # Send funds from Sprout z-addr to a t-addr
+    #('4d', False,  False ), # Send funds from t-addr to Sprout z-addr(expected fail as of Canopy)
+    ('4e', True,  True ), # Send funds from t-addr to t-addr
+    ('4f', True,  True ), # Send funds from t-addr to Sapling z-addr
+    ('4g', True,  True ), # Send funds from Sapling z-addr to same Sapling z-addr
+    ('4h', True,  True ), # Send funds from Sapling z-addr to a different Sapling z-addr
+    ('4i', True,  True ), # Send funds from Sapling z-addr to a t-addr
+    #('4j', False, False), # Send funds from Sprout z-addr to Sapling z-addr
+    #('4k', True,  True ), # Send funds from Sprout z-addr to multiple Sprout z-addrs
+    #('4l', True,  True ), # Send funds from Sprout z-addr to multiple t-addrs
+    #('4m', True,  True ), # Send funds from Sprout z-addr to t-addr and Sprout z-addrs
+    #('4n', False, False), # Send funds from Sprout z-addr to t-addr and Sapling z-addr
+    #('4o', False, False), # Send funds from Sprout z-addr to multiple Sapling z-addrs
+    ('4p', True,  True ), # Send funds from t-addr to multiple t-addrs
+    #('4q', False,  False ), # Send funds from t-addr to multiple Sprout z-addrs(expected fail as of Canopy)
+    ('4r', True,  True ), # Send funds from t-addr to multiple Sapling z-addrs
+    #('4s', False, False), # Send funds from t-addr to Sprout z-addr and Sapling z-addr
+    ('4t', True,  True ), # Send funds from Sapling z-addr to multiple Sapling z-addrs
+    #('4u', False, False), # Send funds from Sapling z-addr to multiple Sprout z-addrs
+    ('4v', True,  True ), # Send funds from Sapling z-addr to multiple t-addrs
+    ('4w', True,  True ), # Send funds from Sapling z-addr to t-addr and Sapling z-addr
+    #('4x', False, False), # Send funds from Sapling z-addr to Sapling z-addr and Sprout z-addr
+    #('4y', False,  False ), # Send funds from t-addr to Sprout z-addr using z_mergetoaddress(expected fail as of Canopy)
+    #('4z', False,  False ), # Send funds from 2 different t-addrs to Sprout z-addr using z_mergetoaddress(expected fail as of Canopy)
+    #('4aa', False, False), # Send funds from the same 2 t-addrs to Sprout z-addr using z_mergetoaddress
+    ('4bb', True,  True ), # Send funds from 2 different t-addrs to Sapling z-addr using z_mergetoaddress
+    ('4cc', True,  True ), # Send funds from t-addr to Sapling z-addr using z_mergetoaddress
+    #('4dd', False,  False ), # Send funds from t-addr and Sprout z-addr to Sprout z-addr using z_mergetoaddress(expected fail as of Canopy)
+    ('4ee', True,  True ), # Send funds from t-addr and Sapling z-addr to Sapling z-addr using z_mergetoaddress
+    #('4ff', True,  True ), # Send funds from Sprout z-addr and Sprout z-addr to Sprout z-addr using z_mergetoaddress
+    ('4gg', True,  True ), # Send funds from  Sapling z-addr and Sapling z-addr to Sapling z-addr using z_mergetoaddress
+    # Wallet
+    ('5a', True, True), # After generating multiple z-addrs, run z_listaddresses
+    #('5b', True, True), # Run z_validateaddress with a Sprout z-addr
+    ('5c', True, True), # Run z_validateaddress with a Sapling z-addr
+    ('5d', True, True), # After a transaction, run z_listunspent
+    ('5e', True, True), # After a transaction, run z_listreceivedbyaddress
+    ('5f', True, True), # After a transaction, run z_getbalance
+    ('5g', True, True), # After a transaction, run z_gettotalbalance
+    ('5h', True, True), # Run z_exportkey using a Sprout z-addr
+    ('5i', True, True), # Run z_importkey using the zkey from a Sprout z-addr
+    ('5j', True, True), # Run z_exportkey using a Sapling z-addr
+    ('5k', True, True), # Run z_importkey using the zkey from a Sapling z-addr
+    ('5l', True, True), # Run z_exportwallet
+    ('5m', True, True), # Run z_importwallet
+    ('5n', True, True), # Run z_shieldcoinbase
+    ('5o', True, True), # Run getwalletinfo
+    # Network
+    ('6a', True, True), # Run getpeerinfo
+    ('6b', True, True), # Run getnetworkinfo
+    ('6c', True, False), # Run getdeprecationinfo
+    ('6d', True, True), # Run getconnectioncount
+    ('6e', True, True), # Run getaddednodeinfo
+    # Mining
+    ('7a', True, True), # Run getblocksubsidy
+    ('7b', True, True), # Run getblocktemplate
+    ('7c', True, True), # Run getmininginfo
+    ('7d', True, True), # Run getnetworkhashps
+    ('7e', True, True), # Run getnetworksolps
+]
+
+TIME_STARTED = datetime.datetime.now()
+
+#
+# Test helpers
+#
+
+def run_cmd(results, case, zcash, name, args=[]):
+    print('----- %s -----' % (datetime.datetime.now() - TIME_STARTED))
+    print('%s $ zcash-cli %s %s' % (
+        case.ljust(3),
+        name,
+        ' '.join([str(arg) for arg in args],
+    )))
+    try:
+        res = zcash.__getattr__(name)(*args)
+        print(res)
+        print()
+        if results is not None and len(case) > 0:
+            results[case] = True
+        return res
+    except RpcException as e:
+        print('ERROR: %s' % str(e))
+        if results is not None and len(case) > 0:
+            results[case] = False
+        return None
+
+def wait_for_balance(zcash, zaddr, expected=None):
+    print('Waiting for funds to %s...' % zaddr)
+    unconfirmed_balance = Decimal(zcash.z_getbalance(zaddr, 0)).quantize(Decimal('1.00000000'))
+    print('Expecting: %s; Unconfirmed Balance: %s' % (expected, unconfirmed_balance))
+    if expected is not None and unconfirmed_balance != expected:
+        print('WARNING: Unconfirmed balance does not match expected balance')
+
+    # Default timeout is 15 minutes
+    ttl = 900
+    while True:
+        balance = Decimal(zcash.z_getbalance(zaddr)).quantize(Decimal('1.00000000'))
+        if (expected is not None and balance == unconfirmed_balance) or (expected is None and balance > 0):
+            print('Received %s' % balance)
+            return balance
+
+        time.sleep(1)
+        ttl -= 1
+        if ttl == 0:
+            if zcash.automated:
+                # Reset timeout
+                ttl = 300
+            else:
+                # Ask user if they want to keep waiting
+                print()
+                print('Balance: %s Expected: %s' % (balance, expected))
+                ret = input('Do you wish to continue waiting? (Y/n) ')
+                if ret.lower() == 'n':
+                    print('Address contained %s at timeout' % balance)
+                    return balance
+                else:
+                    # Wait another 5 minutes before asking again
+                    ttl = 300
+
+def wait_and_check_balance(results, case, zcash, addr, expected):
+    #Wait for async call to finish and persist completely to caller
+    time.sleep(5)
+    balance = wait_for_balance(zcash, addr, expected)
+    if balance != expected and results is not None and len(case) > 0:
+        results[case] = False
+    return balance
+
+def wait_for_txid_operation(zcash, opid, timeout=300):
+    print('Waiting for async operation %s' % opid)
+    result = None
+    for _ in iter(range(timeout)):
+        results = zcash.z_getoperationresult([opid])
+        if len(results) > 0:
+            result = results[0]
+            break
+        time.sleep(1)
+
+    status = result['status']
+    if status == 'failed':
+        print('Operation failed')
+        print(result['error']['message'])
+        return None
+    elif status == 'success':
+        txid = result['result']['txid']
+        print('txid: %s' % txid)
+        return txid
+
+def async_txid_cmd(results, case, zcash, name, args=[]):
+    opid = run_cmd(results, case, zcash, name, args)
+    # Some async commands return a dictionary containing the opid
+    if isinstance(opid, dict):
+        opid = opid['opid']
+    if opid is None:
+        if results is not None and len(case) > 0:
+            results[case] = False
+        return None
+
+    txid = wait_for_txid_operation(zcash, opid)
+    if txid is None:
+        if results is not None and len(case) > 0:
+            results[case] = False
+    return txid
+
+def z_sendmany(results, case, zcash, from_addr, recipients):
+    return async_txid_cmd(results, case, zcash, 'z_sendmany', [
+        from_addr,
+        [{
+            'address': to_addr,
+            'amount': amount,
+        } for (to_addr, amount) in recipients]
+    ])
+
+def check_z_sendmany(results, case, zcash, from_addr, recipients):
+    txid = z_sendmany(results, case, zcash, from_addr, recipients)
+    if txid is None:
+        return [Decimal('0')]
+    return [wait_and_check_balance(results, case, zcash, to_addr, amount) for (to_addr, amount) in recipients]
+
+def check_z_sendmany_parallel(results, zcash, runs):
+    # First attempt to create all the transactions
+    txids = [(run, z_sendmany(results, run[0], zcash, run[1], run[2])) for run in runs]
+    # Then wait for balance updates caused by successful transactions
+    return [
+        wait_and_check_balance(results, run[0], zcash, to_addr, amount) if txid is not None else Decimal('0')
+        for (run, txid) in txids
+        for (to_addr, amount) in run[2]]
+
+def z_mergetoaddress(results, case, zcash, from_addrs, to_addr):
+    return async_txid_cmd(results, case, zcash, 'z_mergetoaddress', [from_addrs, to_addr])
+
+def check_z_mergetoaddress(results, case, zcash, from_addrs, to_addr, amount):
+    txid = z_mergetoaddress(results, case, zcash, from_addrs, to_addr)
+    if txid is None:
+        return Decimal('0')
+    return wait_and_check_balance(results, case, zcash, to_addr, amount)
+
+def check_z_mergetoaddress_parallel(results, zcash, runs):
+    # First attempt to create all the transactions
+    txids = [(run, z_mergetoaddress(results, run[0], zcash, run[1], run[2])) for run in runs]
+    # Then wait for balance updates caused by successful transactions
+    return [
+        wait_and_check_balance(results, run[0], zcash, run[2], run[3]) if txid is not None else Decimal('0')
+        for (run, txid) in txids]
+
+def tap_zfaucet(addr):
+    with requests.Session() as session:
+        # Get token to request TAZ from faucet with a given zcash address
+        response = session.get(URL_FAUCET_TAP)
+        if response.status_code != 200:
+            print("Error establishing session at:", URL_FAUCET_TAP)
+            os.sys.exit(1)
+        csrftoken = response.cookies['csrftoken']
+
+        # Request TAZ from the faucet
+        data_params = dict(csrfmiddlewaretoken=csrftoken, address=addr)
+        response2 = session.post(URL_FAUCET_TAP, data=data_params, headers=dict(Referer=URL_FAUCET_TAP))
+        if response2.status_code != 200:
+            print("Error tapping faucet at:", URL_FAUCET_TAP)
+            os.sys.exit(1)
+
+def get_zfaucet_addrs():
+    with requests.Session() as session:
+        response = session.get(URL_FAUCET_DONATION)
+        if response.status_code != 200:
+            print("Error establishing session at:", URL_FAUCET_DONATION)
+            os.sys.exit(1)
+        data = response.json()
+    return data
+
+def get_zfaucet_taddr():
+    return get_zfaucet_addrs()["t_address"]
+
+def get_zfaucet_zsapaddr():
+    # At the time of writing this, it appears these(keys) are backwards
+    return get_zfaucet_addrs()["z_address_legacy"]
+
+def get_zfaucet_zsproutaddr():
+    # At the time of writing this, it appears these(keys) are backwards
+    return get_zfaucet_addrs()["z_address_sapling"]
+
+#
+# Test runners
+#
+
+def simple_commands(zcash):
+    results = {}
+    run_cmd(results, '2a', zcash, 'getinfo'),
+    run_cmd(results, '2b', zcash, 'help'),
+    run_cmd(results, '5o', zcash, 'getwalletinfo'),
+    run_cmd(results, '6a', zcash, 'getpeerinfo'),
+    run_cmd(results, '6b', zcash, 'getnetworkinfo'),
+    run_cmd(results, '6c', zcash, 'getdeprecationinfo'),
+    run_cmd(results, '6d', zcash, 'getconnectioncount'),
+    run_cmd(results, '6e', zcash, 'getaddednodeinfo', [False]),
+    run_cmd(results, '7a', zcash, 'getblocksubsidy'),
+    run_cmd(results, '7c', zcash, 'getmininginfo'),
+    run_cmd(results, '7d', zcash, 'getnetworkhashps'),
+    run_cmd(results, '7e', zcash, 'getnetworksolps'),
+    return results
+
+def transaction_chain(zcash):
+    results = {}
+
+    # Generate the various addresses we will use
+    taddr_1 = run_cmd(results, '3c', zcash, 'getnewaddress')
+    taddr_2 = run_cmd(results, '3d', zcash, 'getnewaddress')
+    taddr_3 = run_cmd(results, '3d', zcash, 'getnewaddress')
+    taddr_4 = run_cmd(results, '3d', zcash, 'getnewaddress')
+    taddr_5 = run_cmd(results, '3d', zcash, 'getnewaddress')
+    sapling_zaddr_1 = run_cmd(results, '3e', zcash, 'z_getnewaddress', ['sapling'])
+    sapling_zaddr_2 = run_cmd(results, '3f', zcash, 'z_getnewaddress', ['sapling'])
+    sapling_zaddr_3 = run_cmd(results, '3f', zcash, 'z_getnewaddress', ['sapling'])
+
+    # Check that the zaddrs are all listed
+    zaddrs = run_cmd(results, '5a', zcash, 'z_listaddresses')
+    if ( sapling_zaddr_1 not in zaddrs or
+            sapling_zaddr_2 not in zaddrs):
+        results['5a'] = False
+
+    # Validate the addresses
+    ret = run_cmd(results, '5c', zcash, 'z_validateaddress', [sapling_zaddr_1])
+    if not ret['isvalid'] or ret['type'] != 'sapling':
+        results['5c'] = False
+
+    # Set up beginning and end of the chain
+    print('#')
+    print('# Initialising transaction chain')
+    print('#')
+    print()
+    if zcash.use_faucet:
+        print('Tapping the testnet faucet for testing funds...')
+        chain_end = get_zfaucet_taddr()
+        tap_zfaucet(taddr_1)
+        print('Done! Leftover funds will be sent back to the faucet.')
+    else:
+        chain_end = input('Type or paste transparent address where leftover funds should be sent: ')
+        if not zcash.validateaddress(chain_end)['isvalid']:
+            print('Invalid transparent address')
+            return results
+        print()
+        print('Please send at least 0.01 ZEC/TAZ to the following address:')
+        print(taddr_1)
+        print()
+        input('Press Enter once the funds have been sent.')
+    print()
+
+    # Wait to receive starting balance
+    taddr_balance = wait_for_balance(zcash, taddr_1)
+    starting_balance = taddr_balance
+
+    #
+    # Start the transaction chain!
+    #
+    print()
+    print('#')
+    print('# Starting transaction chain')
+    print('#')
+    print()
+    try:
+        # taddr -> Sapling
+        # Send it all here because z_sendmany pick a new t-addr for change
+        sapling_balance = check_z_sendmany(
+            results, '4f', zcash, taddr_1, [(sapling_zaddr_1, taddr_balance - DEFAULT_FEE)])[0]
+        taddr_balance = Decimal('0')
+
+        # Sapling -> taddr
+        taddr_balance = check_z_sendmany(
+            results, '4i', zcash, sapling_zaddr_1, [(taddr_1, (starting_balance / Decimal('10')) * Decimal('3'))])[0]
+        sapling_balance -= taddr_balance + DEFAULT_FEE
+
+        #
+        # Intra-pool tests
+        #
+
+        # Sapling -> same Sapling
+        sapling_balance = check_z_sendmany(
+            results, '4g',zcash, sapling_zaddr_1, [(sapling_zaddr_1, sapling_balance - DEFAULT_FEE)])[0]
+
+        # taddr -> different taddr
+        # Sapling -> different Sapling
+        (taddr_balance, sapling_balance) = check_z_sendmany_parallel(results, zcash, [
+            ('4e', taddr_1, [(taddr_2, taddr_balance - DEFAULT_FEE)]),
+            ('4h', sapling_zaddr_1, [(sapling_zaddr_2, sapling_balance - DEFAULT_FEE)]),
+        ])
+
+        # taddr -> multiple taddr
+        # Sapling -> multiple Sapling
+        check_z_sendmany_parallel(results, zcash, [
+            ('4p', taddr_2, [
+                (taddr_1, starting_balance / Decimal('10')),
+                (taddr_3, taddr_balance - (starting_balance / Decimal('10')) - DEFAULT_FEE),
+            ]),
+            ('4t', sapling_zaddr_2, [
+                (sapling_zaddr_1, starting_balance / Decimal('10')),
+                (sapling_zaddr_3, starting_balance / Decimal('10')),
+            ]),
+        ])
+
+        taddr_balance -= DEFAULT_FEE
+        sapling_balance -= DEFAULT_FEE
+
+        # multiple Sapling -> Sapling
+        # multiple taddr -> taddr
+        check_z_mergetoaddress_parallel(results, zcash, [
+            ('4gg', [sapling_zaddr_1, sapling_zaddr_3], sapling_zaddr_2, sapling_balance - DEFAULT_FEE),
+            ('', [taddr_1, taddr_3], taddr_2, taddr_balance - DEFAULT_FEE),
+        ])
+        sapling_balance -= DEFAULT_FEE
+        taddr_balance -= DEFAULT_FEE
+        taddr_2_balance = taddr_balance
+
+        #
+        # Inter-pool tests
+        #
+
+        # Sapling -> taddr and Sapling
+        check_z_sendmany(
+            results, '4w', zcash,  sapling_zaddr_2,[
+                (taddr_3, starting_balance / Decimal('10')),
+                (sapling_zaddr_1, starting_balance / Decimal('10'))])[0]
+        
+        sapling_balance -= (starting_balance / Decimal('10')) + DEFAULT_FEE
+        taddr_balance += starting_balance / Decimal('10')
+
+        # taddr and Sapling -> Sapling
+        check_z_mergetoaddress(results, '4ee', zcash, [taddr_3, sapling_zaddr_1], sapling_zaddr_2, sapling_balance + (starting_balance / Decimal('10')) - DEFAULT_FEE)
+    
+        sapling_balance += (starting_balance / Decimal('10')) - DEFAULT_FEE
+        taddr_balance -= starting_balance / Decimal('10')
+
+        # Sapling -> multiple taddr
+        check_z_sendmany(results, '4v', zcash, sapling_zaddr_2, [
+                (taddr_4, (starting_balance / Decimal('10'))),
+                (taddr_5, (starting_balance / Decimal('10')))])[0]
+            
+        sapling_balance -= ((starting_balance / Decimal('10')) * Decimal('2')) + DEFAULT_FEE
+        taddr_balance += (starting_balance / Decimal('10')) * Decimal('2')
+
+        # multiple taddr -> Sapling
+        check_z_mergetoaddress(results, '4bb',zcash, [taddr_4, taddr_5], sapling_zaddr_2, sapling_balance + ((starting_balance / Decimal('10')) * Decimal('2')) - DEFAULT_FEE)
+        sapling_balance += ((starting_balance / Decimal('10')) * Decimal('2')) - DEFAULT_FEE
+        taddr_balance -= (starting_balance / Decimal('10')) * Decimal('2')
+
+        # multiple Sapling -> taddr
+        check_z_mergetoaddress(None, '', zcash, [sapling_zaddr_1, sapling_zaddr_2, sapling_zaddr_3], taddr_2, taddr_2_balance + sapling_balance - DEFAULT_FEE)
+        taddr_balance += sapling_balance - DEFAULT_FEE
+        sapling_balance = Decimal('0')
+
+        # taddr -> multiple Sapling
+        taddr_2_balance = Decimal(zcash.z_getbalance(taddr_2)).quantize(Decimal('1.00000000'))
+        check_z_sendmany(results, '4r', zcash, taddr_2, [
+                (sapling_zaddr_1, (starting_balance / Decimal('10'))),
+                (sapling_zaddr_2, taddr_2_balance - (starting_balance / Decimal('10')) - DEFAULT_FEE)])[0]
+
+        sapling_balance = taddr_2_balance - DEFAULT_FEE
+        taddr_balance -= taddr_2_balance
+
+        # multiple Sapling -> taddr
+        check_z_mergetoaddress(None, '', zcash, [sapling_zaddr_1, sapling_zaddr_2], taddr_2, sapling_balance - DEFAULT_FEE)
+        taddr_balance += sapling_balance -  DEFAULT_FEE
+        sapling_balance = Decimal('0')
+
+        # z_mergetoaddress taddr -> Sapling
+        taddr_2_balance = Decimal(zcash.z_getbalance(taddr_2)).quantize(Decimal('1.00000000'))
+        check_z_mergetoaddress(results, '4cc', zcash,  [taddr_2], sapling_zaddr_1, taddr_2_balance - DEFAULT_FEE)
+        sapling_balance = taddr_2_balance - DEFAULT_FEE
+        taddr_balance -= taddr_2_balance
+    except Exception as e:
+        print('Error: %s' % e)
+        traceback.print_exc()
+    finally:
+        #
+        # End the chain by returning the remaining funds
+        #
+        print()
+        print('#')
+        print('# Finishing transaction chain')
+        print('#')
+        all_addrs = [
+            taddr_1, taddr_2, taddr_3, taddr_4, taddr_5,
+            sapling_zaddr_1, sapling_zaddr_2, sapling_zaddr_3,
+        ]
+
+        print()
+        print('Waiting for all transactions to be mined')
+        for addr in all_addrs:
+            balance = Decimal(zcash.z_getbalance(addr, 0)).quantize(Decimal('1.00000000'))
+            if balance > 0:
+                wait_for_balance(zcash, addr, balance)
+
+        print()
+        print('Returning remaining balance minus fees')
+        for addr in all_addrs:
+            balance = Decimal(zcash.z_getbalance(addr)).quantize(Decimal('1.00000000'))
+            if balance > 0:
+                z_sendmany(None, '', zcash, addr, [(chain_end, balance - DEFAULT_FEE)])
+
+    return results
+
+
+#
+# Test stages
+#
+
+STAGES = [
+    'simple-commands',
+    'transaction-chain'
+]
+
+STAGE_COMMANDS = {
+    'simple-commands': simple_commands,
+    'transaction-chain': transaction_chain,
+}
+
+def run_stage(stage, zcash):
+    print('Running stage %s' % stage)
+    print('=' * (len(stage) + 14))
+    print()
+
+    cmd = STAGE_COMMANDS[stage]
+    if cmd is not None:
+        ret = cmd(zcash)
+    else:
+        print('WARNING: stage not yet implemented, skipping')
+        ret = {}
+
+    print()
+    print('-' * (len(stage) + 15))
+    print('Finished stage %s' % stage)
+    print()
+
+    return ret
+
+
+#
+# Zcash wrapper
+#
+
+class ZcashNode(object):
+    def __init__(self, args, zcashd=None, zcash_cli=None):
+        if zcashd is None:
+            zcashd = os.getenv('ZCASHD', 'zcashd')
+        if zcash_cli is None:
+            zcash_cli = os.getenv('ZCASHCLI', 'zcash-cli')
+
+        self.__datadir = args.datadir
+        self.__wallet = args.wallet
+        self.__testnet = not args.mainnet
+        self.__zcashd = zcashd
+        self.__zcash_cli = zcash_cli
+        self.__process = None
+        self.__proxy = None
+
+        self.automated = args.automate
+        self.use_faucet = args.faucet
+
+    def start(self, extra_args=None, timewait=None):
+        if self.__proxy is not None:
+            raise RuntimeError('Already started')
+
+        rpcuser = 'st'
+        rpcpassword = 'st'
+
+        args = [
+            self.__zcashd,
+            '-datadir=%s' % self.__datadir,
+            '-wallet=%s' % self.__wallet,
+            '-rpcuser=%s' % rpcuser,
+            '-rpcpassword=%s' % rpcpassword,
+            '-showmetrics=0',
+            '-experimentalfeatures',
+            '-zmergetoaddress',
+            '-walletrequirebackup=false'
+        ]
+        if self.__testnet:
+            args.append('-testnet=1')
+        if extra_args is not None:
+            args.extend(extra_args)
+
+        self.__process = subprocess.Popen(args)
+
+        cli_args = [
+            self.__zcash_cli,
+            '-datadir=%s' % self.__datadir,
+            '-rpcuser=%s' % rpcuser,
+            '-rpcpassword=%s' % rpcpassword,
+            '-rpcwait',
+        ]
+        if self.__testnet:
+            cli_args.append('-testnet=1')
+        cli_args.append('getblockcount')
+
+        devnull = open('/dev/null', 'w+', encoding='utf8')
+        if os.getenv('PYTHON_DEBUG', ''):
+            print('start_node: zcashd started, calling zcash-cli -rpcwait getblockcount')
+        subprocess.check_call(cli_args, stdout=devnull)
+        if os.getenv('PYTHON_DEBUG', ''):
+            print('start_node: calling zcash-cli -rpcwait getblockcount returned')
+        devnull.close()
+
+        rpcuserpass = '%s:%s' % (rpcuser, rpcpassword)
+        rpchost = '127.0.0.1'
+        rpcport = 18232 if self.__testnet else 8232
+
+        url = 'http://%s@%s:%d' % (rpcuserpass, rpchost, rpcport)
+        if timewait is not None:
+            self.__proxy = Proxy(url, timeout=timewait)
+        else:
+            self.__proxy = Proxy(url)
+
+    def stop(self):
+        if self.__proxy is None:
+            raise RuntimeError('Not running')
+
+        self.__proxy.stop()
+        self.__process.wait()
+        self.__proxy = None
+        self.__process = None
+
+    def __getattr__(self, name):
+        if self.__proxy is None:
+            raise RuntimeError('Not running')
+
+        return self.__proxy.__getattr__(name)
+
+
+#
+# Test driver
+#
+
+def main():
+    parser = argparse.ArgumentParser()
+    parser.add_argument('--automate', action='store_true', help='Run the smoke tests without a user present')
+    parser.add_argument('--list-stages', dest='list', action='store_true')
+    parser.add_argument('--mainnet', action='store_true', help='Use mainnet instead of testnet')
+    parser.add_argument('--use-faucet', dest='faucet', action='store_true', help='Use testnet faucet as source of funds')
+    parser.add_argument('--wallet', default='wallet.dat', help='Wallet file to use (within data directory)')
+    parser.add_argument('datadir', help='Data directory to use for smoke testing', default=None)
+    parser.add_argument('stage', nargs='*', default=STAGES, help='One of %s' % STAGES)
+    args = parser.parse_args()
+
+    # Check for list
+    if args.list:
+        for s in STAGES:
+            print(s)
+        sys.exit(0)
+
+    # Check validity of stages
+    for s in args.stage:
+        if s not in STAGES:
+            print("Invalid stage '%s' (choose from %s)" % (s, STAGES))
+            sys.exit(1)
+
+    # Don't allow using the default wallet.dat in mainnet mode
+    if args.mainnet and args.wallet == 'wallet.dat':
+        print('Cannot use wallet.dat as wallet file when running mainnet tests. Keep your funds safe!')
+        sys.exit(1)
+
+    # Testnet faucet cannot be used in mainnet mode
+    if args.mainnet and args.faucet:
+        print('Cannot use testnet faucet when running mainnet tests.')
+        sys.exit(1)
+
+    # Enforce correctly-configured automatic mode
+    if args.automate:
+        if args.mainnet:
+            print('Cannot yet automate mainnet tests.')
+            sys.exit(1)
+        if not args.faucet:
+            print('--automate requires --use-faucet')
+            sys.exit(1)
+
+    # Start zcashd
+    zcash = ZcashNode(args)
+    print('Start time: %s' % TIME_STARTED)
+    print('Starting zcashd...')
+    zcash.start()
+    print()
+
+    # Run the stages
+    results = {}
+    for s in args.stage:
+        results.update(run_stage(s, zcash))
+
+    # Stop zcashd
+    print('Stopping zcashd...')
+    zcash.stop()
+
+    passed = True
+    print()
+    print('========================')
+    print('       Results')
+    print('========================')
+    print('Case | Expected | Actual')
+    print('========================')
+    for test_case in SMOKE_TESTS:
+        case = test_case[0]
+        expected = test_case[1 if args.mainnet else 2]
+        if case in results:
+            actual = results[case]
+            actual_str = '%s%s' % (
+                'Passed' if actual else 'Failed',
+                '' if expected == actual else '!!!'
+            )
+            passed &= (expected == actual)
+        else:
+            actual_str = ' N/A'
+        print('%s | %s | %s' % (
+            case.ljust(4),
+            ' Passed ' if expected else ' Failed ',
+            actual_str
+        ))
+
+    if not passed:
+        print()
+        print("!!! One or more smoke test stages failed !!!")
+        sys.exit(1)
+
+
+if __name__ == '__main__':
+    main()
diff --git a/depend/zcash/qa/zcash/test-depends-sources-mirror.py b/depend/zcash/qa/zcash/test-depends-sources-mirror.py
new file mode 100755
index 000000000..d83cca1f1
--- /dev/null
+++ b/depend/zcash/qa/zcash/test-depends-sources-mirror.py
@@ -0,0 +1,43 @@
+#!/usr/bin/env python3
+
+# This script tests that the package mirror at https://download.z.cash/depends-sources/
+# contains all of the packages required to build this version of Zcash.
+#
+# This script assumes you've just built Zcash, and that as a result of that
+# build, all of the dependency packages have been downloaded into the
+# depends/sources directory (inside the root of this repository). The script
+# checks that all of those files are accessible on the mirror.
+
+import sys
+import os
+import requests
+
+MIRROR_URL_DIR="https://download.z.cash/depends-sources/"
+DEPENDS_SOURCES_DIR=os.path.realpath(os.path.join(
+    os.path.dirname(__file__),
+    "..", "..", "depends", "sources"
+))
+
+def get_depends_sources_list():
+    return filter(
+	lambda f: os.path.isfile(os.path.join(DEPENDS_SOURCES_DIR, f)),
+	os.listdir(DEPENDS_SOURCES_DIR)
+    )
+
+for filename in get_depends_sources_list():
+    resp = requests.head(MIRROR_URL_DIR + filename)
+
+    print("Checking [" + filename + "] ...")
+
+    if resp.status_code != 200:
+	    print("FAIL. File not found on server: ", filename)
+	    sys.exit(1)
+
+    expected_size = os.path.getsize(os.path.join(DEPENDS_SOURCES_DIR, filename))
+    server_size = int(resp.headers['Content-Length'])
+    if expected_size != server_size:
+        print("FAIL. On the server, %s is %d bytes, but locally it is %d bytes." % (filename, server_size, expected_size))
+        sys.exit(1)
+
+print("PASS.")
+sys.exit(0)
diff --git a/depend/zcash/qa/zcash/updatecheck.py b/depend/zcash/qa/zcash/updatecheck.py
new file mode 100755
index 000000000..ba0d79a30
--- /dev/null
+++ b/depend/zcash/qa/zcash/updatecheck.py
@@ -0,0 +1,414 @@
+#!/usr/bin/env python3
+#
+# This script checks for updates to zcashd's dependencies.
+#
+# The SOURCE_ROOT constant specifies the location of the zcashd codebase to
+# check, and the GITHUB_API_* constants specify a personal access token for the
+# GitHub API, which need not have any special privileges.
+#
+# All dependencies must be specified inside the get_dependency_list() function
+# below. A dependency is specified by:
+#
+#   (a) A way to fetch a list of current releases.
+#
+#       This is usually regular-expression-based parsing of GitHub tags, but
+#       might otherwise parse version numbers out of the project's webpage.
+#
+#	GitHub tag regexps can be tested by specifying test cases in the third
+#	argument to GithubTagReleaseLister's constructor.
+#
+#   (b) A way to fetch the currently-used version out of the source tree.
+#
+#	This is typically parsed out of the depends/packages/*.mk files.
+#
+# If any dependency is found to be out-of-date, or there are un-accounted-for
+# .mk files in depends/packages, this script will exit with
+# a nonzero status. The latter case would suggest someone added a new dependency
+# without adding a corresponding entry to get_dependency_list() below.
+#
+# To test the script itself, run it with --functionality-test as the only
+# argument. This will exercise the full functionality of the script, but will
+# only return a non-zero exit status when there's something wrong with the
+# script itself, for example if a new file was added to depends/packages/ but
+# wasn't added to this script.
+
+import requests
+import os
+import re
+import sys
+import datetime
+
+SOURCE_ROOT = os.path.join(os.path.dirname(os.path.realpath(__file__)), "..", "..")
+
+def get_dependency_list():
+    dependencies = [
+        Dependency("bdb",
+            BerkeleyDbReleaseLister(),
+            DependsVersionGetter("bdb")),
+        Dependency("boost",
+            GithubTagReleaseLister("boostorg", "boost", "^boost-(\d+)\.(\d+)\.(\d+)$",
+                { "boost-1.69.0": (1, 69, 0), "boost-1.69.0-beta1": None }),
+            DependsVersionGetter("boost")),
+        Dependency("googletest",
+            GithubTagReleaseLister("google", "googletest", "^release-(\d+)\.(\d+)\.(\d+)$",
+                { "release-1.8.1": (1, 8, 1) }),
+            DependsVersionGetter("googletest")),
+        # libc++ matches the Clang version
+        Dependency("libcxx",
+            GithubTagReleaseLister("llvm", "llvm-project", "^llvmorg-(\d+)\.(\d+).(\d+)$",
+                { "llvmorg-11.0.0": (11, 0, 0), "llvmorg-9.0.1-rc3": None}),
+            DependsVersionGetter("native_clang")),
+        Dependency("libevent",
+            GithubTagReleaseLister("libevent", "libevent", "^release-(\d+)\.(\d+)\.(\d+)-stable$",
+                { "release-2.0.22-stable": (2, 0, 22), "release-2.1.9-beta": None }),
+            DependsVersionGetter("libevent")),
+        Dependency("libsodium",
+            GithubTagReleaseLister("jedisct1", "libsodium", "^(\d+)\.(\d+)\.(\d+)$",
+                { "1.0.17": (1, 0, 17) }),
+            DependsVersionGetter("libsodium")),
+        # b2 matches the Boost version
+        Dependency("native_b2",
+            GithubTagReleaseLister("boostorg", "boost", "^boost-(\d+)\.(\d+)\.(\d+)$",
+                { "boost-1.69.0": (1, 69, 0), "boost-1.69.0-beta1": None }),
+            DependsVersionGetter("boost")),
+        Dependency("native_ccache",
+            GithubTagReleaseLister("ccache", "ccache", "^v?(\d+)\.(\d+)(?:\.(\d+))?$",
+                { "v3.5.1": (3, 5, 1), "v3.6": (3, 6)}),
+            DependsVersionGetter("native_ccache")),
+        Dependency("native_clang",
+            GithubTagReleaseLister("llvm", "llvm-project", "^llvmorg-(\d+)\.(\d+).(\d+)$",
+                { "llvmorg-11.0.0": (11, 0, 0), "llvmorg-9.0.1-rc3": None}),
+            DependsVersionGetter("native_clang")),
+        Dependency("native_rust",
+            GithubTagReleaseLister("rust-lang", "rust", "^(\d+)\.(\d+)(?:\.(\d+))?$",
+                { "1.33.0": (1, 33, 0), "0.9": (0, 9) }),
+            DependsVersionGetter("native_rust")),
+        Dependency("zeromq",
+            GithubTagReleaseLister("zeromq", "libzmq", "^v(\d+)\.(\d+)(?:\.(\d+))?$",
+                { "v4.3.1": (4, 3, 1), "v4.2.0-rc1": None }),
+            DependsVersionGetter("zeromq")),
+        Dependency("leveldb",
+            GithubTagReleaseLister("google", "leveldb", "^v(\d+)\.(\d+)$",
+                { "v1.13": (1, 13) }),
+            LevelDbVersionGetter()),
+        Dependency("univalue",
+            GithubTagReleaseLister("bitcoin-core", "univalue", "^v(\d+)\.(\d+)\.(\d+)$",
+                { "v1.0.1": (1, 0, 1) }),
+            UnivalueVersionGetter()),
+        Dependency("utfcpp",
+            GithubTagReleaseLister("nemtrif", "utfcpp", "^v(\d+)\.(\d+)(?:\.(\d+))?$",
+                { "v3.1": (3, 1), "v3.0.3": (3, 0, 3) }),
+            DependsVersionGetter("utfcpp"))
+    ]
+
+    return dependencies
+
+class GitHubToken:
+    def __init__(self):
+        token_path = os.path.join(SOURCE_ROOT, ".updatecheck-token")
+        try:
+            with open(token_path, encoding='utf8') as f:
+                token = f.read().strip()
+                self._user = token.split(":")[0]
+                self._password = token.split(":")[1]
+        except:
+            print("Please make sure a GitHub API token is in .updatecheck-token in the root of this repository.")
+            print("The format is username:hex-token.")
+            sys.exit(1)
+
+    def user(self):
+        return self.user
+
+    def password(self):
+        return self.password
+
+class Version(list):
+    def __init__(self, version_tuple):
+        for part in version_tuple:
+            if part: # skip None's which can come from optional regexp groups
+                if str(part).isdigit():
+                    self.append(int(part))
+                else:
+                    self.append(part)
+
+    def __str__(self):
+        return '.'.join(map(str, self))
+
+    def __hash__(self):
+        return hash(tuple(self))
+
+class Dependency:
+    def __init__(self, name, release_lister, current_getter):
+        self.name = name
+        self.release_lister = release_lister
+        self.current_getter = current_getter
+        self.cached_known_releases = None
+
+    def current_version(self):
+        return self.current_getter.current_version()
+
+    def known_releases(self):
+        if self.cached_known_releases is None:
+            self.cached_known_releases = sorted(self.release_lister.known_releases())
+        return self.cached_known_releases
+
+    def released_versions_after_current_version(self):
+        current_version = self.current_version()
+        releases_after_current = []
+
+        for release in self.known_releases():
+            if release > current_version:
+                releases_after_current.append(release)
+
+        return releases_after_current
+
+    def is_up_to_date(self):
+        return len(self.released_versions_after_current_version()) == 0
+
+class GithubTagReleaseLister:
+    def __init__(self, org, repo, regex, testcases={}):
+        self.org = org
+        self.repo = repo
+        self.regex = regex
+        self.testcases = testcases
+        self.token = GitHubToken()
+
+        for tag, expected in testcases.items():
+            match = re.match(self.regex, tag)
+            if (expected and not match) or (match and not expected) or (match and Version(match.groups()) != list(expected)):
+                groups = str(match.groups())
+                raise RuntimeError("GitHub tag regex test case [" + tag + "] failed, got [" + groups + "].")
+
+    def known_releases(self):
+        release_versions = []
+        all_tags = self.all_tag_names()
+
+        # sanity check against the test cases
+        for tag, expected in self.testcases.items():
+            if tag not in all_tags:
+                raise RuntimeError("Didn't find expected tag [" + tag + "].")
+
+        for tag_name in all_tags:
+            match = re.match(self.regex, tag_name)
+            if match:
+                release_versions.append(Version(match.groups()))
+
+        return release_versions
+
+    def all_tag_names(self):
+        url = "https://api.github.com/repos/" + safe(self.org) + "/" + safe(self.repo) + "/git/refs/tags"
+        r = requests.get(url, auth=requests.auth.HTTPBasicAuth(self.token.user(), self.token.password()))
+        if r.status_code != 200:
+            print("API request failed (error %d)" % (r.status_code,), file=sys.stderr)
+            print(r.text, file=sys.stderr)
+            raise RuntimeError("Request to GitHub tag API failed.")
+        json = r.json()
+        return list(map(lambda t: t["ref"].split("/")[-1], json))
+
+class BerkeleyDbReleaseLister:
+    def known_releases(self):
+        url = "https://www.oracle.com/database/technologies/related/berkeleydb-downloads.html"
+        r = requests.get(url)
+        if r.status_code != 200:
+            print("API request failed (error %d)" % (r.status_code,), file=sys.stderr)
+            print(r.text, file=sys.stderr)
+            raise RuntimeError("Request to Berkeley DB download directory failed.")
+        page = r.text
+
+        # We use a set because the search will result in duplicates.
+        release_versions = set()
+        for match in re.findall("berkeleydb/html/changelog_(\d+)_(\d+)_(\d+).html", page):
+            release_versions.add(Version(match))
+
+        if len(release_versions) == 0:
+            raise RuntimeError("Missing expected version from Oracle web page.")
+
+        return list(release_versions)
+
+class DependsVersionGetter:
+    def __init__(self, name):
+        self.name = name
+
+    def current_version(self):
+        mk_file_path = os.path.join(SOURCE_ROOT, "depends", "packages", safe_depends(self.name) + ".mk")
+        mk_file = open(mk_file_path, 'r', encoding='utf8').read()
+
+        regexp_whitelist = [
+            "package\)_version=(\d+)\.(\d+)\.(\d+)$",
+            "package\)_version=(\d+)\.(\d+)$",
+            "package\)_version=(\d+)_(\d+)_(\d+)$",
+            "package\)_version=(\d+)\.(\d+)\.(\d+)([a-z])$",
+            # Workaround for wasi 0.9.0 preview
+            "package\)_version=(\d+)\.(\d+)\.(\d+)\+wasi-snapshot-preview1$",
+        ]
+
+        current_version = None
+
+        for regexp in regexp_whitelist:
+            match = re.search(regexp, mk_file, re.MULTILINE)
+            if match:
+                current_version = Version(match.groups())
+
+        if not current_version:
+            raise RuntimeError("Couldn't parse version number from depends .mk file.")
+
+        return current_version
+
+class LevelDbVersionGetter:
+    def current_version(self):
+        header_path = os.path.join(SOURCE_ROOT, "src", "leveldb", "include", "leveldb", "db.h")
+        header_contents = open(header_path, 'r', encoding='utf8').read()
+
+        match = re.search("kMajorVersion\s*=\s*(\d+);\s*.*kMinorVersion\s*=\s*(\d+);\s*$", header_contents, re.MULTILINE)
+        if match:
+            return Version(match.groups())
+        else:
+            raise RuntimeError("Couldn't parse LevelDB's version from db.h")
+
+class UnivalueVersionGetter:
+    def current_version(self):
+        configure_path = os.path.join(SOURCE_ROOT, "src", "univalue", "configure.ac")
+        configure_contents = open(configure_path, 'r', encoding='utf8').read()
+
+        match = re.search("AC_INIT.*univalue.*\[(\d+)\.(\d+)\.(\d+)\]", configure_contents)
+        if match:
+            return Version(match.groups())
+        else:
+            raise RuntimeError("Couldn't parse univalue's version from its configure.ac")
+
+class PostponedUpdates():
+    def __init__(self):
+        self.postponedlist = dict()
+
+        postponedlist_path = os.path.join(
+            os.path.dirname(__file__),
+            "postponed-updates.txt"
+        )
+
+        file = open(postponedlist_path, 'r', encoding='utf8')
+        for line in file.readlines():
+            stripped = re.sub('#.*$', '', line).strip()
+            if stripped != "":
+                match = re.match('^(\S+)\s+(\S+)\s+(\S+)$', stripped)
+                if match:
+                    postponed_name = match.groups()[0]
+                    postponed_version = Version(match.groups()[1].split("."))
+                    postpone_expiration = datetime.datetime.strptime(match.groups()[2], '%Y-%m-%d')
+                    if datetime.datetime.utcnow() < postpone_expiration:
+                        self.postponedlist[(postponed_name, str(postponed_version))] = True
+                else:
+                    raise RuntimeError("Could not parse line in postponed-updates.txt:" + line)
+
+
+    def is_postponed(self, name, version):
+        return (name, str(version)) in self.postponedlist
+
+def safe(string):
+    if re.match('^[a-zA-Z0-9_-]*$', string):
+        return string
+    else:
+        raise RuntimeError("Potentially-dangerous string encountered.")
+
+def safe_depends(string):
+    if re.match('^[a-zA-Z0-9._-]*$', string):
+        return string
+    else:
+        raise RuntimeError("Potentially-dangerous string encountered.")
+
+def print_row(name, status, current_version, known_versions):
+    COL_FMT_LARGE = "{:<35}"
+    COL_FMT_SMALL = "{:<18}"
+    print(COL_FMT_LARGE.format(name) +
+            COL_FMT_SMALL.format(status) +
+            COL_FMT_SMALL.format(current_version) +
+            COL_FMT_SMALL.format(known_versions))
+
+def main():
+    # Get a list of all depends-system dependencies so we can verify that we're
+    # checking them all for updates.
+    unchecked_dependencies = [f[:-3] for f in os.listdir(os.path.join(SOURCE_ROOT, "depends", "packages")) if f.endswith(".mk")]
+
+    untracked = [
+        # packages.mk is not a dependency, it just specifies the list of them all.
+        "packages",
+        # This package doesn't have conventional version numbers
+        "native_cctools",
+        # This package is pinned specifically for Arch.
+        "native_libtinfo",
+    ]
+
+    print_row("NAME", "STATUS", "CURRENT VERSION", "NEWER VERSIONS")
+
+    status = 0
+    for dep in untracked:
+        print_row(dep, "skipped", "", "")
+        if dep in unchecked_dependencies:
+            unchecked_dependencies.remove(dep)
+        else:
+            print("Error: Please remove " + dep + " from the list of unchecked dependencies.")
+            status = 3
+
+    # Exit early so the problem is clear from the output.
+    if status != 0:
+        sys.exit(status)
+
+    deps = get_dependency_list()
+    postponed = PostponedUpdates()
+    for dependency in deps:
+        if dependency.name in unchecked_dependencies:
+            unchecked_dependencies.remove(dependency.name)
+        if dependency.is_up_to_date():
+            print_row(
+                dependency.name,
+                "up to date",
+                str(dependency.current_version()),
+                "")
+        else:
+            # The status can either be POSTPONED or OUT OF DATE depending
+            # on whether or not all the new versions are whitelisted.
+            status_text = "POSTPONED"
+            newver_list = "["
+            for newver in dependency.released_versions_after_current_version():
+                if postponed.is_postponed(dependency.name, newver):
+                    newver_list += str(newver) + " (postponed),"
+                else:
+                    newver_list += str(newver) + ","
+                    status_text = "OUT OF DATE"
+                    status = 1
+
+            newver_list = newver_list[:-1] + "]"
+
+            print_row(
+                dependency.name,
+                status_text,
+                str(dependency.current_version()),
+                newver_list
+            )
+
+    if len(unchecked_dependencies) > 0:
+        unchecked_dependencies.sort()
+        print("WARNING: The following dependencies are not being checked for updates by this script: " + ', '.join(unchecked_dependencies))
+        sys.exit(2)
+
+    if len(sys.argv) == 2 and sys.argv[1] == "--functionality-test":
+        print("We're only testing this script's functionality. The exit status will only be nonzero if there's a problem with the script itself.")
+        sys.exit(0)
+
+    if status == 0:
+        print("All non-Rust dependencies are up-to-date or postponed.")
+    elif status == 1:
+        print("Release is BLOCKED. There are new dependency updates that have not been postponed.")
+
+    print("""
+You should also check the Rust dependencies using cargo:
+
+  cargo install cargo-outdated cargo-audit
+  cargo outdated
+  cargo audit
+""")
+    if status == 0:
+        print("After checking those, you'll be ready for release! :-)")
+
+    sys.exit(status)
+
+main()
diff --git a/depend/zcash/rust-toolchain b/depend/zcash/rust-toolchain
new file mode 100644
index 000000000..bb120e876
--- /dev/null
+++ b/depend/zcash/rust-toolchain
@@ -0,0 +1 @@
+1.59.0
diff --git a/depend/zcash/share/genbuild.sh b/depend/zcash/share/genbuild.sh
new file mode 100755
index 000000000..6d35faa97
--- /dev/null
+++ b/depend/zcash/share/genbuild.sh
@@ -0,0 +1,58 @@
+#!/bin/sh
+# Copyright (c) 2016-2019 The Zcash developers
+# Copyright (c) 2012-2019 The Bitcoin Core developers
+# Copyright (c) 2012-2019 Bitcoin Developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+export LC_ALL=C
+if [ $# -gt 1 ]; then
+    cd "$2" || exit 1
+fi
+if [ $# -gt 0 ]; then
+    FILE="$1"
+    shift
+    if [ -f "$FILE" ]; then
+        INFO="$(head -n 1 "$FILE")"
+    fi
+else
+    echo "Usage: $0 <filename> <srcroot>"
+    exit 1
+fi
+
+DESC=""
+SUFFIX=""
+LAST_COMMIT_DATE=""
+if [ -e "$(which git 2>/dev/null)" -a "$(git rev-parse --is-inside-work-tree 2>/dev/null)" = "true" ]; then
+    # clean 'dirty' status of touched files that haven't been modified
+    git diff >/dev/null 2>/dev/null
+
+    # if latest commit is tagged and not dirty, then override using the tag name
+    RAWDESC=$(git describe --abbrev=0 2>/dev/null)
+    if [ "$(git rev-parse HEAD)" = "$(git rev-list -1 $RAWDESC 2>/dev/null)" ]; then
+        git diff-index --quiet HEAD -- && DESC=$RAWDESC
+    fi
+
+    # otherwise generate suffix from git, i.e. string like "59887e8-dirty"
+    SUFFIX=$(git rev-parse --short HEAD)
+    git diff-index --quiet HEAD -- || SUFFIX="$SUFFIX-dirty"
+
+    # get a string like "2012-04-10 16:27:19 +0200"
+    LAST_COMMIT_DATE="$(git log -n 1 --format="%ci")"
+fi
+
+if [ -n "$DESC" ]; then
+    NEWINFO="#define BUILD_DESC \"$DESC\""
+elif [ -n "$SUFFIX" ]; then
+    NEWINFO="#define BUILD_SUFFIX $SUFFIX"
+else
+    NEWINFO="// No build information available"
+fi
+
+# only update build.h if necessary
+if [ "$INFO" != "$NEWINFO" ]; then
+    echo "$NEWINFO" >"$FILE"
+    if [ -n "$LAST_COMMIT_DATE" ]; then
+        echo "#define BUILD_DATE \"$LAST_COMMIT_DATE\"" >> "$FILE"
+    fi
+fi
diff --git a/depend/zcash/share/rpcuser/README.md b/depend/zcash/share/rpcuser/README.md
new file mode 100644
index 000000000..12a8e6fb0
--- /dev/null
+++ b/depend/zcash/share/rpcuser/README.md
@@ -0,0 +1,10 @@
+RPC Tools
+---------------------
+
+### [RPCUser](/share/rpcuser) ###
+
+Create an RPC user login credential.
+
+Usage:
+
+    ./rpcuser.py <username>
diff --git a/depend/zcash/share/rpcuser/rpcuser.py b/depend/zcash/share/rpcuser/rpcuser.py
new file mode 100755
index 000000000..a57508c92
--- /dev/null
+++ b/depend/zcash/share/rpcuser/rpcuser.py
@@ -0,0 +1,41 @@
+#!/usr/bin/env python2 
+# Copyright (c) 2015 The Bitcoin Core developers 
+# Distributed under the MIT software license, see the accompanying 
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+import hashlib
+import sys
+import os
+from random import SystemRandom
+import base64
+import hmac
+
+if len(sys.argv) < 2:
+    sys.stderr.write('Please include username as an argument.\n')
+    sys.exit(0)
+
+username = sys.argv[1]
+
+#This uses os.urandom() underneath
+cryptogen = SystemRandom()
+
+#Create 16 byte hex salt
+salt_sequence = [cryptogen.randrange(256) for i in range(16)]
+hexseq = list(map(hex, salt_sequence))
+salt = "".join([x[2:] for x in hexseq])
+
+#Create 32 byte b64 password
+password = base64.urlsafe_b64encode(os.urandom(32))
+
+digestmod = hashlib.sha256
+
+if sys.version_info.major >= 3:
+    password = password.decode('utf-8')
+    digestmod = 'SHA256'
+ 
+m = hmac.new(bytearray(salt, 'utf-8'), bytearray(password, 'utf-8'), digestmod)
+result = m.hexdigest()
+
+print("String to be appended to zcash.conf:")
+print("rpcauth="+username+":"+salt+"$"+result)
+print("Your password:\n"+password)
diff --git a/depend/zcash/src/.clang-format b/depend/zcash/src/.clang-format
new file mode 100644
index 000000000..401a4272e
--- /dev/null
+++ b/depend/zcash/src/.clang-format
@@ -0,0 +1,50 @@
+AccessModifierOffset: -4
+AlignEscapedNewlinesLeft: true
+AlignTrailingComments: true
+AllowAllParametersOfDeclarationOnNextLine: false
+AllowShortBlocksOnASingleLine: false
+AllowShortFunctionsOnASingleLine: All
+AllowShortIfStatementsOnASingleLine: false
+AllowShortLoopsOnASingleLine: false
+AlwaysBreakBeforeMultilineStrings: false
+AlwaysBreakTemplateDeclarations: true
+BinPackParameters: false
+BreakBeforeBinaryOperators: false
+BreakBeforeBraces: Linux
+BreakBeforeTernaryOperators: false
+BreakConstructorInitializersBeforeComma: false
+ColumnLimit:     0
+CommentPragmas:  '^ IWYU pragma:'
+ConstructorInitializerAllOnOneLineOrOnePerLine: false
+ConstructorInitializerIndentWidth: 4
+ContinuationIndentWidth: 4
+Cpp11BracedListStyle: true
+DerivePointerAlignment: false
+DisableFormat:   false
+IndentCaseLabels: false
+IndentFunctionDeclarationAfterType: false
+IndentWidth:     4
+KeepEmptyLinesAtTheStartOfBlocks: false
+Language:        Cpp
+MaxEmptyLinesToKeep: 2
+NamespaceIndentation: None
+ObjCSpaceAfterProperty: false
+ObjCSpaceBeforeProtocolList: false
+PenaltyBreakBeforeFirstCallParameter: 1
+PenaltyBreakComment: 300
+PenaltyBreakFirstLessLess: 120
+PenaltyBreakString: 1000
+PenaltyExcessCharacter: 1000000
+PenaltyReturnTypeOnItsOwnLine: 200
+PointerAlignment: Left
+SpaceBeforeAssignmentOperators: true
+SpaceBeforeParens: ControlStatements
+SpaceInEmptyParentheses: false
+SpacesBeforeTrailingComments: 1
+SpacesInAngles:  false
+SpacesInContainerLiterals: true
+SpacesInCStyleCastParentheses: false
+SpacesInParentheses: false
+Standard:        Cpp11
+TabWidth:        8
+UseTab:          Never
diff --git a/depend/zcash/src/Makefile.am b/depend/zcash/src/Makefile.am
new file mode 100644
index 000000000..efeb9f0f3
--- /dev/null
+++ b/depend/zcash/src/Makefile.am
@@ -0,0 +1,670 @@
+# Copyright (c) 2016-2019 The Zcash developers
+# Copyright (c) 2013-2019 The Bitcoin Core developers
+# Copyright (c) 2013-2019 Bitcoin Developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+DIST_SUBDIRS = secp256k1 univalue
+
+AM_LDFLAGS = $(PTHREAD_CFLAGS) $(LIBTOOL_LDFLAGS) $(HARDENED_LDFLAGS) $(GPROF_LDFLAGS) $(SANITIZER_LDFLAGS)
+AM_CXXFLAGS = $(DEBUG_CXXFLAGS) $(HARDENED_CXXFLAGS) $(ERROR_CXXFLAGS) $(GPROF_CXXFLAGS) $(SANITIZER_CXXFLAGS)
+AM_CPPFLAGS = $(DEBUG_CPPFLAGS) $(HARDENED_CPPFLAGS)
+EXTRA_LIBRARIES =
+
+BITCOIN_CONFIG_INCLUDES=-I$(builddir)/config
+BITCOIN_INCLUDES=-I$(builddir) -I$(builddir)/obj $(BDB_CPPFLAGS) $(BOOST_CPPFLAGS) $(LEVELDB_CPPFLAGS)
+
+BITCOIN_CONFIG_INCLUDES += -I$(srcdir)/rust/include
+BITCOIN_INCLUDES += -I$(srcdir)/rust/include
+BITCOIN_INCLUDES += -I$(srcdir)/secp256k1/include
+BITCOIN_INCLUDES += -I$(srcdir)/univalue/include
+
+LIBBITCOIN_SERVER=libbitcoin_server.a
+LIBBITCOIN_COMMON=libbitcoin_common.a
+LIBBITCOIN_CLI=libbitcoin_cli.a
+LIBBITCOIN_UTIL=libbitcoin_util.a
+LIBBITCOIN_CRYPTO=crypto/libbitcoin_crypto.a
+LIBRUSTZCASH=$(top_builddir)/target/$(RUST_TARGET)/release/librustzcash.a
+LIBSECP256K1=secp256k1/libsecp256k1.la
+LIBUNIVALUE=univalue/libunivalue.la
+LIBZCASH=libzcash.a
+
+WALLET_TOOL_BIN=zcashd-wallet-tool$(EXEEXT)
+WALLET_TOOL_BUILD=$(top_builddir)/target/$(RUST_TARGET)/release/zcashd-wallet-tool$(EXEEXT)
+
+if ENABLE_ZMQ
+LIBBITCOIN_ZMQ=libbitcoin_zmq.a
+endif
+if BUILD_BITCOIN_LIBS
+LIBZCASH_SCRIPT=libzcash_script.la
+endif
+if ENABLE_WALLET
+LIBBITCOIN_WALLET=libbitcoin_wallet.a
+endif
+
+# We depend on the secp256k1 crate for some logic on the Rust side of the FFI. This crate
+# is a wrapper around libsecp256k1, which we already vendor in our code; the crate vendors
+# its own copy with non-colliding symbols. To ensure that we only use a single version of
+# libsecp256k1, we disable symbol renaming in the secp256k1-sys crate  so it links to the
+# same library as the C++ code.
+# - Note that this does not prevent the secp256k1-sys vendored code from being built; this
+#   requires https://github.com/rust-bitcoin/rust-secp256k1/issues/380 to be addressed.
+RUST_ENV_VARS = RUSTC="$(RUSTC)" TERM=dumb RUSTFLAGS="--cfg=rust_secp_no_symbol_renaming"
+RUST_BUILD_OPTS = --release --target $(RUST_TARGET) --manifest-path $(top_srcdir)/Cargo.toml
+
+rust_verbose = $(rust_verbose_@AM_V@)
+rust_verbose_ = $(rust_verbose_@AM_DEFAULT_V@)
+rust_verbose_1 = --verbose
+
+if ENABLE_ONLINE_RUST
+# Ensure that .cargo/config does not exist
+CARGO_CONFIGURED = $(top_srcdir)/.cargo/.configured-for-online
+$(CARGO_CONFIGURED):
+	$(AM_V_at)rm -f $(top_srcdir)/.cargo/.configured-for-offline $(top_srcdir)/.cargo/config
+	$(AM_V_at)touch $@
+
+else
+# Enable dependency vendoring
+RUST_BUILD_OPTS += --locked --offline
+
+CARGO_CONFIGURED = $(top_srcdir)/.cargo/.configured-for-offline
+$(CARGO_CONFIGURED): $(top_srcdir)/.cargo/config.offline
+	$(AM_V_at)rm -f $(top_srcdir)/.cargo/.configured-for-online
+	$(AM_V_at)cp $< $(top_srcdir)/.cargo/config
+	$(AM_V_at)echo "directory = \"$(RUST_VENDORED_SOURCES)\"" >>$(top_srcdir)/.cargo/config
+	$(AM_V_at)touch $@
+endif
+
+cargo-build-lib: $(CARGO_CONFIGURED)
+	$(RUST_ENV_VARS) $(CARGO) build --lib $(RUST_BUILD_OPTS) $(rust_verbose)
+
+cargo-build-bins: $(CARGO_CONFIGURED)
+	$(RUST_ENV_VARS) $(CARGO) build --bins $(RUST_BUILD_OPTS) $(rust_verbose)
+
+$(WALLET_TOOL_BIN): cargo-build-bins
+	$(AM_V_at)cp $(WALLET_TOOL_BUILD) $@
+
+$(LIBRUSTZCASH): cargo-build-lib
+
+$(LIBSECP256K1): $(wildcard secp256k1/src/*) $(wildcard secp256k1/include/*)
+	$(AM_V_at)$(MAKE) $(AM_MAKEFLAGS) -C $(@D) $(@F)
+
+$(LIBUNIVALUE): $(wildcard univalue/lib/*) $(wildcard univalue/include/*)
+	$(AM_V_at)$(MAKE) $(AM_MAKEFLAGS) -C $(@D) $(@F)
+
+# Make is not made aware of per-object dependencies to avoid limiting building parallelization
+# But to build the less dependent modules first, we manually select their order here:
+EXTRA_LIBRARIES += \
+  $(LIBBITCOIN_CRYPTO) \
+  $(LIBBITCOIN_UTIL) \
+  $(LIBBITCOIN_COMMON) \
+  $(LIBBITCOIN_SERVER) \
+  $(LIBBITCOIN_CLI) \
+  $(LIBBITCOIN_WALLET) \
+  $(LIBBITCOIN_ZMQ) \
+  $(LIBZCASH)
+
+lib_LTLIBRARIES = $(LIBZCASH_SCRIPT)
+
+bin_PROGRAMS =
+noinst_PROGRAMS =
+bin_SCRIPTS =
+TESTS =
+BENCHMARKS =
+
+if BUILD_BITCOIND
+  bin_PROGRAMS += zcashd
+endif
+
+if BUILD_BITCOIN_UTILS
+  bin_PROGRAMS += zcash-cli zcash-tx
+  bin_SCRIPTS += $(WALLET_TOOL_BIN)
+endif
+
+LIBZCASH_H = \
+  zcash/IncrementalMerkleTree.hpp \
+  zcash/NoteEncryption.hpp \
+  zcash/Address.hpp \
+  zcash/address/transparent.h \
+  zcash/address/mnemonic.h \
+  zcash/address/orchard.hpp \
+  zcash/address/sapling.hpp \
+  zcash/address/sprout.hpp \
+  zcash/address/unified.h \
+  zcash/address/zip32.h \
+  zcash/History.hpp \
+  zcash/JoinSplit.hpp \
+  zcash/Note.hpp \
+  zcash/prf.h \
+  zcash/Proof.hpp \
+  zcash/util.h \
+  zcash/Zcash.h
+
+.PHONY: FORCE cargo-build-lib cargo-build-bins check-symbols check-security
+# bitcoin core #
+BITCOIN_CORE_H = \
+  addrdb.h \
+  addressindex.h \
+  addrman.h \
+  alert.h \
+  amount.h \
+  arith_uint256.h \
+  asyncrpcoperation.h \
+  asyncrpcqueue.h \
+  base58.h \
+  bech32.h \
+  bloom.h \
+  chain.h \
+  chainparams.h \
+  chainparamsbase.h \
+  chainparamsseeds.h \
+  checkpoints.h \
+  checkqueue.h \
+  clientversion.h \
+  coincontrol.h \
+  coins.h \
+  compat.h \
+  compat/byteswap.h \
+  compat/endian.h \
+  compat/sanity.h \
+  compressor.h \
+  consensus/consensus.h \
+  consensus/funding.h \
+  consensus/params.h \
+  consensus/upgrades.h \
+  consensus/validation.h \
+  core_io.h \
+  core_memusage.h \
+  deprecation.h \
+  experimental_features.h \
+  fs.h \
+  hash.h \
+  httprpc.h \
+  httpserver.h \
+  init.h \
+  key.h \
+  key_constants.h \
+  key_io.h \
+  keystore.h \
+  dbwrapper.h \
+  limitedmap.h \
+  logging.h \
+  main.h \
+  memusage.h \
+  merkleblock.h \
+  metrics.h \
+  miner.h \
+  net.h \
+  netbase.h \
+  noui.h \
+  policy/fees.h \
+  policy/policy.h \
+  pow.h \
+  prevector.h \
+  primitives/block.h \
+  primitives/orchard.h \
+  primitives/transaction.h \
+  proof_verifier.h \
+  protocol.h \
+  pubkey.h \
+  random.h \
+  reverse_iterator.h \
+  reverselock.h \
+  rpc/client.h \
+  rpc/protocol.h \
+  rpc/server.h \
+  rpc/register.h \
+  scheduler.h \
+  script/interpreter.h \
+  script/script.h \
+  script/script_error.h \
+  script/sigcache.h \
+  script/sign.h \
+  script/standard.h \
+  script/ismine.h \
+  serialize.h \
+  spentindex.h \
+  streams.h \
+  support/allocators/secure.h \
+  support/allocators/zeroafterfree.h \
+  support/cleanse.h \
+  support/events.h \
+  support/lockedpool.h \
+  sync.h \
+  threadsafety.h \
+  timedata.h \
+  timestampindex.h \
+  tinyformat.h \
+  torcontrol.h \
+  transaction_builder.h \
+  txdb.h \
+  mempool_limit.h \
+  txmempool.h \
+  ui_interface.h \
+  uint256.h \
+  uint252.h \
+  undo.h \
+  util.h \
+  util/match.h \
+  utilmoneystr.h \
+  utilstrencodings.h \
+  utiltest.h \
+  utiltime.h \
+  validationinterface.h \
+  version.h \
+  wallet/asyncrpcoperation_common.h \
+  wallet/asyncrpcoperation_mergetoaddress.h \
+  wallet/asyncrpcoperation_saplingmigration.h \
+  wallet/asyncrpcoperation_sendmany.h \
+  wallet/asyncrpcoperation_shieldcoinbase.h \
+  wallet/crypter.h \
+  wallet/db.h \
+  wallet/orchard.h \
+  wallet/paymentdisclosure.h \
+  wallet/paymentdisclosuredb.h \
+  wallet/rpcwallet.h \
+  wallet/wallet.h \
+  wallet/walletdb.h \
+  warnings.h \
+  zmq/zmqabstractnotifier.h \
+  zmq/zmqconfig.h\
+  zmq/zmqnotificationinterface.h \
+  zmq/zmqpublishnotifier.h
+
+
+obj/build.h: FORCE
+	@$(MKDIR_P) $(builddir)/obj
+	@$(top_srcdir)/share/genbuild.sh $(abs_top_builddir)/src/obj/build.h \
+	  $(abs_top_srcdir)
+libbitcoin_util_a-clientversion.$(OBJEXT): obj/build.h
+
+# server: zcashd
+libbitcoin_server_a_CPPFLAGS = $(AM_CPPFLAGS) $(BITCOIN_INCLUDES) $(EVENT_CFLAGS) $(EVENT_PTHREADS_CFLAGS)
+libbitcoin_server_a_CXXFLAGS = $(AM_CXXFLAGS) $(PIE_FLAGS)
+libbitcoin_server_a_SOURCES = \
+  sendalert.cpp \
+  addrman.cpp \
+  addrdb.cpp \
+  alert.cpp \
+  alertkeys.h \
+  asyncrpcoperation.cpp \
+  asyncrpcqueue.cpp \
+  bloom.cpp \
+  chain.cpp \
+  checkpoints.cpp \
+  deprecation.cpp \
+  experimental_features.cpp \
+  httprpc.cpp \
+  httpserver.cpp \
+  init.cpp \
+  dbwrapper.cpp \
+  main.cpp \
+  merkleblock.cpp \
+  metrics.cpp \
+  miner.cpp \
+  net.cpp \
+  noui.cpp \
+  policy/fees.cpp \
+  policy/policy.cpp \
+  pow.cpp \
+  rest.cpp \
+  rpc/blockchain.cpp \
+  rpc/mining.cpp \
+  rpc/misc.cpp \
+  rpc/net.cpp \
+  rpc/rawtransaction.cpp \
+  rpc/server.cpp \
+  script/sigcache.cpp \
+  script/ismine.cpp \
+  timedata.cpp \
+  torcontrol.cpp \
+  txdb.cpp \
+  mempool_limit.cpp \
+  txmempool.cpp \
+  validationinterface.cpp \
+  $(BITCOIN_CORE_H) \
+  $(LIBZCASH_H)
+
+if ENABLE_ZMQ
+libbitcoin_zmq_a_CPPFLAGS = $(BITCOIN_INCLUDES) $(ZMQ_CFLAGS)
+libbitcoin_zmq_a_CXXFLAGS = $(AM_CXXFLAGS) $(PIE_FLAGS)
+libbitcoin_zmq_a_SOURCES = \
+  zmq/zmqabstractnotifier.cpp \
+  zmq/zmqnotificationinterface.cpp \
+  zmq/zmqpublishnotifier.cpp
+endif
+
+# wallet: zcashd, but only linked when wallet enabled
+libbitcoin_wallet_a_CPPFLAGS = $(AM_CPPFLAGS) $(BITCOIN_INCLUDES)
+libbitcoin_wallet_a_CXXFLAGS = $(AM_CXXFLAGS) $(PIE_FLAGS)
+libbitcoin_wallet_a_SOURCES = \
+  zcbenchmarks.cpp \
+  zcbenchmarks.h \
+  wallet/asyncrpcoperation_common.cpp \
+  wallet/asyncrpcoperation_mergetoaddress.cpp \
+  wallet/asyncrpcoperation_saplingmigration.cpp \
+  wallet/asyncrpcoperation_sendmany.cpp \
+  wallet/asyncrpcoperation_shieldcoinbase.cpp \
+  wallet/crypter.cpp \
+  wallet/db.cpp \
+  wallet/orchard.cpp \
+  wallet/paymentdisclosure.cpp \
+  wallet/paymentdisclosuredb.cpp \
+  wallet/rpcdisclosure.cpp \
+  wallet/rpcdump.cpp \
+  wallet/rpcwallet.cpp \
+  wallet/wallet.cpp \
+  wallet/walletdb.cpp \
+  $(BITCOIN_CORE_H) \
+  $(LIBZCASH_H)
+
+# crypto primitives library
+crypto_libbitcoin_crypto_a_CPPFLAGS = $(AM_CPPFLAGS) $(BITCOIN_CONFIG_INCLUDES)
+crypto_libbitcoin_crypto_a_CXXFLAGS = $(AM_CXXFLAGS) $(PIE_FLAGS)
+crypto_libbitcoin_crypto_a_SOURCES = \
+  crypto/aes.cpp \
+  crypto/aes.h \
+  crypto/chacha20.h \
+  crypto/chacha20.cpp \
+  crypto/common.h \
+  crypto/equihash.cpp \
+  crypto/equihash.h \
+  crypto/equihash.tcc \
+  crypto/hmac_sha256.cpp \
+  crypto/hmac_sha256.h \
+  crypto/hmac_sha512.cpp \
+  crypto/hmac_sha512.h \
+  crypto/ripemd160.cpp \
+  crypto/ripemd160.h \
+  crypto/sha1.cpp \
+  crypto/sha1.h \
+  crypto/sha256.cpp \
+  crypto/sha256.h \
+  crypto/sha512.cpp \
+  crypto/sha512.h
+
+if ENABLE_MINING
+EQUIHASH_TROMP_SOURCES = \
+  pow/tromp/equi_miner.h \
+  pow/tromp/equi.h \
+  pow/tromp/osx_barrier.h
+
+crypto_libbitcoin_crypto_a_CPPFLAGS += \
+  -DEQUIHASH_TROMP_ATOMIC
+crypto_libbitcoin_crypto_a_SOURCES += \
+  ${EQUIHASH_TROMP_SOURCES}
+endif
+
+# common: shared between zcashd and non-server tools
+libbitcoin_common_a_CPPFLAGS = $(AM_CPPFLAGS) $(BITCOIN_INCLUDES)
+libbitcoin_common_a_CXXFLAGS = $(AM_CXXFLAGS) $(PIE_FLAGS)
+libbitcoin_common_a_SOURCES = \
+  amount.cpp \
+  arith_uint256.cpp \
+  base58.cpp \
+  bech32.cpp \
+  chainparams.cpp \
+  coins.cpp \
+  compressor.cpp \
+  consensus/funding.cpp \
+  consensus/params.cpp \
+  consensus/upgrades.cpp \
+  core_read.cpp \
+  core_write.cpp \
+  hash.cpp \
+  key.cpp \
+  key_io.cpp \
+  keystore.cpp \
+  netbase.cpp \
+  primitives/block.cpp \
+  primitives/transaction.cpp \
+  primitives/tx_version_info.cpp \
+  proof_verifier.cpp \
+  protocol.cpp \
+  pubkey.cpp \
+  scheduler.cpp \
+  script/interpreter.cpp \
+  script/script.cpp \
+  script/script_error.cpp \
+  script/sign.cpp \
+  script/standard.cpp \
+  transaction_builder.cpp \
+  utiltest.cpp \
+  warnings.cpp \
+  $(BITCOIN_CORE_H) \
+  $(LIBZCASH_H)
+
+# util: shared between all executables.
+# This library *must* be included to make sure that the glibc
+# backward-compatibility objects and their sanity checks are linked.
+libbitcoin_util_a_CPPFLAGS = $(AM_CPPFLAGS) $(BITCOIN_INCLUDES)
+libbitcoin_util_a_CXXFLAGS = $(AM_CXXFLAGS) $(PIE_FLAGS)
+libbitcoin_util_a_SOURCES = \
+  support/lockedpool.cpp \
+  chainparamsbase.cpp \
+  clientversion.cpp \
+  compat/glibc_sanity.cpp \
+  compat/glibcxx_sanity.cpp \
+  compat/strnlen.cpp \
+  fs.cpp \
+  logging.cpp \
+  random.cpp \
+  rpc/protocol.cpp \
+  support/cleanse.cpp \
+  sync.cpp \
+  uint256.cpp \
+  util.cpp \
+  utilmoneystr.cpp \
+  utilstrencodings.cpp \
+  utiltime.cpp \
+  $(BITCOIN_CORE_H) \
+  $(LIBZCASH_H)
+
+if GLIBC_BACK_COMPAT
+libbitcoin_util_a_SOURCES += compat/glibc_compat.cpp
+endif
+
+# cli: zcash-cli
+libbitcoin_cli_a_CPPFLAGS = $(AM_CPPFLAGS) $(BITCOIN_INCLUDES)
+libbitcoin_cli_a_CXXFLAGS = $(AM_CXXFLAGS) $(PIE_FLAGS)
+libbitcoin_cli_a_SOURCES = \
+  rpc/client.cpp \
+  $(BITCOIN_CORE_H) \
+  $(LIBZCASH_H)
+
+nodist_libbitcoin_util_a_SOURCES = $(srcdir)/obj/build.h
+#
+
+# bitcoind binary #
+zcashd_SOURCES = bitcoind.cpp
+zcashd_CPPFLAGS = $(AM_CPPFLAGS) $(BITCOIN_INCLUDES)
+zcashd_CXXFLAGS = $(AM_CXXFLAGS) $(PIE_FLAGS)
+zcashd_LDFLAGS = $(RELDFLAGS) $(AM_LDFLAGS) $(LIBTOOL_APP_LDFLAGS)
+
+if TARGET_WINDOWS
+zcashd_SOURCES += bitcoind-res.rc
+endif
+
+zcashd_LDADD = \
+  $(LIBBITCOIN_SERVER) \
+  $(LIBBITCOIN_WALLET) \
+  $(LIBBITCOIN_COMMON) \
+  $(LIBUNIVALUE) \
+  $(LIBBITCOIN_UTIL) \
+  $(LIBBITCOIN_ZMQ) \
+  $(LIBBITCOIN_CRYPTO) \
+  $(LIBZCASH) \
+  $(LIBRUSTZCASH) \
+  $(LIBLEVELDB) \
+  $(LIBLEVELDB_SSE42) \
+  $(LIBMEMENV) \
+  $(LIBSECP256K1)
+
+zcashd_LDADD += \
+  $(BOOST_LIBS) \
+  $(BDB_LIBS) \
+  $(EVENT_PTHREADS_LIBS) \
+  $(EVENT_LIBS) \
+  $(ZMQ_LIBS) \
+  $(LIBBITCOIN_CRYPTO) \
+  $(LIBZCASH_LIBS)
+
+# bitcoin-cli binary #
+zcash_cli_SOURCES = bitcoin-cli.cpp
+zcash_cli_CPPFLAGS = $(AM_CPPFLAGS) $(BITCOIN_INCLUDES) $(EVENT_CFLAGS)
+zcash_cli_CXXFLAGS = $(AM_CXXFLAGS) $(PIE_FLAGS)
+zcash_cli_LDFLAGS = $(RELDFLAGS) $(AM_LDFLAGS) $(LIBTOOL_APP_LDFLAGS)
+
+if TARGET_WINDOWS
+zcash_cli_SOURCES += bitcoin-cli-res.rc
+endif
+
+zcash_cli_LDADD = \
+  $(LIBBITCOIN_CLI) \
+  $(LIBUNIVALUE) \
+  $(LIBBITCOIN_UTIL) \
+  $(BOOST_LIBS) \
+  $(EVENT_LIBS) \
+  $(LIBZCASH) \
+  $(LIBRUSTZCASH) \
+  $(LIBBITCOIN_CRYPTO) \
+  $(LIBSECP256K1) \
+  $(LIBZCASH_LIBS)
+#
+
+# zcash-tx binary #
+zcash_tx_SOURCES = bitcoin-tx.cpp
+zcash_tx_CPPFLAGS = $(AM_CPPFLAGS) $(BITCOIN_INCLUDES)
+zcash_tx_CXXFLAGS = $(AM_CXXFLAGS) $(PIE_FLAGS)
+zcash_tx_LDFLAGS = $(RELDFLAGS) $(AM_LDFLAGS) $(LIBTOOL_APP_LDFLAGS)
+
+if TARGET_WINDOWS
+zcash_tx_SOURCES += bitcoin-tx-res.rc
+endif
+
+# FIXME: Is libzcash needed for zcash_tx?
+zcash_tx_LDADD = \
+  $(LIBUNIVALUE) \
+  $(LIBBITCOIN_COMMON) \
+  $(LIBBITCOIN_UTIL) \
+  $(LIBSECP256K1) \
+  $(LIBZCASH) \
+  $(LIBRUSTZCASH) \
+  $(LIBBITCOIN_CRYPTO) \
+  $(LIBZCASH_LIBS)
+
+zcash_tx_LDADD += $(BOOST_LIBS)
+#
+
+# zcash protocol primitives #
+libzcash_a_SOURCES = \
+  zcash/IncrementalMerkleTree.cpp \
+  zcash/NoteEncryption.cpp \
+  zcash/Address.cpp \
+  zcash/address/transparent.cpp \
+  zcash/address/mnemonic.cpp \
+  zcash/address/orchard.cpp \
+  zcash/address/sapling.cpp \
+  zcash/address/sprout.cpp \
+  zcash/address/unified.cpp \
+  zcash/address/zip32.cpp \
+  zcash/History.cpp \
+  zcash/JoinSplit.cpp \
+  zcash/Note.cpp \
+  zcash/prf.cpp \
+  zcash/util.cpp
+
+libzcash_a_CPPFLAGS = $(AM_CPPFLAGS) $(PIC_FLAGS) $(BITCOIN_INCLUDES)
+libzcash_a_CXXFLAGS = $(AM_CXXFLAGS) $(PIE_FLAGS)
+libzcash_a_LDFLAGS = $(AM_LDFLAGS)
+
+# zcash_script library #
+if BUILD_BITCOIN_LIBS
+include_HEADERS = script/zcash_script.h
+libzcash_script_la_SOURCES = \
+  crypto/hmac_sha512.cpp \
+  crypto/ripemd160.cpp \
+  crypto/sha1.cpp \
+  crypto/sha256.cpp \
+  crypto/sha512.cpp \
+  hash.cpp \
+  primitives/transaction.cpp \
+  primitives/tx_version_info.cpp \
+  pubkey.cpp \
+  script/zcash_script.cpp \
+  script/interpreter.cpp \
+  script/script.cpp \
+  uint256.cpp \
+  utilstrencodings.cpp
+
+if GLIBC_BACK_COMPAT
+  libzcash_script_la_SOURCES += compat/glibc_compat.cpp
+endif
+
+libzcash_script_la_LDFLAGS = $(AM_LDFLAGS) -no-undefined $(RELDFLAGS)
+libzcash_script_la_LIBADD = $(LIBSECP256K1)
+libzcash_script_la_CPPFLAGS = $(AM_CPPFLAGS) -I$(builddir)/obj -I$(srcdir)/rust/include -I$(srcdir)/secp256k1/include -DBUILD_BITCOIN_INTERNAL
+libzcash_script_la_CXXFLAGS = $(AM_CXXFLAGS) $(PIE_FLAGS)
+
+endif
+#
+
+CTAES_DIST =  crypto/ctaes/bench.c
+CTAES_DIST += crypto/ctaes/ctaes.c
+CTAES_DIST += crypto/ctaes/ctaes.h
+CTAES_DIST += crypto/ctaes/README.md
+CTAES_DIST += crypto/ctaes/test.c
+
+CLEANFILES = *.gcda *.gcno */*.gcno wallet/*/*.gcno $(bin_SCRIPTS)
+
+DISTCLEANFILES = obj/build.h
+
+EXTRA_DIST = $(CTAES_DIST) rust
+
+clean-local:
+	rm -f $(top_srcdir)/.cargo/config $(top_srcdir)/.cargo/.configured-for-*
+	-$(MAKE) -C secp256k1 clean
+	-$(MAKE) -C univalue clean
+	rm -f leveldb/*/*.gcno leveldb/helpers/memenv/*.gcno
+	rm -f fuzz.cpp
+	rm -rf fuzzing/*/output
+	-rm -f config.h
+	-rm -f *.lib bench/*.lib test/*.lib
+
+.rc.o:
+	@test -f $(WINDRES)
+	$(AM_V_GEN) $(WINDRES) -DWINDRES_PREPROC -i $< -o $@
+
+.mm.o:
+	$(AM_V_CXX) $(OBJCXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
+	  $(CPPFLAGS) $(AM_CXXFLAGS) $(AM_CXXFLAGS) $(PIE_FLAGS) $(CXXFLAGS) -c -o $@ $<
+
+check-symbols: $(bin_PROGRAMS) $(bin_SCRIPTS)
+if GLIBC_BACK_COMPAT
+	@echo "Checking glibc back compat of [$(bin_PROGRAMS) $(bin_SCRIPTS)]..."
+	$(AM_V_at) READELF=$(READELF) CPPFILT=$(CPPFILT) $(top_srcdir)/contrib/devtools/symbol-check.py $(bin_PROGRAMS) $(bin_SCRIPTS)
+endif
+
+check-security: $(bin_PROGRAMS) $(bin_SCRIPTS)
+if HARDEN
+	@echo "Checking binary security of [$(bin_PROGRAMS) $(bin_SCRIPTS)]..."
+	$(AM_V_at) READELF=$(READELF) OBJDUMP=$(OBJDUMP) $(top_srcdir)/contrib/devtools/security-check.py $(bin_PROGRAMS)
+	$(AM_V_at) READELF=$(READELF) OBJDUMP=$(OBJDUMP) $(top_srcdir)/contrib/devtools/security-check.py --allow-no-canary $(bin_SCRIPTS)
+endif
+
+%.pb.cc %.pb.h: %.proto
+	@test -f $(PROTOC)
+	$(AM_V_GEN) $(PROTOC) --cpp_out=$(@D) --proto_path=$(abspath $(<D) $<)
+
+if EMBEDDED_LEVELDB
+include Makefile.leveldb.include
+endif
+
+if ENABLE_TESTS
+include Makefile.test.include
+include Makefile.gtest.include
+endif
+
+if ENABLE_BENCH
+include Makefile.bench.include
+endif
diff --git a/depend/zcash/src/Makefile.bench.include b/depend/zcash/src/Makefile.bench.include
new file mode 100644
index 000000000..4a1dcab3e
--- /dev/null
+++ b/depend/zcash/src/Makefile.bench.include
@@ -0,0 +1,63 @@
+# Copyright (c) 2020 The Zcash developers
+# Copyright (c) 2015-2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+bin_PROGRAMS += bench/bench_bitcoin
+BENCH_SRCDIR = bench
+BENCH_BINARY = bench/bench_bitcoin$(EXEEXT)
+
+
+bench_bench_bitcoin_SOURCES = \
+  bench/bench_bitcoin.cpp \
+  bench/bench.cpp \
+  bench/bench.h \
+  bench/checkqueue.cpp \
+  bench/Examples.cpp \
+  bench/rollingbloom.cpp \
+  bench/verification.cpp \
+  bench/crypto_hash.cpp \
+  bench/base58.cpp \
+  bench/lockedpool.cpp \
+  bench/perf.cpp \
+  bench/perf.h \
+  bench/prevector_destructor.cpp
+
+bench_bench_bitcoin_CPPFLAGS = $(AM_CPPFLAGS) $(BITCOIN_INCLUDES) $(EVENT_CLFAGS) $(EVENT_PTHREADS_CFLAGS) -I$(builddir)/bench/
+bench_bench_bitcoin_CXXFLAGS = $(AM_CXXFLAGS) $(PIE_FLAGS)
+bench_bench_bitcoin_LDADD = \
+  $(LIBBITCOIN_SERVER) \
+  $(LIBBITCOIN_COMMON) \
+  $(LIBBITCOIN_UNIVALUE) \
+  $(LIBBITCOIN_UTIL) \
+  $(LIBBITCOIN_CRYPTO) \
+  $(LIBLEVELDB) \
+  $(LIBLEVELDB_SSE42) \
+  $(LIBMEMENV) \
+  $(LIBSECP256K1) \
+  $(LIBUNIVALUE) \
+  $(LIBZCASH) \
+  $(LIBRUSTZCASH)
+
+if ENABLE_ZMQ
+bench_bench_bitcoin_LDADD += $(LIBBITCOIN_ZMQ) $(ZMQ_LIBS)
+endif
+
+if ENABLE_WALLET
+bench_bench_bitcoin_LDADD += $(LIBBITCOIN_WALLET)
+endif
+
+bench_bench_bitcoin_LDADD += $(BOOST_LIBS) $(BDB_LIBS) $(EVENT_PTHREADS_LIBS) $(EVENT_LIBS) $(LIBZCASH_LIBS)
+bench_bench_bitcoin_LDFLAGS = $(RELDFLAGS) $(AM_LDFLAGS) $(LIBTOOL_APP_LDFLAGS)
+
+CLEAN_BITCOIN_BENCH = bench/*.gcda bench/*.gcno
+
+CLEANFILES += $(CLEAN_BITCOIN_BENCH)
+
+bitcoin_bench: $(BENCH_BINARY)
+
+bench: $(BENCH_BINARY) FORCE
+	$(BENCH_BINARY)
+
+bitcoin_bench_clean : FORCE
+	rm -f $(CLEAN_BITCOIN_BENCH) $(bench_bench_bitcoin_OBJECTS) $(BENCH_BINARY)
diff --git a/depend/zcash/src/Makefile.gtest.include b/depend/zcash/src/Makefile.gtest.include
new file mode 100644
index 000000000..a0350b26a
--- /dev/null
+++ b/depend/zcash/src/Makefile.gtest.include
@@ -0,0 +1,104 @@
+# Copyright (c) 2016-2020 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+TESTS += zcash-gtest
+noinst_PROGRAMS += zcash-gtest
+
+# tool for generating our public parameters.
+# test_checktransaction.cpp MUST be before
+# any test that calls SelectParams().
+zcash_gtest_SOURCES = \
+	gtest/main.cpp \
+	gtest/utils.cpp \
+	gtest/utils.h \
+	gtest/test_checktransaction.cpp \
+	gtest/test_consensus.cpp \
+	gtest/json_test_vectors.cpp \
+	gtest/json_test_vectors.h \
+	gtest/test_foundersreward.cpp \
+	test/data/merkle_roots_orchard.h \
+	gtest/data/tx-orchard-duplicate-nullifiers.h \
+	gtest/test_tautology.cpp \
+	gtest/test_allocator.cpp \
+	gtest/test_checkblock.cpp \
+	gtest/test_deprecation.cpp \
+	gtest/test_dynamicusage.cpp \
+	gtest/test_equihash.cpp \
+	gtest/test_feature_flagging.cpp \
+	gtest/test_history.cpp \
+	gtest/test_httprpc.cpp \
+	gtest/test_joinsplit.cpp \
+	gtest/test_keys.cpp \
+	gtest/test_keystore.cpp \
+	gtest/test_libzcash_utils.cpp \
+	gtest/test_noteencryption.cpp \
+	gtest/test_mempool.cpp \
+	gtest/test_mempoollimit.cpp \
+	gtest/test_merkletree.cpp \
+	gtest/test_metrics.cpp \
+	gtest/test_miner.cpp \
+	gtest/test_pedersen_hash.cpp \
+	gtest/test_pow.cpp \
+	gtest/test_random.cpp \
+	gtest/test_rpc.cpp \
+	gtest/test_sapling_note.cpp \
+	gtest/test_sighash.cpp \
+	gtest/test_timedata.cpp \
+	gtest/test_transaction.cpp \
+	gtest/test_transaction_builder.cpp \
+	gtest/test_transaction_builder.h \
+	gtest/test_txid.cpp \
+	gtest/test_upgrades.cpp \
+	gtest/test_validation.cpp \
+	gtest/test_zip32.cpp \
+	gtest/test_coins.cpp
+if ENABLE_WALLET
+zcash_gtest_SOURCES += \
+	wallet/gtest/test_wallet_zkeys.cpp \
+	wallet/gtest/test_orchard_zkeys.cpp \
+	wallet/gtest/test_note_selection.cpp \
+	wallet/gtest/test_orchard_wallet.cpp \
+	wallet/gtest/test_paymentdisclosure.cpp \
+	wallet/gtest/test_wallet.cpp \
+	wallet/gtest/test_rpc_wallet.cpp
+endif
+
+zcash_gtest_CPPFLAGS = $(AM_CPPFLAGS) $(BITCOIN_INCLUDES)
+zcash_gtest_CXXFLAGS = $(AM_CXXFLAGS) $(PIE_FLAGS)
+
+zcash_gtest_LDADD = \
+  -lgtest -lgmock \
+  $(LIBBITCOIN_SERVER) \
+  $(LIBBITCOIN_CLI) \
+  $(LIBBITCOIN_WALLET) \
+  $(LIBBITCOIN_COMMON) \
+  $(LIBBITCOIN_UTIL) \
+  $(LIBBITCOIN_ZMQ) \
+  $(LIBBITCOIN_PROTON) \
+  $(LIBBITCOIN_CRYPTO) \
+  $(LIBUNIVALUE) \
+  $(LIBLEVELDB) \
+  $(LIBLEVELDB_SSE42) \
+  $(LIBMEMENV) \
+  $(LIBSECP256K1)
+
+zcash_gtest_LDADD += \
+  $(LIBZCASH_SCRIPT) \
+  $(BOOST_LIBS) \
+  $(BOOST_UNIT_TEST_FRAMEWORK_LIB) \
+  $(BDB_LIBS) \
+  $(EVENT_PTHREADS_LIBS) \
+  $(EVENT_LIBS) \
+  $(ZMQ_LIBS) \
+  $(LIBZCASH) \
+  $(LIBRUSTZCASH) \
+  $(LIBZCASH_LIBS)
+
+zcash_gtest_LDFLAGS = $(RELDFLAGS) $(AM_LDFLAGS) $(LIBTOOL_APP_LDFLAGS) -static
+
+zcash-gtest_check: zcash-gtest FORCE
+	./zcash-gtest
+
+zcash-gtest-expected-failures: zcash-gtest FORCE
+	./zcash-gtest --gtest_filter=*DISABLED_* --gtest_also_run_disabled_tests
diff --git a/depend/zcash/src/Makefile.leveldb.include b/depend/zcash/src/Makefile.leveldb.include
new file mode 100644
index 000000000..c2d812725
--- /dev/null
+++ b/depend/zcash/src/Makefile.leveldb.include
@@ -0,0 +1,150 @@
+# Copyright (c) 2020 The Zcash developers
+# Copyright (c) 2016-2017 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+LIBLEVELDB_INT = leveldb/libleveldb.a
+LIBMEMENV_INT  = leveldb/libmemenv.a
+LIBLEVELDB_SSE42_INT  = leveldb/libleveldb_sse42.a
+
+EXTRA_LIBRARIES += $(LIBLEVELDB_INT)
+EXTRA_LIBRARIES += $(LIBMEMENV_INT)
+EXTRA_LIBRARIES += $(LIBLEVELDB_SSE42_INT)
+
+LIBLEVELDB += $(LIBLEVELDB_INT)
+LIBMEMENV += $(LIBMEMENV_INT)
+LIBLEVELDB_SSE42 = $(LIBLEVELDB_SSE42_INT)
+
+LEVELDB_CPPFLAGS += -I$(srcdir)/leveldb/include
+LEVELDB_CPPFLAGS += -I$(srcdir)/leveldb/helpers/memenv
+
+LEVELDB_CPPFLAGS_INT =
+LEVELDB_CPPFLAGS_INT += -I$(srcdir)/leveldb
+LEVELDB_CPPFLAGS_INT += $(LEVELDB_TARGET_FLAGS)
+LEVELDB_CPPFLAGS_INT += -DLEVELDB_ATOMIC_PRESENT
+LEVELDB_CPPFLAGS_INT += -D__STDC_LIMIT_MACROS
+
+if TARGET_WINDOWS
+LEVELDB_CPPFLAGS_INT += -DLEVELDB_PLATFORM_WINDOWS -D__USE_MINGW_ANSI_STDIO=1
+else
+LEVELDB_CPPFLAGS_INT += -DLEVELDB_PLATFORM_POSIX
+endif
+
+leveldb_libleveldb_a_CPPFLAGS = $(AM_CPPFLAGS) $(LEVELDB_CPPFLAGS_INT) $(LEVELDB_CPPFLAGS)
+leveldb_libleveldb_a_CXXFLAGS = $(AM_CXXFLAGS) $(PIE_FLAGS)
+
+leveldb_libleveldb_a_SOURCES=
+leveldb_libleveldb_a_SOURCES += leveldb/port/atomic_pointer.h
+leveldb_libleveldb_a_SOURCES += leveldb/port/port_example.h
+leveldb_libleveldb_a_SOURCES += leveldb/port/port_posix.h
+leveldb_libleveldb_a_SOURCES += leveldb/port/win/stdint.h
+leveldb_libleveldb_a_SOURCES += leveldb/port/port.h
+leveldb_libleveldb_a_SOURCES += leveldb/port/port_win.h
+leveldb_libleveldb_a_SOURCES += leveldb/port/thread_annotations.h
+leveldb_libleveldb_a_SOURCES += leveldb/include/leveldb/db.h
+leveldb_libleveldb_a_SOURCES += leveldb/include/leveldb/options.h
+leveldb_libleveldb_a_SOURCES += leveldb/include/leveldb/comparator.h
+leveldb_libleveldb_a_SOURCES += leveldb/include/leveldb/filter_policy.h
+leveldb_libleveldb_a_SOURCES += leveldb/include/leveldb/slice.h
+leveldb_libleveldb_a_SOURCES += leveldb/include/leveldb/table_builder.h
+leveldb_libleveldb_a_SOURCES += leveldb/include/leveldb/env.h
+leveldb_libleveldb_a_SOURCES += leveldb/include/leveldb/c.h
+leveldb_libleveldb_a_SOURCES += leveldb/include/leveldb/iterator.h
+leveldb_libleveldb_a_SOURCES += leveldb/include/leveldb/cache.h
+leveldb_libleveldb_a_SOURCES += leveldb/include/leveldb/dumpfile.h
+leveldb_libleveldb_a_SOURCES += leveldb/include/leveldb/table.h
+leveldb_libleveldb_a_SOURCES += leveldb/include/leveldb/write_batch.h
+leveldb_libleveldb_a_SOURCES += leveldb/include/leveldb/status.h
+leveldb_libleveldb_a_SOURCES += leveldb/db/log_format.h
+leveldb_libleveldb_a_SOURCES += leveldb/db/memtable.h
+leveldb_libleveldb_a_SOURCES += leveldb/db/version_set.h
+leveldb_libleveldb_a_SOURCES += leveldb/db/write_batch_internal.h
+leveldb_libleveldb_a_SOURCES += leveldb/db/filename.h
+leveldb_libleveldb_a_SOURCES += leveldb/db/version_edit.h
+leveldb_libleveldb_a_SOURCES += leveldb/db/dbformat.h
+leveldb_libleveldb_a_SOURCES += leveldb/db/builder.h
+leveldb_libleveldb_a_SOURCES += leveldb/db/log_writer.h
+leveldb_libleveldb_a_SOURCES += leveldb/db/db_iter.h
+leveldb_libleveldb_a_SOURCES += leveldb/db/skiplist.h
+leveldb_libleveldb_a_SOURCES += leveldb/db/db_impl.h
+leveldb_libleveldb_a_SOURCES += leveldb/db/table_cache.h
+leveldb_libleveldb_a_SOURCES += leveldb/db/snapshot.h
+leveldb_libleveldb_a_SOURCES += leveldb/db/log_reader.h
+leveldb_libleveldb_a_SOURCES += leveldb/table/filter_block.h
+leveldb_libleveldb_a_SOURCES += leveldb/table/block_builder.h
+leveldb_libleveldb_a_SOURCES += leveldb/table/block.h
+leveldb_libleveldb_a_SOURCES += leveldb/table/two_level_iterator.h
+leveldb_libleveldb_a_SOURCES += leveldb/table/merger.h
+leveldb_libleveldb_a_SOURCES += leveldb/table/format.h
+leveldb_libleveldb_a_SOURCES += leveldb/table/iterator_wrapper.h
+leveldb_libleveldb_a_SOURCES += leveldb/util/crc32c.h
+leveldb_libleveldb_a_SOURCES += leveldb/util/env_posix_test_helper.h
+leveldb_libleveldb_a_SOURCES += leveldb/util/arena.h
+leveldb_libleveldb_a_SOURCES += leveldb/util/random.h
+leveldb_libleveldb_a_SOURCES += leveldb/util/posix_logger.h
+leveldb_libleveldb_a_SOURCES += leveldb/util/hash.h
+leveldb_libleveldb_a_SOURCES += leveldb/util/histogram.h
+leveldb_libleveldb_a_SOURCES += leveldb/util/coding.h
+leveldb_libleveldb_a_SOURCES += leveldb/util/testutil.h
+leveldb_libleveldb_a_SOURCES += leveldb/util/mutexlock.h
+leveldb_libleveldb_a_SOURCES += leveldb/util/logging.h
+leveldb_libleveldb_a_SOURCES += leveldb/util/testharness.h
+
+leveldb_libleveldb_a_SOURCES += leveldb/db/builder.cc
+leveldb_libleveldb_a_SOURCES += leveldb/db/c.cc
+leveldb_libleveldb_a_SOURCES += leveldb/db/dbformat.cc
+leveldb_libleveldb_a_SOURCES += leveldb/db/db_impl.cc
+leveldb_libleveldb_a_SOURCES += leveldb/db/db_iter.cc
+leveldb_libleveldb_a_SOURCES += leveldb/db/dumpfile.cc
+leveldb_libleveldb_a_SOURCES += leveldb/db/filename.cc
+leveldb_libleveldb_a_SOURCES += leveldb/db/log_reader.cc
+leveldb_libleveldb_a_SOURCES += leveldb/db/log_writer.cc
+leveldb_libleveldb_a_SOURCES += leveldb/db/memtable.cc
+leveldb_libleveldb_a_SOURCES += leveldb/db/repair.cc
+leveldb_libleveldb_a_SOURCES += leveldb/db/table_cache.cc
+leveldb_libleveldb_a_SOURCES += leveldb/db/version_edit.cc
+leveldb_libleveldb_a_SOURCES += leveldb/db/version_set.cc
+leveldb_libleveldb_a_SOURCES += leveldb/db/write_batch.cc
+leveldb_libleveldb_a_SOURCES += leveldb/table/block_builder.cc
+leveldb_libleveldb_a_SOURCES += leveldb/table/block.cc
+leveldb_libleveldb_a_SOURCES += leveldb/table/filter_block.cc
+leveldb_libleveldb_a_SOURCES += leveldb/table/format.cc
+leveldb_libleveldb_a_SOURCES += leveldb/table/iterator.cc
+leveldb_libleveldb_a_SOURCES += leveldb/table/merger.cc
+leveldb_libleveldb_a_SOURCES += leveldb/table/table_builder.cc
+leveldb_libleveldb_a_SOURCES += leveldb/table/table.cc
+leveldb_libleveldb_a_SOURCES += leveldb/table/two_level_iterator.cc
+leveldb_libleveldb_a_SOURCES += leveldb/util/arena.cc
+leveldb_libleveldb_a_SOURCES += leveldb/util/bloom.cc
+leveldb_libleveldb_a_SOURCES += leveldb/util/cache.cc
+leveldb_libleveldb_a_SOURCES += leveldb/util/coding.cc
+leveldb_libleveldb_a_SOURCES += leveldb/util/comparator.cc
+leveldb_libleveldb_a_SOURCES += leveldb/util/crc32c.cc
+leveldb_libleveldb_a_SOURCES += leveldb/util/env.cc
+leveldb_libleveldb_a_SOURCES += leveldb/util/env_posix.cc
+leveldb_libleveldb_a_SOURCES += leveldb/util/filter_policy.cc
+leveldb_libleveldb_a_SOURCES += leveldb/util/hash.cc
+leveldb_libleveldb_a_SOURCES += leveldb/util/histogram.cc
+leveldb_libleveldb_a_SOURCES += leveldb/util/logging.cc
+leveldb_libleveldb_a_SOURCES += leveldb/util/options.cc
+leveldb_libleveldb_a_SOURCES += leveldb/util/status.cc
+
+if TARGET_WINDOWS
+leveldb_libleveldb_a_SOURCES += leveldb/util/env_win.cc
+leveldb_libleveldb_a_SOURCES += leveldb/port/port_win.cc
+else
+leveldb_libleveldb_a_SOURCES += leveldb/port/port_posix.cc
+endif
+
+leveldb_libmemenv_a_CPPFLAGS = $(leveldb_libleveldb_a_CPPFLAGS)
+leveldb_libmemenv_a_CXXFLAGS = $(leveldb_libleveldb_a_CXXFLAGS)
+leveldb_libmemenv_a_SOURCES =  leveldb/helpers/memenv/memenv.cc
+leveldb_libmemenv_a_SOURCES += leveldb/helpers/memenv/memenv.h
+
+leveldb_libleveldb_sse42_a_CPPFLAGS = $(leveldb_libleveldb_a_CPPFLAGS)
+leveldb_libleveldb_sse42_a_CXXFLAGS = $(leveldb_libleveldb_a_CXXFLAGS)
+if ENABLE_HWCRC32
+leveldb_libleveldb_sse42_a_CPPFLAGS += -DLEVELDB_PLATFORM_POSIX_SSE
+leveldb_libleveldb_sse42_a_CXXFLAGS += $(SSE42_CXXFLAGS)
+endif
+leveldb_libleveldb_sse42_a_SOURCES =  leveldb/port/port_posix_sse.cc
diff --git a/depend/zcash/src/Makefile.test.include b/depend/zcash/src/Makefile.test.include
new file mode 100644
index 000000000..e20d2157c
--- /dev/null
+++ b/depend/zcash/src/Makefile.test.include
@@ -0,0 +1,194 @@
+# Copyright (c) 2016-2020 The Zcash developers
+# Copyright (c) 2013-2019 The Bitcoin Core developers
+# Copyright (c) 2013-2019 Bitcoin Developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+TESTS += test/test_bitcoin
+noinst_PROGRAMS += test/test_bitcoin
+TEST_SRCDIR = test
+TEST_BINARY=test/test_bitcoin$(EXEEXT)
+
+
+EXTRA_DIST += \
+	test/bctest.py \
+	test/bitcoin-util-test.py \
+	test/data/bitcoin-util-test.json \
+	test/data/blanktx.hex \
+	test/data/tt-delin1-out.hex \
+	test/data/tt-delout1-out.hex \
+	test/data/tt-locktime317000-out.hex \
+	test/data/tx394b54bb.hex \
+	test/data/txcreate1.hex \
+	test/data/txcreate2.hex \
+	test/data/txcreatesign.hex
+
+JSON_TEST_FILES = \
+  test/data/script_valid.json \
+  test/data/base58_keys_valid.json \
+  test/data/base58_encode_decode.json \
+  test/data/base58_keys_invalid.json \
+  test/data/script_invalid.json \
+  test/data/tx_invalid.json \
+  test/data/tx_valid.json \
+  test/data/sighash.json \
+  test/data/merkle_roots.json \
+  test/data/merkle_serialization.json \
+  test/data/merkle_witness_serialization.json \
+  test/data/merkle_path.json \
+  test/data/merkle_commitments.json \
+  test/data/merkle_roots_sapling.json \
+  test/data/merkle_serialization_sapling.json \
+  test/data/merkle_witness_serialization_sapling.json \
+  test/data/merkle_path_sapling.json \
+  test/data/merkle_commitments_sapling.json \
+  test/data/sapling_key_components.json \
+  test/data/unified_addrs.json \
+  test/data/unified_full_viewing_keys.json \
+  test/data/zip0244.json
+
+RAW_TEST_FILES = test/data/alertTests.raw
+
+GENERATED_TEST_FILES = $(JSON_TEST_FILES:.json=.json.h) $(RAW_TEST_FILES:.raw=.raw.h)
+
+BITCOIN_TEST_SUITE = \
+  test/test_bitcoin.h \
+  test/test_bitcoin.cpp
+
+BITCOIN_TESTS =\
+  test/arith_uint256_tests.cpp \
+  test/scriptnum10.h \
+  test/addrman_tests.cpp \
+  test/alert_tests.cpp \
+  test/allocator_tests.cpp \
+  test/base32_tests.cpp \
+  test/base58_tests.cpp \
+  test/base64_tests.cpp \
+  test/bech32_tests.cpp \
+  test/bip32_tests.cpp \
+  test/bloom_tests.cpp \
+  test/checkblock_tests.cpp \
+  test/Checkpoints_tests.cpp \
+  test/checkqueue_tests.cpp \
+  test/coins_tests.cpp \
+  test/compress_tests.cpp \
+  test/convertbits_tests.cpp \
+  test/crypto_tests.cpp \
+  test/DoS_tests.cpp \
+  test/equihash_tests.cpp \
+  test/getarg_tests.cpp \
+  test/hash_tests.cpp \
+  test/key_tests.cpp \
+  test/limitedmap_tests.cpp \
+  test/dbwrapper_tests.cpp \
+  test/main_tests.cpp \
+  test/mempool_tests.cpp \
+  test/miner_tests.cpp \
+  test/multisig_tests.cpp \
+  test/net_tests.cpp \
+  test/netbase_tests.cpp \
+  test/pmt_tests.cpp \
+  test/policyestimator_tests.cpp \
+  test/pow_tests.cpp \
+  test/prevector_tests.cpp \
+  test/raii_event_tests.cpp \
+  test/random_tests.cpp \
+  test/reverselock_tests.cpp \
+  test/rpc_tests.cpp \
+  test/sanity_tests.cpp \
+  test/scheduler_tests.cpp \
+  test/script_P2SH_tests.cpp \
+  test/script_P2PKH_tests.cpp \
+  test/script_tests.cpp \
+  test/script_standard_tests.cpp \
+  test/scriptnum_tests.cpp \
+  test/serialize_tests.cpp \
+  test/sighash_tests.cpp \
+  test/sigopcount_tests.cpp \
+  test/skiplist_tests.cpp \
+  test/streams_tests.cpp \
+  test/test_random.h \
+  test/test_util.cpp \
+  test/test_util.h \
+  test/torcontrol_tests.cpp \
+  test/transaction_tests.cpp \
+  test/txvalidationcache_tests.cpp \
+  test/uint256_tests.cpp \
+  test/univalue_tests.cpp \
+  test/util_tests.cpp \
+  test/sha256compress_tests.cpp
+
+if ENABLE_WALLET
+BITCOIN_TESTS += \
+  wallet/test/wallet_tests.cpp \
+  wallet/test/crypto_tests.cpp \
+  wallet/test/rpc_wallet_tests.cpp
+
+BITCOIN_TEST_SUITE += \
+  wallet/test/wallet_test_fixture.cpp \
+  wallet/test/wallet_test_fixture.h
+endif
+
+test_test_bitcoin_SOURCES = $(BITCOIN_TEST_SUITE) $(BITCOIN_TESTS) $(JSON_TEST_FILES) $(RAW_TEST_FILES)
+test_test_bitcoin_CPPFLAGS = $(AM_CPPFLAGS) $(BITCOIN_INCLUDES) -I$(builddir)/test/ $(TESTDEFS) $(EVENT_CFLAGS)
+test_test_bitcoin_LDADD =
+if ENABLE_WALLET
+test_test_bitcoin_LDADD += $(LIBBITCOIN_WALLET)
+endif
+test_test_bitcoin_LDADD += $(LIBBITCOIN_SERVER) $(LIBBITCOIN_CLI) $(LIBBITCOIN_COMMON) $(LIBBITCOIN_UTIL) $(LIBBITCOIN_CRYPTO) $(LIBUNIVALUE) \
+  $(LIBLEVELDB) $(LIBLEVELDB_SSE42) $(LIBMEMENV) $(BOOST_LIBS) $(BOOST_UNIT_TEST_FRAMEWORK_LIB) $(LIBSECP256K1) $(EVENT_LIBS) $(EVENT_PTHREADS_LIBS)
+test_test_bitcoin_CXXFLAGS = $(AM_CXXFLAGS) $(PIE_FLAGS)
+
+test_test_bitcoin_LDADD += $(LIBZCASH_SCRIPT) $(BDB_LIBS) $(LIBZCASH) $(LIBRUSTZCASH) $(LIBZCASH_LIBS)
+test_test_bitcoin_LDFLAGS = $(RELDFLAGS) $(AM_LDFLAGS) $(LIBTOOL_APP_LDFLAGS) -static
+
+if ENABLE_ZMQ
+test_test_bitcoin_LDADD += $(ZMQ_LIBS)
+endif
+
+nodist_test_test_bitcoin_SOURCES = $(GENERATED_TEST_FILES)
+
+$(BITCOIN_TESTS): $(GENERATED_TEST_FILES)
+
+CLEAN_BITCOIN_TEST = test/*.gcda test/*.gcno $(GENERATED_TEST_FILES)
+
+CLEANFILES += $(CLEAN_BITCOIN_TEST)
+
+bitcoin_test: $(TEST_BINARY)
+
+bitcoin_test_check: $(TEST_BINARY) FORCE
+	$(MAKE) check-TESTS TESTS=$^
+
+bitcoin_test_clean : FORCE
+	rm -f $(CLEAN_BITCOIN_TEST) $(test_test_bitcoin_OBJECTS) $(TEST_BINARY)
+
+check-local:
+	@echo "Running test/bitcoin-util-test.py..."
+	$(AM_V_at)srcdir=$(srcdir) PYTHONPATH=$(builddir)/test $(srcdir)/test/bitcoin-util-test.py
+	$(AM_V_at)$(MAKE) $(AM_MAKEFLAGS) -C secp256k1 check
+	$(AM_V_at)$(MAKE) $(AM_MAKEFLAGS) -C univalue check
+
+
+SUITES = $(shell cat $(BITCOIN_TESTS) | grep "BOOST_FIXTURE_TEST_SUITE\|BOOST_AUTO_TEST_SUITE" | grep -v "DISABLED_TEST_SUITE" | cut -d '(' -f 2 | cut -d ',' -f 1 | cut -d ')' -f 1 | grep . | sed -e 's/^/testsuite./')
+
+testsuite.%: test/test_bitcoin
+	@echo $(SUITES)
+	$(TEST_BINARY) -t $* > $*.log 2>&1 || (cat $*.log && false)
+
+parallel_btests: $(SUITES)
+
+%.json.h: %.json
+	@$(MKDIR_P) $(@D)
+	@echo "namespace json_tests{" > $@
+	@echo "static unsigned const char $(*F)[] = {" >> $@
+	@$(HEXDUMP) -v -e '8/1 "0x%02x, "' -e '"\n"' $< | $(SED) -e 's/0x  ,//g' >> $@
+	@echo "};};" >> $@
+	@echo "Generated $@"
+
+%.raw.h: %.raw
+	@$(MKDIR_P) $(@D)
+	@echo "namespace alert_tests{" > $@
+	@echo "static unsigned const char $(*F)[] = {" >> $@
+	@$(HEXDUMP) -v -e '8/1 "0x%02x, "' -e '"\n"' $< | $(SED) -e 's/0x  ,//g' >> $@
+	@echo "};};" >> $@
+	@echo "Generated $@"
diff --git a/depend/zcash/src/addrdb.cpp b/depend/zcash/src/addrdb.cpp
new file mode 100644
index 000000000..81d011dbd
--- /dev/null
+++ b/depend/zcash/src/addrdb.cpp
@@ -0,0 +1,218 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or http://www.opensource.org/licenses/mit-license.php.
+
+#include "addrdb.h"
+
+#include "addrman.h"
+#include "chainparams.h"
+#include "clientversion.h"
+#include "hash.h"
+#include "random.h"
+#include "streams.h"
+#include "tinyformat.h"
+#include "util.h"
+
+#include <boost/filesystem.hpp>
+
+CBanDB::CBanDB()
+{
+    pathBanlist = GetDataDir() / "banlist.dat";
+}
+
+bool CBanDB::Write(const banmap_t& banSet)
+{
+    // Generate random temporary filename
+    unsigned short randv = 0;
+    GetRandBytes((unsigned char*)&randv, sizeof(randv));
+    std::string tmpfn = strprintf("banlist.dat.%04x", randv);
+
+    // serialize banlist, checksum data up to that point, then append csum
+    CDataStream ssBanlist(SER_DISK, CLIENT_VERSION);
+    ssBanlist << FLATDATA(Params().MessageStart());
+    ssBanlist << banSet;
+    uint256 hash = Hash(ssBanlist.begin(), ssBanlist.end());
+    ssBanlist << hash;
+
+    // open temp output file, and associate with CAutoFile
+    fs::path pathTmp = GetDataDir() / tmpfn;
+    FILE *file = fopen(pathTmp.string().c_str(), "wb");
+    CAutoFile fileout(file, SER_DISK, CLIENT_VERSION);
+    if (fileout.IsNull())
+        return error("%s: Failed to open file %s", __func__, pathTmp.string());
+
+    // Write and commit header, data
+    try {
+        fileout << ssBanlist;
+    }
+    catch (const std::exception& e) {
+        return error("%s: Serialize or I/O error - %s", __func__, e.what());
+    }
+    FileCommit(fileout.Get());
+    fileout.fclose();
+
+    // replace existing banlist.dat, if any, with new banlist.dat.XXXX
+    if (!RenameOver(pathTmp, pathBanlist))
+        return error("%s: Rename-into-place failed", __func__);
+
+    return true;
+}
+
+bool CBanDB::Read(banmap_t& banSet)
+{
+    // open input file, and associate with CAutoFile
+    FILE *file = fopen(pathBanlist.string().c_str(), "rb");
+    CAutoFile filein(file, SER_DISK, CLIENT_VERSION);
+    if (filein.IsNull())
+        return error("%s: Failed to open file %s", __func__, pathBanlist.string());
+
+    // use file size to size memory buffer
+    uint64_t fileSize = fs::file_size(pathBanlist);
+    uint64_t dataSize = 0;
+    // Don't try to resize to a negative number if file is small
+    if (fileSize >= sizeof(uint256))
+        dataSize = fileSize - sizeof(uint256);
+    std::vector<unsigned char> vchData;
+    vchData.resize(dataSize);
+    uint256 hashIn;
+
+    // read data and checksum from file
+    try {
+        filein.read((char *)&vchData[0], dataSize);
+        filein >> hashIn;
+    }
+    catch (const std::exception& e) {
+        return error("%s: Deserialize or I/O error - %s", __func__, e.what());
+    }
+    filein.fclose();
+
+    CDataStream ssBanlist(vchData, SER_DISK, CLIENT_VERSION);
+
+    // verify stored checksum matches input data
+    uint256 hashTmp = Hash(ssBanlist.begin(), ssBanlist.end());
+    if (hashIn != hashTmp)
+        return error("%s: Checksum mismatch, data corrupted", __func__);
+
+    unsigned char pchMsgTmp[4];
+    try {
+        // de-serialize file header (network specific magic number) and ..
+        ssBanlist >> FLATDATA(pchMsgTmp);
+
+        // ... verify the network matches ours
+        if (memcmp(pchMsgTmp, Params().MessageStart(), sizeof(pchMsgTmp)))
+            return error("%s: Invalid network magic number", __func__);
+
+        // de-serialize address data into one CAddrMan object
+        ssBanlist >> banSet;
+    }
+    catch (const std::exception& e) {
+        return error("%s: Deserialize or I/O error - %s", __func__, e.what());
+    }
+
+    return true;
+}
+
+CAddrDB::CAddrDB()
+{
+    pathAddr = GetDataDir() / "peers.dat";
+}
+
+bool CAddrDB::Write(const CAddrMan& addr)
+{
+    // Generate random temporary filename
+    unsigned short randv = 0;
+    GetRandBytes((unsigned char*)&randv, sizeof(randv));
+    std::string tmpfn = strprintf("peers.dat.%04x", randv);
+
+    // serialize addresses, checksum data up to that point, then append csum
+    CDataStream ssPeers(SER_DISK, CLIENT_VERSION);
+    ssPeers << FLATDATA(Params().MessageStart());
+    ssPeers << addr;
+    uint256 hash = Hash(ssPeers.begin(), ssPeers.end());
+    ssPeers << hash;
+
+    // open temp output file, and associate with CAutoFile
+    fs::path pathTmp = GetDataDir() / tmpfn;
+    FILE *file = fsbridge::fopen(pathTmp, "wb");
+    CAutoFile fileout(file, SER_DISK, CLIENT_VERSION);
+    if (fileout.IsNull())
+        return error("%s: Failed to open file %s", __func__, pathTmp.string());
+
+    // Write and commit header, data
+    try {
+        fileout << ssPeers;
+    }
+    catch (const std::exception& e) {
+        return error("%s: Serialize or I/O error - %s", __func__, e.what());
+    }
+    FileCommit(fileout.Get());
+    fileout.fclose();
+
+    // replace existing peers.dat, if any, with new peers.dat.XXXX
+    if (!RenameOver(pathTmp, pathAddr))
+        return error("%s: Rename-into-place failed", __func__);
+
+    return true;
+}
+
+bool CAddrDB::Read(CAddrMan& addr)
+{
+    // open input file, and associate with CAutoFile
+    FILE *file = fsbridge::fopen(pathAddr, "rb");
+    CAutoFile filein(file, SER_DISK, CLIENT_VERSION);
+    if (filein.IsNull())
+        return error("%s: Failed to open file %s", __func__, pathAddr.string());
+
+    // use file size to size memory buffer
+    uint64_t fileSize = fs::file_size(pathAddr);
+    uint64_t dataSize = 0;
+    // Don't try to resize to a negative number if file is small
+    if (fileSize >= sizeof(uint256))
+        dataSize = fileSize - sizeof(uint256);
+    std::vector<unsigned char> vchData;
+    vchData.resize(dataSize);
+    uint256 hashIn;
+
+    // read data and checksum from file
+    try {
+        filein.read((char *)&vchData[0], dataSize);
+        filein >> hashIn;
+    }
+    catch (const std::exception& e) {
+        return error("%s: Deserialize or I/O error - %s", __func__, e.what());
+    }
+    filein.fclose();
+
+    CDataStream ssPeers(vchData, SER_DISK, CLIENT_VERSION);
+
+    // verify stored checksum matches input data
+    uint256 hashTmp = Hash(ssPeers.begin(), ssPeers.end());
+    if (hashIn != hashTmp)
+        return error("%s: Checksum mismatch, data corrupted", __func__);
+
+    return Read(addr, ssPeers);
+}
+
+bool CAddrDB::Read(CAddrMan& addr, CDataStream& ssPeers)
+{
+    unsigned char pchMsgTmp[4];
+    try {
+        // de-serialize file header (network specific magic number) and ..
+        ssPeers >> FLATDATA(pchMsgTmp);
+
+        // ... verify the network matches ours
+        if (memcmp(pchMsgTmp, Params().MessageStart(), sizeof(pchMsgTmp)))
+            return error("%s: Invalid network magic number", __func__);
+
+        // de-serialize address data into one CAddrMan object
+        ssPeers >> addr;
+    }
+    catch (const std::exception& e) {
+        // de-serialization has failed, ensure addrman is left in a clean state
+        addr.Clear();
+        return error("%s: Deserialize or I/O error - %s", __func__, e.what());
+    }
+
+    return true;
+}
diff --git a/depend/zcash/src/addrdb.h b/depend/zcash/src/addrdb.h
new file mode 100644
index 000000000..46eed7db1
--- /dev/null
+++ b/depend/zcash/src/addrdb.h
@@ -0,0 +1,102 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or http://www.opensource.org/licenses/mit-license.php.
+
+#ifndef BITCOIN_ADDRDB_H
+#define BITCOIN_ADDRDB_H
+
+#include "fs.h"
+#include "serialize.h"
+#include "streams.h"
+
+#include <string>
+#include <map>
+
+class CSubNet;
+class CAddrMan;
+
+typedef enum BanReason
+{
+    BanReasonUnknown          = 0,
+    BanReasonNodeMisbehaving  = 1,
+    BanReasonManuallyAdded    = 2
+} BanReason;
+
+class CBanEntry
+{
+public:
+    static const int CURRENT_VERSION=1;
+    int nVersion;
+    int64_t nCreateTime;
+    int64_t nBanUntil;
+    uint8_t banReason;
+
+    CBanEntry()
+    {
+        SetNull();
+    }
+
+    CBanEntry(int64_t nCreateTimeIn)
+    {
+        SetNull();
+        nCreateTime = nCreateTimeIn;
+    }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(this->nVersion);
+        READWRITE(nCreateTime);
+        READWRITE(nBanUntil);
+        READWRITE(banReason);
+    }
+
+    void SetNull()
+    {
+        nVersion = CBanEntry::CURRENT_VERSION;
+        nCreateTime = 0;
+        nBanUntil = 0;
+        banReason = BanReasonUnknown;
+    }
+
+    std::string banReasonToString()
+    {
+        switch (banReason) {
+        case BanReasonNodeMisbehaving:
+            return "node misbehaving";
+        case BanReasonManuallyAdded:
+            return "manually added";
+        default:
+            return "unknown";
+        }
+    }
+};
+
+typedef std::map<CSubNet, CBanEntry> banmap_t;
+
+/** Access to the (IP) address database (peers.dat) */
+class CAddrDB
+{
+private:
+    fs::path pathAddr;
+public:
+    CAddrDB();
+    bool Write(const CAddrMan& addr);
+    bool Read(CAddrMan& addr);
+    bool Read(CAddrMan& addr, CDataStream& ssPeers);
+};
+
+/** Access to the banlist database (banlist.dat) */
+class CBanDB
+{
+private:
+    fs::path pathBanlist;
+public:
+    CBanDB();
+    bool Write(const banmap_t& banSet);
+    bool Read(banmap_t& banSet);
+};
+
+#endif // BITCOIN_ADDRDB_H
diff --git a/depend/zcash/src/addressindex.h b/depend/zcash/src/addressindex.h
new file mode 100644
index 000000000..1cbd30001
--- /dev/null
+++ b/depend/zcash/src/addressindex.h
@@ -0,0 +1,287 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_ADDRESSINDEX_H
+#define BITCOIN_ADDRESSINDEX_H
+
+#include "uint256.h"
+#include "amount.h"
+#include "script/script.h"
+
+struct CAddressUnspentKey {
+    unsigned int type;
+    uint160 hashBytes;
+    uint256 txhash;
+    size_t index;
+
+    size_t GetSerializeSize(int nType, int nVersion) const {
+        return 57;
+    }
+    template<typename Stream>
+    void Serialize(Stream& s) const {
+        ser_writedata8(s, type);
+        hashBytes.Serialize(s);
+        txhash.Serialize(s);
+        ser_writedata32(s, index);
+    }
+    template<typename Stream>
+    void Unserialize(Stream& s) {
+        type = ser_readdata8(s);
+        hashBytes.Unserialize(s);
+        txhash.Unserialize(s);
+        index = ser_readdata32(s);
+    }
+
+    CAddressUnspentKey(unsigned int addressType, uint160 addressHash, uint256 txid, size_t indexValue) {
+        type = addressType;
+        hashBytes = addressHash;
+        txhash = txid;
+        index = indexValue;
+    }
+
+    CAddressUnspentKey() {
+        SetNull();
+    }
+
+    void SetNull() {
+        type = 0;
+        hashBytes.SetNull();
+        txhash.SetNull();
+        index = 0;
+    }
+};
+
+struct CAddressUnspentValue {
+    CAmount satoshis;
+    CScript script;
+    int blockHeight;
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(satoshis);
+        READWRITE(*(CScriptBase*)(&script));
+        READWRITE(blockHeight);
+    }
+
+    CAddressUnspentValue(CAmount sats, CScript scriptPubKey, int height) {
+        satoshis = sats;
+        script = scriptPubKey;
+        blockHeight = height;
+    }
+
+    CAddressUnspentValue() {
+        SetNull();
+    }
+
+    void SetNull() {
+        satoshis = -1;
+        script.clear();
+        blockHeight = 0;
+    }
+
+    bool IsNull() const {
+        return (satoshis == -1);
+    }
+};
+
+struct CAddressIndexKey {
+    unsigned int type;
+    uint160 hashBytes;
+    int blockHeight;
+    unsigned int txindex;
+    uint256 txhash;
+    size_t index;
+    bool spending;
+
+    size_t GetSerializeSize(int nType, int nVersion) const {
+        return 66;
+    }
+    template<typename Stream>
+    void Serialize(Stream& s) const {
+        ser_writedata8(s, type);
+        hashBytes.Serialize(s);
+        // Heights are stored big-endian for key sorting in LevelDB
+        ser_writedata32be(s, blockHeight);
+        ser_writedata32be(s, txindex);
+        txhash.Serialize(s);
+        ser_writedata32(s, index);
+        char f = spending;
+        ser_writedata8(s, f);
+    }
+    template<typename Stream>
+    void Unserialize(Stream& s) {
+        type = ser_readdata8(s);
+        hashBytes.Unserialize(s);
+        blockHeight = ser_readdata32be(s);
+        txindex = ser_readdata32be(s);
+        txhash.Unserialize(s);
+        index = ser_readdata32(s);
+        char f = ser_readdata8(s);
+        spending = f;
+    }
+
+    CAddressIndexKey(unsigned int addressType, uint160 addressHash, int height, int blockindex,
+                     uint256 txid, size_t indexValue, bool isSpending) {
+        type = addressType;
+        hashBytes = addressHash;
+        blockHeight = height;
+        txindex = blockindex;
+        txhash = txid;
+        index = indexValue;
+        spending = isSpending;
+    }
+
+    CAddressIndexKey() {
+        SetNull();
+    }
+
+    void SetNull() {
+        type = 0;
+        hashBytes.SetNull();
+        blockHeight = 0;
+        txindex = 0;
+        txhash.SetNull();
+        index = 0;
+        spending = false;
+    }
+
+};
+
+struct CAddressIndexIteratorKey {
+    unsigned int type;
+    uint160 hashBytes;
+
+    size_t GetSerializeSize(int nType, int nVersion) const {
+        return 21;
+    }
+    template<typename Stream>
+    void Serialize(Stream& s) const {
+        ser_writedata8(s, type);
+        hashBytes.Serialize(s);
+    }
+    template<typename Stream>
+    void Unserialize(Stream& s) {
+        type = ser_readdata8(s);
+        hashBytes.Unserialize(s);
+    }
+
+    CAddressIndexIteratorKey(unsigned int addressType, uint160 addressHash) {
+        type = addressType;
+        hashBytes = addressHash;
+    }
+
+    CAddressIndexIteratorKey() {
+        SetNull();
+    }
+
+    void SetNull() {
+        type = 0;
+        hashBytes.SetNull();
+    }
+};
+
+struct CAddressIndexIteratorHeightKey {
+    unsigned int type;
+    uint160 hashBytes;
+    int blockHeight;
+
+    size_t GetSerializeSize(int nType, int nVersion) const {
+        return 25;
+    }
+    template<typename Stream>
+    void Serialize(Stream& s) const {
+        ser_writedata8(s, type);
+        hashBytes.Serialize(s);
+        ser_writedata32be(s, blockHeight);
+    }
+    template<typename Stream>
+    void Unserialize(Stream& s) {
+        type = ser_readdata8(s);
+        hashBytes.Unserialize(s);
+        blockHeight = ser_readdata32be(s);
+    }
+
+    CAddressIndexIteratorHeightKey(unsigned int addressType, uint160 addressHash, int height) {
+        type = addressType;
+        hashBytes = addressHash;
+        blockHeight = height;
+    }
+
+    CAddressIndexIteratorHeightKey() {
+        SetNull();
+    }
+
+    void SetNull() {
+        type = 0;
+        hashBytes.SetNull();
+        blockHeight = 0;
+    }
+};
+
+struct CMempoolAddressDelta
+{
+    int64_t time;
+    CAmount amount;
+    uint256 prevhash;
+    unsigned int prevout;
+
+    CMempoolAddressDelta(int64_t t, CAmount a, uint256 hash, unsigned int out) {
+        time = t;
+        amount = a;
+        prevhash = hash;
+        prevout = out;
+    }
+
+    CMempoolAddressDelta(int64_t t, CAmount a) {
+        time = t;
+        amount = a;
+        prevhash.SetNull();
+        prevout = 0;
+    }
+};
+
+struct CMempoolAddressDeltaKey
+{
+    int type;
+    uint160 addressBytes;
+    uint256 txhash;
+    unsigned int index;
+    int spending;
+
+    CMempoolAddressDeltaKey(int addressType, uint160 addressHash, uint256 hash, unsigned int i, int s) {
+        type = addressType;
+        addressBytes = addressHash;
+        txhash = hash;
+        index = i;
+        spending = s;
+    }
+
+    CMempoolAddressDeltaKey(int addressType, uint160 addressHash) {
+        type = addressType;
+        addressBytes = addressHash;
+        txhash.SetNull();
+        index = 0;
+        spending = 0;
+    }
+};
+
+struct CMempoolAddressDeltaKeyCompare
+{
+    bool operator()(const CMempoolAddressDeltaKey& a, const CMempoolAddressDeltaKey& b) const {
+        if (a.type != b.type)
+            return a.type < b.type;
+        if (a.addressBytes != b.addressBytes)
+            return a.addressBytes < b.addressBytes;
+        if (a.txhash != b.txhash)
+            return a.txhash < b.txhash;
+        if (a.index != b.index)
+            return a.index < b.index;
+        return a.spending < b.spending;
+    }
+};
+
+#endif // BITCOIN_ADDRESSINDEX_H
diff --git a/depend/zcash/src/addrman.cpp b/depend/zcash/src/addrman.cpp
new file mode 100644
index 000000000..4557b990a
--- /dev/null
+++ b/depend/zcash/src/addrman.cpp
@@ -0,0 +1,517 @@
+// Copyright (c) 2012 Pieter Wuille
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "addrman.h"
+
+#include "hash.h"
+#include "serialize.h"
+#include "streams.h"
+
+int CAddrInfo::GetTriedBucket(const uint256& nKey) const
+{
+    uint64_t hash1 = (CHashWriter(SER_GETHASH, 0) << nKey << GetKey()).GetHash().GetCheapHash();
+    uint64_t hash2 = (CHashWriter(SER_GETHASH, 0) << nKey << GetGroup() << (hash1 % ADDRMAN_TRIED_BUCKETS_PER_GROUP)).GetHash().GetCheapHash();
+    return hash2 % ADDRMAN_TRIED_BUCKET_COUNT;
+}
+
+int CAddrInfo::GetNewBucket(const uint256& nKey, const CNetAddr& src) const
+{
+    std::vector<unsigned char> vchSourceGroupKey = src.GetGroup();
+    uint64_t hash1 = (CHashWriter(SER_GETHASH, 0) << nKey << GetGroup() << vchSourceGroupKey).GetHash().GetCheapHash();
+    uint64_t hash2 = (CHashWriter(SER_GETHASH, 0) << nKey << vchSourceGroupKey << (hash1 % ADDRMAN_NEW_BUCKETS_PER_SOURCE_GROUP)).GetHash().GetCheapHash();
+    return hash2 % ADDRMAN_NEW_BUCKET_COUNT;
+}
+
+int CAddrInfo::GetBucketPosition(const uint256 &nKey, bool fNew, int nBucket) const
+{
+    uint64_t hash1 = (CHashWriter(SER_GETHASH, 0) << nKey << (fNew ? 'N' : 'K') << nBucket << GetKey()).GetHash().GetCheapHash();
+    return hash1 % ADDRMAN_BUCKET_SIZE;
+}
+
+bool CAddrInfo::IsTerrible(int64_t nNow) const
+{
+    if (nLastTry && nLastTry >= nNow - 60) // never remove things tried in the last minute
+        return false;
+
+    if (nTime > nNow + 10 * 60) // came in a flying DeLorean
+        return true;
+
+    if (nTime == 0 || nNow - nTime > ADDRMAN_HORIZON_DAYS * 24 * 60 * 60) // not seen in recent history
+        return true;
+
+    if (nLastSuccess == 0 && nAttempts >= ADDRMAN_RETRIES) // tried N times and never a success
+        return true;
+
+    if (nNow - nLastSuccess > ADDRMAN_MIN_FAIL_DAYS * 24 * 60 * 60 && nAttempts >= ADDRMAN_MAX_FAILURES) // N successive failures in the last week
+        return true;
+
+    return false;
+}
+
+double CAddrInfo::GetChance(int64_t nNow) const
+{
+    double fChance = 1.0;
+
+    int64_t nSinceLastSeen = nNow - nTime;
+    int64_t nSinceLastTry = nNow - nLastTry;
+
+    if (nSinceLastSeen < 0)
+        nSinceLastSeen = 0;
+    if (nSinceLastTry < 0)
+        nSinceLastTry = 0;
+
+    // deprioritize very recent attempts away
+    if (nSinceLastTry < 60 * 10)
+        fChance *= 0.01;
+
+    // deprioritize 66% after each failed attempt, but at most 1/28th to avoid the search taking forever or overly penalizing outages.
+    fChance *= pow(0.66, std::min(nAttempts, 8));
+
+    return fChance;
+}
+
+CAddrInfo* CAddrMan::Find(const CNetAddr& addr, int* pnId)
+{
+    std::map<CNetAddr, int>::iterator it = mapAddr.find(addr);
+    if (it == mapAddr.end())
+        return NULL;
+    if (pnId)
+        *pnId = (*it).second;
+    std::map<int, CAddrInfo>::iterator it2 = mapInfo.find((*it).second);
+    if (it2 != mapInfo.end())
+        return &(*it2).second;
+    return NULL;
+}
+
+CAddrInfo* CAddrMan::Create(const CAddress& addr, const CNetAddr& addrSource, int* pnId)
+{
+    int nId = nIdCount++;
+    mapInfo[nId] = CAddrInfo(addr, addrSource);
+    mapAddr[addr] = nId;
+    mapInfo[nId].nRandomPos = vRandom.size();
+    vRandom.push_back(nId);
+    if (pnId)
+        *pnId = nId;
+    return &mapInfo[nId];
+}
+
+void CAddrMan::SwapRandom(unsigned int nRndPos1, unsigned int nRndPos2)
+{
+    if (nRndPos1 == nRndPos2)
+        return;
+
+    assert(nRndPos1 < vRandom.size() && nRndPos2 < vRandom.size());
+
+    int nId1 = vRandom[nRndPos1];
+    int nId2 = vRandom[nRndPos2];
+
+    assert(mapInfo.count(nId1) == 1);
+    assert(mapInfo.count(nId2) == 1);
+
+    mapInfo[nId1].nRandomPos = nRndPos2;
+    mapInfo[nId2].nRandomPos = nRndPos1;
+
+    vRandom[nRndPos1] = nId2;
+    vRandom[nRndPos2] = nId1;
+}
+
+void CAddrMan::Delete(int nId)
+{
+    assert(mapInfo.count(nId) != 0);
+    CAddrInfo& info = mapInfo[nId];
+    assert(!info.fInTried);
+    assert(info.nRefCount == 0);
+
+    SwapRandom(info.nRandomPos, vRandom.size() - 1);
+    vRandom.pop_back();
+    mapAddr.erase(info);
+    mapInfo.erase(nId);
+    nNew--;
+}
+
+void CAddrMan::ClearNew(int nUBucket, int nUBucketPos)
+{
+    // if there is an entry in the specified bucket, delete it.
+    if (vvNew[nUBucket][nUBucketPos] != -1) {
+        int nIdDelete = vvNew[nUBucket][nUBucketPos];
+        CAddrInfo& infoDelete = mapInfo[nIdDelete];
+        assert(infoDelete.nRefCount > 0);
+        infoDelete.nRefCount--;
+        vvNew[nUBucket][nUBucketPos] = -1;
+        if (infoDelete.nRefCount == 0) {
+            Delete(nIdDelete);
+        }
+    }
+}
+
+void CAddrMan::MakeTried(CAddrInfo& info, int nId)
+{
+    // remove the entry from all new buckets
+    for (int bucket = 0; bucket < ADDRMAN_NEW_BUCKET_COUNT; bucket++) {
+        int pos = info.GetBucketPosition(nKey, true, bucket);
+        if (vvNew[bucket][pos] == nId) {
+            vvNew[bucket][pos] = -1;
+            info.nRefCount--;
+        }
+    }
+    nNew--;
+
+    assert(info.nRefCount == 0);
+
+    // which tried bucket to move the entry to
+    int nKBucket = info.GetTriedBucket(nKey);
+    int nKBucketPos = info.GetBucketPosition(nKey, false, nKBucket);
+
+    // first make space to add it (the existing tried entry there is moved to new, deleting whatever is there).
+    if (vvTried[nKBucket][nKBucketPos] != -1) {
+        // find an item to evict
+        int nIdEvict = vvTried[nKBucket][nKBucketPos];
+        assert(mapInfo.count(nIdEvict) == 1);
+        CAddrInfo& infoOld = mapInfo[nIdEvict];
+
+        // Remove the to-be-evicted item from the tried set.
+        infoOld.fInTried = false;
+        vvTried[nKBucket][nKBucketPos] = -1;
+        nTried--;
+
+        // find which new bucket it belongs to
+        int nUBucket = infoOld.GetNewBucket(nKey);
+        int nUBucketPos = infoOld.GetBucketPosition(nKey, true, nUBucket);
+        ClearNew(nUBucket, nUBucketPos);
+        assert(vvNew[nUBucket][nUBucketPos] == -1);
+
+        // Enter it into the new set again.
+        infoOld.nRefCount = 1;
+        vvNew[nUBucket][nUBucketPos] = nIdEvict;
+        nNew++;
+    }
+    assert(vvTried[nKBucket][nKBucketPos] == -1);
+
+    vvTried[nKBucket][nKBucketPos] = nId;
+    nTried++;
+    info.fInTried = true;
+}
+
+void CAddrMan::Good_(const CService& addr, int64_t nTime)
+{
+    int nId;
+    CAddrInfo* pinfo = Find(addr, &nId);
+
+    // if not found, bail out
+    if (!pinfo)
+        return;
+
+    CAddrInfo& info = *pinfo;
+
+    // check whether we are talking about the exact same CService (including same port)
+    if (info != addr)
+        return;
+
+    // update info
+    info.nLastSuccess = nTime;
+    info.nLastTry = nTime;
+    info.nAttempts = 0;
+    // nTime is not updated here, to avoid leaking information about
+    // currently-connected peers.
+
+    // if it is already in the tried set, don't do anything else
+    if (info.fInTried)
+        return;
+
+    // find a bucket it is in now
+    int nRnd = RandomInt(ADDRMAN_NEW_BUCKET_COUNT);
+    int nUBucket = -1;
+    for (unsigned int n = 0; n < ADDRMAN_NEW_BUCKET_COUNT; n++) {
+        int nB = (n + nRnd) % ADDRMAN_NEW_BUCKET_COUNT;
+        int nBpos = info.GetBucketPosition(nKey, true, nB);
+        if (vvNew[nB][nBpos] == nId) {
+            nUBucket = nB;
+            break;
+        }
+    }
+
+    // if no bucket is found, something bad happened;
+    // TODO: maybe re-add the node, but for now, just bail out
+    if (nUBucket == -1)
+        return;
+
+    LogPrint("addrman", "Moving %s to tried\n", addr.ToString());
+
+    // move nId to the tried tables
+    MakeTried(info, nId);
+}
+
+bool CAddrMan::Add_(const CAddress& addr, const CNetAddr& source, int64_t nTimePenalty)
+{
+    if (!addr.IsRoutable())
+        return false;
+
+    bool fNew = false;
+    int nId;
+    CAddrInfo* pinfo = Find(addr, &nId);
+
+    if (pinfo) {
+        // periodically update nTime
+        bool fCurrentlyOnline = (GetTime() - addr.nTime < 24 * 60 * 60);
+        int64_t nUpdateInterval = (fCurrentlyOnline ? 60 * 60 : 24 * 60 * 60);
+        if (addr.nTime && (!pinfo->nTime || pinfo->nTime < addr.nTime - nUpdateInterval - nTimePenalty))
+            pinfo->nTime = std::max((int64_t)0, addr.nTime - nTimePenalty);
+
+        // add services
+        pinfo->nServices |= addr.nServices;
+
+        // do not update if no new information is present
+        if (!addr.nTime || (pinfo->nTime && addr.nTime <= pinfo->nTime))
+            return false;
+
+        // do not update if the entry was already in the "tried" table
+        if (pinfo->fInTried)
+            return false;
+
+        // do not update if the max reference count is reached
+        if (pinfo->nRefCount == ADDRMAN_NEW_BUCKETS_PER_ADDRESS)
+            return false;
+
+        // stochastic test: previous nRefCount == N: 2^N times harder to increase it
+        int nFactor = 1;
+        for (int n = 0; n < pinfo->nRefCount; n++)
+            nFactor *= 2;
+        if (nFactor > 1 && (RandomInt(nFactor) != 0))
+            return false;
+    } else {
+        pinfo = Create(addr, source, &nId);
+        pinfo->nTime = std::max((int64_t)0, (int64_t)pinfo->nTime - nTimePenalty);
+        nNew++;
+        fNew = true;
+    }
+
+    int nUBucket = pinfo->GetNewBucket(nKey, source);
+    int nUBucketPos = pinfo->GetBucketPosition(nKey, true, nUBucket);
+    if (vvNew[nUBucket][nUBucketPos] != nId) {
+        bool fInsert = vvNew[nUBucket][nUBucketPos] == -1;
+        if (!fInsert) {
+            CAddrInfo& infoExisting = mapInfo[vvNew[nUBucket][nUBucketPos]];
+            if (infoExisting.IsTerrible() || (infoExisting.nRefCount > 1 && pinfo->nRefCount == 0)) {
+                // Overwrite the existing new table entry.
+                fInsert = true;
+            }
+        }
+        if (fInsert) {
+            ClearNew(nUBucket, nUBucketPos);
+            pinfo->nRefCount++;
+            vvNew[nUBucket][nUBucketPos] = nId;
+        } else {
+            if (pinfo->nRefCount == 0) {
+                Delete(nId);
+            }
+        }
+    }
+    return fNew;
+}
+
+void CAddrMan::Attempt_(const CService& addr, int64_t nTime)
+{
+    CAddrInfo* pinfo = Find(addr);
+
+    // if not found, bail out
+    if (!pinfo)
+        return;
+
+    CAddrInfo& info = *pinfo;
+
+    // check whether we are talking about the exact same CService (including same port)
+    if (info != addr)
+        return;
+
+    // update info
+    info.nLastTry = nTime;
+    info.nAttempts++;
+}
+
+CAddrInfo CAddrMan::Select_(bool newOnly)
+{
+    if (size() == 0)
+        return CAddrInfo();
+
+    // Track number of attempts to find a table entry, before giving up to avoid infinite loop
+    const int kMaxRetries = 200000;         // magic number so unit tests can pass
+    const int kRetriesBetweenSleep = 1000;
+    const int kRetrySleepInterval = 100;    // milliseconds
+
+    if (newOnly && nNew == 0)
+        return CAddrInfo();
+
+    // Use a 50% chance for choosing between tried and new table entries.
+    if (!newOnly &&
+       (nTried > 0 && (nNew == 0 || RandomInt(2) == 0))) {
+        // use a tried node
+        double fChanceFactor = 1.0;
+        while (1) {
+            int i = 0;
+            int nKBucket = RandomInt(ADDRMAN_TRIED_BUCKET_COUNT);
+            int nKBucketPos = RandomInt(ADDRMAN_BUCKET_SIZE);
+            while (vvTried[nKBucket][nKBucketPos] == -1) {
+                nKBucket = (nKBucket + insecure_rand.randbits(ADDRMAN_TRIED_BUCKET_COUNT_LOG2)) % ADDRMAN_TRIED_BUCKET_COUNT;
+                nKBucketPos = (nKBucketPos + insecure_rand.randbits(ADDRMAN_BUCKET_SIZE_LOG2)) % ADDRMAN_BUCKET_SIZE;
+                if (i++ > kMaxRetries)
+                    return CAddrInfo();
+                if (i % kRetriesBetweenSleep == 0 && !nKey.IsNull())
+                    MilliSleep(kRetrySleepInterval);
+            }
+            int nId = vvTried[nKBucket][nKBucketPos];
+            assert(mapInfo.count(nId) == 1);
+            CAddrInfo& info = mapInfo[nId];
+            if (RandomInt(1 << 30) < fChanceFactor * info.GetChance() * (1 << 30))
+                return info;
+            fChanceFactor *= 1.2;
+        }
+    } else {
+        // use a new node
+        double fChanceFactor = 1.0;
+        while (1) {
+            int i = 0;
+            int nUBucket = RandomInt(ADDRMAN_NEW_BUCKET_COUNT);
+            int nUBucketPos = RandomInt(ADDRMAN_BUCKET_SIZE);
+            while (vvNew[nUBucket][nUBucketPos] == -1) {
+                nUBucket = (nUBucket + insecure_rand.randbits(ADDRMAN_NEW_BUCKET_COUNT_LOG2)) % ADDRMAN_NEW_BUCKET_COUNT;
+                nUBucketPos = (nUBucketPos + insecure_rand.randbits(ADDRMAN_BUCKET_SIZE_LOG2)) % ADDRMAN_BUCKET_SIZE;
+                if (i++ > kMaxRetries)
+                    return CAddrInfo();
+                if (i % kRetriesBetweenSleep == 0 && !nKey.IsNull())
+                    MilliSleep(kRetrySleepInterval);
+            }
+            int nId = vvNew[nUBucket][nUBucketPos];
+            assert(mapInfo.count(nId) == 1);
+            CAddrInfo& info = mapInfo[nId];
+            if (RandomInt(1 << 30) < fChanceFactor * info.GetChance() * (1 << 30))
+                return info;
+            fChanceFactor *= 1.2;
+        }
+    }
+
+    return CAddrInfo();
+}
+
+#ifdef DEBUG_ADDRMAN
+int CAddrMan::Check_()
+{
+    std::set<int> setTried;
+    std::map<int, int> mapNew;
+
+    if (vRandom.size() != nTried + nNew)
+        return -7;
+
+    for (std::map<int, CAddrInfo>::iterator it = mapInfo.begin(); it != mapInfo.end(); it++) {
+        int n = (*it).first;
+        CAddrInfo& info = (*it).second;
+        if (info.fInTried) {
+            if (!info.nLastSuccess)
+                return -1;
+            if (info.nRefCount)
+                return -2;
+            setTried.insert(n);
+        } else {
+            if (info.nRefCount < 0 || info.nRefCount > ADDRMAN_NEW_BUCKETS_PER_ADDRESS)
+                return -3;
+            if (!info.nRefCount)
+                return -4;
+            mapNew[n] = info.nRefCount;
+        }
+        if (mapAddr[info] != n)
+            return -5;
+        if (info.nRandomPos < 0 || info.nRandomPos >= vRandom.size() || vRandom[info.nRandomPos] != n)
+            return -14;
+        if (info.nLastTry < 0)
+            return -6;
+        if (info.nLastSuccess < 0)
+            return -8;
+    }
+
+    if (setTried.size() != nTried)
+        return -9;
+    if (mapNew.size() != nNew)
+        return -10;
+
+    for (int n = 0; n < ADDRMAN_TRIED_BUCKET_COUNT; n++) {
+        for (int i = 0; i < ADDRMAN_BUCKET_SIZE; i++) {
+             if (vvTried[n][i] != -1) {
+                 if (!setTried.count(vvTried[n][i]))
+                     return -11;
+                 if (mapInfo[vvTried[n][i]].GetTriedBucket(nKey) != n)
+                     return -17;
+                 if (mapInfo[vvTried[n][i]].GetBucketPosition(nKey, false, n) != i)
+                     return -18;
+                 setTried.erase(vvTried[n][i]);
+             }
+        }
+    }
+
+    for (int n = 0; n < ADDRMAN_NEW_BUCKET_COUNT; n++) {
+        for (int i = 0; i < ADDRMAN_BUCKET_SIZE; i++) {
+            if (vvNew[n][i] != -1) {
+                if (!mapNew.count(vvNew[n][i]))
+                    return -12;
+                if (mapInfo[vvNew[n][i]].GetBucketPosition(nKey, true, n) != i)
+                    return -19;
+                if (--mapNew[vvNew[n][i]] == 0)
+                    mapNew.erase(vvNew[n][i]);
+            }
+        }
+    }
+
+    if (setTried.size())
+        return -13;
+    if (mapNew.size())
+        return -15;
+    if (nKey.IsNull())
+        return -16;
+
+    return 0;
+}
+#endif
+
+void CAddrMan::GetAddr_(std::vector<CAddress>& vAddr)
+{
+    unsigned int nNodes = ADDRMAN_GETADDR_MAX_PCT * vRandom.size() / 100;
+    if (nNodes > ADDRMAN_GETADDR_MAX)
+        nNodes = ADDRMAN_GETADDR_MAX;
+
+    // gather a list of random nodes, skipping those of low quality
+    for (unsigned int n = 0; n < vRandom.size(); n++) {
+        if (vAddr.size() >= nNodes)
+            break;
+
+        int nRndPos = RandomInt(vRandom.size() - n) + n;
+        SwapRandom(n, nRndPos);
+        assert(mapInfo.count(vRandom[n]) == 1);
+
+        const CAddrInfo& ai = mapInfo[vRandom[n]];
+        if (!ai.IsTerrible())
+            vAddr.push_back(ai);
+    }
+}
+
+void CAddrMan::Connected_(const CService& addr, int64_t nTime)
+{
+    CAddrInfo* pinfo = Find(addr);
+
+    // if not found, bail out
+    if (!pinfo)
+        return;
+
+    CAddrInfo& info = *pinfo;
+
+    // check whether we are talking about the exact same CService (including same port)
+    if (info != addr)
+        return;
+
+    // update info
+    int64_t nUpdateInterval = 20 * 60;
+    if (nTime - info.nTime > nUpdateInterval)
+        info.nTime = nTime;
+}
+
+int CAddrMan::RandomInt(int nMax){
+    return GetRandInt(nMax);
+}
diff --git a/depend/zcash/src/addrman.h b/depend/zcash/src/addrman.h
new file mode 100644
index 000000000..8b287edbd
--- /dev/null
+++ b/depend/zcash/src/addrman.h
@@ -0,0 +1,580 @@
+// Copyright (c) 2012 Pieter Wuille
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_ADDRMAN_H
+#define BITCOIN_ADDRMAN_H
+
+#include "netbase.h"
+#include "protocol.h"
+#include "random.h"
+#include "sync.h"
+#include "timedata.h"
+#include "util.h"
+
+#include <map>
+#include <set>
+#include <stdint.h>
+#include <vector>
+
+/**
+ * Extended statistics about a CAddress
+ */
+class CAddrInfo : public CAddress
+{
+
+
+public:
+    //! last try whatsoever by us (memory only)
+    int64_t nLastTry;
+
+private:
+    //! where knowledge about this address first came from
+    CNetAddr source;
+
+    //! last successful connection by us
+    int64_t nLastSuccess;
+
+    //! connection attempts since last successful attempt
+    int nAttempts;
+
+    //! reference count in new sets (memory only)
+    int nRefCount;
+
+    //! in tried set? (memory only)
+    bool fInTried;
+
+    //! position in vRandom
+    int nRandomPos;
+
+    friend class CAddrMan;
+
+public:
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(*(CAddress*)this);
+        READWRITE(source);
+        READWRITE(nLastSuccess);
+        READWRITE(nAttempts);
+    }
+
+    void Init()
+    {
+        nLastSuccess = 0;
+        nLastTry = 0;
+        nAttempts = 0;
+        nRefCount = 0;
+        fInTried = false;
+        nRandomPos = -1;
+    }
+
+    CAddrInfo(const CAddress &addrIn, const CNetAddr &addrSource) : CAddress(addrIn), source(addrSource)
+    {
+        Init();
+    }
+
+    CAddrInfo() : CAddress(), source()
+    {
+        Init();
+    }
+
+    //! Calculate in which "tried" bucket this entry belongs
+    int GetTriedBucket(const uint256 &nKey) const;
+
+    //! Calculate in which "new" bucket this entry belongs, given a certain source
+    int GetNewBucket(const uint256 &nKey, const CNetAddr& src) const;
+
+    //! Calculate in which "new" bucket this entry belongs, using its default source
+    int GetNewBucket(const uint256 &nKey) const
+    {
+        return GetNewBucket(nKey, source);
+    }
+
+    //! Calculate in which position of a bucket to store this entry.
+    int GetBucketPosition(const uint256 &nKey, bool fNew, int nBucket) const;
+
+    //! Determine whether the statistics about this entry are bad enough so that it can just be deleted
+    bool IsTerrible(int64_t nNow = GetTime()) const;
+
+    //! Calculate the relative chance this entry should be given when selecting nodes to connect to
+    double GetChance(int64_t nNow = GetTime()) const;
+
+};
+
+/** Stochastic address manager
+ *
+ * Design goals:
+ *  * Keep the address tables in-memory, and asynchronously dump the entire table to peers.dat.
+ *  * Make sure no (localized) attacker can fill the entire table with his nodes/addresses.
+ *
+ * To that end:
+ *  * Addresses are organized into buckets.
+ *    * Addresses that have not yet been tried go into 1024 "new" buckets.
+ *      * Based on the address range (/16 for IPv4) of the source of information, 64 buckets are selected at random.
+ *      * The actual bucket is chosen from one of these, based on the range in which the address itself is located.
+ *      * One single address can occur in up to 8 different buckets to increase selection chances for addresses that
+ *        are seen frequently. The chance for increasing this multiplicity decreases exponentially.
+ *      * When adding a new address to a full bucket, a randomly chosen entry (with a bias favoring less recently seen
+ *        ones) is removed from it first.
+ *    * Addresses of nodes that are known to be accessible go into 256 "tried" buckets.
+ *      * Each address range selects at random 8 of these buckets.
+ *      * The actual bucket is chosen from one of these, based on the full address.
+ *      * When adding a new good address to a full bucket, a randomly chosen entry (with a bias favoring less recently
+ *        tried ones) is evicted from it, back to the "new" buckets.
+ *    * Bucket selection is based on cryptographic hashing, using a randomly-generated 256-bit key, which should not
+ *      be observable by adversaries.
+ *    * Several indexes are kept for high performance. Defining DEBUG_ADDRMAN will introduce frequent (and expensive)
+ *      consistency checks for the entire data structure.
+ */
+
+//! total number of buckets for tried addresses
+#define ADDRMAN_TRIED_BUCKET_COUNT_LOG2 8
+
+//! total number of buckets for new addresses
+#define ADDRMAN_NEW_BUCKET_COUNT_LOG2 10
+
+//! maximum allowed number of entries in buckets for new and tried addresses
+#define ADDRMAN_BUCKET_SIZE_LOG2 6
+
+//! over how many buckets entries with tried addresses from a single group (/16 for IPv4) are spread
+#define ADDRMAN_TRIED_BUCKETS_PER_GROUP 8
+
+//! over how many buckets entries with new addresses originating from a single group are spread
+#define ADDRMAN_NEW_BUCKETS_PER_SOURCE_GROUP 64
+
+//! in how many buckets for entries with new addresses a single address may occur
+#define ADDRMAN_NEW_BUCKETS_PER_ADDRESS 8
+
+//! how old addresses can maximally be
+#define ADDRMAN_HORIZON_DAYS 30
+
+//! after how many failed attempts we give up on a new node
+#define ADDRMAN_RETRIES 3
+
+//! how many successive failures are allowed ...
+#define ADDRMAN_MAX_FAILURES 10
+
+//! ... in at least this many days
+#define ADDRMAN_MIN_FAIL_DAYS 7
+
+//! the maximum percentage of nodes to return in a getaddr call
+#define ADDRMAN_GETADDR_MAX_PCT 23
+
+//! the maximum number of nodes to return in a getaddr call
+#define ADDRMAN_GETADDR_MAX 2500
+
+//! Convenience
+#define ADDRMAN_TRIED_BUCKET_COUNT (1 << ADDRMAN_TRIED_BUCKET_COUNT_LOG2)
+#define ADDRMAN_NEW_BUCKET_COUNT (1 << ADDRMAN_NEW_BUCKET_COUNT_LOG2)
+#define ADDRMAN_BUCKET_SIZE (1 << ADDRMAN_BUCKET_SIZE_LOG2)
+
+/** 
+ * Stochastical (IP) address manager 
+ */
+class CAddrMan
+{
+private:
+    //! critical section to protect the inner data structures
+    mutable CCriticalSection cs;
+
+    //! last used nId
+    int nIdCount;
+
+    //! table with information about all nIds
+    std::map<int, CAddrInfo> mapInfo;
+
+    //! find an nId based on its network address
+    std::map<CNetAddr, int> mapAddr;
+
+    //! randomly-ordered vector of all nIds
+    std::vector<int> vRandom;
+
+    // number of "tried" entries
+    int nTried;
+
+    //! list of "tried" buckets
+    int vvTried[ADDRMAN_TRIED_BUCKET_COUNT][ADDRMAN_BUCKET_SIZE];
+
+    //! number of (unique) "new" entries
+    int nNew;
+
+    //! list of "new" buckets
+    int vvNew[ADDRMAN_NEW_BUCKET_COUNT][ADDRMAN_BUCKET_SIZE];
+
+protected:
+    //! secret key to randomize bucket select with
+    uint256 nKey;
+
+    //! Source of random numbers for randomization in inner loops
+    FastRandomContext insecure_rand;
+
+    //! Find an entry.
+    CAddrInfo* Find(const CNetAddr& addr, int *pnId = NULL);
+
+    //! find an entry, creating it if necessary.
+    //! nTime and nServices of the found node are updated, if necessary.
+    CAddrInfo* Create(const CAddress &addr, const CNetAddr &addrSource, int *pnId = NULL);
+
+    //! Swap two elements in vRandom.
+    void SwapRandom(unsigned int nRandomPos1, unsigned int nRandomPos2);
+
+    //! Move an entry from the "new" table(s) to the "tried" table
+    void MakeTried(CAddrInfo& info, int nId);
+
+    //! Delete an entry. It must not be in tried, and have refcount 0.
+    void Delete(int nId);
+
+    //! Clear a position in a "new" table. This is the only place where entries are actually deleted.
+    void ClearNew(int nUBucket, int nUBucketPos);
+
+    //! Mark an entry "good", possibly moving it from "new" to "tried".
+    void Good_(const CService &addr, int64_t nTime);
+
+    //! Add an entry to the "new" table.
+    bool Add_(const CAddress &addr, const CNetAddr& source, int64_t nTimePenalty);
+
+    //! Mark an entry as attempted to connect.
+    void Attempt_(const CService &addr, int64_t nTime);
+
+    //! Select an address to connect to, if newOnly is set to true, only the new table is selected from.
+    CAddrInfo Select_(bool newOnly);
+
+    //! Wraps GetRandInt to allow tests to override RandomInt and make it deterministic.
+    virtual int RandomInt(int nMax);
+
+#ifdef DEBUG_ADDRMAN
+    //! Perform consistency check. Returns an error code or zero.
+    int Check_();
+#endif
+
+    //! Select several addresses at once.
+    void GetAddr_(std::vector<CAddress> &vAddr);
+
+    //! Mark an entry as currently-connected-to.
+    void Connected_(const CService &addr, int64_t nTime);
+
+public:
+    /**
+     * serialized format:
+     * * version byte (currently 1)
+     * * 0x20 + nKey (serialized as if it were a vector, for backward compatibility)
+     * * nNew
+     * * nTried
+     * * number of "new" buckets XOR 2**30
+     * * all nNew addrinfos in vvNew
+     * * all nTried addrinfos in vvTried
+     * * for each bucket:
+     *   * number of elements
+     *   * for each element: index
+     *
+     * 2**30 is xorred with the number of buckets to make addrman deserializer v0 detect it
+     * as incompatible. This is necessary because it did not check the version number on
+     * deserialization.
+     *
+     * Notice that vvTried, mapAddr and vVector are never encoded explicitly;
+     * they are instead reconstructed from the other information.
+     *
+     * vvNew is serialized, but only used if ADDRMAN_UNKNOWN_BUCKET_COUNT didn't change,
+     * otherwise it is reconstructed as well.
+     *
+     * This format is more complex, but significantly smaller (at most 1.5 MiB), and supports
+     * changes to the ADDRMAN_ parameters without breaking the on-disk structure.
+     *
+     * We don't use ADD_SERIALIZE_METHODS since the serialization and deserialization code has
+     * very little in common.
+     */
+    template<typename Stream>
+    void Serialize(Stream &s) const
+    {
+        LOCK(cs);
+
+        unsigned char nVersion = 1;
+        s << nVersion;
+        s << ((unsigned char)32);
+        s << nKey;
+        s << nNew;
+        s << nTried;
+
+        int nUBuckets = ADDRMAN_NEW_BUCKET_COUNT ^ (1 << 30);
+        s << nUBuckets;
+        std::map<int, int> mapUnkIds;
+        int nIds = 0;
+        for (std::map<int, CAddrInfo>::const_iterator it = mapInfo.begin(); it != mapInfo.end(); it++) {
+            mapUnkIds[(*it).first] = nIds;
+            const CAddrInfo &info = (*it).second;
+            if (info.nRefCount) {
+                assert(nIds != nNew); // this means nNew was wrong, oh ow
+                s << info;
+                nIds++;
+            }
+        }
+        nIds = 0;
+        for (std::map<int, CAddrInfo>::const_iterator it = mapInfo.begin(); it != mapInfo.end(); it++) {
+            const CAddrInfo &info = (*it).second;
+            if (info.fInTried) {
+                assert(nIds != nTried); // this means nTried was wrong, oh ow
+                s << info;
+                nIds++;
+            }
+        }
+        for (int bucket = 0; bucket < ADDRMAN_NEW_BUCKET_COUNT; bucket++) {
+            int nSize = 0;
+            for (int i = 0; i < ADDRMAN_BUCKET_SIZE; i++) {
+                if (vvNew[bucket][i] != -1)
+                    nSize++;
+            }
+            s << nSize;
+            for (int i = 0; i < ADDRMAN_BUCKET_SIZE; i++) {
+                if (vvNew[bucket][i] != -1) {
+                    int nIndex = mapUnkIds[vvNew[bucket][i]];
+                    s << nIndex;
+                }
+            }
+        }
+    }
+
+    template<typename Stream>
+    void Unserialize(Stream& s)
+    {
+        LOCK(cs);
+
+        Clear();
+
+        unsigned char nVersion;
+        s >> nVersion;
+        unsigned char nKeySize;
+        s >> nKeySize;
+        if (nKeySize != 32) throw std::ios_base::failure("Incorrect keysize in addrman deserialization");
+        s >> nKey;
+        s >> nNew;
+        s >> nTried;
+        int nUBuckets = 0;
+        s >> nUBuckets;
+        if (nVersion != 0) {
+            nUBuckets ^= (1 << 30);
+        }
+
+        if (nNew > ADDRMAN_NEW_BUCKET_COUNT * ADDRMAN_BUCKET_SIZE) {
+            throw std::ios_base::failure("Corrupt CAddrMan serialization, nNew exceeds limit.");
+        }
+
+        if (nTried > ADDRMAN_TRIED_BUCKET_COUNT * ADDRMAN_BUCKET_SIZE) {
+            throw std::ios_base::failure("Corrupt CAddrMan serialization, nTried exceeds limit.");
+        }
+
+        // Deserialize entries from the new table.
+        for (int n = 0; n < nNew; n++) {
+            CAddrInfo &info = mapInfo[n];
+            s >> info;
+            mapAddr[info] = n;
+            info.nRandomPos = vRandom.size();
+            vRandom.push_back(n);
+            if (nVersion != 1 || nUBuckets != ADDRMAN_NEW_BUCKET_COUNT) {
+                // In case the new table data cannot be used (nVersion unknown, or bucket count wrong),
+                // immediately try to give them a reference based on their primary source address.
+                int nUBucket = info.GetNewBucket(nKey);
+                int nUBucketPos = info.GetBucketPosition(nKey, true, nUBucket);
+                if (vvNew[nUBucket][nUBucketPos] == -1) {
+                    vvNew[nUBucket][nUBucketPos] = n;
+                    info.nRefCount++;
+                }
+            }
+        }
+        nIdCount = nNew;
+
+        // Deserialize entries from the tried table.
+        int nLost = 0;
+        for (int n = 0; n < nTried; n++) {
+            CAddrInfo info;
+            s >> info;
+            int nKBucket = info.GetTriedBucket(nKey);
+            int nKBucketPos = info.GetBucketPosition(nKey, false, nKBucket);
+            if (vvTried[nKBucket][nKBucketPos] == -1) {
+                info.nRandomPos = vRandom.size();
+                info.fInTried = true;
+                vRandom.push_back(nIdCount);
+                mapInfo[nIdCount] = info;
+                mapAddr[info] = nIdCount;
+                vvTried[nKBucket][nKBucketPos] = nIdCount;
+                nIdCount++;
+            } else {
+                nLost++;
+            }
+        }
+        nTried -= nLost;
+
+        // Deserialize positions in the new table (if possible).
+        for (int bucket = 0; bucket < nUBuckets; bucket++) {
+            int nSize = 0;
+            s >> nSize;
+            for (int n = 0; n < nSize; n++) {
+                int nIndex = 0;
+                s >> nIndex;
+                if (nIndex >= 0 && nIndex < nNew) {
+                    CAddrInfo &info = mapInfo[nIndex];
+                    int nUBucketPos = info.GetBucketPosition(nKey, true, bucket);
+                    if (nVersion == 1 && nUBuckets == ADDRMAN_NEW_BUCKET_COUNT && vvNew[bucket][nUBucketPos] == -1 && info.nRefCount < ADDRMAN_NEW_BUCKETS_PER_ADDRESS) {
+                        info.nRefCount++;
+                        vvNew[bucket][nUBucketPos] = nIndex;
+                    }
+                }
+            }
+        }
+
+        // Prune new entries with refcount 0 (as a result of collisions).
+        int nLostUnk = 0;
+        for (std::map<int, CAddrInfo>::const_iterator it = mapInfo.begin(); it != mapInfo.end(); ) {
+            if (it->second.fInTried == false && it->second.nRefCount == 0) {
+                std::map<int, CAddrInfo>::const_iterator itCopy = it++;
+                Delete(itCopy->first);
+                nLostUnk++;
+            } else {
+                it++;
+            }
+        }
+        if (nLost + nLostUnk > 0) {
+            LogPrint("addrman", "addrman lost %i new and %i tried addresses due to collisions\n", nLostUnk, nLost);
+        }
+
+        Check();
+    }
+
+    void Clear()
+    {
+        LOCK(cs);
+        std::vector<int>().swap(vRandom);
+        nKey = GetRandHash();
+        for (size_t bucket = 0; bucket < ADDRMAN_NEW_BUCKET_COUNT; bucket++) {
+            for (size_t entry = 0; entry < ADDRMAN_BUCKET_SIZE; entry++) {
+                vvNew[bucket][entry] = -1;
+            }
+        }
+        for (size_t bucket = 0; bucket < ADDRMAN_TRIED_BUCKET_COUNT; bucket++) {
+            for (size_t entry = 0; entry < ADDRMAN_BUCKET_SIZE; entry++) {
+                vvTried[bucket][entry] = -1;
+            }
+        }
+
+        nIdCount = 0;
+        nTried = 0;
+        nNew = 0;
+    }
+
+    CAddrMan()
+    {
+        Clear();
+    }
+
+    ~CAddrMan()
+    {
+        nKey.SetNull();
+    }
+
+    //! Return the number of (unique) addresses in all tables.
+    size_t size() const
+    {
+        LOCK(cs); // TODO: Cache this in an atomic to avoid this overhead
+        return vRandom.size();
+    }
+
+    //! Consistency check
+    void Check()
+    {
+#ifdef DEBUG_ADDRMAN
+        {
+            LOCK(cs);
+            int err;
+            if ((err=Check_()))
+                LogPrintf("ADDRMAN CONSISTENCY CHECK FAILED!!! err=%i\n", err);
+        }
+#endif
+    }
+
+    //! Add a single address.
+    bool Add(const CAddress &addr, const CNetAddr& source, int64_t nTimePenalty = 0)
+    {
+        LOCK(cs);
+        bool fRet = false;
+        Check();
+        fRet |= Add_(addr, source, nTimePenalty);
+        Check();
+        if (fRet)
+            LogPrint("addrman", "Added %s from %s: %i tried, %i new\n", addr.ToStringIPPort(), source.ToString(), nTried, nNew);
+        return fRet;
+    }
+
+    //! Add multiple addresses.
+    bool Add(const std::vector<CAddress> &vAddr, const CNetAddr& source, int64_t nTimePenalty = 0)
+    {
+        LOCK(cs);
+        int nAdd = 0;
+        Check();
+        for (std::vector<CAddress>::const_iterator it = vAddr.begin(); it != vAddr.end(); it++)
+            nAdd += Add_(*it, source, nTimePenalty) ? 1 : 0;
+        Check();
+        if (nAdd)
+            LogPrint("addrman", "Added %i addresses from %s: %i tried, %i new\n", nAdd, source.ToString(), nTried, nNew);
+        return nAdd > 0;
+    }
+
+    //! Mark an entry as accessible.
+    void Good(const CService &addr, int64_t nTime = GetTime())
+    {
+        LOCK(cs);
+        Check();
+        Good_(addr, nTime);
+        Check();
+    }
+
+    //! Mark an entry as connection attempted to.
+    void Attempt(const CService &addr, int64_t nTime = GetTime())
+    {
+        LOCK(cs);
+        Check();
+        Attempt_(addr, nTime);
+        Check();
+    }
+
+    /**
+     * Choose an address to connect to.
+     */
+    CAddrInfo Select(bool newOnly = false)
+    {
+        CAddrInfo addrRet;
+        {
+            LOCK(cs);
+            Check();
+            addrRet = Select_(newOnly);
+            Check();
+        }
+        return addrRet;
+    }
+
+    //! Return a bunch of addresses, selected at random.
+    std::vector<CAddress> GetAddr()
+    {
+        Check();
+        std::vector<CAddress> vAddr;
+        {
+            LOCK(cs);
+            GetAddr_(vAddr);
+        }
+        Check();
+        return vAddr;
+    }
+
+    //! Mark an entry as currently-connected-to.
+    void Connected(const CService &addr, int64_t nTime = GetTime())
+    {
+        LOCK(cs);
+        Check();
+        Connected_(addr, nTime);
+        Check();
+    }
+
+};
+
+#endif // BITCOIN_ADDRMAN_H
diff --git a/depend/zcash/src/alert.cpp b/depend/zcash/src/alert.cpp
new file mode 100644
index 000000000..c9fd9ee2e
--- /dev/null
+++ b/depend/zcash/src/alert.cpp
@@ -0,0 +1,284 @@
+// Copyright (c) 2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "alert.h"
+
+#include "clientversion.h"
+#include "net.h"
+#include "pubkey.h"
+#include "timedata.h"
+#include "ui_interface.h"
+#include "util.h"
+
+#include <stdint.h>
+#include <algorithm>
+#include <map>
+
+#include <boost/algorithm/string/classification.hpp>
+#include <boost/algorithm/string/replace.hpp>
+#include <boost/thread.hpp>
+
+using namespace std;
+
+map<uint256, CAlert> mapAlerts;
+CCriticalSection cs_mapAlerts;
+
+void CUnsignedAlert::SetNull()
+{
+    nVersion = 1;
+    nRelayUntil = 0;
+    nExpiration = 0;
+    nID = 0;
+    nCancel = 0;
+    setCancel.clear();
+    nMinVer = 0;
+    nMaxVer = 0;
+    setSubVer.clear();
+    nPriority = 0;
+
+    strComment.clear();
+    strStatusBar.clear();
+    strRPCError.clear();
+}
+
+std::string CUnsignedAlert::ToString() const
+{
+    std::string strSetCancel;
+    for (int n : setCancel)
+        strSetCancel += strprintf("%d ", n);
+    std::string strSetSubVer;
+    for (const std::string& str : setSubVer)
+        strSetSubVer += "\"" + str + "\" ";
+    return strprintf(
+        "CAlert(\n"
+        "    nVersion     = %d\n"
+        "    nRelayUntil  = %d\n"
+        "    nExpiration  = %d\n"
+        "    nID          = %d\n"
+        "    nCancel      = %d\n"
+        "    setCancel    = %s\n"
+        "    nMinVer      = %d\n"
+        "    nMaxVer      = %d\n"
+        "    setSubVer    = %s\n"
+        "    nPriority    = %d\n"
+        "    strComment   = \"%s\"\n"
+        "    strStatusBar = \"%s\"\n"
+        "    strRPCError  = \"%s\"\n"
+        ")\n",
+        nVersion,
+        nRelayUntil,
+        nExpiration,
+        nID,
+        nCancel,
+        strSetCancel,
+        nMinVer,
+        nMaxVer,
+        strSetSubVer,
+        nPriority,
+        strComment,
+        strStatusBar,
+        strRPCError);
+}
+
+void CAlert::SetNull()
+{
+    CUnsignedAlert::SetNull();
+    vchMsg.clear();
+    vchSig.clear();
+}
+
+bool CAlert::IsNull() const
+{
+    return (nExpiration == 0);
+}
+
+uint256 CAlert::GetHash() const
+{
+    return Hash(this->vchMsg.begin(), this->vchMsg.end());
+}
+
+bool CAlert::IsInEffect() const
+{
+    return (GetTime() < nExpiration);
+}
+
+bool CAlert::Cancels(const CAlert& alert) const
+{
+    if (!IsInEffect())
+        return false; // this was a no-op before 31403
+    return (alert.nID <= nCancel || setCancel.count(alert.nID));
+}
+
+bool CAlert::AppliesTo(int nVersion, const std::string& strSubVerIn) const
+{
+    // Get a subversion without comments
+    std::string strSubVer = "";
+    auto start = 0;
+    auto end = 0;
+    while (start < strSubVerIn.length() && end < strSubVerIn.length()) {
+        end = strSubVerIn.find('(', start);
+        if (end == std::string::npos) {
+            // Ensure we get the section of strSubVerIn after the final comment
+            end = strSubVerIn.length();
+        }
+        strSubVer.append(strSubVerIn.substr(start, end - start));
+        start = strSubVerIn.find(')', end);
+        if (start != std::string::npos) {
+            // Finish with start pointing at the next character we want
+            start += 1;
+        }
+    }
+    // Check against both the commented and uncommented subversion
+    // TODO: rework for client-version-embedded-in-strSubVer ?
+    return (IsInEffect() &&
+            nMinVer <= nVersion && nVersion <= nMaxVer &&
+            (setSubVer.empty() || setSubVer.count(strSubVerIn) || setSubVer.count(strSubVer)));
+}
+
+bool CAlert::AppliesToMe() const
+{
+    return AppliesTo(PROTOCOL_VERSION, FormatSubVersion(CLIENT_NAME, CLIENT_VERSION, std::vector<std::string>()));
+}
+
+bool CAlert::RelayTo(CNode* pnode) const
+{
+    if (!IsInEffect())
+        return false;
+    // don't relay to nodes which haven't sent their version message
+    if (pnode->nVersion == 0)
+        return false;
+    // returns true if wasn't already contained in the set
+    if (pnode->setKnown.insert(GetHash()).second)
+    {
+        if (AppliesTo(pnode->nVersion, pnode->strSubVer) ||
+            AppliesToMe() ||
+            GetTime() < nRelayUntil)
+        {
+            pnode->PushMessage("alert", *this);
+            return true;
+        }
+    }
+    return false;
+}
+
+bool CAlert::CheckSignature(const std::vector<unsigned char>& alertKey) const
+{
+    CPubKey key(alertKey);
+    if (!key.Verify(Hash(vchMsg.begin(), vchMsg.end()), vchSig))
+        return error("CAlert::CheckSignature(): verify signature failed");
+
+    // Now unserialize the data
+    CDataStream sMsg(vchMsg, SER_NETWORK, PROTOCOL_VERSION);
+    sMsg >> *(CUnsignedAlert*)this;
+    return true;
+}
+
+CAlert CAlert::getAlertByHash(const uint256 &hash)
+{
+    CAlert retval;
+    {
+        LOCK(cs_mapAlerts);
+        map<uint256, CAlert>::iterator mi = mapAlerts.find(hash);
+        if(mi != mapAlerts.end())
+            retval = mi->second;
+    }
+    return retval;
+}
+
+bool CAlert::ProcessAlert(const std::vector<unsigned char>& alertKey, bool fThread)
+{
+    if (!CheckSignature(alertKey))
+        return false;
+    if (!IsInEffect())
+        return false;
+
+    // alert.nID=max is reserved for if the alert key is
+    // compromised. It must have a pre-defined message,
+    // must never expire, must apply to all versions,
+    // and must cancel all previous
+    // alerts or it will be ignored (so an attacker can't
+    // send an "everything is OK, don't panic" version that
+    // cannot be overridden):
+    int maxInt = std::numeric_limits<int>::max();
+    if (nID == maxInt)
+    {
+        if (!(
+                nExpiration == maxInt &&
+                nCancel == (maxInt-1) &&
+                nMinVer == 0 &&
+                nMaxVer == maxInt &&
+                setSubVer.empty() &&
+                nPriority == maxInt &&
+                strStatusBar == "URGENT: Alert key compromised, upgrade required"
+                ))
+            return false;
+    }
+
+    {
+        LOCK(cs_mapAlerts);
+        // Cancel previous alerts
+        for (map<uint256, CAlert>::iterator mi = mapAlerts.begin(); mi != mapAlerts.end();)
+        {
+            const CAlert& alert = (*mi).second;
+            if (Cancels(alert))
+            {
+                LogPrint("alert", "cancelling alert %d\n", alert.nID);
+                uiInterface.NotifyAlertChanged((*mi).first, CT_DELETED);
+                mi = mapAlerts.erase(mi);
+            }
+            else if (!alert.IsInEffect())
+            {
+                LogPrint("alert", "expiring alert %d\n", alert.nID);
+                uiInterface.NotifyAlertChanged((*mi).first, CT_DELETED);
+                mi = mapAlerts.erase(mi);
+            }
+            else
+                mi++;
+        }
+
+        // Check if this alert has been cancelled
+        for (std::pair<const uint256, CAlert>& item : mapAlerts)
+        {
+            const CAlert& alert = item.second;
+            if (alert.Cancels(*this))
+            {
+                LogPrint("alert", "alert already cancelled by %d\n", alert.nID);
+                return false;
+            }
+        }
+
+        // Add to mapAlerts
+        mapAlerts.insert(make_pair(GetHash(), *this));
+        // Notify UI and -alertnotify if it applies to me
+        if(AppliesToMe())
+        {
+            uiInterface.NotifyAlertChanged(GetHash(), CT_NEW);
+            Notify(strStatusBar, fThread);
+        }
+    }
+
+    LogPrint("alert", "accepted alert %d, AppliesToMe()=%d\n", nID, AppliesToMe());
+    return true;
+}
+
+void
+CAlert::Notify(const std::string& strMessage, bool fThread)
+{
+    std::string strCmd = GetArg("-alertnotify", "");
+    if (strCmd.empty()) return;
+
+    // Alert text should be plain ascii coming from a trusted source, but to
+    // be safe we first strip anything not in safeChars, then add single quotes around
+    // the whole string before passing it to the shell:
+    std::string singleQuote("'");
+    std::string safeStatus = SanitizeString(strMessage);
+    safeStatus = singleQuote+safeStatus+singleQuote;
+    boost::replace_all(strCmd, "%s", safeStatus);
+
+    if (fThread)
+        boost::thread t(runCommand, strCmd); // thread runs free
+    else
+        runCommand(strCmd);
+}
diff --git a/depend/zcash/src/alert.h b/depend/zcash/src/alert.h
new file mode 100644
index 000000000..8cc1165b1
--- /dev/null
+++ b/depend/zcash/src/alert.h
@@ -0,0 +1,115 @@
+// Copyright (c) 2010 Satoshi Nakamoto
+// Copyright (c) 2009-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_ALERT_H
+#define BITCOIN_ALERT_H
+
+#include "serialize.h"
+#include "sync.h"
+
+#include <map>
+#include <set>
+#include <stdint.h>
+#include <string>
+
+/** Minimum alert priority for enabling safe mode. */
+static const int ALERT_PRIORITY_SAFE_MODE = 4000;
+
+class CAlert;
+class CNode;
+class uint256;
+
+extern std::map<uint256, CAlert> mapAlerts;
+extern CCriticalSection cs_mapAlerts;
+
+/** Alerts are for notifying old versions if they become too obsolete and
+ * need to upgrade.  The message is displayed in the status bar.
+ * Alert messages are broadcast as a vector of signed data.  Unserializing may
+ * not read the entire buffer if the alert is for a newer version, but older
+ * versions can still relay the original data.
+ */
+class CUnsignedAlert
+{
+public:
+    int nVersion;
+    int64_t nRelayUntil;      // when newer nodes stop relaying to newer nodes
+    int64_t nExpiration;
+    int nID;
+    int nCancel;
+    std::set<int> setCancel;
+    int nMinVer;            // lowest version inclusive
+    int nMaxVer;            // highest version inclusive
+    std::set<std::string> setSubVer;  // empty matches all
+    int nPriority;
+
+    // Actions
+    std::string strComment;
+    std::string strStatusBar;
+    std::string strRPCError;
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(this->nVersion);
+        READWRITE(nRelayUntil);
+        READWRITE(nExpiration);
+        READWRITE(nID);
+        READWRITE(nCancel);
+        READWRITE(setCancel);
+        READWRITE(nMinVer);
+        READWRITE(nMaxVer);
+        READWRITE(setSubVer);
+        READWRITE(nPriority);
+
+        READWRITE(LIMITED_STRING(strComment, 65536));
+        READWRITE(LIMITED_STRING(strStatusBar, 256));
+        READWRITE(LIMITED_STRING(strRPCError, 256));
+    }
+
+    void SetNull();
+
+    std::string ToString() const;
+};
+
+/** An alert is a combination of a serialized CUnsignedAlert and a signature. */
+class CAlert : public CUnsignedAlert
+{
+public:
+    std::vector<unsigned char> vchMsg;
+    std::vector<unsigned char> vchSig;
+
+    CAlert()
+    {
+        SetNull();
+    }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(vchMsg);
+        READWRITE(vchSig);
+    }
+
+    void SetNull();
+    bool IsNull() const;
+    uint256 GetHash() const;
+    bool IsInEffect() const;
+    bool Cancels(const CAlert& alert) const;
+    bool AppliesTo(int nVersion, const std::string& strSubVerIn) const;
+    bool AppliesToMe() const;
+    bool RelayTo(CNode* pnode) const;
+    bool CheckSignature(const std::vector<unsigned char>& alertKey) const;
+    bool ProcessAlert(const std::vector<unsigned char>& alertKey, bool fThread = true); // fThread means run -alertnotify in a free-running thread
+    static void Notify(const std::string& strMessage, bool fThread);
+
+    /*
+     * Get copy of (active) alert object by hash. Returns a null alert if it is not found.
+     */
+    static CAlert getAlertByHash(const uint256 &hash);
+};
+
+#endif // BITCOIN_ALERT_H
diff --git a/depend/zcash/src/alertkeys.h b/depend/zcash/src/alertkeys.h
new file mode 100644
index 000000000..32d26638e
--- /dev/null
+++ b/depend/zcash/src/alertkeys.h
@@ -0,0 +1,10 @@
+#ifndef BITCOIN_ALERTKEYS_H
+#define BITCOIN_ALERTKEYS_H
+
+// REMINDER: DO NOT COMMIT YOUR PRIVATE KEYS TO THE GIT REPOSITORY!
+
+const char* pszPrivKey = "000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000";
+const char* pszTestNetPrivKey = "000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000";
+
+#endif
+
diff --git a/depend/zcash/src/amount.cpp b/depend/zcash/src/amount.cpp
new file mode 100644
index 000000000..93da7104e
--- /dev/null
+++ b/depend/zcash/src/amount.cpp
@@ -0,0 +1,40 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "amount.h"
+#include "policy/fees.h"
+
+#include "tinyformat.h"
+
+const std::string CURRENCY_UNIT = "ZEC";
+const std::string MINOR_CURRENCY_UNIT = "zatoshis";
+
+CFeeRate::CFeeRate(const CAmount& nFeePaid, size_t nSize)
+{
+    if (nSize > 0)
+        nSatoshisPerK = nFeePaid*1000/nSize;
+    else
+        nSatoshisPerK = 0;
+}
+
+CAmount CFeeRate::GetFeeForRelay(size_t nSize) const
+{
+    return std::min(GetFee(nSize), DEFAULT_FEE);
+}
+
+CAmount CFeeRate::GetFee(size_t nSize) const
+{
+    CAmount nFee = nSatoshisPerK*nSize / 1000;
+
+    if (nFee == 0 && nSatoshisPerK > 0)
+        nFee = nSatoshisPerK;
+
+    return nFee;
+}
+
+std::string CFeeRate::ToString() const
+{
+    return strprintf("%d.%08d %s/kB", nSatoshisPerK / COIN, nSatoshisPerK % COIN, CURRENCY_UNIT);
+}
diff --git a/depend/zcash/src/amount.h b/depend/zcash/src/amount.h
new file mode 100644
index 000000000..407bd4057
--- /dev/null
+++ b/depend/zcash/src/amount.h
@@ -0,0 +1,67 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_AMOUNT_H
+#define BITCOIN_AMOUNT_H
+
+#include "serialize.h"
+
+#include <stdlib.h>
+#include <string>
+
+typedef int64_t CAmount;
+
+static const CAmount COIN = 100000000;
+static const CAmount CENT = 1000000;
+
+extern const std::string CURRENCY_UNIT;
+extern const std::string MINOR_CURRENCY_UNIT;
+
+/** No amount larger than this (in zatoshi) is valid.
+ *
+ * Note that this constant is *not* the total money supply, which in Bitcoin
+ * currently happens to be less than 21,000,000 BTC for various reasons, but
+ * rather a sanity check. As this sanity check is used by consensus-critical
+ * validation code, the exact value of the MAX_MONEY constant is consensus
+ * critical; in unusual circumstances like a(nother) overflow bug that allowed
+ * for the creation of coins out of thin air modification could lead to a fork.
+ * */
+static const CAmount MAX_MONEY = 21000000 * COIN;
+inline bool MoneyRange(const CAmount& nValue) { return (nValue >= 0 && nValue <= MAX_MONEY); }
+
+/** Type-safe wrapper class to for fee rates
+ * (how much to pay based on transaction size)
+ */
+class CFeeRate
+{
+private:
+    CAmount nSatoshisPerK; // unit is zatoshis-per-1,000-bytes
+public:
+    CFeeRate() : nSatoshisPerK(0) { }
+    explicit CFeeRate(const CAmount& _nSatoshisPerK): nSatoshisPerK(_nSatoshisPerK) { }
+    CFeeRate(const CAmount& nFeePaid, size_t nSize);
+    CFeeRate(const CFeeRate& other) { nSatoshisPerK = other.nSatoshisPerK; }
+
+    CAmount GetFeeForRelay(size_t size) const; // unit returned is zatoshis
+    CAmount GetFee(size_t size) const; // unit returned is zatoshis
+    CAmount GetFeePerK() const { return GetFee(1000); } // zatoshis-per-1000-bytes
+
+    friend bool operator<(const CFeeRate& a, const CFeeRate& b) { return a.nSatoshisPerK < b.nSatoshisPerK; }
+    friend bool operator>(const CFeeRate& a, const CFeeRate& b) { return a.nSatoshisPerK > b.nSatoshisPerK; }
+    friend bool operator==(const CFeeRate& a, const CFeeRate& b) { return a.nSatoshisPerK == b.nSatoshisPerK; }
+    friend bool operator<=(const CFeeRate& a, const CFeeRate& b) { return a.nSatoshisPerK <= b.nSatoshisPerK; }
+    friend bool operator>=(const CFeeRate& a, const CFeeRate& b) { return a.nSatoshisPerK >= b.nSatoshisPerK; }
+    CFeeRate& operator+=(const CFeeRate& a) { nSatoshisPerK += a.nSatoshisPerK; return *this; }
+    std::string ToString() const;
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(nSatoshisPerK);
+    }
+};
+
+#endif //  BITCOIN_AMOUNT_H
diff --git a/depend/zcash/src/arith_uint256.cpp b/depend/zcash/src/arith_uint256.cpp
new file mode 100644
index 000000000..6c2f8dbea
--- /dev/null
+++ b/depend/zcash/src/arith_uint256.cpp
@@ -0,0 +1,261 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "arith_uint256.h"
+
+#include "uint256.h"
+#include "utilstrencodings.h"
+#include "crypto/common.h"
+
+#include <stdio.h>
+#include <string.h>
+
+template <unsigned int BITS>
+base_uint<BITS>::base_uint(const std::string& str)
+{
+    SetHex(str);
+}
+
+template <unsigned int BITS>
+base_uint<BITS>& base_uint<BITS>::operator<<=(unsigned int shift)
+{
+    base_uint<BITS> a(*this);
+    for (int i = 0; i < WIDTH; i++)
+        pn[i] = 0;
+    int k = shift / 32;
+    shift = shift % 32;
+    for (int i = 0; i < WIDTH; i++) {
+        if (i + k + 1 < WIDTH && shift != 0)
+            pn[i + k + 1] |= (a.pn[i] >> (32 - shift));
+        if (i + k < WIDTH)
+            pn[i + k] |= (a.pn[i] << shift);
+    }
+    return *this;
+}
+
+template <unsigned int BITS>
+base_uint<BITS>& base_uint<BITS>::operator>>=(unsigned int shift)
+{
+    base_uint<BITS> a(*this);
+    for (int i = 0; i < WIDTH; i++)
+        pn[i] = 0;
+    int k = shift / 32;
+    shift = shift % 32;
+    for (int i = 0; i < WIDTH; i++) {
+        if (i - k - 1 >= 0 && shift != 0)
+            pn[i - k - 1] |= (a.pn[i] << (32 - shift));
+        if (i - k >= 0)
+            pn[i - k] |= (a.pn[i] >> shift);
+    }
+    return *this;
+}
+
+template <unsigned int BITS>
+base_uint<BITS>& base_uint<BITS>::operator*=(uint32_t b32)
+{
+    uint64_t carry = 0;
+    for (int i = 0; i < WIDTH; i++) {
+        uint64_t n = carry + (uint64_t)b32 * pn[i];
+        pn[i] = n & 0xffffffff;
+        carry = n >> 32;
+    }
+    return *this;
+}
+
+template <unsigned int BITS>
+base_uint<BITS>& base_uint<BITS>::operator*=(const base_uint& b)
+{
+    base_uint<BITS> a = *this;
+    *this = 0;
+    for (int j = 0; j < WIDTH; j++) {
+        uint64_t carry = 0;
+        for (int i = 0; i + j < WIDTH; i++) {
+            uint64_t n = carry + pn[i + j] + (uint64_t)a.pn[j] * b.pn[i];
+            pn[i + j] = n & 0xffffffff;
+            carry = n >> 32;
+        }
+    }
+    return *this;
+}
+
+template <unsigned int BITS>
+base_uint<BITS>& base_uint<BITS>::operator/=(const base_uint& b)
+{
+    base_uint<BITS> div = b;     // make a copy, so we can shift.
+    base_uint<BITS> num = *this; // make a copy, so we can subtract.
+    *this = 0;                   // the quotient.
+    int num_bits = num.bits();
+    int div_bits = div.bits();
+    if (div_bits == 0)
+        throw uint_error("Division by zero");
+    if (div_bits > num_bits) // the result is certainly 0.
+        return *this;
+    int shift = num_bits - div_bits;
+    div <<= shift; // shift so that div and num align.
+    while (shift >= 0) {
+        if (num >= div) {
+            num -= div;
+            pn[shift / 32] |= (1 << (shift & 31)); // set a bit of the result.
+        }
+        div >>= 1; // shift back.
+        shift--;
+    }
+    // num now contains the remainder of the division.
+    return *this;
+}
+
+template <unsigned int BITS>
+int base_uint<BITS>::CompareTo(const base_uint<BITS>& b) const
+{
+    for (int i = WIDTH - 1; i >= 0; i--) {
+        if (pn[i] < b.pn[i])
+            return -1;
+        if (pn[i] > b.pn[i])
+            return 1;
+    }
+    return 0;
+}
+
+template <unsigned int BITS>
+bool base_uint<BITS>::EqualTo(uint64_t b) const
+{
+    for (int i = WIDTH - 1; i >= 2; i--) {
+        if (pn[i])
+            return false;
+    }
+    if (pn[1] != (b >> 32))
+        return false;
+    if (pn[0] != (b & 0xfffffffful))
+        return false;
+    return true;
+}
+
+template <unsigned int BITS>
+double base_uint<BITS>::getdouble() const
+{
+    double ret = 0.0;
+    double fact = 1.0;
+    for (int i = 0; i < WIDTH; i++) {
+        ret += fact * pn[i];
+        fact *= 4294967296.0;
+    }
+    return ret;
+}
+
+template <unsigned int BITS>
+std::string base_uint<BITS>::GetHex() const
+{
+    return ArithToUint256(*this).GetHex();
+}
+
+template <unsigned int BITS>
+void base_uint<BITS>::SetHex(const char* psz)
+{
+    *this = UintToArith256(uint256S(psz));
+}
+
+template <unsigned int BITS>
+void base_uint<BITS>::SetHex(const std::string& str)
+{
+    SetHex(str.c_str());
+}
+
+template <unsigned int BITS>
+std::string base_uint<BITS>::ToString() const
+{
+    return (GetHex());
+}
+
+template <unsigned int BITS>
+unsigned int base_uint<BITS>::bits() const
+{
+    for (int pos = WIDTH - 1; pos >= 0; pos--) {
+        if (pn[pos]) {
+            for (size_t bits = 31; bits > 0; bits--) {
+                if (pn[pos] & (1U << bits)) {
+                    return 32 * pos + bits + 1;
+                }
+            }
+            return 32 * pos + 1;
+        }
+    }
+    return 0;
+}
+
+// Explicit instantiations for base_uint<256>
+template base_uint<256>::base_uint(const std::string&);
+template base_uint<256>& base_uint<256>::operator<<=(unsigned int);
+template base_uint<256>& base_uint<256>::operator>>=(unsigned int);
+template base_uint<256>& base_uint<256>::operator*=(uint32_t b32);
+template base_uint<256>& base_uint<256>::operator*=(const base_uint<256>& b);
+template base_uint<256>& base_uint<256>::operator/=(const base_uint<256>& b);
+template int base_uint<256>::CompareTo(const base_uint<256>&) const;
+template bool base_uint<256>::EqualTo(uint64_t) const;
+template double base_uint<256>::getdouble() const;
+template std::string base_uint<256>::GetHex() const;
+template std::string base_uint<256>::ToString() const;
+template void base_uint<256>::SetHex(const char*);
+template void base_uint<256>::SetHex(const std::string&);
+template unsigned int base_uint<256>::bits() const;
+
+// This implementation directly uses shifts instead of going
+// through an intermediate MPI representation.
+arith_uint256& arith_uint256::SetCompact(uint32_t nCompact, bool* pfNegative, bool* pfOverflow)
+{
+    int nSize = nCompact >> 24;
+    uint32_t nWord = nCompact & 0x007fffff;
+    if (nSize <= 3) {
+        nWord >>= 8 * (3 - nSize);
+        *this = nWord;
+    } else {
+        *this = nWord;
+        *this <<= 8 * (nSize - 3);
+    }
+    if (pfNegative)
+        *pfNegative = nWord != 0 && (nCompact & 0x00800000) != 0;
+    if (pfOverflow)
+        *pfOverflow = nWord != 0 && ((nSize > 34) ||
+                                     (nWord > 0xff && nSize > 33) ||
+                                     (nWord > 0xffff && nSize > 32));
+    return *this;
+}
+
+uint32_t arith_uint256::GetCompact(bool fNegative) const
+{
+    int nSize = (bits() + 7) / 8;
+    uint32_t nCompact = 0;
+    if (nSize <= 3) {
+        nCompact = GetLow64() << 8 * (3 - nSize);
+    } else {
+        arith_uint256 bn = *this >> 8 * (nSize - 3);
+        nCompact = bn.GetLow64();
+    }
+    // The 0x00800000 bit denotes the sign.
+    // Thus, if it is already set, divide the mantissa by 256 and increase the exponent.
+    if (nCompact & 0x00800000) {
+        nCompact >>= 8;
+        nSize++;
+    }
+    assert((nCompact & ~0x007fffff) == 0);
+    assert(nSize < 256);
+    nCompact |= nSize << 24;
+    nCompact |= (fNegative && (nCompact & 0x007fffff) ? 0x00800000 : 0);
+    return nCompact;
+}
+
+uint256 ArithToUint256(const arith_uint256 &a)
+{
+    uint256 b;
+    for(int x=0; x<a.WIDTH; ++x)
+        WriteLE32(b.begin() + x*4, a.pn[x]);
+    return b;
+}
+arith_uint256 UintToArith256(const uint256 &a)
+{
+    arith_uint256 b;
+    for(int x=0; x<b.WIDTH; ++x)
+        b.pn[x] = ReadLE32(a.begin() + x*4);
+    return b;
+}
diff --git a/depend/zcash/src/arith_uint256.h b/depend/zcash/src/arith_uint256.h
new file mode 100644
index 000000000..833d41ef2
--- /dev/null
+++ b/depend/zcash/src/arith_uint256.h
@@ -0,0 +1,290 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_ARITH_UINT256_H
+#define BITCOIN_ARITH_UINT256_H
+
+#include <assert.h>
+#include <cstring>
+#include <stdexcept>
+#include <stdint.h>
+#include <string>
+#include <vector>
+
+class uint256;
+
+class uint_error : public std::runtime_error {
+public:
+    explicit uint_error(const std::string& str) : std::runtime_error(str) {}
+};
+
+/** Template base class for unsigned big integers. */
+template<unsigned int BITS>
+class base_uint
+{
+protected:
+    enum { WIDTH=BITS/32 };
+    uint32_t pn[WIDTH];
+public:
+
+    base_uint()
+    {
+        for (int i = 0; i < WIDTH; i++)
+            pn[i] = 0;
+    }
+
+    base_uint(const base_uint& b)
+    {
+        for (int i = 0; i < WIDTH; i++)
+            pn[i] = b.pn[i];
+    }
+
+    base_uint& operator=(const base_uint& b)
+    {
+        for (int i = 0; i < WIDTH; i++)
+            pn[i] = b.pn[i];
+        return *this;
+    }
+
+    base_uint(uint64_t b)
+    {
+        pn[0] = (unsigned int)b;
+        pn[1] = (unsigned int)(b >> 32);
+        for (int i = 2; i < WIDTH; i++)
+            pn[i] = 0;
+    }
+
+    explicit base_uint(const std::string& str);
+
+    bool operator!() const
+    {
+        for (int i = 0; i < WIDTH; i++)
+            if (pn[i] != 0)
+                return false;
+        return true;
+    }
+
+    const base_uint operator~() const
+    {
+        base_uint ret;
+        for (int i = 0; i < WIDTH; i++)
+            ret.pn[i] = ~pn[i];
+        return ret;
+    }
+
+    const base_uint operator-() const
+    {
+        base_uint ret;
+        for (int i = 0; i < WIDTH; i++)
+            ret.pn[i] = ~pn[i];
+        ret++;
+        return ret;
+    }
+
+    double getdouble() const;
+
+    base_uint& operator=(uint64_t b)
+    {
+        pn[0] = (unsigned int)b;
+        pn[1] = (unsigned int)(b >> 32);
+        for (int i = 2; i < WIDTH; i++)
+            pn[i] = 0;
+        return *this;
+    }
+
+    base_uint& operator^=(const base_uint& b)
+    {
+        for (int i = 0; i < WIDTH; i++)
+            pn[i] ^= b.pn[i];
+        return *this;
+    }
+
+    base_uint& operator&=(const base_uint& b)
+    {
+        for (int i = 0; i < WIDTH; i++)
+            pn[i] &= b.pn[i];
+        return *this;
+    }
+
+    base_uint& operator|=(const base_uint& b)
+    {
+        for (int i = 0; i < WIDTH; i++)
+            pn[i] |= b.pn[i];
+        return *this;
+    }
+
+    base_uint& operator^=(uint64_t b)
+    {
+        pn[0] ^= (unsigned int)b;
+        pn[1] ^= (unsigned int)(b >> 32);
+        return *this;
+    }
+
+    base_uint& operator|=(uint64_t b)
+    {
+        pn[0] |= (unsigned int)b;
+        pn[1] |= (unsigned int)(b >> 32);
+        return *this;
+    }
+
+    base_uint& operator<<=(unsigned int shift);
+    base_uint& operator>>=(unsigned int shift);
+
+    base_uint& operator+=(const base_uint& b)
+    {
+        uint64_t carry = 0;
+        for (int i = 0; i < WIDTH; i++)
+        {
+            uint64_t n = carry + pn[i] + b.pn[i];
+            pn[i] = n & 0xffffffff;
+            carry = n >> 32;
+        }
+        return *this;
+    }
+
+    base_uint& operator-=(const base_uint& b)
+    {
+        *this += -b;
+        return *this;
+    }
+
+    base_uint& operator+=(uint64_t b64)
+    {
+        base_uint b;
+        b = b64;
+        *this += b;
+        return *this;
+    }
+
+    base_uint& operator-=(uint64_t b64)
+    {
+        base_uint b;
+        b = b64;
+        *this += -b;
+        return *this;
+    }
+
+    base_uint& operator*=(uint32_t b32);
+    base_uint& operator*=(const base_uint& b);
+    base_uint& operator/=(const base_uint& b);
+
+    base_uint& operator++()
+    {
+        // prefix operator
+        int i = 0;
+        while (++pn[i] == 0 && i < WIDTH-1)
+            i++;
+        return *this;
+    }
+
+    const base_uint operator++(int)
+    {
+        // postfix operator
+        const base_uint ret = *this;
+        ++(*this);
+        return ret;
+    }
+
+    base_uint& operator--()
+    {
+        // prefix operator
+        int i = 0;
+        while (--pn[i] == (uint32_t)-1 && i < WIDTH-1)
+            i++;
+        return *this;
+    }
+
+    const base_uint operator--(int)
+    {
+        // postfix operator
+        const base_uint ret = *this;
+        --(*this);
+        return ret;
+    }
+
+    int CompareTo(const base_uint& b) const;
+    bool EqualTo(uint64_t b) const;
+
+    friend inline const base_uint operator+(const base_uint& a, const base_uint& b) { return base_uint(a) += b; }
+    friend inline const base_uint operator-(const base_uint& a, const base_uint& b) { return base_uint(a) -= b; }
+    friend inline const base_uint operator*(const base_uint& a, const base_uint& b) { return base_uint(a) *= b; }
+    friend inline const base_uint operator/(const base_uint& a, const base_uint& b) { return base_uint(a) /= b; }
+    friend inline const base_uint operator|(const base_uint& a, const base_uint& b) { return base_uint(a) |= b; }
+    friend inline const base_uint operator&(const base_uint& a, const base_uint& b) { return base_uint(a) &= b; }
+    friend inline const base_uint operator^(const base_uint& a, const base_uint& b) { return base_uint(a) ^= b; }
+    friend inline const base_uint operator>>(const base_uint& a, int shift) { return base_uint(a) >>= shift; }
+    friend inline const base_uint operator<<(const base_uint& a, int shift) { return base_uint(a) <<= shift; }
+    friend inline const base_uint operator*(const base_uint& a, uint32_t b) { return base_uint(a) *= b; }
+    friend inline bool operator==(const base_uint& a, const base_uint& b) { return memcmp(a.pn, b.pn, sizeof(a.pn)) == 0; }
+    friend inline bool operator!=(const base_uint& a, const base_uint& b) { return memcmp(a.pn, b.pn, sizeof(a.pn)) != 0; }
+    friend inline bool operator>(const base_uint& a, const base_uint& b) { return a.CompareTo(b) > 0; }
+    friend inline bool operator<(const base_uint& a, const base_uint& b) { return a.CompareTo(b) < 0; }
+    friend inline bool operator>=(const base_uint& a, const base_uint& b) { return a.CompareTo(b) >= 0; }
+    friend inline bool operator<=(const base_uint& a, const base_uint& b) { return a.CompareTo(b) <= 0; }
+    friend inline bool operator==(const base_uint& a, uint64_t b) { return a.EqualTo(b); }
+    friend inline bool operator!=(const base_uint& a, uint64_t b) { return !a.EqualTo(b); }
+
+    std::string GetHex() const;
+    void SetHex(const char* psz);
+    void SetHex(const std::string& str);
+    std::string ToString() const;
+
+    unsigned int size() const
+    {
+        return sizeof(pn);
+    }
+
+    /**
+     * Returns the position of the highest bit set plus one, or zero if the
+     * value is zero.
+     */
+    unsigned int bits() const;
+
+    uint64_t GetLow64() const
+    {
+        assert(WIDTH >= 2);
+        return pn[0] | (uint64_t)pn[1] << 32;
+    }
+};
+
+/** 256-bit unsigned big integer. */
+class arith_uint256 : public base_uint<256> {
+public:
+    arith_uint256() {}
+    arith_uint256(const base_uint<256>& b) : base_uint<256>(b) {}
+    arith_uint256(uint64_t b) : base_uint<256>(b) {}
+    explicit arith_uint256(const std::string& str) : base_uint<256>(str) {}
+
+    /**
+     * The "compact" format is a representation of a whole
+     * number N using an unsigned 32bit number similar to a
+     * floating point format.
+     * The most significant 8 bits are the unsigned exponent of base 256.
+     * This exponent can be thought of as "number of bytes of N".
+     * The lower 23 bits are the mantissa.
+     * Bit number 24 (0x800000) represents the sign of N.
+     * N = (-1^sign) * mantissa * 256^(exponent-3)
+     *
+     * Satoshi's original implementation used BN_bn2mpi() and BN_mpi2bn().
+     * MPI uses the most significant bit of the first byte as sign.
+     * Thus 0x1234560000 is compact (0x05123456)
+     * and  0xc0de000000 is compact (0x0600c0de)
+     *
+     * Bitcoin only uses this "compact" format for encoding difficulty
+     * targets, which are unsigned 256bit quantities.  Thus, all the
+     * complexities of the sign bit and using base 256 are probably an
+     * implementation accident.
+     */
+    arith_uint256& SetCompact(uint32_t nCompact, bool *pfNegative = NULL, bool *pfOverflow = NULL);
+    uint32_t GetCompact(bool fNegative = false) const;
+
+    friend uint256 ArithToUint256(const arith_uint256 &);
+    friend arith_uint256 UintToArith256(const uint256 &);
+};
+
+uint256 ArithToUint256(const arith_uint256 &);
+arith_uint256 UintToArith256(const uint256 &);
+
+#endif // BITCOIN_ARITH_UINT256_H
diff --git a/depend/zcash/src/asyncrpcoperation.cpp b/depend/zcash/src/asyncrpcoperation.cpp
new file mode 100644
index 000000000..4fa4ddeaf
--- /dev/null
+++ b/depend/zcash/src/asyncrpcoperation.cpp
@@ -0,0 +1,181 @@
+// Copyright (c) 2016 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "asyncrpcoperation.h"
+
+#include <boost/uuid/uuid.hpp>
+#include <boost/uuid/uuid_generators.hpp>
+#include <boost/uuid/uuid_io.hpp>
+
+#include <string>
+#include <ctime>
+#include <chrono>
+
+using namespace std;
+
+static boost::uuids::random_generator uuidgen;
+
+static std::map<OperationStatus, std::string> OperationStatusMap = {
+    {OperationStatus::READY, "queued"},
+    {OperationStatus::EXECUTING, "executing"},
+    {OperationStatus::CANCELLED, "cancelled"},
+    {OperationStatus::FAILED, "failed"},
+    {OperationStatus::SUCCESS, "success"}
+};
+
+/**
+ * Every operation instance should have a globally unique id
+ */
+AsyncRPCOperation::AsyncRPCOperation() : error_code_(0), error_message_() {
+    // Set a unique reference for each operation
+    boost::uuids::uuid uuid = uuidgen();
+    id_ = "opid-" + boost::uuids::to_string(uuid);
+    creation_time_ = (int64_t)time(NULL);
+    set_state(OperationStatus::READY);
+}
+
+AsyncRPCOperation::AsyncRPCOperation(const AsyncRPCOperation& o) :
+        id_(o.id_), creation_time_(o.creation_time_), state_(o.state_.load()),
+        start_time_(o.start_time_), end_time_(o.end_time_),
+        error_code_(o.error_code_), error_message_(o.error_message_),
+        result_(o.result_)
+{
+}
+
+AsyncRPCOperation& AsyncRPCOperation::operator=( const AsyncRPCOperation& other ) {
+    this->id_ = other.id_;
+    this->creation_time_ = other.creation_time_;
+    this->state_.store(other.state_.load());
+    this->start_time_ = other.start_time_;
+    this->end_time_ = other.end_time_;
+    this->error_code_ = other.error_code_;
+    this->error_message_ = other.error_message_;
+    this->result_ = other.result_;
+    return *this;
+}
+
+
+AsyncRPCOperation::~AsyncRPCOperation() {
+}
+
+/**
+ * Override this cancel() method if you can interrupt main() when executing.
+ */
+void AsyncRPCOperation::cancel() {
+    if (isReady()) {
+        set_state(OperationStatus::CANCELLED);
+    }
+}
+
+/**
+ * Start timing the execution run of the code you're interested in
+ */
+void AsyncRPCOperation::start_execution_clock() {
+    std::lock_guard<std::mutex> guard(lock_);
+    start_time_ = std::chrono::system_clock::now();
+}
+
+/**
+ * Stop timing the execution run
+ */
+void AsyncRPCOperation::stop_execution_clock() {
+    std::lock_guard<std::mutex> guard(lock_);
+    end_time_ = std::chrono::system_clock::now();
+}
+
+/**
+ * Implement this virtual method in any subclass.  This is just an example implementation.
+ */
+void AsyncRPCOperation::main() {
+    if (isCancelled()) {
+        return;
+    }
+    
+    set_state(OperationStatus::EXECUTING);
+
+    start_execution_clock();
+
+    // Do some work here..
+
+    stop_execution_clock();
+
+    // If there was an error, you might set it like this:
+    /*
+    setErrorCode(123);
+    setErrorMessage("Murphy's law");
+    setState(OperationStatus::FAILED);
+    */
+
+    // Otherwise, if the operation was a success:
+    UniValue v(UniValue::VSTR, "We have a result!");
+    set_result(v);
+    set_state(OperationStatus::SUCCESS);
+}
+
+/**
+ * Return the error of the completed operation as a UniValue object.
+ * If there is no error, return null UniValue.
+ */
+UniValue AsyncRPCOperation::getError() const {
+    if (!isFailed()) {
+        return NullUniValue;
+    }
+
+    std::lock_guard<std::mutex> guard(lock_);
+    UniValue error(UniValue::VOBJ);
+    error.pushKV("code", this->error_code_);
+    error.pushKV("message", this->error_message_);
+    return error;
+}
+
+/**
+ * Return the result of the completed operation as a UniValue object.
+ * If the operation did not succeed, return null UniValue.
+ */
+UniValue AsyncRPCOperation::getResult() const {
+    if (!isSuccess()) {
+        return NullUniValue;
+    }
+
+    std::lock_guard<std::mutex> guard(lock_);
+    return this->result_;
+}
+
+
+/**
+ * Returns a status UniValue object.
+ * If the operation has failed, it will include an error object.
+ * If the operation has succeeded, it will include the result value.
+ * If the operation was cancelled, there will be no error object or result value.
+ */
+UniValue AsyncRPCOperation::getStatus() const {
+    OperationStatus status = this->getState();
+    UniValue obj(UniValue::VOBJ);
+    obj.pushKV("id", this->id_);
+    obj.pushKV("status", OperationStatusMap[status]);
+    obj.pushKV("creation_time", this->creation_time_);
+    // TODO: Issue #1354: There may be other useful metadata to return to the user.
+    UniValue err = this->getError();
+    if (!err.isNull()) {
+        obj.pushKV("error", err.get_obj());
+    }
+    UniValue result = this->getResult();
+    if (!result.isNull()) {
+        obj.pushKV("result", result);
+
+        // Include execution time for successful operation
+        std::chrono::duration<double> elapsed_seconds = end_time_ - start_time_;
+        obj.pushKV("execution_secs", elapsed_seconds.count());
+
+    }
+    return obj;
+}
+
+/**
+ * Return the operation state in human readable form.
+ */
+std::string AsyncRPCOperation::getStateAsString() const {
+    OperationStatus status = this->getState();
+    return OperationStatusMap[status];
+}
diff --git a/depend/zcash/src/asyncrpcoperation.h b/depend/zcash/src/asyncrpcoperation.h
new file mode 100644
index 000000000..9879e23d0
--- /dev/null
+++ b/depend/zcash/src/asyncrpcoperation.h
@@ -0,0 +1,153 @@
+// Copyright (c) 2016 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+
+#ifndef ZCASH_ASYNCRPCOPERATION_H
+#define ZCASH_ASYNCRPCOPERATION_H
+
+#include <string>
+#include <atomic>
+#include <map>
+#include <chrono>
+#include <memory>
+#include <thread>
+#include <utility>
+#include <future>
+
+#include <univalue.h>
+
+using namespace std;
+
+/**
+ * AsyncRPCOperation objects are submitted to the AsyncRPCQueue for processing.
+ * 
+ * To subclass AsyncRPCOperation, implement the main() method.
+ * Update the operation status as work is underway and completes.
+ * If main() can be interrupted, implement the cancel() method.
+ */
+
+typedef std::string AsyncRPCOperationId;
+
+typedef enum class operationStateEnum {
+    READY = 0,
+    EXECUTING,
+    CANCELLED,
+    FAILED,
+    SUCCESS
+} OperationStatus;
+
+class AsyncRPCOperation {
+public:
+    AsyncRPCOperation();
+    virtual ~AsyncRPCOperation();
+
+    // You must implement this method in your subclass.
+    virtual void main();
+
+    // Override this method if you can interrupt execution of main() in your subclass.
+    void cancel();
+    
+    // Getters and setters
+
+    OperationStatus getState() const {
+        return state_.load();
+    }
+        
+    AsyncRPCOperationId getId() const {
+        return id_;
+    }
+   
+    int64_t getCreationTime() const {
+        return creation_time_;
+    }
+
+    // Override this method to add data to the default status object.
+    virtual UniValue getStatus() const;
+
+    UniValue getError() const;
+    
+    UniValue getResult() const;
+
+    std::string getStateAsString() const;
+    
+    int getErrorCode() const {
+        std::lock_guard<std::mutex> guard(lock_);
+        return error_code_;
+    }
+
+    std::string getErrorMessage() const {
+        std::lock_guard<std::mutex> guard(lock_);
+        return error_message_;
+    }
+
+    bool isCancelled() const {
+        return OperationStatus::CANCELLED == getState();
+    }
+
+    bool isExecuting() const {
+        return OperationStatus::EXECUTING == getState();
+    }
+
+    bool isReady() const {
+        return OperationStatus::READY == getState();
+    }
+
+    bool isFailed() const {
+        return OperationStatus::FAILED == getState();
+    }
+    
+    bool isSuccess() const {
+        return OperationStatus::SUCCESS == getState();
+    }
+
+protected:
+    // The state_ is atomic because only it can be mutated externally.
+    // For example, the user initiates a shut down of the application, which closes
+    // the AsyncRPCQueue, which in turn invokes cancel() on all operations.
+    // The member variables below are protected rather than private in order to
+    // allow subclasses of AsyncRPCOperation the ability to access and update
+    // internal state.  Currently, all operations are executed in a single-thread
+    // by a single worker.
+    mutable std::mutex lock_;   // lock on this when read/writing non-atomics
+    UniValue result_;
+    int error_code_;
+    std::string error_message_;
+    std::atomic<OperationStatus> state_;
+    std::chrono::time_point<std::chrono::system_clock> start_time_, end_time_;  
+
+    void start_execution_clock();
+    void stop_execution_clock();
+
+    void set_state(OperationStatus state) {
+        this->state_.store(state);
+    }
+
+    void set_error_code(int errorCode) {
+        std::lock_guard<std::mutex> guard(lock_);
+        this->error_code_ = errorCode;
+    }
+
+    void set_error_message(std::string errorMessage) {
+        std::lock_guard<std::mutex> guard(lock_);
+        this->error_message_ = errorMessage;
+    }
+    
+    void set_result(UniValue v) {
+        std::lock_guard<std::mutex> guard(lock_);
+        this->result_ = v;
+    }
+    
+private:
+
+    // Derived classes should write their own copy constructor and assignment operators
+    AsyncRPCOperation(const AsyncRPCOperation& orig);
+    AsyncRPCOperation& operator=( const AsyncRPCOperation& other );
+
+    // Initialized in the operation constructor, never to be modified again.
+    AsyncRPCOperationId id_;
+    int64_t creation_time_;
+};
+
+#endif // ZCASH_ASYNCRPCOPERATION_H
+
diff --git a/depend/zcash/src/asyncrpcqueue.cpp b/depend/zcash/src/asyncrpcqueue.cpp
new file mode 100644
index 000000000..e03244945
--- /dev/null
+++ b/depend/zcash/src/asyncrpcqueue.cpp
@@ -0,0 +1,233 @@
+// Copyright (c) 2016 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "asyncrpcqueue.h"
+
+static std::atomic<size_t> workerCounter(0);
+
+/**
+ * Static method to return the shared/default queue.
+ */
+shared_ptr<AsyncRPCQueue> AsyncRPCQueue::sharedInstance() {
+    // Thread-safe in C+11 and gcc 4.3
+    static shared_ptr<AsyncRPCQueue> q = std::make_shared<AsyncRPCQueue>();
+    return q;
+}
+
+AsyncRPCQueue::AsyncRPCQueue() : closed_(false), finish_(false) {
+}
+
+AsyncRPCQueue::~AsyncRPCQueue() {
+    closeAndWait();     // join on all worker threads
+}
+
+/**
+ * A worker will execute this method on a new thread
+ */
+void AsyncRPCQueue::run(size_t workerId) {
+
+    while (true) {
+        AsyncRPCOperationId key;
+        std::shared_ptr<AsyncRPCOperation> operation;
+        {
+            std::unique_lock<std::mutex> guard(lock_);
+            while (operation_id_queue_.empty() && !isClosed() && !isFinishing()) {
+                this->condition_.wait(guard);
+            }
+
+            // Exit if the queue is empty and we are finishing up
+            if (isFinishing() && operation_id_queue_.empty()) {
+                break;
+            }
+
+            // Exit if the queue is closing.
+            if (isClosed()) {
+                while (!operation_id_queue_.empty()) {
+                    operation_id_queue_.pop();
+                }
+                break;
+            }
+
+            // Get operation id
+            key = operation_id_queue_.front();
+            operation_id_queue_.pop();
+
+            // Search operation map
+            AsyncRPCOperationMap::const_iterator iter = operation_map_.find(key);
+            if (iter != operation_map_.end()) {
+                operation = iter->second;
+            }
+        }
+
+        if (!operation) {
+            // cannot find operation in map, may have been removed
+        } else if (operation->isCancelled()) {
+            // skip cancelled operation
+        } else {
+            operation->main();
+        }
+    }
+}
+
+
+/**
+ * Add shared_ptr to operation.
+ *
+ * To retain polymorphic behaviour, i.e. main() method of derived classes is invoked,
+ * caller should create the shared_ptr like this:
+ *
+ * std::shared_ptr<AsyncRPCOperation> ptr(new MyCustomAsyncRPCOperation(params));
+ *
+ * Don't use std::make_shared<AsyncRPCOperation>().
+ */
+void AsyncRPCQueue::addOperation(const std::shared_ptr<AsyncRPCOperation> &ptrOperation) {
+    std::lock_guard<std::mutex> guard(lock_);
+
+    // Don't add if queue is closed or finishing
+    if (isClosed() || isFinishing()) {
+        return;
+    }
+
+    AsyncRPCOperationId id = ptrOperation->getId();
+    operation_map_.emplace(id, ptrOperation);
+    operation_id_queue_.push(id);
+    this->condition_.notify_one();
+}
+
+/**
+ * Return the operation for a given operation id.
+ */
+std::shared_ptr<AsyncRPCOperation> AsyncRPCQueue::getOperationForId(AsyncRPCOperationId id) const {
+    std::shared_ptr<AsyncRPCOperation> ptr;
+
+    std::lock_guard<std::mutex> guard(lock_);
+    AsyncRPCOperationMap::const_iterator iter = operation_map_.find(id);
+    if (iter != operation_map_.end()) {
+        ptr = iter->second;
+    }
+    return ptr;
+}
+
+/**
+ * Return the operation for a given operation id and then remove the operation from internal storage.
+ */
+std::shared_ptr<AsyncRPCOperation> AsyncRPCQueue::popOperationForId(AsyncRPCOperationId id) {
+    std::shared_ptr<AsyncRPCOperation> ptr = getOperationForId(id);
+    if (ptr) {
+        std::lock_guard<std::mutex> guard(lock_);
+        // Note: if the id still exists in the operationIdQueue, when it gets processed by a worker
+        // there will no operation in the map to execute, so nothing will happen.
+        operation_map_.erase(id);
+    }
+    return ptr;
+}
+
+/**
+ * Return true if the queue is closed to new operations.
+ */
+bool AsyncRPCQueue::isClosed() const {
+    return closed_.load();
+}
+
+/**
+ * Close the queue and cancel all existing operations
+ */
+void AsyncRPCQueue::close() {
+    closed_.store(true);
+    cancelAllOperations();
+}
+
+/**
+ * Return true if the queue is finishing up
+ */
+bool AsyncRPCQueue::isFinishing() const {
+    return finish_.load();
+}
+
+/**
+ * Close the queue but finish existing operations. Do not accept new operations.
+ */
+void AsyncRPCQueue::finish() {
+    finish_.store(true);
+}
+
+/**
+ *  Call cancel() on all operations
+ */
+void AsyncRPCQueue::cancelAllOperations() {
+    std::lock_guard<std::mutex> guard(lock_);
+    for (auto key : operation_map_) {
+        key.second->cancel();
+    }
+    this->condition_.notify_all();
+}
+
+/**
+ * Return the number of operations in the queue
+ */
+size_t AsyncRPCQueue::getOperationCount() const {
+    std::lock_guard<std::mutex> guard(lock_);
+    return operation_id_queue_.size();
+}
+
+/**
+ * Spawn a worker thread
+ */
+void AsyncRPCQueue::addWorker() {
+    std::lock_guard<std::mutex> guard(lock_);
+    workers_.emplace_back( std::thread(&AsyncRPCQueue::run, this, ++workerCounter) );
+}
+
+/**
+ * Return the number of worker threads spawned by the queue
+ */
+size_t AsyncRPCQueue::getNumberOfWorkers() const {
+    std::lock_guard<std::mutex> guard(lock_);
+    return workers_.size();
+}
+
+/**
+ * Return a list of all known operation ids found in internal storage.
+ */
+std::vector<AsyncRPCOperationId> AsyncRPCQueue::getAllOperationIds() const {
+    std::lock_guard<std::mutex> guard(lock_);
+    std::vector<AsyncRPCOperationId> v;
+    for(auto & entry: operation_map_) {
+        v.push_back(entry.first);
+    }
+    return v;
+}
+
+/**
+ * Calling thread will close and wait for worker threads to join.
+ */
+void AsyncRPCQueue::closeAndWait() {
+    close();
+    wait_for_worker_threads();
+}
+
+/**
+ * Block current thread until all workers have finished their tasks.
+ */
+void AsyncRPCQueue::finishAndWait() {
+    finish();
+    wait_for_worker_threads();
+}
+
+/**
+ * Block current thread until all operations are finished or the queue has closed.
+ */
+void AsyncRPCQueue::wait_for_worker_threads() {
+    // Notify any workers who are waiting, so they see the updated queue state
+    {
+        std::lock_guard<std::mutex> guard(lock_);
+        this->condition_.notify_all();
+    }
+        
+    for (std::thread & t : this->workers_) {
+        if (t.joinable()) {
+            t.join();
+        }
+    }
+}
diff --git a/depend/zcash/src/asyncrpcqueue.h b/depend/zcash/src/asyncrpcqueue.h
new file mode 100644
index 000000000..f798c2d33
--- /dev/null
+++ b/depend/zcash/src/asyncrpcqueue.h
@@ -0,0 +1,68 @@
+// Copyright (c) 2016 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_ASYNCRPCQUEUE_H
+#define ZCASH_ASYNCRPCQUEUE_H
+
+#include "asyncrpcoperation.h"
+
+#include <iostream>
+#include <string>
+#include <chrono>
+#include <queue>
+#include <unordered_map>
+#include <vector>
+#include <future>
+#include <thread>
+#include <utility>
+#include <memory>
+
+
+typedef std::unordered_map<AsyncRPCOperationId, std::shared_ptr<AsyncRPCOperation> > AsyncRPCOperationMap; 
+
+
+class AsyncRPCQueue {
+public:
+    static shared_ptr<AsyncRPCQueue> sharedInstance();
+
+    AsyncRPCQueue();
+    virtual ~AsyncRPCQueue();
+
+    // We don't want queue to be copied or moved around
+    AsyncRPCQueue(AsyncRPCQueue const&) = delete;             // Copy construct
+    AsyncRPCQueue(AsyncRPCQueue&&) = delete;                  // Move construct
+    AsyncRPCQueue& operator=(AsyncRPCQueue const&) = delete;  // Copy assign
+    AsyncRPCQueue& operator=(AsyncRPCQueue &&) = delete;      // Move assign
+
+    void addWorker();
+    size_t getNumberOfWorkers() const;
+    bool isClosed() const;
+    bool isFinishing() const;
+    void close(); // close queue and cancel all operations
+    void finish(); // close queue but finishing existing operations
+    void closeAndWait(); // block thread until all threads have terminated.
+    void finishAndWait(); // block thread until existing operations have finished, threads terminated
+    void cancelAllOperations(); // mark all operations in the queue as cancelled
+    size_t getOperationCount() const;
+    std::shared_ptr<AsyncRPCOperation> getOperationForId(AsyncRPCOperationId) const;
+    std::shared_ptr<AsyncRPCOperation> popOperationForId(AsyncRPCOperationId);
+    void addOperation(const std::shared_ptr<AsyncRPCOperation> &ptrOperation);
+    std::vector<AsyncRPCOperationId> getAllOperationIds() const;
+
+private:
+    // addWorker() will spawn a new thread on run())
+    void run(size_t workerId);
+    void wait_for_worker_threads();
+
+    // Why this is not a recursive lock: http://www.zaval.org/resources/library/butenhof1.html
+    mutable std::mutex lock_;
+    std::condition_variable condition_;
+    std::atomic<bool> closed_;
+    std::atomic<bool> finish_;
+    AsyncRPCOperationMap operation_map_;
+    std::queue <AsyncRPCOperationId> operation_id_queue_;
+    std::vector<std::thread> workers_;
+};
+
+#endif // ZCASH_ASYNCRPCQUEUE_H
diff --git a/depend/zcash/src/base58.cpp b/depend/zcash/src/base58.cpp
new file mode 100644
index 000000000..3e2f18b40
--- /dev/null
+++ b/depend/zcash/src/base58.cpp
@@ -0,0 +1,136 @@
+// Copyright (c) 2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "base58.h"
+
+#include <hash.h>
+#include <uint256.h>
+
+#include <assert.h>
+#include <string.h>
+
+/** All alphanumeric characters except for "0", "I", "O", and "l" */
+static const char* pszBase58 = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";
+
+bool DecodeBase58(const char* psz, std::vector<unsigned char>& vch)
+{
+    // Skip leading spaces.
+    while (*psz && isspace(*psz))
+        psz++;
+    // Skip and count leading '1's.
+    int zeroes = 0;
+    while (*psz == '1') {
+        zeroes++;
+        psz++;
+    }
+    // Allocate enough space in big-endian base256 representation.
+    std::vector<unsigned char> b256(strlen(psz) * 733 / 1000 + 1); // log(58) / log(256), rounded up.
+    // Process the characters.
+    while (*psz && !isspace(*psz)) {
+        // Decode base58 character
+        const char* ch = strchr(pszBase58, *psz);
+        if (ch == NULL)
+            return false;
+        // Apply "b256 = b256 * 58 + ch".
+        int carry = ch - pszBase58;
+        for (std::vector<unsigned char>::reverse_iterator it = b256.rbegin(); it != b256.rend(); it++) {
+            carry += 58 * (*it);
+            *it = carry % 256;
+            carry /= 256;
+        }
+        assert(carry == 0);
+        psz++;
+    }
+    // Skip trailing spaces.
+    while (isspace(*psz))
+        psz++;
+    if (*psz != 0)
+        return false;
+    // Skip leading zeroes in b256.
+    std::vector<unsigned char>::iterator it = b256.begin();
+    while (it != b256.end() && *it == 0)
+        it++;
+    // Copy result into output vector.
+    vch.reserve(zeroes + (b256.end() - it));
+    vch.assign(zeroes, 0x00);
+    while (it != b256.end())
+        vch.push_back(*(it++));
+    return true;
+}
+
+std::string EncodeBase58(const unsigned char* pbegin, const unsigned char* pend)
+{
+    // Skip & count leading zeroes.
+    int zeroes = 0;
+    while (pbegin != pend && *pbegin == 0) {
+        pbegin++;
+        zeroes++;
+    }
+    // Allocate enough space in big-endian base58 representation.
+    std::vector<unsigned char> b58((pend - pbegin) * 138 / 100 + 1); // log(256) / log(58), rounded up.
+    // Process the bytes.
+    while (pbegin != pend) {
+        int carry = *pbegin;
+        // Apply "b58 = b58 * 256 + ch".
+        for (std::vector<unsigned char>::reverse_iterator it = b58.rbegin(); it != b58.rend(); it++) {
+            carry += 256 * (*it);
+            *it = carry % 58;
+            carry /= 58;
+        }
+        assert(carry == 0);
+        pbegin++;
+    }
+    // Skip leading zeroes in base58 result.
+    std::vector<unsigned char>::iterator it = b58.begin();
+    while (it != b58.end() && *it == 0)
+        it++;
+    // Translate the result into a string.
+    std::string str;
+    str.reserve(zeroes + (b58.end() - it));
+    str.assign(zeroes, '1');
+    while (it != b58.end())
+        str += pszBase58[*(it++)];
+    return str;
+}
+
+std::string EncodeBase58(const std::vector<unsigned char>& vch)
+{
+    return EncodeBase58(vch.data(), vch.data() + vch.size());
+}
+
+bool DecodeBase58(const std::string& str, std::vector<unsigned char>& vchRet)
+{
+    return DecodeBase58(str.c_str(), vchRet);
+}
+
+std::string EncodeBase58Check(const std::vector<unsigned char>& vchIn)
+{
+    // add 4-byte hash check to the end
+    std::vector<unsigned char> vch(vchIn);
+    uint256 hash = Hash(vch.begin(), vch.end());
+    vch.insert(vch.end(), (unsigned char*)&hash, (unsigned char*)&hash + 4);
+    return EncodeBase58(vch);
+}
+
+bool DecodeBase58Check(const char* psz, std::vector<unsigned char>& vchRet)
+{
+    if (!DecodeBase58(psz, vchRet) ||
+        (vchRet.size() < 4)) {
+        vchRet.clear();
+        return false;
+    }
+    // re-calculate the checksum, insure it matches the included 4-byte checksum
+    uint256 hash = Hash(vchRet.begin(), vchRet.end() - 4);
+    if (memcmp(&hash, &vchRet.end()[-4], 4) != 0) {
+        vchRet.clear();
+        return false;
+    }
+    vchRet.resize(vchRet.size() - 4);
+    return true;
+}
+
+bool DecodeBase58Check(const std::string& str, std::vector<unsigned char>& vchRet)
+{
+    return DecodeBase58Check(str.c_str(), vchRet);
+}
diff --git a/depend/zcash/src/base58.h b/depend/zcash/src/base58.h
new file mode 100644
index 000000000..f29c37556
--- /dev/null
+++ b/depend/zcash/src/base58.h
@@ -0,0 +1,61 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+/**
+ * Why base-58 instead of standard base-64 encoding?
+ * - Don't want 0OIl characters that look the same in some fonts and
+ *      could be used to create visually identical looking data.
+ * - A string with non-alphanumeric characters is not as easily accepted as input.
+ * - E-mail usually won't line-break if there's no punctuation to break at.
+ * - Double-clicking selects the whole string as one word if it's all alphanumeric.
+ */
+#ifndef BITCOIN_BASE58_H
+#define BITCOIN_BASE58_H
+
+#include <string>
+#include <vector>
+
+/**
+ * Encode a byte sequence as a base58-encoded string.
+ * pbegin and pend cannot be NULL, unless both are.
+ */
+std::string EncodeBase58(const unsigned char* pbegin, const unsigned char* pend);
+
+/**
+ * Encode a byte vector as a base58-encoded string
+ */
+std::string EncodeBase58(const std::vector<unsigned char>& vch);
+
+/**
+ * Decode a base58-encoded string (psz) into a byte vector (vchRet).
+ * return true if decoding is successful.
+ * psz cannot be NULL.
+ */
+bool DecodeBase58(const char* psz, std::vector<unsigned char>& vchRet);
+
+/**
+ * Decode a base58-encoded string (str) into a byte vector (vchRet).
+ * return true if decoding is successful.
+ */
+bool DecodeBase58(const std::string& str, std::vector<unsigned char>& vchRet);
+
+/**
+ * Encode a byte vector into a base58-encoded string, including checksum
+ */
+std::string EncodeBase58Check(const std::vector<unsigned char>& vchIn);
+
+/**
+ * Decode a base58-encoded string (psz) that includes a checksum into a byte
+ * vector (vchRet), return true if decoding is successful
+ */
+bool DecodeBase58Check(const char* psz, std::vector<unsigned char>& vchRet);
+
+/**
+ * Decode a base58-encoded string (str) that includes a checksum into a byte
+ * vector (vchRet), return true if decoding is successful
+ */
+bool DecodeBase58Check(const std::string& str, std::vector<unsigned char>& vchRet);
+
+#endif // BITCOIN_BASE58_H
diff --git a/depend/zcash/src/bech32.cpp b/depend/zcash/src/bech32.cpp
new file mode 100644
index 000000000..8910d0345
--- /dev/null
+++ b/depend/zcash/src/bech32.cpp
@@ -0,0 +1,194 @@
+// Copyright (c) 2017 Pieter Wuille
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "bech32.h"
+
+namespace
+{
+
+typedef std::vector<uint8_t> data;
+
+/** The Bech32 character set for encoding. */
+const char* CHARSET = "qpzry9x8gf2tvdw0s3jn54khce6mua7l";
+
+/** The Bech32 character set for decoding. */
+const int8_t CHARSET_REV[128] = {
+    -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+    -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+    -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+    15, -1, 10, 17, 21, 20, 26, 30,  7,  5, -1, -1, -1, -1, -1, -1,
+    -1, 29, -1, 24, 13, 25,  9,  8, 23, -1, 18, 22, 31, 27, 19, -1,
+     1,  0,  3, 16, 11, 28, 12, 14,  6,  4,  2, -1, -1, -1, -1, -1,
+    -1, 29, -1, 24, 13, 25,  9,  8, 23, -1, 18, 22, 31, 27, 19, -1,
+     1,  0,  3, 16, 11, 28, 12, 14,  6,  4,  2, -1, -1, -1, -1, -1
+};
+
+/** Concatenate two byte arrays. */
+data Cat(data x, const data& y)
+{
+    x.insert(x.end(), y.begin(), y.end());
+    return x;
+}
+
+/** This function will compute what 6 5-bit values to XOR into the last 6 input values, in order to
+ *  make the checksum 0. These 6 values are packed together in a single 30-bit integer. The higher
+ *  bits correspond to earlier values. */
+uint32_t PolyMod(const data& v)
+{
+    // The input is interpreted as a list of coefficients of a polynomial over F = GF(32), with an
+    // implicit 1 in front. If the input is [v0,v1,v2,v3,v4], that polynomial is v(x) =
+    // 1*x^5 + v0*x^4 + v1*x^3 + v2*x^2 + v3*x + v4. The implicit 1 guarantees that
+    // [v0,v1,v2,...] has a distinct checksum from [0,v0,v1,v2,...].
+
+    // The output is a 30-bit integer whose 5-bit groups are the coefficients of the remainder of
+    // v(x) mod g(x), where g(x) is the Bech32 generator,
+    // x^6 + {29}x^5 + {22}x^4 + {20}x^3 + {21}x^2 + {29}x + {18}. g(x) is chosen in such a way
+    // that the resulting code is a BCH code, guaranteeing detection of up to 3 errors within a
+    // window of 1023 characters. Among the various possible BCH codes, one was selected to in
+    // fact guarantee detection of up to 4 errors within a window of 89 characters.
+
+    // Note that the coefficients are elements of GF(32), here represented as decimal numbers
+    // between {}. In this finite field, addition is just XOR of the corresponding numbers. For
+    // example, {27} + {13} = {27 ^ 13} = {22}. Multiplication is more complicated, and requires
+    // treating the bits of values themselves as coefficients of a polynomial over a smaller field,
+    // GF(2), and multiplying those polynomials mod a^5 + a^3 + 1. For example, {5} * {26} =
+    // (a^2 + 1) * (a^4 + a^3 + a) = (a^4 + a^3 + a) * a^2 + (a^4 + a^3 + a) = a^6 + a^5 + a^4 + a
+    // = a^3 + 1 (mod a^5 + a^3 + 1) = {9}.
+
+    // During the course of the loop below, `c` contains the bitpacked coefficients of the
+    // polynomial constructed from just the values of v that were processed so far, mod g(x). In
+    // the above example, `c` initially corresponds to 1 mod (x), and after processing 2 inputs of
+    // v, it corresponds to x^2 + v0*x + v1 mod g(x). As 1 mod g(x) = 1, that is the starting value
+    // for `c`.
+    uint32_t c = 1;
+    for (auto v_i : v) {
+        // We want to update `c` to correspond to a polynomial with one extra term. If the initial
+        // value of `c` consists of the coefficients of c(x) = f(x) mod g(x), we modify it to
+        // correspond to c'(x) = (f(x) * x + v_i) mod g(x), where v_i is the next input to
+        // process. Simplifying:
+        // c'(x) = (f(x) * x + v_i) mod g(x)
+        //         ((f(x) mod g(x)) * x + v_i) mod g(x)
+        //         (c(x) * x + v_i) mod g(x)
+        // If c(x) = c0*x^5 + c1*x^4 + c2*x^3 + c3*x^2 + c4*x + c5, we want to compute
+        // c'(x) = (c0*x^5 + c1*x^4 + c2*x^3 + c3*x^2 + c4*x + c5) * x + v_i mod g(x)
+        //       = c0*x^6 + c1*x^5 + c2*x^4 + c3*x^3 + c4*x^2 + c5*x + v_i mod g(x)
+        //       = c0*(x^6 mod g(x)) + c1*x^5 + c2*x^4 + c3*x^3 + c4*x^2 + c5*x + v_i
+        // If we call (x^6 mod g(x)) = k(x), this can be written as
+        // c'(x) = (c1*x^5 + c2*x^4 + c3*x^3 + c4*x^2 + c5*x + v_i) + c0*k(x)
+
+        // First, determine the value of c0:
+        uint8_t c0 = c >> 25;
+
+        // Then compute c1*x^5 + c2*x^4 + c3*x^3 + c4*x^2 + c5*x + v_i:
+        c = ((c & 0x1ffffff) << 5) ^ v_i;
+
+        // Finally, for each set bit n in c0, conditionally add {2^n}k(x):
+        if (c0 & 1)  c ^= 0x3b6a57b2; //     k(x) = {29}x^5 + {22}x^4 + {20}x^3 + {21}x^2 + {29}x + {18}
+        if (c0 & 2)  c ^= 0x26508e6d; //  {2}k(x) = {19}x^5 +  {5}x^4 +     x^3 +  {3}x^2 + {19}x + {13}
+        if (c0 & 4)  c ^= 0x1ea119fa; //  {4}k(x) = {15}x^5 + {10}x^4 +  {2}x^3 +  {6}x^2 + {15}x + {26}
+        if (c0 & 8)  c ^= 0x3d4233dd; //  {8}k(x) = {30}x^5 + {20}x^4 +  {4}x^3 + {12}x^2 + {30}x + {29}
+        if (c0 & 16) c ^= 0x2a1462b3; // {16}k(x) = {21}x^5 +     x^4 +  {8}x^3 + {24}x^2 + {21}x + {19}
+    }
+    return c;
+}
+
+/** Convert to lower case. */
+inline unsigned char LowerCase(unsigned char c)
+{
+    return (c >= 'A' && c <= 'Z') ? (c - 'A') + 'a' : c;
+}
+
+/** Expand a HRP for use in checksum computation. */
+data ExpandHRP(const std::string& hrp)
+{
+    data ret;
+    ret.reserve(hrp.size() + 90);
+    ret.resize(hrp.size() * 2 + 1);
+    for (size_t i = 0; i < hrp.size(); ++i) {
+        unsigned char c = hrp[i];
+        ret[i] = c >> 5;
+        ret[i + hrp.size() + 1] = c & 0x1f;
+    }
+    ret[hrp.size()] = 0;
+    return ret;
+}
+
+/** Verify a checksum. */
+bool VerifyChecksum(const std::string& hrp, const data& values)
+{
+    // PolyMod computes what value to xor into the final values to make the checksum 0. However,
+    // if we required that the checksum was 0, it would be the case that appending a 0 to a valid
+    // list of values would result in a new valid list. For that reason, Bech32 requires the
+    // resulting checksum to be 1 instead.
+    return PolyMod(Cat(ExpandHRP(hrp), values)) == 1;
+}
+
+/** Create a checksum. */
+data CreateChecksum(const std::string& hrp, const data& values)
+{
+    data enc = Cat(ExpandHRP(hrp), values);
+    enc.resize(enc.size() + 6); // Append 6 zeroes
+    uint32_t mod = PolyMod(enc) ^ 1; // Determine what to XOR into those 6 zeroes.
+    data ret(6);
+    for (size_t i = 0; i < 6; ++i) {
+        // Convert the 5-bit groups in mod to checksum values.
+        ret[i] = (mod >> (5 * (5 - i))) & 31;
+    }
+    return ret;
+}
+
+} // namespace
+
+namespace bech32
+{
+
+/** Encode a Bech32 string. */
+std::string Encode(const std::string& hrp, const data& values) {
+    data checksum = CreateChecksum(hrp, values);
+    data combined = Cat(values, checksum);
+    std::string ret = hrp + '1';
+    ret.reserve(ret.size() + combined.size());
+    for (auto c : combined) {
+        if (c >= 32) {
+            return "";
+        }
+        ret += CHARSET[c];
+    }
+    return ret;
+}
+
+/** Decode a Bech32 string. */
+std::pair<std::string, data> Decode(const std::string& str) {
+    bool lower = false, upper = false;
+    for (size_t i = 0; i < str.size(); ++i) {
+        unsigned char c = str[i];
+        if (c < 33 || c > 126) return {};
+        if (c >= 'a' && c <= 'z') lower = true;
+        if (c >= 'A' && c <= 'Z') upper = true;
+    }
+    if (lower && upper) return {};
+    size_t pos = str.rfind('1');
+    if (str.size() > 1023 || pos == str.npos || pos == 0 || pos + 7 > str.size()) {
+        return {};
+    }
+    data values(str.size() - 1 - pos);
+    for (size_t i = 0; i < str.size() - 1 - pos; ++i) {
+        unsigned char c = str[i + pos + 1];
+        int8_t rev = (c < 33 || c > 126) ? -1 : CHARSET_REV[c];
+        if (rev == -1) {
+            return {};
+        }
+        values[i] = rev;
+    }
+    std::string hrp;
+    for (size_t i = 0; i < pos; ++i) {
+        hrp += LowerCase(str[i]);
+    }
+    if (!VerifyChecksum(hrp, values)) {
+        return {};
+    }
+    return {hrp, data(values.begin(), values.end() - 6)};
+}
+
+} // namespace bech32
diff --git a/depend/zcash/src/bech32.h b/depend/zcash/src/bech32.h
new file mode 100644
index 000000000..eecc6e29f
--- /dev/null
+++ b/depend/zcash/src/bech32.h
@@ -0,0 +1,30 @@
+// Copyright (c) 2017 Pieter Wuille
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+// Bech32 is a string encoding format used in newer address types.
+// The output consists of a human-readable part (alphanumeric), a
+// separator character (1), and a base32 data section, the last
+// 6 characters of which are a checksum.
+//
+// For more information, see BIP 173.
+
+#ifndef BITCOIN_BECH32_H
+#define BITCOIN_BECH32_H
+
+#include <stdint.h>
+#include <string>
+#include <vector>
+
+namespace bech32
+{
+
+/** Encode a Bech32 string. Returns the empty string in case of failure. */
+std::string Encode(const std::string& hrp, const std::vector<uint8_t>& values);
+
+/** Decode a Bech32 string. Returns (hrp, data). Empty hrp means failure. */
+std::pair<std::string, std::vector<uint8_t>> Decode(const std::string& str);
+
+} // namespace bech32
+
+#endif // BITCOIN_BECH32_H
diff --git a/depend/zcash/src/bench/.gitignore b/depend/zcash/src/bench/.gitignore
new file mode 100644
index 000000000..e231fe4ca
--- /dev/null
+++ b/depend/zcash/src/bench/.gitignore
@@ -0,0 +1 @@
+bench_bitcoin
diff --git a/depend/zcash/src/bench/Examples.cpp b/depend/zcash/src/bench/Examples.cpp
new file mode 100644
index 000000000..3ca21f4dc
--- /dev/null
+++ b/depend/zcash/src/bench/Examples.cpp
@@ -0,0 +1,34 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "bench.h"
+#include "main.h"
+#include "utiltime.h"
+
+// Sanity test: this should loop ten times, and
+// min/max/average should be close to 100ms.
+static void Sleep100ms(benchmark::State& state)
+{
+    while (state.KeepRunning()) {
+        MilliSleep(100);
+    }
+}
+
+BENCHMARK(Sleep100ms);
+
+// Extremely fast-running benchmark:
+#include <math.h>
+
+volatile double sum = 0.0; // volatile, global so not optimized away
+
+static void Trig(benchmark::State& state)
+{
+    double d = 0.01;
+    while (state.KeepRunning()) {
+        sum += sin(d);
+        d += 0.000001;
+    }
+}
+
+BENCHMARK(Trig);
diff --git a/depend/zcash/src/bench/base58.cpp b/depend/zcash/src/bench/base58.cpp
new file mode 100644
index 000000000..d0a4234a4
--- /dev/null
+++ b/depend/zcash/src/bench/base58.cpp
@@ -0,0 +1,59 @@
+// Copyright (c) 2016 the Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "bench.h"
+
+#include "main.h"
+#include "base58.h"
+
+#include <array>
+#include <vector>
+#include <string>
+
+
+static void Base58Encode(benchmark::State& state)
+{
+    static const std::array<unsigned char, 32> buff = {
+        {
+            17, 79, 8, 99, 150, 189, 208, 162, 22, 23, 203, 163, 36, 58, 147,
+            227, 139, 2, 215, 100, 91, 38, 11, 141, 253, 40, 117, 21, 16, 90,
+            200, 24
+        }
+    };
+    while (state.KeepRunning()) {
+        EncodeBase58(buff.data(), buff.data() + buff.size());
+    }
+}
+
+
+static void Base58CheckEncode(benchmark::State& state)
+{
+    static const std::array<unsigned char, 32> buff = {
+        {
+            17, 79, 8, 99, 150, 189, 208, 162, 22, 23, 203, 163, 36, 58, 147,
+            227, 139, 2, 215, 100, 91, 38, 11, 141, 253, 40, 117, 21, 16, 90,
+            200, 24
+        }
+    };
+    std::vector<unsigned char> vch;
+    vch.assign(buff.begin(), buff.end());
+    while (state.KeepRunning()) {
+        EncodeBase58Check(vch);
+    }
+}
+
+
+static void Base58Decode(benchmark::State& state)
+{
+    const char* addr = "17VZNX1SN5NtKa8UQFxwQbFeFc3iqRYhem";
+    std::vector<unsigned char> vch;
+    while (state.KeepRunning()) {
+        DecodeBase58(addr, vch);
+    }
+}
+
+
+BENCHMARK(Base58Encode);
+BENCHMARK(Base58CheckEncode);
+BENCHMARK(Base58Decode);
diff --git a/depend/zcash/src/bench/bench.cpp b/depend/zcash/src/bench/bench.cpp
new file mode 100644
index 000000000..268e3259d
--- /dev/null
+++ b/depend/zcash/src/bench/bench.cpp
@@ -0,0 +1,106 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "bench.h"
+
+#include "perf.h"
+
+#include <assert.h>
+#include <iostream>
+#include <iomanip>
+
+benchmark::BenchRunner::BenchmarkMap &benchmark::BenchRunner::benchmarks() {
+    static std::map<std::string, benchmark::BenchFunction> benchmarks_map;
+    return benchmarks_map;
+}
+
+benchmark::BenchRunner::BenchRunner(std::string name, benchmark::BenchFunction func)
+{
+    benchmarks().insert(std::make_pair(name, func));
+}
+
+void
+benchmark::BenchRunner::RunAll(benchmark::duration elapsedTimeForOne)
+{
+    perf_init();
+    if (std::ratio_less_equal<benchmark::clock::period, std::micro>::value) {
+        std::cerr << "WARNING: Clock precision is worse than microsecond - benchmarks may be less accurate!\n";
+    }
+    std::cout << "#Benchmark" << "," << "count" << "," << "min(ns)" << "," << "max(ns)" << "," << "average(ns)" << ","
+              << "min_cycles" << "," << "max_cycles" << "," << "average_cycles" << "\n";
+
+    for (const auto &p: benchmarks()) {
+        State state(p.first, elapsedTimeForOne);
+        p.second(state);
+    }
+    perf_fini();
+}
+
+bool benchmark::State::KeepRunning()
+{
+    if (count & countMask) {
+      ++count;
+      return true;
+    }
+    time_point now;
+
+    uint64_t nowCycles;
+    if (count == 0) {
+        lastTime = beginTime = now = clock::now();
+        lastCycles = beginCycles = nowCycles = perf_cpucycles();
+    }
+    else {
+        now = clock::now();
+        auto elapsed = now - lastTime;
+        auto elapsedOne = elapsed / (countMask + 1);
+        if (elapsedOne < minTime) minTime = elapsedOne;
+        if (elapsedOne > maxTime) maxTime = elapsedOne;
+
+        // We only use relative values, so don't have to handle 64-bit wrap-around specially
+        nowCycles = perf_cpucycles();
+        uint64_t elapsedOneCycles = (nowCycles - lastCycles) / (countMask + 1);
+        if (elapsedOneCycles < minCycles) minCycles = elapsedOneCycles;
+        if (elapsedOneCycles > maxCycles) maxCycles = elapsedOneCycles;
+
+        if (elapsed*128 < maxElapsed) {
+          // If the execution was much too fast (1/128th of maxElapsed), increase the count mask by 8x and restart timing.
+          // The restart avoids including the overhead of this code in the measurement.
+          countMask = ((countMask<<3)|7) & ((1LL<<60)-1);
+          count = 0;
+          minTime = duration::max();
+          maxTime = duration::zero();
+          minCycles = std::numeric_limits<uint64_t>::max();
+          maxCycles = std::numeric_limits<uint64_t>::min();
+          return true;
+        }
+        if (elapsed*16 < maxElapsed) {
+          uint64_t newCountMask = ((countMask<<1)|1) & ((1LL<<60)-1);
+          if ((count & newCountMask)==0) {
+              countMask = newCountMask;
+          }
+        }
+    }
+    lastTime = now;
+    lastCycles = nowCycles;
+    ++count;
+
+    if (now - beginTime < maxElapsed) return true; // Keep going
+
+    --count;
+
+    assert(count != 0 && "count == 0 => (now == 0 && beginTime == 0) => return above");
+
+    // Output results
+    // Duration casts are only necessary here because hardware with sub-nanosecond clocks
+    // will lose precision.
+    int64_t min_elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(minTime).count();
+    int64_t max_elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(maxTime).count();
+    int64_t avg_elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>((now-beginTime)/count).count();
+    int64_t averageCycles = (nowCycles-beginCycles)/count;
+    std::cout << std::fixed << std::setprecision(15) << name << "," << count << "," << min_elapsed << "," << max_elapsed << "," << avg_elapsed << ","
+              << minCycles << "," << maxCycles << "," << averageCycles << "\n";
+    std::cout.copyfmt(std::ios(nullptr));
+
+    return false;
+}
diff --git a/depend/zcash/src/bench/bench.h b/depend/zcash/src/bench/bench.h
new file mode 100644
index 000000000..1b529b356
--- /dev/null
+++ b/depend/zcash/src/bench/bench.h
@@ -0,0 +1,95 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_BENCH_BENCH_H
+#define BITCOIN_BENCH_BENCH_H
+
+#include <functional>
+#include <limits>
+#include <map>
+#include <string>
+#include <chrono>
+
+#include <boost/preprocessor/cat.hpp>
+#include <boost/preprocessor/stringize.hpp>
+
+// Simple micro-benchmarking framework; API mostly matches a subset of the Google Benchmark
+// framework (see https://github.com/google/benchmark)
+// Why not use the Google Benchmark framework? Because adding Yet Another Dependency
+// (that uses cmake as its build system and has lots of features we don't need) isn't
+// worth it.
+
+/*
+ * Usage:
+
+static void CODE_TO_TIME(benchmark::State& state)
+{
+    ... do any setup needed...
+    while (state.KeepRunning()) {
+       ... do stuff you want to time...
+    }
+    ... do any cleanup needed...
+}
+
+BENCHMARK(CODE_TO_TIME);
+
+ */
+ 
+namespace benchmark {
+    // In case high_resolution_clock is steady, prefer that, otherwise use steady_clock.
+    struct best_clock {
+        using hi_res_clock = std::chrono::high_resolution_clock;
+        using steady_clock = std::chrono::steady_clock;
+        using type = std::conditional<hi_res_clock::is_steady, hi_res_clock, steady_clock>::type;
+    };
+    using clock = best_clock::type;
+    using time_point = clock::time_point;
+    using duration = clock::duration;
+
+    class State {
+        std::string name;
+        duration maxElapsed;
+        time_point beginTime, lastTime;
+        duration minTime, maxTime;
+        uint64_t count;
+        uint64_t countMask;
+        uint64_t beginCycles;
+        uint64_t lastCycles;
+        uint64_t minCycles;
+        uint64_t maxCycles;
+    public:
+        State(std::string _name, duration _maxElapsed) :
+            name(_name),
+            maxElapsed(_maxElapsed),
+            minTime(duration::max()),
+            maxTime(duration::zero()),
+            count(0),
+            countMask(1),
+            beginCycles(0),
+            lastCycles(0),
+            minCycles(std::numeric_limits<uint64_t>::max()),
+            maxCycles(std::numeric_limits<uint64_t>::min()) {
+        }
+        bool KeepRunning();
+    };
+
+    typedef std::function<void(State&)> BenchFunction;
+
+    class BenchRunner
+    {
+        typedef std::map<std::string, BenchFunction> BenchmarkMap;
+        static BenchmarkMap &benchmarks();
+
+    public:
+        BenchRunner(std::string name, BenchFunction func);
+
+        static void RunAll(duration elapsedTimeForOne = std::chrono::seconds(1));
+    };
+}
+
+// BENCHMARK(foo) expands to:  benchmark::BenchRunner bench_11foo("foo", foo);
+#define BENCHMARK(n) \
+    benchmark::BenchRunner BOOST_PP_CAT(bench_, BOOST_PP_CAT(__LINE__, n))(BOOST_PP_STRINGIZE(n), n);
+
+#endif // BITCOIN_BENCH_BENCH_H
diff --git a/depend/zcash/src/bench/bench_bitcoin.cpp b/depend/zcash/src/bench/bench_bitcoin.cpp
new file mode 100644
index 000000000..ec4edc5b6
--- /dev/null
+++ b/depend/zcash/src/bench/bench_bitcoin.cpp
@@ -0,0 +1,47 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "bench.h"
+
+#include "fs.h"
+#include "key.h"
+#include "main.h"
+#include "util.h"
+
+#include "librustzcash.h"
+
+const std::function<std::string(const char*)> G_TRANSLATION_FUN = nullptr;
+
+int
+main(int argc, char** argv)
+{
+    ECC_Start();
+    auto globalVerifyHandle = new ECCVerifyHandle();
+    SetupEnvironment();
+    fPrintToDebugLog = false; // don't want to write to debug.log file
+
+    fs::path sapling_spend = ZC_GetParamsDir() / "sapling-spend.params";
+    fs::path sapling_output = ZC_GetParamsDir() / "sapling-output.params";
+    fs::path sprout_groth16 = ZC_GetParamsDir() / "sprout-groth16.params";
+
+    static_assert(
+        sizeof(fs::path::value_type) == sizeof(codeunit),
+        "librustzcash not configured correctly");
+    auto sapling_spend_str = sapling_spend.native();
+    auto sapling_output_str = sapling_output.native();
+    auto sprout_groth16_str = sprout_groth16.native();
+
+    librustzcash_init_zksnark_params(
+        reinterpret_cast<const codeunit*>(sapling_spend_str.c_str()),
+        sapling_spend_str.length(),
+        reinterpret_cast<const codeunit*>(sapling_output_str.c_str()),
+        sapling_output_str.length(),
+        reinterpret_cast<const codeunit*>(sprout_groth16_str.c_str()),
+        sprout_groth16_str.length()
+    );
+
+    benchmark::BenchRunner::RunAll();
+
+    ECC_Stop();
+}
diff --git a/depend/zcash/src/bench/checkqueue.cpp b/depend/zcash/src/bench/checkqueue.cpp
new file mode 100644
index 000000000..c5903cdd0
--- /dev/null
+++ b/depend/zcash/src/bench/checkqueue.cpp
@@ -0,0 +1,103 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "bench.h"
+#include "util.h"
+#include "main.h"
+#include "checkqueue.h"
+#include "prevector.h"
+#include <vector>
+#include <boost/thread/thread.hpp>
+#include "random.h"
+
+
+// This Benchmark tests the CheckQueue with the lightest
+// weight Checks, so it should make any lock contention
+// particularly visible
+static const int MIN_CORES = 2;
+static const size_t BATCHES = 101;
+static const size_t BATCH_SIZE = 30;
+static const int PREVECTOR_SIZE = 28;
+static const unsigned int QUEUE_BATCH_SIZE = 128;
+static void CCheckQueueSpeed(benchmark::State& state)
+{
+    struct FakeJobNoWork {
+        bool operator()()
+        {
+            return true;
+        }
+        void swap(FakeJobNoWork& x){};
+    };
+    CCheckQueue<FakeJobNoWork> queue {QUEUE_BATCH_SIZE};
+    boost::thread_group tg;
+    for (auto x = 0; x < std::max(MIN_CORES, GetNumCores()); ++x) {
+       tg.create_thread([&]{queue.Thread();});
+    }
+    while (state.KeepRunning()) {
+        CCheckQueueControl<FakeJobNoWork> control(&queue);
+
+        // We call Add a number of times to simulate the behavior of adding
+        // a block of transactions at once.
+
+        std::vector<std::vector<FakeJobNoWork>> vBatches(BATCHES);
+        for (auto& vChecks : vBatches) {
+            vChecks.resize(BATCH_SIZE);
+        }
+        for (auto& vChecks : vBatches) {
+            // We can't make vChecks in the inner loop because we want to measure
+            // the cost of getting the memory to each thread and we might get the same
+            // memory
+            control.Add(vChecks);
+        }
+        // control waits for completion by RAII, but
+        // it is done explicitly here for clarity
+        control.Wait();
+    }
+    tg.interrupt_all();
+    tg.join_all();
+}
+
+// This Benchmark tests the CheckQueue with a slightly realistic workload,
+// where checks all contain a prevector that is indirect 50% of the time
+// and there is a little bit of work done between calls to Add.
+static void CCheckQueueSpeedPrevectorJob(benchmark::State& state)
+{
+    struct PrevectorJob {
+        prevector<PREVECTOR_SIZE, uint8_t> p;
+        PrevectorJob(){
+        }
+        PrevectorJob(FastRandomContext& insecure_rand){
+            p.resize(insecure_rand.randrange(PREVECTOR_SIZE*2));
+        }
+        bool operator()()
+        {
+            return true;
+        }
+        void swap(PrevectorJob& x){p.swap(x.p);};
+    };
+    CCheckQueue<PrevectorJob> queue {QUEUE_BATCH_SIZE};
+    boost::thread_group tg;
+    for (auto x = 0; x < std::max(MIN_CORES, GetNumCores()); ++x) {
+       tg.create_thread([&]{queue.Thread();});
+    }
+    while (state.KeepRunning()) {
+        // Make insecure_rand here so that each iteration is identical.
+        FastRandomContext insecure_rand(true);
+        CCheckQueueControl<PrevectorJob> control(&queue);
+        std::vector<std::vector<PrevectorJob>> vBatches(BATCHES);
+        for (auto& vChecks : vBatches) {
+            vChecks.reserve(BATCH_SIZE);
+            for (size_t x = 0; x < BATCH_SIZE; ++x)
+                vChecks.emplace_back(insecure_rand);
+            control.Add(vChecks);
+        }
+        // control waits for completion by RAII, but
+        // it is done explicitly here for clarity
+        control.Wait();
+    }
+    tg.interrupt_all();
+    tg.join_all();
+}
+BENCHMARK(CCheckQueueSpeed);
+BENCHMARK(CCheckQueueSpeedPrevectorJob);
diff --git a/depend/zcash/src/bench/crypto_hash.cpp b/depend/zcash/src/bench/crypto_hash.cpp
new file mode 100644
index 000000000..2f70580f0
--- /dev/null
+++ b/depend/zcash/src/bench/crypto_hash.cpp
@@ -0,0 +1,79 @@
+// Copyright (c) 2016 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include <iostream>
+
+#include "bench.h"
+#include "bloom.h"
+#include "random.h"
+#include "utiltime.h"
+#include "crypto/ripemd160.h"
+#include "crypto/sha1.h"
+#include "crypto/sha256.h"
+#include "crypto/sha512.h"
+
+/* Number of bytes to hash per iteration */
+static const uint64_t BUFFER_SIZE = 1000*1000;
+
+static void RIPEMD160(benchmark::State& state)
+{
+    uint8_t hash[CRIPEMD160::OUTPUT_SIZE];
+    std::vector<uint8_t> in(BUFFER_SIZE,0);
+    while (state.KeepRunning())
+        CRIPEMD160().Write(begin_ptr(in), in.size()).Finalize(hash);
+}
+
+static void SHA1(benchmark::State& state)
+{
+    uint8_t hash[CSHA1::OUTPUT_SIZE];
+    std::vector<uint8_t> in(BUFFER_SIZE,0);
+    while (state.KeepRunning())
+        CSHA1().Write(begin_ptr(in), in.size()).Finalize(hash);
+}
+
+static void SHA256(benchmark::State& state)
+{
+    uint8_t hash[CSHA256::OUTPUT_SIZE];
+    std::vector<uint8_t> in(BUFFER_SIZE,0);
+    while (state.KeepRunning())
+        CSHA256().Write(begin_ptr(in), in.size()).Finalize(hash);
+}
+
+static void SHA512(benchmark::State& state)
+{
+    uint8_t hash[CSHA512::OUTPUT_SIZE];
+    std::vector<uint8_t> in(BUFFER_SIZE,0);
+    while (state.KeepRunning())
+        CSHA512().Write(begin_ptr(in), in.size()).Finalize(hash);
+}
+
+static void FastRandom_32bit(benchmark::State& state)
+{
+    FastRandomContext rng(true);
+    uint32_t x = 0;
+    while (state.KeepRunning()) {
+        for (int i = 0; i < 1000000; i++) {
+            x += rng.rand32();
+        }
+    }
+}
+
+static void FastRandom_1bit(benchmark::State& state)
+{
+    FastRandomContext rng(true);
+    uint32_t x = 0;
+    while (state.KeepRunning()) {
+        for (int i = 0; i < 1000000; i++) {
+            x += rng.randbool();
+        }
+    }
+}
+
+BENCHMARK(RIPEMD160);
+BENCHMARK(SHA1);
+BENCHMARK(SHA256);
+BENCHMARK(SHA512);
+
+BENCHMARK(FastRandom_32bit);
+BENCHMARK(FastRandom_1bit);
diff --git a/depend/zcash/src/bench/lockedpool.cpp b/depend/zcash/src/bench/lockedpool.cpp
new file mode 100644
index 000000000..4226d6b82
--- /dev/null
+++ b/depend/zcash/src/bench/lockedpool.cpp
@@ -0,0 +1,46 @@
+// Copyright (c) 2016 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "bench.h"
+
+#include "support/lockedpool.h"
+
+#include <iostream>
+#include <vector>
+
+#define ASIZE 2048
+#define BITER 5000
+#define MSIZE 2048
+
+static void LockedPool(benchmark::State& state)
+{
+    void *synth_base = reinterpret_cast<void*>(0x08000000);
+    const size_t synth_size = 1024*1024;
+    Arena b(synth_base, synth_size, 16);
+
+    std::vector<void*> addr;
+    for (int x=0; x<ASIZE; ++x)
+        addr.push_back(nullptr);
+    uint32_t s = 0x12345678;
+    while (state.KeepRunning()) {
+        for (int x=0; x<BITER; ++x) {
+            int idx = s & (addr.size()-1);
+            if (s & 0x80000000) {
+                b.free(addr[idx]);
+                addr[idx] = nullptr;
+            } else if(!addr[idx]) {
+                addr[idx] = b.alloc((s >> 16) & (MSIZE-1));
+            }
+            bool lsb = s & 1;
+            s >>= 1;
+            if (lsb)
+                s ^= 0xf00f00f0; // LFSR period 0xf7ffffe1
+        }
+    }
+    for (void *ptr: addr)
+        b.free(ptr);
+    addr.clear();
+}
+
+BENCHMARK(LockedPool);
diff --git a/depend/zcash/src/bench/perf.cpp b/depend/zcash/src/bench/perf.cpp
new file mode 100644
index 000000000..fdc2cb692
--- /dev/null
+++ b/depend/zcash/src/bench/perf.cpp
@@ -0,0 +1,53 @@
+// Copyright (c) 2016 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "perf.h"
+
+#if defined(__i386__) || defined(__x86_64__)
+
+/* These architectures support querying the cycle counter
+ * from user space, no need for any syscall overhead.
+ */
+void perf_init(void) { }
+void perf_fini(void) { }
+
+#elif defined(__linux__)
+
+#include <unistd.h>
+#include <sys/syscall.h>
+#include <linux/perf_event.h>
+
+static int fd = -1;
+static struct perf_event_attr attr;
+
+void perf_init(void)
+{
+    attr.type = PERF_TYPE_HARDWARE;
+    attr.config = PERF_COUNT_HW_CPU_CYCLES;
+    fd = syscall(__NR_perf_event_open, &attr, 0, -1, -1, 0);
+}
+
+void perf_fini(void)
+{
+    if (fd != -1) {
+        close(fd);
+    }
+}
+
+uint64_t perf_cpucycles(void)
+{
+    uint64_t result = 0;
+    if (fd == -1 || read(fd, &result, sizeof(result)) < (ssize_t)sizeof(result)) {
+        return 0;
+    }
+    return result;
+}
+
+#else /* Unhandled platform */
+
+void perf_init(void) { }
+void perf_fini(void) { }
+uint64_t perf_cpucycles(void) { return 0; }
+
+#endif
diff --git a/depend/zcash/src/bench/perf.h b/depend/zcash/src/bench/perf.h
new file mode 100644
index 000000000..630c70093
--- /dev/null
+++ b/depend/zcash/src/bench/perf.h
@@ -0,0 +1,37 @@
+// Copyright (c) 2016 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+/** Functions for measurement of CPU cycles */
+#ifndef BITCOIN_BENCH_PERF_H
+#define BITCOIN_BENCH_PERF_H
+
+#include <stdint.h>
+
+#if defined(__i386__)
+
+static inline uint64_t perf_cpucycles(void)
+{
+    uint64_t x;
+    __asm__ volatile (".byte 0x0f, 0x31" : "=A" (x));
+    return x;
+}
+
+#elif defined(__x86_64__)
+
+static inline uint64_t perf_cpucycles(void)
+{
+    uint32_t hi, lo;
+    __asm__ __volatile__ ("rdtsc" : "=a"(lo), "=d"(hi));
+    return ((uint64_t)lo)|(((uint64_t)hi)<<32);
+}
+#else
+
+uint64_t perf_cpucycles(void);
+
+#endif
+
+void perf_init(void);
+void perf_fini(void);
+
+#endif // BITCOIN_BENCH_PERF_H
diff --git a/depend/zcash/src/bench/prevector_destructor.cpp b/depend/zcash/src/bench/prevector_destructor.cpp
new file mode 100644
index 000000000..7f2881615
--- /dev/null
+++ b/depend/zcash/src/bench/prevector_destructor.cpp
@@ -0,0 +1,36 @@
+// Copyright (c) 2015-2017 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "bench.h"
+#include "prevector.h"
+
+static void PrevectorDestructor(benchmark::State& state)
+{
+    while (state.KeepRunning()) {
+        for (auto x = 0; x < 1000; ++x) {
+            prevector<28, unsigned char> t0;
+            prevector<28, unsigned char> t1;
+            t0.resize(28);
+            t1.resize(29);
+        }
+    }
+}
+
+static void PrevectorClear(benchmark::State& state)
+{
+
+    while (state.KeepRunning()) {
+        for (auto x = 0; x < 1000; ++x) {
+            prevector<28, unsigned char> t0;
+            prevector<28, unsigned char> t1;
+            t0.resize(28);
+            t0.clear();
+            t1.resize(29);
+            t0.clear();
+        }
+    }
+}
+
+BENCHMARK(PrevectorDestructor);
+BENCHMARK(PrevectorClear);
diff --git a/depend/zcash/src/bench/rollingbloom.cpp b/depend/zcash/src/bench/rollingbloom.cpp
new file mode 100644
index 000000000..038e36fd5
--- /dev/null
+++ b/depend/zcash/src/bench/rollingbloom.cpp
@@ -0,0 +1,51 @@
+// Copyright (c) 2016 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include <iostream>
+
+#include "bench.h"
+#include "bloom.h"
+
+static void RollingBloom(benchmark::State& state)
+{
+    CRollingBloomFilter filter(120000, 0.000001);
+    std::vector<unsigned char> data(32);
+    uint32_t count = 0;
+    uint32_t nEntriesPerGeneration = (120000 + 1) / 2;
+    uint32_t countnow = 0;
+    uint64_t match = 0;
+    while (state.KeepRunning()) {
+        count++;
+        data[0] = count;
+        data[1] = count >> 8;
+        data[2] = count >> 16;
+        data[3] = count >> 24;
+        if (countnow == nEntriesPerGeneration) {
+            auto b = benchmark::clock::now();
+            filter.insert(data);
+            auto total = std::chrono::duration_cast<std::chrono::nanoseconds>(benchmark::clock::now() - b).count();
+            std::cout << "RollingBloom-refresh,1," << total << "," << total << "," << total << "\n";
+            countnow = 0;
+        } else {
+            filter.insert(data);
+        }
+        countnow++;
+        data[0] = count >> 24;
+        data[1] = count >> 16;
+        data[2] = count >> 8;
+        data[3] = count;
+        match += filter.contains(data);
+    }
+}
+
+static void RollingBloomReset(benchmark::State& state)
+{
+    CRollingBloomFilter filter(120000, 0.000001);
+    while (state.KeepRunning()) {
+        filter.reset();
+    }
+}
+
+BENCHMARK(RollingBloom);
+BENCHMARK(RollingBloomReset); // To-backport: 20000
diff --git a/depend/zcash/src/bench/verification.cpp b/depend/zcash/src/bench/verification.cpp
new file mode 100644
index 000000000..c7f4c0391
--- /dev/null
+++ b/depend/zcash/src/bench/verification.cpp
@@ -0,0 +1,152 @@
+// Copyright (c) 2019 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "bench.h"
+#include "coins.h"
+#include "consensus/upgrades.h"
+#include "keystore.h"
+#include "primitives/transaction.h"
+#include "script/interpreter.h"
+#include "script/sign.h"
+#include "streams.h"
+#include "uint256.h"
+#include "utilstrencodings.h"
+#include "version.h"
+
+#include "librustzcash.h"
+#include <rust/ed25519.h>
+
+static void ECDSA(benchmark::State& state)
+{
+    uint32_t consensusBranchId = NetworkUpgradeInfo[Consensus::UPGRADE_OVERWINTER].nBranchId;
+    CMutableTransaction mtx;
+    mtx.fOverwintered = true;
+    mtx.nVersion = SAPLING_TX_VERSION;
+    mtx.nVersionGroupId = SAPLING_VERSION_GROUP_ID;
+
+    CKey key = CKey::TestOnlyRandomKey(false);
+    CBasicKeyStore keystore;
+    keystore.AddKeyPubKey(key, key.GetPubKey());
+    CKeyID hash = key.GetPubKey().GetID();
+    CScript scriptPubKey = GetScriptForDestination(hash);
+
+    // Benchmark a transaction containing a single input and output.
+    auto nInputs = 1;
+    for(uint32_t ij = 0; ij < nInputs; ij++) {
+        uint32_t i = mtx.vin.size();
+        uint256 prevId;
+        prevId.SetHex("0000000000000000000000000000000000000000000000000000000000000100");
+        COutPoint outpoint(prevId, i);
+
+        mtx.vin.resize(mtx.vin.size() + 1);
+        mtx.vin[i].prevout = outpoint;
+        mtx.vin[i].scriptSig = CScript();
+
+        mtx.vout.resize(mtx.vout.size() + 1);
+        mtx.vout[i].nValue = 1000;
+        mtx.vout[i].scriptPubKey = CScript() << OP_1;
+    }
+
+    std::vector<CTxOut> allPrevOutputs;
+    // for benchmarking we simply use dummy inputs
+    allPrevOutputs.resize(mtx.vin.size());
+    const PrecomputedTransactionData txdata(mtx, allPrevOutputs);
+
+    // sign all inputs
+    for(uint32_t i = 0; i < mtx.vin.size(); i++) {
+        bool hashSigned = SignSignature(keystore, scriptPubKey, mtx, txdata, i, 1000, SIGHASH_ALL, consensusBranchId);
+        assert(hashSigned);
+    }
+
+    CTransaction tx;
+    CDataStream ssout(SER_NETWORK, PROTOCOL_VERSION);
+    ssout << mtx;
+    ssout >> tx;
+
+    ScriptError error;
+
+    while (state.KeepRunning()) {
+        VerifyScript(
+            tx.vin[0].scriptSig,
+            scriptPubKey,
+            SCRIPT_VERIFY_P2SH,
+            TransactionSignatureChecker(&tx, txdata, 0, 1000),
+            consensusBranchId,
+            &error);
+    }
+}
+
+static void JoinSplitSig(benchmark::State& state)
+{
+    Ed25519VerificationKey joinSplitPubKey;
+    Ed25519SigningKey joinSplitPrivKey;
+    uint256 dataToBeSigned;
+    Ed25519Signature joinSplitSig;
+
+    ed25519_generate_keypair(&joinSplitPrivKey, &joinSplitPubKey);
+    ed25519_sign(&joinSplitPrivKey, dataToBeSigned.begin(), 32, &joinSplitSig);
+
+    while (state.KeepRunning()) {
+        // Declared with warn_unused_result.
+        auto res = ed25519_verify(
+            &joinSplitPubKey,
+            &joinSplitSig,
+            dataToBeSigned.begin(), 32);
+    }
+}
+
+static void SaplingSpend(benchmark::State& state)
+{
+    SpendDescription spend;
+    CDataStream ss(
+        ParseHex("8c6cf86bbb83bf0d075e5bd9bb4b5cd56141577be69f032880b11e26aa32aa5ef09fd00899e4b469fb11f38e9d09dc0379f0b11c23b5fe541765f76695120a03f0261d32af5d2a2b1e5c9a04200cd87d574dc42349de9790012ce560406a8a876a1e54cfcdc0eb74998abec2a9778330eeb2a0ac0e41d0c9ed5824fbd0dbf7da930ab299966ce333fd7bc1321dada0817aac5444e02c754069e218746bf879d5f2a20a8b028324fb2c73171e63336686aa5ec2e6e9a08eb18b87c14758c572f4531ccf6b55d09f44beb8b47563be4eff7a52598d80959dd9c9fee5ac4783d8370cb7d55d460053d3e067b5f9fe75ff2722623fb1825fcba5e9593d4205b38d1f502ff03035463043bd393a5ee039ce75a5d54f21b395255df6627ef96751566326f7d4a77d828aa21b1827282829fcbc42aad59cdb521e1a3aaa08b99ea8fe7fff0a04da31a52260fc6daeccd79bb877bdd8506614282258e15b3fe74bf71a93f4be3b770119edf99a317b205eea7d5ab800362b97384273888106c77d633600"),
+        SER_NETWORK,
+        PROTOCOL_VERSION);
+    ss >> spend;
+    uint256 dataToBeSigned = uint256S("0x2dbf83fe7b88a7cbd80fac0c719483906bb9a0c4fc69071e4780d5f2c76e592c");
+
+    auto ctx = librustzcash_sapling_verification_ctx_init(true);
+
+    while (state.KeepRunning()) {
+        librustzcash_sapling_check_spend(
+            ctx,
+            spend.cv.begin(),
+            spend.anchor.begin(),
+            spend.nullifier.begin(),
+            spend.rk.begin(),
+            spend.zkproof.begin(),
+            spend.spendAuthSig.begin(),
+            dataToBeSigned.begin());
+    }
+
+    librustzcash_sapling_verification_ctx_free(ctx);
+}
+
+static void SaplingOutput(benchmark::State& state)
+{
+    OutputDescription output;
+    CDataStream ss(
+        ParseHex("edd742af18857e5ec2d71d346a7fe2ac97c137339bd5268eea86d32e0ff4f38f76213fa8cfed3347ac4e8572dd88aff395c0c10a59f8b3f49d2bc539ed6c726667e29d4763f914ddd0abf1cdfa84e44de87c233434c7e69b8b5b8f4623c8aa444163425bae5cef842972fed66046c1c6ce65c866ad894d02e6e6dcaae7a962d9f2ef95757a09c486928e61f0f7aed90ad0a542b0d3dc5fe140dfa7626b9315c77e03b055f19cbacd21a866e46f06c00e0c7792b2a590a611439b510a9aaffcf1073bad23e712a9268b36888e3727033eee2ab4d869f54a843f93b36ef489fb177bf74b41a9644e5d2a0a417c6ac1c8869bc9b83273d453f878ed6fd96b82a5939903f7b64ecaf68ea16e255a7fb7cc0b6d8b5608a1c6b0ed3024cc62c2f0f9c5cfc7b431ae6e9d40815557aa1d010523f9e1960de77b2274cb6710d229d475c87ae900183206ba90cb5bbc8ec0df98341b82726c705e0308ca5dc08db4db609993a1046dfb43dfd8c760be506c0bed799bb2205fc29dc2e654dce731034a23b0aaf6da0199248702ee0523c159f41f4cbfff6c35ace4dd9ae834e44e09c76a0cbdda1d3f6a2c75ad71212daf9575ab5f09ca148718e667f29ddf18c8a330a86ace18a86e89454653902aa393c84c6b694f27d0d42e24e7ac9fe34733de5ec15f5066081ce912c62c1a804a2bb4dedcef7cc80274f6bb9e89e2fce91dc50d6a73c8aefb9872f1cf3524a92626a0b8f39bbf7bf7d96ca2f770fc04d7f457021c536a506a187a93b2245471ddbfb254a71bc4a0d72c8d639a31c7b1920087ffca05c24214157e2e7b28184e91989ef0b14f9b34c3dc3cc0ac64226b9e337095870cb0885737992e120346e630a416a9b217679ce5a778fb15779c136bcecca5efe79012013d77d90b4e99dd22c8f35bc77121716e160d05bd30d288ee8886390ee436f85bdc9029df888a3a3326d9d4ddba5cb5318b3274928829d662e96fea1d601f7a306251ed8c6cc4e5a3a7a98c35a3650482a0eee08f3b4c2da9b22947c96138f1505c2f081f8972d429f3871f32bef4aaa51aa6945df8e9c9760531ac6f627d17c1518202818a91ca304fb4037875c666060597976144fcbbc48a776a2c61beb9515fa8f3ae6d3a041d320a38a8ac75cb47bb9c866ee497fc3cd13299970c4b369c1c2ceb4220af082fbecdd8114492a8e4d713b5a73396fd224b36c1185bd5e20d683e6c8db35346c47ae7401988255da7cfffdced5801067d4d296688ee8fe424b4a8a69309ce257eefb9345ebfda3f6de46bb11ec94133e1f72cd7ac54934d6cf17b3440800e70b80ebc7c7bfc6fb0fc2c"),
+        SER_NETWORK,
+        PROTOCOL_VERSION);
+    ss >> output;
+
+    auto ctx = librustzcash_sapling_verification_ctx_init(true);
+
+    while (state.KeepRunning()) {
+        librustzcash_sapling_check_output(
+            ctx,
+            output.cv.begin(),
+            output.cmu.begin(),
+            output.ephemeralKey.begin(),
+            output.zkproof.begin());
+    }
+
+    librustzcash_sapling_verification_ctx_free(ctx);
+}
+
+BENCHMARK(ECDSA);
+BENCHMARK(JoinSplitSig);
+BENCHMARK(SaplingSpend);
+BENCHMARK(SaplingOutput);
diff --git a/depend/zcash/src/bitcoin-cli-res.rc b/depend/zcash/src/bitcoin-cli-res.rc
new file mode 100644
index 000000000..607c44420
--- /dev/null
+++ b/depend/zcash/src/bitcoin-cli-res.rc
@@ -0,0 +1,35 @@
+#include <windows.h>             // needed for VERSIONINFO
+#include "clientversion.h"       // holds the needed client version information
+
+#define VER_PRODUCTVERSION     CLIENT_VERSION_MAJOR,CLIENT_VERSION_MINOR,CLIENT_VERSION_REVISION,CLIENT_VERSION_BUILD
+#define VER_PRODUCTVERSION_STR STRINGIZE(CLIENT_VERSION_MAJOR) "." STRINGIZE(CLIENT_VERSION_MINOR) "." STRINGIZE(CLIENT_VERSION_REVISION) "." STRINGIZE(CLIENT_VERSION_BUILD)
+#define VER_FILEVERSION        VER_PRODUCTVERSION
+#define VER_FILEVERSION_STR    VER_PRODUCTVERSION_STR
+
+VS_VERSION_INFO VERSIONINFO
+FILEVERSION     VER_FILEVERSION
+PRODUCTVERSION  VER_PRODUCTVERSION
+FILEOS          VOS_NT_WINDOWS32
+FILETYPE        VFT_APP
+BEGIN
+    BLOCK "StringFileInfo"
+    BEGIN
+        BLOCK "040904E4" // U.S. English - multilingual (hex)
+        BEGIN
+            VALUE "CompanyName",        "Zcash"
+            VALUE "FileDescription",    "zcash-cli (JSON-RPC client for Zcash)"
+            VALUE "FileVersion",        VER_FILEVERSION_STR
+            VALUE "InternalName",       "zcash-cli"
+            VALUE "LegalCopyright",     COPYRIGHT_STR
+            VALUE "LegalTrademarks1",   "Distributed under the MIT software license, see the accompanying file COPYING or https://www.opensource.org/licenses/mit-license.php ."
+            VALUE "OriginalFilename",   "zcash-cli.exe"
+            VALUE "ProductName",        "zcash-cli"
+            VALUE "ProductVersion",     VER_PRODUCTVERSION_STR
+        END
+    END
+
+    BLOCK "VarFileInfo"
+    BEGIN
+        VALUE "Translation", 0x0, 1252 // language neutral - multilingual (decimal)
+    END
+END
diff --git a/depend/zcash/src/bitcoin-cli.cpp b/depend/zcash/src/bitcoin-cli.cpp
new file mode 100644
index 000000000..b78fb5461
--- /dev/null
+++ b/depend/zcash/src/bitcoin-cli.cpp
@@ -0,0 +1,436 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "chainparamsbase.h"
+#include "clientversion.h"
+#include "fs.h"
+#include "rpc/client.h"
+#include "rpc/protocol.h"
+#include "util.h"
+#include "utilstrencodings.h"
+
+#include <stdio.h>
+
+#include <event2/buffer.h>
+#include <event2/keyvalq_struct.h>
+#include "support/events.h"
+
+#include <univalue.h>
+
+#ifdef WIN32
+#include <windows.h>
+#else
+#include <termios.h>
+#include <unistd.h>
+#include <cerrno>
+#endif
+
+const std::function<std::string(const char*)> G_TRANSLATION_FUN = nullptr;
+
+static const char DEFAULT_RPCCONNECT[] = "127.0.0.1";
+static const int DEFAULT_HTTP_CLIENT_TIMEOUT=900;
+static const int CONTINUE_EXECUTION=-1;
+
+std::string HelpMessageCli()
+{
+    std::string strUsage;
+    strUsage += HelpMessageGroup(_("Options:"));
+    strUsage += HelpMessageOpt("-?", _("This help message"));
+    strUsage += HelpMessageOpt("-conf=<file>", strprintf(_("Specify configuration file (default: %s)"), BITCOIN_CONF_FILENAME));
+    strUsage += HelpMessageOpt("-datadir=<dir>", _("Specify data directory (this path cannot use '~')"));
+    strUsage += HelpMessageOpt("-stdin", _("Read extra arguments from standard input, one per line until EOF/Ctrl-D (recommended for sensitive information such as passphrases). If first extra argument is `walletpassphrase` then the first line(password) will not be echoed."));
+    AppendParamsHelpMessages(strUsage);
+    strUsage += HelpMessageOpt("-rpcconnect=<ip>", strprintf(_("Send commands to node running on <ip> (default: %s)"), DEFAULT_RPCCONNECT));
+    strUsage += HelpMessageOpt("-rpcport=<port>", strprintf(_("Connect to JSON-RPC on <port> (default: %u or testnet: %u)"), 8232, 18232));
+    strUsage += HelpMessageOpt("-rpcwait", _("Wait for RPC server to start"));
+    strUsage += HelpMessageOpt("-rpcuser=<user>", _("Username for JSON-RPC connections"));
+    strUsage += HelpMessageOpt("-rpcpassword=<pw>", _("Password for JSON-RPC connections"));
+    strUsage += HelpMessageOpt("-rpcclienttimeout=<n>", strprintf(_("Timeout in seconds during HTTP requests, or 0 for no timeout. (default: %d)"), DEFAULT_HTTP_CLIENT_TIMEOUT));
+
+    return strUsage;
+}
+
+//////////////////////////////////////////////////////////////////////////////
+//
+// Start
+//
+
+//
+// Exception thrown on connection error.  This error is used to determine
+// when to wait if -rpcwait is given.
+//
+class CConnectionFailed : public std::runtime_error
+{
+public:
+
+    explicit inline CConnectionFailed(const std::string& msg) :
+        std::runtime_error(msg)
+    {}
+
+};
+
+//
+// This function returns either one of EXIT_ codes when it's expected to stop the process or
+// CONTINUE_EXECUTION when it's expected to continue further.
+//
+static int AppInitRPC(int argc, char* argv[])
+{
+    static_assert(CONTINUE_EXECUTION != EXIT_FAILURE,
+                  "CONTINUE_EXECUTION should be different from EXIT_FAILURE");
+    static_assert(CONTINUE_EXECUTION != EXIT_SUCCESS,
+                  "CONTINUE_EXECUTION should be different from EXIT_SUCCESS");
+    //
+    // Parameters
+    //
+    ParseParameters(argc, argv);
+    if (argc<2 || mapArgs.count("-?") || mapArgs.count("-h") || mapArgs.count("-help") || mapArgs.count("-version")) {
+        std::string strUsage = _("Zcash RPC client version") + " " + FormatFullVersion() + "\n" + PrivacyInfo();
+        if (!mapArgs.count("-version")) {
+            strUsage += "\n" + _("Usage:") + "\n" +
+                  "  zcash-cli [options] <command> [params]  " + _("Send command to Zcash") + "\n" +
+                  "  zcash-cli [options] help                " + _("List commands") + "\n" +
+                  "  zcash-cli [options] help <command>      " + _("Get help for a command") + "\n";
+
+            strUsage += "\n" + HelpMessageCli();
+        } else {
+            strUsage += LicenseInfo();
+        }
+
+        fprintf(stdout, "%s", strUsage.c_str());
+        if (argc < 2) {
+            fprintf(stderr, "Error: too few parameters\n");
+            return EXIT_FAILURE;
+        }
+        return EXIT_SUCCESS;
+    }
+    if (!fs::is_directory(GetDataDir(false))) {
+        fprintf(stderr, "Error: Specified data directory \"%s\" does not exist.\n", mapArgs["-datadir"].c_str());
+        return EXIT_FAILURE;
+    }
+    try {
+        ReadConfigFile(GetArg("-conf", BITCOIN_CONF_FILENAME), mapArgs, mapMultiArgs);
+    } catch (const std::exception& e) {
+        fprintf(stderr,"Error reading configuration file: %s\n", e.what());
+        return EXIT_FAILURE;
+    }
+    // Check for -testnet or -regtest parameter (BaseParams() calls are only valid after this clause)
+    try {
+        SelectBaseParams(ChainNameFromCommandLine());
+    } catch(std::exception &e) {
+        fprintf(stderr, "Error: %s\n", e.what());
+        return EXIT_FAILURE;
+    }
+    if (GetBoolArg("-rpcssl", false))
+    {
+        fprintf(stderr, "Error: SSL mode for RPC (-rpcssl) is no longer supported.\n");
+        return EXIT_FAILURE;
+    }
+    return CONTINUE_EXECUTION;
+}
+
+
+/** Reply structure for request_done to fill in */
+struct HTTPReply
+{
+    HTTPReply(): status(0), error(-1) {}
+
+    int status;
+    int error;
+    std::string body;
+};
+
+const char *http_errorstring(int code)
+{
+    switch(code) {
+#if LIBEVENT_VERSION_NUMBER >= 0x02010300
+    case EVREQ_HTTP_TIMEOUT:
+        return "timeout reached";
+    case EVREQ_HTTP_EOF:
+        return "EOF reached";
+    case EVREQ_HTTP_INVALID_HEADER:
+        return "error while reading header, or invalid header";
+    case EVREQ_HTTP_BUFFER_ERROR:
+        return "error encountered while reading or writing";
+    case EVREQ_HTTP_REQUEST_CANCEL:
+        return "request was canceled";
+    case EVREQ_HTTP_DATA_TOO_LONG:
+        return "response body is larger than allowed";
+#endif
+    default:
+        return "unknown";
+    }
+}
+
+static void http_request_done(struct evhttp_request *req, void *ctx)
+{
+    HTTPReply *reply = static_cast<HTTPReply*>(ctx);
+
+    if (req == NULL) {
+        /* If req is NULL, it means an error occurred while connecting: the
+         * error code will have been passed to http_error_cb.
+         */
+        reply->status = 0;
+        return;
+    }
+
+    reply->status = evhttp_request_get_response_code(req);
+
+    struct evbuffer *buf = evhttp_request_get_input_buffer(req);
+    if (buf)
+    {
+        size_t size = evbuffer_get_length(buf);
+        const char *data = (const char*)evbuffer_pullup(buf, size);
+        if (data)
+            reply->body = std::string(data, size);
+        evbuffer_drain(buf, size);
+    }
+}
+
+#if LIBEVENT_VERSION_NUMBER >= 0x02010300
+static void http_error_cb(enum evhttp_request_error err, void *ctx)
+{
+    HTTPReply *reply = static_cast<HTTPReply*>(ctx);
+    reply->error = err;
+}
+#endif
+
+UniValue CallRPC(const std::string& strMethod, const UniValue& params)
+{
+    std::string host = GetArg("-rpcconnect", DEFAULT_RPCCONNECT);
+    int port = GetArg("-rpcport", BaseParams().RPCPort());
+
+    // Obtain event base
+    raii_event_base base = obtain_event_base();
+
+    // Synchronously look up hostname
+    raii_evhttp_connection evcon = obtain_evhttp_connection_base(base.get(), host, port);
+    evhttp_connection_set_timeout(evcon.get(), GetArg("-rpcclienttimeout", DEFAULT_HTTP_CLIENT_TIMEOUT));
+
+    HTTPReply response;
+    raii_evhttp_request req = obtain_evhttp_request(http_request_done, (void*)&response);
+    if (req == NULL)
+        throw std::runtime_error("create http request failed");
+#if LIBEVENT_VERSION_NUMBER >= 0x02010300
+    evhttp_request_set_error_cb(req.get(), http_error_cb);
+#endif
+
+    // Get credentials
+    std::string strRPCUserColonPass;
+    if (mapArgs["-rpcpassword"] == "") {
+        // Try fall back to cookie-based authentication if no password is provided
+        if (!GetAuthCookie(&strRPCUserColonPass)) {
+            throw std::runtime_error(strprintf(
+                _("Could not locate RPC credentials. No authentication cookie could be found,\n"
+                  "and no rpcpassword is set in the configuration file (%s)."),
+                    GetConfigFile(GetArg("-conf", BITCOIN_CONF_FILENAME)).string().c_str()));
+
+        }
+    } else {
+        strRPCUserColonPass = mapArgs["-rpcuser"] + ":" + mapArgs["-rpcpassword"];
+    }
+
+    struct evkeyvalq* output_headers = evhttp_request_get_output_headers(req.get());
+    assert(output_headers);
+    evhttp_add_header(output_headers, "Host", host.c_str());
+    evhttp_add_header(output_headers, "Connection", "close");
+    evhttp_add_header(output_headers, "Authorization", (std::string("Basic ") + EncodeBase64(strRPCUserColonPass)).c_str());
+
+    // Attach request data
+    std::string strRequest = JSONRPCRequest(strMethod, params, 1);
+    struct evbuffer* output_buffer = evhttp_request_get_output_buffer(req.get());
+    assert(output_buffer);
+    evbuffer_add(output_buffer, strRequest.data(), strRequest.size());
+
+    int r = evhttp_make_request(evcon.get(), req.get(), EVHTTP_REQ_POST, "/");
+    req.release(); // ownership moved to evcon in above call
+    if (r != 0) {
+        throw CConnectionFailed("send http request failed");
+    }
+
+    event_base_dispatch(base.get());
+
+    if (response.status == 0)
+        throw CConnectionFailed(strprintf("couldn't connect to server: %s (code %d)\n(make sure server is running and you are connecting to the correct RPC port)", http_errorstring(response.error), response.error));
+    else if (response.status == HTTP_UNAUTHORIZED)
+        throw std::runtime_error("incorrect rpcuser or rpcpassword (authorization failed)");
+    else if (response.status >= 400 && response.status != HTTP_BAD_REQUEST && response.status != HTTP_NOT_FOUND && response.status != HTTP_INTERNAL_SERVER_ERROR)
+        throw std::runtime_error(strprintf("server returned HTTP error %d", response.status));
+    else if (response.body.empty())
+        throw std::runtime_error("no response from server");
+
+    // Parse reply
+    UniValue valReply(UniValue::VSTR);
+    if (!valReply.read(response.body))
+        throw std::runtime_error("couldn't parse reply from server");
+    const UniValue& reply = valReply.get_obj();
+    if (reply.empty())
+        throw std::runtime_error("expected reply to have result, error and id properties");
+
+    return reply;
+}
+
+bool SetStdinEcho(bool enable = true)
+{
+#ifdef WIN32
+    HANDLE hStdin = GetStdHandle(STD_INPUT_HANDLE);
+    if (hStdin == INVALID_HANDLE_VALUE || hStdin == NULL) return false;
+    DWORD mode;
+    // if it's not a terminal then stdin won't be echoed, so that's not an error
+    DWORD dwStdinType = GetFileType(hStdin) & ~FILE_TYPE_REMOTE;
+    bool could_be_terminal = dwStdinType == FILE_TYPE_CHAR ||
+                            (dwStdinType == FILE_TYPE_UNKNOWN && GetLastError() == NO_ERROR);
+    if (!could_be_terminal || GetConsoleMode(hStdin, &mode) == 0) return true;
+
+    if (!enable)
+        mode &= ~ENABLE_ECHO_INPUT;
+    else
+        mode |= ENABLE_ECHO_INPUT;
+
+    if (SetConsoleMode(hStdin, mode) == 0) return false;
+
+#else
+    struct termios tty;
+    if (tcgetattr(STDIN_FILENO, &tty) != 0) {
+        // if it's not a terminal then stdin won't be echoed, so that's not an error
+        return errno == ENOTTY;
+    }
+    if (!enable)
+        tty.c_lflag &= ~ECHO;
+    else
+        tty.c_lflag |= ECHO;
+
+    if (tcsetattr(STDIN_FILENO, TCSANOW, &tty) != 0) return false;
+#endif
+    return true;
+}
+
+int CommandLineRPC(int argc, char *argv[])
+{
+    std::string strPrint;
+    int nRet = 0;
+    try {
+        // Skip switches
+        while (argc > 1 && IsSwitchChar(argv[1][0])) {
+            argc--;
+            argv++;
+        }
+        std::vector<std::string> args = std::vector<std::string>(&argv[1], &argv[argc]);
+        if (GetBoolArg("-stdin", false)) {
+            bool hide = false;
+            if (args.size() > 0 && args[0] == "walletpassphrase") {
+                if (!SetStdinEcho(false))
+                    throw std::runtime_error("unable to set terminal to non-echoing");
+                hide = true;
+            }
+
+            // Read one arg per line from stdin and append
+            std::string line;
+            while (std::getline(std::cin,line)) {
+                args.push_back(line);
+                if (hide) {
+                    if (!SetStdinEcho(true))
+                        throw std::runtime_error("unable to set terminal back to echoing");
+                    hide = false;
+                }
+            }
+        }
+        if (args.size() < 1)
+            throw std::runtime_error("too few parameters (need at least command)");
+        std::string strMethod = args[0];
+        UniValue params = RPCConvertValues(strMethod, std::vector<std::string>(args.begin()+1, args.end()));
+
+        // Execute and handle connection failures with -rpcwait
+        const bool fWait = GetBoolArg("-rpcwait", false);
+        do {
+            try {
+                const UniValue reply = CallRPC(strMethod, params);
+
+                // Parse reply
+                const UniValue& result = find_value(reply, "result");
+                const UniValue& error  = find_value(reply, "error");
+
+                if (!error.isNull()) {
+                    // Error
+                    int code = error["code"].get_int();
+                    if (fWait && code == RPC_IN_WARMUP)
+                        throw CConnectionFailed("server in warmup");
+                    strPrint = "error: " + error.write();
+                    nRet = abs(code);
+                    if (error.isObject())
+                    {
+                        UniValue errCode = find_value(error, "code");
+                        UniValue errMsg  = find_value(error, "message");
+                        strPrint = errCode.isNull() ? "" : "error code: "+errCode.getValStr()+"\n";
+
+                        if (errMsg.isStr())
+                            strPrint += "error message:\n"+errMsg.get_str();
+                    }
+                } else {
+                    // Result
+                    if (result.isNull())
+                        strPrint = "";
+                    else if (result.isStr())
+                        strPrint = result.get_str();
+                    else
+                        strPrint = result.write(2);
+                }
+                // Connection succeeded, no need to retry.
+                break;
+            }
+            catch (const CConnectionFailed&) {
+                if (fWait)
+                    MilliSleep(1000);
+                else
+                    throw;
+            }
+        } while (fWait);
+    }
+    catch (const std::exception& e) {
+        strPrint = std::string("error: ") + e.what();
+        nRet = EXIT_FAILURE;
+    }
+    catch (...) {
+        PrintExceptionContinue(NULL, "CommandLineRPC()");
+        throw;
+    }
+
+    if (strPrint != "") {
+        fprintf((nRet == 0 ? stdout : stderr), "%s\n", strPrint.c_str());
+    }
+    return nRet;
+}
+
+int main(int argc, char* argv[])
+{
+    SetupEnvironment();
+    if (!SetupNetworking()) {
+        fprintf(stderr, "Error: Initializing networking failed\n");
+        return EXIT_FAILURE;
+    }
+
+    try {
+        int ret = AppInitRPC(argc, argv);
+        if (ret != CONTINUE_EXECUTION)
+            return ret;
+    }
+    catch (const std::exception& e) {
+        PrintExceptionContinue(&e, "AppInitRPC()");
+        return EXIT_FAILURE;
+    } catch (...) {
+        PrintExceptionContinue(NULL, "AppInitRPC()");
+        return EXIT_FAILURE;
+    }
+
+    int ret = EXIT_FAILURE;
+    try {
+        ret = CommandLineRPC(argc, argv);
+    }
+    catch (const std::exception& e) {
+        PrintExceptionContinue(&e, "CommandLineRPC()");
+    } catch (...) {
+        PrintExceptionContinue(NULL, "CommandLineRPC()");
+    }
+    return ret;
+}
diff --git a/depend/zcash/src/bitcoin-tx-res.rc b/depend/zcash/src/bitcoin-tx-res.rc
new file mode 100644
index 000000000..028394e36
--- /dev/null
+++ b/depend/zcash/src/bitcoin-tx-res.rc
@@ -0,0 +1,35 @@
+#include <windows.h>             // needed for VERSIONINFO
+#include "clientversion.h"       // holds the needed client version information
+
+#define VER_PRODUCTVERSION     CLIENT_VERSION_MAJOR,CLIENT_VERSION_MINOR,CLIENT_VERSION_REVISION,CLIENT_VERSION_BUILD
+#define VER_PRODUCTVERSION_STR STRINGIZE(CLIENT_VERSION_MAJOR) "." STRINGIZE(CLIENT_VERSION_MINOR) "." STRINGIZE(CLIENT_VERSION_REVISION) "." STRINGIZE(CLIENT_VERSION_BUILD)
+#define VER_FILEVERSION        VER_PRODUCTVERSION
+#define VER_FILEVERSION_STR    VER_PRODUCTVERSION_STR
+
+VS_VERSION_INFO VERSIONINFO
+FILEVERSION     VER_FILEVERSION
+PRODUCTVERSION  VER_PRODUCTVERSION
+FILEOS          VOS_NT_WINDOWS32
+FILETYPE        VFT_APP
+BEGIN
+    BLOCK "StringFileInfo"
+    BEGIN
+        BLOCK "040904E4" // U.S. English - multilingual (hex)
+        BEGIN
+            VALUE "CompanyName",        "Zcash"
+            VALUE "FileDescription",    "zcash-tx (CLI Zcash transaction editor utility)"
+            VALUE "FileVersion",        VER_FILEVERSION_STR
+            VALUE "InternalName",       "zcash-tx"
+            VALUE "LegalCopyright",     COPYRIGHT_STR
+            VALUE "LegalTrademarks1",   "Distributed under the MIT software license, see the accompanying file COPYING or https://www.opensource.org/licenses/mit-license.php ."
+            VALUE "OriginalFilename",   "zcash-tx.exe"
+            VALUE "ProductName",        "zcash-tx"
+            VALUE "ProductVersion",     VER_PRODUCTVERSION_STR
+        END
+    END
+
+    BLOCK "VarFileInfo"
+    BEGIN
+        VALUE "Translation", 0x0, 1252 // language neutral - multilingual (decimal)
+    END
+END
diff --git a/depend/zcash/src/bitcoin-tx.cpp b/depend/zcash/src/bitcoin-tx.cpp
new file mode 100644
index 000000000..a15e2e1e9
--- /dev/null
+++ b/depend/zcash/src/bitcoin-tx.cpp
@@ -0,0 +1,712 @@
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "clientversion.h"
+#include "coins.h"
+#include "consensus/consensus.h"
+#include "consensus/upgrades.h"
+#include "core_io.h"
+#include "key_io.h"
+#include "keystore.h"
+#include "policy/policy.h"
+#include "primitives/transaction.h"
+#include "script/script.h"
+#include "script/sign.h"
+#include <univalue.h>
+#include "util.h"
+#include "utilmoneystr.h"
+#include "utilstrencodings.h"
+
+#include <stdio.h>
+
+#include <boost/algorithm/string.hpp>
+#include <boost/assign/list_of.hpp>
+
+static bool fCreateBlank;
+static std::map<std::string,UniValue> registers;
+static const int CONTINUE_EXECUTION=-1;
+
+const std::function<std::string(const char*)> G_TRANSLATION_FUN = nullptr;
+
+//
+// This function returns either one of EXIT_ codes when it's expected to stop the process or
+// CONTINUE_EXECUTION when it's expected to continue further.
+//
+static int AppInitRawTx(int argc, char* argv[])
+{
+    //
+    // Parameters
+    //
+    ParseParameters(argc, argv);
+
+    // Check for -testnet or -regtest parameter (Params() calls are only valid after this clause)
+    try {
+        SelectParams(ChainNameFromCommandLine());
+    } catch(std::exception &e) {
+        fprintf(stderr, "Error: %s\n", e.what());
+        return false;
+    }
+
+    fCreateBlank = GetBoolArg("-create", false);
+
+    if (argc<2 || mapArgs.count("-?") || mapArgs.count("-h") || mapArgs.count("-help"))
+    {
+        // First part of help message is specific to this utility
+        std::string strUsage = _("Zcash zcash-tx utility version") + " " + FormatFullVersion() + "\n\n" +
+            _("Usage:") + "\n" +
+              "  zcash-tx [options] <hex-tx> [commands]  " + _("Update hex-encoded zcash transaction") + "\n" +
+              "  zcash-tx [options] -create [commands]   " + _("Create hex-encoded zcash transaction") + "\n" +
+              "\n";
+
+        fprintf(stdout, "%s", strUsage.c_str());
+
+        strUsage = HelpMessageGroup(_("Options:"));
+        strUsage += HelpMessageOpt("-?", _("This help message"));
+        strUsage += HelpMessageOpt("-create", _("Create new, empty TX."));
+        strUsage += HelpMessageOpt("-json", _("Select JSON output"));
+        strUsage += HelpMessageOpt("-txid", _("Output only the hex-encoded transaction id of the resultant transaction."));
+        AppendParamsHelpMessages(strUsage);
+
+        fprintf(stdout, "%s", strUsage.c_str());
+
+        strUsage = HelpMessageGroup(_("Commands:"));
+        strUsage += HelpMessageOpt("delin=N", _("Delete input N from TX"));
+        strUsage += HelpMessageOpt("delout=N", _("Delete output N from TX"));
+        strUsage += HelpMessageOpt("in=TXID:VOUT(:SEQUENCE_NUMBER)", _("Add input to TX"));
+        strUsage += HelpMessageOpt("locktime=N", _("Set TX lock time to N"));
+        strUsage += HelpMessageOpt("nversion=N", _("Set TX version to N"));
+        strUsage += HelpMessageOpt("outaddr=VALUE:ADDRESS", _("Add address-based output to TX"));
+        strUsage += HelpMessageOpt("outscript=VALUE:SCRIPT", _("Add raw script output to TX"));
+        strUsage += HelpMessageOpt("sign=HEIGHT:SIGHASH-FLAGS", _("Add zero or more signatures to transaction") + ". " +
+            _("This command requires JSON registers:") +
+            _("prevtxs=JSON object") + ", " +
+            _("privatekeys=JSON object") + ". " +
+            _("See signrawtransaction docs for format of sighash flags, JSON objects."));
+        fprintf(stdout, "%s", strUsage.c_str());
+
+        strUsage = HelpMessageGroup(_("Register Commands:"));
+        strUsage += HelpMessageOpt("load=NAME:FILENAME", _("Load JSON file FILENAME into register NAME"));
+        strUsage += HelpMessageOpt("set=NAME:JSON-STRING", _("Set register NAME to given JSON-STRING"));
+        fprintf(stdout, "%s", strUsage.c_str());
+
+        if (argc < 2) {
+            fprintf(stderr, "Error: too few parameters\n");
+            return EXIT_FAILURE;
+        }
+        return EXIT_SUCCESS;
+    }
+    return CONTINUE_EXECUTION;
+}
+
+static void RegisterSetJson(const std::string& key, const std::string& rawJson)
+{
+    UniValue val;
+    if (!val.read(rawJson)) {
+        std::string strErr = "Cannot parse JSON for key " + key;
+        throw std::runtime_error(strErr);
+    }
+
+    registers[key] = val;
+}
+
+static void RegisterSet(const std::string& strInput)
+{
+    // separate NAME:VALUE in string
+    size_t pos = strInput.find(':');
+    if ((pos == std::string::npos) ||
+        (pos == 0) ||
+        (pos == (strInput.size() - 1)))
+        throw std::runtime_error("Register input requires NAME:VALUE");
+
+    std::string key = strInput.substr(0, pos);
+    std::string valStr = strInput.substr(pos + 1, std::string::npos);
+
+    RegisterSetJson(key, valStr);
+}
+
+static void RegisterLoad(const std::string& strInput)
+{
+    // separate NAME:FILENAME in string
+    size_t pos = strInput.find(':');
+    if ((pos == std::string::npos) ||
+        (pos == 0) ||
+        (pos == (strInput.size() - 1)))
+        throw std::runtime_error("Register load requires NAME:FILENAME");
+
+    std::string key = strInput.substr(0, pos);
+    std::string filename = strInput.substr(pos + 1, std::string::npos);
+
+    FILE *f = fopen(filename.c_str(), "r");
+    if (!f) {
+        std::string strErr = "Cannot open file " + filename;
+        throw std::runtime_error(strErr);
+    }
+
+    // load file chunks into one big buffer
+    std::string valStr;
+    while ((!feof(f)) && (!ferror(f))) {
+        char buf[4096];
+        int bread = fread(buf, 1, sizeof(buf), f);
+        if (bread <= 0)
+            break;
+
+        valStr.insert(valStr.size(), buf, bread);
+    }
+
+    int error = ferror(f);
+    fclose(f);
+
+    if (error) {
+        std::string strErr = "Error reading file " + filename;
+        throw std::runtime_error(strErr);
+    }
+
+    // evaluate as JSON buffer register
+    RegisterSetJson(key, valStr);
+}
+
+static void MutateTxVersion(CMutableTransaction& tx, const std::string& cmdVal)
+{
+    int64_t newVersion = atoi64(cmdVal);
+    if (newVersion < CTransaction::SPROUT_MIN_CURRENT_VERSION || newVersion > CTransaction::SPROUT_MAX_CURRENT_VERSION)
+        throw std::runtime_error("Invalid TX version requested");
+
+    tx.nVersion = (int) newVersion;
+}
+
+static void MutateTxExpiry(CMutableTransaction& tx, const std::string& cmdVal)
+{
+    int64_t newExpiry = atoi64(cmdVal);
+    if (newExpiry <= 0 || newExpiry >= TX_EXPIRY_HEIGHT_THRESHOLD) {
+        throw std::runtime_error("Invalid TX expiry requested");
+    }
+    tx.nExpiryHeight = (int) newExpiry;
+}
+
+static void MutateTxLocktime(CMutableTransaction& tx, const std::string& cmdVal)
+{
+    int64_t newLocktime = atoi64(cmdVal);
+    if (newLocktime < 0LL || newLocktime > 0xffffffffLL)
+        throw std::runtime_error("Invalid TX locktime requested");
+
+    tx.nLockTime = (unsigned int) newLocktime;
+}
+
+static void MutateTxAddInput(CMutableTransaction& tx, const std::string& strInput)
+{
+    std::vector<std::string> vStrInputParts;
+    boost::split(vStrInputParts, strInput, boost::is_any_of(":"));
+
+    // separate TXID:VOUT in string
+    if (vStrInputParts.size()<2)
+        throw std::runtime_error("TX input missing separator");
+
+    // extract and validate TXID
+    std::string strTxid = vStrInputParts[0];
+    if ((strTxid.size() != 64) || !IsHex(strTxid))
+        throw std::runtime_error("invalid TX input txid");
+    uint256 txid(uint256S(strTxid));
+
+    static const unsigned int minTxOutSz = 9;
+    static const unsigned int maxVout = MAX_BLOCK_SIZE / minTxOutSz;
+
+    // extract and validate vout
+    std::string strVout = vStrInputParts[1];
+    int vout = atoi(strVout);
+    if ((vout < 0) || (vout > (int)maxVout))
+        throw std::runtime_error("invalid TX input vout");
+
+    // extract the optional sequence number
+    uint32_t nSequenceIn=std::numeric_limits<unsigned int>::max();
+    if (vStrInputParts.size() > 2)
+        nSequenceIn = atoi(vStrInputParts[2]);
+
+    // append to transaction input list
+    CTxIn txin(txid, vout, CScript(), nSequenceIn);
+    tx.vin.push_back(txin);
+}
+
+static void MutateTxAddOutAddr(CMutableTransaction& tx, const std::string& strInput)
+{
+    // separate VALUE:ADDRESS in string
+    size_t pos = strInput.find(':');
+    if ((pos == std::string::npos) ||
+        (pos == 0) ||
+        (pos == (strInput.size() - 1)))
+        throw std::runtime_error("TX output missing separator");
+
+    // extract and validate VALUE
+    std::string strValue = strInput.substr(0, pos);
+    CAmount value;
+    if (!ParseMoney(strValue, value))
+        throw std::runtime_error("invalid TX output value");
+
+    KeyIO keyIO(Params());
+
+    // extract and validate ADDRESS
+    std::string strAddr = strInput.substr(pos + 1, std::string::npos);
+    CTxDestination destination = keyIO.DecodeDestination(strAddr);
+    if (!IsValidDestination(destination)) {
+        throw std::runtime_error("invalid TX output address");
+    }
+    CScript scriptPubKey = GetScriptForDestination(destination);
+
+    // construct TxOut, append to transaction output list
+    CTxOut txout(value, scriptPubKey);
+    tx.vout.push_back(txout);
+}
+
+static void MutateTxAddOutScript(CMutableTransaction& tx, const std::string& strInput)
+{
+    // separate VALUE:SCRIPT in string
+    size_t pos = strInput.find(':');
+    if ((pos == std::string::npos) ||
+        (pos == 0))
+        throw std::runtime_error("TX output missing separator");
+
+    // extract and validate VALUE
+    std::string strValue = strInput.substr(0, pos);
+    CAmount value;
+    if (!ParseMoney(strValue, value))
+        throw std::runtime_error("invalid TX output value");
+
+    // extract and validate script
+    std::string strScript = strInput.substr(pos + 1, std::string::npos);
+    CScript scriptPubKey = ParseScript(strScript); // throws on err
+
+    // construct TxOut, append to transaction output list
+    CTxOut txout(value, scriptPubKey);
+    tx.vout.push_back(txout);
+}
+
+static void MutateTxDelInput(CMutableTransaction& tx, const std::string& strInIdx)
+{
+    // parse requested deletion index
+    int inIdx = atoi(strInIdx);
+    if (inIdx < 0 || inIdx >= (int)tx.vin.size()) {
+        std::string strErr = "Invalid TX input index '" + strInIdx + "'";
+        throw std::runtime_error(strErr.c_str());
+    }
+
+    // delete input from transaction
+    tx.vin.erase(tx.vin.begin() + inIdx);
+}
+
+static void MutateTxDelOutput(CMutableTransaction& tx, const std::string& strOutIdx)
+{
+    // parse requested deletion index
+    int outIdx = atoi(strOutIdx);
+    if (outIdx < 0 || outIdx >= (int)tx.vout.size()) {
+        std::string strErr = "Invalid TX output index '" + strOutIdx + "'";
+        throw std::runtime_error(strErr.c_str());
+    }
+
+    // delete output from transaction
+    tx.vout.erase(tx.vout.begin() + outIdx);
+}
+
+static const unsigned int N_SIGHASH_OPTS = 6;
+static const struct {
+    const char *flagStr;
+    int flags;
+} sighashOptions[N_SIGHASH_OPTS] = {
+    {"ALL", SIGHASH_ALL},
+    {"NONE", SIGHASH_NONE},
+    {"SINGLE", SIGHASH_SINGLE},
+    {"ALL|ANYONECANPAY", SIGHASH_ALL|SIGHASH_ANYONECANPAY},
+    {"NONE|ANYONECANPAY", SIGHASH_NONE|SIGHASH_ANYONECANPAY},
+    {"SINGLE|ANYONECANPAY", SIGHASH_SINGLE|SIGHASH_ANYONECANPAY},
+};
+
+static bool findSighashFlags(int& flags, const std::string& flagStr)
+{
+    flags = 0;
+
+    for (unsigned int i = 0; i < N_SIGHASH_OPTS; i++) {
+        if (flagStr == sighashOptions[i].flagStr) {
+            flags = sighashOptions[i].flags;
+            return true;
+        }
+    }
+
+    return false;
+}
+
+uint256 ParseHashUO(std::map<std::string,UniValue>& o, std::string strKey)
+{
+    if (!o.count(strKey))
+        return uint256();
+    return ParseHashUV(o[strKey], strKey);
+}
+
+std::vector<unsigned char> ParseHexUO(std::map<std::string,UniValue>& o, std::string strKey)
+{
+    if (!o.count(strKey)) {
+        std::vector<unsigned char> emptyVec;
+        return emptyVec;
+    }
+    return ParseHexUV(o[strKey], strKey);
+}
+
+static CAmount AmountFromValue(const UniValue& value)
+{
+    if (!value.isNum() && !value.isStr())
+        throw std::runtime_error("Amount is not a number or string");
+    CAmount amount;
+    if (!ParseFixedPoint(value.getValStr(), 8, &amount))
+        throw std::runtime_error("Invalid amount");
+    if (!MoneyRange(amount))
+        throw std::runtime_error("Amount out of range");
+    return amount;
+}
+
+static void MutateTxSign(CMutableTransaction& tx, const std::string& strInput)
+{
+    // separate HEIGHT:SIGHASH-FLAGS in string
+    size_t pos = strInput.find(':');
+    if ((pos == 0) ||
+        (pos == (strInput.size() - 1)))
+        throw std::runtime_error("Invalid sighash flag separator");
+
+    // extract and validate HEIGHT
+    std::string strHeight = strInput.substr(0, pos);
+    int nHeight = atoi(strHeight);
+    if (nHeight <= 0) {
+        throw std::runtime_error("invalid height");
+    }
+
+    // extract and validate SIGHASH-FLAGS
+    int nHashType = SIGHASH_ALL;
+    std::string flagStr;
+    if (pos != std::string::npos) {
+        flagStr = strInput.substr(pos + 1, std::string::npos);
+    }
+    if (flagStr.size() > 0)
+        if (!findSighashFlags(nHashType, flagStr))
+            throw std::runtime_error("unknown sighash flag/sign option");
+
+    std::vector<CTransaction> txVariants;
+    txVariants.push_back(tx);
+
+    // mergedTx will end up with all the signatures; it
+    // starts as a clone of the raw tx:
+    CMutableTransaction mergedTx(txVariants[0]);
+    bool fComplete = true;
+    CCoinsView viewDummy;
+    CCoinsViewCache view(&viewDummy);
+
+    if (!registers.count("privatekeys"))
+        throw std::runtime_error("privatekeys register variable must be set.");
+    bool fGivenKeys = false;
+    CBasicKeyStore tempKeystore;
+    UniValue keysObj = registers["privatekeys"];
+    fGivenKeys = true;
+
+    KeyIO keyIO(Params());
+
+    for (size_t kidx = 0; kidx < keysObj.size(); kidx++) {
+        if (!keysObj[kidx].isStr())
+            throw std::runtime_error("privatekey not a std::string");
+        CKey key = keyIO.DecodeSecret(keysObj[kidx].getValStr());
+        if (!key.IsValid()) {
+            throw std::runtime_error("privatekey not valid");
+        }
+        tempKeystore.AddKey(key);
+    }
+
+    // Add previous txouts given in the RPC call:
+    if (!registers.count("prevtxs"))
+        throw std::runtime_error("prevtxs register variable must be set.");
+    UniValue prevtxsObj = registers["prevtxs"];
+    {
+        for (size_t previdx = 0; previdx < prevtxsObj.size(); previdx++) {
+            UniValue prevOut = prevtxsObj[previdx];
+            if (!prevOut.isObject())
+                throw std::runtime_error("expected prevtxs internal object");
+
+            std::map<std::string,UniValue::VType> types = boost::assign::map_list_of("txid", UniValue::VSTR)("vout",UniValue::VNUM)("scriptPubKey",UniValue::VSTR);
+            if (!prevOut.checkObject(types))
+                throw std::runtime_error("prevtxs internal object typecheck fail");
+
+            uint256 txid = ParseHashUV(prevOut["txid"], "txid");
+
+            int nOut = atoi(prevOut["vout"].getValStr());
+            if (nOut < 0)
+                throw std::runtime_error("vout must be positive");
+
+            std::vector<unsigned char> pkData(ParseHexUV(prevOut["scriptPubKey"], "scriptPubKey"));
+            CScript scriptPubKey(pkData.begin(), pkData.end());
+
+            {
+                CCoinsModifier coins = view.ModifyCoins(txid);
+                if (coins->IsAvailable(nOut) && coins->vout[nOut].scriptPubKey != scriptPubKey) {
+                    std::string err("Previous output scriptPubKey mismatch:\n");
+                    err = err + ScriptToAsmStr(coins->vout[nOut].scriptPubKey) + "\nvs:\n"+
+                        ScriptToAsmStr(scriptPubKey);
+                    throw std::runtime_error(err);
+                }
+                if ((unsigned int)nOut >= coins->vout.size())
+                    coins->vout.resize(nOut+1);
+                coins->vout[nOut].scriptPubKey = scriptPubKey;
+                coins->vout[nOut].nValue = 0;
+                if (prevOut.exists("amount")) {
+                    coins->vout[nOut].nValue = AmountFromValue(prevOut["amount"]);
+                }
+            }
+
+            // if redeemScript given and private keys given,
+            // add redeemScript to the tempKeystore so it can be signed:
+            if (fGivenKeys && scriptPubKey.IsPayToScriptHash() &&
+                prevOut.exists("redeemScript")) {
+                UniValue v = prevOut["redeemScript"];
+                std::vector<unsigned char> rsData(ParseHexUV(v, "redeemScript"));
+                CScript redeemScript(rsData.begin(), rsData.end());
+                tempKeystore.AddCScript(redeemScript);
+            }
+        }
+    }
+
+    const CKeyStore& keystore = tempKeystore;
+    // We don't support v5 transactions via this API yet.
+    if (mergedTx.nVersion >= ZIP225_TX_VERSION) {
+        throw std::runtime_error("v5+ transactions not supported yet");
+    }
+    const PrecomputedTransactionData txdata(mergedTx, {});
+
+    bool fHashSingle = ((nHashType & ~SIGHASH_ANYONECANPAY) == SIGHASH_SINGLE);
+
+    // Grab the consensus branch ID for the given height
+    auto consensusBranchId = CurrentEpochBranchId(nHeight, Params().GetConsensus());
+
+    // Sign what we can:
+    for (unsigned int i = 0; i < mergedTx.vin.size(); i++) {
+        CTxIn& txin = mergedTx.vin[i];
+        const CCoins* coins = view.AccessCoins(txin.prevout.hash);
+        if (!coins || !coins->IsAvailable(txin.prevout.n)) {
+            fComplete = false;
+            continue;
+        }
+        const CScript& prevPubKey = coins->vout[txin.prevout.n].scriptPubKey;
+        const CAmount& amount = coins->vout[txin.prevout.n].nValue;
+
+        SignatureData sigdata;
+        // Only sign SIGHASH_SINGLE if there's a corresponding output:
+        if (!fHashSingle || (i < mergedTx.vout.size()))
+            ProduceSignature(MutableTransactionSignatureCreator(&keystore, &mergedTx, txdata, i, amount, nHashType), prevPubKey, sigdata, consensusBranchId);
+
+        // ... and merge in other signatures:
+        for (const CTransaction& txv : txVariants)
+            sigdata = CombineSignatures(prevPubKey, MutableTransactionSignatureChecker(&mergedTx, txdata, i, amount), sigdata, DataFromTransaction(txv, i), consensusBranchId);
+        UpdateTransaction(mergedTx, i, sigdata);
+
+        if (!VerifyScript(txin.scriptSig, prevPubKey, STANDARD_SCRIPT_VERIFY_FLAGS, MutableTransactionSignatureChecker(&mergedTx, txdata, i, amount), consensusBranchId))
+            fComplete = false;
+    }
+
+    if (fComplete) {
+        // do nothing... for now
+        // perhaps store this for later optional JSON output
+    }
+
+    tx = mergedTx;
+}
+
+class Secp256k1Init
+{
+    ECCVerifyHandle globalVerifyHandle;
+
+public:
+    Secp256k1Init() {
+        ECC_Start();
+    }
+    ~Secp256k1Init() {
+        ECC_Stop();
+    }
+};
+
+static void MutateTx(CMutableTransaction& tx, const std::string& command,
+                     const std::string& commandVal)
+{
+    boost::scoped_ptr<Secp256k1Init> ecc;
+
+    if (command == "nversion")
+        MutateTxVersion(tx, commandVal);
+    else if (command == "locktime")
+        MutateTxLocktime(tx, commandVal);
+    else if (command == "expiry")
+        MutateTxExpiry(tx, commandVal);
+
+    else if (command == "delin")
+        MutateTxDelInput(tx, commandVal);
+    else if (command == "in")
+        MutateTxAddInput(tx, commandVal);
+
+    else if (command == "delout")
+        MutateTxDelOutput(tx, commandVal);
+    else if (command == "outaddr")
+        MutateTxAddOutAddr(tx, commandVal);
+    else if (command == "outscript")
+        MutateTxAddOutScript(tx, commandVal);
+
+    else if (command == "sign") {
+        if (!ecc) { ecc.reset(new Secp256k1Init()); }
+        MutateTxSign(tx, commandVal);
+    }
+
+    else if (command == "load")
+        RegisterLoad(commandVal);
+
+    else if (command == "set")
+        RegisterSet(commandVal);
+
+    else
+        throw std::runtime_error("unknown command");
+}
+
+static void OutputTxJSON(const CTransaction& tx)
+{
+    UniValue entry(UniValue::VOBJ);
+    TxToUniv(tx, uint256(), entry);
+
+    std::string jsonOutput = entry.write(4);
+    fprintf(stdout, "%s\n", jsonOutput.c_str());
+}
+
+static void OutputTxHash(const CTransaction& tx)
+{
+    std::string strHexHash = tx.GetHash().GetHex(); // the hex-encoded transaction hash (aka the transaction id)
+
+    fprintf(stdout, "%s\n", strHexHash.c_str());
+}
+
+static void OutputTxHex(const CTransaction& tx)
+{
+    std::string strHex = EncodeHexTx(tx);
+
+    fprintf(stdout, "%s\n", strHex.c_str());
+}
+
+static void OutputTx(const CTransaction& tx)
+{
+    if (GetBoolArg("-json", false))
+        OutputTxJSON(tx);
+    else if (GetBoolArg("-txid", false))
+        OutputTxHash(tx);
+    else
+        OutputTxHex(tx);
+}
+
+static std::string readStdin()
+{
+    char buf[4096];
+    std::string ret;
+
+    while (!feof(stdin)) {
+        size_t bread = fread(buf, 1, sizeof(buf), stdin);
+        ret.append(buf, bread);
+        if (bread < sizeof(buf))
+            break;
+    }
+
+    if (ferror(stdin))
+        throw std::runtime_error("error reading stdin");
+
+    boost::algorithm::trim_right(ret);
+
+    return ret;
+}
+
+static int CommandLineRawTx(int argc, char* argv[])
+{
+    std::string strPrint;
+    int nRet = 0;
+    try {
+        // Skip switches; Permit common stdin convention "-"
+        while (argc > 1 && IsSwitchChar(argv[1][0]) &&
+               (argv[1][1] != 0)) {
+            argc--;
+            argv++;
+        }
+
+        CTransaction txDecodeTmp;
+        int startArg;
+
+        if (!fCreateBlank) {
+            // require at least one param
+            if (argc < 2)
+                throw std::runtime_error("too few parameters");
+
+            // param: hex-encoded bitcoin transaction
+            std::string strHexTx(argv[1]);
+            if (strHexTx == "-")                 // "-" implies standard input
+                strHexTx = readStdin();
+
+            if (!DecodeHexTx(txDecodeTmp, strHexTx))
+                throw std::runtime_error("invalid transaction encoding");
+
+            startArg = 2;
+        } else
+            startArg = 1;
+
+        CMutableTransaction tx(txDecodeTmp);
+
+        for (int i = startArg; i < argc; i++) {
+            std::string arg = argv[i];
+            std::string key, value;
+            size_t eqpos = arg.find('=');
+            if (eqpos == std::string::npos)
+                key = arg;
+            else {
+                key = arg.substr(0, eqpos);
+                value = arg.substr(eqpos + 1);
+            }
+
+            MutateTx(tx, key, value);
+        }
+
+        OutputTx(tx);
+    }
+    catch (const std::exception& e) {
+        strPrint = std::string("error: ") + e.what();
+        nRet = EXIT_FAILURE;
+    }
+    catch (...) {
+        PrintExceptionContinue(NULL, "CommandLineRawTx()");
+        throw;
+    }
+
+    if (strPrint != "") {
+        fprintf((nRet == 0 ? stdout : stderr), "%s\n", strPrint.c_str());
+    }
+    return nRet;
+}
+
+int main(int argc, char* argv[])
+{
+    SetupEnvironment();
+
+    try {
+        int ret = AppInitRawTx(argc, argv);
+        if (ret != CONTINUE_EXECUTION)
+            return ret;
+    }
+    catch (const std::exception& e) {
+        PrintExceptionContinue(&e, "AppInitRawTx()");
+        return EXIT_FAILURE;
+    } catch (...) {
+        PrintExceptionContinue(NULL, "AppInitRawTx()");
+        return EXIT_FAILURE;
+    }
+
+    int ret = EXIT_FAILURE;
+    try {
+        ret = CommandLineRawTx(argc, argv);
+    }
+    catch (const std::exception& e) {
+        PrintExceptionContinue(&e, "CommandLineRawTx()");
+    } catch (...) {
+        PrintExceptionContinue(NULL, "CommandLineRawTx()");
+    }
+    return ret;
+}
diff --git a/depend/zcash/src/bitcoind-res.rc b/depend/zcash/src/bitcoind-res.rc
new file mode 100644
index 000000000..de544f10f
--- /dev/null
+++ b/depend/zcash/src/bitcoind-res.rc
@@ -0,0 +1,35 @@
+#include <windows.h>             // needed for VERSIONINFO
+#include "clientversion.h"       // holds the needed client version information
+
+#define VER_PRODUCTVERSION     CLIENT_VERSION_MAJOR,CLIENT_VERSION_MINOR,CLIENT_VERSION_REVISION,CLIENT_VERSION_BUILD
+#define VER_PRODUCTVERSION_STR STRINGIZE(CLIENT_VERSION_MAJOR) "." STRINGIZE(CLIENT_VERSION_MINOR) "." STRINGIZE(CLIENT_VERSION_REVISION) "." STRINGIZE(CLIENT_VERSION_BUILD)
+#define VER_FILEVERSION        VER_PRODUCTVERSION
+#define VER_FILEVERSION_STR    VER_PRODUCTVERSION_STR
+
+VS_VERSION_INFO VERSIONINFO
+FILEVERSION     VER_FILEVERSION
+PRODUCTVERSION  VER_PRODUCTVERSION
+FILEOS          VOS_NT_WINDOWS32
+FILETYPE        VFT_APP
+BEGIN
+    BLOCK "StringFileInfo"
+    BEGIN
+        BLOCK "040904E4" // U.S. English - multilingual (hex)
+        BEGIN
+            VALUE "CompanyName",        "Zcash"
+            VALUE "FileDescription",    "zcashd (Zcash node with a JSON-RPC server)"
+            VALUE "FileVersion",        VER_FILEVERSION_STR
+            VALUE "InternalName",       "zcashd"
+            VALUE "LegalCopyright",     COPYRIGHT_STR
+            VALUE "LegalTrademarks1",   "Distributed under the MIT software license, see the accompanying file COPYING or https://www.opensource.org/licenses/mit-license.php ."
+            VALUE "OriginalFilename",   "zcashd.exe"
+            VALUE "ProductName",        "zcashd"
+            VALUE "ProductVersion",     VER_PRODUCTVERSION_STR
+        END
+    END
+
+    BLOCK "VarFileInfo"
+    BEGIN
+        VALUE "Translation", 0x0, 1252 // language neutral - multilingual (decimal)
+    END
+END
diff --git a/depend/zcash/src/bitcoind.cpp b/depend/zcash/src/bitcoind.cpp
new file mode 100644
index 000000000..f62a4270b
--- /dev/null
+++ b/depend/zcash/src/bitcoind.cpp
@@ -0,0 +1,224 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "clientversion.h"
+#include "deprecation.h"
+#include "fs.h"
+#include "rpc/server.h"
+#include "init.h"
+#include "main.h"
+#include "noui.h"
+#include "scheduler.h"
+#include "util.h"
+#include "httpserver.h"
+#include "httprpc.h"
+
+#include <boost/algorithm/string/predicate.hpp>
+#include <boost/thread.hpp>
+
+#include <stdio.h>
+
+const std::function<std::string(const char*)> G_TRANSLATION_FUN = nullptr;
+
+/* Introduction text for doxygen: */
+
+/*! \mainpage Developer documentation
+ *
+ * \section intro_sec Introduction
+ *
+ * This is the developer documentation of the reference client for an experimental new digital currency called Bitcoin (https://www.bitcoin.org/),
+ * which enables instant payments to anyone, anywhere in the world. Bitcoin uses peer-to-peer technology to operate
+ * with no central authority: managing transactions and issuing money are carried out collectively by the network.
+ *
+ * The software is a community-driven open source project, released under the MIT license.
+ *
+ * \section Navigation
+ * Use the buttons <code>Namespaces</code>, <code>Classes</code> or <code>Files</code> at the top of the page to start navigating the code.
+ */
+
+static bool fDaemon;
+
+void WaitForShutdown(boost::thread_group* threadGroup)
+{
+    bool fShutdown = ShutdownRequested();
+    // Tell the main threads to shutdown.
+    while (!fShutdown)
+    {
+        MilliSleep(200);
+        fShutdown = ShutdownRequested();
+    }
+    if (threadGroup)
+    {
+        Interrupt(*threadGroup);
+        threadGroup->join_all();
+    }
+}
+
+//////////////////////////////////////////////////////////////////////////////
+//
+// Start
+//
+bool AppInit(int argc, char* argv[])
+{
+    boost::thread_group threadGroup;
+    CScheduler scheduler;
+
+    bool fRet = false;
+
+    //
+    // Parameters
+    //
+    ParseParameters(argc, argv);
+
+    // Process help and version before taking care about datadir
+    if (mapArgs.count("-?") || mapArgs.count("-h") ||  mapArgs.count("-help") || mapArgs.count("-version"))
+    {
+        std::string strUsage = _("Zcash Daemon") + " " + _("version") + " " + FormatFullVersion() + "\n" + PrivacyInfo();
+
+        if (mapArgs.count("-version"))
+        {
+            strUsage += LicenseInfo();
+        }
+        else
+        {
+            strUsage += "\n" + _("Usage:") + "\n" +
+                  "  zcashd [options]                     " + _("Start Zcash Daemon") + "\n";
+
+            strUsage += "\n" + HelpMessage(HMM_BITCOIND);
+        }
+
+        fprintf(stdout, "%s", strUsage.c_str());
+        return true;
+    }
+
+    // Handle setting of allowed-deprecated features as early as possible
+    // so that it's possible for other initialization steps to respect them.
+    auto deprecationError = SetAllowedDeprecatedFeaturesFromCLIArgs();
+    if (deprecationError.has_value()) {
+        fprintf(stderr, "%s", deprecationError.value().c_str());
+        return false;
+    }
+
+    try
+    {
+        if (!fs::is_directory(GetDataDir(false)))
+        {
+            fprintf(stderr, "Error: Specified data directory \"%s\" does not exist.\n", mapArgs["-datadir"].c_str());
+            return false;
+        }
+        try
+        {
+            ReadConfigFile(GetArg("-conf", BITCOIN_CONF_FILENAME), mapArgs, mapMultiArgs);
+        } catch (const missing_zcash_conf& e) {
+            auto confFilename = GetArg("-conf", BITCOIN_CONF_FILENAME);
+            fprintf(stderr,
+                (_("Before starting zcashd, you need to create a configuration file:\n"
+                   "%s\n"
+                   "It can be completely empty! That indicates you are happy with the default\n"
+                   "configuration of zcashd. But requiring a configuration file to start ensures\n"
+                   "that zcashd won't accidentally compromise your privacy if there was a default\n"
+                   "option you needed to change.\n"
+                   "\n"
+                   "You can look at the example configuration file for suggestions of default\n"
+                   "options that you may want to change. It should be in one of these locations,\n"
+                   "depending on how you installed Zcash:\n") +
+                 _("- Source code:  %s%s\n"
+                   "- .deb package: %s%s\n")).c_str(),
+                GetConfigFile(confFilename).string().c_str(),
+                "contrib/debian/examples/", confFilename.c_str(),
+                "/usr/share/doc/zcash/examples/", confFilename.c_str());
+            return false;
+        } catch (const std::exception& e) {
+            fprintf(stderr,"Error reading configuration file: %s\n", e.what());
+            return false;
+        }
+        // Check for -testnet or -regtest parameter (Params() calls are only valid after this clause)
+        try {
+            SelectParams(ChainNameFromCommandLine());
+        } catch(std::exception &e) {
+            fprintf(stderr, "Error: %s\n", e.what());
+            return false;
+        }
+
+        // Command-line RPC
+        bool fCommandLine = false;
+        for (int i = 1; i < argc; i++)
+            if (!IsSwitchChar(argv[i][0]) && !boost::algorithm::istarts_with(argv[i], "zcash:"))
+                fCommandLine = true;
+
+        if (fCommandLine)
+        {
+            fprintf(stderr, "Error: There is no RPC client functionality in zcashd. Use the zcash-cli utility instead.\n");
+            exit(EXIT_FAILURE);
+        }
+#ifndef WIN32
+        fDaemon = GetBoolArg("-daemon", false);
+        if (fDaemon)
+        {
+            fprintf(stdout, "Zcash server starting\n");
+
+            // Daemonize
+            pid_t pid = fork();
+            if (pid < 0)
+            {
+                fprintf(stderr, "Error: fork() returned %d errno %d\n", pid, errno);
+                return false;
+            }
+            if (pid > 0) // Parent process, pid is child process id
+            {
+                return true;
+            }
+            // Child process falls through to rest of initialization
+
+            pid_t sid = setsid();
+            if (sid < 0)
+                fprintf(stderr, "Error: setsid() returned %d errno %d\n", sid, errno);
+        }
+#endif
+        SoftSetBoolArg("-server", true);
+
+        // Set this early so that parameter interactions go to console
+        InitLogging();
+
+        // Now that we have logging set up, start the initialization span.
+        auto span = TracingSpan("info", "main", "Init");
+        auto spanGuard = span.Enter();
+
+        InitParameterInteraction();
+        fRet = AppInit2(threadGroup, scheduler);
+    }
+    catch (const std::exception& e) {
+        PrintExceptionContinue(&e, "AppInit()");
+    } catch (...) {
+        PrintExceptionContinue(NULL, "AppInit()");
+    }
+
+    if (!fRet)
+    {
+        Interrupt(threadGroup);
+        // threadGroup.join_all(); was left out intentionally here, because we didn't re-test all of
+        // the startup-failure cases to make sure they don't result in a hang due to some
+        // thread-blocking-waiting-for-another-thread-during-startup case
+    } else {
+        WaitForShutdown(&threadGroup);
+    }
+    Shutdown();
+
+    return fRet;
+}
+#ifdef ZCASH_FUZZ
+#warning BUILDING A FUZZER, NOT THE REAL MAIN
+#include "fuzz.cpp"
+#else
+int main(int argc, char* argv[])
+{
+    SetupEnvironment();
+
+    // Connect bitcoind signal handlers
+    noui_connect();
+
+    return (AppInit(argc, argv) ? EXIT_SUCCESS : EXIT_FAILURE);
+}
+#endif
diff --git a/depend/zcash/src/bloom.cpp b/depend/zcash/src/bloom.cpp
new file mode 100644
index 000000000..b95420075
--- /dev/null
+++ b/depend/zcash/src/bloom.cpp
@@ -0,0 +1,276 @@
+// Copyright (c) 2012-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "bloom.h"
+
+#include "primitives/transaction.h"
+#include "hash.h"
+#include "script/script.h"
+#include "script/standard.h"
+#include "random.h"
+#include "streams.h"
+
+#include <math.h>
+#include <stdlib.h>
+
+#include <algorithm>
+
+#define LN2SQUARED 0.4804530139182014246671025263266649717305529515945455
+#define LN2 0.6931471805599453094172321214581765680755001343602552
+
+CBloomFilter::CBloomFilter(const unsigned int nElements, const double nFPRate, const unsigned int nTweakIn, unsigned char nFlagsIn) :
+    /**
+     * The ideal size for a bloom filter with a given number of elements and false positive rate is:
+     * - nElements * log(fp rate) / ln(2)^2
+     * We ignore filter parameters which will create a bloom filter larger than the protocol limits
+     */
+    vData(std::min((unsigned int)(-1  / LN2SQUARED * nElements * log(nFPRate)), MAX_BLOOM_FILTER_SIZE * 8) / 8),
+    /**
+     * The ideal number of hash functions is filter size * ln(2) / number of elements
+     * Again, we ignore filter parameters which will create a bloom filter with more hash functions than the protocol limits
+     * See https://en.wikipedia.org/wiki/Bloom_filter for an explanation of these formulas
+     */
+    nHashFuncs(std::min((unsigned int)(vData.size() * 8 / nElements * LN2), MAX_HASH_FUNCS)),
+    nTweak(nTweakIn),
+    nFlags(nFlagsIn)
+{
+}
+
+inline unsigned int CBloomFilter::Hash(unsigned int nHashNum, const std::vector<unsigned char>& vDataToHash) const
+{
+    // 0xFBA4C795 chosen as it guarantees a reasonable bit difference between nHashNum values.
+    return MurmurHash3(nHashNum * 0xFBA4C795 + nTweak, vDataToHash) % (vData.size() * 8);
+}
+
+void CBloomFilter::insert(const std::vector<unsigned char>& vKey)
+{
+    if (vData.empty()) // Avoid divide-by-zero (CVE-2013-5700)
+        return;
+    for (unsigned int i = 0; i < nHashFuncs; i++)
+    {
+        unsigned int nIndex = Hash(i, vKey);
+        // Sets bit nIndex of vData
+        vData[nIndex >> 3] |= (1 << (7 & nIndex));
+    }
+}
+
+void CBloomFilter::insert(const COutPoint& outpoint)
+{
+    CDataStream stream(SER_NETWORK, PROTOCOL_VERSION);
+    stream << outpoint;
+    std::vector<unsigned char> data(stream.begin(), stream.end());
+    insert(data);
+}
+
+void CBloomFilter::insert(const uint256& hash)
+{
+    std::vector<unsigned char> data(hash.begin(), hash.end());
+    insert(data);
+}
+
+bool CBloomFilter::contains(const std::vector<unsigned char>& vKey) const
+{
+    if (vData.empty()) // Avoid divide-by-zero (CVE-2013-5700)
+        return true;
+    for (unsigned int i = 0; i < nHashFuncs; i++)
+    {
+        unsigned int nIndex = Hash(i, vKey);
+        // Checks bit nIndex of vData
+        if (!(vData[nIndex >> 3] & (1 << (7 & nIndex))))
+            return false;
+    }
+    return true;
+}
+
+bool CBloomFilter::contains(const COutPoint& outpoint) const
+{
+    CDataStream stream(SER_NETWORK, PROTOCOL_VERSION);
+    stream << outpoint;
+    std::vector<unsigned char> data(stream.begin(), stream.end());
+    return contains(data);
+}
+
+bool CBloomFilter::contains(const uint256& hash) const
+{
+    std::vector<unsigned char> data(hash.begin(), hash.end());
+    return contains(data);
+}
+
+bool CBloomFilter::IsWithinSizeConstraints() const
+{
+    return vData.size() <= MAX_BLOOM_FILTER_SIZE && nHashFuncs <= MAX_HASH_FUNCS;
+}
+
+bool CBloomFilter::IsRelevantAndUpdate(const CTransaction& tx)
+{
+    bool fFound = false;
+    // Match if the filter contains the hash of tx
+    //  for finding tx when they appear in a block
+    if (vData.empty()) // zero-size = "match-all" filter
+        return true;
+    const uint256& hash = tx.GetHash();
+    if (contains(hash))
+        fFound = true;
+
+    for (unsigned int i = 0; i < tx.vout.size(); i++)
+    {
+        const CTxOut& txout = tx.vout[i];
+        // Match if the filter contains any arbitrary script data element in any scriptPubKey in tx
+        // If this matches, also add the specific output that was matched.
+        // This means clients don't have to update the filter themselves when a new relevant tx 
+        // is discovered in order to find spending transactions, which avoids round-tripping and race conditions.
+        CScript::const_iterator pc = txout.scriptPubKey.begin();
+        std::vector<unsigned char> data;
+        while (pc < txout.scriptPubKey.end())
+        {
+            opcodetype opcode;
+            if (!txout.scriptPubKey.GetOp(pc, opcode, data))
+                break;
+            if (data.size() != 0 && contains(data))
+            {
+                fFound = true;
+                if ((nFlags & BLOOM_UPDATE_MASK) == BLOOM_UPDATE_ALL)
+                    insert(COutPoint(hash, i));
+                else if ((nFlags & BLOOM_UPDATE_MASK) == BLOOM_UPDATE_P2PUBKEY_ONLY)
+                {
+                    txnouttype type;
+                    std::vector<std::vector<unsigned char> > vSolutions;
+                    if (Solver(txout.scriptPubKey, type, vSolutions) &&
+                            (type == TX_PUBKEY || type == TX_MULTISIG))
+                        insert(COutPoint(hash, i));
+                }
+                break;
+            }
+        }
+    }
+
+    if (fFound)
+        return true;
+
+    for (const CTxIn& txin : tx.vin)
+    {
+        // Match if the filter contains an outpoint tx spends
+        if (contains(txin.prevout))
+            return true;
+
+        // Match if the filter contains any arbitrary script data element in any scriptSig in tx
+        CScript::const_iterator pc = txin.scriptSig.begin();
+        std::vector<unsigned char> data;
+        while (pc < txin.scriptSig.end())
+        {
+            opcodetype opcode;
+            if (!txin.scriptSig.GetOp(pc, opcode, data))
+                break;
+            if (data.size() != 0 && contains(data))
+                return true;
+        }
+    }
+
+    return false;
+}
+
+CRollingBloomFilter::CRollingBloomFilter(const unsigned int nElements, const double fpRate)
+{
+    double logFpRate = log(fpRate);
+    /* The optimal number of hash functions is log(fpRate) / log(0.5), but
+     * restrict it to the range 1-50. */
+    nHashFuncs = std::max(1, std::min((int)round(logFpRate / log(0.5)), 50));
+    /* In this rolling bloom filter, we'll store between 2 and 3 generations of nElements / 2 entries. */
+    nEntriesPerGeneration = (nElements + 1) / 2;
+    uint32_t nMaxElements = nEntriesPerGeneration * 3;
+    /* The maximum fpRate = pow(1.0 - exp(-nHashFuncs * nMaxElements / nFilterBits), nHashFuncs)
+     * =>          pow(fpRate, 1.0 / nHashFuncs) = 1.0 - exp(-nHashFuncs * nMaxElements / nFilterBits)
+     * =>          1.0 - pow(fpRate, 1.0 / nHashFuncs) = exp(-nHashFuncs * nMaxElements / nFilterBits)
+     * =>          log(1.0 - pow(fpRate, 1.0 / nHashFuncs)) = -nHashFuncs * nMaxElements / nFilterBits
+     * =>          nFilterBits = -nHashFuncs * nMaxElements / log(1.0 - pow(fpRate, 1.0 / nHashFuncs))
+     * =>          nFilterBits = -nHashFuncs * nMaxElements / log(1.0 - exp(logFpRate / nHashFuncs))
+     */
+    uint32_t nFilterBits = (uint32_t)ceil(-1.0 * nHashFuncs * nMaxElements / log(1.0 - exp(logFpRate / nHashFuncs)));
+    data.clear();
+    /* For each data element we need to store 2 bits. If both bits are 0, the
+     * bit is treated as unset. If the bits are (01), (10), or (11), the bit is
+     * treated as set in generation 1, 2, or 3 respectively.
+     * These bits are stored in separate integers: position P corresponds to bit
+     * (P & 63) of the integers data[(P >> 6) * 2] and data[(P >> 6) * 2 + 1]. */
+    data.resize(((nFilterBits + 63) / 64) << 1);
+    reset();
+}
+
+/* Similar to CBloomFilter::Hash */
+static inline uint32_t RollingBloomHash(unsigned int nHashNum, uint32_t nTweak, const std::vector<unsigned char>& vDataToHash) {
+    return MurmurHash3(nHashNum * 0xFBA4C795 + nTweak, vDataToHash);
+}
+
+
+// A replacement for x % n. This assumes that x and n are 32bit integers, and x is a uniformly random distributed 32bit value
+// which should be the case for a good hash.
+// See https://lemire.me/blog/2016/06/27/a-fast-alternative-to-the-modulo-reduction/
+static inline uint32_t FastMod(uint32_t x, size_t n) {
+    return ((uint64_t)x * (uint64_t)n) >> 32;
+}
+
+void CRollingBloomFilter::insert(const std::vector<unsigned char>& vKey)
+{
+    if (nEntriesThisGeneration == nEntriesPerGeneration) {
+        nEntriesThisGeneration = 0;
+        nGeneration++;
+        if (nGeneration == 4) {
+            nGeneration = 1;
+        }
+        uint64_t nGenerationMask1 = 0 - (uint64_t)(nGeneration & 1);
+        uint64_t nGenerationMask2 = 0 - (uint64_t)(nGeneration >> 1);
+        /* Wipe old entries that used this generation number. */
+        for (uint32_t p = 0; p < data.size(); p += 2) {
+            uint64_t p1 = data[p], p2 = data[p + 1];
+            uint64_t mask = (p1 ^ nGenerationMask1) | (p2 ^ nGenerationMask2);
+            data[p] = p1 & mask;
+            data[p + 1] = p2 & mask;
+        }
+    }
+    nEntriesThisGeneration++;
+
+    for (int n = 0; n < nHashFuncs; n++) {
+        uint32_t h = RollingBloomHash(n, nTweak, vKey);
+        int bit = h & 0x3F;
+        /* FastMod works with the upper bits of h, so it is safe to ignore that the lower bits of h are already used for bit. */
+        uint32_t pos = FastMod(h, data.size());
+        /* The lowest bit of pos is ignored, and set to zero for the first bit, and to one for the second. */
+        data[pos & ~1] = (data[pos & ~1] & ~(((uint64_t)1) << bit)) | ((uint64_t)(nGeneration & 1)) << bit;
+        data[pos | 1] = (data[pos | 1] & ~(((uint64_t)1) << bit)) | ((uint64_t)(nGeneration >> 1)) << bit;
+    }
+}
+
+void CRollingBloomFilter::insert(const uint256& hash)
+{
+    std::vector<unsigned char> vData(hash.begin(), hash.end());
+    insert(vData);
+}
+
+bool CRollingBloomFilter::contains(const std::vector<unsigned char>& vKey) const
+{
+    for (int n = 0; n < nHashFuncs; n++) {
+        uint32_t h = RollingBloomHash(n, nTweak, vKey);
+        int bit = h & 0x3F;
+        uint32_t pos = FastMod(h, data.size());
+        /* If the relevant bit is not set in either data[pos & ~1] or data[pos | 1], the filter does not contain vKey */
+        if (!(((data[pos & ~1] | data[pos | 1]) >> bit) & 1)) {
+            return false;
+        }
+    }
+    return true;
+}
+
+bool CRollingBloomFilter::contains(const uint256& hash) const
+{
+    std::vector<unsigned char> vData(hash.begin(), hash.end());
+    return contains(vData);
+}
+
+void CRollingBloomFilter::reset()
+{
+    nTweak = GetRand(std::numeric_limits<unsigned int>::max());
+    nEntriesThisGeneration = 0;
+    nGeneration = 1;
+    std::fill(data.begin(), data.end(), 0);
+}
diff --git a/depend/zcash/src/bloom.h b/depend/zcash/src/bloom.h
new file mode 100644
index 000000000..e4c01fe49
--- /dev/null
+++ b/depend/zcash/src/bloom.h
@@ -0,0 +1,142 @@
+// Copyright (c) 2012-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_BLOOM_H
+#define BITCOIN_BLOOM_H
+
+#include "serialize.h"
+
+#include <vector>
+
+class COutPoint;
+class CTransaction;
+class uint256;
+
+//! 20,000 items with fp rate < 0.1% or 10,000 items and <0.0001%
+static const unsigned int MAX_BLOOM_FILTER_SIZE = 36000; // bytes
+static const unsigned int MAX_HASH_FUNCS = 50;
+
+/**
+ * First two bits of nFlags control how much IsRelevantAndUpdate actually updates
+ * The remaining bits are reserved
+ */
+enum bloomflags
+{
+    BLOOM_UPDATE_NONE = 0,
+    BLOOM_UPDATE_ALL = 1,
+    // Only adds outpoints to the filter if the output is a pay-to-pubkey/pay-to-multisig script
+    BLOOM_UPDATE_P2PUBKEY_ONLY = 2,
+    BLOOM_UPDATE_MASK = 3,
+};
+
+/**
+ * BloomFilter is a probabilistic filter which SPV clients provide
+ * so that we can filter the transactions we send them.
+ * 
+ * This allows for significantly more efficient transaction and block downloads.
+ * 
+ * Because bloom filters are probabilistic, a SPV node can increase the false-
+ * positive rate, making us send it transactions which aren't actually its,
+ * allowing clients to trade more bandwidth for more privacy by obfuscating which
+ * keys are controlled by them.
+ */
+class CBloomFilter
+{
+private:
+    std::vector<unsigned char> vData;
+    unsigned int nHashFuncs;
+    unsigned int nTweak;
+    unsigned char nFlags;
+
+    unsigned int Hash(unsigned int nHashNum, const std::vector<unsigned char>& vDataToHash) const;
+
+public:
+    /**
+     * Creates a new bloom filter which will provide the given fp rate when filled with the given number of elements
+     * Note that if the given parameters will result in a filter outside the bounds of the protocol limits,
+     * the filter created will be as close to the given parameters as possible within the protocol limits.
+     * This will apply if nFPRate is very low or nElements is unreasonably high.
+     * nTweak is a constant which is added to the seed value passed to the hash function
+     * It should generally always be a random value (and is largely only exposed for unit testing)
+     * nFlags should be one of the BLOOM_UPDATE_* enums (not _MASK)
+     */
+    CBloomFilter(const unsigned int nElements, const double nFPRate, const unsigned int nTweak, unsigned char nFlagsIn);
+    CBloomFilter() : nHashFuncs(0), nTweak(0), nFlags(0) {}
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(vData);
+        READWRITE(nHashFuncs);
+        READWRITE(nTweak);
+        READWRITE(nFlags);
+    }
+
+    void insert(const std::vector<unsigned char>& vKey);
+    void insert(const COutPoint& outpoint);
+    void insert(const uint256& hash);
+
+    bool contains(const std::vector<unsigned char>& vKey) const;
+    bool contains(const COutPoint& outpoint) const;
+    bool contains(const uint256& hash) const;
+
+    //! True if the size is <= MAX_BLOOM_FILTER_SIZE and the number of hash functions is <= MAX_HASH_FUNCS
+    //! (catch a filter which was just deserialized which was too big)
+    bool IsWithinSizeConstraints() const;
+
+    //! Also adds any outputs which match the filter to the filter (to match their spending txes)
+    bool IsRelevantAndUpdate(const CTransaction& tx);
+};
+
+/**
+ * RollingBloomFilter is a probabilistic "keep track of most recently inserted" set.
+ * Construct it with the number of items to keep track of, and a false-positive
+ * rate. Unlike CBloomFilter, by default nTweak is set to a cryptographically
+ * secure random value for you. Similarly rather than clear() the method
+ * reset() is provided, which also changes nTweak to decrease the impact of
+ * false-positives.
+ *
+ * contains(item) will always return true if item was one of the last N to 1.5*N
+ * insert()'ed ... but may also return true for items that were not inserted.
+ *
+ * It needs around 1.8 bytes per element per factor 0.1 of false positive rate.
+ * For example, if we want 1000 elements, we'd need:
+ * - ~1800 bytes for a false positive rate of 0.1
+ * - ~3600 bytes for a false positive rate of 0.01
+ * - ~5400 bytes for a false positive rate of 0.001
+ *
+ * If we make these simplifying assumptions:
+ * - logFpRate / log(0.5) doesn't get rounded or clamped in the nHashFuncs calculation
+ * - nElements is even, so that nEntriesPerGeneration == nElements / 2
+ *
+ * Then we get a more accurate estimate for filter bytes:
+ *
+ *     3/(log(256)*log(2)) * log(1/fpRate) * nElements
+ */
+class CRollingBloomFilter
+{
+public:
+    // A random bloom filter calls GetRand() at creation time.
+    // Don't create global CRollingBloomFilter objects, as they may be
+    // constructed before the randomizer is properly initialized.
+    CRollingBloomFilter(const unsigned int nElements, const double nFPRate);
+
+    void insert(const std::vector<unsigned char>& vKey);
+    void insert(const uint256& hash);
+    bool contains(const std::vector<unsigned char>& vKey) const;
+    bool contains(const uint256& hash) const;
+
+    void reset();
+
+private:
+    int nEntriesPerGeneration;
+    int nEntriesThisGeneration;
+    int nGeneration;
+    std::vector<uint64_t> data;
+    unsigned int nTweak;
+    int nHashFuncs;
+};
+
+#endif // BITCOIN_BLOOM_H
diff --git a/depend/zcash/src/chain.cpp b/depend/zcash/src/chain.cpp
new file mode 100644
index 000000000..7d45026bb
--- /dev/null
+++ b/depend/zcash/src/chain.cpp
@@ -0,0 +1,109 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "chain.h"
+
+/**
+ * CChain implementation
+ */
+void CChain::SetTip(CBlockIndex *pindex) {
+    if (pindex == NULL) {
+        vChain.clear();
+        return;
+    }
+    vChain.resize(pindex->nHeight + 1);
+    while (pindex && vChain[pindex->nHeight] != pindex) {
+        vChain[pindex->nHeight] = pindex;
+        pindex = pindex->pprev;
+    }
+}
+
+CBlockLocator CChain::GetLocator(const CBlockIndex *pindex) const {
+    int nStep = 1;
+    std::vector<uint256> vHave;
+    vHave.reserve(32);
+
+    if (!pindex)
+        pindex = Tip();
+    while (pindex) {
+        vHave.push_back(pindex->GetBlockHash());
+        // Stop when we have added the genesis block.
+        if (pindex->nHeight == 0)
+            break;
+        // Exponentially larger steps back, plus the genesis block.
+        int nHeight = std::max(pindex->nHeight - nStep, 0);
+        if (Contains(pindex)) {
+            // Use O(1) CChain index if possible.
+            pindex = (*this)[nHeight];
+        } else {
+            // Otherwise, use O(log n) skiplist.
+            pindex = pindex->GetAncestor(nHeight);
+        }
+        if (vHave.size() > 10)
+            nStep *= 2;
+    }
+
+    return CBlockLocator(vHave);
+}
+
+const CBlockIndex *CChain::FindFork(const CBlockIndex *pindex) const {
+    assert(pindex != nullptr);
+    if (pindex->nHeight > Height())
+        pindex = pindex->GetAncestor(Height());
+    while (pindex && !Contains(pindex))
+        pindex = pindex->pprev;
+    return pindex;
+}
+
+/** Turn the lowest '1' bit in the binary representation of a number into a '0'. */
+int static inline InvertLowestOne(int n) { return n & (n - 1); }
+
+/** Compute what height to jump back to with the CBlockIndex::pskip pointer. */
+int static inline GetSkipHeight(int height) {
+    if (height < 2)
+        return 0;
+
+    // Determine which height to jump back to. Any number strictly lower than height is acceptable,
+    // but the following expression seems to perform well in simulations (max 110 steps to go back
+    // up to 2**18 blocks).
+    return (height & 1) ? InvertLowestOne(InvertLowestOne(height - 1)) + 1 : InvertLowestOne(height);
+}
+
+CBlockIndex* CBlockIndex::GetAncestor(int height)
+{
+    if (height > nHeight || height < 0)
+        return NULL;
+
+    CBlockIndex* pindexWalk = this;
+    int heightWalk = nHeight;
+    while (heightWalk > height) {
+        int heightSkip = GetSkipHeight(heightWalk);
+        int heightSkipPrev = GetSkipHeight(heightWalk - 1);
+        if (pindexWalk->pskip != NULL &&
+            (heightSkip == height ||
+             (heightSkip > height && !(heightSkipPrev < heightSkip - 2 &&
+                                       heightSkipPrev >= height)))) {
+            // Only follow pskip if pprev->pskip isn't better than pskip->pprev.
+            pindexWalk = pindexWalk->pskip;
+            heightWalk = heightSkip;
+        } else {
+            assert(pindexWalk->pprev);
+            pindexWalk = pindexWalk->pprev;
+            heightWalk--;
+        }
+    }
+    return pindexWalk;
+}
+
+const CBlockIndex* CBlockIndex::GetAncestor(int height) const
+{
+    return const_cast<CBlockIndex*>(this)->GetAncestor(height);
+}
+
+void CBlockIndex::BuildSkip()
+{
+    if (pprev)
+        pskip = pprev->GetAncestor(GetSkipHeight(nHeight));
+}
diff --git a/depend/zcash/src/chain.h b/depend/zcash/src/chain.h
new file mode 100644
index 000000000..1a5933c67
--- /dev/null
+++ b/depend/zcash/src/chain.h
@@ -0,0 +1,649 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_CHAIN_H
+#define BITCOIN_CHAIN_H
+
+#include "arith_uint256.h"
+#include "primitives/block.h"
+#include "pow.h"
+#include "tinyformat.h"
+#include "uint256.h"
+
+#include <optional>
+#include <vector>
+
+static const int SPROUT_VALUE_VERSION = 1001400;
+static const int SAPLING_VALUE_VERSION = 1010100;
+static const int CHAIN_HISTORY_ROOT_VERSION = 2010200;
+static const int NU5_DATA_VERSION = 4050000;
+
+/**
+ * Maximum amount of time that a block timestamp is allowed to be ahead of the
+ * median-time-past of the previous block.
+ */
+static const int64_t MAX_FUTURE_BLOCK_TIME_MTP = 90 * 60;
+
+/**
+ * Maximum amount of time that a block timestamp is allowed to be ahead of the
+ * current local time.
+ */
+static const int64_t MAX_FUTURE_BLOCK_TIME_LOCAL = 2 * 60 * 60;
+
+/**
+ * Timestamp window used as a grace period by code that compares external
+ * timestamps (such as timestamps passed to RPCs, or wallet key creation times)
+ * to block timestamps.
+ */
+static const int64_t TIMESTAMP_WINDOW = MAX_FUTURE_BLOCK_TIME_LOCAL + 60;
+
+static_assert(MAX_FUTURE_BLOCK_TIME_LOCAL > MAX_FUTURE_BLOCK_TIME_MTP,
+              "MAX_FUTURE_BLOCK_TIME_LOCAL must be greater than MAX_FUTURE_BLOCK_TIME_MTP");
+static_assert(TIMESTAMP_WINDOW > MAX_FUTURE_BLOCK_TIME_LOCAL,
+              "TIMESTAMP_WINDOW must be greater than MAX_FUTURE_BLOCK_TIME_LOCAL");
+
+
+class CBlockFileInfo
+{
+public:
+    unsigned int nBlocks;      //!< number of blocks stored in file
+    unsigned int nSize;        //!< number of used bytes of block file
+    unsigned int nUndoSize;    //!< number of used bytes in the undo file
+    unsigned int nHeightFirst; //!< lowest height of block in file
+    unsigned int nHeightLast;  //!< highest height of block in file
+    uint64_t nTimeFirst;       //!< earliest time of block in file
+    uint64_t nTimeLast;        //!< latest time of block in file
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(VARINT(nBlocks));
+        READWRITE(VARINT(nSize));
+        READWRITE(VARINT(nUndoSize));
+        READWRITE(VARINT(nHeightFirst));
+        READWRITE(VARINT(nHeightLast));
+        READWRITE(VARINT(nTimeFirst));
+        READWRITE(VARINT(nTimeLast));
+    }
+
+     void SetNull() {
+         nBlocks = 0;
+         nSize = 0;
+         nUndoSize = 0;
+         nHeightFirst = 0;
+         nHeightLast = 0;
+         nTimeFirst = 0;
+         nTimeLast = 0;
+     }
+
+     CBlockFileInfo() {
+         SetNull();
+     }
+
+     std::string ToString() const;
+
+     /** update statistics (does not update nSize) */
+     void AddBlock(unsigned int nHeightIn, uint64_t nTimeIn) {
+         if (nBlocks==0 || nHeightFirst > nHeightIn)
+             nHeightFirst = nHeightIn;
+         if (nBlocks==0 || nTimeFirst > nTimeIn)
+             nTimeFirst = nTimeIn;
+         nBlocks++;
+         if (nHeightIn > nHeightLast)
+             nHeightLast = nHeightIn;
+         if (nTimeIn > nTimeLast)
+             nTimeLast = nTimeIn;
+     }
+};
+
+struct CDiskBlockPos
+{
+    int nFile;
+    unsigned int nPos;
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(VARINT(nFile));
+        READWRITE(VARINT(nPos));
+    }
+
+    CDiskBlockPos() {
+        SetNull();
+    }
+
+    CDiskBlockPos(int nFileIn, unsigned int nPosIn) {
+        nFile = nFileIn;
+        nPos = nPosIn;
+    }
+
+    friend bool operator==(const CDiskBlockPos &a, const CDiskBlockPos &b) {
+        return (a.nFile == b.nFile && a.nPos == b.nPos);
+    }
+
+    friend bool operator!=(const CDiskBlockPos &a, const CDiskBlockPos &b) {
+        return !(a == b);
+    }
+
+    void SetNull() { nFile = -1; nPos = 0; }
+    bool IsNull() const { return (nFile == -1); }
+
+    std::string ToString() const
+    {
+        return strprintf("CBlockDiskPos(nFile=%i, nPos=%i)", nFile, nPos);
+    }
+
+};
+
+enum BlockStatus: uint32_t {
+    //! Unused.
+    BLOCK_VALID_UNKNOWN      =    0,
+
+    //! Parsed, version ok, hash satisfies claimed PoW, 1 <= vtx count <= max, timestamp not in future
+    BLOCK_VALID_HEADER       =    1,
+
+    //! All parent headers found, difficulty matches, timestamp >= median previous, checkpoint. Implies all parents
+    //! are also at least TREE.
+    BLOCK_VALID_TREE         =    2,
+
+    /**
+     * Only first tx is coinbase, 2 <= coinbase input script length <= 100, transactions valid, no duplicate txids,
+     * sigops, size, merkle root. Implies all parents are at least TREE but not necessarily TRANSACTIONS. When all
+     * parent blocks also have TRANSACTIONS, CBlockIndex::nChainTx will be set.
+     */
+    BLOCK_VALID_TRANSACTIONS =    3,
+
+    //! Outputs do not overspend inputs, no double spends, coinbase output ok, no immature coinbase spends, BIP30.
+    //! Implies all parents are also at least CHAIN.
+    BLOCK_VALID_CHAIN        =    4,
+
+    //! Scripts & signatures ok. Implies all parents are also at least SCRIPTS.
+    BLOCK_VALID_SCRIPTS      =    5,
+
+    //! All validity bits.
+    BLOCK_VALID_MASK         =   BLOCK_VALID_HEADER | BLOCK_VALID_TREE | BLOCK_VALID_TRANSACTIONS |
+                                 BLOCK_VALID_CHAIN | BLOCK_VALID_SCRIPTS,
+
+    BLOCK_HAVE_DATA          =    8, //! full block available in blk*.dat
+    BLOCK_HAVE_UNDO          =   16, //! undo data available in rev*.dat
+    BLOCK_HAVE_MASK          =   BLOCK_HAVE_DATA | BLOCK_HAVE_UNDO,
+
+    BLOCK_FAILED_VALID       =   32, //! stage after last reached validness failed
+    BLOCK_FAILED_CHILD       =   64, //! descends from failed block
+    BLOCK_FAILED_MASK        =   BLOCK_FAILED_VALID | BLOCK_FAILED_CHILD,
+
+    BLOCK_ACTIVATES_UPGRADE  =   128, //! block activates a network upgrade
+};
+
+//! Short-hand for the highest consensus validity we implement.
+//! Blocks with this validity are assumed to satisfy all consensus rules.
+static const BlockStatus BLOCK_VALID_CONSENSUS = BLOCK_VALID_SCRIPTS;
+
+/** The block chain is a tree shaped structure starting with the
+ * genesis block at the root, with each block potentially having multiple
+ * candidates to be the next block. A blockindex may have multiple pprev pointing
+ * to it, but at most one of them can be part of the currently active branch.
+ */
+class CBlockIndex
+{
+public:
+    //! pointer to the hash of the block, if any. Memory is owned by this CBlockIndex
+    const uint256* phashBlock;
+
+    //! pointer to the index of the predecessor of this block
+    CBlockIndex* pprev;
+
+    //! pointer to the index of some further predecessor of this block
+    CBlockIndex* pskip;
+
+    //! height of the entry in the chain. The genesis block has height 0
+    int nHeight;
+
+    //! Which # file this block is stored in (blk?????.dat)
+    int nFile;
+
+    //! Byte offset within blk?????.dat where this block's data is stored
+    unsigned int nDataPos;
+
+    //! Byte offset within rev?????.dat where this block's undo data is stored
+    unsigned int nUndoPos;
+
+    //! (memory only) Total amount of work (expected number of hashes) in the chain up to and including this block
+    arith_uint256 nChainWork;
+
+    //! Number of transactions in this block.
+    //! Note: in a potential headers-first mode, this number cannot be relied upon
+    unsigned int nTx;
+
+    //! (memory only) Number of transactions in the chain up to and including this block.
+    //! This value will be non-zero only if and only if transactions for this block and all its parents are available.
+    //! Change to 64-bit type when necessary; won't happen before 2030
+    unsigned int nChainTx;
+
+    //! Verification status of this block. See enum BlockStatus
+    unsigned int nStatus;
+
+    //! Branch ID corresponding to the consensus rules used to validate this block.
+    //! Only cached if block validity is BLOCK_VALID_CONSENSUS.
+    //! Persisted at each activation height, memory-only for intervening blocks.
+    std::optional<uint32_t> nCachedBranchId;
+
+    //! Root of the ZIP 244 authorizing data commitment tree for this block.
+    //!
+    //! - For blocks prior to (not including) the NU5 activation block, this is always
+    //!   null.
+    //! - For blocks including and after the NU5 activation block, this is only set once
+    //!   a block has been connected to the main chain, and will be null otherwise.
+    uint256 hashAuthDataRoot;
+
+    //! The anchor for the tree state up to the start of this block
+    uint256 hashSproutAnchor;
+
+    //! (memory only) The anchor for the tree state up to the end of this block
+    uint256 hashFinalSproutRoot;
+
+    //! Change in value held by the Sprout circuit over this block.
+    //! Will be std::nullopt for older blocks on old nodes until a reindex has taken place.
+    std::optional<CAmount> nSproutValue;
+
+    //! (memory only) Total value held by the Sprout circuit up to and including this block.
+    //! Will be std::nullopt for on old nodes until a reindex has taken place.
+    //! Will be std::nullopt if nChainTx is zero.
+    std::optional<CAmount> nChainSproutValue;
+
+    //! Change in value held by the Sapling circuit over this block.
+    //! Not a std::optional because this was added before Sapling activated, so we can
+    //! rely on the invariant that every block before this was added had nSaplingValue = 0.
+    CAmount nSaplingValue;
+
+    //! (memory only) Total value held by the Sapling circuit up to and including this block.
+    //! Will be std::nullopt if nChainTx is zero.
+    std::optional<CAmount> nChainSaplingValue;
+
+    //! Change in value held by the Orchard circuit over this block.
+    //! Not a std::optional because this was added before Orchard activated, so we can
+    //! rely on the invariant that every block before this was added had nOrchardValue = 0.
+    CAmount nOrchardValue;
+
+    //! (memory only) Total value held by the Orchard circuit up to and including this block.
+    //! Will be std::nullopt if and only if nChainTx is zero.
+    std::optional<CAmount> nChainOrchardValue;
+
+    //! Root of the Sapling commitment tree as of the end of this block.
+    //!
+    //! - For blocks prior to (not including) the Heartwood activation block, this is
+    //!   always equal to hashBlockCommitments.
+    //! - For blocks including and after the Heartwood activation block, this is only set
+    //!   once a block has been connected to the main chain, and will be null otherwise.
+    uint256 hashFinalSaplingRoot;
+
+    //! Root of the Orchard commitment tree as of the end of this block.
+    //!
+    //! - For blocks prior to (not including) the NU5 activation block, this is always
+    //!   null.
+    //! - For blocks including and after the NU5 activation block, this is only set
+    //!   once a block has been connected to the main chain, and will be null otherwise.
+    uint256 hashFinalOrchardRoot;
+
+    //! Root of the ZIP 221 history tree as of the end of the previous block.
+    //!
+    //! - For blocks prior to and including the Heartwood activation block, this is
+    //!   always null.
+    //! - For blocks after (not including) the Heartwood activation block, and prior to
+    //!   (not including) the NU5 activation block, this is always equal to
+    //!   hashBlockCommitments.
+    //! - For blocks including and after the NU5 activation block, this is only set
+    //!   once a block has been connected to the main chain, and will be null otherwise.
+    uint256 hashChainHistoryRoot;
+
+    //! block header
+    int nVersion;
+    uint256 hashMerkleRoot;
+    uint256 hashBlockCommitments;
+    unsigned int nTime;
+    unsigned int nBits;
+    uint256 nNonce;
+    std::vector<unsigned char> nSolution;
+
+    //! (memory only) Sequential id assigned to distinguish order in which blocks are received.
+    uint32_t nSequenceId;
+
+    void SetNull()
+    {
+        phashBlock = NULL;
+        pprev = NULL;
+        pskip = NULL;
+        nHeight = 0;
+        nFile = 0;
+        nDataPos = 0;
+        nUndoPos = 0;
+        nChainWork = arith_uint256();
+        nTx = 0;
+        nChainTx = 0;
+        nStatus = 0;
+        nCachedBranchId = std::nullopt;
+        hashAuthDataRoot = uint256();
+        hashSproutAnchor = uint256();
+        hashFinalSproutRoot = uint256();
+        hashFinalSaplingRoot = uint256();
+        hashFinalOrchardRoot = uint256();
+        hashChainHistoryRoot = uint256();
+        nSequenceId = 0;
+        nSproutValue = std::nullopt;
+        nChainSproutValue = std::nullopt;
+        nSaplingValue = 0;
+        nChainSaplingValue = std::nullopt;
+        nOrchardValue = 0;
+        nChainOrchardValue = std::nullopt;
+
+        nVersion       = 0;
+        hashMerkleRoot = uint256();
+        hashBlockCommitments = uint256();
+        nTime          = 0;
+        nBits          = 0;
+        nNonce         = uint256();
+        nSolution.clear();
+    }
+
+    CBlockIndex()
+    {
+        SetNull();
+    }
+
+    CBlockIndex(const CBlockHeader& block)
+    {
+        SetNull();
+
+        nVersion       = block.nVersion;
+        hashMerkleRoot = block.hashMerkleRoot;
+        hashBlockCommitments = block.hashBlockCommitments;
+        nTime          = block.nTime;
+        nBits          = block.nBits;
+        nNonce         = block.nNonce;
+        nSolution      = block.nSolution;
+    }
+
+    CDiskBlockPos GetBlockPos() const {
+        CDiskBlockPos ret;
+        if (nStatus & BLOCK_HAVE_DATA) {
+            ret.nFile = nFile;
+            ret.nPos  = nDataPos;
+        }
+        return ret;
+    }
+
+    CDiskBlockPos GetUndoPos() const {
+        CDiskBlockPos ret;
+        if (nStatus & BLOCK_HAVE_UNDO) {
+            ret.nFile = nFile;
+            ret.nPos  = nUndoPos;
+        }
+        return ret;
+    }
+
+    CBlockHeader GetBlockHeader() const
+    {
+        CBlockHeader block;
+        block.nVersion       = nVersion;
+        if (pprev)
+            block.hashPrevBlock = pprev->GetBlockHash();
+        block.hashMerkleRoot = hashMerkleRoot;
+        block.hashBlockCommitments = hashBlockCommitments;
+        block.nTime          = nTime;
+        block.nBits          = nBits;
+        block.nNonce         = nNonce;
+        block.nSolution      = nSolution;
+        return block;
+    }
+
+    uint256 GetBlockHash() const
+    {
+        return *phashBlock;
+    }
+
+    int64_t GetBlockTime() const
+    {
+        return (int64_t)nTime;
+    }
+
+    enum { nMedianTimeSpan=11 };
+
+    int64_t GetMedianTimePast() const
+    {
+        int64_t pmedian[nMedianTimeSpan];
+        int64_t* pbegin = &pmedian[nMedianTimeSpan];
+        int64_t* pend = &pmedian[nMedianTimeSpan];
+
+        const CBlockIndex* pindex = this;
+        for (int i = 0; i < nMedianTimeSpan && pindex; i++, pindex = pindex->pprev)
+            *(--pbegin) = pindex->GetBlockTime();
+
+        std::sort(pbegin, pend);
+        return pbegin[(pend - pbegin)/2];
+    }
+
+    std::string ToString() const
+    {
+        return strprintf("CBlockIndex(pprev=%p, nHeight=%d, merkle=%s, hashBlock=%s)",
+            pprev, nHeight,
+            hashMerkleRoot.ToString(),
+            GetBlockHash().ToString());
+    }
+
+    //! Check whether this block index entry is valid up to the passed validity level.
+    bool IsValid(enum BlockStatus nUpTo = BLOCK_VALID_TRANSACTIONS) const
+    {
+        assert(!(nUpTo & ~BLOCK_VALID_MASK)); // Only validity flags allowed.
+        if (nStatus & BLOCK_FAILED_MASK)
+            return false;
+        return ((nStatus & BLOCK_VALID_MASK) >= nUpTo);
+    }
+
+    //! Raise the validity level of this block index entry.
+    //! Returns true if the validity was changed.
+    bool RaiseValidity(enum BlockStatus nUpTo)
+    {
+        assert(!(nUpTo & ~BLOCK_VALID_MASK)); // Only validity flags allowed.
+        if (nStatus & BLOCK_FAILED_MASK)
+            return false;
+        if ((nStatus & BLOCK_VALID_MASK) < nUpTo) {
+            nStatus = (nStatus & ~BLOCK_VALID_MASK) | nUpTo;
+            return true;
+        }
+        return false;
+    }
+
+    //! Build the skiplist pointer for this entry.
+    void BuildSkip();
+
+    //! Efficiently find an ancestor of this block.
+    CBlockIndex* GetAncestor(int height);
+    const CBlockIndex* GetAncestor(int height) const;
+};
+
+/** Used to marshal pointers into hashes for db storage. */
+class CDiskBlockIndex : public CBlockIndex
+{
+public:
+    uint256 hashPrev;
+
+    // This is the serialized `nVersion` of the block index, which is only set
+    // after the (de)serialization routine is called. This should only be used
+    // in LoadBlockIndexGuts (which is the only place where we read block index
+    // objects from disk anyway).
+    int nClientVersion = 0;
+
+    CDiskBlockIndex() {
+        hashPrev = uint256();
+    }
+
+    explicit CDiskBlockIndex(const CBlockIndex* pindex) : CBlockIndex(*pindex) {
+        hashPrev = (pprev ? pprev->GetBlockHash() : uint256());
+    }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        int nVersion = s.GetVersion();
+        if (!(s.GetType() & SER_GETHASH))
+            READWRITE(VARINT(nVersion));
+        nClientVersion = nVersion;
+
+        READWRITE(VARINT(nHeight));
+        READWRITE(VARINT(nStatus));
+        READWRITE(VARINT(nTx));
+        if (nStatus & (BLOCK_HAVE_DATA | BLOCK_HAVE_UNDO))
+            READWRITE(VARINT(nFile));
+        if (nStatus & BLOCK_HAVE_DATA)
+            READWRITE(VARINT(nDataPos));
+        if (nStatus & BLOCK_HAVE_UNDO)
+            READWRITE(VARINT(nUndoPos));
+        if (nStatus & BLOCK_ACTIVATES_UPGRADE) {
+            if (ser_action.ForRead()) {
+                uint32_t branchId;
+                READWRITE(branchId);
+                nCachedBranchId = branchId;
+            } else {
+                // nCachedBranchId must always be set if BLOCK_ACTIVATES_UPGRADE is set.
+                assert(nCachedBranchId);
+                uint32_t branchId = *nCachedBranchId;
+                READWRITE(branchId);
+            }
+        }
+        READWRITE(hashSproutAnchor);
+
+        // block header
+        READWRITE(this->nVersion);
+        READWRITE(hashPrev);
+        READWRITE(hashMerkleRoot);
+        READWRITE(hashBlockCommitments);
+        READWRITE(nTime);
+        READWRITE(nBits);
+        READWRITE(nNonce);
+        READWRITE(nSolution);
+
+        // Only read/write nSproutValue if the client version used to create
+        // this index was storing them.
+        if ((s.GetType() & SER_DISK) && (nVersion >= SPROUT_VALUE_VERSION)) {
+            READWRITE(nSproutValue);
+        }
+
+        // Only read/write nSaplingValue if the client version used to create
+        // this index was storing them.
+        if ((s.GetType() & SER_DISK) && (nVersion >= SAPLING_VALUE_VERSION)) {
+            READWRITE(nSaplingValue);
+        }
+
+        // Only read/write hashFinalSaplingRoot and hashChainHistoryRoot if the
+        // client version used to create this index was storing them.
+        if ((s.GetType() & SER_DISK) && (nVersion >= CHAIN_HISTORY_ROOT_VERSION)) {
+            READWRITE(hashFinalSaplingRoot);
+            READWRITE(hashChainHistoryRoot);
+        } else if (ser_action.ForRead()) {
+            // For block indices written before the client was Heartwood-aware,
+            // these are always identical.
+            hashFinalSaplingRoot = hashBlockCommitments;
+        }
+
+        // Only read/write NU5 data if the client version used to create this
+        // index was storing them. For block indices written before the client
+        // was NU5-aware, these are always null / zero.
+        if ((s.GetType() & SER_DISK) && (nVersion >= NU5_DATA_VERSION)) {
+            READWRITE(hashAuthDataRoot);
+            READWRITE(hashFinalOrchardRoot);
+            READWRITE(nOrchardValue);
+        }
+
+        // If you have just added new serialized fields above, remember to add
+        // them to CBlockTreeDB::LoadBlockIndexGuts() in txdb.cpp :)
+    }
+
+    uint256 GetBlockHash() const
+    {
+        CBlockHeader block;
+        block.nVersion        = nVersion;
+        block.hashPrevBlock   = hashPrev;
+        block.hashMerkleRoot  = hashMerkleRoot;
+        block.hashBlockCommitments = hashBlockCommitments;
+        block.nTime           = nTime;
+        block.nBits           = nBits;
+        block.nNonce          = nNonce;
+        block.nSolution       = nSolution;
+        return block.GetHash();
+    }
+
+
+    std::string ToString() const
+    {
+        std::string str = "CDiskBlockIndex(";
+        str += CBlockIndex::ToString();
+        str += strprintf("\n                hashBlock=%s, hashPrev=%s)",
+            GetBlockHash().ToString(),
+            hashPrev.ToString());
+        return str;
+    }
+};
+
+/** An in-memory indexed chain of blocks. */
+class CChain {
+private:
+    std::vector<CBlockIndex*> vChain;
+
+public:
+    /** Returns the index entry for the genesis block of this chain, or NULL if none. */
+    CBlockIndex *Genesis() const {
+        return vChain.size() > 0 ? vChain[0] : NULL;
+    }
+
+    /** Returns the index entry for the tip of this chain, or NULL if none. */
+    CBlockIndex *Tip() const {
+        return vChain.size() > 0 ? vChain[vChain.size() - 1] : NULL;
+    }
+
+    /** Returns the index entry at a particular height in this chain, or NULL if no such height exists. */
+    CBlockIndex *operator[](int nHeight) const {
+        if (nHeight < 0 || nHeight >= (int)vChain.size())
+            return NULL;
+        return vChain[nHeight];
+    }
+
+    /** Compare two chains efficiently. */
+    friend bool operator==(const CChain &a, const CChain &b) {
+        return a.vChain.size() == b.vChain.size() &&
+               a.vChain[a.vChain.size() - 1] == b.vChain[b.vChain.size() - 1];
+    }
+
+    /** Efficiently check whether a block is present in this chain. */
+    bool Contains(const CBlockIndex *pindex) const {
+        return (*this)[pindex->nHeight] == pindex;
+    }
+
+    /** Find the successor of a block in this chain, or NULL if the given index is not found or is the tip. */
+    CBlockIndex *Next(const CBlockIndex *pindex) const {
+        if (Contains(pindex))
+            return (*this)[pindex->nHeight + 1];
+        else
+            return NULL;
+    }
+
+    /** Return the maximal height in the chain. Is equal to chain.Tip() ? chain.Tip()->nHeight : -1. */
+    int Height() const {
+        return int(vChain.size()) - 1;
+    }
+
+    /** Set/initialize a chain with a given tip. */
+    void SetTip(CBlockIndex *pindex);
+
+    /** Return a CBlockLocator that refers to a block in this chain (by default the tip). */
+    CBlockLocator GetLocator(const CBlockIndex *pindex = NULL) const;
+
+    /** Find the last common block between this chain and a block index entry. */
+    const CBlockIndex *FindFork(const CBlockIndex *pindex) const;
+};
+
+#endif // BITCOIN_CHAIN_H
diff --git a/depend/zcash/src/chainparams.cpp b/depend/zcash/src/chainparams.cpp
new file mode 100644
index 000000000..8bfb35718
--- /dev/null
+++ b/depend/zcash/src/chainparams.cpp
@@ -0,0 +1,860 @@
+// Copyright (c) 2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Copyright (c) 2015-2020 The Zcash Developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "key_io.h"
+#include "main.h"
+#include "crypto/equihash.h"
+
+#include "tinyformat.h"
+#include "util.h"
+#include "utilstrencodings.h"
+
+#include <assert.h>
+#include <optional>
+#include <variant>
+
+#include <boost/assign/list_of.hpp>
+
+#include "chainparamsseeds.h"
+
+static CBlock CreateGenesisBlock(const char* pszTimestamp, const CScript& genesisOutputScript, uint32_t nTime, const uint256& nNonce, const std::vector<unsigned char>& nSolution, uint32_t nBits, int32_t nVersion, const CAmount& genesisReward)
+{
+    // To create a genesis block for a new chain which is Overwintered:
+    //   txNew.nVersion = OVERWINTER_TX_VERSION
+    //   txNew.fOverwintered = true
+    //   txNew.nVersionGroupId = OVERWINTER_VERSION_GROUP_ID
+    //   txNew.nExpiryHeight = <default value>
+    CMutableTransaction txNew;
+    txNew.nVersion = 1;
+    txNew.vin.resize(1);
+    txNew.vout.resize(1);
+    txNew.vin[0].scriptSig = CScript() << 520617983 << CScriptNum(4) << std::vector<unsigned char>((const unsigned char*)pszTimestamp, (const unsigned char*)pszTimestamp + strlen(pszTimestamp));
+    txNew.vout[0].nValue = genesisReward;
+    txNew.vout[0].scriptPubKey = genesisOutputScript;
+
+    CBlock genesis;
+    genesis.nTime    = nTime;
+    genesis.nBits    = nBits;
+    genesis.nNonce   = nNonce;
+    genesis.nSolution = nSolution;
+    genesis.nVersion = nVersion;
+    genesis.vtx.push_back(txNew);
+    genesis.hashPrevBlock.SetNull();
+    genesis.hashMerkleRoot = genesis.BuildMerkleTree();
+    return genesis;
+}
+
+/**
+ * Build the genesis block. Note that the output of its generation
+ * transaction cannot be spent since it did not originally exist in the
+ * database (and is in any case of zero value).
+ *
+ * >>> from hashlib import blake2s
+ * >>> 'Zcash' + blake2s(b'The Economist 2016-10-29 Known unknown: Another crypto-currency is born. BTC#436254 0000000000000000044f321997f336d2908cf8c8d6893e88dbf067e2d949487d ETH#2521903 483039a6b6bd8bd05f0584f9a078d075e454925eb71c1f13eaff59b405a721bb DJIA close on 27 Oct 2016: 18,169.68').hexdigest()
+ *
+ * CBlock(hash=00040fe8, ver=4, hashPrevBlock=00000000000000, hashMerkleRoot=c4eaa5, nTime=1477641360, nBits=1f07ffff, nNonce=4695, vtx=1)
+ *   CTransaction(hash=c4eaa5, ver=1, vin.size=1, vout.size=1, nLockTime=0)
+ *     CTxIn(COutPoint(000000, -1), coinbase 04ffff071f0104455a6361736830623963346565663862376363343137656535303031653335303039383462366665613335363833613763616331343161303433633432303634383335643334)
+ *     CTxOut(nValue=0.00000000, scriptPubKey=0x5F1DF16B2B704C8A578D0B)
+ *   vMerkleTree: c4eaa5
+ */
+static CBlock CreateGenesisBlock(uint32_t nTime, const uint256& nNonce, const std::vector<unsigned char>& nSolution, uint32_t nBits, int32_t nVersion, const CAmount& genesisReward)
+{
+    const char* pszTimestamp = "Zcash0b9c4eef8b7cc417ee5001e3500984b6fea35683a7cac141a043c42064835d34";
+    const CScript genesisOutputScript = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
+    return CreateGenesisBlock(pszTimestamp, genesisOutputScript, nTime, nNonce, nSolution, nBits, nVersion, genesisReward);
+}
+
+/**
+ * Main network
+ */
+/**
+ * What makes a good checkpoint block?
+ * + Is surrounded by blocks with reasonable timestamps
+ *   (no blocks before with a timestamp after, none after with
+ *    timestamp before)
+ * + Contains no strange transactions
+ */
+
+const arith_uint256 maxUint = UintToArith256(uint256S("ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff"));
+
+class CMainParams : public CChainParams {
+public:
+    CMainParams() {
+        keyConstants.strNetworkID = "main";
+        strCurrencyUnits = "ZEC";
+        keyConstants.bip44CoinType = 133; // As registered in https://github.com/satoshilabs/slips/blob/master/slip-0044.md
+        consensus.fCoinbaseMustBeShielded = true;
+        consensus.nSubsidySlowStartInterval = 20000;
+        consensus.nPreBlossomSubsidyHalvingInterval = Consensus::PRE_BLOSSOM_HALVING_INTERVAL;
+        consensus.nPostBlossomSubsidyHalvingInterval = POST_BLOSSOM_HALVING_INTERVAL(Consensus::PRE_BLOSSOM_HALVING_INTERVAL);
+        consensus.nMajorityEnforceBlockUpgrade = 750;
+        consensus.nMajorityRejectBlockOutdated = 950;
+        consensus.nMajorityWindow = 4000;
+        const size_t N = 200, K = 9;
+        static_assert(equihash_parameters_acceptable(N, K));
+        consensus.nEquihashN = N;
+        consensus.nEquihashK = K;
+        consensus.powLimit = uint256S("0007ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff");
+        consensus.nPowAveragingWindow = 17;
+        assert(maxUint/UintToArith256(consensus.powLimit) >= consensus.nPowAveragingWindow);
+        consensus.nPowMaxAdjustDown = 32; // 32% adjustment down
+        consensus.nPowMaxAdjustUp = 16; // 16% adjustment up
+        consensus.nPreBlossomPowTargetSpacing = Consensus::PRE_BLOSSOM_POW_TARGET_SPACING;
+        consensus.nPostBlossomPowTargetSpacing = Consensus::POST_BLOSSOM_POW_TARGET_SPACING;
+        consensus.nPowAllowMinDifficultyBlocksAfterHeight = std::nullopt;
+        consensus.fPowNoRetargeting = false;
+        consensus.vUpgrades[Consensus::BASE_SPROUT].nProtocolVersion = 170002;
+        consensus.vUpgrades[Consensus::BASE_SPROUT].nActivationHeight =
+            Consensus::NetworkUpgrade::ALWAYS_ACTIVE;
+        consensus.vUpgrades[Consensus::UPGRADE_TESTDUMMY].nProtocolVersion = 170002;
+        consensus.vUpgrades[Consensus::UPGRADE_TESTDUMMY].nActivationHeight =
+            Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT;
+        consensus.vUpgrades[Consensus::UPGRADE_OVERWINTER].nProtocolVersion = 170005;
+        consensus.vUpgrades[Consensus::UPGRADE_OVERWINTER].nActivationHeight = 347500;
+        consensus.vUpgrades[Consensus::UPGRADE_OVERWINTER].hashActivationBlock =
+            uint256S("0000000003761c0d0c3974b54bdb425613bbb1eaadd6e70b764de82f195ea243");
+        consensus.vUpgrades[Consensus::UPGRADE_SAPLING].nProtocolVersion = 170007;
+        consensus.vUpgrades[Consensus::UPGRADE_SAPLING].nActivationHeight = 419200;
+        consensus.vUpgrades[Consensus::UPGRADE_SAPLING].hashActivationBlock =
+            uint256S("00000000025a57200d898ac7f21e26bf29028bbe96ec46e05b2c17cc9db9e4f3");
+        consensus.vUpgrades[Consensus::UPGRADE_BLOSSOM].nProtocolVersion = 170009;
+        consensus.vUpgrades[Consensus::UPGRADE_BLOSSOM].nActivationHeight = 653600;
+        consensus.vUpgrades[Consensus::UPGRADE_BLOSSOM].hashActivationBlock =
+            uint256S("00000000020bebb33c1b34b67a982a328ab212a206dacbe561a7cc94aab3e9bb");
+        consensus.vUpgrades[Consensus::UPGRADE_HEARTWOOD].nProtocolVersion = 170011;
+        consensus.vUpgrades[Consensus::UPGRADE_HEARTWOOD].nActivationHeight = 903000;
+        consensus.vUpgrades[Consensus::UPGRADE_HEARTWOOD].hashActivationBlock =
+            uint256S("0000000000aad1c8698964a93c35ecf8b4d05e848de9e2fe7606067139be5643");
+        consensus.vUpgrades[Consensus::UPGRADE_CANOPY].nProtocolVersion = 170013;
+        consensus.vUpgrades[Consensus::UPGRADE_CANOPY].nActivationHeight = 1046400;
+        consensus.vUpgrades[Consensus::UPGRADE_CANOPY].hashActivationBlock =
+            uint256S("00000000002038016f976744c369dce7419fca30e7171dfac703af5e5f7ad1d4");
+        consensus.vUpgrades[Consensus::UPGRADE_NU5].nProtocolVersion = 170100;
+        consensus.vUpgrades[Consensus::UPGRADE_NU5].nActivationHeight = 1687104;
+
+        consensus.vUpgrades[Consensus::UPGRADE_ZFUTURE].nProtocolVersion = 0x7FFFFFFF;
+        consensus.vUpgrades[Consensus::UPGRADE_ZFUTURE].nActivationHeight =
+            Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT;
+
+        consensus.nFundingPeriodLength = consensus.nPostBlossomSubsidyHalvingInterval / 48;
+
+        // guarantees the first 2 characters, when base58 encoded, are "t1"
+        keyConstants.base58Prefixes[PUBKEY_ADDRESS]     = {0x1C,0xB8};
+        // guarantees the first 2 characters, when base58 encoded, are "t3"
+        keyConstants.base58Prefixes[SCRIPT_ADDRESS]     = {0x1C,0xBD};
+        // the first character, when base58 encoded, is "5" or "K" or "L" (as in Bitcoin)
+        keyConstants.base58Prefixes[SECRET_KEY]         = {0x80};
+        // do not rely on these BIP32 prefixes; they are not specified and may change
+        keyConstants.base58Prefixes[EXT_PUBLIC_KEY]     = {0x04,0x88,0xB2,0x1E};
+        keyConstants.base58Prefixes[EXT_SECRET_KEY]     = {0x04,0x88,0xAD,0xE4};
+        // guarantees the first 2 characters, when base58 encoded, are "zc"
+        keyConstants.base58Prefixes[ZCPAYMENT_ADDRESS]  = {0x16,0x9A};
+        // guarantees the first 4 characters, when base58 encoded, are "ZiVK"
+        keyConstants.base58Prefixes[ZCVIEWING_KEY]      = {0xA8,0xAB,0xD3};
+        // guarantees the first 2 characters, when base58 encoded, are "SK"
+        keyConstants.base58Prefixes[ZCSPENDING_KEY]     = {0xAB,0x36};
+
+        keyConstants.bech32HRPs[SAPLING_PAYMENT_ADDRESS]      = "zs";
+        keyConstants.bech32HRPs[SAPLING_FULL_VIEWING_KEY]     = "zviews";
+        keyConstants.bech32HRPs[SAPLING_INCOMING_VIEWING_KEY] = "zivks";
+        keyConstants.bech32HRPs[SAPLING_EXTENDED_SPEND_KEY]   = "secret-extended-key-main";
+        keyConstants.bech32HRPs[SAPLING_EXTENDED_FVK]         = "zxviews";
+
+        {
+            std::vector<std::string> ecc_addresses = {
+                "t3LmX1cxWPPPqL4TZHx42HU3U5ghbFjRiif",
+                "t3Toxk1vJQ6UjWQ42tUJz2rV2feUWkpbTDs",
+                "t3ZBdBe4iokmsjdhMuwkxEdqMCFN16YxKe6",
+                "t3ZuaJziLM8xZ32rjDUzVjVtyYdDSz8GLWB",
+                "t3bAtYWa4bi8VrtvqySxnbr5uqcG9czQGTZ",
+                "t3dktADfb5Rmxncpe1HS5BRS5Gcj7MZWYBi",
+                "t3hgskquvKKoCtvxw86yN7q8bzwRxNgUZmc",
+                "t3R1VrLzwcxAZzkX4mX3KGbWpNsgtYtMntj",
+                "t3ff6fhemqPMVujD3AQurxRxTdvS1pPSaa2",
+                "t3cEUQFG3KYnFG6qYhPxSNgGi3HDjUPwC3J",
+                "t3WR9F5U4QvUFqqx9zFmwT6xFqduqRRXnaa",
+                "t3PYc1LWngrdUrJJbHkYPCKvJuvJjcm85Ch",
+                "t3bgkjiUeatWNkhxY3cWyLbTxKksAfk561R",
+                "t3Z5rrR8zahxUpZ8itmCKhMSfxiKjUp5Dk5",
+                "t3PU1j7YW3fJ67jUbkGhSRto8qK2qXCUiW3",
+                "t3S3yaT7EwNLaFZCamfsxxKwamQW2aRGEkh",
+                "t3eutXKJ9tEaPSxZpmowhzKhPfJvmtwTEZK",
+                "t3gbTb7brxLdVVghSPSd3ycGxzHbUpukeDm",
+                "t3UCKW2LrHFqPMQFEbZn6FpjqnhAAbfpMYR",
+                "t3NyHsrnYbqaySoQqEQRyTWkjvM2PLkU7Uu",
+                "t3QEFL6acxuZwiXtW3YvV6njDVGjJ1qeaRo",
+                "t3PdBRr2S1XTDzrV8bnZkXF3SJcrzHWe1wj",
+                "t3ZWyRPpWRo23pKxTLtWsnfEKeq9T4XPxKM",
+                "t3he6QytKCTydhpztykFsSsb9PmBT5JBZLi",
+                "t3VWxWDsLb2TURNEP6tA1ZSeQzUmPKFNxRY",
+                "t3NmWLvZkbciNAipauzsFRMxoZGqmtJksbz",
+                "t3cKr4YxVPvPBG1mCvzaoTTdBNokohsRJ8n",
+                "t3T3smGZn6BoSFXWWXa1RaoQdcyaFjMfuYK",
+                "t3gkDUe9Gm4GGpjMk86TiJZqhztBVMiUSSA",
+                "t3eretuBeBXFHe5jAqeSpUS1cpxVh51fAeb",
+                "t3dN8g9zi2UGJdixGe9txeSxeofLS9t3yFQ",
+                "t3S799pq9sYBFwccRecoTJ3SvQXRHPrHqvx",
+                "t3fhYnv1S5dXwau7GED3c1XErzt4n4vDxmf",
+                "t3cmE3vsBc5xfDJKXXZdpydCPSdZqt6AcNi",
+                "t3h5fPdjJVHaH4HwynYDM5BB3J7uQaoUwKi",
+                "t3Ma35c68BgRX8sdLDJ6WR1PCrKiWHG4Da9",
+                "t3LokMKPL1J8rkJZvVpfuH7dLu6oUWqZKQK",
+                "t3WFFGbEbhJWnASZxVLw2iTJBZfJGGX73mM",
+                "t3L8GLEsUn4QHNaRYcX3EGyXmQ8kjpT1zTa",
+                "t3PgfByBhaBSkH8uq4nYJ9ZBX4NhGCJBVYm",
+                "t3WecsqKDhWXD4JAgBVcnaCC2itzyNZhJrv",
+                "t3ZG9cSfopnsMQupKW5v9sTotjcP5P6RTbn",
+                "t3hC1Ywb5zDwUYYV8LwhvF5rZ6m49jxXSG5",
+                "t3VgMqDL15ZcyQDeqBsBW3W6rzfftrWP2yB",
+                "t3LC94Y6BwLoDtBoK2NuewaEbnko1zvR9rm",
+                "t3cWCUZJR3GtALaTcatrrpNJ3MGbMFVLRwQ",
+                "t3YYF4rPLVxDcF9hHFsXyc5Yq1TFfbojCY6",
+                "t3XHAGxRP2FNfhAjxGjxbrQPYtQQjc3RCQD",
+            };
+
+            // ZF and MG each use a single address repeated 48 times,
+            // once for each funding period.
+            std::vector<std::string> zf_addresses(48, "t3dvVE3SQEi7kqNzwrfNePxZ1d4hUyztBA1");
+            std::vector<std::string> mg_addresses(48, "t3XyYW8yBFRuMnfvm5KLGFbEVz25kckZXym");
+
+            consensus.AddZIP207FundingStream(
+                keyConstants,
+                Consensus::FS_ZIP214_BP,
+                consensus.vUpgrades[Consensus::UPGRADE_CANOPY].nActivationHeight, 2726400,
+                ecc_addresses);
+            consensus.AddZIP207FundingStream(
+                keyConstants,
+                Consensus::FS_ZIP214_ZF,
+                consensus.vUpgrades[Consensus::UPGRADE_CANOPY].nActivationHeight, 2726400,
+                zf_addresses);
+            consensus.AddZIP207FundingStream(
+                keyConstants,
+                Consensus::FS_ZIP214_MG,
+                consensus.vUpgrades[Consensus::UPGRADE_CANOPY].nActivationHeight, 2726400,
+                mg_addresses);
+        }
+
+        // The best chain should have at least this much work.
+        consensus.nMinimumChainWork = uint256S("00000000000000000000000000000000000000000000000004a90edff47bbdc6");
+
+        /**
+         * The message start string should be awesome! ⓩ�
+         */
+        pchMessageStart[0] = 0x24;
+        pchMessageStart[1] = 0xe9;
+        pchMessageStart[2] = 0x27;
+        pchMessageStart[3] = 0x64;
+        vAlertPubKey = ParseHex("04b7ecf0baa90495ceb4e4090f6b2fd37eec1e9c85fac68a487f3ce11589692e4a317479316ee814e066638e1db54e37a10689b70286e6315b1087b6615d179264");
+        nDefaultPort = 8233;
+        nPruneAfterHeight = 100000;
+
+        genesis = CreateGenesisBlock(
+            1477641360,
+            uint256S("0x0000000000000000000000000000000000000000000000000000000000001257"),
+            ParseHex("000a889f00854b8665cd555f4656f68179d31ccadc1b1f7fb0952726313b16941da348284d67add4686121d4e3d930160c1348d8191c25f12b267a6a9c131b5031cbf8af1f79c9d513076a216ec87ed045fa966e01214ed83ca02dc1797270a454720d3206ac7d931a0a680c5c5e099057592570ca9bdf6058343958b31901fce1a15a4f38fd347750912e14004c73dfe588b903b6c03166582eeaf30529b14072a7b3079e3a684601b9b3024054201f7440b0ee9eb1a7120ff43f713735494aa27b1f8bab60d7f398bca14f6abb2adbf29b04099121438a7974b078a11635b594e9170f1086140b4173822dd697894483e1c6b4e8b8dcd5cb12ca4903bc61e108871d4d915a9093c18ac9b02b6716ce1013ca2c1174e319c1a570215bc9ab5f7564765f7be20524dc3fdf8aa356fd94d445e05ab165ad8bb4a0db096c097618c81098f91443c719416d39837af6de85015dca0de89462b1d8386758b2cf8a99e00953b308032ae44c35e05eb71842922eb69797f68813b59caf266cb6c213569ae3280505421a7e3a0a37fdf8e2ea354fc5422816655394a9454bac542a9298f176e211020d63dee6852c40de02267e2fc9d5e1ff2ad9309506f02a1a71a0501b16d0d36f70cdfd8de78116c0c506ee0b8ddfdeb561acadf31746b5a9dd32c21930884397fb1682164cb565cc14e089d66635a32618f7eb05fe05082b8a3fae620571660a6b89886eac53dec109d7cbb6930ca698a168f301a950be152da1be2b9e07516995e20baceebecb5579d7cdbc16d09f3a50cb3c7dffe33f26686d4ff3f8946ee6475e98cf7b3cf9062b6966e838f865ff3de5fb064a37a21da7bb8dfd2501a29e184f207caaba364f36f2329a77515dcb710e29ffbf73e2bbd773fab1f9a6b005567affff605c132e4e4dd69f36bd201005458cfbd2c658701eb2a700251cefd886b1e674ae816d3f719bac64be649c172ba27a4fd55947d95d53ba4cbc73de97b8af5ed4840b659370c556e7376457f51e5ebb66018849923db82c1c9a819f173cccdb8f3324b239609a300018d0fb094adf5bd7cbb3834c69e6d0b3798065c525b20f040e965e1a161af78ff7561cd874f5f1b75aa0bc77f720589e1b810f831eac5073e6dd46d00a2793f70f7427f0f798f2f53a67e615e65d356e66fe40609a958a05edb4c175bcc383ea0530e67ddbe479a898943c6e3074c6fcc252d6014de3a3d292b03f0d88d312fe221be7be7e3c59d07fa0f2f4029e364f1f355c5d01fa53770d0cd76d82bf7e60f6903bc1beb772e6fde4a70be51d9c7e03c8d6d8dfb361a234ba47c470fe630820bbd920715621b9fbedb49fcee165ead0875e6c2b1af16f50b5d6140cc981122fcbcf7c5a4e3772b3661b628e08380abc545957e59f634705b1bbde2f0b4e055a5ec5676d859be77e20962b645e051a880fddb0180b4555789e1f9344a436a84dc5579e2553f1e5fb0a599c137be36cabbed0319831fea3fddf94ddc7971e4bcf02cdc93294a9aab3e3b13e3b058235b4f4ec06ba4ceaa49d675b4ba80716f3bc6976b1fbf9c8bf1f3e3a4dc1cd83ef9cf816667fb94f1e923ff63fef072e6a19321e4812f96cb0ffa864da50ad74deb76917a336f31dce03ed5f0303aad5e6a83634f9fcc371096f8288b8f02ddded5ff1bb9d49331e4a84dbe1543164438fde9ad71dab024779dcdde0b6602b5ae0a6265c14b94edd83b37403f4b78fcd2ed555b596402c28ee81d87a909c4e8722b30c71ecdd861b05f61f8b1231795c76adba2fdefa451b283a5d527955b9f3de1b9828e7b2e74123dd47062ddcc09b05e7fa13cb2212a6fdbc65d7e852cec463ec6fd929f5b8483cf3052113b13dac91b69f49d1b7d1aec01c4a68e41ce157"),
+            0x1f07ffff, 4, 0);
+        consensus.hashGenesisBlock = genesis.GetHash();
+        assert(consensus.hashGenesisBlock == uint256S("0x00040fe8ec8471911baa1db1266ea15dd06b4a8a5c453883c000b031973dce08"));
+        assert(genesis.hashMerkleRoot == uint256S("0xc4eaa58879081de3c24a7b117ed2b28300e7ec4c4c1dff1d3f1268b7857a4ddb"));
+
+        vFixedSeeds.clear();
+        vSeeds.clear();
+        vSeeds.push_back(CDNSSeedData("z.cash", "dnsseed.z.cash")); // Zcash
+        vSeeds.push_back(CDNSSeedData("str4d.xyz", "dnsseed.str4d.xyz")); // @str4d
+        vSeeds.push_back(CDNSSeedData("zfnd.org", "mainnet.seeder.zfnd.org")); // Zcash Foundation
+        vSeeds.push_back(CDNSSeedData("yolo.money", "mainnet.is.yolo.money")); // gtank
+
+        vFixedSeeds = std::vector<SeedSpec6>(pnSeed6_main, pnSeed6_main + ARRAYLEN(pnSeed6_main));
+
+        fMiningRequiresPeers = true;
+        fDefaultConsistencyChecks = false;
+        fRequireStandard = true;
+        fMineBlocksOnDemand = false;
+        fTestnetToBeDeprecatedFieldRPC = false;
+
+        checkpointData = (CCheckpointData) {
+            boost::assign::map_list_of
+            (0, consensus.hashGenesisBlock)
+            (2500, uint256S("0x00000006dc968f600be11a86cbfbf7feb61c7577f45caced2e82b6d261d19744"))
+            (15000, uint256S("0x00000000b6bc56656812a5b8dcad69d6ad4446dec23b5ec456c18641fb5381ba"))
+            (67500, uint256S("0x000000006b366d2c1649a6ebb4787ac2b39c422f451880bc922e3a6fbd723616"))
+            (100000, uint256S("0x000000001c5c82cd6baccfc0879e3830fd50d5ede17fa2c37a9a253c610eb285"))
+            (133337, uint256S("0x0000000002776ccfaf06cc19857accf3e20c01965282f916b8a886e3e4a05be9"))
+            (180000, uint256S("0x000000001205b742eac4a1b3959635bdf8aeada078d6a996df89740f7b54351d"))
+            (222222, uint256S("0x000000000cafb9e56445a6cabc8057b57ee6fcc709e7adbfa195e5c7fac61343"))
+            (270000, uint256S("0x00000000025c1cfa0258e33ab050aaa9338a3d4aaa3eb41defefc887779a9729"))
+            (304600, uint256S("0x00000000028324e022a45014c4a4dc51e95d41e6bceb6ad554c5b65d5cea3ea5"))
+            (410100, uint256S("0x0000000002c565958f783a24a4ac17cde898ff525e75ed9baf66861b0b9fcada"))
+            (497000, uint256S("0x0000000000abd333f0acca6ffdf78a167699686d6a7d25c33fca5f295061ffff"))
+            (525000, uint256S("0x0000000001a36c500378be8862d9bf1bea8f1616da6e155971b608139cc7e39b")),
+            1556722044,     // * UNIX timestamp of last checkpoint block
+            4653556,        // * total number of transactions between genesis and last checkpoint
+            5106            // * estimated number of transactions per day after checkpoint
+                            //   total number of tx / (checkpoint block height / (24 * 24))
+        };
+
+        // Hardcoded fallback value for the Sprout shielded value pool balance
+        // for nodes that have not reindexed since the introduction of monitoring
+        // in #2795.
+        nSproutValuePoolCheckpointHeight = 520633;
+        nSproutValuePoolCheckpointBalance = 22145062442933;
+        fZIP209Enabled = true;
+        hashSproutValuePoolCheckpointBlock = uint256S("0000000000c7b46b6bc04b4cbf87d8bb08722aebd51232619b214f7273f8460e");
+
+        // Founders reward script expects a vector of 2-of-3 multisig addresses
+        vFoundersRewardAddress = {
+            "t3Vz22vK5z2LcKEdg16Yv4FFneEL1zg9ojd", /* main-index: 0*/
+            "t3cL9AucCajm3HXDhb5jBnJK2vapVoXsop3", /* main-index: 1*/
+            "t3fqvkzrrNaMcamkQMwAyHRjfDdM2xQvDTR", /* main-index: 2*/
+            "t3TgZ9ZT2CTSK44AnUPi6qeNaHa2eC7pUyF", /* main-index: 3*/
+            "t3SpkcPQPfuRYHsP5vz3Pv86PgKo5m9KVmx", /* main-index: 4*/
+            "t3Xt4oQMRPagwbpQqkgAViQgtST4VoSWR6S", /* main-index: 5*/
+            "t3ayBkZ4w6kKXynwoHZFUSSgXRKtogTXNgb", /* main-index: 6*/
+            "t3adJBQuaa21u7NxbR8YMzp3km3TbSZ4MGB", /* main-index: 7*/
+            "t3K4aLYagSSBySdrfAGGeUd5H9z5Qvz88t2", /* main-index: 8*/
+            "t3RYnsc5nhEvKiva3ZPhfRSk7eyh1CrA6Rk", /* main-index: 9*/
+            "t3Ut4KUq2ZSMTPNE67pBU5LqYCi2q36KpXQ", /* main-index: 10*/
+            "t3ZnCNAvgu6CSyHm1vWtrx3aiN98dSAGpnD", /* main-index: 11*/
+            "t3fB9cB3eSYim64BS9xfwAHQUKLgQQroBDG", /* main-index: 12*/
+            "t3cwZfKNNj2vXMAHBQeewm6pXhKFdhk18kD", /* main-index: 13*/
+            "t3YcoujXfspWy7rbNUsGKxFEWZqNstGpeG4", /* main-index: 14*/
+            "t3bLvCLigc6rbNrUTS5NwkgyVrZcZumTRa4", /* main-index: 15*/
+            "t3VvHWa7r3oy67YtU4LZKGCWa2J6eGHvShi", /* main-index: 16*/
+            "t3eF9X6X2dSo7MCvTjfZEzwWrVzquxRLNeY", /* main-index: 17*/
+            "t3esCNwwmcyc8i9qQfyTbYhTqmYXZ9AwK3X", /* main-index: 18*/
+            "t3M4jN7hYE2e27yLsuQPPjuVek81WV3VbBj", /* main-index: 19*/
+            "t3gGWxdC67CYNoBbPjNvrrWLAWxPqZLxrVY", /* main-index: 20*/
+            "t3LTWeoxeWPbmdkUD3NWBquk4WkazhFBmvU", /* main-index: 21*/
+            "t3P5KKX97gXYFSaSjJPiruQEX84yF5z3Tjq", /* main-index: 22*/
+            "t3f3T3nCWsEpzmD35VK62JgQfFig74dV8C9", /* main-index: 23*/
+            "t3Rqonuzz7afkF7156ZA4vi4iimRSEn41hj", /* main-index: 24*/
+            "t3fJZ5jYsyxDtvNrWBeoMbvJaQCj4JJgbgX", /* main-index: 25*/
+            "t3Pnbg7XjP7FGPBUuz75H65aczphHgkpoJW", /* main-index: 26*/
+            "t3WeKQDxCijL5X7rwFem1MTL9ZwVJkUFhpF", /* main-index: 27*/
+            "t3Y9FNi26J7UtAUC4moaETLbMo8KS1Be6ME", /* main-index: 28*/
+            "t3aNRLLsL2y8xcjPheZZwFy3Pcv7CsTwBec", /* main-index: 29*/
+            "t3gQDEavk5VzAAHK8TrQu2BWDLxEiF1unBm", /* main-index: 30*/
+            "t3Rbykhx1TUFrgXrmBYrAJe2STxRKFL7G9r", /* main-index: 31*/
+            "t3aaW4aTdP7a8d1VTE1Bod2yhbeggHgMajR", /* main-index: 32*/
+            "t3YEiAa6uEjXwFL2v5ztU1fn3yKgzMQqNyo", /* main-index: 33*/
+            "t3g1yUUwt2PbmDvMDevTCPWUcbDatL2iQGP", /* main-index: 34*/
+            "t3dPWnep6YqGPuY1CecgbeZrY9iUwH8Yd4z", /* main-index: 35*/
+            "t3QRZXHDPh2hwU46iQs2776kRuuWfwFp4dV", /* main-index: 36*/
+            "t3enhACRxi1ZD7e8ePomVGKn7wp7N9fFJ3r", /* main-index: 37*/
+            "t3PkLgT71TnF112nSwBToXsD77yNbx2gJJY", /* main-index: 38*/
+            "t3LQtHUDoe7ZhhvddRv4vnaoNAhCr2f4oFN", /* main-index: 39*/
+            "t3fNcdBUbycvbCtsD2n9q3LuxG7jVPvFB8L", /* main-index: 40*/
+            "t3dKojUU2EMjs28nHV84TvkVEUDu1M1FaEx", /* main-index: 41*/
+            "t3aKH6NiWN1ofGd8c19rZiqgYpkJ3n679ME", /* main-index: 42*/
+            "t3MEXDF9Wsi63KwpPuQdD6by32Mw2bNTbEa", /* main-index: 43*/
+            "t3WDhPfik343yNmPTqtkZAoQZeqA83K7Y3f", /* main-index: 44*/
+            "t3PSn5TbMMAEw7Eu36DYctFezRzpX1hzf3M", /* main-index: 45*/
+            "t3R3Y5vnBLrEn8L6wFjPjBLnxSUQsKnmFpv", /* main-index: 46*/
+            "t3Pcm737EsVkGTbhsu2NekKtJeG92mvYyoN", /* main-index: 47*/
+        };
+
+        assert(vFoundersRewardAddress.size() <= consensus.GetLastFoundersRewardBlockHeight(0));
+    }
+};
+static CMainParams mainParams;
+
+/**
+ * Testnet (v3)
+ */
+class CTestNetParams : public CChainParams {
+public:
+    CTestNetParams() {
+        keyConstants.strNetworkID = "test";
+        strCurrencyUnits = "TAZ";
+        keyConstants.bip44CoinType = 1;
+        consensus.fCoinbaseMustBeShielded = true;
+        consensus.nSubsidySlowStartInterval = 20000;
+        consensus.nPreBlossomSubsidyHalvingInterval = Consensus::PRE_BLOSSOM_HALVING_INTERVAL;
+        consensus.nPostBlossomSubsidyHalvingInterval = POST_BLOSSOM_HALVING_INTERVAL(Consensus::PRE_BLOSSOM_HALVING_INTERVAL);
+        consensus.nMajorityEnforceBlockUpgrade = 51;
+        consensus.nMajorityRejectBlockOutdated = 75;
+        consensus.nMajorityWindow = 400;
+        const size_t N = 200, K = 9;
+        static_assert(equihash_parameters_acceptable(N, K));
+        consensus.nEquihashN = N;
+        consensus.nEquihashK = K;
+        consensus.powLimit = uint256S("07ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff");
+        consensus.nPowAveragingWindow = 17;
+        assert(maxUint/UintToArith256(consensus.powLimit) >= consensus.nPowAveragingWindow);
+        consensus.nPowMaxAdjustDown = 32; // 32% adjustment down
+        consensus.nPowMaxAdjustUp = 16; // 16% adjustment up
+        consensus.nPreBlossomPowTargetSpacing = Consensus::PRE_BLOSSOM_POW_TARGET_SPACING;
+        consensus.nPostBlossomPowTargetSpacing = Consensus::POST_BLOSSOM_POW_TARGET_SPACING;
+        consensus.nPowAllowMinDifficultyBlocksAfterHeight = 299187;
+        consensus.fPowNoRetargeting = false;
+        consensus.vUpgrades[Consensus::BASE_SPROUT].nProtocolVersion = 170002;
+        consensus.vUpgrades[Consensus::BASE_SPROUT].nActivationHeight =
+            Consensus::NetworkUpgrade::ALWAYS_ACTIVE;
+        consensus.vUpgrades[Consensus::UPGRADE_TESTDUMMY].nProtocolVersion = 170002;
+        consensus.vUpgrades[Consensus::UPGRADE_TESTDUMMY].nActivationHeight =
+            Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT;
+        consensus.vUpgrades[Consensus::UPGRADE_OVERWINTER].nProtocolVersion = 170003;
+        consensus.vUpgrades[Consensus::UPGRADE_OVERWINTER].nActivationHeight = 207500;
+        consensus.vUpgrades[Consensus::UPGRADE_OVERWINTER].hashActivationBlock =
+            uint256S("0000257c4331b098045023fcfbfa2474681f4564ab483f84e4e1ad078e4acf44");
+        consensus.vUpgrades[Consensus::UPGRADE_SAPLING].nProtocolVersion = 170007;
+        consensus.vUpgrades[Consensus::UPGRADE_SAPLING].nActivationHeight = 280000;
+        consensus.vUpgrades[Consensus::UPGRADE_SAPLING].hashActivationBlock =
+            uint256S("000420e7fcc3a49d729479fb0b560dd7b8617b178a08e9e389620a9d1dd6361a");
+        consensus.vUpgrades[Consensus::UPGRADE_BLOSSOM].nProtocolVersion = 170008;
+        consensus.vUpgrades[Consensus::UPGRADE_BLOSSOM].nActivationHeight = 584000;
+        consensus.vUpgrades[Consensus::UPGRADE_BLOSSOM].hashActivationBlock =
+            uint256S("00367515ef2e781b8c9358b443b6329572599edd02c59e8af67db9785122f298");
+        consensus.vUpgrades[Consensus::UPGRADE_HEARTWOOD].nProtocolVersion = 170010;
+        consensus.vUpgrades[Consensus::UPGRADE_HEARTWOOD].nActivationHeight = 903800;
+        consensus.vUpgrades[Consensus::UPGRADE_HEARTWOOD].hashActivationBlock =
+            uint256S("05688d8a0e9ff7c04f6f05e6d695dc5ab43b9c4803342d77ae360b2b27d2468e");
+        consensus.vUpgrades[Consensus::UPGRADE_CANOPY].nProtocolVersion = 170012;
+        consensus.vUpgrades[Consensus::UPGRADE_CANOPY].nActivationHeight = 1028500;
+        consensus.vUpgrades[Consensus::UPGRADE_CANOPY].hashActivationBlock =
+            uint256S("01a4d7c6aada30c87762c1bf33fff5df7266b1fd7616bfdb5227fa59bd79e7a2");
+        consensus.vUpgrades[Consensus::UPGRADE_NU5].nProtocolVersion = 170050;
+        consensus.vUpgrades[Consensus::UPGRADE_NU5].nActivationHeight = 1842420;
+        consensus.vUpgrades[Consensus::UPGRADE_NU5].hashActivationBlock =
+            uint256S("0006d75c60b3093d1b671ff7da11c99ea535df9927c02e6ed9eb898605eb7381");
+        consensus.vUpgrades[Consensus::UPGRADE_ZFUTURE].nProtocolVersion = 0x7FFFFFFF;
+        consensus.vUpgrades[Consensus::UPGRADE_ZFUTURE].nActivationHeight =
+            Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT;
+
+        consensus.nFundingPeriodLength = consensus.nPostBlossomSubsidyHalvingInterval / 48;
+
+        // guarantees the first 2 characters, when base58 encoded, are "tm"
+        keyConstants.base58Prefixes[PUBKEY_ADDRESS]     = {0x1D,0x25};
+        // guarantees the first 2 characters, when base58 encoded, are "t2"
+        keyConstants.base58Prefixes[SCRIPT_ADDRESS]     = {0x1C,0xBA};
+        // the first character, when base58 encoded, is "9" or "c" (as in Bitcoin)
+        keyConstants.base58Prefixes[SECRET_KEY]         = {0xEF};
+        // do not rely on these BIP32 prefixes; they are not specified and may change
+        keyConstants.base58Prefixes[EXT_PUBLIC_KEY]     = {0x04,0x35,0x87,0xCF};
+        keyConstants.base58Prefixes[EXT_SECRET_KEY]     = {0x04,0x35,0x83,0x94};
+        // guarantees the first 2 characters, when base58 encoded, are "zt"
+        keyConstants.base58Prefixes[ZCPAYMENT_ADDRESS]  = {0x16,0xB6};
+        // guarantees the first 4 characters, when base58 encoded, are "ZiVt"
+        keyConstants.base58Prefixes[ZCVIEWING_KEY]      = {0xA8,0xAC,0x0C};
+        // guarantees the first 2 characters, when base58 encoded, are "ST"
+        keyConstants.base58Prefixes[ZCSPENDING_KEY]     = {0xAC,0x08};
+
+        keyConstants.bech32HRPs[SAPLING_PAYMENT_ADDRESS]      = "ztestsapling";
+        keyConstants.bech32HRPs[SAPLING_FULL_VIEWING_KEY]     = "zviewtestsapling";
+        keyConstants.bech32HRPs[SAPLING_INCOMING_VIEWING_KEY] = "zivktestsapling";
+        keyConstants.bech32HRPs[SAPLING_EXTENDED_SPEND_KEY]   = "secret-extended-key-test";
+        keyConstants.bech32HRPs[SAPLING_EXTENDED_FVK]         = "zxviewtestsapling";
+
+        // Testnet funding streams
+        {
+            std::vector<std::string> ecc_addresses = {
+                "t26ovBdKAJLtrvBsE2QGF4nqBkEuptuPFZz",
+                "t26ovBdKAJLtrvBsE2QGF4nqBkEuptuPFZz",
+                "t26ovBdKAJLtrvBsE2QGF4nqBkEuptuPFZz",
+                "t26ovBdKAJLtrvBsE2QGF4nqBkEuptuPFZz",
+                "t2NNHrgPpE388atmWSF4DxAb3xAoW5Yp45M",
+                "t2VMN28itPyMeMHBEd9Z1hm6YLkQcGA1Wwe",
+                "t2CHa1TtdfUV8UYhNm7oxbzRyfr8616BYh2",
+                "t2F77xtr28U96Z2bC53ZEdTnQSUAyDuoa67",
+                "t2ARrzhbgcpoVBDPivUuj6PzXzDkTBPqfcT",
+                "t278aQ8XbvFR15mecRguiJDQQVRNnkU8kJw",
+                "t2Dp1BGnZsrTXZoEWLyjHmg3EPvmwBnPDGB",
+                "t2KzeqXgf4ju33hiSqCuKDb8iHjPCjMq9iL",
+                "t2Nyxqv1BiWY1eUSiuxVw36oveawYuo18tr",
+                "t2DKFk5JRsVoiuinK8Ti6eM4Yp7v8BbfTyH",
+                "t2CUaBca4k1x36SC4q8Nc8eBoqkMpF3CaLg",
+                "t296SiKL7L5wvFmEdMxVLz1oYgd6fTfcbZj",
+                "t29fBCFbhgsjL3XYEZ1yk1TUh7eTusB6dPg",
+                "t2FGofLJXa419A76Gpf5ncxQB4gQXiQMXjK",
+                "t2ExfrnRVnRiXDvxerQ8nZbcUQvNvAJA6Qu",
+                "t28JUffLp47eKPRHKvwSPzX27i9ow8LSXHx",
+                "t2JXWPtrtyL861rFWMZVtm3yfgxAf4H7uPA",
+                "t2QdgbJoWfYHgyvEDEZBjHmgkr9yNJff3Hi",
+                "t2QW43nkco8r32ZGRN6iw6eSzyDjkMwCV3n",
+                "t2DgYDXMJTYLwNcxighQ9RCgPxMVATRcUdC",
+                "t2Bop7dg33HGZx3wunnQzi2R2ntfpjuti3M",
+                "t2HVeEwovcLq9RstAbYkqngXNEsCe2vjJh9",
+                "t2HxbP5keQSx7p592zWQ5bJ5GrMmGDsV2Xa",
+                "t2TJzUg2matao3mztBRJoWnJY6ekUau6tPD",
+                "t29pMzxmo6wod25YhswcjKv3AFRNiBZHuhj",
+                "t2QBQMRiJKYjshJpE6RhbF7GLo51yE6d4wZ",
+                "t2F5RqnqguzZeiLtYHFx4yYfy6pDnut7tw5",
+                "t2CHvyZANE7XCtg8AhZnrcHCC7Ys1jJhK13",
+                "t2BRzpMdrGWZJ2upsaNQv6fSbkbTy7EitLo",
+                "t2BFixHGQMAWDY67LyTN514xRAB94iEjXp3",
+                "t2Uvz1iVPzBEWfQBH1p7NZJsFhD74tKaG8V",
+                "t2CmFDj5q6rJSRZeHf1SdrowinyMNcj438n",
+                "t2ErNvWEReTfPDBaNizjMPVssz66aVZh1hZ",
+                "t2GeJQ8wBUiHKDVzVM5ZtKfY5reCg7CnASs",
+                "t2L2eFtkKv1G6j55kLytKXTGuir4raAy3yr",
+                "t2EK2b87dpPazb7VvmEGc8iR6SJ289RywGL",
+                "t2DJ7RKeZJxdA4nZn8hRGXE8NUyTzjujph9",
+                "t2K1pXo4eByuWpKLkssyMLe8QKUbxnfFC3H",
+                "t2TB4mbSpuAcCWkH94Leb27FnRxo16AEHDg",
+                "t2Phx4gVL4YRnNsH3jM1M7jE4Fo329E66Na",
+                "t2VQZGmeNomN8c3USefeLL9nmU6M8x8CVzC",
+                "t2RicCvTVTY5y9JkreSRv3Xs8q2K67YxHLi",
+                "t2JrSLxTGc8wtPDe9hwbaeUjCrCfc4iZnDD",
+                "t2Uh9Au1PDDSw117sAbGivKREkmMxVC5tZo",
+                "t2FDwoJKLeEBMTy3oP7RLQ1Fihhvz49a3Bv",
+                "t2FY18mrgtb7QLeHA8ShnxLXuW8cNQ2n1v8",
+                "t2L15TkDYum7dnQRBqfvWdRe8Yw3jVy9z7g",
+            };
+
+            // ZF and MG use the same address for each funding period
+            std::vector<std::string> zf_addresses(51, "t27eWDgjFYJGVXmzrXeVjnb5J3uXDM9xH9v");
+            std::vector<std::string> mg_addresses(51, "t2Gvxv2uNM7hbbACjNox4H6DjByoKZ2Fa3P");
+
+            consensus.AddZIP207FundingStream(
+                keyConstants,
+                Consensus::FS_ZIP214_BP,
+                consensus.vUpgrades[Consensus::UPGRADE_CANOPY].nActivationHeight, 2796000,
+                ecc_addresses);
+            consensus.AddZIP207FundingStream(
+                keyConstants,
+                Consensus::FS_ZIP214_ZF,
+                consensus.vUpgrades[Consensus::UPGRADE_CANOPY].nActivationHeight, 2796000,
+                zf_addresses);
+            consensus.AddZIP207FundingStream(
+                keyConstants,
+                Consensus::FS_ZIP214_MG,
+                consensus.vUpgrades[Consensus::UPGRADE_CANOPY].nActivationHeight, 2796000,
+                mg_addresses);
+        }
+
+        // On testnet we activate this rule 6 blocks after Blossom activation. From block 299188 and
+        // prior to Blossom activation, the testnet minimum-difficulty threshold was 15 minutes (i.e.
+        // a minimum difficulty block can be mined if no block is mined normally within 15 minutes):
+        // <https://zips.z.cash/zip-0205#change-to-difficulty-adjustment-on-testnet>
+        // However the median-time-past is 6 blocks behind, and the worst-case time for 7 blocks at a
+        // 15-minute spacing is ~105 minutes, which exceeds the limit imposed by the soft fork of
+        // 90 minutes.
+        //
+        // After Blossom, the minimum difficulty threshold time is changed to 6 times the block target
+        // spacing, which is 7.5 minutes:
+        // <https://zips.z.cash/zip-0208#minimum-difficulty-blocks-on-the-test-network>
+        // 7 times that is 52.5 minutes which is well within the limit imposed by the soft fork.
+
+        static_assert(6 * Consensus::POST_BLOSSOM_POW_TARGET_SPACING * 7 < MAX_FUTURE_BLOCK_TIME_MTP - 60,
+                      "MAX_FUTURE_BLOCK_TIME_MTP is too low given block target spacing");
+        consensus.nFutureTimestampSoftForkHeight = consensus.vUpgrades[Consensus::UPGRADE_BLOSSOM].nActivationHeight + 6;
+
+        // The best chain should have at least this much work.
+        consensus.nMinimumChainWork = uint256S("000000000000000000000000000000000000000000000000000000263c0984a2");
+
+        pchMessageStart[0] = 0xfa;
+        pchMessageStart[1] = 0x1a;
+        pchMessageStart[2] = 0xf9;
+        pchMessageStart[3] = 0xbf;
+        vAlertPubKey = ParseHex("044e7a1553392325c871c5ace5d6ad73501c66f4c185d6b0453cf45dec5a1322e705c672ac1a27ef7cdaf588c10effdf50ed5f95f85f2f54a5f6159fca394ed0c6");
+        nDefaultPort = 18233;
+        nPruneAfterHeight = 1000;
+
+        genesis = CreateGenesisBlock(
+            1477648033,
+            uint256S("0x0000000000000000000000000000000000000000000000000000000000000006"),
+            ParseHex("00a6a51259c3f6732481e2d035197218b7a69504461d04335503cd69759b2d02bd2b53a9653f42cb33c608511c953673fa9da76170958115fe92157ad3bb5720d927f18e09459bf5c6072973e143e20f9bdf0584058c96b7c2234c7565f100d5eea083ba5d3dbaff9f0681799a113e7beff4a611d2b49590563109962baa149b628aae869af791f2f70bb041bd7ebfa658570917f6654a142b05e7ec0289a4f46470be7be5f693b90173eaaa6e84907170f32602204f1f4e1c04b1830116ffd0c54f0b1caa9a5698357bd8aa1f5ac8fc93b405265d824ba0e49f69dab5446653927298e6b7bdc61ee86ff31c07bde86331b4e500d42e4e50417e285502684b7966184505b885b42819a88469d1e9cf55072d7f3510f85580db689302eab377e4e11b14a91fdd0df7627efc048934f0aff8e7eb77eb17b3a95de13678004f2512293891d8baf8dde0ef69be520a58bbd6038ce899c9594cf3e30b8c3d9c7ecc832d4c19a6212747b50724e6f70f6451f78fd27b58ce43ca33b1641304a916186cfbe7dbca224f55d08530ba851e4df22baf7ab7078e9cbea46c0798b35a750f54103b0cdd08c81a6505c4932f6bfbd492a9fced31d54e98b6370d4c96600552fcf5b37780ed18c8787d03200963600db297a8f05dfa551321d17b9917edadcda51e274830749d133ad226f8bb6b94f13b4f77e67b35b71f52112ce9ba5da706ad9573584a2570a4ff25d29ab9761a06bdcf2c33638bf9baf2054825037881c14adf3816ba0cbd0fca689aad3ce16f2fe362c98f48134a9221765d939f0b49677d1c2447e56b46859f1810e2cf23e82a53e0d44f34dae932581b3b7f49eaec59af872cf9de757a964f7b33d143a36c270189508fcafe19398e4d2966948164d40556b05b7ff532f66f5d1edc41334ef742f78221dfe0c7ae2275bb3f24c89ae35f00afeea4e6ed187b866b209dc6e83b660593fce7c40e143beb07ac86c56f39e895385924667efe3a3f031938753c7764a2dbeb0a643fd359c46e614873fd0424e435fa7fac083b9a41a9d6bf7e284eee537ea7c50dd239f359941a43dc982745184bf3ee31a8dc850316aa9c6b66d6985acee814373be3458550659e1a06287c3b3b76a185c5cb93e38c1eebcf34ff072894b6430aed8d34122dafd925c46a515cca79b0269c92b301890ca6b0dc8b679cdac0f23318c105de73d7a46d16d2dad988d49c22e9963c117960bdc70ef0db6b091cf09445a516176b7f6d58ec29539166cc8a38bbff387acefffab2ea5faad0e8bb70625716ef0edf61940733c25993ea3de9f0be23d36e7cb8da10505f9dc426cd0e6e5b173ab4fff8c37e1f1fb56d1ea372013d075e0934c6919393cfc21395eea20718fad03542a4162a9ded66c814ad8320b2d7c2da3ecaf206da34c502db2096d1c46699a91dd1c432f019ad434e2c1ce507f91104f66f491fed37b225b8e0b2888c37276cfa0468fc13b8d593fd9a2675f0f5b20b8a15f8fa7558176a530d6865738ddb25d3426dab905221681cf9da0e0200eea5b2eba3ad3a5237d2a391f9074bf1779a2005cee43eec2b058511532635e0fea61664f531ac2b356f40db5c5d275a4cf5c82d468976455af4e3362cc8f71aa95e71d394aff3ead6f7101279f95bcd8a0fedce1d21cb3c9f6dd3b182fce0db5d6712981b651f29178a24119968b14783cafa713bc5f2a65205a42e4ce9dc7ba462bdb1f3e4553afc15f5f39998fdb53e7e231e3e520a46943734a007c2daa1eda9f495791657eefcac5c32833936e568d06187857ed04d7b97167ae207c5c5ae54e528c36016a984235e9c5b2f0718d7b3aa93c7822ccc772580b6599671b3c02ece8a21399abd33cfd3028790133167d0a97e7de53dc8ff"),
+            0x2007ffff, 4, 0);
+        consensus.hashGenesisBlock = genesis.GetHash();
+        assert(consensus.hashGenesisBlock == uint256S("0x05a60a92d99d85997cce3b87616c089f6124d7342af37106edc76126334a2c38"));
+        assert(genesis.hashMerkleRoot == uint256S("0xc4eaa58879081de3c24a7b117ed2b28300e7ec4c4c1dff1d3f1268b7857a4ddb"));
+
+        vFixedSeeds.clear();
+        vSeeds.clear();
+        vSeeds.push_back(CDNSSeedData("z.cash", "dnsseed.testnet.z.cash")); // Zcash
+        vSeeds.push_back(CDNSSeedData("zfnd.org", "testnet.seeder.zfnd.org")); // Zcash Foundation
+        vSeeds.push_back(CDNSSeedData("yolo.money", "testnet.is.yolo.money")); // gtank
+
+        vFixedSeeds = std::vector<SeedSpec6>(pnSeed6_test, pnSeed6_test + ARRAYLEN(pnSeed6_test));
+
+        fMiningRequiresPeers = true;
+        fDefaultConsistencyChecks = false;
+        fRequireStandard = true;
+        fMineBlocksOnDemand = false;
+        fTestnetToBeDeprecatedFieldRPC = true;
+
+
+        checkpointData = (CCheckpointData) {
+            boost::assign::map_list_of
+            (0, consensus.hashGenesisBlock)
+            (38000, uint256S("0x001e9a2d2e2892b88e9998cf7b079b41d59dd085423a921fe8386cecc42287b8")),
+            1486897419,  // * UNIX timestamp of last checkpoint block
+            47163,       // * total number of transactions between genesis and last checkpoint
+            715          //   total number of tx / (checkpoint block height / (24 * 24))
+        };
+
+        // Hardcoded fallback value for the Sprout shielded value pool balance
+        // for nodes that have not reindexed since the introduction of monitoring
+        // in #2795.
+        nSproutValuePoolCheckpointHeight = 440329;
+        nSproutValuePoolCheckpointBalance = 40000029096803;
+        fZIP209Enabled = true;
+        hashSproutValuePoolCheckpointBlock = uint256S("000a95d08ba5dcbabe881fc6471d11807bcca7df5f1795c99f3ec4580db4279b");
+
+        // Founders reward script expects a vector of 2-of-3 multisig addresses
+        vFoundersRewardAddress = {
+            "t2UNzUUx8mWBCRYPRezvA363EYXyEpHokyi", "t2N9PH9Wk9xjqYg9iin1Ua3aekJqfAtE543", "t2NGQjYMQhFndDHguvUw4wZdNdsssA6K7x2", "t2ENg7hHVqqs9JwU5cgjvSbxnT2a9USNfhy",
+            "t2BkYdVCHzvTJJUTx4yZB8qeegD8QsPx8bo", "t2J8q1xH1EuigJ52MfExyyjYtN3VgvshKDf", "t2Crq9mydTm37kZokC68HzT6yez3t2FBnFj", "t2EaMPUiQ1kthqcP5UEkF42CAFKJqXCkXC9",
+            "t2F9dtQc63JDDyrhnfpzvVYTJcr57MkqA12", "t2LPirmnfYSZc481GgZBa6xUGcoovfytBnC", "t26xfxoSw2UV9Pe5o3C8V4YybQD4SESfxtp", "t2D3k4fNdErd66YxtvXEdft9xuLoKD7CcVo",
+            "t2DWYBkxKNivdmsMiivNJzutaQGqmoRjRnL", "t2C3kFF9iQRxfc4B9zgbWo4dQLLqzqjpuGQ", "t2MnT5tzu9HSKcppRyUNwoTp8MUueuSGNaB", "t2AREsWdoW1F8EQYsScsjkgqobmgrkKeUkK",
+            "t2Vf4wKcJ3ZFtLj4jezUUKkwYR92BLHn5UT", "t2K3fdViH6R5tRuXLphKyoYXyZhyWGghDNY", "t2VEn3KiKyHSGyzd3nDw6ESWtaCQHwuv9WC", "t2F8XouqdNMq6zzEvxQXHV1TjwZRHwRg8gC",
+            "t2BS7Mrbaef3fA4xrmkvDisFVXVrRBnZ6Qj", "t2FuSwoLCdBVPwdZuYoHrEzxAb9qy4qjbnL", "t2SX3U8NtrT6gz5Db1AtQCSGjrpptr8JC6h", "t2V51gZNSoJ5kRL74bf9YTtbZuv8Fcqx2FH",
+            "t2FyTsLjjdm4jeVwir4xzj7FAkUidbr1b4R", "t2EYbGLekmpqHyn8UBF6kqpahrYm7D6N1Le", "t2NQTrStZHtJECNFT3dUBLYA9AErxPCmkka", "t2GSWZZJzoesYxfPTWXkFn5UaxjiYxGBU2a",
+            "t2RpffkzyLRevGM3w9aWdqMX6bd8uuAK3vn", "t2JzjoQqnuXtTGSN7k7yk5keURBGvYofh1d", "t2AEefc72ieTnsXKmgK2bZNckiwvZe3oPNL", "t2NNs3ZGZFsNj2wvmVd8BSwSfvETgiLrD8J",
+            "t2ECCQPVcxUCSSQopdNquguEPE14HsVfcUn", "t2JabDUkG8TaqVKYfqDJ3rqkVdHKp6hwXvG", "t2FGzW5Zdc8Cy98ZKmRygsVGi6oKcmYir9n", "t2DUD8a21FtEFn42oVLp5NGbogY13uyjy9t",
+            "t2UjVSd3zheHPgAkuX8WQW2CiC9xHQ8EvWp", "t2TBUAhELyHUn8i6SXYsXz5Lmy7kDzA1uT5", "t2Tz3uCyhP6eizUWDc3bGH7XUC9GQsEyQNc", "t2NysJSZtLwMLWEJ6MH3BsxRh6h27mNcsSy",
+            "t2KXJVVyyrjVxxSeazbY9ksGyft4qsXUNm9", "t2J9YYtH31cveiLZzjaE4AcuwVho6qjTNzp", "t2QgvW4sP9zaGpPMH1GRzy7cpydmuRfB4AZ", "t2NDTJP9MosKpyFPHJmfjc5pGCvAU58XGa4",
+            "t29pHDBWq7qN4EjwSEHg8wEqYe9pkmVrtRP", "t2Ez9KM8VJLuArcxuEkNRAkhNvidKkzXcjJ", "t2D5y7J5fpXajLbGrMBQkFg2mFN8fo3n8cX", "t2UV2wr1PTaUiybpkV3FdSdGxUJeZdZztyt",
+            };
+        assert(vFoundersRewardAddress.size() <= consensus.GetLastFoundersRewardBlockHeight(0));
+    }
+};
+static CTestNetParams testNetParams;
+
+/**
+ * Regression test
+ */
+class CRegTestParams : public CChainParams {
+public:
+    CRegTestParams() {
+        keyConstants.strNetworkID = "regtest";
+        strCurrencyUnits = "REG";
+        keyConstants.bip44CoinType = 1;
+        consensus.fCoinbaseMustBeShielded = false;
+        consensus.nSubsidySlowStartInterval = 0;
+        consensus.nPreBlossomSubsidyHalvingInterval = Consensus::PRE_BLOSSOM_REGTEST_HALVING_INTERVAL;
+        consensus.nPostBlossomSubsidyHalvingInterval = POST_BLOSSOM_HALVING_INTERVAL(Consensus::PRE_BLOSSOM_REGTEST_HALVING_INTERVAL);
+        consensus.nMajorityEnforceBlockUpgrade = 750;
+        consensus.nMajorityRejectBlockOutdated = 950;
+        consensus.nMajorityWindow = 1000;
+        const size_t N = 48, K = 5;
+        static_assert(equihash_parameters_acceptable(N, K));
+        consensus.nEquihashN = N;
+        consensus.nEquihashK = K;
+        consensus.powLimit = uint256S("0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f"); // if this is any larger, the for loop in GetNextWorkRequired can overflow bnTot
+        consensus.nPowAveragingWindow = 17;
+        assert(maxUint/UintToArith256(consensus.powLimit) >= consensus.nPowAveragingWindow);
+        consensus.nPowMaxAdjustDown = 0; // Turn off adjustment down
+        consensus.nPowMaxAdjustUp = 0; // Turn off adjustment up
+        consensus.nPreBlossomPowTargetSpacing = Consensus::PRE_BLOSSOM_POW_TARGET_SPACING;
+        consensus.nPostBlossomPowTargetSpacing = Consensus::POST_BLOSSOM_POW_TARGET_SPACING;
+        consensus.nPowAllowMinDifficultyBlocksAfterHeight = 0;
+        consensus.fPowNoRetargeting = true;
+        consensus.vUpgrades[Consensus::BASE_SPROUT].nProtocolVersion = 170002;
+        consensus.vUpgrades[Consensus::BASE_SPROUT].nActivationHeight =
+            Consensus::NetworkUpgrade::ALWAYS_ACTIVE;
+        consensus.vUpgrades[Consensus::UPGRADE_TESTDUMMY].nProtocolVersion = 170002;
+        consensus.vUpgrades[Consensus::UPGRADE_TESTDUMMY].nActivationHeight =
+            Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT;
+        consensus.vUpgrades[Consensus::UPGRADE_OVERWINTER].nProtocolVersion = 170003;
+        consensus.vUpgrades[Consensus::UPGRADE_OVERWINTER].nActivationHeight =
+            Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT;
+        consensus.vUpgrades[Consensus::UPGRADE_SAPLING].nProtocolVersion = 170006;
+        consensus.vUpgrades[Consensus::UPGRADE_SAPLING].nActivationHeight =
+            Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT;
+        consensus.vUpgrades[Consensus::UPGRADE_BLOSSOM].nProtocolVersion = 170008;
+        consensus.vUpgrades[Consensus::UPGRADE_BLOSSOM].nActivationHeight =
+            Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT;
+        consensus.vUpgrades[Consensus::UPGRADE_HEARTWOOD].nProtocolVersion = 170010;
+        consensus.vUpgrades[Consensus::UPGRADE_HEARTWOOD].nActivationHeight =
+            Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT;
+        consensus.vUpgrades[Consensus::UPGRADE_CANOPY].nProtocolVersion = 170012;
+        consensus.vUpgrades[Consensus::UPGRADE_CANOPY].nActivationHeight =
+            Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT;
+        consensus.vUpgrades[Consensus::UPGRADE_NU5].nProtocolVersion = 170050;
+        consensus.vUpgrades[Consensus::UPGRADE_NU5].nActivationHeight =
+            Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT;
+        consensus.vUpgrades[Consensus::UPGRADE_ZFUTURE].nProtocolVersion = 0x7FFFFFFF;
+        consensus.vUpgrades[Consensus::UPGRADE_ZFUTURE].nActivationHeight =
+            Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT;
+
+        consensus.nFundingPeriodLength = consensus.nPostBlossomSubsidyHalvingInterval / 48;
+        // Defined funding streams can be enabled with node config flags.
+
+        // These prefixes are the same as the testnet prefixes
+        keyConstants.base58Prefixes[PUBKEY_ADDRESS]     = {0x1D,0x25};
+        keyConstants.base58Prefixes[SCRIPT_ADDRESS]     = {0x1C,0xBA};
+        keyConstants.base58Prefixes[SECRET_KEY]         = {0xEF};
+        // do not rely on these BIP32 prefixes; they are not specified and may change
+        keyConstants.base58Prefixes[EXT_PUBLIC_KEY]     = {0x04,0x35,0x87,0xCF};
+        keyConstants.base58Prefixes[EXT_SECRET_KEY]     = {0x04,0x35,0x83,0x94};
+        keyConstants.base58Prefixes[ZCPAYMENT_ADDRESS]  = {0x16,0xB6};
+        keyConstants.base58Prefixes[ZCVIEWING_KEY]      = {0xA8,0xAC,0x0C};
+        keyConstants.base58Prefixes[ZCSPENDING_KEY]     = {0xAC,0x08};
+
+        keyConstants.bech32HRPs[SAPLING_PAYMENT_ADDRESS]      = "zregtestsapling";
+        keyConstants.bech32HRPs[SAPLING_FULL_VIEWING_KEY]     = "zviewregtestsapling";
+        keyConstants.bech32HRPs[SAPLING_INCOMING_VIEWING_KEY] = "zivkregtestsapling";
+        keyConstants.bech32HRPs[SAPLING_EXTENDED_SPEND_KEY]   = "secret-extended-key-regtest";
+        keyConstants.bech32HRPs[SAPLING_EXTENDED_FVK]         = "zxviewregtestsapling";
+
+        // The best chain should have at least this much work.
+        consensus.nMinimumChainWork = uint256S("0x00");
+
+        pchMessageStart[0] = 0xaa;
+        pchMessageStart[1] = 0xe8;
+        pchMessageStart[2] = 0x3f;
+        pchMessageStart[3] = 0x5f;
+        nDefaultPort = 18344;
+        nPruneAfterHeight = 1000;
+
+        genesis = CreateGenesisBlock(
+            1296688602,
+            uint256S("0x0000000000000000000000000000000000000000000000000000000000000009"),
+            ParseHex("01936b7db1eb4ac39f151b8704642d0a8bda13ec547d54cd5e43ba142fc6d8877cab07b3"),
+            0x200f0f0f, 4, 0);
+        consensus.hashGenesisBlock = genesis.GetHash();
+        assert(consensus.hashGenesisBlock == uint256S("0x029f11d80ef9765602235e1bc9727e3eb6ba20839319f761fee920d63401e327"));
+        assert(genesis.hashMerkleRoot == uint256S("0xc4eaa58879081de3c24a7b117ed2b28300e7ec4c4c1dff1d3f1268b7857a4ddb"));
+
+        vFixedSeeds.clear(); //!< Regtest mode doesn't have any fixed seeds.
+        vSeeds.clear();      //!< Regtest mode doesn't have any DNS seeds.
+
+        fMiningRequiresPeers = false;
+        fDefaultConsistencyChecks = true;
+        fRequireStandard = false;
+        fMineBlocksOnDemand = true;
+        fTestnetToBeDeprecatedFieldRPC = false;
+
+        checkpointData = (CCheckpointData){
+            boost::assign::map_list_of
+            ( 0, uint256S("0f9188f13cb7b2c71f2a335e3a4fc328bf5beb436012afca590b1a11466e2206")),
+            0,
+            0,
+            0
+        };
+
+        // Founders reward script expects a vector of 2-of-3 multisig addresses
+        vFoundersRewardAddress = { "t2FwcEhFdNXuFMv1tcYwaBJtYVtMj8b1uTg" };
+        assert(vFoundersRewardAddress.size() <= consensus.GetLastFoundersRewardBlockHeight(0));
+
+        // do not require the wallet backup to be confirmed in regtest mode
+        fRequireWalletBackup = false;
+    }
+
+    void UpdateNetworkUpgradeParameters(Consensus::UpgradeIndex idx, int nActivationHeight)
+    {
+        assert(idx > Consensus::BASE_SPROUT && idx < Consensus::MAX_NETWORK_UPGRADES);
+        consensus.vUpgrades[idx].nActivationHeight = nActivationHeight;
+    }
+
+    void UpdateFundingStreamParameters(Consensus::FundingStreamIndex idx, Consensus::FundingStream fs)
+    {
+        assert(idx >= Consensus::FIRST_FUNDING_STREAM && idx < Consensus::MAX_FUNDING_STREAMS);
+        consensus.vFundingStreams[idx] = fs;
+    }
+
+    void UpdateRegtestPow(
+        int64_t nPowMaxAdjustDown,
+        int64_t nPowMaxAdjustUp,
+        uint256 powLimit,
+        bool noRetargeting)
+    {
+        consensus.nPowMaxAdjustDown = nPowMaxAdjustDown;
+        consensus.nPowMaxAdjustUp = nPowMaxAdjustUp;
+        consensus.powLimit = powLimit;
+        consensus.fPowNoRetargeting = noRetargeting;
+    }
+
+    void SetRegTestZIP209Enabled() {
+        fZIP209Enabled = true;
+    }
+};
+static CRegTestParams regTestParams;
+
+static CChainParams *pCurrentParams = 0;
+
+const CChainParams &Params() {
+    assert(pCurrentParams);
+    return *pCurrentParams;
+}
+
+CChainParams& Params(const std::string& chain)
+{
+    if (chain == CBaseChainParams::MAIN)
+            return mainParams;
+    else if (chain == CBaseChainParams::TESTNET)
+            return testNetParams;
+    else if (chain == CBaseChainParams::REGTEST)
+            return regTestParams;
+    else
+        throw std::runtime_error(strprintf("%s: Unknown chain %s.", __func__, chain));
+}
+
+void SelectParams(const std::string& network)
+{
+    SelectBaseParams(network);
+    pCurrentParams = &Params(network);
+
+    // Some python qa rpc tests need to enforce the coinbase consensus rule
+    if (network == CBaseChainParams::REGTEST && mapArgs.count("-regtestshieldcoinbase")) {
+        regTestParams.SetRegTestCoinbaseMustBeShielded();
+    }
+
+    // When a developer is debugging turnstile violations in regtest mode, enable ZIP209
+    if (network == CBaseChainParams::REGTEST && mapArgs.count("-developersetpoolsizezero")) {
+        regTestParams.SetRegTestZIP209Enabled();
+    }
+}
+
+
+// Block height must be >0 and <=last founders reward block height
+// Index variable i ranges from 0 - (vFoundersRewardAddress.size()-1)
+std::string CChainParams::GetFoundersRewardAddressAtHeight(int nHeight) const {
+    int preBlossomMaxHeight = consensus.GetLastFoundersRewardBlockHeight(0);
+    // zip208
+    // FounderAddressAdjustedHeight(height) :=
+    // height, if not IsBlossomActivated(height)
+    // BlossomActivationHeight + floor((height - BlossomActivationHeight) / BlossomPoWTargetSpacingRatio), otherwise
+    bool blossomActive = consensus.NetworkUpgradeActive(nHeight, Consensus::UPGRADE_BLOSSOM);
+    if (blossomActive) {
+        int blossomActivationHeight = consensus.vUpgrades[Consensus::UPGRADE_BLOSSOM].nActivationHeight;
+        nHeight = blossomActivationHeight + ((nHeight - blossomActivationHeight) / Consensus::BLOSSOM_POW_TARGET_SPACING_RATIO);
+    }
+    assert(nHeight > 0 && nHeight <= preBlossomMaxHeight);
+    size_t addressChangeInterval = (preBlossomMaxHeight + vFoundersRewardAddress.size()) / vFoundersRewardAddress.size();
+    size_t i = nHeight / addressChangeInterval;
+    return vFoundersRewardAddress[i];
+}
+
+// Block height must be >0 and <=last founders reward block height
+// The founders reward address is expected to be a multisig (P2SH) address
+CScript CChainParams::GetFoundersRewardScriptAtHeight(int nHeight) const {
+    assert(nHeight > 0 && nHeight <= consensus.GetLastFoundersRewardBlockHeight(nHeight));
+
+    KeyIO keyIO(*this);
+    auto address = keyIO.DecodePaymentAddress(GetFoundersRewardAddressAtHeight(nHeight).c_str());
+    assert(address.has_value());
+    assert(std::holds_alternative<CScriptID>(address.value()));
+    CScriptID scriptID = std::get<CScriptID>(address.value());
+    CScript script = CScript() << OP_HASH160 << ToByteVector(scriptID) << OP_EQUAL;
+    return script;
+}
+
+std::string CChainParams::GetFoundersRewardAddressAtIndex(int i) const {
+    assert(i >= 0 && i < vFoundersRewardAddress.size());
+    return vFoundersRewardAddress[i];
+}
+
+void UpdateNetworkUpgradeParameters(Consensus::UpgradeIndex idx, int nActivationHeight)
+{
+    regTestParams.UpdateNetworkUpgradeParameters(idx, nActivationHeight);
+}
+
+void UpdateFundingStreamParameters(Consensus::FundingStreamIndex idx, Consensus::FundingStream fs)
+{
+    regTestParams.UpdateFundingStreamParameters(idx, fs);
+}
+
+void UpdateRegtestPow(
+    int64_t nPowMaxAdjustDown,
+    int64_t nPowMaxAdjustUp,
+    uint256 powLimit,
+    bool noRetargeting)
+{
+    regTestParams.UpdateRegtestPow(nPowMaxAdjustDown, nPowMaxAdjustUp, powLimit, noRetargeting);
+}
diff --git a/depend/zcash/src/chainparams.h b/depend/zcash/src/chainparams.h
new file mode 100644
index 000000000..4b04ac967
--- /dev/null
+++ b/depend/zcash/src/chainparams.h
@@ -0,0 +1,154 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_CHAINPARAMS_H
+#define BITCOIN_CHAINPARAMS_H
+
+#include "chainparamsbase.h"
+#include "consensus/params.h"
+#include "primitives/block.h"
+#include "protocol.h"
+
+#include <vector>
+
+struct CDNSSeedData {
+    std::string name, host;
+    CDNSSeedData(const std::string &strName, const std::string &strHost) : name(strName), host(strHost) {}
+};
+
+struct SeedSpec6 {
+    uint8_t addr[16];
+    uint16_t port;
+};
+
+typedef std::map<int, uint256> MapCheckpoints;
+
+struct CCheckpointData {
+    MapCheckpoints mapCheckpoints;
+    int64_t nTimeLastCheckpoint;
+    int64_t nTransactionsLastCheckpoint;
+    double fTransactionsPerDay;
+};
+
+/**
+ * CChainParams defines various tweakable parameters of a given instance of the
+ * Bitcoin system. There are three: the main network on which people trade goods
+ * and services, the public test network which gets reset from time to time and
+ * a regression test mode which is intended for private networks only. It has
+ * minimal difficulty to ensure that blocks can be found instantly.
+ */
+class CChainParams: public KeyConstants
+{
+public:
+    const Consensus::Params& GetConsensus() const { return consensus; }
+    const CMessageHeader::MessageStartChars& MessageStart() const { return pchMessageStart; }
+    const std::vector<unsigned char>& AlertKey() const { return vAlertPubKey; }
+    int GetDefaultPort() const { return nDefaultPort; }
+
+    CAmount SproutValuePoolCheckpointHeight() const { return nSproutValuePoolCheckpointHeight; }
+    CAmount SproutValuePoolCheckpointBalance() const { return nSproutValuePoolCheckpointBalance; }
+    uint256 SproutValuePoolCheckpointBlockHash() const { return hashSproutValuePoolCheckpointBlock; }
+    bool ZIP209Enabled() const { return fZIP209Enabled; }
+    bool RequireWalletBackup() const { return fRequireWalletBackup; }
+
+    const CBlock& GenesisBlock() const { return genesis; }
+    /** Make miner wait to have peers to avoid wasting work */
+    bool MiningRequiresPeers() const { return fMiningRequiresPeers; }
+    /** Default value for -checkmempool and -checkblockindex argument */
+    bool DefaultConsistencyChecks() const { return fDefaultConsistencyChecks; }
+    /** Policy: Filter transactions that do not match well-defined patterns */
+    bool RequireStandard() const { return fRequireStandard; }
+    int64_t PruneAfterHeight() const { return nPruneAfterHeight; }
+    std::string CurrencyUnits() const { return strCurrencyUnits; }
+    /** Make miner stop after a block is found. In RPC, don't return until nGenProcLimit blocks are generated */
+    bool MineBlocksOnDemand() const { return fMineBlocksOnDemand; }
+    /** In the future use NetworkIDString() for RPC fields */
+    bool TestnetToBeDeprecatedFieldRPC() const { return fTestnetToBeDeprecatedFieldRPC; }
+    const std::vector<CDNSSeedData>& DNSSeeds() const { return vSeeds; }
+    /** Return the BIP70 network string (main, test or regtest) */
+    std::string NetworkIDString() const {
+        return keyConstants.NetworkIDString();
+    }
+    /** Return the BIP44 coin type for addresses created by the zcashd embedded wallet. */
+    uint32_t BIP44CoinType() const {
+        return keyConstants.BIP44CoinType();
+    }
+    const std::vector<unsigned char>& Base58Prefix(Base58Type type) const {
+        return keyConstants.Base58Prefix(type);
+    }
+    const std::string& Bech32HRP(Bech32Type type) const {
+        return keyConstants.Bech32HRP(type);
+    }
+    const std::vector<SeedSpec6>& FixedSeeds() const { return vFixedSeeds; }
+    const CCheckpointData& Checkpoints() const { return checkpointData; }
+    /** Return the founder's reward address and script for a given block height */
+    std::string GetFoundersRewardAddressAtHeight(int height) const;
+    CScript GetFoundersRewardScriptAtHeight(int height) const;
+    std::string GetFoundersRewardAddressAtIndex(int i) const;
+    /** Enforce coinbase consensus rule in regtest mode */
+    void SetRegTestCoinbaseMustBeShielded() { consensus.fCoinbaseMustBeShielded = true; }
+protected:
+    CChainParams() {}
+
+    Consensus::Params consensus;
+    CMessageHeader::MessageStartChars pchMessageStart;
+    //! Raw pub key bytes for the broadcast alert signing key.
+    std::vector<unsigned char> vAlertPubKey;
+    int nDefaultPort = 0;
+    uint64_t nPruneAfterHeight = 0;
+    std::vector<CDNSSeedData> vSeeds;
+    CBaseKeyConstants keyConstants;
+    std::string strCurrencyUnits;
+    CBlock genesis;
+    std::vector<SeedSpec6> vFixedSeeds;
+    bool fMiningRequiresPeers = false;
+    bool fDefaultConsistencyChecks = false;
+    bool fRequireStandard = false;
+    bool fMineBlocksOnDemand = false;
+    bool fTestnetToBeDeprecatedFieldRPC = false;
+    CCheckpointData checkpointData;
+    std::vector<std::string> vFoundersRewardAddress;
+
+    CAmount nSproutValuePoolCheckpointHeight = 0;
+    CAmount nSproutValuePoolCheckpointBalance = 0;
+    uint256 hashSproutValuePoolCheckpointBlock;
+    bool fZIP209Enabled = false;
+    bool fRequireWalletBackup = true;
+};
+
+/**
+ * Return the currently selected parameters. This won't change after app
+ * startup, except for unit tests.
+ */
+const CChainParams &Params();
+
+/**
+ * @returns CChainParams for the given BIP70 chain name.
+ */
+CChainParams& Params(const std::string& chain);
+
+/**
+ * Sets the params returned by Params() to those for the given BIP70 chain name.
+ * @throws std::runtime_error when the chain is not supported.
+ */
+void SelectParams(const std::string& chain);
+
+/**
+ * Allows modifying the network upgrade regtest parameters.
+ */
+void UpdateNetworkUpgradeParameters(Consensus::UpgradeIndex idx, int nActivationHeight);
+
+void UpdateRegtestPow(
+    int64_t nPowMaxAdjustDown,
+    int64_t nPowMaxAdjustUp,
+    uint256 powLimit,
+    bool noRetargeting);
+
+/**
+ * Allows modifying the regtest funding stream parameters.
+ */
+void UpdateFundingStreamParameters(Consensus::FundingStreamIndex idx, Consensus::FundingStream fs);
+
+#endif // BITCOIN_CHAINPARAMS_H
diff --git a/depend/zcash/src/chainparamsbase.cpp b/depend/zcash/src/chainparamsbase.cpp
new file mode 100644
index 000000000..7f1860c65
--- /dev/null
+++ b/depend/zcash/src/chainparamsbase.cpp
@@ -0,0 +1,118 @@
+// Copyright (c) 2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "chainparamsbase.h"
+
+#include "tinyformat.h"
+#include "util.h"
+
+#include <assert.h>
+
+const std::string CBaseChainParams::MAIN = "main";
+const std::string CBaseChainParams::TESTNET = "test";
+const std::string CBaseChainParams::REGTEST = "regtest";
+
+void AppendParamsHelpMessages(std::string& strUsage, bool debugHelp)
+{
+    strUsage += HelpMessageGroup(_("Chain selection options:"));
+    strUsage += HelpMessageOpt("-testnet", _("Use the test chain"));
+    if (debugHelp) {
+        strUsage += HelpMessageOpt("-regtest", "Enter regression test mode, which uses a special chain in which blocks can be solved instantly. "
+                                   "This is intended for regression testing tools and app development.");
+    }
+}
+
+/**
+ * Main network
+ */
+class CBaseMainParams : public CBaseChainParams
+{
+public:
+    CBaseMainParams()
+    {
+        nRPCPort = 8232;
+    }
+};
+static CBaseMainParams mainParams;
+
+/**
+ * Testnet (v3)
+ */
+class CBaseTestNetParams : public CBaseChainParams
+{
+public:
+    CBaseTestNetParams()
+    {
+        nRPCPort = 18232;
+        strDataDir = "testnet3";
+    }
+};
+static CBaseTestNetParams testNetParams;
+
+/*
+ * Regression test
+ */
+class CBaseRegTestParams : public CBaseChainParams
+{
+public:
+    CBaseRegTestParams()
+    {
+        nRPCPort = 18232;
+        strDataDir = "regtest";
+    }
+};
+static CBaseRegTestParams regTestParams;
+
+/*
+ * Unit test
+ */
+class CBaseUnitTestParams : public CBaseMainParams
+{
+public:
+    CBaseUnitTestParams()
+    {
+        strDataDir = "unittest";
+    }
+};
+static CBaseUnitTestParams unitTestParams;
+
+static CBaseChainParams* pCurrentBaseParams = 0;
+
+const CBaseChainParams& BaseParams()
+{
+    assert(pCurrentBaseParams);
+    return *pCurrentBaseParams;
+}
+
+void SelectBaseParams(const std::string& chain)
+{
+    if (chain == CBaseChainParams::MAIN)
+        pCurrentBaseParams = &mainParams;
+    else if (chain == CBaseChainParams::TESTNET)
+        pCurrentBaseParams = &testNetParams;
+    else if (chain == CBaseChainParams::REGTEST)
+        pCurrentBaseParams = &regTestParams;
+    else
+        throw std::runtime_error(strprintf("%s: Unknown chain %s.", __func__, chain));
+}
+
+std::string ChainNameFromCommandLine()
+{
+    bool fRegTest = GetBoolArg("-regtest", false);
+    bool fTestNet = GetBoolArg("-testnet", false);
+
+    if (fTestNet && fRegTest)
+        throw std::runtime_error("Invalid combination of -regtest and -testnet.");
+    if (fRegTest)
+        return CBaseChainParams::REGTEST;
+    if (fTestNet)
+        return CBaseChainParams::TESTNET;
+    return CBaseChainParams::MAIN;
+}
+
+bool AreBaseParamsConfigured()
+{
+    return pCurrentBaseParams != NULL;
+}
diff --git a/depend/zcash/src/chainparamsbase.h b/depend/zcash/src/chainparamsbase.h
new file mode 100644
index 000000000..5d2526fca
--- /dev/null
+++ b/depend/zcash/src/chainparamsbase.h
@@ -0,0 +1,60 @@
+// Copyright (c) 2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_CHAINPARAMSBASE_H
+#define BITCOIN_CHAINPARAMSBASE_H
+
+#include <string>
+#include <vector>
+
+/**
+ * CBaseChainParams defines the base parameters (shared between bitcoin-cli and bitcoind)
+ * of a given instance of the Bitcoin system.
+ */
+class CBaseChainParams
+{
+public:
+    /** BIP70 chain name strings (main, test or regtest) */
+    static const std::string MAIN;
+    static const std::string TESTNET;
+    static const std::string REGTEST;
+
+    const std::string& DataDir() const { return strDataDir; }
+    int RPCPort() const { return nRPCPort; }
+
+protected:
+    CBaseChainParams() {}
+
+    int nRPCPort = 0;
+    std::string strDataDir;
+};
+
+/**
+ * Append the help messages for the chainparams options to the
+ * parameter string.
+ */
+void AppendParamsHelpMessages(std::string& strUsage, bool debugHelp=true);
+
+/**
+ * Return the currently selected parameters. This won't change after app
+ * startup, except for unit tests.
+ */
+const CBaseChainParams& BaseParams();
+
+/** Sets the params returned by Params() to those for the given network. */
+void SelectBaseParams(const std::string& chain);
+
+/**
+ * Looks for -regtest, -testnet and returns the appropriate BIP70 chain name.
+ * @return CBaseChainParams::MAX_NETWORK_TYPES if an invalid combination is given. CBaseChainParams::MAIN by default.
+ */
+std::string ChainNameFromCommandLine();
+
+/**
+ * Return true if SelectBaseParamsFromCommandLine() has been called to select
+ * a network.
+ */
+bool AreBaseParamsConfigured();
+
+#endif // BITCOIN_CHAINPARAMSBASE_H
diff --git a/depend/zcash/src/chainparamsseeds.h b/depend/zcash/src/chainparamsseeds.h
new file mode 100644
index 000000000..1139441fd
--- /dev/null
+++ b/depend/zcash/src/chainparamsseeds.h
@@ -0,0 +1,15 @@
+#ifndef BITCOIN_CHAINPARAMSSEEDS_H
+#define BITCOIN_CHAINPARAMSSEEDS_H
+/**
+ * List of fixed seed nodes for the bitcoin network
+ * AUTOGENERATED by contrib/seeds/generate-seeds.py
+ *
+ * Each line contains a 16-byte IPv6 address and a port.
+ * IPv4 as well as onion addresses are wrapped inside a IPv6 address accordingly.
+ */
+static SeedSpec6 pnSeed6_main[] = {
+};
+
+static SeedSpec6 pnSeed6_test[] = {
+};
+#endif // BITCOIN_CHAINPARAMSSEEDS_H
diff --git a/depend/zcash/src/checkpoints.cpp b/depend/zcash/src/checkpoints.cpp
new file mode 100644
index 000000000..1d3f1fabb
--- /dev/null
+++ b/depend/zcash/src/checkpoints.cpp
@@ -0,0 +1,89 @@
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "checkpoints.h"
+
+#include "chainparams.h"
+#include "main.h"
+#include "reverse_iterator.h"
+#include "uint256.h"
+
+#include <stdint.h>
+
+
+namespace Checkpoints {
+
+    /**
+     * How many times slower we expect checking transactions after the last
+     * checkpoint to be (from checking signatures, which is skipped up to the
+     * last checkpoint). This number is a compromise, as it can't be accurate
+     * for every system. When reindexing from a fast disk with a slow CPU, it
+     * can be up to 20, while when downloading from a slow network with a
+     * fast multicore CPU, it won't be much higher than 1.
+     */
+    static const double SIGCHECK_VERIFICATION_FACTOR = 5.0;
+
+    //! Guess how far we are in the verification process at the given block index
+    double GuessVerificationProgress(const CCheckpointData& data, CBlockIndex *pindex, bool fSigchecks) {
+        if (pindex==NULL)
+            return 0.0;
+
+        int64_t nNow = time(NULL);
+
+        double fSigcheckVerificationFactor = fSigchecks ? SIGCHECK_VERIFICATION_FACTOR : 1.0;
+        double fWorkBefore = 0.0; // Amount of work done before pindex
+        double fWorkAfter = 0.0;  // Amount of work left after pindex (estimated)
+        // Work is defined as: 1.0 per transaction before the last checkpoint, and
+        // fSigcheckVerificationFactor per transaction after.
+
+        if (pindex->nChainTx <= data.nTransactionsLastCheckpoint) {
+            double nCheapBefore = pindex->nChainTx;
+            double nCheapAfter = data.nTransactionsLastCheckpoint - pindex->nChainTx;
+            double nExpensiveAfter = (nNow - data.nTimeLastCheckpoint)/86400.0*data.fTransactionsPerDay;
+            fWorkBefore = nCheapBefore;
+            fWorkAfter = nCheapAfter + nExpensiveAfter*fSigcheckVerificationFactor;
+        } else {
+            double nCheapBefore = data.nTransactionsLastCheckpoint;
+            double nExpensiveBefore = pindex->nChainTx - data.nTransactionsLastCheckpoint;
+            double nExpensiveAfter = (nNow - pindex->GetBlockTime())/86400.0*data.fTransactionsPerDay;
+            fWorkBefore = nCheapBefore + nExpensiveBefore*fSigcheckVerificationFactor;
+            fWorkAfter = nExpensiveAfter*fSigcheckVerificationFactor;
+        }
+
+        return std::min(fWorkBefore / (fWorkBefore + fWorkAfter), 1.0);
+    }
+
+    int GetTotalBlocksEstimate(const CCheckpointData& data)
+    {
+        const MapCheckpoints& checkpoints = data.mapCheckpoints;
+
+        if (checkpoints.empty())
+            return 0;
+
+        return checkpoints.rbegin()->first;
+    }
+
+    CBlockIndex* GetLastCheckpoint(const CCheckpointData& data)
+    {
+        const MapCheckpoints& checkpoints = data.mapCheckpoints;
+
+        for (const MapCheckpoints::value_type& i : reverse_iterate(checkpoints))
+        {
+            const uint256& hash = i.second;
+            BlockMap::const_iterator t = mapBlockIndex.find(hash);
+            if (t != mapBlockIndex.end())
+                return t->second;
+        }
+        return NULL;
+    }
+
+    bool IsAncestorOfLastCheckpoint(const CCheckpointData& data, const CBlockIndex* pindex)
+    {
+        CBlockIndex *pindexLastCheckpoint = GetLastCheckpoint(data);
+        return pindexLastCheckpoint && pindexLastCheckpoint->GetAncestor(pindex->nHeight) == pindex;
+    }
+
+
+
+} // namespace Checkpoints
diff --git a/depend/zcash/src/checkpoints.h b/depend/zcash/src/checkpoints.h
new file mode 100644
index 000000000..b62b43280
--- /dev/null
+++ b/depend/zcash/src/checkpoints.h
@@ -0,0 +1,33 @@
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_CHECKPOINTS_H
+#define BITCOIN_CHECKPOINTS_H
+
+#include "uint256.h"
+
+#include <map>
+
+class CBlockIndex;
+struct CCheckpointData;
+
+/**
+ * Block-chain checkpoints are compiled-in sanity checks.
+ * They are updated every release or three.
+ */
+namespace Checkpoints
+{
+
+//! Return conservative estimate of total number of blocks, 0 if unknown
+int GetTotalBlocksEstimate(const CCheckpointData& data);
+
+//! Returns last CBlockIndex* in mapBlockIndex that is a checkpoint
+CBlockIndex* GetLastCheckpoint(const CCheckpointData& data);
+
+double GuessVerificationProgress(const CCheckpointData& data, CBlockIndex* pindex, bool fSigchecks = true);
+
+bool IsAncestorOfLastCheckpoint(const CCheckpointData& data, const CBlockIndex* pindex);
+} //namespace Checkpoints
+
+#endif // BITCOIN_CHECKPOINTS_H
diff --git a/depend/zcash/src/checkqueue.h b/depend/zcash/src/checkqueue.h
new file mode 100644
index 000000000..d6476e8ca
--- /dev/null
+++ b/depend/zcash/src/checkqueue.h
@@ -0,0 +1,218 @@
+// Copyright (c) 2012-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_CHECKQUEUE_H
+#define BITCOIN_CHECKQUEUE_H
+
+#include <algorithm>
+#include <vector>
+
+#include <boost/thread/condition_variable.hpp>
+#include <boost/thread/locks.hpp>
+#include <boost/thread/mutex.hpp>
+
+#include "sync.h"
+
+template <typename T>
+class CCheckQueueControl;
+
+/** 
+ * Queue for verifications that have to be performed.
+  * The verifications are represented by a type T, which must provide an
+  * operator(), returning a bool.
+  *
+  * One thread (the master) is assumed to push batches of verifications
+  * onto the queue, where they are processed by N-1 worker threads. When
+  * the master is done adding work, it temporarily joins the worker pool
+  * as an N'th worker, until all jobs are done.
+  */
+template <typename T>
+class CCheckQueue
+{
+private:
+    //! Mutex to protect the inner state
+    boost::mutex mutex;
+
+    //! Worker threads block on this when out of work
+    boost::condition_variable condWorker;
+
+    //! Master thread blocks on this when out of work
+    boost::condition_variable condMaster;
+
+    //! The queue of elements to be processed.
+    //! As the order of booleans doesn't matter, it is used as a LIFO (stack)
+    std::vector<T> queue;
+
+    //! The number of workers (including the master) that are idle.
+    int nIdle;
+
+    //! The total number of workers (including the master).
+    int nTotal;
+
+    //! The temporary evaluation result.
+    bool fAllOk;
+
+    /**
+     * Number of verifications that haven't completed yet.
+     * This includes elements that are no longer queued, but still in the
+     * worker's own batches.
+     */
+    unsigned int nTodo;
+
+    //! Whether we're shutting down.
+    bool fQuit;
+
+    //! The maximum number of elements to be processed in one batch
+    unsigned int nBatchSize;
+
+    /** Internal function that does bulk of the verification work. */
+    bool Loop(bool fMaster = false)
+    {
+        boost::condition_variable& cond = fMaster ? condMaster : condWorker;
+        std::vector<T> vChecks;
+        vChecks.reserve(nBatchSize);
+        unsigned int nNow = 0;
+        bool fOk = true;
+        do {
+            {
+                boost::unique_lock<boost::mutex> lock(mutex);
+                // first do the clean-up of the previous loop run (allowing us to do it in the same critsect)
+                if (nNow) {
+                    fAllOk &= fOk;
+                    nTodo -= nNow;
+                    if (nTodo == 0 && !fMaster)
+                        // We processed the last element; inform the master it can exit and return the result
+                        condMaster.notify_one();
+                } else {
+                    // first iteration
+                    nTotal++;
+                }
+                // logically, the do loop starts here
+                while (queue.empty()) {
+                    if ((fMaster || fQuit) && nTodo == 0) {
+                        nTotal--;
+                        bool fRet = fAllOk;
+                        // reset the status for new work later
+                        if (fMaster)
+                            fAllOk = true;
+                        // return the current status
+                        return fRet;
+                    }
+                    nIdle++;
+                    cond.wait(lock); // wait
+                    nIdle--;
+                }
+                // Decide how many work units to process now.
+                // * Do not try to do everything at once, but aim for increasingly smaller batches so
+                //   all workers finish approximately simultaneously.
+                // * Try to account for idle jobs which will instantly start helping.
+                // * Don't do batches smaller than 1 (duh), or larger than nBatchSize.
+                nNow = std::max(1U, std::min(nBatchSize, (unsigned int)queue.size() / (nTotal + nIdle + 1)));
+                vChecks.resize(nNow);
+                for (unsigned int i = 0; i < nNow; i++) {
+                    // We want the lock on the mutex to be as short as possible, so swap jobs from the global
+                    // queue to the local batch vector instead of copying.
+                    vChecks[i].swap(queue.back());
+                    queue.pop_back();
+                }
+                // Check whether we need to do work at all
+                fOk = fAllOk;
+            }
+            // execute work
+            for (T& check : vChecks)
+                if (fOk)
+                    fOk = check();
+            vChecks.clear();
+        } while (true);
+    }
+
+public:
+    //! Mutex to ensure only one concurrent CCheckQueueControl
+    boost::mutex ControlMutex;
+
+    //! Create a new check queue
+    CCheckQueue(unsigned int nBatchSizeIn) : nIdle(0), nTotal(0), fAllOk(true), nTodo(0), fQuit(false), nBatchSize(nBatchSizeIn) {}
+
+    //! Worker thread
+    void Thread()
+    {
+        Loop();
+    }
+
+    //! Wait until execution finishes, and return whether all evaluations were successful.
+    bool Wait()
+    {
+        return Loop(true);
+    }
+
+    //! Add a batch of checks to the queue
+    void Add(std::vector<T>& vChecks)
+    {
+        boost::unique_lock<boost::mutex> lock(mutex);
+        for (T& check : vChecks) {
+            queue.push_back(T());
+            check.swap(queue.back());
+        }
+        nTodo += vChecks.size();
+        if (vChecks.size() == 1)
+            condWorker.notify_one();
+        else if (vChecks.size() > 1)
+            condWorker.notify_all();
+    }
+
+    ~CCheckQueue()
+    {
+    }
+
+};
+
+/** 
+ * RAII-style controller object for a CCheckQueue that guarantees the passed
+ * queue is finished before continuing.
+ */
+template <typename T>
+class CCheckQueueControl
+{
+private:
+    CCheckQueue<T> * const pqueue;
+    bool fDone;
+
+public:
+    CCheckQueueControl() = delete;
+    CCheckQueueControl(const CCheckQueueControl&) = delete;
+    CCheckQueueControl& operator=(const CCheckQueueControl&) = delete;
+    explicit CCheckQueueControl(CCheckQueue<T> * const pqueueIn) : pqueue(pqueueIn), fDone(false)
+    {
+        // passed queue is supposed to be unused, or NULL
+        if (pqueue != NULL) {
+            ENTER_CRITICAL_SECTION(pqueue->ControlMutex);
+        }
+    }
+
+    bool Wait()
+    {
+        if (pqueue == NULL)
+            return true;
+        bool fRet = pqueue->Wait();
+        fDone = true;
+        return fRet;
+    }
+
+    void Add(std::vector<T>& vChecks)
+    {
+        if (pqueue != NULL)
+            pqueue->Add(vChecks);
+    }
+
+    ~CCheckQueueControl()
+    {
+        if (!fDone)
+            Wait();
+        if (pqueue != NULL) {
+            LEAVE_CRITICAL_SECTION(pqueue->ControlMutex);
+        }
+    }
+};
+
+#endif // BITCOIN_CHECKQUEUE_H
diff --git a/depend/zcash/src/clientversion.cpp b/depend/zcash/src/clientversion.cpp
new file mode 100644
index 000000000..ef8961ea5
--- /dev/null
+++ b/depend/zcash/src/clientversion.cpp
@@ -0,0 +1,138 @@
+// Copyright (c) 2012-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "clientversion.h"
+
+#include "tinyformat.h"
+
+#include <string>
+
+#include <boost/preprocessor/arithmetic/add.hpp>
+#include <boost/preprocessor/arithmetic/sub.hpp>
+#include <boost/preprocessor/comparison/equal.hpp>
+#include <boost/preprocessor/comparison/less.hpp>
+#include <boost/preprocessor/control/if.hpp>
+
+/**
+ * Name of client reported in the 'version' message. Report the same name
+ * for both bitcoind and bitcoin-core, to make it harder for attackers to
+ * target servers or GUI users specifically.
+ */
+const std::string CLIENT_NAME("MagicBean");
+
+/**
+ * Client version number
+ */
+#define CLIENT_VERSION_SUFFIX ""
+
+
+/**
+ * The following part of the code determines the CLIENT_BUILD variable.
+ * Several mechanisms are used for this:
+ * * first, if HAVE_BUILD_INFO is defined, include build.h, a file that is
+ *   generated by the build environment, possibly containing the output
+ *   of git-describe in a macro called BUILD_DESC
+ * * secondly, if this is an exported version of the code, GIT_ARCHIVE will
+ *   be defined (automatically using the export-subst git attribute), and
+ *   GIT_COMMIT will contain the commit id.
+ * * then, three options exist for determining CLIENT_BUILD:
+ *   * if BUILD_DESC is defined, use that literally (output of git-describe)
+ *   * if not, but GIT_COMMIT is defined, use v[maj].[min].[rev].[build]-g[commit]
+ *   * otherwise, use v[maj].[min].[rev].[build]-unk
+ * finally CLIENT_VERSION_SUFFIX is added
+ */
+
+//! First, include build.h if requested
+#ifdef HAVE_BUILD_INFO
+#include "build.h"
+#endif
+
+//! git will put "#define GIT_ARCHIVE 1" on the next line inside archives. $Format:%n#define GIT_ARCHIVE 1$
+#ifdef GIT_ARCHIVE
+#define GIT_COMMIT_ID "$Format:%h$"
+#define GIT_COMMIT_DATE "$Format:%cD$"
+#endif
+
+#define RENDER_BETA_STRING(num) "-beta" DO_STRINGIZE(num)
+#define RENDER_RC_STRING(num) "-rc" DO_STRINGIZE(num)
+#define RENDER_DEV_STRING(num) "-" DO_STRINGIZE(num)
+
+#define RENDER_BUILD(build) \
+    BOOST_PP_IF( \
+        BOOST_PP_LESS(build, 25), \
+        RENDER_BETA_STRING(BOOST_PP_ADD(build, 1)), \
+        BOOST_PP_IF( \
+            BOOST_PP_LESS(build, 50), \
+            RENDER_RC_STRING(BOOST_PP_SUB(build, 24)), \
+            BOOST_PP_IF( \
+                BOOST_PP_EQUAL(build, 50), \
+                "", \
+                RENDER_DEV_STRING(BOOST_PP_SUB(build, 50)))))
+
+#define BUILD_DESC_WITH_SUFFIX(maj, min, rev, build, suffix) \
+    "v" DO_STRINGIZE(maj) "." DO_STRINGIZE(min) "." DO_STRINGIZE(rev) RENDER_BUILD(build) "-" DO_STRINGIZE(suffix)
+
+#define BUILD_DESC_FROM_COMMIT(maj, min, rev, build, commit) \
+    "v" DO_STRINGIZE(maj) "." DO_STRINGIZE(min) "." DO_STRINGIZE(rev) RENDER_BUILD(build) "-g" commit
+
+#define BUILD_DESC_FROM_UNKNOWN(maj, min, rev, build) \
+    "v" DO_STRINGIZE(maj) "." DO_STRINGIZE(min) "." DO_STRINGIZE(rev) RENDER_BUILD(build) "-unk"
+
+#ifndef BUILD_DESC
+#ifdef BUILD_SUFFIX
+#define BUILD_DESC BUILD_DESC_WITH_SUFFIX(CLIENT_VERSION_MAJOR, CLIENT_VERSION_MINOR, CLIENT_VERSION_REVISION, CLIENT_VERSION_BUILD, BUILD_SUFFIX)
+#elif defined(GIT_COMMIT_ID)
+#define BUILD_DESC BUILD_DESC_FROM_COMMIT(CLIENT_VERSION_MAJOR, CLIENT_VERSION_MINOR, CLIENT_VERSION_REVISION, CLIENT_VERSION_BUILD, GIT_COMMIT_ID)
+#else
+#define BUILD_DESC BUILD_DESC_FROM_UNKNOWN(CLIENT_VERSION_MAJOR, CLIENT_VERSION_MINOR, CLIENT_VERSION_REVISION, CLIENT_VERSION_BUILD)
+#endif
+#endif
+
+#ifndef BUILD_DATE
+#ifdef GIT_COMMIT_DATE
+#define BUILD_DATE GIT_COMMIT_DATE
+#else
+#define BUILD_DATE __DATE__ ", " __TIME__
+#endif
+#endif
+
+const std::string CLIENT_BUILD(BUILD_DESC CLIENT_VERSION_SUFFIX);
+const std::string CLIENT_DATE(BUILD_DATE);
+
+std::string FormatVersion(int nVersion)
+{
+    if (nVersion % 100 < 25)
+        return strprintf("%d.%d.%d-beta%d", nVersion / 1000000, (nVersion / 10000) % 100, (nVersion / 100) % 100, (nVersion % 100)+1);
+    if (nVersion % 100 < 50)
+        return strprintf("%d.%d.%d-rc%d", nVersion / 1000000, (nVersion / 10000) % 100, (nVersion / 100) % 100, (nVersion % 100)-24);
+    else if (nVersion % 100 == 50)
+        return strprintf("%d.%d.%d", nVersion / 1000000, (nVersion / 10000) % 100, (nVersion / 100) % 100);
+    else
+        return strprintf("%d.%d.%d-%d", nVersion / 1000000, (nVersion / 10000) % 100, (nVersion / 100) % 100, (nVersion % 100)-50);
+}
+
+std::string FormatFullVersion()
+{
+    return CLIENT_BUILD;
+}
+
+/** 
+ * Format the subversion field according to BIP 14 spec (https://github.com/bitcoin/bips/blob/master/bip-0014.mediawiki) 
+ */
+std::string FormatSubVersion(const std::string& name, int nClientVersion, const std::vector<std::string>& comments)
+{
+    std::ostringstream ss;
+    ss << "/";
+    ss << name << ":" << FormatVersion(nClientVersion);
+    if (!comments.empty())
+    {
+        std::vector<std::string>::const_iterator it(comments.begin());
+        ss << "(" << *it;
+        for(++it; it != comments.end(); ++it)
+            ss << "; " << *it;
+        ss << ")";
+    }
+    ss << "/";
+    return ss.str();
+}
diff --git a/depend/zcash/src/clientversion.h b/depend/zcash/src/clientversion.h
new file mode 100644
index 000000000..8c436b625
--- /dev/null
+++ b/depend/zcash/src/clientversion.h
@@ -0,0 +1,72 @@
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Copyright (c) 2016-2022 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_CLIENTVERSION_H
+#define BITCOIN_CLIENTVERSION_H
+
+#if defined(HAVE_CONFIG_H)
+#include "config/bitcoin-config.h"
+#else
+
+/**
+ * client versioning and copyright year
+ */
+
+//! These need to be macros, as clientversion.cpp's and bitcoin*-res.rc's voodoo requires it
+#define CLIENT_VERSION_MAJOR 5
+#define CLIENT_VERSION_MINOR 0
+#define CLIENT_VERSION_REVISION 0
+#define CLIENT_VERSION_BUILD 50
+
+//! Set to true for release, false for prerelease or test build
+#define CLIENT_VERSION_IS_RELEASE true
+
+/**
+ * Copyright year (2009-this)
+ * Todo: update this when changing our copyright comments in the source
+ */
+#define COPYRIGHT_YEAR 2022
+
+#endif //HAVE_CONFIG_H
+
+/**
+ * Converts the parameter X to a string after macro replacement on X has been performed.
+ * Don't merge these into one macro!
+ */
+#define STRINGIZE(X) DO_STRINGIZE(X)
+#define DO_STRINGIZE(X) #X
+
+//! Copyright string used in Windows .rc files
+#define COPYRIGHT_STR "2009-" STRINGIZE(COPYRIGHT_YEAR) " The Bitcoin Core Developers and The Zcash developers"
+
+/**
+ * bitcoind-res.rc includes this file, but it cannot cope with real c++ code.
+ * WINDRES_PREPROC is defined to indicate that its pre-processor is running.
+ * Anything other than a define should be guarded below.
+ */
+
+#if !defined(WINDRES_PREPROC)
+
+#include <string>
+#include <vector>
+
+static const int CLIENT_VERSION =
+                           1000000 * CLIENT_VERSION_MAJOR
+                         +   10000 * CLIENT_VERSION_MINOR
+                         +     100 * CLIENT_VERSION_REVISION
+                         +       1 * CLIENT_VERSION_BUILD;
+
+extern const std::string CLIENT_NAME;
+extern const std::string CLIENT_BUILD;
+extern const std::string CLIENT_DATE;
+
+
+std::string FormatVersion(int nVersion);
+std::string FormatFullVersion();
+std::string FormatSubVersion(const std::string& name, int nClientVersion, const std::vector<std::string>& comments);
+
+#endif // WINDRES_PREPROC
+
+#endif // BITCOIN_CLIENTVERSION_H
diff --git a/depend/zcash/src/coincontrol.h b/depend/zcash/src/coincontrol.h
new file mode 100644
index 000000000..1adc84757
--- /dev/null
+++ b/depend/zcash/src/coincontrol.h
@@ -0,0 +1,68 @@
+// Copyright (c) 2011-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_COINCONTROL_H
+#define BITCOIN_COINCONTROL_H
+
+#include "primitives/transaction.h"
+
+/** Coin Control Features. */
+class CCoinControl
+{
+public:
+    CTxDestination destChange;
+    //! If false, allows unselected inputs, but requires all selected inputs be used
+    bool fAllowOtherInputs;
+    //! Includes watch only addresses which match the ISMINE_WATCH_SOLVABLE criteria
+    bool fAllowWatchOnly;
+
+    CCoinControl()
+    {
+        SetNull();
+    }
+
+    void SetNull()
+    {
+        destChange = CNoDestination();
+        fAllowOtherInputs = false;
+        fAllowWatchOnly = false;
+        setSelected.clear();
+    }
+
+    bool HasSelected() const
+    {
+        return (setSelected.size() > 0);
+    }
+
+    bool IsSelected(const uint256& hash, unsigned int n) const
+    {
+        COutPoint outpt(hash, n);
+        return (setSelected.count(outpt) > 0);
+    }
+
+    void Select(const COutPoint& output)
+    {
+        setSelected.insert(output);
+    }
+
+    void UnSelect(const COutPoint& output)
+    {
+        setSelected.erase(output);
+    }
+
+    void UnSelectAll()
+    {
+        setSelected.clear();
+    }
+
+    void ListSelected(std::vector<COutPoint>& vOutpoints) const
+    {
+        vOutpoints.assign(setSelected.begin(), setSelected.end());
+    }
+
+private:
+    std::set<COutPoint> setSelected;
+};
+
+#endif // BITCOIN_COINCONTROL_H
diff --git a/depend/zcash/src/coins.cpp b/depend/zcash/src/coins.cpp
new file mode 100644
index 000000000..eae717c7b
--- /dev/null
+++ b/depend/zcash/src/coins.cpp
@@ -0,0 +1,1158 @@
+// Copyright (c) 2012-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "coins.h"
+
+#include "memusage.h"
+#include "random.h"
+#include "version.h"
+#include "policy/fees.h"
+
+#include <assert.h>
+
+#include <tracing.h>
+
+/**
+ * calculate number of bytes for the bitmask, and its number of non-zero bytes
+ * each bit in the bitmask represents the availability of one output, but the
+ * availabilities of the first two outputs are encoded separately
+ */
+void CCoins::CalcMaskSize(unsigned int &nBytes, unsigned int &nNonzeroBytes) const {
+    unsigned int nLastUsedByte = 0;
+    for (unsigned int b = 0; 2+b*8 < vout.size(); b++) {
+        bool fZero = true;
+        for (unsigned int i = 0; i < 8 && 2+b*8+i < vout.size(); i++) {
+            if (!vout[2+b*8+i].IsNull()) {
+                fZero = false;
+                continue;
+            }
+        }
+        if (!fZero) {
+            nLastUsedByte = b + 1;
+            nNonzeroBytes++;
+        }
+    }
+    nBytes += nLastUsedByte;
+}
+
+bool CCoins::Spend(uint32_t nPos)
+{
+    if (nPos >= vout.size() || vout[nPos].IsNull())
+        return false;
+    vout[nPos].SetNull();
+    Cleanup();
+    return true;
+}
+bool CCoinsView::GetSproutAnchorAt(const uint256 &rt, SproutMerkleTree &tree) const { return false; }
+bool CCoinsView::GetSaplingAnchorAt(const uint256 &rt, SaplingMerkleTree &tree) const { return false; }
+bool CCoinsView::GetOrchardAnchorAt(const uint256 &rt, OrchardMerkleFrontier &tree) const { return false; }
+bool CCoinsView::GetNullifier(const uint256 &nullifier, ShieldedType type) const { return false; }
+bool CCoinsView::GetCoins(const uint256 &txid, CCoins &coins) const { return false; }
+bool CCoinsView::HaveCoins(const uint256 &txid) const { return false; }
+uint256 CCoinsView::GetBestBlock() const { return uint256(); }
+uint256 CCoinsView::GetBestAnchor(ShieldedType type) const { return uint256(); };
+HistoryIndex CCoinsView::GetHistoryLength(uint32_t epochId) const { return 0; }
+HistoryNode CCoinsView::GetHistoryAt(uint32_t epochId, HistoryIndex index) const { return HistoryNode(); }
+uint256 CCoinsView::GetHistoryRoot(uint32_t epochId) const { return uint256(); }
+
+bool CCoinsView::BatchWrite(CCoinsMap &mapCoins,
+                            const uint256 &hashBlock,
+                            const uint256 &hashSproutAnchor,
+                            const uint256 &hashSaplingAnchor,
+                            const uint256 &hashOrchardAnchor,
+                            CAnchorsSproutMap &mapSproutAnchors,
+                            CAnchorsSaplingMap &mapSaplingAnchors,
+                            CAnchorsOrchardMap &mapOrchardAnchors,
+                            CNullifiersMap &mapSproutNullifiers,
+                            CNullifiersMap &mapSaplingNullifiers,
+                            CNullifiersMap &mapOrchardNullifiers,
+                            CHistoryCacheMap &historyCacheMap) { return false; }
+bool CCoinsView::GetStats(CCoinsStats &stats) const { return false; }
+
+
+CCoinsViewBacked::CCoinsViewBacked(CCoinsView *viewIn) : base(viewIn) { }
+
+bool CCoinsViewBacked::GetSproutAnchorAt(const uint256 &rt, SproutMerkleTree &tree) const { return base->GetSproutAnchorAt(rt, tree); }
+bool CCoinsViewBacked::GetSaplingAnchorAt(const uint256 &rt, SaplingMerkleTree &tree) const { return base->GetSaplingAnchorAt(rt, tree); }
+bool CCoinsViewBacked::GetOrchardAnchorAt(const uint256 &rt, OrchardMerkleFrontier &tree) const { return base->GetOrchardAnchorAt(rt, tree); }
+bool CCoinsViewBacked::GetNullifier(const uint256 &nullifier, ShieldedType type) const { return base->GetNullifier(nullifier, type); }
+bool CCoinsViewBacked::GetCoins(const uint256 &txid, CCoins &coins) const { return base->GetCoins(txid, coins); }
+bool CCoinsViewBacked::HaveCoins(const uint256 &txid) const { return base->HaveCoins(txid); }
+uint256 CCoinsViewBacked::GetBestBlock() const { return base->GetBestBlock(); }
+uint256 CCoinsViewBacked::GetBestAnchor(ShieldedType type) const { return base->GetBestAnchor(type); }
+HistoryIndex CCoinsViewBacked::GetHistoryLength(uint32_t epochId) const { return base->GetHistoryLength(epochId); }
+HistoryNode CCoinsViewBacked::GetHistoryAt(uint32_t epochId, HistoryIndex index) const { return base->GetHistoryAt(epochId, index); }
+uint256 CCoinsViewBacked::GetHistoryRoot(uint32_t epochId) const { return base->GetHistoryRoot(epochId); }
+void CCoinsViewBacked::SetBackend(CCoinsView &viewIn) { base = &viewIn; }
+bool CCoinsViewBacked::BatchWrite(CCoinsMap &mapCoins,
+                                  const uint256 &hashBlock,
+                                  const uint256 &hashSproutAnchor,
+                                  const uint256 &hashSaplingAnchor,
+                                  const uint256 &hashOrchardAnchor,
+                                  CAnchorsSproutMap &mapSproutAnchors,
+                                  CAnchorsSaplingMap &mapSaplingAnchors,
+                                  CAnchorsOrchardMap &mapOrchardAnchors,
+                                  CNullifiersMap &mapSproutNullifiers,
+                                  CNullifiersMap &mapSaplingNullifiers,
+                                  CNullifiersMap &mapOrchardNullifiers,
+                                  CHistoryCacheMap &historyCacheMap) {
+    return base->BatchWrite(mapCoins, hashBlock,
+                            hashSproutAnchor, hashSaplingAnchor, hashOrchardAnchor,
+                            mapSproutAnchors, mapSaplingAnchors, mapOrchardAnchors,
+                            mapSproutNullifiers, mapSaplingNullifiers, mapOrchardNullifiers,
+                            historyCacheMap);
+}
+bool CCoinsViewBacked::GetStats(CCoinsStats &stats) const { return base->GetStats(stats); }
+
+SaltedTxidHasher::SaltedTxidHasher() : k0(GetRand(std::numeric_limits<uint64_t>::max())), k1(GetRand(std::numeric_limits<uint64_t>::max())) {}
+
+CCoinsViewCache::CCoinsViewCache(CCoinsView *baseIn) : CCoinsViewBacked(baseIn), hasModifier(false), cachedCoinsUsage(0) { }
+
+CCoinsViewCache::~CCoinsViewCache()
+{
+    assert(!hasModifier);
+}
+
+size_t CCoinsViewCache::DynamicMemoryUsage() const {
+    return memusage::DynamicUsage(cacheCoins) +
+           memusage::DynamicUsage(cacheSproutAnchors) +
+           memusage::DynamicUsage(cacheSaplingAnchors) +
+           memusage::DynamicUsage(cacheOrchardAnchors) +
+           memusage::DynamicUsage(cacheSproutNullifiers) +
+           memusage::DynamicUsage(cacheSaplingNullifiers) +
+           memusage::DynamicUsage(cacheOrchardNullifiers) +
+           memusage::DynamicUsage(historyCacheMap) +
+           cachedCoinsUsage;
+}
+
+CCoinsMap::const_iterator CCoinsViewCache::FetchCoins(const uint256 &txid) const {
+    CCoinsMap::iterator it = cacheCoins.find(txid);
+    if (it != cacheCoins.end())
+        return it;
+    CCoins tmp;
+    if (!base->GetCoins(txid, tmp))
+        return cacheCoins.end();
+    CCoinsMap::iterator ret = cacheCoins.insert(std::make_pair(txid, CCoinsCacheEntry())).first;
+    tmp.swap(ret->second.coins);
+    if (ret->second.coins.IsPruned()) {
+        // The parent only has an empty entry for this txid; we can consider our
+        // version as fresh.
+        ret->second.flags = CCoinsCacheEntry::FRESH;
+    }
+    cachedCoinsUsage += ret->second.coins.DynamicMemoryUsage();
+    return ret;
+}
+
+
+bool CCoinsViewCache::GetSproutAnchorAt(const uint256 &rt, SproutMerkleTree &tree) const {
+    CAnchorsSproutMap::const_iterator it = cacheSproutAnchors.find(rt);
+    if (it != cacheSproutAnchors.end()) {
+        if (it->second.entered) {
+            tree = it->second.tree;
+            return true;
+        } else {
+            return false;
+        }
+    }
+
+    if (!base->GetSproutAnchorAt(rt, tree)) {
+        return false;
+    }
+
+    CAnchorsSproutMap::iterator ret = cacheSproutAnchors.insert(std::make_pair(rt, CAnchorsSproutCacheEntry())).first;
+    ret->second.entered = true;
+    ret->second.tree = tree;
+    cachedCoinsUsage += ret->second.tree.DynamicMemoryUsage();
+
+    return true;
+}
+
+bool CCoinsViewCache::GetSaplingAnchorAt(const uint256 &rt, SaplingMerkleTree &tree) const {
+    CAnchorsSaplingMap::const_iterator it = cacheSaplingAnchors.find(rt);
+    if (it != cacheSaplingAnchors.end()) {
+        if (it->second.entered) {
+            tree = it->second.tree;
+            return true;
+        } else {
+            return false;
+        }
+    }
+
+    if (!base->GetSaplingAnchorAt(rt, tree)) {
+        return false;
+    }
+
+    CAnchorsSaplingMap::iterator ret = cacheSaplingAnchors.insert(std::make_pair(rt, CAnchorsSaplingCacheEntry())).first;
+    ret->second.entered = true;
+    ret->second.tree = tree;
+    cachedCoinsUsage += ret->second.tree.DynamicMemoryUsage();
+
+    return true;
+}
+
+bool CCoinsViewCache::GetOrchardAnchorAt(const uint256 &rt, OrchardMerkleFrontier &tree) const {
+    CAnchorsOrchardMap::const_iterator it = cacheOrchardAnchors.find(rt);
+    if (it != cacheOrchardAnchors.end()) {
+        if (it->second.entered) {
+            tree = it->second.tree;
+            return true;
+        } else {
+            return false;
+        }
+    }
+
+    if (!base->GetOrchardAnchorAt(rt, tree)) {
+        return false;
+    }
+
+    CAnchorsOrchardMap::iterator ret = cacheOrchardAnchors.insert(std::make_pair(rt, CAnchorsOrchardCacheEntry())).first;
+    ret->second.entered = true;
+    ret->second.tree = tree;
+    cachedCoinsUsage += ret->second.tree.DynamicMemoryUsage();
+
+    return true;
+}
+
+bool CCoinsViewCache::GetNullifier(const uint256 &nullifier, ShieldedType type) const {
+    CNullifiersMap* cacheToUse;
+    switch (type) {
+        case SPROUT:
+            cacheToUse = &cacheSproutNullifiers;
+            break;
+        case SAPLING:
+            cacheToUse = &cacheSaplingNullifiers;
+            break;
+        case ORCHARD:
+            cacheToUse = &cacheOrchardNullifiers;
+            break;
+        default:
+            throw std::runtime_error("Unknown shielded type");
+    }
+    CNullifiersMap::iterator it = cacheToUse->find(nullifier);
+    if (it != cacheToUse->end())
+        return it->second.entered;
+
+    CNullifiersCacheEntry entry;
+    bool tmp = base->GetNullifier(nullifier, type);
+    entry.entered = tmp;
+
+    cacheToUse->insert(std::make_pair(nullifier, entry));
+
+    return tmp;
+}
+
+HistoryIndex CCoinsViewCache::GetHistoryLength(uint32_t epochId) const {
+    HistoryCache& historyCache = SelectHistoryCache(epochId);
+    return historyCache.length;
+}
+
+HistoryNode CCoinsViewCache::GetHistoryAt(uint32_t epochId, HistoryIndex index) const {
+    HistoryCache& historyCache = SelectHistoryCache(epochId);
+
+    if (index >= historyCache.length) {
+        // Caller should ensure that it is limiting history
+        // request to 0..GetHistoryLength(epochId)-1 range
+        throw std::runtime_error("Invalid history request");
+    }
+
+    if (index >= historyCache.updateDepth) {
+        return historyCache.appends[index];
+    }
+
+    return base->GetHistoryAt(epochId, index);
+}
+
+uint256 CCoinsViewCache::GetHistoryRoot(uint32_t epochId) const {
+    return SelectHistoryCache(epochId).root;
+}
+
+template<typename Tree, typename Cache, typename CacheIterator, typename CacheEntry>
+void CCoinsViewCache::AbstractPushAnchor(
+    const Tree &tree,
+    ShieldedType type,
+    Cache &cacheAnchors,
+    uint256 &hash
+)
+{
+    uint256 newrt = tree.root();
+
+    auto currentRoot = GetBestAnchor(type);
+
+    // We don't want to overwrite an anchor we already have.
+    // This occurs when a block doesn't modify mapAnchors at all,
+    // because there are no joinsplits. We could get around this a
+    // different way (make all blocks modify mapAnchors somehow)
+    // but this is simpler to reason about.
+    if (currentRoot != newrt) {
+        auto insertRet = cacheAnchors.insert(std::make_pair(newrt, CacheEntry()));
+        CacheIterator ret = insertRet.first;
+
+        ret->second.entered = true;
+        ret->second.tree = tree;
+        ret->second.flags = CacheEntry::DIRTY;
+
+        if (insertRet.second) {
+            // An insert took place
+            cachedCoinsUsage += ret->second.tree.DynamicMemoryUsage();
+        }
+
+        hash = newrt;
+    }
+}
+
+template<> void CCoinsViewCache::PushAnchor(const SproutMerkleTree &tree)
+{
+    AbstractPushAnchor<SproutMerkleTree, CAnchorsSproutMap, CAnchorsSproutMap::iterator, CAnchorsSproutCacheEntry>(
+        tree,
+        SPROUT,
+        cacheSproutAnchors,
+        hashSproutAnchor
+    );
+}
+
+template<> void CCoinsViewCache::PushAnchor(const SaplingMerkleTree &tree)
+{
+    AbstractPushAnchor<SaplingMerkleTree, CAnchorsSaplingMap, CAnchorsSaplingMap::iterator, CAnchorsSaplingCacheEntry>(
+        tree,
+        SAPLING,
+        cacheSaplingAnchors,
+        hashSaplingAnchor
+    );
+}
+
+template<> void CCoinsViewCache::PushAnchor(const OrchardMerkleFrontier &tree)
+{
+    AbstractPushAnchor<OrchardMerkleFrontier, CAnchorsOrchardMap, CAnchorsOrchardMap::iterator, CAnchorsOrchardCacheEntry>(
+        tree,
+        ORCHARD,
+        cacheOrchardAnchors,
+        hashOrchardAnchor
+    );
+}
+
+template<>
+void CCoinsViewCache::BringBestAnchorIntoCache(
+    const uint256 &currentRoot,
+    SproutMerkleTree &tree
+)
+{
+    assert(GetSproutAnchorAt(currentRoot, tree));
+}
+
+template<>
+void CCoinsViewCache::BringBestAnchorIntoCache(
+    const uint256 &currentRoot,
+    SaplingMerkleTree &tree
+)
+{
+    assert(GetSaplingAnchorAt(currentRoot, tree));
+}
+
+template<>
+void CCoinsViewCache::BringBestAnchorIntoCache(
+    const uint256 &currentRoot,
+    OrchardMerkleFrontier &tree
+)
+{
+    assert(GetOrchardAnchorAt(currentRoot, tree));
+}
+
+void draftMMRNode(std::vector<uint32_t> &indices,
+                  std::vector<HistoryEntry> &entries,
+                  HistoryNode nodeData,
+                  uint32_t alt,
+                  uint32_t peak_pos)
+{
+    HistoryEntry newEntry = alt == 0
+        ? libzcash::LeafToEntry(nodeData)
+        // peak_pos - (1 << alt) is the array position of left child.
+        // peak_pos - 1 is the array position of right child.
+        : libzcash::NodeToEntry(nodeData, peak_pos - (1 << alt), peak_pos - 1);
+
+    indices.push_back(peak_pos);
+    entries.push_back(newEntry);
+}
+
+// Computes floor(log2(x)).
+static inline uint32_t floor_log2(uint32_t x) {
+    assert(x > 0);
+    int log = 0;
+    while (x >>= 1) { ++log; }
+    return log;
+}
+
+// Computes the altitude of the largest subtree for an MMR with n nodes,
+// which is floor(log2(n + 1)) - 1.
+static inline uint32_t altitude(uint32_t n) {
+    return floor_log2(n + 1) - 1;
+}
+
+uint32_t CCoinsViewCache::PreloadHistoryTree(uint32_t epochId, bool extra, std::vector<HistoryEntry> &entries, std::vector<uint32_t> &entry_indices) {
+    auto treeLength = GetHistoryLength(epochId);
+
+    if (treeLength <= 0) {
+        throw std::runtime_error("Invalid PreloadHistoryTree state called - tree should exist");
+    } else if (treeLength == 1) {
+        entries.push_back(libzcash::LeafToEntry(GetHistoryAt(epochId, 0)));
+        entry_indices.push_back(0);
+        return 1;
+    }
+
+    uint32_t last_peak_pos = 0;
+    uint32_t last_peak_alt = 0;
+    uint32_t alt = 0;
+    uint32_t peak_pos = 0;
+    uint32_t total_peaks = 0;
+
+    // Assume the following example peak layout with 14 leaves, and 25 stored nodes in
+    // total (the "tree length"):
+    //
+    //             P
+    //            /\
+    //           /  \
+    //          / \  \
+    //        /    \  \  Altitude
+    //     _A_      \  \    3
+    //   _/   \_     B  \   2
+    //  / \   / \   / \  C  1
+    // /\ /\ /\ /\ /\ /\ /\ 0
+    //
+    // We start by determining the altitude of the highest peak (A).
+    alt = altitude(treeLength);
+
+    // We determine the position of the highest peak (A) by pretending it is the right
+    // sibling in a tree, and its left-most leaf has position 0. Then the left sibling
+    // of (A) has position -1, and so we can "jump" to the peak's position by computing
+    // -1 + 2^(alt + 1) - 1.
+    peak_pos = (1 << (alt + 1)) - 2;
+
+    // Now that we have the position and altitude of the highest peak (A), we collect
+    // the remaining peaks (B, C). We navigate the peaks as if they were nodes in this
+    // Merkle tree (with additional imaginary nodes 1 and 2, that have positions beyond
+    // the MMR's length):
+    //
+    //             / \
+    //            /   \
+    //           /     \
+    //         /         \
+    //       A ==========> 1
+    //      / \          //  \
+    //    _/   \_       B ==> 2
+    //   /\     /\     /\    //
+    //  /  \   /  \   /  \   C
+    // /\  /\ /\  /\ /\  /\ /\
+    //
+    while (alt != 0) {
+        // If peak_pos is out of bounds of the tree, we compute the position of its left
+        // child, and drop down one level in the tree.
+        if (peak_pos >= treeLength) {
+            // left child, -2^alt
+            peak_pos = peak_pos - (1 << alt);
+            alt = alt - 1;
+        }
+
+        // If the peak exists, we take it and then continue with its right sibling.
+        if (peak_pos < treeLength) {
+            draftMMRNode(entry_indices, entries, GetHistoryAt(epochId, peak_pos), alt, peak_pos);
+
+            last_peak_pos = peak_pos;
+            last_peak_alt = alt;
+
+            // right sibling
+            peak_pos = peak_pos + (1 << (alt + 1)) - 1;
+        }
+    }
+
+    total_peaks = entries.size();
+
+    // Return early if we don't require extra nodes.
+    if (!extra) return total_peaks;
+
+    alt = last_peak_alt;
+    peak_pos = last_peak_pos;
+
+
+    //             P
+    //            /\
+    //           /  \
+    //          / \  \
+    //        /    \  \
+    //     _A_      \  \
+    //   _/   \_     B  \
+    //  / \   / \   / \  C
+    // /\ /\ /\ /\ /\ /\ /\
+    //                   D E
+    //
+    // For extra peaks needed for deletion, we do extra pass on right slope of the last peak
+    // and add those nodes + their siblings. Extra would be (D, E) for the picture above.
+    while (alt > 0) {
+        uint32_t left_pos = peak_pos - (1 << alt);
+        uint32_t right_pos = peak_pos - 1;
+        alt = alt - 1;
+
+        // drafting left child
+        draftMMRNode(entry_indices, entries, GetHistoryAt(epochId, left_pos), alt, left_pos);
+
+        // drafting right child
+        draftMMRNode(entry_indices, entries, GetHistoryAt(epochId, right_pos), alt, right_pos);
+
+        // continuing on right slope
+        peak_pos = right_pos;
+    }
+
+    return total_peaks;
+}
+
+HistoryCache& CCoinsViewCache::SelectHistoryCache(uint32_t epochId) const {
+    auto entry = historyCacheMap.find(epochId);
+
+    if (entry != historyCacheMap.end()) {
+        return entry->second;
+    } else {
+        auto cache = HistoryCache(
+            base->GetHistoryLength(epochId),
+            base->GetHistoryRoot(epochId),
+            epochId
+        );
+        return historyCacheMap.insert({epochId, cache}).first->second;
+    }
+}
+
+void CCoinsViewCache::PushHistoryNode(uint32_t epochId, const HistoryNode node) {
+    HistoryCache& historyCache = SelectHistoryCache(epochId);
+
+    if (historyCache.length == 0) {
+        // special case, it just goes into the cache right away
+        historyCache.Extend(node);
+
+        if (librustzcash_mmr_hash_node(epochId, &node, historyCache.root.begin()) != 0) {
+            throw std::runtime_error("hashing node failed");
+        };
+
+        return;
+    }
+
+    std::vector<HistoryEntry> entries;
+    std::vector<uint32_t> entry_indices;
+
+    PreloadHistoryTree(epochId, false, entries, entry_indices);
+
+    uint256 newRoot;
+    std::array<HistoryNode, 32> appendBuf = {};
+
+    uint32_t appends = librustzcash_mmr_append(
+        epochId,
+        historyCache.length,
+        entry_indices.data(),
+        entries.data(),
+        entry_indices.size(),
+        &node,
+        newRoot.begin(),
+        appendBuf.data()
+    );
+
+    for (size_t i = 0; i < appends; i++) {
+        historyCache.Extend(appendBuf[i]);
+    }
+
+    historyCache.root = newRoot;
+}
+
+void CCoinsViewCache::PopHistoryNode(uint32_t epochId) {
+    HistoryCache& historyCache = SelectHistoryCache(epochId);
+    uint256 newRoot;
+
+    switch (historyCache.length) {
+        case 0:
+        {
+            // Caller is generally not expected to pop from empty tree! Caller
+            // should switch to previous epoch and pop history from there.
+
+            // If we are doing an expected rollback that changes the consensus
+            // branch ID for some upgrade (or introduces one that wasn't present
+            // at the equivalent height) this will occur because
+            // `SelectHistoryCache` selects the tree for the new consensus
+            // branch ID, not the one that existed on the chain being rolled
+            // back.
+
+            // Sensible action is to truncate the history cache:
+        }
+        case 1:
+        {
+            // Just resetting tree to empty
+            historyCache.Truncate(0);
+            historyCache.root = uint256();
+            return;
+        }
+        case 2:
+        {
+            // - A tree with one leaf has length 1.
+            // - A tree with two leaves has length 3.
+            throw std::runtime_error("a history tree cannot have two nodes");
+        }
+        case 3:
+        {
+            const HistoryNode tmpHistoryRoot = GetHistoryAt(epochId, 0);
+            // After removing a leaf from a tree with two leaves, we are left
+            // with a single-node tree, whose root is just the hash of that
+            // node.
+            if (librustzcash_mmr_hash_node(
+                epochId,
+                &tmpHistoryRoot,
+                newRoot.begin()
+            ) != 0) {
+                throw std::runtime_error("hashing node failed");
+            }
+            historyCache.Truncate(1);
+            historyCache.root = newRoot;
+            return;
+        }
+        default:
+        {
+            // This is a non-elementary pop, so use the full tree logic.
+            std::vector<HistoryEntry> entries;
+            std::vector<uint32_t> entry_indices;
+
+            uint32_t peak_count = PreloadHistoryTree(epochId, true, entries, entry_indices);
+
+            uint32_t numberOfDeletes = librustzcash_mmr_delete(
+                epochId,
+                historyCache.length,
+                entry_indices.data(),
+                entries.data(),
+                peak_count,
+                entries.size() - peak_count,
+                newRoot.begin()
+            );
+
+            historyCache.Truncate(historyCache.length - numberOfDeletes);
+            historyCache.root = newRoot;
+            return;
+        }
+    }
+}
+
+template<typename Tree, typename Cache, typename CacheEntry>
+void CCoinsViewCache::AbstractPopAnchor(
+    const uint256 &newrt,
+    ShieldedType type,
+    Cache &cacheAnchors,
+    uint256 &hash
+)
+{
+    auto currentRoot = GetBestAnchor(type);
+
+    // Blocks might not change the commitment tree, in which
+    // case restoring the "old" anchor during a reorg must
+    // have no effect.
+    if (currentRoot != newrt) {
+        // Bring the current best anchor into our local cache
+        // so that its tree exists in memory.
+        {
+            Tree tree;
+            BringBestAnchorIntoCache(currentRoot, tree);
+        }
+
+        // Mark the anchor as unentered, removing it from view
+        cacheAnchors[currentRoot].entered = false;
+
+        // Mark the cache entry as dirty so it's propagated
+        cacheAnchors[currentRoot].flags = CacheEntry::DIRTY;
+
+        // Mark the new root as the best anchor
+        hash = newrt;
+    }
+}
+
+void CCoinsViewCache::PopAnchor(const uint256 &newrt, ShieldedType type) {
+    switch (type) {
+        case SPROUT:
+            AbstractPopAnchor<SproutMerkleTree, CAnchorsSproutMap, CAnchorsSproutCacheEntry>(
+                newrt,
+                SPROUT,
+                cacheSproutAnchors,
+                hashSproutAnchor
+            );
+            break;
+        case SAPLING:
+            AbstractPopAnchor<SaplingMerkleTree, CAnchorsSaplingMap, CAnchorsSaplingCacheEntry>(
+                newrt,
+                SAPLING,
+                cacheSaplingAnchors,
+                hashSaplingAnchor
+            );
+            break;
+        case ORCHARD:
+            AbstractPopAnchor<OrchardMerkleFrontier, CAnchorsOrchardMap, CAnchorsOrchardCacheEntry>(
+                newrt,
+                ORCHARD,
+                cacheOrchardAnchors,
+                hashOrchardAnchor
+            );
+            break;
+        default:
+            throw std::runtime_error("Unknown shielded type");
+    }
+}
+
+void CCoinsViewCache::SetNullifiers(const CTransaction& tx, bool spent) {
+    for (const JSDescription &joinsplit : tx.vJoinSplit) {
+        for (const uint256 &nullifier : joinsplit.nullifiers) {
+            std::pair<CNullifiersMap::iterator, bool> ret = cacheSproutNullifiers.insert(std::make_pair(nullifier, CNullifiersCacheEntry()));
+            ret.first->second.entered = spent;
+            ret.first->second.flags |= CNullifiersCacheEntry::DIRTY;
+        }
+    }
+    for (const SpendDescription &spendDescription : tx.vShieldedSpend) {
+        std::pair<CNullifiersMap::iterator, bool> ret = cacheSaplingNullifiers.insert(std::make_pair(spendDescription.nullifier, CNullifiersCacheEntry()));
+        ret.first->second.entered = spent;
+        ret.first->second.flags |= CNullifiersCacheEntry::DIRTY;
+    }
+    for (const uint256& nf : tx.GetOrchardBundle().GetNullifiers()) {
+        std::pair<CNullifiersMap::iterator, bool> ret = cacheOrchardNullifiers.insert(std::make_pair(nf, CNullifiersCacheEntry()));
+        ret.first->second.entered = spent;
+        ret.first->second.flags |= CNullifiersCacheEntry::DIRTY;
+    }
+}
+
+bool CCoinsViewCache::GetCoins(const uint256 &txid, CCoins &coins) const {
+    CCoinsMap::const_iterator it = FetchCoins(txid);
+    if (it != cacheCoins.end()) {
+        coins = it->second.coins;
+        return true;
+    }
+    return false;
+}
+
+CCoinsModifier CCoinsViewCache::ModifyCoins(const uint256 &txid) {
+    assert(!hasModifier);
+    std::pair<CCoinsMap::iterator, bool> ret = cacheCoins.insert(std::make_pair(txid, CCoinsCacheEntry()));
+    size_t cachedCoinUsage = 0;
+    if (ret.second) {
+        if (!base->GetCoins(txid, ret.first->second.coins)) {
+            // The parent view does not have this entry; mark it as fresh.
+            ret.first->second.coins.Clear();
+            ret.first->second.flags = CCoinsCacheEntry::FRESH;
+        } else if (ret.first->second.coins.IsPruned()) {
+            // The parent view only has a pruned entry for this; mark it as fresh.
+            ret.first->second.flags = CCoinsCacheEntry::FRESH;
+        }
+    } else {
+        cachedCoinUsage = ret.first->second.coins.DynamicMemoryUsage();
+    }
+    // Assume that whenever ModifyCoins is called, the entry will be modified.
+    ret.first->second.flags |= CCoinsCacheEntry::DIRTY;
+    return CCoinsModifier(*this, ret.first, cachedCoinUsage);
+}
+
+CCoinsModifier CCoinsViewCache::ModifyNewCoins(const uint256 &txid) {
+    assert(!hasModifier);
+    std::pair<CCoinsMap::iterator, bool> ret = cacheCoins.insert(std::make_pair(txid, CCoinsCacheEntry()));
+    ret.first->second.coins.Clear();
+    ret.first->second.flags = CCoinsCacheEntry::FRESH;
+    ret.first->second.flags |= CCoinsCacheEntry::DIRTY;
+    return CCoinsModifier(*this, ret.first, 0);
+}
+
+const CCoins* CCoinsViewCache::AccessCoins(const uint256 &txid) const {
+    CCoinsMap::const_iterator it = FetchCoins(txid);
+    if (it == cacheCoins.end()) {
+        return NULL;
+    } else {
+        return &it->second.coins;
+    }
+}
+
+bool CCoinsViewCache::HaveCoins(const uint256 &txid) const {
+    CCoinsMap::const_iterator it = FetchCoins(txid);
+    // We're using vtx.empty() instead of IsPruned here for performance reasons,
+    // as we only care about the case where a transaction was replaced entirely
+    // in a reorganization (which wipes vout entirely, as opposed to spending
+    // which just cleans individual outputs).
+    return (it != cacheCoins.end() && !it->second.coins.vout.empty());
+}
+
+uint256 CCoinsViewCache::GetBestBlock() const {
+    if (hashBlock.IsNull())
+        hashBlock = base->GetBestBlock();
+    return hashBlock;
+}
+
+
+uint256 CCoinsViewCache::GetBestAnchor(ShieldedType type) const {
+    switch (type) {
+        case SPROUT:
+            if (hashSproutAnchor.IsNull())
+                hashSproutAnchor = base->GetBestAnchor(type);
+            return hashSproutAnchor;
+            break;
+        case SAPLING:
+            if (hashSaplingAnchor.IsNull())
+                hashSaplingAnchor = base->GetBestAnchor(type);
+            return hashSaplingAnchor;
+            break;
+        case ORCHARD:
+            if (hashOrchardAnchor.IsNull())
+                hashOrchardAnchor = base->GetBestAnchor(type);
+            return hashOrchardAnchor;
+            break;
+        default:
+            throw std::runtime_error("Unknown shielded type");
+    }
+}
+
+void CCoinsViewCache::SetBestBlock(const uint256 &hashBlockIn) {
+    hashBlock = hashBlockIn;
+}
+
+void BatchWriteNullifiers(CNullifiersMap &mapNullifiers, CNullifiersMap &cacheNullifiers)
+{
+    for (CNullifiersMap::iterator child_it = mapNullifiers.begin(); child_it != mapNullifiers.end();) {
+        if (child_it->second.flags & CNullifiersCacheEntry::DIRTY) { // Ignore non-dirty entries (optimization).
+            CNullifiersMap::iterator parent_it = cacheNullifiers.find(child_it->first);
+
+            if (parent_it == cacheNullifiers.end()) {
+                CNullifiersCacheEntry& entry = cacheNullifiers[child_it->first];
+                entry.entered = child_it->second.entered;
+                entry.flags = CNullifiersCacheEntry::DIRTY;
+            } else {
+                if (parent_it->second.entered != child_it->second.entered) {
+                    parent_it->second.entered = child_it->second.entered;
+                    parent_it->second.flags |= CNullifiersCacheEntry::DIRTY;
+                }
+            }
+        }
+        child_it = mapNullifiers.erase(child_it);
+    }
+}
+
+template<typename Map, typename MapIterator, typename MapEntry>
+void BatchWriteAnchors(
+    Map &mapAnchors,
+    Map &cacheAnchors,
+    size_t &cachedCoinsUsage
+)
+{
+    for (MapIterator child_it = mapAnchors.begin(); child_it != mapAnchors.end();)
+    {
+        if (child_it->second.flags & MapEntry::DIRTY) {
+            MapIterator parent_it = cacheAnchors.find(child_it->first);
+
+            if (parent_it == cacheAnchors.end()) {
+                MapEntry& entry = cacheAnchors[child_it->first];
+                entry.entered = child_it->second.entered;
+                entry.tree = child_it->second.tree;
+                entry.flags = MapEntry::DIRTY;
+
+                cachedCoinsUsage += entry.tree.DynamicMemoryUsage();
+            } else {
+                if (parent_it->second.entered != child_it->second.entered) {
+                    // The parent may have removed the entry.
+                    parent_it->second.entered = child_it->second.entered;
+                    parent_it->second.flags |= MapEntry::DIRTY;
+                }
+            }
+        }
+
+        child_it = mapAnchors.erase(child_it);
+    }
+}
+
+void BatchWriteHistory(CHistoryCacheMap& historyCacheMap, CHistoryCacheMap& historyCacheMapIn) {
+    for (auto nextHistoryCache = historyCacheMapIn.begin(); nextHistoryCache != historyCacheMapIn.end(); nextHistoryCache++) {
+        auto historyCacheIn = nextHistoryCache->second;
+        auto epochId = nextHistoryCache->first;
+
+        auto historyCache = historyCacheMap.find(epochId);
+        if (historyCache != historyCacheMap.end()) {
+            // delete old entries since updateDepth
+            historyCache->second.Truncate(historyCacheIn.updateDepth);
+
+            // Replace/append new/updated entries. HistoryCache.Extend
+            // auto-indexes the nodes, so we need to extend in the same order as
+            // this cache is indexed.
+            for (size_t i = historyCacheIn.updateDepth; i < historyCacheIn.length; i++) {
+                historyCache->second.Extend(historyCacheIn.appends[i]);
+            }
+
+            // the lengths should now match
+            assert(historyCache->second.length == historyCacheIn.length);
+
+            // write current root
+            historyCache->second.root = historyCacheIn.root;
+        } else {
+            // Just insert the history cache into its parent
+            historyCacheMap.insert({epochId, historyCacheIn});
+        }
+    }
+}
+
+bool CCoinsViewCache::BatchWrite(CCoinsMap &mapCoins,
+                                 const uint256 &hashBlockIn,
+                                 const uint256 &hashSproutAnchorIn,
+                                 const uint256 &hashSaplingAnchorIn,
+                                 const uint256 &hashOrchardAnchorIn,
+                                 CAnchorsSproutMap &mapSproutAnchors,
+                                 CAnchorsSaplingMap &mapSaplingAnchors,
+                                 CAnchorsOrchardMap &mapOrchardAnchors,
+                                 CNullifiersMap &mapSproutNullifiers,
+                                 CNullifiersMap &mapSaplingNullifiers,
+                                 CNullifiersMap &mapOrchardNullifiers,
+                                 CHistoryCacheMap &historyCacheMapIn) {
+    assert(!hasModifier);
+    for (CCoinsMap::iterator it = mapCoins.begin(); it != mapCoins.end();) {
+        if (it->second.flags & CCoinsCacheEntry::DIRTY) { // Ignore non-dirty entries (optimization).
+            CCoinsMap::iterator itUs = cacheCoins.find(it->first);
+            if (itUs == cacheCoins.end()) {
+                if (!it->second.coins.IsPruned()) {
+                    // The parent cache does not have an entry, while the child
+                    // cache does have (a non-pruned) one. Move the data up, and
+                    // mark it as fresh (if the grandparent did have it, we
+                    // would have pulled it in at first GetCoins).
+                    assert(it->second.flags & CCoinsCacheEntry::FRESH);
+                    CCoinsCacheEntry& entry = cacheCoins[it->first];
+                    entry.coins.swap(it->second.coins);
+                    cachedCoinsUsage += entry.coins.DynamicMemoryUsage();
+                    entry.flags = CCoinsCacheEntry::DIRTY | CCoinsCacheEntry::FRESH;
+                }
+            } else {
+                if ((itUs->second.flags & CCoinsCacheEntry::FRESH) && it->second.coins.IsPruned()) {
+                    // The grandparent does not have an entry, and the child is
+                    // modified and being pruned. This means we can just delete
+                    // it from the parent.
+                    cachedCoinsUsage -= itUs->second.coins.DynamicMemoryUsage();
+                    cacheCoins.erase(itUs);
+                } else {
+                    // A normal modification.
+                    cachedCoinsUsage -= itUs->second.coins.DynamicMemoryUsage();
+                    itUs->second.coins.swap(it->second.coins);
+                    cachedCoinsUsage += itUs->second.coins.DynamicMemoryUsage();
+                    itUs->second.flags |= CCoinsCacheEntry::DIRTY;
+                }
+            }
+        }
+        it = mapCoins.erase(it);
+    }
+
+    ::BatchWriteAnchors<CAnchorsSproutMap, CAnchorsSproutMap::iterator, CAnchorsSproutCacheEntry>(mapSproutAnchors, cacheSproutAnchors, cachedCoinsUsage);
+    ::BatchWriteAnchors<CAnchorsSaplingMap, CAnchorsSaplingMap::iterator, CAnchorsSaplingCacheEntry>(mapSaplingAnchors, cacheSaplingAnchors, cachedCoinsUsage);
+    ::BatchWriteAnchors<CAnchorsOrchardMap, CAnchorsOrchardMap::iterator, CAnchorsOrchardCacheEntry>(mapOrchardAnchors, cacheOrchardAnchors, cachedCoinsUsage);
+
+    ::BatchWriteNullifiers(mapSproutNullifiers, cacheSproutNullifiers);
+    ::BatchWriteNullifiers(mapSaplingNullifiers, cacheSaplingNullifiers);
+    ::BatchWriteNullifiers(mapOrchardNullifiers, cacheOrchardNullifiers);
+
+    ::BatchWriteHistory(historyCacheMap, historyCacheMapIn);
+
+    hashSproutAnchor = hashSproutAnchorIn;
+    hashSaplingAnchor = hashSaplingAnchorIn;
+    hashOrchardAnchor = hashOrchardAnchorIn;
+    hashBlock = hashBlockIn;
+    return true;
+}
+
+bool CCoinsViewCache::Flush() {
+    bool fOk = base->BatchWrite(cacheCoins,
+                                hashBlock,
+                                hashSproutAnchor,
+                                hashSaplingAnchor,
+                                hashOrchardAnchor,
+                                cacheSproutAnchors,
+                                cacheSaplingAnchors,
+                                cacheOrchardAnchors,
+                                cacheSproutNullifiers,
+                                cacheSaplingNullifiers,
+                                cacheOrchardNullifiers,
+                                historyCacheMap);
+    cacheCoins.clear();
+    cacheSproutAnchors.clear();
+    cacheSaplingAnchors.clear();
+    cacheOrchardAnchors.clear();
+    cacheSproutNullifiers.clear();
+    cacheSaplingNullifiers.clear();
+    cacheOrchardNullifiers.clear();
+    historyCacheMap.clear();
+    cachedCoinsUsage = 0;
+    return fOk;
+}
+
+unsigned int CCoinsViewCache::GetCacheSize() const {
+    return cacheCoins.size();
+}
+
+const CTxOut &CCoinsViewCache::GetOutputFor(const CTxIn& input) const
+{
+    const CCoins* coins = AccessCoins(input.prevout.hash);
+    assert(coins && coins->IsAvailable(input.prevout.n));
+    return coins->vout[input.prevout.n];
+}
+
+CAmount CCoinsViewCache::GetValueIn(const CTransaction& tx) const
+{
+    if (tx.IsCoinBase())
+        return 0;
+
+    CAmount nResult = 0;
+    for (unsigned int i = 0; i < tx.vin.size(); i++)
+        nResult += GetOutputFor(tx.vin[i]).nValue;
+
+    nResult += tx.GetShieldedValueIn();
+
+    return nResult;
+}
+
+std::optional<UnsatisfiedShieldedReq> CCoinsViewCache::HaveShieldedRequirements(const CTransaction& tx) const
+{
+    boost::unordered_map<uint256, SproutMerkleTree, SaltedTxidHasher> intermediates;
+
+    for (const JSDescription &joinsplit : tx.vJoinSplit)
+    {
+        for (const uint256& nullifier : joinsplit.nullifiers)
+        {
+            if (GetNullifier(nullifier, SPROUT)) {
+                // If the nullifier is set, this transaction
+                // double-spends!
+                auto txid = tx.GetHash().ToString();
+                auto nf = nullifier.ToString();
+                TracingWarn("consensus", "Sprout double-spend detected",
+                    "txid", txid.c_str(),
+                    "nf", nf.c_str());
+                return UnsatisfiedShieldedReq::SproutDuplicateNullifier;
+            }
+        }
+
+        SproutMerkleTree tree;
+        auto it = intermediates.find(joinsplit.anchor);
+        if (it != intermediates.end()) {
+            tree = it->second;
+        } else if (!GetSproutAnchorAt(joinsplit.anchor, tree)) {
+            auto txid = tx.GetHash().ToString();
+            auto anchor = joinsplit.anchor.ToString();
+            TracingWarn("consensus", "Transaction uses unknown Sprout anchor",
+                "txid", txid.c_str(),
+                "anchor", anchor.c_str());
+            return UnsatisfiedShieldedReq::SproutUnknownAnchor;
+        }
+
+        for (const uint256& commitment : joinsplit.commitments)
+        {
+            tree.append(commitment);
+        }
+
+        intermediates.insert(std::make_pair(tree.root(), tree));
+    }
+
+    for (const SpendDescription &spendDescription : tx.vShieldedSpend) {
+        if (GetNullifier(spendDescription.nullifier, SAPLING)) { // Prevent double spends
+            auto txid = tx.GetHash().ToString();
+            auto nf = spendDescription.nullifier.ToString();
+            TracingWarn("consensus", "Sapling double-spend detected",
+                "txid", txid.c_str(),
+                "nf", nf.c_str());
+            return UnsatisfiedShieldedReq::SaplingDuplicateNullifier;
+        }
+
+        SaplingMerkleTree tree;
+        if (!GetSaplingAnchorAt(spendDescription.anchor, tree)) {
+            auto txid = tx.GetHash().ToString();
+            auto anchor = spendDescription.anchor.ToString();
+            TracingWarn("consensus", "Transaction uses unknown Sapling anchor",
+                "txid", txid.c_str(),
+                "anchor", anchor.c_str());
+            return UnsatisfiedShieldedReq::SaplingUnknownAnchor;
+        }
+    }
+
+    for (const uint256 &nullifier : tx.GetOrchardBundle().GetNullifiers()) {
+        if (GetNullifier(nullifier, ORCHARD)) { // Prevent double spends
+            auto txid = tx.GetHash().ToString();
+            auto nf = nullifier.ToString();
+            TracingWarn("consensus", "Orchard double-spend detected",
+                "txid", txid.c_str(),
+                "nf", nf.c_str());
+            return UnsatisfiedShieldedReq::OrchardDuplicateNullifier;
+        }
+    }
+
+    std::optional<uint256> root = tx.GetOrchardBundle().GetAnchor();
+    if (root) {
+        OrchardMerkleFrontier tree;
+        if (!GetOrchardAnchorAt(root.value(), tree)) {
+            auto txid = tx.GetHash().ToString();
+            auto anchor = root.value().ToString();
+            TracingWarn("consensus", "Transaction uses unknown Orchard anchor",
+                "txid", txid.c_str(),
+                "anchor", anchor.c_str());
+            return UnsatisfiedShieldedReq::OrchardUnknownAnchor;
+        }
+    }
+
+    return std::nullopt;
+}
+
+bool CCoinsViewCache::HaveInputs(const CTransaction& tx) const
+{
+    if (!tx.IsCoinBase()) {
+        for (unsigned int i = 0; i < tx.vin.size(); i++) {
+            const COutPoint &prevout = tx.vin[i].prevout;
+            const CCoins* coins = AccessCoins(prevout.hash);
+            if (!coins || !coins->IsAvailable(prevout.n)) {
+                return false;
+            }
+        }
+    }
+    return true;
+}
+
+double CCoinsViewCache::GetPriority(const CTransaction &tx, int nHeight) const
+{
+    if (tx.IsCoinBase())
+        return 0.0;
+
+    // Shielded transfers do not reveal any information about the value or age of a note, so we
+    // cannot apply the priority algorithm used for transparent utxos.  Instead, we just
+    // use the maximum priority for all (partially or fully) shielded transactions.
+    // (Note that coinbase transactions cannot contain JoinSplits, or Sapling shielded Spends or Outputs.)
+
+    if (tx.vJoinSplit.size() > 0 ||
+        tx.vShieldedSpend.size() > 0 ||
+        tx.vShieldedOutput.size() > 0 ||
+        tx.GetOrchardBundle().IsPresent())
+    {
+        return MAX_PRIORITY;
+    }
+
+    // FIXME: this logic is partially duplicated between here and CreateNewBlock in miner.cpp.
+    double dResult = 0.0;
+    for (const CTxIn& txin : tx.vin)
+    {
+        const CCoins* coins = AccessCoins(txin.prevout.hash);
+        assert(coins);
+        if (!coins->IsAvailable(txin.prevout.n)) continue;
+        if (coins->nHeight < nHeight) {
+            dResult += coins->vout[txin.prevout.n].nValue * (nHeight-coins->nHeight);
+        }
+    }
+
+    return tx.ComputePriority(dResult);
+}
+
+CCoinsModifier::CCoinsModifier(CCoinsViewCache& cache_, CCoinsMap::iterator it_, size_t usage) : cache(cache_), it(it_), cachedCoinUsage(usage) {
+    assert(!cache.hasModifier);
+    cache.hasModifier = true;
+}
+
+CCoinsModifier::~CCoinsModifier()
+{
+    assert(cache.hasModifier);
+    cache.hasModifier = false;
+    it->second.coins.Cleanup();
+    cache.cachedCoinsUsage -= cachedCoinUsage; // Subtract the old usage
+    if ((it->second.flags & CCoinsCacheEntry::FRESH) && it->second.coins.IsPruned()) {
+        cache.cacheCoins.erase(it);
+    } else {
+        // If the coin still exists after the modification, add the new usage
+        cache.cachedCoinsUsage += it->second.coins.DynamicMemoryUsage();
+    }
+}
diff --git a/depend/zcash/src/coins.h b/depend/zcash/src/coins.h
new file mode 100644
index 000000000..c318d65d3
--- /dev/null
+++ b/depend/zcash/src/coins.h
@@ -0,0 +1,672 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_COINS_H
+#define BITCOIN_COINS_H
+
+#include "compressor.h"
+#include "core_memusage.h"
+#include "hash.h"
+#include "memusage.h"
+#include "serialize.h"
+#include "uint256.h"
+
+#include <assert.h>
+#include <stdint.h>
+
+#include <boost/unordered_map.hpp>
+#include "zcash/History.hpp"
+#include "zcash/IncrementalMerkleTree.hpp"
+
+/**
+ * Pruned version of CTransaction: only retains metadata and unspent transaction outputs
+ *
+ * Serialized format:
+ * - VARINT(nVersion)
+ * - VARINT(nCode)
+ * - unspentness bitvector, for vout[2] and further; least significant byte first
+ * - the non-spent CTxOuts (via CTxOutCompressor)
+ * - VARINT(nHeight)
+ *
+ * The nCode value consists of:
+ * - bit 1: IsCoinBase()
+ * - bit 2: vout[0] is not spent
+ * - bit 4: vout[1] is not spent
+ * - The higher bits encode N, the number of non-zero bytes in the following bitvector.
+ *   - In case both bit 2 and bit 4 are unset, they encode N-1, as there must be at
+ *     least one non-spent output).
+ *
+ * Example: 0104835800816115944e077fe7c803cfa57f29b36bf87c1d358bb85e
+ *          <><><--------------------------------------------><---->
+ *          |  \                  |                             /
+ *    version   code             vout[1]                  height
+ *
+ *    - version = 1
+ *    - code = 4 (vout[1] is not spent, and 0 non-zero bytes of bitvector follow)
+ *    - unspentness bitvector: as 0 non-zero bytes follow, it has length 0
+ *    - vout[1]: 835800816115944e077fe7c803cfa57f29b36bf87c1d35
+ *               * 8358: compact amount representation for 60000000000 (600 BTC)
+ *               * 00: special txout type pay-to-pubkey-hash
+ *               * 816115944e077fe7c803cfa57f29b36bf87c1d35: address uint160
+ *    - height = 203998
+ *
+ *
+ * Example: 0109044086ef97d5790061b01caab50f1b8e9c50a5057eb43c2d9563a4eebbd123008c988f1a4a4de2161e0f50aac7f17e7f9555caa486af3b
+ *          <><><--><--------------------------------------------------><----------------------------------------------><---->
+ *         /  \   \                     |                                                           |                     /
+ *  version  code  unspentness       vout[4]                                                     vout[16]           height
+ *
+ *  - version = 1
+ *  - code = 9 (coinbase, neither vout[0] or vout[1] are unspent,
+ *                2 (1, +1 because both bit 2 and bit 4 are unset) non-zero bitvector bytes follow)
+ *  - unspentness bitvector: bits 2 (0x04) and 14 (0x4000) are set, so vout[2+2] and vout[14+2] are unspent
+ *  - vout[4]: 86ef97d5790061b01caab50f1b8e9c50a5057eb43c2d9563a4ee
+ *             * 86ef97d579: compact amount representation for 234925952 (2.35 BTC)
+ *             * 00: special txout type pay-to-pubkey-hash
+ *             * 61b01caab50f1b8e9c50a5057eb43c2d9563a4ee: address uint160
+ *  - vout[16]: bbd123008c988f1a4a4de2161e0f50aac7f17e7f9555caa4
+ *              * bbd123: compact amount representation for 110397 (0.001 BTC)
+ *              * 00: special txout type pay-to-pubkey-hash
+ *              * 8c988f1a4a4de2161e0f50aac7f17e7f9555caa4: address uint160
+ *  - height = 120891
+ */
+class CCoins
+{
+public:
+    //! whether transaction is a coinbase
+    bool fCoinBase;
+
+    //! unspent transaction outputs; spent outputs are .IsNull(); spent outputs at the end of the array are dropped
+    std::vector<CTxOut> vout;
+
+    //! at which height this transaction was included in the active block chain
+    int nHeight;
+
+    //! version of the CTransaction; accesses to this value should probably check for nHeight as well,
+    //! as new tx version will probably only be introduced at certain heights
+    int nVersion;
+
+    void FromTx(const CTransaction &tx, int nHeightIn) {
+        fCoinBase = tx.IsCoinBase();
+        vout = tx.vout;
+        nHeight = nHeightIn;
+        nVersion = tx.nVersion;
+        ClearUnspendable();
+    }
+
+    //! construct a CCoins from a CTransaction, at a given height
+    CCoins(const CTransaction &tx, int nHeightIn) {
+        FromTx(tx, nHeightIn);
+    }
+
+    void Clear() {
+        fCoinBase = false;
+        std::vector<CTxOut>().swap(vout);
+        nHeight = 0;
+        nVersion = 0;
+    }
+
+    //! empty constructor
+    CCoins() : fCoinBase(false), vout(0), nHeight(0), nVersion(0) { }
+
+    //!remove spent outputs at the end of vout
+    void Cleanup() {
+        while (vout.size() > 0 && vout.back().IsNull())
+            vout.pop_back();
+        if (vout.empty())
+            std::vector<CTxOut>().swap(vout);
+    }
+
+    void ClearUnspendable() {
+        for (CTxOut &txout : vout) {
+            if (txout.scriptPubKey.IsUnspendable())
+                txout.SetNull();
+        }
+        Cleanup();
+    }
+
+    void swap(CCoins &to) {
+        std::swap(to.fCoinBase, fCoinBase);
+        to.vout.swap(vout);
+        std::swap(to.nHeight, nHeight);
+        std::swap(to.nVersion, nVersion);
+    }
+
+    //! equality test
+    friend bool operator==(const CCoins &a, const CCoins &b) {
+         // Empty CCoins objects are always equal.
+         if (a.IsPruned() && b.IsPruned())
+             return true;
+         return a.fCoinBase == b.fCoinBase &&
+                a.nHeight == b.nHeight &&
+                a.nVersion == b.nVersion &&
+                a.vout == b.vout;
+    }
+    friend bool operator!=(const CCoins &a, const CCoins &b) {
+        return !(a == b);
+    }
+
+    void CalcMaskSize(unsigned int &nBytes, unsigned int &nNonzeroBytes) const;
+
+    bool IsCoinBase() const {
+        return fCoinBase;
+    }
+
+    template<typename Stream>
+    void Serialize(Stream &s) const {
+        unsigned int nMaskSize = 0, nMaskCode = 0;
+        CalcMaskSize(nMaskSize, nMaskCode);
+        bool fFirst = vout.size() > 0 && !vout[0].IsNull();
+        bool fSecond = vout.size() > 1 && !vout[1].IsNull();
+        assert(fFirst || fSecond || nMaskCode);
+        unsigned int nCode = 8*(nMaskCode - (fFirst || fSecond ? 0 : 1)) + (fCoinBase ? 1 : 0) + (fFirst ? 2 : 0) + (fSecond ? 4 : 0);
+        // version
+        ::Serialize(s, VARINT(this->nVersion));
+        // header code
+        ::Serialize(s, VARINT(nCode));
+        // spentness bitmask
+        for (unsigned int b = 0; b<nMaskSize; b++) {
+            unsigned char chAvail = 0;
+            for (unsigned int i = 0; i < 8 && 2+b*8+i < vout.size(); i++)
+                if (!vout[2+b*8+i].IsNull())
+                    chAvail |= (1 << i);
+            ::Serialize(s, chAvail);
+        }
+        // txouts themself
+        for (unsigned int i = 0; i < vout.size(); i++) {
+            if (!vout[i].IsNull())
+                ::Serialize(s, CTxOutCompressor(REF(vout[i])));
+        }
+        // coinbase height
+        ::Serialize(s, VARINT(nHeight));
+    }
+
+    template<typename Stream>
+    void Unserialize(Stream &s) {
+        unsigned int nCode = 0;
+        // version
+        ::Unserialize(s, VARINT(this->nVersion));
+        // header code
+        ::Unserialize(s, VARINT(nCode));
+        fCoinBase = nCode & 1;
+        std::vector<bool> vAvail(2, false);
+        vAvail[0] = (nCode & 2) != 0;
+        vAvail[1] = (nCode & 4) != 0;
+        unsigned int nMaskCode = (nCode / 8) + ((nCode & 6) != 0 ? 0 : 1);
+        // spentness bitmask
+        while (nMaskCode > 0) {
+            unsigned char chAvail = 0;
+            ::Unserialize(s, chAvail);
+            for (unsigned int p = 0; p < 8; p++) {
+                bool f = (chAvail & (1 << p)) != 0;
+                vAvail.push_back(f);
+            }
+            if (chAvail != 0)
+                nMaskCode--;
+        }
+        // txouts themself
+        vout.assign(vAvail.size(), CTxOut());
+        for (unsigned int i = 0; i < vAvail.size(); i++) {
+            if (vAvail[i])
+                ::Unserialize(s, REF(CTxOutCompressor(vout[i])));
+        }
+        // coinbase height
+        ::Unserialize(s, VARINT(nHeight));
+        Cleanup();
+    }
+
+    //! mark a vout spent
+    bool Spend(uint32_t nPos);
+
+    //! check whether a particular output is still available
+    bool IsAvailable(unsigned int nPos) const {
+        return (nPos < vout.size() && !vout[nPos].IsNull());
+    }
+
+    //! check whether the entire CCoins is spent
+    //! note that only !IsPruned() CCoins can be serialized
+    bool IsPruned() const {
+        for (const CTxOut &out : vout)
+            if (!out.IsNull())
+                return false;
+        return true;
+    }
+
+    size_t DynamicMemoryUsage() const {
+        size_t ret = memusage::DynamicUsage(vout);
+        for (const CTxOut &out : vout) {
+            ret += RecursiveDynamicUsage(out.scriptPubKey);
+        }
+        return ret;
+    }
+};
+
+class SaltedTxidHasher
+{
+private:
+    /** Salt */
+    const uint64_t k0, k1;
+
+public:
+    SaltedTxidHasher();
+
+    /**
+     * This *must* return size_t. With Boost 1.46 on 32-bit systems the
+     * unordered_map will behave unpredictably if the custom hasher returns a
+     * uint64_t, resulting in failures when syncing the chain (#4634).
+     */
+    size_t operator()(const uint256& txid) const {
+        return SipHashUint256(k0, k1, txid);
+    }
+};
+
+struct CCoinsCacheEntry
+{
+    CCoins coins; // The actual cached data.
+    unsigned char flags;
+
+    enum Flags {
+        DIRTY = (1 << 0), // This cache entry is potentially different from the version in the parent view.
+        FRESH = (1 << 1), // The parent view does not have this entry (or it is pruned).
+    };
+
+    CCoinsCacheEntry() : coins(), flags(0) {}
+};
+
+struct CAnchorsSproutCacheEntry
+{
+    bool entered; // This will be false if the anchor is removed from the cache
+    SproutMerkleTree tree; // The tree itself
+    unsigned char flags;
+
+    enum Flags {
+        DIRTY = (1 << 0), // This cache entry is potentially different from the version in the parent view.
+    };
+
+    CAnchorsSproutCacheEntry() : entered(false), flags(0) {}
+};
+
+struct CAnchorsSaplingCacheEntry
+{
+    bool entered; // This will be false if the anchor is removed from the cache
+    SaplingMerkleTree tree; // The tree itself
+    unsigned char flags;
+
+    enum Flags {
+        DIRTY = (1 << 0), // This cache entry is potentially different from the version in the parent view.
+    };
+
+    CAnchorsSaplingCacheEntry() : entered(false), flags(0) {}
+};
+
+struct CAnchorsOrchardCacheEntry
+{
+    bool entered; // This will be false if the anchor is removed from the cache
+    OrchardMerkleFrontier tree; // The tree itself
+    unsigned char flags;
+
+    enum Flags {
+        DIRTY = (1 << 0), // This cache entry is potentially different from the version in the parent view.
+    };
+
+    CAnchorsOrchardCacheEntry() : entered(false), flags(0) {}
+};
+
+struct CNullifiersCacheEntry
+{
+    bool entered; // If the nullifier is spent or not
+    unsigned char flags;
+
+    enum Flags {
+        DIRTY = (1 << 0), // This cache entry is potentially different from the version in the parent view.
+    };
+
+    CNullifiersCacheEntry() : entered(false), flags(0) {}
+};
+
+/// These identify the value pool, and as such, Canopy (for example)
+/// isn't here, since value created during the Canopy network upgrade
+/// is part of the Sapling pool.
+enum ShieldedType
+{
+    SPROUT,
+    SAPLING,
+    ORCHARD,
+};
+
+typedef boost::unordered_map<uint256, CCoinsCacheEntry, SaltedTxidHasher> CCoinsMap;
+typedef boost::unordered_map<uint256, CAnchorsSproutCacheEntry, SaltedTxidHasher> CAnchorsSproutMap;
+typedef boost::unordered_map<uint256, CAnchorsSaplingCacheEntry, SaltedTxidHasher> CAnchorsSaplingMap;
+typedef boost::unordered_map<uint256, CAnchorsOrchardCacheEntry, SaltedTxidHasher> CAnchorsOrchardMap;
+typedef boost::unordered_map<uint256, CNullifiersCacheEntry, SaltedTxidHasher> CNullifiersMap;
+typedef boost::unordered_map<uint32_t, HistoryCache> CHistoryCacheMap;
+
+struct CCoinsStats
+{
+    int nHeight;
+    uint256 hashBlock;
+    uint64_t nTransactions;
+    uint64_t nTransactionOutputs;
+    uint64_t nSerializedSize;
+    uint256 hashSerialized;
+    CAmount nTotalAmount;
+
+    CCoinsStats() : nHeight(0), nTransactions(0), nTransactionOutputs(0), nSerializedSize(0), nTotalAmount(0) {}
+};
+
+
+/** Abstract view on the open txout dataset. */
+class CCoinsView
+{
+public:
+    //! Retrieve the tree (Sprout) at a particular anchored root in the chain
+    virtual bool GetSproutAnchorAt(const uint256 &rt, SproutMerkleTree &tree) const;
+
+    //! Retrieve the tree (Sapling) at a particular anchored root in the chain
+    virtual bool GetSaplingAnchorAt(const uint256 &rt, SaplingMerkleTree &tree) const;
+
+    //! Retrieve the tree (Orchard) at a particular anchored root in the chain
+    virtual bool GetOrchardAnchorAt(const uint256 &rt, OrchardMerkleFrontier &tree) const;
+
+    //! Determine whether a nullifier is spent or not
+    virtual bool GetNullifier(const uint256 &nullifier, ShieldedType type) const;
+
+    //! Retrieve the CCoins (unspent transaction outputs) for a given txid
+    virtual bool GetCoins(const uint256 &txid, CCoins &coins) const;
+
+    //! Just check whether we have data for a given txid.
+    //! This may (but cannot always) return true for fully spent transactions
+    virtual bool HaveCoins(const uint256 &txid) const;
+
+    //! Retrieve the block hash whose state this CCoinsView currently represents
+    virtual uint256 GetBestBlock() const;
+
+    //! Get the current "tip" or the latest anchored tree root in the chain
+    virtual uint256 GetBestAnchor(ShieldedType type) const;
+
+    //! Get the current chain history length (which should be roughly chain height x2)
+    virtual HistoryIndex GetHistoryLength(uint32_t epochId) const;
+
+    //! Get history node at specified index
+    virtual HistoryNode GetHistoryAt(uint32_t epochId, HistoryIndex index) const;
+
+    //! Get current history root
+    virtual uint256 GetHistoryRoot(uint32_t epochId) const;
+
+    //! Do a bulk modification (multiple CCoins changes + BestBlock change).
+    //! The passed mapCoins can be modified.
+    virtual bool BatchWrite(CCoinsMap &mapCoins,
+                            const uint256 &hashBlock,
+                            const uint256 &hashSproutAnchor,
+                            const uint256 &hashSaplingAnchor,
+                            const uint256 &hashOrchardAnchor,
+                            CAnchorsSproutMap &mapSproutAnchors,
+                            CAnchorsSaplingMap &mapSaplingAnchors,
+                            CAnchorsOrchardMap &mapOrchardAnchors,
+                            CNullifiersMap &mapSproutNullifiers,
+                            CNullifiersMap &mapSaplingNullifiers,
+                            CNullifiersMap &mapOrchardNullifiers,
+                            CHistoryCacheMap &historyCacheMap);
+
+    //! Calculate statistics about the unspent transaction output set
+    virtual bool GetStats(CCoinsStats &stats) const;
+
+    //! As we use CCoinsViews polymorphically, have a virtual destructor
+    virtual ~CCoinsView() {}
+};
+
+
+/** CCoinsView backed by another CCoinsView */
+class CCoinsViewBacked : public CCoinsView
+{
+protected:
+    CCoinsView *base;
+
+public:
+    CCoinsViewBacked(CCoinsView *viewIn);
+    bool GetSproutAnchorAt(const uint256 &rt, SproutMerkleTree &tree) const;
+    bool GetSaplingAnchorAt(const uint256 &rt, SaplingMerkleTree &tree) const;
+    bool GetOrchardAnchorAt(const uint256 &rt, OrchardMerkleFrontier &tree) const;
+    bool GetNullifier(const uint256 &nullifier, ShieldedType type) const;
+    bool GetCoins(const uint256 &txid, CCoins &coins) const;
+    bool HaveCoins(const uint256 &txid) const;
+    uint256 GetBestBlock() const;
+    uint256 GetBestAnchor(ShieldedType type) const;
+    HistoryIndex GetHistoryLength(uint32_t epochId) const;
+    HistoryNode GetHistoryAt(uint32_t epochId, HistoryIndex index) const;
+    uint256 GetHistoryRoot(uint32_t epochId) const;
+    void SetBackend(CCoinsView &viewIn);
+    bool BatchWrite(CCoinsMap &mapCoins,
+                    const uint256 &hashBlock,
+                    const uint256 &hashSproutAnchor,
+                    const uint256 &hashSaplingAnchor,
+                    const uint256 &hashOrchardAnchor,
+                    CAnchorsSproutMap &mapSproutAnchors,
+                    CAnchorsSaplingMap &mapSaplingAnchors,
+                    CAnchorsOrchardMap &mapOrchardAnchors,
+                    CNullifiersMap &mapSproutNullifiers,
+                    CNullifiersMap &mapSaplingNullifiers,
+                    CNullifiersMap &mapOrchardNullifiers,
+                    CHistoryCacheMap &historyCacheMap);
+    bool GetStats(CCoinsStats &stats) const;
+};
+
+
+class CCoinsViewCache;
+
+/**
+ * A reference to a mutable cache entry. Encapsulating it allows us to run
+ *  cleanup code after the modification is finished, and keeping track of
+ *  concurrent modifications.
+ */
+class CCoinsModifier
+{
+private:
+    CCoinsViewCache& cache;
+    CCoinsMap::iterator it;
+    size_t cachedCoinUsage; // Cached memory usage of the CCoins object before modification
+    CCoinsModifier(CCoinsViewCache& cache_, CCoinsMap::iterator it_, size_t usage);
+
+public:
+    CCoins* operator->() { return &it->second.coins; }
+    CCoins& operator*() { return it->second.coins; }
+    ~CCoinsModifier();
+    friend class CCoinsViewCache;
+};
+
+/** The set of shielded requirements that might be unsatisfied. */
+enum class UnsatisfiedShieldedReq {
+    SproutDuplicateNullifier,
+    SproutUnknownAnchor,
+    SaplingDuplicateNullifier,
+    SaplingUnknownAnchor,
+    OrchardDuplicateNullifier,
+    OrchardUnknownAnchor,
+};
+
+/** CCoinsView that adds a memory cache for transactions to another CCoinsView */
+class CCoinsViewCache : public CCoinsViewBacked
+{
+protected:
+    /* Whether this cache has an active modifier. */
+    bool hasModifier;
+
+
+    /**
+     * Make mutable so that we can "fill the cache" even from Get-methods
+     * declared as "const".
+     */
+    mutable uint256 hashBlock;
+    mutable CCoinsMap cacheCoins;
+    mutable uint256 hashSproutAnchor;
+    mutable uint256 hashSaplingAnchor;
+    mutable uint256 hashOrchardAnchor;
+    mutable CAnchorsSproutMap cacheSproutAnchors;
+    mutable CAnchorsSaplingMap cacheSaplingAnchors;
+    mutable CAnchorsOrchardMap cacheOrchardAnchors;
+    mutable CNullifiersMap cacheSproutNullifiers;
+    mutable CNullifiersMap cacheSaplingNullifiers;
+    mutable CNullifiersMap cacheOrchardNullifiers;
+    mutable CHistoryCacheMap historyCacheMap;
+
+    /* Cached dynamic memory usage for the inner CCoins objects. */
+    mutable size_t cachedCoinsUsage;
+
+public:
+    CCoinsViewCache(CCoinsView *baseIn);
+    ~CCoinsViewCache();
+
+    // Standard CCoinsView methods
+    bool GetSproutAnchorAt(const uint256 &rt, SproutMerkleTree &tree) const;
+    bool GetSaplingAnchorAt(const uint256 &rt, SaplingMerkleTree &tree) const;
+    bool GetOrchardAnchorAt(const uint256 &rt, OrchardMerkleFrontier &tree) const;
+    bool GetNullifier(const uint256 &nullifier, ShieldedType type) const;
+    bool GetCoins(const uint256 &txid, CCoins &coins) const;
+    bool HaveCoins(const uint256 &txid) const;
+    uint256 GetBestBlock() const;
+    uint256 GetBestAnchor(ShieldedType type) const;
+    HistoryIndex GetHistoryLength(uint32_t epochId) const;
+    HistoryNode GetHistoryAt(uint32_t epochId, HistoryIndex index) const;
+    uint256 GetHistoryRoot(uint32_t epochId) const;
+    void SetBestBlock(const uint256 &hashBlock);
+    bool BatchWrite(CCoinsMap &mapCoins,
+                    const uint256 &hashBlock,
+                    const uint256 &hashSproutAnchor,
+                    const uint256 &hashSaplingAnchor,
+                    const uint256 &hashOrchardAnchor,
+                    CAnchorsSproutMap &mapSproutAnchors,
+                    CAnchorsSaplingMap &mapSaplingAnchors,
+                    CAnchorsOrchardMap &mapOrchardAnchors,
+                    CNullifiersMap &mapSproutNullifiers,
+                    CNullifiersMap &mapSaplingNullifiers,
+                    CNullifiersMap &mapOrchardNullifiers,
+                    CHistoryCacheMap &historyCacheMap);
+
+    // Adds the tree to mapSproutAnchors, mapSaplingAnchors, or mapOrchardAnchors
+    // based on the type of tree and sets the current commitment root to this root.
+    template<typename Tree> void PushAnchor(const Tree &tree);
+
+    // Removes the current commitment root from mapAnchors and sets
+    // the new current root.
+    void PopAnchor(const uint256 &rt, ShieldedType type);
+
+    // Marks nullifiers for a given transaction as spent or not.
+    void SetNullifiers(const CTransaction& tx, bool spent);
+
+    // Push MMR node history at the end of the history tree
+    void PushHistoryNode(uint32_t epochId, const HistoryNode node);
+
+    // Pop MMR node history from the end of the history tree
+    void PopHistoryNode(uint32_t epochId);
+
+    /**
+     * Return a pointer to CCoins in the cache, or NULL if not found. This is
+     * more efficient than GetCoins. Modifications to other cache entries are
+     * allowed while accessing the returned pointer.
+     */
+    const CCoins* AccessCoins(const uint256 &txid) const;
+
+    /**
+     * Return a modifiable reference to a CCoins. If no entry with the given
+     * txid exists, a new one is created. Simultaneous modifications are not
+     * allowed.
+     */
+    CCoinsModifier ModifyCoins(const uint256 &txid);
+
+    /**
+     * Return a modifiable reference to a CCoins. Assumes that no entry with the given
+     * txid exists and creates a new one. This saves a database access in the case where
+     * the coins were to be wiped out by FromTx anyway. We rely on Zcash-derived block chains
+     * having no duplicate transactions, since BIP 30 and (except for the genesis block)
+     * BIP 34 have been enforced since launch. See the Zcash protocol specification, section
+     * "Bitcoin Improvement Proposals". Simultaneous modifications are not allowed.
+     */
+    CCoinsModifier ModifyNewCoins(const uint256 &txid);
+
+    /**
+     * Push the modifications applied to this cache to its base.
+     * Failure to call this method before destruction will cause the changes to be forgotten.
+     * If false is returned, the state of this cache (and its backing view) will be undefined.
+     */
+    bool Flush();
+
+    //! Calculate the size of the cache (in number of transactions)
+    unsigned int GetCacheSize() const;
+
+    //! Calculate the size of the cache (in bytes)
+    size_t DynamicMemoryUsage() const;
+
+    /**
+     * Amount of bitcoins coming in to a transaction
+     * Note that lightweight clients may not know anything besides the hash of previous transactions,
+     * so may not be able to calculate this.
+     *
+     * @param[in] tx	transaction for which we are checking input total
+     * @return	Sum of value of all inputs (scriptSigs), (positive valueBalance or zero) and JoinSplit vpub_new
+     */
+    CAmount GetValueIn(const CTransaction& tx) const;
+
+    //! Check whether all prevouts of the transaction are present in the UTXO set represented by this view
+    bool HaveInputs(const CTransaction& tx) const;
+
+    //! Check whether all joinsplit and sapling spend requirements (anchors/nullifiers) are satisfied
+    std::optional<UnsatisfiedShieldedReq> HaveShieldedRequirements(const CTransaction& tx) const;
+
+    //! Return priority of tx at height nHeight
+    double GetPriority(const CTransaction &tx, int nHeight) const;
+
+    const CTxOut &GetOutputFor(const CTxIn& input) const;
+
+    friend class CCoinsModifier;
+
+private:
+    CCoinsMap::iterator FetchCoins(const uint256 &txid);
+    CCoinsMap::const_iterator FetchCoins(const uint256 &txid) const;
+
+    /**
+     * By making the copy constructor private, we prevent accidentally using it
+     * when one intends to create a cache on top of a base cache.
+     */
+    CCoinsViewCache(const CCoinsViewCache &);
+
+    //! Generalized interface for popping anchors
+    template<typename Tree, typename Cache, typename CacheEntry>
+    void AbstractPopAnchor(
+        const uint256 &newrt,
+        ShieldedType type,
+        Cache &cacheAnchors,
+        uint256 &hash
+    );
+
+    //! Generalized interface for pushing anchors
+    template<typename Tree, typename Cache, typename CacheIterator, typename CacheEntry>
+    void AbstractPushAnchor(
+        const Tree &tree,
+        ShieldedType type,
+        Cache &cacheAnchors,
+        uint256 &hash
+    );
+
+    //! Interface for bringing an anchor into the cache.
+    template<typename Tree>
+    void BringBestAnchorIntoCache(
+        const uint256 &currentRoot,
+        Tree &tree
+    );
+
+    //! Preload history tree for further update.
+    //!
+    //! If extra = true, extra nodes for deletion are also preloaded.
+    //! This will allow to delete tail entries from preloaded tree without
+    //! any further database lookups.
+    //!
+    //! Returns number of peaks, not total number of loaded nodes.
+    uint32_t PreloadHistoryTree(uint32_t epochId, bool extra, std::vector<HistoryEntry> &entries, std::vector<uint32_t> &entry_indices);
+
+    //! Selects history cache for specified epoch.
+    HistoryCache& SelectHistoryCache(uint32_t epochId) const;
+};
+
+#endif // BITCOIN_COINS_H
diff --git a/depend/zcash/src/compat.h b/depend/zcash/src/compat.h
new file mode 100644
index 000000000..5cab5a8c7
--- /dev/null
+++ b/depend/zcash/src/compat.h
@@ -0,0 +1,107 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_COMPAT_H
+#define BITCOIN_COMPAT_H
+
+#if defined(HAVE_CONFIG_H)
+#include "config/bitcoin-config.h"
+#endif
+
+#ifdef WIN32
+#ifndef NOMINMAX
+#define NOMINMAX
+#endif
+#ifdef FD_SETSIZE
+#undef FD_SETSIZE // prevent redefinition compiler warning
+#endif
+#define FD_SETSIZE 1024 // max number of fds in fd_set
+
+#include <winsock2.h>     // Must be included before mswsock.h and windows.h
+
+#include <mswsock.h>
+#include <windows.h>
+#include <ws2tcpip.h>
+#include <stdint.h>
+#else
+#include <fcntl.h>
+#include <sys/mman.h>
+#include <sys/socket.h>
+#include <sys/types.h>
+#include <net/if.h>
+#include <netinet/in.h>
+#include <netinet/tcp.h>
+#include <arpa/inet.h>
+#include <ifaddrs.h>
+#include <limits.h>
+#include <netdb.h>
+#include <unistd.h>
+#endif
+
+#ifdef WIN32
+#define MSG_DONTWAIT        0
+#else
+typedef u_int SOCKET;
+#include "errno.h"
+#define WSAGetLastError()   errno
+#define WSAEINVAL           EINVAL
+#define WSAEALREADY         EALREADY
+#define WSAEWOULDBLOCK      EWOULDBLOCK
+#define WSAEMSGSIZE         EMSGSIZE
+#define WSAEINTR            EINTR
+#define WSAEINPROGRESS      EINPROGRESS
+#define WSAEADDRINUSE       EADDRINUSE
+#define WSAENOTSOCK         EBADF
+#define INVALID_SOCKET      (SOCKET)(~0)
+#define SOCKET_ERROR        -1
+#endif
+
+#ifdef WIN32
+#ifndef S_IRUSR
+#define S_IRUSR             0400
+#define S_IWUSR             0200
+#endif
+#else
+#define MAX_PATH            1024
+#endif
+#ifdef _MSC_VER
+#if !defined(ssize_t)
+#ifdef _WIN64
+typedef int64_t ssize_t;
+#else
+typedef int32_t ssize_t;
+#endif
+#endif
+#endif
+
+// As Solaris does not have the MSG_NOSIGNAL flag for send(2) syscall, it is defined as 0
+#if !defined(HAVE_MSG_NOSIGNAL) && !defined(MSG_NOSIGNAL)
+#define MSG_NOSIGNAL 0
+#endif
+
+#ifndef WIN32
+// PRIO_MAX is not defined on Solaris
+#ifndef PRIO_MAX
+#define PRIO_MAX 20
+#endif
+#define THREAD_PRIORITY_LOWEST          PRIO_MAX
+#define THREAD_PRIORITY_BELOW_NORMAL    2
+#define THREAD_PRIORITY_NORMAL          0
+#define THREAD_PRIORITY_ABOVE_NORMAL    (-2)
+#endif
+
+#if HAVE_DECL_STRNLEN == 0
+size_t strnlen( const char *start, size_t max_len);
+#endif // HAVE_DECL_STRNLEN
+
+bool static inline IsSelectableSocket(SOCKET s) {
+#ifdef WIN32
+    return true;
+#else
+    return (s < FD_SETSIZE);
+#endif
+}
+
+#endif // BITCOIN_COMPAT_H
diff --git a/depend/zcash/src/compat/byteswap.h b/depend/zcash/src/compat/byteswap.h
new file mode 100644
index 000000000..f5cbc9f7e
--- /dev/null
+++ b/depend/zcash/src/compat/byteswap.h
@@ -0,0 +1,47 @@
+// Copyright (c) 2014 The Bitcoin developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_COMPAT_BYTESWAP_H
+#define BITCOIN_COMPAT_BYTESWAP_H
+
+#if defined(HAVE_CONFIG_H)
+#include "config/bitcoin-config.h"
+#endif
+
+#include <stdint.h>
+
+#if defined(HAVE_BYTESWAP_H)
+#include <byteswap.h>
+#endif
+
+#if HAVE_DECL_BSWAP_16 == 0
+inline uint16_t bswap_16(uint16_t x)
+{
+    return (x >> 8) | ((x & 0x00ff) << 8);
+}
+#endif // HAVE_DECL_BSWAP16
+
+#if HAVE_DECL_BSWAP_32 == 0
+inline uint32_t bswap_32(uint32_t x)
+{
+    return (((x & 0xff000000U) >> 24) | ((x & 0x00ff0000U) >>  8) |
+            ((x & 0x0000ff00U) <<  8) | ((x & 0x000000ffU) << 24));
+}
+#endif // HAVE_DECL_BSWAP32
+
+#if HAVE_DECL_BSWAP_64 == 0
+inline uint64_t bswap_64(uint64_t x)
+{
+     return (((x & 0xff00000000000000ull) >> 56)
+          | ((x & 0x00ff000000000000ull) >> 40)
+          | ((x & 0x0000ff0000000000ull) >> 24)
+          | ((x & 0x000000ff00000000ull) >> 8)
+          | ((x & 0x00000000ff000000ull) << 8)
+          | ((x & 0x0000000000ff0000ull) << 24)
+          | ((x & 0x000000000000ff00ull) << 40)
+          | ((x & 0x00000000000000ffull) << 56));
+}
+#endif // HAVE_DECL_BSWAP64
+
+#endif // BITCOIN_COMPAT_BYTESWAP_H
diff --git a/depend/zcash/src/compat/endian.h b/depend/zcash/src/compat/endian.h
new file mode 100644
index 000000000..31c5d534a
--- /dev/null
+++ b/depend/zcash/src/compat/endian.h
@@ -0,0 +1,241 @@
+// Copyright (c) 2014 The Bitcoin developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_COMPAT_ENDIAN_H
+#define BITCOIN_COMPAT_ENDIAN_H
+
+#if defined(HAVE_CONFIG_H)
+#include "config/bitcoin-config.h"
+#endif
+
+#include <stdint.h>
+
+#include "compat/byteswap.h"
+
+#if defined(HAVE_ENDIAN_H)
+#include <endian.h>
+#elif defined(HAVE_SYS_ENDIAN_H)
+#include <sys/endian.h>
+#endif
+
+#ifndef HAVE_CONFIG_H
+// While not technically a supported configuration, defaulting to defining these
+// DECLs when we were compiled without autotools makes it easier for other build
+// systems to build things like libbitcoinconsensus for strange targets.
+#ifdef htobe16
+#define HAVE_DECL_HTOBE16 1
+#endif
+#ifdef htole16
+#define HAVE_DECL_HTOLE16 1
+#endif
+#ifdef be16toh
+#define HAVE_DECL_BE16TOH 1
+#endif
+#ifdef le16toh
+#define HAVE_DECL_LE16TOH 1
+#endif
+
+#ifdef htobe32
+#define HAVE_DECL_HTOBE32 1
+#endif
+#ifdef htole32
+#define HAVE_DECL_HTOLE32 1
+#endif
+#ifdef be32toh
+#define HAVE_DECL_BE32TOH 1
+#endif
+#ifdef le32toh
+#define HAVE_DECL_LE32TOH 1
+#endif
+
+#ifdef htobe64
+#define HAVE_DECL_HTOBE64 1
+#endif
+#ifdef htole64
+#define HAVE_DECL_HTOLE64 1
+#endif
+#ifdef be64toh
+#define HAVE_DECL_BE64TOH 1
+#endif
+#ifdef le64toh
+#define HAVE_DECL_LE64TOH 1
+#endif
+
+#endif // HAVE_CONFIG_H
+
+#if defined(WORDS_BIGENDIAN)
+
+#if HAVE_DECL_HTOBE16 == 0
+inline uint16_t htobe16(uint16_t host_16bits)
+{
+    return host_16bits;
+}
+#endif // HAVE_DECL_HTOBE16
+
+#if HAVE_DECL_HTOLE16 == 0
+inline uint16_t htole16(uint16_t host_16bits)
+{
+    return bswap_16(host_16bits);
+}
+#endif // HAVE_DECL_HTOLE16
+
+#if HAVE_DECL_BE16TOH == 0
+inline uint16_t be16toh(uint16_t big_endian_16bits)
+{
+    return big_endian_16bits;
+}
+#endif // HAVE_DECL_BE16TOH
+
+#if HAVE_DECL_LE16TOH == 0
+inline uint16_t le16toh(uint16_t little_endian_16bits)
+{
+    return bswap_16(little_endian_16bits);
+}
+#endif // HAVE_DECL_LE16TOH
+
+#if HAVE_DECL_HTOBE32 == 0
+inline uint32_t htobe32(uint32_t host_32bits)
+{
+    return host_32bits;
+}
+#endif // HAVE_DECL_HTOBE32
+
+#if HAVE_DECL_HTOLE32 == 0
+inline uint32_t htole32(uint32_t host_32bits)
+{
+    return bswap_32(host_32bits);
+}
+#endif // HAVE_DECL_HTOLE32
+
+#if HAVE_DECL_BE32TOH == 0
+inline uint32_t be32toh(uint32_t big_endian_32bits)
+{
+    return big_endian_32bits;
+}
+#endif // HAVE_DECL_BE32TOH
+
+#if HAVE_DECL_LE32TOH == 0
+inline uint32_t le32toh(uint32_t little_endian_32bits)
+{
+    return bswap_32(little_endian_32bits);
+}
+#endif // HAVE_DECL_LE32TOH
+
+#if HAVE_DECL_HTOBE64 == 0
+inline uint64_t htobe64(uint64_t host_64bits)
+{
+    return host_64bits;
+}
+#endif // HAVE_DECL_HTOBE64
+
+#if HAVE_DECL_HTOLE64 == 0
+inline uint64_t htole64(uint64_t host_64bits)
+{
+    return bswap_64(host_64bits);
+}
+#endif // HAVE_DECL_HTOLE64
+
+#if HAVE_DECL_BE64TOH == 0
+inline uint64_t be64toh(uint64_t big_endian_64bits)
+{
+    return big_endian_64bits;
+}
+#endif // HAVE_DECL_BE64TOH
+
+#if HAVE_DECL_LE64TOH == 0
+inline uint64_t le64toh(uint64_t little_endian_64bits)
+{
+    return bswap_64(little_endian_64bits);
+}
+#endif // HAVE_DECL_LE64TOH
+
+#else // WORDS_BIGENDIAN
+
+#if HAVE_DECL_HTOBE16 == 0
+inline uint16_t htobe16(uint16_t host_16bits)
+{
+    return bswap_16(host_16bits);
+}
+#endif // HAVE_DECL_HTOBE16
+
+#if HAVE_DECL_HTOLE16 == 0
+inline uint16_t htole16(uint16_t host_16bits)
+{
+    return host_16bits;
+}
+#endif // HAVE_DECL_HTOLE16
+
+#if HAVE_DECL_BE16TOH == 0
+inline uint16_t be16toh(uint16_t big_endian_16bits)
+{
+    return bswap_16(big_endian_16bits);
+}
+#endif // HAVE_DECL_BE16TOH
+
+#if HAVE_DECL_LE16TOH == 0
+inline uint16_t le16toh(uint16_t little_endian_16bits)
+{
+    return little_endian_16bits;
+}
+#endif // HAVE_DECL_LE16TOH
+
+#if HAVE_DECL_HTOBE32 == 0
+inline uint32_t htobe32(uint32_t host_32bits)
+{
+    return bswap_32(host_32bits);
+}
+#endif // HAVE_DECL_HTOBE32
+
+#if HAVE_DECL_HTOLE32 == 0
+inline uint32_t htole32(uint32_t host_32bits)
+{
+    return host_32bits;
+}
+#endif // HAVE_DECL_HTOLE32
+
+#if HAVE_DECL_BE32TOH == 0
+inline uint32_t be32toh(uint32_t big_endian_32bits)
+{
+    return bswap_32(big_endian_32bits);
+}
+#endif // HAVE_DECL_BE32TOH
+
+#if HAVE_DECL_LE32TOH == 0
+inline uint32_t le32toh(uint32_t little_endian_32bits)
+{
+    return little_endian_32bits;
+}
+#endif // HAVE_DECL_LE32TOH
+
+#if HAVE_DECL_HTOBE64 == 0
+inline uint64_t htobe64(uint64_t host_64bits)
+{
+    return bswap_64(host_64bits);
+}
+#endif // HAVE_DECL_HTOBE64
+
+#if HAVE_DECL_HTOLE64 == 0
+inline uint64_t htole64(uint64_t host_64bits)
+{
+    return host_64bits;
+}
+#endif // HAVE_DECL_HTOLE64
+
+#if HAVE_DECL_BE64TOH == 0
+inline uint64_t be64toh(uint64_t big_endian_64bits)
+{
+    return bswap_64(big_endian_64bits);
+}
+#endif // HAVE_DECL_BE64TOH
+
+#if HAVE_DECL_LE64TOH == 0
+inline uint64_t le64toh(uint64_t little_endian_64bits)
+{
+    return little_endian_64bits;
+}
+#endif // HAVE_DECL_LE64TOH
+
+#endif // WORDS_BIGENDIAN
+
+#endif // BITCOIN_COMPAT_ENDIAN_H
diff --git a/depend/zcash/src/compat/glibc_compat.cpp b/depend/zcash/src/compat/glibc_compat.cpp
new file mode 100644
index 000000000..a80137cd8
--- /dev/null
+++ b/depend/zcash/src/compat/glibc_compat.cpp
@@ -0,0 +1,29 @@
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#if defined(HAVE_CONFIG_H)
+#include "config/bitcoin-config.h"
+#endif
+
+#include <cstddef>
+
+#if defined(HAVE_SYS_SELECT_H)
+#include <sys/select.h>
+#endif
+
+// Prior to GLIBC_2.14, memcpy was aliased to memmove.
+extern "C" void* memmove(void* a, const void* b, size_t c);
+extern "C" void* memcpy(void* a, const void* b, size_t c)
+{
+    return memmove(a, b, c);
+}
+
+extern "C" void __chk_fail(void) __attribute__((__noreturn__));
+extern "C" FDELT_TYPE __fdelt_warn(FDELT_TYPE a)
+{
+    if (a >= FD_SETSIZE)
+        __chk_fail();
+    return a / __NFDBITS;
+}
+extern "C" FDELT_TYPE __fdelt_chk(FDELT_TYPE) __attribute__((weak, alias("__fdelt_warn")));
diff --git a/depend/zcash/src/compat/glibc_sanity.cpp b/depend/zcash/src/compat/glibc_sanity.cpp
new file mode 100644
index 000000000..71402559d
--- /dev/null
+++ b/depend/zcash/src/compat/glibc_sanity.cpp
@@ -0,0 +1,68 @@
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#if defined(HAVE_CONFIG_H)
+#include "config/bitcoin-config.h"
+#endif
+
+#include <cstddef>
+
+#if defined(HAVE_SYS_SELECT_H)
+#include <sys/select.h>
+#endif
+
+extern "C" void* memcpy(void* a, const void* b, size_t c);
+void* memcpy_int(void* a, const void* b, size_t c)
+{
+    return memcpy(a, b, c);
+}
+
+namespace
+{
+// trigger: Use the memcpy_int wrapper which calls our internal memcpy.
+//   A direct call to memcpy may be optimized away by the compiler.
+// test: Fill an array with a sequence of integers. memcpy to a new empty array.
+//   Verify that the arrays are equal. Use an odd size to decrease the odds of
+//   the call being optimized away.
+template <unsigned int T>
+bool sanity_test_memcpy()
+{
+    unsigned int memcpy_test[T];
+    unsigned int memcpy_verify[T] = {};
+    for (unsigned int i = 0; i != T; ++i)
+        memcpy_test[i] = i;
+
+    memcpy_int(memcpy_verify, memcpy_test, sizeof(memcpy_test));
+
+    for (unsigned int i = 0; i != T; ++i) {
+        if (memcpy_verify[i] != i)
+            return false;
+    }
+    return true;
+}
+
+#if defined(HAVE_SYS_SELECT_H)
+// trigger: Call FD_SET to trigger __fdelt_chk. FORTIFY_SOURCE must be defined
+//   as >0 and optimizations must be set to at least -O2.
+// test: Add a file descriptor to an empty fd_set. Verify that it has been
+//   correctly added.
+bool sanity_test_fdelt()
+{
+    fd_set fds;
+    FD_ZERO(&fds);
+    FD_SET(0, &fds);
+    return FD_ISSET(0, &fds);
+}
+#endif
+
+} // anon namespace
+
+bool glibc_sanity_test()
+{
+#if defined(HAVE_SYS_SELECT_H)
+    if (!sanity_test_fdelt())
+        return false;
+#endif
+    return sanity_test_memcpy<1025>();
+}
diff --git a/depend/zcash/src/compat/glibcxx_sanity.cpp b/depend/zcash/src/compat/glibcxx_sanity.cpp
new file mode 100644
index 000000000..bbba438ea
--- /dev/null
+++ b/depend/zcash/src/compat/glibcxx_sanity.cpp
@@ -0,0 +1,61 @@
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include <list>
+#include <locale>
+#include <stdexcept>
+
+namespace
+{
+// trigger: use ctype<char>::widen to trigger ctype<char>::_M_widen_init().
+// test: convert a char from narrow to wide and back. Verify that the result
+//   matches the original.
+bool sanity_test_widen(char testchar)
+{
+    const std::ctype<char>& test(std::use_facet<std::ctype<char> >(std::locale()));
+    return test.narrow(test.widen(testchar), 'b') == testchar;
+}
+
+// trigger: use list::push_back and list::pop_back to trigger _M_hook and
+//   _M_unhook.
+// test: Push a sequence of integers into a list. Pop them off and verify that
+//   they match the original sequence.
+bool sanity_test_list(unsigned int size)
+{
+    std::list<unsigned int> test;
+    for (unsigned int i = 0; i != size; ++i)
+        test.push_back(i + 1);
+
+    if (test.size() != size)
+        return false;
+
+    while (!test.empty()) {
+        if (test.back() != test.size())
+            return false;
+        test.pop_back();
+    }
+    return true;
+}
+
+} // anon namespace
+
+// trigger: string::at(x) on an empty string to trigger __throw_out_of_range_fmt.
+// test: force std::string to throw an out_of_range exception. Verify that
+//   it's caught correctly.
+bool sanity_test_range_fmt()
+{
+    std::string test;
+    try {
+        test.at(1);
+    } catch (const std::out_of_range&) {
+        return true;
+    } catch (...) {
+    }
+    return false;
+}
+
+bool glibcxx_sanity_test()
+{
+    return sanity_test_widen('a') && sanity_test_list(100) && sanity_test_range_fmt();
+}
diff --git a/depend/zcash/src/compat/sanity.h b/depend/zcash/src/compat/sanity.h
new file mode 100644
index 000000000..64dcade78
--- /dev/null
+++ b/depend/zcash/src/compat/sanity.h
@@ -0,0 +1,11 @@
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_COMPAT_SANITY_H
+#define BITCOIN_COMPAT_SANITY_H
+
+bool glibc_sanity_test();
+bool glibcxx_sanity_test();
+
+#endif // BITCOIN_COMPAT_SANITY_H
diff --git a/depend/zcash/src/compat/strnlen.cpp b/depend/zcash/src/compat/strnlen.cpp
new file mode 100644
index 000000000..1a56310af
--- /dev/null
+++ b/depend/zcash/src/compat/strnlen.cpp
@@ -0,0 +1,18 @@
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#if defined(HAVE_CONFIG_H)
+#include "config/bitcoin-config.h"
+#endif
+
+#include <cstring>
+
+#if HAVE_DECL_STRNLEN == 0
+size_t strnlen( const char *start, size_t max_len)
+{
+    const char *end = (const char *)memchr(start, '\0', max_len);
+
+    return end ? (size_t)(end - start) : max_len;
+}
+#endif // HAVE_DECL_STRNLEN
diff --git a/depend/zcash/src/compressor.cpp b/depend/zcash/src/compressor.cpp
new file mode 100644
index 000000000..e91897149
--- /dev/null
+++ b/depend/zcash/src/compressor.cpp
@@ -0,0 +1,185 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "compressor.h"
+
+#include "hash.h"
+#include "pubkey.h"
+#include "script/standard.h"
+
+bool CScriptCompressor::IsToKeyID(CKeyID &hash) const
+{
+    if (script.size() == 25 && script[0] == OP_DUP && script[1] == OP_HASH160
+                            && script[2] == 20 && script[23] == OP_EQUALVERIFY
+                            && script[24] == OP_CHECKSIG) {
+        memcpy(&hash, &script[3], 20);
+        return true;
+    }
+    return false;
+}
+
+bool CScriptCompressor::IsToScriptID(CScriptID &hash) const
+{
+    if (script.size() == 23 && script[0] == OP_HASH160 && script[1] == 20
+                            && script[22] == OP_EQUAL) {
+        memcpy(&hash, &script[2], 20);
+        return true;
+    }
+    return false;
+}
+
+bool CScriptCompressor::IsToPubKey(CPubKey &pubkey) const
+{
+    if (script.size() == 35 && script[0] == 33 && script[34] == OP_CHECKSIG
+                            && (script[1] == 0x02 || script[1] == 0x03)) {
+        pubkey.Set(&script[1], &script[34]);
+        return true;
+    }
+    if (script.size() == 67 && script[0] == 65 && script[66] == OP_CHECKSIG
+                            && script[1] == 0x04) {
+        pubkey.Set(&script[1], &script[66]);
+        return pubkey.IsFullyValid(); // if not fully valid, a case that would not be compressible
+    }
+    return false;
+}
+
+bool CScriptCompressor::Compress(std::vector<unsigned char> &out) const
+{
+    CKeyID keyID;
+    if (IsToKeyID(keyID)) {
+        out.resize(21);
+        out[0] = 0x00;
+        memcpy(&out[1], &keyID, 20);
+        return true;
+    }
+    CScriptID scriptID;
+    if (IsToScriptID(scriptID)) {
+        out.resize(21);
+        out[0] = 0x01;
+        memcpy(&out[1], &scriptID, 20);
+        return true;
+    }
+    CPubKey pubkey;
+    if (IsToPubKey(pubkey)) {
+        out.resize(33);
+        memcpy(&out[1], &pubkey[1], 32);
+        if (pubkey[0] == 0x02 || pubkey[0] == 0x03) {
+            out[0] = pubkey[0];
+            return true;
+        } else if (pubkey[0] == 0x04) {
+            out[0] = 0x04 | (pubkey[64] & 0x01);
+            return true;
+        }
+    }
+    return false;
+}
+
+unsigned int CScriptCompressor::GetSpecialSize(unsigned int nSize) const
+{
+    if (nSize == 0 || nSize == 1)
+        return 20;
+    if (nSize == 2 || nSize == 3 || nSize == 4 || nSize == 5)
+        return 32;
+    return 0;
+}
+
+bool CScriptCompressor::Decompress(unsigned int nSize, const std::vector<unsigned char> &in)
+{
+    switch(nSize) {
+    case 0x00:
+        script.resize(25);
+        script[0] = OP_DUP;
+        script[1] = OP_HASH160;
+        script[2] = 20;
+        memcpy(&script[3], &in[0], 20);
+        script[23] = OP_EQUALVERIFY;
+        script[24] = OP_CHECKSIG;
+        return true;
+    case 0x01:
+        script.resize(23);
+        script[0] = OP_HASH160;
+        script[1] = 20;
+        memcpy(&script[2], &in[0], 20);
+        script[22] = OP_EQUAL;
+        return true;
+    case 0x02:
+    case 0x03:
+        script.resize(35);
+        script[0] = 33;
+        script[1] = nSize;
+        memcpy(&script[2], &in[0], 32);
+        script[34] = OP_CHECKSIG;
+        return true;
+    case 0x04:
+    case 0x05:
+        unsigned char vch[33] = {};
+        vch[0] = nSize - 2;
+        memcpy(&vch[1], &in[0], 32);
+        CPubKey pubkey(&vch[0], &vch[33]);
+        if (!pubkey.Decompress())
+            return false;
+        assert(pubkey.size() == 65);
+        script.resize(67);
+        script[0] = 65;
+        memcpy(&script[1], pubkey.begin(), 65);
+        script[66] = OP_CHECKSIG;
+        return true;
+    }
+    return false;
+}
+
+// Amount compression:
+// * If the amount is 0, output 0
+// * first, divide the amount (in base units) by the largest power of 10 possible; call the exponent e (e is max 9)
+// * if e<9, the last digit of the resulting number cannot be 0; store it as d, and drop it (divide by 10)
+//   * call the result n
+//   * output 1 + 10*(9*n + d - 1) + e
+// * if e==9, we only know the resulting number is not zero, so output 1 + 10*(n - 1) + 9
+// (this is decodable, as d is in [1-9] and e is in [0-9])
+
+uint64_t CTxOutCompressor::CompressAmount(uint64_t n)
+{
+    if (n == 0)
+        return 0;
+    int e = 0;
+    while (((n % 10) == 0) && e < 9) {
+        n /= 10;
+        e++;
+    }
+    if (e < 9) {
+        int d = (n % 10);
+        assert(d >= 1 && d <= 9);
+        n /= 10;
+        return 1 + (n*9 + d - 1)*10 + e;
+    } else {
+        return 1 + (n - 1)*10 + 9;
+    }
+}
+
+uint64_t CTxOutCompressor::DecompressAmount(uint64_t x)
+{
+    // x = 0  OR  x = 1+10*(9*n + d - 1) + e  OR  x = 1+10*(n - 1) + 9
+    if (x == 0)
+        return 0;
+    x--;
+    // x = 10*(9*n + d - 1) + e
+    int e = x % 10;
+    x /= 10;
+    uint64_t n = 0;
+    if (e < 9) {
+        // x = 9*n + d - 1
+        int d = (x % 9) + 1;
+        x /= 9;
+        // x = n
+        n = x*10 + d;
+    } else {
+        n = x+1;
+    }
+    while (e) {
+        n *= 10;
+        e--;
+    }
+    return n;
+}
diff --git a/depend/zcash/src/compressor.h b/depend/zcash/src/compressor.h
new file mode 100644
index 000000000..e9c2cbdbb
--- /dev/null
+++ b/depend/zcash/src/compressor.h
@@ -0,0 +1,121 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_COMPRESSOR_H
+#define BITCOIN_COMPRESSOR_H
+
+#include "primitives/transaction.h"
+#include "script/script.h"
+#include "serialize.h"
+
+class CKeyID;
+class CPubKey;
+class CScriptID;
+
+/** Compact serializer for scripts.
+ *
+ *  It detects common cases and encodes them much more efficiently.
+ *  3 special cases are defined:
+ *  * Pay to pubkey hash (encoded as 21 bytes)
+ *  * Pay to script hash (encoded as 21 bytes)
+ *  * Pay to pubkey starting with 0x02, 0x03 or 0x04 (encoded as 33 bytes)
+ *
+ *  Other scripts up to 121 bytes require 1 byte + script length. Above
+ *  that, scripts up to 16505 bytes require 2 bytes + script length.
+ */
+class CScriptCompressor
+{
+private:
+    /**
+     * make this static for now (there are only 6 special scripts defined)
+     * this can potentially be extended together with a new nVersion for
+     * transactions, in which case this value becomes dependent on nVersion
+     * and nHeight of the enclosing transaction.
+     */
+    static const unsigned int nSpecialScripts = 6;
+
+    CScript &script;
+protected:
+    /**
+     * These check for scripts for which a special case with a shorter encoding is defined.
+     * They are implemented separately from the CScript test, as these test for exact byte
+     * sequence correspondences, and are more strict. For example, IsToPubKey also verifies
+     * whether the public key is valid (as invalid ones cannot be represented in compressed
+     * form).
+     */
+    bool IsToKeyID(CKeyID &hash) const;
+    bool IsToScriptID(CScriptID &hash) const;
+    bool IsToPubKey(CPubKey &pubkey) const;
+
+    bool Compress(std::vector<unsigned char> &out) const;
+    unsigned int GetSpecialSize(unsigned int nSize) const;
+    bool Decompress(unsigned int nSize, const std::vector<unsigned char> &out);
+public:
+    CScriptCompressor(CScript &scriptIn) : script(scriptIn) { }
+
+    template<typename Stream>
+    void Serialize(Stream &s) const {
+        std::vector<unsigned char> compr;
+        if (Compress(compr)) {
+            s << CFlatData(compr);
+            return;
+        }
+        unsigned int nSize = script.size() + nSpecialScripts;
+        s << VARINT(nSize);
+        s << CFlatData(script);
+    }
+
+    template<typename Stream>
+    void Unserialize(Stream &s) {
+        unsigned int nSize = 0;
+        s >> VARINT(nSize);
+        if (nSize < nSpecialScripts) {
+            std::vector<unsigned char> vch(GetSpecialSize(nSize), 0x00);
+            s >> REF(CFlatData(vch));
+            Decompress(nSize, vch);
+            return;
+        }
+        nSize -= nSpecialScripts;
+        if (nSize > MAX_SCRIPT_SIZE) {
+            // Overly long script, replace with a short invalid one
+            script << OP_RETURN;
+            s.ignore(nSize);
+        } else {
+            script.resize(nSize);
+            s >> REF(CFlatData(script));
+        }
+    }
+};
+
+/** wrapper for CTxOut that provides a more compact serialization */
+class CTxOutCompressor
+{
+private:
+    CTxOut &txout;
+
+public:
+    static uint64_t CompressAmount(uint64_t nAmount);
+    static uint64_t DecompressAmount(uint64_t nAmount);
+
+    CTxOutCompressor(CTxOut &txoutIn) : txout(txoutIn) { }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        if (!ser_action.ForRead()) {
+            uint64_t nVal = CompressAmount(txout.nValue);
+            READWRITE(VARINT(nVal));
+        } else {
+            uint64_t nVal = 0;
+            READWRITE(VARINT(nVal));
+            txout.nValue = DecompressAmount(nVal);
+        }
+        CScriptCompressor cscript(REF(txout.scriptPubKey));
+        READWRITE(cscript);
+    }
+};
+
+#endif // BITCOIN_COMPRESSOR_H
diff --git a/depend/zcash/src/config/.empty b/depend/zcash/src/config/.empty
new file mode 100644
index 000000000..e69de29bb
diff --git a/depend/zcash/src/consensus/consensus.h b/depend/zcash/src/consensus/consensus.h
new file mode 100644
index 000000000..7a1981bdd
--- /dev/null
+++ b/depend/zcash/src/consensus/consensus.h
@@ -0,0 +1,50 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_CONSENSUS_CONSENSUS_H
+#define BITCOIN_CONSENSUS_CONSENSUS_H
+
+#include <stdint.h>
+
+/** The minimum allowed block version (network rule) */
+static const int32_t MIN_BLOCK_VERSION = 4;
+/** The minimum allowed transaction version (network rule) */
+static const int32_t SPROUT_MIN_TX_VERSION = 1;
+/** The minimum allowed Overwinter transaction version (network rule) */
+static const int32_t OVERWINTER_MIN_TX_VERSION = 3;
+/** The maximum allowed Overwinter transaction version (network rule) */
+static const int32_t OVERWINTER_MAX_TX_VERSION = 3;
+/** The minimum allowed Sapling transaction version (network rule) */
+static const int32_t SAPLING_MIN_TX_VERSION = 4;
+/** The maximum allowed Sapling transaction version (network rule) */
+static const int32_t SAPLING_MAX_TX_VERSION = 4;
+/** The minimum allowed ZIP225 transaction version (network rule) */
+static const int32_t ZIP225_MIN_TX_VERSION = 5;
+/** The maximum allowed ZIP225 transaction version (network rule) */
+static const int32_t ZIP225_MAX_TX_VERSION = 5;
+/** The maximum allowed size for a serialized block, in bytes (network rule) */
+static const unsigned int MAX_BLOCK_SIZE = 2000000;
+/** The maximum allowed number of signature check operations in a block (network rule) */
+static const unsigned int MAX_BLOCK_SIGOPS = 20000;
+/** The maximum size of a transaction (network rule) */
+static const unsigned int MAX_TX_SIZE_BEFORE_SAPLING = 100000;
+static const unsigned int MAX_TX_SIZE_AFTER_SAPLING = MAX_BLOCK_SIZE;
+/** Coinbase transaction outputs can only be spent after this number of new blocks (network rule) */
+static const int COINBASE_MATURITY = 100;
+/** The minimum value which is invalid for expiry height, used by CTransaction and CMutableTransaction */
+static constexpr uint32_t TX_EXPIRY_HEIGHT_THRESHOLD = 500000000;
+/** The number of blocks after Canopy activation after which v1 plaintexts will be rejected */
+static const unsigned int ZIP212_GRACE_PERIOD = 32256;
+
+/** Flags for LockTime() */
+enum {
+    /* Use GetMedianTimePast() instead of nTime for end point timestamp. */
+    LOCKTIME_MEDIAN_TIME_PAST = (1 << 1),
+};
+
+/** Used as the flags parameter to CheckFinalTx() in non-consensus code */
+static const unsigned int STANDARD_LOCKTIME_VERIFY_FLAGS = LOCKTIME_MEDIAN_TIME_PAST;
+
+#endif // BITCOIN_CONSENSUS_CONSENSUS_H
diff --git a/depend/zcash/src/consensus/funding.cpp b/depend/zcash/src/consensus/funding.cpp
new file mode 100644
index 000000000..7cec13080
--- /dev/null
+++ b/depend/zcash/src/consensus/funding.cpp
@@ -0,0 +1,94 @@
+// Copyright (c) 2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include <consensus/funding.h>
+
+namespace Consensus
+{
+/**
+ * General information about each funding stream.
+ * Ordered by Consensus::FundingStreamIndex.
+ */
+constexpr struct FSInfo FundingStreamInfo[Consensus::MAX_FUNDING_STREAMS] = {
+    {
+        .recipient = "Electric Coin Company",
+        .specification = "https://zips.z.cash/zip-0214",
+        .valueNumerator = 7,
+        .valueDenominator = 100,
+    },
+    {
+        .recipient = "Zcash Foundation",
+        .specification = "https://zips.z.cash/zip-0214",
+        .valueNumerator = 5,
+        .valueDenominator = 100,
+    },
+    {
+        .recipient = "Major Grants",
+        .specification = "https://zips.z.cash/zip-0214",
+        .valueNumerator = 8,
+        .valueDenominator = 100,
+    }
+};
+
+static constexpr bool validateFundingStreamInfo(uint32_t idx) {
+    return (idx >= Consensus::MAX_FUNDING_STREAMS || (
+        FundingStreamInfo[idx].valueNumerator < FundingStreamInfo[idx].valueDenominator &&
+        FundingStreamInfo[idx].valueNumerator < (INT64_MAX / MAX_MONEY) &&
+        validateFundingStreamInfo(idx + 1)));
+}
+static_assert(
+    validateFundingStreamInfo(Consensus::FIRST_FUNDING_STREAM),
+    "Invalid FundingStreamInfo");
+
+CAmount FSInfo::Value(CAmount blockSubsidy) const
+{
+    // Integer division is floor division for nonnegative integers in C++
+    return CAmount((blockSubsidy * valueNumerator) / valueDenominator);
+}
+
+std::set<FundingStreamElement> GetActiveFundingStreamElements(
+    int nHeight,
+    CAmount blockSubsidy,
+    const Consensus::Params& params)
+{
+    std::set<std::pair<FundingStreamAddress, CAmount>> requiredElements;
+
+    // Funding streams are disabled if Canopy is not active.
+    if (params.NetworkUpgradeActive(nHeight, Consensus::UPGRADE_CANOPY)) {
+        for (uint32_t idx = Consensus::FIRST_FUNDING_STREAM; idx < Consensus::MAX_FUNDING_STREAMS; idx++) {
+            // The following indexed access is safe as Consensus::MAX_FUNDING_STREAMS is used
+            // in the definition of vFundingStreams.
+            auto fs = params.vFundingStreams[idx];
+            // Funding period is [startHeight, endHeight)
+            if (fs && nHeight >= fs.value().GetStartHeight() && nHeight < fs.value().GetEndHeight()) {
+                requiredElements.insert(std::make_pair(
+                    fs.value().RecipientAddress(params, nHeight),
+                    FundingStreamInfo[idx].Value(blockSubsidy)));
+            }
+        }
+    }
+
+    return requiredElements;
+};
+
+std::vector<FSInfo> GetActiveFundingStreams(
+    int nHeight,
+    const Consensus::Params& params)
+{
+    std::vector<FSInfo> activeStreams;
+
+    // Funding streams are disabled if Canopy is not active.
+    if (params.NetworkUpgradeActive(nHeight, Consensus::UPGRADE_CANOPY)) {
+        for (uint32_t idx = Consensus::FIRST_FUNDING_STREAM; idx < Consensus::MAX_FUNDING_STREAMS; idx++) {
+            auto fs = params.vFundingStreams[idx];
+            if (fs && nHeight >= fs.value().GetStartHeight() && nHeight < fs.value().GetEndHeight()) {
+                activeStreams.push_back(FundingStreamInfo[idx]);
+            }
+        }
+    }
+
+    return activeStreams;
+};
+
+} // namespace Consensus
diff --git a/depend/zcash/src/consensus/funding.h b/depend/zcash/src/consensus/funding.h
new file mode 100644
index 000000000..91230db2b
--- /dev/null
+++ b/depend/zcash/src/consensus/funding.h
@@ -0,0 +1,45 @@
+// Copyright (c) 2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_CONSENSUS_FUNDING_H
+#define ZCASH_CONSENSUS_FUNDING_H
+
+#include <amount.h>
+#include <consensus/params.h>
+
+
+namespace Consensus
+{
+
+struct FSInfo {
+    const char* recipient;
+    const char* specification;
+    uint64_t valueNumerator;
+    uint64_t valueDenominator;
+
+    /**
+     * Returns the inherent value of this funding stream.
+     *
+     * For the active funding streams at a given height, use
+     * GetActiveFundingStreams() or GetActiveFundingStreamElements().
+     */
+    CAmount Value(CAmount blockSubsidy) const;
+};
+
+extern const struct FSInfo FundingStreamInfo[];
+
+typedef std::pair<FundingStreamAddress, CAmount> FundingStreamElement;
+
+std::set<FundingStreamElement> GetActiveFundingStreamElements(
+    int nHeight,
+    CAmount blockSubsidy,
+    const Consensus::Params& params);
+
+std::vector<FSInfo> GetActiveFundingStreams(
+    int nHeight,
+    const Consensus::Params& params);
+
+} // namespace Consensus
+
+#endif // ZCASH_CONSENSUS_FUNDING_H
diff --git a/depend/zcash/src/consensus/params.cpp b/depend/zcash/src/consensus/params.cpp
new file mode 100644
index 000000000..53c257a86
--- /dev/null
+++ b/depend/zcash/src/consensus/params.cpp
@@ -0,0 +1,249 @@
+// Copyright (c) 2019 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "params.h"
+
+#include <amount.h>
+#include <key_io.h>
+#include <script/standard.h>
+#include "upgrades.h"
+#include "util.h"
+#include "util/match.h"
+
+namespace Consensus {
+    std::optional<int> Params::GetActivationHeight(Consensus::UpgradeIndex idx) const {
+        auto nActivationHeight = vUpgrades[idx].nActivationHeight;
+        if (nActivationHeight == Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT) {
+            return std::nullopt;
+        } else {
+            return nActivationHeight;
+        }
+    }
+
+    bool Params::NetworkUpgradeActive(int nHeight, Consensus::UpgradeIndex idx) const {
+        return NetworkUpgradeState(nHeight, *this, idx) == UPGRADE_ACTIVE;
+    }
+
+    int Params::HeightOfLatestSettledUpgrade() const {
+        for (auto idxInt = Consensus::MAX_NETWORK_UPGRADES - 1; idxInt > Consensus::BASE_SPROUT; idxInt--) {
+            if (vUpgrades[idxInt].hashActivationBlock.has_value()) {
+                return vUpgrades[idxInt].nActivationHeight;
+            }
+        }
+        return 0;
+    }
+
+    bool Params::FeatureRequired(const Consensus::ConsensusFeature feature) const {
+        return vRequiredFeatures.count(feature) > 0;
+    }
+
+    bool Params::FeatureActive(const int nHeight, const Consensus::ConsensusFeature feature) const {
+        return Features.FeatureActive(*this, nHeight, feature);
+    }
+
+    bool Params::FutureTimestampSoftForkActive(int nHeight) const {
+        return nHeight >= nFutureTimestampSoftForkHeight;
+    }
+
+    int Params::Halving(int nHeight) const {
+        // zip208
+        // Halving(height) :=
+        // floor((height - SlowStartShift) / PreBlossomHalvingInterval), if not IsBlossomActivated(height)
+        // floor((BlossomActivationHeight - SlowStartShift) / PreBlossomHalvingInterval + (height - BlossomActivationHeight) / PostBlossomHalvingInterval), otherwise
+        if (NetworkUpgradeActive(nHeight, Consensus::UPGRADE_BLOSSOM)) {
+            int64_t blossomActivationHeight = vUpgrades[Consensus::UPGRADE_BLOSSOM].nActivationHeight;
+            // Ideally we would say:
+            // halvings = (blossomActivationHeight - consensusParams.SubsidySlowStartShift()) / consensusParams.nPreBlossomSubsidyHalvingInterval
+            //     + (nHeight - blossomActivationHeight) / consensusParams.nPostBlossomSubsidyHalvingInterval;
+            // But, (blossomActivationHeight - consensusParams.SubsidySlowStartShift()) / consensusParams.nPreBlossomSubsidyHalvingInterval
+            // would need to be treated as a rational number in order for this to work.
+            // Define scaledHalvings := halvings * consensusParams.nPostBlossomSubsidyHalvingInterval;
+            int64_t scaledHalvings = ((blossomActivationHeight - SubsidySlowStartShift()) * Consensus::BLOSSOM_POW_TARGET_SPACING_RATIO)
+                + (nHeight - blossomActivationHeight);
+            return (int) (scaledHalvings / nPostBlossomSubsidyHalvingInterval);
+        } else {
+            return (nHeight - SubsidySlowStartShift()) / nPreBlossomSubsidyHalvingInterval;
+        }
+    }
+
+    /**
+     * This method determines the block height of the `halvingIndex`th
+     * halving, as known at the specified `nHeight` block height.
+     *
+     * Previous implementations of this logic were specialized to the
+     * first halving.
+     */
+    int Params::HalvingHeight(int nHeight, int halvingIndex) const {
+        assert(nHeight >= 0);
+        assert(halvingIndex > 0);
+
+        // zip208
+        // HalvingHeight(i) := max({ height ⦂ N | Halving(height) < i }) + 1
+        //
+        // Halving(h) returns the halving index at the specified height.  It is
+        // defined as floor(f(h)) where f is a strictly increasing rational
+        // function, so it's sufficient to solve for f(height) = halvingIndex
+        // in the rationals and then take ceiling(height).
+        //
+        // H := blossom activation height;
+        // SS := SubsidySlowStartShift();
+        // R := 1 / (postInterval / preInterval) = BLOSSOM_POW_TARGET_SPACING_RATIO
+        // (The following calculation depends on BLOSSOM_POW_TARGET_SPACING_RATIO being an integer.)
+        //
+        // preBlossom:
+        // i = (height - SS) / preInterval
+        // height = (preInterval * i) + SS
+        //
+        // postBlossom:
+        // i = (H - SS) / preInterval + (HalvingHeight(i) - H) / postInterval
+        // preInterval = postInterval / R
+        // i = (H - SS) / (postInterval / R) + (HalvingHeight(i) - H) / postInterval
+        // i = (R * (H - SS) + HalvingHeight(i) - H) / postInterval
+        // postInterval * i = R * (H - SS) + HalvingHeight(i) - H
+        // HalvingHeight(i) = postInterval * i - R * (H - SS) + H
+        if (NetworkUpgradeActive(nHeight, Consensus::UPGRADE_BLOSSOM)) {
+            int blossomActivationHeight = vUpgrades[Consensus::UPGRADE_BLOSSOM].nActivationHeight;
+
+            return
+                (nPostBlossomSubsidyHalvingInterval * halvingIndex)
+                - (BLOSSOM_POW_TARGET_SPACING_RATIO * (blossomActivationHeight - SubsidySlowStartShift()))
+                + blossomActivationHeight;
+        } else {
+            return (nPreBlossomSubsidyHalvingInterval * halvingIndex) + SubsidySlowStartShift();
+        }
+    }
+
+    int Params::GetLastFoundersRewardBlockHeight(int nHeight) const {
+        return HalvingHeight(nHeight, 1) - 1;
+    }
+
+    int Params::FundingPeriodIndex(int fundingStreamStartHeight, int nHeight) const {
+        int firstHalvingHeight = HalvingHeight(fundingStreamStartHeight, 1);
+
+        // If the start height of the funding period is not aligned to a multiple of the
+        // funding period length, the first funding period will be shorter than the
+        // funding period length.
+        auto startPeriodOffset = (fundingStreamStartHeight - firstHalvingHeight) % nFundingPeriodLength;
+        if (startPeriodOffset < 0) startPeriodOffset += nFundingPeriodLength; // C++ '%' is remainder, not modulus!
+
+        return (nHeight - fundingStreamStartHeight + startPeriodOffset) / nFundingPeriodLength;
+    }
+
+    std::variant<FundingStream, FundingStreamError> FundingStream::ValidateFundingStream(
+        const Consensus::Params& params,
+        const int startHeight,
+        const int endHeight,
+        const std::vector<FundingStreamAddress>& addresses
+    ) {
+        if (!params.NetworkUpgradeActive(startHeight, Consensus::UPGRADE_CANOPY)) {
+            return FundingStreamError::CANOPY_NOT_ACTIVE;
+        }
+
+        if (endHeight < startHeight) {
+            return FundingStreamError::ILLEGAL_RANGE;
+        }
+
+        if (params.FundingPeriodIndex(startHeight, endHeight - 1) >= addresses.size()) {
+            return FundingStreamError::INSUFFICIENT_ADDRESSES;
+        }
+
+        return FundingStream(startHeight, endHeight, addresses);
+    };
+
+    class GetFundingStreamOrThrow {
+    public:
+        FundingStream operator()(const FundingStream& fs) const {
+            return fs;
+        }
+
+        FundingStream operator()(const FundingStreamError& e) const {
+            switch (e) {
+                case FundingStreamError::CANOPY_NOT_ACTIVE:
+                    throw std::runtime_error("Canopy network upgrade not active at funding stream start height.");
+                case FundingStreamError::ILLEGAL_RANGE:
+                    throw std::runtime_error("Illegal start/end height combination for funding stream.");
+                case FundingStreamError::INSUFFICIENT_ADDRESSES:
+                    throw std::runtime_error("Insufficient payment addresses to fully exhaust funding stream.");
+                default:
+                    throw std::runtime_error("Unrecognized error validating funding stream.");
+            };
+        }
+    };
+
+    FundingStream FundingStream::ParseFundingStream(
+        const Consensus::Params& params,
+        const KeyConstants& keyConstants,
+        const int startHeight,
+        const int endHeight,
+        const std::vector<std::string>& strAddresses)
+    {
+        KeyIO keyIO(keyConstants);
+
+        // Parse the address strings into concrete types.
+        std::vector<FundingStreamAddress> addresses;
+        for (const auto& strAddr : strAddresses) {
+            auto addr = keyIO.DecodePaymentAddress(strAddr);
+            if (!addr.has_value()) {
+                throw std::runtime_error("Funding stream address was not a valid " PACKAGE_NAME " address.");
+            }
+
+            std::visit(match {
+                [&](const CKeyID& keyId) {
+                    addresses.push_back(GetScriptForDestination(keyId));
+                },
+                [&](const CScriptID& scriptId) {
+                    addresses.push_back(GetScriptForDestination(scriptId));
+                },
+                [&](const libzcash::SaplingPaymentAddress& zaddr) {
+                    addresses.push_back(zaddr);
+                },
+                [&](const auto& zaddr) {
+                    throw std::runtime_error("Funding stream address was not a valid transparent P2SH or Sapling address.");
+                }
+            }, addr.value());
+        }
+
+        auto validationResult = FundingStream::ValidateFundingStream(params, startHeight, endHeight, addresses);
+        return std::visit(GetFundingStreamOrThrow(), validationResult);
+    };
+
+    void Params::AddZIP207FundingStream(
+        const KeyConstants& keyConstants,
+        FundingStreamIndex idx,
+        int startHeight,
+        int endHeight,
+        const std::vector<std::string>& strAddresses)
+    {
+        vFundingStreams[idx] = FundingStream::ParseFundingStream(*this, keyConstants, startHeight, endHeight, strAddresses);
+    };
+
+    FundingStreamAddress FundingStream::RecipientAddress(const Consensus::Params& params, int nHeight) const
+    {
+        auto addressIndex = params.FundingPeriodIndex(startHeight, nHeight);
+
+        assert(addressIndex >= 0 && addressIndex < addresses.size());
+        return addresses[addressIndex];
+    };
+
+    int64_t Params::PoWTargetSpacing(int nHeight) const {
+        // zip208
+        // PoWTargetSpacing(height) :=
+        // PreBlossomPoWTargetSpacing, if not IsBlossomActivated(height)
+        // PostBlossomPoWTargetSpacing, otherwise.
+        bool blossomActive = NetworkUpgradeActive(nHeight, Consensus::UPGRADE_BLOSSOM);
+        return blossomActive ? nPostBlossomPowTargetSpacing : nPreBlossomPowTargetSpacing;
+    }
+
+    int64_t Params::AveragingWindowTimespan(int nHeight) const {
+        return nPowAveragingWindow * PoWTargetSpacing(nHeight);
+    }
+
+    int64_t Params::MinActualTimespan(int nHeight) const {
+        return (AveragingWindowTimespan(nHeight) * (100 - nPowMaxAdjustUp)) / 100;
+    }
+
+    int64_t Params::MaxActualTimespan(int nHeight) const {
+        return (AveragingWindowTimespan(nHeight) * (100 + nPowMaxAdjustDown)) / 100;
+    }
+}
diff --git a/depend/zcash/src/consensus/params.h b/depend/zcash/src/consensus/params.h
new file mode 100644
index 000000000..0aefaee1f
--- /dev/null
+++ b/depend/zcash/src/consensus/params.h
@@ -0,0 +1,371 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_CONSENSUS_PARAMS_H
+#define BITCOIN_CONSENSUS_PARAMS_H
+
+#include <script/script.h>
+#include "uint256.h"
+#include "key_constants.h"
+#include <zcash/address/sapling.hpp>
+
+#include <optional>
+#include <variant>
+
+namespace Consensus {
+
+// Early declaration to ensure it is accessible.
+struct Params;
+
+/**
+ * Index into Params.vUpgrades and NetworkUpgradeInfo
+ *
+ * Being array indices, these MUST be numbered consecutively.
+ *
+ * The order of these indices MUST match the order of the upgrades on-chain, as
+ * several functions depend on the enum being sorted.
+ */
+enum UpgradeIndex : uint32_t {
+    // Sprout must be first
+    BASE_SPROUT,
+    UPGRADE_TESTDUMMY,
+    UPGRADE_OVERWINTER,
+    UPGRADE_SAPLING,
+    UPGRADE_BLOSSOM,
+    UPGRADE_HEARTWOOD,
+    UPGRADE_CANOPY,
+    UPGRADE_NU5,
+    // Add new network upgrades before this line.
+    // NOTE: Also add new upgrades to NetworkUpgradeInfo in upgrades.cpp
+    UPGRADE_ZFUTURE,
+    MAX_NETWORK_UPGRADES
+};
+
+struct NetworkUpgrade {
+    /**
+     * The first protocol version which will understand the new consensus rules
+     */
+    int nProtocolVersion;
+
+    /**
+     * Height of the first block for which the new consensus rules will be active
+     */
+    int nActivationHeight;
+
+    /**
+     * Special value for nActivationHeight indicating that the upgrade is always active.
+     * This is useful for testing, as it means tests don't need to deal with the activation
+     * process (namely, faking a chain of somewhat-arbitrary length).
+     *
+     * New blockchains that want to enable upgrade rules from the beginning can also use
+     * this value. However, additional care must be taken to ensure the genesis block
+     * satisfies the enabled rules.
+     */
+    static constexpr int ALWAYS_ACTIVE = 0;
+
+    /**
+     * Special value for nActivationHeight indicating that the upgrade will never activate.
+     * This is useful when adding upgrade code that has a testnet activation height, but
+     * should remain disabled on mainnet.
+     */
+    static constexpr int NO_ACTIVATION_HEIGHT = -1;
+
+    /**
+     * The hash of the block at height nActivationHeight, if known. This is set manually
+     * after a network upgrade activates.
+     *
+     * We use this in IsInitialBlockDownload to detect whether we are potentially being
+     * fed a fake alternate chain. We use NU activation blocks for this purpose instead of
+     * the checkpoint blocks, because network upgrades (should) have significantly more
+     * scrutiny than regular releases. nMinimumChainWork MUST be set to at least the chain
+     * work of this block, otherwise this detection will have false positives.
+     */
+    std::optional<uint256> hashActivationBlock;
+};
+
+typedef std::variant<libzcash::SaplingPaymentAddress, CScript> FundingStreamAddress;
+
+/**
+ * Index into Params.vFundingStreams.
+ *
+ * Being array indices, these MUST be numbered consecutively.
+ */
+enum FundingStreamIndex : uint32_t {
+    FS_ZIP214_BP,
+    FS_ZIP214_ZF,
+    FS_ZIP214_MG,
+    MAX_FUNDING_STREAMS,
+};
+const auto FIRST_FUNDING_STREAM = FS_ZIP214_BP;
+
+enum FundingStreamError {
+    CANOPY_NOT_ACTIVE,
+    ILLEGAL_RANGE,
+    INSUFFICIENT_ADDRESSES,
+};
+
+class FundingStream
+{
+private:
+    int startHeight;
+    int endHeight;
+    std::vector<FundingStreamAddress> addresses;
+
+    FundingStream(int startHeight, int endHeight, const std::vector<FundingStreamAddress>& addresses):
+        startHeight(startHeight), endHeight(endHeight), addresses(addresses) { }
+public:
+    FundingStream(const FundingStream& fs):
+        startHeight(fs.startHeight), endHeight(fs.endHeight), addresses(fs.addresses) { }
+
+    static std::variant<FundingStream, FundingStreamError> ValidateFundingStream(
+        const Consensus::Params& params,
+        const int startHeight,
+        const int endHeight,
+        const std::vector<FundingStreamAddress>& addresses
+    );
+
+    static FundingStream ParseFundingStream(
+        const Consensus::Params& params,
+        const KeyConstants& keyConstants,
+        const int startHeight,
+        const int endHeight,
+        const std::vector<std::string>& strAddresses);
+
+    int GetStartHeight() const { return startHeight; };
+    int GetEndHeight() const { return endHeight; };
+    const std::vector<FundingStreamAddress>& GetAddresses() const {
+        return addresses;
+    };
+
+    FundingStreamAddress RecipientAddress(const Params& params, int nHeight) const;
+};
+
+enum ConsensusFeature : uint32_t {
+    // Index value for the maximum consensus feature ID.
+    MAX_FEATURES
+};
+const auto FIRST_CONSENSUS_FEATURE = MAX_FEATURES;
+
+template <class Feature>
+struct FeatureInfo {
+    std::vector<Feature> dependsOn;
+    UpgradeIndex activation;
+};
+
+/**
+ * A FeatureSet encodes a directed acyclic graph of feature dependencies
+ * as an array indexed by feature ID. Values are FeatureInfo objects
+ * containing the list of feature IDs upon which the index's feature ID
+ * depends.
+ *
+ * The `Feature` and `Params` template parameters permit for the
+ * logic of `FeatureActive` to be tested against a mock set of
+ * features and activation heights.
+ */
+template <class Feature, class Params>
+class FeatureSet {
+private:
+    std::vector<FeatureInfo<Feature>> features;
+public:
+    FeatureSet(std::vector<FeatureInfo<Feature>> features): features(features) {
+    }
+
+    bool FeatureActive(
+            const Params& params,
+            const int nHeight,
+            const Feature feature) const {
+        assert(feature < features.size());
+
+        // The feature must be explicitly required by a CLI argument or by
+        // the feature being universally available above a network upgrade
+        // activation height.
+        if (params.NetworkUpgradeActive(nHeight, features[feature].activation) ||
+                params.FeatureRequired(feature)) {
+            // Transitively check that if a feature is active, all of the other features
+            // that it depends on are also active.
+            auto requires = features[feature].dependsOn;
+            assert(std::all_of(
+                requires.begin(),
+                requires.end(),
+                [&](Feature feat) {
+                    return FeatureActive(params, nHeight, feat);
+                }
+            ));
+
+            return true;
+        } else {
+            return false;
+        }
+    }
+};
+
+/**
+ * The set of features supported by Zcashd.
+ */
+const FeatureSet<ConsensusFeature, Params> Features({});
+
+/** ZIP208 block target interval in seconds. */
+static const unsigned int PRE_BLOSSOM_POW_TARGET_SPACING = 150;
+static const unsigned int POST_BLOSSOM_POW_TARGET_SPACING = 75;
+static_assert(PRE_BLOSSOM_POW_TARGET_SPACING > POST_BLOSSOM_POW_TARGET_SPACING, "Blossom target spacing must be less than pre-Blossom target spacing.");
+static_assert(PRE_BLOSSOM_POW_TARGET_SPACING % POST_BLOSSOM_POW_TARGET_SPACING == 0, "Blossom target spacing must exactly divide pre-Blossom target spacing.");
+
+static const int BLOSSOM_POW_TARGET_SPACING_RATIO = PRE_BLOSSOM_POW_TARGET_SPACING / POST_BLOSSOM_POW_TARGET_SPACING;
+static_assert(BLOSSOM_POW_TARGET_SPACING_RATIO * POST_BLOSSOM_POW_TARGET_SPACING == PRE_BLOSSOM_POW_TARGET_SPACING, "Invalid BLOSSOM_POW_TARGET_SPACING_RATIO");
+
+static const unsigned int PRE_BLOSSOM_HALVING_INTERVAL = 840000;
+static const unsigned int PRE_BLOSSOM_REGTEST_HALVING_INTERVAL = 144;
+
+#define POST_BLOSSOM_HALVING_INTERVAL(preBlossomInterval) \
+    (preBlossomInterval * Consensus::BLOSSOM_POW_TARGET_SPACING_RATIO)
+
+/**
+ * Parameters that influence chain consensus.
+ */
+struct Params {
+    /**
+     * Returns the activation height for the specified network upgrade, if any.
+     */
+    std::optional<int> GetActivationHeight(Consensus::UpgradeIndex idx) const;
+
+    /**
+     * Returns true if the given network upgrade is active as of the given block
+     * height. Caller must check that the height is >= 0 (and handle unknown
+     * heights).
+     */
+    bool NetworkUpgradeActive(int nHeight, Consensus::UpgradeIndex idx) const;
+
+    /**
+     * Returns the activation height of the latest settled upgrade, as defined
+     * in <https://zips.z.cash/protocol/protocol.pdf#blockchain>.
+     */
+    int HeightOfLatestSettledUpgrade() const;
+
+    bool FutureTimestampSoftForkActive(int nHeight) const;
+
+    bool FeatureActive(int nHeight, Consensus::ConsensusFeature feature) const;
+
+    bool FeatureRequired(Consensus::ConsensusFeature feature) const;
+
+    uint256 hashGenesisBlock;
+
+    bool fCoinbaseMustBeShielded = false;
+
+    /** Needs to evenly divide MAX_SUBSIDY to avoid rounding errors. */
+    int nSubsidySlowStartInterval;
+    /**
+     * Shift based on a linear ramp for slow start:
+     *
+     * MAX_SUBSIDY*(t_s/2 + t_r) = MAX_SUBSIDY*t_h  Coin balance
+     *              t_s   + t_r  = t_h + t_c        Block balance
+     *
+     * t_s = nSubsidySlowStartInterval
+     * t_r = number of blocks between end of slow start and first halving
+     * t_h = nPreBlossomSubsidyHalvingInterval
+     * t_c = SubsidySlowStartShift()
+     */
+    int SubsidySlowStartShift() const { return nSubsidySlowStartInterval / 2; }
+    int nPreBlossomSubsidyHalvingInterval;
+    int nPostBlossomSubsidyHalvingInterval;
+
+    /**
+     * Identify the halving index at the specified height. The result will be
+     * negative during the slow-start period.
+     */
+    int Halving(int nHeight) const;
+
+    /**
+     * Get the block height of the specified halving.
+     */
+    int HalvingHeight(int nHeight, int halvingIndex) const;
+
+    int GetLastFoundersRewardBlockHeight(int nHeight) const;
+
+    int FundingPeriodIndex(int fundingStreamStartHeight, int nHeight) const;
+
+    /** Used to check majorities for block version upgrade */
+    int nMajorityEnforceBlockUpgrade;
+    int nMajorityRejectBlockOutdated;
+    int nMajorityWindow;
+    NetworkUpgrade vUpgrades[MAX_NETWORK_UPGRADES];
+
+    int nFundingPeriodLength;
+    std::optional<FundingStream> vFundingStreams[MAX_FUNDING_STREAMS];
+    void AddZIP207FundingStream(
+        const KeyConstants& keyConstants,
+        FundingStreamIndex idx,
+        int startHeight,
+        int endHeight,
+        const std::vector<std::string>& addresses);
+
+    /**
+     * A set of features that have been explicitly force-enabled
+     * via the CLI, overriding block-height based decisions for
+     * this feature.
+     */
+    std::set<ConsensusFeature> vRequiredFeatures;
+
+    /**
+     * Default block height at which the future timestamp soft fork rule activates.
+     *
+     * Genesis blocks are hard-coded into the binary for all networks
+     * (mainnet, testnet, regtest), and have now-ancient timestamps. So we need to
+     * handle the case where we might use the genesis block's timestamp as the
+     * median-time-past.
+     *
+     * GetMedianTimePast() is implemented such that the chosen block is the
+     * median of however many blocks we are able to select up to
+     * nMedianTimeSpan = 11. For example, if nHeight == 6:
+     *
+     *    ,-<pmedian  ,-<pbegin            ,-<pend
+     *   [-, -, -, -, 0, 1, 2, 3, 4, 5, 6] -
+     *
+     * and thus pbegin[(pend - pbegin)/2] will select block height 3, assuming
+     * that the block timestamps are all greater than the genesis block's
+     * timestamp. For regtest mode, this is a valid assumption; we generate blocks
+     * deterministically and in-order. For mainnet it was true in practice, and
+     * we aren't going to be starting a new chain linked directly from the mainnet
+     * genesis block.
+     *
+     * Therefore, for regtest and mainnet we only risk using the regtest genesis
+     * block's timestamp for nHeight < 2 (as GetMedianTimePast() uses floor division).
+     *
+     * Separately, for mainnet this is also necessary because there was a long time
+     * between starting to find the mainnet genesis block (which was mined with a
+     * single laptop) and mining the block at height 1. For any new mainnet chain
+     * using Zcash code, the soft fork rule would be enabled from the start so that
+     * miners would limit their timestamps accordingly.
+     *
+     * For testnet, the future timestamp soft fork rule was violated for many
+     * blocks prior to Blossom activation. At Blossom, the time threshold for the
+     * (testnet-specific) minimum difficulty rule was changed in such a way that
+     * starting from shortly after the Blossom activation, no further blocks
+     * violate the soft fork rule. So for testnet we override the soft fork
+     * activation height in chainparams.cpp.
+     */
+    int nFutureTimestampSoftForkHeight = 2;
+
+    /** Proof of work parameters */
+    unsigned int nEquihashN = 0;
+    unsigned int nEquihashK = 0;
+    uint256 powLimit;
+    std::optional<uint32_t> nPowAllowMinDifficultyBlocksAfterHeight;
+    bool fPowNoRetargeting;
+    int64_t nPowAveragingWindow;
+    int64_t nPowMaxAdjustDown;
+    int64_t nPowMaxAdjustUp;
+    int64_t nPreBlossomPowTargetSpacing;
+    int64_t nPostBlossomPowTargetSpacing;
+
+    int64_t PoWTargetSpacing(int nHeight) const;
+    int64_t AveragingWindowTimespan(int nHeight) const;
+    int64_t MinActualTimespan(int nHeight) const;
+    int64_t MaxActualTimespan(int nHeight) const;
+
+    uint256 nMinimumChainWork;
+};
+} // namespace Consensus
+
+#endif // BITCOIN_CONSENSUS_PARAMS_H
diff --git a/depend/zcash/src/consensus/upgrades.cpp b/depend/zcash/src/consensus/upgrades.cpp
new file mode 100644
index 000000000..c18775a44
--- /dev/null
+++ b/depend/zcash/src/consensus/upgrades.cpp
@@ -0,0 +1,177 @@
+// Copyright (c) 2018 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "consensus/upgrades.h"
+
+/**
+ * General information about each network upgrade.
+ * Ordered by Consensus::UpgradeIndex.
+ */
+const struct NUInfo NetworkUpgradeInfo[Consensus::MAX_NETWORK_UPGRADES] = {
+    {
+        .nBranchId = 0,
+        .strName = "Sprout",
+        .strInfo = "The Zcash network at launch",
+    },
+    {
+        .nBranchId = 0x74736554,
+        .strName = "Test dummy",
+        .strInfo = "Test dummy info",
+    },
+    {
+        .nBranchId = 0x5ba81b19,
+        .strName = "Overwinter",
+        .strInfo = "See https://z.cash/upgrade/overwinter/ for details.",
+    },
+    {
+        .nBranchId = 0x76b809bb,
+        .strName = "Sapling",
+        .strInfo = "See https://z.cash/upgrade/sapling/ for details.",
+    },
+    {
+        .nBranchId = 0x2bb40e60,
+        .strName = "Blossom",
+        .strInfo = "See https://z.cash/upgrade/blossom/ for details.",
+    },
+    {
+        .nBranchId = 0xf5b9230b,
+        .strName = "Heartwood",
+        .strInfo = "See https://z.cash/upgrade/heartwood/ for details.",
+    },
+    {
+        .nBranchId = 0xe9ff75a6,
+        .strName = "Canopy",
+        .strInfo = "See https://z.cash/upgrade/canopy/ for details.",
+    },
+    {
+        .nBranchId = 0xc2d6d0b4,
+        .strName = "NU5",
+        .strInfo = "See https://z.cash/upgrade/nu5/ for details.",
+    },
+    {
+        .nBranchId = 0xffffffff,
+        .strName = "ZFUTURE",
+        .strInfo = "Future network upgrade (integration testing only)",
+    }
+};
+
+const uint32_t SPROUT_BRANCH_ID = NetworkUpgradeInfo[Consensus::BASE_SPROUT].nBranchId;
+
+UpgradeState NetworkUpgradeState(
+    int nHeight,
+    const Consensus::Params& params,
+    Consensus::UpgradeIndex idx)
+{
+    assert(nHeight >= 0);
+    assert(idx >= Consensus::BASE_SPROUT && idx < Consensus::MAX_NETWORK_UPGRADES);
+    auto nActivationHeight = params.vUpgrades[idx].nActivationHeight;
+
+    if (nActivationHeight == Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT) {
+        return UPGRADE_DISABLED;
+    } else if (nHeight >= nActivationHeight) {
+        // From ZIP 200:
+        //
+        // ACTIVATION_HEIGHT
+        //     The non-zero block height at which the network upgrade rules will come
+        //     into effect, and be enforced as part of the blockchain consensus.
+        //
+        //     For removal of ambiguity, the block at height ACTIVATION_HEIGHT - 1 is
+        //     subject to the pre-upgrade consensus rules, and would be the last common
+        //     block in the event of a persistent pre-upgrade branch.
+        return UPGRADE_ACTIVE;
+    } else {
+        return UPGRADE_PENDING;
+    }
+}
+
+int CurrentEpoch(int nHeight, const Consensus::Params& params) {
+    for (auto idxInt = Consensus::MAX_NETWORK_UPGRADES - 1; idxInt >= Consensus::BASE_SPROUT; idxInt--) {
+        if (params.NetworkUpgradeActive(nHeight, Consensus::UpgradeIndex(idxInt))) {
+            return idxInt;
+        }
+    }
+    // Base case
+    return Consensus::BASE_SPROUT;
+}
+
+uint32_t CurrentEpochBranchId(int nHeight, const Consensus::Params& params) {
+    return NetworkUpgradeInfo[CurrentEpoch(nHeight, params)].nBranchId;
+}
+
+uint32_t PrevEpochBranchId(uint32_t currentBranchId, const Consensus::Params& params) {
+    for (int idx = Consensus::BASE_SPROUT + 1; idx < Consensus::MAX_NETWORK_UPGRADES; idx++) {
+        if (currentBranchId == NetworkUpgradeInfo[idx].nBranchId) {
+            return NetworkUpgradeInfo[idx - 1].nBranchId;
+        }
+    }
+    // Base case
+    return NetworkUpgradeInfo[Consensus::BASE_SPROUT].nBranchId;
+}
+
+bool IsConsensusBranchId(int branchId) {
+    for (int idx = Consensus::BASE_SPROUT; idx < Consensus::MAX_NETWORK_UPGRADES; idx++) {
+        if (branchId == NetworkUpgradeInfo[idx].nBranchId) {
+            return true;
+        }
+    }
+    return false;
+}
+
+bool IsActivationHeight(
+    int nHeight,
+    const Consensus::Params& params,
+    Consensus::UpgradeIndex idx)
+{
+    assert(idx >= Consensus::BASE_SPROUT && idx < Consensus::MAX_NETWORK_UPGRADES);
+
+    // Don't count Sprout as an activation height
+    if (idx == Consensus::BASE_SPROUT) {
+        return false;
+    }
+
+    return nHeight >= 0 && nHeight == params.vUpgrades[idx].nActivationHeight;
+}
+
+bool IsActivationHeightForAnyUpgrade(
+    int nHeight,
+    const Consensus::Params& params)
+{
+    if (nHeight < 0) {
+        return false;
+    }
+
+    // Don't count Sprout as an activation height
+    for (int idx = Consensus::BASE_SPROUT + 1; idx < Consensus::MAX_NETWORK_UPGRADES; idx++) {
+        if (nHeight == params.vUpgrades[idx].nActivationHeight)
+            return true;
+    }
+
+    return false;
+}
+
+std::optional<int> NextEpoch(int nHeight, const Consensus::Params& params) {
+    if (nHeight < 0) {
+        return std::nullopt;
+    }
+
+    // Sprout is never pending
+    for (auto idx = Consensus::BASE_SPROUT + 1; idx < Consensus::MAX_NETWORK_UPGRADES; idx++) {
+        if (NetworkUpgradeState(nHeight, params, Consensus::UpgradeIndex(idx)) == UPGRADE_PENDING) {
+            return idx;
+        }
+    }
+
+    return std::nullopt;
+}
+
+std::optional<int> NextActivationHeight(
+    int nHeight,
+    const Consensus::Params& params)
+{
+    auto idx = NextEpoch(nHeight, params);
+    if (idx) {
+        return params.vUpgrades[idx.value()].nActivationHeight;
+    }
+    return std::nullopt;
+}
diff --git a/depend/zcash/src/consensus/upgrades.h b/depend/zcash/src/consensus/upgrades.h
new file mode 100644
index 000000000..812c0ad18
--- /dev/null
+++ b/depend/zcash/src/consensus/upgrades.h
@@ -0,0 +1,98 @@
+// Copyright (c) 2018 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_CONSENSUS_UPGRADES_H
+#define ZCASH_CONSENSUS_UPGRADES_H
+
+#include "consensus/params.h"
+
+#include <optional>
+
+enum UpgradeState {
+    UPGRADE_DISABLED,
+    UPGRADE_PENDING,
+    UPGRADE_ACTIVE
+};
+
+struct NUInfo {
+    /** Branch ID (a random non-zero 32-bit value) */
+    uint32_t nBranchId;
+    /** User-facing name for the upgrade */
+    std::string strName;
+    /** User-facing information string about the upgrade */
+    std::string strInfo;
+};
+
+extern const struct NUInfo NetworkUpgradeInfo[];
+
+// Consensus branch id to identify pre-overwinter (Sprout) consensus rules.
+extern const uint32_t SPROUT_BRANCH_ID;
+
+/**
+ * Checks the state of a given network upgrade based on block height.
+ * Caller must check that the height is >= 0 (and handle unknown heights).
+ */
+UpgradeState NetworkUpgradeState(
+    int nHeight,
+    const Consensus::Params& params,
+    Consensus::UpgradeIndex idx);
+
+/**
+ * Returns the index of the most recent upgrade as of the given block height
+ * (corresponding to the current "epoch"). Consensus::BASE_SPROUT is the
+ * default value if no upgrades are active. Caller must check that the height
+ * is >= 0 (and handle unknown heights).
+ */
+int CurrentEpoch(int nHeight, const Consensus::Params& params);
+
+/**
+ * Returns the branch ID of the most recent upgrade as of the given block height
+ * (corresponding to the current "epoch"), or 0 if no upgrades are active.
+ * Caller must check that the height is >= 0 (and handle unknown heights).
+ */
+uint32_t CurrentEpochBranchId(int nHeight, const Consensus::Params& params);
+
+/**
+ * Returns the branch ID that preceded currentBranchId, or 0 if no upgrade
+ * matches currentBranchId.
+ */
+uint32_t PrevEpochBranchId(uint32_t currentBranchId, const Consensus::Params& params);
+
+/**
+ * Returns true if a given branch id is a valid nBranchId for one of the network
+ * upgrades contained in NetworkUpgradeInfo.
+ */
+bool IsConsensusBranchId(int branchId);
+
+/**
+ * Returns true if the given block height is the activation height for the given
+ * upgrade.
+ */
+bool IsActivationHeight(
+    int nHeight,
+    const Consensus::Params& params,
+    Consensus::UpgradeIndex upgrade);
+
+/**
+ * Returns true if the given block height is the activation height for any upgrade.
+ */
+bool IsActivationHeightForAnyUpgrade(
+    int nHeight,
+    const Consensus::Params& params);
+
+/**
+ * Returns the index of the next upgrade after the given block height, or
+ * std::nullopt if there are no more known upgrades.
+ */
+std::optional<int> NextEpoch(int nHeight, const Consensus::Params& params);
+
+/**
+ * Returns the activation height for the next upgrade after the given block height,
+ * or std::nullopt if there are no more known upgrades.
+ */
+std::optional<int> NextActivationHeight(
+    int nHeight,
+    const Consensus::Params& params);
+
+#endif // ZCASH_CONSENSUS_UPGRADES_H
diff --git a/depend/zcash/src/consensus/validation.h b/depend/zcash/src/consensus/validation.h
new file mode 100644
index 000000000..6e34837a3
--- /dev/null
+++ b/depend/zcash/src/consensus/validation.h
@@ -0,0 +1,85 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_CONSENSUS_VALIDATION_H
+#define BITCOIN_CONSENSUS_VALIDATION_H
+
+#include <string>
+
+/** "reject" message codes */
+static const unsigned char REJECT_MALFORMED = 0x01;
+static const unsigned char REJECT_INVALID = 0x10;
+static const unsigned char REJECT_OBSOLETE = 0x11;
+static const unsigned char REJECT_DUPLICATE = 0x12;
+static const unsigned char REJECT_NONSTANDARD = 0x40;
+static const unsigned char REJECT_DUST = 0x41;
+static const unsigned char REJECT_INSUFFICIENTFEE = 0x42;
+static const unsigned char REJECT_CHECKPOINT = 0x43;
+
+/** Capture information about block/transaction validation */
+class CValidationState {
+private:
+    enum mode_state {
+        MODE_VALID,   //! everything ok
+        MODE_INVALID, //! network rule violation (DoS value may be set)
+        MODE_ERROR,   //! run-time error
+    } mode;
+    int nDoS;
+    std::string strRejectReason;
+    unsigned int chRejectCode;
+    bool corruptionPossible;
+    std::string strDebugMessage;
+public:
+    CValidationState() : mode(MODE_VALID), nDoS(0), chRejectCode(0), corruptionPossible(false) {}
+    virtual bool DoS(int level, bool ret = false,
+             unsigned int chRejectCodeIn=0, const std::string &strRejectReasonIn="",
+             bool corruptionIn=false,
+             const std::string &strDebugMessageIn="") {
+        chRejectCode = chRejectCodeIn;
+        strRejectReason = strRejectReasonIn;
+        corruptionPossible = corruptionIn;
+        strDebugMessage = strDebugMessageIn;
+        if (mode == MODE_ERROR)
+            return ret;
+        nDoS += level;
+        mode = MODE_INVALID;
+        return ret;
+    }
+    virtual bool Invalid(bool ret = false,
+                 unsigned int _chRejectCode=0, const std::string &_strRejectReason="",
+                 const std::string &_strDebugMessage="") {
+        return DoS(0, ret, _chRejectCode, _strRejectReason, false, _strDebugMessage);
+    }
+    virtual bool Error(const std::string& strRejectReasonIn) {
+        if (mode == MODE_VALID)
+            strRejectReason = strRejectReasonIn;
+        mode = MODE_ERROR;
+        return false;
+    }
+    virtual bool IsValid() const {
+        return mode == MODE_VALID;
+    }
+    virtual bool IsInvalid() const {
+        return mode == MODE_INVALID;
+    }
+    virtual bool IsError() const {
+        return mode == MODE_ERROR;
+    }
+    virtual bool IsInvalid(int &nDoSOut) const {
+        if (IsInvalid()) {
+            nDoSOut = nDoS;
+            return true;
+        }
+        return false;
+    }
+    virtual bool CorruptionPossible() const {
+        return corruptionPossible;
+    }
+    virtual unsigned int GetRejectCode() const { return chRejectCode; }
+    virtual std::string GetRejectReason() const { return strRejectReason; }
+    virtual std::string GetDebugMessage() const { return strDebugMessage; }
+};
+
+#endif // BITCOIN_CONSENSUS_VALIDATION_H
diff --git a/depend/zcash/src/core_io.h b/depend/zcash/src/core_io.h
new file mode 100644
index 000000000..0abfb4b10
--- /dev/null
+++ b/depend/zcash/src/core_io.h
@@ -0,0 +1,32 @@
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_CORE_IO_H
+#define BITCOIN_CORE_IO_H
+
+#include <string>
+#include <vector>
+
+class CBlock;
+class CScript;
+class CTransaction;
+class uint256;
+class UniValue;
+
+// core_read.cpp
+extern CScript ParseScript(const std::string& s);
+extern std::string ScriptToAsmStr(const CScript& script, const bool fAttemptSighashDecode = false);
+extern bool DecodeHexTx(CTransaction& tx, const std::string& strHexTx);
+extern bool DecodeHexBlk(CBlock&, const std::string& strHexBlk);
+extern uint256 ParseHashUV(const UniValue& v, const std::string& strName);
+extern uint256 ParseHashStr(const std::string&, const std::string& strName);
+extern std::vector<unsigned char> ParseHexUV(const UniValue& v, const std::string& strName);
+
+// core_write.cpp
+extern std::string FormatScript(const CScript& script);
+extern std::string EncodeHexTx(const CTransaction& tx);
+extern void ScriptPubKeyToUniv(const CScript& scriptPubKey, UniValue& out, bool fIncludeHex);
+extern void TxToUniv(const CTransaction& tx, const uint256& hashBlock, UniValue& entry);
+
+#endif // BITCOIN_CORE_IO_H
diff --git a/depend/zcash/src/core_memusage.h b/depend/zcash/src/core_memusage.h
new file mode 100644
index 000000000..26b1f01d6
--- /dev/null
+++ b/depend/zcash/src/core_memusage.h
@@ -0,0 +1,70 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_CORE_MEMUSAGE_H
+#define BITCOIN_CORE_MEMUSAGE_H
+
+#include "primitives/transaction.h"
+#include "primitives/block.h"
+#include "memusage.h"
+
+static inline size_t RecursiveDynamicUsage(const CScript& script) {
+    return memusage::DynamicUsage(*static_cast<const CScriptBase*>(&script));
+}
+
+static inline size_t RecursiveDynamicUsage(const COutPoint& out) {
+    return 0;
+}
+
+static inline size_t RecursiveDynamicUsage(const CTxIn& in) {
+    return RecursiveDynamicUsage(in.scriptSig) + RecursiveDynamicUsage(in.prevout);
+}
+
+static inline size_t RecursiveDynamicUsage(const CTxOut& out) {
+    return RecursiveDynamicUsage(out.scriptPubKey);
+}
+
+static inline size_t RecursiveDynamicUsage(const CTransaction& tx) {
+    size_t mem = memusage::DynamicUsage(tx.vin) + memusage::DynamicUsage(tx.vout);
+    for (std::vector<CTxIn>::const_iterator it = tx.vin.begin(); it != tx.vin.end(); it++) {
+        mem += RecursiveDynamicUsage(*it);
+    }
+    for (std::vector<CTxOut>::const_iterator it = tx.vout.begin(); it != tx.vout.end(); it++) {
+        mem += RecursiveDynamicUsage(*it);
+    }
+    mem += memusage::DynamicUsage(tx.vJoinSplit);
+    mem += memusage::DynamicUsage(tx.vShieldedSpend);
+    mem += memusage::DynamicUsage(tx.vShieldedOutput);
+    mem += tx.GetOrchardBundle().RecursiveDynamicUsage();
+    return mem;
+}
+
+static inline size_t RecursiveDynamicUsage(const CMutableTransaction& tx) {
+    size_t mem = memusage::DynamicUsage(tx.vin) + memusage::DynamicUsage(tx.vout);
+    for (std::vector<CTxIn>::const_iterator it = tx.vin.begin(); it != tx.vin.end(); it++) {
+        mem += RecursiveDynamicUsage(*it);
+    }
+    for (std::vector<CTxOut>::const_iterator it = tx.vout.begin(); it != tx.vout.end(); it++) {
+        mem += RecursiveDynamicUsage(*it);
+    }
+    mem += memusage::DynamicUsage(tx.vJoinSplit);
+    mem += memusage::DynamicUsage(tx.vShieldedSpend);
+    mem += memusage::DynamicUsage(tx.vShieldedOutput);
+    mem += tx.orchardBundle.RecursiveDynamicUsage();
+    return mem;
+}
+
+static inline size_t RecursiveDynamicUsage(const CBlock& block) {
+    size_t mem = memusage::DynamicUsage(block.vtx) + memusage::DynamicUsage(block.vMerkleTree);
+    for (std::vector<CTransaction>::const_iterator it = block.vtx.begin(); it != block.vtx.end(); it++) {
+        mem += RecursiveDynamicUsage(*it);
+    }
+    return mem;
+}
+
+static inline size_t RecursiveDynamicUsage(const CBlockLocator& locator) {
+    return memusage::DynamicUsage(locator.vHave);
+}
+
+#endif // BITCOIN_CORE_MEMUSAGE_H
diff --git a/depend/zcash/src/core_read.cpp b/depend/zcash/src/core_read.cpp
new file mode 100644
index 000000000..19a5b6952
--- /dev/null
+++ b/depend/zcash/src/core_read.cpp
@@ -0,0 +1,151 @@
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "core_io.h"
+
+#include "primitives/block.h"
+#include "primitives/transaction.h"
+#include "script/script.h"
+#include "serialize.h"
+#include "streams.h"
+#include <univalue.h>
+#include "util.h"
+#include "utilstrencodings.h"
+#include "version.h"
+
+#include <boost/algorithm/string/classification.hpp>
+#include <boost/algorithm/string/predicate.hpp>
+#include <boost/algorithm/string/replace.hpp>
+#include <boost/algorithm/string/split.hpp>
+#include <boost/assign/list_of.hpp>
+
+CScript ParseScript(const std::string& s)
+{
+    CScript result;
+
+    static std::map<std::string, opcodetype> mapOpNames;
+
+    if (mapOpNames.empty())
+    {
+        for (int op = 0; op <= OP_NOP10; op++)
+        {
+            // Allow OP_RESERVED to get into mapOpNames
+            if (op < OP_NOP && op != OP_RESERVED)
+                continue;
+
+            const char* name = GetOpName((opcodetype)op);
+            if (strcmp(name, "OP_UNKNOWN") == 0)
+                continue;
+            std::string strName(name);
+            mapOpNames[strName] = (opcodetype)op;
+            // Convenience: OP_ADD and just ADD are both recognized:
+            boost::algorithm::replace_first(strName, "OP_", "");
+            mapOpNames[strName] = (opcodetype)op;
+        }
+    }
+
+    std::vector<std::string> words;
+    boost::algorithm::split(words, s, boost::algorithm::is_any_of(" \t\n"), boost::algorithm::token_compress_on);
+
+    for (std::vector<std::string>::const_iterator w = words.begin(); w != words.end(); ++w)
+    {
+        if (w->empty())
+        {
+            // Empty string, ignore. (boost::split given '' will return one word)
+        }
+        else if (all(*w, boost::algorithm::is_digit()) ||
+            (boost::algorithm::starts_with(*w, "-") && all(std::string(w->begin()+1, w->end()), boost::algorithm::is_digit())))
+        {
+            // Number
+            int64_t n = atoi64(*w);
+            result << n;
+        }
+        else if (boost::algorithm::starts_with(*w, "0x") && (w->begin()+2 != w->end()) && IsHex(std::string(w->begin()+2, w->end())))
+        {
+            // Raw hex data, inserted NOT pushed onto stack:
+            std::vector<unsigned char> raw = ParseHex(std::string(w->begin()+2, w->end()));
+            result.insert(result.end(), raw.begin(), raw.end());
+        }
+        else if (w->size() >= 2 && boost::algorithm::starts_with(*w, "'") && boost::algorithm::ends_with(*w, "'"))
+        {
+            // Single-quoted string, pushed as data. NOTE: this is poor-man's
+            // parsing, spaces/tabs/newlines in single-quoted strings won't work.
+            std::vector<unsigned char> value(w->begin()+1, w->end()-1);
+            result << value;
+        }
+        else if (mapOpNames.count(*w))
+        {
+            // opcode, e.g. OP_ADD or ADD:
+            result << mapOpNames[*w];
+        }
+        else
+        {
+            throw std::runtime_error("script parse error");
+        }
+    }
+
+    return result;
+}
+
+bool DecodeHexTx(CTransaction& tx, const std::string& strHexTx)
+{
+    if (!IsHex(strHexTx))
+        return false;
+
+    std::vector<unsigned char> txData(ParseHex(strHexTx));
+    CDataStream ssData(txData, SER_NETWORK, PROTOCOL_VERSION);
+    try {
+        ssData >> tx;
+    }
+    catch (const std::exception&) {
+        return false;
+    }
+
+    return true;
+}
+
+bool DecodeHexBlk(CBlock& block, const std::string& strHexBlk)
+{
+    if (!IsHex(strHexBlk))
+        return false;
+
+    std::vector<unsigned char> blockData(ParseHex(strHexBlk));
+    CDataStream ssBlock(blockData, SER_NETWORK, PROTOCOL_VERSION);
+    try {
+        ssBlock >> block;
+    }
+    catch (const std::exception&) {
+        return false;
+    }
+
+    return true;
+}
+
+uint256 ParseHashUV(const UniValue& v, const std::string& strName)
+{
+    std::string strHex;
+    if (v.isStr())
+        strHex = v.getValStr();
+    return ParseHashStr(strHex, strName);  // Note: ParseHashStr("") throws a runtime_error
+}
+
+uint256 ParseHashStr(const std::string& strHex, const std::string& strName)
+{
+    if (!IsHex(strHex)) // Note: IsHex("") is false
+        throw std::runtime_error(strName + " must be hexadecimal string (not '" + strHex + "')");
+
+    uint256 result;
+    result.SetHex(strHex);
+    return result;
+}
+
+std::vector<unsigned char> ParseHexUV(const UniValue& v, const std::string& strName)
+{
+    std::string strHex;
+    if (v.isStr())
+        strHex = v.getValStr();
+    if (!IsHex(strHex))
+        throw std::runtime_error(strName + " must be hexadecimal string (not '" + strHex + "')");
+    return ParseHex(strHex);
+}
diff --git a/depend/zcash/src/core_write.cpp b/depend/zcash/src/core_write.cpp
new file mode 100644
index 000000000..a809d1f51
--- /dev/null
+++ b/depend/zcash/src/core_write.cpp
@@ -0,0 +1,195 @@
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "core_io.h"
+
+#include "key_io.h"
+#include "primitives/transaction.h"
+#include "script/script.h"
+#include "script/standard.h"
+#include "serialize.h"
+#include "streams.h"
+#include <univalue.h>
+#include "util.h"
+#include "utilmoneystr.h"
+#include "utilstrencodings.h"
+
+#include <boost/assign/list_of.hpp>
+
+std::string FormatScript(const CScript& script)
+{
+    std::string ret;
+    CScript::const_iterator it = script.begin();
+    opcodetype op;
+    while (it != script.end()) {
+        CScript::const_iterator it2 = it;
+        std::vector<unsigned char> vch;
+        if (script.GetOp2(it, op, &vch)) {
+            if (op == OP_0) {
+                ret += "0 ";
+                continue;
+            } else if ((op >= OP_1 && op <= OP_16) || op == OP_1NEGATE) {
+                ret += strprintf("%i ", op - OP_1NEGATE - 1);
+                continue;
+            } else if (op >= OP_NOP && op <= OP_NOP10) {
+                std::string str(GetOpName(op));
+                if (str.substr(0, 3) == std::string("OP_")) {
+                    ret += str.substr(3, std::string::npos) + " ";
+                    continue;
+                }
+            }
+            if (vch.size() > 0) {
+                ret += strprintf("0x%x 0x%x ", HexStr(it2, it - vch.size()), HexStr(it - vch.size(), it));
+            } else {
+                ret += strprintf("0x%x ", HexStr(it2, it));
+            }
+            continue;
+        }
+        ret += strprintf("0x%x ", HexStr(it2, script.end()));
+        break;
+    }
+    return ret.substr(0, ret.size() - 1);
+}
+
+const std::map<unsigned char, std::string> mapSigHashTypes =
+    boost::assign::map_list_of
+    (static_cast<unsigned char>(SIGHASH_ALL), std::string("ALL"))
+    (static_cast<unsigned char>(SIGHASH_ALL|SIGHASH_ANYONECANPAY), std::string("ALL|ANYONECANPAY"))
+    (static_cast<unsigned char>(SIGHASH_NONE), std::string("NONE"))
+    (static_cast<unsigned char>(SIGHASH_NONE|SIGHASH_ANYONECANPAY), std::string("NONE|ANYONECANPAY"))
+    (static_cast<unsigned char>(SIGHASH_SINGLE), std::string("SINGLE"))
+    (static_cast<unsigned char>(SIGHASH_SINGLE|SIGHASH_ANYONECANPAY), std::string("SINGLE|ANYONECANPAY"))
+    ;
+
+/**
+ * Create the assembly string representation of a CScript object.
+ * @param[in] script    CScript object to convert into the asm string representation.
+ * @param[in] fAttemptSighashDecode    Whether to attempt to decode sighash types on data within the script that matches the format
+ *                                     of a signature. Only pass true for scripts you believe could contain signatures. For example,
+ *                                     pass false, or omit the this argument (defaults to false), for scriptPubKeys.
+ */
+std::string ScriptToAsmStr(const CScript& script, const bool fAttemptSighashDecode)
+{
+    std::string str;
+    opcodetype opcode;
+    std::vector<unsigned char> vch;
+    CScript::const_iterator pc = script.begin();
+    while (pc < script.end()) {
+        if (!str.empty()) {
+            str += " ";
+        }
+        if (!script.GetOp(pc, opcode, vch)) {
+            str += "[error]";
+            return str;
+        }
+        if (0 <= opcode && opcode <= OP_PUSHDATA4) {
+            if (vch.size() <= static_cast<std::vector<unsigned char>::size_type>(4)) {
+                str += strprintf("%d", CScriptNum(vch, false).getint());
+            } else {
+                // the IsUnspendable check makes sure not to try to decode OP_RETURN data that may match the format of a signature
+                if (fAttemptSighashDecode && !script.IsUnspendable()) {
+                    std::string strSigHashDecode;
+                    // goal: only attempt to decode a defined sighash type from data that looks like a signature within a scriptSig.
+                    // this won't decode correctly formatted public keys in Pubkey or Multisig scripts due to
+                    // the restrictions on the pubkey formats (see IsCompressedOrUncompressedPubKey) being incongruous with the
+                    // checks in CheckSignatureEncoding.
+                    if (CheckSignatureEncoding(vch, SCRIPT_VERIFY_STRICTENC, NULL)) {
+                        const unsigned char chSigHashType = vch.back();
+                        if (mapSigHashTypes.count(chSigHashType)) {
+                            strSigHashDecode = "[" + mapSigHashTypes.find(chSigHashType)->second + "]";
+                            vch.pop_back(); // remove the sighash type byte. it will be replaced by the decode.
+                        }
+                    }
+                    str += HexStr(vch) + strSigHashDecode;
+                } else {
+                    str += HexStr(vch);
+                }
+            }
+        } else {
+            str += GetOpName(opcode);
+        }
+    }
+    return str;
+}
+
+std::string EncodeHexTx(const CTransaction& tx)
+{
+    CDataStream ssTx(SER_NETWORK, PROTOCOL_VERSION);
+    ssTx << tx;
+    return HexStr(ssTx.begin(), ssTx.end());
+}
+
+void ScriptPubKeyToUniv(const CScript& scriptPubKey,
+                        UniValue& out, bool fIncludeHex)
+{
+    txnouttype type;
+    std::vector<CTxDestination> addresses;
+    int nRequired;
+
+    out.pushKV("asm", ScriptToAsmStr(scriptPubKey));
+    if (fIncludeHex)
+        out.pushKV("hex", HexStr(scriptPubKey.begin(), scriptPubKey.end()));
+
+    if (!ExtractDestinations(scriptPubKey, type, addresses, nRequired)) {
+        out.pushKV("type", GetTxnOutputType(type));
+        return;
+    }
+
+    out.pushKV("reqSigs", nRequired);
+    out.pushKV("type", GetTxnOutputType(type));
+
+    KeyIO keyIO(Params());
+    UniValue a(UniValue::VARR);
+    for (const CTxDestination& addr : addresses) {
+        a.push_back(keyIO.EncodeDestination(addr));
+    }
+    out.pushKV("addresses", a);
+}
+
+void TxToUniv(const CTransaction& tx, const uint256& hashBlock, UniValue& entry)
+{
+    entry.pushKV("txid", tx.GetHash().GetHex());
+    entry.pushKV("version", tx.nVersion);
+    entry.pushKV("locktime", (int64_t)tx.nLockTime);
+
+    UniValue vin(UniValue::VARR);
+    for (const CTxIn& txin : tx.vin) {
+        UniValue in(UniValue::VOBJ);
+        if (tx.IsCoinBase())
+            in.pushKV("coinbase", HexStr(txin.scriptSig.begin(), txin.scriptSig.end()));
+        else {
+            in.pushKV("txid", txin.prevout.hash.GetHex());
+            in.pushKV("vout", (int64_t)txin.prevout.n);
+            UniValue o(UniValue::VOBJ);
+            o.pushKV("asm", ScriptToAsmStr(txin.scriptSig, true));
+            o.pushKV("hex", HexStr(txin.scriptSig.begin(), txin.scriptSig.end()));
+            in.pushKV("scriptSig", o);
+        }
+        in.pushKV("sequence", (int64_t)txin.nSequence);
+        vin.push_back(in);
+    }
+    entry.pushKV("vin", vin);
+
+    UniValue vout(UniValue::VARR);
+    for (unsigned int i = 0; i < tx.vout.size(); i++) {
+        const CTxOut& txout = tx.vout[i];
+
+        UniValue out(UniValue::VOBJ);
+
+        UniValue outValue(UniValue::VNUM, FormatMoney(txout.nValue));
+        out.pushKV("value", outValue);
+        out.pushKV("n", (int64_t)i);
+
+        UniValue o(UniValue::VOBJ);
+        ScriptPubKeyToUniv(txout.scriptPubKey, o, true);
+        out.pushKV("scriptPubKey", o);
+        vout.push_back(out);
+    }
+    entry.pushKV("vout", vout);
+
+    if (!hashBlock.IsNull())
+        entry.pushKV("blockhash", hashBlock.GetHex());
+
+    entry.pushKV("hex", EncodeHexTx(tx)); // the hex-encoded transaction. used the name "hex" to be consistent with the verbose output of "getrawtransaction".
+}
diff --git a/depend/zcash/src/crypto/aes.cpp b/depend/zcash/src/crypto/aes.cpp
new file mode 100644
index 000000000..1d469d0fb
--- /dev/null
+++ b/depend/zcash/src/crypto/aes.cpp
@@ -0,0 +1,217 @@
+// Copyright (c) 2016 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or http://www.opensource.org/licenses/mit-license.php.
+
+#include "aes.h"
+#include "crypto/common.h"
+
+#include <assert.h>
+#include <string.h>
+
+extern "C" {
+#include "crypto/ctaes/ctaes.c"
+}
+
+AES128Encrypt::AES128Encrypt(const unsigned char key[16])
+{
+    AES128_init(&ctx, key);
+}
+
+AES128Encrypt::~AES128Encrypt()
+{
+    memset(&ctx, 0, sizeof(ctx));
+}
+
+void AES128Encrypt::Encrypt(unsigned char ciphertext[16], const unsigned char plaintext[16]) const
+{
+    AES128_encrypt(&ctx, 1, ciphertext, plaintext);
+}
+
+AES128Decrypt::AES128Decrypt(const unsigned char key[16])
+{
+    AES128_init(&ctx, key);
+}
+
+AES128Decrypt::~AES128Decrypt()
+{
+    memset(&ctx, 0, sizeof(ctx));
+}
+
+void AES128Decrypt::Decrypt(unsigned char plaintext[16], const unsigned char ciphertext[16]) const
+{
+    AES128_decrypt(&ctx, 1, plaintext, ciphertext);
+}
+
+AES256Encrypt::AES256Encrypt(const unsigned char key[32])
+{
+    AES256_init(&ctx, key);
+}
+
+AES256Encrypt::~AES256Encrypt()
+{
+    memset(&ctx, 0, sizeof(ctx));
+}
+
+void AES256Encrypt::Encrypt(unsigned char ciphertext[16], const unsigned char plaintext[16]) const
+{
+    AES256_encrypt(&ctx, 1, ciphertext, plaintext);
+}
+
+AES256Decrypt::AES256Decrypt(const unsigned char key[32])
+{
+    AES256_init(&ctx, key);
+}
+
+AES256Decrypt::~AES256Decrypt()
+{
+    memset(&ctx, 0, sizeof(ctx));
+}
+
+void AES256Decrypt::Decrypt(unsigned char plaintext[16], const unsigned char ciphertext[16]) const
+{
+    AES256_decrypt(&ctx, 1, plaintext, ciphertext);
+}
+
+
+template <typename T>
+static int CBCEncrypt(const T& enc, const unsigned char iv[AES_BLOCKSIZE], const unsigned char* data, int size, bool pad, unsigned char* out)
+{
+    int written = 0;
+    int padsize = size % AES_BLOCKSIZE;
+    unsigned char mixed[AES_BLOCKSIZE];
+
+    if (!data || !size || !out)
+        return 0;
+
+    if (!pad && padsize != 0)
+        return 0;
+
+    memcpy(mixed, iv, AES_BLOCKSIZE);
+
+    // Write all but the last block
+    while (written + AES_BLOCKSIZE <= size) {
+        for (int i = 0; i != AES_BLOCKSIZE; i++)
+            mixed[i] ^= *data++;
+        enc.Encrypt(out + written, mixed);
+        memcpy(mixed, out + written, AES_BLOCKSIZE);
+        written += AES_BLOCKSIZE;
+    }
+    if (pad) {
+        // For all that remains, pad each byte with the value of the remaining
+        // space. If there is none, pad by a full block.
+        for (int i = 0; i != padsize; i++)
+            mixed[i] ^= *data++;
+        for (int i = padsize; i != AES_BLOCKSIZE; i++)
+            mixed[i] ^= AES_BLOCKSIZE - padsize;
+        enc.Encrypt(out + written, mixed);
+        written += AES_BLOCKSIZE;
+    }
+    return written;
+}
+
+template <typename T>
+static int CBCDecrypt(const T& dec, const unsigned char iv[AES_BLOCKSIZE], const unsigned char* data, int size, bool pad, unsigned char* out)
+{
+    unsigned char padsize = 0;
+    int written = 0;
+    bool fail = false;
+    const unsigned char* prev = iv;
+
+    if (!data || !size || !out)
+        return 0;
+
+    if (size % AES_BLOCKSIZE != 0)
+        return 0;
+
+    // Decrypt all data. Padding will be checked in the output.
+    while (written != size) {
+        dec.Decrypt(out, data + written);
+        for (int i = 0; i != AES_BLOCKSIZE; i++)
+            *out++ ^= prev[i];
+        prev = data + written;
+        written += AES_BLOCKSIZE;
+    }
+
+    // When decrypting padding, attempt to run in constant-time
+    if (pad) {
+        // If used, padding size is the value of the last decrypted byte. For
+        // it to be valid, It must be between 1 and AES_BLOCKSIZE.
+        padsize = *--out;
+        fail = !padsize | (padsize > AES_BLOCKSIZE);
+
+        // If not well-formed, treat it as though there's no padding.
+        padsize *= !fail;
+
+        // All padding must equal the last byte otherwise it's not well-formed
+        for (int i = AES_BLOCKSIZE; i != 0; i--)
+            fail |= ((i > AES_BLOCKSIZE - padsize) & (*out-- != padsize));
+
+        written -= padsize;
+    }
+    return written * !fail;
+}
+
+AES256CBCEncrypt::AES256CBCEncrypt(const unsigned char key[AES256_KEYSIZE], const unsigned char ivIn[AES_BLOCKSIZE], bool padIn)
+    : enc(key), pad(padIn)
+{
+    memcpy(iv, ivIn, AES_BLOCKSIZE);
+}
+
+int AES256CBCEncrypt::Encrypt(const unsigned char* data, int size, unsigned char* out) const
+{
+    return CBCEncrypt(enc, iv, data, size, pad, out);
+}
+
+AES256CBCEncrypt::~AES256CBCEncrypt()
+{
+    memset(iv, 0, sizeof(iv));
+}
+
+AES256CBCDecrypt::AES256CBCDecrypt(const unsigned char key[AES256_KEYSIZE], const unsigned char ivIn[AES_BLOCKSIZE], bool padIn)
+    : dec(key), pad(padIn)
+{
+    memcpy(iv, ivIn, AES_BLOCKSIZE);
+}
+
+
+int AES256CBCDecrypt::Decrypt(const unsigned char* data, int size, unsigned char* out) const
+{
+    return CBCDecrypt(dec, iv, data, size, pad, out);
+}
+
+AES256CBCDecrypt::~AES256CBCDecrypt()
+{
+    memset(iv, 0, sizeof(iv));
+}
+
+AES128CBCEncrypt::AES128CBCEncrypt(const unsigned char key[AES128_KEYSIZE], const unsigned char ivIn[AES_BLOCKSIZE], bool padIn)
+    : enc(key), pad(padIn)
+{
+    memcpy(iv, ivIn, AES_BLOCKSIZE);
+}
+
+AES128CBCEncrypt::~AES128CBCEncrypt()
+{
+    memset(iv, 0, AES_BLOCKSIZE);
+}
+
+int AES128CBCEncrypt::Encrypt(const unsigned char* data, int size, unsigned char* out) const
+{
+    return CBCEncrypt(enc, iv, data, size, pad, out);
+}
+
+AES128CBCDecrypt::AES128CBCDecrypt(const unsigned char key[AES128_KEYSIZE], const unsigned char ivIn[AES_BLOCKSIZE], bool padIn)
+    : dec(key), pad(padIn)
+{
+    memcpy(iv, ivIn, AES_BLOCKSIZE);
+}
+
+AES128CBCDecrypt::~AES128CBCDecrypt()
+{
+    memset(iv, 0, AES_BLOCKSIZE);
+}
+
+int AES128CBCDecrypt::Decrypt(const unsigned char* data, int size, unsigned char* out) const
+{
+    return CBCDecrypt(dec, iv, data, size, pad, out);
+}
diff --git a/depend/zcash/src/crypto/aes.h b/depend/zcash/src/crypto/aes.h
new file mode 100644
index 000000000..8cae357c1
--- /dev/null
+++ b/depend/zcash/src/crypto/aes.h
@@ -0,0 +1,118 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or http://www.opensource.org/licenses/mit-license.php.
+//
+// C++ wrapper around ctaes, a constant-time AES implementation
+
+#ifndef BITCOIN_CRYPTO_AES_H
+#define BITCOIN_CRYPTO_AES_H
+
+extern "C" {
+#include "crypto/ctaes/ctaes.h"
+}
+
+static const int AES_BLOCKSIZE = 16;
+static const int AES128_KEYSIZE = 16;
+static const int AES256_KEYSIZE = 32;
+
+/** An encryption class for AES-128. */
+class AES128Encrypt
+{
+private:
+    AES128_ctx ctx;
+
+public:
+    AES128Encrypt(const unsigned char key[16]);
+    ~AES128Encrypt();
+    void Encrypt(unsigned char ciphertext[16], const unsigned char plaintext[16]) const;
+};
+
+/** A decryption class for AES-128. */
+class AES128Decrypt
+{
+private:
+    AES128_ctx ctx;
+
+public:
+    AES128Decrypt(const unsigned char key[16]);
+    ~AES128Decrypt();
+    void Decrypt(unsigned char plaintext[16], const unsigned char ciphertext[16]) const;
+};
+
+/** An encryption class for AES-256. */
+class AES256Encrypt
+{
+private:
+    AES256_ctx ctx;
+
+public:
+    AES256Encrypt(const unsigned char key[32]);
+    ~AES256Encrypt();
+    void Encrypt(unsigned char ciphertext[16], const unsigned char plaintext[16]) const;
+};
+
+/** A decryption class for AES-256. */
+class AES256Decrypt
+{
+private:
+    AES256_ctx ctx;
+
+public:
+    AES256Decrypt(const unsigned char key[32]);
+    ~AES256Decrypt();
+    void Decrypt(unsigned char plaintext[16], const unsigned char ciphertext[16]) const;
+};
+
+class AES256CBCEncrypt
+{
+public:
+    AES256CBCEncrypt(const unsigned char key[AES256_KEYSIZE], const unsigned char ivIn[AES_BLOCKSIZE], bool padIn);
+    ~AES256CBCEncrypt();
+    int Encrypt(const unsigned char* data, int size, unsigned char* out) const;
+
+private:
+    const AES256Encrypt enc;
+    const bool pad;
+    unsigned char iv[AES_BLOCKSIZE];
+};
+
+class AES256CBCDecrypt
+{
+public:
+    AES256CBCDecrypt(const unsigned char key[AES256_KEYSIZE], const unsigned char ivIn[AES_BLOCKSIZE], bool padIn);
+    ~AES256CBCDecrypt();
+    int Decrypt(const unsigned char* data, int size, unsigned char* out) const;
+
+private:
+    const AES256Decrypt dec;
+    const bool pad;
+    unsigned char iv[AES_BLOCKSIZE];
+};
+
+class AES128CBCEncrypt
+{
+public:
+    AES128CBCEncrypt(const unsigned char key[AES128_KEYSIZE], const unsigned char ivIn[AES_BLOCKSIZE], bool padIn);
+    ~AES128CBCEncrypt();
+    int Encrypt(const unsigned char* data, int size, unsigned char* out) const;
+
+private:
+    const AES128Encrypt enc;
+    const bool pad;
+    unsigned char iv[AES_BLOCKSIZE];
+};
+
+class AES128CBCDecrypt
+{
+public:
+    AES128CBCDecrypt(const unsigned char key[AES128_KEYSIZE], const unsigned char ivIn[AES_BLOCKSIZE], bool padIn);
+    ~AES128CBCDecrypt();
+    int Decrypt(const unsigned char* data, int size, unsigned char* out) const;
+
+private:
+    const AES128Decrypt dec;
+    const bool pad;
+    unsigned char iv[AES_BLOCKSIZE];
+};
+
+#endif // BITCOIN_CRYPTO_AES_H
diff --git a/depend/zcash/src/crypto/chacha20.cpp b/depend/zcash/src/crypto/chacha20.cpp
new file mode 100644
index 000000000..816ae870e
--- /dev/null
+++ b/depend/zcash/src/crypto/chacha20.cpp
@@ -0,0 +1,180 @@
+// Copyright (c) 2017 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or http://www.opensource.org/licenses/mit-license.php.
+
+// Based on the public domain implementation 'merged' by D. J. Bernstein
+// See https://cr.yp.to/chacha.html.
+
+#include "crypto/common.h"
+#include "crypto/chacha20.h"
+
+#include <string.h>
+
+constexpr static inline uint32_t rotl32(uint32_t v, int c) { return (v << c) | (v >> (32 - c)); }
+
+#define QUARTERROUND(a,b,c,d) \
+  a += b; d = rotl32(d ^ a, 16); \
+  c += d; b = rotl32(b ^ c, 12); \
+  a += b; d = rotl32(d ^ a, 8); \
+  c += d; b = rotl32(b ^ c, 7);
+
+static const unsigned char sigma[] = "expand 32-byte k";
+static const unsigned char tau[] = "expand 16-byte k";
+
+void ChaCha20::SetKey(const unsigned char* k, size_t keylen)
+{
+    const unsigned char *constants;
+
+    input[4] = ReadLE32(k + 0);
+    input[5] = ReadLE32(k + 4);
+    input[6] = ReadLE32(k + 8);
+    input[7] = ReadLE32(k + 12);
+    if (keylen == 32) { /* recommended */
+        k += 16;
+        constants = sigma;
+    } else { /* keylen == 16 */
+        constants = tau;
+    }
+    input[8] = ReadLE32(k + 0);
+    input[9] = ReadLE32(k + 4);
+    input[10] = ReadLE32(k + 8);
+    input[11] = ReadLE32(k + 12);
+    input[0] = ReadLE32(constants + 0);
+    input[1] = ReadLE32(constants + 4);
+    input[2] = ReadLE32(constants + 8);
+    input[3] = ReadLE32(constants + 12);
+    input[12] = 0;
+    input[13] = 0;
+    input[14] = 0;
+    input[15] = 0;
+}
+
+ChaCha20::ChaCha20()
+{
+    memset(input, 0, sizeof(input));
+}
+
+ChaCha20::ChaCha20(const unsigned char* k, size_t keylen)
+{
+    SetKey(k, keylen);
+}
+
+void ChaCha20::SetIV(uint64_t iv)
+{
+    input[14] = iv;
+    input[15] = iv >> 32;
+}
+
+void ChaCha20::Seek(uint64_t pos)
+{
+    input[12] = pos;
+    input[13] = pos >> 32;
+}
+
+void ChaCha20::Output(unsigned char* c, size_t bytes)
+{
+    uint32_t x0, x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12, x13, x14, x15;
+    uint32_t j0, j1, j2, j3, j4, j5, j6, j7, j8, j9, j10, j11, j12, j13, j14, j15;
+    unsigned char *ctarget = NULL;
+    unsigned char tmp[64];
+    unsigned int i;
+
+    if (!bytes) return;
+
+    j0 = input[0];
+    j1 = input[1];
+    j2 = input[2];
+    j3 = input[3];
+    j4 = input[4];
+    j5 = input[5];
+    j6 = input[6];
+    j7 = input[7];
+    j8 = input[8];
+    j9 = input[9];
+    j10 = input[10];
+    j11 = input[11];
+    j12 = input[12];
+    j13 = input[13];
+    j14 = input[14];
+    j15 = input[15];
+
+    for (;;) {
+        if (bytes < 64) {
+            ctarget = c;
+            c = tmp;
+        }
+        x0 = j0;
+        x1 = j1;
+        x2 = j2;
+        x3 = j3;
+        x4 = j4;
+        x5 = j5;
+        x6 = j6;
+        x7 = j7;
+        x8 = j8;
+        x9 = j9;
+        x10 = j10;
+        x11 = j11;
+        x12 = j12;
+        x13 = j13;
+        x14 = j14;
+        x15 = j15;
+        for (i = 20;i > 0;i -= 2) {
+            QUARTERROUND( x0, x4, x8,x12)
+            QUARTERROUND( x1, x5, x9,x13)
+            QUARTERROUND( x2, x6,x10,x14)
+            QUARTERROUND( x3, x7,x11,x15)
+            QUARTERROUND( x0, x5,x10,x15)
+            QUARTERROUND( x1, x6,x11,x12)
+            QUARTERROUND( x2, x7, x8,x13)
+            QUARTERROUND( x3, x4, x9,x14)
+        }
+        x0 += j0;
+        x1 += j1;
+        x2 += j2;
+        x3 += j3;
+        x4 += j4;
+        x5 += j5;
+        x6 += j6;
+        x7 += j7;
+        x8 += j8;
+        x9 += j9;
+        x10 += j10;
+        x11 += j11;
+        x12 += j12;
+        x13 += j13;
+        x14 += j14;
+        x15 += j15;
+
+        ++j12;
+        if (!j12) ++j13;
+
+        WriteLE32(c + 0, x0);
+        WriteLE32(c + 4, x1);
+        WriteLE32(c + 8, x2);
+        WriteLE32(c + 12, x3);
+        WriteLE32(c + 16, x4);
+        WriteLE32(c + 20, x5);
+        WriteLE32(c + 24, x6);
+        WriteLE32(c + 28, x7);
+        WriteLE32(c + 32, x8);
+        WriteLE32(c + 36, x9);
+        WriteLE32(c + 40, x10);
+        WriteLE32(c + 44, x11);
+        WriteLE32(c + 48, x12);
+        WriteLE32(c + 52, x13);
+        WriteLE32(c + 56, x14);
+        WriteLE32(c + 60, x15);
+
+        if (bytes <= 64) {
+            if (bytes < 64) {
+                for (i = 0;i < bytes;++i) ctarget[i] = c[i];
+            }
+            input[12] = j12;
+            input[13] = j13;
+            return;
+        }
+        bytes -= 64;
+        c += 64;
+    }
+}
diff --git a/depend/zcash/src/crypto/chacha20.h b/depend/zcash/src/crypto/chacha20.h
new file mode 100644
index 000000000..a305977bc
--- /dev/null
+++ b/depend/zcash/src/crypto/chacha20.h
@@ -0,0 +1,26 @@
+// Copyright (c) 2017 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or http://www.opensource.org/licenses/mit-license.php.
+
+#ifndef BITCOIN_CRYPTO_CHACHA20_H
+#define BITCOIN_CRYPTO_CHACHA20_H
+
+#include <stdint.h>
+#include <stdlib.h>
+
+/** A PRNG class for ChaCha20. */
+class ChaCha20
+{
+private:
+    uint32_t input[16];
+
+public:
+    ChaCha20();
+    ChaCha20(const unsigned char* key, size_t keylen);
+    void SetKey(const unsigned char* key, size_t keylen);
+    void SetIV(uint64_t iv);
+    void Seek(uint64_t pos);
+    void Output(unsigned char* output, size_t bytes);
+};
+
+#endif // BITCOIN_CRYPTO_CHACHA20_H
diff --git a/depend/zcash/src/crypto/common.h b/depend/zcash/src/crypto/common.h
new file mode 100644
index 000000000..3ddbaf432
--- /dev/null
+++ b/depend/zcash/src/crypto/common.h
@@ -0,0 +1,108 @@
+// Copyright (c) 2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_CRYPTO_COMMON_H
+#define BITCOIN_CRYPTO_COMMON_H
+
+#if defined(HAVE_CONFIG_H)
+#include "config/bitcoin-config.h"
+#endif
+
+#include <stdint.h>
+#include <assert.h>
+#include <string.h>
+
+#include "compat/endian.h"
+
+#if defined(NDEBUG)
+# error "Zcash cannot be compiled without assertions."
+#endif
+
+uint16_t static inline ReadLE16(const unsigned char* ptr)
+{
+    uint16_t x;
+    memcpy((char*)&x, ptr, 2);
+    return le16toh(x);
+}
+
+uint32_t static inline ReadLE32(const unsigned char* ptr)
+{
+    uint32_t x;
+    memcpy((char*)&x, ptr, 4);
+    return le32toh(x);
+}
+
+uint64_t static inline ReadLE64(const unsigned char* ptr)
+{
+    uint64_t x;
+    memcpy((char*)&x, ptr, 8);
+    return le64toh(x);
+}
+
+void static inline WriteLE16(unsigned char* ptr, uint16_t x)
+{
+    uint16_t v = htole16(x);
+    memcpy(ptr, (char*)&v, 2);
+}
+
+void static inline WriteLE32(unsigned char* ptr, uint32_t x)
+{
+    uint32_t v = htole32(x);
+    memcpy(ptr, (char*)&v, 4);
+}
+
+void static inline WriteLE64(unsigned char* ptr, uint64_t x)
+{
+    uint64_t v = htole64(x);
+    memcpy(ptr, (char*)&v, 8);
+}
+
+uint32_t static inline ReadBE32(const unsigned char* ptr)
+{
+    uint32_t x;
+    memcpy((char*)&x, ptr, 4);
+    return be32toh(x);
+}
+
+uint64_t static inline ReadBE64(const unsigned char* ptr)
+{
+    uint64_t x;
+    memcpy((char*)&x, ptr, 8);
+    return be64toh(x);
+}
+
+void static inline WriteBE32(unsigned char* ptr, uint32_t x)
+{
+    uint32_t v = htobe32(x);
+    memcpy(ptr, (char*)&v, 4);
+}
+
+void static inline WriteBE64(unsigned char* ptr, uint64_t x)
+{
+    uint64_t v = htobe64(x);
+    memcpy(ptr, (char*)&v, 8);
+}
+
+/** Return the smallest number n such that (x >> n) == 0 (or 64 if the highest bit in x is set. */
+uint64_t static inline CountBits(uint64_t x)
+{
+#ifdef HAVE_DECL___BUILTIN_CLZL
+    if (sizeof(unsigned long) >= sizeof(uint64_t)) {
+        return x ? 8 * sizeof(unsigned long) - __builtin_clzl(x) : 0;
+    }
+#endif
+#ifdef HAVE_DECL___BUILTIN_CLZLL
+    if (sizeof(unsigned long long) >= sizeof(uint64_t)) {
+        return x ? 8 * sizeof(unsigned long long) - __builtin_clzll(x) : 0;
+    }
+#endif
+    int ret = 0;
+    while (x) {
+        x >>= 1;
+        ++ret;
+    }
+    return ret;
+}
+
+#endif // BITCOIN_CRYPTO_COMMON_H
diff --git a/depend/zcash/src/crypto/ctaes/COPYING b/depend/zcash/src/crypto/ctaes/COPYING
new file mode 100644
index 000000000..415b202a2
--- /dev/null
+++ b/depend/zcash/src/crypto/ctaes/COPYING
@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2016 Pieter Wuille
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
diff --git a/depend/zcash/src/crypto/ctaes/README.md b/depend/zcash/src/crypto/ctaes/README.md
new file mode 100644
index 000000000..0e7fe1775
--- /dev/null
+++ b/depend/zcash/src/crypto/ctaes/README.md
@@ -0,0 +1,41 @@
+ctaes
+=====
+
+Simple C module for constant-time AES encryption and decryption.
+
+Features:
+* Simple, pure C code without any dependencies.
+* No tables or data-dependent branches whatsoever, but using bit sliced approach from https://eprint.iacr.org/2009/129.pdf.
+* Very small object code: slightly over 4k of executable code when compiled with -Os.
+* Slower than implementations based on precomputed tables or specialized instructions, but can do ~15 MB/s on modern CPUs.
+
+Performance
+-----------
+
+Compiled with GCC 5.3.1 with -O3, on an Intel(R) Core(TM) i7-4800MQ CPU, numbers in CPU cycles:
+
+| Algorithm | Key schedule | Encryption per byte | Decryption per byte |
+| --------- | ------------:| -------------------:| -------------------:|
+| AES-128   |         2.8k |                 154 |                 161 |
+| AES-192   |         3.1k |                 169 |                 181 |
+| AES-256   |         4.0k |                 191 |                 203 |
+
+Build steps
+-----------
+
+Object code:
+
+    $ gcc -O3 ctaes.c -c -o ctaes.o
+
+Tests:
+
+    $ gcc -O3 ctaes.c test.c -o test
+
+Benchmark:
+
+    $ gcc -O3 ctaes.c bench.c -o bench
+
+Review
+------
+
+Results of a formal review of the code can be found in http://bitcoin.sipa.be/ctaes/review.zip
diff --git a/depend/zcash/src/crypto/ctaes/bench.c b/depend/zcash/src/crypto/ctaes/bench.c
new file mode 100644
index 000000000..a86df496c
--- /dev/null
+++ b/depend/zcash/src/crypto/ctaes/bench.c
@@ -0,0 +1,170 @@
+#include <stdio.h>
+#include <math.h>
+#include "sys/time.h"
+
+#include "ctaes.h"
+
+static double gettimedouble(void) {
+    struct timeval tv;
+    gettimeofday(&tv, NULL);
+    return tv.tv_usec * 0.000001 + tv.tv_sec;
+}
+
+static void print_number(double x) {
+    double y = x;
+    int c = 0;
+    if (y < 0.0) {
+        y = -y;
+    }
+    while (y < 100.0) {
+        y *= 10.0;
+        c++;
+    }
+    printf("%.*f", c, x);
+}
+
+static void run_benchmark(char *name, void (*benchmark)(void*), void (*setup)(void*), void (*teardown)(void*), void* data, int count, int iter) {
+    int i;
+    double min = HUGE_VAL;
+    double sum = 0.0;
+    double max = 0.0;
+    for (i = 0; i < count; i++) {
+        double begin, total;
+        if (setup != NULL) {
+            setup(data);
+        }
+        begin = gettimedouble();
+        benchmark(data);
+        total = gettimedouble() - begin;
+        if (teardown != NULL) {
+            teardown(data);
+        }
+        if (total < min) {
+            min = total;
+        }
+        if (total > max) {
+            max = total;
+        }
+        sum += total;
+    }
+    printf("%s: min ", name);
+    print_number(min * 1000000000.0 / iter);
+    printf("ns / avg ");
+    print_number((sum / count) * 1000000000.0 / iter);
+    printf("ns / max ");
+    print_number(max * 1000000000.0 / iter);
+    printf("ns\n");
+}
+
+static void bench_AES128_init(void* data) {
+    AES128_ctx* ctx = (AES128_ctx*)data;
+    int i;
+    for (i = 0; i < 50000; i++) {
+        AES128_init(ctx, (unsigned char*)ctx);
+    }
+}
+
+static void bench_AES128_encrypt_setup(void* data) {
+    AES128_ctx* ctx = (AES128_ctx*)data;
+    static const unsigned char key[16] = {0};
+    AES128_init(ctx, key);
+}
+
+static void bench_AES128_encrypt(void* data) {
+    const AES128_ctx* ctx = (const AES128_ctx*)data;
+    unsigned char scratch[16] = {0};
+    int i;
+    for (i = 0; i < 4000000 / 16; i++) {
+        AES128_encrypt(ctx, 1, scratch, scratch);
+    }
+}
+
+static void bench_AES128_decrypt(void* data) {
+    const AES128_ctx* ctx = (const AES128_ctx*)data;
+    unsigned char scratch[16] = {0};
+    int i;
+    for (i = 0; i < 4000000 / 16; i++) {
+        AES128_decrypt(ctx, 1, scratch, scratch);
+    }
+}
+
+static void bench_AES192_init(void* data) {
+    AES192_ctx* ctx = (AES192_ctx*)data;
+    int i;
+    for (i = 0; i < 50000; i++) {
+        AES192_init(ctx, (unsigned char*)ctx);
+    }
+}
+
+static void bench_AES192_encrypt_setup(void* data) {
+    AES192_ctx* ctx = (AES192_ctx*)data;
+    static const unsigned char key[16] = {0};
+    AES192_init(ctx, key);
+}
+
+static void bench_AES192_encrypt(void* data) {
+    const AES192_ctx* ctx = (const AES192_ctx*)data;
+    unsigned char scratch[16] = {0};
+    int i;
+    for (i = 0; i < 4000000 / 16; i++) {
+        AES192_encrypt(ctx, 1, scratch, scratch);
+    }
+}
+
+static void bench_AES192_decrypt(void* data) {
+    const AES192_ctx* ctx = (const AES192_ctx*)data;
+    unsigned char scratch[16] = {0};
+    int i;
+    for (i = 0; i < 4000000 / 16; i++) {
+        AES192_decrypt(ctx, 1, scratch, scratch);
+    }
+}
+
+static void bench_AES256_init(void* data) {
+    AES256_ctx* ctx = (AES256_ctx*)data;
+    int i;
+    for (i = 0; i < 50000; i++) {
+        AES256_init(ctx, (unsigned char*)ctx);
+    }
+}
+
+
+static void bench_AES256_encrypt_setup(void* data) {
+    AES256_ctx* ctx = (AES256_ctx*)data;
+    static const unsigned char key[16] = {0};
+    AES256_init(ctx, key);
+}
+
+static void bench_AES256_encrypt(void* data) {
+    const AES256_ctx* ctx = (const AES256_ctx*)data;
+    unsigned char scratch[16] = {0};
+    int i;
+    for (i = 0; i < 4000000 / 16; i++) {
+        AES256_encrypt(ctx, 1, scratch, scratch);
+    }
+}
+
+static void bench_AES256_decrypt(void* data) {
+    const AES256_ctx* ctx = (const AES256_ctx*)data;
+    unsigned char scratch[16] = {0};
+    int i;
+    for (i = 0; i < 4000000 / 16; i++) {
+        AES256_decrypt(ctx, 1, scratch, scratch);
+    }
+}
+
+int main(void) {
+    AES128_ctx ctx128;
+    AES192_ctx ctx192;
+    AES256_ctx ctx256;
+    run_benchmark("aes128_init", bench_AES128_init, NULL, NULL, &ctx128, 20, 50000);
+    run_benchmark("aes128_encrypt_byte", bench_AES128_encrypt, bench_AES128_encrypt_setup, NULL, &ctx128, 20, 4000000);
+    run_benchmark("aes128_decrypt_byte", bench_AES128_decrypt, bench_AES128_encrypt_setup, NULL, &ctx128, 20, 4000000);
+    run_benchmark("aes192_init", bench_AES192_init, NULL, NULL, &ctx192, 20, 50000);
+    run_benchmark("aes192_encrypt_byte", bench_AES192_encrypt, bench_AES192_encrypt_setup, NULL, &ctx192, 20, 4000000);
+    run_benchmark("aes192_decrypt_byte", bench_AES192_decrypt, bench_AES192_encrypt_setup, NULL, &ctx192, 20, 4000000);
+    run_benchmark("aes256_init", bench_AES256_init, NULL, NULL, &ctx256, 20, 50000);
+    run_benchmark("aes256_encrypt_byte", bench_AES256_encrypt, bench_AES256_encrypt_setup, NULL, &ctx256, 20, 4000000);
+    run_benchmark("aes256_decrypt_byte", bench_AES256_decrypt, bench_AES256_encrypt_setup, NULL, &ctx256, 20, 4000000);
+    return 0;
+}
diff --git a/depend/zcash/src/crypto/ctaes/ctaes.c b/depend/zcash/src/crypto/ctaes/ctaes.c
new file mode 100644
index 000000000..55962bf25
--- /dev/null
+++ b/depend/zcash/src/crypto/ctaes/ctaes.c
@@ -0,0 +1,556 @@
+ /*********************************************************************
+ * Copyright (c) 2016 Pieter Wuille                                   *
+ * Distributed under the MIT software license, see the accompanying   *
+ * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
+ **********************************************************************/
+
+/* Constant time, unoptimized, concise, plain C, AES implementation
+ * Based On:
+ *   Emilia Kasper and Peter Schwabe, Faster and Timing-Attack Resistant AES-GCM
+ *   http://www.iacr.org/archive/ches2009/57470001/57470001.pdf
+ * But using 8 16-bit integers representing a single AES state rather than 8 128-bit
+ * integers representing 8 AES states.
+ */
+
+#include "ctaes.h"
+
+/* Slice variable slice_i contains the i'th bit of the 16 state variables in this order:
+ *  0  1  2  3
+ *  4  5  6  7
+ *  8  9 10 11
+ * 12 13 14 15
+ */
+
+/** Convert a byte to sliced form, storing it corresponding to given row and column in s */
+static void LoadByte(AES_state* s, unsigned char byte, int r, int c) {
+    int i;
+    for (i = 0; i < 8; i++) {
+        s->slice[i] |= (byte & 1) << (r * 4 + c);
+        byte >>= 1;
+    }
+}
+
+/** Load 16 bytes of data into 8 sliced integers */
+static void LoadBytes(AES_state *s, const unsigned char* data16) {
+    int c;
+    for (c = 0; c < 4; c++) {
+        int r;
+        for (r = 0; r < 4; r++) {
+            LoadByte(s, *(data16++), r, c);
+        }
+    }
+}
+
+/** Convert 8 sliced integers into 16 bytes of data */
+static void SaveBytes(unsigned char* data16, const AES_state *s) {
+    int c;
+    for (c = 0; c < 4; c++) {
+        int r;
+        for (r = 0; r < 4; r++) {
+            int b;
+            uint8_t v = 0;
+            for (b = 0; b < 8; b++) {
+                v |= ((s->slice[b] >> (r * 4 + c)) & 1) << b;
+            }
+            *(data16++) = v;
+        }
+    }
+}
+
+/* S-box implementation based on the gate logic from:
+ *   Joan Boyar and Rene Peralta, A depth-16 circuit for the AES S-box.
+ *   https://eprint.iacr.org/2011/332.pdf
+*/
+static void SubBytes(AES_state *s, int inv) {
+    /* Load the bit slices */
+    uint16_t U0 = s->slice[7], U1 = s->slice[6], U2 = s->slice[5], U3 = s->slice[4];
+    uint16_t U4 = s->slice[3], U5 = s->slice[2], U6 = s->slice[1], U7 = s->slice[0];
+
+    uint16_t T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16;
+    uint16_t T17, T18, T19, T20, T21, T22, T23, T24, T25, T26, T27, D;
+    uint16_t M1, M6, M11, M13, M15, M20, M21, M22, M23, M25, M37, M38, M39, M40;
+    uint16_t M41, M42, M43, M44, M45, M46, M47, M48, M49, M50, M51, M52, M53, M54;
+    uint16_t M55, M56, M57, M58, M59, M60, M61, M62, M63;
+
+    if (inv) {
+        uint16_t R5, R13, R17, R18, R19;
+        /* Undo linear postprocessing */
+        T23 = U0 ^ U3;
+        T22 = ~(U1 ^ U3);
+        T2 = ~(U0 ^ U1);
+        T1 = U3 ^ U4;
+        T24 = ~(U4 ^ U7);
+        R5 = U6 ^ U7;
+        T8 = ~(U1 ^ T23);
+        T19 = T22 ^ R5;
+        T9 = ~(U7 ^ T1);
+        T10 = T2 ^ T24;
+        T13 = T2 ^ R5;
+        T3 = T1 ^ R5;
+        T25 = ~(U2 ^ T1);
+        R13 = U1 ^ U6;
+        T17 = ~(U2 ^ T19);
+        T20 = T24 ^ R13;
+        T4 = U4 ^ T8;
+        R17 = ~(U2 ^ U5);
+        R18 = ~(U5 ^ U6);
+        R19 = ~(U2 ^ U4);
+        D = U0 ^ R17;
+        T6 = T22 ^ R17;
+        T16 = R13 ^ R19;
+        T27 = T1 ^ R18;
+        T15 = T10 ^ T27;
+        T14 = T10 ^ R18;
+        T26 = T3 ^ T16;
+    } else {
+        /* Linear preprocessing. */
+        T1 = U0 ^ U3;
+        T2 = U0 ^ U5;
+        T3 = U0 ^ U6;
+        T4 = U3 ^ U5;
+        T5 = U4 ^ U6;
+        T6 = T1 ^ T5;
+        T7 = U1 ^ U2;
+        T8 = U7 ^ T6;
+        T9 = U7 ^ T7;
+        T10 = T6 ^ T7;
+        T11 = U1 ^ U5;
+        T12 = U2 ^ U5;
+        T13 = T3 ^ T4;
+        T14 = T6 ^ T11;
+        T15 = T5 ^ T11;
+        T16 = T5 ^ T12;
+        T17 = T9 ^ T16;
+        T18 = U3 ^ U7;
+        T19 = T7 ^ T18;
+        T20 = T1 ^ T19;
+        T21 = U6 ^ U7;
+        T22 = T7 ^ T21;
+        T23 = T2 ^ T22;
+        T24 = T2 ^ T10;
+        T25 = T20 ^ T17;
+        T26 = T3 ^ T16;
+        T27 = T1 ^ T12;
+        D = U7;
+    }
+
+    /* Non-linear transformation (shared between the forward and backward case) */
+    M1 = T13 & T6;
+    M6 = T3 & T16;
+    M11 = T1 & T15;
+    M13 = (T4 & T27) ^ M11;
+    M15 = (T2 & T10) ^ M11;
+    M20 = T14 ^ M1 ^ (T23 & T8) ^ M13;
+    M21 = (T19 & D) ^ M1 ^ T24 ^ M15;
+    M22 = T26 ^ M6 ^ (T22 & T9) ^ M13;
+    M23 = (T20 & T17) ^ M6 ^ M15 ^ T25;
+    M25 = M22 & M20;
+    M37 = M21 ^ ((M20 ^ M21) & (M23 ^ M25));
+    M38 = M20 ^ M25 ^ (M21 | (M20 & M23));
+    M39 = M23 ^ ((M22 ^ M23) & (M21 ^ M25));
+    M40 = M22 ^ M25 ^ (M23 | (M21 & M22));
+    M41 = M38 ^ M40;
+    M42 = M37 ^ M39;
+    M43 = M37 ^ M38;
+    M44 = M39 ^ M40;
+    M45 = M42 ^ M41;
+    M46 = M44 & T6;
+    M47 = M40 & T8;
+    M48 = M39 & D;
+    M49 = M43 & T16;
+    M50 = M38 & T9;
+    M51 = M37 & T17;
+    M52 = M42 & T15;
+    M53 = M45 & T27;
+    M54 = M41 & T10;
+    M55 = M44 & T13;
+    M56 = M40 & T23;
+    M57 = M39 & T19;
+    M58 = M43 & T3;
+    M59 = M38 & T22;
+    M60 = M37 & T20;
+    M61 = M42 & T1;
+    M62 = M45 & T4;
+    M63 = M41 & T2;
+
+    if (inv){
+        /* Undo linear preprocessing */
+        uint16_t P0 = M52 ^ M61;
+        uint16_t P1 = M58 ^ M59;
+        uint16_t P2 = M54 ^ M62;
+        uint16_t P3 = M47 ^ M50;
+        uint16_t P4 = M48 ^ M56;
+        uint16_t P5 = M46 ^ M51;
+        uint16_t P6 = M49 ^ M60;
+        uint16_t P7 = P0 ^ P1;
+        uint16_t P8 = M50 ^ M53;
+        uint16_t P9 = M55 ^ M63;
+        uint16_t P10 = M57 ^ P4;
+        uint16_t P11 = P0 ^ P3;
+        uint16_t P12 = M46 ^ M48;
+        uint16_t P13 = M49 ^ M51;
+        uint16_t P14 = M49 ^ M62;
+        uint16_t P15 = M54 ^ M59;
+        uint16_t P16 = M57 ^ M61;
+        uint16_t P17 = M58 ^ P2;
+        uint16_t P18 = M63 ^ P5;
+        uint16_t P19 = P2 ^ P3;
+        uint16_t P20 = P4 ^ P6;
+        uint16_t P22 = P2 ^ P7;
+        uint16_t P23 = P7 ^ P8;
+        uint16_t P24 = P5 ^ P7;
+        uint16_t P25 = P6 ^ P10;
+        uint16_t P26 = P9 ^ P11;
+        uint16_t P27 = P10 ^ P18;
+        uint16_t P28 = P11 ^ P25;
+        uint16_t P29 = P15 ^ P20;
+        s->slice[7] = P13 ^ P22;
+        s->slice[6] = P26 ^ P29;
+        s->slice[5] = P17 ^ P28;
+        s->slice[4] = P12 ^ P22;
+        s->slice[3] = P23 ^ P27;
+        s->slice[2] = P19 ^ P24;
+        s->slice[1] = P14 ^ P23;
+        s->slice[0] = P9 ^ P16;
+    } else {
+        /* Linear postprocessing */
+        uint16_t L0 = M61 ^ M62;
+        uint16_t L1 = M50 ^ M56;
+        uint16_t L2 = M46 ^ M48;
+        uint16_t L3 = M47 ^ M55;
+        uint16_t L4 = M54 ^ M58;
+        uint16_t L5 = M49 ^ M61;
+        uint16_t L6 = M62 ^ L5;
+        uint16_t L7 = M46 ^ L3;
+        uint16_t L8 = M51 ^ M59;
+        uint16_t L9 = M52 ^ M53;
+        uint16_t L10 = M53 ^ L4;
+        uint16_t L11 = M60 ^ L2;
+        uint16_t L12 = M48 ^ M51;
+        uint16_t L13 = M50 ^ L0;
+        uint16_t L14 = M52 ^ M61;
+        uint16_t L15 = M55 ^ L1;
+        uint16_t L16 = M56 ^ L0;
+        uint16_t L17 = M57 ^ L1;
+        uint16_t L18 = M58 ^ L8;
+        uint16_t L19 = M63 ^ L4;
+        uint16_t L20 = L0 ^ L1;
+        uint16_t L21 = L1 ^ L7;
+        uint16_t L22 = L3 ^ L12;
+        uint16_t L23 = L18 ^ L2;
+        uint16_t L24 = L15 ^ L9;
+        uint16_t L25 = L6 ^ L10;
+        uint16_t L26 = L7 ^ L9;
+        uint16_t L27 = L8 ^ L10;
+        uint16_t L28 = L11 ^ L14;
+        uint16_t L29 = L11 ^ L17;
+        s->slice[7] = L6 ^ L24;
+        s->slice[6] = ~(L16 ^ L26);
+        s->slice[5] = ~(L19 ^ L28);
+        s->slice[4] = L6 ^ L21;
+        s->slice[3] = L20 ^ L22;
+        s->slice[2] = L25 ^ L29;
+        s->slice[1] = ~(L13 ^ L27);
+        s->slice[0] = ~(L6 ^ L23);
+    }
+}
+
+#define BIT_RANGE(from,to) (((1 << ((to) - (from))) - 1) << (from))
+
+#define BIT_RANGE_LEFT(x,from,to,shift) (((x) & BIT_RANGE((from), (to))) << (shift))
+#define BIT_RANGE_RIGHT(x,from,to,shift) (((x) & BIT_RANGE((from), (to))) >> (shift))
+
+static void ShiftRows(AES_state* s) {
+    int i;
+    for (i = 0; i < 8; i++) {
+        uint16_t v = s->slice[i];
+        s->slice[i] =
+            (v & BIT_RANGE(0, 4)) |
+            BIT_RANGE_LEFT(v, 4, 5, 3) | BIT_RANGE_RIGHT(v, 5, 8, 1) |
+            BIT_RANGE_LEFT(v, 8, 10, 2) | BIT_RANGE_RIGHT(v, 10, 12, 2) |
+            BIT_RANGE_LEFT(v, 12, 15, 1) | BIT_RANGE_RIGHT(v, 15, 16, 3);
+    }
+}
+
+static void InvShiftRows(AES_state* s) {
+    int i;
+    for (i = 0; i < 8; i++) {
+        uint16_t v = s->slice[i];
+        s->slice[i] =
+            (v & BIT_RANGE(0, 4)) |
+            BIT_RANGE_LEFT(v, 4, 7, 1) | BIT_RANGE_RIGHT(v, 7, 8, 3) |
+            BIT_RANGE_LEFT(v, 8, 10, 2) | BIT_RANGE_RIGHT(v, 10, 12, 2) |
+            BIT_RANGE_LEFT(v, 12, 13, 3) | BIT_RANGE_RIGHT(v, 13, 16, 1);
+    }
+}
+
+#define ROT(x,b) (((x) >> ((b) * 4)) | ((x) << ((4-(b)) * 4)))
+
+static void MixColumns(AES_state* s, int inv) {
+    /* The MixColumns transform treats the bytes of the columns of the state as
+     * coefficients of a 3rd degree polynomial over GF(2^8) and multiplies them
+     * by the fixed polynomial a(x) = {03}x^3 + {01}x^2 + {01}x + {02}, modulo
+     * x^4 + {01}.
+     *
+     * In the inverse transform, we multiply by the inverse of a(x),
+     * a^-1(x) = {0b}x^3 + {0d}x^2 + {09}x + {0e}. This is equal to
+     * a(x) * ({04}x^2 + {05}), so we can reuse the forward transform's code
+     * (found in OpenSSL's bsaes-x86_64.pl, attributed to Jussi Kivilinna)
+     *
+     * In the bitsliced representation, a multiplication of every column by x
+     * mod x^4 + 1 is simply a right rotation.
+     */
+
+    /* Shared for both directions is a multiplication by a(x), which can be
+     * rewritten as (x^3 + x^2 + x) + {02}*(x^3 + {01}).
+     *
+     * First compute s into the s? variables, (x^3 + {01}) * s into the s?_01
+     * variables and (x^3 + x^2 + x)*s into the s?_123 variables.
+     */
+    uint16_t s0 = s->slice[0], s1 = s->slice[1], s2 = s->slice[2], s3 = s->slice[3];
+    uint16_t s4 = s->slice[4], s5 = s->slice[5], s6 = s->slice[6], s7 = s->slice[7];
+    uint16_t s0_01 = s0 ^ ROT(s0, 1), s0_123 = ROT(s0_01, 1) ^ ROT(s0, 3);
+    uint16_t s1_01 = s1 ^ ROT(s1, 1), s1_123 = ROT(s1_01, 1) ^ ROT(s1, 3);
+    uint16_t s2_01 = s2 ^ ROT(s2, 1), s2_123 = ROT(s2_01, 1) ^ ROT(s2, 3);
+    uint16_t s3_01 = s3 ^ ROT(s3, 1), s3_123 = ROT(s3_01, 1) ^ ROT(s3, 3);
+    uint16_t s4_01 = s4 ^ ROT(s4, 1), s4_123 = ROT(s4_01, 1) ^ ROT(s4, 3);
+    uint16_t s5_01 = s5 ^ ROT(s5, 1), s5_123 = ROT(s5_01, 1) ^ ROT(s5, 3);
+    uint16_t s6_01 = s6 ^ ROT(s6, 1), s6_123 = ROT(s6_01, 1) ^ ROT(s6, 3);
+    uint16_t s7_01 = s7 ^ ROT(s7, 1), s7_123 = ROT(s7_01, 1) ^ ROT(s7, 3);
+    /* Now compute s = s?_123 + {02} * s?_01. */
+    s->slice[0] = s7_01 ^ s0_123;
+    s->slice[1] = s7_01 ^ s0_01 ^ s1_123;
+    s->slice[2] = s1_01 ^ s2_123;
+    s->slice[3] = s7_01 ^ s2_01 ^ s3_123;
+    s->slice[4] = s7_01 ^ s3_01 ^ s4_123;
+    s->slice[5] = s4_01 ^ s5_123;
+    s->slice[6] = s5_01 ^ s6_123;
+    s->slice[7] = s6_01 ^ s7_123;
+    if (inv) {
+        /* In the reverse direction, we further need to multiply by
+         * {04}x^2 + {05}, which can be written as {04} * (x^2 + {01}) + {01}.
+         *
+         * First compute (x^2 + {01}) * s into the t?_02 variables: */
+        uint16_t t0_02 = s->slice[0] ^ ROT(s->slice[0], 2);
+        uint16_t t1_02 = s->slice[1] ^ ROT(s->slice[1], 2);
+        uint16_t t2_02 = s->slice[2] ^ ROT(s->slice[2], 2);
+        uint16_t t3_02 = s->slice[3] ^ ROT(s->slice[3], 2);
+        uint16_t t4_02 = s->slice[4] ^ ROT(s->slice[4], 2);
+        uint16_t t5_02 = s->slice[5] ^ ROT(s->slice[5], 2);
+        uint16_t t6_02 = s->slice[6] ^ ROT(s->slice[6], 2);
+        uint16_t t7_02 = s->slice[7] ^ ROT(s->slice[7], 2);
+        /* And then update s += {04} * t?_02 */
+        s->slice[0] ^= t6_02;
+        s->slice[1] ^= t6_02 ^ t7_02;
+        s->slice[2] ^= t0_02 ^ t7_02;
+        s->slice[3] ^= t1_02 ^ t6_02;
+        s->slice[4] ^= t2_02 ^ t6_02 ^ t7_02;
+        s->slice[5] ^= t3_02 ^ t7_02;
+        s->slice[6] ^= t4_02;
+        s->slice[7] ^= t5_02;
+    }
+}
+
+static void AddRoundKey(AES_state* s, const AES_state* round) {
+    int b;
+    for (b = 0; b < 8; b++) {
+        s->slice[b] ^= round->slice[b];
+    }
+}
+
+/** column_0(s) = column_c(a) */
+static void GetOneColumn(AES_state* s, const AES_state* a, int c) {
+    int b;
+    for (b = 0; b < 8; b++) {
+        s->slice[b] = (a->slice[b] >> c) & 0x1111;
+    }
+}
+
+/** column_c1(r) |= (column_0(s) ^= column_c2(a)) */
+static void KeySetupColumnMix(AES_state* s, AES_state* r, const AES_state* a, int c1, int c2) {
+    int b;
+    for (b = 0; b < 8; b++) {
+        r->slice[b] |= ((s->slice[b] ^= ((a->slice[b] >> c2) & 0x1111)) & 0x1111) << c1;
+    }
+}
+
+/** Rotate the rows in s one position upwards, and xor in r */
+static void KeySetupTransform(AES_state* s, const AES_state* r) {
+    int b;
+    for (b = 0; b < 8; b++) {
+        s->slice[b] = ((s->slice[b] >> 4) | (s->slice[b] << 12)) ^ r->slice[b];
+    }
+}
+
+/* Multiply the cells in s by x, as polynomials over GF(2) mod x^8 + x^4 + x^3 + x + 1 */
+static void MultX(AES_state* s) {
+    uint16_t top = s->slice[7];
+    s->slice[7] = s->slice[6];
+    s->slice[6] = s->slice[5];
+    s->slice[5] = s->slice[4];
+    s->slice[4] = s->slice[3] ^ top;
+    s->slice[3] = s->slice[2] ^ top;
+    s->slice[2] = s->slice[1];
+    s->slice[1] = s->slice[0] ^ top;
+    s->slice[0] = top;
+}
+
+/** Expand the cipher key into the key schedule.
+ *
+ *  state must be a pointer to an array of size nrounds + 1.
+ *  key must be a pointer to 4 * nkeywords bytes.
+ *
+ *  AES128 uses nkeywords = 4, nrounds = 10
+ *  AES192 uses nkeywords = 6, nrounds = 12
+ *  AES256 uses nkeywords = 8, nrounds = 14
+ */
+static void AES_setup(AES_state* rounds, const uint8_t* key, int nkeywords, int nrounds)
+{
+    int i;
+
+    /* The one-byte round constant */
+    AES_state rcon = {{1,0,0,0,0,0,0,0}};
+    /* The number of the word being generated, modulo nkeywords */
+    int pos = 0;
+    /* The column representing the word currently being processed */
+    AES_state column;
+
+    for (i = 0; i < nrounds + 1; i++) {
+        int b;
+        for (b = 0; b < 8; b++) {
+            rounds[i].slice[b] = 0;
+        }
+    }
+
+    /* The first nkeywords round columns are just taken from the key directly. */
+    for (i = 0; i < nkeywords; i++) {
+        int r;
+        for (r = 0; r < 4; r++) {
+            LoadByte(&rounds[i >> 2], *(key++), r, i & 3);
+        }
+    }
+
+    GetOneColumn(&column, &rounds[(nkeywords - 1) >> 2], (nkeywords - 1) & 3);
+
+    for (i = nkeywords; i < 4 * (nrounds + 1); i++) {
+        /* Transform column */
+        if (pos == 0) {
+            SubBytes(&column, 0);
+            KeySetupTransform(&column, &rcon);
+            MultX(&rcon);
+        } else if (nkeywords > 6 && pos == 4) {
+            SubBytes(&column, 0);
+        }
+        if (++pos == nkeywords) pos = 0;
+        KeySetupColumnMix(&column, &rounds[i >> 2], &rounds[(i - nkeywords) >> 2], i & 3, (i - nkeywords) & 3);
+    }
+}
+
+static void AES_encrypt(const AES_state* rounds, int nrounds, unsigned char* cipher16, const unsigned char* plain16) {
+    AES_state s = {{0}};
+    int round;
+
+    LoadBytes(&s, plain16);
+    AddRoundKey(&s, rounds++);
+
+    for (round = 1; round < nrounds; round++) {
+        SubBytes(&s, 0);
+        ShiftRows(&s);
+        MixColumns(&s, 0);
+        AddRoundKey(&s, rounds++);
+    }
+
+    SubBytes(&s, 0);
+    ShiftRows(&s);
+    AddRoundKey(&s, rounds);
+
+    SaveBytes(cipher16, &s);
+}
+
+static void AES_decrypt(const AES_state* rounds, int nrounds, unsigned char* plain16, const unsigned char* cipher16) {
+    /* Most AES decryption implementations use the alternate scheme
+     * (the Equivalent Inverse Cipher), which allows for more code reuse between
+     * the encryption and decryption code, but requires separate setup for both.
+     */
+    AES_state s = {{0}};
+    int round;
+
+    rounds += nrounds;
+
+    LoadBytes(&s, cipher16);
+    AddRoundKey(&s, rounds--);
+
+    for (round = 1; round < nrounds; round++) {
+        InvShiftRows(&s);
+        SubBytes(&s, 1);
+        AddRoundKey(&s, rounds--);
+        MixColumns(&s, 1);
+    }
+
+    InvShiftRows(&s);
+    SubBytes(&s, 1);
+    AddRoundKey(&s, rounds);
+
+    SaveBytes(plain16, &s);
+}
+
+void AES128_init(AES128_ctx* ctx, const unsigned char* key16) {
+    AES_setup(ctx->rk, key16, 4, 10);
+}
+
+void AES128_encrypt(const AES128_ctx* ctx, size_t blocks, unsigned char* cipher16, const unsigned char* plain16) {
+    while (blocks--) {
+        AES_encrypt(ctx->rk, 10, cipher16, plain16);
+        cipher16 += 16;
+        plain16 += 16;
+    }
+}
+
+void AES128_decrypt(const AES128_ctx* ctx, size_t blocks, unsigned char* plain16, const unsigned char* cipher16) {
+    while (blocks--) {
+        AES_decrypt(ctx->rk, 10, plain16, cipher16);
+        cipher16 += 16;
+        plain16 += 16;
+    }
+}
+
+void AES192_init(AES192_ctx* ctx, const unsigned char* key24) {
+    AES_setup(ctx->rk, key24, 6, 12);
+}
+
+void AES192_encrypt(const AES192_ctx* ctx, size_t blocks, unsigned char* cipher16, const unsigned char* plain16) {
+    while (blocks--) {
+        AES_encrypt(ctx->rk, 12, cipher16, plain16);
+        cipher16 += 16;
+        plain16 += 16;
+    }
+
+}
+
+void AES192_decrypt(const AES192_ctx* ctx, size_t blocks, unsigned char* plain16, const unsigned char* cipher16) {
+    while (blocks--) {
+        AES_decrypt(ctx->rk, 12, plain16, cipher16);
+        cipher16 += 16;
+        plain16 += 16;
+    }
+}
+
+void AES256_init(AES256_ctx* ctx, const unsigned char* key32) {
+    AES_setup(ctx->rk, key32, 8, 14);
+}
+
+void AES256_encrypt(const AES256_ctx* ctx, size_t blocks, unsigned char* cipher16, const unsigned char* plain16) {
+    while (blocks--) {
+        AES_encrypt(ctx->rk, 14, cipher16, plain16);
+        cipher16 += 16;
+        plain16 += 16;
+    }
+}
+
+void AES256_decrypt(const AES256_ctx* ctx, size_t blocks, unsigned char* plain16, const unsigned char* cipher16) {
+    while (blocks--) {
+        AES_decrypt(ctx->rk, 14, plain16, cipher16);
+        cipher16 += 16;
+        plain16 += 16;
+    }
+}
diff --git a/depend/zcash/src/crypto/ctaes/ctaes.h b/depend/zcash/src/crypto/ctaes/ctaes.h
new file mode 100644
index 000000000..2f0af0421
--- /dev/null
+++ b/depend/zcash/src/crypto/ctaes/ctaes.h
@@ -0,0 +1,41 @@
+ /*********************************************************************
+ * Copyright (c) 2016 Pieter Wuille                                   *
+ * Distributed under the MIT software license, see the accompanying   *
+ * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
+ **********************************************************************/
+
+#ifndef _CTAES_H_
+#define _CTAES_H_ 1
+
+#include <stdint.h>
+#include <stdlib.h>
+
+typedef struct {
+    uint16_t slice[8];
+} AES_state;
+
+typedef struct {
+    AES_state rk[11];
+} AES128_ctx;
+
+typedef struct {
+    AES_state rk[13];
+} AES192_ctx;
+
+typedef struct {
+    AES_state rk[15];
+} AES256_ctx;
+
+void AES128_init(AES128_ctx* ctx, const unsigned char* key16);
+void AES128_encrypt(const AES128_ctx* ctx, size_t blocks, unsigned char* cipher16, const unsigned char* plain16);
+void AES128_decrypt(const AES128_ctx* ctx, size_t blocks, unsigned char* plain16, const unsigned char* cipher16);
+
+void AES192_init(AES192_ctx* ctx, const unsigned char* key24);
+void AES192_encrypt(const AES192_ctx* ctx, size_t blocks, unsigned char* cipher16, const unsigned char* plain16);
+void AES192_decrypt(const AES192_ctx* ctx, size_t blocks, unsigned char* plain16, const unsigned char* cipher16);
+
+void AES256_init(AES256_ctx* ctx, const unsigned char* key32);
+void AES256_encrypt(const AES256_ctx* ctx, size_t blocks, unsigned char* cipher16, const unsigned char* plain16);
+void AES256_decrypt(const AES256_ctx* ctx, size_t blocks, unsigned char* plain16, const unsigned char* cipher16);
+
+#endif
diff --git a/depend/zcash/src/crypto/ctaes/test.c b/depend/zcash/src/crypto/ctaes/test.c
new file mode 100644
index 000000000..21439a16f
--- /dev/null
+++ b/depend/zcash/src/crypto/ctaes/test.c
@@ -0,0 +1,110 @@
+ /*********************************************************************
+ * Copyright (c) 2016 Pieter Wuille                                   *
+ * Distributed under the MIT software license, see the accompanying   *
+ * file COPYING or http://www.opensource.org/licenses/mit-license.php.*
+ **********************************************************************/
+
+#include "ctaes.h"
+
+#include <stdio.h>
+#include <string.h>
+#include <assert.h>
+
+typedef struct {
+    int keysize;
+    const char* key;
+    const char* plain;
+    const char* cipher;
+} ctaes_test;
+
+static const ctaes_test ctaes_tests[] = {
+    /* AES test vectors from FIPS 197. */
+    {128, "000102030405060708090a0b0c0d0e0f", "00112233445566778899aabbccddeeff", "69c4e0d86a7b0430d8cdb78070b4c55a"},
+    {192, "000102030405060708090a0b0c0d0e0f1011121314151617", "00112233445566778899aabbccddeeff", "dda97ca4864cdfe06eaf70a0ec0d7191"},
+    {256, "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", "00112233445566778899aabbccddeeff", "8ea2b7ca516745bfeafc49904b496089"},
+
+    /* AES-ECB test vectors from NIST sp800-38a. */
+    {128, "2b7e151628aed2a6abf7158809cf4f3c", "6bc1bee22e409f96e93d7e117393172a", "3ad77bb40d7a3660a89ecaf32466ef97"},
+    {128, "2b7e151628aed2a6abf7158809cf4f3c", "ae2d8a571e03ac9c9eb76fac45af8e51", "f5d3d58503b9699de785895a96fdbaaf"},
+    {128, "2b7e151628aed2a6abf7158809cf4f3c", "30c81c46a35ce411e5fbc1191a0a52ef", "43b1cd7f598ece23881b00e3ed030688"},
+    {128, "2b7e151628aed2a6abf7158809cf4f3c", "f69f2445df4f9b17ad2b417be66c3710", "7b0c785e27e8ad3f8223207104725dd4"},
+    {192, "8e73b0f7da0e6452c810f32b809079e562f8ead2522c6b7b", "6bc1bee22e409f96e93d7e117393172a", "bd334f1d6e45f25ff712a214571fa5cc"},
+    {192, "8e73b0f7da0e6452c810f32b809079e562f8ead2522c6b7b", "ae2d8a571e03ac9c9eb76fac45af8e51", "974104846d0ad3ad7734ecb3ecee4eef"},
+    {192, "8e73b0f7da0e6452c810f32b809079e562f8ead2522c6b7b", "30c81c46a35ce411e5fbc1191a0a52ef", "ef7afd2270e2e60adce0ba2face6444e"},
+    {192, "8e73b0f7da0e6452c810f32b809079e562f8ead2522c6b7b", "f69f2445df4f9b17ad2b417be66c3710", "9a4b41ba738d6c72fb16691603c18e0e"},
+    {256, "603deb1015ca71be2b73aef0857d77811f352c073b6108d72d9810a30914dff4", "6bc1bee22e409f96e93d7e117393172a", "f3eed1bdb5d2a03c064b5a7e3db181f8"},
+    {256, "603deb1015ca71be2b73aef0857d77811f352c073b6108d72d9810a30914dff4", "ae2d8a571e03ac9c9eb76fac45af8e51", "591ccb10d410ed26dc5ba74a31362870"},
+    {256, "603deb1015ca71be2b73aef0857d77811f352c073b6108d72d9810a30914dff4", "30c81c46a35ce411e5fbc1191a0a52ef", "b6ed21b99ca6f4f9f153e7b1beafed1d"},
+    {256, "603deb1015ca71be2b73aef0857d77811f352c073b6108d72d9810a30914dff4", "f69f2445df4f9b17ad2b417be66c3710", "23304b7a39f9f3ff067d8d8f9e24ecc7"}
+};
+
+static void from_hex(unsigned char* data, int len, const char* hex) {
+    int p;
+    for (p = 0; p < len; p++) {
+        int v = 0;
+        int n;
+        for (n = 0; n < 2; n++) {
+            assert((*hex >= '0' && *hex <= '9') || (*hex >= 'a' && *hex <= 'f'));
+            if (*hex >= '0' && *hex <= '9') {
+                v |= (*hex - '0') << (4 * (1 - n));
+            } else {
+                v |= (*hex - 'a' + 10) << (4 * (1 - n));
+            }
+            hex++;
+        }
+        *(data++) = v;
+    }
+    assert(*hex == 0);
+}
+
+int main(void) {
+    int i;
+    int fail = 0;
+    for (i = 0; i < sizeof(ctaes_tests) / sizeof(ctaes_tests[0]); i++) {
+        unsigned char key[32], plain[16], cipher[16], ciphered[16], deciphered[16];
+        const ctaes_test* test = &ctaes_tests[i];
+        assert(test->keysize == 128 || test->keysize == 192 || test->keysize == 256);
+        from_hex(plain, 16, test->plain);
+        from_hex(cipher, 16, test->cipher);
+        switch (test->keysize) {
+            case 128: {
+                AES128_ctx ctx;
+                from_hex(key, 16, test->key);
+                AES128_init(&ctx, key);
+                AES128_encrypt(&ctx, 1, ciphered, plain);
+                AES128_decrypt(&ctx, 1, deciphered, cipher);
+                break;
+            }
+            case 192: {
+                AES192_ctx ctx;
+                from_hex(key, 24, test->key);
+                AES192_init(&ctx, key);
+                AES192_encrypt(&ctx, 1, ciphered, plain);
+                AES192_decrypt(&ctx, 1, deciphered, cipher);
+                break;
+            }
+            case 256: {
+                AES256_ctx ctx;
+                from_hex(key, 32, test->key);
+                AES256_init(&ctx, key);
+                AES256_encrypt(&ctx, 1, ciphered, plain);
+                AES256_decrypt(&ctx, 1, deciphered, cipher);
+                break;
+            }
+        }
+        if (memcmp(cipher, ciphered, 16)) {
+            fprintf(stderr, "E(key=\"%s\", plain=\"%s\") != \"%s\"\n", test->key, test->plain, test->cipher);
+            fail++;
+        }
+        if (memcmp(plain, deciphered, 16)) {
+            fprintf(stderr, "D(key=\"%s\", cipher=\"%s\") != \"%s\"\n", test->key, test->cipher, test->plain);
+            fail++;
+        }
+    }
+    if (fail == 0) {
+        fprintf(stderr, "All tests successful\n");
+    } else {
+        fprintf(stderr, "%i tests failed\n", fail);
+    }
+    return (fail != 0);
+}
diff --git a/depend/zcash/src/crypto/equihash.cpp b/depend/zcash/src/crypto/equihash.cpp
new file mode 100644
index 000000000..ad64a37fc
--- /dev/null
+++ b/depend/zcash/src/crypto/equihash.cpp
@@ -0,0 +1,768 @@
+// Copyright (c) 2016 Jack Grigg
+// Copyright (c) 2016 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+// Implementation of the Equihash Proof-of-Work algorithm.
+//
+// Reference
+// =========
+// Alex Biryukov and Dmitry Khovratovich
+// Equihash: Asymmetric Proof-of-Work Based on the Generalized Birthday Problem
+// NDSS ’16, 21-24 February 2016, San Diego, CA, USA
+// https://www.internetsociety.org/sites/default/files/blogs-media/equihash-asymmetric-proof-of-work-based-generalized-birthday-problem.pdf
+
+#if defined(HAVE_CONFIG_H)
+#include "config/bitcoin-config.h"
+#endif
+
+#include "compat/endian.h"
+#include "crypto/equihash.h"
+#include "util.h"
+
+#include <optional>
+
+#ifdef ENABLE_MINING
+void eh_HashState::Update(const unsigned char *input, size_t inputLen)
+{
+    blake2b_update(inner.get(), input, inputLen);
+}
+
+void eh_HashState::Finalize(unsigned char *hash, size_t hLen)
+{
+    blake2b_finalize(inner.get(), hash, hLen);
+}
+#endif
+
+// Used in TestEquihashValidator.
+
+void CompressArray(const unsigned char* in, size_t in_len,
+                   unsigned char* out, size_t out_len,
+                   size_t bit_len, size_t byte_pad)
+{
+    assert(bit_len >= 8);
+    assert(8*sizeof(uint32_t) >= 7+bit_len);
+
+    size_t in_width { (bit_len+7)/8 + byte_pad };
+    assert(out_len == bit_len*in_len/(8*in_width));
+
+    uint32_t bit_len_mask { ((uint32_t)1 << bit_len) - 1 };
+
+    // The acc_bits least-significant bits of acc_value represent a bit sequence
+    // in big-endian order.
+    size_t acc_bits = 0;
+    uint32_t acc_value = 0;
+
+    size_t j = 0;
+    for (size_t i = 0; i < out_len; i++) {
+        // When we have fewer than 8 bits left in the accumulator, read the next
+        // input element.
+        if (acc_bits < 8) {
+            acc_value = acc_value << bit_len;
+            for (size_t x = byte_pad; x < in_width; x++) {
+                acc_value = acc_value | (
+                    (
+                        // Apply bit_len_mask across byte boundaries
+                        in[j+x] & ((bit_len_mask >> (8*(in_width-x-1))) & 0xFF)
+                    ) << (8*(in_width-x-1))); // Big-endian
+            }
+            j += in_width;
+            acc_bits += bit_len;
+        }
+
+        acc_bits -= 8;
+        out[i] = (acc_value >> acc_bits) & 0xFF;
+    }
+}
+
+void ExpandArray(const unsigned char* in, size_t in_len,
+                 unsigned char* out, size_t out_len,
+                 size_t bit_len, size_t byte_pad)
+{
+    assert(bit_len >= 8);
+    assert(8*sizeof(uint32_t) >= 7+bit_len);
+
+    size_t out_width { (bit_len+7)/8 + byte_pad };
+    assert(out_len == 8*out_width*in_len/bit_len);
+
+    uint32_t bit_len_mask { ((uint32_t)1 << bit_len) - 1 };
+
+    // The acc_bits least-significant bits of acc_value represent a bit sequence
+    // in big-endian order.
+    size_t acc_bits = 0;
+    uint32_t acc_value = 0;
+
+    size_t j = 0;
+    for (size_t i = 0; i < in_len; i++) {
+        acc_value = (acc_value << 8) | in[i];
+        acc_bits += 8;
+
+        // When we have bit_len or more bits in the accumulator, write the next
+        // output element.
+        if (acc_bits >= bit_len) {
+            acc_bits -= bit_len;
+            for (size_t x = 0; x < byte_pad; x++) {
+                out[j+x] = 0;
+            }
+            for (size_t x = byte_pad; x < out_width; x++) {
+                out[j+x] = (
+                    // Big-endian
+                    acc_value >> (acc_bits+(8*(out_width-x-1)))
+                ) & (
+                    // Apply bit_len_mask across byte boundaries
+                    (bit_len_mask >> (8*(out_width-x-1))) & 0xFF
+                );
+            }
+            j += out_width;
+        }
+    }
+}
+
+// Big-endian so that lexicographic array comparison is equivalent to integer
+// comparison
+void EhIndexToArray(const eh_index i, unsigned char* array)
+{
+    static_assert(sizeof(eh_index) == 4);
+    eh_index bei = htobe32(i);
+    memcpy(array, &bei, sizeof(eh_index));
+}
+
+std::vector<unsigned char> GetMinimalFromIndices(std::vector<eh_index> indices,
+                                                 size_t cBitLen)
+{
+    assert(((cBitLen+1)+7)/8 <= sizeof(eh_index));
+    size_t lenIndices { indices.size()*sizeof(eh_index) };
+    size_t minLen { (cBitLen+1)*lenIndices/(8*sizeof(eh_index)) };
+    size_t bytePad { sizeof(eh_index) - ((cBitLen+1)+7)/8 };
+    std::vector<unsigned char> array(lenIndices);
+    for (int i = 0; i < indices.size(); i++) {
+        EhIndexToArray(indices[i], array.data()+(i*sizeof(eh_index)));
+    }
+    std::vector<unsigned char> ret(minLen);
+    CompressArray(array.data(), lenIndices,
+                  ret.data(), minLen, cBitLen+1, bytePad);
+    return ret;
+}
+
+#ifdef ENABLE_MINING
+
+
+#include <algorithm>
+#include <iostream>
+#include <stdexcept>
+
+
+static EhSolverCancelledException solver_cancelled;
+
+template<unsigned int N, unsigned int K>
+void Equihash<N,K>::InitialiseState(eh_HashState& base_state)
+{
+    uint32_t le_N = htole32(N);
+    uint32_t le_K = htole32(K);
+    unsigned char personalization[BLAKE2bPersonalBytes] = {};
+    memcpy(personalization, "ZcashPoW", 8);
+    memcpy(personalization+8,  &le_N, 4);
+    memcpy(personalization+12, &le_K, 4);
+    base_state = eh_HashState((512/N)*N/8, personalization);
+}
+
+void GenerateHash(const eh_HashState& base_state, eh_index g,
+                  unsigned char* hash, size_t hLen)
+{
+    eh_HashState state(base_state);
+    eh_index lei = htole32(g);
+    state.Update((const unsigned char*) &lei, sizeof(eh_index));
+    state.Finalize(hash, hLen);
+}
+
+// Big-endian so that lexicographic array comparison is equivalent to integer
+// comparison
+eh_index ArrayToEhIndex(const unsigned char* array)
+{
+    static_assert(sizeof(eh_index) == 4);
+    eh_index bei;
+    memcpy(&bei, array, sizeof(eh_index));
+    return be32toh(bei);
+}
+
+eh_trunc TruncateIndex(const eh_index i, const unsigned int ilen)
+{
+    // Truncate to 8 bits
+    static_assert(sizeof(eh_trunc) == 1);
+    return (i >> (ilen - 8)) & 0xff;
+}
+
+eh_index UntruncateIndex(const eh_trunc t, const eh_index r, const unsigned int ilen)
+{
+    eh_index i{t};
+    return (i << (ilen - 8)) | r;
+}
+
+std::vector<eh_index> GetIndicesFromMinimal(std::vector<unsigned char> minimal,
+                                            size_t cBitLen)
+{
+    assert(((cBitLen+1)+7)/8 <= sizeof(eh_index));
+    size_t lenIndices { 8*sizeof(eh_index)*minimal.size()/(cBitLen+1) };
+    size_t bytePad { sizeof(eh_index) - ((cBitLen+1)+7)/8 };
+    std::vector<unsigned char> array(lenIndices);
+    ExpandArray(minimal.data(), minimal.size(),
+                array.data(), lenIndices, cBitLen+1, bytePad);
+    std::vector<eh_index> ret;
+    for (int i = 0; i < lenIndices; i += sizeof(eh_index)) {
+        ret.push_back(ArrayToEhIndex(array.data()+i));
+    }
+    return ret;
+}
+
+template<size_t WIDTH>
+StepRow<WIDTH>::StepRow(const unsigned char* hashIn, size_t hInLen,
+                        size_t hLen, size_t cBitLen)
+{
+    assert(hLen <= WIDTH);
+    ExpandArray(hashIn, hInLen, hash, hLen, cBitLen);
+}
+
+template<size_t WIDTH> template<size_t W>
+StepRow<WIDTH>::StepRow(const StepRow<W>& a)
+{
+    static_assert(W <= WIDTH);
+    std::copy(a.hash, a.hash+W, hash);
+}
+
+template<size_t WIDTH>
+FullStepRow<WIDTH>::FullStepRow(const unsigned char* hashIn, size_t hInLen,
+                                size_t hLen, size_t cBitLen, eh_index i) :
+        StepRow<WIDTH> {hashIn, hInLen, hLen, cBitLen}
+{
+    EhIndexToArray(i, hash+hLen);
+}
+
+template<size_t WIDTH> template<size_t W>
+FullStepRow<WIDTH>::FullStepRow(const FullStepRow<W>& a, const FullStepRow<W>& b, size_t len, size_t lenIndices, int lenTrim) :
+        StepRow<WIDTH> {a}
+{
+    assert(len+lenIndices <= W);
+    assert(len-lenTrim+(2*lenIndices) <= WIDTH);
+    for (int i = lenTrim; i < len; i++)
+        hash[i-lenTrim] = a.hash[i] ^ b.hash[i];
+    if (a.IndicesBefore(b, len, lenIndices)) {
+        std::copy(a.hash+len, a.hash+len+lenIndices, hash+len-lenTrim);
+        std::copy(b.hash+len, b.hash+len+lenIndices, hash+len-lenTrim+lenIndices);
+    } else {
+        std::copy(b.hash+len, b.hash+len+lenIndices, hash+len-lenTrim);
+        std::copy(a.hash+len, a.hash+len+lenIndices, hash+len-lenTrim+lenIndices);
+    }
+}
+
+template<size_t WIDTH>
+FullStepRow<WIDTH>& FullStepRow<WIDTH>::operator=(const FullStepRow<WIDTH>& a)
+{
+    std::copy(a.hash, a.hash+WIDTH, hash);
+    return *this;
+}
+
+template<size_t WIDTH>
+bool StepRow<WIDTH>::IsZero(size_t len)
+{
+    // This doesn't need to be constant time.
+    for (int i = 0; i < len; i++) {
+        if (hash[i] != 0)
+            return false;
+    }
+    return true;
+}
+
+template<size_t WIDTH>
+std::vector<unsigned char> FullStepRow<WIDTH>::GetIndices(size_t len, size_t lenIndices,
+                                                          size_t cBitLen) const
+{
+    assert(((cBitLen+1)+7)/8 <= sizeof(eh_index));
+    size_t minLen { (cBitLen+1)*lenIndices/(8*sizeof(eh_index)) };
+    size_t bytePad { sizeof(eh_index) - ((cBitLen+1)+7)/8 };
+    std::vector<unsigned char> ret(minLen);
+    CompressArray(hash+len, lenIndices, ret.data(), minLen, cBitLen+1, bytePad);
+    return ret;
+}
+
+template<size_t WIDTH>
+bool HasCollision(StepRow<WIDTH>& a, StepRow<WIDTH>& b, int l)
+{
+    // This doesn't need to be constant time.
+    for (int j = 0; j < l; j++) {
+        if (a.hash[j] != b.hash[j])
+            return false;
+    }
+    return true;
+}
+
+template<size_t WIDTH>
+TruncatedStepRow<WIDTH>::TruncatedStepRow(const unsigned char* hashIn, size_t hInLen,
+                                          size_t hLen, size_t cBitLen,
+                                          eh_index i, unsigned int ilen) :
+        StepRow<WIDTH> {hashIn, hInLen, hLen, cBitLen}
+{
+    hash[hLen] = TruncateIndex(i, ilen);
+}
+
+template<size_t WIDTH> template<size_t W>
+TruncatedStepRow<WIDTH>::TruncatedStepRow(const TruncatedStepRow<W>& a, const TruncatedStepRow<W>& b, size_t len, size_t lenIndices, int lenTrim) :
+        StepRow<WIDTH> {a}
+{
+    assert(len+lenIndices <= W);
+    assert(len-lenTrim+(2*lenIndices) <= WIDTH);
+    for (int i = lenTrim; i < len; i++)
+        hash[i-lenTrim] = a.hash[i] ^ b.hash[i];
+    if (a.IndicesBefore(b, len, lenIndices)) {
+        std::copy(a.hash+len, a.hash+len+lenIndices, hash+len-lenTrim);
+        std::copy(b.hash+len, b.hash+len+lenIndices, hash+len-lenTrim+lenIndices);
+    } else {
+        std::copy(b.hash+len, b.hash+len+lenIndices, hash+len-lenTrim);
+        std::copy(a.hash+len, a.hash+len+lenIndices, hash+len-lenTrim+lenIndices);
+    }
+}
+
+template<size_t WIDTH>
+TruncatedStepRow<WIDTH>& TruncatedStepRow<WIDTH>::operator=(const TruncatedStepRow<WIDTH>& a)
+{
+    std::copy(a.hash, a.hash+WIDTH, hash);
+    return *this;
+}
+
+template<size_t WIDTH>
+std::shared_ptr<eh_trunc> TruncatedStepRow<WIDTH>::GetTruncatedIndices(size_t len, size_t lenIndices) const
+{
+    std::shared_ptr<eh_trunc> p (new eh_trunc[lenIndices], std::default_delete<eh_trunc[]>());
+    std::copy(hash+len, hash+len+lenIndices, p.get());
+    return p;
+}
+
+template<unsigned int N, unsigned int K>
+bool Equihash<N,K>::BasicSolve(const eh_HashState& base_state,
+                               const std::function<bool(std::vector<unsigned char>)> validBlock,
+                               const std::function<bool(EhSolverCancelCheck)> cancelled)
+{
+    eh_index init_size { 1 << (CollisionBitLength + 1) };
+
+    // 1) Generate first list
+    LogPrint("pow", "Generating first list\n");
+    size_t hashLen = HashLength;
+    size_t lenIndices = sizeof(eh_index);
+    std::vector<FullStepRow<FullWidth>> X;
+    X.reserve(init_size);
+    unsigned char tmpHash[HashOutput];
+    for (eh_index g = 0; X.size() < init_size; g++) {
+        GenerateHash(base_state, g, tmpHash, HashOutput);
+        for (eh_index i = 0; i < IndicesPerHashOutput && X.size() < init_size; i++) {
+            X.emplace_back(tmpHash+(i*N/8), N/8, HashLength,
+                           CollisionBitLength, (g*IndicesPerHashOutput)+i);
+        }
+        if (cancelled(ListGeneration)) throw solver_cancelled;
+    }
+
+    // 3) Repeat step 2 until 2n/(k+1) bits remain
+    for (int r = 1; r < K && X.size() > 0; r++) {
+        LogPrint("pow", "Round %d:\n", r);
+        // 2a) Sort the list
+        LogPrint("pow", "- Sorting list\n");
+        std::sort(X.begin(), X.end(), CompareSR(CollisionByteLength));
+        if (cancelled(ListSorting)) throw solver_cancelled;
+
+        LogPrint("pow", "- Finding collisions\n");
+        int i = 0;
+        int posFree = 0;
+        std::vector<FullStepRow<FullWidth>> Xc;
+        while (i < X.size() - 1) {
+            // 2b) Find next set of unordered pairs with collisions on the next n/(k+1) bits
+            int j = 1;
+            while (i+j < X.size() &&
+                    HasCollision(X[i], X[i+j], CollisionByteLength)) {
+                j++;
+            }
+
+            // 2c) Calculate tuples (X_i ^ X_j, (i, j))
+            for (int l = 0; l < j - 1; l++) {
+                for (int m = l + 1; m < j; m++) {
+                    if (DistinctIndices(X[i+l], X[i+m], hashLen, lenIndices)) {
+                        Xc.emplace_back(X[i+l], X[i+m], hashLen, lenIndices, CollisionByteLength);
+                    }
+                }
+            }
+
+            // 2d) Store tuples on the table in-place if possible
+            while (posFree < i+j && Xc.size() > 0) {
+                X[posFree++] = Xc.back();
+                Xc.pop_back();
+            }
+
+            i += j;
+            if (cancelled(ListColliding)) throw solver_cancelled;
+        }
+
+        // 2e) Handle edge case where final table entry has no collision
+        while (posFree < X.size() && Xc.size() > 0) {
+            X[posFree++] = Xc.back();
+            Xc.pop_back();
+        }
+
+        if (Xc.size() > 0) {
+            // 2f) Add overflow to end of table
+            X.insert(X.end(), Xc.begin(), Xc.end());
+        } else if (posFree < X.size()) {
+            // 2g) Remove empty space at the end
+            X.erase(X.begin()+posFree, X.end());
+            X.shrink_to_fit();
+        }
+
+        hashLen -= CollisionByteLength;
+        lenIndices *= 2;
+        if (cancelled(RoundEnd)) throw solver_cancelled;
+    }
+
+    // k+1) Find a collision on last 2n(k+1) bits
+    LogPrint("pow", "Final round:\n");
+    if (X.size() > 1) {
+        LogPrint("pow", "- Sorting list\n");
+        std::sort(X.begin(), X.end(), CompareSR(hashLen));
+        if (cancelled(FinalSorting)) throw solver_cancelled;
+        LogPrint("pow", "- Finding collisions\n");
+        int i = 0;
+        while (i < X.size() - 1) {
+            int j = 1;
+            while (i+j < X.size() &&
+                    HasCollision(X[i], X[i+j], hashLen)) {
+                j++;
+            }
+
+            for (int l = 0; l < j - 1; l++) {
+                for (int m = l + 1; m < j; m++) {
+                    FullStepRow<FinalFullWidth> res(X[i+l], X[i+m], hashLen, lenIndices, 0);
+                    if (DistinctIndices(X[i+l], X[i+m], hashLen, lenIndices)) {
+                        auto soln = res.GetIndices(hashLen, 2*lenIndices, CollisionBitLength);
+                        assert(soln.size() == equihash_solution_size(N, K));
+                        if (validBlock(soln)) {
+                            return true;
+                        }
+                    }
+                }
+            }
+
+            i += j;
+            if (cancelled(FinalColliding)) throw solver_cancelled;
+        }
+    } else
+        LogPrint("pow", "- List is empty\n");
+
+    return false;
+}
+
+template<size_t WIDTH>
+void CollideBranches(std::vector<FullStepRow<WIDTH>>& X, const size_t hlen, const size_t lenIndices, const unsigned int clen, const unsigned int ilen, const eh_trunc lt, const eh_trunc rt)
+{
+    int i = 0;
+    int posFree = 0;
+    std::vector<FullStepRow<WIDTH>> Xc;
+    while (i < X.size() - 1) {
+        // 2b) Find next set of unordered pairs with collisions on the next n/(k+1) bits
+        int j = 1;
+        while (i+j < X.size() &&
+                HasCollision(X[i], X[i+j], clen)) {
+            j++;
+        }
+
+        // 2c) Calculate tuples (X_i ^ X_j, (i, j))
+        for (int l = 0; l < j - 1; l++) {
+            for (int m = l + 1; m < j; m++) {
+                if (DistinctIndices(X[i+l], X[i+m], hlen, lenIndices)) {
+                    if (IsValidBranch(X[i+l], hlen, ilen, lt) && IsValidBranch(X[i+m], hlen, ilen, rt)) {
+                        Xc.emplace_back(X[i+l], X[i+m], hlen, lenIndices, clen);
+                    } else if (IsValidBranch(X[i+m], hlen, ilen, lt) && IsValidBranch(X[i+l], hlen, ilen, rt)) {
+                        Xc.emplace_back(X[i+m], X[i+l], hlen, lenIndices, clen);
+                    }
+                }
+            }
+        }
+
+        // 2d) Store tuples on the table in-place if possible
+        while (posFree < i+j && Xc.size() > 0) {
+            X[posFree++] = Xc.back();
+            Xc.pop_back();
+        }
+
+        i += j;
+    }
+
+    // 2e) Handle edge case where final table entry has no collision
+    while (posFree < X.size() && Xc.size() > 0) {
+        X[posFree++] = Xc.back();
+        Xc.pop_back();
+    }
+
+    if (Xc.size() > 0) {
+        // 2f) Add overflow to end of table
+        X.insert(X.end(), Xc.begin(), Xc.end());
+    } else if (posFree < X.size()) {
+        // 2g) Remove empty space at the end
+        X.erase(X.begin()+posFree, X.end());
+        X.shrink_to_fit();
+    }
+}
+
+template<unsigned int N, unsigned int K>
+bool Equihash<N,K>::OptimisedSolve(const eh_HashState& base_state,
+                                   const std::function<bool(std::vector<unsigned char>)> validBlock,
+                                   const std::function<bool(EhSolverCancelCheck)> cancelled)
+{
+    eh_index init_size { 1 << (CollisionBitLength + 1) };
+    eh_index recreate_size { UntruncateIndex(1, 0, CollisionBitLength + 1) };
+
+    // First run the algorithm with truncated indices
+
+    const eh_index soln_size { 1 << K };
+    std::vector<std::shared_ptr<eh_trunc>> partialSolns;
+    int invalidCount = 0;
+    {
+
+        // 1) Generate first list
+        LogPrint("pow", "Generating first list\n");
+        size_t hashLen = HashLength;
+        size_t lenIndices = sizeof(eh_trunc);
+        std::vector<TruncatedStepRow<TruncatedWidth>> Xt;
+        Xt.reserve(init_size);
+        unsigned char tmpHash[HashOutput];
+        for (eh_index g = 0; Xt.size() < init_size; g++) {
+            GenerateHash(base_state, g, tmpHash, HashOutput);
+            for (eh_index i = 0; i < IndicesPerHashOutput && Xt.size() < init_size; i++) {
+                Xt.emplace_back(tmpHash+(i*N/8), N/8, HashLength, CollisionBitLength,
+                                (g*IndicesPerHashOutput)+i, CollisionBitLength + 1);
+            }
+            if (cancelled(ListGeneration)) throw solver_cancelled;
+        }
+
+        // 3) Repeat step 2 until 2n/(k+1) bits remain
+        for (int r = 1; r < K && Xt.size() > 0; r++) {
+            LogPrint("pow", "Round %d:\n", r);
+            // 2a) Sort the list
+            LogPrint("pow", "- Sorting list\n");
+            std::sort(Xt.begin(), Xt.end(), CompareSR(CollisionByteLength));
+            if (cancelled(ListSorting)) throw solver_cancelled;
+
+            LogPrint("pow", "- Finding collisions\n");
+            int i = 0;
+            int posFree = 0;
+            std::vector<TruncatedStepRow<TruncatedWidth>> Xc;
+            while (i < Xt.size() - 1) {
+                // 2b) Find next set of unordered pairs with collisions on the next n/(k+1) bits
+                int j = 1;
+                while (i+j < Xt.size() &&
+                        HasCollision(Xt[i], Xt[i+j], CollisionByteLength)) {
+                    j++;
+                }
+
+                // 2c) Calculate tuples (X_i ^ X_j, (i, j))
+                bool checking_for_zero = (i == 0 && Xt[0].IsZero(hashLen));
+                for (int l = 0; l < j - 1; l++) {
+                    for (int m = l + 1; m < j; m++) {
+                        // We truncated, so don't check for distinct indices here
+                        TruncatedStepRow<TruncatedWidth> Xi {Xt[i+l], Xt[i+m],
+                                                             hashLen, lenIndices,
+                                                             CollisionByteLength};
+                        if (!(Xi.IsZero(hashLen-CollisionByteLength) &&
+                              IsProbablyDuplicate<soln_size>(Xi.GetTruncatedIndices(hashLen-CollisionByteLength, 2*lenIndices),
+                                                             2*lenIndices))) {
+                            Xc.emplace_back(Xi);
+                        }
+                    }
+                }
+
+                // 2d) Store tuples on the table in-place if possible
+                while (posFree < i+j && Xc.size() > 0) {
+                    Xt[posFree++] = Xc.back();
+                    Xc.pop_back();
+                }
+
+                i += j;
+                if (cancelled(ListColliding)) throw solver_cancelled;
+            }
+
+            // 2e) Handle edge case where final table entry has no collision
+            while (posFree < Xt.size() && Xc.size() > 0) {
+                Xt[posFree++] = Xc.back();
+                Xc.pop_back();
+            }
+
+            if (Xc.size() > 0) {
+                // 2f) Add overflow to end of table
+                Xt.insert(Xt.end(), Xc.begin(), Xc.end());
+            } else if (posFree < Xt.size()) {
+                // 2g) Remove empty space at the end
+                Xt.erase(Xt.begin()+posFree, Xt.end());
+                Xt.shrink_to_fit();
+            }
+
+            hashLen -= CollisionByteLength;
+            lenIndices *= 2;
+            if (cancelled(RoundEnd)) throw solver_cancelled;
+        }
+
+        // k+1) Find a collision on last 2n(k+1) bits
+        LogPrint("pow", "Final round:\n");
+        if (Xt.size() > 1) {
+            LogPrint("pow", "- Sorting list\n");
+            std::sort(Xt.begin(), Xt.end(), CompareSR(hashLen));
+            if (cancelled(FinalSorting)) throw solver_cancelled;
+            LogPrint("pow", "- Finding collisions\n");
+            int i = 0;
+            while (i < Xt.size() - 1) {
+                int j = 1;
+                while (i+j < Xt.size() &&
+                        HasCollision(Xt[i], Xt[i+j], hashLen)) {
+                    j++;
+                }
+
+                for (int l = 0; l < j - 1; l++) {
+                    for (int m = l + 1; m < j; m++) {
+                        TruncatedStepRow<FinalTruncatedWidth> res(Xt[i+l], Xt[i+m],
+                                                                  hashLen, lenIndices, 0);
+                        auto soln = res.GetTruncatedIndices(hashLen, 2*lenIndices);
+                        if (!IsProbablyDuplicate<soln_size>(soln, 2*lenIndices)) {
+                            partialSolns.push_back(soln);
+                        }
+                    }
+                }
+
+                i += j;
+                if (cancelled(FinalColliding)) throw solver_cancelled;
+            }
+        } else
+            LogPrint("pow", "- List is empty\n");
+
+    } // Ensure Xt goes out of scope and is destroyed
+
+    LogPrint("pow", "Found %d partial solutions\n", partialSolns.size());
+
+    // Now for each solution run the algorithm again to recreate the indices
+    LogPrint("pow", "Culling solutions\n");
+    for (std::shared_ptr<eh_trunc> partialSoln : partialSolns) {
+        std::set<std::vector<unsigned char>> solns;
+        size_t hashLen;
+        size_t lenIndices;
+        unsigned char tmpHash[HashOutput];
+        std::vector<std::optional<std::vector<FullStepRow<FinalFullWidth>>>> X;
+        X.reserve(K+1);
+
+        // 3) Repeat steps 1 and 2 for each partial index
+        for (eh_index i = 0; i < soln_size; i++) {
+            // 1) Generate first list of possibilities
+            std::vector<FullStepRow<FinalFullWidth>> icv;
+            icv.reserve(recreate_size);
+            for (eh_index j = 0; j < recreate_size; j++) {
+                eh_index newIndex { UntruncateIndex(partialSoln.get()[i], j, CollisionBitLength + 1) };
+                if (j == 0 || newIndex % IndicesPerHashOutput == 0) {
+                    GenerateHash(base_state, newIndex/IndicesPerHashOutput,
+                                 tmpHash, HashOutput);
+                }
+                icv.emplace_back(tmpHash+((newIndex % IndicesPerHashOutput) * N/8),
+                                 N/8, HashLength, CollisionBitLength, newIndex);
+                if (cancelled(PartialGeneration)) throw solver_cancelled;
+            }
+            std::optional<std::vector<FullStepRow<FinalFullWidth>>> ic = icv;
+
+            // 2a) For each pair of lists:
+            hashLen = HashLength;
+            lenIndices = sizeof(eh_index);
+            size_t rti = i;
+            for (size_t r = 0; r <= K; r++) {
+                // 2b) Until we are at the top of a subtree:
+                if (r < X.size()) {
+                    if (X[r]) {
+                        // 2c) Merge the lists
+                        ic->reserve(ic->size() + X[r]->size());
+                        ic->insert(ic->end(), X[r]->begin(), X[r]->end());
+                        std::sort(ic->begin(), ic->end(), CompareSR(hashLen));
+                        if (cancelled(PartialSorting)) throw solver_cancelled;
+                        size_t lti = rti-(1<<r);
+                        CollideBranches(*ic, hashLen, lenIndices,
+                                        CollisionByteLength,
+                                        CollisionBitLength + 1,
+                                        partialSoln.get()[lti], partialSoln.get()[rti]);
+
+                        // 2d) Check if this has become an invalid solution
+                        if (ic->size() == 0)
+                            goto invalidsolution;
+
+                        X[r] = std::nullopt;
+                        hashLen -= CollisionByteLength;
+                        lenIndices *= 2;
+                        rti = lti;
+                    } else {
+                        X[r] = *ic;
+                        break;
+                    }
+                } else {
+                    X.push_back(ic);
+                    break;
+                }
+                if (cancelled(PartialSubtreeEnd)) throw solver_cancelled;
+            }
+            if (cancelled(PartialIndexEnd)) throw solver_cancelled;
+        }
+
+        // We are at the top of the tree
+        assert(X.size() == K+1);
+        for (FullStepRow<FinalFullWidth> row : *X[K]) {
+            auto soln = row.GetIndices(hashLen, lenIndices, CollisionBitLength);
+            assert(soln.size() == equihash_solution_size(N, K));
+            solns.insert(soln);
+        }
+        for (auto soln : solns) {
+            if (validBlock(soln))
+                return true;
+        }
+        if (cancelled(PartialEnd)) throw solver_cancelled;
+        continue;
+
+invalidsolution:
+        invalidCount++;
+    }
+    LogPrint("pow", "- Number of invalid solutions found: %d\n", invalidCount);
+
+    return false;
+}
+
+// Explicit instantiations for Equihash<96,3>
+template void Equihash<96,3>::InitialiseState(eh_HashState& base_state);
+template bool Equihash<96,3>::BasicSolve(const eh_HashState& base_state,
+                                         const std::function<bool(std::vector<unsigned char>)> validBlock,
+                                         const std::function<bool(EhSolverCancelCheck)> cancelled);
+template bool Equihash<96,3>::OptimisedSolve(const eh_HashState& base_state,
+                                             const std::function<bool(std::vector<unsigned char>)> validBlock,
+                                             const std::function<bool(EhSolverCancelCheck)> cancelled);
+
+// Explicit instantiations for Equihash<200,9>
+template void Equihash<200,9>::InitialiseState(eh_HashState& base_state);
+template bool Equihash<200,9>::BasicSolve(const eh_HashState& base_state,
+                                          const std::function<bool(std::vector<unsigned char>)> validBlock,
+                                          const std::function<bool(EhSolverCancelCheck)> cancelled);
+template bool Equihash<200,9>::OptimisedSolve(const eh_HashState& base_state,
+                                              const std::function<bool(std::vector<unsigned char>)> validBlock,
+                                              const std::function<bool(EhSolverCancelCheck)> cancelled);
+
+// Explicit instantiations for Equihash<96,5>
+template void Equihash<96,5>::InitialiseState(eh_HashState& base_state);
+template bool Equihash<96,5>::BasicSolve(const eh_HashState& base_state,
+                                         const std::function<bool(std::vector<unsigned char>)> validBlock,
+                                         const std::function<bool(EhSolverCancelCheck)> cancelled);
+template bool Equihash<96,5>::OptimisedSolve(const eh_HashState& base_state,
+                                             const std::function<bool(std::vector<unsigned char>)> validBlock,
+                                             const std::function<bool(EhSolverCancelCheck)> cancelled);
+
+// Explicit instantiations for Equihash<48,5>
+template void Equihash<48,5>::InitialiseState(eh_HashState& base_state);
+template bool Equihash<48,5>::BasicSolve(const eh_HashState& base_state,
+                                         const std::function<bool(std::vector<unsigned char>)> validBlock,
+                                         const std::function<bool(EhSolverCancelCheck)> cancelled);
+template bool Equihash<48,5>::OptimisedSolve(const eh_HashState& base_state,
+                                             const std::function<bool(std::vector<unsigned char>)> validBlock,
+                                             const std::function<bool(EhSolverCancelCheck)> cancelled);
+
+#endif // ENABLE_MINING
diff --git a/depend/zcash/src/crypto/equihash.h b/depend/zcash/src/crypto/equihash.h
new file mode 100644
index 000000000..8099b20df
--- /dev/null
+++ b/depend/zcash/src/crypto/equihash.h
@@ -0,0 +1,293 @@
+// Copyright (c) 2016 Jack Grigg
+// Copyright (c) 2016 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_CRYPTO_EQUIHASH_H
+#define ZCASH_CRYPTO_EQUIHASH_H
+
+#include <memory>
+#include <vector>
+
+inline constexpr size_t equihash_solution_size(unsigned int N, unsigned int K) {
+    return (1 << K)*(N/(K+1)+1)/8;
+}
+
+typedef uint32_t eh_index;
+typedef uint8_t eh_trunc;
+
+std::vector<unsigned char> GetMinimalFromIndices(std::vector<eh_index> indices,
+                                                 size_t cBitLen);
+void CompressArray(const unsigned char* in, size_t in_len,
+                   unsigned char* out, size_t out_len,
+                   size_t bit_len, size_t byte_pad=0);
+void ExpandArray(const unsigned char* in, size_t in_len,
+                 unsigned char* out, size_t out_len,
+                 size_t bit_len, size_t byte_pad=0);
+void EhIndexToArray(const eh_index i, unsigned char* array);
+
+
+#ifdef ENABLE_MINING
+
+#include "crypto/sha256.h"
+#include "utilstrencodings.h"
+
+#include <cstring>
+#include <exception>
+#include <stdexcept>
+#include <functional>
+#include <set>
+
+#include <rust/blake2b.h>
+
+struct eh_HashState {
+    std::unique_ptr<BLAKE2bState, decltype(&blake2b_free)> inner;
+
+    eh_HashState() : inner(nullptr, blake2b_free) {}
+
+    eh_HashState(size_t length, unsigned char personalization[BLAKE2bPersonalBytes]) : inner(blake2b_init(length, personalization), blake2b_free) {}
+
+    eh_HashState(eh_HashState&& baseState) : inner(std::move(baseState.inner)) {}
+    eh_HashState(const eh_HashState& baseState) : inner(blake2b_clone(baseState.inner.get()), blake2b_free) {}
+    eh_HashState& operator=(eh_HashState&& baseState)
+    {
+        if (this != &baseState) {
+            inner = std::move(baseState.inner);
+        }
+        return *this;
+    }
+    eh_HashState& operator=(const eh_HashState& baseState)
+    {
+        if (this != &baseState) {
+            inner.reset(blake2b_clone(baseState.inner.get()));
+        }
+        return *this;
+    }
+
+    void Update(const unsigned char *input, size_t inputLen);
+    void Finalize(unsigned char *hash, size_t hLen);
+};
+
+eh_index ArrayToEhIndex(const unsigned char* array);
+eh_trunc TruncateIndex(const eh_index i, const unsigned int ilen);
+
+std::vector<eh_index> GetIndicesFromMinimal(std::vector<unsigned char> minimal,
+                                            size_t cBitLen);
+
+template<size_t WIDTH>
+class StepRow
+{
+    template<size_t W>
+    friend class StepRow;
+    friend class CompareSR;
+
+protected:
+    unsigned char hash[WIDTH];
+
+public:
+    StepRow(const unsigned char* hashIn, size_t hInLen,
+            size_t hLen, size_t cBitLen);
+    ~StepRow() { }
+
+    template<size_t W>
+    StepRow(const StepRow<W>& a);
+
+    bool IsZero(size_t len);
+    std::string GetHex(size_t len) { return HexStr(hash, hash+len); }
+
+    template<size_t W>
+    friend bool HasCollision(StepRow<W>& a, StepRow<W>& b, int l);
+};
+
+class CompareSR
+{
+private:
+    size_t len;
+
+public:
+    CompareSR(size_t l) : len {l} { }
+
+    template<size_t W>
+    inline bool operator()(const StepRow<W>& a, const StepRow<W>& b) { return memcmp(a.hash, b.hash, len) < 0; }
+};
+
+template<size_t WIDTH>
+bool HasCollision(StepRow<WIDTH>& a, StepRow<WIDTH>& b, int l);
+
+template<size_t WIDTH>
+class FullStepRow : public StepRow<WIDTH>
+{
+    template<size_t W>
+    friend class FullStepRow;
+
+    using StepRow<WIDTH>::hash;
+
+public:
+    FullStepRow(const unsigned char* hashIn, size_t hInLen,
+                size_t hLen, size_t cBitLen, eh_index i);
+    ~FullStepRow() { }
+
+    FullStepRow(const FullStepRow<WIDTH>& a) : StepRow<WIDTH> {a} { }
+    template<size_t W>
+    FullStepRow(const FullStepRow<W>& a, const FullStepRow<W>& b, size_t len, size_t lenIndices, int lenTrim);
+    FullStepRow& operator=(const FullStepRow<WIDTH>& a);
+
+    inline bool IndicesBefore(const FullStepRow<WIDTH>& a, size_t len, size_t lenIndices) const { return memcmp(hash+len, a.hash+len, lenIndices) < 0; }
+    std::vector<unsigned char> GetIndices(size_t len, size_t lenIndices,
+                                          size_t cBitLen) const;
+
+    template<size_t W>
+    friend bool DistinctIndices(const FullStepRow<W>& a, const FullStepRow<W>& b,
+                                size_t len, size_t lenIndices);
+    template<size_t W>
+    friend bool IsValidBranch(const FullStepRow<W>& a, const size_t len, const unsigned int ilen, const eh_trunc t);
+};
+
+template<size_t WIDTH>
+class TruncatedStepRow : public StepRow<WIDTH>
+{
+    template<size_t W>
+    friend class TruncatedStepRow;
+
+    using StepRow<WIDTH>::hash;
+
+public:
+    TruncatedStepRow(const unsigned char* hashIn, size_t hInLen,
+                     size_t hLen, size_t cBitLen,
+                     eh_index i, unsigned int ilen);
+    ~TruncatedStepRow() { }
+
+    TruncatedStepRow(const TruncatedStepRow<WIDTH>& a) : StepRow<WIDTH> {a} { }
+    template<size_t W>
+    TruncatedStepRow(const TruncatedStepRow<W>& a, const TruncatedStepRow<W>& b, size_t len, size_t lenIndices, int lenTrim);
+    TruncatedStepRow& operator=(const TruncatedStepRow<WIDTH>& a);
+
+    inline bool IndicesBefore(const TruncatedStepRow<WIDTH>& a, size_t len, size_t lenIndices) const { return memcmp(hash+len, a.hash+len, lenIndices) < 0; }
+    std::shared_ptr<eh_trunc> GetTruncatedIndices(size_t len, size_t lenIndices) const;
+};
+
+enum EhSolverCancelCheck
+{
+    ListGeneration,
+    ListSorting,
+    ListColliding,
+    RoundEnd,
+    FinalSorting,
+    FinalColliding,
+    PartialGeneration,
+    PartialSorting,
+    PartialSubtreeEnd,
+    PartialIndexEnd,
+    PartialEnd
+};
+
+class EhSolverCancelledException : public std::exception
+{
+    virtual const char* what() const throw() {
+        return "Equihash solver was cancelled";
+    }
+};
+
+inline constexpr const size_t max(const size_t A, const size_t B) { return A > B ? A : B; }
+
+template<unsigned int N, unsigned int K>
+class Equihash
+{
+private:
+    static_assert(K < N);
+    static_assert(N % 8 == 0);
+    static_assert((N/(K+1)) + 1 < 8*sizeof(eh_index));
+
+public:
+    enum : size_t { IndicesPerHashOutput=512/N };
+    enum : size_t { HashOutput=IndicesPerHashOutput*N/8 };
+    enum : size_t { CollisionBitLength=N/(K+1) };
+    enum : size_t { CollisionByteLength=(CollisionBitLength+7)/8 };
+    enum : size_t { HashLength=(K+1)*CollisionByteLength };
+    enum : size_t { FullWidth=2*CollisionByteLength+sizeof(eh_index)*(1 << (K-1)) };
+    enum : size_t { FinalFullWidth=2*CollisionByteLength+sizeof(eh_index)*(1 << (K)) };
+    enum : size_t { TruncatedWidth=max(HashLength+sizeof(eh_trunc), 2*CollisionByteLength+sizeof(eh_trunc)*(1 << (K-1))) };
+    enum : size_t { FinalTruncatedWidth=max(HashLength+sizeof(eh_trunc), 2*CollisionByteLength+sizeof(eh_trunc)*(1 << (K))) };
+    enum : size_t { SolutionWidth=(1 << K)*(CollisionBitLength+1)/8 };
+
+    Equihash() { }
+
+    void InitialiseState(eh_HashState& base_state);
+    bool BasicSolve(const eh_HashState& base_state,
+                    const std::function<bool(std::vector<unsigned char>)> validBlock,
+                    const std::function<bool(EhSolverCancelCheck)> cancelled);
+    bool OptimisedSolve(const eh_HashState& base_state,
+                        const std::function<bool(std::vector<unsigned char>)> validBlock,
+                        const std::function<bool(EhSolverCancelCheck)> cancelled);
+};
+
+#include "equihash.tcc"
+
+static Equihash<96,3> Eh96_3;
+static Equihash<200,9> Eh200_9;
+static Equihash<96,5> Eh96_5;
+static Equihash<48,5> Eh48_5;
+
+#define EhInitialiseState(n, k, base_state)  \
+    if (n == 96 && k == 3) {                 \
+        Eh96_3.InitialiseState(base_state);  \
+    } else if (n == 200 && k == 9) {         \
+        Eh200_9.InitialiseState(base_state); \
+    } else if (n == 96 && k == 5) {          \
+        Eh96_5.InitialiseState(base_state);  \
+    } else if (n == 48 && k == 5) {          \
+        Eh48_5.InitialiseState(base_state);  \
+    } else {                                 \
+        throw std::invalid_argument("Unsupported Equihash parameters"); \
+    }
+
+inline bool EhBasicSolve(unsigned int n, unsigned int k, const eh_HashState& base_state,
+                    const std::function<bool(std::vector<unsigned char>)> validBlock,
+                    const std::function<bool(EhSolverCancelCheck)> cancelled)
+{
+    if (n == 96 && k == 3) {
+        return Eh96_3.BasicSolve(base_state, validBlock, cancelled);
+    } else if (n == 200 && k == 9) {
+        return Eh200_9.BasicSolve(base_state, validBlock, cancelled);
+    } else if (n == 96 && k == 5) {
+        return Eh96_5.BasicSolve(base_state, validBlock, cancelled);
+    } else if (n == 48 && k == 5) {
+        return Eh48_5.BasicSolve(base_state, validBlock, cancelled);
+    } else {
+        throw std::invalid_argument("Unsupported Equihash parameters");
+    }
+}
+
+inline bool EhBasicSolveUncancellable(unsigned int n, unsigned int k, const eh_HashState& base_state,
+                    const std::function<bool(std::vector<unsigned char>)> validBlock)
+{
+    return EhBasicSolve(n, k, base_state, validBlock,
+                        [](EhSolverCancelCheck pos) { return false; });
+}
+
+inline bool EhOptimisedSolve(unsigned int n, unsigned int k, const eh_HashState& base_state,
+                    const std::function<bool(std::vector<unsigned char>)> validBlock,
+                    const std::function<bool(EhSolverCancelCheck)> cancelled)
+{
+    if (n == 96 && k == 3) {
+        return Eh96_3.OptimisedSolve(base_state, validBlock, cancelled);
+    } else if (n == 200 && k == 9) {
+        return Eh200_9.OptimisedSolve(base_state, validBlock, cancelled);
+    } else if (n == 96 && k == 5) {
+        return Eh96_5.OptimisedSolve(base_state, validBlock, cancelled);
+    } else if (n == 48 && k == 5) {
+        return Eh48_5.OptimisedSolve(base_state, validBlock, cancelled);
+    } else {
+        throw std::invalid_argument("Unsupported Equihash parameters");
+    }
+}
+
+inline bool EhOptimisedSolveUncancellable(unsigned int n, unsigned int k, const eh_HashState& base_state,
+                    const std::function<bool(std::vector<unsigned char>)> validBlock)
+{
+    return EhOptimisedSolve(n, k, base_state, validBlock,
+                            [](EhSolverCancelCheck pos) { return false; });
+}
+#endif // ENABLE_MINING
+
+#endif // ZCASH_CRYPTO_EQUIHASH_H
diff --git a/depend/zcash/src/crypto/equihash.tcc b/depend/zcash/src/crypto/equihash.tcc
new file mode 100644
index 000000000..8279396d1
--- /dev/null
+++ b/depend/zcash/src/crypto/equihash.tcc
@@ -0,0 +1,49 @@
+// Copyright (c) 2016 Jack Grigg
+// Copyright (c) 2016 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include <algorithm>
+#include <cassert>
+
+// Checks if the intersection of a.indices and b.indices is empty
+template<size_t WIDTH>
+bool DistinctIndices(const FullStepRow<WIDTH>& a, const FullStepRow<WIDTH>& b, size_t len, size_t lenIndices)
+{
+    for(size_t i = 0; i < lenIndices; i += sizeof(eh_index)) {
+        for(size_t j = 0; j < lenIndices; j += sizeof(eh_index)) {
+            if (memcmp(a.hash+len+i, b.hash+len+j, sizeof(eh_index)) == 0) {
+                return false;
+            }
+        }
+    }
+    return true;
+}
+
+template<size_t MAX_INDICES>
+bool IsProbablyDuplicate(std::shared_ptr<eh_trunc> indices, size_t lenIndices)
+{
+    assert(lenIndices <= MAX_INDICES);
+    bool checked_index[MAX_INDICES] = {false};
+    int count_checked = 0;
+    for (int z = 0; z < lenIndices; z++) {
+        // Skip over indices we have already paired
+        if (!checked_index[z]) {
+            for (int y = z+1; y < lenIndices; y++) {
+                if (!checked_index[y] && indices.get()[z] == indices.get()[y]) {
+                    // Pair found
+                    checked_index[y] = true;
+                    count_checked += 2;
+                    break;
+                }
+            }
+        }
+    }
+    return count_checked == lenIndices;
+}
+
+template<size_t WIDTH>
+bool IsValidBranch(const FullStepRow<WIDTH>& a, const size_t len, const unsigned int ilen, const eh_trunc t)
+{
+    return TruncateIndex(ArrayToEhIndex(a.hash+len), ilen) == t;
+}
diff --git a/depend/zcash/src/crypto/hmac_sha256.cpp b/depend/zcash/src/crypto/hmac_sha256.cpp
new file mode 100644
index 000000000..951c569ed
--- /dev/null
+++ b/depend/zcash/src/crypto/hmac_sha256.cpp
@@ -0,0 +1,34 @@
+// Copyright (c) 2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "crypto/hmac_sha256.h"
+
+#include <string.h>
+
+CHMAC_SHA256::CHMAC_SHA256(const unsigned char* key, size_t keylen)
+{
+    unsigned char rkey[64];
+    if (keylen <= 64) {
+        memcpy(rkey, key, keylen);
+        memset(rkey + keylen, 0, 64 - keylen);
+    } else {
+        CSHA256().Write(key, keylen).Finalize(rkey);
+        memset(rkey + 32, 0, 32);
+    }
+
+    for (int n = 0; n < 64; n++)
+        rkey[n] ^= 0x5c;
+    outer.Write(rkey, 64);
+
+    for (int n = 0; n < 64; n++)
+        rkey[n] ^= 0x5c ^ 0x36;
+    inner.Write(rkey, 64);
+}
+
+void CHMAC_SHA256::Finalize(unsigned char hash[OUTPUT_SIZE])
+{
+    unsigned char temp[32];
+    inner.Finalize(temp);
+    outer.Write(temp, 32).Finalize(hash);
+}
diff --git a/depend/zcash/src/crypto/hmac_sha256.h b/depend/zcash/src/crypto/hmac_sha256.h
new file mode 100644
index 000000000..c7627da2e
--- /dev/null
+++ b/depend/zcash/src/crypto/hmac_sha256.h
@@ -0,0 +1,32 @@
+// Copyright (c) 2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_CRYPTO_HMAC_SHA256_H
+#define BITCOIN_CRYPTO_HMAC_SHA256_H
+
+#include "crypto/sha256.h"
+
+#include <stdint.h>
+#include <stdlib.h>
+
+/** A hasher class for HMAC-SHA-512. */
+class CHMAC_SHA256
+{
+private:
+    CSHA256 outer;
+    CSHA256 inner;
+
+public:
+    static const size_t OUTPUT_SIZE = 32;
+
+    CHMAC_SHA256(const unsigned char* key, size_t keylen);
+    CHMAC_SHA256& Write(const unsigned char* data, size_t len)
+    {
+        inner.Write(data, len);
+        return *this;
+    }
+    void Finalize(unsigned char hash[OUTPUT_SIZE]);
+};
+
+#endif // BITCOIN_CRYPTO_HMAC_SHA256_H
diff --git a/depend/zcash/src/crypto/hmac_sha512.cpp b/depend/zcash/src/crypto/hmac_sha512.cpp
new file mode 100644
index 000000000..ca7b00c63
--- /dev/null
+++ b/depend/zcash/src/crypto/hmac_sha512.cpp
@@ -0,0 +1,34 @@
+// Copyright (c) 2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "crypto/hmac_sha512.h"
+
+#include <string.h>
+
+CHMAC_SHA512::CHMAC_SHA512(const unsigned char* key, size_t keylen)
+{
+    unsigned char rkey[128];
+    if (keylen <= 128) {
+        memcpy(rkey, key, keylen);
+        memset(rkey + keylen, 0, 128 - keylen);
+    } else {
+        CSHA512().Write(key, keylen).Finalize(rkey);
+        memset(rkey + 64, 0, 64);
+    }
+
+    for (int n = 0; n < 128; n++)
+        rkey[n] ^= 0x5c;
+    outer.Write(rkey, 128);
+
+    for (int n = 0; n < 128; n++)
+        rkey[n] ^= 0x5c ^ 0x36;
+    inner.Write(rkey, 128);
+}
+
+void CHMAC_SHA512::Finalize(unsigned char hash[OUTPUT_SIZE])
+{
+    unsigned char temp[64];
+    inner.Finalize(temp);
+    outer.Write(temp, 64).Finalize(hash);
+}
diff --git a/depend/zcash/src/crypto/hmac_sha512.h b/depend/zcash/src/crypto/hmac_sha512.h
new file mode 100644
index 000000000..61514636b
--- /dev/null
+++ b/depend/zcash/src/crypto/hmac_sha512.h
@@ -0,0 +1,32 @@
+// Copyright (c) 2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_CRYPTO_HMAC_SHA512_H
+#define BITCOIN_CRYPTO_HMAC_SHA512_H
+
+#include "crypto/sha512.h"
+
+#include <stdint.h>
+#include <stdlib.h>
+
+/** A hasher class for HMAC-SHA-512. */
+class CHMAC_SHA512
+{
+private:
+    CSHA512 outer;
+    CSHA512 inner;
+
+public:
+    static const size_t OUTPUT_SIZE = 64;
+
+    CHMAC_SHA512(const unsigned char* key, size_t keylen);
+    CHMAC_SHA512& Write(const unsigned char* data, size_t len)
+    {
+        inner.Write(data, len);
+        return *this;
+    }
+    void Finalize(unsigned char hash[OUTPUT_SIZE]);
+};
+
+#endif // BITCOIN_CRYPTO_HMAC_SHA512_H
diff --git a/depend/zcash/src/crypto/ripemd160.cpp b/depend/zcash/src/crypto/ripemd160.cpp
new file mode 100644
index 000000000..70dad5e5d
--- /dev/null
+++ b/depend/zcash/src/crypto/ripemd160.cpp
@@ -0,0 +1,292 @@
+// Copyright (c) 2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "crypto/ripemd160.h"
+
+#include "crypto/common.h"
+
+#include <string.h>
+
+// Internal implementation code.
+namespace
+{
+/// Internal RIPEMD-160 implementation.
+namespace ripemd160
+{
+uint32_t inline f1(uint32_t x, uint32_t y, uint32_t z) { return x ^ y ^ z; }
+uint32_t inline f2(uint32_t x, uint32_t y, uint32_t z) { return (x & y) | (~x & z); }
+uint32_t inline f3(uint32_t x, uint32_t y, uint32_t z) { return (x | ~y) ^ z; }
+uint32_t inline f4(uint32_t x, uint32_t y, uint32_t z) { return (x & z) | (y & ~z); }
+uint32_t inline f5(uint32_t x, uint32_t y, uint32_t z) { return x ^ (y | ~z); }
+
+/** Initialize RIPEMD-160 state. */
+void inline Initialize(uint32_t* s)
+{
+    s[0] = 0x67452301ul;
+    s[1] = 0xEFCDAB89ul;
+    s[2] = 0x98BADCFEul;
+    s[3] = 0x10325476ul;
+    s[4] = 0xC3D2E1F0ul;
+}
+
+uint32_t inline rol(uint32_t x, int i) { return (x << i) | (x >> (32 - i)); }
+
+void inline Round(uint32_t& a, uint32_t b, uint32_t& c, uint32_t d, uint32_t e, uint32_t f, uint32_t x, uint32_t k, int r)
+{
+    a = rol(a + f + x + k, r) + e;
+    c = rol(c, 10);
+}
+
+void inline R11(uint32_t& a, uint32_t b, uint32_t& c, uint32_t d, uint32_t e, uint32_t x, int r) { Round(a, b, c, d, e, f1(b, c, d), x, 0, r); }
+void inline R21(uint32_t& a, uint32_t b, uint32_t& c, uint32_t d, uint32_t e, uint32_t x, int r) { Round(a, b, c, d, e, f2(b, c, d), x, 0x5A827999ul, r); }
+void inline R31(uint32_t& a, uint32_t b, uint32_t& c, uint32_t d, uint32_t e, uint32_t x, int r) { Round(a, b, c, d, e, f3(b, c, d), x, 0x6ED9EBA1ul, r); }
+void inline R41(uint32_t& a, uint32_t b, uint32_t& c, uint32_t d, uint32_t e, uint32_t x, int r) { Round(a, b, c, d, e, f4(b, c, d), x, 0x8F1BBCDCul, r); }
+void inline R51(uint32_t& a, uint32_t b, uint32_t& c, uint32_t d, uint32_t e, uint32_t x, int r) { Round(a, b, c, d, e, f5(b, c, d), x, 0xA953FD4Eul, r); }
+
+void inline R12(uint32_t& a, uint32_t b, uint32_t& c, uint32_t d, uint32_t e, uint32_t x, int r) { Round(a, b, c, d, e, f5(b, c, d), x, 0x50A28BE6ul, r); }
+void inline R22(uint32_t& a, uint32_t b, uint32_t& c, uint32_t d, uint32_t e, uint32_t x, int r) { Round(a, b, c, d, e, f4(b, c, d), x, 0x5C4DD124ul, r); }
+void inline R32(uint32_t& a, uint32_t b, uint32_t& c, uint32_t d, uint32_t e, uint32_t x, int r) { Round(a, b, c, d, e, f3(b, c, d), x, 0x6D703EF3ul, r); }
+void inline R42(uint32_t& a, uint32_t b, uint32_t& c, uint32_t d, uint32_t e, uint32_t x, int r) { Round(a, b, c, d, e, f2(b, c, d), x, 0x7A6D76E9ul, r); }
+void inline R52(uint32_t& a, uint32_t b, uint32_t& c, uint32_t d, uint32_t e, uint32_t x, int r) { Round(a, b, c, d, e, f1(b, c, d), x, 0, r); }
+
+/** Perform a RIPEMD-160 transformation, processing a 64-byte chunk. */
+void Transform(uint32_t* s, const unsigned char* chunk)
+{
+    uint32_t a1 = s[0], b1 = s[1], c1 = s[2], d1 = s[3], e1 = s[4];
+    uint32_t a2 = a1, b2 = b1, c2 = c1, d2 = d1, e2 = e1;
+    uint32_t w0 = ReadLE32(chunk + 0), w1 = ReadLE32(chunk + 4), w2 = ReadLE32(chunk + 8), w3 = ReadLE32(chunk + 12);
+    uint32_t w4 = ReadLE32(chunk + 16), w5 = ReadLE32(chunk + 20), w6 = ReadLE32(chunk + 24), w7 = ReadLE32(chunk + 28);
+    uint32_t w8 = ReadLE32(chunk + 32), w9 = ReadLE32(chunk + 36), w10 = ReadLE32(chunk + 40), w11 = ReadLE32(chunk + 44);
+    uint32_t w12 = ReadLE32(chunk + 48), w13 = ReadLE32(chunk + 52), w14 = ReadLE32(chunk + 56), w15 = ReadLE32(chunk + 60);
+
+    R11(a1, b1, c1, d1, e1, w0, 11);
+    R12(a2, b2, c2, d2, e2, w5, 8);
+    R11(e1, a1, b1, c1, d1, w1, 14);
+    R12(e2, a2, b2, c2, d2, w14, 9);
+    R11(d1, e1, a1, b1, c1, w2, 15);
+    R12(d2, e2, a2, b2, c2, w7, 9);
+    R11(c1, d1, e1, a1, b1, w3, 12);
+    R12(c2, d2, e2, a2, b2, w0, 11);
+    R11(b1, c1, d1, e1, a1, w4, 5);
+    R12(b2, c2, d2, e2, a2, w9, 13);
+    R11(a1, b1, c1, d1, e1, w5, 8);
+    R12(a2, b2, c2, d2, e2, w2, 15);
+    R11(e1, a1, b1, c1, d1, w6, 7);
+    R12(e2, a2, b2, c2, d2, w11, 15);
+    R11(d1, e1, a1, b1, c1, w7, 9);
+    R12(d2, e2, a2, b2, c2, w4, 5);
+    R11(c1, d1, e1, a1, b1, w8, 11);
+    R12(c2, d2, e2, a2, b2, w13, 7);
+    R11(b1, c1, d1, e1, a1, w9, 13);
+    R12(b2, c2, d2, e2, a2, w6, 7);
+    R11(a1, b1, c1, d1, e1, w10, 14);
+    R12(a2, b2, c2, d2, e2, w15, 8);
+    R11(e1, a1, b1, c1, d1, w11, 15);
+    R12(e2, a2, b2, c2, d2, w8, 11);
+    R11(d1, e1, a1, b1, c1, w12, 6);
+    R12(d2, e2, a2, b2, c2, w1, 14);
+    R11(c1, d1, e1, a1, b1, w13, 7);
+    R12(c2, d2, e2, a2, b2, w10, 14);
+    R11(b1, c1, d1, e1, a1, w14, 9);
+    R12(b2, c2, d2, e2, a2, w3, 12);
+    R11(a1, b1, c1, d1, e1, w15, 8);
+    R12(a2, b2, c2, d2, e2, w12, 6);
+
+    R21(e1, a1, b1, c1, d1, w7, 7);
+    R22(e2, a2, b2, c2, d2, w6, 9);
+    R21(d1, e1, a1, b1, c1, w4, 6);
+    R22(d2, e2, a2, b2, c2, w11, 13);
+    R21(c1, d1, e1, a1, b1, w13, 8);
+    R22(c2, d2, e2, a2, b2, w3, 15);
+    R21(b1, c1, d1, e1, a1, w1, 13);
+    R22(b2, c2, d2, e2, a2, w7, 7);
+    R21(a1, b1, c1, d1, e1, w10, 11);
+    R22(a2, b2, c2, d2, e2, w0, 12);
+    R21(e1, a1, b1, c1, d1, w6, 9);
+    R22(e2, a2, b2, c2, d2, w13, 8);
+    R21(d1, e1, a1, b1, c1, w15, 7);
+    R22(d2, e2, a2, b2, c2, w5, 9);
+    R21(c1, d1, e1, a1, b1, w3, 15);
+    R22(c2, d2, e2, a2, b2, w10, 11);
+    R21(b1, c1, d1, e1, a1, w12, 7);
+    R22(b2, c2, d2, e2, a2, w14, 7);
+    R21(a1, b1, c1, d1, e1, w0, 12);
+    R22(a2, b2, c2, d2, e2, w15, 7);
+    R21(e1, a1, b1, c1, d1, w9, 15);
+    R22(e2, a2, b2, c2, d2, w8, 12);
+    R21(d1, e1, a1, b1, c1, w5, 9);
+    R22(d2, e2, a2, b2, c2, w12, 7);
+    R21(c1, d1, e1, a1, b1, w2, 11);
+    R22(c2, d2, e2, a2, b2, w4, 6);
+    R21(b1, c1, d1, e1, a1, w14, 7);
+    R22(b2, c2, d2, e2, a2, w9, 15);
+    R21(a1, b1, c1, d1, e1, w11, 13);
+    R22(a2, b2, c2, d2, e2, w1, 13);
+    R21(e1, a1, b1, c1, d1, w8, 12);
+    R22(e2, a2, b2, c2, d2, w2, 11);
+
+    R31(d1, e1, a1, b1, c1, w3, 11);
+    R32(d2, e2, a2, b2, c2, w15, 9);
+    R31(c1, d1, e1, a1, b1, w10, 13);
+    R32(c2, d2, e2, a2, b2, w5, 7);
+    R31(b1, c1, d1, e1, a1, w14, 6);
+    R32(b2, c2, d2, e2, a2, w1, 15);
+    R31(a1, b1, c1, d1, e1, w4, 7);
+    R32(a2, b2, c2, d2, e2, w3, 11);
+    R31(e1, a1, b1, c1, d1, w9, 14);
+    R32(e2, a2, b2, c2, d2, w7, 8);
+    R31(d1, e1, a1, b1, c1, w15, 9);
+    R32(d2, e2, a2, b2, c2, w14, 6);
+    R31(c1, d1, e1, a1, b1, w8, 13);
+    R32(c2, d2, e2, a2, b2, w6, 6);
+    R31(b1, c1, d1, e1, a1, w1, 15);
+    R32(b2, c2, d2, e2, a2, w9, 14);
+    R31(a1, b1, c1, d1, e1, w2, 14);
+    R32(a2, b2, c2, d2, e2, w11, 12);
+    R31(e1, a1, b1, c1, d1, w7, 8);
+    R32(e2, a2, b2, c2, d2, w8, 13);
+    R31(d1, e1, a1, b1, c1, w0, 13);
+    R32(d2, e2, a2, b2, c2, w12, 5);
+    R31(c1, d1, e1, a1, b1, w6, 6);
+    R32(c2, d2, e2, a2, b2, w2, 14);
+    R31(b1, c1, d1, e1, a1, w13, 5);
+    R32(b2, c2, d2, e2, a2, w10, 13);
+    R31(a1, b1, c1, d1, e1, w11, 12);
+    R32(a2, b2, c2, d2, e2, w0, 13);
+    R31(e1, a1, b1, c1, d1, w5, 7);
+    R32(e2, a2, b2, c2, d2, w4, 7);
+    R31(d1, e1, a1, b1, c1, w12, 5);
+    R32(d2, e2, a2, b2, c2, w13, 5);
+
+    R41(c1, d1, e1, a1, b1, w1, 11);
+    R42(c2, d2, e2, a2, b2, w8, 15);
+    R41(b1, c1, d1, e1, a1, w9, 12);
+    R42(b2, c2, d2, e2, a2, w6, 5);
+    R41(a1, b1, c1, d1, e1, w11, 14);
+    R42(a2, b2, c2, d2, e2, w4, 8);
+    R41(e1, a1, b1, c1, d1, w10, 15);
+    R42(e2, a2, b2, c2, d2, w1, 11);
+    R41(d1, e1, a1, b1, c1, w0, 14);
+    R42(d2, e2, a2, b2, c2, w3, 14);
+    R41(c1, d1, e1, a1, b1, w8, 15);
+    R42(c2, d2, e2, a2, b2, w11, 14);
+    R41(b1, c1, d1, e1, a1, w12, 9);
+    R42(b2, c2, d2, e2, a2, w15, 6);
+    R41(a1, b1, c1, d1, e1, w4, 8);
+    R42(a2, b2, c2, d2, e2, w0, 14);
+    R41(e1, a1, b1, c1, d1, w13, 9);
+    R42(e2, a2, b2, c2, d2, w5, 6);
+    R41(d1, e1, a1, b1, c1, w3, 14);
+    R42(d2, e2, a2, b2, c2, w12, 9);
+    R41(c1, d1, e1, a1, b1, w7, 5);
+    R42(c2, d2, e2, a2, b2, w2, 12);
+    R41(b1, c1, d1, e1, a1, w15, 6);
+    R42(b2, c2, d2, e2, a2, w13, 9);
+    R41(a1, b1, c1, d1, e1, w14, 8);
+    R42(a2, b2, c2, d2, e2, w9, 12);
+    R41(e1, a1, b1, c1, d1, w5, 6);
+    R42(e2, a2, b2, c2, d2, w7, 5);
+    R41(d1, e1, a1, b1, c1, w6, 5);
+    R42(d2, e2, a2, b2, c2, w10, 15);
+    R41(c1, d1, e1, a1, b1, w2, 12);
+    R42(c2, d2, e2, a2, b2, w14, 8);
+
+    R51(b1, c1, d1, e1, a1, w4, 9);
+    R52(b2, c2, d2, e2, a2, w12, 8);
+    R51(a1, b1, c1, d1, e1, w0, 15);
+    R52(a2, b2, c2, d2, e2, w15, 5);
+    R51(e1, a1, b1, c1, d1, w5, 5);
+    R52(e2, a2, b2, c2, d2, w10, 12);
+    R51(d1, e1, a1, b1, c1, w9, 11);
+    R52(d2, e2, a2, b2, c2, w4, 9);
+    R51(c1, d1, e1, a1, b1, w7, 6);
+    R52(c2, d2, e2, a2, b2, w1, 12);
+    R51(b1, c1, d1, e1, a1, w12, 8);
+    R52(b2, c2, d2, e2, a2, w5, 5);
+    R51(a1, b1, c1, d1, e1, w2, 13);
+    R52(a2, b2, c2, d2, e2, w8, 14);
+    R51(e1, a1, b1, c1, d1, w10, 12);
+    R52(e2, a2, b2, c2, d2, w7, 6);
+    R51(d1, e1, a1, b1, c1, w14, 5);
+    R52(d2, e2, a2, b2, c2, w6, 8);
+    R51(c1, d1, e1, a1, b1, w1, 12);
+    R52(c2, d2, e2, a2, b2, w2, 13);
+    R51(b1, c1, d1, e1, a1, w3, 13);
+    R52(b2, c2, d2, e2, a2, w13, 6);
+    R51(a1, b1, c1, d1, e1, w8, 14);
+    R52(a2, b2, c2, d2, e2, w14, 5);
+    R51(e1, a1, b1, c1, d1, w11, 11);
+    R52(e2, a2, b2, c2, d2, w0, 15);
+    R51(d1, e1, a1, b1, c1, w6, 8);
+    R52(d2, e2, a2, b2, c2, w3, 13);
+    R51(c1, d1, e1, a1, b1, w15, 5);
+    R52(c2, d2, e2, a2, b2, w9, 11);
+    R51(b1, c1, d1, e1, a1, w13, 6);
+    R52(b2, c2, d2, e2, a2, w11, 11);
+
+    uint32_t t = s[0];
+    s[0] = s[1] + c1 + d2;
+    s[1] = s[2] + d1 + e2;
+    s[2] = s[3] + e1 + a2;
+    s[3] = s[4] + a1 + b2;
+    s[4] = t + b1 + c2;
+}
+
+} // namespace ripemd160
+
+} // namespace
+
+////// RIPEMD160
+
+CRIPEMD160::CRIPEMD160() : bytes(0)
+{
+    ripemd160::Initialize(s);
+}
+
+CRIPEMD160& CRIPEMD160::Write(const unsigned char* data, size_t len)
+{
+    const unsigned char* end = data + len;
+    size_t bufsize = bytes % 64;
+    if (bufsize && bufsize + len >= 64) {
+        // Fill the buffer, and process it.
+        memcpy(buf + bufsize, data, 64 - bufsize);
+        bytes += 64 - bufsize;
+        data += 64 - bufsize;
+        ripemd160::Transform(s, buf);
+        bufsize = 0;
+    }
+    while (end >= data + 64) {
+        // Process full chunks directly from the source.
+        ripemd160::Transform(s, data);
+        bytes += 64;
+        data += 64;
+    }
+    if (end > data) {
+        // Fill the buffer with what remains.
+        memcpy(buf + bufsize, data, end - data);
+        bytes += end - data;
+    }
+    return *this;
+}
+
+void CRIPEMD160::Finalize(unsigned char hash[OUTPUT_SIZE])
+{
+    static const unsigned char pad[64] = {0x80};
+    unsigned char sizedesc[8];
+    WriteLE64(sizedesc, bytes << 3);
+    Write(pad, 1 + ((119 - (bytes % 64)) % 64));
+    Write(sizedesc, 8);
+    WriteLE32(hash, s[0]);
+    WriteLE32(hash + 4, s[1]);
+    WriteLE32(hash + 8, s[2]);
+    WriteLE32(hash + 12, s[3]);
+    WriteLE32(hash + 16, s[4]);
+}
+
+CRIPEMD160& CRIPEMD160::Reset()
+{
+    bytes = 0;
+    ripemd160::Initialize(s);
+    return *this;
+}
diff --git a/depend/zcash/src/crypto/ripemd160.h b/depend/zcash/src/crypto/ripemd160.h
new file mode 100644
index 000000000..b56aac900
--- /dev/null
+++ b/depend/zcash/src/crypto/ripemd160.h
@@ -0,0 +1,28 @@
+// Copyright (c) 2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_CRYPTO_RIPEMD160_H
+#define BITCOIN_CRYPTO_RIPEMD160_H
+
+#include <stdint.h>
+#include <stdlib.h>
+
+/** A hasher class for RIPEMD-160. */
+class CRIPEMD160
+{
+private:
+    uint32_t s[5];
+    unsigned char buf[64];
+    size_t bytes;
+
+public:
+    static const size_t OUTPUT_SIZE = 20;
+
+    CRIPEMD160();
+    CRIPEMD160& Write(const unsigned char* data, size_t len);
+    void Finalize(unsigned char hash[OUTPUT_SIZE]);
+    CRIPEMD160& Reset();
+};
+
+#endif // BITCOIN_CRYPTO_RIPEMD160_H
diff --git a/depend/zcash/src/crypto/sha1.cpp b/depend/zcash/src/crypto/sha1.cpp
new file mode 100644
index 000000000..c437f9d1f
--- /dev/null
+++ b/depend/zcash/src/crypto/sha1.cpp
@@ -0,0 +1,199 @@
+// Copyright (c) 2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "crypto/sha1.h"
+
+#include "crypto/common.h"
+
+#include <string.h>
+
+// Internal implementation code.
+namespace
+{
+/// Internal SHA-1 implementation.
+namespace sha1
+{
+/** One round of SHA-1. */
+void inline Round(uint32_t a, uint32_t& b, uint32_t c, uint32_t d, uint32_t& e, uint32_t f, uint32_t k, uint32_t w)
+{
+    e += ((a << 5) | (a >> 27)) + f + k + w;
+    b = (b << 30) | (b >> 2);
+}
+
+uint32_t inline f1(uint32_t b, uint32_t c, uint32_t d) { return d ^ (b & (c ^ d)); }
+uint32_t inline f2(uint32_t b, uint32_t c, uint32_t d) { return b ^ c ^ d; }
+uint32_t inline f3(uint32_t b, uint32_t c, uint32_t d) { return (b & c) | (d & (b | c)); }
+
+uint32_t inline left(uint32_t x) { return (x << 1) | (x >> 31); }
+
+/** Initialize SHA-1 state. */
+void inline Initialize(uint32_t* s)
+{
+    s[0] = 0x67452301ul;
+    s[1] = 0xEFCDAB89ul;
+    s[2] = 0x98BADCFEul;
+    s[3] = 0x10325476ul;
+    s[4] = 0xC3D2E1F0ul;
+}
+
+const uint32_t k1 = 0x5A827999ul;
+const uint32_t k2 = 0x6ED9EBA1ul;
+const uint32_t k3 = 0x8F1BBCDCul;
+const uint32_t k4 = 0xCA62C1D6ul;
+
+/** Perform a SHA-1 transformation, processing a 64-byte chunk. */
+void Transform(uint32_t* s, const unsigned char* chunk)
+{
+    uint32_t a = s[0], b = s[1], c = s[2], d = s[3], e = s[4];
+    uint32_t w0, w1, w2, w3, w4, w5, w6, w7, w8, w9, w10, w11, w12, w13, w14, w15;
+
+    Round(a, b, c, d, e, f1(b, c, d), k1, w0 = ReadBE32(chunk + 0));
+    Round(e, a, b, c, d, f1(a, b, c), k1, w1 = ReadBE32(chunk + 4));
+    Round(d, e, a, b, c, f1(e, a, b), k1, w2 = ReadBE32(chunk + 8));
+    Round(c, d, e, a, b, f1(d, e, a), k1, w3 = ReadBE32(chunk + 12));
+    Round(b, c, d, e, a, f1(c, d, e), k1, w4 = ReadBE32(chunk + 16));
+    Round(a, b, c, d, e, f1(b, c, d), k1, w5 = ReadBE32(chunk + 20));
+    Round(e, a, b, c, d, f1(a, b, c), k1, w6 = ReadBE32(chunk + 24));
+    Round(d, e, a, b, c, f1(e, a, b), k1, w7 = ReadBE32(chunk + 28));
+    Round(c, d, e, a, b, f1(d, e, a), k1, w8 = ReadBE32(chunk + 32));
+    Round(b, c, d, e, a, f1(c, d, e), k1, w9 = ReadBE32(chunk + 36));
+    Round(a, b, c, d, e, f1(b, c, d), k1, w10 = ReadBE32(chunk + 40));
+    Round(e, a, b, c, d, f1(a, b, c), k1, w11 = ReadBE32(chunk + 44));
+    Round(d, e, a, b, c, f1(e, a, b), k1, w12 = ReadBE32(chunk + 48));
+    Round(c, d, e, a, b, f1(d, e, a), k1, w13 = ReadBE32(chunk + 52));
+    Round(b, c, d, e, a, f1(c, d, e), k1, w14 = ReadBE32(chunk + 56));
+    Round(a, b, c, d, e, f1(b, c, d), k1, w15 = ReadBE32(chunk + 60));
+
+    Round(e, a, b, c, d, f1(a, b, c), k1, w0 = left(w0 ^ w13 ^ w8 ^ w2));
+    Round(d, e, a, b, c, f1(e, a, b), k1, w1 = left(w1 ^ w14 ^ w9 ^ w3));
+    Round(c, d, e, a, b, f1(d, e, a), k1, w2 = left(w2 ^ w15 ^ w10 ^ w4));
+    Round(b, c, d, e, a, f1(c, d, e), k1, w3 = left(w3 ^ w0 ^ w11 ^ w5));
+    Round(a, b, c, d, e, f2(b, c, d), k2, w4 = left(w4 ^ w1 ^ w12 ^ w6));
+    Round(e, a, b, c, d, f2(a, b, c), k2, w5 = left(w5 ^ w2 ^ w13 ^ w7));
+    Round(d, e, a, b, c, f2(e, a, b), k2, w6 = left(w6 ^ w3 ^ w14 ^ w8));
+    Round(c, d, e, a, b, f2(d, e, a), k2, w7 = left(w7 ^ w4 ^ w15 ^ w9));
+    Round(b, c, d, e, a, f2(c, d, e), k2, w8 = left(w8 ^ w5 ^ w0 ^ w10));
+    Round(a, b, c, d, e, f2(b, c, d), k2, w9 = left(w9 ^ w6 ^ w1 ^ w11));
+    Round(e, a, b, c, d, f2(a, b, c), k2, w10 = left(w10 ^ w7 ^ w2 ^ w12));
+    Round(d, e, a, b, c, f2(e, a, b), k2, w11 = left(w11 ^ w8 ^ w3 ^ w13));
+    Round(c, d, e, a, b, f2(d, e, a), k2, w12 = left(w12 ^ w9 ^ w4 ^ w14));
+    Round(b, c, d, e, a, f2(c, d, e), k2, w13 = left(w13 ^ w10 ^ w5 ^ w15));
+    Round(a, b, c, d, e, f2(b, c, d), k2, w14 = left(w14 ^ w11 ^ w6 ^ w0));
+    Round(e, a, b, c, d, f2(a, b, c), k2, w15 = left(w15 ^ w12 ^ w7 ^ w1));
+
+    Round(d, e, a, b, c, f2(e, a, b), k2, w0 = left(w0 ^ w13 ^ w8 ^ w2));
+    Round(c, d, e, a, b, f2(d, e, a), k2, w1 = left(w1 ^ w14 ^ w9 ^ w3));
+    Round(b, c, d, e, a, f2(c, d, e), k2, w2 = left(w2 ^ w15 ^ w10 ^ w4));
+    Round(a, b, c, d, e, f2(b, c, d), k2, w3 = left(w3 ^ w0 ^ w11 ^ w5));
+    Round(e, a, b, c, d, f2(a, b, c), k2, w4 = left(w4 ^ w1 ^ w12 ^ w6));
+    Round(d, e, a, b, c, f2(e, a, b), k2, w5 = left(w5 ^ w2 ^ w13 ^ w7));
+    Round(c, d, e, a, b, f2(d, e, a), k2, w6 = left(w6 ^ w3 ^ w14 ^ w8));
+    Round(b, c, d, e, a, f2(c, d, e), k2, w7 = left(w7 ^ w4 ^ w15 ^ w9));
+    Round(a, b, c, d, e, f3(b, c, d), k3, w8 = left(w8 ^ w5 ^ w0 ^ w10));
+    Round(e, a, b, c, d, f3(a, b, c), k3, w9 = left(w9 ^ w6 ^ w1 ^ w11));
+    Round(d, e, a, b, c, f3(e, a, b), k3, w10 = left(w10 ^ w7 ^ w2 ^ w12));
+    Round(c, d, e, a, b, f3(d, e, a), k3, w11 = left(w11 ^ w8 ^ w3 ^ w13));
+    Round(b, c, d, e, a, f3(c, d, e), k3, w12 = left(w12 ^ w9 ^ w4 ^ w14));
+    Round(a, b, c, d, e, f3(b, c, d), k3, w13 = left(w13 ^ w10 ^ w5 ^ w15));
+    Round(e, a, b, c, d, f3(a, b, c), k3, w14 = left(w14 ^ w11 ^ w6 ^ w0));
+    Round(d, e, a, b, c, f3(e, a, b), k3, w15 = left(w15 ^ w12 ^ w7 ^ w1));
+
+    Round(c, d, e, a, b, f3(d, e, a), k3, w0 = left(w0 ^ w13 ^ w8 ^ w2));
+    Round(b, c, d, e, a, f3(c, d, e), k3, w1 = left(w1 ^ w14 ^ w9 ^ w3));
+    Round(a, b, c, d, e, f3(b, c, d), k3, w2 = left(w2 ^ w15 ^ w10 ^ w4));
+    Round(e, a, b, c, d, f3(a, b, c), k3, w3 = left(w3 ^ w0 ^ w11 ^ w5));
+    Round(d, e, a, b, c, f3(e, a, b), k3, w4 = left(w4 ^ w1 ^ w12 ^ w6));
+    Round(c, d, e, a, b, f3(d, e, a), k3, w5 = left(w5 ^ w2 ^ w13 ^ w7));
+    Round(b, c, d, e, a, f3(c, d, e), k3, w6 = left(w6 ^ w3 ^ w14 ^ w8));
+    Round(a, b, c, d, e, f3(b, c, d), k3, w7 = left(w7 ^ w4 ^ w15 ^ w9));
+    Round(e, a, b, c, d, f3(a, b, c), k3, w8 = left(w8 ^ w5 ^ w0 ^ w10));
+    Round(d, e, a, b, c, f3(e, a, b), k3, w9 = left(w9 ^ w6 ^ w1 ^ w11));
+    Round(c, d, e, a, b, f3(d, e, a), k3, w10 = left(w10 ^ w7 ^ w2 ^ w12));
+    Round(b, c, d, e, a, f3(c, d, e), k3, w11 = left(w11 ^ w8 ^ w3 ^ w13));
+    Round(a, b, c, d, e, f2(b, c, d), k4, w12 = left(w12 ^ w9 ^ w4 ^ w14));
+    Round(e, a, b, c, d, f2(a, b, c), k4, w13 = left(w13 ^ w10 ^ w5 ^ w15));
+    Round(d, e, a, b, c, f2(e, a, b), k4, w14 = left(w14 ^ w11 ^ w6 ^ w0));
+    Round(c, d, e, a, b, f2(d, e, a), k4, w15 = left(w15 ^ w12 ^ w7 ^ w1));
+
+    Round(b, c, d, e, a, f2(c, d, e), k4, w0 = left(w0 ^ w13 ^ w8 ^ w2));
+    Round(a, b, c, d, e, f2(b, c, d), k4, w1 = left(w1 ^ w14 ^ w9 ^ w3));
+    Round(e, a, b, c, d, f2(a, b, c), k4, w2 = left(w2 ^ w15 ^ w10 ^ w4));
+    Round(d, e, a, b, c, f2(e, a, b), k4, w3 = left(w3 ^ w0 ^ w11 ^ w5));
+    Round(c, d, e, a, b, f2(d, e, a), k4, w4 = left(w4 ^ w1 ^ w12 ^ w6));
+    Round(b, c, d, e, a, f2(c, d, e), k4, w5 = left(w5 ^ w2 ^ w13 ^ w7));
+    Round(a, b, c, d, e, f2(b, c, d), k4, w6 = left(w6 ^ w3 ^ w14 ^ w8));
+    Round(e, a, b, c, d, f2(a, b, c), k4, w7 = left(w7 ^ w4 ^ w15 ^ w9));
+    Round(d, e, a, b, c, f2(e, a, b), k4, w8 = left(w8 ^ w5 ^ w0 ^ w10));
+    Round(c, d, e, a, b, f2(d, e, a), k4, w9 = left(w9 ^ w6 ^ w1 ^ w11));
+    Round(b, c, d, e, a, f2(c, d, e), k4, w10 = left(w10 ^ w7 ^ w2 ^ w12));
+    Round(a, b, c, d, e, f2(b, c, d), k4, w11 = left(w11 ^ w8 ^ w3 ^ w13));
+    Round(e, a, b, c, d, f2(a, b, c), k4, w12 = left(w12 ^ w9 ^ w4 ^ w14));
+    Round(d, e, a, b, c, f2(e, a, b), k4, left(w13 ^ w10 ^ w5 ^ w15));
+    Round(c, d, e, a, b, f2(d, e, a), k4, left(w14 ^ w11 ^ w6 ^ w0));
+    Round(b, c, d, e, a, f2(c, d, e), k4, left(w15 ^ w12 ^ w7 ^ w1));
+
+    s[0] += a;
+    s[1] += b;
+    s[2] += c;
+    s[3] += d;
+    s[4] += e;
+}
+
+} // namespace sha1
+
+} // namespace
+
+////// SHA1
+
+CSHA1::CSHA1() : bytes(0)
+{
+    sha1::Initialize(s);
+}
+
+CSHA1& CSHA1::Write(const unsigned char* data, size_t len)
+{
+    const unsigned char* end = data + len;
+    size_t bufsize = bytes % 64;
+    if (bufsize && bufsize + len >= 64) {
+        // Fill the buffer, and process it.
+        memcpy(buf + bufsize, data, 64 - bufsize);
+        bytes += 64 - bufsize;
+        data += 64 - bufsize;
+        sha1::Transform(s, buf);
+        bufsize = 0;
+    }
+    while (end >= data + 64) {
+        // Process full chunks directly from the source.
+        sha1::Transform(s, data);
+        bytes += 64;
+        data += 64;
+    }
+    if (end > data) {
+        // Fill the buffer with what remains.
+        memcpy(buf + bufsize, data, end - data);
+        bytes += end - data;
+    }
+    return *this;
+}
+
+void CSHA1::Finalize(unsigned char hash[OUTPUT_SIZE])
+{
+    static const unsigned char pad[64] = {0x80};
+    unsigned char sizedesc[8];
+    WriteBE64(sizedesc, bytes << 3);
+    Write(pad, 1 + ((119 - (bytes % 64)) % 64));
+    Write(sizedesc, 8);
+    WriteBE32(hash, s[0]);
+    WriteBE32(hash + 4, s[1]);
+    WriteBE32(hash + 8, s[2]);
+    WriteBE32(hash + 12, s[3]);
+    WriteBE32(hash + 16, s[4]);
+}
+
+CSHA1& CSHA1::Reset()
+{
+    bytes = 0;
+    sha1::Initialize(s);
+    return *this;
+}
diff --git a/depend/zcash/src/crypto/sha1.h b/depend/zcash/src/crypto/sha1.h
new file mode 100644
index 000000000..553f4928a
--- /dev/null
+++ b/depend/zcash/src/crypto/sha1.h
@@ -0,0 +1,28 @@
+// Copyright (c) 2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_CRYPTO_SHA1_H
+#define BITCOIN_CRYPTO_SHA1_H
+
+#include <stdint.h>
+#include <stdlib.h>
+
+/** A hasher class for SHA1. */
+class CSHA1
+{
+private:
+    uint32_t s[5];
+    unsigned char buf[64];
+    size_t bytes;
+
+public:
+    static const size_t OUTPUT_SIZE = 20;
+
+    CSHA1();
+    CSHA1& Write(const unsigned char* data, size_t len);
+    void Finalize(unsigned char hash[OUTPUT_SIZE]);
+    CSHA1& Reset();
+};
+
+#endif // BITCOIN_CRYPTO_SHA1_H
diff --git a/depend/zcash/src/crypto/sha256.cpp b/depend/zcash/src/crypto/sha256.cpp
new file mode 100644
index 000000000..ff1ae2f05
--- /dev/null
+++ b/depend/zcash/src/crypto/sha256.cpp
@@ -0,0 +1,199 @@
+// Copyright (c) 2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "crypto/sha256.h"
+
+#include "crypto/common.h"
+
+#include <string.h>
+#include <stdexcept>
+
+// Internal implementation code.
+namespace
+{
+/// Internal SHA-256 implementation.
+namespace sha256
+{
+uint32_t inline Ch(uint32_t x, uint32_t y, uint32_t z) { return z ^ (x & (y ^ z)); }
+uint32_t inline Maj(uint32_t x, uint32_t y, uint32_t z) { return (x & y) | (z & (x | y)); }
+uint32_t inline Sigma0(uint32_t x) { return (x >> 2 | x << 30) ^ (x >> 13 | x << 19) ^ (x >> 22 | x << 10); }
+uint32_t inline Sigma1(uint32_t x) { return (x >> 6 | x << 26) ^ (x >> 11 | x << 21) ^ (x >> 25 | x << 7); }
+uint32_t inline sigma0(uint32_t x) { return (x >> 7 | x << 25) ^ (x >> 18 | x << 14) ^ (x >> 3); }
+uint32_t inline sigma1(uint32_t x) { return (x >> 17 | x << 15) ^ (x >> 19 | x << 13) ^ (x >> 10); }
+
+/** One round of SHA-256. */
+void inline Round(uint32_t a, uint32_t b, uint32_t c, uint32_t& d, uint32_t e, uint32_t f, uint32_t g, uint32_t& h, uint32_t k, uint32_t w)
+{
+    uint32_t t1 = h + Sigma1(e) + Ch(e, f, g) + k + w;
+    uint32_t t2 = Sigma0(a) + Maj(a, b, c);
+    d += t1;
+    h = t1 + t2;
+}
+
+/** Initialize SHA-256 state. */
+void inline Initialize(uint32_t* s)
+{
+    s[0] = 0x6a09e667ul;
+    s[1] = 0xbb67ae85ul;
+    s[2] = 0x3c6ef372ul;
+    s[3] = 0xa54ff53aul;
+    s[4] = 0x510e527ful;
+    s[5] = 0x9b05688cul;
+    s[6] = 0x1f83d9abul;
+    s[7] = 0x5be0cd19ul;
+}
+
+/** Perform one SHA-256 transformation, processing a 64-byte chunk. */
+void Transform(uint32_t* s, const unsigned char* chunk)
+{
+    uint32_t a = s[0], b = s[1], c = s[2], d = s[3], e = s[4], f = s[5], g = s[6], h = s[7];
+    uint32_t w0, w1, w2, w3, w4, w5, w6, w7, w8, w9, w10, w11, w12, w13, w14, w15;
+
+    Round(a, b, c, d, e, f, g, h, 0x428a2f98, w0 = ReadBE32(chunk + 0));
+    Round(h, a, b, c, d, e, f, g, 0x71374491, w1 = ReadBE32(chunk + 4));
+    Round(g, h, a, b, c, d, e, f, 0xb5c0fbcf, w2 = ReadBE32(chunk + 8));
+    Round(f, g, h, a, b, c, d, e, 0xe9b5dba5, w3 = ReadBE32(chunk + 12));
+    Round(e, f, g, h, a, b, c, d, 0x3956c25b, w4 = ReadBE32(chunk + 16));
+    Round(d, e, f, g, h, a, b, c, 0x59f111f1, w5 = ReadBE32(chunk + 20));
+    Round(c, d, e, f, g, h, a, b, 0x923f82a4, w6 = ReadBE32(chunk + 24));
+    Round(b, c, d, e, f, g, h, a, 0xab1c5ed5, w7 = ReadBE32(chunk + 28));
+    Round(a, b, c, d, e, f, g, h, 0xd807aa98, w8 = ReadBE32(chunk + 32));
+    Round(h, a, b, c, d, e, f, g, 0x12835b01, w9 = ReadBE32(chunk + 36));
+    Round(g, h, a, b, c, d, e, f, 0x243185be, w10 = ReadBE32(chunk + 40));
+    Round(f, g, h, a, b, c, d, e, 0x550c7dc3, w11 = ReadBE32(chunk + 44));
+    Round(e, f, g, h, a, b, c, d, 0x72be5d74, w12 = ReadBE32(chunk + 48));
+    Round(d, e, f, g, h, a, b, c, 0x80deb1fe, w13 = ReadBE32(chunk + 52));
+    Round(c, d, e, f, g, h, a, b, 0x9bdc06a7, w14 = ReadBE32(chunk + 56));
+    Round(b, c, d, e, f, g, h, a, 0xc19bf174, w15 = ReadBE32(chunk + 60));
+
+    Round(a, b, c, d, e, f, g, h, 0xe49b69c1, w0 += sigma1(w14) + w9 + sigma0(w1));
+    Round(h, a, b, c, d, e, f, g, 0xefbe4786, w1 += sigma1(w15) + w10 + sigma0(w2));
+    Round(g, h, a, b, c, d, e, f, 0x0fc19dc6, w2 += sigma1(w0) + w11 + sigma0(w3));
+    Round(f, g, h, a, b, c, d, e, 0x240ca1cc, w3 += sigma1(w1) + w12 + sigma0(w4));
+    Round(e, f, g, h, a, b, c, d, 0x2de92c6f, w4 += sigma1(w2) + w13 + sigma0(w5));
+    Round(d, e, f, g, h, a, b, c, 0x4a7484aa, w5 += sigma1(w3) + w14 + sigma0(w6));
+    Round(c, d, e, f, g, h, a, b, 0x5cb0a9dc, w6 += sigma1(w4) + w15 + sigma0(w7));
+    Round(b, c, d, e, f, g, h, a, 0x76f988da, w7 += sigma1(w5) + w0 + sigma0(w8));
+    Round(a, b, c, d, e, f, g, h, 0x983e5152, w8 += sigma1(w6) + w1 + sigma0(w9));
+    Round(h, a, b, c, d, e, f, g, 0xa831c66d, w9 += sigma1(w7) + w2 + sigma0(w10));
+    Round(g, h, a, b, c, d, e, f, 0xb00327c8, w10 += sigma1(w8) + w3 + sigma0(w11));
+    Round(f, g, h, a, b, c, d, e, 0xbf597fc7, w11 += sigma1(w9) + w4 + sigma0(w12));
+    Round(e, f, g, h, a, b, c, d, 0xc6e00bf3, w12 += sigma1(w10) + w5 + sigma0(w13));
+    Round(d, e, f, g, h, a, b, c, 0xd5a79147, w13 += sigma1(w11) + w6 + sigma0(w14));
+    Round(c, d, e, f, g, h, a, b, 0x06ca6351, w14 += sigma1(w12) + w7 + sigma0(w15));
+    Round(b, c, d, e, f, g, h, a, 0x14292967, w15 += sigma1(w13) + w8 + sigma0(w0));
+
+    Round(a, b, c, d, e, f, g, h, 0x27b70a85, w0 += sigma1(w14) + w9 + sigma0(w1));
+    Round(h, a, b, c, d, e, f, g, 0x2e1b2138, w1 += sigma1(w15) + w10 + sigma0(w2));
+    Round(g, h, a, b, c, d, e, f, 0x4d2c6dfc, w2 += sigma1(w0) + w11 + sigma0(w3));
+    Round(f, g, h, a, b, c, d, e, 0x53380d13, w3 += sigma1(w1) + w12 + sigma0(w4));
+    Round(e, f, g, h, a, b, c, d, 0x650a7354, w4 += sigma1(w2) + w13 + sigma0(w5));
+    Round(d, e, f, g, h, a, b, c, 0x766a0abb, w5 += sigma1(w3) + w14 + sigma0(w6));
+    Round(c, d, e, f, g, h, a, b, 0x81c2c92e, w6 += sigma1(w4) + w15 + sigma0(w7));
+    Round(b, c, d, e, f, g, h, a, 0x92722c85, w7 += sigma1(w5) + w0 + sigma0(w8));
+    Round(a, b, c, d, e, f, g, h, 0xa2bfe8a1, w8 += sigma1(w6) + w1 + sigma0(w9));
+    Round(h, a, b, c, d, e, f, g, 0xa81a664b, w9 += sigma1(w7) + w2 + sigma0(w10));
+    Round(g, h, a, b, c, d, e, f, 0xc24b8b70, w10 += sigma1(w8) + w3 + sigma0(w11));
+    Round(f, g, h, a, b, c, d, e, 0xc76c51a3, w11 += sigma1(w9) + w4 + sigma0(w12));
+    Round(e, f, g, h, a, b, c, d, 0xd192e819, w12 += sigma1(w10) + w5 + sigma0(w13));
+    Round(d, e, f, g, h, a, b, c, 0xd6990624, w13 += sigma1(w11) + w6 + sigma0(w14));
+    Round(c, d, e, f, g, h, a, b, 0xf40e3585, w14 += sigma1(w12) + w7 + sigma0(w15));
+    Round(b, c, d, e, f, g, h, a, 0x106aa070, w15 += sigma1(w13) + w8 + sigma0(w0));
+
+    Round(a, b, c, d, e, f, g, h, 0x19a4c116, w0 += sigma1(w14) + w9 + sigma0(w1));
+    Round(h, a, b, c, d, e, f, g, 0x1e376c08, w1 += sigma1(w15) + w10 + sigma0(w2));
+    Round(g, h, a, b, c, d, e, f, 0x2748774c, w2 += sigma1(w0) + w11 + sigma0(w3));
+    Round(f, g, h, a, b, c, d, e, 0x34b0bcb5, w3 += sigma1(w1) + w12 + sigma0(w4));
+    Round(e, f, g, h, a, b, c, d, 0x391c0cb3, w4 += sigma1(w2) + w13 + sigma0(w5));
+    Round(d, e, f, g, h, a, b, c, 0x4ed8aa4a, w5 += sigma1(w3) + w14 + sigma0(w6));
+    Round(c, d, e, f, g, h, a, b, 0x5b9cca4f, w6 += sigma1(w4) + w15 + sigma0(w7));
+    Round(b, c, d, e, f, g, h, a, 0x682e6ff3, w7 += sigma1(w5) + w0 + sigma0(w8));
+    Round(a, b, c, d, e, f, g, h, 0x748f82ee, w8 += sigma1(w6) + w1 + sigma0(w9));
+    Round(h, a, b, c, d, e, f, g, 0x78a5636f, w9 += sigma1(w7) + w2 + sigma0(w10));
+    Round(g, h, a, b, c, d, e, f, 0x84c87814, w10 += sigma1(w8) + w3 + sigma0(w11));
+    Round(f, g, h, a, b, c, d, e, 0x8cc70208, w11 += sigma1(w9) + w4 + sigma0(w12));
+    Round(e, f, g, h, a, b, c, d, 0x90befffa, w12 += sigma1(w10) + w5 + sigma0(w13));
+    Round(d, e, f, g, h, a, b, c, 0xa4506ceb, w13 += sigma1(w11) + w6 + sigma0(w14));
+    Round(c, d, e, f, g, h, a, b, 0xbef9a3f7, w14 + sigma1(w12) + w7 + sigma0(w15));
+    Round(b, c, d, e, f, g, h, a, 0xc67178f2, w15 + sigma1(w13) + w8 + sigma0(w0));
+
+    s[0] += a;
+    s[1] += b;
+    s[2] += c;
+    s[3] += d;
+    s[4] += e;
+    s[5] += f;
+    s[6] += g;
+    s[7] += h;
+}
+
+} // namespace sha256
+} // namespace
+
+
+////// SHA-256
+
+CSHA256::CSHA256() : bytes(0)
+{
+    sha256::Initialize(s);
+}
+
+CSHA256& CSHA256::Write(const unsigned char* data, size_t len)
+{
+    const unsigned char* end = data + len;
+    size_t bufsize = bytes % 64;
+    if (bufsize && bufsize + len >= 64) {
+        // Fill the buffer, and process it.
+        memcpy(buf + bufsize, data, 64 - bufsize);
+        bytes += 64 - bufsize;
+        data += 64 - bufsize;
+        sha256::Transform(s, buf);
+        bufsize = 0;
+    }
+    while (end >= data + 64) {
+        // Process full chunks directly from the source.
+        sha256::Transform(s, data);
+        bytes += 64;
+        data += 64;
+    }
+    if (end > data) {
+        // Fill the buffer with what remains.
+        memcpy(buf + bufsize, data, end - data);
+        bytes += end - data;
+    }
+    return *this;
+}
+
+void CSHA256::Finalize(unsigned char hash[OUTPUT_SIZE])
+{
+    static const unsigned char pad[64] = {0x80};
+    unsigned char sizedesc[8];
+    WriteBE64(sizedesc, bytes << 3);
+    Write(pad, 1 + ((119 - (bytes % 64)) % 64));
+    Write(sizedesc, 8);
+    FinalizeNoPadding(hash, false);
+}
+
+void CSHA256::FinalizeNoPadding(unsigned char hash[OUTPUT_SIZE], bool enforce_compression)
+{
+    if (enforce_compression && bytes != 64) {
+        throw std::length_error("SHA256Compress should be invoked with a 512-bit block");
+    }
+
+    WriteBE32(hash, s[0]);
+    WriteBE32(hash + 4, s[1]);
+    WriteBE32(hash + 8, s[2]);
+    WriteBE32(hash + 12, s[3]);
+    WriteBE32(hash + 16, s[4]);
+    WriteBE32(hash + 20, s[5]);
+    WriteBE32(hash + 24, s[6]);
+    WriteBE32(hash + 28, s[7]);
+}
+
+CSHA256& CSHA256::Reset()
+{
+    bytes = 0;
+    sha256::Initialize(s);
+    return *this;
+}
diff --git a/depend/zcash/src/crypto/sha256.h b/depend/zcash/src/crypto/sha256.h
new file mode 100644
index 000000000..3dff0dd2b
--- /dev/null
+++ b/depend/zcash/src/crypto/sha256.h
@@ -0,0 +1,32 @@
+// Copyright (c) 2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_CRYPTO_SHA256_H
+#define BITCOIN_CRYPTO_SHA256_H
+
+#include <stdint.h>
+#include <stdlib.h>
+
+/** A hasher class for SHA-256. */
+class CSHA256
+{
+public:
+    static const size_t OUTPUT_SIZE = 32;
+
+    CSHA256();
+    CSHA256& Write(const unsigned char* data, size_t len);
+    void Finalize(unsigned char hash[OUTPUT_SIZE]);
+    void FinalizeNoPadding(unsigned char hash[OUTPUT_SIZE]) {
+    	FinalizeNoPadding(hash, true);
+    };
+    CSHA256& Reset();
+
+private:
+    uint32_t s[8];
+    unsigned char buf[64];
+    size_t bytes;
+    void FinalizeNoPadding(unsigned char hash[OUTPUT_SIZE], bool enforce_compression);
+};
+
+#endif // BITCOIN_CRYPTO_SHA256_H
diff --git a/depend/zcash/src/crypto/sha512.cpp b/depend/zcash/src/crypto/sha512.cpp
new file mode 100644
index 000000000..8f02862fa
--- /dev/null
+++ b/depend/zcash/src/crypto/sha512.cpp
@@ -0,0 +1,207 @@
+// Copyright (c) 2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "crypto/sha512.h"
+
+#include "crypto/common.h"
+
+#include <string.h>
+
+// Internal implementation code.
+namespace
+{
+/// Internal SHA-512 implementation.
+namespace sha512
+{
+uint64_t inline Ch(uint64_t x, uint64_t y, uint64_t z) { return z ^ (x & (y ^ z)); }
+uint64_t inline Maj(uint64_t x, uint64_t y, uint64_t z) { return (x & y) | (z & (x | y)); }
+uint64_t inline Sigma0(uint64_t x) { return (x >> 28 | x << 36) ^ (x >> 34 | x << 30) ^ (x >> 39 | x << 25); }
+uint64_t inline Sigma1(uint64_t x) { return (x >> 14 | x << 50) ^ (x >> 18 | x << 46) ^ (x >> 41 | x << 23); }
+uint64_t inline sigma0(uint64_t x) { return (x >> 1 | x << 63) ^ (x >> 8 | x << 56) ^ (x >> 7); }
+uint64_t inline sigma1(uint64_t x) { return (x >> 19 | x << 45) ^ (x >> 61 | x << 3) ^ (x >> 6); }
+
+/** One round of SHA-512. */
+void inline Round(uint64_t a, uint64_t b, uint64_t c, uint64_t& d, uint64_t e, uint64_t f, uint64_t g, uint64_t& h, uint64_t k, uint64_t w)
+{
+    uint64_t t1 = h + Sigma1(e) + Ch(e, f, g) + k + w;
+    uint64_t t2 = Sigma0(a) + Maj(a, b, c);
+    d += t1;
+    h = t1 + t2;
+}
+
+/** Initialize SHA-256 state. */
+void inline Initialize(uint64_t* s)
+{
+    s[0] = 0x6a09e667f3bcc908ull;
+    s[1] = 0xbb67ae8584caa73bull;
+    s[2] = 0x3c6ef372fe94f82bull;
+    s[3] = 0xa54ff53a5f1d36f1ull;
+    s[4] = 0x510e527fade682d1ull;
+    s[5] = 0x9b05688c2b3e6c1full;
+    s[6] = 0x1f83d9abfb41bd6bull;
+    s[7] = 0x5be0cd19137e2179ull;
+}
+
+/** Perform one SHA-512 transformation, processing a 128-byte chunk. */
+void Transform(uint64_t* s, const unsigned char* chunk)
+{
+    uint64_t a = s[0], b = s[1], c = s[2], d = s[3], e = s[4], f = s[5], g = s[6], h = s[7];
+    uint64_t w0, w1, w2, w3, w4, w5, w6, w7, w8, w9, w10, w11, w12, w13, w14, w15;
+
+    Round(a, b, c, d, e, f, g, h, 0x428a2f98d728ae22ull, w0 = ReadBE64(chunk + 0));
+    Round(h, a, b, c, d, e, f, g, 0x7137449123ef65cdull, w1 = ReadBE64(chunk + 8));
+    Round(g, h, a, b, c, d, e, f, 0xb5c0fbcfec4d3b2full, w2 = ReadBE64(chunk + 16));
+    Round(f, g, h, a, b, c, d, e, 0xe9b5dba58189dbbcull, w3 = ReadBE64(chunk + 24));
+    Round(e, f, g, h, a, b, c, d, 0x3956c25bf348b538ull, w4 = ReadBE64(chunk + 32));
+    Round(d, e, f, g, h, a, b, c, 0x59f111f1b605d019ull, w5 = ReadBE64(chunk + 40));
+    Round(c, d, e, f, g, h, a, b, 0x923f82a4af194f9bull, w6 = ReadBE64(chunk + 48));
+    Round(b, c, d, e, f, g, h, a, 0xab1c5ed5da6d8118ull, w7 = ReadBE64(chunk + 56));
+    Round(a, b, c, d, e, f, g, h, 0xd807aa98a3030242ull, w8 = ReadBE64(chunk + 64));
+    Round(h, a, b, c, d, e, f, g, 0x12835b0145706fbeull, w9 = ReadBE64(chunk + 72));
+    Round(g, h, a, b, c, d, e, f, 0x243185be4ee4b28cull, w10 = ReadBE64(chunk + 80));
+    Round(f, g, h, a, b, c, d, e, 0x550c7dc3d5ffb4e2ull, w11 = ReadBE64(chunk + 88));
+    Round(e, f, g, h, a, b, c, d, 0x72be5d74f27b896full, w12 = ReadBE64(chunk + 96));
+    Round(d, e, f, g, h, a, b, c, 0x80deb1fe3b1696b1ull, w13 = ReadBE64(chunk + 104));
+    Round(c, d, e, f, g, h, a, b, 0x9bdc06a725c71235ull, w14 = ReadBE64(chunk + 112));
+    Round(b, c, d, e, f, g, h, a, 0xc19bf174cf692694ull, w15 = ReadBE64(chunk + 120));
+
+    Round(a, b, c, d, e, f, g, h, 0xe49b69c19ef14ad2ull, w0 += sigma1(w14) + w9 + sigma0(w1));
+    Round(h, a, b, c, d, e, f, g, 0xefbe4786384f25e3ull, w1 += sigma1(w15) + w10 + sigma0(w2));
+    Round(g, h, a, b, c, d, e, f, 0x0fc19dc68b8cd5b5ull, w2 += sigma1(w0) + w11 + sigma0(w3));
+    Round(f, g, h, a, b, c, d, e, 0x240ca1cc77ac9c65ull, w3 += sigma1(w1) + w12 + sigma0(w4));
+    Round(e, f, g, h, a, b, c, d, 0x2de92c6f592b0275ull, w4 += sigma1(w2) + w13 + sigma0(w5));
+    Round(d, e, f, g, h, a, b, c, 0x4a7484aa6ea6e483ull, w5 += sigma1(w3) + w14 + sigma0(w6));
+    Round(c, d, e, f, g, h, a, b, 0x5cb0a9dcbd41fbd4ull, w6 += sigma1(w4) + w15 + sigma0(w7));
+    Round(b, c, d, e, f, g, h, a, 0x76f988da831153b5ull, w7 += sigma1(w5) + w0 + sigma0(w8));
+    Round(a, b, c, d, e, f, g, h, 0x983e5152ee66dfabull, w8 += sigma1(w6) + w1 + sigma0(w9));
+    Round(h, a, b, c, d, e, f, g, 0xa831c66d2db43210ull, w9 += sigma1(w7) + w2 + sigma0(w10));
+    Round(g, h, a, b, c, d, e, f, 0xb00327c898fb213full, w10 += sigma1(w8) + w3 + sigma0(w11));
+    Round(f, g, h, a, b, c, d, e, 0xbf597fc7beef0ee4ull, w11 += sigma1(w9) + w4 + sigma0(w12));
+    Round(e, f, g, h, a, b, c, d, 0xc6e00bf33da88fc2ull, w12 += sigma1(w10) + w5 + sigma0(w13));
+    Round(d, e, f, g, h, a, b, c, 0xd5a79147930aa725ull, w13 += sigma1(w11) + w6 + sigma0(w14));
+    Round(c, d, e, f, g, h, a, b, 0x06ca6351e003826full, w14 += sigma1(w12) + w7 + sigma0(w15));
+    Round(b, c, d, e, f, g, h, a, 0x142929670a0e6e70ull, w15 += sigma1(w13) + w8 + sigma0(w0));
+
+    Round(a, b, c, d, e, f, g, h, 0x27b70a8546d22ffcull, w0 += sigma1(w14) + w9 + sigma0(w1));
+    Round(h, a, b, c, d, e, f, g, 0x2e1b21385c26c926ull, w1 += sigma1(w15) + w10 + sigma0(w2));
+    Round(g, h, a, b, c, d, e, f, 0x4d2c6dfc5ac42aedull, w2 += sigma1(w0) + w11 + sigma0(w3));
+    Round(f, g, h, a, b, c, d, e, 0x53380d139d95b3dfull, w3 += sigma1(w1) + w12 + sigma0(w4));
+    Round(e, f, g, h, a, b, c, d, 0x650a73548baf63deull, w4 += sigma1(w2) + w13 + sigma0(w5));
+    Round(d, e, f, g, h, a, b, c, 0x766a0abb3c77b2a8ull, w5 += sigma1(w3) + w14 + sigma0(w6));
+    Round(c, d, e, f, g, h, a, b, 0x81c2c92e47edaee6ull, w6 += sigma1(w4) + w15 + sigma0(w7));
+    Round(b, c, d, e, f, g, h, a, 0x92722c851482353bull, w7 += sigma1(w5) + w0 + sigma0(w8));
+    Round(a, b, c, d, e, f, g, h, 0xa2bfe8a14cf10364ull, w8 += sigma1(w6) + w1 + sigma0(w9));
+    Round(h, a, b, c, d, e, f, g, 0xa81a664bbc423001ull, w9 += sigma1(w7) + w2 + sigma0(w10));
+    Round(g, h, a, b, c, d, e, f, 0xc24b8b70d0f89791ull, w10 += sigma1(w8) + w3 + sigma0(w11));
+    Round(f, g, h, a, b, c, d, e, 0xc76c51a30654be30ull, w11 += sigma1(w9) + w4 + sigma0(w12));
+    Round(e, f, g, h, a, b, c, d, 0xd192e819d6ef5218ull, w12 += sigma1(w10) + w5 + sigma0(w13));
+    Round(d, e, f, g, h, a, b, c, 0xd69906245565a910ull, w13 += sigma1(w11) + w6 + sigma0(w14));
+    Round(c, d, e, f, g, h, a, b, 0xf40e35855771202aull, w14 += sigma1(w12) + w7 + sigma0(w15));
+    Round(b, c, d, e, f, g, h, a, 0x106aa07032bbd1b8ull, w15 += sigma1(w13) + w8 + sigma0(w0));
+
+    Round(a, b, c, d, e, f, g, h, 0x19a4c116b8d2d0c8ull, w0 += sigma1(w14) + w9 + sigma0(w1));
+    Round(h, a, b, c, d, e, f, g, 0x1e376c085141ab53ull, w1 += sigma1(w15) + w10 + sigma0(w2));
+    Round(g, h, a, b, c, d, e, f, 0x2748774cdf8eeb99ull, w2 += sigma1(w0) + w11 + sigma0(w3));
+    Round(f, g, h, a, b, c, d, e, 0x34b0bcb5e19b48a8ull, w3 += sigma1(w1) + w12 + sigma0(w4));
+    Round(e, f, g, h, a, b, c, d, 0x391c0cb3c5c95a63ull, w4 += sigma1(w2) + w13 + sigma0(w5));
+    Round(d, e, f, g, h, a, b, c, 0x4ed8aa4ae3418acbull, w5 += sigma1(w3) + w14 + sigma0(w6));
+    Round(c, d, e, f, g, h, a, b, 0x5b9cca4f7763e373ull, w6 += sigma1(w4) + w15 + sigma0(w7));
+    Round(b, c, d, e, f, g, h, a, 0x682e6ff3d6b2b8a3ull, w7 += sigma1(w5) + w0 + sigma0(w8));
+    Round(a, b, c, d, e, f, g, h, 0x748f82ee5defb2fcull, w8 += sigma1(w6) + w1 + sigma0(w9));
+    Round(h, a, b, c, d, e, f, g, 0x78a5636f43172f60ull, w9 += sigma1(w7) + w2 + sigma0(w10));
+    Round(g, h, a, b, c, d, e, f, 0x84c87814a1f0ab72ull, w10 += sigma1(w8) + w3 + sigma0(w11));
+    Round(f, g, h, a, b, c, d, e, 0x8cc702081a6439ecull, w11 += sigma1(w9) + w4 + sigma0(w12));
+    Round(e, f, g, h, a, b, c, d, 0x90befffa23631e28ull, w12 += sigma1(w10) + w5 + sigma0(w13));
+    Round(d, e, f, g, h, a, b, c, 0xa4506cebde82bde9ull, w13 += sigma1(w11) + w6 + sigma0(w14));
+    Round(c, d, e, f, g, h, a, b, 0xbef9a3f7b2c67915ull, w14 += sigma1(w12) + w7 + sigma0(w15));
+    Round(b, c, d, e, f, g, h, a, 0xc67178f2e372532bull, w15 += sigma1(w13) + w8 + sigma0(w0));
+
+    Round(a, b, c, d, e, f, g, h, 0xca273eceea26619cull, w0 += sigma1(w14) + w9 + sigma0(w1));
+    Round(h, a, b, c, d, e, f, g, 0xd186b8c721c0c207ull, w1 += sigma1(w15) + w10 + sigma0(w2));
+    Round(g, h, a, b, c, d, e, f, 0xeada7dd6cde0eb1eull, w2 += sigma1(w0) + w11 + sigma0(w3));
+    Round(f, g, h, a, b, c, d, e, 0xf57d4f7fee6ed178ull, w3 += sigma1(w1) + w12 + sigma0(w4));
+    Round(e, f, g, h, a, b, c, d, 0x06f067aa72176fbaull, w4 += sigma1(w2) + w13 + sigma0(w5));
+    Round(d, e, f, g, h, a, b, c, 0x0a637dc5a2c898a6ull, w5 += sigma1(w3) + w14 + sigma0(w6));
+    Round(c, d, e, f, g, h, a, b, 0x113f9804bef90daeull, w6 += sigma1(w4) + w15 + sigma0(w7));
+    Round(b, c, d, e, f, g, h, a, 0x1b710b35131c471bull, w7 += sigma1(w5) + w0 + sigma0(w8));
+    Round(a, b, c, d, e, f, g, h, 0x28db77f523047d84ull, w8 += sigma1(w6) + w1 + sigma0(w9));
+    Round(h, a, b, c, d, e, f, g, 0x32caab7b40c72493ull, w9 += sigma1(w7) + w2 + sigma0(w10));
+    Round(g, h, a, b, c, d, e, f, 0x3c9ebe0a15c9bebcull, w10 += sigma1(w8) + w3 + sigma0(w11));
+    Round(f, g, h, a, b, c, d, e, 0x431d67c49c100d4cull, w11 += sigma1(w9) + w4 + sigma0(w12));
+    Round(e, f, g, h, a, b, c, d, 0x4cc5d4becb3e42b6ull, w12 += sigma1(w10) + w5 + sigma0(w13));
+    Round(d, e, f, g, h, a, b, c, 0x597f299cfc657e2aull, w13 += sigma1(w11) + w6 + sigma0(w14));
+    Round(c, d, e, f, g, h, a, b, 0x5fcb6fab3ad6faecull, w14 + sigma1(w12) + w7 + sigma0(w15));
+    Round(b, c, d, e, f, g, h, a, 0x6c44198c4a475817ull, w15 + sigma1(w13) + w8 + sigma0(w0));
+
+    s[0] += a;
+    s[1] += b;
+    s[2] += c;
+    s[3] += d;
+    s[4] += e;
+    s[5] += f;
+    s[6] += g;
+    s[7] += h;
+}
+
+} // namespace sha512
+
+} // namespace
+
+
+////// SHA-512
+
+CSHA512::CSHA512() : bytes(0)
+{
+    sha512::Initialize(s);
+}
+
+CSHA512& CSHA512::Write(const unsigned char* data, size_t len)
+{
+    const unsigned char* end = data + len;
+    size_t bufsize = bytes % 128;
+    if (bufsize && bufsize + len >= 128) {
+        // Fill the buffer, and process it.
+        memcpy(buf + bufsize, data, 128 - bufsize);
+        bytes += 128 - bufsize;
+        data += 128 - bufsize;
+        sha512::Transform(s, buf);
+        bufsize = 0;
+    }
+    while (end >= data + 128) {
+        // Process full chunks directly from the source.
+        sha512::Transform(s, data);
+        data += 128;
+        bytes += 128;
+    }
+    if (end > data) {
+        // Fill the buffer with what remains.
+        memcpy(buf + bufsize, data, end - data);
+        bytes += end - data;
+    }
+    return *this;
+}
+
+void CSHA512::Finalize(unsigned char hash[OUTPUT_SIZE])
+{
+    static const unsigned char pad[128] = {0x80};
+    unsigned char sizedesc[16] = {0x00};
+    WriteBE64(sizedesc + 8, bytes << 3);
+    Write(pad, 1 + ((239 - (bytes % 128)) % 128));
+    Write(sizedesc, 16);
+    WriteBE64(hash, s[0]);
+    WriteBE64(hash + 8, s[1]);
+    WriteBE64(hash + 16, s[2]);
+    WriteBE64(hash + 24, s[3]);
+    WriteBE64(hash + 32, s[4]);
+    WriteBE64(hash + 40, s[5]);
+    WriteBE64(hash + 48, s[6]);
+    WriteBE64(hash + 56, s[7]);
+}
+
+CSHA512& CSHA512::Reset()
+{
+    bytes = 0;
+    sha512::Initialize(s);
+    return *this;
+}
diff --git a/depend/zcash/src/crypto/sha512.h b/depend/zcash/src/crypto/sha512.h
new file mode 100644
index 000000000..194cc61f9
--- /dev/null
+++ b/depend/zcash/src/crypto/sha512.h
@@ -0,0 +1,28 @@
+// Copyright (c) 2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_CRYPTO_SHA512_H
+#define BITCOIN_CRYPTO_SHA512_H
+
+#include <stdint.h>
+#include <stdlib.h>
+
+/** A hasher class for SHA-512. */
+class CSHA512
+{
+private:
+    uint64_t s[8];
+    unsigned char buf[128];
+    size_t bytes;
+
+public:
+    static const size_t OUTPUT_SIZE = 64;
+
+    CSHA512();
+    CSHA512& Write(const unsigned char* data, size_t len);
+    void Finalize(unsigned char hash[OUTPUT_SIZE]);
+    CSHA512& Reset();
+};
+
+#endif // BITCOIN_CRYPTO_SHA512_H
diff --git a/depend/zcash/src/dbwrapper.cpp b/depend/zcash/src/dbwrapper.cpp
new file mode 100644
index 000000000..d36afb477
--- /dev/null
+++ b/depend/zcash/src/dbwrapper.cpp
@@ -0,0 +1,107 @@
+// Copyright (c) 2012-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "dbwrapper.h"
+
+#include "fs.h"
+#include "util.h"
+
+#include <leveldb/cache.h>
+#include <leveldb/env.h>
+#include <leveldb/filter_policy.h>
+#include <memenv.h>
+#include <stdint.h>
+
+#include <boost/scoped_ptr.hpp>
+
+static leveldb::Options GetOptions(size_t nCacheSize)
+{
+    leveldb::Options options;
+    options.block_cache = leveldb::NewLRUCache(nCacheSize / 2);
+    options.write_buffer_size = nCacheSize / 4; // up to two write buffers may be held in memory simultaneously
+    options.filter_policy = leveldb::NewBloomFilterPolicy(10);
+    options.compression = leveldb::kNoCompression;
+    options.max_open_files = 64;
+    if (leveldb::kMajorVersion > 1 || (leveldb::kMajorVersion == 1 && leveldb::kMinorVersion >= 16)) {
+        // LevelDB versions before 1.16 consider short writes to be corruption. Only trigger error
+        // on corruption in later versions.
+        options.paranoid_checks = true;
+    }
+    return options;
+}
+
+CDBWrapper::CDBWrapper(const fs::path& path, size_t nCacheSize, bool fMemory, bool fWipe)
+{
+    penv = NULL;
+    readoptions.verify_checksums = true;
+    iteroptions.verify_checksums = true;
+    iteroptions.fill_cache = false;
+    syncoptions.sync = true;
+    options = GetOptions(nCacheSize);
+    options.create_if_missing = true;
+    if (fMemory) {
+        penv = leveldb::NewMemEnv(leveldb::Env::Default());
+        options.env = penv;
+    } else {
+        if (fWipe) {
+            LogPrintf("Wiping LevelDB in %s\n", path.string());
+            leveldb::Status result = leveldb::DestroyDB(path.string(), options);
+            dbwrapper_private::HandleError(result);
+        }
+        TryCreateDirectory(path);
+        LogPrintf("Opening LevelDB in %s\n", path.string());
+    }
+    leveldb::Status status = leveldb::DB::Open(options, path.string(), &pdb);
+    dbwrapper_private::HandleError(status);
+    LogPrintf("Opened LevelDB successfully\n");
+}
+
+CDBWrapper::~CDBWrapper()
+{
+    delete pdb;
+    pdb = NULL;
+    delete options.filter_policy;
+    options.filter_policy = NULL;
+    delete options.block_cache;
+    options.block_cache = NULL;
+    delete penv;
+    options.env = NULL;
+}
+
+bool CDBWrapper::WriteBatch(CDBBatch& batch, bool fSync)
+{
+    leveldb::Status status = pdb->Write(fSync ? syncoptions : writeoptions, &batch.batch);
+    dbwrapper_private::HandleError(status);
+    return true;
+}
+
+bool CDBWrapper::IsEmpty()
+{
+    boost::scoped_ptr<CDBIterator> it(NewIterator());
+    it->SeekToFirst();
+    return !(it->Valid());
+}
+
+CDBIterator::~CDBIterator() { delete piter; }
+bool CDBIterator::Valid() { return piter->Valid(); }
+void CDBIterator::SeekToFirst() { piter->SeekToFirst(); }
+void CDBIterator::Next() { piter->Next(); }
+
+namespace dbwrapper_private {
+
+void HandleError(const leveldb::Status& status)
+{
+    if (status.ok())
+        return;
+    LogPrintf("%s\n", status.ToString());
+    if (status.IsCorruption())
+        throw dbwrapper_error("Database corrupted");
+    if (status.IsIOError())
+        throw dbwrapper_error("Database I/O error");
+    if (status.IsNotFound())
+        throw dbwrapper_error("Database entry missing");
+    throw dbwrapper_error("Unknown database error");
+}
+
+};
diff --git a/depend/zcash/src/dbwrapper.h b/depend/zcash/src/dbwrapper.h
new file mode 100644
index 000000000..5862f7f0a
--- /dev/null
+++ b/depend/zcash/src/dbwrapper.h
@@ -0,0 +1,264 @@
+// Copyright (c) 2012-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_DBWRAPPER_H
+#define BITCOIN_DBWRAPPER_H
+
+#include "clientversion.h"
+#include "fs.h"
+#include "serialize.h"
+#include "streams.h"
+#include "util.h"
+#include "version.h"
+
+#include <leveldb/db.h>
+#include <leveldb/write_batch.h>
+
+static const size_t DBWRAPPER_PREALLOC_KEY_SIZE = 64;
+static const size_t DBWRAPPER_PREALLOC_VALUE_SIZE = 1024;
+
+class dbwrapper_error : public std::runtime_error
+{
+public:
+    dbwrapper_error(const std::string& msg) : std::runtime_error(msg) {}
+};
+
+class CDBWrapper;
+
+/** These should be considered an implementation detail of the specific database.
+ */
+namespace dbwrapper_private {
+
+/** Handle database error by throwing dbwrapper_error exception.
+ */
+void HandleError(const leveldb::Status& status);
+
+};
+
+/** Batch of changes queued to be written to a CDBWrapper */
+class CDBBatch
+{
+    friend class CDBWrapper;
+
+private:
+    const CDBWrapper &parent;
+    leveldb::WriteBatch batch;
+
+public:
+    /**
+     * @param[in] _parent   CDBWrapper that this batch is to be submitted to
+     */
+    CDBBatch(const CDBWrapper &_parent) : parent(_parent) { };
+
+    template <typename K, typename V>
+    void Write(const K& key, const V& value)
+    {
+        CDataStream ssKey(SER_DISK, CLIENT_VERSION);
+        ssKey.reserve(DBWRAPPER_PREALLOC_KEY_SIZE);
+        ssKey << key;
+        leveldb::Slice slKey(ssKey.data(), ssKey.size());
+
+        CDataStream ssValue(SER_DISK, CLIENT_VERSION);
+        ssValue.reserve(DBWRAPPER_PREALLOC_VALUE_SIZE);
+        ssValue << value;
+        leveldb::Slice slValue(ssValue.data(), ssValue.size());
+
+        batch.Put(slKey, slValue);
+    }
+
+    template <typename K>
+    void Erase(const K& key)
+    {
+        CDataStream ssKey(SER_DISK, CLIENT_VERSION);
+        ssKey.reserve(DBWRAPPER_PREALLOC_KEY_SIZE);
+        ssKey << key;
+        leveldb::Slice slKey(ssKey.data(), ssKey.size());
+
+        batch.Delete(slKey);
+    }
+};
+
+class CDBIterator
+{
+private:
+    const CDBWrapper &parent;
+    leveldb::Iterator *piter;
+
+public:
+
+    /**
+     * @param[in] _parent          Parent CDBWrapper instance.
+     * @param[in] _piter           The original leveldb iterator.
+     */
+    CDBIterator(const CDBWrapper &_parent, leveldb::Iterator *_piter) :
+        parent(_parent), piter(_piter) { };
+    ~CDBIterator();
+
+    bool Valid();
+
+    void SeekToFirst();
+
+    template<typename K> void Seek(const K& key) {
+        CDataStream ssKey(SER_DISK, CLIENT_VERSION);
+        ssKey.reserve(GetSerializeSize(ssKey, key));
+        ssKey << key;
+        leveldb::Slice slKey(ssKey.data(), ssKey.size());
+        piter->Seek(slKey);
+    }
+
+    void Next();
+
+    template<typename K> bool GetKey(K& key) {
+        leveldb::Slice slKey = piter->key();
+        try {
+            CDataStream ssKey(slKey.data(), slKey.data() + slKey.size(), SER_DISK, CLIENT_VERSION);
+            ssKey >> key;
+        } catch(std::exception &e) {
+            return false;
+        }
+        return true;
+    }
+
+    unsigned int GetKeySize() {
+        return piter->key().size();
+    }
+
+    template<typename V> bool GetValue(V& value) {
+        leveldb::Slice slValue = piter->value();
+        try {
+            CDataStream ssValue(slValue.data(), slValue.data() + slValue.size(), SER_DISK, CLIENT_VERSION);
+            ssValue >> value;
+        } catch(std::exception &e) {
+            return false;
+        }
+        return true;
+    }
+
+    unsigned int GetValueSize() {
+        return piter->value().size();
+    }
+
+};
+
+class CDBWrapper
+{
+private:
+    //! custom environment this database is using (may be NULL in case of default environment)
+    leveldb::Env* penv;
+
+    //! database options used
+    leveldb::Options options;
+
+    //! options used when reading from the database
+    leveldb::ReadOptions readoptions;
+
+    //! options used when iterating over values of the database
+    leveldb::ReadOptions iteroptions;
+
+    //! options used when writing to the database
+    leveldb::WriteOptions writeoptions;
+
+    //! options used when sync writing to the database
+    leveldb::WriteOptions syncoptions;
+
+    //! the database itself
+    leveldb::DB* pdb;
+
+public:
+    /**
+     * @param[in] path        Location in the filesystem where leveldb data will be stored.
+     * @param[in] nCacheSize  Configures various leveldb cache settings.
+     * @param[in] fMemory     If true, use leveldb's memory environment.
+     * @param[in] fWipe       If true, remove all existing data.
+     */
+    CDBWrapper(const fs::path& path, size_t nCacheSize, bool fMemory = false, bool fWipe = false);
+    ~CDBWrapper();
+
+    template <typename K, typename V>
+    bool Read(const K& key, V& value) const
+    {
+        CDataStream ssKey(SER_DISK, CLIENT_VERSION);
+        ssKey.reserve(DBWRAPPER_PREALLOC_KEY_SIZE);
+        ssKey << key;
+        leveldb::Slice slKey(ssKey.data(), ssKey.size());
+
+        std::string strValue;
+        leveldb::Status status = pdb->Get(readoptions, slKey, &strValue);
+        if (!status.ok()) {
+            if (status.IsNotFound())
+                return false;
+            LogPrintf("LevelDB read failure: %s\n", status.ToString());
+            dbwrapper_private::HandleError(status);
+        }
+        try {
+            CDataStream ssValue(strValue.data(), strValue.data() + strValue.size(), SER_DISK, CLIENT_VERSION);
+            ssValue >> value;
+        } catch (const std::exception&) {
+            return false;
+        }
+        return true;
+    }
+
+    template <typename K, typename V>
+    bool Write(const K& key, const V& value, bool fSync = false)
+    {
+        CDBBatch batch(*this);
+        batch.Write(key, value);
+        return WriteBatch(batch, fSync);
+    }
+
+    template <typename K>
+    bool Exists(const K& key) const
+    {
+        CDataStream ssKey(SER_DISK, CLIENT_VERSION);
+        ssKey.reserve(DBWRAPPER_PREALLOC_KEY_SIZE);
+        ssKey << key;
+        leveldb::Slice slKey(ssKey.data(), ssKey.size());
+
+        std::string strValue;
+        leveldb::Status status = pdb->Get(readoptions, slKey, &strValue);
+        if (!status.ok()) {
+            if (status.IsNotFound())
+                return false;
+            LogPrintf("LevelDB read failure: %s\n", status.ToString());
+            dbwrapper_private::HandleError(status);
+        }
+        return true;
+    }
+
+    template <typename K>
+    bool Erase(const K& key, bool fSync = false)
+    {
+        CDBBatch batch(*this);
+        batch.Erase(key);
+        return WriteBatch(batch, fSync);
+    }
+
+    bool WriteBatch(CDBBatch& batch, bool fSync = false);
+
+    // not available for LevelDB; provide for compatibility with BDB
+    bool Flush()
+    {
+        return true;
+    }
+
+    bool Sync()
+    {
+        CDBBatch batch(*this);
+        return WriteBatch(batch, true);
+    }
+
+    CDBIterator *NewIterator()
+    {
+        return new CDBIterator(*this, pdb->NewIterator(iteroptions));
+    }
+
+    /**
+     * Return true if the database managed by this class contains no entries.
+     */
+    bool IsEmpty();
+};
+
+#endif // BITCOIN_DBWRAPPER_H
+
diff --git a/depend/zcash/src/deprecation.cpp b/depend/zcash/src/deprecation.cpp
new file mode 100644
index 000000000..9d9c50fd7
--- /dev/null
+++ b/depend/zcash/src/deprecation.cpp
@@ -0,0 +1,123 @@
+// Copyright (c) 2017 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "deprecation.h"
+
+#include "alert.h"
+#include "clientversion.h"
+#include "init.h"
+#include "ui_interface.h"
+#include "util.h"
+#include "chainparams.h"
+
+// Flags that enable deprecated functionality.
+#ifdef ENABLE_WALLET
+bool fEnableGetNewAddress = true;
+bool fEnableGetRawChangeAddress = true;
+bool fEnableZGetNewAddress = true;
+bool fEnableZGetBalance = true;
+bool fEnableZGetTotalBalance = true;
+bool fEnableZListAddresses = true;
+bool fEnableLegacyPrivacyStrategy = true;
+bool fEnableZCRawReceive = true;
+bool fEnableZCRawJoinSplit = true;
+bool fEnableZCRawKeygen = true;
+bool fEnableAddrTypeField = true;
+#endif
+
+static const std::string CLIENT_VERSION_STR = FormatVersion(CLIENT_VERSION);
+
+void EnforceNodeDeprecation(int nHeight, bool forceLogging, bool fThread) {
+
+    // Do not enforce deprecation in regtest or on testnet
+    std::string networkID = Params().NetworkIDString();
+    if (networkID != "main") return;
+
+    int blocksToDeprecation = DEPRECATION_HEIGHT - nHeight;
+    if (blocksToDeprecation <= 0) {
+        // In order to ensure we only log once per process when deprecation is
+        // disabled (to avoid log spam), we only need to log in two cases:
+        // - The deprecating block just arrived
+        //   - This can be triggered more than once if a block chain reorg
+        //     occurs, but that's an irregular event that won't cause spam.
+        // - The node is starting
+        if (blocksToDeprecation == 0 || forceLogging) {
+            auto msg = strprintf(_("This version has been deprecated as of block height %d."),
+                                 DEPRECATION_HEIGHT) + " " +
+                       _("You should upgrade to the latest version of Zcash.");
+            LogPrintf("*** %s\n", msg);
+            CAlert::Notify(msg, fThread);
+            uiInterface.ThreadSafeMessageBox(msg, "", CClientUIInterface::MSG_ERROR);
+        }
+        StartShutdown();
+    } else if (blocksToDeprecation == DEPRECATION_WARN_LIMIT ||
+               (blocksToDeprecation < DEPRECATION_WARN_LIMIT && forceLogging)) {
+        std::string msg = strprintf(_("This version will be deprecated at block height %d, and will automatically shut down."),
+                            DEPRECATION_HEIGHT) + " " +
+                  _("You should upgrade to the latest version of Zcash.");
+        LogPrintf("*** %s\n", msg);
+        CAlert::Notify(msg, fThread);
+        uiInterface.ThreadSafeMessageBox(msg, "", CClientUIInterface::MSG_WARNING);
+    }
+}
+
+std::optional<std::string> SetAllowedDeprecatedFeaturesFromCLIArgs() {
+    auto args = GetMultiArg("-allowdeprecated");
+    std::set<std::string> allowdeprecated(args.begin(), args.end());
+
+    if (allowdeprecated.count("none") > 0) {
+        if (allowdeprecated.size() > 1)
+            return "When using -allowdeprecated=none no other values may be provided for -allowdeprecated.";
+        allowdeprecated = {};
+    } else {
+        allowdeprecated.insert(DEFAULT_ALLOW_DEPRECATED.begin(), DEFAULT_ALLOW_DEPRECATED.end());
+    }
+
+    std::set<std::string> unrecognized;
+    for (const auto& flag : allowdeprecated) {
+        if (DEFAULT_ALLOW_DEPRECATED.count(flag) == 0 && DEFAULT_DENY_DEPRECATED.count(flag) == 0)
+            unrecognized.insert(flag);
+    }
+
+    if (unrecognized.size() > 0) {
+        std::string unrecMsg;
+        for (const auto& value : unrecognized) {
+            if (unrecMsg.size() > 0) unrecMsg += ", ";
+            unrecMsg += "\"" + value + "\"";
+        }
+
+        return strprintf(
+                "Unrecognized argument(s) to -allowdeprecated: %s;\n"
+                "Please select from the following values: %s",
+                unrecMsg, GetAllowableDeprecatedFeatures());
+    }
+
+#ifdef ENABLE_WALLET
+    fEnableLegacyPrivacyStrategy = allowdeprecated.count("legacy_privacy") > 0;
+    fEnableGetNewAddress = allowdeprecated.count("getnewaddress") > 0;
+    fEnableGetRawChangeAddress = allowdeprecated.count("getrawchangeaddress") > 0;
+    fEnableZGetNewAddress = allowdeprecated.count("z_getnewaddress") > 0;
+    fEnableZGetBalance = allowdeprecated.count("z_getbalance") > 0;
+    fEnableZGetTotalBalance = allowdeprecated.count("z_gettotalbalance") > 0;
+    fEnableZListAddresses = allowdeprecated.count("z_listaddresses") > 0;
+    fEnableZCRawReceive = allowdeprecated.count("zcrawreceive") > 0;
+    fEnableZCRawJoinSplit = allowdeprecated.count("zcrawjoinsplit") > 0;
+    fEnableZCRawKeygen = allowdeprecated.count("zcrawkeygen") > 0;
+    fEnableAddrTypeField = allowdeprecated.count("addrtype") > 0;
+#endif
+
+    return std::nullopt;
+}
+
+std::string GetAllowableDeprecatedFeatures() {
+    std::string result = "\"none\"";
+    for (const auto& value : DEFAULT_ALLOW_DEPRECATED) {
+        result += ", \"" + value + "\"";
+    }
+    for (const auto& value : DEFAULT_DENY_DEPRECATED) {
+        result += ", \"" + value + "\"";
+    }
+    return result;
+}
+
diff --git a/depend/zcash/src/deprecation.h b/depend/zcash/src/deprecation.h
new file mode 100644
index 000000000..7f8ea5e84
--- /dev/null
+++ b/depend/zcash/src/deprecation.h
@@ -0,0 +1,87 @@
+// Copyright (c) 2017 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_DEPRECATION_H
+#define ZCASH_DEPRECATION_H
+
+#include "consensus/params.h"
+// Deprecation policy:
+// Per https://zips.z.cash/zip-0200
+// Shut down nodes running this version of code, 16 weeks' worth of blocks after the estimated
+// release block height. A warning is shown during the 14 days' worth of blocks prior to shut down.
+static const int APPROX_RELEASE_HEIGHT = 1663550;
+static const int RELEASE_TO_DEPRECATION_WEEKS = 16;
+static const int EXPECTED_BLOCKS_PER_HOUR = 3600 / Consensus::POST_BLOSSOM_POW_TARGET_SPACING;
+static_assert(EXPECTED_BLOCKS_PER_HOUR == 48, "The value of Consensus::POST_BLOSSOM_POW_TARGET_SPACING was chosen such that this assertion holds.");
+static const int ACTIVATION_TO_DEPRECATION_BLOCKS = (RELEASE_TO_DEPRECATION_WEEKS * 7 * 24 * EXPECTED_BLOCKS_PER_HOUR);
+static const int DEPRECATION_HEIGHT = APPROX_RELEASE_HEIGHT + ACTIVATION_TO_DEPRECATION_BLOCKS;
+
+// Number of blocks before deprecation to warn users
+static const int DEPRECATION_WARN_LIMIT = 14 * 24 * EXPECTED_BLOCKS_PER_HOUR;
+
+//! Defaults for -allowdeprecated
+static const std::set<std::string> DEFAULT_ALLOW_DEPRECATED{{
+    // Node-level features
+
+    // Wallet-level features
+#ifdef ENABLE_WALLET
+    "legacy_privacy",
+    "getnewaddress",
+    "getrawchangeaddress",
+    "z_getnewaddress",
+    "z_getbalance",
+    "z_gettotalbalance",
+    "z_listaddresses",
+    "addrtype"
+#endif
+}};
+static const std::set<std::string> DEFAULT_DENY_DEPRECATED{{
+#ifdef ENABLE_WALLET
+    "zcrawreceive",
+    "zcrawjoinsplit",
+    "zcrawkeygen",
+#endif
+}};
+
+// Flags that enable deprecated functionality.
+#ifdef ENABLE_WALLET
+extern bool fEnableGetNewAddress;
+extern bool fEnableGetRawChangeAddress;
+extern bool fEnableZGetNewAddress;
+extern bool fEnableZGetBalance;
+extern bool fEnableZGetTotalBalance;
+extern bool fEnableZListAddresses;
+extern bool fEnableLegacyPrivacyStrategy;
+extern bool fEnableZCRawReceive;
+extern bool fEnableZCRawJoinSplit;
+extern bool fEnableZCRawKeygen;
+extern bool fEnableAddrTypeField;
+#endif
+
+/**
+ * Checks whether the node is deprecated based on the current block height, and
+ * shuts down the node with an error if so (and deprecation is not disabled for
+ * the current client version). Warning and error messages are sent to the debug
+ * log, the metrics UI, and (if configured) -alertnofity.
+ *
+ * fThread means run -alertnotify in a free-running thread.
+ */
+void EnforceNodeDeprecation(int nHeight, bool forceLogging=false, bool fThread=true);
+
+/**
+ * Checks command-line arguments for enabling and/or disabling of deprecated
+ * features and sets flags that enable deprecated features accordingly.
+ *
+ * @return std::nullopt if successful, or an error message indicating what
+ * values are permitted for `-allowdeprecated`.
+ */
+std::optional<std::string> SetAllowedDeprecatedFeaturesFromCLIArgs();
+
+/**
+ * Returns a comma-separated list of the valid arguments to the -allowdeprecated
+ * CLI option.
+ */
+std::string GetAllowableDeprecatedFeatures();
+
+#endif // ZCASH_DEPRECATION_H
diff --git a/depend/zcash/src/experimental_features.cpp b/depend/zcash/src/experimental_features.cpp
new file mode 100644
index 000000000..67afbf7fc
--- /dev/null
+++ b/depend/zcash/src/experimental_features.cpp
@@ -0,0 +1,56 @@
+// Copyright (c) 2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "experimental_features.h"
+
+#include "util.h"
+
+bool fExperimentalDeveloperEncryptWallet = false;
+bool fExperimentalDeveloperSetPoolSizeZero = false;
+bool fExperimentalPaymentDisclosure = false;
+bool fExperimentalInsightExplorer = false;
+bool fExperimentalLightWalletd = false;
+
+std::optional<std::string> InitExperimentalMode()
+{
+    auto fExperimentalMode = GetBoolArg("-experimentalfeatures", false);
+    fExperimentalDeveloperEncryptWallet = GetBoolArg("-developerencryptwallet", false);
+    fExperimentalDeveloperSetPoolSizeZero = GetBoolArg("-developersetpoolsizezero", false);
+    fExperimentalPaymentDisclosure = GetBoolArg("-paymentdisclosure", false);
+    fExperimentalInsightExplorer = GetBoolArg("-insightexplorer", false);
+    fExperimentalLightWalletd  = GetBoolArg("-lightwalletd", false);
+
+    // Fail if user has set experimental options without the global flag
+    if (!fExperimentalMode) {
+        if (fExperimentalDeveloperEncryptWallet) {
+            return _("Wallet encryption requires -experimentalfeatures.");
+        } else if (fExperimentalDeveloperSetPoolSizeZero) {
+            return _("Setting the size of shielded pools to zero requires -experimentalfeatures.");
+        } else if (fExperimentalPaymentDisclosure) {
+            return _("Payment disclosure requires -experimentalfeatures.");
+        } else if (fExperimentalInsightExplorer) {
+            return _("Insight explorer requires -experimentalfeatures.");
+        } else if (fExperimentalLightWalletd) {
+            return _("Light Walletd requires -experimentalfeatures.");
+        }
+    }
+    return std::nullopt;
+}
+
+std::vector<std::string> GetExperimentalFeatures()
+{
+    std::vector<std::string> experimentalfeatures;
+    if (fExperimentalDeveloperEncryptWallet)
+        experimentalfeatures.push_back("developerencryptwallet");
+    if (fExperimentalDeveloperSetPoolSizeZero)
+        experimentalfeatures.push_back("developersetpoolsizezero");
+    if (fExperimentalPaymentDisclosure)
+        experimentalfeatures.push_back("paymentdisclosure");
+    if (fExperimentalInsightExplorer)
+        experimentalfeatures.push_back("insightexplorer");
+    if (fExperimentalLightWalletd)
+        experimentalfeatures.push_back("lightwalletd");
+
+    return experimentalfeatures;
+}
diff --git a/depend/zcash/src/experimental_features.h b/depend/zcash/src/experimental_features.h
new file mode 100644
index 000000000..d607f1d53
--- /dev/null
+++ b/depend/zcash/src/experimental_features.h
@@ -0,0 +1,21 @@
+// Copyright (c) 2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_EXPERIMENTAL_FEATURES_H
+#define ZCASH_EXPERIMENTAL_FEATURES_H
+
+#include <optional>
+#include <string>
+#include <vector>
+
+extern bool fExperimentalDeveloperEncryptWallet;
+extern bool fExperimentalDeveloperSetPoolSizeZero;
+extern bool fExperimentalPaymentDisclosure;
+extern bool fExperimentalInsightExplorer;
+extern bool fExperimentalLightWalletd;
+
+std::optional<std::string> InitExperimentalMode();
+std::vector<std::string> GetExperimentalFeatures();
+
+#endif // ZCASH_EXPERIMENTAL_FEATURES_H
diff --git a/depend/zcash/src/fs.cpp b/depend/zcash/src/fs.cpp
new file mode 100644
index 000000000..a5e12f1cf
--- /dev/null
+++ b/depend/zcash/src/fs.cpp
@@ -0,0 +1,15 @@
+#include "fs.h"
+
+namespace fsbridge {
+
+FILE *fopen(const fs::path& p, const char *mode)
+{
+    return ::fopen(p.string().c_str(), mode);
+}
+
+FILE *freopen(const fs::path& p, const char *mode, FILE *stream)
+{
+    return ::freopen(p.string().c_str(), mode, stream);
+}
+
+} // fsbridge
diff --git a/depend/zcash/src/fs.h b/depend/zcash/src/fs.h
new file mode 100644
index 000000000..2d440905a
--- /dev/null
+++ b/depend/zcash/src/fs.h
@@ -0,0 +1,24 @@
+// Copyright (c) 2017 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_FS_H
+#define BITCOIN_FS_H
+
+#include <stdio.h>
+#include <string>
+
+#include <boost/filesystem.hpp>
+#include <boost/filesystem/fstream.hpp>
+#include <boost/filesystem/detail/utf8_codecvt_facet.hpp>
+
+/** Filesystem operations and types */
+namespace fs = boost::filesystem;
+
+/** Bridge operations to C stdio */
+namespace fsbridge {
+    FILE *fopen(const fs::path& p, const char *mode);
+    FILE *freopen(const fs::path& p, const char *mode, FILE *stream);
+};
+
+#endif // BITCOIN_FS_H
diff --git a/depend/zcash/src/fuzzing/CheckBlock/fuzz.cpp b/depend/zcash/src/fuzzing/CheckBlock/fuzz.cpp
new file mode 100644
index 000000000..4757ab4ca
--- /dev/null
+++ b/depend/zcash/src/fuzzing/CheckBlock/fuzz.cpp
@@ -0,0 +1,67 @@
+#include "consensus/validation.h"
+#include "chainparams.h"
+#include "proof_verifier.h"
+
+extern bool CheckBlock(
+    const CBlock& block,
+    CValidationState& state,
+    const CChainParams& chainparams,
+    libzcash::ProofVerifier& verifier,
+    bool fCheckPOW = true,
+    bool fCheckMerkleRoot = true);
+
+bool init_done = false;
+
+const CChainParams& chainparams = NULL;
+auto verifier = libzcash::ProofVerifier::Strict();
+
+
+int fuzz_CheckBlock(CBlock block) {
+    int retval = 0;
+
+    if (!init_done) {
+        SelectParams(CBaseChainParams::MAIN);
+        chainparams = Params()
+        init_done = true;
+    }
+
+    CValidationState state;
+
+    // We don't check the PoW or Merkle tree root in order to reach more code.
+
+    if (!CheckBlock(block, state, chainparams, verifier, false, false)) {
+        retval = -1;
+    }
+
+    return retval;
+}
+
+#ifdef FUZZ_WITH_AFL
+
+int main (int argc, char *argv[]) {
+    CBlock block;
+    CAutoFile filein(fopen(argv[1], "rb"), SER_DISK, CLIENT_VERSION);
+    try {
+        filein >> block;
+    } catch (const std::exception& e) {
+        return -1;
+    }
+    return fuzz_CheckBlock(block);
+}
+
+#endif // FUZZ_WITH_AFL
+#ifdef FUZZ_WITH_LIBFUZZER
+
+extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) {
+    CBlock block;
+    CDataStream ds((const char *)Data, (const char *)Data+Size, SER_NETWORK, PROTOCOL_VERSION);
+    try {
+        ds >> block;
+    } catch (const std::exception &e) {
+        return -1;
+    }
+    fuzz_CheckBlock(block);
+    return 0;  // Non-zero return values are reserved for future use.
+}
+
+#endif
diff --git a/depend/zcash/src/fuzzing/CheckBlock/input/0.bin b/depend/zcash/src/fuzzing/CheckBlock/input/0.bin
new file mode 100644
index 000000000..af3882252
Binary files /dev/null and b/depend/zcash/src/fuzzing/CheckBlock/input/0.bin differ
diff --git a/depend/zcash/src/fuzzing/CheckBlock/input/476431.bin b/depend/zcash/src/fuzzing/CheckBlock/input/476431.bin
new file mode 100644
index 000000000..ba56c7b7e
Binary files /dev/null and b/depend/zcash/src/fuzzing/CheckBlock/input/476431.bin differ
diff --git a/depend/zcash/src/fuzzing/CheckBlock/input/620000.bin b/depend/zcash/src/fuzzing/CheckBlock/input/620000.bin
new file mode 100644
index 000000000..72ee3018f
Binary files /dev/null and b/depend/zcash/src/fuzzing/CheckBlock/input/620000.bin differ
diff --git a/depend/zcash/src/fuzzing/DecodeHexTx/fuzz.cpp b/depend/zcash/src/fuzzing/DecodeHexTx/fuzz.cpp
new file mode 100644
index 000000000..8cf74d503
--- /dev/null
+++ b/depend/zcash/src/fuzzing/DecodeHexTx/fuzz.cpp
@@ -0,0 +1,39 @@
+#include <bits/stdc++.h>
+#include <string>
+
+extern bool DecodeHexTx(CTransaction& tx, const std::string& strHexTx);
+
+// actual fuzzer
+
+bool fuzz_DecodeHexTxFunction (const std::string& strHexTx) {
+        CTransaction tx;
+        return DecodeHexTx(tx, strHexTx);
+}
+
+#ifdef FUZZ_WITH_AFL
+
+// AFL
+
+int fuzz_DecodeHexTx (int argc, char *argv[]) {
+        std::ifstream t(argv[1]);
+        std::string str((std::istreambuf_iterator<char>(t)),
+                                         std::istreambuf_iterator<char>());
+        if (fuzz_DecodeHexTxFunction (str)) { fprintf(stdout, "Decoded hex string") ; return 0; }
+        else { fprintf(stderr, "Could not decode hex string") ; return -1; }
+}
+
+int main (int argc, char *argv[]) { return fuzz_DecodeHexTx(argc, argv); }
+
+#endif
+#ifdef FUZZ_WITH_LIBFUZZER
+
+// libfuzzer
+
+extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) {
+    std::string s;
+    s.assign((const char *)Data, Size);
+    fuzz_DecodeHexTxFunction (s);
+    return 0;  // Non-zero return values are reserved for future use.
+}
+
+#endif
diff --git a/depend/zcash/src/fuzzing/DecodeHexTx/input/coinbase.txt b/depend/zcash/src/fuzzing/DecodeHexTx/input/coinbase.txt
new file mode 100644
index 000000000..16966e228
--- /dev/null
+++ b/depend/zcash/src/fuzzing/DecodeHexTx/input/coinbase.txt
@@ -0,0 +1 @@
+0400008085202f89010000000000000000000000000000000000000000000000000000000000000000ffffffff2a03677b090004e161a75d0edb51e814ae3737f790e3c94f11495327270fdfbd6132d5e90f87507455844cffffffff023f1e9b3b000000001976a914e0082ee3d89f84adbadaaebddd1746bb20e6d4ee88ac80b2e60e0000000017a914ce811a7457b9f4553af120e553bc8ddd8bb33ce98700000000000000000000000000000000000000
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/DecodeHexTx/input/manyoutputs.txt b/depend/zcash/src/fuzzing/DecodeHexTx/input/manyoutputs.txt
new file mode 100644
index 000000000..d6ab6b4e6
--- /dev/null
+++ b/depend/zcash/src/fuzzing/DecodeHexTx/input/manyoutputs.txt
@@ -0,0 +1 @@
+0400008085202f8902befc1c37af31039fc287f26ce1240524a8aa209e4b668cd9bd928347e62355c2000000006a47304402206f85716662f762565b040b21059d7a1e8a1cc520b781d6d46a1c2a685d6ac125022063dedfa9b036169a1a9b81bffcd4e7717c993286a507d84224fa630590fe82d0012102a1e96e2736efd7dbd5b6dc807c24b657fdcc6d3a7e6c7fac5607a9f3e47b8748ffffffffc5d479c0fa4ff1b932b4c80105643dfd8df963f45fe363bf2794a3c86473e985050000006b48304502210081dfd38fcc7a39aebbf26606e987a1ed68d10faaca0a200aa65f040065b88ac80220082eccb4fbd4d0bf1b55fc14b7b4f25d76a1e93fe6181922bd0cfe9d77d1fa9d012102a1e96e2736efd7dbd5b6dc807c24b657fdcc6d3a7e6c7fac5607a9f3e47b8748ffffffff47c204d31d000000001976a91478a6c1f4016e651d17a861b027fd6d217472d27288acc703ac00000000001976a914b70661b7ddf8450e44b06b9f8e466cb209c504a688acc2fa4701000000001976a9143d6d2394b9f0b9a4a56c1536f4c6adf979eb772488acae8f0703000000001976a9140f5ebfa68d92de9f10110a874fe69fb2c2ae122088acde342200000000001976a9142c3ef04a3a41df528234ebfa438a96895f94c40d88ac5e2ba400000000001976a9142fb59e414b3e73d2665266f9add4253b83ae455e88ac7fa51500000000001976a9147da516f0a4e5b54e6870c88da34d4cb7951411bd88acbc614900000000001976a91408135077ee8808dc75623dc6c80a9edad8803d9688acd0851003000000001976a914e2a878e046a5006a4adeae1b6e4e004bb07fc57c88ac25494e00000000001976a9144be18cbda2883ebbc5061da1bd471600a59a94cf88ace7821002000000001976a914031a94992926a4e6ebcda8ebb5e865ceb91bebd888ac1b509d00000000001976a91420eb1449216e61aa99ac4a4efc8da3a8288bb8df88aca1070500000000001976a914179e347753c9e04358eb529c43925b68b5d3df1888ac611ea800000000001976a914a2649b4b77da4ee11651182b56b175977efaac3588acd6901000000000001976a914fba4aee4df81f8ec128644b6ffc3fcf7340c312088ac1b5aec000000000017a91441ca4c4997f4158b20831a6bdb3502c2e2668c5c8790e61100000000001976a914d3f19ab072fa80f501733e17aa1c74b974b6f63588ac57e99800000000001976a91477d55248c52900cb278f25a93b366037a273f59388acfb6e0500000000001976a914448d4c46027d917038a6ec1359b428d94a21816088accda91100000000001976a914157b6515820f71cc5fec6cddefba67b39c28945288aca6730f00000000001976a9141e11d2a44c56d52c6030c92484e3cbff7668f85f88acd690a100000000001976a9144340ebe430837105b17270f3db8b4b493125977588ac38e1911a000000001976a914780332e7f8ad8a3b164daa66f358112f3e5da3ca88acacf30d00000000001976a914be547067034818d54721d0639ca2567fab92627388ac12102700000000001976a91482d5fee592be74fb6b5b93132936296f778e5e2588ac5dfba200000000001976a9149e89130245c481e76f898209ffa49a1f1e9b6b3788ac01c5a300000000001976a9146fd439218e6ea0ebfcb71c2c884f62c3072dd1bf88acca201400000000001976a91489d97fc368a849890b71672e4d119e8241dc82b888ac6bd79800000000001976a9146680bb7e80f4633c4fe8f5d454cd6249b09cd84088aca1d10800000000001976a9141957b979db9371ad172db3c2e14828a921c4375c88ac50aa1800000000001976a91431ba04310f5744bf82e389646744f6957e4d804088acde574d00000000001976a914bdb6082119d4f48b164c22d63758aba0fdad926888acc59e9b00000000001976a9144ee4278bfaebe562d022b098adca6c6f0fd6226688ac97960f00000000001976a914a9830a65a06703b7f3479fb76dba84a5c609c27888ac1e96bd00000000001976a9147073f14a83cd3c1409d4654f823b3d212248ac6e88acfd6e9a00000000001976a91495db46ddbdcec98ae44286a27d0e2261b6f7c85688ac29de2000000000001976a9147d9d90e38ab26b1b3bad803fba3d61ce2784a93688ac27fb9800000000001976a914f6f5e13d7d234837f0d87ee78d4ff8c3f4144ed588aca5ec86bf0e0000001976a9148255a41ba998eaffb465a3d8e93c594a1da8f1ab88ac93f33101000000001976a9144dbd328cecc555c670e4cf5fb2797326d9645aad88ac7bdd9900000000001976a9149b4dbcdfa48ec8ad89347dacb084eecb8261006888ac30e60203000000001976a914e1f431e2ae6cefd567231846f9dcf0c66d76e16588ac09daa700000000001976a914401a49d45a413e9696be0db70f975ce70f8c7cf388acdb63cd06000000001976a914708b30c60031ef4ab36787f5cf2a3b4578a4853888ac213f5503000000001976a914719fe2aea706e8aec771905582ded2518c18a22688ac40180200000000001976a914ef4056d82ac0b683fc0d3f07128b180fd03ee2dd88ac91ca1f00000000001976a914f161281ea6a041a88461e940d2c21404bcfab94588ac4aaf1200000000001976a914b69c7339f573f40513cf7a44dd4e5c3cc0a5e4b988acf90075060000000017a914d0ee49d95f1af8813af892f6f8f0b20cc0b2d623876d010200000000001976a914fb0c18362cfca25b7c94b472e6fc7553b0d4738188ac50cf0600000000001976a9142e10260dbb4a0fcbaa3b06c0bcd94c1f37f1c72d88ac722baf00000000001976a914baf763fa7d1cb569203b8be11c05c07baa50fbd588ac47b25d00000000001976a914ee5b497487fcd2790b007421b6031b5c9112dd6788ac75602800000000001976a914eddfc57e127d733926e97a58821839b83adb0b2a88ac76359a00000000001976a91432c5172f4f9ffcb2ac6742d19ca2e669f553513d88ace6a59f00000000001976a91433fc10b166d54a051560ba929388c874b9557edc88ac6e161500000000001976a914f12ca2a753b1d7b0a99432c4b9bf1da85653f55c88acd41a9b00000000001976a91442f117744d7e20658e54dc6dea545e9c5312462888acf76d4d00000000001976a914e34554ba274741b2a3ced9c054c27b91c0c2e03d88aced230200000000001976a91428062481ce9b03fd727d64bfa72b3dffacaf452b88ac418a171e000000001976a9142aec5ce62b93b06089074cd7657fc46694d4bfc088acc0540f00000000001976a9140e4819142771ccf9ab3c54fb17d834636c8f6a9488ac91731100000000001976a914ba5c11856d2c042e3ac4734e7e06b23fd99c0b7288ac76021500000000001976a9144d036eb4c1e0946c30559728001c66a108ee4a1288acf9f38219000000001976a9146f2bc25d2c470ce061f2678b98a1a4ddb4be4d4f88acf9047300000000001976a91438dfba1089757034c516a7949ebeb053ff015d6f88ac44825d00000000001976a91424da8bf275c1fc6efdfb2654bfd9e3e236bd881d88acffef5c00000000001976a9144a9ed8c7b52bf44d835326ff8967ef63f2f4830f88ac83bbfc05000000001976a91430dc5101259b18d053c794ec61731da4b06d182788ac72c0e400000000001976a9149c91bf5ba5c0b1e11e7af0aef690f4bb180bb9b788ac50870a00000000001976a914df89be1a534e1fd4b9a4b3616c27bf99fbc44efc88ac00000000548809000000000000000000000000
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/DecodeHexTx/input/sapling.txt b/depend/zcash/src/fuzzing/DecodeHexTx/input/sapling.txt
new file mode 100644
index 000000000..333d69007
--- /dev/null
+++ b/depend/zcash/src/fuzzing/DecodeHexTx/input/sapling.txt
@@ -0,0 +1 @@
+0400008085202f89000000000000ec8a0900102700000000000001251409d9698abef6527f651bac9cfd1eb57b7ff934b05e6921879e5fae0678adf9792e02ab24556f3fc6a24519d24ae7f2b8e3aed982cf3e36ea1a0c1243600d953fae63415e818e050048edb6fed27cc3f893d1b163620270bd7d7ce2065f303f57c1d621d3336305bcf9ffb8c13c917fcbcc05b68c27c77abf90a1a7013e1791fe0bfc4c147a66c8cf87a3ede59ba56f585bb6301eb3e0952fe066a0e40cfb8a58c1ed227471e9eafb999169ff7e19a85c3e9c739f7fe974c849309c379c9e3d6ed2d913ddaee302e6c54e929a85193ae7a7eb327fbae9082945732dfbd14a0b1cf66446b20c7e054e7cbd4a428eded695035e5d7144efb73b9e4ce10d2ce23516e95bbb3971403460ced0ac269eb2b86142ddb53d83ef09c6673cdba495f23dc0e1d17317c8debb31d0963c45884d2af79448057084b23a1776feacb8109246d49dc988b3fa7f32d53dbc3c40e5a0932dad6a87c916b6bbbec2d803bd806424ab3374eab7880e69570c6e94495e6c7445ad3911a29bfdf1f702688a66180902a001d887b84e87a1a08147b3ec53b92f7f3f214a1a1c60cded3d7b9e1516033a2586a074ad5b01a178db42b76d16c3db5302d62825347390cf5b760ea2362a27db3063d4a2021514a3c64e3bca0896a6b52c0b8ba4ef9120eb7cf9367ad6ca859d1986b00789a7889d2caf7b016a2e000bd0538359b250871497686c12321941787b6a65364138c7484037e7143d83a6d2606722b27ce75426cb1392e92ae4470dd8aa04f0fdeca4a924c599822496689bd7388214e68c8a94a9e07f0a41d485ff7cdce14fb1442f017231b0d27b7992b17007d034b0df7cb373495fd99668a4be34ceeea5b3a425cda44a1bb726e1cf0ac6b9cd05da93482524bdc60aec7300ae09281d5c62325d3c9ada64c41802358a692fb219712ff1e872476806d690b7f2ff68b023df2942d220a98b09af78dc85d1c1f4e39cc01aa4d4d7892fd665e1c0ec2fc35724586c75a9ff3c5f2d27226b8013562b59a6ee69d4d36e9d858da5a41a32c9769c41e7362681b5c93b5bb915adf1d08b71e2f74f15407dc2f3f48d7043d619d22f613714f21b481a80113a4a2b9616325aa52cf4cc6dd8db54f764ae7c7270476406ee8313b66e1109c14cb4ccd138b41e6c9e8005c593ab6e40a5d6bf5017a52faec7d0fdc3adf600af499d0e3c73a5567bbd2bd366132e2b222095843898814865e3b3a2e8662e87f9618764eb4b962e5eb8e8a7740197365eb2d0c086b4ffd65bd19cec6dba33634eefba2353ac622985f3e4dd6df772691661d58de3297d440ea58edc6297e877790e56320d13adfafa71b79b7381366564befbb40470b254935bb83a9acf4124cc45993c99c1713f500dad49bb3ba6ce70dfbb75091790a0a033a9c3dd0d8975fd005a0c5b9d3ca230c36173c96dc3d41833d3b75ef392edc08c5343f838f8d19714a5ce6afaafe34914a65177e348d56133ec9d1fdec768a4b4e3221d7820f941c0e79f5a97d25ca99a02e3211fd4d74b926cf14fad605fcd8631b2a9ce8156703e9623a1f6ef50e039e71ae0560a9b96a2965c964b6b133d8b3ee35e38f91c18645fab67b798a287fd50c9d48f39b213a1904b8a62102c214a0692ad01f5f74df6ff639cd28d95e720842295cd337d9639dd2e90f8996fcad10911eac82e8aa060ae211ad4620c1c6cc20b277f5b1f45b906625d98f07dfd16b5b70b983cd881571a6af39012ec30c43b8b1e12c3534d852453b26f8c2c50c4a902a339d67a0dc9081668a383ae6f28c0f2c7eb3c9cc0597d16c1ba83062729e1c90407431caf00f46e04c3350277bc318d2cc5d8d9857d294d50729b72dc3b78725a8ad6a40ffcae066d91108ebb9d34a6bfee2bb41b56fc7f08bf4b50e8c52567509215948f414356e5639cfadeceb04fd7d8b3e151fa3ee77f7ba87dbc0337b81e240e03508c69d35d1e5e3d998a589443edb68059b87e39b241cb16e09b6f1da1b381cd467f85df6b1cb29e7d8a89bf6216fdf927ede71ee945c36f313278ca50618da3d160fce0da32b325f27be0afaaeb92856d4dea26dba9922f5c541e76453893bea8f4ad4aed716835fa6ee6a04453d5fa1efe6efb64e060a82406c4230c8ed981f45f4ab078864b4388f3866aee9f76d2b0e2bea8601b4f8e79245fc5c94995be9674c1ae064242f6a65fad2ef9ea28e6bcba11fa07f14fad1c9da5f9cc78b4bb7217015968122f9c9ea59b661c3188c909e76caffd48185f6917ee306be440b67f7712500c5d37d14481e3ea01d78aeeca4178bb9835627d1d799bd5514039ac1f4bde04315bbfa194900885b9718be9871d629b9df14a022821c83c3039aec07f32575d2e84f6c3acc90d02a26a6380d63012310f6abd49c746cec06eb324715a2fa74d6c8e8327c85cabcbd78ece00fcff64cc36822b3ed28f15cc85fd4945e4010192890f30df28b6de4d3354e40e77121647a224e35874175a2de9cabca4dcead549d697a3bb76c0a2280c2a459ba63a9625ff53ce8accddd9b3dabb4a285d4cac4d410e787f5e8b9f1ba509d28fd95a2e0d3400d1c5e27394a64324ed44884eed42b273375bccc8b7df8bc035172eea0198b9ac8c1c99ecbe547102ec8449cc0d436f85567247cbb2942a51abbce1714caeb852afbd4a64649c2655d7b577061591b6a928c88f679a3f914e5608cc400c027e78911c192704f260cf4e05b96c5df0579a22e591e28c9c344320c12088fff7e81e4aef56ad417a2782dc03dc1d94909f0cb2a70304b2e6cabe4165ee53893dd63b58a08968fa43a03851da5151c7609715c3f6d21f01d15b578d8c37426da5008801107e35f62525734cd0a7876f065b920e2ec461c4f3700b792cf89c406893949a1058cf422837ffe1f87209212cc379a3b482e15e8993b468d94565317917870c734555a61db272a24fe52e40479c9a25276a0cc2e0c42404d11e9e1aae1c7545a6f99cbcb2cc2dfc11e889eade5df7f7da7aa38f12af116d217af57f8e3ae575e69190676502088cba9295f775538dfe653eecd0cf504643c2ff6920719d0d83047e16052016459f7fc802b420f0796c771b7d988fd95a42b17f363a692346455e1c6e173298aafeea3fcfca393349ebbefa6899777264b5d0452aa8f70573ae688d9916861447da00d9d847eda7e34f88988086d6734bb43ec53b4a2d9f260103cde700415214614727f24927a7e49fa191153a41eb24e73f78aaf544c10d68fbe459e232be1af6b48fa01b2d018774e28483d2f990d0eae272680f57e5980ff2033907
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/DecodeHexTx/input/sprout.txt b/depend/zcash/src/fuzzing/DecodeHexTx/input/sprout.txt
new file mode 100644
index 000000000..e2b10f021
--- /dev/null
+++ b/depend/zcash/src/fuzzing/DecodeHexTx/input/sprout.txt
@@ -0,0 +1 @@
+0400008085202f89000000000000ed8a090000000000000000000000010000000000000000102700000000000046e5b5ba294641c0491ef8cb5a97591fe1fcee2bab2301553f9bc0f9acc9bcb70f836c9945bfbae86faf169fd9be228f6c373e0b029fd648e7d0660d8412b50c0597c61387abfc9f1122179f1c612ad72ce09cf6dd8576f60494d0a828c10706f7594b5f237eeec5fd0474f6a16f3923a6e6881a0fe790a5328813abb559dcba268fbbe6e428783271ce752e1b21bedd8b70d7c7ca741651853bcc411ff5099d7cb3dee3ee072fd53bc32b597f0deff17ceb2cd47448bf1432f5bfdc022435060208d9cbd0f9af4dd89bbd62cb05ad865c3bd6b691ef5fa04f5498d32004874acf51385eea2e98e23f9d4b440b00bdbd972f049c559b4934bbbb429029adf8892c7f3c1a86d5d2be4db51cfe098ea31451ea6965fe49e06ada1c6734c3d180068816e8c85e02ecb55f6a4e558590c52b04c768f5d22682b7eb2cfc18c308542e67b85a4831130409b5ae2cb15c18873ab269b3560f1a4d09d723f82dcd4051db4fcaefbfcf923fcfb35befc8777a7afbf7a4ffbee41aeb53172e1b67efbaad4e12e75a08e3bd85b16af909d3262e3d43085a8f54dd8c00047394265d0368323e82bc345da1477026f3dbc5e05d85723ea77b4dd7b98dbf6bbe7c8988eae224ece369106513fc1b3604b6cfb5ac49da226e6269a52d6aa30a3ae70d06dfce27cb497083568cf4e362be2417328107ed01fbf63e1667ba221ee89c4fa37e9460eafcbb15f6f9184c09fff97ba4ca183b46246d354ef47f4423dbbda454738effb3efe0cc0cd7381d73e0d768bb1e7056fce119bf4877ca07c2e959027285c3a24f3b58b8ff31acc3e30f5c09ccdfad7b762ce5e7388d15f154db726a68b8a0f4b9bdb943d9fd9aef8c1a4c7d89709e5b931804d6b32dcc42fc0790c77e0db3c86623f89cc961ad3a41a80a42a5c1700ff2e6c70ce03fdbe498beb8184bb3a2ad5eb806d349fdfbd6bd066133977790df768abfcd02806d33bd5507ec279f5cea71734d9990e3cebee3e2e631caa21253f20a75b5e59f626f4f5d0da425e4387d73f4ab7179b753f396583f39b6b849c0bde5179c15b82d459d1d06e0d929a0b5d6e8d51453b12edc59c402bdcd79872b7a3e53f67ec37c2ad9a024668f62e1c0def0f8b1d11836fc20fe732327721a0b061466240b7fd5de687c01f08f186da67b867767b401395acefa618c012d72f0cee463e0eb73ac8a8b94fdbcb759afc4b337c47eb65a4105986dc82fdd45e65f9fb4a131eaa59257e2e4d28b7463575d9e641df173cfebf32a3cecee2e77d1b46b317b6d55e5c3103893a019d340ee5e91d55365f70ad36eb6d7fed94a052187d856231873df88093d10b4724a635372b4bf0232a88b9d7d3b7681a523d2f8d82a921c6bcd687cdf2aa19aecc202b87fb9fcd1997b73afde048c69e7c6b5c122435bd5df8e6b197042d0e6ab2770551f0cdaf008cbf5a25468aca996d8c13f3de549afbacc363b55e94ee10c1bde4c7d7a55bc014935b65267de17ffe5592cc5ce641a2de2a303cc557bd829a19651971eeac586654b282f92486c59dc8ef335c6a9ecfb178c3e0d6ea6df5c2e84604ca89b2fe5902a26ac3274be48259fcabf0dde398c2821cfedd1c93cb05e9a9cb7dd3107cbac001af08f0a64727447e17d6cf5678dcac770dfe7af08de1e1f16dfbe4df37675a54b0a9c2cdb32b2eaa54850b9e338139974f49e2b3c02646529170e69622d64f300cda3903ea6a83923de195ef2b69528ffcbf182a0297c0ee5e11916e60190981625e819739226f68b924237532175d9b05a6859a92dd78e7abcca7cfc10497857a12f07e5d0fcad158ed0b9b76663902c6508a9f51de19204536de5830a497fa9a75d8a0aa610c868960fa868a45afa466fd70834864b6b85f80ac6ee226920b702415579e8fe1129e60a35dd3dee6ba67a2151c027137ce7ce7c296678360463408fc6f02ea00333d2fec8323fe4cfe2a70c4d4cfb169b5954e31c575474d29d4167a6d3a4fc2ba5a8963aec24e775056c34d7b5ad1a9287f22d55b1d7d22e72ae79c9d55ab4ca67dd05c63e2c0cde5342b79a9d838106b416ce9a858fb8cdfa30174c18314485fe46d2151bc94f43b99544998c127fe504919cc9d9c105544c72b7265314a35dc38e04b282301cd4780352a978fadb080d8d2493ae0b92493be110700f943e63de82e68e129e894a2182a2fcfac30f770ce4f0601f57dc22c01330d409349b4c44b4a627dfc74b8a5c6a066a032fc93c7c7ee1aaeb17a7bfaefc5197e4355a4bd41cdd8ac651fae7d4d2d1c0713ffe1399199275c27da96ca6f959550c1040d46364c7f65fe3af541a43042dae394be74bef1515e25ce1c1d126295b44dc05dbc4a658d076ca39f35504966aa8872008447f38f9259099d0056b0c057ce9926ac208984fb6875b3c1f440e37a1ab9c6cb0957e39972596db5e3eb10252434bff0738aa107152cd4184329ee63dd7cdfdcbb3a3548e3c5431cae2c2ca85f1cd30f2aeeedd04
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/DeserializeAddrMan/fuzz.cpp b/depend/zcash/src/fuzzing/DeserializeAddrMan/fuzz.cpp
new file mode 100644
index 000000000..2ffdec11d
--- /dev/null
+++ b/depend/zcash/src/fuzzing/DeserializeAddrMan/fuzz.cpp
@@ -0,0 +1,33 @@
+#include "addrman.h"
+#include "streams.h"
+
+
+#ifdef FUZZ_WITH_AFL
+
+int main (int argc, char *argv[]) {
+    CAddrMan addrman;
+    CAutoFile filein(fopen(argv[1], "rb"), SER_DISK, CLIENT_VERSION);
+    try {
+        filein >> addrman;
+        return 0;
+    } catch (const std::exception&) {
+        return -1;
+    }
+}
+
+#endif
+
+#ifdef FUZZ_WITH_LIBFUZZER
+
+extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) {
+    CAddrMan addrman;
+    CDataStream ds(Data, Data+Size, SER_DISK, CLIENT_VERSION);
+    try {
+        ds >> addrman;
+    } catch (const std::exception &e) {
+        return 0;
+    }
+    return 0;  // Non-zero return values are reserved for future use.
+}
+
+#endif
diff --git a/depend/zcash/src/fuzzing/DeserializeAddrMan/input/peers.dat-minus-4-byte-header b/depend/zcash/src/fuzzing/DeserializeAddrMan/input/peers.dat-minus-4-byte-header
new file mode 100644
index 000000000..ce52b0a1b
Binary files /dev/null and b/depend/zcash/src/fuzzing/DeserializeAddrMan/input/peers.dat-minus-4-byte-header differ
diff --git a/depend/zcash/src/fuzzing/DeserializeTx/fuzz.cpp b/depend/zcash/src/fuzzing/DeserializeTx/fuzz.cpp
new file mode 100644
index 000000000..39b66228b
--- /dev/null
+++ b/depend/zcash/src/fuzzing/DeserializeTx/fuzz.cpp
@@ -0,0 +1,43 @@
+#include <bits/stdc++.h>
+
+// actual fuzzer
+
+bool fuzz_TxDeserializeFunction (const std::vector<unsigned char> txData) {
+        CTransaction tx;
+        CDataStream ssData(txData, SER_NETWORK, PROTOCOL_VERSION);
+        try {
+            ssData >> tx;
+            return true;
+        } catch (const std::exception&) {
+            return false;
+        }
+}
+
+#ifdef FUZZ_WITH_AFL
+
+// AFL
+
+int fuzz_TxDeserialize (int argc, char *argv[]) {
+        std::ifstream t(argv[1]);
+        std::vector<unsigned char> vec((std::istreambuf_iterator<char>(t)),
+                                         std::istreambuf_iterator<char>());
+        if (fuzz_TxDeserializeFunction (vec)) { fprintf(stdout, "Deserialized the transaction.") ; return 0; }
+        else { fprintf(stderr, "Could not deserialize the transaction.") ; return -1; }
+}
+
+int main (int argc, char *argv[]) { return fuzz_TxDeserialize(argc, argv); }
+
+#endif
+
+#ifdef FUZZ_WITH_LIBFUZZER
+
+// libFuzzer
+
+extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) {
+    std::vector<unsigned char> vect(Size);
+    memcpy(vect.data(), Data, Size);
+    fuzz_TxDeserializeFunction(vect);
+    return 0;  // Non-zero return values are reserved for future use.
+}
+
+#endif
diff --git a/depend/zcash/src/fuzzing/DeserializeTx/input/coinbase.bin b/depend/zcash/src/fuzzing/DeserializeTx/input/coinbase.bin
new file mode 100644
index 000000000..ca36e8cad
Binary files /dev/null and b/depend/zcash/src/fuzzing/DeserializeTx/input/coinbase.bin differ
diff --git a/depend/zcash/src/fuzzing/DeserializeTx/input/manyoutputs.bin b/depend/zcash/src/fuzzing/DeserializeTx/input/manyoutputs.bin
new file mode 100644
index 000000000..e726fb74a
Binary files /dev/null and b/depend/zcash/src/fuzzing/DeserializeTx/input/manyoutputs.bin differ
diff --git a/depend/zcash/src/fuzzing/DeserializeTx/input/sapling.bin b/depend/zcash/src/fuzzing/DeserializeTx/input/sapling.bin
new file mode 100644
index 000000000..2ac9414f2
Binary files /dev/null and b/depend/zcash/src/fuzzing/DeserializeTx/input/sapling.bin differ
diff --git a/depend/zcash/src/fuzzing/DeserializeTx/input/sprout.bin b/depend/zcash/src/fuzzing/DeserializeTx/input/sprout.bin
new file mode 100644
index 000000000..b35aa0d5a
Binary files /dev/null and b/depend/zcash/src/fuzzing/DeserializeTx/input/sprout.bin differ
diff --git a/depend/zcash/src/fuzzing/ReadFeeEstimates/fuzz.cpp b/depend/zcash/src/fuzzing/ReadFeeEstimates/fuzz.cpp
new file mode 100644
index 000000000..e066fc792
--- /dev/null
+++ b/depend/zcash/src/fuzzing/ReadFeeEstimates/fuzz.cpp
@@ -0,0 +1,34 @@
+#include "txmempool.h"
+
+#ifdef FUZZ_WITH_AFL
+
+int main (int argc, char *argv[]) {
+    CFeeRate rate;
+    CTxMemPool mempool(rate);
+    CAutoFile est_filein(fopen(argv[1], "rb"), SER_DISK, CLIENT_VERSION);
+
+    if (mempool.ReadFeeEstimates(est_filein)) {
+        return 0;
+    } else {
+        return -1;
+    }
+}
+
+#endif
+
+#ifdef FUZZ_WITH_LIBFUZZER
+
+extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) {
+    CFeeRate rate;
+    CTxMemPool mempool(rate);
+    CAutoFile est_filein(fmemopen(Data, Size, "rb"), SER_DISK, CLIENT_VERSION);
+
+    if (mempool.ReadFeeEstimates(est_filein)) {
+        return 0;
+    } else {
+        return -1;
+    }
+}
+
+
+#endif
diff --git a/depend/zcash/src/fuzzing/ReadFeeEstimates/input/fee_estimates.dat b/depend/zcash/src/fuzzing/ReadFeeEstimates/input/fee_estimates.dat
new file mode 100644
index 000000000..c3c5961ac
Binary files /dev/null and b/depend/zcash/src/fuzzing/ReadFeeEstimates/input/fee_estimates.dat differ
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/dict b/depend/zcash/src/fuzzing/UniValue__Read/dict
new file mode 100644
index 000000000..bbf7ec5df
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/dict
@@ -0,0 +1,7 @@
+kw1="{"
+kw2="}"
+kw5="["
+kw6="]"
+kw7=":"
+kw8=","
+kw9="\""
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/fuzz.cpp b/depend/zcash/src/fuzzing/UniValue__Read/fuzz.cpp
new file mode 100644
index 000000000..90409b147
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/fuzz.cpp
@@ -0,0 +1,29 @@
+#include "univalue.h"
+
+int fuzz_UniValue_Read(std::string notquitejson) {
+    UniValue valRequest;
+    if (!valRequest.read(notquitejson)) {
+        return -1;
+    }
+    return 0;
+}
+
+#ifdef FUZZ_WITH_AFL
+
+#error "The AFL version of this fuzzer has not yet been implemented."
+
+int main (int argc, char *argv[]) {
+    // not implemented
+    return 0;
+}
+
+#endif // FUZZ_WITH_AFL
+#ifdef FUZZ_WITH_LIBFUZZER
+
+extern "C" int LLVMFuzzerTestOneInput(const uint8_t *Data, size_t Size) {
+    std::string s;
+    s.assign((const char *)Data, Size);
+    return fuzz_UniValue_Read(s);
+}
+
+#endif
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail1.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail1.json
new file mode 100644
index 000000000..8feb01a6d
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail1.json
@@ -0,0 +1 @@
+"This is a string that never ends, yes it goes on and on, my friends.
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail10.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail10.json
new file mode 100644
index 000000000..5d8c0047b
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail10.json
@@ -0,0 +1 @@
+{"Extra value after close": true} "misplaced quoted value"
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail11.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail11.json
new file mode 100644
index 000000000..76eb95b45
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail11.json
@@ -0,0 +1 @@
+{"Illegal expression": 1 + 2}
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail12.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail12.json
new file mode 100644
index 000000000..77580a452
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail12.json
@@ -0,0 +1 @@
+{"Illegal invocation": alert()}
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail13.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail13.json
new file mode 100644
index 000000000..379406b59
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail13.json
@@ -0,0 +1 @@
+{"Numbers cannot have leading zeroes": 013}
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail14.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail14.json
new file mode 100644
index 000000000..0ed366b38
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail14.json
@@ -0,0 +1 @@
+{"Numbers cannot be hex": 0x14}
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail15.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail15.json
new file mode 100644
index 000000000..fc8376b60
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail15.json
@@ -0,0 +1 @@
+["Illegal backslash escape: \x15"]
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail16.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail16.json
new file mode 100644
index 000000000..3fe21d4b5
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail16.json
@@ -0,0 +1 @@
+[\naked]
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail17.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail17.json
new file mode 100644
index 000000000..62b9214ae
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail17.json
@@ -0,0 +1 @@
+["Illegal backslash escape: \017"]
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail18.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail18.json
new file mode 100644
index 000000000..edac92716
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail18.json
@@ -0,0 +1 @@
+[[[[[[[[[[[[[[[[[[[["Too deep"]]]]]]]]]]]]]]]]]]]]
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail19.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail19.json
new file mode 100644
index 000000000..3b9c46fa9
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail19.json
@@ -0,0 +1 @@
+{"Missing colon" null}
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail2.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail2.json
new file mode 100644
index 000000000..6b7c11e5a
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail2.json
@@ -0,0 +1 @@
+["Unclosed array"
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail20.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail20.json
new file mode 100644
index 000000000..27c1af3e7
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail20.json
@@ -0,0 +1 @@
+{"Double colon":: null}
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail21.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail21.json
new file mode 100644
index 000000000..62474573b
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail21.json
@@ -0,0 +1 @@
+{"Comma instead of colon", null}
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail22.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail22.json
new file mode 100644
index 000000000..a7752581b
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail22.json
@@ -0,0 +1 @@
+["Colon instead of comma": false]
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail23.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail23.json
new file mode 100644
index 000000000..494add1ca
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail23.json
@@ -0,0 +1 @@
+["Bad value", truth]
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail24.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail24.json
new file mode 100644
index 000000000..caff239bf
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail24.json
@@ -0,0 +1 @@
+['single quote']
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail25.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail25.json
new file mode 100644
index 000000000..8b7ad23e0
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail25.json
@@ -0,0 +1 @@
+["	tab	character	in	string	"]
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail26.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail26.json
new file mode 100644
index 000000000..845d26a6a
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail26.json
@@ -0,0 +1 @@
+["tab\   character\   in\  string\  "]
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail27.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail27.json
new file mode 100644
index 000000000..6b01a2ca4
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail27.json
@@ -0,0 +1,2 @@
+["line
+break"]
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail28.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail28.json
new file mode 100644
index 000000000..621a0101c
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail28.json
@@ -0,0 +1,2 @@
+["line\
+break"]
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail29.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail29.json
new file mode 100644
index 000000000..47ec421bb
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail29.json
@@ -0,0 +1 @@
+[0e]
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail3.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail3.json
new file mode 100644
index 000000000..168c81eb7
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail3.json
@@ -0,0 +1 @@
+{unquoted_key: "keys must be quoted"}
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail30.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail30.json
new file mode 100644
index 000000000..8ab0bc4b8
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail30.json
@@ -0,0 +1 @@
+[0e+]
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail31.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail31.json
new file mode 100644
index 000000000..1cce602b5
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail31.json
@@ -0,0 +1 @@
+[0e+-1]
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail32.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail32.json
new file mode 100644
index 000000000..45cba7396
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail32.json
@@ -0,0 +1 @@
+{"Comma instead if closing brace": true,
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail33.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail33.json
new file mode 100644
index 000000000..ca5eb19dc
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail33.json
@@ -0,0 +1 @@
+["mismatch"}
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail34.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail34.json
new file mode 100644
index 000000000..3f8be1728
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail34.json
@@ -0,0 +1 @@
+{} garbage
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail35.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail35.json
new file mode 100644
index 000000000..de30ca5c4
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail35.json
@@ -0,0 +1 @@
+[ true true true [] [] [] ]
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail36.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail36.json
new file mode 100644
index 000000000..f82eb8e1f
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail36.json
@@ -0,0 +1 @@
+{"a":}
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail37.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail37.json
new file mode 100644
index 000000000..3294dc3a4
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail37.json
@@ -0,0 +1 @@
+{"a":1 "b":2}
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail38.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail38.json
new file mode 100644
index 000000000..b245e2e46
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail38.json
@@ -0,0 +1 @@
+["\ud834"]
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail39.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail39.json
new file mode 100644
index 000000000..7c9e263f2
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail39.json
@@ -0,0 +1 @@
+["\udd61"]
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail4.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail4.json
new file mode 100644
index 000000000..9de168bf3
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail4.json
@@ -0,0 +1 @@
+["extra comma",]
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail40.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail40.json
new file mode 100644
index 000000000..664dc9e24
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail40.json
@@ -0,0 +1 @@
+["�…¡"]
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail41.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail41.json
new file mode 100644
index 000000000..0de342a2b
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail41.json
@@ -0,0 +1 @@
+["ð�…"]
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail42.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail42.json
new file mode 100644
index 000000000..9c7565adb
Binary files /dev/null and b/depend/zcash/src/fuzzing/UniValue__Read/input/fail42.json differ
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail5.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail5.json
new file mode 100644
index 000000000..ddf3ce3d2
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail5.json
@@ -0,0 +1 @@
+["double extra comma",,]
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail6.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail6.json
new file mode 100644
index 000000000..ed91580e1
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail6.json
@@ -0,0 +1 @@
+[   , "<-- missing value"]
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail7.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail7.json
new file mode 100644
index 000000000..8a96af3e4
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail7.json
@@ -0,0 +1 @@
+["Comma after the close"],
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail8.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail8.json
new file mode 100644
index 000000000..b28479c6e
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail8.json
@@ -0,0 +1 @@
+["Extra close"]]
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/fail9.json b/depend/zcash/src/fuzzing/UniValue__Read/input/fail9.json
new file mode 100644
index 000000000..5815574f3
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/fail9.json
@@ -0,0 +1 @@
+{"Extra comma": true,}
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/pass1.json b/depend/zcash/src/fuzzing/UniValue__Read/input/pass1.json
new file mode 100644
index 000000000..70e268543
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/pass1.json
@@ -0,0 +1,58 @@
+[
+    "JSON Test Pattern pass1",
+    {"object with 1 member":["array with 1 element"]},
+    {},
+    [],
+    -42,
+    true,
+    false,
+    null,
+    {
+        "integer": 1234567890,
+        "real": -9876.543210,
+        "e": 0.123456789e-12,
+        "E": 1.234567890E+34,
+        "":  23456789012E66,
+        "zero": 0,
+        "one": 1,
+        "space": " ",
+        "quote": "\"",
+        "backslash": "\\",
+        "controls": "\b\f\n\r\t",
+        "slash": "/ & \/",
+        "alpha": "abcdefghijklmnopqrstuvwyz",
+        "ALPHA": "ABCDEFGHIJKLMNOPQRSTUVWYZ",
+        "digit": "0123456789",
+        "0123456789": "digit",
+        "special": "`1~!@#$%^&*()_+-={':[,]}|;.</>?",
+        "hex": "\u0123\u4567\u89AB\uCDEF\uabcd\uef4A",
+        "true": true,
+        "false": false,
+        "null": null,
+        "array":[  ],
+        "object":{  },
+        "address": "50 St. James Street",
+        "url": "http://www.JSON.org/",
+        "comment": "// /* <!-- --",
+        "# -- --> */": " ",
+        " s p a c e d " :[1,2 , 3
+
+,
+
+4 , 5        ,          6           ,7        ],"compact":[1,2,3,4,5,6,7],
+        "jsontext": "{\"object with 1 member\":[\"array with 1 element\"]}",
+        "quotes": "&#34; \u0022 %22 0x22 034 &#x22;",
+        "\/\\\"\uCAFE\uBABE\uAB98\uFCDE\ubcda\uef4A\b\f\n\r\t`1~!@#$%^&*()_+-=[]{}|;:',./<>?"
+: "A key can be any string"
+    },
+    0.5 ,98.6
+,
+99.44
+,
+
+1066,
+1e1,
+0.1e1,
+1e-1,
+1e00,2e+00,2e-00
+,"rosebud"]
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/pass2.json b/depend/zcash/src/fuzzing/UniValue__Read/input/pass2.json
new file mode 100644
index 000000000..d3c63c7ad
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/pass2.json
@@ -0,0 +1 @@
+[[[[[[[[[[[[[[[[[[["Not too deep"]]]]]]]]]]]]]]]]]]]
\ No newline at end of file
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/pass3.json b/depend/zcash/src/fuzzing/UniValue__Read/input/pass3.json
new file mode 100644
index 000000000..4528d51f1
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/pass3.json
@@ -0,0 +1,6 @@
+{
+    "JSON Test Pattern pass3": {
+        "The outermost value": "must be an object or array.",
+        "In this test": "It is an object."
+    }
+}
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/round1.json b/depend/zcash/src/fuzzing/UniValue__Read/input/round1.json
new file mode 100644
index 000000000..a711e7308
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/round1.json
@@ -0,0 +1 @@
+["\u0000\u0001\u0002\u0003\u0004\u0005\u0006\u0007\b\t\n\u000b\f\r\u000e\u000f\u0010\u0011\u0012\u0013\u0014\u0015\u0016\u0017\u0018\u0019\u001a\u001b\u001c\u001d\u001e\u001f !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~\u007f"]
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/round2.json b/depend/zcash/src/fuzzing/UniValue__Read/input/round2.json
new file mode 100644
index 000000000..b766cccc6
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/round2.json
@@ -0,0 +1 @@
+["a§■��"]
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/round3.json b/depend/zcash/src/fuzzing/UniValue__Read/input/round3.json
new file mode 100644
index 000000000..7182dc2f9
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/round3.json
@@ -0,0 +1 @@
+"abcdefghijklmnopqrstuvwxyz"
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/round4.json b/depend/zcash/src/fuzzing/UniValue__Read/input/round4.json
new file mode 100644
index 000000000..7f8f011eb
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/round4.json
@@ -0,0 +1 @@
+7
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/round5.json b/depend/zcash/src/fuzzing/UniValue__Read/input/round5.json
new file mode 100644
index 000000000..27ba77dda
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/round5.json
@@ -0,0 +1 @@
+true
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/round6.json b/depend/zcash/src/fuzzing/UniValue__Read/input/round6.json
new file mode 100644
index 000000000..c508d5366
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/round6.json
@@ -0,0 +1 @@
+false
diff --git a/depend/zcash/src/fuzzing/UniValue__Read/input/round7.json b/depend/zcash/src/fuzzing/UniValue__Read/input/round7.json
new file mode 100644
index 000000000..19765bd50
--- /dev/null
+++ b/depend/zcash/src/fuzzing/UniValue__Read/input/round7.json
@@ -0,0 +1 @@
+null
diff --git a/depend/zcash/src/gtest/data/tx-orchard-duplicate-nullifiers.h b/depend/zcash/src/gtest/data/tx-orchard-duplicate-nullifiers.h
new file mode 100644
index 000000000..59575b5ad
--- /dev/null
+++ b/depend/zcash/src/gtest/data/tx-orchard-duplicate-nullifiers.h
@@ -0,0 +1,4 @@
+#ifndef ZCASH_GTEST_DATA_TX_ORCHARD_DUPLICATE_NULLIFIERS_H
+#define ZCASH_GTEST_DATA_TX_ORCHARD_DUPLICATE_NULLIFIERS_H
+const char *txdataOrchardDuplicateNullifiersTestVector = "050000800a27a726b4d0d6c20000000029000000013412000000000000000000000000000000000000000000000000000000000000000000006a4730440220635eb46b6e39e2e66e423ff2be3cee47a3d45553674c5f0db17f0195eb10ba1f02207a2a345a516cd6503134cca8444f7147472e00daab65b38040110635a31b71830121030b4c866585dd868a9d62348a9cd008d6a312937048fff31670e7e920cfc7a744ffffffff0000000225836c1232c2681cdacda2c8387f65f37e4da30b0fe4948e2570dbf272011286511f3502e919c268a04ff7558fc800332b1da91f237e8c7ecb93e8fe6ed4912705b621c8fac53089c14cc69b08df7ab89a6731be73eafbe0742c0bb1b0c60994ff004a0312f55e9440c5c931c06a0fd34a56fbda51f3c5737cdcd00027932d17536878d11528176a7daf3a7c9e38487abe1298b92f52a54de917e010e7de448549ae845e672f1cb7c2f7b11483593eaa816a22b8d69289e968f85672c37e3d636c6e186d3c1264f119e8616b1361dcbb9ef35f64e9331897c96ecd90a7a2bd0dd32ca50d7d7630084c991fb1a9d4b1a5aec98317a28a61343ef1e7e22b976e3a3f87039c42eff54b69bf168ba714ee4c09ce5ebe8019d6dc4c4f6c4abb83cbcb7c5068a5db25a2c5b9979266ce355a0444dc7b3aae2469ce6bd7072f24dfde6d20afd5de99f0c05610c463554931723633f5584de7c052be89821c3efd7dcd89a5825c73b849bc985c9beceb9dd976893121536ca1ce28247e26b5ebac74fca33cd012097b31d95494e3adbc7c49c45b46a81a39d9b27d3f4a97e248dc4bcf3c9a67c08f8cde5ac87e68830d4512ff1201e5785ae275ac55e922bed1f7630e9165b4d38aa6cab7421d585224b4a3f33117f046a809728290df364bd28e0fe7933fb1b6ed9f8fd16a00f449a5b6de7b6734465086f7e50530ff62a5e9ac5b4c006a09a289798799752d4842c83384a62229956c36c8d9da5c6c0216578ace27bfe884e2a27f815b8c7b39580ea186923c7134f43f2ac504652ba37c9b07f3f4cb22fc1616d563c0bd5e84b38b5ecaff60f2fb06f2076946021f06c8c125671360517d433e71ad2b0636dc696c1897bbd0eb07771bf3c01374e57b57180c2c93279d2b44b6a18dd1ad9e83a9576924050979b01522d0e984757866b27ca41a9ebb4c0f6090a6d34f7e0b6da64e2633107667206443c2700cad9d6afcaaa700d1a57c6afbcab4a34bc9447375600b634f69bd8af8613f791912b827788a9135a22cdf99a8457cca28504cdedbd0560957d4f4cf2cac185a9890c679d06789abc4c546fedd4c00442429969352044de83c83dc742d5ecf9466316b655223175a6027f302202b10c30dbeb810e22fe6b0ac665008ddd5bd95461e087c4586dfe2dd75b1cf7de1cc1c7bd878de26a410dfdf096201cc82511f3502e919c268a04ff7558fc800332b1da91f237e8c7ecb93e8fe6ed49127b48a27b2b77f8ab9181ded3bd8995b76688b0576993b1040d951773205331d21e1bc754d5abea66a5e4b0a25a7a89149d38e0e9e495f92b53dde65c011072f2d274a88c8e37e3488e6ed5b0cecdbef35121e0ebfd6e868afb1c95e4093239f3ae89c2f73b89871b8a82ec208b80c2350a18b9641b2b33301509a3901b76d754649a4f68b3030821e5aa136e9a01b133573b5aa153ce593d07d1bd3d7b9fc0f96dd237f61ac0b6ab170c28ea017dbc6e0e06121a5b520f1b23cdf42e7d66e591141db0225ce4b60be075a1d9a749358a4ed5ab84f678718ba6d115ac808f920411d38e96e360cff8cee68a5b915064c87cbd782233a21ebddbea50c29303a7942b9b81250cfffd5abc3c0d48fb85254e1a4e50695402121cb223df3d00ee940c3978a5c557e03b5136abb39b943e6830a2cfb1cda752813956e56c5c9de401ba21af69fde11cf74c8d3ed4d6878d0f893d3eac6047ab2577a4632f76440e9a62051e8ac58c39a7e319efc647a3c8fa7403a2b31f3d66146110f08c18ee7694c74b478f15042805e4ea4a36d38fd08469f97483047e4e097d5853204129cde2d0b83019795121de68108c6b6931797f48a2da4850d6721eeb95a0a23d2ff049d26c7f9fe196c9a6bde16ff4435f27862c3843cc71267de9e271b35e7a5fc07d9213330ab9cc168bd0d45c44d8b396b7b2ddce57fc6edf63b1a87a38e3bdfd16f0cc2de1b468505b57edb493b396eec136b08a1d01981908201ed7b60642318b5b96f155c78a9f6ca6912c6c8dcb418eb37780bbb324dbf3969d667eaf0897e5672b549d5b2b4b83eb9cc5561fdae06f26e92356fad5ca90d7ecf0af5e4e311c1c1838c17d104280bb3fb0854df6efb2424e72592f2baddaf70d71a38612fed5d28f356ffe494493b495e1d6267ad5b385aafd0feca946da1495aec01c9d85c874ae4112913835d8b54fbc418afd2858c2b96db1843454f1c06be6bfd6f8b722fa48a474cdd0fc57d678b9bfd492e3bee46180088b68c8ed4d60eac3eebceb1ee47eefda42f4d8c4f7c35f706714e93ac5ff4743e82030000000000000000ae2935f1dfd8a24aed7c70df7de3a668eb7a49b1319880dde2bbd9031ae5d82ffd601c0f09d2aa4957d19ca6740c1baf596dd20794eb58b966da0bd782909fac7edc34c395ca6f9607dd2f6d1ad1327ae5ced89d0ce25cd517cf6f139e9562b789121a4d57f0829b7f9a48a249bc2fd1e507bccff14a192076f1f6d6b3d9dbd1c3bbaedd211456491579f5bf70625ee9a6cacdf85aa3a4f9495acddff0e55282aa6227b71d6902bd784f61ded33c7b364b2bb798efece0b248ded330937cc7c16f97b2d2b1a16f5537d92e68328c86d3280c73ded13db2f4fb7c19c1cc8cebbad4381afa8c46dc22957cb1b410b46793a4bb5e834f202164ad4496477a990cb3b63fba0ccdd2260f6060a95a39c03de4f156bfea0f83b8bbef9338c697cf9ad7f9b6335e6d1ab94808ce4935aaa1c9b99bfe42fc7b633e899d219bf0d5c2379c57f093ba7178d3d7ac8cc460ab1aa995b9f70e0c3931cd5dbbcb6cc02522d8fb369dbafbd5417ad35357ec6b42de0b2a0d97679bb2d5d5629f5844545f7a2ab57b00b1e422b9b8b92aa734996b1530dd1befdfc54fc30b766d65b6096c9e3c09183e815557f09f2e47524664b5d10d3601ed882e0e83a22523fa6089f77818046cf1b188acc72395db9b59512b302e25039f3ac0b929c80810dd2e6337eda9343b779211f8bdc1b26b2b46865744281b478a64caa4e35387c48652fab368fa4454290539925b6f7166b245790c41c46e391b1a651b23b2f44e29fe6ba2919577efe0820ce121331a65c158062b548563032d5a9ce7b9f3c18defdfcb2e8377285ee42f33c7349df93cf12a6a7f7989878f5fe903af8928714cba22329d545a101c8c9c5ebaf7dde205abb774e3195e63cec8206a990abd1a44505e8c1ec51ab45b4ea3d377a6ee8750cc284a3b6def81e1f3df682b8b5b3c2a4b743f6a91b9fb3d478566d1cba9bd370b2efa98851481cebd0dc85b626ce1b5b918e4aabbd347472e247b1f970808ac1d2948dfd895bd9ce1288c81a71cefb850582d5f0c0cfdc9473d09ea65795f54a5fe563d6eb7a2686b4d476dc6b6a0eb5e46bac5bae4623b22a7b1d79371d602e78a052ca66e5ad145e8f4e6486e7c4d580f90afe79711e3c2a098f0df66562fd7bcfd7f3a1c80b929ce0ad0236aadf4b97ab0c29f6af819810727b7d499430522a6ba741aae0d7c699f22cf5cc72e736224a057132c5a19a29b5b8a9f39351f20140cc86102cdb302a227172f1285ac7f4f4b13ab24caef6696023705f1a5888d5954e37f2e9ffd5c591f8466fbdfb223d656e06865b331cd0c9403d7c7130556db3478d7c1bec4272ebc59ec918f8b18e695027565601a0439e3ac2fac8839dd844db85f2c1069ad12b8822a60293f7f5981d956bc0cb0e234d710064cef11e9046af3887b792a4de4717e6374f1aa4fa5ec9b6684e2cd3e10d3928aba1ed00ac468d0c53197978ca2b0d940d7deb6fce99bfa5c9505edcd3c91ff14f15cf9d592a4e15bef8abe7e71b897d7e9b3a042caa31c573a32922685c06da5709be52258d03987a2863eae4a766cbcf60b5e7e34ce7943dd2314780c608489111e3edfc0f9b09a57479ea2bab89891820c99ae4a9fffd8c5dda927a438cf810fddef5066340a5311df581b1f4f9c2b0b1042752334c716fe432edc83e45eafc75b152e834ead2819f9ee0d27307a6d204e1696d142fa12d448802b3e8c0008c3876c36761dc61d46e94eae5a2c381ced0f99a0368a6453d7de0c9bb993714def16c117ee2e989996d3eaea55e5e4b93dc40d00e3ae130498daab2a83e1ef7dafd8510844a95f67767e0279e7076e1dbfc9a4e16843faa193c7d94a2978141e7b184b5ad8347de9bf55e88e418f2b3d1a18784a915dacb6cc2dcda38f344e98f5eb5727243f7193c7d0a8788f2c75734cb84734c3d05816f3ab9fd0033cad3ee26bb62229bdd73e1fcc8c16a06c27a3c263af1c4c6fea3395764207b52c3efb5f45478ffc5bcc41327685d3e11462e0f9ef292e4095b4ed7d74289a96e1ee3d830d5af3f85dcb5539ae34672eea10a0768f39129b35a2550aab89ef98e43755f69ecc6e1f90f297261cf70d35b5171b5eaf6fffdac007183d1ebb36a2a1e2adb1d427ce90899a57826055a1c54f0d38e42c349ac306fa88778495700ca91bf0d3eadc94c5c0df3cb42fa392f8bdf9c625c8d0d4df71b1451fbc2c23908a54edbde0d2b5a43cb93dfd01118fd558c92de61dd5122699a7f65e6ab2c02d83e8fd5e8e46c30091cf5cc5f36248aad69083b413d75a11b950e85b985525810fac7114a418733acd974515ddafb1898000c07c6b89bfb6e61bc9b19dedcba7e14ad67b46ca2722aa55ea42b4925c1daf3b12470dcdfe05b4a2e10929657699082054b2555acdf8eca595d8543beceefc4e4ab84a549ec547e7fb2cd77a33b181b7283a4e9c156285453cfe07355ebaa19adb0e8962251edae40b2a53ac6f00d741942050934b61fda094d058495ca2cf555387eb1194f162f2773017f28f28bd6b1bf1df9aeab970abd9884712c98a9963b908a4d9b1bd3cffdb6723ee9e381a32bb9615b6dcc6c6fa6ed217885c0b6c7b651cbbb707c64938313195632e016ac8187ca55d4e8d68c51fc61c6e4486bdf273a61fa7e37e45fe5fb1f15d5b196aceec7dc15789aecc2c59e69f61c6894801a51ef3aa92717d24174fed2e8137ca233f5e5f8553427110bd7f9d22f1306d59fdc9e1975d4cd5ef2293601c630e18418880b5ace0234575f1876d23a40b2a7a11677c53a5f8e968a953b2098c0463c513482807797fe8b2fc9fd36bd107485b331596c6b06a9ac829cc7afb821629d60ab467ae990e361229ab84123d447b0e6fecba2bc99e4eb0b591bab9602a6ac8dfd62575d901cc797fa85bd538500e6edabc58e168a0475a20270017a237d947a60a5492390d672d568a70d2ea5a6a4133be200d9a05cc0a14dcceeafb2f885ad6f7d43302447a7e06c56d6d4ec194427b4e38464d509a91b868534fd40721d45790ebc56f0fe8f65fdbb0c77e8f554429b6cb8e48c17672613e78a691246321dc763baa4ecff4563fe373af83bd29f4bea923b353dd48ba5085cc23773f64bc42b6e60ff439704fbe4e22e6b7efbdcd5d6a377be8c67fcaafa2fbb5e3375303a454f986f646b11cdfd697a305f9ac830636f48563cbfd46266c9d881a0c8dc5584ce14469cc3edcaddf4d0f309147cff5e92a768665dd1dbd02e7bc042e6970ad27842de31d8e07e9c1b41664cbb63aa5e40dace1757e5658380952d621cc93f6926e9230ab66272404f21c86d5376c0338fc2101d8ddce99957dc6ec0e627c1705e5b6f0e2798e74dae7c0146e8b9fa5b3b927a020bc9a49c8b72ca00b86380da2a0511fbd2055445597ed1346e7ff67f949e7f2cae60e717dd96a6d0e9662093a99e55a49dfe60ac596a8879ff1a0763b615a0e4f80c9d6e53ccde90bc56efc64af33d5f9a93aa820f6155fc851c7a299ca9e91610880eecadde5a50a3f5083965f1a0e4e1c01df28345023be61a6c541d38ce92e8c58590f2c20e51a18251a2abb1a967495bf623f7c196c6e68695f7f76942049a554332b0f519137a1050d46e128f888a5c1f1ca3f112ee80fbac7646330b332d60d97df3afc5f03747f4a25a138f6b3d9d9a88e0635321431769de9b7b41dee735e2e652f3d9212e08962ee1ae7d35260d5741cbb3be1e9e91872b4c604c08d64425239bdbf812363ed44bc272ed25af52b2fa6d929ebf410a810b7e906e0b4055d0e268016da370b90b599d46f1d20ec716a0cd9515c1afc9de28d3fc36b59e6b3dfd42185c03573dae734b6d2fcbb6f84c11e5d6e107813127464397b2a037be8e9966b5e922782b913b8e19024bce0efa8b3f4b7d677599737d698492c04ba7dfa5e5a5d64049dd384f75f156f3598314a5892b87abc598678ef3570fb45f3ee17d97cefc03dadae57cfce5e13e96c4af661f8d2a1c811f0ff74f2593bfbf165fd845ddc95259961a40b17bcbb367b13381a6f68451e4fde834c2bb2fdaafcd029612e26a53fb13fad7db508b26ea7753584fca8aeb2b9784c12d0e450bfa7ec20eb151b6f1f7305dd356ac0531799725c045b65b99ce92d833c14dfda3c8d49fe749e66730971372703142d71315ec1531f44f8901cc7ff1312084b28c1be42af5c28f61922fed0e5a92236e8c2f288a1c482c6a0d71f2b85acd6e586d0fc8ef6c1ec8062390a9b7f9d045bb83ca51c0c673f51236d923cf6f1abbd6ebeedd46d4f7f0f3b316df95d7d6093805a09387aa89d6068ba264ae1ca8fab309dde83f8dd6548822f95c888e5ff381567c90a6b1243734ca5066b3ec3c3e082c8369998769273a5033b19d37943a7ce439c8f8c44add8a924aa9883f9854f0af56a5575a56538580136f127f918c65deba4fdec4bb8ef8a40339a7148892893e863f98c61719c703f4beaea2047ea163f656a2319daae3c3d2c4a2bea21b9fcf102c1742776f65721a245e3b23339412bddb2fcdbeab0f60f754158063e54d4815106fc3d112f01116fd9692db3a181abd0f6f66dc84f2f38e3106c8f0ca41abff3d08bf44f1845075bd333f0f84b3e086b9f7e00243b5146303709882ea271230bb164742fe90f01b1eba4ac1af321a124eebcd6291e0361261456ee1abbac76b6e62e764e8a663aa32e615a1824fdb5d9d4e6833392b651fbef4862c6cec8e11007a21946d0e232e07bc5b218bd5bc5cd76bb4fe5a56cb8c6fabde7f0da2e3e403a4150361d0524d5b69f69eba264214371232aeaaffb27d1c7a1266378150a37677ad91de2413c4637b7b9d794bba4fb850880563c2a92d13eb64931d0315b6e6c562c18ee1d2e1688b141931f4486b192fc2fb809fb82303e90a2ead82d5c7b6acca1cc5d5f3ab732147166f7e5a9e1d6e1c8ac12aba7c063444ae5503785695dd74edea3102dc7529d4e337a00a4e535d368a7104677f05d281f12542220955dfbcb6264fd304ffa0333b0904c91f719c9a5d231eb6a49b70c8fbceadf8699701497e922c114bbae33abebc1bf006939edd29d8c19807d01596ce72b15e62cb554c95d7ee604be5268c5f595401c09f4c4fbe9066f150d8e8c8717e01e2c169cf625a198300d0d3b8d86248a439fc30da67efdaaf4ecad5b1d848e391b3fca717d5094dc640a68f8428a5bf1bf953d0b75050c17c2e7ce8dd485c2a682f27eed5a39a83e0a18e8c626ec39d464311fd2f8b246cdf34fa4ed3444d1d12c3279d605058f38232d1bc96501b0c4a8c59ac10dfff8a23ad570cffec2fb494587aa46e98beabea10036ccf080cc978b8c9cbb321b4dc7f8652d48502ab47d56919fe027db92cfd82b922dff85096a0c04577ee0272970e0b97b9f53c89b1a161ea0c228047749b706ce5afa782698302d249dec647a45a37ecb3ea80d1dc8ae7ef73b8b3a5271e01b9de086f47569834e72db443671e4bd3a80b10c9fe6df125bd7558232996d8111c6864f95cbd4cf14d69b1ae80ae4935eedcc89bbe9ff6d7ede9f451a67af802d0fdb7008604452b27af77ce6224f09b054de58d9520ff5cf789e7e02f978f9264dcf917ae77e6b7623fdc451e45faf0cc56f5c8161e79146d5d0bf164fe8073f47f0a7f7922d8d09bcfc5b9e97b71e2b716075611a3b2f694b5d05bafbf059271070cb10f2191a3a2e269a081dc40cef0c81768cc5ef0987dc7b7aff8c8adc3a59f7bc21e64c31350cd9098b32ab87268ab9ebb4b96a01878e5f1f82e49ef23e3669ef9f5360aa160281820a2692a071b25bcca59f70704c5f7a73234ccc23246cbd3624b695e88d2670907affb020602f32ba41a4d73d497395ff9d10854b28cd1ffe091afbe9a7c735a2af49fd4c7bec4028265a501e48b32d971f3b60873ce0fa9fc6065bd0f525ee1286d5a140a67217967a344f5b1f84e5b720a136111ae413c6bc00ad7a6ba1fc1f20d793c250c4f83b7d08144160f46885673da8700a38c6280774f291a1ab67583b16520ee7cfc9704d08dd3ad732fa695f7d4b143f05359dcced32da104e045506fbda8dd21cb8a2b5c0a19494d48845b681e6813c8f432c1c1393b0649cbb1085314c40e6a8382fb0b2ffff9f0a97db13c034ed2160369d943cf01e510ed222a5123e99732dd6b146ffa3c1d8ff9730783ef7bb086fc880d968be2afb30ed85a89cb4185e3ef463a8c71b56090f67e8ef9874f131db6468eedb8298528db47bd241c96c8987cd897c9e85b3f87d0be9c43d75e616a01093760e331867cf73cc7a67f75f35100dbfa46e4e78b5121748b81c1a2322d2d7cd8aa2c48697ee96fcc575f8b40a6fe61c1800e0873dd0df14a7485f95398d4245a286ac924957eb0ce74a416af94b169ad4a79da9504d2bf095fcbd5a3a6f92e3a4ca9b67ee550dd8ba55fa33901a946be046f90549e56a919e040dc9261b28ffccbced35257b0405097a640f29a263d62c0c94f9b98cbe11ab073ce104d28b11c5e925ce5638eabb6d09108e7d49a7f4103b8a85d3a66c93580c863e086d29ab15b5cb37975a22e57172251a4f5337ca90d3dc81dce59c9f07b1518226661239471693df4bcfd21c1a6868e552ecf1f4aa2a9e042deabc8f094cb8fc04d6ec285d2e1dd0fe62c55107cfca2e1b32306f211570aae671343b2c29fb7a1c74710e0c878e7e0ebd40af370b70380ea5ffd9010a3caab222b14cb22fff4133389dca9fefd20a535d92c4a52e4d8a88cb1f08fcb6d97d79aebb8a90b3d973049c56632fd4d9a2b0d3f8b2b9e36dd16c7658a91b4cb25ce3f000601fa9b00531d9cf4ab63df00c5d4a58e1a72ccee3c6e84f41a27f829e88729d8089bcf0b322f38abfc8e299269dcbfd9c46074cc6ecac0ca493dbd1ba2f22d52a0628a7f82c6b9a5bf2076d8088c9784447ac02e17cef38a693b950f2f5561ac2c2ec0fef3dddbc14c9a35afffa49c56995a91ee4d368e4277abe419c1a50b5f6101b5a1a11973975b38cddb4d830723157c7d8eff703984fdb14d1c3f36da4517924b11407a0c171e3be076027d3c7c6452670c03eb6b93ed9b6fba126df46af210d51c0069e401095c54bb802e828e39a5e3e9cca3fbad729110c92965d2d3a08067a013b9d787a906b86ea432821559b19b48206802e8f18791a06e04439db03a6f5192af7cf99f5ea60035ee5b8035630a089b36eb8b4dd761604bc87029a898f9fc82669f92c7bc995524818c0c4b3d17d72546e0d1b71e6411fc7248403f6acbd13253d24408fcf5b7934bfd99e55ae7bcd3a8e671f7d0d752184615e72d1ebffc61ee551a1e395514b3f72eb0011415bb53d5c4f59a109e308c52814f038cb62182812d72734904f4f3cf5ab07667389f458a88397311319d49a061f7226abf584333ec493d7477872a96bddc080c9dcbe4bc5a7f03209dc631093ef5e41cdc3792445959d1c6e1d57fc44a736075bccefb4c6e346e203e6690bf52d676f5011ff247f2e2ff810317d800f7fb169ed9efc0f9fa9c789fab866d1ff314d6314646d39a6aa4c7e70d03e2d5a7bcba041175842edab5d9511eca737df108addeee3c01799b3262d4aa9a9eb1de79c612835b94f624b19db7f85d85b91d79e50c19ed90827b0cb85b53edc3a7d707657214529f0b9e72cc6cd3177ed547b4e82ffe5b516dfb6042740f99b3f0abae8348a59a067fdaa347defe0279bceae40a9337036168239f90e1e5c402a4b8e69c95a69ca6842e3ff3fa01bc5e0e8f50c27f6af623c5d306968e57f76c925807f19f2d944e70421fe92fd1f82b986c2256baa3704019bd331e2fb6fc19f2541cd6eba0ca64832a134d58404522a24b5979290d35001c69a16b23c26124fdfa884ec005d10dface26b3bc5cf4b8843f50495f1d39c054551607f0de33b3927a68f10292a4a8ce3b1ebe39eccf6ef99fbd7a37e71ad24ae623617b39032d91ff0022e6faadcf9d3aae40731c83f117e430fbbacb2ac033f34d074d09a128c3308f4f83741a8ff184ac14825f0ca9bcebeab744404fa101b091f26c3929a1a802ea41d19f98867b532b539bb7d31a4d4957db11bfc1a0e75471d801b249163a1b322f6288c3728ccd271a2b22f4272c7abb86c647d7e02a1e5ca00ae362fdde76815ff9b486d89f6f5af48c6cea7fef608cabd155f4c2022a4b53d99703a06ea94eb0745062221f2f379107069ac3f160287a0b7d7df2d4629453a7ffa3726ad6e3103bedd253db8e84baac35423b303c3edf7e73e680f705155b9eb7c743e1884ac88da5d3196dc1f3152e941be442cf0827a044bc202b8fe8bddf3b1390a31965d6aac6eb6e94f62f280fb725c4b406130726b55d834a256b16e530eaf4a9715347fe83d7c28ec4ac4ff6491edd9ebf44b6e6c49f3109a54259b5e56450f23ac6f48bd5541d7687229a9f5956b9dd3725583dc7d0930c1c975663584fe44418e8de8d8fb5dcfe6323d26d16a88b3a35ea13c690f851502de4388869058f204b7251ced76a4c6137f04261ee71f688fde348fce40b935af1a37e12acfbf4b3f188527a67e35f88f7899d98065ec02a658eacb13896f3567c60e3339d856752d1c81f1a90e1268f3f38fe7af8ebbaa4ec5d5718ddd8328a0c9678e35af6f2abbb8d1d1265b9afbcdae34444f6718c20bd25494f5a7ea05879c6686c40c97859c835f9f3544cb7190ae1bad32be0db4a815286805c0a33756dcaa2c10b93a9676cde7e300a382abfe6aaac42d3f3411eba022454e02841c74aca20bc1ac72482902f1db40df3b732528a70b50d88a019701252cd69e1f209e896c50316a9ef2fae382359212130e53e2f7cf522ac8a6d63cc25ed4af7c016706add77cde98f1b1fca6966b2a23adfa0593bb68bc32defec4b8b38c2941275594ebd0728f7b00e1cf2f7d86153277627b5925f002deac0bb05357c30f9c29cb3563f3e53bcdbf2d6815507067b64f50e765c96a259e9acb17a712506f561ede6930b11ec2e3ae149230a7cb1fdb1a14a07375b4b460eac3fd2c81c39e6035025aeb984080f2c76dadc01039843f0f8b883f36f1acfb3cd6b21e587492b5280cc2f92dd3f7588dccddc2782f06be4086bef6369c631d24975f5a3ede041d0d1ba03d1d2b5cae1e2c8c6b740f79b9219a7a9c090a113ec63f9422cab034ba095cbb66d070c4d39c02b099aa254882717e2a8e55358b1fbb9c254b7639602c16b54e174e67d71b770a9772a5aacbd8cc5bdbe0d4620633fdfe8050dcbcaa798ea38181e0aaaff29ab582c921c20d76f08ddb5b2fd22b8ae776ed5a41ac8603a1e4672bc26f11fab113b33cc0816e03590ccda1545fe17c2e6a7aa9c03cdd8a8e01e12814d5698a75b15fab131e320ba7f8236a5deec63311a4bf16e07e926b1de9158bffb22644da4c31ea9acc6eda5fadd1bd61a65991345fe17ab4e018aebe1791b36f103d0616d0a439942b3fd098c241cb2b882a3d15043d3466129ab38b3ed320fe6f79d627833374d736a2ce0cee0107123f948b07c2d52104306e6910c74ef763777bdd2ede04c7a9420cfe7fca3db7d74bc4e43e319f43afffe39d146f3314af01b23f26b41a37b92dae82fbacf3f9e360ffc1f1c5466e297abb68bd018d83f410a26ffef09ca5d48aad211006010ac66e2961a3d7920f9185b30a93664e19396d7df7b8dc5e0463f0fc3089ab5c2c4a471682642034f9bb1bfccf046449d04a70210bb07c55ef26839dea0fd409e9b92602b1f11a747a5f7d6b88089c6a58c1b0ec298554219084475f05145aedf0284c4b97997911660ee8dd70b1c7d3e8bd15b9022ef54066c9c31362338d1a92092fe00a80f09348cb488416305997403cb4df14a7f9ae156f96717e6b661be83c7df33f14a1f2ec41b8c774a0b0cdaa222efcfaf838f7ba0d7db202a8fc227e869f631fd04afb1ec06aa5511b117af5678edb698d0e4eb7c7f0cc3fe52644a6f8d58f720c0621627fce7099af0789d50cf8e7aea67cd395c17c234ce5a62133525ba528f07f1bed690fdf53af3f806140255f4dd9a5190b469809e67e762d227587f48f29e6d0915d2f5852b0d56001abd5058bd84f4ca989474820a46a515204b81b6fabc39d3f0c3ca196892e1cae1d068f0555f301d84af9c43e9545316d951b132e931bf561ea12f01a20e7b855a385fb6f8bd5e8640702c261c17707864f211ff81ca3e1f3782b04d69e33ee93ec286a1873b82ad20a43e1d79d8fd3fa9820383ba2bf45133d5a621e3145c3c70c0f5e9faddfe65d109735cf60096b868a2ae86feb61a1d2f92a190108b7d31ded1cd3ff4d726c6f3dd68a3fbe50b720273efba99d85b987a2cf1567957f373cd4251f98b632643481c7d089fb3d150f0505355d6412e4d2ddd1ab611da3b03819c524ba043f1b155ef36033497583b4804cd18ce0ddb855ce027e5fa1e3d7e5bdd2793bc5b20cf417887e40761c0e9f46a305fd5098bf5f5d8fcb303ebc52c091c9201f945d2627f1184c3aae5e8420f874b52844d35e6392a767e19f2996f18050bcea6fd413adf42281bad5229f0544bb3bb339e3e894f8f21ee22f";
+#endif // ZCASH_GTEST_DATA_TX_ORCHARD_DUPLICATE_NULLIFIERS_H
diff --git a/depend/zcash/src/gtest/json_test_vectors.cpp b/depend/zcash/src/gtest/json_test_vectors.cpp
new file mode 100644
index 000000000..94ba5b4c5
--- /dev/null
+++ b/depend/zcash/src/gtest/json_test_vectors.cpp
@@ -0,0 +1,14 @@
+#include "json_test_vectors.h"
+
+UniValue
+read_json(const std::string& jsondata)
+{
+    UniValue v;
+
+    if (!(v.read(jsondata) && v.isArray()))
+    {
+        ADD_FAILURE();
+        return UniValue(UniValue::VARR);
+    }
+    return v.get_array();
+}
diff --git a/depend/zcash/src/gtest/json_test_vectors.h b/depend/zcash/src/gtest/json_test_vectors.h
new file mode 100644
index 000000000..a2a2545de
--- /dev/null
+++ b/depend/zcash/src/gtest/json_test_vectors.h
@@ -0,0 +1,56 @@
+#ifndef ZCASH_GTEST_JSON_TEST_VECTORS_H
+#define ZCASH_GTEST_JSON_TEST_VECTORS_H
+
+#include <gtest/gtest.h>
+
+#include "utilstrencodings.h"
+#include "version.h"
+#include "serialize.h"
+#include "streams.h"
+
+#include <univalue.h>
+
+UniValue
+read_json(const std::string& jsondata);
+
+// #define PRINT_JSON 1
+
+template<typename T>
+void expect_deser_same(const T& expected)
+{
+    CDataStream ss1(SER_NETWORK, PROTOCOL_VERSION);
+    ss1 << expected;
+
+    auto serialized_size = ss1.size();
+
+    T object;
+    ss1 >> object;
+
+    CDataStream ss2(SER_NETWORK, PROTOCOL_VERSION);
+    ss2 << object;
+
+    ASSERT_EQ(serialized_size, ss2.size());
+    ASSERT_TRUE(memcmp(&*ss1.begin(), &*ss2.begin(), serialized_size) == 0);
+}
+
+template<typename T, typename U>
+void expect_test_vector(T& v, const U& expected)
+{
+    expect_deser_same(expected);
+
+    CDataStream ss1(SER_NETWORK, PROTOCOL_VERSION);
+    ss1 << expected;
+
+    #ifdef PRINT_JSON
+    std::cout << "\t\"" ;
+    std::cout << HexStr(ss1.begin(), ss1.end()) << "\",\n";
+    #else
+    std::string raw = v.get_str();
+    CDataStream ss2(ParseHex(raw), SER_NETWORK, PROTOCOL_VERSION);
+
+    ASSERT_EQ(ss1.size(), ss2.size());
+    ASSERT_TRUE(memcmp(&*ss1.begin(), &*ss2.begin(), ss1.size()) == 0);
+    #endif
+}
+
+#endif // ZCASH_GTEST_JSON_TEST_VECTORS_H
diff --git a/depend/zcash/src/gtest/main.cpp b/depend/zcash/src/gtest/main.cpp
new file mode 100644
index 000000000..f77e8c1c6
--- /dev/null
+++ b/depend/zcash/src/gtest/main.cpp
@@ -0,0 +1,98 @@
+#include "gmock/gmock.h"
+#include "init.h"
+#include "key.h"
+#include "pubkey.h"
+#include "random.h"
+#include "util.h"
+#include "utiltest.h"
+
+#include "librustzcash.h"
+#include <sodium.h>
+#include <tracing.h>
+
+#include <boost/filesystem.hpp>
+
+const std::function<std::string(const char*)> G_TRANSLATION_FUN = nullptr;
+
+uint256 insecure_rand_seed = GetRandHash();
+FastRandomContext insecure_rand_ctx(insecure_rand_seed);
+
+struct ECCryptoClosure
+{
+    ECCVerifyHandle handle;
+};
+
+ECCryptoClosure instance_of_eccryptoclosure;
+
+class LogGrabber : public ::testing::EmptyTestEventListener {
+    fs::path logPath;
+
+public:
+    LogGrabber(fs::path logPathIn) : logPath(logPathIn) {}
+
+    virtual void OnTestStart(const ::testing::TestInfo& test_info) {
+        // Test logs are written synchronously, so we can clear the log file to
+        // ensure that at the end of the test, the log lines are all related to
+        // the test itself.
+        std::ofstream logFile;
+        logFile.open(logPath.string(), std::ofstream::out | std::ofstream::trunc);
+        logFile.close();
+    }
+
+    virtual void OnTestEnd(const ::testing::TestInfo& test_info) {
+        // If the test failed, print the test logs.
+        auto result = test_info.result();
+        if (result && result->Failed()) {
+            std::cout << "\n--- Logs:";
+
+            std::ifstream logFile;
+            logFile.open(logPath.string(), std::ios::in | std::ios::ate);
+            ASSERT_TRUE(logFile.is_open());
+            logFile.seekg(0, logFile.beg);
+            std::string line;
+            while (logFile.good()) {
+                std::getline(logFile, line);
+                if (!line.empty()) {
+                    std::cout << "\n  " << line;
+                }
+            }
+
+            std::cout << "\n---" << std::endl;
+        }
+    }
+};
+
+int main(int argc, char **argv) {
+  assert(sodium_init() != -1);
+  ECC_Start();
+
+    // Log all errors to a common test file.
+    fs::path tmpPath = fs::temp_directory_path();
+    fs::path tmpFilename = fs::unique_path("%%%%%%%%");
+    fs::path logPath = tmpPath / tmpFilename;
+    const fs::path::string_type& logPathStr = logPath.native();
+    static_assert(sizeof(fs::path::value_type) == sizeof(codeunit),
+                    "native path has unexpected code unit size");
+    const codeunit* logPathCStr = reinterpret_cast<const codeunit*>(logPathStr.c_str());
+    size_t logPathLen = logPathStr.length();
+
+    std::string initialFilter = "error";
+    pTracingHandle = tracing_init_test(
+        logPathCStr, logPathLen,
+        initialFilter.c_str());
+
+  testing::InitGoogleMock(&argc, argv);
+
+  // The "threadsafe" style is necessary for correct operation of death/exit
+  // tests on macOS (https://github.com/zcash/zcash/issues/4802).
+  testing::FLAGS_gtest_death_test_style = "threadsafe";
+
+    ::testing::TestEventListeners& listeners =
+        ::testing::UnitTest::GetInstance()->listeners();
+    listeners.Append(new LogGrabber(logPath));
+
+  auto ret = RUN_ALL_TESTS();
+
+  ECC_Stop();
+  return ret;
+}
diff --git a/depend/zcash/src/gtest/test_allocator.cpp b/depend/zcash/src/gtest/test_allocator.cpp
new file mode 100644
index 000000000..00ad41581
--- /dev/null
+++ b/depend/zcash/src/gtest/test_allocator.cpp
@@ -0,0 +1,22 @@
+#include <gtest/gtest.h>
+
+#include "support/allocators/secure.h"
+
+TEST(AllocatorTests, LockedPoolAbortOnDoubleFree) {
+    LockedPoolManager &pool = LockedPoolManager::Instance();
+
+    // We should be able to allocate and free memory.
+    void *a0 = pool.alloc(16);
+    pool.free(a0);
+
+    // Process terminates on double-free.
+    EXPECT_DEATH(pool.free(a0), "Arena: invalid or double free");
+}
+
+TEST(AllocatorTests, LockedPoolAbortOnFreeInvalidPointer) {
+    LockedPoolManager &pool = LockedPoolManager::Instance();
+    bool notInPool = false;
+
+    // Process terminates if we try to free memory that wasn't allocated by the pool.
+    EXPECT_DEATH(pool.free(&notInPool), "LockedPool: invalid address not pointing to any arena");
+}
diff --git a/depend/zcash/src/gtest/test_block.cpp b/depend/zcash/src/gtest/test_block.cpp
new file mode 100644
index 000000000..24dea8c3d
--- /dev/null
+++ b/depend/zcash/src/gtest/test_block.cpp
@@ -0,0 +1,15 @@
+#include <gtest/gtest.h>
+
+#include "primitives/block.h"
+#include "streams.h"
+#include "version.h"
+
+
+TEST(BlockTests, HeaderSizeIsExpected) {
+    // Dummy header with an empty Equihash solution.
+    CBlockHeader header;
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << header;
+
+    ASSERT_EQ(ss.size(), CBlockHeader::HEADER_SIZE);
+}
diff --git a/depend/zcash/src/gtest/test_checkblock.cpp b/depend/zcash/src/gtest/test_checkblock.cpp
new file mode 100644
index 000000000..5c702a305
--- /dev/null
+++ b/depend/zcash/src/gtest/test_checkblock.cpp
@@ -0,0 +1,398 @@
+#include <gtest/gtest.h>
+#include <gmock/gmock.h>
+
+#include "consensus/validation.h"
+#include "main.h"
+#include "proof_verifier.h"
+#include "utiltest.h"
+#include "zcash/Proof.hpp"
+
+class MockCValidationState : public CValidationState {
+public:
+    MOCK_METHOD6(DoS, bool(int level, bool ret,
+             unsigned int chRejectCodeIn, const std::string strRejectReasonIn,
+             bool corruptionIn,
+             const std::string &strDebugMessageIn));
+    MOCK_METHOD4(Invalid, bool(bool ret,
+                 unsigned int _chRejectCode, const std::string _strRejectReason,
+                 const std::string &_strDebugMessage));
+    MOCK_METHOD1(Error, bool(std::string strRejectReasonIn));
+    MOCK_CONST_METHOD0(IsValid, bool());
+    MOCK_CONST_METHOD0(IsInvalid, bool());
+    MOCK_CONST_METHOD0(IsError, bool());
+    MOCK_CONST_METHOD1(IsInvalid, bool(int &nDoSOut));
+    MOCK_CONST_METHOD0(CorruptionPossible, bool());
+    MOCK_CONST_METHOD0(GetRejectCode, unsigned int());
+    MOCK_CONST_METHOD0(GetRejectReason, std::string());
+    MOCK_CONST_METHOD0(GetDebugMessage, std::string());
+};
+
+TEST(CheckBlock, VersionTooLow) {
+    auto verifier = ProofVerifier::Strict();
+
+    CBlock block;
+    block.nVersion = 1;
+
+    MockCValidationState state;
+
+    SelectParams(CBaseChainParams::MAIN);
+
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "version-too-low", false, "")).Times(1);
+    EXPECT_FALSE(CheckBlock(block, state, Params(), verifier, false, false, true));
+}
+
+
+// Subclass of CTransaction which doesn't call UpdateHash when constructing
+// from a CMutableTransaction.  This enables us to create a CTransaction
+// with bad values which normally trigger an exception during construction.
+class UNSAFE_CTransaction : public CTransaction {
+    public:
+        UNSAFE_CTransaction(const CMutableTransaction &tx) : CTransaction(tx, true) {}
+};
+
+// Test that a Sprout tx with negative version is still rejected
+// by CheckBlock under Sprout consensus rules.
+TEST(CheckBlock, BlockSproutRejectsBadVersion) {
+    SelectParams(CBaseChainParams::MAIN);
+
+    CMutableTransaction mtx;
+    mtx.vin.resize(1);
+    mtx.vin[0].prevout.SetNull();
+    mtx.vin[0].scriptSig = CScript() << 1 << OP_0;
+    mtx.vout.resize(1);
+    mtx.vout[0].scriptPubKey = CScript() << OP_TRUE;
+    mtx.vout[0].nValue = 0;
+    mtx.vout.push_back(CTxOut(
+        GetBlockSubsidy(1, Params().GetConsensus())/5,
+        Params().GetFoundersRewardScriptAtHeight(1)));
+    mtx.fOverwintered = false;
+    mtx.nVersion = -1;
+    mtx.nVersionGroupId = 0;
+
+    EXPECT_THROW((CTransaction(mtx)), std::ios_base::failure);
+    UNSAFE_CTransaction tx {mtx};
+    CBlock block;
+    block.vtx.push_back(tx);
+
+    MockCValidationState state;
+    CBlockIndex indexPrev {Params().GenesisBlock()};
+
+    auto verifier = ProofVerifier::Strict();
+
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-version-too-low", false, "")).Times(1);
+    EXPECT_FALSE(CheckBlock(block, state, Params(), verifier, false, false, true));
+}
+
+
+class ContextualCheckBlockTest : public ::testing::Test {
+protected:
+    void SetUp() override {
+        SelectParams(CBaseChainParams::MAIN);
+    }
+
+    void TearDown() override {
+        // Revert to test default. No-op on mainnet params.
+        RegtestDeactivateBlossom();
+    }
+
+    // Returns a valid but empty mutable transaction at block height 1.
+    CMutableTransaction GetFirstBlockCoinbaseTx() {
+        CMutableTransaction mtx;
+
+        // No inputs.
+        mtx.vin.resize(1);
+        mtx.vin[0].prevout.SetNull();
+
+        // Set height to 1.
+        mtx.vin[0].scriptSig = CScript() << 1 << OP_0;
+
+        // Give it a single zero-valued, always-valid output.
+        mtx.vout.resize(1);
+        mtx.vout[0].scriptPubKey = CScript() << OP_TRUE;
+        mtx.vout[0].nValue = 0;
+
+        // Give it a Founder's Reward vout for height 1.
+        auto rewardScript = Params().GetFoundersRewardScriptAtHeight(1);
+        mtx.vout.push_back(CTxOut(
+                    GetBlockSubsidy(1, Params().GetConsensus())/5,
+                    rewardScript));
+
+        return mtx;
+    }
+
+    // Expects a height-1 block containing a given transaction to pass
+    // ContextualCheckBlock. This is used in accepting (Sprout-Sprout,
+    // Overwinter-Overwinter, ...) tests. You should not call it without
+    // calling a SCOPED_TRACE macro first to usefully label any failures.
+    void ExpectValidBlockFromTx(const CTransaction& tx) {
+        // Create a block and add the transaction to it.
+        CBlock block;
+        block.vtx.push_back(tx);
+
+        // Set the previous block index to the genesis block.
+        CBlockIndex indexPrev {Params().GenesisBlock()};
+
+        // We now expect this to be a valid block.
+        MockCValidationState state;
+        EXPECT_TRUE(ContextualCheckBlock(block, state, Params(), &indexPrev, true));
+    }
+
+    // Expects a height-1 block containing a given transaction to fail
+    // ContextualCheckBlock. This is used in rejecting (Sprout-Overwinter,
+    // Overwinter-Sprout, ...) tests. You should not call it without
+    // calling a SCOPED_TRACE macro first to usefully label any failures.
+    void ExpectInvalidBlockFromTx(const CTransaction& tx, int level, std::string reason) {
+        // Create a block and add the transaction to it.
+        CBlock block;
+        block.vtx.push_back(tx);
+
+        // Set the previous block index to the genesis block.
+        CBlockIndex indexPrev {Params().GenesisBlock()};
+
+        // We now expect this to be an invalid block, for the given reason.
+        MockCValidationState state;
+        EXPECT_CALL(state, DoS(level, false, REJECT_INVALID, reason, false, "")).Times(1);
+        EXPECT_FALSE(ContextualCheckBlock(block, state, Params(), &indexPrev, true));
+    }
+
+};
+
+
+TEST_F(ContextualCheckBlockTest, BadCoinbaseHeight) {
+    // Put a transaction in a block with no height in scriptSig
+    CMutableTransaction mtx = GetFirstBlockCoinbaseTx();
+    mtx.vin[0].scriptSig = CScript() << OP_0;
+    mtx.vout.pop_back(); // remove the FR output
+
+    CBlock block;
+    block.vtx.push_back(mtx);
+
+    // Treating block as genesis should pass
+    MockCValidationState state;
+    EXPECT_TRUE(ContextualCheckBlock(block, state, Params(), NULL, true));
+
+    // Give the transaction a Founder's Reward vout
+    mtx.vout.push_back(CTxOut(
+                GetBlockSubsidy(1, Params().GetConsensus())/5,
+                Params().GetFoundersRewardScriptAtHeight(1)));
+
+    // Treating block as non-genesis should fail
+    CTransaction tx2 {mtx};
+    block.vtx[0] = tx2;
+    CBlock prev;
+    CBlockIndex indexPrev {prev};
+    indexPrev.nHeight = 0;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-cb-height", false, "")).Times(1);
+    EXPECT_FALSE(ContextualCheckBlock(block, state, Params(), &indexPrev, true));
+
+    // Setting to an incorrect height should fail
+    mtx.vin[0].scriptSig = CScript() << 2 << OP_0;
+    CTransaction tx3 {mtx};
+    block.vtx[0] = tx3;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-cb-height", false, "")).Times(1);
+    EXPECT_FALSE(ContextualCheckBlock(block, state, Params(), &indexPrev, true));
+
+    // After correcting the scriptSig, should pass
+    mtx.vin[0].scriptSig = CScript() << 1 << OP_0;
+    CTransaction tx4 {mtx};
+    block.vtx[0] = tx4;
+    EXPECT_TRUE(ContextualCheckBlock(block, state, Params(), &indexPrev, true));
+}
+
+// TEST PLAN: first, check that each ruleset accepts its own transaction type.
+// Currently (May 2018) this means we'll test Sprout-Sprout,
+// Overwinter-Overwinter, and Sapling-Sapling.
+
+// Test block evaluated under Sprout rules will accept Sprout transactions.
+// This test assumes that mainnet Overwinter activation is at least height 2.
+TEST_F(ContextualCheckBlockTest, BlockSproutRulesAcceptSproutTx) {
+    CMutableTransaction mtx = GetFirstBlockCoinbaseTx();
+
+    // Make it a Sprout transaction w/o JoinSplits
+    mtx.fOverwintered = false;
+    mtx.nVersion = 1;
+
+    SCOPED_TRACE("BlockSproutRulesAcceptSproutTx");
+    ExpectValidBlockFromTx(CTransaction(mtx));
+}
+
+
+// Test block evaluated under Overwinter rules will accept Overwinter transactions.
+TEST_F(ContextualCheckBlockTest, BlockOverwinterRulesAcceptOverwinterTx) {
+    SelectParams(CBaseChainParams::REGTEST);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, 1);
+
+    CMutableTransaction mtx = GetFirstBlockCoinbaseTx();
+
+    // Make it an Overwinter transaction
+    mtx.fOverwintered = true;
+    mtx.nVersion = OVERWINTER_TX_VERSION;
+    mtx.nVersionGroupId = OVERWINTER_VERSION_GROUP_ID;
+
+    SCOPED_TRACE("BlockOverwinterRulesAcceptOverwinterTx");
+    ExpectValidBlockFromTx(CTransaction(mtx));
+}
+
+
+// Test that a block evaluated under Sapling rules can contain Sapling transactions.
+TEST_F(ContextualCheckBlockTest, BlockSaplingRulesAcceptSaplingTx) {
+    SelectParams(CBaseChainParams::REGTEST);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, 1);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_SAPLING, 1);
+
+    CMutableTransaction mtx = GetFirstBlockCoinbaseTx();
+
+    // Make it a Sapling transaction
+    mtx.fOverwintered = true;
+    mtx.nVersion = SAPLING_TX_VERSION;
+    mtx.nVersionGroupId = SAPLING_VERSION_GROUP_ID;
+
+    SCOPED_TRACE("BlockSaplingRulesAcceptSaplingTx");
+    ExpectValidBlockFromTx(CTransaction(mtx));
+}
+
+
+// Test that a block evaluated under Blossom rules can contain Blossom transactions.
+TEST_F(ContextualCheckBlockTest, BlockBlossomRulesAcceptBlossomTx) {
+    SelectParams(CBaseChainParams::REGTEST);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, 1);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_SAPLING, 1);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_BLOSSOM, 1);
+
+    CMutableTransaction mtx = GetFirstBlockCoinbaseTx();
+
+    // Make it a Blossom transaction (using Sapling version/group id).
+    mtx.fOverwintered = true;
+    mtx.nVersion = SAPLING_TX_VERSION;
+    mtx.nVersionGroupId = SAPLING_VERSION_GROUP_ID;
+
+    SCOPED_TRACE("BlockBlossomRulesAcceptBlossomTx");
+    ExpectValidBlockFromTx(CTransaction(mtx));
+}
+
+
+// TEST PLAN: next, check that each ruleset will not accept other transaction
+// types. Currently (February 2020) this means with each of four *branches* active
+// (Sprout, Overwinter, Sapling, Blossom), we'll test that transactions for tx
+// *versions* not valid on that branch are rejected.
+//
+// Note that Sapling and Blossom transactions use the same tx version and version
+// group id, but different consensus branch ids. These tests use transactions with
+// no inputs and only a transparent output, therefore they are not signed and do not
+// depend on the consensus branch id. Testing that Sapling rejects transactions that
+// are signed for Blossom, and vice versa, is outside the scope of these tests.
+//
+// TODO: Change the testing approach to not require O(branches * versions) code.
+
+
+// Test that a block evaluated under Sprout rules cannot contain non-Sprout
+// transactions which require Overwinter to be active.  This test assumes that
+// mainnet Overwinter activation is at least height 2.
+TEST_F(ContextualCheckBlockTest, BlockSproutRulesRejectOtherTx) {
+    CMutableTransaction mtx = GetFirstBlockCoinbaseTx();
+
+    // Make it an Overwinter transaction
+    mtx.fOverwintered = true;
+    mtx.nVersion = OVERWINTER_TX_VERSION;
+    mtx.nVersionGroupId = OVERWINTER_VERSION_GROUP_ID;
+
+    {
+        SCOPED_TRACE("BlockSproutRulesRejectOverwinterTx");
+        ExpectInvalidBlockFromTx(CTransaction(mtx), 100, "tx-overwinter-not-active");
+    }
+
+    // Make it a Sapling transaction
+    mtx.fOverwintered = true;
+    mtx.nVersion = SAPLING_TX_VERSION;
+    mtx.nVersionGroupId = SAPLING_VERSION_GROUP_ID;
+
+    {
+        SCOPED_TRACE("BlockSproutRulesRejectSaplingTx");
+        ExpectInvalidBlockFromTx(CTransaction(mtx), 100, "tx-overwinter-not-active");
+    }
+};
+
+
+// Test block evaluated under Overwinter rules cannot contain non-Overwinter
+// transactions.
+TEST_F(ContextualCheckBlockTest, BlockOverwinterRulesRejectOtherTx) {
+    SelectParams(CBaseChainParams::REGTEST);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, 1);
+
+    CMutableTransaction mtx = GetFirstBlockCoinbaseTx();
+
+    // Set the version to Sprout+JoinSplit (but nJoinSplit will be 0).
+    mtx.nVersion = 2;
+
+    {
+        SCOPED_TRACE("BlockOverwinterRulesRejectSproutTx");
+        ExpectInvalidBlockFromTx(CTransaction(mtx), 100, "tx-overwintered-flag-not-set");
+    }
+
+    // Make it a Sapling transaction
+    mtx.fOverwintered = true;
+    mtx.nVersion = SAPLING_TX_VERSION;
+    mtx.nVersionGroupId = SAPLING_VERSION_GROUP_ID;
+
+    {
+        SCOPED_TRACE("BlockOverwinterRulesRejectSaplingTx");
+        ExpectInvalidBlockFromTx(CTransaction(mtx), 100, "bad-tx-overwinter-version-too-high");
+    }
+}
+
+
+// Test block evaluated under Sapling rules cannot contain non-Sapling transactions.
+TEST_F(ContextualCheckBlockTest, BlockSaplingRulesRejectOtherTx) {
+    SelectParams(CBaseChainParams::REGTEST);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, 1);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_SAPLING, 1);
+
+    CMutableTransaction mtx = GetFirstBlockCoinbaseTx();
+
+    // Set the version to Sprout+JoinSplit (but nJoinSplit will be 0).
+    mtx.nVersion = 2;
+
+    {
+        SCOPED_TRACE("BlockSaplingRulesRejectSproutTx");
+        ExpectInvalidBlockFromTx(CTransaction(mtx), 100, "tx-overwintered-flag-not-set");
+    }
+
+    // Make it an Overwinter transaction
+    mtx.fOverwintered = true;
+    mtx.nVersion = OVERWINTER_TX_VERSION;
+    mtx.nVersionGroupId = OVERWINTER_VERSION_GROUP_ID;
+
+    {
+        SCOPED_TRACE("BlockSaplingRulesRejectOverwinterTx");
+        ExpectInvalidBlockFromTx(CTransaction(mtx), 100, "bad-sapling-tx-version-group-id");
+    }
+}
+
+
+// Test block evaluated under Blossom rules cannot contain non-Blossom transactions.
+TEST_F(ContextualCheckBlockTest, BlockBlossomRulesRejectOtherTx) {
+    SelectParams(CBaseChainParams::REGTEST);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, 1);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_SAPLING, 1);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_BLOSSOM, 1);
+
+    CMutableTransaction mtx = GetFirstBlockCoinbaseTx();
+
+    // Set the version to Sprout+JoinSplit (but nJoinSplit will be 0).
+    mtx.nVersion = 2;
+
+    {
+        SCOPED_TRACE("BlockBlossomRulesRejectSproutTx");
+        ExpectInvalidBlockFromTx(CTransaction(mtx), 100, "tx-overwintered-flag-not-set");
+    }
+
+    // Make it an Overwinter transaction
+    mtx.fOverwintered = true;
+    mtx.nVersion = OVERWINTER_TX_VERSION;
+    mtx.nVersionGroupId = OVERWINTER_VERSION_GROUP_ID;
+
+    {
+        SCOPED_TRACE("BlockBlossomRulesRejectOverwinterTx");
+        ExpectInvalidBlockFromTx(CTransaction(mtx), 100, "bad-sapling-tx-version-group-id");
+    }
+}
diff --git a/depend/zcash/src/gtest/test_checktransaction.cpp b/depend/zcash/src/gtest/test_checktransaction.cpp
new file mode 100644
index 000000000..c2b87f54f
--- /dev/null
+++ b/depend/zcash/src/gtest/test_checktransaction.cpp
@@ -0,0 +1,1659 @@
+#include <gtest/gtest.h>
+#include <gmock/gmock.h>
+
+#include "main.h"
+#include "primitives/transaction.h"
+#include "consensus/validation.h"
+#include "transaction_builder.h"
+#include "gtest/utils.h"
+#include "utiltest.h"
+#include "zcash/JoinSplit.hpp"
+
+#include <librustzcash.h>
+#include <rust/ed25519.h>
+#include <rust/orchard.h>
+
+// Subclass of CTransaction which doesn't call UpdateHash when constructing
+// from a CMutableTransaction.  This enables us to create a CTransaction
+// with bad values which normally trigger an exception during construction.
+class UNSAFE_CTransaction : public CTransaction {
+    public:
+        UNSAFE_CTransaction(const CMutableTransaction &tx) : CTransaction(tx, true) {}
+};
+
+TEST(ChecktransactionTests, CheckVpubNotBothNonzero) {
+    CMutableTransaction tx;
+    tx.nVersion = 2;
+
+    {
+        // Ensure that values within the joinsplit are well-formed.
+        CMutableTransaction newTx(tx);
+        CValidationState state;
+
+        newTx.vJoinSplit.push_back(JSDescription());
+
+        JSDescription *jsdesc = &newTx.vJoinSplit[0];
+        jsdesc->vpub_old = 1;
+        jsdesc->vpub_new = 1;
+
+        EXPECT_FALSE(CheckTransactionWithoutProofVerification(newTx, state));
+        EXPECT_EQ(state.GetRejectReason(), "bad-txns-vpubs-both-nonzero");
+    }
+}
+
+class MockCValidationState : public CValidationState {
+public:
+    MOCK_METHOD6(DoS, bool(int level, bool ret,
+             unsigned int chRejectCodeIn, const std::string &strRejectReasonIn,
+             bool corruptionIn,
+             const std::string &strDebugMessageIn));
+    MOCK_METHOD4(Invalid, bool(bool ret,
+                 unsigned int _chRejectCode, const std::string _strRejectReason,
+                 const std::string &_strDebugMessage));
+    MOCK_METHOD1(Error, bool(std::string strRejectReasonIn));
+    MOCK_CONST_METHOD0(IsValid, bool());
+    MOCK_CONST_METHOD0(IsInvalid, bool());
+    MOCK_CONST_METHOD0(IsError, bool());
+    MOCK_CONST_METHOD1(IsInvalid, bool(int &nDoSOut));
+    MOCK_CONST_METHOD0(CorruptionPossible, bool());
+    MOCK_CONST_METHOD0(GetRejectCode, unsigned int());
+    MOCK_CONST_METHOD0(GetRejectReason, std::string());
+    MOCK_CONST_METHOD0(GetDebugMessage, std::string());
+};
+
+void CreateJoinSplitSignature(CMutableTransaction& mtx, uint32_t consensusBranchId);
+
+CMutableTransaction GetValidTransaction(uint32_t consensusBranchId=SPROUT_BRANCH_ID) {
+    CMutableTransaction mtx;
+    if (consensusBranchId == NetworkUpgradeInfo[Consensus::UPGRADE_OVERWINTER].nBranchId) {
+        mtx.fOverwintered = true;
+        mtx.nVersionGroupId = OVERWINTER_VERSION_GROUP_ID;
+        mtx.nVersion = OVERWINTER_TX_VERSION;
+    } else if (consensusBranchId == NetworkUpgradeInfo[Consensus::UPGRADE_SAPLING].nBranchId) {
+        mtx.fOverwintered = true;
+        mtx.nVersionGroupId = SAPLING_VERSION_GROUP_ID;
+        mtx.nVersion = SAPLING_TX_VERSION;
+    } else if (consensusBranchId != SPROUT_BRANCH_ID) {
+        // Unsupported consensus branch ID
+        assert(false);
+    }
+
+    mtx.vin.resize(2);
+    mtx.vin[0].prevout.hash = uint256S("0000000000000000000000000000000000000000000000000000000000000001");
+    mtx.vin[0].prevout.n = 0;
+    mtx.vin[1].prevout.hash = uint256S("0000000000000000000000000000000000000000000000000000000000000002");
+    mtx.vin[1].prevout.n = 0;
+    mtx.vout.resize(2);
+    // mtx.vout[0].scriptPubKey =
+    mtx.vout[0].nValue = 0;
+    mtx.vout[1].nValue = 0;
+    mtx.vJoinSplit.resize(2);
+    mtx.vJoinSplit[0].nullifiers.at(0) = uint256S("0000000000000000000000000000000000000000000000000000000000000000");
+    mtx.vJoinSplit[0].nullifiers.at(1) = uint256S("0000000000000000000000000000000000000000000000000000000000000001");
+    mtx.vJoinSplit[1].nullifiers.at(0) = uint256S("0000000000000000000000000000000000000000000000000000000000000002");
+    mtx.vJoinSplit[1].nullifiers.at(1) = uint256S("0000000000000000000000000000000000000000000000000000000000000003");
+
+    if (mtx.nVersion >= SAPLING_TX_VERSION) {
+        libzcash::GrothProof emptyProof;
+        mtx.vJoinSplit[0].proof = emptyProof;
+        mtx.vJoinSplit[1].proof = emptyProof;
+    }
+
+    CreateJoinSplitSignature(mtx, consensusBranchId);
+    return mtx;
+}
+
+void CreateJoinSplitSignature(CMutableTransaction& mtx, uint32_t consensusBranchId) {
+    // Generate an ephemeral keypair.
+    Ed25519SigningKey joinSplitPrivKey;
+    ed25519_generate_keypair(&joinSplitPrivKey, &mtx.joinSplitPubKey);
+
+    // Compute the correct hSig.
+    // TODO: #966.
+    static const uint256 one(uint256S("0000000000000000000000000000000000000000000000000000000000000001"));
+    // Empty output script.
+    CScript scriptCode;
+    CTransaction signTx(mtx);
+    // Fake coins being spent.
+    std::vector<CTxOut> allPrevOutputs;
+    allPrevOutputs.resize(signTx.vin.size());
+    const PrecomputedTransactionData txdata(signTx, allPrevOutputs);
+    uint256 dataToBeSigned = SignatureHash(scriptCode, signTx, NOT_AN_INPUT, SIGHASH_ALL, 0, consensusBranchId, txdata);
+    if (dataToBeSigned == one) {
+        throw std::runtime_error("SignatureHash failed");
+    }
+
+    // Add the signature
+    assert(ed25519_sign(
+        &joinSplitPrivKey,
+        dataToBeSigned.begin(), 32,
+        &mtx.joinSplitSig));
+}
+
+TEST(ChecktransactionTests, ValidTransaction) {
+    CMutableTransaction mtx = GetValidTransaction();
+    CTransaction tx(mtx);
+    MockCValidationState state;
+    EXPECT_TRUE(CheckTransactionWithoutProofVerification(tx, state));
+}
+
+TEST(ChecktransactionTests, BadVersionTooLow) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.nVersion = 0;
+
+    EXPECT_THROW((CTransaction(mtx)), std::ios_base::failure);
+    UNSAFE_CTransaction tx(mtx);
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-version-too-low", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+TEST(ChecktransactionTests, BadTxnsVinEmpty) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vJoinSplit.resize(0);
+    mtx.vin.resize(0);
+
+    CTransaction tx(mtx);
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(10, false, REJECT_INVALID, "bad-txns-no-source-of-funds", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+TEST(ChecktransactionTests, BadTxnsVoutEmpty) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vJoinSplit.resize(0);
+    mtx.vout.resize(0);
+
+    CTransaction tx(mtx);
+
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(10, false, REJECT_INVALID, "bad-txns-no-sink-of-funds", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+TEST(ChecktransactionTests, BadTxnsOversize) {
+    SelectParams(CBaseChainParams::REGTEST);
+    CMutableTransaction mtx = GetValidTransaction();
+
+    mtx.vin[0].scriptSig = CScript();
+    std::vector<unsigned char> vchData(520);
+    for (unsigned int i = 0; i < 190; ++i)
+        mtx.vin[0].scriptSig << vchData << OP_DROP;
+    mtx.vin[0].scriptSig << OP_1;
+
+    {
+        // Transaction is just under the limit...
+        CTransaction tx(mtx);
+        CValidationState state;
+        ASSERT_TRUE(CheckTransactionWithoutProofVerification(tx, state));
+    }
+
+    // Not anymore!
+    mtx.vin[1].scriptSig << vchData << OP_DROP;
+    mtx.vin[1].scriptSig << OP_1;
+
+    {
+        CTransaction tx(mtx);
+        ASSERT_EQ(::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION), 100202);
+
+        // Passes non-contextual checks...
+        MockCValidationState state;
+        EXPECT_TRUE(CheckTransactionWithoutProofVerification(tx, state));
+
+        // ... but fails contextual ones!
+        EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-oversize", false, "")).Times(1);
+        EXPECT_FALSE(ContextualCheckTransaction(tx, state, Params(), 1, true));
+    }
+
+    {
+        // But should be fine again once Sapling activates!
+        RegtestActivateSapling();
+
+        mtx.fOverwintered = true;
+        mtx.nVersionGroupId = SAPLING_VERSION_GROUP_ID;
+        mtx.nVersion = SAPLING_TX_VERSION;
+
+        // Change the proof types (which requires re-signing the JoinSplit data)
+        mtx.vJoinSplit[0].proof = libzcash::GrothProof();
+        mtx.vJoinSplit[1].proof = libzcash::GrothProof();
+        CreateJoinSplitSignature(mtx, NetworkUpgradeInfo[Consensus::UPGRADE_SAPLING].nBranchId);
+
+        CTransaction tx(mtx);
+        EXPECT_EQ(::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION), 103713);
+
+        MockCValidationState state;
+        EXPECT_TRUE(CheckTransactionWithoutProofVerification(tx, state));
+        EXPECT_TRUE(ContextualCheckTransaction(tx, state, Params(), 1, true));
+
+        // Revert to default
+        RegtestDeactivateSapling();
+    }
+}
+
+TEST(ChecktransactionTests, OversizeSaplingTxns) {
+    RegtestActivateSapling();
+
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.fOverwintered = true;
+    mtx.nVersionGroupId = SAPLING_VERSION_GROUP_ID;
+    mtx.nVersion = SAPLING_TX_VERSION;
+
+    // Change the proof types (which requires re-signing the JoinSplit data)
+    mtx.vJoinSplit[0].proof = libzcash::GrothProof();
+    mtx.vJoinSplit[1].proof = libzcash::GrothProof();
+    CreateJoinSplitSignature(mtx, NetworkUpgradeInfo[Consensus::UPGRADE_SAPLING].nBranchId);
+
+    // Transaction just under the limit
+    mtx.vin[0].scriptSig = CScript();
+    std::vector<unsigned char> vchData(520);
+    for (unsigned int i = 0; i < 3809; ++i)
+        mtx.vin[0].scriptSig << vchData << OP_DROP;
+    std::vector<unsigned char> vchDataRemainder(453);
+    mtx.vin[0].scriptSig << vchDataRemainder << OP_DROP;
+    mtx.vin[0].scriptSig << OP_1;
+
+    {
+        CTransaction tx(mtx);
+        EXPECT_EQ(::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION), MAX_TX_SIZE_AFTER_SAPLING - 1);
+
+        CValidationState state;
+        EXPECT_TRUE(CheckTransactionWithoutProofVerification(tx, state));
+    }
+
+    // Transaction equal to the limit
+    mtx.vin[1].scriptSig << OP_1;
+
+    {
+        CTransaction tx(mtx);
+        EXPECT_EQ(::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION), MAX_TX_SIZE_AFTER_SAPLING);
+
+        CValidationState state;
+        EXPECT_TRUE(CheckTransactionWithoutProofVerification(tx, state));
+    }
+
+    // Transaction just over the limit
+    mtx.vin[1].scriptSig << OP_1;
+
+    {
+        CTransaction tx(mtx);
+        EXPECT_EQ(::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION), MAX_TX_SIZE_AFTER_SAPLING + 1);
+
+        MockCValidationState state;
+        EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-oversize", false, "")).Times(1);
+        EXPECT_FALSE(CheckTransactionWithoutProofVerification(tx, state));
+    }
+
+    // Revert to default
+    RegtestDeactivateSapling();
+}
+
+TEST(ChecktransactionTests, BadTxnsVoutNegative) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vout[0].nValue = -1;
+
+    EXPECT_THROW((CTransaction(mtx)), std::ios_base::failure);
+    UNSAFE_CTransaction tx(mtx);
+
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-vout-negative", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+TEST(ChecktransactionTests, BadTxnsVoutToolarge) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vout[0].nValue = MAX_MONEY + 1;
+
+    EXPECT_THROW((CTransaction(mtx)), std::ios_base::failure);
+    UNSAFE_CTransaction tx(mtx);
+
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-vout-toolarge", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+TEST(ChecktransactionTests, BadTxnsTxouttotalToolargeOutputs) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vout[0].nValue = MAX_MONEY;
+    mtx.vout[1].nValue = 1;
+
+    CTransaction tx(mtx);
+
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-txouttotal-toolarge", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+TEST(ChecktransactionTests, ValueBalanceNonZero) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.valueBalanceSapling = 10;
+
+    CTransaction tx(mtx);
+
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-valuebalance-nonzero", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+TEST(ChecktransactionTests, PositiveValueBalanceTooLarge) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vShieldedSpend.resize(1);
+    mtx.valueBalanceSapling = MAX_MONEY + 1;
+
+    CTransaction tx(mtx);
+
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-valuebalance-toolarge", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+TEST(ChecktransactionTests, NegativeValueBalanceTooLarge) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vShieldedSpend.resize(1);
+    mtx.valueBalanceSapling = -(MAX_MONEY + 1);
+
+    CTransaction tx(mtx);
+
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-valuebalance-toolarge", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+TEST(ChecktransactionTests, ValueBalanceOverflowsTotal) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vShieldedSpend.resize(1);
+    mtx.vout[0].nValue = 1;
+    mtx.valueBalanceSapling = -MAX_MONEY;
+
+    CTransaction tx(mtx);
+
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-txouttotal-toolarge", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+TEST(ChecktransactionTests, BadTxnsTxouttotalToolargeJoinsplit) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vout[0].nValue = 1;
+    mtx.vJoinSplit[0].vpub_old = MAX_MONEY;
+
+    CTransaction tx(mtx);
+
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-txouttotal-toolarge", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+TEST(ChecktransactionTests, BadTxnsTxintotalToolargeJoinsplit) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vJoinSplit[0].vpub_new = MAX_MONEY - 1;
+    mtx.vJoinSplit[1].vpub_new = MAX_MONEY - 1;
+
+    CTransaction tx(mtx);
+
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-txintotal-toolarge", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+TEST(ChecktransactionTests, BadTxnsVpubOldNegative) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vJoinSplit[0].vpub_old = -1;
+
+    CTransaction tx(mtx);
+
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-vpub_old-negative", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+TEST(ChecktransactionTests, BadTxnsVpubNewNegative) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vJoinSplit[0].vpub_new = -1;
+
+    CTransaction tx(mtx);
+
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-vpub_new-negative", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+TEST(ChecktransactionTests, BadTxnsVpubOldToolarge) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vJoinSplit[0].vpub_old = MAX_MONEY + 1;
+
+    CTransaction tx(mtx);
+
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-vpub_old-toolarge", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+TEST(ChecktransactionTests, BadTxnsVpubNewToolarge) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vJoinSplit[0].vpub_new = MAX_MONEY + 1;
+
+    CTransaction tx(mtx);
+
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-vpub_new-toolarge", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+TEST(ChecktransactionTests, BadTxnsVpubsBothNonzero) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vJoinSplit[0].vpub_old = 1;
+    mtx.vJoinSplit[0].vpub_new = 1;
+
+    CTransaction tx(mtx);
+
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-vpubs-both-nonzero", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+TEST(ChecktransactionTests, BadTxnsInputsDuplicate) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vin[1].prevout.hash = mtx.vin[0].prevout.hash;
+    mtx.vin[1].prevout.n = mtx.vin[0].prevout.n;
+
+    CTransaction tx(mtx);
+
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-inputs-duplicate", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+TEST(ChecktransactionTests, BadJoinsplitsNullifiersDuplicateSameJoinsplit) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vJoinSplit[0].nullifiers.at(0) = uint256S("0000000000000000000000000000000000000000000000000000000000000000");
+    mtx.vJoinSplit[0].nullifiers.at(1) = uint256S("0000000000000000000000000000000000000000000000000000000000000000");
+
+    CTransaction tx(mtx);
+
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-joinsplits-nullifiers-duplicate", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+TEST(ChecktransactionTests, BadJoinsplitsNullifiersDuplicateDifferentJoinsplit) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vJoinSplit[0].nullifiers.at(0) = uint256S("0000000000000000000000000000000000000000000000000000000000000000");
+    mtx.vJoinSplit[1].nullifiers.at(0) = uint256S("0000000000000000000000000000000000000000000000000000000000000000");
+
+    CTransaction tx(mtx);
+
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-joinsplits-nullifiers-duplicate", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+TEST(ChecktransactionTests, BadCbHasJoinsplits) {
+    CMutableTransaction mtx = GetValidTransaction();
+    // Make it a coinbase.
+    mtx.vin.resize(1);
+    mtx.vin[0].prevout.SetNull();
+
+    mtx.vJoinSplit.resize(1);
+
+    CTransaction tx(mtx);
+    EXPECT_TRUE(tx.IsCoinBase());
+
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-cb-has-joinsplits", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+TEST(ChecktransactionTests, BadCbEmptyScriptsig) {
+    CMutableTransaction mtx = GetValidTransaction();
+    // Make it a coinbase.
+    mtx.vin.resize(1);
+    mtx.vin[0].prevout.SetNull();
+
+    mtx.vJoinSplit.resize(0);
+
+    CTransaction tx(mtx);
+    EXPECT_TRUE(tx.IsCoinBase());
+
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-cb-length", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+TEST(ChecktransactionTests, BadTxnsPrevoutNull) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vin[1].prevout.SetNull();
+
+    CTransaction tx(mtx);
+    EXPECT_FALSE(tx.IsCoinBase());
+
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(10, false, REJECT_INVALID, "bad-txns-prevout-null", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+TEST(ContextualCheckShieldedInputsTest, BadTxnsInvalidJoinsplitSignature) {
+    SelectParams(CBaseChainParams::REGTEST);
+    auto consensus = Params().GetConsensus();
+    auto orchardAuth = orchard::AuthValidator::Disabled();
+
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.joinSplitSig.bytes[0] += 1;
+    CTransaction tx(mtx);
+
+    // Recreate the fake coins being spent.
+    std::vector<CTxOut> allPrevOutputs;
+    allPrevOutputs.resize(tx.vin.size());
+    const PrecomputedTransactionData txdata(tx, allPrevOutputs);
+
+    MockCValidationState state;
+    AssumeShieldedInputsExistAndAreSpendable baseView;
+    CCoinsViewCache view(&baseView);
+    // during initial block download, for transactions being accepted into the
+    // mempool (and thus not mined), DoS ban score should be zero, else 10
+    EXPECT_CALL(state, DoS(0, false, REJECT_INVALID, "bad-txns-invalid-joinsplit-signature", false, "")).Times(1);
+    ContextualCheckShieldedInputs(tx, txdata, state, view, orchardAuth, consensus, 0, false, false, [](const Consensus::Params&) { return true; });
+    EXPECT_CALL(state, DoS(10, false, REJECT_INVALID, "bad-txns-invalid-joinsplit-signature", false, "")).Times(1);
+    ContextualCheckShieldedInputs(tx, txdata, state, view, orchardAuth, consensus, 0, false, false, [](const Consensus::Params&) { return false; });
+    // for transactions that have been mined in a block, DoS ban score should
+    // always be 100.
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-invalid-joinsplit-signature", false, "")).Times(1);
+    ContextualCheckShieldedInputs(tx, txdata, state, view, orchardAuth, consensus, 0, false, true, [](const Consensus::Params&) { return true; });
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-invalid-joinsplit-signature", false, "")).Times(1);
+    ContextualCheckShieldedInputs(tx, txdata, state, view, orchardAuth, consensus, 0, false, true, [](const Consensus::Params&) { return false; });
+}
+
+TEST(ContextualCheckShieldedInputsTest, JoinsplitSignatureDetectsOldBranchId) {
+    SelectParams(CBaseChainParams::REGTEST);
+    auto consensus = Params().GetConsensus();
+    auto orchardAuth = orchard::AuthValidator::Disabled();
+
+    auto saplingBranchId = NetworkUpgradeInfo[Consensus::UPGRADE_SAPLING].nBranchId;
+    auto blossomBranchId = NetworkUpgradeInfo[Consensus::UPGRADE_BLOSSOM].nBranchId;
+    auto heartwoodBranchId = NetworkUpgradeInfo[Consensus::UPGRADE_HEARTWOOD].nBranchId;
+
+    // Create a valid transaction for the Sapling epoch.
+    CMutableTransaction mtx = GetValidTransaction(saplingBranchId);
+    CTransaction tx(mtx);
+
+    // Recreate the fake coins being spent.
+    std::vector<CTxOut> allPrevOutputs;
+    allPrevOutputs.resize(tx.vin.size());
+    const PrecomputedTransactionData txdata(tx, allPrevOutputs);
+
+    MockCValidationState state;
+    AssumeShieldedInputsExistAndAreSpendable baseView;
+    CCoinsViewCache view(&baseView);
+    // Ensure that the transaction validates against Sapling.
+    EXPECT_TRUE(ContextualCheckShieldedInputs(
+        tx, txdata, state, view, orchardAuth, consensus, saplingBranchId, false, false,
+        [](const Consensus::Params&) { return false; }));
+
+    // Attempt to validate the inputs against Blossom. We should be notified
+    // that an old consensus branch ID was used for an input.
+    EXPECT_CALL(state, DoS(
+        10, false, REJECT_INVALID,
+        strprintf("old-consensus-branch-id (Expected %s, found %s)",
+            HexInt(blossomBranchId),
+            HexInt(saplingBranchId)),
+        false, "")).Times(1);
+    EXPECT_FALSE(ContextualCheckShieldedInputs(
+        tx, txdata, state, view, orchardAuth, consensus, blossomBranchId, false, false,
+        [](const Consensus::Params&) { return false; }));
+
+    // Attempt to validate the inputs against Heartwood. All we should learn is
+    // that the signature is invalid, because we don't check more than one
+    // network upgrade back.
+    EXPECT_CALL(state, DoS(
+        10, false, REJECT_INVALID,
+        "bad-txns-invalid-joinsplit-signature", false, "")).Times(1);
+    EXPECT_FALSE(ContextualCheckShieldedInputs(
+        tx, txdata, state, view, orchardAuth, consensus, heartwoodBranchId, false, false,
+        [](const Consensus::Params&) { return false; }));
+}
+
+TEST(ContextualCheckShieldedInputsTest, NonCanonicalEd25519Signature) {
+    SelectParams(CBaseChainParams::REGTEST);
+    auto consensus = Params().GetConsensus();
+    auto orchardAuth = orchard::AuthValidator::Disabled();
+
+    AssumeShieldedInputsExistAndAreSpendable baseView;
+    CCoinsViewCache view(&baseView);
+
+    auto saplingBranchId = NetworkUpgradeInfo[Consensus::UPGRADE_SAPLING].nBranchId;
+    CMutableTransaction mtx = GetValidTransaction(saplingBranchId);
+
+    // Recreate the fake coins being spent.
+    std::vector<CTxOut> allPrevOutputs;
+    allPrevOutputs.resize(mtx.vin.size());
+
+    // Check that the signature is valid before we add L
+    {
+        CTransaction tx(mtx);
+        const PrecomputedTransactionData txdata(tx, allPrevOutputs);
+        MockCValidationState state;
+        EXPECT_TRUE(ContextualCheckShieldedInputs(tx, txdata, state, view, orchardAuth, consensus, saplingBranchId, false, true));
+    }
+
+    // Copied from libsodium/crypto_sign/ed25519/ref10/open.c
+    static const unsigned char L[32] =
+      { 0xed, 0xd3, 0xf5, 0x5c, 0x1a, 0x63, 0x12, 0x58,
+        0xd6, 0x9c, 0xf7, 0xa2, 0xde, 0xf9, 0xde, 0x14,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x10 };
+
+    // Add L to S, which starts at mtx.joinSplitSig[32].
+    unsigned int s = 0;
+    for (size_t i = 0; i < 32; i++) {
+        s = mtx.joinSplitSig.bytes[32 + i] + L[i] + (s >> 8);
+        mtx.joinSplitSig.bytes[32 + i] = s & 0xff;
+    }
+
+    CTransaction tx(mtx);
+    const PrecomputedTransactionData txdata(tx, allPrevOutputs);
+
+    MockCValidationState state;
+    // during initial block download, for transactions being accepted into the
+    // mempool (and thus not mined), DoS ban score should be zero, else 10
+    EXPECT_CALL(state, DoS(0, false, REJECT_INVALID, "bad-txns-invalid-joinsplit-signature", false, "")).Times(1);
+    ContextualCheckShieldedInputs(tx, txdata, state, view, orchardAuth, consensus, saplingBranchId, false, false, [](const Consensus::Params&) { return true; });
+    EXPECT_CALL(state, DoS(10, false, REJECT_INVALID, "bad-txns-invalid-joinsplit-signature", false, "")).Times(1);
+    ContextualCheckShieldedInputs(tx, txdata, state, view, orchardAuth, consensus, saplingBranchId, false, false, [](const Consensus::Params&) { return false; });
+    // for transactions that have been mined in a block, DoS ban score should
+    // always be 100.
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-invalid-joinsplit-signature", false, "")).Times(1);
+    ContextualCheckShieldedInputs(tx, txdata, state, view, orchardAuth, consensus, saplingBranchId, false, true, [](const Consensus::Params&) { return true; });
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-invalid-joinsplit-signature", false, "")).Times(1);
+    ContextualCheckShieldedInputs(tx, txdata, state, view, orchardAuth, consensus, saplingBranchId, false, true, [](const Consensus::Params&) { return false; });
+}
+
+TEST(ChecktransactionTests, OverwinterConstructors) {
+    CMutableTransaction mtx;
+    mtx.fOverwintered = true;
+    mtx.nVersion = OVERWINTER_TX_VERSION;
+    mtx.nVersionGroupId = OVERWINTER_VERSION_GROUP_ID;
+    mtx.nExpiryHeight = 20;
+
+    // Check constructor with overwinter fields
+    CTransaction tx(mtx);
+    EXPECT_EQ(tx.nVersion, mtx.nVersion);
+    EXPECT_EQ(tx.fOverwintered, mtx.fOverwintered);
+    EXPECT_EQ(tx.nVersionGroupId, mtx.nVersionGroupId);
+    EXPECT_EQ(tx.nExpiryHeight, mtx.nExpiryHeight);
+
+    // Check constructor of mutable transaction struct
+    CMutableTransaction mtx2(tx);
+    EXPECT_EQ(mtx2.nVersion, mtx.nVersion);
+    EXPECT_EQ(mtx2.fOverwintered, mtx.fOverwintered);
+    EXPECT_EQ(mtx2.nVersionGroupId, mtx.nVersionGroupId);
+    EXPECT_EQ(mtx2.nExpiryHeight, mtx.nExpiryHeight);
+    EXPECT_TRUE(mtx2.GetHash() == mtx.GetHash());
+
+    // Check assignment of overwinter fields
+    CTransaction tx2 = tx;
+    EXPECT_EQ(tx2.nVersion, mtx.nVersion);
+    EXPECT_EQ(tx2.fOverwintered, mtx.fOverwintered);
+    EXPECT_EQ(tx2.nVersionGroupId, mtx.nVersionGroupId);
+    EXPECT_EQ(tx2.nExpiryHeight, mtx.nExpiryHeight);
+    EXPECT_TRUE(tx2 == tx);
+}
+
+TEST(ChecktransactionTests, OverwinterSerialization) {
+    CMutableTransaction mtx;
+    mtx.fOverwintered = true;
+    mtx.nVersion = OVERWINTER_TX_VERSION;
+    mtx.nVersionGroupId = OVERWINTER_VERSION_GROUP_ID;
+    mtx.nExpiryHeight = 99;
+
+    // Check round-trip serialization and deserialization from mtx to tx.
+    {
+        CDataStream ss(SER_DISK, PROTOCOL_VERSION);
+        ss << mtx;
+        CTransaction tx;
+        ss >> tx;
+        EXPECT_EQ(mtx.nVersion, tx.nVersion);
+        EXPECT_EQ(mtx.fOverwintered, tx.fOverwintered);
+        EXPECT_EQ(mtx.nVersionGroupId, tx.nVersionGroupId);
+        EXPECT_EQ(mtx.nExpiryHeight, tx.nExpiryHeight);
+
+        EXPECT_EQ(mtx.GetHash(), CMutableTransaction(tx).GetHash());
+        EXPECT_EQ(tx.GetHash(), CTransaction(mtx).GetHash());
+    }
+
+    // Also check mtx to mtx
+    {
+        CDataStream ss(SER_DISK, PROTOCOL_VERSION);
+        ss << mtx;
+        CMutableTransaction mtx2;
+        ss >> mtx2;
+        EXPECT_EQ(mtx.nVersion, mtx2.nVersion);
+        EXPECT_EQ(mtx.fOverwintered, mtx2.fOverwintered);
+        EXPECT_EQ(mtx.nVersionGroupId, mtx2.nVersionGroupId);
+        EXPECT_EQ(mtx.nExpiryHeight, mtx2.nExpiryHeight);
+
+        EXPECT_EQ(mtx.GetHash(), mtx2.GetHash());
+    }
+
+    // Also check tx to tx
+    {
+        CTransaction tx(mtx);
+        CDataStream ss(SER_DISK, PROTOCOL_VERSION);
+        ss << tx;
+        CTransaction tx2;
+        ss >> tx2;
+        EXPECT_EQ(tx.nVersion, tx2.nVersion);
+        EXPECT_EQ(tx.fOverwintered, tx2.fOverwintered);
+        EXPECT_EQ(tx.nVersionGroupId, tx2.nVersionGroupId);
+        EXPECT_EQ(tx.nExpiryHeight, tx2.nExpiryHeight);
+
+        EXPECT_EQ(mtx.GetHash(), CMutableTransaction(tx).GetHash());
+        EXPECT_EQ(tx.GetHash(), tx2.GetHash());
+    }
+}
+
+TEST(ChecktransactionTests, OverwinterDefaultValues) {
+    // Check default values (this will fail when defaults change; test should then be updated)
+    CTransaction tx;
+    EXPECT_EQ(tx.nVersion, 1);
+    EXPECT_EQ(tx.fOverwintered, false);
+    EXPECT_EQ(tx.nVersionGroupId, 0);
+    EXPECT_EQ(tx.nExpiryHeight, 0);
+}
+
+// A valid v3 transaction with no joinsplits
+TEST(ChecktransactionTests, OverwinterValidTx) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vJoinSplit.resize(0);
+    mtx.fOverwintered = true;
+    mtx.nVersion = OVERWINTER_TX_VERSION;
+    mtx.nVersionGroupId = OVERWINTER_VERSION_GROUP_ID;
+    mtx.nExpiryHeight = 0;
+    CTransaction tx(mtx);
+    MockCValidationState state;
+    EXPECT_TRUE(CheckTransactionWithoutProofVerification(tx, state));
+}
+
+TEST(ChecktransactionTests, OverwinterExpiryHeight) {
+    const auto& params = RegtestActivateOverwinter();
+    CMutableTransaction mtx = GetValidTransaction(0x5ba81b19);
+    mtx.vJoinSplit.resize(0);
+    mtx.nExpiryHeight = 0;
+
+    {
+        CTransaction tx(mtx);
+        MockCValidationState state;
+        EXPECT_TRUE(CheckTransactionWithoutProofVerification(tx, state));
+        EXPECT_TRUE(ContextualCheckTransaction(tx, state, params, 1, true));
+    }
+
+    {
+        mtx.nExpiryHeight = TX_EXPIRY_HEIGHT_THRESHOLD - 1;
+        CTransaction tx(mtx);
+        MockCValidationState state;
+        EXPECT_TRUE(CheckTransactionWithoutProofVerification(tx, state));
+        EXPECT_TRUE(ContextualCheckTransaction(tx, state, params, 1, true));
+    }
+
+    {
+        mtx.nExpiryHeight = TX_EXPIRY_HEIGHT_THRESHOLD;
+        CTransaction tx(mtx);
+        MockCValidationState state;
+        EXPECT_TRUE(CheckTransactionWithoutProofVerification(tx, state));
+        EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-tx-expiry-height-too-high", false, "")).Times(1);
+        ContextualCheckTransaction(tx, state, params, 1, true);
+    }
+
+    {
+        mtx.nExpiryHeight = std::numeric_limits<uint32_t>::max();
+        CTransaction tx(mtx);
+        MockCValidationState state;
+        EXPECT_TRUE(CheckTransactionWithoutProofVerification(tx, state));
+        EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-tx-expiry-height-too-high", false, "")).Times(1);
+        ContextualCheckTransaction(tx, state, params, 1, true);
+    }
+
+    RegtestDeactivateSapling();
+}
+
+TEST(checktransaction_tests, BlossomExpiryHeight) {
+    const Consensus::Params& params = RegtestActivateBlossom(false, 100).GetConsensus();
+    CMutableTransaction preBlossomMtx = CreateNewContextualCMutableTransaction(params, 99);
+    EXPECT_EQ(preBlossomMtx.nExpiryHeight, 100 - 1);
+    CMutableTransaction blossomMtx = CreateNewContextualCMutableTransaction(params, 100);
+    EXPECT_EQ(blossomMtx.nExpiryHeight, 100 + 40);
+    RegtestDeactivateBlossom();
+}
+
+// Test that a Sprout tx with a negative version number is detected
+// given the new Overwinter logic
+TEST(ChecktransactionTests, SproutTxVersionTooLow) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vJoinSplit.resize(0);
+    mtx.fOverwintered = false;
+    mtx.nVersion = -1;
+
+    EXPECT_THROW((CTransaction(mtx)), std::ios_base::failure);
+    UNSAFE_CTransaction tx(mtx);
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-version-too-low", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+
+
+TEST(ChecktransactionTests, SaplingSproutInputSumsTooLarge) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vJoinSplit.resize(0);
+    mtx.fOverwintered = true;
+    mtx.nVersion = SAPLING_TX_VERSION;
+    mtx.nVersionGroupId = SAPLING_VERSION_GROUP_ID;
+    mtx.nExpiryHeight = 0;
+
+    {
+        // create JSDescription
+        uint256 rt;
+        Ed25519VerificationKey joinSplitPubKey;
+        std::array<libzcash::JSInput, ZC_NUM_JS_INPUTS> inputs = {
+            libzcash::JSInput(),
+            libzcash::JSInput()
+        };
+        std::array<libzcash::JSOutput, ZC_NUM_JS_OUTPUTS> outputs = {
+            libzcash::JSOutput(),
+            libzcash::JSOutput()
+        };
+        std::array<size_t, ZC_NUM_JS_INPUTS> inputMap;
+        std::array<size_t, ZC_NUM_JS_OUTPUTS> outputMap;
+
+        auto jsdesc = JSDescriptionInfo(
+            joinSplitPubKey, rt,
+            inputs, outputs,
+            0, 0
+        ).BuildRandomized(
+            inputMap, outputMap,
+            false);
+
+        mtx.vJoinSplit.push_back(jsdesc);
+    }
+
+    mtx.vShieldedSpend.push_back(SpendDescription());
+
+    mtx.vJoinSplit[0].vpub_new = (MAX_MONEY / 2) + 10;
+
+    {
+        UNSAFE_CTransaction tx(mtx);
+        CValidationState state;
+        EXPECT_TRUE(CheckTransactionWithoutProofVerification(tx, state));
+    }
+
+    mtx.valueBalanceSapling = (MAX_MONEY / 2) + 10;
+
+    {
+        UNSAFE_CTransaction tx(mtx);
+        MockCValidationState state;
+        EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-txintotal-toolarge", false, "")).Times(1);
+        CheckTransactionWithoutProofVerification(tx, state);
+    }
+}
+
+// Test bad Overwinter version number in CheckTransactionWithoutProofVerification
+TEST(ChecktransactionTests, OverwinterVersionNumberLow) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vJoinSplit.resize(0);
+    mtx.fOverwintered = true;
+    mtx.nVersion = OVERWINTER_MIN_TX_VERSION - 1;
+    mtx.nVersionGroupId = OVERWINTER_VERSION_GROUP_ID;
+    mtx.nExpiryHeight = 0;
+
+    EXPECT_THROW((CTransaction(mtx)), std::ios_base::failure);
+    UNSAFE_CTransaction tx(mtx);
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-tx-overwinter-version-too-low", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+// Test bad Overwinter version number in ContextualCheckTransaction
+TEST(ChecktransactionTests, OverwinterVersionNumberHigh) {
+    SelectParams(CBaseChainParams::REGTEST);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vJoinSplit.resize(0);
+    mtx.fOverwintered = true;
+    mtx.nVersion = OVERWINTER_MAX_TX_VERSION + 1;
+    mtx.nVersionGroupId = OVERWINTER_VERSION_GROUP_ID;
+    mtx.nExpiryHeight = 0;
+
+    EXPECT_THROW((CTransaction(mtx)), std::ios_base::failure);
+    UNSAFE_CTransaction tx(mtx);
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-tx-overwinter-version-too-high", false, "")).Times(1);
+    ContextualCheckTransaction(tx, state, Params(), 1, true);
+
+    // Revert to default
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+}
+
+
+// Test bad Overwinter version group id
+TEST(ChecktransactionTests, OverwinterBadVersionGroupId) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vJoinSplit.resize(0);
+    mtx.fOverwintered = true;
+    mtx.nVersion = OVERWINTER_TX_VERSION;
+    mtx.nExpiryHeight = 0;
+    mtx.nVersionGroupId = 0x12345678;
+
+    EXPECT_THROW((CTransaction(mtx)), std::ios_base::failure);
+    UNSAFE_CTransaction tx(mtx);
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-tx-version-group-id", false, "")).Times(1);
+    CheckTransactionWithoutProofVerification(tx, state);
+}
+
+// This tests an Overwinter transaction checked against Sprout
+TEST(ChecktransactionTests, OverwinterNotActive) {
+    SelectParams(CBaseChainParams::TESTNET);
+    auto chainparams = Params();
+
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.fOverwintered = true;
+    mtx.nVersion = OVERWINTER_TX_VERSION;
+    mtx.nVersionGroupId = OVERWINTER_VERSION_GROUP_ID;
+    mtx.nExpiryHeight = 0;
+
+    CTransaction tx(mtx);
+    MockCValidationState state;
+    // during initial block download, for transactions being accepted into the
+    // mempool (and thus not mined), DoS ban score should be zero, else 10
+    EXPECT_CALL(state, DoS(0, false, REJECT_INVALID, "tx-overwinter-not-active", false, "")).Times(1);
+    ContextualCheckTransaction(tx, state, chainparams, 0, false, [](const Consensus::Params&) { return true; });
+    EXPECT_CALL(state, DoS(10, false, REJECT_INVALID, "tx-overwinter-not-active", false, "")).Times(1);
+    ContextualCheckTransaction(tx, state, chainparams, 0, false, [](const Consensus::Params&) { return false; });
+    // for transactions that have been mined in a block, DoS ban score should
+    // always be 100.
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "tx-overwinter-not-active", false, "")).Times(1);
+    ContextualCheckTransaction(tx, state, chainparams, 0, true, [](const Consensus::Params&) { return true; });
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "tx-overwinter-not-active", false, "")).Times(1);
+    ContextualCheckTransaction(tx, state, chainparams, 0, true, [](const Consensus::Params&) { return false; });
+}
+
+// This tests a transaction without the fOverwintered flag set, against the Overwinter consensus rule set.
+TEST(ChecktransactionTests, OverwinterFlagNotSet) {
+    SelectParams(CBaseChainParams::REGTEST);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.fOverwintered = false;
+    mtx.nVersion = OVERWINTER_TX_VERSION;
+    mtx.nVersionGroupId = OVERWINTER_VERSION_GROUP_ID;
+    mtx.nExpiryHeight = 0;
+
+    CTransaction tx(mtx);
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "tx-overwintered-flag-not-set", false, "")).Times(1);
+    ContextualCheckTransaction(tx, state, Params(), 1, true);
+
+    // Revert to default
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+}
+
+
+// Overwinter (NU0) does not allow soft fork to version 4 Overwintered tx.
+TEST(ChecktransactionTests, OverwinterInvalidSoftForkVersion) {
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.fOverwintered = true;
+    mtx.nVersion = 4; // This is not allowed
+    mtx.nVersionGroupId = OVERWINTER_VERSION_GROUP_ID;
+    mtx.nExpiryHeight = 0;
+
+    CDataStream ss(SER_DISK, PROTOCOL_VERSION);
+    try {
+        ss << mtx;
+        FAIL() << "Expected std::ios_base::failure 'Unknown transaction format'";
+    }
+    catch(std::ios_base::failure & err) {
+        EXPECT_THAT(err.what(), testing::HasSubstr(std::string("Unknown transaction format")));
+    }
+    catch(...) {
+        FAIL() << "Expected std::ios_base::failure 'Unknown transaction format', got some other exception";
+    }
+}
+
+static void ContextualCreateTxCheck(const Consensus::Params& params, int nHeight,
+    int expectedVersion, bool expectedOverwintered, int expectedVersionGroupId, int expectedExpiryHeight)
+{
+    CMutableTransaction mtx = CreateNewContextualCMutableTransaction(params, nHeight);
+    EXPECT_EQ(mtx.nVersion, expectedVersion);
+    EXPECT_EQ(mtx.fOverwintered, expectedOverwintered);
+    EXPECT_EQ(mtx.nVersionGroupId, expectedVersionGroupId);
+    EXPECT_EQ(mtx.nExpiryHeight, expectedExpiryHeight);
+}
+
+
+// Test CreateNewContextualCMutableTransaction sets default values based on height
+TEST(ChecktransactionTests, OverwinteredContextualCreateTx) {
+    SelectParams(CBaseChainParams::REGTEST);
+    const Consensus::Params& params = Params().GetConsensus();
+    int overwinterActivationHeight = 5;
+    int saplingActivationHeight = 30;
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, overwinterActivationHeight);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_SAPLING, saplingActivationHeight);
+
+    ContextualCreateTxCheck(params, overwinterActivationHeight - 1,
+        1, false, 0, 0);
+    // Overwinter activates
+    ContextualCreateTxCheck(params, overwinterActivationHeight,
+        OVERWINTER_TX_VERSION, true, OVERWINTER_VERSION_GROUP_ID, overwinterActivationHeight + DEFAULT_PRE_BLOSSOM_TX_EXPIRY_DELTA);
+    // Close to Sapling activation
+    ContextualCreateTxCheck(params, saplingActivationHeight - DEFAULT_PRE_BLOSSOM_TX_EXPIRY_DELTA - 2,
+        OVERWINTER_TX_VERSION, true, OVERWINTER_VERSION_GROUP_ID, saplingActivationHeight - 2);
+    ContextualCreateTxCheck(params, saplingActivationHeight - DEFAULT_PRE_BLOSSOM_TX_EXPIRY_DELTA - 1,
+        OVERWINTER_TX_VERSION, true, OVERWINTER_VERSION_GROUP_ID, saplingActivationHeight - 1);
+    ContextualCreateTxCheck(params, saplingActivationHeight - DEFAULT_PRE_BLOSSOM_TX_EXPIRY_DELTA,
+        OVERWINTER_TX_VERSION, true, OVERWINTER_VERSION_GROUP_ID, saplingActivationHeight - 1);
+    ContextualCreateTxCheck(params, saplingActivationHeight - DEFAULT_PRE_BLOSSOM_TX_EXPIRY_DELTA + 1,
+        OVERWINTER_TX_VERSION, true, OVERWINTER_VERSION_GROUP_ID, saplingActivationHeight - 1);
+    ContextualCreateTxCheck(params, saplingActivationHeight - DEFAULT_PRE_BLOSSOM_TX_EXPIRY_DELTA + 2,
+        OVERWINTER_TX_VERSION, true, OVERWINTER_VERSION_GROUP_ID, saplingActivationHeight - 1);
+    ContextualCreateTxCheck(params, saplingActivationHeight - DEFAULT_PRE_BLOSSOM_TX_EXPIRY_DELTA + 3,
+        OVERWINTER_TX_VERSION, true, OVERWINTER_VERSION_GROUP_ID, saplingActivationHeight - 1);
+    // Just before Sapling activation
+    ContextualCreateTxCheck(params, saplingActivationHeight - 4,
+        OVERWINTER_TX_VERSION, true, OVERWINTER_VERSION_GROUP_ID, saplingActivationHeight - 1);
+    ContextualCreateTxCheck(params, saplingActivationHeight - 3,
+        OVERWINTER_TX_VERSION, true, OVERWINTER_VERSION_GROUP_ID, saplingActivationHeight - 1);
+    ContextualCreateTxCheck(params, saplingActivationHeight - 2,
+        OVERWINTER_TX_VERSION, true, OVERWINTER_VERSION_GROUP_ID, saplingActivationHeight - 1);
+    ContextualCreateTxCheck(params, saplingActivationHeight - 1,
+        OVERWINTER_TX_VERSION, true, OVERWINTER_VERSION_GROUP_ID, saplingActivationHeight - 1);
+    // Sapling activates
+    ContextualCreateTxCheck(params, saplingActivationHeight,
+        SAPLING_TX_VERSION, true, SAPLING_VERSION_GROUP_ID, saplingActivationHeight + DEFAULT_PRE_BLOSSOM_TX_EXPIRY_DELTA);
+
+    // Revert to default
+    RegtestDeactivateSapling();
+}
+
+// Test a v1 transaction which has a malformed header, perhaps modified in-flight
+TEST(ChecktransactionTests, BadTxReceivedOverNetwork)
+{
+    // First four bytes <01 00 00 00> have been modified to be <FC FF FF FF> (-4 as an int32)
+    std::string goodPrefix = "01000000";
+    std::string badPrefix = "fcffffff";
+    std::string hexTx = "0176c6541939b95f8d8b7779a77a0863b2a0267e281a050148326f0ea07c3608fb000000006a47304402207c68117a6263486281af0cc5d3bee6db565b6dce19ffacc4cb361906eece82f8022007f604382dee2c1fde41c4e6e7c1ae36cfa28b5b27350c4bfaa27f555529eace01210307ff9bef60f2ac4ceb1169a9f7d2c773d6c7f4ab6699e1e5ebc2e0c6d291c733feffffff02c0d45407000000001976a9145eaaf6718517ec8a291c6e64b16183292e7011f788ac5ef44534000000001976a91485e12fb9967c96759eae1c6b1e9c07ce977b638788acbe000000";
+
+    // Good v1 tx
+    {
+        std::vector<unsigned char> txData(ParseHex(goodPrefix + hexTx ));
+        CDataStream ssData(txData, SER_NETWORK, PROTOCOL_VERSION);
+        CTransaction tx;
+        ssData >> tx;
+        EXPECT_EQ(tx.nVersion, 1);
+        EXPECT_EQ(tx.fOverwintered, false);
+    }
+
+    // Good v1 mutable tx
+    {
+        std::vector<unsigned char> txData(ParseHex(goodPrefix + hexTx ));
+        CDataStream ssData(txData, SER_NETWORK, PROTOCOL_VERSION);
+        CMutableTransaction mtx;
+        ssData >> mtx;
+        EXPECT_EQ(mtx.nVersion, 1);
+    }
+
+    // Bad tx
+    {
+        std::vector<unsigned char> txData(ParseHex(badPrefix + hexTx ));
+        CDataStream ssData(txData, SER_NETWORK, PROTOCOL_VERSION);
+        try {
+            CTransaction tx;
+            ssData >> tx;
+            FAIL() << "Expected std::ios_base::failure 'Unknown transaction format'";
+        }
+        catch(std::ios_base::failure & err) {
+            EXPECT_THAT(err.what(), testing::HasSubstr(std::string("Unknown transaction format")));
+        }
+        catch(...) {
+            FAIL() << "Expected std::ios_base::failure 'Unknown transaction format', got some other exception";
+        }
+    }
+
+    // Bad mutable tx
+    {
+        std::vector<unsigned char> txData(ParseHex(badPrefix + hexTx ));
+        CDataStream ssData(txData, SER_NETWORK, PROTOCOL_VERSION);
+        try {
+            CMutableTransaction mtx;
+            ssData >> mtx;
+            FAIL() << "Expected std::ios_base::failure 'Unknown transaction format'";
+        }
+        catch(std::ios_base::failure & err) {
+            EXPECT_THAT(err.what(), testing::HasSubstr(std::string("Unknown transaction format")));
+        }
+        catch(...) {
+            FAIL() << "Expected std::ios_base::failure 'Unknown transaction format', got some other exception";
+        }
+    }
+}
+
+TEST(ChecktransactionTests, InvalidSaplingShieldedCoinbase) {
+    RegtestActivateSapling();
+
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.fOverwintered = true;
+    mtx.nVersionGroupId = SAPLING_VERSION_GROUP_ID;
+    mtx.nVersion = SAPLING_TX_VERSION;
+
+    // Make it an invalid shielded coinbase (no ciphertexts or commitments).
+    mtx.vin.resize(1);
+    mtx.vin[0].prevout.SetNull();
+    mtx.vShieldedOutput.resize(1);
+    mtx.vJoinSplit.resize(0);
+
+    CTransaction tx(mtx);
+    EXPECT_TRUE(tx.IsCoinBase());
+
+    // Before Heartwood, output descriptions are rejected.
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-cb-has-output-description", false, "")).Times(1);
+    ContextualCheckTransaction(tx, state, Params(), 10, 57);
+
+    RegtestActivateHeartwood(false, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+
+    // From Heartwood, the output description is allowed but invalid (undecryptable).
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-cb-output-desc-invalid-outct", false, "")).Times(1);
+    ContextualCheckTransaction(tx, state, Params(), 10, 57);
+
+    RegtestDeactivateHeartwood();
+}
+
+TEST(ChecktransactionTests, HeartwoodAcceptsSaplingShieldedCoinbase) {
+    LoadProofParameters();
+
+    RegtestActivateHeartwood(false, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+    auto chainparams = Params();
+
+    uint256 ovk;
+    auto note = libzcash::SaplingNote(
+        libzcash::SaplingSpendingKey::random().default_address(), CAmount(123456), libzcash::Zip212Enabled::BeforeZip212);
+    auto output = OutputDescriptionInfo(ovk, note, {{0xF6}});
+
+    auto ctx = librustzcash_sapling_proving_ctx_init();
+    auto odesc = output.Build(ctx).value();
+    librustzcash_sapling_proving_ctx_free(ctx);
+
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.fOverwintered = true;
+    mtx.nVersionGroupId = SAPLING_VERSION_GROUP_ID;
+    mtx.nVersion = SAPLING_TX_VERSION;
+
+    mtx.vin.resize(1);
+    mtx.vin[0].prevout.SetNull();
+    mtx.vJoinSplit.resize(0);
+    mtx.vShieldedOutput.push_back(odesc);
+
+    // Transaction should fail with a bad public cmu.
+    {
+        auto cmOrig = mtx.vShieldedOutput[0].cmu;
+        mtx.vShieldedOutput[0].cmu = uint256S("1234");
+        CTransaction tx(mtx);
+        EXPECT_TRUE(tx.IsCoinBase());
+
+        MockCValidationState state;
+        EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-cb-output-desc-invalid-outct", false, "")).Times(1);
+        ContextualCheckTransaction(tx, state, chainparams, 10, 57);
+
+        mtx.vShieldedOutput[0].cmu = cmOrig;
+    }
+
+    // Transaction should fail with a bad outCiphertext.
+    {
+        auto outCtOrig = mtx.vShieldedOutput[0].outCiphertext;
+        mtx.vShieldedOutput[0].outCiphertext = {{}};
+        CTransaction tx(mtx);
+        EXPECT_TRUE(tx.IsCoinBase());
+
+        MockCValidationState state;
+        EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-cb-output-desc-invalid-outct", false, "")).Times(1);
+        ContextualCheckTransaction(tx, state, chainparams, 10, 57);
+
+        mtx.vShieldedOutput[0].outCiphertext = outCtOrig;
+    }
+
+    // Transaction should fail with a bad encCiphertext.
+    {
+        auto encCtOrig = mtx.vShieldedOutput[0].encCiphertext;
+        mtx.vShieldedOutput[0].encCiphertext = {{}};
+        CTransaction tx(mtx);
+        EXPECT_TRUE(tx.IsCoinBase());
+
+        MockCValidationState state;
+        EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-cb-output-desc-invalid-encct", false, "")).Times(1);
+        ContextualCheckTransaction(tx, state, chainparams, 10, 57);
+
+        mtx.vShieldedOutput[0].encCiphertext = encCtOrig;
+    }
+
+    // Test the success case.
+    {
+        CTransaction tx(mtx);
+        EXPECT_TRUE(tx.IsCoinBase());
+
+        MockCValidationState state;
+        EXPECT_TRUE(ContextualCheckTransaction(tx, state, chainparams, 10, 57));
+    }
+
+    RegtestDeactivateHeartwood();
+}
+
+// Check that the consensus rules relevant to valueBalanceSapling, vShieldedOutput, and
+// bindingSig from https://zips.z.cash/protocol/protocol.pdf#txnencoding are
+// applied to coinbase transactions.
+TEST(ChecktransactionTests, HeartwoodEnforcesSaplingRulesOnShieldedCoinbase) {
+    LoadProofParameters();
+
+    RegtestActivateHeartwood(false, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+    auto chainparams = Params();
+
+    uint256 ovk;
+    auto note = libzcash::SaplingNote(
+        libzcash::SaplingSpendingKey::random().default_address(), CAmount(123456), libzcash::Zip212Enabled::BeforeZip212);
+    auto output = OutputDescriptionInfo(ovk, note, {{0xF6}});
+
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.fOverwintered = true;
+    mtx.nVersionGroupId = SAPLING_VERSION_GROUP_ID;
+    mtx.nVersion = SAPLING_TX_VERSION;
+
+    mtx.vin.resize(1);
+    mtx.vin[0].prevout.SetNull();
+    mtx.vin[0].scriptSig << 123;
+    mtx.vJoinSplit.resize(0);
+    mtx.valueBalanceSapling = -1000;
+
+    // Coinbase transaction should fail non-contextual checks with no shielded
+    // outputs and non-zero valueBalanceSapling.
+    {
+        CTransaction tx(mtx);
+        EXPECT_TRUE(tx.IsCoinBase());
+
+        MockCValidationState state;
+        EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-valuebalance-nonzero", false, "")).Times(1);
+        EXPECT_FALSE(CheckTransactionWithoutProofVerification(tx, state));
+    }
+
+    // Add a Sapling output.
+    auto ctx = librustzcash_sapling_proving_ctx_init();
+    auto odesc = output.Build(ctx).value();
+    librustzcash_sapling_proving_ctx_free(ctx);
+    mtx.vShieldedOutput.push_back(odesc);
+
+    // Coinbase transaction should fail non-contextual checks with valueBalanceSapling
+    // out of range.
+    {
+        mtx.valueBalanceSapling = MAX_MONEY + 1;
+        EXPECT_THROW((CTransaction(mtx)), std::ios_base::failure);
+        UNSAFE_CTransaction tx(mtx);
+        EXPECT_TRUE(tx.IsCoinBase());
+
+        MockCValidationState state;
+        EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-valuebalance-toolarge", false, "")).Times(1);
+        EXPECT_FALSE(CheckTransactionWithoutProofVerification(tx, state));
+    }
+    {
+        mtx.valueBalanceSapling = -MAX_MONEY - 1;
+        EXPECT_THROW((CTransaction(mtx)), std::ios_base::failure);
+        UNSAFE_CTransaction tx(mtx);
+        EXPECT_TRUE(tx.IsCoinBase());
+
+        MockCValidationState state;
+        EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-valuebalance-toolarge", false, "")).Times(1);
+        EXPECT_FALSE(CheckTransactionWithoutProofVerification(tx, state));
+    }
+
+    mtx.valueBalanceSapling = -1000;
+    CTransaction tx(mtx);
+    EXPECT_TRUE(tx.IsCoinBase());
+
+    // Coinbase transaction should now pass non-contextual checks.
+    MockCValidationState state;
+    EXPECT_TRUE(CheckTransactionWithoutProofVerification(tx, state));
+
+    // Coinbase transaction should pass contextual checks.
+    EXPECT_TRUE(ContextualCheckTransaction(tx, state, chainparams, 10, 57));
+
+    auto orchardAuth = orchard::AuthValidator::Disabled();
+    auto heartwoodBranchId = NetworkUpgradeInfo[Consensus::UPGRADE_HEARTWOOD].nBranchId;
+
+    // Coinbase transaction does not pass shielded input checks, as bindingSig
+    // consensus rule is enforced.
+    // - Note that coinbase txs don't have a previous output corresponding to
+    //   their transparent input; ZIP 244 handles this by making the coinbase
+    //   sighash the txid.
+    PrecomputedTransactionData txdata(tx, {});
+    AssumeShieldedInputsExistAndAreSpendable baseView;
+    CCoinsViewCache view(&baseView);
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-sapling-binding-signature-invalid", false, "")).Times(1);
+    EXPECT_FALSE(ContextualCheckShieldedInputs(
+        tx, txdata, state, view, orchardAuth, chainparams.GetConsensus(), heartwoodBranchId, false, true));
+
+    RegtestDeactivateHeartwood();
+}
+
+
+TEST(ChecktransactionTests, CanopyRejectsNonzeroVPubOld) {
+    RegtestActivateSapling();
+
+    CMutableTransaction mtx = GetValidTransaction(NetworkUpgradeInfo[Consensus::UPGRADE_SAPLING].nBranchId);
+
+    // Make a JoinSplit with nonzero vpub_old
+    mtx.vJoinSplit.resize(1);
+    mtx.vJoinSplit[0].vpub_old = 1;
+    mtx.vJoinSplit[0].vpub_new = 0;
+    mtx.vJoinSplit[0].proof = libzcash::GrothProof();
+    CreateJoinSplitSignature(mtx, NetworkUpgradeInfo[Consensus::UPGRADE_SAPLING].nBranchId);
+
+    CTransaction tx(mtx);
+
+    // Before Canopy, nonzero vpub_old is accepted in both non-contextual and contextual checks
+    MockCValidationState state;
+    EXPECT_TRUE(CheckTransactionWithoutProofVerification(tx, state));
+    EXPECT_TRUE(ContextualCheckTransaction(tx, state, Params(), 1, true));
+
+    RegtestActivateCanopy(false, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+
+    // After Canopy, nonzero vpub_old is accepted in non-contextual checks but rejected in contextual checks
+    EXPECT_TRUE(CheckTransactionWithoutProofVerification(tx, state));
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-vpub_old-nonzero", false, "")).Times(1);
+    EXPECT_FALSE(ContextualCheckTransaction(tx, state, Params(), 10, true));
+
+    RegtestDeactivateCanopy();
+
+}
+
+TEST(ChecktransactionTests, CanopyAcceptsZeroVPubOld) {
+
+    CMutableTransaction mtx = GetValidTransaction(NetworkUpgradeInfo[Consensus::UPGRADE_SAPLING].nBranchId);
+
+    // Make a JoinSplit with zero vpub_old
+    mtx.vJoinSplit.resize(1);
+    mtx.vJoinSplit[0].vpub_old = 0;
+    mtx.vJoinSplit[0].vpub_new = 1;
+    mtx.vJoinSplit[0].proof = libzcash::GrothProof();
+    CreateJoinSplitSignature(mtx, NetworkUpgradeInfo[Consensus::UPGRADE_CANOPY].nBranchId);
+
+    CTransaction tx(mtx);
+
+    // After Canopy, zero value vpub_old (i.e. unshielding) is accepted in both non-contextual and contextual checks
+    MockCValidationState state;
+
+    RegtestActivateCanopy(false, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+
+    EXPECT_TRUE(CheckTransactionWithoutProofVerification(tx, state));
+    EXPECT_TRUE(ContextualCheckTransaction(tx, state, Params(), 10, true));
+
+    RegtestDeactivateCanopy();
+
+}
+
+TEST(ChecktransactionTests, InvalidOrchardShieldedCoinbase) {
+    LoadProofParameters();
+    RegtestActivateCanopy();
+
+    CMutableTransaction mtx;
+    mtx.fOverwintered = true;
+    mtx.nVersionGroupId = ZIP225_VERSION_GROUP_ID;
+    mtx.nVersion = ZIP225_TX_VERSION;
+    mtx.nConsensusBranchId = NetworkUpgradeInfo[Consensus::UPGRADE_NU5].nBranchId;
+
+    // Make it an invalid shielded coinbase, by creating an all-dummy Orchard bundle.
+    mtx.vin.resize(1);
+    mtx.vin[0].prevout.SetNull();
+    mtx.orchardBundle = orchard::Builder(false, true, uint256())
+        .Build().value()
+        .ProveAndSign({}, uint256()).value();
+
+    CTransaction tx(mtx);
+    EXPECT_TRUE(tx.IsCoinBase());
+
+    // Before NU5, v5 transactions are rejected.
+    MockCValidationState state;
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-sapling-tx-version-group-id", false, "")).Times(1);
+    ContextualCheckTransaction(tx, state, Params(), 10, 57);
+
+    RegtestActivateNU5();
+
+    // From NU5, the Orchard actions are allowed but invalid (undecryptable).
+    EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-cb-action-invalid-ciphertext", false, "")).Times(1);
+    ContextualCheckTransaction(tx, state, Params(), 10, 57);
+
+    RegtestDeactivateNU5();
+}
+
+TEST(ChecktransactionTests, NU5AcceptsOrchardShieldedCoinbase) {
+    LoadProofParameters();
+    RegtestActivateNU5();
+    auto chainparams = Params();
+
+    uint256 orchardAnchor;
+    auto builder = orchard::Builder(false, true, orchardAnchor);
+
+    // Shielded coinbase outputs must be recoverable with an all-zeroes ovk.
+    RawHDSeed rawSeed(32, 0);
+    GetRandBytes(rawSeed.data(), 32);
+    auto to = libzcash::OrchardSpendingKey::ForAccount(HDSeed(rawSeed), Params().BIP44CoinType(), 0)
+        .ToFullViewingKey()
+        .ToIncomingViewingKey()
+        .Address(0);
+    uint256 ovk;
+    builder.AddOutput(ovk, to, CAmount(123456), std::nullopt);
+
+    // orchard::Builder pads to two Actions, but does so using a "no OVK" policy for
+    // dummy outputs, which violates coinbase rules requiring all shielded outputs to
+    // be recoverable. We manually add a dummy output to sidestep this issue.
+    // TODO: If/when we have funding streams going to Orchard recipients, this dummy
+    // output can be removed.
+    builder.AddOutput(ovk, to, 0, std::nullopt);
+
+    auto bundle = builder
+        .Build().value()
+        .ProveAndSign({}, uint256()).value();
+
+    CMutableTransaction mtx;
+    mtx.fOverwintered = true;
+    mtx.nVersionGroupId = ZIP225_VERSION_GROUP_ID;
+    mtx.nVersion = ZIP225_TX_VERSION;
+    mtx.nConsensusBranchId = NetworkUpgradeInfo[Consensus::UPGRADE_NU5].nBranchId;
+
+    mtx.vin.resize(1);
+    mtx.vin[0].prevout.SetNull();
+    mtx.orchardBundle = bundle;
+
+    CTransaction tx(mtx);
+    EXPECT_TRUE(tx.IsCoinBase());
+
+    // Write the transaction bytes out so we can modify them to test failure cases.
+    CDataStream ss(SER_DISK, PROTOCOL_VERSION);
+    ss << tx;
+
+    // Define some constants to use when calculating offsets to modify below.
+    const size_t HEADER_SIZE = 4 + 4 + 4 + 4 + 4;
+    const size_t TRANSPARENT_BUNDLE_SIZE = 1 + 32 + 4 + 1 + 4 + 1;
+    const size_t SAPLING_BUNDLE_SIZE = 1 + 1;
+    const size_t ORCHARD_BUNDLE_START = (HEADER_SIZE + TRANSPARENT_BUNDLE_SIZE + SAPLING_BUNDLE_SIZE);
+    const size_t ORCHARD_BUNDLE_CMX_OFFSET = (ORCHARD_BUNDLE_START + ZC_ZIP225_ORCHARD_NUM_ACTIONS_SIZE + 32 + 32 + 32);
+    const size_t ORCHARD_CMX_SIZE = 32;
+
+    // Verify the transaction is the expected size.
+    size_t txsize = ORCHARD_BUNDLE_START + ZC_ZIP225_ORCHARD_BASE_SIZE + ZC_ZIP225_ORCHARD_MARGINAL_SIZE * 2;
+    EXPECT_EQ(ss.size(), txsize);
+
+    // Transaction should fail with a bad public cmx.
+    {
+        auto cmxBad = uint256S("1234");
+        std::vector<char> txBytes(ss.begin(), ss.end());
+        std::copy(cmxBad.begin(), cmxBad.end(), txBytes.data() + ORCHARD_BUNDLE_CMX_OFFSET);
+
+        CDataStream ssBad(txBytes, SER_DISK, PROTOCOL_VERSION);
+        CTransaction tx;
+        ssBad >> tx;
+        EXPECT_TRUE(tx.IsCoinBase());
+
+        MockCValidationState state;
+        EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-cb-action-invalid-ciphertext", false, "")).Times(1);
+        ContextualCheckTransaction(tx, state, chainparams, 10, 57);
+    }
+
+    // Transaction should fail with a bad encCiphertext.
+    {
+        std::vector<char> txBytes(ss.begin(), ss.end());
+        for (int i = 0; i < ZC_SAPLING_ENCCIPHERTEXT_SIZE; i++) {
+            txBytes[ORCHARD_BUNDLE_CMX_OFFSET + ORCHARD_CMX_SIZE + i] = 0;
+        }
+
+        CDataStream ssBad(txBytes, SER_DISK, PROTOCOL_VERSION);
+        CTransaction tx;
+        ssBad >> tx;
+        EXPECT_TRUE(tx.IsCoinBase());
+
+        MockCValidationState state;
+        EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-cb-action-invalid-ciphertext", false, "")).Times(1);
+        ContextualCheckTransaction(tx, state, chainparams, 10, 57);
+    }
+
+    // Transaction should fail with a bad outCiphertext.
+    {
+        std::vector<char> txBytes(ss.begin(), ss.end());
+        for (int i = 0; i < ZC_SAPLING_OUTCIPHERTEXT_SIZE; i++) {
+            txBytes[ORCHARD_BUNDLE_CMX_OFFSET + ORCHARD_CMX_SIZE + ZC_SAPLING_ENCCIPHERTEXT_SIZE + i] = 0;
+        }
+
+        CDataStream ssBad(txBytes, SER_DISK, PROTOCOL_VERSION);
+        CTransaction tx;
+        ssBad >> tx;
+        EXPECT_TRUE(tx.IsCoinBase());
+
+        MockCValidationState state;
+        EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-cb-action-invalid-ciphertext", false, "")).Times(1);
+        ContextualCheckTransaction(tx, state, chainparams, 10, 57);
+    }
+
+    // Test the success case.
+    {
+        MockCValidationState state;
+        EXPECT_TRUE(ContextualCheckTransaction(tx, state, chainparams, 10, 57));
+    }
+
+    RegtestDeactivateNU5();
+}
+
+// Check that the consensus rules relevant to valueBalanceOrchard, and
+// vOrchardActions from https://zips.z.cash/protocol/protocol.pdf#txnencoding
+// are applied to coinbase transactions.
+TEST(ChecktransactionTests, NU5EnforcesOrchardRulesOnShieldedCoinbase) {
+    LoadProofParameters();
+    RegtestActivateNU5();
+    auto chainparams = Params();
+
+    uint256 orchardAnchor;
+    auto builder = orchard::Builder(false, true, orchardAnchor);
+
+    // Shielded coinbase outputs must be recoverable with an all-zeroes ovk.
+    RawHDSeed rawSeed(32, 0);
+    GetRandBytes(rawSeed.data(), 32);
+    auto to = libzcash::OrchardSpendingKey::ForAccount(HDSeed(rawSeed), Params().BIP44CoinType(), 0)
+        .ToFullViewingKey()
+        .ToIncomingViewingKey()
+        .Address(0);
+    uint256 ovk;
+    builder.AddOutput(ovk, to, CAmount(1000), std::nullopt);
+
+    // orchard::Builder pads to two Actions, but does so using a "no OVK" policy for
+    // dummy outputs, which violates coinbase rules requiring all shielded outputs to
+    // be recoverable. We manually add a dummy output to sidestep this issue.
+    // TODO: If/when we have funding streams going to Orchard recipients, this dummy
+    // output can be removed.
+    builder.AddOutput(ovk, to, 0, std::nullopt);
+
+    auto bundle = builder
+        .Build().value()
+        .ProveAndSign({}, uint256()).value();
+
+    CMutableTransaction mtx;
+    mtx.fOverwintered = true;
+    mtx.nVersionGroupId = ZIP225_VERSION_GROUP_ID;
+    mtx.nVersion = ZIP225_TX_VERSION;
+    mtx.nConsensusBranchId = NetworkUpgradeInfo[Consensus::UPGRADE_NU5].nBranchId;
+
+    mtx.vin.resize(1);
+    mtx.vin[0].prevout.SetNull();
+    mtx.vin[0].scriptSig << 123;
+    mtx.orchardBundle = bundle;
+
+    CTransaction tx(mtx);
+    EXPECT_TRUE(tx.IsCoinBase());
+
+    // Write the transaction bytes out so we can modify them to test failure cases.
+    CDataStream ss(SER_DISK, PROTOCOL_VERSION);
+    ss << tx;
+
+    // Define some constants to use when calculating offsets to modify below.
+    const size_t HEADER_SIZE = 4 + 4 + 4 + 4 + 4;
+    const size_t TRANSPARENT_BUNDLE_SIZE = 1 + 32 + 4 + 1 + 2 + 4 + 1;
+    const size_t SAPLING_BUNDLE_SIZE = 1 + 1;
+    const size_t ORCHARD_BUNDLE_START = (HEADER_SIZE + TRANSPARENT_BUNDLE_SIZE + SAPLING_BUNDLE_SIZE);
+    const size_t ORCHARD_BUNDLE_VALUEBALANCE_OFFSET = (
+        ORCHARD_BUNDLE_START +
+        ZC_ZIP225_ORCHARD_NUM_ACTIONS_SIZE +
+        ZC_ZIP225_ORCHARD_ACTION_SIZE * 2 +
+        ZC_ZIP225_ORCHARD_FLAGS_SIZE);
+
+    // Verify the transaction is the expected size.
+    size_t txsize = ORCHARD_BUNDLE_START + ZC_ZIP225_ORCHARD_BASE_SIZE + ZC_ZIP225_ORCHARD_MARGINAL_SIZE * 2;
+    EXPECT_EQ(ss.size(), txsize);
+
+    // Coinbase transaction should fail non-contextual checks with valueBalanceSapling
+    // out of range.
+    {
+        std::vector<char> txBytes(ss.begin(), ss.end());
+        uint64_t valueBalanceBad = htole64(MAX_MONEY + 1);
+        std::copy((char*)&valueBalanceBad, (char*)&valueBalanceBad + 8, txBytes.data() + ORCHARD_BUNDLE_VALUEBALANCE_OFFSET);
+
+        CDataStream ssBad(txBytes, SER_DISK, PROTOCOL_VERSION);
+        CTransaction tx;
+        EXPECT_THROW((ssBad >> tx), std::ios_base::failure);
+
+        // We can't actually reach the CheckTransactionWithoutProofVerification
+        // consensus rule, because Rust is doing this validation at parse time.
+        // MockCValidationState state;
+        // EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-valuebalance-toolarge", false, "")).Times(1);
+        // EXPECT_FALSE(CheckTransactionWithoutProofVerification(tx, state));
+    }
+    {
+        std::vector<char> txBytes(ss.begin(), ss.end());
+        uint64_t valueBalanceBad = htole64(-MAX_MONEY - 1);
+        std::copy((char*)&valueBalanceBad, (char*)&valueBalanceBad + 8, txBytes.data() + ORCHARD_BUNDLE_VALUEBALANCE_OFFSET);
+
+        CDataStream ssBad(txBytes, SER_DISK, PROTOCOL_VERSION);
+        CTransaction tx;
+        EXPECT_THROW((ssBad >> tx), std::ios_base::failure);
+
+        // We can't actually reach the CheckTransactionWithoutProofVerification
+        // consensus rule, because Rust is doing this validation at parse time.
+        // MockCValidationState state;
+        // EXPECT_CALL(state, DoS(100, false, REJECT_INVALID, "bad-txns-valuebalance-toolarge", false, "")).Times(1);
+        // EXPECT_FALSE(CheckTransactionWithoutProofVerification(tx, state));
+    }
+
+    // Test the success case.
+    {
+        // The unmodified coinbase transaction should pass non-contextual checks.
+        MockCValidationState state;
+        EXPECT_TRUE(CheckTransactionWithoutProofVerification(tx, state));
+
+        // Coinbase transaction should pass contextual checks, as bindingSigOrchard
+        // consensus rule is not enforced here.
+        EXPECT_TRUE(ContextualCheckTransaction(tx, state, chainparams, 10, 57));
+    }
+
+    RegtestDeactivateNU5();
+}
diff --git a/depend/zcash/src/gtest/test_coins.cpp b/depend/zcash/src/gtest/test_coins.cpp
new file mode 100644
index 000000000..da5f675d4
--- /dev/null
+++ b/depend/zcash/src/gtest/test_coins.cpp
@@ -0,0 +1,809 @@
+// Copyright (c) 2014 The Bitcoin Core developers
+// Copyright (c) 2022 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "coins.h"
+#include "gtest/utils.h"
+#include "script/standard.h"
+#include "uint256.h"
+#include "utilstrencodings.h"
+#include "test/test_bitcoin.h"
+#include "consensus/validation.h"
+#include "main.h"
+#include "undo.h"
+#include "primitives/transaction.h"
+#include "pubkey.h"
+#include "transaction_builder.h"
+#include "zcash/Note.hpp"
+#include "zcash/address/mnemonic.h"
+
+#include <vector>
+#include <map>
+
+#include <gmock/gmock.h>
+#include <gtest/gtest.h>
+
+#include "zcash/IncrementalMerkleTree.hpp"
+
+namespace
+{
+class CCoinsViewTest : public CCoinsView
+{
+    uint256 hashBestBlock_;
+    uint256 hashBestSproutAnchor_;
+    uint256 hashBestSaplingAnchor_;
+    uint256 hashBestOrchardAnchor_;
+    std::map<uint256, CCoins> map_;
+    std::map<uint256, SproutMerkleTree> mapSproutAnchors_;
+    std::map<uint256, SaplingMerkleTree> mapSaplingAnchors_;
+    std::map<uint256, OrchardMerkleFrontier> mapOrchardAnchors_;
+    std::map<uint256, bool> mapSproutNullifiers_;
+    std::map<uint256, bool> mapSaplingNullifiers_;
+    std::map<uint256, bool> mapOrchardNullifiers_;
+
+public:
+    CCoinsViewTest() {
+        hashBestSproutAnchor_ = SproutMerkleTree::empty_root();
+        hashBestSaplingAnchor_ = SaplingMerkleTree::empty_root();
+        hashBestOrchardAnchor_ = OrchardMerkleFrontier::empty_root();
+    }
+
+    bool GetSproutAnchorAt(const uint256& rt, SproutMerkleTree &tree) const {
+        if (rt == SproutMerkleTree::empty_root()) {
+            SproutMerkleTree new_tree;
+            tree = new_tree;
+            return true;
+        }
+
+        std::map<uint256, SproutMerkleTree>::const_iterator it = mapSproutAnchors_.find(rt);
+        if (it == mapSproutAnchors_.end()) {
+            return false;
+        } else {
+            tree = it->second;
+            return true;
+        }
+    }
+
+    bool GetSaplingAnchorAt(const uint256& rt, SaplingMerkleTree &tree) const {
+        if (rt == SaplingMerkleTree::empty_root()) {
+            SaplingMerkleTree new_tree;
+            tree = new_tree;
+            return true;
+        }
+
+        std::map<uint256, SaplingMerkleTree>::const_iterator it = mapSaplingAnchors_.find(rt);
+        if (it == mapSaplingAnchors_.end()) {
+            return false;
+        } else {
+            tree = it->second;
+            return true;
+        }
+    }
+
+    bool GetOrchardAnchorAt(const uint256& rt, OrchardMerkleFrontier &tree) const {
+        if (rt == OrchardMerkleFrontier::empty_root()) {
+            OrchardMerkleFrontier new_tree;
+            tree = new_tree;
+            return true;
+        }
+
+        std::map<uint256, OrchardMerkleFrontier>::const_iterator it = mapOrchardAnchors_.find(rt);
+        if (it == mapOrchardAnchors_.end()) {
+            return false;
+        } else {
+            tree = it->second;
+            return true;
+        }
+    }
+
+    bool GetNullifier(const uint256 &nf, ShieldedType type) const
+    {
+        const std::map<uint256, bool>* mapToUse;
+        switch (type) {
+            case SPROUT:
+                mapToUse = &mapSproutNullifiers_;
+                break;
+            case SAPLING:
+                mapToUse = &mapSaplingNullifiers_;
+                break;
+            case ORCHARD:
+                mapToUse = &mapOrchardNullifiers_;
+                break;
+            default:
+                throw std::runtime_error("Unknown shielded type");
+        }
+        std::map<uint256, bool>::const_iterator it = mapToUse->find(nf);
+        if (it == mapToUse->end()) {
+            return false;
+        } else {
+            // The map shouldn't contain any false entries.
+            assert(it->second);
+            return true;
+        }
+    }
+
+    uint256 GetBestAnchor(ShieldedType type) const {
+        switch (type) {
+            case SPROUT:
+                return hashBestSproutAnchor_;
+                break;
+            case SAPLING:
+                return hashBestSaplingAnchor_;
+                break;
+            case ORCHARD:
+                return hashBestOrchardAnchor_;
+                break;
+            default:
+                throw std::runtime_error("Unknown shielded type");
+        }
+    }
+
+    bool GetCoins(const uint256& txid, CCoins& coins) const
+    {
+        std::map<uint256, CCoins>::const_iterator it = map_.find(txid);
+        if (it == map_.end()) {
+            return false;
+        }
+        coins = it->second;
+        if (coins.IsPruned() && insecure_rand() % 2 == 0) {
+            // Randomly return false in case of an empty entry.
+            return false;
+        }
+        return true;
+    }
+
+    bool HaveCoins(const uint256& txid) const
+    {
+        CCoins coins;
+        return GetCoins(txid, coins);
+    }
+
+    uint256 GetBestBlock() const { return hashBestBlock_; }
+
+    void BatchWriteNullifiers(CNullifiersMap& mapNullifiers, std::map<uint256, bool>& cacheNullifiers)
+    {
+        for (CNullifiersMap::iterator it = mapNullifiers.begin(); it != mapNullifiers.end(); ) {
+            if (it->second.flags & CNullifiersCacheEntry::DIRTY) {
+                // Same optimization used in CCoinsViewDB is to only write dirty entries.
+                if (it->second.entered) {
+                    cacheNullifiers[it->first] = true;
+                } else {
+                    cacheNullifiers.erase(it->first);
+                }
+            }
+            it = mapNullifiers.erase(it);
+        }
+    }
+
+    template<typename Tree, typename Map, typename MapEntry>
+    void BatchWriteAnchors(Map& mapAnchors, std::map<uint256, Tree>& cacheAnchors)
+    {
+        for (auto it = mapAnchors.begin(); it != mapAnchors.end(); ) {
+            if (it->second.flags & MapEntry::DIRTY) {
+                // Same optimization used in CCoinsViewDB is to only write dirty entries.
+                if (it->second.entered) {
+                    if (it->first != Tree::empty_root()) {
+                        auto ret = cacheAnchors.insert(std::make_pair(it->first, Tree())).first;
+                        ret->second = it->second.tree;
+                    }
+                } else {
+                    cacheAnchors.erase(it->first);
+                }
+            }
+            it = mapAnchors.erase(it);
+        }
+    }
+
+    bool BatchWrite(CCoinsMap& mapCoins,
+                    const uint256& hashBlock,
+                    const uint256& hashSproutAnchor,
+                    const uint256& hashSaplingAnchor,
+                    const uint256& hashOrchardAnchor,
+                    CAnchorsSproutMap& mapSproutAnchors,
+                    CAnchorsSaplingMap& mapSaplingAnchors,
+                    CAnchorsOrchardMap& mapOrchardAnchors,
+                    CNullifiersMap& mapSproutNullifiers,
+                    CNullifiersMap& mapSaplingNullifiers,
+                    CNullifiersMap& mapOrchardNullifiers,
+                    CHistoryCacheMap &historyCacheMap)
+    {
+        for (CCoinsMap::iterator it = mapCoins.begin(); it != mapCoins.end(); ) {
+            if (it->second.flags & CCoinsCacheEntry::DIRTY) {
+                // Same optimization used in CCoinsViewDB is to only write dirty entries.
+                map_[it->first] = it->second.coins;
+                if (it->second.coins.IsPruned() && insecure_rand() % 3 == 0) {
+                    // Randomly delete empty entries on write.
+                    map_.erase(it->first);
+                }
+            }
+            it = mapCoins.erase(it);
+        }
+
+        BatchWriteAnchors<SproutMerkleTree, CAnchorsSproutMap, CAnchorsSproutCacheEntry>(mapSproutAnchors, mapSproutAnchors_);
+        BatchWriteAnchors<SaplingMerkleTree, CAnchorsSaplingMap, CAnchorsSaplingCacheEntry>(mapSaplingAnchors, mapSaplingAnchors_);
+        BatchWriteAnchors<OrchardMerkleFrontier, CAnchorsOrchardMap, CAnchorsOrchardCacheEntry>(mapOrchardAnchors, mapOrchardAnchors_);
+
+        BatchWriteNullifiers(mapSproutNullifiers, mapSproutNullifiers_);
+        BatchWriteNullifiers(mapSaplingNullifiers, mapSaplingNullifiers_);
+        BatchWriteNullifiers(mapOrchardNullifiers, mapOrchardNullifiers_);
+
+        if (!hashBlock.IsNull())
+            hashBestBlock_ = hashBlock;
+        if (!hashSproutAnchor.IsNull())
+            hashBestSproutAnchor_ = hashSproutAnchor;
+        if (!hashSaplingAnchor.IsNull())
+            hashBestSaplingAnchor_ = hashSaplingAnchor;
+        if (!hashOrchardAnchor.IsNull())
+            hashBestOrchardAnchor_ = hashOrchardAnchor;
+        return true;
+    }
+
+    bool GetStats(CCoinsStats& stats) const { return false; }
+};
+
+class CCoinsViewCacheTest : public CCoinsViewCache
+{
+public:
+    CCoinsViewCacheTest(CCoinsView* base) : CCoinsViewCache(base) {}
+
+    void SelfTest() const
+    {
+        // Manually recompute the dynamic usage of the whole data, and compare it.
+        size_t ret = memusage::DynamicUsage(cacheCoins) +
+                     memusage::DynamicUsage(cacheSproutAnchors) +
+                     memusage::DynamicUsage(cacheSaplingAnchors) +
+                     memusage::DynamicUsage(cacheOrchardAnchors) +
+                     memusage::DynamicUsage(cacheSproutNullifiers) +
+                     memusage::DynamicUsage(cacheSaplingNullifiers) +
+                     memusage::DynamicUsage(cacheOrchardNullifiers) +
+                     memusage::DynamicUsage(historyCacheMap);
+        for (CCoinsMap::iterator it = cacheCoins.begin(); it != cacheCoins.end(); it++) {
+            ret += it->second.coins.DynamicMemoryUsage();
+        }
+        EXPECT_EQ(DynamicMemoryUsage(), ret);
+    }
+
+};
+
+class TxWithNullifiers
+{
+public:
+    CTransaction tx;
+    uint256 sproutNullifier;
+    uint256 saplingNullifier;
+    uint256 orchardNullifier;
+
+    TxWithNullifiers()
+    {
+        CMutableTransaction mutableTx;
+
+        sproutNullifier = GetRandHash();
+        JSDescription jsd;
+        jsd.nullifiers[0] = sproutNullifier;
+        mutableTx.vJoinSplit.emplace_back(jsd);
+        
+        saplingNullifier = GetRandHash();
+        SpendDescription sd;
+        sd.nullifier = saplingNullifier;
+        mutableTx.vShieldedSpend.push_back(sd);
+
+        // The Orchard bundle builder always pads to two Actions, so we can just
+        // use an empty builder to create a dummy Orchard bundle.
+        uint256 orchardAnchor;
+        uint256 dataToBeSigned;
+        auto builder = orchard::Builder(true, true, orchardAnchor);
+        mutableTx.orchardBundle = builder.Build().value().ProveAndSign({}, dataToBeSigned).value();
+        orchardNullifier = mutableTx.orchardBundle.GetNullifiers()[0];
+
+        tx = CTransaction(mutableTx);
+    }
+};
+
+}
+
+uint256 appendRandomSproutCommitment(SproutMerkleTree &tree)
+{
+    libzcash::SproutSpendingKey k = libzcash::SproutSpendingKey::random();
+    libzcash::SproutPaymentAddress addr = k.address();
+
+    libzcash::SproutNote note(addr.a_pk, 0, uint256(), uint256());
+
+    auto cm = note.cm();
+    tree.append(cm);
+    return cm;
+}
+
+template<typename Tree> void AppendRandomLeaf(Tree &tree);
+template<> void AppendRandomLeaf(SproutMerkleTree &tree) { tree.append(GetRandHash()); }
+template<> void AppendRandomLeaf(SaplingMerkleTree &tree) { tree.append(GetRandHash()); }
+template<> void AppendRandomLeaf(OrchardMerkleFrontier &tree) {
+    // OrchardMerkleFrontier only has APIs to append entire bundles, but
+    // fortunately the tests only require that the tree root change.
+    // TODO: Remove the need to create proofs by having a testing-only way to
+    // append a random leaf to OrchardMerkleFrontier.
+    uint256 orchardAnchor;
+    uint256 dataToBeSigned;
+    auto builder = orchard::Builder(true, true, orchardAnchor);
+    auto bundle = builder.Build().value().ProveAndSign({}, dataToBeSigned).value();
+    tree.AppendBundle(bundle);
+}
+
+template<typename Tree> bool GetAnchorAt(const CCoinsViewCacheTest &cache, const uint256 &rt, Tree &tree);
+template<> bool GetAnchorAt(const CCoinsViewCacheTest &cache, const uint256 &rt, SproutMerkleTree &tree) { return cache.GetSproutAnchorAt(rt, tree); }
+template<> bool GetAnchorAt(const CCoinsViewCacheTest &cache, const uint256 &rt, SaplingMerkleTree &tree) { return cache.GetSaplingAnchorAt(rt, tree); }
+template<> bool GetAnchorAt(const CCoinsViewCacheTest &cache, const uint256 &rt, OrchardMerkleFrontier &tree) { return cache.GetOrchardAnchorAt(rt, tree); }
+
+
+
+void checkNullifierCache(const CCoinsViewCacheTest &cache, const TxWithNullifiers &txWithNullifiers, bool shouldBeInCache) {
+    // Make sure the nullifiers have not gotten mixed up
+    EXPECT_TRUE(!cache.GetNullifier(txWithNullifiers.sproutNullifier, SAPLING));
+    EXPECT_TRUE(!cache.GetNullifier(txWithNullifiers.sproutNullifier, ORCHARD));
+    EXPECT_TRUE(!cache.GetNullifier(txWithNullifiers.saplingNullifier, SPROUT));
+    EXPECT_TRUE(!cache.GetNullifier(txWithNullifiers.saplingNullifier, ORCHARD));
+    EXPECT_TRUE(!cache.GetNullifier(txWithNullifiers.orchardNullifier, SPROUT));
+    EXPECT_TRUE(!cache.GetNullifier(txWithNullifiers.orchardNullifier, SAPLING));
+    // Check if the nullifiers either are or are not in the cache
+    bool containsSproutNullifier = cache.GetNullifier(txWithNullifiers.sproutNullifier, SPROUT);
+    bool containsSaplingNullifier = cache.GetNullifier(txWithNullifiers.saplingNullifier, SAPLING);
+    bool containsOrchardNullifier = cache.GetNullifier(txWithNullifiers.orchardNullifier, ORCHARD);
+    EXPECT_TRUE(containsSproutNullifier == shouldBeInCache);
+    EXPECT_TRUE(containsSaplingNullifier == shouldBeInCache);
+    EXPECT_TRUE(containsOrchardNullifier == shouldBeInCache);
+}
+
+
+TEST(CoinsTests, NullifierRegression)
+{
+    LoadProofParameters();
+    // Correct behavior:
+    {
+    SCOPED_TRACE("add-remove without flush");
+        CCoinsViewTest base;
+        CCoinsViewCacheTest cache1(&base);
+
+        TxWithNullifiers txWithNullifiers;
+
+        // Insert a nullifier into the base.
+        cache1.SetNullifiers(txWithNullifiers.tx, true);
+        checkNullifierCache(cache1, txWithNullifiers, true);
+        cache1.Flush(); // Flush to base.
+
+        // Remove the nullifier from cache
+        cache1.SetNullifiers(txWithNullifiers.tx, false);
+
+        // The nullifier now should be `false`.
+        checkNullifierCache(cache1, txWithNullifiers, false);
+    }
+
+    // Also correct behavior:
+    {
+    SCOPED_TRACE("add-remove with flush");
+        CCoinsViewTest base;
+        CCoinsViewCacheTest cache1(&base);
+
+        TxWithNullifiers txWithNullifiers;
+
+        // Insert a nullifier into the base.
+        cache1.SetNullifiers(txWithNullifiers.tx, true);
+        checkNullifierCache(cache1, txWithNullifiers, true);
+        cache1.Flush(); // Flush to base.
+
+        // Remove the nullifier from cache
+        cache1.SetNullifiers(txWithNullifiers.tx, false);
+        cache1.Flush(); // Flush to base.
+
+        // The nullifier now should be `false`.
+        checkNullifierCache(cache1, txWithNullifiers, false);
+    }
+
+    // Works because we bring it from the parent cache:
+    {
+    SCOPED_TRACE("remove from parent");
+        CCoinsViewTest base;
+        CCoinsViewCacheTest cache1(&base);
+
+        // Insert a nullifier into the base.
+        TxWithNullifiers txWithNullifiers;
+        cache1.SetNullifiers(txWithNullifiers.tx, true);
+        checkNullifierCache(cache1, txWithNullifiers, true);
+        cache1.Flush(); // Empties cache.
+
+        // Create cache on top.
+        {
+            // Remove the nullifier.
+            CCoinsViewCacheTest cache2(&cache1);
+            checkNullifierCache(cache2, txWithNullifiers, true);
+            cache1.SetNullifiers(txWithNullifiers.tx, false);
+            cache2.Flush(); // Empties cache, flushes to cache1.
+        }
+
+        // The nullifier now should be `false`.
+        checkNullifierCache(cache1, txWithNullifiers, false);
+    }
+
+    // Was broken:
+    {
+    SCOPED_TRACE("remove from child");
+        CCoinsViewTest base;
+        CCoinsViewCacheTest cache1(&base);
+
+        // Insert a nullifier into the base.
+        TxWithNullifiers txWithNullifiers;
+        cache1.SetNullifiers(txWithNullifiers.tx, true);
+        cache1.Flush(); // Empties cache.
+
+        // Create cache on top.
+        {
+            // Remove the nullifier.
+            CCoinsViewCacheTest cache2(&cache1);
+            cache2.SetNullifiers(txWithNullifiers.tx, false);
+            cache2.Flush(); // Empties cache, flushes to cache1.
+        }
+
+        // The nullifier now should be `false`.
+        checkNullifierCache(cache1, txWithNullifiers, false);
+    }
+}
+
+template<typename Tree> void anchorPopRegressionTestImpl(ShieldedType type)
+{
+    // Correct behavior:
+    {
+        CCoinsViewTest base;
+        CCoinsViewCacheTest cache1(&base);
+
+        // Create dummy anchor/commitment
+        Tree tree;
+        AppendRandomLeaf(tree);
+
+        // Add the anchor
+        cache1.PushAnchor(tree);
+        cache1.Flush();
+
+        // Remove the anchor
+        cache1.PopAnchor(Tree::empty_root(), type);
+        cache1.Flush();
+
+        // Add the anchor back
+        cache1.PushAnchor(tree);
+        cache1.Flush();
+
+        // The base contains the anchor, of course!
+        {
+            Tree checkTree;
+            EXPECT_TRUE(GetAnchorAt(cache1, tree.root(), checkTree));
+            EXPECT_TRUE(checkTree.root() == tree.root());
+        }
+    }
+
+    // Previously incorrect behavior
+    {
+        CCoinsViewTest base;
+        CCoinsViewCacheTest cache1(&base);
+
+        // Create dummy anchor/commitment
+        Tree tree;
+        AppendRandomLeaf(tree);
+
+        // Add the anchor and flush to disk
+        cache1.PushAnchor(tree);
+        cache1.Flush();
+
+        // Remove the anchor, but don't flush yet!
+        cache1.PopAnchor(Tree::empty_root(), type);
+
+        {
+            CCoinsViewCacheTest cache2(&cache1); // Build cache on top
+            cache2.PushAnchor(tree); // Put the same anchor back!
+            cache2.Flush(); // Flush to cache1
+        }
+
+        // cache2's flush kinda worked, i.e. cache1 thinks the
+        // tree is there, but it didn't bring down the correct
+        // treestate...
+        {
+            Tree checktree;
+            EXPECT_TRUE(GetAnchorAt(cache1, tree.root(), checktree));
+            EXPECT_TRUE(checktree.root() == tree.root()); // Oh, shucks.
+        }
+
+        // Flushing cache won't help either, just makes the inconsistency
+        // permanent.
+        cache1.Flush();
+        {
+            Tree checktree;
+            EXPECT_TRUE(GetAnchorAt(cache1, tree.root(), checktree));
+            EXPECT_TRUE(checktree.root() == tree.root()); // Oh, shucks.
+        }
+    }
+}
+
+
+TEST(CoinsTests, AnchorPopRegression)
+{
+    LoadProofParameters();
+
+    {
+    SCOPED_TRACE("Sprout");
+        anchorPopRegressionTestImpl<SproutMerkleTree>(SPROUT);
+    }
+
+    {
+    SCOPED_TRACE("Sapling");
+        anchorPopRegressionTestImpl<SaplingMerkleTree>(SAPLING);
+    }
+
+    {
+    SCOPED_TRACE("Orchard");
+        anchorPopRegressionTestImpl<OrchardMerkleFrontier>(ORCHARD);
+    }
+}
+
+
+template<typename Tree> void anchorRegressionTestImpl(ShieldedType type)
+{
+    // Correct behavior:
+    {
+        CCoinsViewTest base;
+        CCoinsViewCacheTest cache1(&base);
+
+        // Insert anchor into base.
+        Tree tree;
+        AppendRandomLeaf(tree);
+
+        cache1.PushAnchor(tree);
+        cache1.Flush();
+
+        cache1.PopAnchor(Tree::empty_root(), type);
+        EXPECT_TRUE(cache1.GetBestAnchor(type) == Tree::empty_root());
+        EXPECT_TRUE(!GetAnchorAt(cache1, tree.root(), tree));
+    }
+
+    // Also correct behavior:
+    {
+        CCoinsViewTest base;
+        CCoinsViewCacheTest cache1(&base);
+
+        // Insert anchor into base.
+        Tree tree;
+        AppendRandomLeaf(tree);
+        cache1.PushAnchor(tree);
+        cache1.Flush();
+
+        cache1.PopAnchor(Tree::empty_root(), type);
+        cache1.Flush();
+        EXPECT_TRUE(cache1.GetBestAnchor(type) == Tree::empty_root());
+        EXPECT_TRUE(!GetAnchorAt(cache1, tree.root(), tree));
+    }
+
+    // Works because we bring the anchor in from parent cache.
+    {
+        CCoinsViewTest base;
+        CCoinsViewCacheTest cache1(&base);
+
+        // Insert anchor into base.
+        Tree tree;
+        AppendRandomLeaf(tree);
+        cache1.PushAnchor(tree);
+        cache1.Flush();
+
+        {
+            // Pop anchor.
+            CCoinsViewCacheTest cache2(&cache1);
+            EXPECT_TRUE(GetAnchorAt(cache2, tree.root(), tree));
+            cache2.PopAnchor(Tree::empty_root(), type);
+            cache2.Flush();
+        }
+
+        EXPECT_TRUE(cache1.GetBestAnchor(type) == Tree::empty_root());
+        EXPECT_TRUE(!GetAnchorAt(cache1, tree.root(), tree));
+    }
+
+    // Was broken:
+    {
+        CCoinsViewTest base;
+        CCoinsViewCacheTest cache1(&base);
+
+        // Insert anchor into base.
+        Tree tree;
+        AppendRandomLeaf(tree);
+        cache1.PushAnchor(tree);
+        cache1.Flush();
+
+        {
+            // Pop anchor.
+            CCoinsViewCacheTest cache2(&cache1);
+            cache2.PopAnchor(Tree::empty_root(), type);
+            cache2.Flush();
+        }
+
+        EXPECT_TRUE(cache1.GetBestAnchor(type) == Tree::empty_root());
+        EXPECT_TRUE(!GetAnchorAt(cache1, tree.root(), tree));
+    }
+}
+
+
+TEST(CoinsTests, AnchorRegression)
+{
+    LoadProofParameters();
+
+    {
+    SCOPED_TRACE("Sprout");
+        anchorRegressionTestImpl<SproutMerkleTree>(SPROUT);
+    }
+
+    {
+    SCOPED_TRACE("Sapling");
+        anchorRegressionTestImpl<SaplingMerkleTree>(SAPLING);
+    }
+
+    {
+    SCOPED_TRACE("Orchard");
+        anchorRegressionTestImpl<OrchardMerkleFrontier>(ORCHARD);
+    }
+}
+
+
+TEST(CoinsTests, NullifiersTest)
+{
+    CCoinsViewTest base;
+    CCoinsViewCacheTest cache(&base);
+
+    TxWithNullifiers txWithNullifiers;
+    checkNullifierCache(cache, txWithNullifiers, false);
+    cache.SetNullifiers(txWithNullifiers.tx, true);
+    checkNullifierCache(cache, txWithNullifiers, true);
+    cache.Flush();
+
+    CCoinsViewCacheTest cache2(&base);
+
+    checkNullifierCache(cache2, txWithNullifiers, true);
+    cache2.SetNullifiers(txWithNullifiers.tx, false);
+    checkNullifierCache(cache2, txWithNullifiers, false);
+    cache2.Flush();
+
+    CCoinsViewCacheTest cache3(&base);
+
+    checkNullifierCache(cache3, txWithNullifiers, false);
+}
+
+
+template<typename Tree> void anchorsFlushImpl(ShieldedType type)
+{
+    CCoinsViewTest base;
+    uint256 newrt;
+    {
+        CCoinsViewCacheTest cache(&base);
+        Tree tree;
+        EXPECT_TRUE(GetAnchorAt(cache, cache.GetBestAnchor(type), tree));
+        AppendRandomLeaf(tree);
+
+        newrt = tree.root();
+
+        cache.PushAnchor(tree);
+        cache.Flush();
+    }
+    
+    {
+        CCoinsViewCacheTest cache(&base);
+        Tree tree;
+        EXPECT_TRUE(GetAnchorAt(cache, cache.GetBestAnchor(type), tree));
+
+        // Get the cached entry.
+        EXPECT_TRUE(GetAnchorAt(cache, cache.GetBestAnchor(type), tree));
+
+        uint256 check_rt = tree.root();
+
+        EXPECT_TRUE(check_rt == newrt);
+    }
+}
+
+
+TEST(CoinsTests,AnchorsFlushTest)
+{
+    LoadProofParameters();
+    {
+    SCOPED_TRACE("Sprout");
+        anchorsFlushImpl<SproutMerkleTree>(SPROUT);
+    }
+
+    {
+    SCOPED_TRACE("Sapling");
+        anchorsFlushImpl<SaplingMerkleTree>(SAPLING);
+    }
+
+    {
+    SCOPED_TRACE("Orchard");
+        anchorsFlushImpl<OrchardMerkleFrontier>(ORCHARD);
+    }
+}
+
+
+template<typename Tree> void anchorsTestImpl(ShieldedType type)
+{
+    // TODO: These tests should be more methodical.
+
+    CCoinsViewTest base;
+    CCoinsViewCacheTest cache(&base);
+
+    EXPECT_TRUE(cache.GetBestAnchor(type) == Tree::empty_root());
+
+    {
+        Tree tree;
+
+        EXPECT_TRUE(GetAnchorAt(cache, cache.GetBestAnchor(type), tree));
+        EXPECT_TRUE(cache.GetBestAnchor(type) == tree.root());
+        AppendRandomLeaf(tree);
+        AppendRandomLeaf(tree);
+        AppendRandomLeaf(tree);
+        AppendRandomLeaf(tree);
+        AppendRandomLeaf(tree);
+        AppendRandomLeaf(tree);
+        AppendRandomLeaf(tree);
+
+        Tree save_tree_for_later;
+        save_tree_for_later = tree;
+
+        uint256 newrt = tree.root();
+        uint256 newrt2;
+
+        cache.PushAnchor(tree);
+        EXPECT_TRUE(cache.GetBestAnchor(type) == newrt);
+
+        {
+            Tree confirm_same;
+            EXPECT_TRUE(GetAnchorAt(cache, cache.GetBestAnchor(type), confirm_same));
+
+            EXPECT_TRUE(confirm_same.root() == newrt);
+        }
+
+        AppendRandomLeaf(tree);
+        AppendRandomLeaf(tree);
+
+        newrt2 = tree.root();
+
+        cache.PushAnchor(tree);
+        EXPECT_TRUE(cache.GetBestAnchor(type) == newrt2);
+
+        Tree test_tree;
+        EXPECT_TRUE(GetAnchorAt(cache, cache.GetBestAnchor(type), test_tree));
+
+        EXPECT_TRUE(tree.root() == test_tree.root());
+
+        {
+            Tree test_tree2;
+            GetAnchorAt(cache, newrt, test_tree2);
+            
+            EXPECT_TRUE(test_tree2.root() == newrt);
+        }
+
+        {
+            cache.PopAnchor(newrt, type);
+            Tree obtain_tree;
+            assert(!GetAnchorAt(cache, newrt2, obtain_tree)); // should have been popped off
+            assert(GetAnchorAt(cache, newrt, obtain_tree));
+
+            assert(obtain_tree.root() == newrt);
+        }
+    }
+}
+
+TEST(CoinsTests, AnchorsTest)
+{
+    {
+    SCOPED_TRACE("Sprout");
+    anchorsTestImpl<SproutMerkleTree>(SPROUT);
+    }
+
+    {
+    SCOPED_TRACE("Sapling");
+    anchorsTestImpl<SaplingMerkleTree>(SAPLING);
+    }
+
+    {
+    SCOPED_TRACE("Orchard");
+    anchorsTestImpl<OrchardMerkleFrontier>(ORCHARD);
+    }
+}
diff --git a/depend/zcash/src/gtest/test_consensus.cpp b/depend/zcash/src/gtest/test_consensus.cpp
new file mode 100644
index 000000000..4ea3cffa6
--- /dev/null
+++ b/depend/zcash/src/gtest/test_consensus.cpp
@@ -0,0 +1,1298 @@
+#include <gtest/gtest.h>
+#include <sodium.h>
+
+#include <rust/ed25519.h>
+
+#include "uint256.h"
+#include "utilstrencodings.h"
+
+void TestLibsodiumEd25519SignatureVerification(
+    const std::string &scope,
+    const std::string &msg,
+    std::vector<unsigned char> pubkey,
+    std::vector<unsigned char> sig)
+{
+    SCOPED_TRACE(scope);
+
+    Ed25519VerificationKey vk;
+    std::copy(pubkey.begin(), pubkey.end(), vk.bytes);
+
+    Ed25519Signature signature;
+    std::copy(sig.begin(), sig.end(), signature.bytes);
+
+    EXPECT_EQ(
+        crypto_sign_verify_detached(
+            sig.data(),
+            (const unsigned char*)msg.data(), msg.size(),
+            pubkey.data()),
+        0);
+
+    EXPECT_EQ(
+        ed25519_verify(&vk, &signature, (const unsigned char*)msg.data(), msg.size()),
+        true);
+}
+
+void ZIP215Check(
+    const char * pubkey,
+    const char * sig,
+    bool valid_legacy,
+    bool valid_zip215
+)
+{
+    std::vector<unsigned char> pubkey_hex = ParseHex(pubkey);
+    std::vector<unsigned char> sig_hex = ParseHex(sig);
+
+    Ed25519VerificationKey vk;
+    std::copy(pubkey_hex.begin(), pubkey_hex.end(), vk.bytes);
+
+    Ed25519Signature signature;
+    std::copy(sig_hex.begin(), sig_hex.end(), signature.bytes);
+
+    std::string msg("Zcash");
+
+    int expected_legacy = 0;
+
+    if (!valid_legacy) {
+        expected_legacy = -1;
+    }
+
+    EXPECT_EQ(
+        crypto_sign_verify_detached(
+            sig_hex.data(),
+            (const unsigned char*)msg.data(), msg.size(),
+            pubkey_hex.data()),
+        expected_legacy);
+
+    EXPECT_EQ(
+        ed25519_verify(&vk, &signature, (const unsigned char*)msg.data(), msg.size()),
+        valid_zip215);
+}
+
+TEST(ConsensusTests, LibsodiumPubkeyValidation) {
+    // libsodium <= 1.0.15 accepts valid signatures for a non-zero pubkey with
+    // small order; this is currently part of our consensus rules.
+    // libsodium >= 1.0.16 rejects all pubkeys with small order.
+    //
+    // These test vectors were generated by finding pairs of points (A, P) both
+    // in the eight-torsion subgroup such that R = B + P and R = [1] B - [k] A
+    // (where SHA512(bytes(R) || bytes(A) || message) represents k in
+    // little-endian order, as in Ed25519).
+    TestLibsodiumEd25519SignatureVerification(
+        "Test vector 1",
+        "zcash ed25519 libsodium compatibility",
+        ParseHex("0100000000000000000000000000000000000000000000000000000000000000"),
+        ParseHex("58666666666666666666666666666666666666666666666666666666666666660100000000000000000000000000000000000000000000000000000000000000"));
+    TestLibsodiumEd25519SignatureVerification(
+        "Test vector 2",
+        "zcash ed25519 libsodium compatibility",
+        ParseHex("0000000000000000000000000000000000000000000000000000000000000080"),
+        ParseHex("58666666666666666666666666666666666666666666666666666666666666660100000000000000000000000000000000000000000000000000000000000000"));
+    TestLibsodiumEd25519SignatureVerification(
+        "Test vector 3",
+        "zcash ed25519 libsodium compatibility",
+        ParseHex("26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85"),
+        ParseHex("da99e28ba529cdde35a25fba9059e78ecaee239f99755b9b1aa4f65df00803e20100000000000000000000000000000000000000000000000000000000000000"));
+    TestLibsodiumEd25519SignatureVerification(
+        "Test vector 4",
+        "zcash ed25519 libsodium compatibility",
+        ParseHex("c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a"),
+        ParseHex("95999999999999999999999999999999999999999999999999999999999999990100000000000000000000000000000000000000000000000000000000000000"));
+    TestLibsodiumEd25519SignatureVerification(
+        "Test vector 5",
+        "zcash ed25519 libsodium compatibility",
+        ParseHex("26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85"),
+        ParseHex("13661d745ad63221ca5da0456fa618713511dc60668aa464e55b09a20ff7fc1d0100000000000000000000000000000000000000000000000000000000000000"));
+
+    // libsodium <= 1.0.15 contains a blocklist of small-order points that R is
+    // checked against. However, it does not contain all canonical small-order
+    // points; in particular, it is missing the negative of one of the points.
+    //
+    // This test case is the only pair of points (A, R) both in the eight-torsion
+    // subgroup, that satisfies R = [0] B - [k] A and also evades the blocklist.
+    TestLibsodiumEd25519SignatureVerification(
+        "Small order R that is not rejected by libsodium <= 1.0.15",
+        "zcash ed25519 libsodium compatibility",
+        ParseHex("c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a"),
+        ParseHex("26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc850000000000000000000000000000000000000000000000000000000000000000"));
+}
+
+TEST(ConsensusTests, ZIP215TestVectors) {
+    // These test vectors are courtesy of Henry de Valence from the Zcash Foundation.
+
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000000",
+        "01000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000000",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000000",
+        "00000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000000",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc050000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000000",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000000",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc850000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000000",
+        "00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000000",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000000",
+        "01000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000000",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000000",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000000",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000000",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000000",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a",
+        "01000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a",
+        "00000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        true,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc050000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc850000000000000000000000000000000000000000000000000000000000000000",
+        true,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a",
+        "00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a",
+        "01000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000080",
+        "01000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000080",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000080",
+        "00000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000080",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc050000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000080",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000080",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc850000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000080",
+        "00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000080",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000080",
+        "01000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000080",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000080",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000080",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000080",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000080",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05",
+        "01000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05",
+        "00000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc050000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc850000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05",
+        "00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05",
+        "01000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc05",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "01000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "00000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc050000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc850000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "01000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85",
+        "01000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85",
+        "00000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc050000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc850000000000000000000000000000000000000000000000000000000000000000",
+        true,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85",
+        "00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85",
+        "01000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc85",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000000",
+        "01000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000000",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000000",
+        "00000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000000",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc050000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000000",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000000",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc850000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000000",
+        "00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000000",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000000",
+        "01000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000000",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000000",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000000",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000000",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0000000000000000000000000000000000000000000000000000000000000000",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa",
+        "01000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa",
+        "00000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc050000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc850000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa",
+        "00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa",
+        "01000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000080",
+        "01000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000080",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000080",
+        "00000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000080",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc050000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000080",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000080",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc850000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000080",
+        "00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000080",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000080",
+        "01000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000080",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000080",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000080",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000080",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "0100000000000000000000000000000000000000000000000000000000000080",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "01000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "00000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc050000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc850000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "01000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "01000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "00000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc050000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc850000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "01000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "01000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "00000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc050000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc850000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "01000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "01000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "00000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc050000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc850000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "01000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "01000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac037a0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "00000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc050000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "26e8958fc2b227b045c3f489f2ef98f0d5dfac05d3c63339b13802886d53fc850000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "c7176a703d4dd84fba3c0b760d10670f2a2053fa2c39ccc64ec7fd7792ac03fa0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "01000000000000000000000000000000000000000000000000000000000000800000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "ecffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "edffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff7f0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+    ZIP215Check(
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+        "eeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff0000000000000000000000000000000000000000000000000000000000000000",
+        false,
+        true
+    );
+}
\ No newline at end of file
diff --git a/depend/zcash/src/gtest/test_deprecation.cpp b/depend/zcash/src/gtest/test_deprecation.cpp
new file mode 100644
index 000000000..27048b6a4
--- /dev/null
+++ b/depend/zcash/src/gtest/test_deprecation.cpp
@@ -0,0 +1,150 @@
+#include <gmock/gmock.h>
+#include <gtest/gtest.h>
+
+#include "chainparams.h"
+#include "clientversion.h"
+#include "deprecation.h"
+#include "fs.h"
+#include "init.h"
+#include "ui_interface.h"
+#include "util.h"
+#include "utilstrencodings.h"
+
+#include <fstream>
+
+using namespace boost::placeholders;
+using ::testing::StrictMock;
+
+static const std::string CLIENT_VERSION_STR = FormatVersion(CLIENT_VERSION);
+extern std::atomic<bool> fRequestShutdown;
+
+class MockUIInterface {
+public:
+    MOCK_METHOD3(ThreadSafeMessageBox, bool(const std::string& message,
+                                      const std::string& caption,
+                                      unsigned int style));
+};
+
+static bool ThreadSafeMessageBox(MockUIInterface *mock,
+                                 const std::string& message,
+                                 const std::string& caption,
+                                 unsigned int style)
+{
+    return mock->ThreadSafeMessageBox(message, caption, style);
+}
+
+class DeprecationTest : public ::testing::Test {
+protected:
+    void SetUp() override {
+        uiInterface.ThreadSafeMessageBox.disconnect_all_slots();
+        uiInterface.ThreadSafeMessageBox.connect(boost::bind(ThreadSafeMessageBox, &mock_, _1, _2, _3));
+        SelectParams(CBaseChainParams::MAIN);
+        
+    }
+
+    void TearDown() override {
+        fRequestShutdown = false;
+        mapArgs.clear();
+    }
+
+    StrictMock<MockUIInterface> mock_;
+
+    static std::vector<std::string> read_lines(fs::path filepath) {
+        std::vector<std::string> result;
+
+        std::ifstream f(filepath.string().c_str());
+        std::string line;
+        while (std::getline(f,line)) {
+            result.push_back(line);
+        }
+
+        return result;
+    }
+};
+
+TEST_F(DeprecationTest, NonDeprecatedNodeKeepsRunning) {
+    EXPECT_FALSE(ShutdownRequested());
+    EnforceNodeDeprecation(DEPRECATION_HEIGHT - DEPRECATION_WARN_LIMIT - 1);
+    EXPECT_FALSE(ShutdownRequested());
+}
+
+TEST_F(DeprecationTest, NodeNearDeprecationIsWarned) {
+    EXPECT_FALSE(ShutdownRequested());
+    EXPECT_CALL(mock_, ThreadSafeMessageBox(::testing::_, "", CClientUIInterface::MSG_WARNING));
+    EnforceNodeDeprecation(DEPRECATION_HEIGHT - DEPRECATION_WARN_LIMIT);
+    EXPECT_FALSE(ShutdownRequested());
+}
+
+TEST_F(DeprecationTest, NodeNearDeprecationWarningIsNotDuplicated) {
+    EXPECT_FALSE(ShutdownRequested());
+    EnforceNodeDeprecation(DEPRECATION_HEIGHT - DEPRECATION_WARN_LIMIT + 1);
+    EXPECT_FALSE(ShutdownRequested());
+}
+
+TEST_F(DeprecationTest, NodeNearDeprecationWarningIsRepeatedOnStartup) {
+    EXPECT_FALSE(ShutdownRequested());
+    EXPECT_CALL(mock_, ThreadSafeMessageBox(::testing::_, "", CClientUIInterface::MSG_WARNING));
+    EnforceNodeDeprecation(DEPRECATION_HEIGHT - DEPRECATION_WARN_LIMIT + 1, true);
+    EXPECT_FALSE(ShutdownRequested());
+}
+
+TEST_F(DeprecationTest, DeprecatedNodeShutsDown) {
+    EXPECT_FALSE(ShutdownRequested());
+    EXPECT_CALL(mock_, ThreadSafeMessageBox(::testing::_, "", CClientUIInterface::MSG_ERROR));
+    EnforceNodeDeprecation(DEPRECATION_HEIGHT);
+    EXPECT_TRUE(ShutdownRequested());
+}
+
+TEST_F(DeprecationTest, DeprecatedNodeErrorIsNotDuplicated) {
+    EXPECT_FALSE(ShutdownRequested());
+    EnforceNodeDeprecation(DEPRECATION_HEIGHT + 1);
+    EXPECT_TRUE(ShutdownRequested());
+}
+
+TEST_F(DeprecationTest, DeprecatedNodeErrorIsRepeatedOnStartup) {
+    EXPECT_FALSE(ShutdownRequested());
+    EXPECT_CALL(mock_, ThreadSafeMessageBox(::testing::_, "", CClientUIInterface::MSG_ERROR));
+    EnforceNodeDeprecation(DEPRECATION_HEIGHT + 1, true);
+    EXPECT_TRUE(ShutdownRequested());
+}
+
+TEST_F(DeprecationTest, DeprecatedNodeIgnoredOnRegtest) {
+    SelectParams(CBaseChainParams::REGTEST);
+    EXPECT_FALSE(ShutdownRequested());
+    EnforceNodeDeprecation(DEPRECATION_HEIGHT+1);
+    EXPECT_FALSE(ShutdownRequested());
+}
+
+TEST_F(DeprecationTest, DeprecatedNodeIgnoredOnTestnet) {
+    SelectParams(CBaseChainParams::TESTNET);
+    EXPECT_FALSE(ShutdownRequested());
+    EnforceNodeDeprecation(DEPRECATION_HEIGHT+1);
+    EXPECT_FALSE(ShutdownRequested());
+}
+
+TEST_F(DeprecationTest, AlertNotify) {
+    fs::path temp = fs::temp_directory_path() /
+        fs::unique_path("alertnotify-%%%%.txt");
+
+    mapArgs["-alertnotify"] = std::string("echo %s >> ") + temp.string();
+
+    EXPECT_CALL(mock_, ThreadSafeMessageBox(::testing::_, "", CClientUIInterface::MSG_WARNING));
+    EnforceNodeDeprecation(DEPRECATION_HEIGHT - DEPRECATION_WARN_LIMIT, false, false);
+
+    std::vector<std::string> r = read_lines(temp);
+    EXPECT_EQ(r.size(), 1u);
+
+    // -alertnotify restricts the message to safe characters.
+    auto expectedMsg = strprintf(
+        "This version will be deprecated at block height %d, and will automatically shut down. You should upgrade to the latest version of Zcash.",
+        DEPRECATION_HEIGHT);
+
+    // Windows built-in echo semantics are different than posixy shells. Quotes and
+    // whitespace are printed literally.
+#ifndef WIN32
+    EXPECT_EQ(r[0], expectedMsg);
+#else
+    EXPECT_EQ(r[0], strprintf("'%s' ", expectedMsg));
+#endif
+    fs::remove(temp);
+}
diff --git a/depend/zcash/src/gtest/test_dynamicusage.cpp b/depend/zcash/src/gtest/test_dynamicusage.cpp
new file mode 100644
index 000000000..dddeb03e8
--- /dev/null
+++ b/depend/zcash/src/gtest/test_dynamicusage.cpp
@@ -0,0 +1,118 @@
+// Copyright (c) 2019 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php 
+
+#include <gtest/gtest.h>
+#include <iostream>
+
+#include "coins.h"
+#include "init.h"
+#include "key.h"
+#include "transaction_builder.h"
+#include "gtest/utils.h"
+#include "utiltest.h"
+
+#include <optional>
+
+TEST(RecursiveDynamicUsageTests, TestTransactionTransparent)
+{
+    auto consensusParams = RegtestActivateSapling();
+
+    CBasicKeyStore keystore;
+    CKey tsk = AddTestCKeyToKeyStore(keystore);
+    auto scriptPubKey = GetScriptForDestination(tsk.GetPubKey().GetID());
+    CTxDestination taddr = tsk.GetPubKey().GetID();
+    
+    auto builder = TransactionBuilder(consensusParams, 1, std::nullopt, &keystore);
+    builder.AddTransparentInput(COutPoint(), scriptPubKey, 50000);
+    builder.AddTransparentOutput(taddr, 40000);
+
+    auto tx = builder.Build().GetTxOrThrow();
+    // 1 vin + 1 vout
+    // (96 + 128) + 64
+    EXPECT_EQ(288, RecursiveDynamicUsage(tx));
+
+    RegtestDeactivateSapling();
+}
+
+TEST(RecursiveDynamicUsageTests, TestTransactionJoinSplit)
+{
+    auto consensusParams = RegtestActivateSapling();
+
+    auto sproutSk = libzcash::SproutSpendingKey::random();
+
+    auto wtx = GetValidSproutReceive(sproutSk, 25000, true);
+    // 2 vin + 1 vJoinSplit + 1 vShieldedOutput
+    // 160 + 1856 + 976
+    EXPECT_EQ(2992, RecursiveDynamicUsage(wtx));
+
+    RegtestDeactivateSapling();
+}
+
+TEST(RecursiveDynamicUsageTests, TestTransactionSaplingToSapling)
+{
+    LoadProofParameters();
+
+    auto consensusParams = RegtestActivateSapling();
+    
+    auto sk = libzcash::SaplingSpendingKey::random();
+    auto testNote = GetTestSaplingNote(sk.default_address(), 50000);
+
+    auto builder = TransactionBuilder(consensusParams, 1, std::nullopt);
+    builder.AddSaplingSpend(sk.expanded_spending_key(), testNote.note, testNote.tree.root(), testNote.tree.witness());
+    builder.AddSaplingOutput(sk.full_viewing_key().ovk, sk.default_address(), 5000, {});
+    
+    auto tx = builder.Build().GetTxOrThrow();
+    // 1 vShieldedSpend + 2 vShieldedOutput
+    // 400 + 1920
+    EXPECT_EQ(2320, RecursiveDynamicUsage(tx));
+
+    RegtestDeactivateSapling();
+}
+
+TEST(RecursiveDynamicUsageTests, TestTransactionTransparentToSapling)
+{
+    LoadProofParameters();
+
+    auto consensusParams = RegtestActivateSapling();
+    
+    CBasicKeyStore keystore;
+    CKey tsk = AddTestCKeyToKeyStore(keystore);
+    auto scriptPubKey = GetScriptForDestination(tsk.GetPubKey().GetID());
+    auto sk = libzcash::SaplingSpendingKey::random();
+
+    auto builder = TransactionBuilder(consensusParams, 1, std::nullopt, &keystore);
+    builder.AddTransparentInput(COutPoint(), scriptPubKey, 50000);
+    builder.AddSaplingOutput(sk.full_viewing_key().ovk, sk.default_address(), 40000, {});
+    
+    auto tx = builder.Build().GetTxOrThrow();
+    // 1 vin + 1 vShieldedOutput
+    // (96 + 128) + 976
+    EXPECT_EQ(1200, RecursiveDynamicUsage(tx));
+
+    RegtestDeactivateSapling();
+}
+
+TEST(RecursiveDynamicUsageTests, TestTransactionSaplingToTransparent)
+{
+    LoadProofParameters();
+
+    auto consensusParams = RegtestActivateSapling();
+    
+    CBasicKeyStore keystore;
+    CKey tsk = AddTestCKeyToKeyStore(keystore);
+    CTxDestination taddr = tsk.GetPubKey().GetID();
+    auto sk = libzcash::SaplingSpendingKey::random();
+    auto testNote = GetTestSaplingNote(sk.default_address(), 50000);
+
+    auto builder = TransactionBuilder(consensusParams, 1, std::nullopt, &keystore);
+    builder.AddSaplingSpend(sk.expanded_spending_key(), testNote.note, testNote.tree.root(), testNote.tree.witness());
+    builder.AddTransparentOutput(taddr, 40000);
+
+    auto tx = builder.Build().GetTxOrThrow();
+    // 1 vShieldedSpend + 1 vout
+    // 400 + 64
+    EXPECT_EQ(464, RecursiveDynamicUsage(tx));
+
+    RegtestDeactivateSapling();
+}
diff --git a/depend/zcash/src/gtest/test_equihash.cpp b/depend/zcash/src/gtest/test_equihash.cpp
new file mode 100644
index 000000000..c4e0320af
--- /dev/null
+++ b/depend/zcash/src/gtest/test_equihash.cpp
@@ -0,0 +1,294 @@
+#if defined(HAVE_CONFIG_H)
+#include "config/bitcoin-config.h"
+#endif
+
+#include <gtest/gtest.h>
+#include <gmock/gmock.h>
+
+#include "crypto/equihash.h"
+#include "uint256.h"
+#include "utilstrencodings.h"
+
+void TestExpandAndCompress(const std::string &scope, size_t bit_len, size_t byte_pad,
+                           std::vector<unsigned char> compact,
+                           std::vector<unsigned char> expanded)
+{
+    SCOPED_TRACE(scope);
+
+    std::vector<unsigned char> out(expanded.size());
+    ExpandArray(compact.data(), compact.size(),
+                out.data(), out.size(), bit_len, byte_pad);
+    EXPECT_EQ(expanded, out);
+
+    out.resize(compact.size());
+    CompressArray(expanded.data(), expanded.size(),
+                  out.data(), out.size(), bit_len, byte_pad);
+    EXPECT_EQ(compact, out);
+}
+
+TEST(EquihashTests, ExpandAndContractArrays) {
+    TestExpandAndCompress("8 11-bit chunks, all-ones", 11, 0,
+                          ParseHex("ffffffffffffffffffffff"),
+                          ParseHex("07ff07ff07ff07ff07ff07ff07ff07ff"));
+    TestExpandAndCompress("8 21-bit chunks, alternating 1s and 0s", 21, 0,
+                          ParseHex("aaaaad55556aaaab55555aaaaad55556aaaab55555"),
+                          ParseHex("155555155555155555155555155555155555155555155555"));
+    TestExpandAndCompress("8 21-bit chunks, based on example in the spec", 21, 0,
+                          ParseHex("000220000a7ffffe00123022b38226ac19bdf23456"),
+                          ParseHex("0000440000291fffff0001230045670089ab00cdef123456"));
+    TestExpandAndCompress("16 14-bit chunks, alternating 11s and 00s", 14, 0,
+                          ParseHex("cccf333cccf333cccf333cccf333cccf333cccf333cccf333cccf333"),
+                          ParseHex("3333333333333333333333333333333333333333333333333333333333333333"));
+
+    TestExpandAndCompress("8 11-bit chunks, all-ones, 2-byte padding", 11, 2,
+                          ParseHex("ffffffffffffffffffffff"),
+                          ParseHex("000007ff000007ff000007ff000007ff000007ff000007ff000007ff000007ff"));
+}
+
+void TestMinimalSolnRepr(const std::string &scope, size_t cBitLen,
+                         std::vector<eh_index> indices,
+                         std::vector<unsigned char> minimal)
+{
+    SCOPED_TRACE(scope);
+
+#if ENABLE_MINING
+    EXPECT_EQ(indices, GetIndicesFromMinimal(minimal, cBitLen));
+#endif
+    EXPECT_EQ(minimal, GetMinimalFromIndices(indices, cBitLen));
+}
+
+TEST(EquihashTests, MinimalSolutionRepresentation) {
+    TestMinimalSolnRepr("Test 1", 20,
+                        {1, 1, 1, 1, 1, 1, 1, 1},
+                        ParseHex("000008000040000200001000008000040000200001"));
+    TestMinimalSolnRepr("Test 2", 20,
+                        {2097151, 2097151, 2097151, 2097151,
+                         2097151, 2097151, 2097151, 2097151},
+                        ParseHex("ffffffffffffffffffffffffffffffffffffffffff"));
+    TestMinimalSolnRepr("Test 3", 20,
+                        {131071, 128, 131071, 128, 131071, 128, 131071, 128},
+                        ParseHex("0ffff8002003fffe000800ffff8002003fffe00080"));
+    TestMinimalSolnRepr("Test 4", 20,
+                        {68, 41, 2097151, 1233, 665, 1023, 1, 1048575},
+                        ParseHex("000220000a7ffffe004d10014c800ffc00002fffff"));
+}
+
+#if ENABLE_MINING
+TEST(EquihashTests, IsProbablyDuplicate) {
+    std::shared_ptr<eh_trunc> p1 (new eh_trunc[4] {0, 1, 2, 3}, std::default_delete<eh_trunc[]>());
+    std::shared_ptr<eh_trunc> p2 (new eh_trunc[4] {0, 1, 1, 3}, std::default_delete<eh_trunc[]>());
+    std::shared_ptr<eh_trunc> p3 (new eh_trunc[4] {3, 1, 1, 3}, std::default_delete<eh_trunc[]>());
+
+    ASSERT_FALSE(IsProbablyDuplicate<4>(p1, 4));
+    ASSERT_FALSE(IsProbablyDuplicate<4>(p2, 4));
+    ASSERT_TRUE(IsProbablyDuplicate<4>(p3, 4));
+}
+
+TEST(EquihashTests, CheckBasicSolverCancelled) {
+    Equihash<48,5> Eh48_5;
+    eh_HashState state;
+    Eh48_5.InitialiseState(state);
+    uint256 V = uint256S("0x00");
+    state.Update(V.begin(), V.size());
+
+    {
+        ASSERT_NO_THROW(Eh48_5.BasicSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return false;
+        }));
+    }
+
+    {
+        ASSERT_THROW(Eh48_5.BasicSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return pos == ListGeneration;
+        }), EhSolverCancelledException);
+    }
+
+    {
+        ASSERT_THROW(Eh48_5.BasicSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return pos == ListSorting;
+        }), EhSolverCancelledException);
+    }
+
+    {
+        ASSERT_THROW(Eh48_5.BasicSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return pos == ListColliding;
+        }), EhSolverCancelledException);
+    }
+
+    {
+        ASSERT_THROW(Eh48_5.BasicSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return pos == RoundEnd;
+        }), EhSolverCancelledException);
+    }
+
+    {
+        ASSERT_THROW(Eh48_5.BasicSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return pos == FinalSorting;
+        }), EhSolverCancelledException);
+    }
+
+    {
+        ASSERT_THROW(Eh48_5.BasicSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return pos == FinalColliding;
+        }), EhSolverCancelledException);
+    }
+
+    {
+        ASSERT_NO_THROW(Eh48_5.BasicSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return pos == PartialGeneration;
+        }));
+    }
+
+    {
+        ASSERT_NO_THROW(Eh48_5.BasicSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return pos == PartialSorting;
+        }));
+    }
+
+    {
+        ASSERT_NO_THROW(Eh48_5.BasicSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return pos == PartialSubtreeEnd;
+        }));
+    }
+
+    {
+        ASSERT_NO_THROW(Eh48_5.BasicSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return pos == PartialIndexEnd;
+        }));
+    }
+
+    {
+        ASSERT_NO_THROW(Eh48_5.BasicSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return pos == PartialEnd;
+        }));
+    }
+}
+
+TEST(EquihashTests, CheckOptimisedSolverCancelled) {
+    Equihash<48,5> Eh48_5;
+    eh_HashState state;
+    Eh48_5.InitialiseState(state);
+    uint256 V = uint256S("0x00");
+    state.Update(V.begin(), V.size());
+
+    {
+        ASSERT_NO_THROW(Eh48_5.OptimisedSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return false;
+        }));
+    }
+
+    {
+        ASSERT_THROW(Eh48_5.OptimisedSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return pos == ListGeneration;
+        }), EhSolverCancelledException);
+    }
+
+    {
+        ASSERT_THROW(Eh48_5.OptimisedSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return pos == ListSorting;
+        }), EhSolverCancelledException);
+    }
+
+    {
+        ASSERT_THROW(Eh48_5.OptimisedSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return pos == ListColliding;
+        }), EhSolverCancelledException);
+    }
+
+    {
+        ASSERT_THROW(Eh48_5.OptimisedSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return pos == RoundEnd;
+        }), EhSolverCancelledException);
+    }
+
+    {
+        ASSERT_THROW(Eh48_5.OptimisedSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return pos == FinalSorting;
+        }), EhSolverCancelledException);
+    }
+
+    {
+        ASSERT_THROW(Eh48_5.OptimisedSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return pos == FinalColliding;
+        }), EhSolverCancelledException);
+    }
+
+    {
+        ASSERT_THROW(Eh48_5.OptimisedSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return pos == PartialGeneration;
+        }), EhSolverCancelledException);
+    }
+
+    {
+        ASSERT_THROW(Eh48_5.OptimisedSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return pos == PartialSorting;
+        }), EhSolverCancelledException);
+    }
+
+    {
+        ASSERT_THROW(Eh48_5.OptimisedSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return pos == PartialSubtreeEnd;
+        }), EhSolverCancelledException);
+    }
+
+    {
+        ASSERT_THROW(Eh48_5.OptimisedSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return pos == PartialIndexEnd;
+        }), EhSolverCancelledException);
+    }
+
+    {
+        ASSERT_THROW(Eh48_5.OptimisedSolve(state, [](std::vector<unsigned char> soln) {
+            return false;
+        }, [](EhSolverCancelCheck pos) {
+            return pos == PartialEnd;
+        }), EhSolverCancelledException);
+    }
+}
+#endif // ENABLE_MINING
diff --git a/depend/zcash/src/gtest/test_feature_flagging.cpp b/depend/zcash/src/gtest/test_feature_flagging.cpp
new file mode 100644
index 000000000..b23c38b7b
--- /dev/null
+++ b/depend/zcash/src/gtest/test_feature_flagging.cpp
@@ -0,0 +1,97 @@
+#include <gtest/gtest.h>
+
+#include "chainparams.h"
+#include "consensus/params.h"
+#include "utiltest.h"
+
+#include <optional>
+
+enum TestFeature : uint32_t {
+    TF_1,
+    TF_2,
+    TF_3,
+    TF_4,
+    TF_MAX
+};
+
+struct TestParams {
+    std::set<TestFeature> vRequiredFeatures;
+
+    bool NetworkUpgradeActive(int nHeight, Consensus::UpgradeIndex idx) const {
+        switch (idx) {
+            case Consensus::BASE_SPROUT:
+                return nHeight >= 0;
+            case Consensus::UPGRADE_OVERWINTER:
+                return nHeight >= 5;
+            case Consensus::UPGRADE_SAPLING:
+                return nHeight >= 10;
+            case Consensus::UPGRADE_BLOSSOM:
+                return nHeight >= 15;
+            case Consensus::UPGRADE_HEARTWOOD:
+                return nHeight >= 20;
+            case Consensus::UPGRADE_CANOPY:
+                return nHeight >= 25;
+            case Consensus::UPGRADE_ZFUTURE:
+                return nHeight >= 30;
+            default:
+                return false;
+        }
+    }
+
+    bool FeatureRequired(const TestFeature feature) const {
+        return vRequiredFeatures.count(feature) > 0;
+    }
+};
+
+TEST(FeatureFlagging, FeatureDependencies) {
+    TestParams params;
+
+    Consensus::FeatureSet<TestFeature, TestParams> features({
+        {
+            .dependsOn = {},
+            .activation = Consensus::BASE_SPROUT
+        },
+        {
+            .dependsOn = {TF_1},
+            .activation = Consensus::UPGRADE_OVERWINTER
+        },
+        {
+            .dependsOn = {},
+            .activation = Consensus::UPGRADE_BLOSSOM
+        },
+        {
+            .dependsOn = {TF_2, TF_3},
+            .activation = Consensus::UPGRADE_HEARTWOOD
+        }
+    });
+
+    EXPECT_TRUE(features.FeatureActive(params, 1, TF_1));
+    EXPECT_FALSE(features.FeatureActive(params, 1, TF_2));
+    EXPECT_FALSE(features.FeatureActive(params, 1, TF_3));
+    EXPECT_FALSE(features.FeatureActive(params, 1, TF_4));
+
+    EXPECT_TRUE(features.FeatureActive(params, 5, TF_1));
+    EXPECT_TRUE(features.FeatureActive(params, 5, TF_2));
+    EXPECT_FALSE(features.FeatureActive(params, 5, TF_3));
+    EXPECT_FALSE(features.FeatureActive(params, 5, TF_4));
+
+    EXPECT_TRUE(features.FeatureActive(params, 15, TF_1));
+    EXPECT_TRUE(features.FeatureActive(params, 15, TF_2));
+    EXPECT_TRUE(features.FeatureActive(params, 15, TF_3));
+    EXPECT_FALSE(features.FeatureActive(params, 15, TF_4));
+
+    EXPECT_TRUE(features.FeatureActive(params, 20, TF_1));
+    EXPECT_TRUE(features.FeatureActive(params, 20, TF_2));
+    EXPECT_TRUE(features.FeatureActive(params, 20, TF_3));
+    EXPECT_TRUE(features.FeatureActive(params, 20, TF_4));
+
+    // Force TF_4 to be active
+    params.vRequiredFeatures.insert(TF_4);
+
+    // Ensure that a feature cannot be forced to be active if
+    // all of its dependencies are not active
+    EXPECT_DEATH(features.FeatureActive(params, 5, TF_4), "");
+    // A feature can be activated before its activation height
+    // if all of its dependencies are active
+    EXPECT_TRUE(features.FeatureActive(params, 15, TF_4));
+}
diff --git a/depend/zcash/src/gtest/test_foundersreward.cpp b/depend/zcash/src/gtest/test_foundersreward.cpp
new file mode 100644
index 000000000..c69fb8ebc
--- /dev/null
+++ b/depend/zcash/src/gtest/test_foundersreward.cpp
@@ -0,0 +1,300 @@
+#include <gtest/gtest.h>
+
+#include "main.h"
+#include "utilmoneystr.h"
+#include "chainparams.h"
+#include "consensus/funding.h"
+#include "fs.h"
+#include "key_io.h"
+#include "utilstrencodings.h"
+#include "zcash/Address.hpp"
+#include "wallet/wallet.h"
+#include "amount.h"
+#include <memory>
+#include <string>
+#include <set>
+#include <vector>
+#include "util.h"
+#include "utiltest.h"
+
+// To run tests:
+// ./zcash-gtest --gtest_filter="FoundersRewardTest.*"
+
+//
+// Enable this test to generate and print 48 testnet 2-of-3 multisig addresses.
+// The output can be copied into chainparams.cpp.
+// The temporary wallet file can be renamed as wallet.dat and used for testing with zcashd.
+//
+#if 0
+TEST(FoundersRewardTest, create_testnet_2of3multisig) {
+    SelectParams(CBaseChainParams::TESTNET);
+    fs::path pathTemp = fs::temp_directory_path() / fs::unique_path();
+    fs::create_directories(pathTemp);
+    mapArgs["-datadir"] = pathTemp.string();
+    bool fFirstRun;
+    auto pWallet = std::make_shared<CWallet>("wallet.dat");
+    ASSERT_EQ(DB_LOAD_OK, pWallet->LoadWallet(fFirstRun));
+    pWallet->TopUpKeyPool();
+    std::cout << "Test wallet and logs saved in folder: " << pathTemp.native() << std::endl;
+    
+    int numKeys = 48;
+    std::vector<CPubKey> pubkeys;
+    pubkeys.resize(3);
+    CPubKey newKey;
+    std::vector<std::string> addresses;
+    KeyIO keyIO(Params());
+    for (int i = 0; i < numKeys; i++) {
+        ASSERT_TRUE(pWallet->GetKeyFromPool(newKey));
+        pubkeys[0] = newKey;
+        pWallet->SetAddressBook(newKey.GetID(), "", "receive");
+
+        ASSERT_TRUE(pWallet->GetKeyFromPool(newKey));
+        pubkeys[1] = newKey;
+        pWallet->SetAddressBook(newKey.GetID(), "", "receive");
+
+        ASSERT_TRUE(pWallet->GetKeyFromPool(newKey));
+        pubkeys[2] = newKey;
+        pWallet->SetAddressBook(newKey.GetID(), "", "receive");
+
+        CScript result = GetScriptForMultisig(2, pubkeys);
+        ASSERT_FALSE(result.size() > MAX_SCRIPT_ELEMENT_SIZE);
+        CScriptID innerID(result);
+        pWallet->AddCScript(result);
+        pWallet->SetAddressBook(innerID, "", "receive");
+
+        std::string address = keyIO.EncodeDestination(innerID);
+        addresses.push_back(address);
+    }
+    
+    // Print out the addresses, 4 on each line.
+    std::string s = "vFoundersRewardAddress = {\n";
+    int i=0;
+    int colsPerRow = 4;
+    ASSERT_TRUE(numKeys % colsPerRow == 0);
+    int numRows = numKeys/colsPerRow;
+    for (int row=0; row<numRows; row++) {
+        s += "    ";
+        for (int col=0; col<colsPerRow; col++) {
+            s += "\"" + addresses[i++] + "\", ";
+        }
+        s += "\n";
+    }
+    s += "    };";
+    std::cout << s << std::endl;
+
+    pWallet->Flush(true);
+}
+#endif
+
+
+static int GetLastFoundersRewardHeight(const Consensus::Params& params) {
+    int blossomActivationHeight = Params().GetConsensus().vUpgrades[Consensus::UPGRADE_BLOSSOM].nActivationHeight;
+    bool blossom = blossomActivationHeight != Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT;
+    return params.GetLastFoundersRewardBlockHeight(blossom ? blossomActivationHeight : 0);
+}
+
+// Utility method to check the number of unique addresses from height 1 to maxHeight
+void checkNumberOfUniqueAddresses(int nUnique) {
+    std::set<std::string> addresses;
+    for (int i = 1; i <= GetLastFoundersRewardHeight(Params().GetConsensus()); i++) {
+        addresses.insert(Params().GetFoundersRewardAddressAtHeight(i));
+    }
+    EXPECT_EQ(addresses.size(), nUnique);
+}
+
+int GetMaxFundingStreamHeight(const Consensus::Params& params) {
+    int result = 0;
+    for (auto fs : params.vFundingStreams) {
+        if (fs && result < fs.value().GetEndHeight() - 1) {
+            result = fs.value().GetEndHeight() - 1;
+        }
+    }
+
+    return result;
+}
+
+
+TEST(FoundersRewardTest, General) {
+    SelectParams(CBaseChainParams::TESTNET);
+
+    CChainParams params = Params();
+    
+    // Fourth testnet reward:
+    // address = t2ENg7hHVqqs9JwU5cgjvSbxnT2a9USNfhy
+    // script.ToString() = OP_HASH160 55d64928e69829d9376c776550b6cc710d427153 OP_EQUAL
+    // HexStr(script) = a91455d64928e69829d9376c776550b6cc710d42715387
+    EXPECT_EQ(HexStr(params.GetFoundersRewardScriptAtHeight(1)), "a914ef775f1f997f122a062fff1a2d7443abd1f9c64287");
+    EXPECT_EQ(params.GetFoundersRewardAddressAtHeight(1), "t2UNzUUx8mWBCRYPRezvA363EYXyEpHokyi");
+    EXPECT_EQ(HexStr(params.GetFoundersRewardScriptAtHeight(53126)), "a914ac67f4c072668138d88a86ff21b27207b283212f87");
+    EXPECT_EQ(params.GetFoundersRewardAddressAtHeight(53126), "t2NGQjYMQhFndDHguvUw4wZdNdsssA6K7x2");
+    EXPECT_EQ(HexStr(params.GetFoundersRewardScriptAtHeight(53127)), "a91455d64928e69829d9376c776550b6cc710d42715387");
+    EXPECT_EQ(params.GetFoundersRewardAddressAtHeight(53127), "t2ENg7hHVqqs9JwU5cgjvSbxnT2a9USNfhy");
+
+    int maxHeight = GetLastFoundersRewardHeight(params.GetConsensus());
+    
+    // If the block height parameter is out of bounds, there is an assert.
+    EXPECT_DEATH(params.GetFoundersRewardScriptAtHeight(0), "nHeight");
+    EXPECT_DEATH(params.GetFoundersRewardScriptAtHeight(maxHeight+1), "nHeight");
+    EXPECT_DEATH(params.GetFoundersRewardAddressAtHeight(0), "nHeight");
+    EXPECT_DEATH(params.GetFoundersRewardAddressAtHeight(maxHeight+1), "nHeight"); 
+}
+
+TEST(FoundersRewardTest, RegtestGetLastBlockBlossom) {
+    int blossomActivationHeight = Consensus::PRE_BLOSSOM_REGTEST_HALVING_INTERVAL / 2; // = 75
+    auto params = RegtestActivateBlossom(false, blossomActivationHeight).GetConsensus();
+    int lastFRHeight = params.GetLastFoundersRewardBlockHeight(blossomActivationHeight);
+    EXPECT_EQ(0, params.Halving(lastFRHeight));
+    EXPECT_EQ(1, params.Halving(lastFRHeight + 1));
+    RegtestDeactivateBlossom();
+}
+
+TEST(FoundersRewardTest, MainnetGetLastBlock) {
+    SelectParams(CBaseChainParams::MAIN);
+    const Consensus::Params& params = Params().GetConsensus();
+    int lastFRHeight = GetLastFoundersRewardHeight(params);
+    EXPECT_EQ(0, params.Halving(lastFRHeight));
+    EXPECT_EQ(1, params.Halving(lastFRHeight + 1));
+}
+
+#define NUM_MAINNET_FOUNDER_ADDRESSES 48
+
+TEST(FoundersRewardTest, Mainnet) {
+    SelectParams(CBaseChainParams::MAIN);
+    checkNumberOfUniqueAddresses(NUM_MAINNET_FOUNDER_ADDRESSES);
+}
+
+
+#define NUM_TESTNET_FOUNDER_ADDRESSES 48
+
+TEST(FoundersRewardTest, Testnet) {
+    SelectParams(CBaseChainParams::TESTNET);
+    checkNumberOfUniqueAddresses(NUM_TESTNET_FOUNDER_ADDRESSES);
+}
+
+
+#define NUM_REGTEST_FOUNDER_ADDRESSES 1
+
+TEST(FoundersRewardTest, Regtest) {
+    SelectParams(CBaseChainParams::REGTEST);
+    checkNumberOfUniqueAddresses(NUM_REGTEST_FOUNDER_ADDRESSES);
+}
+
+
+
+// Test that 10% founders reward is fully rewarded after the first halving and slow start shift.
+// On Mainnet, this would be 2,100,000 ZEC after 850,000 blocks (840,000 + 10,000).
+TEST(FoundersRewardTest, SlowStartSubsidy) {
+    SelectParams(CBaseChainParams::MAIN);
+    CChainParams params = Params();
+
+    CAmount totalSubsidy = 0;
+    for (int nHeight = 1; nHeight <= GetLastFoundersRewardHeight(Params().GetConsensus()); nHeight++) {
+        CAmount nSubsidy = GetBlockSubsidy(nHeight, params.GetConsensus()) / 5;
+        totalSubsidy += nSubsidy;
+    }
+    
+    ASSERT_TRUE(totalSubsidy == MAX_MONEY/10.0);
+}
+
+
+// For use with mainnet and testnet which each have 48 addresses.
+// Verify the number of rewards each individual address receives.
+void verifyNumberOfRewards() {
+    CChainParams params = Params();
+    int maxHeight = GetLastFoundersRewardHeight(params.GetConsensus());
+    std::map<std::string, CAmount> ms;
+    for (int nHeight = 1; nHeight <= maxHeight; nHeight++) {
+        std::string addr = params.GetFoundersRewardAddressAtHeight(nHeight);
+        if (ms.count(addr) == 0) {
+            ms[addr] = 0;
+        }
+        ms[addr] = ms[addr] + GetBlockSubsidy(nHeight, params.GetConsensus()) / 5;
+    }
+
+    EXPECT_EQ(ms[params.GetFoundersRewardAddressAtIndex(0)], 1960039937500);
+    EXPECT_EQ(ms[params.GetFoundersRewardAddressAtIndex(1)], 4394460062500);
+    for (int i = 2; i <= 46; i++) {
+        EXPECT_EQ(ms[params.GetFoundersRewardAddressAtIndex(i)], 17709 * COIN * 2.5);
+    }
+    EXPECT_EQ(ms[params.GetFoundersRewardAddressAtIndex(47)], 17677 * COIN * 2.5);
+}
+
+// Verify the number of rewards going to each mainnet address
+TEST(FoundersRewardTest, PerAddressRewardMainnet) {
+    SelectParams(CBaseChainParams::MAIN);
+    verifyNumberOfRewards();
+}
+
+// Verify the number of rewards going to each testnet address
+TEST(FoundersRewardTest, PerAddressRewardTestnet) {
+    SelectParams(CBaseChainParams::TESTNET);
+    verifyNumberOfRewards();
+}
+
+// Verify that post-Canopy, block rewards are split according to ZIP 207.
+TEST(FundingStreamsRewardTest, Zip207Distribution) {
+    auto consensus = RegtestActivateCanopy(false, 200);
+
+    int minHeight = GetLastFoundersRewardHeight(consensus) + 1;
+
+    KeyIO keyIO(Params());
+    auto sk = libzcash::SaplingSpendingKey(uint256());
+    for (int idx = Consensus::FIRST_FUNDING_STREAM; idx < Consensus::MAX_FUNDING_STREAMS; idx++) {
+        // we can just use the same addresses for all streams, all we're trying to do here
+        // is validate that the streams add up to the 20% of block reward.
+        auto shieldedAddr = keyIO.EncodePaymentAddress(sk.default_address());
+        UpdateFundingStreamParameters(
+            (Consensus::FundingStreamIndex) idx,
+            Consensus::FundingStream::ParseFundingStream(
+                consensus,
+                Params(),
+                minHeight, 
+                minHeight + 12, 
+                {
+                    "t2UNzUUx8mWBCRYPRezvA363EYXyEpHokyi",
+                    shieldedAddr,
+                }
+            )
+        );
+    }
+
+    int maxHeight = GetMaxFundingStreamHeight(consensus);
+    std::map<std::string, CAmount> ms;
+    for (int nHeight = minHeight; nHeight <= maxHeight; nHeight++) {
+        auto blockSubsidy = GetBlockSubsidy(nHeight, consensus);
+        auto elems = GetActiveFundingStreamElements(nHeight, blockSubsidy, consensus);
+
+        CAmount totalFunding = 0;
+        for (Consensus::FundingStreamElement elem : elems) {
+            totalFunding += elem.second;
+        }
+        EXPECT_EQ(totalFunding, blockSubsidy / 5);
+    }
+
+    RegtestDeactivateCanopy();
+}
+
+TEST(FundingStreamsRewardTest, ParseFundingStream) {
+    auto consensus = RegtestActivateCanopy(false, 200);
+
+    int minHeight = GetLastFoundersRewardHeight(consensus) + 1;
+
+    KeyIO keyIO(Params());
+    auto sk = libzcash::SaplingSpendingKey(uint256());
+    auto shieldedAddr = keyIO.EncodePaymentAddress(sk.default_address());
+    ASSERT_THROW(
+        Consensus::FundingStream::ParseFundingStream(
+            consensus,
+            Params(),
+            minHeight, 
+            minHeight + 13, 
+            {
+                "t2UNzUUx8mWBCRYPRezvA363EYXyEpHokyi",
+                shieldedAddr,
+            }
+        ),
+        std::runtime_error
+    );
+
+    RegtestDeactivateCanopy();
+}
diff --git a/depend/zcash/src/gtest/test_history.cpp b/depend/zcash/src/gtest/test_history.cpp
new file mode 100644
index 000000000..28ad5be15
--- /dev/null
+++ b/depend/zcash/src/gtest/test_history.cpp
@@ -0,0 +1,215 @@
+#include <gtest/gtest.h>
+
+#include "main.h"
+#include "utiltest.h"
+#include "zcash/History.hpp"
+
+// Fake an empty view
+class FakeCoinsViewDB : public CCoinsView {
+public:
+    FakeCoinsViewDB() {}
+
+    bool GetSproutAnchorAt(const uint256 &rt, SproutMerkleTree &tree) const {
+        return false;
+    }
+
+    bool GetSaplingAnchorAt(const uint256 &rt, SaplingMerkleTree &tree) const {
+        return false;
+    }
+
+    bool GetNullifier(const uint256 &nf, ShieldedType type) const {
+        return false;
+    }
+
+    bool GetCoins(const uint256 &txid, CCoins &coins) const {
+        return false;
+    }
+
+    bool HaveCoins(const uint256 &txid) const {
+        return false;
+    }
+
+    uint256 GetBestBlock() const {
+        uint256 a;
+        return a;
+    }
+
+    uint256 GetBestAnchor(ShieldedType type) const {
+        uint256 a;
+        return a;
+    }
+
+    bool BatchWrite(CCoinsMap &mapCoins,
+                    const uint256 &hashBlock,
+                    const uint256 &hashSproutAnchor,
+                    const uint256 &hashSaplingAnchor,
+                    CAnchorsSproutMap &mapSproutAnchors,
+                    CAnchorsSaplingMap &mapSaplingAnchors,
+                    CNullifiersMap &mapSproutNullifiers,
+                    CNullifiersMap saplingNullifiersMap) {
+        return false;
+    }
+
+    bool GetStats(CCoinsStats &stats) const {
+        return false;
+    }
+
+    HistoryIndex GetHistoryLength(uint32_t branchId) const {
+        return 0;
+    }
+
+    HistoryNode GetHistoryAt(uint32_t branchId, HistoryIndex index) const {
+        return HistoryNode();
+    }
+};
+
+HistoryNode getLeafN(uint64_t block_num) {
+    HistoryNode node = libzcash::NewV1Leaf(
+        uint256(),
+        block_num*10,
+        block_num*13,
+        uint256(),
+        uint256(),
+        block_num,
+        3
+    );
+    return node;
+}
+
+TEST(History, Smoky) {
+    // Fake an empty view
+    FakeCoinsViewDB fakeDB;
+    CCoinsViewCache view(&fakeDB);
+
+    uint32_t epochId = 0;
+
+    // Test initial value
+    EXPECT_EQ(view.GetHistoryLength(epochId), 0);
+
+    view.PushHistoryNode(epochId, getLeafN(1));
+
+    EXPECT_EQ(view.GetHistoryLength(epochId), 1);
+
+    view.PushHistoryNode(epochId, getLeafN(2));
+
+    EXPECT_EQ(view.GetHistoryLength(epochId), 3);
+
+    view.PushHistoryNode(epochId, getLeafN(3));
+
+    EXPECT_EQ(view.GetHistoryLength(epochId), 4);
+
+    view.PushHistoryNode(epochId, getLeafN(4));
+
+    uint256 h4Root = view.GetHistoryRoot(epochId);
+
+    EXPECT_EQ(view.GetHistoryLength(epochId), 7);
+
+    view.PushHistoryNode(epochId, getLeafN(5));
+    EXPECT_EQ(view.GetHistoryLength(epochId), 8);
+
+    view.PopHistoryNode(epochId);
+
+    EXPECT_EQ(view.GetHistoryLength(epochId), 7);
+    EXPECT_EQ(h4Root, view.GetHistoryRoot(epochId));
+}
+
+
+TEST(History, EpochBoundaries) {
+    // Fake an empty view
+    FakeCoinsViewDB fakeDB;
+    CCoinsViewCache view(&fakeDB);
+
+    // Test with the Heartwood and Canopy epochs
+    uint32_t epoch1 = 0xf5b9230b;
+    uint32_t epoch2 = 0xe9ff75a6;
+
+    view.PushHistoryNode(epoch1, getLeafN(1));
+
+    EXPECT_EQ(view.GetHistoryLength(epoch1), 1);
+
+    view.PushHistoryNode(epoch1, getLeafN(2));
+
+    EXPECT_EQ(view.GetHistoryLength(epoch1), 3);
+
+    view.PushHistoryNode(epoch1, getLeafN(3));
+
+    EXPECT_EQ(view.GetHistoryLength(epoch1), 4);
+
+    view.PushHistoryNode(epoch1, getLeafN(4));
+
+    uint256 h4Root = view.GetHistoryRoot(epoch1);
+
+    EXPECT_EQ(view.GetHistoryLength(epoch1), 7);
+
+    view.PushHistoryNode(epoch1, getLeafN(5));
+    EXPECT_EQ(view.GetHistoryLength(epoch1), 8);
+
+
+    // Move to Canopy epoch
+    view.PushHistoryNode(epoch2, getLeafN(6));
+    EXPECT_EQ(view.GetHistoryLength(epoch1), 8);
+    EXPECT_EQ(view.GetHistoryLength(epoch2), 1);
+
+    view.PushHistoryNode(epoch2, getLeafN(7));
+    EXPECT_EQ(view.GetHistoryLength(epoch1), 8);
+    EXPECT_EQ(view.GetHistoryLength(epoch2), 3);
+
+    view.PushHistoryNode(epoch2, getLeafN(8));
+    EXPECT_EQ(view.GetHistoryLength(epoch1), 8);
+    EXPECT_EQ(view.GetHistoryLength(epoch2), 4);
+
+    // Rolling epoch back to 1
+    view.PopHistoryNode(epoch2);
+    EXPECT_EQ(view.GetHistoryLength(epoch2), 3);
+
+    view.PopHistoryNode(epoch2);
+    EXPECT_EQ(view.GetHistoryLength(epoch2), 1);
+    EXPECT_EQ(view.GetHistoryLength(epoch1), 8);
+
+    // And even rolling epoch 1 back a bit
+    view.PopHistoryNode(epoch1);
+    EXPECT_EQ(view.GetHistoryLength(epoch1), 7);
+
+    // And also rolling epoch 2 back to 0
+    view.PopHistoryNode(epoch2);
+    EXPECT_EQ(view.GetHistoryLength(epoch2), 0);
+
+    // Trying to truncate an empty tree is a no-op
+    view.PopHistoryNode(epoch2);
+    EXPECT_EQ(view.GetHistoryLength(epoch2), 0);
+
+}
+
+TEST(History, GarbageMemoryHash) {
+    const auto consensusBranchId = NetworkUpgradeInfo[Consensus::UPGRADE_HEARTWOOD].nBranchId;
+
+    FakeCoinsViewDB fakeDB;
+    CCoinsViewCache view(&fakeDB);
+
+    // Hash two history nodes
+    HistoryNode node0 = getLeafN(1);
+    HistoryNode node1 = getLeafN(2);
+
+    view.PushHistoryNode(consensusBranchId, node0);
+    view.PushHistoryNode(consensusBranchId, node1);
+
+    uint256 historyRoot = view.GetHistoryRoot(consensusBranchId);
+
+    // Change garbage memory and re-hash nodes
+    FakeCoinsViewDB fakeDBGarbage;
+    CCoinsViewCache viewGarbage(&fakeDBGarbage);
+
+    HistoryNode node0Garbage = getLeafN(1);
+    HistoryNode node1Garbage = getLeafN(2);
+
+    node0Garbage.bytes[NODE_SERIALIZED_LENGTH - 1] = node0.bytes[NODE_SERIALIZED_LENGTH - 1] ^ 1;
+    node1Garbage.bytes[NODE_SERIALIZED_LENGTH - 1] = node1.bytes[NODE_SERIALIZED_LENGTH - 1] ^ 1;
+
+    viewGarbage.PushHistoryNode(consensusBranchId, node0Garbage);
+    viewGarbage.PushHistoryNode(consensusBranchId, node1Garbage);
+
+    uint256 historyRootGarbage = viewGarbage.GetHistoryRoot(consensusBranchId);
+
+    // Check history root and garbage history root are equal
+    EXPECT_EQ(historyRoot, historyRootGarbage);
+}
diff --git a/depend/zcash/src/gtest/test_httprpc.cpp b/depend/zcash/src/gtest/test_httprpc.cpp
new file mode 100644
index 000000000..c630973fb
--- /dev/null
+++ b/depend/zcash/src/gtest/test_httprpc.cpp
@@ -0,0 +1,62 @@
+#include <gtest/gtest.h>
+#include <gmock/gmock.h>
+
+#include "httprpc.cpp"
+#include "httpserver.h"
+
+using ::testing::Return;
+
+class MockHTTPRequest : public HTTPRequest {
+public:
+    MOCK_METHOD0(GetPeer, CService());
+    MOCK_METHOD0(GetRequestMethod, HTTPRequest::RequestMethod());
+    MOCK_METHOD1(GetHeader, std::pair<bool, std::string>(const std::string& hdr));
+    MOCK_METHOD2(WriteHeader, void(const std::string& hdr, const std::string& value));
+    MOCK_METHOD2(WriteReply, void(int nStatus, const std::string& strReply));
+
+    MockHTTPRequest() : HTTPRequest(nullptr) {}
+    void CleanUp() {
+        // So the parent destructor doesn't try to send a reply
+        replySent = true;
+    }
+};
+
+TEST(HTTPRPC, FailsOnGET) {
+    MockHTTPRequest req;
+    EXPECT_CALL(req, GetRequestMethod())
+        .WillRepeatedly(Return(HTTPRequest::GET));
+    EXPECT_CALL(req, WriteReply(HTTP_BAD_METHOD, "JSONRPC server handles only POST requests"))
+        .Times(1);
+    EXPECT_FALSE(HTTPReq_JSONRPC(&req, ""));
+    req.CleanUp();
+}
+
+TEST(HTTPRPC, FailsWithoutAuthHeader) {
+    MockHTTPRequest req;
+    EXPECT_CALL(req, GetRequestMethod())
+        .WillRepeatedly(Return(HTTPRequest::POST));
+    EXPECT_CALL(req, GetHeader("authorization"))
+        .WillRepeatedly(Return(std::make_pair(false, "")));
+    EXPECT_CALL(req, WriteHeader("WWW-Authenticate", "Basic realm=\"jsonrpc\""))
+        .Times(1);
+    EXPECT_CALL(req, WriteReply(HTTP_UNAUTHORIZED, ""))
+        .Times(1);
+    EXPECT_FALSE(HTTPReq_JSONRPC(&req, ""));
+    req.CleanUp();
+}
+
+TEST(HTTPRPC, FailsWithBadAuth) {
+    MockHTTPRequest req;
+    EXPECT_CALL(req, GetRequestMethod())
+        .WillRepeatedly(Return(HTTPRequest::POST));
+    EXPECT_CALL(req, GetHeader("authorization"))
+        .WillRepeatedly(Return(std::make_pair(true, "Basic spam:eggs")));
+    EXPECT_CALL(req, GetPeer())
+        .WillRepeatedly(Return(CService("127.0.0.1:1337")));
+    EXPECT_CALL(req, WriteHeader("WWW-Authenticate", "Basic realm=\"jsonrpc\""))
+        .Times(1);
+    EXPECT_CALL(req, WriteReply(HTTP_UNAUTHORIZED, ""))
+        .Times(1);
+    EXPECT_FALSE(HTTPReq_JSONRPC(&req, ""));
+    req.CleanUp();
+}
diff --git a/depend/zcash/src/gtest/test_joinsplit.cpp b/depend/zcash/src/gtest/test_joinsplit.cpp
new file mode 100644
index 000000000..e5538abac
--- /dev/null
+++ b/depend/zcash/src/gtest/test_joinsplit.cpp
@@ -0,0 +1,660 @@
+#include <gtest/gtest.h>
+
+#include "utilstrencodings.h"
+
+
+#include "zcash/prf.h"
+#include "util.h"
+#include "streams.h"
+#include "version.h"
+#include "serialize.h"
+#include "primitives/transaction.h"
+#include "proof_verifier.h"
+#include "transaction_builder.h"
+#include "gtest/utils.h"
+#include "utiltest.h"
+#include "zcash/JoinSplit.hpp"
+#include "zcash/Note.hpp"
+#include "zcash/NoteEncryption.hpp"
+#include "zcash/IncrementalMerkleTree.hpp"
+
+#include <array>
+
+#include <rust/ed25519/types.h>
+
+using namespace libzcash;
+
+// Make the Groth proof for a Sprout statement,
+// and store the result in a JSDescription object.
+JSDescription makeSproutProof(
+        std::array<JSInput, 2>& inputs,
+        std::array<JSOutput, 2>& outputs,
+        const Ed25519VerificationKey& joinSplitPubKey,
+        uint64_t vpub_old,
+        uint64_t vpub_new,
+        const uint256& rt
+){
+    return JSDescriptionInfo(joinSplitPubKey, rt, inputs, outputs, vpub_old, vpub_new).BuildDeterministic();
+}
+
+bool verifySproutProof(
+        const JSDescription& jsdesc,
+        const Ed25519VerificationKey& joinSplitPubKey
+)
+{
+    auto verifier = ProofVerifier::Strict();
+    return verifier.VerifySprout(jsdesc, joinSplitPubKey);
+}
+
+
+void test_full_api()
+{
+    // Create verification context.
+    auto verifier = ProofVerifier::Strict();
+
+    // The recipient's information.
+    SproutSpendingKey recipient_key = SproutSpendingKey::random();
+    SproutPaymentAddress recipient_addr = recipient_key.address();
+
+    // Create the commitment tree
+    SproutMerkleTree tree;
+
+    // Set up a JoinSplit description
+    uint64_t vpub_old = 10;
+    uint64_t vpub_new = 0;
+    Ed25519VerificationKey joinSplitPubKey;
+    GetRandBytes(joinSplitPubKey.bytes, ED25519_VERIFICATION_KEY_LEN);
+    uint256 rt = tree.root();
+    JSDescription jsdesc;
+
+    {
+        std::array<JSInput, 2> inputs = {
+            JSInput(), // dummy input
+            JSInput() // dummy input
+        };
+
+        std::array<JSOutput, 2> outputs = {
+            JSOutput(recipient_addr, 10),
+            JSOutput() // dummy output
+        };
+
+        std::array<SproutNote, 2> output_notes;
+
+        // Perform the proofs
+        jsdesc = makeSproutProof(
+            inputs,
+            outputs,
+            joinSplitPubKey,
+            vpub_old,
+            vpub_new,
+            rt
+        );
+    }
+
+    // Verify both PHGR and Groth Proof:
+    ASSERT_TRUE(verifySproutProof(jsdesc, joinSplitPubKey));
+
+    {
+        SproutMerkleTree tree;
+        JSDescription jsdesc2;
+        // Recipient should decrypt
+        // Now the recipient should spend the money again
+        auto h_sig = ZCJoinSplit::h_sig(jsdesc.randomSeed, jsdesc.nullifiers, joinSplitPubKey);
+        ZCNoteDecryption decryptor(recipient_key.receiving_key());
+
+        auto note_pt = SproutNotePlaintext::decrypt(
+            decryptor,
+            jsdesc.ciphertexts[0],
+            jsdesc.ephemeralKey,
+            h_sig,
+            0
+        );
+
+        auto decrypted_note = note_pt.note(recipient_addr);
+
+        ASSERT_TRUE(decrypted_note.value() == 10);
+
+        // Insert the commitments from the last tx into the tree
+        tree.append(jsdesc.commitments[0]);
+        auto witness_recipient = tree.witness();
+        tree.append(jsdesc.commitments[1]);
+        witness_recipient.append(jsdesc.commitments[1]);
+        vpub_old = 0;
+        vpub_new = 1;
+        rt = tree.root();
+        Ed25519VerificationKey joinSplitPubKey2;
+        GetRandBytes(joinSplitPubKey2.bytes, ED25519_VERIFICATION_KEY_LEN);
+
+        {
+            std::array<JSInput, 2> inputs = {
+                JSInput(), // dummy input
+                JSInput(witness_recipient, decrypted_note, recipient_key)
+            };
+
+            SproutSpendingKey second_recipient = SproutSpendingKey::random();
+            SproutPaymentAddress second_addr = second_recipient.address();
+
+            std::array<JSOutput, 2> outputs = {
+                JSOutput(second_addr, 9),
+                JSOutput() // dummy output
+            };
+
+            std::array<SproutNote, 2> output_notes;
+
+
+            // Perform the proofs
+            jsdesc2 = makeSproutProof(
+                inputs,
+                outputs,
+                joinSplitPubKey2,
+                vpub_old,
+                vpub_new,
+                rt
+            );
+
+        }
+
+
+        // Verify Groth Proof:
+        ASSERT_TRUE(verifySproutProof(jsdesc2, joinSplitPubKey2));
+    }
+}
+
+// Invokes the API (but does not compute a proof)
+// to test exceptions
+void invokeAPI(
+    const std::array<JSInput, 2>& inputs,
+    const std::array<JSOutput, 2>& outputs,
+    uint64_t vpub_old,
+    uint64_t vpub_new,
+    const uint256& rt
+) {
+    uint256 ephemeralKey;
+    uint256 randomSeed;
+    Ed25519VerificationKey joinSplitPubKey;
+    GetRandBytes(joinSplitPubKey.bytes, ED25519_VERIFICATION_KEY_LEN);
+    std::array<uint256, 2> macs;
+    std::array<uint256, 2> nullifiers;
+    std::array<uint256, 2> commitments;
+    std::array<ZCNoteEncryption::Ciphertext, 2> ciphertexts;
+
+    std::array<SproutNote, 2> output_notes;
+
+    // Groth
+    SproutProof proof = ZCJoinSplit::prove(
+        inputs,
+        outputs,
+        output_notes,
+        ciphertexts,
+        ephemeralKey,
+        joinSplitPubKey,
+        randomSeed,
+        macs,
+        nullifiers,
+        commitments,
+        vpub_old,
+        vpub_new,
+        rt,
+        false
+    );
+}
+
+void invokeAPIFailure(
+    const std::array<JSInput, 2>& inputs,
+    const std::array<JSOutput, 2>& outputs,
+    uint64_t vpub_old,
+    uint64_t vpub_new,
+    const uint256& rt,
+    std::string reason
+)
+{
+    try {
+        invokeAPI(inputs, outputs, vpub_old, vpub_new, rt);
+        FAIL() << "It worked, when it shouldn't have!";
+    } catch(std::invalid_argument const & err) {
+        EXPECT_EQ(err.what(), reason);
+    } catch(...) {
+        FAIL() << "Expected invalid_argument exception.";
+    }
+}
+
+TEST(Joinsplit, HSig)
+{
+/*
+// by Taylor Hornby
+
+import hashlib
+import binascii
+
+def hSig(randomSeed, nf1, nf2, joinSplitPubKey):
+    return hashlib.blake2b(
+        data=(randomSeed + nf1 + nf2 + joinSplitPubKey),
+        digest_size=32,
+        person=b"ZcashComputehSig"
+    ).digest()
+
+INCREASING = "\x00\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0A\x0B\x0C\x0D\x0E\x0F\x10\x11\x12\x13\x14\x15\x16\x17\x18\x19\x1A\x1B\x1C\x1D\x1E\x1F"
+
+TEST_VECTORS = [
+    [b"a" * 32, b"b" * 32, b"c" * 32, b"d" * 32],
+    [b"\x00" * 32, b"\x00" * 32, b"\x00" * 32, b"\x00" * 32],
+    [b"\xFF" * 32, b"\xFF" * 32, b"\xFF" * 32, b"\xFF" * 32],
+    [INCREASING, INCREASING, INCREASING, INCREASING]
+]
+
+for test_input in TEST_VECTORS:
+    print "---"
+    print "\"" + binascii.hexlify(test_input[0][::-1]) + "\""
+    print "\"" + binascii.hexlify(test_input[1][::-1]) + "\""
+    print "\"" + binascii.hexlify(test_input[2][::-1]) + "\""
+    print "\"" + binascii.hexlify(test_input[3][::-1]) + "\""
+    print "\"" + binascii.hexlify(hSig(test_input[0], test_input[1], test_input[2], test_input[3])[::-1]) + "\""
+*/
+
+    std::vector<std::vector<std::string>> tests = {
+        {
+            "6161616161616161616161616161616161616161616161616161616161616161",
+            "6262626262626262626262626262626262626262626262626262626262626262",
+            "6363636363636363636363636363636363636363636363636363636363636363",
+            "6464646464646464646464646464646464646464646464646464646464646464",
+            "a8cba69f1fa329c055756b4af900f8a00b61e44f4cb8a1824ceb58b90a5b8113"
+        },
+        {
+            "0000000000000000000000000000000000000000000000000000000000000000",
+            "0000000000000000000000000000000000000000000000000000000000000000",
+            "0000000000000000000000000000000000000000000000000000000000000000",
+            "0000000000000000000000000000000000000000000000000000000000000000",
+            "697322276b5dd93b12fb1fcbd2144b2960f24c73aac6c6a0811447be1e7f1e19"
+        },
+        {
+            "ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+            "ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+            "ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+            "ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff",
+            "4961048919f0ca79d49c9378c36a91a8767060001f4212fe6f7d426f3ccf9f32"
+        },
+        {
+            "1f1e1d1c1b1a191817161514131211100f0e0d0c0b0a09080706050403020100",
+            "1f1e1d1c1b1a191817161514131211100f0e0d0c0b0a09080706050403020100",
+            "1f1e1d1c1b1a191817161514131211100f0e0d0c0b0a09080706050403020100",
+            "1f1e1d1c1b1a191817161514131211100f0e0d0c0b0a09080706050403020100",
+            "b61110ec162693bc3d9ca7fb0eec3afd2e278e2f41394b3ff11d7cb761ad4b27"
+        }
+    };
+
+    for (std::vector<std::string>& v : tests) {
+        Ed25519VerificationKey joinSplitPubKey;
+        auto pubKeyBytes = uint256S(v[3]);
+        std::copy(pubKeyBytes.begin(), pubKeyBytes.end(), joinSplitPubKey.bytes);
+        auto expected = ZCJoinSplit::h_sig(
+            uint256S(v[0]),
+            {uint256S(v[1]), uint256S(v[2])},
+            joinSplitPubKey
+        );
+
+        EXPECT_EQ(expected, uint256S(v[4]));
+    }
+}
+
+void increment_note_witnesses(
+    const uint256& element,
+    std::vector<SproutWitness>& witnesses,
+    SproutMerkleTree& tree
+)
+{
+    tree.append(element);
+    for (SproutWitness& w : witnesses) {
+        w.append(element);
+    }
+    witnesses.push_back(tree.witness());
+}
+
+TEST(Joinsplit, FullApiTest)
+{
+    LoadProofParameters();
+
+    {
+        std::vector<SproutWitness> witnesses;
+        SproutMerkleTree tree;
+        increment_note_witnesses(uint256(), witnesses, tree);
+        SproutSpendingKey sk = SproutSpendingKey::random();
+        SproutPaymentAddress addr = sk.address();
+        SproutNote note1(addr.a_pk, 100, random_uint256(), random_uint256());
+        increment_note_witnesses(note1.cm(), witnesses, tree);
+        SproutNote note2(addr.a_pk, 100, random_uint256(), random_uint256());
+        increment_note_witnesses(note2.cm(), witnesses, tree);
+        SproutNote note3(addr.a_pk, 2100000000000001, random_uint256(), random_uint256());
+        increment_note_witnesses(note3.cm(), witnesses, tree);
+        SproutNote note4(addr.a_pk, 1900000000000000, random_uint256(), random_uint256());
+        increment_note_witnesses(note4.cm(), witnesses, tree);
+        SproutNote note5(addr.a_pk, 1900000000000000, random_uint256(), random_uint256());
+        increment_note_witnesses(note5.cm(), witnesses, tree);
+
+        // Should work
+        invokeAPI(
+        {
+            JSInput(),
+            JSInput()
+        },
+        {
+            JSOutput(),
+            JSOutput()
+        },
+        0,
+        0,
+        tree.root());
+
+        // lhs > MAX_MONEY
+        invokeAPIFailure(
+        {
+            JSInput(),
+            JSInput()
+        },
+        {
+            JSOutput(),
+            JSOutput()
+        },
+        2100000000000001,
+        0,
+        tree.root(),
+        "nonsensical vpub_old value");
+
+        // rhs > MAX_MONEY
+        invokeAPIFailure(
+        {
+            JSInput(),
+            JSInput()
+        },
+        {
+            JSOutput(),
+            JSOutput()
+        },
+        0,
+        2100000000000001,
+        tree.root(),
+        "nonsensical vpub_new value");
+
+        // input witness for the wrong element
+        invokeAPIFailure(
+        {
+            JSInput(witnesses[0], note1, sk),
+            JSInput()
+        },
+        {
+            JSOutput(),
+            JSOutput()
+        },
+        0,
+        100,
+        tree.root(),
+        "witness of wrong element for joinsplit input");
+
+        // input witness doesn't match up with
+        // real root
+        invokeAPIFailure(
+        {
+            JSInput(witnesses[1], note1, sk),
+            JSInput()
+        },
+        {
+            JSOutput(),
+            JSOutput()
+        },
+        0,
+        100,
+        uint256(),
+        "joinsplit not anchored to the correct root");
+
+        // input is in the tree now! this should work
+        invokeAPI(
+        {
+            JSInput(witnesses[1], note1, sk),
+            JSInput()
+        },
+        {
+            JSOutput(),
+            JSOutput()
+        },
+        0,
+        100,
+        tree.root());
+
+        // Wrong secret key
+        invokeAPIFailure(
+        {
+            JSInput(witnesses[1], note1, SproutSpendingKey::random()),
+            JSInput()
+        },
+        {
+            JSOutput(),
+            JSOutput()
+        },
+        0,
+        0,
+        tree.root(),
+        "input note not authorized to spend with given key");
+
+        // Absurd input value
+        invokeAPIFailure(
+        {
+            JSInput(witnesses[3], note3, sk),
+            JSInput()
+        },
+        {
+            JSOutput(),
+            JSOutput()
+        },
+        0,
+        0,
+        tree.root(),
+        "nonsensical input note value");
+
+        // Absurd total input value
+        invokeAPIFailure(
+        {
+            JSInput(witnesses[4], note4, sk),
+            JSInput(witnesses[5], note5, sk)
+        },
+        {
+            JSOutput(),
+            JSOutput()
+        },
+        0,
+        0,
+        tree.root(),
+        "nonsensical left hand size of joinsplit balance");
+
+        // Absurd output value
+        invokeAPIFailure(
+        {
+            JSInput(),
+            JSInput()
+        },
+        {
+            JSOutput(addr, 2100000000000001),
+            JSOutput()
+        },
+        0,
+        0,
+        tree.root(),
+        "nonsensical output value");
+
+        // Absurd total output value
+        invokeAPIFailure(
+        {
+            JSInput(),
+            JSInput()
+        },
+        {
+            JSOutput(addr, 1900000000000000),
+            JSOutput(addr, 1900000000000000)
+        },
+        0,
+        0,
+        tree.root(),
+        "nonsensical right hand side of joinsplit balance");
+
+        // Absurd total output value
+        invokeAPIFailure(
+        {
+            JSInput(),
+            JSInput()
+        },
+        {
+            JSOutput(addr, 1900000000000000),
+            JSOutput()
+        },
+        0,
+        0,
+        tree.root(),
+        "invalid joinsplit balance");
+    }
+
+    test_full_api();
+}
+
+TEST(Joinsplit, NotePlaintexts)
+{
+    uint252 a_sk = uint252(uint256S("f6da8716682d600f74fc16bd0187faad6a26b4aa4c24d5c055b216d94516840e"));
+    uint256 a_pk = PRF_addr_a_pk(a_sk);
+    uint256 sk_enc = ZCNoteEncryption::generate_privkey(a_sk);
+    uint256 pk_enc = ZCNoteEncryption::generate_pubkey(sk_enc);
+    SproutPaymentAddress addr_pk(a_pk, pk_enc);
+
+    uint256 h_sig;
+
+    ZCNoteEncryption encryptor(h_sig);
+    uint256 epk = encryptor.get_epk();
+
+    SproutNote note(a_pk,
+              1945813,
+              random_uint256(),
+              random_uint256()
+             );
+
+    std::array<unsigned char, ZC_MEMO_SIZE> memo;
+
+    SproutNotePlaintext note_pt(note, memo);
+
+    ZCNoteEncryption::Ciphertext ct = note_pt.encrypt(encryptor, pk_enc);
+
+    ZCNoteDecryption decryptor(sk_enc);
+
+    auto decrypted = SproutNotePlaintext::decrypt(decryptor, ct, epk, h_sig, 0);
+    auto decrypted_note = decrypted.note(addr_pk);
+
+    ASSERT_TRUE(decrypted_note.a_pk == note.a_pk);
+    ASSERT_TRUE(decrypted_note.rho == note.rho);
+    ASSERT_TRUE(decrypted_note.r == note.r);
+    ASSERT_TRUE(decrypted_note.value() == note.value());
+
+    ASSERT_TRUE(decrypted.memo() == note_pt.memo());
+
+    // Check memo() returns by reference, not return by value, for use cases such as:
+    // std::string data(plaintext.memo().begin(), plaintext.memo().end());
+    ASSERT_TRUE(decrypted.memo().data() == decrypted.memo().data());
+
+    // Check serialization of note plaintext
+    CDataStream ss(SER_DISK, PROTOCOL_VERSION);
+    ss << note_pt;
+    SproutNotePlaintext note_pt2;
+    ss >> note_pt2;
+    ASSERT_EQ(note_pt.value(), note.value());
+    ASSERT_EQ(note_pt.value(), note_pt2.value());
+    ASSERT_EQ(note_pt.memo(), note_pt2.memo());
+    ASSERT_EQ(note_pt.rho, note_pt2.rho);
+    ASSERT_EQ(note_pt.r, note_pt2.r);
+}
+
+TEST(Joinsplit, NoteClass)
+{
+    uint252 a_sk = uint252(uint256S("f6da8716682d600f74fc16bd0187faad6a26b4aa4c24d5c055b216d94516840e"));
+    uint256 a_pk = PRF_addr_a_pk(a_sk);
+    uint256 sk_enc = ZCNoteEncryption::generate_privkey(a_sk);
+    uint256 pk_enc = ZCNoteEncryption::generate_pubkey(sk_enc);
+    SproutPaymentAddress addr_pk(a_pk, pk_enc);
+
+    SproutNote note(a_pk,
+                    1945813,
+                    random_uint256(),
+                    random_uint256());
+
+    SproutNote clone = note;
+    ASSERT_NE(&note, &clone);
+    ASSERT_EQ(note.value(), clone.value());
+    ASSERT_EQ(note.cm(), clone.cm());
+    ASSERT_EQ(note.rho, clone.rho);
+    ASSERT_EQ(note.r, clone.r);
+    ASSERT_EQ(note.a_pk, clone.a_pk);
+}
+
+TEST(Joinsplit, BasicJoinsplitVerification)
+{
+    LoadProofParameters();
+
+    // We only check that joinsplits are constructed properly
+    // and verify them here. It's generally libzcash's job
+    // to ensure the integrity of the Sprout protocol
+    // implementation through its own tests.
+
+    // construct a merkle tree
+    SproutMerkleTree merkleTree;
+
+    auto k = libzcash::SproutSpendingKey::random();
+    auto addr = k.address();
+
+    libzcash::SproutNote note(addr.a_pk, 100, uint256(), uint256());
+
+    // commitment from note
+    uint256 commitment = note.cm();
+
+    // insert commitment into the merkle tree
+    merkleTree.append(commitment);
+
+    // compute the merkle root we will be working with
+    uint256 rt = merkleTree.root();
+
+    auto witness = merkleTree.witness();
+
+    // create JSDescription
+    Ed25519VerificationKey joinSplitPubKey;
+    std::array<libzcash::JSInput, ZC_NUM_JS_INPUTS> inputs = {
+        libzcash::JSInput(witness, note, k),
+        libzcash::JSInput() // dummy input of zero value
+    };
+    std::array<libzcash::JSOutput, ZC_NUM_JS_OUTPUTS> outputs = {
+        libzcash::JSOutput(addr, 50),
+        libzcash::JSOutput(addr, 50)
+    };
+
+    auto verifier = ProofVerifier::Strict();
+
+    {
+        auto jsdesc = JSDescriptionInfo(joinSplitPubKey, rt, inputs, outputs, 0, 0).BuildDeterministic();
+        EXPECT_TRUE(verifier.VerifySprout(jsdesc, joinSplitPubKey));
+
+        CDataStream ss(SER_DISK, CLIENT_VERSION);
+        auto os = WithVersion(&ss, SAPLING_TX_VERSION | 1 << 31);
+        os << jsdesc;
+
+        JSDescription jsdesc_deserialized;
+        os >> jsdesc_deserialized;
+
+        EXPECT_TRUE(jsdesc_deserialized == jsdesc);
+        EXPECT_TRUE(verifier.VerifySprout(jsdesc_deserialized, joinSplitPubKey));
+    }
+
+    {
+        // Ensure that the balance equation is working.
+        EXPECT_THROW(JSDescriptionInfo(joinSplitPubKey, rt, inputs, outputs, 10, 0).BuildDeterministic(), std::invalid_argument);
+        EXPECT_THROW(JSDescriptionInfo(joinSplitPubKey, rt, inputs, outputs, 0, 10).BuildDeterministic(), std::invalid_argument);
+    }
+
+    {
+        // Ensure that it won't verify if the root is changed.
+        auto test = JSDescriptionInfo(joinSplitPubKey, rt, inputs, outputs, 0, 0).BuildDeterministic();
+        test.anchor = GetRandHash();
+        EXPECT_FALSE(verifier.VerifySprout(test, joinSplitPubKey));
+    }
+
+}
diff --git a/depend/zcash/src/gtest/test_keys.cpp b/depend/zcash/src/gtest/test_keys.cpp
new file mode 100644
index 000000000..6c247ef7f
--- /dev/null
+++ b/depend/zcash/src/gtest/test_keys.cpp
@@ -0,0 +1,313 @@
+#include <chainparams.h>
+#include <key_io.h>
+#include <zcash/Address.hpp>
+
+#include "utiltest.h"
+
+#include <variant>
+
+#include <gtest/gtest.h>
+
+#include "json_test_vectors.h"
+#include "test/data/unified_addrs.json.h"
+#include "test/data/unified_full_viewing_keys.json.h"
+
+TEST(Keys, EncodeAndDecodeSapling)
+{
+    SelectParams(CBaseChainParams::MAIN);
+    KeyIO keyIO(Params());
+
+    auto m = GetTestMasterSaplingSpendingKey();
+
+    for (uint32_t i = 0; i < 1000; i++) {
+        auto sk = m.Derive(i);
+        {
+            std::string sk_string = keyIO.EncodeSpendingKey(sk);
+            EXPECT_EQ(
+                sk_string.substr(0, 24),
+                Params().Bech32HRP(CChainParams::SAPLING_EXTENDED_SPEND_KEY));
+
+            auto spendingkey2 = keyIO.DecodeSpendingKey(sk_string);
+            EXPECT_TRUE(spendingkey2.has_value());
+
+            auto sk2 = std::get_if<libzcash::SaplingExtendedSpendingKey>(&spendingkey2.value());
+            EXPECT_NE(sk2, nullptr);
+            EXPECT_EQ(sk, *sk2);
+        }
+        {
+            auto extfvk = sk.ToXFVK();
+            std::string vk_string = keyIO.EncodeViewingKey(extfvk);
+            EXPECT_EQ(
+                vk_string.substr(0, 7),
+                Params().Bech32HRP(CChainParams::SAPLING_EXTENDED_FVK));
+
+            auto viewingkey2 = keyIO.DecodeViewingKey(vk_string);
+            EXPECT_TRUE(viewingkey2.has_value());
+
+            auto extfvk2 = std::get_if<libzcash::SaplingExtendedFullViewingKey>(&viewingkey2.value());
+            EXPECT_NE(extfvk2, nullptr);
+            EXPECT_EQ(extfvk, *extfvk2);
+        }
+        {
+            auto addr = sk.ToXFVK().DefaultAddress();
+
+            std::string addr_string = keyIO.EncodePaymentAddress(addr);
+            EXPECT_EQ(
+                addr_string.substr(0, 2),
+                Params().Bech32HRP(CChainParams::SAPLING_PAYMENT_ADDRESS));
+
+            auto paymentaddr2 = keyIO.DecodePaymentAddress(addr_string);
+            EXPECT_TRUE(paymentaddr2.has_value());
+
+            auto addr2 = std::get_if<libzcash::SaplingPaymentAddress>(&paymentaddr2.value());
+            EXPECT_NE(addr2, nullptr);
+            EXPECT_EQ(addr, *addr2);
+        }
+    }
+}
+
+#define MAKE_STRING(x) std::string((x), (x) + sizeof(x))
+
+namespace libzcash {
+    void PrintTo(const Receiver& receiver, std::ostream* os) {
+        *os << DebugPrintReceiver(receiver);
+    }
+    void PrintTo(const UnifiedAddress& ua, std::ostream* os) {
+        *os << "UnifiedAddress(" << testing::PrintToString(ua.GetReceiversAsParsed()) << ")";
+    }
+}
+
+TEST(Keys, EncodeAndDecodeUnifiedAddresses)
+{
+    SelectParams(CBaseChainParams::MAIN);
+    KeyIO keyIO(Params());
+
+    UniValue ua_tests = read_json(MAKE_STRING(json_tests::unified_addrs));
+
+    for (size_t idx = 0; idx < ua_tests.size(); idx++) {
+        UniValue test = ua_tests[idx];
+        std::string strTest = test.write();
+        if (test.size() < 1) // Allow for extra stuff (useful for comments)
+        {
+            FAIL() << "Bad test: " << strTest;
+            continue;
+        }
+        if (test.size() == 1) continue; // comment
+
+        try {
+            libzcash::UnifiedAddress ua;
+            // ["p2pkh_bytes, p2sh_bytes, sapling_raw_addr, orchard_raw_addr, unknown_typecode, unknown_bytes, unified_addr, root_seed, account, diversifier_index"],
+            // These were added to the UA in preference order by the Python test vectors.
+            if (!test[3].isNull()) {
+                auto data = ParseHex(test[3].get_str());
+                CDataStream ss(
+                    data,
+                    SER_NETWORK,
+                    PROTOCOL_VERSION);
+                ua.AddReceiver(libzcash::OrchardRawAddress::Read(ss));
+            }
+            if (!test[2].isNull()) {
+                auto data = ParseHex(test[2].get_str());
+                CDataStream ss(
+                    data,
+                    SER_NETWORK,
+                    PROTOCOL_VERSION);
+                libzcash::SaplingPaymentAddress r;
+                ss >> r;
+                ua.AddReceiver(r);
+            }
+            if (!test[1].isNull()) {
+                CScriptID r(ParseHex(test[1].get_str()));
+                ua.AddReceiver(r);
+            }
+            if (!test[0].isNull()) {
+                CKeyID r(ParseHex(test[0].get_str()));
+                ua.AddReceiver(r);
+            }
+
+            auto expectedBytes = ParseHex(test[6].get_str());
+            std::string expected(expectedBytes.begin(), expectedBytes.end());
+
+            auto decoded = keyIO.DecodePaymentAddress(expected);
+            EXPECT_TRUE(decoded.has_value());
+            auto ua_ptr = std::get_if<libzcash::UnifiedAddress>(&decoded.value());
+            EXPECT_NE(ua_ptr, nullptr);
+            EXPECT_EQ(*ua_ptr, ua);
+
+            auto encoded = keyIO.EncodePaymentAddress(ua);
+            EXPECT_EQ(encoded, expected);
+        } catch (const std::exception& ex) {
+            FAIL() << "Bad test, couldn't deserialize data: " << strTest << ": " << ex.what();
+        } catch (...) {
+            FAIL() << "Bad test, couldn't deserialize data: " << strTest;
+        }
+    }
+}
+
+TEST(Keys, DeriveUnifiedFullViewingKeys)
+{
+    SelectParams(CBaseChainParams::MAIN);
+    KeyIO keyIO(Params());
+
+    UniValue ua_tests = read_json(MAKE_STRING(json_tests::unified_full_viewing_keys));
+
+    for (size_t idx = 0; idx < ua_tests.size(); idx++) {
+        UniValue test = ua_tests[idx];
+
+        std::string strTest = test.write();
+        if (test.size() < 1) // Allow for extra stuff (useful for comments)
+        {
+            FAIL() << "Bad test: " << strTest;
+            continue;
+        }
+        if (test.size() == 1) continue; // comment
+
+        try {
+            // [
+            //     t_key_bytes,
+            //     sapling_fvk_bytes,
+            //     orchard_fvk_bytes,
+            //     unknown_fvk_typecode,
+            //     unknown_fvk_bytes,
+            //     unified_fvk,
+            //     root_seed,
+            //     account,
+            // ],
+            auto seed_hex = test[6].get_str();
+            auto seed_data = ParseHex(seed_hex);
+            RawHDSeed raw_seed(seed_data.begin(), seed_data.end());
+            ASSERT_EQ(HexStr(raw_seed), seed_hex);
+
+            HDSeed hdseed(raw_seed);
+            auto usk = libzcash::ZcashdUnifiedSpendingKey::ForAccount(
+                    hdseed,
+                    133, //ZCASH_MAIN_COINTYPE
+                    test[7].get_int());
+            ASSERT_TRUE(usk.has_value());
+            auto ufvk = usk->ToFullViewingKey();
+
+            if (!test[0].isNull()) {
+                auto expectedHex = test[0].get_str();
+
+                // Ensure that the serialized transparent account key matches the test data.
+                auto tkey = ufvk.GetTransparentKey().value();
+                CDataStream ssEncode(SER_NETWORK, PROTOCOL_VERSION);
+                ssEncode << tkey.GetChainablePubKey();
+                EXPECT_EQ(ssEncode.size(), 65);
+                auto tkeyHex = HexStr(ssEncode.begin(), ssEncode.end());
+                EXPECT_EQ(expectedHex, tkeyHex);
+
+                // Ensure that parsing the test data derives the correct account pubkey.
+                auto data = ParseHex(expectedHex);
+                ASSERT_EQ(data.size(), 65);
+                CDataStream ss(data, SER_NETWORK, PROTOCOL_VERSION);
+                auto expected = libzcash::transparent::AccountPubKey(CChainablePubKey::Read(ss));
+                EXPECT_EQ(expected, tkey);
+            }
+            if (!test[1].isNull()) {
+                auto expectedHex = test[1].get_str();
+
+                // Ensure that the serialized Sapling dfvk matches the test data.
+                auto saplingKey = ufvk.GetSaplingKey().value();
+                CDataStream ssEncode(SER_NETWORK, PROTOCOL_VERSION);
+                ssEncode << saplingKey;
+                EXPECT_EQ(ssEncode.size(), 128);
+                auto skeyHex = HexStr(ssEncode.begin(), ssEncode.end());
+                EXPECT_EQ(expectedHex, skeyHex);
+
+                // Ensure that parsing the test data derives the correct dfvk
+                auto data = ParseHex(expectedHex);
+                ASSERT_EQ(data.size(), 128);
+                CDataStream ss(data, SER_NETWORK, PROTOCOL_VERSION);
+                auto key = libzcash::SaplingDiversifiableFullViewingKey::Read(ss);
+                EXPECT_EQ(key, saplingKey);
+            }
+            if (!test[2].isNull()) {
+                auto expectedHex = test[2].get_str();
+
+                // Ensure that the serialized Orchard fvk matches the test data.
+                auto orchardKey = ufvk.GetOrchardKey().value();
+                CDataStream ssEncode(SER_NETWORK, PROTOCOL_VERSION);
+                ssEncode << orchardKey;
+                EXPECT_EQ(ssEncode.size(), 96);
+                auto skeyHex = HexStr(ssEncode.begin(), ssEncode.end());
+                EXPECT_EQ(expectedHex, skeyHex);
+
+                // Ensure that parsing the test data derives the correct dfvk
+                auto data = ParseHex(expectedHex);
+                ASSERT_EQ(data.size(), 96);
+                CDataStream ss(data, SER_NETWORK, PROTOCOL_VERSION);
+                auto key = libzcash::OrchardFullViewingKey::Read(ss);
+                EXPECT_EQ(key, orchardKey);
+            }
+            // Enable the following after Orchard keys are supported.
+            //{
+            //    auto fvk_data = ParseHex(test[5].get_str());
+            //    std::string expected(fvk_data.begin(), fvk_data.end());
+            //    EXPECT_EQ(expected, ufvk.Encode(Params(CBaseChainParams::MAIN)));
+            //}
+        } catch (const std::exception& ex) {
+            FAIL() << "Bad test, couldn't deserialize data: " << strTest << ": " << ex.what();
+        } catch (...) {
+            FAIL() << "Bad test, couldn't deserialize data: " << strTest;
+        }
+    }
+}
+
+
+TEST(Keys, EncodeAndDecodeUnifiedFullViewingKeys)
+{
+    SelectParams(CBaseChainParams::MAIN);
+    KeyIO keyIO(Params());
+
+    UniValue ua_tests = read_json(MAKE_STRING(json_tests::unified_full_viewing_keys));
+
+    for (size_t idx = 0; idx < ua_tests.size(); idx++) {
+        UniValue test = ua_tests[idx];
+        std::string strTest = test.write();
+        if (test.size() < 1) // Allow for extra stuff (useful for comments)
+        {
+            FAIL() << "Bad test: " << strTest;
+            continue;
+        }
+        if (test.size() == 1) continue; // comment
+
+        libzcash::UnifiedFullViewingKeyBuilder builder;
+        // ["t_key_bytes, sapling_fvk_bytes, orchard_fvk_bytes, unknown_fvk_typecode, unknown_fvk_bytes, unified_fvk"]
+        // These were added to the UA in preference order by the Python test vectors.
+        if (!test[0].isNull()) {
+            auto data = ParseHex(test[0].get_str());
+            ASSERT_EQ(data.size(), 65);
+            CDataStream ss(data, SER_NETWORK, PROTOCOL_VERSION);
+            auto decoded = CChainablePubKey::Read(ss);
+            ASSERT_TRUE(builder.AddTransparentKey(decoded));
+        }
+        if (!test[1].isNull()) {
+            auto data = ParseHex(test[1].get_str());
+            ASSERT_EQ(data.size(), 128);
+            CDataStream ss(data, SER_NETWORK, PROTOCOL_VERSION);
+            auto key = libzcash::SaplingDiversifiableFullViewingKey::Read(ss);
+            ASSERT_TRUE(builder.AddSaplingKey(key));
+        }
+        if (!test[2].isNull()) {
+            auto data = ParseHex(test[2].get_str());
+            ASSERT_EQ(data.size(), 96);
+            CDataStream ss(data, SER_NETWORK, PROTOCOL_VERSION);
+            auto key = libzcash::OrchardFullViewingKey::Read(ss);
+            ASSERT_TRUE(builder.AddOrchardKey(key));
+        }
+
+        auto built = builder.build();
+        ASSERT_TRUE(built.has_value());
+
+        auto keystrBytes = ParseHex(test[5].get_str());
+        std::string keystr(keystrBytes.begin(), keystrBytes.end());
+
+        auto decoded = libzcash::UnifiedFullViewingKey::Decode(keystr, Params());
+        ASSERT_TRUE(decoded.has_value());
+
+        EXPECT_EQ(decoded.value().GetTransparentKey(), built.value().GetTransparentKey());
+        EXPECT_EQ(decoded.value().GetSaplingKey(), built.value().GetSaplingKey());
+        EXPECT_EQ(decoded.value().GetOrchardKey(), built.value().GetOrchardKey());
+    }
+}
diff --git a/depend/zcash/src/gtest/test_keystore.cpp b/depend/zcash/src/gtest/test_keystore.cpp
new file mode 100644
index 000000000..64e3ea97d
--- /dev/null
+++ b/depend/zcash/src/gtest/test_keystore.cpp
@@ -0,0 +1,634 @@
+#include <gtest/gtest.h>
+
+#include "test/data/sapling_key_components.json.h"
+
+#include "keystore.h"
+#include "random.h"
+#ifdef ENABLE_WALLET
+#include "wallet/crypter.h"
+#endif
+#include "utiltest.h"
+#include "zcash/Address.hpp"
+
+#include "json_test_vectors.h"
+
+#define MAKE_STRING(x) std::string((x), (x)+sizeof(x))
+
+using namespace libzcash;
+
+const uint32_t SLIP44_TESTNET_TYPE = 1;
+
+TEST(KeystoreTests, StoreAndRetrieveMnemonicSeed) {
+    CBasicKeyStore keyStore;
+
+    // When we haven't set a seed, we shouldn't get one
+    EXPECT_FALSE(keyStore.HaveMnemonicSeed());
+    auto seedOut = keyStore.GetMnemonicSeed();
+    EXPECT_FALSE(seedOut.has_value());
+
+    // Generate a random seed
+    auto seed = MnemonicSeed::Random(SLIP44_TESTNET_TYPE);
+
+    // We should be able to set and retrieve the seed
+    ASSERT_TRUE(keyStore.SetMnemonicSeed(seed));
+    EXPECT_TRUE(keyStore.HaveMnemonicSeed());
+    seedOut = keyStore.GetMnemonicSeed();
+    ASSERT_TRUE(seedOut.has_value());
+    EXPECT_EQ(seed, seedOut.value());
+
+    // Generate another random seed
+    auto seed2 = MnemonicSeed::Random(SLIP44_TESTNET_TYPE);
+    EXPECT_NE(seed, seed2);
+
+    // We should not be able to set and retrieve a different seed
+    EXPECT_FALSE(keyStore.SetMnemonicSeed(seed2));
+    seedOut = keyStore.GetMnemonicSeed();
+    ASSERT_TRUE(seedOut.has_value());
+    EXPECT_EQ(seed, seedOut.value());
+}
+
+TEST(KeystoreTests, DecodeInvalidMnemonic) {
+    SecureString mnemonic("\xff");
+    EXPECT_FALSE(MnemonicSeed::ForPhrase(Language::English, mnemonic).has_value());
+}
+
+TEST(KeystoreTests, DeserializeMnemonic) {
+    CDataStream ss0(SER_NETWORK, CLIENT_VERSION);
+    ss0 << (uint32_t)English;
+    ss0 << SecureString("abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon art");
+    EXPECT_NO_THROW(MnemonicSeed::Read(ss0));
+
+    CDataStream ss(SER_NETWORK, CLIENT_VERSION);
+    ss << (uint32_t)English;
+    ss << SecureString("\xff");
+    EXPECT_THROW(MnemonicSeed::Read(ss), std::ios_base::failure);
+}
+
+TEST(KeystoreTests, StoreAndRetrieveLegacyHDSeed) {
+    CBasicKeyStore keyStore;
+
+    // When we haven't set a seed, we shouldn't get one
+    std::optional<HDSeed> seedOut = keyStore.GetLegacyHDSeed();
+    EXPECT_FALSE(seedOut.has_value());
+
+    // Generate a random seed
+    // (We use MnemonicSeed purely to generate a seed, and then drop the mnemonic part.)
+    HDSeed seed = MnemonicSeed::Random(SLIP44_TESTNET_TYPE);
+
+    // We should be able to set and retrieve the seed
+    ASSERT_TRUE(keyStore.SetLegacyHDSeed(seed));
+    seedOut = keyStore.GetLegacyHDSeed();
+    ASSERT_TRUE(seedOut.has_value());
+    EXPECT_EQ(seed, seedOut.value());
+
+    // Generate another random seed
+    HDSeed seed2 = MnemonicSeed::Random(SLIP44_TESTNET_TYPE);
+    EXPECT_NE(seed, seed2);
+
+    // We should not be able to set and retrieve a different seed
+    EXPECT_FALSE(keyStore.SetLegacyHDSeed(seed2));
+    seedOut = keyStore.GetLegacyHDSeed();
+    ASSERT_TRUE(seedOut.has_value());
+    EXPECT_EQ(seed, seedOut.value());
+}
+
+TEST(KeystoreTests, SaplingKeys) {
+    // ["sk, ask, nsk, ovk, ak, nk, ivk, default_d, default_pk_d, note_v, note_r, note_cm, note_pos, note_nf"],
+    UniValue sapling_keys = read_json(MAKE_STRING(json_tests::sapling_key_components));
+
+    // Skipping over comments in sapling_key_components.json file
+    for (size_t i = 2; i < 12; i++) {
+        uint256 skSeed, ask, nsk, ovk, ak, nk, ivk;
+        skSeed.SetHex(sapling_keys[i][0].getValStr());
+        ask.SetHex(sapling_keys[i][1].getValStr());
+        nsk.SetHex(sapling_keys[i][2].getValStr());
+        ovk.SetHex(sapling_keys[i][3].getValStr());
+        ak.SetHex(sapling_keys[i][4].getValStr());
+        nk.SetHex(sapling_keys[i][5].getValStr());
+        ivk.SetHex(sapling_keys[i][6].getValStr());
+
+        libzcash::diversifier_t default_d;
+        std::copy_n(ParseHex(sapling_keys[i][7].getValStr()).begin(), 11, default_d.begin());
+
+        uint256 default_pk_d;
+        default_pk_d.SetHex(sapling_keys[i][8].getValStr());
+
+        auto sk = libzcash::SaplingSpendingKey(skSeed);
+
+        // Check that expanded spending key from primitives and from sk are the same
+        auto exp_sk_2 = libzcash::SaplingExpandedSpendingKey(ask, nsk, ovk);
+        auto exp_sk = sk.expanded_spending_key();
+        EXPECT_EQ(exp_sk, exp_sk_2);
+
+        // Check that full viewing key derived from sk and expanded sk are the same
+        auto full_viewing_key = sk.full_viewing_key();
+        EXPECT_EQ(full_viewing_key, exp_sk.full_viewing_key());
+
+        // Check that full viewing key from primitives and from sk are the same
+        auto full_viewing_key_2 = libzcash::SaplingFullViewingKey(ak, nk, ovk);
+        EXPECT_EQ(full_viewing_key, full_viewing_key_2);
+
+        // Check that incoming viewing key from primitives and from sk are the same
+        auto in_viewing_key = full_viewing_key.in_viewing_key();
+        auto in_viewing_key_2 = libzcash::SaplingIncomingViewingKey(ivk);
+        EXPECT_EQ(in_viewing_key, in_viewing_key_2);
+
+        // Check that the default address from primitives and from sk method are the same
+        auto default_addr = sk.default_address();
+        auto addrOpt2 = in_viewing_key.address(default_d);
+        EXPECT_TRUE(addrOpt2);
+        auto default_addr_2 = addrOpt2.value();
+        EXPECT_EQ(default_addr, default_addr_2);
+
+        auto default_addr_3 = libzcash::SaplingPaymentAddress(default_d, default_pk_d);
+        EXPECT_EQ(default_addr_2, default_addr_3);
+        EXPECT_EQ(default_addr, default_addr_3);
+    }
+}
+
+TEST(KeystoreTests, StoreAndRetrieveSpendingKey) {
+    CBasicKeyStore keyStore;
+    libzcash::SproutSpendingKey skOut;
+
+    std::set<libzcash::SproutPaymentAddress> addrs;
+    keyStore.GetSproutPaymentAddresses(addrs);
+    EXPECT_EQ(0, addrs.size());
+
+    auto sk = libzcash::SproutSpendingKey::random();
+    auto addr = sk.address();
+
+    // Sanity-check: we can't get a key we haven't added
+    EXPECT_FALSE(keyStore.HaveSproutSpendingKey(addr));
+    EXPECT_FALSE(keyStore.GetSproutSpendingKey(addr, skOut));
+
+    keyStore.AddSproutSpendingKey(sk);
+    EXPECT_TRUE(keyStore.HaveSproutSpendingKey(addr));
+    EXPECT_TRUE(keyStore.GetSproutSpendingKey(addr, skOut));
+    EXPECT_EQ(sk, skOut);
+
+    keyStore.GetSproutPaymentAddresses(addrs);
+    EXPECT_EQ(1, addrs.size());
+    EXPECT_EQ(1, addrs.count(addr));
+}
+
+TEST(KeystoreTests, StoreAndRetrieveNoteDecryptor) {
+    CBasicKeyStore keyStore;
+    ZCNoteDecryption decOut;
+
+    auto sk = libzcash::SproutSpendingKey::random();
+    auto addr = sk.address();
+
+    EXPECT_FALSE(keyStore.GetNoteDecryptor(addr, decOut));
+
+    keyStore.AddSproutSpendingKey(sk);
+    EXPECT_TRUE(keyStore.GetNoteDecryptor(addr, decOut));
+    EXPECT_EQ(ZCNoteDecryption(sk.receiving_key()), decOut);
+}
+
+TEST(KeystoreTests, StoreAndRetrieveViewingKey) {
+    CBasicKeyStore keyStore;
+    libzcash::SproutViewingKey vkOut;
+    libzcash::SproutSpendingKey skOut;
+    ZCNoteDecryption decOut;
+
+    auto sk = libzcash::SproutSpendingKey::random();
+    auto vk = sk.viewing_key();
+    auto addr = sk.address();
+
+    // Sanity-check: we can't get a viewing key we haven't added
+    EXPECT_FALSE(keyStore.HaveSproutViewingKey(addr));
+    EXPECT_FALSE(keyStore.GetSproutViewingKey(addr, vkOut));
+
+    // and we shouldn't have a spending key or decryptor either
+    EXPECT_FALSE(keyStore.HaveSproutSpendingKey(addr));
+    EXPECT_FALSE(keyStore.GetSproutSpendingKey(addr, skOut));
+    EXPECT_FALSE(keyStore.GetNoteDecryptor(addr, decOut));
+
+    // and we can't find it in our list of addresses
+    std::set<libzcash::SproutPaymentAddress> addresses;
+    keyStore.GetSproutPaymentAddresses(addresses);
+    EXPECT_FALSE(addresses.count(addr));
+
+    keyStore.AddSproutViewingKey(vk);
+    EXPECT_TRUE(keyStore.HaveSproutViewingKey(addr));
+    EXPECT_TRUE(keyStore.GetSproutViewingKey(addr, vkOut));
+    EXPECT_EQ(vk, vkOut);
+
+    // We should still not have the spending key...
+    EXPECT_FALSE(keyStore.HaveSproutSpendingKey(addr));
+    EXPECT_FALSE(keyStore.GetSproutSpendingKey(addr, skOut));
+
+    // ... but we should have a decryptor
+    EXPECT_TRUE(keyStore.GetNoteDecryptor(addr, decOut));
+    EXPECT_EQ(ZCNoteDecryption(sk.receiving_key()), decOut);
+
+    // ... and we should find it in our list of addresses
+    addresses.clear();
+    keyStore.GetSproutPaymentAddresses(addresses);
+    EXPECT_TRUE(addresses.count(addr));
+
+    keyStore.RemoveSproutViewingKey(vk);
+    EXPECT_FALSE(keyStore.HaveSproutViewingKey(addr));
+    EXPECT_FALSE(keyStore.GetSproutViewingKey(addr, vkOut));
+    EXPECT_FALSE(keyStore.HaveSproutSpendingKey(addr));
+    EXPECT_FALSE(keyStore.GetSproutSpendingKey(addr, skOut));
+    addresses.clear();
+    keyStore.GetSproutPaymentAddresses(addresses);
+    EXPECT_FALSE(addresses.count(addr));
+
+    // We still have a decryptor because those are cached in memory
+    // (and also we only remove viewing keys when adding a spending key)
+    EXPECT_TRUE(keyStore.GetNoteDecryptor(addr, decOut));
+    EXPECT_EQ(ZCNoteDecryption(sk.receiving_key()), decOut);
+}
+
+// Sapling
+TEST(KeystoreTests, StoreAndRetrieveSaplingSpendingKey) {
+    CBasicKeyStore keyStore;
+    libzcash::SaplingExtendedSpendingKey skOut;
+    libzcash::SaplingExtendedFullViewingKey extfvkOut;
+    libzcash::SaplingIncomingViewingKey ivkOut;
+
+    auto sk = GetTestMasterSaplingSpendingKey();
+    auto extfvk = sk.ToXFVK();
+    auto ivk = extfvk.ToIncomingViewingKey();
+    auto addr = sk.ToXFVK().DefaultAddress();
+
+    // Sanity-check: we can't get a key we haven't added
+    EXPECT_FALSE(keyStore.HaveSaplingSpendingKey(extfvk));
+    EXPECT_FALSE(keyStore.GetSaplingSpendingKey(extfvk, skOut));
+    // Sanity-check: we can't get a full viewing key we haven't added
+    EXPECT_FALSE(keyStore.HaveSaplingFullViewingKey(ivk));
+    EXPECT_FALSE(keyStore.GetSaplingFullViewingKey(ivk, extfvkOut));
+
+    // When we specify the default address, we get the full mapping
+    keyStore.AddSaplingSpendingKey(sk);
+    EXPECT_TRUE(keyStore.HaveSaplingSpendingKey(extfvk));
+    EXPECT_TRUE(keyStore.GetSaplingSpendingKey(extfvk, skOut));
+    EXPECT_TRUE(keyStore.HaveSaplingFullViewingKey(ivk));
+    EXPECT_TRUE(keyStore.GetSaplingFullViewingKey(ivk, extfvkOut));
+
+    // We can't get an incoming viewing key for an address we haven't added
+    EXPECT_FALSE(keyStore.HaveSaplingIncomingViewingKey(addr));
+    EXPECT_FALSE(keyStore.GetSaplingIncomingViewingKey(addr, ivkOut));
+
+    keyStore.AddSaplingPaymentAddress(ivk, addr);
+    EXPECT_TRUE(keyStore.HaveSaplingIncomingViewingKey(addr));
+    EXPECT_TRUE(keyStore.GetSaplingIncomingViewingKey(addr, ivkOut));
+    EXPECT_EQ(sk, skOut);
+    EXPECT_EQ(extfvk, extfvkOut);
+    EXPECT_EQ(ivk, ivkOut);
+}
+
+TEST(KeystoreTests, StoreAndRetrieveSaplingFullViewingKey) {
+    CBasicKeyStore keyStore;
+    libzcash::SaplingExtendedSpendingKey skOut;
+    libzcash::SaplingExtendedFullViewingKey extfvkOut;
+    libzcash::SaplingIncomingViewingKey ivkOut;
+
+    auto sk = GetTestMasterSaplingSpendingKey();
+    auto extfvk = sk.ToXFVK();
+    auto ivk = extfvk.ToIncomingViewingKey();
+    auto addr = sk.ToXFVK().DefaultAddress();
+
+    // Sanity-check: we can't get a full viewing key we haven't added
+    EXPECT_FALSE(keyStore.HaveSaplingFullViewingKey(ivk));
+    EXPECT_FALSE(keyStore.GetSaplingFullViewingKey(ivk, extfvkOut));
+
+    // and we shouldn't have a spending key or incoming viewing key either
+    EXPECT_FALSE(keyStore.HaveSaplingSpendingKey(extfvk));
+    EXPECT_FALSE(keyStore.GetSaplingSpendingKey(extfvk, skOut));
+    EXPECT_FALSE(keyStore.HaveSaplingIncomingViewingKey(addr));
+    EXPECT_FALSE(keyStore.GetSaplingIncomingViewingKey(addr, ivkOut));
+
+    // and we can't find the default address in our list of addresses
+    std::set<libzcash::SaplingPaymentAddress> addresses;
+    keyStore.GetSaplingPaymentAddresses(addresses);
+    EXPECT_FALSE(addresses.count(addr));
+
+    // When we add the full viewing key, we should have it
+    keyStore.AddSaplingFullViewingKey(extfvk);
+    EXPECT_TRUE(keyStore.HaveSaplingFullViewingKey(ivk));
+    EXPECT_TRUE(keyStore.GetSaplingFullViewingKey(ivk, extfvkOut));
+    EXPECT_EQ(extfvk, extfvkOut);
+
+    // We should still not have the spending key or
+    // be able to retrieve the IVK by the default address...
+    EXPECT_FALSE(keyStore.HaveSaplingSpendingKey(extfvk));
+    EXPECT_FALSE(keyStore.GetSaplingSpendingKey(extfvk, skOut));
+    EXPECT_FALSE(keyStore.HaveSaplingIncomingViewingKey(addr));
+
+    // The IVK must be manually associated with the address...
+    keyStore.AddSaplingPaymentAddress(ivk, addr);
+    EXPECT_TRUE(keyStore.HaveSaplingIncomingViewingKey(addr));
+    EXPECT_TRUE(keyStore.GetSaplingIncomingViewingKey(addr, ivkOut));
+    EXPECT_EQ(ivk, ivkOut);
+
+    // ... and we should find the default address in our list of addresses
+    addresses.clear();
+    keyStore.GetSaplingPaymentAddresses(addresses);
+    EXPECT_TRUE(addresses.count(addr));
+}
+
+#ifdef ENABLE_WALLET
+class TestCCryptoKeyStore : public CCryptoKeyStore
+{
+public:
+    bool EncryptKeys(CKeyingMaterial& vMasterKeyIn) { return CCryptoKeyStore::EncryptKeys(vMasterKeyIn); }
+    bool Unlock(const CKeyingMaterial& vMasterKeyIn) { return CCryptoKeyStore::Unlock(vMasterKeyIn); }
+};
+
+TEST(KeystoreTests, StoreAndRetrieveMnemonicSeedInEncryptedStore) {
+    TestCCryptoKeyStore keyStore;
+    CKeyingMaterial vMasterKey(32, 0);
+    GetRandBytes(vMasterKey.data(), 32);
+
+    // 1) Test adding a seed to an unencrypted key store, then encrypting it
+    auto seed = MnemonicSeed::Random(SLIP44_TESTNET_TYPE);
+    EXPECT_FALSE(keyStore.HaveMnemonicSeed());
+    auto seedOut = keyStore.GetMnemonicSeed();
+    EXPECT_FALSE(seedOut.has_value());
+
+    ASSERT_TRUE(keyStore.SetMnemonicSeed(seed));
+    EXPECT_TRUE(keyStore.HaveMnemonicSeed());
+    seedOut = keyStore.GetMnemonicSeed();
+    ASSERT_TRUE(seedOut.has_value());
+    EXPECT_EQ(seed, seedOut.value());
+
+    ASSERT_TRUE(keyStore.EncryptKeys(vMasterKey));
+    seedOut = keyStore.GetMnemonicSeed();
+    EXPECT_FALSE(seedOut.has_value());
+
+    // Unlocking with a random key causes sporadic failures, since we currently
+    // don't use an authenticated encryption scheme for CCryptoKeyStore.
+
+    // Currently, DecryptMnemonicSeed tests if a key is invalid by looking at
+    // the return value of CBCDecrypt. If keyStore.Unlock is called with an
+    // invalid key, there's roughly a 257/65536 chance that the padding check
+    // in CBCDecrypt will pass, in which case DecryptMnemonicSeed then calls
+    // the deserialization code in mnemonic.h with random data.
+
+    // Unlocking with vMasterKey should succeed
+    ASSERT_TRUE(keyStore.Unlock(vMasterKey));
+    seedOut = keyStore.GetMnemonicSeed();
+    ASSERT_TRUE(seedOut.has_value());
+    EXPECT_EQ(seed, seedOut.value());
+
+    // 2) Test replacing the seed in an already-encrypted key store fails
+    auto seed2 = MnemonicSeed::Random(SLIP44_TESTNET_TYPE);
+    EXPECT_FALSE(keyStore.SetMnemonicSeed(seed2));
+    EXPECT_TRUE(keyStore.HaveMnemonicSeed());
+    seedOut = keyStore.GetMnemonicSeed();
+    ASSERT_TRUE(seedOut.has_value());
+    EXPECT_EQ(seed, seedOut.value());
+
+    // 3) Test adding a new seed to an already-encrypted key store
+    TestCCryptoKeyStore keyStore2;
+
+    // Add a Sprout address so the wallet has something to test when decrypting
+    ASSERT_TRUE(keyStore2.AddSproutSpendingKey(libzcash::SproutSpendingKey::random()));
+
+    ASSERT_TRUE(keyStore2.EncryptKeys(vMasterKey));
+    ASSERT_TRUE(keyStore2.Unlock(vMasterKey));
+
+    EXPECT_FALSE(keyStore2.HaveMnemonicSeed());
+    seedOut = keyStore2.GetMnemonicSeed();
+    EXPECT_FALSE(seedOut.has_value());
+
+    auto seed3 = MnemonicSeed::Random(SLIP44_TESTNET_TYPE);
+    ASSERT_TRUE(keyStore2.SetMnemonicSeed(seed3));
+    EXPECT_TRUE(keyStore2.HaveMnemonicSeed());
+    seedOut = keyStore2.GetMnemonicSeed();
+    ASSERT_TRUE(seedOut.has_value());
+    EXPECT_EQ(seed3, seedOut.value());
+}
+
+TEST(KeystoreTests, StoreAndRetrieveLegacyHDSeedInEncryptedStore) {
+    TestCCryptoKeyStore keyStore;
+    CKeyingMaterial vMasterKey(32, 0);
+    GetRandBytes(vMasterKey.data(), 32);
+
+    // 1) Test adding a seed to an unencrypted key store, then encrypting it
+    // We use a mnemonic seed, then disregard the mnemonic itself.
+    auto seed = MnemonicSeed::Random(SLIP44_TESTNET_TYPE);
+    auto seedOut = keyStore.GetLegacyHDSeed();
+    EXPECT_FALSE(seedOut.has_value());
+
+    ASSERT_TRUE(keyStore.SetLegacyHDSeed(seed));
+    seedOut = keyStore.GetLegacyHDSeed();
+    ASSERT_TRUE(seedOut.has_value());
+
+    ASSERT_TRUE(keyStore.EncryptKeys(vMasterKey));
+    seedOut = keyStore.GetLegacyHDSeed();
+    EXPECT_FALSE(seedOut.has_value());
+
+    // Unlocking with a random key should fail
+    CKeyingMaterial vRandomKey(32, 0);
+    GetRandBytes(vRandomKey.data(), 32);
+    EXPECT_FALSE(keyStore.Unlock(vRandomKey));
+
+    // Unlocking with a slightly-modified vMasterKey should fail
+    CKeyingMaterial vModifiedKey(vMasterKey);
+    vModifiedKey[0] += 1;
+    EXPECT_FALSE(keyStore.Unlock(vModifiedKey));
+
+    // Unlocking with vMasterKey should succeed
+    ASSERT_TRUE(keyStore.Unlock(vMasterKey));
+    seedOut = keyStore.GetLegacyHDSeed();
+    ASSERT_TRUE(seedOut.has_value());
+    EXPECT_EQ(seed, seedOut.value());
+
+    // 2) Test replacing the seed in an already-encrypted key store fails
+    auto seed2 = MnemonicSeed::Random(SLIP44_TESTNET_TYPE);
+    EXPECT_FALSE(keyStore.SetLegacyHDSeed(seed2));
+    seedOut = keyStore.GetLegacyHDSeed();
+    ASSERT_TRUE(seedOut.has_value());
+    EXPECT_EQ(seed, seedOut.value());
+
+    // 3) Test adding a new seed to an already-encrypted key store
+    TestCCryptoKeyStore keyStore2;
+
+    // Add a Sprout address so the wallet has something to test when decrypting
+    ASSERT_TRUE(keyStore2.AddSproutSpendingKey(libzcash::SproutSpendingKey::random()));
+
+    ASSERT_TRUE(keyStore2.EncryptKeys(vMasterKey));
+    ASSERT_TRUE(keyStore2.Unlock(vMasterKey));
+
+    seedOut = keyStore2.GetLegacyHDSeed();
+    EXPECT_FALSE(seedOut.has_value());
+
+    auto seed3 = MnemonicSeed::Random(SLIP44_TESTNET_TYPE);
+    ASSERT_TRUE(keyStore2.SetLegacyHDSeed(seed3));
+    seedOut = keyStore2.GetLegacyHDSeed();
+    ASSERT_TRUE(seedOut.has_value());
+    EXPECT_EQ(seed3, seedOut.value());
+}
+
+TEST(KeystoreTests, StoreAndRetrieveSpendingKeyInEncryptedStore) {
+    TestCCryptoKeyStore keyStore;
+    uint256 r {GetRandHash()};
+    CKeyingMaterial vMasterKey (r.begin(), r.end());
+    libzcash::SproutSpendingKey keyOut;
+    ZCNoteDecryption decOut;
+    std::set<libzcash::SproutPaymentAddress> addrs;
+
+    // 1) Test adding a key to an unencrypted key store, then encrypting it
+    auto sk = libzcash::SproutSpendingKey::random();
+    auto addr = sk.address();
+    EXPECT_FALSE(keyStore.GetNoteDecryptor(addr, decOut));
+
+    keyStore.AddSproutSpendingKey(sk);
+    ASSERT_TRUE(keyStore.HaveSproutSpendingKey(addr));
+    ASSERT_TRUE(keyStore.GetSproutSpendingKey(addr, keyOut));
+    ASSERT_EQ(sk, keyOut);
+    EXPECT_TRUE(keyStore.GetNoteDecryptor(addr, decOut));
+    EXPECT_EQ(ZCNoteDecryption(sk.receiving_key()), decOut);
+
+    ASSERT_TRUE(keyStore.EncryptKeys(vMasterKey));
+    ASSERT_TRUE(keyStore.HaveSproutSpendingKey(addr));
+    ASSERT_FALSE(keyStore.GetSproutSpendingKey(addr, keyOut));
+    EXPECT_TRUE(keyStore.GetNoteDecryptor(addr, decOut));
+    EXPECT_EQ(ZCNoteDecryption(sk.receiving_key()), decOut);
+
+    // Unlocking with a random key should fail
+    uint256 r2 {GetRandHash()};
+    CKeyingMaterial vRandomKey (r2.begin(), r2.end());
+    EXPECT_FALSE(keyStore.Unlock(vRandomKey));
+
+    // Unlocking with a slightly-modified vMasterKey should fail
+    CKeyingMaterial vModifiedKey (r.begin(), r.end());
+    vModifiedKey[0] += 1;
+    EXPECT_FALSE(keyStore.Unlock(vModifiedKey));
+
+    // Unlocking with vMasterKey should succeed
+    ASSERT_TRUE(keyStore.Unlock(vMasterKey));
+    ASSERT_TRUE(keyStore.GetSproutSpendingKey(addr, keyOut));
+    ASSERT_EQ(sk, keyOut);
+
+    keyStore.GetSproutPaymentAddresses(addrs);
+    ASSERT_EQ(1, addrs.size());
+    ASSERT_EQ(1, addrs.count(addr));
+
+    // 2) Test adding a spending key to an already-encrypted key store
+    auto sk2 = libzcash::SproutSpendingKey::random();
+    auto addr2 = sk2.address();
+    EXPECT_FALSE(keyStore.GetNoteDecryptor(addr2, decOut));
+
+    keyStore.AddSproutSpendingKey(sk2);
+    ASSERT_TRUE(keyStore.HaveSproutSpendingKey(addr2));
+    ASSERT_TRUE(keyStore.GetSproutSpendingKey(addr2, keyOut));
+    ASSERT_EQ(sk2, keyOut);
+    EXPECT_TRUE(keyStore.GetNoteDecryptor(addr2, decOut));
+    EXPECT_EQ(ZCNoteDecryption(sk2.receiving_key()), decOut);
+
+    ASSERT_TRUE(keyStore.Lock());
+    ASSERT_TRUE(keyStore.HaveSproutSpendingKey(addr2));
+    ASSERT_FALSE(keyStore.GetSproutSpendingKey(addr2, keyOut));
+    EXPECT_TRUE(keyStore.GetNoteDecryptor(addr2, decOut));
+    EXPECT_EQ(ZCNoteDecryption(sk2.receiving_key()), decOut);
+
+    ASSERT_TRUE(keyStore.Unlock(vMasterKey));
+    ASSERT_TRUE(keyStore.GetSproutSpendingKey(addr2, keyOut));
+    ASSERT_EQ(sk2, keyOut);
+    EXPECT_TRUE(keyStore.GetNoteDecryptor(addr2, decOut));
+    EXPECT_EQ(ZCNoteDecryption(sk2.receiving_key()), decOut);
+
+    keyStore.GetSproutPaymentAddresses(addrs);
+    ASSERT_EQ(2, addrs.size());
+    ASSERT_EQ(1, addrs.count(addr));
+    ASSERT_EQ(1, addrs.count(addr2));
+}
+
+TEST(KeystoreTests, StoreAndRetrieveUFVK) {
+    SelectParams(CBaseChainParams::TESTNET);
+    CBasicKeyStore keyStore;
+
+    auto seed = MnemonicSeed::Random(SLIP44_TESTNET_TYPE);
+    auto usk = ZcashdUnifiedSpendingKey::ForAccount(seed, SLIP44_TESTNET_TYPE, 0);
+    EXPECT_TRUE(usk.has_value());
+
+    auto ufvk = usk.value().ToFullViewingKey();
+    auto zufvk = ZcashdUnifiedFullViewingKey::FromUnifiedFullViewingKey(Params(), ufvk);
+    auto ufvkid = zufvk.GetKeyID();
+    EXPECT_FALSE(keyStore.GetUnifiedFullViewingKey(ufvkid).has_value());
+
+    EXPECT_TRUE(keyStore.AddUnifiedFullViewingKey(zufvk));
+    EXPECT_EQ(keyStore.GetUnifiedFullViewingKey(ufvkid).value(), zufvk);
+
+    auto addrPair = std::get<std::pair<UnifiedAddress, diversifier_index_t>>(zufvk.FindAddress(diversifier_index_t(0), {ReceiverType::Sapling}));
+    EXPECT_TRUE(addrPair.first.GetSaplingReceiver().has_value());
+    auto saplingReceiver = addrPair.first.GetSaplingReceiver().value();
+
+    // We detect this even though we haven't added the Sapling address, because
+    // we trial-decrypt diversifiers (which also means we learn the index).
+    auto ufvkmetaUnadded = keyStore.GetUFVKMetadataForReceiver(saplingReceiver);
+    EXPECT_TRUE(ufvkmetaUnadded.has_value());
+    EXPECT_EQ(ufvkmetaUnadded.value().GetUFVKId(), ufvkid);
+    EXPECT_EQ(ufvkmetaUnadded.value().GetDiversifierIndex().value(), addrPair.second);
+
+    // Adding the Sapling addr -> ivk map entry causes us to find the same UFVK,
+    // and since we trial-decrypt with both external and internal IVKs to
+    // verify whether it's an internal address, we learn the index.
+    auto saplingIvk = zufvk.GetSaplingKey().value().ToIncomingViewingKey();
+    keyStore.AddSaplingPaymentAddress(saplingIvk, saplingReceiver);
+
+    auto ufvkmeta = keyStore.GetUFVKMetadataForReceiver(saplingReceiver);
+    EXPECT_TRUE(ufvkmeta.has_value());
+    EXPECT_EQ(ufvkmeta.value().GetUFVKId(), ufvkid);
+    EXPECT_TRUE(ufvkmeta.value().GetDiversifierIndex().has_value());
+}
+
+TEST(KeystoreTests, StoreAndRetrieveUFVKByOrchard) {
+    SelectParams(CBaseChainParams::TESTNET);
+    CBasicKeyStore keyStore;
+
+    auto seed = MnemonicSeed::Random(SLIP44_TESTNET_TYPE);
+    auto usk = ZcashdUnifiedSpendingKey::ForAccount(seed, SLIP44_TESTNET_TYPE, 0);
+    EXPECT_TRUE(usk.has_value());
+
+    auto ufvk = usk.value().ToFullViewingKey();
+    auto zufvk = ZcashdUnifiedFullViewingKey::FromUnifiedFullViewingKey(Params(), ufvk);
+    auto ufvkid = zufvk.GetKeyID();
+    EXPECT_FALSE(keyStore.GetUnifiedFullViewingKey(ufvkid).has_value());
+
+    EXPECT_TRUE(keyStore.AddUnifiedFullViewingKey(zufvk));
+    EXPECT_EQ(keyStore.GetUnifiedFullViewingKey(ufvkid).value(), zufvk);
+
+    auto addrPair = std::get<std::pair<UnifiedAddress, diversifier_index_t>>(zufvk.FindAddress(diversifier_index_t(0), {ReceiverType::Orchard}));
+    EXPECT_TRUE(addrPair.first.GetOrchardReceiver().has_value());
+    auto orchardReceiver = addrPair.first.GetOrchardReceiver().value();
+
+    // We don't store Orchard addresses in CBasicKeyStore (the addr -> ivk
+    // mapping is stored in the Rust wallet), but we still detect this because
+    // we trial-decrypt diversifiers (which also means we learn the index).
+    auto ufvkmetaUnadded = keyStore.GetUFVKMetadataForReceiver(orchardReceiver);
+    EXPECT_TRUE(ufvkmetaUnadded.has_value());
+    EXPECT_EQ(ufvkmetaUnadded.value().GetUFVKId(), ufvkid);
+    EXPECT_EQ(ufvkmetaUnadded.value().GetDiversifierIndex().value(), addrPair.second);
+}
+
+TEST(KeystoreTests, AddTransparentReceiverForUnifiedAddress) {
+    SelectParams(CBaseChainParams::TESTNET);
+    CBasicKeyStore keyStore;
+
+    auto seed = MnemonicSeed::Random(SLIP44_TESTNET_TYPE);
+    auto usk = ZcashdUnifiedSpendingKey::ForAccount(seed, SLIP44_TESTNET_TYPE, 0);
+    EXPECT_TRUE(usk.has_value());
+
+    auto ufvk = usk.value().ToFullViewingKey();
+    auto zufvk = ZcashdUnifiedFullViewingKey::FromUnifiedFullViewingKey(Params(), ufvk);
+    auto ufvkid = zufvk.GetKeyID();
+    auto addrPair = std::get<std::pair<UnifiedAddress, diversifier_index_t>>(zufvk.FindAddress(diversifier_index_t(0), {ReceiverType::P2PKH, ReceiverType::Sapling}));
+    EXPECT_TRUE(addrPair.first.GetP2PKHReceiver().has_value());
+    auto ufvkmeta = keyStore.GetUFVKMetadataForReceiver(addrPair.first.GetP2PKHReceiver().value());
+    EXPECT_FALSE(ufvkmeta.has_value());
+
+    keyStore.AddTransparentReceiverForUnifiedAddress(ufvkid, addrPair.second, addrPair.first);
+
+    ufvkmeta = keyStore.GetUFVKMetadataForReceiver(addrPair.first.GetP2PKHReceiver().value());
+    EXPECT_TRUE(ufvkmeta.has_value());
+    EXPECT_EQ(ufvkmeta.value().GetUFVKId(), ufvkid);
+}
+
+
+#endif
diff --git a/depend/zcash/src/gtest/test_libzcash_utils.cpp b/depend/zcash/src/gtest/test_libzcash_utils.cpp
new file mode 100644
index 000000000..396053b18
--- /dev/null
+++ b/depend/zcash/src/gtest/test_libzcash_utils.cpp
@@ -0,0 +1,44 @@
+#include <gtest/gtest.h>
+#include "zcash/util.h"
+
+TEST(LibzcashUtils, ConvertBytesVectorToVector)
+{
+    std::vector<unsigned char> bytes = {0x00, 0x01, 0x03, 0x12, 0xFF};
+    std::vector<bool> expected_bits = {
+        // 0x00
+        0, 0, 0, 0, 0, 0, 0, 0,
+        // 0x01
+        0, 0, 0, 0, 0, 0, 0, 1,
+        // 0x03
+        0, 0, 0, 0, 0, 0, 1, 1,
+        // 0x12
+        0, 0, 0, 1, 0, 0, 1, 0,
+        // 0xFF
+        1, 1, 1, 1, 1, 1, 1, 1
+    };
+    ASSERT_TRUE(convertBytesVectorToVector(bytes) == expected_bits);
+}
+
+TEST(LibzcashUtils, convertVectorToInt)
+{
+    ASSERT_TRUE(convertVectorToInt({0}) == 0);
+    ASSERT_TRUE(convertVectorToInt({1}) == 1);
+    ASSERT_TRUE(convertVectorToInt({0,1}) == 1);
+    ASSERT_TRUE(convertVectorToInt({1,0}) == 2);
+    ASSERT_TRUE(convertVectorToInt({1,1}) == 3);
+    ASSERT_TRUE(convertVectorToInt({1,0,0}) == 4);
+    ASSERT_TRUE(convertVectorToInt({1,0,1}) == 5);
+    ASSERT_TRUE(convertVectorToInt({1,1,0}) == 6);
+
+    ASSERT_THROW(convertVectorToInt(std::vector<bool>(100)), std::length_error);
+
+    {
+        std::vector<bool> v(63, 1);
+        ASSERT_TRUE(convertVectorToInt(v) == 0x7fffffffffffffff);
+    }
+
+    {
+        std::vector<bool> v(64, 1);
+        ASSERT_TRUE(convertVectorToInt(v) == 0xffffffffffffffff);
+    }
+}
diff --git a/depend/zcash/src/gtest/test_mempool.cpp b/depend/zcash/src/gtest/test_mempool.cpp
new file mode 100644
index 000000000..19067b378
--- /dev/null
+++ b/depend/zcash/src/gtest/test_mempool.cpp
@@ -0,0 +1,272 @@
+#include <gtest/gtest.h>
+#include <gtest/gtest-spi.h>
+
+#include "consensus/upgrades.h"
+#include "consensus/validation.h"
+#include "core_io.h"
+#include "main.h"
+#include "primitives/transaction.h"
+#include "txmempool.h"
+#include "policy/fees.h"
+#include "util.h"
+
+// Implementation is in test_checktransaction.cpp
+extern CMutableTransaction GetValidTransaction(uint32_t consensusBranchId=SPROUT_BRANCH_ID);
+
+// Fake the input of transaction 5295156213414ed77f6e538e7e8ebe14492156906b9fe995b242477818789364
+// - 532639cc6bebed47c1c69ae36dd498c68a012e74ad12729adbd3dbb56f8f3f4a, 0
+class FakeCoinsViewDB : public CCoinsView {
+public:
+    FakeCoinsViewDB() {}
+
+    bool GetSproutAnchorAt(const uint256 &rt, SproutMerkleTree &tree) const {
+        return false;
+    }
+
+    bool GetSaplingAnchorAt(const uint256 &rt, SaplingMerkleTree &tree) const {
+        return false;
+    }
+
+    bool GetNullifier(const uint256 &nf, ShieldedType type) const {
+        return false;
+    }
+
+    bool GetCoins(const uint256 &txid, CCoins &coins) const {
+        CTxOut txOut;
+        txOut.nValue = 4288035;
+        CCoins newCoins;
+        newCoins.vout.resize(2);
+        newCoins.vout[0] = txOut;
+        newCoins.nHeight = 92045;
+        coins.swap(newCoins);
+        return true;
+    }
+
+    bool HaveCoins(const uint256 &txid) const {
+        return true;
+    }
+
+    uint256 GetBestBlock() const {
+        uint256 a;
+        return a;
+    }
+
+    uint256 GetBestAnchor(ShieldedType type) const {
+        uint256 a;
+        return a;
+    }
+
+    bool BatchWrite(CCoinsMap &mapCoins,
+                    const uint256 &hashBlock,
+                    const uint256 &hashSproutAnchor,
+                    const uint256 &hashSaplingAnchor,
+                    CAnchorsSproutMap &mapSproutAnchors,
+                    CAnchorsSaplingMap &mapSaplingAnchors,
+                    CNullifiersMap &mapSproutNullifiers,
+                    CNullifiersMap &mapSaplingNullifiers) {
+        return false;
+    }
+
+    bool GetStats(CCoinsStats &stats) const {
+        return false;
+    }
+};
+
+TEST(Mempool, PriorityStatsDoNotCrash) {
+    // Test for security issue 2017-04-11.a
+    // https://z.cash/blog/security-announcement-2017-04-12.html
+
+    // Trigger transaction in block 92046
+    std::string triggerTx = "02000000014a3f8f6fb5dbd3db9a7212ad742e018ac698d46de39ac6c147edeb6bcc392653000000006b483045022100da0514afd80d3bbd0743458efe3b2abd18f727b4268b124c3885094c26ea09cd02207d37d7934ec90618fc5a345cb2a6d1755d8b1a432ea1df517a85e36628449196012103e9b41072e9d2cbe04e6b22a6ac4862ec3f5a76b3823b071ded0dfd5455a0803fffffffff000000000001236e4100000000000000000000000000cf592f6776810cf9fb961d80e683f5529a6b34894b00446c396022512a02dc2e96918294bffdc988a2627d9b12a9f3176b671e286fc62e3c7441cf35ea5e03d561bd5817ca5827cb2761f88dde280a6da5281af2cc69053816f31abd2170722f72c258c7c6b865c97ff8ae53b697f3b77c239a73e1d0296c2c73d21c3b50059d82866cf9f6e2f5dbbf9b4de9caa3cf836080373311978e1f1b1150ce564336ebf0fd502c2e783ff23252fba4efbb110c28c4fbe31efb6a67bc24c0ad8fd8346c5c9ed1791b555b3e43a309aa8d855a294847368ebdf30365d4dfa9b25dd8ed7adf272ecc08f4756fb9d93b8e20d45548dd4aeab6abb76a2081b6e36a9af9d38ebae378df422f40589769c07a3c12e5da253330314cbc4beaa863fac7ab10055d0310089a44c45179a39b2c4e210cec2e053f54983d744abed49f66959f45785ea90325a310fba15f946e245a0e64caec303f2a3e1d457e3e3ca5d892956c1a93b05e0b0373cf862d7bbb5908148b475c03eec96c9b9ecc7d2d78716d2c2e8ccf96175b25738dfb5b0d356a7e30604ee014c6be1db5e43af0fa6ad3f4e917a9f84b4d6f030cad0ffe0738e1effe570b0552b407ca9c26023b74b99f431cc28b79116f717703158404e343b1b47a0556f593441dc64758930f19e84d5ee468fd9a7958c6c63503054f60680f7147e88bf6da65415450230ef7437481023fc5d94872d5aa18bf3b0212b4c0d938e6c84debb8a4e65f99970c59193873a72b2440f19a652073abd960021bfef4e1e52b8f353c6e517bb97053afd4c8035defc27c3fd16faba5bc924a4179f69cfdcdb82253b5f6472a99d4b78ad2c6c18c45ed4dda5bf2adc019c99b55702f4e7b3fcaeb6f3b84ad411d36e901cba9d49ac1d6b916aa88794fb23501aeb0c585cbc2bed952846f41a03bd5c74dfe004e7ac21f7a20d32b009ccf6f70b3e577d25c679421225522b6290d5fa00a5d9a02b97a62aab60e040a03efa946d87c5e65dbf10d66df5b0834c262c31c23f3c2643451e614695003fb3a95bf21444bebb45cdcb8169245e34a76f754c89c3a90f36598a71ef4645eef4c82f1fb322536097fcf0cbe061e80ae887dbb88d8ed910be9ef18b8794930addab1a140b16c4b50f93926b1e5df03ee6e4b5ec6d7f0ed49fbbae50330ae94c5ae9182f4b58870022e423e7d80adccdb90680f7a7fe11a4ed4fe005a0af2d22bf9e7d1bef7caf4f37f5777e4aa6c9b9ea44f5973575c20fb3482fe357c19fc0c20594f492f5694e3e8eb3599e968fd23b5bdd6c4bf5aee1374b38aafe59dd5af83011e642a9427b5ff03e7a4cce92ee201a0fac0acb69d6ad3b7e4c26dfefaa53a737889e759c4b5695c1a7fd5d988e531acf66dae5067f252a25a102d92916b2d84c730645e15a78d3dce1c787634f6f7323cb949a5b6ad004e208cb8c6b734761629c13b9974dc80b082f83357f3bc703d835acbbf72aba225ffe69396c151d2646fac9bd1acc184dd047ebfaadc6b60a9185ce80c7bc8ac5dbb2219cbc0d35af91673b95d28335f0ee2774b8084871d54ca8eab3a285e4b4adf3f34b4263d67474bb5de2e1e37aa7a4ecbd5b49575caaa9e7208c2b9871946b11f2c54cd1ca7660dff44cf206e7da46ab57dd49ec0aa06ded7980f1557cc7c84023690b4df77f26d6b4eff7553b9a8628c28e8e5c38c6170bc61af0969b072586fa740f68ab33c0f62d0507cc8fe41c680b2f077e49cc2691048006311b46cd5ed18e63089f11c115b797ed5fbcd86836a4da2ab90a00745077f2f13bc9e390fc2f92b941d4fb70a3f098548953566141670317fc17e0ba81e98b8a94919992fb008c5480f4018f3a1ea673fe94a6ba3363656a944855d7c799ccb73d95d4ed6ce04c26f79c4cf79f883f0f810519f28eabe8cf6d833f24227f5074763c7b80f1431e5463cc07eff2f1d6cbfaf0411d38e62528a39b093ed7b51fa8c1008e5c1ce4bf39e67b1703554cefef44b71457bfddf43d23a54fa0145fa0e716d02a5304d85345a2b4ebf98c5010d0df468c8cbfc2db22083b0f5a74d4324ee74b46daa5ab70f2575ef5390e6aa2acb8d3b3eb2065e8c06fd6276aca283f5850e7a8b4da37455430df55621e4af59bb355ba2db0ac6cae6ceed2f538ec8c928ee895bd190fd9c1dff4956bad27d567023bc847dd64d83bac399f8d10248a077c9b2f50d5dda4789e09eae4ed8609da085b6370f6529f3c7b8b13442f9a1cc93565734a81c38c6360235ba23ddf87d1b44413c24b363552a322b01d88d1cae6c5ccd88f8cef15776035934fd24adce913282983d9b55181b382ed61242fb4a5e459c3cad8d38626ef8ccdccb9899d5962dec3f3cc2422f109d902e764186cf166ed88c383f428f195dd5fec4f781bcd2308dec66927f41c9e06369c6806ed8ec9a59c096b29b2a74dc85f4f7cd77a23650c0662b5c2602ef5e41cdc13d16074500aac461f823e3bba7178bcffa000db4ffc9b1618395824ffbee1cad1d9c138a20e0b8bbea2d9a07fade932f81c3daf2d64c4991daf4a1b8b531f9b958a252c6c38cd463342aef3e03e3dae3370581d6cddf5af3ef1585780cf83db1909a1daca156018cd2f7483e53a5fccda49640de60b24523617c7ae84ec5fa987ba8a108";
+    CTransaction tx;
+    ASSERT_TRUE(DecodeHexTx(tx, triggerTx));
+    ASSERT_EQ(tx.GetHash().GetHex(), "5295156213414ed77f6e538e7e8ebe14492156906b9fe995b242477818789364");
+
+    // Fake its inputs
+    FakeCoinsViewDB fakeDB;
+    CCoinsViewCache view(&fakeDB);
+
+    CTxMemPool testPool(CFeeRate(0));
+
+    // Values taken from core dump (parameters of entry)
+    CAmount nFees = 0;
+    int64_t nTime = 0x58e5fed9;
+    unsigned int nHeight = 92045;
+    double dPriority = view.GetPriority(tx, nHeight);
+
+    CTxMemPoolEntry entry(tx, nFees, nTime, dPriority, nHeight, true, false, 0, SPROUT_BRANCH_ID);
+
+    // Check it does not crash (ie. the death test fails)
+    EXPECT_NONFATAL_FAILURE(EXPECT_DEATH(testPool.addUnchecked(tx.GetHash(), entry), ""), "");
+
+    EXPECT_EQ(dPriority, MAX_PRIORITY);
+}
+
+// Valid overwinter v3 format tx gets rejected because overwinter hasn't activated yet.
+TEST(Mempool, OverwinterNotActiveYet) {
+    SelectParams(CBaseChainParams::REGTEST);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+
+    CTxMemPool pool(::minRelayTxFee);
+    bool missingInputs;
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vJoinSplit.resize(0); // no joinsplits
+    mtx.fOverwintered = true;
+    mtx.nVersion = OVERWINTER_TX_VERSION;
+    mtx.nVersionGroupId = OVERWINTER_VERSION_GROUP_ID;
+    mtx.nExpiryHeight = 0;
+    CValidationState state1;
+
+    CTransaction tx1(mtx);
+    LOCK(cs_main);
+    EXPECT_FALSE(AcceptToMemoryPool(Params(), pool, state1, tx1, false, &missingInputs));
+    EXPECT_EQ(state1.GetRejectReason(), "tx-overwinter-not-active");
+
+    // Revert to default
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+}
+
+
+// Sprout transaction version 3 when Overwinter is not active:
+// 1. pass CheckTransaction (and CheckTransactionWithoutProofVerification)
+// 2. pass ContextualCheckTransaction
+// 3. fail IsStandardTx
+TEST(Mempool, SproutV3TxFailsAsExpected) {
+    SelectParams(CBaseChainParams::TESTNET);
+
+    CTxMemPool pool(::minRelayTxFee);
+    bool missingInputs;
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vJoinSplit.resize(0); // no joinsplits
+    mtx.fOverwintered = false;
+    mtx.nVersion = 3;
+    CValidationState state1;
+    CTransaction tx1(mtx);
+
+    LOCK(cs_main);
+    EXPECT_FALSE(AcceptToMemoryPool(Params(), pool, state1, tx1, false, &missingInputs));
+    EXPECT_EQ(state1.GetRejectReason(), "version");
+}
+
+
+// Sprout transaction version 3 when Overwinter is always active:
+// 1. pass CheckTransaction (and CheckTransactionWithoutProofVerification)
+// 2. fails ContextualCheckTransaction
+TEST(Mempool, SproutV3TxWhenOverwinterActive) {
+    SelectParams(CBaseChainParams::REGTEST);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+
+    CTxMemPool pool(::minRelayTxFee);
+    bool missingInputs;
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vJoinSplit.resize(0); // no joinsplits
+    mtx.fOverwintered = false;
+    mtx.nVersion = 3;
+    CValidationState state1;
+    CTransaction tx1(mtx);
+
+    LOCK(cs_main);
+
+    EXPECT_FALSE(AcceptToMemoryPool(Params(), pool, state1, tx1, false, &missingInputs));
+    EXPECT_EQ(state1.GetRejectReason(), "tx-overwintered-flag-not-set");
+
+    // Revert to default
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+}
+
+
+// Subclass of CTransaction which doesn't call UpdateHash when constructing
+// from a CMutableTransaction.  This enables us to create a CTransaction
+// with bad values which normally trigger an exception during construction.
+class UNSAFE_CTransaction : public CTransaction {
+    public:
+        UNSAFE_CTransaction(const CMutableTransaction &tx) : CTransaction(tx, true) {}
+};
+
+// Sprout transaction with negative version, rejected by the mempool in CheckTransaction
+// under Sprout consensus rules, should still be rejected under Overwinter consensus rules.
+// 1. fails CheckTransaction (specifically CheckTransactionWithoutProofVerification)
+TEST(Mempool, SproutNegativeVersionTxWhenOverwinterActive) {
+    SelectParams(CBaseChainParams::REGTEST);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+
+    CTxMemPool pool(::minRelayTxFee);
+    bool missingInputs;
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vJoinSplit.resize(0); // no joinsplits
+    mtx.fOverwintered = false;
+
+    // A Sprout transaction with version -3 is created using Sprout code (as found in zcashd <= 1.0.14).
+    // First four bytes of transaction, parsed as an uint32_t, has the value: 0xfffffffd
+    // This test simulates an Overwinter node receiving this transaction, but incorrectly deserializing the
+    // transaction due to a (pretend) bug of not detecting the most significant bit, which leads
+    // to not setting fOverwintered and not masking off the most significant bit of the header field.
+    // The resulting Sprout tx with nVersion -3 should be rejected by the Overwinter node's mempool.
+    {
+        mtx.nVersion = -3;
+        EXPECT_EQ(mtx.nVersion, static_cast<int32_t>(0xfffffffd));
+
+        EXPECT_THROW((CTransaction(mtx)), std::ios_base::failure);
+        UNSAFE_CTransaction tx1(mtx);
+        EXPECT_EQ(tx1.nVersion, -3);
+
+        CValidationState state1;
+        LOCK(cs_main);
+        EXPECT_FALSE(AcceptToMemoryPool(Params(), pool, state1, tx1, false, &missingInputs));
+        EXPECT_EQ(state1.GetRejectReason(), "bad-txns-version-too-low");
+    }
+
+    // A Sprout transaction with version -3 created using Overwinter code (as found in zcashd >= 1.0.15).
+    // First four bytes of transaction, parsed as an uint32_t, has the value: 0x80000003
+    // This test simulates the same pretend bug described above.
+    // The resulting Sprout tx with nVersion -2147483645 should be rejected by the Overwinter node's mempool.
+    {
+        mtx.nVersion = static_cast<int32_t>((1 << 31) | 3);
+        EXPECT_EQ(mtx.nVersion, static_cast<int32_t>(0x80000003));
+
+        EXPECT_THROW((CTransaction(mtx)), std::ios_base::failure);
+        UNSAFE_CTransaction tx1(mtx);
+        EXPECT_EQ(tx1.nVersion, -2147483645);
+
+        CValidationState state1;
+        LOCK(cs_main);
+        EXPECT_FALSE(AcceptToMemoryPool(Params(), pool, state1, tx1, false, &missingInputs));
+        EXPECT_EQ(state1.GetRejectReason(), "bad-txns-version-too-low");
+    }
+
+    // Revert to default
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+}
+
+
+TEST(Mempool, ExpiringSoonTxRejection) {
+    SelectParams(CBaseChainParams::REGTEST);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+
+    CTxMemPool pool(::minRelayTxFee);
+    bool missingInputs;
+    CMutableTransaction mtx = GetValidTransaction();
+    mtx.vJoinSplit.resize(0); // no joinsplits
+    mtx.fOverwintered = true;
+    mtx.nVersion = OVERWINTER_TX_VERSION;
+    mtx.nVersionGroupId = OVERWINTER_VERSION_GROUP_ID;
+
+    // The next block height is 0 since there is no active chain and current height is -1.
+    // Given an expiring soon threshold of 3 blocks, a tx is considered to be expiring soon
+    // if the tx expiry height is set to 0, 1 or 2.  However, at the consensus level,
+    // expiry height is ignored when set to 0, therefore we start testing from 1.
+    for (int i = 1; i < TX_EXPIRING_SOON_THRESHOLD; i++)
+    {
+        mtx.nExpiryHeight = i;
+
+        CValidationState state1;
+        CTransaction tx1(mtx);
+
+        LOCK(cs_main);
+        EXPECT_FALSE(AcceptToMemoryPool(Params(), pool, state1, tx1, false, &missingInputs));
+        EXPECT_EQ(state1.GetRejectReason(), "tx-expiring-soon");
+    }
+
+    // Revert to default
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+}
diff --git a/depend/zcash/src/gtest/test_mempoollimit.cpp b/depend/zcash/src/gtest/test_mempoollimit.cpp
new file mode 100644
index 000000000..51281348b
--- /dev/null
+++ b/depend/zcash/src/gtest/test_mempoollimit.cpp
@@ -0,0 +1,166 @@
+// Copyright (c) 2019 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include <gtest/gtest.h>
+#include <iostream>
+
+#include "arith_uint256.h"
+#include "mempool_limit.h"
+#include "gtest/utils.h"
+#include "utiltime.h"
+#include "utiltest.h"
+#include "transaction_builder.h"
+
+
+const uint256 TX_ID1 = ArithToUint256(1);
+const uint256 TX_ID2 = ArithToUint256(2);
+const uint256 TX_ID3 = ArithToUint256(3);
+
+TEST(MempoolLimitTests, RecentlyEvictedListAddWrapsAfterMaxSize)
+{
+    RecentlyEvictedList recentlyEvicted(2, 100);
+    SetMockTime(1);
+    recentlyEvicted.add(TX_ID1);
+    recentlyEvicted.add(TX_ID2);
+    recentlyEvicted.add(TX_ID3);
+    // tx 1 should be overwritten by tx 3 due to maxSize 2
+    EXPECT_FALSE(recentlyEvicted.contains(TX_ID1));
+    EXPECT_TRUE(recentlyEvicted.contains(TX_ID2));
+    EXPECT_TRUE(recentlyEvicted.contains(TX_ID3));
+}
+
+TEST(MempoolLimitTests, RecentlyEvictedListDoesNotContainAfterExpiry)
+{
+    SetMockTime(1);
+    // maxSize=3, timeToKeep=1
+    RecentlyEvictedList recentlyEvicted(3, 1);
+    recentlyEvicted.add(TX_ID1);
+    SetMockTime(2);
+    recentlyEvicted.add(TX_ID2);
+    recentlyEvicted.add(TX_ID3);
+    // After 1 second the txId will still be there
+    EXPECT_TRUE(recentlyEvicted.contains(TX_ID1));
+    EXPECT_TRUE(recentlyEvicted.contains(TX_ID2));
+    EXPECT_TRUE(recentlyEvicted.contains(TX_ID3));
+    SetMockTime(3);
+    // After 2 seconds it is gone
+    EXPECT_FALSE(recentlyEvicted.contains(TX_ID1));
+    EXPECT_TRUE(recentlyEvicted.contains(TX_ID2));
+    EXPECT_TRUE(recentlyEvicted.contains(TX_ID3));
+    SetMockTime(4);
+    EXPECT_FALSE(recentlyEvicted.contains(TX_ID1));
+    EXPECT_FALSE(recentlyEvicted.contains(TX_ID2));
+    EXPECT_FALSE(recentlyEvicted.contains(TX_ID3));
+}
+
+TEST(MempoolLimitTests, RecentlyEvictedDropOneAtATime)
+{
+    SetMockTime(1);
+    RecentlyEvictedList recentlyEvicted(3, 2);
+    recentlyEvicted.add(TX_ID1);
+    SetMockTime(2);
+    recentlyEvicted.add(TX_ID2);
+    SetMockTime(3);
+    recentlyEvicted.add(TX_ID3);
+    EXPECT_TRUE(recentlyEvicted.contains(TX_ID1));
+    EXPECT_TRUE(recentlyEvicted.contains(TX_ID2));
+    EXPECT_TRUE(recentlyEvicted.contains(TX_ID3));
+    SetMockTime(4);
+    EXPECT_FALSE(recentlyEvicted.contains(TX_ID1));
+    EXPECT_TRUE(recentlyEvicted.contains(TX_ID2));
+    EXPECT_TRUE(recentlyEvicted.contains(TX_ID3));
+    SetMockTime(5);
+    EXPECT_FALSE(recentlyEvicted.contains(TX_ID1));
+    EXPECT_FALSE(recentlyEvicted.contains(TX_ID2));
+    EXPECT_TRUE(recentlyEvicted.contains(TX_ID3));
+    SetMockTime(6);
+    EXPECT_FALSE(recentlyEvicted.contains(TX_ID1));
+    EXPECT_FALSE(recentlyEvicted.contains(TX_ID2));
+    EXPECT_FALSE(recentlyEvicted.contains(TX_ID3));
+}
+
+TEST(MempoolLimitTests, WeightedTxTreeCheckSizeAfterDropping)
+{
+    std::set<uint256> testedDropping;
+    // Run the test until we have tested dropping each of the elements
+    int trialNum = 0;
+    while (testedDropping.size() < 3) {
+        WeightedTxTree tree(MIN_TX_COST * 2);
+        EXPECT_EQ(0, tree.getTotalWeight().cost);
+        EXPECT_EQ(0, tree.getTotalWeight().evictionWeight);
+        tree.add(WeightedTxInfo(TX_ID1, TxWeight(MIN_TX_COST, MIN_TX_COST)));
+        EXPECT_EQ(4000, tree.getTotalWeight().cost);
+        EXPECT_EQ(4000, tree.getTotalWeight().evictionWeight);
+        tree.add(WeightedTxInfo(TX_ID2, TxWeight(MIN_TX_COST, MIN_TX_COST)));
+        EXPECT_EQ(8000, tree.getTotalWeight().cost);
+        EXPECT_EQ(8000, tree.getTotalWeight().evictionWeight);
+        EXPECT_FALSE(tree.maybeDropRandom().has_value());
+        tree.add(WeightedTxInfo(TX_ID3, TxWeight(MIN_TX_COST, MIN_TX_COST + LOW_FEE_PENALTY)));
+        EXPECT_EQ(12000, tree.getTotalWeight().cost);
+        EXPECT_EQ(12000 + LOW_FEE_PENALTY, tree.getTotalWeight().evictionWeight);
+        std::optional<uint256> drop = tree.maybeDropRandom();
+        ASSERT_TRUE(drop.has_value());
+        uint256 txid = drop.value();
+        testedDropping.insert(txid);
+        // Do not continue to test if a particular trial fails
+        ASSERT_EQ(8000, tree.getTotalWeight().cost);
+        ASSERT_EQ(txid == TX_ID3 ? 8000 : 8000 + LOW_FEE_PENALTY, tree.getTotalWeight().evictionWeight);
+    }
+}
+
+TEST(MempoolLimitTests, WeightedTxInfoFromTx)
+{
+    LoadProofParameters();
+
+    // The transaction creation is based on the test:
+    // test_transaction_builder.cpp/TEST(TransactionBuilder, SetFee)
+    auto consensusParams = RegtestActivateSapling();
+
+    auto sk = libzcash::SaplingSpendingKey::random();
+    auto testNote = GetTestSaplingNote(sk.default_address(), 50000);
+
+    // Default fee
+    {
+        auto builder = TransactionBuilder(consensusParams, 1, std::nullopt);
+        builder.AddSaplingSpend(sk.expanded_spending_key(), testNote.note, testNote.tree.root(), testNote.tree.witness());
+        builder.AddSaplingOutput(sk.full_viewing_key().ovk, sk.default_address(), 25000, {});
+
+        WeightedTxInfo info = WeightedTxInfo::from(builder.Build().GetTxOrThrow(), DEFAULT_FEE);
+        EXPECT_EQ(MIN_TX_COST, info.txWeight.cost);
+        EXPECT_EQ(MIN_TX_COST, info.txWeight.evictionWeight);
+    }
+
+    // Lower than standard fee
+    {
+        auto builder = TransactionBuilder(consensusParams, 1, std::nullopt);
+        builder.AddSaplingSpend(sk.expanded_spending_key(), testNote.note, testNote.tree.root(), testNote.tree.witness());
+        builder.AddSaplingOutput(sk.full_viewing_key().ovk, sk.default_address(), 25000, {});
+        static_assert(DEFAULT_FEE == 1000);
+        builder.SetFee(DEFAULT_FEE-1);
+
+        WeightedTxInfo info = WeightedTxInfo::from(builder.Build().GetTxOrThrow(), DEFAULT_FEE-1);
+        EXPECT_EQ(MIN_TX_COST, info.txWeight.cost);
+        EXPECT_EQ(MIN_TX_COST + LOW_FEE_PENALTY, info.txWeight.evictionWeight);
+    }
+
+    // Larger Tx
+    {
+        auto builder = TransactionBuilder(consensusParams, 1, std::nullopt);
+        builder.AddSaplingSpend(sk.expanded_spending_key(), testNote.note, testNote.tree.root(), testNote.tree.witness());
+        builder.AddSaplingOutput(sk.full_viewing_key().ovk, sk.default_address(), 5000, {});
+        builder.AddSaplingOutput(sk.full_viewing_key().ovk, sk.default_address(), 5000, {});
+        builder.AddSaplingOutput(sk.full_viewing_key().ovk, sk.default_address(), 5000, {});
+        builder.AddSaplingOutput(sk.full_viewing_key().ovk, sk.default_address(), 5000, {});
+
+        auto result = builder.Build();
+        if (result.IsError()) {
+            std::cerr << result.GetError() << std::endl;
+        }
+        WeightedTxInfo info = WeightedTxInfo::from(result.GetTxOrThrow(), DEFAULT_FEE);
+        EXPECT_EQ(5168, info.txWeight.cost);
+        EXPECT_EQ(5168, info.txWeight.evictionWeight);
+    }
+
+    RegtestDeactivateSapling();
+}
diff --git a/depend/zcash/src/gtest/test_merkletree.cpp b/depend/zcash/src/gtest/test_merkletree.cpp
new file mode 100644
index 000000000..1898d8c0f
--- /dev/null
+++ b/depend/zcash/src/gtest/test_merkletree.cpp
@@ -0,0 +1,324 @@
+#include <gtest/gtest.h>
+
+#include "test/data/merkle_roots.json.h"
+#include "test/data/merkle_serialization.json.h"
+#include "test/data/merkle_witness_serialization.json.h"
+#include "test/data/merkle_path.json.h"
+#include "test/data/merkle_commitments.json.h"
+#include "test/data/merkle_roots_orchard.h"
+
+#include "test/data/merkle_roots_sapling.json.h"
+#include "test/data/merkle_serialization_sapling.json.h"
+#include "test/data/merkle_witness_serialization_sapling.json.h"
+#include "test/data/merkle_path_sapling.json.h"
+#include "test/data/merkle_commitments_sapling.json.h"
+
+#include <iostream>
+
+#include <stdexcept>
+
+#include "utilstrencodings.h"
+#include "version.h"
+#include "serialize.h"
+#include "streams.h"
+
+#include "zcash/IncrementalMerkleTree.hpp"
+#include "zcash/util.h"
+
+
+#include "json_test_vectors.h"
+
+using namespace std;
+
+template<>
+void expect_deser_same(const SproutTestingWitness& expected)
+{
+    // Cannot check this; IncrementalWitness cannot be
+    // deserialized because it can only be constructed by
+    // IncrementalMerkleTree, and it does not yet have a
+    // canonical serialized representation.
+}
+
+template<typename A, typename B, typename C>
+void expect_ser_test_vector(B& b, const C& c, const A& tree) {
+    expect_test_vector<B, C>(b, c);
+}
+
+template<typename Tree, typename Witness>
+void test_tree(
+    UniValue commitment_tests,
+    UniValue root_tests,
+    UniValue ser_tests,
+    UniValue witness_ser_tests,
+    UniValue path_tests
+)
+{
+    size_t witness_ser_i = 0;
+    size_t path_i = 0;
+
+    Tree tree;
+
+    // The root of the tree at this point is expected to be the root of the
+    // empty tree.
+    ASSERT_TRUE(tree.root() == Tree::empty_root());
+
+    // The tree doesn't have a 'last' element added since it's blank.
+    ASSERT_THROW(tree.last(), std::runtime_error);
+
+    // The tree is empty.
+    ASSERT_TRUE(tree.size() == 0);
+
+    // We need to witness at every single point in the tree, so
+    // that the consistency of the tree and the merkle paths can
+    // be checked.
+    vector<Witness> witnesses;
+
+    for (size_t i = 0; i < 16; i++) {
+        uint256 test_commitment = uint256S(commitment_tests[i].get_str());
+
+        // Witness here
+        witnesses.push_back(tree.witness());
+
+        // Now append a commitment to the tree
+        tree.append(test_commitment);
+
+        // Size incremented by one.
+        ASSERT_TRUE(tree.size() == i+1);
+
+        // Last element added to the tree was `test_commitment`
+        ASSERT_TRUE(tree.last() == test_commitment);
+
+        // Check tree root consistency
+        expect_test_vector(root_tests[i], tree.root());
+
+        // Check serialization of tree
+        expect_ser_test_vector(ser_tests[i], tree, tree);
+
+        bool first = true; // The first witness can never form a path
+        for (Witness& wit : witnesses)
+        {
+            // Append the same commitment to all the witnesses
+            wit.append(test_commitment);
+
+            if (first) {
+                ASSERT_THROW(wit.path(), std::runtime_error);
+                ASSERT_THROW(wit.element(), std::runtime_error);
+            } else {
+                auto path = wit.path();
+                expect_test_vector(path_tests[path_i++], path);
+            }
+
+            // Check witness serialization
+            expect_ser_test_vector(witness_ser_tests[witness_ser_i++], wit, tree);
+
+            ASSERT_TRUE(wit.root() == tree.root());
+
+            first = false;
+        }
+    }
+
+    {
+        // Tree should be full now
+        ASSERT_THROW(tree.append(uint256()), std::runtime_error);
+
+        for (Witness& wit : witnesses)
+        {
+            ASSERT_THROW(wit.append(uint256()), std::runtime_error);
+        }
+    }
+}
+
+#define MAKE_STRING(x) std::string((x), (x)+sizeof(x))
+
+TEST(merkletree, vectors) {
+    UniValue root_tests = read_json(MAKE_STRING(json_tests::merkle_roots));
+    UniValue ser_tests = read_json(MAKE_STRING(json_tests::merkle_serialization));
+    UniValue witness_ser_tests = read_json(MAKE_STRING(json_tests::merkle_witness_serialization));
+    UniValue path_tests = read_json(MAKE_STRING(json_tests::merkle_path));
+    UniValue commitment_tests = read_json(MAKE_STRING(json_tests::merkle_commitments));
+
+    test_tree<SproutTestingMerkleTree, SproutTestingWitness>(
+        commitment_tests,
+        root_tests,
+        ser_tests,
+        witness_ser_tests,
+        path_tests
+    );
+}
+
+TEST(merkletree, SaplingVectors) {
+    UniValue root_tests = read_json(MAKE_STRING(json_tests::merkle_roots_sapling));
+    UniValue ser_tests = read_json(MAKE_STRING(json_tests::merkle_serialization_sapling));
+    UniValue witness_ser_tests = read_json(MAKE_STRING(json_tests::merkle_witness_serialization_sapling));
+    UniValue path_tests = read_json(MAKE_STRING(json_tests::merkle_path_sapling));
+    UniValue commitment_tests = read_json(MAKE_STRING(json_tests::merkle_commitments_sapling));
+
+    test_tree<SaplingTestingMerkleTree, SaplingTestingWitness>(
+        commitment_tests,
+        root_tests,
+        ser_tests,
+        witness_ser_tests,
+        path_tests
+    );
+}
+
+TEST(merkletree, emptyroots) {
+    libzcash::EmptyMerkleRoots<64, libzcash::SHA256Compress> emptyroots;
+    std::array<libzcash::SHA256Compress, 65> computed;
+
+    computed.at(0) = libzcash::SHA256Compress::uncommitted();
+    ASSERT_TRUE(emptyroots.empty_root(0) == computed.at(0));
+    for (size_t d = 1; d <= 64; d++) {
+        computed.at(d) = libzcash::SHA256Compress::combine(computed.at(d-1), computed.at(d-1), d-1);
+        ASSERT_TRUE(emptyroots.empty_root(d) == computed.at(d));
+    }
+
+    // Double check that we're testing (at least) all the empty roots we'll use.
+    ASSERT_TRUE(INCREMENTAL_MERKLE_TREE_DEPTH <= 64);
+}
+
+TEST(merkletree, EmptyrootsSapling) {
+    libzcash::EmptyMerkleRoots<62, libzcash::PedersenHash> emptyroots;
+    std::array<libzcash::PedersenHash, 63> computed;
+
+    computed.at(0) = libzcash::PedersenHash::uncommitted();
+    ASSERT_TRUE(emptyroots.empty_root(0) == computed.at(0));
+    for (size_t d = 1; d <= 62; d++) {
+        computed.at(d) = libzcash::PedersenHash::combine(computed.at(d-1), computed.at(d-1), d-1);
+        ASSERT_TRUE(emptyroots.empty_root(d) == computed.at(d));
+    }
+
+    // Double check that we're testing (at least) all the empty roots we'll use.
+    ASSERT_TRUE(INCREMENTAL_MERKLE_TREE_DEPTH <= 62);
+}
+
+TEST(merkletree, emptyroot) {
+    // This literal is the depth-29 empty tree root with the bytes reversed to
+    // account for the fact that uint256S() loads a big-endian representation of
+    // an integer which converted to little-endian internally.
+    uint256 expected = uint256S("59d2cde5e65c1414c32ba54f0fe4bdb3d67618125286e6a191317917c812c6d7");
+
+    ASSERT_TRUE(SproutMerkleTree::empty_root() == expected);
+}
+
+TEST(merkletree, EmptyrootSapling) {
+    // This literal is the depth-32 empty tree root with the bytes reversed to
+    // account for the fact that uint256S() loads a big-endian representation of
+    // an integer which converted to little-endian internally.
+    uint256 expected = uint256S("3e49b5f954aa9d3545bc6c37744661eea48d7c34e3000d82b7f0010c30f4c2fb");
+
+    ASSERT_TRUE(SaplingMerkleTree::empty_root() == expected);
+}
+
+TEST(merkletree, deserializeInvalid) {
+    // attempt to deserialize a small tree from a serialized large tree
+    // (exceeds depth well-formedness check)
+    SproutMerkleTree newTree;
+
+    for (size_t i = 0; i < 16; i++) {
+        newTree.append(uint256S("54d626e08c1c802b305dad30b7e54a82f102390cc92c7d4db112048935236e9c"));
+    }
+
+    newTree.append(uint256S("54d626e08c1c802b305dad30b7e54a82f102390cc92c7d4db112048935236e9c"));
+
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << newTree;
+
+    SproutTestingMerkleTree newTreeSmall;
+    ASSERT_THROW({ss >> newTreeSmall;}, std::ios_base::failure);
+}
+
+TEST(merkletree, deserializeInvalid2) {
+    // the most ancestral parent is empty
+    CDataStream ss(
+        ParseHex("0155b852781b9995a44c939b64e441ae2724b96f99c8f4fb9a141cfc9842c4b0e3000100"),
+        SER_NETWORK,
+        PROTOCOL_VERSION
+    );
+
+    SproutMerkleTree tree;
+    ASSERT_THROW(ss >> tree, std::ios_base::failure);
+}
+
+TEST(merkletree, deserializeInvalid3) {
+    // left doesn't exist but right does
+    CDataStream ss(
+        ParseHex("000155b852781b9995a44c939b64e441ae2724b96f99c8f4fb9a141cfc9842c4b0e300"),
+        SER_NETWORK,
+        PROTOCOL_VERSION
+    );
+
+    SproutMerkleTree tree;
+    ASSERT_THROW(ss >> tree, std::ios_base::failure);
+}
+
+TEST(merkletree, deserializeInvalid4) {
+    // left doesn't exist but a parent does
+    CDataStream ss(
+        ParseHex("000001018695873d63ec0bceeadb5bf4ccc6723ac803c1826fc7cfb34fc76180305ae27d"),
+        SER_NETWORK,
+        PROTOCOL_VERSION
+    );
+
+    SproutMerkleTree tree;
+    ASSERT_THROW(ss >> tree, std::ios_base::failure);
+}
+
+TEST(merkletree, testZeroElements) {
+    for (int start = 0; start < 20; start++) {
+        SproutMerkleTree newTree;
+
+        ASSERT_TRUE(newTree.root() == SproutMerkleTree::empty_root());
+
+        for (int i = start; i > 0; i--) {
+            newTree.append(uint256S("54d626e08c1c802b305dad30b7e54a82f102390cc92c7d4db112048935236e9c"));
+        }
+
+        uint256 oldroot = newTree.root();
+
+        // At this point, appending tons of null objects to the tree
+        // should preserve its root.
+
+        for (int i = 0; i < 100; i++) {
+            newTree.append(uint256());
+        }
+
+        ASSERT_TRUE(newTree.root() == oldroot);
+    }
+}
+
+TEST(orchardMerkleTree, emptyroot) {
+    // This literal is the depth-32 empty tree root with the bytes reversed, to
+    // account for the fact that uint256S() loads a big-endian representation of
+    // an integer, which is converted to little-endian internally.
+    uint256 expected = uint256S("2fd8e51a03d9bbe2dd809831b1497aeb68a6e37ddf707ced4aa2d8dff13529ae");
+
+    ASSERT_EQ(OrchardMerkleFrontier::empty_root(), expected);
+}
+
+TEST(orchardMerkleTree, appendBundle) {
+    OrchardMerkleFrontier newTree;
+
+    ASSERT_EQ(newTree.root(), OrchardMerkleFrontier::empty_root());
+
+    for (int i = 0; i < 1; i++) {
+        CDataStream ssBundleData(merkle_roots_orchard[i].bundle, SER_NETWORK, PROTOCOL_VERSION);
+        OrchardBundle b;
+        ssBundleData >> b;
+        newTree.AppendBundle(b);
+
+        uint256 anchor(merkle_roots_orchard[i].anchor);
+
+        ASSERT_EQ(newTree.root(), anchor);
+
+        // Sanity check roundtrip serialization of the updated tree
+        CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+        ss << newTree;
+
+        OrchardMerkleFrontier readBack;
+        ss >> readBack;
+
+        EXPECT_NE(newTree.root(), OrchardMerkleFrontier::empty_root());
+        EXPECT_EQ(newTree.root(), readBack.root());
+    }
+}
diff --git a/depend/zcash/src/gtest/test_metrics.cpp b/depend/zcash/src/gtest/test_metrics.cpp
new file mode 100644
index 000000000..adeb857d0
--- /dev/null
+++ b/depend/zcash/src/gtest/test_metrics.cpp
@@ -0,0 +1,184 @@
+#include <gtest/gtest.h>
+
+#include "metrics.h"
+#include "utiltest.h"
+#include "utiltime.h"
+
+
+TEST(Metrics, AtomicTimer) {
+    AtomicTimer t;
+    SetMockTime(100);
+
+    EXPECT_FALSE(t.running());
+
+    t.start();
+    EXPECT_TRUE(t.running());
+
+    t.start();
+    EXPECT_TRUE(t.running());
+
+    t.stop();
+    EXPECT_TRUE(t.running());
+
+    t.stop();
+    EXPECT_FALSE(t.running());
+
+    // Additional calls to stop() are ignored.
+    t.stop();
+    EXPECT_FALSE(t.running());
+
+    t.start();
+    EXPECT_TRUE(t.running());
+
+    AtomicCounter c;
+    EXPECT_EQ(0, t.rate(c));
+
+    c.increment();
+    EXPECT_EQ(0, t.rate(c));
+
+    SetMockTime(101);
+    EXPECT_EQ(1, t.rate(c));
+
+    c.decrement();
+    EXPECT_EQ(0, t.rate(c));
+
+    SetMockTime(102);
+    EXPECT_EQ(0, t.rate(c));
+
+    c.increment();
+    EXPECT_EQ(0.5, t.rate(c));
+
+    t.stop();
+    EXPECT_FALSE(t.running());
+    EXPECT_EQ(0.5, t.rate(c));
+}
+
+TEST(Metrics, GetLocalSolPS) {
+    SetMockTime(100);
+    miningTimer.start();
+
+    // No time has passed
+    EXPECT_EQ(0, GetLocalSolPS());
+
+    // Increment time
+    SetMockTime(101);
+    EXPECT_EQ(0, GetLocalSolPS());
+
+    // Increment solutions
+    solutionTargetChecks.increment();
+    EXPECT_EQ(1, GetLocalSolPS());
+
+    // Increment time
+    SetMockTime(102);
+    EXPECT_EQ(0.5, GetLocalSolPS());
+
+    // Increment solutions
+    solutionTargetChecks.increment();
+    solutionTargetChecks.increment();
+    EXPECT_EQ(1.5, GetLocalSolPS());
+
+    // Stop timing
+    miningTimer.stop();
+    EXPECT_EQ(1.5, GetLocalSolPS());
+
+    // Increment time
+    SetMockTime(103);
+    EXPECT_EQ(1.5, GetLocalSolPS());
+
+    // Start timing again
+    miningTimer.start();
+    EXPECT_EQ(1.5, GetLocalSolPS());
+
+    // Increment time
+    SetMockTime(104);
+    EXPECT_EQ(1, GetLocalSolPS());
+
+    miningTimer.stop();
+    miningTimer.zeroize();
+    solutionTargetChecks.decrement();
+    solutionTargetChecks.decrement();
+    solutionTargetChecks.decrement();
+}
+
+TEST(Metrics, EstimateNetHeight) {
+    auto params = RegtestActivateBlossom(false, 200).GetConsensus();
+    int64_t blockTimes[400];
+    for (int i = 0; i < 400; i++) {
+        blockTimes[i] = i ? blockTimes[i - 1] + params.PoWTargetSpacing(i) : 0;
+    }
+    SetMockTime(blockTimes[399]);
+    for (int i = 0; i < 400; i++) {
+        // Check that we are within 1 of the correct height
+        EXPECT_LT(std::abs(399 - EstimateNetHeight(params, i, blockTimes[i])), 2);
+    }
+    RegtestDeactivateBlossom();
+}
+
+TEST(Metrics, NextUpgrade) {
+    SelectParams(CBaseChainParams::REGTEST);
+    const Consensus::Params& params = Params().GetConsensus();
+
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_TESTDUMMY, 100);
+
+    EXPECT_EQ(SecondsLeftToNextEpoch(params, 1).value(), 14850);
+    EXPECT_EQ(DisplayDuration(SecondsLeftToNextEpoch(params, 1).value(), DurationFormat::REDUCED), "4 hours");
+    EXPECT_EQ(DisplayDuration(SecondsLeftToNextEpoch(params, 1).value(), DurationFormat::FULL), "4 hours, 7 minutes, 30 seconds");
+
+    EXPECT_EQ(SecondsLeftToNextEpoch(params, 90).value(), 1500);
+    EXPECT_EQ(DisplayDuration(SecondsLeftToNextEpoch(params, 90).value(), DurationFormat::REDUCED), "25 minutes");
+    EXPECT_EQ(DisplayDuration(SecondsLeftToNextEpoch(params, 90).value(), DurationFormat::FULL), "25 minutes, 0 seconds");
+
+    EXPECT_EQ(SecondsLeftToNextEpoch(params, 99).value(), 150);
+    EXPECT_EQ(DisplayDuration(SecondsLeftToNextEpoch(params, 99).value(), DurationFormat::REDUCED), "2 minutes");
+    EXPECT_EQ(DisplayDuration(SecondsLeftToNextEpoch(params, 99).value(), DurationFormat::FULL), "2 minutes, 30 seconds");
+
+    auto paramsBlossom = RegtestActivateBlossom(true).GetConsensus();
+    EXPECT_EQ(SecondsLeftToNextEpoch(paramsBlossom, 1).value(), 7425);
+    EXPECT_EQ(DisplayDuration(SecondsLeftToNextEpoch(paramsBlossom, 1).value(), DurationFormat::REDUCED), "2 hours");
+    EXPECT_EQ(DisplayDuration(SecondsLeftToNextEpoch(paramsBlossom, 1).value(), DurationFormat::FULL), "2 hours, 3 minutes, 45 seconds");
+    RegtestDeactivateBlossom();
+
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_TESTDUMMY, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+}
+
+TEST(Metrics, DisplayFunctions) {
+    EXPECT_EQ(DisplayDuration(0,               DurationFormat::REDUCED), "0 seconds");
+    EXPECT_EQ(DisplayDuration(59,              DurationFormat::REDUCED), "59 seconds");
+    EXPECT_EQ(DisplayDuration(60,              DurationFormat::REDUCED), "1 minutes");
+    EXPECT_EQ(DisplayDuration(61,              DurationFormat::REDUCED), "1 minutes");
+    EXPECT_EQ(DisplayDuration(3599,            DurationFormat::REDUCED), "59 minutes");
+    EXPECT_EQ(DisplayDuration(3600,            DurationFormat::REDUCED), "1 hours");
+    EXPECT_EQ(DisplayDuration(86399,           DurationFormat::REDUCED), "23 hours");
+    EXPECT_EQ(DisplayDuration(86400,           DurationFormat::REDUCED), "1 days");
+    EXPECT_EQ(DisplayDuration(8640000,         DurationFormat::REDUCED), "100 days");
+    EXPECT_EQ(DisplayDuration(185542587100800, DurationFormat::REDUCED), "2147483647 days");
+    EXPECT_EQ(DisplayDuration(185542587187199, DurationFormat::REDUCED), "2147483647 days");
+
+    EXPECT_EQ(DisplayDuration(0,               DurationFormat::FULL), "0 seconds");
+    EXPECT_EQ(DisplayDuration(59,              DurationFormat::FULL), "59 seconds");
+    EXPECT_EQ(DisplayDuration(60,              DurationFormat::FULL), "1 minutes, 0 seconds");
+    EXPECT_EQ(DisplayDuration(61,              DurationFormat::FULL), "1 minutes, 1 seconds");
+    EXPECT_EQ(DisplayDuration(3599,            DurationFormat::FULL), "59 minutes, 59 seconds");
+    EXPECT_EQ(DisplayDuration(3600,            DurationFormat::FULL), "1 hours, 0 minutes, 0 seconds");
+    EXPECT_EQ(DisplayDuration(86399,           DurationFormat::FULL), "23 hours, 59 minutes, 59 seconds");
+    EXPECT_EQ(DisplayDuration(86400,           DurationFormat::FULL), "1 days, 0 hours, 0 minutes, 0 seconds");
+    EXPECT_EQ(DisplayDuration(8640000,         DurationFormat::FULL), "100 days, 0 hours, 0 minutes, 0 seconds");
+    EXPECT_EQ(DisplayDuration(185542587100800, DurationFormat::FULL), "2147483647 days, 0 hours, 0 minutes, 0 seconds");
+    EXPECT_EQ(DisplayDuration(185542587187199, DurationFormat::FULL), "2147483647 days, 23 hours, 59 minutes, 59 seconds");
+
+    EXPECT_EQ(DisplaySize(0),             "0 Bytes");
+    EXPECT_EQ(DisplaySize(123),           "123 Bytes");
+    EXPECT_EQ(DisplaySize(123456),        "120.56 KiB");
+    EXPECT_EQ(DisplaySize(123456789),     "117.74 MiB");
+    EXPECT_EQ(DisplaySize(123456789012),  "114.98 GiB");
+    EXPECT_EQ(DisplaySize(1234567890123), "1.12 TiB");
+    EXPECT_EQ(DisplaySize(INT64_MAX),     "8388608.00 TiB");
+
+    EXPECT_EQ(DisplayHashRate(0.0),             "0.000 Sol/s");
+    EXPECT_EQ(DisplayHashRate(0.1234),          "0.123 Sol/s");
+    EXPECT_EQ(DisplayHashRate(123.45),          "123.450 Sol/s");
+    EXPECT_EQ(DisplayHashRate(1234.5),          "1.234 kSol/s");
+    EXPECT_EQ(DisplayHashRate(1234567.8),       "1.235 MSol/s");
+    EXPECT_EQ(DisplayHashRate(1234567890.1),    "1.235 GSol/s");
+    EXPECT_EQ(DisplayHashRate(1234567890123.4), "1.235 TSol/s");
+}
diff --git a/depend/zcash/src/gtest/test_miner.cpp b/depend/zcash/src/gtest/test_miner.cpp
new file mode 100644
index 000000000..61d454407
--- /dev/null
+++ b/depend/zcash/src/gtest/test_miner.cpp
@@ -0,0 +1,125 @@
+#if ENABLE_MINING
+#include <gmock/gmock.h>
+#include <gtest/gtest.h>
+
+#include "chainparams.h"
+#include "key.h"
+#include "miner.h"
+#include "util.h"
+
+#include <variant>
+
+
+TEST(Miner, GetMinerAddress) {
+    SelectParams(CBaseChainParams::MAIN);
+
+    // No miner address set
+    {
+        MinerAddress minerAddress;
+        GetMinerAddress(minerAddress);
+        EXPECT_FALSE(IsValidMinerAddress(minerAddress));
+    }
+
+    mapArgs["-mineraddress"] = "notAnAddress";
+    {
+        MinerAddress minerAddress;
+        GetMinerAddress(minerAddress);
+        EXPECT_FALSE(IsValidMinerAddress(minerAddress));
+    }
+
+    // Partial transparent address
+    mapArgs["-mineraddress"] = "t1T8yaLVhNqxA5KJcmiqq";
+    {
+        MinerAddress minerAddress;
+        GetMinerAddress(minerAddress);
+        EXPECT_FALSE(IsValidMinerAddress(minerAddress));
+    }
+
+    // Typo in transparent address
+    mapArgs["-mineraddress"] = "t1TByaLVhNqxA5KJcmiqqFN88e8DNp2PBfF";
+    {
+        MinerAddress minerAddress;
+        GetMinerAddress(minerAddress);
+        EXPECT_FALSE(IsValidMinerAddress(minerAddress));
+    }
+
+    // Set up expected scriptPubKey for t1T8yaLVhNqxA5KJcmiqqFN88e8DNp2PBfF
+    CKeyID keyID;
+    keyID.SetHex("eb88f1c65b39a823479ac9c7db2f4a865960a165");
+    CScript expectedCoinbaseScript = CScript() << OP_DUP << OP_HASH160 << ToByteVector(keyID) << OP_EQUALVERIFY << OP_CHECKSIG;
+
+    // Valid transparent address
+    mapArgs["-mineraddress"] = "t1T8yaLVhNqxA5KJcmiqqFN88e8DNp2PBfF";
+    {
+        MinerAddress minerAddress;
+        GetMinerAddress(minerAddress);
+        EXPECT_TRUE(IsValidMinerAddress(minerAddress));
+        EXPECT_TRUE(std::get_if<boost::shared_ptr<CReserveScript>>(&minerAddress) != nullptr);
+        auto coinbaseScript = std::get<boost::shared_ptr<CReserveScript>>(minerAddress);
+        EXPECT_EQ(expectedCoinbaseScript, coinbaseScript->reserveScript);
+    }
+
+    // Valid transparent address with leading whitespace
+    mapArgs["-mineraddress"] = "  t1T8yaLVhNqxA5KJcmiqqFN88e8DNp2PBfF";
+    {
+        MinerAddress minerAddress;
+        GetMinerAddress(minerAddress);
+        EXPECT_TRUE(IsValidMinerAddress(minerAddress));
+        EXPECT_TRUE(std::get_if<boost::shared_ptr<CReserveScript>>(&minerAddress) != nullptr);
+        auto coinbaseScript = std::get<boost::shared_ptr<CReserveScript>>(minerAddress);
+        EXPECT_EQ(expectedCoinbaseScript, coinbaseScript->reserveScript);
+    }
+
+    // Valid transparent address with trailing whitespace
+    mapArgs["-mineraddress"] = "t1T8yaLVhNqxA5KJcmiqqFN88e8DNp2PBfF  ";
+    {
+        MinerAddress minerAddress;
+        GetMinerAddress(minerAddress);
+        EXPECT_TRUE(IsValidMinerAddress(minerAddress));
+        EXPECT_TRUE(std::get_if<boost::shared_ptr<CReserveScript>>(&minerAddress) != nullptr);
+        auto coinbaseScript = std::get<boost::shared_ptr<CReserveScript>>(minerAddress);
+        EXPECT_EQ(expectedCoinbaseScript, coinbaseScript->reserveScript);
+    }
+
+    // Partial Sapling address
+    mapArgs["-mineraddress"] = "zs1z7rejlpsa98s2rrrfkwmaxu53";
+    {
+        MinerAddress minerAddress;
+        GetMinerAddress(minerAddress);
+        EXPECT_FALSE(IsValidMinerAddress(minerAddress));
+    }
+
+    // Typo in Sapling address
+    mapArgs["-mineraddress"] = "zs1s7rejlpsa98s2rrrfkwmaxu53e4ue0ulcrw0h4x5g8jl04tak0d3mm47vdtahatqrlkngh9slya";
+    {
+        MinerAddress minerAddress;
+        GetMinerAddress(minerAddress);
+        EXPECT_FALSE(IsValidMinerAddress(minerAddress));
+    }
+
+    // Valid Sapling address
+    mapArgs["-mineraddress"] = "zs1z7rejlpsa98s2rrrfkwmaxu53e4ue0ulcrw0h4x5g8jl04tak0d3mm47vdtahatqrlkngh9slya";
+    {
+        MinerAddress minerAddress;
+        GetMinerAddress(minerAddress);
+        EXPECT_TRUE(IsValidMinerAddress(minerAddress));
+        EXPECT_TRUE(std::get_if<libzcash::SaplingPaymentAddress>(&minerAddress) != nullptr);
+    }
+
+    // Valid Sapling address with leading whitespace
+    mapArgs["-mineraddress"] = "  zs1z7rejlpsa98s2rrrfkwmaxu53e4ue0ulcrw0h4x5g8jl04tak0d3mm47vdtahatqrlkngh9slya";
+    {
+        MinerAddress minerAddress;
+        GetMinerAddress(minerAddress);
+        EXPECT_FALSE(IsValidMinerAddress(minerAddress));
+    }
+
+    // Valid Sapling address with trailing whitespace
+    mapArgs["-mineraddress"] = "zs1z7rejlpsa98s2rrrfkwmaxu53e4ue0ulcrw0h4x5g8jl04tak0d3mm47vdtahatqrlkngh9slya  ";
+    {
+        MinerAddress minerAddress;
+        GetMinerAddress(minerAddress);
+        EXPECT_FALSE(IsValidMinerAddress(minerAddress));
+    }
+}
+#endif // ENABLE_MINING
diff --git a/depend/zcash/src/gtest/test_noteencryption.cpp b/depend/zcash/src/gtest/test_noteencryption.cpp
new file mode 100644
index 000000000..640dd64d6
--- /dev/null
+++ b/depend/zcash/src/gtest/test_noteencryption.cpp
@@ -0,0 +1,789 @@
+#include <gtest/gtest.h>
+#include "sodium.h"
+
+#include <array>
+#include <optional>
+#include <stdexcept>
+
+#include "zcash/Note.hpp"
+#include "zcash/NoteEncryption.hpp"
+#include "zcash/prf.h"
+#include "zcash/Address.hpp"
+#include "crypto/sha256.h"
+#include "librustzcash.h"
+#include "consensus/params.h"
+#include "utiltest.h"
+
+class TestNoteDecryption : public ZCNoteDecryption {
+public:
+    TestNoteDecryption(uint256 sk_enc) : ZCNoteDecryption(sk_enc) {}
+
+    void change_pk_enc(uint256 to) {
+        pk_enc = to;
+    }
+};
+
+TEST(NoteEncryption, NotePlaintext)
+{
+    SelectParams(CBaseChainParams::REGTEST);
+
+    std::vector<libzcash::Zip212Enabled> zip_212_enabled = {libzcash::Zip212Enabled::BeforeZip212, libzcash::Zip212Enabled::AfterZip212};
+    const Consensus::Params& (*activations [])() = {RegtestActivateSapling, RegtestActivateCanopy};
+    void (*deactivations [])() = {RegtestDeactivateSapling, RegtestDeactivateCanopy};
+
+    using namespace libzcash;
+    auto xsk = SaplingSpendingKey(uint256()).expanded_spending_key();
+    auto fvk = xsk.full_viewing_key();
+    auto ivk = fvk.in_viewing_key();
+    SaplingPaymentAddress addr = *ivk.address({0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0});
+
+    std::array<unsigned char, ZC_MEMO_SIZE> memo;
+    for (size_t i = 0; i < ZC_MEMO_SIZE; i++) {
+        // Fill the message with dummy data
+        memo[i] = (unsigned char) i;
+    }
+
+    for (int ver = 0; ver < zip_212_enabled.size(); ver++){
+        auto params = (*activations[ver])();
+
+        SaplingNote note(addr, 39393, zip_212_enabled[ver]);
+        auto cmu_opt = note.cmu();
+        if (!cmu_opt) {
+            FAIL();
+        }
+        uint256 cmu = cmu_opt.value();
+        SaplingNotePlaintext pt(note, memo);
+
+        auto res = pt.encrypt(addr.pk_d);
+        if (!res) {
+            FAIL();
+        }
+
+        auto enc = res.value();
+
+        auto ct = enc.first;
+        auto encryptor = enc.second;
+        auto epk = encryptor.get_epk();
+
+        // Try to decrypt with incorrect commitment
+        ASSERT_FALSE(SaplingNotePlaintext::decrypt(
+            params,
+            1,
+            ct,
+            ivk,
+            epk,
+            uint256()
+        ));
+
+        // Try to decrypt with correct commitment
+        auto foo = SaplingNotePlaintext::decrypt(
+            params,
+            1,
+            ct,
+            ivk,
+            epk,
+            cmu
+        );
+
+        if (!foo) {
+            FAIL();
+        }
+
+        auto bar = foo.value();
+
+        ASSERT_TRUE(bar.value() == pt.value());
+        ASSERT_TRUE(bar.memo() == pt.memo());
+        ASSERT_TRUE(bar.d == pt.d);
+        ASSERT_TRUE(bar.rcm() == pt.rcm());
+
+        auto foobar = bar.note(ivk);
+
+        if (!foobar) {
+            FAIL();
+        }
+
+        auto new_note = foobar.value();
+
+        ASSERT_TRUE(note.value() == new_note.value());
+        ASSERT_TRUE(note.d == new_note.d);
+        ASSERT_TRUE(note.pk_d == new_note.pk_d);
+        ASSERT_TRUE(note.rcm() == new_note.rcm());
+        ASSERT_TRUE(note.cmu() == new_note.cmu());
+
+        SaplingOutgoingPlaintext out_pt;
+        out_pt.pk_d = note.pk_d;
+        out_pt.esk = encryptor.get_esk();
+
+        auto ovk = random_uint256();
+        auto cv = random_uint256();
+        auto cm = random_uint256();
+
+        auto out_ct = out_pt.encrypt(
+            ovk,
+            cv,
+            cm,
+            encryptor
+        );
+
+        auto decrypted_out_ct = out_pt.decrypt(
+            out_ct,
+            ovk,
+            cv,
+            cm,
+            encryptor.get_epk()
+        );
+
+        if (!decrypted_out_ct) {
+            FAIL();
+        }
+
+        auto decrypted_out_ct_unwrapped = decrypted_out_ct.value();
+
+        ASSERT_TRUE(decrypted_out_ct_unwrapped.pk_d == out_pt.pk_d);
+        ASSERT_TRUE(decrypted_out_ct_unwrapped.esk == out_pt.esk);
+
+        // Test sender won't accept invalid commitments
+        ASSERT_FALSE(
+            SaplingNotePlaintext::decrypt(
+                params,
+                1,
+                ct,
+                epk,
+                decrypted_out_ct_unwrapped.esk,
+                decrypted_out_ct_unwrapped.pk_d,
+                uint256()
+            )
+        );
+
+        // Test sender can decrypt the note ciphertext.
+        foo = SaplingNotePlaintext::decrypt(
+            params,
+            1,
+            ct,
+            epk,
+            decrypted_out_ct_unwrapped.esk,
+            decrypted_out_ct_unwrapped.pk_d,
+            cmu
+        );
+
+        if (!foo) {
+            FAIL();
+        }
+
+        bar = foo.value();
+
+        ASSERT_TRUE(bar.value() == pt.value());
+        ASSERT_TRUE(bar.memo() == pt.memo());
+        ASSERT_TRUE(bar.d == pt.d);
+        ASSERT_TRUE(bar.rcm() == pt.rcm());
+
+        (*deactivations[ver])();
+    }
+}
+
+TEST(NoteEncryption, RejectsInvalidNoteZip212Enabled)
+{
+    SelectParams(CBaseChainParams::REGTEST);
+    int overwinterActivationHeight = 5;
+    int saplingActivationHeight = 30;
+    int canopyActivationHeight = 70;
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, overwinterActivationHeight);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_SAPLING, saplingActivationHeight);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_CANOPY, canopyActivationHeight);
+    const Consensus::Params& params = Params().GetConsensus();
+
+    using namespace libzcash;
+    auto xsk = SaplingSpendingKey(uint256()).expanded_spending_key();
+    auto fvk = xsk.full_viewing_key();
+    auto ivk = fvk.in_viewing_key();
+    SaplingPaymentAddress addr = *ivk.address({0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0});
+
+    std::array<unsigned char, ZC_MEMO_SIZE> memo;
+    for (size_t i = 0; i < ZC_MEMO_SIZE; i++) {
+        // Fill the message with dummy data
+        memo[i] = (unsigned char) i;
+    }
+
+    {
+        // non-0x01 received before Canopy activation height
+        SaplingNote note(addr, 39393, Zip212Enabled::AfterZip212);
+        auto cmu_opt = note.cmu();
+        if (!cmu_opt) {
+            FAIL();
+        }
+        uint256 cmu = cmu_opt.value();
+        SaplingNotePlaintext pt(note, memo);
+
+        auto res = pt.encrypt(addr.pk_d);
+        if (!res) {
+            FAIL();
+        }
+
+        auto enc = res.value();
+
+        auto ct = enc.first;
+        auto encryptor = enc.second;
+        auto epk = encryptor.get_epk();
+
+        ASSERT_FALSE(SaplingNotePlaintext::decrypt(
+            params,
+            canopyActivationHeight - 1,
+            ct,
+            ivk,
+            epk,
+            cmu
+        ));
+    }
+
+    {
+        // non-0x02 received past (Canopy activation height + grace period)
+        SaplingNote note(addr, 39393, Zip212Enabled::BeforeZip212);
+        auto cmu_opt = note.cmu();
+        if (!cmu_opt) {
+            FAIL();
+        }
+        uint256 cmu = cmu_opt.value();
+        SaplingNotePlaintext pt(note, memo);
+
+        auto res = pt.encrypt(addr.pk_d);
+        if (!res) {
+            FAIL();
+        }
+
+        auto enc = res.value();
+
+        auto ct = enc.first;
+        auto encryptor = enc.second;
+        auto epk = encryptor.get_epk();
+
+        ASSERT_FALSE(SaplingNotePlaintext::decrypt(
+            params,
+            canopyActivationHeight + ZIP212_GRACE_PERIOD,
+            ct,
+            ivk,
+            epk,
+            cmu
+        ));
+    }
+
+    // Revert to test default
+    RegtestDeactivateCanopy();
+    RegtestDeactivateHeartwood();
+    RegtestDeactivateSapling();
+}
+
+TEST(NoteEncryption, AcceptsValidNoteZip212Enabled)
+{
+    SelectParams(CBaseChainParams::REGTEST);
+    int overwinterActivationHeight = 5;
+    int saplingActivationHeight = 30;
+    int canopyActivationHeight = 70;
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, overwinterActivationHeight);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_SAPLING, saplingActivationHeight);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_CANOPY, canopyActivationHeight);
+    const Consensus::Params& params = Params().GetConsensus();
+
+    using namespace libzcash;
+    auto xsk = SaplingSpendingKey(uint256()).expanded_spending_key();
+    auto fvk = xsk.full_viewing_key();
+    auto ivk = fvk.in_viewing_key();
+    SaplingPaymentAddress addr = *ivk.address({0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0});
+
+    std::array<unsigned char, ZC_MEMO_SIZE> memo;
+    for (size_t i = 0; i < ZC_MEMO_SIZE; i++) {
+        // Fill the message with dummy data
+        memo[i] = (unsigned char) i;
+    }
+
+    {
+        // 0x01 received before Canopy activation height
+        SaplingNote note(addr, 39393, Zip212Enabled::BeforeZip212);
+        auto cmu_opt = note.cmu();
+        if (!cmu_opt) {
+            FAIL();
+        }
+        uint256 cmu = cmu_opt.value();
+        SaplingNotePlaintext pt(note, memo);
+
+        auto res = pt.encrypt(addr.pk_d);
+        if (!res) {
+            FAIL();
+        }
+
+        auto enc = res.value();
+
+        auto ct = enc.first;
+        auto encryptor = enc.second;
+        auto epk = encryptor.get_epk();
+
+        auto plaintext = SaplingNotePlaintext::decrypt(
+            params,
+            canopyActivationHeight - 1,
+            ct,
+            ivk,
+            epk,
+            cmu
+        );
+
+        if (!plaintext) {
+            FAIL();
+        }
+    }
+
+    {
+        // {0x01,0x02} received after Canopy activation and before grace period has elapsed
+        std::vector<libzcash::Zip212Enabled> zip_212_enabled = {libzcash::Zip212Enabled::BeforeZip212, libzcash::Zip212Enabled::AfterZip212};
+        int height1 = canopyActivationHeight;
+        int height2 = canopyActivationHeight + (ZIP212_GRACE_PERIOD) - 1;
+        int heights[] = {height1, height2};
+
+        for (int i = 0; i < zip_212_enabled.size(); i++) {
+            for (int j = 0; j < sizeof(heights) / sizeof(int); j++) {
+                SaplingNote note(addr, 39393, zip_212_enabled[i]);
+                auto cmu_opt = note.cmu();
+                if (!cmu_opt) {
+                    FAIL();
+                }
+                uint256 cmu = cmu_opt.value();
+                SaplingNotePlaintext pt(note, memo);
+
+                auto res = pt.encrypt(addr.pk_d);
+                if (!res) {
+                    FAIL();
+                }
+
+                auto enc = res.value();
+
+                auto ct = enc.first;
+                auto encryptor = enc.second;
+                auto epk = encryptor.get_epk();
+
+                auto plaintext = SaplingNotePlaintext::decrypt(
+                    params,
+                    heights[j],
+                    ct,
+                    ivk,
+                    epk,
+                    cmu
+                );
+
+                if (!plaintext) {
+                    FAIL();
+                }
+            }
+        }
+    }
+
+    {
+        // 0x02 received past (Canopy activation height + grace period)
+        SaplingNote note(addr, 39393, Zip212Enabled::AfterZip212);
+        auto cmu_opt = note.cmu();
+        if (!cmu_opt) {
+            FAIL();
+        }
+        uint256 cmu = cmu_opt.value();
+        SaplingNotePlaintext pt(note, memo);
+
+        auto res = pt.encrypt(addr.pk_d);
+        if (!res) {
+            FAIL();
+        }
+
+        auto enc = res.value();
+
+        auto ct = enc.first;
+        auto encryptor = enc.second;
+        auto epk = encryptor.get_epk();
+
+        auto plaintext = SaplingNotePlaintext::decrypt(
+            params,
+            canopyActivationHeight + ZIP212_GRACE_PERIOD,
+            ct,
+            ivk,
+            epk,
+            cmu
+        );
+
+        if (!plaintext) {
+            FAIL();
+        }
+    }
+
+    // Revert to test default
+    RegtestDeactivateCanopy();
+    RegtestDeactivateHeartwood();
+    RegtestDeactivateSapling();
+}
+
+TEST(NoteEncryption, SaplingApi)
+{
+    using namespace libzcash;
+
+    // Create recipient addresses
+    auto sk = SaplingSpendingKey(uint256()).expanded_spending_key();
+    auto vk = sk.full_viewing_key();
+    auto ivk = vk.in_viewing_key();
+    SaplingPaymentAddress pk_1 = *ivk.address({0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0});
+    SaplingPaymentAddress pk_2 = *ivk.address({4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0});
+
+    // Blob of stuff we're encrypting
+    std::array<unsigned char, ZC_SAPLING_ENCPLAINTEXT_SIZE> message;
+    for (size_t i = 0; i < ZC_SAPLING_ENCPLAINTEXT_SIZE; i++) {
+        // Fill the message with dummy data
+        message[i] = (unsigned char) i;
+    }
+
+    std::array<unsigned char, ZC_SAPLING_OUTPLAINTEXT_SIZE> small_message;
+    for (size_t i = 0; i < ZC_SAPLING_OUTPLAINTEXT_SIZE; i++) {
+        // Fill the message with dummy data
+        small_message[i] = (unsigned char) i;
+    }
+
+    uint256 esk;
+    librustzcash_sapling_generate_r(esk.begin());
+
+    // Invalid diversifier
+    ASSERT_EQ(std::nullopt, SaplingNoteEncryption::FromDiversifier({1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, esk));
+
+    // Encrypt to pk_1
+    auto enc = *SaplingNoteEncryption::FromDiversifier(pk_1.d, esk);
+    auto ciphertext_1 = *enc.encrypt_to_recipient(
+        pk_1.pk_d,
+        message
+    );
+    auto epk_1 = enc.get_epk();
+    {
+        uint256 test_epk;
+        uint256 test_esk = enc.get_esk();
+        ASSERT_TRUE(librustzcash_sapling_ka_derivepublic(pk_1.d.begin(), test_esk.begin(), test_epk.begin()));
+        ASSERT_TRUE(test_epk == epk_1);
+    }
+    auto cv_1 = random_uint256();
+    auto cm_1 = random_uint256();
+    auto out_ciphertext_1 = enc.encrypt_to_ourselves(
+        sk.ovk,
+        cv_1,
+        cm_1,
+        small_message
+    );
+
+    // Encrypt to pk_2
+    enc = *SaplingNoteEncryption::FromDiversifier(pk_2.d, esk);
+    auto ciphertext_2 = *enc.encrypt_to_recipient(
+        pk_2.pk_d,
+        message
+    );
+    auto epk_2 = enc.get_epk();
+
+    auto cv_2 = random_uint256();
+    auto cm_2 = random_uint256();
+    auto out_ciphertext_2 = enc.encrypt_to_ourselves(
+        sk.ovk,
+        cv_2,
+        cm_2,
+        small_message
+    );
+
+    // Test nonce-reuse resistance of API
+    {
+        auto tmp_enc = *SaplingNoteEncryption::FromDiversifier(pk_1.d, esk);
+        
+        tmp_enc.encrypt_to_recipient(
+            pk_1.pk_d,
+            message
+        );
+
+        ASSERT_THROW(tmp_enc.encrypt_to_recipient(
+            pk_1.pk_d,
+            message
+        ), std::logic_error);
+
+        tmp_enc.encrypt_to_ourselves(
+            sk.ovk,
+            cv_2,
+            cm_2,
+            small_message
+        );
+
+        ASSERT_THROW(tmp_enc.encrypt_to_ourselves(
+            sk.ovk,
+            cv_2,
+            cm_2,
+            small_message
+        ), std::logic_error);
+    }
+
+    // Try to decrypt
+    auto plaintext_1 = *AttemptSaplingEncDecryption(
+        ciphertext_1,
+        ivk,
+        epk_1
+    );
+    ASSERT_TRUE(message == plaintext_1);
+
+    auto small_plaintext_1 = *AttemptSaplingOutDecryption(
+        out_ciphertext_1,
+        sk.ovk,
+        cv_1,
+        cm_1,
+        epk_1
+    );
+    ASSERT_TRUE(small_message == small_plaintext_1);
+
+    auto plaintext_2 = *AttemptSaplingEncDecryption(
+        ciphertext_2,
+        ivk,
+        epk_2
+    );
+    ASSERT_TRUE(message == plaintext_2);
+
+    auto small_plaintext_2 = *AttemptSaplingOutDecryption(
+        out_ciphertext_2,
+        sk.ovk,
+        cv_2,
+        cm_2,
+        epk_2
+    );
+    ASSERT_TRUE(small_message == small_plaintext_2);
+
+    // Try to decrypt out ciphertext with wrong key material
+    ASSERT_FALSE(AttemptSaplingOutDecryption(
+        out_ciphertext_1,
+        random_uint256(),
+        cv_1,
+        cm_1,
+        epk_1
+    ));
+    ASSERT_FALSE(AttemptSaplingOutDecryption(
+        out_ciphertext_1,
+        sk.ovk,
+        random_uint256(),
+        cm_1,
+        epk_1
+    ));
+    ASSERT_FALSE(AttemptSaplingOutDecryption(
+        out_ciphertext_1,
+        sk.ovk,
+        cv_1,
+        random_uint256(),
+        epk_1
+    ));
+    ASSERT_FALSE(AttemptSaplingOutDecryption(
+        out_ciphertext_1,
+        sk.ovk,
+        cv_1,
+        cm_1,
+        random_uint256()
+    ));
+
+    // Try to decrypt with wrong ephemeral key
+    ASSERT_FALSE(AttemptSaplingEncDecryption(
+        ciphertext_1,
+        ivk,
+        epk_2
+    ));
+    ASSERT_FALSE(AttemptSaplingEncDecryption(
+        ciphertext_2,
+        ivk,
+        epk_1
+    ));
+
+    // Try to decrypt with wrong ivk
+    ASSERT_FALSE(AttemptSaplingEncDecryption(
+        ciphertext_1,
+        uint256(),
+        epk_1
+    ));
+    ASSERT_FALSE(AttemptSaplingEncDecryption(
+        ciphertext_2,
+        uint256(),
+        epk_2
+    ));
+}
+
+TEST(NoteEncryption, api)
+{
+    uint256 sk_enc = ZCNoteEncryption::generate_privkey(uint252(uint256S("21035d60bc1983e37950ce4803418a8fb33ea68d5b937ca382ecbae7564d6a07")));
+    uint256 pk_enc = ZCNoteEncryption::generate_pubkey(sk_enc);
+
+    ZCNoteEncryption b = ZCNoteEncryption(uint256());
+    for (size_t i = 0; i < 100; i++)
+    {
+        ZCNoteEncryption c = ZCNoteEncryption(uint256());
+
+        ASSERT_TRUE(b.get_epk() != c.get_epk());
+    }
+
+    std::array<unsigned char, ZC_NOTEPLAINTEXT_SIZE> message;
+    for (size_t i = 0; i < ZC_NOTEPLAINTEXT_SIZE; i++) {
+        // Fill the message with dummy data
+        message[i] = (unsigned char) i;
+    }
+
+    for (int i = 0; i < 255; i++) {
+        auto ciphertext = b.encrypt(pk_enc, message);
+
+        {
+            ZCNoteDecryption decrypter(sk_enc);
+
+            // Test decryption
+            auto plaintext = decrypter.decrypt(ciphertext, b.get_epk(), uint256(), i);
+            ASSERT_TRUE(plaintext == message);
+
+            // Test wrong nonce
+            ASSERT_THROW(decrypter.decrypt(ciphertext, b.get_epk(), uint256(), (i == 0) ? 1 : (i - 1)),
+                         libzcash::note_decryption_failed);
+        
+            // Test wrong ephemeral key
+            {
+                ZCNoteEncryption c = ZCNoteEncryption(uint256());
+
+                ASSERT_THROW(decrypter.decrypt(ciphertext, c.get_epk(), uint256(), i),
+                             libzcash::note_decryption_failed);
+            }
+        
+            // Test wrong seed
+            ASSERT_THROW(decrypter.decrypt(ciphertext, b.get_epk(), uint256S("11035d60bc1983e37950ce4803418a8fb33ea68d5b937ca382ecbae7564d6a77"), i),
+                         libzcash::note_decryption_failed);
+        
+            // Test corrupted ciphertext
+            ciphertext[10] ^= 0xff;
+            ASSERT_THROW(decrypter.decrypt(ciphertext, b.get_epk(), uint256(), i),
+                         libzcash::note_decryption_failed);
+            ciphertext[10] ^= 0xff;
+        }
+
+        {
+            // Test wrong private key
+            uint256 sk_enc_2 = ZCNoteEncryption::generate_privkey(uint252());
+            ZCNoteDecryption decrypter(sk_enc_2);
+
+            ASSERT_THROW(decrypter.decrypt(ciphertext, b.get_epk(), uint256(), i),
+                         libzcash::note_decryption_failed);
+        }
+
+        {
+            TestNoteDecryption decrypter(sk_enc);
+
+            // Test decryption
+            auto plaintext = decrypter.decrypt(ciphertext, b.get_epk(), uint256(), i);
+            ASSERT_TRUE(plaintext == message);
+
+            // Test wrong public key (test of KDF)
+            decrypter.change_pk_enc(uint256());
+            ASSERT_THROW(decrypter.decrypt(ciphertext, b.get_epk(), uint256(), i),
+                         libzcash::note_decryption_failed);
+        }
+    }
+
+    // Nonce space should run out here
+    try {
+        b.encrypt(pk_enc, message);
+        FAIL() << "Expected std::logic_error";
+    }
+    catch(std::logic_error const & err) {
+        EXPECT_EQ(err.what(), std::string("no additional nonce space for KDF"));
+    }
+    catch(...) {
+        FAIL() << "Expected std::logic_error";
+    }
+}
+
+uint256 test_prf(
+    unsigned char distinguisher,
+    uint252 seed_x,
+    uint256 y
+) {
+    uint256 x = seed_x.inner();
+    *x.begin() &= 0x0f;
+    *x.begin() |= distinguisher;
+    CSHA256 hasher;
+    hasher.Write(x.begin(), 32);
+    hasher.Write(y.begin(), 32);
+
+    uint256 ret;
+    hasher.FinalizeNoPadding(ret.begin());
+    return ret;
+}
+
+TEST(NoteEncryption, PrfAddr)
+{
+    for (size_t i = 0; i < 100; i++) {
+        uint252 a_sk = libzcash::random_uint252();
+        uint256 rest;
+        ASSERT_TRUE(
+            test_prf(0xc0, a_sk, rest) == PRF_addr_a_pk(a_sk)
+        );
+    }
+
+    for (size_t i = 0; i < 100; i++) {
+        uint252 a_sk = libzcash::random_uint252();
+        uint256 rest;
+        *rest.begin() = 0x01;
+        ASSERT_TRUE(
+            test_prf(0xc0, a_sk, rest) == PRF_addr_sk_enc(a_sk)
+        );
+    }
+}
+
+TEST(NoteEncryption, PrfNf)
+{
+    for (size_t i = 0; i < 100; i++) {
+        uint252 a_sk = libzcash::random_uint252();
+        uint256 rho = libzcash::random_uint256();
+        ASSERT_TRUE(
+            test_prf(0xe0, a_sk, rho) == PRF_nf(a_sk, rho)
+        );
+    }
+}
+
+TEST(NoteEncryption, PrfPk)
+{
+    for (size_t i = 0; i < 100; i++) {
+        uint252 a_sk = libzcash::random_uint252();
+        uint256 h_sig = libzcash::random_uint256();
+        ASSERT_TRUE(
+            test_prf(0x00, a_sk, h_sig) == PRF_pk(a_sk, 0, h_sig)
+        );
+    }
+
+    for (size_t i = 0; i < 100; i++) {
+        uint252 a_sk = libzcash::random_uint252();
+        uint256 h_sig = libzcash::random_uint256();
+        ASSERT_TRUE(
+            test_prf(0x40, a_sk, h_sig) == PRF_pk(a_sk, 1, h_sig)
+        );
+    }
+
+    uint252 dummy_a;
+    uint256 dummy_b;
+    ASSERT_THROW(PRF_pk(dummy_a, 2, dummy_b), std::domain_error);
+}
+
+TEST(NoteEncryption, PrfRho)
+{
+    for (size_t i = 0; i < 100; i++) {
+        uint252 phi = libzcash::random_uint252();
+        uint256 h_sig = libzcash::random_uint256();
+        ASSERT_TRUE(
+            test_prf(0x20, phi, h_sig) == PRF_rho(phi, 0, h_sig)
+        );
+    }
+
+    for (size_t i = 0; i < 100; i++) {
+        uint252 phi = libzcash::random_uint252();
+        uint256 h_sig = libzcash::random_uint256();
+        ASSERT_TRUE(
+            test_prf(0x60, phi, h_sig) == PRF_rho(phi, 1, h_sig)
+        );
+    }
+
+    uint252 dummy_a;
+    uint256 dummy_b;
+    ASSERT_THROW(PRF_rho(dummy_a, 2, dummy_b), std::domain_error);
+}
+
+TEST(NoteEncryption, uint252)
+{
+    ASSERT_THROW(uint252(uint256S("f6da8716682d600f74fc16bd0187faad6a26b4aa4c24d5c055b216d94516847e")), std::domain_error);
+}
diff --git a/depend/zcash/src/gtest/test_pedersen_hash.cpp b/depend/zcash/src/gtest/test_pedersen_hash.cpp
new file mode 100644
index 000000000..e52b346a8
--- /dev/null
+++ b/depend/zcash/src/gtest/test_pedersen_hash.cpp
@@ -0,0 +1,15 @@
+#include <gtest/gtest.h>
+#include "librustzcash.h"
+#include "uint256.h"
+
+TEST(PedersenHash, TestAPI) {
+    const uint256 a = uint256S("87a086ae7d2252d58729b30263fb7b66308bf94ef59a76c9c86e7ea016536505");
+    const uint256 b = uint256S("a75b84a125b2353da7e8d96ee2a15efe4de23df9601b9d9564ba59de57130406");
+    uint256 result;
+
+    librustzcash_merkle_hash(25, a.begin(), b.begin(), result.begin());
+
+    uint256 expected_result = uint256S("5bf43b5736c19b714d1f462c9d22ba3492c36e3d9bbd7ca24d94b440550aa561");
+
+    ASSERT_TRUE(result == expected_result);
+}
diff --git a/depend/zcash/src/gtest/test_pow.cpp b/depend/zcash/src/gtest/test_pow.cpp
new file mode 100644
index 000000000..7ee1bf3e4
--- /dev/null
+++ b/depend/zcash/src/gtest/test_pow.cpp
@@ -0,0 +1,125 @@
+#include <gtest/gtest.h>
+
+#include "chain.h"
+#include "chainparams.h"
+#include "pow.h"
+#include "random.h"
+#include "utiltest.h"
+
+void TestDifficultyAveragingImpl(const Consensus::Params& params)
+{
+    size_t lastBlk = 2*params.nPowAveragingWindow;
+    size_t firstBlk = lastBlk - params.nPowAveragingWindow;
+
+    // Start with blocks evenly-spaced and equal difficulty
+    std::vector<CBlockIndex> blocks(lastBlk+1);
+    for (int i = 0; i <= lastBlk; i++) {
+        blocks[i].pprev = i ? &blocks[i - 1] : nullptr;
+        blocks[i].nHeight = i;
+        blocks[i].nTime = i ? blocks[i - 1].nTime + params.PoWTargetSpacing(i) : 1269211443;
+        blocks[i].nBits = 0x1e7fffff; /* target 0x007fffff000... */
+        blocks[i].nChainWork = i ? blocks[i - 1].nChainWork + GetBlockProof(blocks[i - 1]) : arith_uint256(0);
+    }
+
+    // Result should be the same as if last difficulty was used
+    arith_uint256 bnAvg;
+    bnAvg.SetCompact(blocks[lastBlk].nBits);
+    EXPECT_EQ(CalculateNextWorkRequired(bnAvg,
+                                        blocks[lastBlk].GetMedianTimePast(),
+                                        blocks[firstBlk].GetMedianTimePast(),
+                                        params,
+                                        blocks[lastBlk].nHeight + 1),
+              GetNextWorkRequired(&blocks[lastBlk], nullptr, params));
+    // Result should be unchanged, modulo integer division precision loss
+    arith_uint256 bnRes;
+    bnRes.SetCompact(0x1e7fffff);
+    bnRes /= params.AveragingWindowTimespan(blocks[lastBlk].nHeight + 1);
+    bnRes *= params.AveragingWindowTimespan(blocks[lastBlk].nHeight + 1);
+    EXPECT_EQ(bnRes.GetCompact(), GetNextWorkRequired(&blocks[lastBlk], nullptr, params));
+
+    // Randomise the final block time (plus 1 to ensure it is always different)
+    blocks[lastBlk].nTime += GetRand(params.PoWTargetSpacing(blocks[lastBlk].nHeight + 1)/2) + 1;
+
+    // Result should be the same as if last difficulty was used
+    bnAvg.SetCompact(blocks[lastBlk].nBits);
+    EXPECT_EQ(CalculateNextWorkRequired(bnAvg,
+                                        blocks[lastBlk].GetMedianTimePast(),
+                                        blocks[firstBlk].GetMedianTimePast(),
+                                        params,
+                                        blocks[lastBlk].nHeight + 1),
+              GetNextWorkRequired(&blocks[lastBlk], nullptr, params));
+    // Result should not be unchanged
+    EXPECT_NE(0x1e7fffff, GetNextWorkRequired(&blocks[lastBlk], nullptr, params));
+
+    // Change the final block difficulty
+    blocks[lastBlk].nBits = 0x1e0fffff;
+
+    // Result should not be the same as if last difficulty was used
+    bnAvg.SetCompact(blocks[lastBlk].nBits);
+    EXPECT_NE(CalculateNextWorkRequired(bnAvg,
+                                        blocks[lastBlk].GetMedianTimePast(),
+                                        blocks[firstBlk].GetMedianTimePast(),
+                                        params,
+                                        blocks[lastBlk].nHeight + 1),
+              GetNextWorkRequired(&blocks[lastBlk], nullptr, params));
+
+    // Result should be the same as if the average difficulty was used
+    arith_uint256 average = UintToArith256(uint256S("0000796968696969696969696969696969696969696969696969696969696969"));
+    EXPECT_EQ(CalculateNextWorkRequired(average,
+                                        blocks[lastBlk].GetMedianTimePast(),
+                                        blocks[firstBlk].GetMedianTimePast(),
+                                        params,
+                                        blocks[lastBlk].nHeight + 1),
+              GetNextWorkRequired(&blocks[lastBlk], nullptr, params));
+}
+
+TEST(PoW, DifficultyAveraging) {
+    SelectParams(CBaseChainParams::MAIN);
+    TestDifficultyAveragingImpl(Params().GetConsensus());
+}
+
+TEST(PoW, DifficultyAveragingBlossom) {
+    TestDifficultyAveragingImpl(RegtestActivateBlossom(true).GetConsensus());
+    RegtestDeactivateBlossom();
+}
+
+TEST(PoW, MinDifficultyRules) {
+    SelectParams(CBaseChainParams::TESTNET);
+    const Consensus::Params& params = Params().GetConsensus();
+    size_t lastBlk = 2*params.nPowAveragingWindow;
+    size_t firstBlk = lastBlk - params.nPowAveragingWindow;
+
+    // Start with blocks evenly-spaced and equal difficulty
+    std::vector<CBlockIndex> blocks(lastBlk+1);
+    for (int i = 0; i <= lastBlk; i++) {
+        blocks[i].pprev = i ? &blocks[i - 1] : nullptr;
+        blocks[i].nHeight = params.nPowAllowMinDifficultyBlocksAfterHeight.value() + i;
+        blocks[i].nTime = i ? blocks[i - 1].nTime + params.PoWTargetSpacing(i) : 1269211443;
+        blocks[i].nBits = 0x1e7fffff; /* target 0x007fffff000... */
+        blocks[i].nChainWork = i ? blocks[i - 1].nChainWork + GetBlockProof(blocks[i - 1]) : arith_uint256(0);
+    }
+
+    // Create a new block at the target spacing
+    CBlockHeader next;
+    next.nTime = blocks[lastBlk].nTime + params.PoWTargetSpacing(blocks[lastBlk].nHeight + 1);
+
+    // Result should be unchanged, modulo integer division precision loss
+    arith_uint256 bnRes;
+    bnRes.SetCompact(0x1e7fffff);
+    bnRes /= params.AveragingWindowTimespan(blocks[lastBlk].nHeight + 1);
+    bnRes *= params.AveragingWindowTimespan(blocks[lastBlk].nHeight + 1);
+    EXPECT_EQ(GetNextWorkRequired(&blocks[lastBlk], &next, params), bnRes.GetCompact());
+
+    // Delay last block up to the edge of the min-difficulty limit
+    next.nTime += params.PoWTargetSpacing(blocks[lastBlk].nHeight + 1) * 5;
+
+    // Result should be unchanged, modulo integer division precision loss
+    EXPECT_EQ(GetNextWorkRequired(&blocks[lastBlk], &next, params), bnRes.GetCompact());
+
+    // Delay last block over the min-difficulty limit
+    next.nTime += 1;
+
+    // Result should be the minimum difficulty
+    EXPECT_EQ(GetNextWorkRequired(&blocks[lastBlk], &next, params),
+              UintToArith256(params.powLimit).GetCompact());
+}
diff --git a/depend/zcash/src/gtest/test_random.cpp b/depend/zcash/src/gtest/test_random.cpp
new file mode 100644
index 000000000..9ae2a6d82
--- /dev/null
+++ b/depend/zcash/src/gtest/test_random.cpp
@@ -0,0 +1,33 @@
+#include <gtest/gtest.h>
+
+#include "random.h"
+#include "gtest/utils.h"
+
+TEST(Random, MappedShuffle) {
+    std::vector<int> a {8, 4, 6, 3, 5};
+    std::vector<int> m {0, 1, 2, 3, 4};
+
+    auto a1 = a;
+    auto m1 = m;
+    MappedShuffle(a1.begin(), m1.begin(), a1.size(), GenZero);
+    std::vector<int> ea1 {4, 6, 3, 5, 8};
+    std::vector<int> em1 {1, 2, 3, 4, 0};
+    EXPECT_EQ(ea1, a1);
+    EXPECT_EQ(em1, m1);
+
+    auto a2 = a;
+    auto m2 = m;
+    MappedShuffle(a2.begin(), m2.begin(), a2.size(), GenMax);
+    std::vector<int> ea2 {8, 4, 6, 3, 5};
+    std::vector<int> em2 {0, 1, 2, 3, 4};
+    EXPECT_EQ(ea2, a2);
+    EXPECT_EQ(em2, m2);
+
+    auto a3 = a;
+    auto m3 = m;
+    MappedShuffle(a3.begin(), m3.begin(), a3.size(), GenIdentity);
+    std::vector<int> ea3 {8, 4, 6, 3, 5};
+    std::vector<int> em3 {0, 1, 2, 3, 4};
+    EXPECT_EQ(ea3, a3);
+    EXPECT_EQ(em3, m3);
+}
diff --git a/depend/zcash/src/gtest/test_rpc.cpp b/depend/zcash/src/gtest/test_rpc.cpp
new file mode 100644
index 000000000..bf2f0f090
--- /dev/null
+++ b/depend/zcash/src/gtest/test_rpc.cpp
@@ -0,0 +1,109 @@
+#include <gtest/gtest.h>
+#include <univalue.h>
+
+#include "chain.h"
+#include "chainparams.h"
+#include "clientversion.h"
+#include "main.h"
+#include "primitives/block.h"
+#include "rpc/server.h"
+#include "streams.h"
+#include "utilstrencodings.h"
+
+extern UniValue blockToJSON(const CBlock& block, const CBlockIndex* blockindex, bool txDetails = false);
+
+TEST(rpc, CheckBlockToJSONReturnsMinifiedSolution) {
+    SelectParams(CBaseChainParams::TESTNET);
+
+    // Testnet block 006a87f9f91c1f51c7549e2c8965c0fd4fe8c212798f932efc54dc7bccbec780
+    // Height 1391
+    CDataStream ss(ParseHex("0400000077be515306e347c6856686d83a229169140a2f7e17281c8319ecf00c49bb6f00994ca400914d6733295faf4e0063998e75a18aae7d39b5244d88d082c13145070000000000000000000000000000000000000000000000000000000000000000ae71c25700737b1f010090f8a62f53105d6b6f173d242fbbf54b0c1024a64520f0020e47fe710000fd4005009f44ff7505d789b964d6817734b8ce1377d456255994370d06e59ac99bd5791b6ad174a66fd71c70e60cfc7fd88243ffe06f80b1ad181625f210779c745524629448e25348a5fce4f346a1735e60fdf53e144c0157dbc47c700a21a236f1efb7ee75f65b8d9d9e29026cfd09048233175202b211b9a49de4ab46f1cac71b6ea57a686377bd612378746e70c61a659c9cd683269e9c2a5cbc1d19f1149345302bbd0a1e62bf4bab01e9caeea789a1519441a61b146de35a4cc75dbdf01029127e311ad5073e7e96397f47226a7df9df66b2086b70756db013bbaeb068260157014b2602fc7dc71336e1439c887d2742d9730b4e79b08ec7839c3e2a037ae1565d04e05e351bb3531e5ef42cf7b71ca1482a9205245dd41f4db0f71644f8bdb88e845558537c03834c06ac83f336651e54e2edfc12e15ea9b7ea2c074e6155654d44c4d3bd90d9511050e9ad87d170db01448e5be6f45419cd86008978db5e3ceab79890234f992648d69bf1053855387db646ccdee5575c65f81dd0f670b016d9f9a84707d91f77b862f697b8bb08365ba71fbe6bfa47af39155a75ebdcb1e5d69f59c40c9e3a64988c1ec26f7f5159eef5c244d504a9e46125948ecc389c2ec3028ac4ff39ffd66e7743970819272b21e0c2df75b308bc62896873952147e57ed79446db4cdb5a563e76ec4c25899d41128afb9a5f8fc8063621efb7a58b9dd666d30c73e318cdcf3393bfec200e160f500e645f7baac263db99fa4a7c1cb4fea219fc512193102034d379f244c21a81821301b8d47c90247713a3e902c762d7bafa6cdb744eeb6d3b50dd175599d02b6e9f5bbda59366e04862aa765135968426e7ac0116de7351940dc57c0ae451d63f667e39891bc81e09e6c76f6f8a7582f7447c6f5945f717b0e52a7e3dd0c6db4061362123cc53fd8ede4abed4865201dc4d8eb4e5d48baa565183b69a5304a44c0600bb24dcaeee9d95ceebd27c1b0a33e0b46f23797d7d7907300b2bb7d62ef2fc5aa139250c73930c621bb5f41fc235534ee8014dfaddd5245aeb01198420ba7b5c076545329c94d54fa725a8e807579f5f0cc9d98170598023268f5930893620190275e6b3c6f5181e36310a9a475208316911d78f917d724c5946c553b7ec042c563c540114b6b78bd4c6e808ee391a4a9d93e127032983c5b3708037b14aa604cfb034e7c8b0ffdd6936446fe80216178506a87402653a373926eeff66e704daf992a0a9a5c3ad80566c0339be9e5b8e35b3b3226b2f7767e20d992ea6c3d6e322eca37b0c7f7e60060802f5abcc1975841365cadbdc3867063addfc803766ae525375ecddee61f9df9ffcd20343c83ab82b0e91de039c59cb435c8d3159cc338b4901f40c9b5c27043bcf2bd5fa9b685b65c9ba5a1e11a51dd3f773051560341f9ec81d05bf259e2d4b7161f896fbb6812cfc924a32120b7367d5e40439e267adda6a1315bb0d6200ce6a503174c8d2a638ea6fd6b1f486d68db11bdca63c4f4a725d1ab6231ea875484e70b27d293c05803386924f283d4c12bb953474d92b7dd43d2d97193bd96281ebb63fa075d2f9ecd310c70ee1d97b5330bd8fb5791c5943ecf084e5f2c83915acac57519c46b166136068d6f9ec0dd598616e32c591128ce13705a283ca39d5b211409600e07b3713113374d9700207a45394eac5b3b7afc9b1b2bad7d89fd3f35f6b2413ce615ee7869b3569009403b96fdacdb32ef0a7e5229e2b666d51e95bdfb009b892e88bde70621a9b6509f068781392df4bdbc5723bb15071993f0d9a11575af5ff6ef85eaea39bc86805b35d8beee91b779354147f2d85304b8b49d053e7444fdd3deb9d16de331f2552af5b3be7766bb8f3f6a78c62148efb231f22680101000000010000000000000000000000000000000000000000000000000000000000000000ffffffff05026f050101ffffffff02b03f250400000000232103885e6a80a5702046eb76c4702921b75858fc633df3cddff827cf7b3602e45cbdacec4f09010000000017a9146708e6670db0b950dac68031025cc5b63213a4918700000000"), SER_DISK, CLIENT_VERSION);
+    CBlock block;
+    ss >> block;
+
+    CBlockIndex index {block};
+    index.nHeight = 1391;
+
+    LOCK(cs_main);
+    UniValue obj = blockToJSON(block, &index);
+    EXPECT_EQ("009f44ff7505d789b964d6817734b8ce1377d456255994370d06e59ac99bd5791b6ad174a66fd71c70e60cfc7fd88243ffe06f80b1ad181625f210779c745524629448e25348a5fce4f346a1735e60fdf53e144c0157dbc47c700a21a236f1efb7ee75f65b8d9d9e29026cfd09048233175202b211b9a49de4ab46f1cac71b6ea57a686377bd612378746e70c61a659c9cd683269e9c2a5cbc1d19f1149345302bbd0a1e62bf4bab01e9caeea789a1519441a61b146de35a4cc75dbdf01029127e311ad5073e7e96397f47226a7df9df66b2086b70756db013bbaeb068260157014b2602fc7dc71336e1439c887d2742d9730b4e79b08ec7839c3e2a037ae1565d04e05e351bb3531e5ef42cf7b71ca1482a9205245dd41f4db0f71644f8bdb88e845558537c03834c06ac83f336651e54e2edfc12e15ea9b7ea2c074e6155654d44c4d3bd90d9511050e9ad87d170db01448e5be6f45419cd86008978db5e3ceab79890234f992648d69bf1053855387db646ccdee5575c65f81dd0f670b016d9f9a84707d91f77b862f697b8bb08365ba71fbe6bfa47af39155a75ebdcb1e5d69f59c40c9e3a64988c1ec26f7f5159eef5c244d504a9e46125948ecc389c2ec3028ac4ff39ffd66e7743970819272b21e0c2df75b308bc62896873952147e57ed79446db4cdb5a563e76ec4c25899d41128afb9a5f8fc8063621efb7a58b9dd666d30c73e318cdcf3393bfec200e160f500e645f7baac263db99fa4a7c1cb4fea219fc512193102034d379f244c21a81821301b8d47c90247713a3e902c762d7bafa6cdb744eeb6d3b50dd175599d02b6e9f5bbda59366e04862aa765135968426e7ac0116de7351940dc57c0ae451d63f667e39891bc81e09e6c76f6f8a7582f7447c6f5945f717b0e52a7e3dd0c6db4061362123cc53fd8ede4abed4865201dc4d8eb4e5d48baa565183b69a5304a44c0600bb24dcaeee9d95ceebd27c1b0a33e0b46f23797d7d7907300b2bb7d62ef2fc5aa139250c73930c621bb5f41fc235534ee8014dfaddd5245aeb01198420ba7b5c076545329c94d54fa725a8e807579f5f0cc9d98170598023268f5930893620190275e6b3c6f5181e36310a9a475208316911d78f917d724c5946c553b7ec042c563c540114b6b78bd4c6e808ee391a4a9d93e127032983c5b3708037b14aa604cfb034e7c8b0ffdd6936446fe80216178506a87402653a373926eeff66e704daf992a0a9a5c3ad80566c0339be9e5b8e35b3b3226b2f7767e20d992ea6c3d6e322eca37b0c7f7e60060802f5abcc1975841365cadbdc3867063addfc803766ae525375ecddee61f9df9ffcd20343c83ab82b0e91de039c59cb435c8d3159cc338b4901f40c9b5c27043bcf2bd5fa9b685b65c9ba5a1e11a51dd3f773051560341f9ec81d05bf259e2d4b7161f896fbb6812cfc924a32120b7367d5e40439e267adda6a1315bb0d6200ce6a503174c8d2a638ea6fd6b1f486d68db11bdca63c4f4a725d1ab6231ea875484e70b27d293c05803386924f283d4c12bb953474d92b7dd43d2d97193bd96281ebb63fa075d2f9ecd310c70ee1d97b5330bd8fb5791c5943ecf084e5f2c83915acac57519c46b166136068d6f9ec0dd598616e32c591128ce13705a283ca39d5b211409600e07b3713113374d9700207a45394eac5b3b7afc9b1b2bad7d89fd3f35f6b2413ce615ee7869b3569009403b96fdacdb32ef0a7e5229e2b666d51e95bdfb009b892e88bde70621a9b6509f068781392df4bdbc5723bb15071993f0d9a11575af5ff6ef85eaea39bc86805b35d8beee91b779354147f2d85304b8b49d053e7444fdd3deb9d16de331f2552af5b3be7766bb8f3f6a78c62148efb231f2268", find_value(obj, "solution").get_str());
+}
+
+TEST(rpc, CheckExperimentalDisabledHelpMsg) {
+
+    EXPECT_EQ(experimentalDisabledHelpMsg("somerpc", {"somevalue"}),
+        "\nWARNING: somerpc is disabled.\n"
+        "To enable it, restart zcashd with the following command line options:\n"
+        "-experimentalfeatures and -somevalue\n\n"
+        "Alternatively add these two lines to the zcash.conf file:\n\n"
+        "experimentalfeatures=1\n"
+        "somevalue=1\n");
+
+    EXPECT_EQ(experimentalDisabledHelpMsg("somerpc", {"somevalue", "someothervalue"}),
+        "\nWARNING: somerpc is disabled.\n"
+        "To enable it, restart zcashd with the following command line options:\n"
+        "-experimentalfeatures and -somevalue"
+        " or:\n-experimentalfeatures and -someothervalue"
+        "\n\n"
+        "Alternatively add these two lines to the zcash.conf file:\n\n"
+        "experimentalfeatures=1\n"
+        "somevalue=1\n"
+        "\nor:\n\n"
+        "experimentalfeatures=1\n"
+        "someothervalue=1\n");
+
+    EXPECT_EQ(experimentalDisabledHelpMsg("somerpc", {"somevalue", "someothervalue", "athirdvalue"}),
+        "\nWARNING: somerpc is disabled.\n"
+        "To enable it, restart zcashd with the following command line options:\n"
+        "-experimentalfeatures and -somevalue"
+        " or:\n-experimentalfeatures and -someothervalue"
+        " or:\n-experimentalfeatures and -athirdvalue"
+         "\n\n"
+        "Alternatively add these two lines to the zcash.conf file:\n\n"
+        "experimentalfeatures=1\n"
+        "somevalue=1\n"
+        "\nor:\n\n"
+        "experimentalfeatures=1\n"
+        "someothervalue=1\n"
+        "\nor:\n\n"
+        "experimentalfeatures=1\n"
+        "athirdvalue=1\n");
+}
+
+TEST(rpc, ParseHeightArg) {
+    EXPECT_EQ(parseHeightArg("15", 21), 15);
+    EXPECT_EQ(parseHeightArg("21", 21), 21);
+    ASSERT_THROW(parseHeightArg("22", 21), UniValue);
+    EXPECT_EQ(parseHeightArg("0", 21), 0);
+    EXPECT_EQ(parseHeightArg("011", 21), 11); // allowed and parsed as decimal, not octal
+
+    // negative values count back from current height
+    EXPECT_EQ(parseHeightArg("-1", 21), 21);
+    EXPECT_EQ(parseHeightArg("-2", 21), 20);
+    EXPECT_EQ(parseHeightArg("-22", 21), 0);
+    ASSERT_THROW(parseHeightArg("-23", 21), UniValue);
+    ASSERT_THROW(parseHeightArg("-0", 21), UniValue);
+
+    // currentHeight zero
+    EXPECT_EQ(parseHeightArg("0", 0), 0);
+    EXPECT_EQ(parseHeightArg("-1", 0), 0);
+
+    // maximum possible height, just beyond, far beyond
+    EXPECT_EQ(parseHeightArg("2147483647", 2147483647), 2147483647);
+    ASSERT_THROW(parseHeightArg("2147483648", 2147483647), UniValue);
+    ASSERT_THROW(parseHeightArg("999999999999999999999999999999999999999", 21), UniValue);
+
+    // disallowed characters and formats
+    ASSERT_THROW(parseHeightArg("5.21", 21), UniValue);
+    ASSERT_THROW(parseHeightArg("5.0", 21), UniValue);
+    ASSERT_THROW(parseHeightArg("a21", 21), UniValue);
+    ASSERT_THROW(parseHeightArg(" 21", 21), UniValue);
+    ASSERT_THROW(parseHeightArg("21 ", 21), UniValue);
+    ASSERT_THROW(parseHeightArg("21x", 21), UniValue);
+    ASSERT_THROW(parseHeightArg("+21", 21), UniValue);
+    ASSERT_THROW(parseHeightArg("0x15", 21), UniValue);
+    ASSERT_THROW(parseHeightArg("-0", 21), UniValue);
+    ASSERT_THROW(parseHeightArg("-01", 21), UniValue);
+    ASSERT_THROW(parseHeightArg("-0x15", 21), UniValue);
+    ASSERT_THROW(parseHeightArg("", 21), UniValue);
+}
diff --git a/depend/zcash/src/gtest/test_sapling_note.cpp b/depend/zcash/src/gtest/test_sapling_note.cpp
new file mode 100644
index 000000000..5eeb2fa83
--- /dev/null
+++ b/depend/zcash/src/gtest/test_sapling_note.cpp
@@ -0,0 +1,72 @@
+#include <gtest/gtest.h>
+
+#include "zcash/Address.hpp"
+#include "zcash/Note.hpp"
+
+#include "amount.h"
+#include "random.h"
+#include "librustzcash.h"
+
+#include <array>
+
+using namespace libzcash;
+
+// Test data from https://github.com/zcash-hackworks/zcash-test-vectors/blob/master/sapling_key_components.py
+TEST(SaplingNote, TestVectors)
+{
+    uint64_t v = 0;
+    uint64_t note_pos = 0;
+    std::array<uint8_t, 11> diversifier{0xf1, 0x9d, 0x9b, 0x79, 0x7e, 0x39, 0xf3, 0x37, 0x44, 0x58, 0x39};
+    std::vector<uint8_t> v_sk{
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00};
+    std::vector<uint8_t> v_pk_d{
+        0xdb, 0x4c, 0xd2, 0xb0, 0xaa, 0xc4, 0xf7, 0xeb, 0x8c, 0xa1, 0x31, 0xf1, 0x65, 0x67,
+        0xc4, 0x45, 0xa9, 0x55, 0x51, 0x26, 0xd3, 0xc2, 0x9f, 0x14, 0xe3, 0xd7, 0x76, 0xe8,
+        0x41, 0xae, 0x74, 0x15};
+    std::vector<uint8_t> v_r{
+        0x39, 0x17, 0x6d, 0xac, 0x39, 0xac, 0xe4, 0x98, 0x0e, 0xcc, 0x8d, 0x77, 0x8e, 0x89,
+        0x86, 0x02, 0x55, 0xec, 0x36, 0x15, 0x06, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00};
+    std::vector<uint8_t> v_cm{
+        0xcb, 0x3c, 0xf9, 0x15, 0x32, 0x70, 0xd5, 0x7e, 0xb9, 0x14, 0xc6, 0xc2, 0xbc, 0xc0,
+        0x18, 0x50, 0xc9, 0xfe, 0xd4, 0x4f, 0xce, 0x08, 0x06, 0x27, 0x8f, 0x08, 0x3e, 0xf2,
+        0xdd, 0x07, 0x64, 0x39};
+    std::vector<uint8_t> v_nf{
+        0x44, 0xfa, 0xd6, 0x56, 0x4f, 0xfd, 0xec, 0x9f, 0xa1, 0x9c, 0x43, 0xa2, 0x8f, 0x86,
+        0x1d, 0x5e, 0xbf, 0x60, 0x23, 0x46, 0x00, 0x7d, 0xe7, 0x62, 0x67, 0xd9, 0x75, 0x27,
+        0x47, 0xab, 0x40, 0x63};
+    uint256 sk(v_sk);
+    uint256 pk_d(v_pk_d);
+    uint256 r(v_r);
+    uint256 cm(v_cm);
+    uint256 nf(v_nf);
+
+    // Test commitment
+    SaplingNote note = SaplingNote(diversifier, pk_d, v, r, Zip212Enabled::BeforeZip212);
+    ASSERT_EQ(note.cmu().value(), cm);
+
+    // Test nullifier
+    SaplingSpendingKey spendingKey(sk);
+    ASSERT_EQ(note.nullifier(spendingKey.full_viewing_key(), note_pos), nf);
+}
+
+
+TEST(SaplingNote, Random)
+{
+    // Test creating random notes using the same spending key
+    auto address = SaplingSpendingKey::random().default_address();
+    SaplingNote note1(address, GetRand(MAX_MONEY), Zip212Enabled::BeforeZip212);
+    SaplingNote note2(address, GetRand(MAX_MONEY), Zip212Enabled::BeforeZip212);
+
+    ASSERT_EQ(note1.d, note2.d);
+    ASSERT_EQ(note1.pk_d, note2.pk_d);
+    ASSERT_NE(note1.value(), note2.value());
+    ASSERT_NE(note1.rcm(), note2.rcm());
+
+    // Test diversifier and pk_d are not the same for different spending keys
+    SaplingNote note3(SaplingSpendingKey::random().default_address(), GetRand(MAX_MONEY), Zip212Enabled::BeforeZip212);
+    ASSERT_NE(note1.d, note3.d);
+    ASSERT_NE(note1.pk_d, note3.pk_d);
+}
diff --git a/depend/zcash/src/gtest/test_sighash.cpp b/depend/zcash/src/gtest/test_sighash.cpp
new file mode 100644
index 000000000..3c4b6bcae
--- /dev/null
+++ b/depend/zcash/src/gtest/test_sighash.cpp
@@ -0,0 +1,129 @@
+#include <gtest/gtest.h>
+
+#include "random.h"
+#include "script/interpreter.h"
+#include "script/standard.h"
+
+static std::pair<CMutableTransaction, std::vector<CTxOut>> DummyV5Transaction() {
+    auto key = CKey::TestOnlyRandomKey(true);
+    auto scriptPubKey = GetScriptForDestination(key.GetPubKey().GetID());
+
+    // Create a fake pair of coins to spend.
+    std::vector<CTxOut> allPrevOutputs;
+    allPrevOutputs.resize(2);
+    allPrevOutputs[0].nValue = 1000;
+    allPrevOutputs[0].scriptPubKey = scriptPubKey;
+    allPrevOutputs[1].nValue = 2000;
+    allPrevOutputs[1].scriptPubKey = scriptPubKey;
+
+    // Create a fake 2-in 2-out transaction.
+    CMutableTransaction mtx;
+    mtx.fOverwintered = true;
+    mtx.nVersionGroupId = ZIP225_VERSION_GROUP_ID;
+    mtx.nVersion = ZIP225_TX_VERSION;
+    mtx.nConsensusBranchId = NetworkUpgradeInfo[Consensus::UPGRADE_NU5].nBranchId;
+    mtx.vin.resize(allPrevOutputs.size());
+    mtx.vin[0].prevout.hash = GetRandHash();
+    mtx.vin[0].prevout.n = 0;
+    mtx.vin[0].prevout.hash = GetRandHash();
+    mtx.vin[0].prevout.n = 7;
+    mtx.vout.resize(2);
+    mtx.vout[0].nValue = 1500;
+    mtx.vout[0].scriptPubKey = scriptPubKey;
+    mtx.vout[1].nValue = 1500;
+    mtx.vout[1].scriptPubKey = scriptPubKey;
+
+    return std::make_pair(mtx, allPrevOutputs);
+}
+
+TEST(SigHashTest, Zip244AcceptsKnownHashTypes) {
+    auto parts = DummyV5Transaction();
+    auto mtx = parts.first;
+    auto allPrevOutputs = parts.second;
+
+    unsigned int nIn = 1;
+    PrecomputedTransactionData txdata(mtx, allPrevOutputs);
+    // These aren't used for ZIP 244 sighashes.
+    CScript scriptCode;
+    CAmount amount;
+    uint32_t consensusBranchId;
+
+    // Nothing should be thrown for known sighash types.
+    std::vector<uint8_t> knownSighashTypes {
+        SIGHASH_ALL,
+        SIGHASH_SINGLE,
+        SIGHASH_NONE,
+        SIGHASH_ANYONECANPAY | SIGHASH_ALL,
+        SIGHASH_ANYONECANPAY | SIGHASH_SINGLE,
+        SIGHASH_ANYONECANPAY | SIGHASH_NONE,
+    };
+    for (auto nHashType : knownSighashTypes) {
+        EXPECT_NO_THROW(SignatureHash(
+            scriptCode, mtx, nIn, nHashType, amount, consensusBranchId, txdata));
+    }
+}
+
+TEST(SigHashTest, Zip244RejectsUnknownHashTypes) {
+    auto parts = DummyV5Transaction();
+    auto mtx = parts.first;
+    auto allPrevOutputs = parts.second;
+
+    unsigned int nIn = 1;
+    PrecomputedTransactionData txdata(mtx, allPrevOutputs);
+    // These aren't used for ZIP 244 sighashes.
+    CScript scriptCode;
+    CAmount amount;
+    uint32_t consensusBranchId;
+
+    // An error should be thrown for unknown sighash types.
+    std::vector<uint8_t> unknownSighashTypes {
+        0, // Known in BIP 341, unknown in ZIP 244.
+        SIGHASH_SINGLE + 1,
+        0x7f,
+        0xff,
+    };
+    for (auto nHashType : unknownSighashTypes) {
+        EXPECT_THROW(
+            SignatureHash(scriptCode, mtx, nIn, nHashType, amount, consensusBranchId, txdata),
+            std::logic_error);
+    }
+}
+
+TEST(SigHashTest, Zip244RejectsSingleWithoutCorrespondingOutput) {
+    auto parts = DummyV5Transaction();
+    auto mtx = parts.first;
+    auto allPrevOutputs = parts.second;
+
+    // Modify the transaction to have only 1 output.
+    mtx.vout.resize(1);
+
+    unsigned int nIn = 1;
+    PrecomputedTransactionData txdata(mtx, allPrevOutputs);
+    // These aren't used for ZIP 244 sighashes.
+    CScript scriptCode;
+    CAmount amount;
+    uint32_t consensusBranchId;
+
+    // Nothing should be thrown for non-single sighash types.
+    std::vector<uint8_t> nonSighashSingleTypes {
+        SIGHASH_ALL,
+        SIGHASH_NONE,
+        SIGHASH_ANYONECANPAY | SIGHASH_ALL,
+        SIGHASH_ANYONECANPAY | SIGHASH_NONE,
+    };
+    for (auto nHashType : nonSighashSingleTypes) {
+        EXPECT_NO_THROW(SignatureHash(
+            scriptCode, mtx, nIn, nHashType, amount, consensusBranchId, txdata));
+    }
+
+    // SIGHASH_SINGLE types should throw an error.
+    std::vector<uint8_t> sighashSingleTypes {
+        SIGHASH_SINGLE,
+        SIGHASH_ANYONECANPAY | SIGHASH_SINGLE,
+    };
+    for (auto nHashType : sighashSingleTypes) {
+        EXPECT_THROW(
+            SignatureHash(scriptCode, mtx, nIn, nHashType, amount, consensusBranchId, txdata),
+            std::logic_error);
+    }
+}
diff --git a/depend/zcash/src/gtest/test_tautology.cpp b/depend/zcash/src/gtest/test_tautology.cpp
new file mode 100644
index 000000000..45ab14f7f
--- /dev/null
+++ b/depend/zcash/src/gtest/test_tautology.cpp
@@ -0,0 +1,10 @@
+#include <gtest/gtest.h>
+
+TEST(tautologies, SevenEqSeven) {
+    ASSERT_EQ(7, 7);
+}
+
+TEST(tautologies, DISABLED_ObviousFailure)
+{
+    FAIL() << "This is expected";
+}
diff --git a/depend/zcash/src/gtest/test_timedata.cpp b/depend/zcash/src/gtest/test_timedata.cpp
new file mode 100644
index 000000000..4cd6135f8
--- /dev/null
+++ b/depend/zcash/src/gtest/test_timedata.cpp
@@ -0,0 +1,100 @@
+// Copyright (c) 2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include <gtest/gtest.h>
+#include <gmock/gmock.h>
+
+#include "timedata.h"
+#include "random.h"
+#include "netbase.h"
+#include "utiltime.h"
+
+using ::testing::StrictMock;
+
+class MockCTimeWarning : public CTimeWarning
+{
+public:
+    MOCK_METHOD2(Warn, void(size_t, size_t));
+};
+
+CNetAddr GetUniqueAddr() {
+    uint8_t buf[16] = { 0xFD }; // RFC 4193 address in FC00::/7 with L = 1 (locally assigned)
+    GetRandBytes(&buf[1], 15);
+    CNetAddr ip;
+    ip.SetRaw(NET_IPV6, buf);
+    assert(ip.IsRFC4193());
+    return ip;
+}
+
+TEST(TimeWarning, Assertions)
+{
+    StrictMock<MockCTimeWarning> tw;
+    EXPECT_DEATH(tw.AddTimeData(GetUniqueAddr(), 0, INT64_MIN), "");
+    EXPECT_DEATH(tw.AddTimeData(GetUniqueAddr(), 0, -1), "");
+    EXPECT_DEATH(tw.AddTimeData(GetUniqueAddr(), 0, INT64_MAX - CTimeWarning::TIMEDATA_IGNORE_THRESHOLD + 1), "");
+    EXPECT_DEATH(tw.AddTimeData(GetUniqueAddr(), 0, INT64_MAX), "");
+}
+
+TEST(TimeWarning, NoWarning)
+{
+    StrictMock<MockCTimeWarning> tw;
+    int64_t now = GetTime();
+
+    EXPECT_CALL(tw, Warn(CTimeWarning::TIMEDATA_WARNING_SAMPLES, 0)).Times(0);
+
+    tw.AddTimeData(GetUniqueAddr(), now - CTimeWarning::TIMEDATA_IGNORE_THRESHOLD, now);
+    tw.AddTimeData(GetUniqueAddr(), now + CTimeWarning::TIMEDATA_IGNORE_THRESHOLD, now);
+    tw.AddTimeData(GetUniqueAddr(), now - CTimeWarning::TIMEDATA_WARNING_THRESHOLD, now);
+    tw.AddTimeData(GetUniqueAddr(), now + CTimeWarning::TIMEDATA_WARNING_THRESHOLD, now);
+
+    for (size_t i = 0; i < CTimeWarning::TIMEDATA_WARNING_SAMPLES - 2; i++) {
+        tw.AddTimeData(GetUniqueAddr(), now + CTimeWarning::TIMEDATA_WARNING_THRESHOLD + 1, now);
+    }
+    CNetAddr duplicateIp = GetUniqueAddr();
+    for (size_t i = 0; i < 2; i++) {
+        tw.AddTimeData(duplicateIp, now + CTimeWarning::TIMEDATA_WARNING_THRESHOLD + 1, now);
+    }
+}
+
+TEST(TimeWarning, PeersAhead)
+{
+    StrictMock<MockCTimeWarning> tw;
+    int64_t now = GetTime();
+
+    EXPECT_CALL(tw, Warn(CTimeWarning::TIMEDATA_WARNING_SAMPLES, 0));
+
+    for (size_t i = 0; i < CTimeWarning::TIMEDATA_WARNING_SAMPLES - 1; i++) {
+        tw.AddTimeData(GetUniqueAddr(), now + CTimeWarning::TIMEDATA_WARNING_THRESHOLD + 1, now);
+    }
+    tw.AddTimeData(GetUniqueAddr(), now + CTimeWarning::TIMEDATA_IGNORE_THRESHOLD - 1, now);
+}
+
+TEST(TimeWarning, PeersBehind)
+{
+    StrictMock<MockCTimeWarning> tw;
+    int64_t now = GetTime();
+
+    EXPECT_CALL(tw, Warn(0, CTimeWarning::TIMEDATA_WARNING_SAMPLES));
+
+    for (size_t i = 0; i < CTimeWarning::TIMEDATA_WARNING_SAMPLES - 1; i++) {
+        tw.AddTimeData(GetUniqueAddr(), now - CTimeWarning::TIMEDATA_WARNING_THRESHOLD - 1, now);
+    }
+    tw.AddTimeData(GetUniqueAddr(), now - CTimeWarning::TIMEDATA_IGNORE_THRESHOLD + 1, now);
+}
+
+TEST(TimeWarning, PeersMixed)
+{
+    StrictMock<MockCTimeWarning> tw;
+    int64_t now = GetTime();
+
+    EXPECT_CALL(tw, Warn(CTimeWarning::TIMEDATA_WARNING_SAMPLES/2, (CTimeWarning::TIMEDATA_WARNING_SAMPLES+1)/2));
+
+    for (size_t i = 0; i < CTimeWarning::TIMEDATA_WARNING_SAMPLES/2; i++) {
+        tw.AddTimeData(GetUniqueAddr(), now + CTimeWarning::TIMEDATA_WARNING_THRESHOLD + 1, now);
+    }
+    for (size_t i = 0; i < (CTimeWarning::TIMEDATA_WARNING_SAMPLES-1)/2; i++) {
+        tw.AddTimeData(GetUniqueAddr(), now - CTimeWarning::TIMEDATA_WARNING_THRESHOLD - 1, now);
+    }
+    tw.AddTimeData(GetUniqueAddr(), now - CTimeWarning::TIMEDATA_IGNORE_THRESHOLD + 1, now);
+}
diff --git a/depend/zcash/src/gtest/test_transaction.cpp b/depend/zcash/src/gtest/test_transaction.cpp
new file mode 100644
index 000000000..66fe58ea5
--- /dev/null
+++ b/depend/zcash/src/gtest/test_transaction.cpp
@@ -0,0 +1,93 @@
+#include <gtest/gtest.h>
+
+#include "gtest/utils.h"
+#include "primitives/transaction.h"
+#include "transaction_builder.h"
+#include "zcash/Note.hpp"
+#include "zcash/Address.hpp"
+
+#include <array>
+
+#include <rust/ed25519/types.h>
+
+TEST(Transaction, JSDescriptionRandomized) {
+    // construct a merkle tree
+    SproutMerkleTree merkleTree;
+
+    libzcash::SproutSpendingKey k = libzcash::SproutSpendingKey::random();
+    libzcash::SproutPaymentAddress addr = k.address();
+
+    libzcash::SproutNote note(addr.a_pk, 100, uint256(), uint256());
+
+    // commitment from coin
+    uint256 commitment = note.cm();
+
+    // insert commitment into the merkle tree
+    merkleTree.append(commitment);
+
+    // compute the merkle root we will be working with
+    uint256 rt = merkleTree.root();
+
+    auto witness = merkleTree.witness();
+
+    // create JSDescription
+    Ed25519VerificationKey joinSplitPubKey;
+    std::array<libzcash::JSInput, ZC_NUM_JS_INPUTS> inputs = {
+        libzcash::JSInput(witness, note, k),
+        libzcash::JSInput() // dummy input of zero value
+    };
+    std::array<libzcash::JSOutput, ZC_NUM_JS_OUTPUTS> outputs = {
+        libzcash::JSOutput(addr, 50),
+        libzcash::JSOutput(addr, 50)
+    };
+    std::array<size_t, ZC_NUM_JS_INPUTS> inputMap;
+    std::array<size_t, ZC_NUM_JS_OUTPUTS> outputMap;
+
+    {
+        auto jsdesc = JSDescriptionInfo(
+            joinSplitPubKey, rt,
+            inputs, outputs,
+            0, 0
+        ).BuildRandomized(
+            inputMap, outputMap,
+            false);
+
+        std::set<size_t> inputSet(inputMap.begin(), inputMap.end());
+        std::set<size_t> expectedInputSet {0, 1};
+        EXPECT_EQ(expectedInputSet, inputSet);
+
+        std::set<size_t> outputSet(outputMap.begin(), outputMap.end());
+        std::set<size_t> expectedOutputSet {0, 1};
+        EXPECT_EQ(expectedOutputSet, outputSet);
+    }
+
+    {
+        auto jsdesc = JSDescriptionInfo(
+            joinSplitPubKey, rt,
+            inputs, outputs,
+            0, 0
+        ).BuildRandomized(
+            inputMap, outputMap,
+            false, nullptr, GenZero);
+
+        std::array<size_t, ZC_NUM_JS_INPUTS> expectedInputMap {1, 0};
+        std::array<size_t, ZC_NUM_JS_OUTPUTS> expectedOutputMap {1, 0};
+        EXPECT_EQ(expectedInputMap, inputMap);
+        EXPECT_EQ(expectedOutputMap, outputMap);
+    }
+
+    {
+        auto jsdesc = JSDescriptionInfo(
+            joinSplitPubKey, rt,
+            inputs, outputs,
+            0, 0
+        ).BuildRandomized(
+            inputMap, outputMap,
+            false, nullptr, GenMax);
+
+        std::array<size_t, ZC_NUM_JS_INPUTS> expectedInputMap {0, 1};
+        std::array<size_t, ZC_NUM_JS_OUTPUTS> expectedOutputMap {0, 1};
+        EXPECT_EQ(expectedInputMap, inputMap);
+        EXPECT_EQ(expectedOutputMap, outputMap);
+    }
+}
diff --git a/depend/zcash/src/gtest/test_transaction_builder.cpp b/depend/zcash/src/gtest/test_transaction_builder.cpp
new file mode 100644
index 000000000..fe0faa4bb
--- /dev/null
+++ b/depend/zcash/src/gtest/test_transaction_builder.cpp
@@ -0,0 +1,505 @@
+#include "chainparams.h"
+#include "consensus/params.h"
+#include "consensus/consensus.h"
+#include "consensus/validation.h"
+#include "key_io.h"
+#include "main.h"
+#include "pubkey.h"
+#include "rpc/protocol.h"
+#include "transaction_builder.h"
+#include "gtest/test_transaction_builder.h"
+#include "gtest/utils.h"
+#include "utiltest.h"
+#include "zcash/Address.hpp"
+#include "zcash/address/mnemonic.h"
+
+#include <optional>
+
+#include <gmock/gmock.h>
+#include <gtest/gtest.h>
+
+TEST(TransactionBuilder, TransparentToSapling)
+{
+    LoadProofParameters();
+
+    auto consensusParams = RegtestActivateSapling();
+
+    CBasicKeyStore keystore;
+    CKey tsk = AddTestCKeyToKeyStore(keystore);
+    auto scriptPubKey = GetScriptForDestination(tsk.GetPubKey().GetID());
+
+    auto sk_from = libzcash::SaplingSpendingKey::random();
+    auto fvk_from = sk_from.full_viewing_key();
+
+    auto sk = libzcash::SaplingSpendingKey::random();
+    auto expsk = sk.expanded_spending_key();
+    auto fvk = sk.full_viewing_key();
+    auto ivk = fvk.in_viewing_key();
+    libzcash::diversifier_t d = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
+    auto pk = *ivk.address(d);
+
+    // Create a shielding transaction from transparent to Sapling
+    // 0.0005 t-ZEC in, 0.0004 z-ZEC out, default fee
+    auto builder = TransactionBuilder(consensusParams, 1, std::nullopt, &keystore);
+    builder.AddTransparentInput(COutPoint(uint256S("1234"), 0), scriptPubKey, 50000);
+    builder.AddSaplingOutput(fvk_from.ovk, pk, 40000, {});
+    auto tx = builder.Build().GetTxOrThrow();
+
+    EXPECT_EQ(tx.vin.size(), 1);
+    EXPECT_EQ(tx.vout.size(), 0);
+    EXPECT_EQ(tx.vJoinSplit.size(), 0);
+    EXPECT_EQ(tx.vShieldedSpend.size(), 0);
+    EXPECT_EQ(tx.vShieldedOutput.size(), 1);
+    EXPECT_EQ(tx.GetValueBalanceSapling(), -40000);
+
+    CValidationState state;
+    EXPECT_TRUE(ContextualCheckTransaction(tx, state, Params(), 2, true));
+    EXPECT_EQ(state.GetRejectReason(), "");
+
+    // Revert to default
+    RegtestDeactivateSapling();
+}
+
+TEST(TransactionBuilder, SaplingToSapling) {
+    LoadProofParameters();
+
+    auto consensusParams = RegtestActivateSapling();
+
+    auto sk = libzcash::SaplingSpendingKey::random();
+    auto expsk = sk.expanded_spending_key();
+    auto fvk = sk.full_viewing_key();
+    auto pa = sk.default_address();
+
+    auto testNote = GetTestSaplingNote(pa, 40000);
+
+    // Create a Sapling-only transaction
+    // 0.0004 z-ZEC in, 0.00025 z-ZEC out, default fee, 0.00005 z-ZEC change
+    auto builder = TransactionBuilder(consensusParams, 2, std::nullopt);
+    builder.AddSaplingSpend(expsk, testNote.note, testNote.tree.root(), testNote.tree.witness());
+
+    // Check that trying to add a different anchor fails
+    // TODO: the following check can be split out in to another test
+    ASSERT_THROW(builder.AddSaplingSpend(expsk, testNote.note, uint256(), testNote.tree.witness()), UniValue);
+
+    builder.AddSaplingOutput(fvk.ovk, pa, 25000, {});
+    auto tx = builder.Build().GetTxOrThrow();
+
+    EXPECT_EQ(tx.vin.size(), 0);
+    EXPECT_EQ(tx.vout.size(), 0);
+    EXPECT_EQ(tx.vJoinSplit.size(), 0);
+    EXPECT_EQ(tx.vShieldedSpend.size(), 1);
+    EXPECT_EQ(tx.vShieldedOutput.size(), 2);
+    EXPECT_EQ(tx.GetValueBalanceSapling(), 10000);
+
+    CValidationState state;
+    EXPECT_TRUE(ContextualCheckTransaction(tx, state, Params(), 3, true));
+    EXPECT_EQ(state.GetRejectReason(), "");
+
+    // Revert to default
+    RegtestDeactivateSapling();
+}
+
+TEST(TransactionBuilder, SaplingToSprout) {
+    LoadProofParameters();
+
+    auto consensusParams = RegtestActivateSapling();
+
+    auto sk = libzcash::SaplingSpendingKey::random();
+    auto expsk = sk.expanded_spending_key();
+    auto pa = sk.default_address();
+
+    auto testNote = GetTestSaplingNote(pa, 40000);
+
+    auto sproutSk = libzcash::SproutSpendingKey::random();
+    auto sproutAddr = sproutSk.address();
+
+    // Create a Sapling-to-Sprout transaction (reusing the note from above)
+    // - 0.0004 Sapling-ZEC in      - 0.00025 Sprout-ZEC out
+    //                              - 0.00005 Sapling-ZEC change
+    //                              - default t-ZEC fee
+    auto builder = TransactionBuilder(consensusParams, 2, std::nullopt, nullptr);
+    builder.AddSaplingSpend(expsk, testNote.note, testNote.tree.root(), testNote.tree.witness());
+    builder.AddSproutOutput(sproutAddr, 25000);
+    auto tx = builder.Build().GetTxOrThrow();
+
+    EXPECT_EQ(tx.vin.size(), 0);
+    EXPECT_EQ(tx.vout.size(), 0);
+    EXPECT_EQ(tx.vJoinSplit.size(), 1);
+    EXPECT_EQ(tx.vJoinSplit[0].vpub_old, 25000);
+    EXPECT_EQ(tx.vJoinSplit[0].vpub_new, 0);
+    EXPECT_EQ(tx.vShieldedSpend.size(), 1);
+    EXPECT_EQ(tx.vShieldedOutput.size(), 1);
+    EXPECT_EQ(tx.GetValueBalanceSapling(), 35000);
+
+    CValidationState state;
+    EXPECT_TRUE(ContextualCheckTransaction(tx, state, Params(), 3, true));
+    EXPECT_EQ(state.GetRejectReason(), "");
+
+    // Revert to default
+    RegtestDeactivateSapling();
+}
+
+TEST(TransactionBuilder, SproutToSproutAndSapling) {
+    LoadProofParameters();
+
+    auto consensusParams = RegtestActivateSapling();
+
+    auto sk = libzcash::SaplingSpendingKey::random();
+    auto fvk = sk.full_viewing_key();
+    auto pa = sk.default_address();
+
+    auto sproutSk = libzcash::SproutSpendingKey::random();
+    auto sproutAddr = sproutSk.address();
+
+    auto wtx = GetValidSproutReceive(sproutSk, 25000, true);
+    auto sproutNote = GetSproutNote(sproutSk, wtx, 0, 1);
+
+    SproutMerkleTree sproutTree;
+    for (int i = 0; i < ZC_NUM_JS_OUTPUTS; i++) {
+        sproutTree.append(wtx.vJoinSplit[0].commitments[i]);
+    }
+    SproutWitness sproutWitness = sproutTree.witness();
+    // Fake a view with the Sprout note in it
+    auto rt = sproutTree.root();
+    TransactionBuilderCoinsViewDB fakeDB;
+    fakeDB.sproutTrees.insert(std::pair<uint256, SproutMerkleTree>(rt, sproutTree));
+    CCoinsViewCache view(&fakeDB);
+
+    // Create a Sprout-to-[Sprout-and-Sapling] transaction
+    // - 0.00025 Sprout-ZEC in      - 0.00006 Sprout-ZEC out
+    //                              - 0.00004 Sprout-ZEC out
+    //                              - 0.00005 Sprout-ZEC change
+    //                              - 0.00005 Sapling-ZEC out
+    //                              - 0.00005 t-ZEC fee
+    auto builder = TransactionBuilder(consensusParams, 2, std::nullopt, nullptr, &view);
+    builder.SetFee(5000);
+    builder.AddSproutInput(sproutSk, sproutNote, sproutWitness);
+    builder.AddSproutOutput(sproutAddr, 6000);
+    builder.AddSproutOutput(sproutAddr, 4000);
+    builder.AddSaplingOutput(fvk.ovk, pa, 5000);
+    auto tx = builder.Build().GetTxOrThrow();
+
+    EXPECT_EQ(tx.vin.size(), 0);
+    EXPECT_EQ(tx.vout.size(), 0);
+    // TODO: This should be doable in two JoinSplits.
+    // There's an inefficiency in the implementation.
+    EXPECT_EQ(tx.vJoinSplit.size(), 3);
+    EXPECT_EQ(tx.vJoinSplit[0].vpub_old, 0);
+    EXPECT_EQ(tx.vJoinSplit[0].vpub_new, 0);
+    EXPECT_EQ(tx.vJoinSplit[1].vpub_old, 0);
+    EXPECT_EQ(tx.vJoinSplit[1].vpub_new, 0);
+    EXPECT_EQ(tx.vJoinSplit[2].vpub_old, 0);
+    EXPECT_EQ(tx.vJoinSplit[2].vpub_new, 10000);
+    EXPECT_EQ(tx.vShieldedSpend.size(), 0);
+    EXPECT_EQ(tx.vShieldedOutput.size(), 1);
+    EXPECT_EQ(tx.GetValueBalanceSapling(), -5000);
+
+    CValidationState state;
+    EXPECT_TRUE(ContextualCheckTransaction(tx, state, Params(), 4, true));
+    EXPECT_EQ(state.GetRejectReason(), "");
+
+    // Revert to default
+    RegtestDeactivateSapling();
+}
+
+TEST(TransactionBuilder, DuplicateOrchardNullifier)
+{
+    #include "data/tx-orchard-duplicate-nullifiers.h"
+
+    RegtestActivateNU5();
+
+    CDataStream ssin(
+        ParseHex(txdataOrchardDuplicateNullifiersTestVector),
+        SER_NETWORK,
+        PROTOCOL_VERSION
+    );
+
+    CTransaction tx;
+    ssin >> tx;
+
+    CValidationState state;
+    EXPECT_FALSE(CheckTransactionWithoutProofVerification(tx, state));
+    EXPECT_EQ(state.GetRejectReason(), "bad-orchard-nullifiers-duplicate");
+
+    // Revert to default
+    RegtestDeactivateNU5();
+}
+
+TEST(TransactionBuilder, TransparentToOrchard)
+{
+    auto consensusParams = RegtestActivateNU5();
+
+    CBasicKeyStore keystore;
+    CKey tsk = AddTestCKeyToKeyStore(keystore);
+    auto scriptPubKey = GetScriptForDestination(tsk.GetPubKey().GetID());
+
+    auto coinType = Params().BIP44CoinType();
+    auto seed = MnemonicSeed::Random(coinType);
+    auto sk = libzcash::OrchardSpendingKey::ForAccount(seed, coinType, 0);
+    auto fvk = sk.ToFullViewingKey();
+    auto ivk = fvk.ToIncomingViewingKey();
+    libzcash::diversifier_index_t j(0);
+    auto recipient = ivk.Address(j);
+
+    TransactionBuilderCoinsViewDB fakeDB;
+    auto orchardAnchor = fakeDB.GetBestAnchor(ShieldedType::ORCHARD);
+
+    // Create a shielding transaction from transparent to Orchard
+    // 0.0005 t-ZEC in, 0.0004 z-ZEC out, default fee
+    auto builder = TransactionBuilder(consensusParams, 1, orchardAnchor, &keystore);
+    builder.AddTransparentInput(COutPoint(uint256S("1234"), 0), scriptPubKey, 50000);
+    builder.AddOrchardOutput(std::nullopt, recipient, 40000, std::nullopt);
+    auto maybeTx = builder.Build();
+    EXPECT_TRUE(maybeTx.IsTx());
+    if (maybeTx.IsError()) {
+        std::cerr << "Failed to build transaction: " << maybeTx.GetError() << std::endl;
+        GTEST_FAIL();
+    }
+    auto tx = maybeTx.GetTxOrThrow();
+
+    EXPECT_EQ(tx.vin.size(), 1);
+    EXPECT_EQ(tx.vout.size(), 0);
+    EXPECT_EQ(tx.vJoinSplit.size(), 0);
+    EXPECT_EQ(tx.vShieldedSpend.size(), 0);
+    EXPECT_EQ(tx.vShieldedOutput.size(), 0);
+    EXPECT_TRUE(tx.GetOrchardBundle().IsPresent());
+    EXPECT_EQ(tx.GetOrchardBundle().GetValueBalance(), -40000);
+
+    CValidationState state;
+    EXPECT_TRUE(ContextualCheckTransaction(tx, state, Params(), 2, true));
+    EXPECT_EQ(state.GetRejectReason(), "");
+
+    // Revert to default
+    RegtestDeactivateNU5();
+}
+
+TEST(TransactionBuilder, ThrowsOnTransparentInputWithoutKeyStore)
+{
+    SelectParams(CBaseChainParams::REGTEST);
+    const Consensus::Params& consensusParams = Params().GetConsensus();
+
+    auto builder = TransactionBuilder(consensusParams, 1, std::nullopt);
+    ASSERT_THROW(builder.AddTransparentInput(COutPoint(), CScript(), 1), std::runtime_error);
+}
+
+TEST(TransactionBuilder, RejectsInvalidTransparentOutput)
+{
+    SelectParams(CBaseChainParams::REGTEST);
+    const Consensus::Params& consensusParams = Params().GetConsensus();
+
+    // Default CTxDestination type is an invalid address
+    CTxDestination taddr;
+    auto builder = TransactionBuilder(consensusParams, 1, std::nullopt);
+    ASSERT_THROW(builder.AddTransparentOutput(taddr, 50), UniValue);
+}
+
+TEST(TransactionBuilder, FailsWithNegativeChange)
+{
+    LoadProofParameters();
+
+    auto consensusParams = RegtestActivateSapling();
+
+    // Generate dummy Sapling address
+    auto sk = libzcash::SaplingSpendingKey::random();
+    auto expsk = sk.expanded_spending_key();
+    auto fvk = sk.full_viewing_key();
+    auto pa = sk.default_address();
+
+    // Set up dummy transparent address
+    CBasicKeyStore keystore;
+    CKey tsk = AddTestCKeyToKeyStore(keystore);
+    auto tkeyid = tsk.GetPubKey().GetID();
+    auto scriptPubKey = GetScriptForDestination(tkeyid);
+    CTxDestination taddr = tkeyid;
+
+    auto testNote = GetTestSaplingNote(pa, 59999);
+
+    // Fail if there is only a Sapling output
+    // 0.0005 z-ZEC out, default fee
+    auto builder = TransactionBuilder(consensusParams, 1, std::nullopt);
+    builder.AddSaplingOutput(fvk.ovk, pa, 50000, {});
+    EXPECT_EQ("Change cannot be negative", builder.Build().GetError());
+
+    // Fail if there is only a transparent output
+    // 0.0005 t-ZEC out, default fee
+    builder = TransactionBuilder(consensusParams, 1, std::nullopt, &keystore);
+    builder.AddTransparentOutput(taddr, 50000);
+    EXPECT_EQ("Change cannot be negative", builder.Build().GetError());
+
+    // Fails if there is insufficient input
+    // 0.0005 t-ZEC out, default fee, 0.00059999 z-ZEC in
+    builder.AddSaplingSpend(expsk, testNote.note, testNote.tree.root(), testNote.tree.witness());
+    EXPECT_EQ("Change cannot be negative", builder.Build().GetError());
+
+    // Succeeds if there is sufficient input
+    builder.AddTransparentInput(COutPoint(), scriptPubKey, 1);
+    EXPECT_TRUE(builder.Build().IsTx());
+
+    // Revert to default
+    RegtestDeactivateSapling();
+}
+
+TEST(TransactionBuilder, ChangeOutput)
+{
+    LoadProofParameters();
+
+    auto consensusParams = RegtestActivateSapling();
+
+    // Generate dummy Sapling address
+    auto sk = libzcash::SaplingSpendingKey::random();
+    auto expsk = sk.expanded_spending_key();
+    auto pa = sk.default_address();
+
+    auto testNote = GetTestSaplingNote(pa, 25000);
+
+    // Generate change Sapling address
+    auto sk2 = libzcash::SaplingSpendingKey::random();
+    auto fvkOut = sk2.full_viewing_key();
+    auto zChangeAddr = sk2.default_address();
+
+    // Set up dummy transparent address
+    CBasicKeyStore keystore;
+    CKey tsk = AddTestCKeyToKeyStore(keystore);
+    auto tkeyid = tsk.GetPubKey().GetID();
+    auto scriptPubKey = GetScriptForDestination(tkeyid);
+
+    // No change address and no Sapling spends
+    {
+        auto builder = TransactionBuilder(consensusParams, 1, std::nullopt, &keystore);
+        builder.AddTransparentInput(COutPoint(), scriptPubKey, 25000);
+        EXPECT_EQ("Could not determine change address", builder.Build().GetError());
+    }
+
+    // Change to the same address as the first Sapling spend
+    {
+        auto builder = TransactionBuilder(consensusParams, 1, std::nullopt, &keystore);
+        builder.AddTransparentInput(COutPoint(), scriptPubKey, 25000);
+        builder.AddSaplingSpend(expsk, testNote.note, testNote.tree.root(), testNote.tree.witness());
+        auto tx = builder.Build().GetTxOrThrow();
+
+        EXPECT_EQ(tx.vin.size(), 1);
+        EXPECT_EQ(tx.vout.size(), 0);
+        EXPECT_EQ(tx.vJoinSplit.size(), 0);
+        EXPECT_EQ(tx.vShieldedSpend.size(), 1);
+        EXPECT_EQ(tx.vShieldedOutput.size(), 1);
+        EXPECT_EQ(tx.GetValueBalanceSapling(), -15000);
+    }
+
+    // Change to a Sapling address
+    {
+        auto builder = TransactionBuilder(consensusParams, 1, std::nullopt, &keystore);
+        builder.AddTransparentInput(COutPoint(), scriptPubKey, 25000);
+        builder.SendChangeTo(zChangeAddr, fvkOut.ovk);
+        auto tx = builder.Build().GetTxOrThrow();
+
+        EXPECT_EQ(tx.vin.size(), 1);
+        EXPECT_EQ(tx.vout.size(), 0);
+        EXPECT_EQ(tx.vJoinSplit.size(), 0);
+        EXPECT_EQ(tx.vShieldedSpend.size(), 0);
+        EXPECT_EQ(tx.vShieldedOutput.size(), 1);
+        EXPECT_EQ(tx.GetValueBalanceSapling(), -15000);
+    }
+
+    // Change to a transparent address
+    {
+        auto builder = TransactionBuilder(consensusParams, 1, std::nullopt, &keystore);
+        builder.AddTransparentInput(COutPoint(), scriptPubKey, 25000);
+        builder.SendChangeTo(tkeyid, {});
+        auto tx = builder.Build().GetTxOrThrow();
+
+        EXPECT_EQ(tx.vin.size(), 1);
+        EXPECT_EQ(tx.vout.size(), 1);
+        EXPECT_EQ(tx.vJoinSplit.size(), 0);
+        EXPECT_EQ(tx.vShieldedSpend.size(), 0);
+        EXPECT_EQ(tx.vShieldedOutput.size(), 0);
+        EXPECT_EQ(tx.GetValueBalanceSapling(), 0);
+        EXPECT_EQ(tx.vout[0].nValue, 15000);
+    }
+
+    // Revert to default
+    RegtestDeactivateSapling();
+}
+
+TEST(TransactionBuilder, SetFee)
+{
+    LoadProofParameters();
+
+    auto consensusParams = RegtestActivateSapling();
+
+    // Generate dummy Sapling address
+    auto sk = libzcash::SaplingSpendingKey::random();
+    auto expsk = sk.expanded_spending_key();
+    auto fvk = sk.full_viewing_key();
+    auto pa = sk.default_address();
+
+    auto testNote = GetTestSaplingNote(pa, 50000);
+
+    // Default fee
+    {
+        auto builder = TransactionBuilder(consensusParams, 1, std::nullopt);
+        builder.AddSaplingSpend(expsk, testNote.note, testNote.tree.root(), testNote.tree.witness());
+        builder.AddSaplingOutput(fvk.ovk, pa, 25000, {});
+        auto tx = builder.Build().GetTxOrThrow();
+
+        EXPECT_EQ(tx.vin.size(), 0);
+        EXPECT_EQ(tx.vout.size(), 0);
+        EXPECT_EQ(tx.vJoinSplit.size(), 0);
+        EXPECT_EQ(tx.vShieldedSpend.size(), 1);
+        EXPECT_EQ(tx.vShieldedOutput.size(), 2);
+        EXPECT_EQ(tx.GetValueBalanceSapling(), 10000);
+    }
+
+    // Configured fee
+    {
+        auto builder = TransactionBuilder(consensusParams, 1, std::nullopt);
+        builder.AddSaplingSpend(expsk, testNote.note, testNote.tree.root(), testNote.tree.witness());
+        builder.AddSaplingOutput(fvk.ovk, pa, 25000, {});
+        builder.SetFee(20000);
+        auto tx = builder.Build().GetTxOrThrow();
+
+        EXPECT_EQ(tx.vin.size(), 0);
+        EXPECT_EQ(tx.vout.size(), 0);
+        EXPECT_EQ(tx.vJoinSplit.size(), 0);
+        EXPECT_EQ(tx.vShieldedSpend.size(), 1);
+        EXPECT_EQ(tx.vShieldedOutput.size(), 2);
+        EXPECT_EQ(tx.GetValueBalanceSapling(), 20000);
+    }
+
+    // Revert to default
+    RegtestDeactivateSapling();
+}
+
+TEST(TransactionBuilder, CheckSaplingTxVersion)
+{
+    SelectParams(CBaseChainParams::REGTEST);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+    const Consensus::Params& consensusParams = Params().GetConsensus();
+
+    auto sk = libzcash::SaplingSpendingKey::random();
+    auto expsk = sk.expanded_spending_key();
+    auto pk = sk.default_address();
+
+    // Cannot add Sapling outputs to a non-Sapling transaction
+    auto builder = TransactionBuilder(consensusParams, 1, std::nullopt);
+    try {
+        builder.AddSaplingOutput(uint256(), pk, 12345, {});
+    } catch (std::runtime_error const & err) {
+        EXPECT_EQ(err.what(), std::string("TransactionBuilder cannot add Sapling output to pre-Sapling transaction"));
+    } catch(...) {
+        FAIL() << "Expected std::runtime_error";
+    }
+
+    // Cannot add Sapling spends to a non-Sapling transaction
+    libzcash::SaplingNote note(pk, 50000, libzcash::Zip212Enabled::BeforeZip212);
+    SaplingMerkleTree tree;
+    try {
+        builder.AddSaplingSpend(expsk, note, uint256(), tree.witness());
+    } catch (std::runtime_error const & err) {
+        EXPECT_EQ(err.what(), std::string("TransactionBuilder cannot add Sapling spend to pre-Sapling transaction"));
+    } catch(...) {
+        FAIL() << "Expected std::runtime_error";
+    }
+
+    // Revert to default
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+}
diff --git a/depend/zcash/src/gtest/test_transaction_builder.h b/depend/zcash/src/gtest/test_transaction_builder.h
new file mode 100644
index 000000000..fcb4ba664
--- /dev/null
+++ b/depend/zcash/src/gtest/test_transaction_builder.h
@@ -0,0 +1,73 @@
+// Copyright (c) 2022 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_GTEST_TEST_TRANSACTION_BUILDER_H
+#define ZCASH_GTEST_TEST_TRANSACTION_BUILDER_H
+
+#include "coins.h"
+
+// Fake an empty view
+class TransactionBuilderCoinsViewDB : public CCoinsView {
+public:
+    std::map<uint256, SproutMerkleTree> sproutTrees;
+
+    TransactionBuilderCoinsViewDB() {}
+
+    bool GetSproutAnchorAt(const uint256 &rt, SproutMerkleTree &tree) const {
+        auto it = sproutTrees.find(rt);
+        if (it != sproutTrees.end()) {
+            tree = it->second;
+            return true;
+        } else {
+            return false;
+        }
+    }
+
+    bool GetSaplingAnchorAt(const uint256 &rt, SaplingMerkleTree &tree) const {
+        return false;
+    }
+
+    bool GetOrchardAnchorAt(const uint256 &rt, OrchardMerkleFrontier &tree) const {
+        return false;
+    }
+
+    bool GetNullifier(const uint256 &nf, ShieldedType type) const {
+        return false;
+    }
+
+    bool GetCoins(const uint256 &txid, CCoins &coins) const {
+        return false;
+    }
+
+    bool HaveCoins(const uint256 &txid) const {
+        return false;
+    }
+
+    uint256 GetBestBlock() const {
+        uint256 a;
+        return a;
+    }
+
+    uint256 GetBestAnchor(ShieldedType type) const {
+        uint256 a;
+        return a;
+    }
+
+    bool BatchWrite(CCoinsMap &mapCoins,
+                    const uint256 &hashBlock,
+                    const uint256 &hashSproutAnchor,
+                    const uint256 &hashSaplingAnchor,
+                    CAnchorsSproutMap &mapSproutAnchors,
+                    CAnchorsSaplingMap &mapSaplingAnchors,
+                    CNullifiersMap &mapSproutNullifiers,
+                    CNullifiersMap saplingNullifiersMap) {
+        return false;
+    }
+
+    bool GetStats(CCoinsStats &stats) const {
+        return false;
+    }
+};
+
+#endif
diff --git a/depend/zcash/src/gtest/test_txid.cpp b/depend/zcash/src/gtest/test_txid.cpp
new file mode 100644
index 000000000..b839d8a03
--- /dev/null
+++ b/depend/zcash/src/gtest/test_txid.cpp
@@ -0,0 +1,34 @@
+#include <gtest/gtest.h>
+#include "primitives/transaction.h"
+#include "clientversion.h"
+#include "serialize.h"
+#include "streams.h"
+#include "uint256.h"
+#include "util.h"
+#include "utilstrencodings.h"
+
+/*
+ Test that removing #1144 succeeded by verifying the hash of a transaction is over the entire serialized form.
+ */
+TEST(TxidTests, CheckTxidAndHashAreSame) {
+    // Random zcash transaction aacaa62d40fcdd9192ed35ea9df31660ccf7f6c60566530faaa444fb5d0d410e
+    CTransaction tx;
+    CDataStream stream(ParseHex("01000000015ad78be5497476bbf84869d8156761ca850b6e82e48ad1315069a3726516a3d1010000006b483045022100ba5e90204e83c5f961b67c6232c1cc6c360afd36d43fcfae0de7af2e75f4cda7022012fec415a12048dbb70511fda6195b090b56735232281dc1144409833a092edc012102c322382e17c9ed4f47183f219cc5dd7853f939fb8eebae3c943622e0abf8d5e5feffffff0280969800000000001976a91430271a250e92135ce0db0783ebb63aaeb58e47f988acd694693a000000001976a9145f0d00adba6489150808feb4108d7be582cbb2e188ac0a000000"), SER_DISK, CLIENT_VERSION);
+    stream >> tx;
+
+    uint256 hash = uint256S("aacaa62d40fcdd9192ed35ea9df31660ccf7f6c60566530faaa444fb5d0d410e");
+    ASSERT_TRUE(hash == tx.GetHash());
+}
+
+TEST(TxidTests, CheckTxidAndHashAreSameCoinbase) {
+    // Random zcash coinbase transaction 6041357de59ba64959d1b60f93de24dfe5ea1e26ed9e8a73d35b225a1845bad5
+    CTransaction tx;
+    CDataStream stream(ParseHex("01000000010000000000000000000000000000000000000000000000000000000000000000ffffffff03530101ffffffff02f049020000000000232102f2df427fd4f76552ed0e86b17da8cf9b07754ea23ddc05799410a4a3a5d806ccac7c9200000000000017a9146708e6670db0b950dac68031025cc5b63213a4918700000000"), SER_DISK, CLIENT_VERSION);
+    stream >> tx;
+
+    ASSERT_TRUE(tx.IsCoinBase());
+
+    uint256 hash = uint256S("6041357de59ba64959d1b60f93de24dfe5ea1e26ed9e8a73d35b225a1845bad5");
+    ASSERT_TRUE(hash == tx.GetHash());
+}
+
diff --git a/depend/zcash/src/gtest/test_upgrades.cpp b/depend/zcash/src/gtest/test_upgrades.cpp
new file mode 100644
index 000000000..d7ff0d791
--- /dev/null
+++ b/depend/zcash/src/gtest/test_upgrades.cpp
@@ -0,0 +1,202 @@
+#include <gtest/gtest.h>
+
+#include "chainparams.h"
+#include "consensus/upgrades.h"
+
+#include <optional>
+
+class UpgradesTest : public ::testing::Test {
+protected:
+    void SetUp() override {
+    }
+
+    void TearDown() override {
+        // Revert to default
+        UpdateNetworkUpgradeParameters(Consensus::UPGRADE_TESTDUMMY, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+    }
+};
+
+TEST_F(UpgradesTest, NetworkUpgradeState) {
+    SelectParams(CBaseChainParams::REGTEST);
+    const Consensus::Params& params = Params().GetConsensus();
+
+    // Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT
+    EXPECT_EQ(
+        NetworkUpgradeState(0, params, Consensus::UPGRADE_TESTDUMMY),
+        UPGRADE_DISABLED);
+    EXPECT_EQ(
+        NetworkUpgradeState(1000000, params, Consensus::UPGRADE_TESTDUMMY),
+        UPGRADE_DISABLED);
+
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_TESTDUMMY, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+
+    EXPECT_EQ(
+        NetworkUpgradeState(0, params, Consensus::UPGRADE_TESTDUMMY),
+        UPGRADE_ACTIVE);
+    EXPECT_EQ(
+        NetworkUpgradeState(1000000, params, Consensus::UPGRADE_TESTDUMMY),
+        UPGRADE_ACTIVE);
+
+    int nActivationHeight = 100;
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_TESTDUMMY, nActivationHeight);
+
+    EXPECT_EQ(
+        NetworkUpgradeState(0, params, Consensus::UPGRADE_TESTDUMMY),
+        UPGRADE_PENDING);
+    EXPECT_EQ(
+        NetworkUpgradeState(nActivationHeight - 1, params, Consensus::UPGRADE_TESTDUMMY),
+        UPGRADE_PENDING);
+    EXPECT_EQ(
+        NetworkUpgradeState(nActivationHeight, params, Consensus::UPGRADE_TESTDUMMY),
+        UPGRADE_ACTIVE);
+    EXPECT_EQ(
+        NetworkUpgradeState(1000000, params, Consensus::UPGRADE_TESTDUMMY),
+        UPGRADE_ACTIVE);
+}
+
+TEST_F(UpgradesTest, CurrentEpoch) {
+    SelectParams(CBaseChainParams::REGTEST);
+    const Consensus::Params& params = Params().GetConsensus();
+    auto nBranchId = NetworkUpgradeInfo[Consensus::UPGRADE_TESTDUMMY].nBranchId;
+
+    // Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT
+    EXPECT_EQ(CurrentEpoch(0, params), Consensus::BASE_SPROUT);
+    EXPECT_EQ(CurrentEpochBranchId(0, params), 0);
+    EXPECT_EQ(CurrentEpoch(1000000, params), Consensus::BASE_SPROUT);
+    EXPECT_EQ(CurrentEpochBranchId(1000000, params), 0);
+
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_TESTDUMMY, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+
+    EXPECT_EQ(CurrentEpoch(0, params), Consensus::UPGRADE_TESTDUMMY);
+    EXPECT_EQ(CurrentEpochBranchId(0, params), nBranchId);
+    EXPECT_EQ(CurrentEpoch(1000000, params), Consensus::UPGRADE_TESTDUMMY);
+    EXPECT_EQ(CurrentEpochBranchId(1000000, params), nBranchId);
+
+    int nActivationHeight = 100;
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_TESTDUMMY, nActivationHeight);
+
+    EXPECT_EQ(CurrentEpoch(0, params), Consensus::BASE_SPROUT);
+    EXPECT_EQ(CurrentEpochBranchId(0, params), 0);
+    EXPECT_EQ(CurrentEpoch(nActivationHeight - 1, params), Consensus::BASE_SPROUT);
+    EXPECT_EQ(CurrentEpochBranchId(nActivationHeight - 1, params), 0);
+    EXPECT_EQ(CurrentEpoch(nActivationHeight, params), Consensus::UPGRADE_TESTDUMMY);
+    EXPECT_EQ(CurrentEpochBranchId(nActivationHeight, params), nBranchId);
+    EXPECT_EQ(CurrentEpoch(1000000, params), Consensus::UPGRADE_TESTDUMMY);
+    EXPECT_EQ(CurrentEpochBranchId(1000000, params), nBranchId);
+}
+
+TEST_F(UpgradesTest, IsActivationHeight) {
+    SelectParams(CBaseChainParams::REGTEST);
+    const Consensus::Params& params = Params().GetConsensus();
+
+    // Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT
+    EXPECT_FALSE(IsActivationHeight(-1, params, Consensus::UPGRADE_TESTDUMMY));
+    EXPECT_FALSE(IsActivationHeight(0, params, Consensus::UPGRADE_TESTDUMMY));
+    EXPECT_FALSE(IsActivationHeight(1, params, Consensus::UPGRADE_TESTDUMMY));
+    EXPECT_FALSE(IsActivationHeight(1000000, params, Consensus::UPGRADE_TESTDUMMY));
+
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_TESTDUMMY, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+
+    EXPECT_FALSE(IsActivationHeight(-1, params, Consensus::UPGRADE_TESTDUMMY));
+    EXPECT_TRUE(IsActivationHeight(0, params, Consensus::UPGRADE_TESTDUMMY));
+    EXPECT_FALSE(IsActivationHeight(1, params, Consensus::UPGRADE_TESTDUMMY));
+    EXPECT_FALSE(IsActivationHeight(1000000, params, Consensus::UPGRADE_TESTDUMMY));
+
+    int nActivationHeight = 100;
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_TESTDUMMY, nActivationHeight);
+
+    EXPECT_FALSE(IsActivationHeight(-1, params, Consensus::UPGRADE_TESTDUMMY));
+    EXPECT_FALSE(IsActivationHeight(0, params, Consensus::UPGRADE_TESTDUMMY));
+    EXPECT_FALSE(IsActivationHeight(1, params, Consensus::UPGRADE_TESTDUMMY));
+    EXPECT_FALSE(IsActivationHeight(nActivationHeight - 1, params, Consensus::UPGRADE_TESTDUMMY));
+    EXPECT_TRUE(IsActivationHeight(nActivationHeight, params, Consensus::UPGRADE_TESTDUMMY));
+    EXPECT_FALSE(IsActivationHeight(nActivationHeight + 1, params, Consensus::UPGRADE_TESTDUMMY));
+    EXPECT_FALSE(IsActivationHeight(1000000, params, Consensus::UPGRADE_TESTDUMMY));
+}
+
+TEST_F(UpgradesTest, IsActivationHeightForAnyUpgrade) {
+    SelectParams(CBaseChainParams::REGTEST);
+    const Consensus::Params& params = Params().GetConsensus();
+
+    // Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT
+    EXPECT_FALSE(IsActivationHeightForAnyUpgrade(-1, params));
+    EXPECT_FALSE(IsActivationHeightForAnyUpgrade(0, params));
+    EXPECT_FALSE(IsActivationHeightForAnyUpgrade(1, params));
+    EXPECT_FALSE(IsActivationHeightForAnyUpgrade(1000000, params));
+
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_TESTDUMMY, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+
+    EXPECT_FALSE(IsActivationHeightForAnyUpgrade(-1, params));
+    EXPECT_TRUE(IsActivationHeightForAnyUpgrade(0, params));
+    EXPECT_FALSE(IsActivationHeightForAnyUpgrade(1, params));
+    EXPECT_FALSE(IsActivationHeightForAnyUpgrade(1000000, params));
+
+    int nActivationHeight = 100;
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_TESTDUMMY, nActivationHeight);
+
+    EXPECT_FALSE(IsActivationHeightForAnyUpgrade(-1, params));
+    EXPECT_FALSE(IsActivationHeightForAnyUpgrade(0, params));
+    EXPECT_FALSE(IsActivationHeightForAnyUpgrade(1, params));
+    EXPECT_FALSE(IsActivationHeightForAnyUpgrade(nActivationHeight - 1, params));
+    EXPECT_TRUE(IsActivationHeightForAnyUpgrade(nActivationHeight, params));
+    EXPECT_FALSE(IsActivationHeightForAnyUpgrade(nActivationHeight + 1, params));
+    EXPECT_FALSE(IsActivationHeightForAnyUpgrade(1000000, params));
+}
+
+TEST_F(UpgradesTest, NextEpoch) {
+    SelectParams(CBaseChainParams::REGTEST);
+    const Consensus::Params& params = Params().GetConsensus();
+
+    // Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT
+    EXPECT_EQ(NextEpoch(-1, params), std::nullopt);
+    EXPECT_EQ(NextEpoch(0, params), std::nullopt);
+    EXPECT_EQ(NextEpoch(1, params), std::nullopt);
+    EXPECT_EQ(NextEpoch(1000000, params), std::nullopt);
+
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_TESTDUMMY, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+
+    EXPECT_EQ(NextEpoch(-1, params), std::nullopt);
+    EXPECT_EQ(NextEpoch(0, params), std::nullopt);
+    EXPECT_EQ(NextEpoch(1, params), std::nullopt);
+    EXPECT_EQ(NextEpoch(1000000, params), std::nullopt);
+
+    int nActivationHeight = 100;
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_TESTDUMMY, nActivationHeight);
+
+    EXPECT_EQ(NextEpoch(-1, params), std::nullopt);
+    EXPECT_EQ(NextEpoch(0, params), static_cast<int>(Consensus::UPGRADE_TESTDUMMY));
+    EXPECT_EQ(NextEpoch(1, params), static_cast<int>(Consensus::UPGRADE_TESTDUMMY));
+    EXPECT_EQ(NextEpoch(nActivationHeight - 1, params), static_cast<int>(Consensus::UPGRADE_TESTDUMMY));
+    EXPECT_EQ(NextEpoch(nActivationHeight, params), std::nullopt);
+    EXPECT_EQ(NextEpoch(nActivationHeight + 1, params), std::nullopt);
+    EXPECT_EQ(NextEpoch(1000000, params), std::nullopt);
+}
+
+TEST_F(UpgradesTest, NextActivationHeight) {
+    SelectParams(CBaseChainParams::REGTEST);
+    const Consensus::Params& params = Params().GetConsensus();
+
+    // Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT
+    EXPECT_EQ(NextActivationHeight(-1, params), std::nullopt);
+    EXPECT_EQ(NextActivationHeight(0, params), std::nullopt);
+    EXPECT_EQ(NextActivationHeight(1, params), std::nullopt);
+    EXPECT_EQ(NextActivationHeight(1000000, params), std::nullopt);
+
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_TESTDUMMY, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+
+    EXPECT_EQ(NextActivationHeight(-1, params), std::nullopt);
+    EXPECT_EQ(NextActivationHeight(0, params), std::nullopt);
+    EXPECT_EQ(NextActivationHeight(1, params), std::nullopt);
+    EXPECT_EQ(NextActivationHeight(1000000, params), std::nullopt);
+
+    int nActivationHeight = 100;
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_TESTDUMMY, nActivationHeight);
+
+    EXPECT_EQ(NextActivationHeight(-1, params), std::nullopt);
+    EXPECT_EQ(NextActivationHeight(0, params), nActivationHeight);
+    EXPECT_EQ(NextActivationHeight(1, params), nActivationHeight);
+    EXPECT_EQ(NextActivationHeight(nActivationHeight - 1, params), nActivationHeight);
+    EXPECT_EQ(NextActivationHeight(nActivationHeight, params), std::nullopt);
+    EXPECT_EQ(NextActivationHeight(nActivationHeight + 1, params), std::nullopt);
+    EXPECT_EQ(NextActivationHeight(1000000, params), std::nullopt);
+}
diff --git a/depend/zcash/src/gtest/test_validation.cpp b/depend/zcash/src/gtest/test_validation.cpp
new file mode 100644
index 000000000..d10d9c82f
--- /dev/null
+++ b/depend/zcash/src/gtest/test_validation.cpp
@@ -0,0 +1,295 @@
+#include <gtest/gtest.h>
+#include <gmock/gmock.h>
+
+#include "consensus/upgrades.h"
+#include "consensus/validation.h"
+#include "main.h"
+#include "transaction_builder.h"
+#include "utiltest.h"
+
+#include <optional>
+
+extern bool ReceivedBlockTransactions(
+    const CBlock &block,
+    CValidationState& state,
+    const CChainParams& chainparams,
+    CBlockIndex *pindexNew,
+    const CDiskBlockPos& pos);
+
+void ExpectOptionalAmount(CAmount expected, std::optional<CAmount> actual) {
+    EXPECT_TRUE((bool)actual);
+    if (actual) {
+        EXPECT_EQ(expected, *actual);
+    }
+}
+
+// Fake a view that optionally contains a single coin.
+class ValidationFakeCoinsViewDB : public CCoinsView {
+public:
+    std::optional<std::pair<std::pair<uint256, uint256>, std::pair<CTxOut, int>>> coin;
+
+    ValidationFakeCoinsViewDB() {}
+    ValidationFakeCoinsViewDB(uint256 blockHash, uint256 txid, CTxOut txOut, int nHeight) :
+        coin(std::make_pair(std::make_pair(blockHash, txid), std::make_pair(txOut, nHeight))) {}
+
+    bool GetSproutAnchorAt(const uint256 &rt, SproutMerkleTree &tree) const {
+        return false;
+    }
+
+    bool GetSaplingAnchorAt(const uint256 &rt, SaplingMerkleTree &tree) const {
+        return false;
+    }
+
+    bool GetNullifier(const uint256 &nf, ShieldedType type) const {
+        return false;
+    }
+
+    bool GetCoins(const uint256 &txid, CCoins &coins) const {
+        if (coin && txid == coin.value().first.second) {
+            CCoins newCoins;
+            newCoins.vout.resize(2);
+            newCoins.vout[0] = coin.value().second.first;
+            newCoins.nHeight = coin.value().second.second;
+            coins.swap(newCoins);
+            return true;
+        } else {
+            return false;
+        }
+    }
+
+    bool HaveCoins(const uint256 &txid) const {
+        if (coin && txid == coin.value().first.second) {
+            return true;
+        } else {
+            return false;
+        }
+    }
+
+    uint256 GetBestBlock() const {
+        if (coin) {
+            return coin.value().first.first;
+        } else {
+            uint256 a;
+            return a;
+        }
+    }
+
+    uint256 GetBestAnchor(ShieldedType type) const {
+        uint256 a;
+        return a;
+    }
+
+    bool BatchWrite(CCoinsMap &mapCoins,
+                    const uint256 &hashBlock,
+                    const uint256 &hashSproutAnchor,
+                    const uint256 &hashSaplingAnchor,
+                    CAnchorsSproutMap &mapSproutAnchors,
+                    CAnchorsSaplingMap &mapSaplingAnchors,
+                    CNullifiersMap &mapSproutNullifiers,
+                    CNullifiersMap saplingNullifiersMap) {
+        return false;
+    }
+
+    bool GetStats(CCoinsStats &stats) const {
+        return false;
+    }
+};
+
+class MockCValidationState : public CValidationState {
+public:
+    MOCK_METHOD6(DoS, bool(int level, bool ret,
+             unsigned int chRejectCodeIn, const std::string strRejectReasonIn,
+             bool corruptionIn,
+             const std::string &strDebugMessageIn));
+    MOCK_METHOD4(Invalid, bool(bool ret,
+                 unsigned int _chRejectCode, const std::string _strRejectReason,
+                 const std::string &_strDebugMessage));
+    MOCK_METHOD1(Error, bool(std::string strRejectReasonIn));
+    MOCK_CONST_METHOD0(IsValid, bool());
+    MOCK_CONST_METHOD0(IsInvalid, bool());
+    MOCK_CONST_METHOD0(IsError, bool());
+    MOCK_CONST_METHOD1(IsInvalid, bool(int &nDoSOut));
+    MOCK_CONST_METHOD0(CorruptionPossible, bool());
+    MOCK_CONST_METHOD0(GetRejectCode, unsigned int());
+    MOCK_CONST_METHOD0(GetRejectReason, std::string());
+    MOCK_CONST_METHOD0(GetDebugMessage, std::string());
+};
+
+TEST(Validation, ContextualCheckInputsPassesWithCoinbase) {
+    // Create fake coinbase transaction
+    CMutableTransaction mtx;
+    mtx.vin.resize(1);
+    CTransaction tx(mtx);
+    ASSERT_TRUE(tx.IsCoinBase());
+
+    // Fake an empty view
+    ValidationFakeCoinsViewDB fakeDB;
+    CCoinsViewCache view(&fakeDB);
+
+    for (int idx = Consensus::BASE_SPROUT; idx < Consensus::MAX_NETWORK_UPGRADES; idx++) {
+        auto consensusBranchId = NetworkUpgradeInfo[idx].nBranchId;
+        CValidationState state;
+        // Coinbase transactions have one synthetic input with no prevout.
+        PrecomputedTransactionData txdata(tx, {});
+        EXPECT_TRUE(ContextualCheckInputs(tx, state, view, false, 0, false, txdata, Params(CBaseChainParams::MAIN).GetConsensus(), consensusBranchId));
+    }
+}
+
+TEST(Validation, ContextualCheckInputsDetectsOldBranchId) {
+    SelectParams(CBaseChainParams::REGTEST);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, 10);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_SAPLING, 20);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_BLOSSOM, 30);
+    const Consensus::Params& consensusParams = Params(CBaseChainParams::REGTEST).GetConsensus();
+
+    auto overwinterBranchId = NetworkUpgradeInfo[Consensus::UPGRADE_OVERWINTER].nBranchId;
+    auto saplingBranchId = NetworkUpgradeInfo[Consensus::UPGRADE_SAPLING].nBranchId;
+    auto blossomBranchId = NetworkUpgradeInfo[Consensus::UPGRADE_BLOSSOM].nBranchId;
+
+    CBasicKeyStore keystore;
+    CKey tsk = AddTestCKeyToKeyStore(keystore);
+    auto destination = tsk.GetPubKey().GetID();
+    auto scriptPubKey = GetScriptForDestination(destination);
+
+    // Create a fake block. It doesn't need to contain any transactions; we just
+    // need it to be in the global state when our fake view is used.
+    CBlock block;
+    block.hashMerkleRoot = block.BuildMerkleTree();
+    auto blockHash = block.GetHash();
+    CBlockIndex fakeIndex {block};
+    mapBlockIndex.insert(std::make_pair(blockHash, &fakeIndex));
+    chainActive.SetTip(&fakeIndex);
+
+    // Fake a view containing a single coin.
+    CAmount coinValue(50000);
+    COutPoint utxo;
+    utxo.hash = uint256S("4242424242424242424242424242424242424242424242424242424242424242");
+    utxo.n = 0;
+    CTxOut txOut;
+    txOut.scriptPubKey = scriptPubKey;
+    txOut.nValue = coinValue;
+    ValidationFakeCoinsViewDB fakeDB(blockHash, utxo.hash, txOut, 12);
+    CCoinsViewCache view(&fakeDB);
+
+    // Create a transparent transaction that spends the coin, targeting
+    // a height during the Overwinter epoch.
+    auto builder = TransactionBuilder(consensusParams, 15, std::nullopt, &keystore);
+    builder.AddTransparentInput(utxo, scriptPubKey, coinValue);
+    builder.AddTransparentOutput(destination, 40000);
+    auto tx = builder.Build().GetTxOrThrow();
+    ASSERT_FALSE(tx.IsCoinBase());
+
+    // Ensure that the inputs validate against Overwinter.
+    CValidationState state;
+    PrecomputedTransactionData txdata(tx, {CTxOut(coinValue, scriptPubKey)});
+    EXPECT_TRUE(ContextualCheckInputs(
+        tx, state, view, true, 0, false, txdata,
+        consensusParams, overwinterBranchId));
+
+    // Attempt to validate the inputs against Sapling. We should be notified
+    // that an old consensus branch ID was used for an input.
+    MockCValidationState mockState;
+    EXPECT_CALL(mockState, DoS(
+        10, false, REJECT_INVALID,
+        strprintf("old-consensus-branch-id (Expected %s, found %s)",
+            HexInt(saplingBranchId),
+            HexInt(overwinterBranchId)),
+        false, "")).Times(1);
+    EXPECT_FALSE(ContextualCheckInputs(
+        tx, mockState, view, true, 0, false, txdata,
+        consensusParams, saplingBranchId));
+
+    // Attempt to validate the inputs against Blossom. All we should learn is
+    // that the signature is invalid, because we don't check more than one
+    // network upgrade back.
+    EXPECT_CALL(mockState, DoS(
+        100, false, REJECT_INVALID,
+        "mandatory-script-verify-flag-failed (Script evaluated without error but finished with a false/empty top stack element)",
+        false, "")).Times(1);
+    EXPECT_FALSE(ContextualCheckInputs(
+        tx, mockState, view, true, 0, false, txdata,
+        consensusParams, blossomBranchId));
+
+    // Tear down
+    chainActive.SetTip(NULL);
+    mapBlockIndex.erase(blockHash);
+
+    // Revert to default
+    RegtestDeactivateBlossom();
+}
+
+TEST(Validation, ReceivedBlockTransactions) {
+    SelectParams(CBaseChainParams::REGTEST);
+    auto chainParams = Params();
+    auto sk = libzcash::SproutSpendingKey::random();
+
+    // Create a fake genesis block
+    CBlock block1;
+    block1.vtx.push_back(GetValidSproutReceive(sk, 5, true));
+    block1.hashMerkleRoot = block1.BuildMerkleTree();
+    CBlockIndex fakeIndex1 {block1};
+
+    // Create a fake child block
+    CBlock block2;
+    block2.hashPrevBlock = block1.GetHash();
+    block2.vtx.push_back(GetValidSproutReceive(sk, 10, true));
+    block2.hashMerkleRoot = block2.BuildMerkleTree();
+    CBlockIndex fakeIndex2 {block2};
+    fakeIndex2.pprev = &fakeIndex1;
+
+    CDiskBlockPos pos1;
+    CDiskBlockPos pos2;
+
+    // Set initial state of indices
+    ASSERT_TRUE(fakeIndex1.RaiseValidity(BLOCK_VALID_TREE));
+    ASSERT_TRUE(fakeIndex2.RaiseValidity(BLOCK_VALID_TREE));
+    EXPECT_TRUE(fakeIndex1.IsValid(BLOCK_VALID_TREE));
+    EXPECT_TRUE(fakeIndex2.IsValid(BLOCK_VALID_TREE));
+    EXPECT_FALSE(fakeIndex1.IsValid(BLOCK_VALID_TRANSACTIONS));
+    EXPECT_FALSE(fakeIndex2.IsValid(BLOCK_VALID_TRANSACTIONS));
+
+    // Sprout pool values should not be set
+    EXPECT_FALSE((bool)fakeIndex1.nSproutValue);
+    EXPECT_FALSE((bool)fakeIndex1.nChainSproutValue);
+    EXPECT_FALSE((bool)fakeIndex2.nSproutValue);
+    EXPECT_FALSE((bool)fakeIndex2.nChainSproutValue);
+
+    // Mark the second block's transactions as received first
+    CValidationState state;
+    EXPECT_TRUE(ReceivedBlockTransactions(block2, state, chainParams, &fakeIndex2, pos2));
+    EXPECT_FALSE(fakeIndex1.IsValid(BLOCK_VALID_TRANSACTIONS));
+    EXPECT_TRUE(fakeIndex2.IsValid(BLOCK_VALID_TRANSACTIONS));
+
+    // Sprout pool value delta should now be set for the second block,
+    // but not any chain totals
+    EXPECT_FALSE((bool)fakeIndex1.nSproutValue);
+    EXPECT_FALSE((bool)fakeIndex1.nChainSproutValue);
+    {
+        SCOPED_TRACE("ExpectOptionalAmount call");
+        ExpectOptionalAmount(20, fakeIndex2.nSproutValue);
+    }
+    EXPECT_FALSE((bool)fakeIndex2.nChainSproutValue);
+
+    // Now mark the first block's transactions as received
+    EXPECT_TRUE(ReceivedBlockTransactions(block1, state, chainParams, &fakeIndex1, pos1));
+    EXPECT_TRUE(fakeIndex1.IsValid(BLOCK_VALID_TRANSACTIONS));
+    EXPECT_TRUE(fakeIndex2.IsValid(BLOCK_VALID_TRANSACTIONS));
+
+    // Sprout pool values should now be set for both blocks
+    {
+        SCOPED_TRACE("ExpectOptionalAmount call");
+        ExpectOptionalAmount(10, fakeIndex1.nSproutValue);
+    }
+    {
+        SCOPED_TRACE("ExpectOptionalAmount call");
+        ExpectOptionalAmount(10, fakeIndex1.nChainSproutValue);
+    }
+    {
+        SCOPED_TRACE("ExpectOptionalAmount call");
+        ExpectOptionalAmount(20, fakeIndex2.nSproutValue);
+    }
+    {
+        SCOPED_TRACE("ExpectOptionalAmount call");
+        ExpectOptionalAmount(30, fakeIndex2.nChainSproutValue);
+    }
+}
diff --git a/depend/zcash/src/gtest/test_zip32.cpp b/depend/zcash/src/gtest/test_zip32.cpp
new file mode 100644
index 000000000..9361ccb72
--- /dev/null
+++ b/depend/zcash/src/gtest/test_zip32.cpp
@@ -0,0 +1,188 @@
+#include <gtest/gtest.h>
+#include <gmock/gmock.h>
+
+#include <zcash/address/zip32.h>
+
+// From https://github.com/zcash-hackworks/zcash-test-vectors/blob/master/sapling_zip32.py
+// Sapling consistently uses little-endian encoding, but uint256S takes its input in
+// big-endian byte order, so the test vectors below are byte-reversed.
+TEST(ZIP32, TestVectors) {
+    std::vector<unsigned char, secure_allocator<unsigned char>> rawSeed {
+        0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16,
+        17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31};
+    HDSeed seed(rawSeed);
+
+    auto m = libzcash::SaplingExtendedSpendingKey::Master(seed);
+    EXPECT_EQ(m.depth, 0);
+    EXPECT_EQ(m.parentFVKTag, 0);
+    EXPECT_EQ(m.childIndex, 0);
+    EXPECT_EQ(
+        m.chaincode,
+        uint256S("8e661820750d557e8b34733ebf7ecdfdf31c6d27724fb47aa372bf034b7c94d0"));
+    EXPECT_EQ(
+        m.expsk.ask,
+        uint256S("06257454c907f6510ba1c1830ebf60657760a8869ee968a2b93260d3930cc0b6"));
+    EXPECT_EQ(
+        m.expsk.nsk,
+        uint256S("06ea21888a749fd38eb443d20a030abd2e6e997f5db4f984bd1f2f3be8ed0482"));
+    EXPECT_EQ(
+        m.expsk.ovk,
+        uint256S("21fb4adfa42183848306ffb27719f27d76cf9bb81d023c93d4b9230389845839"));
+    EXPECT_EQ(
+        m.dk,
+        uint256S("72a196f93e8abc0935280ea2a96fa57d6024c9913e0f9fb3af96775bb77cc177"));
+    EXPECT_THAT(
+        m.ToXFVK().DefaultAddress().d,
+        testing::ElementsAreArray({ 0xd8, 0x62, 0x1b, 0x98, 0x1c, 0xf3, 0x00, 0xe9, 0xd4, 0xcc, 0x89 }));
+
+    auto m_1 = m.Derive(1);
+    EXPECT_EQ(m_1.depth, 1);
+    EXPECT_EQ(m_1.parentFVKTag, 0x3a71c214);
+    EXPECT_EQ(m_1.childIndex, 1);
+    EXPECT_EQ(
+        m_1.chaincode,
+        uint256S("e6bcda05678a43fad229334ef0b795a590e7c50590baf0d9b9031a690c114701"));
+    EXPECT_EQ(
+        m_1.expsk.ask,
+        uint256S("0c357a2655b4b8d761794095df5cb402d3ba4a428cf6a88e7c2816a597c12b28"));
+    EXPECT_EQ(
+        m_1.expsk.nsk,
+        uint256S("01ba6bff1018fd4eac04da7e3f2c6be9c229e662c5c4d1d6fc1ecafd8829a3e7"));
+    EXPECT_EQ(
+        m_1.expsk.ovk,
+        uint256S("7474a4c518551bd82f14a7f7365a8ffa403c50cfeffedf026ada8688fc81135f"));
+    EXPECT_EQ(
+        m_1.dk,
+        uint256S("dcb4c170d878510e96c4a74192d7eecde9c9912b00b99a12ec91d7a232e84de0"));
+    EXPECT_THAT(
+        m_1.ToXFVK().DefaultAddress().d,
+        testing::ElementsAreArray({ 0x8b, 0x41, 0x38, 0x32, 0x0d, 0xfa, 0xfd, 0x7b, 0x39, 0x97, 0x81 }));
+
+    auto m_1_2h = m_1.Derive(2 | HARDENED_KEY_LIMIT);
+    EXPECT_EQ(m_1_2h.depth, 2);
+    EXPECT_EQ(m_1_2h.parentFVKTag, 0x079e99db);
+    EXPECT_EQ(m_1_2h.childIndex, 2 | HARDENED_KEY_LIMIT);
+    EXPECT_EQ(
+        m_1_2h.chaincode,
+        uint256S("35d4a883737742ca41a4baa92323bdb3c93dcb3b462a26b039971bedf415ce97"));
+    EXPECT_EQ(
+        m_1_2h.expsk.ask,
+        uint256S("0dc6e4fe846bda925c82e632980434e17b51dac81fc4821fa71334ee3c11e88b"));
+    EXPECT_EQ(
+        m_1_2h.expsk.nsk,
+        uint256S("0c99a63a275c1c66734761cfb9c62fe9bd1b953f579123d3d0e769c59d057837"));
+    EXPECT_EQ(
+        m_1_2h.expsk.ovk,
+        uint256S("bc1328fc5eb693e18875c5149d06953b11d39447ebd6e38c023c22962e1881cf"));
+    EXPECT_EQ(
+        m_1_2h.dk,
+        uint256S("377bb062dce7e0dcd8a0054d0ca4b4d1481b3710bfa1df12ca46ff9e9fa1eda3"));
+    EXPECT_THAT(
+        m_1_2h.ToXFVK().DefaultAddress().d,
+        testing::ElementsAreArray({ 0xe8, 0xd0, 0x37, 0x93, 0xcd, 0xd2, 0xba, 0xcc, 0x9c, 0x70, 0x41 }));
+
+    auto m_1_2hv = m_1_2h.ToXFVK();
+    EXPECT_EQ(m_1_2hv.depth, 2);
+    EXPECT_EQ(m_1_2hv.parentFVKTag, 0x079e99db);
+    EXPECT_EQ(m_1_2hv.childIndex, 2 | HARDENED_KEY_LIMIT);
+    EXPECT_EQ(
+        m_1_2hv.chaincode,
+        uint256S("35d4a883737742ca41a4baa92323bdb3c93dcb3b462a26b039971bedf415ce97"));
+    EXPECT_EQ(
+        m_1_2hv.fvk.ak,
+        uint256S("4138cffdf7200e52d4e9f4384481b4a4c4d070493a5e401e4ffa850f5a92c5a6"));
+    EXPECT_EQ(
+        m_1_2hv.fvk.nk,
+        uint256S("11eee22577304f660cc036bc84b3fc88d1ec50ae8a4d657beb6b211659304e30"));
+    EXPECT_EQ(
+        m_1_2hv.fvk.ovk,
+        uint256S("bc1328fc5eb693e18875c5149d06953b11d39447ebd6e38c023c22962e1881cf"));
+    EXPECT_EQ(
+        m_1_2hv.dk,
+        uint256S("377bb062dce7e0dcd8a0054d0ca4b4d1481b3710bfa1df12ca46ff9e9fa1eda3"));
+    EXPECT_EQ(m_1_2hv.DefaultAddress(), m_1_2h.ToXFVK().DefaultAddress());
+
+    // Hardened derivation from an xfvk fails
+    EXPECT_FALSE(m_1_2hv.Derive(3 | HARDENED_KEY_LIMIT));
+
+    // Non-hardened derivation succeeds
+    auto maybe_m_1_2hv_3 = m_1_2hv.Derive(3);
+    EXPECT_TRUE(maybe_m_1_2hv_3);
+
+    auto m_1_2hv_3 = maybe_m_1_2hv_3.value();
+    EXPECT_EQ(m_1_2hv_3.depth, 3);
+    EXPECT_EQ(m_1_2hv_3.parentFVKTag, 0x7583c148);
+    EXPECT_EQ(m_1_2hv_3.childIndex, 3);
+    EXPECT_EQ(
+        m_1_2hv_3.chaincode,
+        uint256S("e8e7d6a74a5a1c05be41baec7998d91f7b3603a4c0af495b0d43ba81cf7b938d"));
+    EXPECT_EQ(
+        m_1_2hv_3.fvk.ak,
+        uint256S("a3a697bdda9d648d32a97553de4754b2fac866d726d3f2c436259c507bc585b1"));
+    EXPECT_EQ(
+        m_1_2hv_3.fvk.nk,
+        uint256S("4f66c0814b769963f3bf1bc001270b50edabb27de042fc8a5607d2029e0488db"));
+    EXPECT_EQ(
+        m_1_2hv_3.fvk.ovk,
+        uint256S("f61a699934dc78441324ef628b4b4721611571e8ee3bd591eb3d4b1cfae0b969"));
+    EXPECT_EQ(
+        m_1_2hv_3.dk,
+        uint256S("6ee53b1261f2c9c0f7359ab236f87b52a0f1b0ce43305cdad92ebb63c350cbbe"));
+    EXPECT_THAT(
+        m_1_2hv_3.DefaultAddress().d,
+        testing::ElementsAreArray({ 0x03, 0x0f, 0xfb, 0x26, 0x3a, 0x93, 0x9e, 0x23, 0x0e, 0x96, 0xdd }));
+}
+
+TEST(ZIP32, ParseHDKeypathAccount) {
+    auto expect_account = [](std::string sAccount, uint32_t coinType, long expected) {
+        auto result = libzcash::ParseHDKeypathAccount(32, coinType, sAccount);
+        EXPECT_TRUE(result.has_value());
+        EXPECT_EQ(result.value(), expected);
+    };
+
+    std::string sAccount = "m/32'/1234'/5'";
+    expect_account(sAccount, 1234, 5);
+
+    sAccount = "m/32'/1234'/50'";
+    expect_account(sAccount, 1234, 50);
+
+    sAccount = "m/32'/1234'/5'/0";
+    expect_account(sAccount, 1234, 5);
+
+    sAccount = "m/32'/133'/2147483646'/1";
+    expect_account(sAccount, 133, 2147483646);
+}
+
+TEST(ZIP32, diversifier_index_t_increment)
+{
+    libzcash::diversifier_index_t d_zero(0);
+    libzcash::diversifier_index_t d_one(1);
+    EXPECT_TRUE(d_zero.increment());
+    EXPECT_EQ(d_zero, d_one);
+}
+
+TEST(ZIP32, diversifier_index_t_lt)
+{
+    EXPECT_TRUE(libzcash::diversifier_index_t(0) < libzcash::diversifier_index_t(1));
+    EXPECT_FALSE(libzcash::diversifier_index_t(1) < libzcash::diversifier_index_t(0));
+    EXPECT_FALSE(libzcash::diversifier_index_t(0) < libzcash::diversifier_index_t(0));
+    EXPECT_TRUE(libzcash::diversifier_index_t(0xfffffffe) < libzcash::diversifier_index_t(0xffffffff));
+    EXPECT_FALSE(libzcash::diversifier_index_t(0xffffffff) < libzcash::diversifier_index_t(0xfffffffe));
+    EXPECT_TRUE(libzcash::diversifier_index_t(0x01) < libzcash::diversifier_index_t(0xffffffff));
+    EXPECT_FALSE(libzcash::diversifier_index_t(0xffffffff) < libzcash::diversifier_index_t(0x01));
+}
+
+TEST(ZIP32, DeriveChangeAddress)
+{
+    std::vector<unsigned char, secure_allocator<unsigned char>> rawSeed {
+        0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16,
+        17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31};
+    HDSeed seed(rawSeed);
+
+    auto accountSk = libzcash::SaplingExtendedSpendingKey::ForAccount(seed, 1, 0);
+    auto extfvk = accountSk.first.ToXFVK();
+    auto changeSk = accountSk.first.DeriveInternalKey();
+
+    EXPECT_EQ(changeSk.ToXFVK().DefaultAddress(), extfvk.GetChangeAddress());
+}
+
diff --git a/depend/zcash/src/gtest/utils.cpp b/depend/zcash/src/gtest/utils.cpp
new file mode 100644
index 000000000..bb367c5cc
--- /dev/null
+++ b/depend/zcash/src/gtest/utils.cpp
@@ -0,0 +1,68 @@
+#include "gtest/utils.h"
+#include "rpc/server.h"
+#include "wallet/wallet.h"
+
+int GenZero(int n)
+{
+    return 0;
+}
+
+int GenMax(int n)
+{
+    return n-1;
+}
+
+void LoadProofParameters() {
+    fs::path sapling_spend = ZC_GetParamsDir() / "sapling-spend.params";
+    fs::path sapling_output = ZC_GetParamsDir() / "sapling-output.params";
+    fs::path sprout_groth16 = ZC_GetParamsDir() / "sprout-groth16.params";
+
+    static_assert(
+        sizeof(fs::path::value_type) == sizeof(codeunit),
+        "librustzcash not configured correctly");
+    auto sapling_spend_str = sapling_spend.native();
+    auto sapling_output_str = sapling_output.native();
+    auto sprout_groth16_str = sprout_groth16.native();
+
+    librustzcash_init_zksnark_params(
+        reinterpret_cast<const codeunit*>(sapling_spend_str.c_str()),
+        sapling_spend_str.length(),
+        reinterpret_cast<const codeunit*>(sapling_output_str.c_str()),
+        sapling_output_str.length(),
+        reinterpret_cast<const codeunit*>(sprout_groth16_str.c_str()),
+        sprout_groth16_str.length()
+    );
+}
+
+void LoadGlobalWallet() {
+    CCoinsViewDB *pcoinsdbview;
+    bool fFirstRun;
+
+    // someone else might have initialized the bitdb, and we need fDbEnvInit to be false for MakeMock
+    bitdb.Flush(true);
+    bitdb.Reset();
+
+    bitdb.MakeMock();
+
+    pwalletMain = new CWallet(Params());
+    pwalletMain->LoadWallet(fFirstRun);
+    if (!pwalletMain->HaveMnemonicSeed()) {
+        pwalletMain->GenerateNewSeed();
+        pwalletMain->VerifyMnemonicSeed(pwalletMain->GetMnemonicSeed().value().GetMnemonic());
+    }
+
+    RegisterValidationInterface(pwalletMain);
+    RegisterWalletRPCCommands(tableRPC);
+
+    pcoinsdbview = new CCoinsViewDB(1 << 23, true);
+    pcoinsTip = new CCoinsViewCache(pcoinsdbview);
+}
+
+void UnloadGlobalWallet() {
+    UnregisterValidationInterface(pwalletMain);
+    delete pwalletMain;
+    pwalletMain = NULL;
+
+    bitdb.Flush(true);
+    bitdb.Reset();
+}
\ No newline at end of file
diff --git a/depend/zcash/src/gtest/utils.h b/depend/zcash/src/gtest/utils.h
new file mode 100644
index 000000000..147ec99ab
--- /dev/null
+++ b/depend/zcash/src/gtest/utils.h
@@ -0,0 +1,32 @@
+#ifndef BITCOIN_GTEST_UTILS_H
+#define BITCOIN_GTEST_UTILS_H
+
+#include "random.h"
+#include "util.h"
+#include "key_io.h"
+
+int GenZero(int n);
+int GenMax(int n);
+void LoadProofParameters();
+void LoadGlobalWallet();
+void UnloadGlobalWallet();
+
+extern uint256 insecure_rand_seed;
+extern FastRandomContext insecure_rand_ctx;
+
+static inline void seed_insecure_rand(bool fDeterministic = false)
+{
+    if (fDeterministic) {
+        insecure_rand_seed = uint256();
+    } else {
+        insecure_rand_seed = GetRandHash();
+    }
+    insecure_rand_ctx = FastRandomContext(insecure_rand_seed);
+}
+
+static inline uint32_t insecure_rand(void)
+{
+    return insecure_rand_ctx.rand32();
+}
+
+#endif
diff --git a/depend/zcash/src/hash.cpp b/depend/zcash/src/hash.cpp
new file mode 100644
index 000000000..fe60b4005
--- /dev/null
+++ b/depend/zcash/src/hash.cpp
@@ -0,0 +1,210 @@
+// Copyright (c) 2013-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "hash.h"
+#include "crypto/common.h"
+#include "crypto/hmac_sha512.h"
+#include "pubkey.h"
+
+
+inline uint32_t ROTL32(uint32_t x, int8_t r)
+{
+    return (x << r) | (x >> (32 - r));
+}
+
+unsigned int MurmurHash3(unsigned int nHashSeed, const std::vector<unsigned char>& vDataToHash)
+{
+    // The following is MurmurHash3 (x86_32), see https://github.com/aappleby/smhasher/blob/master/src/MurmurHash3.cpp
+    uint32_t h1 = nHashSeed;
+    if (vDataToHash.size() > 0)
+    {
+        const uint32_t c1 = 0xcc9e2d51;
+        const uint32_t c2 = 0x1b873593;
+
+        const int nblocks = vDataToHash.size() / 4;
+
+        //----------
+        // body
+        const uint8_t* blocks = &vDataToHash[0] + nblocks * 4;
+
+        for (int i = -nblocks; i; i++) {
+            uint32_t k1 = ReadLE32(blocks + i*4);
+
+            k1 *= c1;
+            k1 = ROTL32(k1, 15);
+            k1 *= c2;
+
+            h1 ^= k1;
+            h1 = ROTL32(h1, 13);
+            h1 = h1 * 5 + 0xe6546b64;
+        }
+
+        //----------
+        // tail
+        const uint8_t* tail = (const uint8_t*)(&vDataToHash[0] + nblocks * 4);
+
+        uint32_t k1 = 0;
+
+        switch (vDataToHash.size() & 3) {
+        case 3:
+            k1 ^= tail[2] << 16;
+        case 2:
+            k1 ^= tail[1] << 8;
+        case 1:
+            k1 ^= tail[0];
+            k1 *= c1;
+            k1 = ROTL32(k1, 15);
+            k1 *= c2;
+            h1 ^= k1;
+        };
+    }
+
+    //----------
+    // finalization
+    h1 ^= vDataToHash.size();
+    h1 ^= h1 >> 16;
+    h1 *= 0x85ebca6b;
+    h1 ^= h1 >> 13;
+    h1 *= 0xc2b2ae35;
+    h1 ^= h1 >> 16;
+
+    return h1;
+}
+
+void BIP32Hash(const ChainCode &chainCode, unsigned int nChild, unsigned char header, const unsigned char data[32], unsigned char output[64])
+{
+    unsigned char num[4];
+    num[0] = (nChild >> 24) & 0xFF;
+    num[1] = (nChild >> 16) & 0xFF;
+    num[2] = (nChild >>  8) & 0xFF;
+    num[3] = (nChild >>  0) & 0xFF;
+    CHMAC_SHA512(chainCode.begin(), chainCode.size()).Write(&header, 1).Write(data, 32).Write(num, 4).Finalize(output);
+}
+
+#define ROTL(x, b) (uint64_t)(((x) << (b)) | ((x) >> (64 - (b))))
+
+#define SIPROUND do { \
+    v0 += v1; v1 = ROTL(v1, 13); v1 ^= v0; \
+    v0 = ROTL(v0, 32); \
+    v2 += v3; v3 = ROTL(v3, 16); v3 ^= v2; \
+    v0 += v3; v3 = ROTL(v3, 21); v3 ^= v0; \
+    v2 += v1; v1 = ROTL(v1, 17); v1 ^= v2; \
+    v2 = ROTL(v2, 32); \
+} while (0)
+
+CSipHasher::CSipHasher(uint64_t k0, uint64_t k1)
+{
+    v[0] = 0x736f6d6570736575ULL ^ k0;
+    v[1] = 0x646f72616e646f6dULL ^ k1;
+    v[2] = 0x6c7967656e657261ULL ^ k0;
+    v[3] = 0x7465646279746573ULL ^ k1;
+    count = 0;
+    tmp = 0;
+}
+
+CSipHasher& CSipHasher::Write(uint64_t data)
+{
+    uint64_t v0 = v[0], v1 = v[1], v2 = v[2], v3 = v[3];
+
+    assert(count % 8 == 0);
+
+    v3 ^= data;
+    SIPROUND;
+    SIPROUND;
+    v0 ^= data;
+
+    v[0] = v0;
+    v[1] = v1;
+    v[2] = v2;
+    v[3] = v3;
+
+    count += 8;
+    return *this;
+}
+
+CSipHasher& CSipHasher::Write(const unsigned char* data, size_t size)
+{
+    uint64_t v0 = v[0], v1 = v[1], v2 = v[2], v3 = v[3];
+    uint64_t t = tmp;
+    int c = count;
+
+    while (size--) {
+        t |= ((uint64_t)(*(data++))) << (8 * (c % 8));
+        c++;
+        if ((c & 7) == 0) {
+            v3 ^= t;
+            SIPROUND;
+            SIPROUND;
+            v0 ^= t;
+            t = 0;
+        }
+    }
+
+    v[0] = v0;
+    v[1] = v1;
+    v[2] = v2;
+    v[3] = v3;
+    count = c;
+    tmp = t;
+
+    return *this;
+}
+
+uint64_t CSipHasher::Finalize() const
+{
+    uint64_t v0 = v[0], v1 = v[1], v2 = v[2], v3 = v[3];
+
+    uint64_t t = tmp | (((uint64_t)count) << 56);
+
+    v3 ^= t;
+    SIPROUND;
+    SIPROUND;
+    v0 ^= t;
+    v2 ^= 0xFF;
+    SIPROUND;
+    SIPROUND;
+    SIPROUND;
+    SIPROUND;
+    return v0 ^ v1 ^ v2 ^ v3;
+}
+
+uint64_t SipHashUint256(uint64_t k0, uint64_t k1, const uint256& val)
+{
+    /* Specialized implementation for efficiency */
+    uint64_t d = val.GetUint64(0);
+
+    uint64_t v0 = 0x736f6d6570736575ULL ^ k0;
+    uint64_t v1 = 0x646f72616e646f6dULL ^ k1;
+    uint64_t v2 = 0x6c7967656e657261ULL ^ k0;
+    uint64_t v3 = 0x7465646279746573ULL ^ k1 ^ d;
+
+    SIPROUND;
+    SIPROUND;
+    v0 ^= d;
+    d = val.GetUint64(1);
+    v3 ^= d;
+    SIPROUND;
+    SIPROUND;
+    v0 ^= d;
+    d = val.GetUint64(2);
+    v3 ^= d;
+    SIPROUND;
+    SIPROUND;
+    v0 ^= d;
+    d = val.GetUint64(3);
+    v3 ^= d;
+    SIPROUND;
+    SIPROUND;
+    v0 ^= d;
+    v3 ^= ((uint64_t)4) << 59;
+    SIPROUND;
+    SIPROUND;
+    v0 ^= ((uint64_t)4) << 59;
+    v2 ^= 0xFF;
+    SIPROUND;
+    SIPROUND;
+    SIPROUND;
+    SIPROUND;
+    return v0 ^ v1 ^ v2 ^ v3;
+}
diff --git a/depend/zcash/src/hash.h b/depend/zcash/src/hash.h
new file mode 100644
index 000000000..bc6e79c35
--- /dev/null
+++ b/depend/zcash/src/hash.h
@@ -0,0 +1,240 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_HASH_H
+#define BITCOIN_HASH_H
+
+#include "crypto/ripemd160.h"
+#include "crypto/sha256.h"
+#include "prevector.h"
+#include "serialize.h"
+#include "uint256.h"
+#include "version.h"
+
+#include <vector>
+
+#include <rust/blake2b.h>
+
+typedef uint256 ChainCode;
+
+/** A hasher class for Bitcoin's 256-bit hash (double SHA-256). */
+class CHash256 {
+private:
+    CSHA256 sha;
+public:
+    static const size_t OUTPUT_SIZE = CSHA256::OUTPUT_SIZE;
+
+    void Finalize(unsigned char hash[OUTPUT_SIZE]) {
+        unsigned char buf[sha.OUTPUT_SIZE];
+        sha.Finalize(buf);
+        sha.Reset().Write(buf, sha.OUTPUT_SIZE).Finalize(hash);
+    }
+
+    CHash256& Write(const unsigned char *data, size_t len) {
+        sha.Write(data, len);
+        return *this;
+    }
+
+    CHash256& Reset() {
+        sha.Reset();
+        return *this;
+    }
+};
+
+/** A hasher class for Bitcoin's 160-bit hash (SHA-256 + RIPEMD-160). */
+class CHash160 {
+private:
+    CSHA256 sha;
+public:
+    static const size_t OUTPUT_SIZE = CRIPEMD160::OUTPUT_SIZE;
+
+    void Finalize(unsigned char hash[OUTPUT_SIZE]) {
+        unsigned char buf[sha.OUTPUT_SIZE];
+        sha.Finalize(buf);
+        CRIPEMD160().Write(buf, sha.OUTPUT_SIZE).Finalize(hash);
+    }
+
+    CHash160& Write(const unsigned char *data, size_t len) {
+        sha.Write(data, len);
+        return *this;
+    }
+
+    CHash160& Reset() {
+        sha.Reset();
+        return *this;
+    }
+};
+
+/** Compute the 256-bit hash of an object. */
+template<typename T1>
+inline uint256 Hash(const T1 pbegin, const T1 pend)
+{
+    static const unsigned char pblank[1] = {};
+    uint256 result;
+    CHash256().Write(pbegin == pend ? pblank : (const unsigned char*)&pbegin[0], (pend - pbegin) * sizeof(pbegin[0]))
+              .Finalize((unsigned char*)&result);
+    return result;
+}
+
+/** Compute the 256-bit hash of the concatenation of two objects. */
+template<typename T1, typename T2>
+inline uint256 Hash(const T1 p1begin, const T1 p1end,
+                    const T2 p2begin, const T2 p2end) {
+    static const unsigned char pblank[1] = {};
+    uint256 result;
+    CHash256().Write(p1begin == p1end ? pblank : (const unsigned char*)&p1begin[0], (p1end - p1begin) * sizeof(p1begin[0]))
+              .Write(p2begin == p2end ? pblank : (const unsigned char*)&p2begin[0], (p2end - p2begin) * sizeof(p2begin[0]))
+              .Finalize((unsigned char*)&result);
+    return result;
+}
+
+/** Compute the 160-bit hash an object. */
+template<typename T1>
+inline uint160 Hash160(const T1 pbegin, const T1 pend)
+{
+    static unsigned char pblank[1] = {};
+    uint160 result;
+    CHash160().Write(pbegin == pend ? pblank : (const unsigned char*)&pbegin[0], (pend - pbegin) * sizeof(pbegin[0]))
+              .Finalize((unsigned char*)&result);
+    return result;
+}
+
+/** Compute the 160-bit hash of a vector. */
+inline uint160 Hash160(const std::vector<unsigned char>& vch)
+{
+    return Hash160(vch.begin(), vch.end());
+}
+
+/** Compute the 160-bit hash of a vector. */
+template<unsigned int N>
+inline uint160 Hash160(const prevector<N, unsigned char>& vch)
+{
+    return Hash160(vch.begin(), vch.end());
+}
+
+/** A writer stream (for serialization) that computes a 256-bit hash. */
+class CHashWriter
+{
+private:
+    CHash256 ctx;
+
+    const int nType;
+    const int nVersion;
+public:
+
+    CHashWriter(int nTypeIn, int nVersionIn) : nType(nTypeIn), nVersion(nVersionIn) {}
+
+    int GetType() const { return nType; }
+    int GetVersion() const { return nVersion; }
+
+    void write(const char *pch, size_t size) {
+        ctx.Write((const unsigned char*)pch, size);
+    }
+
+    // invalidates the object
+    uint256 GetHash() {
+        uint256 result;
+        ctx.Finalize((unsigned char*)&result);
+        return result;
+    }
+
+    template<typename T>
+    CHashWriter& operator<<(const T& obj) {
+        // Serialize to this stream
+        ::Serialize(*this, obj);
+        return (*this);
+    }
+};
+
+
+/** A writer stream (for serialization) that computes a 256-bit BLAKE2b hash. */
+class CBLAKE2bWriter
+{
+private:
+    BLAKE2bState* state;
+
+public:
+    int nType;
+    int nVersion;
+
+    CBLAKE2bWriter(int nTypeIn, int nVersionIn, const unsigned char* personal) : nType(nTypeIn), nVersion(nVersionIn) {
+        state = blake2b_init(32, personal);
+    }
+    ~CBLAKE2bWriter() {
+        blake2b_free(state);
+    }
+
+    int GetType() const { return nType; }
+    int GetVersion() const { return nVersion; }
+
+    CBLAKE2bWriter& write(const char *pch, size_t size) {
+        blake2b_update(state, (const unsigned char*)pch, size);
+        return (*this);
+    }
+
+    // invalidates the object
+    uint256 GetHash() {
+        uint256 result;
+        blake2b_finalize(state, (unsigned char*)&result, 32);
+        return result;
+    }
+
+    template<typename T>
+    CBLAKE2bWriter& operator<<(const T& obj) {
+        // Serialize to this stream
+        ::Serialize(*this, obj);
+        return (*this);
+    }
+};
+
+
+/** Compute the 256-bit hash of an object's serialization. */
+template<typename T>
+uint256 SerializeHash(const T& obj, int nType=SER_GETHASH, int nVersion=PROTOCOL_VERSION)
+{
+    CHashWriter ss(nType, nVersion);
+    ss << obj;
+    return ss.GetHash();
+}
+
+unsigned int MurmurHash3(unsigned int nHashSeed, const std::vector<unsigned char>& vDataToHash);
+
+void BIP32Hash(const ChainCode &chainCode, unsigned int nChild, unsigned char header, const unsigned char data[32], unsigned char output[64]);
+
+/** SipHash-2-4 */
+class CSipHasher
+{
+private:
+    uint64_t v[4];
+    uint64_t tmp;
+    int count;
+
+public:
+    /** Construct a SipHash calculator initialized with 128-bit key (k0, k1) */
+    CSipHasher(uint64_t k0, uint64_t k1);
+    /** Hash a 64-bit integer worth of data
+     *  It is treated as if this was the little-endian interpretation of 8 bytes.
+     *  This function can only be used when a multiple of 8 bytes have been written so far.
+     */
+    CSipHasher& Write(uint64_t data);
+    /** Hash arbitrary bytes. */
+    CSipHasher& Write(const unsigned char* data, size_t size);
+    /** Compute the 64-bit SipHash-2-4 of the data written so far. The object remains untouched. */
+    uint64_t Finalize() const;
+};
+
+/** Optimized SipHash-2-4 implementation for uint256.
+ *
+ *  It is identical to:
+ *    SipHasher(k0, k1)
+ *      .Write(val.GetUint64(0))
+ *      .Write(val.GetUint64(1))
+ *      .Write(val.GetUint64(2))
+ *      .Write(val.GetUint64(3))
+ *      .Finalize()
+ */
+uint64_t SipHashUint256(uint64_t k0, uint64_t k1, const uint256& val);
+
+#endif // BITCOIN_HASH_H
diff --git a/depend/zcash/src/httprpc.cpp b/depend/zcash/src/httprpc.cpp
new file mode 100644
index 000000000..ac83b1692
--- /dev/null
+++ b/depend/zcash/src/httprpc.cpp
@@ -0,0 +1,250 @@
+#include "httprpc.h"
+
+#include "chainparams.h"
+#include "httpserver.h"
+#include "key_io.h"
+#include "rpc/protocol.h"
+#include "rpc/server.h"
+#include "random.h"
+#include "sync.h"
+#include "util.h"
+#include "utilstrencodings.h"
+#include "ui_interface.h"
+#include "crypto/hmac_sha256.h"
+#include <stdio.h>
+
+#include <boost/algorithm/string.hpp> // boost::trim
+
+/** WWW-Authenticate to present with 401 Unauthorized response */
+static const char* WWW_AUTH_HEADER_DATA = "Basic realm=\"jsonrpc\"";
+
+/** Simple one-shot callback timer to be used by the RPC mechanism to e.g.
+ * re-lock the wallet.
+ */
+class HTTPRPCTimer : public RPCTimerBase
+{
+public:
+    HTTPRPCTimer(struct event_base* eventBase, std::function<void(void)>& func, int64_t millis) :
+        ev(eventBase, false, func)
+    {
+        struct timeval tv;
+        tv.tv_sec = millis/1000;
+        tv.tv_usec = (millis%1000)*1000;
+        ev.trigger(&tv);
+    }
+private:
+    HTTPEvent ev;
+};
+
+class HTTPRPCTimerInterface : public RPCTimerInterface
+{
+public:
+    HTTPRPCTimerInterface(struct event_base* base) : base(base)
+    {
+    }
+    const char* Name()
+    {
+        return "HTTP";
+    }
+    RPCTimerBase* NewTimer(std::function<void(void)>& func, int64_t millis)
+    {
+        return new HTTPRPCTimer(base, func, millis);
+    }
+private:
+    struct event_base* base;
+};
+
+
+/* Pre-base64-encoded authentication token */
+static std::string strRPCUserColonPass;
+/* Stored RPC timer interface (for unregistration) */
+static HTTPRPCTimerInterface* httpRPCTimerInterface = 0;
+
+static void JSONErrorReply(HTTPRequest* req, const UniValue& objError, const UniValue& id)
+{
+    // Send error reply from json-rpc error object
+    int nStatus = HTTP_INTERNAL_SERVER_ERROR;
+    int code = find_value(objError, "code").get_int();
+
+    if (code == RPC_INVALID_REQUEST)
+        nStatus = HTTP_BAD_REQUEST;
+    else if (code == RPC_METHOD_NOT_FOUND)
+        nStatus = HTTP_NOT_FOUND;
+
+    std::string strReply = JSONRPCReply(NullUniValue, objError, id);
+
+    req->WriteHeader("Content-Type", "application/json");
+    req->WriteReply(nStatus, strReply);
+}
+
+//This function checks username and password against -rpcauth
+//entries from config file.
+static bool multiUserAuthorized(std::string strUserPass)
+{    
+    if (strUserPass.find(":") == std::string::npos) {
+        return false;
+    }
+    std::string strUser = strUserPass.substr(0, strUserPass.find(":"));
+    std::string strPass = strUserPass.substr(strUserPass.find(":") + 1);
+
+    if (mapMultiArgs.count("-rpcauth") > 0) {
+        //Search for multi-user login/pass "rpcauth" from config
+        for (std::string strRPCAuth : mapMultiArgs["-rpcauth"])
+        {
+            std::vector<std::string> vFields;
+            boost::split(vFields, strRPCAuth, boost::is_any_of(":$"));
+            if (vFields.size() != 3) {
+                //Incorrect formatting in config file
+                continue;
+            }
+
+            std::string strName = vFields[0];
+            if (!TimingResistantEqual(strName, strUser)) {
+                continue;
+            }
+
+            std::string strSalt = vFields[1];
+            std::string strHash = vFields[2];
+
+            unsigned int KEY_SIZE = 32;
+            unsigned char *out = new unsigned char[KEY_SIZE]; 
+            
+            CHMAC_SHA256(reinterpret_cast<const unsigned char*>(strSalt.c_str()), strSalt.size()).Write(reinterpret_cast<const unsigned char*>(strPass.c_str()), strPass.size()).Finalize(out);
+            std::vector<unsigned char> hexvec(out, out+KEY_SIZE);
+            std::string strHashFromPass = HexStr(hexvec);
+
+            if (TimingResistantEqual(strHashFromPass, strHash)) {
+                return true;
+            }
+        }
+    }
+    return false;
+}
+
+static bool RPCAuthorized(const std::string& strAuth)
+{
+    if (strRPCUserColonPass.empty()) // Belt-and-suspenders measure if InitRPCAuthentication was not called
+        return false;
+    if (strAuth.substr(0, 6) != "Basic ")
+        return false;
+    std::string strUserPass64 = strAuth.substr(6);
+    boost::trim(strUserPass64);
+    std::string strUserPass = DecodeBase64(strUserPass64);
+    
+    //Check if authorized under single-user field
+    if (TimingResistantEqual(strUserPass, strRPCUserColonPass)) {
+        return true;
+    }
+    return multiUserAuthorized(strUserPass);
+}
+
+static bool HTTPReq_JSONRPC(HTTPRequest* req, const std::string &)
+{
+    // JSONRPC handles only POST
+    if (req->GetRequestMethod() != HTTPRequest::POST) {
+        req->WriteReply(HTTP_BAD_METHOD, "JSONRPC server handles only POST requests");
+        return false;
+    }
+    // Check authorization
+    std::pair<bool, std::string> authHeader = req->GetHeader("authorization");
+    if (!authHeader.first) {
+        req->WriteHeader("WWW-Authenticate", WWW_AUTH_HEADER_DATA);
+        req->WriteReply(HTTP_UNAUTHORIZED);
+        return false;
+    }
+
+    if (!RPCAuthorized(authHeader.second)) {
+        LogPrintf("ThreadRPCServer incorrect password attempt from %s\n", req->GetPeer().ToString());
+
+        /* Deter brute-forcing
+           If this results in a DoS the user really
+           shouldn't have their RPC port exposed. */
+        MilliSleep(250);
+
+        req->WriteHeader("WWW-Authenticate", WWW_AUTH_HEADER_DATA);
+        req->WriteReply(HTTP_UNAUTHORIZED);
+        return false;
+    }
+
+    JSONRequest jreq;
+    try {
+        // Parse request
+        UniValue valRequest;
+        if (!valRequest.read(req->ReadBody()))
+            throw JSONRPCError(RPC_PARSE_ERROR, "Parse error");
+
+        std::string strReply;
+        // singleton request
+        if (valRequest.isObject()) {
+            jreq.parse(valRequest);
+
+            UniValue result = tableRPC.execute(jreq.strMethod, jreq.params);
+
+            // Send reply
+            strReply = JSONRPCReply(result, NullUniValue, jreq.id);
+
+        // array of requests
+        } else if (valRequest.isArray())
+            strReply = JSONRPCExecBatch(valRequest.get_array());
+        else
+            throw JSONRPCError(RPC_PARSE_ERROR, "Top-level object parse error");
+
+        req->WriteHeader("Content-Type", "application/json");
+        req->WriteReply(HTTP_OK, strReply);
+    } catch (const UniValue& objError) {
+        JSONErrorReply(req, objError, jreq.id);
+        return false;
+    } catch (const std::exception& e) {
+        JSONErrorReply(req, JSONRPCError(RPC_PARSE_ERROR, e.what()), jreq.id);
+        return false;
+    }
+    return true;
+}
+
+static bool InitRPCAuthentication()
+{
+    if (mapArgs["-rpcpassword"] == "")
+    {
+        LogPrintf("No rpcpassword set - using random cookie authentication\n");
+        if (!GenerateAuthCookie(&strRPCUserColonPass)) {
+            uiInterface.ThreadSafeMessageBox(
+                _("Error: A fatal internal error occurred, see debug.log for details"), // Same message as AbortNode
+                "", CClientUIInterface::MSG_ERROR);
+            return false;
+        }
+    } else {
+        LogPrintf("Config options rpcuser and rpcpassword will soon be deprecated. Locally-run instances may remove rpcuser to use cookie-based auth, or may be replaced with rpcauth. Please see share/rpcuser for rpcauth auth generation.\n");
+        strRPCUserColonPass = mapArgs["-rpcuser"] + ":" + mapArgs["-rpcpassword"];
+    }
+    return true;
+}
+
+bool StartHTTPRPC()
+{
+    LogPrint("rpc", "Starting HTTP RPC server\n");
+    if (!InitRPCAuthentication())
+        return false;
+
+    RegisterHTTPHandler("/", true, HTTPReq_JSONRPC);
+
+    assert(EventBase());
+    httpRPCTimerInterface = new HTTPRPCTimerInterface(EventBase());
+    RPCRegisterTimerInterface(httpRPCTimerInterface);
+    return true;
+}
+
+void InterruptHTTPRPC()
+{
+    LogPrint("rpc", "Interrupting HTTP RPC server\n");
+}
+
+void StopHTTPRPC()
+{
+    LogPrint("rpc", "Stopping HTTP RPC server\n");
+    UnregisterHTTPHandler("/", true);
+    if (httpRPCTimerInterface) {
+        RPCUnregisterTimerInterface(httpRPCTimerInterface);
+        delete httpRPCTimerInterface;
+        httpRPCTimerInterface = 0;
+    }
+}
diff --git a/depend/zcash/src/httprpc.h b/depend/zcash/src/httprpc.h
new file mode 100644
index 000000000..cde795ae6
--- /dev/null
+++ b/depend/zcash/src/httprpc.h
@@ -0,0 +1,37 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_HTTPRPC_H
+#define BITCOIN_HTTPRPC_H
+
+#include <string>
+#include <map>
+
+class HTTPRequest;
+
+/** Start HTTP RPC subsystem.
+ * Precondition; HTTP and RPC has been started.
+ */
+bool StartHTTPRPC();
+/** Interrupt HTTP RPC subsystem.
+ */
+void InterruptHTTPRPC();
+/** Stop HTTP RPC subsystem.
+ * Precondition; HTTP and RPC has been stopped.
+ */
+void StopHTTPRPC();
+
+/** Start HTTP REST subsystem.
+ * Precondition; HTTP and RPC has been started.
+ */
+bool StartREST();
+/** Interrupt RPC REST subsystem.
+ */
+void InterruptREST();
+/** Stop HTTP REST subsystem.
+ * Precondition; HTTP and RPC has been stopped.
+ */
+void StopREST();
+
+#endif
diff --git a/depend/zcash/src/httpserver.cpp b/depend/zcash/src/httpserver.cpp
new file mode 100644
index 000000000..d1f41e26a
--- /dev/null
+++ b/depend/zcash/src/httpserver.cpp
@@ -0,0 +1,670 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "httpserver.h"
+
+#include "chainparamsbase.h"
+#include "compat.h"
+#include "util.h"
+#include "netbase.h"
+#include "rpc/protocol.h" // For HTTP status codes
+#include "sync.h"
+#include "ui_interface.h"
+
+#include <deque>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include <sys/types.h>
+#include <sys/stat.h>
+#include <signal.h>
+#include <future>
+
+#include <event2/event.h>
+#include <event2/http.h>
+#include <event2/thread.h>
+#include <event2/buffer.h>
+#include <event2/bufferevent.h>
+#include <event2/util.h>
+#include <event2/keyvalq_struct.h>
+
+#ifdef EVENT__HAVE_NETINET_IN_H
+#include <netinet/in.h>
+#ifdef _XOPEN_SOURCE_EXTENDED
+#include <arpa/inet.h>
+#endif
+#endif
+
+/** Maximum size of http request (request line + headers) */
+static const size_t MAX_HEADERS_SIZE = 8192;
+
+/** HTTP request work item */
+class HTTPWorkItem : public HTTPClosure
+{
+public:
+    HTTPWorkItem(std::unique_ptr<HTTPRequest> req, const std::string &path, const HTTPRequestHandler& func):
+        req(std::move(req)), path(path), func(func)
+    {
+    }
+    void operator()()
+    {
+        func(req.get(), path);
+    }
+
+    std::unique_ptr<HTTPRequest> req;
+
+private:
+    std::string path;
+    HTTPRequestHandler func;
+};
+
+/** Simple work queue for distributing work over multiple threads.
+ * Work items are simply callable objects.
+ */
+template <typename WorkItem>
+class WorkQueue
+{
+private:
+    /** Mutex protects entire object */
+    std::mutex cs;
+    std::condition_variable cond;
+    std::deque<std::unique_ptr<WorkItem>> queue;
+    bool running;
+    size_t maxDepth;
+
+public:
+    WorkQueue(size_t maxDepth) : running(true),
+                                 maxDepth(maxDepth)
+    {
+    }
+    /** Precondition: worker threads have all stopped (they have been joined).
+     */
+    ~WorkQueue()
+    {
+    }
+    /** Enqueue a work item */
+    bool Enqueue(WorkItem* item)
+    {
+        std::unique_lock<std::mutex> lock(cs);
+        if (queue.size() >= maxDepth) {
+            return false;
+        }
+        queue.emplace_back(std::unique_ptr<WorkItem>(item));
+        cond.notify_one();
+        return true;
+    }
+    /** Thread function */
+    void Run()
+    {
+        while (true) {
+            std::unique_ptr<WorkItem> i;
+            {
+                std::unique_lock<std::mutex> lock(cs);
+                while (running && queue.empty())
+                    cond.wait(lock);
+                if (!running)
+                    break;
+                i = std::move(queue.front());
+                queue.pop_front();
+            }
+            (*i)();
+        }
+    }
+    /** Interrupt and exit loops */
+    void Interrupt()
+    {
+        std::unique_lock<std::mutex> lock(cs);
+        running = false;
+        cond.notify_all();
+    }
+
+    /** Return current depth of queue */
+    size_t Depth()
+    {
+        std::unique_lock<std::mutex> lock(cs);
+        return queue.size();
+    }
+};
+
+struct HTTPPathHandler
+{
+    HTTPPathHandler() {}
+    HTTPPathHandler(std::string prefix, bool exactMatch, HTTPRequestHandler handler):
+        prefix(prefix), exactMatch(exactMatch), handler(handler)
+    {
+    }
+    std::string prefix;
+    bool exactMatch;
+    HTTPRequestHandler handler;
+};
+
+/** HTTP module state */
+
+//! libevent event loop
+static struct event_base* eventBase = 0;
+//! HTTP server
+struct evhttp* eventHTTP = 0;
+//! List of subnets to allow RPC connections from
+static std::vector<CSubNet> rpc_allow_subnets;
+//! Work queue for handling longer requests off the event loop thread
+static WorkQueue<HTTPClosure>* workQueue = 0;
+//! Handlers for (sub)paths
+std::vector<HTTPPathHandler> pathHandlers;
+//! Bound listening sockets
+std::vector<evhttp_bound_socket *> boundSockets;
+
+/** Check if a network address is allowed to access the HTTP server */
+static bool ClientAllowed(const CNetAddr& netaddr)
+{
+    if (!netaddr.IsValid())
+        return false;
+    for (const CSubNet& subnet : rpc_allow_subnets) {
+        if (subnet.Match(netaddr))
+            return true;
+    }
+    return false;
+}
+
+/** Initialize ACL list for HTTP server */
+static bool InitHTTPAllowList()
+{
+    rpc_allow_subnets.clear();
+    rpc_allow_subnets.push_back(CSubNet("127.0.0.0/8")); // always allow IPv4 local subnet
+    rpc_allow_subnets.push_back(CSubNet("::1"));         // always allow IPv6 localhost
+    if (mapMultiArgs.count("-rpcallowip")) {
+        const std::vector<std::string>& vAllow = mapMultiArgs["-rpcallowip"];
+        for (std::string strAllow : vAllow) {
+            CSubNet subnet(strAllow);
+            if (!subnet.IsValid()) {
+                uiInterface.ThreadSafeMessageBox(
+                    strprintf("Invalid -rpcallowip subnet specification: %s. Valid are a single IP (e.g. 1.2.3.4), a network/netmask (e.g. 1.2.3.4/255.255.255.0) or a network/CIDR (e.g. 1.2.3.4/24).", strAllow),
+                    "", CClientUIInterface::MSG_ERROR);
+                return false;
+            }
+            rpc_allow_subnets.push_back(subnet);
+        }
+    }
+    std::string strAllowed;
+    for (const CSubNet& subnet : rpc_allow_subnets) {
+        strAllowed += subnet.ToString() + " ";
+    }
+    LogPrint("http", "Allowing HTTP connections from: %s\n", strAllowed);
+    return true;
+}
+
+/** HTTP request method as string - use for logging only */
+static std::string RequestMethodString(HTTPRequest::RequestMethod m)
+{
+    switch (m) {
+    case HTTPRequest::GET:
+        return "GET";
+        break;
+    case HTTPRequest::POST:
+        return "POST";
+        break;
+    case HTTPRequest::HEAD:
+        return "HEAD";
+        break;
+    case HTTPRequest::PUT:
+        return "PUT";
+        break;
+    default:
+        return "unknown";
+    }
+}
+
+/** HTTP request callback */
+static void http_request_cb(struct evhttp_request* req, void* arg)
+{
+    // Disable reading to work around a libevent bug, fixed in 2.2.0.
+    if (event_get_version_number() >= 0x02010600 && event_get_version_number() < 0x02020001) {
+        evhttp_connection* conn = evhttp_request_get_connection(req);
+        if (conn) {
+            bufferevent* bev = evhttp_connection_get_bufferevent(conn);
+            if (bev) {
+                bufferevent_disable(bev, EV_READ);
+            }
+        }
+    }
+    std::unique_ptr<HTTPRequest> hreq(new HTTPRequest(req));
+
+    LogPrint("http", "Received a %s request for %s from %s\n",
+             RequestMethodString(hreq->GetRequestMethod()), hreq->GetURI(), hreq->GetPeer().ToString());
+
+    // Early address-based allow check
+    if (!ClientAllowed(hreq->GetPeer())) {
+        hreq->WriteReply(HTTP_FORBIDDEN);
+        return;
+    }
+
+    // Early reject unknown HTTP methods
+    if (hreq->GetRequestMethod() == HTTPRequest::UNKNOWN) {
+        hreq->WriteReply(HTTP_BADMETHOD);
+        return;
+    }
+
+    // Find registered handler for prefix
+    std::string strURI = hreq->GetURI();
+    std::string path;
+    std::vector<HTTPPathHandler>::const_iterator i = pathHandlers.begin();
+    std::vector<HTTPPathHandler>::const_iterator iend = pathHandlers.end();
+    for (; i != iend; ++i) {
+        bool match = false;
+        if (i->exactMatch)
+            match = (strURI == i->prefix);
+        else
+            match = (strURI.substr(0, i->prefix.size()) == i->prefix);
+        if (match) {
+            path = strURI.substr(i->prefix.size());
+            break;
+        }
+    }
+
+    // Dispatch to worker thread
+    if (i != iend) {
+        std::unique_ptr<HTTPWorkItem> item(new HTTPWorkItem(std::move(hreq), path, i->handler));
+        assert(workQueue);
+        if (workQueue->Enqueue(item.get()))
+        {
+            item.release(); /* if true, queue took ownership */
+        } else {
+            LogPrintf("WARNING: request rejected because http work queue depth exceeded, it can be increased with the -rpcworkqueue= setting\n");
+            item->req->WriteReply(HTTP_INTERNAL, "Work queue depth exceeded");
+        }
+    } else {
+        hreq->WriteReply(HTTP_NOTFOUND);
+    }
+}
+
+/** Callback to reject HTTP requests after shutdown. */
+static void http_reject_request_cb(struct evhttp_request* req, void*)
+{
+    LogPrint("http", "Rejecting request while shutting down\n");
+    evhttp_send_error(req, HTTP_SERVUNAVAIL, NULL);
+}
+
+/** Event dispatcher thread */
+static bool ThreadHTTP(struct event_base* base, struct evhttp* http)
+{
+    RenameThread("zcash-http");
+    LogPrint("http", "Entering http event loop\n");
+    event_base_dispatch(base);
+    // Event loop will be interrupted by InterruptHTTPServer()
+    LogPrint("http", "Exited http event loop\n");
+    return event_base_got_break(base) == 0;
+}
+
+/** Bind HTTP server to specified addresses */
+static bool HTTPBindAddresses(struct evhttp* http)
+{
+    int defaultPort = GetArg("-rpcport", BaseParams().RPCPort());
+    std::vector<std::pair<std::string, uint16_t> > endpoints;
+
+    // Determine what addresses to bind to
+    if (!mapArgs.count("-rpcallowip")) { // Default to loopback if not allowing external IPs
+        endpoints.push_back(std::make_pair("::1", defaultPort));
+        endpoints.push_back(std::make_pair("127.0.0.1", defaultPort));
+        if (mapArgs.count("-rpcbind")) {
+            LogPrintf("WARNING: option -rpcbind was ignored because -rpcallowip was not specified, refusing to allow everyone to connect\n");
+        }
+    } else if (mapArgs.count("-rpcbind")) { // Specific bind address
+        const std::vector<std::string>& vbind = mapMultiArgs["-rpcbind"];
+        for (std::vector<std::string>::const_iterator i = vbind.begin(); i != vbind.end(); ++i) {
+            int port = defaultPort;
+            std::string host;
+            SplitHostPort(*i, port, host);
+            endpoints.push_back(std::make_pair(host, port));
+        }
+    } else { // No specific bind address specified, bind to any
+        endpoints.push_back(std::make_pair("::", defaultPort));
+        endpoints.push_back(std::make_pair("0.0.0.0", defaultPort));
+    }
+
+    // Bind addresses
+    for (std::vector<std::pair<std::string, uint16_t> >::iterator i = endpoints.begin(); i != endpoints.end(); ++i) {
+        LogPrint("http", "Binding RPC on address %s port %i\n", i->first, i->second);
+        evhttp_bound_socket *bind_handle = evhttp_bind_socket_with_handle(http, i->first.empty() ? NULL : i->first.c_str(), i->second);
+        if (bind_handle) {
+            boundSockets.push_back(bind_handle);
+        } else {
+            LogPrintf("Binding RPC on address %s port %i failed.\n", i->first, i->second);
+        }
+    }
+    return !boundSockets.empty();
+}
+
+/** Simple wrapper to set thread name and run work queue */
+static void HTTPWorkQueueRun(WorkQueue<HTTPClosure>* queue)
+{
+    RenameThread("zcash-httpworker");
+    queue->Run();
+}
+
+/** libevent event log callback */
+static void libevent_log_cb(int severity, const char *msg)
+{
+#ifndef EVENT_LOG_WARN
+// EVENT_LOG_WARN was added in 2.0.19; but before then _EVENT_LOG_WARN existed.
+# define EVENT_LOG_WARN _EVENT_LOG_WARN
+#endif
+    if (severity >= EVENT_LOG_WARN) // Log warn messages and higher without debug category
+        LogPrintf("libevent: %s\n", msg);
+    else
+        LogPrint("libevent", "libevent: %s\n", msg);
+}
+
+bool InitHTTPServer()
+{
+    struct evhttp* http = 0;
+    struct event_base* base = 0;
+
+    if (!InitHTTPAllowList())
+        return false;
+
+    if (GetBoolArg("-rpcssl", false)) {
+        uiInterface.ThreadSafeMessageBox(
+            "SSL mode for RPC (-rpcssl) is no longer supported.",
+            "", CClientUIInterface::MSG_ERROR);
+        return false;
+    }
+
+    // Redirect libevent's logging to our own log
+    event_set_log_callback(&libevent_log_cb);
+#if LIBEVENT_VERSION_NUMBER >= 0x02010100
+    // If -debug=libevent, set full libevent debugging.
+    // Otherwise, disable all libevent debugging.
+    if (LogAcceptCategory("libevent"))
+        event_enable_debug_logging(EVENT_DBG_ALL);
+    else
+        event_enable_debug_logging(EVENT_DBG_NONE);
+#endif
+#ifdef WIN32
+    evthread_use_windows_threads();
+#else
+    evthread_use_pthreads();
+#endif
+
+    base = event_base_new(); // XXX RAII
+    if (!base) {
+        LogPrintf("Couldn't create an event_base: exiting\n");
+        return false;
+    }
+
+    /* Create a new evhttp object to handle requests. */
+    http = evhttp_new(base); // XXX RAII
+    if (!http) {
+        LogPrintf("couldn't create evhttp. Exiting.\n");
+        event_base_free(base);
+        return false;
+    }
+
+    evhttp_set_timeout(http, GetArg("-rpcservertimeout", DEFAULT_HTTP_SERVER_TIMEOUT));
+    evhttp_set_max_headers_size(http, MAX_HEADERS_SIZE);
+    evhttp_set_max_body_size(http, MAX_SIZE);
+    evhttp_set_gencb(http, http_request_cb, NULL);
+
+    if (!HTTPBindAddresses(http)) {
+        LogPrintf("Unable to bind any endpoint for RPC server\n");
+        evhttp_free(http);
+        event_base_free(base);
+        return false;
+    }
+
+    LogPrint("http", "Initialized HTTP server\n");
+    int workQueueDepth = std::max((long)GetArg("-rpcworkqueue", DEFAULT_HTTP_WORKQUEUE), 1L);
+    LogPrintf("HTTP: creating work queue of depth %d\n", workQueueDepth);
+
+    workQueue = new WorkQueue<HTTPClosure>(workQueueDepth);
+    eventBase = base;
+    eventHTTP = http;
+    return true;
+}
+
+std::thread threadHTTP;
+std::future<bool> threadResult;
+static std::vector<std::thread> g_thread_http_workers;
+
+bool StartHTTPServer()
+{
+    LogPrint("http", "Starting HTTP server\n");
+    int rpcThreads = std::max((long)GetArg("-rpcthreads", DEFAULT_HTTP_THREADS), 1L);
+    LogPrintf("HTTP: starting %d worker threads\n", rpcThreads);
+    std::packaged_task<bool(event_base*, evhttp*)> task(ThreadHTTP);
+    threadResult = task.get_future();
+    threadHTTP = std::thread(std::move(task), eventBase, eventHTTP);
+
+    for (int i = 0; i < rpcThreads; i++) {
+        g_thread_http_workers.emplace_back(HTTPWorkQueueRun, workQueue);
+    }
+    return true;
+}
+
+void InterruptHTTPServer()
+{
+    LogPrint("http", "Interrupting HTTP server\n");
+    if (eventHTTP) {
+        // Unlisten sockets
+        for (evhttp_bound_socket *socket : boundSockets) {
+            evhttp_del_accept_socket(eventHTTP, socket);
+        }
+        // Reject requests on current connections
+        evhttp_set_gencb(eventHTTP, http_reject_request_cb, NULL);
+    }
+    if (workQueue)
+        workQueue->Interrupt();
+}
+
+void StopHTTPServer()
+{
+    LogPrint("http", "Stopping HTTP server\n");
+    if (workQueue) {
+        LogPrint("http", "Waiting for HTTP worker threads to exit\n");
+        for (auto& thread: g_thread_http_workers) {
+            thread.join();
+        }
+        g_thread_http_workers.clear();
+        delete workQueue;
+    }
+    if (eventBase) {
+        LogPrint("http", "Waiting for HTTP event thread to exit\n");
+        // Exit the event loop as soon as there are no active events.
+        event_base_loopexit(eventBase, nullptr);
+        // Give event loop a few seconds to exit (to send back last RPC responses), then break it
+        // Before this was solved with event_base_loopexit, but that didn't work as expected in
+        // at least libevent 2.0.21 and always introduced a delay. In libevent
+        // master that appears to be solved, so in the future that solution
+        // could be used again (if desirable).
+        // (see discussion in https://github.com/bitcoin/bitcoin/pull/6990)
+        if (threadResult.valid() && threadResult.wait_for(std::chrono::milliseconds(2000)) == std::future_status::timeout) {
+            LogPrintf("HTTP event loop did not exit within allotted time, sending loopbreak\n");
+            event_base_loopbreak(eventBase);
+        }
+        threadHTTP.join();
+    }
+    if (eventHTTP) {
+        evhttp_free(eventHTTP);
+        eventHTTP = 0;
+    }
+    if (eventBase) {
+        event_base_free(eventBase);
+        eventBase = 0;
+    }
+    LogPrint("http", "Stopped HTTP server\n");
+}
+
+struct event_base* EventBase()
+{
+    return eventBase;
+}
+
+static void httpevent_callback_fn(evutil_socket_t, short, void* data)
+{
+    // Static handler: simply call inner handler
+    HTTPEvent *self = ((HTTPEvent*)data);
+    self->handler();
+    if (self->deleteWhenTriggered)
+        delete self;
+}
+
+HTTPEvent::HTTPEvent(struct event_base* base, bool deleteWhenTriggered, const std::function<void(void)>& handler):
+    deleteWhenTriggered(deleteWhenTriggered), handler(handler)
+{
+    ev = event_new(base, -1, 0, httpevent_callback_fn, this);
+    assert(ev);
+}
+HTTPEvent::~HTTPEvent()
+{
+    event_free(ev);
+}
+void HTTPEvent::trigger(struct timeval* tv)
+{
+    if (tv == NULL)
+        event_active(ev, 0, 0); // immediately trigger event in main thread
+    else
+        evtimer_add(ev, tv); // trigger after timeval passed
+}
+HTTPRequest::HTTPRequest(struct evhttp_request* req) : req(req),
+                                                       replySent(false)
+{
+}
+HTTPRequest::~HTTPRequest()
+{
+    if (!replySent) {
+        // Keep track of whether reply was sent to avoid request leaks
+        LogPrintf("%s: Unhandled request\n", __func__);
+        WriteReply(HTTP_INTERNAL, "Unhandled request");
+    }
+    // evhttpd cleans up the request, as long as a reply was sent.
+}
+
+std::pair<bool, std::string> HTTPRequest::GetHeader(const std::string& hdr)
+{
+    const struct evkeyvalq* headers = evhttp_request_get_input_headers(req);
+    assert(headers);
+    const char* val = evhttp_find_header(headers, hdr.c_str());
+    if (val)
+        return std::make_pair(true, val);
+    else
+        return std::make_pair(false, "");
+}
+
+std::string HTTPRequest::ReadBody()
+{
+    struct evbuffer* buf = evhttp_request_get_input_buffer(req);
+    if (!buf)
+        return "";
+    size_t size = evbuffer_get_length(buf);
+    /** Trivial implementation: if this is ever a performance bottleneck,
+     * internal copying can be avoided in multi-segment buffers by using
+     * evbuffer_peek and an awkward loop. Though in that case, it'd be even
+     * better to not copy into an intermediate string but use a stream
+     * abstraction to consume the evbuffer on the fly in the parsing algorithm.
+     */
+    const char* data = (const char*)evbuffer_pullup(buf, size);
+    if (!data) // returns NULL in case of empty buffer
+        return "";
+    std::string rv(data, size);
+    evbuffer_drain(buf, size);
+    return rv;
+}
+
+void HTTPRequest::WriteHeader(const std::string& hdr, const std::string& value)
+{
+    struct evkeyvalq* headers = evhttp_request_get_output_headers(req);
+    assert(headers);
+    evhttp_add_header(headers, hdr.c_str(), value.c_str());
+}
+
+/** Closure sent to main thread to request a reply to be sent to
+ * a HTTP request.
+ * Replies must be sent in the main loop in the main http thread,
+ * this cannot be done from worker threads.
+ */
+void HTTPRequest::WriteReply(int nStatus, const std::string& strReply)
+{
+    assert(!replySent && req);
+    // Send event to main http thread to send reply message
+    struct evbuffer* evb = evhttp_request_get_output_buffer(req);
+    assert(evb);
+    evbuffer_add(evb, strReply.data(), strReply.size());
+    auto req_copy = req;
+    HTTPEvent* ev = new HTTPEvent(eventBase, true, [req_copy, nStatus]{
+        evhttp_send_reply(req_copy, nStatus, nullptr, nullptr);
+        // Re-enable reading from the socket. This is the second part of the libevent
+        // workaround above.
+        if (event_get_version_number() >= 0x02010600 && event_get_version_number() < 0x02020001) {
+            evhttp_connection* conn = evhttp_request_get_connection(req_copy);
+            if (conn) {
+                bufferevent* bev = evhttp_connection_get_bufferevent(conn);
+                if (bev) {
+                    bufferevent_enable(bev, EV_READ | EV_WRITE);
+                }
+            }
+        }
+    });
+    ev->trigger(0);
+    replySent = true;
+    req = 0; // transferred back to main thread
+}
+
+CService HTTPRequest::GetPeer()
+{
+    evhttp_connection* con = evhttp_request_get_connection(req);
+    CService peer;
+    if (con) {
+        // evhttp retains ownership over returned address string
+        const char* address = "";
+        uint16_t port = 0;
+        evhttp_connection_get_peer(con, (char**)&address, &port);
+        peer = CService(address, port);
+    }
+    return peer;
+}
+
+std::string HTTPRequest::GetURI()
+{
+    return evhttp_request_get_uri(req);
+}
+
+HTTPRequest::RequestMethod HTTPRequest::GetRequestMethod()
+{
+    switch (evhttp_request_get_command(req)) {
+    case EVHTTP_REQ_GET:
+        return GET;
+        break;
+    case EVHTTP_REQ_POST:
+        return POST;
+        break;
+    case EVHTTP_REQ_HEAD:
+        return HEAD;
+        break;
+    case EVHTTP_REQ_PUT:
+        return PUT;
+        break;
+    default:
+        return UNKNOWN;
+        break;
+    }
+}
+
+void RegisterHTTPHandler(const std::string &prefix, bool exactMatch, const HTTPRequestHandler &handler)
+{
+    LogPrint("http", "Registering HTTP handler for %s (exactmatch %d)\n", prefix, exactMatch);
+    pathHandlers.push_back(HTTPPathHandler(prefix, exactMatch, handler));
+}
+
+void UnregisterHTTPHandler(const std::string &prefix, bool exactMatch)
+{
+    std::vector<HTTPPathHandler>::iterator i = pathHandlers.begin();
+    std::vector<HTTPPathHandler>::iterator iend = pathHandlers.end();
+    for (; i != iend; ++i)
+        if (i->prefix == prefix && i->exactMatch == exactMatch)
+            break;
+    if (i != iend)
+    {
+        LogPrint("http", "Unregistering HTTP handler for %s (exactmatch %d)\n", prefix, exactMatch);
+        pathHandlers.erase(i);
+    }
+}
diff --git a/depend/zcash/src/httpserver.h b/depend/zcash/src/httpserver.h
new file mode 100644
index 000000000..23c7f7f71
--- /dev/null
+++ b/depend/zcash/src/httpserver.h
@@ -0,0 +1,150 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_HTTPSERVER_H
+#define BITCOIN_HTTPSERVER_H
+
+#include <string>
+#include <stdint.h>
+#include <functional>
+
+static const int DEFAULT_HTTP_THREADS=4;
+static const int DEFAULT_HTTP_WORKQUEUE=16;
+static const int DEFAULT_HTTP_SERVER_TIMEOUT=30;
+
+struct evhttp_request;
+struct event_base;
+class CService;
+class HTTPRequest;
+
+/** Initialize HTTP server.
+ * Call this before RegisterHTTPHandler or EventBase().
+ */
+bool InitHTTPServer();
+/** Start HTTP server.
+ * This is separate from InitHTTPServer to give users race-condition-free time
+ * to register their handlers between InitHTTPServer and StartHTTPServer.
+ */
+bool StartHTTPServer();
+/** Interrupt HTTP server threads */
+void InterruptHTTPServer();
+/** Stop HTTP server */
+void StopHTTPServer();
+
+/** Handler for requests to a certain HTTP path */
+typedef std::function<void(HTTPRequest* req, const std::string &)> HTTPRequestHandler;
+/** Register handler for prefix.
+ * If multiple handlers match a prefix, the first-registered one will
+ * be invoked.
+ */
+void RegisterHTTPHandler(const std::string &prefix, bool exactMatch, const HTTPRequestHandler &handler);
+/** Unregister handler for prefix */
+void UnregisterHTTPHandler(const std::string &prefix, bool exactMatch);
+
+/** Return evhttp event base. This can be used by submodules to
+ * queue timers or custom events.
+ */
+struct event_base* EventBase();
+
+/** In-flight HTTP request.
+ * Thin C++ wrapper around evhttp_request.
+ */
+class HTTPRequest
+{
+private:
+    struct evhttp_request* req;
+
+    // For test access
+protected:
+    bool replySent;
+
+public:
+    HTTPRequest(struct evhttp_request* req);
+    virtual ~HTTPRequest();
+
+    enum RequestMethod {
+        UNKNOWN,
+        GET,
+        POST,
+        HEAD,
+        PUT
+    };
+
+    /** Get requested URI.
+     */
+    std::string GetURI();
+
+    /** Get CService (address:ip) for the origin of the http request.
+     */
+    virtual CService GetPeer();
+
+    /** Get request method.
+     */
+    virtual RequestMethod GetRequestMethod();
+
+    /**
+     * Get the request header specified by hdr, or an empty string.
+     * Return a pair (isPresent,string).
+     */
+    virtual std::pair<bool, std::string> GetHeader(const std::string& hdr);
+
+    /**
+     * Read request body.
+     *
+     * @note As this consumes the underlying buffer, call this only once.
+     * Repeated calls will return an empty string.
+     */
+    std::string ReadBody();
+
+    /**
+     * Write output header.
+     *
+     * @note call this before calling WriteErrorReply or Reply.
+     */
+    virtual void WriteHeader(const std::string& hdr, const std::string& value);
+
+    /**
+     * Write HTTP reply.
+     * nStatus is the HTTP status code to send.
+     * strReply is the body of the reply. Keep it empty to send a standard message.
+     *
+     * @note Can be called only once. As this will give the request back to the
+     * main thread, do not call any other HTTPRequest methods after calling this.
+     */
+    virtual void WriteReply(int nStatus, const std::string& strReply = "");
+};
+
+/** Event handler closure.
+ */
+class HTTPClosure
+{
+public:
+    virtual void operator()() = 0;
+    virtual ~HTTPClosure() {}
+};
+
+/** Event class. This can be used either as a cross-thread trigger or as a timer.
+ */
+class HTTPEvent
+{
+public:
+    /** Create a new event.
+     * deleteWhenTriggered deletes this event object after the event is triggered (and the handler called)
+     * handler is the handler to call when the event is triggered.
+     */
+    HTTPEvent(struct event_base* base, bool deleteWhenTriggered, const std::function<void(void)>& handler);
+    ~HTTPEvent();
+
+    /** Trigger the event. If tv is 0, trigger it immediately. Otherwise trigger it after
+     * the given time has elapsed.
+     */
+    void trigger(struct timeval* tv);
+
+    bool deleteWhenTriggered;
+    std::function<void(void)> handler;
+private:
+    struct event* ev;
+};
+
+#endif // BITCOIN_HTTPSERVER_H
diff --git a/depend/zcash/src/init.cpp b/depend/zcash/src/init.cpp
new file mode 100644
index 000000000..a18306586
--- /dev/null
+++ b/depend/zcash/src/init.cpp
@@ -0,0 +1,1947 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#if defined(HAVE_CONFIG_H)
+#include "config/bitcoin-config.h"
+#endif
+
+#include "init.h"
+#include "addrman.h"
+#include "amount.h"
+#include "checkpoints.h"
+#include "compat/sanity.h"
+#include "consensus/upgrades.h"
+#include "consensus/validation.h"
+#include "deprecation.h"
+#include "experimental_features.h"
+#include "fs.h"
+#include "httpserver.h"
+#include "httprpc.h"
+#include "key.h"
+#if defined(ENABLE_MINING) || defined(ENABLE_WALLET)
+#include "key_io.h"
+#endif
+#include "main.h"
+#include "mempool_limit.h"
+#include "metrics.h"
+#include "miner.h"
+#include "net.h"
+#include "policy/policy.h"
+#include "rpc/server.h"
+#include "rpc/register.h"
+#include "script/standard.h"
+#include "script/sigcache.h"
+#include "scheduler.h"
+#include "txdb.h"
+#include "torcontrol.h"
+#include "ui_interface.h"
+#include "util.h"
+#include "utilmoneystr.h"
+#include "validationinterface.h"
+#ifdef ENABLE_WALLET
+#include "wallet/wallet.h"
+#include "wallet/walletdb.h"
+#endif
+#include "warnings.h"
+#include <stdint.h>
+#include <stdio.h>
+
+#ifndef WIN32
+#include <signal.h>
+#endif
+
+#include <boost/algorithm/string/classification.hpp>
+#include <boost/algorithm/string/predicate.hpp>
+#include <boost/algorithm/string/replace.hpp>
+#include <boost/algorithm/string/split.hpp>
+#include <boost/bind/bind.hpp>
+#include <boost/interprocess/sync/file_lock.hpp>
+#include <boost/thread.hpp>
+#include <sodium.h>
+
+#if ENABLE_ZMQ
+#include "zmq/zmqnotificationinterface.h"
+#endif
+
+#include <rust/metrics.h>
+
+#include "librustzcash.h"
+
+using namespace boost::placeholders;
+
+extern void ThreadSendAlert();
+
+TracingHandle* pTracingHandle = nullptr;
+
+bool fFeeEstimatesInitialized = false;
+static const bool DEFAULT_PROXYRANDOMIZE = true;
+static const bool DEFAULT_REST_ENABLE = false;
+static const bool DEFAULT_DISABLE_SAFEMODE = false;
+static const bool DEFAULT_STOPAFTERBLOCKIMPORT = false;
+
+// The time that the wallet will wait for the block index to load
+// during startup before timing out.
+static const int64_t WALLET_INITIAL_SYNC_TIMEOUT = 1000 * 60 * 5;
+
+#if ENABLE_ZMQ
+static CZMQNotificationInterface* pzmqNotificationInterface = NULL;
+#endif
+
+#ifdef WIN32
+// Win32 LevelDB doesn't use file descriptors, and the ones used for
+// accessing block files don't count towards the fd_set size limit
+// anyway.
+#define MIN_CORE_FILEDESCRIPTORS 0
+#else
+#define MIN_CORE_FILEDESCRIPTORS 150
+#endif
+
+/** Used to pass flags to the Bind() function */
+enum BindFlags {
+    BF_NONE         = 0,
+    BF_EXPLICIT     = (1U << 0),
+    BF_REPORT_ERROR = (1U << 1),
+    BF_WHITELIST    = (1U << 2),
+};
+
+static const char* FEE_ESTIMATES_FILENAME="fee_estimates.dat";
+CClientUIInterface uiInterface; // Declared but not defined in ui_interface.h
+
+//////////////////////////////////////////////////////////////////////////////
+//
+// Shutdown
+//
+
+//
+// Thread management and startup/shutdown:
+//
+// The network-processing threads are all part of a thread group
+// created by AppInit().
+//
+// A clean exit happens when StartShutdown() or the SIGTERM
+// signal handler sets fRequestShutdown, which triggers
+// the DetectShutdownThread(), which interrupts the main thread group.
+// DetectShutdownThread() then exits, which causes AppInit() to
+// continue (it .joins the shutdown thread).
+// Shutdown() is then
+// called to clean up database connections, and stop other
+// threads that should only be stopped after the main network-processing
+// threads have exited.
+//
+// Note that if running -daemon the parent process returns from AppInit2
+// before adding any threads to the threadGroup, so .join_all() returns
+// immediately and the parent exits from main().
+//
+
+std::atomic<bool> fRequestShutdown(false);
+
+void StartShutdown()
+{
+    fRequestShutdown = true;
+}
+bool ShutdownRequested()
+{
+    return fRequestShutdown;
+}
+
+class CCoinsViewErrorCatcher : public CCoinsViewBacked
+{
+public:
+    CCoinsViewErrorCatcher(CCoinsView* view) : CCoinsViewBacked(view) {}
+    bool GetCoins(const uint256 &txid, CCoins &coins) const {
+        try {
+            return CCoinsViewBacked::GetCoins(txid, coins);
+        } catch(const std::runtime_error& e) {
+            uiInterface.ThreadSafeMessageBox(_("Error reading from database, shutting down."), "", CClientUIInterface::MSG_ERROR);
+            LogPrintf("Error reading from database: %s\n", e.what());
+            // Starting the shutdown sequence and returning false to the caller would be
+            // interpreted as 'entry not found' (as opposed to unable to read data), and
+            // could lead to invalid interpretation. Just exit immediately, as we can't
+            // continue anyway, and all writes should be atomic.
+            abort();
+        }
+    }
+    // Writes do not need similar protection, as failure to write is handled by the caller.
+};
+
+static CCoinsViewDB *pcoinsdbview = NULL;
+static CCoinsViewErrorCatcher *pcoinscatcher = NULL;
+static boost::scoped_ptr<ECCVerifyHandle> globalVerifyHandle;
+
+void Interrupt(boost::thread_group& threadGroup)
+{
+    InterruptHTTPServer();
+    InterruptHTTPRPC();
+    InterruptRPC();
+    InterruptREST();
+    InterruptTorControl();
+    threadGroup.interrupt_all();
+}
+
+void Shutdown()
+{
+    auto span = TracingSpan("info", "main", "Shutdown");
+    auto spanGuard = span.Enter();
+
+    static CCriticalSection cs_Shutdown;
+    TRY_LOCK(cs_Shutdown, lockShutdown);
+    if (!lockShutdown)
+        return;
+
+    /// Note: Shutdown() must be able to handle cases in which AppInit2() failed part of the way,
+    /// for example if the data directory was found to be locked.
+    /// Be sure that anything that writes files or flushes caches only does this if the respective
+    /// module was initialized.
+    RenameThread("zcash-shutoff");
+    mempool.AddTransactionsUpdated(1);
+
+    StopHTTPRPC();
+    StopREST();
+    StopRPC();
+    StopHTTPServer();
+#ifdef ENABLE_WALLET
+    if (pwalletMain)
+        pwalletMain->Flush(false);
+#endif
+#ifdef ENABLE_MINING
+    GenerateBitcoins(false, 0, Params());
+#endif
+    StopNode();
+    StopTorControl();
+    UnregisterNodeSignals(GetNodeSignals());
+
+    if (fFeeEstimatesInitialized)
+    {
+        fs::path est_path = GetDataDir() / FEE_ESTIMATES_FILENAME;
+        CAutoFile est_fileout(fsbridge::fopen(est_path, "wb"), SER_DISK, CLIENT_VERSION);
+        if (!est_fileout.IsNull())
+            mempool.WriteFeeEstimates(est_fileout);
+        else
+            LogPrintf("%s: Failed to write fee estimates to %s\n", __func__, est_path.string());
+        fFeeEstimatesInitialized = false;
+    }
+
+    {
+        LOCK(cs_main);
+        if (pcoinsTip != NULL) {
+            FlushStateToDisk();
+        }
+        delete pcoinsTip;
+        pcoinsTip = NULL;
+        delete pcoinscatcher;
+        pcoinscatcher = NULL;
+        delete pcoinsdbview;
+        pcoinsdbview = NULL;
+        delete pblocktree;
+        pblocktree = NULL;
+    }
+#ifdef ENABLE_WALLET
+    if (pwalletMain)
+        pwalletMain->Flush(true);
+#endif
+
+#if ENABLE_ZMQ
+    if (pzmqNotificationInterface) {
+        UnregisterValidationInterface(pzmqNotificationInterface);
+        delete pzmqNotificationInterface;
+        pzmqNotificationInterface = NULL;
+    }
+#endif
+
+#ifndef WIN32
+    try {
+        fs::remove(GetPidFile());
+    } catch (const fs::filesystem_error& e) {
+        LogPrintf("%s: Unable to remove pidfile: %s\n", __func__, e.what());
+    }
+#endif
+    UnregisterAllValidationInterfaces();
+#ifdef ENABLE_WALLET
+    delete pwalletMain;
+    pwalletMain = NULL;
+#endif
+    globalVerifyHandle.reset();
+    ECC_Stop();
+    TracingInfo("main", "done");
+    if (pTracingHandle) {
+        tracing_free(pTracingHandle);
+    }
+}
+
+/**
+ * Signal handlers are very limited in what they are allowed to do, so:
+ */
+void HandleSIGTERM(int)
+{
+    fRequestShutdown = true;
+}
+
+void HandleSIGHUP(int)
+{
+    fReopenDebugLog = true;
+}
+
+bool static InitError(const std::string &str)
+{
+    uiInterface.ThreadSafeMessageBox(str, "", CClientUIInterface::MSG_ERROR);
+    return false;
+}
+
+bool static InitWarning(const std::string &str)
+{
+    uiInterface.ThreadSafeMessageBox(str, "", CClientUIInterface::MSG_WARNING);
+    return true;
+}
+
+bool static Bind(const CService &addr, unsigned int flags) {
+    if (!(flags & BF_EXPLICIT) && IsLimited(addr))
+        return false;
+    std::string strError;
+    if (!BindListenPort(addr, strError, (flags & BF_WHITELIST) != 0)) {
+        if (flags & BF_REPORT_ERROR)
+            return InitError(strError);
+        return false;
+    }
+    return true;
+}
+
+void OnRPCStopped()
+{
+    g_best_block_cv.notify_all();
+    LogPrint("rpc", "RPC stopped.\n");
+}
+
+void OnRPCPreCommand(const CRPCCommand& cmd)
+{
+    // Observe safe mode
+    std::string strWarning = GetWarnings("rpc").first;
+    if (strWarning != "" && !GetBoolArg("-disablesafemode", DEFAULT_DISABLE_SAFEMODE) &&
+        !cmd.okSafeMode)
+        throw JSONRPCError(RPC_FORBIDDEN_BY_SAFE_MODE, std::string("Safe mode: ") + strWarning);
+}
+
+std::string HelpMessage(HelpMessageMode mode)
+{
+    const bool showDebug = GetBoolArg("-help-debug", false);
+
+    // When adding new options to the categories, please keep and ensure alphabetical ordering.
+    // Do not translate _(...) -help-debug options, many technical terms, and only a very small audience, so is unnecessary stress to translators
+
+    std::string strUsage = HelpMessageGroup(_("Options:"));
+    strUsage += HelpMessageOpt("-?", _("This help message"));
+    strUsage += HelpMessageOpt("-alerts", strprintf(_("Receive and display P2P network alerts (default: %u)"), DEFAULT_ALERTS));
+    strUsage += HelpMessageOpt("-alertnotify=<cmd>", _("Execute command when a relevant alert is received or we see a really long fork (%s in cmd is replaced by message)"));
+    strUsage += HelpMessageOpt("-allowdeprecated=<feature>", strprintf(_("Explicitly allow the use of the specified deprecated feature. Multiple instances of this parameter are permitted; values for <feature> must be selected from among {%s}"), GetAllowableDeprecatedFeatures()));
+    strUsage += HelpMessageOpt("-blocknotify=<cmd>", _("Execute command when the best block changes (%s in cmd is replaced by block hash)"));
+    if (showDebug)
+        strUsage += HelpMessageOpt("-blocksonly", strprintf(_("Whether to reject transactions from network peers. Automatic broadcast and rebroadcast of any transactions from inbound peers is disabled, unless '-whitelistforcerelay' is '1', in which case whitelisted peers' transactions will be relayed. RPC transactions are not affected. (default: %u)"), DEFAULT_BLOCKSONLY));
+    strUsage += HelpMessageOpt("-checkblocks=<n>", strprintf(_("How many blocks to check at startup (default: %u, 0 = all)"), DEFAULT_CHECKBLOCKS));
+    strUsage += HelpMessageOpt("-checklevel=<n>", strprintf(_("How thorough the block verification of -checkblocks is (0-4, default: %u)"), DEFAULT_CHECKLEVEL));
+    strUsage += HelpMessageOpt("-conf=<file>", strprintf(_("Specify configuration file (default: %s)"), BITCOIN_CONF_FILENAME));
+    if (mode == HMM_BITCOIND)
+    {
+#ifndef WIN32
+        strUsage += HelpMessageOpt("-daemon", _("Run in the background as a daemon and accept commands"));
+#endif
+    }
+    strUsage += HelpMessageOpt("-datadir=<dir>", _("Specify data directory (this path cannot use '~')"));
+    strUsage += HelpMessageOpt("-paramsdir=<dir>", _("Specify Zcash network parameters directory"));
+    strUsage += HelpMessageOpt("-dbcache=<n>", strprintf(_("Set database cache size in megabytes (%d to %d, default: %d)"), nMinDbCache, nMaxDbCache, nDefaultDbCache));
+    strUsage += HelpMessageOpt("-debuglogfile=<file>", strprintf(_("Specify location of debug log file: this can be an absolute path or a path relative to the data directory (default: %s)"), DEFAULT_DEBUGLOGFILE));
+    strUsage += HelpMessageOpt("-exportdir=<dir>", _("Specify directory to be used when exporting data"));
+    strUsage += HelpMessageOpt("-ibdskiptxverification", strprintf(_("Skip transaction verification during initial block download up to the last checkpoint height. Incompatible with flags that disable checkpoints. (default = %u)"), DEFAULT_IBD_SKIP_TX_VERIFICATION));
+    strUsage += HelpMessageOpt("-loadblock=<file>", _("Imports blocks from external blk000??.dat file on startup"));
+    strUsage += HelpMessageOpt("-maxorphantx=<n>", strprintf(_("Keep at most <n> unconnectable transactions in memory (default: %u)"), DEFAULT_MAX_ORPHAN_TRANSACTIONS));
+    strUsage += HelpMessageOpt("-par=<n>", strprintf(_("Set the number of script verification threads (%u to %d, 0 = auto, <0 = leave that many cores free, default: %d)"),
+        -GetNumCores(), MAX_SCRIPTCHECK_THREADS, DEFAULT_SCRIPTCHECK_THREADS));
+#ifndef WIN32
+    strUsage += HelpMessageOpt("-pid=<file>", strprintf(_("Specify pid file (default: %s)"), BITCOIN_PID_FILENAME));
+#endif
+    strUsage += HelpMessageOpt("-prune=<n>", strprintf(_("Reduce storage requirements by pruning (deleting) old blocks. This mode disables wallet support and is incompatible with -txindex. "
+            "Warning: Reverting this setting requires re-downloading the entire blockchain. "
+            "(default: 0 = disable pruning blocks, >%u = target size in MiB to use for block files)"), MIN_DISK_SPACE_FOR_BLOCK_FILES / 1024 / 1024));
+#ifdef ENABLE_WALLET
+    strUsage += HelpMessageOpt("-reindex-chainstate", _("Rebuild chain state from the currently indexed blocks (implies -rescan unless pruning or unless -rescan=0 is explicitly specified)"));
+    strUsage += HelpMessageOpt("-reindex", _("Rebuild chain state and block index from the blk*.dat files on disk (implies -rescan unless pruning or unless -rescan=0 is explicitly specified)"));
+#else
+    strUsage += HelpMessageOpt("-reindex-chainstate", _("Rebuild chain state from the currently indexed blocks"));
+    strUsage += HelpMessageOpt("-reindex", _("Rebuild chain state and block index from the blk*.dat files on disk"));
+#endif
+#ifndef WIN32
+    strUsage += HelpMessageOpt("-sysperms", _("Create new files with system default permissions, instead of umask 077 (only effective with disabled wallet functionality)"));
+#endif
+    strUsage += HelpMessageOpt("-txexpirynotify=<cmd>", _("Execute command when transaction expires (%s in cmd is replaced by transaction id)"));
+    strUsage += HelpMessageOpt("-txindex", strprintf(_("Maintain a full transaction index, used by the getrawtransaction rpc call (default: %u)"), DEFAULT_TXINDEX));
+
+    strUsage += HelpMessageGroup(_("Connection options:"));
+    strUsage += HelpMessageOpt("-addnode=<ip>", _("Add a node to connect to and attempt to keep the connection open"));
+    strUsage += HelpMessageOpt("-banscore=<n>", strprintf(_("Threshold for disconnecting misbehaving peers (default: %u)"), DEFAULT_BANSCORE_THRESHOLD));
+    strUsage += HelpMessageOpt("-bantime=<n>", strprintf(_("Number of seconds to keep misbehaving peers from reconnecting (default: %u)"), DEFAULT_MISBEHAVING_BANTIME));
+    strUsage += HelpMessageOpt("-bind=<addr>", _("Bind to given address and always listen on it. Use [host]:port notation for IPv6"));
+    strUsage += HelpMessageOpt("-connect=<ip>", _("Connect only to the specified node(s); -noconnect or -connect=0 alone to disable automatic connections"));
+    strUsage += HelpMessageOpt("-discover", _("Discover own IP addresses (default: 1 when listening and no -externalip or -proxy)"));
+    strUsage += HelpMessageOpt("-dns", _("Allow DNS lookups for -addnode, -seednode and -connect") + " " + strprintf(_("(default: %u)"), DEFAULT_NAME_LOOKUP));
+    strUsage += HelpMessageOpt("-dnsseed", _("Query for peer addresses via DNS lookup, if low on addresses (default: 1 unless -connect/-noconnect)"));
+    strUsage += HelpMessageOpt("-externalip=<ip>", _("Specify your own public address"));
+    strUsage += HelpMessageOpt("-forcednsseed", strprintf(_("Always query for peer addresses via DNS lookup (default: %u)"), DEFAULT_FORCEDNSSEED));
+    strUsage += HelpMessageOpt("-listen", _("Accept connections from outside (default: 1 if no -proxy or -connect/-noconnect)"));
+    strUsage += HelpMessageOpt("-listenonion", strprintf(_("Automatically create Tor hidden service (default: %d)"), DEFAULT_LISTEN_ONION));
+    strUsage += HelpMessageOpt("-maxconnections=<n>", strprintf(_("Maintain at most <n> connections to peers (default: %u)"), DEFAULT_MAX_PEER_CONNECTIONS));
+    strUsage += HelpMessageOpt("-maxreceivebuffer=<n>", strprintf(_("Maximum per-connection receive buffer, <n>*1000 bytes (default: %u)"), DEFAULT_MAXRECEIVEBUFFER));
+    strUsage += HelpMessageOpt("-maxsendbuffer=<n>", strprintf(_("Maximum per-connection send buffer, <n>*1000 bytes (default: %u)"), DEFAULT_MAXSENDBUFFER));
+    strUsage += HelpMessageOpt("-mempoolevictionmemoryminutes=<n>", strprintf(_("The number of minutes before allowing rejected transactions to re-enter the mempool. (default: %u)"), DEFAULT_MEMPOOL_EVICTION_MEMORY_MINUTES));
+    strUsage += HelpMessageOpt("-mempooltxcostlimit=<n>",strprintf(_("An upper bound on the maximum size in bytes of all transactions in the mempool. (default: %s)"), DEFAULT_MEMPOOL_TOTAL_COST_LIMIT));
+    strUsage += HelpMessageOpt("-onion=<ip:port>", strprintf(_("Use separate SOCKS5 proxy to reach peers via Tor hidden services (default: %s)"), "-proxy"));
+    strUsage += HelpMessageOpt("-onlynet=<net>", _("Only connect to nodes in network <net> (ipv4, ipv6 or onion)"));
+    strUsage += HelpMessageOpt("-permitbaremultisig", strprintf(_("Relay non-P2SH multisig (default: %u)"), DEFAULT_PERMIT_BAREMULTISIG));
+    strUsage += HelpMessageOpt("-peerbloomfilters", strprintf(_("Support filtering of blocks and transaction with bloom filters (default: %u)"), DEFAULT_PEERBLOOMFILTERS));
+    if (showDebug)
+        strUsage += HelpMessageOpt("-enforcenodebloom", strprintf("Enforce minimum protocol version to limit use of bloom filters (default: %u)", DEFAULT_ENFORCENODEBLOOM));
+    strUsage += HelpMessageOpt("-port=<port>", strprintf(_("Listen for connections on <port> (default: %u or testnet: %u)"),
+        Params(CBaseChainParams::MAIN).GetDefaultPort(), Params(CBaseChainParams::TESTNET).GetDefaultPort()));
+    strUsage += HelpMessageOpt("-proxy=<ip:port>", _("Connect through SOCKS5 proxy"));
+    strUsage += HelpMessageOpt("-proxyrandomize", strprintf(_("Randomize credentials for every proxy connection. This enables Tor stream isolation (default: %u)"), DEFAULT_PROXYRANDOMIZE));
+    strUsage += HelpMessageOpt("-seednode=<ip>", _("Connect to a node to retrieve peer addresses, and disconnect"));
+    strUsage += HelpMessageOpt("-timeout=<n>", strprintf(_("Specify connection timeout in milliseconds (minimum: 1, default: %d)"), DEFAULT_CONNECT_TIMEOUT));
+    strUsage += HelpMessageOpt("-torcontrol=<ip>:<port>", strprintf(_("Tor control port to use if onion listening enabled (default: %s)"), DEFAULT_TOR_CONTROL));
+    strUsage += HelpMessageOpt("-torpassword=<pass>", _("Tor control port password (default: empty)"));
+    strUsage += HelpMessageOpt("-whitebind=<addr>", _("Bind to given address and whitelist peers connecting to it. Use [host]:port notation for IPv6"));
+    strUsage += HelpMessageOpt("-whitelist=<netmask>", _("Whitelist peers connecting from the given netmask or IP address. Can be specified multiple times.") +
+        " " + _("Whitelisted peers cannot be DoS banned and their transactions are always relayed, even if they are already in the mempool, useful e.g. for a gateway"));
+    strUsage += HelpMessageOpt("-whitelistrelay", strprintf(_("Accept relayed transactions received from whitelisted inbound peers even when not relaying transactions (default: %d)"), DEFAULT_WHITELISTRELAY));
+    strUsage += HelpMessageOpt("-whitelistforcerelay", strprintf(_("Force relay of transactions from whitelisted inbound peers even they violate local relay policy (default: %d)"), DEFAULT_WHITELISTFORCERELAY));
+    strUsage += HelpMessageOpt("-maxuploadtarget=<n>", strprintf(_("Tries to keep outbound traffic under the given target (in MiB per 24h), 0 = no limit (default: %d)"), DEFAULT_MAX_UPLOAD_TARGET));
+
+#ifdef ENABLE_WALLET
+    strUsage += CWallet::GetWalletHelpString(showDebug);
+#endif
+
+#if ENABLE_ZMQ
+    strUsage += HelpMessageGroup(_("ZeroMQ notification options:"));
+    strUsage += HelpMessageOpt("-zmqpubhashblock=<address>", _("Enable publish hash block in <address>"));
+    strUsage += HelpMessageOpt("-zmqpubhashtx=<address>", _("Enable publish hash transaction in <address>"));
+    strUsage += HelpMessageOpt("-zmqpubrawblock=<address>", _("Enable publish raw block in <address>"));
+    strUsage += HelpMessageOpt("-zmqpubrawtx=<address>", _("Enable publish raw transaction in <address>"));
+#endif
+
+    strUsage += HelpMessageGroup(_("Monitoring options:"));
+    strUsage += HelpMessageOpt("-metricsallowip=<ip>", _("Allow metrics connections from specified source. "
+            "Valid for <ip> are a single IP (e.g. 1.2.3.4), a network/netmask (e.g. 1.2.3.4/255.255.255.0) or a network/CIDR (e.g. 1.2.3.4/24). "
+            "This option can be specified multiple times. (default: only localhost)"));
+    strUsage += HelpMessageOpt("-metricsbind=<addr>", _("Bind to given address to listen for metrics connections. (default: bind to all interfaces)"));
+    strUsage += HelpMessageOpt("-prometheusport=<port>", _("Expose node metrics in the Prometheus exposition format. "
+            "An HTTP listener will be started on <port>, which responds to GET requests on any request path. "
+            "Use -metricsallowip and -metricsbind to control access."));
+
+    strUsage += HelpMessageGroup(_("Debugging/Testing options:"));
+    if (showDebug)
+    {
+        strUsage += HelpMessageOpt("-checkpoints", strprintf("Disable expensive verification for known chain history (default: %u)", DEFAULT_CHECKPOINTS_ENABLED));
+        strUsage += HelpMessageOpt("-disablesafemode", strprintf("Disable safemode, override a real safe mode event (default: %u)", DEFAULT_DISABLE_SAFEMODE));
+        strUsage += HelpMessageOpt("-testsafemode", strprintf("Force safe mode (default: %u)", DEFAULT_TESTSAFEMODE));
+        strUsage += HelpMessageOpt("-dropmessagestest=<n>", "Randomly drop 1 of every <n> network messages");
+        strUsage += HelpMessageOpt("-fuzzmessagestest=<n>", "Randomly fuzz 1 of every <n> network messages");
+        strUsage += HelpMessageOpt("-stopafterblockimport", strprintf("Stop running after importing blocks from disk (default: %u)", DEFAULT_STOPAFTERBLOCKIMPORT));
+        strUsage += HelpMessageOpt("-nuparams=hexBranchId:activationHeight", "Use given activation height for specified network upgrade (regtest-only)");
+        strUsage += HelpMessageOpt("-nurejectoldversions", strprintf("Reject peers that don't know about the current epoch (regtest-only) (default: %u)", DEFAULT_NU_REJECT_OLD_VERSIONS));
+        strUsage += HelpMessageOpt(
+                "-fundingstream=streamId:startHeight:endHeight:comma_delimited_addresses",
+                "Use given addresses for block subsidy share paid to the funding stream with id <streamId> (regtest-only)");
+    }
+    std::string debugCategories = "addrman, alert, bench, coindb, db, estimatefee, http, libevent, lock, mempool, mempoolrej, net, partitioncheck, pow, proxy, prune, "
+                             "rand, receiveunsafe, reindex, rpc, selectcoins, tor, zmq, zrpc, zrpcunsafe (implies zrpc)"; // Don't translate these
+    strUsage += HelpMessageOpt("-debug=<category>", strprintf(_("Output debugging information (default: %u, supplying <category> is optional)"), 0) + ". " +
+        _("If <category> is not supplied or if <category> = 1, output all debugging information.") + " " + _("<category> can be:") + " " + debugCategories + ". " +
+        _("For multiple specific categories use -debug=<category> multiple times."));
+    strUsage += HelpMessageOpt("-experimentalfeatures", _("Enable use of experimental features"));
+    strUsage += HelpMessageOpt("-help-debug", _("Show all debugging options (usage: --help -help-debug)"));
+    strUsage += HelpMessageOpt("-logips", strprintf(_("Include IP addresses in debug output (default: %u)"), DEFAULT_LOGIPS));
+    strUsage += HelpMessageOpt("-logtimestamps", strprintf(_("Prepend debug output with timestamp (default: %u)"), DEFAULT_LOGTIMESTAMPS));
+    if (showDebug)
+    {
+        strUsage += HelpMessageOpt("-limitfreerelay=<n>", strprintf("Continuously rate-limit free transactions to <n>*1000 bytes per minute (default: %u)", DEFAULT_LIMITFREERELAY));
+        strUsage += HelpMessageOpt("-relaypriority", strprintf("Require high priority for relaying free or low-fee transactions (default: %u)", DEFAULT_RELAYPRIORITY));
+        strUsage += HelpMessageOpt("-maxsigcachesize=<n>", strprintf("Limit size of signature cache to <n> MiB (default: %u)", DEFAULT_MAX_SIG_CACHE_SIZE));
+        strUsage += HelpMessageOpt("-maxtipage=<n>", strprintf("Maximum tip age in seconds to consider node in initial block download (default: %u)", DEFAULT_MAX_TIP_AGE));
+    }
+    strUsage += HelpMessageOpt("-minrelaytxfee=<amt>", strprintf(_("Fees (in %s/kB) smaller than this are considered zero fee for relaying, mining and transaction creation (default: %s)"),
+        CURRENCY_UNIT, FormatMoney(DEFAULT_MIN_RELAY_TX_FEE)));
+    strUsage += HelpMessageOpt("-maxtxfee=<amt>", strprintf(_("Maximum total fees (in %s) to use in a single wallet transaction or raw transaction; setting this too low may abort large transactions (default: %s)"),
+        CURRENCY_UNIT, FormatMoney(DEFAULT_TRANSACTION_MAXFEE)));
+    strUsage += HelpMessageOpt("-printtoconsole", _("Send trace/debug info to console instead of debug.log file"));
+    if (showDebug)
+    {
+        strUsage += HelpMessageOpt("-printpriority", strprintf("Log transaction priority and fee per kB when mining blocks (default: %u)", DEFAULT_PRINTPRIORITY));
+    }
+    // strUsage += HelpMessageOpt("-shrinkdebugfile", _("Shrink debug.log file on client startup (default: 1 when no -debug)"));
+
+    AppendParamsHelpMessages(strUsage, showDebug);
+
+    strUsage += HelpMessageGroup(_("Node relay options:"));
+    strUsage += HelpMessageOpt("-datacarrier", strprintf(_("Relay and mine data carrier transactions (default: %u)"), DEFAULT_ACCEPT_DATACARRIER));
+    strUsage += HelpMessageOpt("-datacarriersize", strprintf(_("Maximum size of data in data carrier transactions we relay and mine (default: %u)"), MAX_OP_RETURN_RELAY));
+
+    strUsage += HelpMessageGroup(_("Block creation options:"));
+    strUsage += HelpMessageOpt("-blockminsize=<n>", strprintf(_("Set minimum block size in bytes (default: %u)"), DEFAULT_BLOCK_MIN_SIZE));
+    strUsage += HelpMessageOpt("-blockmaxsize=<n>", strprintf(_("Set maximum block size in bytes (default: %d)"), DEFAULT_BLOCK_MAX_SIZE));
+    strUsage += HelpMessageOpt("-blockprioritysize=<n>", strprintf(_("Set maximum size of high-priority/low-fee transactions in bytes (default: %d)"), DEFAULT_BLOCK_PRIORITY_SIZE));
+    if (GetBoolArg("-help-debug", false))
+        strUsage += HelpMessageOpt("-blockversion=<n>", strprintf("Override block version to test forking scenarios (default: %d)", (int)CBlock::CURRENT_VERSION));
+
+#ifdef ENABLE_MINING
+    strUsage += HelpMessageGroup(_("Mining options:"));
+    strUsage += HelpMessageOpt("-gen", strprintf(_("Generate coins (default: %u)"), DEFAULT_GENERATE));
+    strUsage += HelpMessageOpt("-genproclimit=<n>", strprintf(_("Set the number of threads for coin generation if enabled (-1 = all cores, default: %d)"), DEFAULT_GENERATE_THREADS));
+    strUsage += HelpMessageOpt("-equihashsolver=<name>", _("Specify the Equihash solver to be used if enabled (default: \"default\")"));
+    strUsage += HelpMessageOpt("-mineraddress=<addr>", _("Send mined coins to a specific single address"));
+    strUsage += HelpMessageOpt("-minetolocalwallet", strprintf(
+            _("Require that mined blocks use a coinbase address in the local wallet (default: %u)"),
+ #ifdef ENABLE_WALLET
+            1
+ #else
+            0
+ #endif
+            ));
+#endif
+
+    strUsage += HelpMessageGroup(_("RPC server options:"));
+    strUsage += HelpMessageOpt("-server", _("Accept command line and JSON-RPC commands"));
+    strUsage += HelpMessageOpt("-rest", strprintf(_("Accept public REST requests (default: %u)"), DEFAULT_REST_ENABLE));
+    strUsage += HelpMessageOpt("-rpcbind=<addr>", _("Bind to given address to listen for JSON-RPC connections. Use [host]:port notation for IPv6. This option can be specified multiple times (default: bind to all interfaces)"));
+    strUsage += HelpMessageOpt("-rpcuser=<user>", _("Username for JSON-RPC connections"));
+    strUsage += HelpMessageOpt("-rpcpassword=<pw>", _("Password for JSON-RPC connections"));
+    strUsage += HelpMessageOpt("-rpcauth=<userpw>", _("Username and hashed password for JSON-RPC connections. The field <userpw> comes in the format: <USERNAME>:<SALT>$<HASH>. A canonical python script is included in share/rpcuser. This option can be specified multiple times"));
+    strUsage += HelpMessageOpt("-rpcport=<port>", strprintf(_("Listen for JSON-RPC connections on <port> (default: %u or testnet: %u)"), 8232, 18232));
+    strUsage += HelpMessageOpt("-rpcallowip=<ip>", _("Allow JSON-RPC connections from specified source. Valid for <ip> are a single IP (e.g. 1.2.3.4), a network/netmask (e.g. 1.2.3.4/255.255.255.0) or a network/CIDR (e.g. 1.2.3.4/24). This option can be specified multiple times"));
+    strUsage += HelpMessageOpt("-rpcthreads=<n>", strprintf(_("Set the number of threads to service RPC calls (default: %d)"), DEFAULT_HTTP_THREADS));
+    if (showDebug) {
+        strUsage += HelpMessageOpt("-rpcworkqueue=<n>", strprintf("Set the depth of the work queue to service RPC calls (default: %d)", DEFAULT_HTTP_WORKQUEUE));
+        strUsage += HelpMessageOpt("-rpcservertimeout=<n>", strprintf("Timeout during HTTP requests (default: %d)", DEFAULT_HTTP_SERVER_TIMEOUT));
+    }
+
+    // Disabled until we can lock notes and also tune performance of the prover which by default uses multiple threads
+    //strUsage += HelpMessageOpt("-rpcasyncthreads=<n>", strprintf(_("Set the number of threads to service Async RPC calls (default: %d)"), 1));
+
+    if (mode == HMM_BITCOIND) {
+        strUsage += HelpMessageGroup(_("Metrics Options (only if -daemon and -printtoconsole are not set):"));
+        strUsage += HelpMessageOpt("-showmetrics", _("Show metrics on stdout (default: 1 if running in a console, 0 otherwise)"));
+        strUsage += HelpMessageOpt("-metricsui", _("Set to 1 for a persistent metrics screen, 0 for sequential metrics output (default: 1 if running in a console, 0 otherwise)"));
+        strUsage += HelpMessageOpt("-metricsrefreshtime", strprintf(_("Number of seconds between metrics refreshes (default: %u if running in a console, %u otherwise)"), 1, 600));
+    }
+
+    return strUsage;
+}
+
+static void BlockNotifyCallback(bool initialSync, const CBlockIndex *pBlockIndex)
+{
+    if (initialSync || !pBlockIndex)
+        return;
+
+    std::string strCmd = GetArg("-blocknotify", "");
+
+    boost::replace_all(strCmd, "%s", pBlockIndex->GetBlockHash().GetHex());
+    boost::thread t(runCommand, strCmd); // thread runs free
+}
+
+static void TxExpiryNotifyCallback(const uint256& txid)
+{
+    std::string strCmd = GetArg("-txexpirynotify", "");
+
+    boost::replace_all(strCmd, "%s", txid.GetHex());
+    boost::thread t(runCommand, strCmd); // thread runs free
+}
+
+struct CImportingNow
+{
+    CImportingNow() {
+        assert(fImporting == false);
+        fImporting = true;
+    }
+
+    ~CImportingNow() {
+        assert(fImporting == true);
+        fImporting = false;
+    }
+};
+
+
+// If we're using -prune with -reindex, then delete block files that will be ignored by the
+// reindex.  Since reindexing works by starting at block file 0 and looping until a blockfile
+// is missing, do the same here to delete any later block files after a gap.  Also delete all
+// rev files since they'll be rewritten by the reindex anyway.  This ensures that vinfoBlockFile
+// is in sync with what's actually on disk by the time we start downloading, so that pruning
+// works correctly.
+void CleanupBlockRevFiles()
+{
+    using namespace fs;
+    std::map<std::string, path> mapBlockFiles;
+
+    // Glob all blk?????.dat and rev?????.dat files from the blocks directory.
+    // Remove the rev files immediately and insert the blk file paths into an
+    // ordered map keyed by block file index.
+    LogPrintf("Removing unusable blk?????.dat and rev?????.dat files for -reindex with -prune\n");
+    path blocksdir = GetDataDir() / "blocks";
+    for (directory_iterator it(blocksdir); it != directory_iterator(); it++) {
+        if (is_regular_file(*it) &&
+            it->path().filename().string().length() == 12 &&
+            it->path().filename().string().substr(8,4) == ".dat")
+        {
+            if (it->path().filename().string().substr(0,3) == "blk")
+                mapBlockFiles[it->path().filename().string().substr(3,5)] = it->path();
+            else if (it->path().filename().string().substr(0,3) == "rev")
+                remove(it->path());
+        }
+    }
+
+    // Remove all block files that aren't part of a contiguous set starting at
+    // zero by walking the ordered map (keys are block file indices) by
+    // keeping a separate counter.  Once we hit a gap (or if 0 doesn't exist)
+    // start removing block files.
+    int nContigCounter = 0;
+    for (const std::pair<std::string, path>& item : mapBlockFiles) {
+        if (atoi(item.first) == nContigCounter) {
+            nContigCounter++;
+            continue;
+        }
+        remove(item.second);
+    }
+}
+
+void ThreadStartWalletNotifier()
+{
+    CBlockIndex *pindexLastTip{nullptr};
+
+    // If the wallet is compiled in and enabled, we want to start notifying
+    // from the block which corresponds with the wallet's view of the chain
+    // tip. In particular, we want to handle the case where the node shuts
+    // down uncleanly, and on restart the chain's tip is potentially up to
+    // an hour of chain sync older than the wallet's tip. We assume here
+    // that there is only a single wallet connected to the validation
+    // interface, which is currently true.
+#ifdef ENABLE_WALLET
+    if (pwalletMain)
+    {
+        std::optional<uint256> walletBestBlockHash;
+        {
+            LOCK(pwalletMain->cs_wallet);
+            walletBestBlockHash = pwalletMain->GetPersistedBestBlock();
+        }
+
+        if (walletBestBlockHash.has_value()) {
+            int64_t slept{0};
+            auto timedOut = [&]() -> bool {
+                MilliSleep(500);
+                // once we're out of reindexing, we can start incrementing the slept counter
+                if (!IsInitialBlockDownload(Params().GetConsensus())) {
+                    slept += 500;
+                }
+
+                if (slept > WALLET_INITIAL_SYNC_TIMEOUT) {
+                    auto errmsg = strprintf(
+                            "The wallet's best block hash %s was not detected in restored chain state. "
+                            "Giving up; please restart with `-rescan`.",
+                            walletBestBlockHash.value().GetHex());
+
+                    LogError("main", "*** %s: %s", __func__, errmsg);
+                    uiInterface.ThreadSafeMessageBox(
+                        _("Error: A fatal wallet synchronization error occurred, see debug.log for details"),
+                        "", CClientUIInterface::MSG_ERROR);
+                    StartShutdown();
+                    return true;
+                }
+
+                return false;
+            };
+
+            // Wait until we've found the block that the wallet identifies as its
+            // best block.
+            while (true) {
+                boost::this_thread::interruption_point();
+
+                {
+                    LOCK(cs_main);
+                    BlockMap::iterator mi = mapBlockIndex.find(walletBestBlockHash.value());
+                    if (mi != mapBlockIndex.end()) {
+                        pindexLastTip = (*mi).second;
+                        assert(pindexLastTip != nullptr);
+                        break;
+                    }
+                }
+
+                if (timedOut()) {
+                    return;
+                }
+            }
+
+            // We cannot progress with wallet notification until the chain tip is no
+            // more than 100 blocks behind pindexLastTip. This can occur if the node
+            // shuts down abruptly without being able to write out chainActive; the
+            // node writes chain data out roughly hourly, while the wallet writes it
+            // every 10 minutes. We need to wait for ThreadImport to catch up, or any
+            // missing blocks to be fetched from peers.
+            while (true) {
+                boost::this_thread::interruption_point();
+
+                {
+                    LOCK(cs_main);
+                    const CBlockIndex *pindexFork = chainActive.FindFork(pindexLastTip);
+                    // We know we have the genesis block.
+                    assert(pindexFork != nullptr);
+
+                    if (pindexLastTip->nHeight < pindexFork->nHeight ||
+                        pindexLastTip->nHeight - pindexFork->nHeight < 100)
+                    {
+                        break;
+                    }
+                }
+
+                if (timedOut()) {
+                    return;
+                }
+            }
+        }
+    } else {
+        LOCK(cs_main);
+        pindexLastTip = chainActive.Tip();
+    }
+#else
+    {
+        LOCK(cs_main);
+        pindexLastTip = chainActive.Tip();
+    }
+#endif
+
+    // Become the thread that notifies listeners of transactions that have been
+    // recently added to the mempool, or have been added to or removed from the
+    // chain.
+    ThreadNotifyWallets(pindexLastTip);
+}
+
+void ThreadImport(std::vector<fs::path> vImportFiles, const CChainParams& chainparams)
+{
+    RenameThread("zcash-loadblk");
+    CImportingNow imp;
+
+    // -reindex
+    if (fReindex) {
+        nSizeReindexed = 0;  // will be modified inside LoadExternalBlockFile
+        // Find the summary size of all block files first
+        int nFile = 0;
+        size_t fullSize = 0;
+        while (true) {
+            CDiskBlockPos pos(nFile, 0);
+            fs::path blkFile = GetBlockPosFilename(pos, "blk");
+            if (!fs::exists(blkFile))
+                break; // No block files left to reindex
+            nFile++;
+            fullSize += fs::file_size(blkFile);
+        }
+        nFullSizeToReindex = std::max<size_t>(1, fullSize);
+        nFile = 0;
+        while (true) {
+            CDiskBlockPos pos(nFile, 0);
+            if (!fs::exists(GetBlockPosFilename(pos, "blk")))
+                break; // No block files left to reindex
+            FILE *file = OpenBlockFile(pos, true);
+            if (!file)
+                break; // This error is logged in OpenBlockFile
+            LogPrintf("Reindexing block file blk%05u.dat...\n", (unsigned int)nFile);
+            LoadExternalBlockFile(chainparams, file, &pos);
+            nFile++;
+        }
+        pblocktree->WriteReindexing(false);
+        fReindex = false;
+        nSizeReindexed = 0;
+        nFullSizeToReindex = 1;
+        LogPrintf("Reindexing finished\n");
+        // To avoid ending up in a situation without genesis block, re-try initializing (no-op if reindexing worked):
+        InitBlockIndex(chainparams);
+    }
+
+    // hardcoded $DATADIR/bootstrap.dat
+    fs::path pathBootstrap = GetDataDir() / "bootstrap.dat";
+    if (fs::exists(pathBootstrap)) {
+        FILE *file = fsbridge::fopen(pathBootstrap, "rb");
+        if (file) {
+            fs::path pathBootstrapOld = GetDataDir() / "bootstrap.dat.old";
+            LogPrintf("Importing bootstrap.dat...\n");
+            LoadExternalBlockFile(chainparams, file);
+            RenameOver(pathBootstrap, pathBootstrapOld);
+        } else {
+            LogPrintf("Warning: Could not open bootstrap file %s\n", pathBootstrap.string());
+        }
+    }
+
+    // -loadblock=
+    for (const fs::path& path : vImportFiles) {
+        FILE *file = fsbridge::fopen(path, "rb");
+        if (file) {
+            LogPrintf("Importing blocks file %s...\n", path.string());
+            LoadExternalBlockFile(chainparams, file);
+        } else {
+            LogPrintf("Warning: Could not open blocks file %s\n", path.string());
+        }
+    }
+
+    // scan for better chains in the block chain database, that are not yet connected in the active best chain
+    CValidationState state;
+    if (!ActivateBestChain(state, chainparams)) {
+        LogPrintf("Failed to connect best block");
+        StartShutdown();
+    }
+
+    if (GetBoolArg("-stopafterblockimport", DEFAULT_STOPAFTERBLOCKIMPORT)) {
+        LogPrintf("Stopping after block import\n");
+        StartShutdown();
+    }
+}
+
+/** Sanity checks
+ *  Ensure that Bitcoin is running in a usable environment with all
+ *  necessary library support.
+ */
+bool InitSanityCheck(void)
+{
+    if(!CKey::ECC_InitSanityCheck()) {
+        InitError("Elliptic curve cryptography sanity check failure. Aborting.");
+        return false;
+    }
+    if (!glibc_sanity_test() || !glibcxx_sanity_test())
+        return false;
+
+    return true;
+}
+
+
+static void ZC_LoadParams(
+    const CChainParams& chainparams
+)
+{
+    struct timeval tv_start, tv_end;
+    float elapsed;
+
+    fs::path sapling_spend = ZC_GetParamsDir() / "sapling-spend.params";
+    fs::path sapling_output = ZC_GetParamsDir() / "sapling-output.params";
+    fs::path sprout_groth16 = ZC_GetParamsDir() / "sprout-groth16.params";
+
+    if (!(
+        fs::exists(sapling_spend) &&
+        fs::exists(sapling_output) &&
+        fs::exists(sprout_groth16)
+    )) {
+        uiInterface.ThreadSafeMessageBox(strprintf(
+            _("Cannot find the Zcash network parameters in the following directory:\n"
+              "%s\n"
+              "Please run 'zcash-fetch-params' or './zcutil/fetch-params.sh' and then restart."),
+                ZC_GetParamsDir()),
+            "", CClientUIInterface::MSG_ERROR);
+        StartShutdown();
+        return;
+    }
+
+    static_assert(
+        sizeof(fs::path::value_type) == sizeof(codeunit),
+        "librustzcash not configured correctly");
+    auto sapling_spend_str = sapling_spend.native();
+    auto sapling_output_str = sapling_output.native();
+    auto sprout_groth16_str = sprout_groth16.native();
+
+    LogPrintf("Loading Sapling (Spend) parameters from %s\n", sapling_spend.string().c_str());
+    LogPrintf("Loading Sapling (Output) parameters from %s\n", sapling_output.string().c_str());
+    LogPrintf("Loading Sapling (Sprout Groth16) parameters from %s\n", sprout_groth16.string().c_str());
+    gettimeofday(&tv_start, 0);
+
+    librustzcash_init_zksnark_params(
+        reinterpret_cast<const codeunit*>(sapling_spend_str.c_str()),
+        sapling_spend_str.length(),
+        reinterpret_cast<const codeunit*>(sapling_output_str.c_str()),
+        sapling_output_str.length(),
+        reinterpret_cast<const codeunit*>(sprout_groth16_str.c_str()),
+        sprout_groth16_str.length()
+    );
+
+    gettimeofday(&tv_end, 0);
+    elapsed = float(tv_end.tv_sec-tv_start.tv_sec) + (tv_end.tv_usec-tv_start.tv_usec)/float(1000000);
+    LogPrintf("Loaded proof system parameters in %fs seconds.\n", elapsed);
+}
+
+bool AppInitServers(boost::thread_group& threadGroup)
+{
+    RPCServer::OnStopped(&OnRPCStopped);
+    RPCServer::OnPreCommand(&OnRPCPreCommand);
+    if (!InitHTTPServer())
+        return false;
+    if (!StartRPC())
+        return false;
+    if (!StartHTTPRPC())
+        return false;
+    if (GetBoolArg("-rest", DEFAULT_REST_ENABLE) && !StartREST())
+        return false;
+    if (!StartHTTPServer())
+        return false;
+    return true;
+}
+
+// Parameter interaction based on rules
+void InitParameterInteraction()
+{
+    // when specifying an explicit binding address, you want to listen on it
+    // even when -connect or -proxy is specified
+    if (mapArgs.count("-bind")) {
+        if (SoftSetBoolArg("-listen", true))
+            LogPrintf("%s: parameter interaction: -bind set -> setting -listen=1\n", __func__);
+    }
+    if (mapArgs.count("-whitebind")) {
+        if (SoftSetBoolArg("-listen", true))
+            LogPrintf("%s: parameter interaction: -whitebind set -> setting -listen=1\n", __func__);
+    }
+
+    if (mapArgs.count("-connect") && mapMultiArgs["-connect"].size() > 0) {
+        // when only connecting to trusted nodes, do not seed via DNS, or listen by default
+        if (SoftSetBoolArg("-dnsseed", false))
+            LogPrintf("%s: parameter interaction: -connect set -> setting -dnsseed=0\n", __func__);
+        if (SoftSetBoolArg("-listen", false))
+            LogPrintf("%s: parameter interaction: -connect set -> setting -listen=0\n", __func__);
+    }
+
+    if (mapArgs.count("-proxy")) {
+        // to protect privacy, do not listen by default if a default proxy server is specified
+        if (SoftSetBoolArg("-listen", false))
+            LogPrintf("%s: parameter interaction: -proxy set -> setting -listen=0\n", __func__);
+        // to protect privacy, do not discover addresses by default
+        if (SoftSetBoolArg("-discover", false))
+            LogPrintf("%s: parameter interaction: -proxy set -> setting -discover=0\n", __func__);
+    }
+
+    if (!GetBoolArg("-listen", DEFAULT_LISTEN)) {
+        // do not try to retrieve public IP when not listening (pointless)
+        if (SoftSetBoolArg("-discover", false))
+            LogPrintf("%s: parameter interaction: -listen=0 -> setting -discover=0\n", __func__);
+        if (SoftSetBoolArg("-listenonion", false))
+            LogPrintf("%s: parameter interaction: -listen=0 -> setting -listenonion=0\n", __func__);
+    }
+
+    if (mapArgs.count("-externalip")) {
+        // if an explicit public IP is specified, do not try to find others
+        if (SoftSetBoolArg("-discover", false))
+            LogPrintf("%s: parameter interaction: -externalip set -> setting -discover=0\n", __func__);
+    }
+
+#ifdef ENABLE_WALLET
+    // -rescan only affects the wallet.
+
+    if (GetBoolArg("-salvagewallet", false)) {
+        // Rewrite just private keys: rescan to find transactions
+        if (SoftSetBoolArg("-rescan", true))
+            LogPrintf("%s: parameter interaction: -salvagewallet=1 -> setting -rescan=1\n", __func__);
+    }
+
+    if (GetBoolArg("-zapwallettxes", false)) {
+        if (SoftSetBoolArg("-rescan", true))
+            LogPrintf("%s: parameter interaction: -zapwallettxes=<mode> -> setting -rescan=1\n", __func__);
+    }
+
+    if (GetBoolArg("-reindex", false) && !GetArg("-prune", 0)) {
+        if (SoftSetBoolArg("-rescan", true))
+            LogPrintf("%s: parameter interaction: -reindex=1 and not pruning -> setting -rescan=1\n", __func__);
+    }
+
+    if (GetBoolArg("-reindex-chainstate", false) && !GetArg("-prune", 0)) {
+        if (SoftSetBoolArg("-rescan", true))
+            LogPrintf("%s: parameter interaction: -reindex-chainstate=1 and not pruning -> setting -rescan=1\n", __func__);
+    }
+#endif
+
+    // disable walletbroadcast and whitelistrelay in blocksonly mode
+    if (GetBoolArg("-blocksonly", DEFAULT_BLOCKSONLY)) {
+        if (SoftSetBoolArg("-whitelistrelay", false))
+            LogPrintf("%s: parameter interaction: -blocksonly=1 -> setting -whitelistrelay=0\n", __func__);
+#ifdef ENABLE_WALLET
+        if (SoftSetBoolArg("-walletbroadcast", false))
+            LogPrintf("%s: parameter interaction: -blocksonly=1 -> setting -walletbroadcast=0\n", __func__);
+#endif
+    }
+
+    // Forcing relay from whitelisted hosts implies we will accept relays from them in the first place.
+    if (GetBoolArg("-whitelistforcerelay", DEFAULT_WHITELISTFORCERELAY)) {
+        if (SoftSetBoolArg("-whitelistrelay", true))
+            LogPrintf("%s: parameter interaction: -whitelistforcerelay=1 -> setting -whitelistrelay=1\n", __func__);
+    }
+}
+
+void InitLogging()
+{
+    fPrintToConsole = GetBoolArg("-printtoconsole", false);
+    fLogTimestamps = GetBoolArg("-logtimestamps", DEFAULT_LOGTIMESTAMPS);
+    fLogIPs = GetBoolArg("-logips", DEFAULT_LOGIPS);
+
+    // Set up the initial filtering directive from the -debug flags.
+    std::string initialFilter = LogConfigFilter();
+
+    fs::path pathDebug = GetDebugLogPath();
+    const fs::path::string_type& pathDebugStr = pathDebug.native();
+    static_assert(sizeof(fs::path::value_type) == sizeof(codeunit),
+                    "native path has unexpected code unit size");
+    const codeunit* pathDebugCStr = nullptr;
+    size_t pathDebugLen = 0;
+    if (!fPrintToConsole) {
+        pathDebugCStr = reinterpret_cast<const codeunit*>(pathDebugStr.c_str());
+        pathDebugLen = pathDebugStr.length();
+    }
+
+    pTracingHandle = tracing_init(
+        pathDebugCStr, pathDebugLen,
+        initialFilter.c_str(),
+        fLogTimestamps);
+
+    LogPrintf("\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n");
+    LogPrintf("Zcash version %s (%s)\n", FormatFullVersion(), CLIENT_DATE);
+}
+
+[[noreturn]] static void new_handler_terminate()
+{
+    // Rather than throwing std::bad-alloc if allocation fails, terminate
+    // immediately to (try to) avoid chain corruption.
+    // Since LogPrintf may itself allocate memory, set the handler directly
+    // to terminate first.
+    std::set_new_handler(std::terminate);
+    fputs("Error: Out of memory. Terminating.\n", stderr);
+    LogPrintf("Error: Out of memory. Terminating.\n");
+
+    // The log was successful, terminate now.
+    std::terminate();
+};
+
+/** Initialize bitcoin.
+ *  @pre Parameters should be parsed and config file should be read.
+ */
+bool AppInit2(boost::thread_group& threadGroup, CScheduler& scheduler)
+{
+    // ********************************************************* Step 1: setup
+#ifdef _MSC_VER
+    // Turn off Microsoft heap dump noise
+    _CrtSetReportMode(_CRT_WARN, _CRTDBG_MODE_FILE);
+    _CrtSetReportFile(_CRT_WARN, CreateFileA("NUL", GENERIC_WRITE, 0, NULL, OPEN_EXISTING, 0, 0));
+#endif
+#if _MSC_VER >= 1400
+    // Disable confusing "helpful" text message on abort, Ctrl-C
+    _set_abort_behavior(0, _WRITE_ABORT_MSG | _CALL_REPORTFAULT);
+#endif
+#ifdef WIN32
+    // Enable Data Execution Prevention (DEP)
+    SetProcessDEPPolicy(PROCESS_DEP_ENABLE);
+#endif
+
+    if (!SetupNetworking())
+        return InitError("Initializing networking failed");
+
+#ifndef WIN32
+    if (GetBoolArg("-sysperms", false)) {
+#ifdef ENABLE_WALLET
+        if (!GetBoolArg("-disablewallet", false))
+            return InitError("-sysperms is not allowed in combination with enabled wallet functionality");
+#endif
+    } else {
+        umask(077);
+    }
+
+    // Clean shutdown on SIGTERM
+    assert(fRequestShutdown.is_lock_free());
+    struct sigaction sa;
+    sa.sa_handler = HandleSIGTERM;
+    sigemptyset(&sa.sa_mask);
+    sa.sa_flags = SA_RESTART;
+    sigaction(SIGTERM, &sa, NULL);
+    sigaction(SIGINT, &sa, NULL);
+
+    // Reopen debug.log on SIGHUP
+    assert(fReopenDebugLog.is_lock_free());
+    struct sigaction sa_hup;
+    sa_hup.sa_handler = HandleSIGHUP;
+    sigemptyset(&sa_hup.sa_mask);
+    sa_hup.sa_flags = SA_RESTART;
+    sigaction(SIGHUP, &sa_hup, NULL);
+
+    // Ignore SIGPIPE, otherwise it will bring the daemon down if the client closes unexpectedly
+    signal(SIGPIPE, SIG_IGN);
+#endif
+
+    std::set_new_handler(new_handler_terminate);
+
+    // ********************************************************* Step 2: parameter interactions
+    const CChainParams& chainparams = Params();
+
+    // also see: InitParameterInteraction()
+
+    // Set this early so that experimental features are correctly enabled/disabled
+    auto err = InitExperimentalMode();
+    if (err) {
+        return InitError(err.value());
+    }
+
+    // if using block pruning, then disable txindex
+    if (GetArg("-prune", 0)) {
+        if (GetBoolArg("-txindex", DEFAULT_TXINDEX))
+            return InitError(_("Prune mode is incompatible with -txindex."));
+#ifdef ENABLE_WALLET
+        if (GetBoolArg("-rescan", false)) {
+            return InitError(_("Rescans are not possible in pruned mode. You will need to use -reindex which will download the whole blockchain again."));
+        }
+#endif
+    }
+
+    // Make sure enough file descriptors are available
+    int nBind = std::max((int)mapArgs.count("-bind") + (int)mapArgs.count("-whitebind"), 1);
+    int nUserMaxConnections = GetArg("-maxconnections", DEFAULT_MAX_PEER_CONNECTIONS);
+    nMaxConnections = std::max(nUserMaxConnections, 0);
+
+    // Trim requested connection counts, to fit into system limitations
+    nMaxConnections = std::max(std::min(nMaxConnections, FD_SETSIZE - nBind - MIN_CORE_FILEDESCRIPTORS), 0);
+    int nFD = RaiseFileDescriptorLimit(nMaxConnections + MIN_CORE_FILEDESCRIPTORS);
+    if (nFD < MIN_CORE_FILEDESCRIPTORS)
+        return InitError(_("Not enough file descriptors available."));
+    nMaxConnections = std::min(nFD - MIN_CORE_FILEDESCRIPTORS, nMaxConnections);
+
+    if (nMaxConnections < nUserMaxConnections)
+        InitWarning(strprintf(_("Reducing -maxconnections from %d to %d, because of system limitations."), nUserMaxConnections, nMaxConnections));
+
+    // ensure that the user has not disabled checkpoints when requesting to
+    // skip transaction verification in initial block download.
+    if (GetBoolArg("-ibdskiptxverification", DEFAULT_IBD_SKIP_TX_VERIFICATION)) {
+        if (!GetBoolArg("-checkpoints", DEFAULT_CHECKPOINTS_ENABLED)) {
+            return InitError(_("-ibdskiptxverification requires checkpoints to be enabled; it is incompatible with flags that disable checkpoints"));
+        }
+    }
+
+    // ********************************************************* Step 3: parameter-to-internal-flags
+
+    fDebug = !mapMultiArgs["-debug"].empty();
+    // Special-case: if -debug=0/-nodebug is set, turn off debugging messages
+    const std::vector<std::string>& categories = mapMultiArgs["-debug"];
+    if (GetBoolArg("-nodebug", false) || find(categories.begin(), categories.end(), std::string("0")) != categories.end())
+        fDebug = false;
+
+    // Special case: if debug=zrpcunsafe, implies debug=zrpc, so add it to debug categories
+    if (find(categories.begin(), categories.end(), std::string("zrpcunsafe")) != categories.end()) {
+        if (find(categories.begin(), categories.end(), std::string("zrpc")) == categories.end()) {
+            LogPrintf("%s: parameter interaction: setting -debug=zrpcunsafe -> -debug=zrpc\n", __func__);
+            std::vector<std::string>& v = mapMultiArgs["-debug"];
+            v.push_back("zrpc");
+        }
+    }
+
+    // Check for -debugnet
+    if (GetBoolArg("-debugnet", false))
+        InitWarning(_("Unsupported argument -debugnet ignored, use -debug=net."));
+    // Check for -socks - as this is a privacy risk to continue, exit here
+    if (mapArgs.count("-socks"))
+        return InitError(_("Unsupported argument -socks found. Setting SOCKS version isn't possible anymore, only SOCKS5 proxies are supported."));
+    // Check for -tor - as this is a privacy risk to continue, exit here
+    if (GetBoolArg("-tor", false))
+        return InitError(_("Unsupported argument -tor found, use -onion."));
+
+    if (GetBoolArg("-benchmark", false))
+        InitWarning(_("Unsupported argument -benchmark ignored, use -debug=bench."));
+
+    // Checkmempool and checkblockindex default to true in regtest mode
+    int ratio = std::min<int>(std::max<int>(GetArg("-checkmempool", chainparams.DefaultConsistencyChecks() ? 1 : 0), 0), 1000000);
+    if (ratio != 0) {
+        mempool.setSanityCheck(1.0 / ratio);
+    }
+
+    int64_t mempoolTotalCostLimit = GetArg("-mempooltxcostlimit", DEFAULT_MEMPOOL_TOTAL_COST_LIMIT);
+    int64_t mempoolEvictionMemorySeconds = GetArg("-mempoolevictionmemoryminutes", DEFAULT_MEMPOOL_EVICTION_MEMORY_MINUTES) * 60;
+    mempool.SetMempoolCostLimit(mempoolTotalCostLimit, mempoolEvictionMemorySeconds);
+
+    fCheckBlockIndex = GetBoolArg("-checkblockindex", chainparams.DefaultConsistencyChecks());
+    fIBDSkipTxVerification = GetBoolArg("-ibdskiptxverification", DEFAULT_IBD_SKIP_TX_VERIFICATION);
+    fCheckpointsEnabled = GetBoolArg("-checkpoints", DEFAULT_CHECKPOINTS_ENABLED);
+
+    // -par=0 means autodetect, but nScriptCheckThreads==0 means no concurrency
+    nScriptCheckThreads = GetArg("-par", DEFAULT_SCRIPTCHECK_THREADS);
+    if (nScriptCheckThreads <= 0)
+        nScriptCheckThreads += GetNumCores();
+    if (nScriptCheckThreads <= 1)
+        nScriptCheckThreads = 0;
+    else if (nScriptCheckThreads > MAX_SCRIPTCHECK_THREADS)
+        nScriptCheckThreads = MAX_SCRIPTCHECK_THREADS;
+
+    fServer = GetBoolArg("-server", false);
+
+    // block pruning; get the amount of disk space (in MiB) to allot for block & undo files
+    int64_t nSignedPruneTarget = GetArg("-prune", 0) * 1024 * 1024;
+    if (nSignedPruneTarget < 0) {
+        return InitError(_("Prune cannot be configured with a negative value."));
+    }
+    nPruneTarget = (uint64_t) nSignedPruneTarget;
+    if (nPruneTarget) {
+        if (nPruneTarget < MIN_DISK_SPACE_FOR_BLOCK_FILES) {
+            return InitError(strprintf(_("Prune configured below the minimum of %d MiB.  Please use a higher number."), MIN_DISK_SPACE_FOR_BLOCK_FILES / 1024 / 1024));
+        }
+        LogPrintf("Prune configured to target %uMiB on disk for block and undo files.\n", nPruneTarget / 1024 / 1024);
+        fPruneMode = true;
+    }
+
+    RegisterAllCoreRPCCommands(tableRPC);
+#ifdef ENABLE_WALLET
+    bool fDisableWallet = GetBoolArg("-disablewallet", false);
+    if (!fDisableWallet)
+        RegisterWalletRPCCommands(tableRPC);
+#endif
+
+    nConnectTimeout = GetArg("-timeout", DEFAULT_CONNECT_TIMEOUT);
+    if (nConnectTimeout <= 0)
+        nConnectTimeout = DEFAULT_CONNECT_TIMEOUT;
+
+    // Fee-per-kilobyte amount considered the same as "free"
+    // If you are mining, be careful setting this:
+    // if you set it to zero then
+    // a transaction spammer can cheaply fill blocks using
+    // 1-satoshi-fee transactions. It should be set above the real
+    // cost to you of processing a transaction.
+    if (mapArgs.count("-minrelaytxfee"))
+    {
+        CAmount n = 0;
+        if (ParseMoney(mapArgs["-minrelaytxfee"], n) && n > 0)
+            ::minRelayTxFee = CFeeRate(n);
+        else
+            return InitError(strprintf(_("Invalid amount for -minrelaytxfee=<amount>: '%s'"), mapArgs["-minrelaytxfee"]));
+    }
+
+#ifdef ENABLE_WALLET
+    if (!CWallet::ParameterInteraction(chainparams))
+        return false;
+#endif // ENABLE_WALLET
+
+    fIsBareMultisigStd = GetBoolArg("-permitbaremultisig", DEFAULT_PERMIT_BAREMULTISIG);
+    fAcceptDatacarrier = GetBoolArg("-datacarrier", DEFAULT_ACCEPT_DATACARRIER);
+    nMaxDatacarrierBytes = GetArg("-datacarriersize", nMaxDatacarrierBytes);
+
+    fAlerts = GetBoolArg("-alerts", DEFAULT_ALERTS);
+
+    // Option to startup with mocktime set (used for regression testing):
+    SetMockTime(GetArg("-mocktime", 0)); // SetMockTime(0) is a no-op
+
+    if (GetBoolArg("-peerbloomfilters", DEFAULT_PEERBLOOMFILTERS))
+        nLocalServices |= NODE_BLOOM;
+
+    nMaxTipAge = GetArg("-maxtipage", DEFAULT_MAX_TIP_AGE);
+
+    KeyIO keyIO(chainparams);
+#ifdef ENABLE_MINING
+    if (mapArgs.count("-mineraddress")) {
+        auto addr = keyIO.DecodePaymentAddress(mapArgs["-mineraddress"]);
+        auto consensus = chainparams.GetConsensus();
+        int height = consensus.HeightOfLatestSettledUpgrade();
+        if (!(addr.has_value() && std::visit(ExtractMinerAddress(consensus, height), addr.value()).has_value())) {
+            return InitError(strprintf(
+                _("Invalid address for -mineraddress=<addr>: '%s' (must be a Sapling or transparent P2PKH address, or a Unified Address containing a valid receiver for the most recent settled network upgrade.)"),
+                mapArgs["-mineraddress"]));
+        }
+    }
+#endif
+
+    if (!mapMultiArgs["-nuparams"].empty()) {
+        // Allow overriding network upgrade parameters for testing
+        if (chainparams.NetworkIDString() != "regtest") {
+            return InitError("Network upgrade parameters may only be overridden on regtest.");
+        }
+        const std::vector<std::string>& deployments = mapMultiArgs["-nuparams"];
+        for (auto i : deployments) {
+            std::vector<std::string> vDeploymentParams;
+            boost::split(vDeploymentParams, i, boost::is_any_of(":"));
+            if (vDeploymentParams.size() != 2) {
+                return InitError("Network upgrade parameters malformed, expecting hexBranchId:activationHeight");
+            }
+            int nActivationHeight;
+            if (!ParseInt32(vDeploymentParams[1], &nActivationHeight)) {
+                return InitError(strprintf("Invalid nActivationHeight (%s)", vDeploymentParams[1]));
+            }
+            bool found = false;
+            // Exclude Sprout from upgrades
+            for (auto i = Consensus::BASE_SPROUT + 1; i < Consensus::MAX_NETWORK_UPGRADES; ++i)
+            {
+                if (vDeploymentParams[0].compare(HexInt(NetworkUpgradeInfo[i].nBranchId)) == 0) {
+                    UpdateNetworkUpgradeParameters(Consensus::UpgradeIndex(i), nActivationHeight);
+                    found = true;
+                    LogPrintf("Setting network upgrade activation parameters for %s to height=%d\n", vDeploymentParams[0], nActivationHeight);
+                    break;
+                }
+            }
+            if (!found) {
+                return InitError(strprintf("Invalid network upgrade (%s)", vDeploymentParams[0]));
+            }
+        }
+
+        // To make testing easier (this code path is active only for regtest), activate missing network versions,
+        // so for example, if a Python (RPC) test does:
+        // extra_args = [
+        //    nuparams(BLOSSOM_BRANCH_ID, 205),
+        //    nuparams(HEARTWOOD_BRANCH_ID, 205),
+        //    nuparams(CANOPY_BRANCH_ID, 205),
+        //    nuparams(NU5_BRANCH_ID, 210),
+        // ]
+        //
+        // This can be simplified to:
+        // extra_args = [
+        //    nuparams(CANOPY_BRANCH_ID, 205),
+        //    nuparams(NU5_BRANCH_ID, 210),
+        // ]
+        const auto& consensus = chainparams.GetConsensus();
+        int nActivationHeight = Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT;
+        for (auto i = Consensus::MAX_NETWORK_UPGRADES-1; i >= Consensus::BASE_SPROUT + 1; --i) {
+            if (consensus.vUpgrades[i].nActivationHeight == Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT) {
+                UpdateNetworkUpgradeParameters(Consensus::UpgradeIndex(i), nActivationHeight);
+            }
+            nActivationHeight = consensus.vUpgrades[i].nActivationHeight;
+        }
+    }
+
+    if (mapArgs.count("-nurejectoldversions")) {
+        if (chainparams.NetworkIDString() != "regtest") {
+            return InitError("-nurejectoldversions may only be set on regtest.");
+        }
+    }
+
+    if (!mapMultiArgs["-fundingstream"].empty()) {
+        // Allow overriding network upgrade parameters for testing
+        if (chainparams.NetworkIDString() != "regtest") {
+            return InitError("Funding stream parameters may only be overridden on regtest.");
+        }
+        const std::vector<std::string>& streams = mapMultiArgs["-fundingstream"];
+        for (auto i : streams) {
+            std::vector<std::string> vStreamParams;
+            boost::split(vStreamParams, i, boost::is_any_of(":"));
+            if (vStreamParams.size() != 4) {
+                return InitError("Funding stream parameters malformed, expecting streamId:startHeight:endHeight:comma_delimited_addresses");
+            }
+            int nFundingStreamId;
+            if (!ParseInt32(vStreamParams[0], &nFundingStreamId) ||
+                    nFundingStreamId < Consensus::FIRST_FUNDING_STREAM ||
+                    nFundingStreamId >= Consensus::MAX_FUNDING_STREAMS) {
+                return InitError(strprintf("Invalid streamId (%s)", vStreamParams[0]));
+            }
+
+            int nStartHeight;
+            if (!ParseInt32(vStreamParams[1], &nStartHeight)) {
+                return InitError(strprintf("Invalid funding stream start height (%s)", vStreamParams[1]));
+            }
+
+            int nEndHeight;
+            if (!ParseInt32(vStreamParams[2], &nEndHeight)) {
+                return InitError(strprintf("Invalid funding stream end height (%s)", vStreamParams[2]));
+            }
+
+            std::vector<std::string> vStreamAddrs;
+            boost::split(vStreamAddrs, vStreamParams[3], boost::is_any_of(","));
+
+            auto fs = Consensus::FundingStream::ParseFundingStream(
+                    chainparams.GetConsensus(), chainparams, nStartHeight, nEndHeight, vStreamAddrs);
+
+            UpdateFundingStreamParameters((Consensus::FundingStreamIndex) nFundingStreamId, fs);
+        }
+    }
+
+    // ********************************************************* Step 4: application initialization: dir lock, daemonize, pidfile, debug log
+
+    // Initialize libsodium
+    if (sodium_init() == -1) {
+        return false;
+    }
+
+    // Initialize elliptic curve code
+    ECC_Start();
+    globalVerifyHandle.reset(new ECCVerifyHandle());
+
+    // Sanity check
+    if (!InitSanityCheck())
+        return InitError(_("Initialization sanity check failed. Zcash is shutting down."));
+
+    std::string strDataDir = GetDataDir().string();
+
+    // Make sure only a single Bitcoin process is using the data directory.
+    fs::path pathLockFile = GetDataDir() / ".lock";
+    FILE* file = fsbridge::fopen(pathLockFile, "a"); // empty lock file; created if it doesn't exist.
+    if (file) fclose(file);
+
+    try {
+        static boost::interprocess::file_lock lock(pathLockFile.string().c_str());
+        if (!lock.try_lock())
+            return InitError(strprintf(_("Cannot obtain a lock on data directory %s. Zcash is probably already running."), strDataDir));
+    } catch(const boost::interprocess::interprocess_exception& e) {
+        return InitError(strprintf(_("Cannot obtain a lock on data directory %s. Zcash is probably already running.") + " %s.", strDataDir, e.what()));
+    }
+
+#ifndef WIN32
+    CreatePidFile(GetPidFile(), getpid());
+#endif
+    // if (GetBoolArg("-shrinkdebugfile", !fDebug))
+    //     ShrinkDebugFile();
+
+#ifdef ENABLE_WALLET
+    LogPrintf("Using BerkeleyDB version %s\n", DbEnv::version(0, 0, 0));
+#endif
+    if (!fLogTimestamps)
+        LogPrintf("Startup time: %s\n", DateTimeStrFormat("%Y-%m-%d %H:%M:%S", GetTime()));
+    LogPrintf("Default data directory %s\n", GetDefaultDataDir().string());
+    LogPrintf("Using data directory %s\n", strDataDir);
+    LogPrintf("Using config file %s\n", GetConfigFile(GetArg("-conf", BITCOIN_CONF_FILENAME)).string());
+    LogPrintf("Using at most %i connections (%i file descriptors available)\n", nMaxConnections, nFD);
+    std::ostringstream strErrors;
+
+    LogPrintf("Using %u threads for script verification\n", nScriptCheckThreads);
+    if (nScriptCheckThreads) {
+        for (int i=0; i<nScriptCheckThreads-1; i++)
+            threadGroup.create_thread(&ThreadScriptCheck);
+    }
+
+    // Start the lightweight task scheduler thread
+    CScheduler::Function serviceLoop = boost::bind(&CScheduler::serviceQueue, &scheduler);
+    threadGroup.create_thread(boost::bind(&TraceThread<CScheduler::Function>, "scheduler", serviceLoop));
+
+    // Count uptime
+    MarkStartTime();
+
+    int prometheusPort = GetArg("-prometheusport", -1);
+    if (prometheusPort > 0) {
+        const std::vector<std::string>& vAllow = mapMultiArgs["-metricsallowip"];
+        std::vector<const char*> vAllowCstr;
+        for (const std::string& strAllow : vAllow) {
+            vAllowCstr.push_back(strAllow.c_str());
+        }
+
+        std::string metricsBind = GetArg("-metricsbind", "");
+        const char* metricsBindCstr = nullptr;
+        if (!metricsBind.empty()) {
+            metricsBindCstr = metricsBind.c_str();
+        }
+
+        // Start up the metrics runtime. This spins off a Rust thread that runs
+        // the Prometheus exporter. We just let this thread die at process end.
+        LogPrintf("metrics thread start");
+        if (!metrics_run(metricsBindCstr, vAllowCstr.data(), vAllowCstr.size(), prometheusPort)) {
+            return InitError(strprintf(_("Failed to start Prometheus metrics exporter")));
+        }
+    }
+
+    // Expose binary metadata to metrics, using a single time series with value 1.
+    // https://www.robustperception.io/exposing-the-software-version-to-prometheus
+    MetricsIncrementCounter(
+        "zcashd.build.info",
+        "version", CLIENT_BUILD.c_str());
+
+    if ((chainparams.NetworkIDString() != "regtest") &&
+            GetBoolArg("-showmetrics", isatty(STDOUT_FILENO)) &&
+            !fPrintToConsole && !GetBoolArg("-daemon", false)) {
+        // Start the persistent metrics interface
+        ConnectMetricsScreen();
+        threadGroup.create_thread(&ThreadShowMetricsScreen);
+    }
+
+    // Initialize Zcash circuit parameters
+    ZC_LoadParams(chainparams);
+
+    /* Start the RPC server already.  It will be started in "warmup" mode
+     * and not really process calls already (but it will signify connections
+     * that the server is there and will be ready later).  Warmup mode will
+     * be disabled when initialisation is finished.
+     */
+    if (fServer)
+    {
+        uiInterface.InitMessage.connect(SetRPCWarmupStatus);
+        if (!AppInitServers(threadGroup))
+            return InitError(_("Unable to start HTTP server. See debug log for details."));
+    }
+
+    int64_t nStart;
+
+    // ********************************************************* Step 5: verify wallet database integrity
+#ifdef ENABLE_WALLET
+    if (!fDisableWallet) {
+        if (!CWallet::Verify())
+            return false;
+    } // (!fDisableWallet)
+#endif // ENABLE_WALLET
+    // ********************************************************* Step 6: network initialization
+
+    RegisterNodeSignals(GetNodeSignals());
+
+    // sanitize comments per BIP-0014, format user agent and check total size
+    std::vector<string> uacomments;
+    for (std::string cmt : mapMultiArgs["-uacomment"])
+    {
+        if (cmt != SanitizeString(cmt, SAFE_CHARS_UA_COMMENT))
+            return InitError(strprintf("User Agent comment (%s) contains unsafe characters.", cmt));
+        uacomments.push_back(SanitizeString(cmt, SAFE_CHARS_UA_COMMENT));
+    }
+    strSubVersion = FormatSubVersion(CLIENT_NAME, CLIENT_VERSION, uacomments);
+    if (strSubVersion.size() > MAX_SUBVERSION_LENGTH) {
+        return InitError(strprintf("Total length of network version string %i exceeds maximum of %i characters. Reduce the number and/or size of uacomments.",
+            strSubVersion.size(), MAX_SUBVERSION_LENGTH));
+    }
+
+    if (mapArgs.count("-onlynet")) {
+        std::set<enum Network> nets;
+        for (const std::string& snet : mapMultiArgs["-onlynet"]) {
+            enum Network net = ParseNetwork(snet);
+            if (net == NET_UNROUTABLE)
+                return InitError(strprintf(_("Unknown network specified in -onlynet: '%s'"), snet));
+            nets.insert(net);
+        }
+        for (int n = 0; n < NET_MAX; n++) {
+            enum Network net = (enum Network)n;
+            if (!nets.count(net))
+                SetLimited(net);
+        }
+    }
+
+    if (mapArgs.count("-whitelist")) {
+        for (const std::string& net : mapMultiArgs["-whitelist"]) {
+            CSubNet subnet(net);
+            if (!subnet.IsValid())
+                return InitError(strprintf(_("Invalid netmask specified in -whitelist: '%s'"), net));
+            CNode::AddWhitelistedRange(subnet);
+        }
+    }
+
+    bool proxyRandomize = GetBoolArg("-proxyrandomize", DEFAULT_PROXYRANDOMIZE);
+    // -proxy sets a proxy for all outgoing network traffic
+    // -noproxy (or -proxy=0) as well as the empty string can be used to not set a proxy, this is the default
+    std::string proxyArg = GetArg("-proxy", "");
+    SetLimited(NET_TOR);
+    if (proxyArg != "" && proxyArg != "0") {
+        proxyType addrProxy = proxyType(CService(proxyArg, 9050), proxyRandomize);
+        if (!addrProxy.IsValid())
+            return InitError(strprintf(_("Invalid -proxy address: '%s'"), proxyArg));
+
+        SetProxy(NET_IPV4, addrProxy);
+        SetProxy(NET_IPV6, addrProxy);
+        SetProxy(NET_TOR, addrProxy);
+        SetNameProxy(addrProxy);
+        SetLimited(NET_TOR, false); // by default, -proxy sets onion as reachable, unless -noonion later
+    }
+
+    // -onion can be used to set only a proxy for .onion, or override normal proxy for .onion addresses
+    // -noonion (or -onion=0) disables connecting to .onion entirely
+    // An empty string is used to not override the onion proxy (in which case it defaults to -proxy set above, or none)
+    std::string onionArg = GetArg("-onion", "");
+    if (onionArg != "") {
+        if (onionArg == "0") { // Handle -noonion/-onion=0
+            SetLimited(NET_TOR); // set onions as unreachable
+        } else {
+            proxyType addrOnion = proxyType(CService(onionArg, 9050), proxyRandomize);
+            if (!addrOnion.IsValid())
+                return InitError(strprintf(_("Invalid -onion address: '%s'"), onionArg));
+            SetProxy(NET_TOR, addrOnion);
+            SetLimited(NET_TOR, false);
+        }
+    }
+
+    // see Step 2: parameter interactions for more information about these
+    fListen = GetBoolArg("-listen", DEFAULT_LISTEN);
+    fDiscover = GetBoolArg("-discover", true);
+    fNameLookup = GetBoolArg("-dns", DEFAULT_NAME_LOOKUP);
+
+    bool fBound = false;
+    if (fListen) {
+        if (mapArgs.count("-bind") || mapArgs.count("-whitebind")) {
+            for (const std::string& strBind : mapMultiArgs["-bind"]) {
+                CService addrBind;
+                if (!Lookup(strBind.c_str(), addrBind, GetListenPort(), false))
+                    return InitError(strprintf(_("Cannot resolve -bind address: '%s'"), strBind));
+                fBound |= Bind(addrBind, (BF_EXPLICIT | BF_REPORT_ERROR));
+            }
+            for (const std::string& strBind : mapMultiArgs["-whitebind"]) {
+                CService addrBind;
+                if (!Lookup(strBind.c_str(), addrBind, 0, false))
+                    return InitError(strprintf(_("Cannot resolve -whitebind address: '%s'"), strBind));
+                if (addrBind.GetPort() == 0)
+                    return InitError(strprintf(_("Need to specify a port with -whitebind: '%s'"), strBind));
+                fBound |= Bind(addrBind, (BF_EXPLICIT | BF_REPORT_ERROR | BF_WHITELIST));
+            }
+        }
+        else {
+            struct in_addr inaddr_any;
+            inaddr_any.s_addr = INADDR_ANY;
+            fBound |= Bind(CService(in6addr_any, GetListenPort()), BF_NONE);
+            fBound |= Bind(CService(inaddr_any, GetListenPort()), !fBound ? BF_REPORT_ERROR : BF_NONE);
+        }
+        if (!fBound)
+            return InitError(_("Failed to listen on any port. Use -listen=0 if you want this."));
+    }
+
+    if (mapArgs.count("-externalip")) {
+        for (const std::string& strAddr : mapMultiArgs["-externalip"]) {
+            CService addrLocal(strAddr, GetListenPort(), fNameLookup);
+            if (!addrLocal.IsValid())
+                return InitError(strprintf(_("Cannot resolve -externalip address: '%s'"), strAddr));
+            AddLocal(CService(strAddr, GetListenPort(), fNameLookup), LOCAL_MANUAL);
+        }
+    }
+
+    for (const std::string& strDest : mapMultiArgs["-seednode"])
+        AddOneShot(strDest);
+
+#if ENABLE_ZMQ
+    pzmqNotificationInterface = CZMQNotificationInterface::CreateWithArguments(mapArgs);
+
+    if (pzmqNotificationInterface) {
+        RegisterValidationInterface(pzmqNotificationInterface);
+    }
+#endif
+    if (mapArgs.count("-maxuploadtarget")) {
+        CNode::SetMaxOutboundTarget(
+            chainparams.GetConsensus().nPostBlossomPowTargetSpacing,
+            GetArg("-maxuploadtarget", DEFAULT_MAX_UPLOAD_TARGET)*1024*1024);
+    }
+
+    // ********************************************************* Step 7: load block chain
+
+    fReindex = GetBoolArg("-reindex", false);
+    bool fReindexChainState = GetBoolArg("-reindex-chainstate", false);
+
+    fs::create_directories(GetDataDir() / "blocks");
+
+    // cache size calculations
+    int64_t nTotalCache = (GetArg("-dbcache", nDefaultDbCache) << 20);
+    nTotalCache = std::max(nTotalCache, nMinDbCache << 20); // total cache cannot be less than nMinDbCache
+    nTotalCache = std::min(nTotalCache, nMaxDbCache << 20); // total cache cannot be greater than nMaxDbcache
+    int64_t nBlockTreeDBCache = nTotalCache / 8;
+    if (nBlockTreeDBCache > (1 << 21) && !GetBoolArg("-txindex", DEFAULT_TXINDEX))
+        nBlockTreeDBCache = (1 << 21); // block tree db cache shouldn't be larger than 2 MiB
+
+    // https://github.com/bitpay/bitcoin/commit/c91d78b578a8700a45be936cb5bb0931df8f4b87#diff-c865a8939105e6350a50af02766291b7R1233
+    if (GetBoolArg("-insightexplorer", false)) {
+        if (!GetBoolArg("-txindex", false)) {
+            return InitError(_("-insightexplorer requires -txindex."));
+        }
+        // increase cache if additional indices are needed
+        nBlockTreeDBCache = nTotalCache * 3 / 4;
+    }
+    nTotalCache -= nBlockTreeDBCache;
+    int64_t nCoinDBCache = std::min(nTotalCache / 2, (nTotalCache / 4) + (1 << 23)); // use 25%-50% of the remainder for disk cache
+    nTotalCache -= nCoinDBCache;
+    nCoinCacheUsage = nTotalCache; // the rest goes to in-memory cache
+    LogPrintf("Cache configuration:\n");
+    LogPrintf("* Using %.1fMiB for block index database\n", nBlockTreeDBCache * (1.0 / 1024 / 1024));
+    LogPrintf("* Using %.1fMiB for chain state database\n", nCoinDBCache * (1.0 / 1024 / 1024));
+    LogPrintf("* Using %.1fMiB for in-memory UTXO set\n", nCoinCacheUsage * (1.0 / 1024 / 1024));
+
+    bool clearWitnessCaches = false;
+
+    bool fLoaded = false;
+    while (!fLoaded) {
+        bool fReset = fReindex;
+        std::string strLoadError;
+
+        uiInterface.InitMessage(_("Loading block index..."));
+
+        nStart = GetTimeMillis();
+        do {
+            try {
+                UnloadBlockIndex();
+                delete pcoinsTip;
+                delete pcoinsdbview;
+                delete pcoinscatcher;
+                delete pblocktree;
+
+                pblocktree = new CBlockTreeDB(nBlockTreeDBCache, false, fReindex);
+                pcoinsdbview = new CCoinsViewDB(nCoinDBCache, false, fReindex || fReindexChainState);
+                pcoinscatcher = new CCoinsViewErrorCatcher(pcoinsdbview);
+                pcoinsTip = new CCoinsViewCache(pcoinscatcher);
+
+                if (fReindex) {
+                    pblocktree->WriteReindexing(true);
+                    //If we're reindexing in prune mode, wipe away unusable block files and all undo data files
+                    if (fPruneMode)
+                        CleanupBlockRevFiles();
+                }
+
+                if (!LoadBlockIndex()) {
+                    strLoadError = _("Error loading block database");
+                    break;
+                }
+
+                // If the loaded chain has a wrong genesis, bail out immediately
+                // (we're likely using a testnet datadir, or the other way around).
+                if (!mapBlockIndex.empty() && mapBlockIndex.count(chainparams.GetConsensus().hashGenesisBlock) == 0)
+                    return InitError(_("Incorrect or no genesis block found. Wrong datadir for network?"));
+
+                // Initialize the block index (no-op if non-empty database was already loaded)
+                if (!InitBlockIndex(chainparams)) {
+                    strLoadError = _("Error initializing block database");
+                    break;
+                }
+
+                // Check for changed -txindex state
+                if (fTxIndex != GetBoolArg("-txindex", DEFAULT_TXINDEX)) {
+                    strLoadError = _("You need to rebuild the database using -reindex-chainstate to change -txindex");
+                    break;
+                }
+
+                // Check for changed -insightexplorer state
+                bool fInsightExplorerPreviouslySet = false;
+                pblocktree->ReadFlag("insightexplorer", fInsightExplorerPreviouslySet);
+                if (fExperimentalInsightExplorer != fInsightExplorerPreviouslySet) {
+                    strLoadError = _("You need to rebuild the database using -reindex to change -insightexplorer");
+                    break;
+                }
+
+                // Check for changed -lightwalletd state
+                bool fLightWalletdPreviouslySet = false;
+                pblocktree->ReadFlag("lightwalletd", fLightWalletdPreviouslySet);
+                if (fExperimentalLightWalletd != fLightWalletdPreviouslySet) {
+                    strLoadError = _("You need to rebuild the database using -reindex to change -lightwalletd");
+                    break;
+                }
+
+                // Check for changed -prune state.  What we are concerned about is a user who has pruned blocks
+                // in the past, but is now trying to run unpruned.
+                if (fHavePruned && !fPruneMode) {
+                    strLoadError = _("You need to rebuild the database using -reindex to go back to unpruned mode.  This will redownload the entire blockchain");
+                    break;
+                }
+
+                if (!fReindex) {
+                    uiInterface.InitMessage(_("Rewinding blocks if needed..."));
+                    if (!RewindBlockIndex(chainparams, clearWitnessCaches)) {
+                        strLoadError = _("Unable to rewind the database to a pre-upgrade state. You will need to redownload the blockchain");
+                        break;
+                    }
+                }
+
+                uiInterface.InitMessage(_("Verifying blocks..."));
+                if (fHavePruned && GetArg("-checkblocks", DEFAULT_CHECKBLOCKS) > MIN_BLOCKS_TO_KEEP) {
+                    LogPrintf("Prune: pruned datadir may not have more than %d blocks; -checkblocks=%d may fail\n",
+                        MIN_BLOCKS_TO_KEEP, GetArg("-checkblocks", DEFAULT_CHECKBLOCKS));
+                }
+
+                {
+                    LOCK(cs_main);
+                    CBlockIndex* tip = chainActive.Tip();
+                    if (tip && tip->nTime > GetTime() + 2 * 60 * 60) {
+                        strLoadError = _("The block database contains a block which appears to be from the future. "
+                                "This may be due to your computer's date and time being set incorrectly. "
+                                "Only rebuild the block database if you are sure that your computer's date and time are correct");
+                        break;
+                    }
+                }
+
+                if (!CVerifyDB().VerifyDB(chainparams, pcoinsdbview, GetArg("-checklevel", DEFAULT_CHECKLEVEL),
+                              GetArg("-checkblocks", DEFAULT_CHECKBLOCKS))) {
+                    strLoadError = _("Corrupted block database detected");
+                    break;
+                }
+            } catch (const std::exception& e) {
+                if (fDebug) LogPrintf("%s\n", e.what());
+                strLoadError = _("Error opening block database");
+                break;
+            }
+
+            fLoaded = true;
+        } while(false);
+
+        if (!fLoaded) {
+            // first suggest a reindex
+            if (!fReset) {
+                bool fRet = uiInterface.ThreadSafeQuestion(
+                    strLoadError + ".\n\n" + _("Do you want to rebuild the block database now?"),
+                    strLoadError + ".\nPlease restart with -reindex or -reindex-chainstate to recover.",
+                    "", CClientUIInterface::MSG_ERROR | CClientUIInterface::BTN_ABORT);
+                if (fRet) {
+                    fReindex = true;
+                    fRequestShutdown = false;
+                } else {
+                    LogPrintf("Aborted block database rebuild. Exiting.\n");
+                    return false;
+                }
+            } else {
+                return InitError(strLoadError);
+            }
+        }
+    }
+
+    // As LoadBlockIndex can take several minutes, it's possible the user
+    // requested to kill the GUI during the last operation. If so, exit.
+    // As the program has not fully started yet, Shutdown() is possibly overkill.
+    if (fRequestShutdown)
+    {
+        LogPrintf("Shutdown requested. Exiting.\n");
+        return false;
+    }
+    LogPrintf(" block index %15dms\n", GetTimeMillis() - nStart);
+
+    fs::path est_path = GetDataDir() / FEE_ESTIMATES_FILENAME;
+    CAutoFile est_filein(fsbridge::fopen(est_path, "rb"), SER_DISK, CLIENT_VERSION);
+    // Allowed to fail as this file IS missing on first startup.
+    if (!est_filein.IsNull())
+        mempool.ReadFeeEstimates(est_filein);
+    fFeeEstimatesInitialized = true;
+
+
+    // ********************************************************* Step 8: load wallet
+#ifdef ENABLE_WALLET
+    if (fDisableWallet) {
+        pwalletMain = NULL;
+        LogPrintf("Wallet disabled!\n");
+    } else {
+        CWallet::InitLoadWallet(chainparams, clearWitnessCaches);
+        if (!pwalletMain)
+            return false;
+    }
+#else // ENABLE_WALLET
+    LogPrintf("No wallet support compiled in!\n");
+#endif // !ENABLE_WALLET
+
+#ifdef ENABLE_MINING
+ #ifndef ENABLE_WALLET
+    if (GetBoolArg("-minetolocalwallet", false)) {
+        return InitError(_("Zcash was not built with wallet support. Set -minetolocalwallet=0 to use -mineraddress, or rebuild Zcash with wallet support."));
+    }
+    if (GetArg("-mineraddress", "").empty() && GetBoolArg("-gen", false)) {
+        return InitError(_("Zcash was not built with wallet support. Set -mineraddress, or rebuild Zcash with wallet support."));
+    }
+ #endif // !ENABLE_WALLET
+
+    if (mapArgs.count("-mineraddress")) {
+ #ifdef ENABLE_WALLET
+        bool minerAddressInLocalWallet = false;
+        if (pwalletMain) {
+            auto zaddr = keyIO.DecodePaymentAddress(mapArgs["-mineraddress"]);
+            if (!zaddr.has_value()) {
+                return InitError(_("-mineraddress is not a valid " PACKAGE_NAME " address."));
+            }
+            auto ztxoSelector = pwalletMain->ZTXOSelectorForAddress(zaddr.value(), true, false);
+            minerAddressInLocalWallet = ztxoSelector.has_value();
+        }
+        if (GetBoolArg("-minetolocalwallet", true) && !minerAddressInLocalWallet) {
+            return InitError(_("-mineraddress is not in the local wallet. Either use a local address, or set -minetolocalwallet=0"));
+        }
+ #endif // ENABLE_WALLET
+
+        // This is leveraging the fact that boost::signals2 executes connected
+        // handlers in-order. Further up, the wallet is connected to this signal
+        // if the wallet is enabled. The wallet's AddressForMining handler does
+        // nothing if -mineraddress is set, and GetMinerAddress() does nothing
+        // if -mineraddress is not set (or set to an address that is not valid
+        // for mining).
+        //
+        // The upshot is that when AddressForMining(address) is called:
+        // - If -mineraddress is set (whether or not the wallet is enabled), the
+        //   argument is set to -mineraddress.
+        // - If the wallet is enabled and -mineraddress is not set, the argument
+        //   is set to a wallet address.
+        // - If the wallet is disabled and -mineraddress is not set, the
+        //   argument is not modified; in practice this means it is empty, and
+        //   GenerateBitcoins() returns an error.
+        GetMainSignals().AddressForMining.connect(GetMinerAddress);
+    }
+#endif // ENABLE_MINING
+
+    // Spawn a thread that will wait for the chain state needed for
+    // ThreadNotifyWallets to become available.
+    threadGroup.create_thread(
+        boost::bind(&TraceThread<void (*)()>, "txnotify", &ThreadStartWalletNotifier)
+    );
+
+    // ********************************************************* Step 9: data directory maintenance
+
+    // if pruning, unset the service bit and perform the initial blockstore prune
+    // after any wallet rescanning has taken place.
+    if (fPruneMode) {
+        LogPrintf("Unsetting NODE_NETWORK on prune mode\n");
+        nLocalServices &= ~NODE_NETWORK;
+        if (!fReindex) {
+            uiInterface.InitMessage(_("Pruning blockstore..."));
+            PruneAndFlush();
+        }
+    }
+
+    // ********************************************************* Step 10: import blocks
+
+    if (mapArgs.count("-blocknotify"))
+        uiInterface.NotifyBlockTip.connect(BlockNotifyCallback);
+
+    if (mapArgs.count("-txexpirynotify"))
+        uiInterface.NotifyTxExpiration.connect(TxExpiryNotifyCallback);
+
+    std::vector<fs::path> vImportFiles;
+    if (mapArgs.count("-loadblock"))
+    {
+        for (const std::string& strFile : mapMultiArgs["-loadblock"])
+            vImportFiles.push_back(strFile);
+    }
+    threadGroup.create_thread(boost::bind(&ThreadImport, vImportFiles, chainparams));
+
+    // Wait for genesis block to be processed
+    bool fHaveGenesis = false;
+    while (!fHaveGenesis && !fRequestShutdown) {
+        {
+            LOCK(cs_main);
+            fHaveGenesis = (chainActive.Tip() != NULL);
+        }
+
+        if (!fHaveGenesis) {
+            MilliSleep(10);
+        }
+    }
+    if (!fHaveGenesis) {
+        return false;
+    }
+
+    // ********************************************************* Step 11: start node
+
+    if (!CheckDiskSpace())
+        return false;
+
+    if (!strErrors.str().empty())
+        return InitError(strErrors.str());
+
+    //// debug print
+    {
+        LOCK(cs_main);
+        LogPrintf("mapBlockIndex.size() = %u\n", mapBlockIndex.size());
+        LogPrintf("nBestHeight = %d\n", chainActive.Height());
+    }
+#ifdef ENABLE_WALLET
+    if (pwalletMain)
+    {
+        LOCK(pwalletMain->cs_wallet);
+        LogPrintf("setKeyPool.size() = %u\n",      pwalletMain->setKeyPool.size());
+        LogPrintf("mapWallet.size() = %u\n",       pwalletMain->mapWallet.size());
+        LogPrintf("mapAddressBook.size() = %u\n",  pwalletMain->mapAddressBook.size());
+    }
+#endif
+
+    if (GetBoolArg("-listenonion", DEFAULT_LISTEN_ONION))
+        StartTorControl(threadGroup, scheduler);
+
+    StartNode(threadGroup, scheduler);
+
+#ifdef ENABLE_MINING
+    // Generate coins in the background
+    GenerateBitcoins(GetBoolArg("-gen", DEFAULT_GENERATE), GetArg("-genproclimit", DEFAULT_GENERATE_THREADS), chainparams);
+#endif
+
+    // ********************************************************* Step 12: finished
+
+    SetRPCWarmupFinished();
+    uiInterface.InitMessage(_("Done loading"));
+
+#ifdef ENABLE_WALLET
+    if (pwalletMain) {
+        // Add wallet transactions that aren't already in a block to mapTransactions
+        pwalletMain->ReacceptWalletTransactions();
+
+        // Run a thread to flush wallet periodically
+        threadGroup.create_thread(boost::bind(&ThreadFlushWalletDB, boost::ref(pwalletMain->strWalletFile)));
+    }
+#endif
+
+    // SENDALERT
+    threadGroup.create_thread(boost::bind(ThreadSendAlert));
+
+    return !fRequestShutdown;
+}
diff --git a/depend/zcash/src/init.h b/depend/zcash/src/init.h
new file mode 100644
index 000000000..552d402ad
--- /dev/null
+++ b/depend/zcash/src/init.h
@@ -0,0 +1,42 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_INIT_H
+#define BITCOIN_INIT_H
+
+#include <string>
+
+#include <tracing.h>
+
+class CScheduler;
+class CWallet;
+
+namespace boost
+{
+class thread_group;
+} // namespace boost
+
+extern TracingHandle* pTracingHandle;
+
+void StartShutdown();
+bool ShutdownRequested();
+/** Interrupt threads */
+void Interrupt(boost::thread_group& threadGroup);
+void Shutdown();
+//!Initialize the logging infrastructure
+void InitLogging();
+//!Parameter interaction: change current parameters depending on various rules
+void InitParameterInteraction();
+bool AppInit2(boost::thread_group& threadGroup, CScheduler& scheduler);
+
+/** The help message mode determines what help message to show */
+enum HelpMessageMode {
+    HMM_BITCOIND
+};
+
+/** Help for options shared between UI and daemon (for -help) */
+std::string HelpMessage(HelpMessageMode mode);
+
+#endif // BITCOIN_INIT_H
diff --git a/depend/zcash/src/key.cpp b/depend/zcash/src/key.cpp
new file mode 100644
index 000000000..cb4aa8343
--- /dev/null
+++ b/depend/zcash/src/key.cpp
@@ -0,0 +1,370 @@
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Copyright (c) 2017 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "key.h"
+
+#include "arith_uint256.h"
+#include "crypto/common.h"
+#include "crypto/hmac_sha512.h"
+#include "pubkey.h"
+#include "random.h"
+
+#include <secp256k1.h>
+#include <secp256k1_recovery.h>
+
+static secp256k1_context* secp256k1_context_sign = NULL;
+
+/** These functions are taken from the libsecp256k1 distribution and are very ugly. */
+
+/**
+ * This parses a format loosely based on a DER encoding of the ECPrivateKey type from
+ * section C.4 of SEC 1 <https://www.secg.org/sec1-v2.pdf>, with the following caveats:
+ *
+ * * The octet-length of the SEQUENCE must be encoded as 1 or 2 octets. It is not
+ *   required to be encoded as one octet if it is less than 256, as DER would require.
+ * * The octet-length of the SEQUENCE must not be greater than the remaining
+ *   length of the key encoding, but need not match it (i.e. the encoding may contain
+ *   junk after the encoded SEQUENCE).
+ * * The privateKey OCTET STRING is zero-filled on the left to 32 octets.
+ * * Anything after the encoding of the privateKey OCTET STRING is ignored, whether
+ *   or not it is validly encoded DER.
+ *
+ * out32 must point to an output buffer of length at least 32 bytes.
+ */
+static int ec_privkey_import_der(const secp256k1_context* ctx, unsigned char *out32, const unsigned char *privkey, size_t privkeylen) {
+    const unsigned char *end = privkey + privkeylen;
+    memset(out32, 0, 32);
+    /* sequence header */
+    if (end - privkey < 1 || *privkey != 0x30u) {
+        return 0;
+    }
+    privkey++;
+    /* sequence length constructor */
+    if (end - privkey < 1 || !(*privkey & 0x80u)) {
+        return 0;
+    }
+    size_t lenb = *privkey & ~0x80u; privkey++;
+    if (lenb < 1 || lenb > 2) {
+        return 0;
+    }
+    if (end - privkey < lenb) {
+        return 0;
+    }
+    /* sequence length */
+    size_t len = privkey[lenb-1] | (lenb > 1 ? privkey[lenb-2] << 8 : 0u);
+    privkey += lenb;
+    if (end - privkey < len) {
+        return 0;
+    }
+    /* sequence element 0: version number (=1) */
+    if (end - privkey < 3 || privkey[0] != 0x02u || privkey[1] != 0x01u || privkey[2] != 0x01u) {
+        return 0;
+    }
+    privkey += 3;
+    /* sequence element 1: octet string, up to 32 bytes */
+    if (end - privkey < 2 || privkey[0] != 0x04u) {
+        return 0;
+    }
+    size_t oslen = privkey[1];
+    privkey += 2;
+    if (oslen > 32 || end - privkey < oslen) {
+        return 0;
+    }
+    memcpy(out32 + (32 - oslen), privkey, oslen);
+    if (!secp256k1_ec_seckey_verify(ctx, out32)) {
+        memset(out32, 0, 32);
+        return 0;
+    }
+    return 1;
+}
+
+/**
+ * This serializes to a DER encoding of the ECPrivateKey type from section C.4 of SEC 1
+ * <https://www.secg.org/sec1-v2.pdf>. The optional parameters and publicKey fields are
+ * included.
+ *
+ * privkey must point to an output buffer of length at least CKey::PRIVATE_KEY_SIZE bytes.
+ * privkeylen must initially be set to the size of the privkey buffer. Upon return it
+ * will be set to the number of bytes used in the buffer.
+ * key32 must point to a 32-byte raw private key.
+ */
+static int ec_privkey_export_der(const secp256k1_context *ctx, unsigned char *privkey, size_t *privkeylen, const unsigned char *key32, int compressed) {
+    assert(*privkeylen >= CKey::PRIVATE_KEY_SIZE);
+    secp256k1_pubkey pubkey;
+    size_t pubkeylen = 0;
+    if (!secp256k1_ec_pubkey_create(ctx, &pubkey, key32)) {
+        *privkeylen = 0;
+        return 0;
+    }
+    if (compressed) {
+        static const unsigned char begin[] = {
+            0x30,0x81,0xD3,0x02,0x01,0x01,0x04,0x20
+        };
+        static const unsigned char middle[] = {
+            0xA0,0x81,0x85,0x30,0x81,0x82,0x02,0x01,0x01,0x30,0x2C,0x06,0x07,0x2A,0x86,0x48,
+            0xCE,0x3D,0x01,0x01,0x02,0x21,0x00,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
+            0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
+            0xFF,0xFF,0xFE,0xFF,0xFF,0xFC,0x2F,0x30,0x06,0x04,0x01,0x00,0x04,0x01,0x07,0x04,
+            0x21,0x02,0x79,0xBE,0x66,0x7E,0xF9,0xDC,0xBB,0xAC,0x55,0xA0,0x62,0x95,0xCE,0x87,
+            0x0B,0x07,0x02,0x9B,0xFC,0xDB,0x2D,0xCE,0x28,0xD9,0x59,0xF2,0x81,0x5B,0x16,0xF8,
+            0x17,0x98,0x02,0x21,0x00,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
+            0xFF,0xFF,0xFF,0xFF,0xFE,0xBA,0xAE,0xDC,0xE6,0xAF,0x48,0xA0,0x3B,0xBF,0xD2,0x5E,
+            0x8C,0xD0,0x36,0x41,0x41,0x02,0x01,0x01,0xA1,0x24,0x03,0x22,0x00
+        };
+        unsigned char *ptr = privkey;
+        memcpy(ptr, begin, sizeof(begin)); ptr += sizeof(begin);
+        memcpy(ptr, key32, 32); ptr += 32;
+        memcpy(ptr, middle, sizeof(middle)); ptr += sizeof(middle);
+        pubkeylen = CPubKey::COMPRESSED_PUBLIC_KEY_SIZE;
+        secp256k1_ec_pubkey_serialize(ctx, ptr, &pubkeylen, &pubkey, SECP256K1_EC_COMPRESSED);
+        ptr += pubkeylen;
+        *privkeylen = ptr - privkey;
+        assert(*privkeylen == CKey::COMPRESSED_PRIVATE_KEY_SIZE);
+    } else {
+        static const unsigned char begin[] = {
+            0x30,0x82,0x01,0x13,0x02,0x01,0x01,0x04,0x20
+        };
+        static const unsigned char middle[] = {
+            0xA0,0x81,0xA5,0x30,0x81,0xA2,0x02,0x01,0x01,0x30,0x2C,0x06,0x07,0x2A,0x86,0x48,
+            0xCE,0x3D,0x01,0x01,0x02,0x21,0x00,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
+            0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
+            0xFF,0xFF,0xFE,0xFF,0xFF,0xFC,0x2F,0x30,0x06,0x04,0x01,0x00,0x04,0x01,0x07,0x04,
+            0x41,0x04,0x79,0xBE,0x66,0x7E,0xF9,0xDC,0xBB,0xAC,0x55,0xA0,0x62,0x95,0xCE,0x87,
+            0x0B,0x07,0x02,0x9B,0xFC,0xDB,0x2D,0xCE,0x28,0xD9,0x59,0xF2,0x81,0x5B,0x16,0xF8,
+            0x17,0x98,0x48,0x3A,0xDA,0x77,0x26,0xA3,0xC4,0x65,0x5D,0xA4,0xFB,0xFC,0x0E,0x11,
+            0x08,0xA8,0xFD,0x17,0xB4,0x48,0xA6,0x85,0x54,0x19,0x9C,0x47,0xD0,0x8F,0xFB,0x10,
+            0xD4,0xB8,0x02,0x21,0x00,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
+            0xFF,0xFF,0xFF,0xFF,0xFE,0xBA,0xAE,0xDC,0xE6,0xAF,0x48,0xA0,0x3B,0xBF,0xD2,0x5E,
+            0x8C,0xD0,0x36,0x41,0x41,0x02,0x01,0x01,0xA1,0x44,0x03,0x42,0x00
+        };
+        unsigned char *ptr = privkey;
+        memcpy(ptr, begin, sizeof(begin)); ptr += sizeof(begin);
+        memcpy(ptr, key32, 32); ptr += 32;
+        memcpy(ptr, middle, sizeof(middle)); ptr += sizeof(middle);
+        pubkeylen = CPubKey::PUBLIC_KEY_SIZE;
+        secp256k1_ec_pubkey_serialize(ctx, ptr, &pubkeylen, &pubkey, SECP256K1_EC_UNCOMPRESSED);
+        ptr += pubkeylen;
+        *privkeylen = ptr - privkey;
+        assert(*privkeylen == CKey::PRIVATE_KEY_SIZE);
+    }
+    return 1;
+}
+
+bool CKey::Check(const unsigned char *vch) {
+    return secp256k1_ec_seckey_verify(secp256k1_context_sign, vch);
+}
+
+CKey CKey::TestOnlyRandomKey(bool fCompressedIn) {
+    CKey key;
+    do {
+        GetRandBytes(key.keydata.data(), key.keydata.size());
+    } while (!Check(key.keydata.data()));
+    key.fValid = true;
+    key.fCompressed = fCompressedIn;
+    return key;
+}
+
+std::optional<CKey> CKey::FromPrivKey(const CPrivKey &privkey, bool fCompressedIn) {
+    CKey key;
+    if (!ec_privkey_import_der(secp256k1_context_sign, (unsigned char*)key.begin(), &privkey[0], privkey.size()))
+        return std::nullopt;
+    key.fCompressed = fCompressedIn;
+    key.fValid = true;
+    return key;
+}
+
+CPrivKey CKey::GetPrivKey() const {
+    assert(fValid);
+    CPrivKey privkey;
+    int ret;
+    size_t privkeylen;
+    privkey.resize(PRIVATE_KEY_SIZE);
+    privkeylen = PRIVATE_KEY_SIZE;
+    ret = ec_privkey_export_der(secp256k1_context_sign, privkey.data(), &privkeylen, begin(), fCompressed ? SECP256K1_EC_COMPRESSED : SECP256K1_EC_UNCOMPRESSED);
+    assert(ret);
+    privkey.resize(privkeylen);
+    return privkey;
+}
+
+CPubKey CKey::GetPubKey() const {
+    assert(fValid);
+    secp256k1_pubkey pubkey;
+    size_t clen = CPubKey::PUBLIC_KEY_SIZE;
+    CPubKey result;
+    int ret = secp256k1_ec_pubkey_create(secp256k1_context_sign, &pubkey, begin());
+    assert(ret);
+    secp256k1_ec_pubkey_serialize(secp256k1_context_sign, (unsigned char*)result.begin(), &clen, &pubkey, fCompressed ? SECP256K1_EC_COMPRESSED : SECP256K1_EC_UNCOMPRESSED);
+    assert(result.size() == clen);
+    assert(result.IsValid());
+    return result;
+}
+
+bool CKey::Sign(const uint256 &hash, std::vector<unsigned char>& vchSig, uint32_t test_case) const {
+    if (!fValid)
+        return false;
+    vchSig.resize(CPubKey::SIGNATURE_SIZE);
+    size_t nSigLen = CPubKey::SIGNATURE_SIZE;
+    unsigned char extra_entropy[32] = {0};
+    WriteLE32(extra_entropy, test_case);
+    secp256k1_ecdsa_signature sig;
+    int ret = secp256k1_ecdsa_sign(secp256k1_context_sign, &sig, hash.begin(), begin(), secp256k1_nonce_function_rfc6979, test_case ? extra_entropy : NULL);
+    assert(ret);
+    secp256k1_ecdsa_signature_serialize_der(secp256k1_context_sign, vchSig.data(), &nSigLen, &sig);
+    vchSig.resize(nSigLen);
+    return true;
+}
+
+bool CKey::VerifyPubKey(const CPubKey& pubkey) const {
+    if (pubkey.IsCompressed() != fCompressed) {
+        return false;
+    }
+    unsigned char rnd[8];
+    std::string str = "Zcash key verification\n";
+    GetRandBytes(rnd, sizeof(rnd));
+    uint256 hash;
+    CHash256().Write((unsigned char*)str.data(), str.size()).Write(rnd, sizeof(rnd)).Finalize(hash.begin());
+    std::vector<unsigned char> vchSig;
+    Sign(hash, vchSig);
+    return pubkey.Verify(hash, vchSig);
+}
+
+bool CKey::SignCompact(const uint256 &hash, std::vector<unsigned char>& vchSig) const {
+    if (!fValid)
+        return false;
+    vchSig.resize(CPubKey::COMPACT_SIGNATURE_SIZE);
+    int rec = -1;
+    secp256k1_ecdsa_recoverable_signature sig;
+    int ret = secp256k1_ecdsa_sign_recoverable(secp256k1_context_sign, &sig, hash.begin(), begin(), secp256k1_nonce_function_rfc6979, NULL);
+    assert(ret);
+    secp256k1_ecdsa_recoverable_signature_serialize_compact(secp256k1_context_sign, &vchSig[1], &rec, &sig);
+    assert(ret);
+    assert(rec != -1);
+    vchSig[0] = 27 + rec + (fCompressed ? 4 : 0);
+    return true;
+}
+
+bool CKey::Load(CPrivKey &privkey, CPubKey &vchPubKey, bool fSkipCheck=false) {
+    if (!ec_privkey_import_der(secp256k1_context_sign, (unsigned char*)begin(), privkey.data(), privkey.size()))
+        return false;
+    fCompressed = vchPubKey.IsCompressed();
+    fValid = true;
+
+    if (fSkipCheck)
+        return true;
+
+    return VerifyPubKey(vchPubKey);
+}
+
+bool CKey::Derive(CKey& keyChild, ChainCode &ccChild, unsigned int nChild, const ChainCode& cc) const {
+    assert(IsValid());
+    assert(IsCompressed());
+    std::vector<unsigned char, secure_allocator<unsigned char>> vout(64);
+    if ((nChild >> 31) == 0) {
+        CPubKey pubkey = GetPubKey();
+        assert(pubkey.size() == CPubKey::COMPRESSED_PUBLIC_KEY_SIZE);
+        BIP32Hash(cc, nChild, *pubkey.begin(), pubkey.begin()+1, vout.data());
+    } else {
+        assert(size() == 32);
+        BIP32Hash(cc, nChild, 0, begin(), vout.data());
+    }
+    memcpy(ccChild.begin(), vout.data()+32, 32);
+    memcpy((unsigned char*)keyChild.begin(), begin(), 32);
+    bool ret = secp256k1_ec_privkey_tweak_add(secp256k1_context_sign, (unsigned char*)keyChild.begin(), vout.data());
+    keyChild.fCompressed = true;
+    keyChild.fValid = ret;
+    return ret;
+}
+
+std::optional<CExtKey> CExtKey::Derive(unsigned int _nChild) const {
+    CExtKey out;
+    out.nDepth = nDepth + 1;
+    CKeyID id = key.GetPubKey().GetID();
+    memcpy(&out.vchFingerprint[0], &id, 4);
+    out.nChild = _nChild;
+    if (key.Derive(out.key, out.chaincode, _nChild, chaincode)) {
+        return out;
+    } else {
+        return std::nullopt;
+    }
+}
+
+std::optional<CExtKey> CExtKey::Master(const unsigned char *seed, unsigned int nSeedLen) {
+    CExtKey xk;
+    static const unsigned char hashkey[] = {'B','i','t','c','o','i','n',' ','s','e','e','d'};
+    std::vector<unsigned char, secure_allocator<unsigned char>> vout(64);
+    CHMAC_SHA512(hashkey, sizeof(hashkey)).Write(seed, nSeedLen).Finalize(vout.data());
+    xk.key.Set(vout.data(), vout.data() + 32, true);
+    memcpy(xk.chaincode.begin(), vout.data() + 32, 32);
+    xk.nDepth = 0;
+    xk.nChild = 0;
+    memset(xk.vchFingerprint, 0, sizeof(xk.vchFingerprint));
+
+    if (xk.key.IsValid()) {
+        return xk;
+    } else {
+        return std::nullopt;
+    }
+}
+
+CExtPubKey CExtKey::Neuter() const {
+    CExtPubKey ret;
+    ret.nDepth = nDepth;
+    memcpy(&ret.vchFingerprint[0], &vchFingerprint[0], 4);
+    ret.nChild = nChild;
+    ret.pubkey = key.GetPubKey();
+    ret.chaincode = chaincode;
+    return ret;
+}
+
+void CExtKey::Encode(unsigned char code[BIP32_EXTKEY_SIZE]) const {
+    code[0] = nDepth;
+    memcpy(code+1, vchFingerprint, 4);
+    code[5] = (nChild >> 24) & 0xFF; code[6] = (nChild >> 16) & 0xFF;
+    code[7] = (nChild >>  8) & 0xFF; code[8] = (nChild >>  0) & 0xFF;
+    memcpy(code+9, chaincode.begin(), 32);
+    code[41] = 0;
+    assert(key.size() == 32);
+    memcpy(code+42, key.begin(), 32);
+}
+
+void CExtKey::Decode(const unsigned char code[BIP32_EXTKEY_SIZE]) {
+    nDepth = code[0];
+    memcpy(vchFingerprint, code+1, 4);
+    nChild = (code[5] << 24) | (code[6] << 16) | (code[7] << 8) | code[8];
+    memcpy(chaincode.begin(), code+9, 32);
+    key.Set(code+42, code+BIP32_EXTKEY_SIZE, true);
+}
+
+bool CKey::ECC_InitSanityCheck() {
+    CKey key = CKey::TestOnlyRandomKey(true);
+    CPubKey pubkey = key.GetPubKey();
+    return key.VerifyPubKey(pubkey);
+}
+
+void ECC_Start() {
+    assert(secp256k1_context_sign == NULL);
+
+    secp256k1_context *ctx = secp256k1_context_create(SECP256K1_CONTEXT_SIGN);
+    assert(ctx != NULL);
+
+    {
+        // Pass in a random blinding seed to the secp256k1 context.
+        std::vector<unsigned char, secure_allocator<unsigned char>> vseed(32);
+        GetRandBytes(vseed.data(), 32);
+        bool ret = secp256k1_context_randomize(ctx, vseed.data());
+        assert(ret);
+    }
+
+    secp256k1_context_sign = ctx;
+}
+
+void ECC_Stop() {
+    secp256k1_context *ctx = secp256k1_context_sign;
+    secp256k1_context_sign = NULL;
+
+    if (ctx) {
+        secp256k1_context_destroy(ctx);
+    }
+}
diff --git a/depend/zcash/src/key.h b/depend/zcash/src/key.h
new file mode 100644
index 000000000..0122ec9fa
--- /dev/null
+++ b/depend/zcash/src/key.h
@@ -0,0 +1,201 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Copyright (c) 2017 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_KEY_H
+#define BITCOIN_KEY_H
+
+#include "pubkey.h"
+#include "serialize.h"
+#include "support/allocators/secure.h"
+#include "uint256.h"
+
+#include <stdexcept>
+#include <vector>
+
+/**
+ * secure_allocator is defined in allocators.h
+ * CPrivKey is a serialized private key, with all parameters included
+ * (PRIVATE_KEY_SIZE bytes)
+ */
+typedef std::vector<unsigned char, secure_allocator<unsigned char> > CPrivKey;
+
+/** An encapsulated private key. */
+class CKey
+{
+public:
+    /**
+     * secp256k1:
+     */
+    static const unsigned int PRIVATE_KEY_SIZE            = 279;
+    static const unsigned int COMPRESSED_PRIVATE_KEY_SIZE = 214;
+    /**
+     * see www.keylength.com
+     * script supports up to 75 for single byte push
+     */
+    static_assert(
+        PRIVATE_KEY_SIZE >= COMPRESSED_PRIVATE_KEY_SIZE,
+        "COMPRESSED_PRIVATE_KEY_SIZE is larger than PRIVATE_KEY_SIZE");
+
+private:
+    //! Whether this private key is valid. We check for correctness when modifying the key
+    //! data, so fValid should always correspond to the actual state.
+    bool fValid;
+
+    //! Whether the public key corresponding to this private key is (to be) compressed.
+    bool fCompressed;
+
+    //! The actual byte data
+    std::vector<unsigned char, secure_allocator<unsigned char> > keydata;
+
+    //! Check whether the 32-byte array pointed to be vch is valid keydata.
+    bool static Check(const unsigned char* vch);
+
+public:
+    //! Construct an invalid private key.
+    CKey() : fValid(false), fCompressed(false)
+    {
+        // Important: vch must be 32 bytes in length to not break serialization
+        keydata.resize(32);
+    }
+
+    /**
+     * Construct a random key. This is used only for internal sanity checks;
+     * all keys that actually control live funds should be derived from the
+     * wallet's mnemonic seed.
+     */
+    static CKey TestOnlyRandomKey(bool fCompressedIn);
+
+    //! Initialize from a CPrivKey (serialized OpenSSL-format private key data).
+    static std::optional<CKey> FromPrivKey(const CPrivKey& vchPrivKey, bool fCompressed);
+
+    /** Check that required EC support is available at runtime. */
+    static bool ECC_InitSanityCheck();
+
+    friend bool operator==(const CKey& a, const CKey& b)
+    {
+        return a.fCompressed == b.fCompressed &&
+            a.size() == b.size() &&
+            memcmp(a.keydata.data(), b.keydata.data(), a.size()) == 0;
+    }
+
+    //! Initialize using begin and end iterators to byte data.
+    template <typename T>
+    void Set(const T pbegin, const T pend, bool fCompressedIn)
+    {
+        if (size_t(pend - pbegin) != keydata.size()) {
+            fValid = false;
+        } else if (Check(&pbegin[0])) {
+            memcpy(keydata.data(), (unsigned char*)&pbegin[0], keydata.size());
+            fValid = true;
+            fCompressed = fCompressedIn;
+        } else {
+            fValid = false;
+        }
+    }
+
+    //! Simple read-only vector-like interface.
+    unsigned int size() const { return (fValid ? keydata.size() : 0); }
+    const unsigned char* begin() const { return keydata.data(); }
+    const unsigned char* end() const { return keydata.data() + size(); }
+
+    //! Check whether this private key is valid.
+    bool IsValid() const { return fValid; }
+
+    //! Check whether the public key corresponding to this private key is (to be) compressed.
+    bool IsCompressed() const { return fCompressed; }
+
+    /**
+     * Convert the private key to a CPrivKey (serialized OpenSSL-format private key data).
+     * This is expensive.
+     */
+    CPrivKey GetPrivKey() const;
+
+    /**
+     * Compute the public key from a private key.
+     * This is expensive.
+     */
+    CPubKey GetPubKey() const;
+
+    /**
+     * Create a DER-serialized signature.
+     * The test_case parameter tweaks the deterministic nonce.
+     */
+    bool Sign(const uint256& hash, std::vector<unsigned char>& vchSig, uint32_t test_case = 0) const;
+
+    /**
+     * Create a compact signature (65 bytes), which allows reconstructing the used public key.
+     * The format is one header byte, followed by two times 32 bytes for the serialized r and s values.
+     * The header byte: 0x1B = first key with even y, 0x1C = first key with odd y,
+     *                  0x1D = second key with even y, 0x1E = second key with odd y,
+     *                  add 0x04 for compressed keys.
+     */
+    bool SignCompact(const uint256& hash, std::vector<unsigned char>& vchSig) const;
+
+    //! Derive BIP32 child key.
+    bool Derive(CKey& keyChild, ChainCode &ccChild, unsigned int nChild, const ChainCode& cc) const;
+
+    /**
+     * Verify thoroughly whether a private key and a public key match.
+     * This is done using a different mechanism than just regenerating it.
+     */
+    bool VerifyPubKey(const CPubKey& vchPubKey) const;
+
+    //! Load private key and check that public key matches.
+    bool Load(CPrivKey& privkey, CPubKey& vchPubKey, bool fSkipCheck);
+
+    //! Check whether an element of a signature (r or s) is valid.
+    static bool CheckSignatureElement(const unsigned char* vch, int len, bool half);
+};
+
+struct CExtKey {
+    unsigned char nDepth;
+    unsigned char vchFingerprint[4];
+    unsigned int nChild;
+    ChainCode chaincode;
+    CKey key;
+
+    friend bool operator==(const CExtKey& a, const CExtKey& b)
+    {
+        return a.nDepth == b.nDepth &&
+            memcmp(&a.vchFingerprint[0], &b.vchFingerprint[0], sizeof(vchFingerprint)) == 0 &&
+            a.nChild == b.nChild &&
+            a.chaincode == b.chaincode &&
+            a.key == b.key;
+    }
+
+    static std::optional<CExtKey> Master(const unsigned char* seed, unsigned int nSeedLen);
+
+    void Encode(unsigned char code[BIP32_EXTKEY_SIZE]) const;
+    void Decode(const unsigned char code[BIP32_EXTKEY_SIZE]);
+    std::optional<CExtKey> Derive(unsigned int nChild) const;
+    CExtPubKey Neuter() const;
+    template <typename Stream>
+    void Serialize(Stream& s) const
+    {
+        unsigned int len = BIP32_EXTKEY_SIZE;
+        ::WriteCompactSize(s, len);
+        unsigned char code[BIP32_EXTKEY_SIZE];
+        Encode(code);
+        s.write((const char *)&code[0], len);
+    }
+    template <typename Stream>
+    void Unserialize(Stream& s)
+    {
+        unsigned int len = ::ReadCompactSize(s);
+        unsigned char code[BIP32_EXTKEY_SIZE];
+        s.read((char *)&code[0], len);
+        Decode(code);
+    }
+};
+
+/** Initialize the elliptic curve support. May not be called twice without calling ECC_Stop first. */
+void ECC_Start(void);
+
+/** Deinitialize the elliptic curve support. No-op if ECC_Start wasn't called first. */
+void ECC_Stop(void);
+
+
+#endif // BITCOIN_KEY_H
diff --git a/depend/zcash/src/key_constants.h b/depend/zcash/src/key_constants.h
new file mode 100644
index 000000000..62a795c24
--- /dev/null
+++ b/depend/zcash/src/key_constants.h
@@ -0,0 +1,57 @@
+// Copyright (c) 2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_KEY_CONSTANTS_H
+#define ZCASH_KEY_CONSTANTS_H
+
+#include <string>
+#include <vector>
+
+class KeyConstants
+{
+public:
+    enum Base58Type {
+        PUBKEY_ADDRESS,
+        SCRIPT_ADDRESS,
+        SECRET_KEY,
+        EXT_PUBLIC_KEY,
+        EXT_SECRET_KEY,
+
+        ZCPAYMENT_ADDRESS,
+        ZCSPENDING_KEY,
+        ZCVIEWING_KEY,
+
+        MAX_BASE58_TYPES
+    };
+
+    enum Bech32Type {
+        SAPLING_PAYMENT_ADDRESS,
+        SAPLING_FULL_VIEWING_KEY,
+        SAPLING_INCOMING_VIEWING_KEY,
+        SAPLING_EXTENDED_SPEND_KEY,
+        SAPLING_EXTENDED_FVK,
+
+        MAX_BECH32_TYPES
+    };
+
+    virtual std::string NetworkIDString() const =0;
+    virtual uint32_t BIP44CoinType() const =0;
+    virtual const std::vector<unsigned char>& Base58Prefix(Base58Type type) const =0;
+    virtual const std::string& Bech32HRP(Bech32Type type) const =0;
+};
+
+class CBaseKeyConstants : public KeyConstants {
+public:
+    std::string strNetworkID;
+    uint32_t bip44CoinType;
+    std::vector<unsigned char> base58Prefixes[KeyConstants::MAX_BASE58_TYPES];
+    std::string bech32HRPs[KeyConstants::MAX_BECH32_TYPES];
+
+    std::string NetworkIDString() const { return strNetworkID; }
+    uint32_t BIP44CoinType() const { return bip44CoinType; }
+    const std::vector<unsigned char>& Base58Prefix(Base58Type type) const { return base58Prefixes[type]; }
+    const std::string& Bech32HRP(Bech32Type type) const { return bech32HRPs[type]; }
+};
+
+#endif // ZCASH_KEY_CONSTANTS_H
diff --git a/depend/zcash/src/key_io.cpp b/depend/zcash/src/key_io.cpp
new file mode 100644
index 000000000..7793b2835
--- /dev/null
+++ b/depend/zcash/src/key_io.cpp
@@ -0,0 +1,532 @@
+// Copyright (c) 2014-2016 The Bitcoin Core developers
+// Copyright (c) 2016-2018 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include <key_io.h>
+
+#include <base58.h>
+#include <bech32.h>
+#include <script/script.h>
+#include <utilstrencodings.h>
+
+#include <rust/address.h>
+
+#include <assert.h>
+#include <string.h>
+#include <algorithm>
+#include <variant>
+#include "util/match.h"
+
+namespace
+{
+class DestinationEncoder
+{
+private:
+    const KeyConstants& keyConstants;
+
+public:
+    DestinationEncoder(const KeyConstants& keyConstants) : keyConstants(keyConstants) {}
+
+    std::string operator()(const CKeyID& id) const
+    {
+        std::vector<unsigned char> data = keyConstants.Base58Prefix(KeyConstants::PUBKEY_ADDRESS);
+        data.insert(data.end(), id.begin(), id.end());
+        return EncodeBase58Check(data);
+    }
+
+    std::string operator()(const CScriptID& id) const
+    {
+        std::vector<unsigned char> data = keyConstants.Base58Prefix(KeyConstants::SCRIPT_ADDRESS);
+        data.insert(data.end(), id.begin(), id.end());
+        return EncodeBase58Check(data);
+    }
+
+    std::string operator()(const CNoDestination& no) const { return {}; }
+};
+
+static uint32_t GetTypecode(const void* ua, size_t index)
+{
+    return std::visit(
+        TypecodeForReceiver(),
+        reinterpret_cast<const libzcash::UnifiedAddress*>(ua)->GetReceiversAsParsed()[index]);
+}
+
+class DataLenForReceiver {
+public:
+    DataLenForReceiver() {}
+
+    size_t operator()(const libzcash::OrchardRawAddress &zaddr) const { return 43; }
+    size_t operator()(const libzcash::SaplingPaymentAddress &zaddr) const { return 43; }
+    size_t operator()(const CScriptID &p2sh) const { return 20; }
+    size_t operator()(const CKeyID &p2pkh) const { return 20; }
+    size_t operator()(const libzcash::UnknownReceiver &unknown) const { return unknown.data.size(); }
+};
+
+static size_t GetReceiverLen(const void* ua, size_t index)
+{
+    return std::visit(
+        DataLenForReceiver(),
+        reinterpret_cast<const libzcash::UnifiedAddress*>(ua)->GetReceiversAsParsed()[index]);
+}
+
+class CopyDataForReceiver {
+    unsigned char* data;
+    size_t length;
+
+public:
+    CopyDataForReceiver(unsigned char* data, size_t length) : data(data), length(length) {}
+
+    void operator()(const libzcash::OrchardRawAddress &zaddr) const {
+        CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+        ss << zaddr;
+        assert(length == ss.size());
+        memcpy(data, ss.data(), ss.size());
+    }
+
+    void operator()(const libzcash::SaplingPaymentAddress &zaddr) const {
+        CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+        ss << zaddr;
+        assert(length == ss.size());
+        memcpy(data, ss.data(), ss.size());
+    }
+
+    void operator()(const CScriptID &p2sh) const {
+        memcpy(data, p2sh.begin(), p2sh.size());
+    }
+
+    void operator()(const CKeyID &p2pkh) const {
+        memcpy(data, p2pkh.begin(), p2pkh.size());
+    }
+
+    void operator()(const libzcash::UnknownReceiver &unknown) const {
+        memcpy(data, unknown.data.data(), unknown.data.size());
+    }
+};
+
+/**
+ * `data` MUST be the correct length for the receiver at this index.
+ */
+static void GetReceiver(const void* ua, size_t index, unsigned char* data, size_t length)
+{
+    std::visit(
+        CopyDataForReceiver(data, length),
+        reinterpret_cast<const libzcash::UnifiedAddress*>(ua)->GetReceiversAsParsed()[index]);
+}
+
+class PaymentAddressEncoder
+{
+private:
+    const KeyConstants& keyConstants;
+
+public:
+    PaymentAddressEncoder(const KeyConstants& keyConstants) : keyConstants(keyConstants) {}
+
+    std::string operator()(const CKeyID& id) const
+    {
+        return DestinationEncoder(keyConstants)(id);
+    }
+    std::string operator()(const CScriptID& id) const
+    {
+        return DestinationEncoder(keyConstants)(id);
+    }
+    std::string operator()(const libzcash::SproutPaymentAddress& zaddr) const
+    {
+        CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+        ss << zaddr;
+        std::vector<unsigned char> data = keyConstants.Base58Prefix(KeyConstants::ZCPAYMENT_ADDRESS);
+        data.insert(data.end(), ss.begin(), ss.end());
+        return EncodeBase58Check(data);
+    }
+
+    std::string operator()(const libzcash::SaplingPaymentAddress& zaddr) const
+    {
+        CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+        ss << zaddr;
+        // ConvertBits requires unsigned char, but CDataStream uses char
+        std::vector<unsigned char> seraddr(ss.begin(), ss.end());
+        std::vector<unsigned char> data;
+        // See calculation comment below
+        data.reserve((seraddr.size() * 8 + 4) / 5);
+        ConvertBits<8, 5, true>([&](unsigned char c) { data.push_back(c); }, seraddr.begin(), seraddr.end());
+        return bech32::Encode(keyConstants.Bech32HRP(KeyConstants::SAPLING_PAYMENT_ADDRESS), data);
+    }
+
+    std::string operator()(const libzcash::UnifiedAddress& uaddr) const
+    {
+        // Serialize the UA to a C-string.
+        auto encoded = zcash_address_serialize_unified(
+            keyConstants.NetworkIDString().c_str(),
+            &uaddr,
+            uaddr.size(),
+            GetTypecode,
+            GetReceiverLen,
+            GetReceiver);
+        // Copy the C-string into C++.
+        std::string res(encoded);
+        // Free the C-string.
+        zcash_address_string_free(encoded);
+        return res;
+    }
+};
+
+class ViewingKeyEncoder
+{
+private:
+    const KeyConstants& keyConstants;
+
+public:
+    ViewingKeyEncoder(const KeyConstants& keyConstants) : keyConstants(keyConstants) {}
+
+    std::string operator()(const libzcash::SproutViewingKey& vk) const
+    {
+        CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+        ss << vk;
+        std::vector<unsigned char> data = keyConstants.Base58Prefix(KeyConstants::ZCVIEWING_KEY);
+        data.insert(data.end(), ss.begin(), ss.end());
+        std::string ret = EncodeBase58Check(data);
+        memory_cleanse(data.data(), data.size());
+        return ret;
+    }
+
+    std::string operator()(const libzcash::SaplingExtendedFullViewingKey& extfvk) const
+    {
+        CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+        ss << extfvk;
+        // ConvertBits requires unsigned char, but CDataStream uses char
+        std::vector<unsigned char> serkey(ss.begin(), ss.end());
+        std::vector<unsigned char> data;
+        // See calculation comment below
+        data.reserve((serkey.size() * 8 + 4) / 5);
+        ConvertBits<8, 5, true>([&](unsigned char c) { data.push_back(c); }, serkey.begin(), serkey.end());
+        std::string ret = bech32::Encode(keyConstants.Bech32HRP(KeyConstants::SAPLING_EXTENDED_FVK), data);
+        memory_cleanse(serkey.data(), serkey.size());
+        memory_cleanse(data.data(), data.size());
+        return ret;
+    }
+
+    std::string operator()(const libzcash::UnifiedFullViewingKey& ufvk) const {
+        return ufvk.Encode(keyConstants);
+    }
+};
+
+class SpendingKeyEncoder
+{
+private:
+    const KeyConstants& keyConstants;
+
+public:
+    SpendingKeyEncoder(const KeyConstants& keyConstants) : keyConstants(keyConstants) {}
+
+    std::string operator()(const libzcash::SproutSpendingKey& zkey) const
+    {
+        CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+        ss << zkey;
+        std::vector<unsigned char> data = keyConstants.Base58Prefix(KeyConstants::ZCSPENDING_KEY);
+        data.insert(data.end(), ss.begin(), ss.end());
+        std::string ret = EncodeBase58Check(data);
+        memory_cleanse(data.data(), data.size());
+        return ret;
+    }
+
+    std::string operator()(const libzcash::SaplingExtendedSpendingKey& zkey) const
+    {
+        CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+        ss << zkey;
+        // ConvertBits requires unsigned char, but CDataStream uses char
+        std::vector<unsigned char> serkey(ss.begin(), ss.end());
+        std::vector<unsigned char> data;
+        // See calculation comment below
+        data.reserve((serkey.size() * 8 + 4) / 5);
+        ConvertBits<8, 5, true>([&](unsigned char c) { data.push_back(c); }, serkey.begin(), serkey.end());
+        std::string ret = bech32::Encode(keyConstants.Bech32HRP(KeyConstants::SAPLING_EXTENDED_SPEND_KEY), data);
+        memory_cleanse(serkey.data(), serkey.size());
+        memory_cleanse(data.data(), data.size());
+        return ret;
+    }
+};
+
+// Sizes of SaplingPaymentAddress, SaplingExtendedFullViewingKey, and
+// SaplingExtendedSpendingKey after ConvertBits<8, 5, true>(). The calculations
+// below take the regular serialized size in bytes, convert to bits, and then
+// perform ceiling division to get the number of 5-bit clusters.
+const size_t ConvertedSaplingPaymentAddressSize = ((32 + 11) * 8 + 4) / 5;
+const size_t ConvertedSaplingExtendedFullViewingKeySize = (ZIP32_XFVK_SIZE * 8 + 4) / 5;
+const size_t ConvertedSaplingExtendedSpendingKeySize = (ZIP32_XSK_SIZE * 8 + 4) / 5;
+} // namespace
+
+CTxDestination KeyIO::DecodeDestination(const std::string& str) const
+{
+    std::vector<unsigned char> data;
+    uint160 hash;
+    if (DecodeBase58Check(str, data)) {
+        // base58-encoded Bitcoin addresses.
+        // Public-key-hash-addresses have version 0 (or 111 testnet).
+        // The data vector contains RIPEMD160(SHA256(pubkey)), where pubkey is the serialized public key.
+        const std::vector<unsigned char>& pubkey_prefix = keyConstants.Base58Prefix(KeyConstants::PUBKEY_ADDRESS);
+        if (data.size() == hash.size() + pubkey_prefix.size() && std::equal(pubkey_prefix.begin(), pubkey_prefix.end(), data.begin())) {
+            std::copy(data.begin() + pubkey_prefix.size(), data.end(), hash.begin());
+            return CKeyID(hash);
+        }
+        // Script-hash-addresses have version 5 (or 196 testnet).
+        // The data vector contains RIPEMD160(SHA256(cscript)), where cscript is the serialized redemption script.
+        const std::vector<unsigned char>& script_prefix = keyConstants.Base58Prefix(KeyConstants::SCRIPT_ADDRESS);
+        if (data.size() == hash.size() + script_prefix.size() && std::equal(script_prefix.begin(), script_prefix.end(), data.begin())) {
+            std::copy(data.begin() + script_prefix.size(), data.end(), hash.begin());
+            return CScriptID(hash);
+        }
+    }
+    return CNoDestination();
+};
+
+CKey KeyIO::DecodeSecret(const std::string& str) const
+{
+    CKey key;
+    std::vector<unsigned char> data;
+    if (DecodeBase58Check(str, data)) {
+        const std::vector<unsigned char>& privkey_prefix = keyConstants.Base58Prefix(KeyConstants::SECRET_KEY);
+        if ((data.size() == 32 + privkey_prefix.size() || (data.size() == 33 + privkey_prefix.size() && data.back() == 1)) &&
+            std::equal(privkey_prefix.begin(), privkey_prefix.end(), data.begin())) {
+            bool compressed = data.size() == 33 + privkey_prefix.size();
+            key.Set(data.begin() + privkey_prefix.size(), data.begin() + privkey_prefix.size() + 32, compressed);
+        }
+    }
+    memory_cleanse(data.data(), data.size());
+    return key;
+}
+
+std::string KeyIO::EncodeSecret(const CKey& key) const
+{
+    assert(key.IsValid());
+    std::vector<unsigned char> data = keyConstants.Base58Prefix(KeyConstants::SECRET_KEY);
+    data.insert(data.end(), key.begin(), key.end());
+    if (key.IsCompressed()) {
+        data.push_back(1);
+    }
+    std::string ret = EncodeBase58Check(data);
+    memory_cleanse(data.data(), data.size());
+    return ret;
+}
+
+CExtPubKey KeyIO::DecodeExtPubKey(const std::string& str) const
+{
+    CExtPubKey key;
+    std::vector<unsigned char> data;
+    if (DecodeBase58Check(str, data)) {
+        const std::vector<unsigned char>& prefix = keyConstants.Base58Prefix(KeyConstants::EXT_PUBLIC_KEY);
+        if (data.size() == BIP32_EXTKEY_SIZE + prefix.size() && std::equal(prefix.begin(), prefix.end(), data.begin())) {
+            key.Decode(data.data() + prefix.size());
+        }
+    }
+    return key;
+}
+
+std::string KeyIO::EncodeExtPubKey(const CExtPubKey& key) const
+{
+    std::vector<unsigned char> data = keyConstants.Base58Prefix(KeyConstants::EXT_PUBLIC_KEY);
+    size_t size = data.size();
+    data.resize(size + BIP32_EXTKEY_SIZE);
+    key.Encode(data.data() + size);
+    std::string ret = EncodeBase58Check(data);
+    return ret;
+}
+
+CExtKey KeyIO::DecodeExtKey(const std::string& str) const
+{
+    CExtKey key;
+    std::vector<unsigned char> data;
+    if (DecodeBase58Check(str, data)) {
+        const std::vector<unsigned char>& prefix = keyConstants.Base58Prefix(KeyConstants::EXT_SECRET_KEY);
+        if (data.size() == BIP32_EXTKEY_SIZE + prefix.size() && std::equal(prefix.begin(), prefix.end(), data.begin())) {
+            key.Decode(data.data() + prefix.size());
+        }
+    }
+    return key;
+}
+
+std::string KeyIO::EncodeExtKey(const CExtKey& key) const
+{
+    std::vector<unsigned char> data = keyConstants.Base58Prefix(KeyConstants::EXT_SECRET_KEY);
+    size_t size = data.size();
+    data.resize(size + BIP32_EXTKEY_SIZE);
+    key.Encode(data.data() + size);
+    std::string ret = EncodeBase58Check(data);
+    memory_cleanse(data.data(), data.size());
+    return ret;
+}
+
+std::string KeyIO::EncodeDestination(const CTxDestination& dest) const
+{
+    return std::visit(DestinationEncoder(keyConstants), dest);
+}
+
+bool KeyIO::IsValidDestinationString(const std::string& str) const
+{
+    return IsValidDestination(DecodeDestination(str));
+}
+
+std::string KeyIO::EncodePaymentAddress(const libzcash::PaymentAddress& zaddr) const
+{
+    return std::visit(PaymentAddressEncoder(keyConstants), zaddr);
+}
+
+template<typename T1, typename T2>
+std::optional<T1> DecodeSprout(
+        const KeyConstants& keyConstants,
+        const std::string& str,
+        const std::pair<KeyConstants::Base58Type, size_t>& keyMeta)
+{
+    std::vector<unsigned char> data;
+    if (DecodeBase58Check(str, data)) {
+        const std::vector<unsigned char>& prefix = keyConstants.Base58Prefix(keyMeta.first);
+        if ((data.size() == keyMeta.second + prefix.size()) &&
+            std::equal(prefix.begin(), prefix.end(), data.begin())) {
+            CSerializeData serialized(data.begin() + prefix.size(), data.end());
+            CDataStream ss(serialized, SER_NETWORK, PROTOCOL_VERSION);
+            T2 ret;
+            ss >> ret;
+            memory_cleanse(serialized.data(), serialized.size());
+            memory_cleanse(data.data(), data.size());
+            return ret;
+        }
+    }
+
+    memory_cleanse(data.data(), data.size());
+    return std::nullopt;
+}
+
+template<typename T1, typename T2>
+std::optional<T1> DecodeSapling(
+        const KeyConstants& keyConstants,
+        const std::string& str,
+        const std::pair<KeyConstants::Bech32Type, size_t>& keyMeta)
+{
+    std::vector<unsigned char> data;
+
+    auto bech = bech32::Decode(str);
+    if (bech.first == keyConstants.Bech32HRP(keyMeta.first) &&
+        bech.second.size() == keyMeta.second) {
+        // Bech32 decoding
+        data.reserve((bech.second.size() * 5) / 8);
+        if (ConvertBits<5, 8, false>([&](unsigned char c) { data.push_back(c); }, bech.second.begin(), bech.second.end())) {
+            CDataStream ss(data, SER_NETWORK, PROTOCOL_VERSION);
+            T2 ret;
+            ss >> ret;
+            memory_cleanse(data.data(), data.size());
+            return ret;
+        }
+    }
+
+    memory_cleanse(data.data(), data.size());
+    return std::nullopt;
+}
+
+template<typename T1, typename T2, typename T3>
+std::optional<T1> DecodeAny(
+    const KeyConstants& keyConstants,
+    const std::string& str,
+    const std::pair<KeyConstants::Base58Type, size_t>& sproutKeyMeta,
+    const std::pair<KeyConstants::Bech32Type, size_t>& saplingKeyMeta)
+{
+    auto sprout = DecodeSprout<T1, T2>(keyConstants, str, sproutKeyMeta);
+    if (sprout.has_value()) {
+        return sprout.value();
+    }
+
+    auto sapling = DecodeSapling<T1, T3>(keyConstants, str, saplingKeyMeta);
+    if (sapling.has_value()) {
+        return sapling.value();
+    }
+
+    return std::nullopt;
+}
+
+std::optional<libzcash::PaymentAddress> KeyIO::DecodePaymentAddress(const std::string& str) const
+{
+    // Try parsing as a Unified Address.
+    auto ua = libzcash::UnifiedAddress::Parse(keyConstants, str);
+    if (ua.has_value()) {
+        return ua.value();
+    }
+
+    // Try parsing as a Sapling address
+    auto sapling = DecodeSapling<libzcash::SaplingPaymentAddress, libzcash::SaplingPaymentAddress>(
+            keyConstants,
+            str,
+            std::make_pair(KeyConstants::SAPLING_PAYMENT_ADDRESS, ConvertedSaplingPaymentAddressSize));
+    if (sapling.has_value()) {
+        return sapling.value();
+    }
+
+    // Try parsing as a Sprout address
+    auto sprout = DecodeSprout<libzcash::SproutPaymentAddress, libzcash::SproutPaymentAddress>(
+            keyConstants,
+            str,
+            std::make_pair(KeyConstants::ZCPAYMENT_ADDRESS, libzcash::SerializedSproutPaymentAddressSize));
+    if (sprout.has_value()) {
+        return sprout.value();
+    }
+
+    // Finally, try parsing as transparent
+    return std::visit(match {
+        [](const CKeyID& keyIdIn) {
+            std::optional<libzcash::PaymentAddress> keyId = keyIdIn;
+            return keyId;
+        },
+        [](const CScriptID& scriptIdIn) {
+            std::optional<libzcash::PaymentAddress> scriptId = scriptIdIn;
+            return scriptId;
+        },
+        [](const CNoDestination& d) {
+            std::optional<libzcash::PaymentAddress> result = std::nullopt;
+            return result;
+        }
+    }, DecodeDestination(str));
+}
+
+bool KeyIO::IsValidPaymentAddressString(const std::string& str) const
+{
+    return DecodePaymentAddress(str).has_value();
+}
+
+std::string KeyIO::EncodeViewingKey(const libzcash::ViewingKey& vk) const
+{
+    return std::visit(ViewingKeyEncoder(keyConstants), vk);
+}
+
+std::optional<libzcash::ViewingKey> KeyIO::DecodeViewingKey(const std::string& str) const
+{
+    // Try parsing as a Unified full viewing key
+    auto ufvk = libzcash::UnifiedFullViewingKey::Decode(str, keyConstants);
+    if (ufvk.has_value()) {
+        return ufvk.value();
+    }
+
+    // Fall back on trying Sprout or Sapling.
+    return DecodeAny<libzcash::ViewingKey,
+        libzcash::SproutViewingKey,
+        libzcash::SaplingExtendedFullViewingKey>(
+            keyConstants,
+            str,
+            std::make_pair(KeyConstants::ZCVIEWING_KEY, libzcash::SerializedSproutViewingKeySize),
+            std::make_pair(KeyConstants::SAPLING_EXTENDED_FVK, ConvertedSaplingExtendedFullViewingKeySize)
+        );
+}
+
+std::string KeyIO::EncodeSpendingKey(const libzcash::SpendingKey& zkey) const
+{
+    return std::visit(SpendingKeyEncoder(keyConstants), zkey);
+}
+
+std::optional<libzcash::SpendingKey> KeyIO::DecodeSpendingKey(const std::string& str) const
+{
+
+    return DecodeAny<libzcash::SpendingKey,
+        libzcash::SproutSpendingKey,
+        libzcash::SaplingExtendedSpendingKey>(
+            keyConstants,
+            str,
+            std::make_pair(KeyConstants::ZCSPENDING_KEY, libzcash::SerializedSproutSpendingKeySize),
+            std::make_pair(KeyConstants::SAPLING_EXTENDED_SPEND_KEY, ConvertedSaplingExtendedSpendingKeySize)
+        );
+}
diff --git a/depend/zcash/src/key_io.h b/depend/zcash/src/key_io.h
new file mode 100644
index 000000000..80e932758
--- /dev/null
+++ b/depend/zcash/src/key_io.h
@@ -0,0 +1,50 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2015 The Bitcoin Core developers
+// Copyright (c) 2016-2018 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_KEY_IO_H
+#define BITCOIN_KEY_IO_H
+
+#include <chainparams.h>
+#include <key.h>
+#include <pubkey.h>
+#include <script/standard.h>
+#include <zcash/Address.hpp>
+
+#include <vector>
+#include <string>
+
+class KeyIO {
+private:
+    const KeyConstants& keyConstants;
+
+public:
+    KeyIO(const KeyConstants& keyConstants): keyConstants(keyConstants) { }
+
+    CKey DecodeSecret(const std::string& str) const;
+    std::string EncodeSecret(const CKey& key) const;
+
+    CExtKey DecodeExtKey(const std::string& str) const;
+    std::string EncodeExtKey(const CExtKey& extkey) const;
+    CExtPubKey DecodeExtPubKey(const std::string& str) const;
+    std::string EncodeExtPubKey(const CExtPubKey& extpubkey) const;
+
+    std::string EncodeDestination(const CTxDestination& dest) const;
+    CTxDestination DecodeDestination(const std::string& str) const;
+
+    bool IsValidDestinationString(const std::string& str) const;
+
+    std::string EncodePaymentAddress(const libzcash::PaymentAddress& zaddr) const;
+    std::optional<libzcash::PaymentAddress> DecodePaymentAddress(const std::string& str) const;
+    bool IsValidPaymentAddressString(const std::string& str) const;
+
+    std::string EncodeViewingKey(const libzcash::ViewingKey& vk) const;
+    std::optional<libzcash::ViewingKey> DecodeViewingKey(const std::string& str) const;
+
+    std::string EncodeSpendingKey(const libzcash::SpendingKey& zkey) const;
+    std::optional<libzcash::SpendingKey> DecodeSpendingKey(const std::string& str) const;
+};
+
+#endif // BITCOIN_KEY_IO_H
diff --git a/depend/zcash/src/keystore.cpp b/depend/zcash/src/keystore.cpp
new file mode 100644
index 000000000..77a841578
--- /dev/null
+++ b/depend/zcash/src/keystore.cpp
@@ -0,0 +1,547 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "keystore.h"
+
+#include "key.h"
+#include "pubkey.h"
+#include "util.h"
+
+
+bool CKeyStore::AddKey(const CKey &key) {
+    return AddKeyPubKey(key, key.GetPubKey());
+}
+
+bool CBasicKeyStore::GetPubKey(const CKeyID &address, CPubKey &vchPubKeyOut) const
+{
+    CKey key;
+    if (!GetKey(address, key)) {
+        LOCK(cs_KeyStore);
+        WatchKeyMap::const_iterator it = mapWatchKeys.find(address);
+        if (it != mapWatchKeys.end()) {
+            vchPubKeyOut = it->second;
+            return true;
+        }
+        return false;
+    }
+    vchPubKeyOut = key.GetPubKey();
+    return true;
+}
+
+bool CBasicKeyStore::SetMnemonicSeed(const MnemonicSeed& seed)
+{
+    LOCK(cs_KeyStore);
+    if (mnemonicSeed.has_value()) {
+        // Don't allow an existing seed to be changed. We can maybe relax this
+        // restriction later once we have worked out the UX implications.
+        return false;
+    }
+    mnemonicSeed = seed;
+    return true;
+}
+
+bool CBasicKeyStore::HaveMnemonicSeed() const
+{
+    LOCK(cs_KeyStore);
+    return mnemonicSeed.has_value();
+}
+
+std::optional<MnemonicSeed> CBasicKeyStore::GetMnemonicSeed() const
+{
+    LOCK(cs_KeyStore);
+    return mnemonicSeed;
+}
+
+bool CBasicKeyStore::SetLegacyHDSeed(const HDSeed& seed)
+{
+    LOCK(cs_KeyStore);
+    if (legacySeed.has_value()) {
+        // Don't allow an existing seed to be changed.
+        return false;
+    }
+    legacySeed = seed;
+    return true;
+}
+
+std::optional<HDSeed> CBasicKeyStore::GetLegacyHDSeed() const
+{
+    LOCK(cs_KeyStore);
+    return legacySeed;
+}
+
+bool CBasicKeyStore::AddKeyPubKey(const CKey& key, const CPubKey &pubkey)
+{
+    LOCK(cs_KeyStore);
+    mapKeys[pubkey.GetID()] = key;
+    return true;
+}
+
+bool CBasicKeyStore::AddCScript(const CScript& redeemScript)
+{
+    if (redeemScript.size() > MAX_SCRIPT_ELEMENT_SIZE)
+        return error("CBasicKeyStore::AddCScript(): redeemScripts > %i bytes are invalid", MAX_SCRIPT_ELEMENT_SIZE);
+
+    LOCK(cs_KeyStore);
+    mapScripts[CScriptID(redeemScript)] = redeemScript;
+    return true;
+}
+
+bool CBasicKeyStore::HaveCScript(const CScriptID& hash) const
+{
+    LOCK(cs_KeyStore);
+    return mapScripts.count(hash) > 0;
+}
+
+bool CBasicKeyStore::GetCScript(const CScriptID &hash, CScript& redeemScriptOut) const
+{
+    LOCK(cs_KeyStore);
+    ScriptMap::const_iterator mi = mapScripts.find(hash);
+    if (mi != mapScripts.end())
+    {
+        redeemScriptOut = (*mi).second;
+        return true;
+    }
+    return false;
+}
+
+static bool ExtractPubKey(const CScript &dest, CPubKey& pubKeyOut)
+{
+    //TODO: Use Solver to extract this?
+    CScript::const_iterator pc = dest.begin();
+    opcodetype opcode;
+    std::vector<unsigned char> vch;
+    if (!dest.GetOp(pc, opcode, vch) || vch.size() < 33 || vch.size() > 65)
+        return false;
+    pubKeyOut = CPubKey(vch);
+    if (!pubKeyOut.IsFullyValid())
+        return false;
+    if (!dest.GetOp(pc, opcode, vch) || opcode != OP_CHECKSIG || dest.GetOp(pc, opcode, vch))
+        return false;
+    return true;
+}
+
+bool CBasicKeyStore::AddWatchOnly(const CScript &dest)
+{
+    LOCK(cs_KeyStore);
+    setWatchOnly.insert(dest);
+    CPubKey pubKey;
+    if (ExtractPubKey(dest, pubKey))
+        mapWatchKeys[pubKey.GetID()] = pubKey;
+    return true;
+}
+
+bool CBasicKeyStore::RemoveWatchOnly(const CScript &dest)
+{
+    LOCK(cs_KeyStore);
+    setWatchOnly.erase(dest);
+    CPubKey pubKey;
+    if (ExtractPubKey(dest, pubKey))
+        mapWatchKeys.erase(pubKey.GetID());
+    return true;
+}
+
+bool CBasicKeyStore::HaveWatchOnly(const CScript &dest) const
+{
+    LOCK(cs_KeyStore);
+    return setWatchOnly.count(dest) > 0;
+}
+
+bool CBasicKeyStore::HaveWatchOnly() const
+{
+    LOCK(cs_KeyStore);
+    return (!setWatchOnly.empty());
+}
+
+bool CBasicKeyStore::AddSproutSpendingKey(const libzcash::SproutSpendingKey &sk)
+{
+    LOCK(cs_KeyStore);
+    auto address = sk.address();
+    mapSproutSpendingKeys[address] = sk;
+    mapNoteDecryptors.insert(std::make_pair(address, ZCNoteDecryption(sk.receiving_key())));
+    return true;
+}
+
+//! Sapling
+bool CBasicKeyStore::AddSaplingSpendingKey(
+    const libzcash::SaplingExtendedSpendingKey &sk)
+{
+    LOCK(cs_KeyStore);
+    auto extfvk = sk.ToXFVK();
+
+    // if extfvk is not in SaplingFullViewingKeyMap, add it
+    if (!CBasicKeyStore::AddSaplingFullViewingKey(extfvk)) {
+        return false;
+    }
+
+    mapSaplingSpendingKeys[extfvk] = sk;
+
+    return true;
+}
+
+bool CBasicKeyStore::AddSproutViewingKey(const libzcash::SproutViewingKey &vk)
+{
+    LOCK(cs_KeyStore);
+    auto address = vk.address();
+    mapSproutViewingKeys[address] = vk;
+    mapNoteDecryptors.insert(std::make_pair(address, ZCNoteDecryption(vk.sk_enc)));
+    return true;
+}
+
+bool CBasicKeyStore::AddSaplingFullViewingKey(
+    const libzcash::SaplingExtendedFullViewingKey &extfvk)
+{
+    LOCK(cs_KeyStore);
+    auto ivk = extfvk.ToIncomingViewingKey();
+    mapSaplingFullViewingKeys[ivk] = extfvk;
+
+    return true;
+}
+
+// This function updates the wallet's internal address->ivk map.
+// If we add an address that is already in the map, the map will
+// remain unchanged as each address only has one ivk.
+bool CBasicKeyStore::AddSaplingPaymentAddress(
+    const libzcash::SaplingIncomingViewingKey &ivk,
+    const libzcash::SaplingPaymentAddress &addr)
+{
+    LOCK(cs_KeyStore);
+
+    // Add addr -> SaplingIncomingViewing to SaplingIncomingViewingKeyMap
+    mapSaplingIncomingViewingKeys[addr] = ivk;
+
+    return true;
+}
+
+bool CBasicKeyStore::RemoveSproutViewingKey(const libzcash::SproutViewingKey &vk)
+{
+    LOCK(cs_KeyStore);
+    mapSproutViewingKeys.erase(vk.address());
+    return true;
+}
+
+bool CBasicKeyStore::HaveSproutViewingKey(const libzcash::SproutPaymentAddress &address) const
+{
+    LOCK(cs_KeyStore);
+    return mapSproutViewingKeys.count(address) > 0;
+}
+
+bool CBasicKeyStore::HaveSaplingFullViewingKey(const libzcash::SaplingIncomingViewingKey &ivk) const
+{
+    LOCK(cs_KeyStore);
+    return mapSaplingFullViewingKeys.count(ivk) > 0;
+}
+
+bool CBasicKeyStore::HaveSaplingIncomingViewingKey(const libzcash::SaplingPaymentAddress &addr) const
+{
+    LOCK(cs_KeyStore);
+    return mapSaplingIncomingViewingKeys.count(addr) > 0;
+}
+
+bool CBasicKeyStore::GetSproutViewingKey(
+    const libzcash::SproutPaymentAddress &address,
+    libzcash::SproutViewingKey &vkOut) const
+{
+    LOCK(cs_KeyStore);
+    SproutViewingKeyMap::const_iterator mi = mapSproutViewingKeys.find(address);
+    if (mi != mapSproutViewingKeys.end()) {
+        vkOut = mi->second;
+        return true;
+    }
+    return false;
+}
+
+//
+// Sapling Keys
+//
+
+bool CBasicKeyStore::GetSaplingFullViewingKey(
+    const libzcash::SaplingIncomingViewingKey &ivk,
+    libzcash::SaplingExtendedFullViewingKey &extfvkOut) const
+{
+    LOCK(cs_KeyStore);
+    SaplingFullViewingKeyMap::const_iterator mi = mapSaplingFullViewingKeys.find(ivk);
+    if (mi != mapSaplingFullViewingKeys.end()) {
+        extfvkOut = mi->second;
+        return true;
+    }
+    return false;
+}
+
+bool CBasicKeyStore::GetSaplingIncomingViewingKey(const libzcash::SaplingPaymentAddress &addr,
+                                   libzcash::SaplingIncomingViewingKey &ivkOut) const
+{
+    LOCK(cs_KeyStore);
+    SaplingIncomingViewingKeyMap::const_iterator mi = mapSaplingIncomingViewingKeys.find(addr);
+    if (mi != mapSaplingIncomingViewingKeys.end()) {
+        ivkOut = mi->second;
+        return true;
+    }
+    return false;
+}
+
+bool CBasicKeyStore::GetSaplingExtendedSpendingKey(
+        const libzcash::SaplingPaymentAddress &addr,
+        libzcash::SaplingExtendedSpendingKey &extskOut) const {
+    libzcash::SaplingIncomingViewingKey ivk;
+    libzcash::SaplingExtendedFullViewingKey extfvk;
+
+    LOCK(cs_KeyStore);
+    return GetSaplingIncomingViewingKey(addr, ivk) &&
+            GetSaplingFullViewingKey(ivk, extfvk) &&
+            GetSaplingSpendingKey(extfvk, extskOut);
+}
+
+bool CBasicKeyStore::HaveSaplingSpendingKeyForAddress(
+        const libzcash::SaplingPaymentAddress &addr) const {
+    libzcash::SaplingIncomingViewingKey ivk;
+    libzcash::SaplingExtendedFullViewingKey extfvk;
+
+    return GetSaplingIncomingViewingKey(addr, ivk) &&
+        GetSaplingFullViewingKey(ivk, extfvk) &&
+        HaveSaplingSpendingKey(extfvk);
+}
+
+//
+// Unified Keys
+//
+
+bool CBasicKeyStore::AddUnifiedFullViewingKey(
+        const libzcash::ZcashdUnifiedFullViewingKey &ufvk)
+{
+    LOCK(cs_KeyStore);
+
+    auto ufvkId = ufvk.GetKeyID();
+
+    // Add the Orchard component of the UFVK to the wallet.
+    auto orchardKey = ufvk.GetOrchardKey();
+    if (orchardKey.has_value()) {
+        auto ivk = orchardKey.value().ToIncomingViewingKey();
+        mapOrchardKeyUnified.insert(std::make_pair(ivk, ufvkId));
+
+        auto ivkInternal = orchardKey.value().ToInternalIncomingViewingKey();
+        mapOrchardKeyUnified.insert(std::make_pair(ivkInternal, ufvkId));
+    }
+
+    // Add the Sapling component of the UFVK to the wallet.
+    auto saplingKey = ufvk.GetSaplingKey();
+    if (saplingKey.has_value()) {
+        auto ivk = saplingKey.value().ToIncomingViewingKey();
+        mapSaplingKeyUnified.insert(std::make_pair(ivk, ufvkId));
+
+        auto changeIvk = saplingKey.value().GetChangeIVK();
+        mapSaplingKeyUnified.insert(std::make_pair(changeIvk, ufvkId));
+    }
+
+    // We can't reasonably add the transparent component here, because
+    // of the way that transparent addresses are generated from the
+    // P2PKH part of the unified address. Instead, whenever a new
+    // unified address is generated, the keys associated with the
+    // transparent part of the address must be added to the keystore.
+
+    // Add the UFVK by key identifier.
+    mapUnifiedFullViewingKeys.insert({ufvkId, ufvk});
+
+    return true;
+}
+
+bool CBasicKeyStore::AddTransparentReceiverForUnifiedAddress(
+        const libzcash::UFVKId& keyId,
+        const libzcash::diversifier_index_t& diversifierIndex,
+        const libzcash::UnifiedAddress& ua)
+{
+    LOCK(cs_KeyStore);
+
+    // It's only necessary to add p2pkh and p2sh components of
+    // the UA; all other lookups of the associated UFVK will be
+    // made via the protocol-specific viewing key that is used
+    // to trial-decrypt a transaction.
+    auto addrEntry = std::make_pair(keyId, diversifierIndex);
+
+    auto p2pkhReceiver = ua.GetP2PKHReceiver();
+    if (p2pkhReceiver.has_value()) {
+        mapP2PKHUnified.insert(std::make_pair(p2pkhReceiver.value(), addrEntry));
+    }
+
+    auto p2shReceiver = ua.GetP2SHReceiver();
+    if (p2shReceiver.has_value()) {
+        mapP2SHUnified.insert(std::make_pair(p2shReceiver.value(), addrEntry));
+    }
+
+    return true;
+}
+
+std::optional<libzcash::ZcashdUnifiedFullViewingKey> CBasicKeyStore::GetUnifiedFullViewingKey(
+        const libzcash::UFVKId& keyId) const
+{
+    auto mi = mapUnifiedFullViewingKeys.find(keyId);
+    if (mi != mapUnifiedFullViewingKeys.end()) {
+        return mi->second;
+    } else {
+        return std::nullopt;
+    }
+}
+
+std::optional<AddressUFVKMetadata>
+CBasicKeyStore::GetUFVKMetadataForReceiver(const libzcash::Receiver& receiver) const
+{
+    return std::visit(FindUFVKId(*this), receiver);
+}
+
+std::optional<AddressUFVKMetadata>
+CBasicKeyStore::GetUFVKMetadataForAddress(const libzcash::UnifiedAddress& addr) const
+{
+    std::optional<libzcash::UFVKId> ufvkId;
+    std::optional<libzcash::diversifier_index_t> j;
+    bool jConflict = false;
+    for (const auto& receiver : addr) {
+        auto rmeta = GetUFVKMetadataForReceiver(receiver);
+        if (rmeta.has_value()) {
+            // We should never generate unified addresses with internal receivers
+            assert(rmeta.value().IsExternalAddress());
+
+            if (ufvkId.has_value()) {
+                // If the unified address contains receivers that are associated with
+                // different UFVKs, we cannot return a singular value.
+                if (rmeta.value().GetUFVKId() != ufvkId.value()) {
+                    return std::nullopt;
+                }
+
+                if (rmeta.value().GetDiversifierIndex().has_value()) {
+                    if (j.has_value()) {
+                        if (rmeta.value().GetDiversifierIndex().value() != j.value()) {
+                            jConflict = true;
+                            j = std::nullopt;
+                        }
+                    } else if (!jConflict) {
+                        j = rmeta.value().GetDiversifierIndex().value();
+                    }
+                }
+            } else {
+                ufvkId = rmeta.value().GetUFVKId();
+                j = rmeta.value().GetDiversifierIndex();
+            }
+        }
+    }
+
+    if (ufvkId.has_value()) {
+        return AddressUFVKMetadata(ufvkId.value(), j, true);
+    } else {
+        return std::nullopt;
+    }
+}
+
+std::optional<libzcash::UFVKId> CBasicKeyStore::GetUFVKIdForViewingKey(const libzcash::ViewingKey& vk) const
+{
+    std::optional<libzcash::UFVKId> result;
+    std::visit(match {
+        [&](const libzcash::SproutViewingKey& vk) {},
+        [&](const libzcash::SaplingExtendedFullViewingKey& extfvk) {
+            const auto saplingIvk = extfvk.ToIncomingViewingKey();
+            const auto ufvkId = mapSaplingKeyUnified.find(saplingIvk);
+            if (ufvkId != mapSaplingKeyUnified.end()) {
+                result = ufvkId->second;
+            }
+        },
+        [&](const libzcash::UnifiedFullViewingKey& ufvk) {
+            const auto orchardFvk = ufvk.GetOrchardKey();
+            if (orchardFvk.has_value()) {
+                const auto orchardIvk = orchardFvk.value().ToIncomingViewingKey();
+                const auto ufvkId = mapOrchardKeyUnified.find(orchardIvk);
+                if (ufvkId != mapOrchardKeyUnified.end()) {
+                    result = ufvkId->second;
+                    return;
+                }
+            }
+            const auto saplingDfvk = ufvk.GetSaplingKey();
+            if (saplingDfvk.has_value()) {
+                const auto saplingIvk = saplingDfvk.value().ToIncomingViewingKey();
+                const auto ufvkId = mapSaplingKeyUnified.find(saplingIvk);
+                if (ufvkId != mapSaplingKeyUnified.end()) {
+                    result = ufvkId->second;
+                }
+            }
+        }
+    }, vk);
+    return result;
+}
+
+//
+// FindUFVKId :: (KeyStore, Receiver) -> std::optional<AddressUFVKMetadata>
+//
+
+std::optional<AddressUFVKMetadata> FindUFVKId::operator()(const libzcash::OrchardRawAddress& orchardAddr) const {
+    for (const auto& [k, v] : keystore.mapUnifiedFullViewingKeys) {
+        auto fvk = v.GetOrchardKey();
+        if (fvk.has_value()) {
+            auto d_idx = fvk.value().DecryptDiversifier(orchardAddr);
+            if (d_idx.has_value()) {
+                return AddressUFVKMetadata(k, d_idx->first, d_idx->second);
+            }
+        }
+    }
+    return std::nullopt;
+}
+std::optional<AddressUFVKMetadata> FindUFVKId::operator()(const libzcash::SaplingPaymentAddress& saplingAddr) const {
+    const auto saplingIvk = keystore.mapSaplingIncomingViewingKeys.find(saplingAddr);
+    if (saplingIvk != keystore.mapSaplingIncomingViewingKeys.end()) {
+        // We have either generated this as a receiver via `z_getaddressforaccount` or a
+        // legacy Sapling address via `z_getnewaddress`, or we have previously detected
+        // this via trial-decryption of a note.
+        const auto ufvkId = keystore.mapSaplingKeyUnified.find(saplingIvk->second);
+        if (ufvkId != keystore.mapSaplingKeyUnified.end()) {
+            // We know that we have a UFVK, and that it has a Sapling key that
+            // produced this address, so decrypt the diversifier to determine
+            // whether it was an internal or external address
+            auto ufvk = keystore.GetUnifiedFullViewingKey(ufvkId->second).value();
+            auto saplingKey = ufvk.GetSaplingKey().value();
+            auto d_idx = saplingKey.DecryptDiversifier(saplingAddr).value();
+            return AddressUFVKMetadata(ufvkId->second, d_idx.first, d_idx.second);
+        }
+
+        // If we have the addr -> ivk map entry but not the ivk -> UFVK map entry,
+        // then this is definitely a legacy Sapling address.
+        return std::nullopt;
+    }
+
+    // We haven't generated this receiver via `z_getaddressforaccount` (or this is a
+    // recovery from a backed-up mnemonic which doesn't store receiver types selected by
+    // users). Trial-decrypt the diversifier of the Sapling address with every UFVK in the
+    // wallet, to check directly if it belongs to any of them.
+    for (const auto& [k, v] : keystore.mapUnifiedFullViewingKeys) {
+        auto dfvk = v.GetSaplingKey();
+        if (dfvk.has_value()) {
+            auto d_idx = dfvk.value().DecryptDiversifier(saplingAddr);
+            if (d_idx.has_value()) {
+                return AddressUFVKMetadata(k, d_idx->first, d_idx->second);
+            }
+        }
+    }
+
+    // We definitely don't know of any UFVK linked to this Sapling address.
+    return std::nullopt;
+}
+std::optional<AddressUFVKMetadata> FindUFVKId::operator()(const CScriptID& scriptId) const {
+    const auto metadata = keystore.mapP2SHUnified.find(scriptId);
+    if (metadata != keystore.mapP2SHUnified.end()) {
+        // At present we never generate transparent internal addresses, so this
+        // must be an external address
+        return AddressUFVKMetadata(metadata->second.first, metadata->second.second, true);
+    } else {
+        return std::nullopt;
+    }
+}
+std::optional<AddressUFVKMetadata> FindUFVKId::operator()(const CKeyID& keyId) const {
+    const auto metadata = keystore.mapP2PKHUnified.find(keyId);
+    if (metadata != keystore.mapP2PKHUnified.end()) {
+        // At present we never generate transparent internal addresses, so this
+        // must be an external address
+        return AddressUFVKMetadata(metadata->second.first, metadata->second.second, true);
+    } else {
+        return std::nullopt;
+    }
+}
+std::optional<AddressUFVKMetadata> FindUFVKId::operator()(const libzcash::UnknownReceiver& receiver) const {
+    return std::nullopt;
+}
diff --git a/depend/zcash/src/keystore.h b/depend/zcash/src/keystore.h
new file mode 100644
index 000000000..4c6270e26
--- /dev/null
+++ b/depend/zcash/src/keystore.h
@@ -0,0 +1,445 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_KEYSTORE_H
+#define BITCOIN_KEYSTORE_H
+
+#include "key.h"
+#include "pubkey.h"
+#include "script/script.h"
+#include "script/standard.h"
+#include "sync.h"
+#include "zcash/address/mnemonic.h"
+#include "zcash/address/unified.h"
+#include "zcash/Address.hpp"
+#include "zcash/NoteEncryption.hpp"
+
+#include <boost/signals2/signal.hpp>
+
+class AddressUFVKMetadata {
+private:
+    libzcash::UFVKId ufvkId;
+    std::optional<libzcash::diversifier_index_t> j;
+    bool externalAddress;
+public:
+    AddressUFVKMetadata(libzcash::UFVKId ufvkId, std::optional<libzcash::diversifier_index_t> j, bool externalAddress)
+        : ufvkId(ufvkId), j(j), externalAddress(externalAddress) {}
+
+    libzcash::UFVKId GetUFVKId() const { return ufvkId; }
+    std::optional<libzcash::diversifier_index_t> GetDiversifierIndex() const { return j; }
+    bool IsExternalAddress() const { return externalAddress; }
+};
+
+/** A virtual base class for key stores */
+class CKeyStore
+{
+protected:
+    mutable CCriticalSection cs_KeyStore;
+
+public:
+    virtual ~CKeyStore() {}
+
+    //! Set the mnemonic HD seed for this keystore
+    virtual bool SetMnemonicSeed(const MnemonicSeed& seed) =0;
+    virtual bool HaveMnemonicSeed() const =0;
+    //! Get the mnemonic HD seed for this keystore
+    virtual std::optional<MnemonicSeed> GetMnemonicSeed() const =0;
+
+    //! Set the legacy HD seed for this keystore
+    virtual bool SetLegacyHDSeed(const HDSeed& seed) =0;
+    //! Get the legacy HD seed for this keystore
+    virtual std::optional<HDSeed> GetLegacyHDSeed() const =0;
+
+    //! Add a key to the store.
+    virtual bool AddKeyPubKey(const CKey &key, const CPubKey &pubkey) =0;
+    virtual bool AddKey(const CKey &key);
+
+    //! Check whether a key corresponding to a given address is present in the store.
+    virtual bool HaveKey(const CKeyID &address) const =0;
+    virtual bool GetKey(const CKeyID &address, CKey& keyOut) const =0;
+    virtual std::set<CKeyID> GetKeys() const =0;
+    virtual bool GetPubKey(const CKeyID &address, CPubKey& vchPubKeyOut) const =0;
+
+    //! Support for BIP 0013 : see https://github.com/bitcoin/bips/blob/master/bip-0013.mediawiki
+    virtual bool AddCScript(const CScript& redeemScript) =0;
+    virtual bool HaveCScript(const CScriptID &hash) const =0;
+    virtual bool GetCScript(const CScriptID &hash, CScript& redeemScriptOut) const =0;
+
+    //! Support for Watch-only addresses
+    virtual bool AddWatchOnly(const CScript &dest) =0;
+    virtual bool RemoveWatchOnly(const CScript &dest) =0;
+    virtual bool HaveWatchOnly(const CScript &dest) const =0;
+    virtual bool HaveWatchOnly() const =0;
+
+    //! Add a spending key to the store.
+    virtual bool AddSproutSpendingKey(const libzcash::SproutSpendingKey &sk) =0;
+
+    //! Check whether a spending key corresponding to a given payment address is present in the store.
+    virtual bool HaveSproutSpendingKey(const libzcash::SproutPaymentAddress &address) const =0;
+    virtual bool GetSproutSpendingKey(const libzcash::SproutPaymentAddress &address, libzcash::SproutSpendingKey& skOut) const =0;
+    virtual void GetSproutPaymentAddresses(std::set<libzcash::SproutPaymentAddress> &setAddress) const =0;
+
+    //! Add a Sapling spending key to the store.
+    virtual bool AddSaplingSpendingKey(const libzcash::SaplingExtendedSpendingKey &sk) =0;
+
+    //! Check whether a Sapling spending key corresponding to a given Sapling viewing key is present in the store.
+    virtual bool HaveSaplingSpendingKey(
+        const libzcash::SaplingExtendedFullViewingKey &extfvk) const =0;
+    virtual bool HaveSaplingSpendingKeyForAddress(
+        const libzcash::SaplingPaymentAddress &addr) const =0;
+    virtual bool GetSaplingSpendingKey(
+        const libzcash::SaplingExtendedFullViewingKey &extfvk,
+        libzcash::SaplingExtendedSpendingKey& skOut) const =0;
+
+    //! Support for Sapling full viewing keys
+    virtual bool AddSaplingFullViewingKey(const libzcash::SaplingExtendedFullViewingKey &extfvk) =0;
+    virtual bool HaveSaplingFullViewingKey(const libzcash::SaplingIncomingViewingKey &ivk) const =0;
+    virtual bool GetSaplingFullViewingKey(
+        const libzcash::SaplingIncomingViewingKey &ivk,
+        libzcash::SaplingExtendedFullViewingKey& extfvkOut) const =0;
+
+    //! Sapling payment addresses & incoming viewing keys
+    virtual bool AddSaplingPaymentAddress(
+        const libzcash::SaplingIncomingViewingKey &ivk,
+        const libzcash::SaplingPaymentAddress &addr) =0;
+    virtual bool HaveSaplingIncomingViewingKey(const libzcash::SaplingPaymentAddress &addr) const =0;
+    virtual bool GetSaplingIncomingViewingKey(
+        const libzcash::SaplingPaymentAddress &addr,
+        libzcash::SaplingIncomingViewingKey& ivkOut) const =0;
+    virtual void GetSaplingPaymentAddresses(std::set<libzcash::SaplingPaymentAddress> &setAddress) const =0;
+
+    //! Support for Sprout viewing keys
+    virtual bool AddSproutViewingKey(const libzcash::SproutViewingKey &vk) =0;
+    virtual bool RemoveSproutViewingKey(const libzcash::SproutViewingKey &vk) =0;
+    virtual bool HaveSproutViewingKey(const libzcash::SproutPaymentAddress &address) const =0;
+    virtual bool GetSproutViewingKey(
+        const libzcash::SproutPaymentAddress &address,
+        libzcash::SproutViewingKey& vkOut) const =0;
+
+    //! Unified addresses and keys
+    virtual bool AddUnifiedFullViewingKey(
+            const libzcash::ZcashdUnifiedFullViewingKey &ufvk
+            ) = 0;
+
+    /**
+     * Add the transparent component of the unified address, if any,
+     * to the keystore to make it possible to identify the unified
+     * full viewing key from which a transparent address was derived.
+     * It is not necessary for implementations to add shielded address
+     * components to the keystore because those will be automatically
+     * reconstructed when scanning the chain with a shielded incoming
+     * viewing key upon discovery of the address as having received
+     * funds.
+     */
+    virtual bool AddTransparentReceiverForUnifiedAddress(
+        const libzcash::UFVKId& keyId,
+        const libzcash::diversifier_index_t& diversifierIndex,
+        const libzcash::UnifiedAddress& ua) = 0;
+
+    virtual std::optional<libzcash::ZcashdUnifiedFullViewingKey> GetUnifiedFullViewingKey(
+            const libzcash::UFVKId& keyId) const = 0;
+
+    virtual std::optional<AddressUFVKMetadata> GetUFVKMetadataForReceiver(
+            const libzcash::Receiver& receiver) const = 0;
+
+    /**
+     * If all the receivers of the specified address correspond to a single
+     * UFVK, return that key's metadata. If all the receivers correspond to
+     * the same diversifier index, that diversifier index is also returned.
+     */
+    virtual std::optional<AddressUFVKMetadata> GetUFVKMetadataForAddress(
+            const libzcash::UnifiedAddress& addr) const = 0;
+
+    virtual std::optional<libzcash::UFVKId> GetUFVKIdForViewingKey(
+            const libzcash::ViewingKey& vk) const = 0;
+};
+
+typedef std::map<CKeyID, CKey> KeyMap;
+typedef std::map<CKeyID, CPubKey> WatchKeyMap;
+typedef std::map<CScriptID, CScript > ScriptMap;
+typedef std::set<CScript> WatchOnlySet;
+typedef std::map<libzcash::SproutPaymentAddress, libzcash::SproutSpendingKey> SproutSpendingKeyMap;
+typedef std::map<libzcash::SproutPaymentAddress, libzcash::SproutViewingKey> SproutViewingKeyMap;
+typedef std::map<libzcash::SproutPaymentAddress, ZCNoteDecryption> NoteDecryptorMap;
+
+// Full viewing key has equivalent functionality to a transparent address
+// When encrypting wallet, encrypt SaplingSpendingKeyMap, while leaving SaplingFullViewingKeyMap unencrypted
+typedef std::map<
+    libzcash::SaplingExtendedFullViewingKey,
+    libzcash::SaplingExtendedSpendingKey> SaplingSpendingKeyMap;
+typedef std::map<
+    libzcash::SaplingIncomingViewingKey,
+    libzcash::SaplingExtendedFullViewingKey> SaplingFullViewingKeyMap;
+// Only maps from default addresses to ivk, may need to be reworked when adding diversified addresses.
+typedef std::map<libzcash::SaplingPaymentAddress, libzcash::SaplingIncomingViewingKey> SaplingIncomingViewingKeyMap;
+
+class FindUFVKId;
+
+/** Basic key store, that keeps keys in an address->secret map */
+class CBasicKeyStore : public CKeyStore
+{
+protected:
+    // All wallets will have a mnemonic seed, but this field must be declared
+    // as optional to avoid the need to construct or hold an invalid seed before the
+    // wallet's contents have been loaded from the database.
+    std::optional<MnemonicSeed> mnemonicSeed;
+    std::optional<HDSeed> legacySeed;
+    KeyMap mapKeys;
+    WatchKeyMap mapWatchKeys;
+    ScriptMap mapScripts;
+    WatchOnlySet setWatchOnly;
+    SproutSpendingKeyMap mapSproutSpendingKeys;
+    SproutViewingKeyMap mapSproutViewingKeys;
+    NoteDecryptorMap mapNoteDecryptors;
+
+    SaplingSpendingKeyMap mapSaplingSpendingKeys;
+    SaplingFullViewingKeyMap mapSaplingFullViewingKeys;
+    SaplingIncomingViewingKeyMap mapSaplingIncomingViewingKeys;
+
+    // Unified key support
+    std::map<CKeyID, std::pair<libzcash::UFVKId, libzcash::diversifier_index_t>> mapP2PKHUnified;
+    std::map<CScriptID, std::pair<libzcash::UFVKId, libzcash::diversifier_index_t>> mapP2SHUnified;
+    std::map<libzcash::SaplingIncomingViewingKey, libzcash::UFVKId> mapSaplingKeyUnified;
+    std::map<libzcash::OrchardIncomingViewingKey, libzcash::UFVKId> mapOrchardKeyUnified;
+    std::map<libzcash::UFVKId, libzcash::ZcashdUnifiedFullViewingKey> mapUnifiedFullViewingKeys;
+
+    friend class FindUFVKId;
+public:
+    bool SetMnemonicSeed(const MnemonicSeed& seed);
+    bool HaveMnemonicSeed() const;
+    std::optional<MnemonicSeed> GetMnemonicSeed() const;
+
+    bool SetLegacyHDSeed(const HDSeed& seed);
+    std::optional<HDSeed> GetLegacyHDSeed() const;
+
+    bool AddKeyPubKey(const CKey& key, const CPubKey &pubkey);
+    bool GetPubKey(const CKeyID &address, CPubKey& vchPubKeyOut) const;
+    bool HaveKey(const CKeyID &address) const
+    {
+        bool result;
+        {
+            LOCK(cs_KeyStore);
+            result = (mapKeys.count(address) > 0);
+        }
+        return result;
+    }
+    std::set<CKeyID> GetKeys() const
+    {
+        std::set<CKeyID> set_address;
+        LOCK(cs_KeyStore);
+        for (const auto& mi : mapKeys) {
+            set_address.insert(mi.first);
+        }
+        return set_address;
+    }
+    bool GetKey(const CKeyID &address, CKey &keyOut) const
+    {
+        {
+            LOCK(cs_KeyStore);
+            KeyMap::const_iterator mi = mapKeys.find(address);
+            if (mi != mapKeys.end())
+            {
+                keyOut = mi->second;
+                return true;
+            }
+        }
+        return false;
+    }
+    virtual bool AddCScript(const CScript& redeemScript);
+    virtual bool HaveCScript(const CScriptID &hash) const;
+    virtual bool GetCScript(const CScriptID &hash, CScript& redeemScriptOut) const;
+
+    virtual bool AddWatchOnly(const CScript &dest);
+    virtual bool RemoveWatchOnly(const CScript &dest);
+    virtual bool HaveWatchOnly(const CScript &dest) const;
+    virtual bool HaveWatchOnly() const;
+
+    bool AddSproutSpendingKey(const libzcash::SproutSpendingKey &sk);
+    bool HaveSproutSpendingKey(const libzcash::SproutPaymentAddress &address) const
+    {
+        bool result;
+        {
+            LOCK(cs_KeyStore);
+            result = (mapSproutSpendingKeys.count(address) > 0);
+        }
+        return result;
+    }
+    bool GetSproutSpendingKey(const libzcash::SproutPaymentAddress &address, libzcash::SproutSpendingKey &skOut) const
+    {
+        {
+            LOCK(cs_KeyStore);
+            SproutSpendingKeyMap::const_iterator mi = mapSproutSpendingKeys.find(address);
+            if (mi != mapSproutSpendingKeys.end())
+            {
+                skOut = mi->second;
+                return true;
+            }
+        }
+        return false;
+    }
+    bool GetNoteDecryptor(const libzcash::SproutPaymentAddress &address, ZCNoteDecryption &decOut) const
+    {
+        {
+            LOCK(cs_KeyStore);
+            NoteDecryptorMap::const_iterator mi = mapNoteDecryptors.find(address);
+            if (mi != mapNoteDecryptors.end())
+            {
+                decOut = mi->second;
+                return true;
+            }
+        }
+        return false;
+    }
+    void GetSproutPaymentAddresses(std::set<libzcash::SproutPaymentAddress> &setAddress) const
+    {
+        setAddress.clear();
+        {
+            LOCK(cs_KeyStore);
+            SproutSpendingKeyMap::const_iterator mi = mapSproutSpendingKeys.begin();
+            while (mi != mapSproutSpendingKeys.end())
+            {
+                setAddress.insert((*mi).first);
+                mi++;
+            }
+            SproutViewingKeyMap::const_iterator mvi = mapSproutViewingKeys.begin();
+            while (mvi != mapSproutViewingKeys.end())
+            {
+                setAddress.insert((*mvi).first);
+                mvi++;
+            }
+        }
+    }
+
+    //! Sapling
+    bool AddSaplingSpendingKey(const libzcash::SaplingExtendedSpendingKey &sk);
+    bool HaveSaplingSpendingKey(const libzcash::SaplingExtendedFullViewingKey &extfvk) const
+    {
+        bool result;
+        {
+            LOCK(cs_KeyStore);
+            result = (mapSaplingSpendingKeys.count(extfvk) > 0);
+        }
+        return result;
+    }
+    bool HaveSaplingSpendingKeyForAddress(const libzcash::SaplingPaymentAddress &addr) const;
+    bool GetSaplingSpendingKey(
+        const libzcash::SaplingExtendedFullViewingKey &extfvk,
+        libzcash::SaplingExtendedSpendingKey &skOut) const
+    {
+        {
+            LOCK(cs_KeyStore);
+
+            SaplingSpendingKeyMap::const_iterator mi = mapSaplingSpendingKeys.find(extfvk);
+            if (mi != mapSaplingSpendingKeys.end())
+            {
+                skOut = mi->second;
+                return true;
+            }
+        }
+        return false;
+    }
+
+    virtual bool AddSaplingFullViewingKey(const libzcash::SaplingExtendedFullViewingKey &extfvk);
+    virtual bool HaveSaplingFullViewingKey(const libzcash::SaplingIncomingViewingKey &ivk) const;
+    virtual bool GetSaplingFullViewingKey(
+        const libzcash::SaplingIncomingViewingKey &ivk,
+        libzcash::SaplingExtendedFullViewingKey& extfvkOut) const;
+
+    virtual bool AddSaplingPaymentAddress(
+        const libzcash::SaplingIncomingViewingKey &ivk,
+        const libzcash::SaplingPaymentAddress &addr);
+    virtual bool HaveSaplingIncomingViewingKey(const libzcash::SaplingPaymentAddress &addr) const;
+    virtual bool GetSaplingIncomingViewingKey(
+        const libzcash::SaplingPaymentAddress &addr,
+        libzcash::SaplingIncomingViewingKey& ivkOut) const;
+
+    bool GetSaplingExtendedSpendingKey(
+        const libzcash::SaplingPaymentAddress &addr,
+        libzcash::SaplingExtendedSpendingKey &extskOut) const;
+
+    void GetSaplingPaymentAddresses(std::set<libzcash::SaplingPaymentAddress> &setAddress) const
+    {
+        setAddress.clear();
+        {
+            LOCK(cs_KeyStore);
+            auto mi = mapSaplingIncomingViewingKeys.begin();
+            while (mi != mapSaplingIncomingViewingKeys.end())
+            {
+                setAddress.insert((*mi).first);
+                mi++;
+            }
+        }
+    }
+
+    virtual bool AddSproutViewingKey(const libzcash::SproutViewingKey &vk);
+    virtual bool RemoveSproutViewingKey(const libzcash::SproutViewingKey &vk);
+    virtual bool HaveSproutViewingKey(const libzcash::SproutPaymentAddress &address) const;
+    virtual bool GetSproutViewingKey(
+        const libzcash::SproutPaymentAddress &address,
+        libzcash::SproutViewingKey& vkOut) const;
+
+    virtual bool AddUnifiedFullViewingKey(
+            const libzcash::ZcashdUnifiedFullViewingKey &ufvk);
+
+    virtual bool AddTransparentReceiverForUnifiedAddress(
+        const libzcash::UFVKId& keyId,
+        const libzcash::diversifier_index_t& diversifierIndex,
+        const libzcash::UnifiedAddress& ua);
+
+    virtual std::optional<libzcash::ZcashdUnifiedFullViewingKey> GetUnifiedFullViewingKey(
+            const libzcash::UFVKId& keyId) const;
+
+    virtual std::optional<AddressUFVKMetadata> GetUFVKMetadataForReceiver(
+            const libzcash::Receiver& receiver) const;
+
+    std::optional<libzcash::ZcashdUnifiedFullViewingKey> GetUFVKForReceiver(
+            const libzcash::Receiver& receiver) const {
+        auto ufvkMeta = GetUFVKMetadataForReceiver(receiver);
+        if (ufvkMeta.has_value()) {
+            return GetUnifiedFullViewingKey(ufvkMeta.value().GetUFVKId());
+        } else {
+            return std::nullopt;
+        }
+    }
+
+    virtual std::optional<AddressUFVKMetadata> GetUFVKMetadataForAddress(
+            const libzcash::UnifiedAddress& addr) const;
+
+    std::optional<libzcash::ZcashdUnifiedFullViewingKey> GetUFVKForAddress(
+            const libzcash::UnifiedAddress& addr) const {
+        auto ufvkMeta = GetUFVKMetadataForAddress(addr);
+        if (ufvkMeta.has_value()) {
+            return GetUnifiedFullViewingKey(ufvkMeta.value().GetUFVKId());
+        } else {
+            return std::nullopt;
+        }
+    }
+
+    virtual std::optional<libzcash::UFVKId> GetUFVKIdForViewingKey(
+            const libzcash::ViewingKey& vk) const;
+};
+
+typedef std::vector<unsigned char, secure_allocator<unsigned char> > CKeyingMaterial;
+typedef std::map<CKeyID, std::pair<CPubKey, std::vector<unsigned char> > > CryptedKeyMap;
+typedef std::map<libzcash::SproutPaymentAddress, std::vector<unsigned char> > CryptedSproutSpendingKeyMap;
+
+//! Sapling
+typedef std::map<libzcash::SaplingExtendedFullViewingKey, std::vector<unsigned char> > CryptedSaplingSpendingKeyMap;
+
+class FindUFVKId {
+private:
+    const CBasicKeyStore& keystore;
+
+public:
+    FindUFVKId(const CBasicKeyStore& keystore): keystore(keystore) {}
+
+    std::optional<AddressUFVKMetadata> operator()(const libzcash::OrchardRawAddress& orchardAddr) const;
+    std::optional<AddressUFVKMetadata> operator()(const libzcash::SaplingPaymentAddress& saplingAddr) const;
+    std::optional<AddressUFVKMetadata> operator()(const CScriptID& scriptId) const;
+    std::optional<AddressUFVKMetadata> operator()(const CKeyID& keyId) const;
+    std::optional<AddressUFVKMetadata> operator()(const libzcash::UnknownReceiver& receiver) const;
+};
+
+#endif // BITCOIN_KEYSTORE_H
diff --git a/depend/zcash/src/leveldb/.gitignore b/depend/zcash/src/leveldb/.gitignore
new file mode 100644
index 000000000..71d87a4ee
--- /dev/null
+++ b/depend/zcash/src/leveldb/.gitignore
@@ -0,0 +1,13 @@
+build_config.mk
+*.a
+*.o
+*.dylib*
+*.so
+*.so.*
+*_test
+db_bench
+leveldbutil
+Release
+Debug
+Benchmark
+vs2010.*
diff --git a/depend/zcash/src/leveldb/.travis.yml b/depend/zcash/src/leveldb/.travis.yml
new file mode 100644
index 000000000..f5bd74c45
--- /dev/null
+++ b/depend/zcash/src/leveldb/.travis.yml
@@ -0,0 +1,13 @@
+language: cpp
+compiler:
+- clang
+- gcc
+os:
+- linux
+- osx
+sudo: false
+before_install:
+- echo $LANG
+- echo $LC_ALL
+script:
+- make -j 4 check
diff --git a/depend/zcash/src/leveldb/AUTHORS b/depend/zcash/src/leveldb/AUTHORS
new file mode 100644
index 000000000..2439d7a45
--- /dev/null
+++ b/depend/zcash/src/leveldb/AUTHORS
@@ -0,0 +1,12 @@
+# Names should be added to this file like so:
+# Name or Organization <email address>
+
+Google Inc.
+
+# Initial version authors:
+Jeffrey Dean <jeff@google.com>
+Sanjay Ghemawat <sanjay@google.com>
+
+# Partial list of contributors:
+Kevin Regan <kevin.d.regan@gmail.com>
+Johan Bilien <jobi@litl.com>
diff --git a/depend/zcash/src/leveldb/CONTRIBUTING.md b/depend/zcash/src/leveldb/CONTRIBUTING.md
new file mode 100644
index 000000000..cd600ff46
--- /dev/null
+++ b/depend/zcash/src/leveldb/CONTRIBUTING.md
@@ -0,0 +1,36 @@
+# Contributing
+
+We'd love to accept your code patches! However, before we can take them, we
+have to jump a couple of legal hurdles.
+
+## Contributor License Agreements
+
+Please fill out either the individual or corporate Contributor License
+Agreement as appropriate.
+
+* If you are an individual writing original source code and you're sure you
+own the intellectual property, then sign an [individual CLA](https://developers.google.com/open-source/cla/individual).
+* If you work for a company that wants to allow you to contribute your work,
+then sign a [corporate CLA](https://developers.google.com/open-source/cla/corporate).
+
+Follow either of the two links above to access the appropriate CLA and
+instructions for how to sign and return it.
+
+## Submitting a Patch
+
+1. Sign the contributors license agreement above.
+2. Decide which code you want to submit. A submission should be a set of changes
+that addresses one issue in the [issue tracker](https://github.com/google/leveldb/issues).
+Please don't mix more than one logical change per submission, because it makes
+the history hard to follow. If you want to make a change
+(e.g. add a sample or feature) that doesn't have a corresponding issue in the
+issue tracker, please create one.
+3. **Submitting**: When you are ready to submit, send us a Pull Request. Be
+sure to include the issue number you fixed and the name you used to sign
+the CLA.
+
+## Writing Code ##
+
+If your contribution contains code, please make sure that it follows 
+[the style guide](http://google-styleguide.googlecode.com/svn/trunk/cppguide.xml).
+Otherwise we will have to ask you to make changes, and that's no fun for anyone.
diff --git a/depend/zcash/src/leveldb/LICENSE b/depend/zcash/src/leveldb/LICENSE
new file mode 100644
index 000000000..8e80208cd
--- /dev/null
+++ b/depend/zcash/src/leveldb/LICENSE
@@ -0,0 +1,27 @@
+Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+   * Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+   * Redistributions in binary form must reproduce the above
+copyright notice, this list of conditions and the following disclaimer
+in the documentation and/or other materials provided with the
+distribution.
+   * Neither the name of Google Inc. nor the names of its
+contributors may be used to endorse or promote products derived from
+this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
diff --git a/depend/zcash/src/leveldb/Makefile b/depend/zcash/src/leveldb/Makefile
new file mode 100644
index 000000000..f7cc7d736
--- /dev/null
+++ b/depend/zcash/src/leveldb/Makefile
@@ -0,0 +1,424 @@
+# Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+# Use of this source code is governed by a BSD-style license that can be
+# found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#-----------------------------------------------
+# Uncomment exactly one of the lines labelled (A), (B), and (C) below
+# to switch between compilation modes.
+
+# (A) Production use (optimized mode)
+OPT ?= -O2 -DNDEBUG
+# (B) Debug mode, w/ full line-level debugging symbols
+# OPT ?= -g2
+# (C) Profiling mode: opt, but w/debugging symbols
+# OPT ?= -O2 -g2 -DNDEBUG
+#-----------------------------------------------
+
+# detect what platform we're building on
+$(shell CC="$(CC)" CXX="$(CXX)" TARGET_OS="$(TARGET_OS)" \
+    ./build_detect_platform build_config.mk ./)
+# this file is generated by the previous line to set build flags and sources
+include build_config.mk
+
+TESTS = \
+	db/autocompact_test \
+	db/c_test \
+	db/corruption_test \
+	db/db_test \
+	db/dbformat_test \
+	db/fault_injection_test \
+	db/filename_test \
+	db/log_test \
+	db/recovery_test \
+	db/skiplist_test \
+	db/version_edit_test \
+	db/version_set_test \
+	db/write_batch_test \
+	helpers/memenv/memenv_test \
+	issues/issue178_test \
+	issues/issue200_test \
+	table/filter_block_test \
+	table/table_test \
+	util/arena_test \
+	util/bloom_test \
+	util/cache_test \
+	util/coding_test \
+	util/crc32c_test \
+	util/env_posix_test \
+	util/env_test \
+	util/hash_test
+
+UTILS = \
+	db/db_bench \
+	db/leveldbutil
+
+# Put the object files in a subdirectory, but the application at the top of the object dir.
+PROGNAMES := $(notdir $(TESTS) $(UTILS))
+
+# On Linux may need libkyotocabinet-dev for dependency.
+BENCHMARKS = \
+	doc/bench/db_bench_sqlite3 \
+	doc/bench/db_bench_tree_db
+
+CFLAGS += -I. -I./include $(PLATFORM_CCFLAGS) $(OPT)
+CXXFLAGS += -I. -I./include $(PLATFORM_CXXFLAGS) $(OPT)
+
+LDFLAGS += $(PLATFORM_LDFLAGS)
+LIBS += $(PLATFORM_LIBS)
+
+SIMULATOR_OUTDIR=out-ios-x86
+DEVICE_OUTDIR=out-ios-arm
+
+ifeq ($(PLATFORM), IOS)
+# Note: iOS should probably be using libtool, not ar.
+AR=xcrun ar
+SIMULATORSDK=$(shell xcrun -sdk iphonesimulator --show-sdk-path)
+DEVICESDK=$(shell xcrun -sdk iphoneos --show-sdk-path)
+DEVICE_CFLAGS = -isysroot "$(DEVICESDK)" -arch armv6 -arch armv7 -arch armv7s -arch arm64
+SIMULATOR_CFLAGS = -isysroot "$(SIMULATORSDK)" -arch i686 -arch x86_64
+STATIC_OUTDIR=out-ios-universal
+else
+STATIC_OUTDIR=out-static
+SHARED_OUTDIR=out-shared
+STATIC_PROGRAMS := $(addprefix $(STATIC_OUTDIR)/, $(PROGNAMES))
+SHARED_PROGRAMS := $(addprefix $(SHARED_OUTDIR)/, db_bench)
+endif
+
+STATIC_LIBOBJECTS := $(addprefix $(STATIC_OUTDIR)/, $(SOURCES:.cc=.o))
+STATIC_MEMENVOBJECTS := $(addprefix $(STATIC_OUTDIR)/, $(MEMENV_SOURCES:.cc=.o))
+
+DEVICE_LIBOBJECTS := $(addprefix $(DEVICE_OUTDIR)/, $(SOURCES:.cc=.o))
+DEVICE_MEMENVOBJECTS := $(addprefix $(DEVICE_OUTDIR)/, $(MEMENV_SOURCES:.cc=.o))
+
+SIMULATOR_LIBOBJECTS := $(addprefix $(SIMULATOR_OUTDIR)/, $(SOURCES:.cc=.o))
+SIMULATOR_MEMENVOBJECTS := $(addprefix $(SIMULATOR_OUTDIR)/, $(MEMENV_SOURCES:.cc=.o))
+
+SHARED_LIBOBJECTS := $(addprefix $(SHARED_OUTDIR)/, $(SOURCES:.cc=.o))
+SHARED_MEMENVOBJECTS := $(addprefix $(SHARED_OUTDIR)/, $(MEMENV_SOURCES:.cc=.o))
+
+TESTUTIL := $(STATIC_OUTDIR)/util/testutil.o
+TESTHARNESS := $(STATIC_OUTDIR)/util/testharness.o $(TESTUTIL)
+
+STATIC_TESTOBJS := $(addprefix $(STATIC_OUTDIR)/, $(addsuffix .o, $(TESTS)))
+STATIC_UTILOBJS := $(addprefix $(STATIC_OUTDIR)/, $(addsuffix .o, $(UTILS)))
+STATIC_ALLOBJS := $(STATIC_LIBOBJECTS) $(STATIC_MEMENVOBJECTS) $(STATIC_TESTOBJS) $(STATIC_UTILOBJS) $(TESTHARNESS)
+DEVICE_ALLOBJS := $(DEVICE_LIBOBJECTS) $(DEVICE_MEMENVOBJECTS)
+SIMULATOR_ALLOBJS := $(SIMULATOR_LIBOBJECTS) $(SIMULATOR_MEMENVOBJECTS)
+
+default: all
+
+# Should we build shared libraries?
+ifneq ($(PLATFORM_SHARED_EXT),)
+
+# Many leveldb test apps use non-exported API's. Only build a subset for testing.
+SHARED_ALLOBJS := $(SHARED_LIBOBJECTS) $(SHARED_MEMENVOBJECTS) $(TESTHARNESS)
+
+ifneq ($(PLATFORM_SHARED_VERSIONED),true)
+SHARED_LIB1 = libleveldb.$(PLATFORM_SHARED_EXT)
+SHARED_LIB2 = $(SHARED_LIB1)
+SHARED_LIB3 = $(SHARED_LIB1)
+SHARED_LIBS = $(SHARED_LIB1)
+SHARED_MEMENVLIB = $(SHARED_OUTDIR)/libmemenv.a
+else
+# Update db.h if you change these.
+SHARED_VERSION_MAJOR = 1
+SHARED_VERSION_MINOR = 20
+SHARED_LIB1 = libleveldb.$(PLATFORM_SHARED_EXT)
+SHARED_LIB2 = $(SHARED_LIB1).$(SHARED_VERSION_MAJOR)
+SHARED_LIB3 = $(SHARED_LIB1).$(SHARED_VERSION_MAJOR).$(SHARED_VERSION_MINOR)
+SHARED_LIBS = $(SHARED_OUTDIR)/$(SHARED_LIB1) $(SHARED_OUTDIR)/$(SHARED_LIB2) $(SHARED_OUTDIR)/$(SHARED_LIB3)
+$(SHARED_OUTDIR)/$(SHARED_LIB1): $(SHARED_OUTDIR)/$(SHARED_LIB3)
+	ln -fs $(SHARED_LIB3) $(SHARED_OUTDIR)/$(SHARED_LIB1)
+$(SHARED_OUTDIR)/$(SHARED_LIB2): $(SHARED_OUTDIR)/$(SHARED_LIB3)
+	ln -fs $(SHARED_LIB3) $(SHARED_OUTDIR)/$(SHARED_LIB2)
+SHARED_MEMENVLIB = $(SHARED_OUTDIR)/libmemenv.a
+endif
+
+$(SHARED_OUTDIR)/$(SHARED_LIB3): $(SHARED_LIBOBJECTS)
+	$(CXX) $(LDFLAGS) $(PLATFORM_SHARED_LDFLAGS)$(SHARED_LIB2) $(SHARED_LIBOBJECTS) -o $(SHARED_OUTDIR)/$(SHARED_LIB3) $(LIBS)
+
+endif  # PLATFORM_SHARED_EXT
+
+all: $(SHARED_LIBS) $(SHARED_PROGRAMS) $(STATIC_OUTDIR)/libleveldb.a $(STATIC_OUTDIR)/libmemenv.a $(STATIC_PROGRAMS)
+
+check: $(STATIC_PROGRAMS)
+	for t in $(notdir $(TESTS)); do echo "***** Running $$t"; $(STATIC_OUTDIR)/$$t || exit 1; done
+
+clean:
+	-rm -rf out-static out-shared out-ios-x86 out-ios-arm out-ios-universal
+	-rm -f build_config.mk
+	-rm -rf ios-x86 ios-arm
+
+$(STATIC_OUTDIR):
+	mkdir $@
+
+$(STATIC_OUTDIR)/db: | $(STATIC_OUTDIR)
+	mkdir $@
+
+$(STATIC_OUTDIR)/helpers/memenv: | $(STATIC_OUTDIR)
+	mkdir -p $@
+
+$(STATIC_OUTDIR)/port: | $(STATIC_OUTDIR)
+	mkdir $@
+
+$(STATIC_OUTDIR)/table: | $(STATIC_OUTDIR)
+	mkdir $@
+
+$(STATIC_OUTDIR)/util: | $(STATIC_OUTDIR)
+	mkdir $@
+
+.PHONY: STATIC_OBJDIRS
+STATIC_OBJDIRS: \
+	$(STATIC_OUTDIR)/db \
+	$(STATIC_OUTDIR)/port \
+	$(STATIC_OUTDIR)/table \
+	$(STATIC_OUTDIR)/util \
+	$(STATIC_OUTDIR)/helpers/memenv
+
+$(SHARED_OUTDIR):
+	mkdir $@
+
+$(SHARED_OUTDIR)/db: | $(SHARED_OUTDIR)
+	mkdir $@
+
+$(SHARED_OUTDIR)/helpers/memenv: | $(SHARED_OUTDIR)
+	mkdir -p $@
+
+$(SHARED_OUTDIR)/port: | $(SHARED_OUTDIR)
+	mkdir $@
+
+$(SHARED_OUTDIR)/table: | $(SHARED_OUTDIR)
+	mkdir $@
+
+$(SHARED_OUTDIR)/util: | $(SHARED_OUTDIR)
+	mkdir $@
+
+.PHONY: SHARED_OBJDIRS
+SHARED_OBJDIRS: \
+	$(SHARED_OUTDIR)/db \
+	$(SHARED_OUTDIR)/port \
+	$(SHARED_OUTDIR)/table \
+	$(SHARED_OUTDIR)/util \
+	$(SHARED_OUTDIR)/helpers/memenv
+
+$(DEVICE_OUTDIR):
+	mkdir $@
+
+$(DEVICE_OUTDIR)/db: | $(DEVICE_OUTDIR)
+	mkdir $@
+
+$(DEVICE_OUTDIR)/helpers/memenv: | $(DEVICE_OUTDIR)
+	mkdir -p $@
+
+$(DEVICE_OUTDIR)/port: | $(DEVICE_OUTDIR)
+	mkdir $@
+
+$(DEVICE_OUTDIR)/table: | $(DEVICE_OUTDIR)
+	mkdir $@
+
+$(DEVICE_OUTDIR)/util: | $(DEVICE_OUTDIR)
+	mkdir $@
+
+.PHONY: DEVICE_OBJDIRS
+DEVICE_OBJDIRS: \
+	$(DEVICE_OUTDIR)/db \
+	$(DEVICE_OUTDIR)/port \
+	$(DEVICE_OUTDIR)/table \
+	$(DEVICE_OUTDIR)/util \
+	$(DEVICE_OUTDIR)/helpers/memenv
+
+$(SIMULATOR_OUTDIR):
+	mkdir $@
+
+$(SIMULATOR_OUTDIR)/db: | $(SIMULATOR_OUTDIR)
+	mkdir $@
+
+$(SIMULATOR_OUTDIR)/helpers/memenv: | $(SIMULATOR_OUTDIR)
+	mkdir -p $@
+
+$(SIMULATOR_OUTDIR)/port: | $(SIMULATOR_OUTDIR)
+	mkdir $@
+
+$(SIMULATOR_OUTDIR)/table: | $(SIMULATOR_OUTDIR)
+	mkdir $@
+
+$(SIMULATOR_OUTDIR)/util: | $(SIMULATOR_OUTDIR)
+	mkdir $@
+
+.PHONY: SIMULATOR_OBJDIRS
+SIMULATOR_OBJDIRS: \
+	$(SIMULATOR_OUTDIR)/db \
+	$(SIMULATOR_OUTDIR)/port \
+	$(SIMULATOR_OUTDIR)/table \
+	$(SIMULATOR_OUTDIR)/util \
+	$(SIMULATOR_OUTDIR)/helpers/memenv
+
+$(STATIC_ALLOBJS): | STATIC_OBJDIRS
+$(DEVICE_ALLOBJS): | DEVICE_OBJDIRS
+$(SIMULATOR_ALLOBJS): | SIMULATOR_OBJDIRS
+$(SHARED_ALLOBJS): | SHARED_OBJDIRS
+
+ifeq ($(PLATFORM), IOS)
+$(DEVICE_OUTDIR)/libleveldb.a: $(DEVICE_LIBOBJECTS)
+	rm -f $@
+	$(AR) -rs $@ $(DEVICE_LIBOBJECTS)
+
+$(SIMULATOR_OUTDIR)/libleveldb.a: $(SIMULATOR_LIBOBJECTS)
+	rm -f $@
+	$(AR) -rs $@ $(SIMULATOR_LIBOBJECTS)
+
+$(DEVICE_OUTDIR)/libmemenv.a: $(DEVICE_MEMENVOBJECTS)
+	rm -f $@
+	$(AR) -rs $@ $(DEVICE_MEMENVOBJECTS)
+
+$(SIMULATOR_OUTDIR)/libmemenv.a: $(SIMULATOR_MEMENVOBJECTS)
+	rm -f $@
+	$(AR) -rs $@ $(SIMULATOR_MEMENVOBJECTS)
+
+# For iOS, create universal object libraries to be used on both the simulator and
+# a device.
+$(STATIC_OUTDIR)/libleveldb.a: $(STATIC_OUTDIR) $(DEVICE_OUTDIR)/libleveldb.a $(SIMULATOR_OUTDIR)/libleveldb.a
+	lipo -create $(DEVICE_OUTDIR)/libleveldb.a $(SIMULATOR_OUTDIR)/libleveldb.a -output $@
+
+$(STATIC_OUTDIR)/libmemenv.a: $(STATIC_OUTDIR) $(DEVICE_OUTDIR)/libmemenv.a $(SIMULATOR_OUTDIR)/libmemenv.a
+	lipo -create $(DEVICE_OUTDIR)/libmemenv.a $(SIMULATOR_OUTDIR)/libmemenv.a -output $@
+else
+$(STATIC_OUTDIR)/libleveldb.a:$(STATIC_LIBOBJECTS)
+	rm -f $@
+	$(AR) -rs $@ $(STATIC_LIBOBJECTS)
+
+$(STATIC_OUTDIR)/libmemenv.a:$(STATIC_MEMENVOBJECTS)
+	rm -f $@
+	$(AR) -rs $@ $(STATIC_MEMENVOBJECTS)
+endif
+
+$(SHARED_MEMENVLIB):$(SHARED_MEMENVOBJECTS)
+	rm -f $@
+	$(AR) -rs $@ $(SHARED_MEMENVOBJECTS)
+
+$(STATIC_OUTDIR)/db_bench:db/db_bench.cc $(STATIC_LIBOBJECTS) $(TESTUTIL)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) db/db_bench.cc $(STATIC_LIBOBJECTS) $(TESTUTIL) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/db_bench_sqlite3:doc/bench/db_bench_sqlite3.cc $(STATIC_LIBOBJECTS) $(TESTUTIL)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) doc/bench/db_bench_sqlite3.cc $(STATIC_LIBOBJECTS) $(TESTUTIL) -o $@ -lsqlite3 $(LIBS)
+
+$(STATIC_OUTDIR)/db_bench_tree_db:doc/bench/db_bench_tree_db.cc $(STATIC_LIBOBJECTS) $(TESTUTIL)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) doc/bench/db_bench_tree_db.cc $(STATIC_LIBOBJECTS) $(TESTUTIL) -o $@ -lkyotocabinet $(LIBS)
+
+$(STATIC_OUTDIR)/leveldbutil:db/leveldbutil.cc $(STATIC_LIBOBJECTS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) db/leveldbutil.cc $(STATIC_LIBOBJECTS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/arena_test:util/arena_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) util/arena_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/autocompact_test:db/autocompact_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) db/autocompact_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/bloom_test:util/bloom_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) util/bloom_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/c_test:$(STATIC_OUTDIR)/db/c_test.o $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(STATIC_OUTDIR)/db/c_test.o $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/cache_test:util/cache_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) util/cache_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/coding_test:util/coding_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) util/coding_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/corruption_test:db/corruption_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) db/corruption_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/crc32c_test:util/crc32c_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) util/crc32c_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/db_test:db/db_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) db/db_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/dbformat_test:db/dbformat_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) db/dbformat_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/env_posix_test:util/env_posix_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) util/env_posix_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/env_test:util/env_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) util/env_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/fault_injection_test:db/fault_injection_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) db/fault_injection_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/filename_test:db/filename_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) db/filename_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/filter_block_test:table/filter_block_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) table/filter_block_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/hash_test:util/hash_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) util/hash_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/issue178_test:issues/issue178_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) issues/issue178_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/issue200_test:issues/issue200_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) issues/issue200_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/log_test:db/log_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) db/log_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/recovery_test:db/recovery_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) db/recovery_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/table_test:table/table_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) table/table_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/skiplist_test:db/skiplist_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) db/skiplist_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/version_edit_test:db/version_edit_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) db/version_edit_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/version_set_test:db/version_set_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) db/version_set_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/write_batch_test:db/write_batch_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS)
+	$(CXX) $(LDFLAGS) $(CXXFLAGS) db/write_batch_test.cc $(STATIC_LIBOBJECTS) $(TESTHARNESS) -o $@ $(LIBS)
+
+$(STATIC_OUTDIR)/memenv_test:$(STATIC_OUTDIR)/helpers/memenv/memenv_test.o $(STATIC_OUTDIR)/libmemenv.a $(STATIC_OUTDIR)/libleveldb.a $(TESTHARNESS)
+	$(XCRUN) $(CXX) $(LDFLAGS) $(STATIC_OUTDIR)/helpers/memenv/memenv_test.o $(STATIC_OUTDIR)/libmemenv.a $(STATIC_OUTDIR)/libleveldb.a $(TESTHARNESS) -o $@ $(LIBS)
+
+$(SHARED_OUTDIR)/db_bench:$(SHARED_OUTDIR)/db/db_bench.o $(SHARED_LIBS) $(TESTUTIL)
+	$(XCRUN) $(CXX) $(LDFLAGS) $(CXXFLAGS) $(PLATFORM_SHARED_CFLAGS) $(SHARED_OUTDIR)/db/db_bench.o $(TESTUTIL) $(SHARED_OUTDIR)/$(SHARED_LIB3) -o $@ $(LIBS)
+
+.PHONY: run-shared
+run-shared: $(SHARED_OUTDIR)/db_bench
+	LD_LIBRARY_PATH=$(SHARED_OUTDIR) $(SHARED_OUTDIR)/db_bench
+
+$(SIMULATOR_OUTDIR)/%.o: %.cc
+	xcrun -sdk iphonesimulator $(CXX) $(CXXFLAGS) $(SIMULATOR_CFLAGS) -c $< -o $@
+
+$(DEVICE_OUTDIR)/%.o: %.cc
+	xcrun -sdk iphoneos $(CXX) $(CXXFLAGS) $(DEVICE_CFLAGS) -c $< -o $@
+
+$(SIMULATOR_OUTDIR)/%.o: %.c
+	xcrun -sdk iphonesimulator $(CC) $(CFLAGS) $(SIMULATOR_CFLAGS) -c $< -o $@
+
+$(DEVICE_OUTDIR)/%.o: %.c
+	xcrun -sdk iphoneos $(CC) $(CFLAGS) $(DEVICE_CFLAGS) -c $< -o $@
+
+$(STATIC_OUTDIR)/%.o: %.cc
+	$(CXX) $(CXXFLAGS) -c $< -o $@
+
+$(STATIC_OUTDIR)/%.o: %.c
+	$(CC) $(CFLAGS) -c $< -o $@
+
+$(SHARED_OUTDIR)/%.o: %.cc
+	$(CXX) $(CXXFLAGS) $(PLATFORM_SHARED_CFLAGS) -c $< -o $@
+
+$(SHARED_OUTDIR)/%.o: %.c
+	$(CC) $(CFLAGS) $(PLATFORM_SHARED_CFLAGS) -c $< -o $@
+
+$(STATIC_OUTDIR)/port/port_posix_sse.o: port/port_posix_sse.cc
+	$(CXX) $(CXXFLAGS) $(PLATFORM_SSEFLAGS) -c $< -o $@
+
+$(SHARED_OUTDIR)/port/port_posix_sse.o: port/port_posix_sse.cc
+	$(CXX) $(CXXFLAGS) $(PLATFORM_SHARED_CFLAGS) $(PLATFORM_SSEFLAGS) -c $< -o $@
diff --git a/depend/zcash/src/leveldb/NEWS b/depend/zcash/src/leveldb/NEWS
new file mode 100644
index 000000000..3fd99242d
--- /dev/null
+++ b/depend/zcash/src/leveldb/NEWS
@@ -0,0 +1,17 @@
+Release 1.2 2011-05-16
+----------------------
+
+Fixes for larger databases (tested up to one billion 100-byte entries,
+i.e., ~100GB).
+
+(1) Place hard limit on number of level-0 files.  This fixes errors
+of the form "too many open files".
+
+(2) Fixed memtable management.  Before the fix, a heavy write burst
+could cause unbounded memory usage.
+
+A fix for a logging bug where the reader would incorrectly complain
+about corruption.
+
+Allow public access to WriteBatch contents so that users can easily
+wrap a DB.
diff --git a/depend/zcash/src/leveldb/README.md b/depend/zcash/src/leveldb/README.md
new file mode 100644
index 000000000..a010c5085
--- /dev/null
+++ b/depend/zcash/src/leveldb/README.md
@@ -0,0 +1,174 @@
+**LevelDB is a fast key-value storage library written at Google that provides an ordered mapping from string keys to string values.**
+
+[![Build Status](https://travis-ci.org/google/leveldb.svg?branch=master)](https://travis-ci.org/google/leveldb)
+
+Authors: Sanjay Ghemawat (sanjay@google.com) and Jeff Dean (jeff@google.com)
+
+# Features
+  * Keys and values are arbitrary byte arrays.
+  * Data is stored sorted by key.
+  * Callers can provide a custom comparison function to override the sort order.
+  * The basic operations are `Put(key,value)`, `Get(key)`, `Delete(key)`.
+  * Multiple changes can be made in one atomic batch.
+  * Users can create a transient snapshot to get a consistent view of data.
+  * Forward and backward iteration is supported over the data.
+  * Data is automatically compressed using the [Snappy compression library](http://google.github.io/snappy/).
+  * External activity (file system operations etc.) is relayed through a virtual interface so users can customize the operating system interactions.
+
+# Documentation
+  [LevelDB library documentation](https://github.com/google/leveldb/blob/master/doc/index.md) is online and bundled with the source code.
+
+
+# Limitations
+  * This is not a SQL database.  It does not have a relational data model, it does not support SQL queries, and it has no support for indexes.
+  * Only a single process (possibly multi-threaded) can access a particular database at a time.
+  * There is no client-server support builtin to the library.  An application that needs such support will have to wrap their own server around the library.
+
+# Contributing to the leveldb Project
+The leveldb project welcomes contributions. leveldb's primary goal is to be
+a reliable and fast key/value store. Changes that are in line with the
+features/limitations outlined above, and meet the requirements below,
+will be considered.
+
+Contribution requirements:
+
+1. **POSIX only**. We _generally_ will only accept changes that are both
+   compiled, and tested on a POSIX platform - usually Linux. Very small
+   changes will sometimes be accepted, but consider that more of an
+   exception than the rule.
+
+2. **Stable API**. We strive very hard to maintain a stable API. Changes that
+   require changes for projects using leveldb _might_ be rejected without
+   sufficient benefit to the project.
+
+3. **Tests**: All changes must be accompanied by a new (or changed) test, or
+   a sufficient explanation as to why a new (or changed) test is not required.
+
+## Submitting a Pull Request
+Before any pull request will be accepted the author must first sign a
+Contributor License Agreement (CLA) at https://cla.developers.google.com/.
+
+In order to keep the commit timeline linear
+[squash](https://git-scm.com/book/en/v2/Git-Tools-Rewriting-History#Squashing-Commits)
+your changes down to a single commit and [rebase](https://git-scm.com/docs/git-rebase)
+on google/leveldb/master. This keeps the commit timeline linear and more easily sync'ed
+with the internal repository at Google. More information at GitHub's
+[About Git rebase](https://help.github.com/articles/about-git-rebase/) page.
+
+# Performance
+
+Here is a performance report (with explanations) from the run of the
+included db_bench program.  The results are somewhat noisy, but should
+be enough to get a ballpark performance estimate.
+
+## Setup
+
+We use a database with a million entries.  Each entry has a 16 byte
+key, and a 100 byte value.  Values used by the benchmark compress to
+about half their original size.
+
+    LevelDB:    version 1.1
+    Date:       Sun May  1 12:11:26 2011
+    CPU:        4 x Intel(R) Core(TM)2 Quad CPU    Q6600  @ 2.40GHz
+    CPUCache:   4096 KB
+    Keys:       16 bytes each
+    Values:     100 bytes each (50 bytes after compression)
+    Entries:    1000000
+    Raw Size:   110.6 MB (estimated)
+    File Size:  62.9 MB (estimated)
+
+## Write performance
+
+The "fill" benchmarks create a brand new database, in either
+sequential, or random order.  The "fillsync" benchmark flushes data
+from the operating system to the disk after every operation; the other
+write operations leave the data sitting in the operating system buffer
+cache for a while.  The "overwrite" benchmark does random writes that
+update existing keys in the database.
+
+    fillseq      :       1.765 micros/op;   62.7 MB/s
+    fillsync     :     268.409 micros/op;    0.4 MB/s (10000 ops)
+    fillrandom   :       2.460 micros/op;   45.0 MB/s
+    overwrite    :       2.380 micros/op;   46.5 MB/s
+
+Each "op" above corresponds to a write of a single key/value pair.
+I.e., a random write benchmark goes at approximately 400,000 writes per second.
+
+Each "fillsync" operation costs much less (0.3 millisecond)
+than a disk seek (typically 10 milliseconds).  We suspect that this is
+because the hard disk itself is buffering the update in its memory and
+responding before the data has been written to the platter.  This may
+or may not be safe based on whether or not the hard disk has enough
+power to save its memory in the event of a power failure.
+
+## Read performance
+
+We list the performance of reading sequentially in both the forward
+and reverse direction, and also the performance of a random lookup.
+Note that the database created by the benchmark is quite small.
+Therefore the report characterizes the performance of leveldb when the
+working set fits in memory.  The cost of reading a piece of data that
+is not present in the operating system buffer cache will be dominated
+by the one or two disk seeks needed to fetch the data from disk.
+Write performance will be mostly unaffected by whether or not the
+working set fits in memory.
+
+    readrandom  : 16.677 micros/op;  (approximately 60,000 reads per second)
+    readseq     :  0.476 micros/op;  232.3 MB/s
+    readreverse :  0.724 micros/op;  152.9 MB/s
+
+LevelDB compacts its underlying storage data in the background to
+improve read performance.  The results listed above were done
+immediately after a lot of random writes.  The results after
+compactions (which are usually triggered automatically) are better.
+
+    readrandom  : 11.602 micros/op;  (approximately 85,000 reads per second)
+    readseq     :  0.423 micros/op;  261.8 MB/s
+    readreverse :  0.663 micros/op;  166.9 MB/s
+
+Some of the high cost of reads comes from repeated decompression of blocks
+read from disk.  If we supply enough cache to the leveldb so it can hold the
+uncompressed blocks in memory, the read performance improves again:
+
+    readrandom  : 9.775 micros/op;  (approximately 100,000 reads per second before compaction)
+    readrandom  : 5.215 micros/op;  (approximately 190,000 reads per second after compaction)
+
+## Repository contents
+
+See [doc/index.md](doc/index.md) for more explanation. See
+[doc/impl.md](doc/impl.md) for a brief overview of the implementation.
+
+The public interface is in include/*.h.  Callers should not include or
+rely on the details of any other header files in this package.  Those
+internal APIs may be changed without warning.
+
+Guide to header files:
+
+* **include/db.h**: Main interface to the DB: Start here
+
+* **include/options.h**: Control over the behavior of an entire database,
+and also control over the behavior of individual reads and writes.
+
+* **include/comparator.h**: Abstraction for user-specified comparison function.
+If you want just bytewise comparison of keys, you can use the default
+comparator, but clients can write their own comparator implementations if they
+want custom ordering (e.g. to handle different character encodings, etc.)
+
+* **include/iterator.h**: Interface for iterating over data. You can get
+an iterator from a DB object.
+
+* **include/write_batch.h**: Interface for atomically applying multiple
+updates to a database.
+
+* **include/slice.h**: A simple module for maintaining a pointer and a
+length into some other byte array.
+
+* **include/status.h**: Status is returned from many of the public interfaces
+and is used to report success and various kinds of errors.
+
+* **include/env.h**:
+Abstraction of the OS environment.  A posix implementation of this interface is
+in util/env_posix.cc
+
+* **include/table.h, include/table_builder.h**: Lower-level modules that most
+clients probably won't use directly
diff --git a/depend/zcash/src/leveldb/TODO b/depend/zcash/src/leveldb/TODO
new file mode 100644
index 000000000..e603c0713
--- /dev/null
+++ b/depend/zcash/src/leveldb/TODO
@@ -0,0 +1,14 @@
+ss
+- Stats
+
+db
+- Maybe implement DB::BulkDeleteForRange(start_key, end_key)
+  that would blow away files whose ranges are entirely contained
+  within [start_key..end_key]?  For Chrome, deletion of obsolete
+  object stores, etc. can be done in the background anyway, so
+  probably not that important.
+- There have been requests for MultiGet.
+
+After a range is completely deleted, what gets rid of the
+corresponding files if we do no future changes to that range.  Make
+the conditions for triggering compactions fire in more situations?
diff --git a/depend/zcash/src/leveldb/WINDOWS.md b/depend/zcash/src/leveldb/WINDOWS.md
new file mode 100644
index 000000000..5b76c2448
--- /dev/null
+++ b/depend/zcash/src/leveldb/WINDOWS.md
@@ -0,0 +1,39 @@
+# Building LevelDB On Windows
+
+## Prereqs 
+
+Install the [Windows Software Development Kit version 7.1](http://www.microsoft.com/downloads/dlx/en-us/listdetailsview.aspx?FamilyID=6b6c21d2-2006-4afa-9702-529fa782d63b).
+
+Download and extract the [Snappy source distribution](http://snappy.googlecode.com/files/snappy-1.0.5.tar.gz)
+
+1. Open the "Windows SDK 7.1 Command Prompt" :
+   Start Menu -> "Microsoft Windows SDK v7.1" > "Windows SDK 7.1 Command Prompt"
+2. Change the directory to the leveldb project
+
+## Building the Static lib 
+
+* 32 bit Version 
+
+        setenv /x86
+        msbuild.exe /p:Configuration=Release /p:Platform=Win32 /p:Snappy=..\snappy-1.0.5
+
+* 64 bit Version 
+
+        setenv /x64
+        msbuild.exe /p:Configuration=Release /p:Platform=x64 /p:Snappy=..\snappy-1.0.5
+
+
+## Building and Running the Benchmark app
+
+* 32 bit Version 
+
+	    setenv /x86
+	    msbuild.exe /p:Configuration=Benchmark /p:Platform=Win32 /p:Snappy=..\snappy-1.0.5
+		Benchmark\leveldb.exe
+
+* 64 bit Version 
+
+	    setenv /x64
+	    msbuild.exe /p:Configuration=Benchmark /p:Platform=x64 /p:Snappy=..\snappy-1.0.5
+	    x64\Benchmark\leveldb.exe
+
diff --git a/depend/zcash/src/leveldb/build_detect_platform b/depend/zcash/src/leveldb/build_detect_platform
new file mode 100755
index 000000000..ce8f3f9ce
--- /dev/null
+++ b/depend/zcash/src/leveldb/build_detect_platform
@@ -0,0 +1,250 @@
+#!/bin/sh
+#
+# Detects OS we're compiling on and outputs a file specified by the first
+# argument, which in turn gets read while processing Makefile.
+#
+# The output will set the following variables:
+#   CC                          C Compiler path
+#   CXX                         C++ Compiler path
+#   PLATFORM_LDFLAGS            Linker flags
+#   PLATFORM_LIBS               Libraries flags
+#   PLATFORM_SHARED_EXT         Extension for shared libraries
+#   PLATFORM_SHARED_LDFLAGS     Flags for building shared library
+#                               This flag is embedded just before the name
+#                               of the shared library without intervening spaces
+#   PLATFORM_SHARED_CFLAGS      Flags for compiling objects for shared library
+#   PLATFORM_CCFLAGS            C compiler flags
+#   PLATFORM_CXXFLAGS           C++ compiler flags.  Will contain:
+#   PLATFORM_SHARED_VERSIONED   Set to 'true' if platform supports versioned
+#                               shared libraries, empty otherwise.
+#
+# The PLATFORM_CCFLAGS and PLATFORM_CXXFLAGS might include the following:
+#
+#       -DLEVELDB_ATOMIC_PRESENT     if <atomic> is present
+#       -DLEVELDB_PLATFORM_POSIX     for Posix-based platforms
+#       -DSNAPPY                     if the Snappy library is present
+#
+
+OUTPUT=$1
+PREFIX=$2
+if test -z "$OUTPUT" || test -z "$PREFIX"; then
+  echo "usage: $0 <output-filename> <directory_prefix>" >&2
+  exit 1
+fi
+
+# Delete existing output, if it exists
+rm -f $OUTPUT
+touch $OUTPUT
+
+if test -z "$CC"; then
+    CC=cc
+fi
+
+if test -z "$CXX"; then
+    CXX=g++
+fi
+
+if test -z "$TMPDIR"; then
+    TMPDIR=/tmp
+fi
+
+# Detect OS
+if test -z "$TARGET_OS"; then
+    TARGET_OS=`uname -s`
+fi
+
+COMMON_FLAGS=
+CROSS_COMPILE=
+PLATFORM_CCFLAGS=
+PLATFORM_CXXFLAGS="-std=c++17"
+PLATFORM_LDFLAGS=
+PLATFORM_LIBS=
+PLATFORM_SHARED_EXT="so"
+PLATFORM_SHARED_LDFLAGS="-shared -Wl,-soname -Wl,"
+PLATFORM_SHARED_CFLAGS="-fPIC"
+PLATFORM_SHARED_VERSIONED=true
+PLATFORM_SSEFLAGS=
+
+MEMCMP_FLAG=
+if [ "$CXX" = "g++" ]; then
+    # Use libc's memcmp instead of GCC's memcmp.  This results in ~40%
+    # performance improvement on readrandom under gcc 4.4.3 on Linux/x86.
+    MEMCMP_FLAG="-fno-builtin-memcmp"
+fi
+
+case "$TARGET_OS" in
+    CYGWIN_*)
+        PLATFORM=OS_LINUX
+        COMMON_FLAGS="$MEMCMP_FLAG -lpthread -DOS_LINUX -DCYGWIN"
+        PLATFORM_LDFLAGS="-lpthread"
+        PORT_FILE=port/port_posix.cc
+        PORT_SSE_FILE=port/port_posix_sse.cc
+        ;;
+    Darwin)
+        PLATFORM=OS_MACOSX
+        COMMON_FLAGS="$MEMCMP_FLAG -DOS_MACOSX"
+        PLATFORM_SHARED_EXT=dylib
+        [ -z "$INSTALL_PATH" ] && INSTALL_PATH=`pwd`
+        PLATFORM_SHARED_LDFLAGS="-dynamiclib -install_name $INSTALL_PATH/"
+        PORT_FILE=port/port_posix.cc
+        PORT_SSE_FILE=port/port_posix_sse.cc
+        ;;
+    Linux)
+        PLATFORM=OS_LINUX
+        COMMON_FLAGS="$MEMCMP_FLAG -pthread -DOS_LINUX"
+        PLATFORM_LDFLAGS="-pthread"
+        PORT_FILE=port/port_posix.cc
+        PORT_SSE_FILE=port/port_posix_sse.cc
+        ;;
+    SunOS)
+        PLATFORM=OS_SOLARIS
+        COMMON_FLAGS="$MEMCMP_FLAG -D_REENTRANT -DOS_SOLARIS"
+        PLATFORM_LIBS="-lpthread -lrt"
+        PORT_FILE=port/port_posix.cc
+        PORT_SSE_FILE=port/port_posix_sse.cc
+        ;;
+    FreeBSD)
+        PLATFORM=OS_FREEBSD
+        COMMON_FLAGS="$MEMCMP_FLAG -D_REENTRANT -DOS_FREEBSD"
+        PLATFORM_LIBS="-lpthread"
+        PORT_FILE=port/port_posix.cc
+        PORT_SSE_FILE=port/port_posix_sse.cc
+        ;;
+    GNU/kFreeBSD)
+        PLATFORM=OS_KFREEBSD
+        COMMON_FLAGS="$MEMCMP_FLAG -D_REENTRANT -DOS_KFREEBSD"
+        PLATFORM_LIBS="-lpthread"
+        PORT_FILE=port/port_posix.cc
+        ;;
+    NetBSD)
+        PLATFORM=OS_NETBSD
+        COMMON_FLAGS="$MEMCMP_FLAG -D_REENTRANT -DOS_NETBSD"
+        PLATFORM_LIBS="-lpthread -lgcc_s"
+        PORT_FILE=port/port_posix.cc
+        PORT_SSE_FILE=port/port_posix_sse.cc
+        ;;
+    OpenBSD)
+        PLATFORM=OS_OPENBSD
+        COMMON_FLAGS="$MEMCMP_FLAG -D_REENTRANT -DOS_OPENBSD"
+        PLATFORM_LDFLAGS="-pthread"
+        PORT_FILE=port/port_posix.cc
+        PORT_SSE_FILE=port/port_posix_sse.cc
+        ;;
+    DragonFly)
+        PLATFORM=OS_DRAGONFLYBSD
+        COMMON_FLAGS="$MEMCMP_FLAG -D_REENTRANT -DOS_DRAGONFLYBSD"
+        PLATFORM_LIBS="-lpthread"
+        PORT_FILE=port/port_posix.cc
+        PORT_SSE_FILE=port/port_posix_sse.cc
+        ;;
+    OS_ANDROID_CROSSCOMPILE)
+        PLATFORM=OS_ANDROID
+        COMMON_FLAGS="$MEMCMP_FLAG -D_REENTRANT -DOS_ANDROID -DLEVELDB_PLATFORM_POSIX"
+        PLATFORM_LDFLAGS=""  # All pthread features are in the Android C library
+        PORT_FILE=port/port_posix.cc
+        PORT_SSE_FILE=port/port_posix_sse.cc
+        CROSS_COMPILE=true
+        ;;
+    HP-UX)
+        PLATFORM=OS_HPUX
+        COMMON_FLAGS="$MEMCMP_FLAG -D_REENTRANT -DOS_HPUX"
+        PLATFORM_LDFLAGS="-pthread"
+        PORT_FILE=port/port_posix.cc
+        PORT_SSE_FILE=port/port_posix_sse.cc
+        # man ld: +h internal_name
+        PLATFORM_SHARED_LDFLAGS="-shared -Wl,+h -Wl,"
+        ;;
+    IOS)
+        PLATFORM=IOS
+        COMMON_FLAGS="$MEMCMP_FLAG -DOS_MACOSX"
+        [ -z "$INSTALL_PATH" ] && INSTALL_PATH=`pwd`
+        PORT_FILE=port/port_posix.cc
+        PORT_SSE_FILE=port/port_posix_sse.cc
+        PLATFORM_SHARED_EXT=
+        PLATFORM_SHARED_LDFLAGS=
+        PLATFORM_SHARED_CFLAGS=
+        PLATFORM_SHARED_VERSIONED=
+        ;;
+    OS_WINDOWS_CROSSCOMPILE | NATIVE_WINDOWS)
+        PLATFORM=OS_WINDOWS
+        COMMON_FLAGS="-fno-builtin-memcmp -D_REENTRANT -DOS_WINDOWS -DLEVELDB_PLATFORM_WINDOWS -DWINVER=0x0500 -D__USE_MINGW_ANSI_STDIO=1"
+        PLATFORM_SOURCES="util/env_win.cc"
+        PLATFORM_LIBS="-lshlwapi"
+        PORT_FILE=port/port_win.cc
+        CROSS_COMPILE=true
+        ;;
+    *)
+        echo "Unknown platform!" >&2
+        exit 1
+esac
+
+# We want to make a list of all cc files within util, db, table, and helpers
+# except for the test and benchmark files. By default, find will output a list
+# of all files matching either rule, so we need to append -print to make the
+# prune take effect.
+DIRS="$PREFIX/db $PREFIX/util $PREFIX/table"
+
+set -f # temporarily disable globbing so that our patterns aren't expanded
+PRUNE_TEST="-name *test*.cc -prune"
+PRUNE_BENCH="-name *_bench.cc -prune"
+PRUNE_TOOL="-name leveldbutil.cc -prune"
+PORTABLE_FILES=`find $DIRS $PRUNE_TEST -o $PRUNE_BENCH -o $PRUNE_TOOL -o -name '*.cc' -print | sort | sed "s,^$PREFIX/,," | tr "\n" " "`
+
+set +f # re-enable globbing
+
+# The sources consist of the portable files, plus the platform-specific port
+# file.
+echo "SOURCES=$PORTABLE_FILES $PORT_FILE $PORT_SSE_FILE" >> $OUTPUT
+echo "MEMENV_SOURCES=helpers/memenv/memenv.cc" >> $OUTPUT
+
+if [ "$CROSS_COMPILE" = "true" ]; then
+    # Cross-compiling; do not try any compilation tests.
+    true
+else
+    CXXOUTPUT="${TMPDIR}/leveldb_build_detect_platform-cxx.$$"
+
+    # As -std=c++17 works, use <atomic> as fallback for when memory barriers
+    # are not available.
+    COMMON_FLAGS="$COMMON_FLAGS -DLEVELDB_PLATFORM_POSIX -DLEVELDB_ATOMIC_PRESENT"
+
+    # Test whether tcmalloc is available
+    $CXX $CXXFLAGS -x c++ - -o $CXXOUTPUT -ltcmalloc 2>/dev/null  <<EOF
+      int main() {}
+EOF
+    if [ "$?" = 0 ]; then
+        PLATFORM_LIBS="$PLATFORM_LIBS -ltcmalloc"
+    fi
+
+    rm -f $CXXOUTPUT 2>/dev/null
+
+    # Test if gcc SSE 4.2 is supported
+    $CXX $CXXFLAGS -x c++ - -o $CXXOUTPUT -msse4.2 2>/dev/null  <<EOF
+      int main() {}
+EOF
+    if [ "$?" = 0 ]; then
+        PLATFORM_SSEFLAGS="-msse4.2"
+    fi
+
+    rm -f $CXXOUTPUT 2>/dev/null
+fi
+
+# Use the SSE 4.2 CRC32C intrinsics iff runtime checks indicate compiler supports them.
+if [ -n "$PLATFORM_SSEFLAGS" ]; then
+    PLATFORM_SSEFLAGS="$PLATFORM_SSEFLAGS -DLEVELDB_PLATFORM_POSIX_SSE"
+fi
+
+PLATFORM_CCFLAGS="$PLATFORM_CCFLAGS $COMMON_FLAGS"
+PLATFORM_CXXFLAGS="$PLATFORM_CXXFLAGS $COMMON_FLAGS"
+
+echo "CC=$CC" >> $OUTPUT
+echo "CXX=$CXX" >> $OUTPUT
+echo "PLATFORM=$PLATFORM" >> $OUTPUT
+echo "PLATFORM_LDFLAGS=$PLATFORM_LDFLAGS" >> $OUTPUT
+echo "PLATFORM_LIBS=$PLATFORM_LIBS" >> $OUTPUT
+echo "PLATFORM_CCFLAGS=$PLATFORM_CCFLAGS" >> $OUTPUT
+echo "PLATFORM_CXXFLAGS=$PLATFORM_CXXFLAGS" >> $OUTPUT
+echo "PLATFORM_SSEFLAGS=$PLATFORM_SSEFLAGS" >> $OUTPUT
+echo "PLATFORM_SHARED_CFLAGS=$PLATFORM_SHARED_CFLAGS" >> $OUTPUT
+echo "PLATFORM_SHARED_EXT=$PLATFORM_SHARED_EXT" >> $OUTPUT
+echo "PLATFORM_SHARED_LDFLAGS=$PLATFORM_SHARED_LDFLAGS" >> $OUTPUT
+echo "PLATFORM_SHARED_VERSIONED=$PLATFORM_SHARED_VERSIONED" >> $OUTPUT
diff --git a/depend/zcash/src/leveldb/db/autocompact_test.cc b/depend/zcash/src/leveldb/db/autocompact_test.cc
new file mode 100644
index 000000000..d20a2362c
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/autocompact_test.cc
@@ -0,0 +1,118 @@
+// Copyright (c) 2013 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "leveldb/db.h"
+#include "db/db_impl.h"
+#include "leveldb/cache.h"
+#include "util/testharness.h"
+#include "util/testutil.h"
+
+namespace leveldb {
+
+class AutoCompactTest {
+ public:
+  std::string dbname_;
+  Cache* tiny_cache_;
+  Options options_;
+  DB* db_;
+
+  AutoCompactTest() {
+    dbname_ = test::TmpDir() + "/autocompact_test";
+    tiny_cache_ = NewLRUCache(100);
+    options_.block_cache = tiny_cache_;
+    DestroyDB(dbname_, options_);
+    options_.create_if_missing = true;
+    options_.compression = kNoCompression;
+    ASSERT_OK(DB::Open(options_, dbname_, &db_));
+  }
+
+  ~AutoCompactTest() {
+    delete db_;
+    DestroyDB(dbname_, Options());
+    delete tiny_cache_;
+  }
+
+  std::string Key(int i) {
+    char buf[100];
+    snprintf(buf, sizeof(buf), "key%06d", i);
+    return std::string(buf);
+  }
+
+  uint64_t Size(const Slice& start, const Slice& limit) {
+    Range r(start, limit);
+    uint64_t size;
+    db_->GetApproximateSizes(&r, 1, &size);
+    return size;
+  }
+
+  void DoReads(int n);
+};
+
+static const int kValueSize = 200 * 1024;
+static const int kTotalSize = 100 * 1024 * 1024;
+static const int kCount = kTotalSize / kValueSize;
+
+// Read through the first n keys repeatedly and check that they get
+// compacted (verified by checking the size of the key space).
+void AutoCompactTest::DoReads(int n) {
+  std::string value(kValueSize, 'x');
+  DBImpl* dbi = reinterpret_cast<DBImpl*>(db_);
+
+  // Fill database
+  for (int i = 0; i < kCount; i++) {
+    ASSERT_OK(db_->Put(WriteOptions(), Key(i), value));
+  }
+  ASSERT_OK(dbi->TEST_CompactMemTable());
+
+  // Delete everything
+  for (int i = 0; i < kCount; i++) {
+    ASSERT_OK(db_->Delete(WriteOptions(), Key(i)));
+  }
+  ASSERT_OK(dbi->TEST_CompactMemTable());
+
+  // Get initial measurement of the space we will be reading.
+  const int64_t initial_size = Size(Key(0), Key(n));
+  const int64_t initial_other_size = Size(Key(n), Key(kCount));
+
+  // Read until size drops significantly.
+  std::string limit_key = Key(n);
+  for (int read = 0; true; read++) {
+    ASSERT_LT(read, 100) << "Taking too long to compact";
+    Iterator* iter = db_->NewIterator(ReadOptions());
+    for (iter->SeekToFirst();
+         iter->Valid() && iter->key().ToString() < limit_key;
+         iter->Next()) {
+      // Drop data
+    }
+    delete iter;
+    // Wait a little bit to allow any triggered compactions to complete.
+    Env::Default()->SleepForMicroseconds(1000000);
+    uint64_t size = Size(Key(0), Key(n));
+    fprintf(stderr, "iter %3d => %7.3f MB [other %7.3f MB]\n",
+            read+1, size/1048576.0, Size(Key(n), Key(kCount))/1048576.0);
+    if (size <= initial_size/10) {
+      break;
+    }
+  }
+
+  // Verify that the size of the key space not touched by the reads
+  // is pretty much unchanged.
+  const int64_t final_other_size = Size(Key(n), Key(kCount));
+  ASSERT_LE(final_other_size, initial_other_size + 1048576);
+  ASSERT_GE(final_other_size, initial_other_size/5 - 1048576);
+}
+
+TEST(AutoCompactTest, ReadAll) {
+  DoReads(kCount);
+}
+
+TEST(AutoCompactTest, ReadHalf) {
+  DoReads(kCount/2);
+}
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/db/builder.cc b/depend/zcash/src/leveldb/db/builder.cc
new file mode 100644
index 000000000..f41988219
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/builder.cc
@@ -0,0 +1,88 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "db/builder.h"
+
+#include "db/filename.h"
+#include "db/dbformat.h"
+#include "db/table_cache.h"
+#include "db/version_edit.h"
+#include "leveldb/db.h"
+#include "leveldb/env.h"
+#include "leveldb/iterator.h"
+
+namespace leveldb {
+
+Status BuildTable(const std::string& dbname,
+                  Env* env,
+                  const Options& options,
+                  TableCache* table_cache,
+                  Iterator* iter,
+                  FileMetaData* meta) {
+  Status s;
+  meta->file_size = 0;
+  iter->SeekToFirst();
+
+  std::string fname = TableFileName(dbname, meta->number);
+  if (iter->Valid()) {
+    WritableFile* file;
+    s = env->NewWritableFile(fname, &file);
+    if (!s.ok()) {
+      return s;
+    }
+
+    TableBuilder* builder = new TableBuilder(options, file);
+    meta->smallest.DecodeFrom(iter->key());
+    for (; iter->Valid(); iter->Next()) {
+      Slice key = iter->key();
+      meta->largest.DecodeFrom(key);
+      builder->Add(key, iter->value());
+    }
+
+    // Finish and check for builder errors
+    if (s.ok()) {
+      s = builder->Finish();
+      if (s.ok()) {
+        meta->file_size = builder->FileSize();
+        assert(meta->file_size > 0);
+      }
+    } else {
+      builder->Abandon();
+    }
+    delete builder;
+
+    // Finish and check for file errors
+    if (s.ok()) {
+      s = file->Sync();
+    }
+    if (s.ok()) {
+      s = file->Close();
+    }
+    delete file;
+    file = NULL;
+
+    if (s.ok()) {
+      // Verify that the table is usable
+      Iterator* it = table_cache->NewIterator(ReadOptions(),
+                                              meta->number,
+                                              meta->file_size);
+      s = it->status();
+      delete it;
+    }
+  }
+
+  // Check for input iterator errors
+  if (!iter->status().ok()) {
+    s = iter->status();
+  }
+
+  if (s.ok() && meta->file_size > 0) {
+    // Keep it
+  } else {
+    env->DeleteFile(fname);
+  }
+  return s;
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/db/builder.h b/depend/zcash/src/leveldb/db/builder.h
new file mode 100644
index 000000000..62431fcf4
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/builder.h
@@ -0,0 +1,34 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_DB_BUILDER_H_
+#define STORAGE_LEVELDB_DB_BUILDER_H_
+
+#include "leveldb/status.h"
+
+namespace leveldb {
+
+struct Options;
+struct FileMetaData;
+
+class Env;
+class Iterator;
+class TableCache;
+class VersionEdit;
+
+// Build a Table file from the contents of *iter.  The generated file
+// will be named according to meta->number.  On success, the rest of
+// *meta will be filled with metadata about the generated table.
+// If no data is present in *iter, meta->file_size will be set to
+// zero, and no Table file will be produced.
+extern Status BuildTable(const std::string& dbname,
+                         Env* env,
+                         const Options& options,
+                         TableCache* table_cache,
+                         Iterator* iter,
+                         FileMetaData* meta);
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_DB_BUILDER_H_
diff --git a/depend/zcash/src/leveldb/db/c.cc b/depend/zcash/src/leveldb/db/c.cc
new file mode 100644
index 000000000..b23e3dcc9
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/c.cc
@@ -0,0 +1,597 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "leveldb/c.h"
+
+#include <stdlib.h>
+#ifndef WIN32
+#include <unistd.h>
+#endif
+#include "leveldb/cache.h"
+#include "leveldb/comparator.h"
+#include "leveldb/db.h"
+#include "leveldb/env.h"
+#include "leveldb/filter_policy.h"
+#include "leveldb/iterator.h"
+#include "leveldb/options.h"
+#include "leveldb/status.h"
+#include "leveldb/write_batch.h"
+
+using leveldb::Cache;
+using leveldb::Comparator;
+using leveldb::CompressionType;
+using leveldb::DB;
+using leveldb::Env;
+using leveldb::FileLock;
+using leveldb::FilterPolicy;
+using leveldb::Iterator;
+using leveldb::kMajorVersion;
+using leveldb::kMinorVersion;
+using leveldb::Logger;
+using leveldb::NewBloomFilterPolicy;
+using leveldb::NewLRUCache;
+using leveldb::Options;
+using leveldb::RandomAccessFile;
+using leveldb::Range;
+using leveldb::ReadOptions;
+using leveldb::SequentialFile;
+using leveldb::Slice;
+using leveldb::Snapshot;
+using leveldb::Status;
+using leveldb::WritableFile;
+using leveldb::WriteBatch;
+using leveldb::WriteOptions;
+
+extern "C" {
+
+struct leveldb_t              { DB*               rep; };
+struct leveldb_iterator_t     { Iterator*         rep; };
+struct leveldb_writebatch_t   { WriteBatch        rep; };
+struct leveldb_snapshot_t     { const Snapshot*   rep; };
+struct leveldb_readoptions_t  { ReadOptions       rep; };
+struct leveldb_writeoptions_t { WriteOptions      rep; };
+struct leveldb_options_t      { Options           rep; };
+struct leveldb_cache_t        { Cache*            rep; };
+struct leveldb_seqfile_t      { SequentialFile*   rep; };
+struct leveldb_randomfile_t   { RandomAccessFile* rep; };
+struct leveldb_writablefile_t { WritableFile*     rep; };
+struct leveldb_logger_t       { Logger*           rep; };
+struct leveldb_filelock_t     { FileLock*         rep; };
+
+struct leveldb_comparator_t : public Comparator {
+  void* state_;
+  void (*destructor_)(void*);
+  int (*compare_)(
+      void*,
+      const char* a, size_t alen,
+      const char* b, size_t blen);
+  const char* (*name_)(void*);
+
+  virtual ~leveldb_comparator_t() {
+    (*destructor_)(state_);
+  }
+
+  virtual int Compare(const Slice& a, const Slice& b) const {
+    return (*compare_)(state_, a.data(), a.size(), b.data(), b.size());
+  }
+
+  virtual const char* Name() const {
+    return (*name_)(state_);
+  }
+
+  // No-ops since the C binding does not support key shortening methods.
+  virtual void FindShortestSeparator(std::string*, const Slice&) const { }
+  virtual void FindShortSuccessor(std::string* key) const { }
+};
+
+struct leveldb_filterpolicy_t : public FilterPolicy {
+  void* state_;
+  void (*destructor_)(void*);
+  const char* (*name_)(void*);
+  char* (*create_)(
+      void*,
+      const char* const* key_array, const size_t* key_length_array,
+      int num_keys,
+      size_t* filter_length);
+  unsigned char (*key_match_)(
+      void*,
+      const char* key, size_t length,
+      const char* filter, size_t filter_length);
+
+  virtual ~leveldb_filterpolicy_t() {
+    (*destructor_)(state_);
+  }
+
+  virtual const char* Name() const {
+    return (*name_)(state_);
+  }
+
+  virtual void CreateFilter(const Slice* keys, int n, std::string* dst) const {
+    std::vector<const char*> key_pointers(n);
+    std::vector<size_t> key_sizes(n);
+    for (int i = 0; i < n; i++) {
+      key_pointers[i] = keys[i].data();
+      key_sizes[i] = keys[i].size();
+    }
+    size_t len;
+    char* filter = (*create_)(state_, &key_pointers[0], &key_sizes[0], n, &len);
+    dst->append(filter, len);
+    free(filter);
+  }
+
+  virtual bool KeyMayMatch(const Slice& key, const Slice& filter) const {
+    return (*key_match_)(state_, key.data(), key.size(),
+                         filter.data(), filter.size());
+  }
+};
+
+struct leveldb_env_t {
+  Env* rep;
+  bool is_default;
+};
+
+static bool SaveError(char** errptr, const Status& s) {
+  assert(errptr != NULL);
+  if (s.ok()) {
+    return false;
+  } else if (*errptr == NULL) {
+    *errptr = strdup(s.ToString().c_str());
+  } else {
+    // TODO(sanjay): Merge with existing error?
+    free(*errptr);
+    *errptr = strdup(s.ToString().c_str());
+  }
+  return true;
+}
+
+static char* CopyString(const std::string& str) {
+  char* result = reinterpret_cast<char*>(malloc(sizeof(char) * str.size()));
+  memcpy(result, str.data(), sizeof(char) * str.size());
+  return result;
+}
+
+leveldb_t* leveldb_open(
+    const leveldb_options_t* options,
+    const char* name,
+    char** errptr) {
+  DB* db;
+  if (SaveError(errptr, DB::Open(options->rep, std::string(name), &db))) {
+    return NULL;
+  }
+  leveldb_t* result = new leveldb_t;
+  result->rep = db;
+  return result;
+}
+
+void leveldb_close(leveldb_t* db) {
+  delete db->rep;
+  delete db;
+}
+
+void leveldb_put(
+    leveldb_t* db,
+    const leveldb_writeoptions_t* options,
+    const char* key, size_t keylen,
+    const char* val, size_t vallen,
+    char** errptr) {
+  SaveError(errptr,
+            db->rep->Put(options->rep, Slice(key, keylen), Slice(val, vallen)));
+}
+
+void leveldb_delete(
+    leveldb_t* db,
+    const leveldb_writeoptions_t* options,
+    const char* key, size_t keylen,
+    char** errptr) {
+  SaveError(errptr, db->rep->Delete(options->rep, Slice(key, keylen)));
+}
+
+
+void leveldb_write(
+    leveldb_t* db,
+    const leveldb_writeoptions_t* options,
+    leveldb_writebatch_t* batch,
+    char** errptr) {
+  SaveError(errptr, db->rep->Write(options->rep, &batch->rep));
+}
+
+char* leveldb_get(
+    leveldb_t* db,
+    const leveldb_readoptions_t* options,
+    const char* key, size_t keylen,
+    size_t* vallen,
+    char** errptr) {
+  char* result = NULL;
+  std::string tmp;
+  Status s = db->rep->Get(options->rep, Slice(key, keylen), &tmp);
+  if (s.ok()) {
+    *vallen = tmp.size();
+    result = CopyString(tmp);
+  } else {
+    *vallen = 0;
+    if (!s.IsNotFound()) {
+      SaveError(errptr, s);
+    }
+  }
+  return result;
+}
+
+leveldb_iterator_t* leveldb_create_iterator(
+    leveldb_t* db,
+    const leveldb_readoptions_t* options) {
+  leveldb_iterator_t* result = new leveldb_iterator_t;
+  result->rep = db->rep->NewIterator(options->rep);
+  return result;
+}
+
+const leveldb_snapshot_t* leveldb_create_snapshot(
+    leveldb_t* db) {
+  leveldb_snapshot_t* result = new leveldb_snapshot_t;
+  result->rep = db->rep->GetSnapshot();
+  return result;
+}
+
+void leveldb_release_snapshot(
+    leveldb_t* db,
+    const leveldb_snapshot_t* snapshot) {
+  db->rep->ReleaseSnapshot(snapshot->rep);
+  delete snapshot;
+}
+
+char* leveldb_property_value(
+    leveldb_t* db,
+    const char* propname) {
+  std::string tmp;
+  if (db->rep->GetProperty(Slice(propname), &tmp)) {
+    // We use strdup() since we expect human readable output.
+    return strdup(tmp.c_str());
+  } else {
+    return NULL;
+  }
+}
+
+void leveldb_approximate_sizes(
+    leveldb_t* db,
+    int num_ranges,
+    const char* const* range_start_key, const size_t* range_start_key_len,
+    const char* const* range_limit_key, const size_t* range_limit_key_len,
+    uint64_t* sizes) {
+  Range* ranges = new Range[num_ranges];
+  for (int i = 0; i < num_ranges; i++) {
+    ranges[i].start = Slice(range_start_key[i], range_start_key_len[i]);
+    ranges[i].limit = Slice(range_limit_key[i], range_limit_key_len[i]);
+  }
+  db->rep->GetApproximateSizes(ranges, num_ranges, sizes);
+  delete[] ranges;
+}
+
+void leveldb_compact_range(
+    leveldb_t* db,
+    const char* start_key, size_t start_key_len,
+    const char* limit_key, size_t limit_key_len) {
+  Slice a, b;
+  db->rep->CompactRange(
+      // Pass NULL Slice if corresponding "const char*" is NULL
+      (start_key ? (a = Slice(start_key, start_key_len), &a) : NULL),
+      (limit_key ? (b = Slice(limit_key, limit_key_len), &b) : NULL));
+}
+
+void leveldb_destroy_db(
+    const leveldb_options_t* options,
+    const char* name,
+    char** errptr) {
+  SaveError(errptr, DestroyDB(name, options->rep));
+}
+
+void leveldb_repair_db(
+    const leveldb_options_t* options,
+    const char* name,
+    char** errptr) {
+  SaveError(errptr, RepairDB(name, options->rep));
+}
+
+void leveldb_iter_destroy(leveldb_iterator_t* iter) {
+  delete iter->rep;
+  delete iter;
+}
+
+unsigned char leveldb_iter_valid(const leveldb_iterator_t* iter) {
+  return iter->rep->Valid();
+}
+
+void leveldb_iter_seek_to_first(leveldb_iterator_t* iter) {
+  iter->rep->SeekToFirst();
+}
+
+void leveldb_iter_seek_to_last(leveldb_iterator_t* iter) {
+  iter->rep->SeekToLast();
+}
+
+void leveldb_iter_seek(leveldb_iterator_t* iter, const char* k, size_t klen) {
+  iter->rep->Seek(Slice(k, klen));
+}
+
+void leveldb_iter_next(leveldb_iterator_t* iter) {
+  iter->rep->Next();
+}
+
+void leveldb_iter_prev(leveldb_iterator_t* iter) {
+  iter->rep->Prev();
+}
+
+const char* leveldb_iter_key(const leveldb_iterator_t* iter, size_t* klen) {
+  Slice s = iter->rep->key();
+  *klen = s.size();
+  return s.data();
+}
+
+const char* leveldb_iter_value(const leveldb_iterator_t* iter, size_t* vlen) {
+  Slice s = iter->rep->value();
+  *vlen = s.size();
+  return s.data();
+}
+
+void leveldb_iter_get_error(const leveldb_iterator_t* iter, char** errptr) {
+  SaveError(errptr, iter->rep->status());
+}
+
+leveldb_writebatch_t* leveldb_writebatch_create() {
+  return new leveldb_writebatch_t;
+}
+
+void leveldb_writebatch_destroy(leveldb_writebatch_t* b) {
+  delete b;
+}
+
+void leveldb_writebatch_clear(leveldb_writebatch_t* b) {
+  b->rep.Clear();
+}
+
+void leveldb_writebatch_put(
+    leveldb_writebatch_t* b,
+    const char* key, size_t klen,
+    const char* val, size_t vlen) {
+  b->rep.Put(Slice(key, klen), Slice(val, vlen));
+}
+
+void leveldb_writebatch_delete(
+    leveldb_writebatch_t* b,
+    const char* key, size_t klen) {
+  b->rep.Delete(Slice(key, klen));
+}
+
+void leveldb_writebatch_iterate(
+    leveldb_writebatch_t* b,
+    void* state,
+    void (*put)(void*, const char* k, size_t klen, const char* v, size_t vlen),
+    void (*deleted)(void*, const char* k, size_t klen)) {
+  class H : public WriteBatch::Handler {
+   public:
+    void* state_;
+    void (*put_)(void*, const char* k, size_t klen, const char* v, size_t vlen);
+    void (*deleted_)(void*, const char* k, size_t klen);
+    virtual void Put(const Slice& key, const Slice& value) {
+      (*put_)(state_, key.data(), key.size(), value.data(), value.size());
+    }
+    virtual void Delete(const Slice& key) {
+      (*deleted_)(state_, key.data(), key.size());
+    }
+  };
+  H handler;
+  handler.state_ = state;
+  handler.put_ = put;
+  handler.deleted_ = deleted;
+  b->rep.Iterate(&handler);
+}
+
+leveldb_options_t* leveldb_options_create() {
+  return new leveldb_options_t;
+}
+
+void leveldb_options_destroy(leveldb_options_t* options) {
+  delete options;
+}
+
+void leveldb_options_set_comparator(
+    leveldb_options_t* opt,
+    leveldb_comparator_t* cmp) {
+  opt->rep.comparator = cmp;
+}
+
+void leveldb_options_set_filter_policy(
+    leveldb_options_t* opt,
+    leveldb_filterpolicy_t* policy) {
+  opt->rep.filter_policy = policy;
+}
+
+void leveldb_options_set_create_if_missing(
+    leveldb_options_t* opt, unsigned char v) {
+  opt->rep.create_if_missing = v;
+}
+
+void leveldb_options_set_error_if_exists(
+    leveldb_options_t* opt, unsigned char v) {
+  opt->rep.error_if_exists = v;
+}
+
+void leveldb_options_set_paranoid_checks(
+    leveldb_options_t* opt, unsigned char v) {
+  opt->rep.paranoid_checks = v;
+}
+
+void leveldb_options_set_env(leveldb_options_t* opt, leveldb_env_t* env) {
+  opt->rep.env = (env ? env->rep : NULL);
+}
+
+void leveldb_options_set_info_log(leveldb_options_t* opt, leveldb_logger_t* l) {
+  opt->rep.info_log = (l ? l->rep : NULL);
+}
+
+void leveldb_options_set_write_buffer_size(leveldb_options_t* opt, size_t s) {
+  opt->rep.write_buffer_size = s;
+}
+
+void leveldb_options_set_max_open_files(leveldb_options_t* opt, int n) {
+  opt->rep.max_open_files = n;
+}
+
+void leveldb_options_set_cache(leveldb_options_t* opt, leveldb_cache_t* c) {
+  opt->rep.block_cache = c->rep;
+}
+
+void leveldb_options_set_block_size(leveldb_options_t* opt, size_t s) {
+  opt->rep.block_size = s;
+}
+
+void leveldb_options_set_block_restart_interval(leveldb_options_t* opt, int n) {
+  opt->rep.block_restart_interval = n;
+}
+
+void leveldb_options_set_compression(leveldb_options_t* opt, int t) {
+  opt->rep.compression = static_cast<CompressionType>(t);
+}
+
+leveldb_comparator_t* leveldb_comparator_create(
+    void* state,
+    void (*destructor)(void*),
+    int (*compare)(
+        void*,
+        const char* a, size_t alen,
+        const char* b, size_t blen),
+    const char* (*name)(void*)) {
+  leveldb_comparator_t* result = new leveldb_comparator_t;
+  result->state_ = state;
+  result->destructor_ = destructor;
+  result->compare_ = compare;
+  result->name_ = name;
+  return result;
+}
+
+void leveldb_comparator_destroy(leveldb_comparator_t* cmp) {
+  delete cmp;
+}
+
+leveldb_filterpolicy_t* leveldb_filterpolicy_create(
+    void* state,
+    void (*destructor)(void*),
+    char* (*create_filter)(
+        void*,
+        const char* const* key_array, const size_t* key_length_array,
+        int num_keys,
+        size_t* filter_length),
+    unsigned char (*key_may_match)(
+        void*,
+        const char* key, size_t length,
+        const char* filter, size_t filter_length),
+    const char* (*name)(void*)) {
+  leveldb_filterpolicy_t* result = new leveldb_filterpolicy_t;
+  result->state_ = state;
+  result->destructor_ = destructor;
+  result->create_ = create_filter;
+  result->key_match_ = key_may_match;
+  result->name_ = name;
+  return result;
+}
+
+void leveldb_filterpolicy_destroy(leveldb_filterpolicy_t* filter) {
+  delete filter;
+}
+
+leveldb_filterpolicy_t* leveldb_filterpolicy_create_bloom(int bits_per_key) {
+  // Make a leveldb_filterpolicy_t, but override all of its methods so
+  // they delegate to a NewBloomFilterPolicy() instead of user
+  // supplied C functions.
+  struct Wrapper : public leveldb_filterpolicy_t {
+    const FilterPolicy* rep_;
+    ~Wrapper() { delete rep_; }
+    const char* Name() const { return rep_->Name(); }
+    void CreateFilter(const Slice* keys, int n, std::string* dst) const {
+      return rep_->CreateFilter(keys, n, dst);
+    }
+    bool KeyMayMatch(const Slice& key, const Slice& filter) const {
+      return rep_->KeyMayMatch(key, filter);
+    }
+    static void DoNothing(void*) { }
+  };
+  Wrapper* wrapper = new Wrapper;
+  wrapper->rep_ = NewBloomFilterPolicy(bits_per_key);
+  wrapper->state_ = NULL;
+  wrapper->destructor_ = &Wrapper::DoNothing;
+  return wrapper;
+}
+
+leveldb_readoptions_t* leveldb_readoptions_create() {
+  return new leveldb_readoptions_t;
+}
+
+void leveldb_readoptions_destroy(leveldb_readoptions_t* opt) {
+  delete opt;
+}
+
+void leveldb_readoptions_set_verify_checksums(
+    leveldb_readoptions_t* opt,
+    unsigned char v) {
+  opt->rep.verify_checksums = v;
+}
+
+void leveldb_readoptions_set_fill_cache(
+    leveldb_readoptions_t* opt, unsigned char v) {
+  opt->rep.fill_cache = v;
+}
+
+void leveldb_readoptions_set_snapshot(
+    leveldb_readoptions_t* opt,
+    const leveldb_snapshot_t* snap) {
+  opt->rep.snapshot = (snap ? snap->rep : NULL);
+}
+
+leveldb_writeoptions_t* leveldb_writeoptions_create() {
+  return new leveldb_writeoptions_t;
+}
+
+void leveldb_writeoptions_destroy(leveldb_writeoptions_t* opt) {
+  delete opt;
+}
+
+void leveldb_writeoptions_set_sync(
+    leveldb_writeoptions_t* opt, unsigned char v) {
+  opt->rep.sync = v;
+}
+
+leveldb_cache_t* leveldb_cache_create_lru(size_t capacity) {
+  leveldb_cache_t* c = new leveldb_cache_t;
+  c->rep = NewLRUCache(capacity);
+  return c;
+}
+
+void leveldb_cache_destroy(leveldb_cache_t* cache) {
+  delete cache->rep;
+  delete cache;
+}
+
+leveldb_env_t* leveldb_create_default_env() {
+  leveldb_env_t* result = new leveldb_env_t;
+  result->rep = Env::Default();
+  result->is_default = true;
+  return result;
+}
+
+void leveldb_env_destroy(leveldb_env_t* env) {
+  if (!env->is_default) delete env->rep;
+  delete env;
+}
+
+void leveldb_free(void* ptr) {
+  free(ptr);
+}
+
+int leveldb_major_version() {
+  return kMajorVersion;
+}
+
+int leveldb_minor_version() {
+  return kMinorVersion;
+}
+
+}  // end extern "C"
diff --git a/depend/zcash/src/leveldb/db/c_test.c b/depend/zcash/src/leveldb/db/c_test.c
new file mode 100644
index 000000000..7cd5ee020
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/c_test.c
@@ -0,0 +1,390 @@
+/* Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+   Use of this source code is governed by a BSD-style license that can be
+   found in the LICENSE file. See the AUTHORS file for names of contributors. */
+
+#include "leveldb/c.h"
+
+#include <stddef.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <sys/types.h>
+#include <unistd.h>
+
+const char* phase = "";
+static char dbname[200];
+
+static void StartPhase(const char* name) {
+  fprintf(stderr, "=== Test %s\n", name);
+  phase = name;
+}
+
+static const char* GetTempDir(void) {
+    const char* ret = getenv("TEST_TMPDIR");
+    if (ret == NULL || ret[0] == '\0')
+        ret = "/tmp";
+    return ret;
+}
+
+#define CheckNoError(err)                                               \
+  if ((err) != NULL) {                                                  \
+    fprintf(stderr, "%s:%d: %s: %s\n", __FILE__, __LINE__, phase, (err)); \
+    abort();                                                            \
+  }
+
+#define CheckCondition(cond)                                            \
+  if (!(cond)) {                                                        \
+    fprintf(stderr, "%s:%d: %s: %s\n", __FILE__, __LINE__, phase, #cond); \
+    abort();                                                            \
+  }
+
+static void CheckEqual(const char* expected, const char* v, size_t n) {
+  if (expected == NULL && v == NULL) {
+    // ok
+  } else if (expected != NULL && v != NULL && n == strlen(expected) &&
+             memcmp(expected, v, n) == 0) {
+    // ok
+    return;
+  } else {
+    fprintf(stderr, "%s: expected '%s', got '%s'\n",
+            phase,
+            (expected ? expected : "(null)"),
+            (v ? v : "(null"));
+    abort();
+  }
+}
+
+static void Free(char** ptr) {
+  if (*ptr) {
+    free(*ptr);
+    *ptr = NULL;
+  }
+}
+
+static void CheckGet(
+    leveldb_t* db,
+    const leveldb_readoptions_t* options,
+    const char* key,
+    const char* expected) {
+  char* err = NULL;
+  size_t val_len;
+  char* val;
+  val = leveldb_get(db, options, key, strlen(key), &val_len, &err);
+  CheckNoError(err);
+  CheckEqual(expected, val, val_len);
+  Free(&val);
+}
+
+static void CheckIter(leveldb_iterator_t* iter,
+                      const char* key, const char* val) {
+  size_t len;
+  const char* str;
+  str = leveldb_iter_key(iter, &len);
+  CheckEqual(key, str, len);
+  str = leveldb_iter_value(iter, &len);
+  CheckEqual(val, str, len);
+}
+
+// Callback from leveldb_writebatch_iterate()
+static void CheckPut(void* ptr,
+                     const char* k, size_t klen,
+                     const char* v, size_t vlen) {
+  int* state = (int*) ptr;
+  CheckCondition(*state < 2);
+  switch (*state) {
+    case 0:
+      CheckEqual("bar", k, klen);
+      CheckEqual("b", v, vlen);
+      break;
+    case 1:
+      CheckEqual("box", k, klen);
+      CheckEqual("c", v, vlen);
+      break;
+  }
+  (*state)++;
+}
+
+// Callback from leveldb_writebatch_iterate()
+static void CheckDel(void* ptr, const char* k, size_t klen) {
+  int* state = (int*) ptr;
+  CheckCondition(*state == 2);
+  CheckEqual("bar", k, klen);
+  (*state)++;
+}
+
+static void CmpDestroy(void* arg) { }
+
+static int CmpCompare(void* arg, const char* a, size_t alen,
+                      const char* b, size_t blen) {
+  int n = (alen < blen) ? alen : blen;
+  int r = memcmp(a, b, n);
+  if (r == 0) {
+    if (alen < blen) r = -1;
+    else if (alen > blen) r = +1;
+  }
+  return r;
+}
+
+static const char* CmpName(void* arg) {
+  return "foo";
+}
+
+// Custom filter policy
+static unsigned char fake_filter_result = 1;
+static void FilterDestroy(void* arg) { }
+static const char* FilterName(void* arg) {
+  return "TestFilter";
+}
+static char* FilterCreate(
+    void* arg,
+    const char* const* key_array, const size_t* key_length_array,
+    int num_keys,
+    size_t* filter_length) {
+  *filter_length = 4;
+  char* result = malloc(4);
+  memcpy(result, "fake", 4);
+  return result;
+}
+unsigned char FilterKeyMatch(
+    void* arg,
+    const char* key, size_t length,
+    const char* filter, size_t filter_length) {
+  CheckCondition(filter_length == 4);
+  CheckCondition(memcmp(filter, "fake", 4) == 0);
+  return fake_filter_result;
+}
+
+int main(int argc, char** argv) {
+  leveldb_t* db;
+  leveldb_comparator_t* cmp;
+  leveldb_cache_t* cache;
+  leveldb_env_t* env;
+  leveldb_options_t* options;
+  leveldb_readoptions_t* roptions;
+  leveldb_writeoptions_t* woptions;
+  char* err = NULL;
+  int run = -1;
+
+  CheckCondition(leveldb_major_version() >= 1);
+  CheckCondition(leveldb_minor_version() >= 1);
+
+  snprintf(dbname, sizeof(dbname),
+           "%s/leveldb_c_test-%d",
+           GetTempDir(),
+           ((int) geteuid()));
+
+  StartPhase("create_objects");
+  cmp = leveldb_comparator_create(NULL, CmpDestroy, CmpCompare, CmpName);
+  env = leveldb_create_default_env();
+  cache = leveldb_cache_create_lru(100000);
+
+  options = leveldb_options_create();
+  leveldb_options_set_comparator(options, cmp);
+  leveldb_options_set_error_if_exists(options, 1);
+  leveldb_options_set_cache(options, cache);
+  leveldb_options_set_env(options, env);
+  leveldb_options_set_info_log(options, NULL);
+  leveldb_options_set_write_buffer_size(options, 100000);
+  leveldb_options_set_paranoid_checks(options, 1);
+  leveldb_options_set_max_open_files(options, 10);
+  leveldb_options_set_block_size(options, 1024);
+  leveldb_options_set_block_restart_interval(options, 8);
+  leveldb_options_set_compression(options, leveldb_no_compression);
+
+  roptions = leveldb_readoptions_create();
+  leveldb_readoptions_set_verify_checksums(roptions, 1);
+  leveldb_readoptions_set_fill_cache(roptions, 0);
+
+  woptions = leveldb_writeoptions_create();
+  leveldb_writeoptions_set_sync(woptions, 1);
+
+  StartPhase("destroy");
+  leveldb_destroy_db(options, dbname, &err);
+  Free(&err);
+
+  StartPhase("open_error");
+  db = leveldb_open(options, dbname, &err);
+  CheckCondition(err != NULL);
+  Free(&err);
+
+  StartPhase("leveldb_free");
+  db = leveldb_open(options, dbname, &err);
+  CheckCondition(err != NULL);
+  leveldb_free(err);
+  err = NULL;
+
+  StartPhase("open");
+  leveldb_options_set_create_if_missing(options, 1);
+  db = leveldb_open(options, dbname, &err);
+  CheckNoError(err);
+  CheckGet(db, roptions, "foo", NULL);
+
+  StartPhase("put");
+  leveldb_put(db, woptions, "foo", 3, "hello", 5, &err);
+  CheckNoError(err);
+  CheckGet(db, roptions, "foo", "hello");
+
+  StartPhase("compactall");
+  leveldb_compact_range(db, NULL, 0, NULL, 0);
+  CheckGet(db, roptions, "foo", "hello");
+
+  StartPhase("compactrange");
+  leveldb_compact_range(db, "a", 1, "z", 1);
+  CheckGet(db, roptions, "foo", "hello");
+
+  StartPhase("writebatch");
+  {
+    leveldb_writebatch_t* wb = leveldb_writebatch_create();
+    leveldb_writebatch_put(wb, "foo", 3, "a", 1);
+    leveldb_writebatch_clear(wb);
+    leveldb_writebatch_put(wb, "bar", 3, "b", 1);
+    leveldb_writebatch_put(wb, "box", 3, "c", 1);
+    leveldb_writebatch_delete(wb, "bar", 3);
+    leveldb_write(db, woptions, wb, &err);
+    CheckNoError(err);
+    CheckGet(db, roptions, "foo", "hello");
+    CheckGet(db, roptions, "bar", NULL);
+    CheckGet(db, roptions, "box", "c");
+    int pos = 0;
+    leveldb_writebatch_iterate(wb, &pos, CheckPut, CheckDel);
+    CheckCondition(pos == 3);
+    leveldb_writebatch_destroy(wb);
+  }
+
+  StartPhase("iter");
+  {
+    leveldb_iterator_t* iter = leveldb_create_iterator(db, roptions);
+    CheckCondition(!leveldb_iter_valid(iter));
+    leveldb_iter_seek_to_first(iter);
+    CheckCondition(leveldb_iter_valid(iter));
+    CheckIter(iter, "box", "c");
+    leveldb_iter_next(iter);
+    CheckIter(iter, "foo", "hello");
+    leveldb_iter_prev(iter);
+    CheckIter(iter, "box", "c");
+    leveldb_iter_prev(iter);
+    CheckCondition(!leveldb_iter_valid(iter));
+    leveldb_iter_seek_to_last(iter);
+    CheckIter(iter, "foo", "hello");
+    leveldb_iter_seek(iter, "b", 1);
+    CheckIter(iter, "box", "c");
+    leveldb_iter_get_error(iter, &err);
+    CheckNoError(err);
+    leveldb_iter_destroy(iter);
+  }
+
+  StartPhase("approximate_sizes");
+  {
+    int i;
+    int n = 20000;
+    char keybuf[100];
+    char valbuf[100];
+    uint64_t sizes[2];
+    const char* start[2] = { "a", "k00000000000000010000" };
+    size_t start_len[2] = { 1, 21 };
+    const char* limit[2] = { "k00000000000000010000", "z" };
+    size_t limit_len[2] = { 21, 1 };
+    leveldb_writeoptions_set_sync(woptions, 0);
+    for (i = 0; i < n; i++) {
+      snprintf(keybuf, sizeof(keybuf), "k%020d", i);
+      snprintf(valbuf, sizeof(valbuf), "v%020d", i);
+      leveldb_put(db, woptions, keybuf, strlen(keybuf), valbuf, strlen(valbuf),
+                  &err);
+      CheckNoError(err);
+    }
+    leveldb_approximate_sizes(db, 2, start, start_len, limit, limit_len, sizes);
+    CheckCondition(sizes[0] > 0);
+    CheckCondition(sizes[1] > 0);
+  }
+
+  StartPhase("property");
+  {
+    char* prop = leveldb_property_value(db, "nosuchprop");
+    CheckCondition(prop == NULL);
+    prop = leveldb_property_value(db, "leveldb.stats");
+    CheckCondition(prop != NULL);
+    Free(&prop);
+  }
+
+  StartPhase("snapshot");
+  {
+    const leveldb_snapshot_t* snap;
+    snap = leveldb_create_snapshot(db);
+    leveldb_delete(db, woptions, "foo", 3, &err);
+    CheckNoError(err);
+    leveldb_readoptions_set_snapshot(roptions, snap);
+    CheckGet(db, roptions, "foo", "hello");
+    leveldb_readoptions_set_snapshot(roptions, NULL);
+    CheckGet(db, roptions, "foo", NULL);
+    leveldb_release_snapshot(db, snap);
+  }
+
+  StartPhase("repair");
+  {
+    leveldb_close(db);
+    leveldb_options_set_create_if_missing(options, 0);
+    leveldb_options_set_error_if_exists(options, 0);
+    leveldb_repair_db(options, dbname, &err);
+    CheckNoError(err);
+    db = leveldb_open(options, dbname, &err);
+    CheckNoError(err);
+    CheckGet(db, roptions, "foo", NULL);
+    CheckGet(db, roptions, "bar", NULL);
+    CheckGet(db, roptions, "box", "c");
+    leveldb_options_set_create_if_missing(options, 1);
+    leveldb_options_set_error_if_exists(options, 1);
+  }
+
+  StartPhase("filter");
+  for (run = 0; run < 2; run++) {
+    // First run uses custom filter, second run uses bloom filter
+    CheckNoError(err);
+    leveldb_filterpolicy_t* policy;
+    if (run == 0) {
+      policy = leveldb_filterpolicy_create(
+          NULL, FilterDestroy, FilterCreate, FilterKeyMatch, FilterName);
+    } else {
+      policy = leveldb_filterpolicy_create_bloom(10);
+    }
+
+    // Create new database
+    leveldb_close(db);
+    leveldb_destroy_db(options, dbname, &err);
+    leveldb_options_set_filter_policy(options, policy);
+    db = leveldb_open(options, dbname, &err);
+    CheckNoError(err);
+    leveldb_put(db, woptions, "foo", 3, "foovalue", 8, &err);
+    CheckNoError(err);
+    leveldb_put(db, woptions, "bar", 3, "barvalue", 8, &err);
+    CheckNoError(err);
+    leveldb_compact_range(db, NULL, 0, NULL, 0);
+
+    fake_filter_result = 1;
+    CheckGet(db, roptions, "foo", "foovalue");
+    CheckGet(db, roptions, "bar", "barvalue");
+    if (phase == 0) {
+      // Must not find value when custom filter returns false
+      fake_filter_result = 0;
+      CheckGet(db, roptions, "foo", NULL);
+      CheckGet(db, roptions, "bar", NULL);
+      fake_filter_result = 1;
+
+      CheckGet(db, roptions, "foo", "foovalue");
+      CheckGet(db, roptions, "bar", "barvalue");
+    }
+    leveldb_options_set_filter_policy(options, NULL);
+    leveldb_filterpolicy_destroy(policy);
+  }
+
+  StartPhase("cleanup");
+  leveldb_close(db);
+  leveldb_options_destroy(options);
+  leveldb_readoptions_destroy(roptions);
+  leveldb_writeoptions_destroy(woptions);
+  leveldb_cache_destroy(cache);
+  leveldb_comparator_destroy(cmp);
+  leveldb_env_destroy(env);
+
+  fprintf(stderr, "PASS\n");
+  return 0;
+}
diff --git a/depend/zcash/src/leveldb/db/corruption_test.cc b/depend/zcash/src/leveldb/db/corruption_test.cc
new file mode 100644
index 000000000..37a484d25
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/corruption_test.cc
@@ -0,0 +1,374 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "leveldb/db.h"
+
+#include <errno.h>
+#include <fcntl.h>
+#include <sys/stat.h>
+#include <sys/types.h>
+#include "leveldb/cache.h"
+#include "leveldb/env.h"
+#include "leveldb/table.h"
+#include "leveldb/write_batch.h"
+#include "db/db_impl.h"
+#include "db/filename.h"
+#include "db/log_format.h"
+#include "db/version_set.h"
+#include "util/logging.h"
+#include "util/testharness.h"
+#include "util/testutil.h"
+
+namespace leveldb {
+
+static const int kValueSize = 1000;
+
+class CorruptionTest {
+ public:
+  test::ErrorEnv env_;
+  std::string dbname_;
+  Cache* tiny_cache_;
+  Options options_;
+  DB* db_;
+
+  CorruptionTest() {
+    tiny_cache_ = NewLRUCache(100);
+    options_.env = &env_;
+    options_.block_cache = tiny_cache_;
+    dbname_ = test::TmpDir() + "/corruption_test";
+    DestroyDB(dbname_, options_);
+
+    db_ = NULL;
+    options_.create_if_missing = true;
+    Reopen();
+    options_.create_if_missing = false;
+  }
+
+  ~CorruptionTest() {
+     delete db_;
+     DestroyDB(dbname_, Options());
+     delete tiny_cache_;
+  }
+
+  Status TryReopen() {
+    delete db_;
+    db_ = NULL;
+    return DB::Open(options_, dbname_, &db_);
+  }
+
+  void Reopen() {
+    ASSERT_OK(TryReopen());
+  }
+
+  void RepairDB() {
+    delete db_;
+    db_ = NULL;
+    ASSERT_OK(::leveldb::RepairDB(dbname_, options_));
+  }
+
+  void Build(int n) {
+    std::string key_space, value_space;
+    WriteBatch batch;
+    for (int i = 0; i < n; i++) {
+      //if ((i % 100) == 0) fprintf(stderr, "@ %d of %d\n", i, n);
+      Slice key = Key(i, &key_space);
+      batch.Clear();
+      batch.Put(key, Value(i, &value_space));
+      WriteOptions options;
+      // Corrupt() doesn't work without this sync on windows; stat reports 0 for
+      // the file size.
+      if (i == n - 1) {
+        options.sync = true;
+      }
+      ASSERT_OK(db_->Write(options, &batch));
+    }
+  }
+
+  void Check(int min_expected, int max_expected) {
+    int next_expected = 0;
+    int missed = 0;
+    int bad_keys = 0;
+    int bad_values = 0;
+    int correct = 0;
+    std::string value_space;
+    Iterator* iter = db_->NewIterator(ReadOptions());
+    for (iter->SeekToFirst(); iter->Valid(); iter->Next()) {
+      uint64_t key;
+      Slice in(iter->key());
+      if (in == "" || in == "~") {
+        // Ignore boundary keys.
+        continue;
+      }
+      if (!ConsumeDecimalNumber(&in, &key) ||
+          !in.empty() ||
+          key < next_expected) {
+        bad_keys++;
+        continue;
+      }
+      missed += (key - next_expected);
+      next_expected = key + 1;
+      if (iter->value() != Value(key, &value_space)) {
+        bad_values++;
+      } else {
+        correct++;
+      }
+    }
+    delete iter;
+
+    fprintf(stderr,
+            "expected=%d..%d; got=%d; bad_keys=%d; bad_values=%d; missed=%d\n",
+            min_expected, max_expected, correct, bad_keys, bad_values, missed);
+    ASSERT_LE(min_expected, correct);
+    ASSERT_GE(max_expected, correct);
+  }
+
+  void Corrupt(FileType filetype, int offset, int bytes_to_corrupt) {
+    // Pick file to corrupt
+    std::vector<std::string> filenames;
+    ASSERT_OK(env_.GetChildren(dbname_, &filenames));
+    uint64_t number;
+    FileType type;
+    std::string fname;
+    int picked_number = -1;
+    for (size_t i = 0; i < filenames.size(); i++) {
+      if (ParseFileName(filenames[i], &number, &type) &&
+          type == filetype &&
+          int(number) > picked_number) {  // Pick latest file
+        fname = dbname_ + "/" + filenames[i];
+        picked_number = number;
+      }
+    }
+    ASSERT_TRUE(!fname.empty()) << filetype;
+
+    struct stat sbuf;
+    if (stat(fname.c_str(), &sbuf) != 0) {
+      const char* msg = strerror(errno);
+      ASSERT_TRUE(false) << fname << ": " << msg;
+    }
+
+    if (offset < 0) {
+      // Relative to end of file; make it absolute
+      if (-offset > sbuf.st_size) {
+        offset = 0;
+      } else {
+        offset = sbuf.st_size + offset;
+      }
+    }
+    if (offset > sbuf.st_size) {
+      offset = sbuf.st_size;
+    }
+    if (offset + bytes_to_corrupt > sbuf.st_size) {
+      bytes_to_corrupt = sbuf.st_size - offset;
+    }
+
+    // Do it
+    std::string contents;
+    Status s = ReadFileToString(Env::Default(), fname, &contents);
+    ASSERT_TRUE(s.ok()) << s.ToString();
+    for (int i = 0; i < bytes_to_corrupt; i++) {
+      contents[i + offset] ^= 0x80;
+    }
+    s = WriteStringToFile(Env::Default(), contents, fname);
+    ASSERT_TRUE(s.ok()) << s.ToString();
+  }
+
+  int Property(const std::string& name) {
+    std::string property;
+    int result;
+    if (db_->GetProperty(name, &property) &&
+        sscanf(property.c_str(), "%d", &result) == 1) {
+      return result;
+    } else {
+      return -1;
+    }
+  }
+
+  // Return the ith key
+  Slice Key(int i, std::string* storage) {
+    char buf[100];
+    snprintf(buf, sizeof(buf), "%016d", i);
+    storage->assign(buf, strlen(buf));
+    return Slice(*storage);
+  }
+
+  // Return the value to associate with the specified key
+  Slice Value(int k, std::string* storage) {
+    Random r(k);
+    return test::RandomString(&r, kValueSize, storage);
+  }
+};
+
+TEST(CorruptionTest, Recovery) {
+  Build(100);
+  Check(100, 100);
+  Corrupt(kLogFile, 19, 1);      // WriteBatch tag for first record
+  Corrupt(kLogFile, log::kBlockSize + 1000, 1);  // Somewhere in second block
+  Reopen();
+
+  // The 64 records in the first two log blocks are completely lost.
+  Check(36, 36);
+}
+
+TEST(CorruptionTest, RecoverWriteError) {
+  env_.writable_file_error_ = true;
+  Status s = TryReopen();
+  ASSERT_TRUE(!s.ok());
+}
+
+TEST(CorruptionTest, NewFileErrorDuringWrite) {
+  // Do enough writing to force minor compaction
+  env_.writable_file_error_ = true;
+  const int num = 3 + (Options().write_buffer_size / kValueSize);
+  std::string value_storage;
+  Status s;
+  for (int i = 0; s.ok() && i < num; i++) {
+    WriteBatch batch;
+    batch.Put("a", Value(100, &value_storage));
+    s = db_->Write(WriteOptions(), &batch);
+  }
+  ASSERT_TRUE(!s.ok());
+  ASSERT_GE(env_.num_writable_file_errors_, 1);
+  env_.writable_file_error_ = false;
+  Reopen();
+}
+
+TEST(CorruptionTest, TableFile) {
+  Build(100);
+  DBImpl* dbi = reinterpret_cast<DBImpl*>(db_);
+  dbi->TEST_CompactMemTable();
+  dbi->TEST_CompactRange(0, NULL, NULL);
+  dbi->TEST_CompactRange(1, NULL, NULL);
+
+  Corrupt(kTableFile, 100, 1);
+  Check(90, 99);
+}
+
+TEST(CorruptionTest, TableFileRepair) {
+  options_.block_size = 2 * kValueSize;  // Limit scope of corruption
+  options_.paranoid_checks = true;
+  Reopen();
+  Build(100);
+  DBImpl* dbi = reinterpret_cast<DBImpl*>(db_);
+  dbi->TEST_CompactMemTable();
+  dbi->TEST_CompactRange(0, NULL, NULL);
+  dbi->TEST_CompactRange(1, NULL, NULL);
+
+  Corrupt(kTableFile, 100, 1);
+  RepairDB();
+  Reopen();
+  Check(95, 99);
+}
+
+TEST(CorruptionTest, TableFileIndexData) {
+  Build(10000);  // Enough to build multiple Tables
+  DBImpl* dbi = reinterpret_cast<DBImpl*>(db_);
+  dbi->TEST_CompactMemTable();
+
+  Corrupt(kTableFile, -2000, 500);
+  Reopen();
+  Check(5000, 9999);
+}
+
+TEST(CorruptionTest, MissingDescriptor) {
+  Build(1000);
+  RepairDB();
+  Reopen();
+  Check(1000, 1000);
+}
+
+TEST(CorruptionTest, SequenceNumberRecovery) {
+  ASSERT_OK(db_->Put(WriteOptions(), "foo", "v1"));
+  ASSERT_OK(db_->Put(WriteOptions(), "foo", "v2"));
+  ASSERT_OK(db_->Put(WriteOptions(), "foo", "v3"));
+  ASSERT_OK(db_->Put(WriteOptions(), "foo", "v4"));
+  ASSERT_OK(db_->Put(WriteOptions(), "foo", "v5"));
+  RepairDB();
+  Reopen();
+  std::string v;
+  ASSERT_OK(db_->Get(ReadOptions(), "foo", &v));
+  ASSERT_EQ("v5", v);
+  // Write something.  If sequence number was not recovered properly,
+  // it will be hidden by an earlier write.
+  ASSERT_OK(db_->Put(WriteOptions(), "foo", "v6"));
+  ASSERT_OK(db_->Get(ReadOptions(), "foo", &v));
+  ASSERT_EQ("v6", v);
+  Reopen();
+  ASSERT_OK(db_->Get(ReadOptions(), "foo", &v));
+  ASSERT_EQ("v6", v);
+}
+
+TEST(CorruptionTest, CorruptedDescriptor) {
+  ASSERT_OK(db_->Put(WriteOptions(), "foo", "hello"));
+  DBImpl* dbi = reinterpret_cast<DBImpl*>(db_);
+  dbi->TEST_CompactMemTable();
+  dbi->TEST_CompactRange(0, NULL, NULL);
+
+  Corrupt(kDescriptorFile, 0, 1000);
+  Status s = TryReopen();
+  ASSERT_TRUE(!s.ok());
+
+  RepairDB();
+  Reopen();
+  std::string v;
+  ASSERT_OK(db_->Get(ReadOptions(), "foo", &v));
+  ASSERT_EQ("hello", v);
+}
+
+TEST(CorruptionTest, CompactionInputError) {
+  Build(10);
+  DBImpl* dbi = reinterpret_cast<DBImpl*>(db_);
+  dbi->TEST_CompactMemTable();
+  const int last = config::kMaxMemCompactLevel;
+  ASSERT_EQ(1, Property("leveldb.num-files-at-level" + NumberToString(last)));
+
+  Corrupt(kTableFile, 100, 1);
+  Check(5, 9);
+
+  // Force compactions by writing lots of values
+  Build(10000);
+  Check(10000, 10000);
+}
+
+TEST(CorruptionTest, CompactionInputErrorParanoid) {
+  options_.paranoid_checks = true;
+  options_.write_buffer_size = 512 << 10;
+  Reopen();
+  DBImpl* dbi = reinterpret_cast<DBImpl*>(db_);
+
+  // Make multiple inputs so we need to compact.
+  for (int i = 0; i < 2; i++) {
+    Build(10);
+    dbi->TEST_CompactMemTable();
+    Corrupt(kTableFile, 100, 1);
+    env_.SleepForMicroseconds(100000);
+  }
+  dbi->CompactRange(NULL, NULL);
+
+  // Write must fail because of corrupted table
+  std::string tmp1, tmp2;
+  Status s = db_->Put(WriteOptions(), Key(5, &tmp1), Value(5, &tmp2));
+  ASSERT_TRUE(!s.ok()) << "write did not fail in corrupted paranoid db";
+}
+
+TEST(CorruptionTest, UnrelatedKeys) {
+  Build(10);
+  DBImpl* dbi = reinterpret_cast<DBImpl*>(db_);
+  dbi->TEST_CompactMemTable();
+  Corrupt(kTableFile, 100, 1);
+
+  std::string tmp1, tmp2;
+  ASSERT_OK(db_->Put(WriteOptions(), Key(1000, &tmp1), Value(1000, &tmp2)));
+  std::string v;
+  ASSERT_OK(db_->Get(ReadOptions(), Key(1000, &tmp1), &v));
+  ASSERT_EQ(Value(1000, &tmp2).ToString(), v);
+  dbi->TEST_CompactMemTable();
+  ASSERT_OK(db_->Get(ReadOptions(), Key(1000, &tmp1), &v));
+  ASSERT_EQ(Value(1000, &tmp2).ToString(), v);
+}
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/db/db_bench.cc b/depend/zcash/src/leveldb/db/db_bench.cc
new file mode 100644
index 000000000..9ac04c416
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/db_bench.cc
@@ -0,0 +1,1020 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include <sys/types.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include "db/db_impl.h"
+#include "db/version_set.h"
+#include "leveldb/cache.h"
+#include "leveldb/db.h"
+#include "leveldb/env.h"
+#include "leveldb/write_batch.h"
+#include "port/port.h"
+#include "util/crc32c.h"
+#include "util/histogram.h"
+#include "util/mutexlock.h"
+#include "util/random.h"
+#include "util/testutil.h"
+
+// Comma-separated list of operations to run in the specified order
+//   Actual benchmarks:
+//      fillseq       -- write N values in sequential key order in async mode
+//      fillrandom    -- write N values in random key order in async mode
+//      overwrite     -- overwrite N values in random key order in async mode
+//      fillsync      -- write N/100 values in random key order in sync mode
+//      fill100K      -- write N/1000 100K values in random order in async mode
+//      deleteseq     -- delete N keys in sequential order
+//      deleterandom  -- delete N keys in random order
+//      readseq       -- read N times sequentially
+//      readreverse   -- read N times in reverse order
+//      readrandom    -- read N times in random order
+//      readmissing   -- read N missing keys in random order
+//      readhot       -- read N times in random order from 1% section of DB
+//      seekrandom    -- N random seeks
+//      open          -- cost of opening a DB
+//      crc32c        -- repeated crc32c of 4K of data
+//      acquireload   -- load N*1000 times
+//   Meta operations:
+//      compact     -- Compact the entire DB
+//      stats       -- Print DB stats
+//      sstables    -- Print sstable info
+//      heapprofile -- Dump a heap profile (if supported by this port)
+static const char* FLAGS_benchmarks =
+    "fillseq,"
+    "fillsync,"
+    "fillrandom,"
+    "overwrite,"
+    "readrandom,"
+    "readrandom,"  // Extra run to allow previous compactions to quiesce
+    "readseq,"
+    "readreverse,"
+    "compact,"
+    "readrandom,"
+    "readseq,"
+    "readreverse,"
+    "fill100K,"
+    "crc32c,"
+    "snappycomp,"
+    "snappyuncomp,"
+    "acquireload,"
+    ;
+
+// Number of key/values to place in database
+static int FLAGS_num = 1000000;
+
+// Number of read operations to do.  If negative, do FLAGS_num reads.
+static int FLAGS_reads = -1;
+
+// Number of concurrent threads to run.
+static int FLAGS_threads = 1;
+
+// Size of each value
+static int FLAGS_value_size = 100;
+
+// Arrange to generate values that shrink to this fraction of
+// their original size after compression
+static double FLAGS_compression_ratio = 0.5;
+
+// Print histogram of operation timings
+static bool FLAGS_histogram = false;
+
+// Number of bytes to buffer in memtable before compacting
+// (initialized to default value by "main")
+static int FLAGS_write_buffer_size = 0;
+
+// Number of bytes written to each file.
+// (initialized to default value by "main")
+static int FLAGS_max_file_size = 0;
+
+// Approximate size of user data packed per block (before compression).
+// (initialized to default value by "main")
+static int FLAGS_block_size = 0;
+
+// Number of bytes to use as a cache of uncompressed data.
+// Negative means use default settings.
+static int FLAGS_cache_size = -1;
+
+// Maximum number of files to keep open at the same time (use default if == 0)
+static int FLAGS_open_files = 0;
+
+// Bloom filter bits per key.
+// Negative means use default settings.
+static int FLAGS_bloom_bits = -1;
+
+// If true, do not destroy the existing database.  If you set this
+// flag and also specify a benchmark that wants a fresh database, that
+// benchmark will fail.
+static bool FLAGS_use_existing_db = false;
+
+// If true, reuse existing log/MANIFEST files when re-opening a database.
+static bool FLAGS_reuse_logs = false;
+
+// Use the db with the following name.
+static const char* FLAGS_db = NULL;
+
+namespace leveldb {
+
+namespace {
+leveldb::Env* g_env = NULL;
+
+// Helper for quickly generating random data.
+class RandomGenerator {
+ private:
+  std::string data_;
+  int pos_;
+
+ public:
+  RandomGenerator() {
+    // We use a limited amount of data over and over again and ensure
+    // that it is larger than the compression window (32KB), and also
+    // large enough to serve all typical value sizes we want to write.
+    Random rnd(301);
+    std::string piece;
+    while (data_.size() < 1048576) {
+      // Add a short fragment that is as compressible as specified
+      // by FLAGS_compression_ratio.
+      test::CompressibleString(&rnd, FLAGS_compression_ratio, 100, &piece);
+      data_.append(piece);
+    }
+    pos_ = 0;
+  }
+
+  Slice Generate(size_t len) {
+    if (pos_ + len > data_.size()) {
+      pos_ = 0;
+      assert(len < data_.size());
+    }
+    pos_ += len;
+    return Slice(data_.data() + pos_ - len, len);
+  }
+};
+
+#if defined(__linux)
+static Slice TrimSpace(Slice s) {
+  size_t start = 0;
+  while (start < s.size() && isspace(s[start])) {
+    start++;
+  }
+  size_t limit = s.size();
+  while (limit > start && isspace(s[limit-1])) {
+    limit--;
+  }
+  return Slice(s.data() + start, limit - start);
+}
+#endif
+
+static void AppendWithSpace(std::string* str, Slice msg) {
+  if (msg.empty()) return;
+  if (!str->empty()) {
+    str->push_back(' ');
+  }
+  str->append(msg.data(), msg.size());
+}
+
+class Stats {
+ private:
+  double start_;
+  double finish_;
+  double seconds_;
+  int done_;
+  int next_report_;
+  int64_t bytes_;
+  double last_op_finish_;
+  Histogram hist_;
+  std::string message_;
+
+ public:
+  Stats() { Start(); }
+
+  void Start() {
+    next_report_ = 100;
+    last_op_finish_ = start_;
+    hist_.Clear();
+    done_ = 0;
+    bytes_ = 0;
+    seconds_ = 0;
+    start_ = g_env->NowMicros();
+    finish_ = start_;
+    message_.clear();
+  }
+
+  void Merge(const Stats& other) {
+    hist_.Merge(other.hist_);
+    done_ += other.done_;
+    bytes_ += other.bytes_;
+    seconds_ += other.seconds_;
+    if (other.start_ < start_) start_ = other.start_;
+    if (other.finish_ > finish_) finish_ = other.finish_;
+
+    // Just keep the messages from one thread
+    if (message_.empty()) message_ = other.message_;
+  }
+
+  void Stop() {
+    finish_ = g_env->NowMicros();
+    seconds_ = (finish_ - start_) * 1e-6;
+  }
+
+  void AddMessage(Slice msg) {
+    AppendWithSpace(&message_, msg);
+  }
+
+  void FinishedSingleOp() {
+    if (FLAGS_histogram) {
+      double now = g_env->NowMicros();
+      double micros = now - last_op_finish_;
+      hist_.Add(micros);
+      if (micros > 20000) {
+        fprintf(stderr, "long op: %.1f micros%30s\r", micros, "");
+        fflush(stderr);
+      }
+      last_op_finish_ = now;
+    }
+
+    done_++;
+    if (done_ >= next_report_) {
+      if      (next_report_ < 1000)   next_report_ += 100;
+      else if (next_report_ < 5000)   next_report_ += 500;
+      else if (next_report_ < 10000)  next_report_ += 1000;
+      else if (next_report_ < 50000)  next_report_ += 5000;
+      else if (next_report_ < 100000) next_report_ += 10000;
+      else if (next_report_ < 500000) next_report_ += 50000;
+      else                            next_report_ += 100000;
+      fprintf(stderr, "... finished %d ops%30s\r", done_, "");
+      fflush(stderr);
+    }
+  }
+
+  void AddBytes(int64_t n) {
+    bytes_ += n;
+  }
+
+  void Report(const Slice& name) {
+    // Pretend at least one op was done in case we are running a benchmark
+    // that does not call FinishedSingleOp().
+    if (done_ < 1) done_ = 1;
+
+    std::string extra;
+    if (bytes_ > 0) {
+      // Rate is computed on actual elapsed time, not the sum of per-thread
+      // elapsed times.
+      double elapsed = (finish_ - start_) * 1e-6;
+      char rate[100];
+      snprintf(rate, sizeof(rate), "%6.1f MB/s",
+               (bytes_ / 1048576.0) / elapsed);
+      extra = rate;
+    }
+    AppendWithSpace(&extra, message_);
+
+    fprintf(stdout, "%-12s : %11.3f micros/op;%s%s\n",
+            name.ToString().c_str(),
+            seconds_ * 1e6 / done_,
+            (extra.empty() ? "" : " "),
+            extra.c_str());
+    if (FLAGS_histogram) {
+      fprintf(stdout, "Microseconds per op:\n%s\n", hist_.ToString().c_str());
+    }
+    fflush(stdout);
+  }
+};
+
+// State shared by all concurrent executions of the same benchmark.
+struct SharedState {
+  port::Mutex mu;
+  port::CondVar cv;
+  int total;
+
+  // Each thread goes through the following states:
+  //    (1) initializing
+  //    (2) waiting for others to be initialized
+  //    (3) running
+  //    (4) done
+
+  int num_initialized;
+  int num_done;
+  bool start;
+
+  SharedState() : cv(&mu) { }
+};
+
+// Per-thread state for concurrent executions of the same benchmark.
+struct ThreadState {
+  int tid;             // 0..n-1 when running in n threads
+  Random rand;         // Has different seeds for different threads
+  Stats stats;
+  SharedState* shared;
+
+  ThreadState(int index)
+      : tid(index),
+        rand(1000 + index) {
+  }
+};
+
+}  // namespace
+
+class Benchmark {
+ private:
+  Cache* cache_;
+  const FilterPolicy* filter_policy_;
+  DB* db_;
+  int num_;
+  int value_size_;
+  int entries_per_batch_;
+  WriteOptions write_options_;
+  int reads_;
+  int heap_counter_;
+
+  void PrintHeader() {
+    const int kKeySize = 16;
+    PrintEnvironment();
+    fprintf(stdout, "Keys:       %d bytes each\n", kKeySize);
+    fprintf(stdout, "Values:     %d bytes each (%d bytes after compression)\n",
+            FLAGS_value_size,
+            static_cast<int>(FLAGS_value_size * FLAGS_compression_ratio + 0.5));
+    fprintf(stdout, "Entries:    %d\n", num_);
+    fprintf(stdout, "RawSize:    %.1f MB (estimated)\n",
+            ((static_cast<int64_t>(kKeySize + FLAGS_value_size) * num_)
+             / 1048576.0));
+    fprintf(stdout, "FileSize:   %.1f MB (estimated)\n",
+            (((kKeySize + FLAGS_value_size * FLAGS_compression_ratio) * num_)
+             / 1048576.0));
+    PrintWarnings();
+    fprintf(stdout, "------------------------------------------------\n");
+  }
+
+  void PrintWarnings() {
+#if defined(__GNUC__) && !defined(__OPTIMIZE__)
+    fprintf(stdout,
+            "WARNING: Optimization is disabled: benchmarks unnecessarily slow\n"
+            );
+#endif
+#ifndef NDEBUG
+    fprintf(stdout,
+            "WARNING: Assertions are enabled; benchmarks unnecessarily slow\n");
+#endif
+
+    // See if snappy is working by attempting to compress a compressible string
+    const char text[] = "yyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyy";
+    std::string compressed;
+    if (!port::Snappy_Compress(text, sizeof(text), &compressed)) {
+      fprintf(stdout, "WARNING: Snappy compression is not enabled\n");
+    } else if (compressed.size() >= sizeof(text)) {
+      fprintf(stdout, "WARNING: Snappy compression is not effective\n");
+    }
+  }
+
+  void PrintEnvironment() {
+    fprintf(stderr, "LevelDB:    version %d.%d\n",
+            kMajorVersion, kMinorVersion);
+
+#if defined(__linux)
+    time_t now = time(NULL);
+    fprintf(stderr, "Date:       %s", ctime(&now));  // ctime() adds newline
+
+    FILE* cpuinfo = fopen("/proc/cpuinfo", "r");
+    if (cpuinfo != NULL) {
+      char line[1000];
+      int num_cpus = 0;
+      std::string cpu_type;
+      std::string cache_size;
+      while (fgets(line, sizeof(line), cpuinfo) != NULL) {
+        const char* sep = strchr(line, ':');
+        if (sep == NULL) {
+          continue;
+        }
+        Slice key = TrimSpace(Slice(line, sep - 1 - line));
+        Slice val = TrimSpace(Slice(sep + 1));
+        if (key == "model name") {
+          ++num_cpus;
+          cpu_type = val.ToString();
+        } else if (key == "cache size") {
+          cache_size = val.ToString();
+        }
+      }
+      fclose(cpuinfo);
+      fprintf(stderr, "CPU:        %d * %s\n", num_cpus, cpu_type.c_str());
+      fprintf(stderr, "CPUCache:   %s\n", cache_size.c_str());
+    }
+#endif
+  }
+
+ public:
+  Benchmark()
+  : cache_(FLAGS_cache_size >= 0 ? NewLRUCache(FLAGS_cache_size) : NULL),
+    filter_policy_(FLAGS_bloom_bits >= 0
+                   ? NewBloomFilterPolicy(FLAGS_bloom_bits)
+                   : NULL),
+    db_(NULL),
+    num_(FLAGS_num),
+    value_size_(FLAGS_value_size),
+    entries_per_batch_(1),
+    reads_(FLAGS_reads < 0 ? FLAGS_num : FLAGS_reads),
+    heap_counter_(0) {
+    std::vector<std::string> files;
+    g_env->GetChildren(FLAGS_db, &files);
+    for (size_t i = 0; i < files.size(); i++) {
+      if (Slice(files[i]).starts_with("heap-")) {
+        g_env->DeleteFile(std::string(FLAGS_db) + "/" + files[i]);
+      }
+    }
+    if (!FLAGS_use_existing_db) {
+      DestroyDB(FLAGS_db, Options());
+    }
+  }
+
+  ~Benchmark() {
+    delete db_;
+    delete cache_;
+    delete filter_policy_;
+  }
+
+  void Run() {
+    PrintHeader();
+    Open();
+
+    const char* benchmarks = FLAGS_benchmarks;
+    while (benchmarks != NULL) {
+      const char* sep = strchr(benchmarks, ',');
+      Slice name;
+      if (sep == NULL) {
+        name = benchmarks;
+        benchmarks = NULL;
+      } else {
+        name = Slice(benchmarks, sep - benchmarks);
+        benchmarks = sep + 1;
+      }
+
+      // Reset parameters that may be overridden below
+      num_ = FLAGS_num;
+      reads_ = (FLAGS_reads < 0 ? FLAGS_num : FLAGS_reads);
+      value_size_ = FLAGS_value_size;
+      entries_per_batch_ = 1;
+      write_options_ = WriteOptions();
+
+      void (Benchmark::*method)(ThreadState*) = NULL;
+      bool fresh_db = false;
+      int num_threads = FLAGS_threads;
+
+      if (name == Slice("open")) {
+        method = &Benchmark::OpenBench;
+        num_ /= 10000;
+        if (num_ < 1) num_ = 1;
+      } else if (name == Slice("fillseq")) {
+        fresh_db = true;
+        method = &Benchmark::WriteSeq;
+      } else if (name == Slice("fillbatch")) {
+        fresh_db = true;
+        entries_per_batch_ = 1000;
+        method = &Benchmark::WriteSeq;
+      } else if (name == Slice("fillrandom")) {
+        fresh_db = true;
+        method = &Benchmark::WriteRandom;
+      } else if (name == Slice("overwrite")) {
+        fresh_db = false;
+        method = &Benchmark::WriteRandom;
+      } else if (name == Slice("fillsync")) {
+        fresh_db = true;
+        num_ /= 1000;
+        write_options_.sync = true;
+        method = &Benchmark::WriteRandom;
+      } else if (name == Slice("fill100K")) {
+        fresh_db = true;
+        num_ /= 1000;
+        value_size_ = 100 * 1000;
+        method = &Benchmark::WriteRandom;
+      } else if (name == Slice("readseq")) {
+        method = &Benchmark::ReadSequential;
+      } else if (name == Slice("readreverse")) {
+        method = &Benchmark::ReadReverse;
+      } else if (name == Slice("readrandom")) {
+        method = &Benchmark::ReadRandom;
+      } else if (name == Slice("readmissing")) {
+        method = &Benchmark::ReadMissing;
+      } else if (name == Slice("seekrandom")) {
+        method = &Benchmark::SeekRandom;
+      } else if (name == Slice("readhot")) {
+        method = &Benchmark::ReadHot;
+      } else if (name == Slice("readrandomsmall")) {
+        reads_ /= 1000;
+        method = &Benchmark::ReadRandom;
+      } else if (name == Slice("deleteseq")) {
+        method = &Benchmark::DeleteSeq;
+      } else if (name == Slice("deleterandom")) {
+        method = &Benchmark::DeleteRandom;
+      } else if (name == Slice("readwhilewriting")) {
+        num_threads++;  // Add extra thread for writing
+        method = &Benchmark::ReadWhileWriting;
+      } else if (name == Slice("compact")) {
+        method = &Benchmark::Compact;
+      } else if (name == Slice("crc32c")) {
+        method = &Benchmark::Crc32c;
+      } else if (name == Slice("acquireload")) {
+        method = &Benchmark::AcquireLoad;
+      } else if (name == Slice("snappycomp")) {
+        method = &Benchmark::SnappyCompress;
+      } else if (name == Slice("snappyuncomp")) {
+        method = &Benchmark::SnappyUncompress;
+      } else if (name == Slice("heapprofile")) {
+        HeapProfile();
+      } else if (name == Slice("stats")) {
+        PrintStats("leveldb.stats");
+      } else if (name == Slice("sstables")) {
+        PrintStats("leveldb.sstables");
+      } else {
+        if (name != Slice()) {  // No error message for empty name
+          fprintf(stderr, "unknown benchmark '%s'\n", name.ToString().c_str());
+        }
+      }
+
+      if (fresh_db) {
+        if (FLAGS_use_existing_db) {
+          fprintf(stdout, "%-12s : skipped (--use_existing_db is true)\n",
+                  name.ToString().c_str());
+          method = NULL;
+        } else {
+          delete db_;
+          db_ = NULL;
+          DestroyDB(FLAGS_db, Options());
+          Open();
+        }
+      }
+
+      if (method != NULL) {
+        RunBenchmark(num_threads, name, method);
+      }
+    }
+  }
+
+ private:
+  struct ThreadArg {
+    Benchmark* bm;
+    SharedState* shared;
+    ThreadState* thread;
+    void (Benchmark::*method)(ThreadState*);
+  };
+
+  static void ThreadBody(void* v) {
+    ThreadArg* arg = reinterpret_cast<ThreadArg*>(v);
+    SharedState* shared = arg->shared;
+    ThreadState* thread = arg->thread;
+    {
+      MutexLock l(&shared->mu);
+      shared->num_initialized++;
+      if (shared->num_initialized >= shared->total) {
+        shared->cv.SignalAll();
+      }
+      while (!shared->start) {
+        shared->cv.Wait();
+      }
+    }
+
+    thread->stats.Start();
+    (arg->bm->*(arg->method))(thread);
+    thread->stats.Stop();
+
+    {
+      MutexLock l(&shared->mu);
+      shared->num_done++;
+      if (shared->num_done >= shared->total) {
+        shared->cv.SignalAll();
+      }
+    }
+  }
+
+  void RunBenchmark(int n, Slice name,
+                    void (Benchmark::*method)(ThreadState*)) {
+    SharedState shared;
+    shared.total = n;
+    shared.num_initialized = 0;
+    shared.num_done = 0;
+    shared.start = false;
+
+    ThreadArg* arg = new ThreadArg[n];
+    for (int i = 0; i < n; i++) {
+      arg[i].bm = this;
+      arg[i].method = method;
+      arg[i].shared = &shared;
+      arg[i].thread = new ThreadState(i);
+      arg[i].thread->shared = &shared;
+      g_env->StartThread(ThreadBody, &arg[i]);
+    }
+
+    shared.mu.Lock();
+    while (shared.num_initialized < n) {
+      shared.cv.Wait();
+    }
+
+    shared.start = true;
+    shared.cv.SignalAll();
+    while (shared.num_done < n) {
+      shared.cv.Wait();
+    }
+    shared.mu.Unlock();
+
+    for (int i = 1; i < n; i++) {
+      arg[0].thread->stats.Merge(arg[i].thread->stats);
+    }
+    arg[0].thread->stats.Report(name);
+
+    for (int i = 0; i < n; i++) {
+      delete arg[i].thread;
+    }
+    delete[] arg;
+  }
+
+  void Crc32c(ThreadState* thread) {
+    // Checksum about 500MB of data total
+    const int size = 4096;
+    const char* label = "(4K per op)";
+    std::string data(size, 'x');
+    int64_t bytes = 0;
+    uint32_t crc = 0;
+    while (bytes < 500 * 1048576) {
+      crc = crc32c::Value(data.data(), size);
+      thread->stats.FinishedSingleOp();
+      bytes += size;
+    }
+    // Print so result is not dead
+    fprintf(stderr, "... crc=0x%x\r", static_cast<unsigned int>(crc));
+
+    thread->stats.AddBytes(bytes);
+    thread->stats.AddMessage(label);
+  }
+
+  void AcquireLoad(ThreadState* thread) {
+    int dummy;
+    port::AtomicPointer ap(&dummy);
+    int count = 0;
+    void *ptr = NULL;
+    thread->stats.AddMessage("(each op is 1000 loads)");
+    while (count < 100000) {
+      for (int i = 0; i < 1000; i++) {
+        ptr = ap.Acquire_Load();
+      }
+      count++;
+      thread->stats.FinishedSingleOp();
+    }
+    if (ptr == NULL) exit(1); // Disable unused variable warning.
+  }
+
+  void SnappyCompress(ThreadState* thread) {
+    RandomGenerator gen;
+    Slice input = gen.Generate(Options().block_size);
+    int64_t bytes = 0;
+    int64_t produced = 0;
+    bool ok = true;
+    std::string compressed;
+    while (ok && bytes < 1024 * 1048576) {  // Compress 1G
+      ok = port::Snappy_Compress(input.data(), input.size(), &compressed);
+      produced += compressed.size();
+      bytes += input.size();
+      thread->stats.FinishedSingleOp();
+    }
+
+    if (!ok) {
+      thread->stats.AddMessage("(snappy failure)");
+    } else {
+      char buf[100];
+      snprintf(buf, sizeof(buf), "(output: %.1f%%)",
+               (produced * 100.0) / bytes);
+      thread->stats.AddMessage(buf);
+      thread->stats.AddBytes(bytes);
+    }
+  }
+
+  void SnappyUncompress(ThreadState* thread) {
+    RandomGenerator gen;
+    Slice input = gen.Generate(Options().block_size);
+    std::string compressed;
+    bool ok = port::Snappy_Compress(input.data(), input.size(), &compressed);
+    int64_t bytes = 0;
+    char* uncompressed = new char[input.size()];
+    while (ok && bytes < 1024 * 1048576) {  // Compress 1G
+      ok =  port::Snappy_Uncompress(compressed.data(), compressed.size(),
+                                    uncompressed);
+      bytes += input.size();
+      thread->stats.FinishedSingleOp();
+    }
+    delete[] uncompressed;
+
+    if (!ok) {
+      thread->stats.AddMessage("(snappy failure)");
+    } else {
+      thread->stats.AddBytes(bytes);
+    }
+  }
+
+  void Open() {
+    assert(db_ == NULL);
+    Options options;
+    options.env = g_env;
+    options.create_if_missing = !FLAGS_use_existing_db;
+    options.block_cache = cache_;
+    options.write_buffer_size = FLAGS_write_buffer_size;
+    options.max_file_size = FLAGS_max_file_size;
+    options.block_size = FLAGS_block_size;
+    options.max_open_files = FLAGS_open_files;
+    options.filter_policy = filter_policy_;
+    options.reuse_logs = FLAGS_reuse_logs;
+    Status s = DB::Open(options, FLAGS_db, &db_);
+    if (!s.ok()) {
+      fprintf(stderr, "open error: %s\n", s.ToString().c_str());
+      exit(1);
+    }
+  }
+
+  void OpenBench(ThreadState* thread) {
+    for (int i = 0; i < num_; i++) {
+      delete db_;
+      Open();
+      thread->stats.FinishedSingleOp();
+    }
+  }
+
+  void WriteSeq(ThreadState* thread) {
+    DoWrite(thread, true);
+  }
+
+  void WriteRandom(ThreadState* thread) {
+    DoWrite(thread, false);
+  }
+
+  void DoWrite(ThreadState* thread, bool seq) {
+    if (num_ != FLAGS_num) {
+      char msg[100];
+      snprintf(msg, sizeof(msg), "(%d ops)", num_);
+      thread->stats.AddMessage(msg);
+    }
+
+    RandomGenerator gen;
+    WriteBatch batch;
+    Status s;
+    int64_t bytes = 0;
+    for (int i = 0; i < num_; i += entries_per_batch_) {
+      batch.Clear();
+      for (int j = 0; j < entries_per_batch_; j++) {
+        const int k = seq ? i+j : (thread->rand.Next() % FLAGS_num);
+        char key[100];
+        snprintf(key, sizeof(key), "%016d", k);
+        batch.Put(key, gen.Generate(value_size_));
+        bytes += value_size_ + strlen(key);
+        thread->stats.FinishedSingleOp();
+      }
+      s = db_->Write(write_options_, &batch);
+      if (!s.ok()) {
+        fprintf(stderr, "put error: %s\n", s.ToString().c_str());
+        exit(1);
+      }
+    }
+    thread->stats.AddBytes(bytes);
+  }
+
+  void ReadSequential(ThreadState* thread) {
+    Iterator* iter = db_->NewIterator(ReadOptions());
+    int i = 0;
+    int64_t bytes = 0;
+    for (iter->SeekToFirst(); i < reads_ && iter->Valid(); iter->Next()) {
+      bytes += iter->key().size() + iter->value().size();
+      thread->stats.FinishedSingleOp();
+      ++i;
+    }
+    delete iter;
+    thread->stats.AddBytes(bytes);
+  }
+
+  void ReadReverse(ThreadState* thread) {
+    Iterator* iter = db_->NewIterator(ReadOptions());
+    int i = 0;
+    int64_t bytes = 0;
+    for (iter->SeekToLast(); i < reads_ && iter->Valid(); iter->Prev()) {
+      bytes += iter->key().size() + iter->value().size();
+      thread->stats.FinishedSingleOp();
+      ++i;
+    }
+    delete iter;
+    thread->stats.AddBytes(bytes);
+  }
+
+  void ReadRandom(ThreadState* thread) {
+    ReadOptions options;
+    std::string value;
+    int found = 0;
+    for (int i = 0; i < reads_; i++) {
+      char key[100];
+      const int k = thread->rand.Next() % FLAGS_num;
+      snprintf(key, sizeof(key), "%016d", k);
+      if (db_->Get(options, key, &value).ok()) {
+        found++;
+      }
+      thread->stats.FinishedSingleOp();
+    }
+    char msg[100];
+    snprintf(msg, sizeof(msg), "(%d of %d found)", found, num_);
+    thread->stats.AddMessage(msg);
+  }
+
+  void ReadMissing(ThreadState* thread) {
+    ReadOptions options;
+    std::string value;
+    for (int i = 0; i < reads_; i++) {
+      char key[100];
+      const int k = thread->rand.Next() % FLAGS_num;
+      snprintf(key, sizeof(key), "%016d.", k);
+      db_->Get(options, key, &value);
+      thread->stats.FinishedSingleOp();
+    }
+  }
+
+  void ReadHot(ThreadState* thread) {
+    ReadOptions options;
+    std::string value;
+    const int range = (FLAGS_num + 99) / 100;
+    for (int i = 0; i < reads_; i++) {
+      char key[100];
+      const int k = thread->rand.Next() % range;
+      snprintf(key, sizeof(key), "%016d", k);
+      db_->Get(options, key, &value);
+      thread->stats.FinishedSingleOp();
+    }
+  }
+
+  void SeekRandom(ThreadState* thread) {
+    ReadOptions options;
+    int found = 0;
+    for (int i = 0; i < reads_; i++) {
+      Iterator* iter = db_->NewIterator(options);
+      char key[100];
+      const int k = thread->rand.Next() % FLAGS_num;
+      snprintf(key, sizeof(key), "%016d", k);
+      iter->Seek(key);
+      if (iter->Valid() && iter->key() == key) found++;
+      delete iter;
+      thread->stats.FinishedSingleOp();
+    }
+    char msg[100];
+    snprintf(msg, sizeof(msg), "(%d of %d found)", found, num_);
+    thread->stats.AddMessage(msg);
+  }
+
+  void DoDelete(ThreadState* thread, bool seq) {
+    RandomGenerator gen;
+    WriteBatch batch;
+    Status s;
+    for (int i = 0; i < num_; i += entries_per_batch_) {
+      batch.Clear();
+      for (int j = 0; j < entries_per_batch_; j++) {
+        const int k = seq ? i+j : (thread->rand.Next() % FLAGS_num);
+        char key[100];
+        snprintf(key, sizeof(key), "%016d", k);
+        batch.Delete(key);
+        thread->stats.FinishedSingleOp();
+      }
+      s = db_->Write(write_options_, &batch);
+      if (!s.ok()) {
+        fprintf(stderr, "del error: %s\n", s.ToString().c_str());
+        exit(1);
+      }
+    }
+  }
+
+  void DeleteSeq(ThreadState* thread) {
+    DoDelete(thread, true);
+  }
+
+  void DeleteRandom(ThreadState* thread) {
+    DoDelete(thread, false);
+  }
+
+  void ReadWhileWriting(ThreadState* thread) {
+    if (thread->tid > 0) {
+      ReadRandom(thread);
+    } else {
+      // Special thread that keeps writing until other threads are done.
+      RandomGenerator gen;
+      while (true) {
+        {
+          MutexLock l(&thread->shared->mu);
+          if (thread->shared->num_done + 1 >= thread->shared->num_initialized) {
+            // Other threads have finished
+            break;
+          }
+        }
+
+        const int k = thread->rand.Next() % FLAGS_num;
+        char key[100];
+        snprintf(key, sizeof(key), "%016d", k);
+        Status s = db_->Put(write_options_, key, gen.Generate(value_size_));
+        if (!s.ok()) {
+          fprintf(stderr, "put error: %s\n", s.ToString().c_str());
+          exit(1);
+        }
+      }
+
+      // Do not count any of the preceding work/delay in stats.
+      thread->stats.Start();
+    }
+  }
+
+  void Compact(ThreadState* thread) {
+    db_->CompactRange(NULL, NULL);
+  }
+
+  void PrintStats(const char* key) {
+    std::string stats;
+    if (!db_->GetProperty(key, &stats)) {
+      stats = "(failed)";
+    }
+    fprintf(stdout, "\n%s\n", stats.c_str());
+  }
+
+  static void WriteToFile(void* arg, const char* buf, int n) {
+    reinterpret_cast<WritableFile*>(arg)->Append(Slice(buf, n));
+  }
+
+  void HeapProfile() {
+    char fname[100];
+    snprintf(fname, sizeof(fname), "%s/heap-%04d", FLAGS_db, ++heap_counter_);
+    WritableFile* file;
+    Status s = g_env->NewWritableFile(fname, &file);
+    if (!s.ok()) {
+      fprintf(stderr, "%s\n", s.ToString().c_str());
+      return;
+    }
+    bool ok = port::GetHeapProfile(WriteToFile, file);
+    delete file;
+    if (!ok) {
+      fprintf(stderr, "heap profiling not supported\n");
+      g_env->DeleteFile(fname);
+    }
+  }
+};
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  FLAGS_write_buffer_size = leveldb::Options().write_buffer_size;
+  FLAGS_max_file_size = leveldb::Options().max_file_size;
+  FLAGS_block_size = leveldb::Options().block_size;
+  FLAGS_open_files = leveldb::Options().max_open_files;
+  std::string default_db_path;
+
+  for (int i = 1; i < argc; i++) {
+    double d;
+    int n;
+    char junk;
+    if (leveldb::Slice(argv[i]).starts_with("--benchmarks=")) {
+      FLAGS_benchmarks = argv[i] + strlen("--benchmarks=");
+    } else if (sscanf(argv[i], "--compression_ratio=%lf%c", &d, &junk) == 1) {
+      FLAGS_compression_ratio = d;
+    } else if (sscanf(argv[i], "--histogram=%d%c", &n, &junk) == 1 &&
+               (n == 0 || n == 1)) {
+      FLAGS_histogram = n;
+    } else if (sscanf(argv[i], "--use_existing_db=%d%c", &n, &junk) == 1 &&
+               (n == 0 || n == 1)) {
+      FLAGS_use_existing_db = n;
+    } else if (sscanf(argv[i], "--reuse_logs=%d%c", &n, &junk) == 1 &&
+               (n == 0 || n == 1)) {
+      FLAGS_reuse_logs = n;
+    } else if (sscanf(argv[i], "--num=%d%c", &n, &junk) == 1) {
+      FLAGS_num = n;
+    } else if (sscanf(argv[i], "--reads=%d%c", &n, &junk) == 1) {
+      FLAGS_reads = n;
+    } else if (sscanf(argv[i], "--threads=%d%c", &n, &junk) == 1) {
+      FLAGS_threads = n;
+    } else if (sscanf(argv[i], "--value_size=%d%c", &n, &junk) == 1) {
+      FLAGS_value_size = n;
+    } else if (sscanf(argv[i], "--write_buffer_size=%d%c", &n, &junk) == 1) {
+      FLAGS_write_buffer_size = n;
+    } else if (sscanf(argv[i], "--max_file_size=%d%c", &n, &junk) == 1) {
+      FLAGS_max_file_size = n;
+    } else if (sscanf(argv[i], "--block_size=%d%c", &n, &junk) == 1) {
+      FLAGS_block_size = n;
+    } else if (sscanf(argv[i], "--cache_size=%d%c", &n, &junk) == 1) {
+      FLAGS_cache_size = n;
+    } else if (sscanf(argv[i], "--bloom_bits=%d%c", &n, &junk) == 1) {
+      FLAGS_bloom_bits = n;
+    } else if (sscanf(argv[i], "--open_files=%d%c", &n, &junk) == 1) {
+      FLAGS_open_files = n;
+    } else if (strncmp(argv[i], "--db=", 5) == 0) {
+      FLAGS_db = argv[i] + 5;
+    } else {
+      fprintf(stderr, "Invalid flag '%s'\n", argv[i]);
+      exit(1);
+    }
+  }
+
+  leveldb::g_env = leveldb::Env::Default();
+
+  // Choose a location for the test database if none given with --db=<path>
+  if (FLAGS_db == NULL) {
+      leveldb::g_env->GetTestDirectory(&default_db_path);
+      default_db_path += "/dbbench";
+      FLAGS_db = default_db_path.c_str();
+  }
+
+  leveldb::Benchmark benchmark;
+  benchmark.Run();
+  return 0;
+}
diff --git a/depend/zcash/src/leveldb/db/db_impl.cc b/depend/zcash/src/leveldb/db/db_impl.cc
new file mode 100644
index 000000000..3bb58e560
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/db_impl.cc
@@ -0,0 +1,1568 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "db/db_impl.h"
+
+#include <algorithm>
+#include <set>
+#include <string>
+#include <stdint.h>
+#include <stdio.h>
+#include <vector>
+#include "db/builder.h"
+#include "db/db_iter.h"
+#include "db/dbformat.h"
+#include "db/filename.h"
+#include "db/log_reader.h"
+#include "db/log_writer.h"
+#include "db/memtable.h"
+#include "db/table_cache.h"
+#include "db/version_set.h"
+#include "db/write_batch_internal.h"
+#include "leveldb/db.h"
+#include "leveldb/env.h"
+#include "leveldb/status.h"
+#include "leveldb/table.h"
+#include "leveldb/table_builder.h"
+#include "port/port.h"
+#include "table/block.h"
+#include "table/merger.h"
+#include "table/two_level_iterator.h"
+#include "util/coding.h"
+#include "util/logging.h"
+#include "util/mutexlock.h"
+
+namespace leveldb {
+
+const int kNumNonTableCacheFiles = 10;
+
+// Information kept for every waiting writer
+struct DBImpl::Writer {
+  Status status;
+  WriteBatch* batch;
+  bool sync;
+  bool done;
+  port::CondVar cv;
+
+  explicit Writer(port::Mutex* mu) : cv(mu) { }
+};
+
+struct DBImpl::CompactionState {
+  Compaction* const compaction;
+
+  // Sequence numbers < smallest_snapshot are not significant since we
+  // will never have to service a snapshot below smallest_snapshot.
+  // Therefore if we have seen a sequence number S <= smallest_snapshot,
+  // we can drop all entries for the same key with sequence numbers < S.
+  SequenceNumber smallest_snapshot;
+
+  // Files produced by compaction
+  struct Output {
+    uint64_t number;
+    uint64_t file_size;
+    InternalKey smallest, largest;
+  };
+  std::vector<Output> outputs;
+
+  // State kept for output being generated
+  WritableFile* outfile;
+  TableBuilder* builder;
+
+  uint64_t total_bytes;
+
+  Output* current_output() { return &outputs[outputs.size()-1]; }
+
+  explicit CompactionState(Compaction* c)
+      : compaction(c),
+        outfile(NULL),
+        builder(NULL),
+        total_bytes(0) {
+  }
+};
+
+// Fix user-supplied options to be reasonable
+template <class T,class V>
+static void ClipToRange(T* ptr, V minvalue, V maxvalue) {
+  if (static_cast<V>(*ptr) > maxvalue) *ptr = maxvalue;
+  if (static_cast<V>(*ptr) < minvalue) *ptr = minvalue;
+}
+Options SanitizeOptions(const std::string& dbname,
+                        const InternalKeyComparator* icmp,
+                        const InternalFilterPolicy* ipolicy,
+                        const Options& src) {
+  Options result = src;
+  result.comparator = icmp;
+  result.filter_policy = (src.filter_policy != NULL) ? ipolicy : NULL;
+  ClipToRange(&result.max_open_files,    64 + kNumNonTableCacheFiles, 50000);
+  ClipToRange(&result.write_buffer_size, 64<<10,                      1<<30);
+  ClipToRange(&result.max_file_size,     1<<20,                       1<<30);
+  ClipToRange(&result.block_size,        1<<10,                       4<<20);
+  if (result.info_log == NULL) {
+    // Open a log file in the same directory as the db
+    src.env->CreateDir(dbname);  // In case it does not exist
+    src.env->RenameFile(InfoLogFileName(dbname), OldInfoLogFileName(dbname));
+    Status s = src.env->NewLogger(InfoLogFileName(dbname), &result.info_log);
+    if (!s.ok()) {
+      // No place suitable for logging
+      result.info_log = NULL;
+    }
+  }
+  if (result.block_cache == NULL) {
+    result.block_cache = NewLRUCache(8 << 20);
+  }
+  return result;
+}
+
+DBImpl::DBImpl(const Options& raw_options, const std::string& dbname)
+    : env_(raw_options.env),
+      internal_comparator_(raw_options.comparator),
+      internal_filter_policy_(raw_options.filter_policy),
+      options_(SanitizeOptions(dbname, &internal_comparator_,
+                               &internal_filter_policy_, raw_options)),
+      owns_info_log_(options_.info_log != raw_options.info_log),
+      owns_cache_(options_.block_cache != raw_options.block_cache),
+      dbname_(dbname),
+      db_lock_(NULL),
+      shutting_down_(NULL),
+      bg_cv_(&mutex_),
+      mem_(NULL),
+      imm_(NULL),
+      logfile_(NULL),
+      logfile_number_(0),
+      log_(NULL),
+      seed_(0),
+      tmp_batch_(new WriteBatch),
+      bg_compaction_scheduled_(false),
+      manual_compaction_(NULL) {
+  has_imm_.Release_Store(NULL);
+
+  // Reserve ten files or so for other uses and give the rest to TableCache.
+  const int table_cache_size = options_.max_open_files - kNumNonTableCacheFiles;
+  table_cache_ = new TableCache(dbname_, &options_, table_cache_size);
+
+  versions_ = new VersionSet(dbname_, &options_, table_cache_,
+                             &internal_comparator_);
+}
+
+DBImpl::~DBImpl() {
+  // Wait for background work to finish
+  mutex_.Lock();
+  shutting_down_.Release_Store(this);  // Any non-NULL value is ok
+  while (bg_compaction_scheduled_) {
+    bg_cv_.Wait();
+  }
+  mutex_.Unlock();
+
+  if (db_lock_ != NULL) {
+    env_->UnlockFile(db_lock_);
+  }
+
+  delete versions_;
+  if (mem_ != NULL) mem_->Unref();
+  if (imm_ != NULL) imm_->Unref();
+  delete tmp_batch_;
+  delete log_;
+  delete logfile_;
+  delete table_cache_;
+
+  if (owns_info_log_) {
+    delete options_.info_log;
+  }
+  if (owns_cache_) {
+    delete options_.block_cache;
+  }
+}
+
+Status DBImpl::NewDB() {
+  VersionEdit new_db;
+  new_db.SetComparatorName(user_comparator()->Name());
+  new_db.SetLogNumber(0);
+  new_db.SetNextFile(2);
+  new_db.SetLastSequence(0);
+
+  const std::string manifest = DescriptorFileName(dbname_, 1);
+  WritableFile* file;
+  Status s = env_->NewWritableFile(manifest, &file);
+  if (!s.ok()) {
+    return s;
+  }
+  {
+    log::Writer log(file);
+    std::string record;
+    new_db.EncodeTo(&record);
+    s = log.AddRecord(record);
+    if (s.ok()) {
+      s = file->Close();
+    }
+  }
+  delete file;
+  if (s.ok()) {
+    // Make "CURRENT" file that points to the new manifest file.
+    s = SetCurrentFile(env_, dbname_, 1);
+  } else {
+    env_->DeleteFile(manifest);
+  }
+  return s;
+}
+
+void DBImpl::MaybeIgnoreError(Status* s) const {
+  if (s->ok() || options_.paranoid_checks) {
+    // No change needed
+  } else {
+    Log(options_.info_log, "Ignoring error %s", s->ToString().c_str());
+    *s = Status::OK();
+  }
+}
+
+void DBImpl::DeleteObsoleteFiles() {
+  if (!bg_error_.ok()) {
+    // After a background error, we don't know whether a new version may
+    // or may not have been committed, so we cannot safely garbage collect.
+    return;
+  }
+
+  // Make a set of all of the live files
+  std::set<uint64_t> live = pending_outputs_;
+  versions_->AddLiveFiles(&live);
+
+  std::vector<std::string> filenames;
+  env_->GetChildren(dbname_, &filenames); // Ignoring errors on purpose
+  uint64_t number;
+  FileType type;
+  for (size_t i = 0; i < filenames.size(); i++) {
+    if (ParseFileName(filenames[i], &number, &type)) {
+      bool keep = true;
+      switch (type) {
+        case kLogFile:
+          keep = ((number >= versions_->LogNumber()) ||
+                  (number == versions_->PrevLogNumber()));
+          break;
+        case kDescriptorFile:
+          // Keep my manifest file, and any newer incarnations'
+          // (in case there is a race that allows other incarnations)
+          keep = (number >= versions_->ManifestFileNumber());
+          break;
+        case kTableFile:
+          keep = (live.find(number) != live.end());
+          break;
+        case kTempFile:
+          // Any temp files that are currently being written to must
+          // be recorded in pending_outputs_, which is inserted into "live"
+          keep = (live.find(number) != live.end());
+          break;
+        case kCurrentFile:
+        case kDBLockFile:
+        case kInfoLogFile:
+          keep = true;
+          break;
+      }
+
+      if (!keep) {
+        if (type == kTableFile) {
+          table_cache_->Evict(number);
+        }
+        Log(options_.info_log, "Delete type=%d #%lld\n",
+            int(type),
+            static_cast<unsigned long long>(number));
+        env_->DeleteFile(dbname_ + "/" + filenames[i]);
+      }
+    }
+  }
+}
+
+Status DBImpl::Recover(VersionEdit* edit, bool *save_manifest) {
+  mutex_.AssertHeld();
+
+  // Ignore error from CreateDir since the creation of the DB is
+  // committed only when the descriptor is created, and this directory
+  // may already exist from a previous failed creation attempt.
+  env_->CreateDir(dbname_);
+  assert(db_lock_ == NULL);
+  Status s = env_->LockFile(LockFileName(dbname_), &db_lock_);
+  if (!s.ok()) {
+    return s;
+  }
+
+  if (!env_->FileExists(CurrentFileName(dbname_))) {
+    if (options_.create_if_missing) {
+      s = NewDB();
+      if (!s.ok()) {
+        return s;
+      }
+    } else {
+      return Status::InvalidArgument(
+          dbname_, "does not exist (create_if_missing is false)");
+    }
+  } else {
+    if (options_.error_if_exists) {
+      return Status::InvalidArgument(
+          dbname_, "exists (error_if_exists is true)");
+    }
+  }
+
+  s = versions_->Recover(save_manifest);
+  if (!s.ok()) {
+    return s;
+  }
+  SequenceNumber max_sequence(0);
+
+  // Recover from all newer log files than the ones named in the
+  // descriptor (new log files may have been added by the previous
+  // incarnation without registering them in the descriptor).
+  //
+  // Note that PrevLogNumber() is no longer used, but we pay
+  // attention to it in case we are recovering a database
+  // produced by an older version of leveldb.
+  const uint64_t min_log = versions_->LogNumber();
+  const uint64_t prev_log = versions_->PrevLogNumber();
+  std::vector<std::string> filenames;
+  s = env_->GetChildren(dbname_, &filenames);
+  if (!s.ok()) {
+    return s;
+  }
+  std::set<uint64_t> expected;
+  versions_->AddLiveFiles(&expected);
+  uint64_t number;
+  FileType type;
+  std::vector<uint64_t> logs;
+  for (size_t i = 0; i < filenames.size(); i++) {
+    if (ParseFileName(filenames[i], &number, &type)) {
+      expected.erase(number);
+      if (type == kLogFile && ((number >= min_log) || (number == prev_log)))
+        logs.push_back(number);
+    }
+  }
+  if (!expected.empty()) {
+    char buf[50];
+    snprintf(buf, sizeof(buf), "%d missing files; e.g.",
+             static_cast<int>(expected.size()));
+    return Status::Corruption(buf, TableFileName(dbname_, *(expected.begin())));
+  }
+
+  // Recover in the order in which the logs were generated
+  std::sort(logs.begin(), logs.end());
+  for (size_t i = 0; i < logs.size(); i++) {
+    s = RecoverLogFile(logs[i], (i == logs.size() - 1), save_manifest, edit,
+                       &max_sequence);
+    if (!s.ok()) {
+      return s;
+    }
+
+    // The previous incarnation may not have written any MANIFEST
+    // records after allocating this log number.  So we manually
+    // update the file number allocation counter in VersionSet.
+    versions_->MarkFileNumberUsed(logs[i]);
+  }
+
+  if (versions_->LastSequence() < max_sequence) {
+    versions_->SetLastSequence(max_sequence);
+  }
+
+  return Status::OK();
+}
+
+Status DBImpl::RecoverLogFile(uint64_t log_number, bool last_log,
+                              bool* save_manifest, VersionEdit* edit,
+                              SequenceNumber* max_sequence) {
+  struct LogReporter : public log::Reader::Reporter {
+    Env* env;
+    Logger* info_log;
+    const char* fname;
+    Status* status;  // NULL if options_.paranoid_checks==false
+    virtual void Corruption(size_t bytes, const Status& s) {
+      Log(info_log, "%s%s: dropping %d bytes; %s",
+          (this->status == NULL ? "(ignoring error) " : ""),
+          fname, static_cast<int>(bytes), s.ToString().c_str());
+      if (this->status != NULL && this->status->ok()) *this->status = s;
+    }
+  };
+
+  mutex_.AssertHeld();
+
+  // Open the log file
+  std::string fname = LogFileName(dbname_, log_number);
+  SequentialFile* file;
+  Status status = env_->NewSequentialFile(fname, &file);
+  if (!status.ok()) {
+    MaybeIgnoreError(&status);
+    return status;
+  }
+
+  // Create the log reader.
+  LogReporter reporter;
+  reporter.env = env_;
+  reporter.info_log = options_.info_log;
+  reporter.fname = fname.c_str();
+  reporter.status = (options_.paranoid_checks ? &status : NULL);
+  // We intentionally make log::Reader do checksumming even if
+  // paranoid_checks==false so that corruptions cause entire commits
+  // to be skipped instead of propagating bad information (like overly
+  // large sequence numbers).
+  log::Reader reader(file, &reporter, true/*checksum*/,
+                     0/*initial_offset*/);
+  Log(options_.info_log, "Recovering log #%llu",
+      (unsigned long long) log_number);
+
+  // Read all the records and add to a memtable
+  std::string scratch;
+  Slice record;
+  WriteBatch batch;
+  int compactions = 0;
+  MemTable* mem = NULL;
+  while (reader.ReadRecord(&record, &scratch) &&
+         status.ok()) {
+    if (record.size() < 12) {
+      reporter.Corruption(
+          record.size(), Status::Corruption("log record too small", fname));
+      continue;
+    }
+    WriteBatchInternal::SetContents(&batch, record);
+
+    if (mem == NULL) {
+      mem = new MemTable(internal_comparator_);
+      mem->Ref();
+    }
+    status = WriteBatchInternal::InsertInto(&batch, mem);
+    MaybeIgnoreError(&status);
+    if (!status.ok()) {
+      break;
+    }
+    const SequenceNumber last_seq =
+        WriteBatchInternal::Sequence(&batch) +
+        WriteBatchInternal::Count(&batch) - 1;
+    if (last_seq > *max_sequence) {
+      *max_sequence = last_seq;
+    }
+
+    if (mem->ApproximateMemoryUsage() > options_.write_buffer_size) {
+      compactions++;
+      *save_manifest = true;
+      status = WriteLevel0Table(mem, edit, NULL);
+      mem->Unref();
+      mem = NULL;
+      if (!status.ok()) {
+        // Reflect errors immediately so that conditions like full
+        // file-systems cause the DB::Open() to fail.
+        break;
+      }
+    }
+  }
+
+  delete file;
+
+  // See if we should keep reusing the last log file.
+  if (status.ok() && options_.reuse_logs && last_log && compactions == 0) {
+    assert(logfile_ == NULL);
+    assert(log_ == NULL);
+    assert(mem_ == NULL);
+    uint64_t lfile_size;
+    if (env_->GetFileSize(fname, &lfile_size).ok() &&
+        env_->NewAppendableFile(fname, &logfile_).ok()) {
+      Log(options_.info_log, "Reusing old log %s \n", fname.c_str());
+      log_ = new log::Writer(logfile_, lfile_size);
+      logfile_number_ = log_number;
+      if (mem != NULL) {
+        mem_ = mem;
+        mem = NULL;
+      } else {
+        // mem can be NULL if lognum exists but was empty.
+        mem_ = new MemTable(internal_comparator_);
+        mem_->Ref();
+      }
+    }
+  }
+
+  if (mem != NULL) {
+    // mem did not get reused; compact it.
+    if (status.ok()) {
+      *save_manifest = true;
+      status = WriteLevel0Table(mem, edit, NULL);
+    }
+    mem->Unref();
+  }
+
+  return status;
+}
+
+Status DBImpl::WriteLevel0Table(MemTable* mem, VersionEdit* edit,
+                                Version* base) {
+  mutex_.AssertHeld();
+  const uint64_t start_micros = env_->NowMicros();
+  FileMetaData meta;
+  meta.number = versions_->NewFileNumber();
+  pending_outputs_.insert(meta.number);
+  Iterator* iter = mem->NewIterator();
+  Log(options_.info_log, "Level-0 table #%llu: started",
+      (unsigned long long) meta.number);
+
+  Status s;
+  {
+    mutex_.Unlock();
+    s = BuildTable(dbname_, env_, options_, table_cache_, iter, &meta);
+    mutex_.Lock();
+  }
+
+  Log(options_.info_log, "Level-0 table #%llu: %lld bytes %s",
+      (unsigned long long) meta.number,
+      (unsigned long long) meta.file_size,
+      s.ToString().c_str());
+  delete iter;
+  pending_outputs_.erase(meta.number);
+
+
+  // Note that if file_size is zero, the file has been deleted and
+  // should not be added to the manifest.
+  int level = 0;
+  if (s.ok() && meta.file_size > 0) {
+    const Slice min_user_key = meta.smallest.user_key();
+    const Slice max_user_key = meta.largest.user_key();
+    if (base != NULL) {
+      level = base->PickLevelForMemTableOutput(min_user_key, max_user_key);
+    }
+    edit->AddFile(level, meta.number, meta.file_size,
+                  meta.smallest, meta.largest);
+  }
+
+  CompactionStats stats;
+  stats.micros = env_->NowMicros() - start_micros;
+  stats.bytes_written = meta.file_size;
+  stats_[level].Add(stats);
+  return s;
+}
+
+void DBImpl::CompactMemTable() {
+  mutex_.AssertHeld();
+  assert(imm_ != NULL);
+
+  // Save the contents of the memtable as a new Table
+  VersionEdit edit;
+  Version* base = versions_->current();
+  base->Ref();
+  Status s = WriteLevel0Table(imm_, &edit, base);
+  base->Unref();
+
+  if (s.ok() && shutting_down_.Acquire_Load()) {
+    s = Status::IOError("Deleting DB during memtable compaction");
+  }
+
+  // Replace immutable memtable with the generated Table
+  if (s.ok()) {
+    edit.SetPrevLogNumber(0);
+    edit.SetLogNumber(logfile_number_);  // Earlier logs no longer needed
+    s = versions_->LogAndApply(&edit, &mutex_);
+  }
+
+  if (s.ok()) {
+    // Commit to the new state
+    imm_->Unref();
+    imm_ = NULL;
+    has_imm_.Release_Store(NULL);
+    DeleteObsoleteFiles();
+  } else {
+    RecordBackgroundError(s);
+  }
+}
+
+void DBImpl::CompactRange(const Slice* begin, const Slice* end) {
+  int max_level_with_files = 1;
+  {
+    MutexLock l(&mutex_);
+    Version* base = versions_->current();
+    for (int level = 1; level < config::kNumLevels; level++) {
+      if (base->OverlapInLevel(level, begin, end)) {
+        max_level_with_files = level;
+      }
+    }
+  }
+  TEST_CompactMemTable(); // TODO(sanjay): Skip if memtable does not overlap
+  for (int level = 0; level < max_level_with_files; level++) {
+    TEST_CompactRange(level, begin, end);
+  }
+}
+
+void DBImpl::TEST_CompactRange(int level, const Slice* begin,const Slice* end) {
+  assert(level >= 0);
+  assert(level + 1 < config::kNumLevels);
+
+  InternalKey begin_storage, end_storage;
+
+  ManualCompaction manual;
+  manual.level = level;
+  manual.done = false;
+  if (begin == NULL) {
+    manual.begin = NULL;
+  } else {
+    begin_storage = InternalKey(*begin, kMaxSequenceNumber, kValueTypeForSeek);
+    manual.begin = &begin_storage;
+  }
+  if (end == NULL) {
+    manual.end = NULL;
+  } else {
+    end_storage = InternalKey(*end, 0, static_cast<ValueType>(0));
+    manual.end = &end_storage;
+  }
+
+  MutexLock l(&mutex_);
+  while (!manual.done && !shutting_down_.Acquire_Load() && bg_error_.ok()) {
+    if (manual_compaction_ == NULL) {  // Idle
+      manual_compaction_ = &manual;
+      MaybeScheduleCompaction();
+    } else {  // Running either my compaction or another compaction.
+      bg_cv_.Wait();
+    }
+  }
+  if (manual_compaction_ == &manual) {
+    // Cancel my manual compaction since we aborted early for some reason.
+    manual_compaction_ = NULL;
+  }
+}
+
+Status DBImpl::TEST_CompactMemTable() {
+  // NULL batch means just wait for earlier writes to be done
+  Status s = Write(WriteOptions(), NULL);
+  if (s.ok()) {
+    // Wait until the compaction completes
+    MutexLock l(&mutex_);
+    while (imm_ != NULL && bg_error_.ok()) {
+      bg_cv_.Wait();
+    }
+    if (imm_ != NULL) {
+      s = bg_error_;
+    }
+  }
+  return s;
+}
+
+void DBImpl::RecordBackgroundError(const Status& s) {
+  mutex_.AssertHeld();
+  if (bg_error_.ok()) {
+    bg_error_ = s;
+    bg_cv_.SignalAll();
+  }
+}
+
+void DBImpl::MaybeScheduleCompaction() {
+  mutex_.AssertHeld();
+  if (bg_compaction_scheduled_) {
+    // Already scheduled
+  } else if (shutting_down_.Acquire_Load()) {
+    // DB is being deleted; no more background compactions
+  } else if (!bg_error_.ok()) {
+    // Already got an error; no more changes
+  } else if (imm_ == NULL &&
+             manual_compaction_ == NULL &&
+             !versions_->NeedsCompaction()) {
+    // No work to be done
+  } else {
+    bg_compaction_scheduled_ = true;
+    env_->Schedule(&DBImpl::BGWork, this);
+  }
+}
+
+void DBImpl::BGWork(void* db) {
+  reinterpret_cast<DBImpl*>(db)->BackgroundCall();
+}
+
+void DBImpl::BackgroundCall() {
+  MutexLock l(&mutex_);
+  assert(bg_compaction_scheduled_);
+  if (shutting_down_.Acquire_Load()) {
+    // No more background work when shutting down.
+  } else if (!bg_error_.ok()) {
+    // No more background work after a background error.
+  } else {
+    BackgroundCompaction();
+  }
+
+  bg_compaction_scheduled_ = false;
+
+  // Previous compaction may have produced too many files in a level,
+  // so reschedule another compaction if needed.
+  MaybeScheduleCompaction();
+  bg_cv_.SignalAll();
+}
+
+void DBImpl::BackgroundCompaction() {
+  mutex_.AssertHeld();
+
+  if (imm_ != NULL) {
+    CompactMemTable();
+    return;
+  }
+
+  Compaction* c;
+  bool is_manual = (manual_compaction_ != NULL);
+  InternalKey manual_end;
+  if (is_manual) {
+    ManualCompaction* m = manual_compaction_;
+    c = versions_->CompactRange(m->level, m->begin, m->end);
+    m->done = (c == NULL);
+    if (c != NULL) {
+      manual_end = c->input(0, c->num_input_files(0) - 1)->largest;
+    }
+    Log(options_.info_log,
+        "Manual compaction at level-%d from %s .. %s; will stop at %s\n",
+        m->level,
+        (m->begin ? m->begin->DebugString().c_str() : "(begin)"),
+        (m->end ? m->end->DebugString().c_str() : "(end)"),
+        (m->done ? "(end)" : manual_end.DebugString().c_str()));
+  } else {
+    c = versions_->PickCompaction();
+  }
+
+  Status status;
+  if (c == NULL) {
+    // Nothing to do
+  } else if (!is_manual && c->IsTrivialMove()) {
+    // Move file to next level
+    assert(c->num_input_files(0) == 1);
+    FileMetaData* f = c->input(0, 0);
+    c->edit()->DeleteFile(c->level(), f->number);
+    c->edit()->AddFile(c->level() + 1, f->number, f->file_size,
+                       f->smallest, f->largest);
+    status = versions_->LogAndApply(c->edit(), &mutex_);
+    if (!status.ok()) {
+      RecordBackgroundError(status);
+    }
+    VersionSet::LevelSummaryStorage tmp;
+    Log(options_.info_log, "Moved #%lld to level-%d %lld bytes %s: %s\n",
+        static_cast<unsigned long long>(f->number),
+        c->level() + 1,
+        static_cast<unsigned long long>(f->file_size),
+        status.ToString().c_str(),
+        versions_->LevelSummary(&tmp));
+  } else {
+    CompactionState* compact = new CompactionState(c);
+    status = DoCompactionWork(compact);
+    if (!status.ok()) {
+      RecordBackgroundError(status);
+    }
+    CleanupCompaction(compact);
+    c->ReleaseInputs();
+    DeleteObsoleteFiles();
+  }
+  delete c;
+
+  if (status.ok()) {
+    // Done
+  } else if (shutting_down_.Acquire_Load()) {
+    // Ignore compaction errors found during shutting down
+  } else {
+    Log(options_.info_log,
+        "Compaction error: %s", status.ToString().c_str());
+  }
+
+  if (is_manual) {
+    ManualCompaction* m = manual_compaction_;
+    if (!status.ok()) {
+      m->done = true;
+    }
+    if (!m->done) {
+      // We only compacted part of the requested range.  Update *m
+      // to the range that is left to be compacted.
+      m->tmp_storage = manual_end;
+      m->begin = &m->tmp_storage;
+    }
+    manual_compaction_ = NULL;
+  }
+}
+
+void DBImpl::CleanupCompaction(CompactionState* compact) {
+  mutex_.AssertHeld();
+  if (compact->builder != NULL) {
+    // May happen if we get a shutdown call in the middle of compaction
+    compact->builder->Abandon();
+    delete compact->builder;
+  } else {
+    assert(compact->outfile == NULL);
+  }
+  delete compact->outfile;
+  for (size_t i = 0; i < compact->outputs.size(); i++) {
+    const CompactionState::Output& out = compact->outputs[i];
+    pending_outputs_.erase(out.number);
+  }
+  delete compact;
+}
+
+Status DBImpl::OpenCompactionOutputFile(CompactionState* compact) {
+  assert(compact != NULL);
+  assert(compact->builder == NULL);
+  uint64_t file_number;
+  {
+    mutex_.Lock();
+    file_number = versions_->NewFileNumber();
+    pending_outputs_.insert(file_number);
+    CompactionState::Output out;
+    out.number = file_number;
+    out.smallest.Clear();
+    out.largest.Clear();
+    compact->outputs.push_back(out);
+    mutex_.Unlock();
+  }
+
+  // Make the output file
+  std::string fname = TableFileName(dbname_, file_number);
+  Status s = env_->NewWritableFile(fname, &compact->outfile);
+  if (s.ok()) {
+    compact->builder = new TableBuilder(options_, compact->outfile);
+  }
+  return s;
+}
+
+Status DBImpl::FinishCompactionOutputFile(CompactionState* compact,
+                                          Iterator* input) {
+  assert(compact != NULL);
+  assert(compact->outfile != NULL);
+  assert(compact->builder != NULL);
+
+  const uint64_t output_number = compact->current_output()->number;
+  assert(output_number != 0);
+
+  // Check for iterator errors
+  Status s = input->status();
+  const uint64_t current_entries = compact->builder->NumEntries();
+  if (s.ok()) {
+    s = compact->builder->Finish();
+  } else {
+    compact->builder->Abandon();
+  }
+  const uint64_t current_bytes = compact->builder->FileSize();
+  compact->current_output()->file_size = current_bytes;
+  compact->total_bytes += current_bytes;
+  delete compact->builder;
+  compact->builder = NULL;
+
+  // Finish and check for file errors
+  if (s.ok()) {
+    s = compact->outfile->Sync();
+  }
+  if (s.ok()) {
+    s = compact->outfile->Close();
+  }
+  delete compact->outfile;
+  compact->outfile = NULL;
+
+  if (s.ok() && current_entries > 0) {
+    // Verify that the table is usable
+    Iterator* iter = table_cache_->NewIterator(ReadOptions(),
+                                               output_number,
+                                               current_bytes);
+    s = iter->status();
+    delete iter;
+    if (s.ok()) {
+      Log(options_.info_log,
+          "Generated table #%llu@%d: %lld keys, %lld bytes",
+          (unsigned long long) output_number,
+          compact->compaction->level(),
+          (unsigned long long) current_entries,
+          (unsigned long long) current_bytes);
+    }
+  }
+  return s;
+}
+
+
+Status DBImpl::InstallCompactionResults(CompactionState* compact) {
+  mutex_.AssertHeld();
+  Log(options_.info_log,  "Compacted %d@%d + %d@%d files => %lld bytes",
+      compact->compaction->num_input_files(0),
+      compact->compaction->level(),
+      compact->compaction->num_input_files(1),
+      compact->compaction->level() + 1,
+      static_cast<long long>(compact->total_bytes));
+
+  // Add compaction outputs
+  compact->compaction->AddInputDeletions(compact->compaction->edit());
+  const int level = compact->compaction->level();
+  for (size_t i = 0; i < compact->outputs.size(); i++) {
+    const CompactionState::Output& out = compact->outputs[i];
+    compact->compaction->edit()->AddFile(
+        level + 1,
+        out.number, out.file_size, out.smallest, out.largest);
+  }
+  return versions_->LogAndApply(compact->compaction->edit(), &mutex_);
+}
+
+Status DBImpl::DoCompactionWork(CompactionState* compact) {
+  const uint64_t start_micros = env_->NowMicros();
+  int64_t imm_micros = 0;  // Micros spent doing imm_ compactions
+
+  Log(options_.info_log,  "Compacting %d@%d + %d@%d files",
+      compact->compaction->num_input_files(0),
+      compact->compaction->level(),
+      compact->compaction->num_input_files(1),
+      compact->compaction->level() + 1);
+
+  assert(versions_->NumLevelFiles(compact->compaction->level()) > 0);
+  assert(compact->builder == NULL);
+  assert(compact->outfile == NULL);
+  if (snapshots_.empty()) {
+    compact->smallest_snapshot = versions_->LastSequence();
+  } else {
+    compact->smallest_snapshot = snapshots_.oldest()->number_;
+  }
+
+  // Release mutex while we're actually doing the compaction work
+  mutex_.Unlock();
+
+  Iterator* input = versions_->MakeInputIterator(compact->compaction);
+  input->SeekToFirst();
+  Status status;
+  ParsedInternalKey ikey;
+  std::string current_user_key;
+  bool has_current_user_key = false;
+  SequenceNumber last_sequence_for_key = kMaxSequenceNumber;
+  for (; input->Valid() && !shutting_down_.Acquire_Load(); ) {
+    // Prioritize immutable compaction work
+    if (has_imm_.NoBarrier_Load() != NULL) {
+      const uint64_t imm_start = env_->NowMicros();
+      mutex_.Lock();
+      if (imm_ != NULL) {
+        CompactMemTable();
+        bg_cv_.SignalAll();  // Wakeup MakeRoomForWrite() if necessary
+      }
+      mutex_.Unlock();
+      imm_micros += (env_->NowMicros() - imm_start);
+    }
+
+    Slice key = input->key();
+    if (compact->compaction->ShouldStopBefore(key) &&
+        compact->builder != NULL) {
+      status = FinishCompactionOutputFile(compact, input);
+      if (!status.ok()) {
+        break;
+      }
+    }
+
+    // Handle key/value, add to state, etc.
+    bool drop = false;
+    if (!ParseInternalKey(key, &ikey)) {
+      // Do not hide error keys
+      current_user_key.clear();
+      has_current_user_key = false;
+      last_sequence_for_key = kMaxSequenceNumber;
+    } else {
+      if (!has_current_user_key ||
+          user_comparator()->Compare(ikey.user_key,
+                                     Slice(current_user_key)) != 0) {
+        // First occurrence of this user key
+        current_user_key.assign(ikey.user_key.data(), ikey.user_key.size());
+        has_current_user_key = true;
+        last_sequence_for_key = kMaxSequenceNumber;
+      }
+
+      if (last_sequence_for_key <= compact->smallest_snapshot) {
+        // Hidden by an newer entry for same user key
+        drop = true;    // (A)
+      } else if (ikey.type == kTypeDeletion &&
+                 ikey.sequence <= compact->smallest_snapshot &&
+                 compact->compaction->IsBaseLevelForKey(ikey.user_key)) {
+        // For this user key:
+        // (1) there is no data in higher levels
+        // (2) data in lower levels will have larger sequence numbers
+        // (3) data in layers that are being compacted here and have
+        //     smaller sequence numbers will be dropped in the next
+        //     few iterations of this loop (by rule (A) above).
+        // Therefore this deletion marker is obsolete and can be dropped.
+        drop = true;
+      }
+
+      last_sequence_for_key = ikey.sequence;
+    }
+#if 0
+    Log(options_.info_log,
+        "  Compact: %s, seq %d, type: %d %d, drop: %d, is_base: %d, "
+        "%d smallest_snapshot: %d",
+        ikey.user_key.ToString().c_str(),
+        (int)ikey.sequence, ikey.type, kTypeValue, drop,
+        compact->compaction->IsBaseLevelForKey(ikey.user_key),
+        (int)last_sequence_for_key, (int)compact->smallest_snapshot);
+#endif
+
+    if (!drop) {
+      // Open output file if necessary
+      if (compact->builder == NULL) {
+        status = OpenCompactionOutputFile(compact);
+        if (!status.ok()) {
+          break;
+        }
+      }
+      if (compact->builder->NumEntries() == 0) {
+        compact->current_output()->smallest.DecodeFrom(key);
+      }
+      compact->current_output()->largest.DecodeFrom(key);
+      compact->builder->Add(key, input->value());
+
+      // Close output file if it is big enough
+      if (compact->builder->FileSize() >=
+          compact->compaction->MaxOutputFileSize()) {
+        status = FinishCompactionOutputFile(compact, input);
+        if (!status.ok()) {
+          break;
+        }
+      }
+    }
+
+    input->Next();
+  }
+
+  if (status.ok() && shutting_down_.Acquire_Load()) {
+    status = Status::IOError("Deleting DB during compaction");
+  }
+  if (status.ok() && compact->builder != NULL) {
+    status = FinishCompactionOutputFile(compact, input);
+  }
+  if (status.ok()) {
+    status = input->status();
+  }
+  delete input;
+  input = NULL;
+
+  CompactionStats stats;
+  stats.micros = env_->NowMicros() - start_micros - imm_micros;
+  for (int which = 0; which < 2; which++) {
+    for (int i = 0; i < compact->compaction->num_input_files(which); i++) {
+      stats.bytes_read += compact->compaction->input(which, i)->file_size;
+    }
+  }
+  for (size_t i = 0; i < compact->outputs.size(); i++) {
+    stats.bytes_written += compact->outputs[i].file_size;
+  }
+
+  mutex_.Lock();
+  stats_[compact->compaction->level() + 1].Add(stats);
+
+  if (status.ok()) {
+    status = InstallCompactionResults(compact);
+  }
+  if (!status.ok()) {
+    RecordBackgroundError(status);
+  }
+  VersionSet::LevelSummaryStorage tmp;
+  Log(options_.info_log,
+      "compacted to: %s", versions_->LevelSummary(&tmp));
+  return status;
+}
+
+namespace {
+struct IterState {
+  port::Mutex* mu;
+  Version* version;
+  MemTable* mem;
+  MemTable* imm;
+};
+
+static void CleanupIteratorState(void* arg1, void* arg2) {
+  IterState* state = reinterpret_cast<IterState*>(arg1);
+  state->mu->Lock();
+  state->mem->Unref();
+  if (state->imm != NULL) state->imm->Unref();
+  state->version->Unref();
+  state->mu->Unlock();
+  delete state;
+}
+}  // namespace
+
+Iterator* DBImpl::NewInternalIterator(const ReadOptions& options,
+                                      SequenceNumber* latest_snapshot,
+                                      uint32_t* seed) {
+  IterState* cleanup = new IterState;
+  mutex_.Lock();
+  *latest_snapshot = versions_->LastSequence();
+
+  // Collect together all needed child iterators
+  std::vector<Iterator*> list;
+  list.push_back(mem_->NewIterator());
+  mem_->Ref();
+  if (imm_ != NULL) {
+    list.push_back(imm_->NewIterator());
+    imm_->Ref();
+  }
+  versions_->current()->AddIterators(options, &list);
+  Iterator* internal_iter =
+      NewMergingIterator(&internal_comparator_, &list[0], list.size());
+  versions_->current()->Ref();
+
+  cleanup->mu = &mutex_;
+  cleanup->mem = mem_;
+  cleanup->imm = imm_;
+  cleanup->version = versions_->current();
+  internal_iter->RegisterCleanup(CleanupIteratorState, cleanup, NULL);
+
+  *seed = ++seed_;
+  mutex_.Unlock();
+  return internal_iter;
+}
+
+Iterator* DBImpl::TEST_NewInternalIterator() {
+  SequenceNumber ignored;
+  uint32_t ignored_seed;
+  return NewInternalIterator(ReadOptions(), &ignored, &ignored_seed);
+}
+
+int64_t DBImpl::TEST_MaxNextLevelOverlappingBytes() {
+  MutexLock l(&mutex_);
+  return versions_->MaxNextLevelOverlappingBytes();
+}
+
+Status DBImpl::Get(const ReadOptions& options,
+                   const Slice& key,
+                   std::string* value) {
+  Status s;
+  MutexLock l(&mutex_);
+  SequenceNumber snapshot;
+  if (options.snapshot != NULL) {
+    snapshot = reinterpret_cast<const SnapshotImpl*>(options.snapshot)->number_;
+  } else {
+    snapshot = versions_->LastSequence();
+  }
+
+  MemTable* mem = mem_;
+  MemTable* imm = imm_;
+  Version* current = versions_->current();
+  mem->Ref();
+  if (imm != NULL) imm->Ref();
+  current->Ref();
+
+  bool have_stat_update = false;
+  Version::GetStats stats;
+
+  // Unlock while reading from files and memtables
+  {
+    mutex_.Unlock();
+    // First look in the memtable, then in the immutable memtable (if any).
+    LookupKey lkey(key, snapshot);
+    if (mem->Get(lkey, value, &s)) {
+      // Done
+    } else if (imm != NULL && imm->Get(lkey, value, &s)) {
+      // Done
+    } else {
+      s = current->Get(options, lkey, value, &stats);
+      have_stat_update = true;
+    }
+    mutex_.Lock();
+  }
+
+  if (have_stat_update && current->UpdateStats(stats)) {
+    MaybeScheduleCompaction();
+  }
+  mem->Unref();
+  if (imm != NULL) imm->Unref();
+  current->Unref();
+  return s;
+}
+
+Iterator* DBImpl::NewIterator(const ReadOptions& options) {
+  SequenceNumber latest_snapshot;
+  uint32_t seed;
+  Iterator* iter = NewInternalIterator(options, &latest_snapshot, &seed);
+  return NewDBIterator(
+      this, user_comparator(), iter,
+      (options.snapshot != NULL
+       ? reinterpret_cast<const SnapshotImpl*>(options.snapshot)->number_
+       : latest_snapshot),
+      seed);
+}
+
+void DBImpl::RecordReadSample(Slice key) {
+  MutexLock l(&mutex_);
+  if (versions_->current()->RecordReadSample(key)) {
+    MaybeScheduleCompaction();
+  }
+}
+
+const Snapshot* DBImpl::GetSnapshot() {
+  MutexLock l(&mutex_);
+  return snapshots_.New(versions_->LastSequence());
+}
+
+void DBImpl::ReleaseSnapshot(const Snapshot* s) {
+  MutexLock l(&mutex_);
+  snapshots_.Delete(reinterpret_cast<const SnapshotImpl*>(s));
+}
+
+// Convenience methods
+Status DBImpl::Put(const WriteOptions& o, const Slice& key, const Slice& val) {
+  return DB::Put(o, key, val);
+}
+
+Status DBImpl::Delete(const WriteOptions& options, const Slice& key) {
+  return DB::Delete(options, key);
+}
+
+Status DBImpl::Write(const WriteOptions& options, WriteBatch* my_batch) {
+  Writer w(&mutex_);
+  w.batch = my_batch;
+  w.sync = options.sync;
+  w.done = false;
+
+  MutexLock l(&mutex_);
+  writers_.push_back(&w);
+  while (!w.done && &w != writers_.front()) {
+    w.cv.Wait();
+  }
+  if (w.done) {
+    return w.status;
+  }
+
+  // May temporarily unlock and wait.
+  Status status = MakeRoomForWrite(my_batch == NULL);
+  uint64_t last_sequence = versions_->LastSequence();
+  Writer* last_writer = &w;
+  if (status.ok() && my_batch != NULL) {  // NULL batch is for compactions
+    WriteBatch* updates = BuildBatchGroup(&last_writer);
+    WriteBatchInternal::SetSequence(updates, last_sequence + 1);
+    last_sequence += WriteBatchInternal::Count(updates);
+
+    // Add to log and apply to memtable.  We can release the lock
+    // during this phase since &w is currently responsible for logging
+    // and protects against concurrent loggers and concurrent writes
+    // into mem_.
+    {
+      mutex_.Unlock();
+      status = log_->AddRecord(WriteBatchInternal::Contents(updates));
+      bool sync_error = false;
+      if (status.ok() && options.sync) {
+        status = logfile_->Sync();
+        if (!status.ok()) {
+          sync_error = true;
+        }
+      }
+      if (status.ok()) {
+        status = WriteBatchInternal::InsertInto(updates, mem_);
+      }
+      mutex_.Lock();
+      if (sync_error) {
+        // The state of the log file is indeterminate: the log record we
+        // just added may or may not show up when the DB is re-opened.
+        // So we force the DB into a mode where all future writes fail.
+        RecordBackgroundError(status);
+      }
+    }
+    if (updates == tmp_batch_) tmp_batch_->Clear();
+
+    versions_->SetLastSequence(last_sequence);
+  }
+
+  while (true) {
+    Writer* ready = writers_.front();
+    writers_.pop_front();
+    if (ready != &w) {
+      ready->status = status;
+      ready->done = true;
+      ready->cv.Signal();
+    }
+    if (ready == last_writer) break;
+  }
+
+  // Notify new head of write queue
+  if (!writers_.empty()) {
+    writers_.front()->cv.Signal();
+  }
+
+  return status;
+}
+
+// REQUIRES: Writer list must be non-empty
+// REQUIRES: First writer must have a non-NULL batch
+WriteBatch* DBImpl::BuildBatchGroup(Writer** last_writer) {
+  assert(!writers_.empty());
+  Writer* first = writers_.front();
+  WriteBatch* result = first->batch;
+  assert(result != NULL);
+
+  size_t size = WriteBatchInternal::ByteSize(first->batch);
+
+  // Allow the group to grow up to a maximum size, but if the
+  // original write is small, limit the growth so we do not slow
+  // down the small write too much.
+  size_t max_size = 1 << 20;
+  if (size <= (128<<10)) {
+    max_size = size + (128<<10);
+  }
+
+  *last_writer = first;
+  std::deque<Writer*>::iterator iter = writers_.begin();
+  ++iter;  // Advance past "first"
+  for (; iter != writers_.end(); ++iter) {
+    Writer* w = *iter;
+    if (w->sync && !first->sync) {
+      // Do not include a sync write into a batch handled by a non-sync write.
+      break;
+    }
+
+    if (w->batch != NULL) {
+      size += WriteBatchInternal::ByteSize(w->batch);
+      if (size > max_size) {
+        // Do not make batch too big
+        break;
+      }
+
+      // Append to *result
+      if (result == first->batch) {
+        // Switch to temporary batch instead of disturbing caller's batch
+        result = tmp_batch_;
+        assert(WriteBatchInternal::Count(result) == 0);
+        WriteBatchInternal::Append(result, first->batch);
+      }
+      WriteBatchInternal::Append(result, w->batch);
+    }
+    *last_writer = w;
+  }
+  return result;
+}
+
+// REQUIRES: mutex_ is held
+// REQUIRES: this thread is currently at the front of the writer queue
+Status DBImpl::MakeRoomForWrite(bool force) {
+  mutex_.AssertHeld();
+  assert(!writers_.empty());
+  bool allow_delay = !force;
+  Status s;
+  while (true) {
+    if (!bg_error_.ok()) {
+      // Yield previous error
+      s = bg_error_;
+      break;
+    } else if (
+        allow_delay &&
+        versions_->NumLevelFiles(0) >= config::kL0_SlowdownWritesTrigger) {
+      // We are getting close to hitting a hard limit on the number of
+      // L0 files.  Rather than delaying a single write by several
+      // seconds when we hit the hard limit, start delaying each
+      // individual write by 1ms to reduce latency variance.  Also,
+      // this delay hands over some CPU to the compaction thread in
+      // case it is sharing the same core as the writer.
+      mutex_.Unlock();
+      env_->SleepForMicroseconds(1000);
+      allow_delay = false;  // Do not delay a single write more than once
+      mutex_.Lock();
+    } else if (!force &&
+               (mem_->ApproximateMemoryUsage() <= options_.write_buffer_size)) {
+      // There is room in current memtable
+      break;
+    } else if (imm_ != NULL) {
+      // We have filled up the current memtable, but the previous
+      // one is still being compacted, so we wait.
+      Log(options_.info_log, "Current memtable full; waiting...\n");
+      bg_cv_.Wait();
+    } else if (versions_->NumLevelFiles(0) >= config::kL0_StopWritesTrigger) {
+      // There are too many level-0 files.
+      Log(options_.info_log, "Too many L0 files; waiting...\n");
+      bg_cv_.Wait();
+    } else {
+      // Attempt to switch to a new memtable and trigger compaction of old
+      assert(versions_->PrevLogNumber() == 0);
+      uint64_t new_log_number = versions_->NewFileNumber();
+      WritableFile* lfile = NULL;
+      s = env_->NewWritableFile(LogFileName(dbname_, new_log_number), &lfile);
+      if (!s.ok()) {
+        // Avoid chewing through file number space in a tight loop.
+        versions_->ReuseFileNumber(new_log_number);
+        break;
+      }
+      delete log_;
+      delete logfile_;
+      logfile_ = lfile;
+      logfile_number_ = new_log_number;
+      log_ = new log::Writer(lfile);
+      imm_ = mem_;
+      has_imm_.Release_Store(imm_);
+      mem_ = new MemTable(internal_comparator_);
+      mem_->Ref();
+      force = false;   // Do not force another compaction if have room
+      MaybeScheduleCompaction();
+    }
+  }
+  return s;
+}
+
+bool DBImpl::GetProperty(const Slice& property, std::string* value) {
+  value->clear();
+
+  MutexLock l(&mutex_);
+  Slice in = property;
+  Slice prefix("leveldb.");
+  if (!in.starts_with(prefix)) return false;
+  in.remove_prefix(prefix.size());
+
+  if (in.starts_with("num-files-at-level")) {
+    in.remove_prefix(strlen("num-files-at-level"));
+    uint64_t level;
+    bool ok = ConsumeDecimalNumber(&in, &level) && in.empty();
+    if (!ok || level >= config::kNumLevels) {
+      return false;
+    } else {
+      char buf[100];
+      snprintf(buf, sizeof(buf), "%d",
+               versions_->NumLevelFiles(static_cast<int>(level)));
+      *value = buf;
+      return true;
+    }
+  } else if (in == "stats") {
+    char buf[200];
+    snprintf(buf, sizeof(buf),
+             "                               Compactions\n"
+             "Level  Files Size(MB) Time(sec) Read(MB) Write(MB)\n"
+             "--------------------------------------------------\n"
+             );
+    value->append(buf);
+    for (int level = 0; level < config::kNumLevels; level++) {
+      int files = versions_->NumLevelFiles(level);
+      if (stats_[level].micros > 0 || files > 0) {
+        snprintf(
+            buf, sizeof(buf),
+            "%3d %8d %8.0f %9.0f %8.0f %9.0f\n",
+            level,
+            files,
+            versions_->NumLevelBytes(level) / 1048576.0,
+            stats_[level].micros / 1e6,
+            stats_[level].bytes_read / 1048576.0,
+            stats_[level].bytes_written / 1048576.0);
+        value->append(buf);
+      }
+    }
+    return true;
+  } else if (in == "sstables") {
+    *value = versions_->current()->DebugString();
+    return true;
+  } else if (in == "approximate-memory-usage") {
+    size_t total_usage = options_.block_cache->TotalCharge();
+    if (mem_) {
+      total_usage += mem_->ApproximateMemoryUsage();
+    }
+    if (imm_) {
+      total_usage += imm_->ApproximateMemoryUsage();
+    }
+    char buf[50];
+    snprintf(buf, sizeof(buf), "%llu",
+             static_cast<unsigned long long>(total_usage));
+    value->append(buf);
+    return true;
+  }
+
+  return false;
+}
+
+void DBImpl::GetApproximateSizes(
+    const Range* range, int n,
+    uint64_t* sizes) {
+  // TODO(opt): better implementation
+  Version* v;
+  {
+    MutexLock l(&mutex_);
+    versions_->current()->Ref();
+    v = versions_->current();
+  }
+
+  for (int i = 0; i < n; i++) {
+    // Convert user_key into a corresponding internal key.
+    InternalKey k1(range[i].start, kMaxSequenceNumber, kValueTypeForSeek);
+    InternalKey k2(range[i].limit, kMaxSequenceNumber, kValueTypeForSeek);
+    uint64_t start = versions_->ApproximateOffsetOf(v, k1);
+    uint64_t limit = versions_->ApproximateOffsetOf(v, k2);
+    sizes[i] = (limit >= start ? limit - start : 0);
+  }
+
+  {
+    MutexLock l(&mutex_);
+    v->Unref();
+  }
+}
+
+// Default implementations of convenience methods that subclasses of DB
+// can call if they wish
+Status DB::Put(const WriteOptions& opt, const Slice& key, const Slice& value) {
+  WriteBatch batch;
+  batch.Put(key, value);
+  return Write(opt, &batch);
+}
+
+Status DB::Delete(const WriteOptions& opt, const Slice& key) {
+  WriteBatch batch;
+  batch.Delete(key);
+  return Write(opt, &batch);
+}
+
+DB::~DB() { }
+
+Status DB::Open(const Options& options, const std::string& dbname,
+                DB** dbptr) {
+  *dbptr = NULL;
+
+  DBImpl* impl = new DBImpl(options, dbname);
+  impl->mutex_.Lock();
+  VersionEdit edit;
+  // Recover handles create_if_missing, error_if_exists
+  bool save_manifest = false;
+  Status s = impl->Recover(&edit, &save_manifest);
+  if (s.ok() && impl->mem_ == NULL) {
+    // Create new log and a corresponding memtable.
+    uint64_t new_log_number = impl->versions_->NewFileNumber();
+    WritableFile* lfile;
+    s = options.env->NewWritableFile(LogFileName(dbname, new_log_number),
+                                     &lfile);
+    if (s.ok()) {
+      edit.SetLogNumber(new_log_number);
+      impl->logfile_ = lfile;
+      impl->logfile_number_ = new_log_number;
+      impl->log_ = new log::Writer(lfile);
+      impl->mem_ = new MemTable(impl->internal_comparator_);
+      impl->mem_->Ref();
+    }
+  }
+  if (s.ok() && save_manifest) {
+    edit.SetPrevLogNumber(0);  // No older logs needed after recovery.
+    edit.SetLogNumber(impl->logfile_number_);
+    s = impl->versions_->LogAndApply(&edit, &impl->mutex_);
+  }
+  if (s.ok()) {
+    impl->DeleteObsoleteFiles();
+    impl->MaybeScheduleCompaction();
+  }
+  impl->mutex_.Unlock();
+  if (s.ok()) {
+    assert(impl->mem_ != NULL);
+    *dbptr = impl;
+  } else {
+    delete impl;
+  }
+  return s;
+}
+
+Snapshot::~Snapshot() {
+}
+
+Status DestroyDB(const std::string& dbname, const Options& options) {
+  Env* env = options.env;
+  std::vector<std::string> filenames;
+  // Ignore error in case directory does not exist
+  env->GetChildren(dbname, &filenames);
+  if (filenames.empty()) {
+    return Status::OK();
+  }
+
+  FileLock* lock;
+  const std::string lockname = LockFileName(dbname);
+  Status result = env->LockFile(lockname, &lock);
+  if (result.ok()) {
+    uint64_t number;
+    FileType type;
+    for (size_t i = 0; i < filenames.size(); i++) {
+      if (ParseFileName(filenames[i], &number, &type) &&
+          type != kDBLockFile) {  // Lock file will be deleted at end
+        Status del = env->DeleteFile(dbname + "/" + filenames[i]);
+        if (result.ok() && !del.ok()) {
+          result = del;
+        }
+      }
+    }
+    env->UnlockFile(lock);  // Ignore error since state is already gone
+    env->DeleteFile(lockname);
+    env->DeleteDir(dbname);  // Ignore error in case dir contains other files
+  }
+  return result;
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/db/db_impl.h b/depend/zcash/src/leveldb/db/db_impl.h
new file mode 100644
index 000000000..8ff323e72
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/db_impl.h
@@ -0,0 +1,211 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_DB_DB_IMPL_H_
+#define STORAGE_LEVELDB_DB_DB_IMPL_H_
+
+#include <deque>
+#include <set>
+#include "db/dbformat.h"
+#include "db/log_writer.h"
+#include "db/snapshot.h"
+#include "leveldb/db.h"
+#include "leveldb/env.h"
+#include "port/port.h"
+#include "port/thread_annotations.h"
+
+namespace leveldb {
+
+class MemTable;
+class TableCache;
+class Version;
+class VersionEdit;
+class VersionSet;
+
+class DBImpl : public DB {
+ public:
+  DBImpl(const Options& options, const std::string& dbname);
+  virtual ~DBImpl();
+
+  // Implementations of the DB interface
+  virtual Status Put(const WriteOptions&, const Slice& key, const Slice& value);
+  virtual Status Delete(const WriteOptions&, const Slice& key);
+  virtual Status Write(const WriteOptions& options, WriteBatch* updates);
+  virtual Status Get(const ReadOptions& options,
+                     const Slice& key,
+                     std::string* value);
+  virtual Iterator* NewIterator(const ReadOptions&);
+  virtual const Snapshot* GetSnapshot();
+  virtual void ReleaseSnapshot(const Snapshot* snapshot);
+  virtual bool GetProperty(const Slice& property, std::string* value);
+  virtual void GetApproximateSizes(const Range* range, int n, uint64_t* sizes);
+  virtual void CompactRange(const Slice* begin, const Slice* end);
+
+  // Extra methods (for testing) that are not in the public DB interface
+
+  // Compact any files in the named level that overlap [*begin,*end]
+  void TEST_CompactRange(int level, const Slice* begin, const Slice* end);
+
+  // Force current memtable contents to be compacted.
+  Status TEST_CompactMemTable();
+
+  // Return an internal iterator over the current state of the database.
+  // The keys of this iterator are internal keys (see format.h).
+  // The returned iterator should be deleted when no longer needed.
+  Iterator* TEST_NewInternalIterator();
+
+  // Return the maximum overlapping data (in bytes) at next level for any
+  // file at a level >= 1.
+  int64_t TEST_MaxNextLevelOverlappingBytes();
+
+  // Record a sample of bytes read at the specified internal key.
+  // Samples are taken approximately once every config::kReadBytesPeriod
+  // bytes.
+  void RecordReadSample(Slice key);
+
+ private:
+  friend class DB;
+  struct CompactionState;
+  struct Writer;
+
+  Iterator* NewInternalIterator(const ReadOptions&,
+                                SequenceNumber* latest_snapshot,
+                                uint32_t* seed);
+
+  Status NewDB();
+
+  // Recover the descriptor from persistent storage.  May do a significant
+  // amount of work to recover recently logged updates.  Any changes to
+  // be made to the descriptor are added to *edit.
+  Status Recover(VersionEdit* edit, bool* save_manifest)
+      EXCLUSIVE_LOCKS_REQUIRED(mutex_);
+
+  void MaybeIgnoreError(Status* s) const;
+
+  // Delete any unneeded files and stale in-memory entries.
+  void DeleteObsoleteFiles();
+
+  // Compact the in-memory write buffer to disk.  Switches to a new
+  // log-file/memtable and writes a new descriptor iff successful.
+  // Errors are recorded in bg_error_.
+  void CompactMemTable() EXCLUSIVE_LOCKS_REQUIRED(mutex_);
+
+  Status RecoverLogFile(uint64_t log_number, bool last_log, bool* save_manifest,
+                        VersionEdit* edit, SequenceNumber* max_sequence)
+      EXCLUSIVE_LOCKS_REQUIRED(mutex_);
+
+  Status WriteLevel0Table(MemTable* mem, VersionEdit* edit, Version* base)
+      EXCLUSIVE_LOCKS_REQUIRED(mutex_);
+
+  Status MakeRoomForWrite(bool force /* compact even if there is room? */)
+      EXCLUSIVE_LOCKS_REQUIRED(mutex_);
+  WriteBatch* BuildBatchGroup(Writer** last_writer);
+
+  void RecordBackgroundError(const Status& s);
+
+  void MaybeScheduleCompaction() EXCLUSIVE_LOCKS_REQUIRED(mutex_);
+  static void BGWork(void* db);
+  void BackgroundCall();
+  void  BackgroundCompaction() EXCLUSIVE_LOCKS_REQUIRED(mutex_);
+  void CleanupCompaction(CompactionState* compact)
+      EXCLUSIVE_LOCKS_REQUIRED(mutex_);
+  Status DoCompactionWork(CompactionState* compact)
+      EXCLUSIVE_LOCKS_REQUIRED(mutex_);
+
+  Status OpenCompactionOutputFile(CompactionState* compact);
+  Status FinishCompactionOutputFile(CompactionState* compact, Iterator* input);
+  Status InstallCompactionResults(CompactionState* compact)
+      EXCLUSIVE_LOCKS_REQUIRED(mutex_);
+
+  // Constant after construction
+  Env* const env_;
+  const InternalKeyComparator internal_comparator_;
+  const InternalFilterPolicy internal_filter_policy_;
+  const Options options_;  // options_.comparator == &internal_comparator_
+  bool owns_info_log_;
+  bool owns_cache_;
+  const std::string dbname_;
+
+  // table_cache_ provides its own synchronization
+  TableCache* table_cache_;
+
+  // Lock over the persistent DB state.  Non-NULL iff successfully acquired.
+  FileLock* db_lock_;
+
+  // State below is protected by mutex_
+  port::Mutex mutex_;
+  port::AtomicPointer shutting_down_;
+  port::CondVar bg_cv_;          // Signalled when background work finishes
+  MemTable* mem_;
+  MemTable* imm_;                // Memtable being compacted
+  port::AtomicPointer has_imm_;  // So bg thread can detect non-NULL imm_
+  WritableFile* logfile_;
+  uint64_t logfile_number_;
+  log::Writer* log_;
+  uint32_t seed_;                // For sampling.
+
+  // Queue of writers.
+  std::deque<Writer*> writers_;
+  WriteBatch* tmp_batch_;
+
+  SnapshotList snapshots_;
+
+  // Set of table files to protect from deletion because they are
+  // part of ongoing compactions.
+  std::set<uint64_t> pending_outputs_;
+
+  // Has a background compaction been scheduled or is running?
+  bool bg_compaction_scheduled_;
+
+  // Information for a manual compaction
+  struct ManualCompaction {
+    int level;
+    bool done;
+    const InternalKey* begin;   // NULL means beginning of key range
+    const InternalKey* end;     // NULL means end of key range
+    InternalKey tmp_storage;    // Used to keep track of compaction progress
+  };
+  ManualCompaction* manual_compaction_;
+
+  VersionSet* versions_;
+
+  // Have we encountered a background error in paranoid mode?
+  Status bg_error_;
+
+  // Per level compaction stats.  stats_[level] stores the stats for
+  // compactions that produced data for the specified "level".
+  struct CompactionStats {
+    int64_t micros;
+    int64_t bytes_read;
+    int64_t bytes_written;
+
+    CompactionStats() : micros(0), bytes_read(0), bytes_written(0) { }
+
+    void Add(const CompactionStats& c) {
+      this->micros += c.micros;
+      this->bytes_read += c.bytes_read;
+      this->bytes_written += c.bytes_written;
+    }
+  };
+  CompactionStats stats_[config::kNumLevels];
+
+  // No copying allowed
+  DBImpl(const DBImpl&);
+  void operator=(const DBImpl&);
+
+  const Comparator* user_comparator() const {
+    return internal_comparator_.user_comparator();
+  }
+};
+
+// Sanitize db options.  The caller should delete result.info_log if
+// it is not equal to src.info_log.
+extern Options SanitizeOptions(const std::string& db,
+                               const InternalKeyComparator* icmp,
+                               const InternalFilterPolicy* ipolicy,
+                               const Options& src);
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_DB_DB_IMPL_H_
diff --git a/depend/zcash/src/leveldb/db/db_iter.cc b/depend/zcash/src/leveldb/db/db_iter.cc
new file mode 100644
index 000000000..3b2035e9e
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/db_iter.cc
@@ -0,0 +1,317 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "db/db_iter.h"
+
+#include "db/filename.h"
+#include "db/db_impl.h"
+#include "db/dbformat.h"
+#include "leveldb/env.h"
+#include "leveldb/iterator.h"
+#include "port/port.h"
+#include "util/logging.h"
+#include "util/mutexlock.h"
+#include "util/random.h"
+
+namespace leveldb {
+
+#if 0
+static void DumpInternalIter(Iterator* iter) {
+  for (iter->SeekToFirst(); iter->Valid(); iter->Next()) {
+    ParsedInternalKey k;
+    if (!ParseInternalKey(iter->key(), &k)) {
+      fprintf(stderr, "Corrupt '%s'\n", EscapeString(iter->key()).c_str());
+    } else {
+      fprintf(stderr, "@ '%s'\n", k.DebugString().c_str());
+    }
+  }
+}
+#endif
+
+namespace {
+
+// Memtables and sstables that make the DB representation contain
+// (userkey,seq,type) => uservalue entries.  DBIter
+// combines multiple entries for the same userkey found in the DB
+// representation into a single entry while accounting for sequence
+// numbers, deletion markers, overwrites, etc.
+class DBIter: public Iterator {
+ public:
+  // Which direction is the iterator currently moving?
+  // (1) When moving forward, the internal iterator is positioned at
+  //     the exact entry that yields this->key(), this->value()
+  // (2) When moving backwards, the internal iterator is positioned
+  //     just before all entries whose user key == this->key().
+  enum Direction {
+    kForward,
+    kReverse
+  };
+
+  DBIter(DBImpl* db, const Comparator* cmp, Iterator* iter, SequenceNumber s,
+         uint32_t seed)
+      : db_(db),
+        user_comparator_(cmp),
+        iter_(iter),
+        sequence_(s),
+        direction_(kForward),
+        valid_(false),
+        rnd_(seed),
+        bytes_counter_(RandomPeriod()) {
+  }
+  virtual ~DBIter() {
+    delete iter_;
+  }
+  virtual bool Valid() const { return valid_; }
+  virtual Slice key() const {
+    assert(valid_);
+    return (direction_ == kForward) ? ExtractUserKey(iter_->key()) : saved_key_;
+  }
+  virtual Slice value() const {
+    assert(valid_);
+    return (direction_ == kForward) ? iter_->value() : saved_value_;
+  }
+  virtual Status status() const {
+    if (status_.ok()) {
+      return iter_->status();
+    } else {
+      return status_;
+    }
+  }
+
+  virtual void Next();
+  virtual void Prev();
+  virtual void Seek(const Slice& target);
+  virtual void SeekToFirst();
+  virtual void SeekToLast();
+
+ private:
+  void FindNextUserEntry(bool skipping, std::string* skip);
+  void FindPrevUserEntry();
+  bool ParseKey(ParsedInternalKey* key);
+
+  inline void SaveKey(const Slice& k, std::string* dst) {
+    dst->assign(k.data(), k.size());
+  }
+
+  inline void ClearSavedValue() {
+    if (saved_value_.capacity() > 1048576) {
+      std::string empty;
+      swap(empty, saved_value_);
+    } else {
+      saved_value_.clear();
+    }
+  }
+
+  // Pick next gap with average value of config::kReadBytesPeriod.
+  ssize_t RandomPeriod() {
+    return rnd_.Uniform(2*config::kReadBytesPeriod);
+  }
+
+  DBImpl* db_;
+  const Comparator* const user_comparator_;
+  Iterator* const iter_;
+  SequenceNumber const sequence_;
+
+  Status status_;
+  std::string saved_key_;     // == current key when direction_==kReverse
+  std::string saved_value_;   // == current raw value when direction_==kReverse
+  Direction direction_;
+  bool valid_;
+
+  Random rnd_;
+  ssize_t bytes_counter_;
+
+  // No copying allowed
+  DBIter(const DBIter&);
+  void operator=(const DBIter&);
+};
+
+inline bool DBIter::ParseKey(ParsedInternalKey* ikey) {
+  Slice k = iter_->key();
+  ssize_t n = k.size() + iter_->value().size();
+  bytes_counter_ -= n;
+  while (bytes_counter_ < 0) {
+    bytes_counter_ += RandomPeriod();
+    db_->RecordReadSample(k);
+  }
+  if (!ParseInternalKey(k, ikey)) {
+    status_ = Status::Corruption("corrupted internal key in DBIter");
+    return false;
+  } else {
+    return true;
+  }
+}
+
+void DBIter::Next() {
+  assert(valid_);
+
+  if (direction_ == kReverse) {  // Switch directions?
+    direction_ = kForward;
+    // iter_ is pointing just before the entries for this->key(),
+    // so advance into the range of entries for this->key() and then
+    // use the normal skipping code below.
+    if (!iter_->Valid()) {
+      iter_->SeekToFirst();
+    } else {
+      iter_->Next();
+    }
+    if (!iter_->Valid()) {
+      valid_ = false;
+      saved_key_.clear();
+      return;
+    }
+    // saved_key_ already contains the key to skip past.
+  } else {
+    // Store in saved_key_ the current key so we skip it below.
+    SaveKey(ExtractUserKey(iter_->key()), &saved_key_);
+  }
+
+  FindNextUserEntry(true, &saved_key_);
+}
+
+void DBIter::FindNextUserEntry(bool skipping, std::string* skip) {
+  // Loop until we hit an acceptable entry to yield
+  assert(iter_->Valid());
+  assert(direction_ == kForward);
+  do {
+    ParsedInternalKey ikey;
+    if (ParseKey(&ikey) && ikey.sequence <= sequence_) {
+      switch (ikey.type) {
+        case kTypeDeletion:
+          // Arrange to skip all upcoming entries for this key since
+          // they are hidden by this deletion.
+          SaveKey(ikey.user_key, skip);
+          skipping = true;
+          break;
+        case kTypeValue:
+          if (skipping &&
+              user_comparator_->Compare(ikey.user_key, *skip) <= 0) {
+            // Entry hidden
+          } else {
+            valid_ = true;
+            saved_key_.clear();
+            return;
+          }
+          break;
+      }
+    }
+    iter_->Next();
+  } while (iter_->Valid());
+  saved_key_.clear();
+  valid_ = false;
+}
+
+void DBIter::Prev() {
+  assert(valid_);
+
+  if (direction_ == kForward) {  // Switch directions?
+    // iter_ is pointing at the current entry.  Scan backwards until
+    // the key changes so we can use the normal reverse scanning code.
+    assert(iter_->Valid());  // Otherwise valid_ would have been false
+    SaveKey(ExtractUserKey(iter_->key()), &saved_key_);
+    while (true) {
+      iter_->Prev();
+      if (!iter_->Valid()) {
+        valid_ = false;
+        saved_key_.clear();
+        ClearSavedValue();
+        return;
+      }
+      if (user_comparator_->Compare(ExtractUserKey(iter_->key()),
+                                    saved_key_) < 0) {
+        break;
+      }
+    }
+    direction_ = kReverse;
+  }
+
+  FindPrevUserEntry();
+}
+
+void DBIter::FindPrevUserEntry() {
+  assert(direction_ == kReverse);
+
+  ValueType value_type = kTypeDeletion;
+  if (iter_->Valid()) {
+    do {
+      ParsedInternalKey ikey;
+      if (ParseKey(&ikey) && ikey.sequence <= sequence_) {
+        if ((value_type != kTypeDeletion) &&
+            user_comparator_->Compare(ikey.user_key, saved_key_) < 0) {
+          // We encountered a non-deleted value in entries for previous keys,
+          break;
+        }
+        value_type = ikey.type;
+        if (value_type == kTypeDeletion) {
+          saved_key_.clear();
+          ClearSavedValue();
+        } else {
+          Slice raw_value = iter_->value();
+          if (saved_value_.capacity() > raw_value.size() + 1048576) {
+            std::string empty;
+            swap(empty, saved_value_);
+          }
+          SaveKey(ExtractUserKey(iter_->key()), &saved_key_);
+          saved_value_.assign(raw_value.data(), raw_value.size());
+        }
+      }
+      iter_->Prev();
+    } while (iter_->Valid());
+  }
+
+  if (value_type == kTypeDeletion) {
+    // End
+    valid_ = false;
+    saved_key_.clear();
+    ClearSavedValue();
+    direction_ = kForward;
+  } else {
+    valid_ = true;
+  }
+}
+
+void DBIter::Seek(const Slice& target) {
+  direction_ = kForward;
+  ClearSavedValue();
+  saved_key_.clear();
+  AppendInternalKey(
+      &saved_key_, ParsedInternalKey(target, sequence_, kValueTypeForSeek));
+  iter_->Seek(saved_key_);
+  if (iter_->Valid()) {
+    FindNextUserEntry(false, &saved_key_ /* temporary storage */);
+  } else {
+    valid_ = false;
+  }
+}
+
+void DBIter::SeekToFirst() {
+  direction_ = kForward;
+  ClearSavedValue();
+  iter_->SeekToFirst();
+  if (iter_->Valid()) {
+    FindNextUserEntry(false, &saved_key_ /* temporary storage */);
+  } else {
+    valid_ = false;
+  }
+}
+
+void DBIter::SeekToLast() {
+  direction_ = kReverse;
+  ClearSavedValue();
+  iter_->SeekToLast();
+  FindPrevUserEntry();
+}
+
+}  // anonymous namespace
+
+Iterator* NewDBIterator(
+    DBImpl* db,
+    const Comparator* user_key_comparator,
+    Iterator* internal_iter,
+    SequenceNumber sequence,
+    uint32_t seed) {
+  return new DBIter(db, user_key_comparator, internal_iter, sequence, seed);
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/db/db_iter.h b/depend/zcash/src/leveldb/db/db_iter.h
new file mode 100644
index 000000000..04927e937
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/db_iter.h
@@ -0,0 +1,28 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_DB_DB_ITER_H_
+#define STORAGE_LEVELDB_DB_DB_ITER_H_
+
+#include <stdint.h>
+#include "leveldb/db.h"
+#include "db/dbformat.h"
+
+namespace leveldb {
+
+class DBImpl;
+
+// Return a new iterator that converts internal keys (yielded by
+// "*internal_iter") that were live at the specified "sequence" number
+// into appropriate user keys.
+extern Iterator* NewDBIterator(
+    DBImpl* db,
+    const Comparator* user_key_comparator,
+    Iterator* internal_iter,
+    SequenceNumber sequence,
+    uint32_t seed);
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_DB_DB_ITER_H_
diff --git a/depend/zcash/src/leveldb/db/db_test.cc b/depend/zcash/src/leveldb/db/db_test.cc
new file mode 100644
index 000000000..a0b08bc19
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/db_test.cc
@@ -0,0 +1,2158 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "leveldb/db.h"
+#include "leveldb/filter_policy.h"
+#include "db/db_impl.h"
+#include "db/filename.h"
+#include "db/version_set.h"
+#include "db/write_batch_internal.h"
+#include "leveldb/cache.h"
+#include "leveldb/env.h"
+#include "leveldb/table.h"
+#include "util/hash.h"
+#include "util/logging.h"
+#include "util/mutexlock.h"
+#include "util/testharness.h"
+#include "util/testutil.h"
+
+namespace leveldb {
+
+static std::string RandomString(Random* rnd, int len) {
+  std::string r;
+  test::RandomString(rnd, len, &r);
+  return r;
+}
+
+namespace {
+class AtomicCounter {
+ private:
+  port::Mutex mu_;
+  int count_;
+ public:
+  AtomicCounter() : count_(0) { }
+  void Increment() {
+    IncrementBy(1);
+  }
+  void IncrementBy(int count) {
+    MutexLock l(&mu_);
+    count_ += count;
+  }
+  int Read() {
+    MutexLock l(&mu_);
+    return count_;
+  }
+  void Reset() {
+    MutexLock l(&mu_);
+    count_ = 0;
+  }
+};
+
+void DelayMilliseconds(int millis) {
+  Env::Default()->SleepForMicroseconds(millis * 1000);
+}
+}
+
+// Special Env used to delay background operations
+class SpecialEnv : public EnvWrapper {
+ public:
+  // sstable/log Sync() calls are blocked while this pointer is non-NULL.
+  port::AtomicPointer delay_data_sync_;
+
+  // sstable/log Sync() calls return an error.
+  port::AtomicPointer data_sync_error_;
+
+  // Simulate no-space errors while this pointer is non-NULL.
+  port::AtomicPointer no_space_;
+
+  // Simulate non-writable file system while this pointer is non-NULL
+  port::AtomicPointer non_writable_;
+
+  // Force sync of manifest files to fail while this pointer is non-NULL
+  port::AtomicPointer manifest_sync_error_;
+
+  // Force write to manifest files to fail while this pointer is non-NULL
+  port::AtomicPointer manifest_write_error_;
+
+  bool count_random_reads_;
+  AtomicCounter random_read_counter_;
+
+  explicit SpecialEnv(Env* base) : EnvWrapper(base) {
+    delay_data_sync_.Release_Store(NULL);
+    data_sync_error_.Release_Store(NULL);
+    no_space_.Release_Store(NULL);
+    non_writable_.Release_Store(NULL);
+    count_random_reads_ = false;
+    manifest_sync_error_.Release_Store(NULL);
+    manifest_write_error_.Release_Store(NULL);
+  }
+
+  Status NewWritableFile(const std::string& f, WritableFile** r) {
+    class DataFile : public WritableFile {
+     private:
+      SpecialEnv* env_;
+      WritableFile* base_;
+
+     public:
+      DataFile(SpecialEnv* env, WritableFile* base)
+          : env_(env),
+            base_(base) {
+      }
+      ~DataFile() { delete base_; }
+      Status Append(const Slice& data) {
+        if (env_->no_space_.Acquire_Load() != NULL) {
+          // Drop writes on the floor
+          return Status::OK();
+        } else {
+          return base_->Append(data);
+        }
+      }
+      Status Close() { return base_->Close(); }
+      Status Flush() { return base_->Flush(); }
+      Status Sync() {
+        if (env_->data_sync_error_.Acquire_Load() != NULL) {
+          return Status::IOError("simulated data sync error");
+        }
+        while (env_->delay_data_sync_.Acquire_Load() != NULL) {
+          DelayMilliseconds(100);
+        }
+        return base_->Sync();
+      }
+    };
+    class ManifestFile : public WritableFile {
+     private:
+      SpecialEnv* env_;
+      WritableFile* base_;
+     public:
+      ManifestFile(SpecialEnv* env, WritableFile* b) : env_(env), base_(b) { }
+      ~ManifestFile() { delete base_; }
+      Status Append(const Slice& data) {
+        if (env_->manifest_write_error_.Acquire_Load() != NULL) {
+          return Status::IOError("simulated writer error");
+        } else {
+          return base_->Append(data);
+        }
+      }
+      Status Close() { return base_->Close(); }
+      Status Flush() { return base_->Flush(); }
+      Status Sync() {
+        if (env_->manifest_sync_error_.Acquire_Load() != NULL) {
+          return Status::IOError("simulated sync error");
+        } else {
+          return base_->Sync();
+        }
+      }
+    };
+
+    if (non_writable_.Acquire_Load() != NULL) {
+      return Status::IOError("simulated write error");
+    }
+
+    Status s = target()->NewWritableFile(f, r);
+    if (s.ok()) {
+      if (strstr(f.c_str(), ".ldb") != NULL ||
+          strstr(f.c_str(), ".log") != NULL) {
+        *r = new DataFile(this, *r);
+      } else if (strstr(f.c_str(), "MANIFEST") != NULL) {
+        *r = new ManifestFile(this, *r);
+      }
+    }
+    return s;
+  }
+
+  Status NewRandomAccessFile(const std::string& f, RandomAccessFile** r) {
+    class CountingFile : public RandomAccessFile {
+     private:
+      RandomAccessFile* target_;
+      AtomicCounter* counter_;
+     public:
+      CountingFile(RandomAccessFile* target, AtomicCounter* counter)
+          : target_(target), counter_(counter) {
+      }
+      virtual ~CountingFile() { delete target_; }
+      virtual Status Read(uint64_t offset, size_t n, Slice* result,
+                          char* scratch) const {
+        counter_->Increment();
+        return target_->Read(offset, n, result, scratch);
+      }
+    };
+
+    Status s = target()->NewRandomAccessFile(f, r);
+    if (s.ok() && count_random_reads_) {
+      *r = new CountingFile(*r, &random_read_counter_);
+    }
+    return s;
+  }
+};
+
+class DBTest {
+ private:
+  const FilterPolicy* filter_policy_;
+
+  // Sequence of option configurations to try
+  enum OptionConfig {
+    kDefault,
+    kReuse,
+    kFilter,
+    kUncompressed,
+    kEnd
+  };
+  int option_config_;
+
+ public:
+  std::string dbname_;
+  SpecialEnv* env_;
+  DB* db_;
+
+  Options last_options_;
+
+  DBTest() : option_config_(kDefault),
+             env_(new SpecialEnv(Env::Default())) {
+    filter_policy_ = NewBloomFilterPolicy(10);
+    dbname_ = test::TmpDir() + "/db_test";
+    DestroyDB(dbname_, Options());
+    db_ = NULL;
+    Reopen();
+  }
+
+  ~DBTest() {
+    delete db_;
+    DestroyDB(dbname_, Options());
+    delete env_;
+    delete filter_policy_;
+  }
+
+  // Switch to a fresh database with the next option configuration to
+  // test.  Return false if there are no more configurations to test.
+  bool ChangeOptions() {
+    option_config_++;
+    if (option_config_ >= kEnd) {
+      return false;
+    } else {
+      DestroyAndReopen();
+      return true;
+    }
+  }
+
+  // Return the current option configuration.
+  Options CurrentOptions() {
+    Options options;
+    options.reuse_logs = false;
+    switch (option_config_) {
+      case kReuse:
+        options.reuse_logs = true;
+        break;
+      case kFilter:
+        options.filter_policy = filter_policy_;
+        break;
+      case kUncompressed:
+        options.compression = kNoCompression;
+        break;
+      default:
+        break;
+    }
+    return options;
+  }
+
+  DBImpl* dbfull() {
+    return reinterpret_cast<DBImpl*>(db_);
+  }
+
+  void Reopen(Options* options = NULL) {
+    ASSERT_OK(TryReopen(options));
+  }
+
+  void Close() {
+    delete db_;
+    db_ = NULL;
+  }
+
+  void DestroyAndReopen(Options* options = NULL) {
+    delete db_;
+    db_ = NULL;
+    DestroyDB(dbname_, Options());
+    ASSERT_OK(TryReopen(options));
+  }
+
+  Status TryReopen(Options* options) {
+    delete db_;
+    db_ = NULL;
+    Options opts;
+    if (options != NULL) {
+      opts = *options;
+    } else {
+      opts = CurrentOptions();
+      opts.create_if_missing = true;
+    }
+    last_options_ = opts;
+
+    return DB::Open(opts, dbname_, &db_);
+  }
+
+  Status Put(const std::string& k, const std::string& v) {
+    return db_->Put(WriteOptions(), k, v);
+  }
+
+  Status Delete(const std::string& k) {
+    return db_->Delete(WriteOptions(), k);
+  }
+
+  std::string Get(const std::string& k, const Snapshot* snapshot = NULL) {
+    ReadOptions options;
+    options.snapshot = snapshot;
+    std::string result;
+    Status s = db_->Get(options, k, &result);
+    if (s.IsNotFound()) {
+      result = "NOT_FOUND";
+    } else if (!s.ok()) {
+      result = s.ToString();
+    }
+    return result;
+  }
+
+  // Return a string that contains all key,value pairs in order,
+  // formatted like "(k1->v1)(k2->v2)".
+  std::string Contents() {
+    std::vector<std::string> forward;
+    std::string result;
+    Iterator* iter = db_->NewIterator(ReadOptions());
+    for (iter->SeekToFirst(); iter->Valid(); iter->Next()) {
+      std::string s = IterStatus(iter);
+      result.push_back('(');
+      result.append(s);
+      result.push_back(')');
+      forward.push_back(s);
+    }
+
+    // Check reverse iteration results are the reverse of forward results
+    size_t matched = 0;
+    for (iter->SeekToLast(); iter->Valid(); iter->Prev()) {
+      ASSERT_LT(matched, forward.size());
+      ASSERT_EQ(IterStatus(iter), forward[forward.size() - matched - 1]);
+      matched++;
+    }
+    ASSERT_EQ(matched, forward.size());
+
+    delete iter;
+    return result;
+  }
+
+  std::string AllEntriesFor(const Slice& user_key) {
+    Iterator* iter = dbfull()->TEST_NewInternalIterator();
+    InternalKey target(user_key, kMaxSequenceNumber, kTypeValue);
+    iter->Seek(target.Encode());
+    std::string result;
+    if (!iter->status().ok()) {
+      result = iter->status().ToString();
+    } else {
+      result = "[ ";
+      bool first = true;
+      while (iter->Valid()) {
+        ParsedInternalKey ikey;
+        if (!ParseInternalKey(iter->key(), &ikey)) {
+          result += "CORRUPTED";
+        } else {
+          if (last_options_.comparator->Compare(ikey.user_key, user_key) != 0) {
+            break;
+          }
+          if (!first) {
+            result += ", ";
+          }
+          first = false;
+          switch (ikey.type) {
+            case kTypeValue:
+              result += iter->value().ToString();
+              break;
+            case kTypeDeletion:
+              result += "DEL";
+              break;
+          }
+        }
+        iter->Next();
+      }
+      if (!first) {
+        result += " ";
+      }
+      result += "]";
+    }
+    delete iter;
+    return result;
+  }
+
+  int NumTableFilesAtLevel(int level) {
+    std::string property;
+    ASSERT_TRUE(
+        db_->GetProperty("leveldb.num-files-at-level" + NumberToString(level),
+                         &property));
+    return atoi(property.c_str());
+  }
+
+  int TotalTableFiles() {
+    int result = 0;
+    for (int level = 0; level < config::kNumLevels; level++) {
+      result += NumTableFilesAtLevel(level);
+    }
+    return result;
+  }
+
+  // Return spread of files per level
+  std::string FilesPerLevel() {
+    std::string result;
+    int last_non_zero_offset = 0;
+    for (int level = 0; level < config::kNumLevels; level++) {
+      int f = NumTableFilesAtLevel(level);
+      char buf[100];
+      snprintf(buf, sizeof(buf), "%s%d", (level ? "," : ""), f);
+      result += buf;
+      if (f > 0) {
+        last_non_zero_offset = result.size();
+      }
+    }
+    result.resize(last_non_zero_offset);
+    return result;
+  }
+
+  int CountFiles() {
+    std::vector<std::string> files;
+    env_->GetChildren(dbname_, &files);
+    return static_cast<int>(files.size());
+  }
+
+  uint64_t Size(const Slice& start, const Slice& limit) {
+    Range r(start, limit);
+    uint64_t size;
+    db_->GetApproximateSizes(&r, 1, &size);
+    return size;
+  }
+
+  void Compact(const Slice& start, const Slice& limit) {
+    db_->CompactRange(&start, &limit);
+  }
+
+  // Do n memtable compactions, each of which produces an sstable
+  // covering the range [small,large].
+  void MakeTables(int n, const std::string& small, const std::string& large) {
+    for (int i = 0; i < n; i++) {
+      Put(small, "begin");
+      Put(large, "end");
+      dbfull()->TEST_CompactMemTable();
+    }
+  }
+
+  // Prevent pushing of new sstables into deeper levels by adding
+  // tables that cover a specified range to all levels.
+  void FillLevels(const std::string& smallest, const std::string& largest) {
+    MakeTables(config::kNumLevels, smallest, largest);
+  }
+
+  void DumpFileCounts(const char* label) {
+    fprintf(stderr, "---\n%s:\n", label);
+    fprintf(stderr, "maxoverlap: %lld\n",
+            static_cast<long long>(
+                dbfull()->TEST_MaxNextLevelOverlappingBytes()));
+    for (int level = 0; level < config::kNumLevels; level++) {
+      int num = NumTableFilesAtLevel(level);
+      if (num > 0) {
+        fprintf(stderr, "  level %3d : %d files\n", level, num);
+      }
+    }
+  }
+
+  std::string DumpSSTableList() {
+    std::string property;
+    db_->GetProperty("leveldb.sstables", &property);
+    return property;
+  }
+
+  std::string IterStatus(Iterator* iter) {
+    std::string result;
+    if (iter->Valid()) {
+      result = iter->key().ToString() + "->" + iter->value().ToString();
+    } else {
+      result = "(invalid)";
+    }
+    return result;
+  }
+
+  bool DeleteAnSSTFile() {
+    std::vector<std::string> filenames;
+    ASSERT_OK(env_->GetChildren(dbname_, &filenames));
+    uint64_t number;
+    FileType type;
+    for (size_t i = 0; i < filenames.size(); i++) {
+      if (ParseFileName(filenames[i], &number, &type) && type == kTableFile) {
+        ASSERT_OK(env_->DeleteFile(TableFileName(dbname_, number)));
+        return true;
+      }
+    }
+    return false;
+  }
+
+  // Returns number of files renamed.
+  int RenameLDBToSST() {
+    std::vector<std::string> filenames;
+    ASSERT_OK(env_->GetChildren(dbname_, &filenames));
+    uint64_t number;
+    FileType type;
+    int files_renamed = 0;
+    for (size_t i = 0; i < filenames.size(); i++) {
+      if (ParseFileName(filenames[i], &number, &type) && type == kTableFile) {
+        const std::string from = TableFileName(dbname_, number);
+        const std::string to = SSTTableFileName(dbname_, number);
+        ASSERT_OK(env_->RenameFile(from, to));
+        files_renamed++;
+      }
+    }
+    return files_renamed;
+  }
+};
+
+TEST(DBTest, Empty) {
+  do {
+    ASSERT_TRUE(db_ != NULL);
+    ASSERT_EQ("NOT_FOUND", Get("foo"));
+  } while (ChangeOptions());
+}
+
+TEST(DBTest, ReadWrite) {
+  do {
+    ASSERT_OK(Put("foo", "v1"));
+    ASSERT_EQ("v1", Get("foo"));
+    ASSERT_OK(Put("bar", "v2"));
+    ASSERT_OK(Put("foo", "v3"));
+    ASSERT_EQ("v3", Get("foo"));
+    ASSERT_EQ("v2", Get("bar"));
+  } while (ChangeOptions());
+}
+
+TEST(DBTest, PutDeleteGet) {
+  do {
+    ASSERT_OK(db_->Put(WriteOptions(), "foo", "v1"));
+    ASSERT_EQ("v1", Get("foo"));
+    ASSERT_OK(db_->Put(WriteOptions(), "foo", "v2"));
+    ASSERT_EQ("v2", Get("foo"));
+    ASSERT_OK(db_->Delete(WriteOptions(), "foo"));
+    ASSERT_EQ("NOT_FOUND", Get("foo"));
+  } while (ChangeOptions());
+}
+
+TEST(DBTest, GetFromImmutableLayer) {
+  do {
+    Options options = CurrentOptions();
+    options.env = env_;
+    options.write_buffer_size = 100000;  // Small write buffer
+    Reopen(&options);
+
+    ASSERT_OK(Put("foo", "v1"));
+    ASSERT_EQ("v1", Get("foo"));
+
+    env_->delay_data_sync_.Release_Store(env_);      // Block sync calls
+    Put("k1", std::string(100000, 'x'));             // Fill memtable
+    Put("k2", std::string(100000, 'y'));             // Trigger compaction
+    ASSERT_EQ("v1", Get("foo"));
+    env_->delay_data_sync_.Release_Store(NULL);      // Release sync calls
+  } while (ChangeOptions());
+}
+
+TEST(DBTest, GetFromVersions) {
+  do {
+    ASSERT_OK(Put("foo", "v1"));
+    dbfull()->TEST_CompactMemTable();
+    ASSERT_EQ("v1", Get("foo"));
+  } while (ChangeOptions());
+}
+
+TEST(DBTest, GetMemUsage) {
+  do {
+    ASSERT_OK(Put("foo", "v1"));
+    std::string val;
+    ASSERT_TRUE(db_->GetProperty("leveldb.approximate-memory-usage", &val));
+    int mem_usage = atoi(val.c_str());
+    ASSERT_GT(mem_usage, 0);
+    ASSERT_LT(mem_usage, 5*1024*1024);
+  } while (ChangeOptions());
+}
+
+TEST(DBTest, GetSnapshot) {
+  do {
+    // Try with both a short key and a long key
+    for (int i = 0; i < 2; i++) {
+      std::string key = (i == 0) ? std::string("foo") : std::string(200, 'x');
+      ASSERT_OK(Put(key, "v1"));
+      const Snapshot* s1 = db_->GetSnapshot();
+      ASSERT_OK(Put(key, "v2"));
+      ASSERT_EQ("v2", Get(key));
+      ASSERT_EQ("v1", Get(key, s1));
+      dbfull()->TEST_CompactMemTable();
+      ASSERT_EQ("v2", Get(key));
+      ASSERT_EQ("v1", Get(key, s1));
+      db_->ReleaseSnapshot(s1);
+    }
+  } while (ChangeOptions());
+}
+
+TEST(DBTest, GetLevel0Ordering) {
+  do {
+    // Check that we process level-0 files in correct order.  The code
+    // below generates two level-0 files where the earlier one comes
+    // before the later one in the level-0 file list since the earlier
+    // one has a smaller "smallest" key.
+    ASSERT_OK(Put("bar", "b"));
+    ASSERT_OK(Put("foo", "v1"));
+    dbfull()->TEST_CompactMemTable();
+    ASSERT_OK(Put("foo", "v2"));
+    dbfull()->TEST_CompactMemTable();
+    ASSERT_EQ("v2", Get("foo"));
+  } while (ChangeOptions());
+}
+
+TEST(DBTest, GetOrderedByLevels) {
+  do {
+    ASSERT_OK(Put("foo", "v1"));
+    Compact("a", "z");
+    ASSERT_EQ("v1", Get("foo"));
+    ASSERT_OK(Put("foo", "v2"));
+    ASSERT_EQ("v2", Get("foo"));
+    dbfull()->TEST_CompactMemTable();
+    ASSERT_EQ("v2", Get("foo"));
+  } while (ChangeOptions());
+}
+
+TEST(DBTest, GetPicksCorrectFile) {
+  do {
+    // Arrange to have multiple files in a non-level-0 level.
+    ASSERT_OK(Put("a", "va"));
+    Compact("a", "b");
+    ASSERT_OK(Put("x", "vx"));
+    Compact("x", "y");
+    ASSERT_OK(Put("f", "vf"));
+    Compact("f", "g");
+    ASSERT_EQ("va", Get("a"));
+    ASSERT_EQ("vf", Get("f"));
+    ASSERT_EQ("vx", Get("x"));
+  } while (ChangeOptions());
+}
+
+TEST(DBTest, GetEncountersEmptyLevel) {
+  do {
+    // Arrange for the following to happen:
+    //   * sstable A in level 0
+    //   * nothing in level 1
+    //   * sstable B in level 2
+    // Then do enough Get() calls to arrange for an automatic compaction
+    // of sstable A.  A bug would cause the compaction to be marked as
+    // occurring at level 1 (instead of the correct level 0).
+
+    // Step 1: First place sstables in levels 0 and 2
+    int compaction_count = 0;
+    while (NumTableFilesAtLevel(0) == 0 ||
+           NumTableFilesAtLevel(2) == 0) {
+      ASSERT_LE(compaction_count, 100) << "could not fill levels 0 and 2";
+      compaction_count++;
+      Put("a", "begin");
+      Put("z", "end");
+      dbfull()->TEST_CompactMemTable();
+    }
+
+    // Step 2: clear level 1 if necessary.
+    dbfull()->TEST_CompactRange(1, NULL, NULL);
+    ASSERT_EQ(NumTableFilesAtLevel(0), 1);
+    ASSERT_EQ(NumTableFilesAtLevel(1), 0);
+    ASSERT_EQ(NumTableFilesAtLevel(2), 1);
+
+    // Step 3: read a bunch of times
+    for (int i = 0; i < 1000; i++) {
+      ASSERT_EQ("NOT_FOUND", Get("missing"));
+    }
+
+    // Step 4: Wait for compaction to finish
+    DelayMilliseconds(1000);
+
+    ASSERT_EQ(NumTableFilesAtLevel(0), 0);
+  } while (ChangeOptions());
+}
+
+TEST(DBTest, IterEmpty) {
+  Iterator* iter = db_->NewIterator(ReadOptions());
+
+  iter->SeekToFirst();
+  ASSERT_EQ(IterStatus(iter), "(invalid)");
+
+  iter->SeekToLast();
+  ASSERT_EQ(IterStatus(iter), "(invalid)");
+
+  iter->Seek("foo");
+  ASSERT_EQ(IterStatus(iter), "(invalid)");
+
+  delete iter;
+}
+
+TEST(DBTest, IterSingle) {
+  ASSERT_OK(Put("a", "va"));
+  Iterator* iter = db_->NewIterator(ReadOptions());
+
+  iter->SeekToFirst();
+  ASSERT_EQ(IterStatus(iter), "a->va");
+  iter->Next();
+  ASSERT_EQ(IterStatus(iter), "(invalid)");
+  iter->SeekToFirst();
+  ASSERT_EQ(IterStatus(iter), "a->va");
+  iter->Prev();
+  ASSERT_EQ(IterStatus(iter), "(invalid)");
+
+  iter->SeekToLast();
+  ASSERT_EQ(IterStatus(iter), "a->va");
+  iter->Next();
+  ASSERT_EQ(IterStatus(iter), "(invalid)");
+  iter->SeekToLast();
+  ASSERT_EQ(IterStatus(iter), "a->va");
+  iter->Prev();
+  ASSERT_EQ(IterStatus(iter), "(invalid)");
+
+  iter->Seek("");
+  ASSERT_EQ(IterStatus(iter), "a->va");
+  iter->Next();
+  ASSERT_EQ(IterStatus(iter), "(invalid)");
+
+  iter->Seek("a");
+  ASSERT_EQ(IterStatus(iter), "a->va");
+  iter->Next();
+  ASSERT_EQ(IterStatus(iter), "(invalid)");
+
+  iter->Seek("b");
+  ASSERT_EQ(IterStatus(iter), "(invalid)");
+
+  delete iter;
+}
+
+TEST(DBTest, IterMulti) {
+  ASSERT_OK(Put("a", "va"));
+  ASSERT_OK(Put("b", "vb"));
+  ASSERT_OK(Put("c", "vc"));
+  Iterator* iter = db_->NewIterator(ReadOptions());
+
+  iter->SeekToFirst();
+  ASSERT_EQ(IterStatus(iter), "a->va");
+  iter->Next();
+  ASSERT_EQ(IterStatus(iter), "b->vb");
+  iter->Next();
+  ASSERT_EQ(IterStatus(iter), "c->vc");
+  iter->Next();
+  ASSERT_EQ(IterStatus(iter), "(invalid)");
+  iter->SeekToFirst();
+  ASSERT_EQ(IterStatus(iter), "a->va");
+  iter->Prev();
+  ASSERT_EQ(IterStatus(iter), "(invalid)");
+
+  iter->SeekToLast();
+  ASSERT_EQ(IterStatus(iter), "c->vc");
+  iter->Prev();
+  ASSERT_EQ(IterStatus(iter), "b->vb");
+  iter->Prev();
+  ASSERT_EQ(IterStatus(iter), "a->va");
+  iter->Prev();
+  ASSERT_EQ(IterStatus(iter), "(invalid)");
+  iter->SeekToLast();
+  ASSERT_EQ(IterStatus(iter), "c->vc");
+  iter->Next();
+  ASSERT_EQ(IterStatus(iter), "(invalid)");
+
+  iter->Seek("");
+  ASSERT_EQ(IterStatus(iter), "a->va");
+  iter->Seek("a");
+  ASSERT_EQ(IterStatus(iter), "a->va");
+  iter->Seek("ax");
+  ASSERT_EQ(IterStatus(iter), "b->vb");
+  iter->Seek("b");
+  ASSERT_EQ(IterStatus(iter), "b->vb");
+  iter->Seek("z");
+  ASSERT_EQ(IterStatus(iter), "(invalid)");
+
+  // Switch from reverse to forward
+  iter->SeekToLast();
+  iter->Prev();
+  iter->Prev();
+  iter->Next();
+  ASSERT_EQ(IterStatus(iter), "b->vb");
+
+  // Switch from forward to reverse
+  iter->SeekToFirst();
+  iter->Next();
+  iter->Next();
+  iter->Prev();
+  ASSERT_EQ(IterStatus(iter), "b->vb");
+
+  // Make sure iter stays at snapshot
+  ASSERT_OK(Put("a",  "va2"));
+  ASSERT_OK(Put("a2", "va3"));
+  ASSERT_OK(Put("b",  "vb2"));
+  ASSERT_OK(Put("c",  "vc2"));
+  ASSERT_OK(Delete("b"));
+  iter->SeekToFirst();
+  ASSERT_EQ(IterStatus(iter), "a->va");
+  iter->Next();
+  ASSERT_EQ(IterStatus(iter), "b->vb");
+  iter->Next();
+  ASSERT_EQ(IterStatus(iter), "c->vc");
+  iter->Next();
+  ASSERT_EQ(IterStatus(iter), "(invalid)");
+  iter->SeekToLast();
+  ASSERT_EQ(IterStatus(iter), "c->vc");
+  iter->Prev();
+  ASSERT_EQ(IterStatus(iter), "b->vb");
+  iter->Prev();
+  ASSERT_EQ(IterStatus(iter), "a->va");
+  iter->Prev();
+  ASSERT_EQ(IterStatus(iter), "(invalid)");
+
+  delete iter;
+}
+
+TEST(DBTest, IterSmallAndLargeMix) {
+  ASSERT_OK(Put("a", "va"));
+  ASSERT_OK(Put("b", std::string(100000, 'b')));
+  ASSERT_OK(Put("c", "vc"));
+  ASSERT_OK(Put("d", std::string(100000, 'd')));
+  ASSERT_OK(Put("e", std::string(100000, 'e')));
+
+  Iterator* iter = db_->NewIterator(ReadOptions());
+
+  iter->SeekToFirst();
+  ASSERT_EQ(IterStatus(iter), "a->va");
+  iter->Next();
+  ASSERT_EQ(IterStatus(iter), "b->" + std::string(100000, 'b'));
+  iter->Next();
+  ASSERT_EQ(IterStatus(iter), "c->vc");
+  iter->Next();
+  ASSERT_EQ(IterStatus(iter), "d->" + std::string(100000, 'd'));
+  iter->Next();
+  ASSERT_EQ(IterStatus(iter), "e->" + std::string(100000, 'e'));
+  iter->Next();
+  ASSERT_EQ(IterStatus(iter), "(invalid)");
+
+  iter->SeekToLast();
+  ASSERT_EQ(IterStatus(iter), "e->" + std::string(100000, 'e'));
+  iter->Prev();
+  ASSERT_EQ(IterStatus(iter), "d->" + std::string(100000, 'd'));
+  iter->Prev();
+  ASSERT_EQ(IterStatus(iter), "c->vc");
+  iter->Prev();
+  ASSERT_EQ(IterStatus(iter), "b->" + std::string(100000, 'b'));
+  iter->Prev();
+  ASSERT_EQ(IterStatus(iter), "a->va");
+  iter->Prev();
+  ASSERT_EQ(IterStatus(iter), "(invalid)");
+
+  delete iter;
+}
+
+TEST(DBTest, IterMultiWithDelete) {
+  do {
+    ASSERT_OK(Put("a", "va"));
+    ASSERT_OK(Put("b", "vb"));
+    ASSERT_OK(Put("c", "vc"));
+    ASSERT_OK(Delete("b"));
+    ASSERT_EQ("NOT_FOUND", Get("b"));
+
+    Iterator* iter = db_->NewIterator(ReadOptions());
+    iter->Seek("c");
+    ASSERT_EQ(IterStatus(iter), "c->vc");
+    iter->Prev();
+    ASSERT_EQ(IterStatus(iter), "a->va");
+    delete iter;
+  } while (ChangeOptions());
+}
+
+TEST(DBTest, Recover) {
+  do {
+    ASSERT_OK(Put("foo", "v1"));
+    ASSERT_OK(Put("baz", "v5"));
+
+    Reopen();
+    ASSERT_EQ("v1", Get("foo"));
+
+    ASSERT_EQ("v1", Get("foo"));
+    ASSERT_EQ("v5", Get("baz"));
+    ASSERT_OK(Put("bar", "v2"));
+    ASSERT_OK(Put("foo", "v3"));
+
+    Reopen();
+    ASSERT_EQ("v3", Get("foo"));
+    ASSERT_OK(Put("foo", "v4"));
+    ASSERT_EQ("v4", Get("foo"));
+    ASSERT_EQ("v2", Get("bar"));
+    ASSERT_EQ("v5", Get("baz"));
+  } while (ChangeOptions());
+}
+
+TEST(DBTest, RecoveryWithEmptyLog) {
+  do {
+    ASSERT_OK(Put("foo", "v1"));
+    ASSERT_OK(Put("foo", "v2"));
+    Reopen();
+    Reopen();
+    ASSERT_OK(Put("foo", "v3"));
+    Reopen();
+    ASSERT_EQ("v3", Get("foo"));
+  } while (ChangeOptions());
+}
+
+// Check that writes done during a memtable compaction are recovered
+// if the database is shutdown during the memtable compaction.
+TEST(DBTest, RecoverDuringMemtableCompaction) {
+  do {
+    Options options = CurrentOptions();
+    options.env = env_;
+    options.write_buffer_size = 1000000;
+    Reopen(&options);
+
+    // Trigger a long memtable compaction and reopen the database during it
+    ASSERT_OK(Put("foo", "v1"));                         // Goes to 1st log file
+    ASSERT_OK(Put("big1", std::string(10000000, 'x')));  // Fills memtable
+    ASSERT_OK(Put("big2", std::string(1000, 'y')));      // Triggers compaction
+    ASSERT_OK(Put("bar", "v2"));                         // Goes to new log file
+
+    Reopen(&options);
+    ASSERT_EQ("v1", Get("foo"));
+    ASSERT_EQ("v2", Get("bar"));
+    ASSERT_EQ(std::string(10000000, 'x'), Get("big1"));
+    ASSERT_EQ(std::string(1000, 'y'), Get("big2"));
+  } while (ChangeOptions());
+}
+
+static std::string Key(int i) {
+  char buf[100];
+  snprintf(buf, sizeof(buf), "key%06d", i);
+  return std::string(buf);
+}
+
+TEST(DBTest, MinorCompactionsHappen) {
+  Options options = CurrentOptions();
+  options.write_buffer_size = 10000;
+  Reopen(&options);
+
+  const int N = 500;
+
+  int starting_num_tables = TotalTableFiles();
+  for (int i = 0; i < N; i++) {
+    ASSERT_OK(Put(Key(i), Key(i) + std::string(1000, 'v')));
+  }
+  int ending_num_tables = TotalTableFiles();
+  ASSERT_GT(ending_num_tables, starting_num_tables);
+
+  for (int i = 0; i < N; i++) {
+    ASSERT_EQ(Key(i) + std::string(1000, 'v'), Get(Key(i)));
+  }
+
+  Reopen();
+
+  for (int i = 0; i < N; i++) {
+    ASSERT_EQ(Key(i) + std::string(1000, 'v'), Get(Key(i)));
+  }
+}
+
+TEST(DBTest, RecoverWithLargeLog) {
+  {
+    Options options = CurrentOptions();
+    Reopen(&options);
+    ASSERT_OK(Put("big1", std::string(200000, '1')));
+    ASSERT_OK(Put("big2", std::string(200000, '2')));
+    ASSERT_OK(Put("small3", std::string(10, '3')));
+    ASSERT_OK(Put("small4", std::string(10, '4')));
+    ASSERT_EQ(NumTableFilesAtLevel(0), 0);
+  }
+
+  // Make sure that if we re-open with a small write buffer size that
+  // we flush table files in the middle of a large log file.
+  Options options = CurrentOptions();
+  options.write_buffer_size = 100000;
+  Reopen(&options);
+  ASSERT_EQ(NumTableFilesAtLevel(0), 3);
+  ASSERT_EQ(std::string(200000, '1'), Get("big1"));
+  ASSERT_EQ(std::string(200000, '2'), Get("big2"));
+  ASSERT_EQ(std::string(10, '3'), Get("small3"));
+  ASSERT_EQ(std::string(10, '4'), Get("small4"));
+  ASSERT_GT(NumTableFilesAtLevel(0), 1);
+}
+
+TEST(DBTest, CompactionsGenerateMultipleFiles) {
+  Options options = CurrentOptions();
+  options.write_buffer_size = 100000000;        // Large write buffer
+  Reopen(&options);
+
+  Random rnd(301);
+
+  // Write 8MB (80 values, each 100K)
+  ASSERT_EQ(NumTableFilesAtLevel(0), 0);
+  std::vector<std::string> values;
+  for (int i = 0; i < 80; i++) {
+    values.push_back(RandomString(&rnd, 100000));
+    ASSERT_OK(Put(Key(i), values[i]));
+  }
+
+  // Reopening moves updates to level-0
+  Reopen(&options);
+  dbfull()->TEST_CompactRange(0, NULL, NULL);
+
+  ASSERT_EQ(NumTableFilesAtLevel(0), 0);
+  ASSERT_GT(NumTableFilesAtLevel(1), 1);
+  for (int i = 0; i < 80; i++) {
+    ASSERT_EQ(Get(Key(i)), values[i]);
+  }
+}
+
+TEST(DBTest, RepeatedWritesToSameKey) {
+  Options options = CurrentOptions();
+  options.env = env_;
+  options.write_buffer_size = 100000;  // Small write buffer
+  Reopen(&options);
+
+  // We must have at most one file per level except for level-0,
+  // which may have up to kL0_StopWritesTrigger files.
+  const int kMaxFiles = config::kNumLevels + config::kL0_StopWritesTrigger;
+
+  Random rnd(301);
+  std::string value = RandomString(&rnd, 2 * options.write_buffer_size);
+  for (int i = 0; i < 5 * kMaxFiles; i++) {
+    Put("key", value);
+    ASSERT_LE(TotalTableFiles(), kMaxFiles);
+    fprintf(stderr, "after %d: %d files\n", int(i+1), TotalTableFiles());
+  }
+}
+
+TEST(DBTest, SparseMerge) {
+  Options options = CurrentOptions();
+  options.compression = kNoCompression;
+  Reopen(&options);
+
+  FillLevels("A", "Z");
+
+  // Suppose there is:
+  //    small amount of data with prefix A
+  //    large amount of data with prefix B
+  //    small amount of data with prefix C
+  // and that recent updates have made small changes to all three prefixes.
+  // Check that we do not do a compaction that merges all of B in one shot.
+  const std::string value(1000, 'x');
+  Put("A", "va");
+  // Write approximately 100MB of "B" values
+  for (int i = 0; i < 100000; i++) {
+    char key[100];
+    snprintf(key, sizeof(key), "B%010d", i);
+    Put(key, value);
+  }
+  Put("C", "vc");
+  dbfull()->TEST_CompactMemTable();
+  dbfull()->TEST_CompactRange(0, NULL, NULL);
+
+  // Make sparse update
+  Put("A",    "va2");
+  Put("B100", "bvalue2");
+  Put("C",    "vc2");
+  dbfull()->TEST_CompactMemTable();
+
+  // Compactions should not cause us to create a situation where
+  // a file overlaps too much data at the next level.
+  ASSERT_LE(dbfull()->TEST_MaxNextLevelOverlappingBytes(), 20*1048576);
+  dbfull()->TEST_CompactRange(0, NULL, NULL);
+  ASSERT_LE(dbfull()->TEST_MaxNextLevelOverlappingBytes(), 20*1048576);
+  dbfull()->TEST_CompactRange(1, NULL, NULL);
+  ASSERT_LE(dbfull()->TEST_MaxNextLevelOverlappingBytes(), 20*1048576);
+}
+
+static bool Between(uint64_t val, uint64_t low, uint64_t high) {
+  bool result = (val >= low) && (val <= high);
+  if (!result) {
+    fprintf(stderr, "Value %llu is not in range [%llu, %llu]\n",
+            (unsigned long long)(val),
+            (unsigned long long)(low),
+            (unsigned long long)(high));
+  }
+  return result;
+}
+
+TEST(DBTest, ApproximateSizes) {
+  do {
+    Options options = CurrentOptions();
+    options.write_buffer_size = 100000000;        // Large write buffer
+    options.compression = kNoCompression;
+    DestroyAndReopen();
+
+    ASSERT_TRUE(Between(Size("", "xyz"), 0, 0));
+    Reopen(&options);
+    ASSERT_TRUE(Between(Size("", "xyz"), 0, 0));
+
+    // Write 8MB (80 values, each 100K)
+    ASSERT_EQ(NumTableFilesAtLevel(0), 0);
+    const int N = 80;
+    static const int S1 = 100000;
+    static const int S2 = 105000;  // Allow some expansion from metadata
+    Random rnd(301);
+    for (int i = 0; i < N; i++) {
+      ASSERT_OK(Put(Key(i), RandomString(&rnd, S1)));
+    }
+
+    // 0 because GetApproximateSizes() does not account for memtable space
+    ASSERT_TRUE(Between(Size("", Key(50)), 0, 0));
+
+    if (options.reuse_logs) {
+      // Recovery will reuse memtable, and GetApproximateSizes() does not
+      // account for memtable usage;
+      Reopen(&options);
+      ASSERT_TRUE(Between(Size("", Key(50)), 0, 0));
+      continue;
+    }
+
+    // Check sizes across recovery by reopening a few times
+    for (int run = 0; run < 3; run++) {
+      Reopen(&options);
+
+      for (int compact_start = 0; compact_start < N; compact_start += 10) {
+        for (int i = 0; i < N; i += 10) {
+          ASSERT_TRUE(Between(Size("", Key(i)), S1*i, S2*i));
+          ASSERT_TRUE(Between(Size("", Key(i)+".suffix"), S1*(i+1), S2*(i+1)));
+          ASSERT_TRUE(Between(Size(Key(i), Key(i+10)), S1*10, S2*10));
+        }
+        ASSERT_TRUE(Between(Size("", Key(50)), S1*50, S2*50));
+        ASSERT_TRUE(Between(Size("", Key(50)+".suffix"), S1*50, S2*50));
+
+        std::string cstart_str = Key(compact_start);
+        std::string cend_str = Key(compact_start + 9);
+        Slice cstart = cstart_str;
+        Slice cend = cend_str;
+        dbfull()->TEST_CompactRange(0, &cstart, &cend);
+      }
+
+      ASSERT_EQ(NumTableFilesAtLevel(0), 0);
+      ASSERT_GT(NumTableFilesAtLevel(1), 0);
+    }
+  } while (ChangeOptions());
+}
+
+TEST(DBTest, ApproximateSizes_MixOfSmallAndLarge) {
+  do {
+    Options options = CurrentOptions();
+    options.compression = kNoCompression;
+    Reopen();
+
+    Random rnd(301);
+    std::string big1 = RandomString(&rnd, 100000);
+    ASSERT_OK(Put(Key(0), RandomString(&rnd, 10000)));
+    ASSERT_OK(Put(Key(1), RandomString(&rnd, 10000)));
+    ASSERT_OK(Put(Key(2), big1));
+    ASSERT_OK(Put(Key(3), RandomString(&rnd, 10000)));
+    ASSERT_OK(Put(Key(4), big1));
+    ASSERT_OK(Put(Key(5), RandomString(&rnd, 10000)));
+    ASSERT_OK(Put(Key(6), RandomString(&rnd, 300000)));
+    ASSERT_OK(Put(Key(7), RandomString(&rnd, 10000)));
+
+    if (options.reuse_logs) {
+      // Need to force a memtable compaction since recovery does not do so.
+      ASSERT_OK(dbfull()->TEST_CompactMemTable());
+    }
+
+    // Check sizes across recovery by reopening a few times
+    for (int run = 0; run < 3; run++) {
+      Reopen(&options);
+
+      ASSERT_TRUE(Between(Size("", Key(0)), 0, 0));
+      ASSERT_TRUE(Between(Size("", Key(1)), 10000, 11000));
+      ASSERT_TRUE(Between(Size("", Key(2)), 20000, 21000));
+      ASSERT_TRUE(Between(Size("", Key(3)), 120000, 121000));
+      ASSERT_TRUE(Between(Size("", Key(4)), 130000, 131000));
+      ASSERT_TRUE(Between(Size("", Key(5)), 230000, 231000));
+      ASSERT_TRUE(Between(Size("", Key(6)), 240000, 241000));
+      ASSERT_TRUE(Between(Size("", Key(7)), 540000, 541000));
+      ASSERT_TRUE(Between(Size("", Key(8)), 550000, 560000));
+
+      ASSERT_TRUE(Between(Size(Key(3), Key(5)), 110000, 111000));
+
+      dbfull()->TEST_CompactRange(0, NULL, NULL);
+    }
+  } while (ChangeOptions());
+}
+
+TEST(DBTest, IteratorPinsRef) {
+  Put("foo", "hello");
+
+  // Get iterator that will yield the current contents of the DB.
+  Iterator* iter = db_->NewIterator(ReadOptions());
+
+  // Write to force compactions
+  Put("foo", "newvalue1");
+  for (int i = 0; i < 100; i++) {
+    ASSERT_OK(Put(Key(i), Key(i) + std::string(100000, 'v'))); // 100K values
+  }
+  Put("foo", "newvalue2");
+
+  iter->SeekToFirst();
+  ASSERT_TRUE(iter->Valid());
+  ASSERT_EQ("foo", iter->key().ToString());
+  ASSERT_EQ("hello", iter->value().ToString());
+  iter->Next();
+  ASSERT_TRUE(!iter->Valid());
+  delete iter;
+}
+
+TEST(DBTest, Snapshot) {
+  do {
+    Put("foo", "v1");
+    const Snapshot* s1 = db_->GetSnapshot();
+    Put("foo", "v2");
+    const Snapshot* s2 = db_->GetSnapshot();
+    Put("foo", "v3");
+    const Snapshot* s3 = db_->GetSnapshot();
+
+    Put("foo", "v4");
+    ASSERT_EQ("v1", Get("foo", s1));
+    ASSERT_EQ("v2", Get("foo", s2));
+    ASSERT_EQ("v3", Get("foo", s3));
+    ASSERT_EQ("v4", Get("foo"));
+
+    db_->ReleaseSnapshot(s3);
+    ASSERT_EQ("v1", Get("foo", s1));
+    ASSERT_EQ("v2", Get("foo", s2));
+    ASSERT_EQ("v4", Get("foo"));
+
+    db_->ReleaseSnapshot(s1);
+    ASSERT_EQ("v2", Get("foo", s2));
+    ASSERT_EQ("v4", Get("foo"));
+
+    db_->ReleaseSnapshot(s2);
+    ASSERT_EQ("v4", Get("foo"));
+  } while (ChangeOptions());
+}
+
+TEST(DBTest, HiddenValuesAreRemoved) {
+  do {
+    Random rnd(301);
+    FillLevels("a", "z");
+
+    std::string big = RandomString(&rnd, 50000);
+    Put("foo", big);
+    Put("pastfoo", "v");
+    const Snapshot* snapshot = db_->GetSnapshot();
+    Put("foo", "tiny");
+    Put("pastfoo2", "v2");        // Advance sequence number one more
+
+    ASSERT_OK(dbfull()->TEST_CompactMemTable());
+    ASSERT_GT(NumTableFilesAtLevel(0), 0);
+
+    ASSERT_EQ(big, Get("foo", snapshot));
+    ASSERT_TRUE(Between(Size("", "pastfoo"), 50000, 60000));
+    db_->ReleaseSnapshot(snapshot);
+    ASSERT_EQ(AllEntriesFor("foo"), "[ tiny, " + big + " ]");
+    Slice x("x");
+    dbfull()->TEST_CompactRange(0, NULL, &x);
+    ASSERT_EQ(AllEntriesFor("foo"), "[ tiny ]");
+    ASSERT_EQ(NumTableFilesAtLevel(0), 0);
+    ASSERT_GE(NumTableFilesAtLevel(1), 1);
+    dbfull()->TEST_CompactRange(1, NULL, &x);
+    ASSERT_EQ(AllEntriesFor("foo"), "[ tiny ]");
+
+    ASSERT_TRUE(Between(Size("", "pastfoo"), 0, 1000));
+  } while (ChangeOptions());
+}
+
+TEST(DBTest, DeletionMarkers1) {
+  Put("foo", "v1");
+  ASSERT_OK(dbfull()->TEST_CompactMemTable());
+  const int last = config::kMaxMemCompactLevel;
+  ASSERT_EQ(NumTableFilesAtLevel(last), 1);   // foo => v1 is now in last level
+
+  // Place a table at level last-1 to prevent merging with preceding mutation
+  Put("a", "begin");
+  Put("z", "end");
+  dbfull()->TEST_CompactMemTable();
+  ASSERT_EQ(NumTableFilesAtLevel(last), 1);
+  ASSERT_EQ(NumTableFilesAtLevel(last-1), 1);
+
+  Delete("foo");
+  Put("foo", "v2");
+  ASSERT_EQ(AllEntriesFor("foo"), "[ v2, DEL, v1 ]");
+  ASSERT_OK(dbfull()->TEST_CompactMemTable());  // Moves to level last-2
+  ASSERT_EQ(AllEntriesFor("foo"), "[ v2, DEL, v1 ]");
+  Slice z("z");
+  dbfull()->TEST_CompactRange(last-2, NULL, &z);
+  // DEL eliminated, but v1 remains because we aren't compacting that level
+  // (DEL can be eliminated because v2 hides v1).
+  ASSERT_EQ(AllEntriesFor("foo"), "[ v2, v1 ]");
+  dbfull()->TEST_CompactRange(last-1, NULL, NULL);
+  // Merging last-1 w/ last, so we are the base level for "foo", so
+  // DEL is removed.  (as is v1).
+  ASSERT_EQ(AllEntriesFor("foo"), "[ v2 ]");
+}
+
+TEST(DBTest, DeletionMarkers2) {
+  Put("foo", "v1");
+  ASSERT_OK(dbfull()->TEST_CompactMemTable());
+  const int last = config::kMaxMemCompactLevel;
+  ASSERT_EQ(NumTableFilesAtLevel(last), 1);   // foo => v1 is now in last level
+
+  // Place a table at level last-1 to prevent merging with preceding mutation
+  Put("a", "begin");
+  Put("z", "end");
+  dbfull()->TEST_CompactMemTable();
+  ASSERT_EQ(NumTableFilesAtLevel(last), 1);
+  ASSERT_EQ(NumTableFilesAtLevel(last-1), 1);
+
+  Delete("foo");
+  ASSERT_EQ(AllEntriesFor("foo"), "[ DEL, v1 ]");
+  ASSERT_OK(dbfull()->TEST_CompactMemTable());  // Moves to level last-2
+  ASSERT_EQ(AllEntriesFor("foo"), "[ DEL, v1 ]");
+  dbfull()->TEST_CompactRange(last-2, NULL, NULL);
+  // DEL kept: "last" file overlaps
+  ASSERT_EQ(AllEntriesFor("foo"), "[ DEL, v1 ]");
+  dbfull()->TEST_CompactRange(last-1, NULL, NULL);
+  // Merging last-1 w/ last, so we are the base level for "foo", so
+  // DEL is removed.  (as is v1).
+  ASSERT_EQ(AllEntriesFor("foo"), "[ ]");
+}
+
+TEST(DBTest, OverlapInLevel0) {
+  do {
+    ASSERT_EQ(config::kMaxMemCompactLevel, 2) << "Fix test to match config";
+
+    // Fill levels 1 and 2 to disable the pushing of new memtables to levels > 0.
+    ASSERT_OK(Put("100", "v100"));
+    ASSERT_OK(Put("999", "v999"));
+    dbfull()->TEST_CompactMemTable();
+    ASSERT_OK(Delete("100"));
+    ASSERT_OK(Delete("999"));
+    dbfull()->TEST_CompactMemTable();
+    ASSERT_EQ("0,1,1", FilesPerLevel());
+
+    // Make files spanning the following ranges in level-0:
+    //  files[0]  200 .. 900
+    //  files[1]  300 .. 500
+    // Note that files are sorted by smallest key.
+    ASSERT_OK(Put("300", "v300"));
+    ASSERT_OK(Put("500", "v500"));
+    dbfull()->TEST_CompactMemTable();
+    ASSERT_OK(Put("200", "v200"));
+    ASSERT_OK(Put("600", "v600"));
+    ASSERT_OK(Put("900", "v900"));
+    dbfull()->TEST_CompactMemTable();
+    ASSERT_EQ("2,1,1", FilesPerLevel());
+
+    // Compact away the placeholder files we created initially
+    dbfull()->TEST_CompactRange(1, NULL, NULL);
+    dbfull()->TEST_CompactRange(2, NULL, NULL);
+    ASSERT_EQ("2", FilesPerLevel());
+
+    // Do a memtable compaction.  Before bug-fix, the compaction would
+    // not detect the overlap with level-0 files and would incorrectly place
+    // the deletion in a deeper level.
+    ASSERT_OK(Delete("600"));
+    dbfull()->TEST_CompactMemTable();
+    ASSERT_EQ("3", FilesPerLevel());
+    ASSERT_EQ("NOT_FOUND", Get("600"));
+  } while (ChangeOptions());
+}
+
+TEST(DBTest, L0_CompactionBug_Issue44_a) {
+  Reopen();
+  ASSERT_OK(Put("b", "v"));
+  Reopen();
+  ASSERT_OK(Delete("b"));
+  ASSERT_OK(Delete("a"));
+  Reopen();
+  ASSERT_OK(Delete("a"));
+  Reopen();
+  ASSERT_OK(Put("a", "v"));
+  Reopen();
+  Reopen();
+  ASSERT_EQ("(a->v)", Contents());
+  DelayMilliseconds(1000);  // Wait for compaction to finish
+  ASSERT_EQ("(a->v)", Contents());
+}
+
+TEST(DBTest, L0_CompactionBug_Issue44_b) {
+  Reopen();
+  Put("","");
+  Reopen();
+  Delete("e");
+  Put("","");
+  Reopen();
+  Put("c", "cv");
+  Reopen();
+  Put("","");
+  Reopen();
+  Put("","");
+  DelayMilliseconds(1000);  // Wait for compaction to finish
+  Reopen();
+  Put("d","dv");
+  Reopen();
+  Put("","");
+  Reopen();
+  Delete("d");
+  Delete("b");
+  Reopen();
+  ASSERT_EQ("(->)(c->cv)", Contents());
+  DelayMilliseconds(1000);  // Wait for compaction to finish
+  ASSERT_EQ("(->)(c->cv)", Contents());
+}
+
+TEST(DBTest, ComparatorCheck) {
+  class NewComparator : public Comparator {
+   public:
+    virtual const char* Name() const { return "leveldb.NewComparator"; }
+    virtual int Compare(const Slice& a, const Slice& b) const {
+      return BytewiseComparator()->Compare(a, b);
+    }
+    virtual void FindShortestSeparator(std::string* s, const Slice& l) const {
+      BytewiseComparator()->FindShortestSeparator(s, l);
+    }
+    virtual void FindShortSuccessor(std::string* key) const {
+      BytewiseComparator()->FindShortSuccessor(key);
+    }
+  };
+  NewComparator cmp;
+  Options new_options = CurrentOptions();
+  new_options.comparator = &cmp;
+  Status s = TryReopen(&new_options);
+  ASSERT_TRUE(!s.ok());
+  ASSERT_TRUE(s.ToString().find("comparator") != std::string::npos)
+      << s.ToString();
+}
+
+TEST(DBTest, CustomComparator) {
+  class NumberComparator : public Comparator {
+   public:
+    virtual const char* Name() const { return "test.NumberComparator"; }
+    virtual int Compare(const Slice& a, const Slice& b) const {
+      return ToNumber(a) - ToNumber(b);
+    }
+    virtual void FindShortestSeparator(std::string* s, const Slice& l) const {
+      ToNumber(*s);     // Check format
+      ToNumber(l);      // Check format
+    }
+    virtual void FindShortSuccessor(std::string* key) const {
+      ToNumber(*key);   // Check format
+    }
+   private:
+    static int ToNumber(const Slice& x) {
+      // Check that there are no extra characters.
+      ASSERT_TRUE(x.size() >= 2 && x[0] == '[' && x[x.size()-1] == ']')
+          << EscapeString(x);
+      int val;
+      char ignored;
+      ASSERT_TRUE(sscanf(x.ToString().c_str(), "[%i]%c", &val, &ignored) == 1)
+          << EscapeString(x);
+      return val;
+    }
+  };
+  NumberComparator cmp;
+  Options new_options = CurrentOptions();
+  new_options.create_if_missing = true;
+  new_options.comparator = &cmp;
+  new_options.filter_policy = NULL;     // Cannot use bloom filters
+  new_options.write_buffer_size = 1000;  // Compact more often
+  DestroyAndReopen(&new_options);
+  ASSERT_OK(Put("[10]", "ten"));
+  ASSERT_OK(Put("[0x14]", "twenty"));
+  for (int i = 0; i < 2; i++) {
+    ASSERT_EQ("ten", Get("[10]"));
+    ASSERT_EQ("ten", Get("[0xa]"));
+    ASSERT_EQ("twenty", Get("[20]"));
+    ASSERT_EQ("twenty", Get("[0x14]"));
+    ASSERT_EQ("NOT_FOUND", Get("[15]"));
+    ASSERT_EQ("NOT_FOUND", Get("[0xf]"));
+    Compact("[0]", "[9999]");
+  }
+
+  for (int run = 0; run < 2; run++) {
+    for (int i = 0; i < 1000; i++) {
+      char buf[100];
+      snprintf(buf, sizeof(buf), "[%d]", i*10);
+      ASSERT_OK(Put(buf, buf));
+    }
+    Compact("[0]", "[1000000]");
+  }
+}
+
+TEST(DBTest, ManualCompaction) {
+  ASSERT_EQ(config::kMaxMemCompactLevel, 2)
+      << "Need to update this test to match kMaxMemCompactLevel";
+
+  MakeTables(3, "p", "q");
+  ASSERT_EQ("1,1,1", FilesPerLevel());
+
+  // Compaction range falls before files
+  Compact("", "c");
+  ASSERT_EQ("1,1,1", FilesPerLevel());
+
+  // Compaction range falls after files
+  Compact("r", "z");
+  ASSERT_EQ("1,1,1", FilesPerLevel());
+
+  // Compaction range overlaps files
+  Compact("p1", "p9");
+  ASSERT_EQ("0,0,1", FilesPerLevel());
+
+  // Populate a different range
+  MakeTables(3, "c", "e");
+  ASSERT_EQ("1,1,2", FilesPerLevel());
+
+  // Compact just the new range
+  Compact("b", "f");
+  ASSERT_EQ("0,0,2", FilesPerLevel());
+
+  // Compact all
+  MakeTables(1, "a", "z");
+  ASSERT_EQ("0,1,2", FilesPerLevel());
+  db_->CompactRange(NULL, NULL);
+  ASSERT_EQ("0,0,1", FilesPerLevel());
+}
+
+TEST(DBTest, DBOpen_Options) {
+  std::string dbname = test::TmpDir() + "/db_options_test";
+  DestroyDB(dbname, Options());
+
+  // Does not exist, and create_if_missing == false: error
+  DB* db = NULL;
+  Options opts;
+  opts.create_if_missing = false;
+  Status s = DB::Open(opts, dbname, &db);
+  ASSERT_TRUE(strstr(s.ToString().c_str(), "does not exist") != NULL);
+  ASSERT_TRUE(db == NULL);
+
+  // Does not exist, and create_if_missing == true: OK
+  opts.create_if_missing = true;
+  s = DB::Open(opts, dbname, &db);
+  ASSERT_OK(s);
+  ASSERT_TRUE(db != NULL);
+
+  delete db;
+  db = NULL;
+
+  // Does exist, and error_if_exists == true: error
+  opts.create_if_missing = false;
+  opts.error_if_exists = true;
+  s = DB::Open(opts, dbname, &db);
+  ASSERT_TRUE(strstr(s.ToString().c_str(), "exists") != NULL);
+  ASSERT_TRUE(db == NULL);
+
+  // Does exist, and error_if_exists == false: OK
+  opts.create_if_missing = true;
+  opts.error_if_exists = false;
+  s = DB::Open(opts, dbname, &db);
+  ASSERT_OK(s);
+  ASSERT_TRUE(db != NULL);
+
+  delete db;
+  db = NULL;
+}
+
+TEST(DBTest, Locking) {
+  DB* db2 = NULL;
+  Status s = DB::Open(CurrentOptions(), dbname_, &db2);
+  ASSERT_TRUE(!s.ok()) << "Locking did not prevent re-opening db";
+}
+
+// Check that number of files does not grow when we are out of space
+TEST(DBTest, NoSpace) {
+  Options options = CurrentOptions();
+  options.env = env_;
+  Reopen(&options);
+
+  ASSERT_OK(Put("foo", "v1"));
+  ASSERT_EQ("v1", Get("foo"));
+  Compact("a", "z");
+  const int num_files = CountFiles();
+  env_->no_space_.Release_Store(env_);   // Force out-of-space errors
+  for (int i = 0; i < 10; i++) {
+    for (int level = 0; level < config::kNumLevels-1; level++) {
+      dbfull()->TEST_CompactRange(level, NULL, NULL);
+    }
+  }
+  env_->no_space_.Release_Store(NULL);
+  ASSERT_LT(CountFiles(), num_files + 3);
+}
+
+TEST(DBTest, NonWritableFileSystem) {
+  Options options = CurrentOptions();
+  options.write_buffer_size = 1000;
+  options.env = env_;
+  Reopen(&options);
+  ASSERT_OK(Put("foo", "v1"));
+  env_->non_writable_.Release_Store(env_);  // Force errors for new files
+  std::string big(100000, 'x');
+  int errors = 0;
+  for (int i = 0; i < 20; i++) {
+    fprintf(stderr, "iter %d; errors %d\n", i, errors);
+    if (!Put("foo", big).ok()) {
+      errors++;
+      DelayMilliseconds(100);
+    }
+  }
+  ASSERT_GT(errors, 0);
+  env_->non_writable_.Release_Store(NULL);
+}
+
+TEST(DBTest, WriteSyncError) {
+  // Check that log sync errors cause the DB to disallow future writes.
+
+  // (a) Cause log sync calls to fail
+  Options options = CurrentOptions();
+  options.env = env_;
+  Reopen(&options);
+  env_->data_sync_error_.Release_Store(env_);
+
+  // (b) Normal write should succeed
+  WriteOptions w;
+  ASSERT_OK(db_->Put(w, "k1", "v1"));
+  ASSERT_EQ("v1", Get("k1"));
+
+  // (c) Do a sync write; should fail
+  w.sync = true;
+  ASSERT_TRUE(!db_->Put(w, "k2", "v2").ok());
+  ASSERT_EQ("v1", Get("k1"));
+  ASSERT_EQ("NOT_FOUND", Get("k2"));
+
+  // (d) make sync behave normally
+  env_->data_sync_error_.Release_Store(NULL);
+
+  // (e) Do a non-sync write; should fail
+  w.sync = false;
+  ASSERT_TRUE(!db_->Put(w, "k3", "v3").ok());
+  ASSERT_EQ("v1", Get("k1"));
+  ASSERT_EQ("NOT_FOUND", Get("k2"));
+  ASSERT_EQ("NOT_FOUND", Get("k3"));
+}
+
+TEST(DBTest, ManifestWriteError) {
+  // Test for the following problem:
+  // (a) Compaction produces file F
+  // (b) Log record containing F is written to MANIFEST file, but Sync() fails
+  // (c) GC deletes F
+  // (d) After reopening DB, reads fail since deleted F is named in log record
+
+  // We iterate twice.  In the second iteration, everything is the
+  // same except the log record never makes it to the MANIFEST file.
+  for (int iter = 0; iter < 2; iter++) {
+    port::AtomicPointer* error_type = (iter == 0)
+        ? &env_->manifest_sync_error_
+        : &env_->manifest_write_error_;
+
+    // Insert foo=>bar mapping
+    Options options = CurrentOptions();
+    options.env = env_;
+    options.create_if_missing = true;
+    options.error_if_exists = false;
+    DestroyAndReopen(&options);
+    ASSERT_OK(Put("foo", "bar"));
+    ASSERT_EQ("bar", Get("foo"));
+
+    // Memtable compaction (will succeed)
+    dbfull()->TEST_CompactMemTable();
+    ASSERT_EQ("bar", Get("foo"));
+    const int last = config::kMaxMemCompactLevel;
+    ASSERT_EQ(NumTableFilesAtLevel(last), 1);   // foo=>bar is now in last level
+
+    // Merging compaction (will fail)
+    error_type->Release_Store(env_);
+    dbfull()->TEST_CompactRange(last, NULL, NULL);  // Should fail
+    ASSERT_EQ("bar", Get("foo"));
+
+    // Recovery: should not lose data
+    error_type->Release_Store(NULL);
+    Reopen(&options);
+    ASSERT_EQ("bar", Get("foo"));
+  }
+}
+
+TEST(DBTest, MissingSSTFile) {
+  ASSERT_OK(Put("foo", "bar"));
+  ASSERT_EQ("bar", Get("foo"));
+
+  // Dump the memtable to disk.
+  dbfull()->TEST_CompactMemTable();
+  ASSERT_EQ("bar", Get("foo"));
+
+  Close();
+  ASSERT_TRUE(DeleteAnSSTFile());
+  Options options = CurrentOptions();
+  options.paranoid_checks = true;
+  Status s = TryReopen(&options);
+  ASSERT_TRUE(!s.ok());
+  ASSERT_TRUE(s.ToString().find("issing") != std::string::npos)
+      << s.ToString();
+}
+
+TEST(DBTest, StillReadSST) {
+  ASSERT_OK(Put("foo", "bar"));
+  ASSERT_EQ("bar", Get("foo"));
+
+  // Dump the memtable to disk.
+  dbfull()->TEST_CompactMemTable();
+  ASSERT_EQ("bar", Get("foo"));
+  Close();
+  ASSERT_GT(RenameLDBToSST(), 0);
+  Options options = CurrentOptions();
+  options.paranoid_checks = true;
+  Status s = TryReopen(&options);
+  ASSERT_TRUE(s.ok());
+  ASSERT_EQ("bar", Get("foo"));
+}
+
+TEST(DBTest, FilesDeletedAfterCompaction) {
+  ASSERT_OK(Put("foo", "v2"));
+  Compact("a", "z");
+  const int num_files = CountFiles();
+  for (int i = 0; i < 10; i++) {
+    ASSERT_OK(Put("foo", "v2"));
+    Compact("a", "z");
+  }
+  ASSERT_EQ(CountFiles(), num_files);
+}
+
+TEST(DBTest, BloomFilter) {
+  env_->count_random_reads_ = true;
+  Options options = CurrentOptions();
+  options.env = env_;
+  options.block_cache = NewLRUCache(0);  // Prevent cache hits
+  options.filter_policy = NewBloomFilterPolicy(10);
+  Reopen(&options);
+
+  // Populate multiple layers
+  const int N = 10000;
+  for (int i = 0; i < N; i++) {
+    ASSERT_OK(Put(Key(i), Key(i)));
+  }
+  Compact("a", "z");
+  for (int i = 0; i < N; i += 100) {
+    ASSERT_OK(Put(Key(i), Key(i)));
+  }
+  dbfull()->TEST_CompactMemTable();
+
+  // Prevent auto compactions triggered by seeks
+  env_->delay_data_sync_.Release_Store(env_);
+
+  // Lookup present keys.  Should rarely read from small sstable.
+  env_->random_read_counter_.Reset();
+  for (int i = 0; i < N; i++) {
+    ASSERT_EQ(Key(i), Get(Key(i)));
+  }
+  int reads = env_->random_read_counter_.Read();
+  fprintf(stderr, "%d present => %d reads\n", N, reads);
+  ASSERT_GE(reads, N);
+  ASSERT_LE(reads, N + 2*N/100);
+
+  // Lookup present keys.  Should rarely read from either sstable.
+  env_->random_read_counter_.Reset();
+  for (int i = 0; i < N; i++) {
+    ASSERT_EQ("NOT_FOUND", Get(Key(i) + ".missing"));
+  }
+  reads = env_->random_read_counter_.Read();
+  fprintf(stderr, "%d missing => %d reads\n", N, reads);
+  ASSERT_LE(reads, 3*N/100);
+
+  env_->delay_data_sync_.Release_Store(NULL);
+  Close();
+  delete options.block_cache;
+  delete options.filter_policy;
+}
+
+// Multi-threaded test:
+namespace {
+
+static const int kNumThreads = 4;
+static const int kTestSeconds = 10;
+static const int kNumKeys = 1000;
+
+struct MTState {
+  DBTest* test;
+  port::AtomicPointer stop;
+  port::AtomicPointer counter[kNumThreads];
+  port::AtomicPointer thread_done[kNumThreads];
+};
+
+struct MTThread {
+  MTState* state;
+  int id;
+};
+
+static void MTThreadBody(void* arg) {
+  MTThread* t = reinterpret_cast<MTThread*>(arg);
+  int id = t->id;
+  DB* db = t->state->test->db_;
+  uintptr_t counter = 0;
+  fprintf(stderr, "... starting thread %d\n", id);
+  Random rnd(1000 + id);
+  std::string value;
+  char valbuf[1500];
+  while (t->state->stop.Acquire_Load() == NULL) {
+    t->state->counter[id].Release_Store(reinterpret_cast<void*>(counter));
+
+    int key = rnd.Uniform(kNumKeys);
+    char keybuf[20];
+    snprintf(keybuf, sizeof(keybuf), "%016d", key);
+
+    if (rnd.OneIn(2)) {
+      // Write values of the form <key, my id, counter>.
+      // We add some padding for force compactions.
+      snprintf(valbuf, sizeof(valbuf), "%d.%d.%-1000d",
+               key, id, static_cast<int>(counter));
+      ASSERT_OK(db->Put(WriteOptions(), Slice(keybuf), Slice(valbuf)));
+    } else {
+      // Read a value and verify that it matches the pattern written above.
+      Status s = db->Get(ReadOptions(), Slice(keybuf), &value);
+      if (s.IsNotFound()) {
+        // Key has not yet been written
+      } else {
+        // Check that the writer thread counter is >= the counter in the value
+        ASSERT_OK(s);
+        int k, w, c;
+        ASSERT_EQ(3, sscanf(value.c_str(), "%d.%d.%d", &k, &w, &c)) << value;
+        ASSERT_EQ(k, key);
+        ASSERT_GE(w, 0);
+        ASSERT_LT(w, kNumThreads);
+        ASSERT_LE(static_cast<uintptr_t>(c), reinterpret_cast<uintptr_t>(
+            t->state->counter[w].Acquire_Load()));
+      }
+    }
+    counter++;
+  }
+  t->state->thread_done[id].Release_Store(t);
+  fprintf(stderr, "... stopping thread %d after %d ops\n", id, int(counter));
+}
+
+}  // namespace
+
+TEST(DBTest, MultiThreaded) {
+  do {
+    // Initialize state
+    MTState mt;
+    mt.test = this;
+    mt.stop.Release_Store(0);
+    for (int id = 0; id < kNumThreads; id++) {
+      mt.counter[id].Release_Store(0);
+      mt.thread_done[id].Release_Store(0);
+    }
+
+    // Start threads
+    MTThread thread[kNumThreads];
+    for (int id = 0; id < kNumThreads; id++) {
+      thread[id].state = &mt;
+      thread[id].id = id;
+      env_->StartThread(MTThreadBody, &thread[id]);
+    }
+
+    // Let them run for a while
+    DelayMilliseconds(kTestSeconds * 1000);
+
+    // Stop the threads and wait for them to finish
+    mt.stop.Release_Store(&mt);
+    for (int id = 0; id < kNumThreads; id++) {
+      while (mt.thread_done[id].Acquire_Load() == NULL) {
+        DelayMilliseconds(100);
+      }
+    }
+  } while (ChangeOptions());
+}
+
+namespace {
+typedef std::map<std::string, std::string> KVMap;
+}
+
+class ModelDB: public DB {
+ public:
+  class ModelSnapshot : public Snapshot {
+   public:
+    KVMap map_;
+  };
+
+  explicit ModelDB(const Options& options): options_(options) { }
+  ~ModelDB() { }
+  virtual Status Put(const WriteOptions& o, const Slice& k, const Slice& v) {
+    return DB::Put(o, k, v);
+  }
+  virtual Status Delete(const WriteOptions& o, const Slice& key) {
+    return DB::Delete(o, key);
+  }
+  virtual Status Get(const ReadOptions& options,
+                     const Slice& key, std::string* value) {
+    assert(false);      // Not implemented
+    return Status::NotFound(key);
+  }
+  virtual Iterator* NewIterator(const ReadOptions& options) {
+    if (options.snapshot == NULL) {
+      KVMap* saved = new KVMap;
+      *saved = map_;
+      return new ModelIter(saved, true);
+    } else {
+      const KVMap* snapshot_state =
+          &(reinterpret_cast<const ModelSnapshot*>(options.snapshot)->map_);
+      return new ModelIter(snapshot_state, false);
+    }
+  }
+  virtual const Snapshot* GetSnapshot() {
+    ModelSnapshot* snapshot = new ModelSnapshot;
+    snapshot->map_ = map_;
+    return snapshot;
+  }
+
+  virtual void ReleaseSnapshot(const Snapshot* snapshot) {
+    delete reinterpret_cast<const ModelSnapshot*>(snapshot);
+  }
+  virtual Status Write(const WriteOptions& options, WriteBatch* batch) {
+    class Handler : public WriteBatch::Handler {
+     public:
+      KVMap* map_;
+      virtual void Put(const Slice& key, const Slice& value) {
+        (*map_)[key.ToString()] = value.ToString();
+      }
+      virtual void Delete(const Slice& key) {
+        map_->erase(key.ToString());
+      }
+    };
+    Handler handler;
+    handler.map_ = &map_;
+    return batch->Iterate(&handler);
+  }
+
+  virtual bool GetProperty(const Slice& property, std::string* value) {
+    return false;
+  }
+  virtual void GetApproximateSizes(const Range* r, int n, uint64_t* sizes) {
+    for (int i = 0; i < n; i++) {
+      sizes[i] = 0;
+    }
+  }
+  virtual void CompactRange(const Slice* start, const Slice* end) {
+  }
+
+ private:
+  class ModelIter: public Iterator {
+   public:
+    ModelIter(const KVMap* map, bool owned)
+        : map_(map), owned_(owned), iter_(map_->end()) {
+    }
+    ~ModelIter() {
+      if (owned_) delete map_;
+    }
+    virtual bool Valid() const { return iter_ != map_->end(); }
+    virtual void SeekToFirst() { iter_ = map_->begin(); }
+    virtual void SeekToLast() {
+      if (map_->empty()) {
+        iter_ = map_->end();
+      } else {
+        iter_ = map_->find(map_->rbegin()->first);
+      }
+    }
+    virtual void Seek(const Slice& k) {
+      iter_ = map_->lower_bound(k.ToString());
+    }
+    virtual void Next() { ++iter_; }
+    virtual void Prev() { --iter_; }
+    virtual Slice key() const { return iter_->first; }
+    virtual Slice value() const { return iter_->second; }
+    virtual Status status() const { return Status::OK(); }
+   private:
+    const KVMap* const map_;
+    const bool owned_;  // Do we own map_
+    KVMap::const_iterator iter_;
+  };
+  const Options options_;
+  KVMap map_;
+};
+
+static std::string RandomKey(Random* rnd) {
+  int len = (rnd->OneIn(3)
+             ? 1                // Short sometimes to encourage collisions
+             : (rnd->OneIn(100) ? rnd->Skewed(10) : rnd->Uniform(10)));
+  return test::RandomKey(rnd, len);
+}
+
+static bool CompareIterators(int step,
+                             DB* model,
+                             DB* db,
+                             const Snapshot* model_snap,
+                             const Snapshot* db_snap) {
+  ReadOptions options;
+  options.snapshot = model_snap;
+  Iterator* miter = model->NewIterator(options);
+  options.snapshot = db_snap;
+  Iterator* dbiter = db->NewIterator(options);
+  bool ok = true;
+  int count = 0;
+  for (miter->SeekToFirst(), dbiter->SeekToFirst();
+       ok && miter->Valid() && dbiter->Valid();
+       miter->Next(), dbiter->Next()) {
+    count++;
+    if (miter->key().compare(dbiter->key()) != 0) {
+      fprintf(stderr, "step %d: Key mismatch: '%s' vs. '%s'\n",
+              step,
+              EscapeString(miter->key()).c_str(),
+              EscapeString(dbiter->key()).c_str());
+      ok = false;
+      break;
+    }
+
+    if (miter->value().compare(dbiter->value()) != 0) {
+      fprintf(stderr, "step %d: Value mismatch for key '%s': '%s' vs. '%s'\n",
+              step,
+              EscapeString(miter->key()).c_str(),
+              EscapeString(miter->value()).c_str(),
+              EscapeString(miter->value()).c_str());
+      ok = false;
+    }
+  }
+
+  if (ok) {
+    if (miter->Valid() != dbiter->Valid()) {
+      fprintf(stderr, "step %d: Mismatch at end of iterators: %d vs. %d\n",
+              step, miter->Valid(), dbiter->Valid());
+      ok = false;
+    }
+  }
+  fprintf(stderr, "%d entries compared: ok=%d\n", count, ok);
+  delete miter;
+  delete dbiter;
+  return ok;
+}
+
+TEST(DBTest, Randomized) {
+  Random rnd(test::RandomSeed());
+  do {
+    ModelDB model(CurrentOptions());
+    const int N = 10000;
+    const Snapshot* model_snap = NULL;
+    const Snapshot* db_snap = NULL;
+    std::string k, v;
+    for (int step = 0; step < N; step++) {
+      if (step % 100 == 0) {
+        fprintf(stderr, "Step %d of %d\n", step, N);
+      }
+      // TODO(sanjay): Test Get() works
+      int p = rnd.Uniform(100);
+      if (p < 45) {                               // Put
+        k = RandomKey(&rnd);
+        v = RandomString(&rnd,
+                         rnd.OneIn(20)
+                         ? 100 + rnd.Uniform(100)
+                         : rnd.Uniform(8));
+        ASSERT_OK(model.Put(WriteOptions(), k, v));
+        ASSERT_OK(db_->Put(WriteOptions(), k, v));
+
+      } else if (p < 90) {                        // Delete
+        k = RandomKey(&rnd);
+        ASSERT_OK(model.Delete(WriteOptions(), k));
+        ASSERT_OK(db_->Delete(WriteOptions(), k));
+
+
+      } else {                                    // Multi-element batch
+        WriteBatch b;
+        const int num = rnd.Uniform(8);
+        for (int i = 0; i < num; i++) {
+          if (i == 0 || !rnd.OneIn(10)) {
+            k = RandomKey(&rnd);
+          } else {
+            // Periodically re-use the same key from the previous iter, so
+            // we have multiple entries in the write batch for the same key
+          }
+          if (rnd.OneIn(2)) {
+            v = RandomString(&rnd, rnd.Uniform(10));
+            b.Put(k, v);
+          } else {
+            b.Delete(k);
+          }
+        }
+        ASSERT_OK(model.Write(WriteOptions(), &b));
+        ASSERT_OK(db_->Write(WriteOptions(), &b));
+      }
+
+      if ((step % 100) == 0) {
+        ASSERT_TRUE(CompareIterators(step, &model, db_, NULL, NULL));
+        ASSERT_TRUE(CompareIterators(step, &model, db_, model_snap, db_snap));
+        // Save a snapshot from each DB this time that we'll use next
+        // time we compare things, to make sure the current state is
+        // preserved with the snapshot
+        if (model_snap != NULL) model.ReleaseSnapshot(model_snap);
+        if (db_snap != NULL) db_->ReleaseSnapshot(db_snap);
+
+        Reopen();
+        ASSERT_TRUE(CompareIterators(step, &model, db_, NULL, NULL));
+
+        model_snap = model.GetSnapshot();
+        db_snap = db_->GetSnapshot();
+      }
+    }
+    if (model_snap != NULL) model.ReleaseSnapshot(model_snap);
+    if (db_snap != NULL) db_->ReleaseSnapshot(db_snap);
+  } while (ChangeOptions());
+}
+
+std::string MakeKey(unsigned int num) {
+  char buf[30];
+  snprintf(buf, sizeof(buf), "%016u", num);
+  return std::string(buf);
+}
+
+void BM_LogAndApply(int iters, int num_base_files) {
+  std::string dbname = test::TmpDir() + "/leveldb_test_benchmark";
+  DestroyDB(dbname, Options());
+
+  DB* db = NULL;
+  Options opts;
+  opts.create_if_missing = true;
+  Status s = DB::Open(opts, dbname, &db);
+  ASSERT_OK(s);
+  ASSERT_TRUE(db != NULL);
+
+  delete db;
+  db = NULL;
+
+  Env* env = Env::Default();
+
+  port::Mutex mu;
+  MutexLock l(&mu);
+
+  InternalKeyComparator cmp(BytewiseComparator());
+  Options options;
+  VersionSet vset(dbname, &options, NULL, &cmp);
+  bool save_manifest;
+  ASSERT_OK(vset.Recover(&save_manifest));
+  VersionEdit vbase;
+  uint64_t fnum = 1;
+  for (int i = 0; i < num_base_files; i++) {
+    InternalKey start(MakeKey(2*fnum), 1, kTypeValue);
+    InternalKey limit(MakeKey(2*fnum+1), 1, kTypeDeletion);
+    vbase.AddFile(2, fnum++, 1 /* file size */, start, limit);
+  }
+  ASSERT_OK(vset.LogAndApply(&vbase, &mu));
+
+  uint64_t start_micros = env->NowMicros();
+
+  for (int i = 0; i < iters; i++) {
+    VersionEdit vedit;
+    vedit.DeleteFile(2, fnum);
+    InternalKey start(MakeKey(2*fnum), 1, kTypeValue);
+    InternalKey limit(MakeKey(2*fnum+1), 1, kTypeDeletion);
+    vedit.AddFile(2, fnum++, 1 /* file size */, start, limit);
+    vset.LogAndApply(&vedit, &mu);
+  }
+  uint64_t stop_micros = env->NowMicros();
+  unsigned int us = stop_micros - start_micros;
+  char buf[16];
+  snprintf(buf, sizeof(buf), "%d", num_base_files);
+  fprintf(stderr,
+          "BM_LogAndApply/%-6s   %8d iters : %9u us (%7.0f us / iter)\n",
+          buf, iters, us, ((float)us) / iters);
+}
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  if (argc > 1 && std::string(argv[1]) == "--benchmark") {
+    leveldb::BM_LogAndApply(1000, 1);
+    leveldb::BM_LogAndApply(1000, 100);
+    leveldb::BM_LogAndApply(1000, 10000);
+    leveldb::BM_LogAndApply(100, 100000);
+    return 0;
+  }
+
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/db/dbformat.cc b/depend/zcash/src/leveldb/db/dbformat.cc
new file mode 100644
index 000000000..20a7ca446
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/dbformat.cc
@@ -0,0 +1,140 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include <stdio.h>
+#include "db/dbformat.h"
+#include "port/port.h"
+#include "util/coding.h"
+
+namespace leveldb {
+
+static uint64_t PackSequenceAndType(uint64_t seq, ValueType t) {
+  assert(seq <= kMaxSequenceNumber);
+  assert(t <= kValueTypeForSeek);
+  return (seq << 8) | t;
+}
+
+void AppendInternalKey(std::string* result, const ParsedInternalKey& key) {
+  result->append(key.user_key.data(), key.user_key.size());
+  PutFixed64(result, PackSequenceAndType(key.sequence, key.type));
+}
+
+std::string ParsedInternalKey::DebugString() const {
+  char buf[50];
+  snprintf(buf, sizeof(buf), "' @ %llu : %d",
+           (unsigned long long) sequence,
+           int(type));
+  std::string result = "'";
+  result += EscapeString(user_key.ToString());
+  result += buf;
+  return result;
+}
+
+std::string InternalKey::DebugString() const {
+  std::string result;
+  ParsedInternalKey parsed;
+  if (ParseInternalKey(rep_, &parsed)) {
+    result = parsed.DebugString();
+  } else {
+    result = "(bad)";
+    result.append(EscapeString(rep_));
+  }
+  return result;
+}
+
+const char* InternalKeyComparator::Name() const {
+  return "leveldb.InternalKeyComparator";
+}
+
+int InternalKeyComparator::Compare(const Slice& akey, const Slice& bkey) const {
+  // Order by:
+  //    increasing user key (according to user-supplied comparator)
+  //    decreasing sequence number
+  //    decreasing type (though sequence# should be enough to disambiguate)
+  int r = user_comparator_->Compare(ExtractUserKey(akey), ExtractUserKey(bkey));
+  if (r == 0) {
+    const uint64_t anum = DecodeFixed64(akey.data() + akey.size() - 8);
+    const uint64_t bnum = DecodeFixed64(bkey.data() + bkey.size() - 8);
+    if (anum > bnum) {
+      r = -1;
+    } else if (anum < bnum) {
+      r = +1;
+    }
+  }
+  return r;
+}
+
+void InternalKeyComparator::FindShortestSeparator(
+      std::string* start,
+      const Slice& limit) const {
+  // Attempt to shorten the user portion of the key
+  Slice user_start = ExtractUserKey(*start);
+  Slice user_limit = ExtractUserKey(limit);
+  std::string tmp(user_start.data(), user_start.size());
+  user_comparator_->FindShortestSeparator(&tmp, user_limit);
+  if (tmp.size() < user_start.size() &&
+      user_comparator_->Compare(user_start, tmp) < 0) {
+    // User key has become shorter physically, but larger logically.
+    // Tack on the earliest possible number to the shortened user key.
+    PutFixed64(&tmp, PackSequenceAndType(kMaxSequenceNumber,kValueTypeForSeek));
+    assert(this->Compare(*start, tmp) < 0);
+    assert(this->Compare(tmp, limit) < 0);
+    start->swap(tmp);
+  }
+}
+
+void InternalKeyComparator::FindShortSuccessor(std::string* key) const {
+  Slice user_key = ExtractUserKey(*key);
+  std::string tmp(user_key.data(), user_key.size());
+  user_comparator_->FindShortSuccessor(&tmp);
+  if (tmp.size() < user_key.size() &&
+      user_comparator_->Compare(user_key, tmp) < 0) {
+    // User key has become shorter physically, but larger logically.
+    // Tack on the earliest possible number to the shortened user key.
+    PutFixed64(&tmp, PackSequenceAndType(kMaxSequenceNumber,kValueTypeForSeek));
+    assert(this->Compare(*key, tmp) < 0);
+    key->swap(tmp);
+  }
+}
+
+const char* InternalFilterPolicy::Name() const {
+  return user_policy_->Name();
+}
+
+void InternalFilterPolicy::CreateFilter(const Slice* keys, int n,
+                                        std::string* dst) const {
+  // We rely on the fact that the code in table.cc does not mind us
+  // adjusting keys[].
+  Slice* mkey = const_cast<Slice*>(keys);
+  for (int i = 0; i < n; i++) {
+    mkey[i] = ExtractUserKey(keys[i]);
+    // TODO(sanjay): Suppress dups?
+  }
+  user_policy_->CreateFilter(keys, n, dst);
+}
+
+bool InternalFilterPolicy::KeyMayMatch(const Slice& key, const Slice& f) const {
+  return user_policy_->KeyMayMatch(ExtractUserKey(key), f);
+}
+
+LookupKey::LookupKey(const Slice& user_key, SequenceNumber s) {
+  size_t usize = user_key.size();
+  size_t needed = usize + 13;  // A conservative estimate
+  char* dst;
+  if (needed <= sizeof(space_)) {
+    dst = space_;
+  } else {
+    dst = new char[needed];
+  }
+  start_ = dst;
+  dst = EncodeVarint32(dst, usize + 8);
+  kstart_ = dst;
+  memcpy(dst, user_key.data(), usize);
+  dst += usize;
+  EncodeFixed64(dst, PackSequenceAndType(s, kValueTypeForSeek));
+  dst += 8;
+  end_ = dst;
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/db/dbformat.h b/depend/zcash/src/leveldb/db/dbformat.h
new file mode 100644
index 000000000..ea897b13c
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/dbformat.h
@@ -0,0 +1,230 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_DB_DBFORMAT_H_
+#define STORAGE_LEVELDB_DB_DBFORMAT_H_
+
+#include <stdio.h>
+#include "leveldb/comparator.h"
+#include "leveldb/db.h"
+#include "leveldb/filter_policy.h"
+#include "leveldb/slice.h"
+#include "leveldb/table_builder.h"
+#include "util/coding.h"
+#include "util/logging.h"
+
+namespace leveldb {
+
+// Grouping of constants.  We may want to make some of these
+// parameters set via options.
+namespace config {
+static const int kNumLevels = 7;
+
+// Level-0 compaction is started when we hit this many files.
+static const int kL0_CompactionTrigger = 4;
+
+// Soft limit on number of level-0 files.  We slow down writes at this point.
+static const int kL0_SlowdownWritesTrigger = 8;
+
+// Maximum number of level-0 files.  We stop writes at this point.
+static const int kL0_StopWritesTrigger = 12;
+
+// Maximum level to which a new compacted memtable is pushed if it
+// does not create overlap.  We try to push to level 2 to avoid the
+// relatively expensive level 0=>1 compactions and to avoid some
+// expensive manifest file operations.  We do not push all the way to
+// the largest level since that can generate a lot of wasted disk
+// space if the same key space is being repeatedly overwritten.
+static const int kMaxMemCompactLevel = 2;
+
+// Approximate gap in bytes between samples of data read during iteration.
+static const int kReadBytesPeriod = 1048576;
+
+}  // namespace config
+
+class InternalKey;
+
+// Value types encoded as the last component of internal keys.
+// DO NOT CHANGE THESE ENUM VALUES: they are embedded in the on-disk
+// data structures.
+enum ValueType {
+  kTypeDeletion = 0x0,
+  kTypeValue = 0x1
+};
+// kValueTypeForSeek defines the ValueType that should be passed when
+// constructing a ParsedInternalKey object for seeking to a particular
+// sequence number (since we sort sequence numbers in decreasing order
+// and the value type is embedded as the low 8 bits in the sequence
+// number in internal keys, we need to use the highest-numbered
+// ValueType, not the lowest).
+static const ValueType kValueTypeForSeek = kTypeValue;
+
+typedef uint64_t SequenceNumber;
+
+// We leave eight bits empty at the bottom so a type and sequence#
+// can be packed together into 64-bits.
+static const SequenceNumber kMaxSequenceNumber =
+    ((0x1ull << 56) - 1);
+
+struct ParsedInternalKey {
+  Slice user_key;
+  SequenceNumber sequence;
+  ValueType type;
+
+  ParsedInternalKey() { }  // Intentionally left uninitialized (for speed)
+  ParsedInternalKey(const Slice& u, const SequenceNumber& seq, ValueType t)
+      : user_key(u), sequence(seq), type(t) { }
+  std::string DebugString() const;
+};
+
+// Return the length of the encoding of "key".
+inline size_t InternalKeyEncodingLength(const ParsedInternalKey& key) {
+  return key.user_key.size() + 8;
+}
+
+// Append the serialization of "key" to *result.
+extern void AppendInternalKey(std::string* result,
+                              const ParsedInternalKey& key);
+
+// Attempt to parse an internal key from "internal_key".  On success,
+// stores the parsed data in "*result", and returns true.
+//
+// On error, returns false, leaves "*result" in an undefined state.
+extern bool ParseInternalKey(const Slice& internal_key,
+                             ParsedInternalKey* result);
+
+// Returns the user key portion of an internal key.
+inline Slice ExtractUserKey(const Slice& internal_key) {
+  assert(internal_key.size() >= 8);
+  return Slice(internal_key.data(), internal_key.size() - 8);
+}
+
+inline ValueType ExtractValueType(const Slice& internal_key) {
+  assert(internal_key.size() >= 8);
+  const size_t n = internal_key.size();
+  uint64_t num = DecodeFixed64(internal_key.data() + n - 8);
+  unsigned char c = num & 0xff;
+  return static_cast<ValueType>(c);
+}
+
+// A comparator for internal keys that uses a specified comparator for
+// the user key portion and breaks ties by decreasing sequence number.
+class InternalKeyComparator : public Comparator {
+ private:
+  const Comparator* user_comparator_;
+ public:
+  explicit InternalKeyComparator(const Comparator* c) : user_comparator_(c) { }
+  virtual const char* Name() const;
+  virtual int Compare(const Slice& a, const Slice& b) const;
+  virtual void FindShortestSeparator(
+      std::string* start,
+      const Slice& limit) const;
+  virtual void FindShortSuccessor(std::string* key) const;
+
+  const Comparator* user_comparator() const { return user_comparator_; }
+
+  int Compare(const InternalKey& a, const InternalKey& b) const;
+};
+
+// Filter policy wrapper that converts from internal keys to user keys
+class InternalFilterPolicy : public FilterPolicy {
+ private:
+  const FilterPolicy* const user_policy_;
+ public:
+  explicit InternalFilterPolicy(const FilterPolicy* p) : user_policy_(p) { }
+  virtual const char* Name() const;
+  virtual void CreateFilter(const Slice* keys, int n, std::string* dst) const;
+  virtual bool KeyMayMatch(const Slice& key, const Slice& filter) const;
+};
+
+// Modules in this directory should keep internal keys wrapped inside
+// the following class instead of plain strings so that we do not
+// incorrectly use string comparisons instead of an InternalKeyComparator.
+class InternalKey {
+ private:
+  std::string rep_;
+ public:
+  InternalKey() { }   // Leave rep_ as empty to indicate it is invalid
+  InternalKey(const Slice& user_key, SequenceNumber s, ValueType t) {
+    AppendInternalKey(&rep_, ParsedInternalKey(user_key, s, t));
+  }
+
+  void DecodeFrom(const Slice& s) { rep_.assign(s.data(), s.size()); }
+  Slice Encode() const {
+    assert(!rep_.empty());
+    return rep_;
+  }
+
+  Slice user_key() const { return ExtractUserKey(rep_); }
+
+  void SetFrom(const ParsedInternalKey& p) {
+    rep_.clear();
+    AppendInternalKey(&rep_, p);
+  }
+
+  void Clear() { rep_.clear(); }
+
+  std::string DebugString() const;
+};
+
+inline int InternalKeyComparator::Compare(
+    const InternalKey& a, const InternalKey& b) const {
+  return Compare(a.Encode(), b.Encode());
+}
+
+inline bool ParseInternalKey(const Slice& internal_key,
+                             ParsedInternalKey* result) {
+  const size_t n = internal_key.size();
+  if (n < 8) return false;
+  uint64_t num = DecodeFixed64(internal_key.data() + n - 8);
+  unsigned char c = num & 0xff;
+  result->sequence = num >> 8;
+  result->type = static_cast<ValueType>(c);
+  result->user_key = Slice(internal_key.data(), n - 8);
+  return (c <= static_cast<unsigned char>(kTypeValue));
+}
+
+// A helper class useful for DBImpl::Get()
+class LookupKey {
+ public:
+  // Initialize *this for looking up user_key at a snapshot with
+  // the specified sequence number.
+  LookupKey(const Slice& user_key, SequenceNumber sequence);
+
+  ~LookupKey();
+
+  // Return a key suitable for lookup in a MemTable.
+  Slice memtable_key() const { return Slice(start_, end_ - start_); }
+
+  // Return an internal key (suitable for passing to an internal iterator)
+  Slice internal_key() const { return Slice(kstart_, end_ - kstart_); }
+
+  // Return the user key
+  Slice user_key() const { return Slice(kstart_, end_ - kstart_ - 8); }
+
+ private:
+  // We construct a char array of the form:
+  //    klength  varint32               <-- start_
+  //    userkey  char[klength]          <-- kstart_
+  //    tag      uint64
+  //                                    <-- end_
+  // The array is a suitable MemTable key.
+  // The suffix starting with "userkey" can be used as an InternalKey.
+  const char* start_;
+  const char* kstart_;
+  const char* end_;
+  char space_[200];      // Avoid allocation for short keys
+
+  // No copying allowed
+  LookupKey(const LookupKey&);
+  void operator=(const LookupKey&);
+};
+
+inline LookupKey::~LookupKey() {
+  if (start_ != space_) delete[] start_;
+}
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_DB_DBFORMAT_H_
diff --git a/depend/zcash/src/leveldb/db/dbformat_test.cc b/depend/zcash/src/leveldb/db/dbformat_test.cc
new file mode 100644
index 000000000..5d82f5d31
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/dbformat_test.cc
@@ -0,0 +1,112 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "db/dbformat.h"
+#include "util/logging.h"
+#include "util/testharness.h"
+
+namespace leveldb {
+
+static std::string IKey(const std::string& user_key,
+                        uint64_t seq,
+                        ValueType vt) {
+  std::string encoded;
+  AppendInternalKey(&encoded, ParsedInternalKey(user_key, seq, vt));
+  return encoded;
+}
+
+static std::string Shorten(const std::string& s, const std::string& l) {
+  std::string result = s;
+  InternalKeyComparator(BytewiseComparator()).FindShortestSeparator(&result, l);
+  return result;
+}
+
+static std::string ShortSuccessor(const std::string& s) {
+  std::string result = s;
+  InternalKeyComparator(BytewiseComparator()).FindShortSuccessor(&result);
+  return result;
+}
+
+static void TestKey(const std::string& key,
+                    uint64_t seq,
+                    ValueType vt) {
+  std::string encoded = IKey(key, seq, vt);
+
+  Slice in(encoded);
+  ParsedInternalKey decoded("", 0, kTypeValue);
+
+  ASSERT_TRUE(ParseInternalKey(in, &decoded));
+  ASSERT_EQ(key, decoded.user_key.ToString());
+  ASSERT_EQ(seq, decoded.sequence);
+  ASSERT_EQ(vt, decoded.type);
+
+  ASSERT_TRUE(!ParseInternalKey(Slice("bar"), &decoded));
+}
+
+class FormatTest { };
+
+TEST(FormatTest, InternalKey_EncodeDecode) {
+  const char* keys[] = { "", "k", "hello", "longggggggggggggggggggggg" };
+  const uint64_t seq[] = {
+    1, 2, 3,
+    (1ull << 8) - 1, 1ull << 8, (1ull << 8) + 1,
+    (1ull << 16) - 1, 1ull << 16, (1ull << 16) + 1,
+    (1ull << 32) - 1, 1ull << 32, (1ull << 32) + 1
+  };
+  for (int k = 0; k < sizeof(keys) / sizeof(keys[0]); k++) {
+    for (int s = 0; s < sizeof(seq) / sizeof(seq[0]); s++) {
+      TestKey(keys[k], seq[s], kTypeValue);
+      TestKey("hello", 1, kTypeDeletion);
+    }
+  }
+}
+
+TEST(FormatTest, InternalKeyShortSeparator) {
+  // When user keys are same
+  ASSERT_EQ(IKey("foo", 100, kTypeValue),
+            Shorten(IKey("foo", 100, kTypeValue),
+                    IKey("foo", 99, kTypeValue)));
+  ASSERT_EQ(IKey("foo", 100, kTypeValue),
+            Shorten(IKey("foo", 100, kTypeValue),
+                    IKey("foo", 101, kTypeValue)));
+  ASSERT_EQ(IKey("foo", 100, kTypeValue),
+            Shorten(IKey("foo", 100, kTypeValue),
+                    IKey("foo", 100, kTypeValue)));
+  ASSERT_EQ(IKey("foo", 100, kTypeValue),
+            Shorten(IKey("foo", 100, kTypeValue),
+                    IKey("foo", 100, kTypeDeletion)));
+
+  // When user keys are misordered
+  ASSERT_EQ(IKey("foo", 100, kTypeValue),
+            Shorten(IKey("foo", 100, kTypeValue),
+                    IKey("bar", 99, kTypeValue)));
+
+  // When user keys are different, but correctly ordered
+  ASSERT_EQ(IKey("g", kMaxSequenceNumber, kValueTypeForSeek),
+            Shorten(IKey("foo", 100, kTypeValue),
+                    IKey("hello", 200, kTypeValue)));
+
+  // When start user key is prefix of limit user key
+  ASSERT_EQ(IKey("foo", 100, kTypeValue),
+            Shorten(IKey("foo", 100, kTypeValue),
+                    IKey("foobar", 200, kTypeValue)));
+
+  // When limit user key is prefix of start user key
+  ASSERT_EQ(IKey("foobar", 100, kTypeValue),
+            Shorten(IKey("foobar", 100, kTypeValue),
+                    IKey("foo", 200, kTypeValue)));
+}
+
+TEST(FormatTest, InternalKeyShortestSuccessor) {
+  ASSERT_EQ(IKey("g", kMaxSequenceNumber, kValueTypeForSeek),
+            ShortSuccessor(IKey("foo", 100, kTypeValue)));
+  ASSERT_EQ(IKey("\xff\xff", 100, kTypeValue),
+            ShortSuccessor(IKey("\xff\xff", 100, kTypeValue)));
+}
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/db/dumpfile.cc b/depend/zcash/src/leveldb/db/dumpfile.cc
new file mode 100644
index 000000000..61c47c2ff
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/dumpfile.cc
@@ -0,0 +1,225 @@
+// Copyright (c) 2012 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include <stdio.h>
+#include "db/dbformat.h"
+#include "db/filename.h"
+#include "db/log_reader.h"
+#include "db/version_edit.h"
+#include "db/write_batch_internal.h"
+#include "leveldb/env.h"
+#include "leveldb/iterator.h"
+#include "leveldb/options.h"
+#include "leveldb/status.h"
+#include "leveldb/table.h"
+#include "leveldb/write_batch.h"
+#include "util/logging.h"
+
+namespace leveldb {
+
+namespace {
+
+bool GuessType(const std::string& fname, FileType* type) {
+  size_t pos = fname.rfind('/');
+  std::string basename;
+  if (pos == std::string::npos) {
+    basename = fname;
+  } else {
+    basename = std::string(fname.data() + pos + 1, fname.size() - pos - 1);
+  }
+  uint64_t ignored;
+  return ParseFileName(basename, &ignored, type);
+}
+
+// Notified when log reader encounters corruption.
+class CorruptionReporter : public log::Reader::Reporter {
+ public:
+  WritableFile* dst_;
+  virtual void Corruption(size_t bytes, const Status& status) {
+    std::string r = "corruption: ";
+    AppendNumberTo(&r, bytes);
+    r += " bytes; ";
+    r += status.ToString();
+    r.push_back('\n');
+    dst_->Append(r);
+  }
+};
+
+// Print contents of a log file. (*func)() is called on every record.
+Status PrintLogContents(Env* env, const std::string& fname,
+                        void (*func)(uint64_t, Slice, WritableFile*),
+                        WritableFile* dst) {
+  SequentialFile* file;
+  Status s = env->NewSequentialFile(fname, &file);
+  if (!s.ok()) {
+    return s;
+  }
+  CorruptionReporter reporter;
+  reporter.dst_ = dst;
+  log::Reader reader(file, &reporter, true, 0);
+  Slice record;
+  std::string scratch;
+  while (reader.ReadRecord(&record, &scratch)) {
+    (*func)(reader.LastRecordOffset(), record, dst);
+  }
+  delete file;
+  return Status::OK();
+}
+
+// Called on every item found in a WriteBatch.
+class WriteBatchItemPrinter : public WriteBatch::Handler {
+ public:
+  WritableFile* dst_;
+  virtual void Put(const Slice& key, const Slice& value) {
+    std::string r = "  put '";
+    AppendEscapedStringTo(&r, key);
+    r += "' '";
+    AppendEscapedStringTo(&r, value);
+    r += "'\n";
+    dst_->Append(r);
+  }
+  virtual void Delete(const Slice& key) {
+    std::string r = "  del '";
+    AppendEscapedStringTo(&r, key);
+    r += "'\n";
+    dst_->Append(r);
+  }
+};
+
+
+// Called on every log record (each one of which is a WriteBatch)
+// found in a kLogFile.
+static void WriteBatchPrinter(uint64_t pos, Slice record, WritableFile* dst) {
+  std::string r = "--- offset ";
+  AppendNumberTo(&r, pos);
+  r += "; ";
+  if (record.size() < 12) {
+    r += "log record length ";
+    AppendNumberTo(&r, record.size());
+    r += " is too small\n";
+    dst->Append(r);
+    return;
+  }
+  WriteBatch batch;
+  WriteBatchInternal::SetContents(&batch, record);
+  r += "sequence ";
+  AppendNumberTo(&r, WriteBatchInternal::Sequence(&batch));
+  r.push_back('\n');
+  dst->Append(r);
+  WriteBatchItemPrinter batch_item_printer;
+  batch_item_printer.dst_ = dst;
+  Status s = batch.Iterate(&batch_item_printer);
+  if (!s.ok()) {
+    dst->Append("  error: " + s.ToString() + "\n");
+  }
+}
+
+Status DumpLog(Env* env, const std::string& fname, WritableFile* dst) {
+  return PrintLogContents(env, fname, WriteBatchPrinter, dst);
+}
+
+// Called on every log record (each one of which is a WriteBatch)
+// found in a kDescriptorFile.
+static void VersionEditPrinter(uint64_t pos, Slice record, WritableFile* dst) {
+  std::string r = "--- offset ";
+  AppendNumberTo(&r, pos);
+  r += "; ";
+  VersionEdit edit;
+  Status s = edit.DecodeFrom(record);
+  if (!s.ok()) {
+    r += s.ToString();
+    r.push_back('\n');
+  } else {
+    r += edit.DebugString();
+  }
+  dst->Append(r);
+}
+
+Status DumpDescriptor(Env* env, const std::string& fname, WritableFile* dst) {
+  return PrintLogContents(env, fname, VersionEditPrinter, dst);
+}
+
+Status DumpTable(Env* env, const std::string& fname, WritableFile* dst) {
+  uint64_t file_size;
+  RandomAccessFile* file = NULL;
+  Table* table = NULL;
+  Status s = env->GetFileSize(fname, &file_size);
+  if (s.ok()) {
+    s = env->NewRandomAccessFile(fname, &file);
+  }
+  if (s.ok()) {
+    // We use the default comparator, which may or may not match the
+    // comparator used in this database. However this should not cause
+    // problems since we only use Table operations that do not require
+    // any comparisons.  In particular, we do not call Seek or Prev.
+    s = Table::Open(Options(), file, file_size, &table);
+  }
+  if (!s.ok()) {
+    delete table;
+    delete file;
+    return s;
+  }
+
+  ReadOptions ro;
+  ro.fill_cache = false;
+  Iterator* iter = table->NewIterator(ro);
+  std::string r;
+  for (iter->SeekToFirst(); iter->Valid(); iter->Next()) {
+    r.clear();
+    ParsedInternalKey key;
+    if (!ParseInternalKey(iter->key(), &key)) {
+      r = "badkey '";
+      AppendEscapedStringTo(&r, iter->key());
+      r += "' => '";
+      AppendEscapedStringTo(&r, iter->value());
+      r += "'\n";
+      dst->Append(r);
+    } else {
+      r = "'";
+      AppendEscapedStringTo(&r, key.user_key);
+      r += "' @ ";
+      AppendNumberTo(&r, key.sequence);
+      r += " : ";
+      if (key.type == kTypeDeletion) {
+        r += "del";
+      } else if (key.type == kTypeValue) {
+        r += "val";
+      } else {
+        AppendNumberTo(&r, key.type);
+      }
+      r += " => '";
+      AppendEscapedStringTo(&r, iter->value());
+      r += "'\n";
+      dst->Append(r);
+    }
+  }
+  s = iter->status();
+  if (!s.ok()) {
+    dst->Append("iterator error: " + s.ToString() + "\n");
+  }
+
+  delete iter;
+  delete table;
+  delete file;
+  return Status::OK();
+}
+
+}  // namespace
+
+Status DumpFile(Env* env, const std::string& fname, WritableFile* dst) {
+  FileType ftype;
+  if (!GuessType(fname, &ftype)) {
+    return Status::InvalidArgument(fname + ": unknown file type");
+  }
+  switch (ftype) {
+    case kLogFile:         return DumpLog(env, fname, dst);
+    case kDescriptorFile:  return DumpDescriptor(env, fname, dst);
+    case kTableFile:       return DumpTable(env, fname, dst);
+    default:
+      break;
+  }
+  return Status::InvalidArgument(fname + ": not a dump-able file type");
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/db/fault_injection_test.cc b/depend/zcash/src/leveldb/db/fault_injection_test.cc
new file mode 100644
index 000000000..875dfe81e
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/fault_injection_test.cc
@@ -0,0 +1,554 @@
+// Copyright 2014 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+// This test uses a custom Env to keep track of the state of a filesystem as of
+// the last "sync". It then checks for data loss errors by purposely dropping
+// file data (or entire files) not protected by a "sync".
+
+#include "leveldb/db.h"
+
+#include <map>
+#include <set>
+#include "db/db_impl.h"
+#include "db/filename.h"
+#include "db/log_format.h"
+#include "db/version_set.h"
+#include "leveldb/cache.h"
+#include "leveldb/env.h"
+#include "leveldb/table.h"
+#include "leveldb/write_batch.h"
+#include "util/logging.h"
+#include "util/mutexlock.h"
+#include "util/testharness.h"
+#include "util/testutil.h"
+
+namespace leveldb {
+
+static const int kValueSize = 1000;
+static const int kMaxNumValues = 2000;
+static const size_t kNumIterations = 3;
+
+class FaultInjectionTestEnv;
+
+namespace {
+
+// Assume a filename, and not a directory name like "/foo/bar/"
+static std::string GetDirName(const std::string filename) {
+  size_t found = filename.find_last_of("/\\");
+  if (found == std::string::npos) {
+    return "";
+  } else {
+    return filename.substr(0, found);
+  }
+}
+
+Status SyncDir(const std::string& dir) {
+  // As this is a test it isn't required to *actually* sync this directory.
+  return Status::OK();
+}
+
+// A basic file truncation function suitable for this test.
+Status Truncate(const std::string& filename, uint64_t length) {
+  leveldb::Env* env = leveldb::Env::Default();
+
+  SequentialFile* orig_file;
+  Status s = env->NewSequentialFile(filename, &orig_file);
+  if (!s.ok())
+    return s;
+
+  char* scratch = new char[length];
+  leveldb::Slice result;
+  s = orig_file->Read(length, &result, scratch);
+  delete orig_file;
+  if (s.ok()) {
+    std::string tmp_name = GetDirName(filename) + "/truncate.tmp";
+    WritableFile* tmp_file;
+    s = env->NewWritableFile(tmp_name, &tmp_file);
+    if (s.ok()) {
+      s = tmp_file->Append(result);
+      delete tmp_file;
+      if (s.ok()) {
+        s = env->RenameFile(tmp_name, filename);
+      } else {
+        env->DeleteFile(tmp_name);
+      }
+    }
+  }
+
+  delete[] scratch;
+
+  return s;
+}
+
+struct FileState {
+  std::string filename_;
+  ssize_t pos_;
+  ssize_t pos_at_last_sync_;
+  ssize_t pos_at_last_flush_;
+
+  FileState(const std::string& filename)
+      : filename_(filename),
+        pos_(-1),
+        pos_at_last_sync_(-1),
+        pos_at_last_flush_(-1) { }
+
+  FileState() : pos_(-1), pos_at_last_sync_(-1), pos_at_last_flush_(-1) {}
+
+  bool IsFullySynced() const { return pos_ <= 0 || pos_ == pos_at_last_sync_; }
+
+  Status DropUnsyncedData() const;
+};
+
+}  // anonymous namespace
+
+// A wrapper around WritableFile which informs another Env whenever this file
+// is written to or sync'ed.
+class TestWritableFile : public WritableFile {
+ public:
+  TestWritableFile(const FileState& state,
+                   WritableFile* f,
+                   FaultInjectionTestEnv* env);
+  virtual ~TestWritableFile();
+  virtual Status Append(const Slice& data);
+  virtual Status Close();
+  virtual Status Flush();
+  virtual Status Sync();
+
+ private:
+  FileState state_;
+  WritableFile* target_;
+  bool writable_file_opened_;
+  FaultInjectionTestEnv* env_;
+
+  Status SyncParent();
+};
+
+class FaultInjectionTestEnv : public EnvWrapper {
+ public:
+  FaultInjectionTestEnv() : EnvWrapper(Env::Default()), filesystem_active_(true) {}
+  virtual ~FaultInjectionTestEnv() { }
+  virtual Status NewWritableFile(const std::string& fname,
+                                 WritableFile** result);
+  virtual Status NewAppendableFile(const std::string& fname,
+                                   WritableFile** result);
+  virtual Status DeleteFile(const std::string& f);
+  virtual Status RenameFile(const std::string& s, const std::string& t);
+
+  void WritableFileClosed(const FileState& state);
+  Status DropUnsyncedFileData();
+  Status DeleteFilesCreatedAfterLastDirSync();
+  void DirWasSynced();
+  bool IsFileCreatedSinceLastDirSync(const std::string& filename);
+  void ResetState();
+  void UntrackFile(const std::string& f);
+  // Setting the filesystem to inactive is the test equivalent to simulating a
+  // system reset. Setting to inactive will freeze our saved filesystem state so
+  // that it will stop being recorded. It can then be reset back to the state at
+  // the time of the reset.
+  bool IsFilesystemActive() const { return filesystem_active_; }
+  void SetFilesystemActive(bool active) { filesystem_active_ = active; }
+
+ private:
+  port::Mutex mutex_;
+  std::map<std::string, FileState> db_file_state_;
+  std::set<std::string> new_files_since_last_dir_sync_;
+  bool filesystem_active_;  // Record flushes, syncs, writes
+};
+
+TestWritableFile::TestWritableFile(const FileState& state,
+                                   WritableFile* f,
+                                   FaultInjectionTestEnv* env)
+    : state_(state),
+      target_(f),
+      writable_file_opened_(true),
+      env_(env) {
+  assert(f != NULL);
+}
+
+TestWritableFile::~TestWritableFile() {
+  if (writable_file_opened_) {
+    Close();
+  }
+  delete target_;
+}
+
+Status TestWritableFile::Append(const Slice& data) {
+  Status s = target_->Append(data);
+  if (s.ok() && env_->IsFilesystemActive()) {
+    state_.pos_ += data.size();
+  }
+  return s;
+}
+
+Status TestWritableFile::Close() {
+  writable_file_opened_ = false;
+  Status s = target_->Close();
+  if (s.ok()) {
+    env_->WritableFileClosed(state_);
+  }
+  return s;
+}
+
+Status TestWritableFile::Flush() {
+  Status s = target_->Flush();
+  if (s.ok() && env_->IsFilesystemActive()) {
+    state_.pos_at_last_flush_ = state_.pos_;
+  }
+  return s;
+}
+
+Status TestWritableFile::SyncParent() {
+  Status s = SyncDir(GetDirName(state_.filename_));
+  if (s.ok()) {
+    env_->DirWasSynced();
+  }
+  return s;
+}
+
+Status TestWritableFile::Sync() {
+  if (!env_->IsFilesystemActive()) {
+    return Status::OK();
+  }
+  // Ensure new files referred to by the manifest are in the filesystem.
+  Status s = target_->Sync();
+  if (s.ok()) {
+    state_.pos_at_last_sync_ = state_.pos_;
+  }
+  if (env_->IsFileCreatedSinceLastDirSync(state_.filename_)) {
+    Status ps = SyncParent();
+    if (s.ok() && !ps.ok()) {
+      s = ps;
+    }
+  }
+  return s;
+}
+
+Status FaultInjectionTestEnv::NewWritableFile(const std::string& fname,
+                                              WritableFile** result) {
+  WritableFile* actual_writable_file;
+  Status s = target()->NewWritableFile(fname, &actual_writable_file);
+  if (s.ok()) {
+    FileState state(fname);
+    state.pos_ = 0;
+    *result = new TestWritableFile(state, actual_writable_file, this);
+    // NewWritableFile doesn't append to files, so if the same file is
+    // opened again then it will be truncated - so forget our saved
+    // state.
+    UntrackFile(fname);
+    MutexLock l(&mutex_);
+    new_files_since_last_dir_sync_.insert(fname);
+  }
+  return s;
+}
+
+Status FaultInjectionTestEnv::NewAppendableFile(const std::string& fname,
+                                                WritableFile** result) {
+  WritableFile* actual_writable_file;
+  Status s = target()->NewAppendableFile(fname, &actual_writable_file);
+  if (s.ok()) {
+    FileState state(fname);
+    state.pos_ = 0;
+    {
+      MutexLock l(&mutex_);
+      if (db_file_state_.count(fname) == 0) {
+        new_files_since_last_dir_sync_.insert(fname);
+      } else {
+        state = db_file_state_[fname];
+      }
+    }
+    *result = new TestWritableFile(state, actual_writable_file, this);
+  }
+  return s;
+}
+
+Status FaultInjectionTestEnv::DropUnsyncedFileData() {
+  Status s;
+  MutexLock l(&mutex_);
+  for (std::map<std::string, FileState>::const_iterator it =
+           db_file_state_.begin();
+       s.ok() && it != db_file_state_.end(); ++it) {
+    const FileState& state = it->second;
+    if (!state.IsFullySynced()) {
+      s = state.DropUnsyncedData();
+    }
+  }
+  return s;
+}
+
+void FaultInjectionTestEnv::DirWasSynced() {
+  MutexLock l(&mutex_);
+  new_files_since_last_dir_sync_.clear();
+}
+
+bool FaultInjectionTestEnv::IsFileCreatedSinceLastDirSync(
+    const std::string& filename) {
+  MutexLock l(&mutex_);
+  return new_files_since_last_dir_sync_.find(filename) !=
+         new_files_since_last_dir_sync_.end();
+}
+
+void FaultInjectionTestEnv::UntrackFile(const std::string& f) {
+  MutexLock l(&mutex_);
+  db_file_state_.erase(f);
+  new_files_since_last_dir_sync_.erase(f);
+}
+
+Status FaultInjectionTestEnv::DeleteFile(const std::string& f) {
+  Status s = EnvWrapper::DeleteFile(f);
+  ASSERT_OK(s);
+  if (s.ok()) {
+    UntrackFile(f);
+  }
+  return s;
+}
+
+Status FaultInjectionTestEnv::RenameFile(const std::string& s,
+                                         const std::string& t) {
+  Status ret = EnvWrapper::RenameFile(s, t);
+
+  if (ret.ok()) {
+    MutexLock l(&mutex_);
+    if (db_file_state_.find(s) != db_file_state_.end()) {
+      db_file_state_[t] = db_file_state_[s];
+      db_file_state_.erase(s);
+    }
+
+    if (new_files_since_last_dir_sync_.erase(s) != 0) {
+      assert(new_files_since_last_dir_sync_.find(t) ==
+             new_files_since_last_dir_sync_.end());
+      new_files_since_last_dir_sync_.insert(t);
+    }
+  }
+
+  return ret;
+}
+
+void FaultInjectionTestEnv::ResetState() {
+  // Since we are not destroying the database, the existing files
+  // should keep their recorded synced/flushed state. Therefore
+  // we do not reset db_file_state_ and new_files_since_last_dir_sync_.
+  MutexLock l(&mutex_);
+  SetFilesystemActive(true);
+}
+
+Status FaultInjectionTestEnv::DeleteFilesCreatedAfterLastDirSync() {
+  // Because DeleteFile access this container make a copy to avoid deadlock
+  mutex_.Lock();
+  std::set<std::string> new_files(new_files_since_last_dir_sync_.begin(),
+                                  new_files_since_last_dir_sync_.end());
+  mutex_.Unlock();
+  Status s;
+  std::set<std::string>::const_iterator it;
+  for (it = new_files.begin(); s.ok() && it != new_files.end(); ++it) {
+    s = DeleteFile(*it);
+  }
+  return s;
+}
+
+void FaultInjectionTestEnv::WritableFileClosed(const FileState& state) {
+  MutexLock l(&mutex_);
+  db_file_state_[state.filename_] = state;
+}
+
+Status FileState::DropUnsyncedData() const {
+  ssize_t sync_pos = pos_at_last_sync_ == -1 ? 0 : pos_at_last_sync_;
+  return Truncate(filename_, sync_pos);
+}
+
+class FaultInjectionTest {
+ public:
+  enum ExpectedVerifResult { VAL_EXPECT_NO_ERROR, VAL_EXPECT_ERROR };
+  enum ResetMethod { RESET_DROP_UNSYNCED_DATA, RESET_DELETE_UNSYNCED_FILES };
+
+  FaultInjectionTestEnv* env_;
+  std::string dbname_;
+  Cache* tiny_cache_;
+  Options options_;
+  DB* db_;
+
+  FaultInjectionTest()
+      : env_(new FaultInjectionTestEnv),
+        tiny_cache_(NewLRUCache(100)),
+        db_(NULL) {
+    dbname_ = test::TmpDir() + "/fault_test";
+    DestroyDB(dbname_, Options());  // Destroy any db from earlier run
+    options_.reuse_logs = true;
+    options_.env = env_;
+    options_.paranoid_checks = true;
+    options_.block_cache = tiny_cache_;
+    options_.create_if_missing = true;
+  }
+
+  ~FaultInjectionTest() {
+    CloseDB();
+    DestroyDB(dbname_, Options());
+    delete tiny_cache_;
+    delete env_;
+  }
+
+  void ReuseLogs(bool reuse) {
+    options_.reuse_logs = reuse;
+  }
+
+  void Build(int start_idx, int num_vals) {
+    std::string key_space, value_space;
+    WriteBatch batch;
+    for (int i = start_idx; i < start_idx + num_vals; i++) {
+      Slice key = Key(i, &key_space);
+      batch.Clear();
+      batch.Put(key, Value(i, &value_space));
+      WriteOptions options;
+      ASSERT_OK(db_->Write(options, &batch));
+    }
+  }
+
+  Status ReadValue(int i, std::string* val) const {
+    std::string key_space, value_space;
+    Slice key = Key(i, &key_space);
+    Value(i, &value_space);
+    ReadOptions options;
+    return db_->Get(options, key, val);
+  }
+
+  Status Verify(int start_idx, int num_vals,
+                ExpectedVerifResult expected) const {
+    std::string val;
+    std::string value_space;
+    Status s;
+    for (int i = start_idx; i < start_idx + num_vals && s.ok(); i++) {
+      Value(i, &value_space);
+      s = ReadValue(i, &val);
+      if (expected == VAL_EXPECT_NO_ERROR) {
+        if (s.ok()) {
+          ASSERT_EQ(value_space, val);
+        }
+      } else if (s.ok()) {
+        fprintf(stderr, "Expected an error at %d, but was OK\n", i);
+        s = Status::IOError(dbname_, "Expected value error:");
+      } else {
+        s = Status::OK();  // An expected error
+      }
+    }
+    return s;
+  }
+
+  // Return the ith key
+  Slice Key(int i, std::string* storage) const {
+    char buf[100];
+    snprintf(buf, sizeof(buf), "%016d", i);
+    storage->assign(buf, strlen(buf));
+    return Slice(*storage);
+  }
+
+  // Return the value to associate with the specified key
+  Slice Value(int k, std::string* storage) const {
+    Random r(k);
+    return test::RandomString(&r, kValueSize, storage);
+  }
+
+  Status OpenDB() {
+    delete db_;
+    db_ = NULL;
+    env_->ResetState();
+    return DB::Open(options_, dbname_, &db_);
+  }
+
+  void CloseDB() {
+    delete db_;
+    db_ = NULL;
+  }
+
+  void DeleteAllData() {
+    Iterator* iter = db_->NewIterator(ReadOptions());
+    WriteOptions options;
+    for (iter->SeekToFirst(); iter->Valid(); iter->Next()) {
+      ASSERT_OK(db_->Delete(WriteOptions(), iter->key()));
+    }
+
+    delete iter;
+  }
+
+  void ResetDBState(ResetMethod reset_method) {
+    switch (reset_method) {
+      case RESET_DROP_UNSYNCED_DATA:
+        ASSERT_OK(env_->DropUnsyncedFileData());
+        break;
+      case RESET_DELETE_UNSYNCED_FILES:
+        ASSERT_OK(env_->DeleteFilesCreatedAfterLastDirSync());
+        break;
+      default:
+        assert(false);
+    }
+  }
+
+  void PartialCompactTestPreFault(int num_pre_sync, int num_post_sync) {
+    DeleteAllData();
+    Build(0, num_pre_sync);
+    db_->CompactRange(NULL, NULL);
+    Build(num_pre_sync, num_post_sync);
+  }
+
+  void PartialCompactTestReopenWithFault(ResetMethod reset_method,
+                                         int num_pre_sync,
+                                         int num_post_sync) {
+    env_->SetFilesystemActive(false);
+    CloseDB();
+    ResetDBState(reset_method);
+    ASSERT_OK(OpenDB());
+    ASSERT_OK(Verify(0, num_pre_sync, FaultInjectionTest::VAL_EXPECT_NO_ERROR));
+    ASSERT_OK(Verify(num_pre_sync, num_post_sync, FaultInjectionTest::VAL_EXPECT_ERROR));
+  }
+
+  void NoWriteTestPreFault() {
+  }
+
+  void NoWriteTestReopenWithFault(ResetMethod reset_method) {
+    CloseDB();
+    ResetDBState(reset_method);
+    ASSERT_OK(OpenDB());
+  }
+
+  void DoTest() {
+    Random rnd(0);
+    ASSERT_OK(OpenDB());
+    for (size_t idx = 0; idx < kNumIterations; idx++) {
+      int num_pre_sync = rnd.Uniform(kMaxNumValues);
+      int num_post_sync = rnd.Uniform(kMaxNumValues);
+
+      PartialCompactTestPreFault(num_pre_sync, num_post_sync);
+      PartialCompactTestReopenWithFault(RESET_DROP_UNSYNCED_DATA,
+                                        num_pre_sync,
+                                        num_post_sync);
+
+      NoWriteTestPreFault();
+      NoWriteTestReopenWithFault(RESET_DROP_UNSYNCED_DATA);
+
+      PartialCompactTestPreFault(num_pre_sync, num_post_sync);
+      // No new files created so we expect all values since no files will be
+      // dropped.
+      PartialCompactTestReopenWithFault(RESET_DELETE_UNSYNCED_FILES,
+                                        num_pre_sync + num_post_sync,
+                                        0);
+
+      NoWriteTestPreFault();
+      NoWriteTestReopenWithFault(RESET_DELETE_UNSYNCED_FILES);
+    }
+  }
+};
+
+TEST(FaultInjectionTest, FaultTestNoLogReuse) {
+  ReuseLogs(false);
+  DoTest();
+}
+
+TEST(FaultInjectionTest, FaultTestWithLogReuse) {
+  ReuseLogs(true);
+  DoTest();
+}
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/db/filename.cc b/depend/zcash/src/leveldb/db/filename.cc
new file mode 100644
index 000000000..da32946d9
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/filename.cc
@@ -0,0 +1,144 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include <ctype.h>
+#include <stdio.h>
+#include "db/filename.h"
+#include "db/dbformat.h"
+#include "leveldb/env.h"
+#include "util/logging.h"
+
+namespace leveldb {
+
+// A utility routine: write "data" to the named file and Sync() it.
+extern Status WriteStringToFileSync(Env* env, const Slice& data,
+                                    const std::string& fname);
+
+static std::string MakeFileName(const std::string& name, uint64_t number,
+                                const char* suffix) {
+  char buf[100];
+  snprintf(buf, sizeof(buf), "/%06llu.%s",
+           static_cast<unsigned long long>(number),
+           suffix);
+  return name + buf;
+}
+
+std::string LogFileName(const std::string& name, uint64_t number) {
+  assert(number > 0);
+  return MakeFileName(name, number, "log");
+}
+
+std::string TableFileName(const std::string& name, uint64_t number) {
+  assert(number > 0);
+  return MakeFileName(name, number, "ldb");
+}
+
+std::string SSTTableFileName(const std::string& name, uint64_t number) {
+  assert(number > 0);
+  return MakeFileName(name, number, "sst");
+}
+
+std::string DescriptorFileName(const std::string& dbname, uint64_t number) {
+  assert(number > 0);
+  char buf[100];
+  snprintf(buf, sizeof(buf), "/MANIFEST-%06llu",
+           static_cast<unsigned long long>(number));
+  return dbname + buf;
+}
+
+std::string CurrentFileName(const std::string& dbname) {
+  return dbname + "/CURRENT";
+}
+
+std::string LockFileName(const std::string& dbname) {
+  return dbname + "/LOCK";
+}
+
+std::string TempFileName(const std::string& dbname, uint64_t number) {
+  assert(number > 0);
+  return MakeFileName(dbname, number, "dbtmp");
+}
+
+std::string InfoLogFileName(const std::string& dbname) {
+  return dbname + "/LOG";
+}
+
+// Return the name of the old info log file for "dbname".
+std::string OldInfoLogFileName(const std::string& dbname) {
+  return dbname + "/LOG.old";
+}
+
+
+// Owned filenames have the form:
+//    dbname/CURRENT
+//    dbname/LOCK
+//    dbname/LOG
+//    dbname/LOG.old
+//    dbname/MANIFEST-[0-9]+
+//    dbname/[0-9]+.(log|sst|ldb)
+bool ParseFileName(const std::string& fname,
+                   uint64_t* number,
+                   FileType* type) {
+  Slice rest(fname);
+  if (rest == "CURRENT") {
+    *number = 0;
+    *type = kCurrentFile;
+  } else if (rest == "LOCK") {
+    *number = 0;
+    *type = kDBLockFile;
+  } else if (rest == "LOG" || rest == "LOG.old") {
+    *number = 0;
+    *type = kInfoLogFile;
+  } else if (rest.starts_with("MANIFEST-")) {
+    rest.remove_prefix(strlen("MANIFEST-"));
+    uint64_t num;
+    if (!ConsumeDecimalNumber(&rest, &num)) {
+      return false;
+    }
+    if (!rest.empty()) {
+      return false;
+    }
+    *type = kDescriptorFile;
+    *number = num;
+  } else {
+    // Avoid strtoull() to keep filename format independent of the
+    // current locale
+    uint64_t num;
+    if (!ConsumeDecimalNumber(&rest, &num)) {
+      return false;
+    }
+    Slice suffix = rest;
+    if (suffix == Slice(".log")) {
+      *type = kLogFile;
+    } else if (suffix == Slice(".sst") || suffix == Slice(".ldb")) {
+      *type = kTableFile;
+    } else if (suffix == Slice(".dbtmp")) {
+      *type = kTempFile;
+    } else {
+      return false;
+    }
+    *number = num;
+  }
+  return true;
+}
+
+Status SetCurrentFile(Env* env, const std::string& dbname,
+                      uint64_t descriptor_number) {
+  // Remove leading "dbname/" and add newline to manifest file name
+  std::string manifest = DescriptorFileName(dbname, descriptor_number);
+  Slice contents = manifest;
+  assert(contents.starts_with(dbname + "/"));
+  contents.remove_prefix(dbname.size() + 1);
+  std::string tmp = TempFileName(dbname, descriptor_number);
+  Status s = WriteStringToFileSync(env, contents.ToString() + "\n", tmp);
+  if (s.ok()) {
+    s = env->RenameFile(tmp, CurrentFileName(dbname));
+  }
+  if (!s.ok()) {
+    env->DeleteFile(tmp);
+  }
+  return s;
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/db/filename.h b/depend/zcash/src/leveldb/db/filename.h
new file mode 100644
index 000000000..87a752605
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/filename.h
@@ -0,0 +1,85 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// File names used by DB code
+
+#ifndef STORAGE_LEVELDB_DB_FILENAME_H_
+#define STORAGE_LEVELDB_DB_FILENAME_H_
+
+#include <stdint.h>
+#include <string>
+#include "leveldb/slice.h"
+#include "leveldb/status.h"
+#include "port/port.h"
+
+namespace leveldb {
+
+class Env;
+
+enum FileType {
+  kLogFile,
+  kDBLockFile,
+  kTableFile,
+  kDescriptorFile,
+  kCurrentFile,
+  kTempFile,
+  kInfoLogFile  // Either the current one, or an old one
+};
+
+// Return the name of the log file with the specified number
+// in the db named by "dbname".  The result will be prefixed with
+// "dbname".
+extern std::string LogFileName(const std::string& dbname, uint64_t number);
+
+// Return the name of the sstable with the specified number
+// in the db named by "dbname".  The result will be prefixed with
+// "dbname".
+extern std::string TableFileName(const std::string& dbname, uint64_t number);
+
+// Return the legacy file name for an sstable with the specified number
+// in the db named by "dbname". The result will be prefixed with
+// "dbname".
+extern std::string SSTTableFileName(const std::string& dbname, uint64_t number);
+
+// Return the name of the descriptor file for the db named by
+// "dbname" and the specified incarnation number.  The result will be
+// prefixed with "dbname".
+extern std::string DescriptorFileName(const std::string& dbname,
+                                      uint64_t number);
+
+// Return the name of the current file.  This file contains the name
+// of the current manifest file.  The result will be prefixed with
+// "dbname".
+extern std::string CurrentFileName(const std::string& dbname);
+
+// Return the name of the lock file for the db named by
+// "dbname".  The result will be prefixed with "dbname".
+extern std::string LockFileName(const std::string& dbname);
+
+// Return the name of a temporary file owned by the db named "dbname".
+// The result will be prefixed with "dbname".
+extern std::string TempFileName(const std::string& dbname, uint64_t number);
+
+// Return the name of the info log file for "dbname".
+extern std::string InfoLogFileName(const std::string& dbname);
+
+// Return the name of the old info log file for "dbname".
+extern std::string OldInfoLogFileName(const std::string& dbname);
+
+// If filename is a leveldb file, store the type of the file in *type.
+// The number encoded in the filename is stored in *number.  If the
+// filename was successfully parsed, returns true.  Else return false.
+extern bool ParseFileName(const std::string& filename,
+                          uint64_t* number,
+                          FileType* type);
+
+// Make the CURRENT file point to the descriptor file with the
+// specified number.
+extern Status SetCurrentFile(Env* env, const std::string& dbname,
+                             uint64_t descriptor_number);
+
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_DB_FILENAME_H_
diff --git a/depend/zcash/src/leveldb/db/filename_test.cc b/depend/zcash/src/leveldb/db/filename_test.cc
new file mode 100644
index 000000000..a32556dea
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/filename_test.cc
@@ -0,0 +1,123 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "db/filename.h"
+
+#include "db/dbformat.h"
+#include "port/port.h"
+#include "util/logging.h"
+#include "util/testharness.h"
+
+namespace leveldb {
+
+class FileNameTest { };
+
+TEST(FileNameTest, Parse) {
+  Slice db;
+  FileType type;
+  uint64_t number;
+
+  // Successful parses
+  static struct {
+    const char* fname;
+    uint64_t number;
+    FileType type;
+  } cases[] = {
+    { "100.log",            100,   kLogFile },
+    { "0.log",              0,     kLogFile },
+    { "0.sst",              0,     kTableFile },
+    { "0.ldb",              0,     kTableFile },
+    { "CURRENT",            0,     kCurrentFile },
+    { "LOCK",               0,     kDBLockFile },
+    { "MANIFEST-2",         2,     kDescriptorFile },
+    { "MANIFEST-7",         7,     kDescriptorFile },
+    { "LOG",                0,     kInfoLogFile },
+    { "LOG.old",            0,     kInfoLogFile },
+    { "18446744073709551615.log", 18446744073709551615ull, kLogFile },
+  };
+  for (int i = 0; i < sizeof(cases) / sizeof(cases[0]); i++) {
+    std::string f = cases[i].fname;
+    ASSERT_TRUE(ParseFileName(f, &number, &type)) << f;
+    ASSERT_EQ(cases[i].type, type) << f;
+    ASSERT_EQ(cases[i].number, number) << f;
+  }
+
+  // Errors
+  static const char* errors[] = {
+    "",
+    "foo",
+    "foo-dx-100.log",
+    ".log",
+    "",
+    "manifest",
+    "CURREN",
+    "CURRENTX",
+    "MANIFES",
+    "MANIFEST",
+    "MANIFEST-",
+    "XMANIFEST-3",
+    "MANIFEST-3x",
+    "LOC",
+    "LOCKx",
+    "LO",
+    "LOGx",
+    "18446744073709551616.log",
+    "184467440737095516150.log",
+    "100",
+    "100.",
+    "100.lop"
+  };
+  for (int i = 0; i < sizeof(errors) / sizeof(errors[0]); i++) {
+    std::string f = errors[i];
+    ASSERT_TRUE(!ParseFileName(f, &number, &type)) << f;
+  }
+}
+
+TEST(FileNameTest, Construction) {
+  uint64_t number;
+  FileType type;
+  std::string fname;
+
+  fname = CurrentFileName("foo");
+  ASSERT_EQ("foo/", std::string(fname.data(), 4));
+  ASSERT_TRUE(ParseFileName(fname.c_str() + 4, &number, &type));
+  ASSERT_EQ(0, number);
+  ASSERT_EQ(kCurrentFile, type);
+
+  fname = LockFileName("foo");
+  ASSERT_EQ("foo/", std::string(fname.data(), 4));
+  ASSERT_TRUE(ParseFileName(fname.c_str() + 4, &number, &type));
+  ASSERT_EQ(0, number);
+  ASSERT_EQ(kDBLockFile, type);
+
+  fname = LogFileName("foo", 192);
+  ASSERT_EQ("foo/", std::string(fname.data(), 4));
+  ASSERT_TRUE(ParseFileName(fname.c_str() + 4, &number, &type));
+  ASSERT_EQ(192, number);
+  ASSERT_EQ(kLogFile, type);
+
+  fname = TableFileName("bar", 200);
+  ASSERT_EQ("bar/", std::string(fname.data(), 4));
+  ASSERT_TRUE(ParseFileName(fname.c_str() + 4, &number, &type));
+  ASSERT_EQ(200, number);
+  ASSERT_EQ(kTableFile, type);
+
+  fname = DescriptorFileName("bar", 100);
+  ASSERT_EQ("bar/", std::string(fname.data(), 4));
+  ASSERT_TRUE(ParseFileName(fname.c_str() + 4, &number, &type));
+  ASSERT_EQ(100, number);
+  ASSERT_EQ(kDescriptorFile, type);
+
+  fname = TempFileName("tmp", 999);
+  ASSERT_EQ("tmp/", std::string(fname.data(), 4));
+  ASSERT_TRUE(ParseFileName(fname.c_str() + 4, &number, &type));
+  ASSERT_EQ(999, number);
+  ASSERT_EQ(kTempFile, type);
+}
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/db/leveldbutil.cc b/depend/zcash/src/leveldb/db/leveldbutil.cc
new file mode 100644
index 000000000..d06d64d64
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/leveldbutil.cc
@@ -0,0 +1,65 @@
+// Copyright (c) 2012 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include <stdio.h>
+#include "leveldb/dumpfile.h"
+#include "leveldb/env.h"
+#include "leveldb/status.h"
+
+namespace leveldb {
+namespace {
+
+class StdoutPrinter : public WritableFile {
+ public:
+  virtual Status Append(const Slice& data) {
+    fwrite(data.data(), 1, data.size(), stdout);
+    return Status::OK();
+  }
+  virtual Status Close() { return Status::OK(); }
+  virtual Status Flush() { return Status::OK(); }
+  virtual Status Sync() { return Status::OK(); }
+  virtual std::string GetName() const { return "[stdout]"; }
+};
+
+bool HandleDumpCommand(Env* env, char** files, int num) {
+  StdoutPrinter printer;
+  bool ok = true;
+  for (int i = 0; i < num; i++) {
+    Status s = DumpFile(env, files[i], &printer);
+    if (!s.ok()) {
+      fprintf(stderr, "%s\n", s.ToString().c_str());
+      ok = false;
+    }
+  }
+  return ok;
+}
+
+}  // namespace
+}  // namespace leveldb
+
+static void Usage() {
+  fprintf(
+      stderr,
+      "Usage: leveldbutil command...\n"
+      "   dump files...         -- dump contents of specified files\n"
+      );
+}
+
+int main(int argc, char** argv) {
+  leveldb::Env* env = leveldb::Env::Default();
+  bool ok = true;
+  if (argc < 2) {
+    Usage();
+    ok = false;
+  } else {
+    std::string command = argv[1];
+    if (command == "dump") {
+      ok = leveldb::HandleDumpCommand(env, argv+2, argc-2);
+    } else {
+      Usage();
+      ok = false;
+    }
+  }
+  return (ok ? 0 : 1);
+}
diff --git a/depend/zcash/src/leveldb/db/log_format.h b/depend/zcash/src/leveldb/db/log_format.h
new file mode 100644
index 000000000..356e69fca
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/log_format.h
@@ -0,0 +1,35 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// Log format information shared by reader and writer.
+// See ../doc/log_format.md for more detail.
+
+#ifndef STORAGE_LEVELDB_DB_LOG_FORMAT_H_
+#define STORAGE_LEVELDB_DB_LOG_FORMAT_H_
+
+namespace leveldb {
+namespace log {
+
+enum RecordType {
+  // Zero is reserved for preallocated files
+  kZeroType = 0,
+
+  kFullType = 1,
+
+  // For fragments
+  kFirstType = 2,
+  kMiddleType = 3,
+  kLastType = 4
+};
+static const int kMaxRecordType = kLastType;
+
+static const int kBlockSize = 32768;
+
+// Header is checksum (4 bytes), length (2 bytes), type (1 byte).
+static const int kHeaderSize = 4 + 2 + 1;
+
+}  // namespace log
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_DB_LOG_FORMAT_H_
diff --git a/depend/zcash/src/leveldb/db/log_reader.cc b/depend/zcash/src/leveldb/db/log_reader.cc
new file mode 100644
index 000000000..8b6ad136d
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/log_reader.cc
@@ -0,0 +1,284 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "db/log_reader.h"
+
+#include <stdio.h>
+#include "leveldb/env.h"
+#include "util/coding.h"
+#include "util/crc32c.h"
+
+namespace leveldb {
+namespace log {
+
+Reader::Reporter::~Reporter() {
+}
+
+Reader::Reader(SequentialFile* file, Reporter* reporter, bool checksum,
+               uint64_t initial_offset)
+    : file_(file),
+      reporter_(reporter),
+      checksum_(checksum),
+      backing_store_(new char[kBlockSize]),
+      buffer_(),
+      eof_(false),
+      last_record_offset_(0),
+      end_of_buffer_offset_(0),
+      initial_offset_(initial_offset),
+      resyncing_(initial_offset > 0) {
+}
+
+Reader::~Reader() {
+  delete[] backing_store_;
+}
+
+bool Reader::SkipToInitialBlock() {
+  size_t offset_in_block = initial_offset_ % kBlockSize;
+  uint64_t block_start_location = initial_offset_ - offset_in_block;
+
+  // Don't search a block if we'd be in the trailer
+  if (offset_in_block > kBlockSize - 6) {
+    offset_in_block = 0;
+    block_start_location += kBlockSize;
+  }
+
+  end_of_buffer_offset_ = block_start_location;
+
+  // Skip to start of first block that can contain the initial record
+  if (block_start_location > 0) {
+    Status skip_status = file_->Skip(block_start_location);
+    if (!skip_status.ok()) {
+      ReportDrop(block_start_location, skip_status);
+      return false;
+    }
+  }
+
+  return true;
+}
+
+bool Reader::ReadRecord(Slice* record, std::string* scratch) {
+  if (last_record_offset_ < initial_offset_) {
+    if (!SkipToInitialBlock()) {
+      return false;
+    }
+  }
+
+  scratch->clear();
+  record->clear();
+  bool in_fragmented_record = false;
+  // Record offset of the logical record that we're reading
+  // 0 is a dummy value to make compilers happy
+  uint64_t prospective_record_offset = 0;
+
+  Slice fragment;
+  while (true) {
+    const unsigned int record_type = ReadPhysicalRecord(&fragment);
+
+    // ReadPhysicalRecord may have only had an empty trailer remaining in its
+    // internal buffer. Calculate the offset of the next physical record now
+    // that it has returned, properly accounting for its header size.
+    uint64_t physical_record_offset =
+        end_of_buffer_offset_ - buffer_.size() - kHeaderSize - fragment.size();
+
+    if (resyncing_) {
+      if (record_type == kMiddleType) {
+        continue;
+      } else if (record_type == kLastType) {
+        resyncing_ = false;
+        continue;
+      } else {
+        resyncing_ = false;
+      }
+    }
+
+    switch (record_type) {
+      case kFullType:
+        if (in_fragmented_record) {
+          // Handle bug in earlier versions of log::Writer where
+          // it could emit an empty kFirstType record at the tail end
+          // of a block followed by a kFullType or kFirstType record
+          // at the beginning of the next block.
+          if (scratch->empty()) {
+            in_fragmented_record = false;
+          } else {
+            ReportCorruption(scratch->size(), "partial record without end(1)");
+          }
+        }
+        prospective_record_offset = physical_record_offset;
+        scratch->clear();
+        *record = fragment;
+        last_record_offset_ = prospective_record_offset;
+        return true;
+
+      case kFirstType:
+        if (in_fragmented_record) {
+          // Handle bug in earlier versions of log::Writer where
+          // it could emit an empty kFirstType record at the tail end
+          // of a block followed by a kFullType or kFirstType record
+          // at the beginning of the next block.
+          if (scratch->empty()) {
+            in_fragmented_record = false;
+          } else {
+            ReportCorruption(scratch->size(), "partial record without end(2)");
+          }
+        }
+        prospective_record_offset = physical_record_offset;
+        scratch->assign(fragment.data(), fragment.size());
+        in_fragmented_record = true;
+        break;
+
+      case kMiddleType:
+        if (!in_fragmented_record) {
+          ReportCorruption(fragment.size(),
+                           "missing start of fragmented record(1)");
+        } else {
+          scratch->append(fragment.data(), fragment.size());
+        }
+        break;
+
+      case kLastType:
+        if (!in_fragmented_record) {
+          ReportCorruption(fragment.size(),
+                           "missing start of fragmented record(2)");
+        } else {
+          scratch->append(fragment.data(), fragment.size());
+          *record = Slice(*scratch);
+          last_record_offset_ = prospective_record_offset;
+          return true;
+        }
+        break;
+
+      case kEof:
+        if (in_fragmented_record) {
+          // This can be caused by the writer dying immediately after
+          // writing a physical record but before completing the next; don't
+          // treat it as a corruption, just ignore the entire logical record.
+          scratch->clear();
+        }
+        return false;
+
+      case kBadRecord:
+        if (in_fragmented_record) {
+          ReportCorruption(scratch->size(), "error in middle of record");
+          in_fragmented_record = false;
+          scratch->clear();
+        }
+        break;
+
+      default: {
+        char buf[40];
+        snprintf(buf, sizeof(buf), "unknown record type %u", record_type);
+        ReportCorruption(
+            (fragment.size() + (in_fragmented_record ? scratch->size() : 0)),
+            buf);
+        in_fragmented_record = false;
+        scratch->clear();
+        break;
+      }
+    }
+  }
+  return false;
+}
+
+uint64_t Reader::LastRecordOffset() {
+  return last_record_offset_;
+}
+
+void Reader::ReportCorruption(uint64_t bytes, const char* reason) {
+  ReportDrop(bytes, Status::Corruption(reason, file_->GetName()));
+}
+
+void Reader::ReportDrop(uint64_t bytes, const Status& reason) {
+  if (reporter_ != NULL &&
+      end_of_buffer_offset_ - buffer_.size() - bytes >= initial_offset_) {
+    reporter_->Corruption(static_cast<size_t>(bytes), reason);
+  }
+}
+
+unsigned int Reader::ReadPhysicalRecord(Slice* result) {
+  while (true) {
+    if (buffer_.size() < kHeaderSize) {
+      if (!eof_) {
+        // Last read was a full read, so this is a trailer to skip
+        buffer_.clear();
+        Status status = file_->Read(kBlockSize, &buffer_, backing_store_);
+        end_of_buffer_offset_ += buffer_.size();
+        if (!status.ok()) {
+          buffer_.clear();
+          ReportDrop(kBlockSize, status);
+          eof_ = true;
+          return kEof;
+        } else if (buffer_.size() < kBlockSize) {
+          eof_ = true;
+        }
+        continue;
+      } else {
+        // Note that if buffer_ is non-empty, we have a truncated header at the
+        // end of the file, which can be caused by the writer crashing in the
+        // middle of writing the header. Instead of considering this an error,
+        // just report EOF.
+        buffer_.clear();
+        return kEof;
+      }
+    }
+
+    // Parse the header
+    const char* header = buffer_.data();
+    const uint32_t a = static_cast<uint32_t>(header[4]) & 0xff;
+    const uint32_t b = static_cast<uint32_t>(header[5]) & 0xff;
+    const unsigned int type = header[6];
+    const uint32_t length = a | (b << 8);
+    if (kHeaderSize + length > buffer_.size()) {
+      size_t drop_size = buffer_.size();
+      buffer_.clear();
+      if (!eof_) {
+        ReportCorruption(drop_size, "bad record length");
+        return kBadRecord;
+      }
+      // If the end of the file has been reached without reading |length| bytes
+      // of payload, assume the writer died in the middle of writing the record.
+      // Don't report a corruption.
+      return kEof;
+    }
+
+    if (type == kZeroType && length == 0) {
+      // Skip zero length record without reporting any drops since
+      // such records are produced by the mmap based writing code in
+      // env_posix.cc that preallocates file regions.
+      buffer_.clear();
+      return kBadRecord;
+    }
+
+    // Check crc
+    if (checksum_) {
+      uint32_t expected_crc = crc32c::Unmask(DecodeFixed32(header));
+      uint32_t actual_crc = crc32c::Value(header + 6, 1 + length);
+      if (actual_crc != expected_crc) {
+        // Drop the rest of the buffer since "length" itself may have
+        // been corrupted and if we trust it, we could find some
+        // fragment of a real log record that just happens to look
+        // like a valid log record.
+        size_t drop_size = buffer_.size();
+        buffer_.clear();
+        ReportCorruption(drop_size, "checksum mismatch");
+        return kBadRecord;
+      }
+    }
+
+    buffer_.remove_prefix(kHeaderSize + length);
+
+    // Skip physical record that started before initial_offset_
+    if (end_of_buffer_offset_ - buffer_.size() - kHeaderSize - length <
+        initial_offset_) {
+      result->clear();
+      return kBadRecord;
+    }
+
+    *result = Slice(header + kHeaderSize, length);
+    return type;
+  }
+}
+
+}  // namespace log
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/db/log_reader.h b/depend/zcash/src/leveldb/db/log_reader.h
new file mode 100644
index 000000000..8389d61f8
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/log_reader.h
@@ -0,0 +1,113 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_DB_LOG_READER_H_
+#define STORAGE_LEVELDB_DB_LOG_READER_H_
+
+#include <stdint.h>
+
+#include "db/log_format.h"
+#include "leveldb/slice.h"
+#include "leveldb/status.h"
+
+namespace leveldb {
+
+class SequentialFile;
+
+namespace log {
+
+class Reader {
+ public:
+  // Interface for reporting errors.
+  class Reporter {
+   public:
+    virtual ~Reporter();
+
+    // Some corruption was detected.  "size" is the approximate number
+    // of bytes dropped due to the corruption.
+    virtual void Corruption(size_t bytes, const Status& status) = 0;
+  };
+
+  // Create a reader that will return log records from "*file".
+  // "*file" must remain live while this Reader is in use.
+  //
+  // If "reporter" is non-NULL, it is notified whenever some data is
+  // dropped due to a detected corruption.  "*reporter" must remain
+  // live while this Reader is in use.
+  //
+  // If "checksum" is true, verify checksums if available.
+  //
+  // The Reader will start reading at the first record located at physical
+  // position >= initial_offset within the file.
+  Reader(SequentialFile* file, Reporter* reporter, bool checksum,
+         uint64_t initial_offset);
+
+  ~Reader();
+
+  // Read the next record into *record.  Returns true if read
+  // successfully, false if we hit end of the input.  May use
+  // "*scratch" as temporary storage.  The contents filled in *record
+  // will only be valid until the next mutating operation on this
+  // reader or the next mutation to *scratch.
+  bool ReadRecord(Slice* record, std::string* scratch);
+
+  // Returns the physical offset of the last record returned by ReadRecord.
+  //
+  // Undefined before the first call to ReadRecord.
+  uint64_t LastRecordOffset();
+
+ private:
+  SequentialFile* const file_;
+  Reporter* const reporter_;
+  bool const checksum_;
+  char* const backing_store_;
+  Slice buffer_;
+  bool eof_;   // Last Read() indicated EOF by returning < kBlockSize
+
+  // Offset of the last record returned by ReadRecord.
+  uint64_t last_record_offset_;
+  // Offset of the first location past the end of buffer_.
+  uint64_t end_of_buffer_offset_;
+
+  // Offset at which to start looking for the first record to return
+  uint64_t const initial_offset_;
+
+  // True if we are resynchronizing after a seek (initial_offset_ > 0). In
+  // particular, a run of kMiddleType and kLastType records can be silently
+  // skipped in this mode
+  bool resyncing_;
+
+  // Extend record types with the following special values
+  enum {
+    kEof = kMaxRecordType + 1,
+    // Returned whenever we find an invalid physical record.
+    // Currently there are three situations in which this happens:
+    // * The record has an invalid CRC (ReadPhysicalRecord reports a drop)
+    // * The record is a 0-length record (No drop is reported)
+    // * The record is below constructor's initial_offset (No drop is reported)
+    kBadRecord = kMaxRecordType + 2
+  };
+
+  // Skips all blocks that are completely before "initial_offset_".
+  //
+  // Returns true on success. Handles reporting.
+  bool SkipToInitialBlock();
+
+  // Return type, or one of the preceding special values
+  unsigned int ReadPhysicalRecord(Slice* result);
+
+  // Reports dropped bytes to the reporter.
+  // buffer_ must be updated to remove the dropped bytes prior to invocation.
+  void ReportCorruption(uint64_t bytes, const char* reason);
+  void ReportDrop(uint64_t bytes, const Status& reason);
+
+  // No copying allowed
+  Reader(const Reader&);
+  void operator=(const Reader&);
+};
+
+}  // namespace log
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_DB_LOG_READER_H_
diff --git a/depend/zcash/src/leveldb/db/log_test.cc b/depend/zcash/src/leveldb/db/log_test.cc
new file mode 100644
index 000000000..48a592865
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/log_test.cc
@@ -0,0 +1,591 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "db/log_reader.h"
+#include "db/log_writer.h"
+#include "leveldb/env.h"
+#include "util/coding.h"
+#include "util/crc32c.h"
+#include "util/random.h"
+#include "util/testharness.h"
+
+namespace leveldb {
+namespace log {
+
+// Construct a string of the specified length made out of the supplied
+// partial string.
+static std::string BigString(const std::string& partial_string, size_t n) {
+  std::string result;
+  while (result.size() < n) {
+    result.append(partial_string);
+  }
+  result.resize(n);
+  return result;
+}
+
+// Construct a string from a number
+static std::string NumberString(int n) {
+  char buf[50];
+  snprintf(buf, sizeof(buf), "%d.", n);
+  return std::string(buf);
+}
+
+// Return a skewed potentially long string
+static std::string RandomSkewedString(int i, Random* rnd) {
+  return BigString(NumberString(i), rnd->Skewed(17));
+}
+
+class LogTest {
+ private:
+  class StringDest : public WritableFile {
+   public:
+    std::string contents_;
+
+    virtual Status Close() { return Status::OK(); }
+    virtual Status Flush() { return Status::OK(); }
+    virtual Status Sync() { return Status::OK(); }
+    virtual Status Append(const Slice& slice) {
+      contents_.append(slice.data(), slice.size());
+      return Status::OK();
+    }
+  };
+
+  class StringSource : public SequentialFile {
+   public:
+    Slice contents_;
+    bool force_error_;
+    bool returned_partial_;
+    StringSource() : force_error_(false), returned_partial_(false) { }
+
+    virtual Status Read(size_t n, Slice* result, char* scratch) {
+      ASSERT_TRUE(!returned_partial_) << "must not Read() after eof/error";
+
+      if (force_error_) {
+        force_error_ = false;
+        returned_partial_ = true;
+        return Status::Corruption("read error");
+      }
+
+      if (contents_.size() < n) {
+        n = contents_.size();
+        returned_partial_ = true;
+      }
+      *result = Slice(contents_.data(), n);
+      contents_.remove_prefix(n);
+      return Status::OK();
+    }
+
+    virtual Status Skip(uint64_t n) {
+      if (n > contents_.size()) {
+        contents_.clear();
+        return Status::NotFound("in-memory file skipped past end");
+      }
+
+      contents_.remove_prefix(n);
+
+      return Status::OK();
+    }
+  };
+
+  class ReportCollector : public Reader::Reporter {
+   public:
+    size_t dropped_bytes_;
+    std::string message_;
+
+    ReportCollector() : dropped_bytes_(0) { }
+    virtual void Corruption(size_t bytes, const Status& status) {
+      dropped_bytes_ += bytes;
+      message_.append(status.ToString());
+    }
+  };
+
+  StringDest dest_;
+  StringSource source_;
+  ReportCollector report_;
+  bool reading_;
+  Writer* writer_;
+  Reader* reader_;
+
+  // Record metadata for testing initial offset functionality
+  static size_t initial_offset_record_sizes_[];
+  static uint64_t initial_offset_last_record_offsets_[];
+  static int num_initial_offset_records_;
+
+ public:
+  LogTest() : reading_(false),
+              writer_(new Writer(&dest_)),
+              reader_(new Reader(&source_, &report_, true/*checksum*/,
+                      0/*initial_offset*/)) {
+  }
+
+  ~LogTest() {
+    delete writer_;
+    delete reader_;
+  }
+
+  void ReopenForAppend() {
+    delete writer_;
+    writer_ = new Writer(&dest_, dest_.contents_.size());
+  }
+
+  void Write(const std::string& msg) {
+    ASSERT_TRUE(!reading_) << "Write() after starting to read";
+    writer_->AddRecord(Slice(msg));
+  }
+
+  size_t WrittenBytes() const {
+    return dest_.contents_.size();
+  }
+
+  std::string Read() {
+    if (!reading_) {
+      reading_ = true;
+      source_.contents_ = Slice(dest_.contents_);
+    }
+    std::string scratch;
+    Slice record;
+    if (reader_->ReadRecord(&record, &scratch)) {
+      return record.ToString();
+    } else {
+      return "EOF";
+    }
+  }
+
+  void IncrementByte(int offset, int delta) {
+    dest_.contents_[offset] += delta;
+  }
+
+  void SetByte(int offset, char new_byte) {
+    dest_.contents_[offset] = new_byte;
+  }
+
+  void ShrinkSize(int bytes) {
+    dest_.contents_.resize(dest_.contents_.size() - bytes);
+  }
+
+  void FixChecksum(int header_offset, int len) {
+    // Compute crc of type/len/data
+    uint32_t crc = crc32c::Value(&dest_.contents_[header_offset+6], 1 + len);
+    crc = crc32c::Mask(crc);
+    EncodeFixed32(&dest_.contents_[header_offset], crc);
+  }
+
+  void ForceError() {
+    source_.force_error_ = true;
+  }
+
+  size_t DroppedBytes() const {
+    return report_.dropped_bytes_;
+  }
+
+  std::string ReportMessage() const {
+    return report_.message_;
+  }
+
+  // Returns OK iff recorded error message contains "msg"
+  std::string MatchError(const std::string& msg) const {
+    if (report_.message_.find(msg) == std::string::npos) {
+      return report_.message_;
+    } else {
+      return "OK";
+    }
+  }
+
+  void WriteInitialOffsetLog() {
+    for (int i = 0; i < num_initial_offset_records_; i++) {
+      std::string record(initial_offset_record_sizes_[i],
+                         static_cast<char>('a' + i));
+      Write(record);
+    }
+  }
+
+  void StartReadingAt(uint64_t initial_offset) {
+    delete reader_;
+    reader_ = new Reader(&source_, &report_, true/*checksum*/, initial_offset);
+  }
+
+  void CheckOffsetPastEndReturnsNoRecords(uint64_t offset_past_end) {
+    WriteInitialOffsetLog();
+    reading_ = true;
+    source_.contents_ = Slice(dest_.contents_);
+    Reader* offset_reader = new Reader(&source_, &report_, true/*checksum*/,
+                                       WrittenBytes() + offset_past_end);
+    Slice record;
+    std::string scratch;
+    ASSERT_TRUE(!offset_reader->ReadRecord(&record, &scratch));
+    delete offset_reader;
+  }
+
+  void CheckInitialOffsetRecord(uint64_t initial_offset,
+                                int expected_record_offset) {
+    WriteInitialOffsetLog();
+    reading_ = true;
+    source_.contents_ = Slice(dest_.contents_);
+    Reader* offset_reader = new Reader(&source_, &report_, true/*checksum*/,
+                                       initial_offset);
+
+    // Read all records from expected_record_offset through the last one.
+    ASSERT_LT(expected_record_offset, num_initial_offset_records_);
+    for (; expected_record_offset < num_initial_offset_records_;
+         ++expected_record_offset) {
+      Slice record;
+      std::string scratch;
+      ASSERT_TRUE(offset_reader->ReadRecord(&record, &scratch));
+      ASSERT_EQ(initial_offset_record_sizes_[expected_record_offset],
+                record.size());
+      ASSERT_EQ(initial_offset_last_record_offsets_[expected_record_offset],
+                offset_reader->LastRecordOffset());
+      ASSERT_EQ((char)('a' + expected_record_offset), record.data()[0]);
+    }
+    delete offset_reader;
+  }
+};
+
+size_t LogTest::initial_offset_record_sizes_[] =
+    {10000,  // Two sizable records in first block
+     10000,
+     2 * log::kBlockSize - 1000,  // Span three blocks
+     1,
+     13716,  // Consume all but two bytes of block 3.
+     log::kBlockSize - kHeaderSize, // Consume the entirety of block 4.
+    };
+
+uint64_t LogTest::initial_offset_last_record_offsets_[] =
+    {0,
+     kHeaderSize + 10000,
+     2 * (kHeaderSize + 10000),
+     2 * (kHeaderSize + 10000) +
+         (2 * log::kBlockSize - 1000) + 3 * kHeaderSize,
+     2 * (kHeaderSize + 10000) +
+         (2 * log::kBlockSize - 1000) + 3 * kHeaderSize
+         + kHeaderSize + 1,
+     3 * log::kBlockSize,
+    };
+
+// LogTest::initial_offset_last_record_offsets_ must be defined before this.
+int LogTest::num_initial_offset_records_ =
+    sizeof(LogTest::initial_offset_last_record_offsets_)/sizeof(uint64_t);
+
+TEST(LogTest, Empty) {
+  ASSERT_EQ("EOF", Read());
+}
+
+TEST(LogTest, ReadWrite) {
+  Write("foo");
+  Write("bar");
+  Write("");
+  Write("xxxx");
+  ASSERT_EQ("foo", Read());
+  ASSERT_EQ("bar", Read());
+  ASSERT_EQ("", Read());
+  ASSERT_EQ("xxxx", Read());
+  ASSERT_EQ("EOF", Read());
+  ASSERT_EQ("EOF", Read());  // Make sure reads at eof work
+}
+
+TEST(LogTest, ManyBlocks) {
+  for (int i = 0; i < 100000; i++) {
+    Write(NumberString(i));
+  }
+  for (int i = 0; i < 100000; i++) {
+    ASSERT_EQ(NumberString(i), Read());
+  }
+  ASSERT_EQ("EOF", Read());
+}
+
+TEST(LogTest, Fragmentation) {
+  Write("small");
+  Write(BigString("medium", 50000));
+  Write(BigString("large", 100000));
+  ASSERT_EQ("small", Read());
+  ASSERT_EQ(BigString("medium", 50000), Read());
+  ASSERT_EQ(BigString("large", 100000), Read());
+  ASSERT_EQ("EOF", Read());
+}
+
+TEST(LogTest, MarginalTrailer) {
+  // Make a trailer that is exactly the same length as an empty record.
+  const int n = kBlockSize - 2*kHeaderSize;
+  Write(BigString("foo", n));
+  ASSERT_EQ(kBlockSize - kHeaderSize, WrittenBytes());
+  Write("");
+  Write("bar");
+  ASSERT_EQ(BigString("foo", n), Read());
+  ASSERT_EQ("", Read());
+  ASSERT_EQ("bar", Read());
+  ASSERT_EQ("EOF", Read());
+}
+
+TEST(LogTest, MarginalTrailer2) {
+  // Make a trailer that is exactly the same length as an empty record.
+  const int n = kBlockSize - 2*kHeaderSize;
+  Write(BigString("foo", n));
+  ASSERT_EQ(kBlockSize - kHeaderSize, WrittenBytes());
+  Write("bar");
+  ASSERT_EQ(BigString("foo", n), Read());
+  ASSERT_EQ("bar", Read());
+  ASSERT_EQ("EOF", Read());
+  ASSERT_EQ(0, DroppedBytes());
+  ASSERT_EQ("", ReportMessage());
+}
+
+TEST(LogTest, ShortTrailer) {
+  const int n = kBlockSize - 2*kHeaderSize + 4;
+  Write(BigString("foo", n));
+  ASSERT_EQ(kBlockSize - kHeaderSize + 4, WrittenBytes());
+  Write("");
+  Write("bar");
+  ASSERT_EQ(BigString("foo", n), Read());
+  ASSERT_EQ("", Read());
+  ASSERT_EQ("bar", Read());
+  ASSERT_EQ("EOF", Read());
+}
+
+TEST(LogTest, AlignedEof) {
+  const int n = kBlockSize - 2*kHeaderSize + 4;
+  Write(BigString("foo", n));
+  ASSERT_EQ(kBlockSize - kHeaderSize + 4, WrittenBytes());
+  ASSERT_EQ(BigString("foo", n), Read());
+  ASSERT_EQ("EOF", Read());
+}
+
+TEST(LogTest, OpenForAppend) {
+  Write("hello");
+  ReopenForAppend();
+  Write("world");
+  ASSERT_EQ("hello", Read());
+  ASSERT_EQ("world", Read());
+  ASSERT_EQ("EOF", Read());
+}
+
+TEST(LogTest, RandomRead) {
+  const int N = 500;
+  Random write_rnd(301);
+  for (int i = 0; i < N; i++) {
+    Write(RandomSkewedString(i, &write_rnd));
+  }
+  Random read_rnd(301);
+  for (int i = 0; i < N; i++) {
+    ASSERT_EQ(RandomSkewedString(i, &read_rnd), Read());
+  }
+  ASSERT_EQ("EOF", Read());
+}
+
+// Tests of all the error paths in log_reader.cc follow:
+
+TEST(LogTest, ReadError) {
+  Write("foo");
+  ForceError();
+  ASSERT_EQ("EOF", Read());
+  ASSERT_EQ(kBlockSize, DroppedBytes());
+  ASSERT_EQ("OK", MatchError("read error"));
+}
+
+TEST(LogTest, BadRecordType) {
+  Write("foo");
+  // Type is stored in header[6]
+  IncrementByte(6, 100);
+  FixChecksum(0, 3);
+  ASSERT_EQ("EOF", Read());
+  ASSERT_EQ(3, DroppedBytes());
+  ASSERT_EQ("OK", MatchError("unknown record type"));
+}
+
+TEST(LogTest, TruncatedTrailingRecordIsIgnored) {
+  Write("foo");
+  ShrinkSize(4);   // Drop all payload as well as a header byte
+  ASSERT_EQ("EOF", Read());
+  // Truncated last record is ignored, not treated as an error.
+  ASSERT_EQ(0, DroppedBytes());
+  ASSERT_EQ("", ReportMessage());
+}
+
+TEST(LogTest, BadLength) {
+  const int kPayloadSize = kBlockSize - kHeaderSize;
+  Write(BigString("bar", kPayloadSize));
+  Write("foo");
+  // Least significant size byte is stored in header[4].
+  IncrementByte(4, 1);
+  ASSERT_EQ("foo", Read());
+  ASSERT_EQ(kBlockSize, DroppedBytes());
+  ASSERT_EQ("OK", MatchError("bad record length"));
+}
+
+TEST(LogTest, BadLengthAtEndIsIgnored) {
+  Write("foo");
+  ShrinkSize(1);
+  ASSERT_EQ("EOF", Read());
+  ASSERT_EQ(0, DroppedBytes());
+  ASSERT_EQ("", ReportMessage());
+}
+
+TEST(LogTest, ChecksumMismatch) {
+  Write("foo");
+  IncrementByte(0, 10);
+  ASSERT_EQ("EOF", Read());
+  ASSERT_EQ(10, DroppedBytes());
+  ASSERT_EQ("OK", MatchError("checksum mismatch"));
+}
+
+TEST(LogTest, UnexpectedMiddleType) {
+  Write("foo");
+  SetByte(6, kMiddleType);
+  FixChecksum(0, 3);
+  ASSERT_EQ("EOF", Read());
+  ASSERT_EQ(3, DroppedBytes());
+  ASSERT_EQ("OK", MatchError("missing start"));
+}
+
+TEST(LogTest, UnexpectedLastType) {
+  Write("foo");
+  SetByte(6, kLastType);
+  FixChecksum(0, 3);
+  ASSERT_EQ("EOF", Read());
+  ASSERT_EQ(3, DroppedBytes());
+  ASSERT_EQ("OK", MatchError("missing start"));
+}
+
+TEST(LogTest, UnexpectedFullType) {
+  Write("foo");
+  Write("bar");
+  SetByte(6, kFirstType);
+  FixChecksum(0, 3);
+  ASSERT_EQ("bar", Read());
+  ASSERT_EQ("EOF", Read());
+  ASSERT_EQ(3, DroppedBytes());
+  ASSERT_EQ("OK", MatchError("partial record without end"));
+}
+
+TEST(LogTest, UnexpectedFirstType) {
+  Write("foo");
+  Write(BigString("bar", 100000));
+  SetByte(6, kFirstType);
+  FixChecksum(0, 3);
+  ASSERT_EQ(BigString("bar", 100000), Read());
+  ASSERT_EQ("EOF", Read());
+  ASSERT_EQ(3, DroppedBytes());
+  ASSERT_EQ("OK", MatchError("partial record without end"));
+}
+
+TEST(LogTest, MissingLastIsIgnored) {
+  Write(BigString("bar", kBlockSize));
+  // Remove the LAST block, including header.
+  ShrinkSize(14);
+  ASSERT_EQ("EOF", Read());
+  ASSERT_EQ("", ReportMessage());
+  ASSERT_EQ(0, DroppedBytes());
+}
+
+TEST(LogTest, PartialLastIsIgnored) {
+  Write(BigString("bar", kBlockSize));
+  // Cause a bad record length in the LAST block.
+  ShrinkSize(1);
+  ASSERT_EQ("EOF", Read());
+  ASSERT_EQ("", ReportMessage());
+  ASSERT_EQ(0, DroppedBytes());
+}
+
+TEST(LogTest, SkipIntoMultiRecord) {
+  // Consider a fragmented record:
+  //    first(R1), middle(R1), last(R1), first(R2)
+  // If initial_offset points to a record after first(R1) but before first(R2)
+  // incomplete fragment errors are not actual errors, and must be suppressed
+  // until a new first or full record is encountered.
+  Write(BigString("foo", 3*kBlockSize));
+  Write("correct");
+  StartReadingAt(kBlockSize);
+
+  ASSERT_EQ("correct", Read());
+  ASSERT_EQ("", ReportMessage());
+  ASSERT_EQ(0, DroppedBytes());
+  ASSERT_EQ("EOF", Read());
+}
+
+TEST(LogTest, ErrorJoinsRecords) {
+  // Consider two fragmented records:
+  //    first(R1) last(R1) first(R2) last(R2)
+  // where the middle two fragments disappear.  We do not want
+  // first(R1),last(R2) to get joined and returned as a valid record.
+
+  // Write records that span two blocks
+  Write(BigString("foo", kBlockSize));
+  Write(BigString("bar", kBlockSize));
+  Write("correct");
+
+  // Wipe the middle block
+  for (int offset = kBlockSize; offset < 2*kBlockSize; offset++) {
+    SetByte(offset, 'x');
+  }
+
+  ASSERT_EQ("correct", Read());
+  ASSERT_EQ("EOF", Read());
+  const size_t dropped = DroppedBytes();
+  ASSERT_LE(dropped, 2*kBlockSize + 100);
+  ASSERT_GE(dropped, 2*kBlockSize);
+}
+
+TEST(LogTest, ReadStart) {
+  CheckInitialOffsetRecord(0, 0);
+}
+
+TEST(LogTest, ReadSecondOneOff) {
+  CheckInitialOffsetRecord(1, 1);
+}
+
+TEST(LogTest, ReadSecondTenThousand) {
+  CheckInitialOffsetRecord(10000, 1);
+}
+
+TEST(LogTest, ReadSecondStart) {
+  CheckInitialOffsetRecord(10007, 1);
+}
+
+TEST(LogTest, ReadThirdOneOff) {
+  CheckInitialOffsetRecord(10008, 2);
+}
+
+TEST(LogTest, ReadThirdStart) {
+  CheckInitialOffsetRecord(20014, 2);
+}
+
+TEST(LogTest, ReadFourthOneOff) {
+  CheckInitialOffsetRecord(20015, 3);
+}
+
+TEST(LogTest, ReadFourthFirstBlockTrailer) {
+  CheckInitialOffsetRecord(log::kBlockSize - 4, 3);
+}
+
+TEST(LogTest, ReadFourthMiddleBlock) {
+  CheckInitialOffsetRecord(log::kBlockSize + 1, 3);
+}
+
+TEST(LogTest, ReadFourthLastBlock) {
+  CheckInitialOffsetRecord(2 * log::kBlockSize + 1, 3);
+}
+
+TEST(LogTest, ReadFourthStart) {
+  CheckInitialOffsetRecord(
+      2 * (kHeaderSize + 1000) + (2 * log::kBlockSize - 1000) + 3 * kHeaderSize,
+      3);
+}
+
+TEST(LogTest, ReadInitialOffsetIntoBlockPadding) {
+  CheckInitialOffsetRecord(3 * log::kBlockSize - 3, 5);
+}
+
+TEST(LogTest, ReadEnd) {
+  CheckOffsetPastEndReturnsNoRecords(0);
+}
+
+TEST(LogTest, ReadPastEnd) {
+  CheckOffsetPastEndReturnsNoRecords(5);
+}
+
+}  // namespace log
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/db/log_writer.cc b/depend/zcash/src/leveldb/db/log_writer.cc
new file mode 100644
index 000000000..74a03270d
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/log_writer.cc
@@ -0,0 +1,112 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "db/log_writer.h"
+
+#include <stdint.h>
+#include "leveldb/env.h"
+#include "util/coding.h"
+#include "util/crc32c.h"
+
+namespace leveldb {
+namespace log {
+
+static void InitTypeCrc(uint32_t* type_crc) {
+  for (int i = 0; i <= kMaxRecordType; i++) {
+    char t = static_cast<char>(i);
+    type_crc[i] = crc32c::Value(&t, 1);
+  }
+}
+
+Writer::Writer(WritableFile* dest)
+    : dest_(dest),
+      block_offset_(0) {
+  InitTypeCrc(type_crc_);
+}
+
+Writer::Writer(WritableFile* dest, uint64_t dest_length)
+    : dest_(dest), block_offset_(dest_length % kBlockSize) {
+  InitTypeCrc(type_crc_);
+}
+
+Writer::~Writer() {
+}
+
+Status Writer::AddRecord(const Slice& slice) {
+  const char* ptr = slice.data();
+  size_t left = slice.size();
+
+  // Fragment the record if necessary and emit it.  Note that if slice
+  // is empty, we still want to iterate once to emit a single
+  // zero-length record
+  Status s;
+  bool begin = true;
+  do {
+    const int leftover = kBlockSize - block_offset_;
+    assert(leftover >= 0);
+    if (leftover < kHeaderSize) {
+      // Switch to a new block
+      if (leftover > 0) {
+        // Fill the trailer (literal below relies on kHeaderSize being 7)
+        assert(kHeaderSize == 7);
+        dest_->Append(Slice("\x00\x00\x00\x00\x00\x00", leftover));
+      }
+      block_offset_ = 0;
+    }
+
+    // Invariant: we never leave < kHeaderSize bytes in a block.
+    assert(kBlockSize - block_offset_ - kHeaderSize >= 0);
+
+    const size_t avail = kBlockSize - block_offset_ - kHeaderSize;
+    const size_t fragment_length = (left < avail) ? left : avail;
+
+    RecordType type;
+    const bool end = (left == fragment_length);
+    if (begin && end) {
+      type = kFullType;
+    } else if (begin) {
+      type = kFirstType;
+    } else if (end) {
+      type = kLastType;
+    } else {
+      type = kMiddleType;
+    }
+
+    s = EmitPhysicalRecord(type, ptr, fragment_length);
+    ptr += fragment_length;
+    left -= fragment_length;
+    begin = false;
+  } while (s.ok() && left > 0);
+  return s;
+}
+
+Status Writer::EmitPhysicalRecord(RecordType t, const char* ptr, size_t n) {
+  assert(n <= 0xffff);  // Must fit in two bytes
+  assert(block_offset_ + kHeaderSize + n <= kBlockSize);
+
+  // Format the header
+  char buf[kHeaderSize];
+  buf[4] = static_cast<char>(n & 0xff);
+  buf[5] = static_cast<char>(n >> 8);
+  buf[6] = static_cast<char>(t);
+
+  // Compute the crc of the record type and the payload.
+  uint32_t crc = crc32c::Extend(type_crc_[t], ptr, n);
+  crc = crc32c::Mask(crc);                 // Adjust for storage
+  EncodeFixed32(buf, crc);
+
+  // Write the header and the payload
+  Status s = dest_->Append(Slice(buf, kHeaderSize));
+  if (s.ok()) {
+    s = dest_->Append(Slice(ptr, n));
+    if (s.ok()) {
+      s = dest_->Flush();
+    }
+  }
+  block_offset_ += kHeaderSize + n;
+  return s;
+}
+
+}  // namespace log
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/db/log_writer.h b/depend/zcash/src/leveldb/db/log_writer.h
new file mode 100644
index 000000000..9e7cc4705
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/log_writer.h
@@ -0,0 +1,54 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_DB_LOG_WRITER_H_
+#define STORAGE_LEVELDB_DB_LOG_WRITER_H_
+
+#include <stdint.h>
+#include "db/log_format.h"
+#include "leveldb/slice.h"
+#include "leveldb/status.h"
+
+namespace leveldb {
+
+class WritableFile;
+
+namespace log {
+
+class Writer {
+ public:
+  // Create a writer that will append data to "*dest".
+  // "*dest" must be initially empty.
+  // "*dest" must remain live while this Writer is in use.
+  explicit Writer(WritableFile* dest);
+
+  // Create a writer that will append data to "*dest".
+  // "*dest" must have initial length "dest_length".
+  // "*dest" must remain live while this Writer is in use.
+  Writer(WritableFile* dest, uint64_t dest_length);
+
+  ~Writer();
+
+  Status AddRecord(const Slice& slice);
+
+ private:
+  WritableFile* dest_;
+  int block_offset_;       // Current offset in block
+
+  // crc32c values for all supported record types.  These are
+  // pre-computed to reduce the overhead of computing the crc of the
+  // record type stored in the header.
+  uint32_t type_crc_[kMaxRecordType + 1];
+
+  Status EmitPhysicalRecord(RecordType type, const char* ptr, size_t length);
+
+  // No copying allowed
+  Writer(const Writer&);
+  void operator=(const Writer&);
+};
+
+}  // namespace log
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_DB_LOG_WRITER_H_
diff --git a/depend/zcash/src/leveldb/db/memtable.cc b/depend/zcash/src/leveldb/db/memtable.cc
new file mode 100644
index 000000000..287afdbdc
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/memtable.cc
@@ -0,0 +1,145 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "db/memtable.h"
+#include "db/dbformat.h"
+#include "leveldb/comparator.h"
+#include "leveldb/env.h"
+#include "leveldb/iterator.h"
+#include "util/coding.h"
+
+namespace leveldb {
+
+static Slice GetLengthPrefixedSlice(const char* data) {
+  uint32_t len;
+  const char* p = data;
+  p = GetVarint32Ptr(p, p + 5, &len);  // +5: we assume "p" is not corrupted
+  return Slice(p, len);
+}
+
+MemTable::MemTable(const InternalKeyComparator& cmp)
+    : comparator_(cmp),
+      refs_(0),
+      table_(comparator_, &arena_) {
+}
+
+MemTable::~MemTable() {
+  assert(refs_ == 0);
+}
+
+size_t MemTable::ApproximateMemoryUsage() { return arena_.MemoryUsage(); }
+
+int MemTable::KeyComparator::operator()(const char* aptr, const char* bptr)
+    const {
+  // Internal keys are encoded as length-prefixed strings.
+  Slice a = GetLengthPrefixedSlice(aptr);
+  Slice b = GetLengthPrefixedSlice(bptr);
+  return comparator.Compare(a, b);
+}
+
+// Encode a suitable internal key target for "target" and return it.
+// Uses *scratch as scratch space, and the returned pointer will point
+// into this scratch space.
+static const char* EncodeKey(std::string* scratch, const Slice& target) {
+  scratch->clear();
+  PutVarint32(scratch, target.size());
+  scratch->append(target.data(), target.size());
+  return scratch->data();
+}
+
+class MemTableIterator: public Iterator {
+ public:
+  explicit MemTableIterator(MemTable::Table* table) : iter_(table) { }
+
+  virtual bool Valid() const { return iter_.Valid(); }
+  virtual void Seek(const Slice& k) { iter_.Seek(EncodeKey(&tmp_, k)); }
+  virtual void SeekToFirst() { iter_.SeekToFirst(); }
+  virtual void SeekToLast() { iter_.SeekToLast(); }
+  virtual void Next() { iter_.Next(); }
+  virtual void Prev() { iter_.Prev(); }
+  virtual Slice key() const { return GetLengthPrefixedSlice(iter_.key()); }
+  virtual Slice value() const {
+    Slice key_slice = GetLengthPrefixedSlice(iter_.key());
+    return GetLengthPrefixedSlice(key_slice.data() + key_slice.size());
+  }
+
+  virtual Status status() const { return Status::OK(); }
+
+ private:
+  MemTable::Table::Iterator iter_;
+  std::string tmp_;       // For passing to EncodeKey
+
+  // No copying allowed
+  MemTableIterator(const MemTableIterator&);
+  void operator=(const MemTableIterator&);
+};
+
+Iterator* MemTable::NewIterator() {
+  return new MemTableIterator(&table_);
+}
+
+void MemTable::Add(SequenceNumber s, ValueType type,
+                   const Slice& key,
+                   const Slice& value) {
+  // Format of an entry is concatenation of:
+  //  key_size     : varint32 of internal_key.size()
+  //  key bytes    : char[internal_key.size()]
+  //  value_size   : varint32 of value.size()
+  //  value bytes  : char[value.size()]
+  size_t key_size = key.size();
+  size_t val_size = value.size();
+  size_t internal_key_size = key_size + 8;
+  const size_t encoded_len =
+      VarintLength(internal_key_size) + internal_key_size +
+      VarintLength(val_size) + val_size;
+  char* buf = arena_.Allocate(encoded_len);
+  char* p = EncodeVarint32(buf, internal_key_size);
+  memcpy(p, key.data(), key_size);
+  p += key_size;
+  EncodeFixed64(p, (s << 8) | type);
+  p += 8;
+  p = EncodeVarint32(p, val_size);
+  memcpy(p, value.data(), val_size);
+  assert(p + val_size == buf + encoded_len);
+  table_.Insert(buf);
+}
+
+bool MemTable::Get(const LookupKey& key, std::string* value, Status* s) {
+  Slice memkey = key.memtable_key();
+  Table::Iterator iter(&table_);
+  iter.Seek(memkey.data());
+  if (iter.Valid()) {
+    // entry format is:
+    //    klength  varint32
+    //    userkey  char[klength]
+    //    tag      uint64
+    //    vlength  varint32
+    //    value    char[vlength]
+    // Check that it belongs to same user key.  We do not check the
+    // sequence number since the Seek() call above should have skipped
+    // all entries with overly large sequence numbers.
+    const char* entry = iter.key();
+    uint32_t key_length;
+    const char* key_ptr = GetVarint32Ptr(entry, entry+5, &key_length);
+    if (comparator_.comparator.user_comparator()->Compare(
+            Slice(key_ptr, key_length - 8),
+            key.user_key()) == 0) {
+      // Correct user key
+      const uint64_t tag = DecodeFixed64(key_ptr + key_length - 8);
+      switch (static_cast<ValueType>(tag & 0xff)) {
+        case kTypeValue: {
+          Slice v = GetLengthPrefixedSlice(key_ptr + key_length);
+          value->assign(v.data(), v.size());
+          return true;
+        }
+        case kTypeDeletion:
+          *s = Status::NotFound(Slice());
+          return true;
+      }
+    }
+  }
+  return false;
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/db/memtable.h b/depend/zcash/src/leveldb/db/memtable.h
new file mode 100644
index 000000000..9f41567cd
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/memtable.h
@@ -0,0 +1,88 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_DB_MEMTABLE_H_
+#define STORAGE_LEVELDB_DB_MEMTABLE_H_
+
+#include <string>
+#include "leveldb/db.h"
+#include "db/dbformat.h"
+#include "db/skiplist.h"
+#include "util/arena.h"
+
+namespace leveldb {
+
+class InternalKeyComparator;
+class Mutex;
+class MemTableIterator;
+
+class MemTable {
+ public:
+  // MemTables are reference counted.  The initial reference count
+  // is zero and the caller must call Ref() at least once.
+  explicit MemTable(const InternalKeyComparator& comparator);
+
+  // Increase reference count.
+  void Ref() { ++refs_; }
+
+  // Drop reference count.  Delete if no more references exist.
+  void Unref() {
+    --refs_;
+    assert(refs_ >= 0);
+    if (refs_ <= 0) {
+      delete this;
+    }
+  }
+
+  // Returns an estimate of the number of bytes of data in use by this
+  // data structure. It is safe to call when MemTable is being modified.
+  size_t ApproximateMemoryUsage();
+
+  // Return an iterator that yields the contents of the memtable.
+  //
+  // The caller must ensure that the underlying MemTable remains live
+  // while the returned iterator is live.  The keys returned by this
+  // iterator are internal keys encoded by AppendInternalKey in the
+  // db/format.{h,cc} module.
+  Iterator* NewIterator();
+
+  // Add an entry into memtable that maps key to value at the
+  // specified sequence number and with the specified type.
+  // Typically value will be empty if type==kTypeDeletion.
+  void Add(SequenceNumber seq, ValueType type,
+           const Slice& key,
+           const Slice& value);
+
+  // If memtable contains a value for key, store it in *value and return true.
+  // If memtable contains a deletion for key, store a NotFound() error
+  // in *status and return true.
+  // Else, return false.
+  bool Get(const LookupKey& key, std::string* value, Status* s);
+
+ private:
+  ~MemTable();  // Private since only Unref() should be used to delete it
+
+  struct KeyComparator {
+    const InternalKeyComparator comparator;
+    explicit KeyComparator(const InternalKeyComparator& c) : comparator(c) { }
+    int operator()(const char* a, const char* b) const;
+  };
+  friend class MemTableIterator;
+  friend class MemTableBackwardIterator;
+
+  typedef SkipList<const char*, KeyComparator> Table;
+
+  KeyComparator comparator_;
+  int refs_;
+  Arena arena_;
+  Table table_;
+
+  // No copying allowed
+  MemTable(const MemTable&);
+  void operator=(const MemTable&);
+};
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_DB_MEMTABLE_H_
diff --git a/depend/zcash/src/leveldb/db/recovery_test.cc b/depend/zcash/src/leveldb/db/recovery_test.cc
new file mode 100644
index 000000000..9596f4288
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/recovery_test.cc
@@ -0,0 +1,324 @@
+// Copyright (c) 2014 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "db/db_impl.h"
+#include "db/filename.h"
+#include "db/version_set.h"
+#include "db/write_batch_internal.h"
+#include "leveldb/db.h"
+#include "leveldb/env.h"
+#include "leveldb/write_batch.h"
+#include "util/logging.h"
+#include "util/testharness.h"
+#include "util/testutil.h"
+
+namespace leveldb {
+
+class RecoveryTest {
+ public:
+  RecoveryTest() : env_(Env::Default()), db_(NULL) {
+    dbname_ = test::TmpDir() + "/recovery_test";
+    DestroyDB(dbname_, Options());
+    Open();
+  }
+
+  ~RecoveryTest() {
+    Close();
+    DestroyDB(dbname_, Options());
+  }
+
+  DBImpl* dbfull() const { return reinterpret_cast<DBImpl*>(db_); }
+  Env* env() const { return env_; }
+
+  bool CanAppend() {
+    WritableFile* tmp;
+    Status s = env_->NewAppendableFile(CurrentFileName(dbname_), &tmp);
+    delete tmp;
+    if (s.IsNotSupportedError()) {
+      return false;
+    } else {
+      return true;
+    }
+  }
+
+  void Close() {
+    delete db_;
+    db_ = NULL;
+  }
+
+  void Open(Options* options = NULL) {
+    Close();
+    Options opts;
+    if (options != NULL) {
+      opts = *options;
+    } else {
+      opts.reuse_logs = true;  // TODO(sanjay): test both ways
+      opts.create_if_missing = true;
+    }
+    if (opts.env == NULL) {
+      opts.env = env_;
+    }
+    ASSERT_OK(DB::Open(opts, dbname_, &db_));
+    ASSERT_EQ(1, NumLogs());
+  }
+
+  Status Put(const std::string& k, const std::string& v) {
+    return db_->Put(WriteOptions(), k, v);
+  }
+
+  std::string Get(const std::string& k, const Snapshot* snapshot = NULL) {
+    std::string result;
+    Status s = db_->Get(ReadOptions(), k, &result);
+    if (s.IsNotFound()) {
+      result = "NOT_FOUND";
+    } else if (!s.ok()) {
+      result = s.ToString();
+    }
+    return result;
+  }
+
+  std::string ManifestFileName() {
+    std::string current;
+    ASSERT_OK(ReadFileToString(env_, CurrentFileName(dbname_), &current));
+    size_t len = current.size();
+    if (len > 0 && current[len-1] == '\n') {
+      current.resize(len - 1);
+    }
+    return dbname_ + "/" + current;
+  }
+
+  std::string LogName(uint64_t number) {
+    return LogFileName(dbname_, number);
+  }
+
+  size_t DeleteLogFiles() {
+    std::vector<uint64_t> logs = GetFiles(kLogFile);
+    for (size_t i = 0; i < logs.size(); i++) {
+      ASSERT_OK(env_->DeleteFile(LogName(logs[i]))) << LogName(logs[i]);
+    }
+    return logs.size();
+  }
+
+  uint64_t FirstLogFile() {
+    return GetFiles(kLogFile)[0];
+  }
+
+  std::vector<uint64_t> GetFiles(FileType t) {
+    std::vector<std::string> filenames;
+    ASSERT_OK(env_->GetChildren(dbname_, &filenames));
+    std::vector<uint64_t> result;
+    for (size_t i = 0; i < filenames.size(); i++) {
+      uint64_t number;
+      FileType type;
+      if (ParseFileName(filenames[i], &number, &type) && type == t) {
+        result.push_back(number);
+      }
+    }
+    return result;
+  }
+
+  int NumLogs() {
+    return GetFiles(kLogFile).size();
+  }
+
+  int NumTables() {
+    return GetFiles(kTableFile).size();
+  }
+
+  uint64_t FileSize(const std::string& fname) {
+    uint64_t result;
+    ASSERT_OK(env_->GetFileSize(fname, &result)) << fname;
+    return result;
+  }
+
+  void CompactMemTable() {
+    dbfull()->TEST_CompactMemTable();
+  }
+
+  // Directly construct a log file that sets key to val.
+  void MakeLogFile(uint64_t lognum, SequenceNumber seq, Slice key, Slice val) {
+    std::string fname = LogFileName(dbname_, lognum);
+    WritableFile* file;
+    ASSERT_OK(env_->NewWritableFile(fname, &file));
+    log::Writer writer(file);
+    WriteBatch batch;
+    batch.Put(key, val);
+    WriteBatchInternal::SetSequence(&batch, seq);
+    ASSERT_OK(writer.AddRecord(WriteBatchInternal::Contents(&batch)));
+    ASSERT_OK(file->Flush());
+    delete file;
+  }
+
+ private:
+  std::string dbname_;
+  Env* env_;
+  DB* db_;
+};
+
+TEST(RecoveryTest, ManifestReused) {
+  if (!CanAppend()) {
+    fprintf(stderr, "skipping test because env does not support appending\n");
+    return;
+  }
+  ASSERT_OK(Put("foo", "bar"));
+  Close();
+  std::string old_manifest = ManifestFileName();
+  Open();
+  ASSERT_EQ(old_manifest, ManifestFileName());
+  ASSERT_EQ("bar", Get("foo"));
+  Open();
+  ASSERT_EQ(old_manifest, ManifestFileName());
+  ASSERT_EQ("bar", Get("foo"));
+}
+
+TEST(RecoveryTest, LargeManifestCompacted) {
+  if (!CanAppend()) {
+    fprintf(stderr, "skipping test because env does not support appending\n");
+    return;
+  }
+  ASSERT_OK(Put("foo", "bar"));
+  Close();
+  std::string old_manifest = ManifestFileName();
+
+  // Pad with zeroes to make manifest file very big.
+  {
+    uint64_t len = FileSize(old_manifest);
+    WritableFile* file;
+    ASSERT_OK(env()->NewAppendableFile(old_manifest, &file));
+    std::string zeroes(3*1048576 - static_cast<size_t>(len), 0);
+    ASSERT_OK(file->Append(zeroes));
+    ASSERT_OK(file->Flush());
+    delete file;
+  }
+
+  Open();
+  std::string new_manifest = ManifestFileName();
+  ASSERT_NE(old_manifest, new_manifest);
+  ASSERT_GT(10000, FileSize(new_manifest));
+  ASSERT_EQ("bar", Get("foo"));
+
+  Open();
+  ASSERT_EQ(new_manifest, ManifestFileName());
+  ASSERT_EQ("bar", Get("foo"));
+}
+
+TEST(RecoveryTest, NoLogFiles) {
+  ASSERT_OK(Put("foo", "bar"));
+  ASSERT_EQ(1, DeleteLogFiles());
+  Open();
+  ASSERT_EQ("NOT_FOUND", Get("foo"));
+  Open();
+  ASSERT_EQ("NOT_FOUND", Get("foo"));
+}
+
+TEST(RecoveryTest, LogFileReuse) {
+  if (!CanAppend()) {
+    fprintf(stderr, "skipping test because env does not support appending\n");
+    return;
+  }
+  for (int i = 0; i < 2; i++) {
+    ASSERT_OK(Put("foo", "bar"));
+    if (i == 0) {
+      // Compact to ensure current log is empty
+      CompactMemTable();
+    }
+    Close();
+    ASSERT_EQ(1, NumLogs());
+    uint64_t number = FirstLogFile();
+    if (i == 0) {
+      ASSERT_EQ(0, FileSize(LogName(number)));
+    } else {
+      ASSERT_LT(0, FileSize(LogName(number)));
+    }
+    Open();
+    ASSERT_EQ(1, NumLogs());
+    ASSERT_EQ(number, FirstLogFile()) << "did not reuse log file";
+    ASSERT_EQ("bar", Get("foo"));
+    Open();
+    ASSERT_EQ(1, NumLogs());
+    ASSERT_EQ(number, FirstLogFile()) << "did not reuse log file";
+    ASSERT_EQ("bar", Get("foo"));
+  }
+}
+
+TEST(RecoveryTest, MultipleMemTables) {
+  // Make a large log.
+  const int kNum = 1000;
+  for (int i = 0; i < kNum; i++) {
+    char buf[100];
+    snprintf(buf, sizeof(buf), "%050d", i);
+    ASSERT_OK(Put(buf, buf));
+  }
+  ASSERT_EQ(0, NumTables());
+  Close();
+  ASSERT_EQ(0, NumTables());
+  ASSERT_EQ(1, NumLogs());
+  uint64_t old_log_file = FirstLogFile();
+
+  // Force creation of multiple memtables by reducing the write buffer size.
+  Options opt;
+  opt.reuse_logs = true;
+  opt.write_buffer_size = (kNum*100) / 2;
+  Open(&opt);
+  ASSERT_LE(2, NumTables());
+  ASSERT_EQ(1, NumLogs());
+  ASSERT_NE(old_log_file, FirstLogFile()) << "must not reuse log";
+  for (int i = 0; i < kNum; i++) {
+    char buf[100];
+    snprintf(buf, sizeof(buf), "%050d", i);
+    ASSERT_EQ(buf, Get(buf));
+  }
+}
+
+TEST(RecoveryTest, MultipleLogFiles) {
+  ASSERT_OK(Put("foo", "bar"));
+  Close();
+  ASSERT_EQ(1, NumLogs());
+
+  // Make a bunch of uncompacted log files.
+  uint64_t old_log = FirstLogFile();
+  MakeLogFile(old_log+1, 1000, "hello", "world");
+  MakeLogFile(old_log+2, 1001, "hi", "there");
+  MakeLogFile(old_log+3, 1002, "foo", "bar2");
+
+  // Recover and check that all log files were processed.
+  Open();
+  ASSERT_LE(1, NumTables());
+  ASSERT_EQ(1, NumLogs());
+  uint64_t new_log = FirstLogFile();
+  ASSERT_LE(old_log+3, new_log);
+  ASSERT_EQ("bar2", Get("foo"));
+  ASSERT_EQ("world", Get("hello"));
+  ASSERT_EQ("there", Get("hi"));
+
+  // Test that previous recovery produced recoverable state.
+  Open();
+  ASSERT_LE(1, NumTables());
+  ASSERT_EQ(1, NumLogs());
+  if (CanAppend()) {
+    ASSERT_EQ(new_log, FirstLogFile());
+  }
+  ASSERT_EQ("bar2", Get("foo"));
+  ASSERT_EQ("world", Get("hello"));
+  ASSERT_EQ("there", Get("hi"));
+
+  // Check that introducing an older log file does not cause it to be re-read.
+  Close();
+  MakeLogFile(old_log+1, 2000, "hello", "stale write");
+  Open();
+  ASSERT_LE(1, NumTables());
+  ASSERT_EQ(1, NumLogs());
+  if (CanAppend()) {
+    ASSERT_EQ(new_log, FirstLogFile());
+  }
+  ASSERT_EQ("bar2", Get("foo"));
+  ASSERT_EQ("world", Get("hello"));
+  ASSERT_EQ("there", Get("hi"));
+}
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/db/repair.cc b/depend/zcash/src/leveldb/db/repair.cc
new file mode 100644
index 000000000..7281e3d34
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/repair.cc
@@ -0,0 +1,461 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// We recover the contents of the descriptor from the other files we find.
+// (1) Any log files are first converted to tables
+// (2) We scan every table to compute
+//     (a) smallest/largest for the table
+//     (b) largest sequence number in the table
+// (3) We generate descriptor contents:
+//      - log number is set to zero
+//      - next-file-number is set to 1 + largest file number we found
+//      - last-sequence-number is set to largest sequence# found across
+//        all tables (see 2c)
+//      - compaction pointers are cleared
+//      - every table file is added at level 0
+//
+// Possible optimization 1:
+//   (a) Compute total size and use to pick appropriate max-level M
+//   (b) Sort tables by largest sequence# in the table
+//   (c) For each table: if it overlaps earlier table, place in level-0,
+//       else place in level-M.
+// Possible optimization 2:
+//   Store per-table metadata (smallest, largest, largest-seq#, ...)
+//   in the table's meta section to speed up ScanTable.
+
+#include "db/builder.h"
+#include "db/db_impl.h"
+#include "db/dbformat.h"
+#include "db/filename.h"
+#include "db/log_reader.h"
+#include "db/log_writer.h"
+#include "db/memtable.h"
+#include "db/table_cache.h"
+#include "db/version_edit.h"
+#include "db/write_batch_internal.h"
+#include "leveldb/comparator.h"
+#include "leveldb/db.h"
+#include "leveldb/env.h"
+
+namespace leveldb {
+
+namespace {
+
+class Repairer {
+ public:
+  Repairer(const std::string& dbname, const Options& options)
+      : dbname_(dbname),
+        env_(options.env),
+        icmp_(options.comparator),
+        ipolicy_(options.filter_policy),
+        options_(SanitizeOptions(dbname, &icmp_, &ipolicy_, options)),
+        owns_info_log_(options_.info_log != options.info_log),
+        owns_cache_(options_.block_cache != options.block_cache),
+        next_file_number_(1) {
+    // TableCache can be small since we expect each table to be opened once.
+    table_cache_ = new TableCache(dbname_, &options_, 10);
+  }
+
+  ~Repairer() {
+    delete table_cache_;
+    if (owns_info_log_) {
+      delete options_.info_log;
+    }
+    if (owns_cache_) {
+      delete options_.block_cache;
+    }
+  }
+
+  Status Run() {
+    Status status = FindFiles();
+    if (status.ok()) {
+      ConvertLogFilesToTables();
+      ExtractMetaData();
+      status = WriteDescriptor();
+    }
+    if (status.ok()) {
+      unsigned long long bytes = 0;
+      for (size_t i = 0; i < tables_.size(); i++) {
+        bytes += tables_[i].meta.file_size;
+      }
+      Log(options_.info_log,
+          "**** Repaired leveldb %s; "
+          "recovered %d files; %llu bytes. "
+          "Some data may have been lost. "
+          "****",
+          dbname_.c_str(),
+          static_cast<int>(tables_.size()),
+          bytes);
+    }
+    return status;
+  }
+
+ private:
+  struct TableInfo {
+    FileMetaData meta;
+    SequenceNumber max_sequence;
+  };
+
+  std::string const dbname_;
+  Env* const env_;
+  InternalKeyComparator const icmp_;
+  InternalFilterPolicy const ipolicy_;
+  Options const options_;
+  bool owns_info_log_;
+  bool owns_cache_;
+  TableCache* table_cache_;
+  VersionEdit edit_;
+
+  std::vector<std::string> manifests_;
+  std::vector<uint64_t> table_numbers_;
+  std::vector<uint64_t> logs_;
+  std::vector<TableInfo> tables_;
+  uint64_t next_file_number_;
+
+  Status FindFiles() {
+    std::vector<std::string> filenames;
+    Status status = env_->GetChildren(dbname_, &filenames);
+    if (!status.ok()) {
+      return status;
+    }
+    if (filenames.empty()) {
+      return Status::IOError(dbname_, "repair found no files");
+    }
+
+    uint64_t number;
+    FileType type;
+    for (size_t i = 0; i < filenames.size(); i++) {
+      if (ParseFileName(filenames[i], &number, &type)) {
+        if (type == kDescriptorFile) {
+          manifests_.push_back(filenames[i]);
+        } else {
+          if (number + 1 > next_file_number_) {
+            next_file_number_ = number + 1;
+          }
+          if (type == kLogFile) {
+            logs_.push_back(number);
+          } else if (type == kTableFile) {
+            table_numbers_.push_back(number);
+          } else {
+            // Ignore other files
+          }
+        }
+      }
+    }
+    return status;
+  }
+
+  void ConvertLogFilesToTables() {
+    for (size_t i = 0; i < logs_.size(); i++) {
+      std::string logname = LogFileName(dbname_, logs_[i]);
+      Status status = ConvertLogToTable(logs_[i]);
+      if (!status.ok()) {
+        Log(options_.info_log, "Log #%llu: ignoring conversion error: %s",
+            (unsigned long long) logs_[i],
+            status.ToString().c_str());
+      }
+      ArchiveFile(logname);
+    }
+  }
+
+  Status ConvertLogToTable(uint64_t log) {
+    struct LogReporter : public log::Reader::Reporter {
+      Env* env;
+      Logger* info_log;
+      uint64_t lognum;
+      virtual void Corruption(size_t bytes, const Status& s) {
+        // We print error messages for corruption, but continue repairing.
+        Log(info_log, "Log #%llu: dropping %d bytes; %s",
+            (unsigned long long) lognum,
+            static_cast<int>(bytes),
+            s.ToString().c_str());
+      }
+    };
+
+    // Open the log file
+    std::string logname = LogFileName(dbname_, log);
+    SequentialFile* lfile;
+    Status status = env_->NewSequentialFile(logname, &lfile);
+    if (!status.ok()) {
+      return status;
+    }
+
+    // Create the log reader.
+    LogReporter reporter;
+    reporter.env = env_;
+    reporter.info_log = options_.info_log;
+    reporter.lognum = log;
+    // We intentionally make log::Reader do checksumming so that
+    // corruptions cause entire commits to be skipped instead of
+    // propagating bad information (like overly large sequence
+    // numbers).
+    log::Reader reader(lfile, &reporter, false/*do not checksum*/,
+                       0/*initial_offset*/);
+
+    // Read all the records and add to a memtable
+    std::string scratch;
+    Slice record;
+    WriteBatch batch;
+    MemTable* mem = new MemTable(icmp_);
+    mem->Ref();
+    int counter = 0;
+    while (reader.ReadRecord(&record, &scratch)) {
+      if (record.size() < 12) {
+        reporter.Corruption(
+            record.size(), Status::Corruption("log record too small", logname));
+        continue;
+      }
+      WriteBatchInternal::SetContents(&batch, record);
+      status = WriteBatchInternal::InsertInto(&batch, mem);
+      if (status.ok()) {
+        counter += WriteBatchInternal::Count(&batch);
+      } else {
+        Log(options_.info_log, "Log #%llu: ignoring %s",
+            (unsigned long long) log,
+            status.ToString().c_str());
+        status = Status::OK();  // Keep going with rest of file
+      }
+    }
+    delete lfile;
+
+    // Do not record a version edit for this conversion to a Table
+    // since ExtractMetaData() will also generate edits.
+    FileMetaData meta;
+    meta.number = next_file_number_++;
+    Iterator* iter = mem->NewIterator();
+    status = BuildTable(dbname_, env_, options_, table_cache_, iter, &meta);
+    delete iter;
+    mem->Unref();
+    mem = NULL;
+    if (status.ok()) {
+      if (meta.file_size > 0) {
+        table_numbers_.push_back(meta.number);
+      }
+    }
+    Log(options_.info_log, "Log #%llu: %d ops saved to Table #%llu %s",
+        (unsigned long long) log,
+        counter,
+        (unsigned long long) meta.number,
+        status.ToString().c_str());
+    return status;
+  }
+
+  void ExtractMetaData() {
+    for (size_t i = 0; i < table_numbers_.size(); i++) {
+      ScanTable(table_numbers_[i]);
+    }
+  }
+
+  Iterator* NewTableIterator(const FileMetaData& meta) {
+    // Same as compaction iterators: if paranoid_checks are on, turn
+    // on checksum verification.
+    ReadOptions r;
+    r.verify_checksums = options_.paranoid_checks;
+    return table_cache_->NewIterator(r, meta.number, meta.file_size);
+  }
+
+  void ScanTable(uint64_t number) {
+    TableInfo t;
+    t.meta.number = number;
+    std::string fname = TableFileName(dbname_, number);
+    Status status = env_->GetFileSize(fname, &t.meta.file_size);
+    if (!status.ok()) {
+      // Try alternate file name.
+      fname = SSTTableFileName(dbname_, number);
+      Status s2 = env_->GetFileSize(fname, &t.meta.file_size);
+      if (s2.ok()) {
+        status = Status::OK();
+      }
+    }
+    if (!status.ok()) {
+      ArchiveFile(TableFileName(dbname_, number));
+      ArchiveFile(SSTTableFileName(dbname_, number));
+      Log(options_.info_log, "Table #%llu: dropped: %s",
+          (unsigned long long) t.meta.number,
+          status.ToString().c_str());
+      return;
+    }
+
+    // Extract metadata by scanning through table.
+    int counter = 0;
+    Iterator* iter = NewTableIterator(t.meta);
+    bool empty = true;
+    ParsedInternalKey parsed;
+    t.max_sequence = 0;
+    for (iter->SeekToFirst(); iter->Valid(); iter->Next()) {
+      Slice key = iter->key();
+      if (!ParseInternalKey(key, &parsed)) {
+        Log(options_.info_log, "Table #%llu: unparsable key %s",
+            (unsigned long long) t.meta.number,
+            EscapeString(key).c_str());
+        continue;
+      }
+
+      counter++;
+      if (empty) {
+        empty = false;
+        t.meta.smallest.DecodeFrom(key);
+      }
+      t.meta.largest.DecodeFrom(key);
+      if (parsed.sequence > t.max_sequence) {
+        t.max_sequence = parsed.sequence;
+      }
+    }
+    if (!iter->status().ok()) {
+      status = iter->status();
+    }
+    delete iter;
+    Log(options_.info_log, "Table #%llu: %d entries %s",
+        (unsigned long long) t.meta.number,
+        counter,
+        status.ToString().c_str());
+
+    if (status.ok()) {
+      tables_.push_back(t);
+    } else {
+      RepairTable(fname, t);  // RepairTable archives input file.
+    }
+  }
+
+  void RepairTable(const std::string& src, TableInfo t) {
+    // We will copy src contents to a new table and then rename the
+    // new table over the source.
+
+    // Create builder.
+    std::string copy = TableFileName(dbname_, next_file_number_++);
+    WritableFile* file;
+    Status s = env_->NewWritableFile(copy, &file);
+    if (!s.ok()) {
+      return;
+    }
+    TableBuilder* builder = new TableBuilder(options_, file);
+
+    // Copy data.
+    Iterator* iter = NewTableIterator(t.meta);
+    int counter = 0;
+    for (iter->SeekToFirst(); iter->Valid(); iter->Next()) {
+      builder->Add(iter->key(), iter->value());
+      counter++;
+    }
+    delete iter;
+
+    ArchiveFile(src);
+    if (counter == 0) {
+      builder->Abandon();  // Nothing to save
+    } else {
+      s = builder->Finish();
+      if (s.ok()) {
+        t.meta.file_size = builder->FileSize();
+      }
+    }
+    delete builder;
+    builder = NULL;
+
+    if (s.ok()) {
+      s = file->Close();
+    }
+    delete file;
+    file = NULL;
+
+    if (counter > 0 && s.ok()) {
+      std::string orig = TableFileName(dbname_, t.meta.number);
+      s = env_->RenameFile(copy, orig);
+      if (s.ok()) {
+        Log(options_.info_log, "Table #%llu: %d entries repaired",
+            (unsigned long long) t.meta.number, counter);
+        tables_.push_back(t);
+      }
+    }
+    if (!s.ok()) {
+      env_->DeleteFile(copy);
+    }
+  }
+
+  Status WriteDescriptor() {
+    std::string tmp = TempFileName(dbname_, 1);
+    WritableFile* file;
+    Status status = env_->NewWritableFile(tmp, &file);
+    if (!status.ok()) {
+      return status;
+    }
+
+    SequenceNumber max_sequence = 0;
+    for (size_t i = 0; i < tables_.size(); i++) {
+      if (max_sequence < tables_[i].max_sequence) {
+        max_sequence = tables_[i].max_sequence;
+      }
+    }
+
+    edit_.SetComparatorName(icmp_.user_comparator()->Name());
+    edit_.SetLogNumber(0);
+    edit_.SetNextFile(next_file_number_);
+    edit_.SetLastSequence(max_sequence);
+
+    for (size_t i = 0; i < tables_.size(); i++) {
+      // TODO(opt): separate out into multiple levels
+      const TableInfo& t = tables_[i];
+      edit_.AddFile(0, t.meta.number, t.meta.file_size,
+                    t.meta.smallest, t.meta.largest);
+    }
+
+    //fprintf(stderr, "NewDescriptor:\n%s\n", edit_.DebugString().c_str());
+    {
+      log::Writer log(file);
+      std::string record;
+      edit_.EncodeTo(&record);
+      status = log.AddRecord(record);
+    }
+    if (status.ok()) {
+      status = file->Close();
+    }
+    delete file;
+    file = NULL;
+
+    if (!status.ok()) {
+      env_->DeleteFile(tmp);
+    } else {
+      // Discard older manifests
+      for (size_t i = 0; i < manifests_.size(); i++) {
+        ArchiveFile(dbname_ + "/" + manifests_[i]);
+      }
+
+      // Install new manifest
+      status = env_->RenameFile(tmp, DescriptorFileName(dbname_, 1));
+      if (status.ok()) {
+        status = SetCurrentFile(env_, dbname_, 1);
+      } else {
+        env_->DeleteFile(tmp);
+      }
+    }
+    return status;
+  }
+
+  void ArchiveFile(const std::string& fname) {
+    // Move into another directory.  E.g., for
+    //    dir/foo
+    // rename to
+    //    dir/lost/foo
+    const char* slash = strrchr(fname.c_str(), '/');
+    std::string new_dir;
+    if (slash != NULL) {
+      new_dir.assign(fname.data(), slash - fname.data());
+    }
+    new_dir.append("/lost");
+    env_->CreateDir(new_dir);  // Ignore error
+    std::string new_file = new_dir;
+    new_file.append("/");
+    new_file.append((slash == NULL) ? fname.c_str() : slash + 1);
+    Status s = env_->RenameFile(fname, new_file);
+    Log(options_.info_log, "Archiving %s: %s\n",
+        fname.c_str(), s.ToString().c_str());
+  }
+};
+}  // namespace
+
+Status RepairDB(const std::string& dbname, const Options& options) {
+  Repairer repairer(dbname, options);
+  return repairer.Run();
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/db/skiplist.h b/depend/zcash/src/leveldb/db/skiplist.h
new file mode 100644
index 000000000..8bd77764d
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/skiplist.h
@@ -0,0 +1,384 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_DB_SKIPLIST_H_
+#define STORAGE_LEVELDB_DB_SKIPLIST_H_
+
+// Thread safety
+// -------------
+//
+// Writes require external synchronization, most likely a mutex.
+// Reads require a guarantee that the SkipList will not be destroyed
+// while the read is in progress.  Apart from that, reads progress
+// without any internal locking or synchronization.
+//
+// Invariants:
+//
+// (1) Allocated nodes are never deleted until the SkipList is
+// destroyed.  This is trivially guaranteed by the code since we
+// never delete any skip list nodes.
+//
+// (2) The contents of a Node except for the next/prev pointers are
+// immutable after the Node has been linked into the SkipList.
+// Only Insert() modifies the list, and it is careful to initialize
+// a node and use release-stores to publish the nodes in one or
+// more lists.
+//
+// ... prev vs. next pointer ordering ...
+
+#include <assert.h>
+#include <stdlib.h>
+#include "port/port.h"
+#include "util/arena.h"
+#include "util/random.h"
+
+namespace leveldb {
+
+class Arena;
+
+template<typename Key, class Comparator>
+class SkipList {
+ private:
+  struct Node;
+
+ public:
+  // Create a new SkipList object that will use "cmp" for comparing keys,
+  // and will allocate memory using "*arena".  Objects allocated in the arena
+  // must remain allocated for the lifetime of the skiplist object.
+  explicit SkipList(Comparator cmp, Arena* arena);
+
+  // Insert key into the list.
+  // REQUIRES: nothing that compares equal to key is currently in the list.
+  void Insert(const Key& key);
+
+  // Returns true iff an entry that compares equal to key is in the list.
+  bool Contains(const Key& key) const;
+
+  // Iteration over the contents of a skip list
+  class Iterator {
+   public:
+    // Initialize an iterator over the specified list.
+    // The returned iterator is not valid.
+    explicit Iterator(const SkipList* list);
+
+    // Returns true iff the iterator is positioned at a valid node.
+    bool Valid() const;
+
+    // Returns the key at the current position.
+    // REQUIRES: Valid()
+    const Key& key() const;
+
+    // Advances to the next position.
+    // REQUIRES: Valid()
+    void Next();
+
+    // Advances to the previous position.
+    // REQUIRES: Valid()
+    void Prev();
+
+    // Advance to the first entry with a key >= target
+    void Seek(const Key& target);
+
+    // Position at the first entry in list.
+    // Final state of iterator is Valid() iff list is not empty.
+    void SeekToFirst();
+
+    // Position at the last entry in list.
+    // Final state of iterator is Valid() iff list is not empty.
+    void SeekToLast();
+
+   private:
+    const SkipList* list_;
+    Node* node_;
+    // Intentionally copyable
+  };
+
+ private:
+  enum { kMaxHeight = 12 };
+
+  // Immutable after construction
+  Comparator const compare_;
+  Arena* const arena_;    // Arena used for allocations of nodes
+
+  Node* const head_;
+
+  // Modified only by Insert().  Read racily by readers, but stale
+  // values are ok.
+  port::AtomicPointer max_height_;   // Height of the entire list
+
+  inline int GetMaxHeight() const {
+    return static_cast<int>(
+        reinterpret_cast<intptr_t>(max_height_.NoBarrier_Load()));
+  }
+
+  // Read/written only by Insert().
+  Random rnd_;
+
+  Node* NewNode(const Key& key, int height);
+  int RandomHeight();
+  bool Equal(const Key& a, const Key& b) const { return (compare_(a, b) == 0); }
+
+  // Return true if key is greater than the data stored in "n"
+  bool KeyIsAfterNode(const Key& key, Node* n) const;
+
+  // Return the earliest node that comes at or after key.
+  // Return NULL if there is no such node.
+  //
+  // If prev is non-NULL, fills prev[level] with pointer to previous
+  // node at "level" for every level in [0..max_height_-1].
+  Node* FindGreaterOrEqual(const Key& key, Node** prev) const;
+
+  // Return the latest node with a key < key.
+  // Return head_ if there is no such node.
+  Node* FindLessThan(const Key& key) const;
+
+  // Return the last node in the list.
+  // Return head_ if list is empty.
+  Node* FindLast() const;
+
+  // No copying allowed
+  SkipList(const SkipList&);
+  void operator=(const SkipList&);
+};
+
+// Implementation details follow
+template<typename Key, class Comparator>
+struct SkipList<Key,Comparator>::Node {
+  explicit Node(const Key& k) : key(k) { }
+
+  Key const key;
+
+  // Accessors/mutators for links.  Wrapped in methods so we can
+  // add the appropriate barriers as necessary.
+  Node* Next(int n) {
+    assert(n >= 0);
+    // Use an 'acquire load' so that we observe a fully initialized
+    // version of the returned Node.
+    return reinterpret_cast<Node*>(next_[n].Acquire_Load());
+  }
+  void SetNext(int n, Node* x) {
+    assert(n >= 0);
+    // Use a 'release store' so that anybody who reads through this
+    // pointer observes a fully initialized version of the inserted node.
+    next_[n].Release_Store(x);
+  }
+
+  // No-barrier variants that can be safely used in a few locations.
+  Node* NoBarrier_Next(int n) {
+    assert(n >= 0);
+    return reinterpret_cast<Node*>(next_[n].NoBarrier_Load());
+  }
+  void NoBarrier_SetNext(int n, Node* x) {
+    assert(n >= 0);
+    next_[n].NoBarrier_Store(x);
+  }
+
+ private:
+  // Array of length equal to the node height.  next_[0] is lowest level link.
+  port::AtomicPointer next_[1];
+};
+
+template<typename Key, class Comparator>
+typename SkipList<Key,Comparator>::Node*
+SkipList<Key,Comparator>::NewNode(const Key& key, int height) {
+  char* mem = arena_->AllocateAligned(
+      sizeof(Node) + sizeof(port::AtomicPointer) * (height - 1));
+  return new (mem) Node(key);
+}
+
+template<typename Key, class Comparator>
+inline SkipList<Key,Comparator>::Iterator::Iterator(const SkipList* list) {
+  list_ = list;
+  node_ = NULL;
+}
+
+template<typename Key, class Comparator>
+inline bool SkipList<Key,Comparator>::Iterator::Valid() const {
+  return node_ != NULL;
+}
+
+template<typename Key, class Comparator>
+inline const Key& SkipList<Key,Comparator>::Iterator::key() const {
+  assert(Valid());
+  return node_->key;
+}
+
+template<typename Key, class Comparator>
+inline void SkipList<Key,Comparator>::Iterator::Next() {
+  assert(Valid());
+  node_ = node_->Next(0);
+}
+
+template<typename Key, class Comparator>
+inline void SkipList<Key,Comparator>::Iterator::Prev() {
+  // Instead of using explicit "prev" links, we just search for the
+  // last node that falls before key.
+  assert(Valid());
+  node_ = list_->FindLessThan(node_->key);
+  if (node_ == list_->head_) {
+    node_ = NULL;
+  }
+}
+
+template<typename Key, class Comparator>
+inline void SkipList<Key,Comparator>::Iterator::Seek(const Key& target) {
+  node_ = list_->FindGreaterOrEqual(target, NULL);
+}
+
+template<typename Key, class Comparator>
+inline void SkipList<Key,Comparator>::Iterator::SeekToFirst() {
+  node_ = list_->head_->Next(0);
+}
+
+template<typename Key, class Comparator>
+inline void SkipList<Key,Comparator>::Iterator::SeekToLast() {
+  node_ = list_->FindLast();
+  if (node_ == list_->head_) {
+    node_ = NULL;
+  }
+}
+
+template<typename Key, class Comparator>
+int SkipList<Key,Comparator>::RandomHeight() {
+  // Increase height with probability 1 in kBranching
+  static const unsigned int kBranching = 4;
+  int height = 1;
+  while (height < kMaxHeight && ((rnd_.Next() % kBranching) == 0)) {
+    height++;
+  }
+  assert(height > 0);
+  assert(height <= kMaxHeight);
+  return height;
+}
+
+template<typename Key, class Comparator>
+bool SkipList<Key,Comparator>::KeyIsAfterNode(const Key& key, Node* n) const {
+  // NULL n is considered infinite
+  return (n != NULL) && (compare_(n->key, key) < 0);
+}
+
+template<typename Key, class Comparator>
+typename SkipList<Key,Comparator>::Node* SkipList<Key,Comparator>::FindGreaterOrEqual(const Key& key, Node** prev)
+    const {
+  Node* x = head_;
+  int level = GetMaxHeight() - 1;
+  while (true) {
+    Node* next = x->Next(level);
+    if (KeyIsAfterNode(key, next)) {
+      // Keep searching in this list
+      x = next;
+    } else {
+      if (prev != NULL) prev[level] = x;
+      if (level == 0) {
+        return next;
+      } else {
+        // Switch to next list
+        level--;
+      }
+    }
+  }
+}
+
+template<typename Key, class Comparator>
+typename SkipList<Key,Comparator>::Node*
+SkipList<Key,Comparator>::FindLessThan(const Key& key) const {
+  Node* x = head_;
+  int level = GetMaxHeight() - 1;
+  while (true) {
+    assert(x == head_ || compare_(x->key, key) < 0);
+    Node* next = x->Next(level);
+    if (next == NULL || compare_(next->key, key) >= 0) {
+      if (level == 0) {
+        return x;
+      } else {
+        // Switch to next list
+        level--;
+      }
+    } else {
+      x = next;
+    }
+  }
+}
+
+template<typename Key, class Comparator>
+typename SkipList<Key,Comparator>::Node* SkipList<Key,Comparator>::FindLast()
+    const {
+  Node* x = head_;
+  int level = GetMaxHeight() - 1;
+  while (true) {
+    Node* next = x->Next(level);
+    if (next == NULL) {
+      if (level == 0) {
+        return x;
+      } else {
+        // Switch to next list
+        level--;
+      }
+    } else {
+      x = next;
+    }
+  }
+}
+
+template<typename Key, class Comparator>
+SkipList<Key,Comparator>::SkipList(Comparator cmp, Arena* arena)
+    : compare_(cmp),
+      arena_(arena),
+      head_(NewNode(0 /* any key will do */, kMaxHeight)),
+      max_height_(reinterpret_cast<void*>(1)),
+      rnd_(0xdeadbeef) {
+  for (int i = 0; i < kMaxHeight; i++) {
+    head_->SetNext(i, NULL);
+  }
+}
+
+template<typename Key, class Comparator>
+void SkipList<Key,Comparator>::Insert(const Key& key) {
+  // TODO(opt): We can use a barrier-free variant of FindGreaterOrEqual()
+  // here since Insert() is externally synchronized.
+  Node* prev[kMaxHeight];
+  Node* x = FindGreaterOrEqual(key, prev);
+
+  // Our data structure does not allow duplicate insertion
+  assert(x == NULL || !Equal(key, x->key));
+
+  int height = RandomHeight();
+  if (height > GetMaxHeight()) {
+    for (int i = GetMaxHeight(); i < height; i++) {
+      prev[i] = head_;
+    }
+    //fprintf(stderr, "Change height from %d to %d\n", max_height_, height);
+
+    // It is ok to mutate max_height_ without any synchronization
+    // with concurrent readers.  A concurrent reader that observes
+    // the new value of max_height_ will see either the old value of
+    // new level pointers from head_ (NULL), or a new value set in
+    // the loop below.  In the former case the reader will
+    // immediately drop to the next level since NULL sorts after all
+    // keys.  In the latter case the reader will use the new node.
+    max_height_.NoBarrier_Store(reinterpret_cast<void*>(height));
+  }
+
+  x = NewNode(key, height);
+  for (int i = 0; i < height; i++) {
+    // NoBarrier_SetNext() suffices since we will add a barrier when
+    // we publish a pointer to "x" in prev[i].
+    x->NoBarrier_SetNext(i, prev[i]->NoBarrier_Next(i));
+    prev[i]->SetNext(i, x);
+  }
+}
+
+template<typename Key, class Comparator>
+bool SkipList<Key,Comparator>::Contains(const Key& key) const {
+  Node* x = FindGreaterOrEqual(key, NULL);
+  if (x != NULL && Equal(key, x->key)) {
+    return true;
+  } else {
+    return false;
+  }
+}
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_DB_SKIPLIST_H_
diff --git a/depend/zcash/src/leveldb/db/skiplist_test.cc b/depend/zcash/src/leveldb/db/skiplist_test.cc
new file mode 100644
index 000000000..aee1461e1
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/skiplist_test.cc
@@ -0,0 +1,378 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "db/skiplist.h"
+#include <set>
+#include "leveldb/env.h"
+#include "util/arena.h"
+#include "util/hash.h"
+#include "util/random.h"
+#include "util/testharness.h"
+
+namespace leveldb {
+
+typedef uint64_t Key;
+
+struct Comparator {
+  int operator()(const Key& a, const Key& b) const {
+    if (a < b) {
+      return -1;
+    } else if (a > b) {
+      return +1;
+    } else {
+      return 0;
+    }
+  }
+};
+
+class SkipTest { };
+
+TEST(SkipTest, Empty) {
+  Arena arena;
+  Comparator cmp;
+  SkipList<Key, Comparator> list(cmp, &arena);
+  ASSERT_TRUE(!list.Contains(10));
+
+  SkipList<Key, Comparator>::Iterator iter(&list);
+  ASSERT_TRUE(!iter.Valid());
+  iter.SeekToFirst();
+  ASSERT_TRUE(!iter.Valid());
+  iter.Seek(100);
+  ASSERT_TRUE(!iter.Valid());
+  iter.SeekToLast();
+  ASSERT_TRUE(!iter.Valid());
+}
+
+TEST(SkipTest, InsertAndLookup) {
+  const int N = 2000;
+  const int R = 5000;
+  Random rnd(1000);
+  std::set<Key> keys;
+  Arena arena;
+  Comparator cmp;
+  SkipList<Key, Comparator> list(cmp, &arena);
+  for (int i = 0; i < N; i++) {
+    Key key = rnd.Next() % R;
+    if (keys.insert(key).second) {
+      list.Insert(key);
+    }
+  }
+
+  for (int i = 0; i < R; i++) {
+    if (list.Contains(i)) {
+      ASSERT_EQ(keys.count(i), 1);
+    } else {
+      ASSERT_EQ(keys.count(i), 0);
+    }
+  }
+
+  // Simple iterator tests
+  {
+    SkipList<Key, Comparator>::Iterator iter(&list);
+    ASSERT_TRUE(!iter.Valid());
+
+    iter.Seek(0);
+    ASSERT_TRUE(iter.Valid());
+    ASSERT_EQ(*(keys.begin()), iter.key());
+
+    iter.SeekToFirst();
+    ASSERT_TRUE(iter.Valid());
+    ASSERT_EQ(*(keys.begin()), iter.key());
+
+    iter.SeekToLast();
+    ASSERT_TRUE(iter.Valid());
+    ASSERT_EQ(*(keys.rbegin()), iter.key());
+  }
+
+  // Forward iteration test
+  for (int i = 0; i < R; i++) {
+    SkipList<Key, Comparator>::Iterator iter(&list);
+    iter.Seek(i);
+
+    // Compare against model iterator
+    std::set<Key>::iterator model_iter = keys.lower_bound(i);
+    for (int j = 0; j < 3; j++) {
+      if (model_iter == keys.end()) {
+        ASSERT_TRUE(!iter.Valid());
+        break;
+      } else {
+        ASSERT_TRUE(iter.Valid());
+        ASSERT_EQ(*model_iter, iter.key());
+        ++model_iter;
+        iter.Next();
+      }
+    }
+  }
+
+  // Backward iteration test
+  {
+    SkipList<Key, Comparator>::Iterator iter(&list);
+    iter.SeekToLast();
+
+    // Compare against model iterator
+    for (std::set<Key>::reverse_iterator model_iter = keys.rbegin();
+         model_iter != keys.rend();
+         ++model_iter) {
+      ASSERT_TRUE(iter.Valid());
+      ASSERT_EQ(*model_iter, iter.key());
+      iter.Prev();
+    }
+    ASSERT_TRUE(!iter.Valid());
+  }
+}
+
+// We want to make sure that with a single writer and multiple
+// concurrent readers (with no synchronization other than when a
+// reader's iterator is created), the reader always observes all the
+// data that was present in the skip list when the iterator was
+// constructor.  Because insertions are happening concurrently, we may
+// also observe new values that were inserted since the iterator was
+// constructed, but we should never miss any values that were present
+// at iterator construction time.
+//
+// We generate multi-part keys:
+//     <key,gen,hash>
+// where:
+//     key is in range [0..K-1]
+//     gen is a generation number for key
+//     hash is hash(key,gen)
+//
+// The insertion code picks a random key, sets gen to be 1 + the last
+// generation number inserted for that key, and sets hash to Hash(key,gen).
+//
+// At the beginning of a read, we snapshot the last inserted
+// generation number for each key.  We then iterate, including random
+// calls to Next() and Seek().  For every key we encounter, we
+// check that it is either expected given the initial snapshot or has
+// been concurrently added since the iterator started.
+class ConcurrentTest {
+ private:
+  static const uint32_t K = 4;
+
+  static uint64_t key(Key key) { return (key >> 40); }
+  static uint64_t gen(Key key) { return (key >> 8) & 0xffffffffu; }
+  static uint64_t hash(Key key) { return key & 0xff; }
+
+  static uint64_t HashNumbers(uint64_t k, uint64_t g) {
+    uint64_t data[2] = { k, g };
+    return Hash(reinterpret_cast<char*>(data), sizeof(data), 0);
+  }
+
+  static Key MakeKey(uint64_t k, uint64_t g) {
+    assert(sizeof(Key) == sizeof(uint64_t));
+    assert(k <= K);  // We sometimes pass K to seek to the end of the skiplist
+    assert(g <= 0xffffffffu);
+    return ((k << 40) | (g << 8) | (HashNumbers(k, g) & 0xff));
+  }
+
+  static bool IsValidKey(Key k) {
+    return hash(k) == (HashNumbers(key(k), gen(k)) & 0xff);
+  }
+
+  static Key RandomTarget(Random* rnd) {
+    switch (rnd->Next() % 10) {
+      case 0:
+        // Seek to beginning
+        return MakeKey(0, 0);
+      case 1:
+        // Seek to end
+        return MakeKey(K, 0);
+      default:
+        // Seek to middle
+        return MakeKey(rnd->Next() % K, 0);
+    }
+  }
+
+  // Per-key generation
+  struct State {
+    port::AtomicPointer generation[K];
+    void Set(int k, intptr_t v) {
+      generation[k].Release_Store(reinterpret_cast<void*>(v));
+    }
+    intptr_t Get(int k) {
+      return reinterpret_cast<intptr_t>(generation[k].Acquire_Load());
+    }
+
+    State() {
+      for (int k = 0; k < K; k++) {
+        Set(k, 0);
+      }
+    }
+  };
+
+  // Current state of the test
+  State current_;
+
+  Arena arena_;
+
+  // SkipList is not protected by mu_.  We just use a single writer
+  // thread to modify it.
+  SkipList<Key, Comparator> list_;
+
+ public:
+  ConcurrentTest() : list_(Comparator(), &arena_) { }
+
+  // REQUIRES: External synchronization
+  void WriteStep(Random* rnd) {
+    const uint32_t k = rnd->Next() % K;
+    const intptr_t g = current_.Get(k) + 1;
+    const Key key = MakeKey(k, g);
+    list_.Insert(key);
+    current_.Set(k, g);
+  }
+
+  void ReadStep(Random* rnd) {
+    // Remember the initial committed state of the skiplist.
+    State initial_state;
+    for (int k = 0; k < K; k++) {
+      initial_state.Set(k, current_.Get(k));
+    }
+
+    Key pos = RandomTarget(rnd);
+    SkipList<Key, Comparator>::Iterator iter(&list_);
+    iter.Seek(pos);
+    while (true) {
+      Key current;
+      if (!iter.Valid()) {
+        current = MakeKey(K, 0);
+      } else {
+        current = iter.key();
+        ASSERT_TRUE(IsValidKey(current)) << current;
+      }
+      ASSERT_LE(pos, current) << "should not go backwards";
+
+      // Verify that everything in [pos,current) was not present in
+      // initial_state.
+      while (pos < current) {
+        ASSERT_LT(key(pos), K) << pos;
+
+        // Note that generation 0 is never inserted, so it is ok if
+        // <*,0,*> is missing.
+        ASSERT_TRUE((gen(pos) == 0) ||
+                    (gen(pos) > static_cast<Key>(initial_state.Get(key(pos))))
+                    ) << "key: " << key(pos)
+                      << "; gen: " << gen(pos)
+                      << "; initgen: "
+                      << initial_state.Get(key(pos));
+
+        // Advance to next key in the valid key space
+        if (key(pos) < key(current)) {
+          pos = MakeKey(key(pos) + 1, 0);
+        } else {
+          pos = MakeKey(key(pos), gen(pos) + 1);
+        }
+      }
+
+      if (!iter.Valid()) {
+        break;
+      }
+
+      if (rnd->Next() % 2) {
+        iter.Next();
+        pos = MakeKey(key(pos), gen(pos) + 1);
+      } else {
+        Key new_target = RandomTarget(rnd);
+        if (new_target > pos) {
+          pos = new_target;
+          iter.Seek(new_target);
+        }
+      }
+    }
+  }
+};
+const uint32_t ConcurrentTest::K;
+
+// Simple test that does single-threaded testing of the ConcurrentTest
+// scaffolding.
+TEST(SkipTest, ConcurrentWithoutThreads) {
+  ConcurrentTest test;
+  Random rnd(test::RandomSeed());
+  for (int i = 0; i < 10000; i++) {
+    test.ReadStep(&rnd);
+    test.WriteStep(&rnd);
+  }
+}
+
+class TestState {
+ public:
+  ConcurrentTest t_;
+  int seed_;
+  port::AtomicPointer quit_flag_;
+
+  enum ReaderState {
+    STARTING,
+    RUNNING,
+    DONE
+  };
+
+  explicit TestState(int s)
+      : seed_(s),
+        quit_flag_(NULL),
+        state_(STARTING),
+        state_cv_(&mu_) {}
+
+  void Wait(ReaderState s) {
+    mu_.Lock();
+    while (state_ != s) {
+      state_cv_.Wait();
+    }
+    mu_.Unlock();
+  }
+
+  void Change(ReaderState s) {
+    mu_.Lock();
+    state_ = s;
+    state_cv_.Signal();
+    mu_.Unlock();
+  }
+
+ private:
+  port::Mutex mu_;
+  ReaderState state_;
+  port::CondVar state_cv_;
+};
+
+static void ConcurrentReader(void* arg) {
+  TestState* state = reinterpret_cast<TestState*>(arg);
+  Random rnd(state->seed_);
+  int64_t reads = 0;
+  state->Change(TestState::RUNNING);
+  while (!state->quit_flag_.Acquire_Load()) {
+    state->t_.ReadStep(&rnd);
+    ++reads;
+  }
+  state->Change(TestState::DONE);
+}
+
+static void RunConcurrent(int run) {
+  const int seed = test::RandomSeed() + (run * 100);
+  Random rnd(seed);
+  const int N = 1000;
+  const int kSize = 1000;
+  for (int i = 0; i < N; i++) {
+    if ((i % 100) == 0) {
+      fprintf(stderr, "Run %d of %d\n", i, N);
+    }
+    TestState state(seed + 1);
+    Env::Default()->Schedule(ConcurrentReader, &state);
+    state.Wait(TestState::RUNNING);
+    for (int i = 0; i < kSize; i++) {
+      state.t_.WriteStep(&rnd);
+    }
+    state.quit_flag_.Release_Store(&state);  // Any non-NULL arg will do
+    state.Wait(TestState::DONE);
+  }
+}
+
+TEST(SkipTest, Concurrent1) { RunConcurrent(1); }
+TEST(SkipTest, Concurrent2) { RunConcurrent(2); }
+TEST(SkipTest, Concurrent3) { RunConcurrent(3); }
+TEST(SkipTest, Concurrent4) { RunConcurrent(4); }
+TEST(SkipTest, Concurrent5) { RunConcurrent(5); }
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/db/snapshot.h b/depend/zcash/src/leveldb/db/snapshot.h
new file mode 100644
index 000000000..6ed413c42
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/snapshot.h
@@ -0,0 +1,67 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_DB_SNAPSHOT_H_
+#define STORAGE_LEVELDB_DB_SNAPSHOT_H_
+
+#include "db/dbformat.h"
+#include "leveldb/db.h"
+
+namespace leveldb {
+
+class SnapshotList;
+
+// Snapshots are kept in a doubly-linked list in the DB.
+// Each SnapshotImpl corresponds to a particular sequence number.
+class SnapshotImpl : public Snapshot {
+ public:
+  SequenceNumber number_;  // const after creation
+
+ private:
+  friend class SnapshotList;
+
+  // SnapshotImpl is kept in a doubly-linked circular list
+  SnapshotImpl* prev_;
+  SnapshotImpl* next_;
+
+  SnapshotList* list_;                 // just for sanity checks
+};
+
+class SnapshotList {
+ public:
+  SnapshotList() {
+    list_.prev_ = &list_;
+    list_.next_ = &list_;
+  }
+
+  bool empty() const { return list_.next_ == &list_; }
+  SnapshotImpl* oldest() const { assert(!empty()); return list_.next_; }
+  SnapshotImpl* newest() const { assert(!empty()); return list_.prev_; }
+
+  const SnapshotImpl* New(SequenceNumber seq) {
+    SnapshotImpl* s = new SnapshotImpl;
+    s->number_ = seq;
+    s->list_ = this;
+    s->next_ = &list_;
+    s->prev_ = list_.prev_;
+    s->prev_->next_ = s;
+    s->next_->prev_ = s;
+    return s;
+  }
+
+  void Delete(const SnapshotImpl* s) {
+    assert(s->list_ == this);
+    s->prev_->next_ = s->next_;
+    s->next_->prev_ = s->prev_;
+    delete s;
+  }
+
+ private:
+  // Dummy head of doubly-linked list of snapshots
+  SnapshotImpl list_;
+};
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_DB_SNAPSHOT_H_
diff --git a/depend/zcash/src/leveldb/db/table_cache.cc b/depend/zcash/src/leveldb/db/table_cache.cc
new file mode 100644
index 000000000..e3d82cd3e
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/table_cache.cc
@@ -0,0 +1,127 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "db/table_cache.h"
+
+#include "db/filename.h"
+#include "leveldb/env.h"
+#include "leveldb/table.h"
+#include "util/coding.h"
+
+namespace leveldb {
+
+struct TableAndFile {
+  RandomAccessFile* file;
+  Table* table;
+};
+
+static void DeleteEntry(const Slice& key, void* value) {
+  TableAndFile* tf = reinterpret_cast<TableAndFile*>(value);
+  delete tf->table;
+  delete tf->file;
+  delete tf;
+}
+
+static void UnrefEntry(void* arg1, void* arg2) {
+  Cache* cache = reinterpret_cast<Cache*>(arg1);
+  Cache::Handle* h = reinterpret_cast<Cache::Handle*>(arg2);
+  cache->Release(h);
+}
+
+TableCache::TableCache(const std::string& dbname,
+                       const Options* options,
+                       int entries)
+    : env_(options->env),
+      dbname_(dbname),
+      options_(options),
+      cache_(NewLRUCache(entries)) {
+}
+
+TableCache::~TableCache() {
+  delete cache_;
+}
+
+Status TableCache::FindTable(uint64_t file_number, uint64_t file_size,
+                             Cache::Handle** handle) {
+  Status s;
+  char buf[sizeof(file_number)];
+  EncodeFixed64(buf, file_number);
+  Slice key(buf, sizeof(buf));
+  *handle = cache_->Lookup(key);
+  if (*handle == NULL) {
+    std::string fname = TableFileName(dbname_, file_number);
+    RandomAccessFile* file = NULL;
+    Table* table = NULL;
+    s = env_->NewRandomAccessFile(fname, &file);
+    if (!s.ok()) {
+      std::string old_fname = SSTTableFileName(dbname_, file_number);
+      if (env_->NewRandomAccessFile(old_fname, &file).ok()) {
+        s = Status::OK();
+      }
+    }
+    if (s.ok()) {
+      s = Table::Open(*options_, file, file_size, &table);
+    }
+
+    if (!s.ok()) {
+      assert(table == NULL);
+      delete file;
+      // We do not cache error results so that if the error is transient,
+      // or somebody repairs the file, we recover automatically.
+    } else {
+      TableAndFile* tf = new TableAndFile;
+      tf->file = file;
+      tf->table = table;
+      *handle = cache_->Insert(key, tf, 1, &DeleteEntry);
+    }
+  }
+  return s;
+}
+
+Iterator* TableCache::NewIterator(const ReadOptions& options,
+                                  uint64_t file_number,
+                                  uint64_t file_size,
+                                  Table** tableptr) {
+  if (tableptr != NULL) {
+    *tableptr = NULL;
+  }
+
+  Cache::Handle* handle = NULL;
+  Status s = FindTable(file_number, file_size, &handle);
+  if (!s.ok()) {
+    return NewErrorIterator(s);
+  }
+
+  Table* table = reinterpret_cast<TableAndFile*>(cache_->Value(handle))->table;
+  Iterator* result = table->NewIterator(options);
+  result->RegisterCleanup(&UnrefEntry, cache_, handle);
+  if (tableptr != NULL) {
+    *tableptr = table;
+  }
+  return result;
+}
+
+Status TableCache::Get(const ReadOptions& options,
+                       uint64_t file_number,
+                       uint64_t file_size,
+                       const Slice& k,
+                       void* arg,
+                       void (*saver)(void*, const Slice&, const Slice&)) {
+  Cache::Handle* handle = NULL;
+  Status s = FindTable(file_number, file_size, &handle);
+  if (s.ok()) {
+    Table* t = reinterpret_cast<TableAndFile*>(cache_->Value(handle))->table;
+    s = t->InternalGet(options, k, arg, saver);
+    cache_->Release(handle);
+  }
+  return s;
+}
+
+void TableCache::Evict(uint64_t file_number) {
+  char buf[sizeof(file_number)];
+  EncodeFixed64(buf, file_number);
+  cache_->Erase(Slice(buf, sizeof(buf)));
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/db/table_cache.h b/depend/zcash/src/leveldb/db/table_cache.h
new file mode 100644
index 000000000..8cf4aaf12
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/table_cache.h
@@ -0,0 +1,61 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// Thread-safe (provides internal synchronization)
+
+#ifndef STORAGE_LEVELDB_DB_TABLE_CACHE_H_
+#define STORAGE_LEVELDB_DB_TABLE_CACHE_H_
+
+#include <string>
+#include <stdint.h>
+#include "db/dbformat.h"
+#include "leveldb/cache.h"
+#include "leveldb/table.h"
+#include "port/port.h"
+
+namespace leveldb {
+
+class Env;
+
+class TableCache {
+ public:
+  TableCache(const std::string& dbname, const Options* options, int entries);
+  ~TableCache();
+
+  // Return an iterator for the specified file number (the corresponding
+  // file length must be exactly "file_size" bytes).  If "tableptr" is
+  // non-NULL, also sets "*tableptr" to point to the Table object
+  // underlying the returned iterator, or NULL if no Table object underlies
+  // the returned iterator.  The returned "*tableptr" object is owned by
+  // the cache and should not be deleted, and is valid for as long as the
+  // returned iterator is live.
+  Iterator* NewIterator(const ReadOptions& options,
+                        uint64_t file_number,
+                        uint64_t file_size,
+                        Table** tableptr = NULL);
+
+  // If a seek to internal key "k" in specified file finds an entry,
+  // call (*handle_result)(arg, found_key, found_value).
+  Status Get(const ReadOptions& options,
+             uint64_t file_number,
+             uint64_t file_size,
+             const Slice& k,
+             void* arg,
+             void (*handle_result)(void*, const Slice&, const Slice&));
+
+  // Evict any entry for the specified file number
+  void Evict(uint64_t file_number);
+
+ private:
+  Env* const env_;
+  const std::string dbname_;
+  const Options* options_;
+  Cache* cache_;
+
+  Status FindTable(uint64_t file_number, uint64_t file_size, Cache::Handle**);
+};
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_DB_TABLE_CACHE_H_
diff --git a/depend/zcash/src/leveldb/db/version_edit.cc b/depend/zcash/src/leveldb/db/version_edit.cc
new file mode 100644
index 000000000..f10a2d58b
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/version_edit.cc
@@ -0,0 +1,266 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "db/version_edit.h"
+
+#include "db/version_set.h"
+#include "util/coding.h"
+
+namespace leveldb {
+
+// Tag numbers for serialized VersionEdit.  These numbers are written to
+// disk and should not be changed.
+enum Tag {
+  kComparator           = 1,
+  kLogNumber            = 2,
+  kNextFileNumber       = 3,
+  kLastSequence         = 4,
+  kCompactPointer       = 5,
+  kDeletedFile          = 6,
+  kNewFile              = 7,
+  // 8 was used for large value refs
+  kPrevLogNumber        = 9
+};
+
+void VersionEdit::Clear() {
+  comparator_.clear();
+  log_number_ = 0;
+  prev_log_number_ = 0;
+  last_sequence_ = 0;
+  next_file_number_ = 0;
+  has_comparator_ = false;
+  has_log_number_ = false;
+  has_prev_log_number_ = false;
+  has_next_file_number_ = false;
+  has_last_sequence_ = false;
+  deleted_files_.clear();
+  new_files_.clear();
+}
+
+void VersionEdit::EncodeTo(std::string* dst) const {
+  if (has_comparator_) {
+    PutVarint32(dst, kComparator);
+    PutLengthPrefixedSlice(dst, comparator_);
+  }
+  if (has_log_number_) {
+    PutVarint32(dst, kLogNumber);
+    PutVarint64(dst, log_number_);
+  }
+  if (has_prev_log_number_) {
+    PutVarint32(dst, kPrevLogNumber);
+    PutVarint64(dst, prev_log_number_);
+  }
+  if (has_next_file_number_) {
+    PutVarint32(dst, kNextFileNumber);
+    PutVarint64(dst, next_file_number_);
+  }
+  if (has_last_sequence_) {
+    PutVarint32(dst, kLastSequence);
+    PutVarint64(dst, last_sequence_);
+  }
+
+  for (size_t i = 0; i < compact_pointers_.size(); i++) {
+    PutVarint32(dst, kCompactPointer);
+    PutVarint32(dst, compact_pointers_[i].first);  // level
+    PutLengthPrefixedSlice(dst, compact_pointers_[i].second.Encode());
+  }
+
+  for (DeletedFileSet::const_iterator iter = deleted_files_.begin();
+       iter != deleted_files_.end();
+       ++iter) {
+    PutVarint32(dst, kDeletedFile);
+    PutVarint32(dst, iter->first);   // level
+    PutVarint64(dst, iter->second);  // file number
+  }
+
+  for (size_t i = 0; i < new_files_.size(); i++) {
+    const FileMetaData& f = new_files_[i].second;
+    PutVarint32(dst, kNewFile);
+    PutVarint32(dst, new_files_[i].first);  // level
+    PutVarint64(dst, f.number);
+    PutVarint64(dst, f.file_size);
+    PutLengthPrefixedSlice(dst, f.smallest.Encode());
+    PutLengthPrefixedSlice(dst, f.largest.Encode());
+  }
+}
+
+static bool GetInternalKey(Slice* input, InternalKey* dst) {
+  Slice str;
+  if (GetLengthPrefixedSlice(input, &str)) {
+    dst->DecodeFrom(str);
+    return true;
+  } else {
+    return false;
+  }
+}
+
+static bool GetLevel(Slice* input, int* level) {
+  uint32_t v;
+  if (GetVarint32(input, &v) &&
+      v < config::kNumLevels) {
+    *level = v;
+    return true;
+  } else {
+    return false;
+  }
+}
+
+Status VersionEdit::DecodeFrom(const Slice& src) {
+  Clear();
+  Slice input = src;
+  const char* msg = NULL;
+  uint32_t tag;
+
+  // Temporary storage for parsing
+  int level;
+  uint64_t number;
+  FileMetaData f;
+  Slice str;
+  InternalKey key;
+
+  while (msg == NULL && GetVarint32(&input, &tag)) {
+    switch (tag) {
+      case kComparator:
+        if (GetLengthPrefixedSlice(&input, &str)) {
+          comparator_ = str.ToString();
+          has_comparator_ = true;
+        } else {
+          msg = "comparator name";
+        }
+        break;
+
+      case kLogNumber:
+        if (GetVarint64(&input, &log_number_)) {
+          has_log_number_ = true;
+        } else {
+          msg = "log number";
+        }
+        break;
+
+      case kPrevLogNumber:
+        if (GetVarint64(&input, &prev_log_number_)) {
+          has_prev_log_number_ = true;
+        } else {
+          msg = "previous log number";
+        }
+        break;
+
+      case kNextFileNumber:
+        if (GetVarint64(&input, &next_file_number_)) {
+          has_next_file_number_ = true;
+        } else {
+          msg = "next file number";
+        }
+        break;
+
+      case kLastSequence:
+        if (GetVarint64(&input, &last_sequence_)) {
+          has_last_sequence_ = true;
+        } else {
+          msg = "last sequence number";
+        }
+        break;
+
+      case kCompactPointer:
+        if (GetLevel(&input, &level) &&
+            GetInternalKey(&input, &key)) {
+          compact_pointers_.push_back(std::make_pair(level, key));
+        } else {
+          msg = "compaction pointer";
+        }
+        break;
+
+      case kDeletedFile:
+        if (GetLevel(&input, &level) &&
+            GetVarint64(&input, &number)) {
+          deleted_files_.insert(std::make_pair(level, number));
+        } else {
+          msg = "deleted file";
+        }
+        break;
+
+      case kNewFile:
+        if (GetLevel(&input, &level) &&
+            GetVarint64(&input, &f.number) &&
+            GetVarint64(&input, &f.file_size) &&
+            GetInternalKey(&input, &f.smallest) &&
+            GetInternalKey(&input, &f.largest)) {
+          new_files_.push_back(std::make_pair(level, f));
+        } else {
+          msg = "new-file entry";
+        }
+        break;
+
+      default:
+        msg = "unknown tag";
+        break;
+    }
+  }
+
+  if (msg == NULL && !input.empty()) {
+    msg = "invalid tag";
+  }
+
+  Status result;
+  if (msg != NULL) {
+    result = Status::Corruption("VersionEdit", msg);
+  }
+  return result;
+}
+
+std::string VersionEdit::DebugString() const {
+  std::string r;
+  r.append("VersionEdit {");
+  if (has_comparator_) {
+    r.append("\n  Comparator: ");
+    r.append(comparator_);
+  }
+  if (has_log_number_) {
+    r.append("\n  LogNumber: ");
+    AppendNumberTo(&r, log_number_);
+  }
+  if (has_prev_log_number_) {
+    r.append("\n  PrevLogNumber: ");
+    AppendNumberTo(&r, prev_log_number_);
+  }
+  if (has_next_file_number_) {
+    r.append("\n  NextFile: ");
+    AppendNumberTo(&r, next_file_number_);
+  }
+  if (has_last_sequence_) {
+    r.append("\n  LastSeq: ");
+    AppendNumberTo(&r, last_sequence_);
+  }
+  for (size_t i = 0; i < compact_pointers_.size(); i++) {
+    r.append("\n  CompactPointer: ");
+    AppendNumberTo(&r, compact_pointers_[i].first);
+    r.append(" ");
+    r.append(compact_pointers_[i].second.DebugString());
+  }
+  for (DeletedFileSet::const_iterator iter = deleted_files_.begin();
+       iter != deleted_files_.end();
+       ++iter) {
+    r.append("\n  DeleteFile: ");
+    AppendNumberTo(&r, iter->first);
+    r.append(" ");
+    AppendNumberTo(&r, iter->second);
+  }
+  for (size_t i = 0; i < new_files_.size(); i++) {
+    const FileMetaData& f = new_files_[i].second;
+    r.append("\n  AddFile: ");
+    AppendNumberTo(&r, new_files_[i].first);
+    r.append(" ");
+    AppendNumberTo(&r, f.number);
+    r.append(" ");
+    AppendNumberTo(&r, f.file_size);
+    r.append(" ");
+    r.append(f.smallest.DebugString());
+    r.append(" .. ");
+    r.append(f.largest.DebugString());
+  }
+  r.append("\n}\n");
+  return r;
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/db/version_edit.h b/depend/zcash/src/leveldb/db/version_edit.h
new file mode 100644
index 000000000..eaef77b32
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/version_edit.h
@@ -0,0 +1,107 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_DB_VERSION_EDIT_H_
+#define STORAGE_LEVELDB_DB_VERSION_EDIT_H_
+
+#include <set>
+#include <utility>
+#include <vector>
+#include "db/dbformat.h"
+
+namespace leveldb {
+
+class VersionSet;
+
+struct FileMetaData {
+  int refs;
+  int allowed_seeks;          // Seeks allowed until compaction
+  uint64_t number;
+  uint64_t file_size;         // File size in bytes
+  InternalKey smallest;       // Smallest internal key served by table
+  InternalKey largest;        // Largest internal key served by table
+
+  FileMetaData() : refs(0), allowed_seeks(1 << 30), file_size(0) { }
+};
+
+class VersionEdit {
+ public:
+  VersionEdit() { Clear(); }
+  ~VersionEdit() { }
+
+  void Clear();
+
+  void SetComparatorName(const Slice& name) {
+    has_comparator_ = true;
+    comparator_ = name.ToString();
+  }
+  void SetLogNumber(uint64_t num) {
+    has_log_number_ = true;
+    log_number_ = num;
+  }
+  void SetPrevLogNumber(uint64_t num) {
+    has_prev_log_number_ = true;
+    prev_log_number_ = num;
+  }
+  void SetNextFile(uint64_t num) {
+    has_next_file_number_ = true;
+    next_file_number_ = num;
+  }
+  void SetLastSequence(SequenceNumber seq) {
+    has_last_sequence_ = true;
+    last_sequence_ = seq;
+  }
+  void SetCompactPointer(int level, const InternalKey& key) {
+    compact_pointers_.push_back(std::make_pair(level, key));
+  }
+
+  // Add the specified file at the specified number.
+  // REQUIRES: This version has not been saved (see VersionSet::SaveTo)
+  // REQUIRES: "smallest" and "largest" are smallest and largest keys in file
+  void AddFile(int level, uint64_t file,
+               uint64_t file_size,
+               const InternalKey& smallest,
+               const InternalKey& largest) {
+    FileMetaData f;
+    f.number = file;
+    f.file_size = file_size;
+    f.smallest = smallest;
+    f.largest = largest;
+    new_files_.push_back(std::make_pair(level, f));
+  }
+
+  // Delete the specified "file" from the specified "level".
+  void DeleteFile(int level, uint64_t file) {
+    deleted_files_.insert(std::make_pair(level, file));
+  }
+
+  void EncodeTo(std::string* dst) const;
+  Status DecodeFrom(const Slice& src);
+
+  std::string DebugString() const;
+
+ private:
+  friend class VersionSet;
+
+  typedef std::set< std::pair<int, uint64_t> > DeletedFileSet;
+
+  std::string comparator_;
+  uint64_t log_number_;
+  uint64_t prev_log_number_;
+  uint64_t next_file_number_;
+  SequenceNumber last_sequence_;
+  bool has_comparator_;
+  bool has_log_number_;
+  bool has_prev_log_number_;
+  bool has_next_file_number_;
+  bool has_last_sequence_;
+
+  std::vector< std::pair<int, InternalKey> > compact_pointers_;
+  DeletedFileSet deleted_files_;
+  std::vector< std::pair<int, FileMetaData> > new_files_;
+};
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_DB_VERSION_EDIT_H_
diff --git a/depend/zcash/src/leveldb/db/version_edit_test.cc b/depend/zcash/src/leveldb/db/version_edit_test.cc
new file mode 100644
index 000000000..280310b49
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/version_edit_test.cc
@@ -0,0 +1,46 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "db/version_edit.h"
+#include "util/testharness.h"
+
+namespace leveldb {
+
+static void TestEncodeDecode(const VersionEdit& edit) {
+  std::string encoded, encoded2;
+  edit.EncodeTo(&encoded);
+  VersionEdit parsed;
+  Status s = parsed.DecodeFrom(encoded);
+  ASSERT_TRUE(s.ok()) << s.ToString();
+  parsed.EncodeTo(&encoded2);
+  ASSERT_EQ(encoded, encoded2);
+}
+
+class VersionEditTest { };
+
+TEST(VersionEditTest, EncodeDecode) {
+  static const uint64_t kBig = 1ull << 50;
+
+  VersionEdit edit;
+  for (int i = 0; i < 4; i++) {
+    TestEncodeDecode(edit);
+    edit.AddFile(3, kBig + 300 + i, kBig + 400 + i,
+                 InternalKey("foo", kBig + 500 + i, kTypeValue),
+                 InternalKey("zoo", kBig + 600 + i, kTypeDeletion));
+    edit.DeleteFile(4, kBig + 700 + i);
+    edit.SetCompactPointer(i, InternalKey("x", kBig + 900 + i, kTypeValue));
+  }
+
+  edit.SetComparatorName("foo");
+  edit.SetLogNumber(kBig + 100);
+  edit.SetNextFile(kBig + 200);
+  edit.SetLastSequence(kBig + 1000);
+  TestEncodeDecode(edit);
+}
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/db/version_set.cc b/depend/zcash/src/leveldb/db/version_set.cc
new file mode 100644
index 000000000..2cb6d80ed
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/version_set.cc
@@ -0,0 +1,1535 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "db/version_set.h"
+
+#include <algorithm>
+#include <stdio.h>
+#include "db/filename.h"
+#include "db/log_reader.h"
+#include "db/log_writer.h"
+#include "db/memtable.h"
+#include "db/table_cache.h"
+#include "leveldb/env.h"
+#include "leveldb/table_builder.h"
+#include "table/merger.h"
+#include "table/two_level_iterator.h"
+#include "util/coding.h"
+#include "util/logging.h"
+
+namespace leveldb {
+
+static size_t TargetFileSize(const Options* options) {
+  return options->max_file_size;
+}
+
+// Maximum bytes of overlaps in grandparent (i.e., level+2) before we
+// stop building a single file in a level->level+1 compaction.
+static int64_t MaxGrandParentOverlapBytes(const Options* options) {
+  return 10 * TargetFileSize(options);
+}
+
+// Maximum number of bytes in all compacted files.  We avoid expanding
+// the lower level file set of a compaction if it would make the
+// total compaction cover more than this many bytes.
+static int64_t ExpandedCompactionByteSizeLimit(const Options* options) {
+  return 25 * TargetFileSize(options);
+}
+
+static double MaxBytesForLevel(const Options* options, int level) {
+  // Note: the result for level zero is not really used since we set
+  // the level-0 compaction threshold based on number of files.
+
+  // Result for both level-0 and level-1
+  double result = 10. * 1048576.0;
+  while (level > 1) {
+    result *= 10;
+    level--;
+  }
+  return result;
+}
+
+static uint64_t MaxFileSizeForLevel(const Options* options, int level) {
+  // We could vary per level to reduce number of files?
+  return TargetFileSize(options);
+}
+
+static int64_t TotalFileSize(const std::vector<FileMetaData*>& files) {
+  int64_t sum = 0;
+  for (size_t i = 0; i < files.size(); i++) {
+    sum += files[i]->file_size;
+  }
+  return sum;
+}
+
+Version::~Version() {
+  assert(refs_ == 0);
+
+  // Remove from linked list
+  prev_->next_ = next_;
+  next_->prev_ = prev_;
+
+  // Drop references to files
+  for (int level = 0; level < config::kNumLevels; level++) {
+    for (size_t i = 0; i < files_[level].size(); i++) {
+      FileMetaData* f = files_[level][i];
+      assert(f->refs > 0);
+      f->refs--;
+      if (f->refs <= 0) {
+        delete f;
+      }
+    }
+  }
+}
+
+int FindFile(const InternalKeyComparator& icmp,
+             const std::vector<FileMetaData*>& files,
+             const Slice& key) {
+  uint32_t left = 0;
+  uint32_t right = files.size();
+  while (left < right) {
+    uint32_t mid = (left + right) / 2;
+    const FileMetaData* f = files[mid];
+    if (icmp.InternalKeyComparator::Compare(f->largest.Encode(), key) < 0) {
+      // Key at "mid.largest" is < "target".  Therefore all
+      // files at or before "mid" are uninteresting.
+      left = mid + 1;
+    } else {
+      // Key at "mid.largest" is >= "target".  Therefore all files
+      // after "mid" are uninteresting.
+      right = mid;
+    }
+  }
+  return right;
+}
+
+static bool AfterFile(const Comparator* ucmp,
+                      const Slice* user_key, const FileMetaData* f) {
+  // NULL user_key occurs before all keys and is therefore never after *f
+  return (user_key != NULL &&
+          ucmp->Compare(*user_key, f->largest.user_key()) > 0);
+}
+
+static bool BeforeFile(const Comparator* ucmp,
+                       const Slice* user_key, const FileMetaData* f) {
+  // NULL user_key occurs after all keys and is therefore never before *f
+  return (user_key != NULL &&
+          ucmp->Compare(*user_key, f->smallest.user_key()) < 0);
+}
+
+bool SomeFileOverlapsRange(
+    const InternalKeyComparator& icmp,
+    bool disjoint_sorted_files,
+    const std::vector<FileMetaData*>& files,
+    const Slice* smallest_user_key,
+    const Slice* largest_user_key) {
+  const Comparator* ucmp = icmp.user_comparator();
+  if (!disjoint_sorted_files) {
+    // Need to check against all files
+    for (size_t i = 0; i < files.size(); i++) {
+      const FileMetaData* f = files[i];
+      if (AfterFile(ucmp, smallest_user_key, f) ||
+          BeforeFile(ucmp, largest_user_key, f)) {
+        // No overlap
+      } else {
+        return true;  // Overlap
+      }
+    }
+    return false;
+  }
+
+  // Binary search over file list
+  uint32_t index = 0;
+  if (smallest_user_key != NULL) {
+    // Find the earliest possible internal key for smallest_user_key
+    InternalKey small(*smallest_user_key, kMaxSequenceNumber,kValueTypeForSeek);
+    index = FindFile(icmp, files, small.Encode());
+  }
+
+  if (index >= files.size()) {
+    // beginning of range is after all files, so no overlap.
+    return false;
+  }
+
+  return !BeforeFile(ucmp, largest_user_key, files[index]);
+}
+
+// An internal iterator.  For a given version/level pair, yields
+// information about the files in the level.  For a given entry, key()
+// is the largest key that occurs in the file, and value() is an
+// 16-byte value containing the file number and file size, both
+// encoded using EncodeFixed64.
+class Version::LevelFileNumIterator : public Iterator {
+ public:
+  LevelFileNumIterator(const InternalKeyComparator& icmp,
+                       const std::vector<FileMetaData*>* flist)
+      : icmp_(icmp),
+        flist_(flist),
+        index_(flist->size()) {        // Marks as invalid
+  }
+  virtual bool Valid() const {
+    return index_ < flist_->size();
+  }
+  virtual void Seek(const Slice& target) {
+    index_ = FindFile(icmp_, *flist_, target);
+  }
+  virtual void SeekToFirst() { index_ = 0; }
+  virtual void SeekToLast() {
+    index_ = flist_->empty() ? 0 : flist_->size() - 1;
+  }
+  virtual void Next() {
+    assert(Valid());
+    index_++;
+  }
+  virtual void Prev() {
+    assert(Valid());
+    if (index_ == 0) {
+      index_ = flist_->size();  // Marks as invalid
+    } else {
+      index_--;
+    }
+  }
+  Slice key() const {
+    assert(Valid());
+    return (*flist_)[index_]->largest.Encode();
+  }
+  Slice value() const {
+    assert(Valid());
+    EncodeFixed64(value_buf_, (*flist_)[index_]->number);
+    EncodeFixed64(value_buf_+8, (*flist_)[index_]->file_size);
+    return Slice(value_buf_, sizeof(value_buf_));
+  }
+  virtual Status status() const { return Status::OK(); }
+ private:
+  const InternalKeyComparator icmp_;
+  const std::vector<FileMetaData*>* const flist_;
+  uint32_t index_;
+
+  // Backing store for value().  Holds the file number and size.
+  mutable char value_buf_[16];
+};
+
+static Iterator* GetFileIterator(void* arg,
+                                 const ReadOptions& options,
+                                 const Slice& file_value) {
+  TableCache* cache = reinterpret_cast<TableCache*>(arg);
+  if (file_value.size() != 16) {
+    return NewErrorIterator(
+        Status::Corruption("FileReader invoked with unexpected value"));
+  } else {
+    return cache->NewIterator(options,
+                              DecodeFixed64(file_value.data()),
+                              DecodeFixed64(file_value.data() + 8));
+  }
+}
+
+Iterator* Version::NewConcatenatingIterator(const ReadOptions& options,
+                                            int level) const {
+  return NewTwoLevelIterator(
+      new LevelFileNumIterator(vset_->icmp_, &files_[level]),
+      &GetFileIterator, vset_->table_cache_, options);
+}
+
+void Version::AddIterators(const ReadOptions& options,
+                           std::vector<Iterator*>* iters) {
+  // Merge all level zero files together since they may overlap
+  for (size_t i = 0; i < files_[0].size(); i++) {
+    iters->push_back(
+        vset_->table_cache_->NewIterator(
+            options, files_[0][i]->number, files_[0][i]->file_size));
+  }
+
+  // For levels > 0, we can use a concatenating iterator that sequentially
+  // walks through the non-overlapping files in the level, opening them
+  // lazily.
+  for (int level = 1; level < config::kNumLevels; level++) {
+    if (!files_[level].empty()) {
+      iters->push_back(NewConcatenatingIterator(options, level));
+    }
+  }
+}
+
+// Callback from TableCache::Get()
+namespace {
+enum SaverState {
+  kNotFound,
+  kFound,
+  kDeleted,
+  kCorrupt,
+};
+struct Saver {
+  SaverState state;
+  const Comparator* ucmp;
+  Slice user_key;
+  std::string* value;
+};
+}
+static void SaveValue(void* arg, const Slice& ikey, const Slice& v) {
+  Saver* s = reinterpret_cast<Saver*>(arg);
+  ParsedInternalKey parsed_key;
+  if (!ParseInternalKey(ikey, &parsed_key)) {
+    s->state = kCorrupt;
+  } else {
+    if (s->ucmp->Compare(parsed_key.user_key, s->user_key) == 0) {
+      s->state = (parsed_key.type == kTypeValue) ? kFound : kDeleted;
+      if (s->state == kFound) {
+        s->value->assign(v.data(), v.size());
+      }
+    }
+  }
+}
+
+static bool NewestFirst(FileMetaData* a, FileMetaData* b) {
+  return a->number > b->number;
+}
+
+void Version::ForEachOverlapping(Slice user_key, Slice internal_key,
+                                 void* arg,
+                                 bool (*func)(void*, int, FileMetaData*)) {
+  // TODO(sanjay): Change Version::Get() to use this function.
+  const Comparator* ucmp = vset_->icmp_.user_comparator();
+
+  // Search level-0 in order from newest to oldest.
+  std::vector<FileMetaData*> tmp;
+  tmp.reserve(files_[0].size());
+  for (uint32_t i = 0; i < files_[0].size(); i++) {
+    FileMetaData* f = files_[0][i];
+    if (ucmp->Compare(user_key, f->smallest.user_key()) >= 0 &&
+        ucmp->Compare(user_key, f->largest.user_key()) <= 0) {
+      tmp.push_back(f);
+    }
+  }
+  if (!tmp.empty()) {
+    std::sort(tmp.begin(), tmp.end(), NewestFirst);
+    for (uint32_t i = 0; i < tmp.size(); i++) {
+      if (!(*func)(arg, 0, tmp[i])) {
+        return;
+      }
+    }
+  }
+
+  // Search other levels.
+  for (int level = 1; level < config::kNumLevels; level++) {
+    size_t num_files = files_[level].size();
+    if (num_files == 0) continue;
+
+    // Binary search to find earliest index whose largest key >= internal_key.
+    uint32_t index = FindFile(vset_->icmp_, files_[level], internal_key);
+    if (index < num_files) {
+      FileMetaData* f = files_[level][index];
+      if (ucmp->Compare(user_key, f->smallest.user_key()) < 0) {
+        // All of "f" is past any data for user_key
+      } else {
+        if (!(*func)(arg, level, f)) {
+          return;
+        }
+      }
+    }
+  }
+}
+
+Status Version::Get(const ReadOptions& options,
+                    const LookupKey& k,
+                    std::string* value,
+                    GetStats* stats) {
+  Slice ikey = k.internal_key();
+  Slice user_key = k.user_key();
+  const Comparator* ucmp = vset_->icmp_.user_comparator();
+  Status s;
+
+  stats->seek_file = NULL;
+  stats->seek_file_level = -1;
+  FileMetaData* last_file_read = NULL;
+  int last_file_read_level = -1;
+
+  // We can search level-by-level since entries never hop across
+  // levels.  Therefore we are guaranteed that if we find data
+  // in an smaller level, later levels are irrelevant.
+  std::vector<FileMetaData*> tmp;
+  FileMetaData* tmp2;
+  for (int level = 0; level < config::kNumLevels; level++) {
+    size_t num_files = files_[level].size();
+    if (num_files == 0) continue;
+
+    // Get the list of files to search in this level
+    FileMetaData* const* files = &files_[level][0];
+    if (level == 0) {
+      // Level-0 files may overlap each other.  Find all files that
+      // overlap user_key and process them in order from newest to oldest.
+      tmp.reserve(num_files);
+      for (uint32_t i = 0; i < num_files; i++) {
+        FileMetaData* f = files[i];
+        if (ucmp->Compare(user_key, f->smallest.user_key()) >= 0 &&
+            ucmp->Compare(user_key, f->largest.user_key()) <= 0) {
+          tmp.push_back(f);
+        }
+      }
+      if (tmp.empty()) continue;
+
+      std::sort(tmp.begin(), tmp.end(), NewestFirst);
+      files = &tmp[0];
+      num_files = tmp.size();
+    } else {
+      // Binary search to find earliest index whose largest key >= ikey.
+      uint32_t index = FindFile(vset_->icmp_, files_[level], ikey);
+      if (index >= num_files) {
+        files = NULL;
+        num_files = 0;
+      } else {
+        tmp2 = files[index];
+        if (ucmp->Compare(user_key, tmp2->smallest.user_key()) < 0) {
+          // All of "tmp2" is past any data for user_key
+          files = NULL;
+          num_files = 0;
+        } else {
+          files = &tmp2;
+          num_files = 1;
+        }
+      }
+    }
+
+    for (uint32_t i = 0; i < num_files; ++i) {
+      if (last_file_read != NULL && stats->seek_file == NULL) {
+        // We have had more than one seek for this read.  Charge the 1st file.
+        stats->seek_file = last_file_read;
+        stats->seek_file_level = last_file_read_level;
+      }
+
+      FileMetaData* f = files[i];
+      last_file_read = f;
+      last_file_read_level = level;
+
+      Saver saver;
+      saver.state = kNotFound;
+      saver.ucmp = ucmp;
+      saver.user_key = user_key;
+      saver.value = value;
+      s = vset_->table_cache_->Get(options, f->number, f->file_size,
+                                   ikey, &saver, SaveValue);
+      if (!s.ok()) {
+        return s;
+      }
+      switch (saver.state) {
+        case kNotFound:
+          break;      // Keep searching in other files
+        case kFound:
+          return s;
+        case kDeleted:
+          s = Status::NotFound(Slice());  // Use empty error message for speed
+          return s;
+        case kCorrupt:
+          s = Status::Corruption("corrupted key for ", user_key);
+          return s;
+      }
+    }
+  }
+
+  return Status::NotFound(Slice());  // Use an empty error message for speed
+}
+
+bool Version::UpdateStats(const GetStats& stats) {
+  FileMetaData* f = stats.seek_file;
+  if (f != NULL) {
+    f->allowed_seeks--;
+    if (f->allowed_seeks <= 0 && file_to_compact_ == NULL) {
+      file_to_compact_ = f;
+      file_to_compact_level_ = stats.seek_file_level;
+      return true;
+    }
+  }
+  return false;
+}
+
+bool Version::RecordReadSample(Slice internal_key) {
+  ParsedInternalKey ikey;
+  if (!ParseInternalKey(internal_key, &ikey)) {
+    return false;
+  }
+
+  struct State {
+    GetStats stats;  // Holds first matching file
+    int matches;
+
+    static bool Match(void* arg, int level, FileMetaData* f) {
+      State* state = reinterpret_cast<State*>(arg);
+      state->matches++;
+      if (state->matches == 1) {
+        // Remember first match.
+        state->stats.seek_file = f;
+        state->stats.seek_file_level = level;
+      }
+      // We can stop iterating once we have a second match.
+      return state->matches < 2;
+    }
+  };
+
+  State state;
+  state.matches = 0;
+  ForEachOverlapping(ikey.user_key, internal_key, &state, &State::Match);
+
+  // Must have at least two matches since we want to merge across
+  // files. But what if we have a single file that contains many
+  // overwrites and deletions?  Should we have another mechanism for
+  // finding such files?
+  if (state.matches >= 2) {
+    // 1MB cost is about 1 seek (see comment in Builder::Apply).
+    return UpdateStats(state.stats);
+  }
+  return false;
+}
+
+void Version::Ref() {
+  ++refs_;
+}
+
+void Version::Unref() {
+  assert(this != &vset_->dummy_versions_);
+  assert(refs_ >= 1);
+  --refs_;
+  if (refs_ == 0) {
+    delete this;
+  }
+}
+
+bool Version::OverlapInLevel(int level,
+                             const Slice* smallest_user_key,
+                             const Slice* largest_user_key) {
+  return SomeFileOverlapsRange(vset_->icmp_, (level > 0), files_[level],
+                               smallest_user_key, largest_user_key);
+}
+
+int Version::PickLevelForMemTableOutput(
+    const Slice& smallest_user_key,
+    const Slice& largest_user_key) {
+  int level = 0;
+  if (!OverlapInLevel(0, &smallest_user_key, &largest_user_key)) {
+    // Push to next level if there is no overlap in next level,
+    // and the #bytes overlapping in the level after that are limited.
+    InternalKey start(smallest_user_key, kMaxSequenceNumber, kValueTypeForSeek);
+    InternalKey limit(largest_user_key, 0, static_cast<ValueType>(0));
+    std::vector<FileMetaData*> overlaps;
+    while (level < config::kMaxMemCompactLevel) {
+      if (OverlapInLevel(level + 1, &smallest_user_key, &largest_user_key)) {
+        break;
+      }
+      if (level + 2 < config::kNumLevels) {
+        // Check that file does not overlap too many grandparent bytes.
+        GetOverlappingInputs(level + 2, &start, &limit, &overlaps);
+        const int64_t sum = TotalFileSize(overlaps);
+        if (sum > MaxGrandParentOverlapBytes(vset_->options_)) {
+          break;
+        }
+      }
+      level++;
+    }
+  }
+  return level;
+}
+
+// Store in "*inputs" all files in "level" that overlap [begin,end]
+void Version::GetOverlappingInputs(
+    int level,
+    const InternalKey* begin,
+    const InternalKey* end,
+    std::vector<FileMetaData*>* inputs) {
+  assert(level >= 0);
+  assert(level < config::kNumLevels);
+  inputs->clear();
+  Slice user_begin, user_end;
+  if (begin != NULL) {
+    user_begin = begin->user_key();
+  }
+  if (end != NULL) {
+    user_end = end->user_key();
+  }
+  const Comparator* user_cmp = vset_->icmp_.user_comparator();
+  for (size_t i = 0; i < files_[level].size(); ) {
+    FileMetaData* f = files_[level][i++];
+    const Slice file_start = f->smallest.user_key();
+    const Slice file_limit = f->largest.user_key();
+    if (begin != NULL && user_cmp->Compare(file_limit, user_begin) < 0) {
+      // "f" is completely before specified range; skip it
+    } else if (end != NULL && user_cmp->Compare(file_start, user_end) > 0) {
+      // "f" is completely after specified range; skip it
+    } else {
+      inputs->push_back(f);
+      if (level == 0) {
+        // Level-0 files may overlap each other.  So check if the newly
+        // added file has expanded the range.  If so, restart search.
+        if (begin != NULL && user_cmp->Compare(file_start, user_begin) < 0) {
+          user_begin = file_start;
+          inputs->clear();
+          i = 0;
+        } else if (end != NULL && user_cmp->Compare(file_limit, user_end) > 0) {
+          user_end = file_limit;
+          inputs->clear();
+          i = 0;
+        }
+      }
+    }
+  }
+}
+
+std::string Version::DebugString() const {
+  std::string r;
+  for (int level = 0; level < config::kNumLevels; level++) {
+    // E.g.,
+    //   --- level 1 ---
+    //   17:123['a' .. 'd']
+    //   20:43['e' .. 'g']
+    r.append("--- level ");
+    AppendNumberTo(&r, level);
+    r.append(" ---\n");
+    const std::vector<FileMetaData*>& files = files_[level];
+    for (size_t i = 0; i < files.size(); i++) {
+      r.push_back(' ');
+      AppendNumberTo(&r, files[i]->number);
+      r.push_back(':');
+      AppendNumberTo(&r, files[i]->file_size);
+      r.append("[");
+      r.append(files[i]->smallest.DebugString());
+      r.append(" .. ");
+      r.append(files[i]->largest.DebugString());
+      r.append("]\n");
+    }
+  }
+  return r;
+}
+
+// A helper class so we can efficiently apply a whole sequence
+// of edits to a particular state without creating intermediate
+// Versions that contain full copies of the intermediate state.
+class VersionSet::Builder {
+ private:
+  // Helper to sort by v->files_[file_number].smallest
+  struct BySmallestKey {
+    const InternalKeyComparator* internal_comparator;
+
+    bool operator()(FileMetaData* f1, FileMetaData* f2) const {
+      int r = internal_comparator->Compare(f1->smallest, f2->smallest);
+      if (r != 0) {
+        return (r < 0);
+      } else {
+        // Break ties by file number
+        return (f1->number < f2->number);
+      }
+    }
+  };
+
+  typedef std::set<FileMetaData*, BySmallestKey> FileSet;
+  struct LevelState {
+    std::set<uint64_t> deleted_files;
+    FileSet* added_files;
+  };
+
+  VersionSet* vset_;
+  Version* base_;
+  LevelState levels_[config::kNumLevels];
+
+ public:
+  // Initialize a builder with the files from *base and other info from *vset
+  Builder(VersionSet* vset, Version* base)
+      : vset_(vset),
+        base_(base) {
+    base_->Ref();
+    BySmallestKey cmp;
+    cmp.internal_comparator = &vset_->icmp_;
+    for (int level = 0; level < config::kNumLevels; level++) {
+      levels_[level].added_files = new FileSet(cmp);
+    }
+  }
+
+  ~Builder() {
+    for (int level = 0; level < config::kNumLevels; level++) {
+      const FileSet* added = levels_[level].added_files;
+      std::vector<FileMetaData*> to_unref;
+      to_unref.reserve(added->size());
+      for (FileSet::const_iterator it = added->begin();
+          it != added->end(); ++it) {
+        to_unref.push_back(*it);
+      }
+      delete added;
+      for (uint32_t i = 0; i < to_unref.size(); i++) {
+        FileMetaData* f = to_unref[i];
+        f->refs--;
+        if (f->refs <= 0) {
+          delete f;
+        }
+      }
+    }
+    base_->Unref();
+  }
+
+  // Apply all of the edits in *edit to the current state.
+  void Apply(VersionEdit* edit) {
+    // Update compaction pointers
+    for (size_t i = 0; i < edit->compact_pointers_.size(); i++) {
+      const int level = edit->compact_pointers_[i].first;
+      vset_->compact_pointer_[level] =
+          edit->compact_pointers_[i].second.Encode().ToString();
+    }
+
+    // Delete files
+    const VersionEdit::DeletedFileSet& del = edit->deleted_files_;
+    for (VersionEdit::DeletedFileSet::const_iterator iter = del.begin();
+         iter != del.end();
+         ++iter) {
+      const int level = iter->first;
+      const uint64_t number = iter->second;
+      levels_[level].deleted_files.insert(number);
+    }
+
+    // Add new files
+    for (size_t i = 0; i < edit->new_files_.size(); i++) {
+      const int level = edit->new_files_[i].first;
+      FileMetaData* f = new FileMetaData(edit->new_files_[i].second);
+      f->refs = 1;
+
+      // We arrange to automatically compact this file after
+      // a certain number of seeks.  Let's assume:
+      //   (1) One seek costs 10ms
+      //   (2) Writing or reading 1MB costs 10ms (100MB/s)
+      //   (3) A compaction of 1MB does 25MB of IO:
+      //         1MB read from this level
+      //         10-12MB read from next level (boundaries may be misaligned)
+      //         10-12MB written to next level
+      // This implies that 25 seeks cost the same as the compaction
+      // of 1MB of data.  I.e., one seek costs approximately the
+      // same as the compaction of 40KB of data.  We are a little
+      // conservative and allow approximately one seek for every 16KB
+      // of data before triggering a compaction.
+      f->allowed_seeks = (f->file_size / 16384);
+      if (f->allowed_seeks < 100) f->allowed_seeks = 100;
+
+      levels_[level].deleted_files.erase(f->number);
+      levels_[level].added_files->insert(f);
+    }
+  }
+
+  // Save the current state in *v.
+  void SaveTo(Version* v) {
+    BySmallestKey cmp;
+    cmp.internal_comparator = &vset_->icmp_;
+    for (int level = 0; level < config::kNumLevels; level++) {
+      // Merge the set of added files with the set of pre-existing files.
+      // Drop any deleted files.  Store the result in *v.
+      const std::vector<FileMetaData*>& base_files = base_->files_[level];
+      std::vector<FileMetaData*>::const_iterator base_iter = base_files.begin();
+      std::vector<FileMetaData*>::const_iterator base_end = base_files.end();
+      const FileSet* added = levels_[level].added_files;
+      v->files_[level].reserve(base_files.size() + added->size());
+      for (FileSet::const_iterator added_iter = added->begin();
+           added_iter != added->end();
+           ++added_iter) {
+        // Add all smaller files listed in base_
+        for (std::vector<FileMetaData*>::const_iterator bpos
+                 = std::upper_bound(base_iter, base_end, *added_iter, cmp);
+             base_iter != bpos;
+             ++base_iter) {
+          MaybeAddFile(v, level, *base_iter);
+        }
+
+        MaybeAddFile(v, level, *added_iter);
+      }
+
+      // Add remaining base files
+      for (; base_iter != base_end; ++base_iter) {
+        MaybeAddFile(v, level, *base_iter);
+      }
+
+#ifndef NDEBUG
+      // Make sure there is no overlap in levels > 0
+      if (level > 0) {
+        for (uint32_t i = 1; i < v->files_[level].size(); i++) {
+          const InternalKey& prev_end = v->files_[level][i-1]->largest;
+          const InternalKey& this_begin = v->files_[level][i]->smallest;
+          if (vset_->icmp_.Compare(prev_end, this_begin) >= 0) {
+            fprintf(stderr, "overlapping ranges in same level %s vs. %s\n",
+                    prev_end.DebugString().c_str(),
+                    this_begin.DebugString().c_str());
+            abort();
+          }
+        }
+      }
+#endif
+    }
+  }
+
+  void MaybeAddFile(Version* v, int level, FileMetaData* f) {
+    if (levels_[level].deleted_files.count(f->number) > 0) {
+      // File is deleted: do nothing
+    } else {
+      std::vector<FileMetaData*>* files = &v->files_[level];
+      if (level > 0 && !files->empty()) {
+        // Must not overlap
+        assert(vset_->icmp_.Compare((*files)[files->size()-1]->largest,
+                                    f->smallest) < 0);
+      }
+      f->refs++;
+      files->push_back(f);
+    }
+  }
+};
+
+VersionSet::VersionSet(const std::string& dbname,
+                       const Options* options,
+                       TableCache* table_cache,
+                       const InternalKeyComparator* cmp)
+    : env_(options->env),
+      dbname_(dbname),
+      options_(options),
+      table_cache_(table_cache),
+      icmp_(*cmp),
+      next_file_number_(2),
+      manifest_file_number_(0),  // Filled by Recover()
+      last_sequence_(0),
+      log_number_(0),
+      prev_log_number_(0),
+      descriptor_file_(NULL),
+      descriptor_log_(NULL),
+      dummy_versions_(this),
+      current_(NULL) {
+  AppendVersion(new Version(this));
+}
+
+VersionSet::~VersionSet() {
+  current_->Unref();
+  assert(dummy_versions_.next_ == &dummy_versions_);  // List must be empty
+  delete descriptor_log_;
+  delete descriptor_file_;
+}
+
+void VersionSet::AppendVersion(Version* v) {
+  // Make "v" current
+  assert(v->refs_ == 0);
+  assert(v != current_);
+  if (current_ != NULL) {
+    current_->Unref();
+  }
+  current_ = v;
+  v->Ref();
+
+  // Append to linked list
+  v->prev_ = dummy_versions_.prev_;
+  v->next_ = &dummy_versions_;
+  v->prev_->next_ = v;
+  v->next_->prev_ = v;
+}
+
+Status VersionSet::LogAndApply(VersionEdit* edit, port::Mutex* mu) {
+  if (edit->has_log_number_) {
+    assert(edit->log_number_ >= log_number_);
+    assert(edit->log_number_ < next_file_number_);
+  } else {
+    edit->SetLogNumber(log_number_);
+  }
+
+  if (!edit->has_prev_log_number_) {
+    edit->SetPrevLogNumber(prev_log_number_);
+  }
+
+  edit->SetNextFile(next_file_number_);
+  edit->SetLastSequence(last_sequence_);
+
+  Version* v = new Version(this);
+  {
+    Builder builder(this, current_);
+    builder.Apply(edit);
+    builder.SaveTo(v);
+  }
+  Finalize(v);
+
+  // Initialize new descriptor log file if necessary by creating
+  // a temporary file that contains a snapshot of the current version.
+  std::string new_manifest_file;
+  Status s;
+  if (descriptor_log_ == NULL) {
+    // No reason to unlock *mu here since we only hit this path in the
+    // first call to LogAndApply (when opening the database).
+    assert(descriptor_file_ == NULL);
+    new_manifest_file = DescriptorFileName(dbname_, manifest_file_number_);
+    edit->SetNextFile(next_file_number_);
+    s = env_->NewWritableFile(new_manifest_file, &descriptor_file_);
+    if (s.ok()) {
+      descriptor_log_ = new log::Writer(descriptor_file_);
+      s = WriteSnapshot(descriptor_log_);
+    }
+  }
+
+  // Unlock during expensive MANIFEST log write
+  {
+    mu->Unlock();
+
+    // Write new record to MANIFEST log
+    if (s.ok()) {
+      std::string record;
+      edit->EncodeTo(&record);
+      s = descriptor_log_->AddRecord(record);
+      if (s.ok()) {
+        s = descriptor_file_->Sync();
+      }
+      if (!s.ok()) {
+        Log(options_->info_log, "MANIFEST write: %s\n", s.ToString().c_str());
+      }
+    }
+
+    // If we just created a new descriptor file, install it by writing a
+    // new CURRENT file that points to it.
+    if (s.ok() && !new_manifest_file.empty()) {
+      s = SetCurrentFile(env_, dbname_, manifest_file_number_);
+    }
+
+    mu->Lock();
+  }
+
+  // Install the new version
+  if (s.ok()) {
+    AppendVersion(v);
+    log_number_ = edit->log_number_;
+    prev_log_number_ = edit->prev_log_number_;
+  } else {
+    delete v;
+    if (!new_manifest_file.empty()) {
+      delete descriptor_log_;
+      delete descriptor_file_;
+      descriptor_log_ = NULL;
+      descriptor_file_ = NULL;
+      env_->DeleteFile(new_manifest_file);
+    }
+  }
+
+  return s;
+}
+
+Status VersionSet::Recover(bool *save_manifest) {
+  struct LogReporter : public log::Reader::Reporter {
+    Status* status;
+    virtual void Corruption(size_t bytes, const Status& s) {
+      if (this->status->ok()) *this->status = s;
+    }
+  };
+
+  // Read "CURRENT" file, which contains a pointer to the current manifest file
+  std::string current;
+  Status s = ReadFileToString(env_, CurrentFileName(dbname_), &current);
+  if (!s.ok()) {
+    return s;
+  }
+  if (current.empty() || current[current.size()-1] != '\n') {
+    return Status::Corruption("CURRENT file does not end with newline");
+  }
+  current.resize(current.size() - 1);
+
+  std::string dscname = dbname_ + "/" + current;
+  SequentialFile* file;
+  s = env_->NewSequentialFile(dscname, &file);
+  if (!s.ok()) {
+    return s;
+  }
+
+  bool have_log_number = false;
+  bool have_prev_log_number = false;
+  bool have_next_file = false;
+  bool have_last_sequence = false;
+  uint64_t next_file = 0;
+  uint64_t last_sequence = 0;
+  uint64_t log_number = 0;
+  uint64_t prev_log_number = 0;
+  Builder builder(this, current_);
+
+  {
+    LogReporter reporter;
+    reporter.status = &s;
+    log::Reader reader(file, &reporter, true/*checksum*/, 0/*initial_offset*/);
+    Slice record;
+    std::string scratch;
+    while (reader.ReadRecord(&record, &scratch) && s.ok()) {
+      VersionEdit edit;
+      s = edit.DecodeFrom(record);
+      if (s.ok()) {
+        if (edit.has_comparator_ &&
+            edit.comparator_ != icmp_.user_comparator()->Name()) {
+          s = Status::InvalidArgument(
+              edit.comparator_ + " does not match existing comparator ",
+              icmp_.user_comparator()->Name());
+        }
+      }
+
+      if (s.ok()) {
+        builder.Apply(&edit);
+      }
+
+      if (edit.has_log_number_) {
+        log_number = edit.log_number_;
+        have_log_number = true;
+      }
+
+      if (edit.has_prev_log_number_) {
+        prev_log_number = edit.prev_log_number_;
+        have_prev_log_number = true;
+      }
+
+      if (edit.has_next_file_number_) {
+        next_file = edit.next_file_number_;
+        have_next_file = true;
+      }
+
+      if (edit.has_last_sequence_) {
+        last_sequence = edit.last_sequence_;
+        have_last_sequence = true;
+      }
+    }
+  }
+  delete file;
+  file = NULL;
+
+  if (s.ok()) {
+    if (!have_next_file) {
+      s = Status::Corruption("no meta-nextfile entry in descriptor");
+    } else if (!have_log_number) {
+      s = Status::Corruption("no meta-lognumber entry in descriptor");
+    } else if (!have_last_sequence) {
+      s = Status::Corruption("no last-sequence-number entry in descriptor");
+    }
+
+    if (!have_prev_log_number) {
+      prev_log_number = 0;
+    }
+
+    MarkFileNumberUsed(prev_log_number);
+    MarkFileNumberUsed(log_number);
+  }
+
+  if (s.ok()) {
+    Version* v = new Version(this);
+    builder.SaveTo(v);
+    // Install recovered version
+    Finalize(v);
+    AppendVersion(v);
+    manifest_file_number_ = next_file;
+    next_file_number_ = next_file + 1;
+    last_sequence_ = last_sequence;
+    log_number_ = log_number;
+    prev_log_number_ = prev_log_number;
+
+    // See if we can reuse the existing MANIFEST file.
+    if (ReuseManifest(dscname, current)) {
+      // No need to save new manifest
+    } else {
+      *save_manifest = true;
+    }
+  }
+
+  return s;
+}
+
+bool VersionSet::ReuseManifest(const std::string& dscname,
+                               const std::string& dscbase) {
+  if (!options_->reuse_logs) {
+    return false;
+  }
+  FileType manifest_type;
+  uint64_t manifest_number;
+  uint64_t manifest_size;
+  if (!ParseFileName(dscbase, &manifest_number, &manifest_type) ||
+      manifest_type != kDescriptorFile ||
+      !env_->GetFileSize(dscname, &manifest_size).ok() ||
+      // Make new compacted MANIFEST if old one is too big
+      manifest_size >= TargetFileSize(options_)) {
+    return false;
+  }
+
+  assert(descriptor_file_ == NULL);
+  assert(descriptor_log_ == NULL);
+  Status r = env_->NewAppendableFile(dscname, &descriptor_file_);
+  if (!r.ok()) {
+    Log(options_->info_log, "Reuse MANIFEST: %s\n", r.ToString().c_str());
+    assert(descriptor_file_ == NULL);
+    return false;
+  }
+
+  Log(options_->info_log, "Reusing MANIFEST %s\n", dscname.c_str());
+  descriptor_log_ = new log::Writer(descriptor_file_, manifest_size);
+  manifest_file_number_ = manifest_number;
+  return true;
+}
+
+void VersionSet::MarkFileNumberUsed(uint64_t number) {
+  if (next_file_number_ <= number) {
+    next_file_number_ = number + 1;
+  }
+}
+
+void VersionSet::Finalize(Version* v) {
+  // Precomputed best level for next compaction
+  int best_level = -1;
+  double best_score = -1;
+
+  for (int level = 0; level < config::kNumLevels-1; level++) {
+    double score;
+    if (level == 0) {
+      // We treat level-0 specially by bounding the number of files
+      // instead of number of bytes for two reasons:
+      //
+      // (1) With larger write-buffer sizes, it is nice not to do too
+      // many level-0 compactions.
+      //
+      // (2) The files in level-0 are merged on every read and
+      // therefore we wish to avoid too many files when the individual
+      // file size is small (perhaps because of a small write-buffer
+      // setting, or very high compression ratios, or lots of
+      // overwrites/deletions).
+      score = v->files_[level].size() /
+          static_cast<double>(config::kL0_CompactionTrigger);
+    } else {
+      // Compute the ratio of current size to size limit.
+      const uint64_t level_bytes = TotalFileSize(v->files_[level]);
+      score =
+          static_cast<double>(level_bytes) / MaxBytesForLevel(options_, level);
+    }
+
+    if (score > best_score) {
+      best_level = level;
+      best_score = score;
+    }
+  }
+
+  v->compaction_level_ = best_level;
+  v->compaction_score_ = best_score;
+}
+
+Status VersionSet::WriteSnapshot(log::Writer* log) {
+  // TODO: Break up into multiple records to reduce memory usage on recovery?
+
+  // Save metadata
+  VersionEdit edit;
+  edit.SetComparatorName(icmp_.user_comparator()->Name());
+
+  // Save compaction pointers
+  for (int level = 0; level < config::kNumLevels; level++) {
+    if (!compact_pointer_[level].empty()) {
+      InternalKey key;
+      key.DecodeFrom(compact_pointer_[level]);
+      edit.SetCompactPointer(level, key);
+    }
+  }
+
+  // Save files
+  for (int level = 0; level < config::kNumLevels; level++) {
+    const std::vector<FileMetaData*>& files = current_->files_[level];
+    for (size_t i = 0; i < files.size(); i++) {
+      const FileMetaData* f = files[i];
+      edit.AddFile(level, f->number, f->file_size, f->smallest, f->largest);
+    }
+  }
+
+  std::string record;
+  edit.EncodeTo(&record);
+  return log->AddRecord(record);
+}
+
+int VersionSet::NumLevelFiles(int level) const {
+  assert(level >= 0);
+  assert(level < config::kNumLevels);
+  return current_->files_[level].size();
+}
+
+const char* VersionSet::LevelSummary(LevelSummaryStorage* scratch) const {
+  // Update code if kNumLevels changes
+  assert(config::kNumLevels == 7);
+  snprintf(scratch->buffer, sizeof(scratch->buffer),
+           "files[ %d %d %d %d %d %d %d ]",
+           int(current_->files_[0].size()),
+           int(current_->files_[1].size()),
+           int(current_->files_[2].size()),
+           int(current_->files_[3].size()),
+           int(current_->files_[4].size()),
+           int(current_->files_[5].size()),
+           int(current_->files_[6].size()));
+  return scratch->buffer;
+}
+
+uint64_t VersionSet::ApproximateOffsetOf(Version* v, const InternalKey& ikey) {
+  uint64_t result = 0;
+  for (int level = 0; level < config::kNumLevels; level++) {
+    const std::vector<FileMetaData*>& files = v->files_[level];
+    for (size_t i = 0; i < files.size(); i++) {
+      if (icmp_.Compare(files[i]->largest, ikey) <= 0) {
+        // Entire file is before "ikey", so just add the file size
+        result += files[i]->file_size;
+      } else if (icmp_.Compare(files[i]->smallest, ikey) > 0) {
+        // Entire file is after "ikey", so ignore
+        if (level > 0) {
+          // Files other than level 0 are sorted by meta->smallest, so
+          // no further files in this level will contain data for
+          // "ikey".
+          break;
+        }
+      } else {
+        // "ikey" falls in the range for this table.  Add the
+        // approximate offset of "ikey" within the table.
+        Table* tableptr;
+        Iterator* iter = table_cache_->NewIterator(
+            ReadOptions(), files[i]->number, files[i]->file_size, &tableptr);
+        if (tableptr != NULL) {
+          result += tableptr->ApproximateOffsetOf(ikey.Encode());
+        }
+        delete iter;
+      }
+    }
+  }
+  return result;
+}
+
+void VersionSet::AddLiveFiles(std::set<uint64_t>* live) {
+  for (Version* v = dummy_versions_.next_;
+       v != &dummy_versions_;
+       v = v->next_) {
+    for (int level = 0; level < config::kNumLevels; level++) {
+      const std::vector<FileMetaData*>& files = v->files_[level];
+      for (size_t i = 0; i < files.size(); i++) {
+        live->insert(files[i]->number);
+      }
+    }
+  }
+}
+
+int64_t VersionSet::NumLevelBytes(int level) const {
+  assert(level >= 0);
+  assert(level < config::kNumLevels);
+  return TotalFileSize(current_->files_[level]);
+}
+
+int64_t VersionSet::MaxNextLevelOverlappingBytes() {
+  int64_t result = 0;
+  std::vector<FileMetaData*> overlaps;
+  for (int level = 1; level < config::kNumLevels - 1; level++) {
+    for (size_t i = 0; i < current_->files_[level].size(); i++) {
+      const FileMetaData* f = current_->files_[level][i];
+      current_->GetOverlappingInputs(level+1, &f->smallest, &f->largest,
+                                     &overlaps);
+      const int64_t sum = TotalFileSize(overlaps);
+      if (sum > result) {
+        result = sum;
+      }
+    }
+  }
+  return result;
+}
+
+// Stores the minimal range that covers all entries in inputs in
+// *smallest, *largest.
+// REQUIRES: inputs is not empty
+void VersionSet::GetRange(const std::vector<FileMetaData*>& inputs,
+                          InternalKey* smallest,
+                          InternalKey* largest) {
+  assert(!inputs.empty());
+  smallest->Clear();
+  largest->Clear();
+  for (size_t i = 0; i < inputs.size(); i++) {
+    FileMetaData* f = inputs[i];
+    if (i == 0) {
+      *smallest = f->smallest;
+      *largest = f->largest;
+    } else {
+      if (icmp_.Compare(f->smallest, *smallest) < 0) {
+        *smallest = f->smallest;
+      }
+      if (icmp_.Compare(f->largest, *largest) > 0) {
+        *largest = f->largest;
+      }
+    }
+  }
+}
+
+// Stores the minimal range that covers all entries in inputs1 and inputs2
+// in *smallest, *largest.
+// REQUIRES: inputs is not empty
+void VersionSet::GetRange2(const std::vector<FileMetaData*>& inputs1,
+                           const std::vector<FileMetaData*>& inputs2,
+                           InternalKey* smallest,
+                           InternalKey* largest) {
+  std::vector<FileMetaData*> all = inputs1;
+  all.insert(all.end(), inputs2.begin(), inputs2.end());
+  GetRange(all, smallest, largest);
+}
+
+Iterator* VersionSet::MakeInputIterator(Compaction* c) {
+  ReadOptions options;
+  options.verify_checksums = options_->paranoid_checks;
+  options.fill_cache = false;
+
+  // Level-0 files have to be merged together.  For other levels,
+  // we will make a concatenating iterator per level.
+  // TODO(opt): use concatenating iterator for level-0 if there is no overlap
+  const int space = (c->level() == 0 ? c->inputs_[0].size() + 1 : 2);
+  Iterator** list = new Iterator*[space];
+  int num = 0;
+  for (int which = 0; which < 2; which++) {
+    if (!c->inputs_[which].empty()) {
+      if (c->level() + which == 0) {
+        const std::vector<FileMetaData*>& files = c->inputs_[which];
+        for (size_t i = 0; i < files.size(); i++) {
+          list[num++] = table_cache_->NewIterator(
+              options, files[i]->number, files[i]->file_size);
+        }
+      } else {
+        // Create concatenating iterator for the files from this level
+        list[num++] = NewTwoLevelIterator(
+            new Version::LevelFileNumIterator(icmp_, &c->inputs_[which]),
+            &GetFileIterator, table_cache_, options);
+      }
+    }
+  }
+  assert(num <= space);
+  Iterator* result = NewMergingIterator(&icmp_, list, num);
+  delete[] list;
+  return result;
+}
+
+Compaction* VersionSet::PickCompaction() {
+  Compaction* c;
+  int level;
+
+  // We prefer compactions triggered by too much data in a level over
+  // the compactions triggered by seeks.
+  const bool size_compaction = (current_->compaction_score_ >= 1);
+  const bool seek_compaction = (current_->file_to_compact_ != NULL);
+  if (size_compaction) {
+    level = current_->compaction_level_;
+    assert(level >= 0);
+    assert(level+1 < config::kNumLevels);
+    c = new Compaction(options_, level);
+
+    // Pick the first file that comes after compact_pointer_[level]
+    for (size_t i = 0; i < current_->files_[level].size(); i++) {
+      FileMetaData* f = current_->files_[level][i];
+      if (compact_pointer_[level].empty() ||
+          icmp_.Compare(f->largest.Encode(), compact_pointer_[level]) > 0) {
+        c->inputs_[0].push_back(f);
+        break;
+      }
+    }
+    if (c->inputs_[0].empty()) {
+      // Wrap-around to the beginning of the key space
+      c->inputs_[0].push_back(current_->files_[level][0]);
+    }
+  } else if (seek_compaction) {
+    level = current_->file_to_compact_level_;
+    c = new Compaction(options_, level);
+    c->inputs_[0].push_back(current_->file_to_compact_);
+  } else {
+    return NULL;
+  }
+
+  c->input_version_ = current_;
+  c->input_version_->Ref();
+
+  // Files in level 0 may overlap each other, so pick up all overlapping ones
+  if (level == 0) {
+    InternalKey smallest, largest;
+    GetRange(c->inputs_[0], &smallest, &largest);
+    // Note that the next call will discard the file we placed in
+    // c->inputs_[0] earlier and replace it with an overlapping set
+    // which will include the picked file.
+    current_->GetOverlappingInputs(0, &smallest, &largest, &c->inputs_[0]);
+    assert(!c->inputs_[0].empty());
+  }
+
+  SetupOtherInputs(c);
+
+  return c;
+}
+
+void VersionSet::SetupOtherInputs(Compaction* c) {
+  const int level = c->level();
+  InternalKey smallest, largest;
+  GetRange(c->inputs_[0], &smallest, &largest);
+
+  current_->GetOverlappingInputs(level+1, &smallest, &largest, &c->inputs_[1]);
+
+  // Get entire range covered by compaction
+  InternalKey all_start, all_limit;
+  GetRange2(c->inputs_[0], c->inputs_[1], &all_start, &all_limit);
+
+  // See if we can grow the number of inputs in "level" without
+  // changing the number of "level+1" files we pick up.
+  if (!c->inputs_[1].empty()) {
+    std::vector<FileMetaData*> expanded0;
+    current_->GetOverlappingInputs(level, &all_start, &all_limit, &expanded0);
+    const int64_t inputs0_size = TotalFileSize(c->inputs_[0]);
+    const int64_t inputs1_size = TotalFileSize(c->inputs_[1]);
+    const int64_t expanded0_size = TotalFileSize(expanded0);
+    if (expanded0.size() > c->inputs_[0].size() &&
+        inputs1_size + expanded0_size <
+            ExpandedCompactionByteSizeLimit(options_)) {
+      InternalKey new_start, new_limit;
+      GetRange(expanded0, &new_start, &new_limit);
+      std::vector<FileMetaData*> expanded1;
+      current_->GetOverlappingInputs(level+1, &new_start, &new_limit,
+                                     &expanded1);
+      if (expanded1.size() == c->inputs_[1].size()) {
+        Log(options_->info_log,
+            "Expanding@%d %d+%d (%ld+%ld bytes) to %d+%d (%ld+%ld bytes)\n",
+            level,
+            int(c->inputs_[0].size()),
+            int(c->inputs_[1].size()),
+            long(inputs0_size), long(inputs1_size),
+            int(expanded0.size()),
+            int(expanded1.size()),
+            long(expanded0_size), long(inputs1_size));
+        smallest = new_start;
+        largest = new_limit;
+        c->inputs_[0] = expanded0;
+        c->inputs_[1] = expanded1;
+        GetRange2(c->inputs_[0], c->inputs_[1], &all_start, &all_limit);
+      }
+    }
+  }
+
+  // Compute the set of grandparent files that overlap this compaction
+  // (parent == level+1; grandparent == level+2)
+  if (level + 2 < config::kNumLevels) {
+    current_->GetOverlappingInputs(level + 2, &all_start, &all_limit,
+                                   &c->grandparents_);
+  }
+
+  if (false) {
+    Log(options_->info_log, "Compacting %d '%s' .. '%s'",
+        level,
+        smallest.DebugString().c_str(),
+        largest.DebugString().c_str());
+  }
+
+  // Update the place where we will do the next compaction for this level.
+  // We update this immediately instead of waiting for the VersionEdit
+  // to be applied so that if the compaction fails, we will try a different
+  // key range next time.
+  compact_pointer_[level] = largest.Encode().ToString();
+  c->edit_.SetCompactPointer(level, largest);
+}
+
+Compaction* VersionSet::CompactRange(
+    int level,
+    const InternalKey* begin,
+    const InternalKey* end) {
+  std::vector<FileMetaData*> inputs;
+  current_->GetOverlappingInputs(level, begin, end, &inputs);
+  if (inputs.empty()) {
+    return NULL;
+  }
+
+  // Avoid compacting too much in one shot in case the range is large.
+  // But we cannot do this for level-0 since level-0 files can overlap
+  // and we must not pick one file and drop another older file if the
+  // two files overlap.
+  if (level > 0) {
+    const uint64_t limit = MaxFileSizeForLevel(options_, level);
+    uint64_t total = 0;
+    for (size_t i = 0; i < inputs.size(); i++) {
+      uint64_t s = inputs[i]->file_size;
+      total += s;
+      if (total >= limit) {
+        inputs.resize(i + 1);
+        break;
+      }
+    }
+  }
+
+  Compaction* c = new Compaction(options_, level);
+  c->input_version_ = current_;
+  c->input_version_->Ref();
+  c->inputs_[0] = inputs;
+  SetupOtherInputs(c);
+  return c;
+}
+
+Compaction::Compaction(const Options* options, int level)
+    : level_(level),
+      max_output_file_size_(MaxFileSizeForLevel(options, level)),
+      input_version_(NULL),
+      grandparent_index_(0),
+      seen_key_(false),
+      overlapped_bytes_(0) {
+  for (int i = 0; i < config::kNumLevels; i++) {
+    level_ptrs_[i] = 0;
+  }
+}
+
+Compaction::~Compaction() {
+  if (input_version_ != NULL) {
+    input_version_->Unref();
+  }
+}
+
+bool Compaction::IsTrivialMove() const {
+  const VersionSet* vset = input_version_->vset_;
+  // Avoid a move if there is lots of overlapping grandparent data.
+  // Otherwise, the move could create a parent file that will require
+  // a very expensive merge later on.
+  return (num_input_files(0) == 1 && num_input_files(1) == 0 &&
+          TotalFileSize(grandparents_) <=
+              MaxGrandParentOverlapBytes(vset->options_));
+}
+
+void Compaction::AddInputDeletions(VersionEdit* edit) {
+  for (int which = 0; which < 2; which++) {
+    for (size_t i = 0; i < inputs_[which].size(); i++) {
+      edit->DeleteFile(level_ + which, inputs_[which][i]->number);
+    }
+  }
+}
+
+bool Compaction::IsBaseLevelForKey(const Slice& user_key) {
+  // Maybe use binary search to find right entry instead of linear search?
+  const Comparator* user_cmp = input_version_->vset_->icmp_.user_comparator();
+  for (int lvl = level_ + 2; lvl < config::kNumLevels; lvl++) {
+    const std::vector<FileMetaData*>& files = input_version_->files_[lvl];
+    for (; level_ptrs_[lvl] < files.size(); ) {
+      FileMetaData* f = files[level_ptrs_[lvl]];
+      if (user_cmp->Compare(user_key, f->largest.user_key()) <= 0) {
+        // We've advanced far enough
+        if (user_cmp->Compare(user_key, f->smallest.user_key()) >= 0) {
+          // Key falls in this file's range, so definitely not base level
+          return false;
+        }
+        break;
+      }
+      level_ptrs_[lvl]++;
+    }
+  }
+  return true;
+}
+
+bool Compaction::ShouldStopBefore(const Slice& internal_key) {
+  const VersionSet* vset = input_version_->vset_;
+  // Scan to find earliest grandparent file that contains key.
+  const InternalKeyComparator* icmp = &vset->icmp_;
+  while (grandparent_index_ < grandparents_.size() &&
+      icmp->Compare(internal_key,
+                    grandparents_[grandparent_index_]->largest.Encode()) > 0) {
+    if (seen_key_) {
+      overlapped_bytes_ += grandparents_[grandparent_index_]->file_size;
+    }
+    grandparent_index_++;
+  }
+  seen_key_ = true;
+
+  if (overlapped_bytes_ > MaxGrandParentOverlapBytes(vset->options_)) {
+    // Too much overlap for current output; start new output
+    overlapped_bytes_ = 0;
+    return true;
+  } else {
+    return false;
+  }
+}
+
+void Compaction::ReleaseInputs() {
+  if (input_version_ != NULL) {
+    input_version_->Unref();
+    input_version_ = NULL;
+  }
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/db/version_set.h b/depend/zcash/src/leveldb/db/version_set.h
new file mode 100644
index 000000000..7935a965a
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/version_set.h
@@ -0,0 +1,398 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// The representation of a DBImpl consists of a set of Versions.  The
+// newest version is called "current".  Older versions may be kept
+// around to provide a consistent view to live iterators.
+//
+// Each Version keeps track of a set of Table files per level.  The
+// entire set of versions is maintained in a VersionSet.
+//
+// Version,VersionSet are thread-compatible, but require external
+// synchronization on all accesses.
+
+#ifndef STORAGE_LEVELDB_DB_VERSION_SET_H_
+#define STORAGE_LEVELDB_DB_VERSION_SET_H_
+
+#include <map>
+#include <set>
+#include <vector>
+#include "db/dbformat.h"
+#include "db/version_edit.h"
+#include "port/port.h"
+#include "port/thread_annotations.h"
+
+namespace leveldb {
+
+namespace log { class Writer; }
+
+class Compaction;
+class Iterator;
+class MemTable;
+class TableBuilder;
+class TableCache;
+class Version;
+class VersionSet;
+class WritableFile;
+
+// Return the smallest index i such that files[i]->largest >= key.
+// Return files.size() if there is no such file.
+// REQUIRES: "files" contains a sorted list of non-overlapping files.
+extern int FindFile(const InternalKeyComparator& icmp,
+                    const std::vector<FileMetaData*>& files,
+                    const Slice& key);
+
+// Returns true iff some file in "files" overlaps the user key range
+// [*smallest,*largest].
+// smallest==NULL represents a key smaller than all keys in the DB.
+// largest==NULL represents a key largest than all keys in the DB.
+// REQUIRES: If disjoint_sorted_files, files[] contains disjoint ranges
+//           in sorted order.
+extern bool SomeFileOverlapsRange(
+    const InternalKeyComparator& icmp,
+    bool disjoint_sorted_files,
+    const std::vector<FileMetaData*>& files,
+    const Slice* smallest_user_key,
+    const Slice* largest_user_key);
+
+class Version {
+ public:
+  // Append to *iters a sequence of iterators that will
+  // yield the contents of this Version when merged together.
+  // REQUIRES: This version has been saved (see VersionSet::SaveTo)
+  void AddIterators(const ReadOptions&, std::vector<Iterator*>* iters);
+
+  // Lookup the value for key.  If found, store it in *val and
+  // return OK.  Else return a non-OK status.  Fills *stats.
+  // REQUIRES: lock is not held
+  struct GetStats {
+    FileMetaData* seek_file;
+    int seek_file_level;
+  };
+  Status Get(const ReadOptions&, const LookupKey& key, std::string* val,
+             GetStats* stats);
+
+  // Adds "stats" into the current state.  Returns true if a new
+  // compaction may need to be triggered, false otherwise.
+  // REQUIRES: lock is held
+  bool UpdateStats(const GetStats& stats);
+
+  // Record a sample of bytes read at the specified internal key.
+  // Samples are taken approximately once every config::kReadBytesPeriod
+  // bytes.  Returns true if a new compaction may need to be triggered.
+  // REQUIRES: lock is held
+  bool RecordReadSample(Slice key);
+
+  // Reference count management (so Versions do not disappear out from
+  // under live iterators)
+  void Ref();
+  void Unref();
+
+  void GetOverlappingInputs(
+      int level,
+      const InternalKey* begin,         // NULL means before all keys
+      const InternalKey* end,           // NULL means after all keys
+      std::vector<FileMetaData*>* inputs);
+
+  // Returns true iff some file in the specified level overlaps
+  // some part of [*smallest_user_key,*largest_user_key].
+  // smallest_user_key==NULL represents a key smaller than all keys in the DB.
+  // largest_user_key==NULL represents a key largest than all keys in the DB.
+  bool OverlapInLevel(int level,
+                      const Slice* smallest_user_key,
+                      const Slice* largest_user_key);
+
+  // Return the level at which we should place a new memtable compaction
+  // result that covers the range [smallest_user_key,largest_user_key].
+  int PickLevelForMemTableOutput(const Slice& smallest_user_key,
+                                 const Slice& largest_user_key);
+
+  int NumFiles(int level) const { return files_[level].size(); }
+
+  // Return a human readable string that describes this version's contents.
+  std::string DebugString() const;
+
+ private:
+  friend class Compaction;
+  friend class VersionSet;
+
+  class LevelFileNumIterator;
+  Iterator* NewConcatenatingIterator(const ReadOptions&, int level) const;
+
+  // Call func(arg, level, f) for every file that overlaps user_key in
+  // order from newest to oldest.  If an invocation of func returns
+  // false, makes no more calls.
+  //
+  // REQUIRES: user portion of internal_key == user_key.
+  void ForEachOverlapping(Slice user_key, Slice internal_key,
+                          void* arg,
+                          bool (*func)(void*, int, FileMetaData*));
+
+  VersionSet* vset_;            // VersionSet to which this Version belongs
+  Version* next_;               // Next version in linked list
+  Version* prev_;               // Previous version in linked list
+  int refs_;                    // Number of live refs to this version
+
+  // List of files per level
+  std::vector<FileMetaData*> files_[config::kNumLevels];
+
+  // Next file to compact based on seek stats.
+  FileMetaData* file_to_compact_;
+  int file_to_compact_level_;
+
+  // Level that should be compacted next and its compaction score.
+  // Score < 1 means compaction is not strictly needed.  These fields
+  // are initialized by Finalize().
+  double compaction_score_;
+  int compaction_level_;
+
+  explicit Version(VersionSet* vset)
+      : vset_(vset), next_(this), prev_(this), refs_(0),
+        file_to_compact_(NULL),
+        file_to_compact_level_(-1),
+        compaction_score_(-1),
+        compaction_level_(-1) {
+  }
+
+  ~Version();
+
+  // No copying allowed
+  Version(const Version&);
+  void operator=(const Version&);
+};
+
+class VersionSet {
+ public:
+  VersionSet(const std::string& dbname,
+             const Options* options,
+             TableCache* table_cache,
+             const InternalKeyComparator*);
+  ~VersionSet();
+
+  // Apply *edit to the current version to form a new descriptor that
+  // is both saved to persistent state and installed as the new
+  // current version.  Will release *mu while actually writing to the file.
+  // REQUIRES: *mu is held on entry.
+  // REQUIRES: no other thread concurrently calls LogAndApply()
+  Status LogAndApply(VersionEdit* edit, port::Mutex* mu)
+      EXCLUSIVE_LOCKS_REQUIRED(mu);
+
+  // Recover the last saved descriptor from persistent storage.
+  Status Recover(bool *save_manifest);
+
+  // Return the current version.
+  Version* current() const { return current_; }
+
+  // Return the current manifest file number
+  uint64_t ManifestFileNumber() const { return manifest_file_number_; }
+
+  // Allocate and return a new file number
+  uint64_t NewFileNumber() { return next_file_number_++; }
+
+  // Arrange to reuse "file_number" unless a newer file number has
+  // already been allocated.
+  // REQUIRES: "file_number" was returned by a call to NewFileNumber().
+  void ReuseFileNumber(uint64_t file_number) {
+    if (next_file_number_ == file_number + 1) {
+      next_file_number_ = file_number;
+    }
+  }
+
+  // Return the number of Table files at the specified level.
+  int NumLevelFiles(int level) const;
+
+  // Return the combined file size of all files at the specified level.
+  int64_t NumLevelBytes(int level) const;
+
+  // Return the last sequence number.
+  uint64_t LastSequence() const { return last_sequence_; }
+
+  // Set the last sequence number to s.
+  void SetLastSequence(uint64_t s) {
+    assert(s >= last_sequence_);
+    last_sequence_ = s;
+  }
+
+  // Mark the specified file number as used.
+  void MarkFileNumberUsed(uint64_t number);
+
+  // Return the current log file number.
+  uint64_t LogNumber() const { return log_number_; }
+
+  // Return the log file number for the log file that is currently
+  // being compacted, or zero if there is no such log file.
+  uint64_t PrevLogNumber() const { return prev_log_number_; }
+
+  // Pick level and inputs for a new compaction.
+  // Returns NULL if there is no compaction to be done.
+  // Otherwise returns a pointer to a heap-allocated object that
+  // describes the compaction.  Caller should delete the result.
+  Compaction* PickCompaction();
+
+  // Return a compaction object for compacting the range [begin,end] in
+  // the specified level.  Returns NULL if there is nothing in that
+  // level that overlaps the specified range.  Caller should delete
+  // the result.
+  Compaction* CompactRange(
+      int level,
+      const InternalKey* begin,
+      const InternalKey* end);
+
+  // Return the maximum overlapping data (in bytes) at next level for any
+  // file at a level >= 1.
+  int64_t MaxNextLevelOverlappingBytes();
+
+  // Create an iterator that reads over the compaction inputs for "*c".
+  // The caller should delete the iterator when no longer needed.
+  Iterator* MakeInputIterator(Compaction* c);
+
+  // Returns true iff some level needs a compaction.
+  bool NeedsCompaction() const {
+    Version* v = current_;
+    return (v->compaction_score_ >= 1) || (v->file_to_compact_ != NULL);
+  }
+
+  // Add all files listed in any live version to *live.
+  // May also mutate some internal state.
+  void AddLiveFiles(std::set<uint64_t>* live);
+
+  // Return the approximate offset in the database of the data for
+  // "key" as of version "v".
+  uint64_t ApproximateOffsetOf(Version* v, const InternalKey& key);
+
+  // Return a human-readable short (single-line) summary of the number
+  // of files per level.  Uses *scratch as backing store.
+  struct LevelSummaryStorage {
+    char buffer[100];
+  };
+  const char* LevelSummary(LevelSummaryStorage* scratch) const;
+
+ private:
+  class Builder;
+
+  friend class Compaction;
+  friend class Version;
+
+  bool ReuseManifest(const std::string& dscname, const std::string& dscbase);
+
+  void Finalize(Version* v);
+
+  void GetRange(const std::vector<FileMetaData*>& inputs,
+                InternalKey* smallest,
+                InternalKey* largest);
+
+  void GetRange2(const std::vector<FileMetaData*>& inputs1,
+                 const std::vector<FileMetaData*>& inputs2,
+                 InternalKey* smallest,
+                 InternalKey* largest);
+
+  void SetupOtherInputs(Compaction* c);
+
+  // Save current contents to *log
+  Status WriteSnapshot(log::Writer* log);
+
+  void AppendVersion(Version* v);
+
+  Env* const env_;
+  const std::string dbname_;
+  const Options* const options_;
+  TableCache* const table_cache_;
+  const InternalKeyComparator icmp_;
+  uint64_t next_file_number_;
+  uint64_t manifest_file_number_;
+  uint64_t last_sequence_;
+  uint64_t log_number_;
+  uint64_t prev_log_number_;  // 0 or backing store for memtable being compacted
+
+  // Opened lazily
+  WritableFile* descriptor_file_;
+  log::Writer* descriptor_log_;
+  Version dummy_versions_;  // Head of circular doubly-linked list of versions.
+  Version* current_;        // == dummy_versions_.prev_
+
+  // Per-level key at which the next compaction at that level should start.
+  // Either an empty string, or a valid InternalKey.
+  std::string compact_pointer_[config::kNumLevels];
+
+  // No copying allowed
+  VersionSet(const VersionSet&);
+  void operator=(const VersionSet&);
+};
+
+// A Compaction encapsulates information about a compaction.
+class Compaction {
+ public:
+  ~Compaction();
+
+  // Return the level that is being compacted.  Inputs from "level"
+  // and "level+1" will be merged to produce a set of "level+1" files.
+  int level() const { return level_; }
+
+  // Return the object that holds the edits to the descriptor done
+  // by this compaction.
+  VersionEdit* edit() { return &edit_; }
+
+  // "which" must be either 0 or 1
+  int num_input_files(int which) const { return inputs_[which].size(); }
+
+  // Return the ith input file at "level()+which" ("which" must be 0 or 1).
+  FileMetaData* input(int which, int i) const { return inputs_[which][i]; }
+
+  // Maximum size of files to build during this compaction.
+  uint64_t MaxOutputFileSize() const { return max_output_file_size_; }
+
+  // Is this a trivial compaction that can be implemented by just
+  // moving a single input file to the next level (no merging or splitting)
+  bool IsTrivialMove() const;
+
+  // Add all inputs to this compaction as delete operations to *edit.
+  void AddInputDeletions(VersionEdit* edit);
+
+  // Returns true if the information we have available guarantees that
+  // the compaction is producing data in "level+1" for which no data exists
+  // in levels greater than "level+1".
+  bool IsBaseLevelForKey(const Slice& user_key);
+
+  // Returns true iff we should stop building the current output
+  // before processing "internal_key".
+  bool ShouldStopBefore(const Slice& internal_key);
+
+  // Release the input version for the compaction, once the compaction
+  // is successful.
+  void ReleaseInputs();
+
+ private:
+  friend class Version;
+  friend class VersionSet;
+
+  Compaction(const Options* options, int level);
+
+  int level_;
+  uint64_t max_output_file_size_;
+  Version* input_version_;
+  VersionEdit edit_;
+
+  // Each compaction reads inputs from "level_" and "level_+1"
+  std::vector<FileMetaData*> inputs_[2];      // The two sets of inputs
+
+  // State used to check for number of overlapping grandparent files
+  // (parent == level_ + 1, grandparent == level_ + 2)
+  std::vector<FileMetaData*> grandparents_;
+  size_t grandparent_index_;  // Index in grandparent_starts_
+  bool seen_key_;             // Some output key has been seen
+  int64_t overlapped_bytes_;  // Bytes of overlap between current output
+                              // and grandparent files
+
+  // State for implementing IsBaseLevelForKey
+
+  // level_ptrs_ holds indices into input_version_->levels_: our state
+  // is that we are positioned at one of the file ranges for each
+  // higher level than the ones involved in this compaction (i.e. for
+  // all L >= level_ + 2).
+  size_t level_ptrs_[config::kNumLevels];
+};
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_DB_VERSION_SET_H_
diff --git a/depend/zcash/src/leveldb/db/version_set_test.cc b/depend/zcash/src/leveldb/db/version_set_test.cc
new file mode 100644
index 000000000..501e34d13
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/version_set_test.cc
@@ -0,0 +1,179 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "db/version_set.h"
+#include "util/logging.h"
+#include "util/testharness.h"
+#include "util/testutil.h"
+
+namespace leveldb {
+
+class FindFileTest {
+ public:
+  std::vector<FileMetaData*> files_;
+  bool disjoint_sorted_files_;
+
+  FindFileTest() : disjoint_sorted_files_(true) { }
+
+  ~FindFileTest() {
+    for (int i = 0; i < files_.size(); i++) {
+      delete files_[i];
+    }
+  }
+
+  void Add(const char* smallest, const char* largest,
+           SequenceNumber smallest_seq = 100,
+           SequenceNumber largest_seq = 100) {
+    FileMetaData* f = new FileMetaData;
+    f->number = files_.size() + 1;
+    f->smallest = InternalKey(smallest, smallest_seq, kTypeValue);
+    f->largest = InternalKey(largest, largest_seq, kTypeValue);
+    files_.push_back(f);
+  }
+
+  int Find(const char* key) {
+    InternalKey target(key, 100, kTypeValue);
+    InternalKeyComparator cmp(BytewiseComparator());
+    return FindFile(cmp, files_, target.Encode());
+  }
+
+  bool Overlaps(const char* smallest, const char* largest) {
+    InternalKeyComparator cmp(BytewiseComparator());
+    Slice s(smallest != NULL ? smallest : "");
+    Slice l(largest != NULL ? largest : "");
+    return SomeFileOverlapsRange(cmp, disjoint_sorted_files_, files_,
+                                 (smallest != NULL ? &s : NULL),
+                                 (largest != NULL ? &l : NULL));
+  }
+};
+
+TEST(FindFileTest, Empty) {
+  ASSERT_EQ(0, Find("foo"));
+  ASSERT_TRUE(! Overlaps("a", "z"));
+  ASSERT_TRUE(! Overlaps(NULL, "z"));
+  ASSERT_TRUE(! Overlaps("a", NULL));
+  ASSERT_TRUE(! Overlaps(NULL, NULL));
+}
+
+TEST(FindFileTest, Single) {
+  Add("p", "q");
+  ASSERT_EQ(0, Find("a"));
+  ASSERT_EQ(0, Find("p"));
+  ASSERT_EQ(0, Find("p1"));
+  ASSERT_EQ(0, Find("q"));
+  ASSERT_EQ(1, Find("q1"));
+  ASSERT_EQ(1, Find("z"));
+
+  ASSERT_TRUE(! Overlaps("a", "b"));
+  ASSERT_TRUE(! Overlaps("z1", "z2"));
+  ASSERT_TRUE(Overlaps("a", "p"));
+  ASSERT_TRUE(Overlaps("a", "q"));
+  ASSERT_TRUE(Overlaps("a", "z"));
+  ASSERT_TRUE(Overlaps("p", "p1"));
+  ASSERT_TRUE(Overlaps("p", "q"));
+  ASSERT_TRUE(Overlaps("p", "z"));
+  ASSERT_TRUE(Overlaps("p1", "p2"));
+  ASSERT_TRUE(Overlaps("p1", "z"));
+  ASSERT_TRUE(Overlaps("q", "q"));
+  ASSERT_TRUE(Overlaps("q", "q1"));
+
+  ASSERT_TRUE(! Overlaps(NULL, "j"));
+  ASSERT_TRUE(! Overlaps("r", NULL));
+  ASSERT_TRUE(Overlaps(NULL, "p"));
+  ASSERT_TRUE(Overlaps(NULL, "p1"));
+  ASSERT_TRUE(Overlaps("q", NULL));
+  ASSERT_TRUE(Overlaps(NULL, NULL));
+}
+
+
+TEST(FindFileTest, Multiple) {
+  Add("150", "200");
+  Add("200", "250");
+  Add("300", "350");
+  Add("400", "450");
+  ASSERT_EQ(0, Find("100"));
+  ASSERT_EQ(0, Find("150"));
+  ASSERT_EQ(0, Find("151"));
+  ASSERT_EQ(0, Find("199"));
+  ASSERT_EQ(0, Find("200"));
+  ASSERT_EQ(1, Find("201"));
+  ASSERT_EQ(1, Find("249"));
+  ASSERT_EQ(1, Find("250"));
+  ASSERT_EQ(2, Find("251"));
+  ASSERT_EQ(2, Find("299"));
+  ASSERT_EQ(2, Find("300"));
+  ASSERT_EQ(2, Find("349"));
+  ASSERT_EQ(2, Find("350"));
+  ASSERT_EQ(3, Find("351"));
+  ASSERT_EQ(3, Find("400"));
+  ASSERT_EQ(3, Find("450"));
+  ASSERT_EQ(4, Find("451"));
+
+  ASSERT_TRUE(! Overlaps("100", "149"));
+  ASSERT_TRUE(! Overlaps("251", "299"));
+  ASSERT_TRUE(! Overlaps("451", "500"));
+  ASSERT_TRUE(! Overlaps("351", "399"));
+
+  ASSERT_TRUE(Overlaps("100", "150"));
+  ASSERT_TRUE(Overlaps("100", "200"));
+  ASSERT_TRUE(Overlaps("100", "300"));
+  ASSERT_TRUE(Overlaps("100", "400"));
+  ASSERT_TRUE(Overlaps("100", "500"));
+  ASSERT_TRUE(Overlaps("375", "400"));
+  ASSERT_TRUE(Overlaps("450", "450"));
+  ASSERT_TRUE(Overlaps("450", "500"));
+}
+
+TEST(FindFileTest, MultipleNullBoundaries) {
+  Add("150", "200");
+  Add("200", "250");
+  Add("300", "350");
+  Add("400", "450");
+  ASSERT_TRUE(! Overlaps(NULL, "149"));
+  ASSERT_TRUE(! Overlaps("451", NULL));
+  ASSERT_TRUE(Overlaps(NULL, NULL));
+  ASSERT_TRUE(Overlaps(NULL, "150"));
+  ASSERT_TRUE(Overlaps(NULL, "199"));
+  ASSERT_TRUE(Overlaps(NULL, "200"));
+  ASSERT_TRUE(Overlaps(NULL, "201"));
+  ASSERT_TRUE(Overlaps(NULL, "400"));
+  ASSERT_TRUE(Overlaps(NULL, "800"));
+  ASSERT_TRUE(Overlaps("100", NULL));
+  ASSERT_TRUE(Overlaps("200", NULL));
+  ASSERT_TRUE(Overlaps("449", NULL));
+  ASSERT_TRUE(Overlaps("450", NULL));
+}
+
+TEST(FindFileTest, OverlapSequenceChecks) {
+  Add("200", "200", 5000, 3000);
+  ASSERT_TRUE(! Overlaps("199", "199"));
+  ASSERT_TRUE(! Overlaps("201", "300"));
+  ASSERT_TRUE(Overlaps("200", "200"));
+  ASSERT_TRUE(Overlaps("190", "200"));
+  ASSERT_TRUE(Overlaps("200", "210"));
+}
+
+TEST(FindFileTest, OverlappingFiles) {
+  Add("150", "600");
+  Add("400", "500");
+  disjoint_sorted_files_ = false;
+  ASSERT_TRUE(! Overlaps("100", "149"));
+  ASSERT_TRUE(! Overlaps("601", "700"));
+  ASSERT_TRUE(Overlaps("100", "150"));
+  ASSERT_TRUE(Overlaps("100", "200"));
+  ASSERT_TRUE(Overlaps("100", "300"));
+  ASSERT_TRUE(Overlaps("100", "400"));
+  ASSERT_TRUE(Overlaps("100", "500"));
+  ASSERT_TRUE(Overlaps("375", "400"));
+  ASSERT_TRUE(Overlaps("450", "450"));
+  ASSERT_TRUE(Overlaps("450", "500"));
+  ASSERT_TRUE(Overlaps("450", "700"));
+  ASSERT_TRUE(Overlaps("600", "700"));
+}
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/db/write_batch.cc b/depend/zcash/src/leveldb/db/write_batch.cc
new file mode 100644
index 000000000..33f4a4257
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/write_batch.cc
@@ -0,0 +1,147 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// WriteBatch::rep_ :=
+//    sequence: fixed64
+//    count: fixed32
+//    data: record[count]
+// record :=
+//    kTypeValue varstring varstring         |
+//    kTypeDeletion varstring
+// varstring :=
+//    len: varint32
+//    data: uint8[len]
+
+#include "leveldb/write_batch.h"
+
+#include "leveldb/db.h"
+#include "db/dbformat.h"
+#include "db/memtable.h"
+#include "db/write_batch_internal.h"
+#include "util/coding.h"
+
+namespace leveldb {
+
+// WriteBatch header has an 8-byte sequence number followed by a 4-byte count.
+static const size_t kHeader = 12;
+
+WriteBatch::WriteBatch() {
+  Clear();
+}
+
+WriteBatch::~WriteBatch() { }
+
+WriteBatch::Handler::~Handler() { }
+
+void WriteBatch::Clear() {
+  rep_.clear();
+  rep_.resize(kHeader);
+}
+
+Status WriteBatch::Iterate(Handler* handler) const {
+  Slice input(rep_);
+  if (input.size() < kHeader) {
+    return Status::Corruption("malformed WriteBatch (too small)");
+  }
+
+  input.remove_prefix(kHeader);
+  Slice key, value;
+  int found = 0;
+  while (!input.empty()) {
+    found++;
+    char tag = input[0];
+    input.remove_prefix(1);
+    switch (tag) {
+      case kTypeValue:
+        if (GetLengthPrefixedSlice(&input, &key) &&
+            GetLengthPrefixedSlice(&input, &value)) {
+          handler->Put(key, value);
+        } else {
+          return Status::Corruption("bad WriteBatch Put");
+        }
+        break;
+      case kTypeDeletion:
+        if (GetLengthPrefixedSlice(&input, &key)) {
+          handler->Delete(key);
+        } else {
+          return Status::Corruption("bad WriteBatch Delete");
+        }
+        break;
+      default:
+        return Status::Corruption("unknown WriteBatch tag");
+    }
+  }
+  if (found != WriteBatchInternal::Count(this)) {
+    return Status::Corruption("WriteBatch has wrong count");
+  } else {
+    return Status::OK();
+  }
+}
+
+int WriteBatchInternal::Count(const WriteBatch* b) {
+  return DecodeFixed32(b->rep_.data() + 8);
+}
+
+void WriteBatchInternal::SetCount(WriteBatch* b, int n) {
+  EncodeFixed32(&b->rep_[8], n);
+}
+
+SequenceNumber WriteBatchInternal::Sequence(const WriteBatch* b) {
+  return SequenceNumber(DecodeFixed64(b->rep_.data()));
+}
+
+void WriteBatchInternal::SetSequence(WriteBatch* b, SequenceNumber seq) {
+  EncodeFixed64(&b->rep_[0], seq);
+}
+
+void WriteBatch::Put(const Slice& key, const Slice& value) {
+  WriteBatchInternal::SetCount(this, WriteBatchInternal::Count(this) + 1);
+  rep_.push_back(static_cast<char>(kTypeValue));
+  PutLengthPrefixedSlice(&rep_, key);
+  PutLengthPrefixedSlice(&rep_, value);
+}
+
+void WriteBatch::Delete(const Slice& key) {
+  WriteBatchInternal::SetCount(this, WriteBatchInternal::Count(this) + 1);
+  rep_.push_back(static_cast<char>(kTypeDeletion));
+  PutLengthPrefixedSlice(&rep_, key);
+}
+
+namespace {
+class MemTableInserter : public WriteBatch::Handler {
+ public:
+  SequenceNumber sequence_;
+  MemTable* mem_;
+
+  virtual void Put(const Slice& key, const Slice& value) {
+    mem_->Add(sequence_, kTypeValue, key, value);
+    sequence_++;
+  }
+  virtual void Delete(const Slice& key) {
+    mem_->Add(sequence_, kTypeDeletion, key, Slice());
+    sequence_++;
+  }
+};
+}  // namespace
+
+Status WriteBatchInternal::InsertInto(const WriteBatch* b,
+                                      MemTable* memtable) {
+  MemTableInserter inserter;
+  inserter.sequence_ = WriteBatchInternal::Sequence(b);
+  inserter.mem_ = memtable;
+  return b->Iterate(&inserter);
+}
+
+void WriteBatchInternal::SetContents(WriteBatch* b, const Slice& contents) {
+  assert(contents.size() >= kHeader);
+  b->rep_.assign(contents.data(), contents.size());
+}
+
+void WriteBatchInternal::Append(WriteBatch* dst, const WriteBatch* src) {
+  SetCount(dst, Count(dst) + Count(src));
+  assert(src->rep_.size() >= kHeader);
+  dst->rep_.append(src->rep_.data() + kHeader, src->rep_.size() - kHeader);
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/db/write_batch_internal.h b/depend/zcash/src/leveldb/db/write_batch_internal.h
new file mode 100644
index 000000000..9448ef7b2
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/write_batch_internal.h
@@ -0,0 +1,50 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_DB_WRITE_BATCH_INTERNAL_H_
+#define STORAGE_LEVELDB_DB_WRITE_BATCH_INTERNAL_H_
+
+#include "db/dbformat.h"
+#include "leveldb/write_batch.h"
+
+namespace leveldb {
+
+class MemTable;
+
+// WriteBatchInternal provides static methods for manipulating a
+// WriteBatch that we don't want in the public WriteBatch interface.
+class WriteBatchInternal {
+ public:
+  // Return the number of entries in the batch.
+  static int Count(const WriteBatch* batch);
+
+  // Set the count for the number of entries in the batch.
+  static void SetCount(WriteBatch* batch, int n);
+
+  // Return the sequence number for the start of this batch.
+  static SequenceNumber Sequence(const WriteBatch* batch);
+
+  // Store the specified number as the sequence number for the start of
+  // this batch.
+  static void SetSequence(WriteBatch* batch, SequenceNumber seq);
+
+  static Slice Contents(const WriteBatch* batch) {
+    return Slice(batch->rep_);
+  }
+
+  static size_t ByteSize(const WriteBatch* batch) {
+    return batch->rep_.size();
+  }
+
+  static void SetContents(WriteBatch* batch, const Slice& contents);
+
+  static Status InsertInto(const WriteBatch* batch, MemTable* memtable);
+
+  static void Append(WriteBatch* dst, const WriteBatch* src);
+};
+
+}  // namespace leveldb
+
+
+#endif  // STORAGE_LEVELDB_DB_WRITE_BATCH_INTERNAL_H_
diff --git a/depend/zcash/src/leveldb/db/write_batch_test.cc b/depend/zcash/src/leveldb/db/write_batch_test.cc
new file mode 100644
index 000000000..9064e3d85
--- /dev/null
+++ b/depend/zcash/src/leveldb/db/write_batch_test.cc
@@ -0,0 +1,120 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "leveldb/db.h"
+
+#include "db/memtable.h"
+#include "db/write_batch_internal.h"
+#include "leveldb/env.h"
+#include "util/logging.h"
+#include "util/testharness.h"
+
+namespace leveldb {
+
+static std::string PrintContents(WriteBatch* b) {
+  InternalKeyComparator cmp(BytewiseComparator());
+  MemTable* mem = new MemTable(cmp);
+  mem->Ref();
+  std::string state;
+  Status s = WriteBatchInternal::InsertInto(b, mem);
+  int count = 0;
+  Iterator* iter = mem->NewIterator();
+  for (iter->SeekToFirst(); iter->Valid(); iter->Next()) {
+    ParsedInternalKey ikey;
+    ASSERT_TRUE(ParseInternalKey(iter->key(), &ikey));
+    switch (ikey.type) {
+      case kTypeValue:
+        state.append("Put(");
+        state.append(ikey.user_key.ToString());
+        state.append(", ");
+        state.append(iter->value().ToString());
+        state.append(")");
+        count++;
+        break;
+      case kTypeDeletion:
+        state.append("Delete(");
+        state.append(ikey.user_key.ToString());
+        state.append(")");
+        count++;
+        break;
+    }
+    state.append("@");
+    state.append(NumberToString(ikey.sequence));
+  }
+  delete iter;
+  if (!s.ok()) {
+    state.append("ParseError()");
+  } else if (count != WriteBatchInternal::Count(b)) {
+    state.append("CountMismatch()");
+  }
+  mem->Unref();
+  return state;
+}
+
+class WriteBatchTest { };
+
+TEST(WriteBatchTest, Empty) {
+  WriteBatch batch;
+  ASSERT_EQ("", PrintContents(&batch));
+  ASSERT_EQ(0, WriteBatchInternal::Count(&batch));
+}
+
+TEST(WriteBatchTest, Multiple) {
+  WriteBatch batch;
+  batch.Put(Slice("foo"), Slice("bar"));
+  batch.Delete(Slice("box"));
+  batch.Put(Slice("baz"), Slice("boo"));
+  WriteBatchInternal::SetSequence(&batch, 100);
+  ASSERT_EQ(100, WriteBatchInternal::Sequence(&batch));
+  ASSERT_EQ(3, WriteBatchInternal::Count(&batch));
+  ASSERT_EQ("Put(baz, boo)@102"
+            "Delete(box)@101"
+            "Put(foo, bar)@100",
+            PrintContents(&batch));
+}
+
+TEST(WriteBatchTest, Corruption) {
+  WriteBatch batch;
+  batch.Put(Slice("foo"), Slice("bar"));
+  batch.Delete(Slice("box"));
+  WriteBatchInternal::SetSequence(&batch, 200);
+  Slice contents = WriteBatchInternal::Contents(&batch);
+  WriteBatchInternal::SetContents(&batch,
+                                  Slice(contents.data(),contents.size()-1));
+  ASSERT_EQ("Put(foo, bar)@200"
+            "ParseError()",
+            PrintContents(&batch));
+}
+
+TEST(WriteBatchTest, Append) {
+  WriteBatch b1, b2;
+  WriteBatchInternal::SetSequence(&b1, 200);
+  WriteBatchInternal::SetSequence(&b2, 300);
+  WriteBatchInternal::Append(&b1, &b2);
+  ASSERT_EQ("",
+            PrintContents(&b1));
+  b2.Put("a", "va");
+  WriteBatchInternal::Append(&b1, &b2);
+  ASSERT_EQ("Put(a, va)@200",
+            PrintContents(&b1));
+  b2.Clear();
+  b2.Put("b", "vb");
+  WriteBatchInternal::Append(&b1, &b2);
+  ASSERT_EQ("Put(a, va)@200"
+            "Put(b, vb)@201",
+            PrintContents(&b1));
+  b2.Delete("foo");
+  WriteBatchInternal::Append(&b1, &b2);
+  ASSERT_EQ("Put(a, va)@200"
+            "Put(b, vb)@202"
+            "Put(b, vb)@201"
+            "Delete(foo)@203",
+            PrintContents(&b1));
+}
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/doc/bench/db_bench_sqlite3.cc b/depend/zcash/src/leveldb/doc/bench/db_bench_sqlite3.cc
new file mode 100644
index 000000000..e63aaa8dc
--- /dev/null
+++ b/depend/zcash/src/leveldb/doc/bench/db_bench_sqlite3.cc
@@ -0,0 +1,718 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <sqlite3.h>
+#include "util/histogram.h"
+#include "util/random.h"
+#include "util/testutil.h"
+
+// Comma-separated list of operations to run in the specified order
+//   Actual benchmarks:
+//
+//   fillseq       -- write N values in sequential key order in async mode
+//   fillseqsync   -- write N/100 values in sequential key order in sync mode
+//   fillseqbatch  -- batch write N values in sequential key order in async mode
+//   fillrandom    -- write N values in random key order in async mode
+//   fillrandsync  -- write N/100 values in random key order in sync mode
+//   fillrandbatch -- batch write N values in sequential key order in async mode
+//   overwrite     -- overwrite N values in random key order in async mode
+//   fillrand100K  -- write N/1000 100K values in random order in async mode
+//   fillseq100K   -- write N/1000 100K values in sequential order in async mode
+//   readseq       -- read N times sequentially
+//   readrandom    -- read N times in random order
+//   readrand100K  -- read N/1000 100K values in sequential order in async mode
+static const char* FLAGS_benchmarks =
+    "fillseq,"
+    "fillseqsync,"
+    "fillseqbatch,"
+    "fillrandom,"
+    "fillrandsync,"
+    "fillrandbatch,"
+    "overwrite,"
+    "overwritebatch,"
+    "readrandom,"
+    "readseq,"
+    "fillrand100K,"
+    "fillseq100K,"
+    "readseq,"
+    "readrand100K,"
+    ;
+
+// Number of key/values to place in database
+static int FLAGS_num = 1000000;
+
+// Number of read operations to do.  If negative, do FLAGS_num reads.
+static int FLAGS_reads = -1;
+
+// Size of each value
+static int FLAGS_value_size = 100;
+
+// Print histogram of operation timings
+static bool FLAGS_histogram = false;
+
+// Arrange to generate values that shrink to this fraction of
+// their original size after compression
+static double FLAGS_compression_ratio = 0.5;
+
+// Page size. Default 1 KB.
+static int FLAGS_page_size = 1024;
+
+// Number of pages.
+// Default cache size = FLAGS_page_size * FLAGS_num_pages = 4 MB.
+static int FLAGS_num_pages = 4096;
+
+// If true, do not destroy the existing database.  If you set this
+// flag and also specify a benchmark that wants a fresh database, that
+// benchmark will fail.
+static bool FLAGS_use_existing_db = false;
+
+// If true, we allow batch writes to occur
+static bool FLAGS_transaction = true;
+
+// If true, we enable Write-Ahead Logging
+static bool FLAGS_WAL_enabled = true;
+
+// Use the db with the following name.
+static const char* FLAGS_db = NULL;
+
+inline
+static void ExecErrorCheck(int status, char *err_msg) {
+  if (status != SQLITE_OK) {
+    fprintf(stderr, "SQL error: %s\n", err_msg);
+    sqlite3_free(err_msg);
+    exit(1);
+  }
+}
+
+inline
+static void StepErrorCheck(int status) {
+  if (status != SQLITE_DONE) {
+    fprintf(stderr, "SQL step error: status = %d\n", status);
+    exit(1);
+  }
+}
+
+inline
+static void ErrorCheck(int status) {
+  if (status != SQLITE_OK) {
+    fprintf(stderr, "sqlite3 error: status = %d\n", status);
+    exit(1);
+  }
+}
+
+inline
+static void WalCheckpoint(sqlite3* db_) {
+  // Flush all writes to disk
+  if (FLAGS_WAL_enabled) {
+    sqlite3_wal_checkpoint_v2(db_, NULL, SQLITE_CHECKPOINT_FULL, NULL, NULL);
+  }
+}
+
+namespace leveldb {
+
+// Helper for quickly generating random data.
+namespace {
+class RandomGenerator {
+ private:
+  std::string data_;
+  int pos_;
+
+ public:
+  RandomGenerator() {
+    // We use a limited amount of data over and over again and ensure
+    // that it is larger than the compression window (32KB), and also
+    // large enough to serve all typical value sizes we want to write.
+    Random rnd(301);
+    std::string piece;
+    while (data_.size() < 1048576) {
+      // Add a short fragment that is as compressible as specified
+      // by FLAGS_compression_ratio.
+      test::CompressibleString(&rnd, FLAGS_compression_ratio, 100, &piece);
+      data_.append(piece);
+    }
+    pos_ = 0;
+  }
+
+  Slice Generate(int len) {
+    if (pos_ + len > data_.size()) {
+      pos_ = 0;
+      assert(len < data_.size());
+    }
+    pos_ += len;
+    return Slice(data_.data() + pos_ - len, len);
+  }
+};
+
+static Slice TrimSpace(Slice s) {
+  int start = 0;
+  while (start < s.size() && isspace(s[start])) {
+    start++;
+  }
+  int limit = s.size();
+  while (limit > start && isspace(s[limit-1])) {
+    limit--;
+  }
+  return Slice(s.data() + start, limit - start);
+}
+
+}  // namespace
+
+class Benchmark {
+ private:
+  sqlite3* db_;
+  int db_num_;
+  int num_;
+  int reads_;
+  double start_;
+  double last_op_finish_;
+  int64_t bytes_;
+  std::string message_;
+  Histogram hist_;
+  RandomGenerator gen_;
+  Random rand_;
+
+  // State kept for progress messages
+  int done_;
+  int next_report_;     // When to report next
+
+  void PrintHeader() {
+    const int kKeySize = 16;
+    PrintEnvironment();
+    fprintf(stdout, "Keys:       %d bytes each\n", kKeySize);
+    fprintf(stdout, "Values:     %d bytes each\n", FLAGS_value_size);
+    fprintf(stdout, "Entries:    %d\n", num_);
+    fprintf(stdout, "RawSize:    %.1f MB (estimated)\n",
+            ((static_cast<int64_t>(kKeySize + FLAGS_value_size) * num_)
+             / 1048576.0));
+    PrintWarnings();
+    fprintf(stdout, "------------------------------------------------\n");
+  }
+
+  void PrintWarnings() {
+#if defined(__GNUC__) && !defined(__OPTIMIZE__)
+    fprintf(stdout,
+            "WARNING: Optimization is disabled: benchmarks unnecessarily slow\n"
+            );
+#endif
+#ifndef NDEBUG
+    fprintf(stdout,
+            "WARNING: Assertions are enabled; benchmarks unnecessarily slow\n");
+#endif
+  }
+
+  void PrintEnvironment() {
+    fprintf(stderr, "SQLite:     version %s\n", SQLITE_VERSION);
+
+#if defined(__linux)
+    time_t now = time(NULL);
+    fprintf(stderr, "Date:       %s", ctime(&now));  // ctime() adds newline
+
+    FILE* cpuinfo = fopen("/proc/cpuinfo", "r");
+    if (cpuinfo != NULL) {
+      char line[1000];
+      int num_cpus = 0;
+      std::string cpu_type;
+      std::string cache_size;
+      while (fgets(line, sizeof(line), cpuinfo) != NULL) {
+        const char* sep = strchr(line, ':');
+        if (sep == NULL) {
+          continue;
+        }
+        Slice key = TrimSpace(Slice(line, sep - 1 - line));
+        Slice val = TrimSpace(Slice(sep + 1));
+        if (key == "model name") {
+          ++num_cpus;
+          cpu_type = val.ToString();
+        } else if (key == "cache size") {
+          cache_size = val.ToString();
+        }
+      }
+      fclose(cpuinfo);
+      fprintf(stderr, "CPU:        %d * %s\n", num_cpus, cpu_type.c_str());
+      fprintf(stderr, "CPUCache:   %s\n", cache_size.c_str());
+    }
+#endif
+  }
+
+  void Start() {
+    start_ = Env::Default()->NowMicros() * 1e-6;
+    bytes_ = 0;
+    message_.clear();
+    last_op_finish_ = start_;
+    hist_.Clear();
+    done_ = 0;
+    next_report_ = 100;
+  }
+
+  void FinishedSingleOp() {
+    if (FLAGS_histogram) {
+      double now = Env::Default()->NowMicros() * 1e-6;
+      double micros = (now - last_op_finish_) * 1e6;
+      hist_.Add(micros);
+      if (micros > 20000) {
+        fprintf(stderr, "long op: %.1f micros%30s\r", micros, "");
+        fflush(stderr);
+      }
+      last_op_finish_ = now;
+    }
+
+    done_++;
+    if (done_ >= next_report_) {
+      if      (next_report_ < 1000)   next_report_ += 100;
+      else if (next_report_ < 5000)   next_report_ += 500;
+      else if (next_report_ < 10000)  next_report_ += 1000;
+      else if (next_report_ < 50000)  next_report_ += 5000;
+      else if (next_report_ < 100000) next_report_ += 10000;
+      else if (next_report_ < 500000) next_report_ += 50000;
+      else                            next_report_ += 100000;
+      fprintf(stderr, "... finished %d ops%30s\r", done_, "");
+      fflush(stderr);
+    }
+  }
+
+  void Stop(const Slice& name) {
+    double finish = Env::Default()->NowMicros() * 1e-6;
+
+    // Pretend at least one op was done in case we are running a benchmark
+    // that does not call FinishedSingleOp().
+    if (done_ < 1) done_ = 1;
+
+    if (bytes_ > 0) {
+      char rate[100];
+      snprintf(rate, sizeof(rate), "%6.1f MB/s",
+               (bytes_ / 1048576.0) / (finish - start_));
+      if (!message_.empty()) {
+        message_  = std::string(rate) + " " + message_;
+      } else {
+        message_ = rate;
+      }
+    }
+
+    fprintf(stdout, "%-12s : %11.3f micros/op;%s%s\n",
+            name.ToString().c_str(),
+            (finish - start_) * 1e6 / done_,
+            (message_.empty() ? "" : " "),
+            message_.c_str());
+    if (FLAGS_histogram) {
+      fprintf(stdout, "Microseconds per op:\n%s\n", hist_.ToString().c_str());
+    }
+    fflush(stdout);
+  }
+
+ public:
+  enum Order {
+    SEQUENTIAL,
+    RANDOM
+  };
+  enum DBState {
+    FRESH,
+    EXISTING
+  };
+
+  Benchmark()
+  : db_(NULL),
+    db_num_(0),
+    num_(FLAGS_num),
+    reads_(FLAGS_reads < 0 ? FLAGS_num : FLAGS_reads),
+    bytes_(0),
+    rand_(301) {
+    std::vector<std::string> files;
+    std::string test_dir;
+    Env::Default()->GetTestDirectory(&test_dir);
+    Env::Default()->GetChildren(test_dir, &files);
+    if (!FLAGS_use_existing_db) {
+      for (int i = 0; i < files.size(); i++) {
+        if (Slice(files[i]).starts_with("dbbench_sqlite3")) {
+          std::string file_name(test_dir);
+          file_name += "/";
+          file_name += files[i];
+          Env::Default()->DeleteFile(file_name.c_str());
+        }
+      }
+    }
+  }
+
+  ~Benchmark() {
+    int status = sqlite3_close(db_);
+    ErrorCheck(status);
+  }
+
+  void Run() {
+    PrintHeader();
+    Open();
+
+    const char* benchmarks = FLAGS_benchmarks;
+    while (benchmarks != NULL) {
+      const char* sep = strchr(benchmarks, ',');
+      Slice name;
+      if (sep == NULL) {
+        name = benchmarks;
+        benchmarks = NULL;
+      } else {
+        name = Slice(benchmarks, sep - benchmarks);
+        benchmarks = sep + 1;
+      }
+
+      bytes_ = 0;
+      Start();
+
+      bool known = true;
+      bool write_sync = false;
+      if (name == Slice("fillseq")) {
+        Write(write_sync, SEQUENTIAL, FRESH, num_, FLAGS_value_size, 1);
+        WalCheckpoint(db_);
+      } else if (name == Slice("fillseqbatch")) {
+        Write(write_sync, SEQUENTIAL, FRESH, num_, FLAGS_value_size, 1000);
+        WalCheckpoint(db_);
+      } else if (name == Slice("fillrandom")) {
+        Write(write_sync, RANDOM, FRESH, num_, FLAGS_value_size, 1);
+        WalCheckpoint(db_);
+      } else if (name == Slice("fillrandbatch")) {
+        Write(write_sync, RANDOM, FRESH, num_, FLAGS_value_size, 1000);
+        WalCheckpoint(db_);
+      } else if (name == Slice("overwrite")) {
+        Write(write_sync, RANDOM, EXISTING, num_, FLAGS_value_size, 1);
+        WalCheckpoint(db_);
+      } else if (name == Slice("overwritebatch")) {
+        Write(write_sync, RANDOM, EXISTING, num_, FLAGS_value_size, 1000);
+        WalCheckpoint(db_);
+      } else if (name == Slice("fillrandsync")) {
+        write_sync = true;
+        Write(write_sync, RANDOM, FRESH, num_ / 100, FLAGS_value_size, 1);
+        WalCheckpoint(db_);
+      } else if (name == Slice("fillseqsync")) {
+        write_sync = true;
+        Write(write_sync, SEQUENTIAL, FRESH, num_ / 100, FLAGS_value_size, 1);
+        WalCheckpoint(db_);
+      } else if (name == Slice("fillrand100K")) {
+        Write(write_sync, RANDOM, FRESH, num_ / 1000, 100 * 1000, 1);
+        WalCheckpoint(db_);
+      } else if (name == Slice("fillseq100K")) {
+        Write(write_sync, SEQUENTIAL, FRESH, num_ / 1000, 100 * 1000, 1);
+        WalCheckpoint(db_);
+      } else if (name == Slice("readseq")) {
+        ReadSequential();
+      } else if (name == Slice("readrandom")) {
+        Read(RANDOM, 1);
+      } else if (name == Slice("readrand100K")) {
+        int n = reads_;
+        reads_ /= 1000;
+        Read(RANDOM, 1);
+        reads_ = n;
+      } else {
+        known = false;
+        if (name != Slice()) {  // No error message for empty name
+          fprintf(stderr, "unknown benchmark '%s'\n", name.ToString().c_str());
+        }
+      }
+      if (known) {
+        Stop(name);
+      }
+    }
+  }
+
+  void Open() {
+    assert(db_ == NULL);
+
+    int status;
+    char file_name[100];
+    char* err_msg = NULL;
+    db_num_++;
+
+    // Open database
+    std::string tmp_dir;
+    Env::Default()->GetTestDirectory(&tmp_dir);
+    snprintf(file_name, sizeof(file_name),
+             "%s/dbbench_sqlite3-%d.db",
+             tmp_dir.c_str(),
+             db_num_);
+    status = sqlite3_open(file_name, &db_);
+    if (status) {
+      fprintf(stderr, "open error: %s\n", sqlite3_errmsg(db_));
+      exit(1);
+    }
+
+    // Change SQLite cache size
+    char cache_size[100];
+    snprintf(cache_size, sizeof(cache_size), "PRAGMA cache_size = %d",
+             FLAGS_num_pages);
+    status = sqlite3_exec(db_, cache_size, NULL, NULL, &err_msg);
+    ExecErrorCheck(status, err_msg);
+
+    // FLAGS_page_size is defaulted to 1024
+    if (FLAGS_page_size != 1024) {
+      char page_size[100];
+      snprintf(page_size, sizeof(page_size), "PRAGMA page_size = %d",
+               FLAGS_page_size);
+      status = sqlite3_exec(db_, page_size, NULL, NULL, &err_msg);
+      ExecErrorCheck(status, err_msg);
+    }
+
+    // Change journal mode to WAL if WAL enabled flag is on
+    if (FLAGS_WAL_enabled) {
+      std::string WAL_stmt = "PRAGMA journal_mode = WAL";
+
+      // LevelDB's default cache size is a combined 4 MB
+      std::string WAL_checkpoint = "PRAGMA wal_autocheckpoint = 4096";
+      status = sqlite3_exec(db_, WAL_stmt.c_str(), NULL, NULL, &err_msg);
+      ExecErrorCheck(status, err_msg);
+      status = sqlite3_exec(db_, WAL_checkpoint.c_str(), NULL, NULL, &err_msg);
+      ExecErrorCheck(status, err_msg);
+    }
+
+    // Change locking mode to exclusive and create tables/index for database
+    std::string locking_stmt = "PRAGMA locking_mode = EXCLUSIVE";
+    std::string create_stmt =
+          "CREATE TABLE test (key blob, value blob, PRIMARY KEY(key))";
+    std::string stmt_array[] = { locking_stmt, create_stmt };
+    int stmt_array_length = sizeof(stmt_array) / sizeof(std::string);
+    for (int i = 0; i < stmt_array_length; i++) {
+      status = sqlite3_exec(db_, stmt_array[i].c_str(), NULL, NULL, &err_msg);
+      ExecErrorCheck(status, err_msg);
+    }
+  }
+
+  void Write(bool write_sync, Order order, DBState state,
+             int num_entries, int value_size, int entries_per_batch) {
+    // Create new database if state == FRESH
+    if (state == FRESH) {
+      if (FLAGS_use_existing_db) {
+        message_ = "skipping (--use_existing_db is true)";
+        return;
+      }
+      sqlite3_close(db_);
+      db_ = NULL;
+      Open();
+      Start();
+    }
+
+    if (num_entries != num_) {
+      char msg[100];
+      snprintf(msg, sizeof(msg), "(%d ops)", num_entries);
+      message_ = msg;
+    }
+
+    char* err_msg = NULL;
+    int status;
+
+    sqlite3_stmt *replace_stmt, *begin_trans_stmt, *end_trans_stmt;
+    std::string replace_str = "REPLACE INTO test (key, value) VALUES (?, ?)";
+    std::string begin_trans_str = "BEGIN TRANSACTION;";
+    std::string end_trans_str = "END TRANSACTION;";
+
+    // Check for synchronous flag in options
+    std::string sync_stmt = (write_sync) ? "PRAGMA synchronous = FULL" :
+                                           "PRAGMA synchronous = OFF";
+    status = sqlite3_exec(db_, sync_stmt.c_str(), NULL, NULL, &err_msg);
+    ExecErrorCheck(status, err_msg);
+
+    // Preparing sqlite3 statements
+    status = sqlite3_prepare_v2(db_, replace_str.c_str(), -1,
+                                &replace_stmt, NULL);
+    ErrorCheck(status);
+    status = sqlite3_prepare_v2(db_, begin_trans_str.c_str(), -1,
+                                &begin_trans_stmt, NULL);
+    ErrorCheck(status);
+    status = sqlite3_prepare_v2(db_, end_trans_str.c_str(), -1,
+                                &end_trans_stmt, NULL);
+    ErrorCheck(status);
+
+    bool transaction = (entries_per_batch > 1);
+    for (int i = 0; i < num_entries; i += entries_per_batch) {
+      // Begin write transaction
+      if (FLAGS_transaction && transaction) {
+        status = sqlite3_step(begin_trans_stmt);
+        StepErrorCheck(status);
+        status = sqlite3_reset(begin_trans_stmt);
+        ErrorCheck(status);
+      }
+
+      // Create and execute SQL statements
+      for (int j = 0; j < entries_per_batch; j++) {
+        const char* value = gen_.Generate(value_size).data();
+
+        // Create values for key-value pair
+        const int k = (order == SEQUENTIAL) ? i + j :
+                      (rand_.Next() % num_entries);
+        char key[100];
+        snprintf(key, sizeof(key), "%016d", k);
+
+        // Bind KV values into replace_stmt
+        status = sqlite3_bind_blob(replace_stmt, 1, key, 16, SQLITE_STATIC);
+        ErrorCheck(status);
+        status = sqlite3_bind_blob(replace_stmt, 2, value,
+                                   value_size, SQLITE_STATIC);
+        ErrorCheck(status);
+
+        // Execute replace_stmt
+        bytes_ += value_size + strlen(key);
+        status = sqlite3_step(replace_stmt);
+        StepErrorCheck(status);
+
+        // Reset SQLite statement for another use
+        status = sqlite3_clear_bindings(replace_stmt);
+        ErrorCheck(status);
+        status = sqlite3_reset(replace_stmt);
+        ErrorCheck(status);
+
+        FinishedSingleOp();
+      }
+
+      // End write transaction
+      if (FLAGS_transaction && transaction) {
+        status = sqlite3_step(end_trans_stmt);
+        StepErrorCheck(status);
+        status = sqlite3_reset(end_trans_stmt);
+        ErrorCheck(status);
+      }
+    }
+
+    status = sqlite3_finalize(replace_stmt);
+    ErrorCheck(status);
+    status = sqlite3_finalize(begin_trans_stmt);
+    ErrorCheck(status);
+    status = sqlite3_finalize(end_trans_stmt);
+    ErrorCheck(status);
+  }
+
+  void Read(Order order, int entries_per_batch) {
+    int status;
+    sqlite3_stmt *read_stmt, *begin_trans_stmt, *end_trans_stmt;
+
+    std::string read_str = "SELECT * FROM test WHERE key = ?";
+    std::string begin_trans_str = "BEGIN TRANSACTION;";
+    std::string end_trans_str = "END TRANSACTION;";
+
+    // Preparing sqlite3 statements
+    status = sqlite3_prepare_v2(db_, begin_trans_str.c_str(), -1,
+                                &begin_trans_stmt, NULL);
+    ErrorCheck(status);
+    status = sqlite3_prepare_v2(db_, end_trans_str.c_str(), -1,
+                                &end_trans_stmt, NULL);
+    ErrorCheck(status);
+    status = sqlite3_prepare_v2(db_, read_str.c_str(), -1, &read_stmt, NULL);
+    ErrorCheck(status);
+
+    bool transaction = (entries_per_batch > 1);
+    for (int i = 0; i < reads_; i += entries_per_batch) {
+      // Begin read transaction
+      if (FLAGS_transaction && transaction) {
+        status = sqlite3_step(begin_trans_stmt);
+        StepErrorCheck(status);
+        status = sqlite3_reset(begin_trans_stmt);
+        ErrorCheck(status);
+      }
+
+      // Create and execute SQL statements
+      for (int j = 0; j < entries_per_batch; j++) {
+        // Create key value
+        char key[100];
+        int k = (order == SEQUENTIAL) ? i + j : (rand_.Next() % reads_);
+        snprintf(key, sizeof(key), "%016d", k);
+
+        // Bind key value into read_stmt
+        status = sqlite3_bind_blob(read_stmt, 1, key, 16, SQLITE_STATIC);
+        ErrorCheck(status);
+
+        // Execute read statement
+        while ((status = sqlite3_step(read_stmt)) == SQLITE_ROW) {}
+        StepErrorCheck(status);
+
+        // Reset SQLite statement for another use
+        status = sqlite3_clear_bindings(read_stmt);
+        ErrorCheck(status);
+        status = sqlite3_reset(read_stmt);
+        ErrorCheck(status);
+        FinishedSingleOp();
+      }
+
+      // End read transaction
+      if (FLAGS_transaction && transaction) {
+        status = sqlite3_step(end_trans_stmt);
+        StepErrorCheck(status);
+        status = sqlite3_reset(end_trans_stmt);
+        ErrorCheck(status);
+      }
+    }
+
+    status = sqlite3_finalize(read_stmt);
+    ErrorCheck(status);
+    status = sqlite3_finalize(begin_trans_stmt);
+    ErrorCheck(status);
+    status = sqlite3_finalize(end_trans_stmt);
+    ErrorCheck(status);
+  }
+
+  void ReadSequential() {
+    int status;
+    sqlite3_stmt *pStmt;
+    std::string read_str = "SELECT * FROM test ORDER BY key";
+
+    status = sqlite3_prepare_v2(db_, read_str.c_str(), -1, &pStmt, NULL);
+    ErrorCheck(status);
+    for (int i = 0; i < reads_ && SQLITE_ROW == sqlite3_step(pStmt); i++) {
+      bytes_ += sqlite3_column_bytes(pStmt, 1) + sqlite3_column_bytes(pStmt, 2);
+      FinishedSingleOp();
+    }
+
+    status = sqlite3_finalize(pStmt);
+    ErrorCheck(status);
+  }
+
+};
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  std::string default_db_path;
+  for (int i = 1; i < argc; i++) {
+    double d;
+    int n;
+    char junk;
+    if (leveldb::Slice(argv[i]).starts_with("--benchmarks=")) {
+      FLAGS_benchmarks = argv[i] + strlen("--benchmarks=");
+    } else if (sscanf(argv[i], "--histogram=%d%c", &n, &junk) == 1 &&
+               (n == 0 || n == 1)) {
+      FLAGS_histogram = n;
+    } else if (sscanf(argv[i], "--compression_ratio=%lf%c", &d, &junk) == 1) {
+      FLAGS_compression_ratio = d;
+    } else if (sscanf(argv[i], "--use_existing_db=%d%c", &n, &junk) == 1 &&
+               (n == 0 || n == 1)) {
+      FLAGS_use_existing_db = n;
+    } else if (sscanf(argv[i], "--num=%d%c", &n, &junk) == 1) {
+      FLAGS_num = n;
+    } else if (sscanf(argv[i], "--reads=%d%c", &n, &junk) == 1) {
+      FLAGS_reads = n;
+    } else if (sscanf(argv[i], "--value_size=%d%c", &n, &junk) == 1) {
+      FLAGS_value_size = n;
+    } else if (leveldb::Slice(argv[i]) == leveldb::Slice("--no_transaction")) {
+      FLAGS_transaction = false;
+    } else if (sscanf(argv[i], "--page_size=%d%c", &n, &junk) == 1) {
+      FLAGS_page_size = n;
+    } else if (sscanf(argv[i], "--num_pages=%d%c", &n, &junk) == 1) {
+      FLAGS_num_pages = n;
+    } else if (sscanf(argv[i], "--WAL_enabled=%d%c", &n, &junk) == 1 &&
+               (n == 0 || n == 1)) {
+      FLAGS_WAL_enabled = n;
+    } else if (strncmp(argv[i], "--db=", 5) == 0) {
+      FLAGS_db = argv[i] + 5;
+    } else {
+      fprintf(stderr, "Invalid flag '%s'\n", argv[i]);
+      exit(1);
+    }
+  }
+
+  // Choose a location for the test database if none given with --db=<path>
+  if (FLAGS_db == NULL) {
+      leveldb::Env::Default()->GetTestDirectory(&default_db_path);
+      default_db_path += "/dbbench";
+      FLAGS_db = default_db_path.c_str();
+  }
+
+  leveldb::Benchmark benchmark;
+  benchmark.Run();
+  return 0;
+}
diff --git a/depend/zcash/src/leveldb/doc/bench/db_bench_tree_db.cc b/depend/zcash/src/leveldb/doc/bench/db_bench_tree_db.cc
new file mode 100644
index 000000000..4ca381f11
--- /dev/null
+++ b/depend/zcash/src/leveldb/doc/bench/db_bench_tree_db.cc
@@ -0,0 +1,528 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <kcpolydb.h>
+#include "util/histogram.h"
+#include "util/random.h"
+#include "util/testutil.h"
+
+// Comma-separated list of operations to run in the specified order
+//   Actual benchmarks:
+//
+//   fillseq       -- write N values in sequential key order in async mode
+//   fillrandom    -- write N values in random key order in async mode
+//   overwrite     -- overwrite N values in random key order in async mode
+//   fillseqsync   -- write N/100 values in sequential key order in sync mode
+//   fillrandsync  -- write N/100 values in random key order in sync mode
+//   fillrand100K  -- write N/1000 100K values in random order in async mode
+//   fillseq100K   -- write N/1000 100K values in seq order in async mode
+//   readseq       -- read N times sequentially
+//   readseq100K   -- read N/1000 100K values in sequential order in async mode
+//   readrand100K  -- read N/1000 100K values in sequential order in async mode
+//   readrandom    -- read N times in random order
+static const char* FLAGS_benchmarks =
+    "fillseq,"
+    "fillseqsync,"
+    "fillrandsync,"
+    "fillrandom,"
+    "overwrite,"
+    "readrandom,"
+    "readseq,"
+    "fillrand100K,"
+    "fillseq100K,"
+    "readseq100K,"
+    "readrand100K,"
+    ;
+
+// Number of key/values to place in database
+static int FLAGS_num = 1000000;
+
+// Number of read operations to do.  If negative, do FLAGS_num reads.
+static int FLAGS_reads = -1;
+
+// Size of each value
+static int FLAGS_value_size = 100;
+
+// Arrange to generate values that shrink to this fraction of
+// their original size after compression
+static double FLAGS_compression_ratio = 0.5;
+
+// Print histogram of operation timings
+static bool FLAGS_histogram = false;
+
+// Cache size. Default 4 MB
+static int FLAGS_cache_size = 4194304;
+
+// Page size. Default 1 KB
+static int FLAGS_page_size = 1024;
+
+// If true, do not destroy the existing database.  If you set this
+// flag and also specify a benchmark that wants a fresh database, that
+// benchmark will fail.
+static bool FLAGS_use_existing_db = false;
+
+// Compression flag. If true, compression is on. If false, compression
+// is off.
+static bool FLAGS_compression = true;
+
+// Use the db with the following name.
+static const char* FLAGS_db = NULL;
+
+inline
+static void DBSynchronize(kyotocabinet::TreeDB* db_)
+{
+  // Synchronize will flush writes to disk
+  if (!db_->synchronize()) {
+    fprintf(stderr, "synchronize error: %s\n", db_->error().name());
+  }
+}
+
+namespace leveldb {
+
+// Helper for quickly generating random data.
+namespace {
+class RandomGenerator {
+ private:
+  std::string data_;
+  int pos_;
+
+ public:
+  RandomGenerator() {
+    // We use a limited amount of data over and over again and ensure
+    // that it is larger than the compression window (32KB), and also
+    // large enough to serve all typical value sizes we want to write.
+    Random rnd(301);
+    std::string piece;
+    while (data_.size() < 1048576) {
+      // Add a short fragment that is as compressible as specified
+      // by FLAGS_compression_ratio.
+      test::CompressibleString(&rnd, FLAGS_compression_ratio, 100, &piece);
+      data_.append(piece);
+    }
+    pos_ = 0;
+  }
+
+  Slice Generate(int len) {
+    if (pos_ + len > data_.size()) {
+      pos_ = 0;
+      assert(len < data_.size());
+    }
+    pos_ += len;
+    return Slice(data_.data() + pos_ - len, len);
+  }
+};
+
+static Slice TrimSpace(Slice s) {
+  int start = 0;
+  while (start < s.size() && isspace(s[start])) {
+    start++;
+  }
+  int limit = s.size();
+  while (limit > start && isspace(s[limit-1])) {
+    limit--;
+  }
+  return Slice(s.data() + start, limit - start);
+}
+
+}  // namespace
+
+class Benchmark {
+ private:
+  kyotocabinet::TreeDB* db_;
+  int db_num_;
+  int num_;
+  int reads_;
+  double start_;
+  double last_op_finish_;
+  int64_t bytes_;
+  std::string message_;
+  Histogram hist_;
+  RandomGenerator gen_;
+  Random rand_;
+  kyotocabinet::LZOCompressor<kyotocabinet::LZO::RAW> comp_;
+
+  // State kept for progress messages
+  int done_;
+  int next_report_;     // When to report next
+
+  void PrintHeader() {
+    const int kKeySize = 16;
+    PrintEnvironment();
+    fprintf(stdout, "Keys:       %d bytes each\n", kKeySize);
+    fprintf(stdout, "Values:     %d bytes each (%d bytes after compression)\n",
+            FLAGS_value_size,
+            static_cast<int>(FLAGS_value_size * FLAGS_compression_ratio + 0.5));
+    fprintf(stdout, "Entries:    %d\n", num_);
+    fprintf(stdout, "RawSize:    %.1f MB (estimated)\n",
+            ((static_cast<int64_t>(kKeySize + FLAGS_value_size) * num_)
+             / 1048576.0));
+    fprintf(stdout, "FileSize:   %.1f MB (estimated)\n",
+            (((kKeySize + FLAGS_value_size * FLAGS_compression_ratio) * num_)
+             / 1048576.0));
+    PrintWarnings();
+    fprintf(stdout, "------------------------------------------------\n");
+  }
+
+  void PrintWarnings() {
+#if defined(__GNUC__) && !defined(__OPTIMIZE__)
+    fprintf(stdout,
+            "WARNING: Optimization is disabled: benchmarks unnecessarily slow\n"
+            );
+#endif
+#ifndef NDEBUG
+    fprintf(stdout,
+            "WARNING: Assertions are enabled; benchmarks unnecessarily slow\n");
+#endif
+  }
+
+  void PrintEnvironment() {
+    fprintf(stderr, "Kyoto Cabinet:    version %s, lib ver %d, lib rev %d\n",
+            kyotocabinet::VERSION, kyotocabinet::LIBVER, kyotocabinet::LIBREV);
+
+#if defined(__linux)
+    time_t now = time(NULL);
+    fprintf(stderr, "Date:           %s", ctime(&now));  // ctime() adds newline
+
+    FILE* cpuinfo = fopen("/proc/cpuinfo", "r");
+    if (cpuinfo != NULL) {
+      char line[1000];
+      int num_cpus = 0;
+      std::string cpu_type;
+      std::string cache_size;
+      while (fgets(line, sizeof(line), cpuinfo) != NULL) {
+        const char* sep = strchr(line, ':');
+        if (sep == NULL) {
+          continue;
+        }
+        Slice key = TrimSpace(Slice(line, sep - 1 - line));
+        Slice val = TrimSpace(Slice(sep + 1));
+        if (key == "model name") {
+          ++num_cpus;
+          cpu_type = val.ToString();
+        } else if (key == "cache size") {
+          cache_size = val.ToString();
+        }
+      }
+      fclose(cpuinfo);
+      fprintf(stderr, "CPU:            %d * %s\n", num_cpus, cpu_type.c_str());
+      fprintf(stderr, "CPUCache:       %s\n", cache_size.c_str());
+    }
+#endif
+  }
+
+  void Start() {
+    start_ = Env::Default()->NowMicros() * 1e-6;
+    bytes_ = 0;
+    message_.clear();
+    last_op_finish_ = start_;
+    hist_.Clear();
+    done_ = 0;
+    next_report_ = 100;
+  }
+
+  void FinishedSingleOp() {
+    if (FLAGS_histogram) {
+      double now = Env::Default()->NowMicros() * 1e-6;
+      double micros = (now - last_op_finish_) * 1e6;
+      hist_.Add(micros);
+      if (micros > 20000) {
+        fprintf(stderr, "long op: %.1f micros%30s\r", micros, "");
+        fflush(stderr);
+      }
+      last_op_finish_ = now;
+    }
+
+    done_++;
+    if (done_ >= next_report_) {
+      if      (next_report_ < 1000)   next_report_ += 100;
+      else if (next_report_ < 5000)   next_report_ += 500;
+      else if (next_report_ < 10000)  next_report_ += 1000;
+      else if (next_report_ < 50000)  next_report_ += 5000;
+      else if (next_report_ < 100000) next_report_ += 10000;
+      else if (next_report_ < 500000) next_report_ += 50000;
+      else                            next_report_ += 100000;
+      fprintf(stderr, "... finished %d ops%30s\r", done_, "");
+      fflush(stderr);
+    }
+  }
+
+  void Stop(const Slice& name) {
+    double finish = Env::Default()->NowMicros() * 1e-6;
+
+    // Pretend at least one op was done in case we are running a benchmark
+    // that does not call FinishedSingleOp().
+    if (done_ < 1) done_ = 1;
+
+    if (bytes_ > 0) {
+      char rate[100];
+      snprintf(rate, sizeof(rate), "%6.1f MB/s",
+               (bytes_ / 1048576.0) / (finish - start_));
+      if (!message_.empty()) {
+        message_  = std::string(rate) + " " + message_;
+      } else {
+        message_ = rate;
+      }
+    }
+
+    fprintf(stdout, "%-12s : %11.3f micros/op;%s%s\n",
+            name.ToString().c_str(),
+            (finish - start_) * 1e6 / done_,
+            (message_.empty() ? "" : " "),
+            message_.c_str());
+    if (FLAGS_histogram) {
+      fprintf(stdout, "Microseconds per op:\n%s\n", hist_.ToString().c_str());
+    }
+    fflush(stdout);
+  }
+
+ public:
+  enum Order {
+    SEQUENTIAL,
+    RANDOM
+  };
+  enum DBState {
+    FRESH,
+    EXISTING
+  };
+
+  Benchmark()
+  : db_(NULL),
+    num_(FLAGS_num),
+    reads_(FLAGS_reads < 0 ? FLAGS_num : FLAGS_reads),
+    bytes_(0),
+    rand_(301) {
+    std::vector<std::string> files;
+    std::string test_dir;
+    Env::Default()->GetTestDirectory(&test_dir);
+    Env::Default()->GetChildren(test_dir.c_str(), &files);
+    if (!FLAGS_use_existing_db) {
+      for (int i = 0; i < files.size(); i++) {
+        if (Slice(files[i]).starts_with("dbbench_polyDB")) {
+          std::string file_name(test_dir);
+          file_name += "/";
+          file_name += files[i];
+          Env::Default()->DeleteFile(file_name.c_str());
+        }
+      }
+    }
+  }
+
+  ~Benchmark() {
+    if (!db_->close()) {
+      fprintf(stderr, "close error: %s\n", db_->error().name());
+    }
+  }
+
+  void Run() {
+    PrintHeader();
+    Open(false);
+
+    const char* benchmarks = FLAGS_benchmarks;
+    while (benchmarks != NULL) {
+      const char* sep = strchr(benchmarks, ',');
+      Slice name;
+      if (sep == NULL) {
+        name = benchmarks;
+        benchmarks = NULL;
+      } else {
+        name = Slice(benchmarks, sep - benchmarks);
+        benchmarks = sep + 1;
+      }
+
+      Start();
+
+      bool known = true;
+      bool write_sync = false;
+      if (name == Slice("fillseq")) {
+        Write(write_sync, SEQUENTIAL, FRESH, num_, FLAGS_value_size, 1);
+        DBSynchronize(db_);
+      } else if (name == Slice("fillrandom")) {
+        Write(write_sync, RANDOM, FRESH, num_, FLAGS_value_size, 1);
+        DBSynchronize(db_);
+      } else if (name == Slice("overwrite")) {
+        Write(write_sync, RANDOM, EXISTING, num_, FLAGS_value_size, 1);
+        DBSynchronize(db_);
+      } else if (name == Slice("fillrandsync")) {
+        write_sync = true;
+        Write(write_sync, RANDOM, FRESH, num_ / 100, FLAGS_value_size, 1);
+        DBSynchronize(db_);
+      } else if (name == Slice("fillseqsync")) {
+        write_sync = true;
+        Write(write_sync, SEQUENTIAL, FRESH, num_ / 100, FLAGS_value_size, 1);
+        DBSynchronize(db_);
+      } else if (name == Slice("fillrand100K")) {
+        Write(write_sync, RANDOM, FRESH, num_ / 1000, 100 * 1000, 1);
+        DBSynchronize(db_);
+      } else if (name == Slice("fillseq100K")) {
+        Write(write_sync, SEQUENTIAL, FRESH, num_ / 1000, 100 * 1000, 1);
+        DBSynchronize(db_);
+      } else if (name == Slice("readseq")) {
+        ReadSequential();
+      } else if (name == Slice("readrandom")) {
+        ReadRandom();
+      } else if (name == Slice("readrand100K")) {
+        int n = reads_;
+        reads_ /= 1000;
+        ReadRandom();
+        reads_ = n;
+      } else if (name == Slice("readseq100K")) {
+        int n = reads_;
+        reads_ /= 1000;
+        ReadSequential();
+        reads_ = n;
+      } else {
+        known = false;
+        if (name != Slice()) {  // No error message for empty name
+          fprintf(stderr, "unknown benchmark '%s'\n", name.ToString().c_str());
+        }
+      }
+      if (known) {
+        Stop(name);
+      }
+    }
+  }
+
+ private:
+    void Open(bool sync) {
+    assert(db_ == NULL);
+
+    // Initialize db_
+    db_ = new kyotocabinet::TreeDB();
+    char file_name[100];
+    db_num_++;
+    std::string test_dir;
+    Env::Default()->GetTestDirectory(&test_dir);
+    snprintf(file_name, sizeof(file_name),
+             "%s/dbbench_polyDB-%d.kct",
+             test_dir.c_str(),
+             db_num_);
+
+    // Create tuning options and open the database
+    int open_options = kyotocabinet::PolyDB::OWRITER |
+                       kyotocabinet::PolyDB::OCREATE;
+    int tune_options = kyotocabinet::TreeDB::TSMALL |
+        kyotocabinet::TreeDB::TLINEAR;
+    if (FLAGS_compression) {
+      tune_options |= kyotocabinet::TreeDB::TCOMPRESS;
+      db_->tune_compressor(&comp_);
+    }
+    db_->tune_options(tune_options);
+    db_->tune_page_cache(FLAGS_cache_size);
+    db_->tune_page(FLAGS_page_size);
+    db_->tune_map(256LL<<20);
+    if (sync) {
+      open_options |= kyotocabinet::PolyDB::OAUTOSYNC;
+    }
+    if (!db_->open(file_name, open_options)) {
+      fprintf(stderr, "open error: %s\n", db_->error().name());
+    }
+  }
+
+  void Write(bool sync, Order order, DBState state,
+             int num_entries, int value_size, int entries_per_batch) {
+    // Create new database if state == FRESH
+    if (state == FRESH) {
+      if (FLAGS_use_existing_db) {
+        message_ = "skipping (--use_existing_db is true)";
+        return;
+      }
+      delete db_;
+      db_ = NULL;
+      Open(sync);
+      Start();  // Do not count time taken to destroy/open
+    }
+
+    if (num_entries != num_) {
+      char msg[100];
+      snprintf(msg, sizeof(msg), "(%d ops)", num_entries);
+      message_ = msg;
+    }
+
+    // Write to database
+    for (int i = 0; i < num_entries; i++)
+    {
+      const int k = (order == SEQUENTIAL) ? i : (rand_.Next() % num_entries);
+      char key[100];
+      snprintf(key, sizeof(key), "%016d", k);
+      bytes_ += value_size + strlen(key);
+      std::string cpp_key = key;
+      if (!db_->set(cpp_key, gen_.Generate(value_size).ToString())) {
+        fprintf(stderr, "set error: %s\n", db_->error().name());
+      }
+      FinishedSingleOp();
+    }
+  }
+
+  void ReadSequential() {
+    kyotocabinet::DB::Cursor* cur = db_->cursor();
+    cur->jump();
+    std::string ckey, cvalue;
+    while (cur->get(&ckey, &cvalue, true)) {
+      bytes_ += ckey.size() + cvalue.size();
+      FinishedSingleOp();
+    }
+    delete cur;
+  }
+
+  void ReadRandom() {
+    std::string value;
+    for (int i = 0; i < reads_; i++) {
+      char key[100];
+      const int k = rand_.Next() % reads_;
+      snprintf(key, sizeof(key), "%016d", k);
+      db_->get(key, &value);
+      FinishedSingleOp();
+    }
+  }
+};
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  std::string default_db_path;
+  for (int i = 1; i < argc; i++) {
+    double d;
+    int n;
+    char junk;
+    if (leveldb::Slice(argv[i]).starts_with("--benchmarks=")) {
+      FLAGS_benchmarks = argv[i] + strlen("--benchmarks=");
+    } else if (sscanf(argv[i], "--compression_ratio=%lf%c", &d, &junk) == 1) {
+      FLAGS_compression_ratio = d;
+    } else if (sscanf(argv[i], "--histogram=%d%c", &n, &junk) == 1 &&
+               (n == 0 || n == 1)) {
+      FLAGS_histogram = n;
+    } else if (sscanf(argv[i], "--num=%d%c", &n, &junk) == 1) {
+      FLAGS_num = n;
+    } else if (sscanf(argv[i], "--reads=%d%c", &n, &junk) == 1) {
+      FLAGS_reads = n;
+    } else if (sscanf(argv[i], "--value_size=%d%c", &n, &junk) == 1) {
+      FLAGS_value_size = n;
+    } else if (sscanf(argv[i], "--cache_size=%d%c", &n, &junk) == 1) {
+      FLAGS_cache_size = n;
+    } else if (sscanf(argv[i], "--page_size=%d%c", &n, &junk) == 1) {
+      FLAGS_page_size = n;
+    } else if (sscanf(argv[i], "--compression=%d%c", &n, &junk) == 1 &&
+               (n == 0 || n == 1)) {
+      FLAGS_compression = (n == 1) ? true : false;
+    } else if (strncmp(argv[i], "--db=", 5) == 0) {
+      FLAGS_db = argv[i] + 5;
+    } else {
+      fprintf(stderr, "Invalid flag '%s'\n", argv[i]);
+      exit(1);
+    }
+  }
+
+  // Choose a location for the test database if none given with --db=<path>
+  if (FLAGS_db == NULL) {
+      leveldb::Env::Default()->GetTestDirectory(&default_db_path);
+      default_db_path += "/dbbench";
+      FLAGS_db = default_db_path.c_str();
+  }
+
+  leveldb::Benchmark benchmark;
+  benchmark.Run();
+  return 0;
+}
diff --git a/depend/zcash/src/leveldb/doc/benchmark.html b/depend/zcash/src/leveldb/doc/benchmark.html
new file mode 100644
index 000000000..c4639772c
--- /dev/null
+++ b/depend/zcash/src/leveldb/doc/benchmark.html
@@ -0,0 +1,459 @@
+<!DOCTYPE html>
+<html>
+<head>
+<title>LevelDB Benchmarks</title>
+<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
+<style>
+body {
+  font-family:Helvetica,sans-serif;
+  padding:20px;
+}
+
+h2 {
+  padding-top:30px;
+}
+
+table.bn {
+  width:800px;
+  border-collapse:collapse;
+  border:0;
+  padding:0;
+}
+
+table.bnbase {
+  width:650px;
+}
+
+table.bn td {
+  padding:2px 0;
+}
+
+table.bn td.c1 {
+  font-weight:bold;
+  width:150px;
+}
+
+table.bn td.c1 div.e {
+  float:right;
+  font-weight:normal;
+}
+
+table.bn td.c2 {
+  width:150px;
+  text-align:right;
+  padding:2px;
+}
+
+table.bn td.c3 {
+  width:350px;
+}
+
+table.bn td.c4 {
+  width:150px;
+  font-size:small;
+  padding-left:4px;
+}
+
+/* chart bars */
+div.bldb {
+  background-color:#0255df;
+}
+
+div.bkct {
+  background-color:#df5555;
+}
+
+div.bsql {
+  background-color:#aadf55;
+}
+
+.code {
+  font-family:monospace;
+  font-size:large;
+}
+
+.todo {
+  color: red;
+}
+
+</style>
+</head>
+<body>
+<h1>LevelDB Benchmarks</h1>
+<p>Google, July 2011</p>
+<hr>
+
+<p>In order to test LevelDB's performance, we benchmark it against other well-established database implementations. We compare LevelDB (revision 39) against <a href="http://www.sqlite.org/">SQLite3</a> (version 3.7.6.3) and <a href="http://fallabs.com/kyotocabinet/spex.html">Kyoto Cabinet's</a> (version 1.2.67) TreeDB (a B+Tree based key-value store). We would like to acknowledge Scott Hess and Mikio Hirabayashi for their suggestions and contributions to the SQLite3 and Kyoto Cabinet benchmarks, respectively.</p>
+
+<p>Benchmarks were all performed on a six-core Intel(R) Xeon(R) CPU X5650 @ 2.67GHz, with 12288 KB of total L3 cache and 12 GB of DDR3 RAM at 1333 MHz. (Note that LevelDB uses at most two CPUs since the benchmarks are single threaded: one to run the benchmark, and one for background compactions.) We ran the benchmarks on two machines (with identical processors), one with an Ext3 file system and one with an Ext4 file system. The machine with the Ext3 file system has a SATA Hitachi HDS721050CLA362 hard drive. The machine with the Ext4 file system has a SATA Samsung HD502HJ hard drive. Both hard drives spin at 7200 RPM and have hard drive write-caching enabled (using `hdparm -W 1 [device]`). The numbers reported below are the median of three measurements.</p>
+
+<h4>Benchmark Source Code</h4>
+<p>We wrote benchmark tools for SQLite and Kyoto TreeDB based on LevelDB's <span class="code">db_bench</span>. The code for each of the benchmarks resides here:</p>
+<ul>
+	<li> <b>LevelDB:</b> <a href="http://code.google.com/p/leveldb/source/browse/trunk/db/db_bench.cc">db/db_bench.cc</a>.</li>
+	<li> <b>SQLite:</b> <a href="http://code.google.com/p/leveldb/source/browse/#svn%2Ftrunk%2Fdoc%2Fbench%2Fdb_bench_sqlite3.cc">doc/bench/db_bench_sqlite3.cc</a>.</li>
+	<li> <b>Kyoto TreeDB:</b> <a href="http://code.google.com/p/leveldb/source/browse/#svn%2Ftrunk%2Fdoc%2Fbench%2Fdb_bench_tree_db.cc">doc/bench/db_bench_tree_db.cc</a>.</li>
+</ul>
+
+<h4>Custom Build Specifications</h4>
+<ul>
+<li>LevelDB: LevelDB was compiled with the <a href="http://code.google.com/p/google-perftools">tcmalloc</a> library and the <a href="http://code.google.com/p/snappy/">Snappy</a> compression library (revision 33).  Assertions were disabled.</li>
+<li>TreeDB: TreeDB was compiled using the <a href="http://www.oberhumer.com/opensource/lzo/">LZO</a> compression library (version 2.03). Furthermore, we enabled the TSMALL and TLINEAR options when opening the database in order to reduce the footprint of each record.</li>
+<li>SQLite: We tuned SQLite's performance, by setting its locking mode to exclusive.  We also enabled SQLite's <a href="http://www.sqlite.org/draft/wal.html">write-ahead logging</a>.</li>
+</ul>
+
+<h2>1. Baseline Performance</h2>
+<p>This section gives the baseline performance of all the
+databases.  Following sections show how performance changes as various
+parameters are varied.  For the baseline:</p>
+<ul>
+	<li> Each database is allowed 4 MB of cache memory.</li>
+        <li> Databases are opened in <em>asynchronous</em> write mode.
+             (LevelDB's sync option, TreeDB's OAUTOSYNC option, and
+             SQLite3's synchronous options are all turned off).  I.e.,
+             every write is pushed to the operating system, but the
+             benchmark does not wait for the write to reach the disk.</li>
+	<li> Keys are 16 bytes each.</li>
+        <li> Value are 100 bytes each (with enough redundancy so that
+             a simple compressor shrinks them to 50% of their original
+             size).</li>
+	<li> Sequential reads/writes traverse the key space in increasing order.</li>
+	<li> Random reads/writes traverse the key space in random order.</li>
+</ul>
+
+<h3>A. Sequential Reads</h3>
+<table class="bn bnbase">
+<tr><td class="c1">LevelDB</td>
+    <td class="c2">4,030,000 ops/sec</td>
+    <td class="c3"><div class="bldb" style="width:350px">&nbsp;</div></td>
+<tr><td class="c1">Kyoto TreeDB</td>
+    <td class="c2">1,010,000 ops/sec</td>
+    <td class="c3"><div class="bkct" style="width:95px">&nbsp;</div></td>
+<tr><td class="c1">SQLite3</td>
+    <td class="c2">383,000 ops/sec</td>
+    <td class="c3"><div class="bsql" style="width:33px">&nbsp;</div></td>
+</table>
+<h3>B. Random Reads</h3>
+<table class="bn bnbase">
+<tr><td class="c1">LevelDB</td>
+    <td class="c2">129,000 ops/sec</td>
+    <td class="c3"><div class="bldb" style="width:298px">&nbsp;</div></td>
+<tr><td class="c1">Kyoto TreeDB</td>
+    <td class="c2">151,000 ops/sec</td>
+    <td class="c3"><div class="bkct" style="width:350px">&nbsp;</div></td>
+<tr><td class="c1">SQLite3</td>
+    <td class="c2">134,000 ops/sec</td>
+    <td class="c3"><div class="bsql" style="width:310px">&nbsp;</div></td>
+</table>
+<h3>C. Sequential Writes</h3>
+<table class="bn bnbase">
+<tr><td class="c1">LevelDB</td>
+    <td class="c2">779,000 ops/sec</td>
+    <td class="c3"><div class="bldb" style="width:350px">&nbsp;</div></td>
+<tr><td class="c1">Kyoto TreeDB</td>
+    <td class="c2">342,000 ops/sec</td>
+    <td class="c3"><div class="bkct" style="width:154px">&nbsp;</div></td>
+<tr><td class="c1">SQLite3</td>
+    <td class="c2">48,600 ops/sec</td>
+    <td class="c3"><div class="bsql" style="width:22px">&nbsp;</div></td>
+</table>
+<h3>D. Random Writes</h3>
+<table class="bn bnbase">
+<tr><td class="c1">LevelDB</td>
+    <td class="c2">164,000 ops/sec</td>
+    <td class="c3"><div class="bldb" style="width:350px">&nbsp;</div></td>
+<tr><td class="c1">Kyoto TreeDB</td>
+    <td class="c2">88,500 ops/sec</td>
+    <td class="c3"><div class="bkct" style="width:188px">&nbsp;</div></td>
+<tr><td class="c1">SQLite3</td>
+    <td class="c2">9,860 ops/sec</td>
+    <td class="c3"><div class="bsql" style="width:21px">&nbsp;</div></td>
+</table>
+
+<p>LevelDB outperforms both SQLite3 and TreeDB in sequential and random write operations and sequential read operations. Kyoto Cabinet has the fastest random read operations.</p>
+
+<h2>2. Write Performance under Different Configurations</h2>
+<h3>A. Large Values </h3>
+<p>For this benchmark, we start with an empty database, and write 100,000 byte values (~50% compressible). To keep the benchmark running time reasonable, we stop after writing 1000 values.</p>
+<h4>Sequential Writes</h4>
+<table class="bn bnbase">
+<tr><td class="c1">LevelDB</td>
+    <td class="c2">1,100 ops/sec</td>
+    <td class="c3"><div class="bldb" style="width:234px">&nbsp;</div></td></tr>
+<tr><td class="c1">Kyoto TreeDB</td>
+    <td class="c2">1,000 ops/sec</td>
+    <td class="c3"><div class="bkct" style="width:224px">&nbsp;</div></td></tr>
+<tr><td class="c1">SQLite3</td>
+    <td class="c2">1,600 ops/sec</td>
+    <td class="c3"><div class="bsql" style="width:350px">&nbsp;</div></td></tr>
+</table>
+<h4>Random Writes</h4>
+<table class="bn bnbase">
+<tr><td class="c1">LevelDB</td>
+    <td class="c2">480 ops/sec</td>
+    <td class="c3"><div class="bldb" style="width:105px">&nbsp;</div></td></tr>
+<tr><td class="c1">Kyoto TreeDB</td>
+    <td class="c2">1,100 ops/sec</td>
+    <td class="c3"><div class="bkct" style="width:240px">&nbsp;</div></td></tr>
+<tr><td class="c1">SQLite3</td>
+    <td class="c2">1,600 ops/sec</td>
+    <td class="c3"><div class="bsql" style="width:350px">&nbsp;</div></td></tr>
+</table>
+<p>LevelDB doesn't perform as well with large values of 100,000 bytes each. This is because LevelDB writes keys and values at least twice: first time to the transaction log, and second time (during a compaction) to a sorted file.
+With larger values, LevelDB's per-operation efficiency is swamped by the
+cost of extra copies of large values.</p>
+<h3>B. Batch Writes</h3>
+<p>A batch write is a set of writes that are applied atomically to the underlying database. A single batch of N writes may be significantly faster than N individual writes. The following benchmark writes one thousand batches where each batch contains one thousand 100-byte values. TreeDB does not support batch writes and is omitted from this benchmark.</p>
+<h4>Sequential Writes</h4>
+<table class="bn">
+<tr><td class="c1">LevelDB</td>
+    <td class="c2">840,000 entries/sec</td>
+    <td class="c3"><div class="bldb" style="width:350px">&nbsp;</div></td>
+    <td class="c4">(1.08x baseline)</td></tr>
+<tr><td class="c1">SQLite3</td>
+    <td class="c2">124,000 entries/sec</td>
+    <td class="c3"><div class="bsql" style="width:52px">&nbsp;</div></td>
+    <td class="c4">(2.55x baseline)</td></tr>
+</table>
+<h4>Random Writes</h4>
+<table class="bn">
+<tr><td class="c1">LevelDB</td>
+    <td class="c2">221,000 entries/sec</td>
+    <td class="c3"><div class="bldb" style="width:350px">&nbsp;</div></td>
+    <td class="c4">(1.35x baseline)</td></tr>
+<tr><td class="c1">SQLite3</td>
+    <td class="c2">22,000 entries/sec</td>
+    <td class="c3"><div class="bsql" style="width:34px">&nbsp;</div></td>
+    <td class="c4">(2.23x baseline)</td></tr>
+</table>
+
+<p>Because of the way LevelDB persistent storage is organized, batches of
+random writes are not much slower (only a factor of 4x) than batches
+of sequential writes.</p>
+
+<h3>C. Synchronous Writes</h3>
+<p>In the following benchmark, we enable the synchronous writing modes
+of all of the databases.  Since this change significantly slows down the
+benchmark, we stop after 10,000 writes. For synchronous write tests, we've
+disabled hard drive write-caching (using `hdparm -W 0 [device]`).</p>
+<ul>
+    <li>For LevelDB, we set WriteOptions.sync = true.</li>
+    <li>In TreeDB, we enabled TreeDB's OAUTOSYNC option.</li>
+    <li>For SQLite3, we set "PRAGMA synchronous = FULL".</li>
+</ul>
+<h4>Sequential Writes</h4>
+<table class="bn">
+<tr><td class="c1">LevelDB</td>
+    <td class="c2">100 ops/sec</td>
+    <td class="c3"><div class="bldb" style="width:350px">&nbsp;</div></td>
+    <td class="c4">(0.003x baseline)</td></tr>
+<tr><td class="c1">Kyoto TreeDB</td>
+    <td class="c2">7 ops/sec</td>
+    <td class="c3"><div class="bkct" style="width:27px">&nbsp;</div></td>
+    <td class="c4">(0.0004x baseline)</td></tr>
+<tr><td class="c1">SQLite3</td>
+    <td class="c2">88 ops/sec</td>
+    <td class="c3"><div class="bsql" style="width:315px">&nbsp;</div></td>
+    <td class="c4">(0.002x baseline)</td></tr>
+</table>
+<h4>Random Writes</h4>
+<table class="bn">
+<tr><td class="c1">LevelDB</td>
+    <td class="c2">100 ops/sec</td>
+    <td class="c3"><div class="bldb" style="width:350px">&nbsp;</div></td>
+    <td class="c4">(0.015x baseline)</td></tr>
+<tr><td class="c1">Kyoto TreeDB</td>
+    <td class="c2">8 ops/sec</td>
+    <td class="c3"><div class="bkct" style="width:29px">&nbsp;</div></td>
+    <td class="c4">(0.001x baseline)</td></tr>
+<tr><td class="c1">SQLite3</td>
+    <td class="c2">88 ops/sec</td>
+    <td class="c3"><div class="bsql" style="width:314px">&nbsp;</div></td>
+    <td class="c4">(0.009x baseline)</td></tr>
+</table>
+
+<p>Also see the <code>ext4</code> performance numbers below
+since synchronous writes behave significantly differently
+on <code>ext3</code> and <code>ext4</code>.</p>
+
+<h3>D. Turning Compression Off</h3>
+
+<p>In the baseline measurements, LevelDB and TreeDB were using
+light-weight compression
+(<a href="http://code.google.com/p/snappy/">Snappy</a> for LevelDB,
+and <a href="http://www.oberhumer.com/opensource/lzo/">LZO</a> for
+TreeDB). SQLite3, by default does not use compression.  The
+experiments below show what happens when compression is disabled in
+all of the databases (the SQLite3 numbers are just a copy of
+its baseline measurements):</p>
+
+<h4>Sequential Writes</h4>
+<table class="bn">
+<tr><td class="c1">LevelDB</td>
+    <td class="c2">594,000 ops/sec</td>
+    <td class="c3"><div class="bldb" style="width:350px">&nbsp;</div></td>
+    <td class="c4">(0.76x baseline)</td></tr>
+<tr><td class="c1">Kyoto TreeDB</td>
+    <td class="c2">485,000 ops/sec</td>
+    <td class="c3"><div class="bkct" style="width:239px">&nbsp;</div></td>
+    <td class="c4">(1.42x baseline)</td></tr>
+<tr><td class="c1">SQLite3</td>
+    <td class="c2">48,600 ops/sec</td>
+    <td class="c3"><div class="bsql" style="width:29px">&nbsp;</div></td>
+    <td class="c4">(1.00x baseline)</td></tr>
+</table>
+<h4>Random Writes</h4>
+<table class="bn">
+<tr><td class="c1">LevelDB</td>
+    <td class="c2">135,000 ops/sec</td>
+    <td class="c3"><div class="bldb" style="width:296px">&nbsp;</div></td>
+    <td class="c4">(0.82x baseline)</td></tr>
+<tr><td class="c1">Kyoto TreeDB</td>
+    <td class="c2">159,000 ops/sec</td>
+    <td class="c3"><div class="bkct" style="width:350px">&nbsp;</div></td>
+    <td class="c4">(1.80x baseline)</td></tr>
+<tr><td class="c1">SQLite3</td>
+    <td class="c2">9,860 ops/sec</td>
+    <td class="c3"><div class="bsql" style="width:22px">&nbsp;</div></td>
+    <td class="c4">(1.00x baseline)</td></tr>
+</table>
+
+<p>LevelDB's write performance is better with compression than without
+since compression decreases the amount of data that has to be written
+to disk.  Therefore LevelDB users can leave compression enabled in
+most scenarios without having worry about a tradeoff between space
+usage and performance.  TreeDB's performance on the other hand is
+better without compression than with compression.  Presumably this is
+because TreeDB's compression library (LZO) is more expensive than
+LevelDB's compression library (Snappy).<p>
+
+<h3>E. Using More Memory</h3>
+<p>We increased the overall cache size for each database to 128 MB. For LevelDB, we partitioned 128 MB into a 120 MB write buffer and 8 MB of cache (up from 2 MB of write buffer and 2 MB of cache). For SQLite3, we kept the page size at 1024 bytes, but increased the number of pages to 131,072 (up from 4096). For TreeDB, we also kept the page size at 1024 bytes, but increased the cache size to 128 MB (up from 4 MB).</p>
+<h4>Sequential Writes</h4>
+<table class="bn">
+<tr><td class="c1">LevelDB</td>
+    <td class="c2">812,000 ops/sec</td>
+    <td class="c3"><div class="bldb" style="width:350px">&nbsp;</div></td>
+    <td class="c4">(1.04x baseline)</td></tr>
+<tr><td class="c1">Kyoto TreeDB</td>
+    <td class="c2">321,000 ops/sec</td>
+    <td class="c3"><div class="bkct" style="width:138px">&nbsp;</div></td>
+    <td class="c4">(0.94x baseline)</td></tr>
+<tr><td class="c1">SQLite3</td>
+    <td class="c2">48,500 ops/sec</td>
+    <td class="c3"><div class="bsql" style="width:21px">&nbsp;</div></td>
+    <td class="c4">(1.00x baseline)</td></tr>
+</table>
+<h4>Random Writes</h4>
+<table class="bn">
+<tr><td class="c1">LevelDB</td>
+    <td class="c2">355,000 ops/sec</td>
+    <td class="c3"><div class="bldb" style="width:350px">&nbsp;</div></td>
+    <td class="c4">(2.16x baseline)</td></tr>
+<tr><td class="c1">Kyoto TreeDB</td>
+    <td class="c2">284,000 ops/sec</td>
+    <td class="c3"><div class="bkct" style="width:280px">&nbsp;</div></td>
+    <td class="c4">(3.21x baseline)</td></tr>
+<tr><td class="c1">SQLite3</td>
+    <td class="c2">9,670 ops/sec</td>
+    <td class="c3"><div class="bsql" style="width:10px">&nbsp;</div></td>
+    <td class="c4">(0.98x baseline)</td></tr>
+</table>
+
+<p>SQLite's performance does not change substantially when compared to
+the baseline, but the random write performance for both LevelDB and
+TreeDB increases significantly.  LevelDB's performance improves
+because a larger write buffer reduces the need to merge sorted files
+(since it creates a smaller number of larger sorted files).  TreeDB's
+performance goes up because the entire database is available in memory
+for fast in-place updates.</p>
+
+  <h2>3. Read Performance under Different Configurations</h2>
+<h3>A. Larger Caches</h3>
+<p>We increased the overall memory usage to 128 MB for each database.
+For LevelDB, we allocated 8 MB to LevelDB's write buffer and 120 MB
+to LevelDB's cache. The other databases don't differentiate between a
+write buffer and a cache, so we simply set their cache size to 128
+MB.</p>
+<h4>Sequential Reads</h4>
+<table class="bn">
+<tr><td class="c1">LevelDB</td>
+    <td class="c2">5,210,000 ops/sec</td>
+    <td class="c3"><div class="bldb" style="width:350px">&nbsp;</div></td>
+    <td class="c4">(1.29x baseline)</td></tr>
+<tr><td class="c1">Kyoto TreeDB</td>
+    <td class="c2">1,070,000 ops/sec</td>
+    <td class="c3"><div class="bkct" style="width:72px">&nbsp;</div></td>
+    <td class="c4">(1.06x baseline)</td></tr>
+<tr><td class="c1">SQLite3</td>
+    <td class="c2">609,000 ops/sec</td>
+    <td class="c3"><div class="bsql" style="width:41px">&nbsp;</div></td>
+    <td class="c4">(1.59x baseline)</td></tr>
+</table>
+
+<h4>Random Reads</h4>
+<table class="bn">
+<tr><td class="c1">LevelDB</td>
+    <td class="c2">190,000 ops/sec</td>
+    <td class="c3"><div class="bldb" style="width:144px">&nbsp;</div></td>
+    <td class="c4">(1.47x baseline)</td></tr>
+<tr><td class="c1">Kyoto TreeDB</td>
+    <td class="c2">463,000 ops/sec</td>
+    <td class="c3"><div class="bkct" style="width:350px">&nbsp;</div></td>
+    <td class="c4">(3.07x baseline)</td></tr>
+<tr><td class="c1">SQLite3</td>
+    <td class="c2">186,000 ops/sec</td>
+    <td class="c3"><div class="bsql" style="width:141px">&nbsp;</div></td>
+    <td class="c4">(1.39x baseline)</td></tr>
+</table>
+
+<p>As expected, the read performance of all of the databases increases
+when the caches are enlarged.  In particular, TreeDB seems to make
+very effective use of a cache that is large enough to hold the entire
+database.</p>
+
+<h3>B. No Compression Reads </h3>
+<p>For this benchmark, we populated a database with 1 million entries consisting of 16 byte keys and 100 byte values. We compiled LevelDB and Kyoto Cabinet without compression support, so results that are read out from the database are already uncompressed. We've listed the SQLite3 baseline read performance as a point of comparison.</p>
+<h4>Sequential Reads</h4>
+<table class="bn">
+<tr><td class="c1">LevelDB</td>
+    <td class="c2">4,880,000 ops/sec</td>
+    <td class="c3"><div class="bldb" style="width:350px">&nbsp;</div></td>
+    <td class="c4">(1.21x baseline)</td></tr>
+<tr><td class="c1">Kyoto TreeDB</td>
+    <td class="c2">1,230,000 ops/sec</td>
+    <td class="c3"><div class="bkct" style="width:88px">&nbsp;</div></td>
+    <td class="c4">(3.60x baseline)</td></tr>
+<tr><td class="c1">SQLite3</td>
+    <td class="c2">383,000 ops/sec</td>
+    <td class="c3"><div class="bsql" style="width:27px">&nbsp;</div></td>
+    <td class="c4">(1.00x baseline)</td></tr>
+</table>
+<h4>Random Reads</h4>
+<table class="bn">
+<tr><td class="c1">LevelDB</td>
+    <td class="c2">149,000 ops/sec</td>
+    <td class="c3"><div class="bldb" style="width:300px">&nbsp;</div></td>
+    <td class="c4">(1.16x baseline)</td></tr>
+<tr><td class="c1">Kyoto TreeDB</td>
+    <td class="c2">175,000 ops/sec</td>
+    <td class="c3"><div class="bkct" style="width:350px">&nbsp;</div></td>
+    <td class="c4">(1.16x baseline)</td></tr>
+<tr><td class="c1">SQLite3</td>
+    <td class="c2">134,000 ops/sec</td>
+    <td class="c3"><div class="bsql" style="width:268px">&nbsp;</div></td>
+    <td class="c4">(1.00x baseline)</td></tr>
+</table>
+
+<p>Performance of both LevelDB and TreeDB improves a small amount when
+compression is disabled.  Note however that under different workloads,
+performance may very well be better with compression if it allows more
+of the working set to fit in memory.</p>
+
+<h2>Note about Ext4 Filesystems</h2>
+<p>The preceding numbers are for an ext3 file system. Synchronous writes are much slower under <a href="http://en.wikipedia.org/wiki/Ext4">ext4</a> (LevelDB drops to ~31 writes / second and TreeDB drops to ~5 writes / second; SQLite3's synchronous writes do not noticeably drop) due to ext4's different handling of <span class="code">fsync</span> / <span class="code">msync</span> calls. Even LevelDB's asynchronous write performance drops somewhat since it spreads its storage across multiple files and issues <span class="code">fsync</span> calls when switching to a new file.</p>
+
+<h2>Acknowledgements</h2>
+<p>Jeff Dean and Sanjay Ghemawat wrote LevelDB. Kevin Tseng wrote and compiled these benchmarks. Mikio Hirabayashi, Scott Hess, and Gabor Cselle provided help and advice.</p>
+</body>
+</html>
diff --git a/depend/zcash/src/leveldb/doc/impl.md b/depend/zcash/src/leveldb/doc/impl.md
new file mode 100644
index 000000000..4b13f2a6b
--- /dev/null
+++ b/depend/zcash/src/leveldb/doc/impl.md
@@ -0,0 +1,170 @@
+## Files
+
+The implementation of leveldb is similar in spirit to the representation of a
+single [Bigtable tablet (section 5.3)](http://research.google.com/archive/bigtable.html).
+However the organization of the files that make up the representation is
+somewhat different and is explained below.
+
+Each database is represented by a set of files stored in a directory. There are
+several different types of files as documented below:
+
+### Log files
+
+A log file (*.log) stores a sequence of recent updates. Each update is appended
+to the current log file. When the log file reaches a pre-determined size
+(approximately 4MB by default), it is converted to a sorted table (see below)
+and a new log file is created for future updates.
+
+A copy of the current log file is kept in an in-memory structure (the
+`memtable`). This copy is consulted on every read so that read operations
+reflect all logged updates.
+
+## Sorted tables
+
+A sorted table (*.ldb) stores a sequence of entries sorted by key. Each entry is
+either a value for the key, or a deletion marker for the key. (Deletion markers
+are kept around to hide obsolete values present in older sorted tables).
+
+The set of sorted tables are organized into a sequence of levels. The sorted
+table generated from a log file is placed in a special **young** level (also
+called level-0). When the number of young files exceeds a certain threshold
+(currently four), all of the young files are merged together with all of the
+overlapping level-1 files to produce a sequence of new level-1 files (we create
+a new level-1 file for every 2MB of data.)
+
+Files in the young level may contain overlapping keys. However files in other
+levels have distinct non-overlapping key ranges. Consider level number L where
+L >= 1. When the combined size of files in level-L exceeds (10^L) MB (i.e., 10MB
+for level-1, 100MB for level-2, ...), one file in level-L, and all of the
+overlapping files in level-(L+1) are merged to form a set of new files for
+level-(L+1). These merges have the effect of gradually migrating new updates
+from the young level to the largest level using only bulk reads and writes
+(i.e., minimizing expensive seeks).
+
+### Manifest
+
+A MANIFEST file lists the set of sorted tables that make up each level, the
+corresponding key ranges, and other important metadata. A new MANIFEST file
+(with a new number embedded in the file name) is created whenever the database
+is reopened. The MANIFEST file is formatted as a log, and changes made to the
+serving state (as files are added or removed) are appended to this log.
+
+### Current
+
+CURRENT is a simple text file that contains the name of the latest MANIFEST
+file.
+
+### Info logs
+
+Informational messages are printed to files named LOG and LOG.old.
+
+### Others
+
+Other files used for miscellaneous purposes may also be present (LOCK, *.dbtmp).
+
+## Level 0
+
+When the log file grows above a certain size (1MB by default):
+Create a brand new memtable and log file and direct future updates here
+In the background:
+Write the contents of the previous memtable to an sstable
+Discard the memtable
+Delete the old log file and the old memtable
+Add the new sstable to the young (level-0) level.
+
+## Compactions
+
+When the size of level L exceeds its limit, we compact it in a background
+thread. The compaction picks a file from level L and all overlapping files from
+the next level L+1. Note that if a level-L file overlaps only part of a
+level-(L+1) file, the entire file at level-(L+1) is used as an input to the
+compaction and will be discarded after the compaction.  Aside: because level-0
+is special (files in it may overlap each other), we treat compactions from
+level-0 to level-1 specially: a level-0 compaction may pick more than one
+level-0 file in case some of these files overlap each other.
+
+A compaction merges the contents of the picked files to produce a sequence of
+level-(L+1) files. We switch to producing a new level-(L+1) file after the
+current output file has reached the target file size (2MB). We also switch to a
+new output file when the key range of the current output file has grown enough
+to overlap more than ten level-(L+2) files.  This last rule ensures that a later
+compaction of a level-(L+1) file will not pick up too much data from
+level-(L+2).
+
+The old files are discarded and the new files are added to the serving state.
+
+Compactions for a particular level rotate through the key space. In more detail,
+for each level L, we remember the ending key of the last compaction at level L.
+The next compaction for level L will pick the first file that starts after this
+key (wrapping around to the beginning of the key space if there is no such
+file).
+
+Compactions drop overwritten values. They also drop deletion markers if there
+are no higher numbered levels that contain a file whose range overlaps the
+current key.
+
+### Timing
+
+Level-0 compactions will read up to four 1MB files from level-0, and at worst
+all the level-1 files (10MB). I.e., we will read 14MB and write 14MB.
+
+Other than the special level-0 compactions, we will pick one 2MB file from level
+L. In the worst case, this will overlap ~ 12 files from level L+1 (10 because
+level-(L+1) is ten times the size of level-L, and another two at the boundaries
+since the file ranges at level-L will usually not be aligned with the file
+ranges at level-L+1). The compaction will therefore read 26MB and write 26MB.
+Assuming a disk IO rate of 100MB/s (ballpark range for modern drives), the worst
+compaction cost will be approximately 0.5 second.
+
+If we throttle the background writing to something small, say 10% of the full
+100MB/s speed, a compaction may take up to 5 seconds. If the user is writing at
+10MB/s, we might build up lots of level-0 files (~50 to hold the 5*10MB). This
+may significantly increase the cost of reads due to the overhead of merging more
+files together on every read.
+
+Solution 1: To reduce this problem, we might want to increase the log switching
+threshold when the number of level-0 files is large. Though the downside is that
+the larger this threshold, the more memory we will need to hold the
+corresponding memtable.
+
+Solution 2: We might want to decrease write rate artificially when the number of
+level-0 files goes up.
+
+Solution 3: We work on reducing the cost of very wide merges. Perhaps most of
+the level-0 files will have their blocks sitting uncompressed in the cache and
+we will only need to worry about the O(N) complexity in the merging iterator.
+
+### Number of files
+
+Instead of always making 2MB files, we could make larger files for larger levels
+to reduce the total file count, though at the expense of more bursty
+compactions.  Alternatively, we could shard the set of files into multiple
+directories.
+
+An experiment on an ext3 filesystem on Feb 04, 2011 shows the following timings
+to do 100K file opens in directories with varying number of files:
+
+
+| Files in directory | Microseconds to open a file |
+|-------------------:|----------------------------:|
+|               1000 |                           9 |
+|              10000 |                          10 |
+|             100000 |                          16 |
+
+So maybe even the sharding is not necessary on modern filesystems?
+
+## Recovery
+
+* Read CURRENT to find name of the latest committed MANIFEST
+* Read the named MANIFEST file
+* Clean up stale files
+* We could open all sstables here, but it is probably better to be lazy...
+* Convert log chunk to a new level-0 sstable
+* Start directing new writes to a new log file with recovered sequence#
+
+## Garbage collection of files
+
+`DeleteObsoleteFiles()` is called at the end of every compaction and at the end
+of recovery. It finds the names of all files in the database. It deletes all log
+files that are not the current log file. It deletes all table files that are not
+referenced from some level and are not the output of an active compaction.
diff --git a/depend/zcash/src/leveldb/doc/index.md b/depend/zcash/src/leveldb/doc/index.md
new file mode 100644
index 000000000..be8569692
--- /dev/null
+++ b/depend/zcash/src/leveldb/doc/index.md
@@ -0,0 +1,523 @@
+leveldb
+=======
+
+_Jeff Dean, Sanjay Ghemawat_
+
+The leveldb library provides a persistent key value store. Keys and values are
+arbitrary byte arrays.  The keys are ordered within the key value store
+according to a user-specified comparator function.
+
+## Opening A Database
+
+A leveldb database has a name which corresponds to a file system directory. All
+of the contents of database are stored in this directory. The following example
+shows how to open a database, creating it if necessary:
+
+```c++
+#include <cassert>
+#include "leveldb/db.h"
+
+leveldb::DB* db;
+leveldb::Options options;
+options.create_if_missing = true;
+leveldb::Status status = leveldb::DB::Open(options, "/tmp/testdb", &db);
+assert(status.ok());
+...
+```
+
+If you want to raise an error if the database already exists, add the following
+line before the `leveldb::DB::Open` call:
+
+```c++
+options.error_if_exists = true;
+```
+
+## Status
+
+You may have noticed the `leveldb::Status` type above. Values of this type are
+returned by most functions in leveldb that may encounter an error. You can check
+if such a result is ok, and also print an associated error message:
+
+```c++
+leveldb::Status s = ...;
+if (!s.ok()) cerr << s.ToString() << endl;
+```
+
+## Closing A Database
+
+When you are done with a database, just delete the database object. Example:
+
+```c++
+... open the db as described above ...
+... do something with db ...
+delete db;
+```
+
+## Reads And Writes
+
+The database provides Put, Delete, and Get methods to modify/query the database.
+For example, the following code moves the value stored under key1 to key2.
+
+```c++
+std::string value;
+leveldb::Status s = db->Get(leveldb::ReadOptions(), key1, &value);
+if (s.ok()) s = db->Put(leveldb::WriteOptions(), key2, value);
+if (s.ok()) s = db->Delete(leveldb::WriteOptions(), key1);
+```
+
+## Atomic Updates
+
+Note that if the process dies after the Put of key2 but before the delete of
+key1, the same value may be left stored under multiple keys. Such problems can
+be avoided by using the `WriteBatch` class to atomically apply a set of updates:
+
+```c++
+#include "leveldb/write_batch.h"
+...
+std::string value;
+leveldb::Status s = db->Get(leveldb::ReadOptions(), key1, &value);
+if (s.ok()) {
+  leveldb::WriteBatch batch;
+  batch.Delete(key1);
+  batch.Put(key2, value);
+  s = db->Write(leveldb::WriteOptions(), &batch);
+}
+```
+
+The `WriteBatch` holds a sequence of edits to be made to the database, and these
+edits within the batch are applied in order. Note that we called Delete before
+Put so that if key1 is identical to key2, we do not end up erroneously dropping
+the value entirely.
+
+Apart from its atomicity benefits, `WriteBatch` may also be used to speed up
+bulk updates by placing lots of individual mutations into the same batch.
+
+## Synchronous Writes
+
+By default, each write to leveldb is asynchronous: it returns after pushing the
+write from the process into the operating system. The transfer from operating
+system memory to the underlying persistent storage happens asynchronously. The
+sync flag can be turned on for a particular write to make the write operation
+not return until the data being written has been pushed all the way to
+persistent storage. (On Posix systems, this is implemented by calling either
+`fsync(...)` or `fdatasync(...)` or `msync(..., MS_SYNC)` before the write
+operation returns.)
+
+```c++
+leveldb::WriteOptions write_options;
+write_options.sync = true;
+db->Put(write_options, ...);
+```
+
+Asynchronous writes are often more than a thousand times as fast as synchronous
+writes. The downside of asynchronous writes is that a crash of the machine may
+cause the last few updates to be lost. Note that a crash of just the writing
+process (i.e., not a reboot) will not cause any loss since even when sync is
+false, an update is pushed from the process memory into the operating system
+before it is considered done.
+
+Asynchronous writes can often be used safely. For example, when loading a large
+amount of data into the database you can handle lost updates by restarting the
+bulk load after a crash. A hybrid scheme is also possible where every Nth write
+is synchronous, and in the event of a crash, the bulk load is restarted just
+after the last synchronous write finished by the previous run. (The synchronous
+write can update a marker that describes where to restart on a crash.)
+
+`WriteBatch` provides an alternative to asynchronous writes. Multiple updates
+may be placed in the same WriteBatch and applied together using a synchronous
+write (i.e., `write_options.sync` is set to true). The extra cost of the
+synchronous write will be amortized across all of the writes in the batch.
+
+## Concurrency
+
+A database may only be opened by one process at a time. The leveldb
+implementation acquires a lock from the operating system to prevent misuse.
+Within a single process, the same `leveldb::DB` object may be safely shared by
+multiple concurrent threads. I.e., different threads may write into or fetch
+iterators or call Get on the same database without any external synchronization
+(the leveldb implementation will automatically do the required synchronization).
+However other objects (like Iterator and `WriteBatch`) may require external
+synchronization. If two threads share such an object, they must protect access
+to it using their own locking protocol. More details are available in the public
+header files.
+
+## Iteration
+
+The following example demonstrates how to print all key,value pairs in a
+database.
+
+```c++
+leveldb::Iterator* it = db->NewIterator(leveldb::ReadOptions());
+for (it->SeekToFirst(); it->Valid(); it->Next()) {
+  cout << it->key().ToString() << ": "  << it->value().ToString() << endl;
+}
+assert(it->status().ok());  // Check for any errors found during the scan
+delete it;
+```
+
+The following variation shows how to process just the keys in the range
+[start,limit):
+
+```c++
+for (it->Seek(start);
+   it->Valid() && it->key().ToString() < limit;
+   it->Next()) {
+  ...
+}
+```
+
+You can also process entries in reverse order. (Caveat: reverse iteration may be
+somewhat slower than forward iteration.)
+
+```c++
+for (it->SeekToLast(); it->Valid(); it->Prev()) {
+  ...
+}
+```
+
+## Snapshots
+
+Snapshots provide consistent read-only views over the entire state of the
+key-value store.  `ReadOptions::snapshot` may be non-NULL to indicate that a
+read should operate on a particular version of the DB state. If
+`ReadOptions::snapshot` is NULL, the read will operate on an implicit snapshot
+of the current state.
+
+Snapshots are created by the `DB::GetSnapshot()` method:
+
+```c++
+leveldb::ReadOptions options;
+options.snapshot = db->GetSnapshot();
+... apply some updates to db ...
+leveldb::Iterator* iter = db->NewIterator(options);
+... read using iter to view the state when the snapshot was created ...
+delete iter;
+db->ReleaseSnapshot(options.snapshot);
+```
+
+Note that when a snapshot is no longer needed, it should be released using the
+`DB::ReleaseSnapshot` interface. This allows the implementation to get rid of
+state that was being maintained just to support reading as of that snapshot.
+
+## Slice
+
+The return value of the `it->key()` and `it->value()` calls above are instances
+of the `leveldb::Slice` type. Slice is a simple structure that contains a length
+and a pointer to an external byte array. Returning a Slice is a cheaper
+alternative to returning a `std::string` since we do not need to copy
+potentially large keys and values. In addition, leveldb methods do not return
+null-terminated C-style strings since leveldb keys and values are allowed to
+contain `'\0'` bytes.
+
+C++ strings and null-terminated C-style strings can be easily converted to a
+Slice:
+
+```c++
+leveldb::Slice s1 = "hello";
+
+std::string str("world");
+leveldb::Slice s2 = str;
+```
+
+A Slice can be easily converted back to a C++ string:
+
+```c++
+std::string str = s1.ToString();
+assert(str == std::string("hello"));
+```
+
+Be careful when using Slices since it is up to the caller to ensure that the
+external byte array into which the Slice points remains live while the Slice is
+in use. For example, the following is buggy:
+
+```c++
+leveldb::Slice slice;
+if (...) {
+  std::string str = ...;
+  slice = str;
+}
+Use(slice);
+```
+
+When the if statement goes out of scope, str will be destroyed and the backing
+storage for slice will disappear.
+
+## Comparators
+
+The preceding examples used the default ordering function for key, which orders
+bytes lexicographically. You can however supply a custom comparator when opening
+a database.  For example, suppose each database key consists of two numbers and
+we should sort by the first number, breaking ties by the second number. First,
+define a proper subclass of `leveldb::Comparator` that expresses these rules:
+
+```c++
+class TwoPartComparator : public leveldb::Comparator {
+ public:
+  // Three-way comparison function:
+  //   if a < b: negative result
+  //   if a > b: positive result
+  //   else: zero result
+  int Compare(const leveldb::Slice& a, const leveldb::Slice& b) const {
+    int a1, a2, b1, b2;
+    ParseKey(a, &a1, &a2);
+    ParseKey(b, &b1, &b2);
+    if (a1 < b1) return -1;
+    if (a1 > b1) return +1;
+    if (a2 < b2) return -1;
+    if (a2 > b2) return +1;
+    return 0;
+  }
+
+  // Ignore the following methods for now:
+  const char* Name() const { return "TwoPartComparator"; }
+  void FindShortestSeparator(std::string*, const leveldb::Slice&) const {}
+  void FindShortSuccessor(std::string*) const {}
+};
+```
+
+Now create a database using this custom comparator:
+
+```c++
+TwoPartComparator cmp;
+leveldb::DB* db;
+leveldb::Options options;
+options.create_if_missing = true;
+options.comparator = &cmp;
+leveldb::Status status = leveldb::DB::Open(options, "/tmp/testdb", &db);
+...
+```
+
+### Backwards compatibility
+
+The result of the comparator's Name method is attached to the database when it
+is created, and is checked on every subsequent database open. If the name
+changes, the `leveldb::DB::Open` call will fail. Therefore, change the name if
+and only if the new key format and comparison function are incompatible with
+existing databases, and it is ok to discard the contents of all existing
+databases.
+
+You can however still gradually evolve your key format over time with a little
+bit of pre-planning. For example, you could store a version number at the end of
+each key (one byte should suffice for most uses). When you wish to switch to a
+new key format (e.g., adding an optional third part to the keys processed by
+`TwoPartComparator`), (a) keep the same comparator name (b) increment the
+version number for new keys (c) change the comparator function so it uses the
+version numbers found in the keys to decide how to interpret them.
+
+## Performance
+
+Performance can be tuned by changing the default values of the types defined in
+`include/leveldb/options.h`.
+
+### Block size
+
+leveldb groups adjacent keys together into the same block and such a block is
+the unit of transfer to and from persistent storage. The default block size is
+approximately 4096 uncompressed bytes.  Applications that mostly do bulk scans
+over the contents of the database may wish to increase this size. Applications
+that do a lot of point reads of small values may wish to switch to a smaller
+block size if performance measurements indicate an improvement. There isn't much
+benefit in using blocks smaller than one kilobyte, or larger than a few
+megabytes. Also note that compression will be more effective with larger block
+sizes.
+
+### Compression
+
+Each block is individually compressed before being written to persistent
+storage. Compression is on by default since the default compression method is
+very fast, and is automatically disabled for uncompressible data. In rare cases,
+applications may want to disable compression entirely, but should only do so if
+benchmarks show a performance improvement:
+
+```c++
+leveldb::Options options;
+options.compression = leveldb::kNoCompression;
+... leveldb::DB::Open(options, name, ...) ....
+```
+
+### Cache
+
+The contents of the database are stored in a set of files in the filesystem and
+each file stores a sequence of compressed blocks. If options.cache is non-NULL,
+it is used to cache frequently used uncompressed block contents.
+
+```c++
+#include "leveldb/cache.h"
+
+leveldb::Options options;
+options.cache = leveldb::NewLRUCache(100 * 1048576);  // 100MB cache
+leveldb::DB* db;
+leveldb::DB::Open(options, name, &db);
+... use the db ...
+delete db
+delete options.cache;
+```
+
+Note that the cache holds uncompressed data, and therefore it should be sized
+according to application level data sizes, without any reduction from
+compression. (Caching of compressed blocks is left to the operating system
+buffer cache, or any custom Env implementation provided by the client.)
+
+When performing a bulk read, the application may wish to disable caching so that
+the data processed by the bulk read does not end up displacing most of the
+cached contents. A per-iterator option can be used to achieve this:
+
+```c++
+leveldb::ReadOptions options;
+options.fill_cache = false;
+leveldb::Iterator* it = db->NewIterator(options);
+for (it->SeekToFirst(); it->Valid(); it->Next()) {
+  ...
+}
+```
+
+### Key Layout
+
+Note that the unit of disk transfer and caching is a block. Adjacent keys
+(according to the database sort order) will usually be placed in the same block.
+Therefore the application can improve its performance by placing keys that are
+accessed together near each other and placing infrequently used keys in a
+separate region of the key space.
+
+For example, suppose we are implementing a simple file system on top of leveldb.
+The types of entries we might wish to store are:
+
+    filename -> permission-bits, length, list of file_block_ids
+    file_block_id -> data
+
+We might want to prefix filename keys with one letter (say '/') and the
+`file_block_id` keys with a different letter (say '0') so that scans over just
+the metadata do not force us to fetch and cache bulky file contents.
+
+### Filters
+
+Because of the way leveldb data is organized on disk, a single `Get()` call may
+involve multiple reads from disk. The optional FilterPolicy mechanism can be
+used to reduce the number of disk reads substantially.
+
+```c++
+leveldb::Options options;
+options.filter_policy = NewBloomFilterPolicy(10);
+leveldb::DB* db;
+leveldb::DB::Open(options, "/tmp/testdb", &db);
+... use the database ...
+delete db;
+delete options.filter_policy;
+```
+
+The preceding code associates a Bloom filter based filtering policy with the
+database.  Bloom filter based filtering relies on keeping some number of bits of
+data in memory per key (in this case 10 bits per key since that is the argument
+we passed to `NewBloomFilterPolicy`). This filter will reduce the number of
+unnecessary disk reads needed for Get() calls by a factor of approximately
+a 100. Increasing the bits per key will lead to a larger reduction at the cost
+of more memory usage. We recommend that applications whose working set does not
+fit in memory and that do a lot of random reads set a filter policy.
+
+If you are using a custom comparator, you should ensure that the filter policy
+you are using is compatible with your comparator. For example, consider a
+comparator that ignores trailing spaces when comparing keys.
+`NewBloomFilterPolicy` must not be used with such a comparator. Instead, the
+application should provide a custom filter policy that also ignores trailing
+spaces. For example:
+
+```c++
+class CustomFilterPolicy : public leveldb::FilterPolicy {
+ private:
+  FilterPolicy* builtin_policy_;
+
+ public:
+  CustomFilterPolicy() : builtin_policy_(NewBloomFilterPolicy(10)) {}
+  ~CustomFilterPolicy() { delete builtin_policy_; }
+
+  const char* Name() const { return "IgnoreTrailingSpacesFilter"; }
+
+  void CreateFilter(const Slice* keys, int n, std::string* dst) const {
+    // Use builtin bloom filter code after removing trailing spaces
+    std::vector<Slice> trimmed(n);
+    for (int i = 0; i < n; i++) {
+      trimmed[i] = RemoveTrailingSpaces(keys[i]);
+    }
+    return builtin_policy_->CreateFilter(&trimmed[i], n, dst);
+  }
+};
+```
+
+Advanced applications may provide a filter policy that does not use a bloom
+filter but uses some other mechanism for summarizing a set of keys. See
+`leveldb/filter_policy.h` for detail.
+
+## Checksums
+
+leveldb associates checksums with all data it stores in the file system. There
+are two separate controls provided over how aggressively these checksums are
+verified:
+
+`ReadOptions::verify_checksums` may be set to true to force checksum
+verification of all data that is read from the file system on behalf of a
+particular read.  By default, no such verification is done.
+
+`Options::paranoid_checks` may be set to true before opening a database to make
+the database implementation raise an error as soon as it detects an internal
+corruption. Depending on which portion of the database has been corrupted, the
+error may be raised when the database is opened, or later by another database
+operation. By default, paranoid checking is off so that the database can be used
+even if parts of its persistent storage have been corrupted.
+
+If a database is corrupted (perhaps it cannot be opened when paranoid checking
+is turned on), the `leveldb::RepairDB` function may be used to recover as much
+of the data as possible
+
+## Approximate Sizes
+
+The `GetApproximateSizes` method can used to get the approximate number of bytes
+of file system space used by one or more key ranges.
+
+```c++
+leveldb::Range ranges[2];
+ranges[0] = leveldb::Range("a", "c");
+ranges[1] = leveldb::Range("x", "z");
+uint64_t sizes[2];
+leveldb::Status s = db->GetApproximateSizes(ranges, 2, sizes);
+```
+
+The preceding call will set `sizes[0]` to the approximate number of bytes of
+file system space used by the key range `[a..c)` and `sizes[1]` to the
+approximate number of bytes used by the key range `[x..z)`.
+
+## Environment
+
+All file operations (and other operating system calls) issued by the leveldb
+implementation are routed through a `leveldb::Env` object. Sophisticated clients
+may wish to provide their own Env implementation to get better control.
+For example, an application may introduce artificial delays in the file IO
+paths to limit the impact of leveldb on other activities in the system.
+
+```c++
+class SlowEnv : public leveldb::Env {
+  ... implementation of the Env interface ...
+};
+
+SlowEnv env;
+leveldb::Options options;
+options.env = &env;
+Status s = leveldb::DB::Open(options, ...);
+```
+
+## Porting
+
+leveldb may be ported to a new platform by providing platform specific
+implementations of the types/methods/functions exported by
+`leveldb/port/port.h`.  See `leveldb/port/port_example.h` for more details.
+
+In addition, the new platform may need a new default `leveldb::Env`
+implementation.  See `leveldb/util/env_posix.h` for an example.
+
+## Other Information
+
+Details about the leveldb implementation may be found in the following
+documents:
+
+1. [Implementation notes](impl.md)
+2. [Format of an immutable Table file](table_format.md)
+3. [Format of a log file](log_format.md)
diff --git a/depend/zcash/src/leveldb/doc/log_format.md b/depend/zcash/src/leveldb/doc/log_format.md
new file mode 100644
index 000000000..f32cb5d7d
--- /dev/null
+++ b/depend/zcash/src/leveldb/doc/log_format.md
@@ -0,0 +1,75 @@
+leveldb Log format
+==================
+The log file contents are a sequence of 32KB blocks.  The only exception is that
+the tail of the file may contain a partial block.
+
+Each block consists of a sequence of records:
+
+    block := record* trailer?
+    record :=
+      checksum: uint32     // crc32c of type and data[] ; little-endian
+      length: uint16       // little-endian
+      type: uint8          // One of FULL, FIRST, MIDDLE, LAST
+      data: uint8[length]
+
+A record never starts within the last six bytes of a block (since it won't fit).
+Any leftover bytes here form the trailer, which must consist entirely of zero
+bytes and must be skipped by readers.
+
+Aside: if exactly seven bytes are left in the current block, and a new non-zero
+length record is added, the writer must emit a FIRST record (which contains zero
+bytes of user data) to fill up the trailing seven bytes of the block and then
+emit all of the user data in subsequent blocks.
+
+More types may be added in the future.  Some Readers may skip record types they
+do not understand, others may report that some data was skipped.
+
+    FULL == 1
+    FIRST == 2
+    MIDDLE == 3
+    LAST == 4
+
+The FULL record contains the contents of an entire user record.
+
+FIRST, MIDDLE, LAST are types used for user records that have been split into
+multiple fragments (typically because of block boundaries).  FIRST is the type
+of the first fragment of a user record, LAST is the type of the last fragment of
+a user record, and MIDDLE is the type of all interior fragments of a user
+record.
+
+Example: consider a sequence of user records:
+
+    A: length 1000
+    B: length 97270
+    C: length 8000
+
+**A** will be stored as a FULL record in the first block.
+
+**B** will be split into three fragments: first fragment occupies the rest of
+the first block, second fragment occupies the entirety of the second block, and
+the third fragment occupies a prefix of the third block.  This will leave six
+bytes free in the third block, which will be left empty as the trailer.
+
+**C** will be stored as a FULL record in the fourth block.
+
+----
+
+## Some benefits over the recordio format:
+
+1. We do not need any heuristics for resyncing - just go to next block boundary
+   and scan.  If there is a corruption, skip to the next block.  As a
+   side-benefit, we do not get confused when part of the contents of one log
+   file are embedded as a record inside another log file.
+
+2. Splitting at approximate boundaries (e.g., for mapreduce) is simple: find the
+   next block boundary and skip records until we hit a FULL or FIRST record.
+
+3. We do not need extra buffering for large records.
+
+## Some downsides compared to recordio format:
+
+1. No packing of tiny records.  This could be fixed by adding a new record type,
+   so it is a shortcoming of the current implementation, not necessarily the
+   format.
+
+2. No compression.  Again, this could be fixed by adding new record types.
diff --git a/depend/zcash/src/leveldb/doc/table_format.md b/depend/zcash/src/leveldb/doc/table_format.md
new file mode 100644
index 000000000..5fe7e7241
--- /dev/null
+++ b/depend/zcash/src/leveldb/doc/table_format.md
@@ -0,0 +1,107 @@
+leveldb File format
+===================
+
+    <beginning_of_file>
+    [data block 1]
+    [data block 2]
+    ...
+    [data block N]
+    [meta block 1]
+    ...
+    [meta block K]
+    [metaindex block]
+    [index block]
+    [Footer]        (fixed size; starts at file_size - sizeof(Footer))
+    <end_of_file>
+
+The file contains internal pointers.  Each such pointer is called
+a BlockHandle and contains the following information:
+
+    offset:   varint64
+    size:     varint64
+
+See [varints](https://developers.google.com/protocol-buffers/docs/encoding#varints)
+for an explanation of varint64 format.
+
+1.  The sequence of key/value pairs in the file are stored in sorted
+order and partitioned into a sequence of data blocks.  These blocks
+come one after another at the beginning of the file.  Each data block
+is formatted according to the code in `block_builder.cc`, and then
+optionally compressed.
+
+2. After the data blocks we store a bunch of meta blocks.  The
+supported meta block types are described below.  More meta block types
+may be added in the future.  Each meta block is again formatted using
+`block_builder.cc` and then optionally compressed.
+
+3. A "metaindex" block.  It contains one entry for every other meta
+block where the key is the name of the meta block and the value is a
+BlockHandle pointing to that meta block.
+
+4. An "index" block.  This block contains one entry per data block,
+where the key is a string >= last key in that data block and before
+the first key in the successive data block.  The value is the
+BlockHandle for the data block.
+
+5. At the very end of the file is a fixed length footer that contains
+the BlockHandle of the metaindex and index blocks as well as a magic number.
+
+        metaindex_handle: char[p];     // Block handle for metaindex
+        index_handle:     char[q];     // Block handle for index
+        padding:          char[40-p-q];// zeroed bytes to make fixed length
+                                       // (40==2*BlockHandle::kMaxEncodedLength)
+        magic:            fixed64;     // == 0xdb4775248b80fb57 (little-endian)
+
+## "filter" Meta Block
+
+If a `FilterPolicy` was specified when the database was opened, a
+filter block is stored in each table.  The "metaindex" block contains
+an entry that maps from `filter.<N>` to the BlockHandle for the filter
+block where `<N>` is the string returned by the filter policy's
+`Name()` method.
+
+The filter block stores a sequence of filters, where filter i contains
+the output of `FilterPolicy::CreateFilter()` on all keys that are stored
+in a block whose file offset falls within the range
+
+    [ i*base ... (i+1)*base-1 ]
+
+Currently, "base" is 2KB.  So for example, if blocks X and Y start in
+the range `[ 0KB .. 2KB-1 ]`, all of the keys in X and Y will be
+converted to a filter by calling `FilterPolicy::CreateFilter()`, and the
+resulting filter will be stored as the first filter in the filter
+block.
+
+The filter block is formatted as follows:
+
+    [filter 0]
+    [filter 1]
+    [filter 2]
+    ...
+    [filter N-1]
+
+    [offset of filter 0]                  : 4 bytes
+    [offset of filter 1]                  : 4 bytes
+    [offset of filter 2]                  : 4 bytes
+    ...
+    [offset of filter N-1]                : 4 bytes
+
+    [offset of beginning of offset array] : 4 bytes
+    lg(base)                              : 1 byte
+
+The offset array at the end of the filter block allows efficient
+mapping from a data block offset to the corresponding filter.
+
+## "stats" Meta Block
+
+This meta block contains a bunch of stats.  The key is the name
+of the statistic.  The value contains the statistic.
+
+TODO(postrelease): record following stats.
+
+    data size
+    index size
+    key size (uncompressed)
+    value size (uncompressed)
+    number of entries
+    number of data blocks
diff --git a/depend/zcash/src/leveldb/helpers/memenv/memenv.cc b/depend/zcash/src/leveldb/helpers/memenv/memenv.cc
new file mode 100644
index 000000000..68c0614a5
--- /dev/null
+++ b/depend/zcash/src/leveldb/helpers/memenv/memenv.cc
@@ -0,0 +1,401 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "helpers/memenv/memenv.h"
+
+#include "leveldb/env.h"
+#include "leveldb/status.h"
+#include "port/port.h"
+#include "util/mutexlock.h"
+#include <map>
+#include <string.h>
+#include <string>
+#include <vector>
+
+namespace leveldb {
+
+namespace {
+
+class FileState {
+ public:
+  // FileStates are reference counted. The initial reference count is zero
+  // and the caller must call Ref() at least once.
+  FileState() : refs_(0), size_(0) {}
+
+  // Increase the reference count.
+  void Ref() {
+    MutexLock lock(&refs_mutex_);
+    ++refs_;
+  }
+
+  // Decrease the reference count. Delete if this is the last reference.
+  void Unref() {
+    bool do_delete = false;
+
+    {
+      MutexLock lock(&refs_mutex_);
+      --refs_;
+      assert(refs_ >= 0);
+      if (refs_ <= 0) {
+        do_delete = true;
+      }
+    }
+
+    if (do_delete) {
+      delete this;
+    }
+  }
+
+  uint64_t Size() const { return size_; }
+
+  Status Read(uint64_t offset, size_t n, Slice* result, char* scratch) const {
+    if (offset > size_) {
+      return Status::IOError("Offset greater than file size.");
+    }
+    const uint64_t available = size_ - offset;
+    if (n > available) {
+      n = static_cast<size_t>(available);
+    }
+    if (n == 0) {
+      *result = Slice();
+      return Status::OK();
+    }
+
+    assert(offset / kBlockSize <= SIZE_MAX);
+    size_t block = static_cast<size_t>(offset / kBlockSize);
+    size_t block_offset = offset % kBlockSize;
+
+    if (n <= kBlockSize - block_offset) {
+      // The requested bytes are all in the first block.
+      *result = Slice(blocks_[block] + block_offset, n);
+      return Status::OK();
+    }
+
+    size_t bytes_to_copy = n;
+    char* dst = scratch;
+
+    while (bytes_to_copy > 0) {
+      size_t avail = kBlockSize - block_offset;
+      if (avail > bytes_to_copy) {
+        avail = bytes_to_copy;
+      }
+      memcpy(dst, blocks_[block] + block_offset, avail);
+
+      bytes_to_copy -= avail;
+      dst += avail;
+      block++;
+      block_offset = 0;
+    }
+
+    *result = Slice(scratch, n);
+    return Status::OK();
+  }
+
+  Status Append(const Slice& data) {
+    const char* src = data.data();
+    size_t src_len = data.size();
+
+    while (src_len > 0) {
+      size_t avail;
+      size_t offset = size_ % kBlockSize;
+
+      if (offset != 0) {
+        // There is some room in the last block.
+        avail = kBlockSize - offset;
+      } else {
+        // No room in the last block; push new one.
+        blocks_.push_back(new char[kBlockSize]);
+        avail = kBlockSize;
+      }
+
+      if (avail > src_len) {
+        avail = src_len;
+      }
+      memcpy(blocks_.back() + offset, src, avail);
+      src_len -= avail;
+      src += avail;
+      size_ += avail;
+    }
+
+    return Status::OK();
+  }
+
+ private:
+  // Private since only Unref() should be used to delete it.
+  ~FileState() {
+    for (std::vector<char*>::iterator i = blocks_.begin(); i != blocks_.end();
+         ++i) {
+      delete [] *i;
+    }
+  }
+
+  // No copying allowed.
+  FileState(const FileState&);
+  void operator=(const FileState&);
+
+  port::Mutex refs_mutex_;
+  int refs_;  // Protected by refs_mutex_;
+
+  // The following fields are not protected by any mutex. They are only mutable
+  // while the file is being written, and concurrent access is not allowed
+  // to writable files.
+  std::vector<char*> blocks_;
+  uint64_t size_;
+
+  enum { kBlockSize = 8 * 1024 };
+};
+
+class SequentialFileImpl : public SequentialFile {
+ public:
+  explicit SequentialFileImpl(FileState* file) : file_(file), pos_(0) {
+    file_->Ref();
+  }
+
+  ~SequentialFileImpl() {
+    file_->Unref();
+  }
+
+  virtual Status Read(size_t n, Slice* result, char* scratch) {
+    Status s = file_->Read(pos_, n, result, scratch);
+    if (s.ok()) {
+      pos_ += result->size();
+    }
+    return s;
+  }
+
+  virtual Status Skip(uint64_t n) {
+    if (pos_ > file_->Size()) {
+      return Status::IOError("pos_ > file_->Size()");
+    }
+    const uint64_t available = file_->Size() - pos_;
+    if (n > available) {
+      n = available;
+    }
+    pos_ += n;
+    return Status::OK();
+  }
+
+  virtual std::string GetName() const { return "[memenv]"; }
+ private:
+  FileState* file_;
+  uint64_t pos_;
+};
+
+class RandomAccessFileImpl : public RandomAccessFile {
+ public:
+  explicit RandomAccessFileImpl(FileState* file) : file_(file) {
+    file_->Ref();
+  }
+
+  ~RandomAccessFileImpl() {
+    file_->Unref();
+  }
+
+  virtual Status Read(uint64_t offset, size_t n, Slice* result,
+                      char* scratch) const {
+    return file_->Read(offset, n, result, scratch);
+  }
+
+  virtual std::string GetName() const { return "[memenv]"; }
+ private:
+  FileState* file_;
+};
+
+class WritableFileImpl : public WritableFile {
+ public:
+  WritableFileImpl(FileState* file) : file_(file) {
+    file_->Ref();
+  }
+
+  ~WritableFileImpl() {
+    file_->Unref();
+  }
+
+  virtual Status Append(const Slice& data) {
+    return file_->Append(data);
+  }
+
+  virtual Status Close() { return Status::OK(); }
+  virtual Status Flush() { return Status::OK(); }
+  virtual Status Sync() { return Status::OK(); }
+
+  virtual std::string GetName() const { return "[memenv]"; }
+ private:
+  FileState* file_;
+};
+
+class NoOpLogger : public Logger {
+ public:
+  virtual void Logv(const char* format, va_list ap) { }
+};
+
+class InMemoryEnv : public EnvWrapper {
+ public:
+  explicit InMemoryEnv(Env* base_env) : EnvWrapper(base_env) { }
+
+  virtual ~InMemoryEnv() {
+    for (FileSystem::iterator i = file_map_.begin(); i != file_map_.end(); ++i){
+      i->second->Unref();
+    }
+  }
+
+  // Partial implementation of the Env interface.
+  virtual Status NewSequentialFile(const std::string& fname,
+                                   SequentialFile** result) {
+    MutexLock lock(&mutex_);
+    if (file_map_.find(fname) == file_map_.end()) {
+      *result = NULL;
+      return Status::IOError(fname, "File not found");
+    }
+
+    *result = new SequentialFileImpl(file_map_[fname]);
+    return Status::OK();
+  }
+
+  virtual Status NewRandomAccessFile(const std::string& fname,
+                                     RandomAccessFile** result) {
+    MutexLock lock(&mutex_);
+    if (file_map_.find(fname) == file_map_.end()) {
+      *result = NULL;
+      return Status::IOError(fname, "File not found");
+    }
+
+    *result = new RandomAccessFileImpl(file_map_[fname]);
+    return Status::OK();
+  }
+
+  virtual Status NewWritableFile(const std::string& fname,
+                                 WritableFile** result) {
+    MutexLock lock(&mutex_);
+    if (file_map_.find(fname) != file_map_.end()) {
+      DeleteFileInternal(fname);
+    }
+
+    FileState* file = new FileState();
+    file->Ref();
+    file_map_[fname] = file;
+
+    *result = new WritableFileImpl(file);
+    return Status::OK();
+  }
+
+  virtual Status NewAppendableFile(const std::string& fname,
+                                   WritableFile** result) {
+    MutexLock lock(&mutex_);
+    FileState** sptr = &file_map_[fname];
+    FileState* file = *sptr;
+    if (file == NULL) {
+      file = new FileState();
+      file->Ref();
+    }
+    *result = new WritableFileImpl(file);
+    return Status::OK();
+  }
+
+  virtual bool FileExists(const std::string& fname) {
+    MutexLock lock(&mutex_);
+    return file_map_.find(fname) != file_map_.end();
+  }
+
+  virtual Status GetChildren(const std::string& dir,
+                             std::vector<std::string>* result) {
+    MutexLock lock(&mutex_);
+    result->clear();
+
+    for (FileSystem::iterator i = file_map_.begin(); i != file_map_.end(); ++i){
+      const std::string& filename = i->first;
+
+      if (filename.size() >= dir.size() + 1 && filename[dir.size()] == '/' &&
+          Slice(filename).starts_with(Slice(dir))) {
+        result->push_back(filename.substr(dir.size() + 1));
+      }
+    }
+
+    return Status::OK();
+  }
+
+  void DeleteFileInternal(const std::string& fname) {
+    if (file_map_.find(fname) == file_map_.end()) {
+      return;
+    }
+
+    file_map_[fname]->Unref();
+    file_map_.erase(fname);
+  }
+
+  virtual Status DeleteFile(const std::string& fname) {
+    MutexLock lock(&mutex_);
+    if (file_map_.find(fname) == file_map_.end()) {
+      return Status::IOError(fname, "File not found");
+    }
+
+    DeleteFileInternal(fname);
+    return Status::OK();
+  }
+
+  virtual Status CreateDir(const std::string& dirname) {
+    return Status::OK();
+  }
+
+  virtual Status DeleteDir(const std::string& dirname) {
+    return Status::OK();
+  }
+
+  virtual Status GetFileSize(const std::string& fname, uint64_t* file_size) {
+    MutexLock lock(&mutex_);
+    if (file_map_.find(fname) == file_map_.end()) {
+      return Status::IOError(fname, "File not found");
+    }
+
+    *file_size = file_map_[fname]->Size();
+    return Status::OK();
+  }
+
+  virtual Status RenameFile(const std::string& src,
+                            const std::string& target) {
+    MutexLock lock(&mutex_);
+    if (file_map_.find(src) == file_map_.end()) {
+      return Status::IOError(src, "File not found");
+    }
+
+    DeleteFileInternal(target);
+    file_map_[target] = file_map_[src];
+    file_map_.erase(src);
+    return Status::OK();
+  }
+
+  virtual Status LockFile(const std::string& fname, FileLock** lock) {
+    *lock = new FileLock;
+    return Status::OK();
+  }
+
+  virtual Status UnlockFile(FileLock* lock) {
+    delete lock;
+    return Status::OK();
+  }
+
+  virtual Status GetTestDirectory(std::string* path) {
+    *path = "/test";
+    return Status::OK();
+  }
+
+  virtual Status NewLogger(const std::string& fname, Logger** result) {
+    *result = new NoOpLogger;
+    return Status::OK();
+  }
+
+ private:
+  // Map from filenames to FileState objects, representing a simple file system.
+  typedef std::map<std::string, FileState*> FileSystem;
+  port::Mutex mutex_;
+  FileSystem file_map_;  // Protected by mutex_.
+};
+
+}  // namespace
+
+Env* NewMemEnv(Env* base_env) {
+  return new InMemoryEnv(base_env);
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/helpers/memenv/memenv.h b/depend/zcash/src/leveldb/helpers/memenv/memenv.h
new file mode 100644
index 000000000..03b88de76
--- /dev/null
+++ b/depend/zcash/src/leveldb/helpers/memenv/memenv.h
@@ -0,0 +1,20 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_HELPERS_MEMENV_MEMENV_H_
+#define STORAGE_LEVELDB_HELPERS_MEMENV_MEMENV_H_
+
+namespace leveldb {
+
+class Env;
+
+// Returns a new environment that stores its data in memory and delegates
+// all non-file-storage tasks to base_env. The caller must delete the result
+// when it is no longer needed.
+// *base_env must remain live while the result is in use.
+Env* NewMemEnv(Env* base_env);
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_HELPERS_MEMENV_MEMENV_H_
diff --git a/depend/zcash/src/leveldb/helpers/memenv/memenv_test.cc b/depend/zcash/src/leveldb/helpers/memenv/memenv_test.cc
new file mode 100644
index 000000000..5cff77613
--- /dev/null
+++ b/depend/zcash/src/leveldb/helpers/memenv/memenv_test.cc
@@ -0,0 +1,241 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "helpers/memenv/memenv.h"
+
+#include "db/db_impl.h"
+#include "leveldb/db.h"
+#include "leveldb/env.h"
+#include "util/testharness.h"
+#include <string>
+#include <vector>
+
+namespace leveldb {
+
+class MemEnvTest {
+ public:
+  Env* env_;
+
+  MemEnvTest()
+      : env_(NewMemEnv(Env::Default())) {
+  }
+  ~MemEnvTest() {
+    delete env_;
+  }
+};
+
+TEST(MemEnvTest, Basics) {
+  uint64_t file_size;
+  WritableFile* writable_file;
+  std::vector<std::string> children;
+
+  ASSERT_OK(env_->CreateDir("/dir"));
+
+  // Check that the directory is empty.
+  ASSERT_TRUE(!env_->FileExists("/dir/non_existent"));
+  ASSERT_TRUE(!env_->GetFileSize("/dir/non_existent", &file_size).ok());
+  ASSERT_OK(env_->GetChildren("/dir", &children));
+  ASSERT_EQ(0, children.size());
+
+  // Create a file.
+  ASSERT_OK(env_->NewWritableFile("/dir/f", &writable_file));
+  ASSERT_OK(env_->GetFileSize("/dir/f", &file_size));
+  ASSERT_EQ(0, file_size);
+  delete writable_file;
+
+  // Check that the file exists.
+  ASSERT_TRUE(env_->FileExists("/dir/f"));
+  ASSERT_OK(env_->GetFileSize("/dir/f", &file_size));
+  ASSERT_EQ(0, file_size);
+  ASSERT_OK(env_->GetChildren("/dir", &children));
+  ASSERT_EQ(1, children.size());
+  ASSERT_EQ("f", children[0]);
+
+  // Write to the file.
+  ASSERT_OK(env_->NewWritableFile("/dir/f", &writable_file));
+  ASSERT_OK(writable_file->Append("abc"));
+  delete writable_file;
+
+  // Check that append works.
+  ASSERT_OK(env_->NewAppendableFile("/dir/f", &writable_file));
+  ASSERT_OK(env_->GetFileSize("/dir/f", &file_size));
+  ASSERT_EQ(3, file_size);
+  ASSERT_OK(writable_file->Append("hello"));
+  delete writable_file;
+
+  // Check for expected size.
+  ASSERT_OK(env_->GetFileSize("/dir/f", &file_size));
+  ASSERT_EQ(8, file_size);
+
+  // Check that renaming works.
+  ASSERT_TRUE(!env_->RenameFile("/dir/non_existent", "/dir/g").ok());
+  ASSERT_OK(env_->RenameFile("/dir/f", "/dir/g"));
+  ASSERT_TRUE(!env_->FileExists("/dir/f"));
+  ASSERT_TRUE(env_->FileExists("/dir/g"));
+  ASSERT_OK(env_->GetFileSize("/dir/g", &file_size));
+  ASSERT_EQ(8, file_size);
+
+  // Check that opening non-existent file fails.
+  SequentialFile* seq_file;
+  RandomAccessFile* rand_file;
+  ASSERT_TRUE(!env_->NewSequentialFile("/dir/non_existent", &seq_file).ok());
+  ASSERT_TRUE(!seq_file);
+  ASSERT_TRUE(!env_->NewRandomAccessFile("/dir/non_existent", &rand_file).ok());
+  ASSERT_TRUE(!rand_file);
+
+  // Check that deleting works.
+  ASSERT_TRUE(!env_->DeleteFile("/dir/non_existent").ok());
+  ASSERT_OK(env_->DeleteFile("/dir/g"));
+  ASSERT_TRUE(!env_->FileExists("/dir/g"));
+  ASSERT_OK(env_->GetChildren("/dir", &children));
+  ASSERT_EQ(0, children.size());
+  ASSERT_OK(env_->DeleteDir("/dir"));
+}
+
+TEST(MemEnvTest, ReadWrite) {
+  WritableFile* writable_file;
+  SequentialFile* seq_file;
+  RandomAccessFile* rand_file;
+  Slice result;
+  char scratch[100];
+
+  ASSERT_OK(env_->CreateDir("/dir"));
+
+  ASSERT_OK(env_->NewWritableFile("/dir/f", &writable_file));
+  ASSERT_OK(writable_file->Append("hello "));
+  ASSERT_OK(writable_file->Append("world"));
+  delete writable_file;
+
+  // Read sequentially.
+  ASSERT_OK(env_->NewSequentialFile("/dir/f", &seq_file));
+  ASSERT_OK(seq_file->Read(5, &result, scratch)); // Read "hello".
+  ASSERT_EQ(0, result.compare("hello"));
+  ASSERT_OK(seq_file->Skip(1));
+  ASSERT_OK(seq_file->Read(1000, &result, scratch)); // Read "world".
+  ASSERT_EQ(0, result.compare("world"));
+  ASSERT_OK(seq_file->Read(1000, &result, scratch)); // Try reading past EOF.
+  ASSERT_EQ(0, result.size());
+  ASSERT_OK(seq_file->Skip(100)); // Try to skip past end of file.
+  ASSERT_OK(seq_file->Read(1000, &result, scratch));
+  ASSERT_EQ(0, result.size());
+  delete seq_file;
+
+  // Random reads.
+  ASSERT_OK(env_->NewRandomAccessFile("/dir/f", &rand_file));
+  ASSERT_OK(rand_file->Read(6, 5, &result, scratch)); // Read "world".
+  ASSERT_EQ(0, result.compare("world"));
+  ASSERT_OK(rand_file->Read(0, 5, &result, scratch)); // Read "hello".
+  ASSERT_EQ(0, result.compare("hello"));
+  ASSERT_OK(rand_file->Read(10, 100, &result, scratch)); // Read "d".
+  ASSERT_EQ(0, result.compare("d"));
+
+  // Too high offset.
+  ASSERT_TRUE(!rand_file->Read(1000, 5, &result, scratch).ok());
+  delete rand_file;
+}
+
+TEST(MemEnvTest, Locks) {
+  FileLock* lock;
+
+  // These are no-ops, but we test they return success.
+  ASSERT_OK(env_->LockFile("some file", &lock));
+  ASSERT_OK(env_->UnlockFile(lock));
+}
+
+TEST(MemEnvTest, Misc) {
+  std::string test_dir;
+  ASSERT_OK(env_->GetTestDirectory(&test_dir));
+  ASSERT_TRUE(!test_dir.empty());
+
+  WritableFile* writable_file;
+  ASSERT_OK(env_->NewWritableFile("/a/b", &writable_file));
+
+  // These are no-ops, but we test they return success.
+  ASSERT_OK(writable_file->Sync());
+  ASSERT_OK(writable_file->Flush());
+  ASSERT_OK(writable_file->Close());
+  delete writable_file;
+}
+
+TEST(MemEnvTest, LargeWrite) {
+  const size_t kWriteSize = 300 * 1024;
+  char* scratch = new char[kWriteSize * 2];
+
+  std::string write_data;
+  for (size_t i = 0; i < kWriteSize; ++i) {
+    write_data.append(1, static_cast<char>(i));
+  }
+
+  WritableFile* writable_file;
+  ASSERT_OK(env_->NewWritableFile("/dir/f", &writable_file));
+  ASSERT_OK(writable_file->Append("foo"));
+  ASSERT_OK(writable_file->Append(write_data));
+  delete writable_file;
+
+  SequentialFile* seq_file;
+  Slice result;
+  ASSERT_OK(env_->NewSequentialFile("/dir/f", &seq_file));
+  ASSERT_OK(seq_file->Read(3, &result, scratch)); // Read "foo".
+  ASSERT_EQ(0, result.compare("foo"));
+
+  size_t read = 0;
+  std::string read_data;
+  while (read < kWriteSize) {
+    ASSERT_OK(seq_file->Read(kWriteSize - read, &result, scratch));
+    read_data.append(result.data(), result.size());
+    read += result.size();
+  }
+  ASSERT_TRUE(write_data == read_data);
+  delete seq_file;
+  delete [] scratch;
+}
+
+TEST(MemEnvTest, DBTest) {
+  Options options;
+  options.create_if_missing = true;
+  options.env = env_;
+  DB* db;
+
+  const Slice keys[] = {Slice("aaa"), Slice("bbb"), Slice("ccc")};
+  const Slice vals[] = {Slice("foo"), Slice("bar"), Slice("baz")};
+
+  ASSERT_OK(DB::Open(options, "/dir/db", &db));
+  for (size_t i = 0; i < 3; ++i) {
+    ASSERT_OK(db->Put(WriteOptions(), keys[i], vals[i]));
+  }
+
+  for (size_t i = 0; i < 3; ++i) {
+    std::string res;
+    ASSERT_OK(db->Get(ReadOptions(), keys[i], &res));
+    ASSERT_TRUE(res == vals[i]);
+  }
+
+  Iterator* iterator = db->NewIterator(ReadOptions());
+  iterator->SeekToFirst();
+  for (size_t i = 0; i < 3; ++i) {
+    ASSERT_TRUE(iterator->Valid());
+    ASSERT_TRUE(keys[i] == iterator->key());
+    ASSERT_TRUE(vals[i] == iterator->value());
+    iterator->Next();
+  }
+  ASSERT_TRUE(!iterator->Valid());
+  delete iterator;
+
+  DBImpl* dbi = reinterpret_cast<DBImpl*>(db);
+  ASSERT_OK(dbi->TEST_CompactMemTable());
+
+  for (size_t i = 0; i < 3; ++i) {
+    std::string res;
+    ASSERT_OK(db->Get(ReadOptions(), keys[i], &res));
+    ASSERT_TRUE(res == vals[i]);
+  }
+
+  delete db;
+}
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/include/leveldb/c.h b/depend/zcash/src/leveldb/include/leveldb/c.h
new file mode 100644
index 000000000..1048fe3b8
--- /dev/null
+++ b/depend/zcash/src/leveldb/include/leveldb/c.h
@@ -0,0 +1,290 @@
+/* Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+  Use of this source code is governed by a BSD-style license that can be
+  found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+  C bindings for leveldb.  May be useful as a stable ABI that can be
+  used by programs that keep leveldb in a shared library, or for
+  a JNI api.
+
+  Does not support:
+  . getters for the option types
+  . custom comparators that implement key shortening
+  . custom iter, db, env, cache implementations using just the C bindings
+
+  Some conventions:
+
+  (1) We expose just opaque struct pointers and functions to clients.
+  This allows us to change internal representations without having to
+  recompile clients.
+
+  (2) For simplicity, there is no equivalent to the Slice type.  Instead,
+  the caller has to pass the pointer and length as separate
+  arguments.
+
+  (3) Errors are represented by a null-terminated c string.  NULL
+  means no error.  All operations that can raise an error are passed
+  a "char** errptr" as the last argument.  One of the following must
+  be true on entry:
+     *errptr == NULL
+     *errptr points to a malloc()ed null-terminated error message
+       (On Windows, *errptr must have been malloc()-ed by this library.)
+  On success, a leveldb routine leaves *errptr unchanged.
+  On failure, leveldb frees the old value of *errptr and
+  set *errptr to a malloc()ed error message.
+
+  (4) Bools have the type unsigned char (0 == false; rest == true)
+
+  (5) All of the pointer arguments must be non-NULL.
+*/
+
+#ifndef STORAGE_LEVELDB_INCLUDE_C_H_
+#define STORAGE_LEVELDB_INCLUDE_C_H_
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#include <stdarg.h>
+#include <stddef.h>
+#include <stdint.h>
+
+/* Exported types */
+
+typedef struct leveldb_t               leveldb_t;
+typedef struct leveldb_cache_t         leveldb_cache_t;
+typedef struct leveldb_comparator_t    leveldb_comparator_t;
+typedef struct leveldb_env_t           leveldb_env_t;
+typedef struct leveldb_filelock_t      leveldb_filelock_t;
+typedef struct leveldb_filterpolicy_t  leveldb_filterpolicy_t;
+typedef struct leveldb_iterator_t      leveldb_iterator_t;
+typedef struct leveldb_logger_t        leveldb_logger_t;
+typedef struct leveldb_options_t       leveldb_options_t;
+typedef struct leveldb_randomfile_t    leveldb_randomfile_t;
+typedef struct leveldb_readoptions_t   leveldb_readoptions_t;
+typedef struct leveldb_seqfile_t       leveldb_seqfile_t;
+typedef struct leveldb_snapshot_t      leveldb_snapshot_t;
+typedef struct leveldb_writablefile_t  leveldb_writablefile_t;
+typedef struct leveldb_writebatch_t    leveldb_writebatch_t;
+typedef struct leveldb_writeoptions_t  leveldb_writeoptions_t;
+
+/* DB operations */
+
+extern leveldb_t* leveldb_open(
+    const leveldb_options_t* options,
+    const char* name,
+    char** errptr);
+
+extern void leveldb_close(leveldb_t* db);
+
+extern void leveldb_put(
+    leveldb_t* db,
+    const leveldb_writeoptions_t* options,
+    const char* key, size_t keylen,
+    const char* val, size_t vallen,
+    char** errptr);
+
+extern void leveldb_delete(
+    leveldb_t* db,
+    const leveldb_writeoptions_t* options,
+    const char* key, size_t keylen,
+    char** errptr);
+
+extern void leveldb_write(
+    leveldb_t* db,
+    const leveldb_writeoptions_t* options,
+    leveldb_writebatch_t* batch,
+    char** errptr);
+
+/* Returns NULL if not found.  A malloc()ed array otherwise.
+   Stores the length of the array in *vallen. */
+extern char* leveldb_get(
+    leveldb_t* db,
+    const leveldb_readoptions_t* options,
+    const char* key, size_t keylen,
+    size_t* vallen,
+    char** errptr);
+
+extern leveldb_iterator_t* leveldb_create_iterator(
+    leveldb_t* db,
+    const leveldb_readoptions_t* options);
+
+extern const leveldb_snapshot_t* leveldb_create_snapshot(
+    leveldb_t* db);
+
+extern void leveldb_release_snapshot(
+    leveldb_t* db,
+    const leveldb_snapshot_t* snapshot);
+
+/* Returns NULL if property name is unknown.
+   Else returns a pointer to a malloc()-ed null-terminated value. */
+extern char* leveldb_property_value(
+    leveldb_t* db,
+    const char* propname);
+
+extern void leveldb_approximate_sizes(
+    leveldb_t* db,
+    int num_ranges,
+    const char* const* range_start_key, const size_t* range_start_key_len,
+    const char* const* range_limit_key, const size_t* range_limit_key_len,
+    uint64_t* sizes);
+
+extern void leveldb_compact_range(
+    leveldb_t* db,
+    const char* start_key, size_t start_key_len,
+    const char* limit_key, size_t limit_key_len);
+
+/* Management operations */
+
+extern void leveldb_destroy_db(
+    const leveldb_options_t* options,
+    const char* name,
+    char** errptr);
+
+extern void leveldb_repair_db(
+    const leveldb_options_t* options,
+    const char* name,
+    char** errptr);
+
+/* Iterator */
+
+extern void leveldb_iter_destroy(leveldb_iterator_t*);
+extern unsigned char leveldb_iter_valid(const leveldb_iterator_t*);
+extern void leveldb_iter_seek_to_first(leveldb_iterator_t*);
+extern void leveldb_iter_seek_to_last(leveldb_iterator_t*);
+extern void leveldb_iter_seek(leveldb_iterator_t*, const char* k, size_t klen);
+extern void leveldb_iter_next(leveldb_iterator_t*);
+extern void leveldb_iter_prev(leveldb_iterator_t*);
+extern const char* leveldb_iter_key(const leveldb_iterator_t*, size_t* klen);
+extern const char* leveldb_iter_value(const leveldb_iterator_t*, size_t* vlen);
+extern void leveldb_iter_get_error(const leveldb_iterator_t*, char** errptr);
+
+/* Write batch */
+
+extern leveldb_writebatch_t* leveldb_writebatch_create();
+extern void leveldb_writebatch_destroy(leveldb_writebatch_t*);
+extern void leveldb_writebatch_clear(leveldb_writebatch_t*);
+extern void leveldb_writebatch_put(
+    leveldb_writebatch_t*,
+    const char* key, size_t klen,
+    const char* val, size_t vlen);
+extern void leveldb_writebatch_delete(
+    leveldb_writebatch_t*,
+    const char* key, size_t klen);
+extern void leveldb_writebatch_iterate(
+    leveldb_writebatch_t*,
+    void* state,
+    void (*put)(void*, const char* k, size_t klen, const char* v, size_t vlen),
+    void (*deleted)(void*, const char* k, size_t klen));
+
+/* Options */
+
+extern leveldb_options_t* leveldb_options_create();
+extern void leveldb_options_destroy(leveldb_options_t*);
+extern void leveldb_options_set_comparator(
+    leveldb_options_t*,
+    leveldb_comparator_t*);
+extern void leveldb_options_set_filter_policy(
+    leveldb_options_t*,
+    leveldb_filterpolicy_t*);
+extern void leveldb_options_set_create_if_missing(
+    leveldb_options_t*, unsigned char);
+extern void leveldb_options_set_error_if_exists(
+    leveldb_options_t*, unsigned char);
+extern void leveldb_options_set_paranoid_checks(
+    leveldb_options_t*, unsigned char);
+extern void leveldb_options_set_env(leveldb_options_t*, leveldb_env_t*);
+extern void leveldb_options_set_info_log(leveldb_options_t*, leveldb_logger_t*);
+extern void leveldb_options_set_write_buffer_size(leveldb_options_t*, size_t);
+extern void leveldb_options_set_max_open_files(leveldb_options_t*, int);
+extern void leveldb_options_set_cache(leveldb_options_t*, leveldb_cache_t*);
+extern void leveldb_options_set_block_size(leveldb_options_t*, size_t);
+extern void leveldb_options_set_block_restart_interval(leveldb_options_t*, int);
+
+enum {
+  leveldb_no_compression = 0,
+  leveldb_snappy_compression = 1
+};
+extern void leveldb_options_set_compression(leveldb_options_t*, int);
+
+/* Comparator */
+
+extern leveldb_comparator_t* leveldb_comparator_create(
+    void* state,
+    void (*destructor)(void*),
+    int (*compare)(
+        void*,
+        const char* a, size_t alen,
+        const char* b, size_t blen),
+    const char* (*name)(void*));
+extern void leveldb_comparator_destroy(leveldb_comparator_t*);
+
+/* Filter policy */
+
+extern leveldb_filterpolicy_t* leveldb_filterpolicy_create(
+    void* state,
+    void (*destructor)(void*),
+    char* (*create_filter)(
+        void*,
+        const char* const* key_array, const size_t* key_length_array,
+        int num_keys,
+        size_t* filter_length),
+    unsigned char (*key_may_match)(
+        void*,
+        const char* key, size_t length,
+        const char* filter, size_t filter_length),
+    const char* (*name)(void*));
+extern void leveldb_filterpolicy_destroy(leveldb_filterpolicy_t*);
+
+extern leveldb_filterpolicy_t* leveldb_filterpolicy_create_bloom(
+    int bits_per_key);
+
+/* Read options */
+
+extern leveldb_readoptions_t* leveldb_readoptions_create();
+extern void leveldb_readoptions_destroy(leveldb_readoptions_t*);
+extern void leveldb_readoptions_set_verify_checksums(
+    leveldb_readoptions_t*,
+    unsigned char);
+extern void leveldb_readoptions_set_fill_cache(
+    leveldb_readoptions_t*, unsigned char);
+extern void leveldb_readoptions_set_snapshot(
+    leveldb_readoptions_t*,
+    const leveldb_snapshot_t*);
+
+/* Write options */
+
+extern leveldb_writeoptions_t* leveldb_writeoptions_create();
+extern void leveldb_writeoptions_destroy(leveldb_writeoptions_t*);
+extern void leveldb_writeoptions_set_sync(
+    leveldb_writeoptions_t*, unsigned char);
+
+/* Cache */
+
+extern leveldb_cache_t* leveldb_cache_create_lru(size_t capacity);
+extern void leveldb_cache_destroy(leveldb_cache_t* cache);
+
+/* Env */
+
+extern leveldb_env_t* leveldb_create_default_env();
+extern void leveldb_env_destroy(leveldb_env_t*);
+
+/* Utility */
+
+/* Calls free(ptr).
+   REQUIRES: ptr was malloc()-ed and returned by one of the routines
+   in this file.  Note that in certain cases (typically on Windows), you
+   may need to call this routine instead of free(ptr) to dispose of
+   malloc()-ed memory returned by this library. */
+extern void leveldb_free(void* ptr);
+
+/* Return the major version number for this release. */
+extern int leveldb_major_version();
+
+/* Return the minor version number for this release. */
+extern int leveldb_minor_version();
+
+#ifdef __cplusplus
+}  /* end extern "C" */
+#endif
+
+#endif  /* STORAGE_LEVELDB_INCLUDE_C_H_ */
diff --git a/depend/zcash/src/leveldb/include/leveldb/cache.h b/depend/zcash/src/leveldb/include/leveldb/cache.h
new file mode 100644
index 000000000..6819d5bc4
--- /dev/null
+++ b/depend/zcash/src/leveldb/include/leveldb/cache.h
@@ -0,0 +1,110 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// A Cache is an interface that maps keys to values.  It has internal
+// synchronization and may be safely accessed concurrently from
+// multiple threads.  It may automatically evict entries to make room
+// for new entries.  Values have a specified charge against the cache
+// capacity.  For example, a cache where the values are variable
+// length strings, may use the length of the string as the charge for
+// the string.
+//
+// A builtin cache implementation with a least-recently-used eviction
+// policy is provided.  Clients may use their own implementations if
+// they want something more sophisticated (like scan-resistance, a
+// custom eviction policy, variable cache sizing, etc.)
+
+#ifndef STORAGE_LEVELDB_INCLUDE_CACHE_H_
+#define STORAGE_LEVELDB_INCLUDE_CACHE_H_
+
+#include <stdint.h>
+#include "leveldb/slice.h"
+
+namespace leveldb {
+
+class Cache;
+
+// Create a new cache with a fixed size capacity.  This implementation
+// of Cache uses a least-recently-used eviction policy.
+extern Cache* NewLRUCache(size_t capacity);
+
+class Cache {
+ public:
+  Cache() { }
+
+  // Destroys all existing entries by calling the "deleter"
+  // function that was passed to the constructor.
+  virtual ~Cache();
+
+  // Opaque handle to an entry stored in the cache.
+  struct Handle { };
+
+  // Insert a mapping from key->value into the cache and assign it
+  // the specified charge against the total cache capacity.
+  //
+  // Returns a handle that corresponds to the mapping.  The caller
+  // must call this->Release(handle) when the returned mapping is no
+  // longer needed.
+  //
+  // When the inserted entry is no longer needed, the key and
+  // value will be passed to "deleter".
+  virtual Handle* Insert(const Slice& key, void* value, size_t charge,
+                         void (*deleter)(const Slice& key, void* value)) = 0;
+
+  // If the cache has no mapping for "key", returns NULL.
+  //
+  // Else return a handle that corresponds to the mapping.  The caller
+  // must call this->Release(handle) when the returned mapping is no
+  // longer needed.
+  virtual Handle* Lookup(const Slice& key) = 0;
+
+  // Release a mapping returned by a previous Lookup().
+  // REQUIRES: handle must not have been released yet.
+  // REQUIRES: handle must have been returned by a method on *this.
+  virtual void Release(Handle* handle) = 0;
+
+  // Return the value encapsulated in a handle returned by a
+  // successful Lookup().
+  // REQUIRES: handle must not have been released yet.
+  // REQUIRES: handle must have been returned by a method on *this.
+  virtual void* Value(Handle* handle) = 0;
+
+  // If the cache contains entry for key, erase it.  Note that the
+  // underlying entry will be kept around until all existing handles
+  // to it have been released.
+  virtual void Erase(const Slice& key) = 0;
+
+  // Return a new numeric id.  May be used by multiple clients who are
+  // sharing the same cache to partition the key space.  Typically the
+  // client will allocate a new id at startup and prepend the id to
+  // its cache keys.
+  virtual uint64_t NewId() = 0;
+
+  // Remove all cache entries that are not actively in use.  Memory-constrained
+  // applications may wish to call this method to reduce memory usage.
+  // Default implementation of Prune() does nothing.  Subclasses are strongly
+  // encouraged to override the default implementation.  A future release of
+  // leveldb may change Prune() to a pure abstract method.
+  virtual void Prune() {}
+
+  // Return an estimate of the combined charges of all elements stored in the
+  // cache.
+  virtual size_t TotalCharge() const = 0;
+
+ private:
+  void LRU_Remove(Handle* e);
+  void LRU_Append(Handle* e);
+  void Unref(Handle* e);
+
+  struct Rep;
+  Rep* rep_;
+
+  // No copying allowed
+  Cache(const Cache&);
+  void operator=(const Cache&);
+};
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_INCLUDE_CACHE_H_
diff --git a/depend/zcash/src/leveldb/include/leveldb/comparator.h b/depend/zcash/src/leveldb/include/leveldb/comparator.h
new file mode 100644
index 000000000..556b984c7
--- /dev/null
+++ b/depend/zcash/src/leveldb/include/leveldb/comparator.h
@@ -0,0 +1,63 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_INCLUDE_COMPARATOR_H_
+#define STORAGE_LEVELDB_INCLUDE_COMPARATOR_H_
+
+#include <string>
+
+namespace leveldb {
+
+class Slice;
+
+// A Comparator object provides a total order across slices that are
+// used as keys in an sstable or a database.  A Comparator implementation
+// must be thread-safe since leveldb may invoke its methods concurrently
+// from multiple threads.
+class Comparator {
+ public:
+  virtual ~Comparator();
+
+  // Three-way comparison.  Returns value:
+  //   < 0 iff "a" < "b",
+  //   == 0 iff "a" == "b",
+  //   > 0 iff "a" > "b"
+  virtual int Compare(const Slice& a, const Slice& b) const = 0;
+
+  // The name of the comparator.  Used to check for comparator
+  // mismatches (i.e., a DB created with one comparator is
+  // accessed using a different comparator.
+  //
+  // The client of this package should switch to a new name whenever
+  // the comparator implementation changes in a way that will cause
+  // the relative ordering of any two keys to change.
+  //
+  // Names starting with "leveldb." are reserved and should not be used
+  // by any clients of this package.
+  virtual const char* Name() const = 0;
+
+  // Advanced functions: these are used to reduce the space requirements
+  // for internal data structures like index blocks.
+
+  // If *start < limit, changes *start to a short string in [start,limit).
+  // Simple comparator implementations may return with *start unchanged,
+  // i.e., an implementation of this method that does nothing is correct.
+  virtual void FindShortestSeparator(
+      std::string* start,
+      const Slice& limit) const = 0;
+
+  // Changes *key to a short string >= *key.
+  // Simple comparator implementations may return with *key unchanged,
+  // i.e., an implementation of this method that does nothing is correct.
+  virtual void FindShortSuccessor(std::string* key) const = 0;
+};
+
+// Return a builtin comparator that uses lexicographic byte-wise
+// ordering.  The result remains the property of this module and
+// must not be deleted.
+extern const Comparator* BytewiseComparator();
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_INCLUDE_COMPARATOR_H_
diff --git a/depend/zcash/src/leveldb/include/leveldb/db.h b/depend/zcash/src/leveldb/include/leveldb/db.h
new file mode 100644
index 000000000..bfab10a0b
--- /dev/null
+++ b/depend/zcash/src/leveldb/include/leveldb/db.h
@@ -0,0 +1,163 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_INCLUDE_DB_H_
+#define STORAGE_LEVELDB_INCLUDE_DB_H_
+
+#include <stdint.h>
+#include <stdio.h>
+#include "leveldb/iterator.h"
+#include "leveldb/options.h"
+
+namespace leveldb {
+
+// Update Makefile if you change these
+static const int kMajorVersion = 1;
+static const int kMinorVersion = 20;
+
+struct Options;
+struct ReadOptions;
+struct WriteOptions;
+class WriteBatch;
+
+// Abstract handle to particular state of a DB.
+// A Snapshot is an immutable object and can therefore be safely
+// accessed from multiple threads without any external synchronization.
+class Snapshot {
+ protected:
+  virtual ~Snapshot();
+};
+
+// A range of keys
+struct Range {
+  Slice start;          // Included in the range
+  Slice limit;          // Not included in the range
+
+  Range() { }
+  Range(const Slice& s, const Slice& l) : start(s), limit(l) { }
+};
+
+// A DB is a persistent ordered map from keys to values.
+// A DB is safe for concurrent access from multiple threads without
+// any external synchronization.
+class DB {
+ public:
+  // Open the database with the specified "name".
+  // Stores a pointer to a heap-allocated database in *dbptr and returns
+  // OK on success.
+  // Stores NULL in *dbptr and returns a non-OK status on error.
+  // Caller should delete *dbptr when it is no longer needed.
+  static Status Open(const Options& options,
+                     const std::string& name,
+                     DB** dbptr);
+
+  DB() { }
+  virtual ~DB();
+
+  // Set the database entry for "key" to "value".  Returns OK on success,
+  // and a non-OK status on error.
+  // Note: consider setting options.sync = true.
+  virtual Status Put(const WriteOptions& options,
+                     const Slice& key,
+                     const Slice& value) = 0;
+
+  // Remove the database entry (if any) for "key".  Returns OK on
+  // success, and a non-OK status on error.  It is not an error if "key"
+  // did not exist in the database.
+  // Note: consider setting options.sync = true.
+  virtual Status Delete(const WriteOptions& options, const Slice& key) = 0;
+
+  // Apply the specified updates to the database.
+  // Returns OK on success, non-OK on failure.
+  // Note: consider setting options.sync = true.
+  virtual Status Write(const WriteOptions& options, WriteBatch* updates) = 0;
+
+  // If the database contains an entry for "key" store the
+  // corresponding value in *value and return OK.
+  //
+  // If there is no entry for "key" leave *value unchanged and return
+  // a status for which Status::IsNotFound() returns true.
+  //
+  // May return some other Status on an error.
+  virtual Status Get(const ReadOptions& options,
+                     const Slice& key, std::string* value) = 0;
+
+  // Return a heap-allocated iterator over the contents of the database.
+  // The result of NewIterator() is initially invalid (caller must
+  // call one of the Seek methods on the iterator before using it).
+  //
+  // Caller should delete the iterator when it is no longer needed.
+  // The returned iterator should be deleted before this db is deleted.
+  virtual Iterator* NewIterator(const ReadOptions& options) = 0;
+
+  // Return a handle to the current DB state.  Iterators created with
+  // this handle will all observe a stable snapshot of the current DB
+  // state.  The caller must call ReleaseSnapshot(result) when the
+  // snapshot is no longer needed.
+  virtual const Snapshot* GetSnapshot() = 0;
+
+  // Release a previously acquired snapshot.  The caller must not
+  // use "snapshot" after this call.
+  virtual void ReleaseSnapshot(const Snapshot* snapshot) = 0;
+
+  // DB implementations can export properties about their state
+  // via this method.  If "property" is a valid property understood by this
+  // DB implementation, fills "*value" with its current value and returns
+  // true.  Otherwise returns false.
+  //
+  //
+  // Valid property names include:
+  //
+  //  "leveldb.num-files-at-level<N>" - return the number of files at level <N>,
+  //     where <N> is an ASCII representation of a level number (e.g. "0").
+  //  "leveldb.stats" - returns a multi-line string that describes statistics
+  //     about the internal operation of the DB.
+  //  "leveldb.sstables" - returns a multi-line string that describes all
+  //     of the sstables that make up the db contents.
+  //  "leveldb.approximate-memory-usage" - returns the approximate number of
+  //     bytes of memory in use by the DB.
+  virtual bool GetProperty(const Slice& property, std::string* value) = 0;
+
+  // For each i in [0,n-1], store in "sizes[i]", the approximate
+  // file system space used by keys in "[range[i].start .. range[i].limit)".
+  //
+  // Note that the returned sizes measure file system space usage, so
+  // if the user data compresses by a factor of ten, the returned
+  // sizes will be one-tenth the size of the corresponding user data size.
+  //
+  // The results may not include the sizes of recently written data.
+  virtual void GetApproximateSizes(const Range* range, int n,
+                                   uint64_t* sizes) = 0;
+
+  // Compact the underlying storage for the key range [*begin,*end].
+  // In particular, deleted and overwritten versions are discarded,
+  // and the data is rearranged to reduce the cost of operations
+  // needed to access the data.  This operation should typically only
+  // be invoked by users who understand the underlying implementation.
+  //
+  // begin==NULL is treated as a key before all keys in the database.
+  // end==NULL is treated as a key after all keys in the database.
+  // Therefore the following call will compact the entire database:
+  //    db->CompactRange(NULL, NULL);
+  virtual void CompactRange(const Slice* begin, const Slice* end) = 0;
+
+ private:
+  // No copying allowed
+  DB(const DB&);
+  void operator=(const DB&);
+};
+
+// Destroy the contents of the specified database.
+// Be very careful using this method.
+Status DestroyDB(const std::string& name, const Options& options);
+
+// If a DB cannot be opened, you may attempt to call this method to
+// resurrect as much of the contents of the database as possible.
+// Some data may be lost, so be careful when calling this function
+// on a database that contains important information.
+Status RepairDB(const std::string& dbname, const Options& options);
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_INCLUDE_DB_H_
diff --git a/depend/zcash/src/leveldb/include/leveldb/dumpfile.h b/depend/zcash/src/leveldb/include/leveldb/dumpfile.h
new file mode 100644
index 000000000..3f97fda16
--- /dev/null
+++ b/depend/zcash/src/leveldb/include/leveldb/dumpfile.h
@@ -0,0 +1,25 @@
+// Copyright (c) 2014 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_INCLUDE_DUMPFILE_H_
+#define STORAGE_LEVELDB_INCLUDE_DUMPFILE_H_
+
+#include <string>
+#include "leveldb/env.h"
+#include "leveldb/status.h"
+
+namespace leveldb {
+
+// Dump the contents of the file named by fname in text format to
+// *dst.  Makes a sequence of dst->Append() calls; each call is passed
+// the newline-terminated text corresponding to a single item found
+// in the file.
+//
+// Returns a non-OK result if fname does not name a leveldb storage
+// file, or if the file cannot be read.
+Status DumpFile(Env* env, const std::string& fname, WritableFile* dst);
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_INCLUDE_DUMPFILE_H_
diff --git a/depend/zcash/src/leveldb/include/leveldb/env.h b/depend/zcash/src/leveldb/include/leveldb/env.h
new file mode 100644
index 000000000..275d441ea
--- /dev/null
+++ b/depend/zcash/src/leveldb/include/leveldb/env.h
@@ -0,0 +1,360 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// An Env is an interface used by the leveldb implementation to access
+// operating system functionality like the filesystem etc.  Callers
+// may wish to provide a custom Env object when opening a database to
+// get fine gain control; e.g., to rate limit file system operations.
+//
+// All Env implementations are safe for concurrent access from
+// multiple threads without any external synchronization.
+
+#ifndef STORAGE_LEVELDB_INCLUDE_ENV_H_
+#define STORAGE_LEVELDB_INCLUDE_ENV_H_
+
+#include <string>
+#include <vector>
+#include <stdarg.h>
+#include <stdint.h>
+#include "leveldb/status.h"
+
+namespace leveldb {
+
+class FileLock;
+class Logger;
+class RandomAccessFile;
+class SequentialFile;
+class Slice;
+class WritableFile;
+
+class Env {
+ public:
+  Env() { }
+  virtual ~Env();
+
+  // Return a default environment suitable for the current operating
+  // system.  Sophisticated users may wish to provide their own Env
+  // implementation instead of relying on this default environment.
+  //
+  // The result of Default() belongs to leveldb and must never be deleted.
+  static Env* Default();
+
+  // Create a brand new sequentially-readable file with the specified name.
+  // On success, stores a pointer to the new file in *result and returns OK.
+  // On failure stores NULL in *result and returns non-OK.  If the file does
+  // not exist, returns a non-OK status.
+  //
+  // The returned file will only be accessed by one thread at a time.
+  virtual Status NewSequentialFile(const std::string& fname,
+                                   SequentialFile** result) = 0;
+
+  // Create a brand new random access read-only file with the
+  // specified name.  On success, stores a pointer to the new file in
+  // *result and returns OK.  On failure stores NULL in *result and
+  // returns non-OK.  If the file does not exist, returns a non-OK
+  // status.
+  //
+  // The returned file may be concurrently accessed by multiple threads.
+  virtual Status NewRandomAccessFile(const std::string& fname,
+                                     RandomAccessFile** result) = 0;
+
+  // Create an object that writes to a new file with the specified
+  // name.  Deletes any existing file with the same name and creates a
+  // new file.  On success, stores a pointer to the new file in
+  // *result and returns OK.  On failure stores NULL in *result and
+  // returns non-OK.
+  //
+  // The returned file will only be accessed by one thread at a time.
+  virtual Status NewWritableFile(const std::string& fname,
+                                 WritableFile** result) = 0;
+
+  // Create an object that either appends to an existing file, or
+  // writes to a new file (if the file does not exist to begin with).
+  // On success, stores a pointer to the new file in *result and
+  // returns OK.  On failure stores NULL in *result and returns
+  // non-OK.
+  //
+  // The returned file will only be accessed by one thread at a time.
+  //
+  // May return an IsNotSupportedError error if this Env does
+  // not allow appending to an existing file.  Users of Env (including
+  // the leveldb implementation) must be prepared to deal with
+  // an Env that does not support appending.
+  virtual Status NewAppendableFile(const std::string& fname,
+                                   WritableFile** result);
+
+  // Returns true iff the named file exists.
+  virtual bool FileExists(const std::string& fname) = 0;
+
+  // Store in *result the names of the children of the specified directory.
+  // The names are relative to "dir".
+  // Original contents of *results are dropped.
+  virtual Status GetChildren(const std::string& dir,
+                             std::vector<std::string>* result) = 0;
+
+  // Delete the named file.
+  virtual Status DeleteFile(const std::string& fname) = 0;
+
+  // Create the specified directory.
+  virtual Status CreateDir(const std::string& dirname) = 0;
+
+  // Delete the specified directory.
+  virtual Status DeleteDir(const std::string& dirname) = 0;
+
+  // Store the size of fname in *file_size.
+  virtual Status GetFileSize(const std::string& fname, uint64_t* file_size) = 0;
+
+  // Rename file src to target.
+  virtual Status RenameFile(const std::string& src,
+                            const std::string& target) = 0;
+
+  // Lock the specified file.  Used to prevent concurrent access to
+  // the same db by multiple processes.  On failure, stores NULL in
+  // *lock and returns non-OK.
+  //
+  // On success, stores a pointer to the object that represents the
+  // acquired lock in *lock and returns OK.  The caller should call
+  // UnlockFile(*lock) to release the lock.  If the process exits,
+  // the lock will be automatically released.
+  //
+  // If somebody else already holds the lock, finishes immediately
+  // with a failure.  I.e., this call does not wait for existing locks
+  // to go away.
+  //
+  // May create the named file if it does not already exist.
+  virtual Status LockFile(const std::string& fname, FileLock** lock) = 0;
+
+  // Release the lock acquired by a previous successful call to LockFile.
+  // REQUIRES: lock was returned by a successful LockFile() call
+  // REQUIRES: lock has not already been unlocked.
+  virtual Status UnlockFile(FileLock* lock) = 0;
+
+  // Arrange to run "(*function)(arg)" once in a background thread.
+  //
+  // "function" may run in an unspecified thread.  Multiple functions
+  // added to the same Env may run concurrently in different threads.
+  // I.e., the caller may not assume that background work items are
+  // serialized.
+  virtual void Schedule(
+      void (*function)(void* arg),
+      void* arg) = 0;
+
+  // Start a new thread, invoking "function(arg)" within the new thread.
+  // When "function(arg)" returns, the thread will be destroyed.
+  virtual void StartThread(void (*function)(void* arg), void* arg) = 0;
+
+  // *path is set to a temporary directory that can be used for testing. It may
+  // or many not have just been created. The directory may or may not differ
+  // between runs of the same process, but subsequent calls will return the
+  // same directory.
+  virtual Status GetTestDirectory(std::string* path) = 0;
+
+  // Create and return a log file for storing informational messages.
+  virtual Status NewLogger(const std::string& fname, Logger** result) = 0;
+
+  // Returns the number of micro-seconds since some fixed point in time. Only
+  // useful for computing deltas of time.
+  virtual uint64_t NowMicros() = 0;
+
+  // Sleep/delay the thread for the prescribed number of micro-seconds.
+  virtual void SleepForMicroseconds(int micros) = 0;
+
+ private:
+  // No copying allowed
+  Env(const Env&);
+  void operator=(const Env&);
+};
+
+// A file abstraction for reading sequentially through a file
+class SequentialFile {
+ public:
+  SequentialFile() { }
+  virtual ~SequentialFile();
+
+  // Read up to "n" bytes from the file.  "scratch[0..n-1]" may be
+  // written by this routine.  Sets "*result" to the data that was
+  // read (including if fewer than "n" bytes were successfully read).
+  // May set "*result" to point at data in "scratch[0..n-1]", so
+  // "scratch[0..n-1]" must be live when "*result" is used.
+  // If an error was encountered, returns a non-OK status.
+  //
+  // REQUIRES: External synchronization
+  virtual Status Read(size_t n, Slice* result, char* scratch) = 0;
+
+  // Skip "n" bytes from the file. This is guaranteed to be no
+  // slower that reading the same data, but may be faster.
+  //
+  // If end of file is reached, skipping will stop at the end of the
+  // file, and Skip will return OK.
+  //
+  // REQUIRES: External synchronization
+  virtual Status Skip(uint64_t n) = 0;
+
+  // Get a name for the file, only for error reporting
+  virtual std::string GetName() const = 0;
+
+ private:
+  // No copying allowed
+  SequentialFile(const SequentialFile&);
+  void operator=(const SequentialFile&);
+};
+
+// A file abstraction for randomly reading the contents of a file.
+class RandomAccessFile {
+ public:
+  RandomAccessFile() { }
+  virtual ~RandomAccessFile();
+
+  // Read up to "n" bytes from the file starting at "offset".
+  // "scratch[0..n-1]" may be written by this routine.  Sets "*result"
+  // to the data that was read (including if fewer than "n" bytes were
+  // successfully read).  May set "*result" to point at data in
+  // "scratch[0..n-1]", so "scratch[0..n-1]" must be live when
+  // "*result" is used.  If an error was encountered, returns a non-OK
+  // status.
+  //
+  // Safe for concurrent use by multiple threads.
+  virtual Status Read(uint64_t offset, size_t n, Slice* result,
+                      char* scratch) const = 0;
+
+  // Get a name for the file, only for error reporting
+  virtual std::string GetName() const = 0;
+
+ private:
+  // No copying allowed
+  RandomAccessFile(const RandomAccessFile&);
+  void operator=(const RandomAccessFile&);
+};
+
+// A file abstraction for sequential writing.  The implementation
+// must provide buffering since callers may append small fragments
+// at a time to the file.
+class WritableFile {
+ public:
+  WritableFile() { }
+  virtual ~WritableFile();
+
+  virtual Status Append(const Slice& data) = 0;
+  virtual Status Close() = 0;
+  virtual Status Flush() = 0;
+  virtual Status Sync() = 0;
+
+  // Get a name for the file, only for error reporting
+  virtual std::string GetName() const = 0;
+
+ private:
+  // No copying allowed
+  WritableFile(const WritableFile&);
+  void operator=(const WritableFile&);
+};
+
+// An interface for writing log messages.
+class Logger {
+ public:
+  Logger() { }
+  virtual ~Logger();
+
+  // Write an entry to the log file with the specified format.
+  virtual void Logv(const char* format, va_list ap) = 0;
+
+ private:
+  // No copying allowed
+  Logger(const Logger&);
+  void operator=(const Logger&);
+};
+
+
+// Identifies a locked file.
+class FileLock {
+ public:
+  FileLock() { }
+  virtual ~FileLock();
+ private:
+  // No copying allowed
+  FileLock(const FileLock&);
+  void operator=(const FileLock&);
+};
+
+// Log the specified data to *info_log if info_log is non-NULL.
+extern void Log(Logger* info_log, const char* format, ...)
+#   if defined(__GNUC__) || defined(__clang__)
+    __attribute__((__format__ (__printf__, 2, 3)))
+#   endif
+    ;
+
+// A utility routine: write "data" to the named file.
+extern Status WriteStringToFile(Env* env, const Slice& data,
+                                const std::string& fname);
+
+// A utility routine: read contents of named file into *data
+extern Status ReadFileToString(Env* env, const std::string& fname,
+                               std::string* data);
+
+// An implementation of Env that forwards all calls to another Env.
+// May be useful to clients who wish to override just part of the
+// functionality of another Env.
+class EnvWrapper : public Env {
+ public:
+  // Initialize an EnvWrapper that delegates all calls to *t
+  explicit EnvWrapper(Env* t) : target_(t) { }
+  virtual ~EnvWrapper();
+
+  // Return the target to which this Env forwards all calls
+  Env* target() const { return target_; }
+
+  // The following text is boilerplate that forwards all methods to target()
+  Status NewSequentialFile(const std::string& f, SequentialFile** r) {
+    return target_->NewSequentialFile(f, r);
+  }
+  Status NewRandomAccessFile(const std::string& f, RandomAccessFile** r) {
+    return target_->NewRandomAccessFile(f, r);
+  }
+  Status NewWritableFile(const std::string& f, WritableFile** r) {
+    return target_->NewWritableFile(f, r);
+  }
+  Status NewAppendableFile(const std::string& f, WritableFile** r) {
+    return target_->NewAppendableFile(f, r);
+  }
+  bool FileExists(const std::string& f) { return target_->FileExists(f); }
+  Status GetChildren(const std::string& dir, std::vector<std::string>* r) {
+    return target_->GetChildren(dir, r);
+  }
+  Status DeleteFile(const std::string& f) { return target_->DeleteFile(f); }
+  Status CreateDir(const std::string& d) { return target_->CreateDir(d); }
+  Status DeleteDir(const std::string& d) { return target_->DeleteDir(d); }
+  Status GetFileSize(const std::string& f, uint64_t* s) {
+    return target_->GetFileSize(f, s);
+  }
+  Status RenameFile(const std::string& s, const std::string& t) {
+    return target_->RenameFile(s, t);
+  }
+  Status LockFile(const std::string& f, FileLock** l) {
+    return target_->LockFile(f, l);
+  }
+  Status UnlockFile(FileLock* l) { return target_->UnlockFile(l); }
+  void Schedule(void (*f)(void*), void* a) {
+    return target_->Schedule(f, a);
+  }
+  void StartThread(void (*f)(void*), void* a) {
+    return target_->StartThread(f, a);
+  }
+  virtual Status GetTestDirectory(std::string* path) {
+    return target_->GetTestDirectory(path);
+  }
+  virtual Status NewLogger(const std::string& fname, Logger** result) {
+    return target_->NewLogger(fname, result);
+  }
+  uint64_t NowMicros() {
+    return target_->NowMicros();
+  }
+  void SleepForMicroseconds(int micros) {
+    target_->SleepForMicroseconds(micros);
+  }
+ private:
+  Env* target_;
+};
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_INCLUDE_ENV_H_
diff --git a/depend/zcash/src/leveldb/include/leveldb/filter_policy.h b/depend/zcash/src/leveldb/include/leveldb/filter_policy.h
new file mode 100644
index 000000000..1fba08001
--- /dev/null
+++ b/depend/zcash/src/leveldb/include/leveldb/filter_policy.h
@@ -0,0 +1,70 @@
+// Copyright (c) 2012 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// A database can be configured with a custom FilterPolicy object.
+// This object is responsible for creating a small filter from a set
+// of keys.  These filters are stored in leveldb and are consulted
+// automatically by leveldb to decide whether or not to read some
+// information from disk. In many cases, a filter can cut down the
+// number of disk seeks form a handful to a single disk seek per
+// DB::Get() call.
+//
+// Most people will want to use the builtin bloom filter support (see
+// NewBloomFilterPolicy() below).
+
+#ifndef STORAGE_LEVELDB_INCLUDE_FILTER_POLICY_H_
+#define STORAGE_LEVELDB_INCLUDE_FILTER_POLICY_H_
+
+#include <string>
+
+namespace leveldb {
+
+class Slice;
+
+class FilterPolicy {
+ public:
+  virtual ~FilterPolicy();
+
+  // Return the name of this policy.  Note that if the filter encoding
+  // changes in an incompatible way, the name returned by this method
+  // must be changed.  Otherwise, old incompatible filters may be
+  // passed to methods of this type.
+  virtual const char* Name() const = 0;
+
+  // keys[0,n-1] contains a list of keys (potentially with duplicates)
+  // that are ordered according to the user supplied comparator.
+  // Append a filter that summarizes keys[0,n-1] to *dst.
+  //
+  // Warning: do not change the initial contents of *dst.  Instead,
+  // append the newly constructed filter to *dst.
+  virtual void CreateFilter(const Slice* keys, int n, std::string* dst)
+      const = 0;
+
+  // "filter" contains the data appended by a preceding call to
+  // CreateFilter() on this class.  This method must return true if
+  // the key was in the list of keys passed to CreateFilter().
+  // This method may return true or false if the key was not on the
+  // list, but it should aim to return false with a high probability.
+  virtual bool KeyMayMatch(const Slice& key, const Slice& filter) const = 0;
+};
+
+// Return a new filter policy that uses a bloom filter with approximately
+// the specified number of bits per key.  A good value for bits_per_key
+// is 10, which yields a filter with ~ 1% false positive rate.
+//
+// Callers must delete the result after any database that is using the
+// result has been closed.
+//
+// Note: if you are using a custom comparator that ignores some parts
+// of the keys being compared, you must not use NewBloomFilterPolicy()
+// and must provide your own FilterPolicy that also ignores the
+// corresponding parts of the keys.  For example, if the comparator
+// ignores trailing spaces, it would be incorrect to use a
+// FilterPolicy (like NewBloomFilterPolicy) that does not ignore
+// trailing spaces in keys.
+extern const FilterPolicy* NewBloomFilterPolicy(int bits_per_key);
+
+}
+
+#endif  // STORAGE_LEVELDB_INCLUDE_FILTER_POLICY_H_
diff --git a/depend/zcash/src/leveldb/include/leveldb/iterator.h b/depend/zcash/src/leveldb/include/leveldb/iterator.h
new file mode 100644
index 000000000..da631ed9d
--- /dev/null
+++ b/depend/zcash/src/leveldb/include/leveldb/iterator.h
@@ -0,0 +1,100 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// An iterator yields a sequence of key/value pairs from a source.
+// The following class defines the interface.  Multiple implementations
+// are provided by this library.  In particular, iterators are provided
+// to access the contents of a Table or a DB.
+//
+// Multiple threads can invoke const methods on an Iterator without
+// external synchronization, but if any of the threads may call a
+// non-const method, all threads accessing the same Iterator must use
+// external synchronization.
+
+#ifndef STORAGE_LEVELDB_INCLUDE_ITERATOR_H_
+#define STORAGE_LEVELDB_INCLUDE_ITERATOR_H_
+
+#include "leveldb/slice.h"
+#include "leveldb/status.h"
+
+namespace leveldb {
+
+class Iterator {
+ public:
+  Iterator();
+  virtual ~Iterator();
+
+  // An iterator is either positioned at a key/value pair, or
+  // not valid.  This method returns true iff the iterator is valid.
+  virtual bool Valid() const = 0;
+
+  // Position at the first key in the source.  The iterator is Valid()
+  // after this call iff the source is not empty.
+  virtual void SeekToFirst() = 0;
+
+  // Position at the last key in the source.  The iterator is
+  // Valid() after this call iff the source is not empty.
+  virtual void SeekToLast() = 0;
+
+  // Position at the first key in the source that is at or past target.
+  // The iterator is Valid() after this call iff the source contains
+  // an entry that comes at or past target.
+  virtual void Seek(const Slice& target) = 0;
+
+  // Moves to the next entry in the source.  After this call, Valid() is
+  // true iff the iterator was not positioned at the last entry in the source.
+  // REQUIRES: Valid()
+  virtual void Next() = 0;
+
+  // Moves to the previous entry in the source.  After this call, Valid() is
+  // true iff the iterator was not positioned at the first entry in source.
+  // REQUIRES: Valid()
+  virtual void Prev() = 0;
+
+  // Return the key for the current entry.  The underlying storage for
+  // the returned slice is valid only until the next modification of
+  // the iterator.
+  // REQUIRES: Valid()
+  virtual Slice key() const = 0;
+
+  // Return the value for the current entry.  The underlying storage for
+  // the returned slice is valid only until the next modification of
+  // the iterator.
+  // REQUIRES: Valid()
+  virtual Slice value() const = 0;
+
+  // If an error has occurred, return it.  Else return an ok status.
+  virtual Status status() const = 0;
+
+  // Clients are allowed to register function/arg1/arg2 triples that
+  // will be invoked when this iterator is destroyed.
+  //
+  // Note that unlike all of the preceding methods, this method is
+  // not abstract and therefore clients should not override it.
+  typedef void (*CleanupFunction)(void* arg1, void* arg2);
+  void RegisterCleanup(CleanupFunction function, void* arg1, void* arg2);
+
+ private:
+  struct Cleanup {
+    CleanupFunction function;
+    void* arg1;
+    void* arg2;
+    Cleanup* next;
+  };
+  Cleanup cleanup_;
+
+  // No copying allowed
+  Iterator(const Iterator&);
+  void operator=(const Iterator&);
+};
+
+// Return an empty iterator (yields nothing).
+extern Iterator* NewEmptyIterator();
+
+// Return an empty iterator with the specified status.
+extern Iterator* NewErrorIterator(const Status& status);
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_INCLUDE_ITERATOR_H_
diff --git a/depend/zcash/src/leveldb/include/leveldb/options.h b/depend/zcash/src/leveldb/include/leveldb/options.h
new file mode 100644
index 000000000..976e38122
--- /dev/null
+++ b/depend/zcash/src/leveldb/include/leveldb/options.h
@@ -0,0 +1,213 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_INCLUDE_OPTIONS_H_
+#define STORAGE_LEVELDB_INCLUDE_OPTIONS_H_
+
+#include <stddef.h>
+
+namespace leveldb {
+
+class Cache;
+class Comparator;
+class Env;
+class FilterPolicy;
+class Logger;
+class Snapshot;
+
+// DB contents are stored in a set of blocks, each of which holds a
+// sequence of key,value pairs.  Each block may be compressed before
+// being stored in a file.  The following enum describes which
+// compression method (if any) is used to compress a block.
+enum CompressionType {
+  // NOTE: do not change the values of existing entries, as these are
+  // part of the persistent format on disk.
+  kNoCompression     = 0x0,
+  kSnappyCompression = 0x1
+};
+
+// Options to control the behavior of a database (passed to DB::Open)
+struct Options {
+  // -------------------
+  // Parameters that affect behavior
+
+  // Comparator used to define the order of keys in the table.
+  // Default: a comparator that uses lexicographic byte-wise ordering
+  //
+  // REQUIRES: The client must ensure that the comparator supplied
+  // here has the same name and orders keys *exactly* the same as the
+  // comparator provided to previous open calls on the same DB.
+  const Comparator* comparator;
+
+  // If true, the database will be created if it is missing.
+  // Default: false
+  bool create_if_missing;
+
+  // If true, an error is raised if the database already exists.
+  // Default: false
+  bool error_if_exists;
+
+  // If true, the implementation will do aggressive checking of the
+  // data it is processing and will stop early if it detects any
+  // errors.  This may have unforeseen ramifications: for example, a
+  // corruption of one DB entry may cause a large number of entries to
+  // become unreadable or for the entire DB to become unopenable.
+  // Default: false
+  bool paranoid_checks;
+
+  // Use the specified object to interact with the environment,
+  // e.g. to read/write files, schedule background work, etc.
+  // Default: Env::Default()
+  Env* env;
+
+  // Any internal progress/error information generated by the db will
+  // be written to info_log if it is non-NULL, or to a file stored
+  // in the same directory as the DB contents if info_log is NULL.
+  // Default: NULL
+  Logger* info_log;
+
+  // -------------------
+  // Parameters that affect performance
+
+  // Amount of data to build up in memory (backed by an unsorted log
+  // on disk) before converting to a sorted on-disk file.
+  //
+  // Larger values increase performance, especially during bulk loads.
+  // Up to two write buffers may be held in memory at the same time,
+  // so you may wish to adjust this parameter to control memory usage.
+  // Also, a larger write buffer will result in a longer recovery time
+  // the next time the database is opened.
+  //
+  // Default: 4MB
+  size_t write_buffer_size;
+
+  // Number of open files that can be used by the DB.  You may need to
+  // increase this if your database has a large working set (budget
+  // one open file per 2MB of working set).
+  //
+  // Default: 1000
+  int max_open_files;
+
+  // Control over blocks (user data is stored in a set of blocks, and
+  // a block is the unit of reading from disk).
+
+  // If non-NULL, use the specified cache for blocks.
+  // If NULL, leveldb will automatically create and use an 8MB internal cache.
+  // Default: NULL
+  Cache* block_cache;
+
+  // Approximate size of user data packed per block.  Note that the
+  // block size specified here corresponds to uncompressed data.  The
+  // actual size of the unit read from disk may be smaller if
+  // compression is enabled.  This parameter can be changed dynamically.
+  //
+  // Default: 4K
+  size_t block_size;
+
+  // Number of keys between restart points for delta encoding of keys.
+  // This parameter can be changed dynamically.  Most clients should
+  // leave this parameter alone.
+  //
+  // Default: 16
+  int block_restart_interval;
+
+  // Leveldb will write up to this amount of bytes to a file before
+  // switching to a new one.
+  // Most clients should leave this parameter alone.  However if your
+  // filesystem is more efficient with larger files, you could
+  // consider increasing the value.  The downside will be longer
+  // compactions and hence longer latency/performance hiccups.
+  // Another reason to increase this parameter might be when you are
+  // initially populating a large database.
+  //
+  // Default: 2MB
+  size_t max_file_size;
+
+  // Compress blocks using the specified compression algorithm.  This
+  // parameter can be changed dynamically.
+  //
+  // Default: kSnappyCompression, which gives lightweight but fast
+  // compression.
+  //
+  // Typical speeds of kSnappyCompression on an Intel(R) Core(TM)2 2.4GHz:
+  //    ~200-500MB/s compression
+  //    ~400-800MB/s decompression
+  // Note that these speeds are significantly faster than most
+  // persistent storage speeds, and therefore it is typically never
+  // worth switching to kNoCompression.  Even if the input data is
+  // incompressible, the kSnappyCompression implementation will
+  // efficiently detect that and will switch to uncompressed mode.
+  CompressionType compression;
+
+  // EXPERIMENTAL: If true, append to existing MANIFEST and log files
+  // when a database is opened.  This can significantly speed up open.
+  //
+  // Default: currently false, but may become true later.
+  bool reuse_logs;
+
+  // If non-NULL, use the specified filter policy to reduce disk reads.
+  // Many applications will benefit from passing the result of
+  // NewBloomFilterPolicy() here.
+  //
+  // Default: NULL
+  const FilterPolicy* filter_policy;
+
+  // Create an Options object with default values for all fields.
+  Options();
+};
+
+// Options that control read operations
+struct ReadOptions {
+  // If true, all data read from underlying storage will be
+  // verified against corresponding checksums.
+  // Default: false
+  bool verify_checksums;
+
+  // Should the data read for this iteration be cached in memory?
+  // Callers may wish to set this field to false for bulk scans.
+  // Default: true
+  bool fill_cache;
+
+  // If "snapshot" is non-NULL, read as of the supplied snapshot
+  // (which must belong to the DB that is being read and which must
+  // not have been released).  If "snapshot" is NULL, use an implicit
+  // snapshot of the state at the beginning of this read operation.
+  // Default: NULL
+  const Snapshot* snapshot;
+
+  ReadOptions()
+      : verify_checksums(false),
+        fill_cache(true),
+        snapshot(NULL) {
+  }
+};
+
+// Options that control write operations
+struct WriteOptions {
+  // If true, the write will be flushed from the operating system
+  // buffer cache (by calling WritableFile::Sync()) before the write
+  // is considered complete.  If this flag is true, writes will be
+  // slower.
+  //
+  // If this flag is false, and the machine crashes, some recent
+  // writes may be lost.  Note that if it is just the process that
+  // crashes (i.e., the machine does not reboot), no writes will be
+  // lost even if sync==false.
+  //
+  // In other words, a DB write with sync==false has similar
+  // crash semantics as the "write()" system call.  A DB write
+  // with sync==true has similar crash semantics to a "write()"
+  // system call followed by "fsync()".
+  //
+  // Default: false
+  bool sync;
+
+  WriteOptions()
+      : sync(false) {
+  }
+};
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_INCLUDE_OPTIONS_H_
diff --git a/depend/zcash/src/leveldb/include/leveldb/slice.h b/depend/zcash/src/leveldb/include/leveldb/slice.h
new file mode 100644
index 000000000..bc367986f
--- /dev/null
+++ b/depend/zcash/src/leveldb/include/leveldb/slice.h
@@ -0,0 +1,109 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// Slice is a simple structure containing a pointer into some external
+// storage and a size.  The user of a Slice must ensure that the slice
+// is not used after the corresponding external storage has been
+// deallocated.
+//
+// Multiple threads can invoke const methods on a Slice without
+// external synchronization, but if any of the threads may call a
+// non-const method, all threads accessing the same Slice must use
+// external synchronization.
+
+#ifndef STORAGE_LEVELDB_INCLUDE_SLICE_H_
+#define STORAGE_LEVELDB_INCLUDE_SLICE_H_
+
+#include <assert.h>
+#include <stddef.h>
+#include <string.h>
+#include <string>
+
+namespace leveldb {
+
+class Slice {
+ public:
+  // Create an empty slice.
+  Slice() : data_(""), size_(0) { }
+
+  // Create a slice that refers to d[0,n-1].
+  Slice(const char* d, size_t n) : data_(d), size_(n) { }
+
+  // Create a slice that refers to the contents of "s"
+  Slice(const std::string& s) : data_(s.data()), size_(s.size()) { }
+
+  // Create a slice that refers to s[0,strlen(s)-1]
+  Slice(const char* s) : data_(s), size_(strlen(s)) { }
+
+  // Return a pointer to the beginning of the referenced data
+  const char* data() const { return data_; }
+
+  // Return the length (in bytes) of the referenced data
+  size_t size() const { return size_; }
+
+  // Return true iff the length of the referenced data is zero
+  bool empty() const { return size_ == 0; }
+
+  // Return the ith byte in the referenced data.
+  // REQUIRES: n < size()
+  char operator[](size_t n) const {
+    assert(n < size());
+    return data_[n];
+  }
+
+  // Change this slice to refer to an empty array
+  void clear() { data_ = ""; size_ = 0; }
+
+  // Drop the first "n" bytes from this slice.
+  void remove_prefix(size_t n) {
+    assert(n <= size());
+    data_ += n;
+    size_ -= n;
+  }
+
+  // Return a string that contains the copy of the referenced data.
+  std::string ToString() const { return std::string(data_, size_); }
+
+  // Three-way comparison.  Returns value:
+  //   <  0 iff "*this" <  "b",
+  //   == 0 iff "*this" == "b",
+  //   >  0 iff "*this" >  "b"
+  int compare(const Slice& b) const;
+
+  // Return true iff "x" is a prefix of "*this"
+  bool starts_with(const Slice& x) const {
+    return ((size_ >= x.size_) &&
+            (memcmp(data_, x.data_, x.size_) == 0));
+  }
+
+ private:
+  const char* data_;
+  size_t size_;
+
+  // Intentionally copyable
+};
+
+inline bool operator==(const Slice& x, const Slice& y) {
+  return ((x.size() == y.size()) &&
+          (memcmp(x.data(), y.data(), x.size()) == 0));
+}
+
+inline bool operator!=(const Slice& x, const Slice& y) {
+  return !(x == y);
+}
+
+inline int Slice::compare(const Slice& b) const {
+  const size_t min_len = (size_ < b.size_) ? size_ : b.size_;
+  int r = memcmp(data_, b.data_, min_len);
+  if (r == 0) {
+    if (size_ < b.size_) r = -1;
+    else if (size_ > b.size_) r = +1;
+  }
+  return r;
+}
+
+}  // namespace leveldb
+
+
+#endif  // STORAGE_LEVELDB_INCLUDE_SLICE_H_
diff --git a/depend/zcash/src/leveldb/include/leveldb/status.h b/depend/zcash/src/leveldb/include/leveldb/status.h
new file mode 100644
index 000000000..d9575f975
--- /dev/null
+++ b/depend/zcash/src/leveldb/include/leveldb/status.h
@@ -0,0 +1,112 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// A Status encapsulates the result of an operation.  It may indicate success,
+// or it may indicate an error with an associated error message.
+//
+// Multiple threads can invoke const methods on a Status without
+// external synchronization, but if any of the threads may call a
+// non-const method, all threads accessing the same Status must use
+// external synchronization.
+
+#ifndef STORAGE_LEVELDB_INCLUDE_STATUS_H_
+#define STORAGE_LEVELDB_INCLUDE_STATUS_H_
+
+#include <string>
+#include "leveldb/slice.h"
+
+namespace leveldb {
+
+class Status {
+ public:
+  // Create a success status.
+  Status() : state_(NULL) { }
+  ~Status() { delete[] state_; }
+
+  // Copy the specified status.
+  Status(const Status& s);
+  void operator=(const Status& s);
+
+  // Return a success status.
+  static Status OK() { return Status(); }
+
+  // Return error status of an appropriate type.
+  static Status NotFound(const Slice& msg, const Slice& msg2 = Slice()) {
+    return Status(kNotFound, msg, msg2);
+  }
+  static Status Corruption(const Slice& msg, const Slice& msg2 = Slice()) {
+    return Status(kCorruption, msg, msg2);
+  }
+  static Status NotSupported(const Slice& msg, const Slice& msg2 = Slice()) {
+    return Status(kNotSupported, msg, msg2);
+  }
+  static Status InvalidArgument(const Slice& msg, const Slice& msg2 = Slice()) {
+    return Status(kInvalidArgument, msg, msg2);
+  }
+  static Status IOError(const Slice& msg, const Slice& msg2 = Slice()) {
+    return Status(kIOError, msg, msg2);
+  }
+
+  // Returns true iff the status indicates success.
+  bool ok() const { return (state_ == NULL); }
+
+  // Returns true iff the status indicates a NotFound error.
+  bool IsNotFound() const { return code() == kNotFound; }
+
+  // Returns true iff the status indicates a Corruption error.
+  bool IsCorruption() const { return code() == kCorruption; }
+
+  // Returns true iff the status indicates an IOError.
+  bool IsIOError() const { return code() == kIOError; }
+
+  // Returns true iff the status indicates a NotSupportedError.
+  bool IsNotSupportedError() const { return code() == kNotSupported; }
+
+  // Returns true iff the status indicates an InvalidArgument.
+  bool IsInvalidArgument() const { return code() == kInvalidArgument; }
+
+  // Return a string representation of this status suitable for printing.
+  // Returns the string "OK" for success.
+  std::string ToString() const;
+
+ private:
+  // OK status has a NULL state_.  Otherwise, state_ is a new[] array
+  // of the following form:
+  //    state_[0..3] == length of message
+  //    state_[4]    == code
+  //    state_[5..]  == message
+  const char* state_;
+
+  enum Code {
+    kOk = 0,
+    kNotFound = 1,
+    kCorruption = 2,
+    kNotSupported = 3,
+    kInvalidArgument = 4,
+    kIOError = 5
+  };
+
+  Code code() const {
+    return (state_ == NULL) ? kOk : static_cast<Code>(state_[4]);
+  }
+
+  Status(Code code, const Slice& msg, const Slice& msg2);
+  static const char* CopyState(const char* s);
+};
+
+inline Status::Status(const Status& s) {
+  state_ = (s.state_ == NULL) ? NULL : CopyState(s.state_);
+}
+inline void Status::operator=(const Status& s) {
+  // The following condition catches both aliasing (when this == &s),
+  // and the common case where both s and *this are ok.
+  if (state_ != s.state_) {
+    delete[] state_;
+    state_ = (s.state_ == NULL) ? NULL : CopyState(s.state_);
+  }
+}
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_INCLUDE_STATUS_H_
diff --git a/depend/zcash/src/leveldb/include/leveldb/table.h b/depend/zcash/src/leveldb/include/leveldb/table.h
new file mode 100644
index 000000000..a9746c3f5
--- /dev/null
+++ b/depend/zcash/src/leveldb/include/leveldb/table.h
@@ -0,0 +1,85 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_INCLUDE_TABLE_H_
+#define STORAGE_LEVELDB_INCLUDE_TABLE_H_
+
+#include <stdint.h>
+#include "leveldb/iterator.h"
+
+namespace leveldb {
+
+class Block;
+class BlockHandle;
+class Footer;
+struct Options;
+class RandomAccessFile;
+struct ReadOptions;
+class TableCache;
+
+// A Table is a sorted map from strings to strings.  Tables are
+// immutable and persistent.  A Table may be safely accessed from
+// multiple threads without external synchronization.
+class Table {
+ public:
+  // Attempt to open the table that is stored in bytes [0..file_size)
+  // of "file", and read the metadata entries necessary to allow
+  // retrieving data from the table.
+  //
+  // If successful, returns ok and sets "*table" to the newly opened
+  // table.  The client should delete "*table" when no longer needed.
+  // If there was an error while initializing the table, sets "*table"
+  // to NULL and returns a non-ok status.  Does not take ownership of
+  // "*source", but the client must ensure that "source" remains live
+  // for the duration of the returned table's lifetime.
+  //
+  // *file must remain live while this Table is in use.
+  static Status Open(const Options& options,
+                     RandomAccessFile* file,
+                     uint64_t file_size,
+                     Table** table);
+
+  ~Table();
+
+  // Returns a new iterator over the table contents.
+  // The result of NewIterator() is initially invalid (caller must
+  // call one of the Seek methods on the iterator before using it).
+  Iterator* NewIterator(const ReadOptions&) const;
+
+  // Given a key, return an approximate byte offset in the file where
+  // the data for that key begins (or would begin if the key were
+  // present in the file).  The returned value is in terms of file
+  // bytes, and so includes effects like compression of the underlying data.
+  // E.g., the approximate offset of the last key in the table will
+  // be close to the file length.
+  uint64_t ApproximateOffsetOf(const Slice& key) const;
+
+ private:
+  struct Rep;
+  Rep* rep_;
+
+  explicit Table(Rep* rep) { rep_ = rep; }
+  static Iterator* BlockReader(void*, const ReadOptions&, const Slice&);
+
+  // Calls (*handle_result)(arg, ...) with the entry found after a call
+  // to Seek(key).  May not make such a call if filter policy says
+  // that key is not present.
+  friend class TableCache;
+  Status InternalGet(
+      const ReadOptions&, const Slice& key,
+      void* arg,
+      void (*handle_result)(void* arg, const Slice& k, const Slice& v));
+
+
+  void ReadMeta(const Footer& footer);
+  void ReadFilter(const Slice& filter_handle_value);
+
+  // No copying allowed
+  Table(const Table&);
+  void operator=(const Table&);
+};
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_INCLUDE_TABLE_H_
diff --git a/depend/zcash/src/leveldb/include/leveldb/table_builder.h b/depend/zcash/src/leveldb/include/leveldb/table_builder.h
new file mode 100644
index 000000000..5fd1dc71f
--- /dev/null
+++ b/depend/zcash/src/leveldb/include/leveldb/table_builder.h
@@ -0,0 +1,92 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// TableBuilder provides the interface used to build a Table
+// (an immutable and sorted map from keys to values).
+//
+// Multiple threads can invoke const methods on a TableBuilder without
+// external synchronization, but if any of the threads may call a
+// non-const method, all threads accessing the same TableBuilder must use
+// external synchronization.
+
+#ifndef STORAGE_LEVELDB_INCLUDE_TABLE_BUILDER_H_
+#define STORAGE_LEVELDB_INCLUDE_TABLE_BUILDER_H_
+
+#include <stdint.h>
+#include "leveldb/options.h"
+#include "leveldb/status.h"
+
+namespace leveldb {
+
+class BlockBuilder;
+class BlockHandle;
+class WritableFile;
+
+class TableBuilder {
+ public:
+  // Create a builder that will store the contents of the table it is
+  // building in *file.  Does not close the file.  It is up to the
+  // caller to close the file after calling Finish().
+  TableBuilder(const Options& options, WritableFile* file);
+
+  // REQUIRES: Either Finish() or Abandon() has been called.
+  ~TableBuilder();
+
+  // Change the options used by this builder.  Note: only some of the
+  // option fields can be changed after construction.  If a field is
+  // not allowed to change dynamically and its value in the structure
+  // passed to the constructor is different from its value in the
+  // structure passed to this method, this method will return an error
+  // without changing any fields.
+  Status ChangeOptions(const Options& options);
+
+  // Add key,value to the table being constructed.
+  // REQUIRES: key is after any previously added key according to comparator.
+  // REQUIRES: Finish(), Abandon() have not been called
+  void Add(const Slice& key, const Slice& value);
+
+  // Advanced operation: flush any buffered key/value pairs to file.
+  // Can be used to ensure that two adjacent entries never live in
+  // the same data block.  Most clients should not need to use this method.
+  // REQUIRES: Finish(), Abandon() have not been called
+  void Flush();
+
+  // Return non-ok iff some error has been detected.
+  Status status() const;
+
+  // Finish building the table.  Stops using the file passed to the
+  // constructor after this function returns.
+  // REQUIRES: Finish(), Abandon() have not been called
+  Status Finish();
+
+  // Indicate that the contents of this builder should be abandoned.  Stops
+  // using the file passed to the constructor after this function returns.
+  // If the caller is not going to call Finish(), it must call Abandon()
+  // before destroying this builder.
+  // REQUIRES: Finish(), Abandon() have not been called
+  void Abandon();
+
+  // Number of calls to Add() so far.
+  uint64_t NumEntries() const;
+
+  // Size of the file generated so far.  If invoked after a successful
+  // Finish() call, returns the size of the final generated file.
+  uint64_t FileSize() const;
+
+ private:
+  bool ok() const { return status().ok(); }
+  void WriteBlock(BlockBuilder* block, BlockHandle* handle);
+  void WriteRawBlock(const Slice& data, CompressionType, BlockHandle* handle);
+
+  struct Rep;
+  Rep* rep_;
+
+  // No copying allowed
+  TableBuilder(const TableBuilder&);
+  void operator=(const TableBuilder&);
+};
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_INCLUDE_TABLE_BUILDER_H_
diff --git a/depend/zcash/src/leveldb/include/leveldb/write_batch.h b/depend/zcash/src/leveldb/include/leveldb/write_batch.h
new file mode 100644
index 000000000..ee9aab68e
--- /dev/null
+++ b/depend/zcash/src/leveldb/include/leveldb/write_batch.h
@@ -0,0 +1,64 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// WriteBatch holds a collection of updates to apply atomically to a DB.
+//
+// The updates are applied in the order in which they are added
+// to the WriteBatch.  For example, the value of "key" will be "v3"
+// after the following batch is written:
+//
+//    batch.Put("key", "v1");
+//    batch.Delete("key");
+//    batch.Put("key", "v2");
+//    batch.Put("key", "v3");
+//
+// Multiple threads can invoke const methods on a WriteBatch without
+// external synchronization, but if any of the threads may call a
+// non-const method, all threads accessing the same WriteBatch must use
+// external synchronization.
+
+#ifndef STORAGE_LEVELDB_INCLUDE_WRITE_BATCH_H_
+#define STORAGE_LEVELDB_INCLUDE_WRITE_BATCH_H_
+
+#include <string>
+#include "leveldb/status.h"
+
+namespace leveldb {
+
+class Slice;
+
+class WriteBatch {
+ public:
+  WriteBatch();
+  ~WriteBatch();
+
+  // Store the mapping "key->value" in the database.
+  void Put(const Slice& key, const Slice& value);
+
+  // If the database contains a mapping for "key", erase it.  Else do nothing.
+  void Delete(const Slice& key);
+
+  // Clear all updates buffered in this batch.
+  void Clear();
+
+  // Support for iterating over the contents of a batch.
+  class Handler {
+   public:
+    virtual ~Handler();
+    virtual void Put(const Slice& key, const Slice& value) = 0;
+    virtual void Delete(const Slice& key) = 0;
+  };
+  Status Iterate(Handler* handler) const;
+
+ private:
+  friend class WriteBatchInternal;
+
+  std::string rep_;  // See comment in write_batch.cc for the format of rep_
+
+  // Intentionally copyable
+};
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_INCLUDE_WRITE_BATCH_H_
diff --git a/depend/zcash/src/leveldb/issues/issue178_test.cc b/depend/zcash/src/leveldb/issues/issue178_test.cc
new file mode 100644
index 000000000..1b1cf8bb2
--- /dev/null
+++ b/depend/zcash/src/leveldb/issues/issue178_test.cc
@@ -0,0 +1,92 @@
+// Copyright (c) 2013 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+// Test for issue 178: a manual compaction causes deleted data to reappear.
+#include <iostream>
+#include <sstream>
+#include <cstdlib>
+
+#include "leveldb/db.h"
+#include "leveldb/write_batch.h"
+#include "util/testharness.h"
+
+namespace {
+
+const int kNumKeys = 1100000;
+
+std::string Key1(int i) {
+  char buf[100];
+  snprintf(buf, sizeof(buf), "my_key_%d", i);
+  return buf;
+}
+
+std::string Key2(int i) {
+  return Key1(i) + "_xxx";
+}
+
+class Issue178 { };
+
+TEST(Issue178, Test) {
+  // Get rid of any state from an old run.
+  std::string dbpath = leveldb::test::TmpDir() + "/leveldb_cbug_test";
+  DestroyDB(dbpath, leveldb::Options());
+
+  // Open database.  Disable compression since it affects the creation
+  // of layers and the code below is trying to test against a very
+  // specific scenario.
+  leveldb::DB* db;
+  leveldb::Options db_options;
+  db_options.create_if_missing = true;
+  db_options.compression = leveldb::kNoCompression;
+  ASSERT_OK(leveldb::DB::Open(db_options, dbpath, &db));
+
+  // create first key range
+  leveldb::WriteBatch batch;
+  for (size_t i = 0; i < kNumKeys; i++) {
+    batch.Put(Key1(i), "value for range 1 key");
+  }
+  ASSERT_OK(db->Write(leveldb::WriteOptions(), &batch));
+
+  // create second key range
+  batch.Clear();
+  for (size_t i = 0; i < kNumKeys; i++) {
+    batch.Put(Key2(i), "value for range 2 key");
+  }
+  ASSERT_OK(db->Write(leveldb::WriteOptions(), &batch));
+
+  // delete second key range
+  batch.Clear();
+  for (size_t i = 0; i < kNumKeys; i++) {
+    batch.Delete(Key2(i));
+  }
+  ASSERT_OK(db->Write(leveldb::WriteOptions(), &batch));
+
+  // compact database
+  std::string start_key = Key1(0);
+  std::string end_key = Key1(kNumKeys - 1);
+  leveldb::Slice least(start_key.data(), start_key.size());
+  leveldb::Slice greatest(end_key.data(), end_key.size());
+
+  // commenting out the line below causes the example to work correctly
+  db->CompactRange(&least, &greatest);
+
+  // count the keys
+  leveldb::Iterator* iter = db->NewIterator(leveldb::ReadOptions());
+  size_t num_keys = 0;
+  for (iter->SeekToFirst(); iter->Valid(); iter->Next()) {
+    num_keys++;
+  }
+  delete iter;
+  ASSERT_EQ(kNumKeys, num_keys) << "Bad number of keys";
+
+  // close database
+  delete db;
+  DestroyDB(dbpath, leveldb::Options());
+}
+
+}  // anonymous namespace
+
+int main(int argc, char** argv) {
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/issues/issue200_test.cc b/depend/zcash/src/leveldb/issues/issue200_test.cc
new file mode 100644
index 000000000..1cec79f44
--- /dev/null
+++ b/depend/zcash/src/leveldb/issues/issue200_test.cc
@@ -0,0 +1,59 @@
+// Copyright (c) 2013 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+// Test for issue 200: when iterator switches direction from backward
+// to forward, the current key can be yielded unexpectedly if a new
+// mutation has been added just before the current key.
+
+#include "leveldb/db.h"
+#include "util/testharness.h"
+
+namespace leveldb {
+
+class Issue200 { };
+
+TEST(Issue200, Test) {
+  // Get rid of any state from an old run.
+  std::string dbpath = test::TmpDir() + "/leveldb_issue200_test";
+  DestroyDB(dbpath, Options());
+
+  DB *db;
+  Options options;
+  options.create_if_missing = true;
+  ASSERT_OK(DB::Open(options, dbpath, &db));
+
+  WriteOptions write_options;
+  ASSERT_OK(db->Put(write_options, "1", "b"));
+  ASSERT_OK(db->Put(write_options, "2", "c"));
+  ASSERT_OK(db->Put(write_options, "3", "d"));
+  ASSERT_OK(db->Put(write_options, "4", "e"));
+  ASSERT_OK(db->Put(write_options, "5", "f"));
+
+  ReadOptions read_options;
+  Iterator *iter = db->NewIterator(read_options);
+
+  // Add an element that should not be reflected in the iterator.
+  ASSERT_OK(db->Put(write_options, "25", "cd"));
+
+  iter->Seek("5");
+  ASSERT_EQ(iter->key().ToString(), "5");
+  iter->Prev();
+  ASSERT_EQ(iter->key().ToString(), "4");
+  iter->Prev();
+  ASSERT_EQ(iter->key().ToString(), "3");
+  iter->Next();
+  ASSERT_EQ(iter->key().ToString(), "4");
+  iter->Next();
+  ASSERT_EQ(iter->key().ToString(), "5");
+
+  delete iter;
+  delete db;
+  DestroyDB(dbpath, options);
+}
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/port/README b/depend/zcash/src/leveldb/port/README
new file mode 100644
index 000000000..422563e25
--- /dev/null
+++ b/depend/zcash/src/leveldb/port/README
@@ -0,0 +1,10 @@
+This directory contains interfaces and implementations that isolate the
+rest of the package from platform details.
+
+Code in the rest of the package includes "port.h" from this directory.
+"port.h" in turn includes a platform specific "port_<platform>.h" file
+that provides the platform specific implementation.
+
+See port_posix.h for an example of what must be provided in a platform
+specific header file.
+
diff --git a/depend/zcash/src/leveldb/port/atomic_pointer.h b/depend/zcash/src/leveldb/port/atomic_pointer.h
new file mode 100644
index 000000000..d79a02230
--- /dev/null
+++ b/depend/zcash/src/leveldb/port/atomic_pointer.h
@@ -0,0 +1,245 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+// AtomicPointer provides storage for a lock-free pointer.
+// Platform-dependent implementation of AtomicPointer:
+// - If the platform provides a cheap barrier, we use it with raw pointers
+// - If <atomic> is present (on newer versions of gcc, it is), we use
+//   a <atomic>-based AtomicPointer.  However we prefer the memory
+//   barrier based version, because at least on a gcc 4.4 32-bit build
+//   on linux, we have encountered a buggy <atomic> implementation.
+//   Also, some <atomic> implementations are much slower than a memory-barrier
+//   based implementation (~16ns for <atomic> based acquire-load vs. ~1ns for
+//   a barrier based acquire-load).
+// This code is based on atomicops-internals-* in Google's perftools:
+// http://code.google.com/p/google-perftools/source/browse/#svn%2Ftrunk%2Fsrc%2Fbase
+
+#ifndef PORT_ATOMIC_POINTER_H_
+#define PORT_ATOMIC_POINTER_H_
+
+#include <stdint.h>
+#ifdef LEVELDB_ATOMIC_PRESENT
+#include <atomic>
+#endif
+#ifdef OS_WIN
+#include <windows.h>
+#endif
+#ifdef OS_MACOSX
+#include <libkern/OSAtomic.h>
+#endif
+
+#if defined(_M_X64) || defined(__x86_64__)
+#define ARCH_CPU_X86_FAMILY 1
+#elif defined(_M_IX86) || defined(__i386__) || defined(__i386)
+#define ARCH_CPU_X86_FAMILY 1
+#elif defined(__ARMEL__)
+#define ARCH_CPU_ARM_FAMILY 1
+#elif defined(__aarch64__)
+#define ARCH_CPU_ARM64_FAMILY 1
+#elif defined(__ppc__) || defined(__powerpc__) || defined(__powerpc64__)
+#define ARCH_CPU_PPC_FAMILY 1
+#elif defined(__mips__)
+#define ARCH_CPU_MIPS_FAMILY 1
+#endif
+
+namespace leveldb {
+namespace port {
+
+// AtomicPointer based on <cstdatomic> if available
+#if defined(LEVELDB_ATOMIC_PRESENT)
+class AtomicPointer {
+ private:
+  std::atomic<void*> rep_;
+ public:
+  AtomicPointer() { }
+  explicit AtomicPointer(void* v) : rep_(v) { }
+  inline void* Acquire_Load() const {
+    return rep_.load(std::memory_order_acquire);
+  }
+  inline void Release_Store(void* v) {
+    rep_.store(v, std::memory_order_release);
+  }
+  inline void* NoBarrier_Load() const {
+    return rep_.load(std::memory_order_relaxed);
+  }
+  inline void NoBarrier_Store(void* v) {
+    rep_.store(v, std::memory_order_relaxed);
+  }
+};
+
+#else
+
+// Define MemoryBarrier() if available
+// Windows on x86
+#if defined(OS_WIN) && defined(COMPILER_MSVC) && defined(ARCH_CPU_X86_FAMILY)
+// windows.h already provides a MemoryBarrier(void) macro
+// http://msdn.microsoft.com/en-us/library/ms684208(v=vs.85).aspx
+#define LEVELDB_HAVE_MEMORY_BARRIER
+
+// Mac OS
+#elif defined(OS_MACOSX)
+inline void MemoryBarrier() {
+  OSMemoryBarrier();
+}
+#define LEVELDB_HAVE_MEMORY_BARRIER
+
+// Gcc on x86
+#elif defined(ARCH_CPU_X86_FAMILY) && defined(__GNUC__)
+inline void MemoryBarrier() {
+  // See http://gcc.gnu.org/ml/gcc/2003-04/msg01180.html for a discussion on
+  // this idiom. Also see http://en.wikipedia.org/wiki/Memory_ordering.
+  __asm__ __volatile__("" : : : "memory");
+}
+#define LEVELDB_HAVE_MEMORY_BARRIER
+
+// Sun Studio
+#elif defined(ARCH_CPU_X86_FAMILY) && defined(__SUNPRO_CC)
+inline void MemoryBarrier() {
+  // See http://gcc.gnu.org/ml/gcc/2003-04/msg01180.html for a discussion on
+  // this idiom. Also see http://en.wikipedia.org/wiki/Memory_ordering.
+  asm volatile("" : : : "memory");
+}
+#define LEVELDB_HAVE_MEMORY_BARRIER
+
+// ARM Linux
+#elif defined(ARCH_CPU_ARM_FAMILY) && defined(__linux__)
+typedef void (*LinuxKernelMemoryBarrierFunc)(void);
+// The Linux ARM kernel provides a highly optimized device-specific memory
+// barrier function at a fixed memory address that is mapped in every
+// user-level process.
+//
+// This beats using CPU-specific instructions which are, on single-core
+// devices, un-necessary and very costly (e.g. ARMv7-A "dmb" takes more
+// than 180ns on a Cortex-A8 like the one on a Nexus One). Benchmarking
+// shows that the extra function call cost is completely negligible on
+// multi-core devices.
+//
+inline void MemoryBarrier() {
+  (*(LinuxKernelMemoryBarrierFunc)0xffff0fa0)();
+}
+#define LEVELDB_HAVE_MEMORY_BARRIER
+
+// ARM64
+#elif defined(ARCH_CPU_ARM64_FAMILY)
+inline void MemoryBarrier() {
+  asm volatile("dmb sy" : : : "memory");
+}
+#define LEVELDB_HAVE_MEMORY_BARRIER
+
+// PPC
+#elif defined(ARCH_CPU_PPC_FAMILY) && defined(__GNUC__)
+inline void MemoryBarrier() {
+  // TODO for some powerpc expert: is there a cheaper suitable variant?
+  // Perhaps by having separate barriers for acquire and release ops.
+  asm volatile("sync" : : : "memory");
+}
+#define LEVELDB_HAVE_MEMORY_BARRIER
+
+// MIPS
+#elif defined(ARCH_CPU_MIPS_FAMILY) && defined(__GNUC__)
+inline void MemoryBarrier() {
+  __asm__ __volatile__("sync" : : : "memory");
+}
+#define LEVELDB_HAVE_MEMORY_BARRIER
+
+#endif
+
+// AtomicPointer built using platform-specific MemoryBarrier()
+#if defined(LEVELDB_HAVE_MEMORY_BARRIER)
+class AtomicPointer {
+ private:
+  void* rep_;
+ public:
+  AtomicPointer() { }
+  explicit AtomicPointer(void* p) : rep_(p) {}
+  inline void* NoBarrier_Load() const { return rep_; }
+  inline void NoBarrier_Store(void* v) { rep_ = v; }
+  inline void* Acquire_Load() const {
+    void* result = rep_;
+    MemoryBarrier();
+    return result;
+  }
+  inline void Release_Store(void* v) {
+    MemoryBarrier();
+    rep_ = v;
+  }
+};
+
+// Atomic pointer based on sparc memory barriers
+#elif defined(__sparcv9) && defined(__GNUC__)
+class AtomicPointer {
+ private:
+  void* rep_;
+ public:
+  AtomicPointer() { }
+  explicit AtomicPointer(void* v) : rep_(v) { }
+  inline void* Acquire_Load() const {
+    void* val;
+    __asm__ __volatile__ (
+        "ldx [%[rep_]], %[val] \n\t"
+         "membar #LoadLoad|#LoadStore \n\t"
+        : [val] "=r" (val)
+        : [rep_] "r" (&rep_)
+        : "memory");
+    return val;
+  }
+  inline void Release_Store(void* v) {
+    __asm__ __volatile__ (
+        "membar #LoadStore|#StoreStore \n\t"
+        "stx %[v], [%[rep_]] \n\t"
+        :
+        : [rep_] "r" (&rep_), [v] "r" (v)
+        : "memory");
+  }
+  inline void* NoBarrier_Load() const { return rep_; }
+  inline void NoBarrier_Store(void* v) { rep_ = v; }
+};
+
+// Atomic pointer based on ia64 acq/rel
+#elif defined(__ia64) && defined(__GNUC__)
+class AtomicPointer {
+ private:
+  void* rep_;
+ public:
+  AtomicPointer() { }
+  explicit AtomicPointer(void* v) : rep_(v) { }
+  inline void* Acquire_Load() const {
+    void* val    ;
+    __asm__ __volatile__ (
+        "ld8.acq %[val] = [%[rep_]] \n\t"
+        : [val] "=r" (val)
+        : [rep_] "r" (&rep_)
+        : "memory"
+        );
+    return val;
+  }
+  inline void Release_Store(void* v) {
+    __asm__ __volatile__ (
+        "st8.rel [%[rep_]] = %[v]  \n\t"
+        :
+        : [rep_] "r" (&rep_), [v] "r" (v)
+        : "memory"
+        );
+  }
+  inline void* NoBarrier_Load() const { return rep_; }
+  inline void NoBarrier_Store(void* v) { rep_ = v; }
+};
+
+// We have neither MemoryBarrier(), nor <atomic>
+#else
+#error Please implement AtomicPointer for this platform.
+
+#endif
+#endif
+
+#undef LEVELDB_HAVE_MEMORY_BARRIER
+#undef ARCH_CPU_X86_FAMILY
+#undef ARCH_CPU_ARM_FAMILY
+#undef ARCH_CPU_ARM64_FAMILY
+#undef ARCH_CPU_PPC_FAMILY
+
+}  // namespace port
+}  // namespace leveldb
+
+#endif  // PORT_ATOMIC_POINTER_H_
diff --git a/depend/zcash/src/leveldb/port/port.h b/depend/zcash/src/leveldb/port/port.h
new file mode 100644
index 000000000..4baafa8e2
--- /dev/null
+++ b/depend/zcash/src/leveldb/port/port.h
@@ -0,0 +1,21 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_PORT_PORT_H_
+#define STORAGE_LEVELDB_PORT_PORT_H_
+
+#include <string.h>
+
+// Include the appropriate platform specific file below.  If you are
+// porting to a new platform, see "port_example.h" for documentation
+// of what the new port_<platform>.h file must provide.
+#if defined(LEVELDB_PLATFORM_POSIX)
+#  include "port/port_posix.h"
+#elif defined(LEVELDB_PLATFORM_CHROMIUM)
+#  include "port/port_chromium.h"
+#elif defined(LEVELDB_PLATFORM_WINDOWS)
+#  include "port/port_win.h"
+#endif
+
+#endif  // STORAGE_LEVELDB_PORT_PORT_H_
diff --git a/depend/zcash/src/leveldb/port/port_example.h b/depend/zcash/src/leveldb/port/port_example.h
new file mode 100644
index 000000000..5b1d027de
--- /dev/null
+++ b/depend/zcash/src/leveldb/port/port_example.h
@@ -0,0 +1,145 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// This file contains the specification, but not the implementations,
+// of the types/operations/etc. that should be defined by a platform
+// specific port_<platform>.h file.  Use this file as a reference for
+// how to port this package to a new platform.
+
+#ifndef STORAGE_LEVELDB_PORT_PORT_EXAMPLE_H_
+#define STORAGE_LEVELDB_PORT_PORT_EXAMPLE_H_
+
+namespace leveldb {
+namespace port {
+
+// TODO(jorlow): Many of these belong more in the environment class rather than
+//               here. We should try moving them and see if it affects perf.
+
+// The following boolean constant must be true on a little-endian machine
+// and false otherwise.
+static const bool kLittleEndian = true /* or some other expression */;
+
+// ------------------ Threading -------------------
+
+// A Mutex represents an exclusive lock.
+class Mutex {
+ public:
+  Mutex();
+  ~Mutex();
+
+  // Lock the mutex.  Waits until other lockers have exited.
+  // Will deadlock if the mutex is already locked by this thread.
+  void Lock();
+
+  // Unlock the mutex.
+  // REQUIRES: This mutex was locked by this thread.
+  void Unlock();
+
+  // Optionally crash if this thread does not hold this mutex.
+  // The implementation must be fast, especially if NDEBUG is
+  // defined.  The implementation is allowed to skip all checks.
+  void AssertHeld();
+};
+
+class CondVar {
+ public:
+  explicit CondVar(Mutex* mu);
+  ~CondVar();
+
+  // Atomically release *mu and block on this condition variable until
+  // either a call to SignalAll(), or a call to Signal() that picks
+  // this thread to wakeup.
+  // REQUIRES: this thread holds *mu
+  void Wait();
+
+  // If there are some threads waiting, wake up at least one of them.
+  void Signal();
+
+  // Wake up all waiting threads.
+  void SignallAll();
+};
+
+// Thread-safe initialization.
+// Used as follows:
+//      static port::OnceType init_control = LEVELDB_ONCE_INIT;
+//      static void Initializer() { ... do something ...; }
+//      ...
+//      port::InitOnce(&init_control, &Initializer);
+typedef intptr_t OnceType;
+#define LEVELDB_ONCE_INIT 0
+extern void InitOnce(port::OnceType*, void (*initializer)());
+
+// A type that holds a pointer that can be read or written atomically
+// (i.e., without word-tearing.)
+class AtomicPointer {
+ private:
+  intptr_t rep_;
+ public:
+  // Initialize to arbitrary value
+  AtomicPointer();
+
+  // Initialize to hold v
+  explicit AtomicPointer(void* v) : rep_(v) { }
+
+  // Read and return the stored pointer with the guarantee that no
+  // later memory access (read or write) by this thread can be
+  // reordered ahead of this read.
+  void* Acquire_Load() const;
+
+  // Set v as the stored pointer with the guarantee that no earlier
+  // memory access (read or write) by this thread can be reordered
+  // after this store.
+  void Release_Store(void* v);
+
+  // Read the stored pointer with no ordering guarantees.
+  void* NoBarrier_Load() const;
+
+  // Set va as the stored pointer with no ordering guarantees.
+  void NoBarrier_Store(void* v);
+};
+
+// ------------------ Compression -------------------
+
+// Store the snappy compression of "input[0,input_length-1]" in *output.
+// Returns false if snappy is not supported by this port.
+extern bool Snappy_Compress(const char* input, size_t input_length,
+                            std::string* output);
+
+// If input[0,input_length-1] looks like a valid snappy compressed
+// buffer, store the size of the uncompressed data in *result and
+// return true.  Else return false.
+extern bool Snappy_GetUncompressedLength(const char* input, size_t length,
+                                         size_t* result);
+
+// Attempt to snappy uncompress input[0,input_length-1] into *output.
+// Returns true if successful, false if the input is invalid lightweight
+// compressed data.
+//
+// REQUIRES: at least the first "n" bytes of output[] must be writable
+// where "n" is the result of a successful call to
+// Snappy_GetUncompressedLength.
+extern bool Snappy_Uncompress(const char* input_data, size_t input_length,
+                              char* output);
+
+// ------------------ Miscellaneous -------------------
+
+// If heap profiling is not supported, returns false.
+// Else repeatedly calls (*func)(arg, data, n) and then returns true.
+// The concatenation of all "data[0,n-1]" fragments is the heap profile.
+extern bool GetHeapProfile(void (*func)(void*, const char*, int), void* arg);
+
+// Determine whether a working accelerated crc32 implementation exists
+// Returns true if AcceleratedCRC32C is safe to call
+bool HasAcceleratedCRC32C();
+
+// Extend the CRC to include the first n bytes of buf.
+//
+// Returns zero if the CRC cannot be extended using acceleration, else returns
+// the newly extended CRC value (which may also be zero).
+uint32_t AcceleratedCRC32C(uint32_t crc, const char* buf, size_t size);
+
+}  // namespace port
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_PORT_PORT_EXAMPLE_H_
diff --git a/depend/zcash/src/leveldb/port/port_posix.cc b/depend/zcash/src/leveldb/port/port_posix.cc
new file mode 100644
index 000000000..ec39e9219
--- /dev/null
+++ b/depend/zcash/src/leveldb/port/port_posix.cc
@@ -0,0 +1,67 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "port/port_posix.h"
+
+#include <cstdlib>
+#include <stdio.h>
+#include <string.h>
+
+#if (defined(__x86_64__) || defined(__i386__)) && defined(__GNUC__)
+#include <cpuid.h>
+#endif
+
+namespace leveldb {
+namespace port {
+
+static void PthreadCall(const char* label, int result) {
+  if (result != 0) {
+    fprintf(stderr, "pthread %s: %s\n", label, strerror(result));
+    abort();
+  }
+}
+
+Mutex::Mutex() { PthreadCall("init mutex", pthread_mutex_init(&mu_, NULL)); }
+
+Mutex::~Mutex() { PthreadCall("destroy mutex", pthread_mutex_destroy(&mu_)); }
+
+void Mutex::Lock() { PthreadCall("lock", pthread_mutex_lock(&mu_)); }
+
+void Mutex::Unlock() { PthreadCall("unlock", pthread_mutex_unlock(&mu_)); }
+
+CondVar::CondVar(Mutex* mu)
+    : mu_(mu) {
+    PthreadCall("init cv", pthread_cond_init(&cv_, NULL));
+}
+
+CondVar::~CondVar() { PthreadCall("destroy cv", pthread_cond_destroy(&cv_)); }
+
+void CondVar::Wait() {
+  PthreadCall("wait", pthread_cond_wait(&cv_, &mu_->mu_));
+}
+
+void CondVar::Signal() {
+  PthreadCall("signal", pthread_cond_signal(&cv_));
+}
+
+void CondVar::SignalAll() {
+  PthreadCall("broadcast", pthread_cond_broadcast(&cv_));
+}
+
+void InitOnce(OnceType* once, void (*initializer)()) {
+  PthreadCall("once", pthread_once(once, initializer));
+}
+
+bool HasAcceleratedCRC32C() {
+#if (defined(__x86_64__) || defined(__i386__)) && defined(__GNUC__)
+  unsigned int eax, ebx, ecx, edx;
+  __get_cpuid(1, &eax, &ebx, &ecx, &edx);
+  return (ecx & (1 << 20)) != 0;
+#else
+  return false;
+#endif
+}
+
+}  // namespace port
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/port/port_posix.h b/depend/zcash/src/leveldb/port/port_posix.h
new file mode 100644
index 000000000..d85fa5d63
--- /dev/null
+++ b/depend/zcash/src/leveldb/port/port_posix.h
@@ -0,0 +1,161 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// See port_example.h for documentation for the following types/functions.
+
+#ifndef STORAGE_LEVELDB_PORT_PORT_POSIX_H_
+#define STORAGE_LEVELDB_PORT_PORT_POSIX_H_
+
+#undef PLATFORM_IS_LITTLE_ENDIAN
+#if defined(OS_MACOSX)
+  #include <machine/endian.h>
+  #if defined(__DARWIN_LITTLE_ENDIAN) && defined(__DARWIN_BYTE_ORDER)
+    #define PLATFORM_IS_LITTLE_ENDIAN \
+        (__DARWIN_BYTE_ORDER == __DARWIN_LITTLE_ENDIAN)
+  #endif
+#elif defined(OS_SOLARIS)
+  #include <sys/isa_defs.h>
+  #ifdef _LITTLE_ENDIAN
+    #define PLATFORM_IS_LITTLE_ENDIAN true
+  #else
+    #define PLATFORM_IS_LITTLE_ENDIAN false
+  #endif
+#elif defined(OS_FREEBSD) || defined(OS_OPENBSD) ||\
+      defined(OS_NETBSD) || defined(OS_DRAGONFLYBSD)
+  #include <sys/types.h>
+  #include <sys/endian.h>
+  #define PLATFORM_IS_LITTLE_ENDIAN (_BYTE_ORDER == _LITTLE_ENDIAN)
+#elif defined(OS_HPUX)
+  #define PLATFORM_IS_LITTLE_ENDIAN false
+#elif defined(OS_ANDROID)
+  // Due to a bug in the NDK x86 <sys/endian.h> definition,
+  // _BYTE_ORDER must be used instead of __BYTE_ORDER on Android.
+  // See http://code.google.com/p/android/issues/detail?id=39824
+  #include <endian.h>
+  #define PLATFORM_IS_LITTLE_ENDIAN  (_BYTE_ORDER == _LITTLE_ENDIAN)
+#else
+  #include <endian.h>
+#endif
+
+#include <pthread.h>
+#ifdef SNAPPY
+#include <snappy.h>
+#endif
+#include <stdint.h>
+#include <string>
+#include "port/atomic_pointer.h"
+
+#ifndef PLATFORM_IS_LITTLE_ENDIAN
+#define PLATFORM_IS_LITTLE_ENDIAN (__BYTE_ORDER == __LITTLE_ENDIAN)
+#endif
+
+#if defined(OS_MACOSX) || defined(OS_SOLARIS) || defined(OS_FREEBSD) ||\
+    defined(OS_NETBSD) || defined(OS_OPENBSD) || defined(OS_DRAGONFLYBSD) ||\
+    defined(OS_ANDROID) || defined(OS_HPUX) || defined(CYGWIN)
+// Use fread/fwrite/fflush on platforms without _unlocked variants
+#define fread_unlocked fread
+#define fwrite_unlocked fwrite
+#define fflush_unlocked fflush
+#endif
+
+#if defined(OS_FREEBSD) ||\
+    defined(OS_OPENBSD) || defined(OS_DRAGONFLYBSD)
+// Use fsync() on platforms without fdatasync()
+#define fdatasync fsync
+#endif
+
+#if defined(OS_MACOSX)
+#define fdatasync(fd) fcntl(fd, F_FULLFSYNC, 0)
+#endif
+
+#if defined(OS_ANDROID) && __ANDROID_API__ < 9
+// fdatasync() was only introduced in API level 9 on Android. Use fsync()
+// when targetting older platforms.
+#define fdatasync fsync
+#endif
+
+namespace leveldb {
+namespace port {
+
+static const bool kLittleEndian = PLATFORM_IS_LITTLE_ENDIAN;
+#undef PLATFORM_IS_LITTLE_ENDIAN
+
+class CondVar;
+
+class Mutex {
+ public:
+  Mutex();
+  ~Mutex();
+
+  void Lock();
+  void Unlock();
+  void AssertHeld() { }
+
+ private:
+  friend class CondVar;
+  pthread_mutex_t mu_;
+
+  // No copying
+  Mutex(const Mutex&);
+  void operator=(const Mutex&);
+};
+
+class CondVar {
+ public:
+  explicit CondVar(Mutex* mu);
+  ~CondVar();
+  void Wait();
+  void Signal();
+  void SignalAll();
+ private:
+  pthread_cond_t cv_;
+  Mutex* mu_;
+};
+
+typedef pthread_once_t OnceType;
+#define LEVELDB_ONCE_INIT PTHREAD_ONCE_INIT
+extern void InitOnce(OnceType* once, void (*initializer)());
+
+inline bool Snappy_Compress(const char* input, size_t length,
+                            ::std::string* output) {
+#ifdef SNAPPY
+  output->resize(snappy::MaxCompressedLength(length));
+  size_t outlen;
+  snappy::RawCompress(input, length, &(*output)[0], &outlen);
+  output->resize(outlen);
+  return true;
+#endif
+
+  return false;
+}
+
+inline bool Snappy_GetUncompressedLength(const char* input, size_t length,
+                                         size_t* result) {
+#ifdef SNAPPY
+  return snappy::GetUncompressedLength(input, length, result);
+#else
+  return false;
+#endif
+}
+
+inline bool Snappy_Uncompress(const char* input, size_t length,
+                              char* output) {
+#ifdef SNAPPY
+  return snappy::RawUncompress(input, length, output);
+#else
+  return false;
+#endif
+}
+
+inline bool GetHeapProfile(void (*func)(void*, const char*, int), void* arg) {
+  return false;
+}
+
+bool HasAcceleratedCRC32C();
+uint32_t AcceleratedCRC32C(uint32_t crc, const char* buf, size_t size);
+
+} // namespace port
+} // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_PORT_PORT_POSIX_H_
diff --git a/depend/zcash/src/leveldb/port/port_posix_sse.cc b/depend/zcash/src/leveldb/port/port_posix_sse.cc
new file mode 100644
index 000000000..2d49c21dd
--- /dev/null
+++ b/depend/zcash/src/leveldb/port/port_posix_sse.cc
@@ -0,0 +1,110 @@
+// Copyright 2016 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// A portable implementation of crc32c, optimized to handle
+// four bytes at a time.
+//
+// In a separate source file to allow this accelerated CRC32C function to be
+// compiled with the appropriate compiler flags to enable x86 SSE 4.2
+// instructions.
+
+#include <stdint.h>
+#include <string.h>
+#include "port/port.h"
+
+#if defined(LEVELDB_PLATFORM_POSIX_SSE)
+
+#if defined(_MSC_VER)
+#include <intrin.h>
+#elif defined(__GNUC__) && defined(__SSE4_2__)
+#include <nmmintrin.h>
+#endif
+
+#endif  // defined(LEVELDB_PLATFORM_POSIX_SSE)
+
+namespace leveldb {
+namespace port {
+
+#if defined(LEVELDB_PLATFORM_POSIX_SSE)
+
+// Used to fetch a naturally-aligned 32-bit word in little endian byte-order
+static inline uint32_t LE_LOAD32(const uint8_t *p) {
+  // SSE is x86 only, so ensured that |p| is always little-endian.
+  uint32_t word;
+  memcpy(&word, p, sizeof(word));
+  return word;
+}
+
+#if defined(_M_X64) || defined(__x86_64__)  // LE_LOAD64 is only used on x64.
+
+// Used to fetch a naturally-aligned 64-bit word in little endian byte-order
+static inline uint64_t LE_LOAD64(const uint8_t *p) {
+  uint64_t dword;
+  memcpy(&dword, p, sizeof(dword));
+  return dword;
+}
+
+#endif  // defined(_M_X64) || defined(__x86_64__)
+
+#endif  // defined(LEVELDB_PLATFORM_POSIX_SSE)
+
+// For further improvements see Intel publication at:
+// http://download.intel.com/design/intarch/papers/323405.pdf
+uint32_t AcceleratedCRC32C(uint32_t crc, const char* buf, size_t size) {
+#if !defined(LEVELDB_PLATFORM_POSIX_SSE)
+  return 0;
+#else
+
+  const uint8_t *p = reinterpret_cast<const uint8_t *>(buf);
+  const uint8_t *e = p + size;
+  uint32_t l = crc ^ 0xffffffffu;
+
+#define STEP1 do {                              \
+    l = _mm_crc32_u8(l, *p++);                  \
+} while (0)
+#define STEP4 do {                              \
+    l = _mm_crc32_u32(l, LE_LOAD32(p));         \
+    p += 4;                                     \
+} while (0)
+#define STEP8 do {                              \
+    l = _mm_crc32_u64(l, LE_LOAD64(p));         \
+    p += 8;                                     \
+} while (0)
+
+  if (size > 16) {
+    // Process unaligned bytes
+    for (unsigned int i = reinterpret_cast<uintptr_t>(p) % 8; i; --i) {
+      STEP1;
+    }
+
+    // _mm_crc32_u64 is only available on x64.
+#if defined(_M_X64) || defined(__x86_64__)
+    // Process 8 bytes at a time
+    while ((e-p) >= 8) {
+      STEP8;
+    }
+    // Process 4 bytes at a time
+    if ((e-p) >= 4) {
+      STEP4;
+    }
+#else  // !(defined(_M_X64) || defined(__x86_64__))
+    // Process 4 bytes at a time
+    while ((e-p) >= 4) {
+      STEP4;
+    }
+#endif  // defined(_M_X64) || defined(__x86_64__)
+  }
+  // Process the last few bytes
+  while (p != e) {
+    STEP1;
+  }
+#undef STEP8
+#undef STEP4
+#undef STEP1
+  return l ^ 0xffffffffu;
+#endif  // defined(LEVELDB_PLATFORM_POSIX_SSE)
+}
+
+}  // namespace port
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/port/port_win.cc b/depend/zcash/src/leveldb/port/port_win.cc
new file mode 100644
index 000000000..1be9e8d5b
--- /dev/null
+++ b/depend/zcash/src/leveldb/port/port_win.cc
@@ -0,0 +1,158 @@
+// LevelDB Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// See port_example.h for documentation for the following types/functions.
+
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are met:
+// 
+//  * Redistributions of source code must retain the above copyright
+//    notice, this list of conditions and the following disclaimer.
+//  * Redistributions in binary form must reproduce the above copyright
+//    notice, this list of conditions and the following disclaimer in the
+//    documentation and/or other materials provided with the distribution.
+//  * Neither the name of the University of California, Berkeley nor the
+//    names of its contributors may be used to endorse or promote products
+//    derived from this software without specific prior written permission.
+// 
+// THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY
+// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+// DISCLAIMED. IN NO EVENT SHALL THE REGENTS AND CONTRIBUTORS BE LIABLE FOR ANY
+// DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+// (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+// ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+//
+
+#include "port/port_win.h"
+
+#include <windows.h>
+#include <cassert>
+#include <intrin.h>
+
+namespace leveldb {
+namespace port {
+
+Mutex::Mutex() :
+    cs_(NULL) {
+  assert(!cs_);
+  cs_ = static_cast<void *>(new CRITICAL_SECTION());
+  ::InitializeCriticalSection(static_cast<CRITICAL_SECTION *>(cs_));
+  assert(cs_);
+}
+
+Mutex::~Mutex() {
+  assert(cs_);
+  ::DeleteCriticalSection(static_cast<CRITICAL_SECTION *>(cs_));
+  delete static_cast<CRITICAL_SECTION *>(cs_);
+  cs_ = NULL;
+  assert(!cs_);
+}
+
+void Mutex::Lock() {
+  assert(cs_);
+  ::EnterCriticalSection(static_cast<CRITICAL_SECTION *>(cs_));
+}
+
+void Mutex::Unlock() {
+  assert(cs_);
+  ::LeaveCriticalSection(static_cast<CRITICAL_SECTION *>(cs_));
+}
+
+void Mutex::AssertHeld() {
+  assert(cs_);
+  assert(1);
+}
+
+CondVar::CondVar(Mutex* mu) :
+    waiting_(0), 
+    mu_(mu), 
+    sem1_(::CreateSemaphore(NULL, 0, 10000, NULL)), 
+    sem2_(::CreateSemaphore(NULL, 0, 10000, NULL)) {
+  assert(mu_);
+}
+
+CondVar::~CondVar() {
+  ::CloseHandle(sem1_);
+  ::CloseHandle(sem2_);
+}
+
+void CondVar::Wait() {
+  mu_->AssertHeld();
+
+  wait_mtx_.Lock();
+  ++waiting_;
+  wait_mtx_.Unlock();
+
+  mu_->Unlock();
+
+  // initiate handshake
+  ::WaitForSingleObject(sem1_, INFINITE);
+  ::ReleaseSemaphore(sem2_, 1, NULL);
+  mu_->Lock();
+}
+
+void CondVar::Signal() {
+  wait_mtx_.Lock();
+  if (waiting_ > 0) {
+    --waiting_;
+
+    // finalize handshake
+    ::ReleaseSemaphore(sem1_, 1, NULL);
+    ::WaitForSingleObject(sem2_, INFINITE);
+  }
+  wait_mtx_.Unlock();
+}
+
+void CondVar::SignalAll() {
+  wait_mtx_.Lock();
+  ::ReleaseSemaphore(sem1_, waiting_, NULL);
+  while(waiting_ > 0) {
+    --waiting_;
+    ::WaitForSingleObject(sem2_, INFINITE);
+  }
+  wait_mtx_.Unlock();
+}
+
+AtomicPointer::AtomicPointer(void* v) {
+  Release_Store(v);
+}
+
+void InitOnce(OnceType* once, void (*initializer)()) {
+  once->InitOnce(initializer);
+}
+
+void* AtomicPointer::Acquire_Load() const {
+  void * p = NULL;
+  InterlockedExchangePointer(&p, rep_);
+  return p;
+}
+
+void AtomicPointer::Release_Store(void* v) {
+  InterlockedExchangePointer(&rep_, v);
+}
+
+void* AtomicPointer::NoBarrier_Load() const {
+  return rep_;
+}
+
+void AtomicPointer::NoBarrier_Store(void* v) {
+  rep_ = v;
+}
+
+bool HasAcceleratedCRC32C() {
+#if defined(__x86_64__) || defined(__i386__)
+  int cpu_info[4];
+  __cpuid(cpu_info, 1);
+  return (cpu_info[2] & (1 << 20)) != 0;
+#else
+  return false;
+#endif
+}
+
+}
+}
diff --git a/depend/zcash/src/leveldb/port/port_win.h b/depend/zcash/src/leveldb/port/port_win.h
new file mode 100644
index 000000000..ba7b17faf
--- /dev/null
+++ b/depend/zcash/src/leveldb/port/port_win.h
@@ -0,0 +1,185 @@
+// LevelDB Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// See port_example.h for documentation for the following types/functions.
+
+// Redistribution and use in source and binary forms, with or without
+// modification, are permitted provided that the following conditions are met:
+// 
+//  * Redistributions of source code must retain the above copyright
+//    notice, this list of conditions and the following disclaimer.
+//  * Redistributions in binary form must reproduce the above copyright
+//    notice, this list of conditions and the following disclaimer in the
+//    documentation and/or other materials provided with the distribution.
+//  * Neither the name of the University of California, Berkeley nor the
+//    names of its contributors may be used to endorse or promote products
+//    derived from this software without specific prior written permission.
+// 
+// THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ANY
+// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+// WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+// DISCLAIMED. IN NO EVENT SHALL THE REGENTS AND CONTRIBUTORS BE LIABLE FOR ANY
+// DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+// (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+// LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+// ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+//
+
+#ifndef STORAGE_LEVELDB_PORT_PORT_WIN_H_
+#define STORAGE_LEVELDB_PORT_PORT_WIN_H_
+
+#ifdef _MSC_VER
+#if !(_MSC_VER >= 1900)
+#define snprintf _snprintf
+#endif
+#define close _close
+#define fread_unlocked _fread_nolock
+#ifdef _WIN64
+#define ssize_t int64_t
+#else
+#define ssize_t int32_t
+#endif
+#endif
+
+#include <string>
+#include <stdint.h>
+static_assert(sizeof(ssize_t) == sizeof(size_t), "ssize_t should be the same size as size_t");
+#ifdef SNAPPY
+#include <snappy.h>
+#endif
+
+namespace leveldb {
+namespace port {
+
+// Windows is little endian (for now :p)
+static const bool kLittleEndian = true;
+
+class CondVar;
+
+class Mutex {
+ public:
+  Mutex();
+  ~Mutex();
+
+  void Lock();
+  void Unlock();
+  void AssertHeld();
+
+ private:
+  friend class CondVar;
+  // critical sections are more efficient than mutexes
+  // but they are not recursive and can only be used to synchronize threads within the same process
+  // we use opaque void * to avoid including windows.h in port_win.h
+  void * cs_;
+
+  // No copying
+  Mutex(const Mutex&);
+  void operator=(const Mutex&);
+};
+
+// the Win32 API offers a dependable condition variable mechanism, but only starting with
+// Windows 2008 and Vista
+// no matter what we will implement our own condition variable with a semaphore
+// implementation as described in a paper written by Andrew D. Birrell in 2003
+class CondVar {
+ public:
+  explicit CondVar(Mutex* mu);
+  ~CondVar();
+  void Wait();
+  void Signal();
+  void SignalAll();
+ private:
+  Mutex* mu_;
+  
+  Mutex wait_mtx_;
+  long waiting_;
+  
+  void * sem1_;
+  void * sem2_;
+  
+  
+};
+
+class OnceType {
+public:
+//    OnceType() : init_(false) {}
+    OnceType(const OnceType &once) : init_(once.init_) {}
+    OnceType(bool f) : init_(f) {}
+    void InitOnce(void (*initializer)()) {
+        mutex_.Lock();
+        if (!init_) {
+            init_ = true;
+            initializer();
+        }
+        mutex_.Unlock();
+    }
+
+private:
+    bool init_;
+    Mutex mutex_;
+};
+
+#define LEVELDB_ONCE_INIT false
+extern void InitOnce(port::OnceType*, void (*initializer)());
+
+// Storage for a lock-free pointer
+class AtomicPointer {
+ private:
+  void * rep_;
+ public:
+  AtomicPointer() : rep_(NULL) { }
+  explicit AtomicPointer(void* v); 
+  void* Acquire_Load() const;
+
+  void Release_Store(void* v);
+
+  void* NoBarrier_Load() const;
+
+  void NoBarrier_Store(void* v);
+};
+
+inline bool Snappy_Compress(const char* input, size_t length,
+                            ::std::string* output) {
+#ifdef SNAPPY
+  output->resize(snappy::MaxCompressedLength(length));
+  size_t outlen;
+  snappy::RawCompress(input, length, &(*output)[0], &outlen);
+  output->resize(outlen);
+  return true;
+#endif
+
+  return false;
+}
+
+inline bool Snappy_GetUncompressedLength(const char* input, size_t length,
+                                         size_t* result) {
+#ifdef SNAPPY
+  return snappy::GetUncompressedLength(input, length, result);
+#else
+  return false;
+#endif
+}
+
+inline bool Snappy_Uncompress(const char* input, size_t length,
+                              char* output) {
+#ifdef SNAPPY
+  return snappy::RawUncompress(input, length, output);
+#else
+  return false;
+#endif
+}
+
+inline bool GetHeapProfile(void (*func)(void*, const char*, int), void* arg) {
+  return false;
+}
+
+bool HasAcceleratedCRC32C();
+uint32_t AcceleratedCRC32C(uint32_t crc, const char* buf, size_t size);
+
+}
+}
+
+#endif  // STORAGE_LEVELDB_PORT_PORT_WIN_H_
diff --git a/depend/zcash/src/leveldb/port/thread_annotations.h b/depend/zcash/src/leveldb/port/thread_annotations.h
new file mode 100644
index 000000000..9470ef587
--- /dev/null
+++ b/depend/zcash/src/leveldb/port/thread_annotations.h
@@ -0,0 +1,60 @@
+// Copyright (c) 2012 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_PORT_THREAD_ANNOTATIONS_H_
+#define STORAGE_LEVELDB_PORT_THREAD_ANNOTATIONS_H_
+
+// Some environments provide custom macros to aid in static thread-safety
+// analysis.  Provide empty definitions of such macros unless they are already
+// defined.
+
+#ifndef EXCLUSIVE_LOCKS_REQUIRED
+#define EXCLUSIVE_LOCKS_REQUIRED(...)
+#endif
+
+#ifndef SHARED_LOCKS_REQUIRED
+#define SHARED_LOCKS_REQUIRED(...)
+#endif
+
+#ifndef LOCKS_EXCLUDED
+#define LOCKS_EXCLUDED(...)
+#endif
+
+#ifndef LOCK_RETURNED
+#define LOCK_RETURNED(x)
+#endif
+
+#ifndef LOCKABLE
+#define LOCKABLE
+#endif
+
+#ifndef SCOPED_LOCKABLE
+#define SCOPED_LOCKABLE
+#endif
+
+#ifndef EXCLUSIVE_LOCK_FUNCTION
+#define EXCLUSIVE_LOCK_FUNCTION(...)
+#endif
+
+#ifndef SHARED_LOCK_FUNCTION
+#define SHARED_LOCK_FUNCTION(...)
+#endif
+
+#ifndef EXCLUSIVE_TRYLOCK_FUNCTION
+#define EXCLUSIVE_TRYLOCK_FUNCTION(...)
+#endif
+
+#ifndef SHARED_TRYLOCK_FUNCTION
+#define SHARED_TRYLOCK_FUNCTION(...)
+#endif
+
+#ifndef UNLOCK_FUNCTION
+#define UNLOCK_FUNCTION(...)
+#endif
+
+#ifndef NO_THREAD_SAFETY_ANALYSIS
+#define NO_THREAD_SAFETY_ANALYSIS
+#endif
+
+#endif  // STORAGE_LEVELDB_PORT_THREAD_ANNOTATIONS_H_
diff --git a/depend/zcash/src/leveldb/port/win/stdint.h b/depend/zcash/src/leveldb/port/win/stdint.h
new file mode 100644
index 000000000..39edd0db1
--- /dev/null
+++ b/depend/zcash/src/leveldb/port/win/stdint.h
@@ -0,0 +1,24 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+// MSVC didn't ship with this file until the 2010 version.
+
+#ifndef STORAGE_LEVELDB_PORT_WIN_STDINT_H_
+#define STORAGE_LEVELDB_PORT_WIN_STDINT_H_
+
+#if !defined(_MSC_VER)
+#error This file should only be included when compiling with MSVC.
+#endif
+
+// Define C99 equivalent types.
+typedef signed char           int8_t;
+typedef signed short          int16_t;
+typedef signed int            int32_t;
+typedef signed long long      int64_t;
+typedef unsigned char         uint8_t;
+typedef unsigned short        uint16_t;
+typedef unsigned int          uint32_t;
+typedef unsigned long long    uint64_t;
+
+#endif  // STORAGE_LEVELDB_PORT_WIN_STDINT_H_
diff --git a/depend/zcash/src/leveldb/table/block.cc b/depend/zcash/src/leveldb/table/block.cc
new file mode 100644
index 000000000..43e402c9c
--- /dev/null
+++ b/depend/zcash/src/leveldb/table/block.cc
@@ -0,0 +1,268 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// Decodes the blocks generated by block_builder.cc.
+
+#include "table/block.h"
+
+#include <vector>
+#include <algorithm>
+#include "leveldb/comparator.h"
+#include "table/format.h"
+#include "util/coding.h"
+#include "util/logging.h"
+
+namespace leveldb {
+
+inline uint32_t Block::NumRestarts() const {
+  assert(size_ >= sizeof(uint32_t));
+  return DecodeFixed32(data_ + size_ - sizeof(uint32_t));
+}
+
+Block::Block(const BlockContents& contents)
+    : data_(contents.data.data()),
+      size_(contents.data.size()),
+      owned_(contents.heap_allocated) {
+  if (size_ < sizeof(uint32_t)) {
+    size_ = 0;  // Error marker
+  } else {
+    size_t max_restarts_allowed = (size_-sizeof(uint32_t)) / sizeof(uint32_t);
+    if (NumRestarts() > max_restarts_allowed) {
+      // The size is too small for NumRestarts()
+      size_ = 0;
+    } else {
+      restart_offset_ = size_ - (1 + NumRestarts()) * sizeof(uint32_t);
+    }
+  }
+}
+
+Block::~Block() {
+  if (owned_) {
+    delete[] data_;
+  }
+}
+
+// Helper routine: decode the next block entry starting at "p",
+// storing the number of shared key bytes, non_shared key bytes,
+// and the length of the value in "*shared", "*non_shared", and
+// "*value_length", respectively.  Will not dereference past "limit".
+//
+// If any errors are detected, returns NULL.  Otherwise, returns a
+// pointer to the key delta (just past the three decoded values).
+static inline const char* DecodeEntry(const char* p, const char* limit,
+                                      uint32_t* shared,
+                                      uint32_t* non_shared,
+                                      uint32_t* value_length) {
+  if (limit - p < 3) return NULL;
+  *shared = reinterpret_cast<const unsigned char*>(p)[0];
+  *non_shared = reinterpret_cast<const unsigned char*>(p)[1];
+  *value_length = reinterpret_cast<const unsigned char*>(p)[2];
+  if ((*shared | *non_shared | *value_length) < 128) {
+    // Fast path: all three values are encoded in one byte each
+    p += 3;
+  } else {
+    if ((p = GetVarint32Ptr(p, limit, shared)) == NULL) return NULL;
+    if ((p = GetVarint32Ptr(p, limit, non_shared)) == NULL) return NULL;
+    if ((p = GetVarint32Ptr(p, limit, value_length)) == NULL) return NULL;
+  }
+
+  if (static_cast<uint32_t>(limit - p) < (*non_shared + *value_length)) {
+    return NULL;
+  }
+  return p;
+}
+
+class Block::Iter : public Iterator {
+ private:
+  const Comparator* const comparator_;
+  const char* const data_;      // underlying block contents
+  uint32_t const restarts_;     // Offset of restart array (list of fixed32)
+  uint32_t const num_restarts_; // Number of uint32_t entries in restart array
+
+  // current_ is offset in data_ of current entry.  >= restarts_ if !Valid
+  uint32_t current_;
+  uint32_t restart_index_;  // Index of restart block in which current_ falls
+  std::string key_;
+  Slice value_;
+  Status status_;
+
+  inline int Compare(const Slice& a, const Slice& b) const {
+    return comparator_->Compare(a, b);
+  }
+
+  // Return the offset in data_ just past the end of the current entry.
+  inline uint32_t NextEntryOffset() const {
+    return (value_.data() + value_.size()) - data_;
+  }
+
+  uint32_t GetRestartPoint(uint32_t index) {
+    assert(index < num_restarts_);
+    return DecodeFixed32(data_ + restarts_ + index * sizeof(uint32_t));
+  }
+
+  void SeekToRestartPoint(uint32_t index) {
+    key_.clear();
+    restart_index_ = index;
+    // current_ will be fixed by ParseNextKey();
+
+    // ParseNextKey() starts at the end of value_, so set value_ accordingly
+    uint32_t offset = GetRestartPoint(index);
+    value_ = Slice(data_ + offset, 0);
+  }
+
+ public:
+  Iter(const Comparator* comparator,
+       const char* data,
+       uint32_t restarts,
+       uint32_t num_restarts)
+      : comparator_(comparator),
+        data_(data),
+        restarts_(restarts),
+        num_restarts_(num_restarts),
+        current_(restarts_),
+        restart_index_(num_restarts_) {
+    assert(num_restarts_ > 0);
+  }
+
+  virtual bool Valid() const { return current_ < restarts_; }
+  virtual Status status() const { return status_; }
+  virtual Slice key() const {
+    assert(Valid());
+    return key_;
+  }
+  virtual Slice value() const {
+    assert(Valid());
+    return value_;
+  }
+
+  virtual void Next() {
+    assert(Valid());
+    ParseNextKey();
+  }
+
+  virtual void Prev() {
+    assert(Valid());
+
+    // Scan backwards to a restart point before current_
+    const uint32_t original = current_;
+    while (GetRestartPoint(restart_index_) >= original) {
+      if (restart_index_ == 0) {
+        // No more entries
+        current_ = restarts_;
+        restart_index_ = num_restarts_;
+        return;
+      }
+      restart_index_--;
+    }
+
+    SeekToRestartPoint(restart_index_);
+    do {
+      // Loop until end of current entry hits the start of original entry
+    } while (ParseNextKey() && NextEntryOffset() < original);
+  }
+
+  virtual void Seek(const Slice& target) {
+    // Binary search in restart array to find the last restart point
+    // with a key < target
+    uint32_t left = 0;
+    uint32_t right = num_restarts_ - 1;
+    while (left < right) {
+      uint32_t mid = (left + right + 1) / 2;
+      uint32_t region_offset = GetRestartPoint(mid);
+      uint32_t shared, non_shared, value_length;
+      const char* key_ptr = DecodeEntry(data_ + region_offset,
+                                        data_ + restarts_,
+                                        &shared, &non_shared, &value_length);
+      if (key_ptr == NULL || (shared != 0)) {
+        CorruptionError();
+        return;
+      }
+      Slice mid_key(key_ptr, non_shared);
+      if (Compare(mid_key, target) < 0) {
+        // Key at "mid" is smaller than "target".  Therefore all
+        // blocks before "mid" are uninteresting.
+        left = mid;
+      } else {
+        // Key at "mid" is >= "target".  Therefore all blocks at or
+        // after "mid" are uninteresting.
+        right = mid - 1;
+      }
+    }
+
+    // Linear search (within restart block) for first key >= target
+    SeekToRestartPoint(left);
+    while (true) {
+      if (!ParseNextKey()) {
+        return;
+      }
+      if (Compare(key_, target) >= 0) {
+        return;
+      }
+    }
+  }
+
+  virtual void SeekToFirst() {
+    SeekToRestartPoint(0);
+    ParseNextKey();
+  }
+
+  virtual void SeekToLast() {
+    SeekToRestartPoint(num_restarts_ - 1);
+    while (ParseNextKey() && NextEntryOffset() < restarts_) {
+      // Keep skipping
+    }
+  }
+
+ private:
+  void CorruptionError() {
+    current_ = restarts_;
+    restart_index_ = num_restarts_;
+    status_ = Status::Corruption("bad entry in block");
+    key_.clear();
+    value_.clear();
+  }
+
+  bool ParseNextKey() {
+    current_ = NextEntryOffset();
+    const char* p = data_ + current_;
+    const char* limit = data_ + restarts_;  // Restarts come right after data
+    if (p >= limit) {
+      // No more entries to return.  Mark as invalid.
+      current_ = restarts_;
+      restart_index_ = num_restarts_;
+      return false;
+    }
+
+    // Decode next entry
+    uint32_t shared, non_shared, value_length;
+    p = DecodeEntry(p, limit, &shared, &non_shared, &value_length);
+    if (p == NULL || key_.size() < shared) {
+      CorruptionError();
+      return false;
+    } else {
+      key_.resize(shared);
+      key_.append(p, non_shared);
+      value_ = Slice(p + non_shared, value_length);
+      while (restart_index_ + 1 < num_restarts_ &&
+             GetRestartPoint(restart_index_ + 1) < current_) {
+        ++restart_index_;
+      }
+      return true;
+    }
+  }
+};
+
+Iterator* Block::NewIterator(const Comparator* cmp) {
+  if (size_ < sizeof(uint32_t)) {
+    return NewErrorIterator(Status::Corruption("bad block contents"));
+  }
+  const uint32_t num_restarts = NumRestarts();
+  if (num_restarts == 0) {
+    return NewEmptyIterator();
+  } else {
+    return new Iter(cmp, data_, restart_offset_, num_restarts);
+  }
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/table/block.h b/depend/zcash/src/leveldb/table/block.h
new file mode 100644
index 000000000..2493eb9f9
--- /dev/null
+++ b/depend/zcash/src/leveldb/table/block.h
@@ -0,0 +1,44 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_TABLE_BLOCK_H_
+#define STORAGE_LEVELDB_TABLE_BLOCK_H_
+
+#include <stddef.h>
+#include <stdint.h>
+#include "leveldb/iterator.h"
+
+namespace leveldb {
+
+struct BlockContents;
+class Comparator;
+
+class Block {
+ public:
+  // Initialize the block with the specified contents.
+  explicit Block(const BlockContents& contents);
+
+  ~Block();
+
+  size_t size() const { return size_; }
+  Iterator* NewIterator(const Comparator* comparator);
+
+ private:
+  uint32_t NumRestarts() const;
+
+  const char* data_;
+  size_t size_;
+  uint32_t restart_offset_;     // Offset in data_ of restart array
+  bool owned_;                  // Block owns data_[]
+
+  // No copying allowed
+  Block(const Block&);
+  void operator=(const Block&);
+
+  class Iter;
+};
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_TABLE_BLOCK_H_
diff --git a/depend/zcash/src/leveldb/table/block_builder.cc b/depend/zcash/src/leveldb/table/block_builder.cc
new file mode 100644
index 000000000..db660cd07
--- /dev/null
+++ b/depend/zcash/src/leveldb/table/block_builder.cc
@@ -0,0 +1,109 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// BlockBuilder generates blocks where keys are prefix-compressed:
+//
+// When we store a key, we drop the prefix shared with the previous
+// string.  This helps reduce the space requirement significantly.
+// Furthermore, once every K keys, we do not apply the prefix
+// compression and store the entire key.  We call this a "restart
+// point".  The tail end of the block stores the offsets of all of the
+// restart points, and can be used to do a binary search when looking
+// for a particular key.  Values are stored as-is (without compression)
+// immediately following the corresponding key.
+//
+// An entry for a particular key-value pair has the form:
+//     shared_bytes: varint32
+//     unshared_bytes: varint32
+//     value_length: varint32
+//     key_delta: char[unshared_bytes]
+//     value: char[value_length]
+// shared_bytes == 0 for restart points.
+//
+// The trailer of the block has the form:
+//     restarts: uint32[num_restarts]
+//     num_restarts: uint32
+// restarts[i] contains the offset within the block of the ith restart point.
+
+#include "table/block_builder.h"
+
+#include <algorithm>
+#include <assert.h>
+#include "leveldb/comparator.h"
+#include "leveldb/table_builder.h"
+#include "util/coding.h"
+
+namespace leveldb {
+
+BlockBuilder::BlockBuilder(const Options* options)
+    : options_(options),
+      restarts_(),
+      counter_(0),
+      finished_(false) {
+  assert(options->block_restart_interval >= 1);
+  restarts_.push_back(0);       // First restart point is at offset 0
+}
+
+void BlockBuilder::Reset() {
+  buffer_.clear();
+  restarts_.clear();
+  restarts_.push_back(0);       // First restart point is at offset 0
+  counter_ = 0;
+  finished_ = false;
+  last_key_.clear();
+}
+
+size_t BlockBuilder::CurrentSizeEstimate() const {
+  return (buffer_.size() +                        // Raw data buffer
+          restarts_.size() * sizeof(uint32_t) +   // Restart array
+          sizeof(uint32_t));                      // Restart array length
+}
+
+Slice BlockBuilder::Finish() {
+  // Append restart array
+  for (size_t i = 0; i < restarts_.size(); i++) {
+    PutFixed32(&buffer_, restarts_[i]);
+  }
+  PutFixed32(&buffer_, restarts_.size());
+  finished_ = true;
+  return Slice(buffer_);
+}
+
+void BlockBuilder::Add(const Slice& key, const Slice& value) {
+  Slice last_key_piece(last_key_);
+  assert(!finished_);
+  assert(counter_ <= options_->block_restart_interval);
+  assert(buffer_.empty() // No values yet?
+         || options_->comparator->Compare(key, last_key_piece) > 0);
+  size_t shared = 0;
+  if (counter_ < options_->block_restart_interval) {
+    // See how much sharing to do with previous string
+    const size_t min_length = std::min(last_key_piece.size(), key.size());
+    while ((shared < min_length) && (last_key_piece[shared] == key[shared])) {
+      shared++;
+    }
+  } else {
+    // Restart compression
+    restarts_.push_back(buffer_.size());
+    counter_ = 0;
+  }
+  const size_t non_shared = key.size() - shared;
+
+  // Add "<shared><non_shared><value_size>" to buffer_
+  PutVarint32(&buffer_, shared);
+  PutVarint32(&buffer_, non_shared);
+  PutVarint32(&buffer_, value.size());
+
+  // Add string delta to buffer_ followed by value
+  buffer_.append(key.data() + shared, non_shared);
+  buffer_.append(value.data(), value.size());
+
+  // Update state
+  last_key_.resize(shared);
+  last_key_.append(key.data() + shared, non_shared);
+  assert(Slice(last_key_) == key);
+  counter_++;
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/table/block_builder.h b/depend/zcash/src/leveldb/table/block_builder.h
new file mode 100644
index 000000000..4fbcb3397
--- /dev/null
+++ b/depend/zcash/src/leveldb/table/block_builder.h
@@ -0,0 +1,57 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_TABLE_BLOCK_BUILDER_H_
+#define STORAGE_LEVELDB_TABLE_BLOCK_BUILDER_H_
+
+#include <vector>
+
+#include <stdint.h>
+#include "leveldb/slice.h"
+
+namespace leveldb {
+
+struct Options;
+
+class BlockBuilder {
+ public:
+  explicit BlockBuilder(const Options* options);
+
+  // Reset the contents as if the BlockBuilder was just constructed.
+  void Reset();
+
+  // REQUIRES: Finish() has not been called since the last call to Reset().
+  // REQUIRES: key is larger than any previously added key
+  void Add(const Slice& key, const Slice& value);
+
+  // Finish building the block and return a slice that refers to the
+  // block contents.  The returned slice will remain valid for the
+  // lifetime of this builder or until Reset() is called.
+  Slice Finish();
+
+  // Returns an estimate of the current (uncompressed) size of the block
+  // we are building.
+  size_t CurrentSizeEstimate() const;
+
+  // Return true iff no entries have been added since the last Reset()
+  bool empty() const {
+    return buffer_.empty();
+  }
+
+ private:
+  const Options*        options_;
+  std::string           buffer_;      // Destination buffer
+  std::vector<uint32_t> restarts_;    // Restart points
+  int                   counter_;     // Number of entries emitted since restart
+  bool                  finished_;    // Has Finish() been called?
+  std::string           last_key_;
+
+  // No copying allowed
+  BlockBuilder(const BlockBuilder&);
+  void operator=(const BlockBuilder&);
+};
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_TABLE_BLOCK_BUILDER_H_
diff --git a/depend/zcash/src/leveldb/table/filter_block.cc b/depend/zcash/src/leveldb/table/filter_block.cc
new file mode 100644
index 000000000..1ed513417
--- /dev/null
+++ b/depend/zcash/src/leveldb/table/filter_block.cc
@@ -0,0 +1,111 @@
+// Copyright (c) 2012 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "table/filter_block.h"
+
+#include "leveldb/filter_policy.h"
+#include "util/coding.h"
+
+namespace leveldb {
+
+// See doc/table_format.md for an explanation of the filter block format.
+
+// Generate new filter every 2KB of data
+static const size_t kFilterBaseLg = 11;
+static const size_t kFilterBase = 1 << kFilterBaseLg;
+
+FilterBlockBuilder::FilterBlockBuilder(const FilterPolicy* policy)
+    : policy_(policy) {
+}
+
+void FilterBlockBuilder::StartBlock(uint64_t block_offset) {
+  uint64_t filter_index = (block_offset / kFilterBase);
+  assert(filter_index >= filter_offsets_.size());
+  while (filter_index > filter_offsets_.size()) {
+    GenerateFilter();
+  }
+}
+
+void FilterBlockBuilder::AddKey(const Slice& key) {
+  Slice k = key;
+  start_.push_back(keys_.size());
+  keys_.append(k.data(), k.size());
+}
+
+Slice FilterBlockBuilder::Finish() {
+  if (!start_.empty()) {
+    GenerateFilter();
+  }
+
+  // Append array of per-filter offsets
+  const uint32_t array_offset = result_.size();
+  for (size_t i = 0; i < filter_offsets_.size(); i++) {
+    PutFixed32(&result_, filter_offsets_[i]);
+  }
+
+  PutFixed32(&result_, array_offset);
+  result_.push_back(kFilterBaseLg);  // Save encoding parameter in result
+  return Slice(result_);
+}
+
+void FilterBlockBuilder::GenerateFilter() {
+  const size_t num_keys = start_.size();
+  if (num_keys == 0) {
+    // Fast path if there are no keys for this filter
+    filter_offsets_.push_back(result_.size());
+    return;
+  }
+
+  // Make list of keys from flattened key structure
+  start_.push_back(keys_.size());  // Simplify length computation
+  tmp_keys_.resize(num_keys);
+  for (size_t i = 0; i < num_keys; i++) {
+    const char* base = keys_.data() + start_[i];
+    size_t length = start_[i+1] - start_[i];
+    tmp_keys_[i] = Slice(base, length);
+  }
+
+  // Generate filter for current set of keys and append to result_.
+  filter_offsets_.push_back(result_.size());
+  policy_->CreateFilter(&tmp_keys_[0], static_cast<int>(num_keys), &result_);
+
+  tmp_keys_.clear();
+  keys_.clear();
+  start_.clear();
+}
+
+FilterBlockReader::FilterBlockReader(const FilterPolicy* policy,
+                                     const Slice& contents)
+    : policy_(policy),
+      data_(NULL),
+      offset_(NULL),
+      num_(0),
+      base_lg_(0) {
+  size_t n = contents.size();
+  if (n < 5) return;  // 1 byte for base_lg_ and 4 for start of offset array
+  base_lg_ = contents[n-1];
+  uint32_t last_word = DecodeFixed32(contents.data() + n - 5);
+  if (last_word > n - 5) return;
+  data_ = contents.data();
+  offset_ = data_ + last_word;
+  num_ = (n - 5 - last_word) / 4;
+}
+
+bool FilterBlockReader::KeyMayMatch(uint64_t block_offset, const Slice& key) {
+  uint64_t index = block_offset >> base_lg_;
+  if (index < num_) {
+    uint32_t start = DecodeFixed32(offset_ + index*4);
+    uint32_t limit = DecodeFixed32(offset_ + index*4 + 4);
+    if (start <= limit && limit <= static_cast<size_t>(offset_ - data_)) {
+      Slice filter = Slice(data_ + start, limit - start);
+      return policy_->KeyMayMatch(key, filter);
+    } else if (start == limit) {
+      // Empty filters do not match any keys
+      return false;
+    }
+  }
+  return true;  // Errors are treated as potential matches
+}
+
+}
diff --git a/depend/zcash/src/leveldb/table/filter_block.h b/depend/zcash/src/leveldb/table/filter_block.h
new file mode 100644
index 000000000..c67d010bd
--- /dev/null
+++ b/depend/zcash/src/leveldb/table/filter_block.h
@@ -0,0 +1,68 @@
+// Copyright (c) 2012 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// A filter block is stored near the end of a Table file.  It contains
+// filters (e.g., bloom filters) for all data blocks in the table combined
+// into a single filter block.
+
+#ifndef STORAGE_LEVELDB_TABLE_FILTER_BLOCK_H_
+#define STORAGE_LEVELDB_TABLE_FILTER_BLOCK_H_
+
+#include <stddef.h>
+#include <stdint.h>
+#include <string>
+#include <vector>
+#include "leveldb/slice.h"
+#include "util/hash.h"
+
+namespace leveldb {
+
+class FilterPolicy;
+
+// A FilterBlockBuilder is used to construct all of the filters for a
+// particular Table.  It generates a single string which is stored as
+// a special block in the Table.
+//
+// The sequence of calls to FilterBlockBuilder must match the regexp:
+//      (StartBlock AddKey*)* Finish
+class FilterBlockBuilder {
+ public:
+  explicit FilterBlockBuilder(const FilterPolicy*);
+
+  void StartBlock(uint64_t block_offset);
+  void AddKey(const Slice& key);
+  Slice Finish();
+
+ private:
+  void GenerateFilter();
+
+  const FilterPolicy* policy_;
+  std::string keys_;              // Flattened key contents
+  std::vector<size_t> start_;     // Starting index in keys_ of each key
+  std::string result_;            // Filter data computed so far
+  std::vector<Slice> tmp_keys_;   // policy_->CreateFilter() argument
+  std::vector<uint32_t> filter_offsets_;
+
+  // No copying allowed
+  FilterBlockBuilder(const FilterBlockBuilder&);
+  void operator=(const FilterBlockBuilder&);
+};
+
+class FilterBlockReader {
+ public:
+ // REQUIRES: "contents" and *policy must stay live while *this is live.
+  FilterBlockReader(const FilterPolicy* policy, const Slice& contents);
+  bool KeyMayMatch(uint64_t block_offset, const Slice& key);
+
+ private:
+  const FilterPolicy* policy_;
+  const char* data_;    // Pointer to filter data (at block-start)
+  const char* offset_;  // Pointer to beginning of offset array (at block-end)
+  size_t num_;          // Number of entries in offset array
+  size_t base_lg_;      // Encoding parameter (see kFilterBaseLg in .cc file)
+};
+
+}
+
+#endif  // STORAGE_LEVELDB_TABLE_FILTER_BLOCK_H_
diff --git a/depend/zcash/src/leveldb/table/filter_block_test.cc b/depend/zcash/src/leveldb/table/filter_block_test.cc
new file mode 100644
index 000000000..8c4a4741f
--- /dev/null
+++ b/depend/zcash/src/leveldb/table/filter_block_test.cc
@@ -0,0 +1,128 @@
+// Copyright (c) 2012 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "table/filter_block.h"
+
+#include "leveldb/filter_policy.h"
+#include "util/coding.h"
+#include "util/hash.h"
+#include "util/logging.h"
+#include "util/testharness.h"
+#include "util/testutil.h"
+
+namespace leveldb {
+
+// For testing: emit an array with one hash value per key
+class TestHashFilter : public FilterPolicy {
+ public:
+  virtual const char* Name() const {
+    return "TestHashFilter";
+  }
+
+  virtual void CreateFilter(const Slice* keys, int n, std::string* dst) const {
+    for (int i = 0; i < n; i++) {
+      uint32_t h = Hash(keys[i].data(), keys[i].size(), 1);
+      PutFixed32(dst, h);
+    }
+  }
+
+  virtual bool KeyMayMatch(const Slice& key, const Slice& filter) const {
+    uint32_t h = Hash(key.data(), key.size(), 1);
+    for (size_t i = 0; i + 4 <= filter.size(); i += 4) {
+      if (h == DecodeFixed32(filter.data() + i)) {
+        return true;
+      }
+    }
+    return false;
+  }
+};
+
+class FilterBlockTest {
+ public:
+  TestHashFilter policy_;
+};
+
+TEST(FilterBlockTest, EmptyBuilder) {
+  FilterBlockBuilder builder(&policy_);
+  Slice block = builder.Finish();
+  ASSERT_EQ("\\x00\\x00\\x00\\x00\\x0b", EscapeString(block));
+  FilterBlockReader reader(&policy_, block);
+  ASSERT_TRUE(reader.KeyMayMatch(0, "foo"));
+  ASSERT_TRUE(reader.KeyMayMatch(100000, "foo"));
+}
+
+TEST(FilterBlockTest, SingleChunk) {
+  FilterBlockBuilder builder(&policy_);
+  builder.StartBlock(100);
+  builder.AddKey("foo");
+  builder.AddKey("bar");
+  builder.AddKey("box");
+  builder.StartBlock(200);
+  builder.AddKey("box");
+  builder.StartBlock(300);
+  builder.AddKey("hello");
+  Slice block = builder.Finish();
+  FilterBlockReader reader(&policy_, block);
+  ASSERT_TRUE(reader.KeyMayMatch(100, "foo"));
+  ASSERT_TRUE(reader.KeyMayMatch(100, "bar"));
+  ASSERT_TRUE(reader.KeyMayMatch(100, "box"));
+  ASSERT_TRUE(reader.KeyMayMatch(100, "hello"));
+  ASSERT_TRUE(reader.KeyMayMatch(100, "foo"));
+  ASSERT_TRUE(! reader.KeyMayMatch(100, "missing"));
+  ASSERT_TRUE(! reader.KeyMayMatch(100, "other"));
+}
+
+TEST(FilterBlockTest, MultiChunk) {
+  FilterBlockBuilder builder(&policy_);
+
+  // First filter
+  builder.StartBlock(0);
+  builder.AddKey("foo");
+  builder.StartBlock(2000);
+  builder.AddKey("bar");
+
+  // Second filter
+  builder.StartBlock(3100);
+  builder.AddKey("box");
+
+  // Third filter is empty
+
+  // Last filter
+  builder.StartBlock(9000);
+  builder.AddKey("box");
+  builder.AddKey("hello");
+
+  Slice block = builder.Finish();
+  FilterBlockReader reader(&policy_, block);
+
+  // Check first filter
+  ASSERT_TRUE(reader.KeyMayMatch(0, "foo"));
+  ASSERT_TRUE(reader.KeyMayMatch(2000, "bar"));
+  ASSERT_TRUE(! reader.KeyMayMatch(0, "box"));
+  ASSERT_TRUE(! reader.KeyMayMatch(0, "hello"));
+
+  // Check second filter
+  ASSERT_TRUE(reader.KeyMayMatch(3100, "box"));
+  ASSERT_TRUE(! reader.KeyMayMatch(3100, "foo"));
+  ASSERT_TRUE(! reader.KeyMayMatch(3100, "bar"));
+  ASSERT_TRUE(! reader.KeyMayMatch(3100, "hello"));
+
+  // Check third filter (empty)
+  ASSERT_TRUE(! reader.KeyMayMatch(4100, "foo"));
+  ASSERT_TRUE(! reader.KeyMayMatch(4100, "bar"));
+  ASSERT_TRUE(! reader.KeyMayMatch(4100, "box"));
+  ASSERT_TRUE(! reader.KeyMayMatch(4100, "hello"));
+
+  // Check last filter
+  ASSERT_TRUE(reader.KeyMayMatch(9000, "box"));
+  ASSERT_TRUE(reader.KeyMayMatch(9000, "hello"));
+  ASSERT_TRUE(! reader.KeyMayMatch(9000, "foo"));
+  ASSERT_TRUE(! reader.KeyMayMatch(9000, "bar"));
+}
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/table/format.cc b/depend/zcash/src/leveldb/table/format.cc
new file mode 100644
index 000000000..285e1c0de
--- /dev/null
+++ b/depend/zcash/src/leveldb/table/format.cc
@@ -0,0 +1,144 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "table/format.h"
+
+#include "leveldb/env.h"
+#include "port/port.h"
+#include "table/block.h"
+#include "util/coding.h"
+#include "util/crc32c.h"
+
+namespace leveldb {
+
+void BlockHandle::EncodeTo(std::string* dst) const {
+  // Sanity check that all fields have been set
+  assert(offset_ != ~static_cast<uint64_t>(0));
+  assert(size_ != ~static_cast<uint64_t>(0));
+  PutVarint64(dst, offset_);
+  PutVarint64(dst, size_);
+}
+
+Status BlockHandle::DecodeFrom(Slice* input) {
+  if (GetVarint64(input, &offset_) &&
+      GetVarint64(input, &size_)) {
+    return Status::OK();
+  } else {
+    return Status::Corruption("bad block handle");
+  }
+}
+
+void Footer::EncodeTo(std::string* dst) const {
+  const size_t original_size = dst->size();
+  metaindex_handle_.EncodeTo(dst);
+  index_handle_.EncodeTo(dst);
+  dst->resize(2 * BlockHandle::kMaxEncodedLength);  // Padding
+  PutFixed32(dst, static_cast<uint32_t>(kTableMagicNumber & 0xffffffffu));
+  PutFixed32(dst, static_cast<uint32_t>(kTableMagicNumber >> 32));
+  assert(dst->size() == original_size + kEncodedLength);
+  (void)original_size;  // Disable unused variable warning.
+}
+
+Status Footer::DecodeFrom(Slice* input) {
+  const char* magic_ptr = input->data() + kEncodedLength - 8;
+  const uint32_t magic_lo = DecodeFixed32(magic_ptr);
+  const uint32_t magic_hi = DecodeFixed32(magic_ptr + 4);
+  const uint64_t magic = ((static_cast<uint64_t>(magic_hi) << 32) |
+                          (static_cast<uint64_t>(magic_lo)));
+  if (magic != kTableMagicNumber) {
+    return Status::Corruption("not an sstable (bad magic number)");
+  }
+
+  Status result = metaindex_handle_.DecodeFrom(input);
+  if (result.ok()) {
+    result = index_handle_.DecodeFrom(input);
+  }
+  if (result.ok()) {
+    // We skip over any leftover data (just padding for now) in "input"
+    const char* end = magic_ptr + 8;
+    *input = Slice(end, input->data() + input->size() - end);
+  }
+  return result;
+}
+
+Status ReadBlock(RandomAccessFile* file,
+                 const ReadOptions& options,
+                 const BlockHandle& handle,
+                 BlockContents* result) {
+  result->data = Slice();
+  result->cachable = false;
+  result->heap_allocated = false;
+
+  // Read the block contents as well as the type/crc footer.
+  // See table_builder.cc for the code that built this structure.
+  size_t n = static_cast<size_t>(handle.size());
+  char* buf = new char[n + kBlockTrailerSize];
+  Slice contents;
+  Status s = file->Read(handle.offset(), n + kBlockTrailerSize, &contents, buf);
+  if (!s.ok()) {
+    delete[] buf;
+    return s;
+  }
+  if (contents.size() != n + kBlockTrailerSize) {
+    delete[] buf;
+    return Status::Corruption("truncated block read", file->GetName());
+  }
+
+  // Check the crc of the type and the block contents
+  const char* data = contents.data();    // Pointer to where Read put the data
+  if (options.verify_checksums) {
+    const uint32_t crc = crc32c::Unmask(DecodeFixed32(data + n + 1));
+    const uint32_t actual = crc32c::Value(data, n + 1);
+    if (actual != crc) {
+      delete[] buf;
+      s = Status::Corruption("block checksum mismatch", file->GetName());
+      return s;
+    }
+  }
+
+  switch (data[n]) {
+    case kNoCompression:
+      if (data != buf) {
+        // File implementation gave us pointer to some other data.
+        // Use it directly under the assumption that it will be live
+        // while the file is open.
+        delete[] buf;
+        result->data = Slice(data, n);
+        result->heap_allocated = false;
+        result->cachable = false;  // Do not double-cache
+      } else {
+        result->data = Slice(buf, n);
+        result->heap_allocated = true;
+        result->cachable = true;
+      }
+
+      // Ok
+      break;
+    case kSnappyCompression: {
+      size_t ulength = 0;
+      if (!port::Snappy_GetUncompressedLength(data, n, &ulength)) {
+        delete[] buf;
+        return Status::Corruption("corrupted compressed block contents", file->GetName());
+      }
+      char* ubuf = new char[ulength];
+      if (!port::Snappy_Uncompress(data, n, ubuf)) {
+        delete[] buf;
+        delete[] ubuf;
+        return Status::Corruption("corrupted compressed block contents", file->GetName());
+      }
+      delete[] buf;
+      result->data = Slice(ubuf, ulength);
+      result->heap_allocated = true;
+      result->cachable = true;
+      break;
+    }
+    default:
+      delete[] buf;
+      return Status::Corruption("bad block type", file->GetName());
+  }
+
+  return Status::OK();
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/table/format.h b/depend/zcash/src/leveldb/table/format.h
new file mode 100644
index 000000000..6c0b80c01
--- /dev/null
+++ b/depend/zcash/src/leveldb/table/format.h
@@ -0,0 +1,108 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_TABLE_FORMAT_H_
+#define STORAGE_LEVELDB_TABLE_FORMAT_H_
+
+#include <string>
+#include <stdint.h>
+#include "leveldb/slice.h"
+#include "leveldb/status.h"
+#include "leveldb/table_builder.h"
+
+namespace leveldb {
+
+class Block;
+class RandomAccessFile;
+struct ReadOptions;
+
+// BlockHandle is a pointer to the extent of a file that stores a data
+// block or a meta block.
+class BlockHandle {
+ public:
+  BlockHandle();
+
+  // The offset of the block in the file.
+  uint64_t offset() const { return offset_; }
+  void set_offset(uint64_t offset) { offset_ = offset; }
+
+  // The size of the stored block
+  uint64_t size() const { return size_; }
+  void set_size(uint64_t size) { size_ = size; }
+
+  void EncodeTo(std::string* dst) const;
+  Status DecodeFrom(Slice* input);
+
+  // Maximum encoding length of a BlockHandle
+  enum { kMaxEncodedLength = 10 + 10 };
+
+ private:
+  uint64_t offset_;
+  uint64_t size_;
+};
+
+// Footer encapsulates the fixed information stored at the tail
+// end of every table file.
+class Footer {
+ public:
+  Footer() { }
+
+  // The block handle for the metaindex block of the table
+  const BlockHandle& metaindex_handle() const { return metaindex_handle_; }
+  void set_metaindex_handle(const BlockHandle& h) { metaindex_handle_ = h; }
+
+  // The block handle for the index block of the table
+  const BlockHandle& index_handle() const {
+    return index_handle_;
+  }
+  void set_index_handle(const BlockHandle& h) {
+    index_handle_ = h;
+  }
+
+  void EncodeTo(std::string* dst) const;
+  Status DecodeFrom(Slice* input);
+
+  // Encoded length of a Footer.  Note that the serialization of a
+  // Footer will always occupy exactly this many bytes.  It consists
+  // of two block handles and a magic number.
+  enum {
+    kEncodedLength = 2*BlockHandle::kMaxEncodedLength + 8
+  };
+
+ private:
+  BlockHandle metaindex_handle_;
+  BlockHandle index_handle_;
+};
+
+// kTableMagicNumber was picked by running
+//    echo http://code.google.com/p/leveldb/ | sha1sum
+// and taking the leading 64 bits.
+static const uint64_t kTableMagicNumber = 0xdb4775248b80fb57ull;
+
+// 1-byte type + 32-bit crc
+static const size_t kBlockTrailerSize = 5;
+
+struct BlockContents {
+  Slice data;           // Actual contents of data
+  bool cachable;        // True iff data can be cached
+  bool heap_allocated;  // True iff caller should delete[] data.data()
+};
+
+// Read the block identified by "handle" from "file".  On failure
+// return non-OK.  On success fill *result and return OK.
+extern Status ReadBlock(RandomAccessFile* file,
+                        const ReadOptions& options,
+                        const BlockHandle& handle,
+                        BlockContents* result);
+
+// Implementation details follow.  Clients should ignore,
+
+inline BlockHandle::BlockHandle()
+    : offset_(~static_cast<uint64_t>(0)),
+      size_(~static_cast<uint64_t>(0)) {
+}
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_TABLE_FORMAT_H_
diff --git a/depend/zcash/src/leveldb/table/iterator.cc b/depend/zcash/src/leveldb/table/iterator.cc
new file mode 100644
index 000000000..3d1c87fde
--- /dev/null
+++ b/depend/zcash/src/leveldb/table/iterator.cc
@@ -0,0 +1,67 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "leveldb/iterator.h"
+
+namespace leveldb {
+
+Iterator::Iterator() {
+  cleanup_.function = NULL;
+  cleanup_.next = NULL;
+}
+
+Iterator::~Iterator() {
+  if (cleanup_.function != NULL) {
+    (*cleanup_.function)(cleanup_.arg1, cleanup_.arg2);
+    for (Cleanup* c = cleanup_.next; c != NULL; ) {
+      (*c->function)(c->arg1, c->arg2);
+      Cleanup* next = c->next;
+      delete c;
+      c = next;
+    }
+  }
+}
+
+void Iterator::RegisterCleanup(CleanupFunction func, void* arg1, void* arg2) {
+  assert(func != NULL);
+  Cleanup* c;
+  if (cleanup_.function == NULL) {
+    c = &cleanup_;
+  } else {
+    c = new Cleanup;
+    c->next = cleanup_.next;
+    cleanup_.next = c;
+  }
+  c->function = func;
+  c->arg1 = arg1;
+  c->arg2 = arg2;
+}
+
+namespace {
+class EmptyIterator : public Iterator {
+ public:
+  EmptyIterator(const Status& s) : status_(s) { }
+  virtual bool Valid() const { return false; }
+  virtual void Seek(const Slice& target) { }
+  virtual void SeekToFirst() { }
+  virtual void SeekToLast() { }
+  virtual void Next() { assert(false); }
+  virtual void Prev() { assert(false); }
+  Slice key() const { assert(false); return Slice(); }
+  Slice value() const { assert(false); return Slice(); }
+  virtual Status status() const { return status_; }
+ private:
+  Status status_;
+};
+}  // namespace
+
+Iterator* NewEmptyIterator() {
+  return new EmptyIterator(Status::OK());
+}
+
+Iterator* NewErrorIterator(const Status& status) {
+  return new EmptyIterator(status);
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/table/iterator_wrapper.h b/depend/zcash/src/leveldb/table/iterator_wrapper.h
new file mode 100644
index 000000000..f410c3fab
--- /dev/null
+++ b/depend/zcash/src/leveldb/table/iterator_wrapper.h
@@ -0,0 +1,66 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_TABLE_ITERATOR_WRAPPER_H_
+#define STORAGE_LEVELDB_TABLE_ITERATOR_WRAPPER_H_
+
+#include "leveldb/iterator.h"
+#include "leveldb/slice.h"
+
+namespace leveldb {
+
+// A internal wrapper class with an interface similar to Iterator that
+// caches the valid() and key() results for an underlying iterator.
+// This can help avoid virtual function calls and also gives better
+// cache locality.
+class IteratorWrapper {
+ public:
+  IteratorWrapper(): iter_(NULL), valid_(false) { }
+  explicit IteratorWrapper(Iterator* iter): iter_(NULL) {
+    Set(iter);
+  }
+  ~IteratorWrapper() { delete iter_; }
+  Iterator* iter() const { return iter_; }
+
+  // Takes ownership of "iter" and will delete it when destroyed, or
+  // when Set() is invoked again.
+  void Set(Iterator* iter) {
+    delete iter_;
+    iter_ = iter;
+    if (iter_ == NULL) {
+      valid_ = false;
+    } else {
+      Update();
+    }
+  }
+
+
+  // Iterator interface methods
+  bool Valid() const        { return valid_; }
+  Slice key() const         { assert(Valid()); return key_; }
+  Slice value() const       { assert(Valid()); return iter_->value(); }
+  // Methods below require iter() != NULL
+  Status status() const     { assert(iter_); return iter_->status(); }
+  void Next()               { assert(iter_); iter_->Next();        Update(); }
+  void Prev()               { assert(iter_); iter_->Prev();        Update(); }
+  void Seek(const Slice& k) { assert(iter_); iter_->Seek(k);       Update(); }
+  void SeekToFirst()        { assert(iter_); iter_->SeekToFirst(); Update(); }
+  void SeekToLast()         { assert(iter_); iter_->SeekToLast();  Update(); }
+
+ private:
+  void Update() {
+    valid_ = iter_->Valid();
+    if (valid_) {
+      key_ = iter_->key();
+    }
+  }
+
+  Iterator* iter_;
+  bool valid_;
+  Slice key_;
+};
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_TABLE_ITERATOR_WRAPPER_H_
diff --git a/depend/zcash/src/leveldb/table/merger.cc b/depend/zcash/src/leveldb/table/merger.cc
new file mode 100644
index 000000000..2dde4dc21
--- /dev/null
+++ b/depend/zcash/src/leveldb/table/merger.cc
@@ -0,0 +1,197 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "table/merger.h"
+
+#include "leveldb/comparator.h"
+#include "leveldb/iterator.h"
+#include "table/iterator_wrapper.h"
+
+namespace leveldb {
+
+namespace {
+class MergingIterator : public Iterator {
+ public:
+  MergingIterator(const Comparator* comparator, Iterator** children, int n)
+      : comparator_(comparator),
+        children_(new IteratorWrapper[n]),
+        n_(n),
+        current_(NULL),
+        direction_(kForward) {
+    for (int i = 0; i < n; i++) {
+      children_[i].Set(children[i]);
+    }
+  }
+
+  virtual ~MergingIterator() {
+    delete[] children_;
+  }
+
+  virtual bool Valid() const {
+    return (current_ != NULL);
+  }
+
+  virtual void SeekToFirst() {
+    for (int i = 0; i < n_; i++) {
+      children_[i].SeekToFirst();
+    }
+    FindSmallest();
+    direction_ = kForward;
+  }
+
+  virtual void SeekToLast() {
+    for (int i = 0; i < n_; i++) {
+      children_[i].SeekToLast();
+    }
+    FindLargest();
+    direction_ = kReverse;
+  }
+
+  virtual void Seek(const Slice& target) {
+    for (int i = 0; i < n_; i++) {
+      children_[i].Seek(target);
+    }
+    FindSmallest();
+    direction_ = kForward;
+  }
+
+  virtual void Next() {
+    assert(Valid());
+
+    // Ensure that all children are positioned after key().
+    // If we are moving in the forward direction, it is already
+    // true for all of the non-current_ children since current_ is
+    // the smallest child and key() == current_->key().  Otherwise,
+    // we explicitly position the non-current_ children.
+    if (direction_ != kForward) {
+      for (int i = 0; i < n_; i++) {
+        IteratorWrapper* child = &children_[i];
+        if (child != current_) {
+          child->Seek(key());
+          if (child->Valid() &&
+              comparator_->Compare(key(), child->key()) == 0) {
+            child->Next();
+          }
+        }
+      }
+      direction_ = kForward;
+    }
+
+    current_->Next();
+    FindSmallest();
+  }
+
+  virtual void Prev() {
+    assert(Valid());
+
+    // Ensure that all children are positioned before key().
+    // If we are moving in the reverse direction, it is already
+    // true for all of the non-current_ children since current_ is
+    // the largest child and key() == current_->key().  Otherwise,
+    // we explicitly position the non-current_ children.
+    if (direction_ != kReverse) {
+      for (int i = 0; i < n_; i++) {
+        IteratorWrapper* child = &children_[i];
+        if (child != current_) {
+          child->Seek(key());
+          if (child->Valid()) {
+            // Child is at first entry >= key().  Step back one to be < key()
+            child->Prev();
+          } else {
+            // Child has no entries >= key().  Position at last entry.
+            child->SeekToLast();
+          }
+        }
+      }
+      direction_ = kReverse;
+    }
+
+    current_->Prev();
+    FindLargest();
+  }
+
+  virtual Slice key() const {
+    assert(Valid());
+    return current_->key();
+  }
+
+  virtual Slice value() const {
+    assert(Valid());
+    return current_->value();
+  }
+
+  virtual Status status() const {
+    Status status;
+    for (int i = 0; i < n_; i++) {
+      status = children_[i].status();
+      if (!status.ok()) {
+        break;
+      }
+    }
+    return status;
+  }
+
+ private:
+  void FindSmallest();
+  void FindLargest();
+
+  // We might want to use a heap in case there are lots of children.
+  // For now we use a simple array since we expect a very small number
+  // of children in leveldb.
+  const Comparator* comparator_;
+  IteratorWrapper* children_;
+  int n_;
+  IteratorWrapper* current_;
+
+  // Which direction is the iterator moving?
+  enum Direction {
+    kForward,
+    kReverse
+  };
+  Direction direction_;
+};
+
+void MergingIterator::FindSmallest() {
+  IteratorWrapper* smallest = NULL;
+  for (int i = 0; i < n_; i++) {
+    IteratorWrapper* child = &children_[i];
+    if (child->Valid()) {
+      if (smallest == NULL) {
+        smallest = child;
+      } else if (comparator_->Compare(child->key(), smallest->key()) < 0) {
+        smallest = child;
+      }
+    }
+  }
+  current_ = smallest;
+}
+
+void MergingIterator::FindLargest() {
+  IteratorWrapper* largest = NULL;
+  for (int i = n_-1; i >= 0; i--) {
+    IteratorWrapper* child = &children_[i];
+    if (child->Valid()) {
+      if (largest == NULL) {
+        largest = child;
+      } else if (comparator_->Compare(child->key(), largest->key()) > 0) {
+        largest = child;
+      }
+    }
+  }
+  current_ = largest;
+}
+}  // namespace
+
+Iterator* NewMergingIterator(const Comparator* cmp, Iterator** list, int n) {
+  assert(n >= 0);
+  if (n == 0) {
+    return NewEmptyIterator();
+  } else if (n == 1) {
+    return list[0];
+  } else {
+    return new MergingIterator(cmp, list, n);
+  }
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/table/merger.h b/depend/zcash/src/leveldb/table/merger.h
new file mode 100644
index 000000000..91ddd80fa
--- /dev/null
+++ b/depend/zcash/src/leveldb/table/merger.h
@@ -0,0 +1,26 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_TABLE_MERGER_H_
+#define STORAGE_LEVELDB_TABLE_MERGER_H_
+
+namespace leveldb {
+
+class Comparator;
+class Iterator;
+
+// Return an iterator that provided the union of the data in
+// children[0,n-1].  Takes ownership of the child iterators and
+// will delete them when the result iterator is deleted.
+//
+// The result does no duplicate suppression.  I.e., if a particular
+// key is present in K child iterators, it will be yielded K times.
+//
+// REQUIRES: n >= 0
+extern Iterator* NewMergingIterator(
+    const Comparator* comparator, Iterator** children, int n);
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_TABLE_MERGER_H_
diff --git a/depend/zcash/src/leveldb/table/table.cc b/depend/zcash/src/leveldb/table/table.cc
new file mode 100644
index 000000000..decf8082c
--- /dev/null
+++ b/depend/zcash/src/leveldb/table/table.cc
@@ -0,0 +1,285 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "leveldb/table.h"
+
+#include "leveldb/cache.h"
+#include "leveldb/comparator.h"
+#include "leveldb/env.h"
+#include "leveldb/filter_policy.h"
+#include "leveldb/options.h"
+#include "table/block.h"
+#include "table/filter_block.h"
+#include "table/format.h"
+#include "table/two_level_iterator.h"
+#include "util/coding.h"
+
+namespace leveldb {
+
+struct Table::Rep {
+  ~Rep() {
+    delete filter;
+    delete [] filter_data;
+    delete index_block;
+  }
+
+  Options options;
+  Status status;
+  RandomAccessFile* file;
+  uint64_t cache_id;
+  FilterBlockReader* filter;
+  const char* filter_data;
+
+  BlockHandle metaindex_handle;  // Handle to metaindex_block: saved from footer
+  Block* index_block;
+};
+
+Status Table::Open(const Options& options,
+                   RandomAccessFile* file,
+                   uint64_t size,
+                   Table** table) {
+  *table = NULL;
+  if (size < Footer::kEncodedLength) {
+    return Status::Corruption("file is too short to be an sstable");
+  }
+
+  char footer_space[Footer::kEncodedLength];
+  Slice footer_input;
+  Status s = file->Read(size - Footer::kEncodedLength, Footer::kEncodedLength,
+                        &footer_input, footer_space);
+  if (!s.ok()) return s;
+
+  Footer footer;
+  s = footer.DecodeFrom(&footer_input);
+  if (!s.ok()) return s;
+
+  // Read the index block
+  BlockContents contents;
+  Block* index_block = NULL;
+  if (s.ok()) {
+    ReadOptions opt;
+    if (options.paranoid_checks) {
+      opt.verify_checksums = true;
+    }
+    s = ReadBlock(file, opt, footer.index_handle(), &contents);
+    if (s.ok()) {
+      index_block = new Block(contents);
+    }
+  }
+
+  if (s.ok()) {
+    // We've successfully read the footer and the index block: we're
+    // ready to serve requests.
+    Rep* rep = new Table::Rep;
+    rep->options = options;
+    rep->file = file;
+    rep->metaindex_handle = footer.metaindex_handle();
+    rep->index_block = index_block;
+    rep->cache_id = (options.block_cache ? options.block_cache->NewId() : 0);
+    rep->filter_data = NULL;
+    rep->filter = NULL;
+    *table = new Table(rep);
+    (*table)->ReadMeta(footer);
+  } else {
+    delete index_block;
+  }
+
+  return s;
+}
+
+void Table::ReadMeta(const Footer& footer) {
+  if (rep_->options.filter_policy == NULL) {
+    return;  // Do not need any metadata
+  }
+
+  // TODO(sanjay): Skip this if footer.metaindex_handle() size indicates
+  // it is an empty block.
+  ReadOptions opt;
+  if (rep_->options.paranoid_checks) {
+    opt.verify_checksums = true;
+  }
+  BlockContents contents;
+  if (!ReadBlock(rep_->file, opt, footer.metaindex_handle(), &contents).ok()) {
+    // Do not propagate errors since meta info is not needed for operation
+    return;
+  }
+  Block* meta = new Block(contents);
+
+  Iterator* iter = meta->NewIterator(BytewiseComparator());
+  std::string key = "filter.";
+  key.append(rep_->options.filter_policy->Name());
+  iter->Seek(key);
+  if (iter->Valid() && iter->key() == Slice(key)) {
+    ReadFilter(iter->value());
+  }
+  delete iter;
+  delete meta;
+}
+
+void Table::ReadFilter(const Slice& filter_handle_value) {
+  Slice v = filter_handle_value;
+  BlockHandle filter_handle;
+  if (!filter_handle.DecodeFrom(&v).ok()) {
+    return;
+  }
+
+  // We might want to unify with ReadBlock() if we start
+  // requiring checksum verification in Table::Open.
+  ReadOptions opt;
+  if (rep_->options.paranoid_checks) {
+    opt.verify_checksums = true;
+  }
+  BlockContents block;
+  if (!ReadBlock(rep_->file, opt, filter_handle, &block).ok()) {
+    return;
+  }
+  if (block.heap_allocated) {
+    rep_->filter_data = block.data.data();     // Will need to delete later
+  }
+  rep_->filter = new FilterBlockReader(rep_->options.filter_policy, block.data);
+}
+
+Table::~Table() {
+  delete rep_;
+}
+
+static void DeleteBlock(void* arg, void* ignored) {
+  delete reinterpret_cast<Block*>(arg);
+}
+
+static void DeleteCachedBlock(const Slice& key, void* value) {
+  Block* block = reinterpret_cast<Block*>(value);
+  delete block;
+}
+
+static void ReleaseBlock(void* arg, void* h) {
+  Cache* cache = reinterpret_cast<Cache*>(arg);
+  Cache::Handle* handle = reinterpret_cast<Cache::Handle*>(h);
+  cache->Release(handle);
+}
+
+// Convert an index iterator value (i.e., an encoded BlockHandle)
+// into an iterator over the contents of the corresponding block.
+Iterator* Table::BlockReader(void* arg,
+                             const ReadOptions& options,
+                             const Slice& index_value) {
+  Table* table = reinterpret_cast<Table*>(arg);
+  Cache* block_cache = table->rep_->options.block_cache;
+  Block* block = NULL;
+  Cache::Handle* cache_handle = NULL;
+
+  BlockHandle handle;
+  Slice input = index_value;
+  Status s = handle.DecodeFrom(&input);
+  // We intentionally allow extra stuff in index_value so that we
+  // can add more features in the future.
+
+  if (s.ok()) {
+    BlockContents contents;
+    if (block_cache != NULL) {
+      char cache_key_buffer[16];
+      EncodeFixed64(cache_key_buffer, table->rep_->cache_id);
+      EncodeFixed64(cache_key_buffer+8, handle.offset());
+      Slice key(cache_key_buffer, sizeof(cache_key_buffer));
+      cache_handle = block_cache->Lookup(key);
+      if (cache_handle != NULL) {
+        block = reinterpret_cast<Block*>(block_cache->Value(cache_handle));
+      } else {
+        s = ReadBlock(table->rep_->file, options, handle, &contents);
+        if (s.ok()) {
+          block = new Block(contents);
+          if (contents.cachable && options.fill_cache) {
+            cache_handle = block_cache->Insert(
+                key, block, block->size(), &DeleteCachedBlock);
+          }
+        }
+      }
+    } else {
+      s = ReadBlock(table->rep_->file, options, handle, &contents);
+      if (s.ok()) {
+        block = new Block(contents);
+      }
+    }
+  }
+
+  Iterator* iter;
+  if (block != NULL) {
+    iter = block->NewIterator(table->rep_->options.comparator);
+    if (cache_handle == NULL) {
+      iter->RegisterCleanup(&DeleteBlock, block, NULL);
+    } else {
+      iter->RegisterCleanup(&ReleaseBlock, block_cache, cache_handle);
+    }
+  } else {
+    iter = NewErrorIterator(s);
+  }
+  return iter;
+}
+
+Iterator* Table::NewIterator(const ReadOptions& options) const {
+  return NewTwoLevelIterator(
+      rep_->index_block->NewIterator(rep_->options.comparator),
+      &Table::BlockReader, const_cast<Table*>(this), options);
+}
+
+Status Table::InternalGet(const ReadOptions& options, const Slice& k,
+                          void* arg,
+                          void (*saver)(void*, const Slice&, const Slice&)) {
+  Status s;
+  Iterator* iiter = rep_->index_block->NewIterator(rep_->options.comparator);
+  iiter->Seek(k);
+  if (iiter->Valid()) {
+    Slice handle_value = iiter->value();
+    FilterBlockReader* filter = rep_->filter;
+    BlockHandle handle;
+    if (filter != NULL &&
+        handle.DecodeFrom(&handle_value).ok() &&
+        !filter->KeyMayMatch(handle.offset(), k)) {
+      // Not found
+    } else {
+      Iterator* block_iter = BlockReader(this, options, iiter->value());
+      block_iter->Seek(k);
+      if (block_iter->Valid()) {
+        (*saver)(arg, block_iter->key(), block_iter->value());
+      }
+      s = block_iter->status();
+      delete block_iter;
+    }
+  }
+  if (s.ok()) {
+    s = iiter->status();
+  }
+  delete iiter;
+  return s;
+}
+
+
+uint64_t Table::ApproximateOffsetOf(const Slice& key) const {
+  Iterator* index_iter =
+      rep_->index_block->NewIterator(rep_->options.comparator);
+  index_iter->Seek(key);
+  uint64_t result;
+  if (index_iter->Valid()) {
+    BlockHandle handle;
+    Slice input = index_iter->value();
+    Status s = handle.DecodeFrom(&input);
+    if (s.ok()) {
+      result = handle.offset();
+    } else {
+      // Strange: we can't decode the block handle in the index block.
+      // We'll just return the offset of the metaindex block, which is
+      // close to the whole file size for this case.
+      result = rep_->metaindex_handle.offset();
+    }
+  } else {
+    // key is past the last key in the file.  Approximate the offset
+    // by returning the offset of the metaindex block (which is
+    // right near the end of the file).
+    result = rep_->metaindex_handle.offset();
+  }
+  delete index_iter;
+  return result;
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/table/table_builder.cc b/depend/zcash/src/leveldb/table/table_builder.cc
new file mode 100644
index 000000000..62002c84f
--- /dev/null
+++ b/depend/zcash/src/leveldb/table/table_builder.cc
@@ -0,0 +1,270 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "leveldb/table_builder.h"
+
+#include <assert.h>
+#include "leveldb/comparator.h"
+#include "leveldb/env.h"
+#include "leveldb/filter_policy.h"
+#include "leveldb/options.h"
+#include "table/block_builder.h"
+#include "table/filter_block.h"
+#include "table/format.h"
+#include "util/coding.h"
+#include "util/crc32c.h"
+
+namespace leveldb {
+
+struct TableBuilder::Rep {
+  Options options;
+  Options index_block_options;
+  WritableFile* file;
+  uint64_t offset;
+  Status status;
+  BlockBuilder data_block;
+  BlockBuilder index_block;
+  std::string last_key;
+  int64_t num_entries;
+  bool closed;          // Either Finish() or Abandon() has been called.
+  FilterBlockBuilder* filter_block;
+
+  // We do not emit the index entry for a block until we have seen the
+  // first key for the next data block.  This allows us to use shorter
+  // keys in the index block.  For example, consider a block boundary
+  // between the keys "the quick brown fox" and "the who".  We can use
+  // "the r" as the key for the index block entry since it is >= all
+  // entries in the first block and < all entries in subsequent
+  // blocks.
+  //
+  // Invariant: r->pending_index_entry is true only if data_block is empty.
+  bool pending_index_entry;
+  BlockHandle pending_handle;  // Handle to add to index block
+
+  std::string compressed_output;
+
+  Rep(const Options& opt, WritableFile* f)
+      : options(opt),
+        index_block_options(opt),
+        file(f),
+        offset(0),
+        data_block(&options),
+        index_block(&index_block_options),
+        num_entries(0),
+        closed(false),
+        filter_block(opt.filter_policy == NULL ? NULL
+                     : new FilterBlockBuilder(opt.filter_policy)),
+        pending_index_entry(false) {
+    index_block_options.block_restart_interval = 1;
+  }
+};
+
+TableBuilder::TableBuilder(const Options& options, WritableFile* file)
+    : rep_(new Rep(options, file)) {
+  if (rep_->filter_block != NULL) {
+    rep_->filter_block->StartBlock(0);
+  }
+}
+
+TableBuilder::~TableBuilder() {
+  assert(rep_->closed);  // Catch errors where caller forgot to call Finish()
+  delete rep_->filter_block;
+  delete rep_;
+}
+
+Status TableBuilder::ChangeOptions(const Options& options) {
+  // Note: if more fields are added to Options, update
+  // this function to catch changes that should not be allowed to
+  // change in the middle of building a Table.
+  if (options.comparator != rep_->options.comparator) {
+    return Status::InvalidArgument("changing comparator while building table");
+  }
+
+  // Note that any live BlockBuilders point to rep_->options and therefore
+  // will automatically pick up the updated options.
+  rep_->options = options;
+  rep_->index_block_options = options;
+  rep_->index_block_options.block_restart_interval = 1;
+  return Status::OK();
+}
+
+void TableBuilder::Add(const Slice& key, const Slice& value) {
+  Rep* r = rep_;
+  assert(!r->closed);
+  if (!ok()) return;
+  if (r->num_entries > 0) {
+    assert(r->options.comparator->Compare(key, Slice(r->last_key)) > 0);
+  }
+
+  if (r->pending_index_entry) {
+    assert(r->data_block.empty());
+    r->options.comparator->FindShortestSeparator(&r->last_key, key);
+    std::string handle_encoding;
+    r->pending_handle.EncodeTo(&handle_encoding);
+    r->index_block.Add(r->last_key, Slice(handle_encoding));
+    r->pending_index_entry = false;
+  }
+
+  if (r->filter_block != NULL) {
+    r->filter_block->AddKey(key);
+  }
+
+  r->last_key.assign(key.data(), key.size());
+  r->num_entries++;
+  r->data_block.Add(key, value);
+
+  const size_t estimated_block_size = r->data_block.CurrentSizeEstimate();
+  if (estimated_block_size >= r->options.block_size) {
+    Flush();
+  }
+}
+
+void TableBuilder::Flush() {
+  Rep* r = rep_;
+  assert(!r->closed);
+  if (!ok()) return;
+  if (r->data_block.empty()) return;
+  assert(!r->pending_index_entry);
+  WriteBlock(&r->data_block, &r->pending_handle);
+  if (ok()) {
+    r->pending_index_entry = true;
+    r->status = r->file->Flush();
+  }
+  if (r->filter_block != NULL) {
+    r->filter_block->StartBlock(r->offset);
+  }
+}
+
+void TableBuilder::WriteBlock(BlockBuilder* block, BlockHandle* handle) {
+  // File format contains a sequence of blocks where each block has:
+  //    block_data: uint8[n]
+  //    type: uint8
+  //    crc: uint32
+  assert(ok());
+  Rep* r = rep_;
+  Slice raw = block->Finish();
+
+  Slice block_contents;
+  CompressionType type = r->options.compression;
+  // TODO(postrelease): Support more compression options: zlib?
+  switch (type) {
+    case kNoCompression:
+      block_contents = raw;
+      break;
+
+    case kSnappyCompression: {
+      std::string* compressed = &r->compressed_output;
+      if (port::Snappy_Compress(raw.data(), raw.size(), compressed) &&
+          compressed->size() < raw.size() - (raw.size() / 8u)) {
+        block_contents = *compressed;
+      } else {
+        // Snappy not supported, or compressed less than 12.5%, so just
+        // store uncompressed form
+        block_contents = raw;
+        type = kNoCompression;
+      }
+      break;
+    }
+  }
+  WriteRawBlock(block_contents, type, handle);
+  r->compressed_output.clear();
+  block->Reset();
+}
+
+void TableBuilder::WriteRawBlock(const Slice& block_contents,
+                                 CompressionType type,
+                                 BlockHandle* handle) {
+  Rep* r = rep_;
+  handle->set_offset(r->offset);
+  handle->set_size(block_contents.size());
+  r->status = r->file->Append(block_contents);
+  if (r->status.ok()) {
+    char trailer[kBlockTrailerSize];
+    trailer[0] = type;
+    uint32_t crc = crc32c::Value(block_contents.data(), block_contents.size());
+    crc = crc32c::Extend(crc, trailer, 1);  // Extend crc to cover block type
+    EncodeFixed32(trailer+1, crc32c::Mask(crc));
+    r->status = r->file->Append(Slice(trailer, kBlockTrailerSize));
+    if (r->status.ok()) {
+      r->offset += block_contents.size() + kBlockTrailerSize;
+    }
+  }
+}
+
+Status TableBuilder::status() const {
+  return rep_->status;
+}
+
+Status TableBuilder::Finish() {
+  Rep* r = rep_;
+  Flush();
+  assert(!r->closed);
+  r->closed = true;
+
+  BlockHandle filter_block_handle, metaindex_block_handle, index_block_handle;
+
+  // Write filter block
+  if (ok() && r->filter_block != NULL) {
+    WriteRawBlock(r->filter_block->Finish(), kNoCompression,
+                  &filter_block_handle);
+  }
+
+  // Write metaindex block
+  if (ok()) {
+    BlockBuilder meta_index_block(&r->options);
+    if (r->filter_block != NULL) {
+      // Add mapping from "filter.Name" to location of filter data
+      std::string key = "filter.";
+      key.append(r->options.filter_policy->Name());
+      std::string handle_encoding;
+      filter_block_handle.EncodeTo(&handle_encoding);
+      meta_index_block.Add(key, handle_encoding);
+    }
+
+    // TODO(postrelease): Add stats and other meta blocks
+    WriteBlock(&meta_index_block, &metaindex_block_handle);
+  }
+
+  // Write index block
+  if (ok()) {
+    if (r->pending_index_entry) {
+      r->options.comparator->FindShortSuccessor(&r->last_key);
+      std::string handle_encoding;
+      r->pending_handle.EncodeTo(&handle_encoding);
+      r->index_block.Add(r->last_key, Slice(handle_encoding));
+      r->pending_index_entry = false;
+    }
+    WriteBlock(&r->index_block, &index_block_handle);
+  }
+
+  // Write footer
+  if (ok()) {
+    Footer footer;
+    footer.set_metaindex_handle(metaindex_block_handle);
+    footer.set_index_handle(index_block_handle);
+    std::string footer_encoding;
+    footer.EncodeTo(&footer_encoding);
+    r->status = r->file->Append(footer_encoding);
+    if (r->status.ok()) {
+      r->offset += footer_encoding.size();
+    }
+  }
+  return r->status;
+}
+
+void TableBuilder::Abandon() {
+  Rep* r = rep_;
+  assert(!r->closed);
+  r->closed = true;
+}
+
+uint64_t TableBuilder::NumEntries() const {
+  return rep_->num_entries;
+}
+
+uint64_t TableBuilder::FileSize() const {
+  return rep_->offset;
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/table/table_test.cc b/depend/zcash/src/leveldb/table/table_test.cc
new file mode 100644
index 000000000..abf6e246f
--- /dev/null
+++ b/depend/zcash/src/leveldb/table/table_test.cc
@@ -0,0 +1,876 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "leveldb/table.h"
+
+#include <map>
+#include <string>
+#include "db/dbformat.h"
+#include "db/memtable.h"
+#include "db/write_batch_internal.h"
+#include "leveldb/db.h"
+#include "leveldb/env.h"
+#include "leveldb/iterator.h"
+#include "leveldb/table_builder.h"
+#include "table/block.h"
+#include "table/block_builder.h"
+#include "table/format.h"
+#include "util/random.h"
+#include "util/testharness.h"
+#include "util/testutil.h"
+
+namespace leveldb {
+
+// Return reverse of "key".
+// Used to test non-lexicographic comparators.
+static std::string Reverse(const Slice& key) {
+  std::string str(key.ToString());
+  std::string rev("");
+  for (std::string::reverse_iterator rit = str.rbegin();
+       rit != str.rend(); ++rit) {
+    rev.push_back(*rit);
+  }
+  return rev;
+}
+
+namespace {
+class ReverseKeyComparator : public Comparator {
+ public:
+  virtual const char* Name() const {
+    return "leveldb.ReverseBytewiseComparator";
+  }
+
+  virtual int Compare(const Slice& a, const Slice& b) const {
+    return BytewiseComparator()->Compare(Reverse(a), Reverse(b));
+  }
+
+  virtual void FindShortestSeparator(
+      std::string* start,
+      const Slice& limit) const {
+    std::string s = Reverse(*start);
+    std::string l = Reverse(limit);
+    BytewiseComparator()->FindShortestSeparator(&s, l);
+    *start = Reverse(s);
+  }
+
+  virtual void FindShortSuccessor(std::string* key) const {
+    std::string s = Reverse(*key);
+    BytewiseComparator()->FindShortSuccessor(&s);
+    *key = Reverse(s);
+  }
+};
+}  // namespace
+static ReverseKeyComparator reverse_key_comparator;
+
+static void Increment(const Comparator* cmp, std::string* key) {
+  if (cmp == BytewiseComparator()) {
+    key->push_back('\0');
+  } else {
+    assert(cmp == &reverse_key_comparator);
+    std::string rev = Reverse(*key);
+    rev.push_back('\0');
+    *key = Reverse(rev);
+  }
+}
+
+// An STL comparator that uses a Comparator
+namespace {
+struct STLLessThan {
+  const Comparator* cmp;
+
+  STLLessThan() : cmp(BytewiseComparator()) { }
+  STLLessThan(const Comparator* c) : cmp(c) { }
+  bool operator()(const std::string& a, const std::string& b) const {
+    return cmp->Compare(Slice(a), Slice(b)) < 0;
+  }
+};
+}  // namespace
+
+class StringSink: public WritableFile {
+ public:
+  ~StringSink() { }
+
+  const std::string& contents() const { return contents_; }
+
+  virtual Status Close() { return Status::OK(); }
+  virtual Status Flush() { return Status::OK(); }
+  virtual Status Sync() { return Status::OK(); }
+
+  virtual Status Append(const Slice& data) {
+    contents_.append(data.data(), data.size());
+    return Status::OK();
+  }
+
+ private:
+  std::string contents_;
+};
+
+
+class StringSource: public RandomAccessFile {
+ public:
+  StringSource(const Slice& contents)
+      : contents_(contents.data(), contents.size()) {
+  }
+
+  virtual ~StringSource() { }
+
+  uint64_t Size() const { return contents_.size(); }
+
+  virtual Status Read(uint64_t offset, size_t n, Slice* result,
+                       char* scratch) const {
+    if (offset > contents_.size()) {
+      return Status::InvalidArgument("invalid Read offset");
+    }
+    if (offset + n > contents_.size()) {
+      n = contents_.size() - offset;
+    }
+    memcpy(scratch, &contents_[offset], n);
+    *result = Slice(scratch, n);
+    return Status::OK();
+  }
+
+ private:
+  std::string contents_;
+};
+
+typedef std::map<std::string, std::string, STLLessThan> KVMap;
+
+// Helper class for tests to unify the interface between
+// BlockBuilder/TableBuilder and Block/Table.
+class Constructor {
+ public:
+  explicit Constructor(const Comparator* cmp) : data_(STLLessThan(cmp)) { }
+  virtual ~Constructor() { }
+
+  void Add(const std::string& key, const Slice& value) {
+    data_[key] = value.ToString();
+  }
+
+  // Finish constructing the data structure with all the keys that have
+  // been added so far.  Returns the keys in sorted order in "*keys"
+  // and stores the key/value pairs in "*kvmap"
+  void Finish(const Options& options,
+              std::vector<std::string>* keys,
+              KVMap* kvmap) {
+    *kvmap = data_;
+    keys->clear();
+    for (KVMap::const_iterator it = data_.begin();
+         it != data_.end();
+         ++it) {
+      keys->push_back(it->first);
+    }
+    data_.clear();
+    Status s = FinishImpl(options, *kvmap);
+    ASSERT_TRUE(s.ok()) << s.ToString();
+  }
+
+  // Construct the data structure from the data in "data"
+  virtual Status FinishImpl(const Options& options, const KVMap& data) = 0;
+
+  virtual Iterator* NewIterator() const = 0;
+
+  virtual const KVMap& data() { return data_; }
+
+  virtual DB* db() const { return NULL; }  // Overridden in DBConstructor
+
+ private:
+  KVMap data_;
+};
+
+class BlockConstructor: public Constructor {
+ public:
+  explicit BlockConstructor(const Comparator* cmp)
+      : Constructor(cmp),
+        comparator_(cmp),
+        block_(NULL) { }
+  ~BlockConstructor() {
+    delete block_;
+  }
+  virtual Status FinishImpl(const Options& options, const KVMap& data) {
+    delete block_;
+    block_ = NULL;
+    BlockBuilder builder(&options);
+
+    for (KVMap::const_iterator it = data.begin();
+         it != data.end();
+         ++it) {
+      builder.Add(it->first, it->second);
+    }
+    // Open the block
+    data_ = builder.Finish().ToString();
+    BlockContents contents;
+    contents.data = data_;
+    contents.cachable = false;
+    contents.heap_allocated = false;
+    block_ = new Block(contents);
+    return Status::OK();
+  }
+  virtual Iterator* NewIterator() const {
+    return block_->NewIterator(comparator_);
+  }
+
+ private:
+  const Comparator* comparator_;
+  std::string data_;
+  Block* block_;
+
+  BlockConstructor();
+};
+
+class TableConstructor: public Constructor {
+ public:
+  TableConstructor(const Comparator* cmp)
+      : Constructor(cmp),
+        source_(NULL), table_(NULL) {
+  }
+  ~TableConstructor() {
+    Reset();
+  }
+  virtual Status FinishImpl(const Options& options, const KVMap& data) {
+    Reset();
+    StringSink sink;
+    TableBuilder builder(options, &sink);
+
+    for (KVMap::const_iterator it = data.begin();
+         it != data.end();
+         ++it) {
+      builder.Add(it->first, it->second);
+      ASSERT_TRUE(builder.status().ok());
+    }
+    Status s = builder.Finish();
+    ASSERT_TRUE(s.ok()) << s.ToString();
+
+    ASSERT_EQ(sink.contents().size(), builder.FileSize());
+
+    // Open the table
+    source_ = new StringSource(sink.contents());
+    Options table_options;
+    table_options.comparator = options.comparator;
+    return Table::Open(table_options, source_, sink.contents().size(), &table_);
+  }
+
+  virtual Iterator* NewIterator() const {
+    return table_->NewIterator(ReadOptions());
+  }
+
+  uint64_t ApproximateOffsetOf(const Slice& key) const {
+    return table_->ApproximateOffsetOf(key);
+  }
+
+ private:
+  void Reset() {
+    delete table_;
+    delete source_;
+    table_ = NULL;
+    source_ = NULL;
+  }
+
+  StringSource* source_;
+  Table* table_;
+
+  TableConstructor();
+};
+
+// A helper class that converts internal format keys into user keys
+class KeyConvertingIterator: public Iterator {
+ public:
+  explicit KeyConvertingIterator(Iterator* iter) : iter_(iter) { }
+  virtual ~KeyConvertingIterator() { delete iter_; }
+  virtual bool Valid() const { return iter_->Valid(); }
+  virtual void Seek(const Slice& target) {
+    ParsedInternalKey ikey(target, kMaxSequenceNumber, kTypeValue);
+    std::string encoded;
+    AppendInternalKey(&encoded, ikey);
+    iter_->Seek(encoded);
+  }
+  virtual void SeekToFirst() { iter_->SeekToFirst(); }
+  virtual void SeekToLast() { iter_->SeekToLast(); }
+  virtual void Next() { iter_->Next(); }
+  virtual void Prev() { iter_->Prev(); }
+
+  virtual Slice key() const {
+    assert(Valid());
+    ParsedInternalKey key;
+    if (!ParseInternalKey(iter_->key(), &key)) {
+      status_ = Status::Corruption("malformed internal key");
+      return Slice("corrupted key");
+    }
+    return key.user_key;
+  }
+
+  virtual Slice value() const { return iter_->value(); }
+  virtual Status status() const {
+    return status_.ok() ? iter_->status() : status_;
+  }
+
+ private:
+  mutable Status status_;
+  Iterator* iter_;
+
+  // No copying allowed
+  KeyConvertingIterator(const KeyConvertingIterator&);
+  void operator=(const KeyConvertingIterator&);
+};
+
+class MemTableConstructor: public Constructor {
+ public:
+  explicit MemTableConstructor(const Comparator* cmp)
+      : Constructor(cmp),
+        internal_comparator_(cmp) {
+    memtable_ = new MemTable(internal_comparator_);
+    memtable_->Ref();
+  }
+  ~MemTableConstructor() {
+    memtable_->Unref();
+  }
+  virtual Status FinishImpl(const Options& options, const KVMap& data) {
+    memtable_->Unref();
+    memtable_ = new MemTable(internal_comparator_);
+    memtable_->Ref();
+    int seq = 1;
+    for (KVMap::const_iterator it = data.begin();
+         it != data.end();
+         ++it) {
+      memtable_->Add(seq, kTypeValue, it->first, it->second);
+      seq++;
+    }
+    return Status::OK();
+  }
+  virtual Iterator* NewIterator() const {
+    return new KeyConvertingIterator(memtable_->NewIterator());
+  }
+
+ private:
+  InternalKeyComparator internal_comparator_;
+  MemTable* memtable_;
+};
+
+class DBConstructor: public Constructor {
+ public:
+  explicit DBConstructor(const Comparator* cmp)
+      : Constructor(cmp),
+        comparator_(cmp) {
+    db_ = NULL;
+    NewDB();
+  }
+  ~DBConstructor() {
+    delete db_;
+  }
+  virtual Status FinishImpl(const Options& options, const KVMap& data) {
+    delete db_;
+    db_ = NULL;
+    NewDB();
+    for (KVMap::const_iterator it = data.begin();
+         it != data.end();
+         ++it) {
+      WriteBatch batch;
+      batch.Put(it->first, it->second);
+      ASSERT_TRUE(db_->Write(WriteOptions(), &batch).ok());
+    }
+    return Status::OK();
+  }
+  virtual Iterator* NewIterator() const {
+    return db_->NewIterator(ReadOptions());
+  }
+
+  virtual DB* db() const { return db_; }
+
+ private:
+  void NewDB() {
+    std::string name = test::TmpDir() + "/table_testdb";
+
+    Options options;
+    options.comparator = comparator_;
+    Status status = DestroyDB(name, options);
+    ASSERT_TRUE(status.ok()) << status.ToString();
+
+    options.create_if_missing = true;
+    options.error_if_exists = true;
+    options.write_buffer_size = 10000;  // Something small to force merging
+    status = DB::Open(options, name, &db_);
+    ASSERT_TRUE(status.ok()) << status.ToString();
+  }
+
+  const Comparator* comparator_;
+  DB* db_;
+};
+
+enum TestType {
+  TABLE_TEST,
+  BLOCK_TEST,
+  MEMTABLE_TEST,
+  DB_TEST
+};
+
+struct TestArgs {
+  TestType type;
+  bool reverse_compare;
+  int restart_interval;
+};
+
+static const TestArgs kTestArgList[] = {
+  { TABLE_TEST, false, 16 },
+  { TABLE_TEST, false, 1 },
+  { TABLE_TEST, false, 1024 },
+  { TABLE_TEST, true, 16 },
+  { TABLE_TEST, true, 1 },
+  { TABLE_TEST, true, 1024 },
+
+  { BLOCK_TEST, false, 16 },
+  { BLOCK_TEST, false, 1 },
+  { BLOCK_TEST, false, 1024 },
+  { BLOCK_TEST, true, 16 },
+  { BLOCK_TEST, true, 1 },
+  { BLOCK_TEST, true, 1024 },
+
+  // Restart interval does not matter for memtables
+  { MEMTABLE_TEST, false, 16 },
+  { MEMTABLE_TEST, true, 16 },
+
+  // Do not bother with restart interval variations for DB
+  { DB_TEST, false, 16 },
+  { DB_TEST, true, 16 },
+};
+static const int kNumTestArgs = sizeof(kTestArgList) / sizeof(kTestArgList[0]);
+
+class Harness {
+ public:
+  Harness() : constructor_(NULL) { }
+
+  void Init(const TestArgs& args) {
+    delete constructor_;
+    constructor_ = NULL;
+    options_ = Options();
+
+    options_.block_restart_interval = args.restart_interval;
+    // Use shorter block size for tests to exercise block boundary
+    // conditions more.
+    options_.block_size = 256;
+    if (args.reverse_compare) {
+      options_.comparator = &reverse_key_comparator;
+    }
+    switch (args.type) {
+      case TABLE_TEST:
+        constructor_ = new TableConstructor(options_.comparator);
+        break;
+      case BLOCK_TEST:
+        constructor_ = new BlockConstructor(options_.comparator);
+        break;
+      case MEMTABLE_TEST:
+        constructor_ = new MemTableConstructor(options_.comparator);
+        break;
+      case DB_TEST:
+        constructor_ = new DBConstructor(options_.comparator);
+        break;
+    }
+  }
+
+  ~Harness() {
+    delete constructor_;
+  }
+
+  void Add(const std::string& key, const std::string& value) {
+    constructor_->Add(key, value);
+  }
+
+  void Test(Random* rnd) {
+    std::vector<std::string> keys;
+    KVMap data;
+    constructor_->Finish(options_, &keys, &data);
+
+    TestForwardScan(keys, data);
+    TestBackwardScan(keys, data);
+    TestRandomAccess(rnd, keys, data);
+  }
+
+  void TestForwardScan(const std::vector<std::string>& keys,
+                       const KVMap& data) {
+    Iterator* iter = constructor_->NewIterator();
+    ASSERT_TRUE(!iter->Valid());
+    iter->SeekToFirst();
+    for (KVMap::const_iterator model_iter = data.begin();
+         model_iter != data.end();
+         ++model_iter) {
+      ASSERT_EQ(ToString(data, model_iter), ToString(iter));
+      iter->Next();
+    }
+    ASSERT_TRUE(!iter->Valid());
+    delete iter;
+  }
+
+  void TestBackwardScan(const std::vector<std::string>& keys,
+                        const KVMap& data) {
+    Iterator* iter = constructor_->NewIterator();
+    ASSERT_TRUE(!iter->Valid());
+    iter->SeekToLast();
+    for (KVMap::const_reverse_iterator model_iter = data.rbegin();
+         model_iter != data.rend();
+         ++model_iter) {
+      ASSERT_EQ(ToString(data, model_iter), ToString(iter));
+      iter->Prev();
+    }
+    ASSERT_TRUE(!iter->Valid());
+    delete iter;
+  }
+
+  void TestRandomAccess(Random* rnd,
+                        const std::vector<std::string>& keys,
+                        const KVMap& data) {
+    static const bool kVerbose = false;
+    Iterator* iter = constructor_->NewIterator();
+    ASSERT_TRUE(!iter->Valid());
+    KVMap::const_iterator model_iter = data.begin();
+    if (kVerbose) fprintf(stderr, "---\n");
+    for (int i = 0; i < 200; i++) {
+      const int toss = rnd->Uniform(5);
+      switch (toss) {
+        case 0: {
+          if (iter->Valid()) {
+            if (kVerbose) fprintf(stderr, "Next\n");
+            iter->Next();
+            ++model_iter;
+            ASSERT_EQ(ToString(data, model_iter), ToString(iter));
+          }
+          break;
+        }
+
+        case 1: {
+          if (kVerbose) fprintf(stderr, "SeekToFirst\n");
+          iter->SeekToFirst();
+          model_iter = data.begin();
+          ASSERT_EQ(ToString(data, model_iter), ToString(iter));
+          break;
+        }
+
+        case 2: {
+          std::string key = PickRandomKey(rnd, keys);
+          model_iter = data.lower_bound(key);
+          if (kVerbose) fprintf(stderr, "Seek '%s'\n",
+                                EscapeString(key).c_str());
+          iter->Seek(Slice(key));
+          ASSERT_EQ(ToString(data, model_iter), ToString(iter));
+          break;
+        }
+
+        case 3: {
+          if (iter->Valid()) {
+            if (kVerbose) fprintf(stderr, "Prev\n");
+            iter->Prev();
+            if (model_iter == data.begin()) {
+              model_iter = data.end();   // Wrap around to invalid value
+            } else {
+              --model_iter;
+            }
+            ASSERT_EQ(ToString(data, model_iter), ToString(iter));
+          }
+          break;
+        }
+
+        case 4: {
+          if (kVerbose) fprintf(stderr, "SeekToLast\n");
+          iter->SeekToLast();
+          if (keys.empty()) {
+            model_iter = data.end();
+          } else {
+            std::string last = data.rbegin()->first;
+            model_iter = data.lower_bound(last);
+          }
+          ASSERT_EQ(ToString(data, model_iter), ToString(iter));
+          break;
+        }
+      }
+    }
+    delete iter;
+  }
+
+  std::string ToString(const KVMap& data, const KVMap::const_iterator& it) {
+    if (it == data.end()) {
+      return "END";
+    } else {
+      return "'" + it->first + "->" + it->second + "'";
+    }
+  }
+
+  std::string ToString(const KVMap& data,
+                       const KVMap::const_reverse_iterator& it) {
+    if (it == data.rend()) {
+      return "END";
+    } else {
+      return "'" + it->first + "->" + it->second + "'";
+    }
+  }
+
+  std::string ToString(const Iterator* it) {
+    if (!it->Valid()) {
+      return "END";
+    } else {
+      return "'" + it->key().ToString() + "->" + it->value().ToString() + "'";
+    }
+  }
+
+  std::string PickRandomKey(Random* rnd, const std::vector<std::string>& keys) {
+    if (keys.empty()) {
+      return "foo";
+    } else {
+      const int index = rnd->Uniform(keys.size());
+      std::string result = keys[index];
+      switch (rnd->Uniform(3)) {
+        case 0:
+          // Return an existing key
+          break;
+        case 1: {
+          // Attempt to return something smaller than an existing key
+          if (result.size() > 0 && result[result.size()-1] > '\0') {
+            result[result.size()-1]--;
+          }
+          break;
+        }
+        case 2: {
+          // Return something larger than an existing key
+          Increment(options_.comparator, &result);
+          break;
+        }
+      }
+      return result;
+    }
+  }
+
+  // Returns NULL if not running against a DB
+  DB* db() const { return constructor_->db(); }
+
+ private:
+  Options options_;
+  Constructor* constructor_;
+};
+
+// Test empty table/block.
+TEST(Harness, Empty) {
+  for (int i = 0; i < kNumTestArgs; i++) {
+    Init(kTestArgList[i]);
+    Random rnd(test::RandomSeed() + 1);
+    Test(&rnd);
+  }
+}
+
+// Special test for a block with no restart entries.  The C++ leveldb
+// code never generates such blocks, but the Java version of leveldb
+// seems to.
+TEST(Harness, ZeroRestartPointsInBlock) {
+  char data[sizeof(uint32_t)];
+  memset(data, 0, sizeof(data));
+  BlockContents contents;
+  contents.data = Slice(data, sizeof(data));
+  contents.cachable = false;
+  contents.heap_allocated = false;
+  Block block(contents);
+  Iterator* iter = block.NewIterator(BytewiseComparator());
+  iter->SeekToFirst();
+  ASSERT_TRUE(!iter->Valid());
+  iter->SeekToLast();
+  ASSERT_TRUE(!iter->Valid());
+  iter->Seek("foo");
+  ASSERT_TRUE(!iter->Valid());
+  delete iter;
+}
+
+// Test the empty key
+TEST(Harness, SimpleEmptyKey) {
+  for (int i = 0; i < kNumTestArgs; i++) {
+    Init(kTestArgList[i]);
+    Random rnd(test::RandomSeed() + 1);
+    Add("", "v");
+    Test(&rnd);
+  }
+}
+
+TEST(Harness, SimpleSingle) {
+  for (int i = 0; i < kNumTestArgs; i++) {
+    Init(kTestArgList[i]);
+    Random rnd(test::RandomSeed() + 2);
+    Add("abc", "v");
+    Test(&rnd);
+  }
+}
+
+TEST(Harness, SimpleMulti) {
+  for (int i = 0; i < kNumTestArgs; i++) {
+    Init(kTestArgList[i]);
+    Random rnd(test::RandomSeed() + 3);
+    Add("abc", "v");
+    Add("abcd", "v");
+    Add("ac", "v2");
+    Test(&rnd);
+  }
+}
+
+TEST(Harness, SimpleSpecialKey) {
+  for (int i = 0; i < kNumTestArgs; i++) {
+    Init(kTestArgList[i]);
+    Random rnd(test::RandomSeed() + 4);
+    Add("\xff\xff", "v3");
+    Test(&rnd);
+  }
+}
+
+TEST(Harness, Randomized) {
+  for (int i = 0; i < kNumTestArgs; i++) {
+    Init(kTestArgList[i]);
+    Random rnd(test::RandomSeed() + 5);
+    for (int num_entries = 0; num_entries < 2000;
+         num_entries += (num_entries < 50 ? 1 : 200)) {
+      if ((num_entries % 10) == 0) {
+        fprintf(stderr, "case %d of %d: num_entries = %d\n",
+                (i + 1), int(kNumTestArgs), num_entries);
+      }
+      for (int e = 0; e < num_entries; e++) {
+        std::string v;
+        Add(test::RandomKey(&rnd, rnd.Skewed(4)),
+            test::RandomString(&rnd, rnd.Skewed(5), &v).ToString());
+      }
+      Test(&rnd);
+    }
+  }
+}
+
+TEST(Harness, RandomizedLongDB) {
+  Random rnd(test::RandomSeed());
+  TestArgs args = { DB_TEST, false, 16 };
+  Init(args);
+  int num_entries = 100000;
+  for (int e = 0; e < num_entries; e++) {
+    std::string v;
+    Add(test::RandomKey(&rnd, rnd.Skewed(4)),
+        test::RandomString(&rnd, rnd.Skewed(5), &v).ToString());
+  }
+  Test(&rnd);
+
+  // We must have created enough data to force merging
+  int files = 0;
+  for (int level = 0; level < config::kNumLevels; level++) {
+    std::string value;
+    char name[100];
+    snprintf(name, sizeof(name), "leveldb.num-files-at-level%d", level);
+    ASSERT_TRUE(db()->GetProperty(name, &value));
+    files += atoi(value.c_str());
+  }
+  ASSERT_GT(files, 0);
+}
+
+class MemTableTest { };
+
+TEST(MemTableTest, Simple) {
+  InternalKeyComparator cmp(BytewiseComparator());
+  MemTable* memtable = new MemTable(cmp);
+  memtable->Ref();
+  WriteBatch batch;
+  WriteBatchInternal::SetSequence(&batch, 100);
+  batch.Put(std::string("k1"), std::string("v1"));
+  batch.Put(std::string("k2"), std::string("v2"));
+  batch.Put(std::string("k3"), std::string("v3"));
+  batch.Put(std::string("largekey"), std::string("vlarge"));
+  ASSERT_TRUE(WriteBatchInternal::InsertInto(&batch, memtable).ok());
+
+  Iterator* iter = memtable->NewIterator();
+  iter->SeekToFirst();
+  while (iter->Valid()) {
+    fprintf(stderr, "key: '%s' -> '%s'\n",
+            iter->key().ToString().c_str(),
+            iter->value().ToString().c_str());
+    iter->Next();
+  }
+
+  delete iter;
+  memtable->Unref();
+}
+
+static bool Between(uint64_t val, uint64_t low, uint64_t high) {
+  bool result = (val >= low) && (val <= high);
+  if (!result) {
+    fprintf(stderr, "Value %llu is not in range [%llu, %llu]\n",
+            (unsigned long long)(val),
+            (unsigned long long)(low),
+            (unsigned long long)(high));
+  }
+  return result;
+}
+
+class TableTest { };
+
+TEST(TableTest, ApproximateOffsetOfPlain) {
+  TableConstructor c(BytewiseComparator());
+  c.Add("k01", "hello");
+  c.Add("k02", "hello2");
+  c.Add("k03", std::string(10000, 'x'));
+  c.Add("k04", std::string(200000, 'x'));
+  c.Add("k05", std::string(300000, 'x'));
+  c.Add("k06", "hello3");
+  c.Add("k07", std::string(100000, 'x'));
+  std::vector<std::string> keys;
+  KVMap kvmap;
+  Options options;
+  options.block_size = 1024;
+  options.compression = kNoCompression;
+  c.Finish(options, &keys, &kvmap);
+
+  ASSERT_TRUE(Between(c.ApproximateOffsetOf("abc"),       0,      0));
+  ASSERT_TRUE(Between(c.ApproximateOffsetOf("k01"),       0,      0));
+  ASSERT_TRUE(Between(c.ApproximateOffsetOf("k01a"),      0,      0));
+  ASSERT_TRUE(Between(c.ApproximateOffsetOf("k02"),       0,      0));
+  ASSERT_TRUE(Between(c.ApproximateOffsetOf("k03"),       0,      0));
+  ASSERT_TRUE(Between(c.ApproximateOffsetOf("k04"),   10000,  11000));
+  ASSERT_TRUE(Between(c.ApproximateOffsetOf("k04a"), 210000, 211000));
+  ASSERT_TRUE(Between(c.ApproximateOffsetOf("k05"),  210000, 211000));
+  ASSERT_TRUE(Between(c.ApproximateOffsetOf("k06"),  510000, 511000));
+  ASSERT_TRUE(Between(c.ApproximateOffsetOf("k07"),  510000, 511000));
+  ASSERT_TRUE(Between(c.ApproximateOffsetOf("xyz"),  610000, 612000));
+
+}
+
+static bool SnappyCompressionSupported() {
+  std::string out;
+  Slice in = "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa";
+  return port::Snappy_Compress(in.data(), in.size(), &out);
+}
+
+TEST(TableTest, ApproximateOffsetOfCompressed) {
+  if (!SnappyCompressionSupported()) {
+    fprintf(stderr, "skipping compression tests\n");
+    return;
+  }
+
+  Random rnd(301);
+  TableConstructor c(BytewiseComparator());
+  std::string tmp;
+  c.Add("k01", "hello");
+  c.Add("k02", test::CompressibleString(&rnd, 0.25, 10000, &tmp));
+  c.Add("k03", "hello3");
+  c.Add("k04", test::CompressibleString(&rnd, 0.25, 10000, &tmp));
+  std::vector<std::string> keys;
+  KVMap kvmap;
+  Options options;
+  options.block_size = 1024;
+  options.compression = kSnappyCompression;
+  c.Finish(options, &keys, &kvmap);
+
+  // Expected upper and lower bounds of space used by compressible strings.
+  static const int kSlop = 1000;  // Compressor effectiveness varies.
+  const int expected = 2500;  // 10000 * compression ratio (0.25)
+  const int min_z = expected - kSlop;
+  const int max_z = expected + kSlop;
+
+  ASSERT_TRUE(Between(c.ApproximateOffsetOf("abc"), 0, kSlop));
+  ASSERT_TRUE(Between(c.ApproximateOffsetOf("k01"), 0, kSlop));
+  ASSERT_TRUE(Between(c.ApproximateOffsetOf("k02"), 0, kSlop));
+  // Have now emitted a large compressible string, so adjust expected offset.
+  ASSERT_TRUE(Between(c.ApproximateOffsetOf("k03"), min_z, max_z));
+  ASSERT_TRUE(Between(c.ApproximateOffsetOf("k04"), min_z, max_z));
+  // Have now emitted two large compressible strings, so adjust expected offset.
+  ASSERT_TRUE(Between(c.ApproximateOffsetOf("xyz"), 2 * min_z, 2 * max_z));
+}
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/table/two_level_iterator.cc b/depend/zcash/src/leveldb/table/two_level_iterator.cc
new file mode 100644
index 000000000..7822ebab9
--- /dev/null
+++ b/depend/zcash/src/leveldb/table/two_level_iterator.cc
@@ -0,0 +1,182 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "table/two_level_iterator.h"
+
+#include "leveldb/table.h"
+#include "table/block.h"
+#include "table/format.h"
+#include "table/iterator_wrapper.h"
+
+namespace leveldb {
+
+namespace {
+
+typedef Iterator* (*BlockFunction)(void*, const ReadOptions&, const Slice&);
+
+class TwoLevelIterator: public Iterator {
+ public:
+  TwoLevelIterator(
+    Iterator* index_iter,
+    BlockFunction block_function,
+    void* arg,
+    const ReadOptions& options);
+
+  virtual ~TwoLevelIterator();
+
+  virtual void Seek(const Slice& target);
+  virtual void SeekToFirst();
+  virtual void SeekToLast();
+  virtual void Next();
+  virtual void Prev();
+
+  virtual bool Valid() const {
+    return data_iter_.Valid();
+  }
+  virtual Slice key() const {
+    assert(Valid());
+    return data_iter_.key();
+  }
+  virtual Slice value() const {
+    assert(Valid());
+    return data_iter_.value();
+  }
+  virtual Status status() const {
+    // It'd be nice if status() returned a const Status& instead of a Status
+    if (!index_iter_.status().ok()) {
+      return index_iter_.status();
+    } else if (data_iter_.iter() != NULL && !data_iter_.status().ok()) {
+      return data_iter_.status();
+    } else {
+      return status_;
+    }
+  }
+
+ private:
+  void SaveError(const Status& s) {
+    if (status_.ok() && !s.ok()) status_ = s;
+  }
+  void SkipEmptyDataBlocksForward();
+  void SkipEmptyDataBlocksBackward();
+  void SetDataIterator(Iterator* data_iter);
+  void InitDataBlock();
+
+  BlockFunction block_function_;
+  void* arg_;
+  const ReadOptions options_;
+  Status status_;
+  IteratorWrapper index_iter_;
+  IteratorWrapper data_iter_; // May be NULL
+  // If data_iter_ is non-NULL, then "data_block_handle_" holds the
+  // "index_value" passed to block_function_ to create the data_iter_.
+  std::string data_block_handle_;
+};
+
+TwoLevelIterator::TwoLevelIterator(
+    Iterator* index_iter,
+    BlockFunction block_function,
+    void* arg,
+    const ReadOptions& options)
+    : block_function_(block_function),
+      arg_(arg),
+      options_(options),
+      index_iter_(index_iter),
+      data_iter_(NULL) {
+}
+
+TwoLevelIterator::~TwoLevelIterator() {
+}
+
+void TwoLevelIterator::Seek(const Slice& target) {
+  index_iter_.Seek(target);
+  InitDataBlock();
+  if (data_iter_.iter() != NULL) data_iter_.Seek(target);
+  SkipEmptyDataBlocksForward();
+}
+
+void TwoLevelIterator::SeekToFirst() {
+  index_iter_.SeekToFirst();
+  InitDataBlock();
+  if (data_iter_.iter() != NULL) data_iter_.SeekToFirst();
+  SkipEmptyDataBlocksForward();
+}
+
+void TwoLevelIterator::SeekToLast() {
+  index_iter_.SeekToLast();
+  InitDataBlock();
+  if (data_iter_.iter() != NULL) data_iter_.SeekToLast();
+  SkipEmptyDataBlocksBackward();
+}
+
+void TwoLevelIterator::Next() {
+  assert(Valid());
+  data_iter_.Next();
+  SkipEmptyDataBlocksForward();
+}
+
+void TwoLevelIterator::Prev() {
+  assert(Valid());
+  data_iter_.Prev();
+  SkipEmptyDataBlocksBackward();
+}
+
+
+void TwoLevelIterator::SkipEmptyDataBlocksForward() {
+  while (data_iter_.iter() == NULL || !data_iter_.Valid()) {
+    // Move to next block
+    if (!index_iter_.Valid()) {
+      SetDataIterator(NULL);
+      return;
+    }
+    index_iter_.Next();
+    InitDataBlock();
+    if (data_iter_.iter() != NULL) data_iter_.SeekToFirst();
+  }
+}
+
+void TwoLevelIterator::SkipEmptyDataBlocksBackward() {
+  while (data_iter_.iter() == NULL || !data_iter_.Valid()) {
+    // Move to next block
+    if (!index_iter_.Valid()) {
+      SetDataIterator(NULL);
+      return;
+    }
+    index_iter_.Prev();
+    InitDataBlock();
+    if (data_iter_.iter() != NULL) data_iter_.SeekToLast();
+  }
+}
+
+void TwoLevelIterator::SetDataIterator(Iterator* data_iter) {
+  if (data_iter_.iter() != NULL) SaveError(data_iter_.status());
+  data_iter_.Set(data_iter);
+}
+
+void TwoLevelIterator::InitDataBlock() {
+  if (!index_iter_.Valid()) {
+    SetDataIterator(NULL);
+  } else {
+    Slice handle = index_iter_.value();
+    if (data_iter_.iter() != NULL && handle.compare(data_block_handle_) == 0) {
+      // data_iter_ is already constructed with this iterator, so
+      // no need to change anything
+    } else {
+      Iterator* iter = (*block_function_)(arg_, options_, handle);
+      data_block_handle_.assign(handle.data(), handle.size());
+      SetDataIterator(iter);
+    }
+  }
+}
+
+}  // namespace
+
+Iterator* NewTwoLevelIterator(
+    Iterator* index_iter,
+    BlockFunction block_function,
+    void* arg,
+    const ReadOptions& options) {
+  return new TwoLevelIterator(index_iter, block_function, arg, options);
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/table/two_level_iterator.h b/depend/zcash/src/leveldb/table/two_level_iterator.h
new file mode 100644
index 000000000..629ca3452
--- /dev/null
+++ b/depend/zcash/src/leveldb/table/two_level_iterator.h
@@ -0,0 +1,34 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_TABLE_TWO_LEVEL_ITERATOR_H_
+#define STORAGE_LEVELDB_TABLE_TWO_LEVEL_ITERATOR_H_
+
+#include "leveldb/iterator.h"
+
+namespace leveldb {
+
+struct ReadOptions;
+
+// Return a new two level iterator.  A two-level iterator contains an
+// index iterator whose values point to a sequence of blocks where
+// each block is itself a sequence of key,value pairs.  The returned
+// two-level iterator yields the concatenation of all key/value pairs
+// in the sequence of blocks.  Takes ownership of "index_iter" and
+// will delete it when no longer needed.
+//
+// Uses a supplied function to convert an index_iter value into
+// an iterator over the contents of the corresponding block.
+extern Iterator* NewTwoLevelIterator(
+    Iterator* index_iter,
+    Iterator* (*block_function)(
+        void* arg,
+        const ReadOptions& options,
+        const Slice& index_value),
+    void* arg,
+    const ReadOptions& options);
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_TABLE_TWO_LEVEL_ITERATOR_H_
diff --git a/depend/zcash/src/leveldb/util/arena.cc b/depend/zcash/src/leveldb/util/arena.cc
new file mode 100644
index 000000000..74078213e
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/arena.cc
@@ -0,0 +1,68 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "util/arena.h"
+#include <assert.h>
+
+namespace leveldb {
+
+static const int kBlockSize = 4096;
+
+Arena::Arena() : memory_usage_(0) {
+  alloc_ptr_ = NULL;  // First allocation will allocate a block
+  alloc_bytes_remaining_ = 0;
+}
+
+Arena::~Arena() {
+  for (size_t i = 0; i < blocks_.size(); i++) {
+    delete[] blocks_[i];
+  }
+}
+
+char* Arena::AllocateFallback(size_t bytes) {
+  if (bytes > kBlockSize / 4) {
+    // Object is more than a quarter of our block size.  Allocate it separately
+    // to avoid wasting too much space in leftover bytes.
+    char* result = AllocateNewBlock(bytes);
+    return result;
+  }
+
+  // We waste the remaining space in the current block.
+  alloc_ptr_ = AllocateNewBlock(kBlockSize);
+  alloc_bytes_remaining_ = kBlockSize;
+
+  char* result = alloc_ptr_;
+  alloc_ptr_ += bytes;
+  alloc_bytes_remaining_ -= bytes;
+  return result;
+}
+
+char* Arena::AllocateAligned(size_t bytes) {
+  const int align = (sizeof(void*) > 8) ? sizeof(void*) : 8;
+  assert((align & (align-1)) == 0);   // Pointer size should be a power of 2
+  size_t current_mod = reinterpret_cast<uintptr_t>(alloc_ptr_) & (align-1);
+  size_t slop = (current_mod == 0 ? 0 : align - current_mod);
+  size_t needed = bytes + slop;
+  char* result;
+  if (needed <= alloc_bytes_remaining_) {
+    result = alloc_ptr_ + slop;
+    alloc_ptr_ += needed;
+    alloc_bytes_remaining_ -= needed;
+  } else {
+    // AllocateFallback always returned aligned memory
+    result = AllocateFallback(bytes);
+  }
+  assert((reinterpret_cast<uintptr_t>(result) & (align-1)) == 0);
+  return result;
+}
+
+char* Arena::AllocateNewBlock(size_t block_bytes) {
+  char* result = new char[block_bytes];
+  blocks_.push_back(result);
+  memory_usage_.NoBarrier_Store(
+      reinterpret_cast<void*>(MemoryUsage() + block_bytes + sizeof(char*)));
+  return result;
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/util/arena.h b/depend/zcash/src/leveldb/util/arena.h
new file mode 100644
index 000000000..48bab3374
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/arena.h
@@ -0,0 +1,68 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_UTIL_ARENA_H_
+#define STORAGE_LEVELDB_UTIL_ARENA_H_
+
+#include <vector>
+#include <assert.h>
+#include <stddef.h>
+#include <stdint.h>
+#include "port/port.h"
+
+namespace leveldb {
+
+class Arena {
+ public:
+  Arena();
+  ~Arena();
+
+  // Return a pointer to a newly allocated memory block of "bytes" bytes.
+  char* Allocate(size_t bytes);
+
+  // Allocate memory with the normal alignment guarantees provided by malloc
+  char* AllocateAligned(size_t bytes);
+
+  // Returns an estimate of the total memory usage of data allocated
+  // by the arena.
+  size_t MemoryUsage() const {
+    return reinterpret_cast<uintptr_t>(memory_usage_.NoBarrier_Load());
+  }
+
+ private:
+  char* AllocateFallback(size_t bytes);
+  char* AllocateNewBlock(size_t block_bytes);
+
+  // Allocation state
+  char* alloc_ptr_;
+  size_t alloc_bytes_remaining_;
+
+  // Array of new[] allocated memory blocks
+  std::vector<char*> blocks_;
+
+  // Total memory usage of the arena.
+  port::AtomicPointer memory_usage_;
+
+  // No copying allowed
+  Arena(const Arena&);
+  void operator=(const Arena&);
+};
+
+inline char* Arena::Allocate(size_t bytes) {
+  // The semantics of what to return are a bit messy if we allow
+  // 0-byte allocations, so we disallow them here (we don't need
+  // them for our internal use).
+  assert(bytes > 0);
+  if (bytes <= alloc_bytes_remaining_) {
+    char* result = alloc_ptr_;
+    alloc_ptr_ += bytes;
+    alloc_bytes_remaining_ -= bytes;
+    return result;
+  }
+  return AllocateFallback(bytes);
+}
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_UTIL_ARENA_H_
diff --git a/depend/zcash/src/leveldb/util/arena_test.cc b/depend/zcash/src/leveldb/util/arena_test.cc
new file mode 100644
index 000000000..58e870ec4
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/arena_test.cc
@@ -0,0 +1,68 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "util/arena.h"
+
+#include "util/random.h"
+#include "util/testharness.h"
+
+namespace leveldb {
+
+class ArenaTest { };
+
+TEST(ArenaTest, Empty) {
+  Arena arena;
+}
+
+TEST(ArenaTest, Simple) {
+  std::vector<std::pair<size_t, char*> > allocated;
+  Arena arena;
+  const int N = 100000;
+  size_t bytes = 0;
+  Random rnd(301);
+  for (int i = 0; i < N; i++) {
+    size_t s;
+    if (i % (N / 10) == 0) {
+      s = i;
+    } else {
+      s = rnd.OneIn(4000) ? rnd.Uniform(6000) :
+          (rnd.OneIn(10) ? rnd.Uniform(100) : rnd.Uniform(20));
+    }
+    if (s == 0) {
+      // Our arena disallows size 0 allocations.
+      s = 1;
+    }
+    char* r;
+    if (rnd.OneIn(10)) {
+      r = arena.AllocateAligned(s);
+    } else {
+      r = arena.Allocate(s);
+    }
+
+    for (size_t b = 0; b < s; b++) {
+      // Fill the "i"th allocation with a known bit pattern
+      r[b] = i % 256;
+    }
+    bytes += s;
+    allocated.push_back(std::make_pair(s, r));
+    ASSERT_GE(arena.MemoryUsage(), bytes);
+    if (i > N/10) {
+      ASSERT_LE(arena.MemoryUsage(), bytes * 1.10);
+    }
+  }
+  for (size_t i = 0; i < allocated.size(); i++) {
+    size_t num_bytes = allocated[i].first;
+    const char* p = allocated[i].second;
+    for (size_t b = 0; b < num_bytes; b++) {
+      // Check the "i"th allocation for the known bit pattern
+      ASSERT_EQ(int(p[b]) & 0xff, i % 256);
+    }
+  }
+}
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/util/bloom.cc b/depend/zcash/src/leveldb/util/bloom.cc
new file mode 100644
index 000000000..bf3e4ca6e
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/bloom.cc
@@ -0,0 +1,95 @@
+// Copyright (c) 2012 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "leveldb/filter_policy.h"
+
+#include "leveldb/slice.h"
+#include "util/hash.h"
+
+namespace leveldb {
+
+namespace {
+static uint32_t BloomHash(const Slice& key) {
+  return Hash(key.data(), key.size(), 0xbc9f1d34);
+}
+
+class BloomFilterPolicy : public FilterPolicy {
+ private:
+  size_t bits_per_key_;
+  size_t k_;
+
+ public:
+  explicit BloomFilterPolicy(int bits_per_key)
+      : bits_per_key_(bits_per_key) {
+    // We intentionally round down to reduce probing cost a little bit
+    k_ = static_cast<size_t>(bits_per_key * 0.69);  // 0.69 =~ ln(2)
+    if (k_ < 1) k_ = 1;
+    if (k_ > 30) k_ = 30;
+  }
+
+  virtual const char* Name() const {
+    return "leveldb.BuiltinBloomFilter2";
+  }
+
+  virtual void CreateFilter(const Slice* keys, int n, std::string* dst) const {
+    // Compute bloom filter size (in both bits and bytes)
+    size_t bits = n * bits_per_key_;
+
+    // For small n, we can see a very high false positive rate.  Fix it
+    // by enforcing a minimum bloom filter length.
+    if (bits < 64) bits = 64;
+
+    size_t bytes = (bits + 7) / 8;
+    bits = bytes * 8;
+
+    const size_t init_size = dst->size();
+    dst->resize(init_size + bytes, 0);
+    dst->push_back(static_cast<char>(k_));  // Remember # of probes in filter
+    char* array = &(*dst)[init_size];
+    for (int i = 0; i < n; i++) {
+      // Use double-hashing to generate a sequence of hash values.
+      // See analysis in [Kirsch,Mitzenmacher 2006].
+      uint32_t h = BloomHash(keys[i]);
+      const uint32_t delta = (h >> 17) | (h << 15);  // Rotate right 17 bits
+      for (size_t j = 0; j < k_; j++) {
+        const uint32_t bitpos = h % bits;
+        array[bitpos/8] |= (1 << (bitpos % 8));
+        h += delta;
+      }
+    }
+  }
+
+  virtual bool KeyMayMatch(const Slice& key, const Slice& bloom_filter) const {
+    const size_t len = bloom_filter.size();
+    if (len < 2) return false;
+
+    const char* array = bloom_filter.data();
+    const size_t bits = (len - 1) * 8;
+
+    // Use the encoded k so that we can read filters generated by
+    // bloom filters created using different parameters.
+    const size_t k = array[len-1];
+    if (k > 30) {
+      // Reserved for potentially new encodings for short bloom filters.
+      // Consider it a match.
+      return true;
+    }
+
+    uint32_t h = BloomHash(key);
+    const uint32_t delta = (h >> 17) | (h << 15);  // Rotate right 17 bits
+    for (size_t j = 0; j < k; j++) {
+      const uint32_t bitpos = h % bits;
+      if ((array[bitpos/8] & (1 << (bitpos % 8))) == 0) return false;
+      h += delta;
+    }
+    return true;
+  }
+};
+}
+
+const FilterPolicy* NewBloomFilterPolicy(int bits_per_key) {
+  return new BloomFilterPolicy(bits_per_key);
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/util/bloom_test.cc b/depend/zcash/src/leveldb/util/bloom_test.cc
new file mode 100644
index 000000000..1b87a2be3
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/bloom_test.cc
@@ -0,0 +1,162 @@
+// Copyright (c) 2012 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "leveldb/filter_policy.h"
+
+#include "util/coding.h"
+#include "util/logging.h"
+#include "util/testharness.h"
+#include "util/testutil.h"
+
+namespace leveldb {
+
+static const int kVerbose = 1;
+
+static Slice Key(int i, char* buffer) {
+  EncodeFixed32(buffer, i);
+  return Slice(buffer, sizeof(uint32_t));
+}
+
+class BloomTest {
+ private:
+  const FilterPolicy* policy_;
+  std::string filter_;
+  std::vector<std::string> keys_;
+
+ public:
+  BloomTest() : policy_(NewBloomFilterPolicy(10)) { }
+
+  ~BloomTest() {
+    delete policy_;
+  }
+
+  void Reset() {
+    keys_.clear();
+    filter_.clear();
+  }
+
+  void Add(const Slice& s) {
+    keys_.push_back(s.ToString());
+  }
+
+  void Build() {
+    std::vector<Slice> key_slices;
+    for (size_t i = 0; i < keys_.size(); i++) {
+      key_slices.push_back(Slice(keys_[i]));
+    }
+    filter_.clear();
+    policy_->CreateFilter(&key_slices[0], static_cast<int>(key_slices.size()),
+                          &filter_);
+    keys_.clear();
+    if (kVerbose >= 2) DumpFilter();
+  }
+
+  size_t FilterSize() const {
+    return filter_.size();
+  }
+
+  void DumpFilter() {
+    fprintf(stderr, "F(");
+    for (size_t i = 0; i+1 < filter_.size(); i++) {
+      const unsigned int c = static_cast<unsigned int>(filter_[i]);
+      for (int j = 0; j < 8; j++) {
+        fprintf(stderr, "%c", (c & (1 <<j)) ? '1' : '.');
+      }
+    }
+    fprintf(stderr, ")\n");
+  }
+
+  bool Matches(const Slice& s) {
+    if (!keys_.empty()) {
+      Build();
+    }
+    return policy_->KeyMayMatch(s, filter_);
+  }
+
+  double FalsePositiveRate() {
+    char buffer[sizeof(int)];
+    int result = 0;
+    for (int i = 0; i < 10000; i++) {
+      if (Matches(Key(i + 1000000000, buffer))) {
+        result++;
+      }
+    }
+    return result / 10000.0;
+  }
+};
+
+TEST(BloomTest, EmptyFilter) {
+  ASSERT_TRUE(! Matches("hello"));
+  ASSERT_TRUE(! Matches("world"));
+}
+
+TEST(BloomTest, Small) {
+  Add("hello");
+  Add("world");
+  ASSERT_TRUE(Matches("hello"));
+  ASSERT_TRUE(Matches("world"));
+  ASSERT_TRUE(! Matches("x"));
+  ASSERT_TRUE(! Matches("foo"));
+}
+
+static int NextLength(int length) {
+  if (length < 10) {
+    length += 1;
+  } else if (length < 100) {
+    length += 10;
+  } else if (length < 1000) {
+    length += 100;
+  } else {
+    length += 1000;
+  }
+  return length;
+}
+
+TEST(BloomTest, VaryingLengths) {
+  char buffer[sizeof(int)];
+
+  // Count number of filters that significantly exceed the false positive rate
+  int mediocre_filters = 0;
+  int good_filters = 0;
+
+  for (int length = 1; length <= 10000; length = NextLength(length)) {
+    Reset();
+    for (int i = 0; i < length; i++) {
+      Add(Key(i, buffer));
+    }
+    Build();
+
+    ASSERT_LE(FilterSize(), static_cast<size_t>((length * 10 / 8) + 40))
+        << length;
+
+    // All added keys must match
+    for (int i = 0; i < length; i++) {
+      ASSERT_TRUE(Matches(Key(i, buffer)))
+          << "Length " << length << "; key " << i;
+    }
+
+    // Check false positive rate
+    double rate = FalsePositiveRate();
+    if (kVerbose >= 1) {
+      fprintf(stderr, "False positives: %5.2f%% @ length = %6d ; bytes = %6d\n",
+              rate*100.0, length, static_cast<int>(FilterSize()));
+    }
+    ASSERT_LE(rate, 0.02);   // Must not be over 2%
+    if (rate > 0.0125) mediocre_filters++;  // Allowed, but not too often
+    else good_filters++;
+  }
+  if (kVerbose >= 1) {
+    fprintf(stderr, "Filters: %d good, %d mediocre\n",
+            good_filters, mediocre_filters);
+  }
+  ASSERT_LE(mediocre_filters, good_filters/5);
+}
+
+// Different bits-per-byte
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/util/cache.cc b/depend/zcash/src/leveldb/util/cache.cc
new file mode 100644
index 000000000..ce4688617
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/cache.cc
@@ -0,0 +1,405 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include <assert.h>
+#include <stdio.h>
+#include <stdlib.h>
+
+#include "leveldb/cache.h"
+#include "port/port.h"
+#include "util/hash.h"
+#include "util/mutexlock.h"
+
+namespace leveldb {
+
+Cache::~Cache() {
+}
+
+namespace {
+
+// LRU cache implementation
+//
+// Cache entries have an "in_cache" boolean indicating whether the cache has a
+// reference on the entry.  The only ways that this can become false without the
+// entry being passed to its "deleter" are via Erase(), via Insert() when
+// an element with a duplicate key is inserted, or on destruction of the cache.
+//
+// The cache keeps two linked lists of items in the cache.  All items in the
+// cache are in one list or the other, and never both.  Items still referenced
+// by clients but erased from the cache are in neither list.  The lists are:
+// - in-use:  contains the items currently referenced by clients, in no
+//   particular order.  (This list is used for invariant checking.  If we
+//   removed the check, elements that would otherwise be on this list could be
+//   left as disconnected singleton lists.)
+// - LRU:  contains the items not currently referenced by clients, in LRU order
+// Elements are moved between these lists by the Ref() and Unref() methods,
+// when they detect an element in the cache acquiring or losing its only
+// external reference.
+
+// An entry is a variable length heap-allocated structure.  Entries
+// are kept in a circular doubly linked list ordered by access time.
+struct LRUHandle {
+  void* value;
+  void (*deleter)(const Slice&, void* value);
+  LRUHandle* next_hash;
+  LRUHandle* next;
+  LRUHandle* prev;
+  size_t charge;      // TODO(opt): Only allow uint32_t?
+  size_t key_length;
+  bool in_cache;      // Whether entry is in the cache.
+  uint32_t refs;      // References, including cache reference, if present.
+  uint32_t hash;      // Hash of key(); used for fast sharding and comparisons
+  char key_data[1];   // Beginning of key
+
+  Slice key() const {
+    // For cheaper lookups, we allow a temporary Handle object
+    // to store a pointer to a key in "value".
+    if (next == this) {
+      return *(reinterpret_cast<Slice*>(value));
+    } else {
+      return Slice(key_data, key_length);
+    }
+  }
+};
+
+// We provide our own simple hash table since it removes a whole bunch
+// of porting hacks and is also faster than some of the built-in hash
+// table implementations in some of the compiler/runtime combinations
+// we have tested.  E.g., readrandom speeds up by ~5% over the g++
+// 4.4.3's builtin hashtable.
+class HandleTable {
+ public:
+  HandleTable() : length_(0), elems_(0), list_(NULL) { Resize(); }
+  ~HandleTable() { delete[] list_; }
+
+  LRUHandle* Lookup(const Slice& key, uint32_t hash) {
+    return *FindPointer(key, hash);
+  }
+
+  LRUHandle* Insert(LRUHandle* h) {
+    LRUHandle** ptr = FindPointer(h->key(), h->hash);
+    LRUHandle* old = *ptr;
+    h->next_hash = (old == NULL ? NULL : old->next_hash);
+    *ptr = h;
+    if (old == NULL) {
+      ++elems_;
+      if (elems_ > length_) {
+        // Since each cache entry is fairly large, we aim for a small
+        // average linked list length (<= 1).
+        Resize();
+      }
+    }
+    return old;
+  }
+
+  LRUHandle* Remove(const Slice& key, uint32_t hash) {
+    LRUHandle** ptr = FindPointer(key, hash);
+    LRUHandle* result = *ptr;
+    if (result != NULL) {
+      *ptr = result->next_hash;
+      --elems_;
+    }
+    return result;
+  }
+
+ private:
+  // The table consists of an array of buckets where each bucket is
+  // a linked list of cache entries that hash into the bucket.
+  uint32_t length_;
+  uint32_t elems_;
+  LRUHandle** list_;
+
+  // Return a pointer to slot that points to a cache entry that
+  // matches key/hash.  If there is no such cache entry, return a
+  // pointer to the trailing slot in the corresponding linked list.
+  LRUHandle** FindPointer(const Slice& key, uint32_t hash) {
+    LRUHandle** ptr = &list_[hash & (length_ - 1)];
+    while (*ptr != NULL &&
+           ((*ptr)->hash != hash || key != (*ptr)->key())) {
+      ptr = &(*ptr)->next_hash;
+    }
+    return ptr;
+  }
+
+  void Resize() {
+    uint32_t new_length = 4;
+    while (new_length < elems_) {
+      new_length *= 2;
+    }
+    LRUHandle** new_list = new LRUHandle*[new_length];
+    memset(new_list, 0, sizeof(new_list[0]) * new_length);
+    uint32_t count = 0;
+    for (uint32_t i = 0; i < length_; i++) {
+      LRUHandle* h = list_[i];
+      while (h != NULL) {
+        LRUHandle* next = h->next_hash;
+        uint32_t hash = h->hash;
+        LRUHandle** ptr = &new_list[hash & (new_length - 1)];
+        h->next_hash = *ptr;
+        *ptr = h;
+        h = next;
+        count++;
+      }
+    }
+    assert(elems_ == count);
+    delete[] list_;
+    list_ = new_list;
+    length_ = new_length;
+  }
+};
+
+// A single shard of sharded cache.
+class LRUCache {
+ public:
+  LRUCache();
+  ~LRUCache();
+
+  // Separate from constructor so caller can easily make an array of LRUCache
+  void SetCapacity(size_t capacity) { capacity_ = capacity; }
+
+  // Like Cache methods, but with an extra "hash" parameter.
+  Cache::Handle* Insert(const Slice& key, uint32_t hash,
+                        void* value, size_t charge,
+                        void (*deleter)(const Slice& key, void* value));
+  Cache::Handle* Lookup(const Slice& key, uint32_t hash);
+  void Release(Cache::Handle* handle);
+  void Erase(const Slice& key, uint32_t hash);
+  void Prune();
+  size_t TotalCharge() const {
+    MutexLock l(&mutex_);
+    return usage_;
+  }
+
+ private:
+  void LRU_Remove(LRUHandle* e);
+  void LRU_Append(LRUHandle*list, LRUHandle* e);
+  void Ref(LRUHandle* e);
+  void Unref(LRUHandle* e);
+  bool FinishErase(LRUHandle* e);
+
+  // Initialized before use.
+  size_t capacity_;
+
+  // mutex_ protects the following state.
+  mutable port::Mutex mutex_;
+  size_t usage_;
+
+  // Dummy head of LRU list.
+  // lru.prev is newest entry, lru.next is oldest entry.
+  // Entries have refs==1 and in_cache==true.
+  LRUHandle lru_;
+
+  // Dummy head of in-use list.
+  // Entries are in use by clients, and have refs >= 2 and in_cache==true.
+  LRUHandle in_use_;
+
+  HandleTable table_;
+};
+
+LRUCache::LRUCache()
+    : usage_(0) {
+  // Make empty circular linked lists.
+  lru_.next = &lru_;
+  lru_.prev = &lru_;
+  in_use_.next = &in_use_;
+  in_use_.prev = &in_use_;
+}
+
+LRUCache::~LRUCache() {
+  assert(in_use_.next == &in_use_);  // Error if caller has an unreleased handle
+  for (LRUHandle* e = lru_.next; e != &lru_; ) {
+    LRUHandle* next = e->next;
+    assert(e->in_cache);
+    e->in_cache = false;
+    assert(e->refs == 1);  // Invariant of lru_ list.
+    Unref(e);
+    e = next;
+  }
+}
+
+void LRUCache::Ref(LRUHandle* e) {
+  if (e->refs == 1 && e->in_cache) {  // If on lru_ list, move to in_use_ list.
+    LRU_Remove(e);
+    LRU_Append(&in_use_, e);
+  }
+  e->refs++;
+}
+
+void LRUCache::Unref(LRUHandle* e) {
+  assert(e->refs > 0);
+  e->refs--;
+  if (e->refs == 0) { // Deallocate.
+    assert(!e->in_cache);
+    (*e->deleter)(e->key(), e->value);
+    free(e);
+  } else if (e->in_cache && e->refs == 1) {  // No longer in use; move to lru_ list.
+    LRU_Remove(e);
+    LRU_Append(&lru_, e);
+  }
+}
+
+void LRUCache::LRU_Remove(LRUHandle* e) {
+  e->next->prev = e->prev;
+  e->prev->next = e->next;
+}
+
+void LRUCache::LRU_Append(LRUHandle* list, LRUHandle* e) {
+  // Make "e" newest entry by inserting just before *list
+  e->next = list;
+  e->prev = list->prev;
+  e->prev->next = e;
+  e->next->prev = e;
+}
+
+Cache::Handle* LRUCache::Lookup(const Slice& key, uint32_t hash) {
+  MutexLock l(&mutex_);
+  LRUHandle* e = table_.Lookup(key, hash);
+  if (e != NULL) {
+    Ref(e);
+  }
+  return reinterpret_cast<Cache::Handle*>(e);
+}
+
+void LRUCache::Release(Cache::Handle* handle) {
+  MutexLock l(&mutex_);
+  Unref(reinterpret_cast<LRUHandle*>(handle));
+}
+
+Cache::Handle* LRUCache::Insert(
+    const Slice& key, uint32_t hash, void* value, size_t charge,
+    void (*deleter)(const Slice& key, void* value)) {
+  MutexLock l(&mutex_);
+
+  LRUHandle* e = reinterpret_cast<LRUHandle*>(
+      malloc(sizeof(LRUHandle)-1 + key.size()));
+  e->value = value;
+  e->deleter = deleter;
+  e->charge = charge;
+  e->key_length = key.size();
+  e->hash = hash;
+  e->in_cache = false;
+  e->refs = 1;  // for the returned handle.
+  memcpy(e->key_data, key.data(), key.size());
+
+  if (capacity_ > 0) {
+    e->refs++;  // for the cache's reference.
+    e->in_cache = true;
+    LRU_Append(&in_use_, e);
+    usage_ += charge;
+    FinishErase(table_.Insert(e));
+  } // else don't cache.  (Tests use capacity_==0 to turn off caching.)
+
+  while (usage_ > capacity_ && lru_.next != &lru_) {
+    LRUHandle* old = lru_.next;
+    assert(old->refs == 1);
+    bool erased = FinishErase(table_.Remove(old->key(), old->hash));
+    if (!erased) {  // to avoid unused variable when compiled NDEBUG
+      assert(erased);
+    }
+  }
+
+  return reinterpret_cast<Cache::Handle*>(e);
+}
+
+// If e != NULL, finish removing *e from the cache; it has already been removed
+// from the hash table.  Return whether e != NULL.  Requires mutex_ held.
+bool LRUCache::FinishErase(LRUHandle* e) {
+  if (e != NULL) {
+    assert(e->in_cache);
+    LRU_Remove(e);
+    e->in_cache = false;
+    usage_ -= e->charge;
+    Unref(e);
+  }
+  return e != NULL;
+}
+
+void LRUCache::Erase(const Slice& key, uint32_t hash) {
+  MutexLock l(&mutex_);
+  FinishErase(table_.Remove(key, hash));
+}
+
+void LRUCache::Prune() {
+  MutexLock l(&mutex_);
+  while (lru_.next != &lru_) {
+    LRUHandle* e = lru_.next;
+    assert(e->refs == 1);
+    bool erased = FinishErase(table_.Remove(e->key(), e->hash));
+    if (!erased) {  // to avoid unused variable when compiled NDEBUG
+      assert(erased);
+    }
+  }
+}
+
+static const int kNumShardBits = 4;
+static const int kNumShards = 1 << kNumShardBits;
+
+class ShardedLRUCache : public Cache {
+ private:
+  LRUCache shard_[kNumShards];
+  port::Mutex id_mutex_;
+  uint64_t last_id_;
+
+  static inline uint32_t HashSlice(const Slice& s) {
+    return Hash(s.data(), s.size(), 0);
+  }
+
+  static uint32_t Shard(uint32_t hash) {
+    return hash >> (32 - kNumShardBits);
+  }
+
+ public:
+  explicit ShardedLRUCache(size_t capacity)
+      : last_id_(0) {
+    const size_t per_shard = (capacity + (kNumShards - 1)) / kNumShards;
+    for (int s = 0; s < kNumShards; s++) {
+      shard_[s].SetCapacity(per_shard);
+    }
+  }
+  virtual ~ShardedLRUCache() { }
+  virtual Handle* Insert(const Slice& key, void* value, size_t charge,
+                         void (*deleter)(const Slice& key, void* value)) {
+    const uint32_t hash = HashSlice(key);
+    return shard_[Shard(hash)].Insert(key, hash, value, charge, deleter);
+  }
+  virtual Handle* Lookup(const Slice& key) {
+    const uint32_t hash = HashSlice(key);
+    return shard_[Shard(hash)].Lookup(key, hash);
+  }
+  virtual void Release(Handle* handle) {
+    LRUHandle* h = reinterpret_cast<LRUHandle*>(handle);
+    shard_[Shard(h->hash)].Release(handle);
+  }
+  virtual void Erase(const Slice& key) {
+    const uint32_t hash = HashSlice(key);
+    shard_[Shard(hash)].Erase(key, hash);
+  }
+  virtual void* Value(Handle* handle) {
+    return reinterpret_cast<LRUHandle*>(handle)->value;
+  }
+  virtual uint64_t NewId() {
+    MutexLock l(&id_mutex_);
+    return ++(last_id_);
+  }
+  virtual void Prune() {
+    for (int s = 0; s < kNumShards; s++) {
+      shard_[s].Prune();
+    }
+  }
+  virtual size_t TotalCharge() const {
+    size_t total = 0;
+    for (int s = 0; s < kNumShards; s++) {
+      total += shard_[s].TotalCharge();
+    }
+    return total;
+  }
+};
+
+}  // end anonymous namespace
+
+Cache* NewLRUCache(size_t capacity) {
+  return new ShardedLRUCache(capacity);
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/util/cache_test.cc b/depend/zcash/src/leveldb/util/cache_test.cc
new file mode 100644
index 000000000..468f7a642
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/cache_test.cc
@@ -0,0 +1,226 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "leveldb/cache.h"
+
+#include <vector>
+#include "util/coding.h"
+#include "util/testharness.h"
+
+namespace leveldb {
+
+// Conversions between numeric keys/values and the types expected by Cache.
+static std::string EncodeKey(int k) {
+  std::string result;
+  PutFixed32(&result, k);
+  return result;
+}
+static int DecodeKey(const Slice& k) {
+  assert(k.size() == 4);
+  return DecodeFixed32(k.data());
+}
+static void* EncodeValue(uintptr_t v) { return reinterpret_cast<void*>(v); }
+static int DecodeValue(void* v) { return reinterpret_cast<uintptr_t>(v); }
+
+class CacheTest {
+ public:
+  static CacheTest* current_;
+
+  static void Deleter(const Slice& key, void* v) {
+    current_->deleted_keys_.push_back(DecodeKey(key));
+    current_->deleted_values_.push_back(DecodeValue(v));
+  }
+
+  static const int kCacheSize = 1000;
+  std::vector<int> deleted_keys_;
+  std::vector<int> deleted_values_;
+  Cache* cache_;
+
+  CacheTest() : cache_(NewLRUCache(kCacheSize)) {
+    current_ = this;
+  }
+
+  ~CacheTest() {
+    delete cache_;
+  }
+
+  int Lookup(int key) {
+    Cache::Handle* handle = cache_->Lookup(EncodeKey(key));
+    const int r = (handle == NULL) ? -1 : DecodeValue(cache_->Value(handle));
+    if (handle != NULL) {
+      cache_->Release(handle);
+    }
+    return r;
+  }
+
+  void Insert(int key, int value, int charge = 1) {
+    cache_->Release(cache_->Insert(EncodeKey(key), EncodeValue(value), charge,
+                                   &CacheTest::Deleter));
+  }
+
+  Cache::Handle* InsertAndReturnHandle(int key, int value, int charge = 1) {
+    return cache_->Insert(EncodeKey(key), EncodeValue(value), charge,
+                          &CacheTest::Deleter);
+  }
+
+  void Erase(int key) {
+    cache_->Erase(EncodeKey(key));
+  }
+};
+CacheTest* CacheTest::current_;
+
+TEST(CacheTest, HitAndMiss) {
+  ASSERT_EQ(-1, Lookup(100));
+
+  Insert(100, 101);
+  ASSERT_EQ(101, Lookup(100));
+  ASSERT_EQ(-1,  Lookup(200));
+  ASSERT_EQ(-1,  Lookup(300));
+
+  Insert(200, 201);
+  ASSERT_EQ(101, Lookup(100));
+  ASSERT_EQ(201, Lookup(200));
+  ASSERT_EQ(-1,  Lookup(300));
+
+  Insert(100, 102);
+  ASSERT_EQ(102, Lookup(100));
+  ASSERT_EQ(201, Lookup(200));
+  ASSERT_EQ(-1,  Lookup(300));
+
+  ASSERT_EQ(1, deleted_keys_.size());
+  ASSERT_EQ(100, deleted_keys_[0]);
+  ASSERT_EQ(101, deleted_values_[0]);
+}
+
+TEST(CacheTest, Erase) {
+  Erase(200);
+  ASSERT_EQ(0, deleted_keys_.size());
+
+  Insert(100, 101);
+  Insert(200, 201);
+  Erase(100);
+  ASSERT_EQ(-1,  Lookup(100));
+  ASSERT_EQ(201, Lookup(200));
+  ASSERT_EQ(1, deleted_keys_.size());
+  ASSERT_EQ(100, deleted_keys_[0]);
+  ASSERT_EQ(101, deleted_values_[0]);
+
+  Erase(100);
+  ASSERT_EQ(-1,  Lookup(100));
+  ASSERT_EQ(201, Lookup(200));
+  ASSERT_EQ(1, deleted_keys_.size());
+}
+
+TEST(CacheTest, EntriesArePinned) {
+  Insert(100, 101);
+  Cache::Handle* h1 = cache_->Lookup(EncodeKey(100));
+  ASSERT_EQ(101, DecodeValue(cache_->Value(h1)));
+
+  Insert(100, 102);
+  Cache::Handle* h2 = cache_->Lookup(EncodeKey(100));
+  ASSERT_EQ(102, DecodeValue(cache_->Value(h2)));
+  ASSERT_EQ(0, deleted_keys_.size());
+
+  cache_->Release(h1);
+  ASSERT_EQ(1, deleted_keys_.size());
+  ASSERT_EQ(100, deleted_keys_[0]);
+  ASSERT_EQ(101, deleted_values_[0]);
+
+  Erase(100);
+  ASSERT_EQ(-1, Lookup(100));
+  ASSERT_EQ(1, deleted_keys_.size());
+
+  cache_->Release(h2);
+  ASSERT_EQ(2, deleted_keys_.size());
+  ASSERT_EQ(100, deleted_keys_[1]);
+  ASSERT_EQ(102, deleted_values_[1]);
+}
+
+TEST(CacheTest, EvictionPolicy) {
+  Insert(100, 101);
+  Insert(200, 201);
+  Insert(300, 301);
+  Cache::Handle* h = cache_->Lookup(EncodeKey(300));
+
+  // Frequently used entry must be kept around,
+  // as must things that are still in use.
+  for (int i = 0; i < kCacheSize + 100; i++) {
+    Insert(1000+i, 2000+i);
+    ASSERT_EQ(2000+i, Lookup(1000+i));
+    ASSERT_EQ(101, Lookup(100));
+  }
+  ASSERT_EQ(101, Lookup(100));
+  ASSERT_EQ(-1, Lookup(200));
+  ASSERT_EQ(301, Lookup(300));
+  cache_->Release(h);
+}
+
+TEST(CacheTest, UseExceedsCacheSize) {
+  // Overfill the cache, keeping handles on all inserted entries.
+  std::vector<Cache::Handle*> h;
+  for (int i = 0; i < kCacheSize + 100; i++) {
+    h.push_back(InsertAndReturnHandle(1000+i, 2000+i));
+  }
+
+  // Check that all the entries can be found in the cache.
+  for (int i = 0; i < h.size(); i++) {
+    ASSERT_EQ(2000+i, Lookup(1000+i));
+  }
+
+  for (int i = 0; i < h.size(); i++) {
+    cache_->Release(h[i]);
+  }
+}
+
+TEST(CacheTest, HeavyEntries) {
+  // Add a bunch of light and heavy entries and then count the combined
+  // size of items still in the cache, which must be approximately the
+  // same as the total capacity.
+  const int kLight = 1;
+  const int kHeavy = 10;
+  int added = 0;
+  int index = 0;
+  while (added < 2*kCacheSize) {
+    const int weight = (index & 1) ? kLight : kHeavy;
+    Insert(index, 1000+index, weight);
+    added += weight;
+    index++;
+  }
+
+  int cached_weight = 0;
+  for (int i = 0; i < index; i++) {
+    const int weight = (i & 1 ? kLight : kHeavy);
+    int r = Lookup(i);
+    if (r >= 0) {
+      cached_weight += weight;
+      ASSERT_EQ(1000+i, r);
+    }
+  }
+  ASSERT_LE(cached_weight, kCacheSize + kCacheSize/10);
+}
+
+TEST(CacheTest, NewId) {
+  uint64_t a = cache_->NewId();
+  uint64_t b = cache_->NewId();
+  ASSERT_NE(a, b);
+}
+
+TEST(CacheTest, Prune) {
+  Insert(1, 100);
+  Insert(2, 200);
+
+  Cache::Handle* handle = cache_->Lookup(EncodeKey(1));
+  ASSERT_TRUE(handle);
+  cache_->Prune();
+  cache_->Release(handle);
+
+  ASSERT_EQ(100, Lookup(1));
+  ASSERT_EQ(-1, Lookup(2));
+}
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/util/coding.cc b/depend/zcash/src/leveldb/util/coding.cc
new file mode 100644
index 000000000..21e3186d5
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/coding.cc
@@ -0,0 +1,194 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "util/coding.h"
+
+namespace leveldb {
+
+void EncodeFixed32(char* buf, uint32_t value) {
+  if (port::kLittleEndian) {
+    memcpy(buf, &value, sizeof(value));
+  } else {
+    buf[0] = value & 0xff;
+    buf[1] = (value >> 8) & 0xff;
+    buf[2] = (value >> 16) & 0xff;
+    buf[3] = (value >> 24) & 0xff;
+  }
+}
+
+void EncodeFixed64(char* buf, uint64_t value) {
+  if (port::kLittleEndian) {
+    memcpy(buf, &value, sizeof(value));
+  } else {
+    buf[0] = value & 0xff;
+    buf[1] = (value >> 8) & 0xff;
+    buf[2] = (value >> 16) & 0xff;
+    buf[3] = (value >> 24) & 0xff;
+    buf[4] = (value >> 32) & 0xff;
+    buf[5] = (value >> 40) & 0xff;
+    buf[6] = (value >> 48) & 0xff;
+    buf[7] = (value >> 56) & 0xff;
+  }
+}
+
+void PutFixed32(std::string* dst, uint32_t value) {
+  char buf[sizeof(value)];
+  EncodeFixed32(buf, value);
+  dst->append(buf, sizeof(buf));
+}
+
+void PutFixed64(std::string* dst, uint64_t value) {
+  char buf[sizeof(value)];
+  EncodeFixed64(buf, value);
+  dst->append(buf, sizeof(buf));
+}
+
+char* EncodeVarint32(char* dst, uint32_t v) {
+  // Operate on characters as unsigneds
+  unsigned char* ptr = reinterpret_cast<unsigned char*>(dst);
+  static const int B = 128;
+  if (v < (1<<7)) {
+    *(ptr++) = v;
+  } else if (v < (1<<14)) {
+    *(ptr++) = v | B;
+    *(ptr++) = v>>7;
+  } else if (v < (1<<21)) {
+    *(ptr++) = v | B;
+    *(ptr++) = (v>>7) | B;
+    *(ptr++) = v>>14;
+  } else if (v < (1<<28)) {
+    *(ptr++) = v | B;
+    *(ptr++) = (v>>7) | B;
+    *(ptr++) = (v>>14) | B;
+    *(ptr++) = v>>21;
+  } else {
+    *(ptr++) = v | B;
+    *(ptr++) = (v>>7) | B;
+    *(ptr++) = (v>>14) | B;
+    *(ptr++) = (v>>21) | B;
+    *(ptr++) = v>>28;
+  }
+  return reinterpret_cast<char*>(ptr);
+}
+
+void PutVarint32(std::string* dst, uint32_t v) {
+  char buf[5];
+  char* ptr = EncodeVarint32(buf, v);
+  dst->append(buf, ptr - buf);
+}
+
+char* EncodeVarint64(char* dst, uint64_t v) {
+  static const int B = 128;
+  unsigned char* ptr = reinterpret_cast<unsigned char*>(dst);
+  while (v >= B) {
+    *(ptr++) = (v & (B-1)) | B;
+    v >>= 7;
+  }
+  *(ptr++) = static_cast<unsigned char>(v);
+  return reinterpret_cast<char*>(ptr);
+}
+
+void PutVarint64(std::string* dst, uint64_t v) {
+  char buf[10];
+  char* ptr = EncodeVarint64(buf, v);
+  dst->append(buf, ptr - buf);
+}
+
+void PutLengthPrefixedSlice(std::string* dst, const Slice& value) {
+  PutVarint32(dst, value.size());
+  dst->append(value.data(), value.size());
+}
+
+int VarintLength(uint64_t v) {
+  int len = 1;
+  while (v >= 128) {
+    v >>= 7;
+    len++;
+  }
+  return len;
+}
+
+const char* GetVarint32PtrFallback(const char* p,
+                                   const char* limit,
+                                   uint32_t* value) {
+  uint32_t result = 0;
+  for (uint32_t shift = 0; shift <= 28 && p < limit; shift += 7) {
+    uint32_t byte = *(reinterpret_cast<const unsigned char*>(p));
+    p++;
+    if (byte & 128) {
+      // More bytes are present
+      result |= ((byte & 127) << shift);
+    } else {
+      result |= (byte << shift);
+      *value = result;
+      return reinterpret_cast<const char*>(p);
+    }
+  }
+  return NULL;
+}
+
+bool GetVarint32(Slice* input, uint32_t* value) {
+  const char* p = input->data();
+  const char* limit = p + input->size();
+  const char* q = GetVarint32Ptr(p, limit, value);
+  if (q == NULL) {
+    return false;
+  } else {
+    *input = Slice(q, limit - q);
+    return true;
+  }
+}
+
+const char* GetVarint64Ptr(const char* p, const char* limit, uint64_t* value) {
+  uint64_t result = 0;
+  for (uint32_t shift = 0; shift <= 63 && p < limit; shift += 7) {
+    uint64_t byte = *(reinterpret_cast<const unsigned char*>(p));
+    p++;
+    if (byte & 128) {
+      // More bytes are present
+      result |= ((byte & 127) << shift);
+    } else {
+      result |= (byte << shift);
+      *value = result;
+      return reinterpret_cast<const char*>(p);
+    }
+  }
+  return NULL;
+}
+
+bool GetVarint64(Slice* input, uint64_t* value) {
+  const char* p = input->data();
+  const char* limit = p + input->size();
+  const char* q = GetVarint64Ptr(p, limit, value);
+  if (q == NULL) {
+    return false;
+  } else {
+    *input = Slice(q, limit - q);
+    return true;
+  }
+}
+
+const char* GetLengthPrefixedSlice(const char* p, const char* limit,
+                                   Slice* result) {
+  uint32_t len;
+  p = GetVarint32Ptr(p, limit, &len);
+  if (p == NULL) return NULL;
+  if (p + len > limit) return NULL;
+  *result = Slice(p, len);
+  return p + len;
+}
+
+bool GetLengthPrefixedSlice(Slice* input, Slice* result) {
+  uint32_t len;
+  if (GetVarint32(input, &len) &&
+      input->size() >= len) {
+    *result = Slice(input->data(), len);
+    input->remove_prefix(len);
+    return true;
+  } else {
+    return false;
+  }
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/util/coding.h b/depend/zcash/src/leveldb/util/coding.h
new file mode 100644
index 000000000..3993c4a75
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/coding.h
@@ -0,0 +1,104 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// Endian-neutral encoding:
+// * Fixed-length numbers are encoded with least-significant byte first
+// * In addition we support variable length "varint" encoding
+// * Strings are encoded prefixed by their length in varint format
+
+#ifndef STORAGE_LEVELDB_UTIL_CODING_H_
+#define STORAGE_LEVELDB_UTIL_CODING_H_
+
+#include <stdint.h>
+#include <string.h>
+#include <string>
+#include "leveldb/slice.h"
+#include "port/port.h"
+
+namespace leveldb {
+
+// Standard Put... routines append to a string
+extern void PutFixed32(std::string* dst, uint32_t value);
+extern void PutFixed64(std::string* dst, uint64_t value);
+extern void PutVarint32(std::string* dst, uint32_t value);
+extern void PutVarint64(std::string* dst, uint64_t value);
+extern void PutLengthPrefixedSlice(std::string* dst, const Slice& value);
+
+// Standard Get... routines parse a value from the beginning of a Slice
+// and advance the slice past the parsed value.
+extern bool GetVarint32(Slice* input, uint32_t* value);
+extern bool GetVarint64(Slice* input, uint64_t* value);
+extern bool GetLengthPrefixedSlice(Slice* input, Slice* result);
+
+// Pointer-based variants of GetVarint...  These either store a value
+// in *v and return a pointer just past the parsed value, or return
+// NULL on error.  These routines only look at bytes in the range
+// [p..limit-1]
+extern const char* GetVarint32Ptr(const char* p,const char* limit, uint32_t* v);
+extern const char* GetVarint64Ptr(const char* p,const char* limit, uint64_t* v);
+
+// Returns the length of the varint32 or varint64 encoding of "v"
+extern int VarintLength(uint64_t v);
+
+// Lower-level versions of Put... that write directly into a character buffer
+// REQUIRES: dst has enough space for the value being written
+extern void EncodeFixed32(char* dst, uint32_t value);
+extern void EncodeFixed64(char* dst, uint64_t value);
+
+// Lower-level versions of Put... that write directly into a character buffer
+// and return a pointer just past the last byte written.
+// REQUIRES: dst has enough space for the value being written
+extern char* EncodeVarint32(char* dst, uint32_t value);
+extern char* EncodeVarint64(char* dst, uint64_t value);
+
+// Lower-level versions of Get... that read directly from a character buffer
+// without any bounds checking.
+
+inline uint32_t DecodeFixed32(const char* ptr) {
+  if (port::kLittleEndian) {
+    // Load the raw bytes
+    uint32_t result;
+    memcpy(&result, ptr, sizeof(result));  // gcc optimizes this to a plain load
+    return result;
+  } else {
+    return ((static_cast<uint32_t>(static_cast<unsigned char>(ptr[0])))
+        | (static_cast<uint32_t>(static_cast<unsigned char>(ptr[1])) << 8)
+        | (static_cast<uint32_t>(static_cast<unsigned char>(ptr[2])) << 16)
+        | (static_cast<uint32_t>(static_cast<unsigned char>(ptr[3])) << 24));
+  }
+}
+
+inline uint64_t DecodeFixed64(const char* ptr) {
+  if (port::kLittleEndian) {
+    // Load the raw bytes
+    uint64_t result;
+    memcpy(&result, ptr, sizeof(result));  // gcc optimizes this to a plain load
+    return result;
+  } else {
+    uint64_t lo = DecodeFixed32(ptr);
+    uint64_t hi = DecodeFixed32(ptr + 4);
+    return (hi << 32) | lo;
+  }
+}
+
+// Internal routine for use by fallback path of GetVarint32Ptr
+extern const char* GetVarint32PtrFallback(const char* p,
+                                          const char* limit,
+                                          uint32_t* value);
+inline const char* GetVarint32Ptr(const char* p,
+                                  const char* limit,
+                                  uint32_t* value) {
+  if (p < limit) {
+    uint32_t result = *(reinterpret_cast<const unsigned char*>(p));
+    if ((result & 128) == 0) {
+      *value = result;
+      return p + 1;
+    }
+  }
+  return GetVarint32PtrFallback(p, limit, value);
+}
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_UTIL_CODING_H_
diff --git a/depend/zcash/src/leveldb/util/coding_test.cc b/depend/zcash/src/leveldb/util/coding_test.cc
new file mode 100644
index 000000000..521541ea6
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/coding_test.cc
@@ -0,0 +1,196 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "util/coding.h"
+
+#include "util/testharness.h"
+
+namespace leveldb {
+
+class Coding { };
+
+TEST(Coding, Fixed32) {
+  std::string s;
+  for (uint32_t v = 0; v < 100000; v++) {
+    PutFixed32(&s, v);
+  }
+
+  const char* p = s.data();
+  for (uint32_t v = 0; v < 100000; v++) {
+    uint32_t actual = DecodeFixed32(p);
+    ASSERT_EQ(v, actual);
+    p += sizeof(uint32_t);
+  }
+}
+
+TEST(Coding, Fixed64) {
+  std::string s;
+  for (int power = 0; power <= 63; power++) {
+    uint64_t v = static_cast<uint64_t>(1) << power;
+    PutFixed64(&s, v - 1);
+    PutFixed64(&s, v + 0);
+    PutFixed64(&s, v + 1);
+  }
+
+  const char* p = s.data();
+  for (int power = 0; power <= 63; power++) {
+    uint64_t v = static_cast<uint64_t>(1) << power;
+    uint64_t actual;
+    actual = DecodeFixed64(p);
+    ASSERT_EQ(v-1, actual);
+    p += sizeof(uint64_t);
+
+    actual = DecodeFixed64(p);
+    ASSERT_EQ(v+0, actual);
+    p += sizeof(uint64_t);
+
+    actual = DecodeFixed64(p);
+    ASSERT_EQ(v+1, actual);
+    p += sizeof(uint64_t);
+  }
+}
+
+// Test that encoding routines generate little-endian encodings
+TEST(Coding, EncodingOutput) {
+  std::string dst;
+  PutFixed32(&dst, 0x04030201);
+  ASSERT_EQ(4, dst.size());
+  ASSERT_EQ(0x01, static_cast<int>(dst[0]));
+  ASSERT_EQ(0x02, static_cast<int>(dst[1]));
+  ASSERT_EQ(0x03, static_cast<int>(dst[2]));
+  ASSERT_EQ(0x04, static_cast<int>(dst[3]));
+
+  dst.clear();
+  PutFixed64(&dst, 0x0807060504030201ull);
+  ASSERT_EQ(8, dst.size());
+  ASSERT_EQ(0x01, static_cast<int>(dst[0]));
+  ASSERT_EQ(0x02, static_cast<int>(dst[1]));
+  ASSERT_EQ(0x03, static_cast<int>(dst[2]));
+  ASSERT_EQ(0x04, static_cast<int>(dst[3]));
+  ASSERT_EQ(0x05, static_cast<int>(dst[4]));
+  ASSERT_EQ(0x06, static_cast<int>(dst[5]));
+  ASSERT_EQ(0x07, static_cast<int>(dst[6]));
+  ASSERT_EQ(0x08, static_cast<int>(dst[7]));
+}
+
+TEST(Coding, Varint32) {
+  std::string s;
+  for (uint32_t i = 0; i < (32 * 32); i++) {
+    uint32_t v = (i / 32) << (i % 32);
+    PutVarint32(&s, v);
+  }
+
+  const char* p = s.data();
+  const char* limit = p + s.size();
+  for (uint32_t i = 0; i < (32 * 32); i++) {
+    uint32_t expected = (i / 32) << (i % 32);
+    uint32_t actual;
+    const char* start = p;
+    p = GetVarint32Ptr(p, limit, &actual);
+    ASSERT_TRUE(p != NULL);
+    ASSERT_EQ(expected, actual);
+    ASSERT_EQ(VarintLength(actual), p - start);
+  }
+  ASSERT_EQ(p, s.data() + s.size());
+}
+
+TEST(Coding, Varint64) {
+  // Construct the list of values to check
+  std::vector<uint64_t> values;
+  // Some special values
+  values.push_back(0);
+  values.push_back(100);
+  values.push_back(~static_cast<uint64_t>(0));
+  values.push_back(~static_cast<uint64_t>(0) - 1);
+  for (uint32_t k = 0; k < 64; k++) {
+    // Test values near powers of two
+    const uint64_t power = 1ull << k;
+    values.push_back(power);
+    values.push_back(power-1);
+    values.push_back(power+1);
+  }
+
+  std::string s;
+  for (size_t i = 0; i < values.size(); i++) {
+    PutVarint64(&s, values[i]);
+  }
+
+  const char* p = s.data();
+  const char* limit = p + s.size();
+  for (size_t i = 0; i < values.size(); i++) {
+    ASSERT_TRUE(p < limit);
+    uint64_t actual;
+    const char* start = p;
+    p = GetVarint64Ptr(p, limit, &actual);
+    ASSERT_TRUE(p != NULL);
+    ASSERT_EQ(values[i], actual);
+    ASSERT_EQ(VarintLength(actual), p - start);
+  }
+  ASSERT_EQ(p, limit);
+
+}
+
+TEST(Coding, Varint32Overflow) {
+  uint32_t result;
+  std::string input("\x81\x82\x83\x84\x85\x11");
+  ASSERT_TRUE(GetVarint32Ptr(input.data(), input.data() + input.size(), &result)
+              == NULL);
+}
+
+TEST(Coding, Varint32Truncation) {
+  uint32_t large_value = (1u << 31) + 100;
+  std::string s;
+  PutVarint32(&s, large_value);
+  uint32_t result;
+  for (size_t len = 0; len < s.size() - 1; len++) {
+    ASSERT_TRUE(GetVarint32Ptr(s.data(), s.data() + len, &result) == NULL);
+  }
+  ASSERT_TRUE(GetVarint32Ptr(s.data(), s.data() + s.size(), &result) != NULL);
+  ASSERT_EQ(large_value, result);
+}
+
+TEST(Coding, Varint64Overflow) {
+  uint64_t result;
+  std::string input("\x81\x82\x83\x84\x85\x81\x82\x83\x84\x85\x11");
+  ASSERT_TRUE(GetVarint64Ptr(input.data(), input.data() + input.size(), &result)
+              == NULL);
+}
+
+TEST(Coding, Varint64Truncation) {
+  uint64_t large_value = (1ull << 63) + 100ull;
+  std::string s;
+  PutVarint64(&s, large_value);
+  uint64_t result;
+  for (size_t len = 0; len < s.size() - 1; len++) {
+    ASSERT_TRUE(GetVarint64Ptr(s.data(), s.data() + len, &result) == NULL);
+  }
+  ASSERT_TRUE(GetVarint64Ptr(s.data(), s.data() + s.size(), &result) != NULL);
+  ASSERT_EQ(large_value, result);
+}
+
+TEST(Coding, Strings) {
+  std::string s;
+  PutLengthPrefixedSlice(&s, Slice(""));
+  PutLengthPrefixedSlice(&s, Slice("foo"));
+  PutLengthPrefixedSlice(&s, Slice("bar"));
+  PutLengthPrefixedSlice(&s, Slice(std::string(200, 'x')));
+
+  Slice input(s);
+  Slice v;
+  ASSERT_TRUE(GetLengthPrefixedSlice(&input, &v));
+  ASSERT_EQ("", v.ToString());
+  ASSERT_TRUE(GetLengthPrefixedSlice(&input, &v));
+  ASSERT_EQ("foo", v.ToString());
+  ASSERT_TRUE(GetLengthPrefixedSlice(&input, &v));
+  ASSERT_EQ("bar", v.ToString());
+  ASSERT_TRUE(GetLengthPrefixedSlice(&input, &v));
+  ASSERT_EQ(std::string(200, 'x'), v.ToString());
+  ASSERT_EQ("", input.ToString());
+}
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/util/comparator.cc b/depend/zcash/src/leveldb/util/comparator.cc
new file mode 100644
index 000000000..4b7b5724e
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/comparator.cc
@@ -0,0 +1,81 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include <algorithm>
+#include <stdint.h>
+#include "leveldb/comparator.h"
+#include "leveldb/slice.h"
+#include "port/port.h"
+#include "util/logging.h"
+
+namespace leveldb {
+
+Comparator::~Comparator() { }
+
+namespace {
+class BytewiseComparatorImpl : public Comparator {
+ public:
+  BytewiseComparatorImpl() { }
+
+  virtual const char* Name() const {
+    return "leveldb.BytewiseComparator";
+  }
+
+  virtual int Compare(const Slice& a, const Slice& b) const {
+    return a.compare(b);
+  }
+
+  virtual void FindShortestSeparator(
+      std::string* start,
+      const Slice& limit) const {
+    // Find length of common prefix
+    size_t min_length = std::min(start->size(), limit.size());
+    size_t diff_index = 0;
+    while ((diff_index < min_length) &&
+           ((*start)[diff_index] == limit[diff_index])) {
+      diff_index++;
+    }
+
+    if (diff_index >= min_length) {
+      // Do not shorten if one string is a prefix of the other
+    } else {
+      uint8_t diff_byte = static_cast<uint8_t>((*start)[diff_index]);
+      if (diff_byte < static_cast<uint8_t>(0xff) &&
+          diff_byte + 1 < static_cast<uint8_t>(limit[diff_index])) {
+        (*start)[diff_index]++;
+        start->resize(diff_index + 1);
+        assert(Compare(*start, limit) < 0);
+      }
+    }
+  }
+
+  virtual void FindShortSuccessor(std::string* key) const {
+    // Find first character that can be incremented
+    size_t n = key->size();
+    for (size_t i = 0; i < n; i++) {
+      const uint8_t byte = (*key)[i];
+      if (byte != static_cast<uint8_t>(0xff)) {
+        (*key)[i] = byte + 1;
+        key->resize(i+1);
+        return;
+      }
+    }
+    // *key is a run of 0xffs.  Leave it alone.
+  }
+};
+}  // namespace
+
+static port::OnceType once = LEVELDB_ONCE_INIT;
+static const Comparator* bytewise;
+
+static void InitModule() {
+  bytewise = new BytewiseComparatorImpl;
+}
+
+const Comparator* BytewiseComparator() {
+  port::InitOnce(&once, InitModule);
+  return bytewise;
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/util/crc32c.cc b/depend/zcash/src/leveldb/util/crc32c.cc
new file mode 100644
index 000000000..b3f40eeee
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/crc32c.cc
@@ -0,0 +1,354 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// A portable implementation of crc32c, optimized to handle
+// four bytes at a time.
+
+#include "util/crc32c.h"
+
+#include <stdint.h>
+
+#include "port/port.h"
+#include "util/coding.h"
+
+namespace leveldb {
+namespace crc32c {
+
+static const uint32_t table0_[256] = {
+  0x00000000, 0xf26b8303, 0xe13b70f7, 0x1350f3f4,
+  0xc79a971f, 0x35f1141c, 0x26a1e7e8, 0xd4ca64eb,
+  0x8ad958cf, 0x78b2dbcc, 0x6be22838, 0x9989ab3b,
+  0x4d43cfd0, 0xbf284cd3, 0xac78bf27, 0x5e133c24,
+  0x105ec76f, 0xe235446c, 0xf165b798, 0x030e349b,
+  0xd7c45070, 0x25afd373, 0x36ff2087, 0xc494a384,
+  0x9a879fa0, 0x68ec1ca3, 0x7bbcef57, 0x89d76c54,
+  0x5d1d08bf, 0xaf768bbc, 0xbc267848, 0x4e4dfb4b,
+  0x20bd8ede, 0xd2d60ddd, 0xc186fe29, 0x33ed7d2a,
+  0xe72719c1, 0x154c9ac2, 0x061c6936, 0xf477ea35,
+  0xaa64d611, 0x580f5512, 0x4b5fa6e6, 0xb93425e5,
+  0x6dfe410e, 0x9f95c20d, 0x8cc531f9, 0x7eaeb2fa,
+  0x30e349b1, 0xc288cab2, 0xd1d83946, 0x23b3ba45,
+  0xf779deae, 0x05125dad, 0x1642ae59, 0xe4292d5a,
+  0xba3a117e, 0x4851927d, 0x5b016189, 0xa96ae28a,
+  0x7da08661, 0x8fcb0562, 0x9c9bf696, 0x6ef07595,
+  0x417b1dbc, 0xb3109ebf, 0xa0406d4b, 0x522bee48,
+  0x86e18aa3, 0x748a09a0, 0x67dafa54, 0x95b17957,
+  0xcba24573, 0x39c9c670, 0x2a993584, 0xd8f2b687,
+  0x0c38d26c, 0xfe53516f, 0xed03a29b, 0x1f682198,
+  0x5125dad3, 0xa34e59d0, 0xb01eaa24, 0x42752927,
+  0x96bf4dcc, 0x64d4cecf, 0x77843d3b, 0x85efbe38,
+  0xdbfc821c, 0x2997011f, 0x3ac7f2eb, 0xc8ac71e8,
+  0x1c661503, 0xee0d9600, 0xfd5d65f4, 0x0f36e6f7,
+  0x61c69362, 0x93ad1061, 0x80fde395, 0x72966096,
+  0xa65c047d, 0x5437877e, 0x4767748a, 0xb50cf789,
+  0xeb1fcbad, 0x197448ae, 0x0a24bb5a, 0xf84f3859,
+  0x2c855cb2, 0xdeeedfb1, 0xcdbe2c45, 0x3fd5af46,
+  0x7198540d, 0x83f3d70e, 0x90a324fa, 0x62c8a7f9,
+  0xb602c312, 0x44694011, 0x5739b3e5, 0xa55230e6,
+  0xfb410cc2, 0x092a8fc1, 0x1a7a7c35, 0xe811ff36,
+  0x3cdb9bdd, 0xceb018de, 0xdde0eb2a, 0x2f8b6829,
+  0x82f63b78, 0x709db87b, 0x63cd4b8f, 0x91a6c88c,
+  0x456cac67, 0xb7072f64, 0xa457dc90, 0x563c5f93,
+  0x082f63b7, 0xfa44e0b4, 0xe9141340, 0x1b7f9043,
+  0xcfb5f4a8, 0x3dde77ab, 0x2e8e845f, 0xdce5075c,
+  0x92a8fc17, 0x60c37f14, 0x73938ce0, 0x81f80fe3,
+  0x55326b08, 0xa759e80b, 0xb4091bff, 0x466298fc,
+  0x1871a4d8, 0xea1a27db, 0xf94ad42f, 0x0b21572c,
+  0xdfeb33c7, 0x2d80b0c4, 0x3ed04330, 0xccbbc033,
+  0xa24bb5a6, 0x502036a5, 0x4370c551, 0xb11b4652,
+  0x65d122b9, 0x97baa1ba, 0x84ea524e, 0x7681d14d,
+  0x2892ed69, 0xdaf96e6a, 0xc9a99d9e, 0x3bc21e9d,
+  0xef087a76, 0x1d63f975, 0x0e330a81, 0xfc588982,
+  0xb21572c9, 0x407ef1ca, 0x532e023e, 0xa145813d,
+  0x758fe5d6, 0x87e466d5, 0x94b49521, 0x66df1622,
+  0x38cc2a06, 0xcaa7a905, 0xd9f75af1, 0x2b9cd9f2,
+  0xff56bd19, 0x0d3d3e1a, 0x1e6dcdee, 0xec064eed,
+  0xc38d26c4, 0x31e6a5c7, 0x22b65633, 0xd0ddd530,
+  0x0417b1db, 0xf67c32d8, 0xe52cc12c, 0x1747422f,
+  0x49547e0b, 0xbb3ffd08, 0xa86f0efc, 0x5a048dff,
+  0x8ecee914, 0x7ca56a17, 0x6ff599e3, 0x9d9e1ae0,
+  0xd3d3e1ab, 0x21b862a8, 0x32e8915c, 0xc083125f,
+  0x144976b4, 0xe622f5b7, 0xf5720643, 0x07198540,
+  0x590ab964, 0xab613a67, 0xb831c993, 0x4a5a4a90,
+  0x9e902e7b, 0x6cfbad78, 0x7fab5e8c, 0x8dc0dd8f,
+  0xe330a81a, 0x115b2b19, 0x020bd8ed, 0xf0605bee,
+  0x24aa3f05, 0xd6c1bc06, 0xc5914ff2, 0x37faccf1,
+  0x69e9f0d5, 0x9b8273d6, 0x88d28022, 0x7ab90321,
+  0xae7367ca, 0x5c18e4c9, 0x4f48173d, 0xbd23943e,
+  0xf36e6f75, 0x0105ec76, 0x12551f82, 0xe03e9c81,
+  0x34f4f86a, 0xc69f7b69, 0xd5cf889d, 0x27a40b9e,
+  0x79b737ba, 0x8bdcb4b9, 0x988c474d, 0x6ae7c44e,
+  0xbe2da0a5, 0x4c4623a6, 0x5f16d052, 0xad7d5351
+};
+static const uint32_t table1_[256] = {
+  0x00000000, 0x13a29877, 0x274530ee, 0x34e7a899,
+  0x4e8a61dc, 0x5d28f9ab, 0x69cf5132, 0x7a6dc945,
+  0x9d14c3b8, 0x8eb65bcf, 0xba51f356, 0xa9f36b21,
+  0xd39ea264, 0xc03c3a13, 0xf4db928a, 0xe7790afd,
+  0x3fc5f181, 0x2c6769f6, 0x1880c16f, 0x0b225918,
+  0x714f905d, 0x62ed082a, 0x560aa0b3, 0x45a838c4,
+  0xa2d13239, 0xb173aa4e, 0x859402d7, 0x96369aa0,
+  0xec5b53e5, 0xfff9cb92, 0xcb1e630b, 0xd8bcfb7c,
+  0x7f8be302, 0x6c297b75, 0x58ced3ec, 0x4b6c4b9b,
+  0x310182de, 0x22a31aa9, 0x1644b230, 0x05e62a47,
+  0xe29f20ba, 0xf13db8cd, 0xc5da1054, 0xd6788823,
+  0xac154166, 0xbfb7d911, 0x8b507188, 0x98f2e9ff,
+  0x404e1283, 0x53ec8af4, 0x670b226d, 0x74a9ba1a,
+  0x0ec4735f, 0x1d66eb28, 0x298143b1, 0x3a23dbc6,
+  0xdd5ad13b, 0xcef8494c, 0xfa1fe1d5, 0xe9bd79a2,
+  0x93d0b0e7, 0x80722890, 0xb4958009, 0xa737187e,
+  0xff17c604, 0xecb55e73, 0xd852f6ea, 0xcbf06e9d,
+  0xb19da7d8, 0xa23f3faf, 0x96d89736, 0x857a0f41,
+  0x620305bc, 0x71a19dcb, 0x45463552, 0x56e4ad25,
+  0x2c896460, 0x3f2bfc17, 0x0bcc548e, 0x186eccf9,
+  0xc0d23785, 0xd370aff2, 0xe797076b, 0xf4359f1c,
+  0x8e585659, 0x9dface2e, 0xa91d66b7, 0xbabffec0,
+  0x5dc6f43d, 0x4e646c4a, 0x7a83c4d3, 0x69215ca4,
+  0x134c95e1, 0x00ee0d96, 0x3409a50f, 0x27ab3d78,
+  0x809c2506, 0x933ebd71, 0xa7d915e8, 0xb47b8d9f,
+  0xce1644da, 0xddb4dcad, 0xe9537434, 0xfaf1ec43,
+  0x1d88e6be, 0x0e2a7ec9, 0x3acdd650, 0x296f4e27,
+  0x53028762, 0x40a01f15, 0x7447b78c, 0x67e52ffb,
+  0xbf59d487, 0xacfb4cf0, 0x981ce469, 0x8bbe7c1e,
+  0xf1d3b55b, 0xe2712d2c, 0xd69685b5, 0xc5341dc2,
+  0x224d173f, 0x31ef8f48, 0x050827d1, 0x16aabfa6,
+  0x6cc776e3, 0x7f65ee94, 0x4b82460d, 0x5820de7a,
+  0xfbc3faf9, 0xe861628e, 0xdc86ca17, 0xcf245260,
+  0xb5499b25, 0xa6eb0352, 0x920cabcb, 0x81ae33bc,
+  0x66d73941, 0x7575a136, 0x419209af, 0x523091d8,
+  0x285d589d, 0x3bffc0ea, 0x0f186873, 0x1cbaf004,
+  0xc4060b78, 0xd7a4930f, 0xe3433b96, 0xf0e1a3e1,
+  0x8a8c6aa4, 0x992ef2d3, 0xadc95a4a, 0xbe6bc23d,
+  0x5912c8c0, 0x4ab050b7, 0x7e57f82e, 0x6df56059,
+  0x1798a91c, 0x043a316b, 0x30dd99f2, 0x237f0185,
+  0x844819fb, 0x97ea818c, 0xa30d2915, 0xb0afb162,
+  0xcac27827, 0xd960e050, 0xed8748c9, 0xfe25d0be,
+  0x195cda43, 0x0afe4234, 0x3e19eaad, 0x2dbb72da,
+  0x57d6bb9f, 0x447423e8, 0x70938b71, 0x63311306,
+  0xbb8de87a, 0xa82f700d, 0x9cc8d894, 0x8f6a40e3,
+  0xf50789a6, 0xe6a511d1, 0xd242b948, 0xc1e0213f,
+  0x26992bc2, 0x353bb3b5, 0x01dc1b2c, 0x127e835b,
+  0x68134a1e, 0x7bb1d269, 0x4f567af0, 0x5cf4e287,
+  0x04d43cfd, 0x1776a48a, 0x23910c13, 0x30339464,
+  0x4a5e5d21, 0x59fcc556, 0x6d1b6dcf, 0x7eb9f5b8,
+  0x99c0ff45, 0x8a626732, 0xbe85cfab, 0xad2757dc,
+  0xd74a9e99, 0xc4e806ee, 0xf00fae77, 0xe3ad3600,
+  0x3b11cd7c, 0x28b3550b, 0x1c54fd92, 0x0ff665e5,
+  0x759baca0, 0x663934d7, 0x52de9c4e, 0x417c0439,
+  0xa6050ec4, 0xb5a796b3, 0x81403e2a, 0x92e2a65d,
+  0xe88f6f18, 0xfb2df76f, 0xcfca5ff6, 0xdc68c781,
+  0x7b5fdfff, 0x68fd4788, 0x5c1aef11, 0x4fb87766,
+  0x35d5be23, 0x26772654, 0x12908ecd, 0x013216ba,
+  0xe64b1c47, 0xf5e98430, 0xc10e2ca9, 0xd2acb4de,
+  0xa8c17d9b, 0xbb63e5ec, 0x8f844d75, 0x9c26d502,
+  0x449a2e7e, 0x5738b609, 0x63df1e90, 0x707d86e7,
+  0x0a104fa2, 0x19b2d7d5, 0x2d557f4c, 0x3ef7e73b,
+  0xd98eedc6, 0xca2c75b1, 0xfecbdd28, 0xed69455f,
+  0x97048c1a, 0x84a6146d, 0xb041bcf4, 0xa3e32483
+};
+static const uint32_t table2_[256] = {
+  0x00000000, 0xa541927e, 0x4f6f520d, 0xea2ec073,
+  0x9edea41a, 0x3b9f3664, 0xd1b1f617, 0x74f06469,
+  0x38513ec5, 0x9d10acbb, 0x773e6cc8, 0xd27ffeb6,
+  0xa68f9adf, 0x03ce08a1, 0xe9e0c8d2, 0x4ca15aac,
+  0x70a27d8a, 0xd5e3eff4, 0x3fcd2f87, 0x9a8cbdf9,
+  0xee7cd990, 0x4b3d4bee, 0xa1138b9d, 0x045219e3,
+  0x48f3434f, 0xedb2d131, 0x079c1142, 0xa2dd833c,
+  0xd62de755, 0x736c752b, 0x9942b558, 0x3c032726,
+  0xe144fb14, 0x4405696a, 0xae2ba919, 0x0b6a3b67,
+  0x7f9a5f0e, 0xdadbcd70, 0x30f50d03, 0x95b49f7d,
+  0xd915c5d1, 0x7c5457af, 0x967a97dc, 0x333b05a2,
+  0x47cb61cb, 0xe28af3b5, 0x08a433c6, 0xade5a1b8,
+  0x91e6869e, 0x34a714e0, 0xde89d493, 0x7bc846ed,
+  0x0f382284, 0xaa79b0fa, 0x40577089, 0xe516e2f7,
+  0xa9b7b85b, 0x0cf62a25, 0xe6d8ea56, 0x43997828,
+  0x37691c41, 0x92288e3f, 0x78064e4c, 0xdd47dc32,
+  0xc76580d9, 0x622412a7, 0x880ad2d4, 0x2d4b40aa,
+  0x59bb24c3, 0xfcfab6bd, 0x16d476ce, 0xb395e4b0,
+  0xff34be1c, 0x5a752c62, 0xb05bec11, 0x151a7e6f,
+  0x61ea1a06, 0xc4ab8878, 0x2e85480b, 0x8bc4da75,
+  0xb7c7fd53, 0x12866f2d, 0xf8a8af5e, 0x5de93d20,
+  0x29195949, 0x8c58cb37, 0x66760b44, 0xc337993a,
+  0x8f96c396, 0x2ad751e8, 0xc0f9919b, 0x65b803e5,
+  0x1148678c, 0xb409f5f2, 0x5e273581, 0xfb66a7ff,
+  0x26217bcd, 0x8360e9b3, 0x694e29c0, 0xcc0fbbbe,
+  0xb8ffdfd7, 0x1dbe4da9, 0xf7908dda, 0x52d11fa4,
+  0x1e704508, 0xbb31d776, 0x511f1705, 0xf45e857b,
+  0x80aee112, 0x25ef736c, 0xcfc1b31f, 0x6a802161,
+  0x56830647, 0xf3c29439, 0x19ec544a, 0xbcadc634,
+  0xc85da25d, 0x6d1c3023, 0x8732f050, 0x2273622e,
+  0x6ed23882, 0xcb93aafc, 0x21bd6a8f, 0x84fcf8f1,
+  0xf00c9c98, 0x554d0ee6, 0xbf63ce95, 0x1a225ceb,
+  0x8b277743, 0x2e66e53d, 0xc448254e, 0x6109b730,
+  0x15f9d359, 0xb0b84127, 0x5a968154, 0xffd7132a,
+  0xb3764986, 0x1637dbf8, 0xfc191b8b, 0x595889f5,
+  0x2da8ed9c, 0x88e97fe2, 0x62c7bf91, 0xc7862def,
+  0xfb850ac9, 0x5ec498b7, 0xb4ea58c4, 0x11abcaba,
+  0x655baed3, 0xc01a3cad, 0x2a34fcde, 0x8f756ea0,
+  0xc3d4340c, 0x6695a672, 0x8cbb6601, 0x29faf47f,
+  0x5d0a9016, 0xf84b0268, 0x1265c21b, 0xb7245065,
+  0x6a638c57, 0xcf221e29, 0x250cde5a, 0x804d4c24,
+  0xf4bd284d, 0x51fcba33, 0xbbd27a40, 0x1e93e83e,
+  0x5232b292, 0xf77320ec, 0x1d5de09f, 0xb81c72e1,
+  0xccec1688, 0x69ad84f6, 0x83834485, 0x26c2d6fb,
+  0x1ac1f1dd, 0xbf8063a3, 0x55aea3d0, 0xf0ef31ae,
+  0x841f55c7, 0x215ec7b9, 0xcb7007ca, 0x6e3195b4,
+  0x2290cf18, 0x87d15d66, 0x6dff9d15, 0xc8be0f6b,
+  0xbc4e6b02, 0x190ff97c, 0xf321390f, 0x5660ab71,
+  0x4c42f79a, 0xe90365e4, 0x032da597, 0xa66c37e9,
+  0xd29c5380, 0x77ddc1fe, 0x9df3018d, 0x38b293f3,
+  0x7413c95f, 0xd1525b21, 0x3b7c9b52, 0x9e3d092c,
+  0xeacd6d45, 0x4f8cff3b, 0xa5a23f48, 0x00e3ad36,
+  0x3ce08a10, 0x99a1186e, 0x738fd81d, 0xd6ce4a63,
+  0xa23e2e0a, 0x077fbc74, 0xed517c07, 0x4810ee79,
+  0x04b1b4d5, 0xa1f026ab, 0x4bdee6d8, 0xee9f74a6,
+  0x9a6f10cf, 0x3f2e82b1, 0xd50042c2, 0x7041d0bc,
+  0xad060c8e, 0x08479ef0, 0xe2695e83, 0x4728ccfd,
+  0x33d8a894, 0x96993aea, 0x7cb7fa99, 0xd9f668e7,
+  0x9557324b, 0x3016a035, 0xda386046, 0x7f79f238,
+  0x0b899651, 0xaec8042f, 0x44e6c45c, 0xe1a75622,
+  0xdda47104, 0x78e5e37a, 0x92cb2309, 0x378ab177,
+  0x437ad51e, 0xe63b4760, 0x0c158713, 0xa954156d,
+  0xe5f54fc1, 0x40b4ddbf, 0xaa9a1dcc, 0x0fdb8fb2,
+  0x7b2bebdb, 0xde6a79a5, 0x3444b9d6, 0x91052ba8
+};
+static const uint32_t table3_[256] = {
+  0x00000000, 0xdd45aab8, 0xbf672381, 0x62228939,
+  0x7b2231f3, 0xa6679b4b, 0xc4451272, 0x1900b8ca,
+  0xf64463e6, 0x2b01c95e, 0x49234067, 0x9466eadf,
+  0x8d665215, 0x5023f8ad, 0x32017194, 0xef44db2c,
+  0xe964b13d, 0x34211b85, 0x560392bc, 0x8b463804,
+  0x924680ce, 0x4f032a76, 0x2d21a34f, 0xf06409f7,
+  0x1f20d2db, 0xc2657863, 0xa047f15a, 0x7d025be2,
+  0x6402e328, 0xb9474990, 0xdb65c0a9, 0x06206a11,
+  0xd725148b, 0x0a60be33, 0x6842370a, 0xb5079db2,
+  0xac072578, 0x71428fc0, 0x136006f9, 0xce25ac41,
+  0x2161776d, 0xfc24ddd5, 0x9e0654ec, 0x4343fe54,
+  0x5a43469e, 0x8706ec26, 0xe524651f, 0x3861cfa7,
+  0x3e41a5b6, 0xe3040f0e, 0x81268637, 0x5c632c8f,
+  0x45639445, 0x98263efd, 0xfa04b7c4, 0x27411d7c,
+  0xc805c650, 0x15406ce8, 0x7762e5d1, 0xaa274f69,
+  0xb327f7a3, 0x6e625d1b, 0x0c40d422, 0xd1057e9a,
+  0xaba65fe7, 0x76e3f55f, 0x14c17c66, 0xc984d6de,
+  0xd0846e14, 0x0dc1c4ac, 0x6fe34d95, 0xb2a6e72d,
+  0x5de23c01, 0x80a796b9, 0xe2851f80, 0x3fc0b538,
+  0x26c00df2, 0xfb85a74a, 0x99a72e73, 0x44e284cb,
+  0x42c2eeda, 0x9f874462, 0xfda5cd5b, 0x20e067e3,
+  0x39e0df29, 0xe4a57591, 0x8687fca8, 0x5bc25610,
+  0xb4868d3c, 0x69c32784, 0x0be1aebd, 0xd6a40405,
+  0xcfa4bccf, 0x12e11677, 0x70c39f4e, 0xad8635f6,
+  0x7c834b6c, 0xa1c6e1d4, 0xc3e468ed, 0x1ea1c255,
+  0x07a17a9f, 0xdae4d027, 0xb8c6591e, 0x6583f3a6,
+  0x8ac7288a, 0x57828232, 0x35a00b0b, 0xe8e5a1b3,
+  0xf1e51979, 0x2ca0b3c1, 0x4e823af8, 0x93c79040,
+  0x95e7fa51, 0x48a250e9, 0x2a80d9d0, 0xf7c57368,
+  0xeec5cba2, 0x3380611a, 0x51a2e823, 0x8ce7429b,
+  0x63a399b7, 0xbee6330f, 0xdcc4ba36, 0x0181108e,
+  0x1881a844, 0xc5c402fc, 0xa7e68bc5, 0x7aa3217d,
+  0x52a0c93f, 0x8fe56387, 0xedc7eabe, 0x30824006,
+  0x2982f8cc, 0xf4c75274, 0x96e5db4d, 0x4ba071f5,
+  0xa4e4aad9, 0x79a10061, 0x1b838958, 0xc6c623e0,
+  0xdfc69b2a, 0x02833192, 0x60a1b8ab, 0xbde41213,
+  0xbbc47802, 0x6681d2ba, 0x04a35b83, 0xd9e6f13b,
+  0xc0e649f1, 0x1da3e349, 0x7f816a70, 0xa2c4c0c8,
+  0x4d801be4, 0x90c5b15c, 0xf2e73865, 0x2fa292dd,
+  0x36a22a17, 0xebe780af, 0x89c50996, 0x5480a32e,
+  0x8585ddb4, 0x58c0770c, 0x3ae2fe35, 0xe7a7548d,
+  0xfea7ec47, 0x23e246ff, 0x41c0cfc6, 0x9c85657e,
+  0x73c1be52, 0xae8414ea, 0xcca69dd3, 0x11e3376b,
+  0x08e38fa1, 0xd5a62519, 0xb784ac20, 0x6ac10698,
+  0x6ce16c89, 0xb1a4c631, 0xd3864f08, 0x0ec3e5b0,
+  0x17c35d7a, 0xca86f7c2, 0xa8a47efb, 0x75e1d443,
+  0x9aa50f6f, 0x47e0a5d7, 0x25c22cee, 0xf8878656,
+  0xe1873e9c, 0x3cc29424, 0x5ee01d1d, 0x83a5b7a5,
+  0xf90696d8, 0x24433c60, 0x4661b559, 0x9b241fe1,
+  0x8224a72b, 0x5f610d93, 0x3d4384aa, 0xe0062e12,
+  0x0f42f53e, 0xd2075f86, 0xb025d6bf, 0x6d607c07,
+  0x7460c4cd, 0xa9256e75, 0xcb07e74c, 0x16424df4,
+  0x106227e5, 0xcd278d5d, 0xaf050464, 0x7240aedc,
+  0x6b401616, 0xb605bcae, 0xd4273597, 0x09629f2f,
+  0xe6264403, 0x3b63eebb, 0x59416782, 0x8404cd3a,
+  0x9d0475f0, 0x4041df48, 0x22635671, 0xff26fcc9,
+  0x2e238253, 0xf36628eb, 0x9144a1d2, 0x4c010b6a,
+  0x5501b3a0, 0x88441918, 0xea669021, 0x37233a99,
+  0xd867e1b5, 0x05224b0d, 0x6700c234, 0xba45688c,
+  0xa345d046, 0x7e007afe, 0x1c22f3c7, 0xc167597f,
+  0xc747336e, 0x1a0299d6, 0x782010ef, 0xa565ba57,
+  0xbc65029d, 0x6120a825, 0x0302211c, 0xde478ba4,
+  0x31035088, 0xec46fa30, 0x8e647309, 0x5321d9b1,
+  0x4a21617b, 0x9764cbc3, 0xf54642fa, 0x2803e842
+};
+
+// Used to fetch a naturally-aligned 32-bit word in little endian byte-order
+static inline uint32_t LE_LOAD32(const uint8_t *p) {
+  return DecodeFixed32(reinterpret_cast<const char*>(p));
+}
+
+// Determine if the CPU running this program can accelerate the CRC32C
+// calculation.
+static bool CanAccelerateCRC32C() {
+  if (!port::HasAcceleratedCRC32C())
+    return false;
+
+  // Double-check that the accelerated implementation functions correctly.
+  // port::AcceleretedCRC32C returns zero when unable to accelerate.
+  static const char kTestCRCBuffer[] = "TestCRCBuffer";
+  static const char kBufSize = sizeof(kTestCRCBuffer) - 1;
+  static const uint32_t kTestCRCValue = 0xdcbc59fa;
+
+  return port::AcceleratedCRC32C(0, kTestCRCBuffer, kBufSize) == kTestCRCValue;
+}
+
+uint32_t Extend(uint32_t crc, const char* buf, size_t size) {
+  static bool accelerate = CanAccelerateCRC32C();
+  if (accelerate) {
+    return port::AcceleratedCRC32C(crc, buf, size);
+  }
+
+  const uint8_t *p = reinterpret_cast<const uint8_t *>(buf);
+  const uint8_t *e = p + size;
+  uint32_t l = crc ^ 0xffffffffu;
+
+#define STEP1 do {                              \
+    int c = (l & 0xff) ^ *p++;                  \
+    l = table0_[c] ^ (l >> 8);                  \
+} while (0)
+#define STEP4 do {                              \
+    uint32_t c = l ^ LE_LOAD32(p);              \
+    p += 4;                                     \
+    l = table3_[c & 0xff] ^                     \
+        table2_[(c >> 8) & 0xff] ^              \
+        table1_[(c >> 16) & 0xff] ^             \
+        table0_[c >> 24];                       \
+} while (0)
+
+  // Point x at first 4-byte aligned byte in string.  This might be
+  // just past the end of the string.
+  const uintptr_t pval = reinterpret_cast<uintptr_t>(p);
+  const uint8_t* x = reinterpret_cast<const uint8_t*>(((pval + 3) >> 2) << 2);
+  if (x <= e) {
+    // Process bytes until finished or p is 4-byte aligned
+    while (p != x) {
+      STEP1;
+    }
+  }
+  // Process bytes 16 at a time
+  while ((e-p) >= 16) {
+    STEP4; STEP4; STEP4; STEP4;
+  }
+  // Process bytes 4 at a time
+  while ((e-p) >= 4) {
+    STEP4;
+  }
+  // Process the last few bytes
+  while (p != e) {
+    STEP1;
+  }
+#undef STEP4
+#undef STEP1
+  return l ^ 0xffffffffu;
+}
+
+}  // namespace crc32c
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/util/crc32c.h b/depend/zcash/src/leveldb/util/crc32c.h
new file mode 100644
index 000000000..1d7e5c075
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/crc32c.h
@@ -0,0 +1,45 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_UTIL_CRC32C_H_
+#define STORAGE_LEVELDB_UTIL_CRC32C_H_
+
+#include <stddef.h>
+#include <stdint.h>
+
+namespace leveldb {
+namespace crc32c {
+
+// Return the crc32c of concat(A, data[0,n-1]) where init_crc is the
+// crc32c of some string A.  Extend() is often used to maintain the
+// crc32c of a stream of data.
+extern uint32_t Extend(uint32_t init_crc, const char* data, size_t n);
+
+// Return the crc32c of data[0,n-1]
+inline uint32_t Value(const char* data, size_t n) {
+  return Extend(0, data, n);
+}
+
+static const uint32_t kMaskDelta = 0xa282ead8ul;
+
+// Return a masked representation of crc.
+//
+// Motivation: it is problematic to compute the CRC of a string that
+// contains embedded CRCs.  Therefore we recommend that CRCs stored
+// somewhere (e.g., in files) should be masked before being stored.
+inline uint32_t Mask(uint32_t crc) {
+  // Rotate right by 15 bits and add a constant.
+  return ((crc >> 15) | (crc << 17)) + kMaskDelta;
+}
+
+// Return the crc whose masked representation is masked_crc.
+inline uint32_t Unmask(uint32_t masked_crc) {
+  uint32_t rot = masked_crc - kMaskDelta;
+  return ((rot >> 17) | (rot << 15));
+}
+
+}  // namespace crc32c
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_UTIL_CRC32C_H_
diff --git a/depend/zcash/src/leveldb/util/crc32c_test.cc b/depend/zcash/src/leveldb/util/crc32c_test.cc
new file mode 100644
index 000000000..4b957ee12
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/crc32c_test.cc
@@ -0,0 +1,72 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "util/crc32c.h"
+#include "util/testharness.h"
+
+namespace leveldb {
+namespace crc32c {
+
+class CRC { };
+
+TEST(CRC, StandardResults) {
+  // From rfc3720 section B.4.
+  char buf[32];
+
+  memset(buf, 0, sizeof(buf));
+  ASSERT_EQ(0x8a9136aa, Value(buf, sizeof(buf)));
+
+  memset(buf, 0xff, sizeof(buf));
+  ASSERT_EQ(0x62a8ab43, Value(buf, sizeof(buf)));
+
+  for (int i = 0; i < 32; i++) {
+    buf[i] = i;
+  }
+  ASSERT_EQ(0x46dd794e, Value(buf, sizeof(buf)));
+
+  for (int i = 0; i < 32; i++) {
+    buf[i] = 31 - i;
+  }
+  ASSERT_EQ(0x113fdb5c, Value(buf, sizeof(buf)));
+
+  unsigned char data[48] = {
+    0x01, 0xc0, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00,
+    0x14, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x04, 0x00,
+    0x00, 0x00, 0x00, 0x14,
+    0x00, 0x00, 0x00, 0x18,
+    0x28, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00,
+    0x02, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00,
+  };
+  ASSERT_EQ(0xd9963a56, Value(reinterpret_cast<char*>(data), sizeof(data)));
+}
+
+TEST(CRC, Values) {
+  ASSERT_NE(Value("a", 1), Value("foo", 3));
+}
+
+TEST(CRC, Extend) {
+  ASSERT_EQ(Value("hello world", 11),
+            Extend(Value("hello ", 6), "world", 5));
+}
+
+TEST(CRC, Mask) {
+  uint32_t crc = Value("foo", 3);
+  ASSERT_NE(crc, Mask(crc));
+  ASSERT_NE(crc, Mask(Mask(crc)));
+  ASSERT_EQ(crc, Unmask(Mask(crc)));
+  ASSERT_EQ(crc, Unmask(Unmask(Mask(Mask(crc)))));
+}
+
+}  // namespace crc32c
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/util/env.cc b/depend/zcash/src/leveldb/util/env.cc
new file mode 100644
index 000000000..c58a0821e
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/env.cc
@@ -0,0 +1,100 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "leveldb/env.h"
+
+namespace leveldb {
+
+Env::~Env() {
+}
+
+Status Env::NewAppendableFile(const std::string& fname, WritableFile** result) {
+  return Status::NotSupported("NewAppendableFile", fname);
+}
+
+SequentialFile::~SequentialFile() {
+}
+
+RandomAccessFile::~RandomAccessFile() {
+}
+
+WritableFile::~WritableFile() {
+}
+
+Logger::~Logger() {
+}
+
+FileLock::~FileLock() {
+}
+
+void Log(Logger* info_log, const char* format, ...) {
+  if (info_log != NULL) {
+    va_list ap;
+    va_start(ap, format);
+    info_log->Logv(format, ap);
+    va_end(ap);
+  }
+}
+
+static Status DoWriteStringToFile(Env* env, const Slice& data,
+                                  const std::string& fname,
+                                  bool should_sync) {
+  WritableFile* file;
+  Status s = env->NewWritableFile(fname, &file);
+  if (!s.ok()) {
+    return s;
+  }
+  s = file->Append(data);
+  if (s.ok() && should_sync) {
+    s = file->Sync();
+  }
+  if (s.ok()) {
+    s = file->Close();
+  }
+  delete file;  // Will auto-close if we did not close above
+  if (!s.ok()) {
+    env->DeleteFile(fname);
+  }
+  return s;
+}
+
+Status WriteStringToFile(Env* env, const Slice& data,
+                         const std::string& fname) {
+  return DoWriteStringToFile(env, data, fname, false);
+}
+
+Status WriteStringToFileSync(Env* env, const Slice& data,
+                             const std::string& fname) {
+  return DoWriteStringToFile(env, data, fname, true);
+}
+
+Status ReadFileToString(Env* env, const std::string& fname, std::string* data) {
+  data->clear();
+  SequentialFile* file;
+  Status s = env->NewSequentialFile(fname, &file);
+  if (!s.ok()) {
+    return s;
+  }
+  static const int kBufferSize = 8192;
+  char* space = new char[kBufferSize];
+  while (true) {
+    Slice fragment;
+    s = file->Read(kBufferSize, &fragment, space);
+    if (!s.ok()) {
+      break;
+    }
+    data->append(fragment.data(), fragment.size());
+    if (fragment.empty()) {
+      break;
+    }
+  }
+  delete[] space;
+  delete file;
+  return s;
+}
+
+EnvWrapper::~EnvWrapper() {
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/util/env_posix.cc b/depend/zcash/src/leveldb/util/env_posix.cc
new file mode 100644
index 000000000..f77918313
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/env_posix.cc
@@ -0,0 +1,706 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+#if !defined(LEVELDB_PLATFORM_WINDOWS)
+
+#include <dirent.h>
+#include <errno.h>
+#include <fcntl.h>
+#include <pthread.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <sys/mman.h>
+#include <sys/resource.h>
+#include <sys/stat.h>
+#include <sys/time.h>
+#include <sys/types.h>
+#include <time.h>
+#include <unistd.h>
+#include <deque>
+#include <limits>
+#include <set>
+#include "leveldb/env.h"
+#include "leveldb/slice.h"
+#include "port/port.h"
+#include "util/logging.h"
+#include "util/mutexlock.h"
+#include "util/posix_logger.h"
+#include "util/env_posix_test_helper.h"
+
+namespace leveldb {
+
+namespace {
+
+static int open_read_only_file_limit = -1;
+static int mmap_limit = -1;
+
+static Status IOError(const std::string& context, int err_number) {
+  return Status::IOError(context, strerror(err_number));
+}
+
+// Helper class to limit resource usage to avoid exhaustion.
+// Currently used to limit read-only file descriptors and mmap file usage
+// so that we do not end up running out of file descriptors, virtual memory,
+// or running into kernel performance problems for very large databases.
+class Limiter {
+ public:
+  // Limit maximum number of resources to |n|.
+  Limiter(intptr_t n) {
+    SetAllowed(n);
+  }
+
+  // If another resource is available, acquire it and return true.
+  // Else return false.
+  bool Acquire() {
+    if (GetAllowed() <= 0) {
+      return false;
+    }
+    MutexLock l(&mu_);
+    intptr_t x = GetAllowed();
+    if (x <= 0) {
+      return false;
+    } else {
+      SetAllowed(x - 1);
+      return true;
+    }
+  }
+
+  // Release a resource acquired by a previous call to Acquire() that returned
+  // true.
+  void Release() {
+    MutexLock l(&mu_);
+    SetAllowed(GetAllowed() + 1);
+  }
+
+ private:
+  port::Mutex mu_;
+  port::AtomicPointer allowed_;
+
+  intptr_t GetAllowed() const {
+    return reinterpret_cast<intptr_t>(allowed_.Acquire_Load());
+  }
+
+  // REQUIRES: mu_ must be held
+  void SetAllowed(intptr_t v) {
+    allowed_.Release_Store(reinterpret_cast<void*>(v));
+  }
+
+  Limiter(const Limiter&);
+  void operator=(const Limiter&);
+};
+
+class PosixSequentialFile: public SequentialFile {
+ private:
+  std::string filename_;
+  FILE* file_;
+
+ public:
+  PosixSequentialFile(const std::string& fname, FILE* f)
+      : filename_(fname), file_(f) { }
+  virtual ~PosixSequentialFile() { fclose(file_); }
+
+  virtual Status Read(size_t n, Slice* result, char* scratch) {
+    Status s;
+    size_t r = fread_unlocked(scratch, 1, n, file_);
+    *result = Slice(scratch, r);
+    if (r < n) {
+      if (feof(file_)) {
+        // We leave status as ok if we hit the end of the file
+      } else {
+        // A partial read with an error: return a non-ok status
+        s = IOError(filename_, errno);
+      }
+    }
+    return s;
+  }
+
+  virtual Status Skip(uint64_t n) {
+    if (fseek(file_, n, SEEK_CUR)) {
+      return IOError(filename_, errno);
+    }
+    return Status::OK();
+  }
+
+  virtual std::string GetName() const { return filename_; }
+};
+
+// pread() based random-access
+class PosixRandomAccessFile: public RandomAccessFile {
+ private:
+  std::string filename_;
+  bool temporary_fd_;  // If true, fd_ is -1 and we open on every read.
+  int fd_;
+  Limiter* limiter_;
+
+ public:
+  PosixRandomAccessFile(const std::string& fname, int fd, Limiter* limiter)
+      : filename_(fname), fd_(fd), limiter_(limiter) {
+    temporary_fd_ = !limiter->Acquire();
+    if (temporary_fd_) {
+      // Open file on every access.
+      close(fd_);
+      fd_ = -1;
+    }
+  }
+
+  virtual ~PosixRandomAccessFile() {
+    if (!temporary_fd_) {
+      close(fd_);
+      limiter_->Release();
+    }
+  }
+
+  virtual Status Read(uint64_t offset, size_t n, Slice* result,
+                      char* scratch) const {
+    int fd = fd_;
+    if (temporary_fd_) {
+      fd = open(filename_.c_str(), O_RDONLY);
+      if (fd < 0) {
+        return IOError(filename_, errno);
+      }
+    }
+
+    Status s;
+    ssize_t r = pread(fd, scratch, n, static_cast<off_t>(offset));
+    *result = Slice(scratch, (r < 0) ? 0 : r);
+    if (r < 0) {
+      // An error: return a non-ok status
+      s = IOError(filename_, errno);
+    }
+    if (temporary_fd_) {
+      // Close the temporary file descriptor opened earlier.
+      close(fd);
+    }
+    return s;
+  }
+
+  virtual std::string GetName() const { return filename_; }
+};
+
+// mmap() based random-access
+class PosixMmapReadableFile: public RandomAccessFile {
+ private:
+  std::string filename_;
+  void* mmapped_region_;
+  size_t length_;
+  Limiter* limiter_;
+
+ public:
+  // base[0,length-1] contains the mmapped contents of the file.
+  PosixMmapReadableFile(const std::string& fname, void* base, size_t length,
+                        Limiter* limiter)
+      : filename_(fname), mmapped_region_(base), length_(length),
+        limiter_(limiter) {
+  }
+
+  virtual ~PosixMmapReadableFile() {
+    munmap(mmapped_region_, length_);
+    limiter_->Release();
+  }
+
+  virtual Status Read(uint64_t offset, size_t n, Slice* result,
+                      char* scratch) const {
+    Status s;
+    if (offset + n > length_) {
+      *result = Slice();
+      s = IOError(filename_, EINVAL);
+    } else {
+      *result = Slice(reinterpret_cast<char*>(mmapped_region_) + offset, n);
+    }
+    return s;
+  }
+
+  virtual std::string GetName() const { return filename_; }
+};
+
+class PosixWritableFile : public WritableFile {
+ private:
+  std::string filename_;
+  FILE* file_;
+
+ public:
+  PosixWritableFile(const std::string& fname, FILE* f)
+      : filename_(fname), file_(f) { }
+
+  ~PosixWritableFile() {
+    if (file_ != NULL) {
+      // Ignoring any potential errors
+      fclose(file_);
+    }
+  }
+
+  virtual Status Append(const Slice& data) {
+    size_t r = fwrite_unlocked(data.data(), 1, data.size(), file_);
+    if (r != data.size()) {
+      return IOError(filename_, errno);
+    }
+    return Status::OK();
+  }
+
+  virtual Status Close() {
+    Status result;
+    if (fclose(file_) != 0) {
+      result = IOError(filename_, errno);
+    }
+    file_ = NULL;
+    return result;
+  }
+
+  virtual Status Flush() {
+    if (fflush_unlocked(file_) != 0) {
+      return IOError(filename_, errno);
+    }
+    return Status::OK();
+  }
+
+  Status SyncDirIfManifest() {
+    const char* f = filename_.c_str();
+    const char* sep = strrchr(f, '/');
+    Slice basename;
+    std::string dir;
+    if (sep == NULL) {
+      dir = ".";
+      basename = f;
+    } else {
+      dir = std::string(f, sep - f);
+      basename = sep + 1;
+    }
+    Status s;
+    if (basename.starts_with("MANIFEST")) {
+      int fd = open(dir.c_str(), O_RDONLY);
+      if (fd < 0) {
+        s = IOError(dir, errno);
+      } else {
+        if (fsync(fd) < 0 && errno != EINVAL) {
+          s = IOError(dir, errno);
+        }
+        close(fd);
+      }
+    }
+    return s;
+  }
+
+  virtual Status Sync() {
+    // Ensure new files referred to by the manifest are in the filesystem.
+    Status s = SyncDirIfManifest();
+    if (!s.ok()) {
+      return s;
+    }
+    if (fflush_unlocked(file_) != 0 ||
+        fdatasync(fileno(file_)) != 0) {
+      s = Status::IOError(filename_, strerror(errno));
+    }
+    return s;
+  }
+
+  virtual std::string GetName() const { return filename_; }
+};
+
+static int LockOrUnlock(int fd, bool lock) {
+  errno = 0;
+  struct flock f;
+  memset(&f, 0, sizeof(f));
+  f.l_type = (lock ? F_WRLCK : F_UNLCK);
+  f.l_whence = SEEK_SET;
+  f.l_start = 0;
+  f.l_len = 0;        // Lock/unlock entire file
+  return fcntl(fd, F_SETLK, &f);
+}
+
+class PosixFileLock : public FileLock {
+ public:
+  int fd_;
+  std::string name_;
+};
+
+// Set of locked files.  We keep a separate set instead of just
+// relying on fcntrl(F_SETLK) since fcntl(F_SETLK) does not provide
+// any protection against multiple uses from the same process.
+class PosixLockTable {
+ private:
+  port::Mutex mu_;
+  std::set<std::string> locked_files_;
+ public:
+  bool Insert(const std::string& fname) {
+    MutexLock l(&mu_);
+    return locked_files_.insert(fname).second;
+  }
+  void Remove(const std::string& fname) {
+    MutexLock l(&mu_);
+    locked_files_.erase(fname);
+  }
+};
+
+class PosixEnv : public Env {
+ public:
+  PosixEnv();
+  virtual ~PosixEnv() {
+    char msg[] = "Destroying Env::Default()\n";
+    fwrite(msg, 1, sizeof(msg), stderr);
+    abort();
+  }
+
+  virtual Status NewSequentialFile(const std::string& fname,
+                                   SequentialFile** result) {
+    FILE* f = fopen(fname.c_str(), "r");
+    if (f == NULL) {
+      *result = NULL;
+      return IOError(fname, errno);
+    } else {
+      *result = new PosixSequentialFile(fname, f);
+      return Status::OK();
+    }
+  }
+
+  virtual Status NewRandomAccessFile(const std::string& fname,
+                                     RandomAccessFile** result) {
+    *result = NULL;
+    Status s;
+    int fd = open(fname.c_str(), O_RDONLY);
+    if (fd < 0) {
+      s = IOError(fname, errno);
+    } else if (mmap_limit_.Acquire()) {
+      uint64_t size;
+      s = GetFileSize(fname, &size);
+      if (s.ok()) {
+        void* base = mmap(NULL, size, PROT_READ, MAP_SHARED, fd, 0);
+        if (base != MAP_FAILED) {
+          *result = new PosixMmapReadableFile(fname, base, size, &mmap_limit_);
+        } else {
+          s = IOError(fname, errno);
+        }
+      }
+      close(fd);
+      if (!s.ok()) {
+        mmap_limit_.Release();
+      }
+    } else {
+      *result = new PosixRandomAccessFile(fname, fd, &fd_limit_);
+    }
+    return s;
+  }
+
+  virtual Status NewWritableFile(const std::string& fname,
+                                 WritableFile** result) {
+    Status s;
+    FILE* f = fopen(fname.c_str(), "w");
+    if (f == NULL) {
+      *result = NULL;
+      s = IOError(fname, errno);
+    } else {
+      *result = new PosixWritableFile(fname, f);
+    }
+    return s;
+  }
+
+  virtual Status NewAppendableFile(const std::string& fname,
+                                   WritableFile** result) {
+    Status s;
+    FILE* f = fopen(fname.c_str(), "a");
+    if (f == NULL) {
+      *result = NULL;
+      s = IOError(fname, errno);
+    } else {
+      *result = new PosixWritableFile(fname, f);
+    }
+    return s;
+  }
+
+  virtual bool FileExists(const std::string& fname) {
+    return access(fname.c_str(), F_OK) == 0;
+  }
+
+  virtual Status GetChildren(const std::string& dir,
+                             std::vector<std::string>* result) {
+    result->clear();
+    DIR* d = opendir(dir.c_str());
+    if (d == NULL) {
+      return IOError(dir, errno);
+    }
+    struct dirent* entry;
+    while ((entry = readdir(d)) != NULL) {
+      result->push_back(entry->d_name);
+    }
+    closedir(d);
+    return Status::OK();
+  }
+
+  virtual Status DeleteFile(const std::string& fname) {
+    Status result;
+    if (unlink(fname.c_str()) != 0) {
+      result = IOError(fname, errno);
+    }
+    return result;
+  }
+
+  virtual Status CreateDir(const std::string& name) {
+    Status result;
+    if (mkdir(name.c_str(), 0755) != 0) {
+      result = IOError(name, errno);
+    }
+    return result;
+  }
+
+  virtual Status DeleteDir(const std::string& name) {
+    Status result;
+    if (rmdir(name.c_str()) != 0) {
+      result = IOError(name, errno);
+    }
+    return result;
+  }
+
+  virtual Status GetFileSize(const std::string& fname, uint64_t* size) {
+    Status s;
+    struct stat sbuf;
+    if (stat(fname.c_str(), &sbuf) != 0) {
+      *size = 0;
+      s = IOError(fname, errno);
+    } else {
+      *size = sbuf.st_size;
+    }
+    return s;
+  }
+
+  virtual Status RenameFile(const std::string& src, const std::string& target) {
+    Status result;
+    if (rename(src.c_str(), target.c_str()) != 0) {
+      result = IOError(src, errno);
+    }
+    return result;
+  }
+
+  virtual Status LockFile(const std::string& fname, FileLock** lock) {
+    *lock = NULL;
+    Status result;
+    int fd = open(fname.c_str(), O_RDWR | O_CREAT, 0644);
+    if (fd < 0) {
+      result = IOError(fname, errno);
+    } else if (!locks_.Insert(fname)) {
+      close(fd);
+      result = Status::IOError("lock " + fname, "already held by process");
+    } else if (LockOrUnlock(fd, true) == -1) {
+      result = IOError("lock " + fname, errno);
+      close(fd);
+      locks_.Remove(fname);
+    } else {
+      PosixFileLock* my_lock = new PosixFileLock;
+      my_lock->fd_ = fd;
+      my_lock->name_ = fname;
+      *lock = my_lock;
+    }
+    return result;
+  }
+
+  virtual Status UnlockFile(FileLock* lock) {
+    PosixFileLock* my_lock = reinterpret_cast<PosixFileLock*>(lock);
+    Status result;
+    if (LockOrUnlock(my_lock->fd_, false) == -1) {
+      result = IOError("unlock", errno);
+    }
+    locks_.Remove(my_lock->name_);
+    close(my_lock->fd_);
+    delete my_lock;
+    return result;
+  }
+
+  virtual void Schedule(void (*function)(void*), void* arg);
+
+  virtual void StartThread(void (*function)(void* arg), void* arg);
+
+  virtual Status GetTestDirectory(std::string* result) {
+    const char* env = getenv("TEST_TMPDIR");
+    if (env && env[0] != '\0') {
+      *result = env;
+    } else {
+      char buf[100];
+      snprintf(buf, sizeof(buf), "/tmp/leveldbtest-%d", int(geteuid()));
+      *result = buf;
+    }
+    // Directory may already exist
+    CreateDir(*result);
+    return Status::OK();
+  }
+
+  static uint64_t gettid() {
+    pthread_t tid = pthread_self();
+    uint64_t thread_id = 0;
+    memcpy(&thread_id, &tid, std::min(sizeof(thread_id), sizeof(tid)));
+    return thread_id;
+  }
+
+  virtual Status NewLogger(const std::string& fname, Logger** result) {
+    FILE* f = fopen(fname.c_str(), "w");
+    if (f == NULL) {
+      *result = NULL;
+      return IOError(fname, errno);
+    } else {
+      *result = new PosixLogger(f, &PosixEnv::gettid);
+      return Status::OK();
+    }
+  }
+
+  virtual uint64_t NowMicros() {
+    struct timeval tv;
+    gettimeofday(&tv, NULL);
+    return static_cast<uint64_t>(tv.tv_sec) * 1000000 + tv.tv_usec;
+  }
+
+  virtual void SleepForMicroseconds(int micros) {
+    usleep(micros);
+  }
+
+ private:
+  void PthreadCall(const char* label, int result) {
+    if (result != 0) {
+      fprintf(stderr, "pthread %s: %s\n", label, strerror(result));
+      abort();
+    }
+  }
+
+  // BGThread() is the body of the background thread
+  void BGThread();
+  static void* BGThreadWrapper(void* arg) {
+    reinterpret_cast<PosixEnv*>(arg)->BGThread();
+    return NULL;
+  }
+
+  pthread_mutex_t mu_;
+  pthread_cond_t bgsignal_;
+  pthread_t bgthread_;
+  bool started_bgthread_;
+
+  // Entry per Schedule() call
+  struct BGItem { void* arg; void (*function)(void*); };
+  typedef std::deque<BGItem> BGQueue;
+  BGQueue queue_;
+
+  PosixLockTable locks_;
+  Limiter mmap_limit_;
+  Limiter fd_limit_;
+};
+
+// Return the maximum number of concurrent mmaps.
+static int MaxMmaps() {
+  if (mmap_limit >= 0) {
+    return mmap_limit;
+  }
+  // Up to 4096 mmaps for 64-bit binaries; none for smaller pointer sizes.
+  mmap_limit = sizeof(void*) >= 8 ? 4096 : 0;
+  return mmap_limit;
+}
+
+// Return the maximum number of read-only files to keep open.
+static intptr_t MaxOpenFiles() {
+  if (open_read_only_file_limit >= 0) {
+    return open_read_only_file_limit;
+  }
+  struct rlimit rlim;
+  if (getrlimit(RLIMIT_NOFILE, &rlim)) {
+    // getrlimit failed, fallback to hard-coded default.
+    open_read_only_file_limit = 50;
+  } else if (rlim.rlim_cur == RLIM_INFINITY) {
+    open_read_only_file_limit = std::numeric_limits<int>::max();
+  } else {
+    // Allow use of 20% of available file descriptors for read-only files.
+    open_read_only_file_limit = rlim.rlim_cur / 5;
+  }
+  return open_read_only_file_limit;
+}
+
+PosixEnv::PosixEnv()
+    : started_bgthread_(false),
+      mmap_limit_(MaxMmaps()),
+      fd_limit_(MaxOpenFiles()) {
+  PthreadCall("mutex_init", pthread_mutex_init(&mu_, NULL));
+  PthreadCall("cvar_init", pthread_cond_init(&bgsignal_, NULL));
+}
+
+void PosixEnv::Schedule(void (*function)(void*), void* arg) {
+  PthreadCall("lock", pthread_mutex_lock(&mu_));
+
+  // Start background thread if necessary
+  if (!started_bgthread_) {
+    started_bgthread_ = true;
+    PthreadCall(
+        "create thread",
+        pthread_create(&bgthread_, NULL,  &PosixEnv::BGThreadWrapper, this));
+  }
+
+  // If the queue is currently empty, the background thread may currently be
+  // waiting.
+  if (queue_.empty()) {
+    PthreadCall("signal", pthread_cond_signal(&bgsignal_));
+  }
+
+  // Add to priority queue
+  queue_.push_back(BGItem());
+  queue_.back().function = function;
+  queue_.back().arg = arg;
+
+  PthreadCall("unlock", pthread_mutex_unlock(&mu_));
+}
+
+void PosixEnv::BGThread() {
+  while (true) {
+    // Wait until there is an item that is ready to run
+    PthreadCall("lock", pthread_mutex_lock(&mu_));
+    while (queue_.empty()) {
+      PthreadCall("wait", pthread_cond_wait(&bgsignal_, &mu_));
+    }
+
+    void (*function)(void*) = queue_.front().function;
+    void* arg = queue_.front().arg;
+    queue_.pop_front();
+
+    PthreadCall("unlock", pthread_mutex_unlock(&mu_));
+    (*function)(arg);
+  }
+}
+
+namespace {
+struct StartThreadState {
+  void (*user_function)(void*);
+  void* arg;
+};
+}
+static void* StartThreadWrapper(void* arg) {
+  StartThreadState* state = reinterpret_cast<StartThreadState*>(arg);
+  state->user_function(state->arg);
+  delete state;
+  return NULL;
+}
+
+void PosixEnv::StartThread(void (*function)(void* arg), void* arg) {
+  pthread_t t;
+  StartThreadState* state = new StartThreadState;
+  state->user_function = function;
+  state->arg = arg;
+  PthreadCall("start thread",
+              pthread_create(&t, NULL,  &StartThreadWrapper, state));
+}
+
+}  // namespace
+
+static pthread_once_t once = PTHREAD_ONCE_INIT;
+static Env* default_env;
+static void InitDefaultEnv() { default_env = new PosixEnv; }
+
+void EnvPosixTestHelper::SetReadOnlyFDLimit(int limit) {
+  assert(default_env == NULL);
+  open_read_only_file_limit = limit;
+}
+
+void EnvPosixTestHelper::SetReadOnlyMMapLimit(int limit) {
+  assert(default_env == NULL);
+  mmap_limit = limit;
+}
+
+Env* Env::Default() {
+  pthread_once(&once, InitDefaultEnv);
+  return default_env;
+}
+
+}  // namespace leveldb
+
+#endif
diff --git a/depend/zcash/src/leveldb/util/env_posix_test.cc b/depend/zcash/src/leveldb/util/env_posix_test.cc
new file mode 100644
index 000000000..295f8ae44
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/env_posix_test.cc
@@ -0,0 +1,66 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "leveldb/env.h"
+
+#include "port/port.h"
+#include "util/testharness.h"
+#include "util/env_posix_test_helper.h"
+
+namespace leveldb {
+
+static const int kDelayMicros = 100000;
+static const int kReadOnlyFileLimit = 4;
+static const int kMMapLimit = 4;
+
+class EnvPosixTest {
+ public:
+  Env* env_;
+  EnvPosixTest() : env_(Env::Default()) { }
+
+  static void SetFileLimits(int read_only_file_limit, int mmap_limit) {
+    EnvPosixTestHelper::SetReadOnlyFDLimit(read_only_file_limit);
+    EnvPosixTestHelper::SetReadOnlyMMapLimit(mmap_limit);
+  }
+};
+
+TEST(EnvPosixTest, TestOpenOnRead) {
+  // Write some test data to a single file that will be opened |n| times.
+  std::string test_dir;
+  ASSERT_OK(env_->GetTestDirectory(&test_dir));
+  std::string test_file = test_dir + "/open_on_read.txt";
+
+  FILE* f = fopen(test_file.c_str(), "w");
+  ASSERT_TRUE(f != NULL);
+  const char kFileData[] = "abcdefghijklmnopqrstuvwxyz";
+  fputs(kFileData, f);
+  fclose(f);
+
+  // Open test file some number above the sum of the two limits to force
+  // open-on-read behavior of POSIX Env leveldb::RandomAccessFile.
+  const int kNumFiles = kReadOnlyFileLimit + kMMapLimit + 5;
+  leveldb::RandomAccessFile* files[kNumFiles] = {0};
+  for (int i = 0; i < kNumFiles; i++) {
+    ASSERT_OK(env_->NewRandomAccessFile(test_file, &files[i]));
+  }
+  char scratch;
+  Slice read_result;
+  for (int i = 0; i < kNumFiles; i++) {
+    ASSERT_OK(files[i]->Read(i, 1, &read_result, &scratch));
+    ASSERT_EQ(kFileData[i], read_result[0]);
+  }
+  for (int i = 0; i < kNumFiles; i++) {
+    delete files[i];
+  }
+  ASSERT_OK(env_->DeleteFile(test_file));
+}
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  // All tests currently run with the same read-only file limits.
+  leveldb::EnvPosixTest::SetFileLimits(leveldb::kReadOnlyFileLimit,
+                                       leveldb::kMMapLimit);
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/util/env_posix_test_helper.h b/depend/zcash/src/leveldb/util/env_posix_test_helper.h
new file mode 100644
index 000000000..038696059
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/env_posix_test_helper.h
@@ -0,0 +1,28 @@
+// Copyright 2017 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_UTIL_ENV_POSIX_TEST_HELPER_H_
+#define STORAGE_LEVELDB_UTIL_ENV_POSIX_TEST_HELPER_H_
+
+namespace leveldb {
+
+class EnvPosixTest;
+
+// A helper for the POSIX Env to facilitate testing.
+class EnvPosixTestHelper {
+ private:
+  friend class EnvPosixTest;
+
+  // Set the maximum number of read-only files that will be opened.
+  // Must be called before creating an Env.
+  static void SetReadOnlyFDLimit(int limit);
+
+  // Set the maximum number of read-only files that will be mapped via mmap.
+  // Must be called before creating an Env.
+  static void SetReadOnlyMMapLimit(int limit);
+};
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_UTIL_ENV_POSIX_TEST_HELPER_H_
diff --git a/depend/zcash/src/leveldb/util/env_test.cc b/depend/zcash/src/leveldb/util/env_test.cc
new file mode 100644
index 000000000..839ae56a1
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/env_test.cc
@@ -0,0 +1,106 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "leveldb/env.h"
+
+#include "port/port.h"
+#include "util/testharness.h"
+
+namespace leveldb {
+
+static const int kDelayMicros = 100000;
+static const int kReadOnlyFileLimit = 4;
+static const int kMMapLimit = 4;
+
+class EnvTest {
+ private:
+  port::Mutex mu_;
+  std::string events_;
+
+ public:
+  Env* env_;
+  EnvTest() : env_(Env::Default()) { }
+};
+
+static void SetBool(void* ptr) {
+  reinterpret_cast<port::AtomicPointer*>(ptr)->NoBarrier_Store(ptr);
+}
+
+TEST(EnvTest, RunImmediately) {
+  port::AtomicPointer called (NULL);
+  env_->Schedule(&SetBool, &called);
+  env_->SleepForMicroseconds(kDelayMicros);
+  ASSERT_TRUE(called.NoBarrier_Load() != NULL);
+}
+
+TEST(EnvTest, RunMany) {
+  port::AtomicPointer last_id (NULL);
+
+  struct CB {
+    port::AtomicPointer* last_id_ptr;   // Pointer to shared slot
+    uintptr_t id;             // Order# for the execution of this callback
+
+    CB(port::AtomicPointer* p, int i) : last_id_ptr(p), id(i) { }
+
+    static void Run(void* v) {
+      CB* cb = reinterpret_cast<CB*>(v);
+      void* cur = cb->last_id_ptr->NoBarrier_Load();
+      ASSERT_EQ(cb->id-1, reinterpret_cast<uintptr_t>(cur));
+      cb->last_id_ptr->Release_Store(reinterpret_cast<void*>(cb->id));
+    }
+  };
+
+  // Schedule in different order than start time
+  CB cb1(&last_id, 1);
+  CB cb2(&last_id, 2);
+  CB cb3(&last_id, 3);
+  CB cb4(&last_id, 4);
+  env_->Schedule(&CB::Run, &cb1);
+  env_->Schedule(&CB::Run, &cb2);
+  env_->Schedule(&CB::Run, &cb3);
+  env_->Schedule(&CB::Run, &cb4);
+
+  env_->SleepForMicroseconds(kDelayMicros);
+  void* cur = last_id.Acquire_Load();
+  ASSERT_EQ(4, reinterpret_cast<uintptr_t>(cur));
+}
+
+struct State {
+  port::Mutex mu;
+  int val;
+  int num_running;
+};
+
+static void ThreadBody(void* arg) {
+  State* s = reinterpret_cast<State*>(arg);
+  s->mu.Lock();
+  s->val += 1;
+  s->num_running -= 1;
+  s->mu.Unlock();
+}
+
+TEST(EnvTest, StartThread) {
+  State state;
+  state.val = 0;
+  state.num_running = 3;
+  for (int i = 0; i < 3; i++) {
+    env_->StartThread(&ThreadBody, &state);
+  }
+  while (true) {
+    state.mu.Lock();
+    int num = state.num_running;
+    state.mu.Unlock();
+    if (num == 0) {
+      break;
+    }
+    env_->SleepForMicroseconds(kDelayMicros);
+  }
+  ASSERT_EQ(state.val, 3);
+}
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/util/env_win.cc b/depend/zcash/src/leveldb/util/env_win.cc
new file mode 100644
index 000000000..830332abe
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/env_win.cc
@@ -0,0 +1,902 @@
+// This file contains source that originates from:
+// http://code.google.com/p/leveldbwin/source/browse/trunk/win32_impl_src/env_win32.h
+// http://code.google.com/p/leveldbwin/source/browse/trunk/win32_impl_src/port_win32.cc
+// Those files don't have any explicit license headers but the 
+// project (http://code.google.com/p/leveldbwin/) lists the 'New BSD License'
+// as the license.
+#if defined(LEVELDB_PLATFORM_WINDOWS)
+#include <map>
+
+
+#include "leveldb/env.h"
+
+#include "port/port.h"
+#include "leveldb/slice.h"
+#include "util/logging.h"
+
+#include <shlwapi.h>
+#include <process.h>
+#include <cstring>
+#include <stdio.h>
+#include <errno.h>
+#include <io.h>
+#include <algorithm>
+
+#ifdef max
+#undef max
+#endif
+
+#ifndef va_copy
+#define va_copy(d,s) ((d) = (s))
+#endif
+
+#if defined DeleteFile
+#undef DeleteFile
+#endif
+
+//Declarations
+namespace leveldb
+{
+
+namespace Win32
+{
+
+#define DISALLOW_COPY_AND_ASSIGN(TypeName) \
+  TypeName(const TypeName&);               \
+  void operator=(const TypeName&)
+
+std::string GetCurrentDir();
+std::wstring GetCurrentDirW();
+
+static const std::string CurrentDir = GetCurrentDir();
+static const std::wstring CurrentDirW = GetCurrentDirW();
+
+std::string& ModifyPath(std::string& path);
+std::wstring& ModifyPath(std::wstring& path);
+
+std::string GetLastErrSz();
+std::wstring GetLastErrSzW();
+
+size_t GetPageSize();
+
+typedef void (*ScheduleProc)(void*) ;
+
+struct WorkItemWrapper
+{
+    WorkItemWrapper(ScheduleProc proc_,void* content_);
+    ScheduleProc proc;
+    void* pContent;
+};
+
+DWORD WINAPI WorkItemWrapperProc(LPVOID pContent);
+
+class Win32SequentialFile : public SequentialFile
+{
+public:
+    friend class Win32Env;
+    virtual ~Win32SequentialFile();
+    virtual Status Read(size_t n, Slice* result, char* scratch);
+    virtual Status Skip(uint64_t n);
+    BOOL isEnable();
+    virtual std::string GetName() const { return _filename; }
+private:
+    BOOL _Init();
+    void _CleanUp();
+    Win32SequentialFile(const std::string& fname);
+    std::string _filename;
+    ::HANDLE _hFile;
+    DISALLOW_COPY_AND_ASSIGN(Win32SequentialFile);
+};
+
+class Win32RandomAccessFile : public RandomAccessFile
+{
+public:
+    friend class Win32Env;
+    virtual ~Win32RandomAccessFile();
+    virtual Status Read(uint64_t offset, size_t n, Slice* result,char* scratch) const;
+    BOOL isEnable();
+    virtual std::string GetName() const { return _filename; }
+private:
+    BOOL _Init(LPCWSTR path);
+    void _CleanUp();
+    Win32RandomAccessFile(const std::string& fname);
+    HANDLE _hFile;
+    const std::string _filename;
+    DISALLOW_COPY_AND_ASSIGN(Win32RandomAccessFile);
+};
+
+class Win32WritableFile : public WritableFile
+{
+public:
+    Win32WritableFile(const std::string& fname, bool append);
+    ~Win32WritableFile();
+
+    virtual Status Append(const Slice& data);
+    virtual Status Close();
+    virtual Status Flush();
+    virtual Status Sync();
+    BOOL isEnable();
+    virtual std::string GetName() const { return filename_; }
+private:
+    std::string filename_;
+    ::HANDLE _hFile;
+};
+
+class Win32FileLock : public FileLock
+{
+public:
+    friend class Win32Env;
+    virtual ~Win32FileLock();
+    BOOL isEnable();
+private:
+    BOOL _Init(LPCWSTR path);
+    void _CleanUp();
+    Win32FileLock(const std::string& fname);
+    HANDLE _hFile;
+    std::string _filename;
+    DISALLOW_COPY_AND_ASSIGN(Win32FileLock);
+};
+
+class Win32Logger : public Logger
+{
+public: 
+    friend class Win32Env;
+    virtual ~Win32Logger();
+    virtual void Logv(const char* format, va_list ap);
+private:
+    explicit Win32Logger(WritableFile* pFile);
+    WritableFile* _pFileProxy;
+    DISALLOW_COPY_AND_ASSIGN(Win32Logger);
+};
+
+class Win32Env : public Env
+{
+public:
+    Win32Env();
+    virtual ~Win32Env();
+    virtual Status NewSequentialFile(const std::string& fname,
+        SequentialFile** result);
+
+    virtual Status NewRandomAccessFile(const std::string& fname,
+        RandomAccessFile** result);
+    virtual Status NewWritableFile(const std::string& fname,
+        WritableFile** result);
+    virtual Status NewAppendableFile(const std::string& fname,
+        WritableFile** result);
+
+    virtual bool FileExists(const std::string& fname);
+
+    virtual Status GetChildren(const std::string& dir,
+        std::vector<std::string>* result);
+
+    virtual Status DeleteFile(const std::string& fname);
+
+    virtual Status CreateDir(const std::string& dirname);
+
+    virtual Status DeleteDir(const std::string& dirname);
+
+    virtual Status GetFileSize(const std::string& fname, uint64_t* file_size);
+
+    virtual Status RenameFile(const std::string& src,
+        const std::string& target);
+
+    virtual Status LockFile(const std::string& fname, FileLock** lock);
+
+    virtual Status UnlockFile(FileLock* lock);
+
+    virtual void Schedule(
+        void (*function)(void* arg),
+        void* arg);
+
+    virtual void StartThread(void (*function)(void* arg), void* arg);
+
+    virtual Status GetTestDirectory(std::string* path);
+
+    //virtual void Logv(WritableFile* log, const char* format, va_list ap);
+
+    virtual Status NewLogger(const std::string& fname, Logger** result);
+
+    virtual uint64_t NowMicros();
+
+    virtual void SleepForMicroseconds(int micros);
+};
+
+void ToWidePath(const std::string& value, std::wstring& target) {
+	wchar_t buffer[MAX_PATH];
+	MultiByteToWideChar(CP_UTF8, 0, value.c_str(), -1, buffer, MAX_PATH);
+	target = buffer;
+}
+
+void ToNarrowPath(const std::wstring& value, std::string& target) {
+	char buffer[MAX_PATH];
+	WideCharToMultiByte(CP_UTF8, 0, value.c_str(), -1, buffer, MAX_PATH, NULL, NULL);
+	target = buffer;
+}
+
+std::wstring GetCurrentDirW()
+{
+    WCHAR path[MAX_PATH];
+    ::GetModuleFileNameW(::GetModuleHandleW(NULL),path,MAX_PATH);
+    *wcsrchr(path,L'\\') = 0;
+    return std::wstring(path);
+}
+
+std::string GetCurrentDir()
+{
+    std::string path;
+    ToNarrowPath(GetCurrentDirW(), path);
+    return path;
+}
+
+std::string& ModifyPath(std::string& path)
+{
+    if(path[0] == '/' || path[0] == '\\'){
+        path = CurrentDir + path;
+    }
+    std::replace(path.begin(),path.end(),'/','\\');
+
+    return path;
+}
+
+std::wstring& ModifyPath(std::wstring& path)
+{
+    if(path[0] == L'/' || path[0] == L'\\'){
+        path = CurrentDirW + path;
+    }
+    std::replace(path.begin(),path.end(),L'/',L'\\');
+    return path;
+}
+
+std::string GetLastErrSz()
+{
+    LPWSTR lpMsgBuf;
+    FormatMessageW( 
+        FORMAT_MESSAGE_ALLOCATE_BUFFER | 
+        FORMAT_MESSAGE_FROM_SYSTEM | 
+        FORMAT_MESSAGE_IGNORE_INSERTS,
+        NULL,
+        GetLastError(),
+        0, // Default language
+        (LPWSTR) &lpMsgBuf,
+        0,
+        NULL 
+        );
+    std::string Err;
+	ToNarrowPath(lpMsgBuf, Err); 
+    LocalFree( lpMsgBuf );
+    return Err;
+}
+
+std::wstring GetLastErrSzW()
+{
+    LPVOID lpMsgBuf;
+    FormatMessageW( 
+        FORMAT_MESSAGE_ALLOCATE_BUFFER | 
+        FORMAT_MESSAGE_FROM_SYSTEM | 
+        FORMAT_MESSAGE_IGNORE_INSERTS,
+        NULL,
+        GetLastError(),
+        0, // Default language
+        (LPWSTR) &lpMsgBuf,
+        0,
+        NULL 
+        );
+    std::wstring Err = (LPCWSTR)lpMsgBuf;
+    LocalFree(lpMsgBuf);
+    return Err;
+}
+
+WorkItemWrapper::WorkItemWrapper( ScheduleProc proc_,void* content_ ) :
+    proc(proc_),pContent(content_)
+{
+
+}
+
+DWORD WINAPI WorkItemWrapperProc(LPVOID pContent)
+{
+    WorkItemWrapper* item = static_cast<WorkItemWrapper*>(pContent);
+    ScheduleProc TempProc = item->proc;
+    void* arg = item->pContent;
+    delete item;
+    TempProc(arg);
+    return 0;
+}
+
+size_t GetPageSize()
+{
+    SYSTEM_INFO si;
+    GetSystemInfo(&si);
+    return std::max(si.dwPageSize,si.dwAllocationGranularity);
+}
+
+const size_t g_PageSize = GetPageSize();
+
+
+Win32SequentialFile::Win32SequentialFile( const std::string& fname ) :
+    _filename(fname),_hFile(NULL)
+{
+    _Init();
+}
+
+Win32SequentialFile::~Win32SequentialFile()
+{
+    _CleanUp();
+}
+
+Status Win32SequentialFile::Read( size_t n, Slice* result, char* scratch )
+{
+    Status sRet;
+    DWORD hasRead = 0;
+    if(_hFile && ReadFile(_hFile,scratch,n,&hasRead,NULL) ){
+        *result = Slice(scratch,hasRead);
+    } else {
+        sRet = Status::IOError(_filename, Win32::GetLastErrSz() );
+    }
+    return sRet;
+}
+
+Status Win32SequentialFile::Skip( uint64_t n )
+{
+    Status sRet;
+    LARGE_INTEGER Move,NowPointer;
+    Move.QuadPart = n;
+    if(!SetFilePointerEx(_hFile,Move,&NowPointer,FILE_CURRENT)){
+        sRet = Status::IOError(_filename,Win32::GetLastErrSz());
+    }
+    return sRet;
+}
+
+BOOL Win32SequentialFile::isEnable()
+{
+    return _hFile ? TRUE : FALSE;
+}
+
+BOOL Win32SequentialFile::_Init()
+{
+	std::wstring path;
+	ToWidePath(_filename, path);
+	_hFile = CreateFileW(path.c_str(),
+                         GENERIC_READ,
+                         FILE_SHARE_READ | FILE_SHARE_WRITE,
+                         NULL,
+                         OPEN_EXISTING,
+                         FILE_ATTRIBUTE_NORMAL | FILE_FLAG_SEQUENTIAL_SCAN,
+                         NULL);
+    if (_hFile == INVALID_HANDLE_VALUE)
+        _hFile = NULL;
+    return _hFile ? TRUE : FALSE;
+}
+
+void Win32SequentialFile::_CleanUp()
+{
+    if(_hFile){
+        CloseHandle(_hFile);
+        _hFile = NULL;
+    }
+}
+
+Win32RandomAccessFile::Win32RandomAccessFile( const std::string& fname ) :
+    _filename(fname),_hFile(NULL)
+{
+	std::wstring path;
+	ToWidePath(fname, path);
+    _Init( path.c_str() );
+}
+
+Win32RandomAccessFile::~Win32RandomAccessFile()
+{
+    _CleanUp();
+}
+
+Status Win32RandomAccessFile::Read(uint64_t offset,size_t n,Slice* result,char* scratch) const
+{
+    Status sRet;
+    OVERLAPPED ol = {0};
+    ZeroMemory(&ol,sizeof(ol));
+    ol.Offset = (DWORD)offset;
+    ol.OffsetHigh = (DWORD)(offset >> 32);
+    DWORD hasRead = 0;
+    if(!ReadFile(_hFile,scratch,n,&hasRead,&ol))
+        sRet = Status::IOError(_filename,Win32::GetLastErrSz());
+    else
+        *result = Slice(scratch,hasRead);
+    return sRet;
+}
+
+BOOL Win32RandomAccessFile::_Init( LPCWSTR path )
+{
+    BOOL bRet = FALSE;
+    if(!_hFile)
+        _hFile = ::CreateFileW(path,GENERIC_READ,FILE_SHARE_READ|FILE_SHARE_WRITE,NULL,OPEN_EXISTING,
+        FILE_ATTRIBUTE_NORMAL | FILE_FLAG_RANDOM_ACCESS,NULL);
+    if(!_hFile || _hFile == INVALID_HANDLE_VALUE )
+        _hFile = NULL;
+    else
+        bRet = TRUE;
+    return bRet;
+}
+
+BOOL Win32RandomAccessFile::isEnable()
+{
+    return _hFile ? TRUE : FALSE;
+}
+
+void Win32RandomAccessFile::_CleanUp()
+{
+    if(_hFile){
+        ::CloseHandle(_hFile);
+        _hFile = NULL;
+    }
+}
+
+Win32WritableFile::Win32WritableFile(const std::string& fname, bool append)
+    : filename_(fname)
+{
+    std::wstring path;
+    ToWidePath(fname, path);
+    // NewAppendableFile: append to an existing file, or create a new one
+    //     if none exists - this is OPEN_ALWAYS behavior, with
+    //     FILE_APPEND_DATA to avoid having to manually position the file
+    //     pointer at the end of the file.
+    // NewWritableFile: create a new file, delete if it exists - this is
+    //     CREATE_ALWAYS behavior. This file is used for writing only so
+    //     use GENERIC_WRITE.
+    _hFile = CreateFileW(path.c_str(),
+                         append ? FILE_APPEND_DATA : GENERIC_WRITE,
+                         FILE_SHARE_READ|FILE_SHARE_DELETE|FILE_SHARE_WRITE,
+                         NULL,
+                         append ? OPEN_ALWAYS : CREATE_ALWAYS,
+                         FILE_ATTRIBUTE_NORMAL,
+                         NULL);
+    // CreateFileW returns INVALID_HANDLE_VALUE in case of error, always check isEnable() before use
+}
+
+Win32WritableFile::~Win32WritableFile()
+{
+    if (_hFile != INVALID_HANDLE_VALUE)
+        Close();
+}
+
+Status Win32WritableFile::Append(const Slice& data)
+{
+    DWORD r = 0;
+    if (!WriteFile(_hFile, data.data(), data.size(), &r, NULL) || r != data.size()) {
+        return Status::IOError("Win32WritableFile.Append::WriteFile: "+filename_, Win32::GetLastErrSz());
+    }
+    return Status::OK();
+}
+
+Status Win32WritableFile::Close()
+{
+    if (!CloseHandle(_hFile)) {
+        return Status::IOError("Win32WritableFile.Close::CloseHandle: "+filename_, Win32::GetLastErrSz());
+    }
+    _hFile = INVALID_HANDLE_VALUE;
+    return Status::OK();
+}
+
+Status Win32WritableFile::Flush()
+{
+    // Nothing to do here, there are no application-side buffers
+    return Status::OK();
+}
+
+Status Win32WritableFile::Sync()
+{
+    if (!FlushFileBuffers(_hFile)) {
+        return Status::IOError("Win32WritableFile.Sync::FlushFileBuffers "+filename_, Win32::GetLastErrSz());
+    }
+    return Status::OK();
+}
+
+BOOL Win32WritableFile::isEnable()
+{
+    return _hFile != INVALID_HANDLE_VALUE;
+}
+
+Win32FileLock::Win32FileLock( const std::string& fname ) :
+    _hFile(NULL),_filename(fname)
+{
+	std::wstring path;
+	ToWidePath(fname, path);
+	_Init(path.c_str());
+}
+
+Win32FileLock::~Win32FileLock()
+{
+    _CleanUp();
+}
+
+BOOL Win32FileLock::_Init( LPCWSTR path )
+{
+    BOOL bRet = FALSE;
+    if(!_hFile)
+        _hFile = ::CreateFileW(path,0,0,NULL,CREATE_ALWAYS,FILE_ATTRIBUTE_NORMAL,NULL);
+    if(!_hFile || _hFile == INVALID_HANDLE_VALUE ){
+        _hFile = NULL;
+    }
+    else
+        bRet = TRUE;
+    return bRet;
+}
+
+void Win32FileLock::_CleanUp()
+{
+    ::CloseHandle(_hFile);
+    _hFile = NULL;
+}
+
+BOOL Win32FileLock::isEnable()
+{
+    return _hFile ? TRUE : FALSE;
+}
+
+Win32Logger::Win32Logger(WritableFile* pFile) : _pFileProxy(pFile)
+{
+    assert(_pFileProxy);
+}
+
+Win32Logger::~Win32Logger()
+{
+    if(_pFileProxy)
+        delete _pFileProxy;
+}
+
+void Win32Logger::Logv( const char* format, va_list ap )
+{
+    uint64_t thread_id = ::GetCurrentThreadId();
+
+    // We try twice: the first time with a fixed-size stack allocated buffer,
+    // and the second time with a much larger dynamically allocated buffer.
+    char buffer[500];
+    for (int iter = 0; iter < 2; iter++) {
+        char* base;
+        int bufsize;
+        if (iter == 0) {
+            bufsize = sizeof(buffer);
+            base = buffer;
+        } else {
+            bufsize = 30000;
+            base = new char[bufsize];
+        }
+        char* p = base;
+        char* limit = base + bufsize;
+
+        SYSTEMTIME st;
+        GetLocalTime(&st);
+        p += snprintf(p, limit - p,
+            "%04d/%02d/%02d-%02d:%02d:%02d.%06d %llx ",
+            int(st.wYear),
+            int(st.wMonth),
+            int(st.wDay),
+            int(st.wHour),
+            int(st.wMinute),
+            int(st.wMinute),
+            int(st.wMilliseconds),
+            static_cast<long long unsigned int>(thread_id));
+
+        // Print the message
+        if (p < limit) {
+            va_list backup_ap;
+            va_copy(backup_ap, ap);
+            p += vsnprintf(p, limit - p, format, backup_ap);
+            va_end(backup_ap);
+        }
+
+        // Truncate to available space if necessary
+        if (p >= limit) {
+            if (iter == 0) {
+                continue;       // Try again with larger buffer
+            } else {
+                p = limit - 1;
+            }
+        }
+
+        // Add newline if necessary
+        if (p == base || p[-1] != '\n') {
+            *p++ = '\n';
+        }
+
+        assert(p <= limit);
+        DWORD hasWritten = 0;
+        if(_pFileProxy){
+            _pFileProxy->Append(Slice(base, p - base));
+            _pFileProxy->Flush();
+        }
+        if (base != buffer) {
+            delete[] base;
+        }
+        break;
+    }
+}
+
+bool Win32Env::FileExists(const std::string& fname)
+{
+	std::string path = fname;
+    std::wstring wpath;
+	ToWidePath(ModifyPath(path), wpath);
+    return ::PathFileExistsW(wpath.c_str()) ? true : false;
+}
+
+Status Win32Env::GetChildren(const std::string& dir, std::vector<std::string>* result)
+{
+    Status sRet;
+    ::WIN32_FIND_DATAW wfd;
+    std::string path = dir;
+    ModifyPath(path);
+    path += "\\*.*";
+	std::wstring wpath;
+	ToWidePath(path, wpath);
+
+	::HANDLE hFind = ::FindFirstFileW(wpath.c_str() ,&wfd);
+    if(hFind && hFind != INVALID_HANDLE_VALUE){
+        BOOL hasNext = TRUE;
+        std::string child;
+        while(hasNext){
+            ToNarrowPath(wfd.cFileName, child); 
+            if(child != ".." && child != ".")  {
+                result->push_back(child);
+            }
+            hasNext = ::FindNextFileW(hFind,&wfd);
+        }
+        ::FindClose(hFind);
+    }
+    else
+        sRet = Status::IOError(dir,"Could not get children.");
+    return sRet;
+}
+
+void Win32Env::SleepForMicroseconds( int micros )
+{
+    ::Sleep((micros + 999) /1000);
+}
+
+
+Status Win32Env::DeleteFile( const std::string& fname )
+{
+    Status sRet;
+    std::string path = fname;
+    std::wstring wpath;
+	ToWidePath(ModifyPath(path), wpath);
+
+    if(!::DeleteFileW(wpath.c_str())) {
+        sRet = Status::IOError(path, "Could not delete file.");
+    }
+    return sRet;
+}
+
+Status Win32Env::GetFileSize( const std::string& fname, uint64_t* file_size )
+{
+    Status sRet;
+    std::string path = fname;
+    std::wstring wpath;
+	ToWidePath(ModifyPath(path), wpath);
+
+    HANDLE file = ::CreateFileW(wpath.c_str(),
+        GENERIC_READ,FILE_SHARE_READ|FILE_SHARE_WRITE,NULL,OPEN_EXISTING,FILE_ATTRIBUTE_NORMAL,NULL);
+    LARGE_INTEGER li;
+    if(::GetFileSizeEx(file,&li)){
+        *file_size = (uint64_t)li.QuadPart;
+    }else
+        sRet = Status::IOError(path,"Could not get the file size.");
+    CloseHandle(file);
+    return sRet;
+}
+
+Status Win32Env::RenameFile( const std::string& src, const std::string& target )
+{
+    Status sRet;
+    std::string src_path = src;
+    std::wstring wsrc_path;
+	ToWidePath(ModifyPath(src_path), wsrc_path);
+	std::string target_path = target;
+    std::wstring wtarget_path;
+	ToWidePath(ModifyPath(target_path), wtarget_path);
+
+    if(!MoveFileW(wsrc_path.c_str(), wtarget_path.c_str() ) ){
+        DWORD err = GetLastError();
+        if(err == 0x000000b7){
+            if(!::DeleteFileW(wtarget_path.c_str() ) )
+                sRet = Status::IOError(src, "Could not rename file.");
+			else if(!::MoveFileW(wsrc_path.c_str(),
+                                 wtarget_path.c_str() ) )
+                sRet = Status::IOError(src, "Could not rename file.");    
+        }
+    }
+    return sRet;
+}
+
+Status Win32Env::LockFile( const std::string& fname, FileLock** lock )
+{
+    Status sRet;
+    std::string path = fname;
+    ModifyPath(path);
+    Win32FileLock* _lock = new Win32FileLock(path);
+    if(!_lock->isEnable()){
+        delete _lock;
+        *lock = NULL;
+        sRet = Status::IOError(path, "Could not lock file.");
+    }
+    else
+        *lock = _lock;
+    return sRet;
+}
+
+Status Win32Env::UnlockFile( FileLock* lock )
+{
+    Status sRet;
+    delete lock;
+    return sRet;
+}
+
+void Win32Env::Schedule( void (*function)(void* arg), void* arg )
+{
+    QueueUserWorkItem(Win32::WorkItemWrapperProc,
+                      new Win32::WorkItemWrapper(function,arg),
+                      WT_EXECUTEDEFAULT);
+}
+
+void Win32Env::StartThread( void (*function)(void* arg), void* arg )
+{
+    ::_beginthread(function,0,arg);
+}
+
+Status Win32Env::GetTestDirectory( std::string* path )
+{
+    Status sRet;
+    WCHAR TempPath[MAX_PATH];
+    ::GetTempPathW(MAX_PATH,TempPath);
+	ToNarrowPath(TempPath, *path);
+    path->append("leveldb\\test\\");
+    ModifyPath(*path);
+    return sRet;
+}
+
+uint64_t Win32Env::NowMicros()
+{
+#ifndef USE_VISTA_API
+#define GetTickCount64 GetTickCount
+#endif
+    return (uint64_t)(GetTickCount64()*1000);
+}
+
+static Status CreateDirInner( const std::string& dirname )
+{
+    Status sRet;
+    std::wstring dirnameW;
+    ToWidePath(dirname, dirnameW);
+    DWORD attr = ::GetFileAttributesW(dirnameW.c_str());
+    if (attr == INVALID_FILE_ATTRIBUTES) { // doesn't exist:
+      std::size_t slash = dirname.find_last_of("\\");
+      if (slash != std::string::npos){
+	sRet = CreateDirInner(dirname.substr(0, slash));
+	if (!sRet.ok()) return sRet;
+      }
+      BOOL result = ::CreateDirectoryW(dirnameW.c_str(), NULL);
+      if (result == FALSE) {
+	sRet = Status::IOError(dirname, "Could not create directory.");
+	return sRet;
+      }
+    }
+    return sRet;
+}
+
+Status Win32Env::CreateDir( const std::string& dirname )
+{
+    std::string path = dirname;
+    if(path[path.length() - 1] != '\\'){
+        path += '\\';
+    }
+    ModifyPath(path);
+
+    return CreateDirInner(path);
+}
+
+Status Win32Env::DeleteDir( const std::string& dirname )
+{
+    Status sRet;
+    std::wstring path;
+	ToWidePath(dirname, path);
+    ModifyPath(path);
+    if(!::RemoveDirectoryW( path.c_str() ) ){
+        sRet = Status::IOError(dirname, "Could not delete directory.");
+    }
+    return sRet;
+}
+
+Status Win32Env::NewSequentialFile( const std::string& fname, SequentialFile** result )
+{
+    Status sRet;
+    std::string path = fname;
+    ModifyPath(path);
+    Win32SequentialFile* pFile = new Win32SequentialFile(path);
+    if(pFile->isEnable()){
+        *result = pFile;
+    }else {
+        delete pFile;
+        sRet = Status::IOError(path, Win32::GetLastErrSz());
+    }
+    return sRet;
+}
+
+Status Win32Env::NewRandomAccessFile( const std::string& fname, RandomAccessFile** result )
+{
+    Status sRet;
+    std::string path = fname;
+    Win32RandomAccessFile* pFile = new Win32RandomAccessFile(ModifyPath(path));
+    if(!pFile->isEnable()){
+        delete pFile;
+        *result = NULL;
+        sRet = Status::IOError(path, Win32::GetLastErrSz());
+    }else
+        *result = pFile;
+    return sRet;
+}
+
+Status Win32Env::NewLogger( const std::string& fname, Logger** result )
+{
+    Status sRet;
+    std::string path = fname;
+    // Logs are opened with write semantics, not with append semantics
+    // (see PosixEnv::NewLogger)
+    Win32WritableFile* pMapFile = new Win32WritableFile(ModifyPath(path), false);
+    if(!pMapFile->isEnable()){
+        delete pMapFile;
+        *result = NULL;
+        sRet = Status::IOError(path,"could not create a logger.");
+    }else
+        *result = new Win32Logger(pMapFile);
+    return sRet;
+}
+
+Status Win32Env::NewWritableFile( const std::string& fname, WritableFile** result )
+{
+    Status sRet;
+    std::string path = fname;
+    Win32WritableFile* pFile = new Win32WritableFile(ModifyPath(path), false);
+    if(!pFile->isEnable()){
+        *result = NULL;
+        sRet = Status::IOError(fname,Win32::GetLastErrSz());
+    }else
+        *result = pFile;
+    return sRet;
+}
+
+Status Win32Env::NewAppendableFile( const std::string& fname, WritableFile** result )
+{
+    Status sRet;
+    std::string path = fname;
+    Win32WritableFile* pFile = new Win32WritableFile(ModifyPath(path), true);
+    if(!pFile->isEnable()){
+        *result = NULL;
+        sRet = Status::IOError(fname,Win32::GetLastErrSz());
+    }else
+        *result = pFile;
+    return sRet;
+}
+
+Win32Env::Win32Env()
+{
+
+}
+
+Win32Env::~Win32Env()
+{
+
+}
+
+
+}  // Win32 namespace
+
+static port::OnceType once = LEVELDB_ONCE_INIT;
+static Env* default_env;
+static void InitDefaultEnv() { default_env = new Win32::Win32Env(); }
+
+Env* Env::Default() {
+  port::InitOnce(&once, InitDefaultEnv);
+  return default_env;
+}
+
+}  // namespace leveldb
+
+#endif // defined(LEVELDB_PLATFORM_WINDOWS)
diff --git a/depend/zcash/src/leveldb/util/filter_policy.cc b/depend/zcash/src/leveldb/util/filter_policy.cc
new file mode 100644
index 000000000..7b045c8c9
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/filter_policy.cc
@@ -0,0 +1,11 @@
+// Copyright (c) 2012 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "leveldb/filter_policy.h"
+
+namespace leveldb {
+
+FilterPolicy::~FilterPolicy() { }
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/util/hash.cc b/depend/zcash/src/leveldb/util/hash.cc
new file mode 100644
index 000000000..ed439ce7a
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/hash.cc
@@ -0,0 +1,52 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include <string.h>
+#include "util/coding.h"
+#include "util/hash.h"
+
+// The FALLTHROUGH_INTENDED macro can be used to annotate implicit fall-through
+// between switch labels. The real definition should be provided externally.
+// This one is a fallback version for unsupported compilers.
+#ifndef FALLTHROUGH_INTENDED
+#define FALLTHROUGH_INTENDED do { } while (0)
+#endif
+
+namespace leveldb {
+
+uint32_t Hash(const char* data, size_t n, uint32_t seed) {
+  // Similar to murmur hash
+  const uint32_t m = 0xc6a4a793;
+  const uint32_t r = 24;
+  const char* limit = data + n;
+  uint32_t h = seed ^ (n * m);
+
+  // Pick up four bytes at a time
+  while (data + 4 <= limit) {
+    uint32_t w = DecodeFixed32(data);
+    data += 4;
+    h += w;
+    h *= m;
+    h ^= (h >> 16);
+  }
+
+  // Pick up remaining bytes
+  switch (limit - data) {
+    case 3:
+      h += static_cast<unsigned char>(data[2]) << 16;
+      FALLTHROUGH_INTENDED;
+    case 2:
+      h += static_cast<unsigned char>(data[1]) << 8;
+      FALLTHROUGH_INTENDED;
+    case 1:
+      h += static_cast<unsigned char>(data[0]);
+      h *= m;
+      h ^= (h >> r);
+      break;
+  }
+  return h;
+}
+
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/util/hash.h b/depend/zcash/src/leveldb/util/hash.h
new file mode 100644
index 000000000..8889d56be
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/hash.h
@@ -0,0 +1,19 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// Simple hash function used for internal data structures
+
+#ifndef STORAGE_LEVELDB_UTIL_HASH_H_
+#define STORAGE_LEVELDB_UTIL_HASH_H_
+
+#include <stddef.h>
+#include <stdint.h>
+
+namespace leveldb {
+
+extern uint32_t Hash(const char* data, size_t n, uint32_t seed);
+
+}
+
+#endif  // STORAGE_LEVELDB_UTIL_HASH_H_
diff --git a/depend/zcash/src/leveldb/util/hash_test.cc b/depend/zcash/src/leveldb/util/hash_test.cc
new file mode 100644
index 000000000..eaa1c92c2
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/hash_test.cc
@@ -0,0 +1,54 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "util/hash.h"
+#include "util/testharness.h"
+
+namespace leveldb {
+
+class HASH { };
+
+TEST(HASH, SignedUnsignedIssue) {
+  const unsigned char data1[1] = {0x62};
+  const unsigned char data2[2] = {0xc3, 0x97};
+  const unsigned char data3[3] = {0xe2, 0x99, 0xa5};
+  const unsigned char data4[4] = {0xe1, 0x80, 0xb9, 0x32};
+  const unsigned char data5[48] = {
+    0x01, 0xc0, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00,
+    0x14, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x04, 0x00,
+    0x00, 0x00, 0x00, 0x14,
+    0x00, 0x00, 0x00, 0x18,
+    0x28, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00,
+    0x02, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00,
+  };
+
+  ASSERT_EQ(Hash(0, 0, 0xbc9f1d34), 0xbc9f1d34);
+  ASSERT_EQ(
+      Hash(reinterpret_cast<const char*>(data1), sizeof(data1), 0xbc9f1d34),
+      0xef1345c4);
+  ASSERT_EQ(
+      Hash(reinterpret_cast<const char*>(data2), sizeof(data2), 0xbc9f1d34),
+      0x5b663814);
+  ASSERT_EQ(
+      Hash(reinterpret_cast<const char*>(data3), sizeof(data3), 0xbc9f1d34),
+      0x323c078f);
+  ASSERT_EQ(
+      Hash(reinterpret_cast<const char*>(data4), sizeof(data4), 0xbc9f1d34),
+      0xed21633a);
+  ASSERT_EQ(
+      Hash(reinterpret_cast<const char*>(data5), sizeof(data5), 0x12345678),
+      0xf333dabb);
+}
+
+}  // namespace leveldb
+
+int main(int argc, char** argv) {
+  return leveldb::test::RunAllTests();
+}
diff --git a/depend/zcash/src/leveldb/util/histogram.cc b/depend/zcash/src/leveldb/util/histogram.cc
new file mode 100644
index 000000000..bb95f583e
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/histogram.cc
@@ -0,0 +1,139 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include <math.h>
+#include <stdio.h>
+#include "port/port.h"
+#include "util/histogram.h"
+
+namespace leveldb {
+
+const double Histogram::kBucketLimit[kNumBuckets] = {
+  1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 16, 18, 20, 25, 30, 35, 40, 45,
+  50, 60, 70, 80, 90, 100, 120, 140, 160, 180, 200, 250, 300, 350, 400, 450,
+  500, 600, 700, 800, 900, 1000, 1200, 1400, 1600, 1800, 2000, 2500, 3000,
+  3500, 4000, 4500, 5000, 6000, 7000, 8000, 9000, 10000, 12000, 14000,
+  16000, 18000, 20000, 25000, 30000, 35000, 40000, 45000, 50000, 60000,
+  70000, 80000, 90000, 100000, 120000, 140000, 160000, 180000, 200000,
+  250000, 300000, 350000, 400000, 450000, 500000, 600000, 700000, 800000,
+  900000, 1000000, 1200000, 1400000, 1600000, 1800000, 2000000, 2500000,
+  3000000, 3500000, 4000000, 4500000, 5000000, 6000000, 7000000, 8000000,
+  9000000, 10000000, 12000000, 14000000, 16000000, 18000000, 20000000,
+  25000000, 30000000, 35000000, 40000000, 45000000, 50000000, 60000000,
+  70000000, 80000000, 90000000, 100000000, 120000000, 140000000, 160000000,
+  180000000, 200000000, 250000000, 300000000, 350000000, 400000000,
+  450000000, 500000000, 600000000, 700000000, 800000000, 900000000,
+  1000000000, 1200000000, 1400000000, 1600000000, 1800000000, 2000000000,
+  2500000000.0, 3000000000.0, 3500000000.0, 4000000000.0, 4500000000.0,
+  5000000000.0, 6000000000.0, 7000000000.0, 8000000000.0, 9000000000.0,
+  1e200,
+};
+
+void Histogram::Clear() {
+  min_ = kBucketLimit[kNumBuckets-1];
+  max_ = 0;
+  num_ = 0;
+  sum_ = 0;
+  sum_squares_ = 0;
+  for (int i = 0; i < kNumBuckets; i++) {
+    buckets_[i] = 0;
+  }
+}
+
+void Histogram::Add(double value) {
+  // Linear search is fast enough for our usage in db_bench
+  int b = 0;
+  while (b < kNumBuckets - 1 && kBucketLimit[b] <= value) {
+    b++;
+  }
+  buckets_[b] += 1.0;
+  if (min_ > value) min_ = value;
+  if (max_ < value) max_ = value;
+  num_++;
+  sum_ += value;
+  sum_squares_ += (value * value);
+}
+
+void Histogram::Merge(const Histogram& other) {
+  if (other.min_ < min_) min_ = other.min_;
+  if (other.max_ > max_) max_ = other.max_;
+  num_ += other.num_;
+  sum_ += other.sum_;
+  sum_squares_ += other.sum_squares_;
+  for (int b = 0; b < kNumBuckets; b++) {
+    buckets_[b] += other.buckets_[b];
+  }
+}
+
+double Histogram::Median() const {
+  return Percentile(50.0);
+}
+
+double Histogram::Percentile(double p) const {
+  double threshold = num_ * (p / 100.0);
+  double sum = 0;
+  for (int b = 0; b < kNumBuckets; b++) {
+    sum += buckets_[b];
+    if (sum >= threshold) {
+      // Scale linearly within this bucket
+      double left_point = (b == 0) ? 0 : kBucketLimit[b-1];
+      double right_point = kBucketLimit[b];
+      double left_sum = sum - buckets_[b];
+      double right_sum = sum;
+      double pos = (threshold - left_sum) / (right_sum - left_sum);
+      double r = left_point + (right_point - left_point) * pos;
+      if (r < min_) r = min_;
+      if (r > max_) r = max_;
+      return r;
+    }
+  }
+  return max_;
+}
+
+double Histogram::Average() const {
+  if (num_ == 0.0) return 0;
+  return sum_ / num_;
+}
+
+double Histogram::StandardDeviation() const {
+  if (num_ == 0.0) return 0;
+  double variance = (sum_squares_ * num_ - sum_ * sum_) / (num_ * num_);
+  return sqrt(variance);
+}
+
+std::string Histogram::ToString() const {
+  std::string r;
+  char buf[200];
+  snprintf(buf, sizeof(buf),
+           "Count: %.0f  Average: %.4f  StdDev: %.2f\n",
+           num_, Average(), StandardDeviation());
+  r.append(buf);
+  snprintf(buf, sizeof(buf),
+           "Min: %.4f  Median: %.4f  Max: %.4f\n",
+           (num_ == 0.0 ? 0.0 : min_), Median(), max_);
+  r.append(buf);
+  r.append("------------------------------------------------------\n");
+  const double mult = 100.0 / num_;
+  double sum = 0;
+  for (int b = 0; b < kNumBuckets; b++) {
+    if (buckets_[b] <= 0.0) continue;
+    sum += buckets_[b];
+    snprintf(buf, sizeof(buf),
+             "[ %7.0f, %7.0f ) %7.0f %7.3f%% %7.3f%% ",
+             ((b == 0) ? 0.0 : kBucketLimit[b-1]),      // left
+             kBucketLimit[b],                           // right
+             buckets_[b],                               // count
+             mult * buckets_[b],                        // percentage
+             mult * sum);                               // cumulative percentage
+    r.append(buf);
+
+    // Add hash marks based on percentage; 20 marks for 100%.
+    int marks = static_cast<int>(20*(buckets_[b] / num_) + 0.5);
+    r.append(marks, '#');
+    r.push_back('\n');
+  }
+  return r;
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/util/histogram.h b/depend/zcash/src/leveldb/util/histogram.h
new file mode 100644
index 000000000..1ef9f3c8a
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/histogram.h
@@ -0,0 +1,42 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_UTIL_HISTOGRAM_H_
+#define STORAGE_LEVELDB_UTIL_HISTOGRAM_H_
+
+#include <string>
+
+namespace leveldb {
+
+class Histogram {
+ public:
+  Histogram() { }
+  ~Histogram() { }
+
+  void Clear();
+  void Add(double value);
+  void Merge(const Histogram& other);
+
+  std::string ToString() const;
+
+ private:
+  double min_;
+  double max_;
+  double num_;
+  double sum_;
+  double sum_squares_;
+
+  enum { kNumBuckets = 154 };
+  static const double kBucketLimit[kNumBuckets];
+  double buckets_[kNumBuckets];
+
+  double Median() const;
+  double Percentile(double p) const;
+  double Average() const;
+  double StandardDeviation() const;
+};
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_UTIL_HISTOGRAM_H_
diff --git a/depend/zcash/src/leveldb/util/logging.cc b/depend/zcash/src/leveldb/util/logging.cc
new file mode 100644
index 000000000..db6160c8f
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/logging.cc
@@ -0,0 +1,72 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "util/logging.h"
+
+#include <errno.h>
+#include <stdarg.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include "leveldb/env.h"
+#include "leveldb/slice.h"
+
+namespace leveldb {
+
+void AppendNumberTo(std::string* str, uint64_t num) {
+  char buf[30];
+  snprintf(buf, sizeof(buf), "%llu", (unsigned long long) num);
+  str->append(buf);
+}
+
+void AppendEscapedStringTo(std::string* str, const Slice& value) {
+  for (size_t i = 0; i < value.size(); i++) {
+    char c = value[i];
+    if (c >= ' ' && c <= '~') {
+      str->push_back(c);
+    } else {
+      char buf[10];
+      snprintf(buf, sizeof(buf), "\\x%02x",
+               static_cast<unsigned int>(c) & 0xff);
+      str->append(buf);
+    }
+  }
+}
+
+std::string NumberToString(uint64_t num) {
+  std::string r;
+  AppendNumberTo(&r, num);
+  return r;
+}
+
+std::string EscapeString(const Slice& value) {
+  std::string r;
+  AppendEscapedStringTo(&r, value);
+  return r;
+}
+
+bool ConsumeDecimalNumber(Slice* in, uint64_t* val) {
+  uint64_t v = 0;
+  int digits = 0;
+  while (!in->empty()) {
+    unsigned char c = (*in)[0];
+    if (c >= '0' && c <= '9') {
+      ++digits;
+      const int delta = (c - '0');
+      static const uint64_t kMaxUint64 = ~static_cast<uint64_t>(0);
+      if (v > kMaxUint64/10 ||
+          (v == kMaxUint64/10 && delta > kMaxUint64%10)) {
+        // Overflow
+        return false;
+      }
+      v = (v * 10) + delta;
+      in->remove_prefix(1);
+    } else {
+      break;
+    }
+  }
+  *val = v;
+  return (digits > 0);
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/util/logging.h b/depend/zcash/src/leveldb/util/logging.h
new file mode 100644
index 000000000..1b450d248
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/logging.h
@@ -0,0 +1,43 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// Must not be included from any .h files to avoid polluting the namespace
+// with macros.
+
+#ifndef STORAGE_LEVELDB_UTIL_LOGGING_H_
+#define STORAGE_LEVELDB_UTIL_LOGGING_H_
+
+#include <stdio.h>
+#include <stdint.h>
+#include <string>
+#include "port/port.h"
+
+namespace leveldb {
+
+class Slice;
+class WritableFile;
+
+// Append a human-readable printout of "num" to *str
+extern void AppendNumberTo(std::string* str, uint64_t num);
+
+// Append a human-readable printout of "value" to *str.
+// Escapes any non-printable characters found in "value".
+extern void AppendEscapedStringTo(std::string* str, const Slice& value);
+
+// Return a human-readable printout of "num"
+extern std::string NumberToString(uint64_t num);
+
+// Return a human-readable version of "value".
+// Escapes any non-printable characters found in "value".
+extern std::string EscapeString(const Slice& value);
+
+// Parse a human-readable number from "*in" into *value.  On success,
+// advances "*in" past the consumed number and sets "*val" to the
+// numeric value.  Otherwise, returns false and leaves *in in an
+// unspecified state.
+extern bool ConsumeDecimalNumber(Slice* in, uint64_t* val);
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_UTIL_LOGGING_H_
diff --git a/depend/zcash/src/leveldb/util/mutexlock.h b/depend/zcash/src/leveldb/util/mutexlock.h
new file mode 100644
index 000000000..1ff5a9efa
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/mutexlock.h
@@ -0,0 +1,41 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_UTIL_MUTEXLOCK_H_
+#define STORAGE_LEVELDB_UTIL_MUTEXLOCK_H_
+
+#include "port/port.h"
+#include "port/thread_annotations.h"
+
+namespace leveldb {
+
+// Helper class that locks a mutex on construction and unlocks the mutex when
+// the destructor of the MutexLock object is invoked.
+//
+// Typical usage:
+//
+//   void MyClass::MyMethod() {
+//     MutexLock l(&mu_);       // mu_ is an instance variable
+//     ... some complex code, possibly with multiple return paths ...
+//   }
+
+class SCOPED_LOCKABLE MutexLock {
+ public:
+  explicit MutexLock(port::Mutex *mu) EXCLUSIVE_LOCK_FUNCTION(mu)
+      : mu_(mu)  {
+    this->mu_->Lock();
+  }
+  ~MutexLock() UNLOCK_FUNCTION() { this->mu_->Unlock(); }
+
+ private:
+  port::Mutex *const mu_;
+  // No copying allowed
+  MutexLock(const MutexLock&);
+  void operator=(const MutexLock&);
+};
+
+}  // namespace leveldb
+
+
+#endif  // STORAGE_LEVELDB_UTIL_MUTEXLOCK_H_
diff --git a/depend/zcash/src/leveldb/util/options.cc b/depend/zcash/src/leveldb/util/options.cc
new file mode 100644
index 000000000..b5e622761
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/options.cc
@@ -0,0 +1,30 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "leveldb/options.h"
+
+#include "leveldb/comparator.h"
+#include "leveldb/env.h"
+
+namespace leveldb {
+
+Options::Options()
+    : comparator(BytewiseComparator()),
+      create_if_missing(false),
+      error_if_exists(false),
+      paranoid_checks(false),
+      env(Env::Default()),
+      info_log(NULL),
+      write_buffer_size(4<<20),
+      max_open_files(1000),
+      block_cache(NULL),
+      block_size(4096),
+      block_restart_interval(16),
+      max_file_size(2<<20),
+      compression(kSnappyCompression),
+      reuse_logs(false),
+      filter_policy(NULL) {
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/util/posix_logger.h b/depend/zcash/src/leveldb/util/posix_logger.h
new file mode 100644
index 000000000..c063c2b7c
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/posix_logger.h
@@ -0,0 +1,98 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+//
+// Logger implementation that can be shared by all environments
+// where enough Posix functionality is available.
+
+#ifndef STORAGE_LEVELDB_UTIL_POSIX_LOGGER_H_
+#define STORAGE_LEVELDB_UTIL_POSIX_LOGGER_H_
+
+#include <algorithm>
+#include <stdio.h>
+#include <sys/time.h>
+#include <time.h>
+#include "leveldb/env.h"
+
+namespace leveldb {
+
+class PosixLogger : public Logger {
+ private:
+  FILE* file_;
+  uint64_t (*gettid_)();  // Return the thread id for the current thread
+ public:
+  PosixLogger(FILE* f, uint64_t (*gettid)()) : file_(f), gettid_(gettid) { }
+  virtual ~PosixLogger() {
+    fclose(file_);
+  }
+  virtual void Logv(const char* format, va_list ap) {
+    const uint64_t thread_id = (*gettid_)();
+
+    // We try twice: the first time with a fixed-size stack allocated buffer,
+    // and the second time with a much larger dynamically allocated buffer.
+    char buffer[500];
+    for (int iter = 0; iter < 2; iter++) {
+      char* base;
+      int bufsize;
+      if (iter == 0) {
+        bufsize = sizeof(buffer);
+        base = buffer;
+      } else {
+        bufsize = 30000;
+        base = new char[bufsize];
+      }
+      char* p = base;
+      char* limit = base + bufsize;
+
+      struct timeval now_tv;
+      gettimeofday(&now_tv, NULL);
+      const time_t seconds = now_tv.tv_sec;
+      struct tm t;
+      localtime_r(&seconds, &t);
+      p += snprintf(p, limit - p,
+                    "%04d/%02d/%02d-%02d:%02d:%02d.%06d %llx ",
+                    t.tm_year + 1900,
+                    t.tm_mon + 1,
+                    t.tm_mday,
+                    t.tm_hour,
+                    t.tm_min,
+                    t.tm_sec,
+                    static_cast<int>(now_tv.tv_usec),
+                    static_cast<long long unsigned int>(thread_id));
+
+      // Print the message
+      if (p < limit) {
+        va_list backup_ap;
+        va_copy(backup_ap, ap);
+        p += vsnprintf(p, limit - p, format, backup_ap);
+        va_end(backup_ap);
+      }
+
+      // Truncate to available space if necessary
+      if (p >= limit) {
+        if (iter == 0) {
+          continue;       // Try again with larger buffer
+        } else {
+          p = limit - 1;
+        }
+      }
+
+      // Add newline if necessary
+      if (p == base || p[-1] != '\n') {
+        *p++ = '\n';
+      }
+
+      assert(p <= limit);
+      fwrite(base, 1, p - base, file_);
+      fflush(file_);
+      if (base != buffer) {
+        delete[] base;
+      }
+      break;
+    }
+  }
+};
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_UTIL_POSIX_LOGGER_H_
diff --git a/depend/zcash/src/leveldb/util/random.h b/depend/zcash/src/leveldb/util/random.h
new file mode 100644
index 000000000..ddd51b1c7
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/random.h
@@ -0,0 +1,64 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_UTIL_RANDOM_H_
+#define STORAGE_LEVELDB_UTIL_RANDOM_H_
+
+#include <stdint.h>
+
+namespace leveldb {
+
+// A very simple random number generator.  Not especially good at
+// generating truly random bits, but good enough for our needs in this
+// package.
+class Random {
+ private:
+  uint32_t seed_;
+ public:
+  explicit Random(uint32_t s) : seed_(s & 0x7fffffffu) {
+    // Avoid bad seeds.
+    if (seed_ == 0 || seed_ == 2147483647L) {
+      seed_ = 1;
+    }
+  }
+  uint32_t Next() {
+    static const uint32_t M = 2147483647L;   // 2^31-1
+    static const uint64_t A = 16807;  // bits 14, 8, 7, 5, 2, 1, 0
+    // We are computing
+    //       seed_ = (seed_ * A) % M,    where M = 2^31-1
+    //
+    // seed_ must not be zero or M, or else all subsequent computed values
+    // will be zero or M respectively.  For all other values, seed_ will end
+    // up cycling through every number in [1,M-1]
+    uint64_t product = seed_ * A;
+
+    // Compute (product % M) using the fact that ((x << 31) % M) == x.
+    seed_ = static_cast<uint32_t>((product >> 31) + (product & M));
+    // The first reduction may overflow by 1 bit, so we may need to
+    // repeat.  mod == M is not possible; using > allows the faster
+    // sign-bit-based test.
+    if (seed_ > M) {
+      seed_ -= M;
+    }
+    return seed_;
+  }
+  // Returns a uniformly distributed value in the range [0..n-1]
+  // REQUIRES: n > 0
+  uint32_t Uniform(int n) { return Next() % n; }
+
+  // Randomly returns true ~"1/n" of the time, and false otherwise.
+  // REQUIRES: n > 0
+  bool OneIn(int n) { return (Next() % n) == 0; }
+
+  // Skewed: pick "base" uniformly from range [0,max_log] and then
+  // return "base" random bits.  The effect is to pick a number in the
+  // range [0,2^max_log-1] with exponential bias towards smaller numbers.
+  uint32_t Skewed(int max_log) {
+    return Uniform(1 << Uniform(max_log + 1));
+  }
+};
+
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_UTIL_RANDOM_H_
diff --git a/depend/zcash/src/leveldb/util/status.cc b/depend/zcash/src/leveldb/util/status.cc
new file mode 100644
index 000000000..a44f35b31
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/status.cc
@@ -0,0 +1,75 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include <stdio.h>
+#include "port/port.h"
+#include "leveldb/status.h"
+
+namespace leveldb {
+
+const char* Status::CopyState(const char* state) {
+  uint32_t size;
+  memcpy(&size, state, sizeof(size));
+  char* result = new char[size + 5];
+  memcpy(result, state, size + 5);
+  return result;
+}
+
+Status::Status(Code code, const Slice& msg, const Slice& msg2) {
+  assert(code != kOk);
+  const uint32_t len1 = msg.size();
+  const uint32_t len2 = msg2.size();
+  const uint32_t size = len1 + (len2 ? (2 + len2) : 0);
+  char* result = new char[size + 5];
+  memcpy(result, &size, sizeof(size));
+  result[4] = static_cast<char>(code);
+  memcpy(result + 5, msg.data(), len1);
+  if (len2) {
+    result[5 + len1] = ':';
+    result[6 + len1] = ' ';
+    memcpy(result + 7 + len1, msg2.data(), len2);
+  }
+  state_ = result;
+}
+
+std::string Status::ToString() const {
+  if (state_ == NULL) {
+    return "OK";
+  } else {
+    char tmp[30];
+    const char* type;
+    switch (code()) {
+      case kOk:
+        type = "OK";
+        break;
+      case kNotFound:
+        type = "NotFound: ";
+        break;
+      case kCorruption:
+        type = "Corruption: ";
+        break;
+      case kNotSupported:
+        type = "Not implemented: ";
+        break;
+      case kInvalidArgument:
+        type = "Invalid argument: ";
+        break;
+      case kIOError:
+        type = "IO error: ";
+        break;
+      default:
+        snprintf(tmp, sizeof(tmp), "Unknown code(%d): ",
+                 static_cast<int>(code()));
+        type = tmp;
+        break;
+    }
+    std::string result(type);
+    uint32_t length;
+    memcpy(&length, state_, sizeof(length));
+    result.append(state_ + 5, length);
+    return result;
+  }
+}
+
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/util/testharness.cc b/depend/zcash/src/leveldb/util/testharness.cc
new file mode 100644
index 000000000..402fab34d
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/testharness.cc
@@ -0,0 +1,77 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "util/testharness.h"
+
+#include <string>
+#include <stdlib.h>
+#include <sys/stat.h>
+#include <sys/types.h>
+
+namespace leveldb {
+namespace test {
+
+namespace {
+struct Test {
+  const char* base;
+  const char* name;
+  void (*func)();
+};
+std::vector<Test>* tests;
+}
+
+bool RegisterTest(const char* base, const char* name, void (*func)()) {
+  if (tests == NULL) {
+    tests = new std::vector<Test>;
+  }
+  Test t;
+  t.base = base;
+  t.name = name;
+  t.func = func;
+  tests->push_back(t);
+  return true;
+}
+
+int RunAllTests() {
+  const char* matcher = getenv("LEVELDB_TESTS");
+
+  int num = 0;
+  if (tests != NULL) {
+    for (size_t i = 0; i < tests->size(); i++) {
+      const Test& t = (*tests)[i];
+      if (matcher != NULL) {
+        std::string name = t.base;
+        name.push_back('.');
+        name.append(t.name);
+        if (strstr(name.c_str(), matcher) == NULL) {
+          continue;
+        }
+      }
+      fprintf(stderr, "==== Test %s.%s\n", t.base, t.name);
+      (*t.func)();
+      ++num;
+    }
+  }
+  fprintf(stderr, "==== PASSED %d tests\n", num);
+  return 0;
+}
+
+std::string TmpDir() {
+  std::string dir;
+  Status s = Env::Default()->GetTestDirectory(&dir);
+  ASSERT_TRUE(s.ok()) << s.ToString();
+  return dir;
+}
+
+int RandomSeed() {
+  const char* env = getenv("TEST_RANDOM_SEED");
+  int result = (env != NULL ? atoi(env) : 301);
+  if (result <= 0) {
+    result = 301;
+  }
+  return result;
+}
+
+}  // namespace test
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/util/testharness.h b/depend/zcash/src/leveldb/util/testharness.h
new file mode 100644
index 000000000..da4fe68bb
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/testharness.h
@@ -0,0 +1,138 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_UTIL_TESTHARNESS_H_
+#define STORAGE_LEVELDB_UTIL_TESTHARNESS_H_
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <sstream>
+#include "leveldb/env.h"
+#include "leveldb/slice.h"
+#include "util/random.h"
+
+namespace leveldb {
+namespace test {
+
+// Run some of the tests registered by the TEST() macro.  If the
+// environment variable "LEVELDB_TESTS" is not set, runs all tests.
+// Otherwise, runs only the tests whose name contains the value of
+// "LEVELDB_TESTS" as a substring.  E.g., suppose the tests are:
+//    TEST(Foo, Hello) { ... }
+//    TEST(Foo, World) { ... }
+// LEVELDB_TESTS=Hello will run the first test
+// LEVELDB_TESTS=o     will run both tests
+// LEVELDB_TESTS=Junk  will run no tests
+//
+// Returns 0 if all tests pass.
+// Dies or returns a non-zero value if some test fails.
+extern int RunAllTests();
+
+// Return the directory to use for temporary storage.
+extern std::string TmpDir();
+
+// Return a randomization seed for this run.  Typically returns the
+// same number on repeated invocations of this binary, but automated
+// runs may be able to vary the seed.
+extern int RandomSeed();
+
+// An instance of Tester is allocated to hold temporary state during
+// the execution of an assertion.
+class Tester {
+ private:
+  bool ok_;
+  const char* fname_;
+  int line_;
+  std::stringstream ss_;
+
+ public:
+  Tester(const char* f, int l)
+      : ok_(true), fname_(f), line_(l) {
+  }
+
+  ~Tester() {
+    if (!ok_) {
+      fprintf(stderr, "%s:%d:%s\n", fname_, line_, ss_.str().c_str());
+      exit(1);
+    }
+  }
+
+  Tester& Is(bool b, const char* msg) {
+    if (!b) {
+      ss_ << " Assertion failure " << msg;
+      ok_ = false;
+    }
+    return *this;
+  }
+
+  Tester& IsOk(const Status& s) {
+    if (!s.ok()) {
+      ss_ << " " << s.ToString();
+      ok_ = false;
+    }
+    return *this;
+  }
+
+#define BINARY_OP(name,op)                              \
+  template <class X, class Y>                           \
+  Tester& name(const X& x, const Y& y) {                \
+    if (! (x op y)) {                                   \
+      ss_ << " failed: " << x << (" " #op " ") << y;    \
+      ok_ = false;                                      \
+    }                                                   \
+    return *this;                                       \
+  }
+
+  BINARY_OP(IsEq, ==)
+  BINARY_OP(IsNe, !=)
+  BINARY_OP(IsGe, >=)
+  BINARY_OP(IsGt, >)
+  BINARY_OP(IsLe, <=)
+  BINARY_OP(IsLt, <)
+#undef BINARY_OP
+
+  // Attach the specified value to the error message if an error has occurred
+  template <class V>
+  Tester& operator<<(const V& value) {
+    if (!ok_) {
+      ss_ << " " << value;
+    }
+    return *this;
+  }
+};
+
+#define ASSERT_TRUE(c) ::leveldb::test::Tester(__FILE__, __LINE__).Is((c), #c)
+#define ASSERT_OK(s) ::leveldb::test::Tester(__FILE__, __LINE__).IsOk((s))
+#define ASSERT_EQ(a,b) ::leveldb::test::Tester(__FILE__, __LINE__).IsEq((a),(b))
+#define ASSERT_NE(a,b) ::leveldb::test::Tester(__FILE__, __LINE__).IsNe((a),(b))
+#define ASSERT_GE(a,b) ::leveldb::test::Tester(__FILE__, __LINE__).IsGe((a),(b))
+#define ASSERT_GT(a,b) ::leveldb::test::Tester(__FILE__, __LINE__).IsGt((a),(b))
+#define ASSERT_LE(a,b) ::leveldb::test::Tester(__FILE__, __LINE__).IsLe((a),(b))
+#define ASSERT_LT(a,b) ::leveldb::test::Tester(__FILE__, __LINE__).IsLt((a),(b))
+
+#define TCONCAT(a,b) TCONCAT1(a,b)
+#define TCONCAT1(a,b) a##b
+
+#define TEST(base,name)                                                 \
+class TCONCAT(_Test_,name) : public base {                              \
+ public:                                                                \
+  void _Run();                                                          \
+  static void _RunIt() {                                                \
+    TCONCAT(_Test_,name) t;                                             \
+    t._Run();                                                           \
+  }                                                                     \
+};                                                                      \
+bool TCONCAT(_Test_ignored_,name) =                                     \
+  ::leveldb::test::RegisterTest(#base, #name, &TCONCAT(_Test_,name)::_RunIt); \
+void TCONCAT(_Test_,name)::_Run()
+
+// Register the specified test.  Typically not used directly, but
+// invoked via the macro expansion of TEST.
+extern bool RegisterTest(const char* base, const char* name, void (*func)());
+
+
+}  // namespace test
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_UTIL_TESTHARNESS_H_
diff --git a/depend/zcash/src/leveldb/util/testutil.cc b/depend/zcash/src/leveldb/util/testutil.cc
new file mode 100644
index 000000000..bee56bf75
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/testutil.cc
@@ -0,0 +1,51 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#include "util/testutil.h"
+
+#include "util/random.h"
+
+namespace leveldb {
+namespace test {
+
+Slice RandomString(Random* rnd, int len, std::string* dst) {
+  dst->resize(len);
+  for (int i = 0; i < len; i++) {
+    (*dst)[i] = static_cast<char>(' ' + rnd->Uniform(95));   // ' ' .. '~'
+  }
+  return Slice(*dst);
+}
+
+std::string RandomKey(Random* rnd, int len) {
+  // Make sure to generate a wide variety of characters so we
+  // test the boundary conditions for short-key optimizations.
+  static const char kTestChars[] = {
+    '\0', '\1', 'a', 'b', 'c', 'd', 'e', '\xfd', '\xfe', '\xff'
+  };
+  std::string result;
+  for (int i = 0; i < len; i++) {
+    result += kTestChars[rnd->Uniform(sizeof(kTestChars))];
+  }
+  return result;
+}
+
+
+extern Slice CompressibleString(Random* rnd, double compressed_fraction,
+                                size_t len, std::string* dst) {
+  int raw = static_cast<int>(len * compressed_fraction);
+  if (raw < 1) raw = 1;
+  std::string raw_data;
+  RandomString(rnd, raw, &raw_data);
+
+  // Duplicate the random data until we have filled "len" bytes
+  dst->clear();
+  while (dst->size() < len) {
+    dst->append(raw_data);
+  }
+  dst->resize(len);
+  return Slice(*dst);
+}
+
+}  // namespace test
+}  // namespace leveldb
diff --git a/depend/zcash/src/leveldb/util/testutil.h b/depend/zcash/src/leveldb/util/testutil.h
new file mode 100644
index 000000000..d7e458370
--- /dev/null
+++ b/depend/zcash/src/leveldb/util/testutil.h
@@ -0,0 +1,63 @@
+// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file. See the AUTHORS file for names of contributors.
+
+#ifndef STORAGE_LEVELDB_UTIL_TESTUTIL_H_
+#define STORAGE_LEVELDB_UTIL_TESTUTIL_H_
+
+#include "leveldb/env.h"
+#include "leveldb/slice.h"
+#include "util/random.h"
+
+namespace leveldb {
+namespace test {
+
+// Store in *dst a random string of length "len" and return a Slice that
+// references the generated data.
+extern Slice RandomString(Random* rnd, int len, std::string* dst);
+
+// Return a random key with the specified length that may contain interesting
+// characters (e.g. \x00, \xff, etc.).
+extern std::string RandomKey(Random* rnd, int len);
+
+// Store in *dst a string of length "len" that will compress to
+// "N*compressed_fraction" bytes and return a Slice that references
+// the generated data.
+extern Slice CompressibleString(Random* rnd, double compressed_fraction,
+                                size_t len, std::string* dst);
+
+// A wrapper that allows injection of errors.
+class ErrorEnv : public EnvWrapper {
+ public:
+  bool writable_file_error_;
+  int num_writable_file_errors_;
+
+  ErrorEnv() : EnvWrapper(Env::Default()),
+               writable_file_error_(false),
+               num_writable_file_errors_(0) { }
+
+  virtual Status NewWritableFile(const std::string& fname,
+                                 WritableFile** result) {
+    if (writable_file_error_) {
+      ++num_writable_file_errors_;
+      *result = NULL;
+      return Status::IOError(fname, "fake error");
+    }
+    return target()->NewWritableFile(fname, result);
+  }
+
+  virtual Status NewAppendableFile(const std::string& fname,
+                                   WritableFile** result) {
+    if (writable_file_error_) {
+      ++num_writable_file_errors_;
+      *result = NULL;
+      return Status::IOError(fname, "fake error");
+    }
+    return target()->NewAppendableFile(fname, result);
+  }
+};
+
+}  // namespace test
+}  // namespace leveldb
+
+#endif  // STORAGE_LEVELDB_UTIL_TESTUTIL_H_
diff --git a/depend/zcash/src/limitedmap.h b/depend/zcash/src/limitedmap.h
new file mode 100644
index 000000000..f0104bc9d
--- /dev/null
+++ b/depend/zcash/src/limitedmap.h
@@ -0,0 +1,97 @@
+// Copyright (c) 2012-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_LIMITEDMAP_H
+#define BITCOIN_LIMITEDMAP_H
+
+#include <assert.h>
+#include <map>
+
+/** STL-like map container that only keeps the N elements with the highest value. */
+template <typename K, typename V>
+class limitedmap
+{
+public:
+    typedef K key_type;
+    typedef V mapped_type;
+    typedef std::pair<const key_type, mapped_type> value_type;
+    typedef typename std::map<K, V>::const_iterator const_iterator;
+    typedef typename std::map<K, V>::size_type size_type;
+
+protected:
+    std::map<K, V> map;
+    typedef typename std::map<K, V>::iterator iterator;
+    std::multimap<V, iterator> rmap;
+    typedef typename std::multimap<V, iterator>::iterator rmap_iterator;
+    size_type nMaxSize;
+
+public:
+    limitedmap(size_type nMaxSizeIn)
+    {
+        assert(nMaxSizeIn > 0);
+        nMaxSize = nMaxSizeIn;
+    }
+    const_iterator begin() const { return map.begin(); }
+    const_iterator end() const { return map.end(); }
+    size_type size() const { return map.size(); }
+    bool empty() const { return map.empty(); }
+    const_iterator find(const key_type& k) const { return map.find(k); }
+    size_type count(const key_type& k) const { return map.count(k); }
+    void insert(const value_type& x)
+    {
+        std::pair<iterator, bool> ret = map.insert(x);
+        if (ret.second) {
+            if (map.size() > nMaxSize) {
+                map.erase(rmap.begin()->second);
+                rmap.erase(rmap.begin());
+            }
+            rmap.insert(make_pair(x.second, ret.first));
+        }
+    }
+    void erase(const key_type& k)
+    {
+        iterator itTarget = map.find(k);
+        if (itTarget == map.end())
+            return;
+        std::pair<rmap_iterator, rmap_iterator> itPair = rmap.equal_range(itTarget->second);
+        for (rmap_iterator it = itPair.first; it != itPair.second; ++it)
+            if (it->second == itTarget) {
+                rmap.erase(it);
+                map.erase(itTarget);
+                return;
+            }
+        // Shouldn't ever get here
+        assert(0);
+    }
+    void update(const_iterator itIn, const mapped_type& v)
+    {
+        // TODO: When we switch to C++11, use map.erase(itIn, itIn) to get the non-const iterator.
+        iterator itTarget = map.find(itIn->first);
+        if (itTarget == map.end())
+            return;
+        std::pair<rmap_iterator, rmap_iterator> itPair = rmap.equal_range(itTarget->second);
+        for (rmap_iterator it = itPair.first; it != itPair.second; ++it)
+            if (it->second == itTarget) {
+                rmap.erase(it);
+                itTarget->second = v;
+                rmap.insert(make_pair(v, itTarget));
+                return;
+            }
+        // Shouldn't ever get here
+        assert(0);
+    }
+    size_type max_size() const { return nMaxSize; }
+    size_type max_size(size_type s)
+    {
+        assert(s > 0);
+        while (map.size() > s) {
+            map.erase(rmap.begin()->second);
+            rmap.erase(rmap.begin());
+        }
+        nMaxSize = s;
+        return nMaxSize;
+    }
+};
+
+#endif // BITCOIN_LIMITEDMAP_H
diff --git a/depend/zcash/src/logging.cpp b/depend/zcash/src/logging.cpp
new file mode 100644
index 000000000..039f19733
--- /dev/null
+++ b/depend/zcash/src/logging.cpp
@@ -0,0 +1,149 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2018 The Bitcoin Core developers
+// Copyright (c) 2018-2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "logging.h"
+
+#include "fs.h"
+#include "serialize.h"
+#include "util.h"
+
+#include <set>
+
+#include <boost/thread/mutex.hpp>
+#include <boost/thread/once.hpp>
+#include <boost/thread/tss.hpp>
+
+using namespace std;
+
+const char * const DEFAULT_DEBUGLOGFILE = "debug.log";
+
+bool fPrintToConsole = false;
+bool fPrintToDebugLog = true;
+
+bool fLogTimestamps = DEFAULT_LOGTIMESTAMPS;
+bool fLogTimeMicros = DEFAULT_LOGTIMEMICROS;
+bool fLogIPs = DEFAULT_LOGIPS;
+std::atomic<bool> fReopenDebugLog(false);
+
+/**
+ * LogPrintf() has been broken a couple of times now
+ * by well-meaning people adding mutexes in the most straightforward way.
+ * It breaks because it may be called by global destructors during shutdown.
+ * Since the order of destruction of static/global objects is undefined,
+ * defining a mutex as a global object doesn't work (the mutex gets
+ * destroyed, and then some later destructor calls OutputDebugStringF,
+ * maybe indirectly, and you get a core dump at shutdown trying to lock
+ * the mutex).
+ */
+
+static boost::once_flag debugPrintInitFlag = BOOST_ONCE_INIT;
+
+/**
+ * We use boost::call_once() to make sure mutexDebugLog and
+ * vMsgsBeforeOpenLog are initialized in a thread-safe manner.
+ *
+ * NOTE: fileout, mutexDebugLog and sometimes vMsgsBeforeOpenLog
+ * are leaked on exit. This is ugly, but will be cleaned up by
+ * the OS/libc. When the shutdown sequence is fully audited and
+ * tested, explicit destruction of these objects can be implemented.
+ */
+static FILE* fileout = NULL;
+static boost::mutex* mutexDebugLog = NULL;
+static list<string> *vMsgsBeforeOpenLog;
+
+static int FileWriteStr(const std::string &str, FILE *fp)
+{
+    return fwrite(str.data(), 1, str.size(), fp);
+}
+
+static void DebugPrintInit()
+{
+    assert(mutexDebugLog == NULL);
+    mutexDebugLog = new boost::mutex();
+    vMsgsBeforeOpenLog = new list<string>;
+}
+
+fs::path GetDebugLogPath()
+{
+    fs::path logfile(GetArg("-debuglogfile", DEFAULT_DEBUGLOGFILE));
+    if (logfile.is_absolute()) {
+        return logfile;
+    } else {
+        return GetDataDir() / logfile;
+    }
+}
+
+std::string LogConfigFilter()
+{
+    // With no -debug flags, show errors and LogPrintf lines.
+    std::string filter = "error,main=info";
+
+    auto& categories = mapMultiArgs["-debug"];
+    std::set<std::string> setCategories(categories.begin(), categories.end());
+    if (setCategories.count(string("")) != 0 || setCategories.count(string("1")) != 0) {
+        // Turn on the firehose!
+        filter = "debug";
+    } else {
+        for (auto category : setCategories) {
+            filter += "," + category + "=debug";
+        }
+    }
+
+    return filter;
+}
+
+bool LogAcceptCategory(const char* category)
+{
+    if (category != NULL)
+    {
+        if (!fDebug)
+            return false;
+
+        // Give each thread quick access to -debug settings.
+        // This helps prevent issues debugging global destructors,
+        // where mapMultiArgs might be deleted before another
+        // global destructor calls LogPrint()
+        static boost::thread_specific_ptr<set<string> > ptrCategory;
+        if (ptrCategory.get() == NULL)
+        {
+            const vector<string>& categories = mapMultiArgs["-debug"];
+            ptrCategory.reset(new set<string>(categories.begin(), categories.end()));
+            // thread_specific_ptr automatically deletes the set when the thread ends.
+        }
+        const set<string>& setCategories = *ptrCategory.get();
+
+        // if not debugging everything and not debugging specific category, LogPrint does nothing.
+        if (setCategories.count(string("")) == 0 &&
+            setCategories.count(string("1")) == 0 &&
+            setCategories.count(string(category)) == 0)
+            return false;
+    }
+    return true;
+}
+
+void ShrinkDebugFile()
+{
+    // Scroll debug.log if it's getting too big
+    fs::path pathLog = GetDebugLogPath();
+    FILE* file = fsbridge::fopen(pathLog, "r");
+    if (file && fs::file_size(pathLog) > 10 * 1000000)
+    {
+        // Restart the file with some of the end
+        std::vector <char> vch(200000,0);
+        fseek(file, -((long)vch.size()), SEEK_END);
+        int nBytes = fread(begin_ptr(vch), 1, vch.size(), file);
+        fclose(file);
+
+        file = fsbridge::fopen(pathLog, "w");
+        if (file)
+        {
+            fwrite(begin_ptr(vch), 1, nBytes, file);
+            fclose(file);
+        }
+    }
+    else if (file != NULL)
+        fclose(file);
+}
diff --git a/depend/zcash/src/logging.h b/depend/zcash/src/logging.h
new file mode 100644
index 000000000..138d26060
--- /dev/null
+++ b/depend/zcash/src/logging.h
@@ -0,0 +1,59 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2018 The Bitcoin Core developers
+// Copyright (c) 2018-2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_LOGGING_H
+#define ZCASH_LOGGING_H
+
+#include "fs.h"
+#include "tinyformat.h"
+
+#include <atomic>
+#include <string>
+
+#include <tracing.h>
+
+static const bool DEFAULT_LOGTIMEMICROS = false;
+static const bool DEFAULT_LOGIPS        = false;
+static const bool DEFAULT_LOGTIMESTAMPS = true;
+extern const char * const DEFAULT_DEBUGLOGFILE;
+
+extern bool fPrintToConsole;
+extern bool fPrintToDebugLog;
+
+extern bool fLogTimestamps;
+extern bool fLogIPs;
+extern std::atomic<bool> fReopenDebugLog;
+
+/** Returns the filtering directive set by the -debug flags. */
+std::string LogConfigFilter();
+
+/** Return true if log accepts specified category */
+bool LogAcceptCategory(const char* category);
+
+/** Print to debug.log with level INFO and category "main". */
+#define LogPrintf(...) LogPrintInner("info", "main", __VA_ARGS__)
+
+/** Print to debug.log with level DEBUG. */
+#define LogPrint(category, ...) LogPrintInner("debug", category, __VA_ARGS__)
+
+#define LogPrintInner(level, category, ...) do {           \
+    std::string T_MSG = tfm::format(__VA_ARGS__);          \
+    if (!T_MSG.empty() && T_MSG[T_MSG.size()-1] == '\n') { \
+        T_MSG.erase(T_MSG.size()-1);                       \
+    }                                                      \
+    TracingLog(level, category, T_MSG.c_str());            \
+} while(0)
+
+#define LogError(category, ...) ([&]() {          \
+    std::string T_MSG = tfm::format(__VA_ARGS__); \
+    TracingError(category, T_MSG.c_str());        \
+    return false;                                 \
+}())
+
+fs::path GetDebugLogPath();
+void ShrinkDebugFile();
+
+#endif // ZCASH_LOGGING_H
diff --git a/depend/zcash/src/main.cpp b/depend/zcash/src/main.cpp
new file mode 100644
index 000000000..8fb8ea6f7
--- /dev/null
+++ b/depend/zcash/src/main.cpp
@@ -0,0 +1,7891 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Copyright (c) 2015-2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "main.h"
+
+#include "addrman.h"
+#include "alert.h"
+#include "arith_uint256.h"
+#include "chainparams.h"
+#include "checkpoints.h"
+#include "checkqueue.h"
+#include "consensus/consensus.h"
+#include "consensus/funding.h"
+#include "consensus/upgrades.h"
+#include "consensus/validation.h"
+#include "deprecation.h"
+#include "experimental_features.h"
+#include "init.h"
+#include "key_io.h"
+#include "merkleblock.h"
+#include "metrics.h"
+#include "net.h"
+#include "policy/policy.h"
+#include "pow.h"
+#include "reverse_iterator.h"
+#include "txmempool.h"
+#include "ui_interface.h"
+#include "undo.h"
+#include "util.h"
+#include "utilmoneystr.h"
+#include "validationinterface.h"
+#include "wallet/asyncrpcoperation_sendmany.h"
+#include "wallet/asyncrpcoperation_shieldcoinbase.h"
+#include "warnings.h"
+
+#include <algorithm>
+#include <atomic>
+#include <sstream>
+#include <variant>
+
+#include <boost/algorithm/string/replace.hpp>
+#include <boost/math/distributions/poisson.hpp>
+#include <boost/thread.hpp>
+
+#include <rust/ed25519.h>
+#include <rust/metrics.h>
+
+using namespace std;
+
+#if defined(NDEBUG)
+# error "Zcash cannot be compiled without assertions."
+#endif
+
+#include "librustzcash.h"
+
+/**
+ * Global state
+ */
+
+CCriticalSection cs_main;
+
+BlockMap mapBlockIndex;
+CChain chainActive;
+CBlockIndex *pindexBestHeader = NULL;
+static std::atomic<int64_t> nTimeBestReceived(0); // Used only to inform the wallet of when we last received a block
+CWaitableCriticalSection g_best_block_mutex;
+CConditionVariable g_best_block_cv;
+uint256 g_best_block;
+int g_best_block_height;
+int nScriptCheckThreads = 0;
+std::atomic_bool fImporting(false);
+std::atomic_bool fReindex(false);
+bool fTxIndex = false;
+bool fAddressIndex = false;     // insightexplorer || lightwalletd
+bool fSpentIndex = false;       // insightexplorer
+bool fTimestampIndex = false;   // insightexplorer
+bool fHavePruned = false;
+bool fPruneMode = false;
+bool fIsBareMultisigStd = DEFAULT_PERMIT_BAREMULTISIG;
+bool fCheckBlockIndex = false;
+bool fCheckpointsEnabled = DEFAULT_CHECKPOINTS_ENABLED;
+bool fIBDSkipTxVerification = DEFAULT_IBD_SKIP_TX_VERIFICATION;
+bool fCoinbaseEnforcedShieldingEnabled = true;
+size_t nCoinCacheUsage = 5000 * 300;
+uint64_t nPruneTarget = 0;
+bool fAlerts = DEFAULT_ALERTS;
+int64_t nMaxTipAge = DEFAULT_MAX_TIP_AGE;
+
+std::optional<unsigned int> expiryDeltaArg = std::nullopt;
+
+
+CFeeRate minRelayTxFee = CFeeRate(DEFAULT_MIN_RELAY_TX_FEE);
+CAmount maxTxFee = DEFAULT_TRANSACTION_MAXFEE;
+
+CTxMemPool mempool(::minRelayTxFee);
+
+struct COrphanTx {
+    CTransaction tx;
+    NodeId fromPeer;
+};
+map<uint256, COrphanTx> mapOrphanTransactions GUARDED_BY(cs_main);;
+map<uint256, set<uint256> > mapOrphanTransactionsByPrev GUARDED_BY(cs_main);;
+void EraseOrphansFor(NodeId peer) EXCLUSIVE_LOCKS_REQUIRED(cs_main);
+
+/**
+ * Returns true if there are nRequired or more blocks of minVersion or above
+ * in the last Consensus::Params::nMajorityWindow blocks, starting at pstart and going backwards.
+ */
+static bool IsSuperMajority(int minVersion, const CBlockIndex* pstart, unsigned nRequired, const Consensus::Params& consensusParams);
+static void CheckBlockIndex(const Consensus::Params& consensusParams);
+
+/** Constant stuff for coinbase transactions we create: */
+CScript COINBASE_FLAGS;
+
+const string strMessageMagic = "Zcash Signed Message:\n";
+
+// Internal stuff
+namespace {
+
+    unsigned char ShieldedReqRejectCode(UnsatisfiedShieldedReq shieldedReq)
+    {
+        switch (shieldedReq) {
+            case UnsatisfiedShieldedReq::SproutDuplicateNullifier:
+            case UnsatisfiedShieldedReq::SaplingDuplicateNullifier:
+            case UnsatisfiedShieldedReq::OrchardDuplicateNullifier:
+                return REJECT_DUPLICATE;
+            case UnsatisfiedShieldedReq::SproutUnknownAnchor:
+            case UnsatisfiedShieldedReq::SaplingUnknownAnchor:
+            case UnsatisfiedShieldedReq::OrchardUnknownAnchor:
+                return REJECT_INVALID;
+        }
+    }
+
+    std::string ShieldedReqRejectReason(UnsatisfiedShieldedReq shieldedReq)
+    {
+        switch (shieldedReq) {
+            case UnsatisfiedShieldedReq::SproutDuplicateNullifier:  return "bad-txns-sprout-duplicate-nullifier";
+            case UnsatisfiedShieldedReq::SproutUnknownAnchor:       return "bad-txns-sprout-unknown-anchor";
+            case UnsatisfiedShieldedReq::SaplingDuplicateNullifier: return "bad-txns-sapling-duplicate-nullifier";
+            case UnsatisfiedShieldedReq::SaplingUnknownAnchor:      return "bad-txns-sapling-unknown-anchor";
+            case UnsatisfiedShieldedReq::OrchardDuplicateNullifier: return "bad-txns-orchard-duplicate-nullifier";
+            case UnsatisfiedShieldedReq::OrchardUnknownAnchor:      return "bad-txns-orchard-unknown-anchor";
+        }
+    }
+
+    /** Abort with a message */
+    bool AbortNode(const std::string& strMessage, const std::string& userMessage="")
+    {
+        SetMiscWarning(strMessage, GetTime());
+        LogError("main", "*** %s\n", strMessage);
+        uiInterface.ThreadSafeMessageBox(
+            userMessage.empty() ? _("Error: A fatal internal error occurred, see debug.log for details") : userMessage,
+            "", CClientUIInterface::MSG_ERROR);
+        StartShutdown();
+        return false;
+    }
+
+    bool AbortNode(CValidationState& state, const std::string& strMessage, const std::string& userMessage="")
+    {
+        AbortNode(strMessage, userMessage);
+        return state.Error(strMessage);
+    }
+
+    struct CBlockIndexWorkComparator
+    {
+        bool operator()(CBlockIndex *pa, CBlockIndex *pb) const {
+            // First sort by most total work, ...
+            if (pa->nChainWork > pb->nChainWork) return false;
+            if (pa->nChainWork < pb->nChainWork) return true;
+
+            // ... then by earliest time received, ...
+            if (pa->nSequenceId < pb->nSequenceId) return false;
+            if (pa->nSequenceId > pb->nSequenceId) return true;
+
+            // Use pointer address as tie breaker (should only happen with blocks
+            // loaded from disk, as those all have id 0).
+            if (pa < pb) return false;
+            if (pa > pb) return true;
+
+            // Identical blocks.
+            return false;
+        }
+    };
+
+    CBlockIndex *pindexBestInvalid;
+
+    /**
+     * The set of all CBlockIndex entries with BLOCK_VALID_TRANSACTIONS (for itself and all ancestors) and
+     * as good as our current tip or better. Entries may be failed, though, and pruning nodes may be
+     * missing the data for the block.
+     */
+    set<CBlockIndex*, CBlockIndexWorkComparator> setBlockIndexCandidates;
+    /** Number of nodes with fSyncStarted. */
+    int nSyncStarted = 0;
+    /** All pairs A->B, where A (or one if its ancestors) misses transactions, but B has transactions.
+      * Pruned nodes may have entries where B is missing data.
+      */
+    multimap<CBlockIndex*, CBlockIndex*> mapBlocksUnlinked;
+
+    CCriticalSection cs_LastBlockFile;
+    std::vector<CBlockFileInfo> vinfoBlockFile;
+    int nLastBlockFile = 0;
+    /** Global flag to indicate we should check to see if there are
+     *  block/undo files that should be deleted.  Set on startup
+     *  or if we allocate more file space when we're in prune mode
+     */
+    bool fCheckForPruning = false;
+
+    /**
+     * Every received block is assigned a unique and increasing identifier, so we
+     * know which one to give priority in case of a fork.
+     */
+    CCriticalSection cs_nBlockSequenceId;
+    /** Blocks loaded from disk are assigned id 0, so start the counter at 1. */
+    uint32_t nBlockSequenceId = 1;
+
+    /**
+     * Sources of received blocks, saved to be able to send them reject
+     * messages or ban them when processing happens afterwards. Protected by
+     * cs_main.
+     */
+    map<uint256, NodeId> mapBlockSource;
+
+    /**
+     * Filter for transactions that were recently rejected by
+     * AcceptToMemoryPool. These are not rerequested until the chain tip
+     * changes, at which point the entire filter is reset. Protected by
+     * cs_main.
+     *
+     * Without this filter we'd be re-requesting txs from each of our peers,
+     * increasing bandwidth consumption considerably. For instance, with 100
+     * peers, half of which relay a tx we don't accept, that might be a 50x
+     * bandwidth increase. A flooding attacker attempting to roll-over the
+     * filter using minimum-sized, 60byte, transactions might manage to send
+     * 1000/sec if we have fast peers, so we pick 120,000 to give our peers a
+     * two minute window to send invs to us.
+     *
+     * Decreasing the false positive rate is fairly cheap, so we pick one in a
+     * million to make it highly unlikely for users to have issues with this
+     * filter.
+     *
+     * We only need to add wtxids to this filter. For pre-v5 transactions, the
+     * txid commits to the entire transaction, and the wtxid is the txid with a
+     * globally-fixed (all-ones) suffix. For v5+ transactions, the wtxid commits
+     * to the entire transaction.
+     *
+     * Memory used: 1.3 MB
+     */
+    boost::scoped_ptr<CRollingBloomFilter> recentRejects;
+    uint256 hashRecentRejectsChainTip;
+
+    /** Blocks that are in flight, and that are in the queue to be downloaded. Protected by cs_main. */
+    struct QueuedBlock {
+        uint256 hash;
+        CBlockIndex* pindex;     //!< Optional.
+        int64_t nTime;           //!< Time of "getdata" request in microseconds.
+        bool fValidatedHeaders;  //!< Whether this block has validated headers at the time of request.
+        int64_t nTimeDisconnect; //!< The timeout for this block request (for disconnecting a slow peer)
+    };
+    map<uint256, pair<NodeId, list<QueuedBlock>::iterator> > mapBlocksInFlight;
+
+    /** Number of blocks in flight with validated headers. */
+    int nQueuedValidatedHeaders = 0;
+
+    /** Number of preferable block download peers. */
+    int nPreferredDownload = 0;
+
+    /** Dirty block index entries. */
+    set<CBlockIndex*> setDirtyBlockIndex;
+
+    /** Dirty block file entries. */
+    set<int> setDirtyFileInfo;
+
+    /** Relay map, protected by cs_main. */
+    typedef std::map<uint256, std::shared_ptr<const CTransaction>> MapRelay;
+    MapRelay mapRelay;
+    /** Expiration-time ordered list of (expire time, relay map entry) pairs, protected by cs_main). */
+    std::deque<std::pair<int64_t, MapRelay::iterator>> vRelayExpiration;
+} // anon namespace
+
+//////////////////////////////////////////////////////////////////////////////
+//
+// Registration of network node signals.
+//
+
+namespace {
+
+struct CBlockReject {
+    unsigned char chRejectCode;
+    string strRejectReason;
+    uint256 hashBlock;
+};
+
+/**
+ * Maintain validation-specific state about nodes, protected by cs_main, instead
+ * by CNode's own locks. This simplifies asynchronous operation, where
+ * processing of incoming data is done after the ProcessMessage call returns,
+ * and we're no longer holding the node's locks.
+ */
+struct CNodeState {
+    //! The peer's address
+    CService address;
+    //! Whether we have a fully established connection.
+    bool fCurrentlyConnected;
+    //! Accumulated misbehaviour score for this peer.
+    int nMisbehavior;
+    //! Whether this peer should be disconnected and banned (unless whitelisted).
+    bool fShouldBan;
+    //! String name of this peer (debugging/logging purposes).
+    std::string name;
+    //! List of asynchronously-determined block rejections to notify this peer about.
+    std::vector<CBlockReject> rejects;
+    //! The best known block we know this peer has announced.
+    CBlockIndex *pindexBestKnownBlock;
+    //! The hash of the last unknown block this peer has announced.
+    uint256 hashLastUnknownBlock;
+    //! The last full block we both have.
+    CBlockIndex *pindexLastCommonBlock;
+    //! Whether we've started headers synchronization with this peer.
+    bool fSyncStarted;
+    //! Since when we're stalling block download progress (in microseconds), or 0.
+    int64_t nStallingSince;
+    list<QueuedBlock> vBlocksInFlight;
+    int nBlocksInFlight;
+    int nBlocksInFlightValidHeaders;
+    //! Whether we consider this a preferred download peer.
+    bool fPreferredDownload;
+
+    CNodeState() {
+        fCurrentlyConnected = false;
+        nMisbehavior = 0;
+        fShouldBan = false;
+        pindexBestKnownBlock = NULL;
+        hashLastUnknownBlock.SetNull();
+        pindexLastCommonBlock = NULL;
+        fSyncStarted = false;
+        nStallingSince = 0;
+        nBlocksInFlight = 0;
+        nBlocksInFlightValidHeaders = 0;
+        fPreferredDownload = false;
+    }
+};
+
+/** Map maintaining per-node state. Requires cs_main. */
+map<NodeId, CNodeState> mapNodeState;
+
+// Requires cs_main.
+CNodeState *State(NodeId pnode) {
+    map<NodeId, CNodeState>::iterator it = mapNodeState.find(pnode);
+    if (it == mapNodeState.end())
+        return NULL;
+    return &it->second;
+}
+
+int GetHeight()
+{
+    LOCK(cs_main);
+    return chainActive.Height();
+}
+
+void UpdatePreferredDownload(CNode* node, CNodeState* state)
+{
+    nPreferredDownload -= state->fPreferredDownload;
+
+    // Whether this node should be marked as a preferred download node.
+    state->fPreferredDownload = (!node->fInbound || node->fWhitelisted) && !node->fOneShot && !node->fClient;
+
+    nPreferredDownload += state->fPreferredDownload;
+}
+
+// Returns time at which to timeout block request (nTime in microseconds)
+int64_t GetBlockTimeout(int64_t nTime, int nValidatedQueuedBefore, const Consensus::Params &consensusParams, int nHeight)
+{
+    return nTime + 500000 * consensusParams.PoWTargetSpacing(nHeight) * (4 + nValidatedQueuedBefore);
+}
+
+void InitializeNode(NodeId nodeid, const CNode *pnode) {
+    LOCK(cs_main);
+    CNodeState &state = mapNodeState.insert(std::make_pair(nodeid, CNodeState())).first->second;
+    state.name = pnode->GetAddrName();
+    state.address = pnode->addr;
+}
+
+void FinalizeNode(NodeId nodeid) {
+    LOCK(cs_main);
+    CNodeState *state = State(nodeid);
+
+    if (state->fSyncStarted)
+        nSyncStarted--;
+
+    if (state->nMisbehavior == 0 && state->fCurrentlyConnected) {
+        AddressCurrentlyConnected(state->address);
+    }
+
+    for (const QueuedBlock& entry : state->vBlocksInFlight)
+        mapBlocksInFlight.erase(entry.hash);
+    EraseOrphansFor(nodeid);
+    nPreferredDownload -= state->fPreferredDownload;
+
+    mapNodeState.erase(nodeid);
+}
+
+// Requires cs_main.
+// Returns a bool indicating whether we requested this block.
+bool MarkBlockAsReceived(const uint256& hash) {
+    map<uint256, pair<NodeId, list<QueuedBlock>::iterator> >::iterator itInFlight = mapBlocksInFlight.find(hash);
+    if (itInFlight != mapBlocksInFlight.end()) {
+        CNodeState *state = State(itInFlight->second.first);
+        nQueuedValidatedHeaders -= itInFlight->second.second->fValidatedHeaders;
+        state->nBlocksInFlightValidHeaders -= itInFlight->second.second->fValidatedHeaders;
+        state->vBlocksInFlight.erase(itInFlight->second.second);
+        state->nBlocksInFlight--;
+        state->nStallingSince = 0;
+        mapBlocksInFlight.erase(itInFlight);
+        return true;
+    }
+    return false;
+}
+
+// Requires cs_main.
+void MarkBlockAsInFlight(NodeId nodeid, const uint256& hash, const Consensus::Params& consensusParams, CBlockIndex *pindex = NULL) {
+    CNodeState *state = State(nodeid);
+    assert(state != NULL);
+
+    // Make sure it's not listed somewhere already.
+    MarkBlockAsReceived(hash);
+
+    int64_t nNow = GetTimeMicros();
+    int nHeight = pindex != NULL ? pindex->nHeight : chainActive.Height(); // Help block timeout computation
+    QueuedBlock newentry = {hash, pindex, nNow, pindex != NULL, GetBlockTimeout(nNow, nQueuedValidatedHeaders, consensusParams, nHeight)};
+    nQueuedValidatedHeaders += newentry.fValidatedHeaders;
+    list<QueuedBlock>::iterator it = state->vBlocksInFlight.insert(state->vBlocksInFlight.end(), newentry);
+    state->nBlocksInFlight++;
+    state->nBlocksInFlightValidHeaders += newentry.fValidatedHeaders;
+    mapBlocksInFlight[hash] = std::make_pair(nodeid, it);
+}
+
+/** Check whether the last unknown block a peer advertized is not yet known. */
+void ProcessBlockAvailability(NodeId nodeid) {
+    CNodeState *state = State(nodeid);
+    assert(state != NULL);
+
+    if (!state->hashLastUnknownBlock.IsNull()) {
+        BlockMap::iterator itOld = mapBlockIndex.find(state->hashLastUnknownBlock);
+        if (itOld != mapBlockIndex.end() && itOld->second->nChainWork > 0) {
+            if (state->pindexBestKnownBlock == NULL || itOld->second->nChainWork >= state->pindexBestKnownBlock->nChainWork)
+                state->pindexBestKnownBlock = itOld->second;
+            state->hashLastUnknownBlock.SetNull();
+        }
+    }
+}
+
+/** Update tracking information about which blocks a peer is assumed to have. */
+void UpdateBlockAvailability(NodeId nodeid, const uint256 &hash) {
+    CNodeState *state = State(nodeid);
+    assert(state != NULL);
+
+    ProcessBlockAvailability(nodeid);
+
+    BlockMap::iterator it = mapBlockIndex.find(hash);
+    if (it != mapBlockIndex.end() && it->second->nChainWork > 0) {
+        // An actually better block was announced.
+        if (state->pindexBestKnownBlock == NULL || it->second->nChainWork >= state->pindexBestKnownBlock->nChainWork)
+            state->pindexBestKnownBlock = it->second;
+    } else {
+        // An unknown block was announced; just assume that the latest one is the best one.
+        state->hashLastUnknownBlock = hash;
+    }
+}
+
+/** Find the last common ancestor two blocks have.
+ *  Both pa and pb must be non-NULL. */
+CBlockIndex* LastCommonAncestor(CBlockIndex* pa, CBlockIndex* pb) {
+    if (pa->nHeight > pb->nHeight) {
+        pa = pa->GetAncestor(pb->nHeight);
+    } else if (pb->nHeight > pa->nHeight) {
+        pb = pb->GetAncestor(pa->nHeight);
+    }
+
+    while (pa != pb && pa && pb) {
+        pa = pa->pprev;
+        pb = pb->pprev;
+    }
+
+    // Eventually all chain branches meet at the genesis block.
+    assert(pa == pb);
+    return pa;
+}
+
+/** Update pindexLastCommonBlock and add not-in-flight missing successors to vBlocks, until it has
+ *  at most count entries. */
+void FindNextBlocksToDownload(NodeId nodeid, unsigned int count, std::vector<CBlockIndex*>& vBlocks, NodeId& nodeStaller) {
+    if (count == 0)
+        return;
+
+    vBlocks.reserve(vBlocks.size() + count);
+    CNodeState *state = State(nodeid);
+    assert(state != NULL);
+
+    // Make sure pindexBestKnownBlock is up to date, we'll need it.
+    ProcessBlockAvailability(nodeid);
+
+    if (state->pindexBestKnownBlock == NULL || state->pindexBestKnownBlock->nChainWork < chainActive.Tip()->nChainWork) {
+        // This peer has nothing interesting.
+        return;
+    }
+
+    if (state->pindexLastCommonBlock == NULL) {
+        // Bootstrap quickly by guessing a parent of our best tip is the forking point.
+        // Guessing wrong in either direction is not a problem.
+        state->pindexLastCommonBlock = chainActive[std::min(state->pindexBestKnownBlock->nHeight, chainActive.Height())];
+    }
+
+    // If the peer reorganized, our previous pindexLastCommonBlock may not be an ancestor
+    // of its current tip anymore. Go back enough to fix that.
+    state->pindexLastCommonBlock = LastCommonAncestor(state->pindexLastCommonBlock, state->pindexBestKnownBlock);
+    if (state->pindexLastCommonBlock == state->pindexBestKnownBlock)
+        return;
+
+    std::vector<CBlockIndex*> vToFetch;
+    CBlockIndex *pindexWalk = state->pindexLastCommonBlock;
+    // Never fetch further than the best block we know the peer has, or more than BLOCK_DOWNLOAD_WINDOW + 1 beyond the last
+    // linked block we have in common with this peer. The +1 is so we can detect stalling, namely if we would be able to
+    // download that next block if the window were 1 larger.
+    int nWindowEnd = state->pindexLastCommonBlock->nHeight + BLOCK_DOWNLOAD_WINDOW;
+    int nMaxHeight = std::min<int>(state->pindexBestKnownBlock->nHeight, nWindowEnd + 1);
+    NodeId waitingfor = -1;
+    while (pindexWalk->nHeight < nMaxHeight) {
+        // Read up to 128 (or more, if more blocks than that are needed) successors of pindexWalk (towards
+        // pindexBestKnownBlock) into vToFetch. We fetch 128, because CBlockIndex::GetAncestor may be as expensive
+        // as iterating over ~100 CBlockIndex* entries anyway.
+        int nToFetch = std::min(nMaxHeight - pindexWalk->nHeight, std::max<int>(count - vBlocks.size(), 128));
+        vToFetch.resize(nToFetch);
+        pindexWalk = state->pindexBestKnownBlock->GetAncestor(pindexWalk->nHeight + nToFetch);
+        vToFetch[nToFetch - 1] = pindexWalk;
+        for (unsigned int i = nToFetch - 1; i > 0; i--) {
+            vToFetch[i - 1] = vToFetch[i]->pprev;
+        }
+
+        // Iterate over those blocks in vToFetch (in forward direction), adding the ones that
+        // are not yet downloaded and not in flight to vBlocks. In the meantime, update
+        // pindexLastCommonBlock as long as all ancestors are already downloaded, or if it's
+        // already part of our chain (and therefore don't need it even if pruned).
+        for (CBlockIndex* pindex : vToFetch) {
+            if (!pindex->IsValid(BLOCK_VALID_TREE)) {
+                // We consider the chain that this peer is on invalid.
+                return;
+            }
+            if (pindex->nStatus & BLOCK_HAVE_DATA || chainActive.Contains(pindex)) {
+                if (pindex->nChainTx)
+                    state->pindexLastCommonBlock = pindex;
+            } else if (mapBlocksInFlight.count(pindex->GetBlockHash()) == 0) {
+                // The block is not already downloaded, and not yet in flight.
+                if (pindex->nHeight > nWindowEnd) {
+                    // We reached the end of the window.
+                    if (vBlocks.size() == 0 && waitingfor != nodeid) {
+                        // We aren't able to fetch anything, but we would be if the download window was one larger.
+                        nodeStaller = waitingfor;
+                    }
+                    return;
+                }
+                vBlocks.push_back(pindex);
+                if (vBlocks.size() == count) {
+                    return;
+                }
+            } else if (waitingfor == -1) {
+                // This is the first already-in-flight block.
+                waitingfor = mapBlocksInFlight[pindex->GetBlockHash()].first;
+            }
+        }
+    }
+}
+
+} // anon namespace
+
+bool GetNodeStateStats(NodeId nodeid, CNodeStateStats &stats) {
+    LOCK(cs_main);
+    CNodeState *state = State(nodeid);
+    if (state == NULL)
+        return false;
+    stats.nMisbehavior = state->nMisbehavior;
+    stats.nSyncHeight = state->pindexBestKnownBlock ? state->pindexBestKnownBlock->nHeight : -1;
+    stats.nCommonHeight = state->pindexLastCommonBlock ? state->pindexLastCommonBlock->nHeight : -1;
+    for (const QueuedBlock& queue : state->vBlocksInFlight) {
+        if (queue.pindex)
+            stats.vHeightInFlight.push_back(queue.pindex->nHeight);
+    }
+    return true;
+}
+
+void RegisterNodeSignals(CNodeSignals& nodeSignals)
+{
+    nodeSignals.GetHeight.connect(&GetHeight);
+    nodeSignals.ProcessMessages.connect(&ProcessMessages);
+    nodeSignals.SendMessages.connect(&SendMessages);
+    nodeSignals.InitializeNode.connect(&InitializeNode);
+    nodeSignals.FinalizeNode.connect(&FinalizeNode);
+}
+
+void UnregisterNodeSignals(CNodeSignals& nodeSignals)
+{
+    nodeSignals.GetHeight.disconnect(&GetHeight);
+    nodeSignals.ProcessMessages.disconnect(&ProcessMessages);
+    nodeSignals.SendMessages.disconnect(&SendMessages);
+    nodeSignals.InitializeNode.disconnect(&InitializeNode);
+    nodeSignals.FinalizeNode.disconnect(&FinalizeNode);
+}
+
+CBlockIndex* FindForkInGlobalIndex(const CChain& chain, const CBlockLocator& locator)
+{
+    // Find the first block the caller has in the main chain
+    for (const uint256& hash : locator.vHave) {
+        BlockMap::iterator mi = mapBlockIndex.find(hash);
+        if (mi != mapBlockIndex.end())
+        {
+            CBlockIndex* pindex = (*mi).second;
+            if (chain.Contains(pindex))
+                return pindex;
+            if (pindex->GetAncestor(chain.Height()) == chain.Tip()) {
+                return chain.Tip();
+            }
+        }
+    }
+    return chain.Genesis();
+}
+
+CCoinsViewCache *pcoinsTip = NULL;
+CBlockTreeDB *pblocktree = NULL;
+
+//////////////////////////////////////////////////////////////////////////////
+//
+// mapOrphanTransactions
+//
+
+bool AddOrphanTx(const CTransaction& tx, NodeId peer) EXCLUSIVE_LOCKS_REQUIRED(cs_main)
+{
+    // See doc/book/src/design/p2p-data-propagation.md for why mapOrphanTransactions uses
+    // txid to index transactions instead of wtxid.
+    uint256 hash = tx.GetHash();
+    if (mapOrphanTransactions.count(hash))
+        return false;
+
+    // Ignore big transactions, to avoid a
+    // send-big-orphans memory exhaustion attack. If a peer has a legitimate
+    // large transaction with a missing parent then we assume
+    // it will rebroadcast it later, after the parent transaction(s)
+    // have been mined or received.
+    // 10,000 orphans, each of which is at most 5,000 bytes big is
+    // at most 500 megabytes of orphans:
+    unsigned int sz = GetSerializeSize(tx, SER_NETWORK, tx.nVersion);
+    if (sz > 5000)
+    {
+        LogPrint("mempool", "ignoring large orphan tx (size: %u, hash: %s)\n", sz, hash.ToString());
+        return false;
+    }
+
+    mapOrphanTransactions[hash].tx = tx;
+    mapOrphanTransactions[hash].fromPeer = peer;
+    for (const CTxIn& txin : tx.vin)
+        mapOrphanTransactionsByPrev[txin.prevout.hash].insert(hash);
+
+    LogPrint("mempool", "stored orphan tx %s (mapsz %u prevsz %u)\n", hash.ToString(),
+             mapOrphanTransactions.size(), mapOrphanTransactionsByPrev.size());
+    return true;
+}
+
+void static EraseOrphanTx(uint256 hash) EXCLUSIVE_LOCKS_REQUIRED(cs_main)
+{
+    map<uint256, COrphanTx>::iterator it = mapOrphanTransactions.find(hash);
+    if (it == mapOrphanTransactions.end())
+        return;
+    for (const CTxIn& txin : it->second.tx.vin)
+    {
+        map<uint256, set<uint256> >::iterator itPrev = mapOrphanTransactionsByPrev.find(txin.prevout.hash);
+        if (itPrev == mapOrphanTransactionsByPrev.end())
+            continue;
+        itPrev->second.erase(hash);
+        if (itPrev->second.empty())
+            mapOrphanTransactionsByPrev.erase(itPrev);
+    }
+    mapOrphanTransactions.erase(it);
+}
+
+void EraseOrphansFor(NodeId peer)
+{
+    int nErased = 0;
+    map<uint256, COrphanTx>::iterator iter = mapOrphanTransactions.begin();
+    while (iter != mapOrphanTransactions.end())
+    {
+        map<uint256, COrphanTx>::iterator maybeErase = iter++; // increment to avoid iterator becoming invalid
+        if (maybeErase->second.fromPeer == peer)
+        {
+            EraseOrphanTx(maybeErase->second.tx.GetHash());
+            ++nErased;
+        }
+    }
+    if (nErased > 0) LogPrint("mempool", "Erased %d orphan tx from peer %d\n", nErased, peer);
+}
+
+
+unsigned int LimitOrphanTxSize(unsigned int nMaxOrphans) EXCLUSIVE_LOCKS_REQUIRED(cs_main)
+{
+    unsigned int nEvicted = 0;
+    while (mapOrphanTransactions.size() > nMaxOrphans)
+    {
+        // Evict a random orphan:
+        uint256 randomhash = GetRandHash();
+        map<uint256, COrphanTx>::iterator it = mapOrphanTransactions.lower_bound(randomhash);
+        if (it == mapOrphanTransactions.end())
+            it = mapOrphanTransactions.begin();
+        EraseOrphanTx(it->first);
+        ++nEvicted;
+    }
+    return nEvicted;
+}
+
+bool IsFinalTx(const CTransaction &tx, int nBlockHeight, int64_t nBlockTime)
+{
+    if (tx.nLockTime == 0)
+        return true;
+    if ((int64_t)tx.nLockTime < ((int64_t)tx.nLockTime < LOCKTIME_THRESHOLD ? (int64_t)nBlockHeight : nBlockTime))
+        return true;
+    for (const CTxIn& txin : tx.vin)
+        if (!txin.IsFinal())
+            return false;
+    return true;
+}
+
+bool IsExpiredTx(const CTransaction &tx, int nBlockHeight)
+{
+    if (tx.nExpiryHeight == 0 || tx.IsCoinBase()) {
+        return false;
+    }
+    return static_cast<uint32_t>(nBlockHeight) > tx.nExpiryHeight;
+}
+
+bool IsExpiringSoonTx(const CTransaction &tx, int nNextBlockHeight)
+{
+    return IsExpiredTx(tx, nNextBlockHeight + TX_EXPIRING_SOON_THRESHOLD);
+}
+
+bool CheckFinalTx(const CTransaction &tx, int flags)
+{
+    AssertLockHeld(cs_main);
+
+    // By convention a negative value for flags indicates that the
+    // current network-enforced consensus rules should be used. In
+    // a future soft-fork scenario that would mean checking which
+    // rules would be enforced for the next block and setting the
+    // appropriate flags. At the present time no soft-forks are
+    // scheduled, so no flags are set.
+    flags = std::max(flags, 0);
+
+    // CheckFinalTx() uses chainActive.Height()+1 to evaluate
+    // nLockTime because when IsFinalTx() is called within
+    // CBlock::AcceptBlock(), the height of the block *being*
+    // evaluated is what is used. Thus if we want to know if a
+    // transaction can be part of the *next* block, we need to call
+    // IsFinalTx() with one more than chainActive.Height().
+    const int nBlockHeight = chainActive.Height() + 1;
+
+    // Timestamps on the other hand don't get any special treatment,
+    // because we can't know what timestamp the next block will have,
+    // and there aren't timestamp applications where it matters.
+    // However this changes once median past time-locks are enforced:
+    const int64_t nBlockTime = (flags & LOCKTIME_MEDIAN_TIME_PAST)
+                             ? chainActive.Tip()->GetMedianTimePast()
+                             : GetTime();
+
+    return IsFinalTx(tx, nBlockHeight, nBlockTime);
+}
+
+unsigned int GetLegacySigOpCount(const CTransaction& tx)
+{
+    unsigned int nSigOps = 0;
+    for (const CTxIn& txin : tx.vin)
+    {
+        nSigOps += txin.scriptSig.GetSigOpCount(false);
+    }
+    for (const CTxOut& txout : tx.vout)
+    {
+        nSigOps += txout.scriptPubKey.GetSigOpCount(false);
+    }
+    return nSigOps;
+}
+
+unsigned int GetP2SHSigOpCount(const CTransaction& tx, const CCoinsViewCache& inputs)
+{
+    if (tx.IsCoinBase())
+        return 0;
+
+    unsigned int nSigOps = 0;
+    for (unsigned int i = 0; i < tx.vin.size(); i++)
+    {
+        const CTxOut &prevout = inputs.GetOutputFor(tx.vin[i]);
+        if (prevout.scriptPubKey.IsPayToScriptHash())
+            nSigOps += prevout.scriptPubKey.GetSigOpCount(tx.vin[i].scriptSig);
+    }
+    return nSigOps;
+}
+
+/**
+ * Check a transaction contextually against a set of consensus rules valid at a given block height.
+ *
+ * Notes:
+ * 1. AcceptToMemoryPool calls CheckTransaction and this function.
+ * 2. ProcessNewBlock calls AcceptBlock, which calls CheckBlock (which calls CheckTransaction)
+ *    and ContextualCheckBlock (which calls this function).
+ * 3. For consensus rules that relax restrictions (where a transaction that is invalid at
+ *    nHeight can become valid at a later height), we make the bans conditional on not
+ *    being in Initial Block Download mode.
+ * 4. The isInitBlockDownload argument is a function parameter to assist with testing.
+ */
+bool ContextualCheckTransaction(
+        const CTransaction& tx,
+        CValidationState &state,
+        const CChainParams& chainparams,
+        const int nHeight,
+        const bool isMined,
+        bool (*isInitBlockDownload)(const Consensus::Params&))
+{
+    const int DOS_LEVEL_BLOCK = 100;
+    // DoS level set to 10 to be more forgiving.
+    const int DOS_LEVEL_MEMPOOL = 10;
+
+    // For constricting rules, we don't need to account for IBD mode.
+    auto dosLevelConstricting = isMined ? DOS_LEVEL_BLOCK : DOS_LEVEL_MEMPOOL;
+    // For rules that are relaxing (or might become relaxing when a future
+    // network upgrade is implemented), we need to account for IBD mode.
+    auto dosLevelPotentiallyRelaxing = isMined ? DOS_LEVEL_BLOCK : (
+        isInitBlockDownload(chainparams.GetConsensus()) ? 0 : DOS_LEVEL_MEMPOOL);
+
+    auto consensus = chainparams.GetConsensus();
+    auto consensusBranchId = CurrentEpochBranchId(nHeight, consensus);
+
+    bool overwinterActive = consensus.NetworkUpgradeActive(nHeight, Consensus::UPGRADE_OVERWINTER);
+    bool saplingActive = consensus.NetworkUpgradeActive(nHeight, Consensus::UPGRADE_SAPLING);
+    bool beforeOverwinter = !overwinterActive;
+    bool heartwoodActive = consensus.NetworkUpgradeActive(nHeight, Consensus::UPGRADE_HEARTWOOD);
+    bool canopyActive = consensus.NetworkUpgradeActive(nHeight, Consensus::UPGRADE_CANOPY);
+    bool nu5Active = consensus.NetworkUpgradeActive(nHeight, Consensus::UPGRADE_NU5);
+    bool futureActive = consensus.NetworkUpgradeActive(nHeight, Consensus::UPGRADE_ZFUTURE);
+
+    assert(!saplingActive || overwinterActive); // Sapling cannot be active unless Overwinter is
+    assert(!heartwoodActive || saplingActive);  // Heartwood cannot be active unless Sapling is
+    assert(!canopyActive || heartwoodActive);   // Canopy cannot be active unless Heartwood is
+    assert(!nu5Active || canopyActive);         // NU5 cannot be active unless Canopy is
+    assert(!futureActive || nu5Active);         // ZFUTURE must include consensus rules for all supported network upgrades.
+
+    auto const orchard_bundle = tx.GetOrchardBundle();
+
+    // Rules that apply only to Sprout
+    if (beforeOverwinter) {
+        // Reject transactions which are intended for Overwinter and beyond
+        if (tx.fOverwintered) {
+            return state.DoS(
+                dosLevelPotentiallyRelaxing,
+                error("ContextualCheckTransaction(): overwinter is not active yet"),
+                REJECT_INVALID, "tx-overwinter-not-active");
+        }
+    }
+
+    // Rules that apply to Overwinter and later:
+    if (overwinterActive) {
+        // Reject transactions intended for Sprout
+        if (!tx.fOverwintered) {
+            return state.DoS(
+                dosLevelConstricting,
+                error("ContextualCheckTransaction(): fOverwintered flag must be set when Overwinter is active"),
+                REJECT_INVALID, "tx-overwintered-flag-not-set");
+        }
+
+        // The condition `if (tx.nVersion < OVERWINTER_MIN_TX_VERSION)`
+        // that would otherwise fire here is already performed in the
+        // noncontextual checks in CheckTransactionWithoutProofVerification
+
+        // Check that all transactions are unexpired
+        if (IsExpiredTx(tx, nHeight)) {
+            // Don't increase banscore if the transaction only just expired
+            int expiredDosLevel = IsExpiredTx(tx, nHeight - 1) ? dosLevelConstricting : 0;
+            return state.DoS(
+                    expiredDosLevel,
+                    error("ContextualCheckTransaction(): transaction is expired. Resending when caught up with the blockchain, or manually setting the zcashd txexpirydelta parameter may help."),
+                    REJECT_INVALID, "tx-overwinter-expired");
+        }
+
+        // Rules that became inactive after Sapling activation.
+        if (!saplingActive) {
+            // Reject transactions with invalid version
+            // OVERWINTER_MIN_TX_VERSION is checked against as a non-contextual check.
+            if (tx.nVersion > OVERWINTER_MAX_TX_VERSION) {
+                return state.DoS(
+                    dosLevelPotentiallyRelaxing,
+                    error("ContextualCheckTransaction(): overwinter version too high"),
+                    REJECT_INVALID, "bad-tx-overwinter-version-too-high");
+            }
+
+            // Reject transactions with non-Overwinter version group ID
+            if (tx.nVersionGroupId != OVERWINTER_VERSION_GROUP_ID) {
+                return state.DoS(
+                    dosLevelPotentiallyRelaxing,
+                    error("ContextualCheckTransaction(): invalid Overwinter tx version"),
+                    REJECT_INVALID, "bad-overwinter-tx-version-group-id");
+            }
+        }
+    }
+
+    // Rules that apply to Sapling and later:
+    if (saplingActive) {
+        // Reject transactions with invalid version
+        if (tx.nVersionGroupId == SAPLING_VERSION_GROUP_ID) {
+            if (tx.nVersion < SAPLING_MIN_TX_VERSION) {
+                return state.DoS(
+                    dosLevelConstricting,
+                    error("ContextualCheckTransaction(): Sapling version too low"),
+                    REJECT_INVALID, "bad-tx-sapling-version-too-low");
+            }
+
+            if (tx.nVersion > SAPLING_MAX_TX_VERSION) {
+                return state.DoS(
+                    dosLevelPotentiallyRelaxing,
+                    error("ContextualCheckTransaction(): Sapling version too high"),
+                    REJECT_INVALID, "bad-tx-sapling-version-too-high");
+            }
+        }
+
+        // Rules that became inactive after NU5 activation.
+        if (!nu5Active) {
+            // Reject transactions with invalid version group id
+            if (tx.nVersionGroupId != SAPLING_VERSION_GROUP_ID) {
+                return state.DoS(
+                    dosLevelPotentiallyRelaxing,
+                    error("ContextualCheckTransaction(): invalid Sapling tx version"),
+                    REJECT_INVALID, "bad-sapling-tx-version-group-id");
+            }
+        }
+    } else {
+        // Rules that apply generally before Sapling. These were
+        // previously noncontextual checks that became contextual
+        // after Sapling activation.
+
+        // Reject transactions that exceed pre-sapling size limits
+        static_assert(MAX_BLOCK_SIZE > MAX_TX_SIZE_BEFORE_SAPLING); // sanity
+        if (::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION) > MAX_TX_SIZE_BEFORE_SAPLING)
+            return state.DoS(
+                dosLevelPotentiallyRelaxing,
+                error("ContextualCheckTransaction(): size limits failed"),
+                REJECT_INVALID, "bad-txns-oversize");
+    }
+
+    // From Canopy onward, coinbase transaction must include outputs corresponding to the
+    // ZIP 207 consensus funding streams active at the current block height. To avoid
+    // double-decrypting, we detect any shielded funding streams during the Heartwood
+    // consensus check. If Canopy is not yet active, fundingStreamElements will be empty.
+    std::set<Consensus::FundingStreamElement> fundingStreamElements = Consensus::GetActiveFundingStreamElements(
+        nHeight,
+        GetBlockSubsidy(nHeight, consensus),
+        consensus);
+
+    // Rules that apply to Heartwood and later:
+    if (heartwoodActive) {
+        if (tx.IsCoinBase()) {
+            // All Sapling outputs in coinbase transactions MUST have valid note commitments
+            // when recovered using a 32-byte array of zeroes as the outgoing viewing key.
+            // https://zips.z.cash/zip-0213#specification
+            uint256 ovk;
+            for (const OutputDescription &output : tx.vShieldedOutput) {
+                auto outPlaintext = SaplingOutgoingPlaintext::decrypt(
+                    output.outCiphertext, ovk, output.cv, output.cmu, output.ephemeralKey);
+                if (!outPlaintext) {
+                    return state.DoS(
+                        DOS_LEVEL_BLOCK,
+                        error("ContextualCheckTransaction(): coinbase output description has invalid outCiphertext"),
+                        REJECT_INVALID, "bad-cb-output-desc-invalid-outct");
+                }
+
+                // SaplingNotePlaintext::decrypt() checks note commitment validity.
+                auto encPlaintext = SaplingNotePlaintext::decrypt(
+                    consensus,
+                    nHeight,
+                    output.encCiphertext,
+                    output.ephemeralKey,
+                    outPlaintext->esk,
+                    outPlaintext->pk_d,
+                    output.cmu);
+
+                if (!encPlaintext) {
+                    return state.DoS(
+                        DOS_LEVEL_BLOCK,
+                        error("ContextualCheckTransaction(): coinbase output description has invalid encCiphertext"),
+                        REJECT_INVALID, "bad-cb-output-desc-invalid-encct");
+                }
+
+                // ZIP 207: detect shielded funding stream elements
+                if (canopyActive) {
+                    libzcash::SaplingPaymentAddress zaddr(encPlaintext->d, outPlaintext->pk_d);
+                    for (auto it = fundingStreamElements.begin(); it != fundingStreamElements.end(); ++it) {
+                        const libzcash::SaplingPaymentAddress* streamAddr = std::get_if<libzcash::SaplingPaymentAddress>(&(it->first));
+                        if (streamAddr && zaddr == *streamAddr && encPlaintext->value() == it->second) {
+                            fundingStreamElements.erase(it);
+                            break;
+                        }
+                    }
+                }
+
+                // ZIP 212: after ZIP 212 any Sapling output of a coinbase tx that is
+                // decrypted to a note plaintext, MUST have note plaintext lead byte equal
+                // to 0x02. This applies even during the grace period, and also applies to
+                // funding stream outputs sent to shielded payment addresses, if any.
+                // https://zips.z.cash/zip-0212#consensus-rule-change-for-coinbase-transactions
+                auto leadByte = encPlaintext->get_leadbyte();
+                assert(leadByte == 0x01 || leadByte == 0x02);
+                if (canopyActive != (leadByte == 0x02)) {
+                    return state.DoS(
+                        DOS_LEVEL_BLOCK,
+                        error("ContextualCheckTransaction(): coinbase output description has invalid note plaintext version"),
+                        REJECT_INVALID,
+                        "bad-cb-output-desc-invalid-note-plaintext-version");
+                }
+            }
+        }
+    } else {
+        // Rules that apply generally before Heartwood. These were
+        // previously noncontextual checks that became contextual
+        // after Heartwood activation.
+
+        if (tx.IsCoinBase()) {
+            // A coinbase transaction cannot have shielded outputs
+            if (tx.vShieldedOutput.size() > 0)
+                return state.DoS(
+                    dosLevelPotentiallyRelaxing,
+                    error("ContextualCheckTransaction(): coinbase has output descriptions"),
+                    REJECT_INVALID, "bad-cb-has-output-description");
+        }
+    }
+
+    // Rules that apply to Canopy or later:
+    if (canopyActive) {
+        for (const JSDescription& joinsplit : tx.vJoinSplit) {
+            if (joinsplit.vpub_old > 0) {
+                return state.DoS(DOS_LEVEL_BLOCK, error("ContextualCheckTransaction(): joinsplit.vpub_old nonzero"),
+                                 REJECT_INVALID, "bad-txns-vpub_old-nonzero");
+            }
+        }
+
+        if (tx.IsCoinBase()) {
+            // Detect transparent funding streams.
+            for (const CTxOut& output : tx.vout) {
+                for (auto it = fundingStreamElements.begin(); it != fundingStreamElements.end(); ++it) {
+                    const CScript* taddr = std::get_if<CScript>(&(it->first));
+                    if (taddr && output.scriptPubKey == *taddr && output.nValue == it->second) {
+                        fundingStreamElements.erase(it);
+                        break;
+                    }
+                }
+            }
+
+            if (!fundingStreamElements.empty()) {
+                return state.DoS(100, error("ContextualCheckTransaction(): funding stream missing at height %d", nHeight),
+                                 REJECT_INVALID, "cb-funding-stream-missing");
+            }
+        }
+    } else {
+        // Rules that apply generally before Canopy. These were
+        // previously noncontextual checks that became contextual
+        // after Canopy activation.
+    }
+
+    // Rules that apply to NU5 or later:
+    if (nu5Active) {
+        // Reject transactions with invalid version group id
+        if (!futureActive) {
+            if (!(tx.nVersionGroupId == SAPLING_VERSION_GROUP_ID || tx.nVersionGroupId == ZIP225_VERSION_GROUP_ID)) {
+                return state.DoS(
+                    dosLevelPotentiallyRelaxing,
+                    error("ContextualCheckTransaction(): invalid NU5 tx version"),
+                    REJECT_INVALID, "bad-nu5-tx-version-group-id");
+            }
+        }
+
+        // Check that the consensus branch ID is unset in Sapling V4 transactions
+        if (tx.nVersionGroupId == SAPLING_VERSION_GROUP_ID) {
+            // NOTE: This is an internal zcashd consistency
+            // check; it does not correspond to a consensus rule in the
+            // protocol specification, but is instead an artifact of the
+            // internal zcashd transaction representation.
+            if (tx.GetConsensusBranchId()) {
+                return state.DoS(
+                    dosLevelPotentiallyRelaxing,
+                    error("ContextualCheckTransaction(): pre-NU5 transaction has consensus branch id set"),
+                    REJECT_INVALID, "bad-tx-has-consensus-branch-id");
+            }
+        }
+
+        // Reject transactions with invalid version
+        if (tx.nVersionGroupId == ZIP225_VERSION_GROUP_ID) {
+            if (tx.nVersion < ZIP225_MIN_TX_VERSION) {
+                return state.DoS(
+                    dosLevelConstricting,
+                    error("ContextualCheckTransaction(): ZIP225 version too low"),
+                    REJECT_INVALID, "bad-tx-zip225-version-too-low");
+            }
+
+            if (tx.nVersion > ZIP225_MAX_TX_VERSION) {
+                return state.DoS(
+                    dosLevelPotentiallyRelaxing,
+                    error("ContextualCheckTransaction(): ZIP225 version too high"),
+                    REJECT_INVALID, "bad-tx-zip225-version-too-high");
+            }
+
+            if (!tx.GetConsensusBranchId().has_value()) {
+                // NOTE: This is an internal zcashd consistency
+                // check; it does not correspond to a consensus rule in the
+                // protocol specification, but is instead an artifact of the
+                // internal zcashd transaction representation.
+                return state.DoS(
+                    dosLevelPotentiallyRelaxing,
+                    error("ContextualCheckTransaction(): transaction does not have consensus branch id field set"),
+                    REJECT_INVALID, "bad-tx-consensus-branch-id-missing");
+            }
+
+            // tx.nConsensusBranchId must match the current consensus branch id
+            if (tx.GetConsensusBranchId().value() != consensusBranchId) {
+                return state.DoS(
+                    dosLevelPotentiallyRelaxing,
+                    error(
+                        "ContextualCheckTransaction(): transaction's consensus branch id (%08x) does not match the current consensus branch (%08x)",
+                        tx.GetConsensusBranchId().value(), consensusBranchId),
+                    REJECT_INVALID, "bad-tx-consensus-branch-id-mismatch");
+            }
+
+            // v5 transactions must have empty joinSplits
+            if (!(tx.vJoinSplit.empty())) {
+                return state.DoS(
+                    dosLevelPotentiallyRelaxing,
+                    error("ContextualCheckTransaction(): Sprout JoinSplits not allowed in ZIP225 transactions"),
+                    REJECT_INVALID, "bad-tx-has-joinsplits");
+            }
+        }
+
+        if (tx.IsCoinBase()) {
+            if (!orchard_bundle.CoinbaseOutputsAreValid()) {
+                return state.DoS(
+                    DOS_LEVEL_BLOCK,
+                    error("ContextualCheckTransaction(): Orchard coinbase action has invalid ciphertext"),
+                    REJECT_INVALID, "bad-cb-action-invalid-ciphertext");
+            }
+        } else {
+            // ZIP 203: From NU5, the upper limit on nExpiryHeight is removed for coinbase
+            // transactions.
+            if (tx.nExpiryHeight >= TX_EXPIRY_HEIGHT_THRESHOLD) {
+                return state.DoS(100, error("CheckTransaction(): expiry height is too high"),
+                                 REJECT_INVALID, "bad-tx-expiry-height-too-high");
+            }
+        }
+    } else {
+        // Rules that apply generally before NU5. These were previously
+        // noncontextual checks that became contextual after NU5 activation.
+
+        if (tx.nExpiryHeight >= TX_EXPIRY_HEIGHT_THRESHOLD) {
+            return state.DoS(
+                dosLevelPotentiallyRelaxing,
+                error("CheckTransaction(): expiry height is too high"),
+                REJECT_INVALID, "bad-tx-expiry-height-too-high");
+        }
+
+        // Check that Orchard transaction components are not present prior to
+        // NU5. NOTE: This is an internal zcashd consistency check; it does not
+        // correspond to a consensus rule in the protocol specification, but is
+        // instead an artifact of the internal zcashd transaction
+        // representation.
+        if (orchard_bundle.IsPresent()) {
+            return state.DoS(
+                dosLevelPotentiallyRelaxing,
+                error("ContextualCheckTransaction(): pre-NU5 transaction has Orchard actions"),
+                REJECT_INVALID, "bad-tx-has-orchard-actions");
+        }
+
+        // Check that the consensus branch ID is unset prior to NU5. NOTE: This
+        // is an internal zcashd consistency check; it does not correspond to a
+        // consensus rule in the protocol specification, but is instead an
+        // artifact of the internal zcashd transaction representation.
+        if (tx.GetConsensusBranchId()) {
+            return state.DoS(
+                dosLevelPotentiallyRelaxing,
+                error("ContextualCheckTransaction(): pre-NU5 transaction has consensus branch id set"),
+                REJECT_INVALID, "bad-tx-has-consensus-branch-id");
+        }
+    }
+
+    // Rules that apply to the future epoch
+    if (futureActive) {
+        switch (tx.nVersionGroupId) {
+            case ZFUTURE_VERSION_GROUP_ID:
+                if (tx.nVersion <= ZIP225_MAX_TX_VERSION) {
+                    return state.DoS(
+                        dosLevelConstricting,
+                        error("ContextualCheckTransaction(): Future version too low"),
+                        REJECT_INVALID, "bad-tx-zfuture-version-too-low");
+                }
+
+                // Reject transactions with invalid version
+                if (tx.nVersion > ZIP225_MAX_TX_VERSION + 1) {
+                    return state.DoS(
+                        dosLevelPotentiallyRelaxing,
+                        error("ContextualCheckTransaction(): Future version too high"),
+                        REJECT_INVALID, "bad-tx-zfuture-version-too-high");
+                }
+                break;
+            case SAPLING_VERSION_GROUP_ID:
+                // Allow V4 transactions while futureActive
+                break;
+            case ZIP225_VERSION_GROUP_ID:
+                // Allow V5 transactions while futureActive
+                break;
+            default:
+                return state.DoS(
+                    dosLevelPotentiallyRelaxing,
+                    error("ContextualCheckTransaction(): invalid future tx version group id"),
+                    REJECT_INVALID, "bad-zfuture-tx-version-group-id");
+        }
+    } else {
+        // Rules that apply generally before the next release epoch
+    }
+
+    return true;
+}
+
+bool ContextualCheckShieldedInputs(
+        const CTransaction& tx,
+        const PrecomputedTransactionData& txdata,
+        CValidationState &state,
+        const CCoinsViewCache &view,
+        orchard::AuthValidator& orchardAuth,
+        const Consensus::Params& consensus,
+        uint32_t consensusBranchId,
+        bool nu5Active,
+        bool isMined,
+        bool (*isInitBlockDownload)(const Consensus::Params&))
+{
+    // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
+    // for an attacker to attempt to split the network.
+    if (!Consensus::CheckTxShieldedInputs(tx, state, view, 0)) {
+        return false;
+    }
+
+    const int DOS_LEVEL_BLOCK = 100;
+    // DoS level set to 10 to be more forgiving.
+    const int DOS_LEVEL_MEMPOOL = 10;
+
+    // For rules that are relaxing (or might become relaxing when a future
+    // network upgrade is implemented), we need to account for IBD mode.
+    auto dosLevelPotentiallyRelaxing = isMined ? DOS_LEVEL_BLOCK : (
+        isInitBlockDownload(consensus) ? 0 : DOS_LEVEL_MEMPOOL);
+
+    auto prevConsensusBranchId = PrevEpochBranchId(consensusBranchId, consensus);
+    uint256 dataToBeSigned;
+    uint256 prevDataToBeSigned;
+
+    // Create signature hashes for shielded components.
+    if (!tx.vJoinSplit.empty() ||
+        !tx.vShieldedSpend.empty() ||
+        !tx.vShieldedOutput.empty() ||
+        tx.GetOrchardBundle().IsPresent())
+    {
+        // Empty output script.
+        CScript scriptCode;
+        try {
+            dataToBeSigned = SignatureHash(scriptCode, tx, NOT_AN_INPUT, SIGHASH_ALL, 0, consensusBranchId, txdata);
+            prevDataToBeSigned = SignatureHash(scriptCode, tx, NOT_AN_INPUT, SIGHASH_ALL, 0, prevConsensusBranchId, txdata);
+        } catch (std::logic_error ex) {
+            // A logic error should never occur because we pass NOT_AN_INPUT and
+            // SIGHASH_ALL to SignatureHash().
+            return state.DoS(100, error("ContextualCheckShieldedInputs(): error computing signature hash"),
+                             REJECT_INVALID, "error-computing-signature-hash");
+        }
+    }
+
+    if (!tx.vJoinSplit.empty())
+    {
+        if (!ed25519_verify(&tx.joinSplitPubKey, &tx.joinSplitSig, dataToBeSigned.begin(), 32)) {
+            // Check whether the failure was caused by an outdated consensus
+            // branch ID; if so, inform the node that they need to upgrade. We
+            // only check the previous epoch's branch ID, on the assumption that
+            // users creating transactions will notice their transactions
+            // failing before a second network upgrade occurs.
+            if (ed25519_verify(&tx.joinSplitPubKey,
+                               &tx.joinSplitSig,
+                               prevDataToBeSigned.begin(), 32)) {
+                return state.DoS(
+                    dosLevelPotentiallyRelaxing, false, REJECT_INVALID, strprintf(
+                        "old-consensus-branch-id (Expected %s, found %s)",
+                        HexInt(consensusBranchId),
+                        HexInt(prevConsensusBranchId)));
+            }
+            return state.DoS(
+                dosLevelPotentiallyRelaxing,
+                error("ContextualCheckShieldedInputs(): invalid joinsplit signature"),
+                REJECT_INVALID, "bad-txns-invalid-joinsplit-signature");
+        }
+    }
+
+    if (!tx.vShieldedSpend.empty() ||
+        !tx.vShieldedOutput.empty())
+    {
+        // The nu5Active flag passed in here enables the new consensus rules from ZIP 216
+        // (https://zips.z.cash/zip-0216#specification) on the following fields:
+        //
+        // - spendAuthSig in Sapling Spend descriptions
+        // - bindingSigSapling
+        auto ctx = librustzcash_sapling_verification_ctx_init(nu5Active);
+
+        for (const SpendDescription &spend : tx.vShieldedSpend) {
+            if (!librustzcash_sapling_check_spend(
+                ctx,
+                spend.cv.begin(),
+                spend.anchor.begin(),
+                spend.nullifier.begin(),
+                spend.rk.begin(),
+                spend.zkproof.begin(),
+                spend.spendAuthSig.begin(),
+                dataToBeSigned.begin()
+            ))
+            {
+                librustzcash_sapling_verification_ctx_free(ctx);
+                return state.DoS(
+                    dosLevelPotentiallyRelaxing,
+                    error("ContextualCheckShieldedInputs(): Sapling spend description invalid"),
+                    REJECT_INVALID, "bad-txns-sapling-spend-description-invalid");
+            }
+        }
+
+        for (const OutputDescription &output : tx.vShieldedOutput) {
+            if (!librustzcash_sapling_check_output(
+                ctx,
+                output.cv.begin(),
+                output.cmu.begin(),
+                output.ephemeralKey.begin(),
+                output.zkproof.begin()
+            ))
+            {
+                librustzcash_sapling_verification_ctx_free(ctx);
+                // This should be a non-contextual check, but we check it here
+                // as we need to pass over the outputs anyway in order to then
+                // call librustzcash_sapling_final_check().
+                return state.DoS(100, error("ContextualCheckShieldedInputs(): Sapling output description invalid"),
+                                      REJECT_INVALID, "bad-txns-sapling-output-description-invalid");
+            }
+        }
+
+        if (!librustzcash_sapling_final_check(
+            ctx,
+            tx.GetValueBalanceSapling(),
+            tx.bindingSig.begin(),
+            dataToBeSigned.begin()
+        ))
+        {
+            librustzcash_sapling_verification_ctx_free(ctx);
+            return state.DoS(
+                dosLevelPotentiallyRelaxing,
+                error("ContextualCheckShieldedInputs(): Sapling binding signature invalid"),
+                REJECT_INVALID, "bad-txns-sapling-binding-signature-invalid");
+        }
+
+        librustzcash_sapling_verification_ctx_free(ctx);
+    }
+
+    // Queue Orchard signatures to be batch-validated.
+    tx.GetOrchardBundle().QueueSignatureValidation(orchardAuth, dataToBeSigned);
+
+    return true;
+}
+
+
+bool CheckTransaction(const CTransaction& tx, CValidationState &state,
+                      ProofVerifier& verifier)
+{
+    // Don't count coinbase transactions because mining skews the count
+    if (!tx.IsCoinBase()) {
+        transactionsValidated.increment();
+    }
+
+    if (!CheckTransactionWithoutProofVerification(tx, state)) {
+        return false;
+    } else {
+        // Ensure that zk-SNARKs verify
+        for (const JSDescription &joinsplit : tx.vJoinSplit) {
+            if (!verifier.VerifySprout(joinsplit, tx.joinSplitPubKey)) {
+                return state.DoS(100, error("CheckTransaction(): joinsplit does not verify"),
+                                    REJECT_INVALID, "bad-txns-joinsplit-verification-failed");
+            }
+        }
+
+        // Sapling zk-SNARK proofs are checked in librustzcash_sapling_check_{spend,output},
+        // called from ContextualCheckTransaction.
+
+        // Check bundle-specific Orchard consensus rules. Since we check encoding
+        // consensus rules at parse time, and signature validation is batched, all we are
+        // checking here is proof validity. Once we implement batched proof verification,
+        // this will move into orchardAuth.
+        auto orchardBundle = tx.GetOrchardBundle();
+        if (!orchardBundle.CheckBundleSpecificConsensusRules()) {
+            return state.DoS(
+                100, error("CheckTransaction(): Orchard bundle proof does not verify"),
+                REJECT_INVALID, "bad-txns-orchard-verification-failed");
+        }
+
+        return true;
+    }
+}
+
+/**
+ * Basic checks that don't depend on any context.
+ *
+ * This function must obey the following contract: it must reject transactions
+ * that are invalid according to the transaction's embedded version
+ * information, but it may accept transactions that are valid with respect to
+ * embedded version information but are invalid with respect to current
+ * consensus rules.
+ */
+bool CheckTransactionWithoutProofVerification(const CTransaction& tx, CValidationState &state)
+{
+    /**
+     * Previously:
+     * 1. The consensus rule below was:
+     *        if (tx.nVersion < SPROUT_MIN_TX_VERSION) { ... }
+     *    which checked if tx.nVersion fell within the range:
+     *        INT32_MIN <= tx.nVersion < SPROUT_MIN_TX_VERSION
+     * 2. The parser allowed tx.nVersion to be negative
+     *
+     * Now:
+     * 1. The consensus rule checks to see if tx.Version falls within the range:
+     *        0 <= tx.nVersion < SPROUT_MIN_TX_VERSION
+     * 2. The previous consensus rule checked for negative values within the range:
+     *        INT32_MIN <= tx.nVersion < 0
+     *    This is unnecessary for Overwinter transactions since the parser now
+     *    interprets the sign bit as fOverwintered, so tx.nVersion is always >=0,
+     *    and when Overwinter is not active ContextualCheckTransaction rejects
+     *    transactions with fOverwintered set.  When fOverwintered is set,
+     *    this function and ContextualCheckTransaction will together check to
+     *    ensure tx.nVersion avoids the following ranges:
+     *        0 <= tx.nVersion < OVERWINTER_MIN_TX_VERSION
+     *        OVERWINTER_MAX_TX_VERSION < tx.nVersion <= INT32_MAX
+     */
+    if (!tx.fOverwintered && tx.nVersion < SPROUT_MIN_TX_VERSION) {
+        return state.DoS(100, error("CheckTransaction(): version too low"),
+                         REJECT_INVALID, "bad-txns-version-too-low");
+    }
+    else if (tx.fOverwintered) {
+        if (tx.nVersion < OVERWINTER_MIN_TX_VERSION) {
+            return state.DoS(100, error("CheckTransaction(): overwinter version too low"),
+                REJECT_INVALID, "bad-tx-overwinter-version-too-low");
+        }
+        if (tx.nVersionGroupId != OVERWINTER_VERSION_GROUP_ID &&
+                tx.nVersionGroupId != SAPLING_VERSION_GROUP_ID &&
+                tx.nVersionGroupId != ZIP225_VERSION_GROUP_ID &&
+                tx.nVersionGroupId != ZFUTURE_VERSION_GROUP_ID) {
+            return state.DoS(100, error("CheckTransaction(): unknown tx version group id"),
+                    REJECT_INVALID, "bad-tx-version-group-id");
+        }
+    }
+    auto orchard_bundle = tx.GetOrchardBundle();
+
+    // Transactions must contain some potential source of funds. This rejects
+    // obviously-invalid transaction constructions early, but cannot prevent
+    // e.g. a pure Sapling transaction with only dummy spends (which is
+    // undetectable). Contextual checks ensure that only one of Sprout
+    // joinsplits or Orchard actions may be present.
+    // Note that orchard_bundle.SpendsEnabled() is false when no
+    // Orchard bundle is present, i.e. when nActionsOrchard == 0.
+    if (tx.vin.empty() &&
+        tx.vJoinSplit.empty() &&
+        tx.vShieldedSpend.empty() &&
+        !orchard_bundle.SpendsEnabled())
+    {
+        return state.DoS(10, false, REJECT_INVALID, "bad-txns-no-source-of-funds");
+    }
+    // Transactions must contain some potential useful sink of funds.  This
+    // rejects obviously-invalid transaction constructions early, but cannot
+    // prevent e.g. a pure Sapling transaction with only dummy outputs (which
+    // is undetectable), and does not prevent transparent transactions from
+    // sending all funds to miners.  Contextual checks ensure that only one of
+    // Sprout joinsplits or Orchard actions may be present.
+    // Note that orchard_bundle.OutputsEnabled() is false when no
+    // Orchard bundle is present, i.e. when nActionsOrchard == 0.
+    if (tx.vout.empty() &&
+        tx.vJoinSplit.empty() &&
+        tx.vShieldedOutput.empty() &&
+        !orchard_bundle.OutputsEnabled())
+    {
+        return state.DoS(10, false, REJECT_INVALID, "bad-txns-no-sink-of-funds");
+    }
+
+    // Size limits
+    static_assert(MAX_BLOCK_SIZE >= MAX_TX_SIZE_AFTER_SAPLING); // sanity
+    static_assert(MAX_TX_SIZE_AFTER_SAPLING > MAX_TX_SIZE_BEFORE_SAPLING); // sanity
+    if (::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION) > MAX_TX_SIZE_AFTER_SAPLING)
+        return state.DoS(100, false, REJECT_INVALID, "bad-txns-oversize");
+
+    // Check for negative or overflow output values
+    CAmount nValueOut = 0;
+    for (const CTxOut& txout : tx.vout)
+    {
+        if (txout.nValue < 0)
+            return state.DoS(100, false, REJECT_INVALID, "bad-txns-vout-negative");
+        if (txout.nValue > MAX_MONEY)
+            return state.DoS(100, false, REJECT_INVALID, "bad-txns-vout-toolarge");
+        nValueOut += txout.nValue;
+        if (!MoneyRange(nValueOut))
+            return state.DoS(100, false, REJECT_INVALID, "bad-txns-txouttotal-toolarge");
+    }
+
+    // Check for non-zero valueBalanceSapling when there are no Sapling inputs or outputs
+    if (tx.vShieldedSpend.empty() && tx.vShieldedOutput.empty() && tx.GetValueBalanceSapling() != 0) {
+        return state.DoS(100, error("CheckTransaction(): tx.valueBalanceSapling has no sources or sinks"),
+                            REJECT_INVALID, "bad-txns-valuebalance-nonzero");
+    }
+
+    // Check for overflow valueBalanceSapling
+    if (tx.GetValueBalanceSapling() > MAX_MONEY || tx.GetValueBalanceSapling() < -MAX_MONEY) {
+        return state.DoS(100, error("CheckTransaction(): abs(tx.valueBalanceSapling) too large"),
+                            REJECT_INVALID, "bad-txns-valuebalance-toolarge");
+    }
+
+    if (tx.GetValueBalanceSapling() <= 0) {
+        // NB: negative valueBalanceSapling "takes" money from the transparent value pool just as outputs do
+        nValueOut += -tx.GetValueBalanceSapling();
+
+        if (!MoneyRange(nValueOut)) {
+            return state.DoS(100, error("CheckTransaction(): txout total out of range"),
+                                REJECT_INVALID, "bad-txns-txouttotal-toolarge");
+        }
+    }
+
+    // nSpendsSapling, nOutputsSapling, and nActionsOrchard MUST all be less than 2^16
+    size_t max_elements = (1 << 16) - 1;
+    if (tx.vShieldedSpend.size() > max_elements) {
+        return state.DoS(
+            100,
+            error("CheckTransaction(): 2^16 or more Sapling spends"),
+            REJECT_INVALID, "bad-tx-too-many-sapling-spends");
+    }
+    if (tx.vShieldedOutput.size() > max_elements) {
+        return state.DoS(
+            100,
+            error("CheckTransaction(): 2^16 or more Sapling outputs"),
+            REJECT_INVALID, "bad-tx-too-many-sapling-outputs");
+    }
+    if (orchard_bundle.GetNumActions() > max_elements) {
+        return state.DoS(
+            100,
+            error("CheckTransaction(): 2^16 or more Orchard actions"),
+            REJECT_INVALID, "bad-tx-too-many-orchard-actions");
+    }
+
+    // Check that if neither Orchard spends nor outputs are enabled, the transaction contains
+    // no Orchard actions. This subsumes the check that valueBalanceOrchard must equal zero
+    // in the case that both spends and outputs are disabled.
+    if (orchard_bundle.GetNumActions() > 0 && !orchard_bundle.OutputsEnabled() && !orchard_bundle.SpendsEnabled()) {
+        return state.DoS(
+            100,
+            error("CheckTransaction(): Orchard actions are present, but flags do not permit Orchard spends or outputs"),
+            REJECT_INVALID, "bad-tx-orchard-flags-disable-actions");
+    }
+
+    auto valueBalanceOrchard = orchard_bundle.GetValueBalance();
+
+    // Check for overflow valueBalanceOrchard
+    if (valueBalanceOrchard > MAX_MONEY || valueBalanceOrchard < -MAX_MONEY) {
+        return state.DoS(100, error("CheckTransaction(): abs(tx.valueBalanceOrchard) too large"),
+                         REJECT_INVALID, "bad-txns-valuebalance-toolarge");
+    }
+
+    if (valueBalanceOrchard <= 0) {
+        // NB: negative valueBalanceOrchard "takes" money from the transparent value pool just as outputs do
+        nValueOut += -valueBalanceOrchard;
+
+        if (!MoneyRange(nValueOut)) {
+            return state.DoS(100, error("CheckTransaction(): txout total out of range"),
+                             REJECT_INVALID, "bad-txns-txouttotal-toolarge");
+        }
+    }
+
+    // Ensure that joinsplit values are well-formed
+    for (const JSDescription& joinsplit : tx.vJoinSplit)
+    {
+        if (joinsplit.vpub_old < 0) {
+            return state.DoS(100, error("CheckTransaction(): joinsplit.vpub_old negative"),
+                             REJECT_INVALID, "bad-txns-vpub_old-negative");
+        }
+
+        if (joinsplit.vpub_new < 0) {
+            return state.DoS(100, error("CheckTransaction(): joinsplit.vpub_new negative"),
+                             REJECT_INVALID, "bad-txns-vpub_new-negative");
+        }
+
+        if (joinsplit.vpub_old > MAX_MONEY) {
+            return state.DoS(100, error("CheckTransaction(): joinsplit.vpub_old too high"),
+                             REJECT_INVALID, "bad-txns-vpub_old-toolarge");
+        }
+
+        if (joinsplit.vpub_new > MAX_MONEY) {
+            return state.DoS(100, error("CheckTransaction(): joinsplit.vpub_new too high"),
+                             REJECT_INVALID, "bad-txns-vpub_new-toolarge");
+        }
+
+        if (joinsplit.vpub_new != 0 && joinsplit.vpub_old != 0) {
+            return state.DoS(100, error("CheckTransaction(): joinsplit.vpub_new and joinsplit.vpub_old both nonzero"),
+                             REJECT_INVALID, "bad-txns-vpubs-both-nonzero");
+        }
+
+        nValueOut += joinsplit.vpub_old;
+        if (!MoneyRange(nValueOut)) {
+            return state.DoS(100, error("CheckTransaction(): txout total out of range"),
+                             REJECT_INVALID, "bad-txns-txouttotal-toolarge");
+        }
+    }
+
+    // Ensure input values do not exceed MAX_MONEY
+    // We have not resolved the txin values at this stage,
+    // but we do know what the joinsplits claim to add
+    // to the value pool.
+    {
+        CAmount nValueIn = 0;
+        for (std::vector<JSDescription>::const_iterator it(tx.vJoinSplit.begin()); it != tx.vJoinSplit.end(); ++it)
+        {
+            nValueIn += it->vpub_new;
+
+            if (!MoneyRange(it->vpub_new) || !MoneyRange(nValueIn)) {
+                return state.DoS(100, error("CheckTransaction(): txin total out of range"),
+                                 REJECT_INVALID, "bad-txns-txintotal-toolarge");
+            }
+        }
+
+        // Also check for Sapling
+        if (tx.GetValueBalanceSapling() >= 0) {
+            // NB: positive valueBalanceSapling "adds" money to the transparent value pool, just as inputs do
+            nValueIn += tx.GetValueBalanceSapling();
+
+            if (!MoneyRange(nValueIn)) {
+                return state.DoS(100, error("CheckTransaction(): txin total out of range"),
+                                 REJECT_INVALID, "bad-txns-txintotal-toolarge");
+            }
+        }
+
+        // Also check for Orchard
+        if (valueBalanceOrchard >= 0) {
+            // NB: positive valueBalanceOrchard "adds" money to the transparent value pool, just as inputs do
+            nValueIn += valueBalanceOrchard;
+
+            if (!MoneyRange(nValueIn)) {
+                return state.DoS(100, error("CheckTransaction(): txin total out of range"),
+                                    REJECT_INVALID, "bad-txns-txintotal-toolarge");
+            }
+        }
+    }
+
+    // Check for duplicate inputs
+    set<COutPoint> vInOutPoints;
+    for (const CTxIn& txin : tx.vin)
+    {
+        if (vInOutPoints.count(txin.prevout))
+            return state.DoS(100, false, REJECT_INVALID, "bad-txns-inputs-duplicate");
+        vInOutPoints.insert(txin.prevout);
+    }
+
+    // Check for duplicate joinsplit nullifiers in this transaction
+    {
+        set<uint256> vJoinSplitNullifiers;
+        for (const JSDescription& joinsplit : tx.vJoinSplit)
+        {
+            for (const uint256& nf : joinsplit.nullifiers)
+            {
+                if (vJoinSplitNullifiers.count(nf))
+                    return state.DoS(100, error("CheckTransaction(): duplicate nullifiers"),
+                                REJECT_INVALID, "bad-joinsplits-nullifiers-duplicate");
+
+                vJoinSplitNullifiers.insert(nf);
+            }
+        }
+    }
+
+    // Check for duplicate sapling nullifiers in this transaction
+    {
+        set<uint256> vSaplingNullifiers;
+        for (const SpendDescription& spend_desc : tx.vShieldedSpend)
+        {
+            if (vSaplingNullifiers.count(spend_desc.nullifier))
+                return state.DoS(100, error("CheckTransaction(): duplicate nullifiers"),
+                            REJECT_INVALID, "bad-spend-description-nullifiers-duplicate");
+
+            vSaplingNullifiers.insert(spend_desc.nullifier);
+        }
+    }
+
+    // Check for duplicate orchard nullifiers in this transaction
+    {
+        std::set<uint256> vOrchardNullifiers;
+        for (const uint256& nf : tx.GetOrchardBundle().GetNullifiers())
+        {
+            if (vOrchardNullifiers.count(nf))
+                return state.DoS(100, error("CheckTransaction(): duplicate nullifiers"),
+                            REJECT_INVALID, "bad-orchard-nullifiers-duplicate");
+
+            vOrchardNullifiers.insert(nf);
+        }
+    }
+
+    if (tx.IsCoinBase())
+    {
+        // There should be no joinsplits in a coinbase transaction
+        if (tx.vJoinSplit.size() > 0)
+            return state.DoS(100, error("CheckTransaction(): coinbase has joinsplits"),
+                             REJECT_INVALID, "bad-cb-has-joinsplits");
+
+        // A coinbase transaction cannot have spend descriptions
+        if (tx.vShieldedSpend.size() > 0)
+            return state.DoS(100, error("CheckTransaction(): coinbase has spend descriptions"),
+                             REJECT_INVALID, "bad-cb-has-spend-description");
+        // See ContextualCheckTransaction for consensus rules on coinbase output descriptions.
+        if (orchard_bundle.SpendsEnabled())
+            return state.DoS(100, error("CheckTransaction(): coinbase has enableSpendsOrchard set"),
+                             REJECT_INVALID, "bad-cb-has-orchard-spend");
+
+        if (tx.vin[0].scriptSig.size() < 2 || tx.vin[0].scriptSig.size() > 100)
+            return state.DoS(100, false, REJECT_INVALID, "bad-cb-length");
+    }
+    else
+    {
+        for (const CTxIn& txin : tx.vin)
+            if (txin.prevout.IsNull())
+                return state.DoS(10, false, REJECT_INVALID, "bad-txns-prevout-null");
+    }
+
+    return true;
+}
+
+CAmount GetMinRelayFee(const CTransaction& tx, const CTxMemPool& pool, unsigned int nBytes, bool fAllowFree)
+{
+    uint256 hash = tx.GetHash();
+    double dPriorityDelta = 0;
+    CAmount nFeeDelta = 0;
+    pool.ApplyDeltas(hash, dPriorityDelta, nFeeDelta);
+    if (dPriorityDelta > 0 || nFeeDelta > 0)
+        return 0;
+
+    CAmount nMinFee = ::minRelayTxFee.GetFeeForRelay(nBytes);
+
+    if (fAllowFree)
+    {
+        // There is a free transaction area in blocks created by most miners,
+        // * If we are relaying we allow transactions up to DEFAULT_BLOCK_PRIORITY_SIZE - 1000
+        //   to be considered to fall into this category. We don't want to encourage sending
+        //   multiple transactions instead of one big transaction to avoid fees.
+        if (nBytes < (DEFAULT_BLOCK_PRIORITY_SIZE - 1000))
+            nMinFee = 0;
+    }
+
+    if (!MoneyRange(nMinFee))
+        nMinFee = MAX_MONEY;
+    return nMinFee;
+}
+
+/** Convert CValidationState to a human-readable message for logging */
+static std::string FormatStateMessage(const CValidationState &state)
+{
+    return strprintf("%s%s (code %i)",
+        state.GetRejectReason(),
+        state.GetDebugMessage().empty() ? "" : ", "+state.GetDebugMessage(),
+        state.GetRejectCode());
+}
+
+bool AcceptToMemoryPool(
+        const CChainParams& chainparams,
+        CTxMemPool& pool, CValidationState &state, const CTransaction &tx, bool fLimitFree,
+        bool* pfMissingInputs, bool fRejectAbsurdFee)
+{
+    AssertLockHeld(cs_main);
+    LOCK(pool.cs); // mempool "read lock" (held through pool.addUnchecked())
+    if (pfMissingInputs) {
+        *pfMissingInputs = false;
+    }
+
+    int nextBlockHeight = chainActive.Height() + 1;
+
+    // Grab the branch ID we expect this transaction to commit to.
+    auto consensusBranchId = CurrentEpochBranchId(nextBlockHeight, chainparams.GetConsensus());
+
+    if (pool.IsRecentlyEvicted(tx.GetHash())) {
+        LogPrint("mempool", "Dropping txid %s : recently evicted", tx.GetHash().ToString());
+        return false;
+    }
+
+    auto verifier = ProofVerifier::Strict();
+    if (!CheckTransaction(tx, state, verifier))
+        return false;
+
+    // Check transaction contextually against the set of consensus rules which apply in the next block to be mined.
+    if (!ContextualCheckTransaction(tx, state, chainparams, nextBlockHeight, false)) {
+        return false;
+    }
+
+    // DoS mitigation: reject transactions expiring soon
+    // Note that if a valid transaction belonging to the wallet is in the mempool and the node is shutdown,
+    // upon restart, CWalletTx::AcceptToMemoryPool() will be invoked which might result in rejection.
+    if (IsExpiringSoonTx(tx, nextBlockHeight)) {
+        return state.DoS(0, error("AcceptToMemoryPool(): transaction is expiring soon"), REJECT_INVALID, "tx-expiring-soon");
+    }
+
+    // Coinbase is only valid in a block, not as a loose transaction
+    if (tx.IsCoinBase())
+        return state.DoS(100, false, REJECT_INVALID, "coinbase");
+
+    // Rather not work on nonstandard transactions (unless -regtest)
+    string reason;
+    if (chainparams.RequireStandard() && !IsStandardTx(tx, reason, chainparams, nextBlockHeight))
+        return state.DoS(0, false, REJECT_NONSTANDARD, reason);
+
+    // Only accept nLockTime-using transactions that can be mined in the next
+    // block; we don't want our mempool filled up with transactions that can't
+    // be mined yet.
+    if (!CheckFinalTx(tx, STANDARD_LOCKTIME_VERIFY_FLAGS))
+        return state.DoS(0, false, REJECT_NONSTANDARD, "non-final");
+
+    // is it already in the memory pool?
+    uint256 hash = tx.GetHash();
+    if (pool.exists(hash))
+        return state.Invalid(false, REJECT_ALREADY_KNOWN, "txn-already-in-mempool");
+
+    // Check for conflicts with in-memory transactions.
+    // This is redundant with the call to HaveInputs (for non-coinbase transactions)
+    // below, but we do it here for consistency with Bitcoin and because this check
+    // doesn't require loading the coins view.
+    // We don't do the corresponding check for nullifiers, because that would also
+    // be redundant, and we have no need to avoid semantic conflicts with Bitcoin
+    // backports in the case of the shielded protocol.
+    for (unsigned int i = 0; i < tx.vin.size(); i++)
+    {
+        COutPoint outpoint = tx.vin[i].prevout;
+        if (pool.mapNextTx.count(outpoint))
+        {
+            // Disable replacement feature for now
+            return state.Invalid(false, REJECT_CONFLICT, "txn-mempool-conflict");
+        }
+    }
+
+    {
+        CCoinsView dummy;
+        CCoinsViewCache view(&dummy);
+
+        CAmount nValueIn = 0;
+        CCoinsViewMemPool viewMemPool(pcoinsTip, pool);
+        view.SetBackend(viewMemPool);
+
+        // do we already have it?
+        if (view.HaveCoins(hash))
+            return state.Invalid(false, REJECT_ALREADY_KNOWN, "txn-already-known");
+
+        // do all inputs exist?
+        // Note that this does not check for the presence of actual outputs (see the next check for that),
+        // and only helps with filling in pfMissingInputs (to determine missing vs spent).
+        for (const CTxIn txin : tx.vin) {
+            if (!view.HaveCoins(txin.prevout.hash)) {
+                if (pfMissingInputs)
+                    *pfMissingInputs = true;
+                return false; // fMissingInputs and !state.IsInvalid() is used to detect this condition, don't set state.Invalid()
+            }
+        }
+
+        // are the actual inputs available?
+        if (!view.HaveInputs(tx))
+            return state.Invalid(false, REJECT_DUPLICATE, "bad-txns-inputs-spent");
+
+        // Are the shielded spends' requirements met?
+        // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
+        // for an attacker to attempt to split the network.
+        if (!Consensus::CheckTxShieldedInputs(tx, state, view, 0)) {
+            return false;
+        }
+
+        // Bring the best block into scope
+        view.GetBestBlock();
+
+        nValueIn = view.GetValueIn(tx);
+
+        // we have all inputs cached now, so switch back to dummy
+        view.SetBackend(dummy);
+
+        // Check for non-standard pay-to-script-hash in inputs
+        if (chainparams.RequireStandard() && !AreInputsStandard(tx, view, consensusBranchId))
+            return state.Invalid(false, REJECT_NONSTANDARD, "bad-txns-nonstandard-inputs");
+
+        // Check that the transaction doesn't have an excessive number of
+        // sigops, making it impossible to mine. Since the coinbase transaction
+        // itself can contain sigops MAX_STANDARD_TX_SIGOPS is less than
+        // MAX_BLOCK_SIGOPS; we still consider this an invalid rather than
+        // merely non-standard transaction.
+        unsigned int nSigOps = GetLegacySigOpCount(tx);
+        nSigOps += GetP2SHSigOpCount(tx, view);
+        if (nSigOps > MAX_STANDARD_TX_SIGOPS)
+            return state.DoS(0, false, REJECT_NONSTANDARD, "bad-txns-too-many-sigops", false,
+                strprintf("%d > %d", nSigOps, MAX_STANDARD_TX_SIGOPS));
+
+        CAmount nValueOut = tx.GetValueOut();
+        CAmount nFees = nValueIn-nValueOut;
+        double dPriority = view.GetPriority(tx, chainActive.Height());
+
+        // Keep track of transactions that spend a coinbase, which we re-scan
+        // during reorgs to ensure COINBASE_MATURITY is still met.
+        bool fSpendsCoinbase = false;
+        for (const CTxIn &txin : tx.vin) {
+            const CCoins *coins = view.AccessCoins(txin.prevout.hash);
+            if (coins->IsCoinBase()) {
+                fSpendsCoinbase = true;
+                break;
+            }
+        }
+
+        // For v1-v4 transactions, we don't yet know if the transaction commits
+        // to consensusBranchId, but if the entry gets added to the mempool, then
+        // it has passed ContextualCheckInputs and therefore this is correct.
+        CTxMemPoolEntry entry(tx, nFees, GetTime(), dPriority, chainActive.Height(), pool.HasNoInputsOf(tx), fSpendsCoinbase, nSigOps, consensusBranchId);
+        unsigned int nSize = entry.GetTxSize();
+
+        // Before zcashd 4.2.0, we had a condition here to always accept a tx if it contained
+        // JoinSplits and had at least the default fee. It is no longer necessary to treat
+        // that as a special case, because the fee returned by GetMinRelayFee is always at
+        // most DEFAULT_FEE.
+
+        CAmount txMinFee = GetMinRelayFee(tx, pool, nSize, true);
+        if (fLimitFree && nFees < txMinFee) {
+            return state.DoS(0, false, REJECT_INSUFFICIENTFEE, "insufficient fee", false,
+                strprintf("%d < %d", nFees, txMinFee));
+        }
+
+        // Require that free transactions have sufficient priority to be mined in the next block.
+        if (GetBoolArg("-relaypriority", DEFAULT_RELAYPRIORITY) && nFees < ::minRelayTxFee.GetFeeForRelay(nSize) && !AllowFree(view.GetPriority(tx, chainActive.Height() + 1))) {
+            return state.DoS(0, false, REJECT_INSUFFICIENTFEE, "insufficient priority");
+        }
+
+        // Continuously rate-limit free (really, very-low-fee) transactions
+        // This mitigates 'penny-flooding' -- sending thousands of free transactions just to
+        // be annoying or make others' transactions take longer to confirm.
+        if (fLimitFree && nFees < ::minRelayTxFee.GetFeeForRelay(nSize))
+        {
+            static CCriticalSection csFreeLimiter;
+            static double dFreeCount;
+            static int64_t nLastTime;
+            int64_t nNow = GetTime();
+
+            LOCK(csFreeLimiter);
+
+            // Use an exponentially decaying ~10-minute window:
+            dFreeCount *= pow(1.0 - 1.0/600.0, (double)(nNow - nLastTime));
+            nLastTime = nNow;
+            // -limitfreerelay unit is thousand-bytes-per-minute
+            // At default rate it would take over a month to fill 1GB
+            if (dFreeCount >= GetArg("-limitfreerelay", DEFAULT_LIMITFREERELAY) * 10 * 1000)
+                return state.DoS(0, false, REJECT_INSUFFICIENTFEE, "rate limited free transaction");
+            LogPrint("mempool", "Rate limit dFreeCount: %g => %g\n", dFreeCount, dFreeCount+nSize);
+            dFreeCount += nSize;
+        }
+
+        if (fRejectAbsurdFee && nFees > maxTxFee) {
+            return state.Invalid(false,
+                REJECT_HIGHFEE, "absurdly-high-fee",
+                strprintf("%d > %d", nFees, maxTxFee));
+        }
+
+        // Check against previous transactions
+        // This is done near the end to help prevent CPU exhaustion denial-of-service attacks.
+        std::vector<CTxOut> allPrevOutputs;
+        for (const auto& input : tx.vin) {
+            allPrevOutputs.push_back(view.GetOutputFor(input));
+        }
+        PrecomputedTransactionData txdata(tx, allPrevOutputs);
+        if (!ContextualCheckInputs(tx, state, view, true, STANDARD_SCRIPT_VERIFY_FLAGS, true, txdata, chainparams.GetConsensus(), consensusBranchId))
+        {
+            return false;
+        }
+
+        // Check again against just the consensus-critical mandatory script
+        // verification flags, in case of bugs in the standard flags that cause
+        // transactions to pass as valid when they're actually invalid. For
+        // instance the STRICTENC flag was incorrectly allowing certain
+        // CHECKSIG NOT scripts to pass, even though they were invalid.
+        //
+        // There is a similar check in CreateNewBlock() to prevent creating
+        // invalid blocks, however allowing such transactions into the mempool
+        // can be exploited as a DoS attack.
+        if (!ContextualCheckInputs(tx, state, view, true, MANDATORY_SCRIPT_VERIFY_FLAGS, true, txdata, chainparams.GetConsensus(), consensusBranchId))
+        {
+            return error("%s: BUG! PLEASE REPORT THIS! ConnectInputs failed against MANDATORY but not STANDARD flags %s, %s",
+                __func__, hash.ToString(), FormatStateMessage(state));
+        }
+
+        // This will be a single-transaction batch, which is still more efficient as every
+        // Orchard bundle contains at least two signatures.
+        auto orchardAuth = orchard::AuthValidator::Batch();
+
+        // Check shielded input signatures.
+        if (!ContextualCheckShieldedInputs(
+            tx,
+            txdata,
+            state,
+            view,
+            orchardAuth,
+            chainparams.GetConsensus(),
+            consensusBranchId,
+            chainparams.GetConsensus().NetworkUpgradeActive(nextBlockHeight, Consensus::UPGRADE_NU5),
+            false))
+        {
+            return false;
+        }
+
+        // Check Orchard bundle authorizations.
+        if (!orchardAuth.Validate()) {
+            return state.DoS(100, false, REJECT_INVALID, "bad-orchard-bundle-authorization");
+        }
+
+        {
+            // Store transaction in memory
+            pool.addUnchecked(hash, entry, !IsInitialBlockDownload(chainparams.GetConsensus()));
+
+            // Add memory address index
+            if (fAddressIndex) {
+                pool.addAddressIndex(entry, view);
+            }
+
+            // insightexplorer: Add memory spent index
+            if (fSpentIndex) {
+                pool.addSpentIndex(entry, view);
+            }
+
+            pool.EnsureSizeLimit();
+
+            MetricsGauge("zcash.mempool.size.transactions", pool.size());
+            MetricsGauge("zcash.mempool.size.bytes", pool.GetTotalTxSize());
+            MetricsGauge("zcash.mempool.usage.bytes", pool.DynamicMemoryUsage());
+        }
+    }
+
+    auto txid = tx.GetHash().ToString();
+    auto poolsz = tfm::format("%u", pool.mapTx.size());
+
+    TracingInfo("mempool", "Accepted",
+        "txid", txid.c_str(),
+        "poolsize", poolsz.c_str());
+
+    return true;
+}
+
+bool GetTimestampIndex(unsigned int high, unsigned int low, bool fActiveOnly,
+    std::vector<std::pair<uint256, unsigned int> > &hashes)
+{
+    if (!fTimestampIndex) {
+        LogPrint("rpc", "Timestamp index not enabled");
+        return false;
+    }
+    if (!pblocktree->ReadTimestampIndex(high, low, fActiveOnly, hashes)) {
+        LogPrint("rpc", "Unable to get hashes for timestamps");
+        return false;
+    }
+    return true;
+}
+
+bool GetSpentIndex(CSpentIndexKey &key, CSpentIndexValue &value)
+{
+    AssertLockHeld(cs_main);
+    if (!fSpentIndex) {
+        LogPrint("rpc", "Spent index not enabled");
+        return false;
+    }
+    if (mempool.getSpentIndex(key, value))
+        return true;
+
+    if (!pblocktree->ReadSpentIndex(key, value)) {
+        LogPrint("rpc", "Unable to get spent index information");
+        return false;
+    }
+    return true;
+}
+
+bool GetAddressIndex(const uint160& addressHash, int type,
+                     std::vector<CAddressIndexDbEntry>& addressIndex,
+                     int start, int end)
+{
+    if (!fAddressIndex) {
+        LogPrint("rpc", "address index not enabled");
+        return false;
+    }
+    if (!pblocktree->ReadAddressIndex(addressHash, type, addressIndex, start, end)) {
+        LogPrint("rpc", "unable to get txids for address");
+        return false;
+    }
+    return true;
+}
+
+bool GetAddressUnspent(const uint160& addressHash, int type,
+                       std::vector<CAddressUnspentDbEntry>& unspentOutputs)
+{
+    if (!fAddressIndex) {
+        LogPrint("rpc", "address index not enabled");
+        return false;
+    }
+    if (!pblocktree->ReadAddressUnspentIndex(addressHash, type, unspentOutputs)) {
+        LogPrint("rpc", "unable to get txids for address");
+        return false;
+    }
+    return true;
+}
+
+/**
+ * Return transaction in txOut, and if it was found inside a block, its hash is placed in hashBlock.
+ * If blockIndex is provided, the transaction is fetched from the corresponding block.
+ */
+bool GetTransaction(const uint256& hash, CTransaction& txOut, const Consensus::Params& consensusParams, uint256& hashBlock, bool fAllowSlow, CBlockIndex* blockIndex)
+{
+    CBlockIndex* pindexSlow = blockIndex;
+
+    LOCK(cs_main);
+
+    if (!blockIndex) {
+        std::shared_ptr<const CTransaction> ptx = mempool.get(hash);
+        if (ptx)
+        {
+            txOut = *ptx;
+            return true;
+        }
+
+        if (fTxIndex) {
+            CDiskTxPos postx;
+            if (pblocktree->ReadTxIndex(hash, postx)) {
+                CAutoFile file(OpenBlockFile(postx, true), SER_DISK, CLIENT_VERSION);
+                if (file.IsNull())
+                    return error("%s: OpenBlockFile failed", __func__);
+                CBlockHeader header;
+                try {
+                    file >> header;
+                    fseek(file.Get(), postx.nTxOffset, SEEK_CUR);
+                    file >> txOut;
+                } catch (const std::exception& e) {
+                    return error("%s: Deserialize or I/O error - %s", __func__, e.what());
+                }
+                hashBlock = header.GetHash();
+                if (txOut.GetHash() != hash)
+                    return error("%s: txid mismatch", __func__);
+                return true;
+            }
+
+            // transaction not found in index, nothing more can be done
+            return false;
+        }
+
+        if (fAllowSlow) { // use coin database to locate block that contains transaction, and scan it
+            int nHeight = -1;
+            {
+                CCoinsViewCache &view = *pcoinsTip;
+                const CCoins* coins = view.AccessCoins(hash);
+                if (coins)
+                    nHeight = coins->nHeight;
+            }
+            if (nHeight > 0)
+                pindexSlow = chainActive[nHeight];
+        }
+    }
+
+    if (pindexSlow) {
+        CBlock block;
+        if (ReadBlockFromDisk(block, pindexSlow, consensusParams)) {
+            for (const CTransaction &tx : block.vtx) {
+                if (tx.GetHash() == hash) {
+                    txOut = tx;
+                    hashBlock = pindexSlow->GetBlockHash();
+                    return true;
+                }
+            }
+        }
+    }
+
+    return false;
+}
+
+//////////////////////////////////////////////////////////////////////////////
+//
+// CBlock and CBlockIndex
+//
+
+bool WriteBlockToDisk(const CBlock& block, CDiskBlockPos& pos, const CMessageHeader::MessageStartChars& messageStart)
+{
+    // Open history file to append
+    CAutoFile fileout(OpenBlockFile(pos), SER_DISK, CLIENT_VERSION);
+    if (fileout.IsNull())
+        return error("WriteBlockToDisk: OpenBlockFile failed");
+
+    // Write index header
+    unsigned int nSize = GetSerializeSize(fileout, block);
+    fileout << FLATDATA(messageStart) << nSize;
+
+    // Write block
+    long fileOutPos = ftell(fileout.Get());
+    if (fileOutPos < 0)
+        return error("WriteBlockToDisk: ftell failed");
+    pos.nPos = (unsigned int)fileOutPos;
+    fileout << block;
+
+    return true;
+}
+
+bool ReadBlockFromDisk(CBlock& block, const CDiskBlockPos& pos, const Consensus::Params& consensusParams)
+{
+    block.SetNull();
+
+    // Open history file to read
+    CAutoFile filein(OpenBlockFile(pos, true), SER_DISK, CLIENT_VERSION);
+    if (filein.IsNull())
+        return error("ReadBlockFromDisk: OpenBlockFile failed for %s", pos.ToString());
+
+    // Read block
+    try {
+        filein >> block;
+    }
+    catch (const std::exception& e) {
+        return error("%s: Deserialize or I/O error - %s at %s", __func__, e.what(), pos.ToString());
+    }
+
+    // Check the header
+    if (!(CheckEquihashSolution(&block, consensusParams) &&
+          CheckProofOfWork(block.GetHash(), block.nBits, consensusParams)))
+        return error("ReadBlockFromDisk: Errors in block header at %s", pos.ToString());
+
+    return true;
+}
+
+bool ReadBlockFromDisk(CBlock& block, const CBlockIndex* pindex, const Consensus::Params& consensusParams)
+{
+    if (!ReadBlockFromDisk(block, pindex->GetBlockPos(), consensusParams))
+        return false;
+    if (block.GetHash() != pindex->GetBlockHash())
+        return error("ReadBlockFromDisk(CBlock&, CBlockIndex*): GetHash() doesn't match index for %s at %s",
+                pindex->ToString(), pindex->GetBlockPos().ToString());
+    return true;
+}
+
+CAmount GetBlockSubsidy(int nHeight, const Consensus::Params& consensusParams)
+{
+    CAmount nSubsidy = 12.5 * COIN;
+
+    // Mining slow start
+    // The subsidy is ramped up linearly, skipping the middle payout of
+    // MAX_SUBSIDY/2 to keep the monetary curve consistent with no slow start.
+    if (nHeight < consensusParams.SubsidySlowStartShift()) {
+        nSubsidy /= consensusParams.nSubsidySlowStartInterval;
+        nSubsidy *= nHeight;
+        return nSubsidy;
+    } else if (nHeight < consensusParams.nSubsidySlowStartInterval) {
+        nSubsidy /= consensusParams.nSubsidySlowStartInterval;
+        nSubsidy *= (nHeight+1);
+        return nSubsidy;
+    }
+
+    assert(nHeight >= consensusParams.SubsidySlowStartShift());
+
+    int halvings = consensusParams.Halving(nHeight);
+
+    // Force block reward to zero when right shift is undefined.
+    if (halvings >= 64)
+        return 0;
+
+    // zip208
+    // BlockSubsidy(height) :=
+    // SlowStartRate · height, if height < SlowStartInterval / 2
+    // SlowStartRate · (height + 1), if SlowStartInterval / 2 ≤ height and height < SlowStartInterval
+    // floor(MaxBlockSubsidy / 2^Halving(height)), if SlowStartInterval ≤ height and not IsBlossomActivated(height)
+    // floor(MaxBlockSubsidy / (BlossomPoWTargetSpacingRatio · 2^Halving(height))), otherwise
+    if (consensusParams.NetworkUpgradeActive(nHeight, Consensus::UPGRADE_BLOSSOM)) {
+        return (nSubsidy / Consensus::BLOSSOM_POW_TARGET_SPACING_RATIO) >> halvings;
+    } else {
+        // Subsidy is cut in half every 840,000 blocks which will occur approximately every 4 years.
+        return nSubsidy >> halvings;
+    }
+}
+
+static std::atomic<bool> IBDLatchToFalse{false};
+// testing-only, allow initial block down state to be set or reset
+bool TestSetIBD(bool ibd) {
+    bool ret = !IBDLatchToFalse;
+    IBDLatchToFalse.store(!ibd, std::memory_order_relaxed);
+    return ret;
+}
+
+bool IsInitialBlockDownload(const Consensus::Params& params)
+{
+    // Once this function has returned false, it must remain false.
+    // Optimization: pre-test latch before taking the lock.
+    if (IBDLatchToFalse.load(std::memory_order_relaxed))
+        return false;
+
+    LOCK(cs_main);
+    if (IBDLatchToFalse.load(std::memory_order_relaxed))
+        return false;
+    if (fImporting || fReindex)
+        return true;
+    if (chainActive.Tip() == NULL)
+        return true;
+    if (chainActive.Tip()->nChainWork < UintToArith256(params.nMinimumChainWork))
+        return true;
+    // Don't bother checking Sprout, it is always active.
+    for (int idx = Consensus::BASE_SPROUT + 1; idx < Consensus::MAX_NETWORK_UPGRADES; idx++) {
+        // If we expect a particular activation block hash, and either the upgrade is not
+        // active or it doesn't match the block at that height on the current chain, then
+        // we are not on the correct chain. As we have already checked that the current
+        // chain satisfies the minimum chain work, this is likely an adversarial situation
+        // where the node is being fed a fake alternate chain; shut down for safety.
+        //
+        // Note that this depends on the assumption that if we set hashActivationBlock for
+        // any upgrade, we also update nMinimumChainWork to be past that upgrade.
+        //
+        auto upgrade = params.vUpgrades[idx];
+        if (upgrade.hashActivationBlock) {
+            if (!params.NetworkUpgradeActive(chainActive.Height(), Consensus::UpgradeIndex(idx))) {
+                AbortNode(
+                    strprintf(
+                        "%s: We are on a chain with sufficient work, but the %s network upgrade has not activated as expected.\n"
+                        "Likely adversarial condition; shutting down for safety.\n"
+                        "  nChainWork=%s\n  nMinimumChainWork=%s\n  tip height=%d\n  upgrade height=%d",
+                        __func__,
+                        NetworkUpgradeInfo[idx].strName,
+                        chainActive.Tip()->nChainWork.GetHex(),
+                        params.nMinimumChainWork.GetHex(),
+                        chainActive.Height(),
+                        upgrade.nActivationHeight),
+                    _("We are on a chain with sufficient work, but an expected network upgrade has not activated. Your node may be under attack! Shutting down for safety."));
+                return true;
+            }
+
+            // If an upgrade is active, we must be past its activation height.
+            assert(chainActive[upgrade.nActivationHeight]);
+
+            if (chainActive[upgrade.nActivationHeight]->GetBlockHash() != upgrade.hashActivationBlock.value()) {
+                AbortNode(
+                    strprintf(
+                        "%s: We are on a chain with sufficient work, but the activation block hash for the %s network upgrade is not as expected.\n"
+                        "Likely adversarial condition; shutting down for safety.\n",
+                        "  nChainWork=%s\n  nMinimumChainWork=%s\n  tip height=%d\n  upgrade height=%d\n  expected hash=%s\n  actual hash=%s",
+                        __func__,
+                        NetworkUpgradeInfo[idx].strName,
+                        chainActive.Tip()->nChainWork.GetHex(),
+                        params.nMinimumChainWork.GetHex(),
+                        chainActive.Height(),
+                        upgrade.nActivationHeight,
+                        upgrade.hashActivationBlock.value().GetHex(),
+                        chainActive[upgrade.nActivationHeight]->GetBlockHash().GetHex()),
+                    _("We are on a chain with sufficient work, but the network upgrade checkpoints do not match. Your node may be under attack! Shutting down for safety."));
+                return true;
+            }
+        }
+    }
+    if (chainActive.Tip()->GetBlockTime() < (GetTime() - nMaxTipAge))
+        return true;
+    LogPrintf("Leaving InitialBlockDownload (latching to false)\n");
+    IBDLatchToFalse.store(true, std::memory_order_relaxed);
+    return false;
+}
+
+static CBlockIndex *pindexBestForkTip = NULL;
+static CBlockIndex *pindexBestForkBase = NULL;
+
+void CheckForkWarningConditions(const Consensus::Params& params)
+{
+    AssertLockHeld(cs_main);
+    // Before we get past initial download, we cannot reliably alert about forks
+    // (we assume we don't get stuck on a fork before finishing our initial sync)
+    if (IsInitialBlockDownload(params))
+        return;
+
+    // If our best fork is no longer within 288 blocks (+/- 12 hours if no one mines it)
+    // of our head, drop it
+    if (pindexBestForkTip && chainActive.Height() - pindexBestForkTip->nHeight >= 288)
+        pindexBestForkTip = NULL;
+
+    if (pindexBestForkTip || (pindexBestInvalid && pindexBestInvalid->nChainWork > chainActive.Tip()->nChainWork + (GetBlockProof(*chainActive.Tip()) * 6)))
+    {
+        if (!GetfLargeWorkForkFound() && pindexBestForkBase)
+        {
+            std::string warning = std::string("'Warning: Large-work fork detected, forking after block ") +
+                pindexBestForkBase->phashBlock->ToString() + std::string("'");
+            CAlert::Notify(warning, true);
+        }
+        if (pindexBestForkTip && pindexBestForkBase)
+        {
+            LogPrintf("%s: Warning: Large valid fork found\n  forking the chain at height %d (%s)\n  lasting to height %d (%s).\nChain state database corruption likely.\n", __func__,
+                   pindexBestForkBase->nHeight, pindexBestForkBase->phashBlock->ToString(),
+                   pindexBestForkTip->nHeight, pindexBestForkTip->phashBlock->ToString());
+            SetfLargeWorkForkFound(true);
+        }
+        else
+        {
+            std::string warning = std::string("Warning: Found invalid chain at least ~6 blocks longer than our best chain.\nChain state database corruption likely.");
+            LogPrintf("%s: %s\n", warning.c_str(), __func__);
+            CAlert::Notify(warning, true);
+            SetfLargeWorkInvalidChainFound(true);
+        }
+    }
+    else
+    {
+        SetfLargeWorkForkFound(false);
+        SetfLargeWorkInvalidChainFound(false);
+    }
+}
+
+void CheckForkWarningConditionsOnNewFork(CBlockIndex* pindexNewForkTip, const CChainParams& chainParams)
+{
+    AssertLockHeld(cs_main);
+    // If we are on a fork that is sufficiently large, set a warning flag
+    CBlockIndex* pfork = pindexNewForkTip;
+    CBlockIndex* plonger = chainActive.Tip();
+    while (pfork && pfork != plonger)
+    {
+        while (plonger && plonger->nHeight > pfork->nHeight)
+            plonger = plonger->pprev;
+        if (pfork == plonger)
+            break;
+        pfork = pfork->pprev;
+    }
+
+    // We define a condition where we should warn the user about as a fork of at least 7 blocks
+    // with a tip within 72 blocks (+/- 3 hours if no one mines it) of ours
+    // We use 7 blocks rather arbitrarily as it represents just under 10% of sustained network
+    // hash rate operating on the fork.
+    // or a chain that is entirely longer than ours and invalid (note that this should be detected by both)
+    // We define it this way because it allows us to only store the highest fork tip (+ base) which meets
+    // the 7-block condition and from this always have the most-likely-to-cause-warning fork
+    if (pfork && (!pindexBestForkTip || (pindexBestForkTip && pindexNewForkTip->nHeight > pindexBestForkTip->nHeight)) &&
+            pindexNewForkTip->nChainWork - pfork->nChainWork > (GetBlockProof(*pfork) * 7) &&
+            chainActive.Height() - pindexNewForkTip->nHeight < 72)
+    {
+        pindexBestForkTip = pindexNewForkTip;
+        pindexBestForkBase = pfork;
+    }
+
+    CheckForkWarningConditions(chainParams.GetConsensus());
+}
+
+// Requires cs_main.
+void Misbehaving(NodeId pnode, int howmuch)
+{
+    if (howmuch == 0)
+        return;
+
+    CNodeState *state = State(pnode);
+    if (state == NULL)
+        return;
+
+    state->nMisbehavior += howmuch;
+    int banscore = GetArg("-banscore", DEFAULT_BANSCORE_THRESHOLD);
+    if (state->nMisbehavior >= banscore && state->nMisbehavior - howmuch < banscore)
+    {
+        LogPrintf("%s: %s (%d -> %d) BAN THRESHOLD EXCEEDED\n", __func__, state->name, state->nMisbehavior-howmuch, state->nMisbehavior);
+        state->fShouldBan = true;
+    } else
+        LogPrintf("%s: %s (%d -> %d)\n", __func__, state->name, state->nMisbehavior-howmuch, state->nMisbehavior);
+}
+
+void static InvalidChainFound(CBlockIndex* pindexNew, const CChainParams& chainParams)
+{
+    if (!pindexBestInvalid || pindexNew->nChainWork > pindexBestInvalid->nChainWork)
+        pindexBestInvalid = pindexNew;
+
+    LogPrintf("%s: invalid block=%s  height=%d  log2_work=%.8g  date=%s\n", __func__,
+      pindexNew->GetBlockHash().ToString(), pindexNew->nHeight,
+      log2(pindexNew->nChainWork.getdouble()), DateTimeStrFormat("%Y-%m-%d %H:%M:%S",
+      pindexNew->GetBlockTime()));
+    CBlockIndex *tip = chainActive.Tip();
+    assert (tip);
+    LogPrintf("%s:  current best=%s  height=%d  log2_work=%.8g  date=%s\n", __func__,
+      tip->GetBlockHash().ToString(), chainActive.Height(), log2(tip->nChainWork.getdouble()),
+      DateTimeStrFormat("%Y-%m-%d %H:%M:%S", tip->GetBlockTime()));
+    CheckForkWarningConditions(chainParams.GetConsensus());
+}
+
+void static InvalidBlockFound(CBlockIndex *pindex, const CValidationState &state, const CChainParams& chainParams) {
+    int nDoS = 0;
+    if (state.IsInvalid(nDoS)) {
+        std::map<uint256, NodeId>::iterator it = mapBlockSource.find(pindex->GetBlockHash());
+        if (it != mapBlockSource.end() && State(it->second)) {
+            assert (state.GetRejectCode() < REJECT_INTERNAL); // Blocks are never rejected with internal reject codes
+            CBlockReject reject = {(unsigned char)state.GetRejectCode(), state.GetRejectReason().substr(0, MAX_REJECT_MESSAGE_LENGTH), pindex->GetBlockHash()};
+            State(it->second)->rejects.push_back(reject);
+            if (nDoS > 0)
+                Misbehaving(it->second, nDoS);
+        }
+    }
+    if (!state.CorruptionPossible()) {
+        pindex->nStatus |= BLOCK_FAILED_VALID;
+        setDirtyBlockIndex.insert(pindex);
+        setBlockIndexCandidates.erase(pindex);
+        InvalidChainFound(pindex, chainParams);
+    }
+}
+
+void UpdateCoins(const CTransaction& tx, CCoinsViewCache& inputs, CTxUndo &txundo, int nHeight)
+{
+    // mark inputs spent
+    if (!tx.IsCoinBase()) {
+        txundo.vprevout.reserve(tx.vin.size());
+        for (const CTxIn &txin : tx.vin) {
+            CCoinsModifier coins = inputs.ModifyCoins(txin.prevout.hash);
+            unsigned nPos = txin.prevout.n;
+
+            if (nPos >= coins->vout.size() || coins->vout[nPos].IsNull())
+                assert(false);
+            // mark an outpoint spent, and construct undo information
+            txundo.vprevout.push_back(CTxInUndo(coins->vout[nPos]));
+            coins->Spend(nPos);
+            if (coins->vout.size() == 0) {
+                CTxInUndo& undo = txundo.vprevout.back();
+                undo.nHeight = coins->nHeight;
+                undo.fCoinBase = coins->fCoinBase;
+                undo.nVersion = coins->nVersion;
+            }
+        }
+    }
+
+    // spend nullifiers
+    inputs.SetNullifiers(tx, true);
+
+    // add outputs
+    inputs.ModifyNewCoins(tx.GetHash())->FromTx(tx, nHeight);
+}
+
+void UpdateCoins(const CTransaction& tx, CCoinsViewCache& inputs, int nHeight)
+{
+    CTxUndo txundo;
+    UpdateCoins(tx, inputs, txundo, nHeight);
+}
+
+bool CScriptCheck::operator()() {
+    const CScript &scriptSig = ptxTo->vin[nIn].scriptSig;
+    if (!VerifyScript(scriptSig, scriptPubKey, nFlags, CachingTransactionSignatureChecker(ptxTo, *txdata, nIn, amount, cacheStore), consensusBranchId, &error)) {
+        return false;
+    }
+    return true;
+}
+
+int GetSpendHeight(const CCoinsViewCache& inputs)
+{
+    LOCK(cs_main);
+    CBlockIndex* pindexPrev = mapBlockIndex.find(inputs.GetBestBlock())->second;
+    return pindexPrev->nHeight + 1;
+}
+
+namespace Consensus {
+bool CheckTxShieldedInputs(
+    const CTransaction& tx,
+    CValidationState& state,
+    const CCoinsViewCache& view,
+    int dosLevel)
+{
+    // Are the shielded spends' requirements met?
+    auto unmetShieldedReq = view.HaveShieldedRequirements(tx);
+    if (unmetShieldedReq) {
+        auto txid = tx.GetHash().ToString();
+        auto rejectCode = ShieldedReqRejectCode(*unmetShieldedReq);
+        auto rejectReason = ShieldedReqRejectReason(*unmetShieldedReq);
+        TracingError(
+            "main", "CheckTxShieldedInputs(): shielded requirements not met",
+            "txid", txid.c_str(),
+            "reason", rejectReason.c_str());
+        return state.DoS(dosLevel, false, rejectCode, rejectReason);
+    }
+
+    return true;
+}
+
+bool CheckTxInputs(const CTransaction& tx, CValidationState& state, const CCoinsViewCache& inputs, int nSpendHeight, const Consensus::Params& consensusParams)
+{
+    assert(!tx.IsCoinBase());
+
+    // Indented to reduce conflicts with upstream.
+    {
+        // This doesn't trigger the DoS code on purpose; if it did, it would make it easier
+        // for an attacker to attempt to split the network.
+        if (!inputs.HaveInputs(tx))
+            return state.Invalid(false, 0, "", "Inputs unavailable");
+
+        CAmount nValueIn = 0;
+        CAmount nFees = 0;
+        for (unsigned int i = 0; i < tx.vin.size(); i++)
+        {
+            const COutPoint &prevout = tx.vin[i].prevout;
+            const CCoins *coins = inputs.AccessCoins(prevout.hash);
+            assert(coins);
+
+            if (coins->IsCoinBase()) {
+                // Ensure that coinbases are matured
+                if (nSpendHeight - coins->nHeight < COINBASE_MATURITY) {
+                    return state.Invalid(false,
+                        REJECT_INVALID, "bad-txns-premature-spend-of-coinbase",
+                        strprintf("tried to spend coinbase at depth %d", nSpendHeight - coins->nHeight));
+                }
+
+                // Ensure that coinbases cannot be spent to transparent outputs
+                // Disabled on regtest
+                if (fCoinbaseEnforcedShieldingEnabled &&
+                    consensusParams.fCoinbaseMustBeShielded &&
+                    !tx.vout.empty()) {
+                    return state.Invalid(
+                        error("CheckInputs(): tried to spend coinbase with transparent outputs"),
+                        REJECT_INVALID, "bad-txns-coinbase-spend-has-transparent-outputs");
+                }
+            }
+
+            // Check for negative or overflow input values
+            nValueIn += coins->vout[prevout.n].nValue;
+            if (!MoneyRange(coins->vout[prevout.n].nValue) || !MoneyRange(nValueIn))
+                return state.DoS(100, false, REJECT_INVALID, "bad-txns-inputvalues-outofrange");
+
+        }
+
+        nValueIn += tx.GetShieldedValueIn();
+        if (!MoneyRange(nValueIn))
+            return state.DoS(100, error("CheckInputs(): shielded input to transparent value pool out of range"),
+                             REJECT_INVALID, "bad-txns-inputvalues-outofrange");
+
+        if (nValueIn < tx.GetValueOut())
+            return state.DoS(100, false, REJECT_INVALID, "bad-txns-in-belowout", false,
+                strprintf("value in (%s) < value out (%s)", FormatMoney(nValueIn), FormatMoney(tx.GetValueOut())));
+
+        // Tally transaction fees
+        CAmount nTxFee = nValueIn - tx.GetValueOut();
+        if (nTxFee < 0)
+            return state.DoS(100, false, REJECT_INVALID, "bad-txns-fee-negative");
+        nFees += nTxFee;
+        if (!MoneyRange(nFees))
+            return state.DoS(100, false, REJECT_INVALID, "bad-txns-fee-outofrange");
+    }
+    return true;
+}
+}// namespace Consensus
+
+bool ContextualCheckInputs(
+    const CTransaction& tx,
+    CValidationState &state,
+    const CCoinsViewCache &inputs,
+    bool fScriptChecks,
+    unsigned int flags,
+    bool cacheStore,
+    PrecomputedTransactionData& txdata,
+    const Consensus::Params& consensusParams,
+    uint32_t consensusBranchId,
+    std::vector<CScriptCheck> *pvChecks)
+{
+    if (!tx.IsCoinBase())
+    {
+        if (!Consensus::CheckTxInputs(tx, state, inputs, GetSpendHeight(inputs), consensusParams)) {
+            return false;
+        }
+
+        if (pvChecks)
+            pvChecks->reserve(tx.vin.size());
+
+        // The first loop above does all the inexpensive checks.
+        // Only if ALL inputs pass do we perform expensive ECDSA signature checks.
+        // Helps prevent CPU exhaustion attacks.
+
+        // Skip ECDSA signature verification when connecting blocks
+        // before the last block chain checkpoint. This is safe because block merkle hashes are
+        // still computed and checked, and any change will be caught at the next checkpoint.
+        if (fScriptChecks) {
+            for (unsigned int i = 0; i < tx.vin.size(); i++) {
+                const COutPoint &prevout = tx.vin[i].prevout;
+                const CCoins* coins = inputs.AccessCoins(prevout.hash);
+                assert(coins);
+
+                // Verify signature
+                CScriptCheck check(*coins, tx, i, flags, cacheStore, consensusBranchId, &txdata);
+                if (pvChecks) {
+                    pvChecks->push_back(CScriptCheck());
+                    check.swap(pvChecks->back());
+                } else if (!check()) {
+                    // Check whether the failure was caused by an outdated
+                    // consensus branch ID; if so, don't trigger DoS protection
+                    // immediately, and inform the node that they need to
+                    // upgrade. We only check the previous epoch's branch ID, on
+                    // the assumption that users creating transactions will
+                    // notice their transactions failing before a second network
+                    // upgrade occurs.
+                    auto prevConsensusBranchId = PrevEpochBranchId(consensusBranchId, consensusParams);
+                    CScriptCheck checkPrev(*coins, tx, i, flags, cacheStore, prevConsensusBranchId, &txdata);
+                    if (checkPrev()) {
+                        return state.DoS(
+                            10, false, REJECT_INVALID, strprintf(
+                                "old-consensus-branch-id (Expected %s, found %s)",
+                                HexInt(consensusBranchId),
+                                HexInt(prevConsensusBranchId)));
+                    }
+                    if (flags & STANDARD_NOT_MANDATORY_VERIFY_FLAGS) {
+                        // Check whether the failure was caused by a
+                        // non-mandatory script verification check, such as
+                        // non-standard DER encodings or non-null dummy
+                        // arguments; if so, don't trigger DoS protection to
+                        // avoid splitting the network between upgraded and
+                        // non-upgraded nodes.
+                        CScriptCheck check2(*coins, tx, i,
+                                flags & ~STANDARD_NOT_MANDATORY_VERIFY_FLAGS, cacheStore, consensusBranchId, &txdata);
+                        if (check2())
+                            return state.Invalid(false, REJECT_NONSTANDARD, strprintf("non-mandatory-script-verify-flag (%s)", ScriptErrorString(check.GetScriptError())));
+                    }
+                    // Failures of other flags indicate a transaction that is
+                    // invalid in new blocks, e.g. a invalid P2SH. We DoS ban
+                    // such nodes as they are not following the protocol.
+                    return state.DoS(100,false, REJECT_INVALID, strprintf("mandatory-script-verify-flag-failed (%s)", ScriptErrorString(check.GetScriptError())));
+                }
+            }
+        }
+    }
+
+    return true;
+}
+
+namespace {
+
+bool UndoWriteToDisk(const CBlockUndo& blockundo, CDiskBlockPos& pos, const uint256& hashBlock, const CMessageHeader::MessageStartChars& messageStart)
+{
+    // Open history file to append
+    CAutoFile fileout(OpenUndoFile(pos), SER_DISK, CLIENT_VERSION);
+    if (fileout.IsNull())
+        return error("%s: OpenUndoFile failed", __func__);
+
+    // Write index header
+    unsigned int nSize = GetSerializeSize(fileout, blockundo);
+    fileout << FLATDATA(messageStart) << nSize;
+
+    // Write undo data
+    long fileOutPos = ftell(fileout.Get());
+    if (fileOutPos < 0)
+        return error("%s: ftell failed", __func__);
+    pos.nPos = (unsigned int)fileOutPos;
+    fileout << blockundo;
+
+    // calculate & write checksum
+    CHashWriter hasher(SER_GETHASH, PROTOCOL_VERSION);
+    hasher << hashBlock;
+    hasher << blockundo;
+    fileout << hasher.GetHash();
+
+    return true;
+}
+
+bool UndoReadFromDisk(CBlockUndo& blockundo, const CDiskBlockPos& pos, const uint256& hashBlock)
+{
+    // Open history file to read
+    CAutoFile filein(OpenUndoFile(pos, true), SER_DISK, CLIENT_VERSION);
+    if (filein.IsNull())
+        return error("%s: OpenBlockFile failed", __func__);
+
+    // Read block
+    uint256 hashChecksum;
+    try {
+        filein >> blockundo;
+        filein >> hashChecksum;
+    }
+    catch (const std::exception& e) {
+        return error("%s: Deserialize or I/O error - %s", __func__, e.what());
+    }
+
+    // Verify checksum
+    CHashWriter hasher(SER_GETHASH, PROTOCOL_VERSION);
+    hasher << hashBlock;
+    hasher << blockundo;
+    if (hashChecksum != hasher.GetHash())
+        return error("%s: Checksum mismatch", __func__);
+
+    return true;
+}
+
+} // anon namespace
+
+/**
+ * Apply the undo operation of a CTxInUndo to the given chain state.
+ * @param undo The undo object.
+ * @param view The coins view to which to apply the changes.
+ * @param out The out point that corresponds to the tx input.
+ * @return True on success.
+ */
+static bool ApplyTxInUndo(const CTxInUndo& undo, CCoinsViewCache& view, const COutPoint& out)
+{
+    bool fClean = true;
+
+    CCoinsModifier coins = view.ModifyCoins(out.hash);
+    if (undo.nHeight != 0) {
+        // undo data contains height: this is the last output of the prevout tx being spent
+        if (!coins->IsPruned())
+            fClean = fClean && error("%s: undo data overwriting existing transaction", __func__);
+        coins->Clear();
+        coins->fCoinBase = undo.fCoinBase;
+        coins->nHeight = undo.nHeight;
+        coins->nVersion = undo.nVersion;
+    } else {
+        if (coins->IsPruned())
+            fClean = fClean && error("%s: undo data adding output to missing transaction", __func__);
+    }
+    if (coins->IsAvailable(out.n))
+        fClean = fClean && error("%s: undo data overwriting existing output", __func__);
+    if (coins->vout.size() < out.n+1)
+        coins->vout.resize(out.n+1);
+    coins->vout[out.n] = undo.txout;
+
+    return fClean;
+}
+
+enum DisconnectResult
+{
+    DISCONNECT_OK,      // All good.
+    DISCONNECT_UNCLEAN, // Rolled back, but UTXO set was inconsistent with block.
+    DISCONNECT_FAILED   // Something else went wrong.
+};
+
+/** Undo the effects of this block (with given index) on the UTXO set represented by coins.
+ *  When UNCLEAN or FAILED is returned, view is left in an indeterminate state.
+ *  The addressIndex and spentIndex will be updated if requested.
+ */
+static DisconnectResult DisconnectBlock(const CBlock& block, CValidationState& state,
+    const CBlockIndex* pindex, CCoinsViewCache& view, const CChainParams& chainparams,
+    const bool updateIndices)
+{
+    assert(pindex->GetBlockHash() == view.GetBestBlock());
+
+    bool fClean = true;
+
+    CBlockUndo blockUndo;
+    CDiskBlockPos pos = pindex->GetUndoPos();
+    if (pos.IsNull()) {
+        error("DisconnectBlock(): no undo data available");
+        return DISCONNECT_FAILED;
+    }
+    if (!UndoReadFromDisk(blockUndo, pos, pindex->pprev->GetBlockHash())) {
+        error("DisconnectBlock(): failure reading undo data");
+        return DISCONNECT_FAILED;
+    }
+
+    if (blockUndo.vtxundo.size() + 1 != block.vtx.size()) {
+        error("DisconnectBlock(): block and undo data inconsistent");
+        return DISCONNECT_FAILED;
+    }
+    std::vector<CAddressIndexDbEntry> addressIndex;
+    std::vector<CAddressUnspentDbEntry> addressUnspentIndex;
+    std::vector<CSpentIndexDbEntry> spentIndex;
+
+    // undo transactions in reverse order
+    for (int i = block.vtx.size() - 1; i >= 0; i--) {
+        const CTransaction &tx = block.vtx[i];
+        uint256 const hash = tx.GetHash();
+
+        // insightexplorer
+        // https://github.com/bitpay/bitcoin/commit/017f548ea6d89423ef568117447e61dd5707ec42#diff-7ec3c68a81efff79b6ca22ac1f1eabbaR2236
+        if (fAddressIndex && updateIndices) {
+            for (unsigned int k = tx.vout.size(); k-- > 0;) {
+                const CTxOut &out = tx.vout[k];
+                CScript::ScriptType scriptType = out.scriptPubKey.GetType();
+                if (scriptType != CScript::UNKNOWN) {
+                    uint160 const addrHash = out.scriptPubKey.AddressHash();
+
+                    // undo receiving activity
+                    addressIndex.push_back(make_pair(
+                        CAddressIndexKey(scriptType, addrHash, pindex->nHeight, i, hash, k, false),
+                        out.nValue));
+
+                    // undo unspent index
+                    addressUnspentIndex.push_back(make_pair(
+                        CAddressUnspentKey(scriptType, addrHash, hash, k),
+                        CAddressUnspentValue()));
+                }
+            }
+        }
+
+        // Check that all outputs are available and match the outputs in the block itself
+        // exactly.
+        {
+        CCoinsModifier outs = view.ModifyCoins(hash);
+        outs->ClearUnspendable();
+
+        CCoins outsBlock(tx, pindex->nHeight);
+        // The CCoins serialization does not serialize negative numbers.
+        // No network rules currently depend on the version here, so an inconsistency is harmless
+        // but it must be corrected before txout nversion ever influences a network rule.
+        if (outsBlock.nVersion < 0)
+            outs->nVersion = outsBlock.nVersion;
+        if (*outs != outsBlock)
+            fClean = fClean && error("DisconnectBlock(): added transaction mismatch? database corrupted");
+
+        // remove outputs
+        outs->Clear();
+        }
+
+        // unspend nullifiers
+        view.SetNullifiers(tx, false);
+
+        // restore inputs
+        if (i > 0) { // not coinbases
+            const CTxUndo &txundo = blockUndo.vtxundo[i-1];
+            if (txundo.vprevout.size() != tx.vin.size()) {
+                error("DisconnectBlock(): transaction and undo data inconsistent");
+                return DISCONNECT_FAILED;
+            }
+            for (unsigned int j = tx.vin.size(); j-- > 0;) {
+                const COutPoint &out = tx.vin[j].prevout;
+                const CTxInUndo &undo = txundo.vprevout[j];
+                if (!ApplyTxInUndo(undo, view, out))
+                    fClean = false;
+
+                // insightexplorer
+                // https://github.com/bitpay/bitcoin/commit/017f548ea6d89423ef568117447e61dd5707ec42#diff-7ec3c68a81efff79b6ca22ac1f1eabbaR2304
+                const CTxIn input = tx.vin[j];
+                if (fAddressIndex && updateIndices) {
+                    const CTxOut &prevout = view.GetOutputFor(input);
+                    CScript::ScriptType scriptType = prevout.scriptPubKey.GetType();
+                    if (scriptType != CScript::UNKNOWN) {
+                        uint160 const addrHash = prevout.scriptPubKey.AddressHash();
+
+                        // undo spending activity
+                        addressIndex.push_back(make_pair(
+                            CAddressIndexKey(scriptType, addrHash, pindex->nHeight, i, hash, j, true),
+                            prevout.nValue * -1));
+
+                        // restore unspent index
+                        addressUnspentIndex.push_back(make_pair(
+                            CAddressUnspentKey(scriptType, addrHash, input.prevout.hash, input.prevout.n),
+                            CAddressUnspentValue(prevout.nValue, prevout.scriptPubKey, undo.nHeight)));
+                    }
+                }
+                // insightexplorer
+                if (fSpentIndex && updateIndices) {
+                    // undo and delete the spent index
+                    spentIndex.push_back(make_pair(
+                        CSpentIndexKey(input.prevout.hash, input.prevout.n),
+                        CSpentIndexValue()));
+                }
+            }
+        }
+    }
+
+    // set the old best Sprout anchor back
+    view.PopAnchor(blockUndo.old_sprout_tree_root, SPROUT);
+
+    // set the old best Sapling anchor back
+    // We can get this from the `hashFinalSaplingRoot` of the last block
+    // However, this is only reliable if the last block was on or after
+    // the Sapling activation height. Otherwise, the last anchor was the
+    // empty root.
+    if (chainparams.GetConsensus().NetworkUpgradeActive(pindex->pprev->nHeight, Consensus::UPGRADE_SAPLING)) {
+        view.PopAnchor(pindex->pprev->hashFinalSaplingRoot, SAPLING);
+    } else {
+        view.PopAnchor(SaplingMerkleTree::empty_root(), SAPLING);
+    }
+
+    // Set the old best Orchard anchor back. We can get this from the
+    // `hashFinalOrchardRoot` of the last block. However, if the last
+    // block was not on or after the Orchard activation height, this
+    // will be set to `null`. For logical consistency, in this case we
+    // set the last anchor to the empty root.
+    if (chainparams.GetConsensus().NetworkUpgradeActive(pindex->pprev->nHeight, Consensus::UPGRADE_NU5)) {
+        view.PopAnchor(pindex->pprev->hashFinalOrchardRoot, ORCHARD);
+    } else {
+        view.PopAnchor(OrchardMerkleFrontier::empty_root(), ORCHARD);
+    }
+
+    // This is guaranteed to be filled by LoadBlockIndex.
+    assert(pindex->nCachedBranchId);
+    auto consensusBranchId = pindex->nCachedBranchId.value();
+
+    if (chainparams.GetConsensus().NetworkUpgradeActive(pindex->nHeight, Consensus::UPGRADE_HEARTWOOD)) {
+        view.PopHistoryNode(consensusBranchId);
+    }
+
+    // move best block pointer to prevout block
+    view.SetBestBlock(pindex->pprev->GetBlockHash());
+
+    // insightexplorer
+    if (fAddressIndex && updateIndices) {
+        if (!pblocktree->EraseAddressIndex(addressIndex)) {
+            AbortNode(state, "Failed to delete address index");
+            return DISCONNECT_FAILED;
+        }
+        if (!pblocktree->UpdateAddressUnspentIndex(addressUnspentIndex)) {
+            AbortNode(state, "Failed to write address unspent index");
+            return DISCONNECT_FAILED;
+        }
+    }
+    // insightexplorer
+    if (fSpentIndex && updateIndices) {
+        if (!pblocktree->UpdateSpentIndex(spentIndex)) {
+            AbortNode(state, "Failed to write transaction index");
+            return DISCONNECT_FAILED;
+        }
+    }
+    return fClean ? DISCONNECT_OK : DISCONNECT_UNCLEAN;
+}
+
+void static FlushBlockFile(bool fFinalize = false)
+{
+    LOCK(cs_LastBlockFile);
+
+    CDiskBlockPos posOld(nLastBlockFile, 0);
+
+    FILE *fileOld = OpenBlockFile(posOld);
+    if (fileOld) {
+        if (fFinalize)
+            TruncateFile(fileOld, vinfoBlockFile[nLastBlockFile].nSize);
+        FileCommit(fileOld);
+        fclose(fileOld);
+    }
+
+    fileOld = OpenUndoFile(posOld);
+    if (fileOld) {
+        if (fFinalize)
+            TruncateFile(fileOld, vinfoBlockFile[nLastBlockFile].nUndoSize);
+        FileCommit(fileOld);
+        fclose(fileOld);
+    }
+}
+
+bool FindUndoPos(CValidationState &state, int nFile, CDiskBlockPos &pos, unsigned int nAddSize);
+
+static CCheckQueue<CScriptCheck> scriptcheckqueue(128);
+
+void ThreadScriptCheck() {
+    RenameThread("zcash-scriptch");
+    scriptcheckqueue.Thread();
+}
+
+static int64_t nTimeVerify = 0;
+static int64_t nTimeConnect = 0;
+static int64_t nTimeIndex = 0;
+static int64_t nTimeCallbacks = 0;
+static int64_t nTimeTotal = 0;
+
+/**
+ * Determine whether to do transaction checks when verifying blocks.
+ * Returns `false` (allowing transaction checks to be skipped) only if all
+ * of the following are true:
+ *   - we're currently in initial block download
+ *   - the `-ibdskiptxverification` flag is set
+ *   - the block under inspection is an ancestor of the latest checkpoint.
+ */
+static bool ShouldCheckTransactions(const CChainParams& chainparams, const CBlockIndex* pindex) {
+    return !(fIBDSkipTxVerification
+             && fCheckpointsEnabled
+             && IsInitialBlockDownload(chainparams.GetConsensus())
+             && Checkpoints::IsAncestorOfLastCheckpoint(chainparams.Checkpoints(), pindex));
+}
+
+bool ConnectBlock(const CBlock& block, CValidationState& state, CBlockIndex* pindex,
+                  CCoinsViewCache& view, const CChainParams& chainparams,
+                  bool fJustCheck, bool fCheckAuthDataRoot)
+{
+    AssertLockHeld(cs_main);
+
+    bool fExpensiveChecks = true;
+
+    // If this block is an ancestor of a checkpoint, disable expensive checks
+    if (fCheckpointsEnabled && Checkpoints::IsAncestorOfLastCheckpoint(chainparams.Checkpoints(), pindex)) {
+        fExpensiveChecks = false;
+    }
+
+    // proof verification is expensive, disable if possible
+    auto verifier = fExpensiveChecks ? ProofVerifier::Strict() : ProofVerifier::Disabled();
+
+    // Disable Orchard batch signature validation if possible.
+    auto orchardAuth = fExpensiveChecks ?
+        orchard::AuthValidator::Batch() : orchard::AuthValidator::Disabled();
+
+    // If in initial block download, and this block is an ancestor of a checkpoint,
+    // and -ibdskiptxverification is set, disable all transaction checks.
+    bool fCheckTransactions = ShouldCheckTransactions(chainparams, pindex);
+
+    // Check it again to verify JoinSplit proofs, and in case a previous version let a bad block in
+    if (!CheckBlock(block, state, chainparams, verifier,
+        !fJustCheck, !fJustCheck, fCheckTransactions))
+    {
+        return false;
+    }
+
+    // verify that the view's current state corresponds to the previous block
+    uint256 hashPrevBlock = pindex->pprev == NULL ? uint256() : pindex->pprev->GetBlockHash();
+    assert(hashPrevBlock == view.GetBestBlock());
+
+    // Special case for the genesis block, skipping connection of its transactions
+    // (its coinbase is unspendable)
+    if (block.GetHash() == chainparams.GetConsensus().hashGenesisBlock) {
+        if (!fJustCheck) {
+            view.SetBestBlock(pindex->GetBlockHash());
+            // Before the genesis block, there was an empty tree
+            SproutMerkleTree tree;
+            pindex->hashSproutAnchor = tree.root();
+            // The genesis block contained no JoinSplits
+            pindex->hashFinalSproutRoot = pindex->hashSproutAnchor;
+        }
+        return true;
+    }
+
+    // Reject a block that results in a negative shielded value pool balance.
+    if (chainparams.ZIP209Enabled()) {
+        // Sprout
+        //
+        // We can expect nChainSproutValue to be valid after the hardcoded
+        // height, and this will be enforced on all descendant blocks. If
+        // the node was reindexed then this will be enforced for all blocks.
+        if (pindex->nChainSproutValue) {
+            if (*pindex->nChainSproutValue < 0) {
+                return state.DoS(100, error("ConnectBlock(): turnstile violation in Sprout shielded value pool"),
+                             REJECT_INVALID, "turnstile-violation-sprout-shielded-pool");
+            }
+        }
+
+        // Sapling
+        //
+        // If we've reached ConnectBlock, we have all transactions of
+        // parents and can expect nChainSaplingValue not to be std::nullopt.
+        // However, the miner and mining RPCs may not have populated this
+        // value and will call `TestBlockValidity`. So, we act
+        // conditionally.
+        if (pindex->nChainSaplingValue) {
+            if (*pindex->nChainSaplingValue < 0) {
+                return state.DoS(100, error("ConnectBlock(): turnstile violation in Sapling shielded value pool"),
+                             REJECT_INVALID, "turnstile-violation-sapling-shielded-pool");
+            }
+        }
+
+        // Orchard
+        //
+        // If we've reached ConnectBlock, we have all transactions of
+        // parents and can expect nChainOrchardValue not to be std::nullopt.
+        // However, the miner and mining RPCs may not have populated this
+        // value and will call `TestBlockValidity`. So, we act
+        // conditionally.
+        if (pindex->nChainOrchardValue) {
+            if (*pindex->nChainOrchardValue < 0) {
+                return state.DoS(100, error("ConnectBlock(): turnstile violation in Orchard shielded value pool"),
+                                 REJECT_INVALID, "turnstile-violation-orchard");
+            }
+        }
+    }
+
+    // Do not allow blocks that contain transactions which 'overwrite' older transactions,
+    // unless those are already completely spent.
+    for (const CTransaction& tx : block.vtx) {
+        const CCoins* coins = view.AccessCoins(tx.GetHash());
+        if (coins && !coins->IsPruned())
+            return state.DoS(100, error("ConnectBlock(): tried to overwrite transaction"),
+                             REJECT_INVALID, "bad-txns-BIP30");
+    }
+
+    unsigned int flags = SCRIPT_VERIFY_P2SH | SCRIPT_VERIFY_CHECKLOCKTIMEVERIFY;
+
+    // DERSIG (BIP66) is also always enforced, but does not have a flag.
+
+    CBlockUndo blockundo;
+
+    CCheckQueueControl<CScriptCheck> control(fExpensiveChecks && nScriptCheckThreads ? &scriptcheckqueue : NULL);
+
+    int64_t nTimeStart = GetTimeMicros();
+    CAmount nFees = 0;
+    int nInputs = 0;
+    unsigned int nSigOps = 0;
+    CDiskTxPos pos(pindex->GetBlockPos(), GetSizeOfCompactSize(block.vtx.size()));
+    std::vector<std::pair<uint256, CDiskTxPos> > vPos;
+    vPos.reserve(block.vtx.size());
+    blockundo.vtxundo.reserve(block.vtx.size() - 1);
+    std::vector<CAddressIndexDbEntry> addressIndex;
+    std::vector<CAddressUnspentDbEntry> addressUnspentIndex;
+    std::vector<CSpentIndexDbEntry> spentIndex;
+
+    // Construct the incremental merkle tree at the current
+    // block position,
+    auto old_sprout_tree_root = view.GetBestAnchor(SPROUT);
+    // saving the top anchor in the block index as we go.
+    if (!fJustCheck) {
+        pindex->hashSproutAnchor = old_sprout_tree_root;
+    }
+    SproutMerkleTree sprout_tree;
+    // This should never fail: we should always be able to get the root
+    // that is on the tip of our chain
+    assert(view.GetSproutAnchorAt(old_sprout_tree_root, sprout_tree));
+    {
+        // Consistency check: the root of the tree we're given should
+        // match what we asked for.
+        assert(sprout_tree.root() == old_sprout_tree_root);
+    }
+
+    SaplingMerkleTree sapling_tree;
+    assert(view.GetSaplingAnchorAt(view.GetBestAnchor(SAPLING), sapling_tree));
+
+    OrchardMerkleFrontier orchard_tree;
+    if (pindex->pprev && chainparams.GetConsensus().NetworkUpgradeActive(pindex->pprev->nHeight, Consensus::UPGRADE_NU5)) {
+        // Verify that the view's current state corresponds to the previous block.
+        assert(pindex->pprev->hashFinalOrchardRoot == view.GetBestAnchor(ORCHARD));
+        // We only call ConnectBlock() on top of the active chain's tip.
+        assert(!pindex->pprev->hashFinalOrchardRoot.IsNull());
+
+        assert(view.GetOrchardAnchorAt(pindex->pprev->hashFinalOrchardRoot, orchard_tree));
+    } else {
+        if (pindex->pprev) {
+            assert(pindex->pprev->hashFinalOrchardRoot.IsNull());
+        }
+        assert(view.GetOrchardAnchorAt(OrchardMerkleFrontier::empty_root(), orchard_tree));
+    }
+
+    // Grab the consensus branch ID for this block and its parent
+    auto consensusBranchId = CurrentEpochBranchId(pindex->nHeight, chainparams.GetConsensus());
+    auto prevConsensusBranchId = CurrentEpochBranchId(pindex->nHeight - 1, chainparams.GetConsensus());
+
+    size_t total_sapling_tx = 0;
+    size_t total_orchard_tx = 0;
+
+    std::vector<PrecomputedTransactionData> txdata;
+    txdata.reserve(block.vtx.size()); // Required so that pointers to individual PrecomputedTransactionData don't get invalidated
+    for (unsigned int i = 0; i < block.vtx.size(); i++)
+    {
+        const CTransaction &tx = block.vtx[i];
+        const uint256 hash = tx.GetHash();
+
+        nInputs += tx.vin.size();
+        nSigOps += GetLegacySigOpCount(tx);
+        if (nSigOps > MAX_BLOCK_SIGOPS)
+            return state.DoS(100, error("ConnectBlock(): too many sigops"),
+                             REJECT_INVALID, "bad-blk-sigops");
+
+        // Coinbase transactions are the only case where this vector will not be the same
+        // length as `tx.vin` (since coinbase transactions have a single synthetic input).
+        // Only shielded coinbase transactions will need to produce sighashes for coinbase
+        // transactions; this is handled in ZIP 244 by having the coinbase sighash be the
+        // txid.
+        std::vector<CTxOut> allPrevOutputs;
+
+        // Are the shielded spends' requirements met?
+        if (!Consensus::CheckTxShieldedInputs(tx, state, view, 100)) {
+            return false;
+        }
+
+        if (!tx.IsCoinBase())
+        {
+            if (!view.HaveInputs(tx))
+                return state.DoS(100, error("ConnectBlock(): inputs missing/spent"),
+                                 REJECT_INVALID, "bad-txns-inputs-missingorspent");
+
+            for (const auto& input : tx.vin) {
+                allPrevOutputs.push_back(view.GetOutputFor(input));
+            }
+
+            // insightexplorer
+            // https://github.com/bitpay/bitcoin/commit/017f548ea6d89423ef568117447e61dd5707ec42#diff-7ec3c68a81efff79b6ca22ac1f1eabbaR2597
+            if (fAddressIndex || fSpentIndex) {
+                for (size_t j = 0; j < tx.vin.size(); j++) {
+
+                    const CTxIn input = tx.vin[j];
+                    const CTxOut &prevout = allPrevOutputs[j];
+                    CScript::ScriptType scriptType = prevout.scriptPubKey.GetType();
+                    const uint160 addrHash = prevout.scriptPubKey.AddressHash();
+                    if (fAddressIndex && scriptType != CScript::UNKNOWN) {
+                        // record spending activity
+                        addressIndex.push_back(make_pair(
+                            CAddressIndexKey(scriptType, addrHash, pindex->nHeight, i, hash, j, true),
+                            prevout.nValue * -1));
+
+                        // remove address from unspent index
+                        addressUnspentIndex.push_back(make_pair(
+                            CAddressUnspentKey(scriptType, addrHash, input.prevout.hash, input.prevout.n),
+                            CAddressUnspentValue()));
+                    }
+                    if (fSpentIndex) {
+                        // Add the spent index to determine the txid and input that spent an output
+                        // and to find the amount and address from an input.
+                        // If we do not recognize the script type, we still add an entry to the
+                        // spentindex db, with a script type of 0 and addrhash of all zeroes.
+                        spentIndex.push_back(make_pair(
+                            CSpentIndexKey(input.prevout.hash, input.prevout.n),
+                            CSpentIndexValue(hash, j, pindex->nHeight, prevout.nValue, scriptType, addrHash)));
+                    }
+                }
+            }
+
+            // Add in sigops done by pay-to-script-hash inputs;
+            // this is to prevent a "rogue miner" from creating
+            // an incredibly-expensive-to-validate block.
+            nSigOps += GetP2SHSigOpCount(tx, view);
+            if (nSigOps > MAX_BLOCK_SIGOPS)
+                return state.DoS(100, error("ConnectBlock(): too many sigops"),
+                                 REJECT_INVALID, "bad-blk-sigops");
+        }
+
+        txdata.emplace_back(tx, allPrevOutputs);
+
+        if (!tx.IsCoinBase())
+        {
+            nFees += view.GetValueIn(tx)-tx.GetValueOut();
+
+            std::vector<CScriptCheck> vChecks;
+            bool fCacheResults = fJustCheck; /* Don't cache results if we're actually connecting blocks (still consult the cache, though) */
+            if (!ContextualCheckInputs(tx, state, view, fExpensiveChecks, flags, fCacheResults, txdata.back(), chainparams.GetConsensus(), consensusBranchId, nScriptCheckThreads ? &vChecks : NULL))
+                return error("ConnectBlock(): CheckInputs on %s failed with %s",
+                    tx.GetHash().ToString(), FormatStateMessage(state));
+            control.Add(vChecks);
+        }
+
+        // Check shielded inputs.
+        if (!ContextualCheckShieldedInputs(
+            tx,
+            txdata.back(),
+            state,
+            view,
+            orchardAuth,
+            chainparams.GetConsensus(),
+            consensusBranchId,
+            chainparams.GetConsensus().NetworkUpgradeActive(pindex->nHeight, Consensus::UPGRADE_NU5),
+            true))
+        {
+            return error(
+                "ConnectBlock(): ContextualCheckShieldedInputs() on %s failed with %s",
+                tx.GetHash().ToString(),
+                FormatStateMessage(state));
+        }
+
+        // insightexplorer
+        // https://github.com/bitpay/bitcoin/commit/017f548ea6d89423ef568117447e61dd5707ec42#diff-7ec3c68a81efff79b6ca22ac1f1eabbaR2656
+        if (fAddressIndex) {
+            for (unsigned int k = 0; k < tx.vout.size(); k++) {
+                const CTxOut &out = tx.vout[k];
+                CScript::ScriptType scriptType = out.scriptPubKey.GetType();
+                if (scriptType != CScript::UNKNOWN) {
+                    uint160 const addrHash = out.scriptPubKey.AddressHash();
+
+                    // record receiving activity
+                    addressIndex.push_back(make_pair(
+                        CAddressIndexKey(scriptType, addrHash, pindex->nHeight, i, hash, k, false),
+                        out.nValue));
+
+                    // record unspent output
+                    addressUnspentIndex.push_back(make_pair(
+                        CAddressUnspentKey(scriptType, addrHash, hash, k),
+                        CAddressUnspentValue(out.nValue, out.scriptPubKey, pindex->nHeight)));
+                }
+            }
+        }
+
+        CTxUndo undoDummy;
+        if (i > 0) {
+            blockundo.vtxundo.push_back(CTxUndo());
+        }
+        UpdateCoins(tx, view, i == 0 ? undoDummy : blockundo.vtxundo.back(), pindex->nHeight);
+
+        for (const JSDescription &joinsplit : tx.vJoinSplit) {
+            for (const uint256 &note_commitment : joinsplit.commitments) {
+                // Insert the note commitments into our temporary tree.
+
+                sprout_tree.append(note_commitment);
+            }
+        }
+
+        for (const OutputDescription &outputDescription : tx.vShieldedOutput) {
+            sapling_tree.append(outputDescription.cmu);
+        }
+
+        if (!orchard_tree.AppendBundle(tx.GetOrchardBundle())) {
+            return state.DoS(100,
+                error("ConnectBlock(): block would overfill the Orchard commitment tree."),
+                REJECT_INVALID, "orchard-commitment-tree-full");
+        };
+
+        if (!(tx.vShieldedSpend.empty() && tx.vShieldedOutput.empty())) {
+            total_sapling_tx += 1;
+        }
+
+        if (tx.GetOrchardBundle().IsPresent()) {
+            total_orchard_tx += 1;
+        }
+
+        vPos.push_back(std::make_pair(tx.GetHash(), pos));
+        pos.nTxOffset += ::GetSerializeSize(tx, SER_DISK, CLIENT_VERSION);
+    }
+
+    // Derive the various block commitments.
+    // We only derive them if they will be used for this block.
+    std::optional<uint256> hashAuthDataRoot;
+    std::optional<uint256> hashChainHistoryRoot;
+    if (chainparams.GetConsensus().NetworkUpgradeActive(pindex->nHeight, Consensus::UPGRADE_NU5)) {
+        hashAuthDataRoot = block.BuildAuthDataMerkleTree();
+    }
+    if (chainparams.GetConsensus().NetworkUpgradeActive(pindex->nHeight, Consensus::UPGRADE_HEARTWOOD)) {
+        hashChainHistoryRoot = view.GetHistoryRoot(prevConsensusBranchId);
+    }
+
+    view.PushAnchor(sprout_tree);
+    view.PushAnchor(sapling_tree);
+    view.PushAnchor(orchard_tree);
+    if (!fJustCheck) {
+        pindex->hashFinalSproutRoot = sprout_tree.root();
+        // - If this block is before Heartwood activation, then we don't set
+        //   hashFinalSaplingRoot here to maintain the invariant documented in
+        //   CBlockIndex (which was ensured in AddToBlockIndex).
+        // - If this block is on or after Heartwood activation, this is where we
+        //   set the correct value of hashFinalSaplingRoot; in particular,
+        //   blocks that are never passed to ConnectBlock() (and thus never on
+        //   the main chain) will stay with hashFinalSaplingRoot set to null.
+        if (chainparams.GetConsensus().NetworkUpgradeActive(pindex->nHeight, Consensus::UPGRADE_HEARTWOOD)) {
+            pindex->hashFinalSaplingRoot = sapling_tree.root();
+        }
+
+        // - If this block is before NU5 activation:
+        //   - hashAuthDataRoot and hashFinalOrchardRoot are always null.
+        //   - We don't set hashChainHistoryRoot here to maintain the invariant
+        //     documented in CBlockIndex (which was ensured in AddToBlockIndex).
+        // - If this block is on or after NU5 activation, this is where we set
+        //   the correct values of hashAuthDataRoot, hashFinalOrchardRoot, and
+        //   hashChainHistoryRoot; in particular, blocks that are never passed
+        //   to ConnectBlock() (and thus never on the main chain) will stay with
+        //   these set to null.
+        if (chainparams.GetConsensus().NetworkUpgradeActive(pindex->nHeight, Consensus::UPGRADE_NU5)) {
+            pindex->hashAuthDataRoot = hashAuthDataRoot.value();
+            pindex->hashFinalOrchardRoot = orchard_tree.root(),
+            pindex->hashChainHistoryRoot = hashChainHistoryRoot.value();
+        }
+    }
+    blockundo.old_sprout_tree_root = old_sprout_tree_root;
+
+    if (chainparams.GetConsensus().NetworkUpgradeActive(pindex->nHeight, Consensus::UPGRADE_NU5)) {
+        if (fCheckAuthDataRoot) {
+            // If NU5 is active, block.hashBlockCommitments must be the top digest
+            // of the ZIP 244 block commitments linked list.
+            // https://zips.z.cash/zip-0244#block-header-changes
+            uint256 hashBlockCommitments = DeriveBlockCommitmentsHash(
+                hashChainHistoryRoot.value(),
+                hashAuthDataRoot.value());
+            if (block.hashBlockCommitments != hashBlockCommitments) {
+                return state.DoS(100,
+                    error("ConnectBlock(): block's hashBlockCommitments is incorrect (should be ZIP 244 block commitment)"),
+                    REJECT_INVALID, "bad-block-commitments-hash");
+            }
+        }
+    } else if (IsActivationHeight(pindex->nHeight, chainparams.GetConsensus(), Consensus::UPGRADE_HEARTWOOD)) {
+        // In the block that activates ZIP 221, block.hashBlockCommitments MUST
+        // be set to all zero bytes.
+        if (!block.hashBlockCommitments.IsNull()) {
+            return state.DoS(100,
+                error("ConnectBlock(): block's hashBlockCommitments is incorrect (should be null)"),
+                REJECT_INVALID, "bad-heartwood-root-in-block");
+        }
+    } else if (chainparams.GetConsensus().NetworkUpgradeActive(pindex->nHeight, Consensus::UPGRADE_HEARTWOOD)) {
+        // If Heartwood is active, block.hashBlockCommitments must be the same as
+        // the root of the history tree for the previous block. We only store
+        // one tree per epoch, so we have two possible cases:
+        // - If the previous block is in the previous epoch, this block won't
+        //   affect that epoch's tree root.
+        // - If the previous block is in this epoch, this block would affect
+        //   this epoch's tree root, but as we haven't updated the tree for this
+        //   block yet, view.GetHistoryRoot() returns the root we need.
+        if (block.hashBlockCommitments != hashChainHistoryRoot.value()) {
+            return state.DoS(100,
+                error("ConnectBlock(): block's hashBlockCommitments is incorrect (should be history tree root)"),
+                REJECT_INVALID, "bad-heartwood-root-in-block");
+        }
+    } else if (chainparams.GetConsensus().NetworkUpgradeActive(pindex->nHeight, Consensus::UPGRADE_SAPLING)) {
+        // If Sapling is active, block.hashBlockCommitments must be the
+        // same as the root of the Sapling tree
+        if (block.hashBlockCommitments != sapling_tree.root()) {
+            return state.DoS(100,
+                error("ConnectBlock(): block's hashBlockCommitments is incorrect (should be Sapling tree root)"),
+                REJECT_INVALID, "bad-sapling-root-in-block");
+        }
+    }
+
+    // History read/write is started with Heartwood update.
+    if (chainparams.GetConsensus().NetworkUpgradeActive(pindex->nHeight, Consensus::UPGRADE_HEARTWOOD)) {
+        HistoryNode historyNode;
+        if (chainparams.GetConsensus().NetworkUpgradeActive(pindex->nHeight, Consensus::UPGRADE_NU5)) {
+            historyNode = libzcash::NewV2Leaf(
+                block.GetHash(),
+                block.nTime,
+                block.nBits,
+                pindex->hashFinalSaplingRoot,
+                pindex->hashFinalOrchardRoot,
+                ArithToUint256(GetBlockProof(*pindex)),
+                pindex->nHeight,
+                total_sapling_tx,
+                total_orchard_tx
+            );
+        } else {
+            historyNode = libzcash::NewV1Leaf(
+                block.GetHash(),
+                block.nTime,
+                block.nBits,
+                pindex->hashFinalSaplingRoot,
+                ArithToUint256(GetBlockProof(*pindex)),
+                pindex->nHeight,
+                total_sapling_tx
+            );
+        }
+
+        view.PushHistoryNode(consensusBranchId, historyNode);
+    }
+
+    int64_t nTime1 = GetTimeMicros(); nTimeConnect += nTime1 - nTimeStart;
+    LogPrint("bench", "      - Connect %u transactions: %.2fms (%.3fms/tx, %.3fms/txin) [%.2fs]\n", (unsigned)block.vtx.size(), 0.001 * (nTime1 - nTimeStart), 0.001 * (nTime1 - nTimeStart) / block.vtx.size(), nInputs <= 1 ? 0 : 0.001 * (nTime1 - nTimeStart) / (nInputs-1), nTimeConnect * 0.000001);
+
+    CAmount blockReward = nFees + GetBlockSubsidy(pindex->nHeight, chainparams.GetConsensus());
+    if (block.vtx[0].GetValueOut() > blockReward)
+        return state.DoS(100,
+                         error("ConnectBlock(): coinbase pays too much (actual=%d vs limit=%d)",
+                               block.vtx[0].GetValueOut(), blockReward),
+                               REJECT_INVALID, "bad-cb-amount");
+
+    // Ensure Orchard signatures are valid (if we are checking them)
+    if (!orchardAuth.Validate()) {
+        return state.DoS(100,
+            error("ConnectBlock(): an Orchard bundle within the block is invalid"),
+            REJECT_INVALID, "bad-orchard-bundle-authorization");
+    }
+
+    if (!control.Wait())
+        return state.DoS(100, false);
+    int64_t nTime2 = GetTimeMicros(); nTimeVerify += nTime2 - nTimeStart;
+    LogPrint("bench", "    - Verify %u txins: %.2fms (%.3fms/txin) [%.2fs]\n", nInputs - 1, 0.001 * (nTime2 - nTimeStart), nInputs <= 1 ? 0 : 0.001 * (nTime2 - nTimeStart) / (nInputs-1), nTimeVerify * 0.000001);
+
+    if (fJustCheck)
+        return true;
+
+    // Write undo information to disk
+    if (pindex->GetUndoPos().IsNull() || !pindex->IsValid(BLOCK_VALID_SCRIPTS))
+    {
+        if (pindex->GetUndoPos().IsNull()) {
+            CDiskBlockPos _pos;
+            if (!FindUndoPos(state, pindex->nFile, _pos, ::GetSerializeSize(blockundo, SER_DISK, CLIENT_VERSION) + 40))
+                return error("ConnectBlock(): FindUndoPos failed");
+            if (!UndoWriteToDisk(blockundo, _pos, pindex->pprev->GetBlockHash(), chainparams.MessageStart()))
+                return AbortNode(state, "Failed to write undo data");
+
+            // update nUndoPos in block index
+            pindex->nUndoPos = _pos.nPos;
+            pindex->nStatus |= BLOCK_HAVE_UNDO;
+        }
+
+        // Now that all consensus rules have been validated, set nCachedBranchId.
+        // Move this if BLOCK_VALID_CONSENSUS is ever altered.
+        static_assert(BLOCK_VALID_CONSENSUS == BLOCK_VALID_SCRIPTS,
+            "nCachedBranchId must be set after all consensus rules have been validated.");
+        if (IsActivationHeightForAnyUpgrade(pindex->nHeight, chainparams.GetConsensus())) {
+            pindex->nStatus |= BLOCK_ACTIVATES_UPGRADE;
+            pindex->nCachedBranchId = CurrentEpochBranchId(pindex->nHeight, chainparams.GetConsensus());
+        } else if (pindex->pprev) {
+            pindex->nCachedBranchId = pindex->pprev->nCachedBranchId;
+        }
+
+        pindex->RaiseValidity(BLOCK_VALID_SCRIPTS);
+        setDirtyBlockIndex.insert(pindex);
+    }
+
+    if (fTxIndex)
+        if (!pblocktree->WriteTxIndex(vPos))
+            return AbortNode(state, "Failed to write transaction index");
+
+    // START insightexplorer
+    if (fAddressIndex) {
+        if (!pblocktree->WriteAddressIndex(addressIndex)) {
+            return AbortNode(state, "Failed to write address index");
+        }
+        if (!pblocktree->UpdateAddressUnspentIndex(addressUnspentIndex)) {
+            return AbortNode(state, "Failed to write address unspent index");
+        }
+    }
+    if (fSpentIndex) {
+        if (!pblocktree->UpdateSpentIndex(spentIndex)) {
+            return AbortNode(state, "Failed to write spent index");
+        }
+    }
+    if (fTimestampIndex) {
+        unsigned int logicalTS = pindex->nTime;
+        unsigned int prevLogicalTS = 0;
+
+        // retrieve logical timestamp of the previous block
+        if (pindex->pprev)
+            if (!pblocktree->ReadTimestampBlockIndex(pindex->pprev->GetBlockHash(), prevLogicalTS))
+                LogPrintf("%s: Failed to read previous block's logical timestamp\n", __func__);
+
+        if (logicalTS <= prevLogicalTS) {
+            logicalTS = prevLogicalTS + 1;
+            LogPrintf("%s: Previous logical timestamp is newer Actual[%d] prevLogical[%d] Logical[%d]\n", __func__, pindex->nTime, prevLogicalTS, logicalTS);
+        }
+
+        if (!pblocktree->WriteTimestampIndex(CTimestampIndexKey(logicalTS, pindex->GetBlockHash())))
+            return AbortNode(state, "Failed to write timestamp index");
+
+        if (!pblocktree->WriteTimestampBlockIndex(CTimestampBlockIndexKey(pindex->GetBlockHash()), CTimestampBlockIndexValue(logicalTS)))
+            return AbortNode(state, "Failed to write blockhash index");
+    }
+    // END insightexplorer
+
+    // add this block to the view's block chain
+    view.SetBestBlock(pindex->GetBlockHash());
+
+    int64_t nTime3 = GetTimeMicros(); nTimeIndex += nTime3 - nTime2;
+    LogPrint("bench", "    - Index writing: %.2fms [%.2fs]\n", 0.001 * (nTime3 - nTime2), nTimeIndex * 0.000001);
+
+    // Watch for changes to the previous coinbase transaction.
+    static uint256 hashPrevBestCoinBase;
+    GetMainSignals().UpdatedTransaction(hashPrevBestCoinBase);
+    hashPrevBestCoinBase = block.vtx[0].GetHash();
+
+    int64_t nTime4 = GetTimeMicros(); nTimeCallbacks += nTime4 - nTime3;
+    LogPrint("bench", "    - Callbacks: %.2fms [%.2fs]\n", 0.001 * (nTime4 - nTime3), nTimeCallbacks * 0.000001);
+
+    return true;
+}
+
+enum FlushStateMode {
+    FLUSH_STATE_NONE,
+    FLUSH_STATE_IF_NEEDED,
+    FLUSH_STATE_PERIODIC,
+    FLUSH_STATE_ALWAYS
+};
+
+/**
+ * Update the on-disk chain state.
+ * The caches and indexes are flushed depending on the mode we're called with
+ * if they're too large, if it's been a while since the last write,
+ * or always and in all cases if we're in prune mode and are deleting files.
+ */
+bool static FlushStateToDisk(
+    const CChainParams& chainparams,
+    CValidationState &state,
+    FlushStateMode mode) {
+    LOCK2(cs_main, cs_LastBlockFile);
+    static int64_t nLastWrite = 0;
+    static int64_t nLastFlush = 0;
+    std::set<int> setFilesToPrune;
+    bool fFlushForPrune = false;
+    try {
+    if (fPruneMode && fCheckForPruning && !fReindex) {
+        FindFilesToPrune(setFilesToPrune, chainparams.PruneAfterHeight());
+        fCheckForPruning = false;
+        if (!setFilesToPrune.empty()) {
+            fFlushForPrune = true;
+            if (!fHavePruned) {
+                pblocktree->WriteFlag("prunedblockfiles", true);
+                fHavePruned = true;
+            }
+        }
+    }
+    int64_t nNow = GetTimeMicros();
+    // Avoid writing/flushing immediately after startup.
+    if (nLastWrite == 0) {
+        nLastWrite = nNow;
+    }
+    if (nLastFlush == 0) {
+        nLastFlush = nNow;
+    }
+    size_t cacheSize = pcoinsTip->DynamicMemoryUsage();
+    // The cache is large and close to the limit, but we have time now (not in the middle of a block processing).
+    bool fCacheLarge = mode == FLUSH_STATE_PERIODIC && cacheSize * (10.0/9) > nCoinCacheUsage;
+    // The cache is over the limit, we have to write now.
+    bool fCacheCritical = mode == FLUSH_STATE_IF_NEEDED && cacheSize > nCoinCacheUsage;
+    // It's been a while since we wrote the block index to disk. Do this frequently, so we don't need to redownload after a crash.
+    bool fPeriodicWrite = mode == FLUSH_STATE_PERIODIC && nNow > nLastWrite + (int64_t)DATABASE_WRITE_INTERVAL * 1000000;
+    // It's been very long since we flushed the cache. Do this infrequently, to optimize cache usage.
+    bool fPeriodicFlush = mode == FLUSH_STATE_PERIODIC && nNow > nLastFlush + (int64_t)DATABASE_FLUSH_INTERVAL * 1000000;
+    // Combine all conditions that result in a full cache flush.
+    bool fDoFullFlush = (mode == FLUSH_STATE_ALWAYS) || fCacheLarge || fCacheCritical || fPeriodicFlush || fFlushForPrune;
+    // Write blocks and block index to disk.
+    if (fDoFullFlush || fPeriodicWrite) {
+        // Depend on nMinDiskSpace to ensure we can write block index
+        if (!CheckDiskSpace(0))
+            return state.Error("out of disk space");
+        // First make sure all block and undo data is flushed to disk.
+        FlushBlockFile();
+        // Then update all block file information (which may refer to block and undo files).
+        {
+            std::vector<std::pair<int, const CBlockFileInfo*> > vFiles;
+            vFiles.reserve(setDirtyFileInfo.size());
+            for (set<int>::iterator it = setDirtyFileInfo.begin(); it != setDirtyFileInfo.end(); ) {
+                vFiles.push_back(make_pair(*it, &vinfoBlockFile[*it]));
+                it = setDirtyFileInfo.erase(it);
+            }
+            std::vector<const CBlockIndex*> vBlocks;
+            vBlocks.reserve(setDirtyBlockIndex.size());
+            for (set<CBlockIndex*>::iterator it = setDirtyBlockIndex.begin(); it != setDirtyBlockIndex.end(); ) {
+                vBlocks.push_back(*it);
+                it = setDirtyBlockIndex.erase(it);
+            }
+            if (!pblocktree->WriteBatchSync(vFiles, nLastBlockFile, vBlocks)) {
+                return AbortNode(state, "Files to write to block index database");
+            }
+        }
+        // Finally remove any pruned files
+        if (fFlushForPrune)
+            UnlinkPrunedFiles(setFilesToPrune);
+        nLastWrite = nNow;
+    }
+    // Flush best chain related state. This can only be done if the blocks / block index write was also done.
+    if (fDoFullFlush) {
+        // Typical CCoins structures on disk are around 128 bytes in size.
+        // Pushing a new one to the database can cause it to be written
+        // twice (once in the log, and once in the tables). This is already
+        // an overestimation, as most will delete an existing entry or
+        // overwrite one. Still, use a conservative safety factor of 2.
+        if (!CheckDiskSpace(128 * 2 * 2 * pcoinsTip->GetCacheSize()))
+            return state.Error("out of disk space");
+        // Flush the chainstate (which may refer to block index entries).
+        if (!pcoinsTip->Flush())
+            return AbortNode(state, "Failed to write to coin database");
+        nLastFlush = nNow;
+    }
+    // Don't flush the wallet witness cache (SetBestChain()) here, see #4301
+    } catch (const std::runtime_error& e) {
+        return AbortNode(state, std::string("System error while flushing: ") + e.what());
+    }
+    return true;
+}
+
+void FlushStateToDisk() {
+    CValidationState state;
+    FlushStateToDisk(Params(), state, FLUSH_STATE_ALWAYS);
+}
+
+void PruneAndFlush() {
+    CValidationState state;
+    fCheckForPruning = true;
+    FlushStateToDisk(Params(), state, FLUSH_STATE_NONE);
+}
+
+struct PoolMetrics {
+    std::optional<size_t> created;
+    std::optional<size_t> spent;
+    std::optional<size_t> unspent;
+    std::optional<CAmount> value;
+
+    static PoolMetrics Sprout(CBlockIndex *pindex, CCoinsViewCache *view) {
+        PoolMetrics stats;
+        stats.value = pindex->nChainSproutValue;
+
+        // RewindBlockIndex calls DisconnectTip in a way that can potentially cause a
+        // Sprout tree to not exist (the rewind_index RPC test reliably triggers this).
+        // We only need to access the tree during disconnection for metrics purposes, and
+        // we will never encounter this rewind situation on either mainnet or testnet, so
+        // if we can't access the Sprout tree we default to zero.
+        SproutMerkleTree sproutTree;
+        if (view->GetSproutAnchorAt(pindex->hashFinalSproutRoot, sproutTree)) {
+            stats.created = sproutTree.size();
+        } else {
+            stats.created = 0;
+        }
+
+        return stats;
+    }
+
+    static PoolMetrics Sapling(CBlockIndex *pindex, CCoinsViewCache *view) {
+        PoolMetrics stats;
+        stats.value = pindex->nChainSaplingValue;
+
+        // Before Sapling activation, the Sapling commitment set is empty.
+        SaplingMerkleTree saplingTree;
+        if (view->GetSaplingAnchorAt(pindex->hashFinalSaplingRoot, saplingTree)) {
+            stats.created = saplingTree.size();
+        } else {
+            stats.created = 0;
+        }
+
+        return stats;
+    }
+
+    static PoolMetrics Orchard(CBlockIndex *pindex, CCoinsViewCache *view) {
+        PoolMetrics stats;
+        stats.value = pindex->nChainOrchardValue;
+
+        // Before NU5 activation, the Orchard commitment set is empty.
+        OrchardMerkleFrontier orchardTree;
+        if (view->GetOrchardAnchorAt(pindex->hashFinalOrchardRoot, orchardTree)) {
+            stats.created = orchardTree.size();
+        } else {
+            stats.created = 0;
+        }
+
+        return stats;
+    }
+
+    static PoolMetrics Transparent(CBlockIndex *pindex, CCoinsViewCache *view) {
+        PoolMetrics stats;
+        // TODO: Collect transparent pool value.
+
+        // TODO: Figure out a way to efficiently collect UTXO set metrics
+        // (view->GetStats() is too slow to call during block verification).
+
+        return stats;
+    }
+};
+
+#define RenderPoolMetrics(poolName, poolMetrics) \
+    do {                                         \
+        if (poolMetrics.created) {               \
+            MetricsStaticGauge(                  \
+                "zcash.pool.notes.created",      \
+                poolMetrics.created.value(),     \
+                "name", poolName);               \
+        }                                        \
+        if (poolMetrics.spent) {                 \
+            MetricsStaticGauge(                  \
+                "zcash.pool.notes.spent",        \
+                poolMetrics.spent.value(),       \
+                "name", poolName);               \
+        }                                        \
+        if (poolMetrics.unspent) {               \
+            MetricsStaticGauge(                  \
+                "zcash.pool.notes.unspent",      \
+                poolMetrics.unspent.value(),     \
+                "name", poolName);               \
+        }                                        \
+        if (poolMetrics.value) {                 \
+            MetricsStaticGauge(                  \
+                "zcash.pool.value.zatoshis",     \
+                poolMetrics.value.value(),       \
+                "name", poolName);               \
+        }                                        \
+    } while (0)
+
+/** Update chainActive and related internal data structures. */
+void static UpdateTip(CBlockIndex *pindexNew, const CChainParams& chainParams) {
+    chainActive.SetTip(pindexNew);
+
+    // New best block
+    nTimeBestReceived = GetTime();
+    mempool.AddTransactionsUpdated(1);
+
+    auto hash = tfm::format("%s", chainActive.Tip()->GetBlockHash().ToString());
+    auto height = tfm::format("%d", chainActive.Height());
+    auto bits = tfm::format("%d", chainActive.Tip()->nBits);
+    auto log2_work = tfm::format("%.8g", log2(chainActive.Tip()->nChainWork.getdouble()));
+    auto tx = tfm::format("%lu", (unsigned long)chainActive.Tip()->nChainTx);
+    auto date = DateTimeStrFormat("%Y-%m-%d %H:%M:%S", chainActive.Tip()->GetBlockTime());
+    auto progress = tfm::format("%f", Checkpoints::GuessVerificationProgress(chainParams.Checkpoints(), chainActive.Tip()));
+    auto cache = tfm::format("%.1fMiB(%utx)", pcoinsTip->DynamicMemoryUsage() * (1.0 / (1<<20)), pcoinsTip->GetCacheSize());
+
+    TracingInfo("main", "UpdateTip: new best",
+        "hash", hash.c_str(),
+        "height", height.c_str(),
+        "bits", bits.c_str(),
+        "log2_work", log2_work.c_str(),
+        "tx", tx.c_str(),
+        "date", date.c_str(),
+        "progress", progress.c_str(),
+        "cache", cache.c_str());
+
+    auto sproutPool = PoolMetrics::Sprout(pindexNew, pcoinsTip);
+    auto saplingPool = PoolMetrics::Sapling(pindexNew, pcoinsTip);
+    auto orchardPool = PoolMetrics::Orchard(pindexNew, pcoinsTip);
+    auto transparentPool = PoolMetrics::Transparent(pindexNew, pcoinsTip);
+
+    MetricsGauge("zcash.chain.verified.block.height", pindexNew->nHeight);
+    RenderPoolMetrics("sprout", sproutPool);
+    RenderPoolMetrics("sapling", saplingPool);
+    RenderPoolMetrics("orchard", orchardPool);
+    RenderPoolMetrics("transparent", transparentPool);
+
+    {
+        boost::unique_lock<boost::mutex> lock(g_best_block_mutex);
+        g_best_block = pindexNew->GetBlockHash();
+        g_best_block_height = pindexNew->nHeight;
+        g_best_block_cv.notify_all();
+    }
+}
+
+/**
+ * Disconnect chainActive's tip. You probably want to call mempool.removeForReorg and
+ * mempool.removeWithoutBranchId after this, with cs_main held.
+ */
+bool static DisconnectTip(CValidationState &state, const CChainParams& chainparams, bool fBare = false)
+{
+    CBlockIndex *pindexDelete = chainActive.Tip();
+    assert(pindexDelete);
+    // Read block from disk.
+    CBlock block;
+    if (!ReadBlockFromDisk(block, pindexDelete, chainparams.GetConsensus()))
+        return AbortNode(state, "Failed to read block");
+    // Apply the block atomically to the chain state.
+    uint256 sproutAnchorBeforeDisconnect = pcoinsTip->GetBestAnchor(SPROUT);
+    uint256 saplingAnchorBeforeDisconnect = pcoinsTip->GetBestAnchor(SAPLING);
+    uint256 orchardAnchorBeforeDisconnect = pcoinsTip->GetBestAnchor(ORCHARD);
+    int64_t nStart = GetTimeMicros();
+    {
+        CCoinsViewCache view(pcoinsTip);
+        // insightexplorer: update indices (true)
+        if (DisconnectBlock(block, state, pindexDelete, view, chainparams, true) != DISCONNECT_OK)
+            return error("DisconnectTip(): DisconnectBlock %s failed", pindexDelete->GetBlockHash().ToString());
+        assert(view.Flush());
+    }
+    LogPrint("bench", "- Disconnect block: %.2fms\n", (GetTimeMicros() - nStart) * 0.001);
+    uint256 sproutAnchorAfterDisconnect = pcoinsTip->GetBestAnchor(SPROUT);
+    uint256 saplingAnchorAfterDisconnect = pcoinsTip->GetBestAnchor(SAPLING);
+    uint256 orchardAnchorAfterDisconnect = pcoinsTip->GetBestAnchor(ORCHARD);
+    // Write the chain state to disk, if necessary.
+    if (!FlushStateToDisk(chainparams, state, FLUSH_STATE_IF_NEEDED))
+        return false;
+
+    if (!fBare) {
+        // Resurrect mempool transactions from the disconnected block.
+        for (const CTransaction &tx : block.vtx) {
+            // ignore validation errors in resurrected transactions
+            list<CTransaction> removed;
+            CValidationState stateDummy;
+            if (tx.IsCoinBase() || !AcceptToMemoryPool(chainparams, mempool, stateDummy, tx, false, NULL))
+                mempool.remove(tx, removed, true);
+        }
+        if (sproutAnchorBeforeDisconnect != sproutAnchorAfterDisconnect) {
+            // The anchor may not change between block disconnects,
+            // in which case we don't want to evict from the mempool yet!
+            mempool.removeWithAnchor(sproutAnchorBeforeDisconnect, SPROUT);
+        }
+        if (saplingAnchorBeforeDisconnect != saplingAnchorAfterDisconnect) {
+            // The anchor may not change between block disconnects,
+            // in which case we don't want to evict from the mempool yet!
+            mempool.removeWithAnchor(saplingAnchorBeforeDisconnect, SAPLING);
+        }
+        if (orchardAnchorBeforeDisconnect != orchardAnchorAfterDisconnect) {
+            // The anchor may not change between block disconnects,
+            // in which case we don't want to evict from the mempool yet!
+            mempool.removeWithAnchor(orchardAnchorBeforeDisconnect, ORCHARD);
+        }
+    }
+
+    // Update chainActive and related variables.
+    UpdateTip(pindexDelete->pprev, chainparams);
+
+    // Updates to connected wallets are triggered by ThreadNotifyWallets
+
+    return true;
+}
+
+static int64_t nTimeReadFromDisk = 0;
+static int64_t nTimeConnectTotal = 0;
+static int64_t nTimeFlush = 0;
+static int64_t nTimeChainState = 0;
+static int64_t nTimePostConnect = 0;
+
+// Protected by cs_main
+std::map<CBlockIndex*, std::list<CTransaction>> recentlyConflictedTxs;
+uint64_t nRecentlyConflictedSequence = 0;
+uint64_t nNotifiedSequence = 0;
+
+/**
+ * Connect a new block to chainActive. pblock is either NULL or a pointer to a CBlock
+ * corresponding to pindexNew, to bypass loading it again from disk.
+ * You probably want to call mempool.removeWithoutBranchId after this, with cs_main held.
+ */
+bool static ConnectTip(CValidationState& state, const CChainParams& chainparams, CBlockIndex* pindexNew, const CBlock* pblock)
+{
+    assert(pblock && pindexNew->pprev == chainActive.Tip());
+    // Apply the block atomically to the chain state.
+    int64_t nTime2 = GetTimeMicros();
+    int64_t nTime3;
+    {
+        CCoinsViewCache view(pcoinsTip);
+        bool rv = ConnectBlock(*pblock, state, pindexNew, view, chainparams);
+        GetMainSignals().BlockChecked(*pblock, state);
+        if (!rv) {
+            if (state.IsInvalid())
+                InvalidBlockFound(pindexNew, state, chainparams);
+            return error("ConnectTip(): ConnectBlock %s failed", pindexNew->GetBlockHash().ToString());
+        }
+        mapBlockSource.erase(pindexNew->GetBlockHash());
+        nTime3 = GetTimeMicros(); nTimeConnectTotal += nTime3 - nTime2;
+        LogPrint("bench", "  - Connect total: %.2fms [%.2fs]\n", (nTime3 - nTime2) * 0.001, nTimeConnectTotal * 0.000001);
+        assert(view.Flush());
+    }
+    int64_t nTime4 = GetTimeMicros(); nTimeFlush += nTime4 - nTime3;
+    LogPrint("bench", "  - Flush: %.2fms [%.2fs]\n", (nTime4 - nTime3) * 0.001, nTimeFlush * 0.000001);
+    // Write the chain state to disk, if necessary.
+    if (!FlushStateToDisk(chainparams, state, FLUSH_STATE_IF_NEEDED))
+        return false;
+    int64_t nTime5 = GetTimeMicros(); nTimeChainState += nTime5 - nTime4;
+    LogPrint("bench", "  - Writing chainstate: %.2fms [%.2fs]\n", (nTime5 - nTime4) * 0.001, nTimeChainState * 0.000001);
+    // Remove conflicting transactions from the mempool.
+    std::list<CTransaction> txConflicted;
+    mempool.removeForBlock(pblock->vtx, pindexNew->nHeight, txConflicted, !IsInitialBlockDownload(chainparams.GetConsensus()));
+
+    // Remove transactions that expire at new block height from mempool
+    auto ids = mempool.removeExpired(pindexNew->nHeight);
+
+    for (auto id : ids) {
+        uiInterface.NotifyTxExpiration(id);
+    }
+
+    // Update chainActive & related variables.
+    UpdateTip(pindexNew, chainparams);
+
+    // Cache the conflicted transactions for subsequent notification.
+    // Updates to connected wallets are triggered by ThreadNotifyWallets
+    recentlyConflictedTxs.insert(std::make_pair(pindexNew, txConflicted));
+    nRecentlyConflictedSequence += 1;
+
+    EnforceNodeDeprecation(pindexNew->nHeight);
+
+    int64_t nTime6 = GetTimeMicros(); nTimePostConnect += nTime6 - nTime5;
+    LogPrint("bench", "  - Connect postprocess: %.2fms [%.2fs]\n", (nTime6 - nTime5) * 0.001, nTimePostConnect * 0.000001);
+    // Total connection time benchmarking occurs in ActivateBestChainStep.
+    MetricsIncrementCounter("zcash.chain.verified.block.total");
+    return true;
+}
+
+std::pair<std::map<CBlockIndex*, std::list<CTransaction>>, uint64_t> DrainRecentlyConflicted()
+{
+    uint64_t recentlyConflictedSequence;
+    std::map<CBlockIndex*, std::list<CTransaction>> txs;
+    {
+        LOCK(cs_main);
+        recentlyConflictedSequence = nRecentlyConflictedSequence;
+        txs.swap(recentlyConflictedTxs);
+    }
+
+    return std::make_pair(txs, recentlyConflictedSequence);
+}
+
+void SetChainNotifiedSequence(const CChainParams& chainparams, uint64_t recentlyConflictedSequence) {
+    assert(chainparams.NetworkIDString() == "regtest");
+    LOCK(cs_main);
+    nNotifiedSequence = recentlyConflictedSequence;
+}
+
+bool ChainIsFullyNotified(const CChainParams& chainparams) {
+    assert(chainparams.NetworkIDString() == "regtest");
+    LOCK(cs_main);
+    return nRecentlyConflictedSequence == nNotifiedSequence;
+}
+
+/**
+ * Return the tip of the chain with the most work in it, that isn't
+ * known to be invalid (it's however far from certain to be valid).
+ */
+static CBlockIndex* FindMostWorkChain() {
+    do {
+        CBlockIndex *pindexNew = NULL;
+
+        // Find the best candidate header.
+        {
+            std::set<CBlockIndex*, CBlockIndexWorkComparator>::reverse_iterator it = setBlockIndexCandidates.rbegin();
+            if (it == setBlockIndexCandidates.rend())
+                return NULL;
+            pindexNew = *it;
+        }
+
+        // Check whether all blocks on the path between the currently active chain and the candidate are valid.
+        // Just going until the active chain is an optimization, as we know all blocks in it are valid already.
+        CBlockIndex *pindexTest = pindexNew;
+        bool fInvalidAncestor = false;
+        while (pindexTest && !chainActive.Contains(pindexTest)) {
+            assert(pindexTest->nChainTx || pindexTest->nHeight == 0);
+
+            // Pruned nodes may have entries in setBlockIndexCandidates for
+            // which block files have been deleted.  Remove those as candidates
+            // for the most work chain if we come across them; we can't switch
+            // to a chain unless we have all the non-active-chain parent blocks.
+            bool fFailedChain = pindexTest->nStatus & BLOCK_FAILED_MASK;
+            bool fMissingData = !(pindexTest->nStatus & BLOCK_HAVE_DATA);
+            if (fFailedChain || fMissingData) {
+                // Candidate chain is not usable (either invalid or missing data)
+                if (fFailedChain && (pindexBestInvalid == NULL || pindexNew->nChainWork > pindexBestInvalid->nChainWork))
+                    pindexBestInvalid = pindexNew;
+                CBlockIndex *pindexFailed = pindexNew;
+                // Remove the entire chain from the set.
+                while (pindexTest != pindexFailed) {
+                    if (fFailedChain) {
+                        pindexFailed->nStatus |= BLOCK_FAILED_CHILD;
+                    } else if (fMissingData) {
+                        // If we're missing data, then add back to mapBlocksUnlinked,
+                        // so that if the block arrives in the future we can try adding
+                        // to setBlockIndexCandidates again.
+                        mapBlocksUnlinked.insert(std::make_pair(pindexFailed->pprev, pindexFailed));
+                    }
+                    setBlockIndexCandidates.erase(pindexFailed);
+                    pindexFailed = pindexFailed->pprev;
+                }
+                setBlockIndexCandidates.erase(pindexTest);
+                fInvalidAncestor = true;
+                break;
+            }
+            pindexTest = pindexTest->pprev;
+        }
+        if (!fInvalidAncestor)
+            return pindexNew;
+    } while(true);
+}
+
+/** Delete all entries in setBlockIndexCandidates that are worse than the current tip. */
+static void PruneBlockIndexCandidates() {
+    // Note that we can't delete the current block itself, as we may need to return to it later in case a
+    // reorganization to a better block fails.
+    std::set<CBlockIndex*, CBlockIndexWorkComparator>::iterator it = setBlockIndexCandidates.begin();
+    while (it != setBlockIndexCandidates.end() && setBlockIndexCandidates.value_comp()(*it, chainActive.Tip())) {
+        it = setBlockIndexCandidates.erase(it);
+    }
+    // Either the current tip or a successor of it we're working towards is left in setBlockIndexCandidates.
+    assert(!setBlockIndexCandidates.empty());
+}
+
+/**
+ * Try to make some progress towards making pindexMostWork the active block.
+ * pblock is either NULL or a pointer to a CBlock corresponding to pindexMostWork.
+ */
+static bool ActivateBestChainStep(CValidationState& state, const CChainParams& chainparams, CBlockIndex* pindexMostWork, const CBlock* pblock, bool& fInvalidFound)
+{
+    AssertLockHeld(cs_main);
+    const CBlockIndex *pindexOldTip = chainActive.Tip();
+    const CBlockIndex *pindexFork = chainActive.FindFork(pindexMostWork);
+
+    // - On ChainDB initialization, pindexOldTip will be null, so there are no removable blocks.
+    // - If pindexMostWork is in a chain that doesn't have the same genesis block as our chain,
+    //   then pindexFork will be null, and we would need to remove the entire chain including
+    //   our genesis block. In practice this (probably) won't happen because of checks elsewhere.
+    auto reorgLength = pindexOldTip ? pindexOldTip->nHeight - (pindexFork ? pindexFork->nHeight : -1) : 0;
+    static_assert(MAX_REORG_LENGTH > 0, "We must be able to reorg some distance");
+    if (reorgLength > MAX_REORG_LENGTH) {
+        auto msg = strprintf(_(
+            "A block chain reorganization has been detected that would roll back %d blocks! "
+            "This is larger than the maximum of %d blocks, and so the node is shutting down for your safety."
+            ), reorgLength, MAX_REORG_LENGTH) + "\n\n" +
+            _("Reorganization details") + ":\n" +
+            "- " + strprintf(_("Current tip: %s, height %d, work %s"),
+                pindexOldTip->phashBlock->GetHex(), pindexOldTip->nHeight, pindexOldTip->nChainWork.GetHex()) + "\n" +
+            "- " + strprintf(_("New tip:     %s, height %d, work %s"),
+                pindexMostWork->phashBlock->GetHex(), pindexMostWork->nHeight, pindexMostWork->nChainWork.GetHex()) + "\n" +
+            "- " + strprintf(_("Fork point:  %s, height %d"),
+                pindexFork->phashBlock->GetHex(), pindexFork->nHeight) + "\n\n" +
+            _("Please help, human!");
+        LogError("main", "*** %s\n", msg);
+        uiInterface.ThreadSafeMessageBox(msg, "", CClientUIInterface::MSG_ERROR);
+        StartShutdown();
+        return false;
+    }
+
+    // Disconnect active blocks which are no longer in the best chain.
+    bool fBlocksDisconnected = false;
+    while (chainActive.Tip() && chainActive.Tip() != pindexFork) {
+        if (!DisconnectTip(state, chainparams))
+            return false;
+        fBlocksDisconnected = true;
+    }
+
+    // Build list of new blocks to connect.
+    std::vector<CBlockIndex*> vpindexToConnect;
+    bool fContinue = true;
+    int nHeight = pindexFork ? pindexFork->nHeight : -1;
+    while (fContinue && nHeight != pindexMostWork->nHeight) {
+        // Don't iterate the entire list of potential improvements toward the best tip, as we likely only need
+        // a few blocks along the way.
+        int nTargetHeight = std::min(nHeight + 32, pindexMostWork->nHeight);
+        vpindexToConnect.clear();
+        vpindexToConnect.reserve(nTargetHeight - nHeight);
+        CBlockIndex *pindexIter = pindexMostWork->GetAncestor(nTargetHeight);
+        while (pindexIter && pindexIter->nHeight != nHeight) {
+            vpindexToConnect.push_back(pindexIter);
+            pindexIter = pindexIter->pprev;
+        }
+        nHeight = nTargetHeight;
+
+        // Connect new blocks.
+        for (CBlockIndex *pindexConnect : reverse_iterate(vpindexToConnect)) {
+            int64_t nTime1 = GetTimeMicros();
+            const CBlock* pconnectBlock;
+            CBlock block;
+            if (pblock && pindexConnect == pindexMostWork) {
+                pconnectBlock = pblock;
+            } else {
+                // read the block to be connected from disk
+                if (!ReadBlockFromDisk(block, pindexConnect, chainparams.GetConsensus()))
+                    return AbortNode(state, "Failed to read block");
+                pconnectBlock = &block;
+            }
+            int64_t nTime2 = GetTimeMicros(); nTimeReadFromDisk += nTime2 - nTime1;
+            LogPrint("bench", "  - Load block from disk: %.2fms [%.2fs]\n", (nTime2 - nTime1) * 0.001, nTimeReadFromDisk * 0.000001);
+
+            if (!ConnectTip(state, chainparams, pindexConnect, pconnectBlock)) {
+                if (state.IsInvalid()) {
+                    // The block violates a consensus rule.
+                    if (!state.CorruptionPossible())
+                        InvalidChainFound(vpindexToConnect.back(), chainparams);
+                    state = CValidationState();
+                    fInvalidFound = true;
+                    fContinue = false;
+                    break;
+                } else {
+                    // A system error occurred (disk space, database error, ...).
+                    return false;
+                }
+            } else {
+                int64_t nTime3 = GetTimeMicros(); nTimeTotal += nTime3 - nTime1;
+                LogPrint("bench", "- Connect block: %.2fms [%.2fs]\n", (nTime3 - nTime1) * 0.001, nTimeTotal * 0.000001);
+                MetricsHistogram("zcash.chain.verified.block.seconds", (nTime3 - nTime1) * 0.000001);
+
+                PruneBlockIndexCandidates();
+                if (!pindexOldTip || chainActive.Tip()->nChainWork > pindexOldTip->nChainWork) {
+                    // We're in a better position than we were. Return temporarily to release the lock.
+                    fContinue = false;
+                    break;
+                }
+            }
+        }
+    }
+
+    if (fBlocksDisconnected) {
+        mempool.removeForReorg(pcoinsTip, chainActive.Tip()->nHeight + 1, STANDARD_LOCKTIME_VERIFY_FLAGS);
+    }
+    mempool.removeWithoutBranchId(
+        CurrentEpochBranchId(chainActive.Tip()->nHeight + 1, chainparams.GetConsensus()));
+    mempool.check(pcoinsTip);
+
+    // Callbacks/notifications for a new best chain.
+    if (fInvalidFound)
+        CheckForkWarningConditionsOnNewFork(vpindexToConnect.back(), chainparams);
+    else
+        CheckForkWarningConditions(chainparams.GetConsensus());
+
+    return true;
+}
+
+static void NotifyHeaderTip(const Consensus::Params& params) {
+    bool fNotify = false;
+    bool fInitialBlockDownload = false;
+    static CBlockIndex* pindexHeaderOld = NULL;
+    CBlockIndex* pindexHeader = NULL;
+    {
+        LOCK(cs_main);
+        if (!setBlockIndexCandidates.empty()) {
+            pindexHeader = *setBlockIndexCandidates.rbegin();
+        }
+        if (pindexHeader != pindexHeaderOld) {
+            fNotify = true;
+            fInitialBlockDownload = IsInitialBlockDownload(params);
+            pindexHeaderOld = pindexHeader;
+        }
+    }
+    // Send block tip changed notifications without cs_main
+    if (fNotify) {
+        uiInterface.NotifyHeaderTip(fInitialBlockDownload, pindexHeader);
+    }
+}
+
+/**
+ * Make the best chain active, in multiple steps. The result is either failure
+ * or an activated best chain. pblock is either NULL or a pointer to a block
+ * that is already loaded (to avoid loading it again from disk).
+ */
+bool ActivateBestChain(CValidationState& state, const CChainParams& chainparams, const CBlock* pblock)
+{
+    CBlockIndex *pindexMostWork = NULL;
+    CBlockIndex *pindexNewTip = NULL;
+    do {
+        boost::this_thread::interruption_point();
+
+        bool fInitialDownload;
+        int nNewHeight;
+        {
+            LOCK(cs_main);
+            if (pindexMostWork == NULL) {
+                pindexMostWork = FindMostWorkChain();
+            }
+
+            // Whether we have anything to do at all.
+            if (pindexMostWork == NULL || pindexMostWork == chainActive.Tip())
+                return true;
+
+            bool fInvalidFound = false;
+            if (!ActivateBestChainStep(state, chainparams, pindexMostWork, pblock && pblock->GetHash() == pindexMostWork->GetBlockHash() ? pblock : NULL, fInvalidFound))
+                return false;
+
+            if (fInvalidFound) {
+                // Wipe cache, we may need another branch now.
+                pindexMostWork = NULL;
+            }
+            pindexNewTip = chainActive.Tip();
+            fInitialDownload = IsInitialBlockDownload(chainparams.GetConsensus());
+            nNewHeight = chainActive.Height();
+        }
+        // When we reach this point, we switched to a new tip (stored in pindexNewTip).
+
+        // Notifications/callbacks that can run without cs_main
+        // Always notify the UI if a new block tip was connected
+        uiInterface.NotifyBlockTip(fInitialDownload, pindexNewTip);
+        if (!fInitialDownload) {
+            uint256 hashNewTip = pindexNewTip->GetBlockHash();
+            // Relay inventory, but don't relay old inventory during initial block download.
+            int nBlockEstimate = 0;
+            if (fCheckpointsEnabled)
+                nBlockEstimate = Checkpoints::GetTotalBlocksEstimate(chainparams.Checkpoints());
+            {
+                LOCK(cs_vNodes);
+                for (CNode* pnode : vNodes)
+                    if (nNewHeight > (pnode->nStartingHeight != -1 ? pnode->nStartingHeight - 2000 : nBlockEstimate))
+                        pnode->PushBlockInventory(hashNewTip);
+            }
+            // Notify external listeners about the new tip.
+            GetMainSignals().UpdatedBlockTip(pindexNewTip);
+        }
+    } while (pindexNewTip != pindexMostWork);
+    CheckBlockIndex(chainparams.GetConsensus());
+
+    // Write changes periodically to disk, after relay.
+    if (!FlushStateToDisk(chainparams, state, FLUSH_STATE_PERIODIC)) {
+        return false;
+    }
+
+    return true;
+}
+
+bool InvalidateBlock(CValidationState& state, const CChainParams& chainparams, CBlockIndex *pindex)
+{
+    AssertLockHeld(cs_main);
+
+    // Mark the block itself as invalid.
+    pindex->nStatus |= BLOCK_FAILED_VALID;
+    setDirtyBlockIndex.insert(pindex);
+    setBlockIndexCandidates.erase(pindex);
+
+    while (chainActive.Contains(pindex)) {
+        CBlockIndex *pindexWalk = chainActive.Tip();
+        pindexWalk->nStatus |= BLOCK_FAILED_CHILD;
+        setDirtyBlockIndex.insert(pindexWalk);
+        setBlockIndexCandidates.erase(pindexWalk);
+        // ActivateBestChain considers blocks already in chainActive
+        // unconditionally valid already, so force disconnect away from it.
+        if (!DisconnectTip(state, chainparams)) {
+            mempool.removeForReorg(pcoinsTip, chainActive.Tip()->nHeight + 1, STANDARD_LOCKTIME_VERIFY_FLAGS);
+            mempool.removeWithoutBranchId(
+                CurrentEpochBranchId(chainActive.Tip()->nHeight + 1, chainparams.GetConsensus()));
+            return false;
+        }
+    }
+
+    // The resulting new best tip may not be in setBlockIndexCandidates anymore, so
+    // add it again.
+    BlockMap::iterator it = mapBlockIndex.begin();
+    while (it != mapBlockIndex.end()) {
+        if (it->second->IsValid(BLOCK_VALID_TRANSACTIONS) && it->second->nChainTx && !setBlockIndexCandidates.value_comp()(it->second, chainActive.Tip())) {
+            setBlockIndexCandidates.insert(it->second);
+        }
+        it++;
+    }
+
+    InvalidChainFound(pindex, chainparams);
+    mempool.removeForReorg(pcoinsTip, chainActive.Tip()->nHeight + 1, STANDARD_LOCKTIME_VERIFY_FLAGS);
+    mempool.removeWithoutBranchId(
+        CurrentEpochBranchId(chainActive.Tip()->nHeight + 1, chainparams.GetConsensus()));
+    return true;
+}
+
+bool ReconsiderBlock(CValidationState& state, CBlockIndex *pindex) {
+    AssertLockHeld(cs_main);
+
+    int nHeight = pindex->nHeight;
+
+    // Remove the invalidity flag from this block and all its descendants.
+    BlockMap::iterator it = mapBlockIndex.begin();
+    while (it != mapBlockIndex.end()) {
+        if (!it->second->IsValid() && it->second->GetAncestor(nHeight) == pindex) {
+            it->second->nStatus &= ~BLOCK_FAILED_MASK;
+            setDirtyBlockIndex.insert(it->second);
+            if (it->second->IsValid(BLOCK_VALID_TRANSACTIONS) && it->second->nChainTx && setBlockIndexCandidates.value_comp()(chainActive.Tip(), it->second)) {
+                setBlockIndexCandidates.insert(it->second);
+            }
+            if (it->second == pindexBestInvalid) {
+                // Reset invalid block marker if it was pointing to one of those.
+                pindexBestInvalid = NULL;
+            }
+        }
+        it++;
+    }
+
+    // Remove the invalidity flag from all ancestors too.
+    while (pindex != NULL) {
+        if (pindex->nStatus & BLOCK_FAILED_MASK) {
+            pindex->nStatus &= ~BLOCK_FAILED_MASK;
+            setDirtyBlockIndex.insert(pindex);
+        }
+        pindex = pindex->pprev;
+    }
+    return true;
+}
+
+CBlockIndex* AddToBlockIndex(const CBlockHeader& block, const Consensus::Params& consensusParams)
+{
+    // Check for duplicate
+    uint256 hash = block.GetHash();
+    BlockMap::iterator it = mapBlockIndex.find(hash);
+    if (it != mapBlockIndex.end())
+        return it->second;
+
+    // Construct new block index object
+    CBlockIndex* pindexNew = new CBlockIndex(block);
+    assert(pindexNew);
+    // We assign the sequence id to blocks only when the full data is available,
+    // to avoid miners withholding blocks but broadcasting headers, to get a
+    // competitive advantage.
+    pindexNew->nSequenceId = 0;
+    BlockMap::iterator mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
+    pindexNew->phashBlock = &((*mi).first);
+    BlockMap::iterator miPrev = mapBlockIndex.find(block.hashPrevBlock);
+    if (miPrev != mapBlockIndex.end())
+    {
+        pindexNew->pprev = (*miPrev).second;
+        pindexNew->nHeight = pindexNew->pprev->nHeight + 1;
+
+        if (consensusParams.NetworkUpgradeActive(pindexNew->nHeight, Consensus::UPGRADE_NU5)) {
+            // The following hashes will be null if this block has never been
+            // connected to a main chain; they will be (re)set correctly in
+            // ConnectBlock:
+            // - hashFinalSaplingRoot
+            // - hashFinalOrchardRoot
+            // - hashChainHistoryRoot
+        } else if (IsActivationHeight(pindexNew->nHeight, consensusParams, Consensus::UPGRADE_HEARTWOOD)) {
+            // hashFinalSaplingRoot and hashFinalOrchardRoot will be null if this block has
+            // never been connected to a main chain; they will be (re)set correctly in
+            // ConnectBlock.
+            // hashChainHistoryRoot is null.
+        } else if (consensusParams.NetworkUpgradeActive(pindexNew->nHeight, Consensus::UPGRADE_HEARTWOOD)) {
+            // hashFinalSaplingRoot and hashFinalOrchardRoot will be null if this block has
+            // never been connected to a main chain; they will be (re)set correctly in
+            // ConnectBlock.
+            pindexNew->hashChainHistoryRoot = pindexNew->hashBlockCommitments;
+        } else {
+            // hashFinalOrchardRoot and hashChainHistoryRoot are null.
+            pindexNew->hashFinalSaplingRoot = pindexNew->hashBlockCommitments;
+        }
+
+        pindexNew->BuildSkip();
+    }
+    pindexNew->nChainWork = (pindexNew->pprev ? pindexNew->pprev->nChainWork : 0) + GetBlockProof(*pindexNew);
+    pindexNew->RaiseValidity(BLOCK_VALID_TREE);
+    if (pindexBestHeader == NULL || pindexBestHeader->nChainWork < pindexNew->nChainWork)
+        pindexBestHeader = pindexNew;
+
+    setDirtyBlockIndex.insert(pindexNew);
+
+    return pindexNew;
+}
+
+void FallbackSproutValuePoolBalance(
+    CBlockIndex *pindex,
+    const CChainParams& chainparams
+)
+{
+    if (!chainparams.ZIP209Enabled()) {
+        return;
+    }
+
+    // When developer option -developersetpoolsizezero is enabled, we don't need a fallback balance.
+    if (fExperimentalDeveloperSetPoolSizeZero) {
+        return;
+    }
+
+    // Check if the height of this block matches the checkpoint
+    if (pindex->nHeight == chainparams.SproutValuePoolCheckpointHeight()) {
+        if (pindex->GetBlockHash() == chainparams.SproutValuePoolCheckpointBlockHash()) {
+            // Are we monitoring the Sprout pool?
+            if (!pindex->nChainSproutValue) {
+                // Apparently not. Introduce the hardcoded value so we monitor for
+                // this point onwards (assuming the checkpoint is late enough)
+                pindex->nChainSproutValue = chainparams.SproutValuePoolCheckpointBalance();
+            } else {
+                // Apparently we have been. So, we should expect the current
+                // value to match the hardcoded one.
+                assert(*pindex->nChainSproutValue == chainparams.SproutValuePoolCheckpointBalance());
+                // And we should expect non-none for the delta stored in the block index here,
+                // or the checkpoint is too early.
+                assert(pindex->nSproutValue != std::nullopt);
+            }
+        } else {
+            LogPrintf(
+                "FallbackSproutValuePoolBalance(): fallback block hash is incorrect, we got %s\n",
+                pindex->GetBlockHash().ToString()
+            );
+        }
+    }
+}
+
+/** Mark a block as having its data received and checked (up to BLOCK_VALID_TRANSACTIONS). */
+bool ReceivedBlockTransactions(
+    const CBlock &block,
+    CValidationState& state,
+    const CChainParams& chainparams,
+    CBlockIndex *pindexNew,
+    const CDiskBlockPos& pos)
+{
+    pindexNew->nTx = block.vtx.size();
+    pindexNew->nChainTx = 0;
+    CAmount sproutValue = 0;
+    CAmount saplingValue = 0;
+    CAmount orchardValue = 0;
+    for (auto tx : block.vtx) {
+        // Negative valueBalanceSapling "takes" money from the transparent value pool
+        // and adds it to the Sapling value pool. Positive valueBalanceSapling "gives"
+        // money to the transparent value pool, removing from the Sapling value
+        // pool. So we invert the sign here.
+        saplingValue += -tx.GetValueBalanceSapling();
+
+        // valueBalanceOrchard behaves the same way as valueBalanceSapling.
+        orchardValue += -tx.GetOrchardBundle().GetValueBalance();
+
+        for (auto js : tx.vJoinSplit) {
+            sproutValue += js.vpub_old;
+            sproutValue -= js.vpub_new;
+        }
+    }
+    pindexNew->nSproutValue = sproutValue;
+    pindexNew->nChainSproutValue = std::nullopt;
+    pindexNew->nSaplingValue = saplingValue;
+    pindexNew->nChainSaplingValue = std::nullopt;
+    pindexNew->nOrchardValue = orchardValue;
+    pindexNew->nChainOrchardValue = std::nullopt;
+    pindexNew->nFile = pos.nFile;
+    pindexNew->nDataPos = pos.nPos;
+    pindexNew->nUndoPos = 0;
+    pindexNew->nStatus |= BLOCK_HAVE_DATA;
+    pindexNew->RaiseValidity(BLOCK_VALID_TRANSACTIONS);
+    setDirtyBlockIndex.insert(pindexNew);
+
+    if (pindexNew->pprev == NULL || pindexNew->pprev->nChainTx) {
+        // If pindexNew is the genesis block or all parents are BLOCK_VALID_TRANSACTIONS.
+        deque<CBlockIndex*> queue;
+        queue.push_back(pindexNew);
+
+        // Recursively process any descendant blocks that now may be eligible to be connected.
+        while (!queue.empty()) {
+            CBlockIndex *pindex = queue.front();
+            queue.pop_front();
+            pindex->nChainTx = (pindex->pprev ? pindex->pprev->nChainTx : 0) + pindex->nTx;
+            if (pindex->pprev) {
+                if (pindex->pprev->nChainSproutValue && pindex->nSproutValue) {
+                    pindex->nChainSproutValue = *pindex->pprev->nChainSproutValue + *pindex->nSproutValue;
+                } else {
+                    pindex->nChainSproutValue = std::nullopt;
+                }
+                if (pindex->pprev->nChainSaplingValue) {
+                    pindex->nChainSaplingValue = *pindex->pprev->nChainSaplingValue + pindex->nSaplingValue;
+                } else {
+                    pindex->nChainSaplingValue = std::nullopt;
+                }
+                if (pindex->pprev->nChainOrchardValue) {
+                    pindex->nChainOrchardValue = *pindex->pprev->nChainOrchardValue + pindex->nOrchardValue;
+                } else {
+                    pindex->nChainOrchardValue = std::nullopt;
+                }
+            } else {
+                pindex->nChainSproutValue = pindex->nSproutValue;
+                pindex->nChainSaplingValue = pindex->nSaplingValue;
+                pindex->nChainOrchardValue = pindex->nOrchardValue;
+            }
+
+            // Fall back to hardcoded Sprout value pool balance
+            FallbackSproutValuePoolBalance(pindex, chainparams);
+
+            {
+                LOCK(cs_nBlockSequenceId);
+                pindex->nSequenceId = nBlockSequenceId++;
+            }
+            if (chainActive.Tip() == NULL || !setBlockIndexCandidates.value_comp()(pindex, chainActive.Tip())) {
+                setBlockIndexCandidates.insert(pindex);
+            }
+            std::pair<std::multimap<CBlockIndex*, CBlockIndex*>::iterator, std::multimap<CBlockIndex*, CBlockIndex*>::iterator> range = mapBlocksUnlinked.equal_range(pindex);
+            while (range.first != range.second) {
+                queue.push_back(range.first->second);
+                range.first = mapBlocksUnlinked.erase(range.first);
+            }
+        }
+    } else {
+        if (pindexNew->pprev && pindexNew->pprev->IsValid(BLOCK_VALID_TREE)) {
+            mapBlocksUnlinked.insert(std::make_pair(pindexNew->pprev, pindexNew));
+        }
+    }
+
+    return true;
+}
+
+bool FindBlockPos(CValidationState &state, CDiskBlockPos &pos, unsigned int nAddSize, unsigned int nHeight, uint64_t nTime, bool fKnown = false)
+{
+    LOCK(cs_LastBlockFile);
+
+    unsigned int nFile = fKnown ? pos.nFile : nLastBlockFile;
+    if (vinfoBlockFile.size() <= nFile) {
+        vinfoBlockFile.resize(nFile + 1);
+    }
+
+    if (!fKnown) {
+        while (vinfoBlockFile[nFile].nSize + nAddSize >= MAX_BLOCKFILE_SIZE) {
+            nFile++;
+            if (vinfoBlockFile.size() <= nFile) {
+                vinfoBlockFile.resize(nFile + 1);
+            }
+        }
+        pos.nFile = nFile;
+        pos.nPos = vinfoBlockFile[nFile].nSize;
+    }
+
+    if (nFile != nLastBlockFile) {
+        if (!fKnown) {
+            LogPrintf("Leaving block file %i: %s\n", nFile, vinfoBlockFile[nFile].ToString());
+        }
+        FlushBlockFile(!fKnown);
+        nLastBlockFile = nFile;
+    }
+
+    vinfoBlockFile[nFile].AddBlock(nHeight, nTime);
+    if (fKnown)
+        vinfoBlockFile[nFile].nSize = std::max(pos.nPos + nAddSize, vinfoBlockFile[nFile].nSize);
+    else
+        vinfoBlockFile[nFile].nSize += nAddSize;
+
+    if (!fKnown) {
+        unsigned int nOldChunks = (pos.nPos + BLOCKFILE_CHUNK_SIZE - 1) / BLOCKFILE_CHUNK_SIZE;
+        unsigned int nNewChunks = (vinfoBlockFile[nFile].nSize + BLOCKFILE_CHUNK_SIZE - 1) / BLOCKFILE_CHUNK_SIZE;
+        if (nNewChunks > nOldChunks) {
+            if (fPruneMode)
+                fCheckForPruning = true;
+            if (CheckDiskSpace(nNewChunks * BLOCKFILE_CHUNK_SIZE - pos.nPos)) {
+                FILE *file = OpenBlockFile(pos);
+                if (file) {
+                    LogPrintf("Pre-allocating up to position 0x%x in blk%05u.dat\n", nNewChunks * BLOCKFILE_CHUNK_SIZE, pos.nFile);
+                    AllocateFileRange(file, pos.nPos, nNewChunks * BLOCKFILE_CHUNK_SIZE - pos.nPos);
+                    fclose(file);
+                }
+            }
+            else
+                return state.Error("out of disk space");
+        }
+    }
+
+    setDirtyFileInfo.insert(nFile);
+    return true;
+}
+
+bool FindUndoPos(CValidationState &state, int nFile, CDiskBlockPos &pos, unsigned int nAddSize)
+{
+    pos.nFile = nFile;
+
+    LOCK(cs_LastBlockFile);
+
+    unsigned int nNewSize;
+    pos.nPos = vinfoBlockFile[nFile].nUndoSize;
+    nNewSize = vinfoBlockFile[nFile].nUndoSize += nAddSize;
+    setDirtyFileInfo.insert(nFile);
+
+    unsigned int nOldChunks = (pos.nPos + UNDOFILE_CHUNK_SIZE - 1) / UNDOFILE_CHUNK_SIZE;
+    unsigned int nNewChunks = (nNewSize + UNDOFILE_CHUNK_SIZE - 1) / UNDOFILE_CHUNK_SIZE;
+    if (nNewChunks > nOldChunks) {
+        if (fPruneMode)
+            fCheckForPruning = true;
+        if (CheckDiskSpace(nNewChunks * UNDOFILE_CHUNK_SIZE - pos.nPos)) {
+            FILE *file = OpenUndoFile(pos);
+            if (file) {
+                LogPrintf("Pre-allocating up to position 0x%x in rev%05u.dat\n", nNewChunks * UNDOFILE_CHUNK_SIZE, pos.nFile);
+                AllocateFileRange(file, pos.nPos, nNewChunks * UNDOFILE_CHUNK_SIZE - pos.nPos);
+                fclose(file);
+            }
+        }
+        else
+            return state.Error("out of disk space");
+    }
+
+    return true;
+}
+
+bool CheckBlockHeader(
+    const CBlockHeader& block,
+    CValidationState& state,
+    const CChainParams& chainparams,
+    bool fCheckPOW)
+{
+    // Check block version
+    if (block.nVersion < MIN_BLOCK_VERSION)
+        return state.DoS(100, error("CheckBlockHeader(): block version too low"),
+                         REJECT_INVALID, "version-too-low");
+
+    // Check Equihash solution is valid
+    if (fCheckPOW && !CheckEquihashSolution(&block, chainparams.GetConsensus()))
+        return state.DoS(100, error("CheckBlockHeader(): Equihash solution invalid"),
+                         REJECT_INVALID, "invalid-solution");
+
+    // Check proof of work matches claimed amount
+    if (fCheckPOW && !CheckProofOfWork(block.GetHash(), block.nBits, chainparams.GetConsensus()))
+        return state.DoS(50, error("CheckBlockHeader(): proof of work failed"),
+                         REJECT_INVALID, "high-hash");
+
+    return true;
+}
+
+bool CheckBlock(const CBlock& block,
+                CValidationState& state,
+                const CChainParams& chainparams,
+                ProofVerifier& verifier,
+                bool fCheckPOW,
+                bool fCheckMerkleRoot,
+                bool fCheckTransactions)
+{
+    // These are checks that are independent of context.
+
+    // Check that the header is valid (particularly PoW).  This is mostly
+    // redundant with the call in AcceptBlockHeader.
+    if (!CheckBlockHeader(block, state, chainparams, fCheckPOW))
+        return false;
+
+    // Check the merkle root.
+    if (fCheckMerkleRoot) {
+        bool mutated;
+        uint256 hashMerkleRoot2 = block.BuildMerkleTree(&mutated);
+        if (block.hashMerkleRoot != hashMerkleRoot2)
+            return state.DoS(100, error("CheckBlock(): hashMerkleRoot mismatch"),
+                             REJECT_INVALID, "bad-txnmrklroot", true);
+
+        // Check for merkle tree malleability (CVE-2012-2459): repeating sequences
+        // of transactions in a block without affecting the merkle root of a block,
+        // while still invalidating it.
+        if (mutated)
+            return state.DoS(100, error("CheckBlock(): duplicate transaction"),
+                             REJECT_INVALID, "bad-txns-duplicate", true);
+    }
+
+    // All potential-corruption validation must be done before we do any
+    // transaction validation, as otherwise we may mark the header as invalid
+    // because we receive the wrong transactions for it.
+
+    // Size limits
+    if (block.vtx.empty() || block.vtx.size() > MAX_BLOCK_SIZE || ::GetSerializeSize(block, SER_NETWORK, PROTOCOL_VERSION) > MAX_BLOCK_SIZE)
+        return state.DoS(100, error("CheckBlock(): size limits failed"),
+                         REJECT_INVALID, "bad-blk-length");
+
+    // First transaction must be coinbase, the rest must not be
+    if (block.vtx.empty() || !block.vtx[0].IsCoinBase())
+        return state.DoS(100, error("CheckBlock(): first tx is not coinbase"),
+                         REJECT_INVALID, "bad-cb-missing");
+    for (unsigned int i = 1; i < block.vtx.size(); i++)
+        if (block.vtx[i].IsCoinBase())
+            return state.DoS(100, error("CheckBlock(): more than one coinbase"),
+                             REJECT_INVALID, "bad-cb-multiple");
+
+    // skip all transaction checks if this flag is not set
+    if (!fCheckTransactions) return true;
+
+    // Check transactions
+    for (const CTransaction& tx : block.vtx)
+        if (!CheckTransaction(tx, state, verifier))
+            return error("CheckBlock(): CheckTransaction of %s failed with %s",
+                tx.GetHash().ToString(),
+                FormatStateMessage(state));
+
+    unsigned int nSigOps = 0;
+    for (const CTransaction& tx : block.vtx)
+    {
+        nSigOps += GetLegacySigOpCount(tx);
+    }
+    if (nSigOps > MAX_BLOCK_SIGOPS)
+        return state.DoS(100, error("CheckBlock(): out-of-bounds SigOpCount"),
+                         REJECT_INVALID, "bad-blk-sigops", true);
+
+    return true;
+}
+
+bool ContextualCheckBlockHeader(
+    const CBlockHeader& block, CValidationState& state,
+    const CChainParams& chainParams, CBlockIndex * const pindexPrev)
+{
+    const Consensus::Params& consensusParams = chainParams.GetConsensus();
+    uint256 hash = block.GetHash();
+    if (hash == consensusParams.hashGenesisBlock) {
+        return true;
+    }
+
+    assert(pindexPrev);
+
+    int nHeight = pindexPrev->nHeight+1;
+
+    // Check proof of work
+    if (block.nBits != GetNextWorkRequired(pindexPrev, &block, consensusParams)) {
+        return state.DoS(100, error("%s: incorrect proof of work", __func__),
+                         REJECT_INVALID, "bad-diffbits");
+    }
+
+    // Check timestamp against prev
+    auto medianTimePast = pindexPrev->GetMedianTimePast();
+    if (block.GetBlockTime() <= medianTimePast) {
+        return state.Invalid(error("%s: block at height %d, timestamp %d is not later than median-time-past %d",
+                                   __func__, nHeight, block.GetBlockTime(), medianTimePast),
+                             REJECT_INVALID, "time-too-old");
+    }
+
+    // Check future timestamp soft fork rule introduced in v2.1.1-1.
+    // This retrospectively activates at block height 2 for mainnet and regtest,
+    // and 6 blocks after Blossom activation for testnet.
+    // Explanations of these activation heights are in src/consensus/params.h
+    // and chainparams.cpp.
+    //
+    if (consensusParams.FutureTimestampSoftForkActive(nHeight) &&
+          block.GetBlockTime() > medianTimePast + MAX_FUTURE_BLOCK_TIME_MTP) {
+        return state.Invalid(error("%s: block at height %d, timestamp %d is too far ahead of median-time-past, limit is %d",
+                                   __func__, nHeight, block.GetBlockTime(), medianTimePast + MAX_FUTURE_BLOCK_TIME_MTP),
+                             REJECT_INVALID, "time-too-far-ahead-of-mtp");
+    }
+
+    // Check timestamp
+    auto nTimeLimit = GetTime() + MAX_FUTURE_BLOCK_TIME_LOCAL;
+    if (block.GetBlockTime() > nTimeLimit) {
+        return state.Invalid(error("%s: block at height %d, timestamp %d is too far ahead of local time, limit is %d",
+                                   __func__, nHeight, block.GetBlockTime(), nTimeLimit),
+                             REJECT_INVALID, "time-too-new");
+    }
+
+    if (fCheckpointsEnabled) {
+        // Don't accept any forks from the main chain prior to last checkpoint
+        CBlockIndex* pcheckpoint = Checkpoints::GetLastCheckpoint(chainParams.Checkpoints());
+        if (pcheckpoint && nHeight < pcheckpoint->nHeight) {
+            return state.DoS(100, error("%s: forked chain older than last checkpoint (height %d)", __func__, nHeight));
+        }
+    }
+
+    // Reject block.nVersion < 4 blocks
+    if (block.nVersion < 4) {
+        return state.Invalid(error("%s : rejected nVersion<4 block", __func__),
+                             REJECT_OBSOLETE, "bad-version");
+    }
+
+    return true;
+}
+
+bool ContextualCheckBlock(
+    const CBlock& block, CValidationState& state,
+    const CChainParams& chainparams, CBlockIndex * const pindexPrev,
+    bool fCheckTransactions)
+{
+    const int nHeight = pindexPrev == NULL ? 0 : pindexPrev->nHeight + 1;
+    const Consensus::Params& consensusParams = chainparams.GetConsensus();
+
+    if (fCheckTransactions) {
+        // Check that all transactions are finalized
+        for (const CTransaction& tx : block.vtx) {
+
+            // Check transaction contextually against consensus rules at block height
+            if (!ContextualCheckTransaction(tx, state, chainparams, nHeight, true)) {
+                return false; // Failure reason has been set in validation state object
+            }
+
+            int nLockTimeFlags = 0;
+            int64_t nLockTimeCutoff = (nLockTimeFlags & LOCKTIME_MEDIAN_TIME_PAST)
+                                    ? pindexPrev->GetMedianTimePast()
+                                    : block.GetBlockTime();
+            if (!IsFinalTx(tx, nHeight, nLockTimeCutoff)) {
+                return state.DoS(10, error("%s: contains a non-final transaction", __func__),
+                                 REJECT_INVALID, "bad-txns-nonfinal");
+            }
+        }
+    }
+
+    // Enforce BIP 34 rule that the coinbase starts with serialized block height.
+    // In Zcash this has been enforced since launch, except that the genesis
+    // block didn't include the height in the coinbase (see Zcash protocol spec
+    // section '6.8 Bitcoin Improvement Proposals').
+    if (nHeight > 0)
+    {
+        CScript expect = CScript() << nHeight;
+        if (block.vtx[0].vin[0].scriptSig.size() < expect.size() ||
+            !std::equal(expect.begin(), expect.end(), block.vtx[0].vin[0].scriptSig.begin())) {
+            return state.DoS(100, error("%s: block height mismatch in coinbase", __func__),
+                             REJECT_INVALID, "bad-cb-height");
+        }
+    }
+
+    // ZIP 203: From NU5 onwards, nExpiryHeight is set to the block height in coinbase
+    // transactions.
+    if (consensusParams.NetworkUpgradeActive(nHeight, Consensus::UPGRADE_NU5)) {
+        if (block.vtx[0].nExpiryHeight != nHeight) {
+            return state.DoS(100, error("%s: block height mismatch in nExpiryHeight", __func__),
+                             REJECT_INVALID, "bad-cb-height");
+        }
+    }
+
+    if (consensusParams.NetworkUpgradeActive(nHeight, Consensus::UPGRADE_CANOPY)) {
+        // Funding streams are checked inside ContextualCheckTransaction.
+        // This empty conditional branch exists to enforce this ZIP 207 consensus rule:
+        //
+        //     Once the Canopy network upgrade activates, the existing consensus rule for
+        //     payment of the Founders' Reward is no longer active.
+    } else if ((nHeight > 0) && (nHeight <= consensusParams.GetLastFoundersRewardBlockHeight(nHeight))) {
+        // Coinbase transaction must include an output sending 20% of
+        // the block subsidy to a Founders' Reward script, until the last Founders'
+        // Reward block is reached, with exception of the genesis block.
+        // The last Founders' Reward block is defined as the block just before the
+        // first subsidy halving block, which occurs at halving_interval + slow_start_shift.
+        bool found = false;
+
+        for (const CTxOut& output : block.vtx[0].vout) {
+            if (output.scriptPubKey == chainparams.GetFoundersRewardScriptAtHeight(nHeight)) {
+                if (output.nValue == (GetBlockSubsidy(nHeight, consensusParams) / 5)) {
+                    found = true;
+                    break;
+                }
+            }
+        }
+
+        if (!found) {
+            return state.DoS(100, error("%s: founders reward missing", __func__),
+                             REJECT_INVALID, "cb-no-founders-reward");
+        }
+    }
+
+    return true;
+}
+
+static bool AcceptBlockHeader(const CBlockHeader& block, CValidationState& state, const CChainParams& chainparams, CBlockIndex** ppindex=NULL)
+{
+    AssertLockHeld(cs_main);
+    // Check for duplicate
+    uint256 hash = block.GetHash();
+    BlockMap::iterator miSelf = mapBlockIndex.find(hash);
+    CBlockIndex *pindex = NULL;
+    if (miSelf != mapBlockIndex.end()) {
+        // Block header is already known.
+        pindex = miSelf->second;
+        if (ppindex)
+            *ppindex = pindex;
+        if (pindex->nStatus & BLOCK_FAILED_MASK)
+            return state.Invalid(error("%s: block is marked invalid", __func__), 0, "duplicate");
+        return true;
+    }
+
+    if (!CheckBlockHeader(block, state, chainparams))
+        return false;
+
+    // Get prev block index
+    CBlockIndex* pindexPrev = NULL;
+    if (hash != chainparams.GetConsensus().hashGenesisBlock) {
+        BlockMap::iterator mi = mapBlockIndex.find(block.hashPrevBlock);
+        if (mi == mapBlockIndex.end())
+            return state.DoS(10, error("%s: prev block not found", __func__), 0, "bad-prevblk");
+        pindexPrev = (*mi).second;
+        if (pindexPrev->nStatus & BLOCK_FAILED_MASK)
+            return state.DoS(100, error("%s: prev block invalid", __func__), REJECT_INVALID, "bad-prevblk");
+    }
+
+    if (!ContextualCheckBlockHeader(block, state, chainparams, pindexPrev))
+        return false;
+
+    if (pindex == NULL)
+        pindex = AddToBlockIndex(block, chainparams.GetConsensus());
+
+    if (ppindex)
+        *ppindex = pindex;
+
+    return true;
+}
+
+/**
+ * Store block on disk.
+ * If dbp is non-NULL, the file is known to already reside on disk.
+ *
+ * JoinSplit proofs are not verified here; the only
+ * caller of AcceptBlock (ProcessNewBlock) later invokes ActivateBestChain,
+ * which ultimately calls ConnectBlock in a manner that can verify the proofs.
+ */
+static bool AcceptBlock(const CBlock& block, CValidationState& state, const CChainParams& chainparams, CBlockIndex** ppindex, bool fRequested, const CDiskBlockPos* dbp)
+{
+    AssertLockHeld(cs_main);
+
+    CBlockIndex *pindexDummy = NULL;
+    CBlockIndex *&pindex = ppindex ? *ppindex : pindexDummy;
+
+    if (!AcceptBlockHeader(block, state, chainparams, &pindex))
+        return false;
+
+    // Try to process all requested blocks that we don't have, but only
+    // process an unrequested block if it's new and has enough work to
+    // advance our tip, and isn't too many blocks ahead.
+    bool fAlreadyHave = pindex->nStatus & BLOCK_HAVE_DATA;
+    bool fHasMoreWork = (chainActive.Tip() ? pindex->nChainWork > chainActive.Tip()->nChainWork : true);
+    // Blocks that are too out-of-order needlessly limit the effectiveness of
+    // pruning, because pruning will not delete block files that contain any
+    // blocks which are too close in height to the tip.  Apply this test
+    // regardless of whether pruning is enabled; it should generally be safe to
+    // not process unrequested blocks.
+    bool fTooFarAhead = (pindex->nHeight > int(chainActive.Height() + MIN_BLOCKS_TO_KEEP));
+
+    // TODO: deal better with return value and error conditions for duplicate
+    // and unrequested blocks.
+    if (fAlreadyHave) return true;
+    if (!fRequested) {  // If we didn't ask for it:
+        if (pindex->nTx != 0) return true;  // This is a previously-processed block that was pruned
+        if (!fHasMoreWork) return true;     // Don't process less-work chains
+        if (fTooFarAhead) return true;      // Block height is too high
+    }
+
+    // See method docstring for why these are always disabled.
+    auto verifier = ProofVerifier::Disabled();
+
+    bool fCheckTransactions = ShouldCheckTransactions(chainparams, pindex);
+    if ((!CheckBlock(block, state, chainparams, verifier, true, true, fCheckTransactions)) ||
+         !ContextualCheckBlock(block, state, chainparams, pindex->pprev, fCheckTransactions)) {
+        if (state.IsInvalid() && !state.CorruptionPossible()) {
+            pindex->nStatus |= BLOCK_FAILED_VALID;
+            setDirtyBlockIndex.insert(pindex);
+        }
+        return false;
+    }
+
+    int nHeight = pindex->nHeight;
+
+    // Write block to history file
+    try {
+        unsigned int nBlockSize = ::GetSerializeSize(block, SER_DISK, CLIENT_VERSION);
+        CDiskBlockPos blockPos;
+        if (dbp != NULL)
+            blockPos = *dbp;
+        if (!FindBlockPos(state, blockPos, nBlockSize+8, nHeight, block.GetBlockTime(), dbp != NULL))
+            return error("AcceptBlock(): FindBlockPos failed");
+        if (dbp == NULL)
+            if (!WriteBlockToDisk(block, blockPos, chainparams.MessageStart()))
+                AbortNode(state, "Failed to write block");
+        if (!ReceivedBlockTransactions(block, state, chainparams, pindex, blockPos))
+            return error("AcceptBlock(): ReceivedBlockTransactions failed");
+    } catch (const std::runtime_error& e) {
+        return AbortNode(state, std::string("System error: ") + e.what());
+    }
+
+    if (fCheckForPruning)
+        FlushStateToDisk(chainparams, state, FLUSH_STATE_NONE); // we just allocated more disk space for block files
+
+    return true;
+}
+
+static bool IsSuperMajority(int minVersion, const CBlockIndex* pstart, unsigned nRequired, const Consensus::Params& consensusParams)
+{
+    unsigned int nFound = 0;
+    for (int i = 0; i < consensusParams.nMajorityWindow && nFound < nRequired && pstart != NULL; i++)
+    {
+        if (pstart->nVersion >= minVersion)
+            ++nFound;
+        pstart = pstart->pprev;
+    }
+    return (nFound >= nRequired);
+}
+
+
+bool ProcessNewBlock(CValidationState& state, const CChainParams& chainparams, const CNode* pfrom, const CBlock* pblock, bool fForceProcessing, const CDiskBlockPos* dbp)
+{
+    auto span = TracingSpan("info", "main", "ProcessNewBlock");
+    auto spanGuard = span.Enter();
+
+    {
+        LOCK(cs_main);
+        bool fRequested = MarkBlockAsReceived(pblock->GetHash()) | fForceProcessing;
+
+        // Store to disk
+        CBlockIndex *pindex = NULL;
+        bool ret = AcceptBlock(*pblock, state, chainparams, &pindex, fRequested, dbp);
+        if (pindex && pfrom) {
+            mapBlockSource[pindex->GetBlockHash()] = pfrom->GetId();
+        }
+        CheckBlockIndex(chainparams.GetConsensus());
+        if (!ret)
+            return error("%s: AcceptBlock FAILED", __func__);
+    }
+
+    NotifyHeaderTip(chainparams.GetConsensus());
+
+    if (!ActivateBestChain(state, chainparams, pblock))
+        return error("%s: ActivateBestChain failed", __func__);
+
+    return true;
+}
+
+/**
+ * This is only invoked by the miner.
+ * The block's proof-of-work is assumed invalid and not checked.
+ */
+bool TestBlockValidity(CValidationState& state, const CChainParams& chainparams, const CBlock& block, CBlockIndex* pindexPrev, bool fCheckMerkleRoot)
+{
+    AssertLockHeld(cs_main);
+    assert(pindexPrev == chainActive.Tip());
+
+    CCoinsViewCache viewNew(pcoinsTip);
+    CBlockIndex indexDummy(block);
+    indexDummy.pprev = pindexPrev;
+    indexDummy.nHeight = pindexPrev->nHeight + 1;
+
+    // JoinSplit proofs are verified in ConnectBlock
+    auto verifier = ProofVerifier::Disabled();
+
+    // NOTE: CheckBlockHeader is called by CheckBlock
+    if (!ContextualCheckBlockHeader(block, state, chainparams, pindexPrev))
+        return false;
+    // The following may be duplicative of the `CheckBlock` call within `ConnectBlock`
+    if (!CheckBlock(block, state, chainparams, verifier, false, fCheckMerkleRoot, true))
+        return false;
+    if (!ContextualCheckBlock(block, state, chainparams, pindexPrev, true))
+        return false;
+    if (!ConnectBlock(block, state, &indexDummy, viewNew, chainparams, true, fCheckMerkleRoot))
+        return false;
+    assert(state.IsValid());
+
+    return true;
+}
+
+/**
+ * BLOCK PRUNING CODE
+ */
+
+/* Calculate the amount of disk space the block & undo files currently use */
+uint64_t CalculateCurrentUsage()
+{
+    uint64_t retval = 0;
+    for (const CBlockFileInfo &file : vinfoBlockFile) {
+        retval += file.nSize + file.nUndoSize;
+    }
+    return retval;
+}
+
+/* Prune a block file (modify associated database entries)*/
+void PruneOneBlockFile(const int fileNumber)
+{
+    for (BlockMap::iterator it = mapBlockIndex.begin(); it != mapBlockIndex.end(); ++it) {
+        CBlockIndex* pindex = it->second;
+        if (pindex->nFile == fileNumber) {
+            pindex->nStatus &= ~BLOCK_HAVE_DATA;
+            pindex->nStatus &= ~BLOCK_HAVE_UNDO;
+            pindex->nFile = 0;
+            pindex->nDataPos = 0;
+            pindex->nUndoPos = 0;
+            setDirtyBlockIndex.insert(pindex);
+
+            // Prune from mapBlocksUnlinked -- any block we prune would have
+            // to be downloaded again in order to consider its chain, at which
+            // point it would be considered as a candidate for
+            // mapBlocksUnlinked or setBlockIndexCandidates.
+            std::pair<std::multimap<CBlockIndex*, CBlockIndex*>::iterator, std::multimap<CBlockIndex*, CBlockIndex*>::iterator> range = mapBlocksUnlinked.equal_range(pindex->pprev);
+            while (range.first != range.second) {
+                if (range.first->second == pindex) {
+                    range.first = mapBlocksUnlinked.erase(range.first);
+                } else {
+                    ++range.first;
+                }
+            }
+        }
+    }
+
+    vinfoBlockFile[fileNumber].SetNull();
+    setDirtyFileInfo.insert(fileNumber);
+}
+
+
+void UnlinkPrunedFiles(std::set<int>& setFilesToPrune)
+{
+    for (set<int>::iterator it = setFilesToPrune.begin(); it != setFilesToPrune.end(); ++it) {
+        CDiskBlockPos pos(*it, 0);
+        fs::remove(GetBlockPosFilename(pos, "blk"));
+        fs::remove(GetBlockPosFilename(pos, "rev"));
+        LogPrintf("Prune: %s deleted blk/rev (%05u)\n", __func__, *it);
+    }
+}
+
+/* Calculate the block/rev files that should be deleted to remain under target*/
+void FindFilesToPrune(std::set<int>& setFilesToPrune, uint64_t nPruneAfterHeight)
+{
+    LOCK2(cs_main, cs_LastBlockFile);
+    if (chainActive.Tip() == NULL || nPruneTarget == 0) {
+        return;
+    }
+    if (chainActive.Tip()->nHeight <= nPruneAfterHeight) {
+        return;
+    }
+
+    unsigned int nLastBlockWeCanPrune = chainActive.Tip()->nHeight - MIN_BLOCKS_TO_KEEP;
+    uint64_t nCurrentUsage = CalculateCurrentUsage();
+    // We don't check to prune until after we've allocated new space for files
+    // So we should leave a buffer under our target to account for another allocation
+    // before the next pruning.
+    uint64_t nBuffer = BLOCKFILE_CHUNK_SIZE + UNDOFILE_CHUNK_SIZE;
+    uint64_t nBytesToPrune;
+    int count=0;
+
+    if (nCurrentUsage + nBuffer >= nPruneTarget) {
+        for (int fileNumber = 0; fileNumber < nLastBlockFile; fileNumber++) {
+            nBytesToPrune = vinfoBlockFile[fileNumber].nSize + vinfoBlockFile[fileNumber].nUndoSize;
+
+            if (vinfoBlockFile[fileNumber].nSize == 0)
+                continue;
+
+            if (nCurrentUsage + nBuffer < nPruneTarget)  // are we below our target?
+                break;
+
+            // don't prune files that could have a block within MIN_BLOCKS_TO_KEEP of the main chain's tip but keep scanning
+            if (vinfoBlockFile[fileNumber].nHeightLast > nLastBlockWeCanPrune)
+                continue;
+
+            PruneOneBlockFile(fileNumber);
+            // Queue up the files for removal
+            setFilesToPrune.insert(fileNumber);
+            nCurrentUsage -= nBytesToPrune;
+            count++;
+        }
+    }
+
+    LogPrint("prune", "Prune: target=%dMiB actual=%dMiB diff=%dMiB max_prune_height=%d removed %d blk/rev pairs\n",
+           nPruneTarget/1024/1024, nCurrentUsage/1024/1024,
+           ((int64_t)nPruneTarget - (int64_t)nCurrentUsage)/1024/1024,
+           nLastBlockWeCanPrune, count);
+}
+
+bool CheckDiskSpace(uint64_t nAdditionalBytes)
+{
+    uint64_t nFreeBytesAvailable = fs::space(GetDataDir()).available;
+
+    // Check for nMinDiskSpace bytes (currently 50MB)
+    if (nFreeBytesAvailable < nMinDiskSpace + nAdditionalBytes)
+        return AbortNode("Disk space is low!", _("Error: Disk space is low!"));
+
+    return true;
+}
+
+FILE* OpenDiskFile(const CDiskBlockPos &pos, const char *prefix, bool fReadOnly)
+{
+    if (pos.IsNull())
+        return NULL;
+    fs::path path = GetBlockPosFilename(pos, prefix);
+    fs::create_directories(path.parent_path());
+    FILE* file = fsbridge::fopen(path, "rb+");
+    if (!file && !fReadOnly)
+        file = fsbridge::fopen(path, "wb+");
+    if (!file) {
+        LogPrintf("Unable to open file %s\n", path.string());
+        return NULL;
+    }
+    if (pos.nPos) {
+        if (fseek(file, pos.nPos, SEEK_SET)) {
+            LogPrintf("Unable to seek to position %u of %s\n", pos.nPos, path.string());
+            fclose(file);
+            return NULL;
+        }
+    }
+    return file;
+}
+
+FILE* OpenBlockFile(const CDiskBlockPos &pos, bool fReadOnly) {
+    return OpenDiskFile(pos, "blk", fReadOnly);
+}
+
+FILE* OpenUndoFile(const CDiskBlockPos &pos, bool fReadOnly) {
+    return OpenDiskFile(pos, "rev", fReadOnly);
+}
+
+fs::path GetBlockPosFilename(const CDiskBlockPos &pos, const char *prefix)
+{
+    return GetDataDir() / "blocks" / strprintf("%s%05u.dat", prefix, pos.nFile);
+}
+
+CBlockIndex * InsertBlockIndex(uint256 hash)
+{
+    if (hash.IsNull())
+        return NULL;
+
+    // Return existing
+    BlockMap::iterator mi = mapBlockIndex.find(hash);
+    if (mi != mapBlockIndex.end())
+        return (*mi).second;
+
+    // Create new
+    CBlockIndex* pindexNew = new CBlockIndex();
+    if (!pindexNew)
+        throw runtime_error("LoadBlockIndex(): new CBlockIndex failed");
+    mi = mapBlockIndex.insert(make_pair(hash, pindexNew)).first;
+    pindexNew->phashBlock = &((*mi).first);
+
+    return pindexNew;
+}
+
+bool static LoadBlockIndexDB(const CChainParams& chainparams)
+{
+    if (!pblocktree->LoadBlockIndexGuts(InsertBlockIndex, chainparams))
+        return false;
+
+    // Calculate nChainWork
+    vector<pair<int, CBlockIndex*> > vSortedByHeight;
+    vSortedByHeight.reserve(mapBlockIndex.size());
+    for (const std::pair<uint256, CBlockIndex*>& item : mapBlockIndex)
+    {
+        CBlockIndex* pindex = item.second;
+        vSortedByHeight.push_back(make_pair(pindex->nHeight, pindex));
+    }
+    sort(vSortedByHeight.begin(), vSortedByHeight.end());
+    for (const std::pair<int, CBlockIndex*>& item : vSortedByHeight)
+    {
+        CBlockIndex* pindex = item.second;
+        pindex->nChainWork = (pindex->pprev ? pindex->pprev->nChainWork : 0) + GetBlockProof(*pindex);
+        // We can link the chain of blocks for which we've received transactions at some point.
+        // Pruned nodes may have deleted the block.
+        if (pindex->nTx > 0) {
+            if (pindex->pprev) {
+                if (pindex->pprev->nChainTx) {
+                    pindex->nChainTx = pindex->pprev->nChainTx + pindex->nTx;
+                    if (pindex->pprev->nChainSproutValue && pindex->nSproutValue) {
+                        pindex->nChainSproutValue = *pindex->pprev->nChainSproutValue + *pindex->nSproutValue;
+                    } else {
+                        pindex->nChainSproutValue = std::nullopt;
+                    }
+                    if (pindex->pprev->nChainSaplingValue) {
+                        pindex->nChainSaplingValue = *pindex->pprev->nChainSaplingValue + pindex->nSaplingValue;
+                    } else {
+                        pindex->nChainSaplingValue = std::nullopt;
+                    }
+                    if (pindex->pprev->nChainOrchardValue) {
+                        pindex->nChainOrchardValue = *pindex->pprev->nChainOrchardValue + pindex->nOrchardValue;
+                    } else {
+                        pindex->nChainOrchardValue = std::nullopt;
+                    }
+                } else {
+                    pindex->nChainTx = 0;
+                    pindex->nChainSproutValue = std::nullopt;
+                    pindex->nChainSaplingValue = std::nullopt;
+                    pindex->nChainOrchardValue = std::nullopt;
+                    mapBlocksUnlinked.insert(std::make_pair(pindex->pprev, pindex));
+                }
+            } else {
+                pindex->nChainTx = pindex->nTx;
+                pindex->nChainSproutValue = pindex->nSproutValue;
+                pindex->nChainSaplingValue = pindex->nSaplingValue;
+                pindex->nChainOrchardValue = pindex->nOrchardValue;
+            }
+
+            // Fall back to hardcoded Sprout value pool balance
+            FallbackSproutValuePoolBalance(pindex, chainparams);
+
+            // If developer option -developersetpoolsizezero has been enabled,
+            // override and set the in-memory size of shielded pools to zero.  An unshielding transaction
+            // can then be used to trigger and test the handling of turnstile violations.
+            if (fExperimentalDeveloperSetPoolSizeZero) {
+                pindex->nChainSproutValue = 0;
+                pindex->nChainSaplingValue = 0;
+                pindex->nChainOrchardValue = 0;
+            }
+        }
+        // Construct in-memory chain of branch IDs.
+        // Relies on invariant: a block that does not activate a network upgrade
+        // will always be valid under the same consensus rules as its parent.
+        // Genesis block has a branch ID of zero by definition, but has no
+        // validity status because it is side-loaded into a fresh chain.
+        // Activation blocks will have branch IDs set (read from disk).
+        if (pindex->pprev) {
+            if (pindex->IsValid(BLOCK_VALID_CONSENSUS) && !pindex->nCachedBranchId) {
+                pindex->nCachedBranchId = pindex->pprev->nCachedBranchId;
+            }
+        } else {
+            pindex->nCachedBranchId = SPROUT_BRANCH_ID;
+        }
+        if (pindex->IsValid(BLOCK_VALID_TRANSACTIONS) && (pindex->nChainTx || pindex->pprev == NULL))
+            setBlockIndexCandidates.insert(pindex);
+        if (pindex->nStatus & BLOCK_FAILED_MASK && (!pindexBestInvalid || pindex->nChainWork > pindexBestInvalid->nChainWork))
+            pindexBestInvalid = pindex;
+        if (pindex->pprev)
+            pindex->BuildSkip();
+        if (pindex->IsValid(BLOCK_VALID_TREE) && (pindexBestHeader == NULL || CBlockIndexWorkComparator()(pindexBestHeader, pindex)))
+            pindexBestHeader = pindex;
+    }
+
+    // Load block file info
+    pblocktree->ReadLastBlockFile(nLastBlockFile);
+    vinfoBlockFile.resize(nLastBlockFile + 1);
+    LogPrintf("%s: last block file = %i\n", __func__, nLastBlockFile);
+    for (int nFile = 0; nFile <= nLastBlockFile; nFile++) {
+        pblocktree->ReadBlockFileInfo(nFile, vinfoBlockFile[nFile]);
+    }
+    LogPrintf("%s: last block file info: %s\n", __func__, vinfoBlockFile[nLastBlockFile].ToString());
+    for (int nFile = nLastBlockFile + 1; true; nFile++) {
+        CBlockFileInfo info;
+        if (pblocktree->ReadBlockFileInfo(nFile, info)) {
+            vinfoBlockFile.push_back(info);
+        } else {
+            break;
+        }
+    }
+
+    // Check presence of blk files
+    LogPrintf("Checking all blk files are present...\n");
+    set<int> setBlkDataFiles;
+    for (const std::pair<uint256, CBlockIndex*>& item : mapBlockIndex)
+    {
+        CBlockIndex* pindex = item.second;
+        if (pindex->nStatus & BLOCK_HAVE_DATA) {
+            setBlkDataFiles.insert(pindex->nFile);
+        }
+    }
+    for (std::set<int>::iterator it = setBlkDataFiles.begin(); it != setBlkDataFiles.end(); it++)
+    {
+        CDiskBlockPos pos(*it, 0);
+        if (CAutoFile(OpenBlockFile(pos, true), SER_DISK, CLIENT_VERSION).IsNull()) {
+            return false;
+        }
+    }
+
+    // Check whether we have ever pruned block & undo files
+    pblocktree->ReadFlag("prunedblockfiles", fHavePruned);
+    if (fHavePruned)
+        LogPrintf("LoadBlockIndexDB(): Block files have previously been pruned\n");
+
+    // Check whether we need to continue reindexing
+    bool fReindexing = false;
+    pblocktree->ReadReindexing(fReindexing);
+    if(fReindexing) fReindex = true;
+
+    // Check whether we have a transaction index
+    pblocktree->ReadFlag("txindex", fTxIndex);
+    LogPrintf("%s: transaction index %s\n", __func__, fTxIndex ? "enabled" : "disabled");
+
+    // insightexplorer and lightwalletd
+    // Check whether block explorer features are enabled
+    bool fInsightExplorer = false;
+    bool fLightWalletd = false;
+    pblocktree->ReadFlag("insightexplorer", fInsightExplorer);
+    pblocktree->ReadFlag("lightwalletd", fLightWalletd);
+    LogPrintf("%s: insight explorer %s\n", __func__, fInsightExplorer ? "enabled" : "disabled");
+    LogPrintf("%s: light wallet daemon %s\n", __func__, fLightWalletd ? "enabled" : "disabled");
+    if (fInsightExplorer) {
+        fAddressIndex = true;
+        fSpentIndex = true;
+        fTimestampIndex = true;
+    }
+    else if (fLightWalletd) {
+        fAddressIndex = true;
+    }
+
+    // Fill in-memory data
+    for (const std::pair<uint256, CBlockIndex*>& item : mapBlockIndex)
+    {
+        CBlockIndex* pindex = item.second;
+        // - This relationship will always be true even if pprev has multiple
+        //   children, because hashSproutAnchor is technically a property of pprev,
+        //   not its children.
+        // - This will miss chain tips; we handle the best tip below, and other
+        //   tips will be handled by ConnectTip during a re-org.
+        if (pindex->pprev) {
+            pindex->pprev->hashFinalSproutRoot = pindex->hashSproutAnchor;
+        }
+    }
+
+    // Load pointer to end of best chain
+    BlockMap::iterator it = mapBlockIndex.find(pcoinsTip->GetBestBlock());
+    if (it == mapBlockIndex.end())
+        return true;
+    chainActive.SetTip(it->second);
+    // Set hashFinalSproutRoot for the end of best chain
+    it->second->hashFinalSproutRoot = pcoinsTip->GetBestAnchor(SPROUT);
+
+    PruneBlockIndexCandidates();
+
+    LogPrintf("%s: hashBestChain=%s height=%d date=%s progress=%f\n", __func__,
+        chainActive.Tip()->GetBlockHash().ToString(), chainActive.Height(),
+        DateTimeStrFormat("%Y-%m-%d %H:%M:%S", chainActive.Tip()->GetBlockTime()),
+        Checkpoints::GuessVerificationProgress(chainparams.Checkpoints(), chainActive.Tip()));
+
+    EnforceNodeDeprecation(chainActive.Height(), true);
+
+    return true;
+}
+
+CVerifyDB::CVerifyDB()
+{
+    uiInterface.ShowProgress(_("Verifying blocks..."), 0);
+}
+
+CVerifyDB::~CVerifyDB()
+{
+    uiInterface.ShowProgress("", 100);
+}
+
+bool CVerifyDB::VerifyDB(const CChainParams& chainparams, CCoinsView *coinsview, int nCheckLevel, int nCheckDepth)
+{
+    LOCK(cs_main);
+    if (chainActive.Tip() == NULL || chainActive.Tip()->pprev == NULL)
+        return true;
+
+    // Verify blocks in the best chain
+    if (nCheckDepth <= 0)
+        nCheckDepth = 1000000000; // suffices until the year 19000
+    if (nCheckDepth > chainActive.Height())
+        nCheckDepth = chainActive.Height();
+    nCheckLevel = std::max(0, std::min(4, nCheckLevel));
+    LogPrintf("Verifying last %i blocks at level %i\n", nCheckDepth, nCheckLevel);
+    CCoinsViewCache coins(coinsview);
+    CBlockIndex* pindexState = chainActive.Tip();
+    CBlockIndex* pindexFailure = NULL;
+    int nGoodTransactions = 0;
+    CValidationState state;
+
+    // Flags used to permit skipping checks for efficiency
+    auto verifier = ProofVerifier::Disabled(); // No need to verify JoinSplits twice
+    bool fCheckTransactions = true;
+
+    for (CBlockIndex* pindex = chainActive.Tip(); pindex && pindex->pprev; pindex = pindex->pprev)
+    {
+        boost::this_thread::interruption_point();
+        uiInterface.ShowProgress(_("Verifying blocks..."), std::max(1, std::min(99, (int)(((double)(chainActive.Height() - pindex->nHeight)) / (double)nCheckDepth * (nCheckLevel >= 4 ? 50 : 100)))));
+        if (pindex->nHeight < chainActive.Height()-nCheckDepth)
+            break;
+
+        CBlock block;
+        // check level 0: read from disk
+        if (!ReadBlockFromDisk(block, pindex, chainparams.GetConsensus()))
+            return error("VerifyDB(): *** ReadBlockFromDisk failed at %d, hash=%s", pindex->nHeight, pindex->GetBlockHash().ToString());
+
+        // check level 1: verify block validity
+        fCheckTransactions = ShouldCheckTransactions(chainparams, pindex);
+        if (nCheckLevel >= 1 && !CheckBlock(block, state, chainparams, verifier, true, true, fCheckTransactions))
+            return error("VerifyDB(): *** found bad block at %d, hash=%s\n", pindex->nHeight, pindex->GetBlockHash().ToString());
+
+        // check level 2: verify undo validity
+        if (nCheckLevel >= 2 && pindex) {
+            CBlockUndo undo;
+            CDiskBlockPos pos = pindex->GetUndoPos();
+            if (!pos.IsNull()) {
+                if (!UndoReadFromDisk(undo, pos, pindex->pprev->GetBlockHash()))
+                    return error("VerifyDB(): *** found bad undo data at %d, hash=%s\n", pindex->nHeight, pindex->GetBlockHash().ToString());
+            }
+        }
+
+        // check level 3: check for inconsistencies during memory-only disconnect of tip blocks
+        if (nCheckLevel >= 3 && pindex == pindexState && (coins.DynamicMemoryUsage() + pcoinsTip->DynamicMemoryUsage()) <= nCoinCacheUsage) {
+            // insightexplorer: do not update indices (false)
+            DisconnectResult res = DisconnectBlock(block, state, pindex, coins, chainparams, false);
+            if (res == DISCONNECT_FAILED) {
+                return error("VerifyDB(): *** irrecoverable inconsistency in block data at %d, hash=%s", pindex->nHeight, pindex->GetBlockHash().ToString());
+            }
+            pindexState = pindex->pprev;
+            if (res == DISCONNECT_UNCLEAN) {
+                nGoodTransactions = 0;
+                pindexFailure = pindex;
+            } else {
+                nGoodTransactions += block.vtx.size();
+            }
+        }
+
+        if (ShutdownRequested())
+            return true;
+    }
+    if (pindexFailure)
+        return error("VerifyDB(): *** coin database inconsistencies found (last %i blocks, %i good transactions before that)\n", chainActive.Height() - pindexFailure->nHeight + 1, nGoodTransactions);
+
+    // check level 4: try reconnecting blocks
+    if (nCheckLevel >= 4) {
+        CBlockIndex *pindex = pindexState;
+        while (pindex != chainActive.Tip()) {
+            boost::this_thread::interruption_point();
+            uiInterface.ShowProgress(_("Verifying blocks..."), std::max(1, std::min(99, 100 - (int)(((double)(chainActive.Height() - pindex->nHeight)) / (double)nCheckDepth * 50))));
+            pindex = chainActive.Next(pindex);
+            CBlock block;
+            if (!ReadBlockFromDisk(block, pindex, chainparams.GetConsensus()))
+                return error("VerifyDB(): *** ReadBlockFromDisk failed at %d, hash=%s", pindex->nHeight, pindex->GetBlockHash().ToString());
+            if (!ConnectBlock(block, state, pindex, coins, chainparams))
+                return error("VerifyDB(): *** found unconnectable block at %d, hash=%s", pindex->nHeight, pindex->GetBlockHash().ToString());
+        }
+    }
+
+    LogPrintf("No coin database inconsistencies in last %i blocks (%i transactions)\n", chainActive.Height() - pindexState->nHeight, nGoodTransactions);
+
+    return true;
+}
+
+bool RewindBlockIndex(const CChainParams& chainparams, bool& clearWitnessCaches)
+{
+    LOCK(cs_main);
+
+    // RewindBlockIndex is called after LoadBlockIndex, so at this point every block
+    // index will have nCachedBranchId set based on the values previously persisted
+    // to disk. By definition, a set nCachedBranchId means that the block was
+    // fully-validated under the corresponding consensus rules. Thus we can quickly
+    // identify whether the current active chain matches our expected sequence of
+    // consensus rule changes, with two checks:
+    //
+    // - BLOCK_ACTIVATES_UPGRADE is set only on blocks that activate upgrades.
+    // - nCachedBranchId for each block matches what we expect.
+    auto sufficientlyValidated = [&chainparams](const CBlockIndex* pindex) {
+        const Consensus::Params& consensus = chainparams.GetConsensus();
+        bool fFlagSet = pindex->nStatus & BLOCK_ACTIVATES_UPGRADE;
+        bool fFlagExpected = IsActivationHeightForAnyUpgrade(pindex->nHeight, consensus);
+        return fFlagSet == fFlagExpected &&
+            pindex->nCachedBranchId &&
+            *pindex->nCachedBranchId == CurrentEpochBranchId(pindex->nHeight, consensus);
+    };
+
+    int lastValidHeight = 0;
+    while (lastValidHeight < chainActive.Height()) {
+        if (sufficientlyValidated(chainActive[lastValidHeight + 1])) {
+            lastValidHeight++;
+        } else {
+            break;
+        }
+    }
+
+    // lastValidHeight is now the height of the last valid block below the active chain height
+    auto rewindLength = chainActive.Height() - lastValidHeight;
+    clearWitnessCaches = false;
+
+    if (rewindLength > 0) {
+        LogPrintf("*** Last validated block at height %d, active height is %d; rewind length %d\n", lastValidHeight, chainActive.Height(), rewindLength);
+
+        auto nHeight = lastValidHeight + 1;
+        const uint256 *phashFirstInsufValidated = chainActive[nHeight]->phashBlock;
+        auto networkID = chainparams.NetworkIDString();
+
+        // This is true when we intend to do a long rewind.
+        bool intendedRewind =
+            (networkID == "test" && nHeight == 252500 && *phashFirstInsufValidated ==
+             uint256S("0018bd16a9c6f15795a754c498d2b2083ab78f14dae44a66a8d0e90ba8464d9c")) ||
+            (networkID == "test" && nHeight == 584000 && *phashFirstInsufValidated ==
+             uint256S("002e1d6daf4ab7b296e7df839dc1bee9d615583bb4bc34b1926ce78307532852")) ||
+            (networkID == "test" && nHeight == 903800 && *phashFirstInsufValidated ==
+             uint256S("0044f3c696a242220ed608c70beba5aa804f1cfb8a20e32186727d1bec5dfa1e"));
+
+        clearWitnessCaches = (rewindLength > MAX_REORG_LENGTH && intendedRewind);
+        if (clearWitnessCaches) {
+            auto msg = strprintf(_(
+                "An intended block chain rewind has been detected: network %s, hash %s, height %d"
+                ), networkID, phashFirstInsufValidated->GetHex(), nHeight);
+            LogPrintf("*** %s\n", msg);
+        }
+
+        if (rewindLength > MAX_REORG_LENGTH && !intendedRewind) {
+            auto pindexOldTip = chainActive.Tip();
+            auto pindexRewind = chainActive[lastValidHeight];
+            auto msg = strprintf(_(
+                "A block chain rewind has been detected that would roll back %d blocks! "
+                "This is larger than the maximum of %d blocks, and so the node is shutting down for your safety."
+                ), rewindLength, MAX_REORG_LENGTH) + "\n\n" +
+                _("Rewind details") + ":\n" +
+                "- " + strprintf(_("Current tip:   %s, height %d"),
+                    pindexOldTip->phashBlock->GetHex(), pindexOldTip->nHeight) + "\n" +
+                "- " + strprintf(_("Rewinding to:  %s, height %d"),
+                    pindexRewind->phashBlock->GetHex(), pindexRewind->nHeight) + "\n\n" +
+                _("Please help, human!");
+            LogError("main", "*** %s\n", msg);
+            uiInterface.ThreadSafeMessageBox(msg, "", CClientUIInterface::MSG_ERROR);
+            StartShutdown();
+            return false;
+        }
+    }
+
+    CValidationState state;
+    CBlockIndex* pindex = chainActive.Tip();
+    while (chainActive.Height() > lastValidHeight) {
+        if (fPruneMode && !(chainActive.Tip()->nStatus & BLOCK_HAVE_DATA)) {
+            // If pruning, don't try rewinding past the HAVE_DATA point;
+            // since older blocks can't be served anyway, there's
+            // no need to walk further, and trying to DisconnectTip()
+            // will fail (and require a needless reindex/redownload
+            // of the blockchain).
+            break;
+        }
+        if (!DisconnectTip(state, chainparams, true)) {
+            return error("RewindBlockIndex: unable to disconnect block at height %i", pindex->nHeight);
+        }
+        // Occasionally flush state to disk.
+        if (!FlushStateToDisk(chainparams, state, FLUSH_STATE_PERIODIC))
+            return false;
+    }
+
+    // Collect blocks to be removed (blocks in mapBlockIndex must be at least BLOCK_VALID_TREE).
+    // We do this after actual disconnecting, otherwise we'll end up writing the lack of data
+    // to disk before writing the chainstate, resulting in a failure to continue if interrupted.
+    std::vector<const CBlockIndex*> vBlocks;
+    for (BlockMap::iterator it = mapBlockIndex.begin(); it != mapBlockIndex.end(); it++) {
+        CBlockIndex* pindexIter = it->second;
+
+        // Note: If we encounter an insufficiently validated block that
+        // is on chainActive, it must be because we are a pruning node, and
+        // this block or some successor doesn't HAVE_DATA, so we were unable to
+        // rewind all the way.  Blocks remaining on chainActive at this point
+        // must not have their validity reduced.
+        if (!sufficientlyValidated(pindexIter) && !chainActive.Contains(pindexIter)) {
+            // Add to the list of blocks to remove
+            vBlocks.push_back(pindexIter);
+            if (pindexIter == pindexBestInvalid) {
+                // Reset invalid block marker if it was pointing to this block
+                pindexBestInvalid = NULL;
+            }
+            // Update indices
+            setBlockIndexCandidates.erase(pindexIter);
+            auto ret = mapBlocksUnlinked.equal_range(pindexIter->pprev);
+            while (ret.first != ret.second) {
+                if (ret.first->second == pindexIter) {
+                    ret.first = mapBlocksUnlinked.erase(ret.first);
+                } else {
+                    ++ret.first;
+                }
+            }
+        } else if (pindexIter->IsValid(BLOCK_VALID_TRANSACTIONS) && pindexIter->nChainTx) {
+            setBlockIndexCandidates.insert(pindexIter);
+        }
+    }
+
+    // Set pindexBestHeader to the current chain tip
+    // (since we are about to delete the block it is pointing to)
+    pindexBestHeader = chainActive.Tip();
+
+    // Erase block indices on-disk
+    if (!pblocktree->EraseBatchSync(vBlocks)) {
+        return AbortNode(state, "Failed to erase from block index database");
+    }
+
+    // Erase block indices in-memory
+    for (auto pindex : vBlocks) {
+        auto ret = mapBlockIndex.find(*pindex->phashBlock);
+        if (ret != mapBlockIndex.end()) {
+            mapBlockIndex.erase(ret);
+            delete pindex;
+        }
+    }
+
+    PruneBlockIndexCandidates();
+
+    // Ensure that pindexBestHeader points to the block index entry with the most work;
+    // setBlockIndexCandidates entries are sorted by work, highest at the end.
+    {
+        std::set<CBlockIndex*, CBlockIndexWorkComparator>::reverse_iterator it = setBlockIndexCandidates.rbegin();
+        assert(it != setBlockIndexCandidates.rend());
+        pindexBestHeader = *it;
+    }
+
+    CheckBlockIndex(chainparams.GetConsensus());
+
+    if (!FlushStateToDisk(chainparams, state, FLUSH_STATE_ALWAYS)) {
+        return false;
+    }
+
+    return true;
+}
+
+void UnloadBlockIndex()
+{
+    LOCK(cs_main);
+    setBlockIndexCandidates.clear();
+    chainActive.SetTip(NULL);
+    pindexBestInvalid = NULL;
+    pindexBestHeader = NULL;
+    mempool.clear();
+    mapOrphanTransactions.clear();
+    mapOrphanTransactionsByPrev.clear();
+    nSyncStarted = 0;
+    mapBlocksUnlinked.clear();
+    vinfoBlockFile.clear();
+    nLastBlockFile = 0;
+    nBlockSequenceId = 1;
+    mapBlockSource.clear();
+    mapBlocksInFlight.clear();
+    nQueuedValidatedHeaders = 0;
+    nPreferredDownload = 0;
+    setDirtyBlockIndex.clear();
+    setDirtyFileInfo.clear();
+    mapNodeState.clear();
+    recentRejects.reset(NULL);
+
+    for (BlockMap::value_type& entry : mapBlockIndex) {
+        delete entry.second;
+    }
+    mapBlockIndex.clear();
+    fHavePruned = false;
+}
+
+bool LoadBlockIndex()
+{
+    // Load block index from databases
+    if (!fReindex && !LoadBlockIndexDB(Params()))
+        return false;
+    return true;
+}
+
+bool InitBlockIndex(const CChainParams& chainparams)
+{
+    LOCK(cs_main);
+
+    // Initialize global variables that cannot be constructed at startup.
+    recentRejects.reset(new CRollingBloomFilter(120000, 0.000001));
+
+    // Check whether we're already initialized
+    if (chainActive.Genesis() != NULL)
+        return true;
+
+    // Use the provided setting for -txindex in the new database
+    fTxIndex = GetBoolArg("-txindex", DEFAULT_TXINDEX);
+    pblocktree->WriteFlag("txindex", fTxIndex);
+
+    // Use the provided setting for -insightexplorer or -lightwalletd in the new database
+    pblocktree->WriteFlag("insightexplorer", fExperimentalInsightExplorer);
+    pblocktree->WriteFlag("lightwalletd", fExperimentalLightWalletd);
+    if (fExperimentalInsightExplorer) {
+        fAddressIndex = true;
+        fSpentIndex = true;
+        fTimestampIndex = true;
+    }
+    else if (fExperimentalLightWalletd) {
+        fAddressIndex = true;
+    }
+
+    LogPrintf("Initializing databases...\n");
+
+    // Only add the genesis block if not reindexing (in which case we reuse the one already on disk)
+    if (!fReindex) {
+        try {
+            CBlock &block = const_cast<CBlock&>(chainparams.GenesisBlock());
+            // Start new block file
+            unsigned int nBlockSize = ::GetSerializeSize(block, SER_DISK, CLIENT_VERSION);
+            CDiskBlockPos blockPos;
+            CValidationState state;
+            if (!FindBlockPos(state, blockPos, nBlockSize+8, 0, block.GetBlockTime()))
+                return error("LoadBlockIndex(): FindBlockPos failed");
+            if (!WriteBlockToDisk(block, blockPos, chainparams.MessageStart()))
+                return error("LoadBlockIndex(): writing genesis block to disk failed");
+            CBlockIndex *pindex = AddToBlockIndex(block, chainparams.GetConsensus());
+            if (!ReceivedBlockTransactions(block, state, chainparams, pindex, blockPos))
+                return error("LoadBlockIndex(): genesis block not accepted");
+            if (!ActivateBestChain(state, chainparams, &block))
+                return error("LoadBlockIndex(): genesis block cannot be activated");
+            // Force a chainstate write so that when we VerifyDB in a moment, it doesn't check stale data
+            return FlushStateToDisk(chainparams, state, FLUSH_STATE_ALWAYS);
+        } catch (const std::runtime_error& e) {
+            return error("LoadBlockIndex(): failed to initialize block database: %s", e.what());
+        }
+    }
+
+    return true;
+}
+
+bool LoadExternalBlockFile(const CChainParams& chainparams, FILE* fileIn, CDiskBlockPos *dbp)
+{
+    // Map of disk positions for blocks with unknown parent (only used for reindex)
+    static std::multimap<uint256, CDiskBlockPos> mapBlocksUnknownParent;
+    int64_t nStart = GetTimeMillis();
+
+    int nLoaded = 0;
+    try {
+        // This takes over fileIn and calls fclose() on it in the CBufferedFile destructor
+        CBufferedFile blkdat(fileIn, 2*MAX_BLOCK_SIZE, MAX_BLOCK_SIZE+8, SER_DISK, CLIENT_VERSION);
+        uint64_t nRewind = blkdat.GetPos();
+        size_t initialSize = nSizeReindexed;
+        while (!blkdat.eof()) {
+            boost::this_thread::interruption_point();
+
+            if (fReindex)
+               nSizeReindexed = initialSize + nRewind;
+
+            blkdat.SetPos(nRewind);
+            nRewind++; // start one byte further next time, in case of failure
+            blkdat.SetLimit(); // remove former limit
+            unsigned int nSize = 0;
+            try {
+                // locate a header
+                unsigned char buf[CMessageHeader::MESSAGE_START_SIZE];
+                blkdat.FindByte(chainparams.MessageStart()[0]);
+                nRewind = blkdat.GetPos()+1;
+                blkdat >> FLATDATA(buf);
+                if (memcmp(buf, chainparams.MessageStart(), CMessageHeader::MESSAGE_START_SIZE))
+                    continue;
+                // read size
+                blkdat >> nSize;
+                if (nSize < 80 || nSize > MAX_BLOCK_SIZE)
+                    continue;
+            } catch (const std::exception&) {
+                // no valid block header found; don't complain
+                break;
+            }
+            try {
+                // read block
+                uint64_t nBlockPos = blkdat.GetPos();
+                if (dbp)
+                    dbp->nPos = nBlockPos;
+                blkdat.SetLimit(nBlockPos + nSize);
+                blkdat.SetPos(nBlockPos);
+                CBlock block;
+                blkdat >> block;
+                nRewind = blkdat.GetPos();
+
+                // detect out of order blocks, and store them for later
+                uint256 hash = block.GetHash();
+                if (hash != chainparams.GetConsensus().hashGenesisBlock && mapBlockIndex.find(block.hashPrevBlock) == mapBlockIndex.end()) {
+                    LogPrint("reindex", "%s: Out of order block %s, parent %s not known\n", __func__, hash.ToString(),
+                            block.hashPrevBlock.ToString());
+                    if (dbp)
+                        mapBlocksUnknownParent.insert(std::make_pair(block.hashPrevBlock, *dbp));
+                    continue;
+                }
+
+                // process in case the block isn't known yet
+                if (mapBlockIndex.count(hash) == 0 || (mapBlockIndex[hash]->nStatus & BLOCK_HAVE_DATA) == 0) {
+                    LOCK(cs_main);
+                    CValidationState state;
+                    if (AcceptBlock(block, state, chainparams, NULL, true, dbp))
+                        nLoaded++;
+                    if (state.IsError())
+                        break;
+                } else if (hash != chainparams.GetConsensus().hashGenesisBlock && mapBlockIndex[hash]->nHeight % 1000 == 0) {
+                    LogPrint("reindex", "Block Import: already had block %s at height %d\n", hash.ToString(), mapBlockIndex[hash]->nHeight);
+                }
+
+                // Activate the genesis block so normal node progress can continue
+                if (hash == chainparams.GetConsensus().hashGenesisBlock) {
+                    CValidationState state;
+                    if (!ActivateBestChain(state, chainparams)) {
+                        break;
+                    }
+                }
+
+                NotifyHeaderTip(chainparams.GetConsensus());
+
+                // Recursively process earlier encountered successors of this block
+                deque<uint256> queue;
+                queue.push_back(hash);
+                while (!queue.empty()) {
+                    uint256 head = queue.front();
+                    queue.pop_front();
+                    std::pair<std::multimap<uint256, CDiskBlockPos>::iterator, std::multimap<uint256, CDiskBlockPos>::iterator> range = mapBlocksUnknownParent.equal_range(head);
+                    while (range.first != range.second) {
+                        if (ReadBlockFromDisk(block, range.first->second, chainparams.GetConsensus()))
+                        {
+                            LogPrint("reindex", "%s: Processing out of order child %s of %s\n", __func__, block.GetHash().ToString(),
+                                    head.ToString());
+                            LOCK(cs_main);
+                            CValidationState dummy;
+                            if (AcceptBlock(block, dummy, chainparams, NULL, true, &(range.first->second)))
+                            {
+                                nLoaded++;
+                                queue.push_back(block.GetHash());
+                            }
+                        }
+                        range.first = mapBlocksUnknownParent.erase(range.first);
+                        NotifyHeaderTip(chainparams.GetConsensus());
+                    }
+                }
+            } catch (const std::exception& e) {
+                LogPrintf("%s: Deserialize or I/O error - %s\n", __func__, e.what());
+            }
+        }
+    } catch (const std::runtime_error& e) {
+        AbortNode(std::string("System error: ") + e.what());
+    }
+    if (nLoaded > 0)
+        LogPrintf("Loaded %i blocks from external file in %dms\n", nLoaded, GetTimeMillis() - nStart);
+    return nLoaded > 0;
+}
+
+void static CheckBlockIndex(const Consensus::Params& consensusParams)
+{
+    if (!fCheckBlockIndex) {
+        return;
+    }
+
+    LOCK(cs_main);
+
+    // During a reindex, we read the genesis block and call CheckBlockIndex before ActivateBestChain,
+    // so we have the genesis block in mapBlockIndex but no active chain.  (A few of the tests when
+    // iterating the block tree require that chainActive has been initialized.)
+    if (chainActive.Height() < 0) {
+        assert(mapBlockIndex.size() <= 1);
+        return;
+    }
+
+    // Build forward-pointing map of the entire block tree.
+    std::multimap<CBlockIndex*,CBlockIndex*> forward;
+    for (BlockMap::iterator it = mapBlockIndex.begin(); it != mapBlockIndex.end(); it++) {
+        forward.insert(std::make_pair(it->second->pprev, it->second));
+    }
+
+    assert(forward.size() == mapBlockIndex.size());
+
+    std::pair<std::multimap<CBlockIndex*,CBlockIndex*>::iterator,std::multimap<CBlockIndex*,CBlockIndex*>::iterator> rangeGenesis = forward.equal_range(NULL);
+    CBlockIndex *pindex = rangeGenesis.first->second;
+    rangeGenesis.first++;
+    assert(rangeGenesis.first == rangeGenesis.second); // There is only one index entry with parent NULL.
+
+    // Iterate over the entire block tree, using depth-first search.
+    // Along the way, remember whether there are blocks on the path from genesis
+    // block being explored which are the first to have certain properties.
+    size_t nNodes = 0;
+    int nHeight = 0;
+    CBlockIndex* pindexFirstInvalid = NULL; // Oldest ancestor of pindex which is invalid.
+    CBlockIndex* pindexFirstMissing = NULL; // Oldest ancestor of pindex which does not have BLOCK_HAVE_DATA.
+    CBlockIndex* pindexFirstNeverProcessed = NULL; // Oldest ancestor of pindex for which nTx == 0.
+    CBlockIndex* pindexFirstNotTreeValid = NULL; // Oldest ancestor of pindex which does not have BLOCK_VALID_TREE (regardless of being valid or not).
+    CBlockIndex* pindexFirstNotTransactionsValid = NULL; // Oldest ancestor of pindex which does not have BLOCK_VALID_TRANSACTIONS (regardless of being valid or not).
+    CBlockIndex* pindexFirstNotChainValid = NULL; // Oldest ancestor of pindex which does not have BLOCK_VALID_CHAIN (regardless of being valid or not).
+    CBlockIndex* pindexFirstNotScriptsValid = NULL; // Oldest ancestor of pindex which does not have BLOCK_VALID_SCRIPTS (regardless of being valid or not).
+    while (pindex != NULL) {
+        nNodes++;
+        if (pindexFirstInvalid == NULL && pindex->nStatus & BLOCK_FAILED_VALID) pindexFirstInvalid = pindex;
+        if (pindexFirstMissing == NULL && !(pindex->nStatus & BLOCK_HAVE_DATA)) pindexFirstMissing = pindex;
+        if (pindexFirstNeverProcessed == NULL && pindex->nTx == 0) pindexFirstNeverProcessed = pindex;
+        if (pindex->pprev != NULL && pindexFirstNotTreeValid == NULL && (pindex->nStatus & BLOCK_VALID_MASK) < BLOCK_VALID_TREE) pindexFirstNotTreeValid = pindex;
+        if (pindex->pprev != NULL && pindexFirstNotTransactionsValid == NULL && (pindex->nStatus & BLOCK_VALID_MASK) < BLOCK_VALID_TRANSACTIONS) pindexFirstNotTransactionsValid = pindex;
+        if (pindex->pprev != NULL && pindexFirstNotChainValid == NULL && (pindex->nStatus & BLOCK_VALID_MASK) < BLOCK_VALID_CHAIN) pindexFirstNotChainValid = pindex;
+        if (pindex->pprev != NULL && pindexFirstNotScriptsValid == NULL && (pindex->nStatus & BLOCK_VALID_MASK) < BLOCK_VALID_SCRIPTS) pindexFirstNotScriptsValid = pindex;
+
+        // Begin: actual consistency checks.
+        if (pindex->pprev == NULL) {
+            // Genesis block checks.
+            assert(pindex->GetBlockHash() == consensusParams.hashGenesisBlock); // Genesis block's hash must match.
+            assert(pindex == chainActive.Genesis()); // The current active chain's genesis block must be this block.
+        }
+        if (pindex->nChainTx == 0) assert(pindex->nSequenceId == 0);  // nSequenceId can't be set for blocks that aren't linked
+        // VALID_TRANSACTIONS is equivalent to nTx > 0 for all nodes (whether or not pruning has occurred).
+        // HAVE_DATA is only equivalent to nTx > 0 (or VALID_TRANSACTIONS) if no pruning has occurred.
+        if (!fHavePruned) {
+            // If we've never pruned, then HAVE_DATA should be equivalent to nTx > 0
+            assert(!(pindex->nStatus & BLOCK_HAVE_DATA) == (pindex->nTx == 0));
+            assert(pindexFirstMissing == pindexFirstNeverProcessed);
+        } else {
+            // If we have pruned, then we can only say that HAVE_DATA implies nTx > 0
+            if (pindex->nStatus & BLOCK_HAVE_DATA) assert(pindex->nTx > 0);
+        }
+        if (pindex->nStatus & BLOCK_HAVE_UNDO) assert(pindex->nStatus & BLOCK_HAVE_DATA);
+        assert(((pindex->nStatus & BLOCK_VALID_MASK) >= BLOCK_VALID_TRANSACTIONS) == (pindex->nTx > 0)); // This is pruning-independent.
+        // All parents having had data (at some point) is equivalent to all parents being VALID_TRANSACTIONS, which is equivalent to nChainTx being set.
+        assert((pindexFirstNeverProcessed != NULL) == (pindex->nChainTx == 0)); // nChainTx != 0 is used to signal that all parent blocks have been processed (but may have been pruned).
+        assert((pindexFirstNotTransactionsValid != NULL) == (pindex->nChainTx == 0));
+        assert(pindex->nHeight == nHeight); // nHeight must be consistent.
+        assert(pindex->pprev == NULL || pindex->nChainWork >= pindex->pprev->nChainWork); // For every block except the genesis block, the chainwork must be larger than the parent's.
+        assert(nHeight < 2 || (pindex->pskip && (pindex->pskip->nHeight < nHeight))); // The pskip pointer must point back for all but the first 2 blocks.
+        assert(pindexFirstNotTreeValid == NULL); // All mapBlockIndex entries must at least be TREE valid
+        if ((pindex->nStatus & BLOCK_VALID_MASK) >= BLOCK_VALID_TREE) assert(pindexFirstNotTreeValid == NULL); // TREE valid implies all parents are TREE valid
+        if ((pindex->nStatus & BLOCK_VALID_MASK) >= BLOCK_VALID_CHAIN) assert(pindexFirstNotChainValid == NULL); // CHAIN valid implies all parents are CHAIN valid
+        if ((pindex->nStatus & BLOCK_VALID_MASK) >= BLOCK_VALID_SCRIPTS) assert(pindexFirstNotScriptsValid == NULL); // SCRIPTS valid implies all parents are SCRIPTS valid
+        if (pindexFirstInvalid == NULL) {
+            // Checks for not-invalid blocks.
+            assert((pindex->nStatus & BLOCK_FAILED_MASK) == 0); // The failed mask cannot be set for blocks without invalid parents.
+        }
+        if (!CBlockIndexWorkComparator()(pindex, chainActive.Tip()) && pindexFirstNeverProcessed == NULL) {
+            if (pindexFirstInvalid == NULL) {
+                // If this block sorts at least as good as the current tip and
+                // is valid and we have all data for its parents, it must be in
+                // setBlockIndexCandidates.  chainActive.Tip() must also be there
+                // even if some data has been pruned.
+                if (pindexFirstMissing == NULL || pindex == chainActive.Tip()) {
+                    assert(setBlockIndexCandidates.count(pindex));
+                }
+                // If some parent is missing, then it could be that this block was in
+                // setBlockIndexCandidates but had to be removed because of the missing data.
+                // In this case it must be in mapBlocksUnlinked -- see test below.
+            }
+        } else { // If this block sorts worse than the current tip or some ancestor's block has never been seen, it cannot be in setBlockIndexCandidates.
+            assert(setBlockIndexCandidates.count(pindex) == 0);
+        }
+        // Check whether this block is in mapBlocksUnlinked.
+        std::pair<std::multimap<CBlockIndex*,CBlockIndex*>::iterator,std::multimap<CBlockIndex*,CBlockIndex*>::iterator> rangeUnlinked = mapBlocksUnlinked.equal_range(pindex->pprev);
+        bool foundInUnlinked = false;
+        while (rangeUnlinked.first != rangeUnlinked.second) {
+            assert(rangeUnlinked.first->first == pindex->pprev);
+            if (rangeUnlinked.first->second == pindex) {
+                foundInUnlinked = true;
+                break;
+            }
+            rangeUnlinked.first++;
+        }
+        if (pindex->pprev && (pindex->nStatus & BLOCK_HAVE_DATA) && pindexFirstNeverProcessed != NULL && pindexFirstInvalid == NULL) {
+            // If this block has block data available, some parent was never received, and has no invalid parents, it must be in mapBlocksUnlinked.
+            assert(foundInUnlinked);
+        }
+        if (!(pindex->nStatus & BLOCK_HAVE_DATA)) assert(!foundInUnlinked); // Can't be in mapBlocksUnlinked if we don't HAVE_DATA
+        if (pindexFirstMissing == NULL) assert(!foundInUnlinked); // We aren't missing data for any parent -- cannot be in mapBlocksUnlinked.
+        if (pindex->pprev && (pindex->nStatus & BLOCK_HAVE_DATA) && pindexFirstNeverProcessed == NULL && pindexFirstMissing != NULL) {
+            // We HAVE_DATA for this block, have received data for all parents at some point, but we're currently missing data for some parent.
+            assert(fHavePruned); // We must have pruned.
+            // This block may have entered mapBlocksUnlinked if:
+            //  - it has a descendant that at some point had more work than the
+            //    tip, and
+            //  - we tried switching to that descendant but were missing
+            //    data for some intermediate block between chainActive and the
+            //    tip.
+            // So if this block is itself better than chainActive.Tip() and it wasn't in
+            // setBlockIndexCandidates, then it must be in mapBlocksUnlinked.
+            if (!CBlockIndexWorkComparator()(pindex, chainActive.Tip()) && setBlockIndexCandidates.count(pindex) == 0) {
+                if (pindexFirstInvalid == NULL) {
+                    assert(foundInUnlinked);
+                }
+            }
+        }
+        // assert(pindex->GetBlockHash() == pindex->GetBlockHeader().GetHash()); // Perhaps too slow
+        // End: actual consistency checks.
+
+        // Try descending into the first subnode.
+        std::pair<std::multimap<CBlockIndex*,CBlockIndex*>::iterator,std::multimap<CBlockIndex*,CBlockIndex*>::iterator> range = forward.equal_range(pindex);
+        if (range.first != range.second) {
+            // A subnode was found.
+            pindex = range.first->second;
+            nHeight++;
+            continue;
+        }
+        // This is a leaf node.
+        // Move upwards until we reach a node of which we have not yet visited the last child.
+        while (pindex) {
+            // We are going to either move to a parent or a sibling of pindex.
+            // If pindex was the first with a certain property, unset the corresponding variable.
+            if (pindex == pindexFirstInvalid) pindexFirstInvalid = NULL;
+            if (pindex == pindexFirstMissing) pindexFirstMissing = NULL;
+            if (pindex == pindexFirstNeverProcessed) pindexFirstNeverProcessed = NULL;
+            if (pindex == pindexFirstNotTreeValid) pindexFirstNotTreeValid = NULL;
+            if (pindex == pindexFirstNotTransactionsValid) pindexFirstNotTransactionsValid = NULL;
+            if (pindex == pindexFirstNotChainValid) pindexFirstNotChainValid = NULL;
+            if (pindex == pindexFirstNotScriptsValid) pindexFirstNotScriptsValid = NULL;
+            // Find our parent.
+            CBlockIndex* pindexPar = pindex->pprev;
+            // Find which child we just visited.
+            std::pair<std::multimap<CBlockIndex*,CBlockIndex*>::iterator,std::multimap<CBlockIndex*,CBlockIndex*>::iterator> rangePar = forward.equal_range(pindexPar);
+            while (rangePar.first->second != pindex) {
+                assert(rangePar.first != rangePar.second); // Our parent must have at least the node we're coming from as child.
+                rangePar.first++;
+            }
+            // Proceed to the next one.
+            rangePar.first++;
+            if (rangePar.first != rangePar.second) {
+                // Move to the sibling.
+                pindex = rangePar.first->second;
+                break;
+            } else {
+                // Move up further.
+                pindex = pindexPar;
+                nHeight--;
+                continue;
+            }
+        }
+    }
+
+    // Check that we actually traversed the entire map.
+    assert(nNodes == forward.size());
+}
+
+
+
+//////////////////////////////////////////////////////////////////////////////
+//
+// Messages
+//
+
+
+CInv static InvForTransaction(const std::shared_ptr<const CTransaction> tx)
+{
+    if (tx->nVersion >= 5) {
+        auto& wtxid = tx->GetWTxId();
+        return CInv(MSG_WTX, wtxid.hash, wtxid.authDigest);
+    } else {
+        return CInv(MSG_TX, tx->GetHash());
+    }
+}
+
+bool static AlreadyHave(const CInv& inv) EXCLUSIVE_LOCKS_REQUIRED(cs_main)
+{
+    switch (inv.type)
+    {
+    case MSG_TX:
+    case MSG_WTX:
+        {
+            assert(recentRejects);
+            if (chainActive.Tip()->GetBlockHash() != hashRecentRejectsChainTip)
+            {
+                // If the chain tip has changed previously rejected transactions
+                // might be now valid, e.g. due to a nLockTime'd tx becoming valid,
+                // or a double-spend. Reset the rejects filter and give those
+                // txs a second chance.
+                hashRecentRejectsChainTip = chainActive.Tip()->GetBlockHash();
+                recentRejects->reset();
+            }
+
+            // We only need to use wtxid with recentRejects. Orphan map entries
+            // are re-validated once their parents have arrived, and all other
+            // locations are only possible if the transaction has already been
+            // validated (we don't care about alternative authorizing data).
+            return recentRejects->contains(inv.GetWideHash()) ||
+                   mempool.exists(inv.hash) ||
+                   mapOrphanTransactions.count(inv.hash) ||
+                   pcoinsTip->HaveCoins(inv.hash);
+        }
+    case MSG_BLOCK:
+        return mapBlockIndex.count(inv.hash);
+    }
+    // Don't know what it is, just say we already got one
+    return true;
+}
+
+void static ProcessGetData(CNode* pfrom, const Consensus::Params& consensusParams)
+{
+    int currentHeight = GetHeight();
+
+    std::deque<CInv>::iterator it = pfrom->vRecvGetData.begin();
+
+    vector<CInv> vNotFound;
+
+    LOCK(cs_main);
+
+    while (it != pfrom->vRecvGetData.end()) {
+        // Don't bother if send buffer is too full to respond anyway
+        if (pfrom->nSendSize >= SendBufferSize())
+            break;
+
+        const CInv &inv = *it;
+        {
+            boost::this_thread::interruption_point();
+            it++;
+
+            if (inv.type == MSG_BLOCK || inv.type == MSG_FILTERED_BLOCK)
+            {
+                bool send = false;
+                BlockMap::iterator mi = mapBlockIndex.find(inv.hash);
+                if (mi != mapBlockIndex.end())
+                {
+                    if (chainActive.Contains(mi->second)) {
+                        send = true;
+                    } else {
+                        static const int nOneMonth = 30 * 24 * 60 * 60;
+                        // To prevent fingerprinting attacks, only send blocks outside of the active
+                        // chain if they are valid, and no more than a month older (both in time, and in
+                        // best equivalent proof of work) than the best header chain we know about.
+                        send = mi->second->IsValid(BLOCK_VALID_SCRIPTS) && (pindexBestHeader != NULL) &&
+                            (pindexBestHeader->GetBlockTime() - mi->second->GetBlockTime() < nOneMonth) &&
+                            (GetBlockProofEquivalentTime(*pindexBestHeader, *mi->second, *pindexBestHeader, consensusParams) < nOneMonth);
+                        if (!send) {
+                            LogPrintf("%s: ignoring request from peer=%i for old block that isn't in the main chain\n", __func__, pfrom->GetId());
+                        }
+                    }
+                }
+                // disconnect node in case we have reached the outbound limit for serving historical blocks
+                // never disconnect whitelisted nodes
+                static const int nOneWeek = 7 * 24 * 60 * 60; // assume > 1 week = historical
+                if (send && CNode::OutboundTargetReached(consensusParams.PoWTargetSpacing(currentHeight), true) && (
+                        (
+                            (pindexBestHeader != NULL) &&
+                            (pindexBestHeader->GetBlockTime() - mi->second->GetBlockTime() > nOneWeek)
+                        ) || inv.type == MSG_FILTERED_BLOCK
+                    ) && !pfrom->fWhitelisted)
+                {
+                    LogPrint("net", "historical block serving limit reached, disconnect peer=%d\n", pfrom->GetId());
+
+                    //disconnect node
+                    pfrom->fDisconnect = true;
+                    send = false;
+                }
+                // Pruned nodes may have deleted the block, so check whether
+                // it's available before trying to send.
+                if (send && (mi->second->nStatus & BLOCK_HAVE_DATA))
+                {
+                    // Send block from disk
+                    CBlock block;
+                    if (!ReadBlockFromDisk(block, (*mi).second, consensusParams))
+                        assert(!"cannot load block from disk");
+                    if (inv.type == MSG_BLOCK)
+                        pfrom->PushMessage("block", block);
+                    else // MSG_FILTERED_BLOCK)
+                    {
+                        bool send = false;
+                        CMerkleBlock merkleBlock;
+                        {
+                            LOCK(pfrom->cs_filter);
+                            if (pfrom->pfilter) {
+                                send = true;
+                                merkleBlock = CMerkleBlock(block, *pfrom->pfilter);
+                            }
+                        }
+                        if (send) {
+                            pfrom->PushMessage("merkleblock", merkleBlock);
+                            // CMerkleBlock just contains hashes, so also push any transactions in the block the client did not see
+                            // This avoids hurting performance by pointlessly requiring a round-trip
+                            // Note that there is currently no way for a node to request any single transactions we didn't send here -
+                            // they must either disconnect and retry or request the full block.
+                            // Thus, the protocol spec specified allows for us to provide duplicate txn here,
+                            // however we MUST always provide at least what the remote peer needs
+                            typedef std::pair<unsigned int, uint256> PairType;
+                            for (PairType& pair : merkleBlock.vMatchedTxn)
+                                pfrom->PushMessage("tx", block.vtx[pair.first]);
+                        }
+                        // else
+                            // no response
+                    }
+
+                    // Trigger the peer node to send a getblocks request for the next batch of inventory
+                    if (inv.hash == pfrom->hashContinue)
+                    {
+                        // Bypass PushBlockInventory, this must send even if redundant,
+                        // and we want it right after the last block so they don't
+                        // wait for other stuff first.
+                        vector<CInv> vInv;
+                        vInv.push_back(CInv(MSG_BLOCK, chainActive.Tip()->GetBlockHash()));
+                        pfrom->PushMessage("inv", vInv);
+                        pfrom->hashContinue.SetNull();
+                    }
+                }
+            }
+            else if (inv.type == MSG_TX || inv.type == MSG_WTX)
+            {
+                // Send stream from relay memory
+                bool push = false;
+                auto mi = mapRelay.find(inv.hash);
+                if (mi != mapRelay.end() && !IsExpiringSoonTx(*mi->second, currentHeight + 1)) {
+                    // ZIP 239: MSG_TX should be used if and only if the tx is v4 or earlier.
+                    if ((mi->second->nVersion <= 4) != (inv.type == MSG_TX)) {
+                        Misbehaving(pfrom->GetId(), 100);
+                        LogPrint("net", "Wrong INV message type used for v%d tx", mi->second->nVersion);
+                        // Break so that this inv message will be erased from the queue
+                        // (otherwise the peer would repeatedly hit this case until its
+                        // Misbehaving level rises above -banscore, no matter what the
+                        // user set it to).
+                        break;
+                    }
+                    // Ensure we only reply with a transaction if it is exactly what the
+                    // peer requested from us. Otherwise we add it to vNotFound below.
+                    if (inv.hashAux == mi->second->GetAuthDigest()) {
+                        pfrom->PushMessage("tx", *mi->second);
+                        push = true;
+                    }
+                } else if (pfrom->timeLastMempoolReq) {
+                    auto txinfo = mempool.info(inv.hash);
+                    // To protect privacy, do not answer getdata using the mempool when
+                    // that TX couldn't have been INVed in reply to a MEMPOOL request.
+                    if (txinfo.tx && txinfo.nTime <= pfrom->timeLastMempoolReq && !IsExpiringSoonTx(*txinfo.tx, currentHeight + 1)) {
+                        // ZIP 239: MSG_TX should be used if and only if the tx is v4 or earlier.
+                        if ((txinfo.tx->nVersion <= 4) != (inv.type == MSG_TX)) {
+                            Misbehaving(pfrom->GetId(), 100);
+                            LogPrint("net", "Wrong INV message type used for v%d tx", txinfo.tx->nVersion);
+                            // Break so that this inv message will be erased from the queue.
+                            break;
+                        }
+                        // Ensure we only reply with a transaction if it is exactly what
+                        // the peer requested from us. Otherwise we add it to vNotFound
+                        // below.
+                        if (inv.hashAux == txinfo.tx->GetAuthDigest()) {
+                            pfrom->PushMessage("tx", *txinfo.tx);
+                            push = true;
+                        }
+                    }
+                }
+                if (!push) {
+                    vNotFound.push_back(inv);
+                }
+            }
+
+            // Track requests for our stuff.
+            GetMainSignals().Inventory(inv.hash);
+
+            if (inv.type == MSG_BLOCK || inv.type == MSG_FILTERED_BLOCK)
+                break;
+        }
+    }
+
+    pfrom->vRecvGetData.erase(pfrom->vRecvGetData.begin(), it);
+
+    if (!vNotFound.empty()) {
+        // Let the peer know that we didn't find what it asked for, so it doesn't
+        // have to wait around forever. Currently only SPV clients actually care
+        // about this message: it's needed when they are recursively walking the
+        // dependencies of relevant unconfirmed transactions. SPV clients want to
+        // do that because they want to know about (and store and rebroadcast and
+        // risk analyze) the dependencies of transactions relevant to them, without
+        // having to download the entire memory pool.
+        pfrom->PushMessage("notfound", vNotFound);
+    }
+}
+
+bool static ProcessMessage(const CChainParams& chainparams, CNode* pfrom, string strCommand, CDataStream& vRecv, int64_t nTimeReceived)
+{
+    LogPrint("net", "received: %s (%u bytes) peer=%d\n", SanitizeString(strCommand), vRecv.size(), pfrom->id);
+    if (mapArgs.count("-dropmessagestest") && GetRand(atoi(mapArgs["-dropmessagestest"])) == 0)
+    {
+        LogPrintf("dropmessagestest DROPPING RECV MESSAGE\n");
+        return true;
+    }
+
+
+    if (strCommand == "version")
+    {
+        // Each connection can only send one version message
+        if (pfrom->nVersion != 0)
+        {
+            pfrom->PushMessage("reject", strCommand, REJECT_DUPLICATE, string("Duplicate version message"));
+            LOCK(cs_main);
+            Misbehaving(pfrom->GetId(), 1);
+            return false;
+        }
+
+        int64_t nTime;
+        CAddress addrMe;
+        CAddress addrFrom;
+        uint64_t nNonce = 1;
+        std::string strSubVer;
+        std::string cleanSubVer;
+        uint64_t nServices;
+        vRecv >> pfrom->nVersion >> nServices >> nTime >> addrMe;
+        pfrom->nServices = nServices;
+        if (pfrom->nVersion < MIN_PEER_PROTO_VERSION)
+        {
+            // disconnect from peers older than this proto version
+            LogPrintf("peer=%d using obsolete version %i; disconnecting\n", pfrom->id, pfrom->nVersion);
+            pfrom->PushMessage("reject", strCommand, REJECT_OBSOLETE,
+                               strprintf("Version must be %d or greater", MIN_PEER_PROTO_VERSION));
+            pfrom->fDisconnect = true;
+            return false;
+        }
+
+        if (chainparams.NetworkIDString() == "test" &&
+            pfrom->nVersion < MIN_TESTNET_PEER_PROTO_VERSION)
+        {
+            // disconnect from testnet peers older than this proto version
+            LogPrintf("peer=%d using obsolete version %i; disconnecting\n", pfrom->id, pfrom->nVersion);
+            pfrom->PushMessage("reject", strCommand, REJECT_OBSOLETE,
+                               strprintf("Version must be %d or greater", MIN_TESTNET_PEER_PROTO_VERSION));
+            pfrom->fDisconnect = true;
+            return false;
+        }
+
+        // Reject incoming connections from nodes that don't know about the current epoch
+        const Consensus::Params& consensusParams = chainparams.GetConsensus();
+        auto currentEpoch = CurrentEpoch(GetHeight(), consensusParams);
+        if (pfrom->nVersion < consensusParams.vUpgrades[currentEpoch].nProtocolVersion &&
+            !(
+                chainparams.NetworkIDString() == "regtest" &&
+                !GetBoolArg("-nurejectoldversions", DEFAULT_NU_REJECT_OLD_VERSIONS)
+            )
+        ) {
+            LogPrintf("peer=%d using obsolete version %i; disconnecting\n", pfrom->id, pfrom->nVersion);
+            pfrom->PushMessage("reject", strCommand, REJECT_OBSOLETE,
+                            strprintf("Version must be %d or greater",
+                            consensusParams.vUpgrades[currentEpoch].nProtocolVersion));
+            pfrom->fDisconnect = true;
+            return false;
+        }
+
+        if (pfrom->nVersion == 10300)
+            pfrom->nVersion = 300;
+        if (!vRecv.empty())
+            vRecv >> addrFrom >> nNonce;
+        if (!vRecv.empty()) {
+            vRecv >> LIMITED_STRING(strSubVer, MAX_SUBVERSION_LENGTH);
+            cleanSubVer = SanitizeString(strSubVer, SAFE_CHARS_SUBVERSION);
+        }
+        if (!vRecv.empty()) {
+            int nStartingHeight;
+            vRecv >> nStartingHeight;
+            pfrom->nStartingHeight = nStartingHeight;
+        }
+        {
+            LOCK(pfrom->cs_filter);
+            if (!vRecv.empty())
+                vRecv >> pfrom->fRelayTxes; // set to true after we get the first filter* message
+            else
+                pfrom->fRelayTxes = true;
+        }
+
+        // Disconnect if we connected to ourself
+        if (nNonce == nLocalHostNonce && nNonce > 1)
+        {
+            LogPrintf("connected to self at %s, disconnecting\n", pfrom->addr.ToString());
+            pfrom->fDisconnect = true;
+            return true;
+        }
+
+        pfrom->SetAddrLocal(addrMe);
+        if (pfrom->fInbound && addrMe.IsRoutable())
+        {
+            SeenLocal(addrMe);
+        }
+
+        // Be shy and don't send version until we hear
+        if (pfrom->fInbound)
+            pfrom->PushVersion();
+
+        {
+            LOCK(pfrom->cs_SubVer);
+            pfrom->strSubVer = strSubVer;
+            pfrom->cleanSubVer = cleanSubVer;
+        }
+        pfrom->fClient = !(pfrom->nServices & NODE_NETWORK);
+
+        // Potentially mark this peer as a preferred download peer.
+        {
+            LOCK(cs_main);
+            UpdatePreferredDownload(pfrom, State(pfrom->GetId()));
+        }
+
+        // Change version
+        pfrom->PushMessage("verack");
+        pfrom->ssSend.SetVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
+
+        if (!pfrom->fInbound)
+        {
+            // Advertise our address
+            if (fListen && !IsInitialBlockDownload(chainparams.GetConsensus()))
+            {
+                CAddress addr = GetLocalAddress(&pfrom->addr);
+                FastRandomContext insecure_rand;
+                if (addr.IsRoutable())
+                {
+                    LogPrintf("ProcessMessages: advertizing address %s\n", addr.ToString());
+                    pfrom->PushAddress(addr, insecure_rand);
+                } else if (IsPeerAddrLocalGood(pfrom)) {
+                    addr.SetIP(addrMe);
+                    LogPrintf("ProcessMessages: advertizing address %s\n", addr.ToString());
+                    pfrom->PushAddress(addr, insecure_rand);
+                }
+            }
+
+            // Get recent addresses
+            if (pfrom->fOneShot || pfrom->nVersion >= CADDR_TIME_VERSION || addrman.size() < 1000)
+            {
+                pfrom->PushMessage("getaddr");
+                pfrom->fGetAddr = true;
+            }
+            addrman.Good(pfrom->addr);
+        } else {
+            if (((CNetAddr)pfrom->addr) == (CNetAddr)addrFrom)
+            {
+                addrman.Add(addrFrom, addrFrom);
+                addrman.Good(addrFrom);
+            }
+        }
+
+        // Relay alerts
+        {
+            LOCK(cs_mapAlerts);
+            for (std::pair<const uint256, CAlert>& item : mapAlerts)
+                item.second.RelayTo(pfrom);
+        }
+
+        pfrom->fSuccessfullyConnected = true;
+
+        string remoteAddr;
+        if (fLogIPs)
+            remoteAddr = ", peeraddr=" + pfrom->addr.ToString();
+
+        LogPrintf("receive version message: %s: version %d, blocks=%d, us=%s, peer=%d%s\n",
+                  cleanSubVer, pfrom->nVersion,
+                  pfrom->nStartingHeight, addrMe.ToString(), pfrom->id,
+                  remoteAddr);
+
+        pfrom->nTimeOffset = timeWarning.AddTimeData(pfrom->addr, nTime, GetTime());
+    }
+
+
+    else if (pfrom->nVersion == 0)
+    {
+        // Must have a version message before anything else
+        LOCK(cs_main);
+        Misbehaving(pfrom->GetId(), 1);
+        return false;
+    }
+
+
+    else if (strCommand == "verack")
+    {
+        pfrom->SetRecvVersion(min(pfrom->nVersion, PROTOCOL_VERSION));
+
+        // Mark this node as currently connected, so we update its timestamp later.
+        if (pfrom->fNetworkNode) {
+            LOCK(cs_main);
+            State(pfrom->GetId())->fCurrentlyConnected = true;
+        }
+    }
+
+
+    // Disconnect existing peer connection when:
+    // 1. The version message has been received
+    // 2. Peer version is below the minimum version for the current epoch
+    else if (pfrom->nVersion < chainparams.GetConsensus().vUpgrades[
+        CurrentEpoch(GetHeight(), chainparams.GetConsensus())].nProtocolVersion &&
+        !(
+            chainparams.NetworkIDString() == "regtest" &&
+            !GetBoolArg("-nurejectoldversions", DEFAULT_NU_REJECT_OLD_VERSIONS)
+        )
+    ) {
+        LogPrintf("peer=%d using obsolete version %i; disconnecting\n", pfrom->id, pfrom->nVersion);
+        pfrom->PushMessage("reject", strCommand, REJECT_OBSOLETE,
+                            strprintf("Version must be %d or greater",
+                            chainparams.GetConsensus().vUpgrades[
+                                CurrentEpoch(GetHeight(), chainparams.GetConsensus())].nProtocolVersion));
+        pfrom->fDisconnect = true;
+        return false;
+    }
+
+
+    else if (strCommand == "addr")
+    {
+        vector<CAddress> vAddr;
+        vRecv >> vAddr;
+
+        // Don't want addr from older versions unless seeding
+        if (pfrom->nVersion < CADDR_TIME_VERSION && addrman.size() > 1000)
+            return true;
+        if (vAddr.size() > 1000)
+        {
+            LOCK(cs_main);
+            Misbehaving(pfrom->GetId(), 20);
+            return error("message addr size() = %u", vAddr.size());
+        }
+
+        // Store the new addresses
+        vector<CAddress> vAddrOk;
+        int64_t nNow = GetTime();
+        int64_t nSince = nNow - 10 * 60;
+        for (CAddress& addr : vAddr)
+        {
+            boost::this_thread::interruption_point();
+
+            if (addr.nTime <= 100000000 || addr.nTime > nNow + 10 * 60)
+                addr.nTime = nNow - 5 * 24 * 60 * 60;
+            pfrom->AddAddressKnown(addr);
+            bool fReachable = IsReachable(addr);
+            if (addr.nTime > nSince && !pfrom->fGetAddr && vAddr.size() <= 10 && addr.IsRoutable())
+            {
+                // Relay to a limited number of other nodes
+                {
+                    LOCK(cs_vNodes);
+                    // Use deterministic randomness to send to the same nodes for 24 hours
+                    // at a time so the addrKnowns of the chosen nodes prevent repeats
+                    static const uint64_t salt0 = GetRand(std::numeric_limits<uint64_t>::max());
+                    static const uint64_t salt1 = GetRand(std::numeric_limits<uint64_t>::max());
+                    uint64_t hashAddr = addr.GetHash();
+                    multimap<uint64_t, CNode*> mapMix;
+                    FastRandomContext insecure_rand;
+                    const CSipHasher hasher = CSipHasher(salt0, salt1).Write(hashAddr << 32).Write((GetTime() + hashAddr) / (24*60*60));
+                    for (CNode* pnode : vNodes)
+                    {
+                        if (pnode->nVersion < CADDR_TIME_VERSION)
+                            continue;
+                        uint64_t hashKey = CSipHasher(hasher).Write(pnode->id).Finalize();
+                        mapMix.insert(make_pair(hashKey, pnode));
+                    }
+                    int nRelayNodes = fReachable ? 2 : 1; // limited relaying of addresses outside our network(s)
+                    for (multimap<uint64_t, CNode*>::iterator mi = mapMix.begin(); mi != mapMix.end() && nRelayNodes-- > 0; ++mi)
+                        ((*mi).second)->PushAddress(addr, insecure_rand);
+                }
+            }
+            // Do not store addresses outside our network
+            if (fReachable)
+                vAddrOk.push_back(addr);
+        }
+        addrman.Add(vAddrOk, pfrom->addr, 2 * 60 * 60);
+        if (vAddr.size() < 1000)
+            pfrom->fGetAddr = false;
+        if (pfrom->fOneShot)
+            pfrom->fDisconnect = true;
+    }
+
+
+    else if (strCommand == "inv")
+    {
+        vector<CInv> vInv;
+        vRecv >> vInv;
+        if (vInv.size() > MAX_INV_SZ)
+        {
+            LOCK(cs_main);
+            Misbehaving(pfrom->GetId(), 20);
+            return error("message inv size() = %u", vInv.size());
+        }
+
+        bool fBlocksOnly = GetBoolArg("-blocksonly", DEFAULT_BLOCKSONLY);
+
+        // Allow whitelisted peers to send data other than blocks in blocks only mode if whitelistrelay is true
+        if (pfrom->fWhitelisted && GetBoolArg("-whitelistrelay", DEFAULT_WHITELISTRELAY))
+            fBlocksOnly = false;
+
+        LOCK(cs_main);
+
+        std::vector<CInv> vToFetch;
+
+        for (unsigned int nInv = 0; nInv < vInv.size(); nInv++)
+        {
+            const CInv &inv = vInv[nInv];
+
+            boost::this_thread::interruption_point();
+
+            bool fAlreadyHave = AlreadyHave(inv);
+            LogPrint("net", "got inv: %s  %s peer=%d\n", inv.ToString(), fAlreadyHave ? "have" : "new", pfrom->id);
+
+            if (inv.type == MSG_BLOCK) {
+                UpdateBlockAvailability(pfrom->GetId(), inv.hash);
+                if (!fAlreadyHave && !fImporting && !fReindex && !mapBlocksInFlight.count(inv.hash)) {
+                    // First request the headers preceding the announced block. In the normal fully-synced
+                    // case where a new block is announced that succeeds the current tip (no reorganization),
+                    // there are no such headers.
+                    // Secondly, and only when we are close to being synced, we request the announced block directly,
+                    // to avoid an extra round-trip. Note that we must *first* ask for the headers, so by the
+                    // time the block arrives, the header chain leading up to it is already validated. Not
+                    // doing this will result in the received block being rejected as an orphan in case it is
+                    // not a direct successor.
+                    pfrom->PushMessage("getheaders", chainActive.GetLocator(pindexBestHeader), inv.hash);
+                    CNodeState *nodestate = State(pfrom->GetId());
+
+                    if (chainActive.Tip()->GetBlockTime() > GetTime() - chainparams.GetConsensus().PoWTargetSpacing(pindexBestHeader->nHeight) * 20 &&
+                        nodestate->nBlocksInFlight < MAX_BLOCKS_IN_TRANSIT_PER_PEER) {
+                        vToFetch.push_back(inv);
+                        // Mark block as in flight already, even though the actual "getdata" message only goes out
+                        // later (within the same cs_main lock, though).
+                        MarkBlockAsInFlight(pfrom->GetId(), inv.hash, chainparams.GetConsensus());
+                    }
+                    LogPrint("net", "getheaders (%d) %s to peer=%d\n", pindexBestHeader->nHeight, inv.hash.ToString(), pfrom->id);
+                }
+            }
+            else
+            {
+                pfrom->AddKnownTx(WTxId(inv.hash, inv.hashAux));
+                if (fBlocksOnly)
+                    LogPrint("net", "transaction (%s) inv sent in violation of protocol peer=%d\n", inv.hash.ToString(), pfrom->id);
+                else if (!fAlreadyHave && !IsInitialBlockDownload(chainparams.GetConsensus()))
+                    pfrom->AskFor(inv);
+            }
+
+            // Track requests for our stuff
+            GetMainSignals().Inventory(inv.hash);
+
+            if (pfrom->nSendSize > (SendBufferSize() * 2)) {
+                Misbehaving(pfrom->GetId(), 50);
+                return error("send buffer size() = %u", pfrom->nSendSize);
+            }
+        }
+
+        if (!vToFetch.empty())
+            pfrom->PushMessage("getdata", vToFetch);
+    }
+
+
+    else if (strCommand == "getdata")
+    {
+        vector<CInv> vInv;
+        vRecv >> vInv;
+        if (vInv.size() > MAX_INV_SZ)
+        {
+            LOCK(cs_main);
+            Misbehaving(pfrom->GetId(), 20);
+            return error("message getdata size() = %u", vInv.size());
+        }
+
+        if (fDebug || (vInv.size() != 1))
+            LogPrint("net", "received getdata (%u invsz) peer=%d\n", vInv.size(), pfrom->id);
+
+        if ((fDebug && vInv.size() > 0) || (vInv.size() == 1))
+            LogPrint("net", "received getdata for: %s peer=%d\n", vInv[0].ToString(), pfrom->id);
+
+        pfrom->vRecvGetData.insert(pfrom->vRecvGetData.end(), vInv.begin(), vInv.end());
+        ProcessGetData(pfrom, chainparams.GetConsensus());
+    }
+
+
+    else if (strCommand == "getblocks")
+    {
+        CBlockLocator locator;
+        uint256 hashStop;
+        vRecv >> locator >> hashStop;
+
+        LOCK(cs_main);
+
+        // Find the last block the caller has in the main chain
+        CBlockIndex* pindex = FindForkInGlobalIndex(chainActive, locator);
+
+        // Send the rest of the chain
+        if (pindex)
+            pindex = chainActive.Next(pindex);
+        int nLimit = 500;
+        LogPrint("net", "getblocks %d to %s limit %d from peer=%d\n", (pindex ? pindex->nHeight : -1), hashStop.IsNull() ? "end" : hashStop.ToString(), nLimit, pfrom->id);
+        for (; pindex; pindex = chainActive.Next(pindex))
+        {
+            if (pindex->GetBlockHash() == hashStop)
+            {
+                LogPrint("net", "  getblocks stopping at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString());
+                break;
+            }
+            // If pruning, don't inv blocks unless we have on disk and are likely to still have
+            // for some reasonable time window (1 hour) that block relay might require.
+            const int nPrunedBlocksLikelyToHave = MIN_BLOCKS_TO_KEEP - 3600 / chainparams.GetConsensus().PoWTargetSpacing(pindex->nHeight);
+            if (fPruneMode && (!(pindex->nStatus & BLOCK_HAVE_DATA) || pindex->nHeight <= chainActive.Tip()->nHeight - nPrunedBlocksLikelyToHave))
+            {
+                LogPrint("net", " getblocks stopping, pruned or too old block at %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString());
+                break;
+            }
+            pfrom->PushBlockInventory(pindex->GetBlockHash());
+            if (--nLimit <= 0)
+            {
+                // When this block is requested, we'll send an inv that'll
+                // trigger the peer to getblocks the next batch of inventory.
+                LogPrint("net", "  getblocks stopping at limit %d %s\n", pindex->nHeight, pindex->GetBlockHash().ToString());
+                pfrom->hashContinue = pindex->GetBlockHash();
+                break;
+            }
+        }
+    }
+
+
+    else if (strCommand == "getheaders")
+    {
+        CBlockLocator locator;
+        uint256 hashStop;
+        vRecv >> locator >> hashStop;
+
+        LOCK(cs_main);
+        if (IsInitialBlockDownload(chainparams.GetConsensus()) && !pfrom->fWhitelisted) {
+            LogPrint("net", "Ignoring getheaders from peer=%d because node is in initial block download\n", pfrom->id);
+            return true;
+        }
+        CBlockIndex* pindex = NULL;
+        if (locator.IsNull())
+        {
+            // If locator is null, return the hashStop block
+            BlockMap::iterator mi = mapBlockIndex.find(hashStop);
+            if (mi == mapBlockIndex.end())
+                return true;
+            pindex = (*mi).second;
+        }
+        else
+        {
+            // Find the last block the caller has in the main chain
+            pindex = FindForkInGlobalIndex(chainActive, locator);
+            if (pindex)
+                pindex = chainActive.Next(pindex);
+        }
+
+        // we must use CBlocks, as CBlockHeaders won't include the 0x00 nTx count at the end
+        vector<CBlock> vHeaders;
+        int nLimit = MAX_HEADERS_RESULTS;
+        LogPrint("net", "getheaders %d to %s from peer=%d\n", (pindex ? pindex->nHeight : -1), hashStop.ToString(), pfrom->id);
+        for (; pindex; pindex = chainActive.Next(pindex))
+        {
+            vHeaders.push_back(pindex->GetBlockHeader());
+            if (--nLimit <= 0 || pindex->GetBlockHash() == hashStop)
+                break;
+        }
+        pfrom->PushMessage("headers", vHeaders);
+    }
+
+
+    else if (strCommand == "tx" && !IsInitialBlockDownload(chainparams.GetConsensus()))
+    {
+        // Stop processing the transaction early if
+        // We are in blocks only mode and peer is either not whitelisted or whitelistrelay is off
+        if (GetBoolArg("-blocksonly", DEFAULT_BLOCKSONLY) && (!pfrom->fWhitelisted || !GetBoolArg("-whitelistrelay", DEFAULT_WHITELISTRELAY)))
+        {
+            LogPrint("net", "transaction sent in violation of protocol peer=%d\n", pfrom->id);
+            return true;
+        }
+
+        vector<uint256> vWorkQueue;
+        vector<uint256> vEraseQueue;
+        CTransaction tx;
+        vRecv >> tx;
+
+        const uint256& txid = tx.GetHash();
+        const WTxId& wtxid = tx.GetWTxId();
+
+        LOCK(cs_main);
+
+        pfrom->AddKnownTx(wtxid);
+
+        bool fMissingInputs = false;
+        CValidationState state;
+
+        pfrom->setAskFor.erase(wtxid);
+        mapAlreadyAskedFor.erase(wtxid);
+
+        // We do the AlreadyHave() check using a MSG_WTX inv unconditionally,
+        // because for pre-v5 transactions wtxid.authDigest is set to the same
+        // placeholder as is used for the CInv.hashAux field for MSG_TX.
+        if (!AlreadyHave(CInv(MSG_WTX, txid, wtxid.authDigest)) &&
+            AcceptToMemoryPool(chainparams, mempool, state, tx, true, &fMissingInputs))
+        {
+            mempool.check(pcoinsTip);
+            RelayTransaction(tx);
+            vWorkQueue.push_back(txid);
+
+            LogPrint("mempool", "AcceptToMemoryPool: peer=%d %s: accepted %s (poolsz %u txn, %u kB)\n",
+                pfrom->id, pfrom->cleanSubVer,
+                tx.GetHash().ToString(),
+                mempool.size(), mempool.DynamicMemoryUsage() / 1000);
+
+            // Recursively process any orphan transactions that depended on this one
+            set<NodeId> setMisbehaving;
+            for (unsigned int i = 0; i < vWorkQueue.size(); i++)
+            {
+                map<uint256, set<uint256> >::iterator itByPrev = mapOrphanTransactionsByPrev.find(vWorkQueue[i]);
+                if (itByPrev == mapOrphanTransactionsByPrev.end())
+                    continue;
+                for (set<uint256>::iterator mi = itByPrev->second.begin();
+                     mi != itByPrev->second.end();
+                     ++mi)
+                {
+                    const uint256& orphanHash = *mi;
+                    const CTransaction& orphanTx = mapOrphanTransactions[orphanHash].tx;
+                    NodeId fromPeer = mapOrphanTransactions[orphanHash].fromPeer;
+                    bool fMissingInputs2 = false;
+                    // Use a dummy CValidationState so someone can't setup nodes to counter-DoS based on orphan
+                    // resolution (that is, feeding people an invalid transaction based on LegitTxX in order to get
+                    // anyone relaying LegitTxX banned)
+                    CValidationState stateDummy;
+
+
+                    if (setMisbehaving.count(fromPeer))
+                        continue;
+                    if (AcceptToMemoryPool(chainparams, mempool, stateDummy, orphanTx, true, &fMissingInputs2))
+                    {
+                        LogPrint("mempool", "   accepted orphan tx %s\n", orphanHash.ToString());
+                        RelayTransaction(orphanTx);
+                        vWorkQueue.push_back(orphanHash);
+                        vEraseQueue.push_back(orphanHash);
+                    }
+                    else if (!fMissingInputs2)
+                    {
+                        int nDos = 0;
+                        if (stateDummy.IsInvalid(nDos) && nDos > 0)
+                        {
+                            // Punish peer that gave us an invalid orphan tx
+                            Misbehaving(fromPeer, nDos);
+                            setMisbehaving.insert(fromPeer);
+                            LogPrint("mempool", "   invalid orphan tx %s\n", orphanHash.ToString());
+                        }
+                        // Has inputs but not accepted to mempool
+                        // Probably non-standard or insufficient fee/priority
+                        LogPrint("mempool", "   removed orphan tx %s\n", orphanHash.ToString());
+                        vEraseQueue.push_back(orphanHash);
+                        // Add the wtxid of this transaction to our reject filter.
+                        // Unlike upstream Bitcoin Core, we can unconditionally add
+                        // these, as they are always bound to the entirety of the
+                        // transaction regardless of version.
+                        assert(recentRejects);
+                        recentRejects->insert(orphanTx.GetWTxId().ToBytes());
+                    }
+                    mempool.check(pcoinsTip);
+                }
+            }
+
+            for (uint256 hash : vEraseQueue)
+                EraseOrphanTx(hash);
+        }
+        // TODO: currently, prohibit joinsplits and shielded spends/outputs/actions from entering mapOrphans
+        else if (fMissingInputs &&
+                 tx.vJoinSplit.empty() &&
+                 tx.vShieldedSpend.empty() &&
+                 tx.vShieldedOutput.empty() &&
+                 !tx.GetOrchardBundle().IsPresent())
+        {
+            AddOrphanTx(tx, pfrom->GetId());
+
+            // DoS prevention: do not allow mapOrphanTransactions to grow unbounded
+            unsigned int nMaxOrphanTx = (unsigned int)std::max((int64_t)0, GetArg("-maxorphantx", DEFAULT_MAX_ORPHAN_TRANSACTIONS));
+            unsigned int nEvicted = LimitOrphanTxSize(nMaxOrphanTx);
+            if (nEvicted > 0)
+                LogPrint("mempool", "mapOrphan overflow, removed %u tx\n", nEvicted);
+        } else {
+            // Add the wtxid of this transaction to our reject filter.
+            // Unlike upstream Bitcoin Core, we can unconditionally add
+            // these, as they are always bound to the entirety of the
+            // transaction regardless of version.
+            assert(recentRejects);
+            recentRejects->insert(tx.GetWTxId().ToBytes());
+
+            if (pfrom->fWhitelisted && GetBoolArg("-whitelistforcerelay", DEFAULT_WHITELISTFORCERELAY)) {
+                // Always relay transactions received from whitelisted peers, even
+                // if they were already in the mempool or rejected from it due
+                // to policy, allowing the node to function as a gateway for
+                // nodes hidden behind it.
+                //
+                // Never relay transactions that we would assign a non-zero DoS
+                // score for, as we expect peers to do the same with us in that
+                // case.
+                int nDoS = 0;
+                if (!state.IsInvalid(nDoS) || nDoS == 0) {
+                    LogPrintf("Force relaying tx %s from whitelisted peer=%d\n", tx.GetHash().ToString(), pfrom->id);
+                    RelayTransaction(tx);
+                } else {
+                    LogPrintf("Not relaying invalid transaction %s from whitelisted peer=%d (%s (code %d))\n",
+                        tx.GetHash().ToString(), pfrom->id, state.GetRejectReason(), state.GetRejectCode());
+                }
+            }
+        }
+        int nDoS = 0;
+        if (state.IsInvalid(nDoS))
+        {
+            LogPrint("mempoolrej", "%s from peer=%d %s was not accepted into the memory pool: %s\n", tx.GetHash().ToString(),
+                pfrom->id, pfrom->cleanSubVer,
+                FormatStateMessage(state));
+            if (state.GetRejectCode() < REJECT_INTERNAL) // Never send AcceptToMemoryPool's internal codes over P2P
+                pfrom->PushMessage("reject", strCommand, (unsigned char)state.GetRejectCode(),
+                                   state.GetRejectReason().substr(0, MAX_REJECT_MESSAGE_LENGTH), txid);
+            if (nDoS > 0)
+                Misbehaving(pfrom->GetId(), nDoS);
+        }
+    }
+
+
+    else if (strCommand == "headers" && !fImporting && !fReindex) // Ignore headers received while importing
+    {
+        std::vector<CBlockHeader> headers;
+
+        // Bypass the normal CBlock deserialization, as we don't want to risk deserializing 2000 full blocks.
+        unsigned int nCount = ReadCompactSize(vRecv);
+        if (nCount > MAX_HEADERS_RESULTS) {
+            LOCK(cs_main);
+            Misbehaving(pfrom->GetId(), 20);
+            return error("headers message size = %u", nCount);
+        }
+        headers.resize(nCount);
+        for (unsigned int n = 0; n < nCount; n++) {
+            vRecv >> headers[n];
+            ReadCompactSize(vRecv); // ignore tx count; assume it is 0.
+        }
+
+        {
+        LOCK(cs_main);
+
+        if (nCount == 0) {
+            // Nothing interesting. Stop asking this peer for more headers.
+            return true;
+        }
+
+        // If we already know the last header in the message, then it contains
+        // no new information for us.  In this case, we do not request
+        // more headers later.  This prevents multiple chains of redundant
+        // getheader requests from running in parallel if triggered by incoming
+        // blocks while the node is still in initial headers sync.
+        //
+        // (Allow disabling optimization in case there are unexpected problems.)
+        bool hasNewHeaders = true;
+        if (GetBoolArg("-optimize-getheaders", true) && IsInitialBlockDownload(chainparams.GetConsensus())) {
+            hasNewHeaders = (mapBlockIndex.count(headers.back().GetHash()) == 0);
+        }
+
+        CBlockIndex *pindexLast = NULL;
+        for (const CBlockHeader& header : headers) {
+            CValidationState state;
+            if (pindexLast != NULL && header.hashPrevBlock != pindexLast->GetBlockHash()) {
+                Misbehaving(pfrom->GetId(), 20);
+                return error("non-continuous headers sequence");
+            }
+            if (!AcceptBlockHeader(header, state, chainparams, &pindexLast)) {
+                int nDoS;
+                if (state.IsInvalid(nDoS)) {
+                    if (nDoS > 0)
+                        Misbehaving(pfrom->GetId(), nDoS);
+                    return error("invalid header received");
+                }
+            }
+        }
+
+        if (pindexLast)
+            UpdateBlockAvailability(pfrom->GetId(), pindexLast->GetBlockHash());
+
+        // Temporary, until we're sure the optimization works
+        if (nCount == MAX_HEADERS_RESULTS && pindexLast && !hasNewHeaders) {
+            LogPrint("net", "NO more getheaders (%d) to send to peer=%d (startheight:%d)\n", pindexLast->nHeight, pfrom->id, pfrom->nStartingHeight);
+        }
+
+        if (nCount == MAX_HEADERS_RESULTS && pindexLast && hasNewHeaders) {
+            // Headers message had its maximum size; the peer may have more headers.
+            // TODO: optimize: if pindexLast is an ancestor of chainActive.Tip or pindexBestHeader, continue
+            // from there instead.
+            LogPrint("net", "more getheaders (%d) to send to peer=%d (startheight:%d)\n", pindexLast->nHeight, pfrom->id, pfrom->nStartingHeight);
+            pfrom->PushMessage("getheaders", chainActive.GetLocator(pindexLast), uint256());
+        }
+
+        CheckBlockIndex(chainparams.GetConsensus());
+        }
+
+        NotifyHeaderTip(chainparams.GetConsensus());
+    }
+
+    else if (strCommand == "block" && !fImporting && !fReindex) // Ignore blocks received while importing
+    {
+        CBlock block;
+        vRecv >> block;
+
+        LogPrint("net", "received block %s peer=%d\n", block.GetHash().ToString(), pfrom->id);
+
+        CValidationState state;
+        // Process all blocks from whitelisted peers, even if not requested,
+        // unless we're still syncing with the network.
+        // Such an unrequested block may still be processed, subject to the
+        // conditions in AcceptBlock().
+        bool forceProcessing = pfrom->fWhitelisted && !IsInitialBlockDownload(chainparams.GetConsensus());
+        ProcessNewBlock(state, chainparams, pfrom, &block, forceProcessing, NULL);
+        int nDoS;
+        if (state.IsInvalid(nDoS)) {
+            assert (state.GetRejectCode() < REJECT_INTERNAL); // Blocks are never rejected with internal reject codes
+            pfrom->PushMessage("reject", strCommand, (unsigned char)state.GetRejectCode(),
+                               state.GetRejectReason().substr(0, MAX_REJECT_MESSAGE_LENGTH), block.GetHash());
+            if (nDoS > 0) {
+                LOCK(cs_main);
+                Misbehaving(pfrom->GetId(), nDoS);
+            }
+        }
+
+    }
+
+
+    // This asymmetric behavior for inbound and outbound connections was introduced
+    // to prevent a fingerprinting attack: an attacker can send specific fake addresses
+    // to users' AddrMan and later request them by sending getaddr messages.
+    // Making nodes which are behind NAT and can only make outgoing connections ignore
+    // the getaddr message mitigates the attack.
+    else if ((strCommand == "getaddr") && (pfrom->fInbound))
+    {
+        // Only send one GetAddr response per connection to reduce resource waste
+        //  and discourage addr stamping of INV announcements.
+        if (pfrom->fSentAddr) {
+            LogPrint("net", "Ignoring repeated \"getaddr\". peer=%d\n", pfrom->id);
+            return true;
+        }
+        pfrom->fSentAddr = true;
+
+        pfrom->vAddrToSend.clear();
+        vector<CAddress> vAddr = addrman.GetAddr();
+        FastRandomContext insecure_rand;
+        for (const CAddress &addr : vAddr)
+            pfrom->PushAddress(addr, insecure_rand);
+    }
+
+
+    else if (strCommand == "mempool")
+    {
+        int currentHeight = GetHeight();
+        if (CNode::OutboundTargetReached(chainparams.GetConsensus().PoWTargetSpacing(currentHeight), false) && !pfrom->fWhitelisted)
+        {
+            LogPrint("net", "mempool request with bandwidth limit reached, disconnect peer=%d\n", pfrom->GetId());
+            pfrom->fDisconnect = true;
+            return true;
+        }
+
+        LOCK(pfrom->cs_inventory);
+        pfrom->fSendMempool = true;
+    }
+
+
+    else if (strCommand == "ping")
+    {
+        if (pfrom->nVersion > BIP0031_VERSION)
+        {
+            uint64_t nonce = 0;
+            vRecv >> nonce;
+            // Echo the message back with the nonce. This allows for two useful features:
+            //
+            // 1) A remote node can quickly check if the connection is operational
+            // 2) Remote nodes can measure the latency of the network thread. If this node
+            //    is overloaded it won't respond to pings quickly and the remote node can
+            //    avoid sending us more work, like chain download requests.
+            //
+            // The nonce stops the remote getting confused between different pings: without
+            // it, if the remote node sends a ping once per second and this node takes 5
+            // seconds to respond to each, the 5th ping the remote sends would appear to
+            // return very quickly.
+            pfrom->PushMessage("pong", nonce);
+        }
+    }
+
+
+    else if (strCommand == "pong")
+    {
+        int64_t pingUsecEnd = nTimeReceived;
+        uint64_t nonce = 0;
+        size_t nAvail = vRecv.in_avail();
+        bool bPingFinished = false;
+        std::string sProblem;
+
+        if (nAvail >= sizeof(nonce)) {
+            vRecv >> nonce;
+
+            // Only process pong message if there is an outstanding ping (old ping without nonce should never pong)
+            if (pfrom->nPingNonceSent != 0) {
+                if (nonce == pfrom->nPingNonceSent) {
+                    // Matching pong received, this ping is no longer outstanding
+                    bPingFinished = true;
+                    int64_t pingUsecTime = pingUsecEnd - pfrom->nPingUsecStart;
+                    if (pingUsecTime > 0) {
+                        // Successful ping time measurement, replace previous
+                        pfrom->nPingUsecTime = pingUsecTime;
+                        pfrom->nMinPingUsecTime = std::min(pfrom->nMinPingUsecTime.load(), pingUsecTime);
+                    } else {
+                        // This should never happen
+                        sProblem = "Timing mishap";
+                    }
+                } else {
+                    // Nonce mismatches are normal when pings are overlapping
+                    sProblem = "Nonce mismatch";
+                    if (nonce == 0) {
+                        // This is most likely a bug in another implementation somewhere; cancel this ping
+                        bPingFinished = true;
+                        sProblem = "Nonce zero";
+                    }
+                }
+            } else {
+                sProblem = "Unsolicited pong without ping";
+            }
+        } else {
+            // This is most likely a bug in another implementation somewhere; cancel this ping
+            bPingFinished = true;
+            sProblem = "Short payload";
+        }
+
+        if (!(sProblem.empty())) {
+            LogPrint("net", "pong peer=%d %s: %s, %x expected, %x received, %u bytes\n",
+                pfrom->id,
+                pfrom->cleanSubVer,
+                sProblem,
+                pfrom->nPingNonceSent,
+                nonce,
+                nAvail);
+        }
+        if (bPingFinished) {
+            pfrom->nPingNonceSent = 0;
+        }
+    }
+
+
+    else if (fAlerts && strCommand == "alert")
+    {
+        CAlert alert;
+        vRecv >> alert;
+
+        uint256 alertHash = alert.GetHash();
+        if (pfrom->setKnown.count(alertHash) == 0)
+        {
+            if (alert.ProcessAlert(chainparams.AlertKey()))
+            {
+                // Relay
+                pfrom->setKnown.insert(alertHash);
+                {
+                    LOCK(cs_vNodes);
+                    for (CNode* pnode : vNodes)
+                        alert.RelayTo(pnode);
+                }
+            }
+            else {
+                // Small DoS penalty so peers that send us lots of
+                // duplicate/expired/invalid-signature/whatever alerts
+                // eventually get banned.
+                // This isn't a Misbehaving(100) (immediate ban) because the
+                // peer might be an older or different implementation with
+                // a different signature key, etc.
+                LOCK(cs_main);
+                Misbehaving(pfrom->GetId(), 10);
+            }
+        }
+    }
+
+
+    else if (!(nLocalServices & NODE_BLOOM) &&
+              (strCommand == "filterload" ||
+               strCommand == "filteradd"))
+    {
+        if (pfrom->nVersion >= NO_BLOOM_VERSION) {
+            LOCK(cs_main);
+            Misbehaving(pfrom->GetId(), 100);
+            return false;
+        } else if (GetBoolArg("-enforcenodebloom", DEFAULT_ENFORCENODEBLOOM)) {
+            pfrom->fDisconnect = true;
+            return false;
+        }
+    }
+
+
+    else if (strCommand == "filterload")
+    {
+        CBloomFilter filter;
+        vRecv >> filter;
+
+        LOCK(pfrom->cs_filter);
+
+        if (!filter.IsWithinSizeConstraints())
+        {
+            // There is no excuse for sending a too-large filter
+            LOCK(cs_main);
+            Misbehaving(pfrom->GetId(), 100);
+        }
+        else
+        {
+            delete pfrom->pfilter;
+            pfrom->pfilter = new CBloomFilter(filter);
+            pfrom->fRelayTxes = true;
+        }
+    }
+
+
+    else if (strCommand == "filteradd")
+    {
+        vector<unsigned char> vData;
+        vRecv >> vData;
+
+        // Nodes must NEVER send a data item > 520 bytes (the max size for a script data object,
+        // and thus, the maximum size any matched object can have) in a filteradd message
+        bool bad = false;
+        if (vData.size() > MAX_SCRIPT_ELEMENT_SIZE) {
+            bad = true;
+        } else {
+            LOCK(pfrom->cs_filter);
+            if (pfrom->pfilter) {
+                pfrom->pfilter->insert(vData);
+            } else {
+                bad = true;
+            }
+        }
+        if (bad) {
+            LOCK(cs_main);
+            Misbehaving(pfrom->GetId(), 100);
+        }
+    }
+
+
+    else if (strCommand == "filterclear")
+    {
+        LOCK(pfrom->cs_filter);
+        if (nLocalServices & NODE_BLOOM) {
+            delete pfrom->pfilter;
+            pfrom->pfilter = new CBloomFilter();
+        }
+        pfrom->fRelayTxes = true;
+    }
+
+
+    else if (strCommand == "reject")
+    {
+        if (fDebug) {
+            try {
+                string strMsg; unsigned char ccode; string strReason;
+                vRecv >> LIMITED_STRING(strMsg, CMessageHeader::COMMAND_SIZE) >> ccode >> LIMITED_STRING(strReason, MAX_REJECT_MESSAGE_LENGTH);
+
+                ostringstream ss;
+                ss << strMsg << " code " << itostr(ccode) << ": " << strReason;
+
+                if (strMsg == "block" || strMsg == "tx")
+                {
+                    uint256 hash;
+                    vRecv >> hash;
+                    ss << ": hash " << hash.ToString();
+                }
+                LogPrint("net", "Reject %s\n", SanitizeString(ss.str()));
+            } catch (const std::ios_base::failure&) {
+                // Avoid feedback loops by preventing reject messages from triggering a new reject message.
+                LogPrint("net", "Unparsable reject message received\n");
+            }
+        }
+    }
+
+    else if (strCommand == "notfound") {
+        // We do not care about the NOTFOUND message, but logging an Unknown Command
+        // message would be undesirable as we transmit it ourselves.
+    }
+
+    else if (!(strCommand == "tx" || strCommand == "block" || strCommand == "headers" || strCommand == "alert")) {
+        // Ignore unknown commands for extensibility
+        LogPrint("net", "Unknown command \"%s\" from peer=%d\n", SanitizeString(strCommand), pfrom->id);
+    }
+
+
+
+    return true;
+}
+
+// requires LOCK(cs_vRecvMsg)
+bool ProcessMessages(const CChainParams& chainparams, CNode* pfrom)
+{
+    //if (fDebug)
+    //    LogPrintf("%s(%u messages)\n", __func__, pfrom->vRecvMsg.size());
+
+    //
+    // Message format
+    //  (4) message start
+    //  (12) command
+    //  (4) size
+    //  (4) checksum
+    //  (x) data
+    //
+    bool fOk = true;
+
+    if (!pfrom->vRecvGetData.empty())
+        ProcessGetData(pfrom, chainparams.GetConsensus());
+
+    // this maintains the order of responses
+    if (!pfrom->vRecvGetData.empty()) return fOk;
+
+    std::deque<CNetMessage>::iterator it = pfrom->vRecvMsg.begin();
+    while (!pfrom->fDisconnect && it != pfrom->vRecvMsg.end()) {
+        // Don't bother if send buffer is too full to respond anyway
+        if (pfrom->nSendSize >= SendBufferSize())
+            break;
+
+        // get next message
+        CNetMessage& msg = *it;
+
+        //if (fDebug)
+        //    LogPrintf("%s(message %u msgsz, %u bytes, complete:%s)\n", __func__,
+        //            msg.hdr.nMessageSize, msg.vRecv.size(),
+        //            msg.complete() ? "Y" : "N");
+
+        // end, if an incomplete message is found
+        if (!msg.complete())
+            break;
+
+        // at this point, any failure means we can delete the current message
+        it++;
+
+        // Scan for message start
+        if (memcmp(msg.hdr.pchMessageStart, chainparams.MessageStart(), CMessageHeader::MESSAGE_START_SIZE) != 0) {
+            LogPrintf("PROCESSMESSAGE: INVALID MESSAGESTART %s peer=%d\n", SanitizeString(msg.hdr.GetCommand()), pfrom->id);
+            fOk = false;
+            break;
+        }
+
+        // Read header
+        CMessageHeader& hdr = msg.hdr;
+        if (!hdr.IsValid(chainparams.MessageStart()))
+        {
+            LogPrintf("PROCESSMESSAGE: ERRORS IN HEADER %s peer=%d\n", SanitizeString(hdr.GetCommand()), pfrom->id);
+            continue;
+        }
+        string strCommand = hdr.GetCommand();
+
+        // Message size
+        unsigned int nMessageSize = hdr.nMessageSize;
+
+        // Checksum
+        CDataStream& vRecv = msg.vRecv;
+        uint256 hash = Hash(vRecv.begin(), vRecv.begin() + nMessageSize);
+        if (memcmp(hash.begin(), hdr.pchChecksum, CMessageHeader::CHECKSUM_SIZE) != 0)
+        {
+            LogPrintf("%s(%s, %u bytes): CHECKSUM ERROR expected %s was %s\n", __func__,
+               SanitizeString(strCommand), nMessageSize,
+               HexStr(hash.begin(), hash.begin()+CMessageHeader::CHECKSUM_SIZE),
+               HexStr(hdr.pchChecksum, hdr.pchChecksum+CMessageHeader::CHECKSUM_SIZE));
+            continue;
+        }
+
+        // Process message
+        bool fRet = false;
+        try
+        {
+            fRet = ProcessMessage(chainparams, pfrom, strCommand, vRecv, msg.nTime);
+            boost::this_thread::interruption_point();
+        }
+        catch (const std::ios_base::failure& e)
+        {
+            pfrom->PushMessage("reject", strCommand, REJECT_MALFORMED, string("error parsing message"));
+            if (strstr(e.what(), "end of data"))
+            {
+                // Allow exceptions from under-length message on vRecv
+                LogPrintf("%s(%s, %u bytes): Exception '%s' caught, normally caused by a message being shorter than its stated length\n", __func__, SanitizeString(strCommand), nMessageSize, e.what());
+            }
+            else if (strstr(e.what(), "size too large"))
+            {
+                // Allow exceptions from over-long size
+                LogPrintf("%s(%s, %u bytes): Exception '%s' caught\n", __func__, SanitizeString(strCommand), nMessageSize, e.what());
+            }
+            else
+            {
+                PrintExceptionContinue(&e, "ProcessMessages()");
+            }
+        }
+        catch (const boost::thread_interrupted&) {
+            throw;
+        }
+        catch (const std::exception& e) {
+            PrintExceptionContinue(&e, "ProcessMessages()");
+        } catch (...) {
+            PrintExceptionContinue(NULL, "ProcessMessages()");
+        }
+
+        if (!fRet)
+            LogPrintf("%s(%s, %u bytes) FAILED peer=%d\n", __func__, SanitizeString(strCommand), nMessageSize, pfrom->id);
+
+        break;
+    }
+
+    // In case the connection got shut down, its receive buffer was wiped
+    if (!pfrom->fDisconnect)
+        pfrom->vRecvMsg.erase(pfrom->vRecvMsg.begin(), it);
+
+    return fOk;
+}
+
+class CompareInvMempoolOrder
+{
+    CTxMemPool *mp;
+public:
+    CompareInvMempoolOrder(CTxMemPool *mempool)
+    {
+        mp = mempool;
+    }
+
+    bool operator()(std::set<uint256>::iterator a, std::set<uint256>::iterator b)
+    {
+        /* As std::make_heap produces a max-heap, we want the entries with the
+         * highest feerate to sort later. */
+        return mp->CompareDepthAndScore(*b, *a);
+    }
+};
+
+bool SendMessages(const Consensus::Params& params, CNode* pto)
+{
+    {
+        // Don't send anything until we get its version message
+        if (pto->nVersion == 0)
+            return true;
+
+        //
+        // Message: ping
+        //
+        bool pingSend = false;
+        if (pto->fPingQueued) {
+            // RPC ping request by user
+            pingSend = true;
+        }
+        if (pto->nPingNonceSent == 0 && pto->nPingUsecStart + PING_INTERVAL * 1000000 < GetTimeMicros()) {
+            // Ping automatically sent as a latency probe & keepalive.
+            pingSend = true;
+        }
+        if (pingSend) {
+            uint64_t nonce = 0;
+            while (nonce == 0) {
+                GetRandBytes((unsigned char*)&nonce, sizeof(nonce));
+            }
+            pto->fPingQueued = false;
+            pto->nPingUsecStart = GetTimeMicros();
+            if (pto->nVersion > BIP0031_VERSION) {
+                pto->nPingNonceSent = nonce;
+                pto->PushMessage("ping", nonce);
+            } else {
+                // Peer is too old to support ping command with nonce, pong will never arrive.
+                pto->nPingNonceSent = 0;
+                pto->PushMessage("ping");
+            }
+        }
+
+        TRY_LOCK(cs_main, lockMain); // Acquire cs_main for IsInitialBlockDownload() and CNodeState()
+        if (!lockMain)
+            return true;
+
+        // Address refresh broadcast
+        int64_t nNow = GetTimeMicros();
+        if (!IsInitialBlockDownload(params) && pto->nNextLocalAddrSend < nNow) {
+            AdvertizeLocal(pto);
+            pto->nNextLocalAddrSend = PoissonNextSend(nNow, AVG_LOCAL_ADDRESS_BROADCAST_INTERVAL);
+        }
+
+        //
+        // Message: addr
+        //
+        if (pto->nNextAddrSend < nNow) {
+            pto->nNextAddrSend = PoissonNextSend(nNow, AVG_ADDRESS_BROADCAST_INTERVAL);
+            vector<CAddress> vAddr;
+            vAddr.reserve(pto->vAddrToSend.size());
+            for (const CAddress& addr : pto->vAddrToSend)
+            {
+                if (!pto->addrKnown.contains(addr.GetKey()))
+                {
+                    pto->addrKnown.insert(addr.GetKey());
+                    vAddr.push_back(addr);
+                    // receiver rejects addr messages larger than 1000
+                    if (vAddr.size() >= 1000)
+                    {
+                        pto->PushMessage("addr", vAddr);
+                        vAddr.clear();
+                    }
+                }
+            }
+            pto->vAddrToSend.clear();
+            if (!vAddr.empty())
+                pto->PushMessage("addr", vAddr);
+        }
+
+        CNodeState &state = *State(pto->GetId());
+        if (state.fShouldBan) {
+            if (pto->fWhitelisted)
+                LogPrintf("Warning: not punishing whitelisted peer %s!\n", pto->addr.ToString());
+            else {
+                pto->fDisconnect = true;
+                if (pto->addr.IsLocal())
+                    LogPrintf("Warning: not banning local peer %s!\n", pto->addr.ToString());
+                else
+                {
+                    CNode::Ban(pto->addr, BanReasonNodeMisbehaving);
+                }
+            }
+            state.fShouldBan = false;
+        }
+
+        for (const CBlockReject& reject : state.rejects)
+            pto->PushMessage("reject", (string)"block", reject.chRejectCode, reject.strRejectReason, reject.hashBlock);
+        state.rejects.clear();
+
+        // Start block sync
+        if (pindexBestHeader == NULL)
+            pindexBestHeader = chainActive.Tip();
+        bool fFetch = state.fPreferredDownload || (nPreferredDownload == 0 && !pto->fClient && !pto->fOneShot); // Download if this is a nice peer, or we have no nice peers and this one might do.
+        if (!state.fSyncStarted && !pto->fClient && !fImporting && !fReindex) {
+            // Only actively request headers from a single peer, unless we're close to today.
+            if ((nSyncStarted == 0 && fFetch) || pindexBestHeader->GetBlockTime() > GetTime() - 24 * 60 * 60) {
+                state.fSyncStarted = true;
+                nSyncStarted++;
+                const CBlockIndex *pindexStart = pindexBestHeader;
+                /* If possible, start at the block preceding the currently
+                   best known header.  This ensures that we always get a
+                   non-empty list of headers back as long as the peer
+                   is up-to-date.  With a non-empty response, we can initialise
+                   the peer's known best block.  This wouldn't be possible
+                   if we requested starting at pindexBestHeader and
+                   got back an empty response.  */
+                if (pindexStart->pprev)
+                    pindexStart = pindexStart->pprev;
+                LogPrint("net", "initial getheaders (%d) to peer=%d (startheight:%d)\n", pindexStart->nHeight, pto->id, pto->nStartingHeight);
+                pto->PushMessage("getheaders", chainActive.GetLocator(pindexStart), uint256());
+            }
+        }
+
+        // Resend wallet transactions that haven't gotten in a block yet
+        // Except during reindex, importing and IBD, when old wallet
+        // transactions become unconfirmed and spams other nodes.
+        if (!fReindex && !fImporting && !IsInitialBlockDownload(params))
+        {
+            GetMainSignals().Broadcast(nTimeBestReceived);
+        }
+
+        //
+        // Message: inventory
+        //
+        vector<CInv> vInv;
+        {
+            LOCK(pto->cs_inventory);
+            vInv.reserve(std::max<size_t>(pto->vInventoryBlockToSend.size(), INVENTORY_BROADCAST_MAX));
+
+            // Add blocks
+            for (const uint256& hash : pto->vInventoryBlockToSend) {
+                vInv.push_back(CInv(MSG_BLOCK, hash));
+                if (vInv.size() == MAX_INV_SZ) {
+                    pto->PushMessage("inv", vInv);
+                    vInv.clear();
+                }
+            }
+            pto->vInventoryBlockToSend.clear();
+
+            // Check whether periodic sends should happen
+            bool fSendTrickle = pto->fWhitelisted;
+            if (pto->nNextInvSend < nNow) {
+                fSendTrickle = true;
+                // Use half the delay for outbound peers, as there is less privacy concern for them.
+                pto->nNextInvSend = PoissonNextSend(nNow, INVENTORY_BROADCAST_INTERVAL >> !pto->fInbound);
+            }
+
+            // Time to send but the peer has requested we not relay transactions.
+            if (fSendTrickle) {
+                LOCK(pto->cs_filter);
+                if (!pto->fRelayTxes) pto->setInventoryTxToSend.clear();
+            }
+
+            int currentHeight = GetHeight();
+
+            // Respond to BIP35 mempool requests
+            if (fSendTrickle && pto->fSendMempool) {
+                auto vtxinfo = mempool.infoAll();
+                pto->fSendMempool = false;
+
+                LOCK(pto->cs_filter);
+
+                for (const auto& txinfo : vtxinfo) {
+                    const uint256& hash = txinfo.tx->GetHash();
+                    CInv inv = InvForTransaction(txinfo.tx);
+                    pto->setInventoryTxToSend.erase(hash);
+                    // ZIP 239: We won't have v5 transactions in our mempool until after
+                    // NU5 activates, at which point we will only be connected to peers
+                    // that understand MSG_WTX.
+                    if (inv.type == MSG_WTX) assert(pto->nVersion >= CINV_WTX_VERSION);
+                    if (IsExpiringSoonTx(*txinfo.tx, currentHeight + 1)) continue;
+                    if (pto->pfilter) {
+                        if (!pto->pfilter->IsRelevantAndUpdate(*txinfo.tx)) continue;
+                    }
+                    pto->filterInventoryKnown.insert(hash);
+                    vInv.push_back(inv);
+                    if (vInv.size() == MAX_INV_SZ) {
+                        pto->PushMessage("inv", vInv);
+                        vInv.clear();
+                    }
+                }
+                pto->timeLastMempoolReq = GetTime();
+            }
+
+            // Determine transactions to relay
+            if (fSendTrickle) {
+                // Produce a vector with all candidates for sending
+                vector<std::set<uint256>::iterator> vInvTx;
+                vInvTx.reserve(pto->setInventoryTxToSend.size());
+                for (std::set<uint256>::iterator it = pto->setInventoryTxToSend.begin(); it != pto->setInventoryTxToSend.end(); it++) {
+                    vInvTx.push_back(it);
+                }
+                // Sort the inventory we send for privacy and priority reasons.
+                // A heap is used so that not all items need sorting if only a few are being sent.
+                CompareInvMempoolOrder compareInvMempoolOrder(&mempool);
+                std::make_heap(vInvTx.begin(), vInvTx.end(), compareInvMempoolOrder);
+                // No reason to drain out at many times the network's capacity,
+                // especially since we have many peers and some will draw much shorter delays.
+                unsigned int nRelayedTransactions = 0;
+                LOCK(pto->cs_filter);
+                while (!vInvTx.empty() && nRelayedTransactions < INVENTORY_BROADCAST_MAX) {
+                    // Fetch the top element from the heap
+                    std::pop_heap(vInvTx.begin(), vInvTx.end(), compareInvMempoolOrder);
+                    std::set<uint256>::iterator it = vInvTx.back();
+                    vInvTx.pop_back();
+                    uint256 hash = *it;
+                    // Remove it from the to-be-sent set
+                    pto->setInventoryTxToSend.erase(it);
+                    // Check if not in the filter already
+                    if (pto->filterInventoryKnown.contains(hash)) {
+                        continue;
+                    }
+                    // Not in the mempool anymore? don't bother sending it.
+                    auto txinfo = mempool.info(hash);
+                    if (!txinfo.tx) {
+                        continue;
+                    }
+                    CInv inv = InvForTransaction(txinfo.tx);
+                    // ZIP 239: We won't have v5 transactions in our mempool until after
+                    // NU5 activates, at which point we will only be connected to peers
+                    // that understand MSG_WTX.
+                    if (inv.type == MSG_WTX) assert(pto->nVersion >= CINV_WTX_VERSION);
+                    if (IsExpiringSoonTx(*txinfo.tx, currentHeight + 1)) continue;
+                    if (pto->pfilter && !pto->pfilter->IsRelevantAndUpdate(*txinfo.tx)) continue;
+                    // Send
+                    vInv.push_back(inv);
+                    nRelayedTransactions++;
+                    {
+                        // Expire old relay messages
+                        while (!vRelayExpiration.empty() && vRelayExpiration.front().first < nNow)
+                        {
+                            mapRelay.erase(vRelayExpiration.front().second);
+                            vRelayExpiration.pop_front();
+                        }
+
+                        auto ret = mapRelay.insert(std::make_pair(hash, std::move(txinfo.tx)));
+                        if (ret.second) {
+                            vRelayExpiration.push_back(std::make_pair(nNow + 15 * 60 * 1000000, ret.first));
+                        }
+                    }
+                    if (vInv.size() == MAX_INV_SZ) {
+                        pto->PushMessage("inv", vInv);
+                        vInv.clear();
+                    }
+                    pto->filterInventoryKnown.insert(hash);
+                }
+            }
+        }
+        if (!vInv.empty())
+            pto->PushMessage("inv", vInv);
+
+        // Detect whether we're stalling
+        nNow = GetTimeMicros();
+        if (!pto->fDisconnect && state.nStallingSince && state.nStallingSince < nNow - 1000000 * BLOCK_STALLING_TIMEOUT) {
+            // Stalling only triggers when the block download window cannot move. During normal steady state,
+            // the download window should be much larger than the to-be-downloaded set of blocks, so disconnection
+            // should only happen during initial block download.
+            LogPrintf("Peer=%d is stalling block download, disconnecting\n", pto->id);
+            pto->fDisconnect = true;
+        }
+        // In case there is a block that has been in flight from this peer for (2 + 0.5 * N) times the block interval
+        // (with N the number of validated blocks that were in flight at the time it was requested), disconnect due to
+        // timeout. We compensate for in-flight blocks to prevent killing off peers due to our own downstream link
+        // being saturated. We only count validated in-flight blocks so peers can't advertise non-existing block hashes
+        // to unreasonably increase our timeout.
+        // We also compare the block download timeout originally calculated against the time at which we'd disconnect
+        // if we assumed the block were being requested now (ignoring blocks we've requested from this peer, since we're
+        // only looking at this peer's oldest request).  This way a large queue in the past doesn't result in a
+        // permanently large window for this block to be delivered (ie if the number of blocks in flight is decreasing
+        // more quickly than once every 5 minutes, then we'll shorten the download window for this block).
+        if (!pto->fDisconnect && state.vBlocksInFlight.size() > 0) {
+            QueuedBlock &queuedBlock = state.vBlocksInFlight.front();
+            int64_t nTimeoutIfRequestedNow = GetBlockTimeout(nNow, nQueuedValidatedHeaders - state.nBlocksInFlightValidHeaders, params, pindexBestHeader->nHeight);
+            if (queuedBlock.nTimeDisconnect > nTimeoutIfRequestedNow) {
+                LogPrint("net", "Reducing block download timeout for peer=%d block=%s, orig=%d new=%d\n", pto->id, queuedBlock.hash.ToString(), queuedBlock.nTimeDisconnect, nTimeoutIfRequestedNow);
+                queuedBlock.nTimeDisconnect = nTimeoutIfRequestedNow;
+            }
+            if (queuedBlock.nTimeDisconnect < nNow) {
+                LogPrintf("Timeout downloading block %s from peer=%d, disconnecting\n", queuedBlock.hash.ToString(), pto->id);
+                pto->fDisconnect = true;
+            }
+        }
+
+        //
+        // Message: getdata (blocks)
+        //
+        vector<CInv> vGetData;
+        if (!pto->fDisconnect && !pto->fClient && (fFetch || !IsInitialBlockDownload(params)) && state.nBlocksInFlight < MAX_BLOCKS_IN_TRANSIT_PER_PEER) {
+            vector<CBlockIndex*> vToDownload;
+            NodeId staller = -1;
+            FindNextBlocksToDownload(pto->GetId(), MAX_BLOCKS_IN_TRANSIT_PER_PEER - state.nBlocksInFlight, vToDownload, staller);
+            for (CBlockIndex *pindex : vToDownload) {
+                vGetData.push_back(CInv(MSG_BLOCK, pindex->GetBlockHash()));
+                MarkBlockAsInFlight(pto->GetId(), pindex->GetBlockHash(), params, pindex);
+                LogPrint("net", "Requesting block %s (%d) peer=%d\n", pindex->GetBlockHash().ToString(),
+                    pindex->nHeight, pto->id);
+            }
+            if (state.nBlocksInFlight == 0 && staller != -1) {
+                if (State(staller)->nStallingSince == 0) {
+                    State(staller)->nStallingSince = nNow;
+                    LogPrint("net", "Stall started peer=%d\n", staller);
+                }
+            }
+        }
+
+        //
+        // Message: getdata (non-blocks)
+        //
+        while (!pto->fDisconnect && !pto->mapAskFor.empty() && (*pto->mapAskFor.begin()).first <= nNow)
+        {
+            const CInv& inv = (*pto->mapAskFor.begin()).second;
+            if (!AlreadyHave(inv))
+            {
+                if (fDebug)
+                    LogPrint("net", "Requesting %s peer=%d\n", inv.ToString(), pto->id);
+                vGetData.push_back(inv);
+                if (vGetData.size() >= 1000)
+                {
+                    pto->PushMessage("getdata", vGetData);
+                    vGetData.clear();
+                }
+            } else {
+                //If we're not going to ask, don't expect a response.
+                pto->setAskFor.erase(WTxId(inv.hash, inv.hashAux));
+            }
+            pto->mapAskFor.erase(pto->mapAskFor.begin());
+        }
+        if (!vGetData.empty())
+            pto->PushMessage("getdata", vGetData);
+
+    }
+    return true;
+}
+
+ std::string CBlockFileInfo::ToString() const {
+     return strprintf("CBlockFileInfo(blocks=%u, size=%u, heights=%u...%u, time=%s...%s)", nBlocks, nSize, nHeightFirst, nHeightLast, DateTimeStrFormat("%Y-%m-%d", nTimeFirst), DateTimeStrFormat("%Y-%m-%d", nTimeLast));
+ }
+
+
+
+static class CMainCleanup
+{
+public:
+    CMainCleanup() {}
+    ~CMainCleanup() {
+        // block headers
+        BlockMap::iterator it1 = mapBlockIndex.begin();
+        for (; it1 != mapBlockIndex.end(); it1++)
+            delete (*it1).second;
+        mapBlockIndex.clear();
+
+        // orphan transactions
+        mapOrphanTransactions.clear();
+        mapOrphanTransactionsByPrev.clear();
+    }
+} instance_of_cmaincleanup;
+
+
+// Set default values of new CMutableTransaction based on consensus rules at given height.
+CMutableTransaction CreateNewContextualCMutableTransaction(
+    const Consensus::Params& consensusParams,
+    int nHeight,
+    bool requireSprout)
+{
+    CMutableTransaction mtx;
+
+    auto txVersionInfo = CurrentTxVersionInfo(consensusParams, nHeight, requireSprout);
+    mtx.fOverwintered   = txVersionInfo.fOverwintered;
+    mtx.nVersionGroupId = txVersionInfo.nVersionGroupId;
+    mtx.nVersion        = txVersionInfo.nVersion;
+
+    if (mtx.fOverwintered) {
+        if (mtx.nVersion >= ZIP225_TX_VERSION) {
+            mtx.nConsensusBranchId = CurrentEpochBranchId(nHeight, consensusParams);
+        }
+
+        bool blossomActive = consensusParams.NetworkUpgradeActive(nHeight, Consensus::UPGRADE_BLOSSOM);
+        unsigned int defaultExpiryDelta = blossomActive ? DEFAULT_POST_BLOSSOM_TX_EXPIRY_DELTA : DEFAULT_PRE_BLOSSOM_TX_EXPIRY_DELTA;
+        mtx.nExpiryHeight = nHeight + (expiryDeltaArg ? expiryDeltaArg.value() : defaultExpiryDelta);
+
+        // mtx.nExpiryHeight == 0 is valid for coinbase transactions
+        if (mtx.nExpiryHeight <= 0 || mtx.nExpiryHeight >= TX_EXPIRY_HEIGHT_THRESHOLD) {
+            throw new std::runtime_error("CreateNewContextualCMutableTransaction: invalid expiry height");
+        }
+
+        // NOTE: If the expiry height crosses into an incompatible consensus epoch, and it is changed to the last block
+        // of the current epoch, the transaction will be rejected if it falls within the expiring soon threshold of
+        // TX_EXPIRING_SOON_THRESHOLD (3) blocks (for DoS mitigation) based on the current height.
+        auto nextActivationHeight = NextActivationHeight(nHeight, consensusParams);
+        if (nextActivationHeight) {
+            mtx.nExpiryHeight = std::min(mtx.nExpiryHeight, static_cast<uint32_t>(nextActivationHeight.value()) - 1);
+        }
+    }
+    return mtx;
+}
diff --git a/depend/zcash/src/main.h b/depend/zcash/src/main.h
new file mode 100644
index 000000000..62e11a248
--- /dev/null
+++ b/depend/zcash/src/main.h
@@ -0,0 +1,640 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_MAIN_H
+#define BITCOIN_MAIN_H
+
+#if defined(HAVE_CONFIG_H)
+#include "config/bitcoin-config.h"
+#endif
+
+#include "amount.h"
+#include "chain.h"
+#include "chainparams.h"
+#include "coins.h"
+#include "consensus/upgrades.h"
+#include "fs.h"
+#include "net.h"
+#include "primitives/block.h"
+#include "primitives/transaction.h"
+#include "proof_verifier.h"
+#include "script/script.h"
+#include "script/sigcache.h"
+#include "script/standard.h"
+#include "sync.h"
+#include "tinyformat.h"
+#include "txdb.h"
+#include "txmempool.h"
+#include "uint256.h"
+#include "addressindex.h"
+#include "spentindex.h"
+#include "timestampindex.h"
+
+#include <algorithm>
+#include <exception>
+#include <map>
+#include <optional>
+#include <set>
+#include <stdint.h>
+#include <string>
+#include <utility>
+#include <vector>
+
+#include <rust/orchard.h>
+
+#include <boost/unordered_map.hpp>
+
+class CBlockIndex;
+class CBlockTreeDB;
+class CBloomFilter;
+class CChainParams;
+class CInv;
+class CScriptCheck;
+class CValidationInterface;
+class CValidationState;
+class PrecomputedTransactionData;
+
+struct CNodeStateStats;
+
+/** Default for accepting alerts from the P2P network. */
+static const bool DEFAULT_ALERTS = true;
+/** Maximum reorg length we will accept before we shut down and alert the user. */
+static const unsigned int MAX_REORG_LENGTH = COINBASE_MATURITY - 1;
+/** Default for DEFAULT_WHITELISTRELAY. */
+static const bool DEFAULT_WHITELISTRELAY = true;
+/** Default for DEFAULT_WHITELISTFORCERELAY. */
+static const bool DEFAULT_WHITELISTFORCERELAY = true;
+/** Default for -minrelaytxfee, minimum relay fee for transactions in zatoshis/kB */
+static const unsigned int DEFAULT_MIN_RELAY_TX_FEE = 100;
+//! -maxtxfee default
+static const CAmount DEFAULT_TRANSACTION_MAXFEE = 0.1 * COIN;
+//! Discourage users to set fees higher than this amount (in satoshis) per kB
+static const CAmount HIGH_TX_FEE_PER_KB = 0.01 * COIN;
+//! -maxtxfee will warn if called with a higher fee than this amount (in satoshis)
+static const CAmount HIGH_MAX_TX_FEE = 100 * HIGH_TX_FEE_PER_KB;
+/** Default for -maxorphantx, maximum number of orphan transactions kept in memory */
+static const unsigned int DEFAULT_MAX_ORPHAN_TRANSACTIONS = 100;
+/** Default for -txexpirydelta, in number of blocks */
+static const unsigned int DEFAULT_PRE_BLOSSOM_TX_EXPIRY_DELTA = 20;
+static const unsigned int DEFAULT_POST_BLOSSOM_TX_EXPIRY_DELTA = DEFAULT_PRE_BLOSSOM_TX_EXPIRY_DELTA * Consensus::BLOSSOM_POW_TARGET_SPACING_RATIO;
+/** The number of blocks within expiry height when a tx is considered to be expiring soon */
+static constexpr uint32_t TX_EXPIRING_SOON_THRESHOLD = 3;
+/** The maximum size of a blk?????.dat file (since 0.8) */
+static const unsigned int MAX_BLOCKFILE_SIZE = 0x8000000; // 128 MiB
+/** The pre-allocation chunk size for blk?????.dat files (since 0.8) */
+static const unsigned int BLOCKFILE_CHUNK_SIZE = 0x1000000; // 16 MiB
+/** The pre-allocation chunk size for rev?????.dat files (since 0.8) */
+static const unsigned int UNDOFILE_CHUNK_SIZE = 0x100000; // 1 MiB
+
+/** Maximum number of script-checking threads allowed */
+static const int MAX_SCRIPTCHECK_THREADS = 16;
+/** -par default (number of script-checking threads, 0 = auto) */
+static const int DEFAULT_SCRIPTCHECK_THREADS = 0;
+/** Number of blocks that can be requested at any given time from a single peer. */
+static const int MAX_BLOCKS_IN_TRANSIT_PER_PEER = 16;
+/** Timeout in seconds during which a peer must stall block download progress before being disconnected. */
+static const unsigned int BLOCK_STALLING_TIMEOUT = 2;
+/** Number of headers sent in one getheaders result. We rely on the assumption that if a peer sends
+ *  less than this number, we reached its tip. Changing this value is a protocol upgrade. */
+static const unsigned int MAX_HEADERS_RESULTS = 160;
+/** Size of the "block download window": how far ahead of our current height do we fetch?
+ *  Larger windows tolerate larger download speed differences between peer, but increase the potential
+ *  degree of disordering of blocks on disk (which make reindexing and in the future perhaps pruning
+ *  harder). We'll probably want to make this a per-peer adaptive value at some point. */
+static const unsigned int BLOCK_DOWNLOAD_WINDOW = 1024;
+/** Time to wait (in seconds) between writing blocks/block index to disk. */
+static const unsigned int DATABASE_WRITE_INTERVAL = 60 * 60;
+/** Time to wait (in seconds) between flushing chainstate to disk. */
+static const unsigned int DATABASE_FLUSH_INTERVAL = 24 * 60 * 60;
+/** Time to wait (in seconds) between writing wallet witness data to disk. */
+static const unsigned int WITNESS_WRITE_INTERVAL = 10 * 60;
+/** Number of updates between writing wallet witness data to disk. */
+static const unsigned int WITNESS_WRITE_UPDATES = 10000;
+/** Maximum length of reject messages. */
+static const unsigned int MAX_REJECT_MESSAGE_LENGTH = 111;
+/** Average delay between local address broadcasts in seconds. */
+static const unsigned int AVG_LOCAL_ADDRESS_BROADCAST_INTERVAL = 24 * 24 * 60;
+/** Average delay between peer address broadcasts in seconds. */
+static const unsigned int AVG_ADDRESS_BROADCAST_INTERVAL = 30;
+/** Average delay between trickled inventory transmissions in seconds.
+ *  Blocks and whitelisted receivers bypass this, outbound peers get half this delay. */
+static const unsigned int INVENTORY_BROADCAST_INTERVAL = 5;
+/** Maximum number of inventory items to send per transmission.
+ *  Limits the impact of low-fee transaction floods. */
+static const unsigned int INVENTORY_BROADCAST_MAX = 7 * INVENTORY_BROADCAST_INTERVAL;
+
+static const unsigned int DEFAULT_LIMITFREERELAY = 15;
+static const bool DEFAULT_RELAYPRIORITY = false;
+static const int64_t DEFAULT_MAX_TIP_AGE = 24 * 60 * 60;
+
+/** Default for -permitbaremultisig */
+static const bool DEFAULT_PERMIT_BAREMULTISIG = true;
+static const bool DEFAULT_CHECKPOINTS_ENABLED = true;
+static const bool DEFAULT_IBD_SKIP_TX_VERIFICATION = false;
+static const bool DEFAULT_TXINDEX = false;
+static const unsigned int DEFAULT_BANSCORE_THRESHOLD = 100;
+
+/** Default for -nurejectoldversions */
+static const bool DEFAULT_NU_REJECT_OLD_VERSIONS = true;
+
+#define equihash_parameters_acceptable(N, K) \
+    ((CBlockHeader::HEADER_SIZE + equihash_solution_size(N, K))*MAX_HEADERS_RESULTS < \
+     MAX_PROTOCOL_MESSAGE_LENGTH-1000)
+
+static const bool DEFAULT_PEERBLOOMFILTERS = true;
+static const bool DEFAULT_ENFORCENODEBLOOM = false;
+
+struct BlockHasher
+{
+    size_t operator()(const uint256& hash) const { return hash.GetCheapHash(); }
+};
+
+extern std::optional<unsigned int> expiryDeltaArg;
+extern CScript COINBASE_FLAGS;
+extern CCriticalSection cs_main;
+extern CTxMemPool mempool;
+typedef boost::unordered_map<uint256, CBlockIndex*, BlockHasher> BlockMap;
+extern BlockMap mapBlockIndex;
+extern std::optional<uint64_t> last_block_num_txs;
+extern std::optional<uint64_t> last_block_size;
+extern const std::string strMessageMagic;
+
+//! These four variables are used to notify getblocktemplate RPC of new tips.
+//! When UpdateTip() establishes a new tip (best block), it must awaken a
+//! waiting getblocktemplate RPC (if there is one) immediately. But upon waking
+//! up, getblocktemplate cannot call chainActive->Tip() because it does not
+//! (and cannot) hold cs_main. So the g_best_block_height and g_best_block variables
+//! (protected by g_best_block_mutex) provide the needed height and block
+//! hash respectively to getblocktemplate without it requiring cs_main.
+extern CWaitableCriticalSection g_best_block_mutex;
+extern CConditionVariable g_best_block_cv;
+extern int g_best_block_height;
+extern uint256 g_best_block;
+
+extern std::atomic_bool fImporting;
+extern std::atomic_bool fReindex;
+extern int nScriptCheckThreads;
+extern bool fTxIndex;
+
+// The following flags enable specific indices (DB tables), but are not exposed as
+// separate command-line options; instead they are enabled by experimental feature "-insightexplorer"
+
+// Maintain a full address index, used to query for the balance, txids and unspent outputs for addresses
+extern bool fAddressIndex;
+
+// Maintain a full spent index, used to query the spending txid and input index for an outpoint
+extern bool fSpentIndex;
+
+// Maintain a full timestamp index, used to query for blocks within a time range
+extern bool fTimestampIndex;
+
+// END insightexplorer
+
+extern bool fIsBareMultisigStd;
+extern bool fCheckBlockIndex;
+extern bool fCheckpointsEnabled;
+extern bool fIBDSkipTxVerification;
+// TODO: remove this flag by structuring our code such that
+// it is unneeded for testing
+extern bool fCoinbaseEnforcedShieldingEnabled;
+extern size_t nCoinCacheUsage;
+/** A fee rate smaller than this is considered zero fee (for relaying, mining and transaction creation) */
+extern CFeeRate minRelayTxFee;
+/** Absolute maximum transaction fee (in satoshis) used by wallet and mempool (rejects high fee in sendrawtransaction) */
+extern CAmount maxTxFee;
+extern bool fAlerts;
+/** If the tip is older than this (in seconds), the node is considered to be in initial block download. */
+extern int64_t nMaxTipAge;
+
+/** Best header we've seen so far (used for getheaders queries' starting points). */
+extern CBlockIndex *pindexBestHeader;
+
+/** Minimum disk space required - used in CheckDiskSpace() */
+static const uint64_t nMinDiskSpace = 52428800;
+
+/** Pruning-related variables and constants */
+/** True if any block files have ever been pruned. */
+extern bool fHavePruned;
+/** True if we're running in -prune mode. */
+extern bool fPruneMode;
+/** Number of MiB of block files that we're trying to stay below. */
+extern uint64_t nPruneTarget;
+/** Block files containing a block-height within MIN_BLOCKS_TO_KEEP of chainActive.Tip() will not be pruned. */
+static const unsigned int MIN_BLOCKS_TO_KEEP = 288;
+
+static const signed int DEFAULT_CHECKBLOCKS = MIN_BLOCKS_TO_KEEP;
+static const unsigned int DEFAULT_CHECKLEVEL = 3;
+
+// Require that user allocate at least 550MB for block & undo files (blk???.dat and rev???.dat)
+// At 1MB per block, 288 blocks = 288MB.
+// Add 15% for Undo data = 331MB
+// Add 20% for Orphan block rate = 397MB
+// We want the low water mark after pruning to be at least 397 MB and since we prune in
+// full block file chunks, we need the high water mark which triggers the prune to be
+// one 128MB block file + added 15% undo data = 147MB greater for a total of 545MB
+// Setting the target to > than 550MB will make it likely we can respect the target.
+static const uint64_t MIN_DISK_SPACE_FOR_BLOCK_FILES = 550 * 1024 * 1024;
+
+/** Register with a network node to receive its signals */
+void RegisterNodeSignals(CNodeSignals& nodeSignals);
+/** Unregister a network node */
+void UnregisterNodeSignals(CNodeSignals& nodeSignals);
+
+/**
+ * Process an incoming block. This only returns after the best known valid
+ * block is made active. Note that it does not, however, guarantee that the
+ * specific block passed to it has been checked for validity!
+ *
+ * @param[out]  state   This may be set to an Error state if any error occurred processing it, including during validation/connection/etc of otherwise unrelated blocks during reorganisation; or it may be set to an Invalid state if pblock is itself invalid (but this is not guaranteed even when the block is checked). If you want to *possibly* get feedback on whether pblock is valid, you must also install a CValidationInterface (see validationinterface.h) - this will have its BlockChecked method called whenever *any* block completes validation.
+ * @param[in]   pfrom   The node which we are receiving the block from; it is added to mapBlockSource and may be penalised if the block is invalid.
+ * @param[in]   pblock  The block we want to process.
+ * @param[in]   fForceProcessing Process this block even if unrequested; used for non-network block sources and whitelisted peers.
+ * @param[out]  dbp     The already known disk position of pblock, or NULL if not yet stored.
+ * @return True if state.IsValid()
+ */
+bool ProcessNewBlock(CValidationState& state, const CChainParams& chainparams, const CNode* pfrom, const CBlock* pblock, bool fForceProcessing, const CDiskBlockPos* dbp);
+/** Check whether enough disk space is available for an incoming block */
+bool CheckDiskSpace(uint64_t nAdditionalBytes = 0);
+/** Open a block file (blk?????.dat) */
+FILE* OpenBlockFile(const CDiskBlockPos &pos, bool fReadOnly = false);
+/** Open an undo file (rev?????.dat) */
+FILE* OpenUndoFile(const CDiskBlockPos &pos, bool fReadOnly = false);
+/** Translation to a filesystem path */
+fs::path GetBlockPosFilename(const CDiskBlockPos &pos, const char *prefix);
+/** Import blocks from an external file */
+bool LoadExternalBlockFile(const CChainParams& chainparams, FILE* fileIn, CDiskBlockPos *dbp = NULL);
+/** Initialize a new block tree database + block data on disk */
+bool InitBlockIndex(const CChainParams& chainparams);
+/** Load the block tree and coins database from disk */
+bool LoadBlockIndex();
+/** Unload database information */
+void UnloadBlockIndex();
+/** Process protocol messages received from a given node */
+bool ProcessMessages(const CChainParams& chainparams, CNode* pfrom);
+/**
+ * Send queued protocol messages to be sent to a give node.
+ *
+ * @param[in]   params          Active chain parameters.
+ * @param[in]   pto             The node which we are sending messages to.
+ */
+bool SendMessages(const Consensus::Params& params, CNode* pto);
+/** Run an instance of the script checking thread */
+void ThreadScriptCheck();
+/** Check whether we are doing an initial block download (synchronizing from disk or network) */
+bool IsInitialBlockDownload(const Consensus::Params& params);
+/** testing-only, set or reset initial block down (IBD) state, return previous */
+bool TestSetIBD(bool);
+/** Format a string that describes several potential problems detected by the core */
+std::pair<std::string, int64_t> GetWarnings(const std::string& strFor);
+/** Retrieve a transaction (from memory pool, or from disk, if possible) */
+bool GetTransaction(const uint256& hash, CTransaction& tx, const Consensus::Params& params, uint256& hashBlock, bool fAllowSlow = false, CBlockIndex* blockIndex = nullptr);
+/** Find the best known block, and make it the tip of the block chain */
+bool ActivateBestChain(CValidationState& state, const CChainParams& chainparams, const CBlock* pblock = NULL);
+CAmount GetBlockSubsidy(int nHeight, const Consensus::Params& consensusParams);
+
+/**
+ * Prune block and undo files (blk???.dat and undo???.dat) so that the disk space used is less than a user-defined target.
+ * The user sets the target (in MB) on the command line or in config file.  This will be run on startup and whenever new
+ * space is allocated in a block or undo file, staying below the target. Changing back to unpruned requires a reindex
+ * (which in this case means the blockchain must be re-downloaded.)
+ *
+ * Pruning functions are called from FlushStateToDisk when the global fCheckForPruning flag has been set.
+ * Block and undo files are deleted in lock-step (when blk00003.dat is deleted, so is rev00003.dat.)
+ * Pruning cannot take place until the longest chain is at least a certain length (100000 on mainnet, 1000 on testnet, 10 on regtest).
+ * Pruning will never delete a block within a defined distance (currently 288) from the active chain's tip.
+ * The block index is updated by unsetting HAVE_DATA and HAVE_UNDO for any blocks that were stored in the deleted files.
+ * A db flag records the fact that at least some block files have been pruned.
+ *
+ * @param[out]   setFilesToPrune   The set of file indices that can be unlinked will be returned
+ */
+void FindFilesToPrune(std::set<int>& setFilesToPrune, uint64_t nPruneAfterHeight);
+
+/**
+ *  Actually unlink the specified files
+ */
+void UnlinkPrunedFiles(std::set<int>& setFilesToPrune);
+
+/** Create a new block index entry for a given block hash */
+CBlockIndex * InsertBlockIndex(uint256 hash);
+/** Get statistics from node state */
+bool GetNodeStateStats(NodeId nodeid, CNodeStateStats &stats);
+/** Increase a node's misbehavior score. */
+void Misbehaving(NodeId nodeid, int howmuch);
+/** Flush all state, indexes and buffers to disk. */
+void FlushStateToDisk();
+/** Prune block files and flush state to disk. */
+void PruneAndFlush();
+
+/** (try to) add transaction to memory pool **/
+bool AcceptToMemoryPool(
+        const CChainParams& chainparams,
+        CTxMemPool& pool, CValidationState &state, const CTransaction &tx, bool fLimitFree,
+        bool* pfMissingInputs, bool fRejectAbsurdFee=false);
+
+
+struct CNodeStateStats {
+    int nMisbehavior;
+    int nSyncHeight;
+    int nCommonHeight;
+    std::vector<int> vHeightInFlight;
+};
+
+
+
+CAmount GetMinRelayFee(const CTransaction& tx, unsigned int nBytes, bool fAllowFree);
+
+/**
+ * Count ECDSA signature operations the old-fashioned (pre-0.6) way
+ * @return number of sigops this transaction's outputs will produce when spent
+ * @see CTransaction::FetchInputs
+ */
+unsigned int GetLegacySigOpCount(const CTransaction& tx);
+
+/**
+ * Count ECDSA signature operations in pay-to-script-hash inputs.
+ *
+ * @param[in] mapInputs Map of previous transactions that have outputs we're spending
+ * @return maximum number of sigops required to validate this transaction's inputs
+ * @see CTransaction::FetchInputs
+ */
+unsigned int GetP2SHSigOpCount(const CTransaction& tx, const CCoinsViewCache& mapInputs);
+
+
+/**
+ * Check whether all inputs of this transaction are valid (no double spends, scripts & sigs, amounts)
+ * This does not modify the UTXO set. If pvChecks is not NULL, script checks are pushed onto it
+ * instead of being performed inline.
+ */
+bool ContextualCheckInputs(const CTransaction& tx, CValidationState &state, const CCoinsViewCache &view, bool fScriptChecks,
+                           unsigned int flags, bool cacheStore, PrecomputedTransactionData& txdata,
+                           const Consensus::Params& consensusParams, uint32_t consensusBranchId,
+                           std::vector<CScriptCheck> *pvChecks = NULL);
+
+/**
+ * Check whether all shielded inputs of this transaction are valid.
+ *
+ * This checks that:
+ * - The anchors in the transaction exist in the given view.
+ * - The nullifiers in the transaction do not exist in the given view.
+ * - The signatures for the transaction's shielded components are valid.
+ *
+ * This also currently checks the Sapling proofs, due to the way the Rust verification
+ * code is written. Sprout and Orchard proofs are currently checked in CheckTransaction().
+ * Once we have batch proof validation implemented, these will all be accumulated in
+ * CheckTransaction().
+ *
+ * To skip checking signatures, use `Consensus::CheckTxShieldedInputs` instead.
+ *
+ * This does not modify the view to add the nullifiers to the spent set.
+ *
+ * The `isInitBlockDownload` argument is a function parameter to assist with testing.
+ */
+bool ContextualCheckShieldedInputs(
+        const CTransaction& tx,
+        const PrecomputedTransactionData& txdata,
+        CValidationState &state,
+        const CCoinsViewCache &view,
+        orchard::AuthValidator& orchardAuth,
+        const Consensus::Params& consensus,
+        uint32_t consensusBranchId,
+        bool nu5Active,
+        bool isMined,
+        bool (*isInitBlockDownload)(const Consensus::Params&) = IsInitialBlockDownload);
+
+/** Check a transaction contextually against a set of consensus rules */
+bool ContextualCheckTransaction(const CTransaction& tx, CValidationState &state,
+                                const CChainParams& chainparams, int nHeight, bool isMined,
+                                bool (*isInitBlockDownload)(const Consensus::Params&) = IsInitialBlockDownload);
+
+/** Apply the effects of this transaction on the UTXO set represented by view */
+void UpdateCoins(const CTransaction& tx, CCoinsViewCache& inputs, int nHeight);
+
+/** Transaction validation functions */
+
+/** Context-independent validity checks */
+bool CheckTransaction(const CTransaction& tx, CValidationState& state,
+                      ProofVerifier& verifier);
+bool CheckTransactionWithoutProofVerification(const CTransaction& tx, CValidationState &state);
+
+namespace Consensus {
+
+/**
+ * Check whether all shielded inputs of this transaction are valid.
+ *
+ * This checks that:
+ * - The anchors in the transaction exist in the given view.
+ * - The nullifiers in the transaction do not exist in the given view.
+ *
+ * This does not modify the view to add the nullifiers to the spent set.
+ * This does not check proofs or signatures.
+ */
+bool CheckTxShieldedInputs(
+    const CTransaction& tx,
+    CValidationState& state,
+    const CCoinsViewCache& view,
+    int dosLevel);
+
+/**
+ * Check whether all inputs of this transaction are valid (no double spends and amounts)
+ * This does not modify the UTXO set. This does not check scripts and sigs.
+ * Preconditions: tx.IsCoinBase() is false.
+ */
+bool CheckTxInputs(const CTransaction& tx, CValidationState& state, const CCoinsViewCache& inputs, int nSpendHeight, const Consensus::Params& consensusParams);
+
+} // namespace Consensus
+
+/**
+ * Check if transaction is final and can be included in a block with the
+ * specified height and time. Consensus critical.
+ */
+bool IsFinalTx(const CTransaction &tx, int nBlockHeight, int64_t nBlockTime);
+
+/**
+ * Check if transaction is expired and can be included in a block with the
+ * specified height. Consensus critical.
+ */
+bool IsExpiredTx(const CTransaction &tx, int nBlockHeight);
+
+/**
+ * Check if transaction is expiring soon.  If yes, not propagating the transaction
+ * can help DoS mitigation.  This is not consensus critical.
+ */
+bool IsExpiringSoonTx(const CTransaction &tx, int nNextBlockHeight);
+
+/**
+ * Check if transaction will be final in the next block to be created.
+ *
+ * Calls IsFinalTx() with current block height and appropriate block time.
+ *
+ * See consensus/consensus.h for flag definitions.
+ */
+bool CheckFinalTx(const CTransaction &tx, int flags = -1);
+
+/**
+ * Closure representing one script verification
+ * Note that this stores references to the spending transaction
+ */
+class CScriptCheck
+{
+private:
+    CScript scriptPubKey;
+    CAmount amount;
+    const CTransaction *ptxTo;
+    unsigned int nIn;
+    unsigned int nFlags;
+    bool cacheStore;
+    uint32_t consensusBranchId;
+    ScriptError error;
+    // We store a pointer instead of a reference here, to allow it to be null for
+    // performance reasons (enabling fast swaps in CCheckQueue::Loop).
+    PrecomputedTransactionData *txdata;
+
+public:
+    CScriptCheck(): amount(0), ptxTo(0), nIn(0), nFlags(0), cacheStore(false), consensusBranchId(0), error(SCRIPT_ERR_UNKNOWN_ERROR) {}
+    CScriptCheck(const CCoins& txFromIn, const CTransaction& txToIn, unsigned int nInIn, unsigned int nFlagsIn, bool cacheIn, uint32_t consensusBranchIdIn, PrecomputedTransactionData* txdataIn) :
+        scriptPubKey(txFromIn.vout[txToIn.vin[nInIn].prevout.n].scriptPubKey), amount(txFromIn.vout[txToIn.vin[nInIn].prevout.n].nValue),
+        ptxTo(&txToIn), nIn(nInIn), nFlags(nFlagsIn), cacheStore(cacheIn), consensusBranchId(consensusBranchIdIn), error(SCRIPT_ERR_UNKNOWN_ERROR), txdata(txdataIn) { }
+
+    bool operator()();
+
+    void swap(CScriptCheck &check) {
+        scriptPubKey.swap(check.scriptPubKey);
+        std::swap(ptxTo, check.ptxTo);
+        std::swap(amount, check.amount);
+        std::swap(nIn, check.nIn);
+        std::swap(nFlags, check.nFlags);
+        std::swap(cacheStore, check.cacheStore);
+        std::swap(consensusBranchId, check.consensusBranchId);
+        std::swap(error, check.error);
+        std::swap(txdata, check.txdata);
+    }
+
+    ScriptError GetScriptError() const { return error; }
+};
+
+bool GetSpentIndex(CSpentIndexKey &key, CSpentIndexValue &value);
+bool GetAddressIndex(const uint160& addressHash, int type,
+        std::vector<CAddressIndexDbEntry> &addressIndex,
+        int start = 0, int end = 0);
+bool GetAddressUnspent(const uint160& addressHash, int type,
+        std::vector<CAddressUnspentDbEntry>& unspentOutputs);
+bool GetTimestampIndex(unsigned int high, unsigned int low, bool fActiveOnly,
+    std::vector<std::pair<uint256, unsigned int> > &hashes);
+
+/** Functions for disk access for blocks */
+bool WriteBlockToDisk(const CBlock& block, CDiskBlockPos& pos, const CMessageHeader::MessageStartChars& messageStart);
+bool ReadBlockFromDisk(CBlock& block, const CDiskBlockPos& pos, const Consensus::Params& consensusParams);
+bool ReadBlockFromDisk(CBlock& block, const CBlockIndex* pindex, const Consensus::Params& consensusParams);
+
+/** Functions for validating blocks and updating the block tree */
+
+/** Context-independent validity checks */
+
+bool CheckBlockHeader(const CBlockHeader& block, CValidationState& state,
+    const CChainParams& chainparams,
+    bool fCheckPOW = true);
+
+bool CheckBlock(const CBlock& block, CValidationState& state,
+                const CChainParams& chainparams,
+                ProofVerifier& verifier,
+                bool fCheckPOW,
+                bool fCheckMerkleRoot,
+                bool fCheckTransactions);
+
+/** Context-dependent validity checks.
+ *  By "context", we mean only the previous block headers, but not the UTXO
+ *  set; UTXO-related validity checks are done in ConnectBlock(). */
+bool ContextualCheckBlockHeader(const CBlockHeader& block, CValidationState& state,
+                                const CChainParams& chainparams, CBlockIndex *pindexPrev);
+bool ContextualCheckBlock(const CBlock& block, CValidationState& state,
+                          const CChainParams& chainparams,
+                          CBlockIndex *pindexPrev,
+                          bool fCheckTransactions);
+
+/** Apply the effects of this block (with given index) on the UTXO set represented by coins.
+ *  Validity checks that depend on the UTXO set are also done; ConnectBlock()
+ *  can fail if those validity checks fail (among other reasons). */
+bool ConnectBlock(const CBlock& block, CValidationState& state, CBlockIndex* pindex, CCoinsViewCache& coins,
+                  const CChainParams& chainparams,
+                  bool fJustCheck = false, bool fCheckAuthDataRoot = true);
+
+/**
+ * Check a block is completely valid from start to finish (only works on top
+ * of our current best block, with cs_main held)
+ */
+bool TestBlockValidity(CValidationState& state, const CChainParams& chainparams, const CBlock& block, CBlockIndex* pindexPrev, bool fCheckMerkleRoot);
+
+
+/**
+ * When there are blocks in the active chain with missing data (e.g. if the
+ * activation height and branch ID of a particular upgrade have been altered),
+ * rewind the chainstate and remove them from the block index.
+ *
+ * clearWitnessCaches is an output parameter that will be set to true iff
+ * witness caches should be cleared in order to handle an intended long rewind.
+ */
+bool RewindBlockIndex(const CChainParams& chainparams, bool& clearWitnessCaches);
+
+/** RAII wrapper for VerifyDB: Verify consistency of the block and coin databases */
+class CVerifyDB {
+public:
+    CVerifyDB();
+    ~CVerifyDB();
+    bool VerifyDB(const CChainParams& chainparams, CCoinsView *coinsview, int nCheckLevel, int nCheckDepth);
+};
+
+/** Find the last common block between the parameter chain and a locator. */
+CBlockIndex* FindForkInGlobalIndex(const CChain& chain, const CBlockLocator& locator);
+
+/** Mark a block as invalid. */
+bool InvalidateBlock(CValidationState& state, const CChainParams& chainparams, CBlockIndex *pindex);
+
+/** Remove invalidity status from a block and its descendants. */
+bool ReconsiderBlock(CValidationState& state, CBlockIndex *pindex);
+
+/** The currently-connected chain of blocks (protected by cs_main). */
+extern CChain chainActive;
+
+/** Global variable that points to the active CCoinsView (protected by cs_main) */
+extern CCoinsViewCache *pcoinsTip;
+
+/** Global variable that points to the active block tree (protected by cs_main) */
+extern CBlockTreeDB *pblocktree;
+
+/**
+ * Return the spend height, which is one more than the inputs.GetBestBlock().
+ * While checking, GetBestBlock() refers to the parent block. (protected by cs_main)
+ * This is also true for mempool checks.
+ */
+int GetSpendHeight(const CCoinsViewCache& inputs);
+
+/** Reject codes greater or equal to this can be returned by AcceptToMemPool
+ * for transactions, to signal internal conditions. They cannot and should not
+ * be sent over the P2P network.
+ */
+static const unsigned int REJECT_INTERNAL = 0x100;
+/** Too high fee. Can not be triggered by P2P transactions */
+static const unsigned int REJECT_HIGHFEE = 0x100;
+/** Transaction is already known (either in mempool or blockchain) */
+static const unsigned int REJECT_ALREADY_KNOWN = 0x101;
+/** Transaction conflicts with a transaction already known */
+static const unsigned int REJECT_CONFLICT = 0x102;
+
+uint64_t CalculateCurrentUsage();
+
+/**
+ * Return a CMutableTransaction with contextual default values based on set of consensus rules at nHeight. The expiryDelta will
+ * either be based on the command-line argument '-txexpirydelta' or derived from consensusParams.
+ */
+CMutableTransaction CreateNewContextualCMutableTransaction(
+    const Consensus::Params& consensusParams,
+    int nHeight,
+    bool requireSprout = false);
+
+std::pair<std::map<CBlockIndex*, std::list<CTransaction>>, uint64_t> DrainRecentlyConflicted();
+void SetChainNotifiedSequence(const CChainParams& chainparams, uint64_t recentlyConflictedSequence);
+bool ChainIsFullyNotified(const CChainParams& chainparams);
+
+#endif // BITCOIN_MAIN_H
diff --git a/depend/zcash/src/mempool_limit.cpp b/depend/zcash/src/mempool_limit.cpp
new file mode 100644
index 000000000..d4c1a0455
--- /dev/null
+++ b/depend/zcash/src/mempool_limit.cpp
@@ -0,0 +1,159 @@
+// Copyright (c) 2019 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "mempool_limit.h"
+
+#include "core_memusage.h"
+#include "logging.h"
+#include "random.h"
+#include "serialize.h"
+#include "timedata.h"
+#include "utiltime.h"
+#include "version.h"
+
+const TxWeight ZERO_WEIGHT = TxWeight(0, 0);
+
+void RecentlyEvictedList::pruneList()
+{
+    if (txIdSet.empty()) {
+        return;
+    }
+    int64_t now = GetTime();
+    while (txIdsAndTimes.size() > 0 && now - txIdsAndTimes.front().second > timeToKeep) {
+        txIdSet.erase(txIdsAndTimes.front().first);
+        txIdsAndTimes.pop_front();
+    }
+}
+
+void RecentlyEvictedList::add(const uint256& txId)
+{
+    pruneList();
+    if (txIdsAndTimes.size() == capacity) {
+        txIdSet.erase(txIdsAndTimes.front().first);
+        txIdsAndTimes.pop_front();
+    }
+    txIdsAndTimes.push_back(std::make_pair(txId, GetTime()));
+    txIdSet.insert(txId);
+}
+
+bool RecentlyEvictedList::contains(const uint256& txId)
+{
+    pruneList();
+    return txIdSet.count(txId) > 0;
+}
+
+
+TxWeight WeightedTxTree::getWeightAt(size_t index) const
+{
+    return index < size ? txIdAndWeights[index].txWeight.add(childWeights[index]) : ZERO_WEIGHT;
+}
+
+void WeightedTxTree::backPropagate(size_t fromIndex, const TxWeight& weightDelta)
+{
+    while (fromIndex > 0) {
+        fromIndex = (fromIndex - 1) / 2;
+        childWeights[fromIndex] = childWeights[fromIndex].add(weightDelta);
+    }
+}
+
+size_t WeightedTxTree::findByEvictionWeight(size_t fromIndex, int64_t weightToFind) const
+{
+    int leftWeight = getWeightAt(fromIndex * 2 + 1).evictionWeight;
+    int rightWeight = getWeightAt(fromIndex).evictionWeight - getWeightAt(fromIndex * 2 + 2).evictionWeight;
+    // On Left
+    if (weightToFind < leftWeight) {
+        return findByEvictionWeight(fromIndex * 2 + 1, weightToFind);
+    }
+    // Found
+    if (weightToFind < rightWeight) {
+        return fromIndex;
+    }
+    // On Right
+    return findByEvictionWeight(fromIndex * 2 + 2, weightToFind - rightWeight);
+}
+
+TxWeight WeightedTxTree::getTotalWeight() const
+{
+    return getWeightAt(0);
+}
+
+
+void WeightedTxTree::add(const WeightedTxInfo& weightedTxInfo)
+{
+    if (txIdToIndexMap.count(weightedTxInfo.txId) > 0) {
+        // This should not happen, but should be prevented nonetheless
+        return;
+    }
+    txIdAndWeights.push_back(weightedTxInfo);
+    childWeights.push_back(ZERO_WEIGHT);
+    txIdToIndexMap[weightedTxInfo.txId] = size;
+    backPropagate(size, weightedTxInfo.txWeight);
+    size += 1;
+}
+
+void WeightedTxTree::remove(const uint256& txId)
+{
+    if (txIdToIndexMap.find(txId) == txIdToIndexMap.end()) {
+        // Remove may be called multiple times for a given tx, so this is necessary
+        return;
+    }
+
+    size_t removeIndex = txIdToIndexMap[txId];
+
+    // We reduce the size at the start of this method to avoid saying size - 1
+    // when referring to the last element of the array below
+    size -= 1;
+
+    TxWeight lastChildWeight = txIdAndWeights[size].txWeight;
+    backPropagate(size, lastChildWeight.negate());
+
+    if (removeIndex < size) {
+        TxWeight weightDelta = lastChildWeight.add(txIdAndWeights[removeIndex].txWeight.negate());
+        txIdAndWeights[removeIndex] = txIdAndWeights[size];
+        txIdToIndexMap[txIdAndWeights[removeIndex].txId] = removeIndex;
+        backPropagate(removeIndex, weightDelta);
+    }
+
+    txIdToIndexMap.erase(txId);
+    txIdAndWeights.pop_back();
+    childWeights.pop_back();
+}
+
+std::optional<uint256> WeightedTxTree::maybeDropRandom()
+{
+    TxWeight totalTxWeight = getTotalWeight();
+    if (totalTxWeight.cost <= capacity) {
+        return std::nullopt;
+    }
+    LogPrint("mempool", "Mempool cost limit exceeded (cost=%d, limit=%d)\n", totalTxWeight.cost, capacity);
+    int randomWeight = GetRand(totalTxWeight.evictionWeight);
+    WeightedTxInfo drop = txIdAndWeights[findByEvictionWeight(0, randomWeight)];
+    LogPrint("mempool", "Evicting transaction (txid=%s, cost=%d, evictionWeight=%d)\n",
+        drop.txId.ToString(), drop.txWeight.cost, drop.txWeight.evictionWeight);
+    remove(drop.txId);
+    return drop.txId;
+}
+
+
+TxWeight TxWeight::add(const TxWeight& other) const
+{
+    return TxWeight(cost + other.cost, evictionWeight + other.evictionWeight);
+}
+
+TxWeight TxWeight::negate() const
+{
+    return TxWeight(-cost, -evictionWeight);
+}
+
+
+WeightedTxInfo WeightedTxInfo::from(const CTransaction& tx, const CAmount& fee)
+{
+    size_t memUsage = RecursiveDynamicUsage(tx);
+    int64_t cost = std::max((int64_t) memUsage, (int64_t) MIN_TX_COST);
+    int64_t evictionWeight = cost;
+    if (fee < DEFAULT_FEE) {
+        evictionWeight += LOW_FEE_PENALTY;
+    }
+    return WeightedTxInfo(tx.GetHash(), TxWeight(cost, evictionWeight));
+}
diff --git a/depend/zcash/src/mempool_limit.h b/depend/zcash/src/mempool_limit.h
new file mode 100644
index 000000000..61e22bc57
--- /dev/null
+++ b/depend/zcash/src/mempool_limit.h
@@ -0,0 +1,131 @@
+// Copyright (c) 2019 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_MEMPOOL_LIMIT_H
+#define ZCASH_MEMPOOL_LIMIT_H
+
+#include <deque>
+#include <map>
+#include <optional>
+#include <set>
+#include <vector>
+
+#include "primitives/transaction.h"
+#include "policy/fees.h"
+#include "uint256.h"
+
+const size_t DEFAULT_MEMPOOL_TOTAL_COST_LIMIT = 80000000;
+const int64_t DEFAULT_MEMPOOL_EVICTION_MEMORY_MINUTES = 60;
+
+const size_t EVICTION_MEMORY_ENTRIES = 40000;
+const uint64_t MIN_TX_COST = 4000;
+const uint64_t LOW_FEE_PENALTY = 16000;
+
+
+// This class keeps track of transactions which have been recently evicted from the mempool
+// in order to prevent them from being re-accepted for a given amount of time.
+class RecentlyEvictedList
+{
+    const size_t capacity;
+
+    const int64_t timeToKeep;
+
+    // Pairs of txid and time (seconds since epoch)
+    std::deque<std::pair<uint256, int64_t>> txIdsAndTimes;
+
+    std::set<uint256> txIdSet;
+
+    void pruneList();
+
+public:
+    RecentlyEvictedList(size_t capacity_, int64_t timeToKeep_) : capacity(capacity_), timeToKeep(timeToKeep_)
+    {
+        assert(capacity <= EVICTION_MEMORY_ENTRIES);
+    }
+    RecentlyEvictedList(int64_t timeToKeep_) : RecentlyEvictedList(EVICTION_MEMORY_ENTRIES, timeToKeep_) {}
+
+    void add(const uint256& txId);
+    bool contains(const uint256& txId);
+};
+
+
+// The mempool of a node holds a set of transactions. Each transaction has a *cost*,
+// which is an integer defined as:
+//   max(serialized transaction size in bytes, 4000)
+// Each transaction also has an *eviction weight*, which is *cost* + *fee_penalty*,
+// where *fee_penalty* is 16000 if the transaction pays a fee less than 10000 zatoshi,
+// otherwise 0.
+struct TxWeight {
+    int64_t cost;
+    int64_t evictionWeight; // *cost* + *fee_penalty*
+
+    TxWeight(int64_t cost_, int64_t evictionWeight_)
+        : cost(cost_), evictionWeight(evictionWeight_) {}
+
+    TxWeight add(const TxWeight& other) const;
+    TxWeight negate() const;
+};
+
+
+// This struct is a pair of txid, cost.
+struct WeightedTxInfo {
+    uint256 txId;
+    TxWeight txWeight;
+
+    WeightedTxInfo(uint256 txId_, TxWeight txWeight_) : txId(txId_), txWeight(txWeight_) {}
+
+    // Factory method which calculates cost based on size in bytes and fee.
+    static WeightedTxInfo from(const CTransaction& tx, const CAmount& fee);
+};
+
+
+// The following class is a collection of transaction ids and their costs.
+// In order to be able to remove transactions randomly weighted by their cost,
+// we keep track of the total cost of all transactions in this collection.
+// For performance reasons, the collection is represented as a complete binary
+// tree where each node knows the sum of the weights of the children. This
+// allows for addition, removal, and random selection/dropping in logarithmic time.
+class WeightedTxTree
+{
+    const int64_t capacity;
+    size_t size = 0;
+
+    // The following two vectors are the tree representation of this collection.
+    // We keep track of 3 data points for each node: A transaction's txid, its cost,
+    // and the sum of the weights of all children and descendant of that node.
+    std::vector<WeightedTxInfo> txIdAndWeights;
+    std::vector<TxWeight> childWeights;
+
+    // The following map is to simplify removal. When removing a tx, we do so by txid.
+    // This map allows looking up the transaction's index in the tree.
+    std::map<uint256, size_t> txIdToIndexMap;
+
+    // Returns the sum of a node and all of its children's TxWeights for a given index.
+    TxWeight getWeightAt(size_t index) const;
+
+    // When adding and removing a node we need to update its parent and all of its
+    // ancestors to reflect its cost.
+    void backPropagate(size_t fromIndex, const TxWeight& weightDelta);
+
+    // For a given random cost + fee penalty, this method recursively finds the
+    // correct transaction. This is used by WeightedTxTree::maybeDropRandom().
+    size_t findByEvictionWeight(size_t fromIndex, int64_t weightToFind) const;
+
+public:
+    WeightedTxTree(int64_t capacity_) : capacity(capacity_) {
+        assert(capacity >= 0);
+    }
+
+    TxWeight getTotalWeight() const;
+
+    void add(const WeightedTxInfo& weightedTxInfo);
+    void remove(const uint256& txId);
+
+    // If the total cost limit is exceeded, pick a random number based on the total cost
+    // of the collection and remove the associated transaction.
+    std::optional<uint256> maybeDropRandom();
+};
+
+
+#endif // ZCASH_MEMPOOL_LIMIT_H
diff --git a/depend/zcash/src/memusage.h b/depend/zcash/src/memusage.h
new file mode 100644
index 000000000..3899fe61d
--- /dev/null
+++ b/depend/zcash/src/memusage.h
@@ -0,0 +1,143 @@
+// Copyright (c) 2015 The Bitcoin developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_MEMUSAGE_H
+#define BITCOIN_MEMUSAGE_H
+
+#include <stdlib.h>
+
+#include <map>
+#include <set>
+#include <vector>
+
+#include <boost/unordered_set.hpp>
+#include <boost/unordered_map.hpp>
+
+namespace memusage
+{
+
+/** Compute the total memory used by allocating alloc bytes. */
+static size_t MallocUsage(size_t alloc);
+
+/** Dynamic memory usage for built-in types is zero. */
+static inline size_t DynamicUsage(const int8_t& v) { return 0; }
+static inline size_t DynamicUsage(const uint8_t& v) { return 0; }
+static inline size_t DynamicUsage(const int16_t& v) { return 0; }
+static inline size_t DynamicUsage(const uint16_t& v) { return 0; }
+static inline size_t DynamicUsage(const int32_t& v) { return 0; }
+static inline size_t DynamicUsage(const uint32_t& v) { return 0; }
+static inline size_t DynamicUsage(const int64_t& v) { return 0; }
+static inline size_t DynamicUsage(const uint64_t& v) { return 0; }
+static inline size_t DynamicUsage(const float& v) { return 0; }
+static inline size_t DynamicUsage(const double& v) { return 0; }
+template<typename X> static inline size_t DynamicUsage(X * const &v) { return 0; }
+template<typename X> static inline size_t DynamicUsage(const X * const &v) { return 0; }
+
+/** Compute the memory used for dynamically allocated but owned data structures.
+ *  For generic data types, this is *not* recursive. DynamicUsage(vector<vector<int> >)
+ *  will compute the memory used for the vector<int>'s, but not for the ints inside.
+ *  This is for efficiency reasons, as these functions are intended to be fast. If
+ *  application data structures require more accurate inner accounting, they should
+ *  iterate themselves, or use more efficient caching + updating on modification.
+ */
+
+static inline size_t MallocUsage(size_t alloc)
+{
+    // Measured on libc6 2.19 on Linux.
+    if (alloc == 0) {
+        return 0;
+    } else if (sizeof(void*) == 8) {
+        return ((alloc + 31) >> 4) << 4;
+    } else if (sizeof(void*) == 4) {
+        return ((alloc + 15) >> 3) << 3;
+    } else {
+        assert(0);
+    }
+}
+
+// STL data structures
+
+template<typename X>
+struct stl_tree_node
+{
+private:
+    int color;
+    void* parent;
+    void* left;
+    void* right;
+    X x;
+};
+
+struct stl_shared_counter
+{
+    /* Various platforms use different sized counters here.
+     * Conservatively assume that they won't be larger than size_t. */
+    void* class_type;
+    size_t use_count;
+    size_t weak_count;
+};
+
+template<typename X>
+static inline size_t DynamicUsage(const std::vector<X>& v)
+{
+    return MallocUsage(v.capacity() * sizeof(X));
+}
+
+template<unsigned int N, typename X, typename S, typename D>
+static inline size_t DynamicUsage(const prevector<N, X, S, D>& v)
+{
+    return MallocUsage(v.allocated_memory());
+}
+
+template<typename X>
+static inline size_t DynamicUsage(const std::set<X>& s)
+{
+    return MallocUsage(sizeof(stl_tree_node<X>)) * s.size();
+}
+
+template<typename X, typename Y, typename C>
+static inline size_t DynamicUsage(const std::map<X, Y, C>& m)
+{
+    return MallocUsage(sizeof(stl_tree_node<std::pair<const X, Y> >)) * m.size();
+}
+
+template<typename X>
+static inline size_t DynamicUsage(const std::unique_ptr<X>& p)
+{
+    return p ? MallocUsage(sizeof(X)) : 0;
+}
+
+template<typename X>
+static inline size_t DynamicUsage(const std::shared_ptr<X>& p)
+{
+    // A shared_ptr can either use a single continuous memory block for both
+    // the counter and the storage (when using std::make_shared), or separate.
+    // We can't observe the difference, however, so assume the worst.
+    return p ? MallocUsage(sizeof(X)) + MallocUsage(sizeof(stl_shared_counter)) : 0;
+}
+
+// Boost data structures
+
+template<typename X>
+struct boost_unordered_node : private X
+{
+private:
+    void* ptr;
+};
+
+template<typename X, typename Y>
+static inline size_t DynamicUsage(const boost::unordered_set<X, Y>& s)
+{
+    return MallocUsage(sizeof(boost_unordered_node<X>)) * s.size() + MallocUsage(sizeof(void*) * s.bucket_count());
+}
+
+template<typename X, typename Y, typename Z>
+static inline size_t DynamicUsage(const boost::unordered_map<X, Y, Z>& m)
+{
+    return MallocUsage(sizeof(boost_unordered_node<std::pair<const X, Y> >)) * m.size() + MallocUsage(sizeof(void*) * m.bucket_count());
+}
+
+}
+
+#endif // BITCOIN_MEMUSAGE_H
diff --git a/depend/zcash/src/merkleblock.cpp b/depend/zcash/src/merkleblock.cpp
new file mode 100644
index 000000000..383a4585f
--- /dev/null
+++ b/depend/zcash/src/merkleblock.cpp
@@ -0,0 +1,179 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "merkleblock.h"
+
+#include "hash.h"
+#include "consensus/consensus.h"
+#include "utilstrencodings.h"
+
+CMerkleBlock::CMerkleBlock(const CBlock& block, CBloomFilter& filter)
+{
+    header = block.GetBlockHeader();
+
+    std::vector<bool> vMatch;
+    std::vector<uint256> vHashes;
+
+    vMatch.reserve(block.vtx.size());
+    vHashes.reserve(block.vtx.size());
+
+    for (unsigned int i = 0; i < block.vtx.size(); i++)
+    {
+        const uint256& hash = block.vtx[i].GetHash();
+        if (filter.IsRelevantAndUpdate(block.vtx[i]))
+        {
+            vMatch.push_back(true);
+            vMatchedTxn.push_back(std::make_pair(i, hash));
+        }
+        else
+            vMatch.push_back(false);
+        vHashes.push_back(hash);
+    }
+
+    txn = CPartialMerkleTree(vHashes, vMatch);
+}
+
+CMerkleBlock::CMerkleBlock(const CBlock& block, const std::set<uint256>& txids)
+{
+    header = block.GetBlockHeader();
+
+    std::vector<bool> vMatch;
+    std::vector<uint256> vHashes;
+
+    vMatch.reserve(block.vtx.size());
+    vHashes.reserve(block.vtx.size());
+
+    for (unsigned int i = 0; i < block.vtx.size(); i++)
+    {
+        const uint256& hash = block.vtx[i].GetHash();
+        if (txids.count(hash))
+            vMatch.push_back(true);
+        else
+            vMatch.push_back(false);
+        vHashes.push_back(hash);
+    }
+
+    txn = CPartialMerkleTree(vHashes, vMatch);
+}
+
+uint256 CPartialMerkleTree::CalcHash(int height, unsigned int pos, const std::vector<uint256> &vTxid) {
+    if (height == 0) {
+        // hash at height 0 is the txid itself
+        return vTxid[pos];
+    } else {
+        // calculate left hash
+        uint256 left = CalcHash(height-1, pos*2, vTxid), right;
+        // calculate right hash if not beyond the end of the array - copy left hash otherwise
+        if (pos*2+1 < CalcTreeWidth(height-1))
+            right = CalcHash(height-1, pos*2+1, vTxid);
+        else
+            right = left;
+        // combine subhashes
+        return Hash(BEGIN(left), END(left), BEGIN(right), END(right));
+    }
+}
+
+void CPartialMerkleTree::TraverseAndBuild(int height, unsigned int pos, const std::vector<uint256> &vTxid, const std::vector<bool> &vMatch) {
+    // determine whether this node is the parent of at least one matched txid
+    bool fParentOfMatch = false;
+    for (unsigned int p = pos << height; p < (pos+1) << height && p < nTransactions; p++)
+        fParentOfMatch |= vMatch[p];
+    // store as flag bit
+    vBits.push_back(fParentOfMatch);
+    if (height==0 || !fParentOfMatch) {
+        // if at height 0, or nothing interesting below, store hash and stop
+        vHash.push_back(CalcHash(height, pos, vTxid));
+    } else {
+        // otherwise, don't store any hash, but descend into the subtrees
+        TraverseAndBuild(height-1, pos*2, vTxid, vMatch);
+        if (pos*2+1 < CalcTreeWidth(height-1))
+            TraverseAndBuild(height-1, pos*2+1, vTxid, vMatch);
+    }
+}
+
+uint256 CPartialMerkleTree::TraverseAndExtract(int height, unsigned int pos, unsigned int &nBitsUsed, unsigned int &nHashUsed, std::vector<uint256> &vMatch) {
+    if (nBitsUsed >= vBits.size()) {
+        // overflowed the bits array - failure
+        fBad = true;
+        return uint256();
+    }
+    bool fParentOfMatch = vBits[nBitsUsed++];
+    if (height==0 || !fParentOfMatch) {
+        // if at height 0, or nothing interesting below, use stored hash and do not descend
+        if (nHashUsed >= vHash.size()) {
+            // overflowed the hash array - failure
+            fBad = true;
+            return uint256();
+        }
+        const uint256 &hash = vHash[nHashUsed++];
+        if (height==0 && fParentOfMatch) // in case of height 0, we have a matched txid
+            vMatch.push_back(hash);
+        return hash;
+    } else {
+        // otherwise, descend into the subtrees to extract matched txids and hashes
+        uint256 left = TraverseAndExtract(height-1, pos*2, nBitsUsed, nHashUsed, vMatch), right;
+        if (pos*2+1 < CalcTreeWidth(height-1)) {
+            right = TraverseAndExtract(height-1, pos*2+1, nBitsUsed, nHashUsed, vMatch);
+            if (right == left) {
+                // The left and right branches should never be identical, as the transaction
+                // hashes covered by them must each be unique.
+                fBad = true;
+            }
+        } else {
+            right = left;
+        }
+        // and combine them before returning
+        return Hash(BEGIN(left), END(left), BEGIN(right), END(right));
+    }
+}
+
+CPartialMerkleTree::CPartialMerkleTree(const std::vector<uint256> &vTxid, const std::vector<bool> &vMatch) : nTransactions(vTxid.size()), fBad(false) {
+    // reset state
+    vBits.clear();
+    vHash.clear();
+
+    // calculate height of tree
+    int nHeight = 0;
+    while (CalcTreeWidth(nHeight) > 1)
+        nHeight++;
+
+    // traverse the partial tree
+    TraverseAndBuild(nHeight, 0, vTxid, vMatch);
+}
+
+CPartialMerkleTree::CPartialMerkleTree() : nTransactions(0), fBad(true) {}
+
+uint256 CPartialMerkleTree::ExtractMatches(std::vector<uint256> &vMatch) {
+    vMatch.clear();
+    // An empty set will not work
+    if (nTransactions == 0)
+        return uint256();
+    // check for excessively high numbers of transactions
+    if (nTransactions > MAX_BLOCK_SIZE / 60) // 60 is the lower bound for the size of a serialized CTransaction
+        return uint256();
+    // there can never be more hashes provided than one for every txid
+    if (vHash.size() > nTransactions)
+        return uint256();
+    // there must be at least one bit per node in the partial tree, and at least one node per hash
+    if (vBits.size() < vHash.size())
+        return uint256();
+    // calculate height of tree
+    int nHeight = 0;
+    while (CalcTreeWidth(nHeight) > 1)
+        nHeight++;
+    // traverse the partial tree
+    unsigned int nBitsUsed = 0, nHashUsed = 0;
+    uint256 hashMerkleRoot = TraverseAndExtract(nHeight, 0, nBitsUsed, nHashUsed, vMatch);
+    // verify that no problems occurred during the tree traversal
+    if (fBad)
+        return uint256();
+    // verify that all bits were consumed (except for the padding caused by serializing it as a byte sequence)
+    if ((nBitsUsed+7)/8 != (vBits.size()+7)/8)
+        return uint256();
+    // verify that all hashes were consumed
+    if (nHashUsed != vHash.size())
+        return uint256();
+    return hashMerkleRoot;
+}
diff --git a/depend/zcash/src/merkleblock.h b/depend/zcash/src/merkleblock.h
new file mode 100644
index 000000000..5f9c02f50
--- /dev/null
+++ b/depend/zcash/src/merkleblock.h
@@ -0,0 +1,156 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_MERKLEBLOCK_H
+#define BITCOIN_MERKLEBLOCK_H
+
+#include "serialize.h"
+#include "uint256.h"
+#include "primitives/block.h"
+#include "bloom.h"
+
+#include <vector>
+
+/** Data structure that represents a partial merkle tree.
+ *
+ * It represents a subset of the txid's of a known block, in a way that
+ * allows recovery of the list of txid's and the merkle root, in an
+ * authenticated way.
+ *
+ * The encoding works as follows: we traverse the tree in depth-first order,
+ * storing a bit for each traversed node, signifying whether the node is the
+ * parent of at least one matched leaf txid (or a matched txid itself). In
+ * case we are at the leaf level, or this bit is 0, its merkle node hash is
+ * stored, and its children are not explorer further. Otherwise, no hash is
+ * stored, but we recurse into both (or the only) child branch. During
+ * decoding, the same depth-first traversal is performed, consuming bits and
+ * hashes as they written during encoding.
+ *
+ * The serialization is fixed and provides a hard guarantee about the
+ * encoded size:
+ *
+ *   SIZE <= 10 + ceil(32.25*N)
+ *
+ * Where N represents the number of leaf nodes of the partial tree. N itself
+ * is bounded by:
+ *
+ *   N <= total_transactions
+ *   N <= 1 + matched_transactions*tree_height
+ *
+ * The serialization format:
+ *  - uint32     total_transactions (4 bytes)
+ *  - varint     number of hashes   (1-3 bytes)
+ *  - uint256[]  hashes in depth-first order (<= 32*N bytes)
+ *  - varint     number of bytes of flag bits (1-3 bytes)
+ *  - byte[]     flag bits, packed per 8 in a byte, least significant bit first (<= 2*N-1 bits)
+ * The size constraints follow from this.
+ */
+class CPartialMerkleTree
+{
+protected:
+    /** the total number of transactions in the block */
+    unsigned int nTransactions;
+
+    /** node-is-parent-of-matched-txid bits */
+    std::vector<bool> vBits;
+
+    /** txids and internal hashes */
+    std::vector<uint256> vHash;
+
+    /** flag set when encountering invalid data */
+    bool fBad;
+
+    /** helper function to efficiently calculate the number of nodes at given height in the merkle tree */
+    unsigned int CalcTreeWidth(int height) {
+        return (nTransactions+(1 << height)-1) >> height;
+    }
+
+    /** calculate the hash of a node in the merkle tree (at leaf level: the txid itself) */
+    uint256 CalcHash(int height, unsigned int pos, const std::vector<uint256> &vTxid);
+
+    /** recursive function that traverses tree nodes, storing the data as bits and hashes */
+    void TraverseAndBuild(int height, unsigned int pos, const std::vector<uint256> &vTxid, const std::vector<bool> &vMatch);
+
+    /**
+     * recursive function that traverses tree nodes, consuming the bits and hashes produced by TraverseAndBuild.
+     * it returns the hash of the respective node.
+     */
+    uint256 TraverseAndExtract(int height, unsigned int pos, unsigned int &nBitsUsed, unsigned int &nHashUsed, std::vector<uint256> &vMatch);
+
+public:
+
+    /** serialization implementation */
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(nTransactions);
+        READWRITE(vHash);
+        std::vector<unsigned char> vBytes;
+        if (ser_action.ForRead()) {
+            READWRITE(vBytes);
+            CPartialMerkleTree &us = *(const_cast<CPartialMerkleTree*>(this));
+            us.vBits.resize(vBytes.size() * 8);
+            for (unsigned int p = 0; p < us.vBits.size(); p++)
+                us.vBits[p] = (vBytes[p / 8] & (1 << (p % 8))) != 0;
+            us.fBad = false;
+        } else {
+            vBytes.resize((vBits.size()+7)/8);
+            for (unsigned int p = 0; p < vBits.size(); p++)
+                vBytes[p / 8] |= vBits[p] << (p % 8);
+            READWRITE(vBytes);
+        }
+    }
+
+    /** Construct a partial merkle tree from a list of transaction ids, and a mask that selects a subset of them */
+    CPartialMerkleTree(const std::vector<uint256> &vTxid, const std::vector<bool> &vMatch);
+
+    CPartialMerkleTree();
+
+    /**
+     * extract the matching txid's represented by this partial merkle tree.
+     * returns the merkle root, or 0 in case of failure
+     */
+    uint256 ExtractMatches(std::vector<uint256> &vMatch);
+};
+
+
+/**
+ * Used to relay blocks as header + vector<merkle branch>
+ * to filtered nodes.
+ */
+class CMerkleBlock
+{
+public:
+    /** Public only for unit testing */
+    CBlockHeader header;
+    CPartialMerkleTree txn;
+
+public:
+    /** Public only for unit testing and relay testing (not relayed) */
+    std::vector<std::pair<unsigned int, uint256> > vMatchedTxn;
+
+    /**
+     * Create from a CBlock, filtering transactions according to filter
+     * Note that this will call IsRelevantAndUpdate on the filter for each transaction,
+     * thus the filter will likely be modified.
+     */
+    CMerkleBlock(const CBlock& block, CBloomFilter& filter);
+
+    // Create from a CBlock, matching the txids in the set
+    CMerkleBlock(const CBlock& block, const std::set<uint256>& txids);
+
+    CMerkleBlock() {}
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(header);
+        READWRITE(txn);
+    }
+};
+
+#endif // BITCOIN_MERKLEBLOCK_H
diff --git a/depend/zcash/src/metrics.cpp b/depend/zcash/src/metrics.cpp
new file mode 100644
index 000000000..0dc6c88b9
--- /dev/null
+++ b/depend/zcash/src/metrics.cpp
@@ -0,0 +1,705 @@
+// Copyright (c) 2016 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "metrics.h"
+
+#include "chainparams.h"
+#include "checkpoints.h"
+#include "main.h"
+#include "timedata.h"
+#include "ui_interface.h"
+#include "util.h"
+#include "utiltime.h"
+#include "utilmoneystr.h"
+#include "utilstrencodings.h"
+
+#include <boost/range/irange.hpp>
+#include <boost/thread.hpp>
+#include <boost/thread/synchronized_value.hpp>
+
+#include <optional>
+#include <string>
+#ifdef WIN32
+#include <io.h>
+#include <wincon.h>
+#else
+#include <sys/ioctl.h>
+#endif
+#include <unistd.h>
+
+void AtomicTimer::start()
+{
+    std::unique_lock<std::mutex> lock(mtx);
+    if (threads < 1) {
+        start_time = GetTime();
+    }
+    ++threads;
+}
+
+void AtomicTimer::stop()
+{
+    std::unique_lock<std::mutex> lock(mtx);
+    // Ignore excess calls to stop()
+    if (threads > 0) {
+        --threads;
+        if (threads < 1) {
+            int64_t time_span = GetTime() - start_time;
+            total_time += time_span;
+        }
+    }
+}
+
+
+void AtomicTimer::zeroize()
+{
+    std::unique_lock<std::mutex> lock(mtx);
+    // only zeroize it if there's no more threads (same semantics as start())
+    if (threads < 1) {
+        start_time = 0;
+        total_time = 0;
+    }
+}
+
+bool AtomicTimer::running()
+{
+    std::unique_lock<std::mutex> lock(mtx);
+    return threads > 0;
+}
+
+uint64_t AtomicTimer::threadCount()
+{
+    std::unique_lock<std::mutex> lock(mtx);
+    return threads;
+}
+
+double AtomicTimer::rate(const AtomicCounter& count)
+{
+    std::unique_lock<std::mutex> lock(mtx);
+    int64_t duration = total_time;
+    if (threads > 0) {
+        // Timer is running, so get the latest count
+        duration += GetTime() - start_time;
+    }
+    return duration > 0 ? (double)count.get() / duration : 0;
+}
+
+static CCriticalSection cs_metrics;
+
+static boost::synchronized_value<int64_t> nNodeStartTime;
+static boost::synchronized_value<int64_t> nNextRefresh;
+AtomicCounter transactionsValidated;
+AtomicCounter ehSolverRuns;
+AtomicCounter solutionTargetChecks;
+static AtomicCounter minedBlocks;
+AtomicTimer miningTimer;
+std::atomic<size_t> nSizeReindexed(0);   // valid only during reindex
+std::atomic<size_t> nFullSizeToReindex(1);   // valid only during reindex
+
+static boost::synchronized_value<std::list<uint256>> trackedBlocks;
+
+static boost::synchronized_value<std::list<std::string>> messageBox;
+static boost::synchronized_value<std::string> initMessage;
+static bool loaded = false;
+
+extern int64_t GetNetworkHashPS(int lookup, int height);
+
+void TrackMinedBlock(uint256 hash)
+{
+    LOCK(cs_metrics);
+    minedBlocks.increment();
+    trackedBlocks->push_back(hash);
+}
+
+void MarkStartTime()
+{
+    *nNodeStartTime = GetTime();
+}
+
+int64_t GetUptime()
+{
+    return GetTime() - *nNodeStartTime;
+}
+
+double GetLocalSolPS()
+{
+    return miningTimer.rate(solutionTargetChecks);
+}
+
+std::string WhichNetwork()
+{
+    if (GetBoolArg("-regtest", false))
+        return "regtest";
+    if (GetBoolArg("-testnet", false))
+        return "testnet";
+    return "mainnet";
+}
+
+int EstimateNetHeight(const Consensus::Params& params, int currentHeadersHeight, int64_t currentHeadersTime)
+{
+    int64_t now = GetTime();
+    if (currentHeadersTime >= now) {
+        return currentHeadersHeight;
+    }
+
+    int estimatedHeight = currentHeadersHeight + (now - currentHeadersTime) / params.PoWTargetSpacing(currentHeadersHeight);
+
+    int blossomActivationHeight = params.vUpgrades[Consensus::UPGRADE_BLOSSOM].nActivationHeight;
+    if (currentHeadersHeight >= blossomActivationHeight || estimatedHeight <= blossomActivationHeight) {
+        return ((estimatedHeight + 5) / 10) * 10;
+    }
+
+    int numPreBlossomBlocks = blossomActivationHeight - currentHeadersHeight;
+    int64_t preBlossomTime = numPreBlossomBlocks * params.PoWTargetSpacing(blossomActivationHeight - 1);
+    int64_t blossomActivationTime = currentHeadersTime + preBlossomTime;
+    if (blossomActivationTime >= now) {
+        return blossomActivationHeight;
+    }
+
+    int netheight =  blossomActivationHeight + (now - blossomActivationTime) / params.PoWTargetSpacing(blossomActivationHeight);
+    return ((netheight + 5) / 10) * 10;
+}
+
+void TriggerRefresh()
+{
+    *nNextRefresh = GetTime();
+    // Ensure that the refresh has started before we return
+    MilliSleep(200);
+}
+
+static bool metrics_ThreadSafeMessageBox(const std::string& message,
+                                      const std::string& caption,
+                                      unsigned int style)
+{
+    // The SECURE flag has no effect in the metrics UI.
+    style &= ~CClientUIInterface::SECURE;
+
+    std::string strCaption;
+    // Check for usage of predefined caption
+    switch (style) {
+    case CClientUIInterface::MSG_ERROR:
+        strCaption += _("Error");
+        break;
+    case CClientUIInterface::MSG_WARNING:
+        strCaption += _("Warning");
+        break;
+    case CClientUIInterface::MSG_INFORMATION:
+        strCaption += _("Information");
+        break;
+    default:
+        strCaption += caption; // Use supplied caption (can be empty)
+    }
+
+    boost::strict_lock_ptr<std::list<std::string>> u = messageBox.synchronize();
+    u->push_back(strCaption + ": " + message);
+    if (u->size() > 5) {
+        u->pop_back();
+    }
+
+    TriggerRefresh();
+    return false;
+}
+
+static bool metrics_ThreadSafeQuestion(const std::string& /* ignored interactive message */, const std::string& message, const std::string& caption, unsigned int style)
+{
+    return metrics_ThreadSafeMessageBox(message, caption, style);
+}
+
+static void metrics_InitMessage(const std::string& message)
+{
+    *initMessage = message;
+}
+
+void ConnectMetricsScreen()
+{
+    uiInterface.ThreadSafeMessageBox.disconnect_all_slots();
+    uiInterface.ThreadSafeMessageBox.connect(metrics_ThreadSafeMessageBox);
+    uiInterface.ThreadSafeQuestion.disconnect_all_slots();
+    uiInterface.ThreadSafeQuestion.connect(metrics_ThreadSafeQuestion);
+    uiInterface.InitMessage.disconnect_all_slots();
+    uiInterface.InitMessage.connect(metrics_InitMessage);
+}
+
+std::string DisplayDuration(int64_t duration, DurationFormat format)
+{
+    int64_t days =  duration / (24 * 60 * 60);
+    int64_t hours = (duration - (days * 24 * 60 * 60)) / (60 * 60);
+    int64_t minutes = (duration - (((days * 24) + hours) * 60 * 60)) / 60;
+    int64_t seconds = duration - (((((days * 24) + hours) * 60) + minutes) * 60);
+
+    std::string strDuration;
+    if (format == DurationFormat::REDUCED) {
+        if (days > 0) {
+            strDuration = strprintf(_("%d days"), days);
+        } else if (hours > 0) {
+            strDuration = strprintf(_("%d hours"), hours);
+        } else if (minutes > 0) {
+            strDuration = strprintf(_("%d minutes"), minutes);
+        } else {
+            strDuration = strprintf(_("%d seconds"), seconds);
+        }
+    } else {
+        if (days > 0) {
+            strDuration = strprintf(_("%d days, %d hours, %d minutes, %d seconds"), days, hours, minutes, seconds);
+        } else if (hours > 0) {
+            strDuration = strprintf(_("%d hours, %d minutes, %d seconds"), hours, minutes, seconds);
+        } else if (minutes > 0) {
+            strDuration = strprintf(_("%d minutes, %d seconds"), minutes, seconds);
+        } else {
+            strDuration = strprintf(_("%d seconds"), seconds);
+        }
+    }
+    return strDuration;
+}
+
+std::string DisplaySize(size_t value)
+{
+    double coef = 1.0;
+    if (value < 1024.0 * coef)
+        return strprintf(_("%d Bytes"), value);
+    coef *= 1024.0;
+    if (value < 1024.0 * coef)
+        return strprintf(_("%.2f KiB"), value / coef);
+    coef *= 1024.0;
+    if (value < 1024.0 * coef)
+        return strprintf(_("%.2f MiB"), value / coef);
+    coef *= 1024.0;
+    if (value < 1024.0 * coef)
+        return strprintf(_("%.2f GiB"), value / coef);
+    coef *= 1024.0;
+    return strprintf(_("%.2f TiB"), value / coef);
+}
+
+std::string DisplayHashRate(double value)
+{
+    double coef = 1.0;
+    if (value < 1000.0 * coef)
+        return strprintf(_("%.3f Sol/s"), value);
+    coef *= 1000.0;
+    if (value < 1000.0 * coef)
+        return strprintf(_("%.3f kSol/s"), value / coef);
+    coef *= 1000.0;
+    if (value < 1000.0 * coef)
+        return strprintf(_("%.3f MSol/s"), value / coef);
+    coef *= 1000.0;
+    if (value < 1000.0 * coef)
+        return strprintf(_("%.3f GSol/s"), value / coef);
+    coef *= 1000.0;
+    return strprintf(_("%.3f TSol/s"), value / coef);
+}
+
+std::optional<int64_t> SecondsLeftToNextEpoch(const Consensus::Params& params, int currentHeight)
+{
+    auto nextHeight = NextActivationHeight(currentHeight, params);
+    if (nextHeight) {
+        return (nextHeight.value() - currentHeight) * params.PoWTargetSpacing(nextHeight.value() - 1);
+    } else {
+        return std::nullopt;
+    }
+}
+
+struct MetricsStats {
+    int height;
+    int64_t currentHeadersHeight;
+    int64_t currentHeadersTime;
+    size_t connections;
+    int64_t netsolps;
+};
+
+MetricsStats loadStats()
+{
+    int height;
+    int64_t currentHeadersHeight;
+    int64_t currentHeadersTime;
+    size_t connections;
+    int64_t netsolps;
+
+    {
+        LOCK(cs_main);
+        height = chainActive.Height();
+        currentHeadersHeight = pindexBestHeader ? pindexBestHeader->nHeight: -1;
+        currentHeadersTime = pindexBestHeader ? pindexBestHeader->nTime : 0;
+        netsolps = GetNetworkHashPS(120, -1);
+    }
+    {
+        LOCK(cs_vNodes);
+        connections = vNodes.size();
+    }
+
+    return MetricsStats {
+        height,
+        currentHeadersHeight,
+        currentHeadersTime,
+        connections,
+        netsolps
+    };
+}
+
+int printStats(MetricsStats stats, bool isScreen, bool mining)
+{
+    // Number of lines that are always displayed
+    int lines = 5;
+
+    const Consensus::Params& params = Params().GetConsensus();
+    auto localsolps = GetLocalSolPS();
+
+    if (IsInitialBlockDownload(Params().GetConsensus())) {
+        if (fReindex) {
+            int downloadPercent = nSizeReindexed * 100 / nFullSizeToReindex;
+            std::cout << "      " << _("Reindexing blocks") << " | "
+                << DisplaySize(nSizeReindexed) << " / " << DisplaySize(nFullSizeToReindex)
+                << " (" << downloadPercent << "%, " << stats.height << " " << _("blocks") << ")" << std::endl;
+        } else {
+            int nHeaders = stats.currentHeadersHeight;
+            if (nHeaders < 0)
+                nHeaders = 0;
+            int netheight = stats.currentHeadersHeight == -1 || stats.currentHeadersTime == 0 ?
+                0 : EstimateNetHeight(params, stats.currentHeadersHeight, stats.currentHeadersTime);
+            if (netheight < nHeaders)
+                netheight = nHeaders;
+            if (netheight <= 0)
+                netheight = 1;
+            int downloadPercent = stats.height * 100 / netheight;
+            std::cout << "     " << _("Downloading blocks") << " | "
+                << stats.height << " (" << nHeaders << " " << _("headers") << ") / ~" << netheight
+                << " (" << downloadPercent << "%)" << std::endl;
+
+            if (isScreen) {
+                // Draw 50-character progress bar, which will fit into a 79-character line.
+                int blockChars = downloadPercent / 2;
+                int headerChars = (nHeaders * 50) / netheight;
+                // Start with background colour reversed for "full" bar.
+                std::cout << "                        | [";
+                for (auto i : boost::irange(0, 50)) {
+                    if (i == headerChars) {
+                        // Switch to normal background colour for "empty" bar.
+                        std::cout << "";
+                    } else if (i == blockChars) {
+                        // Switch to distinct colour for "headers" bar.
+                        std::cout << "";
+                    }
+                    std::cout << " ";
+                }
+                // Ensure that colour is reset after the progress bar is printed.
+                std::cout << "]" << std::endl;
+                lines++;
+            }
+        }
+    } else {
+        std::cout << "           " << _("Block height") << " | " << stats.height << std::endl;
+    }
+
+    auto secondsLeft = SecondsLeftToNextEpoch(params, stats.height);
+    std::string strUpgradeTime;
+    if (secondsLeft) {
+        auto nextHeight = NextActivationHeight(stats.height, params).value();
+        auto nextBranch = NextEpoch(stats.height, params).value();
+        strUpgradeTime = strprintf(_("%s at block height %d, in around %s"),
+                                   NetworkUpgradeInfo[nextBranch].strName, nextHeight, DisplayDuration(secondsLeft.value(), DurationFormat::REDUCED));
+    }
+    else {
+        strUpgradeTime = "Unknown";
+    }
+    std::cout << "           " << _("Next upgrade") << " | " << strUpgradeTime << std::endl;
+    std::cout << "            " << _("Connections") << " | " << stats.connections << std::endl;
+    std::cout << "  " << _("Network solution rate") << " | " << DisplayHashRate(stats.netsolps) << std::endl;
+    if (mining && miningTimer.running()) {
+        std::cout << "    " << _("Local solution rate") << " | " << DisplayHashRate(localsolps) << std::endl;
+        lines++;
+    }
+    std::cout << std::endl;
+
+    return lines;
+}
+
+int printMiningStatus(bool mining)
+{
+#ifdef ENABLE_MINING
+    // Number of lines that are always displayed
+    int lines = 1;
+
+    if (mining) {
+        auto nThreads = miningTimer.threadCount();
+        if (nThreads > 0) {
+            std::cout << strprintf(_("You are mining with the %s solver on %d threads."),
+                                   GetArg("-equihashsolver", "default"), nThreads) << std::endl;
+        } else {
+            bool fvNodesEmpty;
+            {
+                LOCK(cs_vNodes);
+                fvNodesEmpty = vNodes.empty();
+            }
+            if (fvNodesEmpty) {
+                std::cout << _("Mining is paused while waiting for connections.") << std::endl;
+            } else if (IsInitialBlockDownload(Params().GetConsensus())) {
+                std::cout << _("Mining is paused while downloading blocks.") << std::endl;
+            } else {
+                std::cout << _("Mining is paused (a JoinSplit may be in progress).") << std::endl;
+            }
+        }
+        lines++;
+    } else if (Params().NetworkIDString() != "main") {
+        std::cout << _("You are currently not mining.") << std::endl;
+        std::cout << _("To enable mining, add 'gen=1' to your zcash.conf and restart.") << std::endl;
+        lines += 2;
+    }
+    std::cout << std::endl;
+
+    return lines;
+#else // ENABLE_MINING
+    return 0;
+#endif // !ENABLE_MINING
+}
+
+int printMetrics(size_t cols, bool mining)
+{
+    // Number of lines that are always displayed
+    int lines = 3;
+
+    // Calculate and display uptime
+    std::string duration = DisplayDuration(GetUptime(), DurationFormat::FULL);
+
+    std::string strDuration = strprintf(_("Since starting this node %s ago:"), duration);
+    std::cout << strDuration << std::endl;
+    lines += (strDuration.size() / cols);
+
+    int validatedCount = transactionsValidated.get();
+    if (validatedCount > 1) {
+      std::cout << "- " << strprintf(_("You have validated %d transactions!"), validatedCount) << std::endl;
+    } else if (validatedCount == 1) {
+      std::cout << "- " << _("You have validated a transaction!") << std::endl;
+    } else {
+      std::cout << "- " << _("You have validated no transactions.") << std::endl;
+    }
+
+    if (mining && loaded) {
+        std::cout << "- " << strprintf(_("You have completed %d Equihash solver runs."), ehSolverRuns.get()) << std::endl;
+        lines++;
+
+        int mined = 0;
+        int orphaned = 0;
+        CAmount immature {0};
+        CAmount mature {0};
+        {
+            LOCK2(cs_main, cs_metrics);
+            boost::strict_lock_ptr<std::list<uint256>> u = trackedBlocks.synchronize();
+            const Consensus::Params& consensusParams = Params().GetConsensus();
+            auto tipHeight = chainActive.Height();
+
+            // Update orphans and calculate subsidies
+            std::list<uint256>::iterator it = u->begin();
+            while (it != u->end()) {
+                auto hash = *it;
+                if (mapBlockIndex.count(hash) > 0 &&
+                        chainActive.Contains(mapBlockIndex[hash])) {
+                    int height = mapBlockIndex[hash]->nHeight;
+                    CAmount subsidy = GetBlockSubsidy(height, consensusParams);
+                    if ((height > 0) && (height <= consensusParams.GetLastFoundersRewardBlockHeight(height))) {
+                        subsidy -= subsidy/5;
+                    }
+                    if (std::max(0, COINBASE_MATURITY - (tipHeight - height)) > 0) {
+                        immature += subsidy;
+                    } else {
+                        mature += subsidy;
+                    }
+                    it++;
+                } else {
+                    it = u->erase(it);
+                }
+            }
+
+            mined = minedBlocks.get();
+            orphaned = mined - u->size();
+        }
+
+        if (mined > 0) {
+            std::string units = Params().CurrencyUnits();
+            std::cout << "- " << strprintf(_("You have mined %d blocks!"), mined) << std::endl;
+            std::cout << "  "
+                      << strprintf(_("Orphaned: %d blocks, Immature: %u %s, Mature: %u %s"),
+                                     orphaned,
+                                     FormatMoney(immature), units,
+                                     FormatMoney(mature), units)
+                      << std::endl;
+            lines += 2;
+        }
+    }
+    std::cout << std::endl;
+
+    return lines;
+}
+
+int printMessageBox(size_t cols)
+{
+    boost::strict_lock_ptr<std::list<std::string>> u = messageBox.synchronize();
+
+    if (u->size() == 0) {
+        return 0;
+    }
+
+    int lines = 2 + u->size();
+    std::cout << _("Messages:") << std::endl;
+    for (auto it = u->cbegin(); it != u->cend(); ++it) {
+        auto msg = FormatParagraph(*it, cols, 2);
+        std::cout << "- " << msg << std::endl;
+        // Handle newlines and wrapped lines
+        size_t i = 0;
+        size_t j = 0;
+        while (j < msg.size()) {
+            i = msg.find('\n', j);
+            if (i == std::string::npos) {
+                i = msg.size();
+            } else {
+                // Newline
+                lines++;
+            }
+            j = i + 1;
+        }
+    }
+    std::cout << std::endl;
+    return lines;
+}
+
+int printInitMessage()
+{
+    if (loaded) {
+        return 0;
+    }
+
+    std::string msg = *initMessage;
+    std::cout << _("Init message:") << " " << msg << std::endl;
+    std::cout << std::endl;
+
+    if (msg == _("Done loading")) {
+        loaded = true;
+    }
+
+    return 2;
+}
+
+#ifdef WIN32
+bool enableVTMode()
+{
+    // Set output mode to handle virtual terminal sequences
+    HANDLE hOut = GetStdHandle(STD_OUTPUT_HANDLE);
+    if (hOut == INVALID_HANDLE_VALUE) {
+        return false;
+    }
+
+    DWORD dwMode = 0;
+    if (!GetConsoleMode(hOut, &dwMode)) {
+        return false;
+    }
+
+    dwMode |= ENABLE_VIRTUAL_TERMINAL_PROCESSING;
+    if (!SetConsoleMode(hOut, dwMode)) {
+        return false;
+    }
+    return true;
+}
+#endif
+
+void ThreadShowMetricsScreen()
+{
+    // Make this thread recognisable as the metrics screen thread
+    RenameThread("zcash-metrics-screen");
+
+    // Determine whether we should render a persistent UI or rolling metrics
+    bool isTTY = isatty(STDOUT_FILENO);
+    bool isScreen = GetBoolArg("-metricsui", isTTY);
+    int64_t nRefresh = GetArg("-metricsrefreshtime", isTTY ? 1 : 600);
+
+    if (isScreen) {
+#ifdef WIN32
+        enableVTMode();
+#endif
+
+        // Clear screen
+        std::cout << "\e[2J";
+
+        // Print art
+        std::cout << METRICS_ART << std::endl;
+        std::cout << std::endl;
+
+        // Thank you text
+        std::cout << strprintf(_("Thank you for running a %s zcashd v%s node!"), WhichNetwork(), FormatVersion(CLIENT_VERSION)) << std::endl;
+        std::cout << _("You're helping to strengthen the network and contributing to a social good :)") << std::endl;
+
+        // Privacy notice text
+        std::cout << PrivacyInfo();
+        std::cout << std::endl;
+    }
+
+    while (true) {
+        // Number of lines that are always displayed
+        int lines = 1;
+        int cols = 80;
+
+        // Get current window size
+        if (isTTY) {
+#ifdef WIN32
+            CONSOLE_SCREEN_BUFFER_INFO csbi;
+            if (GetConsoleScreenBufferInfo(GetStdHandle(STD_OUTPUT_HANDLE), &csbi) != 0) {
+                cols = csbi.srWindow.Right - csbi.srWindow.Left + 1;
+            }
+#else
+            struct winsize w;
+            w.ws_col = 0;
+            if (ioctl(STDOUT_FILENO, TIOCGWINSZ, &w) != -1 && w.ws_col != 0) {
+                cols = w.ws_col;
+            }
+#endif
+        }
+
+        // Lock and fetch stats before erasing the screen, in case we block.
+        std::optional<MetricsStats> metricsStats;
+        if (loaded) {
+            metricsStats = loadStats();
+        }
+
+        if (isScreen) {
+            // Erase below current position
+            std::cout << "\e[J";
+        }
+
+        // Miner status
+#ifdef ENABLE_MINING
+        bool mining = GetBoolArg("-gen", false);
+#else
+        bool mining = false;
+#endif
+
+        if (loaded) {
+            lines += printStats(metricsStats.value(), isScreen, mining);
+            lines += printMiningStatus(mining);
+        }
+        lines += printMetrics(cols, mining);
+        lines += printMessageBox(cols);
+        lines += printInitMessage();
+
+        if (isScreen) {
+            // Explain how to exit
+            std::cout << "[";
+#ifdef WIN32
+            std::cout << _("'zcash-cli.exe stop' to exit");
+#else
+            std::cout << _("Press Ctrl+C to exit");
+#endif
+            std::cout << "] [" << _("Set 'showmetrics=0' to hide") << "]" << std::endl;
+        } else {
+            // Print delineator
+            std::cout << "----------------------------------------" << std::endl;
+        }
+
+        *nNextRefresh = GetTime() + nRefresh;
+        while (GetTime() < *nNextRefresh) {
+            boost::this_thread::interruption_point();
+            MilliSleep(200);
+        }
+
+        if (isScreen) {
+            // Return to the top of the updating section
+            std::cout << "\e[" << lines << "A";
+        }
+    }
+}
diff --git a/depend/zcash/src/metrics.h b/depend/zcash/src/metrics.h
new file mode 100644
index 000000000..a29621f9a
--- /dev/null
+++ b/depend/zcash/src/metrics.h
@@ -0,0 +1,121 @@
+// Copyright (c) 2016 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_METRICS_H
+#define ZCASH_METRICS_H
+
+#include "uint256.h"
+#include "consensus/params.h"
+
+#include <atomic>
+#include <mutex>
+#include <optional>
+#include <string>
+
+struct AtomicCounter {
+    std::atomic<uint64_t> value;
+
+    AtomicCounter() : value {0} { }
+
+    void increment(){
+        ++value;
+    }
+
+    void decrement(){
+        --value;
+    }
+
+    int get() const {
+        return value.load();
+    }
+};
+
+class AtomicTimer {
+private:
+    std::mutex mtx;
+    uint64_t threads;
+    int64_t start_time;
+    int64_t total_time;
+
+public:
+    AtomicTimer() : threads(0), start_time(0), total_time(0) {}
+
+    /**
+     * Starts timing on first call, and counts the number of calls.
+     */
+    void start();
+
+    /**
+     * Counts number of calls, and stops timing after it has been called as
+     * many times as start().
+     */
+    void stop();
+
+    void zeroize();
+
+    bool running();
+
+    uint64_t threadCount();
+
+    double rate(const AtomicCounter& count);
+};
+
+enum DurationFormat {
+    FULL,
+    REDUCED
+};
+
+extern AtomicCounter transactionsValidated;
+extern AtomicCounter ehSolverRuns;
+extern AtomicCounter solutionTargetChecks;
+extern AtomicTimer miningTimer;
+extern std::atomic<size_t> nSizeReindexed; // valid only during reindex
+extern std::atomic<size_t> nFullSizeToReindex; // valid only during reindex
+
+void TrackMinedBlock(uint256 hash);
+
+void MarkStartTime();
+double GetLocalSolPS();
+int EstimateNetHeight(const Consensus::Params& params, int currentBlockHeight, int64_t currentBlockTime);
+std::optional<int64_t> SecondsLeftToNextEpoch(const Consensus::Params& params, int currentHeight);
+std::string DisplayDuration(int64_t time, DurationFormat format);
+std::string DisplaySize(size_t value);
+std::string DisplayHashRate(double value);
+
+void TriggerRefresh();
+
+void ConnectMetricsScreen();
+void ThreadShowMetricsScreen();
+
+/**
+ * Heart image: https://commons.wikimedia.org/wiki/File:Heart_coraz%C3%B3n.svg
+ * License: CC BY-SA 3.0
+ *
+ * Rendering options:
+ * Zcash: img2txt -W 40 -H 20 -f utf8 -d none -g 0.7 Z-yellow.orange-logo.png
+ * Heart: img2txt -W 40 -H 20 -f utf8 -d none 2000px-Heart_corazón.svg.png
+ */
+const std::string METRICS_ART =
+"                                                                                \n"
+"                                                                                \n"
+"             :88SX@888@@X8:                    8;     %X        X%     ;8       \n"
+"          %%Xt%tt%SSSSS:XXXt@@              X            ::  ::            X    \n"
+"        @S;;tt%%%t    ;;::XXXXSX           %               SS               %   \n"
+"      .t:::;;%8888    88888tXXXX8;        S                                  S  \n"
+"     .%...:::8             8::XXX%;       X                                  X  \n"
+"     8888...:t888888X     8t;;::XX8       8                                  8  \n"
+"    %888888...:::;:8    :Xttt;;;::X@                                            \n"
+"    888888888...:St    8:%%tttt;;;:X       X                                X   \n"
+"    88888888888S8    :%;ttt%%tttt;;X        8                              8    \n"
+"    %888888888%t    8S:;;;tt%%%ttt;8          :                          :      \n"
+"     8t8888888     S8888888Stt%%%t@            ::                      ::       \n"
+"     .@tt888@              8;;ttt@;               t                  t          \n"
+"      .8ttt8@SSSSS    SXXXX%:;;;X;                  8              8            \n"
+"        X8ttt8888%    %88...::X8                      X.        .X              \n"
+"          %8@tt88;8888%8888%8X                          :;    ;:                \n"
+"             :@888@XXX@888:                                tt                   \n"
+"                                                                                \n"
+"                                                                                ";
+
+#endif // ZCASH_METRICS_H
diff --git a/depend/zcash/src/miner.cpp b/depend/zcash/src/miner.cpp
new file mode 100644
index 000000000..600175b14
--- /dev/null
+++ b/depend/zcash/src/miner.cpp
@@ -0,0 +1,1167 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "miner.h"
+#ifdef ENABLE_MINING
+#include "pow/tromp/equi_miner.h"
+#endif
+
+#include "amount.h"
+#include "chainparams.h"
+#include "consensus/consensus.h"
+#include "consensus/funding.h"
+#include "consensus/upgrades.h"
+#include "consensus/validation.h"
+#ifdef ENABLE_MINING
+#include "crypto/equihash.h"
+#endif
+#include "hash.h"
+#include "key_io.h"
+#include "main.h"
+#include "metrics.h"
+#include "net.h"
+#include "zcash/Note.hpp"
+#include "policy/policy.h"
+#include "pow.h"
+#include "primitives/transaction.h"
+#include "random.h"
+#include "timedata.h"
+#include "transaction_builder.h"
+#include "ui_interface.h"
+#include "util.h"
+#include "utilmoneystr.h"
+#include "validationinterface.h"
+
+#include <librustzcash.h>
+
+#include <boost/thread.hpp>
+#include <boost/tuple/tuple.hpp>
+#ifdef ENABLE_MINING
+#include <functional>
+#endif
+#include <mutex>
+
+using namespace std;
+
+//////////////////////////////////////////////////////////////////////////////
+//
+// BitcoinMiner
+//
+
+//
+// Unconfirmed transactions in the memory pool often depend on other
+// transactions in the memory pool. When we select transactions from the
+// pool, we select by highest priority or fee rate, so we might consider
+// transactions that depend on transactions that aren't yet in the block.
+// The COrphan class keeps track of these 'temporary orphans' while
+// CreateBlock is figuring out which transactions to include.
+//
+class COrphan
+{
+public:
+    const CTransaction* ptx;
+    set<uint256> setDependsOn;
+    CFeeRate feeRate;
+    CAmount feePaid;
+    double dPriority;
+
+    COrphan(const CTransaction* ptxIn) : ptx(ptxIn), feeRate(0), feePaid(0), dPriority(0)
+    {
+    }
+};
+
+std::optional<uint64_t> last_block_num_txs;
+std::optional<uint64_t> last_block_size;
+
+// We want to sort transactions by priority and fee rate, so:
+typedef boost::tuple<double, CFeeRate, CAmount, const CTransaction*> TxPriority;
+class TxPriorityCompare
+{
+    bool byFee;
+
+public:
+    TxPriorityCompare(bool _byFee) : byFee(_byFee) { }
+
+    bool operator()(const TxPriority& a, const TxPriority& b)
+    {
+        if (byFee)
+        {
+            if (a.get<1>() == b.get<1>())
+                return a.get<0>() < b.get<0>();
+            return a.get<1>() < b.get<1>();
+        }
+        else
+        {
+            if (a.get<0>() == b.get<0>())
+                return a.get<1>() < b.get<1>();
+            return a.get<0>() < b.get<0>();
+        }
+    }
+};
+
+void UpdateTime(CBlockHeader* pblock, const Consensus::Params& consensusParams, const CBlockIndex* pindexPrev)
+{
+    auto medianTimePast = pindexPrev->GetMedianTimePast();
+    auto nTime = std::max(medianTimePast + 1, GetTime());
+    // See the comment in ContextualCheckBlockHeader() for background.
+    if (consensusParams.FutureTimestampSoftForkActive(pindexPrev->nHeight + 1)) {
+        nTime = std::min(nTime, medianTimePast + MAX_FUTURE_BLOCK_TIME_MTP);
+    }
+    pblock->nTime = nTime;
+
+    // Updating time can change work required on testnet:
+    if (consensusParams.nPowAllowMinDifficultyBlocksAfterHeight != std::nullopt) {
+        pblock->nBits = GetNextWorkRequired(pindexPrev, pblock, consensusParams);
+    }
+}
+
+bool IsShieldedMinerAddress(const MinerAddress& minerAddr) {
+    return !std::holds_alternative<boost::shared_ptr<CReserveScript>>(minerAddr);
+}
+
+class AddFundingStreamValueToTx
+{
+private:
+    CMutableTransaction &mtx;
+    void* ctx;
+    const CAmount fundingStreamValue;
+    const libzcash::Zip212Enabled zip212Enabled;
+public:
+    AddFundingStreamValueToTx(
+            CMutableTransaction &mtx,
+            void* ctx,
+            const CAmount fundingStreamValue,
+            const libzcash::Zip212Enabled zip212Enabled): mtx(mtx), ctx(ctx), fundingStreamValue(fundingStreamValue), zip212Enabled(zip212Enabled) {}
+
+    bool operator()(const libzcash::SaplingPaymentAddress& pa) const {
+        uint256 ovk;
+        auto note = libzcash::SaplingNote(pa, fundingStreamValue, zip212Enabled);
+        auto output = OutputDescriptionInfo(ovk, note, NO_MEMO);
+
+        auto odesc = output.Build(ctx);
+        if (odesc) {
+            mtx.vShieldedOutput.push_back(odesc.value());
+            mtx.valueBalanceSapling -= fundingStreamValue;
+            return true;
+        } else {
+            return false;
+        }
+    }
+
+    bool operator()(const CScript& scriptPubKey) const {
+        mtx.vout.push_back(CTxOut(fundingStreamValue, scriptPubKey));
+        return true;
+    }
+};
+
+
+class AddOutputsToCoinbaseTxAndSign
+{
+private:
+    CMutableTransaction &mtx;
+    const CChainParams &chainparams;
+    const int nHeight;
+    const CAmount nFees;
+
+public:
+    AddOutputsToCoinbaseTxAndSign(
+        CMutableTransaction &mtx,
+        const CChainParams &chainparams,
+        const int nHeight,
+        const CAmount nFees) : mtx(mtx), chainparams(chainparams), nHeight(nHeight), nFees(nFees) {}
+
+    const libzcash::Zip212Enabled GetZip212Flag() const {
+        if (chainparams.GetConsensus().NetworkUpgradeActive(nHeight, Consensus::UPGRADE_CANOPY)) {
+            return libzcash::Zip212Enabled::AfterZip212;
+        } else {
+            return libzcash::Zip212Enabled::BeforeZip212;
+        }
+    }
+
+    CAmount SetFoundersRewardAndGetMinerValue(void* ctx) const {
+        auto block_subsidy = GetBlockSubsidy(nHeight, chainparams.GetConsensus());
+        auto miner_reward = block_subsidy; // founders' reward or funding stream amounts will be subtracted below
+
+        if (nHeight > 0) {
+            if (chainparams.GetConsensus().NetworkUpgradeActive(nHeight, Consensus::UPGRADE_CANOPY)) {
+                auto fundingStreamElements = Consensus::GetActiveFundingStreamElements(
+                    nHeight,
+                    block_subsidy,
+                    chainparams.GetConsensus());
+
+                for (Consensus::FundingStreamElement fselem : fundingStreamElements) {
+                    miner_reward -= fselem.second;
+                    bool added = std::visit(AddFundingStreamValueToTx(mtx, ctx, fselem.second, GetZip212Flag()), fselem.first);
+                    if (!added) {
+                        librustzcash_sapling_proving_ctx_free(ctx);
+                        throw new std::runtime_error("Failed to add funding stream output.");
+                    }
+                }
+            } else if (nHeight <= chainparams.GetConsensus().GetLastFoundersRewardBlockHeight(nHeight)) {
+                // Founders reward is 20% of the block subsidy
+                auto vFoundersReward = miner_reward / 5;
+                // Take some reward away from us
+                miner_reward -= vFoundersReward;
+                // And give it to the founders
+                mtx.vout.push_back(CTxOut(vFoundersReward, chainparams.GetFoundersRewardScriptAtHeight(nHeight)));
+            } else {
+                // Founders reward ends without replacement if Canopy is not activated by the
+                // last Founders' Reward block height + 1.
+            }
+        }
+
+        return miner_reward + nFees;
+    }
+
+    void ComputeBindingSig(void* saplingCtx, std::optional<orchard::UnauthorizedBundle> orchardBundle) const {
+        // Empty output script.
+        uint256 dataToBeSigned;
+        try {
+            if (orchardBundle.has_value()) {
+                // Orchard is only usable with v5+ transactions.
+                dataToBeSigned = ProduceZip244SignatureHash(mtx, {}, orchardBundle.value());
+            } else {
+                CScript scriptCode;
+                PrecomputedTransactionData txdata(mtx, {});
+                dataToBeSigned = SignatureHash(
+                    scriptCode, mtx, NOT_AN_INPUT, SIGHASH_ALL, 0,
+                    CurrentEpochBranchId(nHeight, chainparams.GetConsensus()),
+                    txdata);
+            }
+        } catch (std::logic_error ex) {
+            librustzcash_sapling_proving_ctx_free(saplingCtx);
+            throw ex;
+        }
+
+        if (orchardBundle.has_value()) {
+            auto authorizedBundle = orchardBundle.value().ProveAndSign({}, dataToBeSigned);
+            if (authorizedBundle.has_value()) {
+                mtx.orchardBundle = authorizedBundle.value();
+            } else {
+                librustzcash_sapling_proving_ctx_free(saplingCtx);
+                throw new std::runtime_error("Failed to create Orchard proof or signatures");
+            }
+        }
+
+        bool success = librustzcash_sapling_binding_sig(
+            saplingCtx,
+            mtx.valueBalanceSapling,
+            dataToBeSigned.begin(),
+            mtx.bindingSig.data());
+
+        if (!success) {
+            librustzcash_sapling_proving_ctx_free(saplingCtx);
+            throw new std::runtime_error("An error occurred computing the binding signature.");
+        }
+    }
+
+    // Create Orchard output
+    void operator()(const libzcash::OrchardRawAddress &to) const {
+        auto ctx = librustzcash_sapling_proving_ctx_init();
+
+        // `enableSpends` must be set to `false` for coinbase transactions. This
+        // means the Orchard anchor is unconstrained, so we set it to the empty
+        // tree root via a null (all zeroes) uint256.
+        uint256 orchardAnchor;
+        auto builder = orchard::Builder(false, true, orchardAnchor);
+
+        // Shielded coinbase outputs must be recoverable with an all-zeroes ovk.
+        uint256 ovk;
+        auto miner_reward = SetFoundersRewardAndGetMinerValue(ctx);
+        builder.AddOutput(ovk, to, miner_reward, std::nullopt);
+
+        // orchard::Builder pads to two Actions, but does so using a "no OVK" policy for
+        // dummy outputs, which violates coinbase rules requiring all shielded outputs to
+        // be recoverable. We manually add a dummy output to sidestep this issue.
+        // TODO: If/when we have funding streams going to Orchard recipients, this dummy
+        // output can be removed.
+        RawHDSeed rawSeed(32, 0);
+        GetRandBytes(rawSeed.data(), 32);
+        auto dummyTo = libzcash::OrchardSpendingKey::ForAccount(HDSeed(rawSeed), Params().BIP44CoinType(), 0)
+            .ToFullViewingKey()
+            .ToIncomingViewingKey()
+            .Address(0);
+        builder.AddOutput(ovk, dummyTo, 0, std::nullopt);
+
+        auto bundle = builder.Build();
+        if (!bundle.has_value()) {
+            librustzcash_sapling_proving_ctx_free(ctx);
+            throw new std::runtime_error("Failed to create shielded output for miner");
+        }
+
+        ComputeBindingSig(ctx, std::move(bundle));
+
+        librustzcash_sapling_proving_ctx_free(ctx);
+    }
+
+    // Create shielded output
+    void operator()(const libzcash::SaplingPaymentAddress &pa) const {
+        auto ctx = librustzcash_sapling_proving_ctx_init();
+
+        auto miner_reward = SetFoundersRewardAndGetMinerValue(ctx);
+        mtx.valueBalanceSapling -= miner_reward;
+
+        uint256 ovk;
+
+        auto note = libzcash::SaplingNote(pa, miner_reward, GetZip212Flag());
+        auto output = OutputDescriptionInfo(ovk, note, NO_MEMO);
+
+        auto odesc = output.Build(ctx);
+        if (!odesc) {
+            librustzcash_sapling_proving_ctx_free(ctx);
+            throw new std::runtime_error("Failed to create shielded output for miner");
+        }
+        mtx.vShieldedOutput.push_back(odesc.value());
+
+        ComputeBindingSig(ctx, std::nullopt);
+
+        librustzcash_sapling_proving_ctx_free(ctx);
+    }
+
+    // Create transparent output
+    void operator()(const boost::shared_ptr<CReserveScript> &coinbaseScript) const {
+        // Add the FR output and fetch the miner's output value.
+        auto ctx = librustzcash_sapling_proving_ctx_init();
+
+        // Miner output will be vout[0]; Founders' Reward & funding stream outputs
+        // will follow.
+        mtx.vout.resize(1);
+        auto value = SetFoundersRewardAndGetMinerValue(ctx);
+
+        // Now fill in the miner's output.
+        mtx.vout[0] = CTxOut(value, coinbaseScript->reserveScript);
+
+        if (mtx.vShieldedOutput.size() > 0) {
+            ComputeBindingSig(ctx, std::nullopt);
+        }
+
+        librustzcash_sapling_proving_ctx_free(ctx);
+    }
+};
+
+CMutableTransaction CreateCoinbaseTransaction(const CChainParams& chainparams, CAmount nFees, const MinerAddress& minerAddress, int nHeight)
+{
+        CMutableTransaction mtx = CreateNewContextualCMutableTransaction(chainparams.GetConsensus(), nHeight);
+        mtx.vin.resize(1);
+        mtx.vin[0].prevout.SetNull();
+        if (chainparams.GetConsensus().NetworkUpgradeActive(nHeight, Consensus::UPGRADE_NU5)) {
+            // ZIP 203: From NU5 onwards, nExpiryHeight is set to the block height in
+            // coinbase transactions.
+            mtx.nExpiryHeight = nHeight;
+        } else {
+            // Set to 0 so expiry height does not apply to coinbase txs
+            mtx.nExpiryHeight = 0;
+        }
+
+        // Add outputs and sign
+        std::visit(
+            AddOutputsToCoinbaseTxAndSign(mtx, chainparams, nHeight, nFees),
+            minerAddress);
+
+        mtx.vin[0].scriptSig = CScript() << nHeight << OP_0;
+        return mtx;
+}
+
+CBlockTemplate* CreateNewBlock(const CChainParams& chainparams, const MinerAddress& minerAddress, const std::optional<CMutableTransaction>& next_cb_mtx)
+{
+    // Create new block
+    std::unique_ptr<CBlockTemplate> pblocktemplate(new CBlockTemplate());
+    if(!pblocktemplate.get())
+        return NULL;
+    CBlock *pblock = &pblocktemplate->block; // pointer for convenience
+
+    // -regtest only: allow overriding block.nVersion with
+    // -blockversion=N to test forking scenarios
+    if (chainparams.MineBlocksOnDemand())
+        pblock->nVersion = GetArg("-blockversion", pblock->nVersion);
+
+    // Add dummy coinbase tx as first transaction
+    pblock->vtx.push_back(CTransaction());
+    pblocktemplate->vTxFees.push_back(-1); // updated at end
+    pblocktemplate->vTxSigOps.push_back(-1); // updated at end
+
+    // Largest block you're willing to create:
+    unsigned int nBlockMaxSize = GetArg("-blockmaxsize", DEFAULT_BLOCK_MAX_SIZE);
+    // Limit to between 1K and MAX_BLOCK_SIZE-1K for sanity:
+    nBlockMaxSize = std::max((unsigned int)1000, std::min((unsigned int)(MAX_BLOCK_SIZE-1000), nBlockMaxSize));
+
+    // How much of the block should be dedicated to high-priority transactions,
+    // included regardless of the fees they pay
+    unsigned int nBlockPrioritySize = GetArg("-blockprioritysize", DEFAULT_BLOCK_PRIORITY_SIZE);
+    nBlockPrioritySize = std::min(nBlockMaxSize, nBlockPrioritySize);
+
+    // Minimum block size you want to create; block will be filled with free transactions
+    // until there are no more or the block reaches this size:
+    unsigned int nBlockMinSize = GetArg("-blockminsize", DEFAULT_BLOCK_MIN_SIZE);
+    nBlockMinSize = std::min(nBlockMaxSize, nBlockMinSize);
+
+    // Collect memory pool transactions into the block
+    CAmount nFees = 0;
+
+    {
+        LOCK2(cs_main, mempool.cs);
+        CBlockIndex* pindexPrev = chainActive.Tip();
+        const int nHeight = pindexPrev->nHeight + 1;
+        uint32_t consensusBranchId = CurrentEpochBranchId(nHeight, chainparams.GetConsensus());
+        pblock->nTime = GetTime();
+        const int64_t nMedianTimePast = pindexPrev->GetMedianTimePast();
+        CCoinsViewCache view(pcoinsTip);
+
+        SaplingMerkleTree sapling_tree;
+        assert(view.GetSaplingAnchorAt(view.GetBestAnchor(SAPLING), sapling_tree));
+
+        // Priority order to process transactions
+        list<COrphan> vOrphan; // list memory doesn't move
+        map<uint256, vector<COrphan*> > mapDependers;
+        bool fPrintPriority = GetBoolArg("-printpriority", DEFAULT_PRINTPRIORITY);
+
+        // This vector will be sorted into a priority queue:
+        vector<TxPriority> vecPriority;
+        vecPriority.reserve(mempool.mapTx.size());
+
+        // If we're given a coinbase tx, it's been precomputed, its fees are zero,
+        // so we can't include any mempool transactions; this will be an empty block.
+        if (!next_cb_mtx) {
+            for (CTxMemPool::indexed_transaction_set::iterator mi = mempool.mapTx.begin();
+                mi != mempool.mapTx.end(); ++mi)
+            {
+                const CTransaction& tx = mi->GetTx();
+
+                int64_t nLockTimeCutoff = (STANDARD_LOCKTIME_VERIFY_FLAGS & LOCKTIME_MEDIAN_TIME_PAST)
+                                        ? nMedianTimePast
+                                        : pblock->GetBlockTime();
+
+                if (tx.IsCoinBase() || !IsFinalTx(tx, nHeight, nLockTimeCutoff) || IsExpiredTx(tx, nHeight))
+                    continue;
+
+                COrphan* porphan = NULL;
+                double dPriority = 0;
+                CAmount nTotalIn = 0;
+                bool fMissingInputs = false;
+                for (const CTxIn& txin : tx.vin)
+                {
+                    // Read prev transaction
+                    if (!view.HaveCoins(txin.prevout.hash))
+                    {
+                        LogPrintf("INFO: missing coins for %s", txin.prevout.hash.GetHex());
+                        // This should never happen; all transactions in the memory
+                        // pool should connect to either transactions in the chain
+                        // or other transactions in the memory pool.
+                        if (!mempool.mapTx.count(txin.prevout.hash))
+                        {
+                            LogPrintf("ERROR: mempool transaction missing input\n");
+                            if (fDebug) assert("mempool transaction missing input" == 0);
+                            fMissingInputs = true;
+                            if (porphan)
+                                vOrphan.pop_back();
+                            break;
+                        }
+
+                        // Has to wait for dependencies
+                        if (!porphan)
+                        {
+                            // Use list for automatic deletion
+                            vOrphan.push_back(COrphan(&tx));
+                            porphan = &vOrphan.back();
+                        }
+                        mapDependers[txin.prevout.hash].push_back(porphan);
+                        porphan->setDependsOn.insert(txin.prevout.hash);
+                        nTotalIn += mempool.mapTx.find(txin.prevout.hash)->GetTx().vout[txin.prevout.n].nValue;
+                        continue;
+                    }
+                    const CCoins* coins = view.AccessCoins(txin.prevout.hash);
+                    assert(coins);
+
+                    CAmount nValueIn = coins->vout[txin.prevout.n].nValue;
+                    nTotalIn += nValueIn;
+
+                    int nConf = nHeight - coins->nHeight;
+
+                    dPriority += (double)nValueIn * nConf;
+                }
+                nTotalIn += tx.GetShieldedValueIn();
+
+                if (fMissingInputs) continue;
+
+                // Priority is sum(valuein * age) / modified_txsize
+                unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
+                dPriority = tx.ComputePriority(dPriority, nTxSize);
+
+                uint256 hash = tx.GetHash();
+                mempool.ApplyDeltas(hash, dPriority, nTotalIn);
+
+                CAmount feePaid = nTotalIn - tx.GetValueOut();
+                CFeeRate feeRate(feePaid, nTxSize);
+
+                if (porphan)
+                {
+                    porphan->dPriority = dPriority;
+                    porphan->feeRate = feeRate;
+                    porphan->feePaid = feePaid;
+                }
+                else
+                    vecPriority.push_back(TxPriority(dPriority, feeRate, feePaid, &(mi->GetTx())));
+            }
+        }
+
+        // Collect transactions into block
+        uint64_t nBlockSize = 1000;
+        uint64_t nBlockTx = 0;
+        int nBlockSigOps = 100;
+        bool fSortedByFee = (nBlockPrioritySize <= 0);
+
+        TxPriorityCompare comparer(fSortedByFee);
+        std::make_heap(vecPriority.begin(), vecPriority.end(), comparer);
+
+        // We want to track the value pool, but if the miner gets
+        // invoked on an old block before the hardcoded fallback
+        // is active we don't want to trip up any assertions. So,
+        // we only adhere to the turnstile (as a miner) if we
+        // actually have all of the information necessary to do
+        // so.
+        CAmount sproutValue = 0;
+        CAmount saplingValue = 0;
+        CAmount orchardValue = 0;
+        bool monitoring_pool_balances = true;
+        if (chainparams.ZIP209Enabled()) {
+            if (pindexPrev->nChainSproutValue) {
+                sproutValue = *pindexPrev->nChainSproutValue;
+            } else {
+                monitoring_pool_balances = false;
+            }
+            if (pindexPrev->nChainSaplingValue) {
+                saplingValue = *pindexPrev->nChainSaplingValue;
+            } else {
+                monitoring_pool_balances = false;
+            }
+            if (pindexPrev->nChainOrchardValue) {
+                orchardValue = *pindexPrev->nChainOrchardValue;
+            } else {
+                monitoring_pool_balances = false;
+            }
+        }
+
+        LogPrintf("%s: Evaluating %u transactions for inclusion in block.", __func__, vecPriority.size());
+        while (!vecPriority.empty())
+        {
+            // Take highest priority transaction off the priority queue:
+            double dPriority = vecPriority.front().get<0>();
+            CFeeRate feeRate = vecPriority.front().get<1>();
+            CAmount feePaid = vecPriority.front().get<2>();
+            const CTransaction& tx = *(vecPriority.front().get<3>());
+            const uint256& hash = tx.GetHash();
+
+            std::pop_heap(vecPriority.begin(), vecPriority.end(), comparer);
+            vecPriority.pop_back();
+
+            // Size limits
+            unsigned int nTxSize = ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION);
+            if (nBlockSize + nTxSize >= nBlockMaxSize) {
+                LogPrintf("%s: skipping tx %s: exceeded maximum block size %u.", __func__, hash.GetHex(), nBlockMaxSize);
+                continue;
+            }
+
+            // Legacy limits on sigOps:
+            unsigned int nTxSigOps = GetLegacySigOpCount(tx);
+            if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS) {
+                LogPrintf("%s: skipping tx %s: exceeds legacy max sigops %u.", __func__, hash.GetHex(), MAX_BLOCK_SIGOPS);
+                continue;
+            }
+
+            // Skip free transactions if we're past the minimum block size:
+            double dPriorityDelta = 0;
+            CAmount nFeeDelta = 0;
+            mempool.ApplyDeltas(hash, dPriorityDelta, nFeeDelta);
+            if (fSortedByFee &&
+                (dPriorityDelta <= 0) &&
+                (nFeeDelta <= 0) &&
+                (feeRate < ::minRelayTxFee) &&
+                (feePaid < DEFAULT_FEE) &&
+                (nBlockSize + nTxSize >= nBlockMinSize))
+            {
+                LogPrintf(
+                        "%s: skipping free tx %s (fee is %i; %s) with size %u, current block size is %u & already have minimum block size %u.",
+                        __func__, hash.GetHex(),
+                        feePaid, feeRate.ToString(), nTxSize, nBlockSize, nBlockMinSize);
+                continue;
+            }
+
+            // Prioritise by fee once past the priority size or we run out of high-priority
+            // transactions:
+            if (!fSortedByFee &&
+                ((nBlockSize + nTxSize >= nBlockPrioritySize) || !AllowFree(dPriority)))
+            {
+                fSortedByFee = true;
+                comparer = TxPriorityCompare(fSortedByFee);
+                std::make_heap(vecPriority.begin(), vecPriority.end(), comparer);
+            }
+
+            if (!view.HaveInputs(tx)) {
+                LogPrintf("%s: not including tx %s; missing inputs.", __func__, hash.GetHex());
+                continue;
+            }
+
+            CAmount nTxFees = view.GetValueIn(tx)-tx.GetValueOut();
+
+            nTxSigOps += GetP2SHSigOpCount(tx, view);
+            if (nBlockSigOps + nTxSigOps >= MAX_BLOCK_SIGOPS) {
+                LogPrintf("%s: skipping tx %s: exceeds p2sh max sigops %u.", __func__, hash.GetHex(), MAX_BLOCK_SIGOPS);
+                continue;
+            }
+
+            std::vector<CTxOut> allPrevOutputs;
+            for (const auto& input : tx.vin) {
+                allPrevOutputs.push_back(view.GetOutputFor(input));
+            }
+
+            // Note that flags: we don't want to set mempool/IsStandard()
+            // policy here, but we still have to ensure that the block we
+            // create only contains transactions that are valid in new blocks.
+            CValidationState state;
+            PrecomputedTransactionData txdata(tx, allPrevOutputs);
+            if (!ContextualCheckInputs(tx, state, view, true, MANDATORY_SCRIPT_VERIFY_FLAGS, true, txdata, chainparams.GetConsensus(), consensusBranchId)) {
+                LogPrintf("%s: skipping tx %s: Failed contextual inputs check.", __func__, hash.GetHex());
+                continue;
+            }
+
+            if (chainparams.ZIP209Enabled() && monitoring_pool_balances) {
+                // Does this transaction lead to a turnstile violation?
+
+                CAmount sproutValueDummy = sproutValue;
+                CAmount saplingValueDummy = saplingValue;
+                CAmount orchardValueDummy = orchardValue;
+
+                saplingValueDummy += -tx.GetValueBalanceSapling();
+                orchardValueDummy += -tx.GetOrchardBundle().GetValueBalance();
+
+                for (auto js : tx.vJoinSplit) {
+                    sproutValueDummy += js.vpub_old;
+                    sproutValueDummy -= js.vpub_new;
+                }
+
+                if (sproutValueDummy < 0) {
+                    LogPrintf("%s: tx %s appears to violate Sprout turnstile\n", __func__, hash.GetHex());
+                    continue;
+                }
+                if (saplingValueDummy < 0) {
+                    LogPrintf("%s: tx %s appears to violate Sapling turnstile\n", __func__, hash.GetHex());
+                    continue;
+                }
+                if (orchardValueDummy < 0) {
+                    LogPrintf("%s: tx %s appears to violate Orchard turnstile\n", __func__, hash.GetHex());
+                    continue;
+                }
+
+                sproutValue = sproutValueDummy;
+                saplingValue = saplingValueDummy;
+                orchardValue = orchardValueDummy;
+            }
+
+            UpdateCoins(tx, view, nHeight);
+
+            // Added
+            pblock->vtx.push_back(tx);
+            pblocktemplate->vTxFees.push_back(nTxFees);
+            pblocktemplate->vTxSigOps.push_back(nTxSigOps);
+            nBlockSize += nTxSize;
+            ++nBlockTx;
+            nBlockSigOps += nTxSigOps;
+            nFees += nTxFees;
+
+            if (fPrintPriority)
+            {
+                LogPrintf("%s: priority %.1f fee %s txid %s\n",
+                    __func__, dPriority, feeRate.ToString(), hash.GetHex());
+            }
+
+            // Add transactions that depend on this one to the priority queue
+            if (mapDependers.count(hash))
+            {
+                for (COrphan* porphan : mapDependers[hash])
+                {
+                    if (!porphan->setDependsOn.empty())
+                    {
+                        porphan->setDependsOn.erase(hash);
+                        if (porphan->setDependsOn.empty())
+                        {
+                            vecPriority.push_back(TxPriority(porphan->dPriority, porphan->feeRate, porphan->feePaid, porphan->ptx));
+                            std::push_heap(vecPriority.begin(), vecPriority.end(), comparer);
+                        }
+                    }
+                }
+            }
+        }
+
+        last_block_num_txs = nBlockTx;
+        last_block_size = nBlockSize;
+        LogPrintf("%s: total tx: %u; total size: %u (excluding coinbase)", __func__, nBlockTx, nBlockSize);
+
+        // Create coinbase tx
+        if (next_cb_mtx) {
+            pblock->vtx[0] = *next_cb_mtx;
+        } else {
+            pblock->vtx[0] = CreateCoinbaseTransaction(chainparams, nFees, minerAddress, nHeight);
+        }
+        pblocktemplate->vTxFees[0] = -nFees;
+
+        // Update the Sapling commitment tree.
+        for (const CTransaction& tx : pblock->vtx) {
+            for (const OutputDescription& odesc : tx.vShieldedOutput) {
+                sapling_tree.append(odesc.cmu);
+            }
+        }
+
+        // Randomise nonce
+        arith_uint256 nonce = UintToArith256(GetRandHash());
+        // Clear the top and bottom 16 bits (for local use as thread flags and counters)
+        nonce <<= 32;
+        nonce >>= 16;
+        pblock->nNonce = ArithToUint256(nonce);
+
+        uint32_t prevConsensusBranchId = CurrentEpochBranchId(pindexPrev->nHeight, chainparams.GetConsensus());
+
+        // Fill in header
+        pblock->hashPrevBlock  = pindexPrev->GetBlockHash();
+        if (chainparams.GetConsensus().NetworkUpgradeActive(nHeight, Consensus::UPGRADE_NU5)) {
+            // hashBlockCommitments depends on the block transactions, so we have to
+            // update it whenever the coinbase transaction changes.
+            //
+            // - For the internal miner (either directly or via the `generate` RPC), this
+            //   will occur in `IncrementExtraNonce()`, like for `hashMerkleRoot`.
+            // - For `getblocktemplate`, we have two sets of fields to handle:
+            //   - The `defaultroots` fields, which contain both the default value (if
+            //     nothing in the template is altered), and the roots that can be used to
+            //     recalculate it (if some or all of the template is altered).
+            //   - The legacy `finalsaplingroothash`, `lightclientroothash`, and
+            //     `blockcommitmentshash` fields, which had the semantics of "place this
+            //     value into the block header and things will work" (except for in
+            //     v4.6.0 where they were accidentally set to always be the NU5 value).
+            //
+            // To accommodate all use cases, we calculate the `hashBlockCommitments`
+            // default value here (unlike `hashMerkleRoot`), and additionally cache the
+            // values necessary to recalculate it.
+            pblocktemplate->hashChainHistoryRoot = view.GetHistoryRoot(prevConsensusBranchId);
+            pblocktemplate->hashAuthDataRoot = pblock->BuildAuthDataMerkleTree();
+            pblock->hashBlockCommitments = DeriveBlockCommitmentsHash(
+                    pblocktemplate->hashChainHistoryRoot,
+                    pblocktemplate->hashAuthDataRoot);
+        } else if (IsActivationHeight(nHeight, chainparams.GetConsensus(), Consensus::UPGRADE_HEARTWOOD)) {
+            pblocktemplate->hashChainHistoryRoot.SetNull();
+            pblocktemplate->hashAuthDataRoot.SetNull();
+            pblock->hashBlockCommitments.SetNull();
+        } else if (chainparams.GetConsensus().NetworkUpgradeActive(nHeight, Consensus::UPGRADE_HEARTWOOD)) {
+            pblocktemplate->hashChainHistoryRoot = view.GetHistoryRoot(prevConsensusBranchId);
+            pblocktemplate->hashAuthDataRoot.SetNull();
+            pblock->hashBlockCommitments = pblocktemplate->hashChainHistoryRoot;
+        } else {
+            pblocktemplate->hashChainHistoryRoot.SetNull();
+            pblocktemplate->hashAuthDataRoot.SetNull();
+            pblock->hashBlockCommitments = sapling_tree.root();
+        }
+        UpdateTime(pblock, chainparams.GetConsensus(), pindexPrev);
+        pblock->nBits          = GetNextWorkRequired(pindexPrev, pblock, chainparams.GetConsensus());
+        pblock->nSolution.clear();
+        pblocktemplate->vTxSigOps[0] = GetLegacySigOpCount(pblock->vtx[0]);
+
+        CValidationState state;
+        if (!TestBlockValidity(state, chainparams, *pblock, pindexPrev, false))
+            throw std::runtime_error(std::string("CreateNewBlock(): TestBlockValidity failed: ") + state.GetRejectReason());
+    }
+
+    return pblocktemplate.release();
+}
+
+//////////////////////////////////////////////////////////////////////////////
+//
+// Internal miner
+//
+
+#ifdef ENABLE_MINING
+
+class MinerAddressScript : public CReserveScript
+{
+    // CReserveScript requires implementing this function, so that if an
+    // internal (not-visible) wallet address is used, the wallet can mark it as
+    // important when a block is mined (so it then appears to the user).
+    // If -mineraddress is set, the user already knows about and is managing the
+    // address, so we don't need to do anything here.
+    void KeepScript() {}
+};
+
+std::optional<MinerAddress> ExtractMinerAddress::operator()(const CKeyID &keyID) const {
+    boost::shared_ptr<MinerAddressScript> mAddr(new MinerAddressScript());
+    mAddr->reserveScript = CScript() << OP_DUP << OP_HASH160 << ToByteVector(keyID) << OP_EQUALVERIFY << OP_CHECKSIG;
+    return mAddr;
+}
+std::optional<MinerAddress> ExtractMinerAddress::operator()(const CScriptID &addr) const {
+    return std::nullopt;
+}
+std::optional<MinerAddress> ExtractMinerAddress::operator()(const libzcash::SproutPaymentAddress &addr) const {
+    return std::nullopt;
+}
+std::optional<MinerAddress> ExtractMinerAddress::operator()(const libzcash::SaplingPaymentAddress &addr) const {
+    return addr;
+}
+std::optional<MinerAddress> ExtractMinerAddress::operator()(const libzcash::UnifiedAddress &addr) const {
+    auto preferred = addr.GetPreferredRecipientAddress(consensus, height);
+    if (preferred.has_value()) {
+        std::optional<MinerAddress> ret;
+        std::visit(match {
+            [&](const libzcash::OrchardRawAddress addr) { ret = MinerAddress(addr); },
+            [&](const libzcash::SaplingPaymentAddress addr) { ret = MinerAddress(addr); },
+            [&](const CKeyID keyID) { ret = operator()(keyID); },
+            [&](const auto other) { ret = std::nullopt; }
+        }, preferred.value());
+        return ret;
+    } else {
+        return std::nullopt;
+    }
+}
+
+
+void GetMinerAddress(std::optional<MinerAddress> &minerAddress)
+{
+    KeyIO keyIO(Params());
+
+    // If the user sets a UA miner address with an Orchard component, we want to ensure we
+    // start using it once we reach that height.
+    int height;
+    {
+        LOCK(cs_main);
+        height = chainActive.Height() + 1;
+    }
+
+    auto mAddrArg = GetArg("-mineraddress", "");
+    auto zaddr0 = keyIO.DecodePaymentAddress(mAddrArg);
+    if (zaddr0.has_value()) {
+        auto zaddr = std::visit(ExtractMinerAddress(Params().GetConsensus(), height), zaddr0.value());
+        if (zaddr.has_value()) {
+            minerAddress = zaddr.value();
+        }
+    }
+}
+
+void IncrementExtraNonce(
+    CBlockTemplate* pblocktemplate,
+    const CBlockIndex* pindexPrev,
+    unsigned int& nExtraNonce,
+    const Consensus::Params& consensusParams)
+{
+    CBlock *pblock = &pblocktemplate->block;
+    // Update nExtraNonce
+    static uint256 hashPrevBlock;
+    if (hashPrevBlock != pblock->hashPrevBlock)
+    {
+        nExtraNonce = 0;
+        hashPrevBlock = pblock->hashPrevBlock;
+    }
+    ++nExtraNonce;
+    unsigned int nHeight = pindexPrev->nHeight+1; // Height first in coinbase required for block.version=2
+    CMutableTransaction txCoinbase(pblock->vtx[0]);
+    txCoinbase.vin[0].scriptSig = (CScript() << nHeight << CScriptNum(nExtraNonce)) + COINBASE_FLAGS;
+    assert(txCoinbase.vin[0].scriptSig.size() <= 100);
+
+    pblock->vtx[0] = txCoinbase;
+    pblock->hashMerkleRoot = pblock->BuildMerkleTree();
+    if (consensusParams.NetworkUpgradeActive(nHeight, Consensus::UPGRADE_NU5)) {
+        pblocktemplate->hashAuthDataRoot = pblock->BuildAuthDataMerkleTree();
+        pblock->hashBlockCommitments = DeriveBlockCommitmentsHash(
+            pblocktemplate->hashChainHistoryRoot,
+            pblocktemplate->hashAuthDataRoot);
+    }
+}
+
+static bool ProcessBlockFound(const CBlock* pblock, const CChainParams& chainparams)
+{
+    LogPrintf("%s\n", pblock->ToString());
+    LogPrintf("generated %s\n", FormatMoney(pblock->vtx[0].vout[0].nValue));
+
+    // Found a solution
+    {
+        LOCK(cs_main);
+        if (pblock->hashPrevBlock != chainActive.Tip()->GetBlockHash())
+            return error("ZcashMiner: generated block is stale");
+    }
+
+    // Inform about the new block
+    GetMainSignals().BlockFound(pblock->GetHash());
+
+    // Process this block the same as if we had received it from another node
+    CValidationState state;
+    if (!ProcessNewBlock(state, chainparams, NULL, pblock, true, NULL))
+        return error("ZcashMiner: ProcessNewBlock, block not accepted");
+
+    TrackMinedBlock(pblock->GetHash());
+
+    return true;
+}
+
+void static BitcoinMiner(const CChainParams& chainparams)
+{
+    LogPrintf("ZcashMiner started\n");
+    SetThreadPriority(THREAD_PRIORITY_LOWEST);
+    RenameThread("zcash-miner");
+
+    // Each thread has its own counter
+    unsigned int nExtraNonce = 0;
+
+    std::optional<MinerAddress> maybeMinerAddress;
+    GetMainSignals().AddressForMining(maybeMinerAddress);
+
+    unsigned int n = chainparams.GetConsensus().nEquihashN;
+    unsigned int k = chainparams.GetConsensus().nEquihashK;
+
+    std::string solver = GetArg("-equihashsolver", "default");
+    assert(solver == "tromp" || solver == "default");
+    LogPrint("pow", "Using Equihash solver \"%s\" with n = %u, k = %u\n", solver, n, k);
+
+    std::mutex m_cs;
+    bool cancelSolver = false;
+    boost::signals2::connection c = uiInterface.NotifyBlockTip.connect(
+        [&m_cs, &cancelSolver](bool, const CBlockIndex *) mutable {
+            std::lock_guard<std::mutex> lock{m_cs};
+            cancelSolver = true;
+        }
+    );
+    miningTimer.start();
+
+    try {
+        // Throw an error if no address valid for mining was provided.
+        if (!(maybeMinerAddress.has_value() && std::visit(IsValidMinerAddress(), maybeMinerAddress.value()))) {
+            throw std::runtime_error("No miner address available (mining requires a wallet or -mineraddress)");
+        }
+        auto minerAddress = maybeMinerAddress.value();
+
+        while (true) {
+            if (chainparams.MiningRequiresPeers()) {
+                // Busy-wait for the network to come online so we don't waste time mining
+                // on an obsolete chain. In regtest mode we expect to fly solo.
+                miningTimer.stop();
+                do {
+                    bool fvNodesEmpty;
+                    {
+                        LOCK(cs_vNodes);
+                        fvNodesEmpty = vNodes.empty();
+                    }
+                    if (!fvNodesEmpty && !IsInitialBlockDownload(chainparams.GetConsensus()))
+                        break;
+                    MilliSleep(1000);
+                } while (true);
+                miningTimer.start();
+            }
+
+            //
+            // Create new block
+            //
+            unsigned int nTransactionsUpdatedLast = mempool.GetTransactionsUpdated();
+            CBlockIndex* pindexPrev;
+            {
+                LOCK(cs_main);
+                pindexPrev = chainActive.Tip();
+            }
+
+            // If we don't have a valid chain tip to work from, wait and try again.
+            if (pindexPrev == nullptr) {
+                MilliSleep(1000);
+                continue;
+            }
+
+            unique_ptr<CBlockTemplate> pblocktemplate(CreateNewBlock(chainparams, minerAddress));
+            if (!pblocktemplate.get())
+            {
+                if (GetArg("-mineraddress", "").empty()) {
+                    LogPrintf("Error in ZcashMiner: Keypool ran out, please call keypoolrefill before restarting the mining thread\n");
+                } else {
+                    // Should never reach here, because -mineraddress validity is checked in init.cpp
+                    LogPrintf("Error in ZcashMiner: Invalid -mineraddress\n");
+                }
+                return;
+            }
+            CBlock *pblock = &pblocktemplate->block;
+            IncrementExtraNonce(pblocktemplate.get(), pindexPrev, nExtraNonce, chainparams.GetConsensus());
+
+            LogPrintf("Running ZcashMiner with %u transactions in block (%u bytes)\n", pblock->vtx.size(),
+                ::GetSerializeSize(*pblock, SER_NETWORK, PROTOCOL_VERSION));
+
+            //
+            // Search
+            //
+            int64_t nStart = GetTime();
+            arith_uint256 hashTarget = arith_uint256().SetCompact(pblock->nBits);
+
+            while (true) {
+                // Hash state
+                eh_HashState state;
+                EhInitialiseState(n, k, state);
+
+                // I = the block header minus nonce and solution.
+                CEquihashInput I{*pblock};
+                CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+                ss << I;
+
+                // H(I||...
+                state.Update((unsigned char*)&ss[0], ss.size());
+
+                // H(I||V||...
+                eh_HashState curr_state;
+                curr_state = state;
+                curr_state.Update(pblock->nNonce.begin(), pblock->nNonce.size());
+
+                // (x_1, x_2, ...) = A(I, V, n, k)
+                LogPrint("pow", "Running Equihash solver \"%s\" with nNonce = %s\n",
+                         solver, pblock->nNonce.ToString());
+
+                std::function<bool(std::vector<unsigned char>)> validBlock =
+                        [&pblock, &hashTarget, &chainparams, &m_cs, &cancelSolver, &minerAddress]
+                        (std::vector<unsigned char> soln) {
+                    // Write the solution to the hash and compute the result.
+                    LogPrint("pow", "- Checking solution against target\n");
+                    pblock->nSolution = soln;
+                    solutionTargetChecks.increment();
+
+                    if (UintToArith256(pblock->GetHash()) > hashTarget) {
+                        return false;
+                    }
+
+                    // Found a solution
+                    SetThreadPriority(THREAD_PRIORITY_NORMAL);
+                    LogPrintf("ZcashMiner:\n");
+                    LogPrintf("proof-of-work found  \n  hash: %s  \ntarget: %s\n", pblock->GetHash().GetHex(), hashTarget.GetHex());
+                    if (ProcessBlockFound(pblock, chainparams)) {
+                        // Ignore chain updates caused by us
+                        std::lock_guard<std::mutex> lock{m_cs};
+                        cancelSolver = false;
+                    }
+                    SetThreadPriority(THREAD_PRIORITY_LOWEST);
+                    std::visit(KeepMinerAddress(), minerAddress);
+
+                    // In regression test mode, stop mining after a block is found.
+                    if (chainparams.MineBlocksOnDemand()) {
+                        // Increment here because throwing skips the call below
+                        ehSolverRuns.increment();
+                        throw boost::thread_interrupted();
+                    }
+
+                    return true;
+                };
+                std::function<bool(EhSolverCancelCheck)> cancelled = [&m_cs, &cancelSolver](EhSolverCancelCheck pos) {
+                    std::lock_guard<std::mutex> lock{m_cs};
+                    return cancelSolver;
+                };
+
+                // TODO: factor this out into a function with the same API for each solver.
+                if (solver == "tromp") {
+                    // Create solver and initialize it.
+                    equi eq(1);
+                    eq.setstate(curr_state.inner.get());
+
+                    // Initialization done, start algo driver.
+                    eq.digit0(0);
+                    eq.xfull = eq.bfull = eq.hfull = 0;
+                    eq.showbsizes(0);
+                    for (u32 r = 1; r < WK; r++) {
+                        (r&1) ? eq.digitodd(r, 0) : eq.digiteven(r, 0);
+                        eq.xfull = eq.bfull = eq.hfull = 0;
+                        eq.showbsizes(r);
+                    }
+                    eq.digitK(0);
+                    ehSolverRuns.increment();
+
+                    // Convert solution indices to byte array (decompress) and pass it to validBlock method.
+                    for (size_t s = 0; s < eq.nsols; s++) {
+                        LogPrint("pow", "Checking solution %d\n", s+1);
+                        std::vector<eh_index> index_vector(PROOFSIZE);
+                        for (size_t i = 0; i < PROOFSIZE; i++) {
+                            index_vector[i] = eq.sols[s][i];
+                        }
+                        std::vector<unsigned char> sol_char = GetMinimalFromIndices(index_vector, DIGITBITS);
+
+                        if (validBlock(sol_char)) {
+                            // If we find a POW solution, do not try other solutions
+                            // because they become invalid as we created a new block in blockchain.
+                            break;
+                        }
+                    }
+                } else {
+                    try {
+                        // If we find a valid block, we rebuild
+                        bool found = EhOptimisedSolve(n, k, curr_state, validBlock, cancelled);
+                        ehSolverRuns.increment();
+                        if (found) {
+                            break;
+                        }
+                    } catch (EhSolverCancelledException&) {
+                        LogPrint("pow", "Equihash solver cancelled\n");
+                        std::lock_guard<std::mutex> lock{m_cs};
+                        cancelSolver = false;
+                    }
+                }
+
+                // Check for stop or if block needs to be rebuilt
+                boost::this_thread::interruption_point();
+                // Regtest mode doesn't require peers
+                if (vNodes.empty() && chainparams.MiningRequiresPeers())
+                    break;
+                if ((UintToArith256(pblock->nNonce) & 0xffff) == 0xffff)
+                    break;
+                if (mempool.GetTransactionsUpdated() != nTransactionsUpdatedLast && GetTime() - nStart > 60)
+                    break;
+                if (pindexPrev != chainActive.Tip())
+                    break;
+
+                // Update nNonce and nTime
+                pblock->nNonce = ArithToUint256(UintToArith256(pblock->nNonce) + 1);
+                UpdateTime(pblock, chainparams.GetConsensus(), pindexPrev);
+                if (chainparams.GetConsensus().nPowAllowMinDifficultyBlocksAfterHeight != std::nullopt)
+                {
+                    // Changing pblock->nTime can change work required on testnet:
+                    hashTarget.SetCompact(pblock->nBits);
+                }
+            }
+        }
+    }
+    catch (const boost::thread_interrupted&)
+    {
+        miningTimer.stop();
+        c.disconnect();
+        LogPrintf("ZcashMiner terminated\n");
+        throw;
+    }
+    catch (const std::runtime_error &e)
+    {
+        miningTimer.stop();
+        c.disconnect();
+        LogPrintf("ZcashMiner runtime error: %s\n", e.what());
+        return;
+    }
+    miningTimer.stop();
+    c.disconnect();
+}
+
+void GenerateBitcoins(bool fGenerate, int nThreads, const CChainParams& chainparams)
+{
+    static boost::thread_group* minerThreads = NULL;
+
+    if (nThreads < 0)
+        nThreads = GetNumCores();
+
+    if (minerThreads != NULL)
+    {
+        minerThreads->interrupt_all();
+        minerThreads->join_all();
+        delete minerThreads;
+        minerThreads = NULL;
+    }
+
+    if (nThreads == 0 || !fGenerate)
+        return;
+
+    minerThreads = new boost::thread_group();
+    for (int i = 0; i < nThreads; i++) {
+        minerThreads->create_thread(boost::bind(&BitcoinMiner, boost::cref(chainparams)));
+    }
+}
+
+#endif // ENABLE_MINING
diff --git a/depend/zcash/src/miner.h b/depend/zcash/src/miner.h
new file mode 100644
index 000000000..daa9689b6
--- /dev/null
+++ b/depend/zcash/src/miner.h
@@ -0,0 +1,114 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_MINER_H
+#define BITCOIN_MINER_H
+
+#include "primitives/block.h"
+
+#include <stdint.h>
+#include <variant>
+
+#include <boost/shared_ptr.hpp>
+
+class CBlockIndex;
+class CChainParams;
+class CScript;
+namespace Consensus { struct Params; };
+
+static const bool DEFAULT_GENERATE = false;
+static const int DEFAULT_GENERATE_THREADS = 1;
+
+static const bool DEFAULT_PRINTPRIORITY = false;
+
+typedef std::variant<
+    libzcash::OrchardRawAddress,
+    libzcash::SaplingPaymentAddress,
+    boost::shared_ptr<CReserveScript>> MinerAddress;
+
+class ExtractMinerAddress
+{
+    const Consensus::Params& consensus;
+    int height;
+
+public:
+    ExtractMinerAddress(const Consensus::Params& consensus, int height) :
+        consensus(consensus), height(height) {}
+
+    std::optional<MinerAddress> operator()(const CKeyID &keyID) const;
+    std::optional<MinerAddress> operator()(const CScriptID &addr) const;
+    std::optional<MinerAddress> operator()(const libzcash::SproutPaymentAddress &addr) const;
+    std::optional<MinerAddress> operator()(const libzcash::SaplingPaymentAddress &addr) const;
+    std::optional<MinerAddress> operator()(const libzcash::UnifiedAddress &addr) const;
+};
+
+class KeepMinerAddress
+{
+public:
+    KeepMinerAddress() {}
+
+    void operator()(const libzcash::OrchardRawAddress &addr) const {}
+    void operator()(const libzcash::SaplingPaymentAddress &pa) const {}
+    void operator()(const boost::shared_ptr<CReserveScript> &coinbaseScript) const {
+        coinbaseScript->KeepScript();
+    }
+};
+
+bool IsShieldedMinerAddress(const MinerAddress& minerAddr);
+
+class IsValidMinerAddress
+{
+public:
+    IsValidMinerAddress() {}
+
+    bool operator()(const libzcash::OrchardRawAddress &addr) const {
+        return true;
+    }
+    bool operator()(const libzcash::SaplingPaymentAddress &pa) const {
+        return true;
+    }
+    bool operator()(const boost::shared_ptr<CReserveScript> &coinbaseScript) const {
+        // Return false if no script was provided.  This can happen
+        // due to some internal error but also if the keypool is empty.
+        // In the latter case, already the pointer is NULL.
+        return coinbaseScript.get() && !coinbaseScript->reserveScript.empty();
+    }
+};
+
+struct CBlockTemplate
+{
+    CBlock block;
+    // Cached whenever we update `block`, so we can update hashBlockCommitments
+    // when we change the coinbase transaction.
+    uint256 hashChainHistoryRoot;
+    // Cached whenever we update `block`, so we can return it from `getblocktemplate`
+    // (enabling the caller to update `hashBlockCommitments` when they change
+    // `hashPrevBlock`).
+    uint256 hashAuthDataRoot;
+    std::vector<CAmount> vTxFees;
+    std::vector<int64_t> vTxSigOps;
+};
+
+CMutableTransaction CreateCoinbaseTransaction(const CChainParams& chainparams, CAmount nFees, const MinerAddress& minerAddress, int nHeight);
+
+/** Generate a new block, without valid proof-of-work */
+CBlockTemplate* CreateNewBlock(const CChainParams& chainparams, const MinerAddress& minerAddress, const std::optional<CMutableTransaction>& next_coinbase_mtx = std::nullopt);
+
+#ifdef ENABLE_MINING
+/** Get -mineraddress */
+void GetMinerAddress(std::optional<MinerAddress> &minerAddress);
+/** Modify the extranonce in a block */
+void IncrementExtraNonce(
+    CBlockTemplate* pblocktemplate,
+    const CBlockIndex* pindexPrev,
+    unsigned int& nExtraNonce,
+    const Consensus::Params& consensusParams);
+/** Run the miner threads */
+void GenerateBitcoins(bool fGenerate, int nThreads, const CChainParams& chainparams);
+#endif
+
+void UpdateTime(CBlockHeader* pblock, const Consensus::Params& consensusParams, const CBlockIndex* pindexPrev);
+
+#endif // BITCOIN_MINER_H
diff --git a/depend/zcash/src/net.cpp b/depend/zcash/src/net.cpp
new file mode 100644
index 000000000..6f0ab4577
--- /dev/null
+++ b/depend/zcash/src/net.cpp
@@ -0,0 +1,2397 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#if defined(HAVE_CONFIG_H)
+#include "config/bitcoin-config.h"
+#endif
+
+#include "fs.h"
+#include "main.h"
+#include "net.h"
+
+#include "addrman.h"
+#include "chainparams.h"
+#include "clientversion.h"
+#include "consensus/consensus.h"
+#include "crypto/common.h"
+#include "crypto/sha256.h"
+#include "hash.h"
+#include "primitives/transaction.h"
+#include "scheduler.h"
+#include "ui_interface.h"
+
+#ifdef WIN32
+#include <string.h>
+#else
+#include <fcntl.h>
+#endif
+
+#include <boost/thread.hpp>
+
+#include <math.h>
+
+#include <rust/metrics.h>
+
+// Dump addresses to peers.dat and banlist.dat every 15 minutes (900s)
+#define DUMP_ADDRESSES_INTERVAL 900
+
+#if !defined(HAVE_MSG_NOSIGNAL) && !defined(MSG_NOSIGNAL)
+#define MSG_NOSIGNAL 0
+#endif
+
+using namespace std;
+
+namespace {
+    const int MAX_OUTBOUND_CONNECTIONS = 8;
+
+    struct ListenSocket {
+        SOCKET socket;
+        bool whitelisted;
+
+        ListenSocket(SOCKET socket, bool whitelisted) : socket(socket), whitelisted(whitelisted) {}
+    };
+}
+
+//
+// Global state variables
+//
+bool fDiscover = true;
+bool fListen = true;
+uint64_t nLocalServices = NODE_NETWORK;
+CCriticalSection cs_mapLocalHost;
+map<CNetAddr, LocalServiceInfo> mapLocalHost;
+static bool vfLimited[NET_MAX] = {};
+static CNode* pnodeLocalHost = NULL;
+uint64_t nLocalHostNonce = 0;
+static std::vector<ListenSocket> vhListenSocket;
+CAddrMan addrman;
+int nMaxConnections = DEFAULT_MAX_PEER_CONNECTIONS;
+bool fAddressesInitialized = false;
+std::string strSubVersion;
+
+vector<CNode*> vNodes;
+CCriticalSection cs_vNodes;
+limitedmap<WTxId, int64_t> mapAlreadyAskedFor(MAX_INV_SZ);
+
+static deque<string> vOneShots;
+static CCriticalSection cs_vOneShots;
+
+static set<CNetAddr> setservAddNodeAddresses;
+static CCriticalSection cs_setservAddNodeAddresses;
+
+vector<std::string> vAddedNodes;
+CCriticalSection cs_vAddedNodes;
+
+NodeId nLastNodeId = 0;
+CCriticalSection cs_nLastNodeId;
+
+static CSemaphore *semOutbound = NULL;
+static boost::condition_variable messageHandlerCondition;
+
+// Signals for message handling
+static CNodeSignals g_signals;
+CNodeSignals& GetNodeSignals() { return g_signals; }
+
+void AddOneShot(const std::string& strDest)
+{
+    LOCK(cs_vOneShots);
+    vOneShots.push_back(strDest);
+}
+
+unsigned short GetListenPort()
+{
+    return (unsigned short)(GetArg("-port", Params().GetDefaultPort()));
+}
+
+// find 'best' local address for a particular peer
+bool GetLocal(CService& addr, const CNetAddr *paddrPeer)
+{
+    if (!fListen)
+        return false;
+
+    int nBestScore = -1;
+    int nBestReachability = -1;
+    {
+        LOCK(cs_mapLocalHost);
+        for (map<CNetAddr, LocalServiceInfo>::iterator it = mapLocalHost.begin(); it != mapLocalHost.end(); it++)
+        {
+            int nScore = (*it).second.nScore;
+            int nReachability = (*it).first.GetReachabilityFrom(paddrPeer);
+            if (nReachability > nBestReachability || (nReachability == nBestReachability && nScore > nBestScore))
+            {
+                addr = CService((*it).first, (*it).second.nPort);
+                nBestReachability = nReachability;
+                nBestScore = nScore;
+            }
+        }
+    }
+    return nBestScore >= 0;
+}
+
+//! Convert the pnSeeds6 array into usable address objects.
+static std::vector<CAddress> convertSeed6(const std::vector<SeedSpec6> &vSeedsIn)
+{
+    // It'll only connect to one or two seed nodes because once it connects,
+    // it'll get a pile of addresses with newer timestamps.
+    // Seed nodes are given a random 'last seen time' of between one and two
+    // weeks ago.
+    const int64_t nOneWeek = 7*24*60*60;
+    std::vector<CAddress> vSeedsOut;
+    vSeedsOut.reserve(vSeedsIn.size());
+    for (std::vector<SeedSpec6>::const_iterator i(vSeedsIn.begin()); i != vSeedsIn.end(); ++i)
+    {
+        struct in6_addr ip;
+        memcpy(&ip, i->addr, sizeof(ip));
+        CAddress addr(CService(ip, i->port));
+        addr.nTime = GetTime() - GetRand(nOneWeek) - nOneWeek;
+        vSeedsOut.push_back(addr);
+    }
+    return vSeedsOut;
+}
+
+// get best local address for a particular peer as a CAddress
+// Otherwise, return the unroutable 0.0.0.0 but filled in with
+// the normal parameters, since the IP may be changed to a useful
+// one by discovery.
+CAddress GetLocalAddress(const CNetAddr *paddrPeer)
+{
+    CAddress ret(CService("0.0.0.0",GetListenPort()),0);
+    CService addr;
+    if (GetLocal(addr, paddrPeer))
+    {
+        ret = CAddress(addr);
+    }
+    ret.nServices = nLocalServices;
+    ret.nTime = GetTime();
+    return ret;
+}
+
+int GetnScore(const CService& addr)
+{
+    LOCK(cs_mapLocalHost);
+    if (mapLocalHost.count(addr) == LOCAL_NONE)
+        return 0;
+    return mapLocalHost[addr].nScore;
+}
+
+// Is our peer's addrLocal potentially useful as an external IP source?
+bool IsPeerAddrLocalGood(CNode *pnode)
+{
+    CService addrLocal = pnode->GetAddrLocal();
+    return fDiscover && pnode->addr.IsRoutable() && addrLocal.IsRoutable() &&
+           !IsLimited(addrLocal.GetNetwork());
+}
+
+// pushes our own address to a peer
+void AdvertizeLocal(CNode *pnode)
+{
+    if (fListen && pnode->fSuccessfullyConnected)
+    {
+        CAddress addrLocal = GetLocalAddress(&pnode->addr);
+        // If discovery is enabled, sometimes give our peer the address it
+        // tells us that it sees us as in case it has a better idea of our
+        // address than we do.
+        if (IsPeerAddrLocalGood(pnode) && (!addrLocal.IsRoutable() ||
+             GetRand((GetnScore(addrLocal) > LOCAL_MANUAL) ? 8:2) == 0))
+        {
+            addrLocal.SetIP(pnode->GetAddrLocal());
+        }
+        if (addrLocal.IsRoutable())
+        {
+            LogPrintf("AdvertizeLocal: advertizing address %s\n", addrLocal.ToString());
+            FastRandomContext insecure_rand;
+            pnode->PushAddress(addrLocal, insecure_rand);
+        }
+    }
+}
+
+// learn a new local address
+bool AddLocal(const CService& addr, int nScore)
+{
+    if (!addr.IsRoutable())
+        return false;
+
+    if (!fDiscover && nScore < LOCAL_MANUAL)
+        return false;
+
+    if (IsLimited(addr))
+        return false;
+
+    LogPrintf("AddLocal(%s,%i)\n", addr.ToString(), nScore);
+
+    {
+        LOCK(cs_mapLocalHost);
+        bool fAlready = mapLocalHost.count(addr) > 0;
+        LocalServiceInfo &info = mapLocalHost[addr];
+        if (!fAlready || nScore >= info.nScore) {
+            info.nScore = nScore + (fAlready ? 1 : 0);
+            info.nPort = addr.GetPort();
+        }
+    }
+
+    return true;
+}
+
+bool AddLocal(const CNetAddr &addr, int nScore)
+{
+    return AddLocal(CService(addr, GetListenPort()), nScore);
+}
+
+bool RemoveLocal(const CService& addr)
+{
+    LOCK(cs_mapLocalHost);
+    LogPrintf("RemoveLocal(%s)\n", addr.ToString());
+    mapLocalHost.erase(addr);
+    return true;
+}
+
+/** Make a particular network entirely off-limits (no automatic connects to it) */
+void SetLimited(enum Network net, bool fLimited)
+{
+    if (net == NET_UNROUTABLE)
+        return;
+    LOCK(cs_mapLocalHost);
+    vfLimited[net] = fLimited;
+}
+
+bool IsLimited(enum Network net)
+{
+    LOCK(cs_mapLocalHost);
+    return vfLimited[net];
+}
+
+bool IsLimited(const CNetAddr &addr)
+{
+    return IsLimited(addr.GetNetwork());
+}
+
+/** vote for a local address */
+bool SeenLocal(const CService& addr)
+{
+    {
+        LOCK(cs_mapLocalHost);
+        if (mapLocalHost.count(addr) == 0)
+            return false;
+        mapLocalHost[addr].nScore++;
+    }
+    return true;
+}
+
+
+/** check whether a given address is potentially local */
+bool IsLocal(const CService& addr)
+{
+    LOCK(cs_mapLocalHost);
+    return mapLocalHost.count(addr) > 0;
+}
+
+/** check whether a given network is one we can probably connect to */
+bool IsReachable(enum Network net)
+{
+    LOCK(cs_mapLocalHost);
+    return !vfLimited[net];
+}
+
+/** check whether a given address is in a network we can probably connect to */
+bool IsReachable(const CNetAddr& addr)
+{
+    enum Network net = addr.GetNetwork();
+    return IsReachable(net);
+}
+
+void AddressCurrentlyConnected(const CService& addr)
+{
+    addrman.Connected(addr);
+}
+
+
+uint64_t CNode::nTotalBytesRecv = 0;
+uint64_t CNode::nTotalBytesSent = 0;
+CCriticalSection CNode::cs_totalBytesRecv;
+CCriticalSection CNode::cs_totalBytesSent;
+
+uint64_t CNode::nMaxOutboundLimit = 0;
+uint64_t CNode::nMaxOutboundTotalBytesSentInCycle = 0;
+uint64_t CNode::nMaxOutboundTimeframe = 60*60*24; //1 day
+uint64_t CNode::nMaxOutboundCycleStartTime = 0;
+
+CNode* FindNode(const CNetAddr& ip)
+{
+    LOCK(cs_vNodes);
+    for (CNode* pnode : vNodes)
+        if ((CNetAddr)pnode->addr == ip)
+            return (pnode);
+    return NULL;
+}
+
+CNode* FindNode(const CSubNet& subNet)
+{
+    LOCK(cs_vNodes);
+    for (CNode* pnode : vNodes)
+    if (subNet.Match((CNetAddr)pnode->addr))
+        return (pnode);
+    return NULL;
+}
+
+CNode* FindNode(const std::string& addrName)
+{
+    LOCK(cs_vNodes);
+    for (CNode* pnode : vNodes) {
+        if (pnode->GetAddrName() == addrName) {
+            return (pnode);
+        }
+    }
+    return NULL;
+}
+
+CNode* FindNode(const CService& addr)
+{
+    LOCK(cs_vNodes);
+    for (CNode* pnode : vNodes)
+        if ((CService)pnode->addr == addr)
+            return (pnode);
+    return NULL;
+}
+
+CNode* ConnectNode(CAddress addrConnect, const char *pszDest)
+{
+    if (pszDest == NULL) {
+        if (IsLocal(addrConnect))
+            return NULL;
+
+        // Look for an existing connection
+        LOCK(cs_vNodes);
+        CNode* pnode = FindNode((CService)addrConnect);
+        if (pnode)
+        {
+            pnode->AddRef();
+            return pnode;
+        }
+    }
+
+    /// debug print
+    LogPrint("net", "trying connection %s lastseen=%.1fhrs\n",
+        pszDest ? pszDest : addrConnect.ToString(),
+        pszDest ? 0.0 : (double)(GetTime() - addrConnect.nTime)/3600.0);
+
+    // Connect
+    SOCKET hSocket;
+    bool proxyConnectionFailed = false;
+    if (pszDest ? ConnectSocketByName(addrConnect, hSocket, pszDest, Params().GetDefaultPort(), nConnectTimeout, &proxyConnectionFailed) :
+                  ConnectSocket(addrConnect, hSocket, nConnectTimeout, &proxyConnectionFailed))
+    {
+        if (!IsSelectableSocket(hSocket)) {
+            LogPrintf("Cannot create connection: non-selectable socket created (fd >= FD_SETSIZE ?)\n");
+            CloseSocket(hSocket);
+            return NULL;
+        }
+
+        addrman.Attempt(addrConnect);
+
+        // Add node
+        CNode* pnode = new CNode(hSocket, addrConnect, pszDest ? pszDest : "", false);
+        pnode->AddRef();
+
+        {
+            LOCK(cs_vNodes);
+            vNodes.push_back(pnode);
+        }
+
+        return pnode;
+    } else if (!proxyConnectionFailed) {
+        // If connecting to the node failed, and failure is not caused by a problem connecting to
+        // the proxy, mark this as an attempt.
+        addrman.Attempt(addrConnect);
+    }
+
+    return NULL;
+}
+
+static void DumpBanlist()
+{
+    CNode::SweepBanned(); // clean unused entries (if bantime has expired)
+
+    if (!CNode::BannedSetIsDirty())
+        return;
+
+    int64_t nStart = GetTimeMillis();
+
+    CBanDB bandb;
+    banmap_t banmap;
+    CNode::SetBannedSetDirty(false);
+    CNode::GetBanned(banmap);
+    if (!bandb.Write(banmap))
+        CNode::SetBannedSetDirty(true);
+
+    LogPrint("net", "Flushed %d banned node ips/subnets to banlist.dat  %dms\n",
+        banmap.size(), GetTimeMillis() - nStart);
+}
+
+void CNode::CloseSocketDisconnect()
+{
+    fDisconnect = true;
+    {
+        LOCK(cs_hSocket);
+        if (hSocket != INVALID_SOCKET) {
+            LogPrint("net", "disconnecting peer=%d\n", id);
+            CloseSocket(hSocket);
+        }
+    }
+
+    // in case this fails, we'll empty the recv buffer when the CNode is deleted
+    TRY_LOCK(cs_vRecvMsg, lockRecv);
+    if (lockRecv)
+        vRecvMsg.clear();
+}
+
+void CNode::PushVersion()
+{
+    int nBestHeight = g_signals.GetHeight().get_value_or(0);
+
+    int64_t nTime = GetTime();
+    CAddress addrYou = (addr.IsRoutable() && !IsProxy(addr) ? addr : CAddress(CService("0.0.0.0",0)));
+    CAddress addrMe = GetLocalAddress(&addr);
+    GetRandBytes((unsigned char*)&nLocalHostNonce, sizeof(nLocalHostNonce));
+    if (fLogIPs)
+        LogPrint("net", "send version message: version %d, blocks=%d, us=%s, them=%s, peer=%d\n", PROTOCOL_VERSION, nBestHeight, addrMe.ToString(), addrYou.ToString(), id);
+    else
+        LogPrint("net", "send version message: version %d, blocks=%d, us=%s, peer=%d\n", PROTOCOL_VERSION, nBestHeight, addrMe.ToString(), id);
+    PushMessage("version", PROTOCOL_VERSION, nLocalServices, nTime, addrYou, addrMe,
+                nLocalHostNonce, strSubVersion, nBestHeight, !GetBoolArg("-blocksonly", DEFAULT_BLOCKSONLY));
+}
+
+
+
+
+
+banmap_t CNode::setBanned;
+CCriticalSection CNode::cs_setBanned;
+bool CNode::setBannedIsDirty;
+
+void CNode::ClearBanned()
+{
+    {
+        LOCK(cs_setBanned);
+        setBanned.clear();
+        setBannedIsDirty = true;
+    }
+    DumpBanlist(); //store banlist to disk
+    uiInterface.BannedListChanged();
+}
+
+bool CNode::IsBanned(CNetAddr ip)
+{
+    LOCK(cs_setBanned);
+    for (banmap_t::iterator it = setBanned.begin(); it != setBanned.end(); it++)
+    {
+        CSubNet subNet = (*it).first;
+        CBanEntry banEntry = (*it).second;
+
+        if (subNet.Match(ip) && GetTime() < banEntry.nBanUntil) {
+            return true;
+        }
+    }
+    return false;
+}
+
+bool CNode::IsBanned(CSubNet subnet)
+{
+    LOCK(cs_setBanned);
+    banmap_t::iterator i = setBanned.find(subnet);
+    if (i != setBanned.end())
+    {
+        CBanEntry banEntry = (*i).second;
+        if (GetTime() < banEntry.nBanUntil) {
+            return true;
+        }
+    }
+    return false;
+}
+
+void CNode::Ban(const CNetAddr& addr, const BanReason &banReason, int64_t bantimeoffset, bool sinceUnixEpoch) {
+    CSubNet subNet(addr);
+    Ban(subNet, banReason, bantimeoffset, sinceUnixEpoch);
+}
+
+void CNode::Ban(const CSubNet& subNet, const BanReason &banReason, int64_t bantimeoffset, bool sinceUnixEpoch) {
+    CBanEntry banEntry(GetTime());
+    banEntry.banReason = banReason;
+    if (bantimeoffset <= 0)
+    {
+        bantimeoffset = GetArg("-bantime", DEFAULT_MISBEHAVING_BANTIME);
+        sinceUnixEpoch = false;
+    }
+    banEntry.nBanUntil = (sinceUnixEpoch ? 0 : GetTime() )+bantimeoffset;
+
+    {
+        LOCK(cs_setBanned);
+        if (setBanned[subNet].nBanUntil < banEntry.nBanUntil) {
+            setBanned[subNet] = banEntry;
+            setBannedIsDirty = true;
+        }
+        else
+            return;
+    }
+    uiInterface.BannedListChanged();
+    {
+        LOCK(cs_vNodes);
+        BOOST_FOREACH(CNode* pnode, vNodes) {
+            if (subNet.Match((CNetAddr)pnode->addr))
+                pnode->fDisconnect = true;
+        }
+    }
+    if(banReason == BanReasonManuallyAdded)
+        DumpBanlist(); //store banlist to disk immediately if user requested ban
+}
+
+bool CNode::Unban(const CNetAddr &addr) {
+    CSubNet subNet(addr);
+    return Unban(subNet);
+}
+
+bool CNode::Unban(const CSubNet &subNet) {
+    {
+        LOCK(cs_setBanned);
+        if (!setBanned.erase(subNet))
+            return false;
+        setBannedIsDirty = true;
+    }
+    uiInterface.BannedListChanged();
+    DumpBanlist(); //store banlist to disk immediately
+    return true;
+}
+
+void CNode::GetBanned(banmap_t &banMap)
+{
+    LOCK(cs_setBanned);
+    banMap = setBanned; //create a thread safe copy
+}
+
+void CNode::SetBanned(const banmap_t &banMap)
+{
+    LOCK(cs_setBanned);
+    setBanned = banMap;
+    setBannedIsDirty = true;
+}
+
+void CNode::SweepBanned()
+{
+    int64_t now = GetTime();
+
+    LOCK(cs_setBanned);
+    banmap_t::iterator it = setBanned.begin();
+    while(it != setBanned.end())
+    {
+        CSubNet subNet = (*it).first;
+        CBanEntry banEntry = (*it).second;
+        if(now > banEntry.nBanUntil)
+        {
+            setBanned.erase(it++);
+            setBannedIsDirty = true;
+            LogPrint("net", "%s: Removed banned node ip/subnet from banlist.dat: %s\n", __func__, subNet.ToString());
+        }
+        else
+            ++it;
+    }
+}
+
+bool CNode::BannedSetIsDirty()
+{
+    LOCK(cs_setBanned);
+    return setBannedIsDirty;
+}
+
+void CNode::SetBannedSetDirty(bool dirty)
+{
+    LOCK(cs_setBanned); //reuse setBanned lock for the isDirty flag
+    setBannedIsDirty = dirty;
+}
+
+
+std::vector<CSubNet> CNode::vWhitelistedRange;
+CCriticalSection CNode::cs_vWhitelistedRange;
+
+bool CNode::IsWhitelistedRange(const CNetAddr &addr) {
+    LOCK(cs_vWhitelistedRange);
+    for (const CSubNet& subnet : vWhitelistedRange) {
+        if (subnet.Match(addr))
+            return true;
+    }
+    return false;
+}
+
+void CNode::AddWhitelistedRange(const CSubNet &subnet) {
+    LOCK(cs_vWhitelistedRange);
+    vWhitelistedRange.push_back(subnet);
+}
+
+
+std::string CNode::GetAddrName() const {
+    LOCK(cs_addrName);
+    return addrName;
+}
+
+void CNode::MaybeSetAddrName(const std::string& addrNameIn) {
+    LOCK(cs_addrName);
+    if (addrName.empty()) {
+        addrName = addrNameIn;
+    }
+}
+
+CService CNode::GetAddrLocal() const {
+    LOCK(cs_addrLocal);
+    return addrLocal;
+}
+
+void CNode::SetAddrLocal(const CService& addrLocalIn) {
+    LOCK(cs_addrLocal);
+    if (addrLocal.IsValid()) {
+        error("Addr local already set for node: %i. Refusing to change from %s to %s", id, addrLocal.ToString(), addrLocalIn.ToString());
+    } else {
+        addrLocal = addrLocalIn;
+    }
+}
+
+void CNode::copyStats(CNodeStats &stats)
+{
+    stats.nodeid = this->GetId();
+    stats.nServices = nServices;
+    {
+        LOCK(cs_filter);
+        stats.fRelayTxes = fRelayTxes;
+    }
+    stats.nLastSend = nLastSend;
+    stats.nLastRecv = nLastRecv;
+    stats.nTimeConnected = nTimeConnected;
+    stats.nTimeOffset = nTimeOffset;
+    stats.addrName = GetAddrName();
+    stats.nVersion = nVersion;
+    {
+        LOCK(cs_SubVer);
+        stats.cleanSubVer = cleanSubVer;
+    }
+    stats.fInbound = fInbound;
+    stats.nStartingHeight = nStartingHeight;
+    {
+        LOCK(cs_vSend);
+        stats.nSendBytes = nSendBytes;
+    }
+    {
+        LOCK(cs_vRecv);
+        stats.nRecvBytes = nRecvBytes;
+    }
+    stats.fWhitelisted = fWhitelisted;
+
+    // It is common for nodes with good ping times to suddenly become lagged,
+    // due to a new block arriving or other large transfer.
+    // Merely reporting pingtime might fool the caller into thinking the node was still responsive,
+    // since pingtime does not update until the ping is complete, which might take a while.
+    // So, if a ping is taking an unusually long time in flight,
+    // the caller can immediately detect that this is happening.
+    int64_t nPingUsecWait = 0;
+    if ((0 != nPingNonceSent) && (0 != nPingUsecStart)) {
+        nPingUsecWait = GetTimeMicros() - nPingUsecStart;
+    }
+
+    // Raw ping time is in microseconds, but show it to user as whole seconds (Bitcoin users should be well used to small numbers with many decimal places by now :)
+    stats.dPingTime = (((double)nPingUsecTime) / 1e6);
+    stats.dPingWait = (((double)nPingUsecWait) / 1e6);
+
+    // Leave string empty if addrLocal invalid (not filled in yet)
+    CService addrLocalUnlocked = GetAddrLocal();
+    stats.addrLocal = addrLocalUnlocked.IsValid() ? addrLocalUnlocked.ToString() : "";
+}
+
+// requires LOCK(cs_vRecvMsg)
+bool CNode::ReceiveMsgBytes(const char *pch, unsigned int nBytes)
+{
+    while (nBytes > 0) {
+
+        // get current incomplete message, or create a new one
+        if (vRecvMsg.empty() ||
+            vRecvMsg.back().complete())
+            vRecvMsg.push_back(CNetMessage(Params().MessageStart(), SER_NETWORK, nRecvVersion));
+
+        CNetMessage& msg = vRecvMsg.back();
+
+        // absorb network data
+        int handled;
+        if (!msg.in_data)
+            handled = msg.readHeader(pch, nBytes);
+        else
+            handled = msg.readData(pch, nBytes);
+
+        if (handled < 0)
+                return false;
+
+        if (msg.in_data && msg.hdr.nMessageSize > MAX_PROTOCOL_MESSAGE_LENGTH) {
+            LogPrint("net", "Oversized message from peer=%i, disconnecting\n", GetId());
+            return false;
+        }
+
+        pch += handled;
+        nBytes -= handled;
+
+        if (msg.complete()) {
+            msg.nTime = GetTimeMicros();
+            std::string strCommand = SanitizeString(msg.hdr.GetCommand());
+            MetricsIncrementCounter("zcash.net.in.messages", "command", strCommand.c_str());
+            MetricsCounter(
+                "zcash.net.in.bytes", msg.hdr.nMessageSize,
+                "command", strCommand.c_str());
+            messageHandlerCondition.notify_one();
+        }
+    }
+
+    return true;
+}
+
+int CNetMessage::readHeader(const char *pch, unsigned int nBytes)
+{
+    // copy data to temporary parsing buffer
+    unsigned int nRemaining = 24 - nHdrPos;
+    unsigned int nCopy = std::min(nRemaining, nBytes);
+
+    memcpy(&hdrbuf[nHdrPos], pch, nCopy);
+    nHdrPos += nCopy;
+
+    // if header incomplete, exit
+    if (nHdrPos < 24)
+        return nCopy;
+
+    // deserialize to CMessageHeader
+    try {
+        hdrbuf >> hdr;
+    }
+    catch (const std::exception&) {
+        return -1;
+    }
+
+    // reject messages larger than MAX_SIZE
+    if (hdr.nMessageSize > MAX_SIZE)
+            return -1;
+
+    // switch state to reading message data
+    in_data = true;
+
+    return nCopy;
+}
+
+int CNetMessage::readData(const char *pch, unsigned int nBytes)
+{
+    unsigned int nRemaining = hdr.nMessageSize - nDataPos;
+    unsigned int nCopy = std::min(nRemaining, nBytes);
+
+    if (vRecv.size() < nDataPos + nCopy) {
+        // Allocate up to 256 KiB ahead, but never more than the total message size.
+        vRecv.resize(std::min(hdr.nMessageSize, nDataPos + nCopy + 256 * 1024));
+    }
+
+    memcpy(&vRecv[nDataPos], pch, nCopy);
+    nDataPos += nCopy;
+
+    return nCopy;
+}
+
+
+
+
+
+
+
+
+
+// requires LOCK(cs_vSend)
+void SocketSendData(CNode *pnode)
+{
+    std::deque<CSerializeData>::iterator it = pnode->vSendMsg.begin();
+
+    while (it != pnode->vSendMsg.end()) {
+        const CSerializeData &data = *it;
+        assert(data.size() > pnode->nSendOffset);
+        int nBytes = 0;
+        {
+            LOCK(pnode->cs_hSocket);
+            if (pnode->hSocket == INVALID_SOCKET)
+                break;
+            nBytes = send(pnode->hSocket, &data[pnode->nSendOffset], data.size() - pnode->nSendOffset, MSG_NOSIGNAL | MSG_DONTWAIT);
+        }
+        if (nBytes > 0) {
+            pnode->nLastSend = GetTime();
+            {
+                LOCK(pnode->cs_vSend);
+                pnode->nSendBytes += nBytes;
+            }
+            pnode->nSendOffset += nBytes;
+            pnode->RecordBytesSent(nBytes);
+            if (pnode->nSendOffset == data.size()) {
+                pnode->nSendOffset = 0;
+                pnode->nSendSize -= data.size();
+                it++;
+            } else {
+                // could not send full message; stop sending more
+                break;
+            }
+        } else {
+            if (nBytes < 0) {
+                // error
+                int nErr = WSAGetLastError();
+                if (nErr != WSAEWOULDBLOCK && nErr != WSAEMSGSIZE && nErr != WSAEINTR && nErr != WSAEINPROGRESS)
+                {
+                    LogPrintf("socket send error %s\n", NetworkErrorString(nErr));
+                    pnode->CloseSocketDisconnect();
+                }
+            }
+            // couldn't send anything at all
+            break;
+        }
+    }
+
+    if (it == pnode->vSendMsg.end()) {
+        assert(pnode->nSendOffset == 0);
+        assert(pnode->nSendSize == 0);
+    }
+    pnode->vSendMsg.erase(pnode->vSendMsg.begin(), it);
+}
+
+static list<CNode*> vNodesDisconnected;
+
+struct NodeEvictionCandidate
+{
+    NodeId id;
+    int64_t nTimeConnected;
+    int64_t nMinPingUsecTime;
+    CAddress addr;
+    uint64_t nKeyedNetGroup;
+    int nVersion;
+};
+
+static bool ReverseCompareNodeMinPingTime(const NodeEvictionCandidate &a, const NodeEvictionCandidate &b)
+{
+    return a.nMinPingUsecTime > b.nMinPingUsecTime;
+}
+
+static bool ReverseCompareNodeTimeConnected(const NodeEvictionCandidate &a, const NodeEvictionCandidate &b)
+{
+    return a.nTimeConnected > b.nTimeConnected;
+}
+
+static bool CompareNetGroupKeyed(const NodeEvictionCandidate &a, const NodeEvictionCandidate &b) {
+    return a.nKeyedNetGroup < b.nKeyedNetGroup;
+};
+
+static bool AttemptToEvictConnection(bool fPreferNewConnection) {
+    std::vector<NodeEvictionCandidate> vEvictionCandidates;
+    {
+        LOCK(cs_vNodes);
+
+        for (CNode *node : vNodes) {
+            if (node->fWhitelisted)
+                continue;
+            if (!node->fInbound)
+                continue;
+            if (node->fDisconnect)
+                continue;
+            NodeEvictionCandidate candidate = {
+                .id = node->id,
+                .nTimeConnected = node->nTimeConnected,
+                .nMinPingUsecTime = node->nMinPingUsecTime,
+                .addr = node->addr,
+                .nKeyedNetGroup = node->nKeyedNetGroup,
+                .nVersion = node->nVersion
+            };
+            vEvictionCandidates.push_back(candidate);
+        }
+    }
+
+    if (vEvictionCandidates.empty()) return false;
+
+    // Protect connections with certain characteristics
+
+    // Check version of eviction candidates and prioritize nodes which do not support network upgrade.
+    std::vector<NodeEvictionCandidate> vTmpEvictionCandidates;
+    int height;
+    {
+        LOCK(cs_main);
+        height = chainActive.Height();
+    }
+
+    const Consensus::Params& params = Params().GetConsensus();
+    auto nextEpoch = NextEpoch(height, params);
+    if (nextEpoch) {
+        auto idx = nextEpoch.value();
+        int nActivationHeight = params.vUpgrades[idx].nActivationHeight;
+
+        if (nActivationHeight > 0 &&
+            height < nActivationHeight &&
+            height >= nActivationHeight - NETWORK_UPGRADE_PEER_PREFERENCE_BLOCK_PERIOD)
+        {
+            // Find any nodes which don't support the protocol version for the next upgrade
+            for (const NodeEvictionCandidate &node : vEvictionCandidates) {
+                if (node.nVersion < params.vUpgrades[idx].nProtocolVersion &&
+                    !(
+                        Params().NetworkIDString() == "regtest" &&
+                        !GetBoolArg("-nurejectoldversions", DEFAULT_NU_REJECT_OLD_VERSIONS)
+                    )
+                ) {
+                    vTmpEvictionCandidates.push_back(node);
+                }
+            }
+
+            // Prioritize these nodes by replacing eviction set with them
+            if (vTmpEvictionCandidates.size() > 0) {
+                vEvictionCandidates = vTmpEvictionCandidates;
+            }
+        }
+    }
+
+    // Deterministically select 4 peers to protect by netgroup.
+    // An attacker cannot predict which netgroups will be protected
+    std::sort(vEvictionCandidates.begin(), vEvictionCandidates.end(), CompareNetGroupKeyed);
+    vEvictionCandidates.erase(vEvictionCandidates.end() - std::min(4, static_cast<int>(vEvictionCandidates.size())), vEvictionCandidates.end());
+
+    if (vEvictionCandidates.empty()) return false;
+
+    // Protect the 8 nodes with the best ping times.
+    // An attacker cannot manipulate this metric without physically moving nodes closer to the target.
+    std::sort(vEvictionCandidates.begin(), vEvictionCandidates.end(), ReverseCompareNodeMinPingTime);
+    vEvictionCandidates.erase(vEvictionCandidates.end() - std::min(8, static_cast<int>(vEvictionCandidates.size())), vEvictionCandidates.end());
+
+    if (vEvictionCandidates.empty()) return false;
+
+    // Protect the half of the remaining nodes which have been connected the longest.
+    // This replicates the existing implicit behavior.
+    std::sort(vEvictionCandidates.begin(), vEvictionCandidates.end(), ReverseCompareNodeTimeConnected);
+    vEvictionCandidates.erase(vEvictionCandidates.end() - static_cast<int>(vEvictionCandidates.size() / 2), vEvictionCandidates.end());
+
+    if (vEvictionCandidates.empty()) return false;
+
+    // Identify the network group with the most connections and youngest member.
+    // (vEvictionCandidates is already sorted by reverse connect time)
+    uint64_t naMostConnections;
+    unsigned int nMostConnections = 0;
+    int64_t nMostConnectionsTime = 0;
+    std::map<uint64_t, std::vector<NodeEvictionCandidate> > mapAddrCounts;
+    for(const NodeEvictionCandidate &node : vEvictionCandidates) {
+        mapAddrCounts[node.nKeyedNetGroup].push_back(node);
+        int64_t grouptime = mapAddrCounts[node.nKeyedNetGroup][0].nTimeConnected;
+        size_t groupsize = mapAddrCounts[node.nKeyedNetGroup].size();
+
+        if (groupsize > nMostConnections || (groupsize == nMostConnections && grouptime > nMostConnectionsTime)) {
+            nMostConnections = groupsize;
+            nMostConnectionsTime = grouptime;
+            naMostConnections = node.nKeyedNetGroup;
+        }
+    }
+
+    // Reduce to the network group with the most connections
+    vEvictionCandidates = std::move(mapAddrCounts[naMostConnections]);
+
+    // Do not disconnect peers if there is only one unprotected connection from their network group.
+    if (vEvictionCandidates.size() <= 1)
+        // unless we prefer the new connection (for whitelisted peers)
+        if (!fPreferNewConnection)
+            return false;
+
+    // Disconnect from the network group with the most connections
+    NodeId evicted = vEvictionCandidates.front().id;
+    LOCK(cs_vNodes);
+    for(std::vector<CNode*>::const_iterator it(vNodes.begin()); it != vNodes.end(); ++it) {
+        if ((*it)->GetId() == evicted) {
+            (*it)->fDisconnect = true;
+            return true;
+        }
+    }
+    return false;
+}
+
+static void AcceptConnection(const ListenSocket& hListenSocket) {
+    struct sockaddr_storage sockaddr;
+    socklen_t len = sizeof(sockaddr);
+    SOCKET hSocket = accept(hListenSocket.socket, (struct sockaddr*)&sockaddr, &len);
+    CAddress addr;
+    int nInbound = 0;
+    int nMaxInbound = nMaxConnections - MAX_OUTBOUND_CONNECTIONS;
+
+    if (hSocket != INVALID_SOCKET)
+        if (!addr.SetSockAddr((const struct sockaddr*)&sockaddr))
+            LogPrintf("Warning: Unknown socket family\n");
+
+    bool whitelisted = hListenSocket.whitelisted || CNode::IsWhitelistedRange(addr);
+    {
+        LOCK(cs_vNodes);
+        for (CNode* pnode : vNodes)
+            if (pnode->fInbound)
+                nInbound++;
+    }
+
+    if (hSocket == INVALID_SOCKET)
+    {
+        int nErr = WSAGetLastError();
+        if (nErr != WSAEWOULDBLOCK)
+            LogPrintf("socket error accept failed: %s\n", NetworkErrorString(nErr));
+        return;
+    }
+
+    if (!IsSelectableSocket(hSocket))
+    {
+        LogPrintf("connection from %s dropped: non-selectable socket\n", addr.ToString());
+        CloseSocket(hSocket);
+        return;
+    }
+
+    if (CNode::IsBanned(addr) && !whitelisted)
+    {
+        LogPrintf("connection from %s dropped (banned)\n", addr.ToString());
+        CloseSocket(hSocket);
+        return;
+    }
+
+    if (nInbound >= nMaxInbound)
+    {
+        if (!AttemptToEvictConnection(whitelisted)) {
+            // No connection to evict, disconnect the new connection
+            LogPrint("net", "failed to find an eviction candidate - connection dropped (full)\n");
+            CloseSocket(hSocket);
+            return;
+        }
+    }
+
+    // According to the internet TCP_NODELAY is not carried into accepted sockets
+    // on all platforms.  Set it again here just to be sure.
+    int set = 1;
+#ifdef WIN32
+    setsockopt(hSocket, IPPROTO_TCP, TCP_NODELAY, (const char*)&set, sizeof(int));
+#else
+    setsockopt(hSocket, IPPROTO_TCP, TCP_NODELAY, (void*)&set, sizeof(int));
+#endif
+
+    CNode* pnode = new CNode(hSocket, addr, "", true);
+    pnode->AddRef();
+    pnode->fWhitelisted = whitelisted;
+
+    LogPrint("net", "connection from %s accepted\n", addr.ToString());
+
+    {
+        LOCK(cs_vNodes);
+        vNodes.push_back(pnode);
+    }
+}
+
+void ThreadSocketHandler()
+{
+    unsigned int nPrevNodeCount = 0;
+    while (true)
+    {
+        //
+        // Disconnect nodes
+        //
+        {
+            LOCK(cs_vNodes);
+            // Disconnect unused nodes
+            vector<CNode*> vNodesCopy = vNodes;
+            for (CNode* pnode : vNodesCopy)
+            {
+                if (pnode->fDisconnect ||
+                    (pnode->GetRefCount() <= 0 && pnode->vRecvMsg.empty() && pnode->nSendSize == 0 && pnode->ssSend.empty()))
+                {
+                    auto spanGuard = pnode->span.Enter();
+
+                    // remove from vNodes
+                    vNodes.erase(remove(vNodes.begin(), vNodes.end(), pnode), vNodes.end());
+
+                    // release outbound grant (if any)
+                    pnode->grantOutbound.Release();
+
+                    // close socket and cleanup
+                    pnode->CloseSocketDisconnect();
+
+                    // hold in disconnected pool until all refs are released
+                    if (pnode->fNetworkNode || pnode->fInbound)
+                        pnode->Release();
+                    vNodesDisconnected.push_back(pnode);
+                }
+            }
+        }
+        {
+            // Delete disconnected nodes
+            list<CNode*> vNodesDisconnectedCopy = vNodesDisconnected;
+            for (CNode* pnode : vNodesDisconnectedCopy)
+            {
+                // wait until threads are done using it
+                if (pnode->GetRefCount() <= 0)
+                {
+                    bool fDelete = false;
+                    {
+                        TRY_LOCK(pnode->cs_vSend, lockSend);
+                        if (lockSend)
+                        {
+                            TRY_LOCK(pnode->cs_vRecvMsg, lockRecv);
+                            if (lockRecv)
+                            {
+                                TRY_LOCK(pnode->cs_inventory, lockInv);
+                                if (lockInv)
+                                    fDelete = true;
+                            }
+                        }
+                    }
+                    if (fDelete)
+                    {
+                        vNodesDisconnected.remove(pnode);
+                        delete pnode;
+                    }
+                }
+            }
+        }
+        size_t vNodesSize;
+        {
+            LOCK(cs_vNodes);
+            vNodesSize = vNodes.size();
+        }
+        if (vNodesSize != nPrevNodeCount) {
+            nPrevNodeCount = vNodesSize;
+            MetricsGauge("zcash.net.peers", nPrevNodeCount);
+            uiInterface.NotifyNumConnectionsChanged(nPrevNodeCount);
+        }
+
+        //
+        // Find which sockets have data to receive
+        //
+        struct timeval timeout;
+        timeout.tv_sec  = 0;
+        timeout.tv_usec = 50000; // frequency to poll pnode->vSend
+
+        fd_set fdsetRecv;
+        fd_set fdsetSend;
+        fd_set fdsetError;
+        FD_ZERO(&fdsetRecv);
+        FD_ZERO(&fdsetSend);
+        FD_ZERO(&fdsetError);
+        SOCKET hSocketMax = 0;
+        bool have_fds = false;
+
+        for (const ListenSocket& hListenSocket : vhListenSocket) {
+            FD_SET(hListenSocket.socket, &fdsetRecv);
+            hSocketMax = max(hSocketMax, hListenSocket.socket);
+            have_fds = true;
+        }
+
+        {
+            LOCK(cs_vNodes);
+            for (CNode* pnode : vNodes)
+            {
+                // Implement the following logic:
+                // * If there is data to send, select() for sending data. As this only
+                //   happens when optimistic write failed, we choose to first drain the
+                //   write buffer in this case before receiving more. This avoids
+                //   needlessly queueing received data, if the remote peer is not themselves
+                //   receiving data. This means properly utilizing TCP flow control signaling.
+                // * Otherwise, if there is no (complete) message in the receive buffer,
+                //   or there is space left in the buffer, select() for receiving data.
+                // * (if neither of the above applies, there is certainly one message
+                //   in the receiver buffer ready to be processed).
+                // Together, that means that at least one of the following is always possible,
+                // so we don't deadlock:
+                // * We send some data.
+                // * We wait for data to be received (and disconnect after timeout).
+                // * We process a message in the buffer (message handler thread).
+
+                bool select_send;
+                {
+                    TRY_LOCK(pnode->cs_vSend, lockSend);
+                    select_send = lockSend && !pnode->vSendMsg.empty();
+                }
+
+                bool select_recv;
+                {
+                    TRY_LOCK(pnode->cs_vRecvMsg, lockRecv);
+                    select_recv = lockRecv && (
+                        pnode->vRecvMsg.empty() || !pnode->vRecvMsg.front().complete() ||
+                        pnode->GetTotalRecvSize() <= ReceiveFloodSize());
+                }
+
+                LOCK(pnode->cs_hSocket);
+                if (pnode->hSocket == INVALID_SOCKET)
+                    continue;
+
+                FD_SET(pnode->hSocket, &fdsetError);
+                hSocketMax = max(hSocketMax, pnode->hSocket);
+                have_fds = true;
+
+                if (select_send) {
+                    FD_SET(pnode->hSocket, &fdsetSend);
+                    continue;
+                }
+                if (select_recv) {
+                    FD_SET(pnode->hSocket, &fdsetRecv);
+                }
+            }
+        }
+
+        int nSelect = select(have_fds ? hSocketMax + 1 : 0,
+                             &fdsetRecv, &fdsetSend, &fdsetError, &timeout);
+        boost::this_thread::interruption_point();
+
+        if (nSelect == SOCKET_ERROR)
+        {
+            if (have_fds)
+            {
+                int nErr = WSAGetLastError();
+                LogPrintf("socket select error %s\n", NetworkErrorString(nErr));
+                for (unsigned int i = 0; i <= hSocketMax; i++)
+                    FD_SET(i, &fdsetRecv);
+            }
+            FD_ZERO(&fdsetSend);
+            FD_ZERO(&fdsetError);
+            MilliSleep(timeout.tv_usec/1000);
+        }
+
+        //
+        // Accept new connections
+        //
+        for (const ListenSocket& hListenSocket : vhListenSocket)
+        {
+            if (hListenSocket.socket != INVALID_SOCKET && FD_ISSET(hListenSocket.socket, &fdsetRecv))
+            {
+                AcceptConnection(hListenSocket);
+            }
+        }
+
+        //
+        // Service each socket
+        //
+        vector<CNode*> vNodesCopy;
+        {
+            LOCK(cs_vNodes);
+            vNodesCopy = vNodes;
+            for (CNode* pnode : vNodesCopy)
+                pnode->AddRef();
+        }
+        for (CNode* pnode : vNodesCopy)
+        {
+            boost::this_thread::interruption_point();
+
+            auto spanGuard = pnode->span.Enter();
+
+            //
+            // Receive
+            //
+            bool recvSet = false;
+            bool sendSet = false;
+            bool errorSet = false;
+            {
+                LOCK(pnode->cs_hSocket);
+                if (pnode->hSocket == INVALID_SOCKET)
+                    continue;
+                recvSet = FD_ISSET(pnode->hSocket, &fdsetRecv);
+                sendSet = FD_ISSET(pnode->hSocket, &fdsetSend);
+                errorSet = FD_ISSET(pnode->hSocket, &fdsetError);
+            }
+            if (recvSet || errorSet)
+            {
+                TRY_LOCK(pnode->cs_vRecvMsg, lockRecv);
+                if (lockRecv)
+                {
+                    {
+                        // typical socket buffer is 8K-64K
+                        char pchBuf[0x10000];
+                        int nBytes = 0;
+                        {
+                            LOCK(pnode->cs_hSocket);
+                            if (pnode->hSocket == INVALID_SOCKET)
+                                continue;
+                            nBytes = recv(pnode->hSocket, pchBuf, sizeof(pchBuf), MSG_DONTWAIT);
+                        }
+                        if (nBytes > 0)
+                        {
+                            if (!pnode->ReceiveMsgBytes(pchBuf, nBytes))
+                                pnode->CloseSocketDisconnect();
+                            pnode->nLastRecv = GetTime();
+                            {
+                                LOCK(pnode->cs_vRecv);
+                                pnode->nRecvBytes += nBytes;
+                            }
+                            pnode->RecordBytesRecv(nBytes);
+                        }
+                        else if (nBytes == 0)
+                        {
+                            // socket closed gracefully
+                            if (!pnode->fDisconnect)
+                                LogPrint("net", "socket closed\n");
+                            pnode->CloseSocketDisconnect();
+                        }
+                        else if (nBytes < 0)
+                        {
+                            // error
+                            int nErr = WSAGetLastError();
+                            if (nErr != WSAEWOULDBLOCK && nErr != WSAEMSGSIZE && nErr != WSAEINTR && nErr != WSAEINPROGRESS)
+                            {
+                                if (!pnode->fDisconnect)
+                                    LogPrintf("socket recv error %s\n", NetworkErrorString(nErr));
+                                pnode->CloseSocketDisconnect();
+                            }
+                        }
+                    }
+                }
+            }
+
+            //
+            // Send
+            //
+            if (sendSet)
+            {
+                TRY_LOCK(pnode->cs_vSend, lockSend);
+                if (lockSend)
+                    SocketSendData(pnode);
+            }
+
+            //
+            // Inactivity checking
+            //
+            int64_t nTime = GetTime();
+            if (nTime - pnode->nTimeConnected > 60)
+            {
+                if (pnode->nLastRecv == 0 || pnode->nLastSend == 0)
+                {
+                    LogPrint("net", "socket no message in first 60 seconds, %d %d from %d\n", pnode->nLastRecv != 0, pnode->nLastSend != 0, pnode->id);
+                    pnode->fDisconnect = true;
+                }
+                else if (nTime - pnode->nLastSend > TIMEOUT_INTERVAL)
+                {
+                    LogPrintf("socket sending timeout: %is\n", nTime - pnode->nLastSend);
+                    pnode->fDisconnect = true;
+                }
+                else if (nTime - pnode->nLastRecv > (pnode->nVersion > BIP0031_VERSION ? TIMEOUT_INTERVAL : 90*60))
+                {
+                    LogPrintf("socket receive timeout: %is\n", nTime - pnode->nLastRecv);
+                    pnode->fDisconnect = true;
+                }
+                else if (pnode->nPingNonceSent && pnode->nPingUsecStart + TIMEOUT_INTERVAL * 1000000 < GetTimeMicros())
+                {
+                    LogPrintf("ping timeout: %fs\n", 0.000001 * (GetTimeMicros() - pnode->nPingUsecStart));
+                    pnode->fDisconnect = true;
+                }
+            }
+        }
+        {
+            LOCK(cs_vNodes);
+            for (CNode* pnode : vNodesCopy)
+                pnode->Release();
+        }
+    }
+}
+
+
+void ThreadDNSAddressSeed()
+{
+    // goal: only query DNS seeds if address need is acute
+    if ((addrman.size() > 0) &&
+        (!GetBoolArg("-forcednsseed", DEFAULT_FORCEDNSSEED))) {
+        MilliSleep(11 * 1000);
+
+        LOCK(cs_vNodes);
+        if (vNodes.size() >= 2) {
+            LogPrintf("P2P peers available. Skipped DNS seeding.\n");
+            return;
+        }
+    }
+
+    const vector<CDNSSeedData> &vSeeds = Params().DNSSeeds();
+    int found = 0;
+
+    LogPrintf("Loading addresses from DNS seeds (could take a while)\n");
+
+    for (const CDNSSeedData &seed : vSeeds) {
+        if (HaveNameProxy()) {
+            AddOneShot(seed.host);
+        } else {
+            vector<CNetAddr> vIPs;
+            vector<CAddress> vAdd;
+            if (LookupHost(seed.host.c_str(), vIPs))
+            {
+                for (const CNetAddr& ip : vIPs)
+                {
+                    int nOneDay = 24*3600;
+                    CAddress addr = CAddress(CService(ip, Params().GetDefaultPort()));
+                    addr.nTime = GetTime() - 3*nOneDay - GetRand(4*nOneDay); // use a random age between 3 and 7 days old
+                    vAdd.push_back(addr);
+                    found++;
+                }
+            }
+            addrman.Add(vAdd, CNetAddr(seed.name, true));
+        }
+    }
+
+    LogPrintf("%d addresses found from DNS seeds\n", found);
+}
+
+
+
+
+
+
+
+
+
+
+
+
+void DumpAddresses()
+{
+    int64_t nStart = GetTimeMillis();
+
+    CAddrDB adb;
+    adb.Write(addrman);
+
+    LogPrint("net", "Flushed %d addresses to peers.dat  %dms\n",
+           addrman.size(), GetTimeMillis() - nStart);
+}
+
+void DumpData()
+{
+    DumpAddresses();
+    DumpBanlist();
+}
+
+void static ProcessOneShot()
+{
+    string strDest;
+    {
+        LOCK(cs_vOneShots);
+        if (vOneShots.empty())
+            return;
+        strDest = vOneShots.front();
+        vOneShots.pop_front();
+    }
+    CAddress addr;
+    CSemaphoreGrant grant(*semOutbound, true);
+    if (grant) {
+        if (!OpenNetworkConnection(addr, &grant, strDest.c_str(), true))
+            AddOneShot(strDest);
+    }
+}
+
+void ThreadOpenConnections()
+{
+    // Connect to specific addresses
+    if (mapArgs.count("-connect") && mapMultiArgs["-connect"].size() > 0)
+    {
+        for (int64_t nLoop = 0;; nLoop++)
+        {
+            ProcessOneShot();
+            for (const std::string& strAddr : mapMultiArgs["-connect"])
+            {
+                CAddress addr;
+                OpenNetworkConnection(addr, NULL, strAddr.c_str());
+                for (int i = 0; i < 10 && i < nLoop; i++)
+                {
+                    MilliSleep(500);
+                }
+            }
+            MilliSleep(500);
+        }
+    }
+
+    // Initiate network connections
+    int64_t nStart = GetTime();
+    while (true)
+    {
+        ProcessOneShot();
+
+        MilliSleep(500);
+
+        CSemaphoreGrant grant(*semOutbound);
+        boost::this_thread::interruption_point();
+
+        // Add seed nodes if DNS seeds are all down (an infrastructure attack?).
+        if (addrman.size() == 0 && (GetTime() - nStart > 60)) {
+            static bool done = false;
+            if (!done) {
+                LogPrintf("Adding fixed seed nodes as DNS doesn't seem to be available.\n");
+                addrman.Add(convertSeed6(Params().FixedSeeds()), CNetAddr("127.0.0.1"));
+                done = true;
+            }
+        }
+
+        //
+        // Choose an address to connect to based on most recently seen
+        //
+        CAddress addrConnect;
+
+        // Only connect out to one peer per network group (/16 for IPv4).
+        // Do this here so we don't have to critsect vNodes inside mapAddresses critsect.
+        int nOutbound = 0;
+        set<vector<unsigned char> > setConnected;
+        {
+            LOCK(cs_vNodes);
+            for (CNode* pnode : vNodes) {
+                if (!pnode->fInbound) {
+                    setConnected.insert(pnode->addr.GetGroup());
+                    nOutbound++;
+                }
+            }
+        }
+
+        int64_t nANow = GetTime();
+
+        int nTries = 0;
+        while (true)
+        {
+            CAddrInfo addr = addrman.Select();
+
+            // if we selected an invalid address, restart
+            if (!addr.IsValid() || setConnected.count(addr.GetGroup()) || IsLocal(addr))
+                break;
+
+            // If we didn't find an appropriate destination after trying 100 addresses fetched from addrman,
+            // stop this loop, and let the outer loop run again (which sleeps, adds seed nodes, recalculates
+            // already-connected network ranges, ...) before trying new addrman addresses.
+            nTries++;
+            if (nTries > 100)
+                break;
+
+            if (IsLimited(addr))
+                continue;
+
+            // only consider very recently tried nodes after 30 failed attempts
+            if (nANow - addr.nLastTry < 600 && nTries < 30)
+                continue;
+
+            // do not allow non-default ports, unless after 50 invalid addresses selected already
+            if (addr.GetPort() != Params().GetDefaultPort() && nTries < 50)
+                continue;
+
+            addrConnect = addr;
+            break;
+        }
+
+        if (addrConnect.IsValid())
+            OpenNetworkConnection(addrConnect, &grant);
+    }
+}
+
+void ThreadOpenAddedConnections()
+{
+    {
+        LOCK(cs_vAddedNodes);
+        vAddedNodes = mapMultiArgs["-addnode"];
+    }
+
+    if (HaveNameProxy()) {
+        while(true) {
+            list<string> lAddresses(0);
+            {
+                LOCK(cs_vAddedNodes);
+                for (const std::string& strAddNode : vAddedNodes)
+                    lAddresses.push_back(strAddNode);
+            }
+            for (const std::string& strAddNode : lAddresses) {
+                CAddress addr;
+                CSemaphoreGrant grant(*semOutbound);
+                OpenNetworkConnection(addr, &grant, strAddNode.c_str());
+                MilliSleep(500);
+            }
+            MilliSleep(120000); // Retry every 2 minutes
+        }
+    }
+
+    for (unsigned int i = 0; true; i++)
+    {
+        list<string> lAddresses(0);
+        {
+            LOCK(cs_vAddedNodes);
+            for (const std::string& strAddNode : vAddedNodes)
+                lAddresses.push_back(strAddNode);
+        }
+
+        list<vector<CService> > lservAddressesToAdd(0);
+        for (const std::string& strAddNode : lAddresses) {
+            vector<CService> vservNode(0);
+            if(Lookup(strAddNode.c_str(), vservNode, Params().GetDefaultPort(), fNameLookup, 0))
+            {
+                lservAddressesToAdd.push_back(vservNode);
+                {
+                    LOCK(cs_setservAddNodeAddresses);
+                    for (const CService& serv : vservNode)
+                        setservAddNodeAddresses.insert(serv);
+                }
+            }
+        }
+        // Attempt to connect to each IP for each addnode entry until at least one is successful per addnode entry
+        // (keeping in mind that addnode entries can have many IPs if fNameLookup)
+        {
+            LOCK(cs_vNodes);
+            for (CNode* pnode : vNodes)
+                for (list<vector<CService> >::iterator it = lservAddressesToAdd.begin(); it != lservAddressesToAdd.end(); it++)
+                    for (const CService& addrNode : *(it))
+                        if (pnode->addr == addrNode)
+                        {
+                            it = lservAddressesToAdd.erase(it);
+                            it--;
+                            break;
+                        }
+        }
+        for (vector<CService>& vserv : lservAddressesToAdd)
+        {
+            CSemaphoreGrant grant(*semOutbound);
+            OpenNetworkConnection(CAddress(vserv[i % vserv.size()]), &grant);
+            MilliSleep(500);
+        }
+        MilliSleep(120000); // Retry every 2 minutes
+    }
+}
+
+// if successful, this moves the passed grant to the constructed node
+bool OpenNetworkConnection(const CAddress& addrConnect, CSemaphoreGrant *grantOutbound, const char *pszDest, bool fOneShot)
+{
+    //
+    // Initiate outbound network connection
+    //
+    boost::this_thread::interruption_point();
+    if (!pszDest) {
+        if (IsLocal(addrConnect) ||
+            FindNode((CNetAddr)addrConnect) || CNode::IsBanned(addrConnect) ||
+            FindNode(addrConnect.ToStringIPPort()))
+            return false;
+    } else if (FindNode(std::string(pszDest)))
+        return false;
+
+    CNode* pnode = ConnectNode(addrConnect, pszDest);
+    boost::this_thread::interruption_point();
+
+    if (!pnode)
+        return false;
+    if (grantOutbound)
+        grantOutbound->MoveTo(pnode->grantOutbound);
+    pnode->fNetworkNode = true;
+    if (fOneShot)
+        pnode->fOneShot = true;
+
+    return true;
+}
+
+
+void ThreadMessageHandler()
+{
+    const CChainParams& chainparams = Params();
+    boost::mutex condition_mutex;
+    boost::unique_lock<boost::mutex> lock(condition_mutex);
+
+    SetThreadPriority(THREAD_PRIORITY_BELOW_NORMAL);
+    while (true)
+    {
+        vector<CNode*> vNodesCopy;
+        {
+            LOCK(cs_vNodes);
+            vNodesCopy = vNodes;
+            for (CNode* pnode : vNodesCopy) {
+                pnode->AddRef();
+            }
+        }
+
+        bool fSleep = true;
+
+        for (CNode* pnode : vNodesCopy)
+        {
+            if (pnode->fDisconnect)
+                continue;
+
+            auto spanGuard = pnode->span.Enter();
+
+            // Receive messages
+            {
+                TRY_LOCK(pnode->cs_vRecvMsg, lockRecv);
+                if (lockRecv)
+                {
+                    if (!g_signals.ProcessMessages(chainparams, pnode))
+                        pnode->CloseSocketDisconnect();
+
+                    if (pnode->nSendSize < SendBufferSize())
+                    {
+                        if (!pnode->vRecvGetData.empty() || (!pnode->vRecvMsg.empty() && pnode->vRecvMsg[0].complete()))
+                        {
+                            fSleep = false;
+                        }
+                    }
+                }
+            }
+            boost::this_thread::interruption_point();
+
+            // Send messages
+            {
+                TRY_LOCK(pnode->cs_vSend, lockSend);
+                if (lockSend)
+                    g_signals.SendMessages(chainparams.GetConsensus(), pnode);
+            }
+            boost::this_thread::interruption_point();
+        }
+
+        {
+            LOCK(cs_vNodes);
+            for (CNode* pnode : vNodesCopy)
+                pnode->Release();
+        }
+
+        if (fSleep)
+            messageHandlerCondition.timed_wait(lock, boost::posix_time::microsec_clock::universal_time() + boost::posix_time::milliseconds(100));
+    }
+}
+
+
+
+
+
+
+bool BindListenPort(const CService &addrBind, string& strError, bool fWhitelisted)
+{
+    strError = "";
+    int nOne = 1;
+
+    // Create socket for listening for incoming connections
+    struct sockaddr_storage sockaddr;
+    socklen_t len = sizeof(sockaddr);
+    if (!addrBind.GetSockAddr((struct sockaddr*)&sockaddr, &len))
+    {
+        strError = strprintf("Error: Bind address family for %s not supported", addrBind.ToString());
+        LogPrintf("%s\n", strError);
+        return false;
+    }
+
+    SOCKET hListenSocket = socket(((struct sockaddr*)&sockaddr)->sa_family, SOCK_STREAM, IPPROTO_TCP);
+    if (hListenSocket == INVALID_SOCKET)
+    {
+        strError = strprintf("Error: Couldn't open socket for incoming connections (socket returned error %s)", NetworkErrorString(WSAGetLastError()));
+        LogPrintf("%s\n", strError);
+        return false;
+    }
+    if (!IsSelectableSocket(hListenSocket))
+    {
+        strError = "Error: Couldn't create a listenable socket for incoming connections";
+        LogPrintf("%s\n", strError);
+        return false;
+    }
+
+
+#ifndef WIN32
+#ifdef SO_NOSIGPIPE
+    // Different way of disabling SIGPIPE on BSD
+    setsockopt(hListenSocket, SOL_SOCKET, SO_NOSIGPIPE, (void*)&nOne, sizeof(int));
+#endif
+    // Allow binding if the port is still in TIME_WAIT state after
+    // the program was closed and restarted.
+    setsockopt(hListenSocket, SOL_SOCKET, SO_REUSEADDR, (void*)&nOne, sizeof(int));
+    // Disable Nagle's algorithm
+    setsockopt(hListenSocket, IPPROTO_TCP, TCP_NODELAY, (void*)&nOne, sizeof(int));
+#else
+    setsockopt(hListenSocket, SOL_SOCKET, SO_REUSEADDR, (const char*)&nOne, sizeof(int));
+    setsockopt(hListenSocket, IPPROTO_TCP, TCP_NODELAY, (const char*)&nOne, sizeof(int));
+#endif
+
+    // Set to non-blocking, incoming connections will also inherit this
+    if (!SetSocketNonBlocking(hListenSocket, true)) {
+        strError = strprintf("BindListenPort: Setting listening socket to non-blocking failed, error %s\n", NetworkErrorString(WSAGetLastError()));
+        LogPrintf("%s\n", strError);
+        return false;
+    }
+
+    // some systems don't have IPV6_V6ONLY but are always v6only; others do have the option
+    // and enable it by default or not. Try to enable it, if possible.
+    if (addrBind.IsIPv6()) {
+#ifdef IPV6_V6ONLY
+#ifdef WIN32
+        setsockopt(hListenSocket, IPPROTO_IPV6, IPV6_V6ONLY, (const char*)&nOne, sizeof(int));
+#else
+        setsockopt(hListenSocket, IPPROTO_IPV6, IPV6_V6ONLY, (void*)&nOne, sizeof(int));
+#endif
+#endif
+#ifdef WIN32
+        int nProtLevel = PROTECTION_LEVEL_UNRESTRICTED;
+        setsockopt(hListenSocket, IPPROTO_IPV6, IPV6_PROTECTION_LEVEL, (const char*)&nProtLevel, sizeof(int));
+#endif
+    }
+
+    if (::bind(hListenSocket, (struct sockaddr*)&sockaddr, len) == SOCKET_ERROR)
+    {
+        int nErr = WSAGetLastError();
+        if (nErr == WSAEADDRINUSE)
+            strError = strprintf(_("Unable to bind to %s on this computer. Zcash is probably already running."), addrBind.ToString());
+        else
+            strError = strprintf(_("Unable to bind to %s on this computer (bind returned error %s)"), addrBind.ToString(), NetworkErrorString(nErr));
+        LogPrintf("%s\n", strError);
+        CloseSocket(hListenSocket);
+        return false;
+    }
+    LogPrintf("Bound to %s\n", addrBind.ToString());
+
+    // Listen for incoming connections
+    if (listen(hListenSocket, SOMAXCONN) == SOCKET_ERROR)
+    {
+        strError = strprintf(_("Error: Listening for incoming connections failed (listen returned error %s)"), NetworkErrorString(WSAGetLastError()));
+        LogPrintf("%s\n", strError);
+        CloseSocket(hListenSocket);
+        return false;
+    }
+
+    vhListenSocket.push_back(ListenSocket(hListenSocket, fWhitelisted));
+
+    if (addrBind.IsRoutable() && fDiscover && !fWhitelisted)
+        AddLocal(addrBind, LOCAL_BIND);
+
+    return true;
+}
+
+void static Discover(boost::thread_group& threadGroup)
+{
+    if (!fDiscover)
+        return;
+
+#ifdef WIN32
+    // Get local host IP
+    char pszHostName[256] = "";
+    if (gethostname(pszHostName, sizeof(pszHostName)) != SOCKET_ERROR)
+    {
+        vector<CNetAddr> vaddr;
+        if (LookupHost(pszHostName, vaddr))
+        {
+            for (const CNetAddr &addr : vaddr)
+            {
+                if (AddLocal(addr, LOCAL_IF))
+                    LogPrintf("%s: %s - %s\n", __func__, pszHostName, addr.ToString());
+            }
+        }
+    }
+#else
+    // Get local host ip
+    struct ifaddrs* myaddrs;
+    if (getifaddrs(&myaddrs) == 0)
+    {
+        for (struct ifaddrs* ifa = myaddrs; ifa != NULL; ifa = ifa->ifa_next)
+        {
+            if (ifa->ifa_addr == NULL) continue;
+            if ((ifa->ifa_flags & IFF_UP) == 0) continue;
+            if (strcmp(ifa->ifa_name, "lo") == 0) continue;
+            if (strcmp(ifa->ifa_name, "lo0") == 0) continue;
+            if (ifa->ifa_addr->sa_family == AF_INET)
+            {
+                struct sockaddr_in* s4 = (struct sockaddr_in*)(ifa->ifa_addr);
+                CNetAddr addr(s4->sin_addr);
+                if (AddLocal(addr, LOCAL_IF))
+                    LogPrintf("%s: IPv4 %s: %s\n", __func__, ifa->ifa_name, addr.ToString());
+            }
+            else if (ifa->ifa_addr->sa_family == AF_INET6)
+            {
+                struct sockaddr_in6* s6 = (struct sockaddr_in6*)(ifa->ifa_addr);
+                CNetAddr addr(s6->sin6_addr);
+                if (AddLocal(addr, LOCAL_IF))
+                    LogPrintf("%s: IPv6 %s: %s\n", __func__, ifa->ifa_name, addr.ToString());
+            }
+        }
+        freeifaddrs(myaddrs);
+    }
+#endif
+}
+
+void StartNode(boost::thread_group& threadGroup, CScheduler& scheduler)
+{
+    uiInterface.InitMessage(_("Loading addresses..."));
+    // Load addresses from peers.dat
+    int64_t nStart = GetTimeMillis();
+    {
+        CAddrDB adb;
+        if (adb.Read(addrman))
+            LogPrintf("Loaded %i addresses from peers.dat  %dms\n", addrman.size(), GetTimeMillis() - nStart);
+        else {
+            addrman.Clear(); // Addrman can be in an inconsistent state after failure, reset it
+            LogPrintf("Invalid or missing peers.dat; recreating\n");
+            DumpAddresses();
+        }
+    }
+
+    uiInterface.InitMessage(_("Loading banlist..."));
+    // Load addresses from banlist.dat
+    nStart = GetTimeMillis();
+    if (!GetBoolArg("-reindex", false)) {
+        CBanDB bandb;
+        banmap_t banmap;
+        if (bandb.Read(banmap)) {
+            CNode::SetBanned(banmap); // thread save setter
+            CNode::SetBannedSetDirty(false); // no need to write down, just read data
+            CNode::SweepBanned(); // sweep out unused entries
+
+            LogPrint("net", "Loaded %d banned node ips/subnets from banlist.dat  %dms\n",
+                banmap.size(), GetTimeMillis() - nStart);
+        } else {
+            LogPrintf("Invalid or missing banlist.dat; recreating\n");
+            CNode::SetBannedSetDirty(true); // force write
+            DumpBanlist();
+        }
+    } else {
+        LogPrintf("Clearing banlist.dat for reindex\n");
+        CNode::SetBannedSetDirty(true); // force write
+        DumpBanlist();
+    }
+
+    uiInterface.InitMessage(_("Starting network threads..."));
+
+    fAddressesInitialized = true;
+
+    if (semOutbound == NULL) {
+        // initialize semaphore
+        int nMaxOutbound = std::min(MAX_OUTBOUND_CONNECTIONS, nMaxConnections);
+        semOutbound = new CSemaphore(nMaxOutbound);
+    }
+
+    if (pnodeLocalHost == NULL)
+        pnodeLocalHost = new CNode(INVALID_SOCKET, CAddress(CService("127.0.0.1", 0), nLocalServices));
+
+    Discover(threadGroup);
+
+    //
+    // Start threads
+    //
+
+    if (!GetBoolArg("-dnsseed", true))
+        LogPrintf("DNS seeding disabled\n");
+    else
+        threadGroup.create_thread(boost::bind(&TraceThread<void (*)()>, "dnsseed", &ThreadDNSAddressSeed));
+
+    // Send and receive from sockets, accept connections
+    threadGroup.create_thread(boost::bind(&TraceThread<void (*)()>, "net", &ThreadSocketHandler));
+
+    // Initiate outbound connections from -addnode
+    threadGroup.create_thread(boost::bind(&TraceThread<void (*)()>, "addcon", &ThreadOpenAddedConnections));
+
+    // Initiate outbound connections unless connect=0
+    if (!mapArgs.count("-connect") || mapMultiArgs["-connect"].size() != 1 || mapMultiArgs["-connect"][0] != "0")
+        threadGroup.create_thread(boost::bind(&TraceThread<void (*)()>, "opencon", &ThreadOpenConnections));
+
+    // Process messages
+    threadGroup.create_thread(boost::bind(&TraceThread<void (*)()>, "msghand", &ThreadMessageHandler));
+
+    // Dump network addresses
+    scheduler.scheduleEvery(&DumpData, DUMP_ADDRESSES_INTERVAL);
+}
+
+bool StopNode()
+{
+    LogPrintf("StopNode()\n");
+    if (semOutbound)
+        for (int i=0; i<MAX_OUTBOUND_CONNECTIONS; i++)
+            semOutbound->post();
+
+    if (fAddressesInitialized)
+    {
+        DumpData();
+        fAddressesInitialized = false;
+    }
+
+    return true;
+}
+
+static class CNetCleanup
+{
+public:
+    CNetCleanup() {}
+
+    ~CNetCleanup()
+    {
+        // Close sockets
+        for (CNode* pnode : vNodes) {
+            LOCK(pnode->cs_hSocket);
+            if (pnode->hSocket != INVALID_SOCKET)
+                CloseSocket(pnode->hSocket);
+        }
+        for (ListenSocket& hListenSocket : vhListenSocket)
+            if (hListenSocket.socket != INVALID_SOCKET)
+                if (!CloseSocket(hListenSocket.socket))
+                    LogPrintf("CloseSocket(hListenSocket) failed with error %s\n", NetworkErrorString(WSAGetLastError()));
+
+        // clean up some globals (to help leak detection)
+        for (CNode *pnode : vNodes)
+            delete pnode;
+        for (CNode *pnode : vNodesDisconnected)
+            delete pnode;
+        vNodes.clear();
+        vNodesDisconnected.clear();
+        vhListenSocket.clear();
+        delete semOutbound;
+        semOutbound = NULL;
+        delete pnodeLocalHost;
+        pnodeLocalHost = NULL;
+
+#ifdef WIN32
+        // Shutdown Windows Sockets
+        WSACleanup();
+#endif
+    }
+}
+instance_of_cnetcleanup;
+
+
+
+
+
+
+
+void RelayTransaction(const CTransaction& tx)
+{
+    LOCK(cs_vNodes);
+    for (CNode* pnode : vNodes)
+    {
+        pnode->PushTxInventory(tx.GetWTxId());
+    }
+}
+
+void CNode::RecordBytesRecv(uint64_t bytes)
+{
+    LOCK(cs_totalBytesRecv);
+    nTotalBytesRecv += bytes;
+    MetricsCounter("zcash.net.in.bytes.total", bytes);
+}
+
+void CNode::RecordBytesSent(uint64_t bytes)
+{
+    LOCK(cs_totalBytesSent);
+    nTotalBytesSent += bytes;
+    MetricsCounter("zcash.net.out.bytes.total", bytes);
+
+    uint64_t now = GetTime();
+    if (nMaxOutboundCycleStartTime + nMaxOutboundTimeframe < now)
+    {
+        // timeframe expired, reset cycle
+        nMaxOutboundCycleStartTime = now;
+        nMaxOutboundTotalBytesSentInCycle = 0;
+    }
+
+    // TODO, exclude whitebind peers
+    nMaxOutboundTotalBytesSentInCycle += bytes;
+}
+
+void CNode::SetMaxOutboundTarget(uint64_t targetSpacing, uint64_t limit)
+{
+    LOCK(cs_totalBytesSent);
+    uint64_t recommendedMinimum = (nMaxOutboundTimeframe / targetSpacing) * MAX_BLOCK_SIZE;
+    nMaxOutboundLimit = limit;
+
+    if (limit > 0 && limit < recommendedMinimum)
+        LogPrintf("Max outbound target is very small (%s bytes) and will be overshot. Recommended minimum is %s bytes.\n", nMaxOutboundLimit, recommendedMinimum);
+}
+
+uint64_t CNode::GetMaxOutboundTarget()
+{
+    LOCK(cs_totalBytesSent);
+    return nMaxOutboundLimit;
+}
+
+uint64_t CNode::GetMaxOutboundTimeframe()
+{
+    LOCK(cs_totalBytesSent);
+    return nMaxOutboundTimeframe;
+}
+
+uint64_t CNode::GetMaxOutboundTimeLeftInCycle()
+{
+    LOCK(cs_totalBytesSent);
+    if (nMaxOutboundLimit == 0)
+        return 0;
+
+    if (nMaxOutboundCycleStartTime == 0)
+        return nMaxOutboundTimeframe;
+
+    uint64_t cycleEndTime = nMaxOutboundCycleStartTime + nMaxOutboundTimeframe;
+    uint64_t now = GetTime();
+    return (cycleEndTime < now) ? 0 : cycleEndTime - GetTime();
+}
+
+void CNode::SetMaxOutboundTimeframe(uint64_t timeframe)
+{
+    LOCK(cs_totalBytesSent);
+    if (nMaxOutboundTimeframe != timeframe)
+    {
+        // reset measure-cycle in case of changing
+        // the timeframe
+        nMaxOutboundCycleStartTime = GetTime();
+    }
+    nMaxOutboundTimeframe = timeframe;
+}
+
+bool CNode::OutboundTargetReached(uint64_t targetSpacing, bool historicalBlockServingLimit)
+{
+    LOCK(cs_totalBytesSent);
+    if (nMaxOutboundLimit == 0) {
+        return false;
+    }
+
+    if (historicalBlockServingLimit)
+    {
+        // keep a large enough buffer to at least relay each block once
+        uint64_t timeLeftInCycle = GetMaxOutboundTimeLeftInCycle();
+        uint64_t buffer = timeLeftInCycle / targetSpacing * MAX_BLOCK_SIZE;
+        return (buffer >= nMaxOutboundLimit || nMaxOutboundTotalBytesSentInCycle >= nMaxOutboundLimit - buffer);
+    } else {
+        return nMaxOutboundTotalBytesSentInCycle >= nMaxOutboundLimit;
+    }
+}
+
+uint64_t CNode::GetOutboundTargetBytesLeft()
+{
+    LOCK(cs_totalBytesSent);
+    if (nMaxOutboundLimit == 0)
+        return 0;
+
+    return (nMaxOutboundTotalBytesSentInCycle >= nMaxOutboundLimit) ? 0 : nMaxOutboundLimit - nMaxOutboundTotalBytesSentInCycle;
+}
+
+uint64_t CNode::GetTotalBytesRecv()
+{
+    LOCK(cs_totalBytesRecv);
+    return nTotalBytesRecv;
+}
+
+uint64_t CNode::GetTotalBytesSent()
+{
+    LOCK(cs_totalBytesSent);
+    return nTotalBytesSent;
+}
+
+void CNode::Fuzz(int nChance)
+{
+    if (!fSuccessfullyConnected) return; // Don't fuzz initial handshake
+    if (GetRand(nChance) != 0) return; // Fuzz 1 of every nChance messages
+
+    switch (GetRand(3))
+    {
+    case 0:
+        // xor a random byte with a random value:
+        if (!ssSend.empty()) {
+            CDataStream::size_type pos = GetRand(ssSend.size());
+            ssSend[pos] ^= (unsigned char)(GetRand(256));
+        }
+        break;
+    case 1:
+        // delete a random byte:
+        if (!ssSend.empty()) {
+            CDataStream::size_type pos = GetRand(ssSend.size());
+            ssSend.erase(ssSend.begin()+pos);
+        }
+        break;
+    case 2:
+        // insert a random byte at a random position
+        {
+            CDataStream::size_type pos = GetRand(ssSend.size());
+            char ch = (char)GetRand(256);
+            ssSend.insert(ssSend.begin()+pos, ch);
+        }
+        break;
+    }
+    // Chance of more than one change half the time:
+    // (more changes exponentially less likely):
+    Fuzz(2);
+}
+
+unsigned int ReceiveFloodSize() { return 1000*GetArg("-maxreceivebuffer", DEFAULT_MAXRECEIVEBUFFER); }
+unsigned int SendBufferSize() { return 1000*GetArg("-maxsendbuffer", DEFAULT_MAXSENDBUFFER); }
+
+CNode::CNode(SOCKET hSocketIn, const CAddress& addrIn, const std::string& addrNameIn, bool fInboundIn) :
+    ssSend(SER_NETWORK, INIT_PROTO_VERSION),
+    nTimeConnected(GetTime()),
+    addr(addrIn),
+    nKeyedNetGroup(CalculateKeyedNetGroup(addrIn)),
+    addrKnown(5000, 0.001),
+    filterInventoryKnown(50000, 0.000001)
+{
+    nServices = 0;
+    hSocket = hSocketIn;
+    nRecvVersion = INIT_PROTO_VERSION;
+    nLastSend = 0;
+    nLastRecv = 0;
+    nSendBytes = 0;
+    nRecvBytes = 0;
+    nTimeOffset = 0;
+    addrName = addrNameIn == "" ? addr.ToStringIPPort() : addrNameIn;
+    nVersion = 0;
+    strSubVer = "";
+    fWhitelisted = false;
+    fOneShot = false;
+    fClient = false; // set by version message
+    fInbound = fInboundIn;
+    fNetworkNode = false;
+    fSuccessfullyConnected = false;
+    fDisconnect = false;
+    nRefCount = 0;
+    nSendSize = 0;
+    nSendOffset = 0;
+    hashContinue = uint256();
+    nStartingHeight = -1;
+    filterInventoryKnown.reset();
+    fSendMempool = false;
+    fGetAddr = false;
+    nNextLocalAddrSend = 0;
+    nNextAddrSend = 0;
+    nNextInvSend = 0;
+    fRelayTxes = false;
+    fSentAddr = false;
+    pfilter = new CBloomFilter();
+    timeLastMempoolReq = 0;
+    nPingNonceSent = 0;
+    nPingUsecStart = 0;
+    nPingUsecTime = 0;
+    fPingQueued = false;
+    nMinPingUsecTime = std::numeric_limits<int64_t>::max();
+
+    {
+        LOCK(cs_nLastNodeId);
+        id = nLastNodeId++;
+    }
+    idStr = tfm::format("%d", id);
+
+    ReloadTracingSpan();
+
+    auto spanGuard = span.Enter();
+    LogPrint("net", "Added connection");
+
+    // Be shy and don't send version until we hear
+    if (hSocket != INVALID_SOCKET && !fInbound)
+        PushVersion();
+
+    GetNodeSignals().InitializeNode(GetId(), this);
+}
+
+CNode::~CNode()
+{
+    CloseSocket(hSocket);
+
+    if (pfilter)
+        delete pfilter;
+
+    GetNodeSignals().FinalizeNode(GetId());
+}
+
+void CNode::ReloadTracingSpan()
+{
+    if (fLogIPs) {
+        span = TracingSpan("info", "net", "Peer",
+            "id", idStr.c_str(),
+            "addr", addrName.c_str());
+    } else {
+        span = TracingSpan("info", "net", "Peer",
+            "id", idStr.c_str());
+    }
+}
+
+void CNode::AskFor(const CInv& inv)
+{
+    if (mapAskFor.size() > MAPASKFOR_MAX_SZ || setAskFor.size() > SETASKFOR_MAX_SZ)
+        return;
+    WTxId wtxid(inv.hash, inv.hashAux);
+    // a peer may not have multiple non-responded queue positions for a single inv item
+    if (!setAskFor.insert(wtxid).second)
+        return;
+
+    // We're using mapAskFor as a priority queue,
+    // the key is the earliest time the request can be sent
+    int64_t nRequestTime;
+    limitedmap<WTxId, int64_t>::const_iterator it = mapAlreadyAskedFor.find(wtxid);
+    if (it != mapAlreadyAskedFor.end())
+        nRequestTime = it->second;
+    else
+        nRequestTime = 0;
+    LogPrint("net", "askfor %s  %d (%s) peer=%d\n", inv.ToString(), nRequestTime, DateTimeStrFormat("%H:%M:%S", nRequestTime/1000000), id);
+
+    // Make sure not to reuse time indexes to keep things in the same order
+    int64_t nNow = GetTimeMicros() - 1000000;
+    static int64_t nLastTime;
+    ++nLastTime;
+    nNow = std::max(nNow, nLastTime);
+    nLastTime = nNow;
+
+    // Each retry is 2 minutes after the last
+    nRequestTime = std::max(nRequestTime + 2 * 60 * 1000000, nNow);
+    if (it != mapAlreadyAskedFor.end())
+        mapAlreadyAskedFor.update(it, nRequestTime);
+    else
+        mapAlreadyAskedFor.insert(std::make_pair(wtxid, nRequestTime));
+    mapAskFor.insert(std::make_pair(nRequestTime, inv));
+}
+
+void CNode::BeginMessage(const char* pszCommand) EXCLUSIVE_LOCK_FUNCTION(cs_vSend)
+{
+    ENTER_CRITICAL_SECTION(cs_vSend);
+    assert(ssSend.size() == 0);
+    assert(strSendCommand.empty());
+    ssSend << CMessageHeader(Params().MessageStart(), pszCommand, 0);
+    strSendCommand = SanitizeString(pszCommand);
+    LogPrint("net", "sending: %s ", strSendCommand);
+}
+
+void CNode::AbortMessage() UNLOCK_FUNCTION(cs_vSend)
+{
+    ssSend.clear();
+    strSendCommand.clear();
+
+    LEAVE_CRITICAL_SECTION(cs_vSend);
+
+    LogPrint("net", "(aborted)\n");
+}
+
+void CNode::EndMessage() UNLOCK_FUNCTION(cs_vSend)
+{
+    MetricsIncrementCounter("zcash.net.out.messages", "command", strSendCommand.c_str());
+    // The -*messagestest options are intentionally not documented in the help message,
+    // since they are only used during development to debug the networking code and are
+    // not intended for end-users.
+    if (mapArgs.count("-dropmessagestest") && GetRand(GetArg("-dropmessagestest", 2)) == 0)
+    {
+        LogPrint("net", "dropmessages DROPPING SEND MESSAGE\n");
+        AbortMessage();
+        return;
+    }
+    if (mapArgs.count("-fuzzmessagestest"))
+        Fuzz(GetArg("-fuzzmessagestest", 10));
+
+    if (ssSend.size() == 0)
+    {
+        LEAVE_CRITICAL_SECTION(cs_vSend);
+        return;
+    }
+    // Set the size
+    unsigned int nSize = ssSend.size() - CMessageHeader::HEADER_SIZE;
+    WriteLE32((uint8_t*)&ssSend[CMessageHeader::MESSAGE_SIZE_OFFSET], nSize);
+
+    // Set the checksum
+    uint256 hash = Hash(ssSend.begin() + CMessageHeader::HEADER_SIZE, ssSend.end());
+    assert(ssSend.size () >= CMessageHeader::CHECKSUM_OFFSET + CMessageHeader::CHECKSUM_SIZE);
+    memcpy((char*)&ssSend[CMessageHeader::CHECKSUM_OFFSET], hash.begin(), CMessageHeader::CHECKSUM_SIZE);
+
+    LogPrint("net", "(%d bytes) peer=%d\n", nSize, id);
+
+    std::deque<CSerializeData>::iterator it = vSendMsg.insert(vSendMsg.end(), CSerializeData());
+    ssSend.GetAndClear(*it);
+    nSendSize += (*it).size();
+    MetricsCounter(
+        "zcash.net.out.bytes", (*it).size(),
+        "command", strSendCommand.c_str());
+    strSendCommand.clear();
+
+    // If write queue empty, attempt "optimistic write"
+    if (it == vSendMsg.begin())
+        SocketSendData(this);
+
+    LEAVE_CRITICAL_SECTION(cs_vSend);
+}
+
+/* static */ uint64_t CNode::CalculateKeyedNetGroup(const CAddress& ad)
+{
+    static const uint64_t k0 = GetRand(std::numeric_limits<uint64_t>::max());
+    static const uint64_t k1 = GetRand(std::numeric_limits<uint64_t>::max());
+
+    std::vector<unsigned char> vchNetGroup(ad.GetGroup());
+
+    return CSipHasher(k0, k1).Write(&vchNetGroup[0], vchNetGroup.size()).Finalize();
+}
+
+int64_t PoissonNextSend(int64_t nNow, int average_interval_seconds) {
+    return nNow + (int64_t)(log1p(GetRand(1ULL << 48) * -0.0000000000000035527136788 /* -1/2^48 */) * average_interval_seconds * -1000000.0 + 0.5);
+}
diff --git a/depend/zcash/src/net.h b/depend/zcash/src/net.h
new file mode 100644
index 000000000..6e9e27b7b
--- /dev/null
+++ b/depend/zcash/src/net.h
@@ -0,0 +1,742 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_NET_H
+#define BITCOIN_NET_H
+
+#include "addrdb.h"
+#include "bloom.h"
+#include "compat.h"
+#include "fs.h"
+#include "limitedmap.h"
+#include "netbase.h"
+#include "protocol.h"
+#include "random.h"
+#include "streams.h"
+#include "sync.h"
+#include "uint256.h"
+#include "utilstrencodings.h"
+#include "chainparams.h"
+
+#include <atomic>
+#include <deque>
+#include <stdint.h>
+
+#ifndef WIN32
+#include <arpa/inet.h>
+#endif
+
+#include <boost/signals2/signal.hpp>
+
+#include <tracing.h>
+
+class CAddrMan;
+class CBlockIndex;
+class CScheduler;
+class CNode;
+
+namespace boost {
+    class thread_group;
+} // namespace boost
+
+/** Time between pings automatically sent out for latency probing and keepalive (in seconds). */
+static const int PING_INTERVAL = 2 * 60;
+/** Time after which to disconnect, after waiting for a ping response (or inactivity). */
+static const int TIMEOUT_INTERVAL = 20 * 60;
+/** The maximum number of entries in an 'inv' protocol message */
+static const unsigned int MAX_INV_SZ = 50000;
+/** The maximum number of new addresses to accumulate before announcing. */
+static const unsigned int MAX_ADDR_TO_SEND = 1000;
+/** Maximum length of incoming protocol messages (no message over 2 MiB is currently acceptable). */
+static const unsigned int MAX_PROTOCOL_MESSAGE_LENGTH = 2 * 1024 * 1024;
+/** Maximum length of strSubVer in `version` message */
+static const unsigned int MAX_SUBVERSION_LENGTH = 256;
+/** -listen default */
+static const bool DEFAULT_LISTEN = true;
+/** The maximum number of entries in mapAskFor */
+static const size_t MAPASKFOR_MAX_SZ = MAX_INV_SZ;
+/** The maximum number of entries in setAskFor (larger due to getdata latency)*/
+static const size_t SETASKFOR_MAX_SZ = 2 * MAX_INV_SZ;
+/** The maximum number of peer connections to maintain. */
+static const unsigned int DEFAULT_MAX_PEER_CONNECTIONS = 125;
+/** The default for -maxuploadtarget. 0 = Unlimited */
+static const uint64_t DEFAULT_MAX_UPLOAD_TARGET = 0;
+/** Default for blocks only*/
+static const bool DEFAULT_BLOCKSONLY = false;
+/**
+ * The period before a network upgrade activates, where connections to upgrading peers are preferred (in blocks).
+ * This was three days for upgrades up to and including Blossom, and is 1.5 days from Heartwood onward.
+ */
+static const int NETWORK_UPGRADE_PEER_PREFERENCE_BLOCK_PERIOD = 1728;
+
+static const bool DEFAULT_FORCEDNSSEED = false;
+static const size_t DEFAULT_MAXRECEIVEBUFFER = 5 * 1000;
+static const size_t DEFAULT_MAXSENDBUFFER    = 1 * 1000;
+
+// NOTE: When adjusting this, update rpcnet:setban's help ("24h")
+static const unsigned int DEFAULT_MISBEHAVING_BANTIME = 60 * 60 * 24;  // Default 24-hour ban
+
+unsigned int ReceiveFloodSize();
+unsigned int SendBufferSize();
+
+void AddOneShot(const std::string& strDest);
+void AddressCurrentlyConnected(const CService& addr);
+CNode* FindNode(const CNetAddr& ip);
+CNode* FindNode(const CSubNet& subNet);
+CNode* FindNode(const std::string& addrName);
+CNode* FindNode(const CService& ip);
+CNode* ConnectNode(CAddress addrConnect, const char *pszDest = NULL);
+bool OpenNetworkConnection(const CAddress& addrConnect, CSemaphoreGrant *grantOutbound = NULL, const char *strDest = NULL, bool fOneShot = false);
+unsigned short GetListenPort();
+bool BindListenPort(const CService &bindAddr, std::string& strError, bool fWhitelisted = false);
+void StartNode(boost::thread_group& threadGroup, CScheduler& scheduler);
+bool StopNode();
+void SocketSendData(CNode *pnode);
+
+typedef int NodeId;
+
+struct CombinerAll
+{
+    typedef bool result_type;
+
+    template<typename I>
+    bool operator()(I first, I last) const
+    {
+        while (first != last) {
+            if (!(*first)) return false;
+            ++first;
+        }
+        return true;
+    }
+};
+
+// Signals for message handling
+struct CNodeSignals
+{
+    boost::signals2::signal<int ()> GetHeight;
+    boost::signals2::signal<bool (const CChainParams&, CNode*), CombinerAll> ProcessMessages;
+    boost::signals2::signal<bool (const Consensus::Params&, CNode*), CombinerAll> SendMessages;
+    boost::signals2::signal<void (NodeId, const CNode*)> InitializeNode;
+    boost::signals2::signal<void (NodeId)> FinalizeNode;
+};
+
+
+CNodeSignals& GetNodeSignals();
+
+
+enum
+{
+    LOCAL_NONE,   // unknown
+    LOCAL_IF,     // address a local interface listens on
+    LOCAL_BIND,   // address explicit bound to
+    LOCAL_UPNP,   // unused (was: address reported by UPnP)
+    LOCAL_MANUAL, // address explicitly specified (-externalip=)
+
+    LOCAL_MAX
+};
+
+bool IsPeerAddrLocalGood(CNode *pnode);
+void AdvertizeLocal(CNode *pnode);
+void SetLimited(enum Network net, bool fLimited = true);
+bool IsLimited(enum Network net);
+bool IsLimited(const CNetAddr& addr);
+bool AddLocal(const CService& addr, int nScore = LOCAL_NONE);
+bool AddLocal(const CNetAddr& addr, int nScore = LOCAL_NONE);
+bool RemoveLocal(const CService& addr);
+bool SeenLocal(const CService& addr);
+bool IsLocal(const CService& addr);
+bool GetLocal(CService &addr, const CNetAddr *paddrPeer = NULL);
+bool IsReachable(enum Network net);
+bool IsReachable(const CNetAddr &addr);
+CAddress GetLocalAddress(const CNetAddr *paddrPeer = NULL);
+
+
+extern bool fDiscover;
+extern bool fListen;
+extern uint64_t nLocalServices;
+extern uint64_t nLocalHostNonce;
+extern CAddrMan addrman;
+
+/** Maximum number of connections to simultaneously allow (aka connection slots) */
+extern int nMaxConnections;
+
+extern std::vector<CNode*> vNodes;
+extern CCriticalSection cs_vNodes;
+extern limitedmap<WTxId, int64_t> mapAlreadyAskedFor;
+
+extern std::vector<std::string> vAddedNodes;
+extern CCriticalSection cs_vAddedNodes;
+
+extern NodeId nLastNodeId;
+extern CCriticalSection cs_nLastNodeId;
+
+/** Subversion as sent to the P2P network in `version` messages */
+extern std::string strSubVersion;
+
+struct LocalServiceInfo {
+    int nScore;
+    int nPort;
+};
+
+extern CCriticalSection cs_mapLocalHost;
+extern std::map<CNetAddr, LocalServiceInfo> mapLocalHost;
+
+class CNodeStats
+{
+public:
+    NodeId nodeid;
+    uint64_t nServices;
+    bool fRelayTxes;
+    int64_t nLastSend;
+    int64_t nLastRecv;
+    int64_t nTimeConnected;
+    int64_t nTimeOffset;
+    std::string addrName;
+    int nVersion;
+    std::string cleanSubVer;
+    bool fInbound;
+    int nStartingHeight;
+    uint64_t nSendBytes;
+    uint64_t nRecvBytes;
+    bool fWhitelisted;
+    double dPingTime;
+    double dPingWait;
+    std::string addrLocal;
+};
+
+
+
+
+class CNetMessage {
+public:
+    bool in_data;                   // parsing header (false) or data (true)
+
+    CDataStream hdrbuf;             // partially received header
+    CMessageHeader hdr;             // complete header
+    unsigned int nHdrPos;
+
+    CDataStream vRecv;              // received message data
+    unsigned int nDataPos;
+
+    int64_t nTime;                  // time (in microseconds) of message receipt.
+
+    CNetMessage(const CMessageHeader::MessageStartChars& pchMessageStartIn, int nTypeIn, int nVersionIn) : hdrbuf(nTypeIn, nVersionIn), hdr(pchMessageStartIn), vRecv(nTypeIn, nVersionIn) {
+        hdrbuf.resize(24);
+        in_data = false;
+        nHdrPos = 0;
+        nDataPos = 0;
+        nTime = 0;
+    }
+
+    bool complete() const
+    {
+        if (!in_data)
+            return false;
+        return (hdr.nMessageSize == nDataPos);
+    }
+
+    void SetVersion(int nVersionIn)
+    {
+        hdrbuf.SetVersion(nVersionIn);
+        vRecv.SetVersion(nVersionIn);
+    }
+
+    int readHeader(const char *pch, unsigned int nBytes);
+    int readData(const char *pch, unsigned int nBytes);
+};
+
+
+/** Information about a peer */
+class CNode
+{
+public:
+    // socket
+    std::atomic<uint64_t> nServices;
+    SOCKET hSocket;
+    CDataStream ssSend;
+    std::string strSendCommand; // Current command being assembled in ssSend
+    size_t nSendSize; // total size of all vSendMsg entries
+    size_t nSendOffset; // offset inside the first vSendMsg already sent
+    uint64_t nSendBytes;
+    std::deque<CSerializeData> vSendMsg;
+    CCriticalSection cs_vSend;
+    CCriticalSection cs_hSocket;
+    CCriticalSection cs_vRecv;
+
+    std::deque<CInv> vRecvGetData;
+    std::deque<CNetMessage> vRecvMsg;
+    CCriticalSection cs_vRecvMsg;
+    uint64_t nRecvBytes;
+    int nRecvVersion;
+
+    std::atomic<int64_t> nLastSend;
+    std::atomic<int64_t> nLastRecv;
+    const int64_t nTimeConnected;
+    std::atomic<int64_t> nTimeOffset;
+    const CAddress addr;
+    int nVersion;
+    // strSubVer is whatever byte array we read from the wire. However, this field is intended
+    // to be printed out, displayed to humans in various forms and so on. So we sanitize it and
+    // store the sanitized version in cleanSubVer. The original should be used when dealing with
+    // the network or wire types and the cleaned string used when displayed or logged.
+    std::string strSubVer, cleanSubVer;
+    CCriticalSection cs_SubVer; // used for both cleanSubVer and strSubVer
+    bool fWhitelisted; // This peer can bypass DoS banning.
+    bool fOneShot;
+    bool fClient;
+    bool fInbound;
+    bool fNetworkNode;
+    bool fSuccessfullyConnected;
+    std::atomic_bool fDisconnect;
+    // We use fRelayTxes for two purposes -
+    // a) it allows us to not relay tx invs before receiving the peer's version message
+    // b) the peer may tell us in its version message that we should not relay tx invs
+    //    unless it loads a bloom filter.
+    bool fRelayTxes; //protected by cs_filter
+    bool fSentAddr;
+    CSemaphoreGrant grantOutbound;
+    CCriticalSection cs_filter;
+    CBloomFilter* pfilter;
+    NodeId id;
+    std::atomic<int> nRefCount;
+
+    const uint64_t nKeyedNetGroup;
+
+    // Stored so we can pass a pointer to it across the Rust FFI for span.
+    std::string idStr;
+
+    tracing::Span span;
+protected:
+
+    // Denial-of-service detection/prevention
+    // Key is IP address, value is banned-until-time
+    static banmap_t setBanned;
+    static CCriticalSection cs_setBanned;
+    static bool setBannedIsDirty;
+
+    // Whitelisted ranges. Any node connecting from these is automatically
+    // whitelisted (as well as those connecting to whitelisted binds).
+    static std::vector<CSubNet> vWhitelistedRange;
+    static CCriticalSection cs_vWhitelistedRange;
+
+    // Basic fuzz-testing
+    void Fuzz(int nChance); // modifies ssSend
+
+public:
+    uint256 hashContinue;
+    std::atomic<int> nStartingHeight;
+
+    // flood relay
+    std::vector<CAddress> vAddrToSend;
+    CRollingBloomFilter addrKnown;
+    bool fGetAddr;
+    std::set<uint256> setKnown;
+    int64_t nNextAddrSend;
+    int64_t nNextLocalAddrSend;
+
+    // inventory based relay
+    CRollingBloomFilter filterInventoryKnown;
+    // Set of transaction ids we still have to announce.
+    // They are sorted by the mempool before relay, so the order is not important.
+    std::set<uint256> setInventoryTxToSend;
+    // List of block ids we still have announce.
+    // There is no final sorting before sending, as they are always sent immediately
+    // and in the order requested.
+    std::vector<uint256> vInventoryBlockToSend;
+    CCriticalSection cs_inventory;
+    std::set<WTxId> setAskFor;
+    std::multimap<int64_t, CInv> mapAskFor;
+    int64_t nNextInvSend;
+    // Used for BIP35 mempool sending, also protected by cs_inventory
+    bool fSendMempool;
+
+    // Last time a "MEMPOOL" request was serviced.
+    std::atomic<int64_t> timeLastMempoolReq;
+    // Ping time measurement:
+    // The pong reply we're expecting, or 0 if no pong expected.
+    std::atomic<uint64_t> nPingNonceSent;
+    // Time (in usec) the last ping was sent, or 0 if no ping was ever sent.
+    std::atomic<int64_t> nPingUsecStart;
+    // Last measured round-trip time.
+    std::atomic<int64_t> nPingUsecTime;
+    // Best measured round-trip time.
+    std::atomic<int64_t> nMinPingUsecTime;
+    // Whether a ping is requested.
+    std::atomic<bool> fPingQueued;
+
+    CNode(SOCKET hSocketIn, const CAddress &addrIn, const std::string &addrNameIn = "", bool fInboundIn = false);
+    ~CNode();
+
+private:
+    // Network usage totals
+    static CCriticalSection cs_totalBytesRecv;
+    static CCriticalSection cs_totalBytesSent;
+    static uint64_t nTotalBytesRecv;
+    static uint64_t nTotalBytesSent;
+
+    // outbound limit & stats
+    static uint64_t nMaxOutboundTotalBytesSentInCycle;
+    static uint64_t nMaxOutboundCycleStartTime;
+    static uint64_t nMaxOutboundLimit;
+    static uint64_t nMaxOutboundTimeframe;
+
+    CNode(const CNode&);
+    void operator=(const CNode&);
+
+    static uint64_t CalculateKeyedNetGroup(const CAddress& ad);
+
+
+    mutable CCriticalSection cs_addrName;
+    std::string addrName;
+
+    CService addrLocal;
+    mutable CCriticalSection cs_addrLocal;
+public:
+
+    // Regenerate the span for this CNode. This re-queries the log filter to see
+    // if the span should be enabled, and re-collects the logged variables.
+    void ReloadTracingSpan();
+
+    NodeId GetId() const {
+      return id;
+    }
+
+    int GetRefCount()
+    {
+        assert(nRefCount >= 0);
+        return nRefCount;
+    }
+
+    // requires LOCK(cs_vRecvMsg)
+    unsigned int GetTotalRecvSize()
+    {
+        unsigned int total = 0;
+        for (const CNetMessage &msg : vRecvMsg)
+            total += msg.vRecv.size() + 24;
+        return total;
+    }
+
+    // requires LOCK(cs_vRecvMsg)
+    bool ReceiveMsgBytes(const char *pch, unsigned int nBytes);
+
+    // requires LOCK(cs_vRecvMsg)
+    void SetRecvVersion(int nVersionIn)
+    {
+        nRecvVersion = nVersionIn;
+        for (CNetMessage &msg : vRecvMsg)
+            msg.SetVersion(nVersionIn);
+    }
+
+    CService GetAddrLocal() const;
+    //! May not be called more than once
+    void SetAddrLocal(const CService& addrLocalIn);
+
+    CNode* AddRef()
+    {
+        nRefCount++;
+        return this;
+    }
+
+    void Release()
+    {
+        nRefCount--;
+    }
+
+
+
+    void AddAddressKnown(const CAddress& addr)
+    {
+        addrKnown.insert(addr.GetKey());
+    }
+
+    void PushAddress(const CAddress& addr, FastRandomContext &insecure_rand)
+    {
+        // Known checking here is only to save space from duplicates.
+        // SendMessages will filter it again for knowns that were added
+        // after addresses were pushed.
+        if (addr.IsValid() && !addrKnown.contains(addr.GetKey())) {
+            if (vAddrToSend.size() >= MAX_ADDR_TO_SEND) {
+                vAddrToSend[insecure_rand.randrange(vAddrToSend.size())] = addr;
+            } else {
+                vAddrToSend.push_back(addr);
+            }
+        }
+    }
+
+
+    void AddKnownTx(const WTxId& wtxid)
+    {
+        {
+            LOCK(cs_inventory);
+            filterInventoryKnown.insert(wtxid.ToBytes());
+        }
+    }
+
+    void PushTxInventory(const WTxId& wtxid)
+    {
+        LOCK(cs_inventory);
+        if (!filterInventoryKnown.contains(wtxid.ToBytes())) {
+            setInventoryTxToSend.insert(wtxid.hash);
+        }
+    }
+
+    void PushBlockInventory(const uint256& hash)
+    {
+        LOCK(cs_inventory);
+        vInventoryBlockToSend.push_back(hash);
+    }
+
+    void AskFor(const CInv& inv);
+
+    // TODO: Document the postcondition of this function.  Is cs_vSend locked?
+    void BeginMessage(const char* pszCommand) EXCLUSIVE_LOCK_FUNCTION(cs_vSend);
+
+    // TODO: Document the precondition of this function.  Is cs_vSend locked?
+    void AbortMessage() UNLOCK_FUNCTION(cs_vSend);
+
+    // TODO: Document the precondition of this function.  Is cs_vSend locked?
+    void EndMessage() UNLOCK_FUNCTION(cs_vSend);
+
+    void PushVersion();
+
+
+    void PushMessage(const char* pszCommand)
+    {
+        try
+        {
+            BeginMessage(pszCommand);
+            EndMessage();
+        }
+        catch (...)
+        {
+            AbortMessage();
+            throw;
+        }
+    }
+
+    template<typename T1>
+    void PushMessage(const char* pszCommand, const T1& a1)
+    {
+        try
+        {
+            BeginMessage(pszCommand);
+            ssSend << a1;
+            EndMessage();
+        }
+        catch (...)
+        {
+            AbortMessage();
+            throw;
+        }
+    }
+
+    template<typename T1, typename T2>
+    void PushMessage(const char* pszCommand, const T1& a1, const T2& a2)
+    {
+        try
+        {
+            BeginMessage(pszCommand);
+            ssSend << a1 << a2;
+            EndMessage();
+        }
+        catch (...)
+        {
+            AbortMessage();
+            throw;
+        }
+    }
+
+    template<typename T1, typename T2, typename T3>
+    void PushMessage(const char* pszCommand, const T1& a1, const T2& a2, const T3& a3)
+    {
+        try
+        {
+            BeginMessage(pszCommand);
+            ssSend << a1 << a2 << a3;
+            EndMessage();
+        }
+        catch (...)
+        {
+            AbortMessage();
+            throw;
+        }
+    }
+
+    template<typename T1, typename T2, typename T3, typename T4>
+    void PushMessage(const char* pszCommand, const T1& a1, const T2& a2, const T3& a3, const T4& a4)
+    {
+        try
+        {
+            BeginMessage(pszCommand);
+            ssSend << a1 << a2 << a3 << a4;
+            EndMessage();
+        }
+        catch (...)
+        {
+            AbortMessage();
+            throw;
+        }
+    }
+
+    template<typename T1, typename T2, typename T3, typename T4, typename T5>
+    void PushMessage(const char* pszCommand, const T1& a1, const T2& a2, const T3& a3, const T4& a4, const T5& a5)
+    {
+        try
+        {
+            BeginMessage(pszCommand);
+            ssSend << a1 << a2 << a3 << a4 << a5;
+            EndMessage();
+        }
+        catch (...)
+        {
+            AbortMessage();
+            throw;
+        }
+    }
+
+    template<typename T1, typename T2, typename T3, typename T4, typename T5, typename T6>
+    void PushMessage(const char* pszCommand, const T1& a1, const T2& a2, const T3& a3, const T4& a4, const T5& a5, const T6& a6)
+    {
+        try
+        {
+            BeginMessage(pszCommand);
+            ssSend << a1 << a2 << a3 << a4 << a5 << a6;
+            EndMessage();
+        }
+        catch (...)
+        {
+            AbortMessage();
+            throw;
+        }
+    }
+
+    template<typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7>
+    void PushMessage(const char* pszCommand, const T1& a1, const T2& a2, const T3& a3, const T4& a4, const T5& a5, const T6& a6, const T7& a7)
+    {
+        try
+        {
+            BeginMessage(pszCommand);
+            ssSend << a1 << a2 << a3 << a4 << a5 << a6 << a7;
+            EndMessage();
+        }
+        catch (...)
+        {
+            AbortMessage();
+            throw;
+        }
+    }
+
+    template<typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8>
+    void PushMessage(const char* pszCommand, const T1& a1, const T2& a2, const T3& a3, const T4& a4, const T5& a5, const T6& a6, const T7& a7, const T8& a8)
+    {
+        try
+        {
+            BeginMessage(pszCommand);
+            ssSend << a1 << a2 << a3 << a4 << a5 << a6 << a7 << a8;
+            EndMessage();
+        }
+        catch (...)
+        {
+            AbortMessage();
+            throw;
+        }
+    }
+
+    template<typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename T8, typename T9>
+    void PushMessage(const char* pszCommand, const T1& a1, const T2& a2, const T3& a3, const T4& a4, const T5& a5, const T6& a6, const T7& a7, const T8& a8, const T9& a9)
+    {
+        try
+        {
+            BeginMessage(pszCommand);
+            ssSend << a1 << a2 << a3 << a4 << a5 << a6 << a7 << a8 << a9;
+            EndMessage();
+        }
+        catch (...)
+        {
+            AbortMessage();
+            throw;
+        }
+    }
+
+    void CloseSocketDisconnect();
+
+    // Denial-of-service detection/prevention
+    // The idea is to detect peers that are behaving
+    // badly and disconnect/ban them, but do it in a
+    // one-coding-mistake-won't-shatter-the-entire-network
+    // way.
+    // IMPORTANT:  There should be nothing I can give a
+    // node that it will forward on that will make that
+    // node's peers drop it. If there is, an attacker
+    // can isolate a node and/or try to split the network.
+    // Dropping a node for sending stuff that is invalid
+    // now but might be valid in a later version is also
+    // dangerous, because it can cause a network split
+    // between nodes running old code and nodes running
+    // new code.
+    static void ClearBanned(); // needed for unit testing
+    static bool IsBanned(CNetAddr ip);
+    static bool IsBanned(CSubNet subnet);
+    static void Ban(const CNetAddr &ip, const BanReason &banReason, int64_t bantimeoffset = 0, bool sinceUnixEpoch = false);
+    static void Ban(const CSubNet &subNet, const BanReason &banReason, int64_t bantimeoffset = 0, bool sinceUnixEpoch = false);
+    static bool Unban(const CNetAddr &ip);
+    static bool Unban(const CSubNet &ip);
+    static void GetBanned(banmap_t &banmap);
+    static void SetBanned(const banmap_t &banmap);
+
+    //!check is the banlist has unwritten changes
+    static bool BannedSetIsDirty();
+    //!set the "dirty" flag for the banlist
+    static void SetBannedSetDirty(bool dirty=true);
+    //!clean unused entries (if bantime has expired)
+    static void SweepBanned();
+
+    void copyStats(CNodeStats &stats);
+
+    static bool IsWhitelistedRange(const CNetAddr &ip);
+    static void AddWhitelistedRange(const CSubNet &subnet);
+
+    // Network stats
+    static void RecordBytesRecv(uint64_t bytes);
+    static void RecordBytesSent(uint64_t bytes);
+
+    static uint64_t GetTotalBytesRecv();
+    static uint64_t GetTotalBytesSent();
+
+    //!set the max outbound target in bytes
+    static void SetMaxOutboundTarget(uint64_t targetSpacing, uint64_t limit);
+    static uint64_t GetMaxOutboundTarget();
+
+    //!set the timeframe for the max outbound target
+    static void SetMaxOutboundTimeframe(uint64_t timeframe);
+    static uint64_t GetMaxOutboundTimeframe();
+
+    //!check if the outbound target is reached
+    // if param historicalBlockServingLimit is set true, the function will
+    // response true if the limit for serving historical blocks has been reached
+    static bool OutboundTargetReached(uint64_t targetSpacing, bool historicalBlockServingLimit);
+
+    //!response the bytes left in the current max outbound cycle
+    // in case of no limit, it will always response 0
+    static uint64_t GetOutboundTargetBytesLeft();
+
+    //!response the time in seconds left in the current max outbound cycle
+    // in case of no limit, it will always respond with 0
+    static uint64_t GetMaxOutboundTimeLeftInCycle();
+    std::string GetAddrName() const;
+    //! Sets the addrName only if it was not previously set
+    void MaybeSetAddrName(const std::string& addrNameIn);
+};
+
+
+
+class CTransaction;
+void RelayTransaction(const CTransaction& tx);
+
+
+/** Return a timestamp in the future (in microseconds) for exponentially distributed events. */
+int64_t PoissonNextSend(int64_t nNow, int average_interval_seconds);
+
+#endif // BITCOIN_NET_H
diff --git a/depend/zcash/src/netbase.cpp b/depend/zcash/src/netbase.cpp
new file mode 100644
index 000000000..98e09cd69
--- /dev/null
+++ b/depend/zcash/src/netbase.cpp
@@ -0,0 +1,1468 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifdef HAVE_CONFIG_H
+#include "config/bitcoin-config.h"
+#endif
+
+#include "netbase.h"
+
+#include "hash.h"
+#include "sync.h"
+#include "uint256.h"
+#include "random.h"
+#include "util.h"
+#include "utilstrencodings.h"
+
+#ifdef HAVE_GETADDRINFO_A
+#include <netdb.h>
+#endif
+
+#ifndef WIN32
+#if HAVE_INET_PTON
+#include <arpa/inet.h>
+#endif
+#include <fcntl.h>
+#endif
+
+#include <boost/algorithm/string/case_conv.hpp> // for to_lower()
+#include <boost/algorithm/string/predicate.hpp> // for startswith() and endswith()
+#include <boost/thread.hpp>
+
+#if !defined(HAVE_MSG_NOSIGNAL) && !defined(MSG_NOSIGNAL)
+#define MSG_NOSIGNAL 0
+#endif
+
+// Settings
+static proxyType proxyInfo[NET_MAX];
+static proxyType nameProxy;
+static CCriticalSection cs_proxyInfos;
+int nConnectTimeout = DEFAULT_CONNECT_TIMEOUT;
+bool fNameLookup = DEFAULT_NAME_LOOKUP;
+
+static const unsigned char pchIPv4[12] = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0xff, 0xff };
+
+// Need ample time for negotiation for very slow proxies such as Tor (milliseconds)
+static const int SOCKS5_RECV_TIMEOUT = 20 * 1000;
+
+enum Network ParseNetwork(std::string net) {
+    boost::to_lower(net);
+    if (net == "ipv4") return NET_IPV4;
+    if (net == "ipv6") return NET_IPV6;
+    if (net == "tor" || net == "onion")  return NET_TOR;
+    return NET_UNROUTABLE;
+}
+
+std::string GetNetworkName(enum Network net) {
+    switch(net)
+    {
+    case NET_IPV4: return "ipv4";
+    case NET_IPV6: return "ipv6";
+    case NET_TOR: return "onion";
+    default: return "";
+    }
+}
+
+void SplitHostPort(std::string in, int &portOut, std::string &hostOut) {
+    size_t colon = in.find_last_of(':');
+    // if a : is found, and it either follows a [...], or no other : is in the string, treat it as port separator
+    bool fHaveColon = colon != in.npos;
+    bool fBracketed = fHaveColon && (in[0]=='[' && in[colon-1]==']'); // if there is a colon, and in[0]=='[', colon is not 0, so in[colon-1] is safe
+    bool fMultiColon = fHaveColon && (in.find_last_of(':',colon-1) != in.npos);
+    if (fHaveColon && (colon==0 || fBracketed || !fMultiColon)) {
+        int32_t n;
+        if (ParseInt32(in.substr(colon + 1), &n) && n > 0 && n < 0x10000) {
+            in = in.substr(0, colon);
+            portOut = n;
+        }
+    }
+    if (in.size()>0 && in[0] == '[' && in[in.size()-1] == ']')
+        hostOut = in.substr(1, in.size()-2);
+    else
+        hostOut = in;
+}
+
+bool static LookupIntern(const char *pszName, std::vector<CNetAddr>& vIP, unsigned int nMaxSolutions, bool fAllowLookup)
+{
+    vIP.clear();
+
+    {
+        CNetAddr addr;
+        if (addr.SetSpecial(std::string(pszName))) {
+            vIP.push_back(addr);
+            return true;
+        }
+    }
+
+#ifdef HAVE_GETADDRINFO_A
+    struct in_addr ipv4_addr;
+#ifdef HAVE_INET_PTON
+    if (inet_pton(AF_INET, pszName, &ipv4_addr) > 0) {
+        vIP.push_back(CNetAddr(ipv4_addr));
+        return true;
+    }
+
+    struct in6_addr ipv6_addr;
+    if (inet_pton(AF_INET6, pszName, &ipv6_addr) > 0) {
+        vIP.push_back(CNetAddr(ipv6_addr));
+        return true;
+    }
+#else
+    ipv4_addr.s_addr = inet_addr(pszName);
+    if (ipv4_addr.s_addr != INADDR_NONE) {
+        vIP.push_back(CNetAddr(ipv4_addr));
+        return true;
+    }
+#endif
+#endif
+
+    struct addrinfo aiHint;
+    memset(&aiHint, 0, sizeof(struct addrinfo));
+    aiHint.ai_socktype = SOCK_STREAM;
+    aiHint.ai_protocol = IPPROTO_TCP;
+    aiHint.ai_family = AF_UNSPEC;
+    aiHint.ai_flags = fAllowLookup ? AI_ADDRCONFIG : AI_NUMERICHOST;
+
+    struct addrinfo *aiRes = NULL;
+#ifdef HAVE_GETADDRINFO_A
+    struct gaicb gcb, *query = &gcb;
+    memset(query, 0, sizeof(struct gaicb));
+    gcb.ar_name = pszName;
+    gcb.ar_request = &aiHint;
+    int nErr = getaddrinfo_a(GAI_NOWAIT, &query, 1, NULL);
+    if (nErr)
+        return false;
+
+    do {
+        // Should set the timeout limit to a reasonable value to avoid
+        // generating unnecessary checking call during the polling loop,
+        // while it can still response to stop request quick enough.
+        // 2 seconds looks fine in our situation.
+        struct timespec ts = { 2, 0 };
+        gai_suspend(&query, 1, &ts);
+        boost::this_thread::interruption_point();
+
+        nErr = gai_error(query);
+        if (0 == nErr)
+            aiRes = query->ar_result;
+    } while (nErr == EAI_INPROGRESS);
+#else
+    int nErr = getaddrinfo(pszName, NULL, &aiHint, &aiRes);
+#endif
+    if (nErr)
+        return false;
+
+    struct addrinfo *aiTrav = aiRes;
+    while (aiTrav != NULL && (nMaxSolutions == 0 || vIP.size() < nMaxSolutions))
+    {
+        if (aiTrav->ai_family == AF_INET)
+        {
+            assert(aiTrav->ai_addrlen >= sizeof(sockaddr_in));
+            vIP.push_back(CNetAddr(((struct sockaddr_in*)(aiTrav->ai_addr))->sin_addr));
+        }
+
+        if (aiTrav->ai_family == AF_INET6)
+        {
+            assert(aiTrav->ai_addrlen >= sizeof(sockaddr_in6));
+            vIP.push_back(CNetAddr(((struct sockaddr_in6*)(aiTrav->ai_addr))->sin6_addr));
+        }
+
+        aiTrav = aiTrav->ai_next;
+    }
+
+    freeaddrinfo(aiRes);
+
+    return (vIP.size() > 0);
+}
+
+bool LookupHost(const char *pszName, std::vector<CNetAddr>& vIP, unsigned int nMaxSolutions, bool fAllowLookup)
+{
+    std::string strHost(pszName);
+    if (strHost.empty())
+        return false;
+    if (boost::algorithm::starts_with(strHost, "[") && boost::algorithm::ends_with(strHost, "]"))
+    {
+        strHost = strHost.substr(1, strHost.size() - 2);
+    }
+
+    return LookupIntern(strHost.c_str(), vIP, nMaxSolutions, fAllowLookup);
+}
+
+bool Lookup(const char *pszName, std::vector<CService>& vAddr, int portDefault, bool fAllowLookup, unsigned int nMaxSolutions)
+{
+    if (pszName[0] == 0)
+        return false;
+    int port = portDefault;
+    std::string hostname = "";
+    SplitHostPort(std::string(pszName), port, hostname);
+
+    std::vector<CNetAddr> vIP;
+    bool fRet = LookupIntern(hostname.c_str(), vIP, nMaxSolutions, fAllowLookup);
+    if (!fRet)
+        return false;
+    vAddr.resize(vIP.size());
+    for (unsigned int i = 0; i < vIP.size(); i++)
+        vAddr[i] = CService(vIP[i], port);
+    return true;
+}
+
+bool Lookup(const char *pszName, CService& addr, int portDefault, bool fAllowLookup)
+{
+    std::vector<CService> vService;
+    bool fRet = Lookup(pszName, vService, portDefault, fAllowLookup, 1);
+    if (!fRet)
+        return false;
+    addr = vService[0];
+    return true;
+}
+
+bool LookupNumeric(const char *pszName, CService& addr, int portDefault)
+{
+    return Lookup(pszName, addr, portDefault, false);
+}
+
+struct timeval MillisToTimeval(int64_t nTimeout)
+{
+    struct timeval timeout;
+    timeout.tv_sec  = nTimeout / 1000;
+    timeout.tv_usec = (nTimeout % 1000) * 1000;
+    return timeout;
+}
+
+/**
+ * Read bytes from socket. This will either read the full number of bytes requested
+ * or return False on error or timeout.
+ * This function can be interrupted by boost thread interrupt.
+ *
+ * @param data Buffer to receive into
+ * @param len  Length of data to receive
+ * @param timeout  Timeout in milliseconds for receive operation
+ *
+ * @note This function requires that hSocket is in non-blocking mode.
+ */
+bool static InterruptibleRecv(uint8_t* data, size_t len, int timeout, SOCKET& hSocket)
+{
+    int64_t curTime = GetTimeMillis();
+    int64_t endTime = curTime + timeout;
+    // Maximum time to wait in one select call. It will take up until this time (in millis)
+    // to break off in case of an interruption.
+    const int64_t maxWait = 1000;
+    while (len > 0 && curTime < endTime) {
+        // Optimistically try the recv first.
+        //
+        // POSIX recv() does not require a cast, as it takes a void *buf:
+        //     ssize_t recv(int sockfd, void *buf, size_t len, int flags);
+        // However Windows explicitly requires a char *buf:
+        //     int recv(SOCKET s, char *buf, int len, int flags);
+        ssize_t ret = recv(hSocket, reinterpret_cast<char*>(data), len, 0);
+        if (ret > 0) {
+            len -= ret;
+            data += ret;
+        } else if (ret == 0) { // Unexpected disconnection
+            return false;
+        } else { // Other error or blocking
+            int nErr = WSAGetLastError();
+            if (nErr == WSAEINPROGRESS || nErr == WSAEWOULDBLOCK || nErr == WSAEINVAL) {
+                if (!IsSelectableSocket(hSocket)) {
+                    return false;
+                }
+                struct timeval tval = MillisToTimeval(std::min(endTime - curTime, maxWait));
+                fd_set fdset;
+                FD_ZERO(&fdset);
+                FD_SET(hSocket, &fdset);
+                int nRet = select(hSocket + 1, &fdset, NULL, NULL, &tval);
+                if (nRet == SOCKET_ERROR) {
+                    return false;
+                }
+            } else {
+                return false;
+            }
+        }
+        boost::this_thread::interruption_point();
+        curTime = GetTimeMillis();
+    }
+    return len == 0;
+}
+
+struct ProxyCredentials
+{
+    std::string username;
+    std::string password;
+};
+
+/** Connect using SOCKS5 (as described in RFC1928) */
+static bool Socks5(const std::string& strDest, int port, const ProxyCredentials *auth, SOCKET& hSocket)
+{
+    LogPrintf("SOCKS5 connecting %s\n", strDest);
+    if (strDest.size() > 255) {
+        CloseSocket(hSocket);
+        return error("Hostname too long");
+    }
+    // Accepted authentication methods
+    std::vector<uint8_t> vSocks5Init;
+    vSocks5Init.push_back(0x05);
+    if (auth) {
+        vSocks5Init.push_back(0x02); // # METHODS
+        vSocks5Init.push_back(0x00); // X'00' NO AUTHENTICATION REQUIRED
+        vSocks5Init.push_back(0x02); // X'02' USERNAME/PASSWORD (RFC1929)
+    } else {
+        vSocks5Init.push_back(0x01); // # METHODS
+        vSocks5Init.push_back(0x00); // X'00' NO AUTHENTICATION REQUIRED
+    }
+    ssize_t ret = send(hSocket, (const char*)begin_ptr(vSocks5Init), vSocks5Init.size(), MSG_NOSIGNAL);
+    if (ret != (ssize_t)vSocks5Init.size()) {
+        CloseSocket(hSocket);
+        return error("Error sending to proxy");
+    }
+    uint8_t pchRet1[2];
+    if (!InterruptibleRecv(pchRet1, 2, SOCKS5_RECV_TIMEOUT, hSocket)) {
+        CloseSocket(hSocket);
+        return error("Error reading proxy response");
+    }
+    if (pchRet1[0] != 0x05) {
+        CloseSocket(hSocket);
+        return error("Proxy failed to initialize");
+    }
+    if (pchRet1[1] == 0x02 && auth) {
+        // Perform username/password authentication (as described in RFC1929)
+        std::vector<uint8_t> vAuth;
+        vAuth.push_back(0x01);
+        if (auth->username.size() > 255 || auth->password.size() > 255)
+            return error("Proxy username or password too long");
+        vAuth.push_back(auth->username.size());
+        vAuth.insert(vAuth.end(), auth->username.begin(), auth->username.end());
+        vAuth.push_back(auth->password.size());
+        vAuth.insert(vAuth.end(), auth->password.begin(), auth->password.end());
+        ret = send(hSocket, (const char*)begin_ptr(vAuth), vAuth.size(), MSG_NOSIGNAL);
+        if (ret != (ssize_t)vAuth.size()) {
+            CloseSocket(hSocket);
+            return error("Error sending authentication to proxy");
+        }
+        LogPrint("proxy", "SOCKS5 sending proxy authentication %s:%s\n", auth->username, auth->password);
+        uint8_t pchRetA[2];
+        if (!InterruptibleRecv(pchRetA, 2, SOCKS5_RECV_TIMEOUT, hSocket)) {
+            CloseSocket(hSocket);
+            return error("Error reading proxy authentication response");
+        }
+        if (pchRetA[0] != 0x01 || pchRetA[1] != 0x00) {
+            CloseSocket(hSocket);
+            return error("Proxy authentication unsuccessful");
+        }
+    } else if (pchRet1[1] == 0x00) {
+        // Perform no authentication
+    } else {
+        CloseSocket(hSocket);
+        return error("Proxy requested wrong authentication method %02x", pchRet1[1]);
+    }
+    std::vector<uint8_t> vSocks5;
+    vSocks5.push_back(0x05); // VER protocol version
+    vSocks5.push_back(0x01); // CMD CONNECT
+    vSocks5.push_back(0x00); // RSV Reserved
+    vSocks5.push_back(0x03); // ATYP DOMAINNAME
+    vSocks5.push_back(strDest.size()); // Length<=255 is checked at beginning of function
+    vSocks5.insert(vSocks5.end(), strDest.begin(), strDest.end());
+    vSocks5.push_back((port >> 8) & 0xFF);
+    vSocks5.push_back((port >> 0) & 0xFF);
+    ret = send(hSocket, (const char*)begin_ptr(vSocks5), vSocks5.size(), MSG_NOSIGNAL);
+    if (ret != (ssize_t)vSocks5.size()) {
+        CloseSocket(hSocket);
+        return error("Error sending to proxy");
+    }
+    uint8_t pchRet2[4];
+    if (!InterruptibleRecv(pchRet2, 4, SOCKS5_RECV_TIMEOUT, hSocket)) {
+        CloseSocket(hSocket);
+        return error("Error reading proxy response");
+    }
+    if (pchRet2[0] != 0x05) {
+        CloseSocket(hSocket);
+        return error("Proxy failed to accept request");
+    }
+    if (pchRet2[1] != 0x00) {
+        CloseSocket(hSocket);
+        switch (pchRet2[1])
+        {
+            case 0x01: return error("Proxy error: general failure");
+            case 0x02: return error("Proxy error: connection not allowed");
+            case 0x03: return error("Proxy error: network unreachable");
+            case 0x04: return error("Proxy error: host unreachable");
+            case 0x05: return error("Proxy error: connection refused");
+            case 0x06: return error("Proxy error: TTL expired");
+            case 0x07: return error("Proxy error: protocol error");
+            case 0x08: return error("Proxy error: address type not supported");
+            default:   return error("Proxy error: unknown");
+        }
+    }
+    if (pchRet2[2] != 0x00) {
+        CloseSocket(hSocket);
+        return error("Error: malformed proxy response");
+    }
+    uint8_t pchRet3[256];
+    switch (pchRet2[3])
+    {
+        case 0x01: ret = InterruptibleRecv(pchRet3, 4, SOCKS5_RECV_TIMEOUT, hSocket); break;
+        case 0x04: ret = InterruptibleRecv(pchRet3, 16, SOCKS5_RECV_TIMEOUT, hSocket); break;
+        case 0x03:
+        {
+            ret = InterruptibleRecv(pchRet3, 1, SOCKS5_RECV_TIMEOUT, hSocket);
+            if (!ret) {
+                CloseSocket(hSocket);
+                return error("Error reading from proxy");
+            }
+            size_t nRecv = pchRet3[0];
+            ret = InterruptibleRecv(pchRet3, nRecv, SOCKS5_RECV_TIMEOUT, hSocket);
+            break;
+        }
+        default: CloseSocket(hSocket); return error("Error: malformed proxy response");
+    }
+    if (!ret) {
+        CloseSocket(hSocket);
+        return error("Error reading from proxy");
+    }
+    if (!InterruptibleRecv(pchRet3, 2, SOCKS5_RECV_TIMEOUT, hSocket)) {
+        CloseSocket(hSocket);
+        return error("Error reading from proxy");
+    }
+    LogPrintf("SOCKS5 connected %s\n", strDest);
+    return true;
+}
+
+bool static ConnectSocketDirectly(const CService &addrConnect, SOCKET& hSocketRet, int nTimeout)
+{
+    hSocketRet = INVALID_SOCKET;
+
+    struct sockaddr_storage sockaddr;
+    socklen_t len = sizeof(sockaddr);
+    if (!addrConnect.GetSockAddr((struct sockaddr*)&sockaddr, &len)) {
+        LogPrintf("Cannot connect to %s: unsupported network\n", addrConnect.ToString());
+        return false;
+    }
+
+    SOCKET hSocket = socket(((struct sockaddr*)&sockaddr)->sa_family, SOCK_STREAM, IPPROTO_TCP);
+    if (hSocket == INVALID_SOCKET)
+        return false;
+
+    int set = 1;
+#ifdef SO_NOSIGPIPE
+    // Different way of disabling SIGPIPE on BSD
+    setsockopt(hSocket, SOL_SOCKET, SO_NOSIGPIPE, (void*)&set, sizeof(int));
+#endif
+
+    //Disable Nagle's algorithm
+#ifdef WIN32
+    setsockopt(hSocket, IPPROTO_TCP, TCP_NODELAY, (const char*)&set, sizeof(int));
+#else
+    setsockopt(hSocket, IPPROTO_TCP, TCP_NODELAY, (void*)&set, sizeof(int));
+#endif
+
+    // Set to non-blocking
+    if (!SetSocketNonBlocking(hSocket, true))
+        return error("ConnectSocketDirectly: Setting socket to non-blocking failed, error %s\n", NetworkErrorString(WSAGetLastError()));
+
+    if (connect(hSocket, (struct sockaddr*)&sockaddr, len) == SOCKET_ERROR)
+    {
+        int nErr = WSAGetLastError();
+        // WSAEINVAL is here because some legacy version of winsock uses it
+        if (nErr == WSAEINPROGRESS || nErr == WSAEWOULDBLOCK || nErr == WSAEINVAL)
+        {
+            struct timeval timeout = MillisToTimeval(nTimeout);
+            fd_set fdset;
+            FD_ZERO(&fdset);
+            FD_SET(hSocket, &fdset);
+            int nRet = select(hSocket + 1, NULL, &fdset, NULL, &timeout);
+            if (nRet == 0)
+            {
+                LogPrint("net", "connection to %s timeout\n", addrConnect.ToString());
+                CloseSocket(hSocket);
+                return false;
+            }
+            if (nRet == SOCKET_ERROR)
+            {
+                LogPrintf("select() for %s failed: %s\n", addrConnect.ToString(), NetworkErrorString(WSAGetLastError()));
+                CloseSocket(hSocket);
+                return false;
+            }
+            socklen_t nRetSize = sizeof(nRet);
+#ifdef WIN32
+            if (getsockopt(hSocket, SOL_SOCKET, SO_ERROR, (char*)(&nRet), &nRetSize) == SOCKET_ERROR)
+#else
+            if (getsockopt(hSocket, SOL_SOCKET, SO_ERROR, &nRet, &nRetSize) == SOCKET_ERROR)
+#endif
+            {
+                LogPrintf("getsockopt() for %s failed: %s\n", addrConnect.ToString(), NetworkErrorString(WSAGetLastError()));
+                CloseSocket(hSocket);
+                return false;
+            }
+            if (nRet != 0)
+            {
+                LogPrintf("connect() to %s failed after select(): %s\n", addrConnect.ToString(), NetworkErrorString(nRet));
+                CloseSocket(hSocket);
+                return false;
+            }
+        }
+#ifdef WIN32
+        else if (WSAGetLastError() != WSAEISCONN)
+#else
+        else
+#endif
+        {
+            LogPrintf("connect() to %s failed: %s\n", addrConnect.ToString(), NetworkErrorString(WSAGetLastError()));
+            CloseSocket(hSocket);
+            return false;
+        }
+    }
+
+    hSocketRet = hSocket;
+    return true;
+}
+
+bool SetProxy(enum Network net, const proxyType &addrProxy) {
+    assert(net >= 0 && net < NET_MAX);
+    if (!addrProxy.IsValid())
+        return false;
+    LOCK(cs_proxyInfos);
+    proxyInfo[net] = addrProxy;
+    return true;
+}
+
+bool GetProxy(enum Network net, proxyType &proxyInfoOut) {
+    assert(net >= 0 && net < NET_MAX);
+    LOCK(cs_proxyInfos);
+    if (!proxyInfo[net].IsValid())
+        return false;
+    proxyInfoOut = proxyInfo[net];
+    return true;
+}
+
+bool SetNameProxy(const proxyType &addrProxy) {
+    if (!addrProxy.IsValid())
+        return false;
+    LOCK(cs_proxyInfos);
+    nameProxy = addrProxy;
+    return true;
+}
+
+bool GetNameProxy(proxyType &nameProxyOut) {
+    LOCK(cs_proxyInfos);
+    if(!nameProxy.IsValid())
+        return false;
+    nameProxyOut = nameProxy;
+    return true;
+}
+
+bool HaveNameProxy() {
+    LOCK(cs_proxyInfos);
+    return nameProxy.IsValid();
+}
+
+bool IsProxy(const CNetAddr &addr) {
+    LOCK(cs_proxyInfos);
+    for (int i = 0; i < NET_MAX; i++) {
+        if (addr == (CNetAddr)proxyInfo[i].proxy)
+            return true;
+    }
+    return false;
+}
+
+static bool ConnectThroughProxy(const proxyType &proxy, const std::string& strDest, int port, SOCKET& hSocketRet, int nTimeout, bool *outProxyConnectionFailed)
+{
+    SOCKET hSocket = INVALID_SOCKET;
+    // first connect to proxy server
+    if (!ConnectSocketDirectly(proxy.proxy, hSocket, nTimeout)) {
+        if (outProxyConnectionFailed)
+            *outProxyConnectionFailed = true;
+        return false;
+    }
+    // do socks negotiation
+    if (proxy.randomize_credentials) {
+        ProxyCredentials random_auth;
+        static std::atomic_int counter;
+        random_auth.username = random_auth.password = strprintf("%i", counter++);
+        if (!Socks5(strDest, (unsigned short)port, &random_auth, hSocket))
+            return false;
+    } else {
+        if (!Socks5(strDest, (unsigned short)port, 0, hSocket))
+            return false;
+    }
+
+    hSocketRet = hSocket;
+    return true;
+}
+
+bool ConnectSocket(const CService &addrDest, SOCKET& hSocketRet, int nTimeout, bool *outProxyConnectionFailed)
+{
+    proxyType proxy;
+    if (outProxyConnectionFailed)
+        *outProxyConnectionFailed = false;
+
+    if (GetProxy(addrDest.GetNetwork(), proxy))
+        return ConnectThroughProxy(proxy, addrDest.ToStringIP(), addrDest.GetPort(), hSocketRet, nTimeout, outProxyConnectionFailed);
+    else // no proxy needed (none set for target network)
+        return ConnectSocketDirectly(addrDest, hSocketRet, nTimeout);
+}
+
+bool ConnectSocketByName(CService &addr, SOCKET& hSocketRet, const char *pszDest, int portDefault, int nTimeout, bool *outProxyConnectionFailed)
+{
+    std::string strDest;
+    int port = portDefault;
+
+    if (outProxyConnectionFailed)
+        *outProxyConnectionFailed = false;
+
+    SplitHostPort(std::string(pszDest), port, strDest);
+
+    proxyType nameProxy;
+    GetNameProxy(nameProxy);
+
+    CService addrResolved(CNetAddr(strDest, fNameLookup && !HaveNameProxy()), port);
+    if (addrResolved.IsValid()) {
+        addr = addrResolved;
+        return ConnectSocket(addr, hSocketRet, nTimeout);
+    }
+
+    addr = CService("0.0.0.0:0");
+
+    if (!HaveNameProxy())
+        return false;
+    return ConnectThroughProxy(nameProxy, strDest, port, hSocketRet, nTimeout, outProxyConnectionFailed);
+}
+
+void CNetAddr::Init()
+{
+    memset(ip, 0, sizeof(ip));
+}
+
+void CNetAddr::SetIP(const CNetAddr& ipIn)
+{
+    memcpy(ip, ipIn.ip, sizeof(ip));
+}
+
+void CNetAddr::SetRaw(Network network, const uint8_t *ip_in)
+{
+    switch(network)
+    {
+        case NET_IPV4:
+            memcpy(ip, pchIPv4, 12);
+            memcpy(ip+12, ip_in, 4);
+            break;
+        case NET_IPV6:
+            memcpy(ip, ip_in, 16);
+            break;
+        default:
+            assert(!"invalid network");
+    }
+}
+
+static const unsigned char pchOnionCat[] = {0xFD,0x87,0xD8,0x7E,0xEB,0x43};
+
+bool CNetAddr::SetSpecial(const std::string &strName)
+{
+    if (strName.size()>6 && strName.substr(strName.size() - 6, 6) == ".onion") {
+        std::vector<unsigned char> vchAddr = DecodeBase32(strName.substr(0, strName.size() - 6).c_str());
+        if (vchAddr.size() != 16-sizeof(pchOnionCat))
+            return false;
+        memcpy(ip, pchOnionCat, sizeof(pchOnionCat));
+        for (unsigned int i=0; i<16-sizeof(pchOnionCat); i++)
+            ip[i + sizeof(pchOnionCat)] = vchAddr[i];
+        return true;
+    }
+    return false;
+}
+
+CNetAddr::CNetAddr()
+{
+    Init();
+}
+
+CNetAddr::CNetAddr(const struct in_addr& ipv4Addr)
+{
+    SetRaw(NET_IPV4, (const uint8_t*)&ipv4Addr);
+}
+
+CNetAddr::CNetAddr(const struct in6_addr& ipv6Addr)
+{
+    SetRaw(NET_IPV6, (const uint8_t*)&ipv6Addr);
+}
+
+CNetAddr::CNetAddr(const char *pszIp, bool fAllowLookup)
+{
+    Init();
+    std::vector<CNetAddr> vIP;
+    if (LookupHost(pszIp, vIP, 1, fAllowLookup))
+        *this = vIP[0];
+}
+
+CNetAddr::CNetAddr(const std::string &strIp, bool fAllowLookup)
+{
+    Init();
+    std::vector<CNetAddr> vIP;
+    if (LookupHost(strIp.c_str(), vIP, 1, fAllowLookup))
+        *this = vIP[0];
+}
+
+unsigned int CNetAddr::GetByte(int n) const
+{
+    return ip[15-n];
+}
+
+bool CNetAddr::IsIPv4() const
+{
+    return (memcmp(ip, pchIPv4, sizeof(pchIPv4)) == 0);
+}
+
+bool CNetAddr::IsIPv6() const
+{
+    return (!IsIPv4() && !IsTor());
+}
+
+bool CNetAddr::IsRFC1918() const
+{
+    return IsIPv4() && (
+        GetByte(3) == 10 ||
+        (GetByte(3) == 192 && GetByte(2) == 168) ||
+        (GetByte(3) == 172 && (GetByte(2) >= 16 && GetByte(2) <= 31)));
+}
+
+bool CNetAddr::IsRFC2544() const
+{
+    return IsIPv4() && GetByte(3) == 198 && (GetByte(2) == 18 || GetByte(2) == 19);
+}
+
+bool CNetAddr::IsRFC3927() const
+{
+    return IsIPv4() && (GetByte(3) == 169 && GetByte(2) == 254);
+}
+
+bool CNetAddr::IsRFC6598() const
+{
+    return IsIPv4() && GetByte(3) == 100 && GetByte(2) >= 64 && GetByte(2) <= 127;
+}
+
+bool CNetAddr::IsRFC5737() const
+{
+    return IsIPv4() && ((GetByte(3) == 192 && GetByte(2) == 0 && GetByte(1) == 2) ||
+        (GetByte(3) == 198 && GetByte(2) == 51 && GetByte(1) == 100) ||
+        (GetByte(3) == 203 && GetByte(2) == 0 && GetByte(1) == 113));
+}
+
+bool CNetAddr::IsRFC3849() const
+{
+    return GetByte(15) == 0x20 && GetByte(14) == 0x01 && GetByte(13) == 0x0D && GetByte(12) == 0xB8;
+}
+
+bool CNetAddr::IsRFC3964() const
+{
+    return (GetByte(15) == 0x20 && GetByte(14) == 0x02);
+}
+
+bool CNetAddr::IsRFC6052() const
+{
+    static const unsigned char pchRFC6052[] = {0,0x64,0xFF,0x9B,0,0,0,0,0,0,0,0};
+    return (memcmp(ip, pchRFC6052, sizeof(pchRFC6052)) == 0);
+}
+
+bool CNetAddr::IsRFC4380() const
+{
+    return (GetByte(15) == 0x20 && GetByte(14) == 0x01 && GetByte(13) == 0 && GetByte(12) == 0);
+}
+
+bool CNetAddr::IsRFC4862() const
+{
+    static const unsigned char pchRFC4862[] = {0xFE,0x80,0,0,0,0,0,0};
+    return (memcmp(ip, pchRFC4862, sizeof(pchRFC4862)) == 0);
+}
+
+bool CNetAddr::IsRFC4193() const
+{
+    return ((GetByte(15) & 0xFE) == 0xFC);
+}
+
+bool CNetAddr::IsRFC6145() const
+{
+    static const unsigned char pchRFC6145[] = {0,0,0,0,0,0,0,0,0xFF,0xFF,0,0};
+    return (memcmp(ip, pchRFC6145, sizeof(pchRFC6145)) == 0);
+}
+
+bool CNetAddr::IsRFC4843() const
+{
+    return (GetByte(15) == 0x20 && GetByte(14) == 0x01 && GetByte(13) == 0x00 && (GetByte(12) & 0xF0) == 0x10);
+}
+
+bool CNetAddr::IsTor() const
+{
+    return (memcmp(ip, pchOnionCat, sizeof(pchOnionCat)) == 0);
+}
+
+bool CNetAddr::IsLocal() const
+{
+    // IPv4 loopback
+   if (IsIPv4() && (GetByte(3) == 127 || GetByte(3) == 0))
+       return true;
+
+   // IPv6 loopback (::1/128)
+   static const unsigned char pchLocal[16] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1};
+   if (memcmp(ip, pchLocal, 16) == 0)
+       return true;
+
+   return false;
+}
+
+bool CNetAddr::IsMulticast() const
+{
+    return    (IsIPv4() && (GetByte(3) & 0xF0) == 0xE0)
+           || (GetByte(15) == 0xFF);
+}
+
+bool CNetAddr::IsValid() const
+{
+    // Cleanup 3-byte shifted addresses caused by garbage in size field
+    // of addr messages from versions before 0.2.9 checksum.
+    // Two consecutive addr messages look like this:
+    // header20 vectorlen3 addr26 addr26 addr26 header20 vectorlen3 addr26 addr26 addr26...
+    // so if the first length field is garbled, it reads the second batch
+    // of addr misaligned by 3 bytes.
+    if (memcmp(ip, pchIPv4+3, sizeof(pchIPv4)-3) == 0)
+        return false;
+
+    // unspecified IPv6 address (::/128)
+    unsigned char ipNone[16] = {};
+    if (memcmp(ip, ipNone, 16) == 0)
+        return false;
+
+    // documentation IPv6 address
+    if (IsRFC3849())
+        return false;
+
+    if (IsIPv4())
+    {
+        // INADDR_NONE
+        uint32_t ipNone = INADDR_NONE;
+        if (memcmp(ip+12, &ipNone, 4) == 0)
+            return false;
+
+        // 0
+        ipNone = 0;
+        if (memcmp(ip+12, &ipNone, 4) == 0)
+            return false;
+    }
+
+    return true;
+}
+
+bool CNetAddr::IsRoutable() const
+{
+    return IsValid() && !(IsRFC1918() || IsRFC2544() || IsRFC3927() || IsRFC4862() || IsRFC6598() || IsRFC5737() || (IsRFC4193() && !IsTor()) || IsRFC4843() || IsLocal());
+}
+
+enum Network CNetAddr::GetNetwork() const
+{
+    if (!IsRoutable())
+        return NET_UNROUTABLE;
+
+    if (IsIPv4())
+        return NET_IPV4;
+
+    if (IsTor())
+        return NET_TOR;
+
+    return NET_IPV6;
+}
+
+std::string CNetAddr::ToStringIP() const
+{
+    if (IsTor())
+        return EncodeBase32(&ip[6], 10) + ".onion";
+    CService serv(*this, 0);
+    struct sockaddr_storage sockaddr;
+    socklen_t socklen = sizeof(sockaddr);
+    if (serv.GetSockAddr((struct sockaddr*)&sockaddr, &socklen)) {
+        char name[1025] = "";
+        if (!getnameinfo((const struct sockaddr*)&sockaddr, socklen, name, sizeof(name), NULL, 0, NI_NUMERICHOST))
+            return std::string(name);
+    }
+    if (IsIPv4())
+        return strprintf("%u.%u.%u.%u", GetByte(3), GetByte(2), GetByte(1), GetByte(0));
+    else
+        return strprintf("%x:%x:%x:%x:%x:%x:%x:%x",
+                         GetByte(15) << 8 | GetByte(14), GetByte(13) << 8 | GetByte(12),
+                         GetByte(11) << 8 | GetByte(10), GetByte(9) << 8 | GetByte(8),
+                         GetByte(7) << 8 | GetByte(6), GetByte(5) << 8 | GetByte(4),
+                         GetByte(3) << 8 | GetByte(2), GetByte(1) << 8 | GetByte(0));
+}
+
+std::string CNetAddr::ToString() const
+{
+    return ToStringIP();
+}
+
+bool operator==(const CNetAddr& a, const CNetAddr& b)
+{
+    return (memcmp(a.ip, b.ip, 16) == 0);
+}
+
+bool operator!=(const CNetAddr& a, const CNetAddr& b)
+{
+    return (memcmp(a.ip, b.ip, 16) != 0);
+}
+
+bool operator<(const CNetAddr& a, const CNetAddr& b)
+{
+    return (memcmp(a.ip, b.ip, 16) < 0);
+}
+
+bool CNetAddr::GetInAddr(struct in_addr* pipv4Addr) const
+{
+    if (!IsIPv4())
+        return false;
+    memcpy(pipv4Addr, ip+12, 4);
+    return true;
+}
+
+bool CNetAddr::GetIn6Addr(struct in6_addr* pipv6Addr) const
+{
+    memcpy(pipv6Addr, ip, 16);
+    return true;
+}
+
+// get canonical identifier of an address' group
+// no two connections will be attempted to addresses with the same group
+std::vector<unsigned char> CNetAddr::GetGroup() const
+{
+    std::vector<unsigned char> vchRet;
+    int nClass = NET_IPV6;
+    int nStartByte = 0;
+    int nBits = 16;
+
+    // all local addresses belong to the same group
+    if (IsLocal())
+    {
+        nClass = 255;
+        nBits = 0;
+    }
+
+    // all unroutable addresses belong to the same group
+    if (!IsRoutable())
+    {
+        nClass = NET_UNROUTABLE;
+        nBits = 0;
+    }
+    // for IPv4 addresses, '1' + the 16 higher-order bits of the IP
+    // includes mapped IPv4, SIIT translated IPv4, and the well-known prefix
+    else if (IsIPv4() || IsRFC6145() || IsRFC6052())
+    {
+        nClass = NET_IPV4;
+        nStartByte = 12;
+    }
+    // for 6to4 tunnelled addresses, use the encapsulated IPv4 address
+    else if (IsRFC3964())
+    {
+        nClass = NET_IPV4;
+        nStartByte = 2;
+    }
+    // for Teredo-tunnelled IPv6 addresses, use the encapsulated IPv4 address
+    else if (IsRFC4380())
+    {
+        vchRet.push_back(NET_IPV4);
+        vchRet.push_back(GetByte(3) ^ 0xFF);
+        vchRet.push_back(GetByte(2) ^ 0xFF);
+        return vchRet;
+    }
+    else if (IsTor())
+    {
+        nClass = NET_TOR;
+        nStartByte = 6;
+        nBits = 4;
+    }
+    // for he.net, use /36 groups
+    else if (GetByte(15) == 0x20 && GetByte(14) == 0x01 && GetByte(13) == 0x04 && GetByte(12) == 0x70)
+        nBits = 36;
+    // for the rest of the IPv6 network, use /32 groups
+    else
+        nBits = 32;
+
+    vchRet.push_back(nClass);
+    while (nBits >= 8)
+    {
+        vchRet.push_back(GetByte(15 - nStartByte));
+        nStartByte++;
+        nBits -= 8;
+    }
+    if (nBits > 0)
+        vchRet.push_back(GetByte(15 - nStartByte) | ((1 << (8 - nBits)) - 1));
+
+    return vchRet;
+}
+
+uint64_t CNetAddr::GetHash() const
+{
+    uint256 hash = Hash(&ip[0], &ip[16]);
+    uint64_t nRet;
+    memcpy(&nRet, &hash, sizeof(nRet));
+    return nRet;
+}
+
+// private extensions to enum Network, only returned by GetExtNetwork,
+// and only used in GetReachabilityFrom
+static const int NET_UNKNOWN = NET_MAX + 0;
+static const int NET_TEREDO  = NET_MAX + 1;
+int static GetExtNetwork(const CNetAddr *addr)
+{
+    if (addr == NULL)
+        return NET_UNKNOWN;
+    if (addr->IsRFC4380())
+        return NET_TEREDO;
+    return addr->GetNetwork();
+}
+
+/** Calculates a metric for how reachable (*this) is from a given partner */
+int CNetAddr::GetReachabilityFrom(const CNetAddr *paddrPartner) const
+{
+    enum Reachability {
+        REACH_UNREACHABLE,
+        REACH_DEFAULT,
+        REACH_TEREDO,
+        REACH_IPV6_WEAK,
+        REACH_IPV4,
+        REACH_IPV6_STRONG,
+        REACH_PRIVATE
+    };
+
+    if (!IsRoutable())
+        return REACH_UNREACHABLE;
+
+    int ourNet = GetExtNetwork(this);
+    int theirNet = GetExtNetwork(paddrPartner);
+    bool fTunnel = IsRFC3964() || IsRFC6052() || IsRFC6145();
+
+    switch(theirNet) {
+    case NET_IPV4:
+        switch(ourNet) {
+        default:       return REACH_DEFAULT;
+        case NET_IPV4: return REACH_IPV4;
+        }
+    case NET_IPV6:
+        switch(ourNet) {
+        default:         return REACH_DEFAULT;
+        case NET_TEREDO: return REACH_TEREDO;
+        case NET_IPV4:   return REACH_IPV4;
+        case NET_IPV6:   return fTunnel ? REACH_IPV6_WEAK : REACH_IPV6_STRONG; // only prefer giving our IPv6 address if it's not tunnelled
+        }
+    case NET_TOR:
+        switch(ourNet) {
+        default:         return REACH_DEFAULT;
+        case NET_IPV4:   return REACH_IPV4; // Tor users can connect to IPv4 as well
+        case NET_TOR:    return REACH_PRIVATE;
+        }
+    case NET_TEREDO:
+        switch(ourNet) {
+        default:          return REACH_DEFAULT;
+        case NET_TEREDO:  return REACH_TEREDO;
+        case NET_IPV6:    return REACH_IPV6_WEAK;
+        case NET_IPV4:    return REACH_IPV4;
+        }
+    case NET_UNKNOWN:
+    case NET_UNROUTABLE:
+    default:
+        switch(ourNet) {
+        default:          return REACH_DEFAULT;
+        case NET_TEREDO:  return REACH_TEREDO;
+        case NET_IPV6:    return REACH_IPV6_WEAK;
+        case NET_IPV4:    return REACH_IPV4;
+        case NET_TOR:     return REACH_PRIVATE; // either from Tor, or don't care about our address
+        }
+    }
+}
+
+void CService::Init()
+{
+    port = 0;
+}
+
+CService::CService()
+{
+    Init();
+}
+
+CService::CService(const CNetAddr& cip, unsigned short portIn) : CNetAddr(cip), port(portIn)
+{
+}
+
+CService::CService(const struct in_addr& ipv4Addr, unsigned short portIn) : CNetAddr(ipv4Addr), port(portIn)
+{
+}
+
+CService::CService(const struct in6_addr& ipv6Addr, unsigned short portIn) : CNetAddr(ipv6Addr), port(portIn)
+{
+}
+
+CService::CService(const struct sockaddr_in& addr) : CNetAddr(addr.sin_addr), port(ntohs(addr.sin_port))
+{
+    assert(addr.sin_family == AF_INET);
+}
+
+CService::CService(const struct sockaddr_in6 &addr) : CNetAddr(addr.sin6_addr), port(ntohs(addr.sin6_port))
+{
+   assert(addr.sin6_family == AF_INET6);
+}
+
+bool CService::SetSockAddr(const struct sockaddr *paddr)
+{
+    switch (paddr->sa_family) {
+    case AF_INET:
+        *this = CService(*(const struct sockaddr_in*)paddr);
+        return true;
+    case AF_INET6:
+        *this = CService(*(const struct sockaddr_in6*)paddr);
+        return true;
+    default:
+        return false;
+    }
+}
+
+CService::CService(const char *pszIpPort, bool fAllowLookup)
+{
+    Init();
+    CService ip;
+    if (Lookup(pszIpPort, ip, 0, fAllowLookup))
+        *this = ip;
+}
+
+CService::CService(const char *pszIpPort, int portDefault, bool fAllowLookup)
+{
+    Init();
+    CService ip;
+    if (Lookup(pszIpPort, ip, portDefault, fAllowLookup))
+        *this = ip;
+}
+
+CService::CService(const std::string &strIpPort, bool fAllowLookup)
+{
+    Init();
+    CService ip;
+    if (Lookup(strIpPort.c_str(), ip, 0, fAllowLookup))
+        *this = ip;
+}
+
+CService::CService(const std::string &strIpPort, int portDefault, bool fAllowLookup)
+{
+    Init();
+    CService ip;
+    if (Lookup(strIpPort.c_str(), ip, portDefault, fAllowLookup))
+        *this = ip;
+}
+
+unsigned short CService::GetPort() const
+{
+    return port;
+}
+
+bool operator==(const CService& a, const CService& b)
+{
+    return (CNetAddr)a == (CNetAddr)b && a.port == b.port;
+}
+
+bool operator!=(const CService& a, const CService& b)
+{
+    return (CNetAddr)a != (CNetAddr)b || a.port != b.port;
+}
+
+bool operator<(const CService& a, const CService& b)
+{
+    return (CNetAddr)a < (CNetAddr)b || ((CNetAddr)a == (CNetAddr)b && a.port < b.port);
+}
+
+bool CService::GetSockAddr(struct sockaddr* paddr, socklen_t *addrlen) const
+{
+    if (IsIPv4()) {
+        if (*addrlen < (socklen_t)sizeof(struct sockaddr_in))
+            return false;
+        *addrlen = sizeof(struct sockaddr_in);
+        struct sockaddr_in *paddrin = (struct sockaddr_in*)paddr;
+        memset(paddrin, 0, *addrlen);
+        if (!GetInAddr(&paddrin->sin_addr))
+            return false;
+        paddrin->sin_family = AF_INET;
+        paddrin->sin_port = htons(port);
+        return true;
+    }
+    if (IsIPv6()) {
+        if (*addrlen < (socklen_t)sizeof(struct sockaddr_in6))
+            return false;
+        *addrlen = sizeof(struct sockaddr_in6);
+        struct sockaddr_in6 *paddrin6 = (struct sockaddr_in6*)paddr;
+        memset(paddrin6, 0, *addrlen);
+        if (!GetIn6Addr(&paddrin6->sin6_addr))
+            return false;
+        paddrin6->sin6_family = AF_INET6;
+        paddrin6->sin6_port = htons(port);
+        return true;
+    }
+    return false;
+}
+
+std::vector<unsigned char> CService::GetKey() const
+{
+     std::vector<unsigned char> vKey;
+     vKey.resize(18);
+     memcpy(&vKey[0], ip, 16);
+     vKey[16] = port / 0x100;
+     vKey[17] = port & 0x0FF;
+     return vKey;
+}
+
+std::string CService::ToStringPort() const
+{
+    return strprintf("%u", port);
+}
+
+std::string CService::ToStringIPPort() const
+{
+    if (IsIPv4() || IsTor()) {
+        return ToStringIP() + ":" + ToStringPort();
+    } else {
+        return "[" + ToStringIP() + "]:" + ToStringPort();
+    }
+}
+
+std::string CService::ToString() const
+{
+    return ToStringIPPort();
+}
+
+void CService::SetPort(unsigned short portIn)
+{
+    port = portIn;
+}
+
+CSubNet::CSubNet():
+    valid(false)
+{
+    memset(netmask, 0, sizeof(netmask));
+}
+
+CSubNet::CSubNet(const std::string &strSubnet, bool fAllowLookup)
+{
+    size_t slash = strSubnet.find_last_of('/');
+    std::vector<CNetAddr> vIP;
+
+    valid = true;
+    // Default to /32 (IPv4) or /128 (IPv6), i.e. match single address
+    memset(netmask, 255, sizeof(netmask));
+
+    std::string strAddress = strSubnet.substr(0, slash);
+    if (LookupHost(strAddress.c_str(), vIP, 1, fAllowLookup))
+    {
+        network = vIP[0];
+        if (slash != strSubnet.npos)
+        {
+            std::string strNetmask = strSubnet.substr(slash + 1);
+            int32_t n;
+            // IPv4 addresses start at offset 12, and first 12 bytes must match, so just offset n
+            const int astartofs = network.IsIPv4() ? 12 : 0;
+            if (ParseInt32(strNetmask, &n)) // If valid number, assume /24 symtex
+            {
+                if(n >= 0 && n <= (128 - astartofs*8)) // Only valid if in range of bits of address
+                {
+                    n += astartofs*8;
+                    // Clear bits [n..127]
+                    for (; n < 128; ++n)
+                        netmask[n>>3] &= ~(1<<(7-(n&7)));
+                }
+                else
+                {
+                    valid = false;
+                }
+            }
+            else // If not a valid number, try full netmask syntax
+            {
+                if (LookupHost(strNetmask.c_str(), vIP, 1, false)) // Never allow lookup for netmask
+                {
+                    // Copy only the *last* four bytes in case of IPv4, the rest of the mask should stay 1's as
+                    // we don't want pchIPv4 to be part of the mask.
+                    for(int x=astartofs; x<16; ++x)
+                        netmask[x] = vIP[0].ip[x];
+                }
+                else
+                {
+                    valid = false;
+                }
+            }
+        }
+    }
+    else
+    {
+        valid = false;
+    }
+
+    // Normalize network according to netmask
+    for(int x=0; x<16; ++x)
+        network.ip[x] &= netmask[x];
+}
+
+CSubNet::CSubNet(const CNetAddr &addr):
+    valid(addr.IsValid())
+{
+    memset(netmask, 255, sizeof(netmask));
+    network = addr;
+}
+
+bool CSubNet::Match(const CNetAddr &addr) const
+{
+    if (!valid || !addr.IsValid())
+        return false;
+    for(int x=0; x<16; ++x)
+        if ((addr.ip[x] & netmask[x]) != network.ip[x])
+            return false;
+    return true;
+}
+
+static inline int NetmaskBits(uint8_t x)
+{
+    switch(x) {
+    case 0x00: return 0; break;
+    case 0x80: return 1; break;
+    case 0xc0: return 2; break;
+    case 0xe0: return 3; break;
+    case 0xf0: return 4; break;
+    case 0xf8: return 5; break;
+    case 0xfc: return 6; break;
+    case 0xfe: return 7; break;
+    case 0xff: return 8; break;
+    default: return -1; break;
+    }
+}
+
+std::string CSubNet::ToString() const
+{
+    /* Parse binary 1{n}0{N-n} to see if mask can be represented as /n */
+    int cidr = 0;
+    bool valid_cidr = true;
+    int n = network.IsIPv4() ? 12 : 0;
+    for (; n < 16 && netmask[n] == 0xff; ++n)
+        cidr += 8;
+    if (n < 16) {
+        int bits = NetmaskBits(netmask[n]);
+        if (bits < 0)
+            valid_cidr = false;
+        else
+            cidr += bits;
+        ++n;
+    }
+    for (; n < 16 && valid_cidr; ++n)
+        if (netmask[n] != 0x00)
+            valid_cidr = false;
+
+    /* Format output */
+    std::string strNetmask;
+    if (valid_cidr) {
+        strNetmask = strprintf("%u", cidr);
+    } else {
+        if (network.IsIPv4())
+            strNetmask = strprintf("%u.%u.%u.%u", netmask[12], netmask[13], netmask[14], netmask[15]);
+        else
+            strNetmask = strprintf("%x:%x:%x:%x:%x:%x:%x:%x",
+                             netmask[0] << 8 | netmask[1], netmask[2] << 8 | netmask[3],
+                             netmask[4] << 8 | netmask[5], netmask[6] << 8 | netmask[7],
+                             netmask[8] << 8 | netmask[9], netmask[10] << 8 | netmask[11],
+                             netmask[12] << 8 | netmask[13], netmask[14] << 8 | netmask[15]);
+    }
+
+    return network.ToString() + "/" + strNetmask;
+}
+
+bool CSubNet::IsValid() const
+{
+    return valid;
+}
+
+bool operator==(const CSubNet& a, const CSubNet& b)
+{
+    return a.valid == b.valid && a.network == b.network && !memcmp(a.netmask, b.netmask, 16);
+}
+
+bool operator!=(const CSubNet& a, const CSubNet& b)
+{
+    return !(a==b);
+}
+
+bool operator<(const CSubNet& a, const CSubNet& b)
+{
+    return (a.network < b.network || (a.network == b.network && memcmp(a.netmask, b.netmask, 16) < 0));
+}
+
+#ifdef WIN32
+std::string NetworkErrorString(int err)
+{
+    char buf[256];
+    buf[0] = 0;
+    if(FormatMessageA(FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_IGNORE_INSERTS | FORMAT_MESSAGE_MAX_WIDTH_MASK,
+            NULL, err, MAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT),
+            buf, sizeof(buf), NULL))
+    {
+        return strprintf("%s (%d)", buf, err);
+    }
+    else
+    {
+        return strprintf("Unknown error (%d)", err);
+    }
+}
+#else
+std::string NetworkErrorString(int err)
+{
+    char buf[256];
+    const char *s = buf;
+    buf[0] = 0;
+    /* Too bad there are two incompatible implementations of the
+     * thread-safe strerror. */
+#ifdef STRERROR_R_CHAR_P /* GNU variant can return a pointer outside the passed buffer */
+    s = strerror_r(err, buf, sizeof(buf));
+#else /* POSIX variant always returns message in buffer */
+    if (strerror_r(err, buf, sizeof(buf)))
+        buf[0] = 0;
+#endif
+    return strprintf("%s (%d)", s, err);
+}
+#endif
+
+bool CloseSocket(SOCKET& hSocket)
+{
+    if (hSocket == INVALID_SOCKET)
+        return false;
+#ifdef WIN32
+    int ret = closesocket(hSocket);
+#else
+    int ret = close(hSocket);
+#endif
+    hSocket = INVALID_SOCKET;
+    return ret != SOCKET_ERROR;
+}
+
+bool SetSocketNonBlocking(SOCKET& hSocket, bool fNonBlocking)
+{
+    if (fNonBlocking) {
+#ifdef WIN32
+        u_long nOne = 1;
+        if (ioctlsocket(hSocket, FIONBIO, &nOne) == SOCKET_ERROR) {
+#else
+        int fFlags = fcntl(hSocket, F_GETFL, 0);
+        if (fcntl(hSocket, F_SETFL, fFlags | O_NONBLOCK) == SOCKET_ERROR) {
+#endif
+            CloseSocket(hSocket);
+            return false;
+        }
+    } else {
+#ifdef WIN32
+        u_long nZero = 0;
+        if (ioctlsocket(hSocket, FIONBIO, &nZero) == SOCKET_ERROR) {
+#else
+        int fFlags = fcntl(hSocket, F_GETFL, 0);
+        if (fcntl(hSocket, F_SETFL, fFlags & ~O_NONBLOCK) == SOCKET_ERROR) {
+#endif
+            CloseSocket(hSocket);
+            return false;
+        }
+    }
+
+    return true;
+}
diff --git a/depend/zcash/src/netbase.h b/depend/zcash/src/netbase.h
new file mode 100644
index 000000000..e66b17c16
--- /dev/null
+++ b/depend/zcash/src/netbase.h
@@ -0,0 +1,225 @@
+// Copyright (c) 2009-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_NETBASE_H
+#define BITCOIN_NETBASE_H
+
+#if defined(HAVE_CONFIG_H)
+#include "config/bitcoin-config.h"
+#endif
+
+#include "compat.h"
+#include "serialize.h"
+
+#include <stdint.h>
+#include <string>
+#include <vector>
+
+extern int nConnectTimeout;
+extern bool fNameLookup;
+
+//! -timeout default
+static const int DEFAULT_CONNECT_TIMEOUT = 5000;
+//! -dns default
+static const int DEFAULT_NAME_LOOKUP = true;
+
+#ifdef WIN32
+// In MSVC, this is defined as a macro, undefine it to prevent a compile and link error
+#undef SetPort
+#endif
+
+enum Network
+{
+    NET_UNROUTABLE = 0,
+    NET_IPV4,
+    NET_IPV6,
+    NET_TOR,
+
+    NET_MAX,
+};
+
+/** IP address (IPv6, or IPv4 using mapped IPv6 range (::FFFF:0:0/96)) */
+class CNetAddr
+{
+    protected:
+        unsigned char ip[16]; // in network byte order
+
+    public:
+        CNetAddr();
+        CNetAddr(const struct in_addr& ipv4Addr);
+        explicit CNetAddr(const char *pszIp, bool fAllowLookup = false);
+        explicit CNetAddr(const std::string &strIp, bool fAllowLookup = false);
+        void Init();
+        void SetIP(const CNetAddr& ip);
+
+        /**
+         * Set raw IPv4 or IPv6 address (in network byte order)
+         * @note Only NET_IPV4 and NET_IPV6 are allowed for network.
+         */
+        void SetRaw(Network network, const uint8_t *data);
+
+        bool SetSpecial(const std::string &strName); // for Tor addresses
+        bool IsIPv4() const;    // IPv4 mapped address (::FFFF:0:0/96, 0.0.0.0/0)
+        bool IsIPv6() const;    // IPv6 address (not mapped IPv4, not Tor)
+        bool IsRFC1918() const; // IPv4 private networks (10.0.0.0/8, 192.168.0.0/16, 172.16.0.0/12)
+        bool IsRFC2544() const; // IPv4 inter-network communications (192.18.0.0/15)
+        bool IsRFC6598() const; // IPv4 ISP-level NAT (100.64.0.0/10)
+        bool IsRFC5737() const; // IPv4 documentation addresses (192.0.2.0/24, 198.51.100.0/24, 203.0.113.0/24)
+        bool IsRFC3849() const; // IPv6 documentation address (2001:0DB8::/32)
+        bool IsRFC3927() const; // IPv4 autoconfig (169.254.0.0/16)
+        bool IsRFC3964() const; // IPv6 6to4 tunnelling (2002::/16)
+        bool IsRFC4193() const; // IPv6 unique local (FC00::/7)
+        bool IsRFC4380() const; // IPv6 Teredo tunnelling (2001::/32)
+        bool IsRFC4843() const; // IPv6 ORCHID (2001:10::/28)
+        bool IsRFC4862() const; // IPv6 autoconfig (FE80::/64)
+        bool IsRFC6052() const; // IPv6 well-known prefix (64:FF9B::/96)
+        bool IsRFC6145() const; // IPv6 IPv4-translated address (::FFFF:0:0:0/96)
+        bool IsTor() const;
+        bool IsLocal() const;
+        bool IsRoutable() const;
+        bool IsValid() const;
+        bool IsMulticast() const;
+        enum Network GetNetwork() const;
+        std::string ToString() const;
+        std::string ToStringIP() const;
+        unsigned int GetByte(int n) const;
+        uint64_t GetHash() const;
+        bool GetInAddr(struct in_addr* pipv4Addr) const;
+        std::vector<unsigned char> GetGroup() const;
+        int GetReachabilityFrom(const CNetAddr *paddrPartner = NULL) const;
+
+        CNetAddr(const struct in6_addr& pipv6Addr);
+        bool GetIn6Addr(struct in6_addr* pipv6Addr) const;
+
+        friend bool operator==(const CNetAddr& a, const CNetAddr& b);
+        friend bool operator!=(const CNetAddr& a, const CNetAddr& b);
+        friend bool operator<(const CNetAddr& a, const CNetAddr& b);
+
+        ADD_SERIALIZE_METHODS;
+
+        template <typename Stream, typename Operation>
+        inline void SerializationOp(Stream& s, Operation ser_action) {
+            READWRITE(FLATDATA(ip));
+        }
+
+        friend class CSubNet;
+};
+
+class CSubNet
+{
+    protected:
+        /// Network (base) address
+        CNetAddr network;
+        /// Netmask, in network byte order
+        uint8_t netmask[16];
+        /// Is this value valid? (only used to signal parse errors)
+        bool valid;
+
+    public:
+        CSubNet();
+        explicit CSubNet(const std::string &strSubnet, bool fAllowLookup = false);
+
+        //constructor for single ip subnet (<ipv4>/32 or <ipv6>/128)
+        explicit CSubNet(const CNetAddr &addr);
+
+        bool Match(const CNetAddr &addr) const;
+
+        std::string ToString() const;
+        bool IsValid() const;
+
+        friend bool operator==(const CSubNet& a, const CSubNet& b);
+        friend bool operator!=(const CSubNet& a, const CSubNet& b);
+        friend bool operator<(const CSubNet& a, const CSubNet& b);
+
+        ADD_SERIALIZE_METHODS;
+
+        template <typename Stream, typename Operation>
+        inline void SerializationOp(Stream& s, Operation ser_action) {
+            READWRITE(network);
+            READWRITE(FLATDATA(netmask));
+            READWRITE(FLATDATA(valid));
+        }
+};
+
+/** A combination of a network address (CNetAddr) and a (TCP) port */
+class CService : public CNetAddr
+{
+    protected:
+        unsigned short port; // host order
+
+    public:
+        CService();
+        CService(const CNetAddr& ip, unsigned short port);
+        CService(const struct in_addr& ipv4Addr, unsigned short port);
+        CService(const struct sockaddr_in& addr);
+        explicit CService(const char *pszIpPort, int portDefault, bool fAllowLookup = false);
+        explicit CService(const char *pszIpPort, bool fAllowLookup = false);
+        explicit CService(const std::string& strIpPort, int portDefault, bool fAllowLookup = false);
+        explicit CService(const std::string& strIpPort, bool fAllowLookup = false);
+        void Init();
+        void SetPort(unsigned short portIn);
+        unsigned short GetPort() const;
+        bool GetSockAddr(struct sockaddr* paddr, socklen_t *addrlen) const;
+        bool SetSockAddr(const struct sockaddr* paddr);
+        friend bool operator==(const CService& a, const CService& b);
+        friend bool operator!=(const CService& a, const CService& b);
+        friend bool operator<(const CService& a, const CService& b);
+        std::vector<unsigned char> GetKey() const;
+        std::string ToString() const;
+        std::string ToStringPort() const;
+        std::string ToStringIPPort() const;
+
+        CService(const struct in6_addr& ipv6Addr, unsigned short port);
+        CService(const struct sockaddr_in6& addr);
+
+        ADD_SERIALIZE_METHODS;
+
+        template <typename Stream, typename Operation>
+        inline void SerializationOp(Stream& s, Operation ser_action) {
+            READWRITE(FLATDATA(ip));
+            unsigned short portN = htons(port);
+            READWRITE(FLATDATA(portN));
+            if (ser_action.ForRead())
+                 port = ntohs(portN);
+        }
+};
+
+class proxyType
+{
+public:
+    proxyType(): randomize_credentials(false) {}
+    proxyType(const CService &proxy, bool randomize_credentials=false): proxy(proxy), randomize_credentials(randomize_credentials) {}
+
+    bool IsValid() const { return proxy.IsValid(); }
+
+    CService proxy;
+    bool randomize_credentials;
+};
+
+enum Network ParseNetwork(std::string net);
+std::string GetNetworkName(enum Network net);
+void SplitHostPort(std::string in, int &portOut, std::string &hostOut);
+bool SetProxy(enum Network net, const proxyType &addrProxy);
+bool GetProxy(enum Network net, proxyType &proxyInfoOut);
+bool IsProxy(const CNetAddr &addr);
+bool SetNameProxy(const proxyType &addrProxy);
+bool HaveNameProxy();
+bool LookupHost(const char *pszName, std::vector<CNetAddr>& vIP, unsigned int nMaxSolutions = 0, bool fAllowLookup = true);
+bool Lookup(const char *pszName, CService& addr, int portDefault = 0, bool fAllowLookup = true);
+bool Lookup(const char *pszName, std::vector<CService>& vAddr, int portDefault = 0, bool fAllowLookup = true, unsigned int nMaxSolutions = 0);
+bool LookupNumeric(const char *pszName, CService& addr, int portDefault = 0);
+bool ConnectSocket(const CService &addr, SOCKET& hSocketRet, int nTimeout, bool *outProxyConnectionFailed = 0);
+bool ConnectSocketByName(CService &addr, SOCKET& hSocketRet, const char *pszDest, int portDefault, int nTimeout, bool *outProxyConnectionFailed = 0);
+/** Return readable error string for a network error code */
+std::string NetworkErrorString(int err);
+/** Close socket and set hSocket to INVALID_SOCKET */
+bool CloseSocket(SOCKET& hSocket);
+/** Disable or enable blocking-mode for a socket */
+bool SetSocketNonBlocking(SOCKET& hSocket, bool fNonBlocking);
+/**
+ * Convert milliseconds to a struct timeval for e.g. select.
+ */
+struct timeval MillisToTimeval(int64_t nTimeout);
+
+#endif // BITCOIN_NETBASE_H
diff --git a/depend/zcash/src/noui.cpp b/depend/zcash/src/noui.cpp
new file mode 100644
index 000000000..83ca8b4a6
--- /dev/null
+++ b/depend/zcash/src/noui.cpp
@@ -0,0 +1,60 @@
+// Copyright (c) 2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "noui.h"
+
+#include "ui_interface.h"
+#include "util.h"
+
+#include <cstdio>
+#include <stdint.h>
+#include <string>
+
+#include <boost/signals2/connection.hpp>
+
+static bool noui_ThreadSafeMessageBox(const std::string& message, const std::string& caption, unsigned int style)
+{
+    bool fSecure = style & CClientUIInterface::SECURE;
+    style &= ~CClientUIInterface::SECURE;
+
+    std::string strCaption;
+    // Check for usage of predefined caption
+    switch (style) {
+    case CClientUIInterface::MSG_ERROR:
+        strCaption += _("Error");
+        break;
+    case CClientUIInterface::MSG_WARNING:
+        strCaption += _("Warning");
+        break;
+    case CClientUIInterface::MSG_INFORMATION:
+        strCaption += _("Information");
+        break;
+    default:
+        strCaption += caption; // Use supplied caption (can be empty)
+    }
+
+    if (!fSecure)
+        LogPrintf("%s: %s\n", strCaption, message);
+    fprintf(stderr, "%s: %s\n", strCaption.c_str(), message.c_str());
+    return false;
+}
+
+static bool noui_ThreadSafeQuestion(const std::string& /* ignored interactive message */, const std::string& message, const std::string& caption, unsigned int style)
+{
+    return noui_ThreadSafeMessageBox(message, caption, style);
+}
+
+static void noui_InitMessage(const std::string& message)
+{
+    LogPrintf("init message: %s\n", message);
+}
+
+void noui_connect()
+{
+    // Connect bitcoind signal handlers
+    uiInterface.ThreadSafeMessageBox.connect(noui_ThreadSafeMessageBox);
+    uiInterface.ThreadSafeQuestion.connect(noui_ThreadSafeQuestion);
+    uiInterface.InitMessage.connect(noui_InitMessage);
+}
diff --git a/depend/zcash/src/noui.h b/depend/zcash/src/noui.h
new file mode 100644
index 000000000..935a1c5dc
--- /dev/null
+++ b/depend/zcash/src/noui.h
@@ -0,0 +1,10 @@
+// Copyright (c) 2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_NOUI_H
+#define BITCOIN_NOUI_H
+
+extern void noui_connect();
+
+#endif // BITCOIN_NOUI_H
diff --git a/depend/zcash/src/obj/.gitignore b/depend/zcash/src/obj/.gitignore
new file mode 100644
index 000000000..d6b7ef32c
--- /dev/null
+++ b/depend/zcash/src/obj/.gitignore
@@ -0,0 +1,2 @@
+*
+!.gitignore
diff --git a/depend/zcash/src/policy/fees.cpp b/depend/zcash/src/policy/fees.cpp
new file mode 100644
index 000000000..da182b08e
--- /dev/null
+++ b/depend/zcash/src/policy/fees.cpp
@@ -0,0 +1,538 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2015 The Bitcoin developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "policy/fees.h"
+
+#include "amount.h"
+#include "primitives/transaction.h"
+#include "streams.h"
+#include "txmempool.h"
+#include "util.h"
+
+void TxConfirmStats::Initialize(std::vector<double>& defaultBuckets,
+                                unsigned int maxConfirms, double _decay, std::string _dataTypeString)
+{
+    decay = _decay;
+    dataTypeString = _dataTypeString;
+
+    buckets.insert(buckets.end(), defaultBuckets.begin(), defaultBuckets.end());
+    buckets.push_back(std::numeric_limits<double>::infinity());
+
+    for (unsigned int i = 0; i < buckets.size(); i++) {
+        bucketMap[buckets[i]] = i;
+    }
+
+    confAvg.resize(maxConfirms);
+    curBlockConf.resize(maxConfirms);
+    unconfTxs.resize(maxConfirms);
+    for (unsigned int i = 0; i < maxConfirms; i++) {
+        confAvg[i].resize(buckets.size());
+        curBlockConf[i].resize(buckets.size());
+        unconfTxs[i].resize(buckets.size());
+    }
+
+    oldUnconfTxs.resize(buckets.size());
+    curBlockTxCt.resize(buckets.size());
+    txCtAvg.resize(buckets.size());
+    curBlockVal.resize(buckets.size());
+    avg.resize(buckets.size());
+}
+
+// Zero out the data for the current block
+void TxConfirmStats::ClearCurrent(unsigned int nBlockHeight)
+{
+    for (unsigned int j = 0; j < buckets.size(); j++) {
+        oldUnconfTxs[j] += unconfTxs[nBlockHeight%unconfTxs.size()][j];
+        unconfTxs[nBlockHeight%unconfTxs.size()][j] = 0;
+        for (unsigned int i = 0; i < curBlockConf.size(); i++)
+            curBlockConf[i][j] = 0;
+        curBlockTxCt[j] = 0;
+        curBlockVal[j] = 0;
+    }
+}
+
+unsigned int TxConfirmStats::FindBucketIndex(double val)
+{
+    auto it = bucketMap.lower_bound(val);
+    assert(it != bucketMap.end());
+    return it->second;
+}
+
+void TxConfirmStats::Record(int blocksToConfirm, double val)
+{
+    // blocksToConfirm is 1-based
+    if (blocksToConfirm < 1)
+        return;
+    unsigned int bucketindex = FindBucketIndex(val);
+    for (size_t i = blocksToConfirm; i <= curBlockConf.size(); i++) {
+        curBlockConf[i - 1][bucketindex]++;
+    }
+    curBlockTxCt[bucketindex]++;
+    curBlockVal[bucketindex] += val;
+}
+
+void TxConfirmStats::UpdateMovingAverages()
+{
+    for (unsigned int j = 0; j < buckets.size(); j++) {
+        for (unsigned int i = 0; i < confAvg.size(); i++)
+            confAvg[i][j] = confAvg[i][j] * decay + curBlockConf[i][j];
+        avg[j] = avg[j] * decay + curBlockVal[j];
+        txCtAvg[j] = txCtAvg[j] * decay + curBlockTxCt[j];
+    }
+}
+
+// returns -1 on error conditions
+double TxConfirmStats::EstimateMedianVal(int confTarget, double sufficientTxVal,
+                                         double successBreakPoint, bool requireGreater,
+                                         unsigned int nBlockHeight)
+{
+    // Counters for a bucket (or range of buckets)
+    double nConf = 0; // Number of tx's confirmed within the confTarget
+    double totalNum = 0; // Total number of tx's that were ever confirmed
+    int extraNum = 0;  // Number of tx's still in mempool for confTarget or longer
+
+    int maxbucketindex = buckets.size() - 1;
+
+    // requireGreater means we are looking for the lowest fee/priority such that all higher
+    // values pass, so we start at maxbucketindex (highest fee) and look at succesively
+    // smaller buckets until we reach failure.  Otherwise, we are looking for the highest
+    // fee/priority such that all lower values fail, and we go in the opposite direction.
+    unsigned int startbucket = requireGreater ? maxbucketindex : 0;
+    int step = requireGreater ? -1 : 1;
+
+    // We'll combine buckets until we have enough samples.
+    // The near and far variables will define the range we've combined
+    // The best variables are the last range we saw which still had a high
+    // enough confirmation rate to count as success.
+    // The cur variables are the current range we're counting.
+    unsigned int curNearBucket = startbucket;
+    unsigned int bestNearBucket = startbucket;
+    unsigned int curFarBucket = startbucket;
+    unsigned int bestFarBucket = startbucket;
+
+    bool foundAnswer = false;
+    unsigned int bins = unconfTxs.size();
+
+    // Start counting from highest(default) or lowest fee/pri transactions
+    for (int bucket = startbucket; bucket >= 0 && bucket <= maxbucketindex; bucket += step) {
+        curFarBucket = bucket;
+        nConf += confAvg[confTarget - 1][bucket];
+        totalNum += txCtAvg[bucket];
+        for (unsigned int confct = confTarget; confct < GetMaxConfirms(); confct++)
+            extraNum += unconfTxs[(nBlockHeight - confct)%bins][bucket];
+        extraNum += oldUnconfTxs[bucket];
+        // If we have enough transaction data points in this range of buckets,
+        // we can test for success
+        // (Only count the confirmed data points, so that each confirmation count
+        // will be looking at the same amount of data and same bucket breaks)
+        if (totalNum >= sufficientTxVal / (1 - decay)) {
+            double curPct = nConf / (totalNum + extraNum);
+
+            // Check to see if we are no longer getting confirmed at the success rate
+            if (requireGreater && curPct < successBreakPoint)
+                break;
+            if (!requireGreater && curPct > successBreakPoint)
+                break;
+
+            // Otherwise update the cumulative stats, and the bucket variables
+            // and reset the counters
+            else {
+                foundAnswer = true;
+                nConf = 0;
+                totalNum = 0;
+                extraNum = 0;
+                bestNearBucket = curNearBucket;
+                bestFarBucket = curFarBucket;
+                curNearBucket = bucket + step;
+            }
+        }
+    }
+
+    double median = -1;
+    double txSum = 0;
+
+    // Calculate the "average" fee of the best bucket range that met success conditions
+    // Find the bucket with the median transaction and then report the average fee from that bucket
+    // This is a compromise between finding the median which we can't since we don't save all tx's
+    // and reporting the average which is less accurate
+    unsigned int minBucket = bestNearBucket < bestFarBucket ? bestNearBucket : bestFarBucket;
+    unsigned int maxBucket = bestNearBucket > bestFarBucket ? bestNearBucket : bestFarBucket;
+    for (unsigned int j = minBucket; j <= maxBucket; j++) {
+        txSum += txCtAvg[j];
+    }
+    if (foundAnswer && txSum != 0) {
+        txSum = txSum / 2;
+        for (unsigned int j = minBucket; j <= maxBucket; j++) {
+            if (txCtAvg[j] < txSum)
+                txSum -= txCtAvg[j];
+            else { // we're in the right bucket
+                median = avg[j] / txCtAvg[j];
+                break;
+            }
+        }
+    }
+
+    LogPrint("estimatefee", "%3d: For conf success %s %4.2f need %s %s: %12.5g from buckets %8g - %8g  Cur Bucket stats %6.2f%%  %8.1f/(%.1f+%d mempool)\n",
+             confTarget, requireGreater ? ">" : "<", successBreakPoint, dataTypeString,
+             requireGreater ? ">" : "<", median, buckets[minBucket], buckets[maxBucket],
+             100 * nConf / (totalNum + extraNum), nConf, totalNum, extraNum);
+
+    return median;
+}
+
+void TxConfirmStats::Write(CAutoFile& fileout)
+{
+    fileout << decay;
+    fileout << buckets;
+    fileout << avg;
+    fileout << txCtAvg;
+    fileout << confAvg;
+}
+
+void TxConfirmStats::Read(CAutoFile& filein)
+{
+    // Read data file into temporary variables and do some very basic sanity checking
+    std::vector<double> fileBuckets;
+    std::vector<double> fileAvg;
+    std::vector<std::vector<double> > fileConfAvg;
+    std::vector<double> fileTxCtAvg;
+    double fileDecay;
+    size_t maxConfirms;
+    size_t numBuckets;
+
+    filein >> fileDecay;
+    if (fileDecay <= 0 || fileDecay >= 1)
+        throw std::runtime_error("Corrupt estimates file. Decay must be between 0 and 1 (non-inclusive)");
+    filein >> fileBuckets;
+    numBuckets = fileBuckets.size();
+    if (numBuckets <= 1 || numBuckets > 1000)
+        throw std::runtime_error("Corrupt estimates file. Must have between 2 and 1000 fee/pri buckets");
+    filein >> fileAvg;
+    if (fileAvg.size() != numBuckets)
+        throw std::runtime_error("Corrupt estimates file. Mismatch in fee/pri average bucket count");
+    filein >> fileTxCtAvg;
+    if (fileTxCtAvg.size() != numBuckets)
+        throw std::runtime_error("Corrupt estimates file. Mismatch in tx count bucket count");
+    filein >> fileConfAvg;
+    maxConfirms = fileConfAvg.size();
+    if (maxConfirms <= 0 || maxConfirms > 6 * 24 * 7) // one week
+        throw std::runtime_error("Corrupt estimates file.  Must maintain estimates for between 1 and 1008 (one week) confirms");
+    for (unsigned int i = 0; i < maxConfirms; i++) {
+        if (fileConfAvg[i].size() != numBuckets)
+            throw std::runtime_error("Corrupt estimates file. Mismatch in fee/pri conf average bucket count");
+    }
+    // Now that we've processed the entire fee estimate data file and not
+    // thrown any errors, we can copy it to our data structures
+    decay = fileDecay;
+    buckets = fileBuckets;
+    avg = fileAvg;
+    confAvg = fileConfAvg;
+    txCtAvg = fileTxCtAvg;
+    bucketMap.clear();
+
+    // Resize the current block variables which aren't stored in the data file
+    // to match the number of confirms and buckets
+    curBlockConf.resize(maxConfirms);
+    for (unsigned int i = 0; i < maxConfirms; i++) {
+        curBlockConf[i].resize(buckets.size());
+    }
+    curBlockTxCt.resize(buckets.size());
+    curBlockVal.resize(buckets.size());
+
+    unconfTxs.resize(maxConfirms);
+    for (unsigned int i = 0; i < maxConfirms; i++) {
+        unconfTxs[i].resize(buckets.size());
+    }
+    oldUnconfTxs.resize(buckets.size());
+
+    for (unsigned int i = 0; i < buckets.size(); i++)
+        bucketMap[buckets[i]] = i;
+
+    LogPrint("estimatefee", "Reading estimates: %u %s buckets counting confirms up to %u blocks\n",
+             numBuckets, dataTypeString, maxConfirms);
+}
+
+unsigned int TxConfirmStats::NewTx(unsigned int nBlockHeight, double val)
+{
+    unsigned int bucketindex = FindBucketIndex(val);
+    unsigned int blockIndex = nBlockHeight % unconfTxs.size();
+    unconfTxs[blockIndex][bucketindex]++;
+    LogPrint("estimatefee", "adding to %s", dataTypeString);
+    return bucketindex;
+}
+
+void TxConfirmStats::removeTx(unsigned int entryHeight, unsigned int nBestSeenHeight, unsigned int bucketindex)
+{
+    //nBestSeenHeight is not updated yet for the new block
+    int blocksAgo = nBestSeenHeight - entryHeight;
+    if (nBestSeenHeight == 0)  // the BlockPolicyEstimator hasn't seen any blocks yet
+        blocksAgo = 0;
+    if (blocksAgo < 0) {
+        LogPrint("estimatefee", "Blockpolicy error, blocks ago is negative for mempool tx\n");
+        return;  //This can't happen because we call this with our best seen height, no entries can have higher
+    }
+
+    if (blocksAgo >= (int)unconfTxs.size()) {
+        if (oldUnconfTxs[bucketindex] > 0)
+            oldUnconfTxs[bucketindex]--;
+        else
+            LogPrint("estimatefee", "Blockpolicy error, mempool tx removed from >25 blocks,bucketIndex=%u already\n",
+                     bucketindex);
+    }
+    else {
+        unsigned int blockIndex = entryHeight % unconfTxs.size();
+        if (unconfTxs[blockIndex][bucketindex] > 0)
+            unconfTxs[blockIndex][bucketindex]--;
+        else
+            LogPrint("estimatefee", "Blockpolicy error, mempool tx removed from blockIndex=%u,bucketIndex=%u already\n",
+                     blockIndex, bucketindex);
+    }
+}
+
+void CBlockPolicyEstimator::removeTx(uint256 hash)
+{
+    std::map<uint256, TxStatsInfo>::iterator pos = mapMemPoolTxs.find(hash);
+    if (pos == mapMemPoolTxs.end()) {
+        LogPrint("estimatefee", "Blockpolicy error mempool tx %s not found for removeTx\n",
+                 hash.ToString().c_str());
+        return;
+    }
+    TxConfirmStats *stats = pos->second.stats;
+    unsigned int entryHeight = pos->second.blockHeight;
+    unsigned int bucketIndex = pos->second.bucketIndex;
+
+    if (stats != NULL)
+        stats->removeTx(entryHeight, nBestSeenHeight, bucketIndex);
+    mapMemPoolTxs.erase(hash);
+}
+
+CBlockPolicyEstimator::CBlockPolicyEstimator(const CFeeRate& _minRelayFee)
+    : nBestSeenHeight(0)
+{
+    minTrackedFee = _minRelayFee < CFeeRate(MIN_FEERATE) ? CFeeRate(MIN_FEERATE) : _minRelayFee;
+    std::vector<double> vfeelist;
+    for (double bucketBoundary = minTrackedFee.GetFeePerK(); bucketBoundary <= MAX_FEERATE; bucketBoundary *= FEE_SPACING) {
+        vfeelist.push_back(bucketBoundary);
+    }
+    feeStats.Initialize(vfeelist, MAX_BLOCK_CONFIRMS, DEFAULT_DECAY, "FeeRate");
+
+    minTrackedPriority = AllowFreeThreshold() < MIN_PRIORITY ? MIN_PRIORITY : AllowFreeThreshold();
+    std::vector<double> vprilist;
+    for (double bucketBoundary = minTrackedPriority; bucketBoundary <= MAX_PRIORITY; bucketBoundary *= PRI_SPACING) {
+        vprilist.push_back(bucketBoundary);
+    }
+    priStats.Initialize(vprilist, MAX_BLOCK_CONFIRMS, DEFAULT_DECAY, "Priority");
+
+    feeUnlikely = CFeeRate(0);
+    feeLikely = CFeeRate(INF_FEERATE);
+    priUnlikely = 0;
+    priLikely = INF_PRIORITY;
+}
+
+bool CBlockPolicyEstimator::isFeeDataPoint(const CFeeRate &fee, double pri)
+{
+    if ((pri < minTrackedPriority && fee >= minTrackedFee) ||
+        (pri < priUnlikely && fee > feeLikely)) {
+        return true;
+    }
+    return false;
+}
+
+bool CBlockPolicyEstimator::isPriDataPoint(const CFeeRate &fee, double pri)
+{
+    if ((fee < minTrackedFee && pri >= minTrackedPriority) ||
+        (fee < feeUnlikely && pri > priLikely)) {
+        return true;
+    }
+    return false;
+}
+
+void CBlockPolicyEstimator::processTransaction(const CTxMemPoolEntry& entry, bool fCurrentEstimate)
+{
+    unsigned int txHeight = entry.GetHeight();
+    uint256 hash = entry.GetTx().GetHash();
+    if (mapMemPoolTxs[hash].stats != NULL) {
+        LogPrint("estimatefee", "Blockpolicy error mempool tx %s already being tracked\n",
+                 hash.ToString().c_str());
+	return;
+    }
+
+    if (txHeight < nBestSeenHeight) {
+        // Ignore side chains and re-orgs; assuming they are random they don't
+        // affect the estimate.  We'll potentially double count transactions in 1-block reorgs.
+        return;
+    }
+
+    // Only want to be updating estimates when our blockchain is synced,
+    // otherwise we'll miscalculate how many blocks its taking to get included.
+    if (!fCurrentEstimate)
+        return;
+
+    if (!entry.WasClearAtEntry()) {
+        // This transaction depends on other transactions in the mempool to
+        // be included in a block before it will be able to be included, so
+        // we shouldn't include it in our calculations
+        return;
+    }
+
+    // Fees are stored and reported as BTC-per-kb:
+    CFeeRate feeRate(entry.GetFee(), entry.GetTxSize());
+
+    // Want the priority of the tx at confirmation. However we don't know
+    // what that will be and its too hard to continue updating it
+    // so use starting priority as a proxy
+    double curPri = entry.GetPriority(txHeight);
+    mapMemPoolTxs[hash].blockHeight = txHeight;
+
+    LogPrint("estimatefee", "Blockpolicy mempool tx %s ", hash.ToString().substr(0,10));
+    // Record this as a priority estimate
+    if (entry.GetFee() == 0 || isPriDataPoint(feeRate, curPri)) {
+        mapMemPoolTxs[hash].stats = &priStats;
+        mapMemPoolTxs[hash].bucketIndex =  priStats.NewTx(txHeight, curPri);
+    }
+    // Record this as a fee estimate
+    else if (isFeeDataPoint(feeRate, curPri)) {
+        mapMemPoolTxs[hash].stats = &feeStats;
+        mapMemPoolTxs[hash].bucketIndex = feeStats.NewTx(txHeight, (double)feeRate.GetFeePerK());
+    }
+    else {
+        LogPrint("estimatefee", "not adding");
+    }
+    LogPrint("estimatefee", "\n");
+}
+
+void CBlockPolicyEstimator::processBlockTx(unsigned int nBlockHeight, const CTxMemPoolEntry& entry)
+{
+    if (!entry.WasClearAtEntry()) {
+        // This transaction depended on other transactions in the mempool to
+        // be included in a block before it was able to be included, so
+        // we shouldn't include it in our calculations
+        return;
+    }
+
+    // How many blocks did it take for miners to include this transaction?
+    // blocksToConfirm is 1-based, so a transaction included in the earliest
+    // possible block has confirmation count of 1
+    int blocksToConfirm = nBlockHeight - entry.GetHeight();
+    if (blocksToConfirm <= 0) {
+        // This can't happen because we don't process transactions from a block with a height
+        // lower than our greatest seen height
+        LogPrint("estimatefee", "Blockpolicy error Transaction had negative blocksToConfirm\n");
+        return;
+    }
+
+    // Fees are stored and reported as BTC-per-kb:
+    CFeeRate feeRate(entry.GetFee(), entry.GetTxSize());
+
+    // Want the priority of the tx at confirmation.  The priority when it
+    // entered the mempool could easily be very small and change quickly
+    double curPri = entry.GetPriority(nBlockHeight);
+
+    // Record this as a priority estimate
+    if (entry.GetFee() == 0 || isPriDataPoint(feeRate, curPri)) {
+        priStats.Record(blocksToConfirm, curPri);
+    }
+    // Record this as a fee estimate
+    else if (isFeeDataPoint(feeRate, curPri)) {
+        feeStats.Record(blocksToConfirm, (double)feeRate.GetFeePerK());
+    }
+}
+
+void CBlockPolicyEstimator::processBlock(unsigned int nBlockHeight,
+                                         std::vector<CTxMemPoolEntry>& entries, bool fCurrentEstimate)
+{
+    if (nBlockHeight <= nBestSeenHeight) {
+        // Ignore side chains and re-orgs; assuming they are random
+        // they don't affect the estimate.
+        // And if an attacker can re-org the chain at will, then
+        // you've got much bigger problems than "attacker can influence
+        // transaction fees."
+        return;
+    }
+    nBestSeenHeight = nBlockHeight;
+
+    // Only want to be updating estimates when our blockchain is synced,
+    // otherwise we'll miscalculate how many blocks its taking to get included.
+    if (!fCurrentEstimate)
+        return;
+
+    // Update the dynamic cutoffs
+    // a fee/priority is "likely" the reason your tx was included in a block if >85% of such tx's
+    // were confirmed in 2 blocks and is "unlikely" if <50% were confirmed in 10 blocks
+    LogPrint("estimatefee", "Blockpolicy recalculating dynamic cutoffs:\n");
+    priLikely = priStats.EstimateMedianVal(2, SUFFICIENT_PRITXS, MIN_SUCCESS_PCT, true, nBlockHeight);
+    if (priLikely == -1)
+        priLikely = INF_PRIORITY;
+
+    double feeLikelyEst = feeStats.EstimateMedianVal(2, SUFFICIENT_FEETXS, MIN_SUCCESS_PCT, true, nBlockHeight);
+    if (feeLikelyEst == -1)
+        feeLikely = CFeeRate(INF_FEERATE);
+    else
+        feeLikely = CFeeRate(feeLikelyEst);
+
+    priUnlikely = priStats.EstimateMedianVal(10, SUFFICIENT_PRITXS, UNLIKELY_PCT, false, nBlockHeight);
+    if (priUnlikely == -1)
+        priUnlikely = 0;
+
+    double feeUnlikelyEst = feeStats.EstimateMedianVal(10, SUFFICIENT_FEETXS, UNLIKELY_PCT, false, nBlockHeight);
+    if (feeUnlikelyEst == -1)
+        feeUnlikely = CFeeRate(0);
+    else
+        feeUnlikely = CFeeRate(feeUnlikelyEst);
+
+    // Clear the current block states
+    feeStats.ClearCurrent(nBlockHeight);
+    priStats.ClearCurrent(nBlockHeight);
+
+    // Repopulate the current block states
+    for (unsigned int i = 0; i < entries.size(); i++)
+        processBlockTx(nBlockHeight, entries[i]);
+
+    // Update all exponential averages with the current block states
+    feeStats.UpdateMovingAverages();
+    priStats.UpdateMovingAverages();
+
+    LogPrint("estimatefee", "Blockpolicy after updating estimates for %u confirmed entries, new mempool map size %u\n",
+             entries.size(), mapMemPoolTxs.size());
+}
+
+CFeeRate CBlockPolicyEstimator::estimateFee(int confTarget)
+{
+    // Return failure if trying to analyze a target we're not tracking
+    if (confTarget <= 0 || (unsigned int)confTarget > feeStats.GetMaxConfirms())
+        return CFeeRate(0);
+
+    double median = feeStats.EstimateMedianVal(confTarget, SUFFICIENT_FEETXS, MIN_SUCCESS_PCT, true, nBestSeenHeight);
+
+    if (median < 0)
+        return CFeeRate(0);
+
+    return CFeeRate(median);
+}
+
+double CBlockPolicyEstimator::estimatePriority(int confTarget)
+{
+    // Return failure if trying to analyze a target we're not tracking
+    if (confTarget <= 0 || (unsigned int)confTarget > priStats.GetMaxConfirms())
+        return -1;
+
+    return priStats.EstimateMedianVal(confTarget, SUFFICIENT_PRITXS, MIN_SUCCESS_PCT, true, nBestSeenHeight);
+}
+
+void CBlockPolicyEstimator::Write(CAutoFile& fileout)
+{
+    fileout << nBestSeenHeight;
+    feeStats.Write(fileout);
+    priStats.Write(fileout);
+}
+
+void CBlockPolicyEstimator::Read(CAutoFile& filein)
+{
+    int nFileBestSeenHeight;
+    filein >> nFileBestSeenHeight;
+    feeStats.Read(filein);
+    priStats.Read(filein);
+    nBestSeenHeight = nFileBestSeenHeight;
+}
diff --git a/depend/zcash/src/policy/fees.h b/depend/zcash/src/policy/fees.h
new file mode 100644
index 000000000..383d629d1
--- /dev/null
+++ b/depend/zcash/src/policy/fees.h
@@ -0,0 +1,285 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2015 The Bitcoin developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+#ifndef BITCOIN_POLICY_FEES_H
+#define BITCOIN_POLICY_FEES_H
+
+#include "amount.h"
+#include "uint256.h"
+
+#include <map>
+#include <string>
+#include <vector>
+
+static const CAmount DEFAULT_FEE = 1000;
+
+class CAutoFile;
+class CFeeRate;
+class CTxMemPoolEntry;
+
+/** \class CBlockPolicyEstimator
+ * The BlockPolicyEstimator is used for estimating the fee or priority needed
+ * for a transaction to be included in a block within a certain number of
+ * blocks.
+ *
+ * At a high level the algorithm works by grouping transactions into buckets
+ * based on having similar priorities or fees and then tracking how long it
+ * takes transactions in the various buckets to be mined.  It operates under
+ * the assumption that in general transactions of higher fee/priority will be
+ * included in blocks before transactions of lower fee/priority.   So for
+ * example if you wanted to know what fee you should put on a transaction to
+ * be included in a block within the next 5 blocks, you would start by looking
+ * at the bucket with the highest fee transactions and verifying that a
+ * sufficiently high percentage of them were confirmed within 5 blocks and
+ * then you would look at the next highest fee bucket, and so on, stopping at
+ * the last bucket to pass the test.   The average fee of transactions in this
+ * bucket will give you an indication of the lowest fee you can put on a
+ * transaction and still have a sufficiently high chance of being confirmed
+ * within your desired 5 blocks.
+ *
+ * When a transaction enters the mempool or is included within a block we
+ * decide whether it can be used as a data point for fee estimation, priority
+ * estimation or neither.  If the value of exactly one of those properties was
+ * below the required minimum it can be used to estimate the other.  In
+ * addition, if a priori our estimation code would indicate that the
+ * transaction would be much more quickly included in a block because of one
+ * of the properties compared to the other, we can also decide to use it as
+ * an estimate for that property.
+ *
+ * Here is a brief description of the implementation for fee estimation.
+ * When a transaction that counts for fee estimation enters the mempool, we
+ * track the height of the block chain at entry.  Whenever a block comes in,
+ * we count the number of transactions in each bucket and the total amount of fee
+ * paid in each bucket. Then we calculate how many blocks Y it took each
+ * transaction to be mined and we track an array of counters in each bucket
+ * for how long it to took transactions to get confirmed from 1 to a max of 25
+ * and we increment all the counters from Y up to 25. This is because for any
+ * number Z>=Y the transaction was successfully mined within Z blocks.  We
+ * want to save a history of this information, so at any time we have a
+ * counter of the total number of transactions that happened in a given fee
+ * bucket and the total number that were confirmed in each number 1-25 blocks
+ * or less for any bucket.   We save this history by keeping an exponentially
+ * decaying moving average of each one of these stats.  Furthermore we also
+ * keep track of the number unmined (in mempool) transactions in each bucket
+ * and for how many blocks they have been outstanding and use that to increase
+ * the number of transactions we've seen in that fee bucket when calculating
+ * an estimate for any number of confirmations below the number of blocks
+ * they've been outstanding.
+ */
+
+/** Decay of .998 is a half-life of 346 blocks or about 2.4 days */
+static const double DEFAULT_DECAY = .998;
+
+/**
+ * We will instantiate two instances of this class, one to track transactions
+ * that were included in a block due to fee, and one for txs included due to
+ * priority.  We will lump transactions into a bucket according to their approximate
+ * fee or priority and then track how long it took for those txs to be included
+ * in a block. There is always a bucket into which any given double value
+ * (representing a fee or priority) falls.
+ *
+ * The tracking of unconfirmed (mempool) transactions is completely independent of the
+ * historical tracking of transactions that have been confirmed in a block.
+ */
+class TxConfirmStats
+{
+private:
+    //Define the buckets we will group transactions into (both fee buckets and priority buckets)
+    std::vector<double> buckets;              // The upper-bound of the range for the bucket (inclusive)
+    std::map<double, unsigned int> bucketMap; // Map of bucket upper-bound to index into all vectors by bucket
+
+    // For each bucket X:
+    // Count the total # of txs in each bucket
+    // Track the historical moving average of this total over blocks
+    std::vector<double> txCtAvg;
+    // and calculate the total for the current block to update the moving average
+    std::vector<int> curBlockTxCt;
+
+    // Count the total # of txs confirmed within Y blocks in each bucket
+    // Track the historical moving average of these totals over blocks
+    std::vector<std::vector<double> > confAvg; // confAvg[Y][X]
+    // and calculate the totals for the current block to update the moving averages
+    std::vector<std::vector<int> > curBlockConf; // curBlockConf[Y][X]
+
+    // Sum the total priority/fee of all txs in each bucket
+    // Track the historical moving average of this total over blocks
+    std::vector<double> avg;
+    // and calculate the total for the current block to update the moving average
+    std::vector<double> curBlockVal;
+
+    // Combine the conf counts with tx counts to calculate the confirmation % for each Y,X
+    // Combine the total value with the tx counts to calculate the avg fee/priority per bucket
+
+    std::string dataTypeString;
+    double decay = DEFAULT_DECAY;
+
+    // Mempool counts of outstanding transactions
+    // For each bucket X, track the number of transactions in the mempool
+    // that are unconfirmed for each possible confirmation value Y
+    std::vector<std::vector<int> > unconfTxs;  //unconfTxs[Y][X]
+    // transactions still unconfirmed after MAX_CONFIRMS for each bucket
+    std::vector<int> oldUnconfTxs;
+
+public:
+    /** Find the bucket index of a given value */
+    unsigned int FindBucketIndex(double val);
+
+    /**
+     * Initialize the data structures.  This is called by BlockPolicyEstimator's
+     * constructor with default values.  A final bucket is created implicitly for
+     * values greater than the last upper limit in defaultBuckets.
+     *
+     * @param defaultBuckets contains the upper limits for the bucket boundaries
+     * @param maxConfirms max number of confirms to track
+     * @param decay how much to decay the historical moving average per block
+     * @param dataTypeString for logging purposes
+     */
+    void Initialize(std::vector<double>& defaultBuckets, unsigned int maxConfirms, double decay, std::string dataTypeString);
+
+    /** Clear the state of the curBlock variables to start counting for the new block */
+    void ClearCurrent(unsigned int nBlockHeight);
+
+    /**
+     * Record a new transaction data point in the current block stats
+     * @param blocksToConfirm the number of blocks it took this transaction to confirm
+     * @param val either the fee or the priority when entered of the transaction
+     * @warning blocksToConfirm is 1-based and has to be >= 1
+     */
+    void Record(int blocksToConfirm, double val);
+
+    /** Record a new transaction entering the mempool*/
+    unsigned int NewTx(unsigned int nBlockHeight, double val);
+
+    /** Remove a transaction from mempool tracking stats*/
+    void removeTx(unsigned int entryHeight, unsigned int nBestSeenHeight,
+                  unsigned int bucketIndex);
+
+    /** Update our estimates by decaying our historical moving average and updating
+        with the data gathered from the current block */
+    void UpdateMovingAverages();
+
+    /**
+     * Calculate a fee or priority estimate.  Find the lowest value bucket (or range of buckets
+     * to make sure we have enough data points) whose transactions still have sufficient likelihood
+     * of being confirmed within the target number of confirmations
+     * @param confTarget target number of confirmations
+     * @param sufficientTxVal required average number of transactions per block in a bucket range
+     * @param minSuccess the success probability we require
+     * @param requireGreater return the lowest fee/pri such that all higher values pass minSuccess OR
+     *        return the highest fee/pri such that all lower values fail minSuccess
+     * @param nBlockHeight the current block height
+     */
+    double EstimateMedianVal(int confTarget, double sufficientTxVal,
+                             double minSuccess, bool requireGreater, unsigned int nBlockHeight);
+
+    /** Return the max number of confirms we're tracking */
+    unsigned int GetMaxConfirms() { return confAvg.size(); }
+
+    /** Write state of estimation data to a file*/
+    void Write(CAutoFile& fileout);
+
+    /**
+     * Read saved state of estimation data from a file and replace all internal data structures and
+     * variables with this state.
+     */
+    void Read(CAutoFile& filein);
+};
+
+
+
+/** Track confirm delays up to 25 blocks, can't estimate beyond that */
+static const unsigned int MAX_BLOCK_CONFIRMS = 25;
+
+/** Require greater than 85% of X fee transactions to be confirmed within Y blocks for X to be big enough */
+static const double MIN_SUCCESS_PCT = .85;
+static const double UNLIKELY_PCT = .5;
+
+/** Require an avg of 1 tx in the combined fee bucket per block to have stat significance */
+static const double SUFFICIENT_FEETXS = 1;
+
+/** Require only an avg of 1 tx every 5 blocks in the combined pri bucket (way less pri txs) */
+static const double SUFFICIENT_PRITXS = .2;
+
+// Minimum and Maximum values for tracking fees and priorities
+static const double MIN_FEERATE = 10;
+static const double MAX_FEERATE = 1e7;
+static const double INF_FEERATE = MAX_MONEY;
+static const double MIN_PRIORITY = 10;
+static const double MAX_PRIORITY = 1e16;
+static const double INF_PRIORITY = 1e9 * MAX_MONEY;
+
+// We have to lump transactions into buckets based on fee or priority, but we want to be able
+// to give accurate estimates over a large range of potential fees and priorities
+// Therefore it makes sense to exponentially space the buckets
+/** Spacing of FeeRate buckets */
+static const double FEE_SPACING = 1.1;
+
+/** Spacing of Priority buckets */
+static const double PRI_SPACING = 2;
+
+/**
+ *  We want to be able to estimate fees or priorities that are needed on txs to be included in
+ * a certain number of blocks.  Every time a block is added to the best chain, this class records
+ * stats on the transactions included in that block
+ */
+class CBlockPolicyEstimator
+{
+public:
+    /** Create new BlockPolicyEstimator and initialize stats tracking classes with default values */
+    CBlockPolicyEstimator(const CFeeRate& minRelayFee);
+
+    /** Process all the transactions that have been included in a block */
+    void processBlock(unsigned int nBlockHeight,
+                      std::vector<CTxMemPoolEntry>& entries, bool fCurrentEstimate);
+
+    /** Process a transaction confirmed in a block*/
+    void processBlockTx(unsigned int nBlockHeight, const CTxMemPoolEntry& entry);
+
+    /** Process a transaction accepted to the mempool*/
+    void processTransaction(const CTxMemPoolEntry& entry, bool fCurrentEstimate);
+
+    /** Remove a transaction from the mempool tracking stats*/
+    void removeTx(uint256 hash);
+
+    /** Is this transaction likely included in a block because of its fee?*/
+    bool isFeeDataPoint(const CFeeRate &fee, double pri);
+
+    /** Is this transaction likely included in a block because of its priority?*/
+    bool isPriDataPoint(const CFeeRate &fee, double pri);
+
+    /** Return a fee estimate */
+    CFeeRate estimateFee(int confTarget);
+
+    /** Return a priority estimate */
+    double estimatePriority(int confTarget);
+
+    /** Write estimation data to a file */
+    void Write(CAutoFile& fileout);
+
+    /** Read estimation data from a file */
+    void Read(CAutoFile& filein);
+
+private:
+    CFeeRate minTrackedFee;    //!< Passed to constructor to avoid dependency on main
+    double minTrackedPriority; //!< Set to AllowFreeThreshold
+    unsigned int nBestSeenHeight;
+    struct TxStatsInfo
+    {
+        TxConfirmStats *stats;
+        unsigned int blockHeight;
+        unsigned int bucketIndex;
+        TxStatsInfo() : stats(NULL), blockHeight(0), bucketIndex(0) {}
+    };
+
+    // map of txids to information about that transaction
+    std::map<uint256, TxStatsInfo> mapMemPoolTxs;
+
+    /** Classes to track historical data on transaction confirmations */
+    TxConfirmStats feeStats, priStats;
+
+    /** Breakpoints to help determine whether a transaction was confirmed by priority or Fee */
+    CFeeRate feeLikely, feeUnlikely;
+    double priLikely, priUnlikely;
+};
+#endif // BITCOIN_POLICY_FEES_H
diff --git a/depend/zcash/src/policy/policy.cpp b/depend/zcash/src/policy/policy.cpp
new file mode 100644
index 000000000..8c1872922
--- /dev/null
+++ b/depend/zcash/src/policy/policy.cpp
@@ -0,0 +1,194 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+// NOTE: This file is intended to be customised by the end user, and includes only local node policy logic
+
+#include "policy/policy.h"
+
+#include "main.h"
+#include "tinyformat.h"
+#include "util.h"
+#include "utilstrencodings.h"
+
+
+    /**
+     * Check transaction inputs to mitigate two
+     * potential denial-of-service attacks:
+     * 
+     * 1. scriptSigs with extra data stuffed into them,
+     *    not consumed by scriptPubKey (or P2SH script)
+     * 2. P2SH scripts with very many expensive
+     *    CHECKSIG/CHECKMULTISIG operations
+     *
+     * Check transaction inputs, and make sure any
+     * pay-to-script-hash transactions are evaluating IsStandard scripts
+     * 
+     * Why bother? To avoid denial-of-service attacks; an attacker
+     * can submit a standard HASH... OP_EQUAL transaction,
+     * which will get accepted into blocks. The redemption
+     * script can be anything; an attacker could use a very
+     * expensive-to-check-upon-redemption script like:
+     *   DUP CHECKSIG DROP ... repeated 100 times... OP_1
+     */
+
+bool IsStandard(const CScript& scriptPubKey, txnouttype& whichType)
+{
+    std::vector<std::vector<unsigned char> > vSolutions;
+    if (!Solver(scriptPubKey, whichType, vSolutions))
+        return false;
+
+    if (whichType == TX_MULTISIG)
+    {
+        unsigned char m = vSolutions.front()[0];
+        unsigned char n = vSolutions.back()[0];
+        // Support up to x-of-3 multisig txns as standard
+        if (n < 1 || n > 3)
+            return false;
+        if (m < 1 || m > n)
+            return false;
+    } else if (whichType == TX_NULL_DATA &&
+               (!GetBoolArg("-datacarrier", true) || scriptPubKey.size() > nMaxDatacarrierBytes))
+          return false;
+
+    return whichType != TX_NONSTANDARD;
+}
+
+bool IsStandardTx(const CTransaction& tx, std::string& reason, const CChainParams& chainparams, const int nHeight)
+{
+    bool overwinterActive = chainparams.GetConsensus().NetworkUpgradeActive(nHeight,  Consensus::UPGRADE_OVERWINTER);
+    bool saplingActive = chainparams.GetConsensus().NetworkUpgradeActive(nHeight, Consensus::UPGRADE_SAPLING);
+    bool nu5Active = chainparams.GetConsensus().NetworkUpgradeActive(nHeight, Consensus::UPGRADE_NU5);
+
+    if (nu5Active) {
+        // NU5 standard rules apply
+        if (tx.nVersion > CTransaction::NU5_MAX_CURRENT_VERSION || tx.nVersion < CTransaction::NU5_MIN_CURRENT_VERSION) {
+            reason = "nu5-version";
+            return false;
+        }
+    } else if (saplingActive) {
+        // Sapling standard rules apply
+        if (tx.nVersion > CTransaction::SAPLING_MAX_CURRENT_VERSION || tx.nVersion < CTransaction::SAPLING_MIN_CURRENT_VERSION) {
+            reason = "sapling-version";
+            return false;
+        }
+    } else if (overwinterActive) {
+        // Overwinter standard rules apply
+        if (tx.nVersion > CTransaction::OVERWINTER_MAX_CURRENT_VERSION || tx.nVersion < CTransaction::OVERWINTER_MIN_CURRENT_VERSION) {
+            reason = "overwinter-version";
+            return false;
+        }
+    } else {
+        // Sprout standard rules apply
+        if (tx.nVersion > CTransaction::SPROUT_MAX_CURRENT_VERSION || tx.nVersion < CTransaction::SPROUT_MIN_CURRENT_VERSION) {
+            reason = "version";
+            return false;
+        }
+    }
+
+    for (const CTxIn& txin : tx.vin)
+    {
+        // Biggest 'standard' txin is a 15-of-15 P2SH multisig with compressed
+        // keys. (remember the 520 byte limit on redeemScript size) That works
+        // out to a (15*(33+1))+3=513 byte redeemScript, 513+1+15*(73+1)+3=1627
+        // bytes of scriptSig, which we round off to 1650 bytes for some minor
+        // future-proofing. That's also enough to spend a 20-of-20
+        // CHECKMULTISIG scriptPubKey, though such a scriptPubKey is not
+        // considered standard)
+        if (txin.scriptSig.size() > 1650) {
+            reason = "scriptsig-size";
+            return false;
+        }
+        if (!txin.scriptSig.IsPushOnly()) {
+            reason = "scriptsig-not-pushonly";
+            return false;
+        }
+    }
+
+    unsigned int nDataOut = 0;
+    txnouttype whichType;
+    for (const CTxOut& txout : tx.vout) {
+        if (!::IsStandard(txout.scriptPubKey, whichType)) {
+            reason = "scriptpubkey";
+            return false;
+        }
+
+        if (whichType == TX_NULL_DATA)
+            nDataOut++;
+        else if ((whichType == TX_MULTISIG) && (!fIsBareMultisigStd)) {
+            reason = "bare-multisig";
+            return false;
+        } else if (txout.IsDust(::minRelayTxFee)) {
+            reason = "dust";
+            return false;
+        }
+    }
+
+    // only one OP_RETURN txout is permitted
+    if (nDataOut > 1) {
+        reason = "multi-op-return";
+        return false;
+    }
+
+    return true;
+}
+
+bool AreInputsStandard(const CTransaction& tx, const CCoinsViewCache& mapInputs, uint32_t consensusBranchId)
+{
+    if (tx.IsCoinBase())
+        return true; // Coinbases don't use vin normally
+
+    for (unsigned int i = 0; i < tx.vin.size(); i++)
+    {
+        const CTxOut& prev = mapInputs.GetOutputFor(tx.vin[i]);
+
+        std::vector<std::vector<unsigned char> > vSolutions;
+        txnouttype whichType;
+        // get the scriptPubKey corresponding to this input:
+        const CScript& prevScript = prev.scriptPubKey;
+        if (!Solver(prevScript, whichType, vSolutions))
+            return false;
+        int nArgsExpected = ScriptSigArgsExpected(whichType, vSolutions);
+        if (nArgsExpected < 0)
+            return false;
+
+        // Transactions with extra stuff in their scriptSigs are
+        // non-standard. Note that this EvalScript() call will
+        // be quick, because if there are any operations
+        // beside "push data" in the scriptSig
+        // IsStandardTx() will have already returned false
+        // and this method isn't called.
+        std::vector<std::vector<unsigned char> > stack;
+        if (!EvalScript(stack, tx.vin[i].scriptSig, SCRIPT_VERIFY_NONE, BaseSignatureChecker(), consensusBranchId))
+            return false;
+
+        if (whichType == TX_SCRIPTHASH)
+        {
+            if (stack.empty())
+                return false;
+            CScript subscript(stack.back().begin(), stack.back().end());
+            std::vector<std::vector<unsigned char> > vSolutions2;
+            txnouttype whichType2;
+            if (Solver(subscript, whichType2, vSolutions2))
+            {
+                int tmpExpected = ScriptSigArgsExpected(whichType2, vSolutions2);
+                if (tmpExpected < 0)
+                    return false;
+                nArgsExpected += tmpExpected;
+            }
+            else
+            {
+                // Any other Script with less than 15 sigops OK:
+                unsigned int sigops = subscript.GetSigOpCount(true);
+                // ... extra data left on the stack after execution is OK, too:
+                return (sigops <= MAX_P2SH_SIGOPS);
+            }
+        }
+
+        if (stack.size() != (unsigned int)nArgsExpected)
+            return false;
+    }
+
+    return true;
+}
diff --git a/depend/zcash/src/policy/policy.h b/depend/zcash/src/policy/policy.h
new file mode 100644
index 000000000..eb635b7c8
--- /dev/null
+++ b/depend/zcash/src/policy/policy.h
@@ -0,0 +1,62 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_POLICY_POLICY_H
+#define BITCOIN_POLICY_POLICY_H
+
+#include "consensus/consensus.h"
+#include "script/interpreter.h"
+#include "script/standard.h"
+
+#include <string>
+
+class CChainParams;
+class CCoinsViewCache;
+
+/** Default for -blockmaxsize and -blockminsize, which control the range of sizes the mining code will create **/
+static const unsigned int DEFAULT_BLOCK_MAX_SIZE = MAX_BLOCK_SIZE;
+static const unsigned int DEFAULT_BLOCK_MIN_SIZE = 0;
+/** Default for -blockprioritysize, maximum space for zero/low-fee transactions **/
+static const unsigned int DEFAULT_BLOCK_PRIORITY_SIZE = DEFAULT_BLOCK_MAX_SIZE / 2;
+/** Maximum number of signature check operations in an IsStandard() P2SH script */
+static const unsigned int MAX_P2SH_SIGOPS = 15;
+/** The maximum number of sigops we're willing to relay/mine in a single tx */
+static const unsigned int MAX_STANDARD_TX_SIGOPS = MAX_BLOCK_SIGOPS/5;
+/**
+ * Standard script verification flags that standard transactions will comply
+ * with. However scripts violating these flags may still be present in valid
+ * blocks and we must accept those blocks.
+ */
+static const unsigned int STANDARD_SCRIPT_VERIFY_FLAGS = MANDATORY_SCRIPT_VERIFY_FLAGS |
+                                                         // SCRIPT_VERIFY_DERSIG is always enforced
+                                                         SCRIPT_VERIFY_STRICTENC |
+                                                         SCRIPT_VERIFY_MINIMALDATA |
+                                                         SCRIPT_VERIFY_NULLDUMMY |
+                                                         SCRIPT_VERIFY_DISCOURAGE_UPGRADABLE_NOPS |
+                                                         SCRIPT_VERIFY_CLEANSTACK |
+                                                         SCRIPT_VERIFY_CHECKLOCKTIMEVERIFY |
+                                                         SCRIPT_VERIFY_LOW_S;
+
+/** For convenience, standard but not mandatory verify flags. */
+static const unsigned int STANDARD_NOT_MANDATORY_VERIFY_FLAGS = STANDARD_SCRIPT_VERIFY_FLAGS & ~MANDATORY_SCRIPT_VERIFY_FLAGS;
+
+// Sanity check the magic numbers when we change them
+static_assert(DEFAULT_BLOCK_MAX_SIZE <= MAX_BLOCK_SIZE);
+static_assert(DEFAULT_BLOCK_PRIORITY_SIZE <= DEFAULT_BLOCK_MAX_SIZE);
+
+bool IsStandard(const CScript& scriptPubKey, txnouttype& whichType);
+    /**
+     * Check for standard transaction types
+     * @return True if all outputs (scriptPubKeys) use only standard transaction forms
+     */
+bool IsStandardTx(const CTransaction& tx, std::string& reason, const CChainParams& chainparams, int nHeight = 0);
+    /**
+     * Check for standard transaction types
+     * @param[in] mapInputs    Map of previous transactions that have outputs we're spending
+     * @return True if all inputs (scriptSigs) use only standard transaction forms
+     */
+bool AreInputsStandard(const CTransaction& tx, const CCoinsViewCache& mapInputs, uint32_t consensusBranchId);
+
+#endif // BITCOIN_POLICY_POLICY_H
diff --git a/depend/zcash/src/pow.cpp b/depend/zcash/src/pow.cpp
new file mode 100644
index 000000000..28b8f2bf4
--- /dev/null
+++ b/depend/zcash/src/pow.cpp
@@ -0,0 +1,172 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "pow.h"
+
+#include "arith_uint256.h"
+#include "chain.h"
+#include "chainparams.h"
+#include "crypto/equihash.h"
+#include "primitives/block.h"
+#include "streams.h"
+#include "uint256.h"
+
+#include <librustzcash.h>
+
+unsigned int GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlockHeader *pblock, const Consensus::Params& params)
+{
+    unsigned int nProofOfWorkLimit = UintToArith256(params.powLimit).GetCompact();
+
+    // Genesis block
+    if (pindexLast == NULL)
+        return nProofOfWorkLimit;
+
+    // Regtest
+    if (params.fPowNoRetargeting)
+        return pindexLast->nBits;
+
+    {
+        // Comparing to pindexLast->nHeight with >= because this function
+        // returns the work required for the block after pindexLast.
+        if (params.nPowAllowMinDifficultyBlocksAfterHeight != std::nullopt &&
+            pindexLast->nHeight >= params.nPowAllowMinDifficultyBlocksAfterHeight.value())
+        {
+            // Special difficulty rule for testnet:
+            // If the new block's timestamp is more than 6 * block interval minutes
+            // then allow mining of a min-difficulty block.
+            if (pblock && pblock->GetBlockTime() > pindexLast->GetBlockTime() + params.PoWTargetSpacing(pindexLast->nHeight + 1) * 6)
+                return nProofOfWorkLimit;
+        }
+    }
+
+    // Find the first block in the averaging interval
+    const CBlockIndex* pindexFirst = pindexLast;
+    arith_uint256 bnTot {0};
+    for (int i = 0; pindexFirst && i < params.nPowAveragingWindow; i++) {
+        arith_uint256 bnTmp;
+        bnTmp.SetCompact(pindexFirst->nBits);
+        bnTot += bnTmp;
+        pindexFirst = pindexFirst->pprev;
+    }
+
+    // Check we have enough blocks
+    if (pindexFirst == NULL)
+        return nProofOfWorkLimit;
+
+    // The protocol specification leaves MeanTarget(height) as a rational, and takes the floor
+    // only after dividing by AveragingWindowTimespan in the computation of Threshold(height):
+    // <https://zips.z.cash/protocol/protocol.pdf#diffadjustment>
+    //
+    // Here we take the floor of MeanTarget(height) immediately, but that is equivalent to doing
+    // so only after a further division, as proven in <https://math.stackexchange.com/a/147832/185422>.
+    arith_uint256 bnAvg {bnTot / params.nPowAveragingWindow};
+
+    return CalculateNextWorkRequired(bnAvg,
+                                     pindexLast->GetMedianTimePast(), pindexFirst->GetMedianTimePast(),
+                                     params,
+                                     pindexLast->nHeight + 1);
+}
+
+unsigned int CalculateNextWorkRequired(arith_uint256 bnAvg,
+                                       int64_t nLastBlockTime, int64_t nFirstBlockTime,
+                                       const Consensus::Params& params,
+                                       int nextHeight)
+{
+    int64_t averagingWindowTimespan = params.AveragingWindowTimespan(nextHeight);
+    int64_t minActualTimespan = params.MinActualTimespan(nextHeight);
+    int64_t maxActualTimespan = params.MaxActualTimespan(nextHeight);
+    // Limit adjustment step
+    // Use medians to prevent time-warp attacks
+    int64_t nActualTimespan = nLastBlockTime - nFirstBlockTime;
+    nActualTimespan = averagingWindowTimespan + (nActualTimespan - averagingWindowTimespan)/4;
+
+    if (nActualTimespan < minActualTimespan) {
+        nActualTimespan = minActualTimespan;
+    }
+    if (nActualTimespan > maxActualTimespan) {
+        nActualTimespan = maxActualTimespan;
+    }
+
+    // Retarget
+    const arith_uint256 bnPowLimit = UintToArith256(params.powLimit);
+    arith_uint256 bnNew {bnAvg};
+    bnNew /= averagingWindowTimespan;
+    bnNew *= nActualTimespan;
+
+    if (bnNew > bnPowLimit) {
+        bnNew = bnPowLimit;
+    }
+
+    return bnNew.GetCompact();
+}
+
+bool CheckEquihashSolution(const CBlockHeader *pblock, const Consensus::Params& params)
+{
+    unsigned int n = params.nEquihashN;
+    unsigned int k = params.nEquihashK;
+
+    // I = the block header minus nonce and solution.
+    CEquihashInput I{*pblock};
+    // I||V
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << I;
+
+    return librustzcash_eh_isvalid(
+        n, k,
+        (unsigned char*)&ss[0], ss.size(),
+        pblock->nNonce.begin(), pblock->nNonce.size(),
+        pblock->nSolution.data(), pblock->nSolution.size());
+}
+
+bool CheckProofOfWork(uint256 hash, unsigned int nBits, const Consensus::Params& params)
+{
+    bool fNegative;
+    bool fOverflow;
+    arith_uint256 bnTarget;
+
+    bnTarget.SetCompact(nBits, &fNegative, &fOverflow);
+
+    // Check range
+    if (fNegative || bnTarget == 0 || fOverflow || bnTarget > UintToArith256(params.powLimit))
+        return false;
+
+    // Check proof of work matches claimed amount
+    if (UintToArith256(hash) > bnTarget)
+        return false;
+
+    return true;
+}
+
+arith_uint256 GetBlockProof(const CBlockIndex& block)
+{
+    arith_uint256 bnTarget;
+    bool fNegative;
+    bool fOverflow;
+    bnTarget.SetCompact(block.nBits, &fNegative, &fOverflow);
+    if (fNegative || fOverflow || bnTarget == 0)
+        return 0;
+    // We need to compute 2**256 / (bnTarget+1), but we can't represent 2**256
+    // as it's too large for an arith_uint256. However, as 2**256 is at least as large
+    // as bnTarget+1, it is equal to ((2**256 - bnTarget - 1) / (bnTarget+1)) + 1,
+    // or ~bnTarget / (bnTarget+1) + 1.
+    return (~bnTarget / (bnTarget + 1)) + 1;
+}
+
+int64_t GetBlockProofEquivalentTime(const CBlockIndex& to, const CBlockIndex& from, const CBlockIndex& tip, const Consensus::Params& params)
+{
+    arith_uint256 r;
+    int sign = 1;
+    if (to.nChainWork > from.nChainWork) {
+        r = to.nChainWork - from.nChainWork;
+    } else {
+        r = from.nChainWork - to.nChainWork;
+        sign = -1;
+    }
+    r = r * arith_uint256(params.PoWTargetSpacing(tip.nHeight)) / GetBlockProof(tip);
+    if (r.bits() > 63) {
+        return sign * std::numeric_limits<int64_t>::max();
+    }
+    return sign * r.GetLow64();
+}
diff --git a/depend/zcash/src/pow.h b/depend/zcash/src/pow.h
new file mode 100644
index 000000000..eb05c6e34
--- /dev/null
+++ b/depend/zcash/src/pow.h
@@ -0,0 +1,35 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_POW_H
+#define BITCOIN_POW_H
+
+#include "consensus/params.h"
+
+#include <stdint.h>
+
+class CBlockHeader;
+class CBlockIndex;
+class CChainParams;
+class uint256;
+class arith_uint256;
+
+unsigned int GetNextWorkRequired(const CBlockIndex* pindexLast, const CBlockHeader *pblock, const Consensus::Params&);
+unsigned int CalculateNextWorkRequired(arith_uint256 bnAvg,
+                                       int64_t nLastBlockTime, int64_t nFirstBlockTime,
+                                       const Consensus::Params&,
+                                       int nextHeight);
+
+/** Check whether the Equihash solution in a block header is valid */
+bool CheckEquihashSolution(const CBlockHeader *pblock, const Consensus::Params&);
+
+/** Check whether a block hash satisfies the proof-of-work requirement specified by nBits */
+bool CheckProofOfWork(uint256 hash, unsigned int nBits, const Consensus::Params&);
+arith_uint256 GetBlockProof(const CBlockIndex& block);
+
+/** Return the time it would take to redo the work difference between from and to, assuming the current hashrate corresponds to the difficulty at tip, in seconds. */
+int64_t GetBlockProofEquivalentTime(const CBlockIndex& to, const CBlockIndex& from, const CBlockIndex& tip, const Consensus::Params&);
+
+#endif // BITCOIN_POW_H
diff --git a/depend/zcash/src/pow/tromp/equi.h b/depend/zcash/src/pow/tromp/equi.h
new file mode 100644
index 000000000..90beb785b
--- /dev/null
+++ b/depend/zcash/src/pow/tromp/equi.h
@@ -0,0 +1,105 @@
+// Equihash solver
+// Copyright (c) 2016-2016 John Tromp, The Zcash developers
+
+#ifndef ZCASH_POW_TROMP_EQUI_H
+#define ZCASH_POW_TROMP_EQUI_H
+
+#ifdef __APPLE__
+#include "pow/tromp/osx_barrier.h"
+#endif
+#include "compat/endian.h"
+
+#include <stdint.h> // for types uint32_t,uint64_t
+#include <string.h> // for functions memset
+#include <stdlib.h> // for function qsort
+
+#include <rust/blake2b.h>
+
+typedef uint32_t u32;
+typedef unsigned char uchar;
+
+// algorithm parameters, prefixed with W to reduce include file conflicts
+
+#ifndef WN
+#define WN	200
+#endif
+
+#ifndef WK
+#define WK	9
+#endif
+
+#define NDIGITS		(WK+1)
+#define DIGITBITS	(WN/(NDIGITS))
+
+static const u32 PROOFSIZE = 1<<WK;
+static const u32 BASE = 1<<DIGITBITS;
+static const u32 NHASHES = 2*BASE;
+static const u32 HASHESPERBLAKE = 512/WN;
+static const u32 HASHOUT = HASHESPERBLAKE*WN/8;
+
+typedef u32 proof[PROOFSIZE];
+
+
+enum verify_code { POW_OK, POW_DUPLICATE, POW_OUT_OF_ORDER, POW_NONZERO_XOR };
+const char *errstr[] = { "OK", "duplicate index", "indices out of order", "nonzero xor" };
+
+void genhash(const BLAKE2bState *ctx, u32 idx, uchar *hash) {
+  auto state = blake2b_clone(ctx);
+  u32 leb = htole32(idx / HASHESPERBLAKE);
+  blake2b_update(state, (uchar *)&leb, sizeof(u32));
+  uchar blakehash[HASHOUT];
+  blake2b_finalize(state, blakehash, HASHOUT);
+  blake2b_free(state);
+  memcpy(hash, blakehash + (idx % HASHESPERBLAKE) * WN/8, WN/8);
+}
+
+int verifyrec(const BLAKE2bState *ctx, u32 *indices, uchar *hash, int r) {
+  if (r == 0) {
+    genhash(ctx, *indices, hash);
+    return POW_OK;
+  }
+  u32 *indices1 = indices + (1 << (r-1));
+  if (*indices >= *indices1)
+    return POW_OUT_OF_ORDER;
+  uchar hash0[WN/8], hash1[WN/8];
+  int vrf0 = verifyrec(ctx, indices,  hash0, r-1);
+  if (vrf0 != POW_OK)
+    return vrf0;
+  int vrf1 = verifyrec(ctx, indices1, hash1, r-1);
+  if (vrf1 != POW_OK)
+    return vrf1;
+  for (int i=0; i < WN/8; i++)
+    hash[i] = hash0[i] ^ hash1[i];
+  int i, b = r * DIGITBITS;
+  for (i = 0; i < b/8; i++)
+    if (hash[i])
+      return POW_NONZERO_XOR;
+  if ((b%8) && hash[i] >> (8-(b%8)))
+    return POW_NONZERO_XOR;
+  return POW_OK;
+}
+
+int compu32(const void *pa, const void *pb) {
+  u32 a = *(u32 *)pa, b = *(u32 *)pb;
+  return a<b ? -1 : a==b ? 0 : +1;
+}
+
+bool duped(proof prf) {
+  proof sortprf;
+  memcpy(sortprf, prf, sizeof(proof));
+  qsort(sortprf, PROOFSIZE, sizeof(u32), &compu32);
+  for (u32 i=1; i<PROOFSIZE; i++)
+    if (sortprf[i] <= sortprf[i-1])
+      return true;
+  return false;
+}
+
+// verify Wagner conditions
+int verify(u32 indices[PROOFSIZE], const BLAKE2bState *ctx) {
+  if (duped(indices))
+    return POW_DUPLICATE;
+  uchar hash[WN/8];
+  return verifyrec(ctx, indices, hash, WK);
+}
+
+#endif // ZCASH_POW_TROMP_EQUI_H
diff --git a/depend/zcash/src/pow/tromp/equi_miner.h b/depend/zcash/src/pow/tromp/equi_miner.h
new file mode 100644
index 000000000..5efbbaa69
--- /dev/null
+++ b/depend/zcash/src/pow/tromp/equi_miner.h
@@ -0,0 +1,651 @@
+// Equihash solver
+// Copyright (c) 2016 John Tromp, The Zcash developers
+
+// Fix N, K, such that n = N/(k+1) is integer
+// Fix M = 2^{n+1} hashes each of length N bits,
+// H_0, ... , H_{M-1}, generated from (n+1)-bit indices.
+// Problem: find binary tree on 2^K distinct indices,
+// for which the exclusive-or of leaf hashes is all 0s.
+// Additionally, it should satisfy the Wagner conditions:
+// for each height i subtree, the exclusive-or
+// of its 2^i corresponding hashes starts with i*n 0 bits,
+// and for i>0 the leftmost leaf of its left subtree
+// is less than the leftmost leaf of its right subtree
+
+// The algorithm below solves this by maintaining the trees
+// in a graph of K layers, each split into buckets
+// with buckets indexed by the first n-RESTBITS bits following
+// the i*n 0s, each bucket having 4 * 2^RESTBITS slots,
+// twice the number of subtrees expected to land there.
+
+#ifndef ZCASH_POW_TROMP_EQUI_MINER_H
+#define ZCASH_POW_TROMP_EQUI_MINER_H
+
+#include "pow/tromp/equi.h"
+#include <stdio.h>
+#include <stdlib.h>
+#include <pthread.h>
+#include <assert.h>
+
+typedef uint16_t u16;
+typedef uint64_t u64;
+
+#ifdef EQUIHASH_TROMP_ATOMIC
+#include <atomic>
+typedef std::atomic<u32> au32;
+#else
+typedef u32 au32;
+#endif
+
+#ifndef RESTBITS
+#define RESTBITS	8
+#endif
+
+// 2_log of number of buckets
+#define BUCKBITS (DIGITBITS-RESTBITS)
+
+#ifndef SAVEMEM
+#if RESTBITS == 4
+// can't save memory in such small buckets
+#define SAVEMEM 1
+#elif RESTBITS >= 8
+// take advantage of law of large numbers (sum of 2^8 random numbers)
+// this reduces (200,9) memory to under 144MB, with negligible discarding
+#define SAVEMEM 9/14
+#endif
+#endif
+
+// number of buckets
+static const u32 NBUCKETS = 1<<BUCKBITS;
+// 2_log of number of slots per bucket
+static const u32 SLOTBITS = RESTBITS+1+1;
+static const u32 SLOTRANGE = 1<<SLOTBITS;
+static const u32 SLOTMSB = 1<<(SLOTBITS-1);
+// number of slots per bucket
+static const u32 NSLOTS = SLOTRANGE * SAVEMEM;
+// number of per-xhash slots
+static const u32 XFULL = 16;
+// SLOTBITS mask
+static const u32 SLOTMASK = SLOTRANGE-1;
+// number of possible values of xhash (rest of n) bits
+static const u32 NRESTS = 1<<RESTBITS;
+// number of blocks of hashes extracted from single 512 bit blake2b output
+static const u32 NBLOCKS = (NHASHES+HASHESPERBLAKE-1)/HASHESPERBLAKE;
+// nothing larger found in 100000 runs
+static const u32 MAXSOLS = 8;
+
+// tree node identifying its children as two different slots in
+// a bucket on previous layer with the same rest bits (x-tra hash)
+struct tree {
+  u32 bid_s0_s1; // manual bitfields
+
+  tree(const u32 idx) {
+    bid_s0_s1 = idx;
+  }
+  tree(const u32 bid, const u32 s0, const u32 s1) {
+#ifdef SLOTDIFF
+    u32 ds10 = (s1 - s0) & SLOTMASK;
+    if (ds10 & SLOTMSB) {
+      bid_s0_s1 = (((bid << SLOTBITS) | s1) << (SLOTBITS-1)) | (SLOTMASK & ~ds10);
+    } else {
+      bid_s0_s1 = (((bid << SLOTBITS) | s0) << (SLOTBITS-1)) | (ds10 - 1);
+    }
+#else
+    bid_s0_s1 = (((bid << SLOTBITS) | s0) << SLOTBITS) | s1;
+#endif
+  }
+  u32 getindex() const {
+    return bid_s0_s1;
+  }
+  u32 bucketid() const {
+#ifdef SLOTDIFF
+    return bid_s0_s1 >> (2 * SLOTBITS - 1);
+#else
+    return bid_s0_s1 >> (2 * SLOTBITS);
+#endif
+  }
+  u32 slotid0() const {
+#ifdef SLOTDIFF
+    return (bid_s0_s1 >> (SLOTBITS-1)) & SLOTMASK;
+#else
+    return (bid_s0_s1 >> SLOTBITS) & SLOTMASK;
+#endif
+  }
+  u32 slotid1() const {
+#ifdef SLOTDIFF
+    return (slotid0() + 1 + (bid_s0_s1 & (SLOTMASK>>1))) & SLOTMASK;
+#else
+    return bid_s0_s1 & SLOTMASK;
+#endif
+  }
+};
+
+union hashunit {
+  u32 word;
+  uchar bytes[sizeof(u32)];
+};
+
+#define WORDS(bits)	((bits + 31) / 32)
+#define HASHWORDS0 WORDS(WN - DIGITBITS + RESTBITS)
+#define HASHWORDS1 WORDS(WN - 2*DIGITBITS + RESTBITS)
+
+struct slot0 {
+  tree attr;
+  hashunit hash[HASHWORDS0];
+};
+
+struct slot1 {
+  tree attr;
+  hashunit hash[HASHWORDS1];
+};
+
+// a bucket is NSLOTS treenodes
+typedef slot0 bucket0[NSLOTS];
+typedef slot1 bucket1[NSLOTS];
+// the N-bit hash consists of K+1 n-bit "digits"
+// each of which corresponds to a layer of NBUCKETS buckets
+typedef bucket0 digit0[NBUCKETS];
+typedef bucket1 digit1[NBUCKETS];
+
+// size (in bytes) of hash in round 0 <= r < WK
+u32 hashsize(const u32 r) {
+  const u32 hashbits = WN - (r+1) * DIGITBITS + RESTBITS;
+  return (hashbits + 7) / 8;
+}
+
+u32 hashwords(u32 bytes) {
+  return (bytes + 3) / 4;
+}
+
+// manages hash and tree data
+struct htalloc {
+  u32 *heap0;
+  u32 *heap1;
+  bucket0 *trees0[(WK+1)/2];
+  bucket1 *trees1[WK/2];
+  u32 alloced;
+  htalloc() {
+    alloced = 0;
+  }
+  void alloctrees() {
+// optimize xenoncat's fixed memory layout, avoiding any waste
+// digit  trees  hashes  trees hashes
+// 0      0 A A A A A A   . . . . . .
+// 1      0 A A A A A A   1 B B B B B
+// 2      0 2 C C C C C   1 B B B B B
+// 3      0 2 C C C C C   1 3 D D D D
+// 4      0 2 4 E E E E   1 3 D D D D
+// 5      0 2 4 E E E E   1 3 5 F F F
+// 6      0 2 4 6 . G G   1 3 5 F F F
+// 7      0 2 4 6 . G G   1 3 5 7 H H
+// 8      0 2 4 6 8 . I   1 3 5 7 H H
+    assert(DIGITBITS >= 16); // ensures hashes shorten by 1 unit every 2 digits
+    heap0 = (u32 *)alloc(1, sizeof(digit0));
+    heap1 = (u32 *)alloc(1, sizeof(digit1));
+    for (int r=0; r<WK; r++)
+      if ((r&1) == 0)
+        trees0[r/2]  = (bucket0 *)(heap0 + r/2);
+      else
+        trees1[r/2]  = (bucket1 *)(heap1 + r/2);
+  }
+  void dealloctrees() {
+    free(heap0);
+    free(heap1);
+  }
+  void *alloc(const u32 n, const u32 sz) {
+    void *mem  = calloc(n, sz);
+    assert(mem);
+    alloced += n * sz;
+    return mem;
+  }
+};
+
+typedef au32 bsizes[NBUCKETS];
+
+u32 min(const u32 a, const u32 b) {
+  return a < b ? a : b;
+}
+
+struct equi {
+  BLAKE2bState* blake_ctx;
+  htalloc hta;
+  bsizes *nslots; // PUT IN BUCKET STRUCT
+  proof *sols;
+  au32 nsols;
+  u32 nthreads;
+  u32 xfull;
+  u32 hfull;
+  u32 bfull;
+  pthread_barrier_t barry;
+  equi(const u32 n_threads) {
+    assert(sizeof(hashunit) == 4);
+    nthreads = n_threads;
+    const int err = pthread_barrier_init(&barry, NULL, nthreads);
+    assert(!err);
+    hta.alloctrees();
+    nslots = (bsizes *)hta.alloc(2 * NBUCKETS, sizeof(au32));
+    sols   =  (proof *)hta.alloc(MAXSOLS, sizeof(proof));
+  }
+  ~equi() {
+    hta.dealloctrees();
+    free(nslots);
+    free(sols);
+    blake2b_free(blake_ctx);
+  }
+  void setstate(const BLAKE2bState *ctx) {
+    blake_ctx = blake2b_clone(ctx);
+    memset(nslots, 0, NBUCKETS * sizeof(au32)); // only nslots[0] needs zeroing
+    nsols = 0;
+  }
+  u32 getslot(const u32 r, const u32 bucketi) {
+#ifdef EQUIHASH_TROMP_ATOMIC
+    return std::atomic_fetch_add_explicit(&nslots[r&1][bucketi], 1U, std::memory_order_relaxed);
+#else
+    return nslots[r&1][bucketi]++;
+#endif
+  }
+  u32 getnslots(const u32 r, const u32 bid) { // SHOULD BE METHOD IN BUCKET STRUCT
+    au32 &nslot = nslots[r&1][bid];
+    const u32 n = min(nslot, NSLOTS);
+    nslot = 0;
+    return n;
+  }
+  void orderindices(u32 *indices, u32 size) {
+    if (indices[0] > indices[size]) {
+      for (u32 i=0; i < size; i++) {
+        const u32 tmp = indices[i];
+        indices[i] = indices[size+i];
+        indices[size+i] = tmp;
+      }
+    }
+  }
+  void listindices0(u32 r, const tree t, u32 *indices) {
+    if (r == 0) {
+      *indices = t.getindex();
+      return;
+    }
+    const bucket1 &buck = hta.trees1[--r/2][t.bucketid()];
+    const u32 size = 1 << r;
+    u32 *indices1 = indices + size;
+    listindices1(r, buck[t.slotid0()].attr, indices);
+    listindices1(r, buck[t.slotid1()].attr, indices1);
+    orderindices(indices, size);
+  }
+  void listindices1(u32 r, const tree t, u32 *indices) {
+    const bucket0 &buck = hta.trees0[--r/2][t.bucketid()];
+    const u32 size = 1 << r;
+    u32 *indices1 = indices + size;
+    listindices0(r, buck[t.slotid0()].attr, indices);
+    listindices0(r, buck[t.slotid1()].attr, indices1);
+    orderindices(indices, size);
+  }
+  void candidate(const tree t) {
+    proof prf;
+    listindices1(WK, t, prf); // assume WK odd
+    qsort(prf, PROOFSIZE, sizeof(u32), &compu32);
+    for (u32 i=1; i<PROOFSIZE; i++)
+      if (prf[i] <= prf[i-1])
+        return;
+#ifdef EQUIHASH_TROMP_ATOMIC
+    u32 soli = std::atomic_fetch_add_explicit(&nsols, 1U, std::memory_order_relaxed);
+#else
+    u32 soli = nsols++;
+#endif
+    if (soli < MAXSOLS)
+      listindices1(WK, t, sols[soli]); // assume WK odd
+  }
+  void showbsizes(u32 r) {
+#if defined(HIST) || defined(SPARK) || defined(LOGSPARK)
+    u32 binsizes[65];
+    memset(binsizes, 0, 65 * sizeof(u32));
+    for (u32 bucketid = 0; bucketid < NBUCKETS; bucketid++) {
+      u32 bsize = min(nslots[r&1][bucketid], NSLOTS) >> (SLOTBITS-6);
+      binsizes[bsize]++;
+    }
+    for (u32 i=0; i < 65; i++) {
+#ifdef HIST
+//      printf(" %d:%d", i, binsizes[i]);
+#else
+#ifdef SPARK
+      u32 sparks = binsizes[i] / SPARKSCALE;
+#else
+      u32 sparks = 0;
+      for (u32 bs = binsizes[i]; bs; bs >>= 1) sparks++;
+      sparks = sparks * 7 / SPARKSCALE;
+#endif
+//      printf("\342\226%c", '\201' + sparks);
+#endif
+    }
+//    printf("\n");
+#endif
+  }
+
+  struct htlayout {
+    htalloc hta;
+    u32 prevhashunits;
+    u32 nexthashunits;
+    u32 dunits;
+    u32 prevbo;
+    u32 nextbo;
+  
+    htlayout(equi *eq, u32 r): hta(eq->hta), prevhashunits(0), dunits(0) {
+      u32 nexthashbytes = hashsize(r);
+      nexthashunits = hashwords(nexthashbytes);
+      prevbo = 0;
+      nextbo = nexthashunits * sizeof(hashunit) - nexthashbytes; // 0-3
+      if (r) {
+        u32 prevhashbytes = hashsize(r-1);
+        prevhashunits = hashwords(prevhashbytes);
+        prevbo = prevhashunits * sizeof(hashunit) - prevhashbytes; // 0-3
+        dunits = prevhashunits - nexthashunits;
+      }
+    }
+    u32 getxhash0(const slot0* pslot) const {
+#if WN == 200 && RESTBITS == 4
+      return pslot->hash->bytes[prevbo] >> 4;
+#elif WN == 200 && RESTBITS == 8
+      return (pslot->hash->bytes[prevbo] & 0xf) << 4 | pslot->hash->bytes[prevbo+1] >> 4;
+#elif WN == 200 && RESTBITS == 9
+      return (pslot->hash->bytes[prevbo] & 0x1f) << 4 | pslot->hash->bytes[prevbo+1] >> 4;
+#elif WN == 144 && RESTBITS == 4
+      return pslot->hash->bytes[prevbo] & 0xf;
+#else
+#error non implemented
+#endif
+    }
+    u32 getxhash1(const slot1* pslot) const {
+#if WN == 200 && RESTBITS == 4
+      return pslot->hash->bytes[prevbo] & 0xf;
+#elif WN == 200 && RESTBITS == 8
+      return pslot->hash->bytes[prevbo];
+#elif WN == 200 && RESTBITS == 9
+      return (pslot->hash->bytes[prevbo]&1) << 8 | pslot->hash->bytes[prevbo+1];
+#elif WN == 144 && RESTBITS == 4
+      return pslot->hash->bytes[prevbo] & 0xf;
+#else
+#error non implemented
+#endif
+    }
+    bool equal(const hashunit *hash0, const hashunit *hash1) const {
+      return hash0[prevhashunits-1].word == hash1[prevhashunits-1].word;
+    }
+  };
+
+  struct collisiondata {
+#ifdef XBITMAP
+#if NSLOTS > 64
+#error can't use XBITMAP with more than 64 slots
+#endif
+    u64 xhashmap[NRESTS];
+    u64 xmap;
+#else
+#if RESTBITS <= 6
+    typedef uchar xslot;
+#else
+    typedef u16 xslot;
+#endif
+    xslot nxhashslots[NRESTS];
+    xslot xhashslots[NRESTS][XFULL];
+    xslot *xx;
+    u32 n0;
+    u32 n1;
+#endif
+    u32 s0;
+
+    void clear() {
+#ifdef XBITMAP
+      memset(xhashmap, 0, NRESTS * sizeof(u64));
+#else
+      memset(nxhashslots, 0, NRESTS * sizeof(xslot));
+#endif
+    }
+    bool addslot(u32 s1, u32 xh) {
+#ifdef XBITMAP
+      xmap = xhashmap[xh];
+      xhashmap[xh] |= (u64)1 << s1;
+      s0 = -1;
+      return true;
+#else
+      n1 = (u32)nxhashslots[xh]++;
+      if (n1 >= XFULL)
+        return false;
+      xx = xhashslots[xh];
+      xx[n1] = s1;
+      n0 = 0;
+      return true;
+#endif
+    }
+    bool nextcollision() const {
+#ifdef XBITMAP
+      return xmap != 0;
+#else
+      return n0 < n1;
+#endif
+    }
+    u32 slot() {
+#ifdef XBITMAP
+      const u32 ffs = __builtin_ffsll(xmap);
+      s0 += ffs; xmap >>= ffs;
+      return s0;
+#else
+      return (u32)xx[n0++];
+#endif
+    }
+  };
+
+  void digit0(const u32 id) {
+    uchar hash[HASHOUT];
+    BLAKE2bState* state;
+    htlayout htl(this, 0);
+    const u32 hashbytes = hashsize(0);
+    for (u32 block = id; block < NBLOCKS; block += nthreads) {
+      state = blake2b_clone(blake_ctx);
+      u32 leb = htole32(block);
+      blake2b_update(state, (uchar *)&leb, sizeof(u32));
+      blake2b_finalize(state, hash, HASHOUT);
+      blake2b_free(state);
+      for (u32 i = 0; i<HASHESPERBLAKE; i++) {
+        const uchar *ph = hash + i * WN/8;
+#if BUCKBITS == 16 && RESTBITS == 4
+        const u32 bucketid = ((u32)ph[0] << 8) | ph[1];
+#elif BUCKBITS == 12 && RESTBITS == 8
+        const u32 bucketid = ((u32)ph[0] << 4) | ph[1] >> 4;
+#elif BUCKBITS == 11 && RESTBITS == 9
+        const u32 bucketid = ((u32)ph[0] << 3) | ph[1] >> 5;
+#elif BUCKBITS == 20 && RESTBITS == 4
+        const u32 bucketid = ((((u32)ph[0] << 8) | ph[1]) << 4) | ph[2] >> 4;
+#elif BUCKBITS == 12 && RESTBITS == 4
+        const u32 bucketid = ((u32)ph[0] << 4) | ph[1] >> 4;
+        const u32 xhash = ph[1] & 0xf;
+#else
+#error not implemented
+#endif
+        const u32 slot = getslot(0, bucketid);
+        if (slot >= NSLOTS) {
+          bfull++;
+          continue;
+        }
+        slot0 &s = hta.trees0[0][bucketid][slot];
+        s.attr = tree(block * HASHESPERBLAKE + i);
+        memcpy(s.hash->bytes+htl.nextbo, ph+WN/8-hashbytes, hashbytes);
+      }
+    }
+  }
+  
+  void digitodd(const u32 r, const u32 id) {
+    htlayout htl(this, r);
+    collisiondata cd;
+    for (u32 bucketid=id; bucketid < NBUCKETS; bucketid += nthreads) {
+      cd.clear();
+      slot0 *buck = htl.hta.trees0[(r-1)/2][bucketid]; // optimize by updating previous buck?!
+      u32 bsize = getnslots(r-1, bucketid);       // optimize by putting bucketsize with block?!
+      for (u32 s1 = 0; s1 < bsize; s1++) {
+        const slot0 *pslot1 = buck + s1;          // optimize by updating previous pslot1?!
+        if (!cd.addslot(s1, htl.getxhash0(pslot1))) {
+          xfull++;
+          continue;
+        }
+        for (; cd.nextcollision(); ) {
+          const u32 s0 = cd.slot();
+          const slot0 *pslot0 = buck + s0;
+          if (htl.equal(pslot0->hash, pslot1->hash)) {
+            hfull++;
+            continue;
+          }
+          u32 xorbucketid;
+          const uchar *bytes0 = pslot0->hash->bytes, *bytes1 = pslot1->hash->bytes;
+#if WN == 200 && BUCKBITS == 12 && RESTBITS == 8
+          xorbucketid = (((u32)(bytes0[htl.prevbo+1] ^ bytes1[htl.prevbo+1]) & 0xf) << 8)
+                             | (bytes0[htl.prevbo+2] ^ bytes1[htl.prevbo+2]);
+#elif WN == 200 && BUCKBITS == 11 && RESTBITS == 9
+          xorbucketid = (((u32)(bytes0[htl.prevbo+1] ^ bytes1[htl.prevbo+1]) & 0xf) << 7)
+                             | (bytes0[htl.prevbo+2] ^ bytes1[htl.prevbo+2]) >> 1;
+#elif WN == 144 && BUCKBITS == 20 && RESTBITS == 4
+          xorbucketid = ((((u32)(bytes0[htl.prevbo+1] ^ bytes1[htl.prevbo+1]) << 8)
+                              | (bytes0[htl.prevbo+2] ^ bytes1[htl.prevbo+2])) << 4)
+                              | (bytes0[htl.prevbo+3] ^ bytes1[htl.prevbo+3]) >> 4;
+#elif WN == 96 && BUCKBITS == 12 && RESTBITS == 4
+          xorbucketid = ((u32)(bytes0[htl.prevbo+1] ^ bytes1[htl.prevbo+1]) << 4)
+                            | (bytes0[htl.prevbo+2] ^ bytes1[htl.prevbo+2]) >> 4;
+#else
+#error not implemented
+#endif
+          const u32 xorslot = getslot(r, xorbucketid);
+          if (xorslot >= NSLOTS) {
+            bfull++;
+            continue;
+          }
+          slot1 &xs = htl.hta.trees1[r/2][xorbucketid][xorslot];
+          xs.attr = tree(bucketid, s0, s1);
+          for (u32 i=htl.dunits; i < htl.prevhashunits; i++)
+            xs.hash[i-htl.dunits].word = pslot0->hash[i].word ^ pslot1->hash[i].word;
+        }
+      }
+    }
+  }
+  
+  void digiteven(const u32 r, const u32 id) {
+    htlayout htl(this, r);
+    collisiondata cd;
+    for (u32 bucketid=id; bucketid < NBUCKETS; bucketid += nthreads) {
+      cd.clear();
+      slot1 *buck = htl.hta.trees1[(r-1)/2][bucketid]; // OPTIMIZE BY UPDATING PREVIOUS
+      u32 bsize = getnslots(r-1, bucketid);
+      for (u32 s1 = 0; s1 < bsize; s1++) {
+        const slot1 *pslot1 = buck + s1;          // OPTIMIZE BY UPDATING PREVIOUS
+        if (!cd.addslot(s1, htl.getxhash1(pslot1))) {
+          xfull++;
+          continue;
+        }
+        for (; cd.nextcollision(); ) {
+          const u32 s0 = cd.slot();
+          const slot1 *pslot0 = buck + s0;
+          if (htl.equal(pslot0->hash, pslot1->hash)) {
+            hfull++;
+            continue;
+          }
+          u32 xorbucketid;
+          const uchar *bytes0 = pslot0->hash->bytes, *bytes1 = pslot1->hash->bytes;
+#if WN == 200 && BUCKBITS == 12 && RESTBITS == 8
+          xorbucketid = ((u32)(bytes0[htl.prevbo+1] ^ bytes1[htl.prevbo+1]) << 4)
+                            | (bytes0[htl.prevbo+2] ^ bytes1[htl.prevbo+2]) >> 4;
+#elif WN == 200 && BUCKBITS == 11 && RESTBITS == 9
+          xorbucketid = ((u32)(bytes0[htl.prevbo+2] ^ bytes1[htl.prevbo+2]) << 3)
+                            | (bytes0[htl.prevbo+3] ^ bytes1[htl.prevbo+3]) >> 5;
+#elif WN == 144 && BUCKBITS == 20 && RESTBITS == 4
+          xorbucketid = ((((u32)(bytes0[htl.prevbo+1] ^ bytes1[htl.prevbo+1]) << 8)
+                              | (bytes0[htl.prevbo+2] ^ bytes1[htl.prevbo+2])) << 4)
+                              | (bytes0[htl.prevbo+3] ^ bytes1[htl.prevbo+3]) >> 4;
+#elif WN == 96 && BUCKBITS == 12 && RESTBITS == 4
+          xorbucketid = ((u32)(bytes0[htl.prevbo+1] ^ bytes1[htl.prevbo+1]) << 4)
+                            | (bytes0[htl.prevbo+2] ^ bytes1[htl.prevbo+2]) >> 4;
+#else
+#error not implemented
+#endif
+          const u32 xorslot = getslot(r, xorbucketid);
+          if (xorslot >= NSLOTS) {
+            bfull++;
+            continue;
+          }
+          slot0 &xs = htl.hta.trees0[r/2][xorbucketid][xorslot];
+          xs.attr = tree(bucketid, s0, s1);
+          for (u32 i=htl.dunits; i < htl.prevhashunits; i++)
+            xs.hash[i-htl.dunits].word = pslot0->hash[i].word ^ pslot1->hash[i].word;
+        }
+      }
+    }
+  }
+  
+  void digitK(const u32 id) {
+    collisiondata cd;
+    htlayout htl(this, WK);
+u32 nc = 0;
+    for (u32 bucketid = id; bucketid < NBUCKETS; bucketid += nthreads) {
+      cd.clear();
+      slot0 *buck = htl.hta.trees0[(WK-1)/2][bucketid];
+      u32 bsize = getnslots(WK-1, bucketid);
+      for (u32 s1 = 0; s1 < bsize; s1++) {
+        const slot0 *pslot1 = buck + s1;
+        if (!cd.addslot(s1, htl.getxhash0(pslot1))) // assume WK odd
+          continue;
+        for (; cd.nextcollision(); ) {
+          const u32 s0 = cd.slot();
+          if (htl.equal(buck[s0].hash, pslot1->hash))
+nc++,       candidate(tree(bucketid, s0, s1));
+        }
+      }
+    }
+//printf(" %d candidates ", nc);
+  }
+};
+
+typedef struct {
+  u32 id;
+  pthread_t thread;
+  equi *eq;
+} thread_ctx;
+
+void barrier(pthread_barrier_t *barry) {
+  const int rc = pthread_barrier_wait(barry);
+  if (rc != 0 && rc != PTHREAD_BARRIER_SERIAL_THREAD) {
+//    printf("Could not wait on barrier\n");
+    pthread_exit(NULL);
+  }
+}
+
+void *worker(void *vp) {
+  thread_ctx *tp = (thread_ctx *)vp;
+  equi *eq = tp->eq;
+
+  if (tp->id == 0)
+//    printf("Digit 0\n");
+  barrier(&eq->barry);
+  eq->digit0(tp->id);
+  barrier(&eq->barry);
+  if (tp->id == 0) {
+    eq->xfull = eq->bfull = eq->hfull = 0;
+    eq->showbsizes(0);
+  }
+  barrier(&eq->barry);
+  for (u32 r = 1; r < WK; r++) {
+    if (tp->id == 0)
+//      printf("Digit %d", r);
+    barrier(&eq->barry);
+    r&1 ? eq->digitodd(r, tp->id) : eq->digiteven(r, tp->id);
+    barrier(&eq->barry);
+    if (tp->id == 0) {
+//      printf(" x%d b%d h%d\n", eq->xfull, eq->bfull, eq->hfull);
+      eq->xfull = eq->bfull = eq->hfull = 0;
+      eq->showbsizes(r);
+    }
+    barrier(&eq->barry);
+  }
+  if (tp->id == 0)
+//    printf("Digit %d\n", WK);
+  eq->digitK(tp->id);
+  barrier(&eq->barry);
+  pthread_exit(NULL);
+  return 0;
+}
+
+#endif // ZCASH_POW_TROMP_EQUI_MINER_H
diff --git a/depend/zcash/src/pow/tromp/osx_barrier.h b/depend/zcash/src/pow/tromp/osx_barrier.h
new file mode 100644
index 000000000..659c40bf5
--- /dev/null
+++ b/depend/zcash/src/pow/tromp/osx_barrier.h
@@ -0,0 +1,75 @@
+#ifndef ZCASH_POW_TROMP_OSX_BARRIER_H
+#define ZCASH_POW_TROMP_OSX_BARRIER_H
+
+#ifdef __APPLE__
+
+#ifndef PTHREAD_BARRIER_H_
+#define PTHREAD_BARRIER_H_
+
+#include <pthread.h>
+#include <errno.h>
+
+typedef int pthread_barrierattr_t;
+#define PTHREAD_BARRIER_SERIAL_THREAD 1
+
+typedef struct
+{
+    pthread_mutex_t mutex;
+    pthread_cond_t cond;
+    int count;
+    int tripCount;
+} pthread_barrier_t;
+
+
+int pthread_barrier_init(pthread_barrier_t *barrier, const pthread_barrierattr_t *attr, unsigned int count)
+{
+    if(count == 0)
+    {
+        errno = EINVAL;
+        return -1;
+    }
+    if(pthread_mutex_init(&barrier->mutex, 0) < 0)
+    {
+        return -1;
+    }
+    if(pthread_cond_init(&barrier->cond, 0) < 0)
+    {
+        pthread_mutex_destroy(&barrier->mutex);
+        return -1;
+    }
+    barrier->tripCount = count;
+    barrier->count = 0;
+
+    return 0;
+}
+
+int pthread_barrier_destroy(pthread_barrier_t *barrier)
+{
+    pthread_cond_destroy(&barrier->cond);
+    pthread_mutex_destroy(&barrier->mutex);
+    return 0;
+}
+
+int pthread_barrier_wait(pthread_barrier_t *barrier)
+{
+    pthread_mutex_lock(&barrier->mutex);
+    ++(barrier->count);
+    if(barrier->count >= barrier->tripCount)
+    {
+        barrier->count = 0;
+        pthread_cond_broadcast(&barrier->cond);
+        pthread_mutex_unlock(&barrier->mutex);
+        return PTHREAD_BARRIER_SERIAL_THREAD;
+    }
+    else
+    {
+        pthread_cond_wait(&barrier->cond, &(barrier->mutex));
+        pthread_mutex_unlock(&barrier->mutex);
+        return 0;
+    }
+}
+
+#endif // PTHREAD_BARRIER_H_
+#endif // __APPLE__
+
+#endif // ZCASH_POW_TROMP_OSX_BARRIER_H
diff --git a/depend/zcash/src/prevector.h b/depend/zcash/src/prevector.h
new file mode 100644
index 000000000..12405245d
--- /dev/null
+++ b/depend/zcash/src/prevector.h
@@ -0,0 +1,487 @@
+// Copyright (c) 2015-2016 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_PREVECTOR_H
+#define BITCOIN_PREVECTOR_H
+
+#include <assert.h>
+#include <stdlib.h>
+#include <stdint.h>
+#include <string.h>
+
+#include <iterator>
+
+#pragma pack(push, 1)
+/** Implements a drop-in replacement for std::vector<T> which stores up to N
+ *  elements directly (without heap allocation). The types Size and Diff are
+ *  used to store element counts, and can be any unsigned + signed type.
+ *
+ *  Storage layout is either:
+ *  - Direct allocation:
+ *    - Size _size: the number of used elements (between 0 and N)
+ *    - T direct[N]: an array of N elements of type T
+ *      (only the first _size are initialized).
+ *  - Indirect allocation:
+ *    - Size _size: the number of used elements plus N + 1
+ *    - Size capacity: the number of allocated elements
+ *    - T* indirect: a pointer to an array of capacity elements of type T
+ *      (only the first _size are initialized).
+ *
+ *  The data type T must be movable by memmove/realloc(). Once we switch to C++,
+ *  move constructors can be used instead.
+ */
+template<unsigned int N, typename T, typename Size = uint32_t, typename Diff = int32_t>
+class prevector {
+public:
+    typedef Size size_type;
+    typedef Diff difference_type;
+    typedef T value_type;
+    typedef value_type& reference;
+    typedef const value_type& const_reference;
+    typedef value_type* pointer;
+    typedef const value_type* const_pointer;
+
+    class iterator {
+        T* ptr;
+    public:
+        typedef Diff difference_type;
+        typedef T value_type;
+        typedef T* pointer;
+        typedef T& reference;
+        typedef std::random_access_iterator_tag iterator_category;
+        iterator(T* ptr_) : ptr(ptr_) {}
+        T& operator*() const { return *ptr; }
+        T* operator->() const { return ptr; }
+        T& operator[](size_type pos) { return ptr[pos]; }
+        const T& operator[](size_type pos) const { return ptr[pos]; }
+        iterator& operator++() { ptr++; return *this; }
+        iterator& operator--() { ptr--; return *this; }
+        iterator operator++(int) { iterator copy(*this); ++(*this); return copy; }
+        iterator operator--(int) { iterator copy(*this); --(*this); return copy; }
+        difference_type friend operator-(iterator a, iterator b) { return (&(*a) - &(*b)); }
+        iterator operator+(size_type n) { return iterator(ptr + n); }
+        iterator& operator+=(size_type n) { ptr += n; return *this; }
+        iterator operator-(size_type n) { return iterator(ptr - n); }
+        iterator& operator-=(size_type n) { ptr -= n; return *this; }
+        bool operator==(iterator x) const { return ptr == x.ptr; }
+        bool operator!=(iterator x) const { return ptr != x.ptr; }
+        bool operator>=(iterator x) const { return ptr >= x.ptr; }
+        bool operator<=(iterator x) const { return ptr <= x.ptr; }
+        bool operator>(iterator x) const { return ptr > x.ptr; }
+        bool operator<(iterator x) const { return ptr < x.ptr; }
+    };
+
+    class reverse_iterator {
+        T* ptr;
+    public:
+        typedef Diff difference_type;
+        typedef T value_type;
+        typedef T* pointer;
+        typedef T& reference;
+        typedef std::bidirectional_iterator_tag iterator_category;
+        reverse_iterator(T* ptr_) : ptr(ptr_) {}
+        T& operator*() { return *ptr; }
+        const T& operator*() const { return *ptr; }
+        T* operator->() { return ptr; }
+        const T* operator->() const { return ptr; }
+        reverse_iterator& operator--() { ptr++; return *this; }
+        reverse_iterator& operator++() { ptr--; return *this; }
+        reverse_iterator operator++(int) { reverse_iterator copy(*this); ++(*this); return copy; }
+        reverse_iterator operator--(int) { reverse_iterator copy(*this); --(*this); return copy; }
+        bool operator==(reverse_iterator x) const { return ptr == x.ptr; }
+        bool operator!=(reverse_iterator x) const { return ptr != x.ptr; }
+    };
+
+    class const_iterator {
+        const T* ptr;
+    public:
+        typedef Diff difference_type;
+        typedef const T value_type;
+        typedef const T* pointer;
+        typedef const T& reference;
+        typedef std::random_access_iterator_tag iterator_category;
+        const_iterator(const T* ptr_) : ptr(ptr_) {}
+        const_iterator(iterator x) : ptr(&(*x)) {}
+        const T& operator*() const { return *ptr; }
+        const T* operator->() const { return ptr; }
+        const T& operator[](size_type pos) const { return ptr[pos]; }
+        const_iterator& operator++() { ptr++; return *this; }
+        const_iterator& operator--() { ptr--; return *this; }
+        const_iterator operator++(int) { const_iterator copy(*this); ++(*this); return copy; }
+        const_iterator operator--(int) { const_iterator copy(*this); --(*this); return copy; }
+        difference_type friend operator-(const_iterator a, const_iterator b) { return (&(*a) - &(*b)); }
+        const_iterator operator+(size_type n) { return const_iterator(ptr + n); }
+        const_iterator& operator+=(size_type n) { ptr += n; return *this; }
+        const_iterator operator-(size_type n) { return const_iterator(ptr - n); }
+        const_iterator& operator-=(size_type n) { ptr -= n; return *this; }
+        bool operator==(const_iterator x) const { return ptr == x.ptr; }
+        bool operator!=(const_iterator x) const { return ptr != x.ptr; }
+        bool operator>=(const_iterator x) const { return ptr >= x.ptr; }
+        bool operator<=(const_iterator x) const { return ptr <= x.ptr; }
+        bool operator>(const_iterator x) const { return ptr > x.ptr; }
+        bool operator<(const_iterator x) const { return ptr < x.ptr; }
+    };
+
+    class const_reverse_iterator {
+        const T* ptr;
+    public:
+        typedef Diff difference_type;
+        typedef const T value_type;
+        typedef const T* pointer;
+        typedef const T& reference;
+        typedef std::bidirectional_iterator_tag iterator_category;
+        const_reverse_iterator(const T* ptr_) : ptr(ptr_) {}
+        const_reverse_iterator(reverse_iterator x) : ptr(&(*x)) {}
+        const T& operator*() const { return *ptr; }
+        const T* operator->() const { return ptr; }
+        const_reverse_iterator& operator--() { ptr++; return *this; }
+        const_reverse_iterator& operator++() { ptr--; return *this; }
+        const_reverse_iterator operator++(int) { const_reverse_iterator copy(*this); ++(*this); return copy; }
+        const_reverse_iterator operator--(int) { const_reverse_iterator copy(*this); --(*this); return copy; }
+        bool operator==(const_reverse_iterator x) const { return ptr == x.ptr; }
+        bool operator!=(const_reverse_iterator x) const { return ptr != x.ptr; }
+    };
+
+private:
+    size_type _size;
+    union {
+        char direct[sizeof(T) * N];
+        struct {
+            size_type capacity;
+            char* indirect;
+        };
+    } _union;
+
+    T* direct_ptr(difference_type pos) { return reinterpret_cast<T*>(_union.direct) + pos; }
+    const T* direct_ptr(difference_type pos) const { return reinterpret_cast<const T*>(_union.direct) + pos; }
+    T* indirect_ptr(difference_type pos) { return reinterpret_cast<T*>(_union.indirect) + pos; }
+    const T* indirect_ptr(difference_type pos) const { return reinterpret_cast<const T*>(_union.indirect) + pos; }
+    bool is_direct() const { return _size <= N; }
+
+    void change_capacity(size_type new_capacity) {
+        if (new_capacity <= N) {
+            if (!is_direct()) {
+                T* indirect = indirect_ptr(0);
+                T* src = indirect;
+                T* dst = direct_ptr(0);
+                memcpy(dst, src, size() * sizeof(T));
+                free(indirect);
+                _size -= N + 1;
+            }
+        } else {
+            if (!is_direct()) {
+                /* FIXME: Because malloc/realloc here won't call new_handler if allocation fails, assert
+                    success. These should instead use an allocator or new/delete so that handlers
+                    are called as necessary, but performance would be slightly degraded by doing so. */
+                _union.indirect = static_cast<char*>(realloc(_union.indirect, ((size_t)sizeof(T)) * new_capacity));
+                assert(_union.indirect);
+                _union.capacity = new_capacity;
+            } else {
+                char* new_indirect = static_cast<char*>(malloc(((size_t)sizeof(T)) * new_capacity));
+                assert(new_indirect);
+                T* src = direct_ptr(0);
+                T* dst = reinterpret_cast<T*>(new_indirect);
+                memcpy(dst, src, size() * sizeof(T));
+                _union.indirect = new_indirect;
+                _union.capacity = new_capacity;
+                _size += N + 1;
+            }
+        }
+    }
+
+    T* item_ptr(difference_type pos) { return is_direct() ? direct_ptr(pos) : indirect_ptr(pos); }
+    const T* item_ptr(difference_type pos) const { return is_direct() ? direct_ptr(pos) : indirect_ptr(pos); }
+
+public:
+    void assign(size_type n, const T& val) {
+        clear();
+        if (capacity() < n) {
+            change_capacity(n);
+        }
+        while (size() < n) {
+            _size++;
+            new(static_cast<void*>(item_ptr(size() - 1))) T(val);
+        }
+    }
+
+    template<typename InputIterator>
+    void assign(InputIterator first, InputIterator last) {
+        size_type n = last - first;
+        clear();
+        if (capacity() < n) {
+            change_capacity(n);
+        }
+        while (first != last) {
+            _size++;
+            new(static_cast<void*>(item_ptr(size() - 1))) T(*first);
+            ++first;
+        }
+    }
+
+    prevector() : _size(0) {}
+
+    explicit prevector(size_type n) : _size(0) {
+        resize(n);
+    }
+
+    explicit prevector(size_type n, const T& val = T()) : _size(0) {
+        change_capacity(n);
+        while (size() < n) {
+            _size++;
+            new(static_cast<void*>(item_ptr(size() - 1))) T(val);
+        }
+    }
+
+    template<typename InputIterator>
+    prevector(InputIterator first, InputIterator last) : _size(0) {
+        size_type n = last - first;
+        change_capacity(n);
+        while (first != last) {
+            _size++;
+            new(static_cast<void*>(item_ptr(size() - 1))) T(*first);
+            ++first;
+        }
+    }
+
+    prevector(const prevector<N, T, Size, Diff>& other) : _size(0) {
+        change_capacity(other.size());
+        const_iterator it = other.begin();
+        while (it != other.end()) {
+            _size++;
+            new(static_cast<void*>(item_ptr(size() - 1))) T(*it);
+            ++it;
+        }
+    }
+
+    prevector& operator=(const prevector<N, T, Size, Diff>& other) {
+        if (&other == this) {
+            return *this;
+        }
+        resize(0);
+        change_capacity(other.size());
+        const_iterator it = other.begin();
+        while (it != other.end()) {
+            _size++;
+            new(static_cast<void*>(item_ptr(size() - 1))) T(*it);
+            ++it;
+        }
+        return *this;
+    }
+
+    size_type size() const {
+        return is_direct() ? _size : _size - N - 1;
+    }
+
+    bool empty() const {
+        return size() == 0;
+    }
+
+    iterator begin() { return iterator(item_ptr(0)); }
+    const_iterator begin() const { return const_iterator(item_ptr(0)); }
+    iterator end() { return iterator(item_ptr(size())); }
+    const_iterator end() const { return const_iterator(item_ptr(size())); }
+
+    reverse_iterator rbegin() { return reverse_iterator(item_ptr(size() - 1)); }
+    const_reverse_iterator rbegin() const { return const_reverse_iterator(item_ptr(size() - 1)); }
+    reverse_iterator rend() { return reverse_iterator(item_ptr(-1)); }
+    const_reverse_iterator rend() const { return const_reverse_iterator(item_ptr(-1)); }
+
+    size_t capacity() const {
+        if (is_direct()) {
+            return N;
+        } else {
+            return _union.capacity;
+        }
+    }
+
+    T& operator[](size_type pos) {
+        return *item_ptr(pos);
+    }
+
+    const T& operator[](size_type pos) const {
+        return *item_ptr(pos);
+    }
+
+    void resize(size_type new_size) {
+        if (size() > new_size) {
+            erase(item_ptr(new_size), end());
+        }
+        if (new_size > capacity()) {
+            change_capacity(new_size);
+        }
+        while (size() < new_size) {
+            _size++;
+            new(static_cast<void*>(item_ptr(size() - 1))) T();
+        }
+    }
+
+    void reserve(size_type new_capacity) {
+        if (new_capacity > capacity()) {
+            change_capacity(new_capacity);
+        }
+    }
+
+    void shrink_to_fit() {
+        change_capacity(size());
+    }
+
+    void clear() {
+        resize(0);
+    }
+
+    iterator insert(iterator pos, const T& value) {
+        size_type p = pos - begin();
+        size_type new_size = size() + 1;
+        if (capacity() < new_size) {
+            change_capacity(new_size + (new_size >> 1));
+        }
+        memmove(item_ptr(p + 1), item_ptr(p), (size() - p) * sizeof(T));
+        _size++;
+        new(static_cast<void*>(item_ptr(p))) T(value);
+        return iterator(item_ptr(p));
+    }
+
+    void insert(iterator pos, size_type count, const T& value) {
+        size_type p = pos - begin();
+        size_type new_size = size() + count;
+        if (capacity() < new_size) {
+            change_capacity(new_size + (new_size >> 1));
+        }
+        memmove(item_ptr(p + count), item_ptr(p), (size() - p) * sizeof(T));
+        _size += count;
+        for (size_type i = 0; i < count; i++) {
+            new(static_cast<void*>(item_ptr(p + i))) T(value);
+        }
+    }
+
+    template<typename InputIterator>
+    void insert(iterator pos, InputIterator first, InputIterator last) {
+        size_type p = pos - begin();
+        difference_type count = last - first;
+        size_type new_size = size() + count;
+        if (capacity() < new_size) {
+            change_capacity(new_size + (new_size >> 1));
+        }
+        memmove(item_ptr(p + count), item_ptr(p), (size() - p) * sizeof(T));
+        _size += count;
+        while (first != last) {
+            new(static_cast<void*>(item_ptr(p))) T(*first);
+            ++p;
+            ++first;
+        }
+    }
+
+    iterator erase(iterator pos) {
+        return erase(pos, pos + 1);
+    }
+
+    iterator erase(iterator first, iterator last) {
+        iterator p = first;
+        char* endp = (char*)&(*end());
+        while (p != last) {
+            (*p).~T();
+            _size--;
+            ++p;
+        }
+        memmove(&(*first), &(*last), endp - ((char*)(&(*last))));
+        return first;
+    }
+
+    void push_back(const T& value) {
+        size_type new_size = size() + 1;
+        if (capacity() < new_size) {
+            change_capacity(new_size + (new_size >> 1));
+        }
+        new(item_ptr(size())) T(value);
+        _size++;
+    }
+
+    void pop_back() {
+        erase(end() - 1, end());
+    }
+
+    T& front() {
+        return *item_ptr(0);
+    }
+
+    const T& front() const {
+        return *item_ptr(0);
+    }
+
+    T& back() {
+        return *item_ptr(size() - 1);
+    }
+
+    const T& back() const {
+        return *item_ptr(size() - 1);
+    }
+
+    void swap(prevector<N, T, Size, Diff>& other) {
+        std::swap(_union, other._union);
+        std::swap(_size, other._size);
+    }
+
+    ~prevector() {
+        clear();
+        if (!is_direct()) {
+            free(_union.indirect);
+            _union.indirect = NULL;
+        }
+    }
+
+    bool operator==(const prevector<N, T, Size, Diff>& other) const {
+        if (other.size() != size()) {
+            return false;
+        }
+        const_iterator b1 = begin();
+        const_iterator b2 = other.begin();
+        const_iterator e1 = end();
+        while (b1 != e1) {
+            if ((*b1) != (*b2)) {
+                return false;
+            }
+            ++b1;
+            ++b2;
+        }
+        return true;
+    }
+
+    bool operator!=(const prevector<N, T, Size, Diff>& other) const {
+        return !(*this == other);
+    }
+
+    bool operator<(const prevector<N, T, Size, Diff>& other) const {
+        if (size() < other.size()) {
+            return true;
+        }
+        if (size() > other.size()) {
+            return false;
+        }
+        const_iterator b1 = begin();
+        const_iterator b2 = other.begin();
+        const_iterator e1 = end();
+        while (b1 != e1) {
+            if ((*b1) < (*b2)) {
+                return true;
+            }
+            if ((*b2) < (*b1)) {
+                return false;
+            }
+            ++b1;
+            ++b2;
+        }
+        return false;
+    }
+
+    size_t allocated_memory() const {
+        if (is_direct()) {
+            return 0;
+        } else {
+            return ((size_t)(sizeof(T))) * _union.capacity;
+        }
+    }
+};
+#pragma pack(pop)
+
+#endif // BITCOIN_PREVECTOR_H
diff --git a/depend/zcash/src/primitives/block.cpp b/depend/zcash/src/primitives/block.cpp
new file mode 100644
index 000000000..fe3f7590f
--- /dev/null
+++ b/depend/zcash/src/primitives/block.cpp
@@ -0,0 +1,198 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "primitives/block.h"
+
+#include "hash.h"
+#include "tinyformat.h"
+#include "utilstrencodings.h"
+#include "crypto/common.h"
+
+#include <algorithm>
+
+const unsigned char ZCASH_AUTH_DATA_HASH_PERSONALIZATION[BLAKE2bPersonalBytes] =
+    {'Z','c','a','s','h','A','u','t','h','D','a','t','H','a','s','h'};
+const unsigned char ZCASH_BLOCK_COMMITMENTS_HASH_PERSONALIZATION[BLAKE2bPersonalBytes] =
+    {'Z','c','a','s','h','B','l','o','c','k','C','o','m','m','i','t'};
+
+uint256 DeriveBlockCommitmentsHash(
+    uint256 hashChainHistoryRoot,
+    uint256 hashAuthDataRoot)
+{
+    // https://zips.z.cash/zip-0244#block-header-changes
+    CBLAKE2bWriter ss(SER_GETHASH, 0, ZCASH_BLOCK_COMMITMENTS_HASH_PERSONALIZATION);
+    ss << hashChainHistoryRoot;
+    ss << hashAuthDataRoot;
+    ss << uint256(); // terminator
+    return ss.GetHash();
+}
+
+uint256 CBlockHeader::GetHash() const
+{
+    return SerializeHash(*this);
+}
+
+uint256 CBlock::BuildMerkleTree(bool* fMutated) const
+{
+    /* WARNING! If you're reading this because you're learning about crypto
+       and/or designing a new system that will use merkle trees, keep in mind
+       that the following merkle tree algorithm has a serious flaw related to
+       duplicate txids, resulting in a vulnerability (CVE-2012-2459).
+
+       The reason is that if the number of hashes in the list at a given time
+       is odd, the last one is duplicated before computing the next level (which
+       is unusual in Merkle trees). This results in certain sequences of
+       transactions leading to the same merkle root. For example, these two
+       trees:
+
+                    A               A
+                  /  \            /   \
+                B     C         B       C
+               / \    |        / \     / \
+              D   E   F       D   E   F   F
+             / \ / \ / \     / \ / \ / \ / \
+             1 2 3 4 5 6     1 2 3 4 5 6 5 6
+
+       for transaction lists [1,2,3,4,5,6] and [1,2,3,4,5,6,5,6] (where 5 and
+       6 are repeated) result in the same root hash A (because the hash of both
+       of (F) and (F,F) is C).
+
+       The vulnerability results from being able to send a block with such a
+       transaction list, with the same merkle root, and the same block hash as
+       the original without duplication, resulting in failed validation. If the
+       receiving node proceeds to mark that block as permanently invalid
+       however, it will fail to accept further unmodified (and thus potentially
+       valid) versions of the same block. We defend against this by detecting
+       the case where we would hash two identical hashes at the end of the list
+       together, and treating that identically to the block having an invalid
+       merkle root. Assuming no double-SHA256 collisions, this will detect all
+       known ways of changing the transactions without affecting the merkle
+       root.
+    */
+    vMerkleTree.clear();
+    vMerkleTree.reserve(vtx.size() * 2 + 16); // Safe upper bound for the number of total nodes.
+    for (std::vector<CTransaction>::const_iterator it(vtx.begin()); it != vtx.end(); ++it)
+        vMerkleTree.push_back(it->GetHash());
+    int j = 0;
+    bool mutated = false;
+    for (int nSize = vtx.size(); nSize > 1; nSize = (nSize + 1) / 2)
+    {
+        for (int i = 0; i < nSize; i += 2)
+        {
+            int i2 = std::min(i+1, nSize-1);
+            if (i2 == i + 1 && i2 + 1 == nSize && vMerkleTree[j+i] == vMerkleTree[j+i2]) {
+                // Two identical hashes at the end of the list at a particular level.
+                mutated = true;
+            }
+            vMerkleTree.push_back(Hash(BEGIN(vMerkleTree[j+i]),  END(vMerkleTree[j+i]),
+                                       BEGIN(vMerkleTree[j+i2]), END(vMerkleTree[j+i2])));
+        }
+        j += nSize;
+    }
+    if (fMutated) {
+        *fMutated = mutated;
+    }
+    return (vMerkleTree.empty() ? uint256() : vMerkleTree.back());
+}
+
+std::vector<uint256> CBlock::GetMerkleBranch(int nIndex) const
+{
+    if (vMerkleTree.empty())
+        BuildMerkleTree();
+    std::vector<uint256> vMerkleBranch;
+    int j = 0;
+    for (int nSize = vtx.size(); nSize > 1; nSize = (nSize + 1) / 2)
+    {
+        int i = std::min(nIndex^1, nSize-1);
+        vMerkleBranch.push_back(vMerkleTree[j+i]);
+        nIndex >>= 1;
+        j += nSize;
+    }
+    return vMerkleBranch;
+}
+
+uint256 CBlock::CheckMerkleBranch(uint256 hash, const std::vector<uint256>& vMerkleBranch, int nIndex)
+{
+    if (nIndex == -1)
+        return uint256();
+    for (std::vector<uint256>::const_iterator it(vMerkleBranch.begin()); it != vMerkleBranch.end(); ++it)
+    {
+        if (nIndex & 1)
+            hash = Hash(BEGIN(*it), END(*it), BEGIN(hash), END(hash));
+        else
+            hash = Hash(BEGIN(hash), END(hash), BEGIN(*it), END(*it));
+        nIndex >>= 1;
+    }
+    return hash;
+}
+
+// Return 0 if x == 0, otherwise the smallest power of 2 greater than or equal to x.
+// Algorithm based on <https://graphics.stanford.edu/~seander/bithacks.html#RoundUpPowerOf2>.
+static uint64_t next_pow2(uint64_t x)
+{
+    x -= 1;
+    x |= (x >> 1);
+    x |= (x >> 2);
+    x |= (x >> 4);
+    x |= (x >> 8);
+    x |= (x >> 16);
+    x |= (x >> 32);
+    return x + 1;
+}
+
+uint256 CBlock::BuildAuthDataMerkleTree() const
+{
+    std::vector<uint256> tree;
+    auto perfectSize = next_pow2(vtx.size());
+    assert((perfectSize & (perfectSize - 1)) == 0);
+    size_t expectedSize = std::max(perfectSize*2, (uint64_t)1) - 1;  // The total number of nodes.
+    tree.reserve(expectedSize);
+
+    // Add the leaves to the tree. v1-v4 transactions will append empty leaves.
+    for (auto &tx : vtx) {
+        tree.push_back(tx.GetAuthDigest());
+    }
+    // Append empty leaves until we get a perfect tree.
+    tree.insert(tree.end(), perfectSize - vtx.size(), uint256());
+    assert(tree.size() == perfectSize);
+
+    int j = 0;
+    for (int layerWidth = perfectSize; layerWidth > 1; layerWidth = layerWidth / 2) {
+        for (int i = 0; i < layerWidth; i += 2) {
+            CBLAKE2bWriter ss(SER_GETHASH, 0, ZCASH_AUTH_DATA_HASH_PERSONALIZATION);
+            ss << tree[j + i];
+            ss << tree[j + i + 1];
+            tree.push_back(ss.GetHash());
+        }
+
+        // Move to the next layer.
+        j += layerWidth;
+    }
+
+    assert(tree.size() == expectedSize);
+    return (tree.empty() ? uint256() : tree.back());
+}
+
+std::string CBlock::ToString() const
+{
+    std::stringstream s;
+    s << strprintf("CBlock(hash=%s, ver=%d, hashPrevBlock=%s, hashMerkleRoot=%s, hashBlockCommitments=%s, nTime=%u, nBits=%08x, nNonce=%s, vtx=%u)\n",
+        GetHash().ToString(),
+        nVersion,
+        hashPrevBlock.ToString(),
+        hashMerkleRoot.ToString(),
+        hashBlockCommitments.ToString(),
+        nTime, nBits, nNonce.ToString(),
+        vtx.size());
+    for (unsigned int i = 0; i < vtx.size(); i++)
+    {
+        s << "  " << vtx[i].ToString() << "\n";
+    }
+    s << "  vMerkleTree: ";
+    for (unsigned int i = 0; i < vMerkleTree.size(); i++)
+        s << " " << vMerkleTree[i].ToString();
+    s << "\n";
+    return s.str();
+}
diff --git a/depend/zcash/src/primitives/block.h b/depend/zcash/src/primitives/block.h
new file mode 100644
index 000000000..da3bd8ce1
--- /dev/null
+++ b/depend/zcash/src/primitives/block.h
@@ -0,0 +1,218 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_PRIMITIVES_BLOCK_H
+#define BITCOIN_PRIMITIVES_BLOCK_H
+
+#include "primitives/transaction.h"
+#include "serialize.h"
+#include "uint256.h"
+
+// Derives the ZIP 244 block commitments hash.
+uint256 DeriveBlockCommitmentsHash(
+    uint256 hashChainHistoryRoot,
+    uint256 hashAuthDataRoot);
+
+/** Nodes collect new transactions into a block, hash them into a hash tree,
+ * and scan through nonce values to make the block's hash satisfy proof-of-work
+ * requirements.  When they solve the proof-of-work, they broadcast the block
+ * to everyone and the block is added to the block chain.  The first transaction
+ * in the block is a special one that creates a new coin owned by the creator
+ * of the block.
+ */
+class CBlockHeader
+{
+public:
+    // header
+    enum : size_t { HEADER_SIZE=4+32+32+32+4+4+32 }; // excluding Equihash solution
+    enum : int32_t { CURRENT_VERSION=4 };
+    int32_t nVersion;
+    uint256 hashPrevBlock;
+    uint256 hashMerkleRoot;
+    uint256 hashBlockCommitments;
+    uint32_t nTime;
+    uint32_t nBits;
+    uint256 nNonce;
+    std::vector<unsigned char> nSolution;
+
+    CBlockHeader()
+    {
+        SetNull();
+    }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(this->nVersion);
+        READWRITE(hashPrevBlock);
+        READWRITE(hashMerkleRoot);
+        READWRITE(hashBlockCommitments);
+        READWRITE(nTime);
+        READWRITE(nBits);
+        READWRITE(nNonce);
+        READWRITE(nSolution);
+    }
+
+    void SetNull()
+    {
+        nVersion = CBlockHeader::CURRENT_VERSION;
+        hashPrevBlock.SetNull();
+        hashMerkleRoot.SetNull();
+        hashBlockCommitments.SetNull();
+        nTime = 0;
+        nBits = 0;
+        nNonce = uint256();
+        nSolution.clear();
+    }
+
+    bool IsNull() const
+    {
+        return (nBits == 0);
+    }
+
+    uint256 GetHash() const;
+
+    int64_t GetBlockTime() const
+    {
+        return (int64_t)nTime;
+    }
+};
+
+
+class CBlock : public CBlockHeader
+{
+public:
+    // network and disk
+    std::vector<CTransaction> vtx;
+
+    // memory only
+    mutable std::vector<uint256> vMerkleTree;
+
+    CBlock()
+    {
+        SetNull();
+    }
+
+    CBlock(const CBlockHeader &header)
+    {
+        SetNull();
+        *((CBlockHeader*)this) = header;
+    }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(*(CBlockHeader*)this);
+        READWRITE(vtx);
+    }
+
+    void SetNull()
+    {
+        CBlockHeader::SetNull();
+        vtx.clear();
+        vMerkleTree.clear();
+    }
+
+    CBlockHeader GetBlockHeader() const
+    {
+        CBlockHeader block;
+        block.nVersion       = nVersion;
+        block.hashPrevBlock  = hashPrevBlock;
+        block.hashMerkleRoot = hashMerkleRoot;
+        block.hashBlockCommitments = hashBlockCommitments;
+        block.nTime          = nTime;
+        block.nBits          = nBits;
+        block.nNonce         = nNonce;
+        block.nSolution      = nSolution;
+        return block;
+    }
+
+    // Build the in-memory merkle tree for this block and return the merkle root.
+    // If non-NULL, *mutated is set to whether mutation was detected in the merkle
+    // tree (a duplication of transactions in the block leading to an identical
+    // merkle root).
+    uint256 BuildMerkleTree(bool* mutated = NULL) const;
+
+    std::vector<uint256> GetMerkleBranch(int nIndex) const;
+    static uint256 CheckMerkleBranch(uint256 hash, const std::vector<uint256>& vMerkleBranch, int nIndex);
+
+    // Build the authorizing data Merkle tree for this block and return its
+    // root.
+    uint256 BuildAuthDataMerkleTree() const;
+
+    std::string ToString() const;
+};
+
+
+/**
+ * Custom serializer for CBlockHeader that omits the nonce and solution, for use
+ * as input to Equihash.
+ */
+class CEquihashInput : private CBlockHeader
+{
+public:
+    CEquihashInput(const CBlockHeader &header)
+    {
+        CBlockHeader::SetNull();
+        *((CBlockHeader*)this) = header;
+    }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(this->nVersion);
+        READWRITE(hashPrevBlock);
+        READWRITE(hashMerkleRoot);
+        READWRITE(hashBlockCommitments);
+        READWRITE(nTime);
+        READWRITE(nBits);
+    }
+};
+
+
+/** Describes a place in the block chain to another node such that if the
+ * other node doesn't have the same branch, it can find a recent common trunk.
+ * The further back it is, the further before the fork it may be.
+ */
+struct CBlockLocator
+{
+    std::vector<uint256> vHave;
+
+    CBlockLocator() {}
+
+    CBlockLocator(const std::vector<uint256>& vHaveIn)
+    {
+        vHave = vHaveIn;
+    }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        int nVersion = s.GetVersion();
+        if (!(s.GetType() & SER_GETHASH))
+            READWRITE(nVersion);
+        READWRITE(vHave);
+    }
+
+    void SetNull()
+    {
+        vHave.clear();
+    }
+
+    bool IsNull() const
+    {
+        return vHave.empty();
+    }
+
+    friend bool operator==(const CBlockLocator& a, const CBlockLocator& b) {
+        return (a.vHave == b.vHave);
+    }
+};
+
+#endif // BITCOIN_PRIMITIVES_BLOCK_H
diff --git a/depend/zcash/src/primitives/orchard.h b/depend/zcash/src/primitives/orchard.h
new file mode 100644
index 000000000..eb3be10b9
--- /dev/null
+++ b/depend/zcash/src/primitives/orchard.h
@@ -0,0 +1,143 @@
+// Copyright (c) 2021 The Zcash Developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_PRIMITIVES_ORCHARD_H
+#define ZCASH_PRIMITIVES_ORCHARD_H
+
+#include "streams.h"
+
+#include <amount.h>
+#include <rust/orchard.h>
+#include <rust/orchard/wallet.h>
+#include "zcash/address/orchard.hpp"
+
+class OrchardMerkleFrontier;
+class OrchardWallet;
+namespace orchard { class UnauthorizedBundle; }
+
+/**
+ * The Orchard component of an authorized transaction.
+ */
+class OrchardBundle
+{
+private:
+    /// An optional Orchard bundle (with `nullptr` corresponding to `None`).
+    /// Memory is allocated by Rust.
+    std::unique_ptr<OrchardBundlePtr, decltype(&orchard_bundle_free)> inner;
+
+    OrchardBundle(OrchardBundlePtr* bundle) : inner(bundle, orchard_bundle_free) {}
+
+    friend class OrchardMerkleFrontier;
+    friend class OrchardWallet;
+    friend class orchard::UnauthorizedBundle;
+public:
+    OrchardBundle() : inner(nullptr, orchard_bundle_free) {}
+
+    OrchardBundle(OrchardBundle&& bundle) : inner(std::move(bundle.inner)) {}
+
+    OrchardBundle(const OrchardBundle& bundle) :
+        inner(orchard_bundle_clone(bundle.inner.get()), orchard_bundle_free) {}
+
+    OrchardBundle& operator=(OrchardBundle&& bundle)
+    {
+        if (this != &bundle) {
+            inner = std::move(bundle.inner);
+        }
+        return *this;
+    }
+
+    OrchardBundle& operator=(const OrchardBundle& bundle)
+    {
+        if (this != &bundle) {
+            inner.reset(orchard_bundle_clone(bundle.inner.get()));
+        }
+        return *this;
+    }
+
+    size_t RecursiveDynamicUsage() const {
+        return orchard_bundle_recursive_dynamic_usage(inner.get());
+    }
+
+    template<typename Stream>
+    void Serialize(Stream& s) const {
+        RustStream rs(s);
+        if (!orchard_bundle_serialize(inner.get(), &rs, RustStream<Stream>::write_callback)) {
+            throw std::ios_base::failure("Failed to serialize v5 Orchard bundle");
+        }
+    }
+
+    template<typename Stream>
+    void Unserialize(Stream& s) {
+        RustStream rs(s);
+        OrchardBundlePtr* bundle;
+        if (!orchard_bundle_parse(&rs, RustStream<Stream>::read_callback, &bundle)) {
+            throw std::ios_base::failure("Failed to parse v5 Orchard bundle");
+        }
+        inner.reset(bundle);
+    }
+
+    /// Returns true if this contains an Orchard bundle, or false if there is no
+    /// Orchard component.
+    bool IsPresent() const { return (bool)inner; }
+
+    /// Returns the net value entering or exiting the Orchard pool as a result of this
+    /// bundle.
+    CAmount GetValueBalance() const {
+        return orchard_bundle_value_balance(inner.get());
+    }
+
+    /// Returns true if this Orchard bundle satisfies the bundle-specific consensus rules,
+    /// or if this does not contain an Orchard bundle.
+    ///
+    /// This does not validate the bundle's signatures; use `QueueSignatureValidation` for
+    /// those checks.
+    bool CheckBundleSpecificConsensusRules() const {
+        return orchard_bundle_validate(inner.get());
+    }
+
+    /// Queues this bundle's signatures for validation.
+    ///
+    /// `txid` must be for the transaction this bundle is within.
+    void QueueSignatureValidation(
+        orchard::AuthValidator& batch, const uint256& txid) const
+    {
+        batch.Queue(inner.get(), txid.begin());
+    }
+
+    const size_t GetNumActions() const {
+        return orchard_bundle_actions_len(inner.get());
+    }
+
+    const std::vector<uint256> GetNullifiers() const {
+        size_t actions_len = orchard_bundle_actions_len(inner.get());
+        std::vector<uint256> result(actions_len);
+        auto nullifiers_ok = orchard_bundle_nullifiers(inner.get(), result.data(), actions_len);
+        assert(nullifiers_ok);
+        return result;
+    }
+
+    const std::optional<uint256> GetAnchor() const {
+        uint256 result;
+        if (orchard_bundle_anchor(inner.get(), result.begin())) {
+            return result;
+        } else {
+            return std::nullopt;
+        }
+    }
+
+    bool OutputsEnabled() const {
+        return orchard_bundle_outputs_enabled(inner.get());
+    }
+
+    bool SpendsEnabled() const {
+        return orchard_bundle_spends_enabled(inner.get());
+    }
+
+    bool CoinbaseOutputsAreValid() const {
+        return orchard_bundle_coinbase_outputs_are_valid(inner.get());
+    }
+};
+
+#endif // ZCASH_PRIMITIVES_ORCHARD_H
+
diff --git a/depend/zcash/src/primitives/transaction.cpp b/depend/zcash/src/primitives/transaction.cpp
new file mode 100644
index 000000000..b8f3358c0
--- /dev/null
+++ b/depend/zcash/src/primitives/transaction.cpp
@@ -0,0 +1,432 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "primitives/transaction.h"
+
+#include "hash.h"
+#include "tinyformat.h"
+#include "utilstrencodings.h"
+
+#include <rust/transaction.h>
+
+SaplingBundle::SaplingBundle(
+    const std::vector<SpendDescription>& vShieldedSpend,
+    const std::vector<OutputDescription>& vShieldedOutput,
+    const CAmount& valueBalanceSapling,
+    const binding_sig_t& bindingSig)
+        : valueBalanceSapling(valueBalanceSapling), bindingSigSapling(bindingSig)
+{
+    for (auto &spend : vShieldedSpend) {
+        vSpendsSapling.emplace_back(spend.cv, spend.nullifier, spend.rk);
+        if (anchorSapling.IsNull()) {
+            anchorSapling = spend.anchor;
+        } else {
+            assert(anchorSapling == spend.anchor);
+        }
+        vSpendProofsSapling.push_back(spend.zkproof);
+        vSpendAuthSigSapling.push_back(spend.spendAuthSig);
+    }
+    for (auto &output : vShieldedOutput) {
+        vOutputsSapling.emplace_back(
+            output.cv,
+            output.cmu,
+            output.ephemeralKey,
+            output.encCiphertext,
+            output.outCiphertext);
+        vOutputProofsSapling.push_back(output.zkproof);
+    }
+}
+
+std::vector<SpendDescription> SaplingBundle::GetV4ShieldedSpend()
+{
+    std::vector<SpendDescription> vShieldedSpend;
+    for (int i = 0; i < vSpendsSapling.size(); i++) {
+        auto spend = vSpendsSapling[i];
+        vShieldedSpend.emplace_back(
+            spend.cv,
+            anchorSapling,
+            spend.nullifier,
+            spend.rk,
+            vSpendProofsSapling[i],
+            vSpendAuthSigSapling[i]);
+    }
+    return vShieldedSpend;
+}
+
+std::vector<OutputDescription> SaplingBundle::GetV4ShieldedOutput()
+{
+    std::vector<OutputDescription> vShieldedOutput;
+    for (int i = 0; i < vOutputsSapling.size(); i++) {
+        auto output = vOutputsSapling[i];
+        vShieldedOutput.emplace_back(
+            output.cv,
+            output.cmu,
+            output.ephemeralKey,
+            output.encCiphertext,
+            output.outCiphertext,
+            vOutputProofsSapling[i]);
+    }
+    return vShieldedOutput;
+}
+
+std::string COutPoint::ToString() const
+{
+    return strprintf("COutPoint(%s, %u)", hash.ToString().substr(0,10), n);
+}
+
+std::string SaplingOutPoint::ToString() const
+{
+    return strprintf("SaplingOutPoint(%s, %u)", hash.ToString().substr(0, 10), n);
+}
+
+std::string OrchardOutPoint::ToString() const
+{
+    return strprintf("OrchardOutPoint(%s, %u)", hash.ToString().substr(0, 10), n);
+}
+
+CTxIn::CTxIn(COutPoint prevoutIn, CScript scriptSigIn, uint32_t nSequenceIn)
+{
+    prevout = prevoutIn;
+    scriptSig = scriptSigIn;
+    nSequence = nSequenceIn;
+}
+
+CTxIn::CTxIn(uint256 hashPrevTx, uint32_t nOut, CScript scriptSigIn, uint32_t nSequenceIn)
+{
+    prevout = COutPoint(hashPrevTx, nOut);
+    scriptSig = scriptSigIn;
+    nSequence = nSequenceIn;
+}
+
+std::string CTxIn::ToString() const
+{
+    std::string str;
+    str += "CTxIn(";
+    str += prevout.ToString();
+    if (prevout.IsNull())
+        str += strprintf(", coinbase %s", HexStr(scriptSig));
+    else
+        str += strprintf(", scriptSig=%s", HexStr(scriptSig).substr(0, 24));
+    if (nSequence != std::numeric_limits<unsigned int>::max())
+        str += strprintf(", nSequence=%u", nSequence);
+    str += ")";
+    return str;
+}
+
+CTxOut::CTxOut(const CAmount& nValueIn, CScript scriptPubKeyIn)
+{
+    nValue = nValueIn;
+    scriptPubKey = scriptPubKeyIn;
+}
+
+uint256 CTxOut::GetHash() const
+{
+    return SerializeHash(*this);
+}
+
+std::string CTxOut::ToString() const
+{
+    return strprintf("CTxOut(nValue=%d.%08d, scriptPubKey=%s)", nValue / COIN, nValue % COIN, HexStr(scriptPubKey).substr(0, 30));
+}
+
+
+CMutableTransaction::CMutableTransaction() : nVersion(CTransaction::SPROUT_MIN_CURRENT_VERSION), fOverwintered(false), nVersionGroupId(0), nExpiryHeight(0), nLockTime(0), valueBalanceSapling(0) {}
+CMutableTransaction::CMutableTransaction(const CTransaction& tx) : nVersion(tx.nVersion), fOverwintered(tx.fOverwintered), nVersionGroupId(tx.nVersionGroupId), nExpiryHeight(tx.nExpiryHeight),
+                                                                   nConsensusBranchId(tx.GetConsensusBranchId()),
+                                                                   vin(tx.vin), vout(tx.vout), nLockTime(tx.nLockTime),
+                                                                   valueBalanceSapling(tx.GetValueBalanceSapling()), vShieldedSpend(tx.vShieldedSpend), vShieldedOutput(tx.vShieldedOutput),
+                                                                   orchardBundle(tx.GetOrchardBundle()),
+                                                                   vJoinSplit(tx.vJoinSplit), joinSplitPubKey(tx.joinSplitPubKey), joinSplitSig(tx.joinSplitSig),
+                                                                   bindingSig(tx.bindingSig)
+{
+}
+
+uint256 CMutableTransaction::GetHash() const
+{
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << *this;
+    uint256 hash;
+    if (!zcash_transaction_digests(
+        reinterpret_cast<const unsigned char*>(ss.data()),
+        ss.size(),
+        hash.begin(),
+        nullptr))
+    {
+        throw std::ios_base::failure("CMutableTransaction::GetHash: Invalid transaction format");
+    }
+    return hash;
+}
+
+uint256 CMutableTransaction::GetAuthDigest() const
+{
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << *this;
+    uint256 authDigest;
+    if (!zcash_transaction_digests(
+        reinterpret_cast<const unsigned char*>(ss.data()),
+        ss.size(),
+        nullptr,
+        authDigest.begin()))
+    {
+        throw std::ios_base::failure("CMutableTransaction::GetAuthDigest: Invalid transaction format");
+    }
+    return authDigest;
+}
+
+void CTransaction::UpdateHash() const
+{
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << *this;
+    if (!zcash_transaction_digests(
+        reinterpret_cast<const unsigned char*>(ss.data()),
+        ss.size(),
+        const_cast<uint256*>(&wtxid.hash)->begin(),
+        const_cast<uint256*>(&wtxid.authDigest)->begin()))
+    {
+        throw std::ios_base::failure("CTransaction::UpdateHash: Invalid transaction format");
+    }
+}
+
+CTransaction::CTransaction() : nVersion(CTransaction::SPROUT_MIN_CURRENT_VERSION),
+                               fOverwintered(false), nVersionGroupId(0), nExpiryHeight(0),
+                               nConsensusBranchId(std::nullopt),
+                               vin(), vout(), nLockTime(0),
+                               valueBalanceSapling(0), vShieldedSpend(), vShieldedOutput(),
+                               orchardBundle(),
+                               vJoinSplit(), joinSplitPubKey(), joinSplitSig(),
+                               bindingSig() { }
+
+CTransaction::CTransaction(const CMutableTransaction &tx) : nVersion(tx.nVersion), fOverwintered(tx.fOverwintered), nVersionGroupId(tx.nVersionGroupId), nExpiryHeight(tx.nExpiryHeight),
+                                                            nConsensusBranchId(tx.nConsensusBranchId),
+                                                            vin(tx.vin), vout(tx.vout), nLockTime(tx.nLockTime),
+                                                            valueBalanceSapling(tx.valueBalanceSapling), vShieldedSpend(tx.vShieldedSpend), vShieldedOutput(tx.vShieldedOutput),
+                                                            orchardBundle(tx.orchardBundle),
+                                                            vJoinSplit(tx.vJoinSplit), joinSplitPubKey(tx.joinSplitPubKey), joinSplitSig(tx.joinSplitSig),
+                                                            bindingSig(tx.bindingSig)
+{
+    UpdateHash();
+}
+
+// Protected constructor which only derived classes can call.
+// For developer testing only.
+CTransaction::CTransaction(
+    const CMutableTransaction &tx,
+    bool evilDeveloperFlag) : nVersion(tx.nVersion), fOverwintered(tx.fOverwintered), nVersionGroupId(tx.nVersionGroupId), nExpiryHeight(tx.nExpiryHeight),
+                              nConsensusBranchId(tx.nConsensusBranchId),
+                              vin(tx.vin), vout(tx.vout), nLockTime(tx.nLockTime),
+                              valueBalanceSapling(tx.valueBalanceSapling), vShieldedSpend(tx.vShieldedSpend), vShieldedOutput(tx.vShieldedOutput),
+                              orchardBundle(tx.orchardBundle),
+                              vJoinSplit(tx.vJoinSplit), joinSplitPubKey(tx.joinSplitPubKey), joinSplitSig(tx.joinSplitSig),
+                              bindingSig(tx.bindingSig)
+{
+    assert(evilDeveloperFlag);
+}
+
+CTransaction::CTransaction(CMutableTransaction &&tx) : nVersion(tx.nVersion),
+                                                       fOverwintered(tx.fOverwintered), nVersionGroupId(tx.nVersionGroupId),
+                                                       nConsensusBranchId(tx.nConsensusBranchId),
+                                                       vin(std::move(tx.vin)), vout(std::move(tx.vout)),
+                                                       nLockTime(tx.nLockTime), nExpiryHeight(tx.nExpiryHeight),
+                                                       valueBalanceSapling(tx.valueBalanceSapling),
+                                                       vShieldedSpend(std::move(tx.vShieldedSpend)), vShieldedOutput(std::move(tx.vShieldedOutput)),
+                                                       orchardBundle(std::move(tx.orchardBundle)),
+                                                       vJoinSplit(std::move(tx.vJoinSplit)),
+                                                       joinSplitPubKey(std::move(tx.joinSplitPubKey)), joinSplitSig(std::move(tx.joinSplitSig)),
+                                                       bindingSig(std::move(tx.bindingSig))
+{
+    UpdateHash();
+}
+
+CTransaction& CTransaction::operator=(const CTransaction &tx) {
+    *const_cast<bool*>(&fOverwintered) = tx.fOverwintered;
+    *const_cast<int*>(&nVersion) = tx.nVersion;
+    *const_cast<uint32_t*>(&nVersionGroupId) = tx.nVersionGroupId;
+    nConsensusBranchId = tx.nConsensusBranchId;
+    *const_cast<std::vector<CTxIn>*>(&vin) = tx.vin;
+    *const_cast<std::vector<CTxOut>*>(&vout) = tx.vout;
+    *const_cast<unsigned int*>(&nLockTime) = tx.nLockTime;
+    *const_cast<uint32_t*>(&nExpiryHeight) = tx.nExpiryHeight;
+    valueBalanceSapling = tx.valueBalanceSapling;
+    *const_cast<std::vector<SpendDescription>*>(&vShieldedSpend) = tx.vShieldedSpend;
+    *const_cast<std::vector<OutputDescription>*>(&vShieldedOutput) = tx.vShieldedOutput;
+    orchardBundle = tx.orchardBundle;
+    *const_cast<std::vector<JSDescription>*>(&vJoinSplit) = tx.vJoinSplit;
+    *const_cast<Ed25519VerificationKey*>(&joinSplitPubKey) = tx.joinSplitPubKey;
+    *const_cast<Ed25519Signature*>(&joinSplitSig) = tx.joinSplitSig;
+    *const_cast<binding_sig_t*>(&bindingSig) = tx.bindingSig;
+    *const_cast<uint256*>(&wtxid.hash) = tx.wtxid.hash;
+    *const_cast<uint256*>(&wtxid.authDigest) = tx.wtxid.authDigest;
+    return *this;
+}
+
+CAmount CTransaction::GetValueOut() const
+{
+    CAmount nValueOut = 0;
+    for (std::vector<CTxOut>::const_iterator it(vout.begin()); it != vout.end(); ++it)
+    {
+        if (!MoneyRange(it->nValue)) {
+            throw std::runtime_error("CTransaction::GetValueOut(): nValue out of range");
+        }
+        nValueOut += it->nValue;
+        if (!MoneyRange(nValueOut)) {
+            throw std::runtime_error("CTransaction::GetValueOut(): nValueOut out of range");
+        }
+    }
+
+    if (valueBalanceSapling <= 0) {
+        // NB: negative valueBalanceSapling "takes" money from the transparent value pool just as outputs do
+        if (valueBalanceSapling < -MAX_MONEY) {
+            throw std::runtime_error("CTransaction::GetValueOut(): valueBalanceSapling out of range");
+        }
+        nValueOut += -valueBalanceSapling;
+
+        if (!MoneyRange(nValueOut)) {
+            throw std::runtime_error("CTransaction::GetValueOut(): value out of range");
+        }
+    }
+
+    auto valueBalanceOrchard = orchardBundle.GetValueBalance();
+    if (valueBalanceOrchard <= 0) {
+        // NB: negative valueBalanceOrchard "takes" money from the transparent value pool just as outputs do
+        if (valueBalanceOrchard < -MAX_MONEY) {
+            throw std::runtime_error("CTransaction::GetValueOut(): valueBalanceOrchard out of range");
+        }
+        nValueOut += -valueBalanceOrchard;
+
+        if (!MoneyRange(nValueOut)) {
+            throw std::runtime_error("CTransaction::GetValueOut(): value out of range");
+        }
+    }
+
+    for (std::vector<JSDescription>::const_iterator it(vJoinSplit.begin()); it != vJoinSplit.end(); ++it)
+    {
+        // NB: vpub_old "takes" money from the transparent value pool just as outputs do
+        if (!MoneyRange(it->vpub_old)) {
+            throw std::runtime_error("CTransaction::GetValueOut(): vpub_old out of range");
+        }
+        nValueOut += it->vpub_old;
+        if (!MoneyRange(nValueOut)) {
+            throw std::runtime_error("CTransaction::GetValueOut(): value out of range");
+        }
+    }
+    return nValueOut;
+}
+
+CAmount CTransaction::GetShieldedValueIn() const
+{
+    CAmount nValue = 0;
+
+    if (valueBalanceSapling >= 0) {
+        // NB: positive valueBalanceSapling "gives" money to the transparent value pool just as inputs do
+        if (valueBalanceSapling > MAX_MONEY) {
+            throw std::runtime_error("CTransaction::GetShieldedValueIn(): valueBalanceSapling out of range");
+        }
+        nValue += valueBalanceSapling;
+
+        if (!MoneyRange(nValue)) {
+            throw std::runtime_error("CTransaction::GetShieldedValueIn(): value out of range");
+        }
+    }
+
+    auto valueBalanceOrchard = orchardBundle.GetValueBalance();
+    if (valueBalanceOrchard >= 0) {
+        // NB: positive valueBalanceOrchard "gives" money to the transparent value pool just as inputs do
+        if (valueBalanceOrchard > MAX_MONEY) {
+            throw std::runtime_error("CTransaction::GetShieldedValueIn(): valueBalanceOrchard out of range");
+        }
+        nValue += valueBalanceOrchard;
+        if (!MoneyRange(nValue)) {
+            throw std::runtime_error("CTransaction::GetShieldedValueIn(): nValue out of range");
+        }
+    }
+
+    for (std::vector<JSDescription>::const_iterator it(vJoinSplit.begin()); it != vJoinSplit.end(); ++it)
+    {
+        // NB: vpub_new "gives" money to the transparent value pool just as inputs do
+        if (!MoneyRange(it->vpub_new)) {
+            throw std::runtime_error("CTransaction::GetShieldedValueIn(): vpub_new out of range");
+        }
+        nValue += it->vpub_new;
+        if (!MoneyRange(nValue)) {
+            throw std::runtime_error("CTransaction::GetShieldedValueIn(): value out of range");
+        }
+    }
+
+    return nValue;
+}
+
+double CTransaction::ComputePriority(double dPriorityInputs, unsigned int nTxSize) const
+{
+    nTxSize = CalculateModifiedSize(nTxSize);
+    if (nTxSize == 0) return 0.0;
+
+    return dPriorityInputs / nTxSize;
+}
+
+unsigned int CTransaction::CalculateModifiedSize(unsigned int nTxSize) const
+{
+    // In order to avoid disincentivizing cleaning up the UTXO set we don't count
+    // the constant overhead for each txin and up to 110 bytes of scriptSig (which
+    // is enough to cover a compressed pubkey p2sh redemption) for priority.
+    // Providing any more cleanup incentive than making additional inputs free would
+    // risk encouraging people to create junk outputs to redeem later.
+    if (nTxSize == 0)
+        nTxSize = ::GetSerializeSize(*this, SER_NETWORK, PROTOCOL_VERSION);
+    for (std::vector<CTxIn>::const_iterator it(vin.begin()); it != vin.end(); ++it)
+    {
+        unsigned int offset = 41U + std::min(110U, (unsigned int)it->scriptSig.size());
+        if (nTxSize > offset)
+            nTxSize -= offset;
+    }
+    return nTxSize;
+}
+
+std::string CTransaction::ToString() const
+{
+    std::string str;
+    if (!fOverwintered) {
+        str += strprintf("CTransaction(hash=%s, ver=%d, vin.size=%u, vout.size=%u, nLockTime=%u)\n",
+            GetHash().ToString().substr(0,10),
+            nVersion,
+            vin.size(),
+            vout.size(),
+            nLockTime);
+    } else if (nVersion >= SAPLING_MIN_TX_VERSION) {
+        str += strprintf("CTransaction(hash=%s, ver=%d, fOverwintered=%d, nVersionGroupId=%08x, vin.size=%u, vout.size=%u, nLockTime=%u, nExpiryHeight=%u, valueBalanceSapling=%u, vSaplingSpend.size=%u, vSaplingOutput.size=%u",
+            GetHash().ToString().substr(0,10),
+            nVersion,
+            fOverwintered,
+            nVersionGroupId,
+            vin.size(),
+            vout.size(),
+            nLockTime,
+            nExpiryHeight,
+            valueBalanceSapling,
+            vShieldedSpend.size(),
+            vShieldedOutput.size());
+        if (nVersion >= ZIP225_MIN_TX_VERSION) {
+            str += strprintf(", nConsensusBranchId=%08x, valueBalanceOrchard=%u, vOrchardAction.size=%u",
+                nConsensusBranchId.value_or(0),
+                orchardBundle.GetValueBalance(),
+                orchardBundle.GetNumActions());
+        }
+        str += ")\n";
+    } else if (nVersion >= 3) {
+        str += strprintf("CTransaction(hash=%s, ver=%d, fOverwintered=%d, nVersionGroupId=%08x, vin.size=%u, vout.size=%u, nLockTime=%u, nExpiryHeight=%u)\n",
+            GetHash().ToString().substr(0,10),
+            nVersion,
+            fOverwintered,
+            nVersionGroupId,
+            vin.size(),
+            vout.size(),
+            nLockTime,
+            nExpiryHeight);
+    }
+    for (unsigned int i = 0; i < vin.size(); i++)
+        str += "    " + vin[i].ToString() + "\n";
+    for (unsigned int i = 0; i < vout.size(); i++)
+        str += "    " + vout[i].ToString() + "\n";
+    return str;
+}
diff --git a/depend/zcash/src/primitives/transaction.h b/depend/zcash/src/primitives/transaction.h
new file mode 100644
index 000000000..94a8eb495
--- /dev/null
+++ b/depend/zcash/src/primitives/transaction.h
@@ -0,0 +1,1147 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_PRIMITIVES_TRANSACTION_H
+#define BITCOIN_PRIMITIVES_TRANSACTION_H
+
+#include "amount.h"
+#include "script/script.h"
+#include "serialize.h"
+#include "streams.h"
+#include "uint256.h"
+#include "consensus/consensus.h"
+#include "consensus/params.h"
+#include "consensus/upgrades.h"
+
+#include <array>
+#include <variant>
+
+#include "zcash/NoteEncryption.hpp"
+#include "zcash/Zcash.h"
+#include "zcash/Proof.hpp"
+
+#include <rust/ed25519/types.h>
+#include <primitives/orchard.h>
+
+// Overwinter transaction version group id
+static constexpr uint32_t OVERWINTER_VERSION_GROUP_ID = 0x03C48270;
+static_assert(OVERWINTER_VERSION_GROUP_ID != 0, "version group id must be non-zero as specified in ZIP 202");
+
+// Overwinter transaction version
+static const int32_t OVERWINTER_TX_VERSION = 3;
+static_assert(OVERWINTER_TX_VERSION >= OVERWINTER_MIN_TX_VERSION,
+    "Overwinter tx version must not be lower than minimum");
+static_assert(OVERWINTER_TX_VERSION <= OVERWINTER_MAX_TX_VERSION,
+    "Overwinter tx version must not be higher than maximum");
+
+// Sapling transaction version group id
+static constexpr uint32_t SAPLING_VERSION_GROUP_ID = 0x892F2085;
+static_assert(SAPLING_VERSION_GROUP_ID != 0, "version group id must be non-zero as specified in ZIP 202");
+
+// Sapling transaction version
+static const int32_t SAPLING_TX_VERSION = 4;
+static_assert(SAPLING_TX_VERSION >= SAPLING_MIN_TX_VERSION,
+    "Sapling tx version must not be lower than minimum");
+static_assert(SAPLING_TX_VERSION <= SAPLING_MAX_TX_VERSION,
+    "Sapling tx version must not be higher than maximum");
+
+// ZIP225 transaction version group id
+// (defined in section 7.1 of the protocol spec)
+static constexpr uint32_t ZIP225_VERSION_GROUP_ID = 0x26A7270A;
+static_assert(ZIP225_VERSION_GROUP_ID != 0, "version group id must be non-zero as specified in ZIP 202");
+
+// ZIP225 transaction version
+static const int32_t ZIP225_TX_VERSION = 5;
+static_assert(ZIP225_TX_VERSION >= ZIP225_MIN_TX_VERSION,
+    "ZIP225 tx version must not be lower than minimum");
+static_assert(ZIP225_TX_VERSION <= ZIP225_MAX_TX_VERSION,
+    "ZIP225 tx version must not be higher than maximum");
+
+// Future transaction version group id
+static constexpr uint32_t ZFUTURE_VERSION_GROUP_ID = 0xFFFFFFFF;
+static_assert(ZFUTURE_VERSION_GROUP_ID != 0, "version group id must be non-zero as specified in ZIP 202");
+
+// Future transaction version. This value must only be used
+// in integration-testing contexts.
+static const int32_t ZFUTURE_TX_VERSION = 0x0000FFFF;
+
+struct TxVersionInfo {
+    bool fOverwintered;
+    uint32_t nVersionGroupId;
+    int32_t nVersion;
+};
+
+/**
+ * Returns the current transaction version and version group id,
+ * based upon the specified activation height and active features.
+ */
+TxVersionInfo CurrentTxVersionInfo(
+    const Consensus::Params& consensus, int nHeight, bool requireSprout);
+
+struct TxParams {
+    unsigned int expiryDelta;
+};
+
+// These constants are defined in the protocol § 7.1:
+// https://zips.z.cash/protocol/protocol.pdf#txnencoding
+#define OUTPUTDESCRIPTION_SIZE 948
+#define SPENDDESCRIPTION_SIZE 384
+static inline size_t JOINSPLIT_SIZE(int transactionVersion) {
+    return transactionVersion >= SAPLING_TX_VERSION ? 1698 : 1802;
+}
+
+/**
+ * The storage format for Sapling Spend descriptions in v5 transactions.
+ */
+class SpendDescriptionV5
+{
+public:
+    uint256 cv;                    //!< A value commitment to the value of the input note.
+    uint256 nullifier;             //!< The nullifier of the input note.
+    uint256 rk;                    //!< The randomized public key for spendAuthSig.
+
+    SpendDescriptionV5() { }
+
+    SpendDescriptionV5(uint256 cv, uint256 nullifier, uint256 rk)
+        : cv(cv), nullifier(nullifier), rk(rk) { }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(cv);
+        READWRITE(nullifier);
+        READWRITE(rk);
+    }
+};
+
+/**
+ * A shielded input to a transaction. It contains data that describes a Spend transfer.
+ */
+class SpendDescription : public SpendDescriptionV5
+{
+public:
+    typedef std::array<unsigned char, 64> spend_auth_sig_t;
+
+    uint256 anchor;                //!< A Merkle root of the Sapling note commitment tree at some block height in the past.
+    libzcash::GrothProof zkproof;  //!< A zero-knowledge proof using the spend circuit.
+    spend_auth_sig_t spendAuthSig; //!< A signature authorizing this spend.
+
+    SpendDescription() { }
+
+    SpendDescription(
+        uint256 cv,
+        uint256 anchor,
+        uint256 nullifier,
+        uint256 rk,
+        libzcash::GrothProof zkproof,
+        spend_auth_sig_t spendAuthSig)
+        : SpendDescriptionV5(cv, nullifier, rk), anchor(anchor), zkproof(zkproof), spendAuthSig(spendAuthSig) { }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(cv);
+        READWRITE(anchor);
+        READWRITE(nullifier);
+        READWRITE(rk);
+        READWRITE(zkproof);
+        READWRITE(spendAuthSig);
+    }
+
+    friend bool operator==(const SpendDescription& a, const SpendDescription& b)
+    {
+        return (
+            a.cv == b.cv &&
+            a.anchor == b.anchor &&
+            a.nullifier == b.nullifier &&
+            a.rk == b.rk &&
+            a.zkproof == b.zkproof &&
+            a.spendAuthSig == b.spendAuthSig
+            );
+    }
+
+    friend bool operator!=(const SpendDescription& a, const SpendDescription& b)
+    {
+        return !(a == b);
+    }
+};
+
+/**
+ * The storage format for Sapling Output descriptions in v5 transactions.
+ */
+class OutputDescriptionV5
+{
+public:
+    uint256 cv;                     //!< A value commitment to the value of the output note.
+    uint256 cmu;                     //!< The u-coordinate of the note commitment for the output note.
+    uint256 ephemeralKey;           //!< A Jubjub public key.
+    libzcash::SaplingEncCiphertext encCiphertext; //!< A ciphertext component for the encrypted output note.
+    libzcash::SaplingOutCiphertext outCiphertext; //!< A ciphertext component for the encrypted output note.
+
+    OutputDescriptionV5() { }
+
+    OutputDescriptionV5(
+        uint256 cv,
+        uint256 cmu,
+        uint256 ephemeralKey,
+        libzcash::SaplingEncCiphertext encCiphertext,
+        libzcash::SaplingOutCiphertext outCiphertext)
+        : cv(cv), cmu(cmu), ephemeralKey(ephemeralKey), encCiphertext(encCiphertext), outCiphertext(outCiphertext) { }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(cv);
+        READWRITE(cmu);
+        READWRITE(ephemeralKey);
+        READWRITE(encCiphertext);
+        READWRITE(outCiphertext);
+    }
+};
+
+/**
+ * A shielded output to a transaction. It contains data that describes an Output transfer.
+ */
+class OutputDescription : public OutputDescriptionV5
+{
+public:
+    libzcash::GrothProof zkproof;   //!< A zero-knowledge proof using the output circuit.
+
+    OutputDescription() { }
+
+    OutputDescription(
+        uint256 cv,
+        uint256 cmu,
+        uint256 ephemeralKey,
+        libzcash::SaplingEncCiphertext encCiphertext,
+        libzcash::SaplingOutCiphertext outCiphertext,
+        libzcash::GrothProof zkproof)
+        : OutputDescriptionV5(cv, cmu, ephemeralKey, encCiphertext, outCiphertext), zkproof(zkproof) { }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        OutputDescriptionV5::SerializationOp(s, ser_action);
+        READWRITE(zkproof);
+    }
+
+    friend bool operator==(const OutputDescription& a, const OutputDescription& b)
+    {
+        return (
+            a.cv == b.cv &&
+            a.cmu == b.cmu &&
+            a.ephemeralKey == b.ephemeralKey &&
+            a.encCiphertext == b.encCiphertext &&
+            a.outCiphertext == b.outCiphertext &&
+            a.zkproof == b.zkproof
+            );
+    }
+
+    friend bool operator!=(const OutputDescription& a, const OutputDescription& b)
+    {
+        return !(a == b);
+    }
+};
+
+/**
+ * The Sapling component of a v5 transaction.
+ */
+class SaplingBundle
+{
+private:
+    typedef std::array<unsigned char, 64> binding_sig_t;
+
+    std::vector<SpendDescriptionV5> vSpendsSapling;
+    std::vector<OutputDescriptionV5> vOutputsSapling;
+    uint256 anchorSapling;
+    std::vector<libzcash::GrothProof> vSpendProofsSapling;
+    std::vector<SpendDescription::spend_auth_sig_t> vSpendAuthSigSapling;
+    std::vector<libzcash::GrothProof> vOutputProofsSapling;
+
+public:
+    CAmount valueBalanceSapling;
+    binding_sig_t bindingSigSapling = {{0}};
+
+    SaplingBundle() : valueBalanceSapling(0) {}
+
+    SaplingBundle(
+        const std::vector<SpendDescription>& vShieldedSpend,
+        const std::vector<OutputDescription>& vShieldedOutput,
+        const CAmount& valueBalance,
+        const binding_sig_t& bindingSig);
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(vSpendsSapling);
+        READWRITE(vOutputsSapling);
+
+        bool hasSapling = !(vSpendsSapling.empty() && vOutputsSapling.empty());
+
+        if (hasSapling) {
+            READWRITE(valueBalanceSapling);
+        }
+        if (!vSpendsSapling.empty()) {
+            READWRITE(anchorSapling);
+        }
+        if (ser_action.ForRead()) {
+            for (auto &spend : vSpendsSapling) {
+                libzcash::GrothProof zkproof;
+                READWRITE(zkproof);
+                vSpendProofsSapling.push_back(zkproof);
+            }
+            for (auto &spend : vSpendsSapling) {
+                SpendDescription::spend_auth_sig_t spendAuthSig;
+                READWRITE(spendAuthSig);
+                vSpendAuthSigSapling.push_back(spendAuthSig);
+            }
+            for (auto &output : vOutputsSapling) {
+                libzcash::GrothProof zkproof;
+                READWRITE(zkproof);
+                vOutputProofsSapling.push_back(zkproof);
+            }
+        } else {
+            for (auto &zkproof : vSpendProofsSapling) {
+                READWRITE(zkproof);
+            }
+            for (auto &spendAuthSig : vSpendAuthSigSapling) {
+                READWRITE(spendAuthSig);
+            }
+            for (auto &zkproof : vOutputProofsSapling) {
+                READWRITE(zkproof);
+            }
+        }
+        if (hasSapling) {
+            READWRITE(bindingSigSapling);
+        }
+    }
+
+    std::vector<SpendDescription> GetV4ShieldedSpend();
+    std::vector<OutputDescription> GetV4ShieldedOutput();
+};
+
+template <typename Stream>
+class SproutProofSerializer
+{
+    Stream& s;
+    bool useGroth;
+
+public:
+    SproutProofSerializer(Stream& s, bool useGroth) : s(s), useGroth(useGroth) {}
+
+    void operator()(const libzcash::PHGRProof& proof) const
+    {
+        if (useGroth) {
+            throw std::ios_base::failure("Invalid Sprout proof for transaction format (expected GrothProof, found PHGRProof)");
+        }
+        ::Serialize(s, proof);
+    }
+
+    void operator()(const libzcash::GrothProof& proof) const
+    {
+        if (!useGroth) {
+            throw std::ios_base::failure("Invalid Sprout proof for transaction format (expected PHGRProof, found GrothProof)");
+        }
+        ::Serialize(s, proof);
+    }
+};
+
+template<typename Stream, typename T>
+inline void SerReadWriteSproutProof(Stream& s, const T& proof, bool useGroth, CSerActionSerialize ser_action)
+{
+    auto ps = SproutProofSerializer<Stream>(s, useGroth);
+    std::visit(ps, proof);
+}
+
+template<typename Stream, typename T>
+inline void SerReadWriteSproutProof(Stream& s, T& proof, bool useGroth, CSerActionUnserialize ser_action)
+{
+    if (useGroth) {
+        libzcash::GrothProof grothProof;
+        ::Unserialize(s, grothProof);
+        proof = grothProof;
+    } else {
+        libzcash::PHGRProof pghrProof;
+        ::Unserialize(s, pghrProof);
+        proof = pghrProof;
+    }
+}
+
+class JSDescription
+{
+public:
+    // These values 'enter from' and 'exit to' the value
+    // pool, respectively.
+    CAmount vpub_old{0};
+    CAmount vpub_new{0};
+
+    // JoinSplits are always anchored to a root in the note
+    // commitment tree at some point in the blockchain
+    // history or in the history of the current
+    // transaction.
+    uint256 anchor;
+
+    // Nullifiers are used to prevent double-spends. They
+    // are derived from the secrets placed in the note
+    // and the secret spend-authority key known by the
+    // spender.
+    std::array<uint256, ZC_NUM_JS_INPUTS> nullifiers;
+
+    // Note commitments are introduced into the commitment
+    // tree, blinding the public about the values and
+    // destinations involved in the JoinSplit. The presence of
+    // a commitment in the note commitment tree is required
+    // to spend it.
+    std::array<uint256, ZC_NUM_JS_OUTPUTS> commitments;
+
+    // Ephemeral key
+    uint256 ephemeralKey;
+
+    // Ciphertexts
+    // These contain trapdoors, values and other information
+    // that the recipient needs, including a memo field. It
+    // is encrypted using the scheme implemented in crypto/NoteEncryption.cpp
+    std::array<ZCNoteEncryption::Ciphertext, ZC_NUM_JS_OUTPUTS> ciphertexts = {{ {{0}} }};
+
+    // Random seed
+    uint256 randomSeed;
+
+    // MACs
+    // The verification of the JoinSplit requires these MACs
+    // to be provided as an input.
+    std::array<uint256, ZC_NUM_JS_INPUTS> macs;
+
+    // JoinSplit proof
+    // This is a zk-SNARK which ensures that this JoinSplit is valid.
+    libzcash::SproutProof proof;
+
+    JSDescription(): vpub_old(0), vpub_new(0) { }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        // nVersion is set by CTransaction and CMutableTransaction to
+        // (tx.fOverwintered << 31) | tx.nVersion
+        bool fOverwintered = s.GetVersion() >> 31;
+        int32_t txVersion = s.GetVersion() & 0x7FFFFFFF;
+        bool useGroth = fOverwintered && txVersion >= SAPLING_TX_VERSION;
+
+        READWRITE(vpub_old);
+        READWRITE(vpub_new);
+        READWRITE(anchor);
+        READWRITE(nullifiers);
+        READWRITE(commitments);
+        READWRITE(ephemeralKey);
+        READWRITE(randomSeed);
+        READWRITE(macs);
+        ::SerReadWriteSproutProof(s, proof, useGroth, ser_action);
+        READWRITE(ciphertexts);
+    }
+
+    friend bool operator==(const JSDescription& a, const JSDescription& b)
+    {
+        return (
+            a.vpub_old == b.vpub_old &&
+            a.vpub_new == b.vpub_new &&
+            a.anchor == b.anchor &&
+            a.nullifiers == b.nullifiers &&
+            a.commitments == b.commitments &&
+            a.ephemeralKey == b.ephemeralKey &&
+            a.ciphertexts == b.ciphertexts &&
+            a.randomSeed == b.randomSeed &&
+            a.macs == b.macs &&
+            a.proof == b.proof
+            );
+    }
+
+    friend bool operator!=(const JSDescription& a, const JSDescription& b)
+    {
+        return !(a == b);
+    }
+};
+
+class BaseOutPoint
+{
+public:
+    uint256 hash;
+    uint32_t n;
+
+    BaseOutPoint() { SetNull(); }
+    BaseOutPoint(uint256 hashIn, uint32_t nIn) { hash = hashIn; n = nIn; }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(hash);
+        READWRITE(n);
+    }
+
+    void SetNull() { hash.SetNull(); n = (uint32_t) -1; }
+    bool IsNull() const { return (hash.IsNull() && n == (uint32_t) -1); }
+
+    friend bool operator<(const BaseOutPoint& a, const BaseOutPoint& b)
+    {
+        return (a.hash < b.hash || (a.hash == b.hash && a.n < b.n));
+    }
+
+    friend bool operator==(const BaseOutPoint& a, const BaseOutPoint& b)
+    {
+        return (a.hash == b.hash && a.n == b.n);
+    }
+
+    friend bool operator!=(const BaseOutPoint& a, const BaseOutPoint& b)
+    {
+        return !(a == b);
+    }
+};
+
+/** An outpoint - a combination of a transaction hash and an index n into its vout */
+class COutPoint : public BaseOutPoint
+{
+public:
+    COutPoint() : BaseOutPoint() {};
+    COutPoint(uint256 hashIn, uint32_t nIn) : BaseOutPoint(hashIn, nIn) {};
+    std::string ToString() const;
+};
+
+/** An outpoint - a combination of a transaction hash and an index n into its sapling
+ * output description (vShieldedOutput) */
+class SaplingOutPoint : public BaseOutPoint
+{
+public:
+    SaplingOutPoint() : BaseOutPoint() {};
+    SaplingOutPoint(uint256 hashIn, uint32_t nIn) : BaseOutPoint(hashIn, nIn) {};
+    std::string ToString() const;
+};
+
+/** An outpoint - a combination of a txid and an index n into its orchard
+ * actions */
+class OrchardOutPoint : public BaseOutPoint
+{
+public:
+    OrchardOutPoint() : BaseOutPoint() {};
+    OrchardOutPoint(uint256 hashIn, uint32_t nIn) : BaseOutPoint(hashIn, nIn) {};
+    std::string ToString() const;
+};
+
+/** An input of a transaction.  It contains the location of the previous
+ * transaction's output that it claims and a signature that matches the
+ * output's public key.
+ */
+class CTxIn
+{
+public:
+    COutPoint prevout;
+    CScript scriptSig;
+    // The only use of nSequence (via IsFinal) is in TransactionSignatureChecker::CheckLockTime
+    // It disables the nLockTime feature when set to maxint.
+    uint32_t nSequence;
+
+    CTxIn()
+    {
+        nSequence = std::numeric_limits<unsigned int>::max();
+    }
+
+    explicit CTxIn(COutPoint prevoutIn, CScript scriptSigIn=CScript(), uint32_t nSequenceIn=std::numeric_limits<unsigned int>::max());
+    CTxIn(uint256 hashPrevTx, uint32_t nOut, CScript scriptSigIn=CScript(), uint32_t nSequenceIn=std::numeric_limits<uint32_t>::max());
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(prevout);
+        READWRITE(*(CScriptBase*)(&scriptSig));
+        READWRITE(nSequence);
+    }
+
+    bool IsFinal() const
+    {
+        return (nSequence == std::numeric_limits<uint32_t>::max());
+    }
+
+    friend bool operator==(const CTxIn& a, const CTxIn& b)
+    {
+        return (a.prevout   == b.prevout &&
+                a.scriptSig == b.scriptSig &&
+                a.nSequence == b.nSequence);
+    }
+
+    friend bool operator!=(const CTxIn& a, const CTxIn& b)
+    {
+        return !(a == b);
+    }
+
+    const COutPoint& GetOutPoint() const {
+        return prevout;
+    }
+
+    std::string ToString() const;
+};
+
+/** An output of a transaction.  It contains the public key that the next input
+ * must be able to sign with to claim it.
+ */
+class CTxOut
+{
+public:
+    CAmount nValue;
+    CScript scriptPubKey;
+
+    CTxOut()
+    {
+        SetNull();
+    }
+
+    CTxOut(const CAmount& nValueIn, CScript scriptPubKeyIn);
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(nValue);
+        READWRITE(*(CScriptBase*)(&scriptPubKey));
+    }
+
+    void SetNull()
+    {
+        nValue = -1;
+        scriptPubKey.clear();
+    }
+
+    bool IsNull() const
+    {
+        return (nValue == -1);
+    }
+
+    uint256 GetHash() const;
+
+    CAmount GetDustThreshold(const CFeeRate &minRelayTxFee) const
+    {
+        // "Dust" is defined in terms of CTransaction::minRelayTxFee,
+        // which has units satoshis-per-kilobyte.
+        // If you'd pay more than 1/3 in fees
+        // to spend something, then we consider it dust.
+        // A typical spendable txout is 34 bytes big, and will
+        // need a CTxIn of at least 148 bytes to spend:
+        // so dust is a spendable txout less than
+        // 54*minRelayTxFee/1000 (in satoshis)
+        if (scriptPubKey.IsUnspendable())
+            return 0;
+
+        size_t nSize = GetSerializeSize(*this, SER_DISK, 0) + 148u;
+        return 3*minRelayTxFee.GetFee(nSize);
+    }
+
+    bool IsDust(const CFeeRate &minRelayTxFee) const
+    {
+        return (nValue < GetDustThreshold(minRelayTxFee));
+    }
+
+    friend bool operator==(const CTxOut& a, const CTxOut& b)
+    {
+        return (a.nValue       == b.nValue &&
+                a.scriptPubKey == b.scriptPubKey);
+    }
+
+    friend bool operator!=(const CTxOut& a, const CTxOut& b)
+    {
+        return !(a == b);
+    }
+
+    std::string ToString() const;
+};
+
+struct WTxId
+{
+    const uint256 hash;
+    const uint256 authDigest;
+
+    WTxId() :
+        authDigest(LEGACY_TX_AUTH_DIGEST) {}
+
+    WTxId(const uint256& hashIn, const uint256& authDigestIn) :
+        hash(hashIn), authDigest(authDigestIn) {}
+
+    const std::vector<unsigned char> ToBytes() const {
+        std::vector<unsigned char> vData(hash.begin(), hash.end());
+        vData.insert(vData.end(), authDigest.begin(), authDigest.end());
+        return vData;
+    }
+
+    friend bool operator<(const WTxId& a, const WTxId& b)
+    {
+        return (a.hash < b.hash ||
+            (a.hash == b.hash && a.authDigest < b.authDigest));
+    }
+
+    friend bool operator==(const WTxId& a, const WTxId& b)
+    {
+        return a.hash == b.hash && a.authDigest == b.authDigest;
+    }
+
+    friend bool operator!=(const WTxId& a, const WTxId& b)
+    {
+        return a.hash != b.hash || a.authDigest != b.authDigest;
+    }
+};
+
+struct CMutableTransaction;
+
+/** The basic transaction that is broadcasted on the network and contained in
+ * blocks.  A transaction can contain multiple inputs and outputs.
+ */
+class CTransaction
+{
+private:
+    /// The consensus branch ID that this transaction commits to.
+    /// Serialized from v5 onwards.
+    std::optional<uint32_t> nConsensusBranchId;
+    CAmount valueBalanceSapling;
+    OrchardBundle orchardBundle;
+
+    /** Memory only. */
+    const WTxId wtxid;
+    void UpdateHash() const;
+
+protected:
+    /** Developer testing only.  Set evilDeveloperFlag to true.
+     * Convert a CMutableTransaction into a CTransaction without invoking UpdateHash()
+     */
+    CTransaction(const CMutableTransaction &tx, bool evilDeveloperFlag);
+
+public:
+    typedef std::array<unsigned char, 64> joinsplit_sig_t;
+    typedef std::array<unsigned char, 64> binding_sig_t;
+
+    // Transactions that include a list of JoinSplits are >= version 2.
+    static const int32_t SPROUT_MIN_CURRENT_VERSION = 1;
+    static const int32_t SPROUT_MAX_CURRENT_VERSION = 2;
+    static const int32_t OVERWINTER_MIN_CURRENT_VERSION = 3;
+    static const int32_t OVERWINTER_MAX_CURRENT_VERSION = 3;
+    static const int32_t SAPLING_MIN_CURRENT_VERSION = 4;
+    static const int32_t SAPLING_MAX_CURRENT_VERSION = 4;
+    static const int32_t NU5_MIN_CURRENT_VERSION = 4;
+    static const int32_t NU5_MAX_CURRENT_VERSION = 5;
+
+    static_assert(SPROUT_MIN_CURRENT_VERSION >= SPROUT_MIN_TX_VERSION,
+                  "standard rule for tx version should be consistent with network rule");
+
+    static_assert(OVERWINTER_MIN_CURRENT_VERSION >= OVERWINTER_MIN_TX_VERSION,
+                  "standard rule for tx version should be consistent with network rule");
+
+    static_assert( (OVERWINTER_MAX_CURRENT_VERSION <= OVERWINTER_MAX_TX_VERSION &&
+                    OVERWINTER_MAX_CURRENT_VERSION >= OVERWINTER_MIN_CURRENT_VERSION),
+                  "standard rule for tx version should be consistent with network rule");
+
+    static_assert(SAPLING_MIN_CURRENT_VERSION >= SAPLING_MIN_TX_VERSION,
+                  "standard rule for tx version should be consistent with network rule");
+
+    static_assert( (SAPLING_MAX_CURRENT_VERSION <= SAPLING_MAX_TX_VERSION &&
+                    SAPLING_MAX_CURRENT_VERSION >= SAPLING_MIN_CURRENT_VERSION),
+                  "standard rule for tx version should be consistent with network rule");
+
+    static_assert(NU5_MIN_CURRENT_VERSION >= SAPLING_MIN_TX_VERSION,
+                  "standard rule for tx version should be consistent with network rule");
+
+    static_assert( (NU5_MAX_CURRENT_VERSION <= ZIP225_MAX_TX_VERSION &&
+                    NU5_MAX_CURRENT_VERSION >= NU5_MIN_CURRENT_VERSION),
+                  "standard rule for tx version should be consistent with network rule");
+
+    // The local variables are made const to prevent unintended modification
+    // without updating the cached hash value. However, CTransaction is not
+    // actually immutable; deserialization and assignment are implemented,
+    // and bypass the constness. This is safe, as they update the entire
+    // structure, including the hash.
+    const bool fOverwintered{false};
+    const int32_t nVersion{0};
+    const uint32_t nVersionGroupId{0};
+    const std::vector<CTxIn> vin;
+    const std::vector<CTxOut> vout;
+    const uint32_t nLockTime{0};
+    const uint32_t nExpiryHeight{0};
+    const std::vector<SpendDescription> vShieldedSpend;
+    const std::vector<OutputDescription> vShieldedOutput;
+    const std::vector<JSDescription> vJoinSplit;
+    const Ed25519VerificationKey joinSplitPubKey;
+    const Ed25519Signature joinSplitSig;
+    const binding_sig_t bindingSig = {{0}};
+
+    /** Construct a CTransaction that qualifies as IsNull() */
+    CTransaction();
+
+    /** Convert a CMutableTransaction into a CTransaction. */
+    CTransaction(const CMutableTransaction &tx);
+    CTransaction(CMutableTransaction &&tx);
+
+    CTransaction& operator=(const CTransaction& tx);
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        uint32_t header;
+        if (ser_action.ForRead()) {
+            // When deserializing, unpack the 4 byte header to extract fOverwintered and nVersion.
+            READWRITE(header);
+            *const_cast<bool*>(&fOverwintered) = header >> 31;
+            *const_cast<int32_t*>(&this->nVersion) = header & 0x7FFFFFFF;
+        } else {
+            header = GetHeader();
+            READWRITE(header);
+        }
+        if (fOverwintered) {
+            READWRITE(*const_cast<uint32_t*>(&this->nVersionGroupId));
+        }
+
+        bool isOverwinterV3 =
+            fOverwintered &&
+            nVersionGroupId == OVERWINTER_VERSION_GROUP_ID &&
+            nVersion == OVERWINTER_TX_VERSION;
+
+        bool isSaplingV4 =
+            fOverwintered &&
+            nVersionGroupId == SAPLING_VERSION_GROUP_ID &&
+            nVersion == SAPLING_TX_VERSION;
+
+        bool isZip225V5 =
+            fOverwintered &&
+            nVersionGroupId == ZIP225_VERSION_GROUP_ID &&
+            nVersion == ZIP225_TX_VERSION;
+
+        // It is not possible to make the transaction's serialized form vary on
+        // a per-enabled-feature basis. The approach here is that all
+        // serialization rules for not-yet-released features must be
+        // non-conflicting and transaction version/group must be set to
+        // ZFUTURE_TX_(VERSION/GROUP_ID)
+        bool isFuture =
+            fOverwintered &&
+            nVersionGroupId == ZFUTURE_VERSION_GROUP_ID &&
+            nVersion == ZFUTURE_TX_VERSION;
+
+        if (fOverwintered && !(isOverwinterV3 || isSaplingV4 || isZip225V5 || isFuture)) {
+            throw std::ios_base::failure("Unknown transaction format");
+        }
+
+        if (isZip225V5) {
+            // Common Transaction Fields (plus version bytes above)
+            if (ser_action.ForRead()) {
+                uint32_t consensusBranchId;
+                READWRITE(consensusBranchId);
+                *const_cast<std::optional<uint32_t>*>(&nConsensusBranchId) = consensusBranchId;
+            } else {
+                uint32_t consensusBranchId = nConsensusBranchId.value();
+                READWRITE(consensusBranchId);
+            }
+            READWRITE(*const_cast<uint32_t*>(&nLockTime));
+            READWRITE(*const_cast<uint32_t*>(&nExpiryHeight));
+
+            // Transparent Transaction Fields
+            READWRITE(*const_cast<std::vector<CTxIn>*>(&vin));
+            READWRITE(*const_cast<std::vector<CTxOut>*>(&vout));
+
+            // Sapling Transaction Fields
+            if (ser_action.ForRead()) {
+                SaplingBundle saplingBundle;
+                READWRITE(saplingBundle);
+                *const_cast<std::vector<SpendDescription>*>(&vShieldedSpend) =
+                    saplingBundle.GetV4ShieldedSpend();
+                *const_cast<std::vector<OutputDescription>*>(&vShieldedOutput) =
+                    saplingBundle.GetV4ShieldedOutput();
+                valueBalanceSapling = saplingBundle.valueBalanceSapling;
+                *const_cast<binding_sig_t*>(&bindingSig) = saplingBundle.bindingSigSapling;
+            } else {
+                SaplingBundle saplingBundle(
+                    vShieldedSpend,
+                    vShieldedOutput,
+                    valueBalanceSapling,
+                    bindingSig);
+                READWRITE(saplingBundle);
+            }
+
+            // Orchard Transaction Fields
+            READWRITE(orchardBundle);
+        } else {
+            // Legacy transaction formats
+            READWRITE(*const_cast<std::vector<CTxIn>*>(&vin));
+            READWRITE(*const_cast<std::vector<CTxOut>*>(&vout));
+            READWRITE(*const_cast<uint32_t*>(&nLockTime));
+            if (isOverwinterV3 || isSaplingV4 || isFuture) {
+                READWRITE(*const_cast<uint32_t*>(&nExpiryHeight));
+            }
+            if (isSaplingV4 || isFuture) {
+                READWRITE(valueBalanceSapling);
+                READWRITE(*const_cast<std::vector<SpendDescription>*>(&vShieldedSpend));
+                READWRITE(*const_cast<std::vector<OutputDescription>*>(&vShieldedOutput));
+            }
+            if (nVersion >= 2) {
+                // These fields do not depend on fOverwintered
+                auto os = WithVersion(&s, static_cast<int>(header));
+                ::SerReadWrite(os, *const_cast<std::vector<JSDescription>*>(&vJoinSplit), ser_action);
+                if (vJoinSplit.size() > 0) {
+                    READWRITE(*const_cast<Ed25519VerificationKey*>(&joinSplitPubKey));
+                    READWRITE(*const_cast<Ed25519Signature*>(&joinSplitSig));
+                }
+            }
+            if ((isSaplingV4 || isFuture) && !(vShieldedSpend.empty() && vShieldedOutput.empty())) {
+                READWRITE(*const_cast<binding_sig_t*>(&bindingSig));
+            }
+        }
+        if (ser_action.ForRead())
+            UpdateHash();
+    }
+
+    template <typename Stream>
+    CTransaction(deserialize_type, Stream& s) : CTransaction(CMutableTransaction(deserialize, s)) {}
+
+    bool IsNull() const {
+        return vin.empty() && vout.empty();
+    }
+
+    const uint256& GetHash() const {
+        return wtxid.hash;
+    }
+
+    /**
+     * Returns the authorizing data commitment for this transaction.
+     *
+     * For v1-v4 transactions, this returns the null hash (i.e. all-zeroes).
+     */
+    const uint256& GetAuthDigest() const {
+        return wtxid.authDigest;
+    }
+
+    const WTxId& GetWTxId() const {
+        return wtxid;
+    }
+
+    uint32_t GetHeader() const {
+        // When serializing v1 and v2, the 4 byte header is nVersion
+        uint32_t header = this->nVersion;
+        // When serializing Overwintered tx, the 4 byte header is the combination of fOverwintered and nVersion
+        if (fOverwintered) {
+            header |= 1 << 31;
+        }
+        return header;
+    }
+
+    std::optional<uint32_t> GetConsensusBranchId() const {
+        return nConsensusBranchId;
+    }
+
+    /**
+     * Returns the Sapling value balance for the transaction.
+     */
+    const CAmount& GetValueBalanceSapling() const {
+        return valueBalanceSapling;
+    }
+
+    /**
+     * Returns the Orchard bundle for the transaction.
+     */
+    const OrchardBundle& GetOrchardBundle() const {
+        return orchardBundle;
+    }
+
+    /*
+     * Context for the two methods below:
+     * As at most one of vpub_new and vpub_old is non-zero in every JoinSplit,
+     * we can think of a JoinSplit as an input or output according to which one
+     * it is (e.g. if vpub_new is non-zero the joinSplit is "giving value" to
+     * the outputs in the transaction). Similarly, we can think of the Sapling
+     * shielded part of the transaction as an input or output according to
+     * whether valueBalanceSapling - the sum of shielded input values minus the sum of
+     * shielded output values - is positive or negative.
+     */
+
+    // Return sum of txouts, (negative valueBalanceSapling or zero) and JoinSplit vpub_old.
+    CAmount GetValueOut() const;
+    // GetValueIn() is a method on CCoinsViewCache, because
+    // inputs must be known to compute value in.
+
+    // Return sum of (positive valueBalanceSapling or zero) and JoinSplit vpub_new
+    CAmount GetShieldedValueIn() const;
+
+    // Compute priority, given priority of inputs and (optionally) tx size
+    double ComputePriority(double dPriorityInputs, unsigned int nTxSize=0) const;
+
+    // Compute modified tx size for priority calculation (optionally given tx size)
+    unsigned int CalculateModifiedSize(unsigned int nTxSize=0) const;
+
+    bool IsCoinBase() const
+    {
+        return (vin.size() == 1 && vin[0].prevout.IsNull());
+    }
+
+    friend bool operator==(const CTransaction& a, const CTransaction& b)
+    {
+        return a.wtxid.hash == b.wtxid.hash;
+    }
+
+    friend bool operator!=(const CTransaction& a, const CTransaction& b)
+    {
+        return a.wtxid.hash != b.wtxid.hash;
+    }
+
+    std::string ToString() const;
+};
+
+/** A mutable version of CTransaction. */
+struct CMutableTransaction
+{
+    bool fOverwintered{false};
+    int32_t nVersion{0};
+    uint32_t nVersionGroupId{0};
+    /// The consensus branch ID that this transaction commits to.
+    /// Serialized from v5 onwards.
+    std::optional<uint32_t> nConsensusBranchId;
+    std::vector<CTxIn> vin;
+    std::vector<CTxOut> vout;
+    uint32_t nLockTime{0};
+    uint32_t nExpiryHeight{0};
+    CAmount valueBalanceSapling{0};
+    std::vector<SpendDescription> vShieldedSpend;
+    std::vector<OutputDescription> vShieldedOutput;
+    OrchardBundle orchardBundle;
+    std::vector<JSDescription> vJoinSplit;
+    Ed25519VerificationKey joinSplitPubKey;
+    Ed25519Signature joinSplitSig;
+    CTransaction::binding_sig_t bindingSig = {{0}};
+
+    CMutableTransaction();
+    CMutableTransaction(const CTransaction& tx);
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        uint32_t header{0};
+        if (ser_action.ForRead()) {
+            // When deserializing, unpack the 4 byte header to extract fOverwintered and nVersion.
+            READWRITE(header);
+            fOverwintered = header >> 31;
+            this->nVersion = header & 0x7FFFFFFF;
+        } else {
+            // When serializing v1 and v2, the 4 byte header is nVersion
+            header = this->nVersion;
+            // When serializing Overwintered tx, the 4 byte header is the combination of fOverwintered and nVersion
+            if (fOverwintered) {
+                header |= 1 << 31;
+            }
+            READWRITE(header);
+        }
+        if (fOverwintered) {
+            READWRITE(nVersionGroupId);
+        }
+
+        bool isOverwinterV3 =
+            fOverwintered &&
+            nVersionGroupId == OVERWINTER_VERSION_GROUP_ID &&
+            nVersion == OVERWINTER_TX_VERSION;
+        bool isSaplingV4 =
+            fOverwintered &&
+            nVersionGroupId == SAPLING_VERSION_GROUP_ID &&
+            nVersion == SAPLING_TX_VERSION;
+        bool isZip225V5 =
+            fOverwintered &&
+            nVersionGroupId == ZIP225_VERSION_GROUP_ID &&
+            nVersion == ZIP225_TX_VERSION;
+        bool isFuture =
+            fOverwintered &&
+            nVersionGroupId == ZFUTURE_VERSION_GROUP_ID &&
+            nVersion == ZFUTURE_TX_VERSION;
+        if (fOverwintered && !(isOverwinterV3 || isSaplingV4 || isZip225V5 || isFuture)) {
+            throw std::ios_base::failure("Unknown transaction format");
+        }
+
+        if (isZip225V5) {
+            // Common Transaction Fields (plus version bytes above)
+            if (ser_action.ForRead()) {
+                uint32_t consensusBranchId;
+                READWRITE(consensusBranchId);
+                nConsensusBranchId = consensusBranchId;
+            } else {
+                uint32_t consensusBranchId = nConsensusBranchId.value();
+                READWRITE(consensusBranchId);
+            }
+            READWRITE(nLockTime);
+            READWRITE(nExpiryHeight);
+
+            // Transparent Transaction Fields
+            READWRITE(vin);
+            READWRITE(vout);
+
+            // Sapling Transaction Fields
+            if (ser_action.ForRead()) {
+                SaplingBundle saplingBundle;
+                READWRITE(saplingBundle);
+                vShieldedSpend = saplingBundle.GetV4ShieldedSpend();
+                vShieldedOutput = saplingBundle.GetV4ShieldedOutput();
+                valueBalanceSapling = saplingBundle.valueBalanceSapling;
+                bindingSig = saplingBundle.bindingSigSapling;
+            } else {
+                SaplingBundle saplingBundle(
+                    vShieldedSpend,
+                    vShieldedOutput,
+                    valueBalanceSapling,
+                    bindingSig);
+                READWRITE(saplingBundle);
+            }
+
+            // Orchard Transaction Fields
+            READWRITE(orchardBundle);
+        } else {
+            // Legacy transaction formats
+            READWRITE(vin);
+            READWRITE(vout);
+            READWRITE(nLockTime);
+            if (isOverwinterV3 || isSaplingV4 || isFuture) {
+                READWRITE(nExpiryHeight);
+            }
+            if (isSaplingV4 || isFuture) {
+                READWRITE(valueBalanceSapling);
+                READWRITE(vShieldedSpend);
+                READWRITE(vShieldedOutput);
+            }
+            if (nVersion >= 2) {
+                auto os = WithVersion(&s, static_cast<int>(header));
+                ::SerReadWrite(os, vJoinSplit, ser_action);
+                if (vJoinSplit.size() > 0) {
+                    READWRITE(joinSplitPubKey);
+                    READWRITE(joinSplitSig);
+                }
+            }
+            if ((isSaplingV4 || isFuture) && !(vShieldedSpend.empty() && vShieldedOutput.empty())) {
+                READWRITE(bindingSig);
+            }
+        }
+    }
+
+    template <typename Stream>
+    CMutableTransaction(deserialize_type, Stream& s) {
+        Unserialize(s);
+    }
+
+    /** Compute the hash of this CMutableTransaction. This is computed on the
+     * fly, as opposed to GetHash() in CTransaction, which uses a cached result.
+     */
+    uint256 GetHash() const;
+
+    /** Compute the authentication digest of this CMutableTransaction. This is
+     * computed on the fly, as opposed to GetAuthDigest() in CTransaction, which
+     * uses a cached result.
+     *
+     * For v1-v4 transactions, this returns the null hash (i.e. all-zeroes).
+     */
+    uint256 GetAuthDigest() const;
+};
+
+#endif // BITCOIN_PRIMITIVES_TRANSACTION_H
diff --git a/depend/zcash/src/primitives/tx_version_info.cpp b/depend/zcash/src/primitives/tx_version_info.cpp
new file mode 100644
index 000000000..bdcabcb1e
--- /dev/null
+++ b/depend/zcash/src/primitives/tx_version_info.cpp
@@ -0,0 +1,47 @@
+// Copyright (c) 2021 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "primitives/transaction.h"
+
+/**
+ * Returns the most recent supported transaction version and version group id,
+ * as of the specified activation height and active features.
+ */
+TxVersionInfo CurrentTxVersionInfo(
+    const Consensus::Params& consensus,
+    int nHeight,
+    bool requireSprout)
+{
+    if (consensus.NetworkUpgradeActive(nHeight, Consensus::UPGRADE_ZFUTURE)) {
+        return {
+            .fOverwintered =   true,
+            .nVersionGroupId = ZFUTURE_VERSION_GROUP_ID,
+            .nVersion =        ZFUTURE_TX_VERSION
+        };
+    } else if (consensus.NetworkUpgradeActive(nHeight, Consensus::UPGRADE_NU5) && !requireSprout) {
+        return {
+            .fOverwintered =   true,
+            .nVersionGroupId = ZIP225_VERSION_GROUP_ID,
+            .nVersion =        ZIP225_TX_VERSION
+        };
+    } else if (consensus.NetworkUpgradeActive(nHeight, Consensus::UPGRADE_SAPLING)) {
+        return {
+            .fOverwintered =   true,
+            .nVersionGroupId = SAPLING_VERSION_GROUP_ID,
+            .nVersion =        SAPLING_TX_VERSION
+        };
+    } else if (consensus.NetworkUpgradeActive(nHeight, Consensus::UPGRADE_OVERWINTER)) {
+        return {
+            .fOverwintered =   true,
+            .nVersionGroupId = OVERWINTER_VERSION_GROUP_ID,
+            .nVersion =        OVERWINTER_TX_VERSION
+        };
+    } else {
+        return {
+            .fOverwintered =   false,
+            .nVersionGroupId = 0,
+            .nVersion =        CTransaction::SPROUT_MIN_CURRENT_VERSION
+        };
+    }
+}
diff --git a/depend/zcash/src/proof_verifier.cpp b/depend/zcash/src/proof_verifier.cpp
new file mode 100644
index 000000000..92a620cba
--- /dev/null
+++ b/depend/zcash/src/proof_verifier.cpp
@@ -0,0 +1,71 @@
+// Copyright (c) 2016-2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include <proof_verifier.h>
+
+#include <zcash/JoinSplit.hpp>
+
+#include <variant>
+
+#include <librustzcash.h>
+
+class SproutProofVerifier
+{
+    ProofVerifier& verifier;
+    const Ed25519VerificationKey& joinSplitPubKey;
+    const JSDescription& jsdesc;
+
+public:
+    SproutProofVerifier(
+        ProofVerifier& verifier,
+        const Ed25519VerificationKey& joinSplitPubKey,
+        const JSDescription& jsdesc
+        ) : jsdesc(jsdesc), verifier(verifier), joinSplitPubKey(joinSplitPubKey) {}
+
+    bool operator()(const libzcash::PHGRProof& proof) const
+    {
+        // We checkpoint after Sapling activation, so we can skip verification
+        // for all Sprout proofs.
+        return true;
+    }
+
+    bool operator()(const libzcash::GrothProof& proof) const
+    {
+        uint256 h_sig = ZCJoinSplit::h_sig(jsdesc.randomSeed, jsdesc.nullifiers, joinSplitPubKey);
+
+        return librustzcash_sprout_verify(
+            proof.begin(),
+            jsdesc.anchor.begin(),
+            h_sig.begin(),
+            jsdesc.macs[0].begin(),
+            jsdesc.macs[1].begin(),
+            jsdesc.nullifiers[0].begin(),
+            jsdesc.nullifiers[1].begin(),
+            jsdesc.commitments[0].begin(),
+            jsdesc.commitments[1].begin(),
+            jsdesc.vpub_old,
+            jsdesc.vpub_new
+        );
+    }
+};
+
+ProofVerifier ProofVerifier::Strict() {
+    return ProofVerifier(true);
+}
+
+ProofVerifier ProofVerifier::Disabled() {
+    return ProofVerifier(false);
+}
+
+bool ProofVerifier::VerifySprout(
+    const JSDescription& jsdesc,
+    const Ed25519VerificationKey& joinSplitPubKey
+) {
+    if (!perform_verification) {
+        return true;
+    }
+
+    auto pv = SproutProofVerifier(*this, joinSplitPubKey, jsdesc);
+    return std::visit(pv, jsdesc.proof);
+}
diff --git a/depend/zcash/src/proof_verifier.h b/depend/zcash/src/proof_verifier.h
new file mode 100644
index 000000000..ef48200ae
--- /dev/null
+++ b/depend/zcash/src/proof_verifier.h
@@ -0,0 +1,42 @@
+// Copyright (c) 2016-2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_PROOF_VERIFIER_H
+#define ZCASH_PROOF_VERIFIER_H
+
+#include <primitives/transaction.h>
+#include <uint256.h>
+
+#include <rust/ed25519/types.h>
+
+class ProofVerifier {
+private:
+    bool perform_verification;
+
+    ProofVerifier(bool perform_verification) : perform_verification(perform_verification) { }
+
+public:
+    // ProofVerifier should never be copied
+    ProofVerifier(const ProofVerifier&) = delete;
+    ProofVerifier& operator=(const ProofVerifier&) = delete;
+    ProofVerifier(ProofVerifier&&);
+    ProofVerifier& operator=(ProofVerifier&&);
+
+    // Creates a verification context that strictly verifies
+    // all proofs.
+    static ProofVerifier Strict();
+
+    // Creates a verification context that performs no
+    // verification, used when avoiding duplicate effort
+    // such as during reindexing.
+    static ProofVerifier Disabled();
+
+    // Verifies that the JoinSplit proof is correct.
+    bool VerifySprout(
+        const JSDescription& jsdesc,
+        const Ed25519VerificationKey& joinSplitPubKey
+    );
+};
+
+#endif // ZCASH_PROOF_VERIFIER_H
diff --git a/depend/zcash/src/protocol.cpp b/depend/zcash/src/protocol.cpp
new file mode 100644
index 000000000..e35266dd0
--- /dev/null
+++ b/depend/zcash/src/protocol.cpp
@@ -0,0 +1,156 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "protocol.h"
+
+#include "util.h"
+#include "utilstrencodings.h"
+
+#ifndef WIN32
+# include <arpa/inet.h>
+#endif
+
+CMessageHeader::CMessageHeader(const MessageStartChars& pchMessageStartIn)
+{
+    memcpy(pchMessageStart, pchMessageStartIn, MESSAGE_START_SIZE);
+    memset(pchCommand, 0, sizeof(pchCommand));
+    nMessageSize = -1;
+    memset(pchChecksum, 0, CHECKSUM_SIZE);
+}
+
+CMessageHeader::CMessageHeader(const MessageStartChars& pchMessageStartIn, const char* pszCommand, unsigned int nMessageSizeIn)
+{
+    memcpy(pchMessageStart, pchMessageStartIn, MESSAGE_START_SIZE);
+    memset(pchCommand, 0, sizeof(pchCommand));
+    strncpy(pchCommand, pszCommand, COMMAND_SIZE);
+    nMessageSize = nMessageSizeIn;
+    memset(pchChecksum, 0, CHECKSUM_SIZE);
+}
+
+std::string CMessageHeader::GetCommand() const
+{
+    return std::string(pchCommand, pchCommand + strnlen(pchCommand, COMMAND_SIZE));
+}
+
+bool CMessageHeader::IsValid(const MessageStartChars& pchMessageStartIn) const
+{
+    // Check start string
+    if (memcmp(pchMessageStart, pchMessageStartIn, MESSAGE_START_SIZE) != 0)
+        return false;
+
+    // Check the command string for errors
+    for (const char* p1 = pchCommand; p1 < pchCommand + COMMAND_SIZE; p1++)
+    {
+        if (*p1 == 0)
+        {
+            // Must be all zeros after the first zero
+            for (; p1 < pchCommand + COMMAND_SIZE; p1++)
+                if (*p1 != 0)
+                    return false;
+        }
+        else if (*p1 < ' ' || *p1 > 0x7E)
+            return false;
+    }
+
+    // Message size
+    if (nMessageSize > MAX_SIZE)
+    {
+        LogPrintf("CMessageHeader::IsValid(): (%s, %u bytes) nMessageSize > MAX_SIZE\n", GetCommand(), nMessageSize);
+        return false;
+    }
+
+    return true;
+}
+
+
+
+CAddress::CAddress() : CService()
+{
+    Init();
+}
+
+CAddress::CAddress(CService ipIn, uint64_t nServicesIn) : CService(ipIn)
+{
+    Init();
+    nServices = nServicesIn;
+}
+
+void CAddress::Init()
+{
+    nServices = NODE_NETWORK;
+    nTime = 100000000;
+}
+
+CInv::CInv()
+{
+    type = 0;
+    hash.SetNull();
+    hashAux.SetNull();
+}
+
+CInv::CInv(int typeIn, const uint256& hashIn)
+{
+    assert(typeIn != MSG_WTX);
+    type = typeIn;
+    hash = hashIn;
+    if (typeIn == MSG_TX) {
+        hashAux = LEGACY_TX_AUTH_DIGEST;
+    } else {
+        hashAux.SetNull();
+    }
+}
+
+CInv::CInv(int typeIn, const uint256& hashIn, const uint256& hashAuxIn)
+{
+    type = typeIn;
+    hash = hashIn;
+    hashAux = hashAuxIn;
+}
+
+bool operator<(const CInv& a, const CInv& b)
+{
+    return (a.type < b.type ||
+        (a.type == b.type && a.hash < b.hash) ||
+        (a.type == b.type && a.hash == b.hash && a.hashAux < b.hashAux));
+}
+
+std::string CInv::GetCommand() const
+{
+    std::string cmd;
+    switch (type)
+    {
+    case MSG_TX:             return cmd.append("tx");
+    case MSG_BLOCK:          return cmd.append("block");
+    // WTX is not a message type, just an inv type
+    case MSG_WTX:            return cmd.append("wtx");
+    case MSG_FILTERED_BLOCK: return cmd.append("merkleblock");
+    default:
+        throw std::out_of_range(strprintf("CInv::GetCommand(): type=%d unknown type", type));
+    }
+}
+
+std::vector<unsigned char> CInv::GetWideHash() const
+{
+    assert(type != MSG_BLOCK);
+    if (type == MSG_TX) {
+        for (auto byte : hashAux) {
+            assert(byte == 0xff);
+        }
+    };
+    std::vector<unsigned char> vData(hash.begin(), hash.end());
+    vData.insert(vData.end(), hashAux.begin(), hashAux.end());
+    return vData;
+}
+
+std::string CInv::ToString() const
+{
+    switch (type)
+    {
+    case MSG_WTX:
+        return strprintf("%s(%s, %s)", GetCommand(), hash.ToString(), hashAux.ToString());
+    default:
+        return strprintf("%s %s", GetCommand(), hash.ToString());
+    }
+}
diff --git a/depend/zcash/src/protocol.h b/depend/zcash/src/protocol.h
new file mode 100644
index 000000000..f182d0f06
--- /dev/null
+++ b/depend/zcash/src/protocol.h
@@ -0,0 +1,204 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef __cplusplus
+#error This header can only be compiled as C++.
+#endif
+
+#ifndef BITCOIN_PROTOCOL_H
+#define BITCOIN_PROTOCOL_H
+
+#include "netbase.h"
+#include "serialize.h"
+#include "uint256.h"
+#include "version.h"
+
+#include <stdint.h>
+#include <string>
+
+/** Message header.
+ * (4) message start.
+ * (12) command.
+ * (4) size.
+ * (4) checksum.
+ */
+class CMessageHeader
+{
+public:
+    enum {
+        MESSAGE_START_SIZE = 4,
+        COMMAND_SIZE = 12,
+        MESSAGE_SIZE_SIZE = 4,
+        CHECKSUM_SIZE = 4,
+
+        MESSAGE_SIZE_OFFSET = MESSAGE_START_SIZE + COMMAND_SIZE,
+        CHECKSUM_OFFSET = MESSAGE_SIZE_OFFSET + MESSAGE_SIZE_SIZE,
+        HEADER_SIZE = MESSAGE_START_SIZE + COMMAND_SIZE + MESSAGE_SIZE_SIZE + CHECKSUM_SIZE
+    };
+    typedef unsigned char MessageStartChars[MESSAGE_START_SIZE];
+
+    CMessageHeader(const MessageStartChars& pchMessageStartIn);
+    CMessageHeader(const MessageStartChars& pchMessageStartIn, const char* pszCommand, unsigned int nMessageSizeIn);
+
+    std::string GetCommand() const;
+    bool IsValid(const MessageStartChars& messageStart) const;
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action)
+    {
+        READWRITE(FLATDATA(pchMessageStart));
+        READWRITE(FLATDATA(pchCommand));
+        READWRITE(nMessageSize);
+        READWRITE(FLATDATA(pchChecksum));
+    }
+
+    char pchMessageStart[MESSAGE_START_SIZE];
+    char pchCommand[COMMAND_SIZE];
+    uint32_t nMessageSize;
+    uint8_t pchChecksum[CHECKSUM_SIZE];
+};
+
+/** nServices flags */
+enum {
+    // NODE_NETWORK means that the node is capable of serving the block chain. It is currently
+    // set by all Bitcoin Core nodes, and is unset by SPV clients or other peers that just want
+    // network services but don't provide them.
+    NODE_NETWORK = (1 << 0),
+    // NODE_BLOOM means the node is capable and willing to handle bloom-filtered connections.
+    // Zcash nodes used to support this by default, without advertising this bit,
+    // but no longer do as of protocol version 170004 (= NO_BLOOM_VERSION)
+    NODE_BLOOM = (1 << 2),
+
+    // Bits 24-31 are reserved for temporary experiments. Just pick a bit that
+    // isn't getting used, or one not being used much, and notify the
+    // bitcoin-development mailing list. Remember that service bits are just
+    // unauthenticated advertisements, so your code must be robust against
+    // collisions and other cases where nodes may be advertising a service they
+    // do not actually support. Other service bits should be allocated via the
+    // BIP process.
+};
+
+/** A CService with information about it as peer */
+class CAddress : public CService
+{
+public:
+    CAddress();
+    explicit CAddress(CService ipIn, uint64_t nServicesIn = NODE_NETWORK);
+
+    void Init();
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action)
+    {
+        if (ser_action.ForRead())
+            Init();
+        int nVersion = s.GetVersion();
+        if (s.GetType() & SER_DISK)
+            READWRITE(nVersion);
+        if ((s.GetType() & SER_DISK) ||
+            (nVersion >= CADDR_TIME_VERSION && !(s.GetType() & SER_GETHASH)))
+            READWRITE(nTime);
+        READWRITE(nServices);
+        READWRITE(*(CService*)this);
+    }
+
+    // TODO: make private (improves encapsulation)
+public:
+    uint64_t nServices;
+
+    // disk and network only
+    unsigned int nTime;
+};
+
+/** getdata / inv message types.
+ * These numbers are defined by the protocol. When adding a new value, be sure
+ * to mention it in the respective ZIP, as well as checking for collisions with
+ * BIPs we might want to backport.
+ */
+enum GetDataMsg : uint32_t {
+    UNDEFINED = 0,
+    MSG_TX = 1,
+    MSG_BLOCK = 2,
+    MSG_WTX = 5,             //!< Defined in ZIP 239
+    // The following can only occur in getdata. Invs always use TX/WTX or BLOCK.
+    MSG_FILTERED_BLOCK = 3,  //!< Defined in BIP37
+};
+
+/** inv message data */
+class CInv
+{
+public:
+    CInv();
+    CInv(int typeIn, const uint256& hashIn);
+    CInv(int typeIn, const uint256& hashIn, const uint256& hashAuxIn);
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action)
+    {
+        int nVersion = s.GetVersion();
+        READWRITE(type);
+
+        // The implicit P2P network protocol inherited from Bitcoin Core has
+        // zcashd nodes sort-of ignoring unknown CInv message types in inv
+        // messages: they are added to the known transaction inventory, but
+        // AlreadyHave returns true, so we do nothing with them. Meanwhile for
+        // getdata messages, ProcessGetData ignores unknown message types
+        // entirely.
+        //
+        // As of v4.5.0, we change the implementation behaviour to reject
+        // undefined message types instead of ignoring them.
+        switch (type) {
+        case MSG_TX:
+        case MSG_BLOCK:
+        case MSG_FILTERED_BLOCK:
+            break;
+        case MSG_WTX:
+            if (nVersion < CINV_WTX_VERSION) {
+                throw std::ios_base::failure(
+                    "Negotiated protocol version does not support CInv message type MSG_WTX");
+            }
+            break;
+        default:
+            // This includes UNDEFINED, which should never be serialized.
+            throw std::ios_base::failure("Unknown CInv message type");
+        }
+
+        READWRITE(hash);
+        if (type == MSG_WTX) {
+            // We've already checked above that nVersion >= CINV_WTX_VERSION.
+            READWRITE(hashAux);
+        } else if (type == MSG_TX && ser_action.ForRead()) {
+            // Ensure that this value is set consistently in memory for MSG_TX.
+            hashAux = LEGACY_TX_AUTH_DIGEST;
+        }
+    }
+
+    friend bool operator<(const CInv& a, const CInv& b);
+
+    std::string GetCommand() const;
+    std::vector<unsigned char> GetWideHash() const;
+    std::string ToString() const;
+
+    // TODO: make private (improves encapsulation)
+public:
+    int type;
+    // The main hash. This is:
+    // - MSG_BLOCK: the block hash.
+    // - MSG_TX and MSG_WTX: the txid.
+    uint256 hash;
+    // The auxiliary hash. This is:
+    // - MSG_BLOCK: null (all-zeroes) and not parsed or serialized.
+    // - MSG_TX: legacy auth digest (all-ones) and not parsed or serialized.
+    // - MSG_WTX: the auth digest.
+    uint256 hashAux;
+};
+
+#endif // BITCOIN_PROTOCOL_H
diff --git a/depend/zcash/src/pubkey.cpp b/depend/zcash/src/pubkey.cpp
new file mode 100644
index 000000000..48dc94dc4
--- /dev/null
+++ b/depend/zcash/src/pubkey.cpp
@@ -0,0 +1,175 @@
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Copyright (c) 2017 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "pubkey.h"
+
+#include <secp256k1.h>
+#include <secp256k1_recovery.h>
+
+namespace
+{
+/* Global secp256k1_context object used for verification. */
+secp256k1_context* secp256k1_context_verify = NULL;
+}
+
+
+bool CPubKey::Verify(const uint256 &hash, const std::vector<unsigned char>& vchSig) const {
+    if (!IsValid())
+        return false;
+    secp256k1_pubkey pubkey;
+    secp256k1_ecdsa_signature sig;
+    if (!secp256k1_ec_pubkey_parse(secp256k1_context_verify, &pubkey, &(*this)[0], size())) {
+        return false;
+    }
+    if (vchSig.size() == 0) {
+        return false;
+    }
+    /* Zcash, unlike Bitcoin, has always enforced strict DER signatures. */
+    if (!secp256k1_ecdsa_signature_parse_der(secp256k1_context_verify, &sig, &vchSig[0], vchSig.size())) {
+        return false;
+    }
+    /* libsecp256k1's ECDSA verification requires lower-S signatures, which have
+     * not historically been enforced in Bitcoin or Zcash, so normalize them first. */
+    secp256k1_ecdsa_signature_normalize(secp256k1_context_verify, &sig, &sig);
+    return secp256k1_ecdsa_verify(secp256k1_context_verify, &sig, hash.begin(), &pubkey);
+}
+
+bool CPubKey::RecoverCompact(const uint256 &hash, const std::vector<unsigned char>& vchSig) {
+    if (vchSig.size() != COMPACT_SIGNATURE_SIZE)
+        return false;
+    int recid = (vchSig[0] - 27) & 3;
+    bool fComp = ((vchSig[0] - 27) & 4) != 0;
+    secp256k1_pubkey pubkey;
+    secp256k1_ecdsa_recoverable_signature sig;
+    if (!secp256k1_ecdsa_recoverable_signature_parse_compact(secp256k1_context_verify, &sig, &vchSig[1], recid)) {
+        return false;
+    }
+    if (!secp256k1_ecdsa_recover(secp256k1_context_verify, &pubkey, &sig, hash.begin())) {
+        return false;
+    }
+    unsigned char pub[PUBLIC_KEY_SIZE];
+    size_t publen = PUBLIC_KEY_SIZE;
+    secp256k1_ec_pubkey_serialize(secp256k1_context_verify, pub, &publen, &pubkey, fComp ? SECP256K1_EC_COMPRESSED : SECP256K1_EC_UNCOMPRESSED);
+    Set(pub, pub + publen);
+    return true;
+}
+
+bool CPubKey::IsFullyValid() const {
+    if (!IsValid())
+        return false;
+    secp256k1_pubkey pubkey;
+    return secp256k1_ec_pubkey_parse(secp256k1_context_verify, &pubkey, &(*this)[0], size());
+}
+
+bool CPubKey::Decompress() {
+    if (!IsValid())
+        return false;
+    secp256k1_pubkey pubkey;
+    if (!secp256k1_ec_pubkey_parse(secp256k1_context_verify, &pubkey, &(*this)[0], size())) {
+        return false;
+    }
+    unsigned char pub[PUBLIC_KEY_SIZE];
+    size_t publen = PUBLIC_KEY_SIZE;
+    secp256k1_ec_pubkey_serialize(secp256k1_context_verify, pub, &publen, &pubkey, SECP256K1_EC_UNCOMPRESSED);
+    Set(pub, pub + publen);
+    return true;
+}
+
+bool CPubKey::Derive(CPubKey& pubkeyChild, ChainCode &ccChild, unsigned int nChild, const ChainCode& cc) const {
+    assert(IsValid());
+    assert((nChild >> 31) == 0);
+    assert(size() == COMPRESSED_PUBLIC_KEY_SIZE);
+    unsigned char out[64];
+    BIP32Hash(cc, nChild, *begin(), begin()+1, out);
+    memcpy(ccChild.begin(), out+32, 32);
+    secp256k1_pubkey pubkey;
+    if (!secp256k1_ec_pubkey_parse(secp256k1_context_verify, &pubkey, &(*this)[0], size())) {
+        return false;
+    }
+    if (!secp256k1_ec_pubkey_tweak_add(secp256k1_context_verify, &pubkey, out)) {
+        return false;
+    }
+    unsigned char pub[COMPRESSED_PUBLIC_KEY_SIZE];
+    size_t publen = COMPRESSED_PUBLIC_KEY_SIZE;
+    secp256k1_ec_pubkey_serialize(secp256k1_context_verify, pub, &publen, &pubkey, SECP256K1_EC_COMPRESSED);
+    pubkeyChild.Set(pub, pub + publen);
+    return true;
+}
+
+std::optional<CChainablePubKey> CChainablePubKey::Derive(unsigned int nChild) const {
+    CPubKey pubkeyChild;
+    ChainCode ccChild;
+    if (pubkey.Derive(pubkeyChild, ccChild, nChild, chaincode)) {
+        return CChainablePubKey::FromParts(ccChild, pubkeyChild);
+    } else {
+        return std::nullopt;
+    }
+}
+
+void CExtPubKey::Encode(unsigned char code[BIP32_EXTKEY_SIZE]) const {
+    code[0] = nDepth;
+    memcpy(code+1, vchFingerprint, 4);
+    code[5] = (nChild >> 24) & 0xFF; code[6] = (nChild >> 16) & 0xFF;
+    code[7] = (nChild >>  8) & 0xFF; code[8] = (nChild >>  0) & 0xFF;
+    memcpy(code+9, chaincode.begin(), 32);
+    assert(pubkey.size() == CPubKey::COMPRESSED_PUBLIC_KEY_SIZE);
+    memcpy(code+41, pubkey.begin(), CPubKey::COMPRESSED_PUBLIC_KEY_SIZE);
+}
+
+void CExtPubKey::Decode(const unsigned char code[BIP32_EXTKEY_SIZE]) {
+    nDepth = code[0];
+    memcpy(vchFingerprint, code+1, 4);
+    nChild = (code[5] << 24) | (code[6] << 16) | (code[7] << 8) | code[8];
+    memcpy(chaincode.begin(), code+9, 32);
+    pubkey.Set(code+41, code+BIP32_EXTKEY_SIZE);
+}
+
+bool CExtPubKey::Derive(CExtPubKey &out, unsigned int _nChild) const {
+    out.nDepth = nDepth + 1;
+    CKeyID id = pubkey.GetID();
+    memcpy(&out.vchFingerprint[0], &id, 4);
+    out.nChild = _nChild;
+    return pubkey.Derive(out.pubkey, out.chaincode, _nChild, chaincode);
+}
+
+/* static */ bool CPubKey::CheckLowS(const std::vector<unsigned char>& vchSig) {
+    secp256k1_ecdsa_signature sig;
+
+    /* Zcash, unlike Bitcoin, has always enforced strict DER signatures. */
+    if (!secp256k1_ecdsa_signature_parse_der(secp256k1_context_verify, &sig, &vchSig[0], vchSig.size())) {
+        return false;
+    }
+    return (!secp256k1_ecdsa_signature_normalize(secp256k1_context_verify, NULL, &sig));
+}
+
+/* static */ std::optional<CChainablePubKey> CChainablePubKey::FromParts(ChainCode chaincode, CPubKey pubkey) {
+    if (pubkey.IsCompressed()) {
+        return CChainablePubKey(chaincode, pubkey);
+    } else {
+        return std::nullopt;
+    }
+}
+
+/* static */ int ECCVerifyHandle::refcount = 0;
+
+ECCVerifyHandle::ECCVerifyHandle()
+{
+    if (refcount == 0) {
+        assert(secp256k1_context_verify == NULL);
+        secp256k1_context_verify = secp256k1_context_create(SECP256K1_CONTEXT_VERIFY);
+        assert(secp256k1_context_verify != NULL);
+    }
+    refcount++;
+}
+
+ECCVerifyHandle::~ECCVerifyHandle()
+{
+    refcount--;
+    if (refcount == 0) {
+        assert(secp256k1_context_verify != NULL);
+        secp256k1_context_destroy(secp256k1_context_verify);
+        secp256k1_context_verify = NULL;
+    }
+}
diff --git a/depend/zcash/src/pubkey.h b/depend/zcash/src/pubkey.h
new file mode 100644
index 000000000..917423800
--- /dev/null
+++ b/depend/zcash/src/pubkey.h
@@ -0,0 +1,318 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Copyright (c) 2017 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_PUBKEY_H
+#define BITCOIN_PUBKEY_H
+
+#include "hash.h"
+#include "serialize.h"
+#include "uint256.h"
+
+#include <stdexcept>
+#include <vector>
+
+const unsigned int BIP32_EXTKEY_SIZE = 74;
+
+/** A reference to a CKey: the Hash160 of its serialized public key */
+class CKeyID : public uint160
+{
+public:
+    CKeyID() : uint160() {}
+    CKeyID(const uint160& in) : uint160(in) {}
+    explicit CKeyID(const std::vector<unsigned char>& vch) : uint160(vch) {}
+};
+
+typedef uint256 ChainCode;
+
+/** An encapsulated public key. */
+class CPubKey
+{
+public:
+    /**
+     * secp256k1:
+     */
+    static constexpr unsigned int PUBLIC_KEY_SIZE             = 65;
+    static constexpr unsigned int COMPRESSED_PUBLIC_KEY_SIZE  = 33;
+    static constexpr unsigned int SIGNATURE_SIZE              = 72;
+    static constexpr unsigned int COMPACT_SIGNATURE_SIZE      = 65;
+    /**
+     * see www.keylength.com
+     * script supports up to 75 for single byte push
+     */
+    static_assert(
+        PUBLIC_KEY_SIZE >= COMPRESSED_PUBLIC_KEY_SIZE,
+        "COMPRESSED_PUBLIC_KEY_SIZE is larger than PUBLIC_KEY_SIZE");
+
+private:
+
+    /**
+     * Just store the serialized data.
+     * Its length can very cheaply be computed from the first byte.
+     */
+    unsigned char vch[PUBLIC_KEY_SIZE];
+
+    //! Compute the length of a pubkey with a given first byte.
+    unsigned int static GetLen(unsigned char chHeader)
+    {
+        if (chHeader == 2 || chHeader == 3)
+            return COMPRESSED_PUBLIC_KEY_SIZE;
+        if (chHeader == 4 || chHeader == 6 || chHeader == 7)
+            return PUBLIC_KEY_SIZE;
+        return 0;
+    }
+
+    //! Set this key data to be invalid
+    void Invalidate()
+    {
+        vch[0] = 0xFF;
+    }
+
+public:
+
+    bool static ValidSize(const std::vector<unsigned char> &vch) {
+      return vch.size() > 0 && GetLen(vch[0]) == vch.size();
+    }
+
+    //! Construct an invalid public key.
+    CPubKey()
+    {
+        Invalidate();
+    }
+
+    //! Initialize a public key using begin/end iterators to byte data.
+    template <typename T>
+    void Set(const T pbegin, const T pend)
+    {
+        int len = pend == pbegin ? 0 : GetLen(pbegin[0]);
+        if (len && len == (pend - pbegin))
+            memcpy(vch, (unsigned char*)&pbegin[0], len);
+        else
+            Invalidate();
+    }
+
+    //! Construct a public key using begin/end iterators to byte data.
+    template <typename T>
+    CPubKey(const T pbegin, const T pend)
+    {
+        Set(pbegin, pend);
+    }
+
+    //! Construct a public key from a byte vector.
+    CPubKey(const std::vector<unsigned char>& _vch)
+    {
+        Set(_vch.begin(), _vch.end());
+    }
+
+    //! Simple read-only vector-like interface to the pubkey data.
+    unsigned int size() const { return GetLen(vch[0]); }
+    const unsigned char* begin() const { return vch; }
+    const unsigned char* end() const { return vch + size(); }
+    const unsigned char& operator[](unsigned int pos) const { return vch[pos]; }
+
+    //! Comparator implementation.
+    friend bool operator==(const CPubKey& a, const CPubKey& b)
+    {
+        return a.vch[0] == b.vch[0] &&
+               memcmp(a.vch, b.vch, a.size()) == 0;
+    }
+    friend bool operator!=(const CPubKey& a, const CPubKey& b)
+    {
+        return !(a == b);
+    }
+    friend bool operator<(const CPubKey& a, const CPubKey& b)
+    {
+        return a.vch[0] < b.vch[0] ||
+               (a.vch[0] == b.vch[0] && memcmp(a.vch, b.vch, a.size()) < 0);
+    }
+
+    //! Implement serialization, as if this was a byte vector.
+    template <typename Stream>
+    void Serialize(Stream& s) const
+    {
+        unsigned int len = size();
+        ::WriteCompactSize(s, len);
+        s.write((char*)vch, len);
+    }
+    template <typename Stream>
+    void Unserialize(Stream& s)
+    {
+        unsigned int len = ::ReadCompactSize(s);
+        if (len <= PUBLIC_KEY_SIZE) {
+            s.read((char*)vch, len);
+        } else {
+            // invalid pubkey, skip available data
+            char dummy;
+            while (len--)
+                s.read(&dummy, 1);
+            Invalidate();
+        }
+    }
+
+    //! Get the KeyID of this public key (hash of its serialization)
+    CKeyID GetID() const
+    {
+        return CKeyID(Hash160(vch, vch + size()));
+    }
+
+    //! Get the 256-bit hash of this public key.
+    uint256 GetHash() const
+    {
+        return Hash(vch, vch + size());
+    }
+
+    /*
+     * Check syntactic correctness.
+     *
+     * Note that this is consensus critical as CheckSig() calls it!
+     */
+    bool IsValid() const
+    {
+        return size() > 0;
+    }
+
+    //! fully validate whether this is a valid public key (more expensive than IsValid())
+    bool IsFullyValid() const;
+
+    //! Check whether this is a compressed public key.
+    bool IsCompressed() const
+    {
+        return size() == COMPRESSED_PUBLIC_KEY_SIZE;
+    }
+
+    /**
+     * Verify a DER signature (~72 bytes).
+     * If this public key is not fully valid, the return value will be false.
+     */
+    bool Verify(const uint256& hash, const std::vector<unsigned char>& vchSig) const;
+
+    /**
+     * Check whether a signature is normalized (lower-S).
+     */
+    static bool CheckLowS(const std::vector<unsigned char>& vchSig);
+
+    //! Recover a public key from a compact signature.
+    bool RecoverCompact(const uint256& hash, const std::vector<unsigned char>& vchSig);
+
+    //! Turn this public key into an uncompressed public key.
+    bool Decompress();
+
+    //! Derive BIP32 child pubkey.
+    bool Derive(CPubKey& pubkeyChild, ChainCode &ccChild, unsigned int nChild, const ChainCode& cc) const;
+};
+
+class CChainablePubKey {
+private:
+    ChainCode chaincode;
+    CPubKey pubkey;
+
+    CChainablePubKey() {}
+    CChainablePubKey(ChainCode chaincode, CPubKey pubkey): chaincode(chaincode), pubkey(pubkey) {}
+public:
+    static std::optional<CChainablePubKey> FromParts(ChainCode chaincode, CPubKey pubkey);
+
+    const ChainCode& GetChainCode() const {
+        return chaincode;
+    }
+
+    const CPubKey& GetPubKey() const {
+        return pubkey;
+    }
+
+    std::optional<CChainablePubKey> Derive(unsigned int nChild) const;
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(chaincode);
+        if (ser_action.ForRead()) {
+            std::array<uint8_t, CPubKey::COMPRESSED_PUBLIC_KEY_SIZE> pubkeyBytes;
+            READWRITE(pubkeyBytes);
+            pubkey = CPubKey(pubkeyBytes.begin(), pubkeyBytes.end());
+            assert(pubkey.IsCompressed());
+        } else {
+            assert(pubkey.size() == CPubKey::COMPRESSED_PUBLIC_KEY_SIZE);
+            std::array<uint8_t, CPubKey::COMPRESSED_PUBLIC_KEY_SIZE> pubkeyBytes;
+            std::copy(pubkey.begin(), pubkey.end(), pubkeyBytes.begin());
+            READWRITE(pubkeyBytes);
+        }
+    }
+
+    template <typename Stream>
+    static CChainablePubKey Read(Stream& stream) {
+        CChainablePubKey key;
+        stream >> key;
+        return key;
+    }
+
+    friend bool operator==(const CChainablePubKey &a, const CChainablePubKey &b)
+    {
+        return a.chaincode == b.chaincode && a.pubkey == b.pubkey;
+    }
+};
+
+struct CExtPubKey {
+    unsigned char nDepth;
+    unsigned char vchFingerprint[4];
+    unsigned int nChild;
+    ChainCode chaincode;
+    CPubKey pubkey;
+
+    friend bool operator==(const CExtPubKey &a, const CExtPubKey &b)
+    {
+        return a.nDepth == b.nDepth &&
+            memcmp(&a.vchFingerprint[0], &b.vchFingerprint[0], sizeof(vchFingerprint)) == 0 &&
+            a.nChild == b.nChild &&
+            a.chaincode == b.chaincode &&
+            a.pubkey == b.pubkey;
+    }
+
+    void Encode(unsigned char code[BIP32_EXTKEY_SIZE]) const;
+    void Decode(const unsigned char code[BIP32_EXTKEY_SIZE]);
+    bool Derive(CExtPubKey& out, unsigned int nChild) const;
+
+    std::optional<CChainablePubKey> ToChainablePubKey() const {
+        return CChainablePubKey::FromParts(chaincode, pubkey);
+    }
+
+    void Serialize(CSizeComputer& s) const
+    {
+        // Optimized implementation for ::GetSerializeSize that avoids copying.
+        s.seek(BIP32_EXTKEY_SIZE + 1); // add one byte for the size (compact int)
+    }
+    template <typename Stream>
+    void Serialize(Stream& s) const
+    {
+        unsigned int len = BIP32_EXTKEY_SIZE;
+        ::WriteCompactSize(s, len);
+        unsigned char code[BIP32_EXTKEY_SIZE];
+        Encode(code);
+        s.write((const char *)&code[0], len);
+    }
+    template <typename Stream>
+    void Unserialize(Stream& s)
+    {
+        unsigned int len = ::ReadCompactSize(s);
+        unsigned char code[BIP32_EXTKEY_SIZE];
+        if (len != BIP32_EXTKEY_SIZE)
+            throw std::runtime_error("Invalid extended key size\n");
+        s.read((char *)&code[0], len);
+        Decode(code);
+    }
+};
+
+/** Users of this module must hold an ECCVerifyHandle. The constructor and
+ *  destructor of these are not allowed to run in parallel, though. */
+class ECCVerifyHandle
+{
+    static int refcount;
+
+public:
+    ECCVerifyHandle();
+    ~ECCVerifyHandle();
+};
+
+#endif // BITCOIN_PUBKEY_H
diff --git a/depend/zcash/src/random.cpp b/depend/zcash/src/random.cpp
new file mode 100644
index 000000000..5a5b68b74
--- /dev/null
+++ b/depend/zcash/src/random.cpp
@@ -0,0 +1,93 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "random.h"
+
+#include "support/cleanse.h"
+#ifdef WIN32
+#include "compat.h" // for Windows API
+#endif
+#include "serialize.h"        // for begin_ptr(vec)
+#include "util.h"             // for LogPrint()
+#include "utilstrencodings.h" // for GetTime()
+
+#include <limits>
+
+#ifndef WIN32
+#include <sys/time.h>
+#endif
+
+#include <librustzcash.h>
+
+static inline int64_t GetPerformanceCounter()
+{
+    int64_t nCounter = 0;
+#ifdef WIN32
+    QueryPerformanceCounter((LARGE_INTEGER*)&nCounter);
+#else
+    timeval t;
+    gettimeofday(&t, NULL);
+    nCounter = (int64_t)(t.tv_sec * 1000000 + t.tv_usec);
+#endif
+    return nCounter;
+}
+
+void GetRandBytes(unsigned char* buf, size_t num)
+{
+    librustzcash_getrandom(buf, num);
+}
+
+uint64_t GetRand(uint64_t nMax)
+{
+    if (nMax == 0)
+        return 0;
+
+    // The range of the random source must be a multiple of the modulus
+    // to give every possible output value an equal possibility
+    uint64_t nRange = (std::numeric_limits<uint64_t>::max() / nMax) * nMax;
+    uint64_t nRand = 0;
+    do {
+        GetRandBytes((unsigned char*)&nRand, sizeof(nRand));
+    } while (nRand >= nRange);
+    return (nRand % nMax);
+}
+
+int GetRandInt(int nMax)
+{
+    return GetRand(nMax);
+}
+
+uint256 GetRandHash()
+{
+    uint256 hash;
+    GetRandBytes((unsigned char*)&hash, sizeof(hash));
+    return hash;
+}
+
+void FastRandomContext::RandomSeed()
+{
+    uint256 seed = GetRandHash();
+    rng.SetKey(seed.begin(), 32);
+    requires_seed = false;
+}
+
+FastRandomContext::FastRandomContext(const uint256& seed) : requires_seed(false), bytebuf_size(0), bitbuf_size(0)
+{
+    rng.SetKey(seed.begin(), 32);
+}
+
+int GenIdentity(int n)
+{
+    return n-1;
+}
+
+FastRandomContext::FastRandomContext(bool fDeterministic) : requires_seed(!fDeterministic), bytebuf_size(0), bitbuf_size(0)
+{
+    if (!fDeterministic) {
+        return;
+    }
+    uint256 seed;
+    rng.SetKey(seed.begin(), 32);
+}
diff --git a/depend/zcash/src/random.h b/depend/zcash/src/random.h
new file mode 100644
index 000000000..9c8e18951
--- /dev/null
+++ b/depend/zcash/src/random.h
@@ -0,0 +1,164 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_RANDOM_H
+#define BITCOIN_RANDOM_H
+
+#include "crypto/chacha20.h"
+#include "crypto/common.h"
+#include "uint256.h"
+
+#include <functional>
+#include <limits>
+#include <stdint.h>
+
+/**
+ * Functions to gather random data via the rand_core OsRng
+ */
+void GetRandBytes(unsigned char* buf, size_t num);
+uint64_t GetRand(uint64_t nMax);
+int GetRandInt(int nMax);
+uint256 GetRandHash();
+
+/**
+ * Implementation of a C++ Uniform Random Number Generator, backed by GetRandBytes.
+ */
+class ZcashRandomEngine
+{
+public:
+    typedef uint64_t result_type;
+
+    explicit ZcashRandomEngine() {}
+
+    static constexpr result_type min() {
+        return std::numeric_limits<result_type>::min();
+    }
+    static constexpr result_type max() {
+        return std::numeric_limits<result_type>::max();
+    }
+
+    result_type operator()() {
+        result_type nRand = 0;
+        GetRandBytes((unsigned char*)&nRand, sizeof(nRand));
+        return nRand;
+    }
+
+    double entropy() const noexcept {
+        return 0;
+    }
+};
+
+/**
+ * Identity function for MappedShuffle, so that elements retain their original order.
+ */
+ int GenIdentity(int n);
+
+/**
+ * Rearranges the elements in the range [first,first+len) randomly, assuming
+ * that gen is a uniform random number generator. Follows the same algorithm as
+ * std::shuffle in C++11 (a Durstenfeld shuffle).
+ *
+ * The elements in the range [mapFirst,mapFirst+len) are rearranged according to
+ * the same permutation, enabling the permutation to be tracked by the caller.
+ *
+ * gen takes an integer n and produces a uniform random output in [0,n).
+ */
+template <typename RandomAccessIterator, typename MapRandomAccessIterator>
+void MappedShuffle(RandomAccessIterator first,
+                   MapRandomAccessIterator mapFirst,
+                   size_t len,
+                   std::function<int(int)> gen)
+{
+    for (size_t i = len-1; i > 0; --i) {
+        auto r = gen(i+1);
+        assert(r >= 0);
+        assert(r <= i);
+        std::swap(first[i], first[r]);
+        std::swap(mapFirst[i], mapFirst[r]);
+    }
+}
+
+/**
+ * Fast randomness source. This is seeded once with secure random data, but
+ * is completely deterministic and insecure after that.
+ * This class is not thread-safe.
+ */
+class FastRandomContext {
+private:
+    bool requires_seed;
+    ChaCha20 rng;
+
+    unsigned char bytebuf[64];
+    int bytebuf_size;
+
+    uint64_t bitbuf;
+    int bitbuf_size;
+
+    void RandomSeed();
+
+    void FillByteBuffer()
+    {
+        if (requires_seed) {
+            RandomSeed();
+        }
+        rng.Output(bytebuf, sizeof(bytebuf));
+        bytebuf_size = sizeof(bytebuf);
+    }
+
+    void FillBitBuffer()
+    {
+        bitbuf = rand64();
+        bitbuf_size = 64;
+    }
+
+public:
+    explicit FastRandomContext(bool fDeterministic = false);
+
+    /** Initialize with explicit seed (only for testing) */
+    explicit FastRandomContext(const uint256& seed);
+
+    /** Generate a random 64-bit integer. */
+    uint64_t rand64()
+    {
+        if (bytebuf_size < 8) FillByteBuffer();
+        uint64_t ret = ReadLE64(bytebuf + 64 - bytebuf_size);
+        bytebuf_size -= 8;
+        return ret;
+    }
+
+    /** Generate a random (bits)-bit integer. */
+    uint64_t randbits(int bits) {
+        if (bits == 0) {
+            return 0;
+        } else if (bits > 32) {
+            return rand64() >> (64 - bits);
+        } else {
+            if (bitbuf_size < bits) FillBitBuffer();
+            uint64_t ret = bitbuf & (~(uint64_t)0 >> (64 - bits));
+            bitbuf >>= bits;
+            bitbuf_size -= bits;
+            return ret;
+        }
+    }
+
+    /** Generate a random integer in the range [0..range). */
+    uint64_t randrange(uint64_t range)
+    {
+        --range;
+        int bits = CountBits(range);
+        while (true) {
+            uint64_t ret = randbits(bits);
+            if (ret <= range) return ret;
+        }
+    }
+
+    /** Generate a random 32-bit integer. */
+    uint32_t rand32() { return randbits(32); }
+
+    /** Generate a random boolean. */
+    bool randbool() { return randbits(1); }
+};
+
+#endif // BITCOIN_RANDOM_H
diff --git a/depend/zcash/src/rest.cpp b/depend/zcash/src/rest.cpp
new file mode 100644
index 000000000..0853665ea
--- /dev/null
+++ b/depend/zcash/src/rest.cpp
@@ -0,0 +1,630 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "chainparams.h"
+#include "primitives/block.h"
+#include "primitives/transaction.h"
+#include "main.h"
+#include "httpserver.h"
+#include "rpc/server.h"
+#include "streams.h"
+#include "sync.h"
+#include "txmempool.h"
+#include "utilstrencodings.h"
+#include "version.h"
+
+#include <boost/algorithm/string.hpp>
+#include <boost/dynamic_bitset.hpp>
+
+#include <univalue.h>
+
+using namespace std;
+
+static const size_t MAX_GETUTXOS_OUTPOINTS = 15; //allow a max of 15 outpoints to be queried at once
+
+enum RetFormat {
+    RF_UNDEF,
+    RF_BINARY,
+    RF_HEX,
+    RF_JSON,
+};
+
+static const struct {
+    enum RetFormat rf;
+    const char* name;
+} rf_names[] = {
+      {RF_UNDEF, ""},
+      {RF_BINARY, "bin"},
+      {RF_HEX, "hex"},
+      {RF_JSON, "json"},
+};
+
+struct CCoin {
+    uint32_t nTxVer; // Don't call this nVersion, that name has a special meaning inside IMPLEMENT_SERIALIZE
+    uint32_t nHeight;
+    CTxOut out;
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action)
+    {
+        READWRITE(nTxVer);
+        READWRITE(nHeight);
+        READWRITE(out);
+    }
+};
+
+extern void TxToJSON(const CTransaction& tx, const uint256 hashBlock, UniValue& entry);
+extern UniValue blockToJSON(const CBlock& block, const CBlockIndex* blockindex, bool txDetails = false);
+extern UniValue mempoolInfoToJSON();
+extern UniValue mempoolToJSON(bool fVerbose = false);
+extern void ScriptPubKeyToJSON(const CScript& scriptPubKey, UniValue& out, bool fIncludeHex);
+extern UniValue blockheaderToJSON(const CBlockIndex* blockindex);
+
+static bool RESTERR(HTTPRequest* req, enum HTTPStatusCode status, string message)
+{
+    req->WriteHeader("Content-Type", "text/plain");
+    req->WriteReply(status, message + "\r\n");
+    return false;
+}
+
+static enum RetFormat ParseDataFormat(vector<string>& params, const string& strReq)
+{
+    boost::split(params, strReq, boost::is_any_of("."));
+    if (params.size() > 1) {
+        for (unsigned int i = 0; i < ARRAYLEN(rf_names); i++)
+            if (params[1] == rf_names[i].name)
+                return rf_names[i].rf;
+    }
+
+    return rf_names[0].rf;
+}
+
+static string AvailableDataFormatsString()
+{
+    string formats = "";
+    for (unsigned int i = 0; i < ARRAYLEN(rf_names); i++)
+        if (strlen(rf_names[i].name) > 0) {
+            formats.append(".");
+            formats.append(rf_names[i].name);
+            formats.append(", ");
+        }
+
+    if (formats.length() > 0)
+        return formats.substr(0, formats.length() - 2);
+
+    return formats;
+}
+
+static bool ParseHashStr(const string& strReq, uint256& v)
+{
+    if (!IsHex(strReq) || (strReq.size() != 64))
+        return false;
+
+    v.SetHex(strReq);
+    return true;
+}
+
+static bool CheckWarmup(HTTPRequest* req)
+{
+    std::string statusmessage;
+    if (RPCIsInWarmup(&statusmessage))
+         return RESTERR(req, HTTP_SERVICE_UNAVAILABLE, "Service temporarily unavailable: " + statusmessage);
+    return true;
+}
+
+static bool rest_headers(HTTPRequest* req,
+                         const std::string& strURIPart)
+{
+    if (!CheckWarmup(req))
+        return false;
+    vector<string> params;
+    const RetFormat rf = ParseDataFormat(params, strURIPart);
+    vector<string> path;
+    boost::split(path, params[0], boost::is_any_of("/"));
+
+    if (path.size() != 2)
+        return RESTERR(req, HTTP_BAD_REQUEST, "No header count specified. Use /rest/headers/<count>/<hash>.<ext>.");
+
+    long count = strtol(path[0].c_str(), NULL, 10);
+    if (count < 1 || count > 2000)
+        return RESTERR(req, HTTP_BAD_REQUEST, "Header count out of range: " + path[0]);
+
+    string hashStr = path[1];
+    uint256 hash;
+    if (!ParseHashStr(hashStr, hash))
+        return RESTERR(req, HTTP_BAD_REQUEST, "Invalid hash: " + hashStr);
+
+    std::vector<const CBlockIndex *> headers;
+    headers.reserve(count);
+    {
+        LOCK(cs_main);
+        BlockMap::const_iterator it = mapBlockIndex.find(hash);
+        const CBlockIndex *pindex = (it != mapBlockIndex.end()) ? it->second : NULL;
+        while (pindex != NULL && chainActive.Contains(pindex)) {
+            headers.push_back(pindex);
+            if (headers.size() == (unsigned long)count)
+                break;
+            pindex = chainActive.Next(pindex);
+        }
+    }
+
+    CDataStream ssHeader(SER_NETWORK, PROTOCOL_VERSION);
+    for (const CBlockIndex *pindex : headers) {
+        ssHeader << pindex->GetBlockHeader();
+    }
+
+    switch (rf) {
+    case RF_BINARY: {
+        string binaryHeader = ssHeader.str();
+        req->WriteHeader("Content-Type", "application/octet-stream");
+        req->WriteReply(HTTP_OK, binaryHeader);
+        return true;
+    }
+
+    case RF_HEX: {
+        string strHex = HexStr(ssHeader.begin(), ssHeader.end()) + "\n";
+        req->WriteHeader("Content-Type", "text/plain");
+        req->WriteReply(HTTP_OK, strHex);
+        return true;
+    }
+    case RF_JSON: {
+        UniValue jsonHeaders(UniValue::VARR);
+        {
+            LOCK(cs_main);
+            for (const CBlockIndex *pindex : headers) {
+                jsonHeaders.push_back(blockheaderToJSON(pindex));
+            }
+        }
+        string strJSON = jsonHeaders.write() + "\n";
+        req->WriteHeader("Content-Type", "application/json");
+        req->WriteReply(HTTP_OK, strJSON);
+        return true;
+    }
+    default: {
+        return RESTERR(req, HTTP_NOT_FOUND, "output format not found (available: .bin, .hex)");
+    }
+    }
+
+    // not reached
+    return true; // continue to process further HTTP reqs on this cxn
+}
+
+static bool rest_block(HTTPRequest* req,
+                       const std::string& strURIPart,
+                       bool showTxDetails)
+{
+    if (!CheckWarmup(req))
+        return false;
+    vector<string> params;
+    const RetFormat rf = ParseDataFormat(params, strURIPart);
+
+    string hashStr = params[0];
+    uint256 hash;
+    if (!ParseHashStr(hashStr, hash))
+        return RESTERR(req, HTTP_BAD_REQUEST, "Invalid hash: " + hashStr);
+
+    CBlock block;
+    CBlockIndex* pblockindex = NULL;
+    {
+        LOCK(cs_main);
+        if (mapBlockIndex.count(hash) == 0)
+            return RESTERR(req, HTTP_NOT_FOUND, hashStr + " not found");
+
+        pblockindex = mapBlockIndex[hash];
+        if (fHavePruned && !(pblockindex->nStatus & BLOCK_HAVE_DATA) && pblockindex->nTx > 0)
+            return RESTERR(req, HTTP_NOT_FOUND, hashStr + " not available (pruned data)");
+
+        if (!ReadBlockFromDisk(block, pblockindex, Params().GetConsensus()))
+            return RESTERR(req, HTTP_NOT_FOUND, hashStr + " not found");
+    }
+
+    CDataStream ssBlock(SER_NETWORK, PROTOCOL_VERSION);
+    ssBlock << block;
+
+    switch (rf) {
+    case RF_BINARY: {
+        string binaryBlock = ssBlock.str();
+        req->WriteHeader("Content-Type", "application/octet-stream");
+        req->WriteReply(HTTP_OK, binaryBlock);
+        return true;
+    }
+
+    case RF_HEX: {
+        string strHex = HexStr(ssBlock.begin(), ssBlock.end()) + "\n";
+        req->WriteHeader("Content-Type", "text/plain");
+        req->WriteReply(HTTP_OK, strHex);
+        return true;
+    }
+
+    case RF_JSON: {
+        UniValue objBlock;
+        {
+            LOCK(cs_main);
+            objBlock = blockToJSON(block, pblockindex, showTxDetails);
+        }
+        string strJSON = objBlock.write() + "\n";
+        req->WriteHeader("Content-Type", "application/json");
+        req->WriteReply(HTTP_OK, strJSON);
+        return true;
+    }
+
+    default: {
+        return RESTERR(req, HTTP_NOT_FOUND, "output format not found (available: " + AvailableDataFormatsString() + ")");
+    }
+    }
+
+    // not reached
+    return true; // continue to process further HTTP reqs on this cxn
+}
+
+static bool rest_block_extended(HTTPRequest* req, const std::string& strURIPart)
+{
+    return rest_block(req, strURIPart, true);
+}
+
+static bool rest_block_notxdetails(HTTPRequest* req, const std::string& strURIPart)
+{
+    return rest_block(req, strURIPart, false);
+}
+
+// A bit of a hack - dependency on a function defined in rpc/blockchain.cpp
+UniValue getblockchaininfo(const UniValue& params, bool fHelp);
+
+static bool rest_chaininfo(HTTPRequest* req, const std::string& strURIPart)
+{
+    if (!CheckWarmup(req))
+        return false;
+    vector<string> params;
+    const RetFormat rf = ParseDataFormat(params, strURIPart);
+
+    switch (rf) {
+    case RF_JSON: {
+        UniValue rpcParams(UniValue::VARR);
+        UniValue chainInfoObject = getblockchaininfo(rpcParams, false);
+        string strJSON = chainInfoObject.write() + "\n";
+        req->WriteHeader("Content-Type", "application/json");
+        req->WriteReply(HTTP_OK, strJSON);
+        return true;
+    }
+    default: {
+        return RESTERR(req, HTTP_NOT_FOUND, "output format not found (available: json)");
+    }
+    }
+
+    // not reached
+    return true; // continue to process further HTTP reqs on this cxn
+}
+
+static bool rest_mempool_info(HTTPRequest* req, const std::string& strURIPart)
+{
+    if (!CheckWarmup(req))
+        return false;
+    vector<string> params;
+    const RetFormat rf = ParseDataFormat(params, strURIPart);
+
+    switch (rf) {
+    case RF_JSON: {
+        UniValue mempoolInfoObject = mempoolInfoToJSON();
+
+        string strJSON = mempoolInfoObject.write() + "\n";
+        req->WriteHeader("Content-Type", "application/json");
+        req->WriteReply(HTTP_OK, strJSON);
+        return true;
+    }
+    default: {
+        return RESTERR(req, HTTP_NOT_FOUND, "output format not found (available: json)");
+    }
+    }
+
+    // not reached
+    return true; // continue to process further HTTP reqs on this cxn
+}
+
+static bool rest_mempool_contents(HTTPRequest* req, const std::string& strURIPart)
+{
+    if (!CheckWarmup(req))
+        return false;
+    vector<string> params;
+    const RetFormat rf = ParseDataFormat(params, strURIPart);
+
+    switch (rf) {
+    case RF_JSON: {
+        UniValue mempoolObject = mempoolToJSON(true);
+
+        string strJSON = mempoolObject.write() + "\n";
+        req->WriteHeader("Content-Type", "application/json");
+        req->WriteReply(HTTP_OK, strJSON);
+        return true;
+    }
+    default: {
+        return RESTERR(req, HTTP_NOT_FOUND, "output format not found (available: json)");
+    }
+    }
+
+    // not reached
+    return true; // continue to process further HTTP reqs on this cxn
+}
+
+static bool rest_tx(HTTPRequest* req, const std::string& strURIPart)
+{
+    if (!CheckWarmup(req))
+        return false;
+    vector<string> params;
+    const RetFormat rf = ParseDataFormat(params, strURIPart);
+
+    string hashStr = params[0];
+    uint256 hash;
+    if (!ParseHashStr(hashStr, hash))
+        return RESTERR(req, HTTP_BAD_REQUEST, "Invalid hash: " + hashStr);
+
+    CTransaction tx;
+    uint256 hashBlock = uint256();
+    if (!GetTransaction(hash, tx, Params().GetConsensus(), hashBlock, true))
+        return RESTERR(req, HTTP_NOT_FOUND, hashStr + " not found");
+
+    CDataStream ssTx(SER_NETWORK, PROTOCOL_VERSION);
+    ssTx << tx;
+
+    switch (rf) {
+    case RF_BINARY: {
+        string binaryTx = ssTx.str();
+        req->WriteHeader("Content-Type", "application/octet-stream");
+        req->WriteReply(HTTP_OK, binaryTx);
+        return true;
+    }
+
+    case RF_HEX: {
+        string strHex = HexStr(ssTx.begin(), ssTx.end()) + "\n";
+        req->WriteHeader("Content-Type", "text/plain");
+        req->WriteReply(HTTP_OK, strHex);
+        return true;
+    }
+
+    case RF_JSON: {
+        UniValue objTx(UniValue::VOBJ);
+        TxToJSON(tx, hashBlock, objTx);
+        string strJSON = objTx.write() + "\n";
+        req->WriteHeader("Content-Type", "application/json");
+        req->WriteReply(HTTP_OK, strJSON);
+        return true;
+    }
+
+    default: {
+        return RESTERR(req, HTTP_NOT_FOUND, "output format not found (available: " + AvailableDataFormatsString() + ")");
+    }
+    }
+
+    // not reached
+    return true; // continue to process further HTTP reqs on this cxn
+}
+
+static bool rest_getutxos(HTTPRequest* req, const std::string& strURIPart)
+{
+    if (!CheckWarmup(req))
+        return false;
+    vector<string> params;
+    enum RetFormat rf = ParseDataFormat(params, strURIPart);
+
+    vector<string> uriParts;
+    if (params.size() > 0 && params[0].length() > 1)
+    {
+        std::string strUriParams = params[0].substr(1);
+        boost::split(uriParts, strUriParams, boost::is_any_of("/"));
+    }
+
+    // throw exception in case of an empty request
+    std::string strRequestMutable = req->ReadBody();
+    if (strRequestMutable.length() == 0 && uriParts.size() == 0)
+        return RESTERR(req, HTTP_INTERNAL_SERVER_ERROR, "Error: empty request");
+
+    bool fInputParsed = false;
+    bool fCheckMemPool = false;
+    vector<COutPoint> vOutPoints;
+
+    // parse/deserialize input
+    // input-format = output-format, rest/getutxos/bin requires binary input, gives binary output, ...
+
+    if (uriParts.size() > 0)
+    {
+
+        //inputs is sent over URI scheme (/rest/getutxos/checkmempool/txid1-n/txid2-n/...)
+        if (uriParts.size() > 0 && uriParts[0] == "checkmempool")
+            fCheckMemPool = true;
+
+        for (size_t i = (fCheckMemPool) ? 1 : 0; i < uriParts.size(); i++)
+        {
+            uint256 txid;
+            int32_t nOutput;
+            std::string strTxid = uriParts[i].substr(0, uriParts[i].find("-"));
+            std::string strOutput = uriParts[i].substr(uriParts[i].find("-")+1);
+
+            if (!ParseInt32(strOutput, &nOutput) || !IsHex(strTxid))
+                return RESTERR(req, HTTP_INTERNAL_SERVER_ERROR, "Parse error");
+
+            txid.SetHex(strTxid);
+            vOutPoints.push_back(COutPoint(txid, (uint32_t)nOutput));
+        }
+
+        if (vOutPoints.size() > 0)
+            fInputParsed = true;
+        else
+            return RESTERR(req, HTTP_INTERNAL_SERVER_ERROR, "Error: empty request");
+    }
+
+    switch (rf) {
+    case RF_HEX: {
+        // convert hex to bin, continue then with bin part
+        std::vector<unsigned char> strRequestV = ParseHex(strRequestMutable);
+        strRequestMutable.assign(strRequestV.begin(), strRequestV.end());
+    }
+
+    case RF_BINARY: {
+        try {
+            //deserialize only if user sent a request
+            if (strRequestMutable.size() > 0)
+            {
+                if (fInputParsed) //don't allow sending input over URI and HTTP RAW DATA
+                    return RESTERR(req, HTTP_INTERNAL_SERVER_ERROR, "Combination of URI scheme inputs and raw post data is not allowed");
+
+                CDataStream oss(SER_NETWORK, PROTOCOL_VERSION);
+                oss << strRequestMutable;
+                oss >> fCheckMemPool;
+                oss >> vOutPoints;
+            }
+        } catch (const std::ios_base::failure& e) {
+            // abort in case of unreadable binary data
+            return RESTERR(req, HTTP_INTERNAL_SERVER_ERROR, "Parse error");
+        }
+        break;
+    }
+
+    case RF_JSON: {
+        if (!fInputParsed)
+            return RESTERR(req, HTTP_INTERNAL_SERVER_ERROR, "Error: empty request");
+        break;
+    }
+    default: {
+        return RESTERR(req, HTTP_NOT_FOUND, "output format not found (available: " + AvailableDataFormatsString() + ")");
+    }
+    }
+
+    // limit max outpoints
+    if (vOutPoints.size() > MAX_GETUTXOS_OUTPOINTS)
+        return RESTERR(req, HTTP_INTERNAL_SERVER_ERROR, strprintf("Error: max outpoints exceeded (max: %d, tried: %d)", MAX_GETUTXOS_OUTPOINTS, vOutPoints.size()));
+
+    // check spentness and form a bitmap (as well as a JSON capable human-readable string representation)
+    vector<unsigned char> bitmap;
+    vector<CCoin> outs;
+    std::string bitmapStringRepresentation;
+    boost::dynamic_bitset<unsigned char> hits(vOutPoints.size());
+    {
+        LOCK2(cs_main, mempool.cs);
+
+        CCoinsView viewDummy;
+        CCoinsViewCache view(&viewDummy);
+
+        CCoinsViewCache& viewChain = *pcoinsTip;
+        CCoinsViewMemPool viewMempool(&viewChain, mempool);
+
+        if (fCheckMemPool)
+            view.SetBackend(viewMempool); // switch cache backend to db+mempool in case user likes to query mempool
+
+        for (size_t i = 0; i < vOutPoints.size(); i++) {
+            CCoins coins;
+            uint256 hash = vOutPoints[i].hash;
+            if (view.GetCoins(hash, coins)) {
+                mempool.pruneSpent(hash, coins);
+                if (coins.IsAvailable(vOutPoints[i].n)) {
+                    hits[i] = true;
+                    // Safe to index into vout here because IsAvailable checked if it's off the end of the array, or if
+                    // n is valid but points to an already spent output (IsNull).
+                    CCoin coin;
+                    coin.nTxVer = coins.nVersion;
+                    coin.nHeight = coins.nHeight;
+                    coin.out = coins.vout.at(vOutPoints[i].n);
+                    assert(!coin.out.IsNull());
+                    outs.push_back(coin);
+                }
+            }
+
+            bitmapStringRepresentation.append(hits[i] ? "1" : "0"); // form a binary string representation (human-readable for json output)
+        }
+    }
+    boost::to_block_range(hits, std::back_inserter(bitmap));
+
+    switch (rf) {
+    case RF_BINARY: {
+        // serialize data
+        // use exact same output as mentioned in Bip64
+        CDataStream ssGetUTXOResponse(SER_NETWORK, PROTOCOL_VERSION);
+        ssGetUTXOResponse << chainActive.Height() << chainActive.Tip()->GetBlockHash() << bitmap << outs;
+        string ssGetUTXOResponseString = ssGetUTXOResponse.str();
+
+        req->WriteHeader("Content-Type", "application/octet-stream");
+        req->WriteReply(HTTP_OK, ssGetUTXOResponseString);
+        return true;
+    }
+
+    case RF_HEX: {
+        CDataStream ssGetUTXOResponse(SER_NETWORK, PROTOCOL_VERSION);
+        ssGetUTXOResponse << chainActive.Height() << chainActive.Tip()->GetBlockHash() << bitmap << outs;
+        string strHex = HexStr(ssGetUTXOResponse.begin(), ssGetUTXOResponse.end()) + "\n";
+
+        req->WriteHeader("Content-Type", "text/plain");
+        req->WriteReply(HTTP_OK, strHex);
+        return true;
+    }
+
+    case RF_JSON: {
+        UniValue objGetUTXOResponse(UniValue::VOBJ);
+
+        // pack in some essentials
+        // use more or less the same output as mentioned in Bip64
+        objGetUTXOResponse.pushKV("chainHeight", chainActive.Height());
+        objGetUTXOResponse.pushKV("chaintipHash", chainActive.Tip()->GetBlockHash().GetHex());
+        objGetUTXOResponse.pushKV("bitmap", bitmapStringRepresentation);
+
+        UniValue utxos(UniValue::VARR);
+        for (const CCoin& coin : outs) {
+            UniValue utxo(UniValue::VOBJ);
+            utxo.pushKV("txvers", (int32_t)coin.nTxVer);
+            utxo.pushKV("height", (int32_t)coin.nHeight);
+            utxo.pushKV("value", ValueFromAmount(coin.out.nValue));
+
+            // include the script in a json output
+            UniValue o(UniValue::VOBJ);
+            ScriptPubKeyToJSON(coin.out.scriptPubKey, o, true);
+            utxo.pushKV("scriptPubKey", o);
+            utxos.push_back(utxo);
+        }
+        objGetUTXOResponse.pushKV("utxos", utxos);
+
+        // return json string
+        string strJSON = objGetUTXOResponse.write() + "\n";
+        req->WriteHeader("Content-Type", "application/json");
+        req->WriteReply(HTTP_OK, strJSON);
+        return true;
+    }
+    default: {
+        return RESTERR(req, HTTP_NOT_FOUND, "output format not found (available: " + AvailableDataFormatsString() + ")");
+    }
+    }
+
+    // not reached
+    return true; // continue to process further HTTP reqs on this cxn
+}
+
+static const struct {
+    const char* prefix;
+    bool (*handler)(HTTPRequest* req, const std::string& strReq);
+} uri_prefixes[] = {
+      {"/rest/tx/", rest_tx},
+      {"/rest/block/notxdetails/", rest_block_notxdetails},
+      {"/rest/block/", rest_block_extended},
+      {"/rest/chaininfo", rest_chaininfo},
+      {"/rest/mempool/info", rest_mempool_info},
+      {"/rest/mempool/contents", rest_mempool_contents},
+      {"/rest/headers/", rest_headers},
+      {"/rest/getutxos", rest_getutxos},
+};
+
+bool StartREST()
+{
+    for (unsigned int i = 0; i < ARRAYLEN(uri_prefixes); i++)
+        RegisterHTTPHandler(uri_prefixes[i].prefix, false, uri_prefixes[i].handler);
+    return true;
+}
+
+void InterruptREST()
+{
+}
+
+void StopREST()
+{
+    for (unsigned int i = 0; i < ARRAYLEN(uri_prefixes); i++)
+        UnregisterHTTPHandler(uri_prefixes[i].prefix, false);
+}
diff --git a/depend/zcash/src/reverse_iterator.h b/depend/zcash/src/reverse_iterator.h
new file mode 100644
index 000000000..409f895ce
--- /dev/null
+++ b/depend/zcash/src/reverse_iterator.h
@@ -0,0 +1,39 @@
+// Taken from https://gist.github.com/arvidsson/7231973
+
+#ifndef BITCOIN_REVERSE_ITERATOR_HPP
+#define BITCOIN_REVERSE_ITERATOR_HPP
+
+/**
+ * Template used for reverse iteration in C++11 range-based for loops.
+ * 
+ *   std::vector<int> v = {1, 2, 3, 4, 5};
+ *   for (auto x : reverse_iterate(v))
+ *       std::cout << x << " ";
+ */
+
+template <typename T>
+class reverse_range
+{
+    T &x;
+    
+public:
+    reverse_range(T &x) : x(x) {}
+    
+    auto begin() const -> decltype(this->x.rbegin())
+    {
+        return x.rbegin();
+    }
+    
+    auto end() const -> decltype(this->x.rend())
+    {
+        return x.rend();
+    }
+};
+ 
+template <typename T>
+reverse_range<T> reverse_iterate(T &x)
+{
+    return reverse_range<T>(x);
+}
+
+#endif // BITCOIN_REVERSE_ITERATOR_HPP
diff --git a/depend/zcash/src/reverselock.h b/depend/zcash/src/reverselock.h
new file mode 100644
index 000000000..7c0131f35
--- /dev/null
+++ b/depend/zcash/src/reverselock.h
@@ -0,0 +1,34 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_REVERSELOCK_H
+#define BITCOIN_REVERSELOCK_H
+
+/**
+ * An RAII-style reverse lock. Unlocks on construction and locks on destruction.
+ */
+template<typename Lock>
+class reverse_lock
+{
+public:
+
+    explicit reverse_lock(Lock& _lock) : lock(_lock) {
+        _lock.unlock();
+        _lock.swap(templock);
+    }
+
+    ~reverse_lock() {
+        templock.lock();
+        templock.swap(lock);
+    }
+
+private:
+    reverse_lock(reverse_lock const&);
+    reverse_lock& operator=(reverse_lock const&);
+
+    Lock& lock;
+    Lock templock;
+};
+
+#endif // BITCOIN_REVERSELOCK_H
diff --git a/depend/zcash/src/rpc/blockchain.cpp b/depend/zcash/src/rpc/blockchain.cpp
new file mode 100644
index 000000000..297402198
--- /dev/null
+++ b/depend/zcash/src/rpc/blockchain.cpp
@@ -0,0 +1,1508 @@
+// Copyright (c) 2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "amount.h"
+#include "chain.h"
+#include "chainparams.h"
+#include "checkpoints.h"
+#include "consensus/validation.h"
+#include "experimental_features.h"
+#include "key_io.h"
+#include "main.h"
+#include "metrics.h"
+#include "primitives/transaction.h"
+#include "rpc/server.h"
+#include "streams.h"
+#include "sync.h"
+#include "util.h"
+
+#include <stdint.h>
+
+#include <univalue.h>
+
+#include <optional>
+#include <regex>
+
+using namespace std;
+
+extern void TxToJSON(const CTransaction& tx, const uint256 hashBlock, UniValue& entry);
+void ScriptPubKeyToJSON(const CScript& scriptPubKey, UniValue& out, bool fIncludeHex);
+
+double GetDifficultyINTERNAL(const CBlockIndex* blockindex, bool networkDifficulty)
+{
+    // Floating point number that is a multiple of the minimum difficulty,
+    // minimum difficulty = 1.0.
+    if (blockindex == NULL)
+    {
+        if (chainActive.Tip() == NULL)
+            return 1.0;
+        else
+            blockindex = chainActive.Tip();
+    }
+
+    uint32_t bits;
+    if (networkDifficulty) {
+        bits = GetNextWorkRequired(blockindex, nullptr, Params().GetConsensus());
+    } else {
+        bits = blockindex->nBits;
+    }
+
+    uint32_t powLimit =
+        UintToArith256(Params().GetConsensus().powLimit).GetCompact();
+    int nShift = (bits >> 24) & 0xff;
+    int nShiftAmount = (powLimit >> 24) & 0xff;
+
+    double dDiff =
+        (double)(powLimit & 0x00ffffff) /
+        (double)(bits & 0x00ffffff);
+
+    while (nShift < nShiftAmount)
+    {
+        dDiff *= 256.0;
+        nShift++;
+    }
+    while (nShift > nShiftAmount)
+    {
+        dDiff /= 256.0;
+        nShift--;
+    }
+
+    return dDiff;
+}
+
+double GetDifficulty(const CBlockIndex* blockindex)
+{
+    return GetDifficultyINTERNAL(blockindex, false);
+}
+
+double GetNetworkDifficulty(const CBlockIndex* blockindex)
+{
+    return GetDifficultyINTERNAL(blockindex, true);
+}
+
+static UniValue ValuePoolDesc(
+    const std::string &name,
+    const std::optional<CAmount> chainValue,
+    const std::optional<CAmount> valueDelta)
+{
+    UniValue rv(UniValue::VOBJ);
+    rv.pushKV("id", name);
+    rv.pushKV("monitored", (bool)chainValue);
+    if (chainValue) {
+        rv.pushKV("chainValue", ValueFromAmount(*chainValue));
+        rv.pushKV("chainValueZat", *chainValue);
+    }
+    if (valueDelta) {
+        rv.pushKV("valueDelta", ValueFromAmount(*valueDelta));
+        rv.pushKV("valueDeltaZat", *valueDelta);
+    }
+    return rv;
+}
+
+UniValue blockheaderToJSON(const CBlockIndex* blockindex)
+{
+    AssertLockHeld(cs_main);
+    UniValue result(UniValue::VOBJ);
+    result.pushKV("hash", blockindex->GetBlockHash().GetHex());
+    int confirmations = -1;
+    // Only report confirmations if the block is on the main chain
+    if (chainActive.Contains(blockindex))
+        confirmations = chainActive.Height() - blockindex->nHeight + 1;
+    result.pushKV("confirmations", confirmations);
+    result.pushKV("height", blockindex->nHeight);
+    result.pushKV("version", blockindex->nVersion);
+    result.pushKV("merkleroot", blockindex->hashMerkleRoot.GetHex());
+    result.pushKV("finalsaplingroot", blockindex->hashFinalSaplingRoot.GetHex());
+    result.pushKV("time", (int64_t)blockindex->nTime);
+    result.pushKV("nonce", blockindex->nNonce.GetHex());
+    result.pushKV("solution", HexStr(blockindex->nSolution));
+    result.pushKV("bits", strprintf("%08x", blockindex->nBits));
+    result.pushKV("difficulty", GetDifficulty(blockindex));
+    result.pushKV("chainwork", blockindex->nChainWork.GetHex());
+
+    if (blockindex->pprev)
+        result.pushKV("previousblockhash", blockindex->pprev->GetBlockHash().GetHex());
+    CBlockIndex *pnext = chainActive.Next(blockindex);
+    if (pnext)
+        result.pushKV("nextblockhash", pnext->GetBlockHash().GetHex());
+    return result;
+}
+
+// insightexplorer
+UniValue blockToDeltasJSON(const CBlock& block, const CBlockIndex* blockindex)
+{
+    UniValue result(UniValue::VOBJ);
+    result.pushKV("hash", block.GetHash().GetHex());
+    // Only report confirmations if the block is on the main chain
+    if (!chainActive.Contains(blockindex))
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Block is an orphan");
+    int confirmations = chainActive.Height() - blockindex->nHeight + 1;
+    result.pushKV("confirmations", confirmations);
+    result.pushKV("size", (int)::GetSerializeSize(block, SER_NETWORK, PROTOCOL_VERSION));
+    result.pushKV("height", blockindex->nHeight);
+    result.pushKV("version", block.nVersion);
+    result.pushKV("merkleroot", block.hashMerkleRoot.GetHex());
+
+    KeyIO keyIO(Params());
+    UniValue deltas(UniValue::VARR);
+    for (unsigned int i = 0; i < block.vtx.size(); i++) {
+        const CTransaction &tx = block.vtx[i];
+        const uint256 txhash = tx.GetHash();
+
+        UniValue entry(UniValue::VOBJ);
+        entry.pushKV("txid", txhash.GetHex());
+        entry.pushKV("index", (int)i);
+
+        UniValue inputs(UniValue::VARR);
+        if (!tx.IsCoinBase()) {
+            for (size_t j = 0; j < tx.vin.size(); j++) {
+                const CTxIn input = tx.vin[j];
+                UniValue delta(UniValue::VOBJ);
+                CSpentIndexValue spentInfo;
+                CSpentIndexKey spentKey(input.prevout.hash, input.prevout.n);
+
+                if (!GetSpentIndex(spentKey, spentInfo)) {
+                    throw JSONRPCError(RPC_INTERNAL_ERROR, "Spent information not available");
+                }
+                CTxDestination dest = DestFromAddressHash(spentInfo.addressType, spentInfo.addressHash);
+                if (IsValidDestination(dest)) {
+                    delta.pushKV("address", keyIO.EncodeDestination(dest));
+                }
+                delta.pushKV("satoshis", -1 * spentInfo.satoshis);
+                delta.pushKV("index", (int)j);
+                delta.pushKV("prevtxid", input.prevout.hash.GetHex());
+                delta.pushKV("prevout", (int)input.prevout.n);
+
+                inputs.push_back(delta);
+            }
+        }
+        entry.pushKV("inputs", inputs);
+
+        UniValue outputs(UniValue::VARR);
+        for (unsigned int k = 0; k < tx.vout.size(); k++) {
+            const CTxOut &out = tx.vout[k];
+            UniValue delta(UniValue::VOBJ);
+            const uint160 addrhash = out.scriptPubKey.AddressHash();
+            CTxDestination dest;
+
+            if (out.scriptPubKey.IsPayToScriptHash()) {
+                dest = CScriptID(addrhash);
+            } else if (out.scriptPubKey.IsPayToPublicKeyHash()) {
+                dest = CKeyID(addrhash);
+            }
+            if (IsValidDestination(dest)) {
+                delta.pushKV("address", keyIO.EncodeDestination(dest));
+            }
+            delta.pushKV("satoshis", out.nValue);
+            delta.pushKV("index", (int)k);
+
+            outputs.push_back(delta);
+        }
+        entry.pushKV("outputs", outputs);
+        deltas.push_back(entry);
+    }
+    result.pushKV("deltas", deltas);
+    result.pushKV("time", block.GetBlockTime());
+    result.pushKV("mediantime", (int64_t)blockindex->GetMedianTimePast());
+    result.pushKV("nonce", block.nNonce.GetHex());
+    result.pushKV("bits", strprintf("%08x", block.nBits));
+    result.pushKV("difficulty", GetDifficulty(blockindex));
+    result.pushKV("chainwork", blockindex->nChainWork.GetHex());
+
+    if (blockindex->pprev)
+        result.pushKV("previousblockhash", blockindex->pprev->GetBlockHash().GetHex());
+    CBlockIndex *pnext = chainActive.Next(blockindex);
+    if (pnext)
+        result.pushKV("nextblockhash", pnext->GetBlockHash().GetHex());
+    return result;
+}
+
+UniValue blockToJSON(const CBlock& block, const CBlockIndex* blockindex, bool txDetails = false)
+{
+    AssertLockHeld(cs_main);
+    bool nu5Active = Params().GetConsensus().NetworkUpgradeActive(
+        blockindex->nHeight, Consensus::UPGRADE_NU5);
+
+    UniValue result(UniValue::VOBJ);
+    result.pushKV("hash", block.GetHash().GetHex());
+    int confirmations = -1;
+    // Only report confirmations if the block is on the main chain
+    if (chainActive.Contains(blockindex))
+        confirmations = chainActive.Height() - blockindex->nHeight + 1;
+    result.pushKV("confirmations", confirmations);
+    result.pushKV("size", (int)::GetSerializeSize(block, SER_NETWORK, PROTOCOL_VERSION));
+    result.pushKV("height", blockindex->nHeight);
+    result.pushKV("version", block.nVersion);
+    result.pushKV("merkleroot", block.hashMerkleRoot.GetHex());
+    result.pushKV("blockcommitments", blockindex->hashBlockCommitments.GetHex());
+    result.pushKV("authdataroot", blockindex->hashAuthDataRoot.GetHex());
+    result.pushKV("finalsaplingroot", blockindex->hashFinalSaplingRoot.GetHex());
+    if (nu5Active) {
+        result.pushKV("finalorchardroot", blockindex->hashFinalOrchardRoot.GetHex());
+    }
+    result.pushKV("chainhistoryroot", blockindex->hashChainHistoryRoot.GetHex());
+    UniValue txs(UniValue::VARR);
+    for (const CTransaction&tx : block.vtx)
+    {
+        if(txDetails)
+        {
+            UniValue objTx(UniValue::VOBJ);
+            TxToJSON(tx, uint256(), objTx);
+            txs.push_back(objTx);
+        }
+        else
+            txs.push_back(tx.GetHash().GetHex());
+    }
+    result.pushKV("tx", txs);
+    result.pushKV("time", block.GetBlockTime());
+    result.pushKV("nonce", block.nNonce.GetHex());
+    result.pushKV("solution", HexStr(block.nSolution));
+    result.pushKV("bits", strprintf("%08x", block.nBits));
+    result.pushKV("difficulty", GetDifficulty(blockindex));
+    result.pushKV("chainwork", blockindex->nChainWork.GetHex());
+    result.pushKV("anchor", blockindex->hashFinalSproutRoot.GetHex());
+
+    UniValue valuePools(UniValue::VARR);
+    valuePools.push_back(ValuePoolDesc("sprout", blockindex->nChainSproutValue, blockindex->nSproutValue));
+    valuePools.push_back(ValuePoolDesc("sapling", blockindex->nChainSaplingValue, blockindex->nSaplingValue));
+    valuePools.push_back(ValuePoolDesc("orchard", blockindex->nChainOrchardValue, blockindex->nOrchardValue));
+    result.pushKV("valuePools", valuePools);
+
+    if (blockindex->pprev)
+        result.pushKV("previousblockhash", blockindex->pprev->GetBlockHash().GetHex());
+    CBlockIndex *pnext = chainActive.Next(blockindex);
+    if (pnext)
+        result.pushKV("nextblockhash", pnext->GetBlockHash().GetHex());
+    return result;
+}
+
+UniValue getblockcount(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 0)
+        throw runtime_error(
+            "getblockcount\n"
+            "\nReturns the number of blocks in the best valid block chain.\n"
+            "\nResult:\n"
+            "n    (numeric) The current block count\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getblockcount", "")
+            + HelpExampleRpc("getblockcount", "")
+        );
+
+    LOCK(cs_main);
+    return chainActive.Height();
+}
+
+UniValue getbestblockhash(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 0)
+        throw runtime_error(
+            "getbestblockhash\n"
+            "\nReturns the hash of the best (tip) block in the longest block chain.\n"
+            "\nResult\n"
+            "\"hex\"      (string) the block hash hex encoded\n"
+            "\nExamples\n"
+            + HelpExampleCli("getbestblockhash", "")
+            + HelpExampleRpc("getbestblockhash", "")
+        );
+
+    LOCK(cs_main);
+    return chainActive.Tip()->GetBlockHash().GetHex();
+}
+
+UniValue getdifficulty(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 0)
+        throw runtime_error(
+            "getdifficulty\n"
+            "\nReturns the proof-of-work difficulty as a multiple of the minimum difficulty.\n"
+            "\nResult:\n"
+            "n.nnn       (numeric) the proof-of-work difficulty as a multiple of the minimum difficulty.\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getdifficulty", "")
+            + HelpExampleRpc("getdifficulty", "")
+        );
+
+    LOCK(cs_main);
+    return GetNetworkDifficulty();
+}
+
+UniValue mempoolToJSON(bool fVerbose = false)
+{
+    if (fVerbose)
+    {
+        LOCK(mempool.cs);
+        UniValue o(UniValue::VOBJ);
+        for (const CTxMemPoolEntry& e : mempool.mapTx)
+        {
+            const uint256& hash = e.GetTx().GetHash();
+            UniValue info(UniValue::VOBJ);
+            info.pushKV("size", (int)e.GetTxSize());
+            info.pushKV("fee", ValueFromAmount(e.GetFee()));
+            info.pushKV("modifiedfee", ValueFromAmount(e.GetModifiedFee()));
+            info.pushKV("time", e.GetTime());
+            info.pushKV("height", (int)e.GetHeight());
+            info.pushKV("startingpriority", e.GetPriority(e.GetHeight()));
+            info.pushKV("currentpriority", e.GetPriority(chainActive.Height()));
+            const CTransaction& tx = e.GetTx();
+            set<string> setDepends;
+            for (const CTxIn& txin : tx.vin)
+            {
+                if (mempool.exists(txin.prevout.hash))
+                    setDepends.insert(txin.prevout.hash.ToString());
+            }
+
+            UniValue depends(UniValue::VARR);
+            for (const string& dep : setDepends)
+            {
+                depends.push_back(dep);
+            }
+
+            info.pushKV("depends", depends);
+            o.pushKV(hash.ToString(), info);
+        }
+        return o;
+    }
+    else
+    {
+        vector<uint256> vtxid;
+        mempool.queryHashes(vtxid);
+
+        UniValue a(UniValue::VARR);
+        for (const uint256& hash : vtxid)
+            a.push_back(hash.ToString());
+
+        return a;
+    }
+}
+
+UniValue getrawmempool(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() > 1)
+        throw runtime_error(
+            "getrawmempool ( verbose )\n"
+            "\nReturns all transaction ids in memory pool as a json array of string transaction ids.\n"
+            "\nArguments:\n"
+            "1. verbose           (boolean, optional, default=false) true for a json object, false for array of transaction ids\n"
+            "\nResult: (for verbose = false):\n"
+            "[                     (json array of string)\n"
+            "  \"transactionid\"     (string) The transaction id\n"
+            "  ,...\n"
+            "]\n"
+            "\nResult: (for verbose = true):\n"
+            "{                           (json object)\n"
+            "  \"transactionid\" : {       (json object)\n"
+            "    \"size\" : n,             (numeric) transaction size in bytes\n"
+            "    \"fee\" : n,              (numeric) transaction fee in " + CURRENCY_UNIT + "\n"
+            "    \"modifiedfee\" : n,      (numeric) transaction fee with fee deltas used for mining priority\n"
+            "    \"time\" : n,             (numeric) local time transaction entered pool in seconds since 1 Jan 1970 GMT\n"
+            "    \"height\" : n,           (numeric) block height when transaction entered pool\n"
+            "    \"startingpriority\" : n, (numeric) priority when transaction entered pool\n"
+            "    \"currentpriority\" : n,  (numeric) transaction priority now\n"
+            "    \"depends\" : [           (array) unconfirmed transactions used as inputs for this transaction\n"
+            "        \"transactionid\",    (string) parent transaction id\n"
+            "       ... ]\n"
+            "  }, ...\n"
+            "}\n"
+            "\nExamples\n"
+            + HelpExampleCli("getrawmempool", "true")
+            + HelpExampleRpc("getrawmempool", "true")
+        );
+
+    LOCK(cs_main);
+
+    bool fVerbose = false;
+    if (params.size() > 0)
+        fVerbose = params[0].get_bool();
+
+    return mempoolToJSON(fVerbose);
+}
+
+// insightexplorer
+UniValue getblockdeltas(const UniValue& params, bool fHelp)
+{
+    std::string disabledMsg = "";
+    if (!(fExperimentalInsightExplorer || fExperimentalLightWalletd)) {
+        disabledMsg = experimentalDisabledHelpMsg("getblockdeltas", {"insightexplorer", "lightwalletd"});
+    }
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "getblockdeltas \"blockhash\"\n"
+            "\nReturns information about the given block and its transactions.\n"
+            + disabledMsg +
+            "\nArguments:\n"
+            "1. \"hash\"          (string, required) The block hash\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"hash\": \"hash\",              (string) block ID\n"
+            "  \"confirmations\": n,          (numeric) number of confirmations\n"
+            "  \"size\": n,                   (numeric) block size in bytes\n"
+            "  \"height\": n,                 (numeric) block height\n"
+            "  \"version\": n,                (numeric) block version (e.g. 4)\n"
+            "  \"merkleroot\": \"hash\",        (hexstring) block Merkle root\n"
+            "  \"deltas\": [\n"
+            "    {\n"
+            "      \"txid\": \"hash\",          (hexstring) transaction ID\n"
+            "      \"index\": n,              (numeric) The offset of the tx in the block\n"
+            "      \"inputs\": [                (array of json objects)\n"
+            "        {\n"
+            "          \"address\": \"taddr\",  (string) transparent address\n"
+            "          \"satoshis\": n,       (numeric) negative of spend amount\n"
+            "          \"index\": n,          (numeric) vin index\n"
+            "          \"prevtxid\": \"hash\",  (string) source utxo tx ID\n"
+            "          \"prevout\": n         (numeric) source utxo index\n"
+            "        }, ...\n"
+            "      ],\n"
+            "      \"outputs\": [             (array of json objects)\n"
+            "        {\n"
+            "          \"address\": \"taddr\",  (string) transparent address\n"
+            "          \"satoshis\": n,       (numeric) amount\n"
+            "          \"index\": n           (numeric) vout index\n"
+            "        }, ...\n"
+            "      ]\n"
+            "    }, ...\n"
+            "  ],\n"
+            "  \"time\" : n,                  (numeric) The block version\n"
+            "  \"mediantime\": n,             (numeric) The most recent blocks' ave time\n"
+            "  \"nonce\" : \"nonce\",           (hex string) The nonce\n"
+            "  \"bits\" : \"1d00ffff\",         (hex string) The bits\n"
+            "  \"difficulty\": n,             (numeric) the current difficulty\n"
+            "  \"chainwork\": \"xxxx\"          (hex string) total amount of work in active chain\n"
+            "  \"previousblockhash\" : \"hash\",(hex string) The hash of the previous block\n"
+            "  \"nextblockhash\" : \"hash\"     (hex string) The hash of the next block\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getblockdeltas", "00227e566682aebd6a7a5b772c96d7a999cadaebeaf1ce96f4191a3aad58b00b")
+            + HelpExampleRpc("getblockdeltas", "\"00227e566682aebd6a7a5b772c96d7a999cadaebeaf1ce96f4191a3aad58b00b\"")
+        );
+
+    if (!(fExperimentalInsightExplorer || fExperimentalLightWalletd)) {
+        throw JSONRPCError(RPC_MISC_ERROR, "Error: getblockdeltas is disabled. "
+            "Run './zcash-cli help getblockdeltas' for instructions on how to enable this feature.");
+    }
+
+    std::string strHash = params[0].get_str();
+    uint256 hash(uint256S(strHash));
+
+    LOCK(cs_main);
+
+    if (mapBlockIndex.count(hash) == 0)
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Block not found");
+
+    CBlock block;
+    CBlockIndex* pblockindex = mapBlockIndex[hash];
+
+    if (fHavePruned && !(pblockindex->nStatus & BLOCK_HAVE_DATA) && pblockindex->nTx > 0)
+        throw JSONRPCError(RPC_INTERNAL_ERROR, "Block not available (pruned data)");
+
+    if (!ReadBlockFromDisk(block, pblockindex, Params().GetConsensus()))
+        throw JSONRPCError(RPC_INTERNAL_ERROR, "Can't read block from disk");
+
+    return blockToDeltasJSON(block, pblockindex);
+}
+
+// insightexplorer
+UniValue getblockhashes(const UniValue& params, bool fHelp)
+{
+    std::string disabledMsg = "";
+    if (!(fExperimentalInsightExplorer || fExperimentalLightWalletd)) {
+        disabledMsg = experimentalDisabledHelpMsg("getblockhashes", {"insightexplorer", "lightwalletd"});
+    }
+    if (fHelp || params.size() < 2)
+        throw runtime_error(
+            "getblockhashes high low ( {\"noOrphans\": true|false, \"logicalTimes\": true|false} )\n"
+            "\nReturns array of hashes of blocks within the timestamp range provided,\n"
+            "\ngreater or equal to low, less than high.\n"
+            + disabledMsg +
+            "\nArguments:\n"
+            "1. high                            (numeric, required) The newer block timestamp\n"
+            "2. low                             (numeric, required) The older block timestamp\n"
+            "3. options                         (string, optional) A json object\n"
+            "    {\n"
+            "      \"noOrphans\": true|false      (boolean) will only include blocks on the main chain\n"
+            "      \"logicalTimes\": true|false   (boolean) will include logical timestamps with hashes\n"
+            "    }\n"
+            "\nResult:\n"
+            "[\n"
+            "  \"xxxx\"                   (hex string) The block hash\n"
+            "]\n"
+            "or\n"
+            "[\n"
+            "  {\n"
+            "    \"blockhash\": \"xxxx\"    (hex string) The block hash\n"
+            "    \"logicalts\": n         (numeric) The logical timestamp\n"
+            "  }\n"
+            "]\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getblockhashes", "1558141697 1558141576")
+            + HelpExampleRpc("getblockhashes", "1558141697, 1558141576")
+            + HelpExampleCli("getblockhashes", "1558141697 1558141576 '{\"noOrphans\":false, \"logicalTimes\":true}'")
+            );
+
+    if (!(fExperimentalInsightExplorer || fExperimentalLightWalletd)) {
+        throw JSONRPCError(RPC_MISC_ERROR, "Error: getblockhashes is disabled. "
+            "Run './zcash-cli help getblockhashes' for instructions on how to enable this feature.");
+    }
+
+    unsigned int high = params[0].get_int();
+    unsigned int low = params[1].get_int();
+    bool fActiveOnly = false;
+    bool fLogicalTS = false;
+
+    if (params.size() > 2) {
+        UniValue noOrphans = find_value(params[2].get_obj(), "noOrphans");
+        if (!noOrphans.isNull())
+            fActiveOnly = noOrphans.get_bool();
+
+        UniValue returnLogical = find_value(params[2].get_obj(), "logicalTimes");
+        if (!returnLogical.isNull())
+            fLogicalTS = returnLogical.get_bool();
+    }
+
+    std::vector<std::pair<uint256, unsigned int> > blockHashes;
+    {
+        LOCK(cs_main);
+        if (!GetTimestampIndex(high, low, fActiveOnly, blockHashes)) {
+            throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY,
+                "No information available for block hashes");
+        }
+    }
+    UniValue result(UniValue::VARR);
+    for (std::vector<std::pair<uint256, unsigned int> >::const_iterator it=blockHashes.begin();
+            it!=blockHashes.end(); it++) {
+        if (fLogicalTS) {
+            UniValue item(UniValue::VOBJ);
+            item.pushKV("blockhash", it->first.GetHex());
+            item.pushKV("logicalts", (int)it->second);
+            result.push_back(item);
+        } else {
+            result.push_back(it->first.GetHex());
+        }
+    }
+    return result;
+}
+
+//! Sanity-check a height argument and interpret negative values.
+int interpretHeightArg(int nHeight, int currentHeight)
+{
+    if (nHeight < 0) {
+        nHeight += currentHeight + 1;
+    }
+    if (nHeight < 0 || nHeight > currentHeight) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Block height out of range");
+    }
+    return nHeight;
+}
+
+//! Parse and sanity-check a height argument, return its integer representation.
+int parseHeightArg(const std::string& strHeight, int currentHeight)
+{
+    // std::stoi allows (locale-dependent) whitespace and optional '+' sign,
+    // whereas we want to be strict.
+    regex r("(?:(-?)[1-9][0-9]*|[0-9]+)");
+    if (!regex_match(strHeight, r)) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid block height parameter");
+    }
+    int nHeight;
+    try {
+        nHeight = std::stoi(strHeight);
+    }
+    catch (const std::exception &e) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid block height parameter");
+    }
+    return interpretHeightArg(nHeight, currentHeight);
+}
+
+UniValue getblockhash(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "getblockhash index\n"
+            "\nReturns hash of block in best-block-chain at index provided.\n"
+            "\nArguments:\n"
+            "1. index         (numeric, required) The block index. If negative then -1 is the last known valid block\n"
+            "\nResult:\n"
+            "\"hash\"         (string) The block hash\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getblockhash", "1000")
+            + HelpExampleRpc("getblockhash", "1000")
+        );
+
+    LOCK(cs_main);
+
+    const CBlockIndex* pblockindex = chainActive[interpretHeightArg(params[0].get_int(), chainActive.Height())];
+    return pblockindex->GetBlockHash().GetHex();
+}
+
+UniValue getblockheader(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() < 1 || params.size() > 2)
+        throw runtime_error(
+            "getblockheader \"hash\" ( verbose )\n"
+            "\nIf verbose is false, returns a string that is serialized, hex-encoded data for blockheader 'hash'.\n"
+            "If verbose is true, returns an Object with information about blockheader <hash>.\n"
+            "\nArguments:\n"
+            "1. \"hash\"          (string, required) The block hash\n"
+            "2. verbose           (boolean, optional, default=true) true for a json object, false for the hex encoded data\n"
+            "\nResult (for verbose = true):\n"
+            "{\n"
+            "  \"hash\" : \"hash\",     (string) the block hash (same as provided)\n"
+            "  \"confirmations\" : n,   (numeric) The number of confirmations, or -1 if the block is not on the main chain\n"
+            "  \"height\" : n,          (numeric) The block height or index\n"
+            "  \"version\" : n,         (numeric) The block version\n"
+            "  \"merkleroot\" : \"xxxx\", (string) The merkle root\n"
+            "  \"finalsaplingroot\" : \"xxxx\", (string) The root of the Sapling commitment tree after applying this block\n"
+            "  \"time\" : ttt,          (numeric) The block time in seconds since epoch (Jan 1 1970 GMT)\n"
+            "  \"nonce\" : n,           (numeric) The nonce\n"
+            "  \"bits\" : \"1d00ffff\", (string) The bits\n"
+            "  \"difficulty\" : x.xxx,  (numeric) The difficulty\n"
+            "  \"previousblockhash\" : \"hash\",  (string) The hash of the previous block\n"
+            "  \"nextblockhash\" : \"hash\"       (string) The hash of the next block\n"
+            "}\n"
+            "\nResult (for verbose=false):\n"
+            "\"data\"             (string) A string that is serialized, hex-encoded data for block 'hash'.\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getblockheader", "\"00000000c937983704a73af28acdec37b049d214adbda81d7e2a3dd146f6ed09\"")
+            + HelpExampleRpc("getblockheader", "\"00000000c937983704a73af28acdec37b049d214adbda81d7e2a3dd146f6ed09\"")
+        );
+
+    LOCK(cs_main);
+
+    std::string strHash = params[0].get_str();
+    uint256 hash(uint256S(strHash));
+
+    bool fVerbose = true;
+    if (params.size() > 1)
+        fVerbose = params[1].get_bool();
+
+    if (mapBlockIndex.count(hash) == 0)
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Block not found");
+
+    CBlockIndex* pblockindex = mapBlockIndex[hash];
+
+    if (!fVerbose)
+    {
+        CDataStream ssBlock(SER_NETWORK, PROTOCOL_VERSION);
+        ssBlock << pblockindex->GetBlockHeader();
+        std::string strHex = HexStr(ssBlock.begin(), ssBlock.end());
+        return strHex;
+    }
+
+    return blockheaderToJSON(pblockindex);
+}
+
+UniValue getblock(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() < 1 || params.size() > 2)
+        throw runtime_error(
+            "getblock \"hash|height\" ( verbosity )\n"
+            "\nIf verbosity is 0, returns a string that is serialized, hex-encoded data for the block.\n"
+            "If verbosity is 1, returns an Object with information about the block.\n"
+            "If verbosity is 2, returns an Object with information about the block and information about each transaction. \n"
+            "\nArguments:\n"
+            "1. \"hash|height\"          (string, required) The block hash or height. Height can be negative where -1 is the last known valid block\n"
+            "2. verbosity              (numeric, optional, default=1) 0 for hex encoded data, 1 for a json object, and 2 for json object with transaction data\n"
+            "\nResult (for verbosity = 0):\n"
+            "\"data\"             (string) A string that is serialized, hex-encoded data for the block.\n"
+            "\nResult (for verbosity = 1):\n"
+            "{\n"
+            "  \"hash\" : \"hash\",       (string) the block hash (same as provided hash)\n"
+            "  \"confirmations\" : n,   (numeric) The number of confirmations, or -1 if the block is not on the main chain\n"
+            "  \"size\" : n,            (numeric) The block size\n"
+            "  \"height\" : n,          (numeric) The block height or index (same as provided height)\n"
+            "  \"version\" : n,         (numeric) The block version\n"
+            "  \"merkleroot\" : \"xxxx\", (string) The merkle root\n"
+            "  \"finalsaplingroot\" : \"xxxx\", (string) The root of the Sapling commitment tree after applying this block\n"
+            "  \"finalorchardroot\" : \"xxxx\", (string) The root of the Orchard commitment tree after applying this block.\n"
+            "                                        Omitted for blocks prior to NU5 activation. This will be the null\n"
+            "                                        hash if this block has never been connected to a main chain.\n"
+            "  \"tx\" : [               (array of string) The transaction ids\n"
+            "     \"transactionid\"     (string) The transaction id\n"
+            "     ,...\n"
+            "  ],\n"
+            "  \"time\" : ttt,          (numeric) The block time in seconds since epoch (Jan 1 1970 GMT)\n"
+            "  \"nonce\" : n,           (numeric) The nonce\n"
+            "  \"bits\" : \"1d00ffff\",   (string) The bits\n"
+            "  \"difficulty\" : x.xxx,  (numeric) The difficulty\n"
+            "  \"previousblockhash\" : \"hash\",  (string) The hash of the previous block\n"
+            "  \"nextblockhash\" : \"hash\"       (string) The hash of the next block\n"
+            "}\n"
+            "\nResult (for verbosity = 2):\n"
+            "{\n"
+            "  ...,                     Same output as verbosity = 1.\n"
+            "  \"tx\" : [               (array of Objects) The transactions in the format of the getrawtransaction RPC. Different from verbosity = 1 \"tx\" result.\n"
+            "         ,...\n"
+            "  ],\n"
+            "  ,...                     Same output as verbosity = 1.\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getblock", "\"00000000febc373a1da2bd9f887b105ad79ddc26ac26c2b28652d64e5207c5b5\"")
+            + HelpExampleRpc("getblock", "\"00000000febc373a1da2bd9f887b105ad79ddc26ac26c2b28652d64e5207c5b5\"")
+            + HelpExampleCli("getblock", "12800")
+            + HelpExampleRpc("getblock", "12800")
+        );
+
+    LOCK(cs_main);
+
+    std::string strHash = params[0].get_str();
+
+    // If height is supplied, find the hash
+    if (strHash.size() < (2 * sizeof(uint256))) {
+        strHash = chainActive[parseHeightArg(strHash, chainActive.Height())]->GetBlockHash().GetHex();
+    }
+
+    uint256 hash(uint256S(strHash));
+
+    int verbosity = 1;
+    if (params.size() > 1) {
+        if(params[1].isNum()) {
+            verbosity = params[1].get_int();
+        } else {
+            verbosity = params[1].get_bool() ? 1 : 0;
+        }
+    }
+
+    if (verbosity < 0 || verbosity > 2) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Verbosity must be in range from 0 to 2");
+    }
+
+    if (mapBlockIndex.count(hash) == 0)
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Block not found");
+
+    CBlock block;
+    CBlockIndex* pblockindex = mapBlockIndex[hash];
+
+    if (fHavePruned && !(pblockindex->nStatus & BLOCK_HAVE_DATA) && pblockindex->nTx > 0)
+        throw JSONRPCError(RPC_INTERNAL_ERROR, "Block not available (pruned data)");
+
+    if(!ReadBlockFromDisk(block, pblockindex, Params().GetConsensus()))
+        throw JSONRPCError(RPC_INTERNAL_ERROR, "Can't read block from disk");
+
+    if (verbosity == 0)
+    {
+        CDataStream ssBlock(SER_NETWORK, PROTOCOL_VERSION);
+        ssBlock << block;
+        std::string strHex = HexStr(ssBlock.begin(), ssBlock.end());
+        return strHex;
+    }
+
+    return blockToJSON(block, pblockindex, verbosity >= 2);
+}
+
+UniValue gettxoutsetinfo(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 0)
+        throw runtime_error(
+            "gettxoutsetinfo\n"
+            "\nReturns statistics about the unspent transaction output set.\n"
+            "Note this call may take some time.\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"height\":n,     (numeric) The current block height (index)\n"
+            "  \"bestblock\": \"hex\",   (string) the best block hash hex\n"
+            "  \"transactions\": n,      (numeric) The number of transactions\n"
+            "  \"txouts\": n,            (numeric) The number of output transactions\n"
+            "  \"bytes_serialized\": n,  (numeric) The serialized size\n"
+            "  \"hash_serialized\": \"hash\",   (string) The serialized hash\n"
+            "  \"total_amount\": x.xxx          (numeric) The total amount\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("gettxoutsetinfo", "")
+            + HelpExampleRpc("gettxoutsetinfo", "")
+        );
+
+    UniValue ret(UniValue::VOBJ);
+
+    CCoinsStats stats;
+    FlushStateToDisk();
+    if (pcoinsTip->GetStats(stats)) {
+        ret.pushKV("height", (int64_t)stats.nHeight);
+        ret.pushKV("bestblock", stats.hashBlock.GetHex());
+        ret.pushKV("transactions", (int64_t)stats.nTransactions);
+        ret.pushKV("txouts", (int64_t)stats.nTransactionOutputs);
+        ret.pushKV("bytes_serialized", (int64_t)stats.nSerializedSize);
+        ret.pushKV("hash_serialized", stats.hashSerialized.GetHex());
+        ret.pushKV("total_amount", ValueFromAmount(stats.nTotalAmount));
+    }
+    return ret;
+}
+
+UniValue gettxout(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() < 2 || params.size() > 3)
+        throw runtime_error(
+            "gettxout \"txid\" n ( includemempool )\n"
+            "\nReturns details about an unspent transaction output.\n"
+            "\nArguments:\n"
+            "1. \"txid\"       (string, required) The transaction id\n"
+            "2. n              (numeric, required) vout value\n"
+            "3. includemempool  (boolean, optional) Whether to include the mempool\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"bestblock\" : \"hash\",    (string) the block hash\n"
+            "  \"confirmations\" : n,       (numeric) The number of confirmations\n"
+            "  \"value\" : x.xxx,           (numeric) The transaction value in " + CURRENCY_UNIT + "\n"
+            "  \"scriptPubKey\" : {         (json object)\n"
+            "     \"asm\" : \"code\",       (string) \n"
+            "     \"hex\" : \"hex\",        (string) \n"
+            "     \"reqSigs\" : n,          (numeric) Number of required signatures\n"
+            "     \"type\" : \"pubkeyhash\", (string) The type, eg pubkeyhash\n"
+            "     \"addresses\" : [          (array of string) array of Zcash addresses\n"
+            "        \"zcashaddress\"        (string) Zcash address\n"
+            "        ,...\n"
+            "     ]\n"
+            "  },\n"
+            "  \"version\" : n,              (numeric) The version\n"
+            "  \"coinbase\" : true|false     (boolean) Coinbase or not\n"
+            "}\n"
+
+            "\nExamples:\n"
+            "\nGet unspent transactions\n"
+            + HelpExampleCli("listunspent", "") +
+            "\nView the details\n"
+            + HelpExampleCli("gettxout", "\"txid\" 1") +
+            "\nAs a json rpc call\n"
+            + HelpExampleRpc("gettxout", "\"txid\", 1")
+        );
+
+    LOCK(cs_main);
+
+    UniValue ret(UniValue::VOBJ);
+
+    std::string strHash = params[0].get_str();
+    uint256 hash(uint256S(strHash));
+    int n = params[1].get_int();
+    bool fMempool = true;
+    if (params.size() > 2)
+        fMempool = params[2].get_bool();
+
+    CCoins coins;
+    if (fMempool) {
+        LOCK(mempool.cs);
+        CCoinsViewMemPool view(pcoinsTip, mempool);
+        if (!view.GetCoins(hash, coins))
+            return NullUniValue;
+        mempool.pruneSpent(hash, coins); // TODO: this should be done by the CCoinsViewMemPool
+    } else {
+        if (!pcoinsTip->GetCoins(hash, coins))
+            return NullUniValue;
+    }
+    if (n<0 || (unsigned int)n>=coins.vout.size() || coins.vout[n].IsNull())
+        return NullUniValue;
+
+    BlockMap::iterator it = mapBlockIndex.find(pcoinsTip->GetBestBlock());
+    CBlockIndex *pindex = it->second;
+    ret.pushKV("bestblock", pindex->GetBlockHash().GetHex());
+    if ((unsigned int)coins.nHeight == MEMPOOL_HEIGHT)
+        ret.pushKV("confirmations", 0);
+    else
+        ret.pushKV("confirmations", pindex->nHeight - coins.nHeight + 1);
+    ret.pushKV("value", ValueFromAmount(coins.vout[n].nValue));
+    UniValue o(UniValue::VOBJ);
+    ScriptPubKeyToJSON(coins.vout[n].scriptPubKey, o, true);
+    ret.pushKV("scriptPubKey", o);
+    ret.pushKV("version", coins.nVersion);
+    ret.pushKV("coinbase", coins.fCoinBase);
+
+    return ret;
+}
+
+UniValue verifychain(const UniValue& params, bool fHelp)
+{
+    int nCheckLevel = GetArg("-checklevel", DEFAULT_CHECKLEVEL);
+    int nCheckDepth = GetArg("-checkblocks", DEFAULT_CHECKBLOCKS);
+    if (fHelp || params.size() > 2)
+        throw runtime_error(
+            "verifychain ( checklevel numblocks )\n"
+            "\nVerifies blockchain database.\n"
+            "\nArguments:\n"
+            "1. checklevel   (numeric, optional, 0-4, default=" + strprintf("%d", nCheckLevel) + ") How thorough the block verification is.\n"
+            "2. numblocks    (numeric, optional, default=" + strprintf("%d", nCheckDepth) + ", 0=all) The number of blocks to check.\n"
+            "\nResult:\n"
+            "true|false       (boolean) Verified or not\n"
+            "\nExamples:\n"
+            + HelpExampleCli("verifychain", "")
+            + HelpExampleRpc("verifychain", "")
+        );
+
+    LOCK(cs_main);
+
+    if (params.size() > 0)
+        nCheckLevel = params[0].get_int();
+    if (params.size() > 1)
+        nCheckDepth = params[1].get_int();
+
+    return CVerifyDB().VerifyDB(Params(), pcoinsTip, nCheckLevel, nCheckDepth);
+}
+
+/** Implementation of IsSuperMajority with better feedback */
+static UniValue SoftForkMajorityDesc(int minVersion, CBlockIndex* pindex, int nRequired, const Consensus::Params& consensusParams)
+{
+    int nFound = 0;
+    CBlockIndex* pstart = pindex;
+    for (int i = 0; i < consensusParams.nMajorityWindow && pstart != NULL; i++)
+    {
+        if (pstart->nVersion >= minVersion)
+            ++nFound;
+        pstart = pstart->pprev;
+    }
+
+    UniValue rv(UniValue::VOBJ);
+    rv.pushKV("status", nFound >= nRequired);
+    rv.pushKV("found", nFound);
+    rv.pushKV("required", nRequired);
+    rv.pushKV("window", consensusParams.nMajorityWindow);
+    return rv;
+}
+
+static UniValue SoftForkDesc(const std::string &name, int version, CBlockIndex* pindex, const Consensus::Params& consensusParams)
+{
+    UniValue rv(UniValue::VOBJ);
+    rv.pushKV("id", name);
+    rv.pushKV("version", version);
+    rv.pushKV("enforce", SoftForkMajorityDesc(version, pindex, consensusParams.nMajorityEnforceBlockUpgrade, consensusParams));
+    rv.pushKV("reject", SoftForkMajorityDesc(version, pindex, consensusParams.nMajorityRejectBlockOutdated, consensusParams));
+    return rv;
+}
+
+static UniValue NetworkUpgradeDesc(const Consensus::Params& consensusParams, Consensus::UpgradeIndex idx, int height)
+{
+    UniValue rv(UniValue::VOBJ);
+    auto upgrade = NetworkUpgradeInfo[idx];
+    rv.pushKV("name", upgrade.strName);
+    rv.pushKV("activationheight", consensusParams.vUpgrades[idx].nActivationHeight);
+    switch (NetworkUpgradeState(height, consensusParams, idx)) {
+        case UPGRADE_DISABLED: rv.pushKV("status", "disabled"); break;
+        case UPGRADE_PENDING: rv.pushKV("status", "pending"); break;
+        case UPGRADE_ACTIVE: rv.pushKV("status", "active"); break;
+    }
+    rv.pushKV("info", upgrade.strInfo);
+    return rv;
+}
+
+void NetworkUpgradeDescPushBack(
+    UniValue& networkUpgrades,
+    const Consensus::Params& consensusParams,
+    Consensus::UpgradeIndex idx,
+    int height)
+{
+    // Network upgrades with an activation height of NO_ACTIVATION_HEIGHT are
+    // hidden. This is used when network upgrade implementations are merged
+    // without specifying the activation height.
+    if (consensusParams.vUpgrades[idx].nActivationHeight != Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT) {
+        networkUpgrades.pushKV(
+            HexInt(NetworkUpgradeInfo[idx].nBranchId),
+            NetworkUpgradeDesc(consensusParams, idx, height));
+    }
+}
+
+
+UniValue getblockchaininfo(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 0)
+        throw runtime_error(
+            "getblockchaininfo\n"
+            "Returns an object containing various state info regarding block chain processing.\n"
+            "\nNote that when the chain tip is at the last block before a network upgrade activation,\n"
+            "consensus.chaintip != consensus.nextblock.\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"chain\": \"xxxx\",        (string) current network name as defined in BIP70 (main, test, regtest)\n"
+            "  \"blocks\": xxxxxx,         (numeric) the current number of blocks processed in the server\n"
+            "  \"initial_block_download_complete\": xx, (boolean) true if the initial download of the blockchain is complete\n"
+            "  \"headers\": xxxxxx,        (numeric) the current number of headers we have validated\n"
+            "  \"bestblockhash\": \"...\", (string) the hash of the currently best block\n"
+            "  \"difficulty\": xxxxxx,     (numeric) the current difficulty\n"
+            "  \"verificationprogress\": xxxx, (numeric) estimate of verification progress [0..1]\n"
+            "  \"estimatedheight\": xxxx,  (numeric) if syncing, the estimated height of the chain, else the current best height\n"
+            "  \"chainwork\": \"xxxx\"     (string) total amount of work in active chain, in hexadecimal\n"
+            "  \"size_on_disk\": xxxxxx,       (numeric) the estimated size of the block and undo files on disk\n"
+            "  \"commitments\": xxxxxx,    (numeric) the current number of note commitments in the commitment tree\n"
+            "  \"softforks\": [            (array) status of softforks in progress\n"
+            "     {\n"
+            "        \"id\": \"xxxx\",        (string) name of softfork\n"
+            "        \"version\": xx,         (numeric) block version\n"
+            "        \"enforce\": {           (object) progress toward enforcing the softfork rules for new-version blocks\n"
+            "           \"status\": xx,       (boolean) true if threshold reached\n"
+            "           \"found\": xx,        (numeric) number of blocks with the new version found\n"
+            "           \"required\": xx,     (numeric) number of blocks required to trigger\n"
+            "           \"window\": xx,       (numeric) maximum size of examined window of recent blocks\n"
+            "        },\n"
+            "        \"reject\": { ... }      (object) progress toward rejecting pre-softfork blocks (same fields as \"enforce\")\n"
+            "     }, ...\n"
+            "  ],\n"
+            "  \"upgrades\": {                (object) status of network upgrades\n"
+            "     \"xxxx\" : {                (string) branch ID of the upgrade\n"
+            "        \"name\": \"xxxx\",        (string) name of upgrade\n"
+            "        \"activationheight\": xxxxxx,  (numeric) block height of activation\n"
+            "        \"status\": \"xxxx\",      (string) status of upgrade\n"
+            "        \"info\": \"xxxx\",        (string) additional information about upgrade\n"
+            "     }, ...\n"
+            "  },\n"
+            "  \"consensus\": {               (object) branch IDs of the current and upcoming consensus rules\n"
+            "     \"chaintip\": \"xxxxxxxx\",   (string) branch ID used to validate the current chain tip\n"
+            "     \"nextblock\": \"xxxxxxxx\"   (string) branch ID that the next block will be validated under\n"
+            "  }\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getblockchaininfo", "")
+            + HelpExampleRpc("getblockchaininfo", "")
+        );
+
+    LOCK(cs_main);
+
+    UniValue obj(UniValue::VOBJ);
+    obj.pushKV("chain",                 Params().NetworkIDString());
+    obj.pushKV("blocks",                (int)chainActive.Height());
+    obj.pushKV("initial_block_download_complete", !IsInitialBlockDownload(Params().GetConsensus()));
+    obj.pushKV("headers",               pindexBestHeader ? pindexBestHeader->nHeight : -1);
+    obj.pushKV("bestblockhash",         chainActive.Tip()->GetBlockHash().GetHex());
+    obj.pushKV("difficulty",            (double)GetNetworkDifficulty());
+    obj.pushKV("verificationprogress",  Checkpoints::GuessVerificationProgress(Params().Checkpoints(), chainActive.Tip()));
+    obj.pushKV("chainwork",             chainActive.Tip()->nChainWork.GetHex());
+    obj.pushKV("pruned",                fPruneMode);
+    obj.pushKV("size_on_disk",          CalculateCurrentUsage());
+
+    if (IsInitialBlockDownload(Params().GetConsensus()))
+        obj.pushKV("estimatedheight",       EstimateNetHeight(Params().GetConsensus(), (int)chainActive.Height(), chainActive.Tip()->GetMedianTimePast()));
+    else
+        obj.pushKV("estimatedheight",       (int)chainActive.Height());
+
+    SproutMerkleTree tree;
+    pcoinsTip->GetSproutAnchorAt(pcoinsTip->GetBestAnchor(SPROUT), tree);
+    obj.pushKV("commitments",           static_cast<uint64_t>(tree.size()));
+
+    CBlockIndex* tip = chainActive.Tip();
+    UniValue valuePools(UniValue::VARR);
+    valuePools.push_back(ValuePoolDesc("sprout", tip->nChainSproutValue, std::nullopt));
+    valuePools.push_back(ValuePoolDesc("sapling", tip->nChainSaplingValue, std::nullopt));
+    valuePools.push_back(ValuePoolDesc("orchard", tip->nChainOrchardValue, std::nullopt));
+    obj.pushKV("valuePools",            valuePools);
+
+    const CChainParams& chainparams = Params();
+    const Consensus::Params& consensusParams = chainparams.GetConsensus();
+
+    UniValue softforks(UniValue::VARR);
+    softforks.push_back(SoftForkDesc("bip34", 2, tip, consensusParams));
+    softforks.push_back(SoftForkDesc("bip66", 3, tip, consensusParams));
+    softforks.push_back(SoftForkDesc("bip65", 4, tip, consensusParams));
+    obj.pushKV("softforks",             softforks);
+
+    UniValue upgrades(UniValue::VOBJ);
+    for (int i = Consensus::UPGRADE_OVERWINTER; i < Consensus::MAX_NETWORK_UPGRADES; i++) {
+        NetworkUpgradeDescPushBack(upgrades, consensusParams, Consensus::UpgradeIndex(i), tip->nHeight);
+    }
+    obj.pushKV("upgrades", upgrades);
+
+    UniValue consensus(UniValue::VOBJ);
+    consensus.pushKV("chaintip", HexInt(CurrentEpochBranchId(tip->nHeight, consensusParams)));
+    consensus.pushKV("nextblock", HexInt(CurrentEpochBranchId(tip->nHeight + 1, consensusParams)));
+    obj.pushKV("consensus", consensus);
+
+    if (fPruneMode)
+    {
+        CBlockIndex *block = chainActive.Tip();
+        while (block && block->pprev && (block->pprev->nStatus & BLOCK_HAVE_DATA))
+            block = block->pprev;
+
+        obj.pushKV("pruneheight",        block->nHeight);
+    }
+
+    if (Params().NetworkIDString() == "regtest") {
+        obj.pushKV("fullyNotified", ChainIsFullyNotified(chainparams));
+    }
+
+    return obj;
+}
+
+/** Comparison function for sorting the getchaintips heads.  */
+struct CompareBlocksByHeight
+{
+    bool operator()(const CBlockIndex* a, const CBlockIndex* b) const
+    {
+        /* Make sure that unequal blocks with the same height do not compare
+           equal. Use the pointers themselves to make a distinction. */
+
+        if (a->nHeight != b->nHeight)
+          return (a->nHeight > b->nHeight);
+
+        return a < b;
+    }
+};
+
+UniValue getchaintips(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 0)
+        throw runtime_error(
+            "getchaintips\n"
+            "Return information about all known tips in the block tree,"
+            " including the main chain as well as orphaned branches.\n"
+            "\nResult:\n"
+            "[\n"
+            "  {\n"
+            "    \"height\": xxxx,         (numeric) height of the chain tip\n"
+            "    \"hash\": \"xxxx\",         (string) block hash of the tip\n"
+            "    \"branchlen\": 0          (numeric) zero for main chain\n"
+            "    \"status\": \"active\"      (string) \"active\" for the main chain\n"
+            "  },\n"
+            "  {\n"
+            "    \"height\": xxxx,\n"
+            "    \"hash\": \"xxxx\",\n"
+            "    \"branchlen\": 1          (numeric) length of branch connecting the tip to the main chain\n"
+            "    \"status\": \"xxxx\"        (string) status of the chain (active, valid-fork, valid-headers, headers-only, invalid)\n"
+            "  }\n"
+            "]\n"
+            "Possible values for status:\n"
+            "1.  \"invalid\"               This branch contains at least one invalid block\n"
+            "2.  \"headers-only\"          Not all blocks for this branch are available, but the headers are valid\n"
+            "3.  \"valid-headers\"         All blocks are available for this branch, but they were never fully validated\n"
+            "4.  \"valid-fork\"            This branch is not part of the active chain, but is fully validated\n"
+            "5.  \"active\"                This is the tip of the active main chain, which is certainly valid\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getchaintips", "")
+            + HelpExampleRpc("getchaintips", "")
+        );
+
+    LOCK(cs_main);
+
+    /* Build up a list of chain tips.  We start with the list of all
+       known blocks, and successively remove blocks that appear as pprev
+       of another block.  */
+    std::set<const CBlockIndex*, CompareBlocksByHeight> setTips;
+    for (const std::pair<const uint256, CBlockIndex*>& item : mapBlockIndex)
+        setTips.insert(item.second);
+    for (const std::pair<const uint256, CBlockIndex*>& item : mapBlockIndex)
+    {
+        const CBlockIndex* pprev = item.second->pprev;
+        if (pprev)
+            setTips.erase(pprev);
+    }
+
+    // Always report the currently active tip.
+    setTips.insert(chainActive.Tip());
+
+    /* Construct the output array.  */
+    UniValue res(UniValue::VARR);
+    for (const CBlockIndex* block : setTips)
+    {
+        UniValue obj(UniValue::VOBJ);
+        obj.pushKV("height", block->nHeight);
+        obj.pushKV("hash", block->phashBlock->GetHex());
+
+        const int branchLen = block->nHeight - chainActive.FindFork(block)->nHeight;
+        obj.pushKV("branchlen", branchLen);
+
+        string status;
+        if (chainActive.Contains(block)) {
+            // This block is part of the currently active chain.
+            status = "active";
+        } else if (block->nStatus & BLOCK_FAILED_MASK) {
+            // This block or one of its ancestors is invalid.
+            status = "invalid";
+        } else if (block->nChainTx == 0) {
+            // This block cannot be connected because full block data for it or one of its parents is missing.
+            status = "headers-only";
+        } else if (block->IsValid(BLOCK_VALID_SCRIPTS)) {
+            // This block is fully validated, but no longer part of the active chain. It was probably the active block once, but was reorganized.
+            status = "valid-fork";
+        } else if (block->IsValid(BLOCK_VALID_TREE)) {
+            // The headers for this block are valid, but it has not been validated. It was probably never part of the most-work chain.
+            status = "valid-headers";
+        } else {
+            // No clue.
+            status = "unknown";
+        }
+        obj.pushKV("status", status);
+
+        res.push_back(obj);
+    }
+
+    return res;
+}
+
+UniValue z_gettreestate(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "z_gettreestate \"hash|height\"\n"
+            "Return information about the given block's tree state.\n"
+            "\nArguments:\n"
+            "1. \"hash|height\"          (string, required) The block hash or height. Height can be negative where -1 is the last known valid block\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"hash\": \"hash\",         (string) hex block hash\n"
+            "  \"height\": n,              (numeric) block height\n"
+            "  \"time\": n,                (numeric) block time: UTC seconds since the Unix 1970-01-01 epoch\n"
+            "  \"sprout\": {\n"
+            "    \"skipHash\": \"hash\",   (string) hash of most recent block with more information\n"
+            "    \"commitments\": {\n"
+            "      \"finalRoot\": \"hex\", (string)\n"
+            "      \"finalState\": \"hex\" (string)\n"
+            "    }\n"
+            "  },\n"
+            "  \"sapling\": {\n"
+            "    \"skipHash\": \"hash\",   (string) hash of most recent block with more information\n"
+            "    \"commitments\": {\n"
+            "      \"finalRoot\": \"hex\", (string)\n"
+            "      \"finalState\": \"hex\" (string)\n"
+            "    }\n"
+            "  },\n"
+            "  \"orchard\": {\n"
+            "    \"skipHash\": \"hash\",   (string) hash of most recent block with more information\n"
+            "    \"commitments\": {\n"
+            "      \"finalRoot\": \"hex\", (string)\n"
+            "      \"finalState\": \"hex\" (string)\n"
+            "    }\n"
+            "  }\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("z_gettreestate", "\"00000000febc373a1da2bd9f887b105ad79ddc26ac26c2b28652d64e5207c5b5\"")
+            + HelpExampleRpc("z_gettreestate", "\"00000000febc373a1da2bd9f887b105ad79ddc26ac26c2b28652d64e5207c5b5\"")
+            + HelpExampleCli("z_gettreestate", "12800")
+            + HelpExampleRpc("z_gettreestate", "12800")
+        );
+
+    LOCK(cs_main);
+
+    std::string strHash = params[0].get_str();
+
+    // If height is supplied, find the hash
+    if (strHash.size() < (2 * sizeof(uint256))) {
+        strHash = chainActive[parseHeightArg(strHash, chainActive.Height())]->GetBlockHash().GetHex();
+    }
+    uint256 hash(uint256S(strHash));
+
+    if (mapBlockIndex.count(hash) == 0)
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Block not found");
+    const CBlockIndex* const pindex = mapBlockIndex[hash];
+    if (!chainActive.Contains(pindex)) {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Requested block is not part of the main chain");
+    }
+
+    UniValue res(UniValue::VOBJ);
+    res.pushKV("hash", pindex->GetBlockHash().GetHex());
+    res.pushKV("height", pindex->nHeight);
+    res.pushKV("time", int64_t(pindex->nTime));
+
+    // sprout
+    {
+        UniValue sprout_result(UniValue::VOBJ);
+        UniValue sprout_commitments(UniValue::VOBJ);
+        sprout_commitments.pushKV("finalRoot", pindex->hashFinalSproutRoot.GetHex());
+        SproutMerkleTree tree;
+        if (pcoinsTip->GetSproutAnchorAt(pindex->hashFinalSproutRoot, tree)) {
+            CDataStream s(SER_NETWORK, PROTOCOL_VERSION);
+            s << tree;
+            sprout_commitments.pushKV("finalState", HexStr(s.begin(), s.end()));
+        } else {
+            // Set skipHash to the most recent block that has a finalState.
+            const CBlockIndex* pindex_skip = pindex->pprev;
+            while (pindex_skip && !pcoinsTip->GetSproutAnchorAt(pindex_skip->hashFinalSproutRoot, tree)) {
+                pindex_skip = pindex_skip->pprev;
+            }
+            if (pindex_skip) {
+                sprout_result.pushKV("skipHash", pindex_skip->GetBlockHash().GetHex());
+            }
+        }
+        sprout_result.pushKV("commitments", sprout_commitments);
+        res.pushKV("sprout", sprout_result);
+    }
+
+    // sapling
+    {
+        UniValue sapling_result(UniValue::VOBJ);
+        UniValue sapling_commitments(UniValue::VOBJ);
+        sapling_commitments.pushKV("finalRoot", pindex->hashFinalSaplingRoot.GetHex());
+        bool need_skiphash = false;
+        SaplingMerkleTree tree;
+        if (pcoinsTip->GetSaplingAnchorAt(pindex->hashFinalSaplingRoot, tree)) {
+            CDataStream s(SER_NETWORK, PROTOCOL_VERSION);
+            s << tree;
+            sapling_commitments.pushKV("finalState", HexStr(s.begin(), s.end()));
+        } else {
+            // Set skipHash to the most recent block that has a finalState.
+            const CBlockIndex* pindex_skip = pindex->pprev;
+            while (pindex_skip && !pcoinsTip->GetSaplingAnchorAt(pindex_skip->hashFinalSaplingRoot, tree)) {
+                pindex_skip = pindex_skip->pprev;
+            }
+            if (pindex_skip) {
+                sapling_result.pushKV("skipHash", pindex_skip->GetBlockHash().GetHex());
+            }
+        }
+        sapling_result.pushKV("commitments", sapling_commitments);
+        res.pushKV("sapling", sapling_result);
+    }
+
+    // orchard
+    {
+        UniValue orchard_result(UniValue::VOBJ);
+        UniValue orchard_commitments(UniValue::VOBJ);
+        orchard_commitments.pushKV("finalRoot", pindex->hashFinalOrchardRoot.GetHex());
+        bool need_skiphash = false;
+        OrchardMerkleFrontier tree;
+        if (pcoinsTip->GetOrchardAnchorAt(pindex->hashFinalOrchardRoot, tree)) {
+            CDataStream s(SER_NETWORK, PROTOCOL_VERSION);
+            s << OrchardMerkleFrontierLegacySer(tree);
+            orchard_commitments.pushKV("finalState", HexStr(s.begin(), s.end()));
+        } else {
+            // Set skipHash to the most recent block that has a finalState.
+            const CBlockIndex* pindex_skip = pindex->pprev;
+            while (pindex_skip && !pcoinsTip->GetOrchardAnchorAt(pindex_skip->hashFinalOrchardRoot, tree)) {
+                pindex_skip = pindex_skip->pprev;
+            }
+            if (pindex_skip) {
+                orchard_result.pushKV("skipHash", pindex_skip->GetBlockHash().GetHex());
+            }
+        }
+        orchard_result.pushKV("commitments", orchard_commitments);
+        res.pushKV("orchard", orchard_result);
+    }
+
+    return res;
+}
+
+UniValue mempoolInfoToJSON()
+{
+    UniValue ret(UniValue::VOBJ);
+    ret.pushKV("size", (int64_t) mempool.size());
+    ret.pushKV("bytes", (int64_t) mempool.GetTotalTxSize());
+    ret.pushKV("usage", (int64_t) mempool.DynamicMemoryUsage());
+
+    if (Params().NetworkIDString() == "regtest") {
+        ret.pushKV("fullyNotified", mempool.IsFullyNotified());
+    }
+
+    return ret;
+}
+
+UniValue getmempoolinfo(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 0)
+        throw runtime_error(
+            "getmempoolinfo\n"
+            "\nReturns details on the active state of the TX memory pool.\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"size\": xxxxx                (numeric) Current tx count\n"
+            "  \"bytes\": xxxxx               (numeric) Sum of all tx sizes\n"
+            "  \"usage\": xxxxx               (numeric) Total memory usage for the mempool\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getmempoolinfo", "")
+            + HelpExampleRpc("getmempoolinfo", "")
+        );
+
+    return mempoolInfoToJSON();
+}
+
+UniValue invalidateblock(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "invalidateblock \"hash\"\n"
+            "\nPermanently marks a block as invalid, as if it violated a consensus rule.\n"
+            "\nArguments:\n"
+            "1. hash   (string, required) the hash of the block to mark as invalid\n"
+            "\nResult:\n"
+            "\nExamples:\n"
+            + HelpExampleCli("invalidateblock", "\"blockhash\"")
+            + HelpExampleRpc("invalidateblock", "\"blockhash\"")
+        );
+
+    std::string strHash = params[0].get_str();
+    uint256 hash(uint256S(strHash));
+    CValidationState state;
+
+    {
+        LOCK(cs_main);
+        if (mapBlockIndex.count(hash) == 0)
+            throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Block not found");
+
+        CBlockIndex* pblockindex = mapBlockIndex[hash];
+        InvalidateBlock(state, Params(), pblockindex);
+    }
+
+    if (state.IsValid()) {
+        ActivateBestChain(state, Params());
+    }
+
+    if (!state.IsValid()) {
+        throw JSONRPCError(RPC_DATABASE_ERROR, state.GetRejectReason());
+    }
+
+    return NullUniValue;
+}
+
+UniValue reconsiderblock(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "reconsiderblock \"hash\"\n"
+            "\nRemoves invalidity status of a block and its descendants, reconsider them for activation.\n"
+            "This can be used to undo the effects of invalidateblock.\n"
+            "\nArguments:\n"
+            "1. hash   (string, required) the hash of the block to reconsider\n"
+            "\nResult:\n"
+            "\nExamples:\n"
+            + HelpExampleCli("reconsiderblock", "\"blockhash\"")
+            + HelpExampleRpc("reconsiderblock", "\"blockhash\"")
+        );
+
+    std::string strHash = params[0].get_str();
+    uint256 hash(uint256S(strHash));
+    CValidationState state;
+
+    {
+        LOCK(cs_main);
+        if (mapBlockIndex.count(hash) == 0)
+            throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Block not found");
+
+        CBlockIndex* pblockindex = mapBlockIndex[hash];
+        ReconsiderBlock(state, pblockindex);
+    }
+
+    if (state.IsValid()) {
+        ActivateBestChain(state, Params());
+    }
+
+    if (!state.IsValid()) {
+        throw JSONRPCError(RPC_DATABASE_ERROR, state.GetRejectReason());
+    }
+
+    return NullUniValue;
+}
+
+static const CRPCCommand commands[] =
+{ //  category              name                      actor (function)         okSafeMode
+  //  --------------------- ------------------------  -----------------------  ----------
+    { "blockchain",         "getblockchaininfo",      &getblockchaininfo,      true  },
+    { "blockchain",         "getbestblockhash",       &getbestblockhash,       true  },
+    { "blockchain",         "getblockcount",          &getblockcount,          true  },
+    { "blockchain",         "getblock",               &getblock,               true  },
+    { "blockchain",         "getblockhash",           &getblockhash,           true  },
+    { "blockchain",         "getblockheader",         &getblockheader,         true  },
+    { "blockchain",         "getchaintips",           &getchaintips,           true  },
+    { "blockchain",         "z_gettreestate",         &z_gettreestate,         true  },
+    { "blockchain",         "getdifficulty",          &getdifficulty,          true  },
+    { "blockchain",         "getmempoolinfo",         &getmempoolinfo,         true  },
+    { "blockchain",         "getrawmempool",          &getrawmempool,          true  },
+    { "blockchain",         "gettxout",               &gettxout,               true  },
+    { "blockchain",         "gettxoutsetinfo",        &gettxoutsetinfo,        true  },
+    { "blockchain",         "verifychain",            &verifychain,            true  },
+
+    // insightexplorer
+    { "blockchain",         "getblockdeltas",         &getblockdeltas,         false },
+    { "blockchain",         "getblockhashes",         &getblockhashes,         true  },
+
+    /* Not shown in help */
+    { "hidden",             "invalidateblock",        &invalidateblock,        true  },
+    { "hidden",             "reconsiderblock",        &reconsiderblock,        true  },
+};
+
+void RegisterBlockchainRPCCommands(CRPCTable &tableRPC)
+{
+    for (unsigned int vcidx = 0; vcidx < ARRAYLEN(commands); vcidx++)
+        tableRPC.appendCommand(commands[vcidx].name, &commands[vcidx]);
+}
diff --git a/depend/zcash/src/rpc/client.cpp b/depend/zcash/src/rpc/client.cpp
new file mode 100644
index 000000000..67a602061
--- /dev/null
+++ b/depend/zcash/src/rpc/client.cpp
@@ -0,0 +1,205 @@
+// Copyright (c) 2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "rpc/client.h"
+#include "rpc/protocol.h"
+#include "util.h"
+
+#include <set>
+#include <stdint.h>
+
+#include <univalue.h>
+
+using namespace std;
+
+class CRPCConvertParam
+{
+public:
+    std::string methodName; //!< method whose params want conversion
+    int paramIdx;           //!< 0-based idx of param to convert
+};
+
+static const CRPCConvertParam vRPCConvertParams[] =
+{
+    { "stop", 0 },
+    { "setmocktime", 0 },
+    { "getaddednodeinfo", 0 },
+    { "setgenerate", 0 },
+    { "setgenerate", 1 },
+    { "generate", 0 },
+    { "getnetworkhashps", 0 },
+    { "getnetworkhashps", 1 },
+    { "getnetworksolps", 0 },
+    { "getnetworksolps", 1 },
+    { "sendtoaddress", 1 },
+    { "sendtoaddress", 4 },
+    { "settxfee", 0 },
+    { "getreceivedbyaddress", 1 },
+    { "getreceivedbyaddress", 2 },
+    { "listreceivedbyaddress", 0 },
+    { "listreceivedbyaddress", 1 },
+    { "listreceivedbyaddress", 2 },
+    { "getbalance", 1 },
+    { "getbalance", 2 },
+    { "getbalance", 3 },
+    { "getblockhash", 0 },
+    { "listtransactions", 1 },
+    { "listtransactions", 2 },
+    { "listtransactions", 3 },
+    { "walletpassphrase", 1 },
+    { "getblocktemplate", 0 },
+    { "listsinceblock", 1 },
+    { "listsinceblock", 2 },
+    { "sendmany", 1 },
+    { "sendmany", 2 },
+    { "sendmany", 4 },
+    { "addmultisigaddress", 0 },
+    { "addmultisigaddress", 1 },
+    { "createmultisig", 0 },
+    { "createmultisig", 1 },
+    { "listunspent", 0 },
+    { "listunspent", 1 },
+    { "listunspent", 2 },
+    { "getblock", 1 },
+    { "getblockheader", 1 },
+    { "gettransaction", 1 },
+    { "getrawtransaction", 1 },
+    { "createrawtransaction", 0 },
+    { "createrawtransaction", 1 },
+    { "createrawtransaction", 2 },
+    { "createrawtransaction", 3 },
+    { "signrawtransaction", 1 },
+    { "signrawtransaction", 2 },
+    { "sendrawtransaction", 1 },
+    { "fundrawtransaction", 1 },
+    { "gettxout", 1 },
+    { "gettxout", 2 },
+    { "gettxoutproof", 0 },
+    { "lockunspent", 0 },
+    { "lockunspent", 1 },
+    { "importprivkey", 2 },
+    { "importaddress", 2 },
+    { "importaddress", 3 },
+    { "importpubkey", 2 },
+    { "verifychain", 0 },
+    { "verifychain", 1 },
+    { "keypoolrefill", 0 },
+    { "getrawmempool", 0 },
+    { "estimatefee", 0 },
+    { "estimatepriority", 0 },
+    { "prioritisetransaction", 1 },
+    { "prioritisetransaction", 2 },
+    { "setban", 2 },
+    { "setban", 3 },
+    { "getspentinfo", 0},
+    { "getaddresstxids", 0},
+    { "getaddressbalance", 0},
+    { "getaddressdeltas", 0},
+    { "getaddressutxos", 0},
+    { "getaddressmempool", 0},
+    { "getblockhashes", 0},
+    { "getblockhashes", 1},
+    { "getblockhashes", 2},
+    { "getblockdeltas", 0},
+    { "zcrawjoinsplit", 1 },
+    { "zcrawjoinsplit", 2 },
+    { "zcrawjoinsplit", 3 },
+    { "zcrawjoinsplit", 4 },
+    { "zcbenchmark", 1 },
+    { "zcbenchmark", 2 },
+    { "getblocksubsidy", 0},
+    { "z_listaddresses", 0},
+    { "z_listreceivedbyaddress", 1},
+    { "z_listunspent", 0 },
+    { "z_listunspent", 1 },
+    { "z_listunspent", 2 },
+    { "z_listunspent", 3 },
+    { "z_getaddressforaccount", 0},
+    { "z_getaddressforaccount", 1},
+    { "z_getaddressforaccount", 2},
+    { "z_getbalance", 1},
+    { "z_getbalance", 2},
+    { "z_getbalanceforaccount", 0},
+    { "z_getbalanceforaccount", 1},
+    { "z_getbalanceforaddress", 1},
+    { "z_gettotalbalance", 0},
+    { "z_gettotalbalance", 1},
+    { "z_gettotalbalance", 2},
+    { "z_mergetoaddress", 0},
+    { "z_mergetoaddress", 2},
+    { "z_mergetoaddress", 3},
+    { "z_mergetoaddress", 4},
+    { "z_sendmany", 1},
+    { "z_sendmany", 2},
+    { "z_sendmany", 3},
+    { "z_shieldcoinbase", 2},
+    { "z_shieldcoinbase", 3},
+    { "z_getoperationstatus", 0},
+    { "z_getoperationresult", 0},
+    { "z_importkey", 2 },
+    { "z_importviewingkey", 2 },
+    { "z_getpaymentdisclosure", 1},
+    { "z_getpaymentdisclosure", 2},
+    { "z_setmigration", 0},
+    { "z_getnotescount", 0},
+};
+
+class CRPCConvertTable
+{
+private:
+    std::set<std::pair<std::string, int> > members;
+
+public:
+    CRPCConvertTable();
+
+    bool convert(const std::string& method, int idx) {
+        return (members.count(std::make_pair(method, idx)) > 0);
+    }
+};
+
+CRPCConvertTable::CRPCConvertTable()
+{
+    const unsigned int n_elem =
+        (sizeof(vRPCConvertParams) / sizeof(vRPCConvertParams[0]));
+
+    for (unsigned int i = 0; i < n_elem; i++) {
+        members.insert(std::make_pair(vRPCConvertParams[i].methodName,
+                                      vRPCConvertParams[i].paramIdx));
+    }
+}
+
+static CRPCConvertTable rpcCvtTable;
+
+/** Non-RFC4627 JSON parser, accepts internal values (such as numbers, true, false, null)
+ * as well as objects and arrays.
+ */
+UniValue ParseNonRFCJSONValue(const std::string& strVal)
+{
+    UniValue jVal;
+    if (!jVal.read(std::string("[")+strVal+std::string("]")) ||
+        !jVal.isArray() || jVal.size()!=1)
+        throw runtime_error(string("Error parsing JSON:")+strVal);
+    return jVal[0];
+}
+
+/** Convert strings to command-specific RPC representation */
+UniValue RPCConvertValues(const std::string &strMethod, const std::vector<std::string> &strParams)
+{
+    UniValue params(UniValue::VARR);
+
+    for (unsigned int idx = 0; idx < strParams.size(); idx++) {
+        const std::string& strVal = strParams[idx];
+
+        if (!rpcCvtTable.convert(strMethod, idx)) {
+            // insert string value directly
+            params.push_back(strVal);
+        } else {
+            // parse string as JSON, insert bool/number/object/etc. value
+            params.push_back(ParseNonRFCJSONValue(strVal));
+        }
+    }
+
+    return params;
+}
diff --git a/depend/zcash/src/rpc/client.h b/depend/zcash/src/rpc/client.h
new file mode 100644
index 000000000..4b17c57b1
--- /dev/null
+++ b/depend/zcash/src/rpc/client.h
@@ -0,0 +1,17 @@
+// Copyright (c) 2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_RPC_CLIENT_H
+#define BITCOIN_RPC_CLIENT_H
+
+#include <univalue.h>
+
+UniValue RPCConvertValues(const std::string& strMethod, const std::vector<std::string>& strParams);
+/** Non-RFC4627 JSON parser, accepts internal values (such as numbers, true, false, null)
+ * as well as objects and arrays.
+ */
+UniValue ParseNonRFCJSONValue(const std::string& strVal);
+
+#endif // BITCOIN_RPC_CLIENT_H
diff --git a/depend/zcash/src/rpc/mining.cpp b/depend/zcash/src/rpc/mining.cpp
new file mode 100644
index 000000000..03a65d59e
--- /dev/null
+++ b/depend/zcash/src/rpc/mining.cpp
@@ -0,0 +1,1080 @@
+// Copyright (c) 2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "amount.h"
+#include "chainparams.h"
+#include "consensus/consensus.h"
+#include "consensus/funding.h"
+#include "consensus/validation.h"
+#include "core_io.h"
+#ifdef ENABLE_MINING
+#include "crypto/equihash.h"
+#endif
+#include "init.h"
+#include "key_io.h"
+#include "main.h"
+#include "metrics.h"
+#include "miner.h"
+#include "net.h"
+#include "pow.h"
+#include "rpc/server.h"
+#include "txmempool.h"
+#include "util.h"
+#include "validationinterface.h"
+#ifdef ENABLE_WALLET
+#include "wallet/wallet.h"
+#endif
+
+#include <stdint.h>
+#include <variant>
+
+#include <boost/assign/list_of.hpp>
+#include <boost/shared_ptr.hpp>
+
+#include <univalue.h>
+
+using namespace std;
+
+/**
+ * Return average network hashes per second based on the last 'lookup' blocks,
+ * or over the difficulty averaging window if 'lookup' is nonpositive.
+ * If 'height' is nonnegative, compute the estimate at the time when a given block was found.
+ */
+int64_t GetNetworkHashPS(int lookup, int height) {
+    CBlockIndex *pb = chainActive.Tip();
+
+    if (height >= 0 && height < chainActive.Height())
+        pb = chainActive[height];
+
+    if (pb == NULL || !pb->nHeight)
+        return 0;
+
+    // If lookup is nonpositive, then use difficulty averaging window.
+    if (lookup <= 0)
+        lookup = Params().GetConsensus().nPowAveragingWindow;
+
+    // If lookup is larger than chain, then set it to chain length.
+    if (lookup > pb->nHeight)
+        lookup = pb->nHeight;
+
+    CBlockIndex *pb0 = pb;
+    int64_t minTime = pb0->GetBlockTime();
+    int64_t maxTime = minTime;
+    for (int i = 0; i < lookup; i++) {
+        pb0 = pb0->pprev;
+        int64_t time = pb0->GetBlockTime();
+        minTime = std::min(time, minTime);
+        maxTime = std::max(time, maxTime);
+    }
+
+    // In case there's a situation where minTime == maxTime, we don't want a divide by zero exception.
+    if (minTime == maxTime)
+        return 0;
+
+    arith_uint256 workDiff = pb->nChainWork - pb0->nChainWork;
+    int64_t timeDiff = maxTime - minTime;
+
+    return (int64_t)(workDiff.getdouble() / timeDiff);
+}
+
+UniValue getlocalsolps(const UniValue& params, bool fHelp)
+{
+    if (fHelp)
+        throw runtime_error(
+            "getlocalsolps\n"
+            "\nReturns the average local solutions per second since this node was started.\n"
+            "This is the same information shown on the metrics screen (if enabled).\n"
+            "\nResult:\n"
+            "xxx.xxxxx     (numeric) Solutions per second average\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getlocalsolps", "")
+            + HelpExampleRpc("getlocalsolps", "")
+       );
+
+    LOCK(cs_main);
+    return GetLocalSolPS();
+}
+
+UniValue getnetworksolps(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() > 2)
+        throw runtime_error(
+            "getnetworksolps ( blocks height )\n"
+            "\nReturns the estimated network solutions per second based on the last n blocks.\n"
+            "Pass in [blocks] to override # of blocks, -1 specifies over difficulty averaging window.\n"
+            "Pass in [height] to estimate the network speed at the time when a certain block was found.\n"
+            "\nArguments:\n"
+            "1. blocks     (numeric, optional, default=120) The number of blocks, or -1 for blocks over difficulty averaging window.\n"
+            "2. height     (numeric, optional, default=-1) To estimate at the time of the given height.\n"
+            "\nResult:\n"
+            "x             (numeric) Solutions per second estimated\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getnetworksolps", "")
+            + HelpExampleRpc("getnetworksolps", "")
+       );
+
+    LOCK(cs_main);
+    return GetNetworkHashPS(params.size() > 0 ? params[0].get_int() : 120, params.size() > 1 ? params[1].get_int() : -1);
+}
+
+UniValue getnetworkhashps(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() > 2)
+        throw runtime_error(
+            "getnetworkhashps ( blocks height )\n"
+            "\nDEPRECATED - left for backwards-compatibility. Use getnetworksolps instead.\n"
+            "\nReturns the estimated network solutions per second based on the last n blocks.\n"
+            "Pass in [blocks] to override # of blocks, -1 specifies over difficulty averaging window.\n"
+            "Pass in [height] to estimate the network speed at the time when a certain block was found.\n"
+            "\nArguments:\n"
+            "1. blocks     (numeric, optional, default=120) The number of blocks, or -1 for blocks over difficulty averaging window.\n"
+            "2. height     (numeric, optional, default=-1) To estimate at the time of the given height.\n"
+            "\nResult:\n"
+            "x             (numeric) Solutions per second estimated\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getnetworkhashps", "")
+            + HelpExampleRpc("getnetworkhashps", "")
+       );
+
+    LOCK(cs_main);
+    return GetNetworkHashPS(params.size() > 0 ? params[0].get_int() : 120, params.size() > 1 ? params[1].get_int() : -1);
+}
+
+#ifdef ENABLE_MINING
+UniValue getgenerate(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 0)
+        throw runtime_error(
+            "getgenerate\n"
+            "\nReturn if the server is set to generate coins or not. The default is false.\n"
+            "It is set with the command line argument -gen (or " + std::string(BITCOIN_CONF_FILENAME) + " setting gen)\n"
+            "It can also be set with the setgenerate call.\n"
+            "\nResult\n"
+            "true|false      (boolean) If the server is set to generate coins or not\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getgenerate", "")
+            + HelpExampleRpc("getgenerate", "")
+        );
+
+    LOCK(cs_main);
+    return GetBoolArg("-gen", DEFAULT_GENERATE);
+}
+
+UniValue generate(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() < 1 || params.size() > 1)
+        throw runtime_error(
+            "generate numblocks\n"
+            "\nMine blocks immediately (before the RPC call returns)\n"
+            "\nNote: this function can only be used on the regtest network\n"
+            "\nArguments:\n"
+            "1. numblocks    (numeric, required) How many blocks are generated immediately.\n"
+            "\nResult\n"
+            "[ blockhashes ]     (array) hashes of blocks generated\n"
+            "\nExamples:\n"
+            "\nGenerate 11 blocks\n"
+            + HelpExampleCli("generate", "11")
+        );
+
+    if (!Params().MineBlocksOnDemand())
+        throw JSONRPCError(RPC_METHOD_NOT_FOUND, "This method can only be used on regtest");
+
+    int nHeightStart = 0;
+    int nHeightEnd = 0;
+    int nHeight = 0;
+    int nGenerate = params[0].get_int();
+
+    std::optional<MinerAddress> maybeMinerAddress;
+    GetMainSignals().AddressForMining(maybeMinerAddress);
+
+    // Throw an error if no address valid for mining was provided.
+    if (!maybeMinerAddress.has_value()) {
+        throw JSONRPCError(RPC_INTERNAL_ERROR, "No miner address available (mining requires a wallet or -mineraddress)");
+    } else {
+        // Detect and handle keypool exhaustion separately from IsValidMinerAddress().
+        auto resv = std::get_if<boost::shared_ptr<CReserveScript>>(&maybeMinerAddress.value());
+        if (resv && !resv->get()) {
+            throw JSONRPCError(RPC_WALLET_KEYPOOL_RAN_OUT, "Error: Keypool ran out, please call keypoolrefill first");
+        }
+
+        // Catch any other invalid miner address issues.
+        if (!std::visit(IsValidMinerAddress(), maybeMinerAddress.value())) {
+            throw JSONRPCError(RPC_INTERNAL_ERROR, "Miner address is invalid");
+        }
+    }
+    auto minerAddress = maybeMinerAddress.value();
+
+    {   // Don't keep cs_main locked
+        LOCK(cs_main);
+        nHeightStart = chainActive.Height();
+        nHeight = nHeightStart;
+        nHeightEnd = nHeightStart+nGenerate;
+    }
+    unsigned int nExtraNonce = 0;
+    UniValue blockHashes(UniValue::VARR);
+    unsigned int n = Params().GetConsensus().nEquihashN;
+    unsigned int k = Params().GetConsensus().nEquihashK;
+    while (nHeight < nHeightEnd)
+    {
+        std::unique_ptr<CBlockTemplate> pblocktemplate(CreateNewBlock(Params(), minerAddress));
+        if (!pblocktemplate.get())
+            throw JSONRPCError(RPC_INTERNAL_ERROR, "Couldn't create new block");
+        CBlock *pblock = &pblocktemplate->block;
+        {
+            LOCK(cs_main);
+            IncrementExtraNonce(pblocktemplate.get(), chainActive.Tip(), nExtraNonce, Params().GetConsensus());
+        }
+
+        // Hash state
+        eh_HashState eh_state;
+        EhInitialiseState(n, k, eh_state);
+
+        // I = the block header minus nonce and solution.
+        CEquihashInput I{*pblock};
+        CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+        ss << I;
+
+        // H(I||...
+        eh_state.Update((unsigned char*)&ss[0], ss.size());
+
+        while (true) {
+            // Yes, there is a chance every nonce could fail to satisfy the -regtest
+            // target -- 1 in 2^(2^256). That ain't gonna happen
+            pblock->nNonce = ArithToUint256(UintToArith256(pblock->nNonce) + 1);
+
+            // H(I||V||...
+            eh_HashState curr_state(eh_state);
+            curr_state.Update(pblock->nNonce.begin(), pblock->nNonce.size());
+
+            // (x_1, x_2, ...) = A(I, V, n, k)
+            std::function<bool(std::vector<unsigned char>)> validBlock =
+                    [&pblock](std::vector<unsigned char> soln) {
+                pblock->nSolution = soln;
+                solutionTargetChecks.increment();
+                return CheckProofOfWork(pblock->GetHash(), pblock->nBits, Params().GetConsensus());
+            };
+            bool found = EhBasicSolveUncancellable(n, k, curr_state, validBlock);
+            ehSolverRuns.increment();
+            if (found) {
+                goto endloop;
+            }
+        }
+endloop:
+        CValidationState state;
+        if (!ProcessNewBlock(state, Params(), NULL, pblock, true, NULL))
+            throw JSONRPCError(RPC_INTERNAL_ERROR, "ProcessNewBlock, block not accepted");
+        ++nHeight;
+        blockHashes.push_back(pblock->GetHash().GetHex());
+
+        //mark miner address as important because it was used at least for one coinbase output
+        std::visit(KeepMinerAddress(), minerAddress);
+    }
+    return blockHashes;
+}
+
+UniValue setgenerate(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() < 1 || params.size() > 2)
+        throw runtime_error(
+            "setgenerate generate ( genproclimit )\n"
+            "\nSet 'generate' true or false to turn generation on or off.\n"
+            "Generation is limited to 'genproclimit' processors, -1 is unlimited.\n"
+            "See the getgenerate call for the current setting.\n"
+            "\nArguments:\n"
+            "1. generate         (boolean, required) Set to true to turn on generation, off to turn off.\n"
+            "2. genproclimit     (numeric, optional) Set the processor limit for when generation is on. Can be -1 for unlimited.\n"
+            "\nExamples:\n"
+            "\nSet the generation on with a limit of one processor\n"
+            + HelpExampleCli("setgenerate", "true 1") +
+            "\nCheck the setting\n"
+            + HelpExampleCli("getgenerate", "") +
+            "\nTurn off generation\n"
+            + HelpExampleCli("setgenerate", "false") +
+            "\nUsing json rpc\n"
+            + HelpExampleRpc("setgenerate", "true, 1")
+        );
+
+    if (Params().MineBlocksOnDemand())
+        throw JSONRPCError(RPC_METHOD_NOT_FOUND, "Use the generate method instead of setgenerate on this network");
+
+    bool fGenerate = true;
+    if (params.size() > 0)
+        fGenerate = params[0].get_bool();
+
+    int nGenProcLimit = GetArg("-genproclimit", DEFAULT_GENERATE_THREADS);
+    if (params.size() > 1)
+    {
+        nGenProcLimit = params[1].get_int();
+        if (nGenProcLimit == 0)
+            fGenerate = false;
+    }
+
+    mapArgs["-gen"] = (fGenerate ? "1" : "0");
+    mapArgs ["-genproclimit"] = itostr(nGenProcLimit);
+    GenerateBitcoins(fGenerate, nGenProcLimit, Params());
+
+    return NullUniValue;
+}
+#endif
+
+UniValue getmininginfo(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 0)
+        throw runtime_error(
+            "getmininginfo\n"
+            "\nReturns a json object containing mining-related information."
+            "\nResult:\n"
+            "{\n"
+            "  \"blocks\": nnn,             (numeric) The current block\n"
+            "  \"currentblocksize\": nnn,   (numeric, optional) The block size of the last assembled block (only present if a block was ever assembled)\n"
+            "  \"currentblocktx\": nnn,     (numeric, optional) The number of block non-coinbase transactions of the last assembled block (only present if a block was ever assembled)\n"
+            "  \"difficulty\": xxx.xxxxx    (numeric) The current difficulty\n"
+            "  \"errors\": \"...\"          (string) Current errors\n"
+            "  \"generate\": true|false     (boolean) If the generation is on or off (see getgenerate or setgenerate calls)\n"
+            "  \"genproclimit\": n          (numeric) The processor limit for generation. -1 if no generation. (see getgenerate or setgenerate calls)\n"
+            "  \"localsolps\": xxx.xxxxx    (numeric) The average local solution rate in Sol/s since this node was started\n"
+            "  \"networksolps\": x          (numeric) The estimated network solution rate in Sol/s\n"
+            "  \"pooledtx\": n              (numeric) The size of the mem pool\n"
+            "  \"testnet\": true|false      (boolean) If using testnet or not\n"
+            "  \"chain\": \"xxxx\",         (string) current network name as defined in BIP70 (main, test, regtest)\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getmininginfo", "")
+            + HelpExampleRpc("getmininginfo", "")
+        );
+
+
+    LOCK(cs_main);
+
+    UniValue obj(UniValue::VOBJ);
+    obj.pushKV("blocks",           (int)chainActive.Height());
+    if (last_block_size.has_value()) obj.pushKV("currentblocksize", last_block_size.value());
+    if (last_block_num_txs.has_value()) obj.pushKV("currentblocktx", last_block_num_txs.value());
+    obj.pushKV("difficulty",       (double)GetNetworkDifficulty());
+    auto warnings = GetWarnings("statusbar");
+    obj.pushKV("errors",           warnings.first);
+    obj.pushKV("errorstimestamp",  warnings.second);
+    obj.pushKV("genproclimit",     (int)GetArg("-genproclimit", DEFAULT_GENERATE_THREADS));
+    obj.pushKV("localsolps"  ,     getlocalsolps(params, false));
+    obj.pushKV("networksolps",     getnetworksolps(params, false));
+    obj.pushKV("networkhashps",    getnetworksolps(params, false));
+    obj.pushKV("pooledtx",         (uint64_t)mempool.size());
+    obj.pushKV("testnet",          Params().TestnetToBeDeprecatedFieldRPC());
+    obj.pushKV("chain",            Params().NetworkIDString());
+#ifdef ENABLE_MINING
+    obj.pushKV("generate",         getgenerate(params, false));
+#endif
+    return obj;
+}
+
+
+// NOTE: Unlike wallet RPC (which use BTC values), mining RPCs follow GBT (BIP 22) in using satoshi amounts
+UniValue prioritisetransaction(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 3)
+        throw runtime_error(
+            "prioritisetransaction <txid> <priority delta> <fee delta>\n"
+            "Accepts the transaction into mined blocks at a higher (or lower) priority\n"
+            "\nArguments:\n"
+            "1. \"txid\"       (string, required) The transaction id.\n"
+            "2. priority delta (numeric, required) The priority to add or subtract.\n"
+            "                  The transaction selection algorithm considers the tx as it would have a higher priority.\n"
+            "                  (priority of a transaction is calculated: coinage * value_in_satoshis / txsize) \n"
+            "3. fee delta      (numeric, required) The fee value (in satoshis) to add (or subtract, if negative).\n"
+            "                  The fee is not actually paid, only the algorithm for selecting transactions into a block\n"
+            "                  considers the transaction as it would have paid a higher (or lower) fee.\n"
+            "\nResult\n"
+            "true              (boolean) Returns true\n"
+            "\nExamples:\n"
+            + HelpExampleCli("prioritisetransaction", "\"txid\" 0.0 10000")
+            + HelpExampleRpc("prioritisetransaction", "\"txid\", 0.0, 10000")
+        );
+
+    LOCK(cs_main);
+
+    uint256 hash = ParseHashStr(params[0].get_str(), "txid");
+    CAmount nAmount = params[2].get_int64();
+
+    mempool.PrioritiseTransaction(hash, params[0].get_str(), params[1].get_real(), nAmount);
+    return true;
+}
+
+
+// NOTE: Assumes a conclusive result; if result is inconclusive, it must be handled by caller
+static UniValue BIP22ValidationResult(const CValidationState& state)
+{
+    if (state.IsValid())
+        return NullUniValue;
+
+    std::string strRejectReason = state.GetRejectReason();
+    if (state.IsError())
+        throw JSONRPCError(RPC_VERIFY_ERROR, strRejectReason);
+    if (state.IsInvalid())
+    {
+        if (strRejectReason.empty())
+            return "rejected";
+        return strRejectReason;
+    }
+    // Should be impossible
+    return "valid?";
+}
+
+UniValue getblocktemplate(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() > 1)
+        throw runtime_error(
+            "getblocktemplate ( \"jsonrequestobject\" )\n"
+            "\nIf the request parameters include a 'mode' key, that is used to explicitly select between the default 'template' request or a 'proposal'.\n"
+            "It returns data needed to construct a block to work on.\n"
+            "See https://en.bitcoin.it/wiki/BIP_0022 for full specification.\n"
+
+            "\nTo obtain information about founder's reward or funding stream\n"
+            "amounts, use 'getblocksubsidy HEIGHT' passing in the height returned\n"
+            "by this API.\n"
+
+            "\nThe roots returned in 'defaultroots' are only valid if the block template is\n"
+            "used unmodified. If any part of the block template marked as 'mutable' in the\n"
+            "output is mutated, these roots may need to be recomputed. For more information\n"
+            "on the derivation process, see ZIP 244.\n"
+
+            "\nArguments:\n"
+            "1. \"jsonrequestobject\"       (string, optional) A json object in the following spec\n"
+            "     {\n"
+            "       \"mode\":\"template,\"    (string, optional) This must be set to \"template\" or omitted\n"
+            "       \"capabilities\":[      (array, optional) A list of strings\n"
+            "           \"support\"         (string) client side supported feature, 'longpoll', 'coinbasetxn', 'coinbasevalue', 'proposal', 'serverlist', 'workid'\n"
+            "           ,...\n"
+            "         ],\n"
+            "       \"longpollid\":\"id\"     (string, optional) id to wait for\n"
+            "     }\n"
+            "\n"
+
+            "\nResult:\n"
+            "{\n"
+            "  \"version\" : n,                     (numeric) The block version\n"
+            "  \"previousblockhash\" : \"xxxx\",      (string) The hash of current highest block\n"
+            "  \"blockcommitmentshash\" : \"xxxx\",   (string) (DEPRECATED) The hash of the block commitments field in the block header\n"
+            "  \"lightclientroothash\" : \"xxxx\",    (string) (DEPRECATED) The hash of the light client root field in the block header\n"
+            "  \"finalsaplingroothash\" : \"xxxx\",   (string) (DEPRECATED) The hash of the light client root field in the block header\n"
+            "  \"defaultroots\" : {                 (json object) root hashes that need to be recomputed if the transaction set is modified\n"
+            "     \"merkleroot\" : \"xxxx\"           (string) The hash of the transactions in the block header\n"
+            "     \"chainhistoryroot\" : \"xxxx\"     (string) The hash of the chain history\n"
+            "     \"authdataroot\" : \"xxxx\"         (string) (From NU5) The hash of the authorizing data merkel tree\n"
+            "     \"blockcommitmentshash\" : \"xxxx\" (string) (From NU5) The hash of the block commitments field in the block header\n"
+            "  }\n"
+            "  \"transactions\" : [                 (array) contents of non-coinbase transactions that should be included in the next block\n"
+            "      {\n"
+            "         \"data\" : \"xxxx\",            (string) transaction data encoded in hexadecimal (byte-for-byte)\n"
+            "         \"hash\" : \"xxxx\",            (string) hash/id encoded in little-endian hexadecimal\n"
+            "         \"depends\" : [               (array) array of numbers \n"
+            "             n                       (numeric) transactions before this one (by 1-based index in 'transactions' list) that must be present in the final block if this one is\n"
+            "             ,...\n"
+            "         ],\n"
+            "         \"fee\": n,                   (numeric) difference in value between transaction inputs and outputs (in Satoshis); for coinbase transactions, this is a negative Number of the total collected block fees (ie, not including the block subsidy); if key is not present, fee is unknown and clients MUST NOT assume there isn't one\n"
+            "         \"sigops\" : n,               (numeric) total number of SigOps, as counted for purposes of block limits; if key is not present, sigop count is unknown and clients MUST NOT assume there aren't any\n"
+            "         \"required\" : true|false     (boolean) if provided and true, this transaction must be in the final block\n"
+            "      }\n"
+            "      ,...\n"
+            "  ],\n"
+//            "  \"coinbaseaux\" : {                  (json object) data that should be included in the coinbase's scriptSig content\n"
+//            "      \"flags\" : \"flags\"            (string) \n"
+//            "  },\n"
+//            "  \"coinbasevalue\" : n,               (numeric) maximum allowable input to coinbase transaction, including the generation award and transaction fees (in Satoshis)\n"
+            "  \"coinbasetxn\" : { ... },           (json object) information for coinbase transaction\n"
+            "  \"target\" : \"xxxx\",                 (string) The hash target\n"
+            "  \"longpollid\" : \"str\",              (string) an id to include with a request to longpoll on an update to this template\n"
+            "  \"mintime\" : xxx,                   (numeric) The minimum timestamp appropriate for next block time in seconds since epoch (Jan 1 1970 GMT)\n"
+            "  \"mutable\" : [                      (array of string) list of ways the block template may be changed \n"
+            "     \"value\"                         (string) A way the block template may be changed, e.g. 'time', 'transactions', 'prevblock'\n"
+            "     ,...\n"
+            "  ],\n"
+            "  \"noncerange\" : \"00000000ffffffff\", (string) A range of valid nonces\n"
+            "  \"sigoplimit\" : n,                  (numeric) limit of sigops in blocks\n"
+            "  \"sizelimit\" : n,                   (numeric) limit of block size\n"
+            "  \"curtime\" : ttt,                   (numeric) current timestamp in seconds since epoch (Jan 1 1970 GMT)\n"
+            "  \"bits\" : \"xxx\",                    (string) compressed target of next block\n"
+            "  \"height\" : n                       (numeric) The height of the next block\n"
+            "}\n"
+
+            "\nExamples:\n"
+            + HelpExampleCli("getblocktemplate", "")
+            + HelpExampleRpc("getblocktemplate", "")
+         );
+
+    LOCK(cs_main);
+
+    // Wallet or miner address is required because we support coinbasetxn
+    if (GetArg("-mineraddress", "").empty()) {
+#ifdef ENABLE_WALLET
+        if (!pwalletMain) {
+            throw JSONRPCError(RPC_METHOD_NOT_FOUND, "Wallet disabled and -mineraddress not set");
+        }
+#else
+        throw JSONRPCError(RPC_METHOD_NOT_FOUND, "zcashd compiled without wallet and -mineraddress not set");
+#endif
+    }
+
+    std::string strMode = "template";
+    UniValue lpval = NullUniValue;
+    // TODO: Re-enable coinbasevalue once a specification has been written
+    bool coinbasetxn = true;
+    if (params.size() > 0)
+    {
+        const UniValue& oparam = params[0].get_obj();
+        const UniValue& modeval = find_value(oparam, "mode");
+        if (modeval.isStr())
+            strMode = modeval.get_str();
+        else if (modeval.isNull())
+        {
+            /* Do nothing */
+        }
+        else
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid mode");
+        lpval = find_value(oparam, "longpollid");
+
+        if (strMode == "proposal")
+        {
+            const UniValue& dataval = find_value(oparam, "data");
+            if (!dataval.isStr())
+                throw JSONRPCError(RPC_TYPE_ERROR, "Missing data String key for proposal");
+
+            CBlock block;
+            if (!DecodeHexBlk(block, dataval.get_str()))
+                throw JSONRPCError(RPC_DESERIALIZATION_ERROR, "Block decode failed");
+
+            uint256 hash = block.GetHash();
+            BlockMap::iterator mi = mapBlockIndex.find(hash);
+            if (mi != mapBlockIndex.end()) {
+                CBlockIndex *pindex = mi->second;
+                if (pindex->IsValid(BLOCK_VALID_SCRIPTS))
+                    return "duplicate";
+                if (pindex->nStatus & BLOCK_FAILED_MASK)
+                    return "duplicate-invalid";
+                return "duplicate-inconclusive";
+            }
+
+            CBlockIndex* const pindexPrev = chainActive.Tip();
+            // TestBlockValidity only supports blocks built on the current Tip
+            if (block.hashPrevBlock != pindexPrev->GetBlockHash())
+                return "inconclusive-not-best-prevblk";
+
+            CValidationState state;
+            TestBlockValidity(state, Params(), block, pindexPrev, true);
+            return BIP22ValidationResult(state);
+        }
+    }
+
+    if (strMode != "template")
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid mode");
+
+    if (Params().NetworkIDString() != "regtest" && vNodes.empty())
+        throw JSONRPCError(RPC_CLIENT_NOT_CONNECTED, "Zcash is not connected!");
+
+    if (IsInitialBlockDownload(Params().GetConsensus()))
+        throw JSONRPCError(RPC_CLIENT_IN_INITIAL_DOWNLOAD, "Zcash is downloading blocks...");
+
+    std::optional<MinerAddress> maybeMinerAddress;
+    GetMainSignals().AddressForMining(maybeMinerAddress);
+
+    // Throw an error if no address valid for mining was provided.
+    if (!(maybeMinerAddress.has_value() && std::visit(IsValidMinerAddress(), maybeMinerAddress.value()))) {
+        throw JSONRPCError(RPC_INTERNAL_ERROR, "No miner address available (getblocktemplate requires a wallet or -mineraddress)");
+    }
+    auto minerAddress = maybeMinerAddress.value();
+
+    static unsigned int nTransactionsUpdatedLast;
+    static std::optional<CMutableTransaction> cached_next_cb_mtx;
+    static int cached_next_cb_height;
+
+    // Use the cached shielded coinbase only if the height hasn't changed.
+    const int nHeight = chainActive.Tip()->nHeight;
+    if (cached_next_cb_height != nHeight + 2) {
+        cached_next_cb_mtx = nullopt;
+    }
+
+    std::optional<CMutableTransaction> next_cb_mtx(cached_next_cb_mtx);
+
+    if (!lpval.isNull())
+    {
+        // Wait to respond until either the best block changes, OR some time passes and there are more transactions
+        uint256 hashWatchedChain;
+        boost::system_time checktxtime;
+        unsigned int nTransactionsUpdatedLastLP;
+
+        if (lpval.isStr())
+        {
+            // Format: <hashBestChain><nTransactionsUpdatedLast>
+            std::string lpstr = lpval.get_str();
+
+            hashWatchedChain.SetHex(lpstr.substr(0, 64));
+            nTransactionsUpdatedLastLP = atoi64(lpstr.substr(64));
+        }
+        else
+        {
+            // NOTE: Spec does not specify behaviour for non-string longpollid, but this makes testing easier
+            hashWatchedChain = chainActive.Tip()->GetBlockHash();
+            nTransactionsUpdatedLastLP = nTransactionsUpdatedLast;
+        }
+
+        // Release the main lock while waiting
+        // Don't call chainActive->Tip() without holding cs_main
+        LEAVE_CRITICAL_SECTION(cs_main);
+        {
+            checktxtime = boost::get_system_time() + boost::posix_time::seconds(10);
+
+            boost::unique_lock<boost::mutex> lock(g_best_block_mutex);
+            while (g_best_block == hashWatchedChain && IsRPCRunning())
+            {
+                // Before waiting, generate the coinbase for the block following the next
+                // block (since this is cpu-intensive), so that when next block arrives,
+                // we can quickly respond with a template for following block.
+                // Note that the time to create the coinbase tx here does not add to,
+                // but instead is included in, the 10 second delay, since we're waiting
+                // until an absolute time is reached.
+                if (!cached_next_cb_mtx && IsShieldedMinerAddress(minerAddress)) {
+                    cached_next_cb_height = nHeight + 2;
+                    cached_next_cb_mtx = CreateCoinbaseTransaction(
+                        Params(), CAmount{0}, minerAddress, cached_next_cb_height);
+                    next_cb_mtx = cached_next_cb_mtx;
+                }
+                bool timedout = !g_best_block_cv.timed_wait(lock, checktxtime);
+
+                // Optimization: even if timed out, a new block may have arrived
+                // while waiting for cs_main; if so, don't discard next_cb_mtx.
+                if (g_best_block != hashWatchedChain) break;
+
+                // Timeout: Check transactions for update
+                if (timedout && mempool.GetTransactionsUpdated() != nTransactionsUpdatedLastLP) {
+                    // Create a non-empty block.
+                    next_cb_mtx = nullopt;
+                    break;
+                }
+                checktxtime += boost::posix_time::seconds(10);
+            }
+            if (g_best_block_height != nHeight + 1) {
+                // Unexpected height (reorg or >1 blocks arrived while waiting) invalidates coinbase tx.
+                next_cb_mtx = nullopt;
+            }
+        }
+        ENTER_CRITICAL_SECTION(cs_main);
+
+        if (!IsRPCRunning())
+            throw JSONRPCError(RPC_CLIENT_NOT_CONNECTED, "Shutting down");
+        // TODO: Maybe recheck connections/IBD and (if something wrong) send an expires-immediately template to stop miners?
+    }
+
+    // Update block
+    static CBlockIndex* pindexPrev;
+    static int64_t nStart;
+    static CBlockTemplate* pblocktemplate;
+    if (!lpval.isNull() || pindexPrev != chainActive.Tip() ||
+        (mempool.GetTransactionsUpdated() != nTransactionsUpdatedLast && GetTime() - nStart > 5))
+    {
+        // Clear pindexPrev so future calls make a new block, despite any failures from here on
+        pindexPrev = nullptr;
+
+        nTransactionsUpdatedLast = mempool.GetTransactionsUpdated();
+
+        // If we're going to use the precomputed coinbase (empty block) and there are
+        // transactions waiting in the mempool, make sure that on the next call to this
+        // RPC, we consider the transaction count to have changed so we return a new
+        // template (that includes these transactions) so they don't get stuck.
+        if (next_cb_mtx && mempool.size() > 0) nTransactionsUpdatedLast = 0;
+
+        CBlockIndex* pindexPrevNew = chainActive.Tip();
+        nStart = GetTime();
+
+        // Create new block
+        if(pblocktemplate)
+        {
+            delete pblocktemplate;
+            pblocktemplate = nullptr;
+        }
+
+        // Throw an error if no address valid for mining was provided.
+        if (!std::visit(IsValidMinerAddress(), minerAddress)) {
+            throw JSONRPCError(RPC_INTERNAL_ERROR, "No miner address available (mining requires a wallet or -mineraddress)");
+        }
+
+        pblocktemplate = CreateNewBlock(Params(), minerAddress, next_cb_mtx);
+        if (!pblocktemplate)
+            throw JSONRPCError(RPC_OUT_OF_MEMORY, "Out of memory");
+
+        // Mark script as important because it was used at least for one coinbase output
+        std::visit(KeepMinerAddress(), minerAddress);
+
+        // Need to update only after we know CreateNewBlock succeeded
+        pindexPrev = pindexPrevNew;
+    }
+    CBlock* pblock = &pblocktemplate->block; // pointer for convenience
+
+    const Consensus::Params& consensus = Params().GetConsensus();
+
+    // Update nTime
+    UpdateTime(pblock, consensus, pindexPrev);
+    pblock->nNonce = uint256();
+
+    UniValue aCaps(UniValue::VARR); aCaps.push_back("proposal");
+
+    UniValue txCoinbase = NullUniValue;
+    UniValue transactions(UniValue::VARR);
+    map<uint256, int64_t> setTxIndex;
+    int i = 0;
+    for (const CTransaction& tx : pblock->vtx) {
+        uint256 txHash = tx.GetHash();
+        setTxIndex[txHash] = i++;
+
+        if (tx.IsCoinBase() && !coinbasetxn)
+            continue;
+
+        UniValue entry(UniValue::VOBJ);
+
+        entry.pushKV("data", EncodeHexTx(tx));
+
+        entry.pushKV("hash", txHash.GetHex());
+        entry.pushKV("authdigest", tx.GetAuthDigest().GetHex());
+
+        UniValue deps(UniValue::VARR);
+        for (const CTxIn &in : tx.vin)
+        {
+            if (setTxIndex.count(in.prevout.hash))
+                deps.push_back(setTxIndex[in.prevout.hash]);
+        }
+        entry.pushKV("depends", deps);
+
+        int index_in_template = i - 1;
+        entry.pushKV("fee", pblocktemplate->vTxFees[index_in_template]);
+        entry.pushKV("sigops", pblocktemplate->vTxSigOps[index_in_template]);
+
+        if (tx.IsCoinBase()) {
+            // Show founders' reward if it is required
+            auto nextHeight = pindexPrev->nHeight+1;
+            bool canopyActive = consensus.NetworkUpgradeActive(nextHeight, Consensus::UPGRADE_CANOPY);
+            if (!canopyActive && nextHeight > 0 && nextHeight <= consensus.GetLastFoundersRewardBlockHeight(nextHeight)) {
+                CAmount nBlockSubsidy = GetBlockSubsidy(nextHeight, consensus);
+                entry.pushKV("foundersreward", nBlockSubsidy / 5);
+            }
+            entry.pushKV("required", true);
+            txCoinbase = entry;
+        } else {
+            transactions.push_back(entry);
+        }
+    }
+
+    UniValue aux(UniValue::VOBJ);
+    aux.pushKV("flags", HexStr(COINBASE_FLAGS.begin(), COINBASE_FLAGS.end()));
+
+    arith_uint256 hashTarget = arith_uint256().SetCompact(pblock->nBits);
+
+    static UniValue aMutable(UniValue::VARR);
+    if (aMutable.empty())
+    {
+        aMutable.push_back("time");
+        aMutable.push_back("transactions");
+        aMutable.push_back("prevblock");
+    }
+
+    UniValue result(UniValue::VOBJ);
+    result.pushKV("capabilities", aCaps);
+    result.pushKV("version", pblock->nVersion);
+    result.pushKV("previousblockhash", pblock->hashPrevBlock.GetHex());
+    // The following 3 are deprecated; remove in a future release.
+    result.pushKV("blockcommitmentshash", pblock->hashBlockCommitments.GetHex());
+    result.pushKV("lightclientroothash", pblock->hashBlockCommitments.GetHex());
+    result.pushKV("finalsaplingroothash", pblock->hashBlockCommitments.GetHex());
+    {
+        // These are items in the result object that are valid only if the
+        // block template returned by this RPC is used unmodified. Otherwise,
+        // these values must be recomputed.
+        UniValue defaults(UniValue::VOBJ);
+        defaults.pushKV("merkleroot", pblock->BuildMerkleTree().GetHex());
+        defaults.pushKV("chainhistoryroot", pblocktemplate->hashChainHistoryRoot.GetHex());
+        if (consensus.NetworkUpgradeActive(pindexPrev->nHeight+1, Consensus::UPGRADE_NU5)) {
+            defaults.pushKV("authdataroot", pblocktemplate->hashAuthDataRoot.GetHex());
+            defaults.pushKV("blockcommitmentshash", pblock->hashBlockCommitments.GetHex());
+        }
+        result.pushKV("defaultroots", defaults);
+    }
+    result.pushKV("transactions", transactions);
+    if (coinbasetxn) {
+        assert(txCoinbase.isObject());
+        result.pushKV("coinbasetxn", txCoinbase);
+    } else {
+        result.pushKV("coinbaseaux", aux);
+        result.pushKV("coinbasevalue", (int64_t)pblock->vtx[0].vout[0].nValue);
+    }
+    result.pushKV("longpollid", chainActive.Tip()->GetBlockHash().GetHex() + i64tostr(nTransactionsUpdatedLast));
+    result.pushKV("target", hashTarget.GetHex());
+    result.pushKV("mintime", (int64_t)pindexPrev->GetMedianTimePast()+1);
+    result.pushKV("mutable", aMutable);
+    result.pushKV("noncerange", "00000000ffffffff");
+    result.pushKV("sigoplimit", (int64_t)MAX_BLOCK_SIGOPS);
+    result.pushKV("sizelimit", (int64_t)MAX_BLOCK_SIZE);
+    result.pushKV("curtime", pblock->GetBlockTime());
+    result.pushKV("bits", strprintf("%08x", pblock->nBits));
+    result.pushKV("height", (int64_t)(pindexPrev->nHeight+1));
+
+    return result;
+}
+
+class submitblock_StateCatcher : public CValidationInterface
+{
+public:
+    uint256 hash;
+    bool found;
+    CValidationState state;
+
+    submitblock_StateCatcher(const uint256 &hashIn) : hash(hashIn), found(false), state() {};
+
+protected:
+    virtual void BlockChecked(const CBlock& block, const CValidationState& stateIn) {
+        if (block.GetHash() != hash)
+            return;
+        found = true;
+        state = stateIn;
+    };
+};
+
+UniValue submitblock(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() < 1 || params.size() > 2)
+        throw runtime_error(
+            "submitblock \"hexdata\" ( \"jsonparametersobject\" )\n"
+            "\nAttempts to submit new block to network.\n"
+            "The 'jsonparametersobject' parameter is currently ignored.\n"
+            "See https://en.bitcoin.it/wiki/BIP_0022 for full specification.\n"
+
+            "\nArguments\n"
+            "1. \"hexdata\"    (string, required) the hex-encoded block data to submit\n"
+            "2. \"jsonparametersobject\"     (string, optional) object of optional parameters\n"
+            "    {\n"
+            "      \"workid\" : \"id\"    (string, optional) if the server provided a workid, it MUST be included with submissions\n"
+            "    }\n"
+            "\nResult:\n"
+            "\"duplicate\" - node already has valid copy of block\n"
+            "\"duplicate-invalid\" - node already has block, but it is invalid\n"
+            "\"duplicate-inconclusive\" - node already has block but has not validated it\n"
+            "\"inconclusive\" - node has not validated the block, it may not be on the node's current best chain\n"
+            "\"rejected\" - block was rejected as invalid\n"
+            "For more information on submitblock parameters and results, see: https://github.com/bitcoin/bips/blob/master/bip-0022.mediawiki#block-submission\n"
+            "\nExamples:\n"
+            + HelpExampleCli("submitblock", "\"mydata\"")
+            + HelpExampleRpc("submitblock", "\"mydata\"")
+        );
+
+    CBlock block;
+    if (!DecodeHexBlk(block, params[0].get_str()))
+        throw JSONRPCError(RPC_DESERIALIZATION_ERROR, "Block decode failed");
+
+    uint256 hash = block.GetHash();
+    bool fBlockPresent = false;
+    {
+        LOCK(cs_main);
+        BlockMap::iterator mi = mapBlockIndex.find(hash);
+        if (mi != mapBlockIndex.end()) {
+            CBlockIndex *pindex = mi->second;
+            if (pindex->IsValid(BLOCK_VALID_SCRIPTS))
+                return "duplicate";
+            if (pindex->nStatus & BLOCK_FAILED_MASK)
+                return "duplicate-invalid";
+            // Otherwise, we might only have the header - process the block before returning
+            fBlockPresent = true;
+        }
+    }
+
+    CValidationState state;
+    submitblock_StateCatcher sc(block.GetHash());
+    RegisterValidationInterface(&sc);
+    bool fAccepted = ProcessNewBlock(state, Params(), NULL, &block, true, NULL);
+    UnregisterValidationInterface(&sc);
+    if (fBlockPresent)
+    {
+        if (fAccepted && !sc.found)
+            return "duplicate-inconclusive";
+        return "duplicate";
+    }
+    if (fAccepted)
+    {
+        if (!sc.found)
+            return "inconclusive";
+        state = sc.state;
+    }
+    return BIP22ValidationResult(state);
+}
+
+UniValue estimatefee(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "estimatefee nblocks\n"
+            "\nEstimates the approximate fee per kilobyte\n"
+            "needed for a transaction to begin confirmation\n"
+            "within nblocks blocks.\n"
+            "\nArguments:\n"
+            "1. nblocks     (numeric)\n"
+            "\nResult:\n"
+            "n :    (numeric) estimated fee-per-kilobyte\n"
+            "\n"
+            "-1.0 is returned if not enough transactions and\n"
+            "blocks have been observed to make an estimate.\n"
+            "\nExample:\n"
+            + HelpExampleCli("estimatefee", "6")
+            );
+
+    RPCTypeCheck(params, boost::assign::list_of(UniValue::VNUM));
+
+    int nBlocks = params[0].get_int();
+    if (nBlocks < 1)
+        nBlocks = 1;
+
+    CFeeRate feeRate = mempool.estimateFee(nBlocks);
+    if (feeRate == CFeeRate(0))
+        return -1.0;
+
+    return ValueFromAmount(feeRate.GetFeePerK());
+}
+
+UniValue estimatepriority(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "estimatepriority nblocks\n"
+            "\nEstimates the approximate priority\n"
+            "a zero-fee transaction needs to begin confirmation\n"
+            "within nblocks blocks.\n"
+            "\nArguments:\n"
+            "1. nblocks     (numeric)\n"
+            "\nResult:\n"
+            "n :    (numeric) estimated priority\n"
+            "\n"
+            "-1.0 is returned if not enough transactions and\n"
+            "blocks have been observed to make an estimate.\n"
+            "\nExample:\n"
+            + HelpExampleCli("estimatepriority", "6")
+            );
+
+    RPCTypeCheck(params, boost::assign::list_of(UniValue::VNUM));
+
+    int nBlocks = params[0].get_int();
+    if (nBlocks < 1)
+        nBlocks = 1;
+
+    return mempool.estimatePriority(nBlocks);
+}
+
+UniValue getblocksubsidy(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() > 1)
+        throw runtime_error(
+            "getblocksubsidy height\n"
+            "\nReturns block subsidy reward, taking into account the mining slow start and the founders reward, of block at index provided.\n"
+            "\nArguments:\n"
+            "1. height         (numeric, optional) The block height.  If not provided, defaults to the current height of the chain.\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"miner\" : x.xxx,              (numeric) The mining reward amount in " + CURRENCY_UNIT + ".\n"
+            "  \"founders\" : x.xxx,           (numeric) The founders' reward amount in " + CURRENCY_UNIT + ".\n"
+            "  \"fundingstreams\" : [          (array) An array of funding stream descriptions (present only when Canopy has activated).\n"
+            "    {\n"
+            "      \"recipient\" : \"...\",        (string) A description of the funding stream recipient.\n"
+            "      \"specification\" : \"url\",    (string) A URL for the specification of this funding stream.\n"
+            "      \"value\" : x.xxx             (numeric) The funding stream amount in " + CURRENCY_UNIT + ".\n"
+            "      \"valueZat\" : xxxx           (numeric) The funding stream amount in " + MINOR_CURRENCY_UNIT + ".\n"
+            "      \"address\" :                 (string) The transparent or Sapling address of the funding stream recipient.\n"
+            "    }, ...\n"
+            "  ]\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getblocksubsidy", "1000")
+            + HelpExampleRpc("getblocksubsidy", "1000")
+        );
+
+    LOCK(cs_main);
+    int nHeight = (params.size()==1) ? params[0].get_int() : chainActive.Height();
+    if (nHeight < 0)
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Block height out of range");
+
+    const Consensus::Params& consensus = Params().GetConsensus();
+    CAmount nBlockSubsidy = GetBlockSubsidy(nHeight, consensus);
+    CAmount nMinerReward = nBlockSubsidy;
+    CAmount nFoundersReward = 0;
+    bool canopyActive = consensus.NetworkUpgradeActive(nHeight, Consensus::UPGRADE_CANOPY);
+
+    UniValue result(UniValue::VOBJ);
+    if (canopyActive) {
+        KeyIO keyIO(Params());
+        UniValue fundingstreams(UniValue::VARR);
+        auto fsinfos = Consensus::GetActiveFundingStreams(nHeight, consensus);
+        for (int idx = 0; idx < fsinfos.size(); idx++) {
+            const auto& fsinfo = fsinfos[idx];
+            CAmount nStreamAmount = fsinfo.Value(nBlockSubsidy);
+            nMinerReward -= nStreamAmount;
+
+            UniValue fsobj(UniValue::VOBJ);
+            fsobj.pushKV("recipient", fsinfo.recipient);
+            fsobj.pushKV("specification", fsinfo.specification);
+            fsobj.pushKV("value", ValueFromAmount(nStreamAmount));
+            fsobj.pushKV("valueZat", nStreamAmount);
+
+            auto fs = consensus.vFundingStreams[idx];
+            auto address = fs.value().RecipientAddress(consensus, nHeight);
+
+            CScript* outpoint = std::get_if<CScript>(&address);
+            std::string addressStr;
+
+            if (outpoint != nullptr) {
+                // For transparent funding stream addresses
+                UniValue pubkey(UniValue::VOBJ);
+                ScriptPubKeyToUniv(*outpoint, pubkey, true);
+                addressStr = find_value(pubkey, "addresses").get_array()[0].get_str();
+
+            } else {
+                libzcash::SaplingPaymentAddress* zaddr = std::get_if<libzcash::SaplingPaymentAddress>(&address);
+                if (zaddr != nullptr) {
+                    // For shielded funding stream addresses
+                    addressStr = keyIO.EncodePaymentAddress(*zaddr);
+                }
+            }
+
+            fsobj.pushKV("address", addressStr);
+            fundingstreams.push_back(fsobj);
+        }
+        result.pushKV("fundingstreams", fundingstreams);
+    } else if (nHeight > 0 && nHeight <= consensus.GetLastFoundersRewardBlockHeight(nHeight)) {
+        nFoundersReward = nBlockSubsidy/5;
+        nMinerReward -= nFoundersReward;
+    }
+    result.pushKV("miner", ValueFromAmount(nMinerReward));
+    result.pushKV("founders", ValueFromAmount(nFoundersReward));
+    return result;
+}
+
+static const CRPCCommand commands[] =
+{ //  category              name                      actor (function)         okSafeMode
+  //  --------------------- ------------------------  -----------------------  ----------
+    { "mining",             "getlocalsolps",          &getlocalsolps,          true  },
+    { "mining",             "getnetworksolps",        &getnetworksolps,        true  },
+    { "mining",             "getnetworkhashps",       &getnetworkhashps,       true  },
+    { "mining",             "getmininginfo",          &getmininginfo,          true  },
+    { "mining",             "prioritisetransaction",  &prioritisetransaction,  true  },
+    { "mining",             "getblocktemplate",       &getblocktemplate,       true  },
+    { "mining",             "submitblock",            &submitblock,            true  },
+    { "mining",             "getblocksubsidy",        &getblocksubsidy,        true  },
+
+#ifdef ENABLE_MINING
+    { "generating",         "getgenerate",            &getgenerate,            true  },
+    { "generating",         "setgenerate",            &setgenerate,            true  },
+    { "generating",         "generate",               &generate,               true  },
+#endif
+
+    { "util",               "estimatefee",            &estimatefee,            true  },
+    { "util",               "estimatepriority",       &estimatepriority,       true  },
+};
+
+void RegisterMiningRPCCommands(CRPCTable &tableRPC)
+{
+    for (unsigned int vcidx = 0; vcidx < ARRAYLEN(commands); vcidx++)
+        tableRPC.appendCommand(commands[vcidx].name, &commands[vcidx]);
+}
diff --git a/depend/zcash/src/rpc/misc.cpp b/depend/zcash/src/rpc/misc.cpp
new file mode 100644
index 000000000..86bfae4ed
--- /dev/null
+++ b/depend/zcash/src/rpc/misc.cpp
@@ -0,0 +1,1243 @@
+// Copyright (c) 2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "clientversion.h"
+#include "init.h"
+#include "key_io.h"
+#include "experimental_features.h"
+#include "main.h"
+#include "net.h"
+#include "netbase.h"
+#include "rpc/server.h"
+#include "txmempool.h"
+#include "util.h"
+#ifdef ENABLE_WALLET
+#include "wallet/wallet.h"
+#include "wallet/walletdb.h"
+#endif
+
+#include <stdint.h>
+#include <variant>
+
+#include <boost/assign/list_of.hpp>
+
+#include <univalue.h>
+
+#include "zcash/Address.hpp"
+
+using namespace std;
+
+/**
+ * @note Do not add or change anything in the information returned by this
+ * method. `getinfo` exists for backwards-compatibility only. It combines
+ * information from wildly different sources in the program, which is a mess,
+ * and is thus planned to be deprecated eventually.
+ *
+ * Based on the source of the information, new information should be added to:
+ * - `getblockchaininfo`,
+ * - `getnetworkinfo` or
+ * - `getwalletinfo`
+ *
+ * Or alternatively, create a specific query method for the information.
+ **/
+UniValue getinfo(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 0)
+        throw runtime_error(
+            "getinfo\n"
+            "Returns an object containing various state info.\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"version\": xxxxx,           (numeric) the server version\n"
+            "  \"build\": xxxxx,             (string)  the build number\n"
+            "  \"subversion\": xxxxx,        (string)  the server sub-version identifier\n"
+            "  \"protocolversion\": xxxxx,   (numeric) the protocol version\n"
+            "  \"walletversion\": xxxxx,     (numeric, optional) the wallet version, if wallet functionality is enabled\n"
+            "  \"balance\": xxxxxxx,         (numeric, optional) the total Zcash balance of the wallet, if wallet functionality is enabled\n"
+            "  \"blocks\": xxxxxx,           (numeric) the current number of blocks processed in the server\n"
+            "  \"timeoffset\": xxxxx,        (numeric) the time offset (deprecated; always 0)\n"
+            "  \"connections\": xxxxx,       (numeric) the number of connections\n"
+            "  \"proxy\": \"host:port\",     (string, optional) the proxy used by the server\n"
+            "  \"difficulty\": xxxxxx,       (numeric) the current difficulty\n"
+            "  \"testnet\": true|false,      (boolean) if the server is using testnet or not\n"
+            "  \"keypoololdest\": xxxxxx,    (numeric, optional) the timestamp (seconds since GMT epoch) of the oldest pre-generated key in the key pool, if wallet functionality is enabled\n"
+            "  \"keypoolsize\": xxxx,        (numeric, optional) how many new keys are pre-generated\n"
+            "  \"unlocked_until\": ttt,      (numeric, optional) the timestamp in seconds since epoch (midnight Jan 1 1970 GMT) that the wallet is unlocked for transfers, or 0 if the wallet is locked, if wallet functionality is available and the wallet is encrypted\n"
+            "  \"paytxfee\": x.xxxx,         (numeric) the transaction fee set in " + CURRENCY_UNIT + "/kB\n"
+            "  \"relayfee\": x.xxxx,         (numeric) minimum relay fee for non-free transactions in " + CURRENCY_UNIT + "/kB\n"
+            "  \"errors\": \"...\"           (string) message describing the latest or highest-priority error\n"
+            "  \"errorstimestamp\": \"...\"  (string) timestamp associated with the latest or highest-priority error\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getinfo", "")
+            + HelpExampleRpc("getinfo", "")
+        );
+
+#ifdef ENABLE_WALLET
+    LOCK2(cs_main, pwalletMain ? &pwalletMain->cs_wallet : NULL);
+#else
+    LOCK(cs_main);
+#endif
+
+    proxyType proxy;
+    GetProxy(NET_IPV4, proxy);
+
+    UniValue obj(UniValue::VOBJ);
+    obj.pushKV("version", CLIENT_VERSION);
+    obj.pushKV("build", FormatFullVersion());
+    obj.pushKV("subversion", strSubVersion);
+    obj.pushKV("protocolversion", PROTOCOL_VERSION);
+#ifdef ENABLE_WALLET
+    if (pwalletMain) {
+        obj.pushKV("walletversion", pwalletMain->GetVersion());
+        obj.pushKV("balance",       ValueFromAmount(pwalletMain->GetBalance()));
+    }
+#endif
+    obj.pushKV("blocks",        (int)chainActive.Height());
+    obj.pushKV("timeoffset",    0);
+    obj.pushKV("connections",   (int)vNodes.size());
+    obj.pushKV("proxy",         (proxy.IsValid() ? proxy.proxy.ToStringIPPort() : string()));
+    obj.pushKV("difficulty",    (double)GetDifficulty());
+    obj.pushKV("testnet",       Params().TestnetToBeDeprecatedFieldRPC());
+#ifdef ENABLE_WALLET
+    if (pwalletMain) {
+        obj.pushKV("keypoololdest", pwalletMain->GetOldestKeyPoolTime());
+        obj.pushKV("keypoolsize",   (int)pwalletMain->GetKeyPoolSize());
+    }
+    if (pwalletMain && pwalletMain->IsCrypted())
+        obj.pushKV("unlocked_until", nWalletUnlockTime);
+    obj.pushKV("paytxfee",      ValueFromAmount(payTxFee.GetFeePerK()));
+#endif
+    obj.pushKV("relayfee",      ValueFromAmount(::minRelayTxFee.GetFeePerK()));
+    auto warnings = GetWarnings("statusbar");
+    obj.pushKV("errors",           warnings.first);
+    obj.pushKV("errorstimestamp",  warnings.second);
+    return obj;
+}
+
+#ifdef ENABLE_WALLET
+class DescribeAddressVisitor
+{
+public:
+    UniValue operator()(const CNoDestination &dest) const { return UniValue(UniValue::VOBJ); }
+
+    UniValue operator()(const CKeyID &keyID) const {
+        UniValue obj(UniValue::VOBJ);
+        CPubKey vchPubKey;
+        obj.pushKV("isscript", false);
+        if (pwalletMain && pwalletMain->GetPubKey(keyID, vchPubKey)) {
+            obj.pushKV("pubkey", HexStr(vchPubKey));
+            obj.pushKV("iscompressed", vchPubKey.IsCompressed());
+        }
+        return obj;
+    }
+
+    UniValue operator()(const CScriptID &scriptID) const {
+        KeyIO keyIO(Params());
+        UniValue obj(UniValue::VOBJ);
+        CScript subscript;
+        obj.pushKV("isscript", true);
+        if (pwalletMain && pwalletMain->GetCScript(scriptID, subscript)) {
+            std::vector<CTxDestination> addresses;
+            txnouttype whichType;
+            int nRequired;
+            ExtractDestinations(subscript, whichType, addresses, nRequired);
+            obj.pushKV("script", GetTxnOutputType(whichType));
+            obj.pushKV("hex", HexStr(subscript.begin(), subscript.end()));
+            UniValue a(UniValue::VARR);
+            for (const CTxDestination& addr : addresses) {
+                a.push_back(keyIO.EncodeDestination(addr));
+            }
+            obj.pushKV("addresses", a);
+            if (whichType == TX_MULTISIG)
+                obj.pushKV("sigsrequired", nRequired);
+        }
+        return obj;
+    }
+};
+#endif
+
+UniValue validateaddress(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "validateaddress \"zcashaddress\"\n"
+            "\nReturn information about the given Zcash address.\n"
+            "\nArguments:\n"
+            "1. \"zcashaddress\"     (string, required) The Zcash address to validate\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"isvalid\" : true|false,         (boolean) If the address is valid or not. If not, this is the only property returned.\n"
+            "  \"address\" : \"zcashaddress\",   (string) The Zcash address validated\n"
+            "  \"scriptPubKey\" : \"hex\",       (string) The hex encoded scriptPubKey generated by the address\n"
+            "  \"ismine\" : true|false,          (boolean) If the address is yours or not\n"
+            "  \"isscript\" : true|false,        (boolean) If the key is a script\n"
+            "  \"pubkey\" : \"publickeyhex\",    (string) The hex value of the raw public key\n"
+            "  \"iscompressed\" : true|false,    (boolean) If the address is compressed\n"
+            "  \"account\" : \"account\"         (string) DEPRECATED. The account associated with the address, \"\" is the default account\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("validateaddress", "\"1PSSGeFHDnKNxiEyFrD1wcEaHr9hrQDDWc\"")
+            + HelpExampleRpc("validateaddress", "\"1PSSGeFHDnKNxiEyFrD1wcEaHr9hrQDDWc\"")
+        );
+
+#ifdef ENABLE_WALLET
+    LOCK2(cs_main, pwalletMain ? &pwalletMain->cs_wallet : NULL);
+#else
+    LOCK(cs_main);
+#endif
+
+    KeyIO keyIO(Params());
+    CTxDestination dest = keyIO.DecodeDestination(params[0].get_str());
+    bool isValid = IsValidDestination(dest);
+
+    UniValue ret(UniValue::VOBJ);
+    ret.pushKV("isvalid", isValid);
+    if (isValid)
+    {
+        std::string currentAddress = keyIO.EncodeDestination(dest);
+        ret.pushKV("address", currentAddress);
+
+        CScript scriptPubKey = GetScriptForDestination(dest);
+        ret.pushKV("scriptPubKey", HexStr(scriptPubKey.begin(), scriptPubKey.end()));
+
+#ifdef ENABLE_WALLET
+        isminetype mine = pwalletMain ? IsMine(*pwalletMain, dest) : ISMINE_NO;
+        ret.pushKV("ismine", (mine & ISMINE_SPENDABLE) ? true : false);
+        ret.pushKV("iswatchonly", (mine & ISMINE_WATCH_ONLY) ? true: false);
+        UniValue detail = std::visit(DescribeAddressVisitor(), dest);
+        ret.pushKVs(detail);
+        if (pwalletMain && pwalletMain->mapAddressBook.count(dest))
+            ret.pushKV("account", pwalletMain->mapAddressBook[dest].name);
+#endif
+    }
+    return ret;
+}
+
+
+class DescribePaymentAddressVisitor
+{
+public:
+    UniValue operator()(const CKeyID &addr) const {
+        UniValue obj(UniValue::VOBJ);
+        obj.pushKV("type", "p2pkh");
+#ifdef ENABLE_WALLET
+        if (pwalletMain) {
+            obj.pushKV("ismine", pwalletMain->HaveKey(addr));
+        }
+#endif
+        return obj;
+    }
+
+    UniValue operator()(const CScriptID &addr) const {
+        UniValue obj(UniValue::VOBJ);
+        obj.pushKV("type", "p2sh");
+#ifdef ENABLE_WALLET
+        if (pwalletMain) {
+            obj.pushKV("ismine", pwalletMain->HaveCScript(addr));
+        }
+#endif
+        return obj;
+    }
+
+    UniValue operator()(const libzcash::SproutPaymentAddress &zaddr) const {
+        UniValue obj(UniValue::VOBJ);
+        obj.pushKV("type", "sprout");
+        obj.pushKV("payingkey", zaddr.a_pk.GetHex());
+        obj.pushKV("transmissionkey", zaddr.pk_enc.GetHex());
+#ifdef ENABLE_WALLET
+        if (pwalletMain) {
+            obj.pushKV("ismine", pwalletMain->HaveSproutSpendingKey(zaddr));
+        }
+#endif
+        return obj;
+    }
+
+    UniValue operator()(const libzcash::SaplingPaymentAddress &zaddr) const {
+        UniValue obj(UniValue::VOBJ);
+        obj.pushKV("type", "sapling");
+        obj.pushKV("diversifier", HexStr(zaddr.d));
+        obj.pushKV("diversifiedtransmissionkey", zaddr.pk_d.GetHex());
+#ifdef ENABLE_WALLET
+        if (pwalletMain) {
+            obj.pushKV("ismine", pwalletMain->HaveSaplingSpendingKeyForAddress(zaddr));
+        }
+#endif
+        return obj;
+    }
+
+    UniValue operator()(const libzcash::UnifiedAddress &uaddr) const {
+        UniValue obj(UniValue::VOBJ);
+        obj.pushKV("type", "unified");
+        // TODO: More information.
+        return obj;
+    }
+};
+
+UniValue z_validateaddress(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "z_validateaddress \"address\"\n"
+            "\nReturn information about the given address.\n"
+            "\nArguments:\n"
+            "1. \"address\"   (string, required) The address to validate\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"isvalid\" : true|false,        (boolean) If the address is valid or not. If not, this is the only property returned.\n"
+            "  \"address\" : \"addr\",          (string) The address validated\n"
+            "  \"type\" : \"xxxx\",             (string) \"p2pkh\", \"p2sh\", \"sprout\" or \"sapling\"\n"
+            "  \"ismine\" : true|false,         (boolean) If the address is yours or not\n"
+            "  \"payingkey\" : \"hex\",         (string) [sprout] The hex value of the paying key, a_pk\n"
+            "  \"transmissionkey\" : \"hex\",   (string) [sprout] The hex value of the transmission key, pk_enc\n"
+            "  \"diversifier\" : \"hex\",       (string) [sapling] The hex value of the diversifier, d\n"
+            "  \"diversifiedtransmissionkey\" : \"hex\", (string) [sapling] The hex value of pk_d\n"
+
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("z_validateaddress", "\"zcWsmqT4X2V4jgxbgiCzyrAfRT1vi1F4sn7M5Pkh66izzw8Uk7LBGAH3DtcSMJeUb2pi3W4SQF8LMKkU2cUuVP68yAGcomL\"")
+            + HelpExampleRpc("z_validateaddress", "\"zcWsmqT4X2V4jgxbgiCzyrAfRT1vi1F4sn7M5Pkh66izzw8Uk7LBGAH3DtcSMJeUb2pi3W4SQF8LMKkU2cUuVP68yAGcomL\"")
+        );
+
+
+#ifdef ENABLE_WALLET
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+#else
+    LOCK(cs_main);
+#endif
+
+    KeyIO keyIO(Params());
+    string strAddress = params[0].get_str();
+    auto address = keyIO.DecodePaymentAddress(strAddress);
+    bool isValid = address.has_value();
+
+    UniValue ret(UniValue::VOBJ);
+    ret.pushKV("isvalid", isValid);
+    if (isValid)
+    {
+        ret.pushKV("address", strAddress);
+        UniValue detail = std::visit(DescribePaymentAddressVisitor(), address.value());
+        ret.pushKVs(detail);
+    }
+    return ret;
+}
+
+
+/**
+ * Used by addmultisigaddress / createmultisig:
+ */
+CScript _createmultisig_redeemScript(const UniValue& params)
+{
+    int nRequired = params[0].get_int();
+    const UniValue& keys = params[1].get_array();
+
+    // Gather public keys
+    if (nRequired < 1)
+        throw runtime_error("a multisignature address must require at least one key to redeem");
+    if ((int)keys.size() < nRequired)
+        throw runtime_error(
+            strprintf("not enough keys supplied "
+                      "(got %u keys, but need at least %d to redeem)", keys.size(), nRequired));
+    if (keys.size() > 16)
+        throw runtime_error("Number of addresses involved in the multisignature address creation > 16\nReduce the number");
+
+    KeyIO keyIO(Params());
+
+    std::vector<CPubKey> pubkeys;
+    pubkeys.resize(keys.size());
+    for (unsigned int i = 0; i < keys.size(); i++)
+    {
+        const std::string& ks = keys[i].get_str();
+#ifdef ENABLE_WALLET
+        // Case 1: Bitcoin address and we have full public key:
+        CTxDestination dest = keyIO.DecodeDestination(ks);
+        if (pwalletMain && IsValidDestination(dest)) {
+            const CKeyID *keyID = std::get_if<CKeyID>(&dest);
+            if (!keyID) {
+                throw std::runtime_error(strprintf("%s does not refer to a key", ks));
+            }
+            CPubKey vchPubKey;
+            if (!pwalletMain->GetPubKey(*keyID, vchPubKey)) {
+                throw std::runtime_error(strprintf("no full public key for address %s", ks));
+            }
+            if (!vchPubKey.IsFullyValid())
+                throw runtime_error(" Invalid public key: "+ks);
+            pubkeys[i] = vchPubKey;
+        }
+
+        // Case 2: hex public key
+        else
+#endif
+        if (IsHex(ks))
+        {
+            CPubKey vchPubKey(ParseHex(ks));
+            if (!vchPubKey.IsFullyValid())
+                throw runtime_error(" Invalid public key: "+ks);
+            pubkeys[i] = vchPubKey;
+        }
+        else
+        {
+            throw runtime_error(" Invalid public key: "+ks);
+        }
+    }
+    CScript result = GetScriptForMultisig(nRequired, pubkeys);
+
+    if (result.size() > MAX_SCRIPT_ELEMENT_SIZE)
+        throw runtime_error(
+                strprintf("redeemScript exceeds size limit: %d > %d", result.size(), MAX_SCRIPT_ELEMENT_SIZE));
+
+    return result;
+}
+
+UniValue createmultisig(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() < 2 || params.size() > 2)
+    {
+        string msg = "createmultisig nrequired [\"key\",...]\n"
+            "\nCreates a multi-signature address with n signature of m keys required.\n"
+            "It returns a json object with the address and redeemScript.\n"
+
+            "\nArguments:\n"
+            "1. nrequired      (numeric, required) The number of required signatures out of the n keys or addresses.\n"
+            "2. \"keys\"       (string, required) A json array of keys which are Zcash addresses or hex-encoded public keys\n"
+            "     [\n"
+            "       \"key\"    (string) Zcash address or hex-encoded public key\n"
+            "       ,...\n"
+            "     ]\n"
+
+            "\nResult:\n"
+            "{\n"
+            "  \"address\":\"multisigaddress\",  (string) The value of the new multisig address.\n"
+            "  \"redeemScript\":\"script\"       (string) The string value of the hex-encoded redemption script.\n"
+            "}\n"
+
+            "\nExamples:\n"
+            "\nCreate a multisig address from 2 addresses\n"
+            + HelpExampleCli("createmultisig", "2 \"[\\\"t16sSauSf5pF2UkUwvKGq4qjNRzBZYqgEL5\\\",\\\"t171sgjn4YtPu27adkKGrdDwzRTxnRkBfKV\\\"]\"") +
+            "\nAs a json rpc call\n"
+            + HelpExampleRpc("createmultisig", "2, \"[\\\"t16sSauSf5pF2UkUwvKGq4qjNRzBZYqgEL5\\\",\\\"t171sgjn4YtPu27adkKGrdDwzRTxnRkBfKV\\\"]\"")
+        ;
+        throw runtime_error(msg);
+    }
+
+    // Construct using pay-to-script-hash:
+    CScript inner = _createmultisig_redeemScript(params);
+    CScriptID innerID(inner);
+
+    KeyIO keyIO(Params());
+    UniValue result(UniValue::VOBJ);
+    result.pushKV("address", keyIO.EncodeDestination(innerID));
+    result.pushKV("redeemScript", HexStr(inner.begin(), inner.end()));
+
+    return result;
+}
+
+UniValue verifymessage(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 3)
+        throw runtime_error(
+            "verifymessage \"zcashaddress\" \"signature\" \"message\"\n"
+            "\nVerify a signed message\n"
+            "\nArguments:\n"
+            "1. \"zcashaddress\"    (string, required) The Zcash address to use for the signature.\n"
+            "2. \"signature\"       (string, required) The signature provided by the signer in base 64 encoding (see signmessage).\n"
+            "3. \"message\"         (string, required) The message that was signed.\n"
+            "\nResult:\n"
+            "true|false   (boolean) If the signature is verified or not.\n"
+            "\nExamples:\n"
+            "\nUnlock the wallet for 30 seconds\n"
+            + HelpExampleCli("walletpassphrase", "\"mypassphrase\" 30") +
+            "\nCreate the signature\n"
+            + HelpExampleCli("signmessage", "\"t14oHp2v54vfmdgQ3v3SNuQga8JKHTNi2a1\" \"my message\"") +
+            "\nVerify the signature\n"
+            + HelpExampleCli("verifymessage", "\"t14oHp2v54vfmdgQ3v3SNuQga8JKHTNi2a1\" \"signature\" \"my message\"") +
+            "\nAs json rpc\n"
+            + HelpExampleRpc("verifymessage", "\"t14oHp2v54vfmdgQ3v3SNuQga8JKHTNi2a1\", \"signature\", \"my message\"")
+        );
+
+    LOCK(cs_main);
+
+    string strAddress  = params[0].get_str();
+    string strSign     = params[1].get_str();
+    string strMessage  = params[2].get_str();
+
+    KeyIO keyIO(Params());
+    CTxDestination destination = keyIO.DecodeDestination(strAddress);
+    if (!IsValidDestination(destination)) {
+        throw JSONRPCError(RPC_TYPE_ERROR, "Invalid address");
+    }
+
+    const CKeyID *keyID = std::get_if<CKeyID>(&destination);
+    if (!keyID) {
+        throw JSONRPCError(RPC_TYPE_ERROR, "Address does not refer to key");
+    }
+
+    bool fInvalid = false;
+    vector<unsigned char> vchSig = DecodeBase64(strSign.c_str(), &fInvalid);
+
+    if (fInvalid)
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Malformed base64 encoding");
+
+    CHashWriter ss(SER_GETHASH, 0);
+    ss << strMessageMagic;
+    ss << strMessage;
+
+    CPubKey pubkey;
+    if (!pubkey.RecoverCompact(ss.GetHash(), vchSig))
+        return false;
+
+    return (pubkey.GetID() == *keyID);
+}
+
+UniValue setmocktime(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "setmocktime timestamp\n"
+            "\nSet the local time to given timestamp (-regtest only)\n"
+            "\nArguments:\n"
+            "1. timestamp  (integer, required) Unix seconds-since-epoch timestamp\n"
+            "   Pass 0 to go back to using the system time."
+        );
+
+    if (!Params().MineBlocksOnDemand())
+        throw runtime_error("setmocktime for regression testing (-regtest mode) only");
+
+    // cs_vNodes is locked and node send/receive times are updated
+    // atomically with the time change to prevent peers from being
+    // disconnected because we think we haven't communicated with them
+    // in a long time.
+    LOCK2(cs_main, cs_vNodes);
+
+    RPCTypeCheck(params, boost::assign::list_of(UniValue::VNUM));
+    SetMockTime(params[0].get_int64());
+
+    uint64_t t = GetTime();
+    for (CNode* pnode : vNodes) {
+        pnode->nLastSend = pnode->nLastRecv = t;
+    }
+
+    return NullUniValue;
+}
+
+UniValue getexperimentalfeatures(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 0)
+        throw runtime_error(
+            "getexperimentalfeatures\n"
+            "\nReturns enabled experimental features.\n"
+            "\nResult:\n"
+            "  [\n"
+            "     \"experimentalfeature\"     (string) The enabled experimental feature\n"
+            "     ,...\n"
+            "  ],\n"            "\nExamples:\n"
+            + HelpExampleCli("getexperimentalfeatures", "")
+            + HelpExampleRpc("getexperimentalfeatures", "")
+        );
+
+    LOCK(cs_main);
+    UniValue experimentalfeatures(UniValue::VARR);
+    for (auto& enabledfeature : GetExperimentalFeatures()) {
+        experimentalfeatures.push_back(enabledfeature);
+    }
+    return experimentalfeatures;
+}
+
+// insightexplorer
+static bool getAddressFromIndex(
+    int type, const uint160 &hash, std::string &address)
+{
+    KeyIO keyIO(Params());
+    if (type == CScript::P2SH) {
+        address = keyIO.EncodeDestination(CScriptID(hash));
+    } else if (type == CScript::P2PKH) {
+        address = keyIO.EncodeDestination(CKeyID(hash));
+    } else {
+        return false;
+    }
+    return true;
+}
+
+// This function accepts an address and returns in the output parameters
+// the version and raw bytes for the RIPEMD-160 hash.
+static bool getIndexKey(
+    const CTxDestination& dest, uint160& hashBytes, int& type)
+{
+    if (!IsValidDestination(dest)) {
+        return false;
+    }
+    if (IsKeyDestination(dest)) {
+        auto x = std::get_if<CKeyID>(&dest);
+        memcpy(&hashBytes, x->begin(), 20);
+        type = CScript::P2PKH;
+        return true;
+    }
+    if (IsScriptDestination(dest)) {
+        auto x = std::get_if<CScriptID>(&dest);
+        memcpy(&hashBytes, x->begin(), 20);
+        type = CScript::P2SH;
+        return true;
+    }
+    return false;
+}
+
+// insightexplorer
+static bool getAddressesFromParams(
+    const UniValue& params,
+    std::vector<std::pair<uint160, int>> &addresses)
+{
+    std::vector<std::string> param_addresses;
+    if (params[0].isStr()) {
+        param_addresses.push_back(params[0].get_str());
+    } else if (params[0].isObject()) {
+        UniValue addressValues = find_value(params[0].get_obj(), "addresses");
+        if (!addressValues.isArray()) {
+            throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY,
+                "Addresses is expected to be an array");
+        }
+        for (const auto& it : addressValues.getValues()) {
+            param_addresses.push_back(it.get_str());
+        }
+
+    } else {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid address");
+    }
+
+    KeyIO keyIO(Params());
+    for (const auto& it : param_addresses) {
+        CTxDestination address = keyIO.DecodeDestination(it);
+        uint160 hashBytes;
+        int type = 0;
+        if (!getIndexKey(address, hashBytes, type)) {
+            throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid address");
+        }
+        addresses.push_back(std::make_pair(hashBytes, type));
+    }
+    return true;
+}
+
+// insightexplorer
+UniValue getaddressmempool(const UniValue& params, bool fHelp)
+{
+    std::string disabledMsg = "";
+    if (!(fExperimentalInsightExplorer || fExperimentalLightWalletd)) {
+        disabledMsg = experimentalDisabledHelpMsg("getaddressmempool", {"insightexplorer", "lightwalletd"});
+    }
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "getaddressmempool {\"addresses\": [\"taddr\", ...]}\n"
+            "\nReturns all mempool deltas for an address.\n"
+            + disabledMsg +
+            "\nArguments:\n"
+            "{\n"
+            "  \"addresses\":\n"
+            "    [\n"
+            "      \"address\"  (string) The base58check encoded address\n"
+            "      ,...\n"
+            "    ]\n"
+            "}\n"
+            "(or)\n"
+            "\"address\"  (string) The base58check encoded address\n"
+            "\nResult:\n"
+            "[\n"
+            "  {\n"
+            "    \"address\"  (string) The base58check encoded address\n"
+            "    \"txid\"  (string) The related txid\n"
+            "    \"index\"  (number) The related input or output index\n"
+            "    \"satoshis\"  (number) The difference of zatoshis\n"
+            "    \"timestamp\"  (number) The time the transaction entered the mempool (seconds)\n"
+            "    \"prevtxid\"  (string) The previous txid (if spending)\n"
+            "    \"prevout\"  (string) The previous transaction output index (if spending)\n"
+            "  }\n"
+            "]\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getaddressmempool", "'{\"addresses\": [\"tmYXBYJj1K7vhejSec5osXK2QsGa5MTisUQ\"]}'")
+            + HelpExampleRpc("getaddressmempool", "{\"addresses\": [\"tmYXBYJj1K7vhejSec5osXK2QsGa5MTisUQ\"]}")
+        );
+
+    if (!(fExperimentalInsightExplorer || fExperimentalLightWalletd)) {
+        throw JSONRPCError(RPC_MISC_ERROR, "Error: getaddressmempool is disabled. "
+            "Run './zcash-cli help getaddressmempool' for instructions on how to enable this feature.");
+    }
+
+    std::vector<std::pair<uint160, int>> addresses;
+
+    if (!getAddressesFromParams(params, addresses)) {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid address");
+    }
+    std::vector<std::pair<CMempoolAddressDeltaKey, CMempoolAddressDelta>> indexes;
+    mempool.getAddressIndex(addresses, indexes);
+    std::sort(indexes.begin(), indexes.end(),
+        [](const std::pair<CMempoolAddressDeltaKey, CMempoolAddressDelta>& a,
+           const std::pair<CMempoolAddressDeltaKey, CMempoolAddressDelta>& b) -> bool {
+               return a.second.time < b.second.time;
+           });
+
+    UniValue result(UniValue::VARR);
+
+    for (const auto& it : indexes) {
+        std::string address;
+        if (!getAddressFromIndex(it.first.type, it.first.addressBytes, address)) {
+            throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Unknown address type");
+        }
+        UniValue delta(UniValue::VOBJ);
+        delta.pushKV("address", address);
+        delta.pushKV("txid", it.first.txhash.GetHex());
+        delta.pushKV("index", (int)it.first.index);
+        delta.pushKV("satoshis", it.second.amount);
+        delta.pushKV("timestamp", it.second.time);
+        if (it.second.amount < 0) {
+            delta.pushKV("prevtxid", it.second.prevhash.GetHex());
+            delta.pushKV("prevout", (int)it.second.prevout);
+        }
+        result.push_back(delta);
+    }
+    return result;
+}
+
+// insightexplorer
+UniValue getaddressutxos(const UniValue& params, bool fHelp)
+{
+    std::string disabledMsg = "";
+    if (!(fExperimentalInsightExplorer || fExperimentalLightWalletd)) {
+        disabledMsg = experimentalDisabledHelpMsg("getaddressutxos", {"insightexplorer", "lightwalletd"});
+    }
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "getaddressutxos {\"addresses\": [\"taddr\", ...], (\"chainInfo\": true|false)}\n"
+            "\nReturns all unspent outputs for an address.\n"
+            + disabledMsg +
+            "\nArguments:\n"
+            "{\n"
+            "  \"addresses\":\n"
+            "    [\n"
+            "      \"address\"  (string) The base58check encoded address\n"
+            "      ,...\n"
+            "    ],\n"
+            "  \"chainInfo\"  (boolean, optional, default=false) Include chain info with results\n"
+            "}\n"
+            "(or)\n"
+            "\"address\"  (string) The base58check encoded address\n"
+            "\nResult\n"
+            "[\n"
+            "  {\n"
+            "    \"address\"  (string) The address base58check encoded\n"
+            "    \"txid\"  (string) The output txid\n"
+            "    \"height\"  (number) The block height\n"
+            "    \"outputIndex\"  (number) The output index\n"
+            "    \"script\"  (string) The script hex encoded\n"
+            "    \"satoshis\"  (number) The number of zatoshis of the output\n"
+            "  }, ...\n"
+            "]\n\n"
+            "(or, if chainInfo is true):\n\n"
+            "{\n"
+            "  \"utxos\":\n"
+            "    [\n"
+            "      {\n"
+            "        \"address\"     (string)  The address base58check encoded\n"
+            "        \"txid\"        (string)  The output txid\n"
+            "        \"height\"      (number)  The block height\n"
+            "        \"outputIndex\" (number)  The output index\n"
+            "        \"script\"      (string)  The script hex encoded\n"
+            "        \"satoshis\"    (number)  The number of zatoshis of the output\n"
+            "      }, ...\n"
+            "    ],\n"
+            "  \"hash\"              (string)  The block hash\n"
+            "  \"height\"            (numeric) The block height\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getaddressutxos", "'{\"addresses\": [\"tmYXBYJj1K7vhejSec5osXK2QsGa5MTisUQ\"], \"chainInfo\": true}'")
+            + HelpExampleRpc("getaddressutxos", "{\"addresses\": [\"tmYXBYJj1K7vhejSec5osXK2QsGa5MTisUQ\"], \"chainInfo\": true}")
+            );
+
+    if (!(fExperimentalInsightExplorer || fExperimentalLightWalletd)) {
+        throw JSONRPCError(RPC_MISC_ERROR, "Error: getaddressutxos is disabled. "
+            "Run './zcash-cli help getaddressutxos' for instructions on how to enable this feature.");
+    }
+
+    bool includeChainInfo = false;
+    if (params[0].isObject()) {
+        UniValue chainInfo = find_value(params[0].get_obj(), "chainInfo");
+        if (!chainInfo.isNull()) {
+            includeChainInfo = chainInfo.get_bool();
+        }
+    }
+    std::vector<std::pair<uint160, int>> addresses;
+    if (!getAddressesFromParams(params, addresses)) {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid address");
+    }
+    std::vector<CAddressUnspentDbEntry> unspentOutputs;
+    for (const auto& it : addresses) {
+        if (!GetAddressUnspent(it.first, it.second, unspentOutputs)) {
+            throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "No information available for address");
+        }
+    }
+    std::sort(unspentOutputs.begin(), unspentOutputs.end(),
+        [](const CAddressUnspentDbEntry& a, const CAddressUnspentDbEntry& b) -> bool {
+            return a.second.blockHeight < b.second.blockHeight;
+        });
+
+    UniValue utxos(UniValue::VARR);
+    for (const auto& it : unspentOutputs) {
+        UniValue output(UniValue::VOBJ);
+        std::string address;
+        if (!getAddressFromIndex(it.first.type, it.first.hashBytes, address)) {
+            throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Unknown address type");
+        }
+
+        output.pushKV("address", address);
+        output.pushKV("txid", it.first.txhash.GetHex());
+        output.pushKV("outputIndex", (int)it.first.index);
+        output.pushKV("script", HexStr(it.second.script.begin(), it.second.script.end()));
+        output.pushKV("satoshis", it.second.satoshis);
+        output.pushKV("height", it.second.blockHeight);
+        utxos.push_back(output);
+    }
+
+    if (!includeChainInfo)
+        return utxos;
+
+    UniValue result(UniValue::VOBJ);
+    result.pushKV("utxos", utxos);
+
+    LOCK(cs_main);  // for chainActive
+    result.pushKV("hash", chainActive.Tip()->GetBlockHash().GetHex());
+    result.pushKV("height", (int)chainActive.Height());
+    return result;
+}
+
+static void getHeightRange(const UniValue& params, int& start, int& end)
+{
+    start = 0;
+    end = 0;
+    if (params[0].isObject()) {
+        UniValue startValue = find_value(params[0].get_obj(), "start");
+        UniValue endValue = find_value(params[0].get_obj(), "end");
+        // If either is not specified, the other is ignored.
+        if (!startValue.isNull() && !endValue.isNull()) {
+            start = startValue.get_int();
+            end = endValue.get_int();
+            if (start <= 0 || end <= 0) {
+                throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY,
+                    "Start and end are expected to be greater than zero");
+            }
+            if (end < start) {
+                throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY,
+                    "End value is expected to be greater than or equal to start");
+            }
+        }
+    }
+
+    LOCK(cs_main);  // for chainActive
+    if (start > chainActive.Height() || end > chainActive.Height()) {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Start or end is outside chain range");
+    }
+}
+
+// Parse an address list then fetch the corresponding addressindex information.
+static void getAddressesInHeightRange(
+    const UniValue& params,
+    int start, int end,
+    std::vector<std::pair<uint160, int>>& addresses,
+    std::vector<std::pair<CAddressIndexKey, CAmount>> &addressIndex)
+{
+    if (!getAddressesFromParams(params, addresses)) {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid address");
+    }
+    for (const auto& it : addresses) {
+        if (!GetAddressIndex(it.first, it.second, addressIndex, start, end)) {
+            throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY,
+                "No information available for address");
+        }
+    }
+}
+
+// insightexplorer
+UniValue getaddressdeltas(const UniValue& params, bool fHelp)
+{
+    std::string disabledMsg = "";
+    if (!(fExperimentalInsightExplorer || fExperimentalLightWalletd)) {
+        disabledMsg = experimentalDisabledHelpMsg("getaddressdeltas", {"insightexplorer", "lightwalletd"});
+    }
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "getaddressdeltas {\"addresses\": [\"taddr\", ...], (\"start\": n), (\"end\": n), (\"chainInfo\": true|false)}\n"
+            "\nReturns all changes for an address.\n"
+            "\nReturns information about all changes to the given transparent addresses within the given (inclusive)\n"
+            "\nblock height range, default is the full blockchain.\n"
+            + disabledMsg +
+            "\nArguments:\n"
+            "{\n"
+            "  \"addresses\":\n"
+            "    [\n"
+            "      \"address\" (string) The base58check encoded address\n"
+            "      ,...\n"
+            "    ]\n"
+            "  \"start\"       (number, optional) The start block height\n"
+            "  \"end\"         (number, optional) The end block height\n"
+            "  \"chainInfo\"   (boolean, optional, default=false) Include chain info in results, only applies if start and end specified\n"
+            "}\n"
+            "(or)\n"
+            "\"address\"       (string) The base58check encoded address\n"
+            "\nResult:\n"
+            "[\n"
+            "  {\n"
+            "    \"satoshis\"  (number) The difference of zatoshis\n"
+            "    \"txid\"      (string) The related txid\n"
+            "    \"index\"     (number) The related input or output index\n"
+            "    \"height\"    (number) The block height\n"
+            "    \"address\"   (string) The base58check encoded address\n"
+            "  }, ...\n"
+            "]\n\n"
+            "(or, if chainInfo is true):\n\n"
+            "{\n"
+            "  \"deltas\":\n"
+            "    [\n"
+            "      {\n"
+            "        \"satoshis\"    (number) The difference of zatoshis\n"
+            "        \"txid\"        (string) The related txid\n"
+            "        \"index\"       (number) The related input or output index\n"
+            "        \"height\"      (number) The block height\n"
+            "        \"address\"     (string)  The address base58check encoded\n"
+            "      }, ...\n"
+            "    ],\n"
+            "  \"start\":\n"
+            "    {\n"
+            "      \"hash\"          (string)  The start block hash\n"
+            "      \"height\"        (numeric) The height of the start block\n"
+            "    }\n"
+            "  \"end\":\n"
+            "    {\n"
+            "      \"hash\"          (string)  The end block hash\n"
+            "      \"height\"        (numeric) The height of the end block\n"
+            "    }\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getaddressdeltas", "'{\"addresses\": [\"tmYXBYJj1K7vhejSec5osXK2QsGa5MTisUQ\"], \"start\": 1000, \"end\": 2000, \"chainInfo\": true}'")
+            + HelpExampleRpc("getaddressdeltas", "{\"addresses\": [\"tmYXBYJj1K7vhejSec5osXK2QsGa5MTisUQ\"], \"start\": 1000, \"end\": 2000, \"chainInfo\": true}")
+        );
+
+    if (!(fExperimentalInsightExplorer || fExperimentalLightWalletd)) {
+        throw JSONRPCError(RPC_MISC_ERROR, "Error: getaddressdeltas is disabled. "
+            "Run './zcash-cli help getaddressdeltas' for instructions on how to enable this feature.");
+    }
+
+    int start = 0;
+    int end = 0;
+    getHeightRange(params, start, end);
+
+    std::vector<std::pair<uint160, int>> addresses;
+    std::vector<std::pair<CAddressIndexKey, CAmount>> addressIndex;
+    getAddressesInHeightRange(params, start, end, addresses, addressIndex);
+
+    bool includeChainInfo = false;
+    if (params[0].isObject()) {
+        UniValue chainInfo = find_value(params[0].get_obj(), "chainInfo");
+        if (!chainInfo.isNull()) {
+            includeChainInfo = chainInfo.get_bool();
+        }
+    }
+
+    UniValue deltas(UniValue::VARR);
+    for (const auto& it : addressIndex) {
+        std::string address;
+        if (!getAddressFromIndex(it.first.type, it.first.hashBytes, address)) {
+            throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Unknown address type");
+        }
+
+        UniValue delta(UniValue::VOBJ);
+        delta.pushKV("address", address);
+        delta.pushKV("blockindex", (int)it.first.txindex);
+        delta.pushKV("height", it.first.blockHeight);
+        delta.pushKV("index", (int)it.first.index);
+        delta.pushKV("satoshis", it.second);
+        delta.pushKV("txid", it.first.txhash.GetHex());
+        deltas.push_back(delta);
+    }
+
+    UniValue result(UniValue::VOBJ);
+
+    if (!(includeChainInfo && start > 0 && end > 0)) {
+        return deltas;
+    }
+
+    UniValue startInfo(UniValue::VOBJ);
+    UniValue endInfo(UniValue::VOBJ);
+    {
+        LOCK(cs_main);  // for chainActive
+        if (start > chainActive.Height() || end > chainActive.Height()) {
+            throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Start or end is outside chain range");
+        }
+        startInfo.pushKV("hash", chainActive[start]->GetBlockHash().GetHex());
+        endInfo.pushKV("hash", chainActive[end]->GetBlockHash().GetHex());
+    }
+    startInfo.pushKV("height", start);
+    endInfo.pushKV("height", end);
+
+    result.pushKV("deltas", deltas);
+    result.pushKV("start", startInfo);
+    result.pushKV("end", endInfo);
+
+    return result;
+}
+
+// insightexplorer
+UniValue getaddressbalance(const UniValue& params, bool fHelp)
+{
+    std::string disabledMsg = "";
+    if (!(fExperimentalInsightExplorer || fExperimentalLightWalletd)) {
+        disabledMsg = experimentalDisabledHelpMsg("getaddressbalance", {"insightexplorer", "lightwalletd"});
+    }
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "getaddressbalance {\"addresses\": [\"taddr\", ...]}\n"
+            "\nReturns the balance for addresses.\n"
+            + disabledMsg +
+            "\nArguments:\n"
+            "{\n"
+            "  \"addresses\":\n"
+            "    [\n"
+            "      \"address\"  (string) The base58check encoded address\n"
+            "      ,...\n"
+            "    ]\n"
+            "}\n"
+            "(or)\n"
+            "\"address\"  (string) The base58check encoded address\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"balance\"  (string) The current balance in zatoshis\n"
+            "  \"received\"  (string) The total number of zatoshis received (including change)\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getaddressbalance", "'{\"addresses\": [\"tmYXBYJj1K7vhejSec5osXK2QsGa5MTisUQ\"]}'")
+            + HelpExampleRpc("getaddressbalance", "{\"addresses\": [\"tmYXBYJj1K7vhejSec5osXK2QsGa5MTisUQ\"]}")
+        );
+
+    if (!(fExperimentalInsightExplorer || fExperimentalLightWalletd)) {
+        throw JSONRPCError(RPC_MISC_ERROR, "Error: getaddressbalance is disabled. "
+            "Run './zcash-cli help getaddressbalance' for instructions on how to enable this feature.");
+    }
+
+    std::vector<std::pair<uint160, int>> addresses;
+    std::vector<std::pair<CAddressIndexKey, CAmount>> addressIndex;
+    // this method doesn't take start and end block height params, so set
+    // to zero (full range, entire blockchain)
+    getAddressesInHeightRange(params, 0, 0, addresses, addressIndex);
+
+    CAmount balance = 0;
+    CAmount received = 0;
+    for (const auto& it : addressIndex) {
+        if (it.second > 0) {
+            received += it.second;
+        }
+        balance += it.second;
+    }
+    UniValue result(UniValue::VOBJ);
+    result.pushKV("balance", balance);
+    result.pushKV("received", received);
+    return result;
+}
+
+// insightexplorer
+UniValue getaddresstxids(const UniValue& params, bool fHelp)
+{
+    std::string disabledMsg = "";
+    if (!(fExperimentalInsightExplorer || fExperimentalLightWalletd)) {
+        disabledMsg = experimentalDisabledHelpMsg("getaddresstxids", {"insightexplorer", "lightwalletd"});
+    }
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "getaddresstxids {\"addresses\": [\"taddr\", ...], (\"start\": n), (\"end\": n)}\n"
+            "\nReturns the txids for given transparent addresses within the given (inclusive)\n"
+            "\nblock height range, default is the full blockchain.\n"
+            "\nStarting v4.5.0, returned txids are in the order they appear in blocks, which \n"
+            "\nensures that they are topologically sorted (i.e. parent txids will appear before child txids).\n"
+            + disabledMsg +
+            "\nArguments:\n"
+            "{\n"
+            "  \"addresses\":\n"
+            "    [\n"
+            "      \"taddr\"  (string) The base58check encoded address\n"
+            "      ,...\n"
+            "    ]\n"
+            "  \"start\" (number, optional) The start block height\n"
+            "  \"end\" (number, optional) The end block height\n"
+            "}\n"
+            "(or)\n"
+            "\"address\"  (string) The base58check encoded address\n"
+            "\nResult:\n"
+            "[\n"
+            "  \"transactionid\"  (string) The transaction id\n"
+            "  ,...\n"
+            "]\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getaddresstxids", "'{\"addresses\": [\"tmYXBYJj1K7vhejSec5osXK2QsGa5MTisUQ\"], \"start\": 1000, \"end\": 2000}'")
+            + HelpExampleRpc("getaddresstxids", "{\"addresses\": [\"tmYXBYJj1K7vhejSec5osXK2QsGa5MTisUQ\"], \"start\": 1000, \"end\": 2000}")
+        );
+
+    if (!(fExperimentalInsightExplorer || fExperimentalLightWalletd)) {
+        throw JSONRPCError(RPC_MISC_ERROR, "Error: getaddresstxids is disabled. "
+            "Run './zcash-cli help getaddresstxids' for instructions on how to enable this feature.");
+    }
+
+    int start = 0;
+    int end = 0;
+    getHeightRange(params, start, end);
+
+    std::vector<std::pair<uint160, int>> addresses;
+    std::vector<std::pair<CAddressIndexKey, CAmount>> addressIndex;
+    getAddressesInHeightRange(params, start, end, addresses, addressIndex);
+
+    // This is an ordered set, sorted by (height,txindex) so result also sorted by height.
+    std::set<std::tuple<int, int, std::string>> txids;
+
+    for (const auto& it : addressIndex) {
+        const int height = it.first.blockHeight;
+        const int txindex = it.first.txindex;
+        const std::string txid = it.first.txhash.GetHex();
+        // Duplicate entries (two addresses in same tx) are suppressed
+        txids.insert(std::make_tuple(height, txindex, txid));
+    }
+    UniValue result(UniValue::VARR);
+    for (const auto& it : txids) {
+        // only push the txid, not the height
+        result.push_back(std::get<2>(it));
+    }
+
+    return result;
+}
+
+// insightexplorer
+UniValue getspentinfo(const UniValue& params, bool fHelp)
+{
+    std::string disabledMsg = "";
+    if (!fExperimentalInsightExplorer) {
+        disabledMsg = experimentalDisabledHelpMsg("getspentinfo", {"insightexplorer"});
+    }
+    if (fHelp || params.size() != 1 || !params[0].isObject())
+        throw runtime_error(
+            "getspentinfo {\"txid\": \"txidhex\", \"index\": n}\n"
+            "\nReturns the txid and index where an output is spent.\n"
+            + disabledMsg +
+            "\nArguments:\n"
+            "{\n"
+            "  \"txid\"   (string) The hex string of the txid\n"
+            "  \"index\"  (number) The vout (output) index\n"
+            "}\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"txid\"   (string) The transaction id\n"
+            "  \"index\"  (number) The spending (vin, input) index\n"
+            "  ,...\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getspentinfo", "'{\"txid\": \"33990288fb116981260be1de10b8c764f997674545ab14f9240f00346333b780\", \"index\": 4}'")
+            + HelpExampleRpc("getspentinfo", "{\"txid\": \"33990288fb116981260be1de10b8c764f997674545ab14f9240f00346333b780\", \"index\": 4}")
+        );
+
+    if (!fExperimentalInsightExplorer) {
+        throw JSONRPCError(RPC_MISC_ERROR, "Error: getspentinfo is disabled. "
+            "Run './zcash-cli help getspentinfo' for instructions on how to enable this feature.");
+    }
+
+    UniValue txidValue = find_value(params[0].get_obj(), "txid");
+    UniValue indexValue = find_value(params[0].get_obj(), "index");
+
+    if (!txidValue.isStr())
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid txid, must be a string");
+    if (!indexValue.isNum())
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid index, must be an integer");
+    uint256 txid = ParseHashV(txidValue, "txid");
+    int outputIndex = indexValue.get_int();
+
+    CSpentIndexKey key(txid, outputIndex);
+    CSpentIndexValue value;
+
+    {
+        LOCK(cs_main);
+        if (!GetSpentIndex(key, value)) {
+            throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Unable to get spent info");
+        }
+    }
+    UniValue obj(UniValue::VOBJ);
+    obj.pushKV("txid", value.txid.GetHex());
+    obj.pushKV("index", (int)value.inputIndex);
+    obj.pushKV("height", value.blockHeight);
+
+    return obj;
+}
+
+static UniValue RPCLockedMemoryInfo()
+{
+    LockedPool::Stats stats = LockedPoolManager::Instance().stats();
+    UniValue obj(UniValue::VOBJ);
+    obj.pushKV("used", uint64_t(stats.used));
+    obj.pushKV("free", uint64_t(stats.free));
+    obj.pushKV("total", uint64_t(stats.total));
+    obj.pushKV("locked", uint64_t(stats.locked));
+    obj.pushKV("chunks_used", uint64_t(stats.chunks_used));
+    obj.pushKV("chunks_free", uint64_t(stats.chunks_free));
+    return obj;
+}
+
+UniValue getmemoryinfo(const UniValue& params, bool fHelp)
+{
+    /* Please, avoid using the word "pool" here in the RPC interface or help,
+     * as users will undoubtedly confuse it with the other "memory pool"
+     */
+    if (fHelp || params.size() != 0)
+        throw runtime_error(
+            "getmemoryinfo\n"
+            "Returns an object containing information about memory usage.\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"locked\": {               (json object) Information about locked memory manager\n"
+            "    \"used\": xxxxx,          (numeric) Number of bytes used\n"
+            "    \"free\": xxxxx,          (numeric) Number of bytes available in current arenas\n"
+            "    \"total\": xxxxxxx,       (numeric) Total number of bytes managed\n"
+            "    \"locked\": xxxxxx,       (numeric) Amount of bytes that succeeded locking. If this number is smaller than total, locking pages failed at some point and key data could be swapped to disk.\n"
+            "    \"chunks_used\": xxxxx,   (numeric) Number allocated chunks\n"
+            "    \"chunks_free\": xxxxx,   (numeric) Number unused chunks\n"
+            "  }\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getmemoryinfo", "")
+            + HelpExampleRpc("getmemoryinfo", "")
+        );
+    UniValue obj(UniValue::VOBJ);
+    obj.pushKV("locked", RPCLockedMemoryInfo());
+    return obj;
+}
+
+static const CRPCCommand commands[] =
+{ //  category              name                      actor (function)         okSafeMode
+  //  --------------------- ------------------------  -----------------------  ----------
+    { "control",            "getinfo",                &getinfo,                true  }, /* uses wallet if enabled */
+    { "control",            "getmemoryinfo",          &getmemoryinfo,          true  },
+    { "util",               "validateaddress",        &validateaddress,        true  }, /* uses wallet if enabled */
+    { "util",               "z_validateaddress",      &z_validateaddress,      true  }, /* uses wallet if enabled */
+    { "util",               "createmultisig",         &createmultisig,         true  },
+    { "util",               "verifymessage",          &verifymessage,          true  },
+    { "control",            "getexperimentalfeatures",&getexperimentalfeatures,true  },
+
+    // START insightexplorer
+    /* Address index */
+    { "addressindex",       "getaddresstxids",        &getaddresstxids,        false }, /* insight explorer */
+    { "addressindex",       "getaddressbalance",      &getaddressbalance,      false }, /* insight explorer */
+    { "addressindex",       "getaddressdeltas",       &getaddressdeltas,       false }, /* insight explorer */
+    { "addressindex",       "getaddressutxos",        &getaddressutxos,        false }, /* insight explorer */
+    { "addressindex",       "getaddressmempool",      &getaddressmempool,      true  }, /* insight explorer */
+    { "blockchain",         "getspentinfo",           &getspentinfo,           false }, /* insight explorer */
+    // END insightexplorer
+
+    /* Not shown in help */
+    { "hidden",             "setmocktime",            &setmocktime,            true  },
+};
+
+void RegisterMiscRPCCommands(CRPCTable &tableRPC)
+{
+    for (unsigned int vcidx = 0; vcidx < ARRAYLEN(commands); vcidx++)
+        tableRPC.appendCommand(commands[vcidx].name, &commands[vcidx]);
+}
diff --git a/depend/zcash/src/rpc/net.cpp b/depend/zcash/src/rpc/net.cpp
new file mode 100644
index 000000000..00832acfa
--- /dev/null
+++ b/depend/zcash/src/rpc/net.cpp
@@ -0,0 +1,648 @@
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "rpc/server.h"
+
+#include "clientversion.h"
+#include "main.h"
+#include "net.h"
+#include "netbase.h"
+#include "protocol.h"
+#include "sync.h"
+#include "ui_interface.h"
+#include "util.h"
+#include "version.h"
+#include "deprecation.h"
+
+
+#include <univalue.h>
+
+using namespace std;
+
+UniValue getconnectioncount(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 0)
+        throw runtime_error(
+            "getconnectioncount\n"
+            "\nReturns the number of connections to other nodes.\n"
+            "\nbResult:\n"
+            "n          (numeric) The connection count\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getconnectioncount", "")
+            + HelpExampleRpc("getconnectioncount", "")
+        );
+
+    LOCK2(cs_main, cs_vNodes);
+
+    return (int)vNodes.size();
+}
+
+UniValue ping(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 0)
+        throw runtime_error(
+            "ping\n"
+            "\nRequests that a ping be sent to all other nodes, to measure ping time.\n"
+            "Results provided in getpeerinfo, pingtime and pingwait fields are decimal seconds.\n"
+            "Ping command is handled in queue with all other commands, so it measures processing backlog, not just network ping.\n"
+            "\nExamples:\n"
+            + HelpExampleCli("ping", "")
+            + HelpExampleRpc("ping", "")
+        );
+
+    // Request that each node send a ping during next message processing pass
+    LOCK2(cs_main, cs_vNodes);
+
+    for (CNode* pNode : vNodes) {
+        pNode->fPingQueued = true;
+    }
+
+    return NullUniValue;
+}
+
+static void CopyNodeStats(std::vector<CNodeStats>& vstats)
+{
+    vstats.clear();
+
+    LOCK(cs_vNodes);
+    vstats.reserve(vNodes.size());
+    for (CNode* pnode : vNodes) {
+        vstats.emplace_back();
+        pnode->copyStats(vstats.back());
+    }
+}
+
+UniValue getpeerinfo(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 0)
+        throw runtime_error(
+            "getpeerinfo\n"
+            "\nReturns data about each connected network node as a json array of objects.\n"
+            "\nbResult:\n"
+            "[\n"
+            "  {\n"
+            "    \"id\": n,                   (numeric) Peer index\n"
+            "    \"addr\":\"host:port\",      (string) The IP address and port of the peer\n"
+            "    \"addrlocal\":\"ip:port\",   (string) local address\n"
+            "    \"services\":\"xxxxxxxxxxxxxxxx\",   (string) The services offered\n"
+            "    \"relaytxes\":true|false,    (boolean) Whether peer has asked us to relay transactions to it\n"
+            "    \"lastsend\": ttt,           (numeric) The time in seconds since epoch (Jan 1 1970 GMT) of the last send\n"
+            "    \"lastrecv\": ttt,           (numeric) The time in seconds since epoch (Jan 1 1970 GMT) of the last receive\n"
+            "    \"bytessent\": n,            (numeric) The total bytes sent\n"
+            "    \"bytesrecv\": n,            (numeric) The total bytes received\n"
+            "    \"conntime\": ttt,           (numeric) The connection time in seconds since epoch (Jan 1 1970 GMT)\n"
+            "    \"timeoffset\": ttt,         (numeric) The time offset in seconds\n"
+            "    \"pingtime\": n,             (numeric) ping time\n"
+            "    \"pingwait\": n,             (numeric) ping wait\n"
+            "    \"version\": v,              (numeric) The peer version, such as 170002\n"
+            "    \"subver\": \"/MagicBean:x.y.z[-v]/\",  (string) The string version\n"
+            "    \"inbound\": true|false,     (boolean) Inbound (true) or Outbound (false)\n"
+            "    \"startingheight\": n,       (numeric) The starting height (block) of the peer\n"
+            "    \"banscore\": n,             (numeric) The ban score\n"
+            "    \"synced_headers\": n,       (numeric) The last header we have in common with this peer\n"
+            "    \"synced_blocks\": n,        (numeric) The last block we have in common with this peer\n"
+            "    \"inflight\": [\n"
+            "       n,                        (numeric) The heights of blocks we're currently asking from this peer\n"
+            "       ...\n"
+            "    ]\n"
+            "  }\n"
+            "  ,...\n"
+            "]\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getpeerinfo", "")
+            + HelpExampleRpc("getpeerinfo", "")
+        );
+
+    LOCK(cs_main);
+
+    vector<CNodeStats> vstats;
+    CopyNodeStats(vstats);
+
+    UniValue ret(UniValue::VARR);
+
+    for (const CNodeStats& stats : vstats) {
+        UniValue obj(UniValue::VOBJ);
+        CNodeStateStats statestats;
+        bool fStateStats = GetNodeStateStats(stats.nodeid, statestats);
+        obj.pushKV("id", stats.nodeid);
+        obj.pushKV("addr", stats.addrName);
+        if (!(stats.addrLocal.empty()))
+            obj.pushKV("addrlocal", stats.addrLocal);
+        obj.pushKV("services", strprintf("%016x", stats.nServices));
+        obj.pushKV("relaytxes", stats.fRelayTxes);
+        obj.pushKV("lastsend", stats.nLastSend);
+        obj.pushKV("lastrecv", stats.nLastRecv);
+        obj.pushKV("bytessent", stats.nSendBytes);
+        obj.pushKV("bytesrecv", stats.nRecvBytes);
+        obj.pushKV("conntime", stats.nTimeConnected);
+        obj.pushKV("timeoffset", stats.nTimeOffset);
+        obj.pushKV("pingtime", stats.dPingTime);
+        if (stats.dPingWait > 0.0)
+            obj.pushKV("pingwait", stats.dPingWait);
+        obj.pushKV("version", stats.nVersion);
+        // Use the sanitized form of subver here, to avoid tricksy remote peers from
+        // corrupting or modifying the JSON output by putting special characters in
+        // their ver message.
+        obj.pushKV("subver", stats.cleanSubVer);
+        obj.pushKV("inbound", stats.fInbound);
+        obj.pushKV("startingheight", stats.nStartingHeight);
+        if (fStateStats) {
+            obj.pushKV("banscore", statestats.nMisbehavior);
+            obj.pushKV("synced_headers", statestats.nSyncHeight);
+            obj.pushKV("synced_blocks", statestats.nCommonHeight);
+            UniValue heights(UniValue::VARR);
+            for (int height : statestats.vHeightInFlight) {
+                heights.push_back(height);
+            }
+            obj.pushKV("inflight", heights);
+        }
+        obj.pushKV("whitelisted", stats.fWhitelisted);
+
+        ret.push_back(obj);
+    }
+
+    return ret;
+}
+
+UniValue addnode(const UniValue& params, bool fHelp)
+{
+    string strCommand;
+    if (params.size() == 2)
+        strCommand = params[1].get_str();
+    if (fHelp || params.size() != 2 ||
+        (strCommand != "onetry" && strCommand != "add" && strCommand != "remove"))
+        throw runtime_error(
+            "addnode \"node\" \"add|remove|onetry\"\n"
+            "\nAttempts to add or remove a node from the addnode list.\n"
+            "Or try a connection to a node once.\n"
+            "\nArguments:\n"
+            "1. \"node\"     (string, required) The node (see getpeerinfo for nodes)\n"
+            "2. \"command\"  (string, required) 'add' to add a node to the list, 'remove' to remove a node from the list, 'onetry' to try a connection to the node once\n"
+            "\nExamples:\n"
+            + HelpExampleCli("addnode", "\"192.168.0.6:8233\" \"onetry\"")
+            + HelpExampleRpc("addnode", "\"192.168.0.6:8233\", \"onetry\"")
+        );
+
+    string strNode = params[0].get_str();
+
+    if (strCommand == "onetry")
+    {
+        CAddress addr;
+        OpenNetworkConnection(addr, NULL, strNode.c_str());
+        return NullUniValue;
+    }
+
+    LOCK(cs_vAddedNodes);
+    vector<string>::iterator it = vAddedNodes.begin();
+    for(; it != vAddedNodes.end(); it++)
+        if (strNode == *it)
+            break;
+
+    if (strCommand == "add")
+    {
+        if (it != vAddedNodes.end())
+            throw JSONRPCError(RPC_CLIENT_NODE_ALREADY_ADDED, "Error: Node already added");
+        vAddedNodes.push_back(strNode);
+    }
+    else if(strCommand == "remove")
+    {
+        if (it == vAddedNodes.end())
+            throw JSONRPCError(RPC_CLIENT_NODE_NOT_ADDED, "Error: Node has not been added.");
+        vAddedNodes.erase(it);
+    }
+
+    return NullUniValue;
+}
+
+UniValue disconnectnode(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "disconnectnode \"node\" \n"
+            "\nImmediately disconnects from the specified node.\n"
+            "\nArguments:\n"
+            "1. \"node\"     (string, required) The node (see getpeerinfo for nodes)\n"
+            "\nExamples:\n"
+            + HelpExampleCli("disconnectnode", "\"192.168.0.6:8233\"")
+            + HelpExampleRpc("disconnectnode", "\"192.168.0.6:8233\"")
+        );
+
+    CNode* pNode = FindNode(params[0].get_str());
+    if (pNode == NULL)
+        throw JSONRPCError(RPC_CLIENT_NODE_NOT_CONNECTED, "Node not found in connected nodes");
+
+    pNode->fDisconnect = true;
+
+    return NullUniValue;
+}
+
+UniValue getaddednodeinfo(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() < 1 || params.size() > 2)
+        throw runtime_error(
+            "getaddednodeinfo dns ( \"node\" )\n"
+            "\nReturns information about the given added node, or all added nodes\n"
+            "(note that onetry addnodes are not listed here)\n"
+            "If dns is false, only a list of added nodes will be provided,\n"
+            "otherwise connected information will also be available.\n"
+            "\nArguments:\n"
+            "1. dns        (boolean, required) If false, only a list of added nodes will be provided, otherwise connected information will also be available.\n"
+            "2. \"node\"   (string, optional) If provided, return information about this specific node, otherwise all nodes are returned.\n"
+            "\nResult:\n"
+            "[\n"
+            "  {\n"
+            "    \"addednode\" : \"192.168.0.201\",   (string) The node IP address\n"
+            "    \"connected\" : true|false,          (boolean) If connected\n"
+            "    \"addresses\" : [\n"
+            "       {\n"
+            "         \"address\" : \"192.168.0.201:8233\",  (string) The Zcash server host and port\n"
+            "         \"connected\" : \"outbound\"           (string) connection, inbound or outbound\n"
+            "       }\n"
+            "       ,...\n"
+            "     ]\n"
+            "  }\n"
+            "  ,...\n"
+            "]\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getaddednodeinfo", "true")
+            + HelpExampleCli("getaddednodeinfo", "true \"192.168.0.201\"")
+            + HelpExampleRpc("getaddednodeinfo", "true, \"192.168.0.201\"")
+        );
+
+    bool fDns = params[0].get_bool();
+
+    list<string> laddedNodes(0);
+    if (params.size() == 1)
+    {
+        LOCK(cs_vAddedNodes);
+        for (const std::string& strAddNode : vAddedNodes)
+            laddedNodes.push_back(strAddNode);
+    }
+    else
+    {
+        string strNode = params[1].get_str();
+        LOCK(cs_vAddedNodes);
+        for (const std::string& strAddNode : vAddedNodes) {
+            if (strAddNode == strNode)
+            {
+                laddedNodes.push_back(strAddNode);
+                break;
+            }
+        }
+        if (laddedNodes.size() == 0)
+            throw JSONRPCError(RPC_CLIENT_NODE_NOT_ADDED, "Error: Node has not been added.");
+    }
+
+    UniValue ret(UniValue::VARR);
+    if (!fDns)
+    {
+        for (const std::string& strAddNode : laddedNodes) {
+            UniValue obj(UniValue::VOBJ);
+            obj.pushKV("addednode", strAddNode);
+            ret.push_back(obj);
+        }
+        return ret;
+    }
+
+    list<pair<string, vector<CService> > > laddedAddreses(0);
+    for (const std::string& strAddNode : laddedNodes) {
+        vector<CService> vservNode(0);
+        if(Lookup(strAddNode.c_str(), vservNode, Params().GetDefaultPort(), fNameLookup, 0))
+            laddedAddreses.push_back(make_pair(strAddNode, vservNode));
+        else
+        {
+            UniValue obj(UniValue::VOBJ);
+            obj.pushKV("addednode", strAddNode);
+            obj.pushKV("connected", false);
+            UniValue addresses(UniValue::VARR);
+            obj.pushKV("addresses", addresses);
+        }
+    }
+
+    LOCK(cs_vNodes);
+    for (list<pair<string, vector<CService> > >::iterator it = laddedAddreses.begin(); it != laddedAddreses.end(); it++)
+    {
+        UniValue obj(UniValue::VOBJ);
+        obj.pushKV("addednode", it->first);
+
+        UniValue addresses(UniValue::VARR);
+        bool fConnected = false;
+        for (const CService& addrNode : it->second) {
+            bool fFound = false;
+            UniValue node(UniValue::VOBJ);
+            node.pushKV("address", addrNode.ToString());
+            for (CNode* pnode : vNodes) {
+                if (pnode->addr == addrNode)
+                {
+                    fFound = true;
+                    fConnected = true;
+                    node.pushKV("connected", pnode->fInbound ? "inbound" : "outbound");
+                    break;
+                }
+            }
+            if (!fFound)
+                node.pushKV("connected", "false");
+            addresses.push_back(node);
+        }
+        obj.pushKV("connected", fConnected);
+        obj.pushKV("addresses", addresses);
+        ret.push_back(obj);
+    }
+
+    return ret;
+}
+
+UniValue getnettotals(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() > 0)
+        throw runtime_error(
+            "getnettotals\n"
+            "\nReturns information about network traffic, including bytes in, bytes out,\n"
+            "and current time.\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"totalbytesrecv\": n,   (numeric) Total bytes received\n"
+            "  \"totalbytessent\": n,   (numeric) Total bytes sent\n"
+            "  \"timemillis\": t,       (numeric) Total cpu time\n"
+            "  \"uploadtarget\":\n"
+            "  {\n"
+            "    \"timeframe\": n,                         (numeric) Length of the measuring timeframe in seconds\n"
+            "    \"target\": n,                            (numeric) Target in bytes\n"
+            "    \"target_reached\": true|false,           (boolean) True if target is reached\n"
+            "    \"serve_historical_blocks\": true|false,  (boolean) True if serving historical blocks\n"
+            "    \"bytes_left_in_cycle\": t,               (numeric) Bytes left in current time cycle\n"
+            "    \"time_left_in_cycle\": t                 (numeric) Seconds left in current time cycle\n"
+            "  }\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getnettotals", "")
+            + HelpExampleRpc("getnettotals", "")
+       );
+
+    uint64_t targetSpacing;
+    {
+        LOCK(cs_main);
+        targetSpacing = Params().GetConsensus().PoWTargetSpacing(chainActive.Height());
+    }
+
+    UniValue obj(UniValue::VOBJ);
+    obj.pushKV("totalbytesrecv", CNode::GetTotalBytesRecv());
+    obj.pushKV("totalbytessent", CNode::GetTotalBytesSent());
+    obj.pushKV("timemillis", GetTimeMillis());
+
+    UniValue outboundLimit(UniValue::VOBJ);
+    outboundLimit.pushKV("timeframe", CNode::GetMaxOutboundTimeframe());
+    outboundLimit.pushKV("target", CNode::GetMaxOutboundTarget());
+    outboundLimit.pushKV("target_reached", CNode::OutboundTargetReached(targetSpacing, false));
+    outboundLimit.pushKV("serve_historical_blocks", !CNode::OutboundTargetReached(targetSpacing, true));
+    outboundLimit.pushKV("bytes_left_in_cycle", CNode::GetOutboundTargetBytesLeft());
+    outboundLimit.pushKV("time_left_in_cycle", CNode::GetMaxOutboundTimeLeftInCycle());
+    obj.pushKV("uploadtarget", outboundLimit);
+    return obj;
+}
+
+static UniValue GetNetworksInfo()
+{
+    UniValue networks(UniValue::VARR);
+    for(int n=0; n<NET_MAX; ++n)
+    {
+        enum Network network = static_cast<enum Network>(n);
+        if(network == NET_UNROUTABLE)
+            continue;
+        proxyType proxy;
+        UniValue obj(UniValue::VOBJ);
+        GetProxy(network, proxy);
+        obj.pushKV("name", GetNetworkName(network));
+        obj.pushKV("limited", IsLimited(network));
+        obj.pushKV("reachable", IsReachable(network));
+        obj.pushKV("proxy", proxy.IsValid() ? proxy.proxy.ToStringIPPort() : string());
+        obj.pushKV("proxy_randomize_credentials", proxy.randomize_credentials);
+        networks.push_back(obj);
+    }
+    return networks;
+}
+
+UniValue getdeprecationinfo(const UniValue& params, bool fHelp)
+{
+    const CChainParams& chainparams = Params();
+    if (fHelp || params.size() != 0 || chainparams.NetworkIDString() != "main")
+        throw runtime_error(
+            "getdeprecationinfo\n"
+            "Returns an object containing current version and deprecation block height. Applicable only on mainnet.\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"version\": xxxxx,                      (numeric) the server version\n"
+            "  \"subversion\": \"/MagicBean:x.y.z[-v]/\",     (string) the server subversion string\n"
+            "  \"deprecationheight\": xxxxx,            (numeric) the block height at which this version will deprecate and shut down\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getdeprecationinfo", "")
+            + HelpExampleRpc("getdeprecationinfo", "")
+        );
+
+    UniValue obj(UniValue::VOBJ);
+    obj.pushKV("version", CLIENT_VERSION);
+    obj.pushKV("subversion",
+        FormatSubVersion(CLIENT_NAME, CLIENT_VERSION, std::vector<string>()));
+    obj.pushKV("deprecationheight", DEPRECATION_HEIGHT);
+
+    return obj;
+}
+
+UniValue getnetworkinfo(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 0)
+        throw runtime_error(
+            "getnetworkinfo\n"
+            "Returns an object containing various state info regarding P2P networking.\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"version\": xxxxx,                      (numeric) the server version\n"
+            "  \"subversion\": \"/MagicBean:x.y.z[-v]/\",     (string) the server subversion string\n"
+            "  \"protocolversion\": xxxxx,              (numeric) the protocol version\n"
+            "  \"localservices\": \"xxxxxxxxxxxxxxxx\", (string) the services we offer to the network\n"
+            "  \"timeoffset\": xxxxx,                   (numeric) the time offset (deprecated; always 0)\n"
+            "  \"connections\": xxxxx,                  (numeric) the number of connections\n"
+            "  \"networks\": [                          (array) information per network\n"
+            "  {\n"
+            "    \"name\": \"xxx\",                     (string) network (ipv4, ipv6 or onion)\n"
+            "    \"limited\": true|false,               (boolean) is the network limited using -onlynet?\n"
+            "    \"reachable\": true|false,             (boolean) is the network reachable?\n"
+            "    \"proxy\": \"host:port\"               (string) the proxy that is used for this network, or empty if none\n"
+            "  }\n"
+            "  ,...\n"
+            "  ],\n"
+            "  \"relayfee\": x.xxxxxxxx,                (numeric) minimum relay fee for non-free transactions in " + CURRENCY_UNIT + "/kB\n"
+            "  \"localaddresses\": [                    (array) list of local addresses\n"
+            "  {\n"
+            "    \"address\": \"xxxx\",                 (string) network address\n"
+            "    \"port\": xxx,                         (numeric) network port\n"
+            "    \"score\": xxx                         (numeric) relative score\n"
+            "  }\n"
+            "  ,...\n"
+            "  ]\n"
+            "  \"warnings\": \"...\"                    (string) any network warnings (such as alert messages) \n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getnetworkinfo", "")
+            + HelpExampleRpc("getnetworkinfo", "")
+        );
+
+    LOCK(cs_main);
+
+    UniValue obj(UniValue::VOBJ);
+    obj.pushKV("version",       CLIENT_VERSION);
+    obj.pushKV("subversion",    strSubVersion);
+    obj.pushKV("protocolversion",PROTOCOL_VERSION);
+    obj.pushKV("localservices",       strprintf("%016x", nLocalServices));
+    obj.pushKV("timeoffset",    0);
+    obj.pushKV("connections",   (int)vNodes.size());
+    obj.pushKV("networks",      GetNetworksInfo());
+    obj.pushKV("relayfee",      ValueFromAmount(::minRelayTxFee.GetFeePerK()));
+    UniValue localAddresses(UniValue::VARR);
+    {
+        LOCK(cs_mapLocalHost);
+        for (const std::pair<CNetAddr, LocalServiceInfo> &item : mapLocalHost)
+        {
+            UniValue rec(UniValue::VOBJ);
+            rec.pushKV("address", item.first.ToString());
+            rec.pushKV("port", item.second.nPort);
+            rec.pushKV("score", item.second.nScore);
+            localAddresses.push_back(rec);
+        }
+    }
+    obj.pushKV("localaddresses", localAddresses);
+    auto warnings = GetWarnings("statusbar");
+    obj.pushKV("warnings",       warnings.first);
+    obj.pushKV("warningstimestamp", warnings.second);
+    return obj;
+}
+
+UniValue setban(const UniValue& params, bool fHelp)
+{
+    string strCommand;
+    if (params.size() >= 2)
+        strCommand = params[1].get_str();
+    if (fHelp || params.size() < 2 ||
+        (strCommand != "add" && strCommand != "remove"))
+        throw runtime_error(
+                            "setban \"ip(/netmask)\" \"add|remove\" (bantime) (absolute)\n"
+                            "\nAttempts to add or remove an IP/Subnet from the banned list.\n"
+                            "\nArguments:\n"
+                            "1. \"ip(/netmask)\" (string, required) The IP/Subnet (see getpeerinfo for nodes IP) with an optional netmask (default is /32 = single IP)\n"
+                            "2. \"command\"      (string, required) 'add' to add an IP/Subnet to the list, 'remove' to remove an IP/Subnet from the list\n"
+                            "3. \"bantime\"      (numeric, optional) time in seconds how long (or until when if [absolute] is set) the IP is banned (0 or empty means using the default time of 24h which can also be overwritten by the -bantime startup argument)\n"
+                            "4. \"absolute\"     (boolean, optional) If set, the bantime must be an absolute timestamp in seconds since epoch (Jan 1 1970 GMT)\n"
+                            "\nExamples:\n"
+                            + HelpExampleCli("setban", "\"192.168.0.6\" \"add\" 86400")
+                            + HelpExampleCli("setban", "\"192.168.0.0/24\" \"add\"")
+                            + HelpExampleRpc("setban", "\"192.168.0.6\", \"add\" 86400")
+                            );
+
+    CSubNet subNet;
+    CNetAddr netAddr;
+    bool isSubnet = false;
+
+    if (params[0].get_str().find("/") != string::npos)
+        isSubnet = true;
+
+    if (!isSubnet)
+        netAddr = CNetAddr(params[0].get_str());
+    else
+        subNet = CSubNet(params[0].get_str());
+
+    if (! (isSubnet ? subNet.IsValid() : netAddr.IsValid()) )
+        throw JSONRPCError(RPC_CLIENT_NODE_ALREADY_ADDED, "Error: Invalid IP/Subnet");
+
+    if (strCommand == "add")
+    {
+        if (isSubnet ? CNode::IsBanned(subNet) : CNode::IsBanned(netAddr))
+            throw JSONRPCError(RPC_CLIENT_NODE_ALREADY_ADDED, "Error: IP/Subnet already banned");
+
+        int64_t banTime = 0; //use standard bantime if not specified
+        if (params.size() >= 3 && !params[2].isNull())
+            banTime = params[2].get_int64();
+
+        bool absolute = false;
+        if (params.size() == 4 && params[3].isTrue())
+            absolute = true;
+
+        isSubnet ? CNode::Ban(subNet, BanReasonManuallyAdded, banTime, absolute) : CNode::Ban(netAddr, BanReasonManuallyAdded, banTime, absolute);
+    }
+    else if(strCommand == "remove")
+    {
+        if (!( isSubnet ? CNode::Unban(subNet) : CNode::Unban(netAddr) ))
+            throw JSONRPCError(RPC_MISC_ERROR, "Error: Unban failed");
+    }
+    return NullUniValue;
+}
+
+UniValue listbanned(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 0)
+        throw runtime_error(
+                            "listbanned\n"
+                            "\nList all banned IPs/Subnets.\n"
+                            "\nExamples:\n"
+                            + HelpExampleCli("listbanned", "")
+                            + HelpExampleRpc("listbanned", "")
+                            );
+
+    banmap_t banMap;
+    CNode::GetBanned(banMap);
+
+    UniValue bannedAddresses(UniValue::VARR);
+    for (banmap_t::iterator it = banMap.begin(); it != banMap.end(); it++)
+    {
+        CBanEntry banEntry = (*it).second;
+        UniValue rec(UniValue::VOBJ);
+        rec.pushKV("address", (*it).first.ToString());
+        rec.pushKV("banned_until", banEntry.nBanUntil);
+        rec.pushKV("ban_created", banEntry.nCreateTime);
+        rec.pushKV("ban_reason", banEntry.banReasonToString());
+
+        bannedAddresses.push_back(rec);
+    }
+
+    return bannedAddresses;
+}
+
+UniValue clearbanned(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 0)
+        throw runtime_error(
+                            "clearbanned\n"
+                            "\nClear all banned IPs.\n"
+                            "\nExamples:\n"
+                            + HelpExampleCli("clearbanned", "")
+                            + HelpExampleRpc("clearbanned", "")
+                            );
+
+    CNode::ClearBanned();
+
+    return NullUniValue;
+}
+
+static const CRPCCommand commands[] =
+{ //  category              name                      actor (function)         okSafeMode
+  //  --------------------- ------------------------  -----------------------  ----------
+    { "network",            "getconnectioncount",     &getconnectioncount,     true  },
+    { "network",            "getdeprecationinfo",     &getdeprecationinfo,     true  },
+    { "network",            "ping",                   &ping,                   true  },
+    { "network",            "getpeerinfo",            &getpeerinfo,            true  },
+    { "network",            "addnode",                &addnode,                true  },
+    { "network",            "disconnectnode",         &disconnectnode,         true  },
+    { "network",            "getaddednodeinfo",       &getaddednodeinfo,       true  },
+    { "network",            "getnettotals",           &getnettotals,           true  },
+    { "network",            "getnetworkinfo",         &getnetworkinfo,         true  },
+    { "network",            "setban",                 &setban,                 true  },
+    { "network",            "listbanned",             &listbanned,             true  },
+    { "network",            "clearbanned",            &clearbanned,            true  },
+};
+
+void RegisterNetRPCCommands(CRPCTable &tableRPC)
+{
+    for (unsigned int vcidx = 0; vcidx < ARRAYLEN(commands); vcidx++)
+        tableRPC.appendCommand(commands[vcidx].name, &commands[vcidx]);
+}
diff --git a/depend/zcash/src/rpc/protocol.cpp b/depend/zcash/src/rpc/protocol.cpp
new file mode 100644
index 000000000..46aa20001
--- /dev/null
+++ b/depend/zcash/src/rpc/protocol.cpp
@@ -0,0 +1,127 @@
+// Copyright (c) 2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "rpc/protocol.h"
+
+#include "random.h"
+#include "tinyformat.h"
+#include "util.h"
+#include "utilstrencodings.h"
+#include "utiltime.h"
+#include "version.h"
+
+#include <stdint.h>
+#include <fstream>
+
+using namespace std;
+
+/**
+ * JSON-RPC protocol.  Bitcoin speaks version 1.0 for maximum compatibility,
+ * but uses JSON-RPC 1.1/2.0 standards for parts of the 1.0 standard that were
+ * unspecified (HTTP errors and contents of 'error').
+ *
+ * 1.0 spec: https://www.jsonrpc.org/specification_v1
+ * 1.2 spec: https://www.jsonrpc.org/historical/jsonrpc12_proposal.html
+ */
+
+string JSONRPCRequest(const string& strMethod, const UniValue& params, const UniValue& id)
+{
+    UniValue request(UniValue::VOBJ);
+    request.pushKV("method", strMethod);
+    request.pushKV("params", params);
+    request.pushKV("id", id);
+    return request.write() + "\n";
+}
+
+UniValue JSONRPCReplyObj(const UniValue& result, const UniValue& error, const UniValue& id)
+{
+    UniValue reply(UniValue::VOBJ);
+    if (!error.isNull())
+        reply.pushKV("result", NullUniValue);
+    else
+        reply.pushKV("result", result);
+    reply.pushKV("error", error);
+    reply.pushKV("id", id);
+    return reply;
+}
+
+string JSONRPCReply(const UniValue& result, const UniValue& error, const UniValue& id)
+{
+    UniValue reply = JSONRPCReplyObj(result, error, id);
+    return reply.write() + "\n";
+}
+
+UniValue JSONRPCError(int code, const string& message)
+{
+    UniValue error(UniValue::VOBJ);
+    error.pushKV("code", code);
+    error.pushKV("message", message);
+    return error;
+}
+
+/** Username used when cookie authentication is in use (arbitrary, only for
+ * recognizability in debugging/logging purposes)
+ */
+static const std::string COOKIEAUTH_USER = "__cookie__";
+/** Default name for auth cookie file */
+static const std::string COOKIEAUTH_FILE = ".cookie";
+
+fs::path GetAuthCookieFile()
+{
+    fs::path path(GetArg("-rpccookiefile", COOKIEAUTH_FILE));
+    if (!path.is_complete()) path = GetDataDir() / path;
+    return path;
+}
+
+bool GenerateAuthCookie(std::string *cookie_out)
+{
+    unsigned char rand_pwd[32];
+    GetRandBytes(rand_pwd, 32);
+    std::string cookie = COOKIEAUTH_USER + ":" + EncodeBase64(&rand_pwd[0],32);
+
+    /** the umask determines what permissions are used to create this file -
+     * these are set to 077 in init.cpp unless overridden with -sysperms.
+     */
+    std::ofstream file;
+    fs::path filepath = GetAuthCookieFile();
+    file.open(filepath.string().c_str());
+    if (!file.is_open()) {
+        LogPrintf("Unable to open cookie authentication file %s for writing\n", filepath.string());
+        return false;
+    }
+    file << cookie;
+    file.close();
+    LogPrintf("Generated RPC authentication cookie %s\n", filepath.string());
+
+    if (cookie_out)
+        *cookie_out = cookie;
+    return true;
+}
+
+bool GetAuthCookie(std::string *cookie_out)
+{
+    std::ifstream file;
+    std::string cookie;
+    fs::path filepath = GetAuthCookieFile();
+    file.open(filepath.string().c_str());
+    if (!file.is_open())
+        return false;
+    std::getline(file, cookie);
+    file.close();
+
+    if (cookie_out)
+        *cookie_out = cookie;
+    return true;
+}
+
+void DeleteAuthCookie()
+{
+    try {
+        fs::remove(GetAuthCookieFile());
+    } catch (const fs::filesystem_error& e) {
+        LogPrintf("%s: Unable to remove random auth cookie file: %s\n", __func__, e.what());
+    }
+}
+
diff --git a/depend/zcash/src/rpc/protocol.h b/depend/zcash/src/rpc/protocol.h
new file mode 100644
index 000000000..83c1ef79c
--- /dev/null
+++ b/depend/zcash/src/rpc/protocol.h
@@ -0,0 +1,95 @@
+// Copyright (c) 2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_RPC_PROTOCOL_H
+#define BITCOIN_RPC_PROTOCOL_H
+
+#include "fs.h"
+
+#include <list>
+#include <map>
+#include <stdint.h>
+#include <string>
+
+#include <univalue.h>
+
+//! HTTP status codes
+enum HTTPStatusCode
+{
+    HTTP_OK                    = 200,
+    HTTP_BAD_REQUEST           = 400,
+    HTTP_UNAUTHORIZED          = 401,
+    HTTP_FORBIDDEN             = 403,
+    HTTP_NOT_FOUND             = 404,
+    HTTP_BAD_METHOD            = 405,
+    HTTP_INTERNAL_SERVER_ERROR = 500,
+    HTTP_SERVICE_UNAVAILABLE   = 503,
+};
+
+//! Bitcoin RPC error codes
+enum RPCErrorCode
+{
+    //! Standard JSON-RPC 2.0 errors
+    RPC_INVALID_REQUEST  = -32600,
+    RPC_METHOD_NOT_FOUND = -32601,
+    RPC_INVALID_PARAMS   = -32602,
+    RPC_INTERNAL_ERROR   = -32603,
+    RPC_PARSE_ERROR      = -32700,
+
+    //! General application defined errors
+    RPC_MISC_ERROR                  = -1,  //! std::exception thrown in command handling
+    RPC_FORBIDDEN_BY_SAFE_MODE      = -2,  //! Server is in safe mode, and command is not allowed in safe mode
+    RPC_TYPE_ERROR                  = -3,  //! Unexpected type was passed as parameter
+    RPC_INVALID_ADDRESS_OR_KEY      = -5,  //! Invalid address or key
+    RPC_OUT_OF_MEMORY               = -7,  //! Ran out of memory during operation
+    RPC_INVALID_PARAMETER           = -8,  //! Invalid, missing or duplicate parameter
+    RPC_DATABASE_ERROR              = -20, //! Database error
+    RPC_DESERIALIZATION_ERROR       = -22, //! Error parsing or validating structure in raw format
+    RPC_VERIFY_ERROR                = -25, //! General error during transaction or block submission
+    RPC_VERIFY_REJECTED             = -26, //! Transaction or block was rejected by network rules
+    RPC_VERIFY_ALREADY_IN_CHAIN     = -27, //! Transaction already in chain
+    RPC_IN_WARMUP                   = -28, //! Client still warming up
+
+    //! Aliases for backward compatibility
+    RPC_TRANSACTION_ERROR           = RPC_VERIFY_ERROR,
+    RPC_TRANSACTION_REJECTED        = RPC_VERIFY_REJECTED,
+    RPC_TRANSACTION_ALREADY_IN_CHAIN= RPC_VERIFY_ALREADY_IN_CHAIN,
+
+    //! P2P client errors
+    RPC_CLIENT_NOT_CONNECTED        = -9,  //! Bitcoin is not connected
+    RPC_CLIENT_IN_INITIAL_DOWNLOAD  = -10, //! Still downloading initial blocks
+    RPC_CLIENT_NODE_ALREADY_ADDED   = -23, //! Node is already added
+    RPC_CLIENT_NODE_NOT_ADDED       = -24, //! Node has not been added before
+    RPC_CLIENT_NODE_NOT_CONNECTED   = -29, //! Node to disconnect not found in connected nodes
+    RPC_CLIENT_INVALID_IP_OR_SUBNET = -30, //! Invalid IP/Subnet
+
+    //! Wallet errors
+    RPC_WALLET_ERROR                = -4,  //! Unspecified problem with wallet (key not found etc.)
+    RPC_WALLET_INSUFFICIENT_FUNDS   = -6,  //! Not enough funds in wallet or account
+    RPC_WALLET_ACCOUNTS_UNSUPPORTED = -11, //! Accounts are unsupported
+    RPC_WALLET_KEYPOOL_RAN_OUT      = -12, //! Keypool ran out, call keypoolrefill first
+    RPC_WALLET_UNLOCK_NEEDED        = -13, //! Enter the wallet passphrase with walletpassphrase first
+    RPC_WALLET_PASSPHRASE_INCORRECT = -14, //! The wallet passphrase entered was incorrect
+    RPC_WALLET_WRONG_ENC_STATE      = -15, //! Command given in wrong wallet encryption state (encrypting an encrypted wallet etc.)
+    RPC_WALLET_ENCRYPTION_FAILED    = -16, //! Failed to encrypt the wallet
+    RPC_WALLET_ALREADY_UNLOCKED     = -17, //! Wallet is already unlocked
+    RPC_WALLET_BACKUP_REQUIRED      = -18, //! User must acknowledge backup of the mnemonic seed.
+};
+
+std::string JSONRPCRequest(const std::string& strMethod, const UniValue& params, const UniValue& id);
+UniValue JSONRPCReplyObj(const UniValue& result, const UniValue& error, const UniValue& id);
+std::string JSONRPCReply(const UniValue& result, const UniValue& error, const UniValue& id);
+UniValue JSONRPCError(int code, const std::string& message);
+
+/** Get name of RPC authentication cookie file */
+fs::path GetAuthCookieFile();
+/** Generate a new RPC authentication cookie and write it to disk */
+bool GenerateAuthCookie(std::string *cookie_out);
+/** Read the RPC authentication cookie from disk */
+bool GetAuthCookie(std::string *cookie_out);
+/** Delete RPC authentication cookie from disk */
+void DeleteAuthCookie();
+
+#endif // BITCOIN_RPC_PROTOCOL_H
diff --git a/depend/zcash/src/rpc/rawtransaction.cpp b/depend/zcash/src/rpc/rawtransaction.cpp
new file mode 100644
index 000000000..238a7e843
--- /dev/null
+++ b/depend/zcash/src/rpc/rawtransaction.cpp
@@ -0,0 +1,1194 @@
+// Copyright (c) 2010 Satoshi Nakamoto
+// Copyright (c) 2009-2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "consensus/upgrades.h"
+#include "consensus/validation.h"
+#include "core_io.h"
+#include "init.h"
+#include "deprecation.h"
+#include "key_io.h"
+#include "keystore.h"
+#include "main.h"
+#include "merkleblock.h"
+#include "net.h"
+#include "policy/policy.h"
+#include "primitives/transaction.h"
+#include "rpc/server.h"
+#include "script/script.h"
+#include "script/script_error.h"
+#include "script/sign.h"
+#include "script/standard.h"
+#include "uint256.h"
+#ifdef ENABLE_WALLET
+#include "wallet/wallet.h"
+#endif
+
+#include <stdint.h>
+#include <variant>
+
+#include <boost/assign/list_of.hpp>
+
+#include <univalue.h>
+
+using namespace std;
+
+void ScriptPubKeyToJSON(const CScript& scriptPubKey, UniValue& out, bool fIncludeHex)
+{
+    txnouttype type;
+    vector<CTxDestination> addresses;
+    int nRequired;
+
+    out.pushKV("asm", ScriptToAsmStr(scriptPubKey));
+    if (fIncludeHex)
+        out.pushKV("hex", HexStr(scriptPubKey.begin(), scriptPubKey.end()));
+
+    if (!ExtractDestinations(scriptPubKey, type, addresses, nRequired)) {
+        out.pushKV("type", GetTxnOutputType(type));
+        return;
+    }
+
+    out.pushKV("reqSigs", nRequired);
+    out.pushKV("type", GetTxnOutputType(type));
+
+    KeyIO keyIO(Params());
+    UniValue a(UniValue::VARR);
+    for (const CTxDestination& addr : addresses) {
+        a.push_back(keyIO.EncodeDestination(addr));
+    }
+    out.pushKV("addresses", a);
+}
+
+
+UniValue TxJoinSplitToJSON(const CTransaction& tx) {
+    bool useGroth = tx.fOverwintered && tx.nVersion >= SAPLING_TX_VERSION;
+    UniValue vJoinSplit(UniValue::VARR);
+    for (unsigned int i = 0; i < tx.vJoinSplit.size(); i++) {
+        const JSDescription& jsdescription = tx.vJoinSplit[i];
+        UniValue joinsplit(UniValue::VOBJ);
+
+        joinsplit.pushKV("vpub_old", ValueFromAmount(jsdescription.vpub_old));
+        joinsplit.pushKV("vpub_oldZat", jsdescription.vpub_old);
+        joinsplit.pushKV("vpub_new", ValueFromAmount(jsdescription.vpub_new));
+        joinsplit.pushKV("vpub_newZat", jsdescription.vpub_new);
+
+        joinsplit.pushKV("anchor", jsdescription.anchor.GetHex());
+
+        {
+            UniValue nullifiers(UniValue::VARR);
+            for (const uint256 nf : jsdescription.nullifiers) {
+                nullifiers.push_back(nf.GetHex());
+            }
+            joinsplit.pushKV("nullifiers", nullifiers);
+        }
+
+        {
+            UniValue commitments(UniValue::VARR);
+            for (const uint256 commitment : jsdescription.commitments) {
+                commitments.push_back(commitment.GetHex());
+            }
+            joinsplit.pushKV("commitments", commitments);
+        }
+
+        joinsplit.pushKV("onetimePubKey", jsdescription.ephemeralKey.GetHex());
+        joinsplit.pushKV("randomSeed", jsdescription.randomSeed.GetHex());
+
+        {
+            UniValue macs(UniValue::VARR);
+            for (const uint256 mac : jsdescription.macs) {
+                macs.push_back(mac.GetHex());
+            }
+            joinsplit.pushKV("macs", macs);
+        }
+
+        CDataStream ssProof(SER_NETWORK, PROTOCOL_VERSION);
+        auto ps = SproutProofSerializer<CDataStream>(ssProof, useGroth);
+        std::visit(ps, jsdescription.proof);
+        joinsplit.pushKV("proof", HexStr(ssProof.begin(), ssProof.end()));
+
+        {
+            UniValue ciphertexts(UniValue::VARR);
+            for (const ZCNoteEncryption::Ciphertext ct : jsdescription.ciphertexts) {
+                ciphertexts.push_back(HexStr(ct.begin(), ct.end()));
+            }
+            joinsplit.pushKV("ciphertexts", ciphertexts);
+        }
+
+        vJoinSplit.push_back(joinsplit);
+    }
+    return vJoinSplit;
+}
+
+UniValue TxShieldedSpendsToJSON(const CTransaction& tx) {
+    UniValue vdesc(UniValue::VARR);
+    for (const SpendDescription& spendDesc : tx.vShieldedSpend) {
+        UniValue obj(UniValue::VOBJ);
+        obj.pushKV("cv", spendDesc.cv.GetHex());
+        obj.pushKV("anchor", spendDesc.anchor.GetHex());
+        obj.pushKV("nullifier", spendDesc.nullifier.GetHex());
+        obj.pushKV("rk", spendDesc.rk.GetHex());
+        obj.pushKV("proof", HexStr(spendDesc.zkproof.begin(), spendDesc.zkproof.end()));
+        obj.pushKV("spendAuthSig", HexStr(spendDesc.spendAuthSig.begin(), spendDesc.spendAuthSig.end()));
+        vdesc.push_back(obj);
+    }
+    return vdesc;
+}
+
+UniValue TxShieldedOutputsToJSON(const CTransaction& tx) {
+    UniValue vdesc(UniValue::VARR);
+    for (const OutputDescription& outputDesc : tx.vShieldedOutput) {
+        UniValue obj(UniValue::VOBJ);
+        obj.pushKV("cv", outputDesc.cv.GetHex());
+        obj.pushKV("cmu", outputDesc.cmu.GetHex());
+        obj.pushKV("ephemeralKey", outputDesc.ephemeralKey.GetHex());
+        obj.pushKV("encCiphertext", HexStr(outputDesc.encCiphertext.begin(), outputDesc.encCiphertext.end()));
+        obj.pushKV("outCiphertext", HexStr(outputDesc.outCiphertext.begin(), outputDesc.outCiphertext.end()));
+        obj.pushKV("proof", HexStr(outputDesc.zkproof.begin(), outputDesc.zkproof.end()));
+        vdesc.push_back(obj);
+    }
+    return vdesc;
+}
+
+void TxToJSON(const CTransaction& tx, const uint256 hashBlock, UniValue& entry)
+{
+    const uint256 txid = tx.GetHash();
+    entry.pushKV("txid", txid.GetHex());
+    entry.pushKV("authdigest", tx.GetAuthDigest().GetHex());
+    entry.pushKV("size", (int)::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION));
+    entry.pushKV("overwintered", tx.fOverwintered);
+    entry.pushKV("version", tx.nVersion);
+    if (tx.fOverwintered) {
+        entry.pushKV("versiongroupid", HexInt(tx.nVersionGroupId));
+    }
+    entry.pushKV("locktime", (int64_t)tx.nLockTime);
+    if (tx.fOverwintered) {
+        entry.pushKV("expiryheight", (int64_t)tx.nExpiryHeight);
+    }
+
+    entry.pushKV("hex", EncodeHexTx(tx));
+
+    KeyIO keyIO(Params());
+    UniValue vin(UniValue::VARR);
+    for (const CTxIn& txin : tx.vin) {
+        UniValue in(UniValue::VOBJ);
+        if (tx.IsCoinBase())
+            in.pushKV("coinbase", HexStr(txin.scriptSig.begin(), txin.scriptSig.end()));
+        else {
+            in.pushKV("txid", txin.prevout.hash.GetHex());
+            in.pushKV("vout", (int64_t)txin.prevout.n);
+            UniValue o(UniValue::VOBJ);
+            o.pushKV("asm", ScriptToAsmStr(txin.scriptSig, true));
+            o.pushKV("hex", HexStr(txin.scriptSig.begin(), txin.scriptSig.end()));
+            in.pushKV("scriptSig", o);
+
+            // Add address and value info if spentindex enabled
+            CSpentIndexValue spentInfo;
+            CSpentIndexKey spentKey(txin.prevout.hash, txin.prevout.n);
+            if (fSpentIndex && GetSpentIndex(spentKey, spentInfo)) {
+                in.pushKV("value", ValueFromAmount(spentInfo.satoshis));
+                in.pushKV("valueSat", spentInfo.satoshis);
+
+                CTxDestination dest =
+                    DestFromAddressHash(spentInfo.addressType, spentInfo.addressHash);
+                if (IsValidDestination(dest)) {
+                    in.pushKV("address", keyIO.EncodeDestination(dest));
+                }
+            }
+        }
+        in.pushKV("sequence", (int64_t)txin.nSequence);
+        vin.push_back(in);
+    }
+    entry.pushKV("vin", vin);
+    UniValue vout(UniValue::VARR);
+    for (unsigned int i = 0; i < tx.vout.size(); i++) {
+        const CTxOut& txout = tx.vout[i];
+        UniValue out(UniValue::VOBJ);
+        out.pushKV("value", ValueFromAmount(txout.nValue));
+        out.pushKV("valueZat", txout.nValue);
+        out.pushKV("valueSat", txout.nValue);
+        out.pushKV("n", (int64_t)i);
+        UniValue o(UniValue::VOBJ);
+        ScriptPubKeyToJSON(txout.scriptPubKey, o, true);
+        out.pushKV("scriptPubKey", o);
+
+        // Add spent information if spentindex is enabled
+        CSpentIndexValue spentInfo;
+        CSpentIndexKey spentKey(txid, i);
+        if (fSpentIndex && GetSpentIndex(spentKey, spentInfo)) {
+            out.pushKV("spentTxId", spentInfo.txid.GetHex());
+            out.pushKV("spentIndex", (int)spentInfo.inputIndex);
+            out.pushKV("spentHeight", spentInfo.blockHeight);
+        }
+        vout.push_back(out);
+    }
+    entry.pushKV("vout", vout);
+
+    UniValue vjoinsplit = TxJoinSplitToJSON(tx);
+    entry.pushKV("vjoinsplit", vjoinsplit);
+
+    if (tx.fOverwintered && tx.nVersion >= SAPLING_TX_VERSION) {
+        entry.pushKV("valueBalance", ValueFromAmount(tx.GetValueBalanceSapling()));
+        entry.pushKV("valueBalanceZat", tx.GetValueBalanceSapling());
+        UniValue vspenddesc = TxShieldedSpendsToJSON(tx);
+        entry.pushKV("vShieldedSpend", vspenddesc);
+        UniValue voutputdesc = TxShieldedOutputsToJSON(tx);
+        entry.pushKV("vShieldedOutput", voutputdesc);
+        if (!(vspenddesc.empty() && voutputdesc.empty())) {
+            entry.pushKV("bindingSig", HexStr(tx.bindingSig.begin(), tx.bindingSig.end()));
+        }
+    }
+
+    if (tx.nVersion >= 2 && tx.vJoinSplit.size() > 0) {
+        // Copy joinSplitPubKey into a uint256 so that
+        // it is byte-flipped in the RPC output.
+        uint256 joinSplitPubKey;
+        std::copy(
+            tx.joinSplitPubKey.bytes,
+            tx.joinSplitPubKey.bytes + ED25519_VERIFICATION_KEY_LEN,
+            joinSplitPubKey.begin());
+        entry.pushKV("joinSplitPubKey", joinSplitPubKey.GetHex());
+        entry.pushKV("joinSplitSig",
+            HexStr(tx.joinSplitSig.bytes, tx.joinSplitSig.bytes + ED25519_SIGNATURE_LEN));
+    }
+
+    if (!hashBlock.IsNull()) {
+        entry.pushKV("blockhash", hashBlock.GetHex());
+        BlockMap::iterator mi = mapBlockIndex.find(hashBlock);
+        if (mi != mapBlockIndex.end() && (*mi).second) {
+            CBlockIndex* pindex = (*mi).second;
+            if (chainActive.Contains(pindex)) {
+                entry.pushKV("height", pindex->nHeight);
+                entry.pushKV("confirmations", 1 + chainActive.Height() - pindex->nHeight);
+                entry.pushKV("time", pindex->GetBlockTime());
+                entry.pushKV("blocktime", pindex->GetBlockTime());
+            } else {
+                entry.pushKV("height", -1);
+                entry.pushKV("confirmations", 0);
+            }
+        }
+    }
+}
+
+UniValue getrawtransaction(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() < 1 || params.size() > 3)
+        throw runtime_error(
+            "getrawtransaction \"txid\" ( verbose \"blockhash\" )\n"
+            "\nNOTE: If \"blockhash\" is not provided and the -txindex option is not enabled, then this call only\n"
+            "works for mempool transactions. If either \"blockhash\" is provided or the -txindex option is\n"
+            "enabled, it also works for blockchain transactions. If the block which contains the transaction\n"
+            "is known, its hash can be provided even for nodes without -txindex. Note that if a blockhash is\n"
+            "provided, only that block will be searched and if the transaction is in the mempool or other\n"
+            "blocks, or if this node does not have the given block available, the transaction will not be found.\n"
+            "\nReturn the raw transaction data.\n"
+            "\nIf verbose=0, returns a string that is serialized, hex-encoded data for 'txid'.\n"
+            "If verbose is non-zero, returns an Object with information about 'txid'.\n"
+
+            "\nArguments:\n"
+            "1. \"txid\"      (string, required) The transaction id\n"
+            "2. verbose     (numeric, optional, default=0) If 0, return a string of hex-encoded data, otherwise return a JSON object\n"
+            "3. \"blockhash\" (string, optional) The block in which to look for the transaction\n"
+
+            "\nResult (if verbose is not set or set to 0):\n"
+            "\"data\"      (string) The serialized, hex-encoded data for 'txid'\n"
+
+            "\nResult (if verbose > 0):\n"
+            "{\n"
+            "  \"in_active_chain\": b,   (bool) Whether specified block is in the active chain or not (only present with explicit \"blockhash\" argument)\n"
+            "  \"hex\" : \"data\",       (string) The serialized, hex-encoded data for 'txid'\n"
+            "  \"txid\" : \"id\",        (string) The transaction id (same as provided)\n"
+            "  \"authdigest\" : \"id\",  (string) The transaction's auth digest. For pre-v5 transactions this will be ffff..ffff\n"
+            "  \"size\" : n,             (numeric) The transaction size\n"
+            "  \"version\" : n,          (numeric) The version\n"
+            "  \"locktime\" : ttt,       (numeric) The lock time\n"
+            "  \"expiryheight\" : ttt,   (numeric, optional) The block height after which the transaction expires\n"
+            "  \"vin\" : [               (array of json objects)\n"
+            "     {\n"
+            "       \"txid\": \"id\",    (string) The transaction id\n"
+            "       \"vout\": n,         (numeric) \n"
+            "       \"scriptSig\": {     (json object) The script\n"
+            "         \"asm\": \"asm\",  (string) asm\n"
+            "         \"hex\": \"hex\"   (string) hex\n"
+            "       },\n"
+            "       \"sequence\": n      (numeric) The script sequence number\n"
+            "     }\n"
+            "     ,...\n"
+            "  ],\n"
+            "  \"vout\" : [              (array of json objects)\n"
+            "     {\n"
+            "       \"value\" : x.xxx,            (numeric) The value in " + CURRENCY_UNIT + "\n"
+            "       \"n\" : n,                    (numeric) index\n"
+            "       \"scriptPubKey\" : {          (json object)\n"
+            "         \"asm\" : \"asm\",          (string) the asm\n"
+            "         \"hex\" : \"hex\",          (string) the hex\n"
+            "         \"reqSigs\" : n,            (numeric) The required sigs\n"
+            "         \"type\" : \"pubkeyhash\",  (string) The type, eg 'pubkeyhash'\n"
+            "         \"addresses\" : [           (json array of string)\n"
+            "           \"zcashaddress\"          (string) Zcash address\n"
+            "           ,...\n"
+            "         ]\n"
+            "       }\n"
+            "     }\n"
+            "     ,...\n"
+            "  ],\n"
+            "  \"vjoinsplit\" : [        (array of json objects, only for version >= 2)\n"
+            "     {\n"
+            "       \"vpub_old\" : x.xxx,         (numeric) public input value in " + CURRENCY_UNIT + "\n"
+            "       \"vpub_new\" : x.xxx,         (numeric) public output value in " + CURRENCY_UNIT + "\n"
+            "       \"anchor\" : \"hex\",         (string) the anchor\n"
+            "       \"nullifiers\" : [            (json array of string)\n"
+            "         \"hex\"                     (string) input note nullifier\n"
+            "         ,...\n"
+            "       ],\n"
+            "       \"commitments\" : [           (json array of string)\n"
+            "         \"hex\"                     (string) output note commitment\n"
+            "         ,...\n"
+            "       ],\n"
+            "       \"onetimePubKey\" : \"hex\",  (string) the onetime public key used to encrypt the ciphertexts\n"
+            "       \"randomSeed\" : \"hex\",     (string) the random seed\n"
+            "       \"macs\" : [                  (json array of string)\n"
+            "         \"hex\"                     (string) input note MAC\n"
+            "         ,...\n"
+            "       ],\n"
+            "       \"proof\" : \"hex\",          (string) the zero-knowledge proof\n"
+            "       \"ciphertexts\" : [           (json array of string)\n"
+            "         \"hex\"                     (string) output note ciphertext\n"
+            "         ,...\n"
+            "       ]\n"
+            "     }\n"
+            "     ,...\n"
+            "  ],\n"
+            "  \"blockhash\" : \"hash\",   (string) the block hash\n"
+            "  \"confirmations\" : n,      (numeric) The confirmations\n"
+            "  \"time\" : ttt,             (numeric) The transaction time in seconds since epoch (Jan 1 1970 GMT)\n"
+            "  \"blocktime\" : ttt         (numeric) The block time in seconds since epoch (Jan 1 1970 GMT)\n"
+            "}\n"
+
+            "\nExamples:\n"
+            + HelpExampleCli("getrawtransaction", "\"mytxid\"")
+            + HelpExampleCli("getrawtransaction", "\"mytxid\" 1")
+            + HelpExampleRpc("getrawtransaction", "\"mytxid\", 1")
+            + HelpExampleCli("getrawtransaction", "\"mytxid\" 0 \"myblockhash\"")
+            + HelpExampleCli("getrawtransaction", "\"mytxid\" 1 \"myblockhash\"")
+        );
+
+    LOCK(cs_main);
+
+    bool in_active_chain = true;
+    uint256 hash = ParseHashV(params[0], "parameter 1");
+    CBlockIndex* blockindex = nullptr;
+
+    bool fVerbose = false;
+    if (params.size() > 1)
+        fVerbose = (params[1].get_int() != 0);
+
+    if (params.size() > 2) {
+        uint256 blockhash = ParseHashV(params[2], "parameter 3");
+        if (!blockhash.IsNull()) {
+            BlockMap::iterator it = mapBlockIndex.find(blockhash);
+            if (it == mapBlockIndex.end()) {
+                throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Block hash not found");
+            }
+            blockindex = it->second;
+            in_active_chain = chainActive.Contains(blockindex);
+        }
+    }
+
+    CTransaction tx;
+    uint256 hash_block;
+    if (!GetTransaction(hash, tx, Params().GetConsensus(), hash_block, true, blockindex)) {
+        std::string errmsg;
+        if (blockindex) {
+            if (!(blockindex->nStatus & BLOCK_HAVE_DATA)) {
+                throw JSONRPCError(RPC_MISC_ERROR, "Block not available");
+            }
+            errmsg = "No such transaction found in the provided block";
+        } else {
+            errmsg = fTxIndex
+              ? "No such mempool or blockchain transaction"
+              : "No such mempool transaction. Use -txindex to enable blockchain transaction queries";
+        }
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, errmsg + ". Use gettransaction for wallet transactions.");
+    }
+
+    string strHex = EncodeHexTx(tx);
+
+    if (!fVerbose)
+        return strHex;
+
+    UniValue result(UniValue::VOBJ);
+    if (blockindex) result.pushKV("in_active_chain", in_active_chain);
+    result.pushKV("hex", strHex);
+    TxToJSON(tx, hash_block, result);
+    return result;
+}
+
+UniValue gettxoutproof(const UniValue& params, bool fHelp)
+{
+    if (fHelp || (params.size() != 1 && params.size() != 2))
+        throw runtime_error(
+            "gettxoutproof [\"txid\",...] ( blockhash )\n"
+            "\nReturns a hex-encoded proof that \"txid\" was included in a block.\n"
+            "\nNOTE: By default this function only works sometimes. This is when there is an\n"
+            "unspent output in the utxo for this transaction. To make it always work,\n"
+            "you need to maintain a transaction index, using the -txindex command line option or\n"
+            "specify the block in which the transaction is included in manually (by blockhash).\n"
+            "\nReturn the raw transaction data.\n"
+            "\nArguments:\n"
+            "1. \"txids\"       (string) A json array of txids to filter\n"
+            "    [\n"
+            "      \"txid\"     (string) A transaction hash\n"
+            "      ,...\n"
+            "    ]\n"
+            "2. \"block hash\"  (string, optional) If specified, looks for txid in the block with this hash\n"
+            "\nResult:\n"
+            "\"data\"           (string) A string that is a serialized, hex-encoded data for the proof.\n"
+        );
+
+    set<uint256> setTxids;
+    uint256 oneTxid;
+    UniValue txids = params[0].get_array();
+    for (size_t idx = 0; idx < txids.size(); idx++) {
+        const UniValue& txid = txids[idx];
+        if (txid.get_str().length() != 64 || !IsHex(txid.get_str()))
+            throw JSONRPCError(RPC_INVALID_PARAMETER, string("Invalid txid ")+txid.get_str());
+        uint256 hash(uint256S(txid.get_str()));
+        if (setTxids.count(hash))
+            throw JSONRPCError(RPC_INVALID_PARAMETER, string("Invalid parameter, duplicated txid: ")+txid.get_str());
+       setTxids.insert(hash);
+       oneTxid = hash;
+    }
+
+    LOCK(cs_main);
+
+    CBlockIndex* pblockindex = NULL;
+
+    uint256 hashBlock;
+    if (params.size() > 1)
+    {
+        hashBlock = uint256S(params[1].get_str());
+        if (!mapBlockIndex.count(hashBlock))
+            throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Block not found");
+        pblockindex = mapBlockIndex[hashBlock];
+    } else {
+        CCoins coins;
+        if (pcoinsTip->GetCoins(oneTxid, coins) && coins.nHeight > 0 && coins.nHeight <= chainActive.Height())
+            pblockindex = chainActive[coins.nHeight];
+    }
+
+    if (pblockindex == NULL)
+    {
+        CTransaction tx;
+        if (!GetTransaction(oneTxid, tx, Params().GetConsensus(), hashBlock, false) || hashBlock.IsNull())
+            throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Transaction not yet in block");
+        if (!mapBlockIndex.count(hashBlock))
+            throw JSONRPCError(RPC_INTERNAL_ERROR, "Transaction index corrupt");
+        pblockindex = mapBlockIndex[hashBlock];
+    }
+
+    CBlock block;
+    if(!ReadBlockFromDisk(block, pblockindex, Params().GetConsensus()))
+        throw JSONRPCError(RPC_INTERNAL_ERROR, "Can't read block from disk");
+
+    unsigned int ntxFound = 0;
+    for (const CTransaction&tx : block.vtx)
+        if (setTxids.count(tx.GetHash()))
+            ntxFound++;
+    if (ntxFound != setTxids.size())
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "(Not all) transactions not found in specified block");
+
+    CDataStream ssMB(SER_NETWORK, PROTOCOL_VERSION);
+    CMerkleBlock mb(block, setTxids);
+    ssMB << mb;
+    std::string strHex = HexStr(ssMB.begin(), ssMB.end());
+    return strHex;
+}
+
+UniValue verifytxoutproof(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "verifytxoutproof \"proof\"\n"
+            "\nVerifies that a proof points to a transaction in a block, returning the transaction it commits to\n"
+            "and throwing an RPC error if the block is not in our best chain\n"
+            "\nArguments:\n"
+            "1. \"proof\"    (string, required) The hex-encoded proof generated by gettxoutproof\n"
+            "\nResult:\n"
+            "[\"txid\"]      (array, strings) The txid(s) which the proof commits to, or empty array if the proof is invalid\n"
+        );
+
+    CDataStream ssMB(ParseHexV(params[0], "proof"), SER_NETWORK, PROTOCOL_VERSION);
+    CMerkleBlock merkleBlock;
+    ssMB >> merkleBlock;
+
+    UniValue res(UniValue::VARR);
+
+    vector<uint256> vMatch;
+    if (merkleBlock.txn.ExtractMatches(vMatch) != merkleBlock.header.hashMerkleRoot)
+        return res;
+
+    LOCK(cs_main);
+
+    if (!mapBlockIndex.count(merkleBlock.header.GetHash()) || !chainActive.Contains(mapBlockIndex[merkleBlock.header.GetHash()]))
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Block not found in chain");
+
+    for (const uint256& hash : vMatch)
+        res.push_back(hash.GetHex());
+    return res;
+}
+
+UniValue createrawtransaction(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() < 2 || params.size() > 4)
+        throw runtime_error(
+            "createrawtransaction [{\"txid\":\"id\",\"vout\":n},...] {\"address\":amount,...} ( locktime ) ( expiryheight )\n"
+            "\nCreate a transaction spending the given inputs and sending to the given addresses.\n"
+            "Returns hex-encoded raw transaction.\n"
+            "Note that the transaction's inputs are not signed, and\n"
+            "it is not stored in the wallet or transmitted to the network.\n"
+
+            "\nArguments:\n"
+            "1. \"transactions\"        (string, required) A json array of json objects\n"
+            "     [\n"
+            "       {\n"
+            "         \"txid\":\"id\",    (string, required) The transaction id\n"
+            "         \"vout\":n        (numeric, required) The output number\n"
+            "         \"sequence\":n    (numeric, optional) The sequence number\n"
+            "       }\n"
+            "       ,...\n"
+            "     ]\n"
+            "2. \"addresses\"           (string, required) a json object with addresses as keys and amounts as values\n"
+            "    {\n"
+            "      \"address\": x.xxx   (numeric, required) The key is the Zcash address, the value is the " + CURRENCY_UNIT + " amount\n"
+            "      ,...\n"
+            "    }\n"
+            "3. locktime              (numeric, optional, default=0) Raw locktime. Non-0 value also locktime-activates inputs\n"
+            "4. expiryheight          (numeric, optional, default="
+                + strprintf("nextblockheight+%d (pre-Blossom) or nextblockheight+%d (post-Blossom)", DEFAULT_PRE_BLOSSOM_TX_EXPIRY_DELTA, DEFAULT_POST_BLOSSOM_TX_EXPIRY_DELTA) + ") "
+                "Expiry height of transaction (if Overwinter is active)\n"
+            "\nResult:\n"
+            "\"transaction\"            (string) hex string of the transaction\n"
+
+            "\nExamples\n"
+            + HelpExampleCli("createrawtransaction", "\"[{\\\"txid\\\":\\\"myid\\\",\\\"vout\\\":0}]\" \"{\\\"address\\\":0.01}\"")
+            + HelpExampleRpc("createrawtransaction", "\"[{\\\"txid\\\":\\\"myid\\\",\\\"vout\\\":0}]\", \"{\\\"address\\\":0.01}\"")
+        );
+
+    RPCTypeCheck(params, boost::assign::list_of(UniValue::VARR)(UniValue::VOBJ)(UniValue::VNUM)(UniValue::VNUM), true);
+    if (params[0].isNull() || params[1].isNull())
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, arguments 1 and 2 must be non-null");
+
+    UniValue inputs = params[0].get_array();
+    UniValue sendTo = params[1].get_obj();
+
+    int nextBlockHeight;
+    {
+        LOCK(cs_main);
+        nextBlockHeight = chainActive.Height() + 1;
+    }
+    CMutableTransaction rawTx = CreateNewContextualCMutableTransaction(
+        Params().GetConsensus(), nextBlockHeight);
+
+    if (params.size() > 2 && !params[2].isNull()) {
+        int64_t nLockTime = params[2].get_int64();
+        if (nLockTime < 0 || nLockTime > std::numeric_limits<uint32_t>::max())
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, locktime out of range");
+        rawTx.nLockTime = nLockTime;
+    }
+
+    if (params.size() > 3 && !params[3].isNull()) {
+        if (Params().GetConsensus().NetworkUpgradeActive(nextBlockHeight, Consensus::UPGRADE_OVERWINTER)) {
+            int64_t nExpiryHeight = params[3].get_int64();
+            if (nExpiryHeight < 0 || nExpiryHeight >= TX_EXPIRY_HEIGHT_THRESHOLD) {
+                throw JSONRPCError(RPC_INVALID_PARAMETER, strprintf("Invalid parameter, expiryheight must be nonnegative and less than %d.", TX_EXPIRY_HEIGHT_THRESHOLD));
+            }
+            // DoS mitigation: reject transactions expiring soon
+            if (nExpiryHeight != 0 && nextBlockHeight + TX_EXPIRING_SOON_THRESHOLD > nExpiryHeight) {
+                throw JSONRPCError(RPC_INVALID_PARAMETER,
+                    strprintf("Invalid parameter, expiryheight should be at least %d to avoid transaction expiring soon",
+                    nextBlockHeight + TX_EXPIRING_SOON_THRESHOLD));
+            }
+            rawTx.nExpiryHeight = nExpiryHeight;
+        } else {
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, expiryheight can only be used if Overwinter is active when the transaction is mined");
+        }
+    }
+
+    for (size_t idx = 0; idx < inputs.size(); idx++) {
+        const UniValue& input = inputs[idx];
+        const UniValue& o = input.get_obj();
+
+        uint256 txid = ParseHashO(o, "txid");
+
+        const UniValue& vout_v = find_value(o, "vout");
+        if (!vout_v.isNum())
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, missing vout key");
+        int nOutput = vout_v.get_int();
+        if (nOutput < 0)
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, vout must be positive");
+
+        uint32_t nSequence = (rawTx.nLockTime ? std::numeric_limits<uint32_t>::max() - 1 : std::numeric_limits<uint32_t>::max());
+
+        // set the sequence number if passed in the parameters object
+        const UniValue& sequenceObj = find_value(o, "sequence");
+        if (sequenceObj.isNum())
+            nSequence = sequenceObj.get_int();
+
+        CTxIn in(COutPoint(txid, nOutput), CScript(), nSequence);
+
+        rawTx.vin.push_back(in);
+    }
+
+    KeyIO keyIO(Params());
+    std::set<CTxDestination> destinations;
+    vector<string> addrList = sendTo.getKeys();
+    for (const std::string& name_ : addrList) {
+        CTxDestination destination = keyIO.DecodeDestination(name_);
+        if (!IsValidDestination(destination)) {
+            throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, std::string("Invalid Zcash address: ") + name_);
+        }
+
+        if (!destinations.insert(destination).second) {
+            throw JSONRPCError(RPC_INVALID_PARAMETER, std::string("Invalid parameter, duplicated address: ") + name_);
+        }
+
+        CScript scriptPubKey = GetScriptForDestination(destination);
+        CAmount nAmount = AmountFromValue(sendTo[name_]);
+
+        CTxOut out(nAmount, scriptPubKey);
+        rawTx.vout.push_back(out);
+    }
+
+    return EncodeHexTx(rawTx);
+}
+
+UniValue decoderawtransaction(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "decoderawtransaction \"hexstring\"\n"
+            "\nReturn a JSON object representing the serialized, hex-encoded transaction.\n"
+
+            "\nArguments:\n"
+            "1. \"hex\"      (string, required) The transaction hex string\n"
+
+            "\nResult:\n"
+            "{\n"
+            "  \"txid\" : \"id\",        (string) The transaction id\n"
+            "  \"authdigest\" : \"id\",  (string) The transaction's auth digest. For pre-v5 txs this is ffff..ffff\n"
+            "  \"size\" : n,             (numeric) The transaction size\n"
+            "  \"overwintered\" : bool   (boolean) The Overwintered flag\n"
+            "  \"version\" : n,          (numeric) The version\n"
+            "  \"versiongroupid\": \"hex\"   (string, optional) The version group id (Overwintered txs)\n"
+            "  \"locktime\" : ttt,       (numeric) The lock time\n"
+            "  \"expiryheight\" : n,     (numeric, optional) Last valid block height for mining transaction (Overwintered txs)\n"
+            "  \"vin\" : [               (array of json objects)\n"
+            "     {\n"
+            "       \"txid\": \"id\",    (string) The transaction id\n"
+            "       \"vout\": n,         (numeric) The output number\n"
+            "       \"scriptSig\": {     (json object) The script\n"
+            "         \"asm\": \"asm\",  (string) asm\n"
+            "         \"hex\": \"hex\"   (string) hex\n"
+            "       },\n"
+            "       \"sequence\": n     (numeric) The script sequence number\n"
+            "     }\n"
+            "     ,...\n"
+            "  ],\n"
+            "  \"vout\" : [             (array of json objects)\n"
+            "     {\n"
+            "       \"value\" : x.xxx,            (numeric) The value in " + CURRENCY_UNIT + "\n"
+            "       \"n\" : n,                    (numeric) index\n"
+            "       \"scriptPubKey\" : {          (json object)\n"
+            "         \"asm\" : \"asm\",          (string) the asm\n"
+            "         \"hex\" : \"hex\",          (string) the hex\n"
+            "         \"reqSigs\" : n,            (numeric) The required sigs\n"
+            "         \"type\" : \"pubkeyhash\",  (string) The type, eg 'pubkeyhash'\n"
+            "         \"addresses\" : [           (json array of string)\n"
+            "           \"t12tvKAXCxZjSmdNbao16dKXC8tRWfcF5oc\"   (string) zcash address\n"
+            "           ,...\n"
+            "         ]\n"
+            "       }\n"
+            "     }\n"
+            "     ,...\n"
+            "  ],\n"
+            "  \"vjoinsplit\" : [        (array of json objects, only for version >= 2)\n"
+            "     {\n"
+            "       \"vpub_old\" : x.xxx,         (numeric) public input value in " + CURRENCY_UNIT + "\n"
+            "       \"vpub_new\" : x.xxx,         (numeric) public output value in " + CURRENCY_UNIT + "\n"
+            "       \"anchor\" : \"hex\",         (string) the anchor\n"
+            "       \"nullifiers\" : [            (json array of string)\n"
+            "         \"hex\"                     (string) input note nullifier\n"
+            "         ,...\n"
+            "       ],\n"
+            "       \"commitments\" : [           (json array of string)\n"
+            "         \"hex\"                     (string) output note commitment\n"
+            "         ,...\n"
+            "       ],\n"
+            "       \"onetimePubKey\" : \"hex\",  (string) the onetime public key used to encrypt the ciphertexts\n"
+            "       \"randomSeed\" : \"hex\",     (string) the random seed\n"
+            "       \"macs\" : [                  (json array of string)\n"
+            "         \"hex\"                     (string) input note MAC\n"
+            "         ,...\n"
+            "       ],\n"
+            "       \"proof\" : \"hex\",          (string) the zero-knowledge proof\n"
+            "       \"ciphertexts\" : [           (json array of string)\n"
+            "         \"hex\"                     (string) output note ciphertext\n"
+            "         ,...\n"
+            "       ]\n"
+            "     }\n"
+            "     ,...\n"
+            "  ],\n"
+            "}\n"
+
+            "\nExamples:\n"
+            + HelpExampleCli("decoderawtransaction", "\"hexstring\"")
+            + HelpExampleRpc("decoderawtransaction", "\"hexstring\"")
+        );
+
+    LOCK(cs_main);
+    RPCTypeCheck(params, boost::assign::list_of(UniValue::VSTR));
+
+    CTransaction tx;
+
+    if (!DecodeHexTx(tx, params[0].get_str()))
+        throw JSONRPCError(RPC_DESERIALIZATION_ERROR, "TX decode failed");
+
+    UniValue result(UniValue::VOBJ);
+    TxToJSON(tx, uint256(), result);
+
+    return result;
+}
+
+UniValue decodescript(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "decodescript \"hex\"\n"
+            "\nDecode a hex-encoded script.\n"
+            "\nArguments:\n"
+            "1. \"hex\"     (string) the hex encoded script\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"asm\":\"asm\",   (string) Script public key\n"
+            "  \"hex\":\"hex\",   (string) hex encoded public key\n"
+            "  \"type\":\"type\", (string) The output type\n"
+            "  \"reqSigs\": n,    (numeric) The required signatures\n"
+            "  \"addresses\": [   (json array of string)\n"
+            "     \"address\"     (string) Zcash address\n"
+            "     ,...\n"
+            "  ],\n"
+            "  \"p2sh\",\"address\" (string) script address\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("decodescript", "\"hexstring\"")
+            + HelpExampleRpc("decodescript", "\"hexstring\"")
+        );
+
+    RPCTypeCheck(params, boost::assign::list_of(UniValue::VSTR));
+
+    UniValue r(UniValue::VOBJ);
+    CScript script;
+    if (params[0].get_str().size() > 0){
+        vector<unsigned char> scriptData(ParseHexV(params[0], "argument"));
+        script = CScript(scriptData.begin(), scriptData.end());
+    } else {
+        // Empty scripts are valid
+    }
+    ScriptPubKeyToJSON(script, r, false);
+
+    KeyIO keyIO(Params());
+    r.pushKV("p2sh", keyIO.EncodeDestination(CScriptID(script)));
+    return r;
+}
+
+/** Pushes a JSON object for script verification or signing errors to vErrorsRet. */
+static void TxInErrorToJSON(const CTxIn& txin, UniValue& vErrorsRet, const std::string& strMessage)
+{
+    UniValue entry(UniValue::VOBJ);
+    entry.pushKV("txid", txin.prevout.hash.ToString());
+    entry.pushKV("vout", (uint64_t)txin.prevout.n);
+    entry.pushKV("scriptSig", HexStr(txin.scriptSig.begin(), txin.scriptSig.end()));
+    entry.pushKV("sequence", (uint64_t)txin.nSequence);
+    entry.pushKV("error", strMessage);
+    vErrorsRet.push_back(entry);
+}
+
+UniValue signrawtransaction(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() < 1 || params.size() > 5)
+        throw runtime_error(
+            "signrawtransaction \"hexstring\" ( [{\"txid\":\"id\",\"vout\":n,\"scriptPubKey\":\"hex\",\"redeemScript\":\"hex\"},...] [\"privatekey1\",...] sighashtype )\n"
+            "\nSign inputs for raw transaction (serialized, hex-encoded).\n"
+            "The second optional argument (may be null) is an array of previous transaction outputs that\n"
+            "this transaction depends on but may not yet be in the block chain.\n"
+            "The third optional argument (may be null) is an array of base58-encoded private\n"
+            "keys that, if given, will be the only keys used to sign the transaction.\n"
+#ifdef ENABLE_WALLET
+            + HelpRequiringPassphrase() + "\n"
+#endif
+
+            "\nArguments:\n"
+            "1. \"hexstring\"     (string, required) The transaction hex string\n"
+            "2. \"prevtxs\"       (string, optional) An json array of previous dependent transaction outputs\n"
+            "     [               (json array of json objects, or 'null' if none provided)\n"
+            "       {\n"
+            "         \"txid\":\"id\",             (string, required) The transaction id\n"
+            "         \"vout\":n,                  (numeric, required) The output number\n"
+            "         \"scriptPubKey\": \"hex\",   (string, required) script key\n"
+            "         \"redeemScript\": \"hex\",   (string, required for P2SH) redeem script\n"
+            "         \"amount\": value            (numeric, required) The amount spent\n"
+            "       }\n"
+            "       ,...\n"
+            "    ]\n"
+            "3. \"privatekeys\"     (string, optional) A json array of base58-encoded private keys for signing\n"
+            "    [                  (json array of strings, or 'null' if none provided)\n"
+            "      \"privatekey\"   (string) private key in base58-encoding\n"
+            "      ,...\n"
+            "    ]\n"
+            "4. \"sighashtype\"     (string, optional, default=ALL) The signature hash type. Must be one of\n"
+            "       \"ALL\"\n"
+            "       \"NONE\"\n"
+            "       \"SINGLE\"\n"
+            "       \"ALL|ANYONECANPAY\"\n"
+            "       \"NONE|ANYONECANPAY\"\n"
+            "       \"SINGLE|ANYONECANPAY\"\n"
+            "5.  \"branchid\"       (string, optional) The hex representation of the consensus branch id to sign with."
+            " This can be used to force signing with consensus rules that are ahead of the node's current height.\n"
+
+            "\nResult:\n"
+            "{\n"
+            "  \"hex\" : \"value\",           (string) The hex-encoded raw transaction with signature(s)\n"
+            "  \"complete\" : true|false,   (boolean) If the transaction has a complete set of signatures\n"
+            "  \"errors\" : [                 (json array of objects) Script verification errors (if there are any)\n"
+            "    {\n"
+            "      \"txid\" : \"hash\",           (string) The hash of the referenced, previous transaction\n"
+            "      \"vout\" : n,                (numeric) The index of the output to spent and used as input\n"
+            "      \"scriptSig\" : \"hex\",       (string) The hex-encoded signature script\n"
+            "      \"sequence\" : n,            (numeric) Script sequence number\n"
+            "      \"error\" : \"text\"           (string) Verification or signing error related to the input\n"
+            "    }\n"
+            "    ,...\n"
+            "  ]\n"
+            "}\n"
+
+            "\nExamples:\n"
+            + HelpExampleCli("signrawtransaction", "\"myhex\"")
+            + HelpExampleRpc("signrawtransaction", "\"myhex\"")
+        );
+
+#ifdef ENABLE_WALLET
+    LOCK2(cs_main, pwalletMain ? &pwalletMain->cs_wallet : NULL);
+#else
+    LOCK(cs_main);
+#endif
+    RPCTypeCheck(params, boost::assign::list_of(UniValue::VSTR)(UniValue::VARR)(UniValue::VARR)(UniValue::VSTR)(UniValue::VSTR), true);
+
+    vector<unsigned char> txData(ParseHexV(params[0], "argument 1"));
+    CDataStream ssData(txData, SER_NETWORK, PROTOCOL_VERSION);
+    vector<CMutableTransaction> txVariants;
+    while (!ssData.empty()) {
+        try {
+            CMutableTransaction tx;
+            ssData >> tx;
+            txVariants.push_back(tx);
+        }
+        catch (const std::exception&) {
+            throw JSONRPCError(RPC_DESERIALIZATION_ERROR, "TX decode failed");
+        }
+    }
+
+    if (txVariants.empty())
+        throw JSONRPCError(RPC_DESERIALIZATION_ERROR, "Missing transaction");
+
+    // mergedTx will end up with all the signatures; it
+    // starts as a clone of the rawtx:
+    CMutableTransaction mergedTx(txVariants[0]);
+
+    // Fetch previous transactions (inputs):
+    CCoinsView viewDummy;
+    CCoinsViewCache view(&viewDummy);
+    {
+        LOCK(mempool.cs);
+        CCoinsViewCache &viewChain = *pcoinsTip;
+        CCoinsViewMemPool viewMempool(&viewChain, mempool);
+        view.SetBackend(viewMempool); // temporarily switch cache backend to db+mempool view
+
+        for (const CTxIn& txin : mergedTx.vin) {
+            const uint256& prevHash = txin.prevout.hash;
+            CCoins coins;
+            view.AccessCoins(prevHash); // this is certainly allowed to fail
+        }
+
+        view.SetBackend(viewDummy); // switch back to avoid locking mempool for too long
+    }
+
+    KeyIO keyIO(Params());
+
+    bool fGivenKeys = false;
+    CBasicKeyStore tempKeystore;
+    if (params.size() > 2 && !params[2].isNull()) {
+        fGivenKeys = true;
+        UniValue keys = params[2].get_array();
+        for (size_t idx = 0; idx < keys.size(); idx++) {
+            UniValue k = keys[idx];
+            CKey key = keyIO.DecodeSecret(k.get_str());
+            if (!key.IsValid())
+                throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid private key");
+            tempKeystore.AddKey(key);
+        }
+    }
+#ifdef ENABLE_WALLET
+    else if (pwalletMain)
+        EnsureWalletIsUnlocked();
+#endif
+
+    // Add previous txouts given in the RPC call:
+    if (params.size() > 1 && !params[1].isNull()) {
+        UniValue prevTxs = params[1].get_array();
+        for (size_t idx = 0; idx < prevTxs.size(); idx++) {
+            const UniValue& p = prevTxs[idx];
+            if (!p.isObject())
+                throw JSONRPCError(RPC_DESERIALIZATION_ERROR, "expected object with {\"txid'\",\"vout\",\"scriptPubKey\"}");
+
+            UniValue prevOut = p.get_obj();
+
+            RPCTypeCheckObj(prevOut, boost::assign::map_list_of("txid", UniValue::VSTR)("vout", UniValue::VNUM)("scriptPubKey", UniValue::VSTR));
+
+            uint256 txid = ParseHashO(prevOut, "txid");
+
+            int nOut = find_value(prevOut, "vout").get_int();
+            if (nOut < 0)
+                throw JSONRPCError(RPC_DESERIALIZATION_ERROR, "vout must be positive");
+
+            vector<unsigned char> pkData(ParseHexO(prevOut, "scriptPubKey"));
+            CScript scriptPubKey(pkData.begin(), pkData.end());
+
+            {
+                CCoinsModifier coins = view.ModifyCoins(txid);
+                if (coins->IsAvailable(nOut) && coins->vout[nOut].scriptPubKey != scriptPubKey) {
+                    string err("Previous output scriptPubKey mismatch:\n");
+                    err = err + ScriptToAsmStr(coins->vout[nOut].scriptPubKey) + "\nvs:\n"+
+                        ScriptToAsmStr(scriptPubKey);
+                    throw JSONRPCError(RPC_DESERIALIZATION_ERROR, err);
+                }
+                if ((unsigned int)nOut >= coins->vout.size())
+                    coins->vout.resize(nOut+1);
+                coins->vout[nOut].scriptPubKey = scriptPubKey;
+                coins->vout[nOut].nValue = 0;
+                if (prevOut.exists("amount")) {
+                    coins->vout[nOut].nValue = AmountFromValue(find_value(prevOut, "amount"));
+                }
+            }
+
+            // if redeemScript given and not using the local wallet (private keys
+            // given), add redeemScript to the tempKeystore so it can be signed:
+            if (fGivenKeys && scriptPubKey.IsPayToScriptHash()) {
+                RPCTypeCheckObj(prevOut, boost::assign::map_list_of("txid", UniValue::VSTR)("vout", UniValue::VNUM)("scriptPubKey", UniValue::VSTR)("redeemScript",UniValue::VSTR));
+                UniValue v = find_value(prevOut, "redeemScript");
+                if (!v.isNull()) {
+                    vector<unsigned char> rsData(ParseHexV(v, "redeemScript"));
+                    CScript redeemScript(rsData.begin(), rsData.end());
+                    tempKeystore.AddCScript(redeemScript);
+                }
+            }
+        }
+    }
+
+#ifdef ENABLE_WALLET
+    const CKeyStore& keystore = ((fGivenKeys || !pwalletMain) ? tempKeystore : *pwalletMain);
+#else
+    const CKeyStore& keystore = tempKeystore;
+#endif
+
+    int nHashType = SIGHASH_ALL;
+    if (params.size() > 3 && !params[3].isNull()) {
+        static map<string, int> mapSigHashValues =
+            boost::assign::map_list_of
+            (string("ALL"), int(SIGHASH_ALL))
+            (string("ALL|ANYONECANPAY"), int(SIGHASH_ALL|SIGHASH_ANYONECANPAY))
+            (string("NONE"), int(SIGHASH_NONE))
+            (string("NONE|ANYONECANPAY"), int(SIGHASH_NONE|SIGHASH_ANYONECANPAY))
+            (string("SINGLE"), int(SIGHASH_SINGLE))
+            (string("SINGLE|ANYONECANPAY"), int(SIGHASH_SINGLE|SIGHASH_ANYONECANPAY))
+            ;
+        string strHashType = params[3].get_str();
+        if (mapSigHashValues.count(strHashType))
+            nHashType = mapSigHashValues[strHashType];
+        else
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid sighash param");
+    }
+
+    bool fHashSingle = ((nHashType & ~SIGHASH_ANYONECANPAY) == SIGHASH_SINGLE);
+    // Use the approximate release height if it is greater so offline nodes
+    // have a better estimation of the current height and will be more likely to
+    // determine the correct consensus branch ID.  Regtest mode ignores release height.
+    int chainHeight = chainActive.Height() + 1;
+    if (Params().NetworkIDString() != "regtest") {
+        chainHeight = std::max(chainHeight, APPROX_RELEASE_HEIGHT);
+    }
+    // Grab the current consensus branch ID
+    auto consensusBranchId = CurrentEpochBranchId(chainHeight, Params().GetConsensus());
+
+    if (params.size() > 4 && !params[4].isNull()) {
+        consensusBranchId = ParseHexToUInt32(params[4].get_str());
+        if (!IsConsensusBranchId(consensusBranchId)) {
+            throw runtime_error(params[4].get_str() + " is not a valid consensus branch id");
+        }
+    }
+
+    std::vector<CTxOut> allPrevOutputs;
+    // We do not need to know the inputs for pre-v5 transactions.
+    // We can't sign v5+ transactions without knowing all inputs.
+    if (mergedTx.nVersion >= ZIP225_TX_VERSION) {
+        if (!view.HaveInputs(mergedTx)) {
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Cannot sign v5 transactions without knowing all inputs");
+        }
+        for (const auto& input : mergedTx.vin) {
+            allPrevOutputs.push_back(view.GetOutputFor(input));
+        }
+    }
+
+    // Script verification errors
+    UniValue vErrors(UniValue::VARR);
+
+    // Use CTransaction for the constant parts of the
+    // transaction to avoid rehashing.
+    const CTransaction txConst(mergedTx);
+    const PrecomputedTransactionData txdata(txConst, allPrevOutputs);
+    // Sign what we can:
+    for (unsigned int i = 0; i < mergedTx.vin.size(); i++) {
+        CTxIn& txin = mergedTx.vin[i];
+        const CCoins* coins = view.AccessCoins(txin.prevout.hash);
+        if (coins == NULL || !coins->IsAvailable(txin.prevout.n)) {
+            TxInErrorToJSON(txin, vErrors, "Input not found or already spent");
+            continue;
+        }
+        const CScript& prevPubKey = coins->vout[txin.prevout.n].scriptPubKey;
+        const CAmount& amount = coins->vout[txin.prevout.n].nValue;
+
+        SignatureData sigdata;
+        // Only sign SIGHASH_SINGLE if there's a corresponding output:
+        if (!fHashSingle || (i < mergedTx.vout.size()))
+            ProduceSignature(MutableTransactionSignatureCreator(&keystore, &mergedTx, txdata, i, amount, nHashType), prevPubKey, sigdata, consensusBranchId);
+
+        // ... and merge in other signatures:
+        for (const CMutableTransaction& txv : txVariants) {
+            sigdata = CombineSignatures(prevPubKey, TransactionSignatureChecker(&txConst, txdata, i, amount), sigdata, DataFromTransaction(txv, i), consensusBranchId);
+        }
+
+        UpdateTransaction(mergedTx, i, sigdata);
+
+        ScriptError serror = SCRIPT_ERR_OK;
+        if (!VerifyScript(txin.scriptSig, prevPubKey, STANDARD_SCRIPT_VERIFY_FLAGS, TransactionSignatureChecker(&txConst, txdata, i, amount), consensusBranchId, &serror)) {
+            TxInErrorToJSON(txin, vErrors, ScriptErrorString(serror));
+        }
+    }
+    bool fComplete = vErrors.empty();
+
+    UniValue result(UniValue::VOBJ);
+    result.pushKV("hex", EncodeHexTx(mergedTx));
+    result.pushKV("complete", fComplete);
+    if (!vErrors.empty()) {
+        result.pushKV("errors", vErrors);
+    }
+
+    return result;
+}
+
+UniValue sendrawtransaction(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() < 1 || params.size() > 2)
+        throw runtime_error(
+            "sendrawtransaction \"hexstring\" ( allowhighfees )\n"
+            "\nSubmits raw transaction (serialized, hex-encoded) to local node and network.\n"
+            "\nAlso see createrawtransaction and signrawtransaction calls.\n"
+            "\nArguments:\n"
+            "1. \"hexstring\"    (string, required) The hex string of the raw transaction)\n"
+            "2. allowhighfees    (boolean, optional, default=false) Allow high fees\n"
+            "\nResult:\n"
+            "\"hex\"             (string) The transaction hash in hex\n"
+            "\nExamples:\n"
+            "\nCreate a transaction\n"
+            + HelpExampleCli("createrawtransaction", "\"[{\\\"txid\\\" : \\\"mytxid\\\",\\\"vout\\\":0}]\" \"{\\\"myaddress\\\":0.01}\"") +
+            "Sign the transaction, and get back the hex\n"
+            + HelpExampleCli("signrawtransaction", "\"myhex\"") +
+            "\nSend the transaction (signed hex)\n"
+            + HelpExampleCli("sendrawtransaction", "\"signedhex\"") +
+            "\nAs a json rpc call\n"
+            + HelpExampleRpc("sendrawtransaction", "\"signedhex\"")
+        );
+
+    LOCK(cs_main);
+    RPCTypeCheck(params, boost::assign::list_of(UniValue::VSTR)(UniValue::VBOOL));
+
+    // parse hex string from parameter
+    CTransaction tx;
+    if (!DecodeHexTx(tx, params[0].get_str()))
+        throw JSONRPCError(RPC_DESERIALIZATION_ERROR, "TX decode failed");
+    uint256 hashTx = tx.GetHash();
+
+    auto chainparams = Params();
+
+    // DoS mitigation: reject transactions expiring soon
+    if (tx.nExpiryHeight > 0) {
+        int nextBlockHeight = chainActive.Height() + 1;
+        if (chainparams.GetConsensus().NetworkUpgradeActive(nextBlockHeight, Consensus::UPGRADE_OVERWINTER)) {
+            if (nextBlockHeight + TX_EXPIRING_SOON_THRESHOLD > tx.nExpiryHeight) {
+                throw JSONRPCError(RPC_TRANSACTION_REJECTED,
+                    strprintf("tx-expiring-soon: expiryheight is %d but should be at least %d to avoid transaction expiring soon",
+                    tx.nExpiryHeight,
+                    nextBlockHeight + TX_EXPIRING_SOON_THRESHOLD));
+            }
+        }
+    }
+
+    bool fOverrideFees = false;
+    if (params.size() > 1)
+        fOverrideFees = params[1].get_bool();
+
+    CCoinsViewCache &view = *pcoinsTip;
+    const CCoins* existingCoins = view.AccessCoins(hashTx);
+    bool fHaveMempool = mempool.exists(hashTx);
+    bool fHaveChain = existingCoins && existingCoins->nHeight < 1000000000;
+    if (!fHaveMempool && !fHaveChain) {
+        // push to local node and sync with wallets
+        CValidationState state;
+        bool fMissingInputs;
+        if (!AcceptToMemoryPool(chainparams, mempool, state, tx, false, &fMissingInputs, !fOverrideFees)) {
+            if (state.IsInvalid()) {
+                throw JSONRPCError(RPC_TRANSACTION_REJECTED, strprintf("%i: %s", state.GetRejectCode(), state.GetRejectReason()));
+            } else {
+                if (fMissingInputs) {
+                    throw JSONRPCError(RPC_TRANSACTION_ERROR, "Missing inputs");
+                }
+                throw JSONRPCError(RPC_TRANSACTION_ERROR, state.GetRejectReason());
+            }
+        }
+    } else if (fHaveChain) {
+        throw JSONRPCError(RPC_TRANSACTION_ALREADY_IN_CHAIN, "transaction already in block chain");
+    }
+    RelayTransaction(tx);
+
+    return hashTx.GetHex();
+}
+
+static const CRPCCommand commands[] =
+{ //  category              name                      actor (function)         okSafeMode
+  //  --------------------- ------------------------  -----------------------  ----------
+    { "rawtransactions",    "getrawtransaction",      &getrawtransaction,      true  },
+    { "rawtransactions",    "createrawtransaction",   &createrawtransaction,   true  },
+    { "rawtransactions",    "decoderawtransaction",   &decoderawtransaction,   true  },
+    { "rawtransactions",    "decodescript",           &decodescript,           true  },
+    { "rawtransactions",    "sendrawtransaction",     &sendrawtransaction,     false },
+    { "rawtransactions",    "signrawtransaction",     &signrawtransaction,     false }, /* uses wallet if enabled */
+
+    { "blockchain",         "gettxoutproof",          &gettxoutproof,          true  },
+    { "blockchain",         "verifytxoutproof",       &verifytxoutproof,       true  },
+};
+
+void RegisterRawTransactionRPCCommands(CRPCTable &tableRPC)
+{
+    for (unsigned int vcidx = 0; vcidx < ARRAYLEN(commands); vcidx++)
+        tableRPC.appendCommand(commands[vcidx].name, &commands[vcidx]);
+}
diff --git a/depend/zcash/src/rpc/register.h b/depend/zcash/src/rpc/register.h
new file mode 100644
index 000000000..29a971034
--- /dev/null
+++ b/depend/zcash/src/rpc/register.h
@@ -0,0 +1,32 @@
+// Copyright (c) 2009-2016 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_RPC_REGISTER_H
+#define BITCOIN_RPC_REGISTER_H
+
+/** These are in one header file to avoid creating tons of single-function
+ * headers for everything under src/rpc/ */
+class CRPCTable;
+
+/** Register block chain RPC commands */
+void RegisterBlockchainRPCCommands(CRPCTable &tableRPC);
+/** Register P2P networking RPC commands */
+void RegisterNetRPCCommands(CRPCTable &tableRPC);
+/** Register miscellaneous RPC commands */
+void RegisterMiscRPCCommands(CRPCTable &tableRPC);
+/** Register mining RPC commands */
+void RegisterMiningRPCCommands(CRPCTable &tableRPC);
+/** Register raw transaction RPC commands */
+void RegisterRawTransactionRPCCommands(CRPCTable &tableRPC);
+
+static inline void RegisterAllCoreRPCCommands(CRPCTable &tableRPC)
+{
+    RegisterBlockchainRPCCommands(tableRPC);
+    RegisterNetRPCCommands(tableRPC);
+    RegisterMiscRPCCommands(tableRPC);
+    RegisterMiningRPCCommands(tableRPC);
+    RegisterRawTransactionRPCCommands(tableRPC);
+}
+
+#endif // BITCOIN_RPC_REGISTER_H
diff --git a/depend/zcash/src/rpc/server.cpp b/depend/zcash/src/rpc/server.cpp
new file mode 100644
index 000000000..556dc6ed3
--- /dev/null
+++ b/depend/zcash/src/rpc/server.cpp
@@ -0,0 +1,580 @@
+// Copyright (c) 2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "rpc/server.h"
+
+#include "fs.h"
+#include "init.h"
+#include "key_io.h"
+#include "random.h"
+#include "sync.h"
+#include "ui_interface.h"
+#include "util.h"
+#include "utilstrencodings.h"
+#include "asyncrpcqueue.h"
+
+#include <memory>
+
+#include <univalue.h>
+
+#include <boost/bind/bind.hpp>
+#include <boost/iostreams/concepts.hpp>
+#include <boost/iostreams/stream.hpp>
+#include <boost/shared_ptr.hpp>
+#include <boost/signals2/signal.hpp>
+#include <boost/thread.hpp>
+#include <boost/algorithm/string/case_conv.hpp> // for to_upper()
+
+#include <tracing.h>
+
+using namespace RPCServer;
+using namespace std;
+using namespace boost::placeholders;
+
+static bool fRPCRunning = false;
+static bool fRPCInWarmup = true;
+static std::string rpcWarmupStatus("RPC server started");
+static CCriticalSection cs_rpcWarmup;
+/* Timer-creating functions */
+static std::vector<RPCTimerInterface*> timerInterfaces;
+/* Map of name to timer.
+ * @note Can be changed to std::unique_ptr when C++11 */
+static std::map<std::string, boost::shared_ptr<RPCTimerBase> > deadlineTimers;
+
+static struct CRPCSignals
+{
+    boost::signals2::signal<void ()> Started;
+    boost::signals2::signal<void ()> Stopped;
+    boost::signals2::signal<void (const CRPCCommand&)> PreCommand;
+    boost::signals2::signal<void (const CRPCCommand&)> PostCommand;
+} g_rpcSignals;
+
+void RPCServer::OnStarted(std::function<void ()> slot)
+{
+    g_rpcSignals.Started.connect(slot);
+}
+
+void RPCServer::OnStopped(std::function<void ()> slot)
+{
+    g_rpcSignals.Stopped.connect(slot);
+}
+
+void RPCServer::OnPreCommand(std::function<void (const CRPCCommand&)> slot)
+{
+    g_rpcSignals.PreCommand.connect(boost::bind(slot, _1));
+}
+
+void RPCServer::OnPostCommand(std::function<void (const CRPCCommand&)> slot)
+{
+    g_rpcSignals.PostCommand.connect(boost::bind(slot, _1));
+}
+
+void RPCTypeCheck(const UniValue& params,
+                  const list<UniValue::VType>& typesExpected,
+                  bool fAllowNull)
+{
+    size_t i = 0;
+    for (UniValue::VType t : typesExpected)
+    {
+        if (params.size() <= i)
+            break;
+
+        const UniValue& v = params[i];
+        if (!((v.type() == t) || (fAllowNull && (v.isNull()))))
+        {
+            string err = strprintf("Expected type %s, got %s",
+                                   uvTypeName(t), uvTypeName(v.type()));
+            throw JSONRPCError(RPC_TYPE_ERROR, err);
+        }
+        i++;
+    }
+}
+
+void RPCTypeCheckObj(const UniValue& o,
+                  const map<string, UniValue::VType>& typesExpected,
+                  bool fAllowNull)
+{
+    for (const std::pair<string, UniValue::VType>& t : typesExpected)
+    {
+        const UniValue& v = find_value(o, t.first);
+        if (!fAllowNull && v.isNull())
+            throw JSONRPCError(RPC_TYPE_ERROR, strprintf("Missing %s", t.first));
+
+        if (!((v.type() == t.second) || (fAllowNull && (v.isNull()))))
+        {
+            string err = strprintf("Expected type %s for %s, got %s",
+                                   uvTypeName(t.second), t.first, uvTypeName(v.type()));
+            throw JSONRPCError(RPC_TYPE_ERROR, err);
+        }
+    }
+}
+
+CAmount AmountFromValue(const UniValue& value)
+{
+    if (!value.isNum() && !value.isStr())
+        throw JSONRPCError(RPC_TYPE_ERROR, "Amount is not a number or string");
+    CAmount amount;
+    if (!ParseFixedPoint(value.getValStr(), 8, &amount))
+        throw JSONRPCError(RPC_TYPE_ERROR, "Invalid amount");
+    if (!MoneyRange(amount))
+        throw JSONRPCError(RPC_TYPE_ERROR, "Amount out of range");
+    return amount;
+}
+
+UniValue ValueFromAmount(const CAmount& amount)
+{
+    bool sign = amount < 0;
+    int64_t n_abs = (sign ? -amount : amount);
+    int64_t quotient = n_abs / COIN;
+    int64_t remainder = n_abs % COIN;
+    return UniValue(UniValue::VNUM,
+            strprintf("%s%d.%08d", sign ? "-" : "", quotient, remainder));
+}
+
+uint256 ParseHashV(const UniValue& v, string strName)
+{
+    string strHex;
+    if (v.isStr())
+        strHex = v.get_str();
+    if (!IsHex(strHex)) // Note: IsHex("") is false
+        throw JSONRPCError(RPC_INVALID_PARAMETER, strName+" must be hexadecimal string (not '"+strHex+"')");
+    uint256 result;
+    result.SetHex(strHex);
+    return result;
+}
+uint256 ParseHashO(const UniValue& o, string strKey)
+{
+    return ParseHashV(find_value(o, strKey), strKey);
+}
+vector<unsigned char> ParseHexV(const UniValue& v, string strName)
+{
+    string strHex;
+    if (v.isStr())
+        strHex = v.get_str();
+    if (!IsHex(strHex))
+        throw JSONRPCError(RPC_INVALID_PARAMETER, strName+" must be hexadecimal string (not '"+strHex+"')");
+    return ParseHex(strHex);
+}
+vector<unsigned char> ParseHexO(const UniValue& o, string strKey)
+{
+    return ParseHexV(find_value(o, strKey), strKey);
+}
+
+/**
+ * Note: This interface may still be subject to change.
+ */
+
+std::string CRPCTable::help(const std::string& strCommand) const
+{
+    string strRet;
+    string category;
+    set<rpcfn_type> setDone;
+    vector<pair<string, const CRPCCommand*> > vCommands;
+
+    for (map<string, const CRPCCommand*>::const_iterator mi = mapCommands.begin(); mi != mapCommands.end(); ++mi)
+        vCommands.push_back(make_pair(mi->second->category + mi->first, mi->second));
+    sort(vCommands.begin(), vCommands.end());
+
+    for (const std::pair<string, const CRPCCommand*>& command : vCommands)
+    {
+        const CRPCCommand *pcmd = command.second;
+        string strMethod = pcmd->name;
+        // We already filter duplicates, but these deprecated screw up the sort order
+        if (strMethod.find("label") != string::npos)
+            continue;
+        if ((strCommand != "" || pcmd->category == "hidden") && strMethod != strCommand)
+            continue;
+        try
+        {
+            UniValue params;
+            rpcfn_type pfn = pcmd->actor;
+            if (setDone.insert(pfn).second)
+                (*pfn)(params, true);
+        }
+        catch (const std::exception& e)
+        {
+            // Help text is returned in an exception
+            string strHelp = string(e.what());
+            if (strCommand == "")
+            {
+                if (strHelp.find('\n') != string::npos)
+                    strHelp = strHelp.substr(0, strHelp.find('\n'));
+
+                if (category != pcmd->category)
+                {
+                    if (!category.empty())
+                        strRet += "\n";
+                    category = pcmd->category;
+                    string firstLetter = category.substr(0,1);
+                    boost::to_upper(firstLetter);
+                    strRet += "== " + firstLetter + category.substr(1) + " ==\n";
+                }
+            }
+            strRet += strHelp + "\n";
+        }
+    }
+    if (strRet == "")
+        strRet = strprintf("help: unknown command: %s\n", strCommand);
+    strRet = strRet.substr(0,strRet.size()-1);
+    return strRet;
+}
+
+UniValue help(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() > 1)
+        throw runtime_error(
+            "help ( \"command\" )\n"
+            "\nList all commands, or get help for a specified command.\n"
+            "\nArguments:\n"
+            "1. \"command\"     (string, optional) The command to get help on\n"
+            "\nResult:\n"
+            "\"text\"     (string) The help text\n"
+        );
+
+    string strCommand;
+    if (params.size() > 0)
+        strCommand = params[0].get_str();
+
+    return tableRPC.help(strCommand);
+}
+
+
+UniValue setlogfilter(const UniValue& params, bool fHelp)
+{
+    if (fHelp || params.size() > 1) {
+        throw runtime_error(
+            "setlogfilter \"directives\"\n"
+            "\nSets the filter to be used for selecting events to log.\n"
+            "\nA filter is a comma-separated list of directives.\n"
+            "The syntax for each directive is:\n"
+            "\n    target[span{field=value}]=level\n"
+            "\nThe default filter, derived from the -debug=target flags, is:\n"
+            + strprintf("\n    %s", LogConfigFilter()) + "\n"
+            "\nPassing a valid filter here will replace the existing filter.\n"
+            "Passing an empty string will reset the filter to the default.\n"
+            "\nNote that enabling trace-level events should always be considered\n"
+            "unsafe, as they can result in sensitive information like decrypted\n"
+            "notes and private keys being printed to the log output.\n"
+            "\nArguments:\n"
+            "1. newFilterDirectives (string, required) The new log filter.\n"
+            "\nExamples:\n"
+            + HelpExampleCli("setlogfilter", "\"main=info,rpc=info\"")
+            + HelpExampleRpc("setlogfilter", "\"main=info,rpc=info\"")
+        );
+    }
+
+    auto newFilter = params[0].getValStr();
+    if (newFilter.empty()) {
+        newFilter = LogConfigFilter();
+    }
+
+    if (pTracingHandle) {
+        TracingInfo("main", "Reloading log filter", "new_filter", newFilter.c_str());
+
+        if (!tracing_reload(pTracingHandle, newFilter.c_str())) {
+            throw JSONRPCError(RPC_INTERNAL_ERROR, "Filter reload failed; check logs");
+        }
+    }
+
+    return NullUniValue;
+}
+
+
+UniValue stop(const UniValue& params, bool fHelp)
+{
+    // Accept the deprecated and ignored 'detach' boolean argument
+    if (fHelp || params.size() > 1)
+        throw runtime_error(
+            "stop\n"
+            "\nStop Zcash server.");
+    // Event loop will exit after current HTTP requests have been handled, so
+    // this reply will get back to the client.
+    StartShutdown();
+    return "Zcash server stopping";
+}
+
+/**
+ * Call Table
+ */
+static const CRPCCommand vRPCCommands[] =
+{ //  category              name                      actor (function)         okSafeMode
+  //  --------------------- ------------------------  -----------------------  ----------
+    /* Overall control/query calls */
+    { "control",            "help",                   &help,                   true  },
+    { "control",            "setlogfilter",           &setlogfilter,           true  },
+    { "control",            "stop",                   &stop,                   true  },
+};
+
+CRPCTable::CRPCTable()
+{
+    unsigned int vcidx;
+    for (vcidx = 0; vcidx < (sizeof(vRPCCommands) / sizeof(vRPCCommands[0])); vcidx++)
+    {
+        const CRPCCommand *pcmd;
+
+        pcmd = &vRPCCommands[vcidx];
+        mapCommands[pcmd->name] = pcmd;
+    }
+}
+
+const CRPCCommand *CRPCTable::operator[](const std::string &name) const
+{
+    map<string, const CRPCCommand*>::const_iterator it = mapCommands.find(name);
+    if (it == mapCommands.end())
+        return NULL;
+    return (*it).second;
+}
+
+bool CRPCTable::appendCommand(const std::string& name, const CRPCCommand* pcmd)
+{
+    if (IsRPCRunning())
+        return false;
+
+    // don't allow overwriting for now
+    map<string, const CRPCCommand*>::const_iterator it = mapCommands.find(name);
+    if (it != mapCommands.end())
+        return false;
+
+    mapCommands[name] = pcmd;
+    return true;
+}
+
+bool StartRPC()
+{
+    LogPrint("rpc", "Starting RPC\n");
+    fRPCRunning = true;
+    g_rpcSignals.Started();
+
+    // Launch one async rpc worker.  The ability to launch multiple workers is not recommended at present and thus the option is disabled.
+    getAsyncRPCQueue()->addWorker();
+/*
+    int n = GetArg("-rpcasyncthreads", 1);
+    if (n<1) {
+        LogPrintf("ERROR: Invalid value %d for -rpcasyncthreads.  Must be at least 1.\n", n);
+        strerr = strprintf(_("An error occurred while setting up the Async RPC threads, invalid parameter value of %d (must be at least 1)."), n);
+        uiInterface.ThreadSafeMessageBox(strerr, "", CClientUIInterface::MSG_ERROR);
+        StartShutdown();
+        return;
+    }
+    for (int i = 0; i < n; i++)
+        getAsyncRPCQueue()->addWorker();
+*/
+    return true;
+}
+
+void InterruptRPC()
+{
+    LogPrint("rpc", "Interrupting RPC\n");
+    // Interrupt e.g. running longpolls
+    fRPCRunning = false;
+}
+
+void StopRPC()
+{
+    LogPrint("rpc", "Stopping RPC\n");
+    deadlineTimers.clear();
+    g_rpcSignals.Stopped();
+
+    // Tells async queue to cancel all operations and shutdown.
+    LogPrintf("%s: waiting for async rpc workers to stop\n", __func__);
+    getAsyncRPCQueue()->closeAndWait();
+}
+
+bool IsRPCRunning()
+{
+    return fRPCRunning;
+}
+
+void SetRPCWarmupStatus(const std::string& newStatus)
+{
+    LOCK(cs_rpcWarmup);
+    rpcWarmupStatus = newStatus;
+}
+
+void SetRPCWarmupFinished()
+{
+    LOCK(cs_rpcWarmup);
+    assert(fRPCInWarmup);
+    fRPCInWarmup = false;
+}
+
+bool RPCIsInWarmup(std::string *outStatus)
+{
+    LOCK(cs_rpcWarmup);
+    if (outStatus)
+        *outStatus = rpcWarmupStatus;
+    return fRPCInWarmup;
+}
+
+void JSONRequest::parse(const UniValue& valRequest)
+{
+    // Parse request
+    if (!valRequest.isObject())
+        throw JSONRPCError(RPC_INVALID_REQUEST, "Invalid Request object");
+    const UniValue& request = valRequest.get_obj();
+
+    // Parse id now so errors from here on will have the id
+    id = find_value(request, "id");
+
+    // Parse method
+    UniValue valMethod = find_value(request, "method");
+    if (valMethod.isNull())
+        throw JSONRPCError(RPC_INVALID_REQUEST, "Missing method");
+    if (!valMethod.isStr())
+        throw JSONRPCError(RPC_INVALID_REQUEST, "Method must be a string");
+    strMethod = valMethod.get_str();
+    LogPrint("rpc", "ThreadRPCServer method=%s\n", SanitizeString(strMethod));
+
+    // Parse params
+    UniValue valParams = find_value(request, "params");
+    if (valParams.isArray())
+        params = valParams.get_array();
+    else if (valParams.isNull())
+        params = UniValue(UniValue::VARR);
+    else
+        throw JSONRPCError(RPC_INVALID_REQUEST, "Params must be an array");
+}
+
+static UniValue JSONRPCExecOne(const UniValue& req)
+{
+    UniValue rpc_result(UniValue::VOBJ);
+
+    JSONRequest jreq;
+    try {
+        jreq.parse(req);
+
+        UniValue result = tableRPC.execute(jreq.strMethod, jreq.params);
+        rpc_result = JSONRPCReplyObj(result, NullUniValue, jreq.id);
+    }
+    catch (const UniValue& objError)
+    {
+        rpc_result = JSONRPCReplyObj(NullUniValue, objError, jreq.id);
+    }
+    catch (const std::exception& e)
+    {
+        rpc_result = JSONRPCReplyObj(NullUniValue,
+                                     JSONRPCError(RPC_PARSE_ERROR, e.what()), jreq.id);
+    }
+
+    return rpc_result;
+}
+
+std::string JSONRPCExecBatch(const UniValue& vReq)
+{
+    UniValue ret(UniValue::VARR);
+    for (size_t reqIdx = 0; reqIdx < vReq.size(); reqIdx++)
+        ret.push_back(JSONRPCExecOne(vReq[reqIdx]));
+
+    return ret.write() + "\n";
+}
+
+UniValue CRPCTable::execute(const std::string &strMethod, const UniValue &params) const
+{
+    // Return immediately if in warmup
+    {
+        LOCK(cs_rpcWarmup);
+        if (fRPCInWarmup)
+            throw JSONRPCError(RPC_IN_WARMUP, rpcWarmupStatus);
+    }
+
+    // Find method
+    const CRPCCommand *pcmd = tableRPC[strMethod];
+    if (!pcmd)
+        throw JSONRPCError(RPC_METHOD_NOT_FOUND, "Method not found");
+
+    g_rpcSignals.PreCommand(*pcmd);
+
+    try
+    {
+        // Execute
+        return pcmd->actor(params, false);
+    }
+    catch (const std::exception& e)
+    {
+        throw JSONRPCError(RPC_MISC_ERROR, e.what());
+    }
+
+    g_rpcSignals.PostCommand(*pcmd);
+}
+
+std::vector<std::string> CRPCTable::listCommands() const
+{
+    std::vector<std::string> commandList;
+    typedef std::map<std::string, const CRPCCommand*> commandMap;
+
+    std::transform( mapCommands.begin(), mapCommands.end(),
+                   std::back_inserter(commandList),
+                   boost::bind(&commandMap::value_type::first,_1) );
+    return commandList;
+}
+
+std::string HelpExampleCli(const std::string& methodname, const std::string& args)
+{
+    return "> zcash-cli " + methodname + " " + args + "\n";
+}
+
+std::string HelpExampleRpc(const std::string& methodname, const std::string& args)
+{
+    return "> curl --user myusername --data-binary '{\"jsonrpc\": \"1.0\", \"id\":\"curltest\", "
+        "\"method\": \"" + methodname + "\", \"params\": [" + args + "] }' -H 'content-type: text/plain;' http://127.0.0.1:8232/\n";
+}
+
+std::string experimentalDisabledHelpMsg(const std::string& rpc, const std::vector<string>& enableArgs)
+{
+    std::string cmd, config = "";
+    const auto size = enableArgs.size();
+    assert(size > 0);
+
+    for (size_t i = 0; i < size; ++i)
+    {
+        if (size == 1 || i == 0)
+        {
+            cmd += "-experimentalfeatures and -" + enableArgs.at(i);
+            config += "experimentalfeatures=1\n";
+            config += enableArgs.at(i) + "=1\n";
+        }
+        else {
+            cmd += " or:\n-experimentalfeatures and -" + enableArgs.at(i);
+            config += "\nor:\n\n";
+            config += "experimentalfeatures=1\n";
+            config += enableArgs.at(i) + "=1\n";
+        }
+    }
+    return "\nWARNING: " + rpc + " is disabled.\n" +
+        "To enable it, restart zcashd with the following command line options:\n"
+        + cmd + "\n\n" +
+        "Alternatively add these two lines to the zcash.conf file:\n\n"
+        + config;
+}
+
+void RPCRegisterTimerInterface(RPCTimerInterface *iface)
+{
+    timerInterfaces.push_back(iface);
+}
+
+void RPCUnregisterTimerInterface(RPCTimerInterface *iface)
+{
+    std::vector<RPCTimerInterface*>::iterator i = std::find(timerInterfaces.begin(), timerInterfaces.end(), iface);
+    assert(i != timerInterfaces.end());
+    timerInterfaces.erase(i);
+}
+
+void RPCRunLater(const std::string& name, std::function<void(void)> func, int64_t nSeconds)
+{
+    if (timerInterfaces.empty())
+        throw JSONRPCError(RPC_INTERNAL_ERROR, "No timer handler registered for RPC");
+    deadlineTimers.erase(name);
+    RPCTimerInterface* timerInterface = timerInterfaces[0];
+    LogPrint("rpc", "queue run of timer %s in %i seconds (using %s)\n", name, nSeconds, timerInterface->Name());
+    deadlineTimers.insert(std::make_pair(name, boost::shared_ptr<RPCTimerBase>(timerInterface->NewTimer(func, nSeconds*1000))));
+}
+
+CRPCTable tableRPC;
+
+// Return async rpc queue
+std::shared_ptr<AsyncRPCQueue> getAsyncRPCQueue()
+{
+    return AsyncRPCQueue::sharedInstance();
+}
diff --git a/depend/zcash/src/rpc/server.h b/depend/zcash/src/rpc/server.h
new file mode 100644
index 000000000..230f330ac
--- /dev/null
+++ b/depend/zcash/src/rpc/server.h
@@ -0,0 +1,197 @@
+// Copyright (c) 2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_RPC_SERVER_H
+#define BITCOIN_RPC_SERVER_H
+
+#include "amount.h"
+#include "rpc/protocol.h"
+#include "uint256.h"
+
+#include <list>
+#include <map>
+#include <stdint.h>
+#include <string>
+#include <memory>
+
+#include <univalue.h>
+
+class AsyncRPCQueue;
+class CRPCCommand;
+
+namespace RPCServer
+{
+    void OnStarted(std::function<void ()> slot);
+    void OnStopped(std::function<void ()> slot);
+    void OnPreCommand(std::function<void (const CRPCCommand&)> slot);
+    void OnPostCommand(std::function<void (const CRPCCommand&)> slot);
+}
+
+class CBlockIndex;
+class CNetAddr;
+
+class JSONRequest
+{
+public:
+    UniValue id;
+    std::string strMethod;
+    UniValue params;
+
+    JSONRequest() { id = NullUniValue; }
+    void parse(const UniValue& valRequest);
+};
+
+/** Query whether RPC is running */
+bool IsRPCRunning();
+
+/** Get the async queue*/
+std::shared_ptr<AsyncRPCQueue> getAsyncRPCQueue();
+
+
+/**
+ * Set the RPC warmup status.  When this is done, all RPC calls will error out
+ * immediately with RPC_IN_WARMUP.
+ */
+void SetRPCWarmupStatus(const std::string& newStatus);
+/* Mark warmup as done.  RPC calls will be processed from now on.  */
+void SetRPCWarmupFinished();
+
+/* returns the current warmup state.  */
+bool RPCIsInWarmup(std::string *statusOut);
+
+/**
+ * Type-check arguments; throws JSONRPCError if wrong type given. Does not check that
+ * the right number of arguments are passed, just that any passed are the correct type.
+ * Use like:  RPCTypeCheck(params, boost::assign::list_of(str_type)(int_type)(obj_type));
+ */
+void RPCTypeCheck(const UniValue& params,
+                  const std::list<UniValue::VType>& typesExpected, bool fAllowNull=false);
+
+/*
+  Check for expected keys/value types in an Object.
+  Use like: RPCTypeCheckObj(object, boost::assign::map_list_of("name", str_type)("value", int_type));
+*/
+void RPCTypeCheckObj(const UniValue& o,
+                  const std::map<std::string, UniValue::VType>& typesExpected, bool fAllowNull=false);
+
+/** Opaque base class for timers returned by NewTimerFunc.
+ * This provides no methods at the moment, but makes sure that delete
+ * cleans up the whole state.
+ */
+class RPCTimerBase
+{
+public:
+    virtual ~RPCTimerBase() {}
+};
+
+/**
+ * RPC timer "driver".
+ */
+class RPCTimerInterface
+{
+public:
+    virtual ~RPCTimerInterface() {}
+    /** Implementation name */
+    virtual const char *Name() = 0;
+    /** Factory function for timers.
+     * RPC will call the function to create a timer that will call func in *millis* milliseconds.
+     * @note As the RPC mechanism is backend-neutral, it can use different implementations of timers.
+     * This is needed to cope with the case in which there is no HTTP server, but
+     * only GUI RPC console, and to break the dependency of rpcserver on httprpc.
+     */
+    virtual RPCTimerBase* NewTimer(std::function<void(void)>& func, int64_t millis) = 0;
+};
+
+/** Register factory function for timers */
+void RPCRegisterTimerInterface(RPCTimerInterface *iface);
+/** Unregister factory function for timers */
+void RPCUnregisterTimerInterface(RPCTimerInterface *iface);
+
+/**
+ * Run func nSeconds from now.
+ * Overrides previous timer <name> (if any).
+ */
+void RPCRunLater(const std::string& name, std::function<void(void)> func, int64_t nSeconds);
+
+typedef UniValue(*rpcfn_type)(const UniValue& params, bool fHelp);
+
+class CRPCCommand
+{
+public:
+    std::string category;
+    std::string name;
+    rpcfn_type actor;
+    bool okSafeMode;
+};
+
+/**
+ * Bitcoin RPC command dispatcher.
+ */
+class CRPCTable
+{
+private:
+    std::map<std::string, const CRPCCommand*> mapCommands;
+public:
+    CRPCTable();
+    const CRPCCommand* operator[](const std::string& name) const;
+    std::string help(const std::string& name) const;
+
+    /**
+     * Execute a method.
+     * @param method   Method to execute
+     * @param params   UniValue Array of arguments (JSON objects)
+     * @returns Result of the call.
+     * @throws an exception (UniValue) when an error happens.
+     */
+    UniValue execute(const std::string &method, const UniValue &params) const;
+
+    /**
+    * Returns a list of registered commands
+    * @returns List of registered commands.
+    */
+    std::vector<std::string> listCommands() const;
+
+
+    /**
+     * Appends a CRPCCommand to the dispatch table.
+     * Returns false if RPC server is already running (dump concurrency protection).
+     * Commands cannot be overwritten (returns false).
+     */
+    bool appendCommand(const std::string& name, const CRPCCommand* pcmd);
+};
+
+extern CRPCTable tableRPC;
+
+/**
+ * Utilities: convert hex-encoded Values
+ * (throws error if not hex).
+ */
+extern uint256 ParseHashV(const UniValue& v, std::string strName);
+extern uint256 ParseHashO(const UniValue& o, std::string strKey);
+extern std::vector<unsigned char> ParseHexV(const UniValue& v, std::string strName);
+extern std::vector<unsigned char> ParseHexO(const UniValue& o, std::string strKey);
+
+extern int64_t nWalletUnlockTime;
+extern CAmount AmountFromValue(const UniValue& value);
+extern UniValue ValueFromAmount(const CAmount& amount);
+extern double GetDifficulty(const CBlockIndex* blockindex = NULL);
+extern double GetNetworkDifficulty(const CBlockIndex* blockindex = NULL);
+extern std::string HelpRequiringPassphrase();
+extern std::string HelpExampleCli(const std::string& methodname, const std::string& args);
+extern std::string HelpExampleRpc(const std::string& methodname, const std::string& args);
+
+extern void EnsureWalletIsUnlocked();
+
+bool StartRPC();
+void InterruptRPC();
+void StopRPC();
+std::string JSONRPCExecBatch(const UniValue& vReq);
+
+extern std::string experimentalDisabledHelpMsg(const std::string& rpc, const std::vector<std::string>& enableArgs);
+
+extern int interpretHeightArg(int nHeight, int currentHeight);
+extern int parseHeightArg(const std::string& strHeight, int currentHeight);
+
+#endif // BITCOIN_RPC_SERVER_H
diff --git a/depend/zcash/src/rust/README.md b/depend/zcash/src/rust/README.md
new file mode 100644
index 000000000..790db5d11
--- /dev/null
+++ b/depend/zcash/src/rust/README.md
@@ -0,0 +1,30 @@
+# librustzcash
+
+`librustzcash` is an FFI library crate that exposes the Zcash Rust components to
+the `zcashd` full node.
+
+The FFI API does not have any stability guarantees, and will change as required
+by `zcashd`.
+
+# zcashd-wallet-tool
+
+`zcashd-wallet-tool` is a command-line tool that allows confirming to a `zcashd`
+node that the emergency recovery phrase of the node's wallet has been backed up.
+
+## License
+
+Licensed under either of
+
+ * Apache License, Version 2.0, ([LICENSE-APACHE](../LICENSE-APACHE) or
+   https://www.apache.org/licenses/LICENSE-2.0)
+ * MIT license ([LICENSE-MIT](../LICENSE-MIT) or https://opensource.org/licenses/MIT)
+
+at your option.
+
+### Contribution
+
+Unless you explicitly state otherwise, any contribution intentionally
+submitted for inclusion in the work by you, as defined in the Apache-2.0
+license, shall be dual licensed as above, without any additional terms or
+conditions.
+
diff --git a/depend/zcash/src/rust/bin/wallet_tool.rs b/depend/zcash/src/rust/bin/wallet_tool.rs
new file mode 100644
index 000000000..01f496389
--- /dev/null
+++ b/depend/zcash/src/rust/bin/wallet_tool.rs
@@ -0,0 +1,664 @@
+use std::cmp::min;
+use std::env::{self, consts::EXE_EXTENSION};
+use std::ffi::OsStr;
+use std::fs::File;
+use std::io::{self, BufRead, Stdin, Write};
+use std::iter;
+use std::panic;
+use std::path::{Path, PathBuf};
+use std::process::{self, ChildStdin, Command, Output, Stdio};
+use std::str::from_utf8;
+use std::time::SystemTime;
+
+use anyhow::{self, Context};
+use backtrace::Backtrace;
+use gumdrop::{Options, ParsingStyle};
+use rand::{thread_rng, Rng};
+use secrecy::{ExposeSecret, SecretString};
+use thiserror::Error;
+use time::macros::format_description;
+use time::OffsetDateTime;
+use tracing::debug;
+use tracing_subscriber::{fmt, EnvFilter};
+
+#[derive(Debug, Options)]
+struct CliOptions {
+    #[options(no_short, help = "Print this help output")]
+    help: bool,
+
+    #[options(
+        no_short,
+        help = "Specify configuration filename, relative to the data directory (default: zcash.conf)",
+        meta = "FILENAME"
+    )]
+    conf: Option<String>,
+
+    #[options(
+        no_short,
+        help = "Specify data directory (this path cannot use '~')",
+        meta = "PATH"
+    )]
+    datadir: Option<String>,
+
+    #[options(no_short, help = "Use the test chain")]
+    testnet: bool,
+
+    #[options(
+        no_short,
+        help = "Send commands to node running on IPADDR (default: 127.0.0.1)",
+        meta = "IPADDR"
+    )]
+    rpcconnect: Option<String>,
+
+    #[options(
+        no_short,
+        help = "Connect to JSON-RPC on PORT (default: 8232 or testnet: 18232)",
+        meta = "PORT"
+    )]
+    rpcport: Option<u16>,
+
+    #[options(
+        no_short,
+        help = "Username for JSON-RPC connections",
+        meta = "USERNAME"
+    )]
+    rpcuser: Option<String>,
+
+    #[options(
+        no_short,
+        help = "Password for JSON-RPC connections",
+        meta = "PASSWORD"
+    )]
+    rpcpassword: Option<String>,
+
+    #[options(
+        no_short,
+        help = "Timeout in seconds during HTTP requests, or 0 for no timeout. (default: 900)",
+        meta = "SECONDS"
+    )]
+    rpcclienttimeout: Option<u32>,
+}
+
+impl CliOptions {
+    fn to_zcash_cli_options(&self) -> Vec<String> {
+        iter::empty::<String>()
+            .chain(self.conf.as_ref().map(|o| format!("-conf={}", o)))
+            .chain(self.datadir.as_ref().map(|o| format!("-datadir={}", o)))
+            .chain(if self.testnet {
+                Some("-testnet".into())
+            } else {
+                None
+            })
+            .chain(
+                self.rpcconnect
+                    .as_ref()
+                    .map(|o| format!("-rpcconnect={}", o)),
+            )
+            .chain(self.rpcport.as_ref().map(|o| format!("-rpcport={}", o)))
+            .chain(self.rpcuser.as_ref().map(|o| format!("-rpcuser={}", o)))
+            .chain(
+                self.rpcpassword
+                    .as_ref()
+                    .map(|o| format!("-rpcpassword={}", o)),
+            )
+            .chain(
+                self.rpcclienttimeout
+                    .as_ref()
+                    .map(|o| format!("-rpcclienttimeout={}", o)),
+            )
+            .collect()
+    }
+}
+
+#[derive(Debug, Error)]
+enum WalletToolError {
+    #[error("zcash-cli executable not found")]
+    ZcashCliNotFound,
+
+    #[error("Unexpected response from zcash-cli or zcashd")]
+    UnexpectedResponse,
+
+    #[error("Could not connect to zcashd")]
+    ZcashdConnection,
+
+    #[error("zcashd -exportdir option not set")]
+    ExportDirNotSet,
+
+    #[error("Could not parse a unique recovery phrase from the export file")]
+    RecoveryPhraseNotFound,
+
+    #[error("Unexpected EOF in input")]
+    UnexpectedEof,
+}
+
+pub fn main() {
+    // Log to stderr, configured by the RUST_LOG environment variable.
+    let directive = env::var("RUST_LOG").unwrap_or_else(|_| "".to_string());
+    fmt()
+        .with_writer(io::stderr)
+        .with_env_filter(EnvFilter::try_new(&directive).unwrap_or_else(|_| {
+            eprintln!(
+                "Warning: could not parse filter directive '{}'\nfrom the RUST_LOG environment variable; using 'error' instead.\n",
+                &directive
+            );
+            EnvFilter::new("error")
+        }))
+        .init();
+
+    // Allow either Bitcoin-style or GNU-style arguments.
+    let mut args = env::args();
+    let command = args.next().expect("argv[0] should exist");
+    let args: Vec<_> = args
+        .map(|s| {
+            if s.starts_with('-') && !s.starts_with("--") {
+                format!("-{}", s)
+            } else {
+                s
+            }
+        })
+        .collect();
+
+    const USAGE_NOTE: &str = concat!(
+        "Options can be given in GNU style (`--conf=CONF` or `--conf CONF`),\n",
+        "or in Bitcoin style with a single hyphen (`-conf=CONF`).\n\n",
+        "The environment variable RUST_LOG controls debug output, e.g.\n",
+        "`RUST_LOG=debug`.\n",
+    );
+
+    let opts = CliOptions::parse_args(&args, ParsingStyle::default()).unwrap_or_else(|e| {
+        eprintln!(
+            "{}: {}\n\nUsage: {} [OPTIONS]\n\n{}\n\n{}",
+            command,
+            e,
+            command,
+            CliOptions::usage(),
+            USAGE_NOTE,
+        );
+        process::exit(2);
+    });
+
+    if opts.help_requested() {
+        println!(
+            "Usage: {} [OPTIONS]\n\n{}\n\n{}",
+            command,
+            opts.self_usage(),
+            USAGE_NOTE
+        );
+        process::exit(0);
+    }
+
+    if let Err(e) = run(&opts) {
+        eprintln!("{}: {}", command, e);
+        process::exit(1);
+    }
+}
+
+fn run(opts: &CliOptions) -> anyhow::Result<()> {
+    let cli_options: Vec<String> = opts.to_zcash_cli_options();
+
+    println!(concat!(
+        "To reduce the risk of loss of funds, we're going to confirm that the\n",
+        "zcashd wallet is backed up reliably.\n\n",
+        "  👛 ➜ 🗃� \n"
+    ));
+
+    println!("Checking that we can connect to zcashd...");
+    let zcash_cli = zcash_cli_path()?;
+
+    // Pass an invalid filename, "\x01", and use the error message to distinguish
+    // whether zcashd is running with the -exportdir option, running without that
+    // option, or not running / cannot connect.
+    let mut cli_args = cli_options.clone();
+    cli_args.extend_from_slice(&["z_exportwallet".to_string(), "\x01".to_string()]);
+    let out = exec(&zcash_cli, &cli_args, None)?;
+    let cli_err: Vec<_> = from_utf8(&out.stderr)
+        .with_context(|| "Output from zcash-cli was not UTF-8")?
+        .lines()
+        .map(|s| s.trim_end_matches('\r'))
+        .collect();
+    debug!("stderr {:?}", cli_err);
+
+    if !cli_err.is_empty() {
+        if cli_err[0].starts_with("Error reading configuration file") {
+            println!(
+                "\nNo, we could not read the zcashd configuration file, expected to be at\n{:?}.",
+                Path::new(opts.datadir.as_ref().map_or("~/.zcash", |s| &s[..])).join(Path::new(
+                    opts.conf.as_ref().map_or("zcash.conf", |s| &s[..])
+                )),
+            );
+            println!(concat!(
+                "If it is not at that path, please try again with the '-datadir' and/or\n",
+                "'-conf' options set correctly (see '--help' for details). Also make sure\n",
+                "that the current user has permission to read the configuration file.\n",
+            ));
+            return Err(WalletToolError::ZcashdConnection.into());
+        }
+        if cli_err[0].starts_with("error: couldn't connect") {
+            println!(concat!(
+                "\nNo, we could not connect. zcashd might not be running; in that case\n",
+                "please start it. The '-exportdir' option should be set to the absolute\n",
+                "path of the directory you want to save the wallet export file to.\n\n",
+                "(Don't forget to restart zcashd without '-exportdir' after finishing\n",
+                "the backup, if running it long-term with that option is not desired\n",
+                "or would be a security hazard in your environment.)\n\n",
+                "If you believe zcashd is running, it might be using an unexpected port,\n",
+                "address, or authentication options for the RPC interface, for example.\n",
+                "In that case try to connect to it using zcash-cli, and if successful,\n",
+                "use the same connection options for zcashd-wallet-tool (see '--help' for\n",
+                "accepted options) as for zcash-cli.\n"
+            ));
+            return Err(WalletToolError::ZcashdConnection.into());
+        }
+        if cli_err[0] == "error code: -28" {
+            println!(concat!(
+                "\nNo, we could not connect. zcashd seems to be initializing; please try\n",
+                "again once it has finished.\n",
+            ));
+            return Err(WalletToolError::ZcashdConnection.into());
+        }
+    }
+
+    const REMINDER_MSG: &str = concat!(
+        "\n\nPlease start or restart zcashd with '-exportdir' set to the absolute\n",
+        "path of the directory you want to save the wallet export file to.\n",
+        "(Don't forget to restart zcashd without '-exportdir' after finishing\n",
+        "the backup, if running it long-term with that option is not desired\n",
+        "or would be a security hazard in your environment.)\n",
+    );
+
+    if cli_err.len() >= 3
+        && cli_err[0] == "error code: -4"
+        && cli_err[2].contains("zcashd -exportdir")
+    {
+        println!(
+            "\nIt looks like zcashd is running without the '-exportdir' option.{}",
+            REMINDER_MSG
+        );
+        return Err(WalletToolError::ExportDirNotSet.into());
+    }
+    if !(cli_err.len() >= 3
+        && cli_err[0] == "error code: -4"
+        && cli_err[2].starts_with("Filename is invalid"))
+    {
+        println!(
+            "\nThere was an unexpected response from zcash-cli or zcashd:\n> {}{}",
+            cli_err.join("\n> "),
+            REMINDER_MSG,
+        );
+        return Err(WalletToolError::UnexpectedResponse.into());
+    }
+    println!("Yes, and it is running with the '-exportdir' option as required.");
+
+    let mut stdin = io::stdin();
+
+    let base = default_filename_base();
+    let mut r = 0u32;
+    let out = loop {
+        let default_filename = if r != 0 {
+            format!("{}r{}", base, r)
+        } else {
+            base.to_string()
+        };
+        println!(
+            concat!(
+                "\nEnter the filename for the wallet export file, using only characters\n",
+                "a-z, A-Z and 0-9 (default '{}')."
+            ),
+            default_filename
+        );
+        let response = prompt(&mut stdin)?;
+        let response = strip(&response);
+        let filename = if response.is_empty() {
+            r = r.saturating_add(1);
+            &default_filename
+        } else {
+            response
+        };
+        debug!("Using filename {:?}", filename);
+
+        let mut cli_args = cli_options.clone();
+        cli_args.extend_from_slice(&["z_exportwallet".to_string(), filename.to_string()]);
+        let out = exec(&zcash_cli, &cli_args, None)?;
+        let cli_err: Vec<_> = from_utf8(&out.stderr)
+            .with_context(|| "Output from zcash-cli was not UTF-8")?
+            .lines()
+            .map(|s| s.trim_end_matches('\r'))
+            .collect();
+        debug!("stderr {:?}", cli_err);
+
+        if cli_err.len() >= 3
+            && cli_err[0] == "error code: -8"
+            && cli_err[1] == "error message:"
+            && cli_err[2].contains("overwrite existing")
+        {
+            println!(concat!(
+                "That file already exists. Please pick a unique filename in the\n",
+                "directory specified by the '-exportdir' option to zcashd."
+            ));
+            continue;
+        } else {
+            break out;
+        }
+    };
+
+    let cli_out: Vec<_> = from_utf8(&out.stdout)
+        .with_context(|| "Output from zcash-cli was not UTF-8")?
+        .lines()
+        .map(|s| s.trim_end_matches('\r'))
+        .collect();
+    debug!("stdout {:?}", cli_out);
+
+    if cli_out.is_empty() {
+        return Err(WalletToolError::UnexpectedResponse.into());
+    }
+    let export_path = cli_out[0];
+
+    println!("\nSaved the export file to '{}'.", export_path);
+    println!("IMPORTANT: This file contains secrets that allow spending all wallet funds.\n");
+
+    let export_file = File::open(export_path)
+        .with_context(|| format!("Could not open {:?} for reading", export_path))?;
+
+    // TODO: ensure the buffer will be zeroized (#5650)
+    let phrase_line: Vec<_> = io::BufReader::new(export_file)
+        .lines()
+        .map(|line| line.map(SecretString::new))
+        .filter(|s| {
+            s.as_ref()
+                .map(|t| t.expose_secret().starts_with("# - recovery_phrase=\""))
+                .unwrap_or(false)
+        })
+        .collect();
+
+    let phrase = match &phrase_line[..] {
+        [Ok(line)] => line
+            .expose_secret()
+            .trim_start_matches("# - recovery_phrase=\"")
+            .trim_end_matches('"'),
+        _ => return Err(WalletToolError::RecoveryPhraseNotFound.into()),
+    };
+
+    // This panic hook allows us to make a best effort to clear the screen (and then print
+    // another reminder about secrets in the export file) even if a panic occurs.
+
+    let old_hook = panic::take_hook();
+    {
+        let export_path = export_path.to_string();
+        panic::set_hook(Box::new(move |panic_info| {
+            clear_and_show_cautions(&export_path);
+
+            let s = panic_info.payload().downcast_ref::<&str>().unwrap_or(&"");
+            eprintln!("\nPanic: {}\n{:?}", s, Backtrace::new());
+        }));
+    }
+
+    let res = (|| -> anyhow::Result<()> {
+        println!("The recovery phrase is:\n");
+
+        const WORDS_PER_LINE: usize = 3;
+
+        let words: Vec<_> = phrase.split(' ').collect();
+        let max_len = words.iter().map(|w| w.len()).max().unwrap_or(0);
+
+        for (i, word) in words.iter().enumerate() {
+            print!("{0:2}: {1:2$}", i + 1, word, max_len + 2);
+            if (i + 1) % WORDS_PER_LINE == 0 {
+                println!();
+            }
+        }
+        if words.len() % WORDS_PER_LINE != 0 {
+            println!();
+        }
+
+        println!(concat!(
+            "\nPlease write down this phrase (including the numbering of words) on\n",
+            "something durable that you will keep in a secure location.\n",
+            "Press Enter when finished; then the phrase will disappear and you'll be\n",
+            "asked to re-enter a selection of words from it."
+        ));
+
+        let mut stdin = io::stdin();
+        prompt(&mut stdin)?;
+
+        // The only reliable and portable way to make sure the recovery phrase
+        // is no longer displayed is to clear the whole terminal (including
+        // scrollback, if possible). The text is only printed if clearing fails.
+        try_to_clear(concat!(
+            "\n\n\n\n\n\n\n\n\n\n\n\n",
+            "Please adjust the terminal window so that you can't see the\n",
+            "recovery phrase above. After finishing the backup, close the\n",
+            "terminal window or clear it"
+        ));
+
+        println!("\nNow we're going to confirm that you backed up the recovery phrase.");
+
+        let mut rng = thread_rng();
+        let mut unconfirmed: Vec<usize> = (0..words.len()).collect();
+        for _ in 0..min(3, words.len()) {
+            let index: usize = rng.gen_range(0..unconfirmed.len());
+            let n = unconfirmed[index];
+            unconfirmed[index] = unconfirmed[unconfirmed.len() - 1];
+            unconfirmed.pop().expect("should be nonempty");
+
+            loop {
+                println!("\nPlease enter the {} word:", ordinal(n + 1));
+                let line = prompt(&mut stdin)?;
+                if words[n] == strip(&line) {
+                    break;
+                }
+                println!("That's not correct, please try again.");
+            }
+        }
+        Ok(())
+    })();
+
+    panic::set_hook(old_hook);
+    clear_and_show_cautions(export_path);
+    res?;
+
+    let mut cli_args = cli_options;
+    cli_args.extend_from_slice(&["-stdin".to_string(), "walletconfirmbackup".to_string()]);
+    exec(&zcash_cli, &cli_args, Some(phrase))
+        .and_then(|out| {
+            let cli_err: Vec<_> = from_utf8(&out.stderr)
+                .with_context(|| "Output from zcash-cli was not UTF-8")?
+                .lines()
+                .map(|s| s.trim_end_matches('\r'))
+                .collect();
+            debug!("stderr {:?}", cli_err);
+
+            if !cli_err.is_empty() {
+                if cli_err[0].starts_with("error: couldn't connect") {
+                    println!("\nWe could not connect to zcashd; it may have exited.");
+                    return Err(WalletToolError::ZcashdConnection.into());
+                } else {
+                    println!(
+                        "\nThere was an unexpected response from zcash-cli or zcashd:\n> {}",
+                        cli_err.join("\n> "),
+                    );
+                    return Err(WalletToolError::UnexpectedResponse.into());
+                }
+            }
+            println!(concat!(
+                "\nThe backup of the emergency recovery phrase for the zcashd\n",
+                "wallet has been successfully confirmed 🙂. You can now use the\n",
+                "zcashd RPC methods that create keys and addresses in that wallet.\n",
+                "\n",
+                "The zcashd wallet might also contain keys that are *not* derived\n",
+                "from the emergency recovery phrase. If you lose the 'wallet.dat'\n",
+                "file then any funds associated with these keys would be lost. To\n",
+                "minimize this risk, it is recommended to send all funds from this\n",
+                "wallet into new addresses and discontinue the use of legacy addresses.\n",
+                "Note that even after doing so, there is the possibility that\n",
+                "additional funds could be sent to legacy addresses (if any exist)\n",
+                "and so it is necessary to keep backing up the 'wallet.dat' file\n",
+                "in any case.\n",
+                "\n",
+                "If you use other wallets, their recovery information will need to\n",
+                "be backed up separately.\n"
+            ));
+            Ok(())
+        })
+        .map_err(|e| {
+            println!(concat!(
+                "\nzcash-wallet-tool was unable to communicate to zcashd that the\n",
+                "backup was confirmed. This can happen if zcashd stopped, in which\n",
+                "case you should try again. If zcashd is still running, please seek\n",
+                "help or try to use 'zcash-cli -stdin walletconfirmbackup' manually.\n"
+            ));
+            e
+        })?;
+    Ok(())
+}
+
+const MAX_USER_INPUT_LEN: usize = 100;
+
+fn prompt(input: &mut Stdin) -> anyhow::Result<SecretString> {
+    let mut buf = String::with_capacity(MAX_USER_INPUT_LEN);
+    let res = input
+        .read_line(&mut buf)
+        .with_context(|| "Error reading from stdin");
+
+    // Ensure the buffer is zeroized even on error.
+    let line = SecretString::new(buf);
+    res.and_then(|_| {
+        if line.expose_secret().ends_with('\n') {
+            Ok(line)
+        } else {
+            Err(WalletToolError::UnexpectedEof.into())
+        }
+    })
+}
+
+fn strip(input: &SecretString) -> &str {
+    input
+        .expose_secret()
+        .trim_end_matches(|c| c == '\r' || c == '\n')
+        .trim()
+}
+
+fn ordinal(num: usize) -> String {
+    let suffix = if (11..=13).contains(&(num % 100)) {
+        "th"
+    } else {
+        match num % 10 {
+            1 => "st",
+            2 => "nd",
+            3 => "rd",
+            _ => "th",
+        }
+    };
+    format!("{}{}", num, suffix)
+}
+
+fn zcash_cli_path() -> anyhow::Result<PathBuf> {
+    // First look for `zcash_cli[.exe]` as a sibling of the executable.
+    let mut exe = env::current_exe()
+        .with_context(|| "Cannot determine the path of the running executable")?;
+    exe.set_file_name("zcash-cli");
+    exe.set_extension(EXE_EXTENSION);
+
+    debug!("Testing for zcash-cli at {:?}", exe);
+    if exe.exists() {
+        return Ok(exe);
+    }
+    // If not found there, look in `../src/zcash_cli[.exe]` provided
+    // that `src` is a sibling of `target`.
+    exe.pop(); // strip filename
+    exe.pop(); // ..
+    if exe.file_name() != Some(OsStr::new("target")) {
+        // or in `../../src/zcash_cli[.exe]` under the same proviso
+        exe.pop(); // ../..
+        if exe.file_name() != Some(OsStr::new("target")) {
+            return Err(WalletToolError::ZcashCliNotFound.into());
+        }
+    }
+    // Replace 'target/' with 'src/'.
+    exe.set_file_name("src");
+    exe.push("zcash-cli");
+    exe.set_extension(EXE_EXTENSION);
+
+    debug!("Testing for zcash-cli at {:?}", exe);
+    if !exe.exists() {
+        return Err(WalletToolError::ZcashCliNotFound.into());
+    }
+    Ok(exe)
+}
+
+fn exec(exe_path: &Path, args: &[String], stdin: Option<&str>) -> anyhow::Result<Output> {
+    debug!("Running {:?} {:?}", exe_path, args);
+    let mut cmd = Command::new(exe_path);
+    let cli = cmd.args(args);
+    match stdin {
+        None => Ok(cli.output()?),
+        Some(data) => {
+            let mut cli_process = cli
+                .stdin(Stdio::piped())
+                .stdout(Stdio::piped())
+                .stderr(Stdio::piped())
+                .spawn()?;
+            cli_process
+                .stdin
+                .take()
+                .with_context(|| "Could not open pipe to zcash-cli's stdin")
+                .and_then(|mut pipe: ChildStdin| -> anyhow::Result<()> {
+                    pipe.write_all(data.as_bytes())?;
+                    pipe.write_all("\n".as_bytes())?;
+                    Ok(())
+                })
+                .with_context(|| "Could not write to zcash-cli's stdin")?;
+            Ok(cli_process.wait_with_output()?)
+        }
+    }
+}
+
+fn default_filename_base() -> String {
+    let format = format_description!("export[year][month][day]");
+
+    // We use the UTC date because there is a security issue in obtaining the local date
+    // from either `chrono` or `time`: <https://github.com/chronotope/chrono/issues/602>.
+    // We could use the approach in
+    // <https://github.com/ArekPiekarz/rusty-tax-break/commit/3aac8f0c26fd96b7365619509a544f78b59627fe>
+    // if it were important, but it isn't worth the dependency on `tz-rs`.
+
+    OffsetDateTime::from(SystemTime::now())
+        .format(&format)
+        .unwrap_or_else(|_| "export".to_string())
+}
+
+fn clear_and_show_cautions(export_path: &str) {
+    try_to_clear(concat!(
+        "\nCAUTION: This terminal window might be showing secrets (or have\n",
+        "them in the scrollback). Please copy any useful information and\n",
+        "then close it, or clear it"
+    ));
+
+    println!(
+        concat!(
+            "\nIMPORTANT: Secrets that allow spending all zcashd wallet funds\n",
+            "have been left in the file '{}'.\n\n",
+            "Don't forget to restart zcashd without '-exportdir', if running it\n",
+            "long-term with that option is not desired or would be a security\n",
+            "hazard in your environment.\n\n",
+            "When choosing a location for the physical backup of your emergency\n",
+            "recovery phrase, please make sure to consider both risk of theft,\n",
+            "and your long-term ability to remember where it is kept."
+        ),
+        export_path,
+    );
+}
+
+fn try_to_clear(error_blurb: &str) {
+    if let Err(e) = clearscreen::clear() {
+        eprintln!("Unable to clear screen: {}.", e);
+
+        #[cfg(target_os = "windows")]
+        const HOW_TO_CLEAR: &str = "using 'cls'";
+        #[cfg(target_os = "macos")]
+        const HOW_TO_CLEAR: &str = "by pressing Command + K";
+        #[cfg(not(any(target_os = "windows", target_os = "macos")))]
+        const HOW_TO_CLEAR: &str = "using 'clear'";
+
+        println!("{} {}.", error_blurb, HOW_TO_CLEAR);
+    }
+}
diff --git a/depend/zcash/src/rust/include/librustzcash.h b/depend/zcash/src/rust/include/librustzcash.h
new file mode 100644
index 000000000..fbf03770b
--- /dev/null
+++ b/depend/zcash/src/rust/include/librustzcash.h
@@ -0,0 +1,401 @@
+#ifndef ZCASH_RUST_INCLUDE_LIBRUSTZCASH_H
+#define ZCASH_RUST_INCLUDE_LIBRUSTZCASH_H
+
+#include "rust/types.h"
+
+#include <stddef.h>
+#include <stdint.h>
+
+#ifndef __cplusplus
+  #include <assert.h>
+  #include <stdalign.h>
+#endif
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+    void librustzcash_to_scalar(const unsigned char *input, unsigned char *result);
+
+    void librustzcash_ask_to_ak(const unsigned char *ask, unsigned char *result);
+
+    void librustzcash_nsk_to_nk(const unsigned char *nsk, unsigned char *result);
+
+    void librustzcash_crh_ivk(const unsigned char *ak, const unsigned char *nk, unsigned char *result);
+
+    bool librustzcash_check_diversifier(const unsigned char *diversifier);
+
+    bool librustzcash_ivk_to_pkd(const unsigned char *ivk, const unsigned char *diversifier, unsigned char *result);
+
+    /// Loads the zk-SNARK parameters into memory and saves
+    /// paths as necessary. Only called once.
+    void librustzcash_init_zksnark_params(
+        const codeunit* spend_path,
+        size_t spend_path_len,
+        const codeunit* output_path,
+        size_t output_path_len,
+        const codeunit* sprout_path,
+        size_t sprout_path_len
+    );
+
+    /// Validates the provided Equihash solution against
+    /// the given parameters, input and nonce.
+    bool librustzcash_eh_isvalid(
+        uint32_t n,
+        uint32_t k,
+        const unsigned char* input,
+        size_t input_len,
+        const unsigned char* nonce,
+        size_t nonce_len,
+        const unsigned char* soln,
+        size_t soln_len
+    );
+
+    /// Writes the "uncommitted" note value for empty leaves
+    /// of the merkle tree. `result` must be a valid pointer
+    /// to 32 bytes which will be written.
+    void librustzcash_tree_uncommitted(
+        unsigned char *result
+    );
+
+    /// Computes a merkle tree hash for a given depth.
+    /// The `depth` parameter should not be larger than
+    /// 62.
+    ///
+    /// `a` and `b` each must be of length 32, and must each
+    /// be scalars of BLS12-381.
+    ///
+    /// The result of the merkle tree hash is placed in
+    /// `result`, which must also be of length 32.
+    void librustzcash_merkle_hash(
+        size_t depth,
+        const unsigned char *a,
+        const unsigned char *b,
+        unsigned char *result
+    );
+
+    /// Computes the signature for each Spend description, given the key
+    /// `ask`, the re-randomization `ar`, the 32-byte sighash `sighash`,
+    /// and an output `result` buffer of 64-bytes for the signature.
+    ///
+    /// This function will fail if the provided `ask` or `ar` are invalid.
+    bool librustzcash_sapling_spend_sig(
+        const unsigned char *ask,
+        const unsigned char *ar,
+        const unsigned char *sighash,
+        unsigned char *result
+    );
+
+    /// Creates a Sapling proving context. Please free this when you're done.
+    void * librustzcash_sapling_proving_ctx_init();
+
+    /// This function (using the proving context) constructs a Spend proof
+    /// given the necessary witness information. It outputs `cv` (the value
+    /// commitment) and `rk` (so that you don't have to compute it) along
+    /// with the proof.
+    bool librustzcash_sapling_spend_proof(
+        void *ctx,
+        const unsigned char *ak,
+        const unsigned char *nsk,
+        const unsigned char *diversifier,
+        const unsigned char *rcm,
+        const unsigned char *ar,
+        const uint64_t value,
+        const unsigned char *anchor,
+        const unsigned char *witness,
+        unsigned char *cv,
+        unsigned char *rk,
+        unsigned char *zkproof
+    );
+
+    /// This function (using the proving context) constructs an Output
+    /// proof given the necessary witness information. It outputs `cv`
+    /// and the `zkproof`.
+    bool librustzcash_sapling_output_proof(
+        void *ctx,
+        const unsigned char *esk,
+        const unsigned char *payment_address,
+        const unsigned char *rcm,
+        const uint64_t value,
+        unsigned char *cv,
+        unsigned char *zkproof
+    );
+
+    /// This function (using the proving context) constructs a binding
+    /// signature. You must provide the intended valueBalance so that
+    /// we can internally check consistency.
+    bool librustzcash_sapling_binding_sig(
+        const void *ctx,
+        int64_t valueBalance,
+        const unsigned char *sighash,
+        unsigned char *result
+    );
+
+    /// Frees a Sapling proving context returned from
+    /// `librustzcash_sapling_proving_ctx_init`.
+    void librustzcash_sapling_proving_ctx_free(void *);
+
+    /// Creates a Sapling verification context. Please free this
+    /// when you're done.
+    void * librustzcash_sapling_verification_ctx_init(
+        bool zip216Enabled
+    );
+
+    /// Check the validity of a Sapling Spend description,
+    /// accumulating the value commitment into the context.
+    bool librustzcash_sapling_check_spend(
+        void *ctx,
+        const unsigned char *cv,
+        const unsigned char *anchor,
+        const unsigned char *nullifier,
+        const unsigned char *rk,
+        const unsigned char *zkproof,
+        const unsigned char *spendAuthSig,
+        const unsigned char *sighashValue
+    );
+
+    /// Check the validity of a Sapling Output description,
+    /// accumulating the value commitment into the context.
+    bool librustzcash_sapling_check_output(
+        void *ctx,
+        const unsigned char *cv,
+        const unsigned char *cm,
+        const unsigned char *ephemeralKey,
+        const unsigned char *zkproof
+    );
+
+    /// Finally checks the validity of the entire Sapling
+    /// transaction given valueBalance and the binding signature.
+    bool librustzcash_sapling_final_check(
+        void *ctx,
+        int64_t valueBalance,
+        const unsigned char *bindingSig,
+        const unsigned char *sighashValue
+    );
+
+    /// Frees a Sapling verification context returned from
+    /// `librustzcash_sapling_verification_ctx_init`.
+    void librustzcash_sapling_verification_ctx_free(void *);
+
+    /// Compute a Sapling nullifier.
+    ///
+    /// The `diversifier` parameter must be 11 bytes in length.
+    /// The `pk_d`, `r`, `ak` and `nk` parameters must be of length 32.
+    /// The result is also of length 32 and placed in `result`.
+    /// Returns false if the diversifier or pk_d is not valid
+    bool librustzcash_sapling_compute_nf(
+        const unsigned char *diversifier,
+        const unsigned char *pk_d,
+        const uint64_t value,
+        const unsigned char *rcm,
+        const unsigned char *ak,
+        const unsigned char *nk,
+        const uint64_t position,
+        unsigned char *result
+    );
+
+    /// Compute a Sapling commitment.
+    ///
+    /// The `diversifier` parameter must be 11 bytes in length.
+    /// The `pk_d` and `r` parameters must be of length 32.
+    /// The result is also of length 32 and placed in `result`.
+    /// Returns false if the diversifier or pk_d is not valid
+    bool librustzcash_sapling_compute_cmu(
+        bool zip216_enabled,
+        const unsigned char *diversifier,
+        const unsigned char *pk_d,
+        const uint64_t value,
+        const unsigned char *rcm,
+        unsigned char *result
+    );
+
+    /// Compute [sk] [8] P for some 32-byte
+    /// point P, and 32-byte Fs. If P or sk
+    /// are invalid, returns false. Otherwise,
+    /// the result is written to the 32-byte
+    /// `result` buffer.
+    bool librustzcash_sapling_ka_agree(
+        bool zip216_enabled,
+        const unsigned char *p,
+        const unsigned char *sk,
+        unsigned char *result
+    );
+
+    /// Compute g_d = GH(diversifier) and returns
+    /// false if the diversifier is invalid.
+    /// Computes [esk] g_d and writes the result
+    /// to the 32-byte `result` buffer. Returns
+    /// false if `esk` is not a valid scalar.
+    bool librustzcash_sapling_ka_derivepublic(
+        const unsigned char *diversifier,
+        const unsigned char *esk,
+        unsigned char *result
+    );
+
+    /// Generate uniformly random scalar in Jubjub.
+    /// The result is of length 32.
+    void librustzcash_sapling_generate_r(
+        unsigned char *result
+    );
+
+    /// Sprout JoinSplit proof generation.
+    void librustzcash_sprout_prove(
+        unsigned char *proof_out,
+
+        const unsigned char *phi,
+        const unsigned char *rt,
+        const unsigned char *h_sig,
+
+        const unsigned char *in_sk1,
+        uint64_t in_value1,
+        const unsigned char *in_rho1,
+        const unsigned char *in_r1,
+        const unsigned char *in_auth1,
+
+        const unsigned char *in_sk2,
+        uint64_t in_value2,
+        const unsigned char *in_rho2,
+        const unsigned char *in_r2,
+        const unsigned char *in_auth2,
+
+        const unsigned char *out_pk1,
+        uint64_t out_value1,
+        const unsigned char *out_r1,
+
+        const unsigned char *out_pk2,
+        uint64_t out_value2,
+        const unsigned char *out_r2,
+
+        uint64_t vpub_old,
+        uint64_t vpub_new
+    );
+
+    /// Sprout JoinSplit proof verification.
+    bool librustzcash_sprout_verify(
+        const unsigned char *proof,
+        const unsigned char *rt,
+        const unsigned char *h_sig,
+        const unsigned char *mac1,
+        const unsigned char *mac2,
+        const unsigned char *nf1,
+        const unsigned char *nf2,
+        const unsigned char *cm1,
+        const unsigned char *cm2,
+        uint64_t vpub_old,
+        uint64_t vpub_new
+    );
+
+    /// Derive the master ExtendedSpendingKey from a seed.
+    void librustzcash_zip32_sapling_xsk_master(
+        const unsigned char *seed,
+        size_t seedlen,
+        unsigned char *xsk_master
+    );
+
+    /// Derive a child ExtendedSpendingKey from a parent.
+    void librustzcash_zip32_sapling_xsk_derive(
+        const unsigned char *xsk_parent,
+        uint32_t i,
+        unsigned char *xsk_i
+    );
+
+    /// Derive a internal ExtendedSpendingKey from an external key
+    void librustzcash_zip32_sapling_xsk_derive_internal(
+        const unsigned char *xsk_external,
+        unsigned char *xsk_internal
+    );
+
+    /// Derive a child ExtendedFullViewingKey from a parent.
+    bool librustzcash_zip32_sapling_xfvk_derive(
+        const unsigned char *xfvk_parent,
+        uint32_t i,
+        unsigned char *xfvk_i
+    );
+
+    /**
+     * Derive the Sapling internal FVK corresponding to the given
+     * Sapling external FVK.
+     */
+    void librustzcash_zip32_sapling_derive_internal_fvk(
+        const unsigned char *fvk,
+        const unsigned char *dk,
+        unsigned char *fvk_ret,
+        unsigned char *dk_ret
+    );
+
+    /**
+     * Derive a PaymentAddress from a (SaplingFullViewingKey, DiversifierKey)
+     * pair.  Returns 'false' if no valid address can be derived for the
+     * specified diversifier index.
+     *
+     * Arguments:
+     * - fvk: [c_uchar; 96] the serialized form of a Sapling full viewing key
+     * - dk: [c_uchar; 32] the byte representation of a Sapling diversifier key
+     * - j: [c_uchar; 11] the 88-bit diversifier index, encoded in little-endian
+     *   order
+     * - addr_ret: [c_uchar; 43] array to which the returned address will be
+     *   written, if the specified diversifier index `j` produces a valid
+     *   address.
+     */
+    bool librustzcash_zip32_sapling_address(
+        const unsigned char *fvk,
+        const unsigned char *dk,
+        const unsigned char *j,
+        unsigned char *addr_ret
+    );
+
+    /**
+     * Derive a PaymentAddress from a (SaplingFullViewingKey, DiversifierKey)
+     * pair by searching the space of valid diversifiers starting at
+     * diversifier index `j`. This will always return a valid address along
+     * with the diversifier index that produced the address unless no addresses
+     * can be derived at any diversifier index >= `j`, in which case this
+     * function will return `false`.
+     *
+     * Arguments:
+     * - fvk: [c_uchar; 96] the serialized form of a Sapling full viewing key
+     * - dk: [c_uchar; 32] the byte representation of a Sapling diversifier key
+     * - j: [c_uchar; 11] the 88-bit diversifier index at which to start
+     *   searching, encoded in little-endian order
+     * - j_ret: [c_uchar; 11] array that will store the diversifier index at
+     *   which the returned address was found
+     * - addr_ret: [c_uchar; 43] array to which the returned address will be
+     *   written
+     */
+    bool librustzcash_zip32_find_sapling_address(
+        const unsigned char *fvk,
+        const unsigned char *dk,
+        const unsigned char *j,
+        unsigned char *j_ret,
+        unsigned char *addr_ret
+    );
+
+    /**
+     * Decrypts a Sapling diversifier using the specified diversifier key
+     * to obtain the diversifier index `j` at which the diversifier was
+     * derived.
+     *
+     * Arguments:
+     * - dk: [c_uchar; 32] the byte representation of a Sapling diversifier key
+     * - addr: [c_uchar; 11] the bytes of the diversifier
+     * - j_ret: [c_uchar; 11] array that will store the resulting diversifier index
+     */
+    void librustzcash_sapling_diversifier_index(
+        const unsigned char *dk,
+        const unsigned char *d,
+        unsigned char *j_ret
+    );
+
+    /// Fills the provided buffer with random bytes. This is intended to
+    /// be a cryptographically secure RNG; it uses Rust's `OsRng`, which
+    /// is implemented in terms of the `getrandom` crate. The first call
+    /// to this function may block until sufficient randomness is available.
+    void librustzcash_getrandom(
+        unsigned char *buf,
+        size_t buf_len
+    );
+#ifdef __cplusplus
+}
+#endif
+
+#endif // ZCASH_RUST_INCLUDE_LIBRUSTZCASH_H
diff --git a/depend/zcash/src/rust/include/rust/VA_OPT.hpp b/depend/zcash/src/rust/include/rust/VA_OPT.hpp
new file mode 100644
index 000000000..8f84c88e8
--- /dev/null
+++ b/depend/zcash/src/rust/include/rust/VA_OPT.hpp
@@ -0,0 +1,156 @@
+//  Copyright (c) 2019 Will Wray https://keybase.io/willwray
+//  Copyright (c) 2020 The Zcash developers
+//
+//  Distributed under the Boost Software License, Version 1.0.
+//        http://www.boost.org/LICENSE_1_0.txt
+//
+//  Repo: https://github.com/willwray/VA_OPT
+
+#ifndef ZCASH_RUST_INCLUDE_RUST_VA_OPT_H
+#define ZCASH_RUST_INCLUDE_RUST_VA_OPT_H
+
+/*
+  VA_OPT.hpp
+  ==========
+
+  Preprocessor utilities for testing emptiness of macro arguments
+  and for conditional expansion based on the emptiness of ARGS.
+
+  VA_OPT_SUPPORT(?)
+      1 if __VA_OPT__ support is detected else 0 (see platform note).
+
+  C++20's __VA_OPT__ finally provides a reliable test for empty ARGS.
+  The following macros use __VA_OPT__, if detected, otherwise they
+  provide 'polyfill' fallbacks (though with some failing edge cases).
+
+  IS_EMPTY(...)
+      1 if the ... ARGS is empty else 0.
+
+  IFN(...)
+      If ... ARGS are not empty then a trailing 'paren expression' (X)
+      is deparenthesized to X else the trailing (X) term is consumed.
+      E.g. IFN()(N) vanishes, while IFN(NotEmpty)(N) -> N
+
+      In other words, IFN(ARGS) is like __VA_OPT__, but with explicit
+      (ARGS) in place of an implicit __VA_ARGS__ check.
+
+  IFE(...)
+      If ... ARGS is empty expand trailing 'paren expression' (X) to X
+      else if ARGS are not empty consume the trailing paren expression.
+      E.g. IFE(NotEmpty)(E) vanishes, while IFE()(E) -> E
+
+  IFNE(...)(N,E...)
+      If ... ARGS are not empty expands to N else expands to E...
+      E.g. IFNE(ARG)(X,()) is equivalent to IFN(ARG)(X)IFE(ARG)(())
+      both put back a terminating () removed by the outer macro call.
+
+  Without VA_OPT_SUPPORT these 'emptiness' macros are not perfect;
+  IS_EMPTY, IFN, IFE, IFNE may cause a compile error ('too few args')
+  if the argument is a function-like macro name that expects ARG(s).
+
+  IBP(...)
+      IS_BEGIN_PARENS macro to test if an argument is parenthesised:
+      1 if ... ARGS begins with a 'paren expression' else 0.
+
+  Platform note: Current Sept 2019 __VA_OPT__ support:
+  -------------
+  Clang -std=c++2a enables it. GCC has it enabled without -std=c++2a
+  but warns "__VA_OPT__ is not available until C++2a" if another -std
+  flag is supplied along with -pedantic (dont know how to suppress it).
+  MSVC TBD
+
+  Credits
+  -------
+  Props to pre-pro pioneers, particularly Paul Mensonides.
+  The 'emptiness' methods are adapted from BOOST_VMD_IS_EMPTY which,
+. in turn, depends on BOOST Preprocessor's BOOST_PP_IS_BEGIN_PARENS
+  (adapted and exposed here as IBP 'Is Begin Parens'):
+  www.boost.org/doc/libs/1_71_0/libs/vmd
+  www.boost.org/doc/libs/1_71_0/libs/preprocessor
+*/
+
+#define VA_ARG1(A0,A1,...) A1
+// VA_EMPTY works only if __VA_OPT__ is supported, else always -> 1
+#define VA_EMPTY(...) VA_ARG1(__VA_OPT__(,)0,1,)
+
+// VA_OPT_SUPPORT helper macro for __VA_OPT__ feature detection.
+// Adapted from https://stackoverflow.com/a/48045656/7443483
+// Use as #if VA_OPT_SUPPORT(?)
+#define VA_OPT_SUPPORT ! VA_EMPTY
+
+#if VA_OPT_SUPPORT(?)
+
+#  define IS_EMPTY(...) VA_EMPTY(__VA_ARGS__)
+#  define IFN(...) VA_EAT __VA_OPT__(()VA_IDENT)
+#  define IFE(...) VA_IDENT __VA_OPT__(()VA_EAT)
+#  define IFNE(...) VA_ARGTAIL __VA_OPT__((,)VA_ARG0)
+
+#else
+
+#  define IS_EMPTY(...) IFP(IBP(__VA_ARGS__))(IE_GEN_0,IE_IBP)(__VA_ARGS__)
+#  define IFN(...) IFP(IBP(__VA_ARGS__))(GEN_IDENT,EAT_OR_IDENT)(__VA_ARGS__)
+#  define IFE(...) IFP(IBP(__VA_ARGS__))(GEN_EAT,IDENT_OR_EAT)(__VA_ARGS__)
+#  define IFNE(...) IFP(IBP(__VA_ARGS__))(GEN_ARGTAIL,ARG0_OR_TAIL)(__VA_ARGS__)
+
+#endif
+
+#define VA_EAT(...)
+#define VA_IDENT(...) __VA_ARGS__
+#define VA_ARG0_(A0,...) A0
+#define VA_ARG0(...) VA_ARG0_(__VA_ARGS__)
+#define VA_ARGTAIL_(A0,...) __VA_ARGS__
+#define VA_ARGTAIL(...) VA_ARGTAIL_(__VA_ARGS__)
+
+// IFP helper macros to test IBP for IFN and IS_EMPTY
+#define IFP_0(T,...) __VA_ARGS__
+#define IFP_1(T,...) T
+
+#define IFP_CAT(A,...) A##__VA_ARGS__
+#define IFP(BP) IFP_CAT(IFP_,BP)
+
+// IS_BEGIN_PAREN helper macros adapted from BOOST VMD
+#define IBP_CAT_(A,...) A##__VA_ARGS__
+#define IBP_CAT(A,...) IBP_CAT_(A,__VA_ARGS__)
+
+#define IBP_ARG0_(A,...) A
+#define IBP_ARG0(...) IBP_ARG0_(__VA_ARGS__)
+
+#define IBP_IS_ARGS(...) 1
+
+#define IBP_1 1,
+#define IBP_IBP_IS_ARGS 0,
+
+// IBP IS_BEGIN_PAREN returns 1 or 0 if ... ARGS is parenthesised
+#define IBP(...) IBP_ARG0(IBP_CAT(IBP_, IBP_IS_ARGS __VA_ARGS__))
+
+// IFN, IFE, IFNE and IF_EMPTY helpers without __VA_OPT__ support
+#if ! VA_OPT_SUPPORT(?)
+
+#  define IBP_(T,...) IBP_ARG0(IBP_CAT(IF##T##_, IBP_IS_ARGS __VA_ARGS__))
+
+   // IS_EMPTY helper macros, depend on IBP
+#  define IE_REDUCE_IBP(...) ()
+#  define IE_GEN_0(...) 0
+#  define IE_IBP(...) IBP(IE_REDUCE_IBP __VA_ARGS__ ())
+
+#  define GEN_IDENT(...) VA_IDENT
+#  define GEN_EAT(...) VA_EAT
+#  define GEN_ARGTAIL(...) VA_ARGTAIL
+#  define GEN_ARG0(...) VA_ARG0
+
+   // IFN, IFE, IFNE helper macros
+#  define EAT_OR_IDENT(...) IBP_(N,IE_REDUCE_IBP __VA_ARGS__ ())
+#  define IFN_1 VA_EAT,
+#  define IFN_IBP_IS_ARGS VA_IDENT,
+
+#  define IDENT_OR_EAT(...) IBP_(E,IE_REDUCE_IBP __VA_ARGS__ ())
+#  define IFE_1 VA_IDENT,
+#  define IFE_IBP_IS_ARGS VA_EAT,
+
+#  define ARG0_OR_TAIL(...) IBP_(NE,IE_REDUCE_IBP __VA_ARGS__ ())
+#  define IFNE_1 VA_ARGTAIL,
+#  define IFNE_IBP_IS_ARGS VA_ARG0,
+
+#endif // IFN and IF_EMPTY defs
+
+#endif // ZCASH_RUST_INCLUDE_RUST_VA_OPT_H
diff --git a/depend/zcash/src/rust/include/rust/address.h b/depend/zcash/src/rust/include/rust/address.h
new file mode 100644
index 000000000..92636c8aa
--- /dev/null
+++ b/depend/zcash/src/rust/include/rust/address.h
@@ -0,0 +1,54 @@
+// Copyright (c) 2021 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_RUST_INCLUDE_RUST_ADDRESS_H
+#define ZCASH_RUST_INCLUDE_RUST_ADDRESS_H
+
+#include "rust/orchard/keys.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+typedef bool (*orchard_receiver_t)(void* ua, OrchardRawAddressPtr* addr);
+typedef bool (*raw_to_receiver_t)(void* ua, const unsigned char* raw);
+typedef bool (*unknown_receiver_t)(
+    void* ua,
+    uint32_t typecode,
+    const unsigned char* data,
+    size_t len);
+typedef uint32_t (*get_typecode_t)(const void* ua, size_t index);
+typedef size_t (*get_receiver_len_t)(const void* ua, size_t index);
+typedef void (*get_receiver_t)(const void* ua, size_t index, unsigned char* data, size_t length);
+
+/// Parses a unified address from the given string.
+bool zcash_address_parse_unified(
+    const char* str,
+    const char* network,
+    void* ua,
+    orchard_receiver_t orchard_cb,
+    raw_to_receiver_t sapling_cb,
+    raw_to_receiver_t p2sh_cb,
+    raw_to_receiver_t p2pkh_cb,
+    unknown_receiver_t unknown_cb);
+
+/// Serializes the given unified address to a string.
+///
+/// Returns nullptr if the unified address is invalid.
+char* zcash_address_serialize_unified(
+    const char* network,
+    const void* ua,
+    size_t receivers_len,
+    get_typecode_t typecode_cb,
+    get_receiver_len_t receiver_len_cb,
+    get_receiver_t receiver_cb);
+
+/// Frees a string returned by `zcash_address_serialize_unified`.
+void zcash_address_string_free(char* str);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // ZCASH_RUST_INCLUDE_RUST_ADDRESS_H
diff --git a/depend/zcash/src/rust/include/rust/blake2b.h b/depend/zcash/src/rust/include/rust/blake2b.h
new file mode 100644
index 000000000..bda1835e1
--- /dev/null
+++ b/depend/zcash/src/rust/include/rust/blake2b.h
@@ -0,0 +1,59 @@
+// Copyright (c) 2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_RUST_INCLUDE_RUST_BLAKE2B_H
+#define ZCASH_RUST_INCLUDE_RUST_BLAKE2B_H
+
+#include <stddef.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+struct BLAKE2bState;
+typedef struct BLAKE2bState BLAKE2bState;
+#define BLAKE2bPersonalBytes 16U
+
+/// Initializes a BLAKE2b state with no key and no salt.
+///
+/// `personalization` MUST be a pointer to a 16-byte array.
+///
+/// Please free this with `blake2b_free` when you are done.
+BLAKE2bState* blake2b_init(
+    size_t output_len,
+    const unsigned char* personalization);
+
+/// Clones the given BLAKE2b state.
+///
+/// Both states need to be separately freed with `blake2b_free` when you are
+/// done.
+BLAKE2bState* blake2b_clone(const BLAKE2bState* state);
+
+/// Frees a BLAKE2b state returned by `blake2b_init`.
+void blake2b_free(BLAKE2bState* state);
+
+/// Adds input to the hash. You can call this any number of times.
+void blake2b_update(
+    BLAKE2bState* state,
+    const unsigned char* input,
+    size_t input_len);
+
+/// Finalizes the `state` and stores the result in `output`.
+///
+/// `output_len` MUST be less than or equal to the value that was passed as the
+/// first parameter to `blake2b_init`.
+///
+/// This method is idempotent, and calling it multiple times will give the same
+/// result. It's also possible to call `blake2b_update` with more input in
+/// between.
+void blake2b_finalize(
+    BLAKE2bState* state,
+    unsigned char* output,
+    size_t output_len);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // ZCASH_RUST_INCLUDE_RUST_BLAKE2B_H
diff --git a/depend/zcash/src/rust/include/rust/builder.h b/depend/zcash/src/rust/include/rust/builder.h
new file mode 100644
index 000000000..a95e5ddfb
--- /dev/null
+++ b/depend/zcash/src/rust/include/rust/builder.h
@@ -0,0 +1,105 @@
+// Copyright (c) 2022 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_RUST_INCLUDE_RUST_BUILDER_H
+#define ZCASH_RUST_INCLUDE_RUST_BUILDER_H
+
+#include "rust/orchard.h"
+#include "rust/orchard/keys.h"
+#include "rust/transaction.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/// A type-safe pointer to a Rust-allocated struct containing the information
+/// needed to spend an Orchard note.
+struct OrchardSpendInfoPtr;
+typedef struct OrchardSpendInfoPtr OrchardSpendInfoPtr;
+
+/// Pointer to Rust-allocated Orchard bundle builder.
+struct OrchardBuilderPtr;
+typedef struct OrchardBuilderPtr OrchardBuilderPtr;
+
+/// Pointer to Rust-allocated Orchard bundle without proofs
+/// or authorizing data.
+struct OrchardUnauthorizedBundlePtr;
+typedef struct OrchardUnauthorizedBundlePtr OrchardUnauthorizedBundlePtr;
+
+/// Frees the memory associated with an Orchard spend info struct that was
+/// allocated by Rust.
+void orchard_spend_info_free(OrchardSpendInfoPtr* ptr);
+
+/// Construct a new Orchard transaction builder.
+///
+/// If `anchor` is `null`, the root of the empty Orchard commitment tree is used.
+OrchardBuilderPtr* orchard_builder_new(
+    bool spends_enabled,
+    bool outputs_enabled,
+    const unsigned char* anchor);
+
+/// Frees an Orchard builder returned from `orchard_builder_new`.
+void orchard_builder_free(OrchardBuilderPtr* ptr);
+
+/// Adds a note to be spent in this bundle.
+///
+/// Returns `false` if the Merkle path in `spend_info` does not have the
+/// required anchor.
+///
+/// `spend_info` is always freed by this method, whether or not it succeeds.
+bool orchard_builder_add_spend(
+    OrchardBuilderPtr* ptr,
+    OrchardSpendInfoPtr* spend_info);
+
+/// Adds an address which will receive funds in this bundle.
+///
+/// `ovk` is a pointer to the outgoing viewing key to make this recipient recoverable by,
+/// or `null` to make the recipient unrecoverable by the sender.
+///
+/// `memo` is a pointer to the 512-byte memo field encoding, or `null` for "no memo".
+bool orchard_builder_add_recipient(
+    OrchardBuilderPtr* ptr,
+    const unsigned char* ovk,
+    const OrchardRawAddressPtr* recipient,
+    uint64_t value,
+    const unsigned char* memo);
+
+/// Builds a bundle containing the given spent notes and recipients.
+///
+/// Returns `null` if an error occurs.
+///
+/// `builder` is always freed by this method.
+OrchardUnauthorizedBundlePtr* orchard_builder_build(OrchardBuilderPtr* builder);
+
+/// Frees an Orchard bundle returned from `orchard_bundle_build`.
+void orchard_unauthorized_bundle_free(OrchardUnauthorizedBundlePtr* bundle);
+
+/// Adds proofs and signatures to the bundle.
+///
+/// Returns `null` if an error occurs.
+///
+/// `bundle` is always freed by this method.
+OrchardBundlePtr* orchard_unauthorized_bundle_prove_and_sign(
+    OrchardUnauthorizedBundlePtr* bundle,
+    const OrchardSpendingKeyPtr** keys,
+    size_t keys_len,
+    const unsigned char* sighash);
+
+/// Calculates a ZIP 244 shielded signature digest for the given under-construction
+/// transaction.
+///
+/// Returns `false` if any of the parameters are invalid; in this case, `sighash_ret`
+/// will be unaltered.
+///
+/// `preTx` is always freed by this method.
+bool zcash_builder_zip244_shielded_signature_digest(
+    PrecomputedTxParts* preTx,
+    const OrchardUnauthorizedBundlePtr* bundle,
+    unsigned char* sighash_ret);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // ZCASH_RUST_INCLUDE_RUST_BUILDER_H
diff --git a/depend/zcash/src/rust/include/rust/ed25519.h b/depend/zcash/src/rust/include/rust/ed25519.h
new file mode 100644
index 000000000..848575b7e
--- /dev/null
+++ b/depend/zcash/src/rust/include/rust/ed25519.h
@@ -0,0 +1,59 @@
+// Copyright (c) 2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_RUST_INCLUDE_RUST_ED25519_H
+#define ZCASH_RUST_INCLUDE_RUST_ED25519_H
+
+#include "ed25519/types.h"
+
+#include <stddef.h>
+
+#ifndef __cplusplus
+#include <assert.h>
+#include <stdalign.h>
+#endif
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/// Generates a new Ed25519 keypair.
+void ed25519_generate_keypair(
+    Ed25519SigningKey* sk,
+    Ed25519VerificationKey* vk);
+
+/// Creates a signature on msg using the given signing key.
+bool ed25519_sign(
+    const Ed25519SigningKey* sk,
+    const unsigned char* msg,
+    size_t msglen,
+    Ed25519Signature* signature);
+
+/// Verifies a purported `signature` on the given `msg`.
+///
+/// # Zcash-specific consensus properties
+///
+/// Ed25519 checks are described in §5.4.5 of the Zcash protocol specification
+/// and in ZIP 215. The verification criteria for an (encoded) `signature`
+/// (`R_bytes`, `s_bytes`) with (encoded) verification key `A_bytes` are:
+///
+/// - `A_bytes` and `R_bytes` MUST be encodings of points `A` and `R`
+///   respectively on the twisted Edwards form of Curve25519, and non-canonical
+///   encodings MUST be accepted;
+/// - `s_bytes` MUST represent an integer `s` less than `l`, the order of the
+///   prime-order subgroup of Curve25519;
+/// - the verification equation `[8][s]B = [8]R + [8][k]A` MUST be satisfied;
+/// - the alternate verification equation `[s]B = R + [k]A`, allowed by RFC 8032,
+///   MUST NOT be used.
+bool ed25519_verify(
+    const Ed25519VerificationKey* vk,
+    const Ed25519Signature* signature,
+    const unsigned char* msg,
+    size_t msglen);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // ZCASH_RUST_INCLUDE_RUST_ED25519_H
diff --git a/depend/zcash/src/rust/include/rust/ed25519/types.h b/depend/zcash/src/rust/include/rust/ed25519/types.h
new file mode 100644
index 000000000..790ed7614
--- /dev/null
+++ b/depend/zcash/src/rust/include/rust/ed25519/types.h
@@ -0,0 +1,56 @@
+// Copyright (c) 2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_RUST_INCLUDE_RUST_ED25519_TYPES_H
+#define ZCASH_RUST_INCLUDE_RUST_ED25519_TYPES_H
+
+#ifndef __cplusplus
+#include <assert.h>
+#include <stdalign.h>
+#endif
+
+#define ED25519_SIGNING_KEY_LEN 32U
+#define ED25519_VERIFICATION_KEY_LEN 32U
+#define ED25519_SIGNATURE_LEN 64U
+
+/// An Ed25519 signing key.
+///
+/// This is also called a secret key by other implementations.
+typedef struct Ed25519SigningKey {
+    unsigned char bytes[ED25519_SIGNING_KEY_LEN];
+} Ed25519SigningKey;
+static_assert(
+    sizeof(Ed25519SigningKey) == ED25519_SIGNING_KEY_LEN,
+    "Ed25519SigningKey struct is not the same size as the underlying byte array");
+static_assert(
+    alignof(Ed25519SigningKey) == 1,
+    "Ed25519SigningKey struct alignment is not 1");
+
+/// An encoded Ed25519 verification key.
+///
+/// This is also called a public key by other implementations.
+///
+/// This type does not guarantee validity of the verification key.
+typedef struct Ed25519VerificationKey {
+    unsigned char bytes[ED25519_VERIFICATION_KEY_LEN];
+} Ed25519VerificationKey;
+static_assert(
+    sizeof(Ed25519VerificationKey) == ED25519_VERIFICATION_KEY_LEN,
+    "Ed25519VerificationKey struct is not the same size as the underlying byte array");
+static_assert(
+    alignof(Ed25519VerificationKey) == 1,
+    "Ed25519VerificationKey struct alignment is not 1");
+
+/// An Ed25519 signature.
+typedef struct Ed25519Signature {
+    unsigned char bytes[ED25519_SIGNATURE_LEN];
+} Ed25519Signature;
+static_assert(
+    sizeof(Ed25519Signature) == ED25519_SIGNATURE_LEN,
+    "Ed25519Signature struct is not the same size as the underlying byte array");
+static_assert(
+    alignof(Ed25519Signature) == 1,
+    "Ed25519Signature struct alignment is not 1");
+
+#endif // ZCASH_RUST_INCLUDE_RUST_ED25519_TYPES_H
diff --git a/depend/zcash/src/rust/include/rust/helpers.h b/depend/zcash/src/rust/include/rust/helpers.h
new file mode 100644
index 000000000..0bdaa113a
--- /dev/null
+++ b/depend/zcash/src/rust/include/rust/helpers.h
@@ -0,0 +1,34 @@
+// Copyright (c) 2020 Jack Grigg
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_RUST_INCLUDE_RUST_HELPERS_H
+#define ZCASH_RUST_INCLUDE_RUST_HELPERS_H
+
+#include "rust/map.h"
+#include "rust/VA_OPT.hpp"
+
+//
+// Helper macros
+//
+
+#define MAP_PAIR_LIST0(f, x, y, peek, ...) f(x, y) MAP_LIST_NEXT(peek, MAP_PAIR_LIST1)(f, peek, __VA_ARGS__)
+#define MAP_PAIR_LIST1(f, x, y, peek, ...) f(x, y) MAP_LIST_NEXT(peek, MAP_PAIR_LIST0)(f, peek, __VA_ARGS__)
+
+/// Applies the function macro `f` to each pair of the remaining parameters and
+/// inserts commas between the results.
+#define MAP_PAIR_LIST(f, ...) EVAL(MAP_PAIR_LIST1(f, __VA_ARGS__, ()()(), ()()(), ()()(), 0))
+
+#define T_FIELD_NAME(x, y) x
+#define T_FIELD_VALUE(x, y) y
+
+#define T_FIELD_NAMES(...) IFN(__VA_ARGS__)(MAP_PAIR_LIST(T_FIELD_NAME, __VA_ARGS__))
+#define T_FIELD_VALUES(...) IFN(__VA_ARGS__)(MAP_PAIR_LIST(T_FIELD_VALUE, __VA_ARGS__))
+
+#define T_DOUBLEESCAPE(a) #a
+#define T_ESCAPEQUOTE(a) T_DOUBLEESCAPE(a)
+
+// Computes the length of the given array. This is COUNT_OF from Chromium.
+#define T_ARRLEN(x) ((sizeof(x) / sizeof(0 [x])) / ((size_t)(!(sizeof(x) % sizeof(0 [x])))))
+
+#endif // ZCASH_RUST_INCLUDE_RUST_HELPERS_H
diff --git a/depend/zcash/src/rust/include/rust/history.h b/depend/zcash/src/rust/include/rust/history.h
new file mode 100644
index 000000000..aadc35ca2
--- /dev/null
+++ b/depend/zcash/src/rust/include/rust/history.h
@@ -0,0 +1,74 @@
+// Copyright (c) 2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_RUST_INCLUDE_RUST_HISTORY_H
+#define ZCASH_RUST_INCLUDE_RUST_HISTORY_H
+
+#include <stddef.h>
+#include <stdint.h>
+
+#define NODE_V1_SERIALIZED_LENGTH 171
+#define NODE_SERIALIZED_LENGTH 244
+#define ENTRY_SERIALIZED_LENGTH (NODE_SERIALIZED_LENGTH + 9)
+
+typedef struct HistoryNode {
+    unsigned char bytes[NODE_SERIALIZED_LENGTH];
+}  HistoryNode;
+static_assert(
+    sizeof(HistoryNode) == NODE_SERIALIZED_LENGTH,
+    "HistoryNode struct is not the same size as the underlying byte array");
+static_assert(alignof(HistoryNode) == 1, "HistoryNode struct alignment is not 1");
+
+typedef struct HistoryEntry {
+    unsigned char bytes[ENTRY_SERIALIZED_LENGTH];
+}  HistoryEntry;
+static_assert(
+    sizeof(HistoryEntry) == ENTRY_SERIALIZED_LENGTH,
+    "HistoryEntry struct is not the same size as the underlying byte array");
+static_assert(alignof(HistoryEntry) == 1, "HistoryEntry struct alignment is not 1");
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+/// Appends a leaf to the given history tree.
+///
+/// `t_len` must be at least 1.
+///
+/// Aborts if `cbranch` is not a valid consensus branch ID.
+uint32_t librustzcash_mmr_append(
+    uint32_t cbranch,
+    uint32_t t_len,
+    const uint32_t* ni_ptr,
+    const HistoryEntry* n_ptr,
+    size_t p_len,
+    const HistoryNode* nn_ptr,
+    unsigned char* rt_ret,
+    HistoryNode* buf_ret);
+
+/// Deletes the most recently-appended leaf from the given history tree.
+///
+/// `t_len` must be at least 1.
+///
+/// Aborts if `cbranch` is not a valid consensus branch ID.
+uint32_t librustzcash_mmr_delete(
+    uint32_t cbranch,
+    uint32_t t_len,
+    const uint32_t* ni_ptr,
+    const HistoryEntry* n_ptr,
+    size_t p_len,
+    size_t e_len,
+    unsigned char* rt_ret);
+
+/// Returns the hash of the given history tree node.
+///
+/// Aborts if `cbranch` is not a valid consensus branch ID.
+uint32_t librustzcash_mmr_hash_node(
+    uint32_t cbranch,
+    const HistoryNode* n_ptr,
+    unsigned char* h_ret);
+#ifdef __cplusplus
+}
+#endif
+
+#endif // ZCASH_RUST_INCLUDE_RUST_HISTORY_H
diff --git a/depend/zcash/src/rust/include/rust/map.h b/depend/zcash/src/rust/include/rust/map.h
new file mode 100644
index 000000000..efdbbb7f2
--- /dev/null
+++ b/depend/zcash/src/rust/include/rust/map.h
@@ -0,0 +1,71 @@
+/*
+ * Copyright (C) 2012 William Swanson
+ * Copyright (C) 2020 The Zcash developers
+ *
+ * Permission is hereby granted, free of charge, to any person
+ * obtaining a copy of this software and associated documentation
+ * files (the "Software"), to deal in the Software without
+ * restriction, including without limitation the rights to use, copy,
+ * modify, merge, publish, distribute, sublicense, and/or sell copies
+ * of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be
+ * included in all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+ * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+ * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+ * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY
+ * CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
+ * CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+ * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+ *
+ * Except as contained in this notice, the names of the authors or
+ * their institutions shall not be used in advertising or otherwise to
+ * promote the sale, use or other dealings in this Software without
+ * prior written authorization from the authors.
+ */
+
+#ifndef ZCASH_RUST_INCLUDE_RUST_MAP_H
+#define ZCASH_RUST_INCLUDE_RUST_MAP_H
+
+#define EVAL0(...) __VA_ARGS__
+#define EVAL1(...) EVAL0(EVAL0(EVAL0(__VA_ARGS__)))
+#define EVAL2(...) EVAL1(EVAL1(EVAL1(__VA_ARGS__)))
+#define EVAL3(...) EVAL2(EVAL2(EVAL2(__VA_ARGS__)))
+#define EVAL4(...) EVAL3(EVAL3(EVAL3(__VA_ARGS__)))
+#define EVAL(...)  EVAL4(EVAL4(EVAL4(__VA_ARGS__)))
+
+#define MAP_END(...)
+#define MAP_OUT
+#define MAP_COMMA ,
+
+#define MAP_GET_END2() 0, MAP_END
+#define MAP_GET_END1(...) MAP_GET_END2
+#define MAP_GET_END(...) MAP_GET_END1
+#define MAP_NEXT0(test, next, ...) next MAP_OUT
+#define MAP_NEXT1(test, next) MAP_NEXT0(test, next, 0)
+#define MAP_NEXT(test, next)  MAP_NEXT1(MAP_GET_END test, next)
+
+#define MAP0(f, x, peek, ...) f(x) MAP_NEXT(peek, MAP1)(f, peek, __VA_ARGS__)
+#define MAP1(f, x, peek, ...) f(x) MAP_NEXT(peek, MAP0)(f, peek, __VA_ARGS__)
+
+#define MAP_LIST_NEXT1(test, next) MAP_NEXT0(test, MAP_COMMA next, 0)
+#define MAP_LIST_NEXT(test, next)  MAP_LIST_NEXT1(MAP_GET_END test, next)
+
+#define MAP_LIST0(f, x, peek, ...) f(x) MAP_LIST_NEXT(peek, MAP_LIST1)(f, peek, __VA_ARGS__)
+#define MAP_LIST1(f, x, peek, ...) f(x) MAP_LIST_NEXT(peek, MAP_LIST0)(f, peek, __VA_ARGS__)
+
+/**
+ * Applies the function macro `f` to each of the remaining parameters.
+ */
+#define MAP(f, ...) EVAL(MAP1(f, __VA_ARGS__, ()()(), ()()(), ()()(), 0))
+
+/**
+ * Applies the function macro `f` to each of the remaining parameters and
+ * inserts commas between the results.
+ */
+#define MAP_LIST(f, ...) EVAL(MAP_LIST1(f, __VA_ARGS__, ()()(), ()()(), ()()(), 0))
+
+#endif // ZCASH_RUST_INCLUDE_RUST_MAP_H
diff --git a/depend/zcash/src/rust/include/rust/metrics.h b/depend/zcash/src/rust/include/rust/metrics.h
new file mode 100644
index 000000000..c3133981e
--- /dev/null
+++ b/depend/zcash/src/rust/include/rust/metrics.h
@@ -0,0 +1,314 @@
+// Copyright (c) 2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_RUST_INCLUDE_RUST_METRICS_H
+#define ZCASH_RUST_INCLUDE_RUST_METRICS_H
+
+#include "rust/helpers.h"
+
+#include <stddef.h>
+#include <stdint.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/// Initializes the metrics runtime and runs the Prometheus exporter in a new
+/// thread.
+///
+/// bind_address is an IP address to bind to, or empty to use the default.
+///
+/// Returns false on any error.
+bool metrics_run(
+    const char* bind_address,
+    const char* const* allow_ips,
+    size_t allow_ips_len,
+    uint16_t prometheus_port);
+
+struct MetricsCallsite;
+typedef struct MetricsCallsite MetricsCallsite;
+
+struct MetricsKey;
+typedef struct MetricsKey MetricsKey;
+
+/// Creates a metrics callsite.
+///
+/// This API supports labels that MUST have static values. For non-static label
+/// values, use `metrics_key`.
+///
+/// You should usually call one of the helper macros such as `MetricsCounter`
+/// instead of calling this directly.
+///
+/// This MUST ONLY be called to assign a `static MetricsCallsite*`, and all
+/// string arguments MUST be static `const char*` constants, and MUST be valid
+/// UTF-8.
+MetricsCallsite* metrics_callsite(
+    const char* name,
+    const char* const* label_names,
+    const char* const* label_values,
+    size_t labels_len);
+
+/// Creates a metrics key.
+///
+/// This API supports labels that may not have static values, and is intended
+/// to be called for each metrics callsite invocation. As such, it returns null
+/// if a metrics recorder is not installed, to save on construction costs.
+///
+/// You should usually call one of the helper macros such as `MetricsCounter`
+/// instead of calling this directly.
+///
+/// API requirements:
+/// - label_names and label_values, if not null, MUST be the same length.
+/// - All string arguments MUST be valid UTF-8.
+MetricsKey* metrics_key(
+    const char* name,
+    const char* const* label_names,
+    const char* const* label_values,
+    size_t labels_len);
+
+/// Increments a counter.
+///
+/// Counters represent a single monotonic value, which means the value can only
+/// be incremented, not decremented, and always starts out with an initial value
+/// of zero.
+void metrics_static_increment_counter(const MetricsCallsite* callsite, uint64_t value);
+
+/// Increments a counter.
+///
+/// Counters represent a single monotonic value, which means the value can only
+/// be incremented, not decremented, and always starts out with an initial value
+/// of zero.
+void metrics_increment_counter(MetricsKey* key, uint64_t value);
+
+/// Updates a gauge.
+///
+/// Gauges represent a single value that can go up or down over time, and always
+/// starts out with an initial value of zero.
+void metrics_static_update_gauge(const MetricsCallsite* callsite, double value);
+
+/// Updates a gauge.
+///
+/// Gauges represent a single value that can go up or down over time, and always
+/// starts out with an initial value of zero.
+void metrics_update_gauge(MetricsKey* callsite, double value);
+
+/// Increments a gauge.
+///
+/// Gauges represent a single value that can go up or down over time, and always
+/// starts out with an initial value of zero.
+void metrics_static_increment_gauge(const MetricsCallsite* callsite, double value);
+
+/// Increments a gauge.
+///
+/// Gauges represent a single value that can go up or down over time, and always
+/// starts out with an initial value of zero.
+void metrics_increment_gauge(MetricsKey* callsite, double value);
+
+/// Decrements a gauge.
+///
+/// Gauges represent a single value that can go up or down over time, and always
+/// starts out with an initial value of zero.
+void metrics_static_decrement_gauge(const MetricsCallsite* callsite, double value);
+
+/// Decrements a gauge.
+///
+/// Gauges represent a single value that can go up or down over time, and always
+/// starts out with an initial value of zero.
+void metrics_decrement_gauge(MetricsKey* callsite, double value);
+
+/// Records a histogram.
+///
+/// Histograms measure the distribution of values for a given set of
+/// measurements, and start with no initial values.
+void metrics_static_record_histogram(const MetricsCallsite* callsite, double value);
+
+/// Records a histogram.
+///
+/// Histograms measure the distribution of values for a given set of
+/// measurements, and start with no initial values.
+void metrics_record_histogram(MetricsKey* callsite, double value);
+
+#ifdef __cplusplus
+}
+#endif
+
+//
+// Helper macros
+//
+
+#ifdef __cplusplus
+// Constructs a metrics callsite.
+//
+// The 'static constexpr' hack ensures that all arguments are compile-time
+// constants with static storage duration. The output of this macro MUST be
+// stored as a static MetricsCallsite*.
+#define M_CALLSITE(name, label_names, label_values) ([&] { \
+    static constexpr const char* _m_name = name;           \
+    static constexpr const char* const* _m_label_names =   \
+        label_names;                                       \
+    static constexpr const char* const* _m_label_values =  \
+        label_values;                                      \
+    return metrics_callsite(                               \
+        _m_name, _m_label_names, _m_label_values,          \
+        T_ARRLEN(label_names));                            \
+}())
+#else
+// Constructs a metrics callsite.
+//
+// All arguments MUST be static constants, and the output of this macro MUST be
+// stored as a static MetricsCallsite*.
+#define M_CALLSITE(name, label_names, label_values) \
+    metrics_callsite(name, label_names, label_values, T_ARRLEN(label_names))
+#endif
+
+// Constructs a metrics key.
+#define M_KEY(name, labels, values) \
+    metrics_key(                    \
+        name,                       \
+        labels,                     \
+        values,                     \
+        T_ARRLEN(labels))
+
+//
+// Metrics
+//
+
+/// Increments a counter.
+///
+/// Counters represent a single monotonic value, which means the value can only
+/// be incremented, not decremented, and always starts out with an initial value
+/// of zero.
+///
+/// name MUST be a static constant, and all strings MUST be valid UTF-8.
+#define MetricsCounter(name, value, ...)                             \
+    do {                                                             \
+        IFE(__VA_ARGS__)                                             \
+        (static constexpr const char* const EMPTY[] = {};            \
+         static MetricsCallsite* CALLSITE =                          \
+             M_CALLSITE(name, EMPTY, EMPTY);                         \
+         metrics_static_increment_counter(CALLSITE, value);)         \
+            IFN(__VA_ARGS__)(const char* M_LABELS[] =                \
+                                 {T_FIELD_NAMES(__VA_ARGS__)};       \
+                             const char* M_VALUES[] =                \
+                                 {T_FIELD_VALUES(__VA_ARGS__)};      \
+                             MetricsKey* KEY =                       \
+                                 M_KEY(name, M_LABELS, M_VALUES);    \
+                             metrics_increment_counter(KEY, value);) \
+    } while (0)
+
+/// Increments a counter by one.
+///
+/// Counters represent a single monotonic value, which means the value can only
+/// be incremented, not decremented, and always starts out with an initial value
+/// of zero.
+///
+/// name MUST be a static constant, and all strings MUST be valid UTF-8.
+#define MetricsIncrementCounter(name, ...) MetricsCounter(name, 1, __VA_ARGS__)
+
+/// Updates a gauge.
+///
+/// Gauges represent a single value that can go up or down over time, and always
+/// starts out with an initial value of zero.
+///
+/// name MUST be a static constant, and all strings MUST be valid UTF-8.
+#define MetricsGauge(name, value, ...)                            \
+    do {                                                          \
+        IFE(__VA_ARGS__)                                          \
+        (static constexpr const char* const EMPTY[] = {};         \
+         static MetricsCallsite* CALLSITE =                       \
+             M_CALLSITE(name, EMPTY, EMPTY);                      \
+         metrics_static_update_gauge(CALLSITE, value);)           \
+            IFN(__VA_ARGS__)(const char* M_LABELS[] =             \
+                                 {T_FIELD_NAMES(__VA_ARGS__)};    \
+                             const char* M_VALUES[] =             \
+                                 {T_FIELD_VALUES(__VA_ARGS__)};   \
+                             MetricsKey* KEY =                    \
+                                 M_KEY(name, M_LABELS, M_VALUES); \
+                             metrics_update_gauge(KEY, value);)   \
+    } while (0)
+
+/// Updates a gauge with optional static labels.
+///
+/// Gauges represent a single value that can go up or down over time, and always
+/// starts out with an initial value of zero.
+///
+/// name MUST be a static constant, and all strings MUST be valid UTF-8.
+#define MetricsStaticGauge(name, value, ...)           \
+    do {                                               \
+        static constexpr const char* M_LABELS[] =      \
+            {T_FIELD_NAMES(__VA_ARGS__)};              \
+        static constexpr const char* M_VALUES[] =      \
+            {T_FIELD_VALUES(__VA_ARGS__)};             \
+        static MetricsCallsite* CALLSITE =             \
+             M_CALLSITE(name, M_LABELS, M_VALUES);     \
+         metrics_static_update_gauge(CALLSITE, value); \
+    } while (0)
+
+/// Increments a gauge.
+///
+/// Gauges represent a single value that can go up or down over time, and always
+/// starts out with an initial value of zero.
+///
+/// name MUST be a static constant, and all strings MUST be valid UTF-8.
+#define MetricsIncrementGauge(name, value, ...)                    \
+    do {                                                           \
+        IFE(__VA_ARGS__)                                           \
+        (static constexpr const char* const EMPTY[] = {};          \
+         static MetricsCallsite* CALLSITE =                        \
+             M_CALLSITE(name, EMPTY, EMPTY);                       \
+         metrics_static_increment_gauge(CALLSITE, value);)         \
+            IFN(__VA_ARGS__)(const char* M_LABELS[] =              \
+                                 {T_FIELD_NAMES(__VA_ARGS__)};     \
+                             const char* M_VALUES[] =              \
+                                 {T_FIELD_VALUES(__VA_ARGS__)};    \
+                             MetricsKey* KEY =                     \
+                                 M_KEY(name, M_LABELS, M_VALUES);  \
+                             metrics_increment_gauge(KEY, value);) \
+    } while (0)
+
+/// Decrements a gauge.
+///
+/// Gauges represent a single value that can go up or down over time, and always
+/// starts out with an initial value of zero.
+///
+/// name MUST be a static constant, and all strings MUST be valid UTF-8.
+#define MetricsDecrementGauge(name, value, ...)                    \
+    do {                                                           \
+        IFE(__VA_ARGS__)                                           \
+        (static constexpr const char* const EMPTY[] = {};          \
+         static MetricsCallsite* CALLSITE =                        \
+             M_CALLSITE(name, EMPTY, EMPTY);                       \
+         metrics_static_decrement_gauge(CALLSITE, value);)         \
+            IFN(__VA_ARGS__)(const char* M_LABELS[] =              \
+                                 {T_FIELD_NAMES(__VA_ARGS__)};     \
+                             const char* M_VALUES[] =              \
+                                 {T_FIELD_VALUES(__VA_ARGS__)};    \
+                             MetricsKey* KEY =                     \
+                                 M_KEY(name, M_LABELS, M_VALUES);  \
+                             metrics_decrement_gauge(KEY, value);) \
+    } while (0)
+
+/// Records a histogram.
+///
+/// Histograms measure the distribution of values for a given set of
+/// measurements, and start with no initial values.
+///
+/// name MUST be a static constant, and all strings MUST be valid UTF-8.
+#define MetricsHistogram(name, value, ...)                          \
+    do {                                                            \
+        IFE(__VA_ARGS__)                                            \
+        (static constexpr const char* const EMPTY[] = {};           \
+         static MetricsCallsite* CALLSITE =                         \
+             M_CALLSITE(name, EMPTY, EMPTY);                        \
+         metrics_static_record_histogram(CALLSITE, value);)         \
+            IFN(__VA_ARGS__)(const char* M_LABELS[] =               \
+                                 {T_FIELD_NAMES(__VA_ARGS__)};      \
+                             const char* M_VALUES[] =               \
+                                 {T_FIELD_VALUES(__VA_ARGS__)};     \
+                             MetricsKey* KEY =                      \
+                                 M_KEY(name, M_LABELS, M_VALUES);   \
+                             metrics_record_histogram(KEY, value);) \
+    } while (0)
+
+#endif // ZCASH_RUST_INCLUDE_RUST_METRICS_H
diff --git a/depend/zcash/src/rust/include/rust/orchard.h b/depend/zcash/src/rust/include/rust/orchard.h
new file mode 100644
index 000000000..5cb32ac0f
--- /dev/null
+++ b/depend/zcash/src/rust/include/rust/orchard.h
@@ -0,0 +1,190 @@
+// Copyright (c) 2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_RUST_INCLUDE_RUST_ORCHARD_H
+#define ZCASH_RUST_INCLUDE_RUST_ORCHARD_H
+
+#include "rust/streams.h"
+
+#include <stddef.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/// Typesafe pointer to a Rust-allocated orchard::bundle::Bundle value
+struct OrchardBundlePtr;
+typedef struct OrchardBundlePtr OrchardBundlePtr;
+
+struct OrchardBatchValidatorPtr;
+typedef struct OrchardBatchValidatorPtr OrchardBatchValidatorPtr;
+
+/// Clones the given Orchard bundle.
+///
+/// Both bundles need to be separately freed when they go out of scope.
+OrchardBundlePtr* orchard_bundle_clone(const OrchardBundlePtr* bundle);
+
+/// Frees an Orchard bundle returned from `orchard_parse_bundle`.
+void orchard_bundle_free(OrchardBundlePtr* bundle);
+
+/// Returns the amount of dynamically-allocated memory used by this bundle.
+size_t orchard_bundle_recursive_dynamic_usage(const OrchardBundlePtr* bundle);
+
+/// Parses an authorized Orchard bundle from the given stream.
+///
+/// - If no error occurs, `bundle_ret` will point to a Rust-allocated Orchard bundle.
+/// - If an error occurs, `bundle_ret` will be unaltered.
+bool orchard_bundle_parse(
+    void* stream,
+    read_callback_t read_cb,
+    OrchardBundlePtr** bundle_ret);
+
+/// Serializes an authorized Orchard bundle to the given stream
+///
+/// If `bundle == nullptr`, this serializes `nActionsOrchard = 0`.
+bool orchard_bundle_serialize(
+    const OrchardBundlePtr* bundle,
+    void* stream,
+    write_callback_t write_cb);
+
+/// Returns the value balance for this Orchard bundle.
+///
+/// A transaction with no Orchard component has a value balance of zero.
+int64_t orchard_bundle_value_balance(const OrchardBundlePtr* bundle);
+
+/// Validates the given Orchard bundle against bundle-specific consensus rules.
+///
+/// If `bundle == nullptr`, this returns `true`.
+///
+/// ## Consensus rules
+///
+/// [§4.6](https://zips.z.cash/protocol/protocol.pdf#actiondesc):
+/// - Canonical element encodings are enforced by `orchard_bundle_parse`.
+/// - SpendAuthSig^Orchard validity is enforced by `orchard_batch_validate`.
+/// - Proof validity is enforced here.
+///
+/// [§7.1](https://zips.z.cash/protocol/protocol.pdf#txnencodingandconsensus):
+/// - `bindingSigOrchard` validity is enforced by `orchard_batch_validate`.
+bool orchard_bundle_validate(const OrchardBundlePtr* bundle);
+
+/// Returns the number of actions associated with the bundle.
+size_t orchard_bundle_actions_len(const OrchardBundlePtr* bundle);
+
+/// Returns the nullifiers for the bundle by copying them into the provided
+/// vector of 32-byte arrays `nullifiers_ret`, which should be sized to the
+/// number of anchors.
+///
+/// Returns `false` if the number of nullifiers specified varies from the
+/// number of the actions in the bundle, `true` otherwise.
+bool orchard_bundle_nullifiers(
+    const OrchardBundlePtr* bundle,
+    void* nullifiers_ret,
+    size_t nullifiers_len
+    );
+
+/// Returns the anchor for the bundle by copying them into
+/// the provided value.
+///
+/// Returns `false` if the bundle was absent, `true` otherwise.
+bool orchard_bundle_anchor(
+    const OrchardBundlePtr* bundle,
+    unsigned char* anchor_ret);
+
+/// Initializes a new Orchard batch validator.
+///
+/// Please free this with `orchard_batch_validation_free` when you are done with
+/// it.
+OrchardBatchValidatorPtr* orchard_batch_validation_init();
+
+/// Frees a batch validator returned from `orchard_batch_validation_init`.
+void orchard_batch_validation_free(OrchardBatchValidatorPtr* batch);
+
+/// Adds an Orchard bundle to this batch.
+///
+/// Currently, only RedPallas signatures are batch-validated.
+void orchard_batch_add_bundle(
+    OrchardBatchValidatorPtr* batch,
+    const OrchardBundlePtr* bundle,
+    const unsigned char* txid);
+
+/// Validates this batch.
+///
+/// Returns false if any item in the batch is invalid.
+bool orchard_batch_validate(const OrchardBatchValidatorPtr* batch);
+
+/// Returns whether the Orchard bundle is present and outputs
+/// are enabled.
+bool orchard_bundle_outputs_enabled(const OrchardBundlePtr* bundle);
+
+/// Returns whether the Orchard bundle is present and spends
+/// are enabled.
+bool orchard_bundle_spends_enabled(const OrchardBundlePtr* bundle);
+
+/// Returns whether all actions contained in the Orchard bundle
+/// can be decrypted with the all-zeros OVK. Returns `true`
+/// if no Orchard actions are present.
+bool orchard_bundle_coinbase_outputs_are_valid(const OrchardBundlePtr* bundle);
+
+#ifdef __cplusplus
+}
+#endif
+
+#ifdef __cplusplus
+namespace orchard
+{
+/**
+ * A validator for the Orchard authorization component of a transaction.
+ *
+ * Currently, only RedPallas signatures are batch-validated.
+ */
+class AuthValidator
+{
+private:
+    /// An optional batch validator (with `nullptr` corresponding to `None`).
+    /// Memory is allocated by Rust.
+    std::unique_ptr<OrchardBatchValidatorPtr, decltype(&orchard_batch_validation_free)> inner;
+
+    AuthValidator() : inner(nullptr, orchard_batch_validation_free) {}
+
+public:
+    // AuthValidator should never be copied
+    AuthValidator(const AuthValidator&) = delete;
+    AuthValidator& operator=(const AuthValidator&) = delete;
+    AuthValidator(AuthValidator&& bundle) : inner(std::move(bundle.inner)) {}
+    AuthValidator& operator=(AuthValidator&& bundle)
+    {
+        if (this != &bundle) {
+            inner = std::move(bundle.inner);
+        }
+        return *this;
+    }
+
+    /// Creates a validation context that batch-validates Orchard signatures.
+    static AuthValidator Batch() {
+        auto batch = AuthValidator();
+        batch.inner.reset(orchard_batch_validation_init());
+        return batch;
+    }
+
+    /// Creates a validation context that performs no validation. This can be
+    /// used when avoiding duplicate effort such as during reindexing.
+    static AuthValidator Disabled() {
+        return AuthValidator();
+    }
+
+    /// Queues an Orchard bundle for validation.
+    void Queue(const OrchardBundlePtr* bundle, const unsigned char* txid) {
+        orchard_batch_add_bundle(inner.get(), bundle, txid);
+    }
+
+    /// Validates the queued Orchard authorizations, returning `true` if all
+    /// signatures were valid and `false` otherwise.
+    bool Validate() const {
+        return orchard_batch_validate(inner.get());
+    }
+};
+} // namespace orchard
+#endif
+
+#endif // ZCASH_RUST_INCLUDE_RUST_ORCHARD_H
diff --git a/depend/zcash/src/rust/include/rust/orchard/incremental_merkle_tree.h b/depend/zcash/src/rust/include/rust/orchard/incremental_merkle_tree.h
new file mode 100644
index 000000000..8cb473884
--- /dev/null
+++ b/depend/zcash/src/rust/include/rust/orchard/incremental_merkle_tree.h
@@ -0,0 +1,96 @@
+// Copyright (c) 2021 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_RUST_INCLUDE_RUST_ORCHARD_INCREMENTAL_MERKLE_TREE_H
+#define ZCASH_RUST_INCLUDE_RUST_ORCHARD_INCREMENTAL_MERKLE_TREE_H
+
+#include "rust/streams.h"
+#include "rust/orchard.h"
+
+#include <stddef.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#define SINSEMILLA_DIGEST_LEN 32U
+
+/// Pointer to an Orchard incremental merkle tree frontier
+struct OrchardMerkleFrontierPtr;
+typedef struct OrchardMerkleFrontierPtr OrchardMerkleFrontierPtr;
+
+// Create an empty Orchard Merkle frontier.
+//
+// Memory allocated to the resulting value must be manually freed.
+OrchardMerkleFrontierPtr* orchard_merkle_frontier_empty();
+
+// Clones the given Orchard Merkle frontier and returns
+// a pointer to the newly created tree. Both the original
+// tree's memory and the newly allocated one need to be freed
+// independently.
+OrchardMerkleFrontierPtr* orchard_merkle_frontier_clone(
+        const OrchardMerkleFrontierPtr* tree_ptr);
+
+// Free the memory allocated for the given Orchard Merkle frontier.
+void orchard_merkle_frontier_free(
+        OrchardMerkleFrontierPtr* tree_ptr);
+
+// Parses an Orchard Merkle frontier from a stream. If parsing
+// fails, this will return the null pointer.
+//
+// Memory allocated to the resulting value must be manually freed.
+OrchardMerkleFrontierPtr* orchard_merkle_frontier_parse(
+        void* stream,
+        read_callback_t read_cb);
+
+// Serializes an Orchard Merkle frontier to a stream.
+//
+// Returns `false` if an error occurs while writing to the stream.
+bool orchard_merkle_frontier_serialize(
+        const OrchardMerkleFrontierPtr* tree_ptr,
+        void* stream,
+        write_callback_t write_cb);
+
+// Serializes an Orchard Merkle frontier to a stream using the
+// zcash_primitives::merkle_tree::CommitmentTree sparse encoding.
+//
+// Returns `false` if an error occurs while writing to the stream.
+bool orchard_merkle_frontier_serialize_legacy(
+        const OrchardMerkleFrontierPtr* tree_ptr,
+        void* stream,
+        write_callback_t write_cb);
+
+// For each action in the provided bundle, append its
+// commitment to the frontier.
+//
+// Returns `true` if the append succeeds, `false` if the
+// tree is full.
+bool orchard_merkle_frontier_append_bundle(
+        OrchardMerkleFrontierPtr* tree_ptr,
+        const OrchardBundlePtr* bundle);
+
+// Computes the root of the provided orchard Merkle frontier
+void orchard_merkle_frontier_root(
+        const OrchardMerkleFrontierPtr* tree_ptr,
+        unsigned char* digest_ret);
+
+// The total number of leaves that have been appended to obtain
+// the current state of the frontier. Subtract 1 from this value
+// to obtain the position of the most recently appended leaf.
+uint64_t orchard_merkle_frontier_num_leaves(
+        const OrchardMerkleFrontierPtr* tree_ptr);
+
+// Estimate the amount of memory consumed by the merkle frontier.
+size_t orchard_merkle_frontier_dynamic_mem_usage(
+        const OrchardMerkleFrontierPtr* tree_ptr);
+
+// Computes the empty leaf value for the incremental Merkle tree.
+void orchard_merkle_tree_empty_root(
+        unsigned char* digest_ret);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // ZCASH_RUST_INCLUDE_RUST_ORCHARD_INCREMENTAL_MERKLE_TREE_H
diff --git a/depend/zcash/src/rust/include/rust/orchard/keys.h b/depend/zcash/src/rust/include/rust/orchard/keys.h
new file mode 100644
index 000000000..8dd08c568
--- /dev/null
+++ b/depend/zcash/src/rust/include/rust/orchard/keys.h
@@ -0,0 +1,269 @@
+// Copyright (c) 2021 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_RUST_INCLUDE_RUST_ORCHARD_KEYS_H
+#define ZCASH_RUST_INCLUDE_RUST_ORCHARD_KEYS_H
+
+#include "rust/streams.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+ * A pointer to an Orchard shielded payment address, as defined in
+ * https://zips.z.cash/protocol/nu5.pdf#orchardpaymentaddrencoding
+ */
+struct OrchardRawAddressPtr;
+typedef struct OrchardRawAddressPtr OrchardRawAddressPtr;
+
+/**
+ * Clones the given Orchard payment address and returns
+ * a pointer to the newly created value. Both the original
+ * one's memory and the newly allocated one need to be freed
+ * independently.
+ */
+OrchardRawAddressPtr* orchard_address_clone(
+        const OrchardRawAddressPtr* ptr);
+
+/**
+ * Frees the memory allocated for the given Orchard payment address
+ */
+void orchard_address_free(OrchardRawAddressPtr* ptr);
+
+/**
+ * Parses Orchard raw address bytes from the given stream.
+ *
+ * - If the key does not parse correctly, the returned pointer will be null.
+ */
+OrchardRawAddressPtr* orchard_raw_address_parse(
+    void* stream,
+    read_callback_t read_cb);
+
+
+/**
+ * Serializes Orchard raw address bytes to the given stream.
+ *
+ * This will return `false` and leave the stream unmodified if
+ * `raw_address == nullptr`;
+ */
+bool orchard_raw_address_serialize(
+    const OrchardRawAddressPtr* raw_address,
+    void* stream,
+    write_callback_t write_cb);
+
+/**
+ * Implements the "equal" operation for comparing two Orchard addresses.
+ */
+bool orchard_address_eq(
+    const OrchardRawAddressPtr* k0,
+    const OrchardRawAddressPtr* k1);
+
+/**
+ * Implements the "less than" operation `k0 < k1` for comparing two Orchard
+ * addresses.  This is a comparison of the raw bytes, only useful for cases
+ * where a semantically irrelevant ordering is needed (such as for map keys).
+ */
+bool orchard_address_lt(
+    const OrchardRawAddressPtr* k0,
+    const OrchardRawAddressPtr* k1);
+
+//
+// Incoming Viewing Keys
+//
+
+struct OrchardIncomingViewingKeyPtr;
+typedef struct OrchardIncomingViewingKeyPtr OrchardIncomingViewingKeyPtr;
+
+/**
+ * Clones the given Orchard incoming viewing key and returns
+ * a pointer to the newly created value. Both the original
+ * one's memory and the newly allocated one need to be freed
+ * independently.
+ */
+OrchardIncomingViewingKeyPtr* orchard_incoming_viewing_key_clone(
+        const OrchardIncomingViewingKeyPtr* ptr);
+
+/**
+ * Frees the memory allocated for the given Orchard incoming viewing key
+ */
+void orchard_incoming_viewing_key_free(OrchardIncomingViewingKeyPtr* ptr);
+
+/**
+ * Returns the address at the specified diversifier index.
+ */
+OrchardRawAddressPtr* orchard_incoming_viewing_key_to_address(
+    const OrchardIncomingViewingKeyPtr* incoming_viewing_key,
+    const unsigned char* j);
+
+/**
+ * Decrypts the diversifier component of an Orchard raw address with the
+ * specified IVK, and verifies that the address was derived from that IVK.
+ *
+ * Returns `false` and leaves the `j_ret` parameter unmodified if the address
+ * was not derived from the specified IVK.
+ */
+bool orchard_incoming_viewing_key_decrypt_diversifier(
+    const OrchardIncomingViewingKeyPtr* incoming_viewing_key,
+    const OrchardRawAddressPtr* addr,
+    uint8_t *j_ret);
+
+/**
+ * Parses an Orchard incoming viewing key from the given stream.
+ *
+ * - If the key does not parse correctly, the returned pointer will be null.
+ */
+OrchardIncomingViewingKeyPtr* orchard_incoming_viewing_key_parse(
+    void* stream,
+    read_callback_t read_cb);
+
+
+/**
+ * Serializes an Orchard incoming viewing key to the given stream.
+ *
+ * This will return `false` and leave the stream unmodified if
+ * `incoming_viewing_key == nullptr`.
+ */
+bool orchard_incoming_viewing_key_serialize(
+    const OrchardIncomingViewingKeyPtr* incoming_viewing_key,
+    void* stream,
+    write_callback_t write_cb);
+
+/**
+ * Implements the "less than" operation for comparing two keys.
+ */
+bool orchard_incoming_viewing_key_lt(
+    const OrchardIncomingViewingKeyPtr* k0,
+    const OrchardIncomingViewingKeyPtr* k1);
+
+/**
+ * Implements equality testing between incoming viewing keys.
+ */
+bool orchard_incoming_viewing_key_eq(
+    const OrchardIncomingViewingKeyPtr* k0,
+    const OrchardIncomingViewingKeyPtr* k1);
+
+//
+// Full Viewing Keys
+//
+
+struct OrchardFullViewingKeyPtr;
+typedef struct OrchardFullViewingKeyPtr OrchardFullViewingKeyPtr;
+
+/**
+ * Clones the given Orchard full viewing key and returns
+ * a pointer to the newly created value. Both the original
+ * one's memory and the newly allocated one need to be freed
+ * independently.
+ */
+OrchardFullViewingKeyPtr* orchard_full_viewing_key_clone(
+        const OrchardFullViewingKeyPtr* ptr);
+
+/**
+ * Free the memory allocated for the given Orchard full viewing key
+ */
+void orchard_full_viewing_key_free(OrchardFullViewingKeyPtr* ptr);
+
+/**
+ * Parses an Orchard full viewing key from the given stream.
+ *
+ * - If the key does not parse correctly, the returned pointer will be null.
+ */
+OrchardFullViewingKeyPtr* orchard_full_viewing_key_parse(
+    void* stream,
+    read_callback_t read_cb);
+
+/**
+ * Serializes an Orchard full viewing key to the given stream.
+ *
+ * This will return `false` and leave the stream unmodified if
+ * `full_viewing_key == nullptr`.
+ */
+bool orchard_full_viewing_key_serialize(
+    const OrchardFullViewingKeyPtr* full_viewing_key,
+    void* stream,
+    write_callback_t write_cb);
+
+/**
+ * Returns the incoming viewing key for the specified full viewing key.
+ */
+OrchardIncomingViewingKeyPtr* orchard_full_viewing_key_to_incoming_viewing_key(
+    const OrchardFullViewingKeyPtr* key);
+
+/**
+ * Returns the internal incoming viewing key for the specified full viewing key.
+ */
+OrchardIncomingViewingKeyPtr* orchard_full_viewing_key_to_internal_incoming_viewing_key(
+    const OrchardFullViewingKeyPtr* key);
+
+/**
+ * Returns the external outgoing viewing key for the specified full viewing key.
+ *
+ * `ovk_ret` must be 32 bytes.
+ */
+OrchardIncomingViewingKeyPtr* orchard_full_viewing_key_to_external_outgoing_viewing_key(
+    const OrchardFullViewingKeyPtr* fvk,
+    uint8_t *ovk_ret);
+
+/**
+ * Returns the internal outgoing viewing key for the specified full viewing key.
+ *
+ * `ovk_ret` must be 32 bytes.
+ */
+OrchardIncomingViewingKeyPtr* orchard_full_viewing_key_to_internal_outgoing_viewing_key(
+    const OrchardFullViewingKeyPtr* fvk,
+    uint8_t *ovk_ret);
+
+/**
+ * Implements equality testing between full viewing keys.
+ */
+bool orchard_full_viewing_key_eq(
+    const OrchardFullViewingKeyPtr* k0,
+    const OrchardFullViewingKeyPtr* k1);
+
+//
+// Spending Keys
+//
+
+struct OrchardSpendingKeyPtr;
+typedef struct OrchardSpendingKeyPtr OrchardSpendingKeyPtr;
+
+/**
+ * Constructs a spending key by ZIP-32 derivation to the account
+ * level from the provided seed.
+ */
+OrchardSpendingKeyPtr* orchard_spending_key_for_account(
+        const unsigned char* seed,
+        size_t seed_len,
+        uint32_t bip44_coin_type,
+        uint32_t account_id);
+
+/**
+ * Clones the given Orchard spending key and returns
+ * a pointer to the newly created value. Both the original
+ * one's memory and the newly allocated one need to be freed
+ * independently.
+ */
+OrchardSpendingKeyPtr* orchard_spending_key_clone(
+        const OrchardSpendingKeyPtr* ptr);
+
+/**
+ * Free the memory allocated for the given Orchard spending key
+ */
+void orchard_spending_key_free(OrchardSpendingKeyPtr* ptr);
+
+/**
+ * Returns the full viewing key for the specified spending key.
+ *
+ * The resulting pointer must be ultimately freed by the caller
+ * using `orchard_full_viewing_key_free`.
+ */
+OrchardFullViewingKeyPtr* orchard_spending_key_to_full_viewing_key(
+    const OrchardSpendingKeyPtr* key);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // ZCASH_RUST_INCLUDE_RUST_ORCHARD_KEYS_H
diff --git a/depend/zcash/src/rust/include/rust/orchard/wallet.h b/depend/zcash/src/rust/include/rust/orchard/wallet.h
new file mode 100644
index 000000000..a08f10ef6
--- /dev/null
+++ b/depend/zcash/src/rust/include/rust/orchard/wallet.h
@@ -0,0 +1,397 @@
+// Copyright (c) 2021 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_RUST_INCLUDE_RUST_ORCHARD_WALLET_H
+#define ZCASH_RUST_INCLUDE_RUST_ORCHARD_WALLET_H
+
+#include "rust/orchard/incremental_merkle_tree.h"
+#include "rust/orchard/keys.h"
+#include "rust/builder.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/**
+ * A type-safe pointer type for an Orchard wallet.
+ */
+struct OrchardWalletPtr;
+typedef struct OrchardWalletPtr OrchardWalletPtr;
+
+/**
+ * Constructs a new empty Orchard wallet and return a pointer to it.
+ * Memory is allocated by Rust and must be manually freed using
+ * `orchard_wallet_free`.
+ */
+OrchardWalletPtr* orchard_wallet_new();
+
+/**
+ * Frees the memory associated with an Orchard wallet that was allocated
+ * by Rust.
+ */
+void orchard_wallet_free(OrchardWalletPtr* wallet);
+
+/**
+ * Reset the state of the wallet to be suitable for rescan from the NU5 activation
+ * height.  This removes all witness and spentness information from the wallet. The
+ * keystore is unmodified and decrypted note, nullifier, and conflict data are left
+ * in place with the expectation that they will be overwritten and/or updated in
+ * the rescan process.
+ */
+bool orchard_wallet_reset(OrchardWalletPtr* wallet);
+
+/**
+ * Checkpoint the note commitment tree. This returns `false` and leaves the note
+ * commitment tree unmodified if the block height specified is not the successor
+ * to the last block height checkpointed.
+ */
+bool orchard_wallet_checkpoint(
+        OrchardWalletPtr* wallet,
+        uint32_t blockHeight
+        );
+
+/**
+ * Returns whether or not the wallet has any checkpointed state to which it can rewind.
+ * If so, `blockHeightRet` will be modified to contain the last block height at which a
+ * checkpoint was created.
+ */
+bool orchard_wallet_get_last_checkpoint(
+        const OrchardWalletPtr* wallet,
+        uint32_t* blockHeightRet);
+
+/**
+ * Rewinds to the most recent checkpoint, and marks as unspent any notes previously
+ * identified as having been spent by transactions in the latest block.
+ *
+ * The `blockHeight` argument provides the height to which the witness tree should be
+ * rewound, such that after the rewind this height corresponds to the latest block
+ * appended to the tree.
+ *
+ * Returns `true` if the rewind is successful, in which case `resultHeight` will contain
+ * the height to which the tree has been rewound; otherwise, this returns `false` and
+ * leaves `resultHeight` unmodified.
+ */
+bool orchard_wallet_rewind(
+        OrchardWalletPtr* wallet,
+        uint32_t blockHeight,
+        uint32_t* resultHeight
+        );
+
+/**
+ * Initialize the wallet's note commitment tree to the empty tree starting from the
+ * specified Merkle frontier. This will return `false` and leave the wallet unmodified if
+ * it would cause any checkpoint or witness state to be invalidated.
+ */
+bool orchard_wallet_init_from_frontier(
+        OrchardWalletPtr* wallet,
+        const OrchardMerkleFrontierPtr* frontier);
+
+/**
+ * A C struct used to transfer action_idx/IVK pairs back from Rust across the FFI
+ * boundary. This must have the same in-memory representation as the `FFIActionIVK` type
+ * in orchard_ffi/wallet.rs.
+ *
+ * Values of the `ivk` pointer must be freed manually; the best way to do this is to
+ * wrap this pointer in an `OrchardIncomingViewingKey` which handles deallocation
+ * in the object destructor.
+ */
+struct RawOrchardActionIVK {
+    uint64_t actionIdx;
+    OrchardIncomingViewingKeyPtr* ivk;
+};
+static_assert(
+    sizeof(RawOrchardActionIVK) == 16,
+    "RawOrchardActionIVK struct should have exactly a 128-bit in-memory representation.");
+static_assert(alignof(RawOrchardActionIVK) == 8, "RawOrchardActionIVK struct alignment is not 64 bits.");
+
+typedef void (*push_action_ivk_callback_t)(void* rec, const RawOrchardActionIVK actionIvk);
+
+typedef void (*push_spend_action_idx_callback_t)(void* rec, uint32_t actionIdx);
+
+/**
+ * Searches the provided bundle for notes that are visible to the specified wallet's
+ * incoming viewing keys, and adds those notes to the wallet.  For each note decryptable
+ * by one of the wallet's keys, this method will insert a `RawOrchardActionIVK` value into
+ * the provided `callbackReceiver` referent using the `push_cb` callback. Note that
+ * this callback can perform transformations on the provided RawOrchardActionIVK in this
+ * process.  For each action spending one of the wallet's notes, this method will pass
+ * a `uint32_t` action index corresponding to that action to the `callbackReceiver` referent;
+ * using the specified callback; usually, this will push the value into a result vector owned
+ * by the caller.
+ *
+ * The provided bundle must be a component of the transaction from which `txid` was
+ * derived.
+ *
+ * Returns `true` if the bundle is involved with the wallet; i.e. if it contains
+ * notes spendable by the wallet, or spends any of the wallet's notes.
+ */
+bool orchard_wallet_add_notes_from_bundle(
+        OrchardWalletPtr* wallet,
+        const unsigned char txid[32],
+        const OrchardBundlePtr* bundle,
+        void* callbackReceiver,
+        push_action_ivk_callback_t push_cb,
+        push_spend_action_idx_callback_t spend_cb
+        );
+
+/**
+ * Decrypts a selection of notes from the bundle with specified incoming viewing
+ * keys, and adds those notes to the wallet.
+ *
+ * The provided bundle must be a component of the transaction from which
+ * `txid` was derived.
+ */
+bool orchard_wallet_load_bundle(
+        OrchardWalletPtr* wallet,
+        const unsigned char txid[32],
+        const OrchardBundlePtr* bundle,
+        const RawOrchardActionIVK* actionIvks,
+        size_t actionIvksLen,
+        const uint32_t* actionsSpendingWalletNotes,
+        size_t actionsSpendingWalletNotesLen
+        );
+
+/**
+ * Add the note commitment values for the specified bundle to the wallet's note
+ * commitment tree, and mark any Orchard notes that belong to the wallet so
+ * that we can construct authentication paths to these notes in the future.
+ *
+ * This requires the block height and the index of the block within the
+ * transaction in order to guarantee that note commitments are appended in the
+ * correct order. Returns `false` if the provided bundle is not in the correct
+ * position to have its note commitments appended to the note commitment tree.
+ */
+bool orchard_wallet_append_bundle_commitments(
+        OrchardWalletPtr* wallet,
+        const uint32_t block_height,
+        const size_t block_tx_idx,
+        const unsigned char txid[32],
+        const OrchardBundlePtr* bundle
+        );
+
+/**
+ * Returns the root of the wallet's note commitment tree.
+ */
+void orchard_wallet_commitment_tree_root(
+        const OrchardWalletPtr* wallet,
+        unsigned char* root_ret);
+
+/**
+ * Returns whether the specified transaction involves any Orchard notes that belong to
+ * this wallet.
+ */
+bool orchard_wallet_tx_involves_my_notes(
+        const OrchardWalletPtr* wallet,
+        const unsigned char txid[32]);
+
+/**
+ * Add the specified spending key to the wallet's key store.  This will also compute and
+ * add the associated full and incoming viewing keys.
+ */
+void orchard_wallet_add_spending_key(
+        OrchardWalletPtr* wallet,
+        const OrchardSpendingKeyPtr* sk);
+
+/**
+ * Add the specified full viewing key to the wallet's key store.  This will also compute
+ * and add the associated incoming viewing key.
+ */
+void orchard_wallet_add_full_viewing_key(
+        OrchardWalletPtr* wallet,
+        const OrchardFullViewingKeyPtr* fvk);
+
+/**
+ * Add the specified raw address to the wallet's key store, associated with the incoming
+ * viewing key from which that address was derived.
+ */
+bool orchard_wallet_add_raw_address(
+        OrchardWalletPtr* wallet,
+        const OrchardRawAddressPtr* addr,
+        const OrchardIncomingViewingKeyPtr* ivk);
+
+/**
+ * Returns a pointer to the Orchard spending key corresponding to the specified raw
+ * address, if it is known to the wallet, or `nullptr` otherwise.
+ *
+ * Memory is allocated by Rust and must be manually freed using
+ * `orchard_spending_key_free`.
+ */
+OrchardSpendingKeyPtr* orchard_wallet_get_spending_key_for_address(
+        const OrchardWalletPtr* wallet,
+        const OrchardRawAddressPtr* addr);
+
+/**
+ * Returns a pointer to the Orchard incoming viewing key corresponding to the specified
+ * raw address, if it is known to the wallet, or `nullptr` otherwise.
+ *
+ * Memory is allocated by Rust and must be manually freed using
+ * `orchard_incoming_viewing_key_free`.
+ */
+OrchardIncomingViewingKeyPtr* orchard_wallet_get_ivk_for_address(
+        const OrchardWalletPtr* wallet,
+        const OrchardRawAddressPtr* addr);
+
+/**
+ * A C struct used to transfer note metadata information across the Rust FFI boundary.
+ * This must have the same in-memory representation as the `FFINoteMetadata` type in
+ * orchard_ffi/wallet.rs.
+ */
+struct RawOrchardNoteMetadata {
+    unsigned char txid[32];
+    uint32_t actionIdx;
+    OrchardRawAddressPtr* addr;
+    CAmount noteValue;
+    unsigned char memo[512];
+};
+
+typedef void (*push_note_callback_t)(void* resultVector, const RawOrchardNoteMetadata noteMeta);
+
+/**
+ * Finds notes that belong to the wallet that were sent to addresses derived from the
+ * specified incoming viewing key, subject to the specified flags, and uses the provided
+ * callback to push RawOrchardNoteMetadata values corresponding to those notes on to the
+ * provided result vector.  Note that the push_cb callback can perform any necessary
+ * conversion from a RawOrchardNoteMetadata value in addition to modifying the provided
+ * result vector.
+ *
+ * If `ivk` is null, all notes belonging to the wallet will be returned.  The
+ * `RawOrchardNoteMetadata::addr` pointers for values provided to the callback must be
+ * manually freed by the caller.
+ */
+void orchard_wallet_get_filtered_notes(
+        const OrchardWalletPtr* wallet,
+        const OrchardIncomingViewingKeyPtr* ivk,
+        bool ignoreMined,
+        bool requireSpendingKey,
+        void* resultVector,
+        push_note_callback_t push_cb
+        );
+
+/**
+ * A C struct used to transfer Orchard action spend information across the FFI boundary.
+ * This must have the same in-memory representation as the `FFIActionSpend` type in
+ * orchard_ffi/wallet.rs.
+ */
+struct RawOrchardActionSpend {
+    uint32_t spendActionIdx;
+    unsigned char outpointTxId[32];
+    uint32_t outpointActionIdx;
+    OrchardRawAddressPtr* receivedAt;
+    CAmount noteValue;
+};
+
+/**
+ * A C struct used to transfer Orchard action output information across the FFI boundary.
+ * This must have the same in-memory representation as the `FFIActionOutput` type in
+ * orchard_ffi/wallet.rs.
+ */
+struct RawOrchardActionOutput {
+    uint32_t outputActionIdx;
+    OrchardRawAddressPtr* recipient;
+    CAmount noteValue;
+    unsigned char memo[512];
+    bool isOutgoing;
+};
+
+typedef void (*push_spend_t)(void* callbackReceiver, const RawOrchardActionSpend data);
+
+typedef void (*push_output_t)(void* callbackReceiver, const RawOrchardActionOutput data);
+
+/**
+ * Trial-decrypts the specified Orchard bundle, and uses the provided callbacks to pass
+ * `RawOrchardActionSpend` and `RawOrchardActionOutput` values (corresponding to the
+ * actions of that bundle) to the provided result receiver.
+ *
+ * Note that the callbacks can perform any necessary conversion from a
+ * `RawOrchardActionSpend` or `RawOrchardActionOutput` value in addition to modifying the
+ * provided result receiver.
+ *
+ * `raw_ovks` must be a pointer to an array of `unsigned char[32]`.
+ *
+ * The `recipient` pointer for each `RawOrchardActionOutput` value, and the `receivedAt`
+ * pointer for each `RawOrchardActionSpend` value, must be freed using
+ * `orchard_address_free`.
+ */
+bool orchard_wallet_get_txdata(
+        const OrchardWalletPtr* wallet,
+        const OrchardBundlePtr* bundle,
+        const unsigned char* raw_ovks,
+        size_t raw_ovks_len,
+        void* callbackReceiver,
+        push_spend_t push_spend_cb,
+        push_output_t push_output_cb
+        );
+
+typedef void (*push_txid_callback_t)(void* resultVector, unsigned char txid[32]);
+
+/**
+ * Returns a vector of transaction IDs for transactions that have been observed as
+ * spending the given outpoint (transaction ID and action index) by using the `push_cb`
+ * callback to push transaction IDs onto the provided result vector.
+ */
+void orchard_wallet_get_potential_spends(
+        const OrchardWalletPtr* wallet,
+        const unsigned char txid[32],
+        const uint32_t action_idx,
+        void* resultVector,
+        push_txid_callback_t push_cb
+        );
+
+/**
+ * Returns a vector of transaction IDs for transactions that have been observed as
+ * spending the given nullifier by using the `push_cb` callback to push transaction
+ * IDs onto the provided result vector.
+ */
+void orchard_wallet_get_potential_spends_from_nullifier(
+        const OrchardWalletPtr* wallet,
+        const unsigned char *nullifier,
+        void* resultVector,
+        push_txid_callback_t push_cb
+        );
+
+/**
+ * Fetches the information needed to spend the wallet note at the given outpoint,
+ * relative to the current root known to the wallet of the Orchard commitment
+ * tree.
+ *
+ * Returns `null` if the outpoint is not known to the wallet, or the Orchard
+ * bundle containing the note has not been passed to
+ * `orchard_wallet_append_bundle_commitments`.
+ */
+OrchardSpendInfoPtr* orchard_wallet_get_spend_info(
+        const OrchardWalletPtr* wallet,
+        const unsigned char txid[32],
+        uint32_t action_idx,
+        const unsigned char as_of_root[32]);
+
+/**
+ * Run the garbage collection operation on the wallet's note commitment
+ * tree.
+ */
+void orchard_wallet_gc_note_commitment_tree(OrchardWalletPtr* wallet);
+
+/**
+ * Write the wallet's note commitment tree to the provided stream.
+ */
+bool orchard_wallet_write_note_commitment_tree(
+        const OrchardWalletPtr* wallet,
+        void* stream,
+        write_callback_t write_cb);
+
+/**
+ * Read a note commitment tree from the provided stream, and update the wallet's internal
+ * note commitment tree state to equal the value that was read.
+ */
+bool orchard_wallet_load_note_commitment_tree(
+        OrchardWalletPtr* wallet,
+        void* stream,
+        read_callback_t read_cb);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // ZCASH_RUST_INCLUDE_RUST_ORCHARD_WALLET_H
+
+
diff --git a/depend/zcash/src/rust/include/rust/streams.h b/depend/zcash/src/rust/include/rust/streams.h
new file mode 100644
index 000000000..bc8a46b54
--- /dev/null
+++ b/depend/zcash/src/rust/include/rust/streams.h
@@ -0,0 +1,23 @@
+// Copyright (c) 2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_RUST_INCLUDE_RUST_STREAMS_H
+#define ZCASH_RUST_INCLUDE_RUST_STREAMS_H
+
+#include <stddef.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/// The type that Rust expects for its `CppStreamReader` callback.
+typedef long (*read_callback_t)(void* context, unsigned char* pch, size_t nSize);
+/// The type that Rust expects for its `CppStreamWriter` callback.
+typedef long (*write_callback_t)(void* context, const unsigned char* pch, size_t nSize);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // ZCASH_RUST_INCLUDE_RUST_STREAMS_H
diff --git a/depend/zcash/src/rust/include/rust/test_harness.h b/depend/zcash/src/rust/include/rust/test_harness.h
new file mode 100644
index 000000000..a14eb3495
--- /dev/null
+++ b/depend/zcash/src/rust/include/rust/test_harness.h
@@ -0,0 +1,28 @@
+// Copyright (c) 2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_RUST_INCLUDE_RUST_TEST_HARNESS_H
+#define ZCASH_RUST_INCLUDE_RUST_TEST_HARNESS_H
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/// Generates a random Jubjub base field element.
+///
+/// `ret` must point to a 32-byte array.
+void zcash_test_harness_random_jubjub_base(
+    unsigned char* ret);
+
+/// Generates a random Jubjub point.
+///
+/// `ret` must point to a 32-byte array.
+void zcash_test_harness_random_jubjub_point(
+    unsigned char* ret);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // ZCASH_RUST_INCLUDE_RUST_TEST_HARNESS_H
diff --git a/depend/zcash/src/rust/include/rust/transaction.h b/depend/zcash/src/rust/include/rust/transaction.h
new file mode 100644
index 000000000..0088a0e25
--- /dev/null
+++ b/depend/zcash/src/rust/include/rust/transaction.h
@@ -0,0 +1,68 @@
+// Copyright (c) 2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_RUST_INCLUDE_RUST_TRANSACTION_H
+#define ZCASH_RUST_INCLUDE_RUST_TRANSACTION_H
+
+#include <stddef.h>
+#include <stdint.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+struct PrecomputedTxParts;
+typedef struct PrecomputedTxParts PrecomputedTxParts;
+
+/// Calculates identifying and authorizing digests for the given transaction.
+///
+/// `txid_ret` and `authDigest_ret` must either be `nullptr` or point to a
+/// 32-byte array.
+///
+/// If either `txid_ret` or `authDigest_ret` is `nullptr`, the corresponding
+/// digest will not be calculated.
+///
+/// Returns `false` if the transaction is invalid.
+bool zcash_transaction_digests(
+    const unsigned char* txBytes,
+    size_t txBytes_len,
+    unsigned char* txid_ret,
+    unsigned char* authDigest_ret);
+
+/// Precomputes data for calculating signature digests from the given
+/// transaction.
+///
+/// Please free this with `zcash_transaction_precomputed_free` when you are
+/// done.
+///
+/// Returns `nullptr` if the transaction is invalid, or a v1-v4 transaction format.
+PrecomputedTxParts* zcash_transaction_precomputed_init(
+    const unsigned char* txBytes,
+    size_t txBytes_len,
+    const unsigned char* allPrevOutputs,
+    size_t allPrevOutputsLen);
+
+/// Frees a precomputed transaction from `zcash_transaction_precomputed_init`.
+void zcash_transaction_precomputed_free(PrecomputedTxParts* preTx);
+
+/// Calculates a ZIP 244 signature digest for the given transaction.
+///
+/// `index` must be an index into the transaction's `vin`, or `NOT_AN_INPUT` for
+/// calculating the signature digest for shielded signatures.
+///
+/// `sighash_ret` must point to a 32-byte array.
+///
+/// Returns `false` if any of the parameters are invalid; in this case,
+/// `sighash_ret` will be unaltered.
+bool zcash_transaction_zip244_signature_digest(
+    const PrecomputedTxParts* preTx,
+    uint32_t sighashType,
+    size_t index,
+    unsigned char* sighash_ret);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // ZCASH_RUST_INCLUDE_RUST_TRANSACTION_H
diff --git a/depend/zcash/src/rust/include/rust/types.h b/depend/zcash/src/rust/include/rust/types.h
new file mode 100644
index 000000000..7622cb603
--- /dev/null
+++ b/depend/zcash/src/rust/include/rust/types.h
@@ -0,0 +1,16 @@
+// Copyright (c) 2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_RUST_INCLUDE_RUST_TYPES_H
+#define ZCASH_RUST_INCLUDE_RUST_TYPES_H
+
+#include <stdint.h>
+
+#ifdef WIN32
+typedef uint16_t codeunit;
+#else
+typedef uint8_t codeunit;
+#endif
+
+#endif // ZCASH_RUST_INCLUDE_RUST_TYPES_H
diff --git a/depend/zcash/src/rust/include/rust/unified_keys.h b/depend/zcash/src/rust/include/rust/unified_keys.h
new file mode 100644
index 000000000..d485f3fae
--- /dev/null
+++ b/depend/zcash/src/rust/include/rust/unified_keys.h
@@ -0,0 +1,144 @@
+// Copyright (c) 2021 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_RUST_INCLUDE_RUST_UNIFIED_KEYS_H
+#define ZCASH_RUST_INCLUDE_RUST_UNIFIED_KEYS_H
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+//
+// Unified full viewing keys
+//
+
+/**
+ * Void pointer type representing a reference to a Rust-allocated
+ * unified::Ufvk value
+ */
+struct UnifiedFullViewingKeyPtr;
+typedef struct UnifiedFullViewingKeyPtr UnifiedFullViewingKeyPtr;
+
+/**
+ * Free the memory allocated for the given address::unified::Ufvk;
+ */
+void unified_full_viewing_key_free(UnifiedFullViewingKeyPtr* ptr);
+
+/**
+ * Clones the given Unified full viewing key and returns
+ * a pointer to the newly created value. Both the original
+ * one's memory and the newly allocated one need to be freed
+ * independently.
+ */
+UnifiedFullViewingKeyPtr* unified_full_viewing_key_clone(
+        const UnifiedFullViewingKeyPtr* ptr);
+
+/**
+ * Parses a unified full viewing key from the given string.
+ *
+ * - If the key does not parse correctly, or the network for which the
+ *   key was encoded does not match the specified network the returned
+ *   pointer will be null.
+ */
+UnifiedFullViewingKeyPtr* unified_full_viewing_key_parse(
+    const char* network,
+    const char* str);
+
+/**
+ * Serializes a unified full viewing key and returns its string representation.
+ *
+ * The returned string's memory must be freed by the caller using
+ * `zcash_address_string_free`.
+ */
+char* unified_full_viewing_key_serialize(
+    const char* network,
+    const UnifiedFullViewingKeyPtr* full_viewing_key);
+
+/**
+ * Reads the transparent component of a unified full viewing key.
+ *
+ * `tkeyout` must be of length 65.
+ *
+ * Returns `true` if the UFVK contained a transparent component, `false`
+ * otherwise. If this returns `true`, the transparent key will be copied to
+ * `tkeyout` as the byte representation of the `(ChainCode, CPubKey)` pair.
+ * If it returns `false` then `tkeyout` will be unchanged.
+ */
+bool unified_full_viewing_key_read_transparent(
+    const UnifiedFullViewingKeyPtr* full_viewing_key,
+    unsigned char* tkeyout);
+
+/**
+ * Reads the Sapling component of a unified full viewing key.
+ *
+ * `skeyout` must be of length 128.
+ *
+ * Returns `true` if the UFVK contained a Sapling component,
+ * `false` otherwise. The bytes of the `(ak, nk, ovk, dk)` fields
+ * of the viewing key, in the encoding given by `EncodeExtFVKParts`
+ * defined in ZIP 32, will be copied to `skeyout` if `true` is returned.
+ * If `false` is returned then `skeyout` will be unchanged.
+ */
+bool unified_full_viewing_key_read_sapling(
+    const UnifiedFullViewingKeyPtr* full_viewing_key,
+    unsigned char* skeyout);
+
+/**
+ * Reads the Orchard component of a unified full viewing key.
+ *
+ * `skeyout` must be of length 96.
+ *
+ * Returns `true` if the UFVK contained an Orchard component, `false` otherwise.
+ * The bytes of the Orchard Raw Full Viewing Key, in the encoding given in
+ * section 5.6.4.4 of the Zcash Protocol Specification, will be copied to
+ * `skeyout` if `true` is returned.
+ *
+ * If `false` is returned then `skeyout` will be unchanged.
+ */
+bool unified_full_viewing_key_read_orchard(
+    const UnifiedFullViewingKeyPtr* full_viewing_key,
+    unsigned char* skeyout);
+
+/**
+ * Constructs a unified full viewing key from the binary encodings
+ * of its constituent parts.
+ *
+ * If `t_key` is not `null`, it must be of length 65 and must be the concatenated
+ * bytes of the serialized `(ChainCode, CPubKey)` pair.
+ *
+ * If `sapling_key` is not `null`, it must be of length 128 and must be the concatenated
+ * bytes of the `(ak, nk, ovk, dk)` fields in the encoding given by
+ * `EncodeExtFVKParts` defined in ZIP 32.
+ *
+ * Returns a pointer to newly allocated UFVK if the operation succeeds,
+ * or the null pointer otherwise. The pointer returned by this function
+ * must be freed by the caller with `unified_full_viewing_key_free`.
+ */
+UnifiedFullViewingKeyPtr* unified_full_viewing_key_from_components(
+    const unsigned char* t_key,
+    const unsigned char* sapling_key,
+    const unsigned char* orchard_key);
+
+/**
+ * Derive the internal and external OVKs for the binary encoding
+ * of a transparent FVK (the concatenated bytes of the serialized
+ * `(ChainCode, CPubKey)` pair.)
+ *
+ * Returns `true` if `t_key` was successfully deserialized,
+ * in which case `internal_ovk_ret` and `external_ovk_ret` (which
+ * should both point to 32-byte arrays) will have been updated
+ * with the appropriate key bytes; otherwise, this procedure
+ * returns `false` and the return values are unmodified.
+ */
+bool transparent_key_ovks(
+    const unsigned char* t_key,
+    unsigned char* internal_ovk_ret,
+    unsigned char* external_ovk_ret);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // ZCASH_RUST_INCLUDE_RUST_UNIFIED_KEYS_H
+
diff --git a/depend/zcash/src/rust/include/rust/zip339.h b/depend/zcash/src/rust/include/rust/zip339.h
new file mode 100644
index 000000000..fa5b0d378
--- /dev/null
+++ b/depend/zcash/src/rust/include/rust/zip339.h
@@ -0,0 +1,59 @@
+#ifndef ZCASH_RUST_INCLUDE_RUST_ZIP339_H
+#define ZCASH_RUST_INCLUDE_RUST_ZIP339_H
+
+#include "rust/types.h"
+
+#include <stddef.h>
+#include <stdint.h>
+
+#ifndef __cplusplus
+  #include <assert.h>
+#endif
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+    // These must match src/rust/src/zip339_ffi.rs.
+    // (They happen to also match the integer values correspond in the bip0039-rs crate with the
+    // "all-languages" feature enabled, but that's not required.)
+    enum Language
+#ifdef __cplusplus
+    : uint32_t
+#endif
+    {
+        English = 0,
+        SimplifiedChinese = 1,
+        TraditionalChinese = 2,
+        Czech = 3,
+        French = 4,
+        Italian = 5,
+        Japanese = 6,
+        Korean = 7,
+        Portuguese = 8,
+        Spanish = 9,
+        SIZE_HACK = 0xFFFFFFFF // needed when compiling as C
+    };
+
+    static_assert(sizeof(Language) == 4);
+
+    /// Creates a phrase with the given entropy, in the given `Language`. The phrase is represented as
+    /// a pointer to a null-terminated C string that must not be written to, and must be freed by
+    /// `zip339_free_phrase`.
+    const char * zip339_entropy_to_phrase(Language language, const uint8_t *entropy, size_t entropy_len);
+
+    /// Frees a phrase returned by `zip339_entropy_to_phrase`.
+    void zip339_free_phrase(const char *phrase);
+
+    /// Returns `true` if the given string is a valid mnemonic phrase in the given `Language`.
+    bool zip339_validate_phrase(Language language, const char *phrase);
+
+    /// Copies the seed for the given phrase into the 64-byte buffer `buf`.
+    /// Returns true if successful, false on error. In case of error, `buf` is zeroed.
+    bool zip339_phrase_to_seed(Language language, const char *phrase, uint8_t (*buf)[64]);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // ZCASH_RUST_INCLUDE_RUST_ZIP339_H
diff --git a/depend/zcash/src/rust/include/tracing.h b/depend/zcash/src/rust/include/tracing.h
new file mode 100644
index 000000000..28e647281
--- /dev/null
+++ b/depend/zcash/src/rust/include/tracing.h
@@ -0,0 +1,316 @@
+// Copyright (c) 2020-2021 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_RUST_INCLUDE_TRACING_H
+#define ZCASH_RUST_INCLUDE_TRACING_H
+
+#include "rust/helpers.h"
+#include "rust/types.h"
+
+#include <stddef.h>
+#include <stdint.h>
+
+#ifdef __cplusplus
+#include <memory>
+
+extern "C" {
+#endif
+
+struct TracingHandle;
+typedef struct TracingHandle TracingHandle;
+
+/// Initializes the tracing crate, returning a handle for the logging
+/// component. The handle must be freed to close the logging component.
+///
+/// If log_path is NULL, logging is sent to standard output.
+TracingHandle* tracing_init(
+    const codeunit* log_path,
+    size_t log_path_len,
+    const char* initial_filter,
+    bool log_timestamps);
+
+/// Initializes the tracing crate for use in tests, returning a handle for the
+/// logging component. The handle must be freed to close the logging component.
+///
+/// `log_path` is the path to a file that logs will be written to, and must not
+/// be NULL. Logs are written synchronously to avoid non-determinism in tests.
+TracingHandle* tracing_init_test(
+    const codeunit* log_path,
+    size_t log_path_len,
+    const char* initial_filter);
+
+/// Frees a tracing handle returned from `tracing_init`;
+void tracing_free(TracingHandle* handle);
+
+/// Reloads the tracing filter.
+///
+/// Returns `true` if the reload succeeded.
+bool tracing_reload(TracingHandle* handle, const char* new_filter);
+
+struct TracingCallsite;
+typedef struct TracingCallsite TracingCallsite;
+
+/// Creates a tracing callsite.
+///
+/// You should usually call the `TracingLog` macro (or one of the helper
+/// macros such as `TracingInfo`) instead of calling this directly.
+///
+/// This MUST ONLY be called to assign a `static TracingCallsite*`, and all
+/// string arguments MUST be static `const char*` constants, and MUST be valid
+/// UTF-8.
+TracingCallsite* tracing_callsite(
+    const char* name,
+    const char* target,
+    const char* level,
+    const char* file,
+    uint32_t line,
+    const char* const* fields,
+    size_t fields_len,
+    bool is_span);
+
+struct TracingSpanHandle;
+typedef struct TracingSpanHandle TracingSpanHandle;
+
+struct TracingSpanGuard;
+typedef struct TracingSpanGuard TracingSpanGuard;
+
+/// Creates a span for a callsite.
+///
+/// The span must be freed when it goes out of scope.
+TracingSpanHandle* tracing_span_create(
+    const TracingCallsite* callsite,
+    const char* const* field_values,
+    size_t fields_len);
+
+/// Clones the given span.
+///
+/// Both spans need to be separately freed when they go out of scope.
+TracingSpanHandle* tracing_span_clone(const TracingSpanHandle* span);
+
+/// Frees a span.
+void tracing_span_free(TracingSpanHandle* span);
+
+/// Enters the given span, returning a guard.
+///
+/// `tracing_span_exit` must be called to drop this guard before the span
+/// goes out of scope.
+TracingSpanGuard* tracing_span_enter(const TracingSpanHandle* span);
+
+/// Exits a span by dropping the given guard.
+void tracing_span_exit(TracingSpanGuard* guard);
+
+/// Logs a message for a callsite.
+///
+/// You should usually call the `TracingLog` macro (or one of the helper
+/// macros such as `TracingInfo`) instead of calling this directly.
+void tracing_log(
+    const TracingCallsite* callsite,
+    const char* const* field_values,
+    size_t fields_len);
+
+#ifdef __cplusplus
+}
+#endif
+
+//
+// Helper macros
+//
+
+#ifdef __cplusplus
+// Constructs a tracing callsite.
+//
+// The 'static constexpr' hack ensures that name, target, level, and fields are
+// compile-time constants with static storage duration. The output of this macro
+// MUST be stored as a static TracingCallsite*.
+#define T_CALLSITE(name, target, level, fields, is_span) ([&] { \
+    static constexpr const char* _t_name = name;                \
+    static constexpr const char* _t_target = target;            \
+    static constexpr const char* _t_level = level;              \
+    static constexpr const char* const* _t_fields = fields;     \
+    return tracing_callsite(                                    \
+        _t_name,                                                \
+        _t_target,                                              \
+        _t_level,                                               \
+        __FILE__,                                               \
+        __LINE__,                                               \
+        _t_fields,                                              \
+        T_ARRLEN(fields),                                       \
+        is_span);                                               \
+}())
+#else
+// Constructs a tracing callsite.
+//
+// name, target, level, and fields MUST be static constants, and the output of
+// this macro MUST be stored as a static TracingCallsite*.
+#define T_CALLSITE(name, target, level, fields, is_span) \
+    tracing_callsite(                                    \
+        name,                                            \
+        target,                                          \
+        level,                                           \
+        __FILE__,                                        \
+        __LINE__,                                        \
+        fields,                                          \
+        T_ARRLEN(fields),                                \
+        is_span)
+#endif
+
+//
+// Spans
+//
+
+#ifdef __cplusplus
+namespace tracing
+{
+class Span;
+
+/// A guard representing a span which has been entered and is currently
+/// executing.
+///
+/// When the guard is dropped, the span will be exited.
+///
+/// This is returned by the `Span::Enter` function.
+class Entered
+{
+private:
+    friend class Span;
+    std::unique_ptr<TracingSpanGuard, decltype(&tracing_span_exit)> inner;
+
+    Entered(const TracingSpanHandle* span) : inner(tracing_span_enter(span), tracing_span_exit) {}
+};
+
+/// A handle representing a span, with the capability to enter the span if it
+/// exists.
+///
+/// If the span was rejected by the current `Subscriber`'s filter, entering the
+/// span will silently do nothing. Thus, the handle can be used in the same
+/// manner regardless of whether or not the trace is currently being collected.
+class Span
+{
+private:
+    std::unique_ptr<TracingSpanHandle, decltype(&tracing_span_free)> inner;
+
+public:
+    /// Constructs a span that does nothing.
+    ///
+    /// This constructor is present to enable spans to be stored in classes,
+    /// while also containing fields that are initialized within the class
+    /// constructor:
+    ///
+    ///     class Foo {
+    ///         std::string name;
+    ///         tracing::Span span;
+    ///
+    ///         Foo(std::string tag)
+    ///         {
+    ///             name = "Foo-" + tag;
+    ///             span = TracingSpan("info", "main", "Foo", "name", name);
+    ///         }
+    ///     }
+    Span() : inner(nullptr, tracing_span_free) {}
+
+    /// Use the `TracingSpan` macro instead of calling this constructor directly.
+    Span(const TracingCallsite* callsite, const char* const* field_values, size_t fields_len) : inner(tracing_span_create(callsite, field_values, fields_len), tracing_span_free) {}
+
+    Span(Span&& span) : inner(std::move(span.inner)) {}
+    Span(const Span& span) : inner(tracing_span_clone(span.inner.get()), tracing_span_free) {}
+    Span& operator=(Span&& span)
+    {
+        if (this != &span) {
+            inner = std::move(span.inner);
+        }
+        return *this;
+    }
+    Span& operator=(const Span& span)
+    {
+        if (this != &span) {
+            inner.reset(tracing_span_clone(span.inner.get()));
+        }
+        return *this;
+    }
+
+    /// Enters this span, returning a guard that will exit the span when dropped.
+    ///
+    /// If this span is enabled by the current subscriber, then this function
+    /// will call `Subscriber::enter` with the span's `Id`, and dropping the
+    /// guard will call `Subscriber::exit`. If the span is disabled, this does
+    /// nothing.
+    Entered Enter()
+    {
+        return Entered(inner.get());
+    }
+};
+} // namespace tracing
+
+/// Expands to a `tracing::Span` object which is used to record a span.
+/// The `Span::Enter` method on that object records that the span has been
+/// entered, and returns a RAII guard object, which will exit the span when
+/// dropped.
+///
+/// Arguments: (level, target, name, key, value[, key2, value2, ...])
+///
+/// level, target, name, and all keys MUST be static constants, and MUST be
+/// valid UTF-8 strings.
+#define TracingSpan(level, target, name, ...) ([&] {   \
+    static constexpr const char* const FIELDS[] =      \
+        {T_FIELD_NAMES(__VA_ARGS__)};                  \
+    const char* T_VALUES[] =                           \
+        {T_FIELD_VALUES(__VA_ARGS__)};                 \
+    static TracingCallsite* CALLSITE =                 \
+        T_CALLSITE(name, target, level, FIELDS, true); \
+    return tracing::Span(                              \
+        CALLSITE, T_VALUES, T_ARRLEN(T_VALUES));       \
+}())
+#endif
+
+//
+// Events
+//
+
+/// Constructs a new event.
+///
+/// level and target MUST be static constants, and MUST be valid UTF-8 strings.
+#define TracingLog(level, target, ...)                       \
+    do {                                                     \
+        static constexpr const char* const FIELDS[] =        \
+            {T_FIELD_NAMES("message", __VA_ARGS__)};         \
+        const char* T_VALUES[] =                             \
+            {T_FIELD_VALUES("message", __VA_ARGS__)};        \
+        static TracingCallsite* CALLSITE = T_CALLSITE(       \
+            "event " __FILE__ ":" T_ESCAPEQUOTE(__LINE__),   \
+            target, level, FIELDS, false);                   \
+        tracing_log(CALLSITE, T_VALUES, T_ARRLEN(T_VALUES)); \
+    } while (0)
+
+/// Constructs an event at the error level.
+///
+/// Arguments: (target, message)
+///
+/// target MUST be a static constant, and MUST be valid UTF-8 string.
+#define TracingError(...) TracingLog("error", __VA_ARGS__)
+/// Constructs an event at the warn level.
+///
+/// Arguments: (target, message)
+///
+/// target MUST be a static constant, and MUST be valid UTF-8 string.
+#define TracingWarn(...) TracingLog("warn", __VA_ARGS__)
+/// Constructs an event at the info level.
+///
+/// Arguments: (target, message)
+///
+/// target MUST be a static constant, and MUST be valid UTF-8 string.
+#define TracingInfo(...) TracingLog("info", __VA_ARGS__)
+/// Constructs an event at the debug level.
+///
+/// Arguments: (target, message)
+///
+/// target MUST be a static constant, and MUST be valid UTF-8 string.
+#define TracingDebug(...) TracingLog("debug", __VA_ARGS__)
+/// Constructs an event at the trace level.
+///
+/// Arguments: (target, message)
+///
+/// target MUST be a static constant, and MUST be valid UTF-8 string.
+#define TracingTrace(...) TracingLog("trace", __VA_ARGS__)
+
+#endif // ZCASH_RUST_INCLUDE_TRACING_H
diff --git a/depend/zcash/src/rust/src/address_ffi.rs b/depend/zcash/src/rust/src/address_ffi.rs
new file mode 100644
index 000000000..83118a373
--- /dev/null
+++ b/depend/zcash/src/rust/src/address_ffi.rs
@@ -0,0 +1,231 @@
+use std::{
+    convert::TryInto,
+    ffi::{CStr, CString},
+    ptr::{self, NonNull},
+};
+
+use libc::{c_char, c_void};
+use zcash_address::{
+    unified::{self, Container, Encoding},
+    FromAddress, Network, ToAddress, ZcashAddress,
+};
+use zcash_primitives::sapling;
+
+pub type UnifiedAddressObj = NonNull<c_void>;
+pub type AddOrchardReceiverCb =
+    unsafe extern "C" fn(ua: Option<UnifiedAddressObj>, orchard: *const orchard::Address) -> bool;
+pub type AddReceiverCb =
+    unsafe extern "C" fn(ua: Option<UnifiedAddressObj>, raw: *const u8) -> bool;
+pub type UnknownReceiverCb = unsafe extern "C" fn(
+    ua: Option<UnifiedAddressObj>,
+    typecode: u32,
+    data: *const u8,
+    len: usize,
+) -> bool;
+pub type GetTypecodeCb = unsafe extern "C" fn(ua: Option<UnifiedAddressObj>, index: usize) -> u32;
+pub type GetReceiverLenCb =
+    unsafe extern "C" fn(ua: Option<UnifiedAddressObj>, index: usize) -> usize;
+pub type GetReceiverDataCb =
+    unsafe extern "C" fn(ua: Option<UnifiedAddressObj>, index: usize, data: *mut u8, length: usize);
+
+pub(crate) fn network_from_cstr(network: *const c_char) -> Option<Network> {
+    match unsafe { CStr::from_ptr(network) }.to_str().unwrap() {
+        "main" => Some(Network::Main),
+        "test" => Some(Network::Test),
+        "regtest" => Some(Network::Regtest),
+        s => {
+            tracing::error!("Unsupported network type string '{}'", s);
+            None
+        }
+    }
+}
+
+struct UnifiedAddressHelper {
+    net: Network,
+    ua: unified::Address,
+}
+
+impl FromAddress for UnifiedAddressHelper {
+    fn from_unified(
+        net: Network,
+        ua: unified::Address,
+    ) -> Result<Self, zcash_address::UnsupportedAddress> {
+        Ok(Self { net, ua })
+    }
+}
+
+impl UnifiedAddressHelper {
+    #[allow(clippy::too_many_arguments)]
+    fn into_cpp(
+        self,
+        network: Network,
+        ua_obj: Option<UnifiedAddressObj>,
+        orchard_cb: Option<AddOrchardReceiverCb>,
+        sapling_cb: Option<AddReceiverCb>,
+        p2sh_cb: Option<AddReceiverCb>,
+        p2pkh_cb: Option<AddReceiverCb>,
+        unknown_cb: Option<UnknownReceiverCb>,
+    ) -> bool {
+        if self.net != network {
+            tracing::error!(
+                "Unified Address is for {:?} but node is on {:?}",
+                self.net,
+                network
+            );
+            return false;
+        }
+
+        self.ua
+            .items()
+            .into_iter()
+            .map(|receiver| match receiver {
+                unified::Receiver::Orchard(data) => {
+                    // ZIP 316: Consumers MUST reject Unified Addresses/Viewing Keys in
+                    // which any constituent Item does not meet the validation
+                    // requirements of its encoding.
+                    let addr = orchard::Address::from_raw_address_bytes(&data);
+                    if addr.is_none().into() {
+                        tracing::error!("Unified Address contains invalid Orchard receiver");
+                        false
+                    } else {
+                        unsafe {
+                            (orchard_cb.unwrap())(ua_obj, Box::into_raw(Box::new(addr.unwrap())))
+                        }
+                    }
+                }
+                unified::Receiver::Sapling(data) => {
+                    // ZIP 316: Consumers MUST reject Unified Addresses/Viewing Keys in
+                    // which any constituent Item does not meet the validation
+                    // requirements of its encoding.
+                    if sapling::PaymentAddress::from_bytes(&data).is_none() {
+                        tracing::error!("Unified Address contains invalid Sapling receiver");
+                        false
+                    } else {
+                        unsafe { (sapling_cb.unwrap())(ua_obj, data.as_ptr()) }
+                    }
+                }
+                unified::Receiver::P2sh(data) => unsafe {
+                    (p2sh_cb.unwrap())(ua_obj, data.as_ptr())
+                },
+                unified::Receiver::P2pkh(data) => unsafe {
+                    (p2pkh_cb.unwrap())(ua_obj, data.as_ptr())
+                },
+                unified::Receiver::Unknown { typecode, data } => unsafe {
+                    (unknown_cb.unwrap())(ua_obj, typecode, data.as_ptr(), data.len())
+                },
+            })
+            .all(|b| b)
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn zcash_address_parse_unified(
+    encoded: *const c_char,
+    network: *const c_char,
+    ua_obj: Option<UnifiedAddressObj>,
+    orchard_cb: Option<AddOrchardReceiverCb>,
+    sapling_cb: Option<AddReceiverCb>,
+    p2sh_cb: Option<AddReceiverCb>,
+    p2pkh_cb: Option<AddReceiverCb>,
+    unknown_cb: Option<UnknownReceiverCb>,
+) -> bool {
+    let network = match network_from_cstr(network) {
+        Some(net) => net,
+        None => return false,
+    };
+    let encoded = unsafe { CStr::from_ptr(encoded) }.to_str().unwrap();
+
+    let addr = match ZcashAddress::try_from_encoded(encoded) {
+        Ok(addr) => addr,
+        Err(e) => {
+            tracing::error!("{}", e);
+            return false;
+        }
+    };
+
+    let ua: UnifiedAddressHelper = match addr.convert() {
+        Ok(ua) => ua,
+        Err(_) => {
+            // `KeyIO::DecodePaymentAddress` handles the rest of the address kinds.
+            return false;
+        }
+    };
+
+    ua.into_cpp(
+        network, ua_obj, orchard_cb, sapling_cb, p2sh_cb, p2pkh_cb, unknown_cb,
+    )
+}
+
+#[no_mangle]
+pub extern "C" fn zcash_address_serialize_unified(
+    network: *const c_char,
+    ua_obj: Option<UnifiedAddressObj>,
+    receivers_len: usize,
+    typecode_cb: Option<GetTypecodeCb>,
+    receiver_len_cb: Option<GetReceiverLenCb>,
+    receiver_cb: Option<GetReceiverDataCb>,
+) -> *mut c_char {
+    let network = match network_from_cstr(network) {
+        Some(net) => net,
+        None => return ptr::null_mut(),
+    };
+
+    let receivers: Vec<unified::Receiver> = match (0..receivers_len)
+        .map(|i| {
+            Ok(
+                match unsafe { (typecode_cb.unwrap())(ua_obj, i) }.try_into()? {
+                    unified::Typecode::Orchard => {
+                        let mut data = [0; 43];
+                        unsafe { (receiver_cb.unwrap())(ua_obj, i, data.as_mut_ptr(), data.len()) };
+                        unified::Receiver::Orchard(data)
+                    }
+                    unified::Typecode::Sapling => {
+                        let mut data = [0; 43];
+                        unsafe { (receiver_cb.unwrap())(ua_obj, i, data.as_mut_ptr(), data.len()) };
+                        unified::Receiver::Sapling(data)
+                    }
+                    unified::Typecode::P2sh => {
+                        let mut data = [0; 20];
+                        unsafe { (receiver_cb.unwrap())(ua_obj, i, data.as_mut_ptr(), data.len()) };
+                        unified::Receiver::P2sh(data)
+                    }
+                    unified::Typecode::P2pkh => {
+                        let mut data = [0; 20];
+                        unsafe { (receiver_cb.unwrap())(ua_obj, i, data.as_mut_ptr(), data.len()) };
+                        unified::Receiver::P2pkh(data)
+                    }
+                    unified::Typecode::Unknown(typecode) => {
+                        let data_len = unsafe { (receiver_len_cb.unwrap())(ua_obj, i) };
+                        let mut data = vec![0; data_len];
+                        unsafe { (receiver_cb.unwrap())(ua_obj, i, data.as_mut_ptr(), data_len) };
+                        unified::Receiver::Unknown { typecode, data }
+                    }
+                },
+            )
+        })
+        .collect::<Result<_, unified::ParseError>>()
+    {
+        Ok(receivers) => receivers,
+        Err(e) => {
+            tracing::error!("{}", e);
+            return ptr::null_mut();
+        }
+    };
+
+    let ua = match unified::Address::try_from_items(receivers) {
+        Ok(ua) => ua,
+        Err(e) => {
+            tracing::error!("{}", e);
+            return ptr::null_mut();
+        }
+    };
+
+    let addr = ZcashAddress::from_unified(network, ua);
+
+    CString::new(addr.to_string()).unwrap().into_raw()
+}
+
+#[no_mangle]
+pub extern "C" fn zcash_address_string_free(encoded: *mut c_char) {
+    let _ = unsafe { CString::from_raw(encoded) };
+}
diff --git a/depend/zcash/src/rust/src/blake2b.rs b/depend/zcash/src/rust/src/blake2b.rs
new file mode 100644
index 000000000..b389631be
--- /dev/null
+++ b/depend/zcash/src/rust/src/blake2b.rs
@@ -0,0 +1,56 @@
+// Copyright (c) 2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+use blake2b_simd::{State, PERSONALBYTES};
+use libc::{c_uchar, size_t};
+use std::ptr;
+use std::slice;
+
+#[no_mangle]
+pub extern "C" fn blake2b_init(
+    output_len: size_t,
+    personalization: *const [c_uchar; PERSONALBYTES],
+) -> *mut State {
+    let personalization = unsafe { personalization.as_ref().unwrap() };
+
+    Box::into_raw(Box::new(
+        blake2b_simd::Params::new()
+            .hash_length(output_len)
+            .personal(personalization)
+            .to_state(),
+    ))
+}
+
+#[no_mangle]
+pub extern "C" fn blake2b_clone(state: *const State) -> *mut State {
+    unsafe { state.as_ref() }
+        .map(|state| Box::into_raw(Box::new(state.clone())))
+        .unwrap_or(ptr::null_mut())
+}
+
+#[no_mangle]
+pub extern "C" fn blake2b_free(state: *mut State) {
+    if !state.is_null() {
+        drop(unsafe { Box::from_raw(state) });
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn blake2b_update(state: *mut State, input: *const c_uchar, input_len: size_t) {
+    let state = unsafe { state.as_mut().unwrap() };
+    let input = unsafe { slice::from_raw_parts(input, input_len) };
+
+    state.update(input);
+}
+
+#[no_mangle]
+pub extern "C" fn blake2b_finalize(state: *mut State, output: *mut c_uchar, output_len: size_t) {
+    let state = unsafe { state.as_mut().unwrap() };
+    let output = unsafe { slice::from_raw_parts_mut(output, output_len) };
+
+    // Allow consuming only part of the output.
+    let hash = state.finalize();
+    assert!(output_len <= hash.as_bytes().len());
+    output.copy_from_slice(&hash.as_bytes()[..output_len]);
+}
diff --git a/depend/zcash/src/rust/src/builder_ffi.rs b/depend/zcash/src/rust/src/builder_ffi.rs
new file mode 100644
index 000000000..5e3c4ab12
--- /dev/null
+++ b/depend/zcash/src/rust/src/builder_ffi.rs
@@ -0,0 +1,232 @@
+use std::convert::TryInto;
+use std::ptr;
+use std::slice;
+
+use incrementalmerkletree::Hashable;
+use libc::size_t;
+use orchard::keys::SpendingKey;
+use orchard::{
+    builder::{Builder, InProgress, Unauthorized, Unproven},
+    bundle::{Authorized, Flags},
+    keys::{FullViewingKey, OutgoingViewingKey},
+    tree::{MerkleHashOrchard, MerklePath},
+    value::NoteValue,
+    Bundle, Note,
+};
+use rand_core::OsRng;
+use tracing::error;
+use zcash_primitives::transaction::{
+    components::{sapling, Amount},
+    sighash::SignableInput,
+    sighash_v5::v5_signature_hash,
+    txid::TxIdDigester,
+    Authorization, TransactionData, TxVersion,
+};
+
+use crate::{
+    transaction_ffi::{PrecomputedTxParts, TransparentAuth},
+    ORCHARD_PK,
+};
+
+pub struct OrchardSpendInfo {
+    fvk: FullViewingKey,
+    note: Note,
+    merkle_path: MerklePath,
+}
+
+impl OrchardSpendInfo {
+    pub fn from_parts(fvk: FullViewingKey, note: Note, merkle_path: MerklePath) -> Self {
+        OrchardSpendInfo {
+            fvk,
+            note,
+            merkle_path,
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_spend_info_free(spend_info: *mut OrchardSpendInfo) {
+    if !spend_info.is_null() {
+        drop(unsafe { Box::from_raw(spend_info) });
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_builder_new(
+    spends_enabled: bool,
+    outputs_enabled: bool,
+    anchor: *const [u8; 32],
+) -> *mut Builder {
+    let anchor = unsafe { anchor.as_ref() }
+        .map(|a| orchard::Anchor::from_bytes(*a).unwrap())
+        .unwrap_or_else(|| MerkleHashOrchard::empty_root(32.into()).into());
+    Box::into_raw(Box::new(Builder::new(
+        Flags::from_parts(spends_enabled, outputs_enabled),
+        anchor,
+    )))
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_builder_add_spend(
+    builder: *mut Builder,
+    orchard_spend_info: *mut OrchardSpendInfo,
+) -> bool {
+    let builder = unsafe { builder.as_mut() }.expect("Builder may not be null.");
+    let orchard_spend_info = unsafe { Box::from_raw(orchard_spend_info) };
+
+    match builder.add_spend(
+        orchard_spend_info.fvk,
+        orchard_spend_info.note,
+        orchard_spend_info.merkle_path,
+    ) {
+        Ok(()) => true,
+        Err(e) => {
+            error!("Failed to add Orchard spend: {}", e);
+            false
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_builder_add_recipient(
+    builder: *mut Builder,
+    ovk: *const [u8; 32],
+    recipient: *const orchard::Address,
+    value: u64,
+    memo: *const [u8; 512],
+) -> bool {
+    let builder = unsafe { builder.as_mut() }.expect("Builder may not be null.");
+    let ovk = unsafe { ovk.as_ref() }
+        .copied()
+        .map(OutgoingViewingKey::from);
+    let recipient = unsafe { recipient.as_ref() }.expect("Recipient may not be null.");
+    let value = NoteValue::from_raw(value);
+    let memo = unsafe { memo.as_ref() }.copied();
+
+    match builder.add_recipient(ovk, *recipient, value, memo) {
+        Ok(()) => true,
+        Err(e) => {
+            error!("Failed to add Orchard recipient: {}", e);
+            false
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_builder_free(builder: *mut Builder) {
+    if !builder.is_null() {
+        drop(unsafe { Box::from_raw(builder) });
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_builder_build(
+    builder: *mut Builder,
+) -> *mut Bundle<InProgress<Unproven, Unauthorized>, Amount> {
+    if builder.is_null() {
+        error!("Called with null builder");
+        return ptr::null_mut();
+    }
+    let builder = unsafe { Box::from_raw(builder) };
+
+    match builder.build(OsRng) {
+        Ok(bundle) => Box::into_raw(Box::new(bundle)),
+        Err(e) => {
+            error!("Failed to build Orchard bundle: {:?}", e);
+            ptr::null_mut()
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_unauthorized_bundle_free(
+    bundle: *mut Bundle<InProgress<Unproven, Unauthorized>, Amount>,
+) {
+    if !bundle.is_null() {
+        drop(unsafe { Box::from_raw(bundle) });
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_unauthorized_bundle_prove_and_sign(
+    bundle: *mut Bundle<InProgress<Unproven, Unauthorized>, Amount>,
+    keys: *const *const SpendingKey,
+    keys_len: size_t,
+    sighash: *const [u8; 32],
+) -> *mut Bundle<Authorized, Amount> {
+    let bundle = unsafe { Box::from_raw(bundle) };
+    let keys = unsafe { slice::from_raw_parts(keys, keys_len) };
+    let sighash = unsafe { sighash.as_ref() }.expect("sighash pointer may not be null.");
+    let pk = unsafe { ORCHARD_PK.as_ref() }.unwrap();
+
+    let signing_keys = keys
+        .iter()
+        .map(|sk| {
+            unsafe { sk.as_ref() }
+                .expect("SpendingKey pointers must not be null")
+                .into()
+        })
+        .collect::<Vec<_>>();
+
+    let mut rng = OsRng;
+    let res = bundle
+        .create_proof(pk, &mut rng)
+        .and_then(|b| b.apply_signatures(&mut rng, *sighash, &signing_keys));
+
+    match res {
+        Ok(signed) => Box::into_raw(Box::new(signed)),
+        Err(e) => {
+            error!(
+                "An error occurred while authorizing the orchard bundle: {:?}",
+                e
+            );
+            std::ptr::null_mut()
+        }
+    }
+}
+
+/// Calculates a ZIP 244 shielded signature digest for the given under-construction
+/// transaction.
+///
+/// Returns `false` if any of the parameters are invalid; in this case, `sighash_ret`
+/// will be unaltered.
+#[no_mangle]
+pub extern "C" fn zcash_builder_zip244_shielded_signature_digest(
+    precomputed_tx: *mut PrecomputedTxParts,
+    bundle: *const Bundle<InProgress<Unproven, Unauthorized>, Amount>,
+    sighash_ret: *mut [u8; 32],
+) -> bool {
+    let precomputed_tx = if !precomputed_tx.is_null() {
+        unsafe { Box::from_raw(precomputed_tx) }
+    } else {
+        error!("Invalid precomputed transaction");
+        return false;
+    };
+    if matches!(
+        precomputed_tx.tx.version(),
+        TxVersion::Sprout(_) | TxVersion::Overwinter | TxVersion::Sapling,
+    ) {
+        error!("Cannot calculate ZIP 244 digest for pre-v5 transaction");
+        return false;
+    }
+    let bundle = unsafe { bundle.as_ref().unwrap() };
+
+    struct Signable {}
+    impl Authorization for Signable {
+        type TransparentAuth = TransparentAuth;
+        type SaplingAuth = sapling::Authorized;
+        type OrchardAuth = InProgress<Unproven, Unauthorized>;
+    }
+
+    let txdata: TransactionData<Signable> =
+        precomputed_tx
+            .tx
+            .map_bundles(|b| b, |b| b, |_| Some(bundle.clone()));
+    let txid_parts = txdata.digest(TxIdDigester);
+
+    let sighash = v5_signature_hash(&txdata, &SignableInput::Shielded, &txid_parts);
+
+    // `v5_signature_hash` output is always 32 bytes.
+    *unsafe { &mut *sighash_ret } = sighash.as_ref().try_into().unwrap();
+    true
+}
diff --git a/depend/zcash/src/rust/src/ed25519.rs b/depend/zcash/src/rust/src/ed25519.rs
new file mode 100644
index 000000000..3a40cff31
--- /dev/null
+++ b/depend/zcash/src/rust/src/ed25519.rs
@@ -0,0 +1,67 @@
+// Copyright (c) 2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+use ed25519_zebra::{Signature, SigningKey, VerificationKey};
+use libc::{c_uchar, size_t};
+use rand_core::OsRng;
+use std::convert::TryFrom;
+use std::slice;
+
+#[no_mangle]
+pub extern "C" fn ed25519_generate_keypair(sk: *mut [u8; 32], vk: *mut [u8; 32]) {
+    let sk = unsafe { sk.as_mut() }.unwrap();
+    let vk = unsafe { vk.as_mut() }.unwrap();
+
+    let signing_key = SigningKey::new(OsRng);
+
+    *sk = signing_key.into();
+    *vk = VerificationKey::from(&signing_key).into();
+}
+
+#[no_mangle]
+pub extern "C" fn ed25519_sign(
+    sk: *const [u8; 32],
+    msg: *const c_uchar,
+    msg_len: size_t,
+    signature: *mut [u8; 64],
+) -> bool {
+    let sk = SigningKey::from(*unsafe { sk.as_ref() }.unwrap());
+
+    let msg = unsafe { slice::from_raw_parts(msg, msg_len) };
+
+    let signature = unsafe {
+        match signature.as_mut() {
+            Some(sig) => sig,
+            None => return false,
+        }
+    };
+
+    *signature = sk.sign(msg).into();
+
+    true
+}
+
+#[no_mangle]
+pub extern "C" fn ed25519_verify(
+    vk: *const [u8; 32],
+    signature: *const [u8; 64],
+    msg: *const c_uchar,
+    msg_len: size_t,
+) -> bool {
+    let vk = match VerificationKey::try_from(*unsafe { vk.as_ref() }.unwrap()) {
+        Ok(vk) => vk,
+        Err(_) => return false,
+    };
+
+    let signature = Signature::from(*unsafe {
+        match signature.as_ref() {
+            Some(sig) => sig,
+            None => return false,
+        }
+    });
+
+    let msg = unsafe { slice::from_raw_parts(msg, msg_len) };
+
+    vk.verify(&signature, msg).is_ok()
+}
diff --git a/depend/zcash/src/rust/src/history_ffi.rs b/depend/zcash/src/rust/src/history_ffi.rs
new file mode 100644
index 000000000..f132de9d3
--- /dev/null
+++ b/depend/zcash/src/rust/src/history_ffi.rs
@@ -0,0 +1,265 @@
+use std::{convert::TryFrom, slice};
+
+use libc::{c_uchar, size_t};
+use zcash_history::{Entry as MMREntry, Tree as MMRTree, Version, V1, V2};
+use zcash_primitives::consensus::BranchId;
+
+/// Switch the tree version on the epoch it is for.
+fn dispatch<T>(cbranch: u32, v1: impl FnOnce() -> T, v2: impl FnOnce() -> T) -> T {
+    match BranchId::try_from(cbranch).unwrap() {
+        BranchId::Sprout
+        | BranchId::Overwinter
+        | BranchId::Sapling
+        | BranchId::Heartwood
+        | BranchId::Canopy => v1(),
+        _ => v2(),
+    }
+}
+
+fn construct_mmr_tree<V: Version>(
+    // Consensus branch id
+    cbranch: u32,
+    // Length of tree in array representation
+    t_len: u32,
+
+    // Indices of provided tree nodes, length of p_len+e_len
+    ni_ptr: *const u32,
+    // Provided tree nodes data, length of p_len+e_len
+    n_ptr: *const [c_uchar; zcash_history::MAX_ENTRY_SIZE],
+
+    // Peaks count
+    p_len: size_t,
+    // Extra nodes loaded (for deletion) count
+    e_len: size_t,
+) -> Result<MMRTree<V>, &'static str> {
+    let (indices, nodes) = unsafe {
+        (
+            slice::from_raw_parts(ni_ptr, p_len + e_len),
+            slice::from_raw_parts(n_ptr, p_len + e_len),
+        )
+    };
+
+    let mut peaks: Vec<_> = indices
+        .iter()
+        .zip(nodes.iter())
+        .map(
+            |(index, node)| match MMREntry::from_bytes(cbranch, &node[..]) {
+                Ok(entry) => Ok((*index, entry)),
+                Err(_) => Err("Invalid encoding"),
+            },
+        )
+        .collect::<Result<_, _>>()?;
+    let extra = peaks.split_off(p_len);
+
+    Ok(MMRTree::new(t_len, peaks, extra))
+}
+
+#[no_mangle]
+pub extern "system" fn librustzcash_mmr_append(
+    // Consensus branch id
+    cbranch: u32,
+    // Length of tree in array representation
+    t_len: u32,
+    // Indices of provided tree nodes, length of p_len
+    ni_ptr: *const u32,
+    // Provided tree nodes data, length of p_len
+    n_ptr: *const [c_uchar; zcash_history::MAX_ENTRY_SIZE],
+    // Peaks count
+    p_len: size_t,
+    // New node pointer
+    nn_ptr: *const [u8; zcash_history::MAX_NODE_DATA_SIZE],
+    // Return of root commitment
+    rt_ret: *mut [u8; 32],
+    // Return buffer for appended leaves, should be pre-allocated of ceiling(log2(t_len)) length
+    buf_ret: *mut [c_uchar; zcash_history::MAX_NODE_DATA_SIZE],
+) -> u32 {
+    dispatch(
+        cbranch,
+        || {
+            librustzcash_mmr_append_inner::<V1>(
+                cbranch, t_len, ni_ptr, n_ptr, p_len, nn_ptr, rt_ret, buf_ret,
+            )
+        },
+        || {
+            librustzcash_mmr_append_inner::<V2>(
+                cbranch, t_len, ni_ptr, n_ptr, p_len, nn_ptr, rt_ret, buf_ret,
+            )
+        },
+    )
+}
+
+#[allow(clippy::too_many_arguments)]
+fn librustzcash_mmr_append_inner<V: Version>(
+    // Consensus branch id
+    cbranch: u32,
+    // Length of tree in array representation
+    t_len: u32,
+    // Indices of provided tree nodes, length of p_len
+    ni_ptr: *const u32,
+    // Provided tree nodes data, length of p_len
+    n_ptr: *const [c_uchar; zcash_history::MAX_ENTRY_SIZE],
+    // Peaks count
+    p_len: size_t,
+    // New node pointer
+    nn_ptr: *const [u8; zcash_history::MAX_NODE_DATA_SIZE],
+    // Return of root commitment
+    rt_ret: *mut [u8; 32],
+    // Return buffer for appended leaves, should be pre-allocated of ceiling(log2(t_len)) length
+    buf_ret: *mut [c_uchar; zcash_history::MAX_NODE_DATA_SIZE],
+) -> u32 {
+    let new_node_bytes: &[u8; zcash_history::MAX_NODE_DATA_SIZE] = unsafe {
+        match nn_ptr.as_ref() {
+            Some(r) => r,
+            None => {
+                return 0;
+            } // Null pointer passed, error
+        }
+    };
+
+    let mut tree = match construct_mmr_tree::<V>(cbranch, t_len, ni_ptr, n_ptr, p_len, 0) {
+        Ok(t) => t,
+        _ => {
+            return 0;
+        } // error
+    };
+
+    let node = match V::from_bytes(cbranch, &new_node_bytes[..]) {
+        Ok(node) => node,
+        _ => {
+            return 0;
+        } // error
+    };
+
+    let appended = match tree.append_leaf(node) {
+        Ok(appended) => appended,
+        _ => {
+            return 0;
+        }
+    };
+
+    let return_count = appended.len();
+
+    let root_node = tree
+        .root_node()
+        .expect("Just added, should resolve always; qed");
+    unsafe {
+        *rt_ret = V::hash(root_node.data());
+
+        for (idx, next_buf) in slice::from_raw_parts_mut(buf_ret, return_count as usize)
+            .iter_mut()
+            .enumerate()
+        {
+            V::write(
+                tree.resolve_link(appended[idx])
+                    .expect("This was generated by the tree and thus resolvable; qed")
+                    .data(),
+                &mut &mut next_buf[..],
+            )
+            .expect("Write using cursor with enough buffer size cannot fail; qed");
+        }
+    }
+
+    return_count as u32
+}
+
+#[no_mangle]
+pub extern "system" fn librustzcash_mmr_delete(
+    // Consensus branch id
+    cbranch: u32,
+    // Length of tree in array representation
+    t_len: u32,
+    // Indices of provided tree nodes, length of p_len+e_len
+    ni_ptr: *const u32,
+    // Provided tree nodes data, length of p_len+e_len
+    n_ptr: *const [c_uchar; zcash_history::MAX_ENTRY_SIZE],
+    // Peaks count
+    p_len: size_t,
+    // Extra nodes loaded (for deletion) count
+    e_len: size_t,
+    // Return of root commitment
+    rt_ret: *mut [u8; 32],
+) -> u32 {
+    dispatch(
+        cbranch,
+        || librustzcash_mmr_delete_inner::<V1>(cbranch, t_len, ni_ptr, n_ptr, p_len, e_len, rt_ret),
+        || librustzcash_mmr_delete_inner::<V2>(cbranch, t_len, ni_ptr, n_ptr, p_len, e_len, rt_ret),
+    )
+}
+
+fn librustzcash_mmr_delete_inner<V: Version>(
+    // Consensus branch id
+    cbranch: u32,
+    // Length of tree in array representation
+    t_len: u32,
+    // Indices of provided tree nodes, length of p_len+e_len
+    ni_ptr: *const u32,
+    // Provided tree nodes data, length of p_len+e_len
+    n_ptr: *const [c_uchar; zcash_history::MAX_ENTRY_SIZE],
+    // Peaks count
+    p_len: size_t,
+    // Extra nodes loaded (for deletion) count
+    e_len: size_t,
+    // Return of root commitment
+    rt_ret: *mut [u8; 32],
+) -> u32 {
+    let mut tree = match construct_mmr_tree::<V>(cbranch, t_len, ni_ptr, n_ptr, p_len, e_len) {
+        Ok(t) => t,
+        _ => {
+            return 0;
+        } // error
+    };
+
+    let truncate_len = match tree.truncate_leaf() {
+        Ok(v) => v,
+        _ => {
+            return 0;
+        } // Error
+    };
+
+    unsafe {
+        *rt_ret = V::hash(
+            tree.root_node()
+                .expect("Just generated without errors, root should be resolving")
+                .data(),
+        );
+    }
+
+    truncate_len
+}
+
+#[no_mangle]
+pub extern "system" fn librustzcash_mmr_hash_node(
+    cbranch: u32,
+    n_ptr: *const [u8; zcash_history::MAX_NODE_DATA_SIZE],
+    h_ret: *mut [u8; 32],
+) -> u32 {
+    dispatch(
+        cbranch,
+        || librustzcash_mmr_hash_node_inner::<V1>(cbranch, n_ptr, h_ret),
+        || librustzcash_mmr_hash_node_inner::<V2>(cbranch, n_ptr, h_ret),
+    )
+}
+
+fn librustzcash_mmr_hash_node_inner<V: Version>(
+    cbranch: u32,
+    n_ptr: *const [u8; zcash_history::MAX_NODE_DATA_SIZE],
+    h_ret: *mut [u8; 32],
+) -> u32 {
+    let node_bytes: &[u8; zcash_history::MAX_NODE_DATA_SIZE] = unsafe {
+        match n_ptr.as_ref() {
+            Some(r) => r,
+            None => return 1,
+        }
+    };
+
+    let node = match V::from_bytes(cbranch, &node_bytes[..]) {
+        Ok(n) => n,
+        _ => return 1, // error
+    };
+
+    unsafe {
+        *h_ret = V::hash(&node);
+    }
+
+    0
+}
diff --git a/depend/zcash/src/rust/src/incremental_merkle_tree.rs b/depend/zcash/src/rust/src/incremental_merkle_tree.rs
new file mode 100644
index 000000000..83c6e335c
--- /dev/null
+++ b/depend/zcash/src/rust/src/incremental_merkle_tree.rs
@@ -0,0 +1,141 @@
+use byteorder::{ReadBytesExt, WriteBytesExt};
+use std::collections::{BTreeMap, BTreeSet};
+use std::io::{self, Read, Write};
+
+use incrementalmerkletree::{
+    bridgetree::{BridgeTree, Checkpoint},
+    Hashable, Position,
+};
+use zcash_encoding::{Optional, Vector};
+use zcash_primitives::merkle_tree::{
+    incremental::{
+        read_bridge_v1, read_leu64_usize, read_position, write_bridge_v1, write_position,
+        write_usize_leu64, SER_V1, SER_V2,
+    },
+    HashSer,
+};
+
+pub fn write_checkpoint_v2<W: Write>(mut writer: W, checkpoint: &Checkpoint) -> io::Result<()> {
+    write_usize_leu64(&mut writer, checkpoint.bridges_len())?;
+    writer.write_u8(if checkpoint.is_witnessed() { 1 } else { 0 })?;
+    Vector::write_sized(&mut writer, checkpoint.witnessed().iter(), |w, p| {
+        write_position(w, *p)
+    })?;
+    Vector::write_sized(
+        &mut writer,
+        checkpoint.forgotten().iter(),
+        |mut w, (pos, idx)| {
+            write_position(&mut w, *pos)?;
+            write_usize_leu64(&mut w, *idx)
+        },
+    )?;
+
+    Ok(())
+}
+
+pub fn read_checkpoint_v1<R: Read>(
+    mut reader: R,
+    save_positions: &mut BTreeMap<usize, Position>,
+) -> io::Result<Checkpoint> {
+    let bridges_len = read_leu64_usize(&mut reader)?;
+    let is_witnessed = reader.read_u8()? == 1;
+    let forgotten = Vector::read_collected(&mut reader, |mut r| {
+        Ok((read_position(&mut r)?, read_leu64_usize(&mut r)?))
+    })?;
+
+    // v1 checkpoints lacked information about the witnesses that were made during their
+    // span of blocks, so we assume that a witness was made in the first checkpoint
+    // with a corresponding bridge index.
+    let witnessed = if let Some(position) = save_positions.remove(&bridges_len) {
+        BTreeSet::from([position])
+    } else {
+        BTreeSet::new()
+    };
+
+    Ok(Checkpoint::from_parts(
+        bridges_len,
+        is_witnessed,
+        witnessed,
+        forgotten,
+    ))
+}
+
+pub fn read_checkpoint_v2<R: Read>(mut reader: R) -> io::Result<Checkpoint> {
+    Ok(Checkpoint::from_parts(
+        read_leu64_usize(&mut reader)?,
+        reader.read_u8()? == 1,
+        Vector::read_collected(&mut reader, |r| read_position(r))?,
+        Vector::read_collected(&mut reader, |mut r| {
+            Ok((read_position(&mut r)?, read_leu64_usize(&mut r)?))
+        })?,
+    ))
+}
+
+pub fn write_tree<H: Hashable + HashSer + Ord, W: Write>(
+    mut writer: W,
+    tree: &BridgeTree<H, 32>,
+) -> io::Result<()> {
+    writer.write_u8(SER_V2)?;
+    Vector::write(&mut writer, tree.prior_bridges(), |mut w, b| {
+        write_bridge_v1(&mut w, b)
+    })?;
+    Optional::write(&mut writer, tree.current_bridge().as_ref(), |mut w, b| {
+        write_bridge_v1(&mut w, b)
+    })?;
+    Vector::write_sized(
+        &mut writer,
+        tree.witnessed_indices().iter(),
+        |mut w, (pos, i)| {
+            write_position(&mut w, *pos)?;
+            write_usize_leu64(&mut w, *i)
+        },
+    )?;
+    Vector::write(&mut writer, tree.checkpoints(), |w, c| {
+        write_checkpoint_v2(w, c)
+    })?;
+    write_usize_leu64(&mut writer, tree.max_checkpoints())?;
+
+    Ok(())
+}
+
+#[allow(clippy::redundant_closure)]
+pub fn read_tree<H: Hashable + HashSer + Ord + Clone, R: Read>(
+    mut reader: R,
+) -> io::Result<BridgeTree<H, 32>> {
+    let ser_version = reader.read_u8()?;
+    let prior_bridges = Vector::read(&mut reader, |r| read_bridge_v1(r))?;
+    let current_bridge = Optional::read(&mut reader, |r| read_bridge_v1(r))?;
+    let saved: BTreeMap<Position, usize> = Vector::read_collected(&mut reader, |mut r| {
+        Ok((read_position(&mut r)?, read_leu64_usize(&mut r)?))
+    })?;
+
+    let checkpoints = match ser_version {
+        SER_V1 => {
+            let mut save_positions = saved.iter().map(|(p, i)| (*i, *p)).collect();
+            Vector::read_collected_mut(&mut reader, |r| read_checkpoint_v1(r, &mut save_positions))
+        }
+        SER_V2 => Vector::read_collected(&mut reader, |r| read_checkpoint_v2(r)),
+        flag => Err(io::Error::new(
+            io::ErrorKind::InvalidInput,
+            format!("Unrecognized tree serialization version: {:?}", flag),
+        )),
+    }?;
+    let max_checkpoints = read_leu64_usize(&mut reader)?;
+
+    BridgeTree::from_parts(
+        prior_bridges,
+        current_bridge,
+        saved,
+        checkpoints,
+        max_checkpoints,
+    )
+    .map_err(|err| {
+        io::Error::new(
+            io::ErrorKind::InvalidInput,
+            format!(
+                "Consistency violation found when attempting to deserialize Merkle tree: {:?}",
+                err
+            ),
+        )
+    })
+}
diff --git a/depend/zcash/src/rust/src/incremental_merkle_tree_ffi.rs b/depend/zcash/src/rust/src/incremental_merkle_tree_ffi.rs
new file mode 100644
index 000000000..5a70b6388
--- /dev/null
+++ b/depend/zcash/src/rust/src/incremental_merkle_tree_ffi.rs
@@ -0,0 +1,186 @@
+use incrementalmerkletree::{bridgetree, Altitude, Frontier, Hashable};
+use std::mem::size_of_val;
+use std::ptr;
+
+use orchard::{bundle::Authorized, tree::MerkleHashOrchard};
+use tracing::error;
+use zcash_primitives::{
+    merkle_tree::{
+        incremental::{read_frontier_v1, write_frontier_v1},
+        CommitmentTree,
+    },
+    transaction::components::Amount,
+};
+
+use crate::streams_ffi::{CppStreamReader, CppStreamWriter, ReadCb, StreamObj, WriteCb};
+
+pub const MERKLE_DEPTH: u8 = 32;
+
+//
+// Operations on Merkle frontiers.
+//
+
+#[no_mangle]
+pub extern "C" fn orchard_merkle_frontier_empty(
+) -> *mut bridgetree::Frontier<MerkleHashOrchard, MERKLE_DEPTH> {
+    let empty_tree = bridgetree::Frontier::<MerkleHashOrchard, MERKLE_DEPTH>::empty();
+    Box::into_raw(Box::new(empty_tree))
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_merkle_frontier_clone(
+    tree: *const bridgetree::Frontier<MerkleHashOrchard, MERKLE_DEPTH>,
+) -> *mut bridgetree::Frontier<MerkleHashOrchard, MERKLE_DEPTH> {
+    unsafe { tree.as_ref() }
+        .map(|tree| Box::into_raw(Box::new(tree.clone())))
+        .unwrap_or(std::ptr::null_mut())
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_merkle_frontier_free(
+    tree: *mut bridgetree::Frontier<MerkleHashOrchard, MERKLE_DEPTH>,
+) {
+    if !tree.is_null() {
+        drop(unsafe { Box::from_raw(tree) });
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_merkle_frontier_parse(
+    stream: Option<StreamObj>,
+    read_cb: Option<ReadCb>,
+) -> *mut bridgetree::Frontier<MerkleHashOrchard, MERKLE_DEPTH> {
+    let reader = CppStreamReader::from_raw_parts(stream, read_cb.unwrap());
+
+    match read_frontier_v1(reader) {
+        Ok(parsed) => Box::into_raw(Box::new(parsed)),
+        Err(e) => {
+            error!("Failed to parse Orchard bundle: {}", e);
+            ptr::null_mut()
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_merkle_frontier_serialize(
+    frontier: *const bridgetree::Frontier<MerkleHashOrchard, MERKLE_DEPTH>,
+    stream: Option<StreamObj>,
+    write_cb: Option<WriteCb>,
+) -> bool {
+    let frontier = unsafe {
+        frontier
+            .as_ref()
+            .expect("Orchard note commitment tree pointer may not be null.")
+    };
+
+    let writer = CppStreamWriter::from_raw_parts(stream, write_cb.unwrap());
+    match write_frontier_v1(writer, frontier) {
+        Ok(()) => true,
+        Err(e) => {
+            error!("{}", e);
+            false
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_merkle_frontier_serialize_legacy(
+    frontier: *const bridgetree::Frontier<MerkleHashOrchard, MERKLE_DEPTH>,
+    stream: Option<StreamObj>,
+    write_cb: Option<WriteCb>,
+) -> bool {
+    let frontier = unsafe {
+        frontier
+            .as_ref()
+            .expect("Orchard note commitment tree pointer may not be null.")
+    };
+
+    let writer = CppStreamWriter::from_raw_parts(stream, write_cb.unwrap());
+    let commitment_tree = CommitmentTree::from_frontier(frontier);
+    match commitment_tree.write(writer) {
+        Ok(()) => true,
+        Err(e) => {
+            error!("{}", e);
+            false
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_merkle_frontier_append_bundle(
+    tree: *mut bridgetree::Frontier<MerkleHashOrchard, MERKLE_DEPTH>,
+    bundle: *const orchard::Bundle<Authorized, Amount>,
+) -> bool {
+    let tree = unsafe {
+        tree.as_mut()
+            .expect("Orchard note commitment tree pointer may not be null.")
+    };
+    if let Some(bundle) = unsafe { bundle.as_ref() } {
+        for action in bundle.actions().iter() {
+            if !tree.append(&MerkleHashOrchard::from_cmx(action.cmx())) {
+                error!("Orchard note commitment tree is full.");
+                return false;
+            }
+        }
+    }
+
+    true
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_merkle_frontier_root(
+    tree: *const bridgetree::Frontier<MerkleHashOrchard, MERKLE_DEPTH>,
+    root_ret: *mut [u8; 32],
+) {
+    let tree = unsafe {
+        tree.as_ref()
+            .expect("Orchard note commitment tree pointer may not be null.")
+    };
+
+    let root_ret = unsafe {
+        root_ret
+            .as_mut()
+            .expect("Cannot return to the null pointer.")
+    };
+
+    *root_ret = tree.root().to_bytes();
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_merkle_frontier_num_leaves(
+    tree: *const bridgetree::Frontier<MerkleHashOrchard, MERKLE_DEPTH>,
+) -> u64 {
+    let tree = unsafe {
+        tree.as_ref()
+            .expect("Orchard note commitment tree pointer may not be null.")
+    };
+
+    tree.position().map_or(0, |p| <u64>::from(p) + 1)
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_merkle_frontier_dynamic_mem_usage(
+    tree: *const bridgetree::Frontier<MerkleHashOrchard, MERKLE_DEPTH>,
+) -> usize {
+    let tree = unsafe {
+        tree.as_ref()
+            .expect("Orchard note commitment tree pointer may not be null.")
+    };
+
+    size_of_val(tree) + tree.dynamic_memory_usage()
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_merkle_tree_empty_root(root_ret: *mut [u8; 32]) {
+    let root_ret = unsafe {
+        root_ret
+            .as_mut()
+            .expect("Cannot return to the null pointer.")
+    };
+
+    let altitude = Altitude::from(MERKLE_DEPTH);
+
+    let digest = MerkleHashOrchard::empty_root(altitude).to_bytes();
+
+    *root_ret = digest;
+}
diff --git a/depend/zcash/src/rust/src/metrics_ffi.rs b/depend/zcash/src/rust/src/metrics_ffi.rs
new file mode 100644
index 000000000..cdc4530b9
--- /dev/null
+++ b/depend/zcash/src/rust/src/metrics_ffi.rs
@@ -0,0 +1,240 @@
+use libc::{c_char, c_double};
+use metrics::{try_recorder, GaugeValue, Key, Label};
+use metrics_exporter_prometheus::PrometheusBuilder;
+use std::ffi::CStr;
+use std::net::{IpAddr, SocketAddr};
+use std::ptr;
+use std::slice;
+use tracing::error;
+
+#[no_mangle]
+pub extern "C" fn metrics_run(
+    bind_address: *const c_char,
+    allow_ips: *const *const c_char,
+    allow_ips_len: usize,
+    prometheus_port: u16,
+) -> bool {
+    // Parse any allowed IPs.
+    let allow_ips = unsafe { slice::from_raw_parts(allow_ips, allow_ips_len) };
+    let mut allow_ips: Vec<ipnet::IpNet> = match allow_ips
+        .iter()
+        .map(|&p| unsafe { CStr::from_ptr(p) })
+        .map(|s| {
+            s.to_str().ok().and_then(|s| {
+                s.parse()
+                    .map_err(|e| {
+                        error!("Invalid -metricsallowip argument '{}': {}", s, e);
+                    })
+                    .ok()
+            })
+        })
+        .collect()
+    {
+        Some(ips) => ips,
+        None => {
+            return false;
+        }
+    };
+    // We always allow localhost.
+    allow_ips.extend(&["127.0.0.0/8".parse().unwrap(), "::1/128".parse().unwrap()]);
+
+    // Parse the address to bind to.
+    let bind_address = SocketAddr::new(
+        if allow_ips.is_empty() {
+            // Default to loopback if not allowing external IPs.
+            "127.0.0.1".parse::<IpAddr>().unwrap()
+        } else if bind_address.is_null() {
+            // No specific bind address specified, bind to any.
+            "0.0.0.0".parse::<IpAddr>().unwrap()
+        } else {
+            match unsafe { CStr::from_ptr(bind_address) }
+                .to_str()
+                .ok()
+                .and_then(|s| s.parse::<IpAddr>().ok())
+            {
+                Some(addr) => addr,
+                None => {
+                    error!("Invalid -metricsbind argument");
+                    return false;
+                }
+            }
+        },
+        prometheus_port,
+    );
+
+    allow_ips
+        .into_iter()
+        .fold(
+            PrometheusBuilder::new().listen_address(bind_address),
+            |builder, subnet| builder.add_allowed(subnet),
+        )
+        .install()
+        .is_ok()
+}
+
+pub struct FfiCallsite {
+    key: Key,
+}
+
+#[no_mangle]
+pub extern "C" fn metrics_callsite(
+    name: *const c_char,
+    label_names: *const *const c_char,
+    label_values: *const *const c_char,
+    labels_len: usize,
+) -> *mut FfiCallsite {
+    let name = unsafe { CStr::from_ptr(name) }.to_str().unwrap();
+    let labels = unsafe { slice::from_raw_parts(label_names, labels_len) };
+    let values = unsafe { slice::from_raw_parts(label_values, labels_len) };
+
+    let stringify = |s: &[_]| {
+        s.iter()
+            .map(|&p| unsafe { CStr::from_ptr(p) })
+            .map(|cs| cs.to_string_lossy().into_owned())
+            .collect::<Vec<_>>()
+    };
+    let labels = stringify(labels);
+    let values = stringify(values);
+
+    let labels: Vec<_> = labels
+        .into_iter()
+        .zip(values.into_iter())
+        .map(|(name, value)| Label::new(name, value))
+        .collect();
+
+    Box::into_raw(Box::new(FfiCallsite {
+        key: Key::from_parts(name, labels),
+    }))
+}
+
+pub struct FfiKey {
+    inner: Key,
+}
+
+#[no_mangle]
+pub extern "C" fn metrics_key(
+    name: *const c_char,
+    label_names: *const *const c_char,
+    label_values: *const *const c_char,
+    labels_len: usize,
+) -> *mut FfiKey {
+    if try_recorder().is_none() {
+        // No recorder is currently installed, so don't genenerate a key. We check for
+        // null inside each API that consumes an FfiKey, just in case a recorder was
+        // installed in a racy way.
+        ptr::null_mut()
+    } else {
+        let name = unsafe { CStr::from_ptr(name) }.to_str().unwrap();
+        let labels = unsafe { slice::from_raw_parts(label_names, labels_len) };
+        let values = unsafe { slice::from_raw_parts(label_values, labels_len) };
+
+        let stringify = |s: &[_]| {
+            s.iter()
+                .map(|&p| unsafe { CStr::from_ptr(p) })
+                .map(|cs| cs.to_string_lossy().into_owned())
+                .collect::<Vec<_>>()
+        };
+        let labels = stringify(labels);
+        let values = stringify(values);
+
+        let labels: Vec<_> = labels
+            .into_iter()
+            .zip(values.into_iter())
+            .map(|(name, value)| Label::new(name, value))
+            .collect();
+
+        Box::into_raw(Box::new(FfiKey {
+            inner: Key::from_parts(name, labels),
+        }))
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn metrics_static_increment_counter(callsite: *const FfiCallsite, value: u64) {
+    if let Some(recorder) = try_recorder() {
+        let callsite = unsafe { callsite.as_ref().unwrap() };
+        recorder.increment_counter(&callsite.key, value);
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn metrics_increment_counter(key: *mut FfiKey, value: u64) {
+    if let Some(recorder) = try_recorder() {
+        if !key.is_null() {
+            let key = unsafe { Box::from_raw(key) };
+            recorder.increment_counter(&key.inner, value);
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn metrics_static_update_gauge(callsite: *const FfiCallsite, value: c_double) {
+    if let Some(recorder) = try_recorder() {
+        let callsite = unsafe { callsite.as_ref().unwrap() };
+        recorder.update_gauge(&callsite.key, GaugeValue::Absolute(value));
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn metrics_update_gauge(key: *mut FfiKey, value: c_double) {
+    if let Some(recorder) = try_recorder() {
+        if !key.is_null() {
+            let key = unsafe { Box::from_raw(key) };
+            recorder.update_gauge(&key.inner, GaugeValue::Absolute(value));
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn metrics_static_increment_gauge(callsite: *const FfiCallsite, value: c_double) {
+    if let Some(recorder) = try_recorder() {
+        let callsite = unsafe { callsite.as_ref().unwrap() };
+        recorder.update_gauge(&callsite.key, GaugeValue::Increment(value));
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn metrics_increment_gauge(key: *mut FfiKey, value: c_double) {
+    if let Some(recorder) = try_recorder() {
+        if !key.is_null() {
+            let key = unsafe { Box::from_raw(key) };
+            recorder.update_gauge(&key.inner, GaugeValue::Increment(value));
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn metrics_static_decrement_gauge(callsite: *const FfiCallsite, value: c_double) {
+    if let Some(recorder) = try_recorder() {
+        let callsite = unsafe { callsite.as_ref().unwrap() };
+        recorder.update_gauge(&callsite.key, GaugeValue::Decrement(value));
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn metrics_decrement_gauge(key: *mut FfiKey, value: c_double) {
+    if let Some(recorder) = try_recorder() {
+        if !key.is_null() {
+            let key = unsafe { Box::from_raw(key) };
+            recorder.update_gauge(&key.inner, GaugeValue::Decrement(value));
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn metrics_static_record_histogram(callsite: *const FfiCallsite, value: c_double) {
+    if let Some(recorder) = try_recorder() {
+        let callsite = unsafe { callsite.as_ref().unwrap() };
+        recorder.record_histogram(&callsite.key, value);
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn metrics_record_histogram(key: *mut FfiKey, value: c_double) {
+    if let Some(recorder) = try_recorder() {
+        if !key.is_null() {
+            let key = unsafe { Box::from_raw(key) };
+            recorder.record_histogram(&key.inner, value);
+        }
+    }
+}
diff --git a/depend/zcash/src/rust/src/orchard_ffi.rs b/depend/zcash/src/rust/src/orchard_ffi.rs
new file mode 100644
index 000000000..dbc6649c6
--- /dev/null
+++ b/depend/zcash/src/rust/src/orchard_ffi.rs
@@ -0,0 +1,344 @@
+use std::{mem, ptr};
+
+use libc::size_t;
+use memuse::DynamicUsage;
+use orchard::{
+    bundle::Authorized,
+    keys::OutgoingViewingKey,
+    note_encryption::OrchardDomain,
+    primitives::redpallas::{self, Binding, SpendAuth},
+    Bundle,
+};
+use rand_core::OsRng;
+use tracing::{debug, error};
+use zcash_note_encryption::try_output_recovery_with_ovk;
+use zcash_primitives::transaction::{
+    components::{orchard as orchard_serialization, Amount},
+    TxId,
+};
+
+use crate::streams_ffi::{CppStreamReader, CppStreamWriter, ReadCb, StreamObj, WriteCb};
+
+#[no_mangle]
+pub extern "C" fn orchard_bundle_clone(
+    bundle: *const Bundle<Authorized, Amount>,
+) -> *mut Bundle<Authorized, Amount> {
+    unsafe { bundle.as_ref() }
+        .map(|bundle| Box::into_raw(Box::new(bundle.clone())))
+        .unwrap_or(std::ptr::null_mut())
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_bundle_free(bundle: *mut Bundle<Authorized, Amount>) {
+    if !bundle.is_null() {
+        drop(unsafe { Box::from_raw(bundle) });
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_bundle_recursive_dynamic_usage(
+    bundle: *const Bundle<Authorized, Amount>,
+) -> size_t {
+    unsafe { bundle.as_ref() }
+        // Bundles are boxed on the heap, so we count their own size as well as the size
+        // of `Vec`s they allocate.
+        .map(|bundle| mem::size_of_val(bundle) + bundle.dynamic_usage())
+        // If the transaction has no Orchard component, nothing is allocated for it.
+        .unwrap_or(0)
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_bundle_parse(
+    stream: Option<StreamObj>,
+    read_cb: Option<ReadCb>,
+    bundle_ret: *mut *mut Bundle<Authorized, Amount>,
+) -> bool {
+    let reader = CppStreamReader::from_raw_parts(stream, read_cb.unwrap());
+
+    match orchard_serialization::read_v5_bundle(reader) {
+        Ok(parsed) => {
+            unsafe {
+                *bundle_ret = if let Some(bundle) = parsed {
+                    Box::into_raw(Box::new(bundle))
+                } else {
+                    ptr::null_mut::<Bundle<Authorized, Amount>>()
+                };
+            };
+            true
+        }
+        Err(e) => {
+            error!("Failed to parse Orchard bundle: {}", e);
+            false
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_bundle_serialize(
+    bundle: *const Bundle<Authorized, Amount>,
+    stream: Option<StreamObj>,
+    write_cb: Option<WriteCb>,
+) -> bool {
+    let bundle = unsafe { bundle.as_ref() };
+    let writer = CppStreamWriter::from_raw_parts(stream, write_cb.unwrap());
+
+    match orchard_serialization::write_v5_bundle(bundle, writer) {
+        Ok(()) => true,
+        Err(e) => {
+            error!("{}", e);
+            false
+        }
+    }
+}
+
+#[no_mangle]
+
+pub extern "C" fn orchard_bundle_value_balance(bundle: *const Bundle<Authorized, Amount>) -> i64 {
+    unsafe { bundle.as_ref() }
+        .map(|bundle| (*bundle.value_balance()).into())
+        // From section 7.1 of the Zcash prototol spec:
+        // If valueBalanceOrchard is not present, then v^balanceOrchard is defined to be 0.
+        .unwrap_or(0)
+}
+
+/// Validates the given Orchard bundle against bundle-specific consensus rules.
+///
+/// If `bundle == nullptr`, this returns `true`.
+///
+/// ## Consensus rules
+///
+/// [§4.6](https://zips.z.cash/protocol/protocol.pdf#actiondesc):
+/// - Canonical element encodings are enforced by [`orchard_bundle_parse`].
+/// - SpendAuthSig^Orchard validity is enforced by [`BatchValidator`] via
+///   [`orchard_batch_validate`].
+/// - Proof validity is enforced here.
+///
+/// [§7.1](https://zips.z.cash/protocol/protocol.pdf#txnencodingandconsensus):
+/// - `bindingSigOrchard` validity is enforced by [`BatchValidator`] via
+///   [`orchard_batch_validate`].
+#[no_mangle]
+pub extern "C" fn orchard_bundle_validate(bundle: *const Bundle<Authorized, Amount>) -> bool {
+    if let Some(bundle) = unsafe { bundle.as_ref() } {
+        let vk = unsafe { crate::ORCHARD_VK.as_ref() }.unwrap();
+
+        if bundle.verify_proof(vk).is_err() {
+            error!("Invalid Orchard proof");
+            return false;
+        }
+
+        true
+    } else {
+        // The Orchard component of a transaction without an Orchard bundle is by
+        // definition valid.
+        true
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_bundle_actions_len(bundle: *const Bundle<Authorized, Amount>) -> usize {
+    if let Some(bundle) = unsafe { bundle.as_ref() } {
+        bundle.actions().len()
+    } else {
+        0
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_bundle_nullifiers(
+    bundle: *const Bundle<Authorized, Amount>,
+    nullifiers_ret: *mut [u8; 32],
+    nullifiers_len: usize,
+) -> bool {
+    if let Some(bundle) = unsafe { bundle.as_ref() } {
+        if nullifiers_len == bundle.actions().len() {
+            let res = unsafe {
+                assert!(!nullifiers_ret.is_null());
+                std::slice::from_raw_parts_mut(nullifiers_ret, nullifiers_len)
+            };
+
+            for (action, nf_ret) in bundle.actions().iter().zip(res.iter_mut()) {
+                *nf_ret = action.nullifier().to_bytes();
+            }
+            true
+        } else {
+            false
+        }
+    } else {
+        nullifiers_len == 0
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_bundle_anchor(
+    bundle: *const Bundle<Authorized, Amount>,
+    anchor_ret: *mut [u8; 32],
+) -> bool {
+    if let Some((bundle, ret)) = unsafe { bundle.as_ref() }.zip(unsafe { anchor_ret.as_mut() }) {
+        ret.copy_from_slice(&bundle.anchor().to_bytes());
+
+        true
+    } else {
+        false
+    }
+}
+
+/// A signature within an authorized Orchard bundle.
+#[derive(Debug)]
+struct BundleSignature {
+    /// The signature item for validation.
+    signature: redpallas::batch::Item<SpendAuth, Binding>,
+}
+
+/// Batch validation context for Orchard.
+pub struct BatchValidator {
+    signatures: Vec<BundleSignature>,
+}
+
+impl BatchValidator {
+    fn new() -> Self {
+        BatchValidator { signatures: vec![] }
+    }
+
+    fn add_bundle(&mut self, bundle: &Bundle<Authorized, Amount>, txid: TxId) {
+        for action in bundle.actions().iter() {
+            self.signatures.push(BundleSignature {
+                signature: action
+                    .rk()
+                    .create_batch_item(action.authorization().clone(), txid.as_ref()),
+            });
+        }
+
+        self.signatures.push(BundleSignature {
+            signature: bundle.binding_validating_key().create_batch_item(
+                bundle.authorization().binding_signature().clone(),
+                txid.as_ref(),
+            ),
+        });
+    }
+
+    fn validate(&self) -> bool {
+        if self.signatures.is_empty() {
+            // An empty batch is always valid, but is not free to run; skip it.
+            return true;
+        }
+
+        let mut validator = redpallas::batch::Verifier::new();
+        for sig in self.signatures.iter() {
+            validator.queue(sig.signature.clone());
+        }
+
+        match validator.verify(OsRng) {
+            Ok(()) => true,
+            Err(e) => {
+                error!("RedPallas batch validation failed: {}", e);
+                // TODO: Try sub-batches to figure out which signatures are invalid. We can
+                // postpone this for now:
+                // - For per-transaction batching (when adding to the mempool), we don't care
+                //   which signature within the transaction failed.
+                // - For per-block batching, we currently don't care which transaction failed.
+                false
+            }
+        }
+    }
+}
+
+/// Creates a RedPallas batch validation context.
+///
+/// Please free this when you're done.
+#[no_mangle]
+pub extern "C" fn orchard_batch_validation_init() -> *mut BatchValidator {
+    let ctx = Box::new(BatchValidator::new());
+    Box::into_raw(ctx)
+}
+
+/// Frees a RedPallas batch validation context returned from
+/// [`orchard_batch_validation_init`].
+#[no_mangle]
+pub extern "C" fn orchard_batch_validation_free(ctx: *mut BatchValidator) {
+    if !ctx.is_null() {
+        drop(unsafe { Box::from_raw(ctx) });
+    }
+}
+
+/// Adds an Orchard bundle to this batch.
+///
+/// Currently, only RedPallas signatures are batch-validated.
+#[no_mangle]
+pub extern "C" fn orchard_batch_add_bundle(
+    batch: *mut BatchValidator,
+    bundle: *const Bundle<Authorized, Amount>,
+    txid: *const [u8; 32],
+) {
+    let batch = unsafe { batch.as_mut() };
+    let bundle = unsafe { bundle.as_ref() };
+    let txid = unsafe { txid.as_ref() }.cloned().map(TxId::from_bytes);
+
+    match (batch, bundle, txid) {
+        (Some(batch), Some(bundle), Some(txid)) => batch.add_bundle(bundle, txid),
+        (_, _, None) => error!("orchard_batch_add_bundle() called without txid!"),
+        (Some(_), None, Some(txid)) => debug!("Tx {} has no Orchard component", txid),
+        (None, Some(_), _) => debug!("Orchard BatchValidator not provided, assuming disabled."),
+        (None, None, _) => (), // Boring, don't bother logging.
+    }
+}
+
+/// Validates this batch.
+///
+/// - Returns `true` if `batch` is null.
+/// - Returns `false` if any item in the batch is invalid.
+#[no_mangle]
+pub extern "C" fn orchard_batch_validate(batch: *const BatchValidator) -> bool {
+    if let Some(batch) = unsafe { batch.as_ref() } {
+        batch.validate()
+    } else {
+        // The orchard::BatchValidator C++ class uses null to represent a disabled batch
+        // validator.
+        debug!("Orchard BatchValidator not provided, assuming disabled.");
+        true
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_bundle_outputs_enabled(
+    bundle: *const Bundle<Authorized, Amount>,
+) -> bool {
+    let bundle = unsafe { bundle.as_ref() };
+    bundle.map(|b| b.flags().outputs_enabled()).unwrap_or(false)
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_bundle_spends_enabled(bundle: *const Bundle<Authorized, Amount>) -> bool {
+    let bundle = unsafe { bundle.as_ref() };
+    bundle.map(|b| b.flags().spends_enabled()).unwrap_or(false)
+}
+
+/// Returns whether all actions contained in the Orchard bundle
+/// can be decrypted with the all-zeros OVK. Returns `true`
+/// if no Orchard actions are present.
+///
+/// This should only be called on an Orchard bundle that is
+/// an element of a coinbase transaction.
+#[no_mangle]
+pub extern "C" fn orchard_bundle_coinbase_outputs_are_valid(
+    bundle: *const Bundle<Authorized, Amount>,
+) -> bool {
+    if let Some(bundle) = unsafe { bundle.as_ref() } {
+        for act in bundle.actions() {
+            if try_output_recovery_with_ovk(
+                &OrchardDomain::for_action(act),
+                &OutgoingViewingKey::from([0u8; 32]),
+                act,
+                act.cv_net(),
+                &act.encrypted_note().out_ciphertext,
+            )
+            .is_none()
+            {
+                return false;
+            }
+        }
+    }
+
+    // Either there are no Orchard actions, or all of the outputs
+    // are decryptable with the all-zeros OVK.
+    true
+}
diff --git a/depend/zcash/src/rust/src/orchard_keys_ffi.rs b/depend/zcash/src/rust/src/orchard_keys_ffi.rs
new file mode 100644
index 000000000..f992a3759
--- /dev/null
+++ b/depend/zcash/src/rust/src/orchard_keys_ffi.rs
@@ -0,0 +1,402 @@
+use std::io::{Read, Write};
+use std::slice;
+use tracing::error;
+
+use orchard::{
+    keys::{DiversifierIndex, FullViewingKey, IncomingViewingKey, Scope, SpendingKey},
+    Address,
+};
+
+use crate::{
+    streams_ffi::{CppStreamReader, CppStreamWriter, ReadCb, StreamObj, WriteCb},
+    zcashd_orchard::OrderedAddress,
+};
+
+//
+// Addresses
+//
+
+#[no_mangle]
+pub extern "C" fn orchard_address_clone(addr: *const Address) -> *mut Address {
+    unsafe { addr.as_ref() }
+        .map(|addr| Box::into_raw(Box::new(*addr)))
+        .unwrap_or(std::ptr::null_mut())
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_address_free(addr: *mut Address) {
+    if !addr.is_null() {
+        drop(unsafe { Box::from_raw(addr) });
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_raw_address_parse(
+    stream: Option<StreamObj>,
+    read_cb: Option<ReadCb>,
+) -> *mut Address {
+    let mut reader = CppStreamReader::from_raw_parts(stream, read_cb.unwrap());
+
+    let mut buf = [0u8; 43];
+    match reader.read_exact(&mut buf) {
+        Err(e) => {
+            error!("Stream failure reading bytes of Orchard raw address: {}", e);
+            std::ptr::null_mut()
+        }
+        Ok(()) => {
+            let read = Address::from_raw_address_bytes(&buf);
+            if read.is_some().into() {
+                Box::into_raw(Box::new(read.unwrap()))
+            } else {
+                error!("Failed to parse Orchard raw address.");
+                std::ptr::null_mut()
+            }
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_raw_address_serialize(
+    key: *const Address,
+    stream: Option<StreamObj>,
+    write_cb: Option<WriteCb>,
+) -> bool {
+    let key = unsafe { key.as_ref() }.expect("Orchard raw address pointer may not be null.");
+
+    let mut writer = CppStreamWriter::from_raw_parts(stream, write_cb.unwrap());
+    match writer.write_all(&key.to_raw_address_bytes()) {
+        Ok(()) => true,
+        Err(e) => {
+            error!("Stream failure writing Orchard raw address: {}", e);
+            false
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_address_eq(a0: *const Address, a1: *const Address) -> bool {
+    let a0 = unsafe { a0.as_ref() };
+    let a1 = unsafe { a1.as_ref() };
+    a0 == a1
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_address_lt(a0: *const Address, a1: *const Address) -> bool {
+    let a0 = unsafe { a0.as_ref() };
+    let a1 = unsafe { a1.as_ref() };
+    a0.map(|a| OrderedAddress::new(*a)) < a1.map(|a| OrderedAddress::new(*a))
+}
+
+//
+// Incoming viewing keys
+//
+
+#[no_mangle]
+pub extern "C" fn orchard_incoming_viewing_key_clone(
+    key: *const IncomingViewingKey,
+) -> *mut IncomingViewingKey {
+    unsafe { key.as_ref() }
+        .map(|key| Box::into_raw(Box::new(key.clone())))
+        .unwrap_or(std::ptr::null_mut())
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_incoming_viewing_key_free(key: *mut IncomingViewingKey) {
+    if !key.is_null() {
+        drop(unsafe { Box::from_raw(key) });
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_incoming_viewing_key_parse(
+    stream: Option<StreamObj>,
+    read_cb: Option<ReadCb>,
+) -> *mut IncomingViewingKey {
+    let mut reader = CppStreamReader::from_raw_parts(stream, read_cb.unwrap());
+
+    let mut buf = [0u8; 64];
+    match reader.read_exact(&mut buf) {
+        Err(e) => {
+            error!(
+                "Stream failure reading bytes of Orchard incoming viewing key: {}",
+                e
+            );
+            std::ptr::null_mut()
+        }
+        Ok(()) => {
+            let read = IncomingViewingKey::from_bytes(&buf);
+            if read.is_some().into() {
+                Box::into_raw(Box::new(read.unwrap()))
+            } else {
+                error!("Failed to parse Orchard incoming viewing key.");
+                std::ptr::null_mut()
+            }
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_incoming_viewing_key_to_address(
+    key: *const IncomingViewingKey,
+    diversifier_index: *const [u8; 11],
+) -> *mut Address {
+    let key =
+        unsafe { key.as_ref() }.expect("Orchard incoming viewing key pointer may not be null.");
+
+    let diversifier_index = DiversifierIndex::from(unsafe { *diversifier_index });
+    Box::into_raw(Box::new(key.address_at(diversifier_index)))
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_incoming_viewing_key_decrypt_diversifier(
+    key: *const IncomingViewingKey,
+    addr: *const Address,
+    j_ret: *mut [u8; 11],
+) -> bool {
+    let key =
+        unsafe { key.as_ref() }.expect("Orchard incoming viewing key pointer may not be null.");
+    let addr = unsafe { addr.as_ref() }.expect("Orchard raw address pointer may not be null.");
+    let j_ret = unsafe { j_ret.as_mut() }.expect("j_ret may not be null.");
+
+    match key.diversifier_index(addr) {
+        Some(j) => {
+            j_ret.copy_from_slice(j.to_bytes());
+            true
+        }
+        None => false,
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_incoming_viewing_key_serialize(
+    key: *const IncomingViewingKey,
+    stream: Option<StreamObj>,
+    write_cb: Option<WriteCb>,
+) -> bool {
+    let key =
+        unsafe { key.as_ref() }.expect("Orchard incoming viewing key pointer may not be null.");
+
+    let mut writer = CppStreamWriter::from_raw_parts(stream, write_cb.unwrap());
+    match writer.write_all(&key.to_bytes()) {
+        Ok(()) => true,
+        Err(e) => {
+            error!("Stream failure writing Orchard incoming viewing key: {}", e);
+            false
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_incoming_viewing_key_lt(
+    k0: *const IncomingViewingKey,
+    k1: *const IncomingViewingKey,
+) -> bool {
+    let k0 = unsafe { k0.as_ref() };
+    let k1 = unsafe { k1.as_ref() };
+    k0 < k1
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_incoming_viewing_key_eq(
+    k0: *const IncomingViewingKey,
+    k1: *const IncomingViewingKey,
+) -> bool {
+    let k0 = unsafe { k0.as_ref() };
+    let k1 = unsafe { k1.as_ref() };
+    k0 == k1
+}
+
+//
+// Full viewing keys
+//
+
+#[no_mangle]
+pub extern "C" fn orchard_full_viewing_key_clone(
+    key: *const FullViewingKey,
+) -> *mut FullViewingKey {
+    unsafe { key.as_ref() }
+        .map(|key| Box::into_raw(Box::new(key.clone())))
+        .unwrap_or(std::ptr::null_mut())
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_full_viewing_key_free(key: *mut FullViewingKey) {
+    if !key.is_null() {
+        drop(unsafe { Box::from_raw(key) });
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_full_viewing_key_parse(
+    stream: Option<StreamObj>,
+    read_cb: Option<ReadCb>,
+) -> *mut FullViewingKey {
+    let reader = CppStreamReader::from_raw_parts(stream, read_cb.unwrap());
+
+    match FullViewingKey::read(reader) {
+        Err(e) => {
+            error!(
+                "Stream failure reading bytes of Orchard full viewing key: {}",
+                e
+            );
+            std::ptr::null_mut()
+        }
+        Ok(fvk) => Box::into_raw(Box::new(fvk)),
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_full_viewing_key_serialize(
+    key: *const FullViewingKey,
+    stream: Option<StreamObj>,
+    write_cb: Option<WriteCb>,
+) -> bool {
+    let key = unsafe { key.as_ref() }.expect("Orchard full viewing key pointer may not be null.");
+
+    let mut writer = CppStreamWriter::from_raw_parts(stream, write_cb.unwrap());
+    match key.write(&mut writer) {
+        Ok(()) => true,
+        Err(e) => {
+            error!("Stream failure writing Orchard full viewing key: {}", e);
+            false
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_full_viewing_key_to_incoming_viewing_key(
+    key: *const FullViewingKey,
+) -> *mut IncomingViewingKey {
+    unsafe { key.as_ref() }
+        .map(|key| Box::into_raw(Box::new(key.to_ivk(Scope::External))))
+        .unwrap_or(std::ptr::null_mut())
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_full_viewing_key_to_internal_incoming_viewing_key(
+    fvk: *const FullViewingKey,
+) -> *mut IncomingViewingKey {
+    unsafe { fvk.as_ref() }
+        .map(|fvk| Box::into_raw(Box::new(fvk.to_ivk(Scope::Internal))))
+        .unwrap_or(std::ptr::null_mut())
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_full_viewing_key_to_external_outgoing_viewing_key(
+    fvk: *const FullViewingKey,
+    ovk_ret: *mut [u8; 32],
+) {
+    let fvk = unsafe { fvk.as_ref() }.expect("fvk must not be null");
+    let ovk_ret = unsafe { ovk_ret.as_mut() }.expect("ovk_ret must not be null");
+
+    let ovk = fvk.to_ovk(Scope::External);
+    *ovk_ret = *ovk.as_ref();
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_full_viewing_key_to_internal_outgoing_viewing_key(
+    fvk: *const FullViewingKey,
+    ovk_ret: *mut [u8; 32],
+) {
+    let fvk = unsafe { fvk.as_ref() }.expect("fvk must not be null");
+    let ovk_ret = unsafe { ovk_ret.as_mut() }.expect("ovk_ret must not be null");
+
+    let ovk = fvk.to_ovk(Scope::Internal);
+    *ovk_ret = *ovk.as_ref();
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_full_viewing_key_eq(
+    k0: *const FullViewingKey,
+    k1: *const FullViewingKey,
+) -> bool {
+    let k0 = unsafe { k0.as_ref() };
+    let k1 = unsafe { k1.as_ref() };
+    k0 == k1
+}
+
+//
+// Spending keys
+//
+
+#[no_mangle]
+pub extern "C" fn orchard_spending_key_for_account(
+    seed: *const u8,
+    seed_len: usize,
+    bip44_coin_type: u32,
+    account_id: u32,
+) -> *mut SpendingKey {
+    let seed = unsafe { slice::from_raw_parts(seed, seed_len) };
+    SpendingKey::from_zip32_seed(seed, bip44_coin_type, account_id)
+        .map(|key| Box::into_raw(Box::new(key)))
+        .unwrap_or(std::ptr::null_mut())
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_spending_key_clone(key: *const SpendingKey) -> *mut SpendingKey {
+    unsafe { key.as_ref() }
+        .map(|key| Box::into_raw(Box::new(*key)))
+        .unwrap_or(std::ptr::null_mut())
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_spending_key_free(key: *mut SpendingKey) {
+    if !key.is_null() {
+        drop(unsafe { Box::from_raw(key) });
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_spending_key_parse(
+    stream: Option<StreamObj>,
+    read_cb: Option<ReadCb>,
+) -> *mut SpendingKey {
+    let mut reader = CppStreamReader::from_raw_parts(stream, read_cb.unwrap());
+
+    let mut buf = [0u8; 32];
+    match reader.read_exact(&mut buf) {
+        Err(e) => {
+            error!(
+                "Stream failure reading bytes of Orchard spending key: {}",
+                e
+            );
+            std::ptr::null_mut()
+        }
+        Ok(()) => {
+            let sk_opt = SpendingKey::from_bytes(buf);
+            if sk_opt.is_some().into() {
+                Box::into_raw(Box::new(sk_opt.unwrap()))
+            } else {
+                error!("Failed to parse Orchard spending key.");
+                std::ptr::null_mut()
+            }
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_spending_key_serialize(
+    key: *const SpendingKey,
+    stream: Option<StreamObj>,
+    write_cb: Option<WriteCb>,
+) -> bool {
+    let key = unsafe { key.as_ref() }.expect("Orchard spending key pointer may not be null.");
+
+    let mut writer = CppStreamWriter::from_raw_parts(stream, write_cb.unwrap());
+    match writer.write_all(key.to_bytes()) {
+        Ok(()) => true,
+        Err(e) => {
+            error!("Stream failure writing Orchard spending key: {}", e);
+            false
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_spending_key_to_full_viewing_key(
+    key: *const SpendingKey,
+) -> *mut FullViewingKey {
+    unsafe { key.as_ref() }
+        .map(|key| Box::into_raw(Box::new(FullViewingKey::from(key))))
+        .unwrap_or(std::ptr::null_mut())
+}
diff --git a/depend/zcash/src/rust/src/rustzcash.rs b/depend/zcash/src/rust/src/rustzcash.rs
new file mode 100644
index 000000000..f5b85fd67
--- /dev/null
+++ b/depend/zcash/src/rust/src/rustzcash.rs
@@ -0,0 +1,1206 @@
+//! FFI between the C++ zcashd codebase and the Rust Zcash crates.
+//!
+//! This is internal to zcashd and is not an officially-supported API.
+
+// Catch documentation errors caused by code changes.
+#![deny(broken_intra_doc_links)]
+// Clippy has a default-deny lint to prevent dereferencing raw pointer arguments
+// in a non-unsafe function. However, declaring a function as unsafe has the
+// side-effect that the entire function body is treated as an unsafe {} block,
+// and rustc will not enforce full safety checks on the parts of the function
+// that would otherwise be safe.
+//
+// The functions in this crate are all for FFI usage, so it's obvious to the
+// caller (which is only ever zcashd) that the arguments must satisfy the
+// necessary assumptions. We therefore ignore this lint to retain the benefit of
+// explicitly annotating the parts of each function that must themselves satisfy
+// assumptions of underlying code.
+//
+// See https://github.com/rust-lang/rfcs/pull/2585 for more background.
+#![allow(clippy::not_unsafe_ptr_arg_deref)]
+
+use bellman::groth16::{Parameters, PreparedVerifyingKey, Proof};
+use blake2s_simd::Params as Blake2sParams;
+use bls12_381::Bls12;
+use group::{cofactor::CofactorGroup, GroupEncoding};
+use libc::{c_uchar, size_t};
+use rand_core::{OsRng, RngCore};
+use std::fs::File;
+use std::io::BufReader;
+use std::path::{Path, PathBuf};
+use std::slice;
+use std::sync::Once;
+use subtle::CtOption;
+use tracing::{error, info};
+
+#[cfg(not(target_os = "windows"))]
+use std::ffi::OsStr;
+#[cfg(not(target_os = "windows"))]
+use std::os::unix::ffi::OsStrExt;
+
+#[cfg(target_os = "windows")]
+use std::ffi::OsString;
+#[cfg(target_os = "windows")]
+use std::os::windows::ffi::OsStringExt;
+
+use zcash_primitives::{
+    block::equihash,
+    constants::{CRH_IVK_PERSONALIZATION, PROOF_GENERATION_KEY_GENERATOR, SPENDING_KEY_GENERATOR},
+    merkle_tree::MerklePath,
+    sapling::{
+        self,
+        keys::FullViewingKey,
+        note_encryption::sapling_ka_agree,
+        redjubjub::{self, Signature},
+        Diversifier, Note, PaymentAddress, ProofGenerationKey, Rseed, ViewingKey,
+    },
+    sapling::{merkle_hash, spend_sig},
+    transaction::components::Amount,
+    zip32::{self, sapling_address, sapling_derive_internal_fvk, sapling_find_address},
+};
+use zcash_proofs::{
+    circuit::sapling::TREE_DEPTH as SAPLING_TREE_DEPTH,
+    load_parameters,
+    sapling::{SaplingProvingContext, SaplingVerificationContext},
+    sprout,
+};
+
+mod blake2b;
+mod ed25519;
+mod metrics_ffi;
+mod streams_ffi;
+mod tracing_ffi;
+mod zcashd_orchard;
+
+mod address_ffi;
+mod builder_ffi;
+mod history_ffi;
+mod incremental_merkle_tree;
+mod incremental_merkle_tree_ffi;
+mod orchard_ffi;
+mod orchard_keys_ffi;
+mod transaction_ffi;
+mod unified_keys_ffi;
+mod wallet;
+mod zip339_ffi;
+
+mod test_harness_ffi;
+
+#[cfg(test)]
+mod tests;
+
+static PROOF_PARAMETERS_LOADED: Once = Once::new();
+static mut SAPLING_SPEND_VK: Option<PreparedVerifyingKey<Bls12>> = None;
+static mut SAPLING_OUTPUT_VK: Option<PreparedVerifyingKey<Bls12>> = None;
+static mut SPROUT_GROTH16_VK: Option<PreparedVerifyingKey<Bls12>> = None;
+
+static mut SAPLING_SPEND_PARAMS: Option<Parameters<Bls12>> = None;
+static mut SAPLING_OUTPUT_PARAMS: Option<Parameters<Bls12>> = None;
+static mut SPROUT_GROTH16_PARAMS_PATH: Option<PathBuf> = None;
+
+static mut ORCHARD_PK: Option<orchard::circuit::ProvingKey> = None;
+static mut ORCHARD_VK: Option<orchard::circuit::VerifyingKey> = None;
+
+/// Converts CtOption<t> into Option<T>
+fn de_ct<T>(ct: CtOption<T>) -> Option<T> {
+    if ct.is_some().into() {
+        Some(ct.unwrap())
+    } else {
+        None
+    }
+}
+
+/// Reads an FsRepr from a [u8; 32]
+/// and multiplies it by the given base.
+fn fixed_scalar_mult(from: &[u8; 32], p_g: &jubjub::SubgroupPoint) -> jubjub::SubgroupPoint {
+    // We only call this with `from` being a valid jubjub::Scalar.
+    let f = jubjub::Scalar::from_bytes(from).unwrap();
+
+    p_g * f
+}
+
+/// Loads the zk-SNARK parameters into memory and saves paths as necessary.
+/// Only called once.
+#[no_mangle]
+pub extern "C" fn librustzcash_init_zksnark_params(
+    #[cfg(not(target_os = "windows"))] spend_path: *const u8,
+    #[cfg(target_os = "windows")] spend_path: *const u16,
+    spend_path_len: usize,
+    #[cfg(not(target_os = "windows"))] output_path: *const u8,
+    #[cfg(target_os = "windows")] output_path: *const u16,
+    output_path_len: usize,
+    #[cfg(not(target_os = "windows"))] sprout_path: *const u8,
+    #[cfg(target_os = "windows")] sprout_path: *const u16,
+    sprout_path_len: usize,
+) {
+    PROOF_PARAMETERS_LOADED.call_once(|| {
+        #[cfg(not(target_os = "windows"))]
+        let (spend_path, output_path, sprout_path) = {
+            (
+                OsStr::from_bytes(unsafe { slice::from_raw_parts(spend_path, spend_path_len) }),
+                OsStr::from_bytes(unsafe { slice::from_raw_parts(output_path, output_path_len) }),
+                if sprout_path.is_null() {
+                    None
+                } else {
+                    Some(OsStr::from_bytes(unsafe {
+                        slice::from_raw_parts(sprout_path, sprout_path_len)
+                    }))
+                },
+            )
+        };
+
+        #[cfg(target_os = "windows")]
+        let (spend_path, output_path, sprout_path) = {
+            (
+                OsString::from_wide(unsafe { slice::from_raw_parts(spend_path, spend_path_len) }),
+                OsString::from_wide(unsafe { slice::from_raw_parts(output_path, output_path_len) }),
+                if sprout_path.is_null() {
+                    None
+                } else {
+                    Some(OsString::from_wide(unsafe {
+                        slice::from_raw_parts(sprout_path, sprout_path_len)
+                    }))
+                },
+            )
+        };
+
+        let (spend_path, output_path, sprout_path) = (
+            Path::new(&spend_path),
+            Path::new(&output_path),
+            sprout_path.as_ref().map(Path::new),
+        );
+
+        // Load params
+        let params = load_parameters(spend_path, output_path, sprout_path);
+
+        // Generate Orchard parameters.
+        info!(target: "main", "Loading Orchard parameters");
+        let orchard_pk = orchard::circuit::ProvingKey::build();
+        let orchard_vk = orchard::circuit::VerifyingKey::build();
+
+        // Caller is responsible for calling this function once, so
+        // these global mutations are safe.
+        unsafe {
+            SAPLING_SPEND_PARAMS = Some(params.spend_params);
+            SAPLING_OUTPUT_PARAMS = Some(params.output_params);
+            SPROUT_GROTH16_PARAMS_PATH = sprout_path.map(|p| p.to_owned());
+
+            SAPLING_SPEND_VK = Some(params.spend_vk);
+            SAPLING_OUTPUT_VK = Some(params.output_vk);
+            SPROUT_GROTH16_VK = params.sprout_vk;
+
+            ORCHARD_PK = Some(orchard_pk);
+            ORCHARD_VK = Some(orchard_vk);
+        }
+    });
+}
+
+/// Writes the "uncommitted" note value for empty leaves of the Merkle tree.
+///
+/// `result` must be a valid pointer to 32 bytes which will be written.
+#[no_mangle]
+pub extern "C" fn librustzcash_tree_uncommitted(result: *mut [c_uchar; 32]) {
+    let tmp = Note::uncommitted().to_bytes();
+
+    // Should be okay, caller is responsible for ensuring the pointer
+    // is a valid pointer to 32 bytes that can be mutated.
+    let result = unsafe { &mut *result };
+    *result = tmp;
+}
+
+/// Computes a merkle tree hash for a given depth. The `depth` parameter should
+/// not be larger than 62.
+///
+/// `a` and `b` each must be of length 32, and must each be scalars of BLS12-381.
+///
+/// The result of the merkle tree hash is placed in `result`, which must also be
+/// of length 32.
+#[no_mangle]
+pub extern "C" fn librustzcash_merkle_hash(
+    depth: size_t,
+    a: *const [c_uchar; 32],
+    b: *const [c_uchar; 32],
+    result: *mut [c_uchar; 32],
+) {
+    // Should be okay, because caller is responsible for ensuring
+    // the pointers are valid pointers to 32 bytes.
+    let tmp = merkle_hash(depth, unsafe { &*a }, unsafe { &*b });
+
+    // Should be okay, caller is responsible for ensuring the pointer
+    // is a valid pointer to 32 bytes that can be mutated.
+    let result = unsafe { &mut *result };
+    *result = tmp;
+}
+
+#[no_mangle] // ToScalar
+pub extern "C" fn librustzcash_to_scalar(input: *const [c_uchar; 64], result: *mut [c_uchar; 32]) {
+    // Should be okay, because caller is responsible for ensuring
+    // the pointer is a valid pointer to 32 bytes, and that is the
+    // size of the representation
+    let scalar = jubjub::Scalar::from_bytes_wide(unsafe { &*input });
+
+    let result = unsafe { &mut *result };
+
+    *result = scalar.to_bytes();
+}
+
+#[no_mangle]
+pub extern "C" fn librustzcash_ask_to_ak(ask: *const [c_uchar; 32], result: *mut [c_uchar; 32]) {
+    let ask = unsafe { &*ask };
+    let ak = fixed_scalar_mult(ask, &SPENDING_KEY_GENERATOR);
+
+    let result = unsafe { &mut *result };
+
+    *result = ak.to_bytes();
+}
+
+#[no_mangle]
+pub extern "C" fn librustzcash_nsk_to_nk(nsk: *const [c_uchar; 32], result: *mut [c_uchar; 32]) {
+    let nsk = unsafe { &*nsk };
+    let nk = fixed_scalar_mult(nsk, &PROOF_GENERATION_KEY_GENERATOR);
+
+    let result = unsafe { &mut *result };
+
+    *result = nk.to_bytes();
+}
+
+#[no_mangle]
+pub extern "C" fn librustzcash_crh_ivk(
+    ak: *const [c_uchar; 32],
+    nk: *const [c_uchar; 32],
+    result: *mut [c_uchar; 32],
+) {
+    let ak = unsafe { &*ak };
+    let nk = unsafe { &*nk };
+
+    let mut h = Blake2sParams::new()
+        .hash_length(32)
+        .personal(CRH_IVK_PERSONALIZATION)
+        .to_state();
+    h.update(ak);
+    h.update(nk);
+    let mut h = h.finalize().as_ref().to_vec();
+
+    // Drop the last five bits, so it can be interpreted as a scalar.
+    h[31] &= 0b0000_0111;
+
+    let result = unsafe { &mut *result };
+
+    result.copy_from_slice(&h);
+}
+
+#[no_mangle]
+pub extern "C" fn librustzcash_check_diversifier(diversifier: *const [c_uchar; 11]) -> bool {
+    let diversifier = Diversifier(unsafe { *diversifier });
+    diversifier.g_d().is_some()
+}
+
+#[no_mangle]
+pub extern "C" fn librustzcash_ivk_to_pkd(
+    ivk: *const [c_uchar; 32],
+    diversifier: *const [c_uchar; 11],
+    result: *mut [c_uchar; 32],
+) -> bool {
+    let ivk = de_ct(jubjub::Scalar::from_bytes(unsafe { &*ivk }));
+    let diversifier = Diversifier(unsafe { *diversifier });
+    if let (Some(ivk), Some(g_d)) = (ivk, diversifier.g_d()) {
+        let pk_d = g_d * ivk;
+
+        let result = unsafe { &mut *result };
+
+        *result = pk_d.to_bytes();
+
+        true
+    } else {
+        false
+    }
+}
+
+/// Test generation of commitment randomness
+#[test]
+fn test_gen_r() {
+    let mut r1 = [0u8; 32];
+    let mut r2 = [0u8; 32];
+
+    // Verify different r values are generated
+    librustzcash_sapling_generate_r(&mut r1);
+    librustzcash_sapling_generate_r(&mut r2);
+    assert_ne!(r1, r2);
+
+    // Verify r values are valid in the field
+    let _ = jubjub::Scalar::from_bytes(&r1).unwrap();
+    let _ = jubjub::Scalar::from_bytes(&r2).unwrap();
+}
+
+/// Generate uniformly random scalar in Jubjub. The result is of length 32.
+#[no_mangle]
+pub extern "C" fn librustzcash_sapling_generate_r(result: *mut [c_uchar; 32]) {
+    // create random 64 byte buffer
+    let mut rng = OsRng;
+    let mut buffer = [0u8; 64];
+    rng.fill_bytes(&mut buffer);
+
+    // reduce to uniform value
+    let r = jubjub::Scalar::from_bytes_wide(&buffer);
+    let result = unsafe { &mut *result };
+    *result = r.to_bytes();
+}
+
+// Private utility function to get Note from C parameters
+fn priv_get_note(
+    zip216_enabled: bool,
+    diversifier: *const [c_uchar; 11],
+    pk_d: *const [c_uchar; 32],
+    value: u64,
+    rcm: *const [c_uchar; 32],
+) -> Result<Note, ()> {
+    let diversifier = Diversifier(unsafe { *diversifier });
+    let g_d = diversifier.g_d().ok_or(())?;
+
+    let pk_d = de_ct(if zip216_enabled {
+        jubjub::ExtendedPoint::from_bytes(unsafe { &*pk_d })
+    } else {
+        jubjub::AffinePoint::from_bytes_pre_zip216_compatibility(unsafe { *pk_d }).map(|p| p.into())
+    })
+    .ok_or(())?;
+
+    let pk_d = de_ct(pk_d.into_subgroup()).ok_or(())?;
+
+    // Deserialize randomness
+    // If this is after ZIP 212, the caller has calculated rcm, and we don't need to call
+    // Note::derive_esk, so we just pretend the note was using this rcm all along.
+    let rseed = Rseed::BeforeZip212(de_ct(jubjub::Scalar::from_bytes(unsafe { &*rcm })).ok_or(())?);
+
+    let note = Note {
+        value,
+        g_d,
+        pk_d,
+        rseed,
+    };
+
+    Ok(note)
+}
+
+/// Compute a Sapling nullifier.
+///
+/// The `diversifier` parameter must be 11 bytes in length.
+/// The `pk_d`, `r`, `ak` and `nk` parameters must be of length 32.
+/// The result is also of length 32 and placed in `result`.
+/// Returns false if `diversifier` or `pk_d` is not valid.
+#[no_mangle]
+pub extern "C" fn librustzcash_sapling_compute_nf(
+    diversifier: *const [c_uchar; 11],
+    pk_d: *const [c_uchar; 32],
+    value: u64,
+    rcm: *const [c_uchar; 32],
+    ak: *const [c_uchar; 32],
+    nk: *const [c_uchar; 32],
+    position: u64,
+    result: *mut [c_uchar; 32],
+) -> bool {
+    // ZIP 216: Nullifier derivation is not consensus-critical
+    // (nullifiers are revealed, not calculated by consensus).
+    let note = match priv_get_note(true, diversifier, pk_d, value, rcm) {
+        Ok(p) => p,
+        Err(_) => return false,
+    };
+
+    let ak = match de_ct(jubjub::ExtendedPoint::from_bytes(unsafe { &*ak })) {
+        Some(p) => p,
+        None => return false,
+    };
+
+    let ak = match de_ct(ak.into_subgroup()) {
+        Some(ak) => ak,
+        None => return false,
+    };
+
+    let nk = match de_ct(jubjub::ExtendedPoint::from_bytes(unsafe { &*nk })) {
+        Some(p) => p,
+        None => return false,
+    };
+
+    let nk = match de_ct(nk.into_subgroup()) {
+        Some(nk) => nk,
+        None => return false,
+    };
+
+    let vk = ViewingKey { ak, nk };
+    let nf = note.nf(&vk, position);
+    let result = unsafe { &mut *result };
+    result.copy_from_slice(&nf.0);
+
+    true
+}
+
+/// Compute a Sapling commitment.
+///
+/// The `diversifier` parameter must be 11 bytes in length.
+/// The `pk_d` and `r` parameters must be of length 32.
+/// The result is also of length 32 and placed in `result`.
+/// Returns false if `diversifier` or `pk_d` is not valid.
+#[no_mangle]
+pub extern "C" fn librustzcash_sapling_compute_cmu(
+    zip216_enabled: bool,
+    diversifier: *const [c_uchar; 11],
+    pk_d: *const [c_uchar; 32],
+    value: u64,
+    rcm: *const [c_uchar; 32],
+    result: *mut [c_uchar; 32],
+) -> bool {
+    let note = match priv_get_note(zip216_enabled, diversifier, pk_d, value, rcm) {
+        Ok(p) => p,
+        Err(_) => return false,
+    };
+
+    let result = unsafe { &mut *result };
+    *result = note.cmu().to_bytes();
+
+    true
+}
+
+/// Computes \[sk\] \[8\] P for some 32-byte point P, and 32-byte Fs.
+///
+/// If P or sk are invalid, returns false. Otherwise, the result is written to
+/// the 32-byte `result` buffer.
+#[no_mangle]
+pub extern "C" fn librustzcash_sapling_ka_agree(
+    zip216_enabled: bool,
+    p: *const [c_uchar; 32],
+    sk: *const [c_uchar; 32],
+    result: *mut [c_uchar; 32],
+) -> bool {
+    // Deserialize p
+    let p = match de_ct(if zip216_enabled {
+        jubjub::ExtendedPoint::from_bytes(unsafe { &*p })
+    } else {
+        jubjub::AffinePoint::from_bytes_pre_zip216_compatibility(unsafe { *p }).map(|p| p.into())
+    }) {
+        Some(p) => p,
+        None => return false,
+    };
+
+    // Deserialize sk
+    let sk = match de_ct(jubjub::Scalar::from_bytes(unsafe { &*sk })) {
+        Some(p) => p,
+        None => return false,
+    };
+
+    // Compute key agreement
+    let ka = sapling_ka_agree(&sk, &p);
+
+    // Produce result
+    let result = unsafe { &mut *result };
+    *result = ka.to_bytes();
+
+    true
+}
+
+/// Compute g_d = GH(diversifier) and returns false if the diversifier is
+/// invalid. Computes \[esk\] g_d and writes the result to the 32-byte `result`
+/// buffer. Returns false if `esk` is not a valid scalar.
+#[no_mangle]
+pub extern "C" fn librustzcash_sapling_ka_derivepublic(
+    diversifier: *const [c_uchar; 11],
+    esk: *const [c_uchar; 32],
+    result: *mut [c_uchar; 32],
+) -> bool {
+    let diversifier = Diversifier(unsafe { *diversifier });
+
+    // Compute g_d from the diversifier
+    let g_d = match diversifier.g_d() {
+        Some(g) => g,
+        None => return false,
+    };
+
+    // Deserialize esk
+    let esk = match de_ct(jubjub::Scalar::from_bytes(unsafe { &*esk })) {
+        Some(p) => p,
+        None => return false,
+    };
+
+    let p = g_d * esk;
+
+    let result = unsafe { &mut *result };
+    *result = p.to_bytes();
+
+    true
+}
+
+/// Validates the provided Equihash solution against the given parameters, input
+/// and nonce.
+#[no_mangle]
+pub extern "C" fn librustzcash_eh_isvalid(
+    n: u32,
+    k: u32,
+    input: *const c_uchar,
+    input_len: size_t,
+    nonce: *const c_uchar,
+    nonce_len: size_t,
+    soln: *const c_uchar,
+    soln_len: size_t,
+) -> bool {
+    let expected_soln_len = (1 << k) * ((n / (k + 1)) as usize + 1) / 8;
+    if (k >= n) || (n % 8 != 0) || (soln_len != expected_soln_len) {
+        error!(
+            "eh_isvalid: params wrong, n={}, k={}, soln_len={} expected={}",
+            n, k, soln_len, expected_soln_len,
+        );
+        return false;
+    }
+    let rs_input = unsafe { slice::from_raw_parts(input, input_len) };
+    let rs_nonce = unsafe { slice::from_raw_parts(nonce, nonce_len) };
+    let rs_soln = unsafe { slice::from_raw_parts(soln, soln_len) };
+    if let Err(e) = equihash::is_valid_solution(n, k, rs_input, rs_nonce, rs_soln) {
+        error!("eh_isvalid: is_valid_solution: {}", e);
+        false
+    } else {
+        true
+    }
+}
+
+/// Creates a Sapling verification context. Please free this when you're done.
+#[no_mangle]
+pub extern "C" fn librustzcash_sapling_verification_ctx_init(
+    zip216_enabled: bool,
+) -> *mut SaplingVerificationContext {
+    let ctx = Box::new(SaplingVerificationContext::new(zip216_enabled));
+
+    Box::into_raw(ctx)
+}
+
+/// Frees a Sapling verification context returned from
+/// [`librustzcash_sapling_verification_ctx_init`].
+#[no_mangle]
+pub extern "C" fn librustzcash_sapling_verification_ctx_free(ctx: *mut SaplingVerificationContext) {
+    drop(unsafe { Box::from_raw(ctx) });
+}
+
+const GROTH_PROOF_SIZE: usize = 48 // π_A
+    + 96 // π_B
+    + 48; // π_C
+
+/// Check the validity of a Sapling Spend description, accumulating the value
+/// commitment into the context.
+#[no_mangle]
+pub extern "C" fn librustzcash_sapling_check_spend(
+    ctx: *mut SaplingVerificationContext,
+    cv: *const [c_uchar; 32],
+    anchor: *const [c_uchar; 32],
+    nullifier: *const [c_uchar; 32],
+    rk: *const [c_uchar; 32],
+    zkproof: *const [c_uchar; GROTH_PROOF_SIZE],
+    spend_auth_sig: *const [c_uchar; 64],
+    sighash_value: *const [c_uchar; 32],
+) -> bool {
+    // Deserialize the value commitment
+    let cv = match de_ct(jubjub::ExtendedPoint::from_bytes(unsafe { &*cv })) {
+        Some(p) => p,
+        None => return false,
+    };
+
+    // Deserialize the anchor, which should be an element
+    // of Fr.
+    let anchor = match de_ct(bls12_381::Scalar::from_bytes(unsafe { &*anchor })) {
+        Some(a) => a,
+        None => return false,
+    };
+
+    // Deserialize rk
+    let rk = match redjubjub::PublicKey::read(&(unsafe { &*rk })[..]) {
+        Ok(p) => p,
+        Err(_) => return false,
+    };
+
+    // Deserialize the signature
+    let spend_auth_sig = match Signature::read(&(unsafe { &*spend_auth_sig })[..]) {
+        Ok(sig) => sig,
+        Err(_) => return false,
+    };
+
+    // Deserialize the proof
+    let zkproof = match Proof::read(&(unsafe { &*zkproof })[..]) {
+        Ok(p) => p,
+        Err(_) => return false,
+    };
+
+    unsafe { &mut *ctx }.check_spend(
+        cv,
+        anchor,
+        unsafe { &*nullifier },
+        rk,
+        unsafe { &*sighash_value },
+        spend_auth_sig,
+        zkproof,
+        unsafe { SAPLING_SPEND_VK.as_ref() }.unwrap(),
+    )
+}
+
+/// Check the validity of a Sapling Output description, accumulating the value
+/// commitment into the context.
+#[no_mangle]
+pub extern "C" fn librustzcash_sapling_check_output(
+    ctx: *mut SaplingVerificationContext,
+    cv: *const [c_uchar; 32],
+    cm: *const [c_uchar; 32],
+    epk: *const [c_uchar; 32],
+    zkproof: *const [c_uchar; GROTH_PROOF_SIZE],
+) -> bool {
+    // Deserialize the value commitment
+    let cv = match de_ct(jubjub::ExtendedPoint::from_bytes(unsafe { &*cv })) {
+        Some(p) => p,
+        None => return false,
+    };
+
+    // Deserialize the commitment, which should be an element
+    // of Fr.
+    let cm = match de_ct(bls12_381::Scalar::from_bytes(unsafe { &*cm })) {
+        Some(a) => a,
+        None => return false,
+    };
+
+    // Deserialize the ephemeral key
+    let epk = match de_ct(jubjub::ExtendedPoint::from_bytes(unsafe { &*epk })) {
+        Some(p) => p,
+        None => return false,
+    };
+
+    // Deserialize the proof
+    let zkproof = match Proof::read(&(unsafe { &*zkproof })[..]) {
+        Ok(p) => p,
+        Err(_) => return false,
+    };
+
+    unsafe { &mut *ctx }.check_output(
+        cv,
+        cm,
+        epk,
+        zkproof,
+        unsafe { SAPLING_OUTPUT_VK.as_ref() }.unwrap(),
+    )
+}
+
+/// Finally checks the validity of the entire Sapling transaction given
+/// valueBalance and the binding signature.
+#[no_mangle]
+pub extern "C" fn librustzcash_sapling_final_check(
+    ctx: *mut SaplingVerificationContext,
+    value_balance: i64,
+    binding_sig: *const [c_uchar; 64],
+    sighash_value: *const [c_uchar; 32],
+) -> bool {
+    let value_balance = match Amount::from_i64(value_balance) {
+        Ok(vb) => vb,
+        Err(()) => return false,
+    };
+
+    // Deserialize the signature
+    let binding_sig = match Signature::read(&(unsafe { &*binding_sig })[..]) {
+        Ok(sig) => sig,
+        Err(_) => return false,
+    };
+
+    unsafe { &*ctx }.final_check(value_balance, unsafe { &*sighash_value }, binding_sig)
+}
+
+/// Sprout JoinSplit proof generation.
+#[no_mangle]
+pub extern "C" fn librustzcash_sprout_prove(
+    proof_out: *mut [c_uchar; GROTH_PROOF_SIZE],
+
+    phi: *const [c_uchar; 32],
+    rt: *const [c_uchar; 32],
+    h_sig: *const [c_uchar; 32],
+
+    // First input
+    in_sk1: *const [c_uchar; 32],
+    in_value1: u64,
+    in_rho1: *const [c_uchar; 32],
+    in_r1: *const [c_uchar; 32],
+    in_auth1: *const [c_uchar; sprout::WITNESS_PATH_SIZE],
+
+    // Second input
+    in_sk2: *const [c_uchar; 32],
+    in_value2: u64,
+    in_rho2: *const [c_uchar; 32],
+    in_r2: *const [c_uchar; 32],
+    in_auth2: *const [c_uchar; sprout::WITNESS_PATH_SIZE],
+
+    // First output
+    out_pk1: *const [c_uchar; 32],
+    out_value1: u64,
+    out_r1: *const [c_uchar; 32],
+
+    // Second output
+    out_pk2: *const [c_uchar; 32],
+    out_value2: u64,
+    out_r2: *const [c_uchar; 32],
+
+    // Public value
+    vpub_old: u64,
+    vpub_new: u64,
+) {
+    // Load parameters from disk
+    let sprout_fs = File::open(
+        unsafe { &SPROUT_GROTH16_PARAMS_PATH }
+            .as_ref()
+            .expect("parameters should have been initialized"),
+    )
+    .expect("couldn't load Sprout groth16 parameters file");
+
+    let mut sprout_fs = BufReader::with_capacity(1024 * 1024, sprout_fs);
+
+    let params = Parameters::read(&mut sprout_fs, false)
+        .expect("couldn't deserialize Sprout JoinSplit parameters file");
+
+    drop(sprout_fs);
+
+    let proof = sprout::create_proof(
+        unsafe { *phi },
+        unsafe { *rt },
+        unsafe { *h_sig },
+        unsafe { *in_sk1 },
+        in_value1,
+        unsafe { *in_rho1 },
+        unsafe { *in_r1 },
+        unsafe { &*in_auth1 },
+        unsafe { *in_sk2 },
+        in_value2,
+        unsafe { *in_rho2 },
+        unsafe { *in_r2 },
+        unsafe { &*in_auth2 },
+        unsafe { *out_pk1 },
+        out_value1,
+        unsafe { *out_r1 },
+        unsafe { *out_pk2 },
+        out_value2,
+        unsafe { *out_r2 },
+        vpub_old,
+        vpub_new,
+        &params,
+    );
+
+    proof
+        .write(&mut (unsafe { &mut *proof_out })[..])
+        .expect("should be able to serialize a proof");
+}
+
+/// Sprout JoinSplit proof verification.
+#[no_mangle]
+pub extern "C" fn librustzcash_sprout_verify(
+    proof: *const [c_uchar; GROTH_PROOF_SIZE],
+    rt: *const [c_uchar; 32],
+    h_sig: *const [c_uchar; 32],
+    mac1: *const [c_uchar; 32],
+    mac2: *const [c_uchar; 32],
+    nf1: *const [c_uchar; 32],
+    nf2: *const [c_uchar; 32],
+    cm1: *const [c_uchar; 32],
+    cm2: *const [c_uchar; 32],
+    vpub_old: u64,
+    vpub_new: u64,
+) -> bool {
+    sprout::verify_proof(
+        unsafe { &*proof },
+        unsafe { &*rt },
+        unsafe { &*h_sig },
+        unsafe { &*mac1 },
+        unsafe { &*mac2 },
+        unsafe { &*nf1 },
+        unsafe { &*nf2 },
+        unsafe { &*cm1 },
+        unsafe { &*cm2 },
+        vpub_old,
+        vpub_new,
+        unsafe { SPROUT_GROTH16_VK.as_ref() }.expect("parameters should have been initialized"),
+    )
+}
+
+/// This function (using the proving context) constructs an Output proof given
+/// the necessary witness information. It outputs `cv` and the `zkproof`.
+#[no_mangle]
+pub extern "C" fn librustzcash_sapling_output_proof(
+    ctx: *mut SaplingProvingContext,
+    esk: *const [c_uchar; 32],
+    payment_address: *const [c_uchar; 43],
+    rcm: *const [c_uchar; 32],
+    value: u64,
+    cv: *mut [c_uchar; 32],
+    zkproof: *mut [c_uchar; GROTH_PROOF_SIZE],
+) -> bool {
+    // Grab `esk`, which the caller should have constructed for the DH key exchange.
+    let esk = match de_ct(jubjub::Scalar::from_bytes(unsafe { &*esk })) {
+        Some(p) => p,
+        None => return false,
+    };
+
+    // Grab the payment address from the caller
+    let payment_address = match PaymentAddress::from_bytes(unsafe { &*payment_address }) {
+        Some(pa) => pa,
+        None => return false,
+    };
+
+    // The caller provides the commitment randomness for the output note
+    let rcm = match de_ct(jubjub::Scalar::from_bytes(unsafe { &*rcm })) {
+        Some(p) => p,
+        None => return false,
+    };
+
+    // Create proof
+    let (proof, value_commitment) = unsafe { &mut *ctx }.output_proof(
+        esk,
+        payment_address,
+        rcm,
+        value,
+        unsafe { SAPLING_OUTPUT_PARAMS.as_ref() }.unwrap(),
+    );
+
+    // Write the proof out to the caller
+    proof
+        .write(&mut (unsafe { &mut *zkproof })[..])
+        .expect("should be able to serialize a proof");
+
+    // Write the value commitment to the caller
+    *unsafe { &mut *cv } = value_commitment.to_bytes();
+
+    true
+}
+
+/// Computes the signature for each Spend description, given the key `ask`, the
+/// re-randomization `ar`, the 32-byte sighash `sighash`, and an output `result`
+/// buffer of 64-bytes for the signature.
+///
+/// This function will fail if the provided `ask` or `ar` are invalid.
+#[no_mangle]
+pub extern "C" fn librustzcash_sapling_spend_sig(
+    ask: *const [c_uchar; 32],
+    ar: *const [c_uchar; 32],
+    sighash: *const [c_uchar; 32],
+    result: *mut [c_uchar; 64],
+) -> bool {
+    // The caller provides the re-randomization of `ak`.
+    let ar = match de_ct(jubjub::Scalar::from_bytes(unsafe { &*ar })) {
+        Some(p) => p,
+        None => return false,
+    };
+
+    // The caller provides `ask`, the spend authorizing key.
+    let ask = match redjubjub::PrivateKey::read(&(unsafe { &*ask })[..]) {
+        Ok(p) => p,
+        Err(_) => return false,
+    };
+
+    // Initialize secure RNG
+    let mut rng = OsRng;
+
+    // Do the signing
+    let sig = spend_sig(ask, ar, unsafe { &*sighash }, &mut rng);
+
+    // Write out the signature
+    sig.write(&mut (unsafe { &mut *result })[..])
+        .expect("result should be 64 bytes");
+
+    true
+}
+
+/// This function (using the proving context) constructs a binding signature.
+///
+/// You must provide the intended valueBalance so that we can internally check
+/// consistency.
+#[no_mangle]
+pub extern "C" fn librustzcash_sapling_binding_sig(
+    ctx: *const SaplingProvingContext,
+    value_balance: i64,
+    sighash: *const [c_uchar; 32],
+    result: *mut [c_uchar; 64],
+) -> bool {
+    let value_balance = match Amount::from_i64(value_balance) {
+        Ok(vb) => vb,
+        Err(()) => return false,
+    };
+
+    // Sign
+    let sig = match unsafe { &*ctx }.binding_sig(value_balance, unsafe { &*sighash }) {
+        Ok(s) => s,
+        Err(_) => return false,
+    };
+
+    // Write out signature
+    sig.write(&mut (unsafe { &mut *result })[..])
+        .expect("result should be 64 bytes");
+
+    true
+}
+
+/// This function (using the proving context) constructs a Spend proof given the
+/// necessary witness information. It outputs `cv` (the value commitment) and
+/// `rk` (so that you don't have to compute it) along with the proof.
+#[no_mangle]
+pub extern "C" fn librustzcash_sapling_spend_proof(
+    ctx: *mut SaplingProvingContext,
+    ak: *const [c_uchar; 32],
+    nsk: *const [c_uchar; 32],
+    diversifier: *const [c_uchar; 11],
+    rcm: *const [c_uchar; 32],
+    ar: *const [c_uchar; 32],
+    value: u64,
+    anchor: *const [c_uchar; 32],
+    merkle_path: *const [c_uchar; 1 + 33 * SAPLING_TREE_DEPTH + 8],
+    cv: *mut [c_uchar; 32],
+    rk_out: *mut [c_uchar; 32],
+    zkproof: *mut [c_uchar; GROTH_PROOF_SIZE],
+) -> bool {
+    // Grab `ak` from the caller, which should be a point.
+    let ak = match de_ct(jubjub::ExtendedPoint::from_bytes(unsafe { &*ak })) {
+        Some(p) => p,
+        None => return false,
+    };
+
+    // `ak` should be prime order.
+    let ak = match de_ct(ak.into_subgroup()) {
+        Some(p) => p,
+        None => return false,
+    };
+
+    // Grab `nsk` from the caller
+    let nsk = match de_ct(jubjub::Scalar::from_bytes(unsafe { &*nsk })) {
+        Some(p) => p,
+        None => return false,
+    };
+
+    // Construct the proof generation key
+    let proof_generation_key = ProofGenerationKey { ak, nsk };
+
+    // Grab the diversifier from the caller
+    let diversifier = Diversifier(unsafe { *diversifier });
+
+    // The caller chooses the note randomness
+    // If this is after ZIP 212, the caller has calculated rcm, and we don't need to call
+    // Note::derive_esk, so we just pretend the note was using this rcm all along.
+    let rseed = match de_ct(jubjub::Scalar::from_bytes(unsafe { &*rcm })) {
+        Some(p) => Rseed::BeforeZip212(p),
+        None => return false,
+    };
+
+    // The caller also chooses the re-randomization of ak
+    let ar = match de_ct(jubjub::Scalar::from_bytes(unsafe { &*ar })) {
+        Some(p) => p,
+        None => return false,
+    };
+
+    // We need to compute the anchor of the Spend.
+    let anchor = match de_ct(bls12_381::Scalar::from_bytes(unsafe { &*anchor })) {
+        Some(p) => p,
+        None => return false,
+    };
+
+    // Parse the Merkle path from the caller
+    let merkle_path = match MerklePath::from_slice(unsafe { &(&*merkle_path)[..] }) {
+        Ok(w) => w,
+        Err(_) => return false,
+    };
+
+    // Create proof
+    let (proof, value_commitment, rk) = unsafe { &mut *ctx }
+        .spend_proof(
+            proof_generation_key,
+            diversifier,
+            rseed,
+            ar,
+            value,
+            anchor,
+            merkle_path,
+            unsafe { SAPLING_SPEND_PARAMS.as_ref() }.unwrap(),
+            unsafe { SAPLING_SPEND_VK.as_ref() }.unwrap(),
+        )
+        .expect("proving should not fail");
+
+    // Write value commitment to caller
+    *unsafe { &mut *cv } = value_commitment.to_bytes();
+
+    // Write proof out to caller
+    proof
+        .write(&mut (unsafe { &mut *zkproof })[..])
+        .expect("should be able to serialize a proof");
+
+    // Write out `rk` to the caller
+    rk.write(&mut unsafe { &mut *rk_out }[..])
+        .expect("should be able to write to rk_out");
+
+    true
+}
+
+/// Creates a Sapling proving context. Please free this when you're done.
+#[no_mangle]
+pub extern "C" fn librustzcash_sapling_proving_ctx_init() -> *mut SaplingProvingContext {
+    let ctx = Box::new(SaplingProvingContext::new());
+
+    Box::into_raw(ctx)
+}
+
+/// Frees a Sapling proving context returned from
+/// [`librustzcash_sapling_proving_ctx_init`].
+#[no_mangle]
+pub extern "C" fn librustzcash_sapling_proving_ctx_free(ctx: *mut SaplingProvingContext) {
+    drop(unsafe { Box::from_raw(ctx) });
+}
+
+/// Derive the master ExtendedSpendingKey from a seed.
+#[no_mangle]
+pub extern "C" fn librustzcash_zip32_sapling_xsk_master(
+    seed: *const c_uchar,
+    seedlen: size_t,
+    xsk_master: *mut [c_uchar; 169],
+) {
+    let seed = unsafe { std::slice::from_raw_parts(seed, seedlen) };
+
+    let xsk = zip32::ExtendedSpendingKey::master(seed);
+
+    xsk.write(&mut (unsafe { &mut *xsk_master })[..])
+        .expect("should be able to serialize an ExtendedSpendingKey");
+}
+
+/// Derive a child ExtendedSpendingKey from a parent.
+#[no_mangle]
+pub extern "C" fn librustzcash_zip32_sapling_xsk_derive(
+    xsk_parent: *const [c_uchar; 169],
+    i: u32,
+    xsk_i: *mut [c_uchar; 169],
+) {
+    let xsk_parent = zip32::ExtendedSpendingKey::read(&unsafe { *xsk_parent }[..])
+        .expect("valid ExtendedSpendingKey");
+    let i = zip32::ChildIndex::from_index(i);
+
+    let xsk = xsk_parent.derive_child(i);
+
+    xsk.write(&mut (unsafe { &mut *xsk_i })[..])
+        .expect("should be able to serialize an ExtendedSpendingKey");
+}
+
+/// Derive the Sapling internal spending key from the external extended
+/// spending key
+#[no_mangle]
+pub extern "C" fn librustzcash_zip32_sapling_xsk_derive_internal(
+    xsk_external: *const [c_uchar; 169],
+    xsk_internal_ret: *mut [c_uchar; 169],
+) {
+    let xsk_external = zip32::ExtendedSpendingKey::read(&unsafe { *xsk_external }[..])
+        .expect("valid ExtendedSpendingKey");
+
+    let xsk_internal = xsk_external.derive_internal();
+
+    xsk_internal
+        .write(&mut (unsafe { &mut *xsk_internal_ret })[..])
+        .expect("should be able to serialize an ExtendedSpendingKey");
+}
+
+/// Derive a child ExtendedFullViewingKey from a parent.
+#[no_mangle]
+pub extern "C" fn librustzcash_zip32_sapling_xfvk_derive(
+    xfvk_parent: *const [c_uchar; 169],
+    i: u32,
+    xfvk_i: *mut [c_uchar; 169],
+) -> bool {
+    let xfvk_parent = zip32::ExtendedFullViewingKey::read(&unsafe { *xfvk_parent }[..])
+        .expect("valid ExtendedFullViewingKey");
+    let i = zip32::ChildIndex::from_index(i);
+
+    let xfvk = match xfvk_parent.derive_child(i) {
+        Ok(xfvk) => xfvk,
+        Err(_) => return false,
+    };
+
+    xfvk.write(&mut (unsafe { &mut *xfvk_i })[..])
+        .expect("should be able to serialize an ExtendedFullViewingKey");
+
+    true
+}
+
+/// Derive the Sapling internal full viewing key from the corresponding external full viewing key
+#[no_mangle]
+pub extern "C" fn librustzcash_zip32_sapling_derive_internal_fvk(
+    fvk: *const [c_uchar; 96],
+    dk: *const [c_uchar; 32],
+    fvk_ret: *mut [c_uchar; 96],
+    dk_ret: *mut [c_uchar; 32],
+) {
+    let fvk = FullViewingKey::read(&unsafe { *fvk }[..]).expect("valid Sapling FullViewingKey");
+    let dk = zip32::DiversifierKey(unsafe { *dk });
+
+    let (fvk_internal, dk_internal) = sapling_derive_internal_fvk(&fvk, &dk);
+    let fvk_ret = unsafe { &mut *fvk_ret };
+    let dk_ret = unsafe { &mut *dk_ret };
+
+    fvk_ret.copy_from_slice(&fvk_internal.to_bytes());
+    dk_ret.copy_from_slice(&dk_internal.0);
+}
+
+/// Derive a PaymentAddress from an ExtendedFullViewingKey.
+#[no_mangle]
+pub extern "C" fn librustzcash_zip32_sapling_address(
+    fvk: *const [c_uchar; 96],
+    dk: *const [c_uchar; 32],
+    j: *const [c_uchar; 11],
+    addr_ret: *mut [c_uchar; 43],
+) -> bool {
+    let fvk = FullViewingKey::read(&unsafe { *fvk }[..]).expect("valid Sapling FullViewingKey");
+    let dk = zip32::DiversifierKey(unsafe { *dk });
+    let j = zip32::DiversifierIndex(unsafe { *j });
+
+    match sapling_address(&fvk, &dk, j) {
+        Some(addr) => {
+            let addr_ret = unsafe { &mut *addr_ret };
+            addr_ret.copy_from_slice(&addr.to_bytes());
+
+            true
+        }
+        None => false,
+    }
+}
+
+/// Derive a PaymentAddress from an ExtendedFullViewingKey.
+#[no_mangle]
+pub extern "C" fn librustzcash_zip32_find_sapling_address(
+    fvk: *const [c_uchar; 96],
+    dk: *const [c_uchar; 32],
+    j: *const [c_uchar; 11],
+    j_ret: *mut [c_uchar; 11],
+    addr_ret: *mut [c_uchar; 43],
+) -> bool {
+    let fvk = FullViewingKey::read(&unsafe { *fvk }[..]).expect("valid Sapling FullViewingKey");
+    let dk = zip32::DiversifierKey(unsafe { *dk });
+    let j = zip32::DiversifierIndex(unsafe { *j });
+
+    match sapling_find_address(&fvk, &dk, j) {
+        Some((j, addr)) => {
+            let j_ret = unsafe { &mut *j_ret };
+            let addr_ret = unsafe { &mut *addr_ret };
+
+            j_ret.copy_from_slice(&j.0);
+            addr_ret.copy_from_slice(&addr.to_bytes());
+
+            true
+        }
+        None => false,
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn librustzcash_sapling_diversifier_index(
+    dk: *const [c_uchar; 32],
+    d: *const [c_uchar; 11],
+    j_ret: *mut [c_uchar; 11],
+) {
+    let dk = zip32::DiversifierKey(unsafe { *dk });
+    let diversifier = sapling::Diversifier(unsafe { *d });
+    let j_ret = unsafe { &mut *j_ret };
+
+    let j = dk.diversifier_index(&diversifier);
+    j_ret.copy_from_slice(&j.0);
+}
+
+#[no_mangle]
+pub extern "C" fn librustzcash_getrandom(buf: *mut u8, buf_len: usize) {
+    let buf = unsafe { slice::from_raw_parts_mut(buf, buf_len) };
+    OsRng.fill_bytes(buf);
+}
diff --git a/depend/zcash/src/rust/src/streams_ffi.rs b/depend/zcash/src/rust/src/streams_ffi.rs
new file mode 100644
index 000000000..18714c8ed
--- /dev/null
+++ b/depend/zcash/src/rust/src/streams_ffi.rs
@@ -0,0 +1,54 @@
+use std::io;
+use std::ptr::NonNull;
+
+use libc::{c_long, c_void, size_t};
+
+pub type StreamObj = NonNull<c_void>;
+pub type ReadCb =
+    unsafe extern "C" fn(obj: Option<StreamObj>, pch: *mut u8, size: size_t) -> c_long;
+pub type WriteCb =
+    unsafe extern "C" fn(obj: Option<StreamObj>, pch: *const u8, size: size_t) -> c_long;
+
+pub struct CppStreamReader {
+    inner: Option<StreamObj>,
+    cb: ReadCb,
+}
+
+impl CppStreamReader {
+    pub fn from_raw_parts(inner: Option<StreamObj>, cb: ReadCb) -> Self {
+        CppStreamReader { inner, cb }
+    }
+}
+
+impl io::Read for CppStreamReader {
+    fn read(&mut self, buf: &mut [u8]) -> io::Result<usize> {
+        match unsafe { (self.cb)(self.inner, buf.as_mut_ptr(), buf.len()) } {
+            -1 => Err(io::Error::new(io::ErrorKind::Other, "C++ stream error")),
+            n => Ok(n as usize),
+        }
+    }
+}
+
+pub struct CppStreamWriter {
+    inner: Option<StreamObj>,
+    cb: WriteCb,
+}
+
+impl CppStreamWriter {
+    pub fn from_raw_parts(inner: Option<StreamObj>, cb: WriteCb) -> Self {
+        CppStreamWriter { inner, cb }
+    }
+}
+
+impl io::Write for CppStreamWriter {
+    fn write(&mut self, buf: &[u8]) -> io::Result<usize> {
+        match unsafe { (self.cb)(self.inner, buf.as_ptr(), buf.len()) } {
+            -1 => Err(io::Error::new(io::ErrorKind::Other, "C++ stream error")),
+            n => Ok(n as usize),
+        }
+    }
+
+    fn flush(&mut self) -> io::Result<()> {
+        Ok(())
+    }
+}
diff --git a/depend/zcash/src/rust/src/test_harness_ffi.rs b/depend/zcash/src/rust/src/test_harness_ffi.rs
new file mode 100644
index 000000000..196a19824
--- /dev/null
+++ b/depend/zcash/src/rust/src/test_harness_ffi.rs
@@ -0,0 +1,13 @@
+use group::{ff::Field, Group, GroupEncoding};
+use jubjub::{ExtendedPoint, Fq};
+use rand_core::OsRng;
+
+#[no_mangle]
+pub extern "C" fn zcash_test_harness_random_jubjub_base(ret: *mut [u8; 32]) {
+    *unsafe { &mut *ret } = Fq::random(OsRng).to_bytes();
+}
+
+#[no_mangle]
+pub extern "C" fn zcash_test_harness_random_jubjub_point(ret: *mut [u8; 32]) {
+    *unsafe { &mut *ret } = ExtendedPoint::random(OsRng).to_bytes();
+}
diff --git a/depend/zcash/src/rust/src/tests/key_agreement.rs b/depend/zcash/src/rust/src/tests/key_agreement.rs
new file mode 100644
index 000000000..cb1044f5a
--- /dev/null
+++ b/depend/zcash/src/rust/src/tests/key_agreement.rs
@@ -0,0 +1,72 @@
+use group::{Group, GroupEncoding};
+use rand_core::{OsRng, RngCore};
+use zcash_primitives::sapling::{Diversifier, ViewingKey};
+
+use crate::{
+    librustzcash_sapling_generate_r, librustzcash_sapling_ka_agree,
+    librustzcash_sapling_ka_derivepublic,
+};
+
+#[test]
+fn test_key_agreement() {
+    let mut rng = OsRng;
+
+    // Create random viewing key
+    let vk = ViewingKey {
+        ak: jubjub::SubgroupPoint::random(&mut rng),
+        nk: jubjub::SubgroupPoint::random(&mut rng),
+    };
+
+    // Create a random address with the viewing key
+    let addr = loop {
+        let mut d = [0; 11];
+        rng.fill_bytes(&mut d);
+        if let Some(a) = vk.to_payment_address(Diversifier(d)) {
+            break a;
+        }
+    };
+
+    // Grab ivk from our viewing key in serialized form
+    let ivk = vk.ivk();
+    let ivk_serialized = ivk.to_repr();
+
+    // Create random esk
+    let mut esk = [0u8; 32];
+    librustzcash_sapling_generate_r(&mut esk);
+
+    // The sender will create a shared secret with the recipient
+    // by multiplying the pk_d from their address with the esk
+    // we randomly generated
+    let mut shared_secret_sender = [0u8; 32];
+
+    // Serialize pk_d for the call to librustzcash_sapling_ka_agree
+    let addr_pk_d = addr.pk_d().to_bytes();
+
+    assert!(librustzcash_sapling_ka_agree(
+        true,
+        &addr_pk_d,
+        &esk,
+        &mut shared_secret_sender
+    ));
+
+    // Create epk for the recipient, placed in the transaction. Computed
+    // using the diversifier and esk.
+    let mut epk = [0u8; 32];
+    assert!(librustzcash_sapling_ka_derivepublic(
+        &addr.diversifier().0,
+        &esk,
+        &mut epk
+    ));
+
+    // Create sharedSecret with ephemeral key
+    let mut shared_secret_recipient = [0u8; 32];
+    assert!(librustzcash_sapling_ka_agree(
+        true,
+        &epk,
+        &ivk_serialized,
+        &mut shared_secret_recipient
+    ));
+
+    assert!(!shared_secret_sender.iter().all(|&v| v == 0));
+    assert_eq!(shared_secret_sender, shared_secret_recipient);
+}
diff --git a/depend/zcash/src/rust/src/tests/key_components.rs b/depend/zcash/src/rust/src/tests/key_components.rs
new file mode 100644
index 000000000..1169c4801
--- /dev/null
+++ b/depend/zcash/src/rust/src/tests/key_components.rs
@@ -0,0 +1,703 @@
+use group::GroupEncoding;
+use zcash_primitives::{
+    constants::SPENDING_KEY_GENERATOR,
+    sapling::{Diversifier, Nullifier, ProofGenerationKey, Rseed},
+};
+
+use crate::{
+    librustzcash_ask_to_ak, librustzcash_check_diversifier, librustzcash_crh_ivk,
+    librustzcash_ivk_to_pkd, librustzcash_nsk_to_nk,
+};
+
+#[test]
+fn key_components() {
+    #![allow(dead_code)]
+    struct TestVector {
+        sk: [u8; 32],
+        ask: [u8; 32],
+        nsk: [u8; 32],
+        ovk: [u8; 32],
+        ak: [u8; 32],
+        nk: [u8; 32],
+        ivk: [u8; 32],
+        default_d: [u8; 11],
+        default_pk_d: [u8; 32],
+        note_v: u64,
+        note_r: [u8; 32],
+        note_cm: [u8; 32],
+        note_pos: u64,
+        note_nf: [u8; 32],
+    }
+
+    // From https://github.com/zcash-hackworks/zcash-test-vectors/blob/master/sapling_key_components.py
+    let test_vectors = vec![
+        TestVector {
+            sk: [
+                0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+                0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+                0x00, 0x00, 0x00, 0x00,
+            ],
+            ask: [
+                0x85, 0x48, 0xa1, 0x4a, 0x47, 0x3e, 0xa5, 0x47, 0xaa, 0x23, 0x78, 0x40, 0x20, 0x44,
+                0xf8, 0x18, 0xcf, 0x19, 0x11, 0xcf, 0x5d, 0xd2, 0x05, 0x4f, 0x67, 0x83, 0x45, 0xf0,
+                0x0d, 0x0e, 0x88, 0x06,
+            ],
+            nsk: [
+                0x30, 0x11, 0x4e, 0xa0, 0xdd, 0x0b, 0xb6, 0x1c, 0xf0, 0xea, 0xea, 0xb6, 0xec, 0x33,
+                0x31, 0xf5, 0x81, 0xb0, 0x42, 0x5e, 0x27, 0x33, 0x85, 0x01, 0x26, 0x2d, 0x7e, 0xac,
+                0x74, 0x5e, 0x6e, 0x05,
+            ],
+            ovk: [
+                0x98, 0xd1, 0x69, 0x13, 0xd9, 0x9b, 0x04, 0x17, 0x7c, 0xab, 0xa4, 0x4f, 0x6e, 0x4d,
+                0x22, 0x4e, 0x03, 0xb5, 0xac, 0x03, 0x1d, 0x7c, 0xe4, 0x5e, 0x86, 0x51, 0x38, 0xe1,
+                0xb9, 0x96, 0xd6, 0x3b,
+            ],
+            ak: [
+                0xf3, 0x44, 0xec, 0x38, 0x0f, 0xe1, 0x27, 0x3e, 0x30, 0x98, 0xc2, 0x58, 0x8c, 0x5d,
+                0x3a, 0x79, 0x1f, 0xd7, 0xba, 0x95, 0x80, 0x32, 0x76, 0x07, 0x77, 0xfd, 0x0e, 0xfa,
+                0x8e, 0xf1, 0x16, 0x20,
+            ],
+            nk: [
+                0xf7, 0xcf, 0x9e, 0x77, 0xf2, 0xe5, 0x86, 0x83, 0x38, 0x3c, 0x15, 0x19, 0xac, 0x7b,
+                0x06, 0x2d, 0x30, 0x04, 0x0e, 0x27, 0xa7, 0x25, 0xfb, 0x88, 0xfb, 0x19, 0xa9, 0x78,
+                0xbd, 0x3f, 0xd6, 0xba,
+            ],
+            ivk: [
+                0xb7, 0x0b, 0x7c, 0xd0, 0xed, 0x03, 0xcb, 0xdf, 0xd7, 0xad, 0xa9, 0x50, 0x2e, 0xe2,
+                0x45, 0xb1, 0x3e, 0x56, 0x9d, 0x54, 0xa5, 0x71, 0x9d, 0x2d, 0xaa, 0x0f, 0x5f, 0x14,
+                0x51, 0x47, 0x92, 0x04,
+            ],
+            default_d: [
+                0xf1, 0x9d, 0x9b, 0x79, 0x7e, 0x39, 0xf3, 0x37, 0x44, 0x58, 0x39,
+            ],
+            default_pk_d: [
+                0xdb, 0x4c, 0xd2, 0xb0, 0xaa, 0xc4, 0xf7, 0xeb, 0x8c, 0xa1, 0x31, 0xf1, 0x65, 0x67,
+                0xc4, 0x45, 0xa9, 0x55, 0x51, 0x26, 0xd3, 0xc2, 0x9f, 0x14, 0xe3, 0xd7, 0x76, 0xe8,
+                0x41, 0xae, 0x74, 0x15,
+            ],
+            note_v: 0,
+            note_r: [
+                0x39, 0x17, 0x6d, 0xac, 0x39, 0xac, 0xe4, 0x98, 0x0e, 0xcc, 0x8d, 0x77, 0x8e, 0x89,
+                0x86, 0x02, 0x55, 0xec, 0x36, 0x15, 0x06, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+                0x00, 0x00, 0x00, 0x00,
+            ],
+            note_cm: [
+                0xcb, 0x3c, 0xf9, 0x15, 0x32, 0x70, 0xd5, 0x7e, 0xb9, 0x14, 0xc6, 0xc2, 0xbc, 0xc0,
+                0x18, 0x50, 0xc9, 0xfe, 0xd4, 0x4f, 0xce, 0x08, 0x06, 0x27, 0x8f, 0x08, 0x3e, 0xf2,
+                0xdd, 0x07, 0x64, 0x39,
+            ],
+            note_pos: 0,
+            note_nf: [
+                0x44, 0xfa, 0xd6, 0x56, 0x4f, 0xfd, 0xec, 0x9f, 0xa1, 0x9c, 0x43, 0xa2, 0x8f, 0x86,
+                0x1d, 0x5e, 0xbf, 0x60, 0x23, 0x46, 0x00, 0x7d, 0xe7, 0x62, 0x67, 0xd9, 0x75, 0x27,
+                0x47, 0xab, 0x40, 0x63,
+            ],
+        },
+        TestVector {
+            sk: [
+                0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,
+                0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,
+                0x01, 0x01, 0x01, 0x01,
+            ],
+            ask: [
+                0xc9, 0x43, 0x56, 0x29, 0xbf, 0x8b, 0xff, 0xe5, 0x5e, 0x73, 0x35, 0xec, 0x07, 0x77,
+                0x18, 0xba, 0x60, 0xba, 0x28, 0xd7, 0xac, 0x37, 0x94, 0xb7, 0x4f, 0x51, 0x2c, 0x31,
+                0xaf, 0x0a, 0x53, 0x04,
+            ],
+            nsk: [
+                0x11, 0xac, 0xc2, 0xea, 0xd0, 0x7b, 0x5f, 0x00, 0x8c, 0x1f, 0x0f, 0x09, 0x0c, 0xc8,
+                0xdd, 0xf3, 0x35, 0x23, 0x6f, 0xf4, 0xb2, 0x53, 0xc6, 0x49, 0x56, 0x95, 0xe9, 0xd6,
+                0x39, 0xda, 0xcd, 0x08,
+            ],
+            ovk: [
+                0x3b, 0x94, 0x62, 0x10, 0xce, 0x6d, 0x1b, 0x16, 0x92, 0xd7, 0x39, 0x2a, 0xc8, 0x4a,
+                0x8b, 0xc8, 0xf0, 0x3b, 0x72, 0x72, 0x3c, 0x7d, 0x36, 0x72, 0x1b, 0x80, 0x9a, 0x79,
+                0xc9, 0xd6, 0xe4, 0x5b,
+            ],
+            ak: [
+                0x82, 0xff, 0x5e, 0xff, 0xc5, 0x27, 0xae, 0x84, 0x02, 0x0b, 0xf2, 0xd3, 0x52, 0x01,
+                0xc1, 0x02, 0x19, 0x13, 0x19, 0x47, 0xff, 0x4b, 0x96, 0xf8, 0x81, 0xa4, 0x5f, 0x2e,
+                0x8a, 0xe3, 0x05, 0x18,
+            ],
+            nk: [
+                0xc4, 0x53, 0x4d, 0x84, 0x8b, 0xb9, 0x18, 0xcf, 0x4a, 0x7f, 0x8b, 0x98, 0x74, 0x0a,
+                0xb3, 0xcc, 0xee, 0x58, 0x67, 0x95, 0xff, 0x4d, 0xf6, 0x45, 0x47, 0xa8, 0x88, 0x8a,
+                0x6c, 0x74, 0x15, 0xd2,
+            ],
+            ivk: [
+                0xc5, 0x18, 0x38, 0x44, 0x66, 0xb2, 0x69, 0x88, 0xb5, 0x10, 0x90, 0x67, 0x41, 0x8d,
+                0x19, 0x2d, 0x9d, 0x6b, 0xd0, 0xd9, 0x23, 0x22, 0x05, 0xd7, 0x74, 0x18, 0xc2, 0x40,
+                0xfc, 0x68, 0xa4, 0x06,
+            ],
+            default_d: [
+                0xae, 0xf1, 0x80, 0xf6, 0xe3, 0x4e, 0x35, 0x4b, 0x88, 0x8f, 0x81,
+            ],
+            default_pk_d: [
+                0xa6, 0xb1, 0x3e, 0xa3, 0x36, 0xdd, 0xb7, 0xa6, 0x7b, 0xb0, 0x9a, 0x0e, 0x68, 0xe9,
+                0xd3, 0xcf, 0xb3, 0x92, 0x10, 0x83, 0x1e, 0xa3, 0xa2, 0x96, 0xba, 0x09, 0xa9, 0x22,
+                0x06, 0x0f, 0xd3, 0x8b,
+            ],
+            note_v: 12227227834928555328,
+            note_r: [
+                0x47, 0x8b, 0xa0, 0xee, 0x6e, 0x1a, 0x75, 0xb6, 0x00, 0x03, 0x6f, 0x26, 0xf1, 0x8b,
+                0x70, 0x15, 0xab, 0x55, 0x6b, 0xed, 0xdf, 0x8b, 0x96, 0x02, 0x38, 0x86, 0x9f, 0x89,
+                0xdd, 0x80, 0x4e, 0x06,
+            ],
+            note_cm: [
+                0xb5, 0x78, 0x93, 0x50, 0x0b, 0xfb, 0x85, 0xdf, 0x2e, 0x8b, 0x01, 0xac, 0x45, 0x2f,
+                0x89, 0xe1, 0x0e, 0x26, 0x6b, 0xcf, 0xa3, 0x1c, 0x31, 0xb2, 0x9a, 0x53, 0xae, 0x72,
+                0xca, 0xd4, 0x69, 0x50,
+            ],
+            note_pos: 763714296,
+            note_nf: [
+                0x67, 0x9e, 0xb0, 0xc3, 0xa7, 0x57, 0xe2, 0xae, 0x83, 0xcd, 0xb4, 0x2a, 0x1a, 0xb2,
+                0x59, 0xd7, 0x83, 0x88, 0x31, 0x54, 0x19, 0xad, 0xc7, 0x1d, 0x2e, 0x37, 0x63, 0x17,
+                0x4c, 0x2e, 0x9d, 0x93,
+            ],
+        },
+        TestVector {
+            sk: [
+                0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02,
+                0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02,
+                0x02, 0x02, 0x02, 0x02,
+            ],
+            ask: [
+                0xee, 0x1c, 0x3d, 0x7e, 0xfe, 0x0a, 0x78, 0x06, 0x3d, 0x6a, 0xf3, 0xd9, 0xd8, 0x12,
+                0x12, 0xaf, 0x47, 0xb7, 0xc1, 0xb7, 0x61, 0xf8, 0x5c, 0xcb, 0x06, 0x6f, 0xc1, 0x1a,
+                0x6a, 0x42, 0x17, 0x03,
+            ],
+            nsk: [
+                0x1d, 0x3b, 0x71, 0x37, 0x55, 0xd7, 0x48, 0x75, 0xe8, 0xea, 0x38, 0xfd, 0x16, 0x6e,
+                0x76, 0xc6, 0x2a, 0x42, 0x50, 0x21, 0x6e, 0x6b, 0xbf, 0xe4, 0x8a, 0x5e, 0x2e, 0xab,
+                0xad, 0x11, 0x7f, 0x0b,
+            ],
+            ovk: [
+                0x8b, 0xf4, 0x39, 0x0e, 0x28, 0xdd, 0xc9, 0x5b, 0x83, 0x02, 0xc3, 0x81, 0xd5, 0x81,
+                0x0b, 0x84, 0xba, 0x8e, 0x60, 0x96, 0xe5, 0xa7, 0x68, 0x22, 0x77, 0x4f, 0xd4, 0x9f,
+                0x49, 0x1e, 0x8f, 0x49,
+            ],
+            ak: [
+                0xab, 0x83, 0x57, 0x4e, 0xb5, 0xde, 0x85, 0x9a, 0x0a, 0xb8, 0x62, 0x9d, 0xec, 0x34,
+                0xc7, 0xbe, 0xe8, 0xc3, 0xfc, 0x74, 0xdf, 0xa0, 0xb1, 0x9a, 0x3a, 0x74, 0x68, 0xd1,
+                0x5d, 0xca, 0x64, 0xc6,
+            ],
+            nk: [
+                0x95, 0xd5, 0x80, 0x53, 0xe0, 0x59, 0x2e, 0x4a, 0x16, 0x9c, 0xc0, 0xb7, 0x92, 0x8a,
+                0xaa, 0xc3, 0xde, 0x24, 0xef, 0x15, 0x31, 0xaa, 0x9e, 0xb6, 0xf4, 0xab, 0x93, 0x91,
+                0x4d, 0xa8, 0xa0, 0x6e,
+            ],
+            ivk: [
+                0x47, 0x1c, 0x24, 0xa3, 0xdc, 0x87, 0x30, 0xe7, 0x50, 0x36, 0xc0, 0xa9, 0x5f, 0x3e,
+                0x2f, 0x7d, 0xd1, 0xbe, 0x6f, 0xb9, 0x3a, 0xd2, 0x95, 0x92, 0x20, 0x3d, 0xef, 0x30,
+                0x41, 0x95, 0x45, 0x05,
+            ],
+            default_d: [
+                0x75, 0x99, 0xf0, 0xbf, 0x9b, 0x57, 0xcd, 0x2d, 0xc2, 0x99, 0xb6,
+            ],
+            default_pk_d: [
+                0x66, 0x14, 0x17, 0x39, 0x51, 0x4b, 0x28, 0xf0, 0x5d, 0xef, 0x8a, 0x18, 0xee, 0xee,
+                0x5e, 0xed, 0x4d, 0x44, 0xc6, 0x22, 0x5c, 0x3c, 0x65, 0xd8, 0x8d, 0xd9, 0x90, 0x77,
+                0x08, 0x01, 0x2f, 0x5a,
+            ],
+            note_v: 6007711596147559040,
+            note_r: [
+                0x14, 0x7c, 0xf2, 0xb5, 0x1b, 0x4c, 0x7c, 0x63, 0xcb, 0x77, 0xb9, 0x9e, 0x8b, 0x78,
+                0x3e, 0x5b, 0x51, 0x11, 0xdb, 0x0a, 0x7c, 0xa0, 0x4d, 0x6c, 0x01, 0x4a, 0x1d, 0x7d,
+                0xa8, 0x3b, 0xae, 0x0a,
+            ],
+            note_cm: [
+                0xdb, 0x85, 0xa7, 0x0a, 0x98, 0x43, 0x7f, 0x73, 0x16, 0x7f, 0xc3, 0x32, 0xd5, 0xb7,
+                0xb7, 0x40, 0x82, 0x96, 0x66, 0x17, 0x70, 0xb1, 0x01, 0xb0, 0xaa, 0x87, 0x83, 0x9f,
+                0x4e, 0x55, 0xf1, 0x51,
+            ],
+            note_pos: 1527428592,
+            note_nf: [
+                0xe9, 0x8f, 0x6a, 0x8f, 0x34, 0xff, 0x49, 0x80, 0x59, 0xb3, 0xc7, 0x31, 0xb9, 0x1f,
+                0x45, 0x11, 0x08, 0xc4, 0x95, 0x4d, 0x91, 0x94, 0x84, 0x36, 0x1c, 0xf9, 0xb4, 0x8f,
+                0x59, 0xae, 0x1d, 0x14,
+            ],
+        },
+        TestVector {
+            sk: [
+                0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03,
+                0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03,
+                0x03, 0x03, 0x03, 0x03,
+            ],
+            ask: [
+                0x00, 0xc3, 0xa1, 0xe1, 0xca, 0x8f, 0x4e, 0x04, 0x80, 0xee, 0x1e, 0xe9, 0x0c, 0xa7,
+                0x51, 0x78, 0x79, 0xd3, 0xfc, 0x5c, 0x81, 0x5c, 0x09, 0x03, 0xe5, 0xee, 0xbc, 0x94,
+                0xbb, 0x80, 0x95, 0x03,
+            ],
+            nsk: [
+                0xe6, 0x62, 0x85, 0xa5, 0xe9, 0xb6, 0x5e, 0x15, 0x7a, 0xd2, 0xfc, 0xd5, 0x43, 0xda,
+                0xd9, 0x8c, 0x67, 0xa5, 0x8a, 0xbd, 0xf2, 0x87, 0xe0, 0x55, 0x06, 0xbd, 0x1c, 0x2e,
+                0x59, 0xb0, 0x72, 0x0b,
+            ],
+            ovk: [
+                0x14, 0x76, 0x78, 0xe0, 0x55, 0x3b, 0x97, 0x82, 0x93, 0x47, 0x64, 0x7c, 0x5b, 0xc7,
+                0xda, 0xb4, 0xcc, 0x22, 0x02, 0xb5, 0x4e, 0xc2, 0x9f, 0xd3, 0x1a, 0x3d, 0xe6, 0xbe,
+                0x08, 0x25, 0xfc, 0x5e,
+            ],
+            ak: [
+                0x3c, 0x9c, 0xde, 0x7e, 0x5d, 0x0d, 0x38, 0xa8, 0x61, 0x0f, 0xaa, 0xdb, 0xcf, 0x4c,
+                0x34, 0x3f, 0x5d, 0x3c, 0xfa, 0x31, 0x55, 0xa5, 0xb9, 0x46, 0x61, 0xa6, 0x75, 0x3e,
+                0x96, 0xe8, 0x84, 0xea,
+            ],
+            nk: [
+                0xb7, 0x7d, 0x36, 0xf5, 0x08, 0x94, 0x1d, 0xbd, 0x61, 0xcf, 0xd0, 0xf1, 0x59, 0xee,
+                0x05, 0xcf, 0xaa, 0x78, 0xa2, 0x6c, 0x94, 0x92, 0x90, 0x38, 0x06, 0xd8, 0x3b, 0x59,
+                0x8d, 0x3c, 0x1c, 0x2a,
+            ],
+            ivk: [
+                0x63, 0x6a, 0xa9, 0x64, 0xbf, 0xc2, 0x3c, 0xe4, 0xb1, 0xfc, 0xf7, 0xdf, 0xc9, 0x91,
+                0x79, 0xdd, 0xc4, 0x06, 0xff, 0x55, 0x40, 0x0c, 0x92, 0x95, 0xac, 0xfc, 0x14, 0xf0,
+                0x31, 0xc7, 0x26, 0x00,
+            ],
+            default_d: [
+                0x1b, 0x81, 0x61, 0x4f, 0x1d, 0xad, 0xea, 0x0f, 0x8d, 0x0a, 0x58,
+            ],
+            default_pk_d: [
+                0x25, 0xeb, 0x55, 0xfc, 0xcf, 0x76, 0x1f, 0xc6, 0x4e, 0x85, 0xa5, 0x88, 0xef, 0xe6,
+                0xea, 0xd7, 0x83, 0x2f, 0xb1, 0xf0, 0xf7, 0xa8, 0x31, 0x65, 0x89, 0x5b, 0xdf, 0xf9,
+                0x42, 0x92, 0x5f, 0x5c,
+            ],
+            note_v: 18234939431076114368,
+            note_r: [
+                0x34, 0xa4, 0xb2, 0xa9, 0x14, 0x4f, 0xf5, 0xea, 0x54, 0xef, 0xee, 0x87, 0xcf, 0x90,
+                0x1b, 0x5b, 0xed, 0x5e, 0x35, 0xd2, 0x1f, 0xbb, 0xd7, 0x88, 0xd5, 0xbd, 0x9d, 0x83,
+                0x3e, 0x11, 0x28, 0x04,
+            ],
+            note_cm: [
+                0xe0, 0x8c, 0xe4, 0x82, 0xb3, 0xa8, 0xfb, 0x3b, 0x35, 0xcc, 0xdb, 0xe3, 0x43, 0x37,
+                0xbd, 0x10, 0x5d, 0x88, 0x39, 0x21, 0x2e, 0x0d, 0x16, 0x44, 0xb9, 0xd5, 0x5c, 0xaa,
+                0x60, 0xd1, 0x9b, 0x6c,
+            ],
+            note_pos: 2291142888,
+            note_nf: [
+                0x55, 0x47, 0xaa, 0x12, 0xff, 0x80, 0xa6, 0xb3, 0x30, 0x4e, 0x3b, 0x05, 0x86, 0x56,
+                0x47, 0x2a, 0xbd, 0x2c, 0x81, 0x83, 0xb5, 0x9d, 0x07, 0x37, 0xb9, 0x3c, 0xee, 0x75,
+                0x8b, 0xec, 0x47, 0xa1,
+            ],
+        },
+        TestVector {
+            sk: [
+                0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04,
+                0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04,
+                0x04, 0x04, 0x04, 0x04,
+            ],
+            ask: [
+                0x82, 0x36, 0xd1, 0x9d, 0x32, 0x05, 0xd8, 0x55, 0x43, 0xa0, 0x68, 0x11, 0x34, 0x3f,
+                0x82, 0x7b, 0x65, 0x63, 0x77, 0x0a, 0x49, 0xaa, 0x4d, 0x0c, 0xa0, 0x08, 0x18, 0x05,
+                0xd4, 0xc8, 0xea, 0x0d,
+            ],
+            nsk: [
+                0x7e, 0xc1, 0xef, 0x0b, 0xed, 0x82, 0x71, 0x82, 0x72, 0xf0, 0xf4, 0x4f, 0x01, 0x7c,
+                0x48, 0x41, 0x74, 0x51, 0x3d, 0x66, 0x1d, 0xd1, 0x68, 0xaf, 0x02, 0xd2, 0x09, 0x2a,
+                0x1d, 0x8a, 0x05, 0x07,
+            ],
+            ovk: [
+                0x1b, 0x6e, 0x75, 0xec, 0xe3, 0xac, 0xe8, 0xdb, 0xa6, 0xa5, 0x41, 0x0d, 0x9a, 0xd4,
+                0x75, 0x56, 0x68, 0xe4, 0xb3, 0x95, 0x85, 0xd6, 0x35, 0xec, 0x1d, 0xa7, 0xc8, 0xdc,
+                0xfd, 0x5f, 0xc4, 0xed,
+            ],
+            ak: [
+                0x55, 0xe8, 0x83, 0x89, 0xbb, 0x7e, 0x41, 0xde, 0x13, 0x0c, 0xfa, 0x51, 0xa8, 0x71,
+                0x5f, 0xde, 0x01, 0xff, 0x9c, 0x68, 0x76, 0x64, 0x7f, 0x01, 0x75, 0xad, 0x34, 0xf0,
+                0x58, 0xdd, 0xe0, 0x1a,
+            ],
+            nk: [
+                0x72, 0x5d, 0x4a, 0xd6, 0xa1, 0x50, 0x21, 0xcd, 0x1c, 0x48, 0xc5, 0xee, 0x19, 0xde,
+                0x6c, 0x1e, 0x76, 0x8a, 0x2c, 0xc0, 0xa9, 0xa7, 0x30, 0xa0, 0x1b, 0xb2, 0x1c, 0x95,
+                0xe3, 0xd9, 0xe4, 0x3c,
+            ],
+            ivk: [
+                0x67, 0xfa, 0x2b, 0xf7, 0xc6, 0x7d, 0x46, 0x58, 0x24, 0x3c, 0x31, 0x7c, 0x0c, 0xb4,
+                0x1f, 0xd3, 0x20, 0x64, 0xdf, 0xd3, 0x70, 0x9f, 0xe0, 0xdc, 0xb7, 0x24, 0xf1, 0x4b,
+                0xb0, 0x1a, 0x1d, 0x04,
+            ],
+            default_d: [
+                0xfc, 0xfb, 0x68, 0xa4, 0x0d, 0x4b, 0xc6, 0xa0, 0x4b, 0x09, 0xc4,
+            ],
+            default_pk_d: [
+                0x8b, 0x2a, 0x33, 0x7f, 0x03, 0x62, 0x2c, 0x24, 0xff, 0x38, 0x1d, 0x4c, 0x54, 0x6f,
+                0x69, 0x77, 0xf9, 0x05, 0x22, 0xe9, 0x2f, 0xde, 0x44, 0xc9, 0xd1, 0xbb, 0x09, 0x97,
+                0x14, 0xb9, 0xdb, 0x2b,
+            ],
+            note_v: 12015423192295118080,
+            note_r: [
+                0xe5, 0x57, 0x85, 0x13, 0x55, 0x74, 0x7c, 0x09, 0xac, 0x59, 0x01, 0x3c, 0xbd, 0xe8,
+                0x59, 0x80, 0x96, 0x4e, 0xc1, 0x84, 0x4d, 0x9c, 0x69, 0x67, 0xca, 0x0c, 0x02, 0x9c,
+                0x84, 0x57, 0xbb, 0x04,
+            ],
+            note_cm: [
+                0xbd, 0xc8, 0x54, 0xbf, 0x3e, 0x7b, 0x00, 0x82, 0x1f, 0x3b, 0x8b, 0x85, 0x23, 0x8c,
+                0xcf, 0x1e, 0x67, 0x15, 0xbf, 0xe7, 0x0b, 0x63, 0x2d, 0x04, 0x4b, 0x26, 0xfb, 0x2b,
+                0xc7, 0x1b, 0x7f, 0x36,
+            ],
+            note_pos: 3054857184,
+            note_nf: [
+                0x8a, 0x9a, 0xbd, 0xa3, 0xd4, 0xef, 0x85, 0xca, 0xf2, 0x2b, 0xfa, 0xf2, 0xc4, 0x8f,
+                0x62, 0x38, 0x2a, 0x73, 0xa1, 0x62, 0x4e, 0xb8, 0xeb, 0x2b, 0xd0, 0x0d, 0x27, 0x03,
+                0x01, 0xbf, 0x3d, 0x13,
+            ],
+        },
+        TestVector {
+            sk: [
+                0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05,
+                0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05,
+                0x05, 0x05, 0x05, 0x05,
+            ],
+            ask: [
+                0xea, 0xe6, 0x88, 0x4d, 0x76, 0x4a, 0x05, 0x40, 0x61, 0xa8, 0xf1, 0xc0, 0x07, 0x6c,
+                0x62, 0x4d, 0xcb, 0x73, 0x87, 0x89, 0xf7, 0xad, 0x1e, 0x74, 0x08, 0xe3, 0x1f, 0x24,
+                0xdf, 0xc8, 0x26, 0x07,
+            ],
+            nsk: [
+                0xfb, 0xe6, 0x10, 0xf4, 0x2a, 0x41, 0x74, 0x9f, 0x9b, 0x6e, 0x6e, 0x4a, 0x54, 0xb5,
+                0xa3, 0x2e, 0xbf, 0xe8, 0xf4, 0x38, 0x00, 0x88, 0x1b, 0xa6, 0xcd, 0x13, 0xed, 0x0b,
+                0x05, 0x29, 0x46, 0x01,
+            ],
+            ovk: [
+                0xc6, 0xbc, 0x1f, 0x39, 0xf0, 0xd7, 0x86, 0x31, 0x4c, 0xb2, 0x0b, 0xf9, 0xab, 0x22,
+                0x85, 0x40, 0x91, 0x35, 0x55, 0xf9, 0x70, 0x69, 0x6b, 0x6d, 0x7c, 0x77, 0xbb, 0x33,
+                0x23, 0x28, 0x37, 0x2a,
+            ],
+            ak: [
+                0xe6, 0x82, 0x76, 0x59, 0x14, 0xe3, 0x86, 0x4c, 0x33, 0x9e, 0x57, 0x82, 0xb8, 0x55,
+                0xc0, 0xfd, 0xf4, 0x0e, 0x0d, 0xfc, 0xed, 0xb9, 0xe7, 0xb4, 0x7b, 0xc9, 0x4b, 0x90,
+                0xb3, 0xa4, 0xc9, 0x88,
+            ],
+            nk: [
+                0x82, 0x25, 0x6b, 0x95, 0x62, 0x3c, 0x67, 0x02, 0x4b, 0x44, 0x24, 0xd9, 0x14, 0x00,
+                0xa3, 0x70, 0xe7, 0xac, 0x8e, 0x4d, 0x15, 0x48, 0x2a, 0x37, 0x59, 0xe0, 0x0d, 0x21,
+                0x97, 0x49, 0xda, 0xee,
+            ],
+            ivk: [
+                0xea, 0x3f, 0x1d, 0x80, 0xe4, 0x30, 0x7c, 0xa7, 0x3b, 0x9f, 0x37, 0x80, 0x1f, 0x91,
+                0xfb, 0xa8, 0x10, 0xcc, 0x41, 0xd2, 0x79, 0xfc, 0x29, 0xf5, 0x64, 0x23, 0x56, 0x54,
+                0xa2, 0x17, 0x8e, 0x03,
+            ],
+            default_d: [
+                0xeb, 0x51, 0x98, 0x82, 0xad, 0x1e, 0x5c, 0xc6, 0x54, 0xcd, 0x59,
+            ],
+            default_pk_d: [
+                0x6b, 0x27, 0xda, 0xcc, 0xb5, 0xa8, 0x20, 0x7f, 0x53, 0x2d, 0x10, 0xca, 0x23, 0x8f,
+                0x97, 0x86, 0x64, 0x8a, 0x11, 0xb5, 0x96, 0x6e, 0x51, 0xa2, 0xf7, 0xd8, 0x9e, 0x15,
+                0xd2, 0x9b, 0x8f, 0xdf,
+            ],
+            note_v: 5795906953514121792,
+            note_r: [
+                0x68, 0xf0, 0x61, 0x04, 0x60, 0x6b, 0x0c, 0x54, 0x49, 0x84, 0x5f, 0xf4, 0xc6, 0x5f,
+                0x73, 0xe9, 0x0f, 0x45, 0xef, 0x5a, 0x43, 0xc9, 0xd7, 0x4c, 0xb2, 0xc8, 0x5c, 0xf5,
+                0x6c, 0x94, 0xc0, 0x02,
+            ],
+            note_cm: [
+                0xe8, 0x26, 0x7d, 0x30, 0xac, 0x11, 0xc1, 0x00, 0xbc, 0x7a, 0x0f, 0xdf, 0x91, 0xf7,
+                0x1d, 0x74, 0xc5, 0xbc, 0xf2, 0xe1, 0xef, 0x95, 0x66, 0x90, 0x44, 0x73, 0x01, 0x69,
+                0xde, 0x1a, 0x5b, 0x4c,
+            ],
+            note_pos: 3818571480,
+            note_nf: [
+                0x33, 0x2a, 0xd9, 0x9e, 0xb9, 0xe9, 0x77, 0xeb, 0x62, 0x7a, 0x12, 0x2d, 0xbf, 0xb2,
+                0xf2, 0x5f, 0xe5, 0x88, 0xe5, 0x97, 0x75, 0x3e, 0xc5, 0x58, 0x0f, 0xf2, 0xbe, 0x20,
+                0xb6, 0xc9, 0xa7, 0xe1,
+            ],
+        },
+        TestVector {
+            sk: [
+                0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06,
+                0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06,
+                0x06, 0x06, 0x06, 0x06,
+            ],
+            ask: [
+                0xe8, 0xf8, 0x16, 0xb4, 0xbc, 0x08, 0xa7, 0xe5, 0x66, 0x75, 0x0c, 0xc2, 0x8a, 0xfe,
+                0x82, 0xa4, 0xce, 0xa9, 0xc2, 0xbe, 0xf2, 0x44, 0xfa, 0x4b, 0x13, 0xc4, 0x73, 0x9b,
+                0x28, 0x07, 0x4c, 0x0d,
+            ],
+            nsk: [
+                0x32, 0x61, 0x5b, 0x13, 0x7f, 0x28, 0x01, 0xed, 0x44, 0x6e, 0x48, 0x78, 0x1a, 0xb0,
+                0x63, 0x45, 0x72, 0xe1, 0x8c, 0xfb, 0x06, 0x93, 0x72, 0x1b, 0x88, 0x03, 0xc0, 0x5b,
+                0x82, 0x27, 0xd1, 0x07,
+            ],
+            ovk: [
+                0xf6, 0x2c, 0x05, 0xe8, 0x48, 0xa8, 0x73, 0xef, 0x88, 0x5e, 0x12, 0xb0, 0x8c, 0x5e,
+                0x7c, 0xa2, 0xf3, 0x24, 0x24, 0xba, 0xcc, 0x75, 0x4c, 0xb6, 0x97, 0x50, 0x44, 0x4d,
+                0x35, 0x5f, 0x51, 0x06,
+            ],
+            ak: [
+                0xff, 0x27, 0xdb, 0x07, 0x51, 0x94, 0x5d, 0x3e, 0xe4, 0xbe, 0x9c, 0xf1, 0x5c, 0x2e,
+                0xa2, 0x11, 0xb2, 0x4b, 0x16, 0x4d, 0x5f, 0x2d, 0x7d, 0xdf, 0xf5, 0xe4, 0xa0, 0x70,
+                0x8f, 0x10, 0xb9, 0x5e,
+            ],
+            nk: [
+                0x94, 0x38, 0x85, 0x95, 0x9d, 0x4e, 0xf8, 0xa9, 0xcf, 0xca, 0x07, 0xc4, 0x57, 0xf0,
+                0x9e, 0xc7, 0x4b, 0x96, 0xf9, 0x93, 0xd8, 0xe0, 0xfa, 0x32, 0xb1, 0x9c, 0x03, 0xe3,
+                0xb0, 0x7a, 0x42, 0x0f,
+            ],
+            ivk: [
+                0xb5, 0xc5, 0x89, 0x49, 0x43, 0x95, 0x69, 0x33, 0xc0, 0xe5, 0xc1, 0x2d, 0x31, 0x1f,
+                0xc1, 0x2c, 0xba, 0x58, 0x35, 0x4b, 0x5c, 0x38, 0x9e, 0xdc, 0x03, 0xda, 0x55, 0x08,
+                0x4f, 0x74, 0xc2, 0x05,
+            ],
+            default_d: [
+                0xbe, 0xbb, 0x0f, 0xb4, 0x6b, 0x8a, 0xaf, 0xf8, 0x90, 0x40, 0xf6,
+            ],
+            default_pk_d: [
+                0xd1, 0x1d, 0xa0, 0x1f, 0x0b, 0x43, 0xbd, 0xd5, 0x28, 0x8d, 0x32, 0x38, 0x5b, 0x87,
+                0x71, 0xd2, 0x23, 0x49, 0x3c, 0x69, 0x80, 0x25, 0x44, 0x04, 0x3f, 0x77, 0xcf, 0x1d,
+                0x71, 0xc1, 0xcb, 0x8c,
+            ],
+            note_v: 18023134788442677120,
+            note_r: [
+                0x49, 0xf9, 0x0b, 0x47, 0xfd, 0x52, 0xfe, 0xe7, 0xc1, 0xc8, 0x1f, 0x0d, 0xcb, 0x5b,
+                0x74, 0xc3, 0xfb, 0x9b, 0x3e, 0x03, 0x97, 0x6f, 0x8b, 0x75, 0x24, 0xea, 0xba, 0xd0,
+                0x08, 0x89, 0x21, 0x07,
+            ],
+            note_cm: [
+                0x57, 0x2b, 0xa2, 0x05, 0x25, 0xb0, 0xac, 0x4d, 0x6d, 0xc0, 0x1a, 0xc2, 0xea, 0x10,
+                0x90, 0xb6, 0xe0, 0xf2, 0xf4, 0xbf, 0x4e, 0xc4, 0xa0, 0xdb, 0x5b, 0xbc, 0xcb, 0x5b,
+                0x78, 0x3a, 0x1e, 0x55,
+            ],
+            note_pos: 287318480,
+            note_nf: [
+                0xfc, 0x74, 0xcd, 0x0e, 0x4b, 0xe0, 0x49, 0x57, 0xb1, 0x96, 0xcf, 0x87, 0x34, 0xae,
+                0x99, 0x23, 0x96, 0xaf, 0x4c, 0xfa, 0x8f, 0xec, 0xbb, 0x86, 0xf9, 0x61, 0xe6, 0xb4,
+                0x07, 0xd5, 0x1e, 0x11,
+            ],
+        },
+        TestVector {
+            sk: [
+                0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07,
+                0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07,
+                0x07, 0x07, 0x07, 0x07,
+            ],
+            ask: [
+                0x74, 0xb4, 0x4a, 0x37, 0xf1, 0x50, 0x23, 0xc0, 0x60, 0x42, 0x7e, 0x1d, 0xae, 0xa3,
+                0xf6, 0x43, 0x12, 0xdd, 0x8f, 0xeb, 0x7b, 0x2c, 0xed, 0xf0, 0xdd, 0x55, 0x44, 0x49,
+                0x3f, 0x87, 0x2c, 0x06,
+            ],
+            nsk: [
+                0x07, 0x5c, 0x35, 0xdb, 0x8b, 0x1b, 0x25, 0x75, 0x42, 0x23, 0xec, 0xee, 0x34, 0xab,
+                0x73, 0x0d, 0xdd, 0xd1, 0xf1, 0x4a, 0x6a, 0x54, 0xf4, 0xc6, 0xf4, 0x68, 0x45, 0x3c,
+                0x3c, 0x6e, 0xd6, 0x0b,
+            ],
+            ovk: [
+                0xe9, 0xe0, 0xdc, 0x1e, 0xd3, 0x11, 0xda, 0xed, 0x64, 0xbd, 0x74, 0xda, 0x5d, 0x94,
+                0xfe, 0x88, 0xa6, 0xea, 0x41, 0x4b, 0x73, 0x12, 0xde, 0x3d, 0x2a, 0x78, 0xf6, 0x46,
+                0x32, 0xbb, 0xe3, 0x73,
+            ],
+            ak: [
+                0x28, 0x3f, 0x9a, 0xaf, 0xa9, 0xbc, 0xb3, 0xe6, 0xce, 0x17, 0xe6, 0x32, 0x12, 0x63,
+                0x4c, 0xb3, 0xee, 0x55, 0x0c, 0x47, 0x6b, 0x67, 0x6b, 0xd3, 0x56, 0xa6, 0xdf, 0x8a,
+                0xdf, 0x51, 0xd2, 0x5e,
+            ],
+            nk: [
+                0xdc, 0x4c, 0x67, 0xb1, 0x0d, 0x4b, 0x0a, 0x21, 0x8d, 0xc6, 0xe1, 0x48, 0x70, 0x66,
+                0x74, 0x0a, 0x40, 0x93, 0x17, 0x86, 0x6c, 0x32, 0xe6, 0x64, 0xb5, 0x0e, 0x39, 0x7a,
+                0xa8, 0x03, 0x89, 0xd4,
+            ],
+            ivk: [
+                0x87, 0x16, 0xc8, 0x28, 0x80, 0xe1, 0x36, 0x83, 0xe1, 0xbb, 0x05, 0x9d, 0xd0, 0x6c,
+                0x80, 0xc9, 0x01, 0x34, 0xa9, 0x6d, 0x5a, 0xfc, 0xa8, 0xaa, 0xc2, 0xbb, 0xf6, 0x8b,
+                0xb0, 0x5f, 0x84, 0x02,
+            ],
+            default_d: [
+                0xad, 0x6e, 0x2e, 0x18, 0x5a, 0x31, 0x00, 0xe3, 0xa6, 0xa8, 0xb3,
+            ],
+            default_pk_d: [
+                0x32, 0xcb, 0x28, 0x06, 0xb8, 0x82, 0xf1, 0x36, 0x8b, 0x0d, 0x4a, 0x89, 0x8f, 0x72,
+                0xc4, 0xc8, 0xf7, 0x28, 0x13, 0x2c, 0xc1, 0x24, 0x56, 0x94, 0x6e, 0x7f, 0x4c, 0xb0,
+                0xfb, 0x05, 0x8d, 0xa9,
+            ],
+            note_v: 11803618549661680832,
+            note_r: [
+                0x51, 0x65, 0xaf, 0xf2, 0x2d, 0xd4, 0xed, 0x56, 0xb4, 0xd8, 0x1d, 0x1f, 0x17, 0x1c,
+                0xc3, 0xd6, 0x43, 0x2f, 0xed, 0x1b, 0xeb, 0xf2, 0x0a, 0x7b, 0xea, 0xb1, 0x2d, 0xb1,
+                0x42, 0xf9, 0x4a, 0x0c,
+            ],
+            note_cm: [
+                0xab, 0x7f, 0xc5, 0x66, 0x87, 0x3c, 0xcd, 0xe6, 0x71, 0xf5, 0x98, 0x27, 0x67, 0x85,
+                0x60, 0xa0, 0x06, 0xf8, 0x2b, 0xb7, 0xad, 0xcd, 0x75, 0x22, 0x3f, 0xa8, 0x59, 0x36,
+                0xf7, 0x8c, 0x2b, 0x23,
+            ],
+            note_pos: 1051032776,
+            note_nf: [
+                0xd2, 0xe8, 0x87, 0xbd, 0x85, 0x4a, 0x80, 0x2b, 0xce, 0x85, 0x70, 0x53, 0x02, 0x0f,
+                0x5d, 0x3e, 0x7c, 0x8a, 0xe5, 0x26, 0x7c, 0x5b, 0x65, 0x83, 0xb3, 0xd2, 0x12, 0xcc,
+                0x8b, 0xb6, 0x98, 0x90,
+            ],
+        },
+        TestVector {
+            sk: [
+                0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08,
+                0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08,
+                0x08, 0x08, 0x08, 0x08,
+            ],
+            ask: [
+                0x03, 0x9d, 0xd9, 0x3d, 0xf3, 0x11, 0xff, 0x8f, 0xba, 0xb3, 0xfe, 0x23, 0x02, 0x19,
+                0xcd, 0x42, 0xac, 0x87, 0x94, 0x84, 0xf3, 0x0b, 0x90, 0x3a, 0x3c, 0x1e, 0x67, 0xcc,
+                0xca, 0x5a, 0x7b, 0x0d,
+            ],
+            nsk: [
+                0x04, 0x9f, 0xa1, 0x4f, 0x48, 0x6c, 0x75, 0xb9, 0xfa, 0xd7, 0xe3, 0xb6, 0x73, 0xa4,
+                0x43, 0xdd, 0x07, 0x4e, 0xaa, 0x96, 0xed, 0xcb, 0x2a, 0x53, 0xea, 0xaa, 0xbd, 0xaf,
+                0x70, 0xff, 0xbb, 0x08,
+            ],
+            ovk: [
+                0x14, 0x7d, 0xd1, 0x1d, 0x77, 0xeb, 0xa1, 0xb1, 0x63, 0x6f, 0xd6, 0x19, 0x0c, 0x62,
+                0xb9, 0xa5, 0xd0, 0x48, 0x1b, 0xee, 0x7e, 0x91, 0x7f, 0xab, 0x02, 0xe2, 0x18, 0x58,
+                0x06, 0x3a, 0xb5, 0x04,
+            ],
+            ak: [
+                0x36, 0x40, 0x48, 0xee, 0xdb, 0xe8, 0xca, 0x20, 0x5e, 0xb7, 0xe7, 0xba, 0x0a, 0x90,
+                0x12, 0x16, 0x6c, 0x7c, 0x7b, 0xd9, 0xeb, 0x22, 0x8e, 0x08, 0x48, 0x14, 0x48, 0xc4,
+                0x88, 0xaa, 0x21, 0xd2,
+            ],
+            nk: [
+                0xed, 0x60, 0xaf, 0x1c, 0xe7, 0xdf, 0x38, 0x07, 0x0d, 0x38, 0x51, 0x43, 0x2a, 0x96,
+                0x48, 0x0d, 0xb0, 0xb4, 0x17, 0xc3, 0x68, 0x2a, 0x1d, 0x68, 0xe3, 0xe8, 0x93, 0x34,
+                0x23, 0x5c, 0x0b, 0xdf,
+            ],
+            ivk: [
+                0x99, 0xc9, 0xb4, 0xb8, 0x4f, 0x4b, 0x4e, 0x35, 0x0f, 0x78, 0x7d, 0x1c, 0xf7, 0x05,
+                0x1d, 0x50, 0xec, 0xc3, 0x4b, 0x1a, 0x5b, 0x20, 0xd2, 0xd2, 0x13, 0x9b, 0x4a, 0xf1,
+                0xf1, 0x60, 0xe0, 0x01,
+            ],
+            default_d: [
+                0x21, 0xc9, 0x0e, 0x1c, 0x65, 0x8b, 0x3e, 0xfe, 0x86, 0xaf, 0x58,
+            ],
+            default_pk_d: [
+                0x9e, 0x64, 0x17, 0x4b, 0x4a, 0xb9, 0x81, 0x40, 0x5c, 0x32, 0x3b, 0x5e, 0x12, 0x47,
+                0x59, 0x45, 0xa4, 0x6d, 0x4f, 0xed, 0xf8, 0x06, 0x08, 0x28, 0x04, 0x1c, 0xd2, 0x0e,
+                0x62, 0xfd, 0x2c, 0xef,
+            ],
+            note_v: 5584102310880684544,
+            note_r: [
+                0x8c, 0x3e, 0x56, 0x44, 0x9d, 0xc8, 0x63, 0x54, 0xd3, 0x3b, 0x02, 0x5e, 0xf2, 0x79,
+                0x34, 0x60, 0xbc, 0xb1, 0x69, 0xf3, 0x32, 0x4e, 0x4a, 0x6b, 0x64, 0xba, 0xa6, 0x08,
+                0x32, 0x31, 0x57, 0x04,
+            ],
+            note_cm: [
+                0x7b, 0x48, 0xa8, 0x37, 0x5d, 0x3e, 0xbd, 0x56, 0xbc, 0x64, 0x9b, 0xb5, 0xb5, 0x24,
+                0x23, 0x36, 0xc2, 0xa0, 0x5a, 0x08, 0x03, 0x23, 0x9b, 0x5b, 0x88, 0xfd, 0x92, 0x07,
+                0x8f, 0xea, 0x4d, 0x04,
+            ],
+            note_pos: 1814747072,
+            note_nf: [
+                0xa8, 0x2f, 0x17, 0x50, 0xcc, 0x5b, 0x2b, 0xee, 0x64, 0x9a, 0x36, 0x5c, 0x04, 0x20,
+                0xed, 0x87, 0x07, 0x5b, 0x88, 0x71, 0xfd, 0xa4, 0xa7, 0xf5, 0x84, 0x0d, 0x6b, 0xbe,
+                0xb1, 0x7c, 0xd6, 0x20,
+            ],
+        },
+        TestVector {
+            sk: [
+                0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09,
+                0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09,
+                0x09, 0x09, 0x09, 0x09,
+            ],
+            ask: [
+                0xeb, 0xbb, 0x40, 0xa9, 0x80, 0xba, 0x3b, 0x88, 0x60, 0x94, 0x8d, 0x01, 0x1e, 0x1b,
+                0xfb, 0x4a, 0xff, 0xe1, 0x6c, 0x65, 0x2e, 0x90, 0xe9, 0x82, 0x58, 0x30, 0x2f, 0x44,
+                0x64, 0xc9, 0x1e, 0x0c,
+            ],
+            nsk: [
+                0x68, 0x43, 0x1b, 0x19, 0x91, 0x04, 0x21, 0x52, 0x00, 0xb9, 0x5e, 0xe5, 0xcb, 0x71,
+                0xbf, 0x8b, 0x88, 0x3a, 0x3e, 0x95, 0xb7, 0x98, 0x9c, 0xad, 0x19, 0x70, 0x63, 0x14,
+                0x1e, 0xbb, 0xfd, 0x00,
+            ],
+            ovk: [
+                0x57, 0x34, 0x67, 0xa7, 0xb3, 0x0e, 0xad, 0x6c, 0xcc, 0x50, 0x47, 0x44, 0xca, 0x9e,
+                0x1a, 0x28, 0x1a, 0x0d, 0x1a, 0x08, 0x73, 0x8b, 0x06, 0xa0, 0x68, 0x4f, 0xea, 0xcd,
+                0x1e, 0x9d, 0x12, 0x6d,
+            ],
+            ak: [
+                0x71, 0xc3, 0x52, 0x3e, 0xec, 0xa3, 0x53, 0x11, 0xfb, 0xd5, 0xd7, 0xe7, 0xd7, 0x0b,
+                0x70, 0x9d, 0x6c, 0x35, 0xa2, 0x4f, 0x26, 0x2b, 0x34, 0xbf, 0x64, 0x05, 0x9b, 0xf2,
+                0xc0, 0x2e, 0x0b, 0xa8,
+            ],
+            nk: [
+                0x62, 0x44, 0x00, 0x10, 0x3b, 0x65, 0x69, 0xb7, 0x35, 0x8f, 0xe8, 0x0f, 0x6f, 0x6c,
+                0xad, 0x43, 0x25, 0xde, 0xfd, 0xa9, 0xd9, 0x49, 0x9c, 0x2b, 0x8f, 0x88, 0x6a, 0x62,
+                0x69, 0xa2, 0xaa, 0x52,
+            ],
+            ivk: [
+                0xdb, 0x95, 0xea, 0x8b, 0xd9, 0xf9, 0x3d, 0x41, 0xb5, 0xab, 0x2b, 0xeb, 0xc9, 0x1a,
+                0x38, 0xed, 0xd5, 0x27, 0x08, 0x3e, 0x2a, 0x6e, 0xf9, 0xf3, 0xc2, 0x97, 0x02, 0xd5,
+                0xff, 0x89, 0xed, 0x00,
+            ],
+            default_d: [
+                0x23, 0x3c, 0x4a, 0xb8, 0x86, 0xa5, 0x5e, 0x3b, 0xa3, 0x74, 0xc0,
+            ],
+            default_pk_d: [
+                0xb6, 0x8e, 0x9e, 0xe0, 0xc0, 0x67, 0x8d, 0x7b, 0x30, 0x36, 0x93, 0x1c, 0x83, 0x1a,
+                0x25, 0x25, 0x5f, 0x7e, 0xe4, 0x87, 0x38, 0x5a, 0x30, 0x31, 0x6e, 0x15, 0xf6, 0x48,
+                0x2b, 0x87, 0x4f, 0xda,
+            ],
+            note_v: 17811330145809239872,
+            note_r: [
+                0x6e, 0xbb, 0xed, 0x74, 0x36, 0x19, 0xa2, 0x56, 0xf9, 0xad, 0x2e, 0x85, 0x88, 0x0c,
+                0xfa, 0xa9, 0x09, 0x8a, 0x5f, 0xdb, 0x16, 0x29, 0x99, 0x0d, 0x9a, 0x7d, 0x3b, 0xb9,
+                0x3f, 0xc9, 0x00, 0x03,
+            ],
+            note_cm: [
+                0xd3, 0x76, 0xa7, 0xbe, 0xe8, 0xce, 0x67, 0xf4, 0xef, 0xde, 0x56, 0xaa, 0x77, 0xcf,
+                0x64, 0x41, 0x9b, 0x0e, 0x55, 0x0a, 0xbb, 0xcb, 0x8e, 0x2b, 0xcb, 0xda, 0x8b, 0x63,
+                0xe4, 0x1d, 0xeb, 0x37,
+            ],
+            note_pos: 2578461368,
+            note_nf: [
+                0x65, 0x36, 0x74, 0x87, 0x3b, 0x3c, 0x67, 0x0c, 0x58, 0x85, 0x84, 0x73, 0xe7, 0xfe,
+                0x72, 0x19, 0x72, 0xfb, 0x96, 0xe2, 0x15, 0xb8, 0x73, 0x77, 0xa1, 0x7c, 0xa3, 0x71,
+                0x0d, 0x93, 0xc9, 0xe9,
+            ],
+        },
+    ];
+
+    for tv in test_vectors {
+        let ask = jubjub::Scalar::from_bytes(&tv.ask).unwrap();
+        let nsk = jubjub::Scalar::from_bytes(&tv.nsk).unwrap();
+
+        let ak = SPENDING_KEY_GENERATOR * ask;
+        assert_eq!(&ak.to_bytes(), &tv.ak);
+        {
+            let mut ak = [0u8; 32];
+            librustzcash_ask_to_ak(&tv.ask, &mut ak);
+            assert_eq!(&ak, &tv.ak);
+        }
+
+        let pgk = ProofGenerationKey { ak, nsk };
+        let fvk = pgk.to_viewing_key();
+        assert_eq!(&fvk.nk.to_bytes(), &tv.nk);
+        {
+            let mut nk = [0u8; 32];
+            librustzcash_nsk_to_nk(&tv.nsk, &mut nk);
+            assert_eq!(&nk, &tv.nk);
+        }
+
+        assert_eq!(&fvk.ivk().to_repr(), &tv.ivk);
+        {
+            let mut ivk = [0u8; 32];
+            librustzcash_crh_ivk(&tv.ak, &tv.nk, &mut ivk);
+            assert_eq!(&ivk, &tv.ivk);
+        }
+
+        let diversifier = Diversifier(tv.default_d);
+        assert!(librustzcash_check_diversifier(&tv.default_d));
+
+        let addr = fvk.to_payment_address(diversifier).unwrap();
+        assert_eq!(&addr.pk_d().to_bytes(), &tv.default_pk_d);
+        {
+            let mut default_pk_d = [0u8; 32];
+            librustzcash_ivk_to_pkd(&tv.ivk, &tv.default_d, &mut default_pk_d);
+            assert_eq!(&default_pk_d, &tv.default_pk_d);
+        }
+
+        let note_r = jubjub::Scalar::from_bytes(&tv.note_r).unwrap();
+        let note = addr
+            .create_note(tv.note_v, Rseed::BeforeZip212(note_r))
+            .unwrap();
+        assert_eq!(&note.cmu().to_bytes(), &tv.note_cm);
+
+        assert_eq!(note.nf(&fvk, tv.note_pos), Nullifier(tv.note_nf));
+    }
+}
diff --git a/depend/zcash/src/rust/src/tests/mmr.rs b/depend/zcash/src/rust/src/tests/mmr.rs
new file mode 100644
index 000000000..4afb3c004
--- /dev/null
+++ b/depend/zcash/src/rust/src/tests/mmr.rs
@@ -0,0 +1,225 @@
+use zcash_history::{Entry, EntryLink, NodeData, V1};
+
+use crate::history_ffi::{librustzcash_mmr_append, librustzcash_mmr_delete};
+
+const NODE_DATA_16L: &[u8] = include_bytes!("./res/tree16.dat");
+const NODE_DATA_1023L: &[u8] = include_bytes!("./res/tree1023.dat");
+
+struct TreeView {
+    peaks: Vec<(u32, Entry<V1>)>,
+    extra: Vec<(u32, Entry<V1>)>,
+}
+
+fn draft(into: &mut Vec<(u32, Entry<V1>)>, nodes: &[NodeData], peak_pos: usize, h: u32) {
+    let node_data = nodes[peak_pos - 1].clone();
+    let peak = match h {
+        0 => Entry::new_leaf(node_data),
+        _ => Entry::new(
+            node_data,
+            EntryLink::Stored((peak_pos - (1 << h) - 1) as u32),
+            EntryLink::Stored((peak_pos - 2) as u32),
+        ),
+    };
+
+    into.push(((peak_pos - 1) as u32, peak));
+}
+
+fn prepare_tree(nodes: &[NodeData]) -> TreeView {
+    assert!(!nodes.is_empty());
+
+    // integer log2 of (nodes.len()+1), -1
+    let mut h = (32 - ((nodes.len() + 1) as u32).leading_zeros() - 1) - 1;
+    let mut peak_pos = (1 << (h + 1)) - 1;
+    let mut peaks = Vec::new();
+
+    // used later
+    let mut last_peak_pos = 0;
+    let mut last_peak_h = 0;
+
+    loop {
+        if peak_pos > nodes.len() {
+            // left child, -2^h
+            peak_pos -= 1 << h;
+            h -= 1;
+        }
+
+        if peak_pos <= nodes.len() {
+            draft(&mut peaks, nodes, peak_pos, h);
+
+            // save to be used in next loop
+            last_peak_pos = peak_pos;
+            last_peak_h = h;
+
+            // right sibling
+            peak_pos += (1 << (h + 1)) - 1;
+        }
+
+        if h == 0 {
+            break;
+        }
+    }
+
+    // for deletion, everything on the right slope of the last peak should be pre-loaded
+    let mut extra = Vec::new();
+    let mut h = last_peak_h;
+    let mut peak_pos = last_peak_pos;
+
+    while h > 0 {
+        let left_pos = peak_pos - (1 << h);
+        let right_pos = peak_pos - 1;
+        h -= 1;
+
+        // drafting left child
+        draft(&mut extra, nodes, left_pos, h);
+
+        // drafting right child
+        draft(&mut extra, nodes, right_pos, h);
+
+        // continuing on right slope
+        peak_pos = right_pos;
+    }
+
+    TreeView { peaks, extra }
+}
+
+fn preload_tree_append(nodes: &[NodeData]) -> (Vec<u32>, Vec<[u8; zcash_history::MAX_ENTRY_SIZE]>) {
+    assert!(!nodes.is_empty());
+
+    let tree_view = prepare_tree(nodes);
+
+    let mut indices = Vec::new();
+    let mut bytes = Vec::new();
+
+    for (idx, entry) in tree_view.peaks.into_iter() {
+        let mut buf = [0u8; zcash_history::MAX_ENTRY_SIZE];
+        entry
+            .write(&mut &mut buf[..])
+            .expect("Cannot fail if enough buffer length");
+        indices.push(idx);
+        bytes.push(buf);
+    }
+
+    (indices, bytes)
+}
+
+// also returns number of peaks
+fn preload_tree_delete(
+    nodes: &[NodeData],
+) -> (Vec<u32>, Vec<[u8; zcash_history::MAX_ENTRY_SIZE]>, usize) {
+    assert!(!nodes.is_empty());
+
+    let tree_view = prepare_tree(nodes);
+
+    let mut indices = Vec::new();
+    let mut bytes = Vec::new();
+
+    let peak_count = tree_view.peaks.len();
+
+    for (idx, entry) in tree_view
+        .peaks
+        .into_iter()
+        .chain(tree_view.extra.into_iter())
+    {
+        let mut buf = [0u8; zcash_history::MAX_ENTRY_SIZE];
+        entry
+            .write(&mut &mut buf[..])
+            .expect("Cannot fail if enough buffer length");
+        indices.push(idx);
+        bytes.push(buf);
+    }
+
+    (indices, bytes, peak_count)
+}
+
+fn load_nodes(bytes: &'static [u8]) -> Vec<NodeData> {
+    let mut res = Vec::new();
+    let mut cursor = std::io::Cursor::new(bytes);
+    while (cursor.position() as usize) < bytes.len() {
+        let node_data = zcash_history::NodeData::read(0, &mut cursor)
+            .expect("Statically checked to be correct");
+        res.push(node_data);
+    }
+
+    res
+}
+
+#[test]
+fn append() {
+    let nodes = load_nodes(NODE_DATA_16L);
+    let (indices, peaks) = preload_tree_append(&nodes);
+
+    let mut rt_ret = [0u8; 32];
+
+    let mut buf_ret = Vec::<[u8; zcash_history::MAX_NODE_DATA_SIZE]>::with_capacity(32);
+
+    let mut new_node_data = [0u8; zcash_history::MAX_NODE_DATA_SIZE];
+    let new_node = NodeData {
+        consensus_branch_id: 0,
+        subtree_commitment: [0u8; 32],
+        start_time: 101,
+        end_time: 110,
+        start_target: 190,
+        end_target: 200,
+        start_sapling_root: [0u8; 32],
+        end_sapling_root: [0u8; 32],
+        subtree_total_work: Default::default(),
+        start_height: 10,
+        end_height: 10,
+        sapling_tx: 13,
+    };
+    new_node
+        .write(&mut &mut new_node_data[..])
+        .expect("Failed to write node data");
+
+    let result = librustzcash_mmr_append(
+        0,
+        nodes.len() as u32,
+        indices.as_ptr(),
+        peaks.as_ptr(),
+        peaks.len(),
+        &new_node_data,
+        &mut rt_ret,
+        buf_ret.as_mut_ptr(),
+    );
+
+    unsafe {
+        buf_ret.set_len(result as usize);
+    }
+
+    assert_eq!(result, 2);
+
+    let new_node_1 =
+        NodeData::from_bytes(0, &buf_ret[0][..]).expect("Failed to reconstruct return node #1");
+
+    let new_node_2 =
+        NodeData::from_bytes(0, &buf_ret[1][..]).expect("Failed to reconstruct return node #2");
+
+    assert_eq!(new_node_1.start_height, 10);
+    assert_eq!(new_node_1.end_height, 10);
+
+    // this is combined new node (which is `new_node_1`) + the one which was there before (for block #9)
+    assert_eq!(new_node_2.start_height, 9);
+    assert_eq!(new_node_2.end_height, 10);
+    assert_eq!(new_node_2.sapling_tx, 27);
+}
+
+#[test]
+fn delete() {
+    let nodes = load_nodes(NODE_DATA_1023L);
+    let (indices, nodes, peak_count) = preload_tree_delete(&nodes);
+
+    let mut rt_ret = [0u8; 32];
+
+    let result = librustzcash_mmr_delete(
+        0,
+        nodes.len() as u32,
+        indices.as_ptr(),
+        nodes.as_ptr(),
+        peak_count,
+        indices.len() - peak_count,
+        &mut rt_ret,
+    );
+
+    // Deleting from full tree of 9 height would result in cascade deleting of 10 nodes
+    assert_eq!(result, 10);
+}
diff --git a/depend/zcash/src/rust/src/tests/mod.rs b/depend/zcash/src/rust/src/tests/mod.rs
new file mode 100644
index 000000000..cea15547b
--- /dev/null
+++ b/depend/zcash/src/rust/src/tests/mod.rs
@@ -0,0 +1,81 @@
+use group::GroupEncoding;
+use zcash_primitives::constants::{
+    NOTE_COMMITMENT_RANDOMNESS_GENERATOR, NULLIFIER_POSITION_GENERATOR,
+    PROOF_GENERATION_KEY_GENERATOR, SPENDING_KEY_GENERATOR, VALUE_COMMITMENT_RANDOMNESS_GENERATOR,
+    VALUE_COMMITMENT_VALUE_GENERATOR,
+};
+
+mod key_agreement;
+mod key_components;
+mod mmr;
+mod notes;
+mod signatures;
+mod zip339;
+
+#[test]
+fn sapling_generators() {
+    struct SaplingGenerators {
+        skb: [u8; 32],
+        pkb: [u8; 32],
+        npb: [u8; 32],
+        wprb: [u8; 32],
+        vcvb: [u8; 32],
+        vcrb: [u8; 32],
+    }
+
+    // From https://github.com/zcash-hackworks/zcash-test-vectors/blob/master/sapling_generators.py
+    let sapling_generators = SaplingGenerators {
+        skb: [
+            0x30, 0xb5, 0xf2, 0xaa, 0xad, 0x32, 0x56, 0x30, 0xbc, 0xdd, 0xdb, 0xce, 0x4d, 0x67,
+            0x65, 0x6d, 0x05, 0xfd, 0x1c, 0xc2, 0xd0, 0x37, 0xbb, 0x53, 0x75, 0xb6, 0xe9, 0x6d,
+            0x9e, 0x01, 0xa1, 0xd7,
+        ],
+        pkb: [
+            0xe7, 0xe8, 0x5d, 0xe0, 0xf7, 0xf9, 0x7a, 0x46, 0xd2, 0x49, 0xa1, 0xf5, 0xea, 0x51,
+            0xdf, 0x50, 0xcc, 0x48, 0x49, 0x0f, 0x84, 0x01, 0xc9, 0xde, 0x7a, 0x2a, 0xdf, 0x18,
+            0x07, 0xd1, 0xb6, 0xd4,
+        ],
+        npb: [
+            0x65, 0x00, 0x2b, 0xc7, 0x36, 0xfa, 0xf7, 0xa3, 0x42, 0x2e, 0xff, 0xff, 0xe8, 0xb8,
+            0x55, 0xe1, 0x8f, 0xba, 0x96, 0xa0, 0x15, 0x8a, 0x9e, 0xfc, 0xa5, 0x84, 0xbf, 0x40,
+            0x54, 0x9d, 0x36, 0xe1,
+        ],
+        wprb: [
+            0xac, 0x77, 0x6c, 0x79, 0x65, 0x63, 0xfc, 0xd4, 0x4c, 0xc4, 0x9c, 0xfa, 0xea, 0x8b,
+            0xb7, 0x96, 0x95, 0x2c, 0x26, 0x6e, 0x47, 0x77, 0x9d, 0x94, 0x57, 0x4c, 0x10, 0xad,
+            0x01, 0x75, 0x4b, 0x11,
+        ],
+        vcvb: [
+            0xd7, 0xc8, 0x67, 0x06, 0xf5, 0x81, 0x7a, 0xa7, 0x18, 0xcd, 0x1c, 0xfa, 0xd0, 0x32,
+            0x33, 0xbc, 0xd6, 0x4a, 0x77, 0x89, 0xfd, 0x94, 0x22, 0xd3, 0xb1, 0x7a, 0xf6, 0x82,
+            0x3a, 0x7e, 0x6a, 0xc6,
+        ],
+        vcrb: [
+            0x8b, 0x6a, 0x0b, 0x38, 0xb9, 0xfa, 0xae, 0x3c, 0x3b, 0x80, 0x3b, 0x47, 0xb0, 0xf1,
+            0x46, 0xad, 0x50, 0xab, 0x22, 0x1e, 0x6e, 0x2a, 0xfb, 0xe6, 0xdb, 0xde, 0x45, 0xcb,
+            0xa9, 0xd3, 0x81, 0xed,
+        ],
+    };
+
+    assert_eq!(&SPENDING_KEY_GENERATOR.to_bytes(), &sapling_generators.skb);
+    assert_eq!(
+        &PROOF_GENERATION_KEY_GENERATOR.to_bytes(),
+        &sapling_generators.pkb
+    );
+    assert_eq!(
+        &NULLIFIER_POSITION_GENERATOR.to_bytes(),
+        &sapling_generators.npb
+    );
+    assert_eq!(
+        &NOTE_COMMITMENT_RANDOMNESS_GENERATOR.to_bytes(),
+        &sapling_generators.wprb
+    );
+    assert_eq!(
+        &VALUE_COMMITMENT_VALUE_GENERATOR.to_bytes(),
+        &sapling_generators.vcvb
+    );
+    assert_eq!(
+        &VALUE_COMMITMENT_RANDOMNESS_GENERATOR.to_bytes(),
+        &sapling_generators.vcrb
+    );
+}
diff --git a/depend/zcash/src/rust/src/tests/notes.rs b/depend/zcash/src/rust/src/tests/notes.rs
new file mode 100644
index 000000000..d62326074
--- /dev/null
+++ b/depend/zcash/src/rust/src/tests/notes.rs
@@ -0,0 +1,674 @@
+use crate::librustzcash_sapling_compute_cmu;
+use crate::librustzcash_sapling_compute_nf;
+
+#[test]
+fn notes() {
+    #![allow(dead_code)]
+    struct TestVector {
+        sk: [u8; 32],
+        ask: [u8; 32],
+        nsk: [u8; 32],
+        ovk: [u8; 32],
+        ak: [u8; 32],
+        nk: [u8; 32],
+        ivk: [u8; 32],
+        default_d: [u8; 11],
+        default_pk_d: [u8; 32],
+        note_v: u64,
+        note_r: [u8; 32],
+        note_cm: [u8; 32],
+        note_pos: u64,
+        note_nf: [u8; 32],
+    }
+
+    // From https://github.com/zcash-hackworks/zcash-test-vectors/blob/master/sapling_key_components.py
+    let test_vectors = vec![
+        TestVector {
+            sk: [
+                0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+                0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+                0x00, 0x00, 0x00, 0x00,
+            ],
+            ask: [
+                0x85, 0x48, 0xa1, 0x4a, 0x47, 0x3e, 0xa5, 0x47, 0xaa, 0x23, 0x78, 0x40, 0x20, 0x44,
+                0xf8, 0x18, 0xcf, 0x19, 0x11, 0xcf, 0x5d, 0xd2, 0x05, 0x4f, 0x67, 0x83, 0x45, 0xf0,
+                0x0d, 0x0e, 0x88, 0x06,
+            ],
+            nsk: [
+                0x30, 0x11, 0x4e, 0xa0, 0xdd, 0x0b, 0xb6, 0x1c, 0xf0, 0xea, 0xea, 0xb6, 0xec, 0x33,
+                0x31, 0xf5, 0x81, 0xb0, 0x42, 0x5e, 0x27, 0x33, 0x85, 0x01, 0x26, 0x2d, 0x7e, 0xac,
+                0x74, 0x5e, 0x6e, 0x05,
+            ],
+            ovk: [
+                0x98, 0xd1, 0x69, 0x13, 0xd9, 0x9b, 0x04, 0x17, 0x7c, 0xab, 0xa4, 0x4f, 0x6e, 0x4d,
+                0x22, 0x4e, 0x03, 0xb5, 0xac, 0x03, 0x1d, 0x7c, 0xe4, 0x5e, 0x86, 0x51, 0x38, 0xe1,
+                0xb9, 0x96, 0xd6, 0x3b,
+            ],
+            ak: [
+                0xf3, 0x44, 0xec, 0x38, 0x0f, 0xe1, 0x27, 0x3e, 0x30, 0x98, 0xc2, 0x58, 0x8c, 0x5d,
+                0x3a, 0x79, 0x1f, 0xd7, 0xba, 0x95, 0x80, 0x32, 0x76, 0x07, 0x77, 0xfd, 0x0e, 0xfa,
+                0x8e, 0xf1, 0x16, 0x20,
+            ],
+            nk: [
+                0xf7, 0xcf, 0x9e, 0x77, 0xf2, 0xe5, 0x86, 0x83, 0x38, 0x3c, 0x15, 0x19, 0xac, 0x7b,
+                0x06, 0x2d, 0x30, 0x04, 0x0e, 0x27, 0xa7, 0x25, 0xfb, 0x88, 0xfb, 0x19, 0xa9, 0x78,
+                0xbd, 0x3f, 0xd6, 0xba,
+            ],
+            ivk: [
+                0xb7, 0x0b, 0x7c, 0xd0, 0xed, 0x03, 0xcb, 0xdf, 0xd7, 0xad, 0xa9, 0x50, 0x2e, 0xe2,
+                0x45, 0xb1, 0x3e, 0x56, 0x9d, 0x54, 0xa5, 0x71, 0x9d, 0x2d, 0xaa, 0x0f, 0x5f, 0x14,
+                0x51, 0x47, 0x92, 0x04,
+            ],
+            default_d: [
+                0xf1, 0x9d, 0x9b, 0x79, 0x7e, 0x39, 0xf3, 0x37, 0x44, 0x58, 0x39,
+            ],
+            default_pk_d: [
+                0xdb, 0x4c, 0xd2, 0xb0, 0xaa, 0xc4, 0xf7, 0xeb, 0x8c, 0xa1, 0x31, 0xf1, 0x65, 0x67,
+                0xc4, 0x45, 0xa9, 0x55, 0x51, 0x26, 0xd3, 0xc2, 0x9f, 0x14, 0xe3, 0xd7, 0x76, 0xe8,
+                0x41, 0xae, 0x74, 0x15,
+            ],
+            note_v: 0,
+            note_r: [
+                0x39, 0x17, 0x6d, 0xac, 0x39, 0xac, 0xe4, 0x98, 0x0e, 0xcc, 0x8d, 0x77, 0x8e, 0x89,
+                0x86, 0x02, 0x55, 0xec, 0x36, 0x15, 0x06, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+                0x00, 0x00, 0x00, 0x00,
+            ],
+            note_cm: [
+                0xcb, 0x3c, 0xf9, 0x15, 0x32, 0x70, 0xd5, 0x7e, 0xb9, 0x14, 0xc6, 0xc2, 0xbc, 0xc0,
+                0x18, 0x50, 0xc9, 0xfe, 0xd4, 0x4f, 0xce, 0x08, 0x06, 0x27, 0x8f, 0x08, 0x3e, 0xf2,
+                0xdd, 0x07, 0x64, 0x39,
+            ],
+            note_pos: 0,
+            note_nf: [
+                0x44, 0xfa, 0xd6, 0x56, 0x4f, 0xfd, 0xec, 0x9f, 0xa1, 0x9c, 0x43, 0xa2, 0x8f, 0x86,
+                0x1d, 0x5e, 0xbf, 0x60, 0x23, 0x46, 0x00, 0x7d, 0xe7, 0x62, 0x67, 0xd9, 0x75, 0x27,
+                0x47, 0xab, 0x40, 0x63,
+            ],
+        },
+        TestVector {
+            sk: [
+                0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,
+                0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,
+                0x01, 0x01, 0x01, 0x01,
+            ],
+            ask: [
+                0xc9, 0x43, 0x56, 0x29, 0xbf, 0x8b, 0xff, 0xe5, 0x5e, 0x73, 0x35, 0xec, 0x07, 0x77,
+                0x18, 0xba, 0x60, 0xba, 0x28, 0xd7, 0xac, 0x37, 0x94, 0xb7, 0x4f, 0x51, 0x2c, 0x31,
+                0xaf, 0x0a, 0x53, 0x04,
+            ],
+            nsk: [
+                0x11, 0xac, 0xc2, 0xea, 0xd0, 0x7b, 0x5f, 0x00, 0x8c, 0x1f, 0x0f, 0x09, 0x0c, 0xc8,
+                0xdd, 0xf3, 0x35, 0x23, 0x6f, 0xf4, 0xb2, 0x53, 0xc6, 0x49, 0x56, 0x95, 0xe9, 0xd6,
+                0x39, 0xda, 0xcd, 0x08,
+            ],
+            ovk: [
+                0x3b, 0x94, 0x62, 0x10, 0xce, 0x6d, 0x1b, 0x16, 0x92, 0xd7, 0x39, 0x2a, 0xc8, 0x4a,
+                0x8b, 0xc8, 0xf0, 0x3b, 0x72, 0x72, 0x3c, 0x7d, 0x36, 0x72, 0x1b, 0x80, 0x9a, 0x79,
+                0xc9, 0xd6, 0xe4, 0x5b,
+            ],
+            ak: [
+                0x82, 0xff, 0x5e, 0xff, 0xc5, 0x27, 0xae, 0x84, 0x02, 0x0b, 0xf2, 0xd3, 0x52, 0x01,
+                0xc1, 0x02, 0x19, 0x13, 0x19, 0x47, 0xff, 0x4b, 0x96, 0xf8, 0x81, 0xa4, 0x5f, 0x2e,
+                0x8a, 0xe3, 0x05, 0x18,
+            ],
+            nk: [
+                0xc4, 0x53, 0x4d, 0x84, 0x8b, 0xb9, 0x18, 0xcf, 0x4a, 0x7f, 0x8b, 0x98, 0x74, 0x0a,
+                0xb3, 0xcc, 0xee, 0x58, 0x67, 0x95, 0xff, 0x4d, 0xf6, 0x45, 0x47, 0xa8, 0x88, 0x8a,
+                0x6c, 0x74, 0x15, 0xd2,
+            ],
+            ivk: [
+                0xc5, 0x18, 0x38, 0x44, 0x66, 0xb2, 0x69, 0x88, 0xb5, 0x10, 0x90, 0x67, 0x41, 0x8d,
+                0x19, 0x2d, 0x9d, 0x6b, 0xd0, 0xd9, 0x23, 0x22, 0x05, 0xd7, 0x74, 0x18, 0xc2, 0x40,
+                0xfc, 0x68, 0xa4, 0x06,
+            ],
+            default_d: [
+                0xae, 0xf1, 0x80, 0xf6, 0xe3, 0x4e, 0x35, 0x4b, 0x88, 0x8f, 0x81,
+            ],
+            default_pk_d: [
+                0xa6, 0xb1, 0x3e, 0xa3, 0x36, 0xdd, 0xb7, 0xa6, 0x7b, 0xb0, 0x9a, 0x0e, 0x68, 0xe9,
+                0xd3, 0xcf, 0xb3, 0x92, 0x10, 0x83, 0x1e, 0xa3, 0xa2, 0x96, 0xba, 0x09, 0xa9, 0x22,
+                0x06, 0x0f, 0xd3, 0x8b,
+            ],
+            note_v: 12227227834928555328,
+            note_r: [
+                0x47, 0x8b, 0xa0, 0xee, 0x6e, 0x1a, 0x75, 0xb6, 0x00, 0x03, 0x6f, 0x26, 0xf1, 0x8b,
+                0x70, 0x15, 0xab, 0x55, 0x6b, 0xed, 0xdf, 0x8b, 0x96, 0x02, 0x38, 0x86, 0x9f, 0x89,
+                0xdd, 0x80, 0x4e, 0x06,
+            ],
+            note_cm: [
+                0xb5, 0x78, 0x93, 0x50, 0x0b, 0xfb, 0x85, 0xdf, 0x2e, 0x8b, 0x01, 0xac, 0x45, 0x2f,
+                0x89, 0xe1, 0x0e, 0x26, 0x6b, 0xcf, 0xa3, 0x1c, 0x31, 0xb2, 0x9a, 0x53, 0xae, 0x72,
+                0xca, 0xd4, 0x69, 0x50,
+            ],
+            note_pos: 763714296,
+            note_nf: [
+                0x67, 0x9e, 0xb0, 0xc3, 0xa7, 0x57, 0xe2, 0xae, 0x83, 0xcd, 0xb4, 0x2a, 0x1a, 0xb2,
+                0x59, 0xd7, 0x83, 0x88, 0x31, 0x54, 0x19, 0xad, 0xc7, 0x1d, 0x2e, 0x37, 0x63, 0x17,
+                0x4c, 0x2e, 0x9d, 0x93,
+            ],
+        },
+        TestVector {
+            sk: [
+                0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02,
+                0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02,
+                0x02, 0x02, 0x02, 0x02,
+            ],
+            ask: [
+                0xee, 0x1c, 0x3d, 0x7e, 0xfe, 0x0a, 0x78, 0x06, 0x3d, 0x6a, 0xf3, 0xd9, 0xd8, 0x12,
+                0x12, 0xaf, 0x47, 0xb7, 0xc1, 0xb7, 0x61, 0xf8, 0x5c, 0xcb, 0x06, 0x6f, 0xc1, 0x1a,
+                0x6a, 0x42, 0x17, 0x03,
+            ],
+            nsk: [
+                0x1d, 0x3b, 0x71, 0x37, 0x55, 0xd7, 0x48, 0x75, 0xe8, 0xea, 0x38, 0xfd, 0x16, 0x6e,
+                0x76, 0xc6, 0x2a, 0x42, 0x50, 0x21, 0x6e, 0x6b, 0xbf, 0xe4, 0x8a, 0x5e, 0x2e, 0xab,
+                0xad, 0x11, 0x7f, 0x0b,
+            ],
+            ovk: [
+                0x8b, 0xf4, 0x39, 0x0e, 0x28, 0xdd, 0xc9, 0x5b, 0x83, 0x02, 0xc3, 0x81, 0xd5, 0x81,
+                0x0b, 0x84, 0xba, 0x8e, 0x60, 0x96, 0xe5, 0xa7, 0x68, 0x22, 0x77, 0x4f, 0xd4, 0x9f,
+                0x49, 0x1e, 0x8f, 0x49,
+            ],
+            ak: [
+                0xab, 0x83, 0x57, 0x4e, 0xb5, 0xde, 0x85, 0x9a, 0x0a, 0xb8, 0x62, 0x9d, 0xec, 0x34,
+                0xc7, 0xbe, 0xe8, 0xc3, 0xfc, 0x74, 0xdf, 0xa0, 0xb1, 0x9a, 0x3a, 0x74, 0x68, 0xd1,
+                0x5d, 0xca, 0x64, 0xc6,
+            ],
+            nk: [
+                0x95, 0xd5, 0x80, 0x53, 0xe0, 0x59, 0x2e, 0x4a, 0x16, 0x9c, 0xc0, 0xb7, 0x92, 0x8a,
+                0xaa, 0xc3, 0xde, 0x24, 0xef, 0x15, 0x31, 0xaa, 0x9e, 0xb6, 0xf4, 0xab, 0x93, 0x91,
+                0x4d, 0xa8, 0xa0, 0x6e,
+            ],
+            ivk: [
+                0x47, 0x1c, 0x24, 0xa3, 0xdc, 0x87, 0x30, 0xe7, 0x50, 0x36, 0xc0, 0xa9, 0x5f, 0x3e,
+                0x2f, 0x7d, 0xd1, 0xbe, 0x6f, 0xb9, 0x3a, 0xd2, 0x95, 0x92, 0x20, 0x3d, 0xef, 0x30,
+                0x41, 0x95, 0x45, 0x05,
+            ],
+            default_d: [
+                0x75, 0x99, 0xf0, 0xbf, 0x9b, 0x57, 0xcd, 0x2d, 0xc2, 0x99, 0xb6,
+            ],
+            default_pk_d: [
+                0x66, 0x14, 0x17, 0x39, 0x51, 0x4b, 0x28, 0xf0, 0x5d, 0xef, 0x8a, 0x18, 0xee, 0xee,
+                0x5e, 0xed, 0x4d, 0x44, 0xc6, 0x22, 0x5c, 0x3c, 0x65, 0xd8, 0x8d, 0xd9, 0x90, 0x77,
+                0x08, 0x01, 0x2f, 0x5a,
+            ],
+            note_v: 6007711596147559040,
+            note_r: [
+                0x14, 0x7c, 0xf2, 0xb5, 0x1b, 0x4c, 0x7c, 0x63, 0xcb, 0x77, 0xb9, 0x9e, 0x8b, 0x78,
+                0x3e, 0x5b, 0x51, 0x11, 0xdb, 0x0a, 0x7c, 0xa0, 0x4d, 0x6c, 0x01, 0x4a, 0x1d, 0x7d,
+                0xa8, 0x3b, 0xae, 0x0a,
+            ],
+            note_cm: [
+                0xdb, 0x85, 0xa7, 0x0a, 0x98, 0x43, 0x7f, 0x73, 0x16, 0x7f, 0xc3, 0x32, 0xd5, 0xb7,
+                0xb7, 0x40, 0x82, 0x96, 0x66, 0x17, 0x70, 0xb1, 0x01, 0xb0, 0xaa, 0x87, 0x83, 0x9f,
+                0x4e, 0x55, 0xf1, 0x51,
+            ],
+            note_pos: 1527428592,
+            note_nf: [
+                0xe9, 0x8f, 0x6a, 0x8f, 0x34, 0xff, 0x49, 0x80, 0x59, 0xb3, 0xc7, 0x31, 0xb9, 0x1f,
+                0x45, 0x11, 0x08, 0xc4, 0x95, 0x4d, 0x91, 0x94, 0x84, 0x36, 0x1c, 0xf9, 0xb4, 0x8f,
+                0x59, 0xae, 0x1d, 0x14,
+            ],
+        },
+        TestVector {
+            sk: [
+                0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03,
+                0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03,
+                0x03, 0x03, 0x03, 0x03,
+            ],
+            ask: [
+                0x00, 0xc3, 0xa1, 0xe1, 0xca, 0x8f, 0x4e, 0x04, 0x80, 0xee, 0x1e, 0xe9, 0x0c, 0xa7,
+                0x51, 0x78, 0x79, 0xd3, 0xfc, 0x5c, 0x81, 0x5c, 0x09, 0x03, 0xe5, 0xee, 0xbc, 0x94,
+                0xbb, 0x80, 0x95, 0x03,
+            ],
+            nsk: [
+                0xe6, 0x62, 0x85, 0xa5, 0xe9, 0xb6, 0x5e, 0x15, 0x7a, 0xd2, 0xfc, 0xd5, 0x43, 0xda,
+                0xd9, 0x8c, 0x67, 0xa5, 0x8a, 0xbd, 0xf2, 0x87, 0xe0, 0x55, 0x06, 0xbd, 0x1c, 0x2e,
+                0x59, 0xb0, 0x72, 0x0b,
+            ],
+            ovk: [
+                0x14, 0x76, 0x78, 0xe0, 0x55, 0x3b, 0x97, 0x82, 0x93, 0x47, 0x64, 0x7c, 0x5b, 0xc7,
+                0xda, 0xb4, 0xcc, 0x22, 0x02, 0xb5, 0x4e, 0xc2, 0x9f, 0xd3, 0x1a, 0x3d, 0xe6, 0xbe,
+                0x08, 0x25, 0xfc, 0x5e,
+            ],
+            ak: [
+                0x3c, 0x9c, 0xde, 0x7e, 0x5d, 0x0d, 0x38, 0xa8, 0x61, 0x0f, 0xaa, 0xdb, 0xcf, 0x4c,
+                0x34, 0x3f, 0x5d, 0x3c, 0xfa, 0x31, 0x55, 0xa5, 0xb9, 0x46, 0x61, 0xa6, 0x75, 0x3e,
+                0x96, 0xe8, 0x84, 0xea,
+            ],
+            nk: [
+                0xb7, 0x7d, 0x36, 0xf5, 0x08, 0x94, 0x1d, 0xbd, 0x61, 0xcf, 0xd0, 0xf1, 0x59, 0xee,
+                0x05, 0xcf, 0xaa, 0x78, 0xa2, 0x6c, 0x94, 0x92, 0x90, 0x38, 0x06, 0xd8, 0x3b, 0x59,
+                0x8d, 0x3c, 0x1c, 0x2a,
+            ],
+            ivk: [
+                0x63, 0x6a, 0xa9, 0x64, 0xbf, 0xc2, 0x3c, 0xe4, 0xb1, 0xfc, 0xf7, 0xdf, 0xc9, 0x91,
+                0x79, 0xdd, 0xc4, 0x06, 0xff, 0x55, 0x40, 0x0c, 0x92, 0x95, 0xac, 0xfc, 0x14, 0xf0,
+                0x31, 0xc7, 0x26, 0x00,
+            ],
+            default_d: [
+                0x1b, 0x81, 0x61, 0x4f, 0x1d, 0xad, 0xea, 0x0f, 0x8d, 0x0a, 0x58,
+            ],
+            default_pk_d: [
+                0x25, 0xeb, 0x55, 0xfc, 0xcf, 0x76, 0x1f, 0xc6, 0x4e, 0x85, 0xa5, 0x88, 0xef, 0xe6,
+                0xea, 0xd7, 0x83, 0x2f, 0xb1, 0xf0, 0xf7, 0xa8, 0x31, 0x65, 0x89, 0x5b, 0xdf, 0xf9,
+                0x42, 0x92, 0x5f, 0x5c,
+            ],
+            note_v: 18234939431076114368,
+            note_r: [
+                0x34, 0xa4, 0xb2, 0xa9, 0x14, 0x4f, 0xf5, 0xea, 0x54, 0xef, 0xee, 0x87, 0xcf, 0x90,
+                0x1b, 0x5b, 0xed, 0x5e, 0x35, 0xd2, 0x1f, 0xbb, 0xd7, 0x88, 0xd5, 0xbd, 0x9d, 0x83,
+                0x3e, 0x11, 0x28, 0x04,
+            ],
+            note_cm: [
+                0xe0, 0x8c, 0xe4, 0x82, 0xb3, 0xa8, 0xfb, 0x3b, 0x35, 0xcc, 0xdb, 0xe3, 0x43, 0x37,
+                0xbd, 0x10, 0x5d, 0x88, 0x39, 0x21, 0x2e, 0x0d, 0x16, 0x44, 0xb9, 0xd5, 0x5c, 0xaa,
+                0x60, 0xd1, 0x9b, 0x6c,
+            ],
+            note_pos: 2291142888,
+            note_nf: [
+                0x55, 0x47, 0xaa, 0x12, 0xff, 0x80, 0xa6, 0xb3, 0x30, 0x4e, 0x3b, 0x05, 0x86, 0x56,
+                0x47, 0x2a, 0xbd, 0x2c, 0x81, 0x83, 0xb5, 0x9d, 0x07, 0x37, 0xb9, 0x3c, 0xee, 0x75,
+                0x8b, 0xec, 0x47, 0xa1,
+            ],
+        },
+        TestVector {
+            sk: [
+                0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04,
+                0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04,
+                0x04, 0x04, 0x04, 0x04,
+            ],
+            ask: [
+                0x82, 0x36, 0xd1, 0x9d, 0x32, 0x05, 0xd8, 0x55, 0x43, 0xa0, 0x68, 0x11, 0x34, 0x3f,
+                0x82, 0x7b, 0x65, 0x63, 0x77, 0x0a, 0x49, 0xaa, 0x4d, 0x0c, 0xa0, 0x08, 0x18, 0x05,
+                0xd4, 0xc8, 0xea, 0x0d,
+            ],
+            nsk: [
+                0x7e, 0xc1, 0xef, 0x0b, 0xed, 0x82, 0x71, 0x82, 0x72, 0xf0, 0xf4, 0x4f, 0x01, 0x7c,
+                0x48, 0x41, 0x74, 0x51, 0x3d, 0x66, 0x1d, 0xd1, 0x68, 0xaf, 0x02, 0xd2, 0x09, 0x2a,
+                0x1d, 0x8a, 0x05, 0x07,
+            ],
+            ovk: [
+                0x1b, 0x6e, 0x75, 0xec, 0xe3, 0xac, 0xe8, 0xdb, 0xa6, 0xa5, 0x41, 0x0d, 0x9a, 0xd4,
+                0x75, 0x56, 0x68, 0xe4, 0xb3, 0x95, 0x85, 0xd6, 0x35, 0xec, 0x1d, 0xa7, 0xc8, 0xdc,
+                0xfd, 0x5f, 0xc4, 0xed,
+            ],
+            ak: [
+                0x55, 0xe8, 0x83, 0x89, 0xbb, 0x7e, 0x41, 0xde, 0x13, 0x0c, 0xfa, 0x51, 0xa8, 0x71,
+                0x5f, 0xde, 0x01, 0xff, 0x9c, 0x68, 0x76, 0x64, 0x7f, 0x01, 0x75, 0xad, 0x34, 0xf0,
+                0x58, 0xdd, 0xe0, 0x1a,
+            ],
+            nk: [
+                0x72, 0x5d, 0x4a, 0xd6, 0xa1, 0x50, 0x21, 0xcd, 0x1c, 0x48, 0xc5, 0xee, 0x19, 0xde,
+                0x6c, 0x1e, 0x76, 0x8a, 0x2c, 0xc0, 0xa9, 0xa7, 0x30, 0xa0, 0x1b, 0xb2, 0x1c, 0x95,
+                0xe3, 0xd9, 0xe4, 0x3c,
+            ],
+            ivk: [
+                0x67, 0xfa, 0x2b, 0xf7, 0xc6, 0x7d, 0x46, 0x58, 0x24, 0x3c, 0x31, 0x7c, 0x0c, 0xb4,
+                0x1f, 0xd3, 0x20, 0x64, 0xdf, 0xd3, 0x70, 0x9f, 0xe0, 0xdc, 0xb7, 0x24, 0xf1, 0x4b,
+                0xb0, 0x1a, 0x1d, 0x04,
+            ],
+            default_d: [
+                0xfc, 0xfb, 0x68, 0xa4, 0x0d, 0x4b, 0xc6, 0xa0, 0x4b, 0x09, 0xc4,
+            ],
+            default_pk_d: [
+                0x8b, 0x2a, 0x33, 0x7f, 0x03, 0x62, 0x2c, 0x24, 0xff, 0x38, 0x1d, 0x4c, 0x54, 0x6f,
+                0x69, 0x77, 0xf9, 0x05, 0x22, 0xe9, 0x2f, 0xde, 0x44, 0xc9, 0xd1, 0xbb, 0x09, 0x97,
+                0x14, 0xb9, 0xdb, 0x2b,
+            ],
+            note_v: 12015423192295118080,
+            note_r: [
+                0xe5, 0x57, 0x85, 0x13, 0x55, 0x74, 0x7c, 0x09, 0xac, 0x59, 0x01, 0x3c, 0xbd, 0xe8,
+                0x59, 0x80, 0x96, 0x4e, 0xc1, 0x84, 0x4d, 0x9c, 0x69, 0x67, 0xca, 0x0c, 0x02, 0x9c,
+                0x84, 0x57, 0xbb, 0x04,
+            ],
+            note_cm: [
+                0xbd, 0xc8, 0x54, 0xbf, 0x3e, 0x7b, 0x00, 0x82, 0x1f, 0x3b, 0x8b, 0x85, 0x23, 0x8c,
+                0xcf, 0x1e, 0x67, 0x15, 0xbf, 0xe7, 0x0b, 0x63, 0x2d, 0x04, 0x4b, 0x26, 0xfb, 0x2b,
+                0xc7, 0x1b, 0x7f, 0x36,
+            ],
+            note_pos: 3054857184,
+            note_nf: [
+                0x8a, 0x9a, 0xbd, 0xa3, 0xd4, 0xef, 0x85, 0xca, 0xf2, 0x2b, 0xfa, 0xf2, 0xc4, 0x8f,
+                0x62, 0x38, 0x2a, 0x73, 0xa1, 0x62, 0x4e, 0xb8, 0xeb, 0x2b, 0xd0, 0x0d, 0x27, 0x03,
+                0x01, 0xbf, 0x3d, 0x13,
+            ],
+        },
+        TestVector {
+            sk: [
+                0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05,
+                0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05,
+                0x05, 0x05, 0x05, 0x05,
+            ],
+            ask: [
+                0xea, 0xe6, 0x88, 0x4d, 0x76, 0x4a, 0x05, 0x40, 0x61, 0xa8, 0xf1, 0xc0, 0x07, 0x6c,
+                0x62, 0x4d, 0xcb, 0x73, 0x87, 0x89, 0xf7, 0xad, 0x1e, 0x74, 0x08, 0xe3, 0x1f, 0x24,
+                0xdf, 0xc8, 0x26, 0x07,
+            ],
+            nsk: [
+                0xfb, 0xe6, 0x10, 0xf4, 0x2a, 0x41, 0x74, 0x9f, 0x9b, 0x6e, 0x6e, 0x4a, 0x54, 0xb5,
+                0xa3, 0x2e, 0xbf, 0xe8, 0xf4, 0x38, 0x00, 0x88, 0x1b, 0xa6, 0xcd, 0x13, 0xed, 0x0b,
+                0x05, 0x29, 0x46, 0x01,
+            ],
+            ovk: [
+                0xc6, 0xbc, 0x1f, 0x39, 0xf0, 0xd7, 0x86, 0x31, 0x4c, 0xb2, 0x0b, 0xf9, 0xab, 0x22,
+                0x85, 0x40, 0x91, 0x35, 0x55, 0xf9, 0x70, 0x69, 0x6b, 0x6d, 0x7c, 0x77, 0xbb, 0x33,
+                0x23, 0x28, 0x37, 0x2a,
+            ],
+            ak: [
+                0xe6, 0x82, 0x76, 0x59, 0x14, 0xe3, 0x86, 0x4c, 0x33, 0x9e, 0x57, 0x82, 0xb8, 0x55,
+                0xc0, 0xfd, 0xf4, 0x0e, 0x0d, 0xfc, 0xed, 0xb9, 0xe7, 0xb4, 0x7b, 0xc9, 0x4b, 0x90,
+                0xb3, 0xa4, 0xc9, 0x88,
+            ],
+            nk: [
+                0x82, 0x25, 0x6b, 0x95, 0x62, 0x3c, 0x67, 0x02, 0x4b, 0x44, 0x24, 0xd9, 0x14, 0x00,
+                0xa3, 0x70, 0xe7, 0xac, 0x8e, 0x4d, 0x15, 0x48, 0x2a, 0x37, 0x59, 0xe0, 0x0d, 0x21,
+                0x97, 0x49, 0xda, 0xee,
+            ],
+            ivk: [
+                0xea, 0x3f, 0x1d, 0x80, 0xe4, 0x30, 0x7c, 0xa7, 0x3b, 0x9f, 0x37, 0x80, 0x1f, 0x91,
+                0xfb, 0xa8, 0x10, 0xcc, 0x41, 0xd2, 0x79, 0xfc, 0x29, 0xf5, 0x64, 0x23, 0x56, 0x54,
+                0xa2, 0x17, 0x8e, 0x03,
+            ],
+            default_d: [
+                0xeb, 0x51, 0x98, 0x82, 0xad, 0x1e, 0x5c, 0xc6, 0x54, 0xcd, 0x59,
+            ],
+            default_pk_d: [
+                0x6b, 0x27, 0xda, 0xcc, 0xb5, 0xa8, 0x20, 0x7f, 0x53, 0x2d, 0x10, 0xca, 0x23, 0x8f,
+                0x97, 0x86, 0x64, 0x8a, 0x11, 0xb5, 0x96, 0x6e, 0x51, 0xa2, 0xf7, 0xd8, 0x9e, 0x15,
+                0xd2, 0x9b, 0x8f, 0xdf,
+            ],
+            note_v: 5795906953514121792,
+            note_r: [
+                0x68, 0xf0, 0x61, 0x04, 0x60, 0x6b, 0x0c, 0x54, 0x49, 0x84, 0x5f, 0xf4, 0xc6, 0x5f,
+                0x73, 0xe9, 0x0f, 0x45, 0xef, 0x5a, 0x43, 0xc9, 0xd7, 0x4c, 0xb2, 0xc8, 0x5c, 0xf5,
+                0x6c, 0x94, 0xc0, 0x02,
+            ],
+            note_cm: [
+                0xe8, 0x26, 0x7d, 0x30, 0xac, 0x11, 0xc1, 0x00, 0xbc, 0x7a, 0x0f, 0xdf, 0x91, 0xf7,
+                0x1d, 0x74, 0xc5, 0xbc, 0xf2, 0xe1, 0xef, 0x95, 0x66, 0x90, 0x44, 0x73, 0x01, 0x69,
+                0xde, 0x1a, 0x5b, 0x4c,
+            ],
+            note_pos: 3818571480,
+            note_nf: [
+                0x33, 0x2a, 0xd9, 0x9e, 0xb9, 0xe9, 0x77, 0xeb, 0x62, 0x7a, 0x12, 0x2d, 0xbf, 0xb2,
+                0xf2, 0x5f, 0xe5, 0x88, 0xe5, 0x97, 0x75, 0x3e, 0xc5, 0x58, 0x0f, 0xf2, 0xbe, 0x20,
+                0xb6, 0xc9, 0xa7, 0xe1,
+            ],
+        },
+        TestVector {
+            sk: [
+                0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06,
+                0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06,
+                0x06, 0x06, 0x06, 0x06,
+            ],
+            ask: [
+                0xe8, 0xf8, 0x16, 0xb4, 0xbc, 0x08, 0xa7, 0xe5, 0x66, 0x75, 0x0c, 0xc2, 0x8a, 0xfe,
+                0x82, 0xa4, 0xce, 0xa9, 0xc2, 0xbe, 0xf2, 0x44, 0xfa, 0x4b, 0x13, 0xc4, 0x73, 0x9b,
+                0x28, 0x07, 0x4c, 0x0d,
+            ],
+            nsk: [
+                0x32, 0x61, 0x5b, 0x13, 0x7f, 0x28, 0x01, 0xed, 0x44, 0x6e, 0x48, 0x78, 0x1a, 0xb0,
+                0x63, 0x45, 0x72, 0xe1, 0x8c, 0xfb, 0x06, 0x93, 0x72, 0x1b, 0x88, 0x03, 0xc0, 0x5b,
+                0x82, 0x27, 0xd1, 0x07,
+            ],
+            ovk: [
+                0xf6, 0x2c, 0x05, 0xe8, 0x48, 0xa8, 0x73, 0xef, 0x88, 0x5e, 0x12, 0xb0, 0x8c, 0x5e,
+                0x7c, 0xa2, 0xf3, 0x24, 0x24, 0xba, 0xcc, 0x75, 0x4c, 0xb6, 0x97, 0x50, 0x44, 0x4d,
+                0x35, 0x5f, 0x51, 0x06,
+            ],
+            ak: [
+                0xff, 0x27, 0xdb, 0x07, 0x51, 0x94, 0x5d, 0x3e, 0xe4, 0xbe, 0x9c, 0xf1, 0x5c, 0x2e,
+                0xa2, 0x11, 0xb2, 0x4b, 0x16, 0x4d, 0x5f, 0x2d, 0x7d, 0xdf, 0xf5, 0xe4, 0xa0, 0x70,
+                0x8f, 0x10, 0xb9, 0x5e,
+            ],
+            nk: [
+                0x94, 0x38, 0x85, 0x95, 0x9d, 0x4e, 0xf8, 0xa9, 0xcf, 0xca, 0x07, 0xc4, 0x57, 0xf0,
+                0x9e, 0xc7, 0x4b, 0x96, 0xf9, 0x93, 0xd8, 0xe0, 0xfa, 0x32, 0xb1, 0x9c, 0x03, 0xe3,
+                0xb0, 0x7a, 0x42, 0x0f,
+            ],
+            ivk: [
+                0xb5, 0xc5, 0x89, 0x49, 0x43, 0x95, 0x69, 0x33, 0xc0, 0xe5, 0xc1, 0x2d, 0x31, 0x1f,
+                0xc1, 0x2c, 0xba, 0x58, 0x35, 0x4b, 0x5c, 0x38, 0x9e, 0xdc, 0x03, 0xda, 0x55, 0x08,
+                0x4f, 0x74, 0xc2, 0x05,
+            ],
+            default_d: [
+                0xbe, 0xbb, 0x0f, 0xb4, 0x6b, 0x8a, 0xaf, 0xf8, 0x90, 0x40, 0xf6,
+            ],
+            default_pk_d: [
+                0xd1, 0x1d, 0xa0, 0x1f, 0x0b, 0x43, 0xbd, 0xd5, 0x28, 0x8d, 0x32, 0x38, 0x5b, 0x87,
+                0x71, 0xd2, 0x23, 0x49, 0x3c, 0x69, 0x80, 0x25, 0x44, 0x04, 0x3f, 0x77, 0xcf, 0x1d,
+                0x71, 0xc1, 0xcb, 0x8c,
+            ],
+            note_v: 18023134788442677120,
+            note_r: [
+                0x49, 0xf9, 0x0b, 0x47, 0xfd, 0x52, 0xfe, 0xe7, 0xc1, 0xc8, 0x1f, 0x0d, 0xcb, 0x5b,
+                0x74, 0xc3, 0xfb, 0x9b, 0x3e, 0x03, 0x97, 0x6f, 0x8b, 0x75, 0x24, 0xea, 0xba, 0xd0,
+                0x08, 0x89, 0x21, 0x07,
+            ],
+            note_cm: [
+                0x57, 0x2b, 0xa2, 0x05, 0x25, 0xb0, 0xac, 0x4d, 0x6d, 0xc0, 0x1a, 0xc2, 0xea, 0x10,
+                0x90, 0xb6, 0xe0, 0xf2, 0xf4, 0xbf, 0x4e, 0xc4, 0xa0, 0xdb, 0x5b, 0xbc, 0xcb, 0x5b,
+                0x78, 0x3a, 0x1e, 0x55,
+            ],
+            note_pos: 287318480,
+            note_nf: [
+                0xfc, 0x74, 0xcd, 0x0e, 0x4b, 0xe0, 0x49, 0x57, 0xb1, 0x96, 0xcf, 0x87, 0x34, 0xae,
+                0x99, 0x23, 0x96, 0xaf, 0x4c, 0xfa, 0x8f, 0xec, 0xbb, 0x86, 0xf9, 0x61, 0xe6, 0xb4,
+                0x07, 0xd5, 0x1e, 0x11,
+            ],
+        },
+        TestVector {
+            sk: [
+                0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07,
+                0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07,
+                0x07, 0x07, 0x07, 0x07,
+            ],
+            ask: [
+                0x74, 0xb4, 0x4a, 0x37, 0xf1, 0x50, 0x23, 0xc0, 0x60, 0x42, 0x7e, 0x1d, 0xae, 0xa3,
+                0xf6, 0x43, 0x12, 0xdd, 0x8f, 0xeb, 0x7b, 0x2c, 0xed, 0xf0, 0xdd, 0x55, 0x44, 0x49,
+                0x3f, 0x87, 0x2c, 0x06,
+            ],
+            nsk: [
+                0x07, 0x5c, 0x35, 0xdb, 0x8b, 0x1b, 0x25, 0x75, 0x42, 0x23, 0xec, 0xee, 0x34, 0xab,
+                0x73, 0x0d, 0xdd, 0xd1, 0xf1, 0x4a, 0x6a, 0x54, 0xf4, 0xc6, 0xf4, 0x68, 0x45, 0x3c,
+                0x3c, 0x6e, 0xd6, 0x0b,
+            ],
+            ovk: [
+                0xe9, 0xe0, 0xdc, 0x1e, 0xd3, 0x11, 0xda, 0xed, 0x64, 0xbd, 0x74, 0xda, 0x5d, 0x94,
+                0xfe, 0x88, 0xa6, 0xea, 0x41, 0x4b, 0x73, 0x12, 0xde, 0x3d, 0x2a, 0x78, 0xf6, 0x46,
+                0x32, 0xbb, 0xe3, 0x73,
+            ],
+            ak: [
+                0x28, 0x3f, 0x9a, 0xaf, 0xa9, 0xbc, 0xb3, 0xe6, 0xce, 0x17, 0xe6, 0x32, 0x12, 0x63,
+                0x4c, 0xb3, 0xee, 0x55, 0x0c, 0x47, 0x6b, 0x67, 0x6b, 0xd3, 0x56, 0xa6, 0xdf, 0x8a,
+                0xdf, 0x51, 0xd2, 0x5e,
+            ],
+            nk: [
+                0xdc, 0x4c, 0x67, 0xb1, 0x0d, 0x4b, 0x0a, 0x21, 0x8d, 0xc6, 0xe1, 0x48, 0x70, 0x66,
+                0x74, 0x0a, 0x40, 0x93, 0x17, 0x86, 0x6c, 0x32, 0xe6, 0x64, 0xb5, 0x0e, 0x39, 0x7a,
+                0xa8, 0x03, 0x89, 0xd4,
+            ],
+            ivk: [
+                0x87, 0x16, 0xc8, 0x28, 0x80, 0xe1, 0x36, 0x83, 0xe1, 0xbb, 0x05, 0x9d, 0xd0, 0x6c,
+                0x80, 0xc9, 0x01, 0x34, 0xa9, 0x6d, 0x5a, 0xfc, 0xa8, 0xaa, 0xc2, 0xbb, 0xf6, 0x8b,
+                0xb0, 0x5f, 0x84, 0x02,
+            ],
+            default_d: [
+                0xad, 0x6e, 0x2e, 0x18, 0x5a, 0x31, 0x00, 0xe3, 0xa6, 0xa8, 0xb3,
+            ],
+            default_pk_d: [
+                0x32, 0xcb, 0x28, 0x06, 0xb8, 0x82, 0xf1, 0x36, 0x8b, 0x0d, 0x4a, 0x89, 0x8f, 0x72,
+                0xc4, 0xc8, 0xf7, 0x28, 0x13, 0x2c, 0xc1, 0x24, 0x56, 0x94, 0x6e, 0x7f, 0x4c, 0xb0,
+                0xfb, 0x05, 0x8d, 0xa9,
+            ],
+            note_v: 11803618549661680832,
+            note_r: [
+                0x51, 0x65, 0xaf, 0xf2, 0x2d, 0xd4, 0xed, 0x56, 0xb4, 0xd8, 0x1d, 0x1f, 0x17, 0x1c,
+                0xc3, 0xd6, 0x43, 0x2f, 0xed, 0x1b, 0xeb, 0xf2, 0x0a, 0x7b, 0xea, 0xb1, 0x2d, 0xb1,
+                0x42, 0xf9, 0x4a, 0x0c,
+            ],
+            note_cm: [
+                0xab, 0x7f, 0xc5, 0x66, 0x87, 0x3c, 0xcd, 0xe6, 0x71, 0xf5, 0x98, 0x27, 0x67, 0x85,
+                0x60, 0xa0, 0x06, 0xf8, 0x2b, 0xb7, 0xad, 0xcd, 0x75, 0x22, 0x3f, 0xa8, 0x59, 0x36,
+                0xf7, 0x8c, 0x2b, 0x23,
+            ],
+            note_pos: 1051032776,
+            note_nf: [
+                0xd2, 0xe8, 0x87, 0xbd, 0x85, 0x4a, 0x80, 0x2b, 0xce, 0x85, 0x70, 0x53, 0x02, 0x0f,
+                0x5d, 0x3e, 0x7c, 0x8a, 0xe5, 0x26, 0x7c, 0x5b, 0x65, 0x83, 0xb3, 0xd2, 0x12, 0xcc,
+                0x8b, 0xb6, 0x98, 0x90,
+            ],
+        },
+        TestVector {
+            sk: [
+                0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08,
+                0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08,
+                0x08, 0x08, 0x08, 0x08,
+            ],
+            ask: [
+                0x03, 0x9d, 0xd9, 0x3d, 0xf3, 0x11, 0xff, 0x8f, 0xba, 0xb3, 0xfe, 0x23, 0x02, 0x19,
+                0xcd, 0x42, 0xac, 0x87, 0x94, 0x84, 0xf3, 0x0b, 0x90, 0x3a, 0x3c, 0x1e, 0x67, 0xcc,
+                0xca, 0x5a, 0x7b, 0x0d,
+            ],
+            nsk: [
+                0x04, 0x9f, 0xa1, 0x4f, 0x48, 0x6c, 0x75, 0xb9, 0xfa, 0xd7, 0xe3, 0xb6, 0x73, 0xa4,
+                0x43, 0xdd, 0x07, 0x4e, 0xaa, 0x96, 0xed, 0xcb, 0x2a, 0x53, 0xea, 0xaa, 0xbd, 0xaf,
+                0x70, 0xff, 0xbb, 0x08,
+            ],
+            ovk: [
+                0x14, 0x7d, 0xd1, 0x1d, 0x77, 0xeb, 0xa1, 0xb1, 0x63, 0x6f, 0xd6, 0x19, 0x0c, 0x62,
+                0xb9, 0xa5, 0xd0, 0x48, 0x1b, 0xee, 0x7e, 0x91, 0x7f, 0xab, 0x02, 0xe2, 0x18, 0x58,
+                0x06, 0x3a, 0xb5, 0x04,
+            ],
+            ak: [
+                0x36, 0x40, 0x48, 0xee, 0xdb, 0xe8, 0xca, 0x20, 0x5e, 0xb7, 0xe7, 0xba, 0x0a, 0x90,
+                0x12, 0x16, 0x6c, 0x7c, 0x7b, 0xd9, 0xeb, 0x22, 0x8e, 0x08, 0x48, 0x14, 0x48, 0xc4,
+                0x88, 0xaa, 0x21, 0xd2,
+            ],
+            nk: [
+                0xed, 0x60, 0xaf, 0x1c, 0xe7, 0xdf, 0x38, 0x07, 0x0d, 0x38, 0x51, 0x43, 0x2a, 0x96,
+                0x48, 0x0d, 0xb0, 0xb4, 0x17, 0xc3, 0x68, 0x2a, 0x1d, 0x68, 0xe3, 0xe8, 0x93, 0x34,
+                0x23, 0x5c, 0x0b, 0xdf,
+            ],
+            ivk: [
+                0x99, 0xc9, 0xb4, 0xb8, 0x4f, 0x4b, 0x4e, 0x35, 0x0f, 0x78, 0x7d, 0x1c, 0xf7, 0x05,
+                0x1d, 0x50, 0xec, 0xc3, 0x4b, 0x1a, 0x5b, 0x20, 0xd2, 0xd2, 0x13, 0x9b, 0x4a, 0xf1,
+                0xf1, 0x60, 0xe0, 0x01,
+            ],
+            default_d: [
+                0x21, 0xc9, 0x0e, 0x1c, 0x65, 0x8b, 0x3e, 0xfe, 0x86, 0xaf, 0x58,
+            ],
+            default_pk_d: [
+                0x9e, 0x64, 0x17, 0x4b, 0x4a, 0xb9, 0x81, 0x40, 0x5c, 0x32, 0x3b, 0x5e, 0x12, 0x47,
+                0x59, 0x45, 0xa4, 0x6d, 0x4f, 0xed, 0xf8, 0x06, 0x08, 0x28, 0x04, 0x1c, 0xd2, 0x0e,
+                0x62, 0xfd, 0x2c, 0xef,
+            ],
+            note_v: 5584102310880684544,
+            note_r: [
+                0x8c, 0x3e, 0x56, 0x44, 0x9d, 0xc8, 0x63, 0x54, 0xd3, 0x3b, 0x02, 0x5e, 0xf2, 0x79,
+                0x34, 0x60, 0xbc, 0xb1, 0x69, 0xf3, 0x32, 0x4e, 0x4a, 0x6b, 0x64, 0xba, 0xa6, 0x08,
+                0x32, 0x31, 0x57, 0x04,
+            ],
+            note_cm: [
+                0x7b, 0x48, 0xa8, 0x37, 0x5d, 0x3e, 0xbd, 0x56, 0xbc, 0x64, 0x9b, 0xb5, 0xb5, 0x24,
+                0x23, 0x36, 0xc2, 0xa0, 0x5a, 0x08, 0x03, 0x23, 0x9b, 0x5b, 0x88, 0xfd, 0x92, 0x07,
+                0x8f, 0xea, 0x4d, 0x04,
+            ],
+            note_pos: 1814747072,
+            note_nf: [
+                0xa8, 0x2f, 0x17, 0x50, 0xcc, 0x5b, 0x2b, 0xee, 0x64, 0x9a, 0x36, 0x5c, 0x04, 0x20,
+                0xed, 0x87, 0x07, 0x5b, 0x88, 0x71, 0xfd, 0xa4, 0xa7, 0xf5, 0x84, 0x0d, 0x6b, 0xbe,
+                0xb1, 0x7c, 0xd6, 0x20,
+            ],
+        },
+        TestVector {
+            sk: [
+                0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09,
+                0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09,
+                0x09, 0x09, 0x09, 0x09,
+            ],
+            ask: [
+                0xeb, 0xbb, 0x40, 0xa9, 0x80, 0xba, 0x3b, 0x88, 0x60, 0x94, 0x8d, 0x01, 0x1e, 0x1b,
+                0xfb, 0x4a, 0xff, 0xe1, 0x6c, 0x65, 0x2e, 0x90, 0xe9, 0x82, 0x58, 0x30, 0x2f, 0x44,
+                0x64, 0xc9, 0x1e, 0x0c,
+            ],
+            nsk: [
+                0x68, 0x43, 0x1b, 0x19, 0x91, 0x04, 0x21, 0x52, 0x00, 0xb9, 0x5e, 0xe5, 0xcb, 0x71,
+                0xbf, 0x8b, 0x88, 0x3a, 0x3e, 0x95, 0xb7, 0x98, 0x9c, 0xad, 0x19, 0x70, 0x63, 0x14,
+                0x1e, 0xbb, 0xfd, 0x00,
+            ],
+            ovk: [
+                0x57, 0x34, 0x67, 0xa7, 0xb3, 0x0e, 0xad, 0x6c, 0xcc, 0x50, 0x47, 0x44, 0xca, 0x9e,
+                0x1a, 0x28, 0x1a, 0x0d, 0x1a, 0x08, 0x73, 0x8b, 0x06, 0xa0, 0x68, 0x4f, 0xea, 0xcd,
+                0x1e, 0x9d, 0x12, 0x6d,
+            ],
+            ak: [
+                0x71, 0xc3, 0x52, 0x3e, 0xec, 0xa3, 0x53, 0x11, 0xfb, 0xd5, 0xd7, 0xe7, 0xd7, 0x0b,
+                0x70, 0x9d, 0x6c, 0x35, 0xa2, 0x4f, 0x26, 0x2b, 0x34, 0xbf, 0x64, 0x05, 0x9b, 0xf2,
+                0xc0, 0x2e, 0x0b, 0xa8,
+            ],
+            nk: [
+                0x62, 0x44, 0x00, 0x10, 0x3b, 0x65, 0x69, 0xb7, 0x35, 0x8f, 0xe8, 0x0f, 0x6f, 0x6c,
+                0xad, 0x43, 0x25, 0xde, 0xfd, 0xa9, 0xd9, 0x49, 0x9c, 0x2b, 0x8f, 0x88, 0x6a, 0x62,
+                0x69, 0xa2, 0xaa, 0x52,
+            ],
+            ivk: [
+                0xdb, 0x95, 0xea, 0x8b, 0xd9, 0xf9, 0x3d, 0x41, 0xb5, 0xab, 0x2b, 0xeb, 0xc9, 0x1a,
+                0x38, 0xed, 0xd5, 0x27, 0x08, 0x3e, 0x2a, 0x6e, 0xf9, 0xf3, 0xc2, 0x97, 0x02, 0xd5,
+                0xff, 0x89, 0xed, 0x00,
+            ],
+            default_d: [
+                0x23, 0x3c, 0x4a, 0xb8, 0x86, 0xa5, 0x5e, 0x3b, 0xa3, 0x74, 0xc0,
+            ],
+            default_pk_d: [
+                0xb6, 0x8e, 0x9e, 0xe0, 0xc0, 0x67, 0x8d, 0x7b, 0x30, 0x36, 0x93, 0x1c, 0x83, 0x1a,
+                0x25, 0x25, 0x5f, 0x7e, 0xe4, 0x87, 0x38, 0x5a, 0x30, 0x31, 0x6e, 0x15, 0xf6, 0x48,
+                0x2b, 0x87, 0x4f, 0xda,
+            ],
+            note_v: 17811330145809239872,
+            note_r: [
+                0x6e, 0xbb, 0xed, 0x74, 0x36, 0x19, 0xa2, 0x56, 0xf9, 0xad, 0x2e, 0x85, 0x88, 0x0c,
+                0xfa, 0xa9, 0x09, 0x8a, 0x5f, 0xdb, 0x16, 0x29, 0x99, 0x0d, 0x9a, 0x7d, 0x3b, 0xb9,
+                0x3f, 0xc9, 0x00, 0x03,
+            ],
+            note_cm: [
+                0xd3, 0x76, 0xa7, 0xbe, 0xe8, 0xce, 0x67, 0xf4, 0xef, 0xde, 0x56, 0xaa, 0x77, 0xcf,
+                0x64, 0x41, 0x9b, 0x0e, 0x55, 0x0a, 0xbb, 0xcb, 0x8e, 0x2b, 0xcb, 0xda, 0x8b, 0x63,
+                0xe4, 0x1d, 0xeb, 0x37,
+            ],
+            note_pos: 2578461368,
+            note_nf: [
+                0x65, 0x36, 0x74, 0x87, 0x3b, 0x3c, 0x67, 0x0c, 0x58, 0x85, 0x84, 0x73, 0xe7, 0xfe,
+                0x72, 0x19, 0x72, 0xfb, 0x96, 0xe2, 0x15, 0xb8, 0x73, 0x77, 0xa1, 0x7c, 0xa3, 0x71,
+                0x0d, 0x93, 0xc9, 0xe9,
+            ],
+        },
+    ];
+
+    for tv in test_vectors {
+        // Compute commitment and compare with test vector
+        let mut result = [0u8; 32];
+        assert!(librustzcash_sapling_compute_cmu(
+            true,
+            &tv.default_d,
+            &tv.default_pk_d,
+            tv.note_v,
+            &tv.note_r,
+            &mut result
+        ));
+        assert_eq!(&result, &tv.note_cm);
+
+        // Compute nullifier and compare with test vector
+        assert!(librustzcash_sapling_compute_nf(
+            &tv.default_d,
+            &tv.default_pk_d,
+            tv.note_v,
+            &tv.note_r,
+            &tv.ak,
+            &tv.nk,
+            tv.note_pos,
+            &mut result
+        ));
+        assert_eq!(&result, &tv.note_nf);
+    }
+}
diff --git a/depend/zcash/src/rust/src/tests/res/tree1023.dat b/depend/zcash/src/rust/src/tests/res/tree1023.dat
new file mode 100644
index 000000000..bfd79d10e
Binary files /dev/null and b/depend/zcash/src/rust/src/tests/res/tree1023.dat differ
diff --git a/depend/zcash/src/rust/src/tests/res/tree16.dat b/depend/zcash/src/rust/src/tests/res/tree16.dat
new file mode 100644
index 000000000..bde2e74d4
Binary files /dev/null and b/depend/zcash/src/rust/src/tests/res/tree16.dat differ
diff --git a/depend/zcash/src/rust/src/tests/signatures.rs b/depend/zcash/src/rust/src/tests/signatures.rs
new file mode 100644
index 000000000..028e3a016
--- /dev/null
+++ b/depend/zcash/src/rust/src/tests/signatures.rs
@@ -0,0 +1,510 @@
+use zcash_primitives::{
+    constants::SPENDING_KEY_GENERATOR,
+    sapling::redjubjub::{PrivateKey, PublicKey, Signature},
+};
+
+#[test]
+fn redjubjub_signatures() {
+    struct TestVector {
+        sk: [u8; 32],
+        vk: [u8; 32],
+        alpha: [u8; 32],
+        rsk: [u8; 32],
+        rvk: [u8; 32],
+        m: [u8; 32],
+        sig: [u8; 64],
+        rsig: [u8; 64],
+    }
+
+    // From https://github.com/zcash-hackworks/zcash-test-vectors/blob/master/sapling_signatures.py
+    let test_vectors = vec![
+        TestVector {
+            sk: [
+                0x18, 0xe2, 0x8d, 0xea, 0x5c, 0x11, 0x81, 0x7a, 0xee, 0xb2, 0x1a, 0x19, 0x98, 0x1d,
+                0x28, 0x36, 0x8e, 0xc4, 0x38, 0xaf, 0xc2, 0x5a, 0x8d, 0xb9, 0x4e, 0xbe, 0x08, 0xd7,
+                0xa0, 0x28, 0x8e, 0x09,
+            ],
+            vk: [
+                0x9b, 0x01, 0x53, 0xb0, 0x3d, 0x32, 0x0f, 0xe2, 0x3e, 0x28, 0x34, 0xd5, 0xd6, 0x1d,
+                0xbb, 0x1f, 0x51, 0x9b, 0x3f, 0x41, 0xf8, 0xf9, 0x46, 0x15, 0x2b, 0xf0, 0xc3, 0xf2,
+                0x47, 0xd1, 0x18, 0x07,
+            ],
+            alpha: [
+                0xff, 0xd1, 0xa1, 0x27, 0x32, 0x52, 0xb1, 0x87, 0xf4, 0xed, 0x32, 0x6d, 0xfc, 0x98,
+                0x85, 0x3e, 0x29, 0x17, 0xc2, 0xb3, 0x63, 0x79, 0xb1, 0x75, 0xda, 0x63, 0xb9, 0xef,
+                0x6d, 0xda, 0x6c, 0x08,
+            ],
+            rsk: [
+                0x60, 0x87, 0x38, 0x3b, 0x30, 0x55, 0x9b, 0x31, 0x60, 0x90, 0x85, 0xb9, 0x00, 0x96,
+                0x45, 0xce, 0xb6, 0xa0, 0xc6, 0x61, 0x25, 0x99, 0xd7, 0x28, 0x80, 0x72, 0x8e, 0x61,
+                0x24, 0x4e, 0x7d, 0x03,
+            ],
+            rvk: [
+                0xc1, 0xba, 0xbc, 0xb6, 0xea, 0xe2, 0xb9, 0x94, 0xee, 0x6d, 0x65, 0xc1, 0x0b, 0x9d,
+                0xad, 0x59, 0x40, 0xdc, 0x73, 0x5b, 0x07, 0x50, 0x4d, 0xae, 0xd1, 0xe4, 0x6b, 0x07,
+                0x09, 0xb4, 0x51, 0x36,
+            ],
+            m: [
+                0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+                0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+                0x00, 0x00, 0x00, 0x00,
+            ],
+            sig: [
+                0xea, 0xa0, 0x57, 0x47, 0x6b, 0x4a, 0xb4, 0x82, 0x28, 0x8b, 0x93, 0xdf, 0x8f, 0xe0,
+                0xc5, 0xce, 0x9d, 0x78, 0x83, 0x67, 0xf2, 0xbe, 0x55, 0x1b, 0x7f, 0x7a, 0x82, 0xa6,
+                0xdb, 0x36, 0x04, 0x68, 0xde, 0xb9, 0xa7, 0xb7, 0xaf, 0xaa, 0xdf, 0xec, 0xa6, 0xf4,
+                0x81, 0x19, 0x3d, 0xc6, 0x57, 0x57, 0x47, 0xf6, 0x0a, 0x1a, 0x8a, 0x48, 0xff, 0x0a,
+                0xd7, 0x0c, 0xf8, 0xcb, 0x8d, 0x52, 0x8e, 0x08,
+            ],
+            rsig: [
+                0xd5, 0x6f, 0x0d, 0x91, 0xaf, 0x42, 0x4e, 0x1f, 0x1c, 0x7f, 0xb8, 0x6b, 0xa4, 0xee,
+                0xd1, 0x43, 0xcc, 0x16, 0x66, 0x0c, 0x5f, 0xe8, 0xd7, 0xdc, 0x0d, 0x28, 0x4b, 0xcf,
+                0x65, 0xa0, 0x89, 0xe9, 0x8b, 0x56, 0x1f, 0x9f, 0x20, 0x1a, 0x63, 0x3d, 0x70, 0x0c,
+                0xd3, 0x98, 0x1e, 0x8c, 0xac, 0x07, 0xb5, 0xa8, 0x7e, 0xfa, 0x61, 0x86, 0x06, 0x2d,
+                0xd8, 0xe5, 0xd6, 0x32, 0x5e, 0x7b, 0x82, 0x02,
+            ],
+        },
+        TestVector {
+            sk: [
+                0x05, 0x96, 0x54, 0xf9, 0x61, 0x27, 0x3d, 0xaf, 0xda, 0x3b, 0x26, 0x77, 0xb3, 0x5c,
+                0x18, 0xaf, 0x6b, 0x11, 0xad, 0xfb, 0x9e, 0xe9, 0x0b, 0x48, 0x93, 0x5e, 0x55, 0x7c,
+                0x8d, 0x5d, 0x9c, 0x04,
+            ],
+            vk: [
+                0xfa, 0xf6, 0xc3, 0xb7, 0x37, 0xe8, 0xe6, 0x11, 0xaa, 0xfe, 0xa5, 0x2f, 0x03, 0xbb,
+                0x27, 0x86, 0xe1, 0x83, 0x53, 0xeb, 0xe0, 0xd3, 0x13, 0x9e, 0x3c, 0x54, 0x49, 0x87,
+                0x80, 0xc8, 0xc1, 0x99,
+            ],
+            alpha: [
+                0xc3, 0x0b, 0x96, 0x20, 0x8d, 0xa8, 0x00, 0xe1, 0x0a, 0xf0, 0x25, 0x42, 0xce, 0x69,
+                0x4b, 0x7e, 0xd7, 0x6a, 0x28, 0x29, 0x9f, 0x85, 0x99, 0x8e, 0x5d, 0x61, 0x08, 0x12,
+                0x68, 0x1b, 0xf0, 0x03,
+            ],
+            rsk: [
+                0xc8, 0xa1, 0xea, 0x19, 0xef, 0xcf, 0x3d, 0x90, 0xe5, 0x2b, 0x4c, 0xb9, 0x81, 0xc6,
+                0x63, 0x2d, 0x43, 0x7c, 0xd5, 0x24, 0x3e, 0x6f, 0xa5, 0xd6, 0xf0, 0xbf, 0x5d, 0x8e,
+                0xf5, 0x78, 0x8c, 0x08,
+            ],
+            rvk: [
+                0xd5, 0x24, 0xdc, 0xe7, 0x73, 0x40, 0x69, 0x75, 0x8a, 0x91, 0xf0, 0x07, 0xa8, 0x69,
+                0x50, 0x5d, 0xfc, 0x4a, 0xba, 0x17, 0x20, 0x59, 0x4d, 0x4d, 0x74, 0xf0, 0x07, 0x70,
+                0x0e, 0x62, 0xee, 0x00,
+            ],
+            m: [
+                0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,
+                0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,
+                0x01, 0x01, 0x01, 0x01,
+            ],
+            sig: [
+                0x22, 0x35, 0x54, 0x94, 0xa8, 0x31, 0x6a, 0xb1, 0x34, 0x73, 0xf5, 0x5e, 0x62, 0x66,
+                0xb2, 0xfb, 0x41, 0x97, 0x31, 0x5e, 0xac, 0x62, 0xf8, 0x2c, 0xc7, 0x3d, 0xca, 0xca,
+                0x19, 0x90, 0x90, 0xf1, 0x5b, 0xe1, 0x98, 0xce, 0x7d, 0x3f, 0x9f, 0xc8, 0xff, 0xf5,
+                0x50, 0xe1, 0x08, 0x81, 0xec, 0x49, 0xff, 0x27, 0x36, 0x9e, 0x7d, 0x4f, 0xd9, 0x64,
+                0x01, 0x53, 0x49, 0x2a, 0x0a, 0x06, 0x25, 0x08,
+            ],
+            rsig: [
+                0xf4, 0xb8, 0x94, 0xba, 0x84, 0xce, 0x1e, 0xc3, 0x8a, 0x63, 0x15, 0x2f, 0xc4, 0x09,
+                0xf9, 0x47, 0xd6, 0x1a, 0xbb, 0x1f, 0x48, 0x91, 0x63, 0x6b, 0xc3, 0xee, 0x19, 0xef,
+                0x6d, 0x4b, 0x30, 0xc0, 0xfd, 0x22, 0x86, 0x6b, 0x84, 0xff, 0xbc, 0x7e, 0x2a, 0x78,
+                0xc4, 0x3f, 0x57, 0x83, 0xd2, 0xd2, 0xea, 0xd0, 0x78, 0x59, 0x55, 0x03, 0x74, 0x43,
+                0xc2, 0xf4, 0xd5, 0x2f, 0x78, 0x5e, 0xee, 0x07,
+            ],
+        },
+        TestVector {
+            sk: [
+                0xad, 0xe7, 0xab, 0xb5, 0x51, 0xc7, 0x9d, 0x0f, 0x0e, 0x42, 0xef, 0x7f, 0x12, 0x06,
+                0xb8, 0x77, 0x12, 0xa8, 0x4a, 0x61, 0xde, 0xa3, 0xf3, 0x7b, 0x42, 0x49, 0x6d, 0x7e,
+                0xfd, 0x12, 0x52, 0x0c,
+            ],
+            vk: [
+                0x36, 0x9e, 0xa7, 0x51, 0x76, 0x2f, 0x83, 0x9d, 0x25, 0x70, 0x1a, 0x5e, 0xeb, 0x55,
+                0x1e, 0xc4, 0xf0, 0x6c, 0x12, 0x90, 0xb3, 0xb9, 0xc3, 0xa7, 0x24, 0x40, 0x2d, 0xec,
+                0x02, 0x73, 0x92, 0x21,
+            ],
+            alpha: [
+                0x81, 0x92, 0x25, 0x29, 0xa6, 0x3e, 0xe7, 0x43, 0xfc, 0x4f, 0xbb, 0xac, 0x45, 0xc4,
+                0x98, 0x83, 0x16, 0xbc, 0x9b, 0x6e, 0x42, 0x8b, 0x01, 0xa8, 0xd3, 0x1f, 0xc1, 0xc2,
+                0xa6, 0xca, 0x62, 0x05,
+            ],
+            rsk: [
+                0x77, 0x4d, 0xda, 0x07, 0x99, 0xf7, 0xed, 0x82, 0x87, 0x81, 0xe2, 0x5f, 0xc4, 0xa9,
+                0xe8, 0x54, 0x28, 0x29, 0xb2, 0xce, 0x1f, 0xf4, 0x8d, 0x1d, 0x6d, 0xb9, 0xfa, 0xdb,
+                0xb9, 0x28, 0x37, 0x03,
+            ],
+            rvk: [
+                0x0d, 0x92, 0xad, 0x6d, 0x46, 0xed, 0xac, 0xd0, 0x23, 0xd4, 0xd2, 0xef, 0x70, 0x3a,
+                0x6c, 0xa0, 0xa7, 0x92, 0xcf, 0xc4, 0xb7, 0xda, 0x11, 0xc2, 0x35, 0x3b, 0xc8, 0x45,
+                0xa2, 0x7a, 0x97, 0x4d,
+            ],
+            m: [
+                0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02,
+                0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02,
+                0x02, 0x02, 0x02, 0x02,
+            ],
+            sig: [
+                0xdd, 0x65, 0x21, 0x01, 0x4d, 0xff, 0x70, 0x6e, 0x3a, 0x38, 0x52, 0x7a, 0x86, 0xb6,
+                0xc1, 0x6e, 0x94, 0x14, 0x80, 0xe7, 0x33, 0xef, 0xf7, 0x9e, 0xbe, 0x0c, 0x43, 0x03,
+                0x79, 0xd7, 0x57, 0x04, 0x9d, 0xb7, 0x90, 0xcd, 0x5e, 0x14, 0x44, 0x7c, 0x38, 0x6f,
+                0x5f, 0xcb, 0x41, 0x9f, 0x27, 0xc4, 0x41, 0x3f, 0x35, 0x88, 0xfa, 0x21, 0x42, 0xd2,
+                0xcf, 0xba, 0xed, 0x08, 0x2c, 0xc6, 0xdb, 0x07,
+            ],
+            rsig: [
+                0xd8, 0x94, 0x45, 0xcb, 0x9b, 0xd1, 0x03, 0x35, 0x69, 0x23, 0x1d, 0xd6, 0x28, 0xaa,
+                0x62, 0x81, 0x09, 0xfe, 0x93, 0x50, 0x2b, 0xf2, 0x2f, 0x9a, 0x5f, 0x37, 0xb1, 0x4e,
+                0x51, 0x7f, 0x9a, 0x20, 0x54, 0xae, 0xe3, 0xc8, 0x1b, 0x60, 0xb3, 0xf0, 0x55, 0x1e,
+                0x32, 0xf7, 0x93, 0x5a, 0xbc, 0x2f, 0x37, 0xb9, 0x9a, 0xb3, 0xec, 0x99, 0x68, 0x02,
+                0xef, 0xd6, 0x50, 0x69, 0xe1, 0x28, 0x12, 0x08,
+            ],
+        },
+        TestVector {
+            sk: [
+                0xc9, 0xd2, 0xae, 0x1f, 0x6d, 0x32, 0xa6, 0x75, 0xd0, 0x9e, 0xb0, 0x82, 0x3f, 0x46,
+                0x7f, 0xa9, 0x21, 0xb3, 0x28, 0x4a, 0xcb, 0x35, 0xfa, 0xbd, 0xfc, 0x99, 0x4d, 0xe5,
+                0x49, 0xb8, 0x59, 0x0d,
+            ],
+            vk: [
+                0x2d, 0x2f, 0x31, 0x6e, 0x5c, 0x36, 0x9a, 0xe4, 0xdd, 0x2c, 0x82, 0x5f, 0x3d, 0x86,
+                0x46, 0x00, 0x58, 0x40, 0x71, 0x84, 0x60, 0x3b, 0x21, 0x2c, 0xf3, 0x45, 0x9f, 0x36,
+                0xc8, 0x69, 0x7f, 0xd8,
+            ],
+            alpha: [
+                0xeb, 0xbc, 0x89, 0x03, 0x11, 0x07, 0xc4, 0x4f, 0x47, 0x88, 0x9e, 0xd4, 0xd4, 0x37,
+                0x5a, 0x41, 0x14, 0xcf, 0x8a, 0x75, 0xdd, 0x33, 0xb9, 0x62, 0xf2, 0xd7, 0x59, 0xd3,
+                0xf4, 0xc6, 0xdf, 0x06,
+            ],
+            rsk: [
+                0xfd, 0x62, 0x41, 0x4c, 0x1f, 0x2b, 0xd3, 0xf4, 0x94, 0x16, 0x87, 0x8a, 0x80, 0x5d,
+                0x71, 0x44, 0x35, 0x47, 0x7f, 0xbe, 0xa7, 0x2e, 0x4c, 0x1a, 0x46, 0xc2, 0x73, 0x53,
+                0x54, 0xca, 0xbb, 0x05,
+            ],
+            rvk: [
+                0xf0, 0x43, 0x0e, 0x95, 0x3b, 0xe6, 0x0b, 0xf4, 0x38, 0xdb, 0xdc, 0xc2, 0x30, 0x3f,
+                0x0e, 0x32, 0xa6, 0xf7, 0xce, 0x2f, 0xbe, 0xdf, 0xb1, 0x3a, 0xc5, 0x18, 0xf7, 0x5a,
+                0x3f, 0xd1, 0x0e, 0xb5,
+            ],
+            m: [
+                0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03,
+                0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03, 0x03,
+                0x03, 0x03, 0x03, 0x03,
+            ],
+            sig: [
+                0x72, 0x79, 0xa7, 0x5c, 0x01, 0x36, 0x75, 0xb3, 0x29, 0x84, 0xe5, 0xc7, 0x3a, 0x98,
+                0x91, 0xeb, 0xf0, 0xb2, 0x29, 0xb1, 0x6e, 0x62, 0x35, 0xba, 0x36, 0xdf, 0xa1, 0xb5,
+                0xa1, 0x0c, 0x5e, 0x44, 0x57, 0x81, 0x91, 0x89, 0x7c, 0x06, 0xb8, 0x52, 0x4a, 0x26,
+                0x74, 0xaa, 0x7a, 0x0c, 0x8c, 0x23, 0x5f, 0x52, 0xd3, 0x3a, 0xc9, 0x2c, 0x70, 0x56,
+                0xb2, 0xbe, 0x95, 0x3c, 0x3f, 0xaa, 0x3d, 0x07,
+            ],
+            rsig: [
+                0xaa, 0xd4, 0x82, 0x8c, 0xb3, 0x42, 0xcf, 0x09, 0xb0, 0x0e, 0x30, 0x2c, 0xbb, 0xe7,
+                0xcc, 0x3e, 0x95, 0xfe, 0x1f, 0xf8, 0x28, 0x74, 0x8e, 0x5f, 0x5b, 0xc6, 0x9c, 0xbf,
+                0xde, 0x6e, 0x27, 0x22, 0xd7, 0x64, 0x35, 0x68, 0x7e, 0x85, 0x0c, 0xd3, 0x07, 0xa9,
+                0xc1, 0x82, 0xec, 0x10, 0xe6, 0x88, 0x1d, 0xd6, 0x5e, 0xed, 0xc1, 0x1f, 0xa7, 0xb4,
+                0x6d, 0xe3, 0xa7, 0x19, 0x59, 0xce, 0xc0, 0x02,
+            ],
+        },
+        TestVector {
+            sk: [
+                0x33, 0xbc, 0xd2, 0x86, 0x45, 0x41, 0xb8, 0xbb, 0x7f, 0xdc, 0x77, 0xa1, 0x9d, 0x97,
+                0x0f, 0x92, 0x4e, 0xae, 0xec, 0xf4, 0x10, 0x3c, 0x38, 0xc8, 0xd2, 0xb0, 0x66, 0x81,
+                0x42, 0xf2, 0x7d, 0x09,
+            ],
+            vk: [
+                0x74, 0x17, 0x94, 0xe6, 0x2c, 0xf9, 0x32, 0x0c, 0x58, 0xba, 0xc5, 0x94, 0xa2, 0xb9,
+                0x0e, 0x34, 0x0a, 0x6d, 0x8a, 0x68, 0x05, 0x6f, 0x6e, 0xd5, 0xc7, 0x86, 0x8c, 0x5f,
+                0xf3, 0xe4, 0xd6, 0x16,
+            ],
+            alpha: [
+                0x7c, 0xe7, 0x25, 0xa5, 0xfe, 0xf6, 0x1b, 0xd4, 0xa1, 0xe9, 0xc7, 0x73, 0x28, 0xe8,
+                0x21, 0x0e, 0xb7, 0x29, 0x2d, 0x95, 0x4c, 0x64, 0xe9, 0x9e, 0x8b, 0xed, 0xd0, 0x7a,
+                0xb3, 0xab, 0x0e, 0x0d,
+            ],
+            rsk: [
+                0xf8, 0x76, 0x01, 0x55, 0xe5, 0x29, 0x3d, 0xbf, 0x9e, 0xb5, 0x77, 0x48, 0x32, 0x5f,
+                0xc9, 0xf9, 0x04, 0x9d, 0xe5, 0x88, 0x5c, 0x65, 0xba, 0x60, 0xb5, 0xee, 0x03, 0x97,
+                0x0b, 0xe9, 0x0e, 0x08,
+            ],
+            rvk: [
+                0x66, 0x62, 0xba, 0x09, 0x95, 0x0a, 0xcc, 0xd2, 0xce, 0xa3, 0xc7, 0xa8, 0x12, 0x90,
+                0xcd, 0x59, 0x78, 0xa6, 0x2b, 0x5a, 0xc5, 0xbb, 0xc4, 0x8d, 0x9f, 0x58, 0x19, 0xcd,
+                0xc9, 0x64, 0x6f, 0x0a,
+            ],
+            m: [
+                0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04,
+                0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04, 0x04,
+                0x04, 0x04, 0x04, 0x04,
+            ],
+            sig: [
+                0x51, 0x23, 0xb3, 0x1f, 0x84, 0xaf, 0x0c, 0x35, 0x5e, 0x13, 0xe7, 0x8a, 0x64, 0xd7,
+                0xa3, 0xcd, 0xfd, 0x6b, 0xdf, 0xfd, 0xc7, 0x33, 0x38, 0xd9, 0x31, 0x7f, 0x73, 0x43,
+                0x91, 0xa5, 0x5a, 0xe6, 0x25, 0x8f, 0x69, 0x80, 0xb9, 0xc7, 0xd1, 0x90, 0xcf, 0xa3,
+                0x65, 0x81, 0xa9, 0xa4, 0x7a, 0x86, 0x3f, 0xd3, 0xbf, 0x76, 0x59, 0x42, 0x22, 0x95,
+                0xb7, 0x5f, 0xd1, 0x22, 0xc3, 0xdd, 0x8a, 0x05,
+            ],
+            rsig: [
+                0x5b, 0xae, 0x25, 0x4f, 0xbd, 0xed, 0x60, 0x7a, 0x5c, 0x48, 0xb5, 0x30, 0x29, 0xf5,
+                0x9b, 0xa7, 0x06, 0x32, 0x48, 0x79, 0xaa, 0x18, 0xd9, 0xc4, 0x73, 0x19, 0x00, 0x4b,
+                0xe0, 0x2c, 0xec, 0xe0, 0xb8, 0xbb, 0x02, 0x4a, 0x7a, 0xab, 0xaa, 0x0a, 0x64, 0x0f,
+                0x3a, 0x54, 0xdc, 0xda, 0xf2, 0x11, 0x31, 0x46, 0x9a, 0x50, 0x06, 0xbe, 0x27, 0x81,
+                0xa5, 0x67, 0xff, 0xa6, 0x50, 0x3a, 0x35, 0x03,
+            ],
+        },
+        TestVector {
+            sk: [
+                0xca, 0x35, 0x06, 0xd6, 0xaf, 0x77, 0x67, 0xb5, 0x79, 0x0e, 0xf0, 0xc5, 0x19, 0x0f,
+                0xb3, 0xf3, 0x87, 0x7c, 0x4a, 0xab, 0x40, 0xe0, 0xdd, 0x65, 0x1a, 0xbb, 0xda, 0xcb,
+                0x54, 0x4e, 0xd0, 0x05,
+            ],
+            vk: [
+                0xba, 0xb6, 0xcf, 0xb5, 0xc8, 0xea, 0x34, 0x91, 0x25, 0x1b, 0x46, 0xd5, 0x2a, 0xca,
+                0x25, 0xd9, 0xe9, 0xaf, 0x69, 0xfa, 0xa9, 0xb4, 0xe4, 0x0b, 0x03, 0xad, 0x00, 0x86,
+                0xde, 0x59, 0xb5, 0x1f,
+            ],
+            alpha: [
+                0xbe, 0xa3, 0x87, 0x20, 0x3f, 0x43, 0x76, 0x0a, 0xd3, 0x7d, 0x61, 0xde, 0x0e, 0xb5,
+                0x9f, 0xca, 0x6c, 0xab, 0x75, 0x60, 0xdf, 0x64, 0xfa, 0xbb, 0x95, 0x11, 0x57, 0x9f,
+                0x6f, 0x68, 0x26, 0x06,
+            ],
+            rsk: [
+                0x88, 0xd9, 0x8d, 0xf6, 0xee, 0xba, 0xdd, 0xbf, 0x4c, 0x8c, 0x51, 0xa4, 0x28, 0xc4,
+                0x52, 0xbe, 0xf4, 0x27, 0xc0, 0x0b, 0x20, 0x45, 0xd8, 0x21, 0xb0, 0xcc, 0x31, 0x6b,
+                0xc4, 0xb6, 0xf6, 0x0b,
+            ],
+            rvk: [
+                0x11, 0x26, 0x7d, 0x14, 0xd5, 0xe0, 0xb2, 0xbb, 0x3c, 0xe0, 0x99, 0xe8, 0xef, 0x84,
+                0x49, 0x47, 0x1c, 0xbc, 0xfc, 0x69, 0x39, 0xa4, 0xb3, 0x48, 0xde, 0xa2, 0xc1, 0x73,
+                0x56, 0xa1, 0xe8, 0xdd,
+            ],
+            m: [
+                0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05,
+                0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05, 0x05,
+                0x05, 0x05, 0x05, 0x05,
+            ],
+            sig: [
+                0xdc, 0x18, 0xc8, 0x8d, 0x96, 0x44, 0x42, 0x40, 0x6d, 0x65, 0x0a, 0xa2, 0xff, 0xbd,
+                0x83, 0xd1, 0x13, 0xbf, 0x6a, 0x19, 0xda, 0x78, 0xf2, 0x66, 0x5b, 0x29, 0x4f, 0xa5,
+                0xfa, 0x45, 0x0b, 0x92, 0x81, 0xa0, 0x7e, 0x32, 0x0c, 0x1a, 0xa3, 0x1d, 0x32, 0x44,
+                0x9e, 0x00, 0xc5, 0xc3, 0x2d, 0xb2, 0xf4, 0x13, 0xdf, 0x0b, 0x63, 0xd0, 0x72, 0x8f,
+                0xa4, 0x09, 0x41, 0xa8, 0xda, 0x02, 0x4f, 0x01,
+            ],
+            rsig: [
+                0x59, 0xe2, 0xe8, 0x18, 0x76, 0x6c, 0x50, 0xfc, 0x8f, 0x38, 0x40, 0xb2, 0x72, 0xaf,
+                0x9a, 0xd9, 0x47, 0x56, 0xc8, 0x41, 0x32, 0x95, 0xfc, 0x79, 0x5f, 0xaf, 0xbc, 0xc0,
+                0x71, 0x8e, 0x6c, 0x08, 0x16, 0x9a, 0x00, 0xd5, 0x83, 0x02, 0x77, 0x2a, 0x28, 0x28,
+                0x43, 0xe8, 0x88, 0xd9, 0x81, 0xfa, 0x04, 0x79, 0x5d, 0x01, 0x4c, 0xf9, 0xc8, 0xcd,
+                0xb9, 0x07, 0xff, 0x1b, 0x43, 0x0d, 0x92, 0x00,
+            ],
+        },
+        TestVector {
+            sk: [
+                0xbc, 0x27, 0x83, 0x8d, 0xe2, 0xa6, 0x14, 0xcf, 0xba, 0x6c, 0x3e, 0x92, 0x2a, 0x8f,
+                0x84, 0x24, 0xd9, 0x85, 0x6f, 0x68, 0x16, 0xf3, 0xbc, 0x61, 0x02, 0x31, 0x3b, 0x7f,
+                0xaf, 0x5c, 0x3a, 0x0c,
+            ],
+            vk: [
+                0xd7, 0x9b, 0xe9, 0xff, 0x22, 0x9a, 0x2e, 0x35, 0xf5, 0xbc, 0xa4, 0x48, 0xe5, 0xeb,
+                0x4a, 0x8a, 0xa9, 0x7f, 0xb4, 0x18, 0x02, 0x91, 0x25, 0xcf, 0xba, 0xa7, 0x8a, 0x91,
+                0xa3, 0x82, 0xb0, 0x94,
+            ],
+            alpha: [
+                0x21, 0xa7, 0x15, 0x0e, 0x19, 0x4f, 0xed, 0xfe, 0xf9, 0x0c, 0x5d, 0x10, 0xe4, 0x20,
+                0x85, 0x8b, 0xca, 0x40, 0x04, 0x04, 0x0e, 0xb6, 0x81, 0xd1, 0x4e, 0x75, 0xc4, 0x47,
+                0x13, 0x51, 0xcb, 0x02,
+            ],
+            rsk: [
+                0x26, 0xa2, 0xa1, 0xc4, 0x9c, 0xe7, 0x6a, 0xfd, 0x31, 0x69, 0xd3, 0xd5, 0x7a, 0x8f,
+                0xa1, 0x09, 0xa3, 0x8b, 0x3f, 0x6b, 0x23, 0x6e, 0xd7, 0x2c, 0xa8, 0xf6, 0xcb, 0x61,
+                0xd8, 0xf8, 0x87, 0x00,
+            ],
+            rvk: [
+                0x54, 0xbf, 0x1b, 0xe7, 0x2e, 0x6d, 0x41, 0x20, 0x8b, 0x8a, 0xec, 0x11, 0x61, 0xd3,
+                0xba, 0x59, 0x51, 0x9f, 0xb9, 0x3d, 0xa0, 0x1a, 0x55, 0xe6, 0x78, 0xe2, 0x75, 0x20,
+                0x06, 0x60, 0x36, 0xc9,
+            ],
+            m: [
+                0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06,
+                0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06,
+                0x06, 0x06, 0x06, 0x06,
+            ],
+            sig: [
+                0x9a, 0xf6, 0xf2, 0x80, 0x0f, 0x4b, 0x80, 0xf7, 0x93, 0xbe, 0x64, 0x8a, 0x43, 0x9f,
+                0x86, 0xe5, 0x7d, 0xa1, 0xb9, 0x19, 0x99, 0x9e, 0x41, 0x91, 0x09, 0x99, 0xd4, 0x2e,
+                0xd0, 0xf3, 0x89, 0x6d, 0xb7, 0x6e, 0x06, 0x38, 0x8b, 0x27, 0x2c, 0x99, 0x85, 0x8b,
+                0x55, 0x04, 0xd0, 0x2e, 0xc6, 0xb4, 0xd5, 0x25, 0xb8, 0x71, 0x38, 0x10, 0x50, 0x5f,
+                0x4f, 0xc0, 0x31, 0x08, 0x3a, 0x14, 0xbf, 0x09,
+            ],
+            rsig: [
+                0x3f, 0x7d, 0x50, 0x71, 0xb8, 0x76, 0x17, 0x49, 0x05, 0x71, 0xa8, 0xbe, 0x91, 0x74,
+                0x9e, 0x69, 0xf6, 0xbc, 0xba, 0x5a, 0xb6, 0x26, 0xe4, 0x2f, 0xf9, 0x2d, 0x0d, 0x7d,
+                0xab, 0x73, 0xf3, 0x03, 0x61, 0xe5, 0xa2, 0x24, 0x99, 0x8e, 0x1f, 0x5e, 0xa1, 0xe5,
+                0xf8, 0x68, 0x9a, 0x06, 0xa2, 0x77, 0x48, 0xbf, 0x74, 0x19, 0x63, 0xef, 0x51, 0x33,
+                0x22, 0xf4, 0xa1, 0xba, 0x99, 0xaa, 0x36, 0x03,
+            ],
+        },
+        TestVector {
+            sk: [
+                0xb2, 0x08, 0x59, 0xb8, 0x8e, 0xe3, 0x33, 0x8a, 0x64, 0x95, 0x4f, 0x8a, 0x9e, 0x8e,
+                0x9b, 0xf3, 0xe7, 0x11, 0x5a, 0xcf, 0x7c, 0x6e, 0x7f, 0x01, 0x43, 0x2c, 0x5f, 0x76,
+                0x96, 0xd2, 0xd0, 0x05,
+            ],
+            vk: [
+                0xa8, 0x1f, 0xe6, 0x84, 0x6d, 0xbe, 0x0a, 0x75, 0xc0, 0xf4, 0x9b, 0x21, 0x32, 0x32,
+                0xbe, 0xad, 0xd1, 0xf9, 0xa5, 0x64, 0x67, 0x3d, 0x25, 0xb9, 0x1e, 0xe0, 0xf1, 0x7c,
+                0xe9, 0xca, 0xa3, 0x63,
+            ],
+            alpha: [
+                0x44, 0xd9, 0x08, 0xe1, 0xc1, 0x5e, 0x6b, 0xd9, 0x38, 0x0a, 0x8b, 0x23, 0x5a, 0xce,
+                0x02, 0xfa, 0xc1, 0xc0, 0x87, 0x94, 0x45, 0x4b, 0xcd, 0xb4, 0xa6, 0xf4, 0x8c, 0xea,
+                0x78, 0xa7, 0x4a, 0x04,
+            ],
+            rsk: [
+                0xf6, 0xe1, 0x61, 0x99, 0x50, 0x42, 0x9f, 0x63, 0x9d, 0x9f, 0xda, 0xad, 0xf8, 0x5c,
+                0x9e, 0xed, 0xa9, 0xd2, 0xe1, 0x63, 0xc2, 0xb9, 0x4c, 0xb6, 0xe9, 0x20, 0xec, 0x60,
+                0x0f, 0x7a, 0x1b, 0x0a,
+            ],
+            rvk: [
+                0x0b, 0x68, 0xd5, 0x0f, 0x91, 0x3c, 0xd1, 0xb7, 0x8b, 0x59, 0x92, 0x1e, 0x16, 0x56,
+                0xd5, 0x76, 0xb0, 0xeb, 0x17, 0x1e, 0xd3, 0x87, 0x0d, 0x39, 0xfe, 0xc6, 0x94, 0x41,
+                0xb3, 0x4b, 0x25, 0x38,
+            ],
+            m: [
+                0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07,
+                0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07,
+                0x07, 0x07, 0x07, 0x07,
+            ],
+            sig: [
+                0x64, 0x59, 0x67, 0x6a, 0x94, 0x16, 0x34, 0xec, 0xb6, 0x1e, 0x59, 0xb7, 0x9a, 0x98,
+                0xab, 0xe5, 0x87, 0x6f, 0x35, 0x6f, 0x72, 0x8a, 0xa0, 0x9e, 0x0c, 0xca, 0x9e, 0xfe,
+                0x05, 0x76, 0x1a, 0x33, 0x09, 0xaa, 0x88, 0xb2, 0xfa, 0x0e, 0xe2, 0xd0, 0x4c, 0x1c,
+                0x46, 0xe9, 0xf2, 0xa0, 0x48, 0xd5, 0x9d, 0x55, 0x65, 0xaf, 0xa6, 0xc3, 0xf1, 0x5b,
+                0xce, 0x70, 0x8d, 0xaa, 0xab, 0x7b, 0x34, 0x0e,
+            ],
+            rsig: [
+                0xc9, 0x66, 0x84, 0xec, 0x7e, 0xa6, 0x0b, 0xde, 0x87, 0x88, 0x22, 0xdd, 0xca, 0xf6,
+                0xb8, 0xb0, 0xbd, 0x31, 0x98, 0x51, 0x54, 0xdf, 0x9a, 0xd4, 0xf6, 0x90, 0x7d, 0xf8,
+                0xfe, 0xd9, 0x5c, 0x1d, 0x84, 0xfe, 0x67, 0xe6, 0x78, 0x75, 0xa5, 0x39, 0x55, 0x0e,
+                0xb2, 0x51, 0x4f, 0x19, 0x3b, 0x8e, 0xd4, 0x57, 0x25, 0x6c, 0x8d, 0x30, 0x28, 0x1d,
+                0x6f, 0x8b, 0xb9, 0x54, 0x49, 0x24, 0xca, 0x0c,
+            ],
+        },
+        TestVector {
+            sk: [
+                0x32, 0x16, 0xae, 0x47, 0xe9, 0xf5, 0x3e, 0x8a, 0x52, 0x79, 0x6f, 0x24, 0xb6, 0x24,
+                0x60, 0x77, 0x6b, 0xd5, 0xf2, 0x05, 0xa7, 0x8e, 0x15, 0x95, 0xbc, 0x8e, 0xfe, 0xdc,
+                0x51, 0x9d, 0x36, 0x0b,
+            ],
+            vk: [
+                0xdf, 0x74, 0xbf, 0x04, 0x79, 0x61, 0xcc, 0x5c, 0xda, 0xc8, 0x28, 0x90, 0xc7, 0x6e,
+                0xc6, 0x75, 0xbd, 0x4e, 0x89, 0xea, 0xd2, 0x80, 0xc9, 0x52, 0xd7, 0xc3, 0x3e, 0xea,
+                0xf2, 0xb5, 0xa6, 0x6b,
+            ],
+            alpha: [
+                0xc9, 0x61, 0xf2, 0xdd, 0x93, 0x68, 0x2a, 0xdb, 0x93, 0xf5, 0xc0, 0x5a, 0x73, 0xfd,
+                0xbc, 0x6d, 0x43, 0xc7, 0x0e, 0x1b, 0x15, 0xe8, 0xd5, 0x3e, 0x3f, 0x17, 0xa8, 0x24,
+                0x94, 0xe3, 0xf2, 0x09,
+            ],
+            rsk: [
+                0x44, 0x4b, 0xa9, 0x4e, 0x1e, 0x50, 0xd2, 0x94, 0x63, 0x5e, 0x68, 0xb2, 0x95, 0x01,
+                0xb5, 0x3e, 0xae, 0x61, 0xcd, 0x1f, 0xbb, 0x3b, 0x84, 0xcd, 0x52, 0xf6, 0x72, 0x9c,
+                0xfb, 0xcb, 0xab, 0x06,
+            ],
+            rvk: [
+                0x0a, 0xfb, 0xe4, 0x06, 0xa8, 0x91, 0xc3, 0xb8, 0xc3, 0x10, 0xc2, 0x15, 0xbc, 0x68,
+                0xa9, 0x13, 0xde, 0x7c, 0xda, 0x06, 0xaf, 0x29, 0x42, 0x00, 0x56, 0x46, 0x8d, 0x0c,
+                0x08, 0x85, 0x5b, 0x28,
+            ],
+            m: [
+                0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08,
+                0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08,
+                0x08, 0x08, 0x08, 0x08,
+            ],
+            sig: [
+                0x24, 0x93, 0x2c, 0x1f, 0xaa, 0x01, 0x63, 0xca, 0x9a, 0x7f, 0xcd, 0xe4, 0x76, 0x11,
+                0x29, 0xd2, 0xe5, 0xe9, 0x9c, 0xf5, 0xef, 0xa2, 0x5d, 0x27, 0x04, 0x58, 0x8e, 0x1c,
+                0x75, 0x67, 0x7b, 0x5e, 0xeb, 0xe4, 0x55, 0x04, 0x8d, 0x7c, 0xe1, 0xb0, 0xd2, 0x01,
+                0x27, 0x53, 0xf7, 0x1b, 0x27, 0x25, 0x01, 0x2e, 0xe1, 0x85, 0x49, 0x28, 0x73, 0x18,
+                0xf9, 0xcd, 0x73, 0xf0, 0x7f, 0x0f, 0xb5, 0x02,
+            ],
+            rsig: [
+                0xf7, 0xfa, 0x26, 0xca, 0x22, 0xf3, 0x86, 0xc4, 0x3c, 0x19, 0x1a, 0x0b, 0x3e, 0xa6,
+                0x57, 0x7e, 0x8e, 0xea, 0xa3, 0xf3, 0x6b, 0x9b, 0xd1, 0xa3, 0xac, 0x3d, 0xf6, 0xf8,
+                0x83, 0xa3, 0xff, 0xdb, 0x31, 0x32, 0x0b, 0xde, 0x62, 0x7f, 0xf4, 0x6f, 0xc2, 0x26,
+                0x4a, 0x32, 0x63, 0xb9, 0xab, 0x67, 0x12, 0x3b, 0xa5, 0xe1, 0x08, 0x43, 0x20, 0xd9,
+                0x10, 0xb3, 0x94, 0xef, 0x8c, 0x65, 0xba, 0x09,
+            ],
+        },
+        TestVector {
+            sk: [
+                0x85, 0x83, 0x6f, 0x98, 0x32, 0xb2, 0x8d, 0xe7, 0xc6, 0x36, 0x13, 0xe2, 0xa6, 0xed,
+                0x36, 0xfb, 0x1a, 0xb4, 0x4f, 0xb0, 0xc1, 0x3f, 0xa8, 0x79, 0x8c, 0xd9, 0xcd, 0x30,
+                0x30, 0xd4, 0x55, 0x03,
+            ],
+            vk: [
+                0xbf, 0xd5, 0xbc, 0x00, 0xc7, 0xc0, 0x22, 0xaa, 0x89, 0x01, 0xae, 0x08, 0x3c, 0x12,
+                0xd5, 0x4b, 0x82, 0xf0, 0xdd, 0xff, 0x8e, 0xd6, 0xdb, 0x9a, 0x12, 0xd5, 0x9a, 0x5e,
+                0xf6, 0xa5, 0xa2, 0xe0,
+            ],
+            alpha: [
+                0xa2, 0xe8, 0xb9, 0xe1, 0x6d, 0x6f, 0xf3, 0xca, 0x6c, 0x53, 0xd4, 0xe8, 0x8a, 0xbb,
+                0xb9, 0x9b, 0xe7, 0xaf, 0x7e, 0x36, 0x59, 0x63, 0x1f, 0x1e, 0xae, 0x1e, 0xff, 0x23,
+                0x87, 0x4d, 0x8e, 0x0c,
+            ],
+            rsk: [
+                0x70, 0x3f, 0x32, 0xa3, 0x41, 0x13, 0xea, 0xe1, 0xb0, 0x79, 0x1f, 0xfe, 0x9d, 0x88,
+                0x88, 0xf0, 0x01, 0x29, 0x9a, 0xe5, 0x19, 0x68, 0x60, 0x91, 0x91, 0x48, 0x99, 0xef,
+                0xcc, 0x6c, 0x66, 0x01,
+            ],
+            rvk: [
+                0xeb, 0x92, 0x97, 0x03, 0x6c, 0xf5, 0x17, 0xe1, 0x5e, 0x9e, 0xfe, 0x39, 0x75, 0x32,
+                0x8d, 0xb4, 0x8e, 0xe7, 0xc2, 0x69, 0x4e, 0x94, 0x6d, 0xb2, 0x5f, 0x52, 0x87, 0x88,
+                0xf6, 0xa1, 0xdb, 0x14,
+            ],
+            m: [
+                0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09,
+                0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09, 0x09,
+                0x09, 0x09, 0x09, 0x09,
+            ],
+            sig: [
+                0x64, 0xab, 0xd1, 0x25, 0xbf, 0xc4, 0xc6, 0x54, 0xfa, 0xf2, 0xb6, 0xdd, 0x75, 0x3e,
+                0xc6, 0x90, 0x22, 0x4d, 0xbc, 0xab, 0x8c, 0xd6, 0x32, 0xdd, 0x59, 0x3c, 0x91, 0xce,
+                0x3a, 0xb0, 0xbc, 0xad, 0xca, 0x92, 0x76, 0x34, 0x02, 0x1c, 0x31, 0x47, 0x6c, 0x78,
+                0xc5, 0xac, 0x7c, 0xcc, 0xab, 0xbd, 0x6f, 0x92, 0x7d, 0xf2, 0x05, 0xea, 0xa7, 0x07,
+                0xcc, 0x00, 0xd4, 0x7d, 0x39, 0xf3, 0xe4, 0x0c,
+            ],
+            rsig: [
+                0xeb, 0x7a, 0x06, 0x5d, 0x75, 0xf8, 0x45, 0xdc, 0x09, 0x41, 0xb7, 0x09, 0xc0, 0xb1,
+                0x49, 0xea, 0xfd, 0x80, 0x5e, 0xa5, 0x8f, 0x38, 0x0b, 0x92, 0xb9, 0xd3, 0x10, 0x8a,
+                0x56, 0x1b, 0xda, 0x17, 0x85, 0xdf, 0x8f, 0x10, 0x1e, 0x0e, 0x14, 0x0f, 0xca, 0xee,
+                0x99, 0xb7, 0xdb, 0xb7, 0xdf, 0xbf, 0x7e, 0x61, 0xf3, 0xa1, 0x2f, 0x46, 0x09, 0x50,
+                0x69, 0xe0, 0x6e, 0x88, 0x96, 0xa9, 0xe4, 0x04,
+            ],
+        },
+    ];
+
+    for tv in test_vectors {
+        let sk = PrivateKey::read(&tv.sk[..]).unwrap();
+        let vk = PublicKey::read(&tv.vk[..]).unwrap();
+        let rvk = PublicKey::read(&tv.rvk[..]).unwrap();
+        let sig = Signature::read(&tv.sig[..]).unwrap();
+        let rsig = Signature::read(&tv.rsig[..]).unwrap();
+
+        let alpha = jubjub::Scalar::from_bytes(&tv.alpha).unwrap();
+
+        {
+            let mut vec = Vec::new();
+            sk.randomize(alpha).write(&mut vec).unwrap();
+            assert_eq!(&vec, &tv.rsk);
+        }
+        {
+            let mut vec = Vec::new();
+            vk.randomize(alpha, SPENDING_KEY_GENERATOR)
+                .write(&mut vec)
+                .unwrap();
+            assert_eq!(&vec, &tv.rvk);
+        }
+
+        assert!(vk.verify(&tv.m, &sig, SPENDING_KEY_GENERATOR));
+        assert!(rvk.verify(&tv.m, &rsig, SPENDING_KEY_GENERATOR));
+        assert!(!vk.verify(&tv.m, &rsig, SPENDING_KEY_GENERATOR));
+        assert!(!rvk.verify(&tv.m, &sig, SPENDING_KEY_GENERATOR));
+    }
+}
diff --git a/depend/zcash/src/rust/src/tests/zip339.rs b/depend/zcash/src/rust/src/tests/zip339.rs
new file mode 100644
index 000000000..8ee72ec00
--- /dev/null
+++ b/depend/zcash/src/rust/src/tests/zip339.rs
@@ -0,0 +1,120 @@
+use libc::c_char;
+use std::{
+    convert::{TryFrom, TryInto},
+    ffi::CStr,
+    ptr,
+};
+
+use crate::zip339_ffi::{
+    zip339_entropy_to_phrase, zip339_free_phrase, zip339_phrase_to_seed, zip339_validate_phrase,
+    Language,
+};
+use zcash_primitives::zip339;
+
+#[test]
+fn test_try_from_language() {
+    assert_eq!(Language(0).try_into(), Ok(zip339::Language::English));
+    assert!(zip339::Language::try_from(Language(1234)).is_err());
+}
+
+#[test]
+#[should_panic]
+fn test_null_entropy_to_phrase_panics() {
+    zip339_entropy_to_phrase(Language(0), ptr::null(), 0);
+}
+
+#[test]
+fn test_free_null_phrase_is_noop() {
+    zip339_free_phrase(ptr::null_mut());
+}
+
+#[test]
+#[should_panic]
+fn test_validate_null_phrase_panics() {
+    zip339_validate_phrase(Language(0), ptr::null());
+}
+
+#[test]
+#[should_panic]
+fn test_null_phrase_to_seed_panics() {
+    zip339_phrase_to_seed(Language(0), ptr::null(), ptr::NonNull::dangling().as_ptr());
+}
+
+#[test]
+#[should_panic]
+fn test_phrase_to_seed_with_null_buffer_panics() {
+    zip339_phrase_to_seed(
+        Language(0),
+        ptr::NonNull::dangling().as_ptr(),
+        ptr::null_mut(),
+    );
+}
+
+#[test]
+fn test_known_answers() {
+    let mut entropy = [0u8; 32];
+
+    // English and another language with non-Latin script.
+    let expected_phrase_en = "abandon abandon abandon abandon abandon abandon abandon abandon \
+        abandon abandon abandon abandon abandon abandon abandon abandon \
+        abandon abandon abandon abandon abandon abandon abandon art";
+    let expected_phrase_ko = "가격 가격 가격 가격 가격 가격 가격 가격 \
+        가격 가격 가격 가격 가격 가격 가격 가격 \
+        가격 가격 가격 가격 가격 가격 가격 계단";
+
+    let expected_seed_en = [
+        0x40, 0x8B, 0x28, 0x5C, 0x12, 0x38, 0x36, 0x00, 0x4F, 0x4B, 0x88, 0x42, 0xC8, 0x93, 0x24,
+        0xC1, 0xF0, 0x13, 0x82, 0x45, 0x0C, 0x0D, 0x43, 0x9A, 0xF3, 0x45, 0xBA, 0x7F, 0xC4, 0x9A,
+        0xCF, 0x70, 0x54, 0x89, 0xC6, 0xFC, 0x77, 0xDB, 0xD4, 0xE3, 0xDC, 0x1D, 0xD8, 0xCC, 0x6B,
+        0xC9, 0xF0, 0x43, 0xDB, 0x8A, 0xDA, 0x1E, 0x24, 0x3C, 0x4A, 0x0E, 0xAF, 0xB2, 0x90, 0xD3,
+        0x99, 0x48, 0x08, 0x40,
+    ];
+    let expected_seed_ko = [
+        0xD6, 0x93, 0x5F, 0x34, 0x3A, 0xC6, 0x66, 0x97, 0x58, 0x06, 0xDF, 0xA7, 0xBD, 0x0E, 0x45,
+        0xF8, 0x3A, 0x6F, 0x0A, 0x1A, 0x9F, 0x48, 0x54, 0xF4, 0x40, 0xEC, 0x09, 0x0B, 0xE3, 0xEF,
+        0x16, 0xEA, 0x09, 0x42, 0x03, 0xEC, 0x07, 0xA1, 0x7D, 0x8B, 0x43, 0x9B, 0xBD, 0x2F, 0x89,
+        0x3D, 0xB8, 0xB8, 0x3D, 0x3E, 0x43, 0xD4, 0x59, 0xA3, 0x6C, 0x29, 0xDF, 0xAB, 0xC2, 0xF9,
+        0xF5, 0xB2, 0x47, 0x72,
+    ];
+
+    for &(expected_phrase, expected_seed, language) in [
+        (expected_phrase_en, expected_seed_en, Language(0)),
+        (expected_phrase_ko, expected_seed_ko, Language(7)),
+    ]
+    .iter()
+    {
+        // Testing these all together simplifies memory management in the test code.
+
+        // test zip339_entropy_to_phrase
+        let phrase = zip339_entropy_to_phrase(language, entropy[..].as_mut_ptr(), 32);
+        assert_eq!(
+            unsafe { CStr::from_ptr(phrase) }.to_str().unwrap(),
+            expected_phrase
+        );
+
+        // test zip339_validate_phrase
+        assert!(zip339_validate_phrase(language, phrase));
+        assert!(!zip339_validate_phrase(Language(1), phrase));
+        assert!(!zip339_validate_phrase(Language(1234), phrase));
+
+        // test zip339_phrase_to_seed
+        let mut seed = [0u8; 64];
+        assert!(zip339_phrase_to_seed(
+            language,
+            phrase,
+            seed[..].as_mut_ptr()
+        ));
+        assert_eq!(seed, expected_seed);
+
+        // test that zip339_phrase_to_seed zeros buffer on failure
+        let mut seed = [0xFFu8; 64];
+        assert!(!zip339_phrase_to_seed(
+            Language(1),
+            phrase,
+            seed[..].as_mut_ptr()
+        ));
+        assert_eq!(seed, [0u8; 64]);
+
+        zip339_free_phrase(phrase as *mut c_char);
+    }
+}
diff --git a/depend/zcash/src/rust/src/tracing_ffi.rs b/depend/zcash/src/rust/src/tracing_ffi.rs
new file mode 100644
index 000000000..2201d8df8
--- /dev/null
+++ b/depend/zcash/src/rust/src/tracing_ffi.rs
@@ -0,0 +1,675 @@
+use libc::c_char;
+use std::ffi::CStr;
+use std::fs::File;
+use std::path::Path;
+use std::slice;
+use std::str;
+use std::sync::{
+    atomic::{AtomicUsize, Ordering},
+    Mutex,
+};
+
+use tracing::{
+    callsite::{Callsite, Identifier},
+    field::{FieldSet, Value},
+    level_enabled,
+    metadata::Kind,
+    span::Entered,
+    subscriber::{Interest, Subscriber},
+    Event, Metadata, Span,
+};
+use tracing_appender::non_blocking::WorkerGuard;
+use tracing_core::Once;
+use tracing_subscriber::{
+    filter::EnvFilter,
+    layer::{Layer, SubscriberExt},
+    reload::{self, Handle},
+    util::SubscriberInitExt,
+};
+
+#[cfg(not(target_os = "windows"))]
+use std::ffi::OsStr;
+#[cfg(not(target_os = "windows"))]
+use std::os::unix::ffi::OsStrExt;
+
+#[cfg(target_os = "windows")]
+use std::ffi::OsString;
+#[cfg(target_os = "windows")]
+use std::os::windows::ffi::OsStringExt;
+
+trait ReloadHandle {
+    fn reload(&self, new_filter: EnvFilter) -> Result<(), reload::Error>;
+}
+
+impl<L, S> ReloadHandle for Handle<L, S>
+where
+    L: From<EnvFilter> + Layer<S> + 'static,
+    S: Subscriber,
+{
+    fn reload(&self, new_filter: EnvFilter) -> Result<(), reload::Error> {
+        self.reload(new_filter)
+    }
+}
+
+pub struct TracingHandle {
+    _file_guard: Option<WorkerGuard>,
+    reload_handle: Box<dyn ReloadHandle>,
+}
+
+#[no_mangle]
+pub extern "C" fn tracing_init(
+    #[cfg(not(target_os = "windows"))] log_path: *const u8,
+    #[cfg(target_os = "windows")] log_path: *const u16,
+    log_path_len: usize,
+    initial_filter: *const c_char,
+    log_timestamps: bool,
+) -> *mut TracingHandle {
+    let initial_filter = unsafe { CStr::from_ptr(initial_filter) }
+        .to_str()
+        .expect("initial filter should be a valid string");
+
+    let log_path = if log_path.is_null() {
+        None
+    } else {
+        Some(unsafe { slice::from_raw_parts(log_path, log_path_len) })
+    };
+
+    #[cfg(not(target_os = "windows"))]
+    let log_path = log_path.map(OsStr::from_bytes);
+
+    #[cfg(target_os = "windows")]
+    let log_path = log_path.map(OsString::from_wide);
+
+    let log_path = log_path.as_ref().map(Path::new);
+
+    let (file_logger, file_no_timestamps, file_guard) = if let Some(log_path) = log_path {
+        let file_appender = tracing_appender::rolling::never(
+            log_path.parent().unwrap(),
+            log_path.file_name().unwrap(),
+        );
+        let (non_blocking, file_guard) = tracing_appender::non_blocking(file_appender);
+
+        if log_timestamps {
+            (
+                Some(
+                    tracing_subscriber::fmt::layer()
+                        .with_ansi(false)
+                        .with_writer(non_blocking),
+                ),
+                None,
+                Some(file_guard),
+            )
+        } else {
+            (
+                None,
+                Some(
+                    tracing_subscriber::fmt::layer()
+                        .with_ansi(false)
+                        .with_writer(non_blocking)
+                        .without_time(),
+                ),
+                Some(file_guard),
+            )
+        }
+    } else {
+        (None, None, None)
+    };
+
+    let (stdout_logger, stdout_no_timestamps) = if file_logger.is_none() {
+        if log_timestamps {
+            (Some(tracing_subscriber::fmt::layer().with_ansi(true)), None)
+        } else {
+            (
+                None,
+                Some(
+                    tracing_subscriber::fmt::layer()
+                        .with_ansi(true)
+                        .without_time(),
+                ),
+            )
+        }
+    } else {
+        (None, None)
+    };
+
+    let (filter, reload_handle) = reload::Layer::new(EnvFilter::from(initial_filter));
+
+    tracing_subscriber::registry()
+        .with(stdout_logger)
+        .with(stdout_no_timestamps)
+        .with(file_logger)
+        .with(file_no_timestamps)
+        .with(filter)
+        .init();
+
+    Box::into_raw(Box::new(TracingHandle {
+        _file_guard: file_guard,
+        reload_handle: Box::new(reload_handle),
+    }))
+}
+
+#[no_mangle]
+pub extern "C" fn tracing_init_test(
+    #[cfg(not(target_os = "windows"))] log_path: *const u8,
+    #[cfg(target_os = "windows")] log_path: *const u16,
+    log_path_len: usize,
+    initial_filter: *const c_char,
+) -> *mut TracingHandle {
+    let initial_filter = unsafe { CStr::from_ptr(initial_filter) }
+        .to_str()
+        .expect("initial filter should be a valid string");
+
+    let log_path = unsafe { slice::from_raw_parts(log_path, log_path_len) };
+
+    #[cfg(not(target_os = "windows"))]
+    let log_path = OsStr::from_bytes(log_path);
+
+    #[cfg(target_os = "windows")]
+    let log_path = OsString::from_wide(log_path);
+
+    let log_path = Path::new(&log_path);
+
+    let file = File::create(log_path).expect("can create log file for test");
+
+    let file_logger = tracing_subscriber::fmt::layer()
+        .with_writer(Mutex::new(file))
+        .without_time();
+
+    let (filter, reload_handle) = reload::Layer::new(EnvFilter::from(initial_filter));
+
+    tracing_subscriber::registry()
+        .with(file_logger)
+        .with(filter)
+        .init();
+
+    Box::into_raw(Box::new(TracingHandle {
+        _file_guard: None,
+        reload_handle: Box::new(reload_handle),
+    }))
+}
+
+#[no_mangle]
+pub extern "C" fn tracing_free(handle: *mut TracingHandle) {
+    drop(unsafe { Box::from_raw(handle) });
+}
+
+#[no_mangle]
+pub extern "C" fn tracing_reload(handle: *mut TracingHandle, new_filter: *const c_char) -> bool {
+    let handle = unsafe { &mut *handle };
+
+    match unsafe { CStr::from_ptr(new_filter) }
+        .to_str()
+        .map(EnvFilter::new)
+    {
+        Err(e) => {
+            tracing::error!("New filter is not valid UTF-8: {}", e);
+            false
+        }
+        Ok(new_filter) => {
+            if let Err(e) = handle.reload_handle.reload(new_filter) {
+                tracing::error!("Filter reload failed: {}", e);
+                false
+            } else {
+                true
+            }
+        }
+    }
+}
+
+pub struct FfiCallsite {
+    interest: AtomicUsize,
+    meta: Option<Metadata<'static>>,
+    registration: Once,
+    fields: Vec<&'static str>,
+}
+
+impl FfiCallsite {
+    fn new(fields: Vec<&'static str>) -> Self {
+        FfiCallsite {
+            interest: AtomicUsize::new(0),
+            meta: None,
+            registration: Once::new(),
+            fields,
+        }
+    }
+
+    #[inline(always)]
+    fn is_enabled(&self) -> bool {
+        let interest = self.interest();
+        if interest.is_always() {
+            return true;
+        }
+        if interest.is_never() {
+            return false;
+        }
+
+        tracing::dispatcher::get_default(|current| current.enabled(self.metadata()))
+    }
+
+    #[inline(always)]
+    pub fn register(&'static self) {
+        self.registration
+            .call_once(|| tracing::callsite::register(self));
+    }
+
+    #[inline(always)]
+    fn interest(&self) -> Interest {
+        match self.interest.load(Ordering::Relaxed) {
+            0 => Interest::never(),
+            2 => Interest::always(),
+            _ => Interest::sometimes(),
+        }
+    }
+}
+
+impl Callsite for FfiCallsite {
+    fn set_interest(&self, interest: Interest) {
+        let interest = match () {
+            _ if interest.is_never() => 0,
+            _ if interest.is_always() => 2,
+            _ => 1,
+        };
+        self.interest.store(interest, Ordering::SeqCst);
+    }
+
+    #[inline(always)]
+    fn metadata(&self) -> &Metadata<'static> {
+        self.meta.as_ref().unwrap()
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn tracing_callsite(
+    name: *const c_char,
+    target: *const c_char,
+    level: *const c_char,
+    file: *const c_char,
+    line: u32,
+    fields: *const *const c_char,
+    fields_len: usize,
+    is_span: bool,
+) -> *mut FfiCallsite {
+    let name = unsafe { CStr::from_ptr(name) }.to_str().unwrap();
+    let target = unsafe { CStr::from_ptr(target) }.to_str().unwrap();
+    let level = unsafe { CStr::from_ptr(level) }.to_str().unwrap();
+    let file = unsafe { CStr::from_ptr(file) }.to_str().unwrap();
+
+    let fields = unsafe { slice::from_raw_parts(fields, fields_len) };
+    let fields = fields
+        .iter()
+        .map(|&p| unsafe { CStr::from_ptr(p) })
+        .map(|cs| cs.to_str())
+        .collect::<Result<Vec<_>, _>>()
+        .unwrap();
+
+    let level = level.parse().unwrap();
+
+    // We immediately convert the new callsite into a pointer to erase lifetime
+    // information. The caller MUST ensure that the callsite is stored statically.
+    let site = Box::into_raw(Box::new(FfiCallsite::new(fields)));
+    let site_ref = unsafe { &*site };
+
+    let meta: Metadata<'static> = Metadata::new(
+        name,
+        target,
+        level,
+        Some(file),
+        Some(line),
+        None,
+        FieldSet::new(&site_ref.fields, Identifier(site_ref)),
+        if is_span { Kind::SPAN } else { Kind::EVENT },
+    );
+    unsafe { &mut *site }.meta = Some(meta);
+
+    site_ref.register();
+    site
+}
+
+macro_rules! repeat {
+    (0, $val:expr) => {
+        []
+    };
+    (1, $val:expr) => {
+        [$val]
+    };
+    (2, $val:expr) => {
+        [$val, $val]
+    };
+    (3, $val:expr) => {
+        [$val, $val, $val]
+    };
+    (4, $val:expr) => {
+        [$val, $val, $val, $val]
+    };
+    (5, $val:expr) => {
+        [$val, $val, $val, $val, $val]
+    };
+    (6, $val:expr) => {
+        [$val, $val, $val, $val, $val, $val]
+    };
+    (7, $val:expr) => {
+        [$val, $val, $val, $val, $val, $val, $val]
+    };
+    (8, $val:expr) => {
+        [$val, $val, $val, $val, $val, $val, $val, $val]
+    };
+    (9, $val:expr) => {
+        [$val, $val, $val, $val, $val, $val, $val, $val, $val]
+    };
+    (10, $val:expr) => {
+        [$val, $val, $val, $val, $val, $val, $val, $val, $val, $val]
+    };
+    (11, $val:expr) => {
+        [
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+        ]
+    };
+    (12, $val:expr) => {
+        [
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+        ]
+    };
+    (13, $val:expr) => {
+        [
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+        ]
+    };
+    (14, $val:expr) => {
+        [
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+        ]
+    };
+    (15, $val:expr) => {
+        [
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+            $val,
+        ]
+    };
+    (16, $val:expr) => {
+        [
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+            $val, $val,
+        ]
+    };
+    (17, $val:expr) => {
+        [
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+            $val, $val, $val,
+        ]
+    };
+    (18, $val:expr) => {
+        [
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+            $val, $val, $val, $val,
+        ]
+    };
+    (19, $val:expr) => {
+        [
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+            $val, $val, $val, $val, $val,
+        ]
+    };
+    (20, $val:expr) => {
+        [
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+            $val, $val, $val, $val, $val, $val,
+        ]
+    };
+    (21, $val:expr) => {
+        [
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+            $val, $val, $val, $val, $val, $val, $val,
+        ]
+    };
+    (22, $val:expr) => {
+        [
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+            $val, $val, $val, $val, $val, $val, $val, $val,
+        ]
+    };
+    (23, $val:expr) => {
+        [
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+            $val, $val, $val, $val, $val, $val, $val, $val, $val,
+        ]
+    };
+    (24, $val:expr) => {
+        [
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+        ]
+    };
+    (25, $val:expr) => {
+        [
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+        ]
+    };
+    (26, $val:expr) => {
+        [
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+        ]
+    };
+    (27, $val:expr) => {
+        [
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+        ]
+    };
+    (28, $val:expr) => {
+        [
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+        ]
+    };
+    (29, $val:expr) => {
+        [
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+            $val,
+        ]
+    };
+    (30, $val:expr) => {
+        [
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+            $val, $val,
+        ]
+    };
+    (31, $val:expr) => {
+        [
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+            $val, $val, $val,
+        ]
+    };
+    (32, $val:expr) => {
+        [
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+            $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val, $val,
+            $val, $val, $val, $val,
+        ]
+    };
+}
+
+#[no_mangle]
+pub extern "C" fn tracing_span_create(
+    callsite: *const FfiCallsite,
+    field_values: *const *const c_char,
+    fields_len: usize,
+) -> *mut Span {
+    let callsite = unsafe { &*callsite };
+    let field_values = unsafe { slice::from_raw_parts(field_values, fields_len) };
+
+    let meta = callsite.metadata();
+    assert!(meta.is_span());
+
+    let span = if level_enabled!(*meta.level()) && callsite.is_enabled() {
+        let mut fi = meta.fields().iter();
+        let mut vi = field_values
+            .iter()
+            .map(|&p| unsafe { CStr::from_ptr(p) })
+            .map(|cs| cs.to_string_lossy());
+
+        use tracing::field::display;
+        macro_rules! new_span {
+            ($n:tt) => {
+                Span::new(
+                    meta,
+                    &meta.fields().value_set(&repeat!(
+                        $n,
+                        (
+                            &fi.next().unwrap(),
+                            Some(&display(vi.next().unwrap().as_ref()) as &dyn Value)
+                        )
+                    )),
+                )
+            };
+        }
+
+        // https://github.com/tokio-rs/tracing/issues/782 might help improve things here.
+        match field_values.len() {
+            0 => new_span!(0),
+            1 => new_span!(1),
+            2 => new_span!(2),
+            3 => new_span!(3),
+            4 => new_span!(4),
+            5 => new_span!(5),
+            6 => new_span!(6),
+            7 => new_span!(7),
+            8 => new_span!(8),
+            9 => new_span!(9),
+            10 => new_span!(10),
+            11 => new_span!(11),
+            12 => new_span!(12),
+            13 => new_span!(13),
+            14 => new_span!(14),
+            15 => new_span!(15),
+            16 => new_span!(16),
+            17 => new_span!(17),
+            18 => new_span!(18),
+            19 => new_span!(19),
+            20 => new_span!(20),
+            21 => new_span!(21),
+            22 => new_span!(22),
+            23 => new_span!(23),
+            24 => new_span!(24),
+            25 => new_span!(25),
+            26 => new_span!(26),
+            27 => new_span!(27),
+            28 => new_span!(28),
+            29 => new_span!(29),
+            30 => new_span!(30),
+            31 => new_span!(31),
+            32 => new_span!(32),
+            _ => unimplemented!(),
+        }
+    } else {
+        Span::none()
+    };
+
+    Box::into_raw(Box::new(span))
+}
+
+#[no_mangle]
+pub extern "C" fn tracing_span_clone(span: *const Span) -> *mut Span {
+    unsafe { span.as_ref() }
+        .map(|span| Box::into_raw(Box::new(span.clone())))
+        .unwrap_or(std::ptr::null_mut())
+}
+
+#[no_mangle]
+pub extern "C" fn tracing_span_free(span: *mut Span) {
+    if !span.is_null() {
+        drop(unsafe { Box::from_raw(span) });
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn tracing_span_enter(span: *const Span) -> *mut Entered<'static> {
+    unsafe { span.as_ref() }
+        .map(|span| Box::into_raw(Box::new(span.enter())))
+        .unwrap_or(std::ptr::null_mut())
+}
+
+#[no_mangle]
+pub extern "C" fn tracing_span_exit(guard: *mut Entered) {
+    if !guard.is_null() {
+        drop(unsafe { Box::from_raw(guard) });
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn tracing_log(
+    callsite: *const FfiCallsite,
+    field_values: *const *const c_char,
+    fields_len: usize,
+) {
+    let callsite = unsafe { &*callsite };
+    let field_values = unsafe { slice::from_raw_parts(field_values, fields_len) };
+
+    let meta = callsite.metadata();
+    assert!(meta.is_event());
+
+    if level_enabled!(*meta.level()) && callsite.is_enabled() {
+        let mut fi = meta.fields().iter();
+        let mut vi = field_values
+            .iter()
+            .map(|&p| unsafe { CStr::from_ptr(p) })
+            .map(|cs| cs.to_string_lossy());
+
+        use tracing::field::display;
+        macro_rules! dispatch {
+            ($n:tt) => {
+                Event::dispatch(
+                    meta,
+                    &meta.fields().value_set(&repeat!(
+                        $n,
+                        (
+                            &fi.next().unwrap(),
+                            Some(&display(vi.next().unwrap().as_ref()) as &dyn Value)
+                        )
+                    )),
+                )
+            };
+        }
+
+        // https://github.com/tokio-rs/tracing/issues/782 might help improve things here.
+        match field_values.len() {
+            1 => dispatch!(1),
+            2 => dispatch!(2),
+            3 => dispatch!(3),
+            4 => dispatch!(4),
+            5 => dispatch!(5),
+            6 => dispatch!(6),
+            7 => dispatch!(7),
+            8 => dispatch!(8),
+            9 => dispatch!(9),
+            10 => dispatch!(10),
+            11 => dispatch!(11),
+            12 => dispatch!(12),
+            13 => dispatch!(13),
+            14 => dispatch!(14),
+            15 => dispatch!(15),
+            16 => dispatch!(16),
+            17 => dispatch!(17),
+            18 => dispatch!(18),
+            19 => dispatch!(19),
+            20 => dispatch!(20),
+            21 => dispatch!(21),
+            22 => dispatch!(22),
+            23 => dispatch!(23),
+            24 => dispatch!(24),
+            25 => dispatch!(25),
+            26 => dispatch!(26),
+            27 => dispatch!(27),
+            28 => dispatch!(28),
+            29 => dispatch!(29),
+            30 => dispatch!(30),
+            31 => dispatch!(31),
+            32 => dispatch!(32),
+            _ => unimplemented!(),
+        }
+    }
+}
diff --git a/depend/zcash/src/rust/src/transaction_ffi.rs b/depend/zcash/src/rust/src/transaction_ffi.rs
new file mode 100644
index 000000000..517567a73
--- /dev/null
+++ b/depend/zcash/src/rust/src/transaction_ffi.rs
@@ -0,0 +1,338 @@
+use std::convert::TryInto;
+use std::io::Cursor;
+use std::{ptr, slice};
+
+use blake2b_simd::Hash;
+use libc::{c_uchar, size_t};
+use tracing::error;
+use zcash_encoding::Vector;
+use zcash_primitives::{
+    consensus::BranchId,
+    legacy::Script,
+    transaction::{
+        components::{orchard as orchard_serialization, sapling, transparent, Amount},
+        sighash::{SignableInput, TransparentAuthorizingContext},
+        sighash_v5::v5_signature_hash,
+        txid::TxIdDigester,
+        Authorization, Transaction, TransactionData, TxDigests, TxVersion,
+    },
+};
+
+/// Calculates identifying and authorizing digests for the given transaction.
+///
+/// If either `txid_ret` or `auth_digest_ret` is `nullptr`, the corresponding digest will
+/// not be calculated.
+///
+/// Returns `false` if the transaction is invalid.
+#[no_mangle]
+pub extern "C" fn zcash_transaction_digests(
+    tx_bytes: *const c_uchar,
+    tx_bytes_len: size_t,
+    txid_ret: *mut [u8; 32],
+    auth_digest_ret: *mut [u8; 32],
+) -> bool {
+    let tx_bytes = unsafe { slice::from_raw_parts(tx_bytes, tx_bytes_len) };
+
+    // We use a placeholder branch ID here, since it is not used for anything.
+    let tx = match Transaction::read(tx_bytes, BranchId::Canopy) {
+        Ok(tx) => tx,
+        Err(e) => {
+            error!("Failed to parse transaction: {}", e);
+            return false;
+        }
+    };
+
+    if let Some(txid_ret) = unsafe { txid_ret.as_mut() } {
+        *txid_ret = *tx.txid().as_ref();
+    }
+    if let Some(auth_digest_ret) = unsafe { auth_digest_ret.as_mut() } {
+        match tx.version() {
+            // Pre-NU5 transaction formats don't have authorizing data commitments; when
+            // included in the authDataCommitment tree, they use the [0xff; 32] value.
+            TxVersion::Sprout(_) | TxVersion::Overwinter | TxVersion::Sapling => {
+                *auth_digest_ret = [0xff; 32]
+            }
+            _ => auth_digest_ret.copy_from_slice(tx.auth_commitment().as_bytes()),
+        }
+    }
+
+    true
+}
+
+#[derive(Clone, Debug)]
+pub(crate) struct TransparentAuth {
+    all_prev_outputs: Vec<transparent::TxOut>,
+}
+
+impl transparent::Authorization for TransparentAuth {
+    type ScriptSig = Script;
+}
+
+impl TransparentAuthorizingContext for TransparentAuth {
+    fn input_amounts(&self) -> Vec<Amount> {
+        self.all_prev_outputs
+            .iter()
+            .map(|prevout| prevout.value)
+            .collect()
+    }
+
+    fn input_scriptpubkeys(&self) -> Vec<Script> {
+        self.all_prev_outputs
+            .iter()
+            .map(|prevout| prevout.script_pubkey.clone())
+            .collect()
+    }
+}
+
+struct MapTransparent {
+    auth: TransparentAuth,
+}
+
+impl transparent::MapAuth<transparent::Authorized, TransparentAuth> for MapTransparent {
+    fn map_script_sig(
+        &self,
+        s: <transparent::Authorized as transparent::Authorization>::ScriptSig,
+    ) -> <TransparentAuth as transparent::Authorization>::ScriptSig {
+        s
+    }
+
+    fn map_authorization(&self, _: transparent::Authorized) -> TransparentAuth {
+        // TODO: This map should consume self, so we can move self.auth
+        self.auth.clone()
+    }
+}
+
+// TODO: Move these trait impls into `zcash_primitives` so they can be on `()`.
+struct IdentityMap;
+
+impl sapling::MapAuth<sapling::Authorized, sapling::Authorized> for IdentityMap {
+    fn map_proof(
+        &self,
+        p: <sapling::Authorized as sapling::Authorization>::Proof,
+    ) -> <sapling::Authorized as sapling::Authorization>::Proof {
+        p
+    }
+
+    fn map_auth_sig(
+        &self,
+        s: <sapling::Authorized as sapling::Authorization>::AuthSig,
+    ) -> <sapling::Authorized as sapling::Authorization>::AuthSig {
+        s
+    }
+
+    fn map_authorization(&self, a: sapling::Authorized) -> sapling::Authorized {
+        a
+    }
+}
+
+impl orchard_serialization::MapAuth<orchard::bundle::Authorized, orchard::bundle::Authorized>
+    for IdentityMap
+{
+    fn map_spend_auth(
+        &self,
+        s: <orchard::bundle::Authorized as orchard::bundle::Authorization>::SpendAuth,
+    ) -> <orchard::bundle::Authorized as orchard::bundle::Authorization>::SpendAuth {
+        s
+    }
+
+    fn map_authorization(&self, a: orchard::bundle::Authorized) -> orchard::bundle::Authorized {
+        a
+    }
+}
+
+pub(crate) struct PrecomputedAuth;
+
+impl Authorization for PrecomputedAuth {
+    type TransparentAuth = TransparentAuth;
+    type SaplingAuth = sapling::Authorized;
+    type OrchardAuth = orchard::bundle::Authorized;
+}
+
+pub struct PrecomputedTxParts {
+    pub(crate) tx: TransactionData<PrecomputedAuth>,
+    pub(crate) txid_parts: TxDigests<Hash>,
+}
+
+/// Precomputes the `TxDigest` struct for the given transaction.
+///
+/// Returns `nullptr` if the transaction is invalid, or a v1-v4 transaction format.
+#[no_mangle]
+pub extern "C" fn zcash_transaction_precomputed_init(
+    tx_bytes: *const c_uchar,
+    tx_bytes_len: size_t,
+    all_prev_outputs: *const c_uchar,
+    all_prev_outputs_len: size_t,
+) -> *mut PrecomputedTxParts {
+    let tx_bytes = unsafe { slice::from_raw_parts(tx_bytes, tx_bytes_len) };
+
+    // We use a placeholder branch ID here, since it is not used for anything.
+    //
+    // TODO: This is also parsing a transaction that may have partially-filled fields.
+    // This doesn't matter for transparent components (the only such field would be the
+    // scriptSig fields of transparent inputs, which would serialize as empty Scripts),
+    // but is ill-defined for shielded components (we'll be serializing 64 bytes of zeroes
+    // for each signature). This is an internal FFI so it's fine for now, but we should
+    // refactor the transaction builder (which is the only source of partially-created
+    // shielded components) to use a different FFI for obtaining the sighash, that passes
+    // across the transaction components and then constructs the TransactionData. This is
+    // already being done as part of the Orchard changes to the transaction builder, since
+    // the Orchard bundle will already be built on the Rust side, and we can avoid passing
+    // it back and forward across the FFI with this change. We should similarly refactor
+    // the Sapling code to do the same.
+    let tx = match Transaction::read(tx_bytes, BranchId::Canopy) {
+        Ok(tx) => tx,
+        Err(e) => {
+            error!("Failed to parse transaction: {}", e);
+            return ptr::null_mut();
+        }
+    };
+
+    match tx.version() {
+        TxVersion::Sprout(_) | TxVersion::Overwinter | TxVersion::Sapling => {
+            // We don't support these legacy transaction formats in this API.
+            ptr::null_mut()
+        }
+        _ => {
+            let all_prev_outputs =
+                unsafe { slice::from_raw_parts(all_prev_outputs, all_prev_outputs_len) };
+
+            let mut cursor = Cursor::new(all_prev_outputs);
+            let f_transparent = match Vector::read(&mut cursor, transparent::TxOut::read) {
+                Err(e) => {
+                    error!("Invalid all_prev_outputs field: {}", e);
+                    return ptr::null_mut();
+                }
+                Ok(_) if (cursor.position() as usize) != all_prev_outputs.len() => {
+                    error!("all_prev_outputs had trailing data");
+                    return ptr::null_mut();
+                }
+                Ok(all_prev_outputs)
+                    if tx.transparent_bundle().map_or(false, |t| {
+                        // Coinbase txs have one fake input.
+                        t.is_coinbase() && !all_prev_outputs.is_empty()
+                    }) =>
+                {
+                    error!(
+                        "all_prev_outputs should be empty for a coinbase tx but has length {}",
+                        all_prev_outputs.len()
+                    );
+                    return ptr::null_mut();
+                }
+                Ok(all_prev_outputs)
+                    if tx
+                        .transparent_bundle()
+                        .map(|t| {
+                            // For non-coinbase txs, every input is real.
+                            !t.is_coinbase() && t.vin.len() != all_prev_outputs.len()
+                        })
+                        // If we have no transparent part, we should have no prev outputs.
+                        .unwrap_or_else(|| !all_prev_outputs.is_empty()) =>
+                {
+                    error!(
+                        "all_prev_outputs is incorrect length {} (should be {})",
+                        all_prev_outputs.len(),
+                        tx.transparent_bundle().map(|t| t.vin.len()).unwrap_or(0),
+                    );
+                    return ptr::null_mut();
+                }
+                Ok(all_prev_outputs) => MapTransparent {
+                    auth: TransparentAuth { all_prev_outputs },
+                },
+            };
+
+            let tx = tx
+                .into_data()
+                .map_authorization(f_transparent, IdentityMap, IdentityMap);
+
+            let txid_parts = tx.digest(TxIdDigester);
+            Box::into_raw(Box::new(PrecomputedTxParts { tx, txid_parts }))
+        }
+    }
+}
+
+/// Frees a precomputed transaction from `zcash_transaction_precomputed_init`.
+#[no_mangle]
+pub extern "C" fn zcash_transaction_precomputed_free(precomputed_tx: *mut PrecomputedTxParts) {
+    if !precomputed_tx.is_null() {
+        drop(unsafe { Box::from_raw(precomputed_tx) });
+    }
+}
+
+/// This MUST match `NOT_AN_INPUT` in `src/script/interpreter.h`.
+const NOT_AN_INPUT: usize = 0xffffffff;
+
+/// Calculates a ZIP 244 signature digest for the given transaction.
+///
+/// `index` must be an index into the transaction's `vin`, or `NOT_AN_INPUT` for
+/// calculating the signature digest for shielded signatures.
+///
+/// `sighash_ret` must point to a 32-byte array.
+///
+/// Returns `false` if any of the parameters are invalid; in this case, `sighash_ret`
+/// will be unaltered.
+#[no_mangle]
+pub extern "C" fn zcash_transaction_zip244_signature_digest(
+    precomputed_tx: *const PrecomputedTxParts,
+    hash_type: u32,
+    index: size_t,
+    sighash_ret: *mut [u8; 32],
+) -> bool {
+    let precomputed_tx = if let Some(res) = unsafe { precomputed_tx.as_ref() } {
+        res
+    } else {
+        error!("Invalid precomputed transaction");
+        return false;
+    };
+    if matches!(
+        precomputed_tx.tx.version(),
+        TxVersion::Sprout(_) | TxVersion::Overwinter | TxVersion::Sapling,
+    ) {
+        error!("Cannot calculate ZIP 244 digest for pre-v5 transaction");
+        return false;
+    }
+
+    let signable_input = if index == NOT_AN_INPUT {
+        SignableInput::Shielded
+    } else {
+        let prevout = match precomputed_tx.tx.transparent_bundle() {
+            Some(bundle) => match bundle.authorization.all_prev_outputs.get(index) {
+                Some(prevout) => prevout,
+                None => {
+                    error!("nIn out of range");
+                    return false;
+                }
+            },
+            None => {
+                error!("Tried to create a transparent sighash for a tx without transparent data");
+                return false;
+            }
+        };
+
+        SignableInput::Transparent {
+            // This conversion to `u8` is always fine:
+            // - We only call this FFI method once we already know we are using ZIP 244.
+            // - Even if we weren't, `hash_type` is one byte tacked onto the end of a
+            //   signature, so it always fits into a `u8` (and TBH I don't know why we
+            //   ever set it to `u32`).
+            hash_type: hash_type.try_into().unwrap(),
+            index,
+            // `script_code` is unused by `v5_signature_hash`, so instead of passing the
+            // real `script_code` across the FFI (and paying the serialization and parsing
+            // cost for no benefit), we set it to the prevout's `script_pubkey`. This
+            // happens to be correct anyway for every output script kind except P2SH.
+            script_code: &prevout.script_pubkey,
+            script_pubkey: &prevout.script_pubkey,
+            value: prevout.value,
+        }
+    };
+
+    let sighash = v5_signature_hash(
+        &precomputed_tx.tx,
+        &signable_input,
+        &precomputed_tx.txid_parts,
+    );
+
+    // `v5_signature_hash` output is always 32 bytes.
+    *unsafe { &mut *sighash_ret } = sighash.as_ref().try_into().unwrap();
+    true
+}
diff --git a/depend/zcash/src/rust/src/unified_keys_ffi.rs b/depend/zcash/src/rust/src/unified_keys_ffi.rs
new file mode 100644
index 000000000..a676f956e
--- /dev/null
+++ b/depend/zcash/src/rust/src/unified_keys_ffi.rs
@@ -0,0 +1,217 @@
+use libc::c_char;
+use std::ffi::{CStr, CString};
+use tracing::error;
+
+use zcash_address::unified::{Container, Encoding, Fvk, Ufvk};
+use zcash_primitives::legacy::keys::AccountPubKey;
+
+use crate::address_ffi::network_from_cstr;
+
+#[no_mangle]
+pub extern "C" fn unified_full_viewing_key_free(key: *mut Ufvk) {
+    if !key.is_null() {
+        drop(unsafe { Box::from_raw(key) });
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn unified_full_viewing_key_clone(key: *const Ufvk) -> *mut Ufvk {
+    unsafe { key.as_ref() }
+        .map(|key| Box::into_raw(Box::new(key.clone())))
+        .unwrap_or(std::ptr::null_mut())
+}
+
+#[no_mangle]
+pub extern "C" fn unified_full_viewing_key_parse(
+    network: *const c_char,
+    encoded: *const c_char,
+) -> *mut Ufvk {
+    let network = match network_from_cstr(network) {
+        Some(n) => n,
+        None => {
+            return std::ptr::null_mut();
+        }
+    };
+
+    match unsafe { CStr::from_ptr(encoded) }.to_str() {
+        Ok(encoded) => match Ufvk::decode(encoded) {
+            Ok((parsed_network, fvk)) if parsed_network == network => {
+                // ZIP 316: Consumers MUST reject Unified Addresses/Viewing Keys in which
+                // any constituent Item does not meet the validation requirements of its
+                // encoding.
+                for item in fvk.items() {
+                    match item {
+                        Fvk::Orchard(data) => {
+                            if orchard::keys::FullViewingKey::from_bytes(&data).is_none() {
+                                error!("Unified FVK contains invalid Orchard FVK");
+                                return std::ptr::null_mut();
+                            }
+                        }
+                        Fvk::Sapling(data) => {
+                            // The last 32 bytes is the diversifier key, which is opaque.
+                            // The remaining 96 bytes should be a valid Sapling FVK.
+                            if zcash_primitives::sapling::keys::FullViewingKey::read(&data[..96])
+                                .is_err()
+                            {
+                                error!("Unified FVK contains invalid Sapling FVK");
+                                return std::ptr::null_mut();
+                            }
+                        }
+                        Fvk::P2pkh(data) => {
+                            // The first 32 bytes is the chaincode, which is opaque.
+                            // The remaining 33 bytes should be the compressed encoding of
+                            // a secp256k1 point.
+                            if let Err(e) = secp256k1::PublicKey::from_slice(&data[32..]) {
+                                error!("Unified FVK contains invalid transparent FVK: {}", e);
+                                return std::ptr::null_mut();
+                            }
+                        }
+                        // Can't check anything for unknown typecodes.
+                        Fvk::Unknown { .. } => (),
+                    }
+                }
+                Box::into_raw(Box::new(fvk))
+            }
+            Ok((parsed_network, _)) => {
+                error!(
+                    "Key was encoded for a different network ({:?}) than what was requested ({:?})",
+                    parsed_network, network,
+                );
+                std::ptr::null_mut()
+            }
+            Err(e) => {
+                error!("Failure decoding unified full viewing key: {}", e);
+                std::ptr::null_mut()
+            }
+        },
+        Err(e) => {
+            error!("Failure reading bytes of unified full viewing key: {}", e);
+            std::ptr::null_mut()
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn unified_full_viewing_key_serialize(
+    network: *const c_char,
+    key: *const Ufvk,
+) -> *mut c_char {
+    let key = unsafe { key.as_ref() }.expect("Unified full viewing key pointer may not be null.");
+    match network_from_cstr(network) {
+        Some(n) => CString::new(key.encode(&n)).unwrap().into_raw(),
+        None => std::ptr::null_mut(),
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn unified_full_viewing_key_read_transparent(
+    key: *const Ufvk,
+    out: *mut [u8; 65],
+) -> bool {
+    let key = unsafe { key.as_ref() }.expect("Unified full viewing key pointer may not be null.");
+    let out = unsafe { &mut *out };
+
+    for r in &key.items() {
+        if let Fvk::P2pkh(data) = r {
+            *out = *data;
+            return true;
+        }
+    }
+
+    false
+}
+
+#[no_mangle]
+pub extern "C" fn unified_full_viewing_key_read_sapling(
+    key: *const Ufvk,
+    out: *mut [u8; 128],
+) -> bool {
+    let key = unsafe { key.as_ref() }.expect("Unified full viewing key pointer may not be null.");
+    let out = unsafe { &mut *out };
+
+    for r in &key.items() {
+        if let Fvk::Sapling(data) = r {
+            *out = *data;
+            return true;
+        }
+    }
+
+    false
+}
+
+#[no_mangle]
+pub extern "C" fn unified_full_viewing_key_read_orchard(
+    key: *const Ufvk,
+    out: *mut [u8; 96],
+) -> bool {
+    let key = unsafe { key.as_ref() }.expect("Unified full viewing key pointer may not be null.");
+    let out = unsafe { &mut *out };
+
+    for r in &key.items() {
+        if let Fvk::Orchard(data) = r {
+            *out = *data;
+            return true;
+        }
+    }
+
+    false
+}
+
+#[no_mangle]
+pub extern "C" fn unified_full_viewing_key_from_components(
+    t_key: *const [u8; 65],
+    sapling_key: *const [u8; 128],
+    orchard_key: *const [u8; 96],
+) -> *mut Ufvk {
+    let t_key = unsafe { t_key.as_ref() };
+    let sapling_key = unsafe { sapling_key.as_ref() };
+    let orchard_key = unsafe { orchard_key.as_ref() };
+
+    let mut items = vec![];
+    if let Some(t_bytes) = t_key {
+        items.push(Fvk::P2pkh(*t_bytes));
+    }
+    if let Some(sapling_bytes) = sapling_key {
+        items.push(Fvk::Sapling(*sapling_bytes));
+    }
+    if let Some(orchard_bytes) = orchard_key {
+        items.push(Fvk::Orchard(*orchard_bytes));
+    }
+
+    match Ufvk::try_from_items(items) {
+        Ok(ufvk) => Box::into_raw(Box::new(ufvk)),
+        Err(e) => {
+            error!(
+                "An error occurred constructing the unified full viewing key: {:?}",
+                e
+            );
+            std::ptr::null_mut()
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn transparent_key_ovks(
+    t_key: *const [u8; 65],
+    internal_ovk_ret: *mut [u8; 32],
+    external_ovk_ret: *mut [u8; 32],
+) -> bool {
+    let key_bytes = unsafe { t_key.as_ref() }.expect("Transparent FVK pointer may not be null.");
+    let internal_ovk = unsafe { &mut *internal_ovk_ret };
+    let external_ovk = unsafe { &mut *external_ovk_ret };
+    match AccountPubKey::deserialize(key_bytes) {
+        Ok(epubkey) => {
+            let (internal, external) = epubkey.ovks_for_shielding();
+            *internal_ovk = internal.as_bytes();
+            *external_ovk = external.as_bytes();
+            true
+        }
+        Err(e) => {
+            error!(
+                "An error occurred parsing the transparent full viewing key: {:?}",
+                e
+            );
+            false
+        }
+    }
+}
diff --git a/depend/zcash/src/rust/src/wallet.rs b/depend/zcash/src/rust/src/wallet.rs
new file mode 100644
index 000000000..25d2d6fb5
--- /dev/null
+++ b/depend/zcash/src/rust/src/wallet.rs
@@ -0,0 +1,1400 @@
+use byteorder::{LittleEndian, ReadBytesExt, WriteBytesExt};
+use incrementalmerkletree::{bridgetree, bridgetree::BridgeTree, Position, Tree};
+use libc::c_uchar;
+use std::collections::{BTreeMap, BTreeSet};
+use std::convert::TryInto;
+use std::io;
+use std::ptr;
+use std::slice;
+use tracing::error;
+
+use zcash_encoding::{Optional, Vector};
+use zcash_primitives::{
+    consensus::BlockHeight,
+    merkle_tree::incremental::{read_position, write_position},
+    transaction::{components::Amount, TxId},
+};
+
+use orchard::{
+    bundle::Authorized,
+    keys::{FullViewingKey, IncomingViewingKey, OutgoingViewingKey, Scope, SpendingKey},
+    note::Nullifier,
+    tree::{MerkleHashOrchard, MerklePath},
+    Address, Bundle, Note,
+};
+
+use crate::{
+    builder_ffi::OrchardSpendInfo,
+    incremental_merkle_tree::{read_tree, write_tree},
+    incremental_merkle_tree_ffi::MERKLE_DEPTH,
+    streams_ffi::{CppStreamReader, CppStreamWriter, ReadCb, StreamObj, WriteCb},
+    zcashd_orchard::OrderedAddress,
+};
+
+pub const MAX_CHECKPOINTS: usize = 100;
+
+/// A data structure tracking the last transaction whose notes
+/// have been added to the wallet's note commitment tree.
+#[derive(Debug, Clone)]
+pub struct LastObserved {
+    block_height: BlockHeight,
+    block_tx_idx: Option<usize>,
+}
+
+/// A pointer to a particular action in an Orchard transaction output.
+#[derive(Copy, Clone, Debug, PartialEq, Eq, PartialOrd, Ord)]
+pub struct OutPoint {
+    txid: TxId,
+    action_idx: usize,
+}
+
+/// A pointer to a previous output being spent in an Orchard action.
+#[derive(Copy, Clone, Debug, PartialEq, Eq, PartialOrd, Ord)]
+pub struct InPoint {
+    txid: TxId,
+    action_idx: usize,
+}
+
+#[derive(Debug, Clone)]
+pub struct DecryptedNote {
+    note: Note,
+    memo: [u8; 512],
+}
+
+/// A data structure tracking the note data that was decrypted from a single transaction.
+#[derive(Debug, Clone)]
+pub struct TxNotes {
+    /// A map from the index of the Orchard action from which this note
+    /// was decrypted to the decrypted note value.
+    decrypted_notes: BTreeMap<usize, DecryptedNote>,
+}
+
+/// A data structure holding chain position information for a single transaction.
+#[derive(Clone, Debug)]
+struct NotePositions {
+    /// The height of the block containing the transaction.
+    tx_height: BlockHeight,
+    /// A map from the index of an Orchard action tracked by this wallet, to the position
+    /// of the output note's commitment within the global Merkle tree.
+    note_positions: BTreeMap<usize, Position>,
+}
+
+struct KeyStore {
+    payment_addresses: BTreeMap<OrderedAddress, IncomingViewingKey>,
+    viewing_keys: BTreeMap<IncomingViewingKey, FullViewingKey>,
+    spending_keys: BTreeMap<FullViewingKey, SpendingKey>,
+}
+
+impl KeyStore {
+    pub fn empty() -> Self {
+        KeyStore {
+            payment_addresses: BTreeMap::new(),
+            viewing_keys: BTreeMap::new(),
+            spending_keys: BTreeMap::new(),
+        }
+    }
+
+    pub fn add_full_viewing_key(&mut self, fvk: FullViewingKey) {
+        // When we add a full viewing key, we need to add both the internal and external
+        // incoming viewing keys.
+        let external_ivk = fvk.to_ivk(Scope::External);
+        let internal_ivk = fvk.to_ivk(Scope::Internal);
+        self.viewing_keys.insert(external_ivk, fvk.clone());
+        self.viewing_keys.insert(internal_ivk, fvk);
+    }
+
+    pub fn add_spending_key(&mut self, sk: SpendingKey) {
+        let fvk = FullViewingKey::from(&sk);
+        self.add_full_viewing_key(fvk.clone());
+        self.spending_keys.insert(fvk, sk);
+    }
+
+    /// Adds an address/ivk pair to the wallet, and returns `true` if the IVK
+    /// corresponds to a FVK known by this wallet, `false` otherwise.
+    pub fn add_raw_address(&mut self, addr: Address, ivk: IncomingViewingKey) -> bool {
+        let has_fvk = self.viewing_keys.contains_key(&ivk);
+        self.payment_addresses
+            .insert(OrderedAddress::new(addr), ivk);
+        has_fvk
+    }
+
+    pub fn spending_key_for_ivk(&self, ivk: &IncomingViewingKey) -> Option<&SpendingKey> {
+        self.viewing_keys
+            .get(ivk)
+            .and_then(|fvk| self.spending_keys.get(fvk))
+    }
+
+    pub fn ivk_for_address(&self, addr: &Address) -> Option<&IncomingViewingKey> {
+        self.payment_addresses.get(&OrderedAddress::new(*addr))
+    }
+
+    pub fn get_nullifier(&self, note: &Note) -> Option<Nullifier> {
+        self.ivk_for_address(&note.recipient())
+            .and_then(|ivk| self.viewing_keys.get(ivk))
+            .map(|fvk| note.nullifier(fvk))
+    }
+}
+
+pub struct Wallet {
+    /// The in-memory index of keys and addresses known to the wallet.
+    key_store: KeyStore,
+    /// The in-memory index from txid to notes from the associated transaction that have
+    /// been decrypted with the IVKs known to this wallet.
+    wallet_received_notes: BTreeMap<TxId, TxNotes>,
+    /// The in-memory index from txid to note positions from the associated transaction.
+    /// This map should always have a subset of the keys in `wallet_received_notes`.
+    wallet_note_positions: BTreeMap<TxId, NotePositions>,
+    /// The in-memory index from nullifier to the outpoint of the note from which that
+    /// nullifier was derived.
+    nullifiers: BTreeMap<Nullifier, OutPoint>,
+    /// The incremental Merkle tree used to track note commitments and witnesses for notes
+    /// belonging to the wallet.
+    witness_tree: BridgeTree<MerkleHashOrchard, MERKLE_DEPTH>,
+    /// The block height at which the last checkpoint was created, if any.
+    last_checkpoint: Option<BlockHeight>,
+    /// The block height and transaction index of the note most recently added to
+    /// `witness_tree`
+    last_observed: Option<LastObserved>,
+    /// Notes marked as mined as a consequence of their nullifiers having been observed
+    /// in bundle action inputs in bundles appended to the commitment tree.  The keys of
+    /// this map are the outpoints where the spent notes were created, and the values
+    /// are the inpoints identifying the actions in which they are spent.
+    mined_notes: BTreeMap<OutPoint, InPoint>,
+    /// For each nullifier which appears more than once in transactions that this
+    /// wallet has observed, the set of inpoints where those nullifiers were
+    /// observed as as having been spent.
+    potential_spends: BTreeMap<Nullifier, BTreeSet<InPoint>>,
+}
+
+#[derive(Debug, Clone)]
+pub enum WalletError {
+    OutOfOrder(LastObserved, BlockHeight, usize),
+    NoteCommitmentTreeFull,
+}
+
+#[derive(Debug, Clone)]
+pub enum RewindError {
+    /// The witness tree does not contain enough checkpoints to
+    /// rewind to the requested height. The number of blocks that
+    /// it is possible to rewind is returned as the payload of
+    /// this error.
+    InsufficientCheckpoints(usize),
+}
+
+#[derive(Debug, Clone)]
+pub enum BundleLoadError {
+    /// The action at the specified index failed to decrypt with
+    /// the provided IVK.
+    ActionDecryptionFailed(usize),
+    /// The wallet did not contain the full viewing key corresponding
+    /// to the incoming viewing key that successfully decrypted a
+    /// note.
+    FvkNotFound(IncomingViewingKey),
+    /// An action index identified as potentially spending one of our
+    /// notes is not a valid action index for the bundle.
+    InvalidActionIndex(usize),
+}
+
+#[derive(Debug, Clone)]
+pub enum SpendRetrievalError {
+    DecryptedNoteNotFound(OutPoint),
+    NoIvkForRecipient(Address),
+    FvkNotFound(IncomingViewingKey),
+    NoteNotPositioned(OutPoint),
+    InvalidMerkleRoot,
+    WitnessNotAvailableAtRoot(MerkleHashOrchard),
+}
+
+/// A struct used to return metadata about how a bundle was determined
+/// to be involved with the wallet.
+#[derive(Debug, Clone)]
+pub struct BundleWalletInvolvement {
+    receive_action_metadata: BTreeMap<usize, IncomingViewingKey>,
+    spend_action_metadata: Vec<usize>,
+}
+
+impl BundleWalletInvolvement {
+    pub fn new() -> Self {
+        BundleWalletInvolvement {
+            receive_action_metadata: BTreeMap::new(),
+            spend_action_metadata: Vec::new(),
+        }
+    }
+}
+
+impl Wallet {
+    pub fn empty() -> Self {
+        Wallet {
+            key_store: KeyStore::empty(),
+            wallet_received_notes: BTreeMap::new(),
+            wallet_note_positions: BTreeMap::new(),
+            nullifiers: BTreeMap::new(),
+            witness_tree: BridgeTree::new(MAX_CHECKPOINTS),
+            last_checkpoint: None,
+            last_observed: None,
+            mined_notes: BTreeMap::new(),
+            potential_spends: BTreeMap::new(),
+        }
+    }
+
+    /// Reset the state of the wallet to be suitable for rescan from the NU5 activation
+    /// height.  This removes all witness and spentness information from the wallet. The
+    /// keystore is unmodified and decrypted note, nullifier, and conflict data are left
+    /// in place with the expectation that they will be overwritten and/or updated in
+    /// the rescan process.
+    pub fn reset(&mut self) {
+        self.wallet_note_positions.clear();
+        self.witness_tree = BridgeTree::new(MAX_CHECKPOINTS);
+        self.last_checkpoint = None;
+        self.last_observed = None;
+        self.mined_notes = BTreeMap::new();
+    }
+
+    /// Checkpoints the note commitment tree. This returns `false` and leaves the note
+    /// commitment tree unmodified if the block height does not immediately succeed
+    /// the last checkpointed block height (unless the note commitment tree is empty,
+    /// in which case it unconditionally succeeds). This must be called exactly once
+    /// per block.
+    #[tracing::instrument(level = "trace", skip(self))]
+    pub fn checkpoint(&mut self, block_height: BlockHeight) -> bool {
+        // checkpoints must be in order of sequential block height and every
+        // block must be checkpointed
+        if let Some(last_height) = self.last_checkpoint {
+            let expected_height = last_height + 1;
+            if block_height != expected_height {
+                tracing::error!(
+                    "Expected checkpoint height {}, given {}",
+                    expected_height,
+                    block_height
+                );
+                return false;
+            }
+        }
+
+        self.witness_tree.checkpoint();
+        self.last_checkpoint = Some(block_height);
+        true
+    }
+
+    /// Returns the last checkpoint if any. If no checkpoint exists, the wallet has not
+    /// yet observed any blocks.
+    pub fn last_checkpoint(&self) -> Option<BlockHeight> {
+        self.last_checkpoint
+    }
+
+    /// Rewinds the note commitment tree to the given height, removes notes and spentness
+    /// information for transactions mined in the removed blocks, and returns the height to which
+    /// the tree has been rewound if successful. Returns  `RewindError` if not enough checkpoints
+    /// exist to execute the full rewind requested and the wallet has witness information that
+    /// would be invalidated by the rewind. If the requested height is greater than or equal to the
+    /// height of the latest checkpoint, this returns a successful result containing the height of
+    /// the last checkpoint.
+    ///
+    /// In the case that no checkpoints exist but the note commitment tree also records no witness
+    /// information, we allow the wallet to continue to rewind, under the assumption that the state
+    /// of the note commitment tree will be overwritten prior to the next append.
+    #[tracing::instrument(level = "trace", skip(self))]
+    pub fn rewind(&mut self, to_height: BlockHeight) -> Result<BlockHeight, RewindError> {
+        if let Some(checkpoint_height) = self.last_checkpoint {
+            if to_height >= checkpoint_height {
+                tracing::trace!("Last checkpoint is before the rewind height, nothing to do.");
+                return Ok(checkpoint_height);
+            }
+
+            tracing::trace!("Rewinding witness tree");
+            let blocks_to_rewind = <u32>::from(checkpoint_height) - <u32>::from(to_height);
+            let checkpoint_count = self.witness_tree.checkpoints().len();
+            for _ in 0..blocks_to_rewind {
+                // If the rewind fails, we have no more checkpoints. This is fine in the
+                // case that we have a recently-initialized tree, so long as we have no
+                // witnessed indices. In the case that we have any witnessed notes, we
+                // have hit the maximum rewind limit, and this is an error.
+                if !self.witness_tree.rewind() {
+                    assert!(self.witness_tree.checkpoints().is_empty());
+                    if !self.witness_tree.witnessed_indices().is_empty() {
+                        return Err(RewindError::InsufficientCheckpoints(checkpoint_count));
+                    }
+                }
+            }
+
+            // retain notes that correspond to transactions that are not "un-mined" after
+            // the rewind
+            let to_retain: BTreeSet<_> = self
+                .wallet_note_positions
+                .iter()
+                .filter_map(|(txid, n)| {
+                    if n.tx_height <= to_height {
+                        Some(*txid)
+                    } else {
+                        None
+                    }
+                })
+                .collect();
+            tracing::trace!("Retaining notes in transactions {:?}", to_retain);
+
+            self.mined_notes.retain(|_, v| to_retain.contains(&v.txid));
+
+            // nullifier and received note data are retained, because these values are stable
+            // once we've observed a note for the first time. The block height at which we
+            // observed the note is removed along with the note positions, because the
+            // transaction will no longer have been observed as having been mined.
+            self.wallet_note_positions
+                .retain(|txid, _| to_retain.contains(txid));
+
+            // reset our last observed height to ensure that notes added in the future are
+            // from a new block
+            self.last_observed = Some(LastObserved {
+                block_height: to_height,
+                block_tx_idx: None,
+            });
+
+            self.last_checkpoint = if checkpoint_count > blocks_to_rewind as usize {
+                Some(to_height)
+            } else {
+                // checkpoint_count <= blocks_to_rewind
+                None
+            };
+
+            Ok(to_height)
+        } else if self.witness_tree.witnessed_indices().is_empty() {
+            tracing::trace!("No witnessed notes in tree, allowing rewind without checkpoints");
+
+            // If we have no witnessed notes, it's okay to keep "rewinding" even though
+            // we have no checkpoints. We then allow last_observed to assume the height
+            // to which we have reset the tree state.
+            self.last_observed = Some(LastObserved {
+                block_height: to_height,
+                block_tx_idx: None,
+            });
+
+            Ok(to_height)
+        } else {
+            Err(RewindError::InsufficientCheckpoints(0))
+        }
+    }
+
+    /// Add note data for those notes that are decryptable with one of this wallet's
+    /// incoming viewing keys to the wallet, and return a a data structure that describes
+    /// the actions that are involved with this wallet, either spending notes belonging
+    /// to this wallet or creating new notes owned by this wallet.
+    #[tracing::instrument(level = "trace", skip(self))]
+    pub fn add_notes_from_bundle(
+        &mut self,
+        txid: &TxId,
+        bundle: &Bundle<Authorized, Amount>,
+    ) -> BundleWalletInvolvement {
+        let mut involvement = BundleWalletInvolvement::new();
+        // If we recognize any of our notes as being consumed as inputs to actions
+        // in this bundle, record them as potential spends.
+        involvement.spend_action_metadata = self.add_potential_spends(txid, bundle);
+
+        let keys = self
+            .key_store
+            .viewing_keys
+            .keys()
+            .cloned()
+            .collect::<Vec<_>>();
+
+        for (action_idx, ivk, note, recipient, memo) in bundle.decrypt_outputs_with_keys(&keys) {
+            assert!(self.add_decrypted_note(txid, action_idx, ivk.clone(), note, recipient, memo));
+            involvement.receive_action_metadata.insert(action_idx, ivk);
+        }
+
+        involvement
+    }
+
+    /// Restore note and potential spend data from a bundle using the provided
+    /// metadata.
+    ///
+    /// - `txid`: The ID for the transaction from which the provided bundle was
+    ///   extracted.
+    /// - `bundle`: the bundle to decrypt notes from
+    /// - `hints`: a map from action index to the incoming viewing key that decrypts
+    ///   that action. If the IVK does not decrypt the action, or if it is not
+    ///   associated with a FVK in this wallet, `load_bundle` will return an error.
+    /// - `potential_spend_idxs`: a list of action indices that were previously
+    ///   detected as spending our notes. If an index is out of range, `load_bundle`
+    ///   will return an error.
+    #[tracing::instrument(level = "trace", skip(self))]
+    pub fn load_bundle(
+        &mut self,
+        txid: &TxId,
+        bundle: &Bundle<Authorized, Amount>,
+        hints: BTreeMap<usize, &IncomingViewingKey>,
+        potential_spend_idxs: &[u32],
+    ) -> Result<(), BundleLoadError> {
+        for action_idx in potential_spend_idxs {
+            let action_idx: usize = (*action_idx).try_into().unwrap();
+            if action_idx < bundle.actions().len() {
+                self.add_potential_spend(
+                    bundle.actions()[action_idx].nullifier(),
+                    InPoint {
+                        txid: *txid,
+                        action_idx,
+                    },
+                );
+            } else {
+                return Err(BundleLoadError::InvalidActionIndex(action_idx));
+            }
+        }
+
+        for (action_idx, ivk) in hints.into_iter() {
+            if let Some((note, recipient, memo)) = bundle.decrypt_output_with_key(action_idx, ivk) {
+                if !self.add_decrypted_note(txid, action_idx, ivk.clone(), note, recipient, memo) {
+                    return Err(BundleLoadError::FvkNotFound(ivk.clone()));
+                }
+            } else {
+                return Err(BundleLoadError::ActionDecryptionFailed(action_idx));
+            }
+        }
+
+        Ok(())
+    }
+
+    // Common functionality for add_notes_from_bundle and load_bundle
+    #[allow(clippy::too_many_arguments)]
+    #[tracing::instrument(level = "trace", skip(self))]
+    fn add_decrypted_note(
+        &mut self,
+        txid: &TxId,
+        action_idx: usize,
+        ivk: IncomingViewingKey,
+        note: Note,
+        recipient: Address,
+        memo: [u8; 512],
+    ) -> bool {
+        // Generate the nullifier for the received note and add it to the nullifiers map so
+        // that we can detect when the note is later spent.
+        if let Some(fvk) = self.key_store.viewing_keys.get(&ivk) {
+            tracing::trace!("Adding decrypted note to the wallet");
+            let outpoint = OutPoint {
+                txid: *txid,
+                action_idx,
+            };
+
+            // Generate the nullifier for the received note and add it to the nullifiers map so
+            // that we can detect when the note is later spent.
+            let nf = note.nullifier(fvk);
+            self.nullifiers.insert(nf, outpoint);
+
+            // add the decrypted note data to the wallet
+            let note_data = DecryptedNote { note, memo };
+            self.wallet_received_notes
+                .entry(*txid)
+                .or_insert_with(|| TxNotes {
+                    decrypted_notes: BTreeMap::new(),
+                })
+                .decrypted_notes
+                .insert(action_idx, note_data);
+
+            // add the association between the address and the IVK used
+            // to decrypt the note
+            self.key_store.add_raw_address(recipient, ivk.clone());
+
+            true
+        } else {
+            tracing::trace!("Can't add decrypted note to the wallet, missing FVK");
+            false
+        }
+    }
+
+    /// For each Orchard action in the provided bundle, if the wallet
+    /// is tracking a note corresponding to the action's revealed nullifer,
+    /// mark that note as potentially spent.
+    #[tracing::instrument(level = "trace", skip(self))]
+    pub fn add_potential_spends(
+        &mut self,
+        txid: &TxId,
+        bundle: &Bundle<Authorized, Amount>,
+    ) -> Vec<usize> {
+        // Check for spends of our notes by matching against the nullifiers
+        // we're tracking, and when we detect one, associate the current
+        // txid and action as spending the note.
+        let mut spend_action_idxs = vec![];
+        for (action_idx, action) in bundle.actions().iter().enumerate() {
+            let nf = action.nullifier();
+            // If a nullifier corresponds to one of our notes, add its inpoint as a
+            // potential spend (the transaction may not end up being mined).
+            if self.nullifiers.contains_key(nf) {
+                self.add_potential_spend(
+                    nf,
+                    InPoint {
+                        txid: *txid,
+                        action_idx,
+                    },
+                );
+                spend_action_idxs.push(action_idx);
+            }
+        }
+        spend_action_idxs
+    }
+
+    fn add_potential_spend(&mut self, nf: &Nullifier, inpoint: InPoint) {
+        tracing::trace!(
+            "Adding potential spend of nullifier {:?} in {:?}",
+            nf,
+            inpoint
+        );
+        self.potential_spends
+            .entry(*nf)
+            .or_insert_with(BTreeSet::new)
+            .insert(inpoint);
+    }
+
+    /// Add note commitments for the Orchard components of a transaction to the note
+    /// commitment tree, and mark the tree at the notes decryptable by this wallet so that
+    /// in the future we can produce authentication paths to those notes.
+    ///
+    /// * `block_height` - Height of the block containing the transaction that provided
+    ///   this bundle.
+    /// * `block_tx_idx` - Index of the transaction within the block
+    /// * `txid` - Identifier of the transaction.
+    /// * `bundle` - Orchard component of the transaction.
+    #[tracing::instrument(level = "trace", skip(self))]
+    pub fn append_bundle_commitments(
+        &mut self,
+        block_height: BlockHeight,
+        block_tx_idx: usize,
+        txid: &TxId,
+        bundle: &Bundle<Authorized, Amount>,
+    ) -> Result<(), WalletError> {
+        // Check that the wallet is in the correct state to update the note commitment tree with
+        // new outputs.
+        if let Some(last) = &self.last_observed {
+            if !(
+                // we are observing a subsequent transaction in the same block
+                (block_height == last.block_height && last.block_tx_idx.map_or(false, |idx| idx < block_tx_idx))
+                // or we are observing a new block
+                || block_height > last.block_height
+            ) {
+                return Err(WalletError::OutOfOrder(
+                    last.clone(),
+                    block_height,
+                    block_tx_idx,
+                ));
+            }
+        }
+
+        self.last_observed = Some(LastObserved {
+            block_height,
+            block_tx_idx: Some(block_tx_idx),
+        });
+
+        // update the block height recorded for the transaction
+        let my_notes_for_tx = self.wallet_received_notes.get(txid);
+        if my_notes_for_tx.is_some() {
+            tracing::trace!("Tx is ours, marking as mined");
+            assert!(self
+                .wallet_note_positions
+                .insert(
+                    *txid,
+                    NotePositions {
+                        tx_height: block_height,
+                        note_positions: BTreeMap::default(),
+                    },
+                )
+                .is_none());
+        }
+
+        for (action_idx, action) in bundle.actions().iter().enumerate() {
+            // append the note commitment for each action to the witness tree
+            if !self
+                .witness_tree
+                .append(&MerkleHashOrchard::from_cmx(action.cmx()))
+            {
+                return Err(WalletError::NoteCommitmentTreeFull);
+            }
+
+            // for notes that are ours, witness the current state of the tree
+            if my_notes_for_tx
+                .as_ref()
+                .and_then(|n| n.decrypted_notes.get(&action_idx))
+                .is_some()
+            {
+                tracing::trace!("Witnessing Orchard note ({}, {})", txid, action_idx);
+                let pos = self.witness_tree.witness().expect("tree is not empty");
+                assert!(self
+                    .wallet_note_positions
+                    .get_mut(txid)
+                    .expect("We created this above")
+                    .note_positions
+                    .insert(action_idx, pos)
+                    .is_none());
+            }
+
+            // For nullifiers that are ours that we detect as spent by this action,
+            // we will record that input as being mined.
+            if let Some(outpoint) = self.nullifiers.get(action.nullifier()) {
+                assert!(self
+                    .mined_notes
+                    .insert(
+                        *outpoint,
+                        InPoint {
+                            txid: *txid,
+                            action_idx,
+                        },
+                    )
+                    .is_none());
+            }
+        }
+
+        Ok(())
+    }
+
+    /// Returns whether the transaction contains any notes either sent to or spent by this
+    /// wallet.
+    pub fn tx_involves_my_notes(&self, txid: &TxId) -> bool {
+        self.wallet_received_notes.contains_key(txid)
+            || self.nullifiers.values().any(|v| v.txid == *txid)
+    }
+
+    #[tracing::instrument(level = "trace", skip(self))]
+    pub fn get_filtered_notes(
+        &self,
+        ivk: Option<&IncomingViewingKey>,
+        ignore_mined: bool,
+        require_spending_key: bool,
+    ) -> Vec<(OutPoint, DecryptedNote)> {
+        tracing::trace!("Filtering notes");
+        self.wallet_received_notes
+            .iter()
+            .flat_map(|(txid, tx_notes)| {
+                tx_notes
+                    .decrypted_notes
+                    .iter()
+                    .filter_map(move |(idx, dnote)| {
+                        let outpoint = OutPoint {
+                            txid: *txid,
+                            action_idx: *idx,
+                        };
+
+                        self.key_store
+                            .ivk_for_address(&dnote.note.recipient())
+                            // if `ivk` is `None`, return all notes that match the other conditions
+                            .filter(|dnote_ivk| ivk.map_or(true, |ivk| &ivk == dnote_ivk))
+                            .and_then(|dnote_ivk| {
+                                if (ignore_mined && self.mined_notes.contains_key(&outpoint))
+                                    || (require_spending_key
+                                        && self.key_store.spending_key_for_ivk(dnote_ivk).is_none())
+                                {
+                                    None
+                                } else {
+                                    tracing::trace!("Selected note at {:?}", outpoint);
+                                    Some((outpoint, (*dnote).clone()))
+                                }
+                            })
+                    })
+            })
+            .collect()
+    }
+
+    /// Returns the root of the Orchard note commitment tree, as of the specified checkpoint
+    /// depth. A depth of 0 corresponds to the chain tip.
+    pub fn note_commitment_tree_root(&self, checkpoint_depth: usize) -> Option<MerkleHashOrchard> {
+        self.witness_tree.root(checkpoint_depth)
+    }
+
+    /// Fetches the information necessary to spend the note at the given `OutPoint`,
+    /// relative to the specified root of the Orchard note commitment tree.
+    ///
+    /// Returns `None` if the `OutPoint` is not known to the wallet, or the Orchard bundle
+    /// containing the note had not been passed to `Wallet::append_bundle_commitments` at
+    /// the specified checkpoint depth.
+    #[tracing::instrument(level = "trace", skip(self))]
+    pub fn get_spend_info(
+        &self,
+        outpoint: OutPoint,
+        as_of_root: MerkleHashOrchard,
+    ) -> Result<OrchardSpendInfo, SpendRetrievalError> {
+        // TODO: Take `confirmations` parameter and obtain the Merkle path to the root at
+        // that checkpoint, not the latest root.
+        tracing::trace!("Searching for {:?}", outpoint);
+        let dnote = self
+            .wallet_received_notes
+            .get(&outpoint.txid)
+            .and_then(|tx_notes| tx_notes.decrypted_notes.get(&outpoint.action_idx))
+            .ok_or(SpendRetrievalError::DecryptedNoteNotFound(outpoint))?;
+        tracing::trace!("Found decrypted note for outpoint: {:?}", dnote);
+
+        let fvk = self
+            .key_store
+            .ivk_for_address(&dnote.note.recipient())
+            .ok_or_else(|| SpendRetrievalError::NoIvkForRecipient(dnote.note.recipient()))
+            .and_then(|ivk| {
+                self.key_store
+                    .viewing_keys
+                    .get(ivk)
+                    .ok_or_else(|| SpendRetrievalError::FvkNotFound(ivk.clone()))
+            })?;
+        tracing::trace!("Found FVK for note");
+
+        let position = self
+            .wallet_note_positions
+            .get(&outpoint.txid)
+            .and_then(|tx_notes| tx_notes.note_positions.get(&outpoint.action_idx))
+            .ok_or(SpendRetrievalError::NoteNotPositioned(outpoint))?;
+        tracing::trace!("Found position for note: {:?}", position);
+
+        assert_eq!(
+            self.witness_tree
+                .get_witnessed_leaf(*position)
+                .expect("tree has witnessed the leaf for this note."),
+            &MerkleHashOrchard::from_cmx(&dnote.note.commitment().into()),
+        );
+
+        let path = self
+            .witness_tree
+            .authentication_path(*position, &as_of_root)
+            .ok_or(SpendRetrievalError::WitnessNotAvailableAtRoot(as_of_root))?;
+
+        Ok(OrchardSpendInfo::from_parts(
+            fvk.clone(),
+            dnote.note,
+            MerklePath::from_parts(
+                u64::from(*position).try_into().unwrap(),
+                path.try_into().unwrap(),
+            ),
+        ))
+    }
+}
+
+//
+// FFI
+//
+
+/// A type alias for a pointer to a C++ value that is the target of
+/// a mutating action by a callback across the FFI
+pub type FFICallbackReceiver = std::ptr::NonNull<libc::c_void>;
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_new() -> *mut Wallet {
+    let empty_wallet = Wallet::empty();
+    Box::into_raw(Box::new(empty_wallet))
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_free(wallet: *mut Wallet) {
+    if !wallet.is_null() {
+        drop(unsafe { Box::from_raw(wallet) });
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_reset(wallet: *mut Wallet) {
+    let wallet = unsafe { wallet.as_mut() }.expect("Wallet pointer may not be null");
+    wallet.reset();
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_checkpoint(wallet: *mut Wallet, block_height: u32) -> bool {
+    let wallet = unsafe { wallet.as_mut() }.expect("Wallet pointer may not be null");
+    wallet.checkpoint(block_height.into())
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_get_last_checkpoint(
+    wallet: *const Wallet,
+    block_height_ret: *mut u32,
+) -> bool {
+    let wallet = unsafe { wallet.as_ref() }.expect("Wallet pointer may not be null");
+    let block_height_ret =
+        unsafe { block_height_ret.as_mut() }.expect("Block height return pointer may not be null");
+    if let Some(height) = wallet.last_checkpoint() {
+        *block_height_ret = height.into();
+        true
+    } else {
+        false
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_rewind(
+    wallet: *mut Wallet,
+    to_height: BlockHeight,
+    result_height: *mut BlockHeight,
+) -> bool {
+    let wallet = unsafe { wallet.as_mut() }.expect("Wallet pointer may not be null");
+    let result_height =
+        unsafe { result_height.as_mut() }.expect("Return value pointer may not be null.");
+    match wallet.rewind(to_height) {
+        Ok(result) => {
+            *result_height = result;
+            true
+        }
+        Err(e) => {
+            error!(
+                "Unable to rewind the wallet to height {:?}: {:?}",
+                to_height, e
+            );
+            false
+        }
+    }
+}
+
+/// A type used to pass action decryption metadata across the FFI boundary.
+/// This must have the same representation as `struct RawOrchardActionIVK`
+/// in `rust/include/rust/orchard/wallet.h`. action_idx is
+#[repr(C)]
+pub struct FFIActionIvk {
+    action_idx: u64,
+    ivk_ptr: *mut IncomingViewingKey,
+}
+
+/// A C++-allocated function pointer that can pass a FFIActionIVK value
+/// to a C++ callback receiver.
+pub type ActionIvkPushCb =
+    unsafe extern "C" fn(obj: Option<FFICallbackReceiver>, value: FFIActionIvk);
+
+/// A C++-allocated function pointer that can pass a FFIActionIVK value
+/// to a C++ callback receiver.
+pub type SpendIndexPushCb = unsafe extern "C" fn(obj: Option<FFICallbackReceiver>, value: u32);
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_add_notes_from_bundle(
+    wallet: *mut Wallet,
+    txid: *const [c_uchar; 32],
+    bundle: *const Bundle<Authorized, Amount>,
+    cb_receiver: Option<FFICallbackReceiver>,
+    action_ivk_push_cb: Option<ActionIvkPushCb>,
+    spend_idx_push_cb: Option<SpendIndexPushCb>,
+) -> bool {
+    let wallet = unsafe { wallet.as_mut() }.expect("Wallet pointer may not be null");
+    let txid = TxId::from_bytes(*unsafe { txid.as_ref() }.expect("txid may not be null."));
+    if let Some(bundle) = unsafe { bundle.as_ref() } {
+        let added = wallet.add_notes_from_bundle(&txid, bundle);
+        let involved =
+            !(added.receive_action_metadata.is_empty() && added.spend_action_metadata.is_empty());
+        for (action_idx, ivk) in added.receive_action_metadata.into_iter() {
+            let action_ivk = FFIActionIvk {
+                action_idx: action_idx.try_into().unwrap(),
+                ivk_ptr: Box::into_raw(Box::new(ivk.clone())),
+            };
+            unsafe { (action_ivk_push_cb.unwrap())(cb_receiver, action_ivk) };
+        }
+        for action_idx in added.spend_action_metadata {
+            unsafe { (spend_idx_push_cb.unwrap())(cb_receiver, action_idx.try_into().unwrap()) };
+        }
+        involved
+    } else {
+        false
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_load_bundle(
+    wallet: *mut Wallet,
+    txid: *const [c_uchar; 32],
+    bundle: *const Bundle<Authorized, Amount>,
+    hints: *const FFIActionIvk,
+    hints_len: usize,
+    potential_spend_idxs: *const u32,
+    potential_spend_idxs_len: usize,
+) -> bool {
+    let wallet = unsafe { wallet.as_mut() }.expect("Wallet pointer may not be null");
+    let txid = TxId::from_bytes(*unsafe { txid.as_ref() }.expect("txid may not be null."));
+    let bundle = unsafe { bundle.as_ref() }.expect("bundle pointer may not be null.");
+
+    let hints_data = unsafe { slice::from_raw_parts(hints, hints_len) };
+    let potential_spend_idxs =
+        unsafe { slice::from_raw_parts(potential_spend_idxs, potential_spend_idxs_len) };
+
+    let mut hints = BTreeMap::new();
+    for action_ivk in hints_data {
+        hints.insert(
+            action_ivk.action_idx.try_into().unwrap(),
+            unsafe { action_ivk.ivk_ptr.as_ref() }.expect("ivk pointer may not be null"),
+        );
+    }
+
+    match wallet.load_bundle(&txid, bundle, hints, potential_spend_idxs) {
+        Ok(_) => true,
+        Err(e) => {
+            error!("Failed to restore decrypted notes to wallet: {:?}", e);
+            false
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_append_bundle_commitments(
+    wallet: *mut Wallet,
+    block_height: u32,
+    block_tx_idx: usize,
+    txid: *const [c_uchar; 32],
+    bundle: *const Bundle<Authorized, Amount>,
+) -> bool {
+    let wallet = unsafe { wallet.as_mut() }.expect("Wallet pointer may not be null");
+    let txid = TxId::from_bytes(*unsafe { txid.as_ref() }.expect("txid may not be null."));
+    if let Some(bundle) = unsafe { bundle.as_ref() } {
+        if let Err(e) =
+            wallet.append_bundle_commitments(block_height.into(), block_tx_idx, &txid, bundle)
+        {
+            error!("An error occurred adding the Orchard bundle's notes to the note commitment tree: {:?}", e);
+            return false;
+        }
+    }
+
+    true
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_commitment_tree_root(
+    wallet: *const Wallet,
+    root_ret: *mut [u8; 32],
+) {
+    let wallet = unsafe { wallet.as_ref() }.expect("Wallet pointer may not be null");
+    let root_ret = unsafe { root_ret.as_mut() }.expect("Cannot return to the null pointer.");
+
+    // there is always a valid note commitment tree root at depth 0
+    // (it may be the empty root)
+    *root_ret = wallet.note_commitment_tree_root(0).unwrap().to_bytes();
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_add_spending_key(wallet: *mut Wallet, sk: *const SpendingKey) {
+    let wallet = unsafe { wallet.as_mut() }.expect("Wallet pointer may not be null");
+    let sk = unsafe { sk.as_ref() }.expect("Spending key may not be null.");
+
+    wallet.key_store.add_spending_key(*sk);
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_add_full_viewing_key(
+    wallet: *mut Wallet,
+    fvk: *const FullViewingKey,
+) {
+    let wallet = unsafe { wallet.as_mut() }.expect("Wallet pointer may not be null.");
+    let fvk = unsafe { fvk.as_ref() }.expect("Full viewing key pointer may not be null.");
+
+    wallet.key_store.add_full_viewing_key(fvk.clone());
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_add_raw_address(
+    wallet: *mut Wallet,
+    addr: *const Address,
+    ivk: *const IncomingViewingKey,
+) -> bool {
+    let wallet = unsafe { wallet.as_mut() }.expect("Wallet pointer may not be null.");
+    let addr = unsafe { addr.as_ref() }.expect("Address may not be null.");
+    let ivk = unsafe { ivk.as_ref() }.expect("Incoming viewing key may not be null.");
+
+    wallet.key_store.add_raw_address(*addr, ivk.clone())
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_get_spending_key_for_address(
+    wallet: *const Wallet,
+    addr: *const Address,
+) -> *mut SpendingKey {
+    let wallet = unsafe { wallet.as_ref() }.expect("Wallet pointer may not be null.");
+    let addr = unsafe { addr.as_ref() }.expect("Address may not be null.");
+
+    wallet
+        .key_store
+        .ivk_for_address(addr)
+        .and_then(|ivk| wallet.key_store.spending_key_for_ivk(ivk))
+        .map(|sk| Box::into_raw(Box::new(*sk)))
+        .unwrap_or(std::ptr::null_mut())
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_get_ivk_for_address(
+    wallet: *const Wallet,
+    addr: *const Address,
+) -> *mut IncomingViewingKey {
+    let wallet = unsafe { wallet.as_ref() }.expect("Wallet pointer may not be null.");
+    let addr = unsafe { addr.as_ref() }.expect("Address may not be null.");
+
+    wallet
+        .key_store
+        .ivk_for_address(addr)
+        .map(|ivk| Box::into_raw(Box::new(ivk.clone())))
+        .unwrap_or(std::ptr::null_mut())
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_tx_involves_my_notes(
+    wallet: *const Wallet,
+    txid: *const [c_uchar; 32],
+) -> bool {
+    let wallet = unsafe { wallet.as_ref() }.expect("Wallet pointer may not be null.");
+    let txid = TxId::from_bytes(*unsafe { txid.as_ref() }.expect("txid may not be null."));
+
+    wallet.tx_involves_my_notes(&txid)
+}
+
+/// A type used to pass note metadata across the FFI boundary.
+/// This must have the same representation as `struct RawOrchardNoteMetadata`
+/// in `rust/include/rust/orchard/wallet.h`.
+#[repr(C)]
+pub struct FFINoteMetadata {
+    txid: [u8; 32],
+    action_idx: u32,
+    recipient: *mut Address,
+    note_value: i64,
+    memo: [u8; 512],
+}
+
+/// A C++-allocated function pointer that can push a FFINoteMetadata value
+/// onto a C++ vector.
+pub type NotePushCb = unsafe extern "C" fn(obj: Option<FFICallbackReceiver>, meta: FFINoteMetadata);
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_get_filtered_notes(
+    wallet: *const Wallet,
+    ivk: *const IncomingViewingKey,
+    ignore_mined: bool,
+    require_spending_key: bool,
+    result: Option<FFICallbackReceiver>,
+    push_cb: Option<NotePushCb>,
+) {
+    let wallet = unsafe { wallet.as_ref() }.expect("Wallet pointer may not be null.");
+    let ivk = unsafe { ivk.as_ref() };
+
+    for (outpoint, dnote) in wallet.get_filtered_notes(ivk, ignore_mined, require_spending_key) {
+        let metadata = FFINoteMetadata {
+            txid: *outpoint.txid.as_ref(),
+            action_idx: outpoint.action_idx as u32,
+            recipient: Box::into_raw(Box::new(dnote.note.recipient())),
+            note_value: dnote.note.value().inner() as i64,
+            memo: dnote.memo,
+        };
+        unsafe { (push_cb.unwrap())(result, metadata) };
+    }
+}
+
+/// A type used to pass decrypted spend information across the FFI boundary.
+/// This must have the same representation as `struct RawOrchardSpendData`
+/// in `rust/include/rust/orchard/wallet.h`.
+#[repr(C)]
+pub struct FFIActionSpend {
+    spend_action_idx: u32,
+    outpoint_txid: [u8; 32],
+    outpoint_action_idx: u32,
+    received_at: *mut Address,
+    value: i64,
+}
+
+/// A type used to pass decrypted output information across the FFI boundary.
+/// This must have the same representation as `struct RawOrchardOutputData`
+/// in `rust/include/rust/orchard/wallet.h`.
+#[repr(C)]
+pub struct FFIActionOutput {
+    action_idx: u32,
+    recipient: *mut Address,
+    value: i64,
+    memo: [u8; 512],
+    is_outgoing: bool,
+}
+
+/// A C++-allocated function pointer that can send a FFIActionSpend value
+/// to a receiver.
+pub type SpendPushCB = unsafe extern "C" fn(obj: Option<FFICallbackReceiver>, data: FFIActionSpend);
+
+/// A C++-allocated function pointer that can send a FFIActionOutput value
+/// to a receiver.
+pub type OutputPushCB =
+    unsafe extern "C" fn(obj: Option<FFICallbackReceiver>, data: FFIActionOutput);
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_get_txdata(
+    wallet: *const Wallet,
+    bundle: *const Bundle<Authorized, Amount>,
+    raw_ovks: *const [u8; 32],
+    raw_ovks_len: usize,
+    callback_receiver: Option<FFICallbackReceiver>,
+    spend_push_cb: Option<SpendPushCB>,
+    output_push_cb: Option<OutputPushCB>,
+) -> bool {
+    let wallet = unsafe { wallet.as_ref() }.expect("Wallet pointer may not be null.");
+    let raw_ovks = unsafe { slice::from_raw_parts(raw_ovks, raw_ovks_len) };
+    let ovks: Vec<OutgoingViewingKey> = raw_ovks
+        .iter()
+        .map(|k| OutgoingViewingKey::from(*k))
+        .collect();
+    if let Some(bundle) = unsafe { bundle.as_ref() } {
+        let ivks = wallet
+            .key_store
+            .viewing_keys
+            .keys()
+            .cloned()
+            .collect::<Vec<_>>();
+
+        let incoming: BTreeMap<usize, (Note, Address, [u8; 512])> = bundle
+            .decrypt_outputs_with_keys(&ivks)
+            .into_iter()
+            .map(|(idx, _, note, addr, memo)| (idx, (note, addr, memo)))
+            .collect();
+
+        let outgoing: BTreeMap<usize, (Note, Address, [u8; 512])> = bundle
+            .recover_outputs_with_ovks(&ovks)
+            .into_iter()
+            .map(|(idx, _, note, addr, memo)| (idx, (note, addr, memo)))
+            .collect();
+
+        for (idx, action) in bundle.actions().iter().enumerate() {
+            let nf = action.nullifier();
+            if let Some(spend) = wallet.nullifiers.get(nf).and_then(|outpoint| {
+                wallet
+                    .wallet_received_notes
+                    .get(&outpoint.txid)
+                    .and_then(|txnotes| txnotes.decrypted_notes.get(&outpoint.action_idx))
+                    .map(|dnote| FFIActionSpend {
+                        spend_action_idx: idx as u32,
+                        outpoint_txid: *outpoint.txid.as_ref(),
+                        outpoint_action_idx: outpoint.action_idx as u32,
+                        received_at: Box::into_raw(Box::new(dnote.note.recipient())),
+                        value: dnote.note.value().inner() as i64,
+                    })
+            }) {
+                unsafe { (spend_push_cb.unwrap())(callback_receiver, spend) };
+            }
+
+            if let Some(((note, addr, memo), is_outgoing)) = incoming
+                .get(&idx)
+                .map(|n| (n, false))
+                .or_else(|| outgoing.get(&idx).map(|n| (n, true)))
+            {
+                let output = FFIActionOutput {
+                    action_idx: idx as u32,
+                    recipient: Box::into_raw(Box::new(*addr)),
+                    value: note.value().inner() as i64,
+                    memo: *memo,
+                    is_outgoing,
+                };
+                unsafe { (output_push_cb.unwrap())(callback_receiver, output) };
+            }
+        }
+        true
+    } else {
+        false
+    }
+}
+
+pub type PushTxId = unsafe extern "C" fn(obj: Option<FFICallbackReceiver>, txid: *const [u8; 32]);
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_get_potential_spends(
+    wallet: *const Wallet,
+    txid: *const [c_uchar; 32],
+    action_idx: u32,
+    result: Option<FFICallbackReceiver>,
+    push_cb: Option<PushTxId>,
+) {
+    let wallet = unsafe { wallet.as_ref() }.expect("Wallet pointer may not be null.");
+    let txid = TxId::from_bytes(*unsafe { txid.as_ref() }.expect("txid may not be null."));
+
+    if let Some(inpoints) = wallet
+        .wallet_received_notes
+        .get(&txid)
+        .and_then(|txnotes| txnotes.decrypted_notes.get(&action_idx.try_into().unwrap()))
+        .and_then(|dnote| wallet.key_store.get_nullifier(&dnote.note))
+        .and_then(|nf| wallet.potential_spends.get(&nf))
+    {
+        for inpoint in inpoints {
+            unsafe { (push_cb.unwrap())(result, inpoint.txid.as_ref()) };
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_get_potential_spends_from_nullifier(
+    wallet: *const Wallet,
+    nullifier: *const [c_uchar; 32],
+    result: Option<FFICallbackReceiver>,
+    push_cb: Option<PushTxId>,
+) {
+    let wallet = unsafe { wallet.as_ref() }.expect("Wallet pointer may not be null.");
+    let nullifier =
+        Nullifier::from_bytes(unsafe { nullifier.as_ref() }.expect("nullifier may not be null."));
+
+    if let Some(inpoints) = wallet.potential_spends.get(&nullifier.unwrap()) {
+        for inpoint in inpoints {
+            unsafe { (push_cb.unwrap())(result, inpoint.txid.as_ref()) };
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_get_spend_info(
+    wallet: *const Wallet,
+    txid: *const [c_uchar; 32],
+    action_idx: usize,
+    as_of_root: *const [c_uchar; 32],
+) -> *mut OrchardSpendInfo {
+    let wallet = unsafe { wallet.as_ref() }.expect("Wallet pointer may not be null.");
+    let txid = TxId::from_bytes(*unsafe { txid.as_ref() }.expect("txid may not be null."));
+    let as_of_root = MerkleHashOrchard::from_bytes(
+        unsafe { as_of_root.as_ref() }.expect("note commitment tree root may not be null."),
+    );
+
+    let outpoint = OutPoint { txid, action_idx };
+
+    let as_of_root = if as_of_root.is_some().into() {
+        Ok(as_of_root.unwrap())
+    } else {
+        Err(SpendRetrievalError::InvalidMerkleRoot)
+    };
+
+    match as_of_root.and_then(|root| wallet.get_spend_info(outpoint, root)) {
+        Ok(ret) => Box::into_raw(Box::new(ret)),
+        Err(e) => {
+            tracing::error!(
+                "Error obtaining spend info for outpoint {:?}: {:?}",
+                outpoint,
+                e
+            );
+            ptr::null_mut()
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_gc_note_commitment_tree(wallet: *mut Wallet) {
+    let wallet = unsafe { wallet.as_mut() }.expect("Wallet pointer may not be null.");
+    wallet.witness_tree.garbage_collect();
+}
+
+const NOTE_STATE_V1: u8 = 1;
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_write_note_commitment_tree(
+    wallet: *const Wallet,
+    stream: Option<StreamObj>,
+    write_cb: Option<WriteCb>,
+) -> bool {
+    let wallet = unsafe { wallet.as_ref() }.expect("Wallet pointer may not be null.");
+    let mut writer = CppStreamWriter::from_raw_parts(stream, write_cb.unwrap());
+
+    let write_v1 = move |mut writer: CppStreamWriter| -> io::Result<()> {
+        Optional::write(&mut writer, wallet.last_checkpoint, |w, h| {
+            w.write_u32::<LittleEndian>(h.into())
+        })?;
+        write_tree(&mut writer, &wallet.witness_tree)?;
+
+        // Write note positions.
+        Vector::write_sized(
+            &mut writer,
+            wallet.wallet_note_positions.iter(),
+            |mut w, (txid, tx_notes)| {
+                txid.write(&mut w)?;
+                w.write_u32::<LittleEndian>(tx_notes.tx_height.into())?;
+                Vector::write_sized(
+                    w,
+                    tx_notes.note_positions.iter(),
+                    |w, (action_idx, position)| {
+                        w.write_u32::<LittleEndian>(*action_idx as u32)?;
+                        write_position(w, *position)
+                    },
+                )
+            },
+        )?;
+
+        Ok(())
+    };
+
+    match writer
+        .write_u8(NOTE_STATE_V1)
+        .and_then(|()| write_v1(writer))
+    {
+        Ok(()) => true,
+        Err(e) => {
+            error!("Failure in writing Orchard note commitment tree: {}", e);
+            false
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_load_note_commitment_tree(
+    wallet: *mut Wallet,
+    stream: Option<StreamObj>,
+    read_cb: Option<ReadCb>,
+) -> bool {
+    let wallet = unsafe { wallet.as_mut() }.expect("Wallet pointer may not be null.");
+    let mut reader = CppStreamReader::from_raw_parts(stream, read_cb.unwrap());
+
+    let mut read_v1 = move |mut reader: CppStreamReader| -> io::Result<()> {
+        let last_checkpoint = Optional::read(&mut reader, |r| {
+            r.read_u32::<LittleEndian>().map(BlockHeight::from)
+        })?;
+        let witness_tree = read_tree(&mut reader)?;
+
+        // Read note positions.
+        wallet.wallet_note_positions = Vector::read_collected(&mut reader, |mut r| {
+            Ok((
+                TxId::read(&mut r)?,
+                NotePositions {
+                    tx_height: r.read_u32::<LittleEndian>().map(BlockHeight::from)?,
+                    note_positions: Vector::read_collected(r, |r| {
+                        Ok((
+                            r.read_u32::<LittleEndian>().map(|idx| idx as usize)?,
+                            read_position(r)?,
+                        ))
+                    })?,
+                },
+            ))
+        })?;
+
+        wallet.last_checkpoint = last_checkpoint;
+        wallet.witness_tree = witness_tree;
+        Ok(())
+    };
+
+    match reader.read_u8() {
+        Err(e) => {
+            error!(
+                "Failed to read Orchard note position serialization flag: {}",
+                e
+            );
+            false
+        }
+        Ok(NOTE_STATE_V1) => match read_v1(reader) {
+            Ok(_) => true,
+            Err(e) => {
+                error!(
+                    "Failed to read Orchard note commitment or last checkpoint height: {}",
+                    e
+                );
+                false
+            }
+        },
+        Ok(flag) => {
+            error!(
+                "Unrecognized Orchard note position serialization version: {}",
+                flag
+            );
+            false
+        }
+    }
+}
+
+#[no_mangle]
+pub extern "C" fn orchard_wallet_init_from_frontier(
+    wallet: *mut Wallet,
+    frontier: *const bridgetree::Frontier<MerkleHashOrchard, MERKLE_DEPTH>,
+) -> bool {
+    let wallet = unsafe { wallet.as_mut() }.expect("Wallet pointer may not be null.");
+    let frontier = unsafe { frontier.as_ref() }.expect("Wallet pointer may not be null.");
+
+    if wallet.witness_tree.checkpoints().is_empty()
+        && wallet.witness_tree.witnessed_indices().is_empty()
+    {
+        wallet.witness_tree = frontier.value().map_or_else(
+            || BridgeTree::new(MAX_CHECKPOINTS),
+            |nonempty_frontier| {
+                BridgeTree::from_frontier(MAX_CHECKPOINTS, nonempty_frontier.clone())
+            },
+        );
+        true
+    } else {
+        // if we have any checkpoints in the tree, or if we have any witnessed notes,
+        // don't allow reinitialization
+        error!(
+            "Invalid attempt to reinitialize note commitment tree: {} checkpoints present.",
+            wallet.witness_tree.checkpoints().len()
+        );
+        false
+    }
+}
diff --git a/depend/zcash/src/rust/src/zcashd_orchard.rs b/depend/zcash/src/rust/src/zcashd_orchard.rs
new file mode 100644
index 000000000..09c091b8f
--- /dev/null
+++ b/depend/zcash/src/rust/src/zcashd_orchard.rs
@@ -0,0 +1,35 @@
+use orchard::Address;
+use std::cmp::Ordering;
+
+/// Internal newtype wrapper that allows us to use addresses as
+/// BTreeMap keys.
+#[derive(Clone, Copy, PartialEq, Eq)]
+#[repr(transparent)]
+pub(crate) struct OrderedAddress(Address);
+
+impl std::ops::Deref for OrderedAddress {
+    type Target = Address;
+
+    #[inline]
+    fn deref(&self) -> &Address {
+        &self.0
+    }
+}
+
+impl OrderedAddress {
+    pub(crate) fn new(addr: Address) -> Self {
+        OrderedAddress(addr)
+    }
+}
+
+impl PartialOrd for OrderedAddress {
+    fn partial_cmp(&self, other: &Self) -> Option<Ordering> {
+        Some(self.cmp(other))
+    }
+}
+
+impl Ord for OrderedAddress {
+    fn cmp(&self, other: &Self) -> Ordering {
+        (&self.to_raw_address_bytes()).cmp(&other.to_raw_address_bytes())
+    }
+}
diff --git a/depend/zcash/src/rust/src/zip339_ffi.rs b/depend/zcash/src/rust/src/zip339_ffi.rs
new file mode 100644
index 000000000..32005c2db
--- /dev/null
+++ b/depend/zcash/src/rust/src/zip339_ffi.rs
@@ -0,0 +1,114 @@
+use libc::{c_char, size_t};
+use std::{
+    convert::{TryFrom, TryInto},
+    ffi::{CStr, CString},
+    ptr, slice,
+};
+use zeroize::Zeroize;
+
+use zcash_primitives::zip339;
+
+// It's safer to use a wrapper type here than an enum. We can't stop a C caller from passing
+// an unrecognized value as a `language` parameter; if it were an enum on the Rust side,
+// then that would immediately be UB, whereas this way we can return null or false.
+#[repr(C)]
+#[derive(Copy, Clone)]
+pub struct Language(pub u32);
+
+impl TryFrom<Language> for zip339::Language {
+    type Error = ();
+
+    fn try_from(language: Language) -> Result<Self, ()> {
+        // These must match `src/rust/include/zip339.h`.
+        match language {
+            Language(0) => Ok(zip339::Language::English),
+            Language(1) => Ok(zip339::Language::SimplifiedChinese),
+            Language(2) => Ok(zip339::Language::TraditionalChinese),
+            Language(3) => Ok(zip339::Language::Czech),
+            Language(4) => Ok(zip339::Language::French),
+            Language(5) => Ok(zip339::Language::Italian),
+            Language(6) => Ok(zip339::Language::Japanese),
+            Language(7) => Ok(zip339::Language::Korean),
+            Language(8) => Ok(zip339::Language::Portuguese),
+            Language(9) => Ok(zip339::Language::Spanish),
+            Language(_) => Err(()),
+        }
+    }
+}
+
+/// Creates a phrase with the given entropy, in the given `Language`. The phrase is represented as
+/// a pointer to a null-terminated C string that must not be written to, and must be freed by
+/// `zip339_free_phrase`.
+#[no_mangle]
+pub extern "C" fn zip339_entropy_to_phrase(
+    language: Language,
+    entropy: *const u8,
+    entropy_len: size_t,
+) -> *const c_char {
+    assert!(!entropy.is_null());
+
+    if let Ok(language) = language.try_into() {
+        let entropy = unsafe { slice::from_raw_parts(entropy, entropy_len) }.to_vec();
+        if let Ok(mnemonic) = zip339::Mnemonic::from_entropy_in(language, entropy) {
+            if let Ok(phrase) = CString::new(mnemonic.phrase()) {
+                return phrase.into_raw() as *const c_char;
+            }
+        }
+    }
+    ptr::null()
+}
+
+/// Frees a phrase returned by `zip339_entropy_to_phrase`.
+#[no_mangle]
+pub extern "C" fn zip339_free_phrase(phrase: *const c_char) {
+    if !phrase.is_null() {
+        unsafe {
+            // It is correct to cast away const here; the memory is not actually immutable.
+            CString::from_raw(phrase as *mut c_char)
+                .into_bytes()
+                .zeroize();
+        }
+    }
+}
+
+/// Returns `true` if the given string is a valid mnemonic phrase in the given `Language`.
+#[no_mangle]
+pub extern "C" fn zip339_validate_phrase(language: Language, phrase: *const c_char) -> bool {
+    assert!(!phrase.is_null());
+
+    if let Ok(language) = language.try_into() {
+        if let Ok(phrase) = unsafe { CStr::from_ptr(phrase) }.to_str() {
+            return zip339::Mnemonic::validate_in(language, phrase).is_ok();
+        }
+    }
+    false
+}
+
+/// Copies the seed for the given phrase into the 64-byte buffer `buf`.
+/// Returns true if successful, false on error. In case of error, `buf` is zeroed.
+#[no_mangle]
+pub extern "C" fn zip339_phrase_to_seed(
+    language: Language,
+    phrase: *const c_char,
+    buf: *mut u8,
+) -> bool {
+    assert!(!phrase.is_null());
+    assert!(!buf.is_null());
+
+    if let Ok(language) = language.try_into() {
+        if let Ok(phrase) = unsafe { CStr::from_ptr(phrase) }.to_str() {
+            if let Ok(mnemonic) = zip339::Mnemonic::from_phrase_in(language, phrase) {
+                // Use the empty passphrase.
+                let seed = mnemonic.to_seed("");
+                unsafe {
+                    ptr::copy(seed.as_ptr(), buf, 64);
+                }
+                return true;
+            }
+        }
+    }
+    unsafe {
+        ptr::write_bytes(buf, 0, 64);
+    }
+    false
+}
diff --git a/depend/zcash/src/scheduler.cpp b/depend/zcash/src/scheduler.cpp
new file mode 100644
index 000000000..a4bc22dbb
--- /dev/null
+++ b/depend/zcash/src/scheduler.cpp
@@ -0,0 +1,122 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "scheduler.h"
+
+#include "reverselock.h"
+
+#include <assert.h>
+#include <utility>
+
+#include <boost/bind/bind.hpp>
+
+CScheduler::CScheduler() : nThreadsServicingQueue(0), stopRequested(false), stopWhenEmpty(false)
+{
+}
+
+CScheduler::~CScheduler()
+{
+    assert(nThreadsServicingQueue == 0);
+}
+
+
+void CScheduler::serviceQueue()
+{
+    boost::unique_lock<boost::mutex> lock(newTaskMutex);
+    ++nThreadsServicingQueue;
+
+    // newTaskMutex is locked throughout this loop EXCEPT
+    // when the thread is waiting or when the user's function
+    // is called.
+    while (!shouldStop()) {
+        try {
+            while (!shouldStop() && taskQueue.empty()) {
+                // Wait until there is something to do.
+                newTaskScheduled.wait(lock);
+            }
+
+            // Wait until either there is a new task, or until
+            // the time of the first item on the queue:
+
+            // Some boost versions have a conflicting overload of wait_until that returns void.
+            // Explicitly use a template here to avoid hitting that overload.
+            while (!shouldStop() && !taskQueue.empty())
+            {
+                auto copy = taskQueue.begin()->first;
+                if (newTaskScheduled.wait_until<>(lock, copy) == boost::cv_status::timeout) {
+                    break;
+                }
+            }
+
+            // If there are multiple threads, the queue can empty while we're waiting (another
+            // thread may service the task we were waiting on).
+            if (shouldStop() || taskQueue.empty())
+                continue;
+
+            Function f = taskQueue.begin()->second;
+            taskQueue.erase(taskQueue.begin());
+
+            {
+                // Unlock before calling f, so it can reschedule itself or another task
+                // without deadlocking:
+                reverse_lock<boost::unique_lock<boost::mutex> > rlock(lock);
+                f();
+            }
+        } catch (...) {
+            --nThreadsServicingQueue;
+            throw;
+        }
+    }
+    --nThreadsServicingQueue;
+    newTaskScheduled.notify_one();
+}
+
+void CScheduler::stop(bool drain)
+{
+    {
+        boost::unique_lock<boost::mutex> lock(newTaskMutex);
+        if (drain)
+            stopWhenEmpty = true;
+        else
+            stopRequested = true;
+    }
+    newTaskScheduled.notify_all();
+}
+
+void CScheduler::schedule(CScheduler::Function f, boost::chrono::system_clock::time_point t)
+{
+    {
+        boost::unique_lock<boost::mutex> lock(newTaskMutex);
+        taskQueue.insert(std::make_pair(t, f));
+    }
+    newTaskScheduled.notify_one();
+}
+
+void CScheduler::scheduleFromNow(CScheduler::Function f, int64_t deltaSeconds)
+{
+    schedule(f, boost::chrono::system_clock::now() + boost::chrono::seconds(deltaSeconds));
+}
+
+static void Repeat(CScheduler* s, CScheduler::Function f, int64_t deltaSeconds)
+{
+    f();
+    s->scheduleFromNow(boost::bind(&Repeat, s, f, deltaSeconds), deltaSeconds);
+}
+
+void CScheduler::scheduleEvery(CScheduler::Function f, int64_t deltaSeconds)
+{
+    scheduleFromNow(boost::bind(&Repeat, this, f, deltaSeconds), deltaSeconds);
+}
+
+size_t CScheduler::getQueueInfo(boost::chrono::system_clock::time_point &first,
+                             boost::chrono::system_clock::time_point &last) const
+{
+    boost::unique_lock<boost::mutex> lock(newTaskMutex);
+    size_t result = taskQueue.size();
+    if (!taskQueue.empty()) {
+        first = taskQueue.begin()->first;
+        last = taskQueue.rbegin()->first;
+    }
+    return result;
+}
diff --git a/depend/zcash/src/scheduler.h b/depend/zcash/src/scheduler.h
new file mode 100644
index 000000000..f55534e00
--- /dev/null
+++ b/depend/zcash/src/scheduler.h
@@ -0,0 +1,82 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_SCHEDULER_H
+#define BITCOIN_SCHEDULER_H
+
+//
+// NOTE:
+// boost::thread / boost::chrono should be ported to std::thread / std::chrono
+// when we support C++11.
+//
+#include <boost/chrono/chrono.hpp>
+#include <boost/thread.hpp>
+#include <map>
+
+//
+// Simple class for background tasks that should be run
+// periodically or once "after a while"
+//
+// Usage:
+//
+// CScheduler* s = new CScheduler();
+// s->scheduleFromNow(doSomething, 11); // Assuming a: void doSomething() { }
+// s->scheduleFromNow(boost::bind(Class::func, this, argument), 3);
+// boost::thread* t = new boost::thread(boost::bind(CScheduler::serviceQueue, s));
+//
+// ... then at program shutdown, clean up the thread running serviceQueue:
+// t->interrupt();
+// t->join();
+// delete t;
+// delete s; // Must be done after thread is interrupted/joined.
+//
+
+class CScheduler
+{
+public:
+    CScheduler();
+    ~CScheduler();
+
+    typedef std::function<void(void)> Function;
+
+    // Call func at/after time t
+    void schedule(Function f, boost::chrono::system_clock::time_point t);
+
+    // Convenience method: call f once deltaSeconds from now
+    void scheduleFromNow(Function f, int64_t deltaSeconds);
+
+    // Another convenience method: call f approximately
+    // every deltaSeconds forever, starting deltaSeconds from now.
+    // To be more precise: every time f is finished, it
+    // is rescheduled to run deltaSeconds later. If you
+    // need more accurate scheduling, don't use this method.
+    void scheduleEvery(Function f, int64_t deltaSeconds);
+
+    // To keep things as simple as possible, there is no unschedule.
+
+    // Services the queue 'forever'. Should be run in a thread,
+    // and interrupted using boost::interrupt_thread
+    void serviceQueue();
+
+    // Tell any threads running serviceQueue to stop as soon as they're
+    // done servicing whatever task they're currently servicing (drain=false)
+    // or when there is no work left to be done (drain=true)
+    void stop(bool drain=false);
+
+    // Returns number of tasks waiting to be serviced,
+    // and first and last task times
+    size_t getQueueInfo(boost::chrono::system_clock::time_point &first,
+                        boost::chrono::system_clock::time_point &last) const;
+
+private:
+    std::multimap<boost::chrono::system_clock::time_point, Function> taskQueue;
+    boost::condition_variable newTaskScheduled;
+    mutable boost::mutex newTaskMutex;
+    int nThreadsServicingQueue;
+    bool stopRequested;
+    bool stopWhenEmpty;
+    bool shouldStop() { return stopRequested || (stopWhenEmpty && taskQueue.empty()); }
+};
+
+#endif
diff --git a/depend/zcash/src/script/interpreter.cpp b/depend/zcash/src/script/interpreter.cpp
new file mode 100644
index 000000000..5af0688f3
--- /dev/null
+++ b/depend/zcash/src/script/interpreter.cpp
@@ -0,0 +1,1519 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "interpreter.h"
+
+#include "consensus/upgrades.h"
+#include "primitives/transaction.h"
+#include "crypto/ripemd160.h"
+#include "crypto/sha1.h"
+#include "crypto/sha256.h"
+#include "pubkey.h"
+#include "script/script.h"
+#include "uint256.h"
+
+#include <librustzcash.h>
+#include <rust/transaction.h>
+
+using namespace std;
+
+typedef vector<unsigned char> valtype;
+
+namespace {
+
+inline bool set_success(ScriptError* ret)
+{
+    if (ret)
+        *ret = SCRIPT_ERR_OK;
+    return true;
+}
+
+inline bool set_error(ScriptError* ret, const ScriptError serror)
+{
+    if (ret)
+        *ret = serror;
+    return false;
+}
+
+} // anon namespace
+
+bool CastToBool(const valtype& vch)
+{
+    for (unsigned int i = 0; i < vch.size(); i++)
+    {
+        if (vch[i] != 0)
+        {
+            // Can be negative zero
+            if (i == vch.size()-1 && vch[i] == 0x80)
+                return false;
+            return true;
+        }
+    }
+    return false;
+}
+
+/**
+ * Script is a stack machine (like Forth) that evaluates a predicate
+ * returning a bool indicating valid or not.  There are no loops.
+ */
+#define stacktop(i)  (stack.at(stack.size()+(i)))
+#define altstacktop(i)  (altstack.at(altstack.size()+(i)))
+static inline void popstack(vector<valtype>& stack)
+{
+    if (stack.empty())
+        throw runtime_error("popstack(): stack empty");
+    stack.pop_back();
+}
+
+bool static IsCompressedOrUncompressedPubKey(const valtype &vchPubKey) {
+    if (vchPubKey.size() < CPubKey::COMPRESSED_PUBLIC_KEY_SIZE) {
+        //  Non-canonical public key: too short
+        return false;
+    }
+    if (vchPubKey[0] == 0x04) {
+        if (vchPubKey.size() != CPubKey::PUBLIC_KEY_SIZE) {
+            //  Non-canonical public key: invalid length for uncompressed key
+            return false;
+        }
+    } else if (vchPubKey[0] == 0x02 || vchPubKey[0] == 0x03) {
+        if (vchPubKey.size() != CPubKey::COMPRESSED_PUBLIC_KEY_SIZE) {
+            //  Non-canonical public key: invalid length for compressed key
+            return false;
+        }
+    } else {
+          //  Non-canonical public key: neither compressed nor uncompressed
+          return false;
+    }
+    return true;
+}
+
+/**
+ * A canonical signature exists of: <30> <total len> <02> <len R> <R> <02> <len S> <S> <hashtype>
+ * Where R and S are not negative (their first byte has its highest bit not set), and not
+ * excessively padded (do not start with a 0 byte, unless an otherwise negative number follows,
+ * in which case a single 0 byte is necessary and even required).
+ *
+ * See https://bitcointalk.org/index.php?topic=8392.msg127623#msg127623
+ *
+ * This function is consensus-critical since BIP66.
+ */
+bool static IsValidSignatureEncoding(const std::vector<unsigned char> &sig) {
+    // Format: 0x30 [total-length] 0x02 [R-length] [R] 0x02 [S-length] [S] [sighash]
+    // * total-length: 1-byte length descriptor of everything that follows,
+    //   excluding the sighash byte.
+    // * R-length: 1-byte length descriptor of the R value that follows.
+    // * R: arbitrary-length big-endian encoded R value. It must use the shortest
+    //   possible encoding for a positive integer (which means no null bytes at
+    //   the start, except a single one when the next byte has its highest bit set).
+    // * S-length: 1-byte length descriptor of the S value that follows.
+    // * S: arbitrary-length big-endian encoded S value. The same rules apply.
+    // * sighash: 1-byte value indicating what data is hashed (not part of the DER
+    //   signature)
+
+    // Minimum and maximum size constraints.
+    if (sig.size() < 9) return false;
+    if (sig.size() > 73) return false;
+
+    // A signature is of type 0x30 (compound).
+    if (sig[0] != 0x30) return false;
+
+    // Make sure the length covers the entire signature.
+    if (sig[1] != sig.size() - 3) return false;
+
+    // Extract the length of the R element.
+    unsigned int lenR = sig[3];
+
+    // Make sure the length of the S element is still inside the signature.
+    if (5 + lenR >= sig.size()) return false;
+
+    // Extract the length of the S element.
+    unsigned int lenS = sig[5 + lenR];
+
+    // Verify that the length of the signature matches the sum of the length
+    // of the elements.
+    if ((size_t)(lenR + lenS + 7) != sig.size()) return false;
+
+    // Check whether the R element is an integer.
+    if (sig[2] != 0x02) return false;
+
+    // Zero-length integers are not allowed for R.
+    if (lenR == 0) return false;
+
+    // Negative numbers are not allowed for R.
+    if (sig[4] & 0x80) return false;
+
+    // Null bytes at the start of R are not allowed, unless R would
+    // otherwise be interpreted as a negative number.
+    if (lenR > 1 && (sig[4] == 0x00) && !(sig[5] & 0x80)) return false;
+
+    // Check whether the S element is an integer.
+    if (sig[lenR + 4] != 0x02) return false;
+
+    // Zero-length integers are not allowed for S.
+    if (lenS == 0) return false;
+
+    // Negative numbers are not allowed for S.
+    if (sig[lenR + 6] & 0x80) return false;
+
+    // Null bytes at the start of S are not allowed, unless S would otherwise be
+    // interpreted as a negative number.
+    if (lenS > 1 && (sig[lenR + 6] == 0x00) && !(sig[lenR + 7] & 0x80)) return false;
+
+    return true;
+}
+
+bool static IsLowDERSignature(const valtype &vchSig, ScriptError* serror) {
+    if (!IsValidSignatureEncoding(vchSig)) {
+        return set_error(serror, SCRIPT_ERR_SIG_DER);
+    }
+    // https://bitcoin.stackexchange.com/a/12556:
+    //     Also note that inside transaction signatures, an extra hashtype byte
+    //     follows the actual signature data.
+    std::vector<unsigned char> vchSigCopy(vchSig.begin(), vchSig.begin() + vchSig.size() - 1);
+    // If the S value is above the order of the curve divided by two, its
+    // complement modulo the order could have been used instead, which is
+    // one byte shorter when encoded correctly.
+    return CPubKey::CheckLowS(vchSigCopy);
+}
+
+bool static IsDefinedHashtypeSignature(const valtype &vchSig) {
+    if (vchSig.size() == 0) {
+        return false;
+    }
+    unsigned char nHashType = vchSig[vchSig.size() - 1] & (~(SIGHASH_ANYONECANPAY));
+    if (nHashType < SIGHASH_ALL || nHashType > SIGHASH_SINGLE)
+        return false;
+
+    return true;
+}
+
+bool CheckSignatureEncoding(const vector<unsigned char> &vchSig, unsigned int flags, ScriptError* serror) {
+    // Empty signature. Not strictly DER encoded, but allowed to provide a
+    // compact way to provide an invalid signature for use with CHECK(MULTI)SIG
+    if (vchSig.size() == 0) {
+        return true;
+    }
+    if (!IsValidSignatureEncoding(vchSig)) {
+        return set_error(serror, SCRIPT_ERR_SIG_DER);
+    } else if ((flags & SCRIPT_VERIFY_LOW_S) != 0 && !IsLowDERSignature(vchSig, serror)) {
+        // serror is set
+        return false;
+    } else if ((flags & SCRIPT_VERIFY_STRICTENC) != 0 && !IsDefinedHashtypeSignature(vchSig)) {
+        return set_error(serror, SCRIPT_ERR_SIG_HASHTYPE);
+    }
+    return true;
+}
+
+bool static CheckPubKeyEncoding(const valtype &vchSig, unsigned int flags, ScriptError* serror) {
+    if ((flags & SCRIPT_VERIFY_STRICTENC) != 0 && !IsCompressedOrUncompressedPubKey(vchSig)) {
+        return set_error(serror, SCRIPT_ERR_PUBKEYTYPE);
+    }
+    return true;
+}
+
+bool static CheckMinimalPush(const valtype& data, opcodetype opcode) {
+    if (data.size() == 0) {
+        // Could have used OP_0.
+        return opcode == OP_0;
+    } else if (data.size() == 1 && data[0] >= 1 && data[0] <= 16) {
+        // Could have used OP_1 .. OP_16.
+        return opcode == OP_1 + (data[0] - 1);
+    } else if (data.size() == 1 && data[0] == 0x81) {
+        // Could have used OP_1NEGATE.
+        return opcode == OP_1NEGATE;
+    } else if (data.size() <= 75) {
+        // Could have used a direct push (opcode indicating number of bytes pushed + those bytes).
+        return opcode == data.size();
+    } else if (data.size() <= 255) {
+        // Could have used OP_PUSHDATA.
+        return opcode == OP_PUSHDATA1;
+    } else if (data.size() <= 65535) {
+        // Could have used OP_PUSHDATA2.
+        return opcode == OP_PUSHDATA2;
+    }
+    return true;
+}
+
+bool EvalScript(
+    vector<vector<unsigned char> >& stack,
+    const CScript& script,
+    unsigned int flags,
+    const BaseSignatureChecker& checker,
+    uint32_t consensusBranchId,
+    ScriptError* serror)
+{
+    static const CScriptNum bnZero(0);
+    static const CScriptNum bnOne(1);
+    static const CScriptNum bnFalse(0);
+    static const CScriptNum bnTrue(1);
+    static const valtype vchFalse(0);
+    static const valtype vchZero(0);
+    static const valtype vchTrue(1, 1);
+
+    CScript::const_iterator pc = script.begin();
+    CScript::const_iterator pend = script.end();
+    opcodetype opcode;
+    valtype vchPushValue;
+    vector<bool> vfExec;
+    vector<valtype> altstack;
+    set_error(serror, SCRIPT_ERR_UNKNOWN_ERROR);
+    if (script.size() > MAX_SCRIPT_SIZE)
+        return set_error(serror, SCRIPT_ERR_SCRIPT_SIZE);
+    int nOpCount = 0;
+    bool fRequireMinimal = (flags & SCRIPT_VERIFY_MINIMALDATA) != 0;
+
+    try
+    {
+        while (pc < pend)
+        {
+            bool fExec = !count(vfExec.begin(), vfExec.end(), false);
+
+            //
+            // Read instruction
+            //
+            if (!script.GetOp(pc, opcode, vchPushValue))
+                return set_error(serror, SCRIPT_ERR_BAD_OPCODE);
+            if (vchPushValue.size() > MAX_SCRIPT_ELEMENT_SIZE)
+                return set_error(serror, SCRIPT_ERR_PUSH_SIZE);
+
+            // Note how OP_RESERVED does not count towards the opcode limit.
+            if (opcode > OP_16 && ++nOpCount > 201)
+                return set_error(serror, SCRIPT_ERR_OP_COUNT);
+
+            if (opcode == OP_CAT ||
+                opcode == OP_SUBSTR ||
+                opcode == OP_LEFT ||
+                opcode == OP_RIGHT ||
+                opcode == OP_INVERT ||
+                opcode == OP_AND ||
+                opcode == OP_OR ||
+                opcode == OP_XOR ||
+                opcode == OP_2MUL ||
+                opcode == OP_2DIV ||
+                opcode == OP_MUL ||
+                opcode == OP_DIV ||
+                opcode == OP_MOD ||
+                opcode == OP_LSHIFT ||
+                opcode == OP_RSHIFT ||
+                opcode == OP_CODESEPARATOR)
+                return set_error(serror, SCRIPT_ERR_DISABLED_OPCODE); // Disabled opcodes.
+
+            if (fExec && 0 <= opcode && opcode <= OP_PUSHDATA4) {
+                if (fRequireMinimal && !CheckMinimalPush(vchPushValue, opcode)) {
+                    return set_error(serror, SCRIPT_ERR_MINIMALDATA);
+                }
+                stack.push_back(vchPushValue);
+            } else if (fExec || (OP_IF <= opcode && opcode <= OP_ENDIF))
+            switch (opcode)
+            {
+                //
+                // Push value
+                //
+                case OP_1NEGATE:
+                case OP_1:
+                case OP_2:
+                case OP_3:
+                case OP_4:
+                case OP_5:
+                case OP_6:
+                case OP_7:
+                case OP_8:
+                case OP_9:
+                case OP_10:
+                case OP_11:
+                case OP_12:
+                case OP_13:
+                case OP_14:
+                case OP_15:
+                case OP_16:
+                {
+                    // ( -- value)
+                    CScriptNum bn((int)opcode - (int)(OP_1 - 1));
+                    stack.push_back(bn.getvch());
+                    // The result of these opcodes should always be the minimal way to push the data
+                    // they push, so no need for a CheckMinimalPush here.
+                }
+                break;
+
+
+                //
+                // Control
+                //
+                case OP_NOP:
+                    break;
+
+                case OP_CHECKLOCKTIMEVERIFY:
+                {
+                    if (!(flags & SCRIPT_VERIFY_CHECKLOCKTIMEVERIFY)) {
+                        // not enabled; treat as a NOP2
+                        if (flags & SCRIPT_VERIFY_DISCOURAGE_UPGRADABLE_NOPS) {
+                            return set_error(serror, SCRIPT_ERR_DISCOURAGE_UPGRADABLE_NOPS);
+                        }
+                        break;
+                    }
+
+                    if (stack.size() < 1)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+
+                    // Note that elsewhere numeric opcodes are limited to
+                    // operands in the range -2**31+1 to 2**31-1, however it is
+                    // legal for opcodes to produce results exceeding that
+                    // range. This limitation is implemented by CScriptNum's
+                    // default 4-byte limit.
+                    //
+                    // If we kept to that limit we'd have a year 2038 problem,
+                    // even though the nLockTime field in transactions
+                    // themselves is uint32 which only becomes meaningless
+                    // after the year 2106.
+                    //
+                    // Thus as a special case we tell CScriptNum to accept up
+                    // to 5-byte bignums, which are good until 2**39-1, well
+                    // beyond the 2**32-1 limit of the nLockTime field itself.
+                    const CScriptNum nLockTime(stacktop(-1), fRequireMinimal, 5);
+
+                    // In the rare event that the argument may be < 0 due to
+                    // some arithmetic being done first, you can always use
+                    // 0 MAX CHECKLOCKTIMEVERIFY.
+                    if (nLockTime < 0)
+                        return set_error(serror, SCRIPT_ERR_NEGATIVE_LOCKTIME);
+
+                    // Actually compare the specified lock time with the transaction.
+                    if (!checker.CheckLockTime(nLockTime))
+                        return set_error(serror, SCRIPT_ERR_UNSATISFIED_LOCKTIME);
+
+                    break;
+                }
+
+                case OP_NOP1: case OP_NOP3: case OP_NOP4: case OP_NOP5:
+                case OP_NOP6: case OP_NOP7: case OP_NOP8: case OP_NOP9: case OP_NOP10:
+                {
+                    if (flags & SCRIPT_VERIFY_DISCOURAGE_UPGRADABLE_NOPS)
+                        return set_error(serror, SCRIPT_ERR_DISCOURAGE_UPGRADABLE_NOPS);
+                }
+                break;
+
+                case OP_IF:
+                case OP_NOTIF:
+                {
+                    // <expression> if [statements] [else [statements]] endif
+                    bool fValue = false;
+                    if (fExec)
+                    {
+                        if (stack.size() < 1)
+                            return set_error(serror, SCRIPT_ERR_UNBALANCED_CONDITIONAL);
+                        valtype& vch = stacktop(-1);
+                        fValue = CastToBool(vch);
+                        if (opcode == OP_NOTIF)
+                            fValue = !fValue;
+                        popstack(stack);
+                    }
+                    vfExec.push_back(fValue);
+                }
+                break;
+
+                case OP_ELSE:
+                {
+                    if (vfExec.empty())
+                        return set_error(serror, SCRIPT_ERR_UNBALANCED_CONDITIONAL);
+                    vfExec.back() = !vfExec.back();
+                }
+                break;
+
+                case OP_ENDIF:
+                {
+                    if (vfExec.empty())
+                        return set_error(serror, SCRIPT_ERR_UNBALANCED_CONDITIONAL);
+                    vfExec.pop_back();
+                }
+                break;
+
+                case OP_VERIFY:
+                {
+                    // (true -- ) or
+                    // (false -- false) and return
+                    if (stack.size() < 1)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    bool fValue = CastToBool(stacktop(-1));
+                    if (fValue)
+                        popstack(stack);
+                    else
+                        return set_error(serror, SCRIPT_ERR_VERIFY);
+                }
+                break;
+
+                case OP_RETURN:
+                {
+                    return set_error(serror, SCRIPT_ERR_OP_RETURN);
+                }
+                break;
+
+
+                //
+                // Stack ops
+                //
+                case OP_TOALTSTACK:
+                {
+                    if (stack.size() < 1)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    altstack.push_back(stacktop(-1));
+                    popstack(stack);
+                }
+                break;
+
+                case OP_FROMALTSTACK:
+                {
+                    if (altstack.size() < 1)
+                        return set_error(serror, SCRIPT_ERR_INVALID_ALTSTACK_OPERATION);
+                    stack.push_back(altstacktop(-1));
+                    popstack(altstack);
+                }
+                break;
+
+                case OP_2DROP:
+                {
+                    // (x1 x2 -- )
+                    if (stack.size() < 2)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    popstack(stack);
+                    popstack(stack);
+                }
+                break;
+
+                case OP_2DUP:
+                {
+                    // (x1 x2 -- x1 x2 x1 x2)
+                    if (stack.size() < 2)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    valtype vch1 = stacktop(-2);
+                    valtype vch2 = stacktop(-1);
+                    stack.push_back(vch1);
+                    stack.push_back(vch2);
+                }
+                break;
+
+                case OP_3DUP:
+                {
+                    // (x1 x2 x3 -- x1 x2 x3 x1 x2 x3)
+                    if (stack.size() < 3)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    valtype vch1 = stacktop(-3);
+                    valtype vch2 = stacktop(-2);
+                    valtype vch3 = stacktop(-1);
+                    stack.push_back(vch1);
+                    stack.push_back(vch2);
+                    stack.push_back(vch3);
+                }
+                break;
+
+                case OP_2OVER:
+                {
+                    // (x1 x2 x3 x4 -- x1 x2 x3 x4 x1 x2)
+                    if (stack.size() < 4)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    valtype vch1 = stacktop(-4);
+                    valtype vch2 = stacktop(-3);
+                    stack.push_back(vch1);
+                    stack.push_back(vch2);
+                }
+                break;
+
+                case OP_2ROT:
+                {
+                    // (x1 x2 x3 x4 x5 x6 -- x3 x4 x5 x6 x1 x2)
+                    if (stack.size() < 6)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    valtype vch1 = stacktop(-6);
+                    valtype vch2 = stacktop(-5);
+                    stack.erase(stack.end()-6, stack.end()-4);
+                    stack.push_back(vch1);
+                    stack.push_back(vch2);
+                }
+                break;
+
+                case OP_2SWAP:
+                {
+                    // (x1 x2 x3 x4 -- x3 x4 x1 x2)
+                    if (stack.size() < 4)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    swap(stacktop(-4), stacktop(-2));
+                    swap(stacktop(-3), stacktop(-1));
+                }
+                break;
+
+                case OP_IFDUP:
+                {
+                    // (x - 0 | x x)
+                    if (stack.size() < 1)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    valtype vch = stacktop(-1);
+                    if (CastToBool(vch))
+                        stack.push_back(vch);
+                }
+                break;
+
+                case OP_DEPTH:
+                {
+                    // -- stacksize
+                    CScriptNum bn(stack.size());
+                    stack.push_back(bn.getvch());
+                }
+                break;
+
+                case OP_DROP:
+                {
+                    // (x -- )
+                    if (stack.size() < 1)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    popstack(stack);
+                }
+                break;
+
+                case OP_DUP:
+                {
+                    // (x -- x x)
+                    if (stack.size() < 1)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    valtype vch = stacktop(-1);
+                    stack.push_back(vch);
+                }
+                break;
+
+                case OP_NIP:
+                {
+                    // (x1 x2 -- x2)
+                    if (stack.size() < 2)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    stack.erase(stack.end() - 2);
+                }
+                break;
+
+                case OP_OVER:
+                {
+                    // (x1 x2 -- x1 x2 x1)
+                    if (stack.size() < 2)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    valtype vch = stacktop(-2);
+                    stack.push_back(vch);
+                }
+                break;
+
+                case OP_PICK:
+                case OP_ROLL:
+                {
+                    // (xn ... x2 x1 x0 n - xn ... x2 x1 x0 xn)
+                    // (xn ... x2 x1 x0 n - ... x2 x1 x0 xn)
+                    if (stack.size() < 2)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    int n = CScriptNum(stacktop(-1), fRequireMinimal).getint();
+                    popstack(stack);
+                    if (n < 0 || n >= (int)stack.size())
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    valtype vch = stacktop(-n-1);
+                    if (opcode == OP_ROLL)
+                        stack.erase(stack.end()-n-1);
+                    stack.push_back(vch);
+                }
+                break;
+
+                case OP_ROT:
+                {
+                    // (x1 x2 x3 -- x2 x3 x1)
+                    //  x2 x1 x3  after first swap
+                    //  x2 x3 x1  after second swap
+                    if (stack.size() < 3)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    swap(stacktop(-3), stacktop(-2));
+                    swap(stacktop(-2), stacktop(-1));
+                }
+                break;
+
+                case OP_SWAP:
+                {
+                    // (x1 x2 -- x2 x1)
+                    if (stack.size() < 2)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    swap(stacktop(-2), stacktop(-1));
+                }
+                break;
+
+                case OP_TUCK:
+                {
+                    // (x1 x2 -- x2 x1 x2)
+                    if (stack.size() < 2)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    valtype vch = stacktop(-1);
+                    stack.insert(stack.end()-2, vch);
+                }
+                break;
+
+
+                case OP_SIZE:
+                {
+                    // (in -- in size)
+                    if (stack.size() < 1)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    CScriptNum bn(stacktop(-1).size());
+                    stack.push_back(bn.getvch());
+                }
+                break;
+
+
+                //
+                // Bitwise logic
+                //
+                case OP_EQUAL:
+                case OP_EQUALVERIFY:
+                //case OP_NOTEQUAL: // use OP_NUMNOTEQUAL
+                {
+                    // (x1 x2 - bool)
+                    if (stack.size() < 2)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    valtype& vch1 = stacktop(-2);
+                    valtype& vch2 = stacktop(-1);
+                    bool fEqual = (vch1 == vch2);
+                    // OP_NOTEQUAL is disabled because it would be too easy to say
+                    // something like n != 1 and have some wiseguy pass in 1 with extra
+                    // zero bytes after it (numerically, 0x01 == 0x0001 == 0x000001)
+                    //if (opcode == OP_NOTEQUAL)
+                    //    fEqual = !fEqual;
+                    popstack(stack);
+                    popstack(stack);
+                    stack.push_back(fEqual ? vchTrue : vchFalse);
+                    if (opcode == OP_EQUALVERIFY)
+                    {
+                        if (fEqual)
+                            popstack(stack);
+                        else
+                            return set_error(serror, SCRIPT_ERR_EQUALVERIFY);
+                    }
+                }
+                break;
+
+
+                //
+                // Numeric
+                //
+                case OP_1ADD:
+                case OP_1SUB:
+                case OP_NEGATE:
+                case OP_ABS:
+                case OP_NOT:
+                case OP_0NOTEQUAL:
+                {
+                    // (in -- out)
+                    if (stack.size() < 1)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    CScriptNum bn(stacktop(-1), fRequireMinimal);
+                    switch (opcode)
+                    {
+                    case OP_1ADD:       bn += bnOne; break;
+                    case OP_1SUB:       bn -= bnOne; break;
+                    case OP_NEGATE:     bn = -bn; break;
+                    case OP_ABS:        if (bn < bnZero) bn = -bn; break;
+                    case OP_NOT:        bn = (bn == bnZero); break;
+                    case OP_0NOTEQUAL:  bn = (bn != bnZero); break;
+                    default:            assert(!"invalid opcode"); break;
+                    }
+                    popstack(stack);
+                    stack.push_back(bn.getvch());
+                }
+                break;
+
+                case OP_ADD:
+                case OP_SUB:
+                case OP_BOOLAND:
+                case OP_BOOLOR:
+                case OP_NUMEQUAL:
+                case OP_NUMEQUALVERIFY:
+                case OP_NUMNOTEQUAL:
+                case OP_LESSTHAN:
+                case OP_GREATERTHAN:
+                case OP_LESSTHANOREQUAL:
+                case OP_GREATERTHANOREQUAL:
+                case OP_MIN:
+                case OP_MAX:
+                {
+                    // (x1 x2 -- out)
+                    if (stack.size() < 2)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    CScriptNum bn1(stacktop(-2), fRequireMinimal);
+                    CScriptNum bn2(stacktop(-1), fRequireMinimal);
+                    CScriptNum bn(0);
+                    switch (opcode)
+                    {
+                    case OP_ADD:
+                        bn = bn1 + bn2;
+                        break;
+
+                    case OP_SUB:
+                        bn = bn1 - bn2;
+                        break;
+
+                    case OP_BOOLAND:             bn = (bn1 != bnZero && bn2 != bnZero); break;
+                    case OP_BOOLOR:              bn = (bn1 != bnZero || bn2 != bnZero); break;
+                    case OP_NUMEQUAL:            bn = (bn1 == bn2); break;
+                    case OP_NUMEQUALVERIFY:      bn = (bn1 == bn2); break;
+                    case OP_NUMNOTEQUAL:         bn = (bn1 != bn2); break;
+                    case OP_LESSTHAN:            bn = (bn1 < bn2); break;
+                    case OP_GREATERTHAN:         bn = (bn1 > bn2); break;
+                    case OP_LESSTHANOREQUAL:     bn = (bn1 <= bn2); break;
+                    case OP_GREATERTHANOREQUAL:  bn = (bn1 >= bn2); break;
+                    case OP_MIN:                 bn = (bn1 < bn2 ? bn1 : bn2); break;
+                    case OP_MAX:                 bn = (bn1 > bn2 ? bn1 : bn2); break;
+                    default:                     assert(!"invalid opcode"); break;
+                    }
+                    popstack(stack);
+                    popstack(stack);
+                    stack.push_back(bn.getvch());
+
+                    if (opcode == OP_NUMEQUALVERIFY)
+                    {
+                        if (CastToBool(stacktop(-1)))
+                            popstack(stack);
+                        else
+                            return set_error(serror, SCRIPT_ERR_NUMEQUALVERIFY);
+                    }
+                }
+                break;
+
+                case OP_WITHIN:
+                {
+                    // (x min max -- out)
+                    if (stack.size() < 3)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    CScriptNum bn1(stacktop(-3), fRequireMinimal);
+                    CScriptNum bn2(stacktop(-2), fRequireMinimal);
+                    CScriptNum bn3(stacktop(-1), fRequireMinimal);
+                    bool fValue = (bn2 <= bn1 && bn1 < bn3);
+                    popstack(stack);
+                    popstack(stack);
+                    popstack(stack);
+                    stack.push_back(fValue ? vchTrue : vchFalse);
+                }
+                break;
+
+
+                //
+                // Crypto
+                //
+                case OP_RIPEMD160:
+                case OP_SHA1:
+                case OP_SHA256:
+                case OP_HASH160:
+                case OP_HASH256:
+                {
+                    // (in -- hash)
+                    if (stack.size() < 1)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    valtype& vch = stacktop(-1);
+                    valtype vchHash((opcode == OP_RIPEMD160 || opcode == OP_SHA1 || opcode == OP_HASH160) ? 20 : 32);
+                    if (opcode == OP_RIPEMD160)
+                        CRIPEMD160().Write(begin_ptr(vch), vch.size()).Finalize(begin_ptr(vchHash));
+                    else if (opcode == OP_SHA1)
+                        CSHA1().Write(begin_ptr(vch), vch.size()).Finalize(begin_ptr(vchHash));
+                    else if (opcode == OP_SHA256)
+                        CSHA256().Write(begin_ptr(vch), vch.size()).Finalize(begin_ptr(vchHash));
+                    else if (opcode == OP_HASH160)
+                        CHash160().Write(begin_ptr(vch), vch.size()).Finalize(begin_ptr(vchHash));
+                    else if (opcode == OP_HASH256)
+                        CHash256().Write(begin_ptr(vch), vch.size()).Finalize(begin_ptr(vchHash));
+                    popstack(stack);
+                    stack.push_back(vchHash);
+                }
+                break;
+
+                case OP_CHECKSIG:
+                case OP_CHECKSIGVERIFY:
+                {
+                    // (sig pubkey -- bool)
+                    if (stack.size() < 2)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+
+                    valtype& vchSig    = stacktop(-2);
+                    valtype& vchPubKey = stacktop(-1);
+
+                    if (!CheckSignatureEncoding(vchSig, flags, serror) || !CheckPubKeyEncoding(vchPubKey, flags, serror)) {
+                        //serror is set
+                        return false;
+                    }
+                    bool fSuccess = checker.CheckSig(vchSig, vchPubKey, script, consensusBranchId);
+
+                    popstack(stack);
+                    popstack(stack);
+                    stack.push_back(fSuccess ? vchTrue : vchFalse);
+                    if (opcode == OP_CHECKSIGVERIFY)
+                    {
+                        if (fSuccess)
+                            popstack(stack);
+                        else
+                            return set_error(serror, SCRIPT_ERR_CHECKSIGVERIFY);
+                    }
+                }
+                break;
+
+                case OP_CHECKMULTISIG:
+                case OP_CHECKMULTISIGVERIFY:
+                {
+                    // ([sig ...] num_of_signatures [pubkey ...] num_of_pubkeys -- bool)
+
+                    int i = 1;
+                    if ((int)stack.size() < i)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+
+                    int nKeysCount = CScriptNum(stacktop(-i), fRequireMinimal).getint();
+                    if (nKeysCount < 0 || nKeysCount > 20)
+                        return set_error(serror, SCRIPT_ERR_PUBKEY_COUNT);
+                    nOpCount += nKeysCount;
+                    if (nOpCount > 201)
+                        return set_error(serror, SCRIPT_ERR_OP_COUNT);
+                    int ikey = ++i;
+                    i += nKeysCount;
+                    if ((int)stack.size() < i)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+
+                    int nSigsCount = CScriptNum(stacktop(-i), fRequireMinimal).getint();
+                    if (nSigsCount < 0 || nSigsCount > nKeysCount)
+                        return set_error(serror, SCRIPT_ERR_SIG_COUNT);
+                    int isig = ++i;
+                    i += nSigsCount;
+                    if ((int)stack.size() < i)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+
+                    bool fSuccess = true;
+                    while (fSuccess && nSigsCount > 0)
+                    {
+                        valtype& vchSig    = stacktop(-isig);
+                        valtype& vchPubKey = stacktop(-ikey);
+
+                        // Note how this makes the exact order of pubkey/signature evaluation
+                        // distinguishable by CHECKMULTISIG NOT if the STRICTENC flag is set.
+                        // See the script_(in)valid tests for details.
+                        if (!CheckSignatureEncoding(vchSig, flags, serror) || !CheckPubKeyEncoding(vchPubKey, flags, serror)) {
+                            // serror is set
+                            return false;
+                        }
+
+                        // Check signature
+                        bool fOk = checker.CheckSig(vchSig, vchPubKey, script, consensusBranchId);
+
+                        if (fOk) {
+                            isig++;
+                            nSigsCount--;
+                        }
+                        ikey++;
+                        nKeysCount--;
+
+                        // If there are more signatures left than keys left,
+                        // then too many signatures have failed. Exit early,
+                        // without checking any further signatures.
+                        if (nSigsCount > nKeysCount)
+                            fSuccess = false;
+                    }
+
+                    // Clean up stack of actual arguments
+                    while (i-- > 1)
+                        popstack(stack);
+
+                    // A bug causes CHECKMULTISIG to consume one extra argument
+                    // whose contents were not checked in any way.
+                    //
+                    // Unfortunately this is a potential source of mutability,
+                    // so optionally verify it is exactly equal to zero prior
+                    // to removing it from the stack.
+                    if (stack.size() < 1)
+                        return set_error(serror, SCRIPT_ERR_INVALID_STACK_OPERATION);
+                    if ((flags & SCRIPT_VERIFY_NULLDUMMY) && stacktop(-1).size())
+                        return set_error(serror, SCRIPT_ERR_SIG_NULLDUMMY);
+                    popstack(stack);
+
+                    stack.push_back(fSuccess ? vchTrue : vchFalse);
+
+                    if (opcode == OP_CHECKMULTISIGVERIFY)
+                    {
+                        if (fSuccess)
+                            popstack(stack);
+                        else
+                            return set_error(serror, SCRIPT_ERR_CHECKMULTISIGVERIFY);
+                    }
+                }
+                break;
+
+                default:
+                    return set_error(serror, SCRIPT_ERR_BAD_OPCODE);
+            }
+
+            // Size limits
+            if (stack.size() + altstack.size() > 1000)
+                return set_error(serror, SCRIPT_ERR_STACK_SIZE);
+        }
+    }
+    catch (...)
+    {
+        return set_error(serror, SCRIPT_ERR_UNKNOWN_ERROR);
+    }
+
+    if (!vfExec.empty())
+        return set_error(serror, SCRIPT_ERR_UNBALANCED_CONDITIONAL);
+
+    return set_success(serror);
+}
+
+namespace {
+
+/**
+ * Wrapper that serializes like CTransaction, but with the modifications
+ *  required for the signature hash done in-place
+ */
+class CTransactionSignatureSerializer {
+private:
+    const CTransaction& txTo;  //!< reference to the spending transaction (the one being serialized)
+    const CScript& scriptCode; //!< output script being consumed
+    const unsigned int nIn;    //!< input index of txTo being signed
+    const bool fAnyoneCanPay;  //!< whether the hashtype has the SIGHASH_ANYONECANPAY flag set
+    const bool fHashSingle;    //!< whether the hashtype is SIGHASH_SINGLE
+    const bool fHashNone;      //!< whether the hashtype is SIGHASH_NONE
+
+public:
+    CTransactionSignatureSerializer(const CTransaction &txToIn, const CScript &scriptCodeIn, unsigned int nInIn, int nHashTypeIn) :
+        txTo(txToIn), scriptCode(scriptCodeIn), nIn(nInIn),
+        fAnyoneCanPay(!!(nHashTypeIn & SIGHASH_ANYONECANPAY)),
+        fHashSingle((nHashTypeIn & 0x1f) == SIGHASH_SINGLE),
+        fHashNone((nHashTypeIn & 0x1f) == SIGHASH_NONE) {}
+
+    /** Serialize the passed scriptCode */
+    template<typename S>
+    void SerializeScriptCode(S &s) const {
+        auto size = scriptCode.size();
+        ::WriteCompactSize(s, size);
+        s.write((char*)&scriptCode.begin()[0], size);
+    }
+
+    /** Serialize an input of txTo */
+    template<typename S>
+    void SerializeInput(S &s, unsigned int nInput) const {
+        // In case of SIGHASH_ANYONECANPAY, only the input being signed is serialized
+        if (fAnyoneCanPay)
+            nInput = nIn;
+        // Serialize the prevout
+        ::Serialize(s, txTo.vin[nInput].prevout);
+        // Serialize the script
+        assert(nInput != NOT_AN_INPUT);
+        if (nInput != nIn)
+            // Blank out other inputs' signatures
+            ::Serialize(s, CScriptBase());
+        else
+            SerializeScriptCode(s);
+        // Serialize the nSequence
+        if (nInput != nIn && (fHashSingle || fHashNone))
+            // let the others update at will
+            ::Serialize(s, (int)0);
+        else
+            ::Serialize(s, txTo.vin[nInput].nSequence);
+    }
+
+    /** Serialize an output of txTo */
+    template<typename S>
+    void SerializeOutput(S &s, unsigned int nOutput) const {
+        if (fHashSingle && nOutput != nIn)
+            // Do not lock-in the txout payee at other indices as txin
+            ::Serialize(s, CTxOut());
+        else
+            ::Serialize(s, txTo.vout[nOutput]);
+    }
+
+    /** Serialize txTo */
+    template<typename S>
+    void Serialize(S &s) const {
+        // Serialize nVersion
+        ::Serialize(s, txTo.nVersion);
+        // Serialize vin
+        unsigned int nInputs = fAnyoneCanPay ? 1 : txTo.vin.size();
+        ::WriteCompactSize(s, nInputs);
+        for (unsigned int nInput = 0; nInput < nInputs; nInput++)
+             SerializeInput(s, nInput);
+        // Serialize vout
+        unsigned int nOutputs = fHashNone ? 0 : (fHashSingle ? nIn+1 : txTo.vout.size());
+        ::WriteCompactSize(s, nOutputs);
+        for (unsigned int nOutput = 0; nOutput < nOutputs; nOutput++)
+             SerializeOutput(s, nOutput);
+        // Serialize nLockTime
+        ::Serialize(s, txTo.nLockTime);
+
+        // Serialize vJoinSplit
+        if (txTo.nVersion >= 2) {
+            //
+            // SIGHASH_* functions will hash portions of
+            // the transaction for use in signatures. This
+            // keeps the JoinSplit cryptographically bound
+            // to the transaction.
+            //
+            ::Serialize(s, txTo.vJoinSplit);
+            if (txTo.vJoinSplit.size() > 0) {
+                ::Serialize(s, txTo.joinSplitPubKey);
+
+                CTransaction::joinsplit_sig_t nullSig = {};
+                ::Serialize(s, nullSig);
+            }
+        }
+    }
+};
+
+const unsigned char ZCASH_PREVOUTS_HASH_PERSONALIZATION[BLAKE2bPersonalBytes] =
+    {'Z','c','a','s','h','P','r','e','v','o','u','t','H','a','s','h'};
+const unsigned char ZCASH_SEQUENCE_HASH_PERSONALIZATION[BLAKE2bPersonalBytes] =
+    {'Z','c','a','s','h','S','e','q','u','e','n','c','H','a','s','h'};
+const unsigned char ZCASH_OUTPUTS_HASH_PERSONALIZATION[BLAKE2bPersonalBytes] =
+    {'Z','c','a','s','h','O','u','t','p','u','t','s','H','a','s','h'};
+const unsigned char ZCASH_JOINSPLITS_HASH_PERSONALIZATION[BLAKE2bPersonalBytes] =
+    {'Z','c','a','s','h','J','S','p','l','i','t','s','H','a','s','h'};
+const unsigned char ZCASH_SHIELDED_SPENDS_HASH_PERSONALIZATION[BLAKE2bPersonalBytes] =
+    {'Z','c','a','s','h','S','S','p','e','n','d','s','H','a','s','h'};
+const unsigned char ZCASH_SHIELDED_OUTPUTS_HASH_PERSONALIZATION[BLAKE2bPersonalBytes] =
+    {'Z','c','a','s','h','S','O','u','t','p','u','t','H','a','s','h'};
+
+uint256 GetPrevoutHash(const CTransaction& txTo) {
+    CBLAKE2bWriter ss(SER_GETHASH, 0, ZCASH_PREVOUTS_HASH_PERSONALIZATION);
+    for (unsigned int n = 0; n < txTo.vin.size(); n++) {
+        ss << txTo.vin[n].prevout;
+    }
+    return ss.GetHash();
+}
+
+uint256 GetSequenceHash(const CTransaction& txTo) {
+    CBLAKE2bWriter ss(SER_GETHASH, 0, ZCASH_SEQUENCE_HASH_PERSONALIZATION);
+    for (unsigned int n = 0; n < txTo.vin.size(); n++) {
+        ss << txTo.vin[n].nSequence;
+    }
+    return ss.GetHash();
+}
+
+uint256 GetOutputsHash(const CTransaction& txTo) {
+    CBLAKE2bWriter ss(SER_GETHASH, 0, ZCASH_OUTPUTS_HASH_PERSONALIZATION);
+    for (unsigned int n = 0; n < txTo.vout.size(); n++) {
+        ss << txTo.vout[n];
+    }
+    return ss.GetHash();
+}
+
+uint256 GetJoinSplitsHash(const CTransaction& txTo) {
+    CBLAKE2bWriter ss(SER_GETHASH, static_cast<int>(txTo.GetHeader()), ZCASH_JOINSPLITS_HASH_PERSONALIZATION);
+    for (unsigned int n = 0; n < txTo.vJoinSplit.size(); n++) {
+        ss << txTo.vJoinSplit[n];
+    }
+    ss << txTo.joinSplitPubKey;
+    return ss.GetHash();
+}
+
+uint256 GetShieldedSpendsHash(const CTransaction& txTo) {
+    CBLAKE2bWriter ss(SER_GETHASH, 0, ZCASH_SHIELDED_SPENDS_HASH_PERSONALIZATION);
+    for (unsigned int n = 0; n < txTo.vShieldedSpend.size(); n++) {
+        ss << txTo.vShieldedSpend[n].cv;
+        ss << txTo.vShieldedSpend[n].anchor;
+        ss << txTo.vShieldedSpend[n].nullifier;
+        ss << txTo.vShieldedSpend[n].rk;
+        ss << txTo.vShieldedSpend[n].zkproof;
+    }
+    return ss.GetHash();
+}
+
+uint256 GetShieldedOutputsHash(const CTransaction& txTo) {
+    CBLAKE2bWriter ss(SER_GETHASH, 0, ZCASH_SHIELDED_OUTPUTS_HASH_PERSONALIZATION);
+    for (unsigned int n = 0; n < txTo.vShieldedOutput.size(); n++) {
+        ss << txTo.vShieldedOutput[n];
+    }
+    return ss.GetHash();
+}
+
+} // anon namespace
+
+PrecomputedTransactionData::PrecomputedTransactionData(
+    const CTransaction& txTo,
+    const std::vector<CTxOut>& allPrevOutputs) :
+    preTx(nullptr, zcash_transaction_precomputed_free)
+{
+    CDataStream sAllPrevOutputs(SER_NETWORK, PROTOCOL_VERSION);
+    sAllPrevOutputs << allPrevOutputs;
+    SetPrecomputed(
+        txTo,
+        reinterpret_cast<const unsigned char*>(sAllPrevOutputs.data()),
+        sAllPrevOutputs.size());
+}
+
+PrecomputedTransactionData::PrecomputedTransactionData(
+    const CTransaction& txTo,
+    const unsigned char* allPrevOutputs,
+    size_t allPrevOutputsLen) :
+    preTx(nullptr, zcash_transaction_precomputed_free)
+{
+    SetPrecomputed(txTo, allPrevOutputs, allPrevOutputsLen);
+}
+
+void PrecomputedTransactionData::SetPrecomputed(
+    const CTransaction& txTo,
+    const unsigned char* allPrevOutputs,
+    size_t allPrevOutputsLen)
+{
+    bool isOverwinterV3 =
+        txTo.fOverwintered &&
+        txTo.nVersionGroupId == OVERWINTER_VERSION_GROUP_ID &&
+        txTo.nVersion == OVERWINTER_TX_VERSION;
+    bool isSaplingV4 =
+        txTo.fOverwintered &&
+        txTo.nVersionGroupId == SAPLING_VERSION_GROUP_ID &&
+        txTo.nVersion == SAPLING_TX_VERSION;
+
+    if (!txTo.fOverwintered || isOverwinterV3 || isSaplingV4) {
+        hashPrevouts = GetPrevoutHash(txTo);
+        hashSequence = GetSequenceHash(txTo);
+        hashOutputs = GetOutputsHash(txTo);
+        hashJoinSplits = GetJoinSplitsHash(txTo);
+        hashShieldedSpends = GetShieldedSpendsHash(txTo);
+        hashShieldedOutputs = GetShieldedOutputsHash(txTo);
+    } else {
+        // TODO: If we already have this serialized, use it.
+        CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+        ss << txTo;
+        preTx.reset(zcash_transaction_precomputed_init(
+            reinterpret_cast<const unsigned char*>(ss.data()),
+            ss.size(), allPrevOutputs, allPrevOutputsLen));
+        if (preTx == nullptr) {
+            throw std::ios_base::failure("Invalid arguments to PrecomputedTransactionData");
+        }
+    }
+}
+
+SigVersion SignatureHashVersion(const CTransaction& txTo)
+{
+    if (txTo.fOverwintered) {
+        if (txTo.nVersionGroupId == ZIP225_VERSION_GROUP_ID) {
+            return SIGVERSION_ZIP244;
+        } else if (txTo.nVersionGroupId == SAPLING_VERSION_GROUP_ID) {
+            return SIGVERSION_SAPLING;
+        } else {
+            return SIGVERSION_OVERWINTER;
+        }
+    } else {
+        return SIGVERSION_SPROUT;
+    }
+}
+
+uint256 SignatureHash(
+    const CScript& scriptCode,
+    const CTransaction& txTo,
+    unsigned int nIn,
+    int nHashType,
+    const CAmount& amount,
+    uint32_t consensusBranchId,
+    const PrecomputedTransactionData& txdata)
+{
+    if (nIn >= txTo.vin.size() && nIn != NOT_AN_INPUT) {
+        //  nIn out of range
+        throw logic_error("input index is out of range");
+    }
+
+    auto sigversion = SignatureHashVersion(txTo);
+
+    if (sigversion == SIGVERSION_ZIP244) {
+        // ZIP 244, S.2: transparent_sig_digest
+        //
+        // If we are producing a hash for either a coinbase transaction, or a
+        // non-coinbase transaction that has no transparent inputs, the value of
+        // transparent_sig_digest is identical to the value specified in section
+        // T.2.
+        //
+        // https://zips.z.cash/zip-0244#s-2-transparent-sig-digest
+        if (txTo.IsCoinBase() || txTo.vin.empty()) {
+            // This situation only applies to shielded signatures.
+            assert(nIn == NOT_AN_INPUT);
+            assert(nHashType == SIGHASH_ALL);
+            // The signature digest is just the txid! No need to cross the FFI.
+            return txTo.GetHash();
+        } else {
+            // S.2a: hash_type
+            //
+            // The following restrictions apply, which cause validation failure
+            // if violated:
+            // - Using any undefined hash_type (not 0x01, 0x02, 0x03, 0x81,
+            //   0x82, or 0x83).
+            // - Using SIGHASH_SINGLE without a "corresponding output" (an
+            //   output with the same index as the input being verified).
+            switch (nHashType) {
+            case SIGHASH_SINGLE:
+            case SIGHASH_ANYONECANPAY | SIGHASH_SINGLE:
+                if (nIn >= txTo.vout.size()) {
+                    throw std::logic_error(
+                        "ZIP 244: Used SIGHASH_SINGLE without a corresponding output");
+                }
+            case SIGHASH_ALL:
+            case SIGHASH_NONE:
+            case SIGHASH_ANYONECANPAY | SIGHASH_ALL:
+            case SIGHASH_ANYONECANPAY | SIGHASH_NONE:
+                break;
+            default:
+                throw std::logic_error("ZIP 244: Used undefined hash_type");
+            }
+
+            // The amount parameter is ignored; we extract it from allPrevOutputs.
+            // - Note to future developers: if we ever replace the C++ logic for
+            //   pre-v5 transactions with Rust logic, make sure signrawtransaction
+            //   is updated to know about it!
+            // The consensusBranchId parameter is ignored; we use the value stored
+            // in the transaction itself.
+            uint256 hash;
+            if (!zcash_transaction_zip244_signature_digest(
+                txdata.preTx.get(),
+                nHashType,
+                nIn,
+                hash.begin()))
+            {
+                throw std::logic_error("We should not reach here.");
+            }
+            return hash;
+        }
+    } else if (sigversion == SIGVERSION_OVERWINTER || sigversion == SIGVERSION_SAPLING) {
+        uint256 hashPrevouts;
+        uint256 hashSequence;
+        uint256 hashOutputs;
+        uint256 hashJoinSplits;
+        uint256 hashShieldedSpends;
+        uint256 hashShieldedOutputs;
+
+        if (!(nHashType & SIGHASH_ANYONECANPAY)) {
+            hashPrevouts = txdata.hashPrevouts;
+        }
+
+        if (!(nHashType & SIGHASH_ANYONECANPAY) && (nHashType & 0x1f) != SIGHASH_SINGLE && (nHashType & 0x1f) != SIGHASH_NONE) {
+            hashSequence = txdata.hashSequence;
+        }
+
+        if ((nHashType & 0x1f) != SIGHASH_SINGLE && (nHashType & 0x1f) != SIGHASH_NONE) {
+            hashOutputs = txdata.hashOutputs;
+        } else if ((nHashType & 0x1f) == SIGHASH_SINGLE && nIn < txTo.vout.size()) {
+            CBLAKE2bWriter ss(SER_GETHASH, 0, ZCASH_OUTPUTS_HASH_PERSONALIZATION);
+            ss << txTo.vout[nIn];
+            hashOutputs = ss.GetHash();
+        }
+
+        if (!txTo.vJoinSplit.empty()) {
+            hashJoinSplits = txdata.hashJoinSplits;
+        }
+
+        if (!txTo.vShieldedSpend.empty()) {
+            hashShieldedSpends = txdata.hashShieldedSpends;
+        }
+
+        if (!txTo.vShieldedOutput.empty()) {
+            hashShieldedOutputs = txdata.hashShieldedOutputs;
+        }
+
+        uint32_t leConsensusBranchId = htole32(consensusBranchId);
+        unsigned char personalization[16] = {};
+        memcpy(personalization, "ZcashSigHash", 12);
+        memcpy(personalization+12, &leConsensusBranchId, 4);
+
+        CBLAKE2bWriter ss(SER_GETHASH, 0, personalization);
+        // Header
+        ss << txTo.GetHeader();
+        // Version group ID
+        ss << txTo.nVersionGroupId;
+        // Input prevouts/nSequence (none/all, depending on flags)
+        ss << hashPrevouts;
+        ss << hashSequence;
+        // Outputs (none/one/all, depending on flags)
+        ss << hashOutputs;
+        // JoinSplits
+        ss << hashJoinSplits;
+        if (sigversion == SIGVERSION_SAPLING) {
+            // Spend descriptions
+            ss << hashShieldedSpends;
+            // Output descriptions
+            ss << hashShieldedOutputs;
+        }
+        // Locktime
+        ss << txTo.nLockTime;
+        // Expiry height
+        ss << txTo.nExpiryHeight;
+        if (sigversion == SIGVERSION_SAPLING) {
+            // Sapling value balance
+            ss << txTo.GetValueBalanceSapling();
+        }
+        // Sighash type
+        ss << nHashType;
+
+        // If this hash is for a transparent input signature
+        // (i.e. not for txTo.joinSplitSig):
+        if (nIn != NOT_AN_INPUT){
+            // The input being signed (replacing the scriptSig with scriptCode + amount)
+            // The prevout may already be contained in hashPrevout, and the nSequence
+            // may already be contained in hashSequence.
+            ss << txTo.vin[nIn].prevout;
+            ss << static_cast<const CScriptBase&>(scriptCode);
+            ss << amount;
+            ss << txTo.vin[nIn].nSequence;
+        }
+
+        return ss.GetHash();
+    }
+
+    // Check for invalid use of SIGHASH_SINGLE
+    if ((nHashType & 0x1f) == SIGHASH_SINGLE) {
+        if (nIn >= txTo.vout.size()) {
+            //  nOut out of range
+            throw logic_error("no matching output for SIGHASH_SINGLE");
+        }
+    }
+
+    // Wrapper to serialize only the necessary parts of the transaction being signed
+    CTransactionSignatureSerializer txTmp(txTo, scriptCode, nIn, nHashType);
+
+    // Serialize and hash
+    CHashWriter ss(SER_GETHASH, 0);
+    ss << txTmp << nHashType;
+    return ss.GetHash();
+}
+
+bool TransactionSignatureChecker::VerifySignature(
+    const std::vector<unsigned char>& vchSig, const CPubKey& pubkey, const uint256& sighash) const
+{
+    return pubkey.Verify(sighash, vchSig);
+}
+
+bool TransactionSignatureChecker::CheckSig(
+    const vector<unsigned char>& vchSigIn,
+    const vector<unsigned char>& vchPubKey,
+    const CScript& scriptCode,
+    uint32_t consensusBranchId) const
+{
+    CPubKey pubkey(vchPubKey);
+    if (!pubkey.IsValid())
+        return false;
+
+    // Hash type is one byte tacked on to the end of the signature
+    vector<unsigned char> vchSig(vchSigIn);
+    if (vchSig.empty())
+        return false;
+    int nHashType = vchSig.back();
+    vchSig.pop_back();
+
+    uint256 sighash;
+    try {
+        sighash = SignatureHash(scriptCode, *txTo, nIn, nHashType, amount, consensusBranchId, this->txdata);
+    } catch (logic_error ex) {
+        return false;
+    }
+
+    if (!VerifySignature(vchSig, pubkey, sighash))
+        return false;
+
+    return true;
+}
+
+bool TransactionSignatureChecker::CheckLockTime(const CScriptNum& nLockTime) const
+{
+    // There are two times of nLockTime: lock-by-blockheight
+    // and lock-by-blocktime, distinguished by whether
+    // nLockTime < LOCKTIME_THRESHOLD.
+    //
+    // We want to compare apples to apples, so fail the script
+    // unless the type of nLockTime being tested is the same as
+    // the nLockTime in the transaction.
+    if (!(
+        (txTo->nLockTime <  LOCKTIME_THRESHOLD && nLockTime <  LOCKTIME_THRESHOLD) ||
+        (txTo->nLockTime >= LOCKTIME_THRESHOLD && nLockTime >= LOCKTIME_THRESHOLD)
+    ))
+        return false;
+
+    // Now that we know we're comparing apples-to-apples, the
+    // comparison is a simple numeric one.
+    if (nLockTime > (int64_t)txTo->nLockTime)
+        return false;
+
+    // Finally the nLockTime feature can be disabled and thus
+    // CHECKLOCKTIMEVERIFY bypassed if every txin has been
+    // finalized by setting nSequence to maxint. The
+    // transaction would be allowed into the blockchain, making
+    // the opcode ineffective.
+    //
+    // Testing if this vin is not final is sufficient to
+    // prevent this condition. Alternatively we could test all
+    // inputs, but testing just this input minimizes the data
+    // required to prove correct CHECKLOCKTIMEVERIFY execution.
+    if (txTo->vin[nIn].IsFinal())
+        return false;
+
+    return true;
+}
+
+
+bool VerifyScript(
+    const CScript& scriptSig,
+    const CScript& scriptPubKey,
+    unsigned int flags,
+    const BaseSignatureChecker& checker,
+    uint32_t consensusBranchId,
+    ScriptError* serror)
+{
+    set_error(serror, SCRIPT_ERR_UNKNOWN_ERROR);
+
+    if ((flags & SCRIPT_VERIFY_SIGPUSHONLY) != 0 && !scriptSig.IsPushOnly()) {
+        return set_error(serror, SCRIPT_ERR_SIG_PUSHONLY);
+    }
+
+    vector<vector<unsigned char> > stack, stackCopy;
+    if (!EvalScript(stack, scriptSig, flags, checker, consensusBranchId, serror))
+        // serror is set
+        return false;
+    if (flags & SCRIPT_VERIFY_P2SH)
+        stackCopy = stack;
+    if (!EvalScript(stack, scriptPubKey, flags, checker, consensusBranchId, serror))
+        // serror is set
+        return false;
+    if (stack.empty())
+        return set_error(serror, SCRIPT_ERR_EVAL_FALSE);
+    if (CastToBool(stack.back()) == false)
+        return set_error(serror, SCRIPT_ERR_EVAL_FALSE);
+
+    // Additional validation for spend-to-script-hash transactions:
+    if ((flags & SCRIPT_VERIFY_P2SH) && scriptPubKey.IsPayToScriptHash())
+    {
+        // scriptSig must be literals-only or validation fails
+        if (!scriptSig.IsPushOnly())
+            return set_error(serror, SCRIPT_ERR_SIG_PUSHONLY);
+
+        // Restore stack.
+        swap(stack, stackCopy);
+
+        // stack cannot be empty here, because if it was the
+        // P2SH  HASH <> EQUAL  scriptPubKey would be evaluated with
+        // an empty stack and the EvalScript above would return false.
+        assert(!stack.empty());
+
+        const valtype& pubKeySerialized = stack.back();
+        CScript pubKey2(pubKeySerialized.begin(), pubKeySerialized.end());
+        popstack(stack);
+
+        if (!EvalScript(stack, pubKey2, flags, checker, consensusBranchId, serror))
+            // serror is set
+            return false;
+        if (stack.empty())
+            return set_error(serror, SCRIPT_ERR_EVAL_FALSE);
+        if (!CastToBool(stack.back()))
+            return set_error(serror, SCRIPT_ERR_EVAL_FALSE);
+    }
+
+    // The CLEANSTACK check is only performed after potential P2SH evaluation,
+    // as the non-P2SH evaluation of a P2SH script will obviously not result in
+    // a clean stack (the P2SH inputs remain).
+    if ((flags & SCRIPT_VERIFY_CLEANSTACK) != 0) {
+        // Disallow CLEANSTACK without P2SH, as otherwise a switch CLEANSTACK->P2SH+CLEANSTACK
+        // would be possible, which is not a softfork (and P2SH should be one).
+        assert((flags & SCRIPT_VERIFY_P2SH) != 0);
+        if (stack.size() != 1) {
+            return set_error(serror, SCRIPT_ERR_CLEANSTACK);
+        }
+    }
+
+    return set_success(serror);
+}
diff --git a/depend/zcash/src/script/interpreter.h b/depend/zcash/src/script/interpreter.h
new file mode 100644
index 000000000..01f647e00
--- /dev/null
+++ b/depend/zcash/src/script/interpreter.h
@@ -0,0 +1,195 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_SCRIPT_INTERPRETER_H
+#define BITCOIN_SCRIPT_INTERPRETER_H
+
+#include "script_error.h"
+#include "primitives/transaction.h"
+
+#include <rust/transaction.h>
+
+#include <vector>
+#include <stdint.h>
+#include <string>
+#include <climits>
+
+class CPubKey;
+class CScript;
+class CTransaction;
+class uint256;
+
+/** Special case nIn for signing JoinSplits. */
+const unsigned int NOT_AN_INPUT = UINT_MAX;
+
+/** Signature hash types/flags */
+enum
+{
+    SIGHASH_ALL = 1,
+    SIGHASH_NONE = 2,
+    SIGHASH_SINGLE = 3,
+    SIGHASH_ANYONECANPAY = 0x80,
+};
+
+/** Script verification flags */
+enum
+{
+    SCRIPT_VERIFY_NONE      = 0,
+
+    // Evaluate P2SH subscripts (softfork safe, BIP16).
+    SCRIPT_VERIFY_P2SH      = (1U << 0),
+
+    // Passing a non-strict-DER signature or one with undefined hashtype to a checksig operation causes script failure.
+    // Evaluating a pubkey that is not (0x04 + 64 bytes) or (0x02 or 0x03 + 32 bytes) by checksig causes script failure.
+    // (softfork safe, but not used or intended as a consensus rule).
+    SCRIPT_VERIFY_STRICTENC = (1U << 1),
+
+    // Passing a non-strict-DER signature to a checksig operation causes script failure (softfork safe, BIP62 rule 1)
+    // In Zcash this is required, and validation of non-strict-DER signatures is not implemented.
+    //SCRIPT_VERIFY_DERSIG    = (1U << 2),
+
+    // Passing a non-strict-DER signature or one with S > order/2 to a checksig operation causes script failure
+    // (softfork safe, BIP62 rule 5).
+    SCRIPT_VERIFY_LOW_S     = (1U << 3),
+
+    // verify dummy stack item consumed by CHECKMULTISIG is of zero-length (softfork safe, BIP62 rule 7).
+    SCRIPT_VERIFY_NULLDUMMY = (1U << 4),
+
+    // Using a non-push operator in the scriptSig causes script failure (softfork safe, BIP62 rule 2).
+    SCRIPT_VERIFY_SIGPUSHONLY = (1U << 5),
+
+    // Require minimal encodings for all push operations (OP_0... OP_16, OP_1NEGATE where possible, direct
+    // pushes up to 75 bytes, OP_PUSHDATA up to 255 bytes, OP_PUSHDATA2 for anything larger). Evaluating
+    // any other push causes the script to fail (BIP62 rule 3).
+    // In addition, whenever a stack element is interpreted as a number, it must be of minimal length (BIP62 rule 4).
+    // (softfork safe)
+    SCRIPT_VERIFY_MINIMALDATA = (1U << 6),
+
+    // Discourage use of NOPs reserved for upgrades (NOP1-10)
+    //
+    // Provided so that nodes can avoid accepting or mining transactions
+    // containing executed NOP's whose meaning may change after a soft-fork,
+    // thus rendering the script invalid; with this flag set executing
+    // discouraged NOPs fails the script. This verification flag will never be
+    // a mandatory flag applied to scripts in a block. NOPs that are not
+    // executed, e.g.  within an unexecuted IF ENDIF block, are *not* rejected.
+    SCRIPT_VERIFY_DISCOURAGE_UPGRADABLE_NOPS  = (1U << 7),
+
+    // Require that only a single stack element remains after evaluation. This changes the success criterion from
+    // "At least one stack element must remain, and when interpreted as a boolean, it must be true" to
+    // "Exactly one stack element must remain, and when interpreted as a boolean, it must be true".
+    // (softfork safe, BIP62 rule 6)
+    // Note: CLEANSTACK should never be used without P2SH.
+    SCRIPT_VERIFY_CLEANSTACK = (1U << 8),
+
+    // Verify CHECKLOCKTIMEVERIFY
+    //
+    // See BIP65 for details.
+    SCRIPT_VERIFY_CHECKLOCKTIMEVERIFY = (1U << 9),
+};
+
+bool CheckSignatureEncoding(const std::vector<unsigned char> &vchSig, unsigned int flags, ScriptError* serror);
+
+struct PrecomputedTransactionData
+{
+    uint256 hashPrevouts, hashSequence, hashOutputs, hashJoinSplits, hashShieldedSpends, hashShieldedOutputs;
+    /** Precomputed transaction parts. */
+    std::unique_ptr<PrecomputedTxParts, decltype(&zcash_transaction_precomputed_free)> preTx;
+
+    PrecomputedTransactionData(
+        const CTransaction& tx,
+        const std::vector<CTxOut>& allPrevOutputs);
+
+    PrecomputedTransactionData(
+        const CTransaction& tx,
+        const unsigned char* allPrevOutputs,
+        size_t allPrevOutputsLen);
+
+private:
+    void SetPrecomputed(
+        const CTransaction& tx,
+        const unsigned char* allPrevOutputs,
+        size_t allPrevOutputsLen);
+};
+
+enum SigVersion
+{
+    SIGVERSION_SPROUT = 0,
+    SIGVERSION_OVERWINTER = 1,
+    SIGVERSION_SAPLING = 2,
+    SIGVERSION_ZIP244 = 3,
+};
+
+uint256 SignatureHash(
+    const CScript &scriptCode,
+    const CTransaction& txTo,
+    unsigned int nIn,
+    int nHashType,
+    const CAmount& amount,
+    uint32_t consensusBranchId,
+    const PrecomputedTransactionData& txdata);
+
+class BaseSignatureChecker
+{
+public:
+    virtual bool CheckSig(
+        const std::vector<unsigned char>& scriptSig,
+        const std::vector<unsigned char>& vchPubKey,
+        const CScript& scriptCode,
+        uint32_t consensusBranchId) const
+    {
+        return false;
+    }
+
+    virtual bool CheckLockTime(const CScriptNum& nLockTime) const
+    {
+         return false;
+    }
+
+    virtual ~BaseSignatureChecker() {}
+};
+
+class TransactionSignatureChecker : public BaseSignatureChecker
+{
+private:
+    const CTransaction* txTo;
+    unsigned int nIn;
+    const CAmount amount;
+    const PrecomputedTransactionData& txdata;
+
+protected:
+    virtual bool VerifySignature(const std::vector<unsigned char>& vchSig, const CPubKey& vchPubKey, const uint256& sighash) const;
+
+public:
+    TransactionSignatureChecker(const CTransaction* txToIn, const PrecomputedTransactionData& txdataIn, unsigned int nInIn, const CAmount& amountIn) : txTo(txToIn), nIn(nInIn), amount(amountIn), txdata(txdataIn) {}
+    bool CheckSig(const std::vector<unsigned char>& scriptSig, const std::vector<unsigned char>& vchPubKey, const CScript& scriptCode, uint32_t consensusBranchId) const;
+    bool CheckLockTime(const CScriptNum& nLockTime) const;
+};
+
+class MutableTransactionSignatureChecker : public TransactionSignatureChecker
+{
+private:
+    const CTransaction txTo;
+
+public:
+    MutableTransactionSignatureChecker(const CMutableTransaction* txToIn, const PrecomputedTransactionData& txdataIn, unsigned int nInIn, const CAmount& amount) : TransactionSignatureChecker(&txTo, txdataIn, nInIn, amount), txTo(*txToIn) {}
+};
+
+bool EvalScript(
+    std::vector<std::vector<unsigned char> >& stack,
+    const CScript& script,
+    unsigned int flags,
+    const BaseSignatureChecker& checker,
+    uint32_t consensusBranchId,
+    ScriptError* error = NULL);
+bool VerifyScript(
+    const CScript& scriptSig,
+    const CScript& scriptPubKey,
+    unsigned int flags,
+    const BaseSignatureChecker& checker,
+    uint32_t consensusBranchId,
+    ScriptError* serror = NULL);
+
+#endif // BITCOIN_SCRIPT_INTERPRETER_H
diff --git a/depend/zcash/src/script/ismine.cpp b/depend/zcash/src/script/ismine.cpp
new file mode 100644
index 000000000..0c6df465e
--- /dev/null
+++ b/depend/zcash/src/script/ismine.cpp
@@ -0,0 +1,124 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "ismine.h"
+
+#include "key.h"
+#include "keystore.h"
+#include "script/script.h"
+#include "script/standard.h"
+#include "script/sign.h"
+
+
+using namespace std;
+
+namespace {
+
+/**
+ * This is an enum that tracks the execution context of a script, similar to
+ * SigVersion in script/interpreter. It is separate however because we want to
+ * distinguish between top-level scriptPubKey execution and P2SH redeemScript
+ * execution (a distinction that has no impact on consensus rules).
+ */
+enum class IsMineSigVersion
+{
+    TOP = 0,        //! scriptPubKey execution
+    P2SH = 1,       //! P2SH redeemScript
+};
+
+bool PermitsUncompressed(IsMineSigVersion sigversion)
+{
+    return sigversion == IsMineSigVersion::TOP || sigversion == IsMineSigVersion::P2SH;
+}
+
+typedef vector<unsigned char> valtype;
+
+unsigned int HaveKeys(const vector<valtype>& pubkeys, const CKeyStore& keystore)
+{
+    unsigned int nResult = 0;
+    for (const valtype& pubkey : pubkeys)
+    {
+        CKeyID keyID = CPubKey(pubkey).GetID();
+        if (keystore.HaveKey(keyID))
+            ++nResult;
+    }
+    return nResult;
+}
+
+isminetype IsMineInner(const CKeyStore& keystore, const CScript& scriptPubKey, IsMineSigVersion sigversion)
+{
+    vector<valtype> vSolutions;
+    txnouttype whichType;
+    if (!Solver(scriptPubKey, whichType, vSolutions)) {
+        if (keystore.HaveWatchOnly(scriptPubKey))
+            return ISMINE_WATCH_UNSOLVABLE;
+        return ISMINE_NO;
+    }
+
+    CKeyID keyID;
+    switch (whichType)
+    {
+    case TX_NONSTANDARD:
+    case TX_NULL_DATA:
+        break;
+    case TX_PUBKEY:
+        keyID = CPubKey(vSolutions[0]).GetID();
+        if (keystore.HaveKey(keyID))
+            return ISMINE_SPENDABLE;
+        break;
+    case TX_PUBKEYHASH:
+        keyID = CKeyID(uint160(vSolutions[0]));
+        if (keystore.HaveKey(keyID))
+            return ISMINE_SPENDABLE;
+        break;
+    case TX_SCRIPTHASH:
+    {
+        CScriptID scriptID = CScriptID(uint160(vSolutions[0]));
+        CScript subscript;
+        if (keystore.GetCScript(scriptID, subscript)) {
+            isminetype ret = IsMineInner(keystore, subscript, IsMineSigVersion::P2SH);
+            if (ret == ISMINE_SPENDABLE)
+                return ret;
+        }
+        break;
+    }
+
+    case TX_MULTISIG:
+    {
+        // Never treat bare multisig outputs as ours (they can still be made watchonly-though)
+        if (sigversion == IsMineSigVersion::TOP) break;
+
+        // Only consider transactions "mine" if we own ALL the
+        // keys involved. Multi-signature transactions that are
+        // partially owned (somebody else has a key that can spend
+        // them) enable spend-out-from-under-you attacks, especially
+        // in shared-wallet situations.
+        vector<valtype> keys(vSolutions.begin()+1, vSolutions.begin()+vSolutions.size()-1);
+        if (HaveKeys(keys, keystore) == keys.size())
+            return ISMINE_SPENDABLE;
+        break;
+    }
+    }
+
+    if (keystore.HaveWatchOnly(scriptPubKey)) {
+        // TODO: This could be optimized some by doing some work after the above solver
+        SignatureData sigs;
+        return ProduceSignature(DummySignatureCreator(&keystore), scriptPubKey, sigs, 0) ? ISMINE_WATCH_SOLVABLE : ISMINE_WATCH_UNSOLVABLE;
+    }
+    return ISMINE_NO;
+}
+
+} // namespace
+
+isminetype IsMine(const CKeyStore& keystore, const CScript& scriptPubKey)
+{
+    return IsMineInner(keystore, scriptPubKey, IsMineSigVersion::TOP);
+}
+
+isminetype IsMine(const CKeyStore& keystore, const CTxDestination& dest)
+{
+    CScript script = GetScriptForDestination(dest);
+    return IsMine(keystore, script);
+}
diff --git a/depend/zcash/src/script/ismine.h b/depend/zcash/src/script/ismine.h
new file mode 100644
index 000000000..be437802c
--- /dev/null
+++ b/depend/zcash/src/script/ismine.h
@@ -0,0 +1,33 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_SCRIPT_ISMINE_H
+#define BITCOIN_SCRIPT_ISMINE_H
+
+#include "key.h"
+#include "script/standard.h"
+
+class CKeyStore;
+class CScript;
+
+/** IsMine() return codes */
+enum isminetype
+{
+    ISMINE_NO = 0,
+    //! Indicates that we dont know how to create a scriptSig that would solve this if we were given the appropriate private keys
+    ISMINE_WATCH_UNSOLVABLE = 1,
+    //! Indicates that we know how to create a scriptSig that would solve this if we were given the appropriate private keys
+    ISMINE_WATCH_SOLVABLE = 2,
+    ISMINE_WATCH_ONLY = ISMINE_WATCH_SOLVABLE | ISMINE_WATCH_UNSOLVABLE,
+    ISMINE_SPENDABLE = 4,
+    ISMINE_ALL = ISMINE_WATCH_ONLY | ISMINE_SPENDABLE
+};
+/** used for bitflags of isminetype */
+typedef uint8_t isminefilter;
+
+isminetype IsMine(const CKeyStore& keystore, const CScript& scriptPubKey);
+isminetype IsMine(const CKeyStore& keystore, const CTxDestination& dest);
+
+#endif // BITCOIN_SCRIPT_ISMINE_H
diff --git a/depend/zcash/src/script/script.cpp b/depend/zcash/src/script/script.cpp
new file mode 100644
index 000000000..bc904fd19
--- /dev/null
+++ b/depend/zcash/src/script/script.cpp
@@ -0,0 +1,271 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "script.h"
+
+#include "tinyformat.h"
+#include "utilstrencodings.h"
+
+using namespace std;
+
+const char* GetOpName(opcodetype opcode)
+{
+    switch (opcode)
+    {
+    // push value
+    case OP_0                      : return "0";
+    case OP_PUSHDATA1              : return "OP_PUSHDATA1";
+    case OP_PUSHDATA2              : return "OP_PUSHDATA2";
+    case OP_PUSHDATA4              : return "OP_PUSHDATA4";
+    case OP_1NEGATE                : return "-1";
+    case OP_RESERVED               : return "OP_RESERVED";
+    case OP_1                      : return "1";
+    case OP_2                      : return "2";
+    case OP_3                      : return "3";
+    case OP_4                      : return "4";
+    case OP_5                      : return "5";
+    case OP_6                      : return "6";
+    case OP_7                      : return "7";
+    case OP_8                      : return "8";
+    case OP_9                      : return "9";
+    case OP_10                     : return "10";
+    case OP_11                     : return "11";
+    case OP_12                     : return "12";
+    case OP_13                     : return "13";
+    case OP_14                     : return "14";
+    case OP_15                     : return "15";
+    case OP_16                     : return "16";
+
+    // control
+    case OP_NOP                    : return "OP_NOP";
+    case OP_VER                    : return "OP_VER";
+    case OP_IF                     : return "OP_IF";
+    case OP_NOTIF                  : return "OP_NOTIF";
+    case OP_VERIF                  : return "OP_VERIF";
+    case OP_VERNOTIF               : return "OP_VERNOTIF";
+    case OP_ELSE                   : return "OP_ELSE";
+    case OP_ENDIF                  : return "OP_ENDIF";
+    case OP_VERIFY                 : return "OP_VERIFY";
+    case OP_RETURN                 : return "OP_RETURN";
+
+    // stack ops
+    case OP_TOALTSTACK             : return "OP_TOALTSTACK";
+    case OP_FROMALTSTACK           : return "OP_FROMALTSTACK";
+    case OP_2DROP                  : return "OP_2DROP";
+    case OP_2DUP                   : return "OP_2DUP";
+    case OP_3DUP                   : return "OP_3DUP";
+    case OP_2OVER                  : return "OP_2OVER";
+    case OP_2ROT                   : return "OP_2ROT";
+    case OP_2SWAP                  : return "OP_2SWAP";
+    case OP_IFDUP                  : return "OP_IFDUP";
+    case OP_DEPTH                  : return "OP_DEPTH";
+    case OP_DROP                   : return "OP_DROP";
+    case OP_DUP                    : return "OP_DUP";
+    case OP_NIP                    : return "OP_NIP";
+    case OP_OVER                   : return "OP_OVER";
+    case OP_PICK                   : return "OP_PICK";
+    case OP_ROLL                   : return "OP_ROLL";
+    case OP_ROT                    : return "OP_ROT";
+    case OP_SWAP                   : return "OP_SWAP";
+    case OP_TUCK                   : return "OP_TUCK";
+
+    // splice ops
+    case OP_CAT                    : return "OP_CAT";
+    case OP_SUBSTR                 : return "OP_SUBSTR";
+    case OP_LEFT                   : return "OP_LEFT";
+    case OP_RIGHT                  : return "OP_RIGHT";
+    case OP_SIZE                   : return "OP_SIZE";
+
+    // bit logic
+    case OP_INVERT                 : return "OP_INVERT";
+    case OP_AND                    : return "OP_AND";
+    case OP_OR                     : return "OP_OR";
+    case OP_XOR                    : return "OP_XOR";
+    case OP_EQUAL                  : return "OP_EQUAL";
+    case OP_EQUALVERIFY            : return "OP_EQUALVERIFY";
+    case OP_RESERVED1              : return "OP_RESERVED1";
+    case OP_RESERVED2              : return "OP_RESERVED2";
+
+    // numeric
+    case OP_1ADD                   : return "OP_1ADD";
+    case OP_1SUB                   : return "OP_1SUB";
+    case OP_2MUL                   : return "OP_2MUL";
+    case OP_2DIV                   : return "OP_2DIV";
+    case OP_NEGATE                 : return "OP_NEGATE";
+    case OP_ABS                    : return "OP_ABS";
+    case OP_NOT                    : return "OP_NOT";
+    case OP_0NOTEQUAL              : return "OP_0NOTEQUAL";
+    case OP_ADD                    : return "OP_ADD";
+    case OP_SUB                    : return "OP_SUB";
+    case OP_MUL                    : return "OP_MUL";
+    case OP_DIV                    : return "OP_DIV";
+    case OP_MOD                    : return "OP_MOD";
+    case OP_LSHIFT                 : return "OP_LSHIFT";
+    case OP_RSHIFT                 : return "OP_RSHIFT";
+    case OP_BOOLAND                : return "OP_BOOLAND";
+    case OP_BOOLOR                 : return "OP_BOOLOR";
+    case OP_NUMEQUAL               : return "OP_NUMEQUAL";
+    case OP_NUMEQUALVERIFY         : return "OP_NUMEQUALVERIFY";
+    case OP_NUMNOTEQUAL            : return "OP_NUMNOTEQUAL";
+    case OP_LESSTHAN               : return "OP_LESSTHAN";
+    case OP_GREATERTHAN            : return "OP_GREATERTHAN";
+    case OP_LESSTHANOREQUAL        : return "OP_LESSTHANOREQUAL";
+    case OP_GREATERTHANOREQUAL     : return "OP_GREATERTHANOREQUAL";
+    case OP_MIN                    : return "OP_MIN";
+    case OP_MAX                    : return "OP_MAX";
+    case OP_WITHIN                 : return "OP_WITHIN";
+
+    // crypto
+    case OP_RIPEMD160              : return "OP_RIPEMD160";
+    case OP_SHA1                   : return "OP_SHA1";
+    case OP_SHA256                 : return "OP_SHA256";
+    case OP_HASH160                : return "OP_HASH160";
+    case OP_HASH256                : return "OP_HASH256";
+    case OP_CODESEPARATOR          : return "OP_CODESEPARATOR";
+    case OP_CHECKSIG               : return "OP_CHECKSIG";
+    case OP_CHECKSIGVERIFY         : return "OP_CHECKSIGVERIFY";
+    case OP_CHECKMULTISIG          : return "OP_CHECKMULTISIG";
+    case OP_CHECKMULTISIGVERIFY    : return "OP_CHECKMULTISIGVERIFY";
+
+    // expansion
+    case OP_NOP1                   : return "OP_NOP1";
+    case OP_NOP2                   : return "OP_NOP2";
+    case OP_NOP3                   : return "OP_NOP3";
+    case OP_NOP4                   : return "OP_NOP4";
+    case OP_NOP5                   : return "OP_NOP5";
+    case OP_NOP6                   : return "OP_NOP6";
+    case OP_NOP7                   : return "OP_NOP7";
+    case OP_NOP8                   : return "OP_NOP8";
+    case OP_NOP9                   : return "OP_NOP9";
+    case OP_NOP10                  : return "OP_NOP10";
+
+    case OP_INVALIDOPCODE          : return "OP_INVALIDOPCODE";
+
+    default:
+        return "OP_UNKNOWN";
+    }
+}
+
+unsigned int CScript::GetSigOpCount(bool fAccurate) const
+{
+    unsigned int n = 0;
+    const_iterator pc = begin();
+    opcodetype lastOpcode = OP_INVALIDOPCODE;
+    while (pc < end())
+    {
+        opcodetype opcode;
+        if (!GetOp(pc, opcode))
+            break;
+        if (opcode == OP_CHECKSIG || opcode == OP_CHECKSIGVERIFY)
+            n++;
+        else if (opcode == OP_CHECKMULTISIG || opcode == OP_CHECKMULTISIGVERIFY)
+        {
+            if (fAccurate && lastOpcode >= OP_1 && lastOpcode <= OP_16)
+                n += DecodeOP_N(lastOpcode);
+            else
+                n += 20;
+        }
+        lastOpcode = opcode;
+    }
+    return n;
+}
+
+unsigned int CScript::GetSigOpCount(const CScript& scriptSig) const
+{
+    if (!IsPayToScriptHash())
+        return GetSigOpCount(true);
+
+    // This is a pay-to-script-hash scriptPubKey;
+    // get the last item that the scriptSig
+    // pushes onto the stack:
+    const_iterator pc = scriptSig.begin();
+    vector<unsigned char> data;
+    while (pc < scriptSig.end())
+    {
+        opcodetype opcode;
+        if (!scriptSig.GetOp(pc, opcode, data))
+            return 0;
+        if (opcode > OP_16)
+            return 0;
+    }
+
+    /// ... and return its opcount:
+    CScript subscript(data.begin(), data.end());
+    return subscript.GetSigOpCount(true);
+}
+
+// insightexplorer
+// https://github.com/bitpay/bitcoin/commit/017f548ea6d89423ef568117447e61dd5707ec42#diff-f7ca24fb80ddba0f291cb66344ca6fcbR204
+bool CScript::IsPayToPublicKeyHash() const
+{
+    // Extra-fast test for pay-to-pubkey-hash CScripts:
+    return (this->size() == 25 &&
+	    (*this)[0] == OP_DUP &&
+	    (*this)[1] == OP_HASH160 &&
+	    (*this)[2] == 0x14 &&
+	    (*this)[23] == OP_EQUALVERIFY &&
+	    (*this)[24] == OP_CHECKSIG);
+}
+
+bool CScript::IsPayToScriptHash() const
+{
+    // Extra-fast test for pay-to-script-hash CScripts:
+    return (this->size() == 23 &&
+            (*this)[0] == OP_HASH160 &&
+            (*this)[1] == 0x14 &&
+            (*this)[22] == OP_EQUAL);
+}
+
+bool CScript::IsPushOnly(const_iterator pc) const
+{
+    while (pc < end())
+    {
+        opcodetype opcode;
+        if (!GetOp(pc, opcode))
+            return false;
+        // Note that IsPushOnly() *does* consider OP_RESERVED to be a
+        // push-type opcode, however execution of OP_RESERVED fails, so
+        // it's not relevant to P2SH/BIP62 as the scriptSig would fail prior to
+        // the P2SH special validation code being executed.
+        if (opcode > OP_16)
+            return false;
+    }
+    return true;
+}
+
+bool CScript::IsPushOnly() const
+{
+    return this->IsPushOnly(begin());
+}
+
+// insightexplorer
+CScript::ScriptType CScript::GetType() const
+{
+    if (this->IsPayToPublicKeyHash())
+        return CScript::P2PKH;
+    if (this->IsPayToScriptHash())
+        return CScript::P2SH;
+    // We don't know this script type
+    return CScript::UNKNOWN;
+}
+
+// insightexplorer
+uint160 CScript::AddressHash() const
+{
+    // where the address bytes begin depends on the script type
+    int start;
+    if (this->IsPayToPublicKeyHash())
+        start = 3;
+    else if (this->IsPayToScriptHash())
+        start = 2;
+    else {
+        // unknown script type; return zeros (this can happen)
+        vector<unsigned char> hashBytes;
+        hashBytes.resize(20);
+        return uint160(hashBytes);
+    }
+    vector<unsigned char> hashBytes(this->begin()+start, this->begin()+start+20);
+    return uint160(hashBytes);
+}
diff --git a/depend/zcash/src/script/script.h b/depend/zcash/src/script/script.h
new file mode 100644
index 000000000..b20227caf
--- /dev/null
+++ b/depend/zcash/src/script/script.h
@@ -0,0 +1,647 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_SCRIPT_SCRIPT_H
+#define BITCOIN_SCRIPT_SCRIPT_H
+
+#include "crypto/common.h"
+#include "prevector.h"
+
+#include <assert.h>
+#include <climits>
+#include <limits>
+#include <stdexcept>
+#include <stdint.h>
+#include <string.h>
+#include <string>
+#include <vector>
+
+#include "uint256.h"
+
+static const unsigned int MAX_SCRIPT_ELEMENT_SIZE = 520; // bytes
+
+// Maximum script length in bytes
+static const int MAX_SCRIPT_SIZE = 10000;
+
+// Threshold for nLockTime: below this value it is interpreted as block number,
+// otherwise as UNIX timestamp.
+static const unsigned int LOCKTIME_THRESHOLD = 500000000; // Tue Nov  5 00:53:20 1985 UTC
+
+template <typename T>
+std::vector<unsigned char> ToByteVector(const T& in)
+{
+    return std::vector<unsigned char>(in.begin(), in.end());
+}
+
+/** Script opcodes */
+enum opcodetype
+{
+    // push value
+    OP_0 = 0x00,
+    OP_FALSE = OP_0,
+    OP_PUSHDATA1 = 0x4c,
+    OP_PUSHDATA2 = 0x4d,
+    OP_PUSHDATA4 = 0x4e,
+    OP_1NEGATE = 0x4f,
+    OP_RESERVED = 0x50,
+    OP_1 = 0x51,
+    OP_TRUE=OP_1,
+    OP_2 = 0x52,
+    OP_3 = 0x53,
+    OP_4 = 0x54,
+    OP_5 = 0x55,
+    OP_6 = 0x56,
+    OP_7 = 0x57,
+    OP_8 = 0x58,
+    OP_9 = 0x59,
+    OP_10 = 0x5a,
+    OP_11 = 0x5b,
+    OP_12 = 0x5c,
+    OP_13 = 0x5d,
+    OP_14 = 0x5e,
+    OP_15 = 0x5f,
+    OP_16 = 0x60,
+
+    // control
+    OP_NOP = 0x61,
+    OP_VER = 0x62,
+    OP_IF = 0x63,
+    OP_NOTIF = 0x64,
+    OP_VERIF = 0x65,
+    OP_VERNOTIF = 0x66,
+    OP_ELSE = 0x67,
+    OP_ENDIF = 0x68,
+    OP_VERIFY = 0x69,
+    OP_RETURN = 0x6a,
+
+    // stack ops
+    OP_TOALTSTACK = 0x6b,
+    OP_FROMALTSTACK = 0x6c,
+    OP_2DROP = 0x6d,
+    OP_2DUP = 0x6e,
+    OP_3DUP = 0x6f,
+    OP_2OVER = 0x70,
+    OP_2ROT = 0x71,
+    OP_2SWAP = 0x72,
+    OP_IFDUP = 0x73,
+    OP_DEPTH = 0x74,
+    OP_DROP = 0x75,
+    OP_DUP = 0x76,
+    OP_NIP = 0x77,
+    OP_OVER = 0x78,
+    OP_PICK = 0x79,
+    OP_ROLL = 0x7a,
+    OP_ROT = 0x7b,
+    OP_SWAP = 0x7c,
+    OP_TUCK = 0x7d,
+
+    // splice ops
+    OP_CAT = 0x7e,
+    OP_SUBSTR = 0x7f,
+    OP_LEFT = 0x80,
+    OP_RIGHT = 0x81,
+    OP_SIZE = 0x82,
+
+    // bit logic
+    OP_INVERT = 0x83,
+    OP_AND = 0x84,
+    OP_OR = 0x85,
+    OP_XOR = 0x86,
+    OP_EQUAL = 0x87,
+    OP_EQUALVERIFY = 0x88,
+    OP_RESERVED1 = 0x89,
+    OP_RESERVED2 = 0x8a,
+
+    // numeric
+    OP_1ADD = 0x8b,
+    OP_1SUB = 0x8c,
+    OP_2MUL = 0x8d,
+    OP_2DIV = 0x8e,
+    OP_NEGATE = 0x8f,
+    OP_ABS = 0x90,
+    OP_NOT = 0x91,
+    OP_0NOTEQUAL = 0x92,
+
+    OP_ADD = 0x93,
+    OP_SUB = 0x94,
+    OP_MUL = 0x95,
+    OP_DIV = 0x96,
+    OP_MOD = 0x97,
+    OP_LSHIFT = 0x98,
+    OP_RSHIFT = 0x99,
+
+    OP_BOOLAND = 0x9a,
+    OP_BOOLOR = 0x9b,
+    OP_NUMEQUAL = 0x9c,
+    OP_NUMEQUALVERIFY = 0x9d,
+    OP_NUMNOTEQUAL = 0x9e,
+    OP_LESSTHAN = 0x9f,
+    OP_GREATERTHAN = 0xa0,
+    OP_LESSTHANOREQUAL = 0xa1,
+    OP_GREATERTHANOREQUAL = 0xa2,
+    OP_MIN = 0xa3,
+    OP_MAX = 0xa4,
+
+    OP_WITHIN = 0xa5,
+
+    // crypto
+    OP_RIPEMD160 = 0xa6,
+    OP_SHA1 = 0xa7,
+    OP_SHA256 = 0xa8,
+    OP_HASH160 = 0xa9,
+    OP_HASH256 = 0xaa,
+    OP_CODESEPARATOR = 0xab,
+    OP_CHECKSIG = 0xac,
+    OP_CHECKSIGVERIFY = 0xad,
+    OP_CHECKMULTISIG = 0xae,
+    OP_CHECKMULTISIGVERIFY = 0xaf,
+
+    // expansion
+    OP_NOP1 = 0xb0,
+    OP_NOP2 = 0xb1,
+    OP_CHECKLOCKTIMEVERIFY = OP_NOP2,
+    OP_NOP3 = 0xb2,
+    OP_NOP4 = 0xb3,
+    OP_NOP5 = 0xb4,
+    OP_NOP6 = 0xb5,
+    OP_NOP7 = 0xb6,
+    OP_NOP8 = 0xb7,
+    OP_NOP9 = 0xb8,
+    OP_NOP10 = 0xb9,
+
+    OP_INVALIDOPCODE = 0xff,
+};
+
+const char* GetOpName(opcodetype opcode);
+
+class scriptnum_error : public std::runtime_error
+{
+public:
+    explicit scriptnum_error(const std::string& str) : std::runtime_error(str) {}
+};
+
+class CScriptNum
+{
+/**
+ * Numeric opcodes (OP_1ADD, etc) are restricted to operating on 4-byte integers.
+ * The semantics are subtle, though: operands must be in the range [-2^31 +1...2^31 -1],
+ * but results may overflow (and are valid as long as they are not used in a subsequent
+ * numeric operation). CScriptNum enforces those semantics by storing results as
+ * an int64 and allowing out-of-range values to be returned as a vector of bytes but
+ * throwing an exception if arithmetic is done or the result is interpreted as an integer.
+ */
+public:
+
+    explicit CScriptNum(const int64_t& n)
+    {
+        m_value = n;
+    }
+
+    static const size_t nDefaultMaxNumSize = 4;
+
+    explicit CScriptNum(const std::vector<unsigned char>& vch, bool fRequireMinimal,
+                        const size_t nMaxNumSize = nDefaultMaxNumSize)
+    {
+        if (vch.size() > nMaxNumSize) {
+            throw scriptnum_error("script number overflow");
+        }
+        if (fRequireMinimal && vch.size() > 0) {
+            // Check that the number is encoded with the minimum possible
+            // number of bytes.
+            //
+            // If the most-significant-byte - excluding the sign bit - is zero
+            // then we're not minimal. Note how this test also rejects the
+            // negative-zero encoding, 0x80.
+            if ((vch.back() & 0x7f) == 0) {
+                // One exception: if there's more than one byte and the most
+                // significant bit of the second-most-significant-byte is set
+                // it would conflict with the sign bit. An example of this case
+                // is +-255, which encode to 0xff00 and 0xff80 respectively.
+                // (big-endian).
+                if (vch.size() <= 1 || (vch[vch.size() - 2] & 0x80) == 0) {
+                    throw scriptnum_error("non-minimally encoded script number");
+                }
+            }
+        }
+        m_value = set_vch(vch);
+    }
+
+    inline bool operator==(const int64_t& rhs)    const { return m_value == rhs; }
+    inline bool operator!=(const int64_t& rhs)    const { return m_value != rhs; }
+    inline bool operator<=(const int64_t& rhs)    const { return m_value <= rhs; }
+    inline bool operator< (const int64_t& rhs)    const { return m_value <  rhs; }
+    inline bool operator>=(const int64_t& rhs)    const { return m_value >= rhs; }
+    inline bool operator> (const int64_t& rhs)    const { return m_value >  rhs; }
+
+    inline bool operator==(const CScriptNum& rhs) const { return operator==(rhs.m_value); }
+    inline bool operator!=(const CScriptNum& rhs) const { return operator!=(rhs.m_value); }
+    inline bool operator<=(const CScriptNum& rhs) const { return operator<=(rhs.m_value); }
+    inline bool operator< (const CScriptNum& rhs) const { return operator< (rhs.m_value); }
+    inline bool operator>=(const CScriptNum& rhs) const { return operator>=(rhs.m_value); }
+    inline bool operator> (const CScriptNum& rhs) const { return operator> (rhs.m_value); }
+
+    inline CScriptNum operator+(   const int64_t& rhs)    const
+    {
+        assert(rhs == 0 || (rhs > 0 && m_value <= std::numeric_limits<int64_t>::max() - rhs) ||
+                           (rhs < 0 && m_value >= std::numeric_limits<int64_t>::min() - rhs));
+        return CScriptNum(m_value + rhs);
+    }
+
+    inline CScriptNum operator-(   const int64_t& rhs)    const
+    {
+        assert(rhs == 0 || (rhs > 0 && m_value >= std::numeric_limits<int64_t>::min() + rhs) ||
+                           (rhs < 0 && m_value <= std::numeric_limits<int64_t>::max() + rhs));
+        return CScriptNum(m_value - rhs);
+    }
+
+    inline CScriptNum operator+(   const CScriptNum& rhs) const { return operator+(rhs.m_value);   }
+    inline CScriptNum operator-(   const CScriptNum& rhs) const { return operator-(rhs.m_value);   }
+
+    inline CScriptNum& operator+=( const CScriptNum& rhs)       { return operator+=(rhs.m_value);  }
+    inline CScriptNum& operator-=( const CScriptNum& rhs)       { return operator-=(rhs.m_value);  }
+
+    inline CScriptNum operator-()                         const
+    {
+        assert(m_value != std::numeric_limits<int64_t>::min());
+        return CScriptNum(-m_value);
+    }
+
+    inline CScriptNum& operator=(  const int64_t& rhs)
+    {
+        m_value = rhs;
+        return *this;
+    }
+
+    inline CScriptNum& operator+=( const int64_t& rhs)
+    {
+        assert(rhs == 0 || (rhs > 0 && m_value <= std::numeric_limits<int64_t>::max() - rhs) ||
+                           (rhs < 0 && m_value >= std::numeric_limits<int64_t>::min() - rhs));
+        m_value += rhs;
+        return *this;
+    }
+
+    inline CScriptNum& operator-=( const int64_t& rhs)
+    {
+        assert(rhs == 0 || (rhs > 0 && m_value >= std::numeric_limits<int64_t>::min() + rhs) ||
+                           (rhs < 0 && m_value <= std::numeric_limits<int64_t>::max() + rhs));
+        m_value -= rhs;
+        return *this;
+    }
+
+    int getint() const
+    {
+        if (m_value > std::numeric_limits<int>::max())
+            return std::numeric_limits<int>::max();
+        else if (m_value < std::numeric_limits<int>::min())
+            return std::numeric_limits<int>::min();
+        return m_value;
+    }
+
+    std::vector<unsigned char> getvch() const
+    {
+        return serialize(m_value);
+    }
+
+    static std::vector<unsigned char> serialize(const int64_t& value)
+    {
+        if(value == 0)
+            return std::vector<unsigned char>();
+
+        if (value == INT64_MIN) {
+            // The code below is buggy, and produces the "wrong" result for
+            // INT64_MIN. To avoid undefined behavior while attempting to
+            // negate a value of INT64_MIN, we intentionally return the result
+            // that the code below would produce on an x86_64 system.
+            return {0,0,0,0,0,0,0,128,128};
+        }
+
+        std::vector<unsigned char> result;
+        const bool neg = value < 0;
+        uint64_t absvalue = neg ? -value : value;
+
+        while(absvalue)
+        {
+            result.push_back(absvalue & 0xff);
+            absvalue >>= 8;
+        }
+
+//    - If the most significant byte is >= 0x80 and the value is positive, push a
+//    new zero-byte to make the significant byte < 0x80 again.
+
+//    - If the most significant byte is >= 0x80 and the value is negative, push a
+//    new 0x80 byte that will be popped off when converting to an integral.
+
+//    - If the most significant byte is < 0x80 and the value is negative, add
+//    0x80 to it, since it will be subtracted and interpreted as a negative when
+//    converting to an integral.
+
+        if (result.back() & 0x80)
+            result.push_back(neg ? 0x80 : 0);
+        else if (neg)
+            result.back() |= 0x80;
+
+        return result;
+    }
+
+private:
+
+    static int64_t set_vch(const std::vector<unsigned char>& vch)
+    {
+      if (vch.empty())
+          return 0;
+
+      if (vch == std::vector<unsigned char>({0,0,0,0,0,0,0,128,128})) {
+          // On an x86_64 system, the code below would actually decode the buggy
+          // INT64_MIN encoding correctly. However in this case, it would be
+          // performing left shifts of a signed type by 64, which has undefined
+          // behavior.
+          return INT64_MIN;
+      }
+
+      // Guard against undefined behavior. INT64_MIN is the only allowed 9-byte encoding.
+      if (vch.size() > 8) {
+          throw scriptnum_error("script number overflow");
+      }
+
+      int64_t result = 0;
+      for (size_t i = 0; i != vch.size(); ++i)
+          result |= static_cast<int64_t>(vch[i]) << 8*i;
+
+      // If the input vector's most significant byte is 0x80, remove it from
+      // the result's msb and return a negative.
+      if (vch.back() & 0x80)
+          return -((int64_t)(result & ~(0x80ULL << (8 * (vch.size() - 1)))));
+
+      return result;
+    }
+
+    int64_t m_value;
+};
+
+typedef prevector<28, unsigned char> CScriptBase;
+
+/** Serialized script, used inside transaction inputs and outputs */
+class CScript : public CScriptBase
+{
+protected:
+    CScript& push_int64(int64_t n)
+    {
+        if (n == -1 || (n >= 1 && n <= 16))
+        {
+            push_back(n + (OP_1 - 1));
+        }
+        else if (n == 0)
+        {
+            push_back(OP_0);
+        }
+        else
+        {
+            *this << CScriptNum::serialize(n);
+        }
+        return *this;
+    }
+public:
+    CScript() { }
+    CScript(const CScript& b) : CScriptBase(b.begin(), b.end()) { }
+    CScript(const_iterator pbegin, const_iterator pend) : CScriptBase(pbegin, pend) { }
+    CScript(std::vector<unsigned char>::const_iterator pbegin, std::vector<unsigned char>::const_iterator pend) : CScriptBase(pbegin, pend) { }
+    CScript(const unsigned char* pbegin, const unsigned char* pend) : CScriptBase(pbegin, pend) { }
+
+    CScript& operator+=(const CScript& b)
+    {
+        insert(end(), b.begin(), b.end());
+        return *this;
+    }
+
+    friend CScript operator+(const CScript& a, const CScript& b)
+    {
+        CScript ret = a;
+        ret += b;
+        return ret;
+    }
+
+    CScript(int64_t b)        { operator<<(b); }
+
+    explicit CScript(opcodetype b)     { operator<<(b); }
+    explicit CScript(const CScriptNum& b) { operator<<(b); }
+    explicit CScript(const std::vector<unsigned char>& b) { operator<<(b); }
+
+
+    CScript& operator<<(int64_t b) { return push_int64(b); }
+
+    CScript& operator<<(opcodetype opcode)
+    {
+        if (opcode < 0 || opcode > 0xff)
+            throw std::runtime_error("CScript::operator<<(): invalid opcode");
+        insert(end(), (unsigned char)opcode);
+        return *this;
+    }
+
+    CScript& operator<<(const CScriptNum& b)
+    {
+        *this << b.getvch();
+        return *this;
+    }
+
+    CScript& operator<<(const std::vector<unsigned char>& b)
+    {
+        if (b.size() < OP_PUSHDATA1)
+        {
+            insert(end(), (unsigned char)b.size());
+        }
+        else if (b.size() <= 0xff)
+        {
+            insert(end(), OP_PUSHDATA1);
+            insert(end(), (unsigned char)b.size());
+        }
+        else if (b.size() <= 0xffff)
+        {
+            insert(end(), OP_PUSHDATA2);
+            uint8_t data[2];
+            WriteLE16(data, b.size());
+            insert(end(), data, data + sizeof(data));
+        }
+        else
+        {
+            insert(end(), OP_PUSHDATA4);
+            uint8_t data[4];
+            WriteLE32(data, b.size());
+            insert(end(), data, data + sizeof(data));
+        }
+        insert(end(), b.begin(), b.end());
+        return *this;
+    }
+
+    CScript& operator<<(const CScript& b)
+    {
+        // I'm not sure if this should push the script or concatenate scripts.
+        // If there's ever a use for pushing a script onto a script, delete this member fn
+        assert(!"Warning: Pushing a CScript onto a CScript with << is probably not intended, use + to concatenate!");
+        return *this;
+    }
+
+
+    bool GetOp(iterator& pc, opcodetype& opcodeRet, std::vector<unsigned char>& vchRet)
+    {
+         // Wrapper so it can be called with either iterator or const_iterator
+         const_iterator pc2 = pc;
+         bool fRet = GetOp2(pc2, opcodeRet, &vchRet);
+         pc = begin() + (pc2 - begin());
+         return fRet;
+    }
+
+    bool GetOp(iterator& pc, opcodetype& opcodeRet)
+    {
+         const_iterator pc2 = pc;
+         bool fRet = GetOp2(pc2, opcodeRet, NULL);
+         pc = begin() + (pc2 - begin());
+         return fRet;
+    }
+
+    bool GetOp(const_iterator& pc, opcodetype& opcodeRet, std::vector<unsigned char>& vchRet) const
+    {
+        return GetOp2(pc, opcodeRet, &vchRet);
+    }
+
+    bool GetOp(const_iterator& pc, opcodetype& opcodeRet) const
+    {
+        return GetOp2(pc, opcodeRet, NULL);
+    }
+
+    bool GetOp2(const_iterator& pc, opcodetype& opcodeRet, std::vector<unsigned char>* pvchRet) const
+    {
+        opcodeRet = OP_INVALIDOPCODE;
+        if (pvchRet)
+            pvchRet->clear();
+        if (pc >= end())
+            return false;
+
+        // Read instruction
+        if (end() - pc < 1)
+            return false;
+        unsigned int opcode = *pc++;
+
+        // Immediate operand
+        if (opcode <= OP_PUSHDATA4)
+        {
+            unsigned int nSize = 0;
+            if (opcode < OP_PUSHDATA1)
+            {
+                nSize = opcode;
+            }
+            else if (opcode == OP_PUSHDATA1)
+            {
+                if (end() - pc < 1)
+                    return false;
+                nSize = *pc++;
+            }
+            else if (opcode == OP_PUSHDATA2)
+            {
+                if (end() - pc < 2)
+                    return false;
+                nSize = ReadLE16(&pc[0]);
+                pc += 2;
+            }
+            else if (opcode == OP_PUSHDATA4)
+            {
+                if (end() - pc < 4)
+                    return false;
+                nSize = ReadLE32(&pc[0]);
+                pc += 4;
+            }
+            if (end() - pc < 0 || (unsigned int)(end() - pc) < nSize)
+                return false;
+            if (pvchRet)
+                pvchRet->assign(pc, pc + nSize);
+            pc += nSize;
+        }
+
+        opcodeRet = (opcodetype)opcode;
+        return true;
+    }
+
+    /** Encode/decode small integers: */
+    static int DecodeOP_N(opcodetype opcode)
+    {
+        if (opcode == OP_0)
+            return 0;
+        assert(opcode >= OP_1 && opcode <= OP_16);
+        return (int)opcode - (int)(OP_1 - 1);
+    }
+    static opcodetype EncodeOP_N(int n)
+    {
+        assert(n >= 0 && n <= 16);
+        if (n == 0)
+            return OP_0;
+        return (opcodetype)(OP_1+n-1);
+    }
+
+    /**
+     * Pre-version-0.6, Bitcoin always counted CHECKMULTISIGs
+     * as 20 sigops. With pay-to-script-hash, that changed:
+     * CHECKMULTISIGs serialized in scriptSigs are
+     * counted more accurately, assuming they are of the form
+     *  ... OP_N CHECKMULTISIG ...
+     */
+    unsigned int GetSigOpCount(bool fAccurate) const;
+
+    /**
+     * Accurately count sigOps, including sigOps in
+     * pay-to-script-hash transactions:
+     */
+    unsigned int GetSigOpCount(const CScript& scriptSig) const;
+
+    // insightexplorer, there may be more script types in the future
+    enum ScriptType : int {
+        UNKNOWN = 0,
+        P2PKH = 1,
+        P2SH = 2,
+    };
+    bool IsPayToPublicKeyHash() const;
+    bool IsPayToScriptHash() const;
+    ScriptType GetType() const;
+    uint160 AddressHash() const;
+
+    /** Called by IsStandardTx and P2SH/BIP62 VerifyScript (which makes it consensus-critical). */
+    bool IsPushOnly(const_iterator pc) const;
+    bool IsPushOnly() const;
+
+    /**
+     * Returns whether the script is guaranteed to fail at execution,
+     * regardless of the initial stack. This allows outputs to be pruned
+     * instantly when entering the UTXO set.
+     */
+    bool IsUnspendable() const
+    {
+        return (size() > 0 && *begin() == OP_RETURN) || (size() > MAX_SCRIPT_SIZE);
+    }
+
+    void clear()
+    {
+        // The default std::vector::clear() does not release memory.
+        CScriptBase().swap(*this);
+    }
+};
+
+/** A reference to a CScript: the Hash160 of its serialization */
+class CScriptID : public uint160
+{
+public:
+    CScriptID() : uint160() {}
+    explicit CScriptID(const CScript& in);
+    CScriptID(const uint160& in) : uint160(in) {}
+    explicit CScriptID(const std::vector<unsigned char>& vch) : uint160(vch) {}
+};
+
+class CReserveScript
+{
+public:
+    CScript reserveScript;
+    virtual void KeepScript() {}
+    CReserveScript() {}
+    virtual ~CReserveScript() {}
+};
+
+#endif // BITCOIN_SCRIPT_SCRIPT_H
diff --git a/depend/zcash/src/script/script_error.cpp b/depend/zcash/src/script/script_error.cpp
new file mode 100644
index 000000000..fa0cd1858
--- /dev/null
+++ b/depend/zcash/src/script/script_error.cpp
@@ -0,0 +1,75 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "script_error.h"
+
+const char* ScriptErrorString(const ScriptError serror)
+{
+    switch (serror)
+    {
+        case SCRIPT_ERR_OK:
+            return "No error";
+        case SCRIPT_ERR_EVAL_FALSE:
+            return "Script evaluated without error but finished with a false/empty top stack element";
+        case SCRIPT_ERR_VERIFY:
+            return "Script failed an OP_VERIFY operation";
+        case SCRIPT_ERR_EQUALVERIFY:
+            return "Script failed an OP_EQUALVERIFY operation";
+        case SCRIPT_ERR_CHECKMULTISIGVERIFY:
+            return "Script failed an OP_CHECKMULTISIGVERIFY operation";
+        case SCRIPT_ERR_CHECKSIGVERIFY:
+            return "Script failed an OP_CHECKSIGVERIFY operation";
+        case SCRIPT_ERR_NUMEQUALVERIFY:
+            return "Script failed an OP_NUMEQUALVERIFY operation";
+        case SCRIPT_ERR_SCRIPT_SIZE:
+            return "Script is too big";
+        case SCRIPT_ERR_PUSH_SIZE:
+            return "Push value size limit exceeded";
+        case SCRIPT_ERR_OP_COUNT:
+            return "Operation limit exceeded";
+        case SCRIPT_ERR_STACK_SIZE:
+            return "Stack size limit exceeded";
+        case SCRIPT_ERR_SIG_COUNT:
+            return "Signature count negative or greater than pubkey count";
+        case SCRIPT_ERR_PUBKEY_COUNT:
+            return "Pubkey count negative or limit exceeded";
+        case SCRIPT_ERR_BAD_OPCODE:
+            return "Opcode missing or not understood";
+        case SCRIPT_ERR_DISABLED_OPCODE:
+            return "Attempted to use a disabled opcode";
+        case SCRIPT_ERR_INVALID_STACK_OPERATION:
+            return "Operation not valid with the current stack size";
+        case SCRIPT_ERR_INVALID_ALTSTACK_OPERATION:
+            return "Operation not valid with the current altstack size";
+        case SCRIPT_ERR_OP_RETURN:
+            return "OP_RETURN was encountered";
+        case SCRIPT_ERR_UNBALANCED_CONDITIONAL:
+            return "Invalid OP_IF construction";
+        case SCRIPT_ERR_NEGATIVE_LOCKTIME:
+            return "Negative locktime";
+        case SCRIPT_ERR_UNSATISFIED_LOCKTIME:
+            return "Locktime requirement not satisfied";
+        case SCRIPT_ERR_SIG_HASHTYPE:
+            return "Signature hash type missing or not understood";
+        case SCRIPT_ERR_SIG_DER:
+            return "Non-canonical DER signature";
+        case SCRIPT_ERR_MINIMALDATA:
+            return "Data push larger than necessary";
+        case SCRIPT_ERR_SIG_PUSHONLY:
+            return "Only non-push operators allowed in signatures";
+        case SCRIPT_ERR_SIG_HIGH_S:
+            return "Non-canonical signature: S value is unnecessarily high";
+        case SCRIPT_ERR_SIG_NULLDUMMY:
+            return "Dummy CHECKMULTISIG argument must be zero";
+        case SCRIPT_ERR_DISCOURAGE_UPGRADABLE_NOPS:
+            return "NOPx reserved for soft-fork upgrades";
+        case SCRIPT_ERR_PUBKEYTYPE:
+            return "Public key is neither compressed or uncompressed";
+        case SCRIPT_ERR_UNKNOWN_ERROR:
+        case SCRIPT_ERR_ERROR_COUNT:
+        default: break;
+    }
+    return "unknown error";
+}
diff --git a/depend/zcash/src/script/script_error.h b/depend/zcash/src/script/script_error.h
new file mode 100644
index 000000000..cae125c13
--- /dev/null
+++ b/depend/zcash/src/script/script_error.h
@@ -0,0 +1,62 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_SCRIPT_SCRIPT_ERROR_H
+#define BITCOIN_SCRIPT_SCRIPT_ERROR_H
+
+typedef enum ScriptError_t
+{
+    SCRIPT_ERR_OK = 0,
+    SCRIPT_ERR_UNKNOWN_ERROR,
+    SCRIPT_ERR_EVAL_FALSE,
+    SCRIPT_ERR_OP_RETURN,
+
+    /* Max sizes */
+    SCRIPT_ERR_SCRIPT_SIZE,
+    SCRIPT_ERR_PUSH_SIZE,
+    SCRIPT_ERR_OP_COUNT,
+    SCRIPT_ERR_STACK_SIZE,
+    SCRIPT_ERR_SIG_COUNT,
+    SCRIPT_ERR_PUBKEY_COUNT,
+
+    /* Failed verify operations */
+    SCRIPT_ERR_VERIFY,
+    SCRIPT_ERR_EQUALVERIFY,
+    SCRIPT_ERR_CHECKMULTISIGVERIFY,
+    SCRIPT_ERR_CHECKSIGVERIFY,
+    SCRIPT_ERR_NUMEQUALVERIFY,
+
+    /* Logical/Format/Canonical errors */
+    SCRIPT_ERR_BAD_OPCODE,
+    SCRIPT_ERR_DISABLED_OPCODE,
+    SCRIPT_ERR_INVALID_STACK_OPERATION,
+    SCRIPT_ERR_INVALID_ALTSTACK_OPERATION,
+    SCRIPT_ERR_UNBALANCED_CONDITIONAL,
+
+    /* OP_CHECKLOCKTIMEVERIFY */
+    SCRIPT_ERR_NEGATIVE_LOCKTIME,
+    SCRIPT_ERR_UNSATISFIED_LOCKTIME,
+
+    /* BIP62 */
+    SCRIPT_ERR_SIG_HASHTYPE,
+    SCRIPT_ERR_SIG_DER,
+    SCRIPT_ERR_MINIMALDATA,
+    SCRIPT_ERR_SIG_PUSHONLY,
+    SCRIPT_ERR_SIG_HIGH_S,
+    SCRIPT_ERR_SIG_NULLDUMMY,
+    SCRIPT_ERR_PUBKEYTYPE,
+    SCRIPT_ERR_CLEANSTACK,
+
+    /* softfork safeness */
+    SCRIPT_ERR_DISCOURAGE_UPGRADABLE_NOPS,
+
+    SCRIPT_ERR_ERROR_COUNT
+} ScriptError;
+
+#define SCRIPT_ERR_LAST SCRIPT_ERR_ERROR_COUNT
+
+const char* ScriptErrorString(const ScriptError error);
+
+#endif // BITCOIN_SCRIPT_SCRIPT_ERROR_H
diff --git a/depend/zcash/src/script/sigcache.cpp b/depend/zcash/src/script/sigcache.cpp
new file mode 100644
index 000000000..50e475558
--- /dev/null
+++ b/depend/zcash/src/script/sigcache.cpp
@@ -0,0 +1,113 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "sigcache.h"
+
+#include "memusage.h"
+#include "pubkey.h"
+#include "random.h"
+#include "uint256.h"
+#include "util.h"
+
+#include <boost/thread.hpp>
+#include <boost/unordered_set.hpp>
+
+namespace {
+
+/**
+ * We're hashing a nonce into the entries themselves, so we don't need extra
+ * blinding in the set hash computation.
+ */
+class CSignatureCacheHasher
+{
+public:
+    size_t operator()(const uint256& key) const {
+        return key.GetCheapHash();
+    }
+};
+
+/**
+ * Valid signature cache, to avoid doing expensive ECDSA signature checking
+ * twice for every transaction (once when accepted into memory pool, and
+ * again when accepted into the block chain)
+ */
+class CSignatureCache
+{
+private:
+     //! Entries are SHA256(nonce || signature hash || public key || signature):
+    uint256 nonce;
+    typedef boost::unordered_set<uint256, CSignatureCacheHasher> map_type;
+    map_type setValid;
+    boost::shared_mutex cs_sigcache;
+
+
+public:
+    CSignatureCache()
+    {
+        GetRandBytes(nonce.begin(), 32);
+    }
+
+    void
+    ComputeEntry(uint256& entry, const uint256 &hash, const std::vector<unsigned char>& vchSig, const CPubKey& pubkey)
+    {
+        CSHA256().Write(nonce.begin(), 32).Write(hash.begin(), 32).Write(&pubkey[0], pubkey.size()).Write(&vchSig[0], vchSig.size()).Finalize(entry.begin());
+    }
+
+    bool
+    Get(const uint256& entry)
+    {
+        boost::shared_lock<boost::shared_mutex> lock(cs_sigcache);
+        return setValid.count(entry);
+    }
+
+    void Erase(const uint256& entry)
+    {
+        boost::unique_lock<boost::shared_mutex> lock(cs_sigcache);
+        setValid.erase(entry);
+    }
+
+    void Set(const uint256& entry)
+    {
+        size_t nMaxCacheSize = GetArg("-maxsigcachesize", DEFAULT_MAX_SIG_CACHE_SIZE) * ((size_t) 1 << 20);
+        if (nMaxCacheSize <= 0) return;
+
+        boost::unique_lock<boost::shared_mutex> lock(cs_sigcache);
+        while (memusage::DynamicUsage(setValid) > nMaxCacheSize)
+        {
+            map_type::size_type s = GetRand(setValid.bucket_count());
+            map_type::local_iterator it = setValid.begin(s);
+            if (it != setValid.end(s)) {
+                setValid.erase(*it);
+            }
+        }
+
+        setValid.insert(entry);
+    }
+};
+
+}
+
+bool CachingTransactionSignatureChecker::VerifySignature(const std::vector<unsigned char>& vchSig, const CPubKey& pubkey, const uint256& sighash) const
+{
+    static CSignatureCache signatureCache;
+
+    uint256 entry;
+    signatureCache.ComputeEntry(entry, sighash, vchSig, pubkey);
+
+    if (signatureCache.Get(entry)) {
+        if (!store) {
+            signatureCache.Erase(entry);
+        }
+        return true;
+    }
+
+    if (!TransactionSignatureChecker::VerifySignature(vchSig, pubkey, sighash))
+        return false;
+
+    if (store) {
+        signatureCache.Set(entry);
+    }
+    return true;
+}
diff --git a/depend/zcash/src/script/sigcache.h b/depend/zcash/src/script/sigcache.h
new file mode 100644
index 000000000..6191b19e5
--- /dev/null
+++ b/depend/zcash/src/script/sigcache.h
@@ -0,0 +1,30 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_SCRIPT_SIGCACHE_H
+#define BITCOIN_SCRIPT_SIGCACHE_H
+
+#include "script/interpreter.h"
+
+#include <vector>
+
+// DoS prevention: limit cache size to less than 40MB (over 500000
+// entries on 64-bit systems).
+static const unsigned int DEFAULT_MAX_SIG_CACHE_SIZE = 40;
+
+class CPubKey;
+
+class CachingTransactionSignatureChecker : public TransactionSignatureChecker
+{
+private:
+    bool store;
+
+public:
+    CachingTransactionSignatureChecker(const CTransaction* txToIn, PrecomputedTransactionData& txdataIn, unsigned int nInIn, const CAmount& amount, bool storeIn) : TransactionSignatureChecker(txToIn, txdataIn, nInIn, amount), store(storeIn) {}
+
+    bool VerifySignature(const std::vector<unsigned char>& vchSig, const CPubKey& vchPubKey, const uint256& sighash) const;
+};
+
+#endif // BITCOIN_SCRIPT_SIGCACHE_H
diff --git a/depend/zcash/src/script/sign.cpp b/depend/zcash/src/script/sign.cpp
new file mode 100644
index 000000000..ce77c73a1
--- /dev/null
+++ b/depend/zcash/src/script/sign.cpp
@@ -0,0 +1,386 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "script/sign.h"
+
+#include "key.h"
+#include "keystore.h"
+#include "policy/policy.h"
+#include "primitives/transaction.h"
+#include "script/standard.h"
+#include "uint256.h"
+
+
+using namespace std;
+
+typedef std::vector<unsigned char> valtype;
+
+TransactionSignatureCreator::TransactionSignatureCreator(const CKeyStore* keystoreIn, const CTransaction* txToIn, const PrecomputedTransactionData& txToDataIn, unsigned int nInIn, const CAmount& amountIn, int nHashTypeIn) : BaseSignatureCreator(keystoreIn), txTo(txToIn), txToData(txToDataIn), nIn(nInIn), nHashType(nHashTypeIn), amount(amountIn), checker(txTo, txToDataIn, nIn, amountIn) {}
+
+bool TransactionSignatureCreator::CreateSig(std::vector<unsigned char>& vchSig, const CKeyID& address, const CScript& scriptCode, uint32_t consensusBranchId) const
+{
+    CKey key;
+    if (!keystore->GetKey(address, key))
+        return false;
+
+    uint256 hash;
+    try {
+        hash = SignatureHash(scriptCode, *txTo, nIn, nHashType, amount, consensusBranchId, txToData);
+    } catch (logic_error ex) {
+        return false;
+    }
+
+    if (!key.Sign(hash, vchSig))
+        return false;
+    vchSig.push_back((unsigned char)nHashType);
+    return true;
+}
+
+static bool Sign1(const CKeyID& address, const BaseSignatureCreator& creator, const CScript& scriptCode, std::vector<valtype>& ret, uint32_t consensusBranchId)
+{
+    vector<unsigned char> vchSig;
+    if (!creator.CreateSig(vchSig, address, scriptCode, consensusBranchId))
+        return false;
+    ret.push_back(vchSig);
+    return true;
+}
+
+static bool SignN(const vector<valtype>& multisigdata, const BaseSignatureCreator& creator, const CScript& scriptCode, std::vector<valtype>& ret, uint32_t consensusBranchId)
+{
+    int nSigned = 0;
+    int nRequired = multisigdata.front()[0];
+    for (unsigned int i = 1; i < multisigdata.size()-1 && nSigned < nRequired; i++)
+    {
+        const valtype& pubkey = multisigdata[i];
+        CKeyID keyID = CPubKey(pubkey).GetID();
+        if (Sign1(keyID, creator, scriptCode, ret, consensusBranchId))
+            ++nSigned;
+    }
+    return nSigned==nRequired;
+}
+
+/**
+ * Sign scriptPubKey using signature made with creator.
+ * Signatures are returned in scriptSigRet (or returns false if scriptPubKey can't be signed),
+ * unless whichTypeRet is TX_SCRIPTHASH, in which case scriptSigRet is the redemption script.
+ * Returns false if scriptPubKey could not be completely satisfied.
+ */
+static bool SignStep(const BaseSignatureCreator& creator, const CScript& scriptPubKey,
+                     std::vector<valtype>& ret, txnouttype& whichTypeRet, uint32_t consensusBranchId)
+{
+    CScript scriptRet;
+    uint160 h160;
+    ret.clear();
+
+    vector<valtype> vSolutions;
+    if (!Solver(scriptPubKey, whichTypeRet, vSolutions))
+        return false;
+
+    CKeyID keyID;
+    switch (whichTypeRet)
+    {
+    case TX_NONSTANDARD:
+    case TX_NULL_DATA:
+        return false;
+    case TX_PUBKEY:
+        keyID = CPubKey(vSolutions[0]).GetID();
+        return Sign1(keyID, creator, scriptPubKey, ret, consensusBranchId);
+    case TX_PUBKEYHASH:
+        keyID = CKeyID(uint160(vSolutions[0]));
+        if (!Sign1(keyID, creator, scriptPubKey, ret, consensusBranchId))
+            return false;
+        else
+        {
+            CPubKey vch;
+            creator.KeyStore().GetPubKey(keyID, vch);
+            ret.push_back(ToByteVector(vch));
+        }
+        return true;
+    case TX_SCRIPTHASH:
+        if (creator.KeyStore().GetCScript(uint160(vSolutions[0]), scriptRet)) {
+            ret.push_back(std::vector<unsigned char>(scriptRet.begin(), scriptRet.end()));
+            return true;
+        }
+        return false;
+
+    case TX_MULTISIG:
+        ret.push_back(valtype()); // workaround CHECKMULTISIG bug
+        return (SignN(vSolutions, creator, scriptPubKey, ret, consensusBranchId));
+
+    default:
+        return false;
+    }
+}
+
+static CScript PushAll(const vector<valtype>& values)
+{
+    CScript result;
+    for (const valtype& v : values) {
+        if (v.size() == 0) {
+            result << OP_0;
+        } else if (v.size() == 1 && v[0] >= 1 && v[0] <= 16) {
+            result << CScript::EncodeOP_N(v[0]);
+        } else {
+            result << v;
+        }
+    }
+    return result;
+}
+
+bool ProduceSignature(const BaseSignatureCreator& creator, const CScript& fromPubKey, SignatureData& sigdata, uint32_t consensusBranchId)
+{
+    CScript script = fromPubKey;
+    bool solved = true;
+    std::vector<valtype> result;
+    txnouttype whichType;
+    solved = SignStep(creator, script, result, whichType, consensusBranchId);
+    CScript subscript;
+
+    if (solved && whichType == TX_SCRIPTHASH)
+    {
+        // Solver returns the subscript that needs to be evaluated;
+        // the final scriptSig is the signatures from that
+        // and then the serialized subscript:
+        script = subscript = CScript(result[0].begin(), result[0].end());
+        solved = solved && SignStep(creator, script, result, whichType, consensusBranchId) && whichType != TX_SCRIPTHASH;
+        result.push_back(std::vector<unsigned char>(subscript.begin(), subscript.end()));
+    }
+
+    sigdata.scriptSig = PushAll(result);
+
+    // Test solution
+    return solved && VerifyScript(sigdata.scriptSig, fromPubKey, STANDARD_SCRIPT_VERIFY_FLAGS, creator.Checker(), consensusBranchId);
+}
+
+SignatureData DataFromTransaction(const CMutableTransaction& tx, unsigned int nIn)
+{
+    SignatureData data;
+    assert(tx.vin.size() > nIn);
+    data.scriptSig = tx.vin[nIn].scriptSig;
+    return data;
+}
+
+void UpdateTransaction(CMutableTransaction& tx, unsigned int nIn, const SignatureData& data)
+{
+    assert(tx.vin.size() > nIn);
+    tx.vin[nIn].scriptSig = data.scriptSig;
+}
+
+bool SignSignature(
+    const CKeyStore &keystore,
+    const CScript& fromPubKey,
+    CMutableTransaction& txTo,
+    const PrecomputedTransactionData& txToData,
+    unsigned int nIn,
+    const CAmount& amount,
+    int nHashType,
+    uint32_t consensusBranchId)
+{
+    assert(nIn < txTo.vin.size());
+
+    CTransaction txToConst(txTo);
+    TransactionSignatureCreator creator(&keystore, &txToConst, txToData, nIn, amount, nHashType);
+
+    SignatureData sigdata;
+    bool ret = ProduceSignature(creator, fromPubKey, sigdata, consensusBranchId);
+    UpdateTransaction(txTo, nIn, sigdata);
+    return ret;
+}
+
+bool SignSignature(
+    const CKeyStore &keystore,
+    const CTransaction& txFrom,
+    CMutableTransaction& txTo,
+    const PrecomputedTransactionData& txToData,
+    unsigned int nIn,
+    int nHashType,
+    uint32_t consensusBranchId)
+{
+    assert(nIn < txTo.vin.size());
+    CTxIn& txin = txTo.vin[nIn];
+    assert(txin.prevout.n < txFrom.vout.size());
+    const CTxOut& txout = txFrom.vout[txin.prevout.n];
+
+    return SignSignature(keystore, txout.scriptPubKey, txTo, txToData, nIn, txout.nValue, nHashType, consensusBranchId);
+}
+
+static vector<valtype> CombineMultisig(const CScript& scriptPubKey, const BaseSignatureChecker& checker,
+                               const vector<valtype>& vSolutions,
+                               const vector<valtype>& sigs1, const vector<valtype>& sigs2, uint32_t consensusBranchId)
+{
+    // Combine all the signatures we've got:
+    set<valtype> allsigs;
+    for (const valtype& v : sigs1)
+    {
+        if (!v.empty())
+            allsigs.insert(v);
+    }
+    for (const valtype& v : sigs2)
+    {
+        if (!v.empty())
+            allsigs.insert(v);
+    }
+
+    // Build a map of pubkey -> signature by matching sigs to pubkeys:
+    assert(vSolutions.size() > 1);
+    unsigned int nSigsRequired = vSolutions.front()[0];
+    unsigned int nPubKeys = vSolutions.size()-2;
+    map<valtype, valtype> sigs;
+    for (const valtype& sig : allsigs)
+    {
+        for (unsigned int i = 0; i < nPubKeys; i++)
+        {
+            const valtype& pubkey = vSolutions[i+1];
+            if (sigs.count(pubkey))
+                continue; // Already got a sig for this pubkey
+
+            if (checker.CheckSig(sig, pubkey, scriptPubKey, consensusBranchId))
+            {
+                sigs[pubkey] = sig;
+                break;
+            }
+        }
+    }
+    // Now build a merged CScript:
+    unsigned int nSigsHave = 0;
+    std::vector<valtype> result; result.push_back(valtype()); // pop-one-too-many workaround
+    for (unsigned int i = 0; i < nPubKeys && nSigsHave < nSigsRequired; i++)
+    {
+        if (sigs.count(vSolutions[i+1]))
+        {
+            result.push_back(sigs[vSolutions[i+1]]);
+            ++nSigsHave;
+        }
+    }
+    // Fill any missing with OP_0:
+    for (unsigned int i = nSigsHave; i < nSigsRequired; i++)
+        result.push_back(valtype());
+
+    return result;
+}
+
+namespace
+{
+struct Stacks
+{
+    std::vector<valtype> script;
+
+    Stacks() {}
+    explicit Stacks(const std::vector<valtype>& scriptSigStack_) : script(scriptSigStack_) {}
+    explicit Stacks(const SignatureData& data, uint32_t consensusBranchId) {
+        EvalScript(script, data.scriptSig, SCRIPT_VERIFY_STRICTENC, BaseSignatureChecker(), consensusBranchId);
+    }
+
+    SignatureData Output() const {
+        SignatureData result;
+        result.scriptSig = PushAll(script);
+        return result;
+    }
+};
+}
+
+static Stacks CombineSignatures(const CScript& scriptPubKey, const BaseSignatureChecker& checker,
+                                 const txnouttype txType, const vector<valtype>& vSolutions,
+                                 Stacks sigs1, Stacks sigs2, uint32_t consensusBranchId)
+{
+    switch (txType)
+    {
+    case TX_NONSTANDARD:
+    case TX_NULL_DATA:
+        // Don't know anything about this, assume bigger one is correct:
+        if (sigs1.script.size() >= sigs2.script.size())
+            return sigs1;
+        return sigs2;
+    case TX_PUBKEY:
+    case TX_PUBKEYHASH:
+        // Signatures are bigger than placeholders or empty scripts:
+        if (sigs1.script.empty() || sigs1.script[0].empty())
+            return sigs2;
+        return sigs1;
+    case TX_SCRIPTHASH:
+        if (sigs1.script.empty() || sigs1.script.back().empty())
+            return sigs2;
+        else if (sigs2.script.empty() || sigs2.script.back().empty())
+            return sigs1;
+        else
+        {
+            // Recur to combine:
+            valtype spk = sigs1.script.back();
+            CScript pubKey2(spk.begin(), spk.end());
+
+            txnouttype txType2;
+            vector<vector<unsigned char> > vSolutions2;
+            Solver(pubKey2, txType2, vSolutions2);
+            sigs1.script.pop_back();
+            sigs2.script.pop_back();
+            Stacks result = CombineSignatures(pubKey2, checker, txType2, vSolutions2, sigs1, sigs2, consensusBranchId);
+            result.script.push_back(spk);
+            return result;
+        }
+    case TX_MULTISIG:
+        return Stacks(CombineMultisig(scriptPubKey, checker, vSolutions, sigs1.script, sigs2.script, consensusBranchId));
+    default:
+        return Stacks();
+    }
+}
+
+SignatureData CombineSignatures(const CScript& scriptPubKey, const BaseSignatureChecker& checker,
+                          const SignatureData& scriptSig1, const SignatureData& scriptSig2,
+                          uint32_t consensusBranchId)
+{
+    txnouttype txType;
+    vector<vector<unsigned char> > vSolutions;
+    Solver(scriptPubKey, txType, vSolutions);
+
+    return CombineSignatures(
+        scriptPubKey, checker, txType, vSolutions,
+        Stacks(scriptSig1, consensusBranchId),
+        Stacks(scriptSig2, consensusBranchId),
+        consensusBranchId).Output();
+}
+
+namespace {
+/** Dummy signature checker which accepts all signatures. */
+class DummySignatureChecker : public BaseSignatureChecker
+{
+public:
+    DummySignatureChecker() {}
+
+    bool CheckSig(
+        const std::vector<unsigned char>& scriptSig,
+        const std::vector<unsigned char>& vchPubKey,
+        const CScript& scriptCode,
+        uint32_t consensusBranchId) const
+    {
+        return true;
+    }
+};
+const DummySignatureChecker dummyChecker;
+}
+
+const BaseSignatureChecker& DummySignatureCreator::Checker() const
+{
+    return dummyChecker;
+}
+
+bool DummySignatureCreator::CreateSig(
+    std::vector<unsigned char>& vchSig,
+    const CKeyID& keyid,
+    const CScript& scriptCode,
+    uint32_t consensusBranchId) const
+{
+    // Create a dummy signature that is a valid DER-encoding
+    vchSig.assign(72, '\000');
+    vchSig[0] = 0x30;
+    vchSig[1] = 69;
+    vchSig[2] = 0x02;
+    vchSig[3] = 33;
+    vchSig[4] = 0x01;
+    vchSig[4 + 33] = 0x02;
+    vchSig[5 + 33] = 32;
+    vchSig[6 + 33] = 0x01;
+    vchSig[6 + 33 + 32] = SIGHASH_ALL;
+    return true;
+}
diff --git a/depend/zcash/src/script/sign.h b/depend/zcash/src/script/sign.h
new file mode 100644
index 000000000..fcf0fbd3d
--- /dev/null
+++ b/depend/zcash/src/script/sign.h
@@ -0,0 +1,104 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_SCRIPT_SIGN_H
+#define BITCOIN_SCRIPT_SIGN_H
+
+#include "script/interpreter.h"
+
+class CKeyID;
+class CKeyStore;
+class CScript;
+class CTransaction;
+
+struct CMutableTransaction;
+
+/** Virtual base class for signature creators. */
+class BaseSignatureCreator {
+protected:
+    const CKeyStore* keystore;
+
+public:
+    BaseSignatureCreator(const CKeyStore* keystoreIn) : keystore(keystoreIn) {}
+    const CKeyStore& KeyStore() const { return *keystore; };
+    virtual ~BaseSignatureCreator() {}
+    virtual const BaseSignatureChecker& Checker() const =0;
+
+    /** Create a singular (non-script) signature. */
+    virtual bool CreateSig(std::vector<unsigned char>& vchSig, const CKeyID& keyid, const CScript& scriptCode, uint32_t consensusBranchId) const =0;
+};
+
+/** A signature creator for transactions. */
+class TransactionSignatureCreator : public BaseSignatureCreator {
+    const CTransaction* txTo;
+    const PrecomputedTransactionData& txToData;
+    unsigned int nIn;
+    int nHashType;
+    CAmount amount;
+    const TransactionSignatureChecker checker;
+
+public:
+    TransactionSignatureCreator(const CKeyStore* keystoreIn, const CTransaction* txToIn, const PrecomputedTransactionData& txToDataIn, unsigned int nInIn, const CAmount& amountIn, int nHashTypeIn=SIGHASH_ALL);
+    const BaseSignatureChecker& Checker() const { return checker; }
+    bool CreateSig(std::vector<unsigned char>& vchSig, const CKeyID& keyid, const CScript& scriptCode, uint32_t consensusBranchId) const;
+};
+
+class MutableTransactionSignatureCreator : public TransactionSignatureCreator {
+    CTransaction tx;
+
+public:
+    MutableTransactionSignatureCreator(const CKeyStore* keystoreIn, const CMutableTransaction* txToIn, const PrecomputedTransactionData& txdataIn, unsigned int nInIn, const CAmount& amount, int nHashTypeIn) : TransactionSignatureCreator(keystoreIn, &tx, txdataIn, nInIn, amount, nHashTypeIn), tx(*txToIn) {}
+};
+
+/** A signature creator that just produces 72-byte empty signatures. */
+class DummySignatureCreator : public BaseSignatureCreator {
+public:
+    DummySignatureCreator(const CKeyStore* keystoreIn) : BaseSignatureCreator(keystoreIn) {}
+    const BaseSignatureChecker& Checker() const;
+    bool CreateSig(std::vector<unsigned char>& vchSig, const CKeyID& keyid, const CScript& scriptCode, uint32_t consensusBranchId) const;
+};
+
+struct SignatureData {
+    CScript scriptSig;
+
+    SignatureData() {}
+    explicit SignatureData(const CScript& script) : scriptSig(script) {}
+};
+
+/** Produce a script signature using a generic signature creator. */
+bool ProduceSignature(const BaseSignatureCreator& creator, const CScript& scriptPubKey, SignatureData& sigdata, uint32_t consensusBranchId);
+
+/** Produce a script signature for a transaction. */
+bool SignSignature(
+    const CKeyStore &keystore,
+    const CScript& fromPubKey,
+    CMutableTransaction& txTo,
+    const PrecomputedTransactionData& txToData,
+    unsigned int nIn,
+    const CAmount& amount,
+    int nHashType,
+    uint32_t consensusBranchId);
+bool SignSignature(
+    const CKeyStore& keystore,
+    const CTransaction& txFrom,
+    CMutableTransaction& txTo,
+    const PrecomputedTransactionData& txToData,
+    unsigned int nIn,
+    int nHashType,
+    uint32_t consensusBranchId);
+
+/** Combine two script signatures using a generic signature checker, intelligently, possibly with OP_0 placeholders. */
+SignatureData CombineSignatures(
+    const CScript& scriptPubKey,
+    const BaseSignatureChecker& checker,
+    const SignatureData& scriptSig1,
+    const SignatureData& scriptSig2,
+    uint32_t consensusBranchId);
+
+/** Extract signature data from a transaction, and insert it. */
+SignatureData DataFromTransaction(const CMutableTransaction& tx, unsigned int nIn);
+void UpdateTransaction(CMutableTransaction& tx, unsigned int nIn, const SignatureData& data);
+
+#endif // BITCOIN_SCRIPT_SIGN_H
diff --git a/depend/zcash/src/script/standard.cpp b/depend/zcash/src/script/standard.cpp
new file mode 100644
index 000000000..853ffe957
--- /dev/null
+++ b/depend/zcash/src/script/standard.cpp
@@ -0,0 +1,304 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "script/standard.h"
+
+#include "pubkey.h"
+#include "script/script.h"
+#include "util.h"
+#include "utilstrencodings.h"
+
+
+using namespace std;
+
+typedef vector<unsigned char> valtype;
+
+bool fAcceptDatacarrier = DEFAULT_ACCEPT_DATACARRIER;
+unsigned nMaxDatacarrierBytes = MAX_OP_RETURN_RELAY;
+
+CScriptID::CScriptID(const CScript& in) : uint160(Hash160(in.begin(), in.end())) {}
+
+const char* GetTxnOutputType(txnouttype t)
+{
+    switch (t)
+    {
+    case TX_NONSTANDARD: return "nonstandard";
+    case TX_PUBKEY: return "pubkey";
+    case TX_PUBKEYHASH: return "pubkeyhash";
+    case TX_SCRIPTHASH: return "scripthash";
+    case TX_MULTISIG: return "multisig";
+    case TX_NULL_DATA: return "nulldata";
+    }
+    return NULL;
+}
+
+static bool MatchPayToPubkey(const CScript& script, valtype& pubkey)
+{
+    if (script.size() == CPubKey::PUBLIC_KEY_SIZE + 2 && script[0] == CPubKey::PUBLIC_KEY_SIZE && script.back() == OP_CHECKSIG) {
+        pubkey = valtype(script.begin() + 1, script.begin() + CPubKey::PUBLIC_KEY_SIZE + 1);
+        return CPubKey::ValidSize(pubkey);
+    }
+    if (script.size() == CPubKey::COMPRESSED_PUBLIC_KEY_SIZE + 2 && script[0] == CPubKey::COMPRESSED_PUBLIC_KEY_SIZE && script.back() == OP_CHECKSIG) {
+        pubkey = valtype(script.begin() + 1, script.begin() + CPubKey::COMPRESSED_PUBLIC_KEY_SIZE + 1);
+        return CPubKey::ValidSize(pubkey);
+    }
+    return false;
+}
+
+static bool MatchPayToPubkeyHash(const CScript& script, valtype& pubkeyhash)
+{
+    if (script.size() == 25 && script[0] == OP_DUP && script[1] == OP_HASH160 && script[2] == 20 && script[23] == OP_EQUALVERIFY && script[24] == OP_CHECKSIG) {
+        pubkeyhash = valtype(script.begin () + 3, script.begin() + 23);
+        return true;
+    }
+    return false;
+}
+
+/** Test for "small positive integer" script opcodes - OP_1 through OP_16. */
+static constexpr bool IsSmallInteger(opcodetype opcode)
+{
+    return opcode >= OP_1 && opcode <= OP_16;
+}
+
+static bool MatchMultisig(const CScript& script, unsigned int& required, std::vector<valtype>& pubkeys)
+{
+    opcodetype opcode;
+    valtype data;
+    CScript::const_iterator it = script.begin();
+    if (script.size() < 1 || script.back() != OP_CHECKMULTISIG) return false;
+
+    if (!script.GetOp(it, opcode, data) || !IsSmallInteger(opcode)) return false;
+    required = CScript::DecodeOP_N(opcode);
+    while (script.GetOp(it, opcode, data) && CPubKey::ValidSize(data)) {
+        pubkeys.emplace_back(std::move(data));
+    }
+    if (!IsSmallInteger(opcode)) return false;
+    unsigned int keys = CScript::DecodeOP_N(opcode);
+    if (pubkeys.size() != keys || keys < required) return false;
+    return (it + 1 == script.end());
+}
+
+bool Solver(const CScript& scriptPubKey, txnouttype& typeRet, std::vector<std::vector<unsigned char> >& vSolutionsRet)
+{
+    vSolutionsRet.clear();
+
+    // Shortcut for pay-to-script-hash, which are more constrained than the other types:
+    // it is always OP_HASH160 20 [20 byte hash] OP_EQUAL
+    if (scriptPubKey.IsPayToScriptHash())
+    {
+        typeRet = TX_SCRIPTHASH;
+        vector<unsigned char> hashBytes(scriptPubKey.begin()+2, scriptPubKey.begin()+22);
+        vSolutionsRet.push_back(hashBytes);
+        return true;
+    }
+
+    // Provably prunable, data-carrying output
+    //
+    // So long as script passes the IsUnspendable() test and all but the first
+    // byte passes the IsPushOnly() test we don't care what exactly is in the
+    // script.
+    if (scriptPubKey.size() >= 1 && scriptPubKey[0] == OP_RETURN && scriptPubKey.IsPushOnly(scriptPubKey.begin()+1)) {
+        typeRet = TX_NULL_DATA;
+        return true;
+    }
+
+    std::vector<unsigned char> data;
+    if (MatchPayToPubkey(scriptPubKey, data)) {
+        typeRet = TX_PUBKEY;
+        vSolutionsRet.push_back(std::move(data));
+        return true;
+    }
+
+    if (MatchPayToPubkeyHash(scriptPubKey, data)) {
+        typeRet = TX_PUBKEYHASH;
+        vSolutionsRet.push_back(std::move(data));
+        return true;
+    }
+
+    unsigned int required;
+    std::vector<std::vector<unsigned char>> keys;
+    if (MatchMultisig(scriptPubKey, required, keys)) {
+        typeRet = TX_MULTISIG;
+        vSolutionsRet.push_back({static_cast<unsigned char>(required)}); // safe as required is in range 1..16
+        vSolutionsRet.insert(vSolutionsRet.end(), keys.begin(), keys.end());
+        vSolutionsRet.push_back({static_cast<unsigned char>(keys.size())}); // safe as size is in range 1..16
+        return true;
+    }
+
+    vSolutionsRet.clear();
+    typeRet = TX_NONSTANDARD;
+    return false;
+}
+
+int ScriptSigArgsExpected(txnouttype t, const std::vector<std::vector<unsigned char> >& vSolutions)
+{
+    switch (t)
+    {
+    case TX_NONSTANDARD:
+    case TX_NULL_DATA:
+        return -1;
+    case TX_PUBKEY:
+        return 1;
+    case TX_PUBKEYHASH:
+        return 2;
+    case TX_MULTISIG:
+        if (vSolutions.size() < 1 || vSolutions[0].size() < 1)
+            return -1;
+        return vSolutions[0][0] + 1;
+    case TX_SCRIPTHASH:
+        return 1; // doesn't include args needed by the script
+    }
+    return -1;
+}
+
+bool ExtractDestination(const CScript& scriptPubKey, CTxDestination& addressRet)
+{
+    vector<valtype> vSolutions;
+    txnouttype whichType;
+    if (!Solver(scriptPubKey, whichType, vSolutions))
+        return false;
+
+    if (whichType == TX_PUBKEY)
+    {
+        CPubKey pubKey(vSolutions[0]);
+        if (!pubKey.IsValid())
+            return false;
+
+        addressRet = pubKey.GetID();
+        return true;
+    }
+    else if (whichType == TX_PUBKEYHASH)
+    {
+        addressRet = CKeyID(uint160(vSolutions[0]));
+        return true;
+    }
+    else if (whichType == TX_SCRIPTHASH)
+    {
+        addressRet = CScriptID(uint160(vSolutions[0]));
+        return true;
+    }
+    // Multisig txns have more than one address...
+    return false;
+}
+
+bool ExtractDestinations(const CScript& scriptPubKey, txnouttype& typeRet, vector<CTxDestination>& addressRet, int& nRequiredRet)
+{
+    addressRet.clear();
+    typeRet = TX_NONSTANDARD;
+    vector<valtype> vSolutions;
+    if (!Solver(scriptPubKey, typeRet, vSolutions))
+        return false;
+    if (typeRet == TX_NULL_DATA){
+        // This is data, not addresses
+        return false;
+    }
+
+    if (typeRet == TX_MULTISIG)
+    {
+        nRequiredRet = vSolutions.front()[0];
+        for (unsigned int i = 1; i < vSolutions.size()-1; i++)
+        {
+            CPubKey pubKey(vSolutions[i]);
+            if (!pubKey.IsValid())
+                continue;
+
+            CTxDestination address = pubKey.GetID();
+            addressRet.push_back(address);
+        }
+
+        if (addressRet.empty())
+            return false;
+    }
+    else
+    {
+        nRequiredRet = 1;
+        CTxDestination address;
+        if (!ExtractDestination(scriptPubKey, address))
+           return false;
+        addressRet.push_back(address);
+    }
+
+    return true;
+}
+
+namespace
+{
+class CScriptVisitor
+{
+private:
+    CScript *script;
+public:
+    CScriptVisitor(CScript *scriptin) { script = scriptin; }
+
+    bool operator()(const CNoDestination &dest) const {
+        script->clear();
+        return false;
+    }
+
+    bool operator()(const CKeyID &keyID) const {
+        script->clear();
+        *script << OP_DUP << OP_HASH160 << ToByteVector(keyID) << OP_EQUALVERIFY << OP_CHECKSIG;
+        return true;
+    }
+
+    bool operator()(const CScriptID &scriptID) const {
+        script->clear();
+        *script << OP_HASH160 << ToByteVector(scriptID) << OP_EQUAL;
+        return true;
+    }
+};
+}
+
+CScript GetScriptForDestination(const CTxDestination& dest)
+{
+    CScript script;
+
+    std::visit(CScriptVisitor(&script), dest);
+    return script;
+}
+
+CScript GetScriptForRawPubKey(const CPubKey& pubKey)
+{
+    return CScript() << std::vector<unsigned char>(pubKey.begin(), pubKey.end()) << OP_CHECKSIG;
+}
+
+CScript GetScriptForMultisig(int nRequired, const std::vector<CPubKey>& keys)
+{
+    CScript script;
+
+    script << CScript::EncodeOP_N(nRequired);
+    for (const CPubKey& key : keys)
+        script << ToByteVector(key);
+    script << CScript::EncodeOP_N(keys.size()) << OP_CHECKMULTISIG;
+    return script;
+}
+
+bool IsValidDestination(const CTxDestination& dest) {
+    return !std::holds_alternative<CNoDestination>(dest);
+}
+
+bool IsKeyDestination(const CTxDestination& dest) {
+    return std::holds_alternative<CKeyID>(dest);
+}
+
+bool IsScriptDestination(const CTxDestination& dest) {
+    return std::holds_alternative<CScriptID>(dest);
+}
+
+// insightexplorer
+CTxDestination DestFromAddressHash(int scriptType, uint160& addressHash)
+{
+    switch (scriptType) {
+    case CScript::P2PKH:
+        return CTxDestination(CKeyID(addressHash));
+    case CScript::P2SH:
+        return CTxDestination(CScriptID(addressHash));
+    default:
+        // This probably won't ever happen, because it would mean that
+        // the addressindex contains a type (say, 3) that we (currently)
+        // don't recognize; maybe we "dropped support" for it?
+        return CNoDestination();
+    }
+}
diff --git a/depend/zcash/src/script/standard.h b/depend/zcash/src/script/standard.h
new file mode 100644
index 000000000..920ac165d
--- /dev/null
+++ b/depend/zcash/src/script/standard.h
@@ -0,0 +1,130 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_SCRIPT_STANDARD_H
+#define BITCOIN_SCRIPT_STANDARD_H
+
+#include "script/interpreter.h"
+#include "uint256.h"
+
+
+#include <stdint.h>
+#include <variant>
+
+static const bool DEFAULT_ACCEPT_DATACARRIER = true;
+
+class CKeyID;
+class CScript;
+
+/**
+ * Default setting for nMaxDatacarrierBytes. 80 bytes of data, +1 for OP_RETURN,
+ * +2 for the pushdata opcodes.
+ */
+static const unsigned int MAX_OP_RETURN_RELAY = 83;
+
+/**
+ * A data carrying output is an unspendable output containing data. The script
+ * type is designated as TX_NULL_DATA.
+ */
+extern bool fAcceptDatacarrier;
+
+/** Maximum size of TX_NULL_DATA scripts that this node considers standard. */
+extern unsigned nMaxDatacarrierBytes;
+
+/**
+ * Mandatory script verification flags that all new blocks must comply with for
+ * them to be valid. (but old blocks may not comply with) Currently just P2SH,
+ * but in the future other flags may be added.
+ *
+ * Failing one of these tests may trigger a DoS ban - see CheckInputs() for
+ * details.
+ */
+static const unsigned int MANDATORY_SCRIPT_VERIFY_FLAGS = SCRIPT_VERIFY_P2SH;
+
+enum txnouttype
+{
+    TX_NONSTANDARD,
+    // 'standard' transaction types:
+    TX_PUBKEY,
+    TX_PUBKEYHASH,
+    TX_SCRIPTHASH,
+    TX_MULTISIG,
+    TX_NULL_DATA, //!< unspendable OP_RETURN script that carries data
+};
+
+class CNoDestination {
+public:
+    friend bool operator==(const CNoDestination &a, const CNoDestination &b) { return true; }
+    friend bool operator!=(const CNoDestination &a, const CNoDestination &b) { return false; }
+    friend bool operator<(const CNoDestination &a, const CNoDestination &b) { return true; }
+};
+
+/**
+ * A txout script template with a specific destination. It is either:
+ *  * CNoDestination: no destination set
+ *  * CKeyID: TX_PUBKEYHASH destination
+ *  * CScriptID: TX_SCRIPTHASH destination
+ *  A CTxDestination is the internal data type encoded in a bitcoin address
+ */
+typedef std::variant<CNoDestination, CKeyID, CScriptID> CTxDestination;
+
+/** Check whether a CTxDestination is a CNoDestination. */
+bool IsValidDestination(const CTxDestination& dest);
+
+/** Check whether a CTxDestination is a CKeyID. */
+bool IsKeyDestination(const CTxDestination& dest);
+
+/** Check whether a CTxDestination is a CScriptID. */
+bool IsScriptDestination(const CTxDestination& dest);
+
+/** Get the name of a txnouttype as a C string, or nullptr if unknown. */
+const char* GetTxnOutputType(txnouttype t);
+
+/**
+ * Parse a scriptPubKey and identify script type for standard scripts. If
+ * successful, returns script type and parsed pubkeys or hashes, depending on
+ * the type. For example, for a P2SH script, vSolutionsRet will contain the
+ * script hash, for P2PKH it will contain the key hash, etc.
+ *
+ * @param[in]   scriptPubKey   Script to parse
+ * @param[out]  typeRet        The script type
+ * @param[out]  vSolutionsRet  Vector of parsed pubkeys and hashes
+ * @return                     True if script matches standard template
+ */
+bool Solver(const CScript& scriptPubKey, txnouttype& typeRet, std::vector<std::vector<unsigned char> >& vSolutionsRet);
+int ScriptSigArgsExpected(txnouttype t, const std::vector<std::vector<unsigned char> >& vSolutions);
+
+/**
+ * Parse a standard scriptPubKey for the destination address. Assigns result to
+ * the addressRet parameter and returns true if successful. For multisig
+ * scripts, instead use ExtractDestinations. Currently only works for P2PK,
+ * P2PKH, and P2SH scripts.
+ */
+bool ExtractDestination(const CScript& scriptPubKey, CTxDestination& addressRet);
+
+/**
+ * Parse a standard scriptPubKey with one or more destination addresses. For
+ * multisig scripts, this populates the addressRet vector with the pubkey IDs
+ * and nRequiredRet with the n required to spend. For other destinations,
+ * addressRet is populated with a single value and nRequiredRet is set to 1.
+ * Returns true if successful.
+ */
+bool ExtractDestinations(const CScript& scriptPubKey, txnouttype& typeRet, std::vector<CTxDestination>& addressRet, int& nRequiredRet);
+
+/**
+ * Generate a Bitcoin scriptPubKey for the given CTxDestination. Returns a P2PKH
+ * script for a CKeyID destination, a P2SH script for a CScriptID, and an empty
+ * script for CNoDestination.
+ */
+CScript GetScriptForDestination(const CTxDestination& dest);
+CScript GetScriptForRawPubKey(const CPubKey& pubkey);
+
+/** Generate a multisig script. */
+CScript GetScriptForMultisig(int nRequired, const std::vector<CPubKey>& keys);
+
+// insightexplorer
+CTxDestination DestFromAddressHash(int scriptType, uint160& addressHash);
+
+#endif // BITCOIN_SCRIPT_STANDARD_H
diff --git a/depend/zcash/src/script/zcash_script.cpp b/depend/zcash/src/script/zcash_script.cpp
new file mode 100644
index 000000000..edd457d55
--- /dev/null
+++ b/depend/zcash/src/script/zcash_script.cpp
@@ -0,0 +1,329 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "zcash_script.h"
+
+#include "consensus/upgrades.h"
+#include "primitives/transaction.h"
+#include "pubkey.h"
+#include "script/interpreter.h"
+#include "version.h"
+
+namespace {
+
+/** A class that deserializes a single CTransaction one time. */
+class TxInputStream
+{
+public:
+    TxInputStream(int nTypeIn, int nVersionIn, const unsigned char *txTo, size_t txToLen) :
+    m_type(nTypeIn),
+    m_version(nVersionIn),
+    m_data(txTo),
+    m_remaining(txToLen)
+    {}
+
+    void read(char* pch, size_t nSize)
+    {
+        if (nSize > m_remaining)
+            throw std::ios_base::failure(std::string(__func__) + ": end of data");
+
+        if (pch == NULL)
+            throw std::ios_base::failure(std::string(__func__) + ": bad destination buffer");
+
+        if (m_data == NULL)
+            throw std::ios_base::failure(std::string(__func__) + ": bad source buffer");
+
+        memcpy(pch, m_data, nSize);
+        m_remaining -= nSize;
+        m_data += nSize;
+    }
+
+    template<typename T>
+    TxInputStream& operator>>(T& obj)
+    {
+        ::Unserialize(*this, obj);
+        return *this;
+    }
+
+    int GetVersion() const { return m_version; }
+    int GetType() const { return m_type; }
+private:
+    const int m_type;
+    const int m_version;
+    const unsigned char* m_data;
+    size_t m_remaining;
+};
+
+inline int set_error(zcash_script_error* ret, zcash_script_error serror)
+{
+    if (ret)
+        *ret = serror;
+    return 0;
+}
+
+struct ECCryptoClosure
+{
+    ECCVerifyHandle handle;
+};
+
+ECCryptoClosure instance_of_eccryptoclosure;
+
+// Copy of GetLegacySigOpCount from main.cpp commit c4b2ef7c4.
+// Replace with the copy from src/consensus/tx_verify.{cpp,h} after backporting that refactor.
+unsigned int GetLegacySigOpCount(const CTransaction& tx)
+{
+    unsigned int nSigOps = 0;
+    for (const CTxIn& txin : tx.vin)
+    {
+        nSigOps += txin.scriptSig.GetSigOpCount(false);
+    }
+    for (const CTxOut& txout : tx.vout)
+    {
+        nSigOps += txout.scriptPubKey.GetSigOpCount(false);
+    }
+    return nSigOps;
+}
+}
+
+struct PrecomputedTransaction {
+    const CTransaction tx;
+    const PrecomputedTransactionData txdata;
+
+    PrecomputedTransaction(
+        CTransaction txIn,
+        const unsigned char* allPrevOutputs,
+        size_t allPrevOutputsLen) : tx(txIn), txdata(txIn, allPrevOutputs, allPrevOutputsLen) {}
+};
+
+void* zcash_script_new_precomputed_tx(
+    const unsigned char* txTo,
+    unsigned int txToLen,
+    zcash_script_error* err)
+{
+    try {
+        TxInputStream stream(SER_NETWORK, PROTOCOL_VERSION, txTo, txToLen);
+        CTransaction tx;
+        stream >> tx;
+        if (GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION) != txToLen) {
+            set_error(err, zcash_script_ERR_TX_SIZE_MISMATCH);
+            return nullptr;
+        }
+        if (tx.nVersion >= ZIP225_TX_VERSION) {
+            set_error(err, zcash_script_ERR_TX_VERSION);
+            return nullptr;
+        }
+
+        // Deserializing the tx did not error.
+        set_error(err, zcash_script_ERR_OK);
+        // This is a pre-v5 tx, so the PrecomputedTransactionData constructor
+        // field `allPrevOutputs` is not used.
+        auto preTx = new PrecomputedTransaction(tx, nullptr, 0);
+        return preTx;
+    } catch (const std::exception&) {
+        set_error(err, zcash_script_ERR_TX_DESERIALIZE); // Error deserializing
+        return nullptr;
+    }
+}
+
+void* zcash_script_new_precomputed_tx_v5(
+    const unsigned char* txTo,
+    unsigned int txToLen,
+    const unsigned char* allPrevOutputs,
+    unsigned int allPrevOutputsLen,
+    zcash_script_error* err)
+{
+    CTransaction tx;
+    try {
+        TxInputStream stream(SER_NETWORK, PROTOCOL_VERSION, txTo, txToLen);
+        stream >> tx;
+        if (GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION) != txToLen) {
+            set_error(err, zcash_script_ERR_TX_SIZE_MISMATCH);
+            return nullptr;
+        }
+    } catch (const std::exception&) {
+        set_error(err, zcash_script_ERR_TX_DESERIALIZE); // Error deserializing
+        return nullptr;
+    }
+
+    try {
+        auto preTx = new PrecomputedTransaction(tx, allPrevOutputs, allPrevOutputsLen);
+        // Deserializing the tx did not error.
+        set_error(err, zcash_script_ERR_OK);
+        return preTx;
+    } catch (const std::exception&) {
+        // We had some error when parsing allPrevOutputs inside the
+        // PrecomputedTransactionData constructor.
+        set_error(err, zcash_script_ERR_ALL_PREV_OUTPUTS_DESERIALIZE);
+        return nullptr;
+    }
+}
+
+void zcash_script_free_precomputed_tx(void* pre_preTx)
+{
+    PrecomputedTransaction* preTx = static_cast<PrecomputedTransaction*>(pre_preTx);
+    delete preTx;
+    preTx = nullptr;
+}
+
+int zcash_script_verify_precomputed(
+    const void* pre_preTx,
+    unsigned int nIn,
+    const unsigned char* scriptPubKey,
+    unsigned int scriptPubKeyLen,
+    int64_t amount,
+    unsigned int flags,
+    uint32_t consensusBranchId,
+    zcash_script_error* err)
+{
+    const PrecomputedTransaction* preTx = static_cast<const PrecomputedTransaction*>(pre_preTx);
+    if (nIn >= preTx->tx.vin.size())
+        return set_error(err, zcash_script_ERR_TX_INDEX);
+
+    // Regardless of the verification result, the tx did not error.
+    set_error(err, zcash_script_ERR_OK);
+    return VerifyScript(
+        preTx->tx.vin[nIn].scriptSig,
+        CScript(scriptPubKey, scriptPubKey + scriptPubKeyLen),
+        flags,
+        TransactionSignatureChecker(&preTx->tx, preTx->txdata, nIn, amount),
+        consensusBranchId,
+        NULL);
+}
+
+int zcash_script_verify(
+    const unsigned char *scriptPubKey, unsigned int scriptPubKeyLen,
+    int64_t amount,
+    const unsigned char *txTo, unsigned int txToLen,
+    unsigned int nIn, unsigned int flags,
+    uint32_t consensusBranchId,
+    zcash_script_error* err)
+{
+    try {
+        TxInputStream stream(SER_NETWORK, PROTOCOL_VERSION, txTo, txToLen);
+        CTransaction tx;
+        stream >> tx;
+        if (nIn >= tx.vin.size())
+            return set_error(err, zcash_script_ERR_TX_INDEX);
+        if (GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION) != txToLen)
+            return set_error(err, zcash_script_ERR_TX_SIZE_MISMATCH);
+        if (tx.nVersion >= ZIP225_TX_VERSION) {
+            return set_error(err, zcash_script_ERR_TX_VERSION);
+        }
+
+         // Regardless of the verification result, the tx did not error.
+        set_error(err, zcash_script_ERR_OK);
+        // This is a pre-v5 tx, so the PrecomputedTransactionData constructor
+        // field `allPrevOutputs` is not used.
+        PrecomputedTransactionData txdata(tx, {});
+        return VerifyScript(
+            tx.vin[nIn].scriptSig,
+            CScript(scriptPubKey, scriptPubKey + scriptPubKeyLen),
+            flags,
+            TransactionSignatureChecker(&tx, txdata, nIn, amount),
+            consensusBranchId,
+            NULL);
+    } catch (const std::exception&) {
+        return set_error(err, zcash_script_ERR_TX_DESERIALIZE); // Error deserializing
+    }
+}
+
+int zcash_script_verify_v5(
+    const unsigned char* txTo,
+    unsigned int txToLen,
+    const unsigned char* allPrevOutputs,
+    unsigned int allPrevOutputsLen,
+    unsigned int nIn,
+    unsigned int flags,
+    uint32_t consensusBranchId,
+    zcash_script_error* err)
+{
+    CTransaction tx;
+    try {
+        TxInputStream stream(SER_NETWORK, PROTOCOL_VERSION, txTo, txToLen);
+        stream >> tx;
+        if (nIn >= tx.vin.size())
+            return set_error(err, zcash_script_ERR_TX_INDEX);
+        if (GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION) != txToLen)
+            return set_error(err, zcash_script_ERR_TX_SIZE_MISMATCH);
+    } catch (const std::exception&) {
+        return set_error(err, zcash_script_ERR_TX_DESERIALIZE); // Error deserializing
+    }
+
+    std::vector<CTxOut> prevOutputs;
+    try {
+        // TODO: we can swap this second deserialization for an FFI call by
+        // fetching this through PrecomputedTransactionData. Simplicity for now.
+        CDataStream sAllPrevOutputs(
+            reinterpret_cast<const char*>(allPrevOutputs),
+            reinterpret_cast<const char*>(allPrevOutputs + allPrevOutputsLen),
+            SER_NETWORK,
+            PROTOCOL_VERSION);
+        sAllPrevOutputs >> prevOutputs;
+        if (!(tx.IsCoinBase() ? prevOutputs.empty() : tx.vin.size() == prevOutputs.size())) {
+            return set_error(err, zcash_script_ERR_ALL_PREV_OUTPUTS_SIZE_MISMATCH);
+        }
+    } catch (const std::exception&) {
+        // We had some error when parsing allPrevOutputs inside the
+        // PrecomputedTransactionData constructor.
+        return set_error(err, zcash_script_ERR_ALL_PREV_OUTPUTS_DESERIALIZE);
+    }
+
+    try {
+        // Regardless of the verification result, the tx did not error.
+        set_error(err, zcash_script_ERR_OK);
+        PrecomputedTransactionData txdata(tx, allPrevOutputs, allPrevOutputsLen);
+        return VerifyScript(
+            tx.vin[nIn].scriptSig,
+            prevOutputs[nIn].scriptPubKey,
+            flags,
+            TransactionSignatureChecker(&tx, txdata, nIn, prevOutputs[nIn].nValue),
+            consensusBranchId,
+            NULL);
+    } catch (const std::exception&) {
+        return set_error(err, zcash_script_ERR_VERIFY_SCRIPT); // Error during script verification
+    }
+}
+
+unsigned int zcash_script_legacy_sigop_count_precomputed(
+    const void* pre_preTx,
+    zcash_script_error* err)
+{
+    const PrecomputedTransaction* preTx = static_cast<const PrecomputedTransaction*>(pre_preTx);
+
+    // The current implementation of this method never errors.
+    set_error(err, zcash_script_ERR_OK);
+
+    return GetLegacySigOpCount(preTx->tx);
+}
+
+unsigned int zcash_script_legacy_sigop_count(
+    const unsigned char *txTo,
+    unsigned int txToLen,
+    zcash_script_error* err)
+{
+    try {
+        TxInputStream stream(SER_NETWORK, PROTOCOL_VERSION, txTo, txToLen);
+        CTransaction tx;
+        stream >> tx;
+        if (GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION) != txToLen) {
+            set_error(err, zcash_script_ERR_TX_SIZE_MISMATCH);
+            return UINT_MAX;
+        }
+
+        // Deserializing the tx did not error.
+        set_error(err, zcash_script_ERR_OK);
+
+        return GetLegacySigOpCount(tx);
+    } catch (const std::exception&) {
+        set_error(err, zcash_script_ERR_TX_DESERIALIZE); // Error deserializing
+        return UINT_MAX;
+    }
+}
+
+unsigned int zcash_script_version()
+{
+    // Just use the API version for now
+    return ZCASH_SCRIPT_API_VER;
+}
diff --git a/depend/zcash/src/script/zcash_script.h b/depend/zcash/src/script/zcash_script.h
new file mode 100644
index 000000000..51ed657ea
--- /dev/null
+++ b/depend/zcash/src/script/zcash_script.h
@@ -0,0 +1,189 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_SCRIPT_ZCASH_SCRIPT_H
+#define ZCASH_SCRIPT_ZCASH_SCRIPT_H
+
+#include <stdint.h>
+
+#if defined(BUILD_BITCOIN_INTERNAL) && defined(HAVE_CONFIG_H)
+#include "config/bitcoin-config.h"
+  #if defined(_WIN32)
+    #if defined(DLL_EXPORT)
+      #if defined(HAVE_FUNC_ATTRIBUTE_DLLEXPORT)
+        #define EXPORT_SYMBOL __declspec(dllexport)
+      #else
+        #define EXPORT_SYMBOL
+      #endif
+    #endif
+  #elif defined(HAVE_FUNC_ATTRIBUTE_VISIBILITY)
+    #define EXPORT_SYMBOL __attribute__ ((visibility ("default")))
+  #endif
+#elif defined(MSC_VER) && !defined(STATIC_LIBZCASHCONSENSUS)
+  #define EXPORT_SYMBOL __declspec(dllimport)
+#endif
+
+#ifndef EXPORT_SYMBOL
+  #define EXPORT_SYMBOL
+#endif
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#define ZCASH_SCRIPT_API_VER 3
+
+typedef enum zcash_script_error_t
+{
+    zcash_script_ERR_OK = 0,
+    zcash_script_ERR_TX_INDEX,
+    zcash_script_ERR_TX_SIZE_MISMATCH,
+    zcash_script_ERR_TX_DESERIALIZE,
+    // Defined since API version 3.
+    zcash_script_ERR_TX_VERSION,
+    zcash_script_ERR_ALL_PREV_OUTPUTS_SIZE_MISMATCH,
+    zcash_script_ERR_ALL_PREV_OUTPUTS_DESERIALIZE,
+    zcash_script_ERR_VERIFY_SCRIPT,
+} zcash_script_error;
+
+/** Script verification flags */
+enum
+{
+    zcash_script_SCRIPT_FLAGS_VERIFY_NONE                = 0,
+    zcash_script_SCRIPT_FLAGS_VERIFY_P2SH                = (1U << 0), // evaluate P2SH (BIP16) subscripts
+    zcash_script_SCRIPT_FLAGS_VERIFY_CHECKLOCKTIMEVERIFY = (1U << 9), // enable CHECKLOCKTIMEVERIFY (BIP65)
+};
+
+/// Deserializes the given transaction and precomputes values to improve
+/// script verification performance.
+///
+/// This API cannot be used for v5+ transactions, and will return an error.
+///
+/// Returns a pointer to the precomputed transaction. Free this with
+/// zcash_script_free_precomputed_tx once you are done.
+/// The precomputed transaction is guaranteed to not keep a reference to any
+/// part of the input buffers, so they can be safely overwritten or deallocated
+/// after this function returns.
+///
+/// If not NULL, err will contain an error/success code for the operation.
+void* zcash_script_new_precomputed_tx(
+    const unsigned char* txTo,
+    unsigned int txToLen,
+    zcash_script_error* err);
+
+/// Deserializes the given transaction and precomputes values to improve
+/// script verification performance. Must be used for V5 transactions;
+/// may also be used for previous versions.
+///
+/// allPrevOutputs must point to the encoding of the vector of all outputs
+/// from previous transactions that are spent by the inputs of the given transaction.
+/// The outputs must be encoded as specified by Bitcoin. The full encoding will thus
+/// consist of a CompactSize prefix containing the number of outputs, followed by
+/// the concatenated outputs, each of them encoded as (value, CompactSize, pk_script).
+///
+/// Returns a pointer to the precomputed transaction. Free this with
+/// zcash_script_free_precomputed_tx once you are done.
+///
+/// If not NULL, err will contain an error/success code for the operation.
+void* zcash_script_new_precomputed_tx_v5(
+    const unsigned char* txTo,
+    unsigned int txToLen,
+    const unsigned char* allPrevOutputs,
+    unsigned int allPrevOutputsLen,
+    zcash_script_error* err);
+
+/// Frees a precomputed transaction previously created with
+/// zcash_script_new_precomputed_tx.
+void zcash_script_free_precomputed_tx(void* preTx);
+
+/// Returns 1 if the input nIn of the precomputed transaction pointed to by
+/// preTx correctly spends the scriptPubKey pointed to by scriptPubKey under
+/// the additional constraints specified by flags.
+///
+/// If not NULL, err will contain an error/success code for the operation.
+/// Note that script verification failure is indicated by err being set to
+/// zcash_script_ERR_OK and a return value of 0.
+EXPORT_SYMBOL int zcash_script_verify_precomputed(
+    const void* preTx,
+    unsigned int nIn,
+    const unsigned char* scriptPubKey,
+    unsigned int scriptPubKeyLen,
+    int64_t amount,
+    unsigned int flags,
+    uint32_t consensusBranchId,
+    zcash_script_error* err);
+
+/// Returns 1 if the input nIn of the serialized transaction pointed to by
+/// txTo correctly spends the scriptPubKey pointed to by scriptPubKey under
+/// the additional constraints specified by flags.
+///
+/// This API cannot be used for v5+ transactions, and will return an error.
+///
+/// If not NULL, err will contain an error/success code for the operation.
+/// Note that script verification failure is indicated by err being set to
+/// zcash_script_ERR_OK and a return value of 0.
+EXPORT_SYMBOL int zcash_script_verify(
+    const unsigned char *scriptPubKey, unsigned int scriptPubKeyLen,
+    int64_t amount,
+    const unsigned char *txTo, unsigned int txToLen,
+    unsigned int nIn, unsigned int flags,
+    uint32_t consensusBranchId,
+    zcash_script_error* err);
+
+/// Returns 1 if the input nIn of the serialized transaction pointed to by
+/// txTo correctly spends the matching output in allPrevOutputs under
+/// the additional constraints specified by flags. Must be used for V5 transactions;
+/// may also be used for previous versions.
+///
+/// allPrevOutputs must point to the encoding of the vector of all outputs
+/// from previous transactions that are spent by the inputs of the given transaction.
+/// The outputs must be encoded as specified by Bitcoin. The full encoding will thus
+/// consist of a CompactSize prefix containing the number of outputs, followed by
+/// the concatenated outputs, each of them encoded as (value, CompactSize, pk_script).
+///
+/// If not NULL, err will contain an error/success code for the operation.
+/// Note that script verification failure is indicated by err being set to
+/// zcash_script_ERR_OK and a return value of 0.
+EXPORT_SYMBOL int zcash_script_verify_v5(
+    const unsigned char* txTo,
+    unsigned int txToLen,
+    const unsigned char* allPrevOutputs,
+    unsigned int allPrevOutputsLen,
+    unsigned int nIn,
+    unsigned int flags,
+    uint32_t consensusBranchId,
+    zcash_script_error* err);
+
+/// Returns the number of transparent signature operations in the
+/// transparent inputs and outputs of the precomputed transaction
+/// pointed to by preTx.
+///
+/// Returns UINT_MAX on error, so that invalid transactions don't pass the Zcash consensus rules.
+/// If not NULL, err will contain an error/success code for the operation.
+EXPORT_SYMBOL unsigned int zcash_script_legacy_sigop_count_precomputed(
+    const void* preTx,
+    zcash_script_error* err);
+
+/// Returns the number of transparent signature operations in the
+/// transparent inputs and outputs of the serialized transaction
+/// pointed to by txTo.
+///
+/// Returns UINT_MAX on error.
+/// If not NULL, err will contain an error/success code for the operation.
+EXPORT_SYMBOL unsigned int zcash_script_legacy_sigop_count(
+    const unsigned char *txTo,
+    unsigned int txToLen,
+    zcash_script_error* err);
+
+/// Returns the current version of the zcash_script library.
+EXPORT_SYMBOL unsigned int zcash_script_version();
+
+#ifdef __cplusplus
+} // extern "C"
+#endif
+
+#undef EXPORT_SYMBOL
+
+#endif // ZCASH_SCRIPT_ZCASH_SCRIPT_H
diff --git a/depend/zcash/src/secp256k1/.gitignore b/depend/zcash/src/secp256k1/.gitignore
new file mode 100644
index 000000000..ccdef02b2
--- /dev/null
+++ b/depend/zcash/src/secp256k1/.gitignore
@@ -0,0 +1,53 @@
+bench_inv
+bench_ecdh
+bench_ecmult
+bench_schnorrsig
+bench_sign
+bench_verify
+bench_recover
+bench_internal
+tests
+exhaustive_tests
+gen_context
+valgrind_ctime_test
+*.exe
+*.so
+*.a
+!.gitignore
+
+Makefile
+configure
+.libs/
+Makefile.in
+aclocal.m4
+autom4te.cache/
+config.log
+config.status
+*.tar.gz
+*.la
+libtool
+.deps/
+.dirstamp
+*.lo
+*.o
+*~
+*.log
+*.trs
+src/libsecp256k1-config.h
+src/libsecp256k1-config.h.in
+src/ecmult_static_context.h
+build-aux/config.guess
+build-aux/config.sub
+build-aux/depcomp
+build-aux/install-sh
+build-aux/ltmain.sh
+build-aux/m4/libtool.m4
+build-aux/m4/lt~obsolete.m4
+build-aux/m4/ltoptions.m4
+build-aux/m4/ltsugar.m4
+build-aux/m4/ltversion.m4
+build-aux/missing
+build-aux/compile
+build-aux/test-driver
+src/stamp-h1
+libsecp256k1.pc
diff --git a/depend/zcash/src/secp256k1/.travis.yml b/depend/zcash/src/secp256k1/.travis.yml
new file mode 100644
index 000000000..91f1d41a2
--- /dev/null
+++ b/depend/zcash/src/secp256k1/.travis.yml
@@ -0,0 +1,109 @@
+language: c
+os:
+  - linux
+  - osx
+
+dist: bionic
+# Valgrind currently supports upto macOS 10.13, the latest xcode of that version is 10.1
+osx_image: xcode10.1
+addons:
+  apt:
+    packages:
+      - libgmp-dev
+      - valgrind
+      - libtool-bin
+compiler:
+  - clang
+  - gcc
+env:
+  global:
+    - WIDEMUL=auto  BIGNUM=auto  STATICPRECOMPUTATION=yes  ECMULTGENPRECISION=auto  ASM=no  BUILD=check  WITH_VALGRIND=yes RUN_VALGRIND=no EXTRAFLAGS=  HOST=  ECDH=no  RECOVERY=no SCHNORRSIG=no EXPERIMENTAL=no CTIMETEST=yes BENCH=yes ITERS=2
+  matrix:
+    - WIDEMUL=int64   RECOVERY=yes
+    - WIDEMUL=int64   ECDH=yes  EXPERIMENTAL=yes SCHNORRSIG=yes
+    - WIDEMUL=int128
+    - WIDEMUL=int128  RECOVERY=yes EXPERIMENTAL=yes SCHNORRSIG=yes
+    - WIDEMUL=int128  ECDH=yes EXPERIMENTAL=yes SCHNORRSIG=yes
+    - WIDEMUL=int128                    ASM=x86_64
+    - BIGNUM=no
+    - BIGNUM=no       RECOVERY=yes EXPERIMENTAL=yes SCHNORRSIG=yes
+    - BIGNUM=no       STATICPRECOMPUTATION=no
+    - BUILD=distcheck WITH_VALGRIND=no CTIMETEST=no BENCH=no
+    - CPPFLAGS=-DDETERMINISTIC
+    - CFLAGS=-O0 CTIMETEST=no
+    - CFLAGS="-fsanitize=undefined -fno-omit-frame-pointer" LDFLAGS="-fsanitize=undefined -fno-omit-frame-pointer" UBSAN_OPTIONS="print_stacktrace=1:halt_on_error=1" BIGNUM=no ASM=x86_64 ECDH=yes RECOVERY=yes EXPERIMENTAL=yes SCHNORRSIG=yes CTIMETEST=no
+    - ECMULTGENPRECISION=2
+    - ECMULTGENPRECISION=8
+    - RUN_VALGRIND=yes BIGNUM=no ASM=x86_64 ECDH=yes  RECOVERY=yes EXPERIMENTAL=yes SCHNORRSIG=yes EXTRAFLAGS="--disable-openssl-tests" BUILD=
+matrix:
+  fast_finish: true
+  include:
+    - compiler: clang
+      os: linux
+      env: HOST=i686-linux-gnu
+      addons:
+        apt:
+          packages:
+            - gcc-multilib
+            - libgmp-dev:i386
+            - valgrind
+            - libtool-bin
+            - libc6-dbg:i386
+    - compiler: clang
+      env: HOST=i686-linux-gnu
+      os: linux
+      addons:
+        apt:
+          packages:
+            - gcc-multilib
+            - valgrind
+            - libtool-bin
+            - libc6-dbg:i386
+    - compiler: gcc
+      env: HOST=i686-linux-gnu
+      os: linux
+      addons:
+        apt:
+          packages:
+            - gcc-multilib
+            - valgrind
+            - libtool-bin
+            - libc6-dbg:i386
+    - compiler: gcc
+      os: linux
+      env: HOST=i686-linux-gnu
+      addons:
+        apt:
+          packages:
+            - gcc-multilib
+            - libgmp-dev:i386
+            - valgrind
+            - libtool-bin
+            - libc6-dbg:i386
+    # S390x build (big endian system)
+    - compiler: gcc
+      env: HOST=s390x-unknown-linux-gnu ECDH=yes RECOVERY=yes EXPERIMENTAL=yes SCHNORRSIG=yes CTIMETEST=
+      arch: s390x
+
+# We use this to install macOS dependencies instead of the built in `homebrew` plugin,
+# because in xcode earlier than 11 they have a bug requiring updating the system which overall takes ~8 minutes.
+# https://travis-ci.community/t/macos-build-fails-because-of-homebrew-bundle-unknown-command/7296
+before_install:
+ - if [ "${TRAVIS_OS_NAME}" = "osx" ]; then HOMEBREW_NO_AUTO_UPDATE=1 brew install gmp valgrind gcc@9; fi
+
+before_script: ./autogen.sh
+
+# travis auto terminates jobs that go for 10 minutes without printing to stdout, but travis_wait doesn't work well with forking programs like valgrind (https://docs.travis-ci.com/user/common-build-problems/#build-times-out-because-no-output-was-received https://github.com/bitcoin-core/secp256k1/pull/750#issuecomment-623476860)
+script:
+  - function keep_alive() { while true; do echo -en "\a"; sleep 60; done }
+  - keep_alive &
+  - ./contrib/travis.sh
+  - kill %keep_alive
+
+after_script:
+    - cat ./tests.log
+    - cat ./exhaustive_tests.log
+    - cat ./valgrind_ctime_test.log
+    - cat ./bench.log
+    - $CC --version
+    - valgrind --version
diff --git a/depend/zcash/src/secp256k1/COPYING b/depend/zcash/src/secp256k1/COPYING
new file mode 100644
index 000000000..4522a5990
--- /dev/null
+++ b/depend/zcash/src/secp256k1/COPYING
@@ -0,0 +1,19 @@
+Copyright (c) 2013 Pieter Wuille
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
diff --git a/depend/zcash/src/secp256k1/Makefile.am b/depend/zcash/src/secp256k1/Makefile.am
new file mode 100644
index 000000000..023fa6067
--- /dev/null
+++ b/depend/zcash/src/secp256k1/Makefile.am
@@ -0,0 +1,164 @@
+ACLOCAL_AMFLAGS = -I build-aux/m4
+
+lib_LTLIBRARIES = libsecp256k1.la
+include_HEADERS = include/secp256k1.h
+include_HEADERS += include/secp256k1_preallocated.h
+noinst_HEADERS =
+noinst_HEADERS += src/scalar.h
+noinst_HEADERS += src/scalar_4x64.h
+noinst_HEADERS += src/scalar_8x32.h
+noinst_HEADERS += src/scalar_low.h
+noinst_HEADERS += src/scalar_impl.h
+noinst_HEADERS += src/scalar_4x64_impl.h
+noinst_HEADERS += src/scalar_8x32_impl.h
+noinst_HEADERS += src/scalar_low_impl.h
+noinst_HEADERS += src/group.h
+noinst_HEADERS += src/group_impl.h
+noinst_HEADERS += src/num_gmp.h
+noinst_HEADERS += src/num_gmp_impl.h
+noinst_HEADERS += src/ecdsa.h
+noinst_HEADERS += src/ecdsa_impl.h
+noinst_HEADERS += src/eckey.h
+noinst_HEADERS += src/eckey_impl.h
+noinst_HEADERS += src/ecmult.h
+noinst_HEADERS += src/ecmult_impl.h
+noinst_HEADERS += src/ecmult_const.h
+noinst_HEADERS += src/ecmult_const_impl.h
+noinst_HEADERS += src/ecmult_gen.h
+noinst_HEADERS += src/ecmult_gen_impl.h
+noinst_HEADERS += src/num.h
+noinst_HEADERS += src/num_impl.h
+noinst_HEADERS += src/field_10x26.h
+noinst_HEADERS += src/field_10x26_impl.h
+noinst_HEADERS += src/field_5x52.h
+noinst_HEADERS += src/field_5x52_impl.h
+noinst_HEADERS += src/field_5x52_int128_impl.h
+noinst_HEADERS += src/field_5x52_asm_impl.h
+noinst_HEADERS += src/assumptions.h
+noinst_HEADERS += src/util.h
+noinst_HEADERS += src/scratch.h
+noinst_HEADERS += src/scratch_impl.h
+noinst_HEADERS += src/selftest.h
+noinst_HEADERS += src/testrand.h
+noinst_HEADERS += src/testrand_impl.h
+noinst_HEADERS += src/hash.h
+noinst_HEADERS += src/hash_impl.h
+noinst_HEADERS += src/field.h
+noinst_HEADERS += src/field_impl.h
+noinst_HEADERS += src/bench.h
+noinst_HEADERS += contrib/lax_der_parsing.h
+noinst_HEADERS += contrib/lax_der_parsing.c
+noinst_HEADERS += contrib/lax_der_privatekey_parsing.h
+noinst_HEADERS += contrib/lax_der_privatekey_parsing.c
+
+if USE_EXTERNAL_ASM
+COMMON_LIB = libsecp256k1_common.la
+noinst_LTLIBRARIES = $(COMMON_LIB)
+else
+COMMON_LIB =
+endif
+
+pkgconfigdir = $(libdir)/pkgconfig
+pkgconfig_DATA = libsecp256k1.pc
+
+if USE_EXTERNAL_ASM
+if USE_ASM_ARM
+libsecp256k1_common_la_SOURCES = src/asm/field_10x26_arm.s
+endif
+endif
+
+libsecp256k1_la_SOURCES = src/secp256k1.c
+libsecp256k1_la_CPPFLAGS = -DSECP256K1_BUILD -I$(top_srcdir)/include -I$(top_srcdir)/src $(SECP_INCLUDES)
+libsecp256k1_la_LIBADD = $(SECP_LIBS) $(COMMON_LIB)
+
+if VALGRIND_ENABLED
+libsecp256k1_la_CPPFLAGS += -DVALGRIND
+endif
+
+noinst_PROGRAMS =
+if USE_BENCHMARK
+noinst_PROGRAMS += bench_verify bench_sign bench_internal bench_ecmult
+bench_verify_SOURCES = src/bench_verify.c
+bench_verify_LDADD = libsecp256k1.la $(SECP_LIBS) $(SECP_TEST_LIBS) $(COMMON_LIB)
+# SECP_TEST_INCLUDES are only used here for CRYPTO_CPPFLAGS
+bench_verify_CPPFLAGS = -DSECP256K1_BUILD $(SECP_TEST_INCLUDES)
+bench_sign_SOURCES = src/bench_sign.c
+bench_sign_LDADD = libsecp256k1.la $(SECP_LIBS) $(SECP_TEST_LIBS) $(COMMON_LIB)
+bench_internal_SOURCES = src/bench_internal.c
+bench_internal_LDADD = $(SECP_LIBS) $(COMMON_LIB)
+bench_internal_CPPFLAGS = -DSECP256K1_BUILD $(SECP_INCLUDES)
+bench_ecmult_SOURCES = src/bench_ecmult.c
+bench_ecmult_LDADD = $(SECP_LIBS) $(COMMON_LIB)
+bench_ecmult_CPPFLAGS = -DSECP256K1_BUILD $(SECP_INCLUDES)
+endif
+
+TESTS =
+if USE_TESTS
+noinst_PROGRAMS += tests
+tests_SOURCES = src/tests.c
+tests_CPPFLAGS = -DSECP256K1_BUILD -I$(top_srcdir)/src -I$(top_srcdir)/include $(SECP_INCLUDES) $(SECP_TEST_INCLUDES)
+if VALGRIND_ENABLED
+tests_CPPFLAGS += -DVALGRIND
+noinst_PROGRAMS += valgrind_ctime_test
+valgrind_ctime_test_SOURCES = src/valgrind_ctime_test.c
+valgrind_ctime_test_LDADD = libsecp256k1.la $(SECP_LIBS) $(SECP_LIBS) $(COMMON_LIB)
+endif
+if !ENABLE_COVERAGE
+tests_CPPFLAGS += -DVERIFY
+endif
+tests_LDADD = $(SECP_LIBS) $(SECP_TEST_LIBS) $(COMMON_LIB)
+tests_LDFLAGS = -static
+TESTS += tests
+endif
+
+if USE_EXHAUSTIVE_TESTS
+noinst_PROGRAMS += exhaustive_tests
+exhaustive_tests_SOURCES = src/tests_exhaustive.c
+exhaustive_tests_CPPFLAGS = -DSECP256K1_BUILD -I$(top_srcdir)/src $(SECP_INCLUDES)
+if !ENABLE_COVERAGE
+exhaustive_tests_CPPFLAGS += -DVERIFY
+endif
+exhaustive_tests_LDADD = $(SECP_LIBS) $(COMMON_LIB)
+exhaustive_tests_LDFLAGS = -static
+TESTS += exhaustive_tests
+endif
+
+if USE_ECMULT_STATIC_PRECOMPUTATION
+CPPFLAGS_FOR_BUILD +=-I$(top_srcdir) -I$(builddir)/src
+
+gen_context_OBJECTS = gen_context.o
+gen_context_BIN = gen_context$(BUILD_EXEEXT)
+gen_%.o: src/gen_%.c src/libsecp256k1-config.h
+	$(CC_FOR_BUILD) $(CPPFLAGS_FOR_BUILD) $(CFLAGS_FOR_BUILD) -c $< -o $@
+
+$(gen_context_BIN): $(gen_context_OBJECTS)
+	$(CC_FOR_BUILD) $(CFLAGS_FOR_BUILD) $(LDFLAGS_FOR_BUILD) $^ -o $@
+
+$(libsecp256k1_la_OBJECTS): src/ecmult_static_context.h
+$(tests_OBJECTS): src/ecmult_static_context.h
+$(bench_internal_OBJECTS): src/ecmult_static_context.h
+$(bench_ecmult_OBJECTS): src/ecmult_static_context.h
+
+src/ecmult_static_context.h: $(gen_context_BIN)
+	./$(gen_context_BIN)
+
+CLEANFILES = $(gen_context_BIN) src/ecmult_static_context.h
+endif
+
+EXTRA_DIST = autogen.sh src/gen_context.c src/basic-config.h
+
+if ENABLE_MODULE_ECDH
+include src/modules/ecdh/Makefile.am.include
+endif
+
+if ENABLE_MODULE_RECOVERY
+include src/modules/recovery/Makefile.am.include
+endif
+
+if ENABLE_MODULE_EXTRAKEYS
+include src/modules/extrakeys/Makefile.am.include
+endif
+
+if ENABLE_MODULE_SCHNORRSIG
+include src/modules/schnorrsig/Makefile.am.include
+endif
diff --git a/depend/zcash/src/secp256k1/README.md b/depend/zcash/src/secp256k1/README.md
new file mode 100644
index 000000000..e07093723
--- /dev/null
+++ b/depend/zcash/src/secp256k1/README.md
@@ -0,0 +1,104 @@
+libsecp256k1
+============
+
+[![Build Status](https://travis-ci.org/bitcoin-core/secp256k1.svg?branch=master)](https://travis-ci.org/bitcoin-core/secp256k1)
+
+Optimized C library for ECDSA signatures and secret/public key operations on curve secp256k1.
+
+This library is intended to be the highest quality publicly available library for cryptography on the secp256k1 curve. However, the primary focus of its development has been for usage in the Bitcoin system and usage unlike Bitcoin's may be less well tested, verified, or suffer from a less well thought out interface. Correct usage requires some care and consideration that the library is fit for your application's purpose.
+
+Features:
+* secp256k1 ECDSA signing/verification and key generation.
+* Additive and multiplicative tweaking of secret/public keys.
+* Serialization/parsing of secret keys, public keys, signatures.
+* Constant time, constant memory access signing and public key generation.
+* Derandomized ECDSA (via RFC6979 or with a caller provided function.)
+* Very efficient implementation.
+* Suitable for embedded systems.
+* Optional module for public key recovery.
+* Optional module for ECDH key exchange.
+
+Experimental features have not received enough scrutiny to satisfy the standard of quality of this library but are made available for testing and review by the community. The APIs of these features should not be considered stable.
+
+Implementation details
+----------------------
+
+* General
+  * No runtime heap allocation.
+  * Extensive testing infrastructure.
+  * Structured to facilitate review and analysis.
+  * Intended to be portable to any system with a C89 compiler and uint64_t support.
+  * No use of floating types.
+  * Expose only higher level interfaces to minimize the API surface and improve application security. ("Be difficult to use insecurely.")
+* Field operations
+  * Optimized implementation of arithmetic modulo the curve's field size (2^256 - 0x1000003D1).
+    * Using 5 52-bit limbs (including hand-optimized assembly for x86_64, by Diederik Huys).
+    * Using 10 26-bit limbs (including hand-optimized assembly for 32-bit ARM, by Wladimir J. van der Laan).
+  * Field inverses and square roots using a sliding window over blocks of 1s (by Peter Dettman).
+* Scalar operations
+  * Optimized implementation without data-dependent branches of arithmetic modulo the curve's order.
+    * Using 4 64-bit limbs (relying on __int128 support in the compiler).
+    * Using 8 32-bit limbs.
+* Group operations
+  * Point addition formula specifically simplified for the curve equation (y^2 = x^3 + 7).
+  * Use addition between points in Jacobian and affine coordinates where possible.
+  * Use a unified addition/doubling formula where necessary to avoid data-dependent branches.
+  * Point/x comparison without a field inversion by comparison in the Jacobian coordinate space.
+* Point multiplication for verification (a*P + b*G).
+  * Use wNAF notation for point multiplicands.
+  * Use a much larger window for multiples of G, using precomputed multiples.
+  * Use Shamir's trick to do the multiplication with the public key and the generator simultaneously.
+  * Use secp256k1's efficiently-computable endomorphism to split the P multiplicand into 2 half-sized ones.
+* Point multiplication for signing
+  * Use a precomputed table of multiples of powers of 16 multiplied with the generator, so general multiplication becomes a series of additions.
+  * Intended to be completely free of timing sidechannels for secret-key operations (on reasonable hardware/toolchains)
+    * Access the table with branch-free conditional moves so memory access is uniform.
+    * No data-dependent branches
+  * Optional runtime blinding which attempts to frustrate differential power analysis.
+  * The precomputed tables add and eventually subtract points for which no known scalar (secret key) is known, preventing even an attacker with control over the secret key used to control the data internally.
+
+Build steps
+-----------
+
+libsecp256k1 is built using autotools:
+
+    $ ./autogen.sh
+    $ ./configure
+    $ make
+    $ make check
+    $ sudo make install  # optional
+
+Exhaustive tests
+-----------
+
+    $ ./exhaustive_tests
+
+With valgrind, you might need to increase the max stack size:
+
+    $ valgrind --max-stackframe=2500000 ./exhaustive_tests
+
+Test coverage
+-----------
+
+This library aims to have full coverage of the reachable lines and branches.
+
+To create a test coverage report, configure with `--enable-coverage` (use of GCC is necessary):
+
+    $ ./configure --enable-coverage
+
+Run the tests:
+
+    $ make check
+
+To create a report, `gcovr` is recommended, as it includes branch coverage reporting:
+
+    $ gcovr --exclude 'src/bench*' --print-summary
+
+To create a HTML report with coloured and annotated source code:
+
+    $ gcovr --exclude 'src/bench*' --html --html-details -o coverage.html
+
+Reporting a vulnerability
+------------
+
+See [SECURITY.md](SECURITY.md)
diff --git a/depend/zcash/src/secp256k1/SECURITY.md b/depend/zcash/src/secp256k1/SECURITY.md
new file mode 100644
index 000000000..0e4d58803
--- /dev/null
+++ b/depend/zcash/src/secp256k1/SECURITY.md
@@ -0,0 +1,15 @@
+# Security Policy
+
+## Reporting a Vulnerability
+
+To report security issues send an email to secp256k1-security@bitcoincore.org (not for support).
+
+The following keys may be used to communicate sensitive information to developers:
+
+| Name | Fingerprint |
+|------|-------------|
+| Pieter Wuille | 133E AC17 9436 F14A 5CF1  B794 860F EB80 4E66 9320 |
+| Andrew Poelstra | 699A 63EF C17A D3A9 A34C  FFC0 7AD0 A91C 40BD 0091 |
+| Tim Ruffing | 09E0 3F87 1092 E40E 106E  902B 33BC 86AB 80FF 5516 |
+
+You can import a key by running the following command with that individual’s fingerprint: `gpg --recv-keys "<fingerprint>"` Ensure that you put quotes around fingerprints containing spaces.
diff --git a/depend/zcash/src/secp256k1/autogen.sh b/depend/zcash/src/secp256k1/autogen.sh
new file mode 100755
index 000000000..65286b935
--- /dev/null
+++ b/depend/zcash/src/secp256k1/autogen.sh
@@ -0,0 +1,3 @@
+#!/bin/sh
+set -e
+autoreconf -if --warnings=all
diff --git a/depend/zcash/src/secp256k1/build-aux/m4/ax_prog_cc_for_build.m4 b/depend/zcash/src/secp256k1/build-aux/m4/ax_prog_cc_for_build.m4
new file mode 100644
index 000000000..7bcbf3200
--- /dev/null
+++ b/depend/zcash/src/secp256k1/build-aux/m4/ax_prog_cc_for_build.m4
@@ -0,0 +1,125 @@
+# ===========================================================================
+#   https://www.gnu.org/software/autoconf-archive/ax_prog_cc_for_build.html
+# ===========================================================================
+#
+# SYNOPSIS
+#
+#   AX_PROG_CC_FOR_BUILD
+#
+# DESCRIPTION
+#
+#   This macro searches for a C compiler that generates native executables,
+#   that is a C compiler that surely is not a cross-compiler. This can be
+#   useful if you have to generate source code at compile-time like for
+#   example GCC does.
+#
+#   The macro sets the CC_FOR_BUILD and CPP_FOR_BUILD macros to anything
+#   needed to compile or link (CC_FOR_BUILD) and preprocess (CPP_FOR_BUILD).
+#   The value of these variables can be overridden by the user by specifying
+#   a compiler with an environment variable (like you do for standard CC).
+#
+#   It also sets BUILD_EXEEXT and BUILD_OBJEXT to the executable and object
+#   file extensions for the build platform, and GCC_FOR_BUILD to `yes' if
+#   the compiler we found is GCC. All these variables but GCC_FOR_BUILD are
+#   substituted in the Makefile.
+#
+# LICENSE
+#
+#   Copyright (c) 2008 Paolo Bonzini <bonzini@gnu.org>
+#
+#   Copying and distribution of this file, with or without modification, are
+#   permitted in any medium without royalty provided the copyright notice
+#   and this notice are preserved. This file is offered as-is, without any
+#   warranty.
+
+#serial 8
+
+AU_ALIAS([AC_PROG_CC_FOR_BUILD], [AX_PROG_CC_FOR_BUILD])
+AC_DEFUN([AX_PROG_CC_FOR_BUILD], [dnl
+AC_REQUIRE([AC_PROG_CC])dnl
+AC_REQUIRE([AC_PROG_CPP])dnl
+AC_REQUIRE([AC_EXEEXT])dnl
+AC_REQUIRE([AC_CANONICAL_HOST])dnl
+
+dnl Use the standard macros, but make them use other variable names
+dnl
+pushdef([ac_cv_prog_CPP], ac_cv_build_prog_CPP)dnl
+pushdef([ac_cv_prog_gcc], ac_cv_build_prog_gcc)dnl
+pushdef([ac_cv_prog_cc_works], ac_cv_build_prog_cc_works)dnl
+pushdef([ac_cv_prog_cc_cross], ac_cv_build_prog_cc_cross)dnl
+pushdef([ac_cv_prog_cc_g], ac_cv_build_prog_cc_g)dnl
+pushdef([ac_cv_exeext], ac_cv_build_exeext)dnl
+pushdef([ac_cv_objext], ac_cv_build_objext)dnl
+pushdef([ac_exeext], ac_build_exeext)dnl
+pushdef([ac_objext], ac_build_objext)dnl
+pushdef([CC], CC_FOR_BUILD)dnl
+pushdef([CPP], CPP_FOR_BUILD)dnl
+pushdef([CFLAGS], CFLAGS_FOR_BUILD)dnl
+pushdef([CPPFLAGS], CPPFLAGS_FOR_BUILD)dnl
+pushdef([LDFLAGS], LDFLAGS_FOR_BUILD)dnl
+pushdef([host], build)dnl
+pushdef([host_alias], build_alias)dnl
+pushdef([host_cpu], build_cpu)dnl
+pushdef([host_vendor], build_vendor)dnl
+pushdef([host_os], build_os)dnl
+pushdef([ac_cv_host], ac_cv_build)dnl
+pushdef([ac_cv_host_alias], ac_cv_build_alias)dnl
+pushdef([ac_cv_host_cpu], ac_cv_build_cpu)dnl
+pushdef([ac_cv_host_vendor], ac_cv_build_vendor)dnl
+pushdef([ac_cv_host_os], ac_cv_build_os)dnl
+pushdef([ac_cpp], ac_build_cpp)dnl
+pushdef([ac_compile], ac_build_compile)dnl
+pushdef([ac_link], ac_build_link)dnl
+
+save_cross_compiling=$cross_compiling
+save_ac_tool_prefix=$ac_tool_prefix
+cross_compiling=no
+ac_tool_prefix=
+
+AC_PROG_CC
+AC_PROG_CPP
+AC_EXEEXT
+
+ac_tool_prefix=$save_ac_tool_prefix
+cross_compiling=$save_cross_compiling
+
+dnl Restore the old definitions
+dnl
+popdef([ac_link])dnl
+popdef([ac_compile])dnl
+popdef([ac_cpp])dnl
+popdef([ac_cv_host_os])dnl
+popdef([ac_cv_host_vendor])dnl
+popdef([ac_cv_host_cpu])dnl
+popdef([ac_cv_host_alias])dnl
+popdef([ac_cv_host])dnl
+popdef([host_os])dnl
+popdef([host_vendor])dnl
+popdef([host_cpu])dnl
+popdef([host_alias])dnl
+popdef([host])dnl
+popdef([LDFLAGS])dnl
+popdef([CPPFLAGS])dnl
+popdef([CFLAGS])dnl
+popdef([CPP])dnl
+popdef([CC])dnl
+popdef([ac_objext])dnl
+popdef([ac_exeext])dnl
+popdef([ac_cv_objext])dnl
+popdef([ac_cv_exeext])dnl
+popdef([ac_cv_prog_cc_g])dnl
+popdef([ac_cv_prog_cc_cross])dnl
+popdef([ac_cv_prog_cc_works])dnl
+popdef([ac_cv_prog_gcc])dnl
+popdef([ac_cv_prog_CPP])dnl
+
+dnl Finally, set Makefile variables
+dnl
+BUILD_EXEEXT=$ac_build_exeext
+BUILD_OBJEXT=$ac_build_objext
+AC_SUBST(BUILD_EXEEXT)dnl
+AC_SUBST(BUILD_OBJEXT)dnl
+AC_SUBST([CFLAGS_FOR_BUILD])dnl
+AC_SUBST([CPPFLAGS_FOR_BUILD])dnl
+AC_SUBST([LDFLAGS_FOR_BUILD])dnl
+])
diff --git a/depend/zcash/src/secp256k1/build-aux/m4/bitcoin_secp.m4 b/depend/zcash/src/secp256k1/build-aux/m4/bitcoin_secp.m4
new file mode 100644
index 000000000..7b48a5e58
--- /dev/null
+++ b/depend/zcash/src/secp256k1/build-aux/m4/bitcoin_secp.m4
@@ -0,0 +1,97 @@
+dnl escape "$0x" below using the m4 quadrigaph @S|@, and escape it again with a \ for the shell.
+AC_DEFUN([SECP_64BIT_ASM_CHECK],[
+AC_MSG_CHECKING(for x86_64 assembly availability)
+AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[
+  #include <stdint.h>]],[[
+  uint64_t a = 11, tmp;
+  __asm__ __volatile__("movq \@S|@0x100000000,%1; mulq %%rsi" : "+a"(a) : "S"(tmp) : "cc", "%rdx");
+  ]])],[has_64bit_asm=yes],[has_64bit_asm=no])
+AC_MSG_RESULT([$has_64bit_asm])
+])
+
+dnl
+AC_DEFUN([SECP_OPENSSL_CHECK],[
+  has_libcrypto=no
+  m4_ifdef([PKG_CHECK_MODULES],[
+    PKG_CHECK_MODULES([CRYPTO], [libcrypto], [has_libcrypto=yes],[has_libcrypto=no])
+    if test x"$has_libcrypto" = x"yes"; then
+      TEMP_LIBS="$LIBS"
+      LIBS="$LIBS $CRYPTO_LIBS"
+      AC_CHECK_LIB(crypto, main,[AC_DEFINE(HAVE_LIBCRYPTO,1,[Define this symbol if libcrypto is installed])],[has_libcrypto=no])
+      LIBS="$TEMP_LIBS"
+    fi
+  ])
+  if test x$has_libcrypto = xno; then
+    AC_CHECK_HEADER(openssl/crypto.h,[
+      AC_CHECK_LIB(crypto, main,[
+        has_libcrypto=yes
+        CRYPTO_LIBS=-lcrypto
+        AC_DEFINE(HAVE_LIBCRYPTO,1,[Define this symbol if libcrypto is installed])
+      ])
+    ])
+    LIBS=
+  fi
+if test x"$has_libcrypto" = x"yes" && test x"$has_openssl_ec" = x; then
+  AC_MSG_CHECKING(for EC functions in libcrypto)
+  CPPFLAGS_TEMP="$CPPFLAGS"
+  CPPFLAGS="$CRYPTO_CPPFLAGS $CPPFLAGS"
+  AC_COMPILE_IFELSE([AC_LANG_PROGRAM([[
+    #include <openssl/bn.h>
+    #include <openssl/ec.h>
+    #include <openssl/ecdsa.h>
+    #include <openssl/obj_mac.h>]],[[
+    # if OPENSSL_VERSION_NUMBER < 0x10100000L
+    void ECDSA_SIG_get0(const ECDSA_SIG *sig, const BIGNUM **pr, const BIGNUM **ps) {(void)sig->r; (void)sig->s;}
+    # endif
+
+    unsigned int zero = 0;
+    const unsigned char *zero_ptr = (unsigned char*)&zero;
+    EC_KEY_free(EC_KEY_new_by_curve_name(NID_secp256k1));
+    EC_KEY *eckey = EC_KEY_new();
+    EC_GROUP *group = EC_GROUP_new_by_curve_name(NID_secp256k1);
+    EC_KEY_set_group(eckey, group);
+    ECDSA_sign(0, NULL, 0, NULL, &zero, eckey);
+    ECDSA_verify(0, NULL, 0, NULL, 0, eckey);
+    o2i_ECPublicKey(&eckey, &zero_ptr, 0);
+    d2i_ECPrivateKey(&eckey, &zero_ptr, 0);
+    EC_KEY_check_key(eckey);
+    EC_KEY_free(eckey);
+    EC_GROUP_free(group);
+    ECDSA_SIG *sig_openssl;
+    sig_openssl = ECDSA_SIG_new();
+    d2i_ECDSA_SIG(&sig_openssl, &zero_ptr, 0);
+    i2d_ECDSA_SIG(sig_openssl, NULL);
+    ECDSA_SIG_get0(sig_openssl, NULL, NULL);
+    ECDSA_SIG_free(sig_openssl);
+    const BIGNUM *bignum = BN_value_one();
+    BN_is_negative(bignum);
+    BN_num_bits(bignum);
+    if (sizeof(zero) >= BN_num_bytes(bignum)) {
+        BN_bn2bin(bignum, (unsigned char*)&zero);
+    }
+  ]])],[has_openssl_ec=yes],[has_openssl_ec=no])
+  AC_MSG_RESULT([$has_openssl_ec])
+  CPPFLAGS="$CPPFLAGS_TEMP"
+fi
+])
+
+dnl
+AC_DEFUN([SECP_GMP_CHECK],[
+if test x"$has_gmp" != x"yes"; then
+  CPPFLAGS_TEMP="$CPPFLAGS"
+  CPPFLAGS="$GMP_CPPFLAGS $CPPFLAGS"
+  LIBS_TEMP="$LIBS"
+  LIBS="$GMP_LIBS $LIBS"
+  AC_CHECK_HEADER(gmp.h,[AC_CHECK_LIB(gmp, __gmpz_init,[has_gmp=yes; GMP_LIBS="$GMP_LIBS -lgmp"; AC_DEFINE(HAVE_LIBGMP,1,[Define this symbol if libgmp is installed])])])
+  CPPFLAGS="$CPPFLAGS_TEMP"
+  LIBS="$LIBS_TEMP"
+fi
+])
+
+AC_DEFUN([SECP_VALGRIND_CHECK],[
+if test x"$has_valgrind" != x"yes"; then
+  CPPFLAGS_TEMP="$CPPFLAGS"
+  CPPFLAGS="$VALGRIND_CPPFLAGS $CPPFLAGS"
+  AC_CHECK_HEADER([valgrind/memcheck.h], [has_valgrind=yes; AC_DEFINE(HAVE_VALGRIND,1,[Define this symbol if valgrind is installed])])
+fi
+])
diff --git a/depend/zcash/src/secp256k1/configure.ac b/depend/zcash/src/secp256k1/configure.ac
new file mode 100644
index 000000000..c546cfe64
--- /dev/null
+++ b/depend/zcash/src/secp256k1/configure.ac
@@ -0,0 +1,585 @@
+AC_PREREQ([2.60])
+AC_INIT([libsecp256k1],[0.1])
+AC_CONFIG_AUX_DIR([build-aux])
+AC_CONFIG_MACRO_DIR([build-aux/m4])
+AC_CANONICAL_HOST
+AH_TOP([#ifndef LIBSECP256K1_CONFIG_H])
+AH_TOP([#define LIBSECP256K1_CONFIG_H])
+AH_BOTTOM([#endif /*LIBSECP256K1_CONFIG_H*/])
+AM_INIT_AUTOMAKE([foreign subdir-objects])
+
+# Set -g if CFLAGS are not already set, which matches the default autoconf
+# behavior (see PROG_CC in the Autoconf manual) with the exception that we don't
+# set -O2 here because we set it in any case (see further down).
+: ${CFLAGS="-g"}
+LT_INIT
+
+# Make the compilation flags quiet unless V=1 is used.
+m4_ifdef([AM_SILENT_RULES], [AM_SILENT_RULES([yes])])
+
+PKG_PROG_PKG_CONFIG
+
+AC_PATH_TOOL(AR, ar)
+AC_PATH_TOOL(RANLIB, ranlib)
+AC_PATH_TOOL(STRIP, strip)
+
+AM_PROG_CC_C_O
+
+AC_PROG_CC_C99
+if test x"$ac_cv_prog_cc_c99" = x"no"; then
+  AC_MSG_ERROR([c99 compiler support required])
+fi
+AM_PROG_AS
+
+case $host_os in
+  *darwin*)
+     if  test x$cross_compiling != xyes; then
+       AC_PATH_PROG([BREW],brew,)
+       if test x$BREW != x; then
+         # These Homebrew packages may be keg-only, meaning that they won't be found
+         # in expected paths because they may conflict with system files. Ask
+         # Homebrew where each one is located, then adjust paths accordingly.
+         openssl_prefix=`$BREW --prefix openssl 2>/dev/null`
+         gmp_prefix=`$BREW --prefix gmp 2>/dev/null`
+         valgrind_prefix=`$BREW --prefix valgrind 2>/dev/null`
+         if test x$openssl_prefix != x; then
+           PKG_CONFIG_PATH="$openssl_prefix/lib/pkgconfig:$PKG_CONFIG_PATH"
+           export PKG_CONFIG_PATH
+           CRYPTO_CPPFLAGS="-I$openssl_prefix/include"
+         fi
+         if test x$gmp_prefix != x; then
+           GMP_CPPFLAGS="-I$gmp_prefix/include"
+           GMP_LIBS="-L$gmp_prefix/lib"
+         fi
+         if test x$valgrind_prefix != x; then
+           VALGRIND_CPPFLAGS="-I$valgrind_prefix/include"
+         fi
+       else
+         AC_PATH_PROG([PORT],port,)
+         # If homebrew isn't installed and macports is, add the macports default paths
+         # as a last resort.
+         if test x$PORT != x; then
+           CPPFLAGS="$CPPFLAGS -isystem /opt/local/include"
+           LDFLAGS="$LDFLAGS -L/opt/local/lib"
+         fi
+       fi
+     fi
+   ;;
+esac
+
+CFLAGS="-W $CFLAGS"
+
+warn_CFLAGS="-std=c99 -pedantic -Wall -Wextra -Wcast-align -Wnested-externs -Wshadow -Wstrict-prototypes -Wundef -Wno-unused-function -Wno-long-long -Wno-overlength-strings"
+saved_CFLAGS="$CFLAGS"
+CFLAGS="$warn_CFLAGS $CFLAGS"
+AC_MSG_CHECKING([if ${CC} supports ${warn_CFLAGS}])
+AC_COMPILE_IFELSE([AC_LANG_SOURCE([[char foo;]])],
+    [ AC_MSG_RESULT([yes]) ],
+    [ AC_MSG_RESULT([no])
+      CFLAGS="$saved_CFLAGS"
+    ])
+
+saved_CFLAGS="$CFLAGS"
+CFLAGS="-fvisibility=hidden $CFLAGS"
+AC_MSG_CHECKING([if ${CC} supports -fvisibility=hidden])
+AC_COMPILE_IFELSE([AC_LANG_SOURCE([[char foo;]])],
+    [ AC_MSG_RESULT([yes]) ],
+    [ AC_MSG_RESULT([no])
+      CFLAGS="$saved_CFLAGS"
+    ])
+
+###
+### Define config arguments
+###
+
+AC_ARG_ENABLE(benchmark,
+    AS_HELP_STRING([--enable-benchmark],[compile benchmark [default=yes]]),
+    [use_benchmark=$enableval],
+    [use_benchmark=yes])
+
+AC_ARG_ENABLE(coverage,
+    AS_HELP_STRING([--enable-coverage],[enable compiler flags to support kcov coverage analysis [default=no]]),
+    [enable_coverage=$enableval],
+    [enable_coverage=no])
+
+AC_ARG_ENABLE(tests,
+    AS_HELP_STRING([--enable-tests],[compile tests [default=yes]]),
+    [use_tests=$enableval],
+    [use_tests=yes])
+
+AC_ARG_ENABLE(openssl_tests,
+    AS_HELP_STRING([--enable-openssl-tests],[enable OpenSSL tests [default=auto]]),
+    [enable_openssl_tests=$enableval],
+    [enable_openssl_tests=auto])
+
+AC_ARG_ENABLE(experimental,
+    AS_HELP_STRING([--enable-experimental],[allow experimental configure options [default=no]]),
+    [use_experimental=$enableval],
+    [use_experimental=no])
+
+AC_ARG_ENABLE(exhaustive_tests,
+    AS_HELP_STRING([--enable-exhaustive-tests],[compile exhaustive tests [default=yes]]),
+    [use_exhaustive_tests=$enableval],
+    [use_exhaustive_tests=yes])
+
+AC_ARG_ENABLE(ecmult_static_precomputation,
+    AS_HELP_STRING([--enable-ecmult-static-precomputation],[enable precomputed ecmult table for signing [default=auto]]),
+    [use_ecmult_static_precomputation=$enableval],
+    [use_ecmult_static_precomputation=auto])
+
+AC_ARG_ENABLE(module_ecdh,
+    AS_HELP_STRING([--enable-module-ecdh],[enable ECDH shared secret computation]),
+    [enable_module_ecdh=$enableval],
+    [enable_module_ecdh=no])
+
+AC_ARG_ENABLE(module_recovery,
+    AS_HELP_STRING([--enable-module-recovery],[enable ECDSA pubkey recovery module [default=no]]),
+    [enable_module_recovery=$enableval],
+    [enable_module_recovery=no])
+
+AC_ARG_ENABLE(module_extrakeys,
+    AS_HELP_STRING([--enable-module-extrakeys],[enable extrakeys module (experimental)]),
+    [enable_module_extrakeys=$enableval],
+    [enable_module_extrakeys=no])
+
+AC_ARG_ENABLE(module_schnorrsig,
+    AS_HELP_STRING([--enable-module-schnorrsig],[enable schnorrsig module (experimental)]),
+    [enable_module_schnorrsig=$enableval],
+    [enable_module_schnorrsig=no])
+
+AC_ARG_ENABLE(external_default_callbacks,
+    AS_HELP_STRING([--enable-external-default-callbacks],[enable external default callback functions [default=no]]),
+    [use_external_default_callbacks=$enableval],
+    [use_external_default_callbacks=no])
+
+# Test-only override of the (autodetected by the C code) "widemul" setting.
+# Legal values are int64 (for [u]int64_t), int128 (for [unsigned] __int128), and auto (the default).
+AC_ARG_WITH([test-override-wide-multiply], [] ,[set_widemul=$withval], [set_widemul=auto])
+
+AC_ARG_WITH([bignum], [AS_HELP_STRING([--with-bignum=gmp|no|auto],
+[bignum implementation to use [default=auto]])],[req_bignum=$withval], [req_bignum=auto])
+
+AC_ARG_WITH([asm], [AS_HELP_STRING([--with-asm=x86_64|arm|no|auto],
+[assembly optimizations to use (experimental: arm) [default=auto]])],[req_asm=$withval], [req_asm=auto])
+
+AC_ARG_WITH([ecmult-window], [AS_HELP_STRING([--with-ecmult-window=SIZE|auto],
+[window size for ecmult precomputation for verification, specified as integer in range [2..24].]
+[Larger values result in possibly better performance at the cost of an exponentially larger precomputed table.]
+[The table will store 2^(SIZE-1) * 64 bytes of data but can be larger in memory due to platform-specific padding and alignment.]
+["auto" is a reasonable setting for desktop machines (currently 15). [default=auto]]
+)],
+[req_ecmult_window=$withval], [req_ecmult_window=auto])
+
+AC_ARG_WITH([ecmult-gen-precision], [AS_HELP_STRING([--with-ecmult-gen-precision=2|4|8|auto],
+[Precision bits to tune the precomputed table size for signing.]
+[The size of the table is 32kB for 2 bits, 64kB for 4 bits, 512kB for 8 bits of precision.]
+[A larger table size usually results in possible faster signing.]
+["auto" is a reasonable setting for desktop machines (currently 4). [default=auto]]
+)],
+[req_ecmult_gen_precision=$withval], [req_ecmult_gen_precision=auto])
+
+AC_ARG_WITH([valgrind], [AS_HELP_STRING([--with-valgrind=yes|no|auto],
+[Build with extra checks for running inside Valgrind [default=auto]]
+)],
+[req_valgrind=$withval], [req_valgrind=auto])
+
+###
+### Handle config options (except for modules)
+###
+
+if test x"$req_valgrind" = x"no"; then
+  enable_valgrind=no
+else
+  SECP_VALGRIND_CHECK
+  if test x"$has_valgrind" != x"yes"; then
+    if test x"$req_valgrind" = x"yes"; then
+      AC_MSG_ERROR([Valgrind support explicitly requested but valgrind/memcheck.h header not available])
+    fi
+    enable_valgrind=no
+  else
+    enable_valgrind=yes
+  fi
+fi
+AM_CONDITIONAL([VALGRIND_ENABLED],[test "$enable_valgrind" = "yes"])
+
+if test x"$enable_coverage" = x"yes"; then
+    AC_DEFINE(COVERAGE, 1, [Define this symbol to compile out all VERIFY code])
+    CFLAGS="-O0 --coverage $CFLAGS"
+    LDFLAGS="--coverage $LDFLAGS"
+else
+    CFLAGS="-O2 $CFLAGS"
+fi
+
+if test x"$req_asm" = x"auto"; then
+  SECP_64BIT_ASM_CHECK
+  if test x"$has_64bit_asm" = x"yes"; then
+    set_asm=x86_64
+  fi
+  if test x"$set_asm" = x; then
+    set_asm=no
+  fi
+else
+  set_asm=$req_asm
+  case $set_asm in
+  x86_64)
+    SECP_64BIT_ASM_CHECK
+    if test x"$has_64bit_asm" != x"yes"; then
+      AC_MSG_ERROR([x86_64 assembly optimization requested but not available])
+    fi
+    ;;
+  arm)
+    ;;
+  no)
+    ;;
+  *)
+    AC_MSG_ERROR([invalid assembly optimization selection])
+    ;;
+  esac
+fi
+
+if test x"$req_bignum" = x"auto"; then
+  SECP_GMP_CHECK
+  if test x"$has_gmp" = x"yes"; then
+    set_bignum=gmp
+  fi
+
+  if test x"$set_bignum" = x; then
+    set_bignum=no
+  fi
+else
+  set_bignum=$req_bignum
+  case $set_bignum in
+  gmp)
+    SECP_GMP_CHECK
+    if test x"$has_gmp" != x"yes"; then
+      AC_MSG_ERROR([gmp bignum explicitly requested but libgmp not available])
+    fi
+    ;;
+  no)
+    ;;
+  *)
+    AC_MSG_ERROR([invalid bignum implementation selection])
+    ;;
+  esac
+fi
+
+# Select assembly optimization
+use_external_asm=no
+
+case $set_asm in
+x86_64)
+  AC_DEFINE(USE_ASM_X86_64, 1, [Define this symbol to enable x86_64 assembly optimizations])
+  ;;
+arm)
+  use_external_asm=yes
+  ;;
+no)
+  ;;
+*)
+  AC_MSG_ERROR([invalid assembly optimizations])
+  ;;
+esac
+
+if test x"$use_external_asm" = x"yes"; then
+  AC_DEFINE(USE_EXTERNAL_ASM, 1, [Define this symbol if an external (non-inline) assembly implementation is used])
+fi
+
+
+# Select wide multiplication implementation
+case $set_widemul in
+int128)
+  AC_DEFINE(USE_FORCE_WIDEMUL_INT128, 1, [Define this symbol to force the use of the (unsigned) __int128 based wide multiplication implementation])
+  ;;
+int64)
+  AC_DEFINE(USE_FORCE_WIDEMUL_INT64, 1, [Define this symbol to force the use of the (u)int64_t based wide multiplication implementation])
+  ;;
+auto)
+  ;;
+*)
+  AC_MSG_ERROR([invalid wide multiplication implementation])
+  ;;
+esac
+
+# Select bignum implementation
+case $set_bignum in
+gmp)
+  AC_DEFINE(HAVE_LIBGMP, 1, [Define this symbol if libgmp is installed])
+  AC_DEFINE(USE_NUM_GMP, 1, [Define this symbol to use the gmp implementation for num])
+  AC_DEFINE(USE_FIELD_INV_NUM, 1, [Define this symbol to use the num-based field inverse implementation])
+  AC_DEFINE(USE_SCALAR_INV_NUM, 1, [Define this symbol to use the num-based scalar inverse implementation])
+  ;;
+no)
+  AC_DEFINE(USE_NUM_NONE, 1, [Define this symbol to use no num implementation])
+  AC_DEFINE(USE_FIELD_INV_BUILTIN, 1, [Define this symbol to use the native field inverse implementation])
+  AC_DEFINE(USE_SCALAR_INV_BUILTIN, 1, [Define this symbol to use the native scalar inverse implementation])
+  ;;
+*)
+  AC_MSG_ERROR([invalid bignum implementation])
+  ;;
+esac
+
+# Set ecmult window size
+if test x"$req_ecmult_window" = x"auto"; then
+  set_ecmult_window=15
+else
+  set_ecmult_window=$req_ecmult_window
+fi
+
+error_window_size=['window size for ecmult precomputation not an integer in range [2..24] or "auto"']
+case $set_ecmult_window in
+''|*[[!0-9]]*)
+  # no valid integer
+  AC_MSG_ERROR($error_window_size)
+  ;;
+*)
+  if test "$set_ecmult_window" -lt 2 -o "$set_ecmult_window" -gt 24 ; then
+    # not in range
+    AC_MSG_ERROR($error_window_size)
+  fi
+  AC_DEFINE_UNQUOTED(ECMULT_WINDOW_SIZE, $set_ecmult_window, [Set window size for ecmult precomputation])
+  ;;
+esac
+
+# Set ecmult gen precision
+if test x"$req_ecmult_gen_precision" = x"auto"; then
+  set_ecmult_gen_precision=4
+else
+  set_ecmult_gen_precision=$req_ecmult_gen_precision
+fi
+
+case $set_ecmult_gen_precision in
+2|4|8)
+  AC_DEFINE_UNQUOTED(ECMULT_GEN_PREC_BITS, $set_ecmult_gen_precision, [Set ecmult gen precision bits])
+  ;;
+*)
+  AC_MSG_ERROR(['ecmult gen precision not 2, 4, 8 or "auto"'])
+  ;;
+esac
+
+if test x"$use_tests" = x"yes"; then
+  SECP_OPENSSL_CHECK
+  if test x"$enable_openssl_tests" != x"no" && test x"$has_openssl_ec" = x"yes"; then
+      enable_openssl_tests=yes
+      AC_DEFINE(ENABLE_OPENSSL_TESTS, 1, [Define this symbol if OpenSSL EC functions are available])
+      SECP_TEST_INCLUDES="$SSL_CFLAGS $CRYPTO_CFLAGS $CRYPTO_CPPFLAGS"
+      SECP_TEST_LIBS="$CRYPTO_LIBS"
+
+      case $host in
+      *mingw*)
+        SECP_TEST_LIBS="$SECP_TEST_LIBS -lgdi32"
+        ;;
+      esac
+  else
+    if test x"$enable_openssl_tests" = x"yes"; then
+      AC_MSG_ERROR([OpenSSL tests requested but OpenSSL with EC support is not available])
+    fi
+    enable_openssl_tests=no
+  fi
+else
+  if test x"$enable_openssl_tests" = x"yes"; then
+    AC_MSG_ERROR([OpenSSL tests requested but tests are not enabled])
+  fi
+  enable_openssl_tests=no
+fi
+
+if test x"$set_bignum" = x"gmp"; then
+  SECP_LIBS="$SECP_LIBS $GMP_LIBS"
+  SECP_INCLUDES="$SECP_INCLUDES $GMP_CPPFLAGS"
+fi
+
+if test x"$enable_valgrind" = x"yes"; then
+  SECP_INCLUDES="$SECP_INCLUDES $VALGRIND_CPPFLAGS"
+fi
+
+# Handle static precomputation (after everything which modifies CFLAGS and friends)
+if test x"$use_ecmult_static_precomputation" != x"no"; then
+  if test x"$cross_compiling" = x"no"; then
+    set_precomp=yes
+    if test x"${CC_FOR_BUILD+x}${CFLAGS_FOR_BUILD+x}${CPPFLAGS_FOR_BUILD+x}${LDFLAGS_FOR_BUILD+x}" != x; then
+      AC_MSG_WARN([CC_FOR_BUILD, CFLAGS_FOR_BUILD, CPPFLAGS_FOR_BUILD, and/or LDFLAGS_FOR_BUILD is set but ignored because we are not cross-compiling.])
+    fi
+    # If we're not cross-compiling, simply use the same compiler for building the static precompation code.
+    CC_FOR_BUILD="$CC"
+    CFLAGS_FOR_BUILD="$CFLAGS"
+    CPPFLAGS_FOR_BUILD="$CPPFLAGS"
+    LDFLAGS_FOR_BUILD="$LDFLAGS"
+  else
+    AX_PROG_CC_FOR_BUILD
+
+    # Temporarily switch to an environment for the native compiler
+    save_cross_compiling=$cross_compiling
+    cross_compiling=no
+    SAVE_CC="$CC"
+    CC="$CC_FOR_BUILD"
+    SAVE_CFLAGS="$CFLAGS"
+    CFLAGS="$CFLAGS_FOR_BUILD"
+    SAVE_CPPFLAGS="$CPPFLAGS"
+    CPPFLAGS="$CPPFLAGS_FOR_BUILD"
+    SAVE_LDFLAGS="$LDFLAGS"
+    LDFLAGS="$LDFLAGS_FOR_BUILD"
+
+    warn_CFLAGS_FOR_BUILD="-Wall -Wextra -Wno-unused-function"
+    saved_CFLAGS="$CFLAGS"
+    CFLAGS="$warn_CFLAGS_FOR_BUILD $CFLAGS"
+    AC_MSG_CHECKING([if native ${CC_FOR_BUILD} supports ${warn_CFLAGS_FOR_BUILD}])
+    AC_COMPILE_IFELSE([AC_LANG_SOURCE([[char foo;]])],
+        [ AC_MSG_RESULT([yes]) ],
+        [ AC_MSG_RESULT([no])
+          CFLAGS="$saved_CFLAGS"
+        ])
+
+    AC_MSG_CHECKING([for working native compiler: ${CC_FOR_BUILD}])
+    AC_RUN_IFELSE(
+      [AC_LANG_PROGRAM([], [])],
+      [working_native_cc=yes],
+      [working_native_cc=no],[:])
+
+    CFLAGS_FOR_BUILD="$CFLAGS"
+
+    # Restore the environment
+    cross_compiling=$save_cross_compiling
+    CC="$SAVE_CC"
+    CFLAGS="$SAVE_CFLAGS"
+    CPPFLAGS="$SAVE_CPPFLAGS"
+    LDFLAGS="$SAVE_LDFLAGS"
+
+    if test x"$working_native_cc" = x"no"; then
+      AC_MSG_RESULT([no])
+      set_precomp=no
+      m4_define([please_set_for_build], [Please set CC_FOR_BUILD, CFLAGS_FOR_BUILD, CPPFLAGS_FOR_BUILD, and/or LDFLAGS_FOR_BUILD.])
+      if test x"$use_ecmult_static_precomputation" = x"yes";  then
+        AC_MSG_ERROR([native compiler ${CC_FOR_BUILD} does not produce working binaries. please_set_for_build])
+      else
+        AC_MSG_WARN([Disabling statically generated ecmult table because the native compiler ${CC_FOR_BUILD} does not produce working binaries. please_set_for_build])
+      fi
+    else
+      AC_MSG_RESULT([yes])
+      set_precomp=yes
+    fi
+  fi
+
+  AC_SUBST(CC_FOR_BUILD)
+  AC_SUBST(CFLAGS_FOR_BUILD)
+  AC_SUBST(CPPFLAGS_FOR_BUILD)
+  AC_SUBST(LDFLAGS_FOR_BUILD)
+else
+  set_precomp=no
+fi
+
+if test x"$set_precomp" = x"yes"; then
+  AC_DEFINE(USE_ECMULT_STATIC_PRECOMPUTATION, 1, [Define this symbol to use a statically generated ecmult table])
+fi
+
+###
+### Handle module options
+###
+
+if test x"$enable_module_ecdh" = x"yes"; then
+  AC_DEFINE(ENABLE_MODULE_ECDH, 1, [Define this symbol to enable the ECDH module])
+fi
+
+if test x"$enable_module_recovery" = x"yes"; then
+  AC_DEFINE(ENABLE_MODULE_RECOVERY, 1, [Define this symbol to enable the ECDSA pubkey recovery module])
+fi
+
+if test x"$enable_module_schnorrsig" = x"yes"; then
+  AC_DEFINE(ENABLE_MODULE_SCHNORRSIG, 1, [Define this symbol to enable the schnorrsig module])
+  enable_module_extrakeys=yes
+fi
+
+# Test if extrakeys is set after the schnorrsig module to allow the schnorrsig
+# module to set enable_module_extrakeys=yes
+if test x"$enable_module_extrakeys" = x"yes"; then
+  AC_DEFINE(ENABLE_MODULE_EXTRAKEYS, 1, [Define this symbol to enable the extrakeys module])
+fi
+
+if test x"$use_external_default_callbacks" = x"yes"; then
+  AC_DEFINE(USE_EXTERNAL_DEFAULT_CALLBACKS, 1, [Define this symbol if an external implementation of the default callbacks is used])
+fi
+
+###
+### Check for --enable-experimental if necessary
+###
+
+if test x"$enable_experimental" = x"yes"; then
+  AC_MSG_NOTICE([******])
+  AC_MSG_NOTICE([WARNING: experimental build])
+  AC_MSG_NOTICE([Experimental features do not have stable APIs or properties, and may not be safe for production use.])
+  AC_MSG_NOTICE([Building extrakeys module: $enable_module_extrakeys])
+  AC_MSG_NOTICE([Building schnorrsig module: $enable_module_schnorrsig])
+  AC_MSG_NOTICE([******])
+else
+  if test x"$enable_module_extrakeys" = x"yes"; then
+    AC_MSG_ERROR([extrakeys module is experimental. Use --enable-experimental to allow.])
+  fi
+  if test x"$enable_module_schnorrsig" = x"yes"; then
+    AC_MSG_ERROR([schnorrsig module is experimental. Use --enable-experimental to allow.])
+  fi
+  if test x"$set_asm" = x"arm"; then
+    AC_MSG_ERROR([ARM assembly optimization is experimental. Use --enable-experimental to allow.])
+  fi
+fi
+
+###
+### Generate output
+###
+
+AC_CONFIG_HEADERS([src/libsecp256k1-config.h])
+AC_CONFIG_FILES([Makefile libsecp256k1.pc])
+AC_SUBST(SECP_INCLUDES)
+AC_SUBST(SECP_LIBS)
+AC_SUBST(SECP_TEST_LIBS)
+AC_SUBST(SECP_TEST_INCLUDES)
+AM_CONDITIONAL([ENABLE_COVERAGE], [test x"$enable_coverage" = x"yes"])
+AM_CONDITIONAL([USE_TESTS], [test x"$use_tests" != x"no"])
+AM_CONDITIONAL([USE_EXHAUSTIVE_TESTS], [test x"$use_exhaustive_tests" != x"no"])
+AM_CONDITIONAL([USE_BENCHMARK], [test x"$use_benchmark" = x"yes"])
+AM_CONDITIONAL([USE_ECMULT_STATIC_PRECOMPUTATION], [test x"$set_precomp" = x"yes"])
+AM_CONDITIONAL([ENABLE_MODULE_ECDH], [test x"$enable_module_ecdh" = x"yes"])
+AM_CONDITIONAL([ENABLE_MODULE_RECOVERY], [test x"$enable_module_recovery" = x"yes"])
+AM_CONDITIONAL([ENABLE_MODULE_EXTRAKEYS], [test x"$enable_module_extrakeys" = x"yes"])
+AM_CONDITIONAL([ENABLE_MODULE_SCHNORRSIG], [test x"$enable_module_schnorrsig" = x"yes"])
+AM_CONDITIONAL([USE_EXTERNAL_ASM], [test x"$use_external_asm" = x"yes"])
+AM_CONDITIONAL([USE_ASM_ARM], [test x"$set_asm" = x"arm"])
+
+# Make sure nothing new is exported so that we don't break the cache.
+PKGCONFIG_PATH_TEMP="$PKG_CONFIG_PATH"
+unset PKG_CONFIG_PATH
+PKG_CONFIG_PATH="$PKGCONFIG_PATH_TEMP"
+
+AC_OUTPUT
+
+echo
+echo "Build Options:"
+echo "  with ecmult precomp     = $set_precomp"
+echo "  with external callbacks = $use_external_default_callbacks"
+echo "  with benchmarks         = $use_benchmark"
+echo "  with tests              = $use_tests"
+echo "  with openssl tests      = $enable_openssl_tests"
+echo "  with coverage           = $enable_coverage"
+echo "  module ecdh             = $enable_module_ecdh"
+echo "  module recovery         = $enable_module_recovery"
+echo "  module extrakeys        = $enable_module_extrakeys"
+echo "  module schnorrsig       = $enable_module_schnorrsig"
+echo
+echo "  asm                     = $set_asm"
+echo "  bignum                  = $set_bignum"
+echo "  ecmult window size      = $set_ecmult_window"
+echo "  ecmult gen prec. bits   = $set_ecmult_gen_precision"
+# Hide test-only options unless they're used.
+if test x"$set_widemul" != xauto; then
+echo "  wide multiplication     = $set_widemul"
+fi
+echo
+echo "  valgrind                = $enable_valgrind"
+echo "  CC                      = $CC"
+echo "  CFLAGS                  = $CFLAGS"
+echo "  CPPFLAGS                = $CPPFLAGS"
+echo "  LDFLAGS                 = $LDFLAGS"
+echo
+if test x"$set_precomp" = x"yes"; then
+echo "  CC_FOR_BUILD            = $CC_FOR_BUILD"
+echo "  CFLAGS_FOR_BUILD        = $CFLAGS_FOR_BUILD"
+echo "  CPPFLAGS_FOR_BUILD      = $CPPFLAGS_FOR_BUILD"
+echo "  LDFLAGS_FOR_BUILD       = $LDFLAGS_FOR_BUILD"
+fi
diff --git a/depend/zcash/src/secp256k1/contrib/lax_der_parsing.c b/depend/zcash/src/secp256k1/contrib/lax_der_parsing.c
new file mode 100644
index 000000000..c1627e37e
--- /dev/null
+++ b/depend/zcash/src/secp256k1/contrib/lax_der_parsing.c
@@ -0,0 +1,149 @@
+/***********************************************************************
+ * Copyright (c) 2015 Pieter Wuille                                    *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#include <string.h>
+#include <secp256k1.h>
+
+#include "lax_der_parsing.h"
+
+int ecdsa_signature_parse_der_lax(const secp256k1_context* ctx, secp256k1_ecdsa_signature* sig, const unsigned char *input, size_t inputlen) {
+    size_t rpos, rlen, spos, slen;
+    size_t pos = 0;
+    size_t lenbyte;
+    unsigned char tmpsig[64] = {0};
+    int overflow = 0;
+
+    /* Hack to initialize sig with a correctly-parsed but invalid signature. */
+    secp256k1_ecdsa_signature_parse_compact(ctx, sig, tmpsig);
+
+    /* Sequence tag byte */
+    if (pos == inputlen || input[pos] != 0x30) {
+        return 0;
+    }
+    pos++;
+
+    /* Sequence length bytes */
+    if (pos == inputlen) {
+        return 0;
+    }
+    lenbyte = input[pos++];
+    if (lenbyte & 0x80) {
+        lenbyte -= 0x80;
+        if (lenbyte > inputlen - pos) {
+            return 0;
+        }
+        pos += lenbyte;
+    }
+
+    /* Integer tag byte for R */
+    if (pos == inputlen || input[pos] != 0x02) {
+        return 0;
+    }
+    pos++;
+
+    /* Integer length for R */
+    if (pos == inputlen) {
+        return 0;
+    }
+    lenbyte = input[pos++];
+    if (lenbyte & 0x80) {
+        lenbyte -= 0x80;
+        if (lenbyte > inputlen - pos) {
+            return 0;
+        }
+        while (lenbyte > 0 && input[pos] == 0) {
+            pos++;
+            lenbyte--;
+        }
+        if (lenbyte >= sizeof(size_t)) {
+            return 0;
+        }
+        rlen = 0;
+        while (lenbyte > 0) {
+            rlen = (rlen << 8) + input[pos];
+            pos++;
+            lenbyte--;
+        }
+    } else {
+        rlen = lenbyte;
+    }
+    if (rlen > inputlen - pos) {
+        return 0;
+    }
+    rpos = pos;
+    pos += rlen;
+
+    /* Integer tag byte for S */
+    if (pos == inputlen || input[pos] != 0x02) {
+        return 0;
+    }
+    pos++;
+
+    /* Integer length for S */
+    if (pos == inputlen) {
+        return 0;
+    }
+    lenbyte = input[pos++];
+    if (lenbyte & 0x80) {
+        lenbyte -= 0x80;
+        if (lenbyte > inputlen - pos) {
+            return 0;
+        }
+        while (lenbyte > 0 && input[pos] == 0) {
+            pos++;
+            lenbyte--;
+        }
+        if (lenbyte >= sizeof(size_t)) {
+            return 0;
+        }
+        slen = 0;
+        while (lenbyte > 0) {
+            slen = (slen << 8) + input[pos];
+            pos++;
+            lenbyte--;
+        }
+    } else {
+        slen = lenbyte;
+    }
+    if (slen > inputlen - pos) {
+        return 0;
+    }
+    spos = pos;
+
+    /* Ignore leading zeroes in R */
+    while (rlen > 0 && input[rpos] == 0) {
+        rlen--;
+        rpos++;
+    }
+    /* Copy R value */
+    if (rlen > 32) {
+        overflow = 1;
+    } else {
+        memcpy(tmpsig + 32 - rlen, input + rpos, rlen);
+    }
+
+    /* Ignore leading zeroes in S */
+    while (slen > 0 && input[spos] == 0) {
+        slen--;
+        spos++;
+    }
+    /* Copy S value */
+    if (slen > 32) {
+        overflow = 1;
+    } else {
+        memcpy(tmpsig + 64 - slen, input + spos, slen);
+    }
+
+    if (!overflow) {
+        overflow = !secp256k1_ecdsa_signature_parse_compact(ctx, sig, tmpsig);
+    }
+    if (overflow) {
+        memset(tmpsig, 0, 64);
+        secp256k1_ecdsa_signature_parse_compact(ctx, sig, tmpsig);
+    }
+    return 1;
+}
+
diff --git a/depend/zcash/src/secp256k1/contrib/lax_der_parsing.h b/depend/zcash/src/secp256k1/contrib/lax_der_parsing.h
new file mode 100644
index 000000000..6b7255e28
--- /dev/null
+++ b/depend/zcash/src/secp256k1/contrib/lax_der_parsing.h
@@ -0,0 +1,91 @@
+/***********************************************************************
+ * Copyright (c) 2015 Pieter Wuille                                    *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+/****
+ * Please do not link this file directly. It is not part of the libsecp256k1
+ * project and does not promise any stability in its API, functionality or
+ * presence. Projects which use this code should instead copy this header
+ * and its accompanying .c file directly into their codebase.
+ ****/
+
+/* This file defines a function that parses DER with various errors and
+ * violations. This is not a part of the library itself, because the allowed
+ * violations are chosen arbitrarily and do not follow or establish any
+ * standard.
+ *
+ * In many places it matters that different implementations do not only accept
+ * the same set of valid signatures, but also reject the same set of signatures.
+ * The only means to accomplish that is by strictly obeying a standard, and not
+ * accepting anything else.
+ *
+ * Nonetheless, sometimes there is a need for compatibility with systems that
+ * use signatures which do not strictly obey DER. The snippet below shows how
+ * certain violations are easily supported. You may need to adapt it.
+ *
+ * Do not use this for new systems. Use well-defined DER or compact signatures
+ * instead if you have the choice (see secp256k1_ecdsa_signature_parse_der and
+ * secp256k1_ecdsa_signature_parse_compact).
+ *
+ * The supported violations are:
+ * - All numbers are parsed as nonnegative integers, even though X.609-0207
+ *   section 8.3.3 specifies that integers are always encoded as two's
+ *   complement.
+ * - Integers can have length 0, even though section 8.3.1 says they can't.
+ * - Integers with overly long padding are accepted, violation section
+ *   8.3.2.
+ * - 127-byte long length descriptors are accepted, even though section
+ *   8.1.3.5.c says that they are not.
+ * - Trailing garbage data inside or after the signature is ignored.
+ * - The length descriptor of the sequence is ignored.
+ *
+ * Compared to for example OpenSSL, many violations are NOT supported:
+ * - Using overly long tag descriptors for the sequence or integers inside,
+ *   violating section 8.1.2.2.
+ * - Encoding primitive integers as constructed values, violating section
+ *   8.3.1.
+ */
+
+#ifndef SECP256K1_CONTRIB_LAX_DER_PARSING_H
+#define SECP256K1_CONTRIB_LAX_DER_PARSING_H
+
+#include <secp256k1.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/** Parse a signature in "lax DER" format
+ *
+ *  Returns: 1 when the signature could be parsed, 0 otherwise.
+ *  Args: ctx:      a secp256k1 context object
+ *  Out:  sig:      a pointer to a signature object
+ *  In:   input:    a pointer to the signature to be parsed
+ *        inputlen: the length of the array pointed to be input
+ *
+ *  This function will accept any valid DER encoded signature, even if the
+ *  encoded numbers are out of range. In addition, it will accept signatures
+ *  which violate the DER spec in various ways. Its purpose is to allow
+ *  validation of the Bitcoin blockchain, which includes non-DER signatures
+ *  from before the network rules were updated to enforce DER. Note that
+ *  the set of supported violations is a strict subset of what OpenSSL will
+ *  accept.
+ *
+ *  After the call, sig will always be initialized. If parsing failed or the
+ *  encoded numbers are out of range, signature validation with it is
+ *  guaranteed to fail for every message and public key.
+ */
+int ecdsa_signature_parse_der_lax(
+    const secp256k1_context* ctx,
+    secp256k1_ecdsa_signature* sig,
+    const unsigned char *input,
+    size_t inputlen
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* SECP256K1_CONTRIB_LAX_DER_PARSING_H */
diff --git a/depend/zcash/src/secp256k1/contrib/lax_der_privatekey_parsing.c b/depend/zcash/src/secp256k1/contrib/lax_der_privatekey_parsing.c
new file mode 100644
index 000000000..429760fbb
--- /dev/null
+++ b/depend/zcash/src/secp256k1/contrib/lax_der_privatekey_parsing.c
@@ -0,0 +1,113 @@
+/***********************************************************************
+ * Copyright (c) 2014, 2015 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#include <string.h>
+#include <secp256k1.h>
+
+#include "lax_der_privatekey_parsing.h"
+
+int ec_privkey_import_der(const secp256k1_context* ctx, unsigned char *out32, const unsigned char *privkey, size_t privkeylen) {
+    const unsigned char *end = privkey + privkeylen;
+    int lenb = 0;
+    int len = 0;
+    memset(out32, 0, 32);
+    /* sequence header */
+    if (end < privkey+1 || *privkey != 0x30) {
+        return 0;
+    }
+    privkey++;
+    /* sequence length constructor */
+    if (end < privkey+1 || !(*privkey & 0x80)) {
+        return 0;
+    }
+    lenb = *privkey & ~0x80; privkey++;
+    if (lenb < 1 || lenb > 2) {
+        return 0;
+    }
+    if (end < privkey+lenb) {
+        return 0;
+    }
+    /* sequence length */
+    len = privkey[lenb-1] | (lenb > 1 ? privkey[lenb-2] << 8 : 0);
+    privkey += lenb;
+    if (end < privkey+len) {
+        return 0;
+    }
+    /* sequence element 0: version number (=1) */
+    if (end < privkey+3 || privkey[0] != 0x02 || privkey[1] != 0x01 || privkey[2] != 0x01) {
+        return 0;
+    }
+    privkey += 3;
+    /* sequence element 1: octet string, up to 32 bytes */
+    if (end < privkey+2 || privkey[0] != 0x04 || privkey[1] > 0x20 || end < privkey+2+privkey[1]) {
+        return 0;
+    }
+    memcpy(out32 + 32 - privkey[1], privkey + 2, privkey[1]);
+    if (!secp256k1_ec_seckey_verify(ctx, out32)) {
+        memset(out32, 0, 32);
+        return 0;
+    }
+    return 1;
+}
+
+int ec_privkey_export_der(const secp256k1_context *ctx, unsigned char *privkey, size_t *privkeylen, const unsigned char *key32, int compressed) {
+    secp256k1_pubkey pubkey;
+    size_t pubkeylen = 0;
+    if (!secp256k1_ec_pubkey_create(ctx, &pubkey, key32)) {
+        *privkeylen = 0;
+        return 0;
+    }
+    if (compressed) {
+        static const unsigned char begin[] = {
+            0x30,0x81,0xD3,0x02,0x01,0x01,0x04,0x20
+        };
+        static const unsigned char middle[] = {
+            0xA0,0x81,0x85,0x30,0x81,0x82,0x02,0x01,0x01,0x30,0x2C,0x06,0x07,0x2A,0x86,0x48,
+            0xCE,0x3D,0x01,0x01,0x02,0x21,0x00,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
+            0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
+            0xFF,0xFF,0xFE,0xFF,0xFF,0xFC,0x2F,0x30,0x06,0x04,0x01,0x00,0x04,0x01,0x07,0x04,
+            0x21,0x02,0x79,0xBE,0x66,0x7E,0xF9,0xDC,0xBB,0xAC,0x55,0xA0,0x62,0x95,0xCE,0x87,
+            0x0B,0x07,0x02,0x9B,0xFC,0xDB,0x2D,0xCE,0x28,0xD9,0x59,0xF2,0x81,0x5B,0x16,0xF8,
+            0x17,0x98,0x02,0x21,0x00,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
+            0xFF,0xFF,0xFF,0xFF,0xFE,0xBA,0xAE,0xDC,0xE6,0xAF,0x48,0xA0,0x3B,0xBF,0xD2,0x5E,
+            0x8C,0xD0,0x36,0x41,0x41,0x02,0x01,0x01,0xA1,0x24,0x03,0x22,0x00
+        };
+        unsigned char *ptr = privkey;
+        memcpy(ptr, begin, sizeof(begin)); ptr += sizeof(begin);
+        memcpy(ptr, key32, 32); ptr += 32;
+        memcpy(ptr, middle, sizeof(middle)); ptr += sizeof(middle);
+        pubkeylen = 33;
+        secp256k1_ec_pubkey_serialize(ctx, ptr, &pubkeylen, &pubkey, SECP256K1_EC_COMPRESSED);
+        ptr += pubkeylen;
+        *privkeylen = ptr - privkey;
+    } else {
+        static const unsigned char begin[] = {
+            0x30,0x82,0x01,0x13,0x02,0x01,0x01,0x04,0x20
+        };
+        static const unsigned char middle[] = {
+            0xA0,0x81,0xA5,0x30,0x81,0xA2,0x02,0x01,0x01,0x30,0x2C,0x06,0x07,0x2A,0x86,0x48,
+            0xCE,0x3D,0x01,0x01,0x02,0x21,0x00,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
+            0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
+            0xFF,0xFF,0xFE,0xFF,0xFF,0xFC,0x2F,0x30,0x06,0x04,0x01,0x00,0x04,0x01,0x07,0x04,
+            0x41,0x04,0x79,0xBE,0x66,0x7E,0xF9,0xDC,0xBB,0xAC,0x55,0xA0,0x62,0x95,0xCE,0x87,
+            0x0B,0x07,0x02,0x9B,0xFC,0xDB,0x2D,0xCE,0x28,0xD9,0x59,0xF2,0x81,0x5B,0x16,0xF8,
+            0x17,0x98,0x48,0x3A,0xDA,0x77,0x26,0xA3,0xC4,0x65,0x5D,0xA4,0xFB,0xFC,0x0E,0x11,
+            0x08,0xA8,0xFD,0x17,0xB4,0x48,0xA6,0x85,0x54,0x19,0x9C,0x47,0xD0,0x8F,0xFB,0x10,
+            0xD4,0xB8,0x02,0x21,0x00,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
+            0xFF,0xFF,0xFF,0xFF,0xFE,0xBA,0xAE,0xDC,0xE6,0xAF,0x48,0xA0,0x3B,0xBF,0xD2,0x5E,
+            0x8C,0xD0,0x36,0x41,0x41,0x02,0x01,0x01,0xA1,0x44,0x03,0x42,0x00
+        };
+        unsigned char *ptr = privkey;
+        memcpy(ptr, begin, sizeof(begin)); ptr += sizeof(begin);
+        memcpy(ptr, key32, 32); ptr += 32;
+        memcpy(ptr, middle, sizeof(middle)); ptr += sizeof(middle);
+        pubkeylen = 65;
+        secp256k1_ec_pubkey_serialize(ctx, ptr, &pubkeylen, &pubkey, SECP256K1_EC_UNCOMPRESSED);
+        ptr += pubkeylen;
+        *privkeylen = ptr - privkey;
+    }
+    return 1;
+}
diff --git a/depend/zcash/src/secp256k1/contrib/lax_der_privatekey_parsing.h b/depend/zcash/src/secp256k1/contrib/lax_der_privatekey_parsing.h
new file mode 100644
index 000000000..602c7c556
--- /dev/null
+++ b/depend/zcash/src/secp256k1/contrib/lax_der_privatekey_parsing.h
@@ -0,0 +1,90 @@
+/***********************************************************************
+ * Copyright (c) 2014, 2015 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+/****
+ * Please do not link this file directly. It is not part of the libsecp256k1
+ * project and does not promise any stability in its API, functionality or
+ * presence. Projects which use this code should instead copy this header
+ * and its accompanying .c file directly into their codebase.
+ ****/
+
+/* This file contains code snippets that parse DER private keys with
+ * various errors and violations.  This is not a part of the library
+ * itself, because the allowed violations are chosen arbitrarily and
+ * do not follow or establish any standard.
+ *
+ * It also contains code to serialize private keys in a compatible
+ * manner.
+ *
+ * These functions are meant for compatibility with applications
+ * that require BER encoded keys. When working with secp256k1-specific
+ * code, the simple 32-byte private keys normally used by the
+ * library are sufficient.
+ */
+
+#ifndef SECP256K1_CONTRIB_BER_PRIVATEKEY_H
+#define SECP256K1_CONTRIB_BER_PRIVATEKEY_H
+
+#include <secp256k1.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/** Export a private key in DER format.
+ *
+ *  Returns: 1 if the private key was valid.
+ *  Args: ctx:        pointer to a context object, initialized for signing (cannot
+ *                    be NULL)
+ *  Out: privkey:     pointer to an array for storing the private key in BER.
+ *                    Should have space for 279 bytes, and cannot be NULL.
+ *       privkeylen:  Pointer to an int where the length of the private key in
+ *                    privkey will be stored.
+ *  In:  seckey:      pointer to a 32-byte secret key to export.
+ *       compressed:  1 if the key should be exported in
+ *                    compressed format, 0 otherwise
+ *
+ *  This function is purely meant for compatibility with applications that
+ *  require BER encoded keys. When working with secp256k1-specific code, the
+ *  simple 32-byte private keys are sufficient.
+ *
+ *  Note that this function does not guarantee correct DER output. It is
+ *  guaranteed to be parsable by secp256k1_ec_privkey_import_der
+ */
+SECP256K1_WARN_UNUSED_RESULT int ec_privkey_export_der(
+    const secp256k1_context* ctx,
+    unsigned char *privkey,
+    size_t *privkeylen,
+    const unsigned char *seckey,
+    int compressed
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
+
+/** Import a private key in DER format.
+ * Returns: 1 if a private key was extracted.
+ * Args: ctx:        pointer to a context object (cannot be NULL).
+ * Out:  seckey:     pointer to a 32-byte array for storing the private key.
+ *                   (cannot be NULL).
+ * In:   privkey:    pointer to a private key in DER format (cannot be NULL).
+ *       privkeylen: length of the DER private key pointed to be privkey.
+ *
+ * This function will accept more than just strict DER, and even allow some BER
+ * violations. The public key stored inside the DER-encoded private key is not
+ * verified for correctness, nor are the curve parameters. Use this function
+ * only if you know in advance it is supposed to contain a secp256k1 private
+ * key.
+ */
+SECP256K1_WARN_UNUSED_RESULT int ec_privkey_import_der(
+    const secp256k1_context* ctx,
+    unsigned char *seckey,
+    const unsigned char *privkey,
+    size_t privkeylen
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* SECP256K1_CONTRIB_BER_PRIVATEKEY_H */
diff --git a/depend/zcash/src/secp256k1/contrib/travis.sh b/depend/zcash/src/secp256k1/contrib/travis.sh
new file mode 100755
index 000000000..ed9862398
--- /dev/null
+++ b/depend/zcash/src/secp256k1/contrib/travis.sh
@@ -0,0 +1,68 @@
+#!/bin/sh
+
+set -e
+set -x
+
+if [ "$HOST" = "i686-linux-gnu" ]
+then
+    export CC="$CC -m32"
+fi
+if [ "$TRAVIS_OS_NAME" = "osx" ] && [ "$TRAVIS_COMPILER" = "gcc" ]
+then
+    export CC="gcc-9"
+fi
+
+./configure \
+    --enable-experimental="$EXPERIMENTAL" \
+    --with-test-override-wide-multiply="$WIDEMUL" --with-bignum="$BIGNUM" --with-asm="$ASM" \
+    --enable-ecmult-static-precomputation="$STATICPRECOMPUTATION" --with-ecmult-gen-precision="$ECMULTGENPRECISION" \
+    --enable-module-ecdh="$ECDH" --enable-module-recovery="$RECOVERY" \
+    --enable-module-schnorrsig="$SCHNORRSIG" \
+    --with-valgrind="$WITH_VALGRIND" \
+    --host="$HOST" $EXTRAFLAGS
+
+if [ -n "$BUILD" ]
+then
+    make -j2 "$BUILD"
+fi
+if [ "$RUN_VALGRIND" = "yes" ]
+then
+    make -j2
+    # the `--error-exitcode` is required to make the test fail if valgrind found errors, otherwise it'll return 0 (https://www.valgrind.org/docs/manual/manual-core.html)
+    valgrind --error-exitcode=42 ./tests 16
+    valgrind --error-exitcode=42 ./exhaustive_tests
+fi
+if [ "$BENCH" = "yes" ]
+then
+    if [ "$RUN_VALGRIND" = "yes" ]
+    then
+        # Using the local `libtool` because on macOS the system's libtool has nothing to do with GNU libtool
+        EXEC='./libtool --mode=execute valgrind --error-exitcode=42'
+    else
+        EXEC=
+    fi
+    # This limits the iterations in the benchmarks below to ITER(set in .travis.yml) iterations.
+    export SECP256K1_BENCH_ITERS="$ITERS"
+    {
+        $EXEC ./bench_ecmult
+        $EXEC ./bench_internal
+        $EXEC ./bench_sign
+        $EXEC ./bench_verify
+    } >> bench.log 2>&1
+    if [ "$RECOVERY" = "yes" ]
+    then
+        $EXEC ./bench_recover >> bench.log 2>&1
+    fi
+    if [ "$ECDH" = "yes" ]
+    then
+        $EXEC ./bench_ecdh >> bench.log 2>&1
+    fi
+    if [ "$SCHNORRSIG" = "yes" ]
+    then
+        $EXEC ./bench_schnorrsig >> bench.log 2>&1
+    fi
+fi
+if [ "$CTIMETEST" = "yes" ]
+then
+    ./libtool --mode=execute valgrind --error-exitcode=42 ./valgrind_ctime_test > valgrind_ctime_test.log 2>&1
+fi
diff --git a/depend/zcash/src/secp256k1/include/secp256k1.h b/depend/zcash/src/secp256k1/include/secp256k1.h
new file mode 100644
index 000000000..d368488af
--- /dev/null
+++ b/depend/zcash/src/secp256k1/include/secp256k1.h
@@ -0,0 +1,771 @@
+#ifndef SECP256K1_H
+#define SECP256K1_H
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#include <stddef.h>
+
+/* These rules specify the order of arguments in API calls:
+ *
+ * 1. Context pointers go first, followed by output arguments, combined
+ *    output/input arguments, and finally input-only arguments.
+ * 2. Array lengths always immediately follow the argument whose length
+ *    they describe, even if this violates rule 1.
+ * 3. Within the OUT/OUTIN/IN groups, pointers to data that is typically generated
+ *    later go first. This means: signatures, public nonces, secret nonces,
+ *    messages, public keys, secret keys, tweaks.
+ * 4. Arguments that are not data pointers go last, from more complex to less
+ *    complex: function pointers, algorithm names, messages, void pointers,
+ *    counts, flags, booleans.
+ * 5. Opaque data pointers follow the function pointer they are to be passed to.
+ */
+
+/** Opaque data structure that holds context information (precomputed tables etc.).
+ *
+ *  The purpose of context structures is to cache large precomputed data tables
+ *  that are expensive to construct, and also to maintain the randomization data
+ *  for blinding.
+ *
+ *  Do not create a new context object for each operation, as construction is
+ *  far slower than all other API calls (~100 times slower than an ECDSA
+ *  verification).
+ *
+ *  A constructed context can safely be used from multiple threads
+ *  simultaneously, but API calls that take a non-const pointer to a context
+ *  need exclusive access to it. In particular this is the case for
+ *  secp256k1_context_destroy, secp256k1_context_preallocated_destroy,
+ *  and secp256k1_context_randomize.
+ *
+ *  Regarding randomization, either do it once at creation time (in which case
+ *  you do not need any locking for the other calls), or use a read-write lock.
+ */
+typedef struct secp256k1_context_struct secp256k1_context;
+
+/** Opaque data structure that holds rewriteable "scratch space"
+ *
+ *  The purpose of this structure is to replace dynamic memory allocations,
+ *  because we target architectures where this may not be available. It is
+ *  essentially a resizable (within specified parameters) block of bytes,
+ *  which is initially created either by memory allocation or TODO as a pointer
+ *  into some fixed rewritable space.
+ *
+ *  Unlike the context object, this cannot safely be shared between threads
+ *  without additional synchronization logic.
+ */
+typedef struct secp256k1_scratch_space_struct secp256k1_scratch_space;
+
+/** Opaque data structure that holds a parsed and valid public key.
+ *
+ *  The exact representation of data inside is implementation defined and not
+ *  guaranteed to be portable between different platforms or versions. It is
+ *  however guaranteed to be 64 bytes in size, and can be safely copied/moved.
+ *  If you need to convert to a format suitable for storage, transmission, or
+ *  comparison, use secp256k1_ec_pubkey_serialize and secp256k1_ec_pubkey_parse.
+ */
+typedef struct {
+    unsigned char data[64];
+} secp256k1_pubkey;
+
+/** Opaque data structured that holds a parsed ECDSA signature.
+ *
+ *  The exact representation of data inside is implementation defined and not
+ *  guaranteed to be portable between different platforms or versions. It is
+ *  however guaranteed to be 64 bytes in size, and can be safely copied/moved.
+ *  If you need to convert to a format suitable for storage, transmission, or
+ *  comparison, use the secp256k1_ecdsa_signature_serialize_* and
+ *  secp256k1_ecdsa_signature_parse_* functions.
+ */
+typedef struct {
+    unsigned char data[64];
+} secp256k1_ecdsa_signature;
+
+/** A pointer to a function to deterministically generate a nonce.
+ *
+ * Returns: 1 if a nonce was successfully generated. 0 will cause signing to fail.
+ * Out:     nonce32:   pointer to a 32-byte array to be filled by the function.
+ * In:      msg32:     the 32-byte message hash being verified (will not be NULL)
+ *          key32:     pointer to a 32-byte secret key (will not be NULL)
+ *          algo16:    pointer to a 16-byte array describing the signature
+ *                     algorithm (will be NULL for ECDSA for compatibility).
+ *          data:      Arbitrary data pointer that is passed through.
+ *          attempt:   how many iterations we have tried to find a nonce.
+ *                     This will almost always be 0, but different attempt values
+ *                     are required to result in a different nonce.
+ *
+ * Except for test cases, this function should compute some cryptographic hash of
+ * the message, the algorithm, the key and the attempt.
+ */
+typedef int (*secp256k1_nonce_function)(
+    unsigned char *nonce32,
+    const unsigned char *msg32,
+    const unsigned char *key32,
+    const unsigned char *algo16,
+    void *data,
+    unsigned int attempt
+);
+
+# if !defined(SECP256K1_GNUC_PREREQ)
+#  if defined(__GNUC__)&&defined(__GNUC_MINOR__)
+#   define SECP256K1_GNUC_PREREQ(_maj,_min) \
+ ((__GNUC__<<16)+__GNUC_MINOR__>=((_maj)<<16)+(_min))
+#  else
+#   define SECP256K1_GNUC_PREREQ(_maj,_min) 0
+#  endif
+# endif
+
+# if (!defined(__STDC_VERSION__) || (__STDC_VERSION__ < 199901L) )
+#  if SECP256K1_GNUC_PREREQ(2,7)
+#   define SECP256K1_INLINE __inline__
+#  elif (defined(_MSC_VER))
+#   define SECP256K1_INLINE __inline
+#  else
+#   define SECP256K1_INLINE
+#  endif
+# else
+#  define SECP256K1_INLINE inline
+# endif
+
+#ifndef SECP256K1_API
+# if defined(_WIN32)
+#  ifdef SECP256K1_BUILD
+#   define SECP256K1_API __declspec(dllexport)
+#  else
+#   define SECP256K1_API
+#  endif
+# elif defined(__GNUC__) && (__GNUC__ >= 4) && defined(SECP256K1_BUILD)
+#  define SECP256K1_API __attribute__ ((visibility ("default")))
+# else
+#  define SECP256K1_API
+# endif
+#endif
+
+/**Warning attributes
+  * NONNULL is not used if SECP256K1_BUILD is set to avoid the compiler optimizing out
+  * some paranoid null checks. */
+# if defined(__GNUC__) && SECP256K1_GNUC_PREREQ(3, 4)
+#  define SECP256K1_WARN_UNUSED_RESULT __attribute__ ((__warn_unused_result__))
+# else
+#  define SECP256K1_WARN_UNUSED_RESULT
+# endif
+# if !defined(SECP256K1_BUILD) && defined(__GNUC__) && SECP256K1_GNUC_PREREQ(3, 4)
+#  define SECP256K1_ARG_NONNULL(_x)  __attribute__ ((__nonnull__(_x)))
+# else
+#  define SECP256K1_ARG_NONNULL(_x)
+# endif
+
+/** All flags' lower 8 bits indicate what they're for. Do not use directly. */
+#define SECP256K1_FLAGS_TYPE_MASK ((1 << 8) - 1)
+#define SECP256K1_FLAGS_TYPE_CONTEXT (1 << 0)
+#define SECP256K1_FLAGS_TYPE_COMPRESSION (1 << 1)
+/** The higher bits contain the actual data. Do not use directly. */
+#define SECP256K1_FLAGS_BIT_CONTEXT_VERIFY (1 << 8)
+#define SECP256K1_FLAGS_BIT_CONTEXT_SIGN (1 << 9)
+#define SECP256K1_FLAGS_BIT_CONTEXT_DECLASSIFY (1 << 10)
+#define SECP256K1_FLAGS_BIT_COMPRESSION (1 << 8)
+
+/** Flags to pass to secp256k1_context_create, secp256k1_context_preallocated_size, and
+ *  secp256k1_context_preallocated_create. */
+#define SECP256K1_CONTEXT_VERIFY (SECP256K1_FLAGS_TYPE_CONTEXT | SECP256K1_FLAGS_BIT_CONTEXT_VERIFY)
+#define SECP256K1_CONTEXT_SIGN (SECP256K1_FLAGS_TYPE_CONTEXT | SECP256K1_FLAGS_BIT_CONTEXT_SIGN)
+#define SECP256K1_CONTEXT_DECLASSIFY (SECP256K1_FLAGS_TYPE_CONTEXT | SECP256K1_FLAGS_BIT_CONTEXT_DECLASSIFY)
+#define SECP256K1_CONTEXT_NONE (SECP256K1_FLAGS_TYPE_CONTEXT)
+
+/** Flag to pass to secp256k1_ec_pubkey_serialize. */
+#define SECP256K1_EC_COMPRESSED (SECP256K1_FLAGS_TYPE_COMPRESSION | SECP256K1_FLAGS_BIT_COMPRESSION)
+#define SECP256K1_EC_UNCOMPRESSED (SECP256K1_FLAGS_TYPE_COMPRESSION)
+
+/** Prefix byte used to tag various encoded curvepoints for specific purposes */
+#define SECP256K1_TAG_PUBKEY_EVEN 0x02
+#define SECP256K1_TAG_PUBKEY_ODD 0x03
+#define SECP256K1_TAG_PUBKEY_UNCOMPRESSED 0x04
+#define SECP256K1_TAG_PUBKEY_HYBRID_EVEN 0x06
+#define SECP256K1_TAG_PUBKEY_HYBRID_ODD 0x07
+
+/** A simple secp256k1 context object with no precomputed tables. These are useful for
+ *  type serialization/parsing functions which require a context object to maintain
+ *  API consistency, but currently do not require expensive precomputations or dynamic
+ *  allocations.
+ */
+SECP256K1_API extern const secp256k1_context *secp256k1_context_no_precomp;
+
+/** Create a secp256k1 context object (in dynamically allocated memory).
+ *
+ *  This function uses malloc to allocate memory. It is guaranteed that malloc is
+ *  called at most once for every call of this function. If you need to avoid dynamic
+ *  memory allocation entirely, see the functions in secp256k1_preallocated.h.
+ *
+ *  Returns: a newly created context object.
+ *  In:      flags: which parts of the context to initialize.
+ *
+ *  See also secp256k1_context_randomize.
+ */
+SECP256K1_API secp256k1_context* secp256k1_context_create(
+    unsigned int flags
+) SECP256K1_WARN_UNUSED_RESULT;
+
+/** Copy a secp256k1 context object (into dynamically allocated memory).
+ *
+ *  This function uses malloc to allocate memory. It is guaranteed that malloc is
+ *  called at most once for every call of this function. If you need to avoid dynamic
+ *  memory allocation entirely, see the functions in secp256k1_preallocated.h.
+ *
+ *  Returns: a newly created context object.
+ *  Args:    ctx: an existing context to copy (cannot be NULL)
+ */
+SECP256K1_API secp256k1_context* secp256k1_context_clone(
+    const secp256k1_context* ctx
+) SECP256K1_ARG_NONNULL(1) SECP256K1_WARN_UNUSED_RESULT;
+
+/** Destroy a secp256k1 context object (created in dynamically allocated memory).
+ *
+ *  The context pointer may not be used afterwards.
+ *
+ *  The context to destroy must have been created using secp256k1_context_create
+ *  or secp256k1_context_clone. If the context has instead been created using
+ *  secp256k1_context_preallocated_create or secp256k1_context_preallocated_clone, the
+ *  behaviour is undefined. In that case, secp256k1_context_preallocated_destroy must
+ *  be used instead.
+ *
+ *  Args:   ctx: an existing context to destroy, constructed using
+ *               secp256k1_context_create or secp256k1_context_clone
+ */
+SECP256K1_API void secp256k1_context_destroy(
+    secp256k1_context* ctx
+);
+
+/** Set a callback function to be called when an illegal argument is passed to
+ *  an API call. It will only trigger for violations that are mentioned
+ *  explicitly in the header.
+ *
+ *  The philosophy is that these shouldn't be dealt with through a
+ *  specific return value, as calling code should not have branches to deal with
+ *  the case that this code itself is broken.
+ *
+ *  On the other hand, during debug stage, one would want to be informed about
+ *  such mistakes, and the default (crashing) may be inadvisable.
+ *  When this callback is triggered, the API function called is guaranteed not
+ *  to cause a crash, though its return value and output arguments are
+ *  undefined.
+ *
+ *  When this function has not been called (or called with fn==NULL), then the
+ *  default handler will be used. The library provides a default handler which
+ *  writes the message to stderr and calls abort. This default handler can be
+ *  replaced at link time if the preprocessor macro
+ *  USE_EXTERNAL_DEFAULT_CALLBACKS is defined, which is the case if the build
+ *  has been configured with --enable-external-default-callbacks. Then the
+ *  following two symbols must be provided to link against:
+ *   - void secp256k1_default_illegal_callback_fn(const char* message, void* data);
+ *   - void secp256k1_default_error_callback_fn(const char* message, void* data);
+ *  The library can call these default handlers even before a proper callback data
+ *  pointer could have been set using secp256k1_context_set_illegal_callback or
+ *  secp256k1_context_set_error_callback, e.g., when the creation of a context
+ *  fails. In this case, the corresponding default handler will be called with
+ *  the data pointer argument set to NULL.
+ *
+ *  Args: ctx:  an existing context object (cannot be NULL)
+ *  In:   fun:  a pointer to a function to call when an illegal argument is
+ *              passed to the API, taking a message and an opaque pointer.
+ *              (NULL restores the default handler.)
+ *        data: the opaque pointer to pass to fun above.
+ *
+ *  See also secp256k1_context_set_error_callback.
+ */
+SECP256K1_API void secp256k1_context_set_illegal_callback(
+    secp256k1_context* ctx,
+    void (*fun)(const char* message, void* data),
+    const void* data
+) SECP256K1_ARG_NONNULL(1);
+
+/** Set a callback function to be called when an internal consistency check
+ *  fails. The default is crashing.
+ *
+ *  This can only trigger in case of a hardware failure, miscompilation,
+ *  memory corruption, serious bug in the library, or other error would can
+ *  otherwise result in undefined behaviour. It will not trigger due to mere
+ *  incorrect usage of the API (see secp256k1_context_set_illegal_callback
+ *  for that). After this callback returns, anything may happen, including
+ *  crashing.
+ *
+ *  Args: ctx:  an existing context object (cannot be NULL)
+ *  In:   fun:  a pointer to a function to call when an internal error occurs,
+ *              taking a message and an opaque pointer (NULL restores the
+ *              default handler, see secp256k1_context_set_illegal_callback
+ *              for details).
+ *        data: the opaque pointer to pass to fun above.
+ *
+ *  See also secp256k1_context_set_illegal_callback.
+ */
+SECP256K1_API void secp256k1_context_set_error_callback(
+    secp256k1_context* ctx,
+    void (*fun)(const char* message, void* data),
+    const void* data
+) SECP256K1_ARG_NONNULL(1);
+
+/** Create a secp256k1 scratch space object.
+ *
+ *  Returns: a newly created scratch space.
+ *  Args: ctx:  an existing context object (cannot be NULL)
+ *  In:   size: amount of memory to be available as scratch space. Some extra
+ *              (<100 bytes) will be allocated for extra accounting.
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT secp256k1_scratch_space* secp256k1_scratch_space_create(
+    const secp256k1_context* ctx,
+    size_t size
+) SECP256K1_ARG_NONNULL(1);
+
+/** Destroy a secp256k1 scratch space.
+ *
+ *  The pointer may not be used afterwards.
+ *  Args:       ctx: a secp256k1 context object.
+ *          scratch: space to destroy
+ */
+SECP256K1_API void secp256k1_scratch_space_destroy(
+    const secp256k1_context* ctx,
+    secp256k1_scratch_space* scratch
+) SECP256K1_ARG_NONNULL(1);
+
+/** Parse a variable-length public key into the pubkey object.
+ *
+ *  Returns: 1 if the public key was fully valid.
+ *           0 if the public key could not be parsed or is invalid.
+ *  Args: ctx:      a secp256k1 context object.
+ *  Out:  pubkey:   pointer to a pubkey object. If 1 is returned, it is set to a
+ *                  parsed version of input. If not, its value is undefined.
+ *  In:   input:    pointer to a serialized public key
+ *        inputlen: length of the array pointed to by input
+ *
+ *  This function supports parsing compressed (33 bytes, header byte 0x02 or
+ *  0x03), uncompressed (65 bytes, header byte 0x04), or hybrid (65 bytes, header
+ *  byte 0x06 or 0x07) format public keys.
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ec_pubkey_parse(
+    const secp256k1_context* ctx,
+    secp256k1_pubkey* pubkey,
+    const unsigned char *input,
+    size_t inputlen
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+/** Serialize a pubkey object into a serialized byte sequence.
+ *
+ *  Returns: 1 always.
+ *  Args:   ctx:        a secp256k1 context object.
+ *  Out:    output:     a pointer to a 65-byte (if compressed==0) or 33-byte (if
+ *                      compressed==1) byte array to place the serialized key
+ *                      in.
+ *  In/Out: outputlen:  a pointer to an integer which is initially set to the
+ *                      size of output, and is overwritten with the written
+ *                      size.
+ *  In:     pubkey:     a pointer to a secp256k1_pubkey containing an
+ *                      initialized public key.
+ *          flags:      SECP256K1_EC_COMPRESSED if serialization should be in
+ *                      compressed format, otherwise SECP256K1_EC_UNCOMPRESSED.
+ */
+SECP256K1_API int secp256k1_ec_pubkey_serialize(
+    const secp256k1_context* ctx,
+    unsigned char *output,
+    size_t *outputlen,
+    const secp256k1_pubkey* pubkey,
+    unsigned int flags
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
+
+/** Parse an ECDSA signature in compact (64 bytes) format.
+ *
+ *  Returns: 1 when the signature could be parsed, 0 otherwise.
+ *  Args: ctx:      a secp256k1 context object
+ *  Out:  sig:      a pointer to a signature object
+ *  In:   input64:  a pointer to the 64-byte array to parse
+ *
+ *  The signature must consist of a 32-byte big endian R value, followed by a
+ *  32-byte big endian S value. If R or S fall outside of [0..order-1], the
+ *  encoding is invalid. R and S with value 0 are allowed in the encoding.
+ *
+ *  After the call, sig will always be initialized. If parsing failed or R or
+ *  S are zero, the resulting sig value is guaranteed to fail validation for any
+ *  message and public key.
+ */
+SECP256K1_API int secp256k1_ecdsa_signature_parse_compact(
+    const secp256k1_context* ctx,
+    secp256k1_ecdsa_signature* sig,
+    const unsigned char *input64
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+/** Parse a DER ECDSA signature.
+ *
+ *  Returns: 1 when the signature could be parsed, 0 otherwise.
+ *  Args: ctx:      a secp256k1 context object
+ *  Out:  sig:      a pointer to a signature object
+ *  In:   input:    a pointer to the signature to be parsed
+ *        inputlen: the length of the array pointed to be input
+ *
+ *  This function will accept any valid DER encoded signature, even if the
+ *  encoded numbers are out of range.
+ *
+ *  After the call, sig will always be initialized. If parsing failed or the
+ *  encoded numbers are out of range, signature validation with it is
+ *  guaranteed to fail for every message and public key.
+ */
+SECP256K1_API int secp256k1_ecdsa_signature_parse_der(
+    const secp256k1_context* ctx,
+    secp256k1_ecdsa_signature* sig,
+    const unsigned char *input,
+    size_t inputlen
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+/** Serialize an ECDSA signature in DER format.
+ *
+ *  Returns: 1 if enough space was available to serialize, 0 otherwise
+ *  Args:   ctx:       a secp256k1 context object
+ *  Out:    output:    a pointer to an array to store the DER serialization
+ *  In/Out: outputlen: a pointer to a length integer. Initially, this integer
+ *                     should be set to the length of output. After the call
+ *                     it will be set to the length of the serialization (even
+ *                     if 0 was returned).
+ *  In:     sig:       a pointer to an initialized signature object
+ */
+SECP256K1_API int secp256k1_ecdsa_signature_serialize_der(
+    const secp256k1_context* ctx,
+    unsigned char *output,
+    size_t *outputlen,
+    const secp256k1_ecdsa_signature* sig
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
+
+/** Serialize an ECDSA signature in compact (64 byte) format.
+ *
+ *  Returns: 1
+ *  Args:   ctx:       a secp256k1 context object
+ *  Out:    output64:  a pointer to a 64-byte array to store the compact serialization
+ *  In:     sig:       a pointer to an initialized signature object
+ *
+ *  See secp256k1_ecdsa_signature_parse_compact for details about the encoding.
+ */
+SECP256K1_API int secp256k1_ecdsa_signature_serialize_compact(
+    const secp256k1_context* ctx,
+    unsigned char *output64,
+    const secp256k1_ecdsa_signature* sig
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+/** Verify an ECDSA signature.
+ *
+ *  Returns: 1: correct signature
+ *           0: incorrect or unparseable signature
+ *  Args:    ctx:       a secp256k1 context object, initialized for verification.
+ *  In:      sig:       the signature being verified (cannot be NULL)
+ *           msghash32: the 32-byte message hash being verified (cannot be NULL).
+ *                      The verifier must make sure to apply a cryptographic
+ *                      hash function to the message by itself and not accept an
+ *                      msghash32 value directly. Otherwise, it would be easy to
+ *                      create a "valid" signature without knowledge of the
+ *                      secret key. See also
+ *                      https://bitcoin.stackexchange.com/a/81116/35586 for more
+ *                      background on this topic.
+ *           pubkey:    pointer to an initialized public key to verify with (cannot be NULL)
+ *
+ * To avoid accepting malleable signatures, only ECDSA signatures in lower-S
+ * form are accepted.
+ *
+ * If you need to accept ECDSA signatures from sources that do not obey this
+ * rule, apply secp256k1_ecdsa_signature_normalize to the signature prior to
+ * validation, but be aware that doing so results in malleable signatures.
+ *
+ * For details, see the comments for that function.
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ecdsa_verify(
+    const secp256k1_context* ctx,
+    const secp256k1_ecdsa_signature *sig,
+    const unsigned char *msghash32,
+    const secp256k1_pubkey *pubkey
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
+
+/** Convert a signature to a normalized lower-S form.
+ *
+ *  Returns: 1 if sigin was not normalized, 0 if it already was.
+ *  Args: ctx:    a secp256k1 context object
+ *  Out:  sigout: a pointer to a signature to fill with the normalized form,
+ *                or copy if the input was already normalized. (can be NULL if
+ *                you're only interested in whether the input was already
+ *                normalized).
+ *  In:   sigin:  a pointer to a signature to check/normalize (cannot be NULL,
+ *                can be identical to sigout)
+ *
+ *  With ECDSA a third-party can forge a second distinct signature of the same
+ *  message, given a single initial signature, but without knowing the key. This
+ *  is done by negating the S value modulo the order of the curve, 'flipping'
+ *  the sign of the random point R which is not included in the signature.
+ *
+ *  Forgery of the same message isn't universally problematic, but in systems
+ *  where message malleability or uniqueness of signatures is important this can
+ *  cause issues. This forgery can be blocked by all verifiers forcing signers
+ *  to use a normalized form.
+ *
+ *  The lower-S form reduces the size of signatures slightly on average when
+ *  variable length encodings (such as DER) are used and is cheap to verify,
+ *  making it a good choice. Security of always using lower-S is assured because
+ *  anyone can trivially modify a signature after the fact to enforce this
+ *  property anyway.
+ *
+ *  The lower S value is always between 0x1 and
+ *  0x7FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF5D576E7357A4501DDFE92F46681B20A0,
+ *  inclusive.
+ *
+ *  No other forms of ECDSA malleability are known and none seem likely, but
+ *  there is no formal proof that ECDSA, even with this additional restriction,
+ *  is free of other malleability. Commonly used serialization schemes will also
+ *  accept various non-unique encodings, so care should be taken when this
+ *  property is required for an application.
+ *
+ *  The secp256k1_ecdsa_sign function will by default create signatures in the
+ *  lower-S form, and secp256k1_ecdsa_verify will not accept others. In case
+ *  signatures come from a system that cannot enforce this property,
+ *  secp256k1_ecdsa_signature_normalize must be called before verification.
+ */
+SECP256K1_API int secp256k1_ecdsa_signature_normalize(
+    const secp256k1_context* ctx,
+    secp256k1_ecdsa_signature *sigout,
+    const secp256k1_ecdsa_signature *sigin
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(3);
+
+/** An implementation of RFC6979 (using HMAC-SHA256) as nonce generation function.
+ * If a data pointer is passed, it is assumed to be a pointer to 32 bytes of
+ * extra entropy.
+ */
+SECP256K1_API extern const secp256k1_nonce_function secp256k1_nonce_function_rfc6979;
+
+/** A default safe nonce generation function (currently equal to secp256k1_nonce_function_rfc6979). */
+SECP256K1_API extern const secp256k1_nonce_function secp256k1_nonce_function_default;
+
+/** Create an ECDSA signature.
+ *
+ *  Returns: 1: signature created
+ *           0: the nonce generation function failed, or the secret key was invalid.
+ *  Args:    ctx:       pointer to a context object, initialized for signing (cannot be NULL)
+ *  Out:     sig:       pointer to an array where the signature will be placed (cannot be NULL)
+ *  In:      msghash32: the 32-byte message hash being signed (cannot be NULL)
+ *           seckey:    pointer to a 32-byte secret key (cannot be NULL)
+ *           noncefp:   pointer to a nonce generation function. If NULL, secp256k1_nonce_function_default is used
+ *           ndata:     pointer to arbitrary data used by the nonce generation function (can be NULL)
+ *
+ * The created signature is always in lower-S form. See
+ * secp256k1_ecdsa_signature_normalize for more details.
+ */
+SECP256K1_API int secp256k1_ecdsa_sign(
+    const secp256k1_context* ctx,
+    secp256k1_ecdsa_signature *sig,
+    const unsigned char *msghash32,
+    const unsigned char *seckey,
+    secp256k1_nonce_function noncefp,
+    const void *ndata
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
+
+/** Verify an ECDSA secret key.
+ *
+ *  A secret key is valid if it is not 0 and less than the secp256k1 curve order
+ *  when interpreted as an integer (most significant byte first). The
+ *  probability of choosing a 32-byte string uniformly at random which is an
+ *  invalid secret key is negligible.
+ *
+ *  Returns: 1: secret key is valid
+ *           0: secret key is invalid
+ *  Args:    ctx: pointer to a context object (cannot be NULL)
+ *  In:      seckey: pointer to a 32-byte secret key (cannot be NULL)
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ec_seckey_verify(
+    const secp256k1_context* ctx,
+    const unsigned char *seckey
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2);
+
+/** Compute the public key for a secret key.
+ *
+ *  Returns: 1: secret was valid, public key stores
+ *           0: secret was invalid, try again
+ *  Args:   ctx:        pointer to a context object, initialized for signing (cannot be NULL)
+ *  Out:    pubkey:     pointer to the created public key (cannot be NULL)
+ *  In:     seckey:     pointer to a 32-byte secret key (cannot be NULL)
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ec_pubkey_create(
+    const secp256k1_context* ctx,
+    secp256k1_pubkey *pubkey,
+    const unsigned char *seckey
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+/** Negates a secret key in place.
+ *
+ *  Returns: 0 if the given secret key is invalid according to
+ *           secp256k1_ec_seckey_verify. 1 otherwise
+ *  Args:   ctx:    pointer to a context object
+ *  In/Out: seckey: pointer to the 32-byte secret key to be negated. If the
+ *                  secret key is invalid according to
+ *                  secp256k1_ec_seckey_verify, this function returns 0 and
+ *                  seckey will be set to some unspecified value. (cannot be
+ *                  NULL)
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ec_seckey_negate(
+    const secp256k1_context* ctx,
+    unsigned char *seckey
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2);
+
+/** Same as secp256k1_ec_seckey_negate, but DEPRECATED. Will be removed in
+ *  future versions. */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ec_privkey_negate(
+    const secp256k1_context* ctx,
+    unsigned char *seckey
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2);
+
+/** Negates a public key in place.
+ *
+ *  Returns: 1 always
+ *  Args:   ctx:        pointer to a context object
+ *  In/Out: pubkey:     pointer to the public key to be negated (cannot be NULL)
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ec_pubkey_negate(
+    const secp256k1_context* ctx,
+    secp256k1_pubkey *pubkey
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2);
+
+/** Tweak a secret key by adding tweak to it.
+ *
+ *  Returns: 0 if the arguments are invalid or the resulting secret key would be
+ *           invalid (only when the tweak is the negation of the secret key). 1
+ *           otherwise.
+ *  Args:    ctx:   pointer to a context object (cannot be NULL).
+ *  In/Out: seckey: pointer to a 32-byte secret key. If the secret key is
+ *                  invalid according to secp256k1_ec_seckey_verify, this
+ *                  function returns 0. seckey will be set to some unspecified
+ *                  value if this function returns 0. (cannot be NULL)
+ *  In:    tweak32: pointer to a 32-byte tweak. If the tweak is invalid according to
+ *                  secp256k1_ec_seckey_verify, this function returns 0. For
+ *                  uniformly random 32-byte arrays the chance of being invalid
+ *                  is negligible (around 1 in 2^128) (cannot be NULL).
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ec_seckey_tweak_add(
+    const secp256k1_context* ctx,
+    unsigned char *seckey,
+    const unsigned char *tweak32
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+/** Same as secp256k1_ec_seckey_tweak_add, but DEPRECATED. Will be removed in
+ *  future versions. */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ec_privkey_tweak_add(
+    const secp256k1_context* ctx,
+    unsigned char *seckey,
+    const unsigned char *tweak32
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+/** Tweak a public key by adding tweak times the generator to it.
+ *
+ *  Returns: 0 if the arguments are invalid or the resulting public key would be
+ *           invalid (only when the tweak is the negation of the corresponding
+ *           secret key). 1 otherwise.
+ *  Args:    ctx:   pointer to a context object initialized for validation
+ *                  (cannot be NULL).
+ *  In/Out: pubkey: pointer to a public key object. pubkey will be set to an
+ *                  invalid value if this function returns 0 (cannot be NULL).
+ *  In:    tweak32: pointer to a 32-byte tweak. If the tweak is invalid according to
+ *                  secp256k1_ec_seckey_verify, this function returns 0. For
+ *                  uniformly random 32-byte arrays the chance of being invalid
+ *                  is negligible (around 1 in 2^128) (cannot be NULL).
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ec_pubkey_tweak_add(
+    const secp256k1_context* ctx,
+    secp256k1_pubkey *pubkey,
+    const unsigned char *tweak32
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+/** Tweak a secret key by multiplying it by a tweak.
+ *
+ *  Returns: 0 if the arguments are invalid. 1 otherwise.
+ *  Args:   ctx:    pointer to a context object (cannot be NULL).
+ *  In/Out: seckey: pointer to a 32-byte secret key. If the secret key is
+ *                  invalid according to secp256k1_ec_seckey_verify, this
+ *                  function returns 0. seckey will be set to some unspecified
+ *                  value if this function returns 0. (cannot be NULL)
+ *  In:    tweak32: pointer to a 32-byte tweak. If the tweak is invalid according to
+ *                  secp256k1_ec_seckey_verify, this function returns 0. For
+ *                  uniformly random 32-byte arrays the chance of being invalid
+ *                  is negligible (around 1 in 2^128) (cannot be NULL).
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ec_seckey_tweak_mul(
+    const secp256k1_context* ctx,
+    unsigned char *seckey,
+    const unsigned char *tweak32
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+/** Same as secp256k1_ec_seckey_tweak_mul, but DEPRECATED. Will be removed in
+ *  future versions. */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ec_privkey_tweak_mul(
+    const secp256k1_context* ctx,
+    unsigned char *seckey,
+    const unsigned char *tweak32
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+/** Tweak a public key by multiplying it by a tweak value.
+ *
+ *  Returns: 0 if the arguments are invalid. 1 otherwise.
+ *  Args:    ctx:   pointer to a context object initialized for validation
+ *                  (cannot be NULL).
+ *  In/Out: pubkey: pointer to a public key object. pubkey will be set to an
+ *                  invalid value if this function returns 0 (cannot be NULL).
+ *  In:    tweak32: pointer to a 32-byte tweak. If the tweak is invalid according to
+ *                  secp256k1_ec_seckey_verify, this function returns 0. For
+ *                  uniformly random 32-byte arrays the chance of being invalid
+ *                  is negligible (around 1 in 2^128) (cannot be NULL).
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ec_pubkey_tweak_mul(
+    const secp256k1_context* ctx,
+    secp256k1_pubkey *pubkey,
+    const unsigned char *tweak32
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+/** Updates the context randomization to protect against side-channel leakage.
+ *  Returns: 1: randomization successfully updated or nothing to randomize
+ *           0: error
+ *  Args:    ctx:       pointer to a context object (cannot be NULL)
+ *  In:      seed32:    pointer to a 32-byte random seed (NULL resets to initial state)
+ *
+ * While secp256k1 code is written to be constant-time no matter what secret
+ * values are, it's possible that a future compiler may output code which isn't,
+ * and also that the CPU may not emit the same radio frequencies or draw the same
+ * amount power for all values.
+ *
+ * This function provides a seed which is combined into the blinding value: that
+ * blinding value is added before each multiplication (and removed afterwards) so
+ * that it does not affect function results, but shields against attacks which
+ * rely on any input-dependent behaviour.
+ *
+ * This function has currently an effect only on contexts initialized for signing
+ * because randomization is currently used only for signing. However, this is not
+ * guaranteed and may change in the future. It is safe to call this function on
+ * contexts not initialized for signing; then it will have no effect and return 1.
+ *
+ * You should call this after secp256k1_context_create or
+ * secp256k1_context_clone (and secp256k1_context_preallocated_create or
+ * secp256k1_context_clone, resp.), and you may call this repeatedly afterwards.
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_context_randomize(
+    secp256k1_context* ctx,
+    const unsigned char *seed32
+) SECP256K1_ARG_NONNULL(1);
+
+/** Add a number of public keys together.
+ *
+ *  Returns: 1: the sum of the public keys is valid.
+ *           0: the sum of the public keys is not valid.
+ *  Args:   ctx:        pointer to a context object
+ *  Out:    out:        pointer to a public key object for placing the resulting public key
+ *                      (cannot be NULL)
+ *  In:     ins:        pointer to array of pointers to public keys (cannot be NULL)
+ *          n:          the number of public keys to add together (must be at least 1)
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ec_pubkey_combine(
+    const secp256k1_context* ctx,
+    secp256k1_pubkey *out,
+    const secp256k1_pubkey * const * ins,
+    size_t n
+) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* SECP256K1_H */
diff --git a/depend/zcash/src/secp256k1/include/secp256k1_ecdh.h b/depend/zcash/src/secp256k1/include/secp256k1_ecdh.h
new file mode 100644
index 000000000..4058e9c04
--- /dev/null
+++ b/depend/zcash/src/secp256k1/include/secp256k1_ecdh.h
@@ -0,0 +1,62 @@
+#ifndef SECP256K1_ECDH_H
+#define SECP256K1_ECDH_H
+
+#include "secp256k1.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/** A pointer to a function that hashes an EC point to obtain an ECDH secret
+ *
+ *  Returns: 1 if the point was successfully hashed.
+ *           0 will cause secp256k1_ecdh to fail and return 0.
+ *           Other return values are not allowed, and the behaviour of
+ *           secp256k1_ecdh is undefined for other return values.
+ *  Out:     output:     pointer to an array to be filled by the function
+ *  In:      x32:        pointer to a 32-byte x coordinate
+ *           y32:        pointer to a 32-byte y coordinate
+ *           data:       arbitrary data pointer that is passed through
+ */
+typedef int (*secp256k1_ecdh_hash_function)(
+  unsigned char *output,
+  const unsigned char *x32,
+  const unsigned char *y32,
+  void *data
+);
+
+/** An implementation of SHA256 hash function that applies to compressed public key.
+ * Populates the output parameter with 32 bytes. */
+SECP256K1_API extern const secp256k1_ecdh_hash_function secp256k1_ecdh_hash_function_sha256;
+
+/** A default ECDH hash function (currently equal to secp256k1_ecdh_hash_function_sha256).
+ * Populates the output parameter with 32 bytes. */
+SECP256K1_API extern const secp256k1_ecdh_hash_function secp256k1_ecdh_hash_function_default;
+
+/** Compute an EC Diffie-Hellman secret in constant time
+ *
+ *  Returns: 1: exponentiation was successful
+ *           0: scalar was invalid (zero or overflow) or hashfp returned 0
+ *  Args:    ctx:        pointer to a context object (cannot be NULL)
+ *  Out:     output:     pointer to an array to be filled by hashfp
+ *  In:      pubkey:     a pointer to a secp256k1_pubkey containing an
+ *                       initialized public key
+ *           seckey:     a 32-byte scalar with which to multiply the point
+ *           hashfp:     pointer to a hash function. If NULL, secp256k1_ecdh_hash_function_sha256 is used
+ *                       (in which case, 32 bytes will be written to output)
+ *           data:       arbitrary data pointer that is passed through to hashfp
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ecdh(
+  const secp256k1_context* ctx,
+  unsigned char *output,
+  const secp256k1_pubkey *pubkey,
+  const unsigned char *seckey,
+  secp256k1_ecdh_hash_function hashfp,
+  void *data
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* SECP256K1_ECDH_H */
diff --git a/depend/zcash/src/secp256k1/include/secp256k1_extrakeys.h b/depend/zcash/src/secp256k1/include/secp256k1_extrakeys.h
new file mode 100644
index 000000000..6fc7b290f
--- /dev/null
+++ b/depend/zcash/src/secp256k1/include/secp256k1_extrakeys.h
@@ -0,0 +1,249 @@
+#ifndef SECP256K1_EXTRAKEYS_H
+#define SECP256K1_EXTRAKEYS_H
+
+#include "secp256k1.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/** Opaque data structure that holds a parsed and valid "x-only" public key.
+ *  An x-only pubkey encodes a point whose Y coordinate is even. It is
+ *  serialized using only its X coordinate (32 bytes). See BIP-340 for more
+ *  information about x-only pubkeys.
+ *
+ *  The exact representation of data inside is implementation defined and not
+ *  guaranteed to be portable between different platforms or versions. It is
+ *  however guaranteed to be 64 bytes in size, and can be safely copied/moved.
+ *  If you need to convert to a format suitable for storage, transmission, or
+ *  comparison, use secp256k1_xonly_pubkey_serialize and
+ *  secp256k1_xonly_pubkey_parse.
+ */
+typedef struct {
+    unsigned char data[64];
+} secp256k1_xonly_pubkey;
+
+/** Opaque data structure that holds a keypair consisting of a secret and a
+ *  public key.
+ *
+ *  The exact representation of data inside is implementation defined and not
+ *  guaranteed to be portable between different platforms or versions. It is
+ *  however guaranteed to be 96 bytes in size, and can be safely copied/moved.
+ */
+typedef struct {
+    unsigned char data[96];
+} secp256k1_keypair;
+
+/** Parse a 32-byte sequence into a xonly_pubkey object.
+ *
+ *  Returns: 1 if the public key was fully valid.
+ *           0 if the public key could not be parsed or is invalid.
+ *
+ *  Args:   ctx: a secp256k1 context object (cannot be NULL).
+ *  Out: pubkey: pointer to a pubkey object. If 1 is returned, it is set to a
+ *               parsed version of input. If not, it's set to an invalid value.
+ *               (cannot be NULL).
+ *  In: input32: pointer to a serialized xonly_pubkey (cannot be NULL)
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_xonly_pubkey_parse(
+    const secp256k1_context* ctx,
+    secp256k1_xonly_pubkey* pubkey,
+    const unsigned char *input32
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+/** Serialize an xonly_pubkey object into a 32-byte sequence.
+ *
+ *  Returns: 1 always.
+ *
+ *  Args:     ctx: a secp256k1 context object (cannot be NULL).
+ *  Out: output32: a pointer to a 32-byte array to place the serialized key in
+ *                 (cannot be NULL).
+ *  In:    pubkey: a pointer to a secp256k1_xonly_pubkey containing an
+ *                 initialized public key (cannot be NULL).
+ */
+SECP256K1_API int secp256k1_xonly_pubkey_serialize(
+    const secp256k1_context* ctx,
+    unsigned char *output32,
+    const secp256k1_xonly_pubkey* pubkey
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+/** Converts a secp256k1_pubkey into a secp256k1_xonly_pubkey.
+ *
+ *  Returns: 1 if the public key was successfully converted
+ *           0 otherwise
+ *
+ *  Args:         ctx: pointer to a context object (cannot be NULL)
+ *  Out: xonly_pubkey: pointer to an x-only public key object for placing the
+ *                     converted public key (cannot be NULL)
+ *          pk_parity: pointer to an integer that will be set to 1 if the point
+ *                     encoded by xonly_pubkey is the negation of the pubkey and
+ *                     set to 0 otherwise. (can be NULL)
+ *  In:        pubkey: pointer to a public key that is converted (cannot be NULL)
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_xonly_pubkey_from_pubkey(
+    const secp256k1_context* ctx,
+    secp256k1_xonly_pubkey *xonly_pubkey,
+    int *pk_parity,
+    const secp256k1_pubkey *pubkey
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(4);
+
+/** Tweak an x-only public key by adding the generator multiplied with tweak32
+ *  to it.
+ *
+ *  Note that the resulting point can not in general be represented by an x-only
+ *  pubkey because it may have an odd Y coordinate. Instead, the output_pubkey
+ *  is a normal secp256k1_pubkey.
+ *
+ *  Returns: 0 if the arguments are invalid or the resulting public key would be
+ *           invalid (only when the tweak is the negation of the corresponding
+ *           secret key). 1 otherwise.
+ *
+ *  Args:           ctx: pointer to a context object initialized for verification
+ *                       (cannot be NULL)
+ *  Out:  output_pubkey: pointer to a public key to store the result. Will be set
+ *                       to an invalid value if this function returns 0 (cannot
+ *                       be NULL)
+ *  In: internal_pubkey: pointer to an x-only pubkey to apply the tweak to.
+ *                       (cannot be NULL).
+ *              tweak32: pointer to a 32-byte tweak. If the tweak is invalid
+ *                       according to secp256k1_ec_seckey_verify, this function
+ *                       returns 0. For uniformly random 32-byte arrays the
+ *                       chance of being invalid is negligible (around 1 in
+ *                       2^128) (cannot be NULL).
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_xonly_pubkey_tweak_add(
+    const secp256k1_context* ctx,
+    secp256k1_pubkey *output_pubkey,
+    const secp256k1_xonly_pubkey *internal_pubkey,
+    const unsigned char *tweak32
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
+
+/** Checks that a tweaked pubkey is the result of calling
+ *  secp256k1_xonly_pubkey_tweak_add with internal_pubkey and tweak32.
+ *
+ *  The tweaked pubkey is represented by its 32-byte x-only serialization and
+ *  its pk_parity, which can both be obtained by converting the result of
+ *  tweak_add to a secp256k1_xonly_pubkey.
+ *
+ *  Note that this alone does _not_ verify that the tweaked pubkey is a
+ *  commitment. If the tweak is not chosen in a specific way, the tweaked pubkey
+ *  can easily be the result of a different internal_pubkey and tweak.
+ *
+ *  Returns: 0 if the arguments are invalid or the tweaked pubkey is not the
+ *           result of tweaking the internal_pubkey with tweak32. 1 otherwise.
+ *  Args:            ctx: pointer to a context object initialized for verification
+ *                       (cannot be NULL)
+ *  In: tweaked_pubkey32: pointer to a serialized xonly_pubkey (cannot be NULL)
+ *     tweaked_pk_parity: the parity of the tweaked pubkey (whose serialization
+ *                        is passed in as tweaked_pubkey32). This must match the
+ *                        pk_parity value that is returned when calling
+ *                        secp256k1_xonly_pubkey with the tweaked pubkey, or
+ *                        this function will fail.
+ *       internal_pubkey: pointer to an x-only public key object to apply the
+ *                        tweak to (cannot be NULL)
+ *               tweak32: pointer to a 32-byte tweak (cannot be NULL)
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_xonly_pubkey_tweak_add_check(
+    const secp256k1_context* ctx,
+    const unsigned char *tweaked_pubkey32,
+    int tweaked_pk_parity,
+    const secp256k1_xonly_pubkey *internal_pubkey,
+    const unsigned char *tweak32
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(4) SECP256K1_ARG_NONNULL(5);
+
+/** Compute the keypair for a secret key.
+ *
+ *  Returns: 1: secret was valid, keypair is ready to use
+ *           0: secret was invalid, try again with a different secret
+ *  Args:    ctx: pointer to a context object, initialized for signing (cannot be NULL)
+ *  Out: keypair: pointer to the created keypair (cannot be NULL)
+ *  In:   seckey: pointer to a 32-byte secret key (cannot be NULL)
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_keypair_create(
+    const secp256k1_context* ctx,
+    secp256k1_keypair *keypair,
+    const unsigned char *seckey
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+/** Get the secret key from a keypair.
+ *
+ *  Returns: 0 if the arguments are invalid. 1 otherwise.
+ *  Args:   ctx: pointer to a context object (cannot be NULL)
+ *  Out: seckey: pointer to a 32-byte buffer for the secret key (cannot be NULL)
+ *  In: keypair: pointer to a keypair (cannot be NULL)
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_keypair_sec(
+    const secp256k1_context* ctx,
+    unsigned char *seckey,
+    const secp256k1_keypair *keypair
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+/** Get the public key from a keypair.
+ *
+ *  Returns: 0 if the arguments are invalid. 1 otherwise.
+ *  Args:    ctx: pointer to a context object (cannot be NULL)
+ *  Out: pubkey: pointer to a pubkey object. If 1 is returned, it is set to
+ *               the keypair public key. If not, it's set to an invalid value.
+ *               (cannot be NULL)
+ *  In: keypair: pointer to a keypair (cannot be NULL)
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_keypair_pub(
+    const secp256k1_context* ctx,
+    secp256k1_pubkey *pubkey,
+    const secp256k1_keypair *keypair
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+/** Get the x-only public key from a keypair.
+ *
+ *  This is the same as calling secp256k1_keypair_pub and then
+ *  secp256k1_xonly_pubkey_from_pubkey.
+ *
+ *  Returns: 0 if the arguments are invalid. 1 otherwise.
+ *  Args:   ctx: pointer to a context object (cannot be NULL)
+ *  Out: pubkey: pointer to an xonly_pubkey object. If 1 is returned, it is set
+ *               to the keypair public key after converting it to an
+ *               xonly_pubkey. If not, it's set to an invalid value (cannot be
+ *               NULL).
+ *    pk_parity: pointer to an integer that will be set to the pk_parity
+ *               argument of secp256k1_xonly_pubkey_from_pubkey (can be NULL).
+ *  In: keypair: pointer to a keypair (cannot be NULL)
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_keypair_xonly_pub(
+    const secp256k1_context* ctx,
+    secp256k1_xonly_pubkey *pubkey,
+    int *pk_parity,
+    const secp256k1_keypair *keypair
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(4);
+
+/** Tweak a keypair by adding tweak32 to the secret key and updating the public
+ *  key accordingly.
+ *
+ *  Calling this function and then secp256k1_keypair_pub results in the same
+ *  public key as calling secp256k1_keypair_xonly_pub and then
+ *  secp256k1_xonly_pubkey_tweak_add.
+ *
+ *  Returns: 0 if the arguments are invalid or the resulting keypair would be
+ *           invalid (only when the tweak is the negation of the keypair's
+ *           secret key). 1 otherwise.
+ *
+ *  Args:       ctx: pointer to a context object initialized for verification
+ *                   (cannot be NULL)
+ *  In/Out: keypair: pointer to a keypair to apply the tweak to. Will be set to
+ *                   an invalid value if this function returns 0 (cannot be
+ *                   NULL).
+ *  In:     tweak32: pointer to a 32-byte tweak. If the tweak is invalid according
+ *                   to secp256k1_ec_seckey_verify, this function returns 0. For
+ *                   uniformly random 32-byte arrays the chance of being invalid
+ *                   is negligible (around 1 in 2^128) (cannot be NULL).
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_keypair_xonly_tweak_add(
+    const secp256k1_context* ctx,
+    secp256k1_keypair *keypair,
+    const unsigned char *tweak32
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* SECP256K1_EXTRAKEYS_H */
diff --git a/depend/zcash/src/secp256k1/include/secp256k1_preallocated.h b/depend/zcash/src/secp256k1/include/secp256k1_preallocated.h
new file mode 100644
index 000000000..a9ae15d5a
--- /dev/null
+++ b/depend/zcash/src/secp256k1/include/secp256k1_preallocated.h
@@ -0,0 +1,128 @@
+#ifndef SECP256K1_PREALLOCATED_H
+#define SECP256K1_PREALLOCATED_H
+
+#include "secp256k1.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/* The module provided by this header file is intended for settings in which it
+ * is not possible or desirable to rely on dynamic memory allocation. It provides
+ * functions for creating, cloning, and destroying secp256k1 context objects in a
+ * contiguous fixed-size block of memory provided by the caller.
+ *
+ * Context objects created by functions in this module can be used like contexts
+ * objects created by functions in secp256k1.h, i.e., they can be passed to any
+ * API function that expects a context object (see secp256k1.h for details). The
+ * only exception is that context objects created by functions in this module
+ * must be destroyed using secp256k1_context_preallocated_destroy (in this
+ * module) instead of secp256k1_context_destroy (in secp256k1.h).
+ *
+ * It is guaranteed that functions in this module will not call malloc or its
+ * friends realloc, calloc, and free.
+ */
+
+/** Determine the memory size of a secp256k1 context object to be created in
+ *  caller-provided memory.
+ *
+ *  The purpose of this function is to determine how much memory must be provided
+ *  to secp256k1_context_preallocated_create.
+ *
+ *  Returns: the required size of the caller-provided memory block
+ *  In:      flags:    which parts of the context to initialize.
+ */
+SECP256K1_API size_t secp256k1_context_preallocated_size(
+    unsigned int flags
+) SECP256K1_WARN_UNUSED_RESULT;
+
+/** Create a secp256k1 context object in caller-provided memory.
+ *
+ *  The caller must provide a pointer to a rewritable contiguous block of memory
+ *  of size at least secp256k1_context_preallocated_size(flags) bytes, suitably
+ *  aligned to hold an object of any type.
+ *
+ *  The block of memory is exclusively owned by the created context object during
+ *  the lifetime of this context object, which begins with the call to this
+ *  function and ends when a call to secp256k1_context_preallocated_destroy
+ *  (which destroys the context object again) returns. During the lifetime of the
+ *  context object, the caller is obligated not to access this block of memory,
+ *  i.e., the caller may not read or write the memory, e.g., by copying the memory
+ *  contents to a different location or trying to create a second context object
+ *  in the memory. In simpler words, the prealloc pointer (or any pointer derived
+ *  from it) should not be used during the lifetime of the context object.
+ *
+ *  Returns: a newly created context object.
+ *  In:      prealloc: a pointer to a rewritable contiguous block of memory of
+ *                     size at least secp256k1_context_preallocated_size(flags)
+ *                     bytes, as detailed above (cannot be NULL)
+ *           flags:    which parts of the context to initialize.
+ *
+ *  See also secp256k1_context_randomize (in secp256k1.h)
+ *  and secp256k1_context_preallocated_destroy.
+ */
+SECP256K1_API secp256k1_context* secp256k1_context_preallocated_create(
+    void* prealloc,
+    unsigned int flags
+) SECP256K1_ARG_NONNULL(1) SECP256K1_WARN_UNUSED_RESULT;
+
+/** Determine the memory size of a secp256k1 context object to be copied into
+ *  caller-provided memory.
+ *
+ *  Returns: the required size of the caller-provided memory block.
+ *  In:      ctx: an existing context to copy (cannot be NULL)
+ */
+SECP256K1_API size_t secp256k1_context_preallocated_clone_size(
+    const secp256k1_context* ctx
+) SECP256K1_ARG_NONNULL(1) SECP256K1_WARN_UNUSED_RESULT;
+
+/** Copy a secp256k1 context object into caller-provided memory.
+ *
+ *  The caller must provide a pointer to a rewritable contiguous block of memory
+ *  of size at least secp256k1_context_preallocated_size(flags) bytes, suitably
+ *  aligned to hold an object of any type.
+ *
+ *  The block of memory is exclusively owned by the created context object during
+ *  the lifetime of this context object, see the description of
+ *  secp256k1_context_preallocated_create for details.
+ *
+ *  Returns: a newly created context object.
+ *  Args:    ctx:      an existing context to copy (cannot be NULL)
+ *  In:      prealloc: a pointer to a rewritable contiguous block of memory of
+ *                     size at least secp256k1_context_preallocated_size(flags)
+ *                     bytes, as detailed above (cannot be NULL)
+ */
+SECP256K1_API secp256k1_context* secp256k1_context_preallocated_clone(
+    const secp256k1_context* ctx,
+    void* prealloc
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_WARN_UNUSED_RESULT;
+
+/** Destroy a secp256k1 context object that has been created in
+ *  caller-provided memory.
+ *
+ *  The context pointer may not be used afterwards.
+ *
+ *  The context to destroy must have been created using
+ *  secp256k1_context_preallocated_create or secp256k1_context_preallocated_clone.
+ *  If the context has instead been created using secp256k1_context_create or
+ *  secp256k1_context_clone, the behaviour is undefined. In that case,
+ *  secp256k1_context_destroy must be used instead.
+ *
+ *  If required, it is the responsibility of the caller to deallocate the block
+ *  of memory properly after this function returns, e.g., by calling free on the
+ *  preallocated pointer given to secp256k1_context_preallocated_create or
+ *  secp256k1_context_preallocated_clone.
+ *
+ *  Args:   ctx: an existing context to destroy, constructed using
+ *               secp256k1_context_preallocated_create or
+ *               secp256k1_context_preallocated_clone (cannot be NULL)
+ */
+SECP256K1_API void secp256k1_context_preallocated_destroy(
+    secp256k1_context* ctx
+);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* SECP256K1_PREALLOCATED_H */
diff --git a/depend/zcash/src/secp256k1/include/secp256k1_recovery.h b/depend/zcash/src/secp256k1/include/secp256k1_recovery.h
new file mode 100644
index 000000000..aa16532ce
--- /dev/null
+++ b/depend/zcash/src/secp256k1/include/secp256k1_recovery.h
@@ -0,0 +1,110 @@
+#ifndef SECP256K1_RECOVERY_H
+#define SECP256K1_RECOVERY_H
+
+#include "secp256k1.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/** Opaque data structured that holds a parsed ECDSA signature,
+ *  supporting pubkey recovery.
+ *
+ *  The exact representation of data inside is implementation defined and not
+ *  guaranteed to be portable between different platforms or versions. It is
+ *  however guaranteed to be 65 bytes in size, and can be safely copied/moved.
+ *  If you need to convert to a format suitable for storage or transmission, use
+ *  the secp256k1_ecdsa_signature_serialize_* and
+ *  secp256k1_ecdsa_signature_parse_* functions.
+ *
+ *  Furthermore, it is guaranteed that identical signatures (including their
+ *  recoverability) will have identical representation, so they can be
+ *  memcmp'ed.
+ */
+typedef struct {
+    unsigned char data[65];
+} secp256k1_ecdsa_recoverable_signature;
+
+/** Parse a compact ECDSA signature (64 bytes + recovery id).
+ *
+ *  Returns: 1 when the signature could be parsed, 0 otherwise
+ *  Args: ctx:     a secp256k1 context object
+ *  Out:  sig:     a pointer to a signature object
+ *  In:   input64: a pointer to a 64-byte compact signature
+ *        recid:   the recovery id (0, 1, 2 or 3)
+ */
+SECP256K1_API int secp256k1_ecdsa_recoverable_signature_parse_compact(
+    const secp256k1_context* ctx,
+    secp256k1_ecdsa_recoverable_signature* sig,
+    const unsigned char *input64,
+    int recid
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+/** Convert a recoverable signature into a normal signature.
+ *
+ *  Returns: 1
+ *  Out: sig:    a pointer to a normal signature (cannot be NULL).
+ *  In:  sigin:  a pointer to a recoverable signature (cannot be NULL).
+ */
+SECP256K1_API int secp256k1_ecdsa_recoverable_signature_convert(
+    const secp256k1_context* ctx,
+    secp256k1_ecdsa_signature* sig,
+    const secp256k1_ecdsa_recoverable_signature* sigin
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3);
+
+/** Serialize an ECDSA signature in compact format (64 bytes + recovery id).
+ *
+ *  Returns: 1
+ *  Args: ctx:      a secp256k1 context object
+ *  Out:  output64: a pointer to a 64-byte array of the compact signature (cannot be NULL)
+ *        recid:    a pointer to an integer to hold the recovery id (can be NULL).
+ *  In:   sig:      a pointer to an initialized signature object (cannot be NULL)
+ */
+SECP256K1_API int secp256k1_ecdsa_recoverable_signature_serialize_compact(
+    const secp256k1_context* ctx,
+    unsigned char *output64,
+    int *recid,
+    const secp256k1_ecdsa_recoverable_signature* sig
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
+
+/** Create a recoverable ECDSA signature.
+ *
+ *  Returns: 1: signature created
+ *           0: the nonce generation function failed, or the secret key was invalid.
+ *  Args:    ctx:       pointer to a context object, initialized for signing (cannot be NULL)
+ *  Out:     sig:       pointer to an array where the signature will be placed (cannot be NULL)
+ *  In:      msghash32: the 32-byte message hash being signed (cannot be NULL)
+ *           seckey:    pointer to a 32-byte secret key (cannot be NULL)
+ *           noncefp:   pointer to a nonce generation function. If NULL, secp256k1_nonce_function_default is used
+ *           ndata:     pointer to arbitrary data used by the nonce generation function (can be NULL)
+ */
+SECP256K1_API int secp256k1_ecdsa_sign_recoverable(
+    const secp256k1_context* ctx,
+    secp256k1_ecdsa_recoverable_signature *sig,
+    const unsigned char *msghash32,
+    const unsigned char *seckey,
+    secp256k1_nonce_function noncefp,
+    const void *ndata
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
+
+/** Recover an ECDSA public key from a signature.
+ *
+ *  Returns: 1: public key successfully recovered (which guarantees a correct signature).
+ *           0: otherwise.
+ *  Args:    ctx:       pointer to a context object, initialized for verification (cannot be NULL)
+ *  Out:     pubkey:    pointer to the recovered public key (cannot be NULL)
+ *  In:      sig:       pointer to initialized signature that supports pubkey recovery (cannot be NULL)
+ *           msghash32: the 32-byte message hash assumed to be signed (cannot be NULL)
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_ecdsa_recover(
+    const secp256k1_context* ctx,
+    secp256k1_pubkey *pubkey,
+    const secp256k1_ecdsa_recoverable_signature *sig,
+    const unsigned char *msghash32
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* SECP256K1_RECOVERY_H */
diff --git a/depend/zcash/src/secp256k1/include/secp256k1_schnorrsig.h b/depend/zcash/src/secp256k1/include/secp256k1_schnorrsig.h
new file mode 100644
index 000000000..0150cd339
--- /dev/null
+++ b/depend/zcash/src/secp256k1/include/secp256k1_schnorrsig.h
@@ -0,0 +1,111 @@
+#ifndef SECP256K1_SCHNORRSIG_H
+#define SECP256K1_SCHNORRSIG_H
+
+#include "secp256k1.h"
+#include "secp256k1_extrakeys.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/** This module implements a variant of Schnorr signatures compliant with
+ *  Bitcoin Improvement Proposal 340 "Schnorr Signatures for secp256k1"
+ *  (https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki).
+ */
+
+/** A pointer to a function to deterministically generate a nonce.
+ *
+ *  Same as secp256k1_nonce function with the exception of accepting an
+ *  additional pubkey argument and not requiring an attempt argument. The pubkey
+ *  argument can protect signature schemes with key-prefixed challenge hash
+ *  inputs against reusing the nonce when signing with the wrong precomputed
+ *  pubkey.
+ *
+ *  Returns: 1 if a nonce was successfully generated. 0 will cause signing to
+ *           return an error.
+ *  Out:     nonce32:   pointer to a 32-byte array to be filled by the function.
+ *  In:      msg32:     the 32-byte message hash being verified (will not be NULL)
+ *           key32:     pointer to a 32-byte secret key (will not be NULL)
+ *      xonly_pk32:     the 32-byte serialized xonly pubkey corresponding to key32
+ *                      (will not be NULL)
+ *           algo16:    pointer to a 16-byte array describing the signature
+ *                      algorithm (will not be NULL).
+ *           data:      Arbitrary data pointer that is passed through.
+ *
+ *  Except for test cases, this function should compute some cryptographic hash of
+ *  the message, the key, the pubkey, the algorithm description, and data.
+ */
+typedef int (*secp256k1_nonce_function_hardened)(
+    unsigned char *nonce32,
+    const unsigned char *msg32,
+    const unsigned char *key32,
+    const unsigned char *xonly_pk32,
+    const unsigned char *algo16,
+    void *data
+);
+
+/** An implementation of the nonce generation function as defined in Bitcoin
+ *  Improvement Proposal 340 "Schnorr Signatures for secp256k1"
+ *  (https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki).
+ *
+ *  If a data pointer is passed, it is assumed to be a pointer to 32 bytes of
+ *  auxiliary random data as defined in BIP-340. If the data pointer is NULL,
+ *  schnorrsig_sign does not produce BIP-340 compliant signatures. The algo16
+ *  argument must be non-NULL, otherwise the function will fail and return 0.
+ *  The hash will be tagged with algo16 after removing all terminating null
+ *  bytes. Therefore, to create BIP-340 compliant signatures, algo16 must be set
+ *  to "BIP0340/nonce\0\0\0"
+ */
+SECP256K1_API extern const secp256k1_nonce_function_hardened secp256k1_nonce_function_bip340;
+
+/** Create a Schnorr signature.
+ *
+ *  Does _not_ strictly follow BIP-340 because it does not verify the resulting
+ *  signature. Instead, you can manually use secp256k1_schnorrsig_verify and
+ *  abort if it fails.
+ *
+ *  Otherwise BIP-340 compliant if the noncefp argument is NULL or
+ *  secp256k1_nonce_function_bip340 and the ndata argument is 32-byte auxiliary
+ *  randomness.
+ *
+ *  Returns 1 on success, 0 on failure.
+ *  Args:    ctx: pointer to a context object, initialized for signing (cannot be NULL)
+ *  Out:   sig64: pointer to a 64-byte array to store the serialized signature (cannot be NULL)
+ *  In:    msg32: the 32-byte message being signed (cannot be NULL)
+ *       keypair: pointer to an initialized keypair (cannot be NULL)
+ *       noncefp: pointer to a nonce generation function. If NULL, secp256k1_nonce_function_bip340 is used
+ *         ndata: pointer to arbitrary data used by the nonce generation
+ *                function (can be NULL). If it is non-NULL and
+ *                secp256k1_nonce_function_bip340 is used, then ndata must be a
+ *                pointer to 32-byte auxiliary randomness as per BIP-340.
+ */
+SECP256K1_API int secp256k1_schnorrsig_sign(
+    const secp256k1_context* ctx,
+    unsigned char *sig64,
+    const unsigned char *msg32,
+    const secp256k1_keypair *keypair,
+    secp256k1_nonce_function_hardened noncefp,
+    void *ndata
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
+
+/** Verify a Schnorr signature.
+ *
+ *  Returns: 1: correct signature
+ *           0: incorrect signature
+ *  Args:    ctx: a secp256k1 context object, initialized for verification.
+ *  In:    sig64: pointer to the 64-byte signature to verify (cannot be NULL)
+ *         msg32: the 32-byte message being verified (cannot be NULL)
+ *        pubkey: pointer to an x-only public key to verify with (cannot be NULL)
+ */
+SECP256K1_API SECP256K1_WARN_UNUSED_RESULT int secp256k1_schnorrsig_verify(
+    const secp256k1_context* ctx,
+    const unsigned char *sig64,
+    const unsigned char *msg32,
+    const secp256k1_xonly_pubkey *pubkey
+) SECP256K1_ARG_NONNULL(1) SECP256K1_ARG_NONNULL(2) SECP256K1_ARG_NONNULL(3) SECP256K1_ARG_NONNULL(4);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* SECP256K1_SCHNORRSIG_H */
diff --git a/depend/zcash/src/secp256k1/libsecp256k1.pc.in b/depend/zcash/src/secp256k1/libsecp256k1.pc.in
new file mode 100644
index 000000000..694e98eef
--- /dev/null
+++ b/depend/zcash/src/secp256k1/libsecp256k1.pc.in
@@ -0,0 +1,13 @@
+prefix=@prefix@
+exec_prefix=@exec_prefix@
+libdir=@libdir@
+includedir=@includedir@
+
+Name: libsecp256k1
+Description: Optimized C library for EC operations on curve secp256k1
+URL: https://github.com/bitcoin-core/secp256k1
+Version: @PACKAGE_VERSION@
+Cflags: -I${includedir}
+Libs: -L${libdir} -lsecp256k1
+Libs.private: @SECP_LIBS@
+
diff --git a/depend/zcash/src/secp256k1/obj/.gitignore b/depend/zcash/src/secp256k1/obj/.gitignore
new file mode 100644
index 000000000..e69de29bb
diff --git a/depend/zcash/src/secp256k1/sage/gen_exhaustive_groups.sage b/depend/zcash/src/secp256k1/sage/gen_exhaustive_groups.sage
new file mode 100644
index 000000000..01d15dcde
--- /dev/null
+++ b/depend/zcash/src/secp256k1/sage/gen_exhaustive_groups.sage
@@ -0,0 +1,124 @@
+load("secp256k1_params.sage")
+
+orders_done = set()
+results = {}
+first = True
+for b in range(1, P):
+    # There are only 6 curves (up to isomorphism) of the form y^2=x^3+B. Stop once we have tried all.
+    if len(orders_done) == 6:
+        break
+
+    E = EllipticCurve(F, [0, b])
+    print("Analyzing curve y^2 = x^3 + %i" % b)
+    n = E.order()
+    # Skip curves with an order we've already tried
+    if n in orders_done:
+        print("- Isomorphic to earlier curve")
+        continue
+    orders_done.add(n)
+    # Skip curves isomorphic to the real secp256k1
+    if n.is_pseudoprime():
+        print(" - Isomorphic to secp256k1")
+        continue
+
+    print("- Finding subgroups")
+
+    # Find what prime subgroups exist
+    for f, _ in n.factor():
+        print("- Analyzing subgroup of order %i" % f)
+        # Skip subgroups of order >1000
+        if f < 4 or f > 1000:
+            print("  - Bad size")
+            continue
+
+        # Iterate over X coordinates until we find one that is on the curve, has order f,
+        # and for which curve isomorphism exists that maps it to X coordinate 1.
+        for x in range(1, P):
+            # Skip X coordinates not on the curve, and construct the full point otherwise.
+            if not E.is_x_coord(x):
+                continue
+            G = E.lift_x(F(x))
+
+            print("  - Analyzing (multiples of) point with X=%i" % x)
+
+            # Skip points whose order is not a multiple of f. Project the point to have
+            # order f otherwise.
+            if (G.order() % f):
+                print("    - Bad order")
+                continue
+            G = G * (G.order() // f)
+
+            # Find lambda for endomorphism. Skip if none can be found.
+            lam = None
+            for l in Integers(f)(1).nth_root(3, all=True):
+                if int(l)*G == E(BETA*G[0], G[1]):
+                    lam = int(l)
+                    break
+            if lam is None:
+                print("    - No endomorphism for this subgroup")
+                break
+
+            # Now look for an isomorphism of the curve that gives this point an X
+            # coordinate equal to 1.
+            # If (x,y) is on y^2 = x^3 + b, then (a^2*x, a^3*y) is on y^2 = x^3 + a^6*b.
+            # So look for m=a^2=1/x.
+            m = F(1)/G[0]
+            if not m.is_square():
+                print("    - No curve isomorphism maps it to a point with X=1")
+                continue
+            a = m.sqrt()
+            rb = a^6*b
+            RE = EllipticCurve(F, [0, rb])
+
+            # Use as generator twice the image of G under the above isormorphism.
+            # This means that generator*(1/2 mod f) will have X coordinate 1.
+            RG = RE(1, a^3*G[1]) * 2
+            # And even Y coordinate.
+            if int(RG[1]) % 2:
+                RG = -RG
+            assert(RG.order() == f)
+            assert(lam*RG == RE(BETA*RG[0], RG[1]))
+
+            # We have found curve RE:y^2=x^3+rb with generator RG of order f. Remember it
+            results[f] = {"b": rb, "G": RG, "lambda": lam}
+            print("    - Found solution")
+            break
+
+    print("")
+
+print("")
+print("")
+print("/* To be put in src/group_impl.h: */")
+first = True
+for f in sorted(results.keys()):
+    b = results[f]["b"]
+    G = results[f]["G"]
+    print("#  %s EXHAUSTIVE_TEST_ORDER == %i" % ("if" if first else "elif", f))
+    first = False
+    print("static const secp256k1_ge secp256k1_ge_const_g = SECP256K1_GE_CONST(")
+    print("    0x%08x, 0x%08x, 0x%08x, 0x%08x," % tuple((int(G[0]) >> (32 * (7 - i))) & 0xffffffff for i in range(4)))
+    print("    0x%08x, 0x%08x, 0x%08x, 0x%08x," % tuple((int(G[0]) >> (32 * (7 - i))) & 0xffffffff for i in range(4, 8)))
+    print("    0x%08x, 0x%08x, 0x%08x, 0x%08x," % tuple((int(G[1]) >> (32 * (7 - i))) & 0xffffffff for i in range(4)))
+    print("    0x%08x, 0x%08x, 0x%08x, 0x%08x" % tuple((int(G[1]) >> (32 * (7 - i))) & 0xffffffff for i in range(4, 8)))
+    print(");")
+    print("static const secp256k1_fe secp256k1_fe_const_b = SECP256K1_FE_CONST(")
+    print("    0x%08x, 0x%08x, 0x%08x, 0x%08x," % tuple((int(b) >> (32 * (7 - i))) & 0xffffffff for i in range(4)))
+    print("    0x%08x, 0x%08x, 0x%08x, 0x%08x" % tuple((int(b) >> (32 * (7 - i))) & 0xffffffff for i in range(4, 8)))
+    print(");")
+print("#  else")
+print("#    error No known generator for the specified exhaustive test group order.")
+print("#  endif")
+
+print("")
+print("")
+print("/* To be put in src/scalar_impl.h: */")
+first = True
+for f in sorted(results.keys()):
+    lam = results[f]["lambda"]
+    print("#  %s EXHAUSTIVE_TEST_ORDER == %i" % ("if" if first else "elif", f))
+    first = False
+    print("#    define EXHAUSTIVE_TEST_LAMBDA %i" % lam)
+print("#  else")
+print("#    error No known lambda for the specified exhaustive test group order.")
+print("#  endif")
+print("")
diff --git a/depend/zcash/src/secp256k1/sage/gen_split_lambda_constants.sage b/depend/zcash/src/secp256k1/sage/gen_split_lambda_constants.sage
new file mode 100644
index 000000000..7d4359e0f
--- /dev/null
+++ b/depend/zcash/src/secp256k1/sage/gen_split_lambda_constants.sage
@@ -0,0 +1,114 @@
+""" Generates the constants used in secp256k1_scalar_split_lambda.
+
+See the comments for secp256k1_scalar_split_lambda in src/scalar_impl.h for detailed explanations.
+"""
+
+load("secp256k1_params.sage")
+
+def inf_norm(v):
+    """Returns the infinity norm of a vector."""
+    return max(map(abs, v))
+
+def gauss_reduction(i1, i2):
+    v1, v2 = i1.copy(), i2.copy()
+    while True:
+        if inf_norm(v2) < inf_norm(v1):
+            v1, v2 = v2, v1
+        # This is essentially
+        #    m = round((v1[0]*v2[0] + v1[1]*v2[1]) / (inf_norm(v1)**2))
+        # (rounding to the nearest integer) without relying on floating point arithmetic.
+        m = ((v1[0]*v2[0] + v1[1]*v2[1]) + (inf_norm(v1)**2) // 2) // (inf_norm(v1)**2)
+        if m == 0:
+            return v1, v2
+        v2[0] -= m*v1[0]
+        v2[1] -= m*v1[1]
+
+def find_split_constants_gauss():
+    """Find constants for secp256k1_scalar_split_lamdba using gauss reduction."""
+    (v11, v12), (v21, v22) = gauss_reduction([0, N], [1, int(LAMBDA)])
+
+    # We use related vectors in secp256k1_scalar_split_lambda.
+    A1, B1 = -v21, -v11
+    A2, B2 = v22, -v21
+
+    return A1, B1, A2, B2
+
+def find_split_constants_explicit_tof():
+    """Find constants for secp256k1_scalar_split_lamdba using the trace of Frobenius.
+
+    See Benjamin Smith: "Easy scalar decompositions for efficient scalar multiplication on
+    elliptic curves and genus 2 Jacobians" (https://eprint.iacr.org/2013/672), Example 2
+    """
+    assert P % 3 == 1 # The paper says P % 3 == 2 but that appears to be a mistake, see [10].
+    assert C.j_invariant() == 0
+
+    t = C.trace_of_frobenius()
+
+    c = Integer(sqrt((4*P - t**2)/3))
+    A1 = Integer((t - c)/2 - 1)
+    B1 = c
+
+    A2 = Integer((t + c)/2 - 1)
+    B2 = Integer(1 - (t - c)/2)
+
+    # We use a negated b values in secp256k1_scalar_split_lambda.
+    B1, B2 = -B1, -B2
+
+    return A1, B1, A2, B2
+
+A1, B1, A2, B2 = find_split_constants_explicit_tof()
+
+# For extra fun, use an independent method to recompute the constants.
+assert (A1, B1, A2, B2) == find_split_constants_gauss()
+
+# PHI : Z[l] -> Z_n where phi(a + b*l) == a + b*lambda mod n.
+def PHI(a,b):
+    return Z(a + LAMBDA*b)
+
+# Check that (A1, B1) and (A2, B2) are in the kernel of PHI.
+assert PHI(A1, B1) == Z(0)
+assert PHI(A2, B2) == Z(0)
+
+# Check that the parallelogram generated by (A1, A2) and (B1, B2)
+# is a fundamental domain by containing exactly N points.
+# Since the LHS is the determinant and N != 0, this also checks that
+# (A1, A2) and (B1, B2) are linearly independent. By the previous
+# assertions, (A1, A2) and (B1, B2) are a basis of the kernel.
+assert A1*B2 - B1*A2 == N
+
+# Check that their components are short enough.
+assert (A1 + A2)/2 < sqrt(N)
+assert B1 < sqrt(N)
+assert B2 < sqrt(N)
+
+G1 = round((2**384)*B2/N)
+G2 = round((2**384)*(-B1)/N)
+
+def rnddiv2(v):
+    if v & 1:
+        v += 1
+    return v >> 1
+
+def scalar_lambda_split(k):
+    """Equivalent to secp256k1_scalar_lambda_split()."""
+    c1 = rnddiv2((k * G1) >> 383)
+    c2 = rnddiv2((k * G2) >> 383)
+    c1 = (c1 * -B1) % N
+    c2 = (c2 * -B2) % N
+    r2 = (c1 + c2) % N
+    r1 = (k + r2 * -LAMBDA) % N
+    return (r1, r2)
+
+# The result of scalar_lambda_split can depend on the representation of k (mod n).
+SPECIAL = (2**383) // G2 + 1
+assert scalar_lambda_split(SPECIAL) != scalar_lambda_split(SPECIAL + N)
+
+print('  A1     =', hex(A1))
+print(' -B1     =', hex(-B1))
+print('  A2     =', hex(A2))
+print(' -B2     =', hex(-B2))
+print('         =', hex(Z(-B2)))
+print(' -LAMBDA =', hex(-LAMBDA))
+
+print('  G1     =', hex(G1))
+print('  G2     =', hex(G2))
diff --git a/depend/zcash/src/secp256k1/sage/group_prover.sage b/depend/zcash/src/secp256k1/sage/group_prover.sage
new file mode 100644
index 000000000..b200bfeae
--- /dev/null
+++ b/depend/zcash/src/secp256k1/sage/group_prover.sage
@@ -0,0 +1,327 @@
+# This code supports verifying group implementations which have branches
+# or conditional statements (like cmovs), by allowing each execution path
+# to independently set assumptions on input or intermediary variables.
+#
+# The general approach is:
+# * A constraint is a tuple of two sets of symbolic expressions:
+#   the first of which are required to evaluate to zero, the second of which
+#   are required to evaluate to nonzero.
+#   - A constraint is said to be conflicting if any of its nonzero expressions
+#     is in the ideal with basis the zero expressions (in other words: when the
+#     zero expressions imply that one of the nonzero expressions are zero).
+# * There is a list of laws that describe the intended behaviour, including
+#   laws for addition and doubling. Each law is called with the symbolic point
+#   coordinates as arguments, and returns:
+#   - A constraint describing the assumptions under which it is applicable,
+#     called "assumeLaw"
+#   - A constraint describing the requirements of the law, called "require"
+# * Implementations are transliterated into functions that operate as well on
+#   algebraic input points, and are called once per combination of branches
+#   executed. Each execution returns:
+#   - A constraint describing the assumptions this implementation requires
+#     (such as Z1=1), called "assumeFormula"
+#   - A constraint describing the assumptions this specific branch requires,
+#     but which is by construction guaranteed to cover the entire space by
+#     merging the results from all branches, called "assumeBranch"
+#   - The result of the computation
+# * All combinations of laws with implementation branches are tried, and:
+#   - If the combination of assumeLaw, assumeFormula, and assumeBranch results
+#     in a conflict, it means this law does not apply to this branch, and it is
+#     skipped.
+#   - For others, we try to prove the require constraints hold, assuming the
+#     information in assumeLaw + assumeFormula + assumeBranch, and if this does
+#     not succeed, we fail.
+#     + To prove an expression is zero, we check whether it belongs to the
+#       ideal with the assumed zero expressions as basis. This test is exact.
+#     + To prove an expression is nonzero, we check whether each of its
+#       factors is contained in the set of nonzero assumptions' factors.
+#       This test is not exact, so various combinations of original and
+#       reduced expressions' factors are tried.
+#   - If we succeed, we print out the assumptions from assumeFormula that
+#     weren't implied by assumeLaw already. Those from assumeBranch are skipped,
+#     as we assume that all constraints in it are complementary with each other.
+#
+# Based on the sage verification scripts used in the Explicit-Formulas Database
+# by Tanja Lange and others, see https://hyperelliptic.org/EFD
+
+class fastfrac:
+  """Fractions over rings."""
+
+  def __init__(self,R,top,bot=1):
+    """Construct a fractional, given a ring, a numerator, and denominator."""
+    self.R = R
+    if parent(top) == ZZ or parent(top) == R:
+      self.top = R(top)
+      self.bot = R(bot)
+    elif top.__class__ == fastfrac:
+      self.top = top.top
+      self.bot = top.bot * bot
+    else:
+      self.top = R(numerator(top))
+      self.bot = R(denominator(top)) * bot
+
+  def iszero(self,I):
+    """Return whether this fraction is zero given an ideal."""
+    return self.top in I and self.bot not in I
+
+  def reduce(self,assumeZero):
+    zero = self.R.ideal(list(map(numerator, assumeZero)))
+    return fastfrac(self.R, zero.reduce(self.top)) / fastfrac(self.R, zero.reduce(self.bot))
+
+  def __add__(self,other):
+    """Add two fractions."""
+    if parent(other) == ZZ:
+      return fastfrac(self.R,self.top + self.bot * other,self.bot)
+    if other.__class__ == fastfrac:
+      return fastfrac(self.R,self.top * other.bot + self.bot * other.top,self.bot * other.bot)
+    return NotImplemented
+
+  def __sub__(self,other):
+    """Subtract two fractions."""
+    if parent(other) == ZZ:
+      return fastfrac(self.R,self.top - self.bot * other,self.bot)
+    if other.__class__ == fastfrac:
+      return fastfrac(self.R,self.top * other.bot - self.bot * other.top,self.bot * other.bot)
+    return NotImplemented
+
+  def __neg__(self):
+    """Return the negation of a fraction."""
+    return fastfrac(self.R,-self.top,self.bot)
+
+  def __mul__(self,other):
+    """Multiply two fractions."""
+    if parent(other) == ZZ:
+      return fastfrac(self.R,self.top * other,self.bot)
+    if other.__class__ == fastfrac:
+      return fastfrac(self.R,self.top * other.top,self.bot * other.bot)
+    return NotImplemented
+
+  def __rmul__(self,other):
+    """Multiply something else with a fraction."""
+    return self.__mul__(other)
+
+  def __truediv__(self,other):
+    """Divide two fractions."""
+    if parent(other) == ZZ:
+      return fastfrac(self.R,self.top,self.bot * other)
+    if other.__class__ == fastfrac:
+      return fastfrac(self.R,self.top * other.bot,self.bot * other.top)
+    return NotImplemented
+
+  # Compatibility wrapper for Sage versions based on Python 2
+  def __div__(self,other):
+     """Divide two fractions."""
+     return self.__truediv__(other)
+
+  def __pow__(self,other):
+    """Compute a power of a fraction."""
+    if parent(other) == ZZ:
+      if other < 0:
+        # Negative powers require flipping top and bottom
+        return fastfrac(self.R,self.bot ^ (-other),self.top ^ (-other))
+      else:
+        return fastfrac(self.R,self.top ^ other,self.bot ^ other)
+    return NotImplemented
+
+  def __str__(self):
+    return "fastfrac((" + str(self.top) + ") / (" + str(self.bot) + "))"
+  def __repr__(self):
+    return "%s" % self
+
+  def numerator(self):
+    return self.top
+
+class constraints:
+  """A set of constraints, consisting of zero and nonzero expressions.
+
+  Constraints can either be used to express knowledge or a requirement.
+
+  Both the fields zero and nonzero are maps from expressions to description
+  strings. The expressions that are the keys in zero are required to be zero,
+  and the expressions that are the keys in nonzero are required to be nonzero.
+
+  Note that (a != 0) and (b != 0) is the same as (a*b != 0), so all keys in
+  nonzero could be multiplied into a single key. This is often much less
+  efficient to work with though, so we keep them separate inside the
+  constraints. This allows higher-level code to do fast checks on the individual
+  nonzero elements, or combine them if needed for stronger checks.
+
+  We can't multiply the different zero elements, as it would suffice for one of
+  the factors to be zero, instead of all of them. Instead, the zero elements are
+  typically combined into an ideal first.
+  """
+
+  def __init__(self, **kwargs):
+    if 'zero' in kwargs:
+      self.zero = dict(kwargs['zero'])
+    else:
+      self.zero = dict()
+    if 'nonzero' in kwargs:
+      self.nonzero = dict(kwargs['nonzero'])
+    else:
+      self.nonzero = dict()
+
+  def negate(self):
+    return constraints(zero=self.nonzero, nonzero=self.zero)
+
+  def __add__(self, other):
+    zero = self.zero.copy()
+    zero.update(other.zero)
+    nonzero = self.nonzero.copy()
+    nonzero.update(other.nonzero)
+    return constraints(zero=zero, nonzero=nonzero)
+
+  def __str__(self):
+    return "constraints(zero=%s,nonzero=%s)" % (self.zero, self.nonzero)
+
+  def __repr__(self):
+    return "%s" % self
+
+
+def conflicts(R, con):
+  """Check whether any of the passed non-zero assumptions is implied by the zero assumptions"""
+  zero = R.ideal(list(map(numerator, con.zero)))
+  if 1 in zero:
+    return True
+  # First a cheap check whether any of the individual nonzero terms conflict on
+  # their own.
+  for nonzero in con.nonzero:
+    if nonzero.iszero(zero):
+      return True
+  # It can be the case that entries in the nonzero set do not individually
+  # conflict with the zero set, but their combination does. For example, knowing
+  # that either x or y is zero is equivalent to having x*y in the zero set.
+  # Having x or y individually in the nonzero set is not a conflict, but both
+  # simultaneously is, so that is the right thing to check for.
+  if reduce(lambda a,b: a * b, con.nonzero, fastfrac(R, 1)).iszero(zero):
+    return True
+  return False
+
+
+def get_nonzero_set(R, assume):
+  """Calculate a simple set of nonzero expressions"""
+  zero = R.ideal(list(map(numerator, assume.zero)))
+  nonzero = set()
+  for nz in map(numerator, assume.nonzero):
+    for (f,n) in nz.factor():
+      nonzero.add(f)
+    rnz = zero.reduce(nz)
+    for (f,n) in rnz.factor():
+      nonzero.add(f)
+  return nonzero
+
+
+def prove_nonzero(R, exprs, assume):
+  """Check whether an expression is provably nonzero, given assumptions"""
+  zero = R.ideal(list(map(numerator, assume.zero)))
+  nonzero = get_nonzero_set(R, assume)
+  expl = set()
+  ok = True
+  for expr in exprs:
+    if numerator(expr) in zero:
+      return (False, [exprs[expr]])
+  allexprs = reduce(lambda a,b: numerator(a)*numerator(b), exprs, 1)
+  for (f, n) in allexprs.factor():
+    if f not in nonzero:
+      ok = False
+  if ok:
+    return (True, None)
+  ok = True
+  for (f, n) in zero.reduce(numerator(allexprs)).factor():
+    if f not in nonzero:
+      ok = False
+  if ok:
+    return (True, None)
+  ok = True
+  for expr in exprs:
+    for (f,n) in numerator(expr).factor():
+      if f not in nonzero:
+        ok = False
+  if ok:
+    return (True, None)
+  ok = True
+  for expr in exprs:
+    for (f,n) in zero.reduce(numerator(expr)).factor():
+      if f not in nonzero:
+        expl.add(exprs[expr])
+  if expl:
+    return (False, list(expl))
+  else:
+    return (True, None)
+
+
+def prove_zero(R, exprs, assume):
+  """Check whether all of the passed expressions are provably zero, given assumptions"""
+  r, e = prove_nonzero(R, dict(map(lambda x: (fastfrac(R, x.bot, 1), exprs[x]), exprs)), assume)
+  if not r:
+    return (False, map(lambda x: "Possibly zero denominator: %s" % x, e))
+  zero = R.ideal(list(map(numerator, assume.zero)))
+  nonzero = prod(x for x in assume.nonzero)
+  expl = []
+  for expr in exprs:
+    if not expr.iszero(zero):
+      expl.append(exprs[expr])
+  if not expl:
+    return (True, None)
+  return (False, expl)
+
+
+def describe_extra(R, assume, assumeExtra):
+  """Describe what assumptions are added, given existing assumptions"""
+  zerox = assume.zero.copy()
+  zerox.update(assumeExtra.zero)
+  zero = R.ideal(list(map(numerator, assume.zero)))
+  zeroextra = R.ideal(list(map(numerator, zerox)))
+  nonzero = get_nonzero_set(R, assume)
+  ret = set()
+  # Iterate over the extra zero expressions
+  for base in assumeExtra.zero:
+    if base not in zero:
+      add = []
+      for (f, n) in numerator(base).factor():
+        if f not in nonzero:
+          add += ["%s" % f]
+      if add:
+        ret.add((" * ".join(add)) + " = 0 [%s]" % assumeExtra.zero[base])
+  # Iterate over the extra nonzero expressions
+  for nz in assumeExtra.nonzero:
+    nzr = zeroextra.reduce(numerator(nz))
+    if nzr not in zeroextra:
+      for (f,n) in nzr.factor():
+        if zeroextra.reduce(f) not in nonzero:
+          ret.add("%s != 0" % zeroextra.reduce(f))
+  return ", ".join(x for x in ret)
+
+
+def check_symbolic(R, assumeLaw, assumeAssert, assumeBranch, require):
+  """Check a set of zero and nonzero requirements, given a set of zero and nonzero assumptions"""
+  assume = assumeLaw + assumeAssert + assumeBranch
+
+  if conflicts(R, assume):
+    # This formula does not apply
+    return None
+
+  describe = describe_extra(R, assumeLaw + assumeBranch, assumeAssert)
+
+  ok, msg = prove_zero(R, require.zero, assume)
+  if not ok:
+    return "FAIL, %s fails (assuming %s)" % (str(msg), describe)
+
+  res, expl = prove_nonzero(R, require.nonzero, assume)
+  if not res:
+    return "FAIL, %s fails (assuming %s)" % (str(expl), describe)
+
+  if describe != "":
+    return "OK (assuming %s)" % describe
+  else:
+    return "OK"
+
+
+def concrete_verify(c):
+  for k in c.zero:
+    if k != 0:
+      return (False, c.zero[k])
+  for k in c.nonzero:
+    if k == 0:
+      return (False, c.nonzero[k])
+  return (True, None)
diff --git a/depend/zcash/src/secp256k1/sage/prove_group_implementations.sage b/depend/zcash/src/secp256k1/sage/prove_group_implementations.sage
new file mode 100644
index 000000000..a97e732f7
--- /dev/null
+++ b/depend/zcash/src/secp256k1/sage/prove_group_implementations.sage
@@ -0,0 +1,306 @@
+# Test libsecp256k1' group operation implementations using prover.sage
+
+import sys
+
+load("group_prover.sage")
+load("weierstrass_prover.sage")
+
+def formula_secp256k1_gej_double_var(a):
+  """libsecp256k1's secp256k1_gej_double_var, used by various addition functions"""
+  rz = a.Z * a.Y
+  rz = rz * 2
+  t1 = a.X^2
+  t1 = t1 * 3
+  t2 = t1^2
+  t3 = a.Y^2
+  t3 = t3 * 2
+  t4 = t3^2
+  t4 = t4 * 2
+  t3 = t3 * a.X
+  rx = t3
+  rx = rx * 4
+  rx = -rx
+  rx = rx + t2
+  t2 = -t2
+  t3 = t3 * 6
+  t3 = t3 + t2
+  ry = t1 * t3
+  t2 = -t4
+  ry = ry + t2
+  return jacobianpoint(rx, ry, rz)
+
+def formula_secp256k1_gej_add_var(branch, a, b):
+  """libsecp256k1's secp256k1_gej_add_var"""
+  if branch == 0:
+    return (constraints(), constraints(nonzero={a.Infinity : 'a_infinite'}), b)
+  if branch == 1:
+    return (constraints(), constraints(zero={a.Infinity : 'a_finite'}, nonzero={b.Infinity : 'b_infinite'}), a)
+  z22 = b.Z^2
+  z12 = a.Z^2
+  u1 = a.X * z22
+  u2 = b.X * z12
+  s1 = a.Y * z22
+  s1 = s1 * b.Z
+  s2 = b.Y * z12
+  s2 = s2 * a.Z
+  h = -u1
+  h = h + u2
+  i = -s1
+  i = i + s2
+  if branch == 2:
+    r = formula_secp256k1_gej_double_var(a)
+    return (constraints(), constraints(zero={h : 'h=0', i : 'i=0', a.Infinity : 'a_finite', b.Infinity : 'b_finite'}), r)
+  if branch == 3:
+    return (constraints(), constraints(zero={h : 'h=0', a.Infinity : 'a_finite', b.Infinity : 'b_finite'}, nonzero={i : 'i!=0'}), point_at_infinity())
+  i2 = i^2
+  h2 = h^2
+  h3 = h2 * h
+  h = h * b.Z
+  rz = a.Z * h
+  t = u1 * h2
+  rx = t
+  rx = rx * 2
+  rx = rx + h3
+  rx = -rx
+  rx = rx + i2
+  ry = -rx
+  ry = ry + t
+  ry = ry * i
+  h3 = h3 * s1
+  h3 = -h3
+  ry = ry + h3
+  return (constraints(), constraints(zero={a.Infinity : 'a_finite', b.Infinity : 'b_finite'}, nonzero={h : 'h!=0'}), jacobianpoint(rx, ry, rz))
+
+def formula_secp256k1_gej_add_ge_var(branch, a, b):
+  """libsecp256k1's secp256k1_gej_add_ge_var, which assume bz==1"""
+  if branch == 0:
+    return (constraints(zero={b.Z - 1 : 'b.z=1'}), constraints(nonzero={a.Infinity : 'a_infinite'}), b)
+  if branch == 1:
+    return (constraints(zero={b.Z - 1 : 'b.z=1'}), constraints(zero={a.Infinity : 'a_finite'}, nonzero={b.Infinity : 'b_infinite'}), a)
+  z12 = a.Z^2
+  u1 = a.X
+  u2 = b.X * z12
+  s1 = a.Y
+  s2 = b.Y * z12
+  s2 = s2 * a.Z
+  h = -u1
+  h = h + u2
+  i = -s1
+  i = i + s2
+  if (branch == 2):
+    r = formula_secp256k1_gej_double_var(a)
+    return (constraints(zero={b.Z - 1 : 'b.z=1'}), constraints(zero={a.Infinity : 'a_finite', b.Infinity : 'b_finite', h : 'h=0', i : 'i=0'}), r)
+  if (branch == 3):
+    return (constraints(zero={b.Z - 1 : 'b.z=1'}), constraints(zero={a.Infinity : 'a_finite', b.Infinity : 'b_finite', h : 'h=0'}, nonzero={i : 'i!=0'}), point_at_infinity())
+  i2 = i^2
+  h2 = h^2
+  h3 = h * h2
+  rz = a.Z * h
+  t = u1 * h2
+  rx = t
+  rx = rx * 2
+  rx = rx + h3
+  rx = -rx
+  rx = rx + i2
+  ry = -rx
+  ry = ry + t
+  ry = ry * i
+  h3 = h3 * s1
+  h3 = -h3
+  ry = ry + h3
+  return (constraints(zero={b.Z - 1 : 'b.z=1'}), constraints(zero={a.Infinity : 'a_finite', b.Infinity : 'b_finite'}, nonzero={h : 'h!=0'}), jacobianpoint(rx, ry, rz))
+
+def formula_secp256k1_gej_add_zinv_var(branch, a, b):
+  """libsecp256k1's secp256k1_gej_add_zinv_var"""
+  bzinv = b.Z^(-1)
+  if branch == 0:
+    return (constraints(), constraints(nonzero={b.Infinity : 'b_infinite'}), a)
+  if branch == 1:
+    bzinv2 = bzinv^2
+    bzinv3 = bzinv2 * bzinv
+    rx = b.X * bzinv2
+    ry = b.Y * bzinv3
+    rz = 1
+    return (constraints(), constraints(zero={b.Infinity : 'b_finite'}, nonzero={a.Infinity : 'a_infinite'}), jacobianpoint(rx, ry, rz))
+  azz = a.Z * bzinv
+  z12 = azz^2
+  u1 = a.X
+  u2 = b.X * z12
+  s1 = a.Y
+  s2 = b.Y * z12
+  s2 = s2 * azz
+  h = -u1
+  h = h + u2
+  i = -s1
+  i = i + s2
+  if branch == 2:
+    r = formula_secp256k1_gej_double_var(a)
+    return (constraints(), constraints(zero={a.Infinity : 'a_finite', b.Infinity : 'b_finite', h : 'h=0', i : 'i=0'}), r)
+  if branch == 3:
+    return (constraints(), constraints(zero={a.Infinity : 'a_finite', b.Infinity : 'b_finite', h : 'h=0'}, nonzero={i : 'i!=0'}), point_at_infinity())
+  i2 = i^2
+  h2 = h^2
+  h3 = h * h2
+  rz = a.Z
+  rz = rz * h
+  t = u1 * h2
+  rx = t
+  rx = rx * 2
+  rx = rx + h3
+  rx = -rx
+  rx = rx + i2
+  ry = -rx
+  ry = ry + t
+  ry = ry * i
+  h3 = h3 * s1
+  h3 = -h3
+  ry = ry + h3
+  return (constraints(), constraints(zero={a.Infinity : 'a_finite', b.Infinity : 'b_finite'}, nonzero={h : 'h!=0'}), jacobianpoint(rx, ry, rz))
+
+def formula_secp256k1_gej_add_ge(branch, a, b):
+  """libsecp256k1's secp256k1_gej_add_ge"""
+  zeroes = {}
+  nonzeroes = {}
+  a_infinity = False
+  if (branch & 4) != 0:
+    nonzeroes.update({a.Infinity : 'a_infinite'})
+    a_infinity = True
+  else:
+    zeroes.update({a.Infinity : 'a_finite'})
+  zz = a.Z^2
+  u1 = a.X
+  u2 = b.X * zz
+  s1 = a.Y
+  s2 = b.Y * zz
+  s2 = s2 * a.Z
+  t = u1
+  t = t + u2
+  m = s1
+  m = m + s2
+  rr = t^2
+  m_alt = -u2
+  tt = u1 * m_alt
+  rr = rr + tt
+  degenerate = (branch & 3) == 3
+  if (branch & 1) != 0:
+    zeroes.update({m : 'm_zero'})
+  else:
+    nonzeroes.update({m : 'm_nonzero'})
+  if (branch & 2) != 0:
+    zeroes.update({rr : 'rr_zero'})
+  else:
+    nonzeroes.update({rr : 'rr_nonzero'})
+  rr_alt = s1
+  rr_alt = rr_alt * 2
+  m_alt = m_alt + u1
+  if not degenerate:
+    rr_alt = rr
+    m_alt = m
+  n = m_alt^2
+  q = n * t
+  n = n^2
+  if degenerate:
+    n = m
+  t = rr_alt^2
+  rz = a.Z * m_alt
+  infinity = False
+  if (branch & 8) != 0:
+    if not a_infinity:
+      infinity = True
+    zeroes.update({rz : 'r.z=0'})
+  else:
+    nonzeroes.update({rz : 'r.z!=0'})
+  rz = rz * 2
+  q = -q
+  t = t + q
+  rx = t
+  t = t * 2
+  t = t + q
+  t = t * rr_alt
+  t = t + n
+  ry = -t
+  rx = rx * 4
+  ry = ry * 4
+  if a_infinity:
+    rx = b.X
+    ry = b.Y
+    rz = 1
+  if infinity:
+    return (constraints(zero={b.Z - 1 : 'b.z=1', b.Infinity : 'b_finite'}), constraints(zero=zeroes, nonzero=nonzeroes), point_at_infinity())
+  return (constraints(zero={b.Z - 1 : 'b.z=1', b.Infinity : 'b_finite'}), constraints(zero=zeroes, nonzero=nonzeroes), jacobianpoint(rx, ry, rz))
+
+def formula_secp256k1_gej_add_ge_old(branch, a, b):
+  """libsecp256k1's old secp256k1_gej_add_ge, which fails when ay+by=0 but ax!=bx"""
+  a_infinity = (branch & 1) != 0
+  zero = {}
+  nonzero = {}
+  if a_infinity:
+    nonzero.update({a.Infinity : 'a_infinite'})
+  else:
+    zero.update({a.Infinity : 'a_finite'})
+  zz = a.Z^2
+  u1 = a.X
+  u2 = b.X * zz
+  s1 = a.Y
+  s2 = b.Y * zz
+  s2 = s2 * a.Z
+  z = a.Z
+  t = u1
+  t = t + u2
+  m = s1
+  m = m + s2
+  n = m^2
+  q = n * t
+  n = n^2
+  rr = t^2
+  t = u1 * u2
+  t = -t
+  rr = rr + t
+  t = rr^2
+  rz = m * z
+  infinity = False
+  if (branch & 2) != 0:
+    if not a_infinity:
+      infinity = True
+    else:
+      return (constraints(zero={b.Z - 1 : 'b.z=1', b.Infinity : 'b_finite'}), constraints(nonzero={z : 'conflict_a'}, zero={z : 'conflict_b'}), point_at_infinity())
+    zero.update({rz : 'r.z=0'})
+  else:
+    nonzero.update({rz : 'r.z!=0'})
+  rz = rz * (0 if a_infinity else 2)
+  rx = t
+  q = -q
+  rx = rx + q
+  q = q * 3
+  t = t * 2
+  t = t + q
+  t = t * rr
+  t = t + n
+  ry = -t
+  rx = rx * (0 if a_infinity else 4)
+  ry = ry * (0 if a_infinity else 4)
+  t = b.X
+  t = t * (1 if a_infinity else 0)
+  rx = rx + t
+  t = b.Y
+  t = t * (1 if a_infinity else 0)
+  ry = ry + t
+  t = (1 if a_infinity else 0)
+  rz = rz + t
+  if infinity:
+    return (constraints(zero={b.Z - 1 : 'b.z=1', b.Infinity : 'b_finite'}), constraints(zero=zero, nonzero=nonzero), point_at_infinity())
+  return (constraints(zero={b.Z - 1 : 'b.z=1', b.Infinity : 'b_finite'}), constraints(zero=zero, nonzero=nonzero), jacobianpoint(rx, ry, rz))
+
+if __name__ == "__main__":
+  check_symbolic_jacobian_weierstrass("secp256k1_gej_add_var", 0, 7, 5, formula_secp256k1_gej_add_var)
+  check_symbolic_jacobian_weierstrass("secp256k1_gej_add_ge_var", 0, 7, 5, formula_secp256k1_gej_add_ge_var)
+  check_symbolic_jacobian_weierstrass("secp256k1_gej_add_zinv_var", 0, 7, 5, formula_secp256k1_gej_add_zinv_var)
+  check_symbolic_jacobian_weierstrass("secp256k1_gej_add_ge", 0, 7, 16, formula_secp256k1_gej_add_ge)
+  check_symbolic_jacobian_weierstrass("secp256k1_gej_add_ge_old [should fail]", 0, 7, 4, formula_secp256k1_gej_add_ge_old)
+
+  if len(sys.argv) >= 2 and sys.argv[1] == "--exhaustive":
+    check_exhaustive_jacobian_weierstrass("secp256k1_gej_add_var", 0, 7, 5, formula_secp256k1_gej_add_var, 43)
+    check_exhaustive_jacobian_weierstrass("secp256k1_gej_add_ge_var", 0, 7, 5, formula_secp256k1_gej_add_ge_var, 43)
+    check_exhaustive_jacobian_weierstrass("secp256k1_gej_add_zinv_var", 0, 7, 5, formula_secp256k1_gej_add_zinv_var, 43)
+    check_exhaustive_jacobian_weierstrass("secp256k1_gej_add_ge", 0, 7, 16, formula_secp256k1_gej_add_ge, 43)
+    check_exhaustive_jacobian_weierstrass("secp256k1_gej_add_ge_old [should fail]", 0, 7, 4, formula_secp256k1_gej_add_ge_old, 43)
diff --git a/depend/zcash/src/secp256k1/sage/secp256k1_params.sage b/depend/zcash/src/secp256k1/sage/secp256k1_params.sage
new file mode 100644
index 000000000..4e000726e
--- /dev/null
+++ b/depend/zcash/src/secp256k1/sage/secp256k1_params.sage
@@ -0,0 +1,36 @@
+"""Prime order of finite field underlying secp256k1 (2^256 - 2^32 - 977)"""
+P = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F
+
+"""Finite field underlying secp256k1"""
+F = FiniteField(P)
+
+"""Elliptic curve secp256k1: y^2 = x^3 + 7"""
+C = EllipticCurve([F(0), F(7)])
+
+"""Base point of secp256k1"""
+G = C.lift_x(0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798)
+
+"""Prime order of secp256k1"""
+N = C.order()
+
+"""Finite field of scalars of secp256k1"""
+Z = FiniteField(N)
+
+""" Beta value of secp256k1 non-trivial endomorphism: lambda * (x, y) = (beta * x, y)"""
+BETA = F(2)^((P-1)/3)
+
+""" Lambda value of secp256k1 non-trivial endomorphism: lambda * (x, y) = (beta * x, y)"""
+LAMBDA = Z(3)^((N-1)/3)
+
+assert is_prime(P)
+assert is_prime(N)
+
+assert BETA != F(1)
+assert BETA^3 == F(1)
+assert BETA^2 + BETA + 1 == 0
+
+assert LAMBDA != Z(1)
+assert LAMBDA^3 == Z(1)
+assert LAMBDA^2 + LAMBDA + 1 == 0
+
+assert Integer(LAMBDA)*G == C(BETA*G[0], G[1])
diff --git a/depend/zcash/src/secp256k1/sage/weierstrass_prover.sage b/depend/zcash/src/secp256k1/sage/weierstrass_prover.sage
new file mode 100644
index 000000000..b770c6daf
--- /dev/null
+++ b/depend/zcash/src/secp256k1/sage/weierstrass_prover.sage
@@ -0,0 +1,264 @@
+# Prover implementation for Weierstrass curves of the form
+# y^2 = x^3 + A * x + B, specifically with a = 0 and b = 7, with group laws
+# operating on affine and Jacobian coordinates, including the point at infinity
+# represented by a 4th variable in coordinates.
+
+load("group_prover.sage")
+
+
+class affinepoint:
+  def __init__(self, x, y, infinity=0):
+    self.x = x
+    self.y = y
+    self.infinity = infinity
+  def __str__(self):
+    return "affinepoint(x=%s,y=%s,inf=%s)" % (self.x, self.y, self.infinity)
+
+
+class jacobianpoint:
+  def __init__(self, x, y, z, infinity=0):
+    self.X = x
+    self.Y = y
+    self.Z = z
+    self.Infinity = infinity
+  def __str__(self):
+    return "jacobianpoint(X=%s,Y=%s,Z=%s,inf=%s)" % (self.X, self.Y, self.Z, self.Infinity)
+
+
+def point_at_infinity():
+  return jacobianpoint(1, 1, 1, 1)
+
+
+def negate(p):
+  if p.__class__ == affinepoint:
+    return affinepoint(p.x, -p.y)
+  if p.__class__ == jacobianpoint:
+    return jacobianpoint(p.X, -p.Y, p.Z)
+  assert(False)
+
+
+def on_weierstrass_curve(A, B, p):
+  """Return a set of zero-expressions for an affine point to be on the curve"""
+  return constraints(zero={p.x^3 + A*p.x + B - p.y^2: 'on_curve'})
+
+
+def tangential_to_weierstrass_curve(A, B, p12, p3):
+  """Return a set of zero-expressions for ((x12,y12),(x3,y3)) to be a line that is tangential to the curve at (x12,y12)"""
+  return constraints(zero={
+    (p12.y - p3.y) * (p12.y * 2) - (p12.x^2 * 3 + A) * (p12.x - p3.x): 'tangential_to_curve'
+  })
+
+
+def colinear(p1, p2, p3):
+  """Return a set of zero-expressions for ((x1,y1),(x2,y2),(x3,y3)) to be collinear"""
+  return constraints(zero={
+    (p1.y - p2.y) * (p1.x - p3.x) - (p1.y - p3.y) * (p1.x - p2.x): 'colinear_1',
+    (p2.y - p3.y) * (p2.x - p1.x) - (p2.y - p1.y) * (p2.x - p3.x): 'colinear_2',
+    (p3.y - p1.y) * (p3.x - p2.x) - (p3.y - p2.y) * (p3.x - p1.x): 'colinear_3'
+  })
+
+
+def good_affine_point(p):
+  return constraints(nonzero={p.x : 'nonzero_x', p.y : 'nonzero_y'})
+
+
+def good_jacobian_point(p):
+  return constraints(nonzero={p.X : 'nonzero_X', p.Y : 'nonzero_Y', p.Z^6 : 'nonzero_Z'})
+
+
+def good_point(p):
+  return constraints(nonzero={p.Z^6 : 'nonzero_X'})
+
+
+def finite(p, *affine_fns):
+  con = good_point(p) + constraints(zero={p.Infinity : 'finite_point'})
+  if p.Z != 0:
+    return con + reduce(lambda a, b: a + b, (f(affinepoint(p.X / p.Z^2, p.Y / p.Z^3)) for f in affine_fns), con)
+  else:
+    return con
+
+def infinite(p):
+  return constraints(nonzero={p.Infinity : 'infinite_point'})
+
+
+def law_jacobian_weierstrass_add(A, B, pa, pb, pA, pB, pC):
+  """Check whether the passed set of coordinates is a valid Jacobian add, given assumptions"""
+  assumeLaw = (good_affine_point(pa) +
+               good_affine_point(pb) +
+               good_jacobian_point(pA) +
+               good_jacobian_point(pB) +
+               on_weierstrass_curve(A, B, pa) +
+               on_weierstrass_curve(A, B, pb) +
+               finite(pA) +
+               finite(pB) +
+               constraints(nonzero={pa.x - pb.x : 'different_x'}))
+  require = (finite(pC, lambda pc: on_weierstrass_curve(A, B, pc) +
+             colinear(pa, pb, negate(pc))))
+  return (assumeLaw, require)
+
+
+def law_jacobian_weierstrass_double(A, B, pa, pb, pA, pB, pC):
+  """Check whether the passed set of coordinates is a valid Jacobian doubling, given assumptions"""
+  assumeLaw = (good_affine_point(pa) +
+               good_affine_point(pb) +
+               good_jacobian_point(pA) +
+               good_jacobian_point(pB) +
+               on_weierstrass_curve(A, B, pa) +
+               on_weierstrass_curve(A, B, pb) +
+               finite(pA) +
+               finite(pB) +
+               constraints(zero={pa.x - pb.x : 'equal_x', pa.y - pb.y : 'equal_y'}))
+  require = (finite(pC, lambda pc: on_weierstrass_curve(A, B, pc) +
+             tangential_to_weierstrass_curve(A, B, pa, negate(pc))))
+  return (assumeLaw, require)
+
+
+def law_jacobian_weierstrass_add_opposites(A, B, pa, pb, pA, pB, pC):
+  assumeLaw = (good_affine_point(pa) +
+               good_affine_point(pb) +
+               good_jacobian_point(pA) +
+               good_jacobian_point(pB) +
+               on_weierstrass_curve(A, B, pa) +
+               on_weierstrass_curve(A, B, pb) +
+               finite(pA) +
+               finite(pB) +
+               constraints(zero={pa.x - pb.x : 'equal_x', pa.y + pb.y : 'opposite_y'}))
+  require = infinite(pC)
+  return (assumeLaw, require)
+
+
+def law_jacobian_weierstrass_add_infinite_a(A, B, pa, pb, pA, pB, pC):
+  assumeLaw = (good_affine_point(pa) +
+               good_affine_point(pb) +
+               good_jacobian_point(pA) +
+               good_jacobian_point(pB) +
+               on_weierstrass_curve(A, B, pb) +
+               infinite(pA) +
+               finite(pB))
+  require = finite(pC, lambda pc: constraints(zero={pc.x - pb.x : 'c.x=b.x', pc.y - pb.y : 'c.y=b.y'}))
+  return (assumeLaw, require)
+
+
+def law_jacobian_weierstrass_add_infinite_b(A, B, pa, pb, pA, pB, pC):
+  assumeLaw = (good_affine_point(pa) +
+               good_affine_point(pb) +
+               good_jacobian_point(pA) +
+               good_jacobian_point(pB) +
+               on_weierstrass_curve(A, B, pa) +
+               infinite(pB) +
+               finite(pA))
+  require = finite(pC, lambda pc: constraints(zero={pc.x - pa.x : 'c.x=a.x', pc.y - pa.y : 'c.y=a.y'}))
+  return (assumeLaw, require)
+
+
+def law_jacobian_weierstrass_add_infinite_ab(A, B, pa, pb, pA, pB, pC):
+  assumeLaw = (good_affine_point(pa) +
+               good_affine_point(pb) +
+               good_jacobian_point(pA) +
+               good_jacobian_point(pB) +
+               infinite(pA) +
+               infinite(pB))
+  require = infinite(pC)
+  return (assumeLaw, require)
+
+
+laws_jacobian_weierstrass = {
+  'add': law_jacobian_weierstrass_add,
+  'double': law_jacobian_weierstrass_double,
+  'add_opposite': law_jacobian_weierstrass_add_opposites,
+  'add_infinite_a': law_jacobian_weierstrass_add_infinite_a,
+  'add_infinite_b': law_jacobian_weierstrass_add_infinite_b,
+  'add_infinite_ab': law_jacobian_weierstrass_add_infinite_ab
+}
+
+
+def check_exhaustive_jacobian_weierstrass(name, A, B, branches, formula, p):
+  """Verify an implementation of addition of Jacobian points on a Weierstrass curve, by executing and validating the result for every possible addition in a prime field"""
+  F = Integers(p)
+  print("Formula %s on Z%i:" % (name, p))
+  points = []
+  for x in range(0, p):
+    for y in range(0, p):
+      point = affinepoint(F(x), F(y))
+      r, e = concrete_verify(on_weierstrass_curve(A, B, point))
+      if r:
+        points.append(point)
+
+  for za in range(1, p):
+    for zb in range(1, p):
+      for pa in points:
+        for pb in points:
+          for ia in range(2):
+            for ib in range(2):
+              pA = jacobianpoint(pa.x * F(za)^2, pa.y * F(za)^3, F(za), ia)
+              pB = jacobianpoint(pb.x * F(zb)^2, pb.y * F(zb)^3, F(zb), ib)
+              for branch in range(0, branches):
+                assumeAssert, assumeBranch, pC = formula(branch, pA, pB)
+                pC.X = F(pC.X)
+                pC.Y = F(pC.Y)
+                pC.Z = F(pC.Z)
+                pC.Infinity = F(pC.Infinity)
+                r, e = concrete_verify(assumeAssert + assumeBranch)
+                if r:
+                  match = False
+                  for key in laws_jacobian_weierstrass:
+                    assumeLaw, require = laws_jacobian_weierstrass[key](A, B, pa, pb, pA, pB, pC)
+                    r, e = concrete_verify(assumeLaw)
+                    if r:
+                      if match:
+                        print("  multiple branches for (%s,%s,%s,%s) + (%s,%s,%s,%s)" % (pA.X, pA.Y, pA.Z, pA.Infinity, pB.X, pB.Y, pB.Z, pB.Infinity))
+                      else:
+                        match = True
+                      r, e = concrete_verify(require)
+                      if not r:
+                        print("  failure in branch %i for (%s,%s,%s,%s) + (%s,%s,%s,%s) = (%s,%s,%s,%s): %s" % (branch, pA.X, pA.Y, pA.Z, pA.Infinity, pB.X, pB.Y, pB.Z, pB.Infinity, pC.X, pC.Y, pC.Z, pC.Infinity, e))
+  print()
+
+
+def check_symbolic_function(R, assumeAssert, assumeBranch, f, A, B, pa, pb, pA, pB, pC):
+  assumeLaw, require = f(A, B, pa, pb, pA, pB, pC)
+  return check_symbolic(R, assumeLaw, assumeAssert, assumeBranch, require)
+
+def check_symbolic_jacobian_weierstrass(name, A, B, branches, formula):
+  """Verify an implementation of addition of Jacobian points on a Weierstrass curve symbolically"""
+  R.<ax,bx,ay,by,Az,Bz,Ai,Bi> = PolynomialRing(QQ,8,order='invlex')
+  lift = lambda x: fastfrac(R,x)
+  ax = lift(ax)
+  ay = lift(ay)
+  Az = lift(Az)
+  bx = lift(bx)
+  by = lift(by)
+  Bz = lift(Bz)
+  Ai = lift(Ai)
+  Bi = lift(Bi)
+
+  pa = affinepoint(ax, ay, Ai)
+  pb = affinepoint(bx, by, Bi)
+  pA = jacobianpoint(ax * Az^2, ay * Az^3, Az, Ai)
+  pB = jacobianpoint(bx * Bz^2, by * Bz^3, Bz, Bi)
+
+  res = {}
+
+  for key in laws_jacobian_weierstrass:
+    res[key] = []
+
+  print("Formula " + name + ":")
+  count = 0
+  for branch in range(branches):
+    assumeFormula, assumeBranch, pC = formula(branch, pA, pB)
+    pC.X = lift(pC.X)
+    pC.Y = lift(pC.Y)
+    pC.Z = lift(pC.Z)
+    pC.Infinity = lift(pC.Infinity)
+
+    for key in laws_jacobian_weierstrass:
+      res[key].append((check_symbolic_function(R, assumeFormula, assumeBranch, laws_jacobian_weierstrass[key], A, B, pa, pb, pA, pB, pC), branch))
+
+  for key in res:
+    print("  %s:" % key)
+    val = res[key]
+    for x in val:
+      if x[0] is not None:
+        print("    branch %i: %s" % (x[1], x[0]))
+
+  print()
diff --git a/depend/zcash/src/secp256k1/src/asm/field_10x26_arm.s b/depend/zcash/src/secp256k1/src/asm/field_10x26_arm.s
new file mode 100644
index 000000000..5f68cefc4
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/asm/field_10x26_arm.s
@@ -0,0 +1,913 @@
+@ vim: set tabstop=8 softtabstop=8 shiftwidth=8 noexpandtab syntax=armasm:
+/***********************************************************************
+ * Copyright (c) 2014 Wladimir J. van der Laan                         *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+/*
+ARM implementation of field_10x26 inner loops.
+
+Note:
+
+- To avoid unnecessary loads and make use of available registers, two
+  'passes' have every time been interleaved, with the odd passes accumulating c' and d' 
+  which will be added to c and d respectively in the even passes
+
+*/
+
+	.syntax unified
+	@ eabi attributes - see readelf -A
+	.eabi_attribute 24, 1 @ Tag_ABI_align_needed = 8-byte
+	.eabi_attribute 25, 1 @ Tag_ABI_align_preserved = 8-byte, except leaf SP
+	.text
+
+	@ Field constants
+	.set field_R0, 0x3d10
+	.set field_R1, 0x400
+	.set field_not_M, 0xfc000000	@ ~M = ~0x3ffffff
+
+	.align	2
+	.global secp256k1_fe_mul_inner
+	.type	secp256k1_fe_mul_inner, %function
+	@ Arguments:
+	@  r0  r      Restrict: can overlap with a, not with b
+	@  r1  a
+	@  r2  b
+	@ Stack (total 4+10*4 = 44)
+	@  sp + #0        saved 'r' pointer
+	@  sp + #4 + 4*X  t0,t1,t2,t3,t4,t5,t6,t7,u8,t9
+secp256k1_fe_mul_inner:
+	stmfd	sp!, {r4, r5, r6, r7, r8, r9, r10, r11, r14}
+	sub	sp, sp, #48			@ frame=44 + alignment
+	str     r0, [sp, #0]			@ save result address, we need it only at the end
+
+	/******************************************
+	 * Main computation code.
+	 ******************************************
+
+	Allocation:
+	    r0,r14,r7,r8   scratch
+	    r1       a (pointer)
+	    r2       b (pointer)
+	    r3:r4    c
+	    r5:r6    d
+	    r11:r12  c'
+	    r9:r10   d'
+
+	Note: do not write to r[] here, it may overlap with a[]
+	*/
+
+	/* A - interleaved with B */
+	ldr	r7, [r1, #0*4]			@ a[0]
+	ldr	r8, [r2, #9*4]			@ b[9]
+	ldr	r0, [r1, #1*4]			@ a[1]
+	umull	r5, r6, r7, r8			@ d = a[0] * b[9]
+	ldr	r14, [r2, #8*4]			@ b[8]
+	umull	r9, r10, r0, r8			@ d' = a[1] * b[9]
+	ldr	r7, [r1, #2*4]			@ a[2]
+	umlal	r5, r6, r0, r14			@ d += a[1] * b[8]
+	ldr	r8, [r2, #7*4] 			@ b[7]
+	umlal	r9, r10, r7, r14		@ d' += a[2] * b[8]
+	ldr	r0, [r1, #3*4]   		@ a[3]
+	umlal	r5, r6, r7, r8   		@ d += a[2] * b[7]
+	ldr	r14, [r2, #6*4]   		@ b[6]
+	umlal	r9, r10, r0, r8  		@ d' += a[3] * b[7]
+	ldr	r7, [r1, #4*4]   		@ a[4]
+	umlal	r5, r6, r0, r14   		@ d += a[3] * b[6]
+	ldr	r8, [r2, #5*4]   		@ b[5]
+	umlal	r9, r10, r7, r14  		@ d' += a[4] * b[6]
+	ldr	r0, [r1, #5*4]   		@ a[5]
+	umlal	r5, r6, r7, r8   		@ d += a[4] * b[5]
+	ldr	r14, [r2, #4*4]   		@ b[4]
+	umlal	r9, r10, r0, r8  		@ d' += a[5] * b[5]
+	ldr	r7, [r1, #6*4]   		@ a[6]
+	umlal	r5, r6, r0, r14   		@ d += a[5] * b[4]
+	ldr	r8, [r2, #3*4]   		@ b[3]
+	umlal	r9, r10, r7, r14  		@ d' += a[6] * b[4]
+	ldr	r0, [r1, #7*4]   		@ a[7]
+	umlal	r5, r6, r7, r8   		@ d += a[6] * b[3]
+	ldr	r14, [r2, #2*4]   		@ b[2]
+	umlal	r9, r10, r0, r8  		@ d' += a[7] * b[3]
+	ldr	r7, [r1, #8*4]   		@ a[8]
+	umlal	r5, r6, r0, r14   		@ d += a[7] * b[2]
+	ldr	r8, [r2, #1*4]   		@ b[1]
+	umlal	r9, r10, r7, r14  		@ d' += a[8] * b[2]
+	ldr	r0, [r1, #9*4]   		@ a[9]
+	umlal	r5, r6, r7, r8   		@ d += a[8] * b[1]
+	ldr	r14, [r2, #0*4]   		@ b[0]
+	umlal	r9, r10, r0, r8  		@ d' += a[9] * b[1]
+	ldr	r7, [r1, #0*4]   		@ a[0]
+	umlal	r5, r6, r0, r14   		@ d += a[9] * b[0]
+	@ r7,r14 used in B
+
+	bic	r0, r5, field_not_M 		@ t9 = d & M
+	str     r0, [sp, #4 + 4*9]
+	mov	r5, r5, lsr #26     		@ d >>= 26 
+	orr	r5, r5, r6, asl #6
+	mov     r6, r6, lsr #26
+
+	/* B */
+	umull	r3, r4, r7, r14   		@ c = a[0] * b[0]
+	adds	r5, r5, r9       		@ d += d'
+	adc	r6, r6, r10
+
+	bic	r0, r5, field_not_M 		@ u0 = d & M
+	mov	r5, r5, lsr #26     		@ d >>= 26
+	orr	r5, r5, r6, asl #6
+	mov     r6, r6, lsr #26
+	movw    r14, field_R0			@ c += u0 * R0
+	umlal   r3, r4, r0, r14
+
+	bic	r14, r3, field_not_M 		@ t0 = c & M
+	str	r14, [sp, #4 + 0*4]
+	mov	r3, r3, lsr #26     		@ c >>= 26
+	orr	r3, r3, r4, asl #6
+	mov     r4, r4, lsr #26
+	mov     r14, field_R1			@ c += u0 * R1
+	umlal   r3, r4, r0, r14
+
+	/* C - interleaved with D */
+	ldr	r7, [r1, #0*4]   		@ a[0]
+	ldr	r8, [r2, #2*4]   		@ b[2]
+	ldr	r14, [r2, #1*4]   		@ b[1]
+	umull	r11, r12, r7, r8   		@ c' = a[0] * b[2]
+	ldr	r0, [r1, #1*4]   		@ a[1]
+	umlal   r3, r4, r7, r14   		@ c += a[0] * b[1]
+	ldr	r8, [r2, #0*4]   		@ b[0]
+	umlal   r11, r12, r0, r14   		@ c' += a[1] * b[1]
+	ldr	r7, [r1, #2*4]   		@ a[2]
+	umlal   r3, r4, r0, r8   		@ c += a[1] * b[0]
+	ldr	r14, [r2, #9*4]   		@ b[9]
+	umlal   r11, r12, r7, r8   		@ c' += a[2] * b[0]
+	ldr	r0, [r1, #3*4]   		@ a[3]
+	umlal	r5, r6, r7, r14   		@ d += a[2] * b[9]
+	ldr	r8, [r2, #8*4]   		@ b[8]
+	umull	r9, r10, r0, r14   		@ d' = a[3] * b[9]
+	ldr	r7, [r1, #4*4]   		@ a[4]
+	umlal	r5, r6, r0, r8   		@ d += a[3] * b[8]
+	ldr	r14, [r2, #7*4]   		@ b[7]
+	umlal	r9, r10, r7, r8   		@ d' += a[4] * b[8]
+	ldr	r0, [r1, #5*4]   		@ a[5]
+	umlal	r5, r6, r7, r14   		@ d += a[4] * b[7]
+	ldr	r8, [r2, #6*4]   		@ b[6]
+	umlal	r9, r10, r0, r14   		@ d' += a[5] * b[7]
+	ldr	r7, [r1, #6*4]   		@ a[6]
+	umlal	r5, r6, r0, r8   		@ d += a[5] * b[6]
+	ldr	r14, [r2, #5*4]   		@ b[5]
+	umlal	r9, r10, r7, r8   		@ d' += a[6] * b[6]
+	ldr	r0, [r1, #7*4]   		@ a[7]
+	umlal	r5, r6, r7, r14   		@ d += a[6] * b[5]
+	ldr	r8, [r2, #4*4]   		@ b[4]
+	umlal	r9, r10, r0, r14   		@ d' += a[7] * b[5]
+	ldr	r7, [r1, #8*4]   		@ a[8]
+	umlal	r5, r6, r0, r8   		@ d += a[7] * b[4]
+	ldr	r14, [r2, #3*4]   		@ b[3]
+	umlal	r9, r10, r7, r8   		@ d' += a[8] * b[4]
+	ldr	r0, [r1, #9*4]   		@ a[9]
+	umlal	r5, r6, r7, r14   		@ d += a[8] * b[3]
+	ldr	r8, [r2, #2*4]   		@ b[2]
+	umlal	r9, r10, r0, r14   		@ d' += a[9] * b[3]
+	umlal	r5, r6, r0, r8   		@ d += a[9] * b[2]
+
+	bic	r0, r5, field_not_M 		@ u1 = d & M
+	mov	r5, r5, lsr #26     		@ d >>= 26
+	orr	r5, r5, r6, asl #6
+	mov     r6, r6, lsr #26
+	movw    r14, field_R0			@ c += u1 * R0
+	umlal   r3, r4, r0, r14
+
+	bic	r14, r3, field_not_M 		@ t1 = c & M
+	str	r14, [sp, #4 + 1*4]
+	mov	r3, r3, lsr #26     		@ c >>= 26
+	orr	r3, r3, r4, asl #6
+	mov     r4, r4, lsr #26
+	mov     r14, field_R1			@ c += u1 * R1
+	umlal   r3, r4, r0, r14
+
+	/* D */
+	adds	r3, r3, r11			@ c += c'
+	adc	r4, r4, r12
+	adds	r5, r5, r9			@ d += d'
+	adc	r6, r6, r10
+
+	bic	r0, r5, field_not_M 		@ u2 = d & M
+	mov	r5, r5, lsr #26     		@ d >>= 26
+	orr	r5, r5, r6, asl #6
+	mov     r6, r6, lsr #26
+	movw    r14, field_R0			@ c += u2 * R0
+	umlal   r3, r4, r0, r14
+
+	bic	r14, r3, field_not_M 		@ t2 = c & M
+	str	r14, [sp, #4 + 2*4]
+	mov	r3, r3, lsr #26     		@ c >>= 26
+	orr	r3, r3, r4, asl #6
+	mov     r4, r4, lsr #26
+	mov     r14, field_R1			@ c += u2 * R1
+	umlal   r3, r4, r0, r14
+
+	/* E - interleaved with F */
+	ldr	r7, [r1, #0*4]   		@ a[0]
+	ldr	r8, [r2, #4*4]   		@ b[4]
+	umull	r11, r12, r7, r8   		@ c' = a[0] * b[4]
+	ldr	r8, [r2, #3*4]   		@ b[3]
+	umlal   r3, r4, r7, r8   		@ c += a[0] * b[3]
+	ldr	r7, [r1, #1*4]   		@ a[1]
+	umlal   r11, r12, r7, r8   		@ c' += a[1] * b[3]
+	ldr	r8, [r2, #2*4]   		@ b[2]
+	umlal   r3, r4, r7, r8   		@ c += a[1] * b[2]
+	ldr	r7, [r1, #2*4]   		@ a[2]
+	umlal   r11, r12, r7, r8   		@ c' += a[2] * b[2]
+	ldr	r8, [r2, #1*4]   		@ b[1]
+	umlal   r3, r4, r7, r8   		@ c += a[2] * b[1]
+	ldr	r7, [r1, #3*4]   		@ a[3]
+	umlal   r11, r12, r7, r8   		@ c' += a[3] * b[1]
+	ldr	r8, [r2, #0*4]   		@ b[0]
+	umlal   r3, r4, r7, r8   		@ c += a[3] * b[0]
+	ldr	r7, [r1, #4*4]   		@ a[4]
+	umlal   r11, r12, r7, r8   		@ c' += a[4] * b[0]
+	ldr	r8, [r2, #9*4]   		@ b[9]
+	umlal	r5, r6, r7, r8   		@ d += a[4] * b[9]
+	ldr	r7, [r1, #5*4]   		@ a[5]
+	umull	r9, r10, r7, r8   		@ d' = a[5] * b[9]
+	ldr	r8, [r2, #8*4]   		@ b[8]
+	umlal	r5, r6, r7, r8   		@ d += a[5] * b[8]
+	ldr	r7, [r1, #6*4]   		@ a[6]
+	umlal	r9, r10, r7, r8   		@ d' += a[6] * b[8]
+	ldr	r8, [r2, #7*4]   		@ b[7]
+	umlal	r5, r6, r7, r8   		@ d += a[6] * b[7]
+	ldr	r7, [r1, #7*4]   		@ a[7]
+	umlal	r9, r10, r7, r8   		@ d' += a[7] * b[7]
+	ldr	r8, [r2, #6*4]   		@ b[6]
+	umlal	r5, r6, r7, r8   		@ d += a[7] * b[6]
+	ldr	r7, [r1, #8*4]   		@ a[8]
+	umlal	r9, r10, r7, r8   		@ d' += a[8] * b[6]
+	ldr	r8, [r2, #5*4]   		@ b[5]
+	umlal	r5, r6, r7, r8   		@ d += a[8] * b[5]
+	ldr	r7, [r1, #9*4]   		@ a[9]
+	umlal	r9, r10, r7, r8   		@ d' += a[9] * b[5]
+	ldr	r8, [r2, #4*4]   		@ b[4]
+	umlal	r5, r6, r7, r8   		@ d += a[9] * b[4]
+
+	bic	r0, r5, field_not_M 		@ u3 = d & M
+	mov	r5, r5, lsr #26     		@ d >>= 26
+	orr	r5, r5, r6, asl #6
+	mov     r6, r6, lsr #26
+	movw    r14, field_R0			@ c += u3 * R0
+	umlal   r3, r4, r0, r14
+
+	bic	r14, r3, field_not_M 		@ t3 = c & M
+	str	r14, [sp, #4 + 3*4]
+	mov	r3, r3, lsr #26     		@ c >>= 26
+	orr	r3, r3, r4, asl #6
+	mov     r4, r4, lsr #26
+	mov     r14, field_R1			@ c += u3 * R1
+	umlal   r3, r4, r0, r14
+
+	/* F */
+	adds	r3, r3, r11			@ c += c'
+	adc	r4, r4, r12
+	adds	r5, r5, r9			@ d += d'
+	adc	r6, r6, r10
+
+	bic	r0, r5, field_not_M 		@ u4 = d & M
+	mov	r5, r5, lsr #26     		@ d >>= 26
+	orr	r5, r5, r6, asl #6
+	mov     r6, r6, lsr #26
+	movw    r14, field_R0			@ c += u4 * R0
+	umlal   r3, r4, r0, r14
+
+	bic	r14, r3, field_not_M 		@ t4 = c & M
+	str	r14, [sp, #4 + 4*4]
+	mov	r3, r3, lsr #26     		@ c >>= 26
+	orr	r3, r3, r4, asl #6
+	mov     r4, r4, lsr #26
+	mov     r14, field_R1			@ c += u4 * R1
+	umlal   r3, r4, r0, r14
+
+	/* G - interleaved with H */
+	ldr	r7, [r1, #0*4]   		@ a[0]
+	ldr	r8, [r2, #6*4]   		@ b[6]
+	ldr	r14, [r2, #5*4]   		@ b[5]
+	umull	r11, r12, r7, r8   		@ c' = a[0] * b[6]
+	ldr	r0, [r1, #1*4]   		@ a[1]
+	umlal   r3, r4, r7, r14   		@ c += a[0] * b[5]
+	ldr	r8, [r2, #4*4]   		@ b[4]
+	umlal   r11, r12, r0, r14   		@ c' += a[1] * b[5]
+	ldr	r7, [r1, #2*4]   		@ a[2]
+	umlal   r3, r4, r0, r8   		@ c += a[1] * b[4]
+	ldr	r14, [r2, #3*4]   		@ b[3]
+	umlal   r11, r12, r7, r8   		@ c' += a[2] * b[4]
+	ldr	r0, [r1, #3*4]   		@ a[3]
+	umlal   r3, r4, r7, r14   		@ c += a[2] * b[3]
+	ldr	r8, [r2, #2*4]   		@ b[2]
+	umlal   r11, r12, r0, r14   		@ c' += a[3] * b[3]
+	ldr	r7, [r1, #4*4]   		@ a[4]
+	umlal   r3, r4, r0, r8   		@ c += a[3] * b[2]
+	ldr	r14, [r2, #1*4]   		@ b[1]
+	umlal   r11, r12, r7, r8   		@ c' += a[4] * b[2]
+	ldr	r0, [r1, #5*4]   		@ a[5]
+	umlal   r3, r4, r7, r14   		@ c += a[4] * b[1]
+	ldr	r8, [r2, #0*4]   		@ b[0]
+	umlal   r11, r12, r0, r14   		@ c' += a[5] * b[1]
+	ldr	r7, [r1, #6*4]   		@ a[6]
+	umlal   r3, r4, r0, r8   		@ c += a[5] * b[0]
+	ldr	r14, [r2, #9*4]   		@ b[9]
+	umlal   r11, r12, r7, r8   		@ c' += a[6] * b[0]
+	ldr	r0, [r1, #7*4]   		@ a[7]
+	umlal	r5, r6, r7, r14   		@ d += a[6] * b[9]
+	ldr	r8, [r2, #8*4]   		@ b[8]
+	umull	r9, r10, r0, r14   		@ d' = a[7] * b[9]
+	ldr	r7, [r1, #8*4]   		@ a[8]
+	umlal	r5, r6, r0, r8   		@ d += a[7] * b[8]
+	ldr	r14, [r2, #7*4]   		@ b[7]
+	umlal	r9, r10, r7, r8   		@ d' += a[8] * b[8]
+	ldr	r0, [r1, #9*4]   		@ a[9]
+	umlal	r5, r6, r7, r14   		@ d += a[8] * b[7]
+	ldr	r8, [r2, #6*4]   		@ b[6]
+	umlal	r9, r10, r0, r14   		@ d' += a[9] * b[7]
+	umlal	r5, r6, r0, r8   		@ d += a[9] * b[6]
+
+	bic	r0, r5, field_not_M 		@ u5 = d & M
+	mov	r5, r5, lsr #26     		@ d >>= 26
+	orr	r5, r5, r6, asl #6
+	mov     r6, r6, lsr #26
+	movw    r14, field_R0			@ c += u5 * R0
+	umlal   r3, r4, r0, r14
+
+	bic	r14, r3, field_not_M 		@ t5 = c & M
+	str	r14, [sp, #4 + 5*4]
+	mov	r3, r3, lsr #26     		@ c >>= 26
+	orr	r3, r3, r4, asl #6
+	mov     r4, r4, lsr #26
+	mov     r14, field_R1			@ c += u5 * R1
+	umlal   r3, r4, r0, r14
+
+	/* H */
+	adds	r3, r3, r11			@ c += c'
+	adc	r4, r4, r12
+	adds	r5, r5, r9			@ d += d'
+	adc	r6, r6, r10
+
+	bic	r0, r5, field_not_M 		@ u6 = d & M
+	mov	r5, r5, lsr #26     		@ d >>= 26
+	orr	r5, r5, r6, asl #6
+	mov     r6, r6, lsr #26
+	movw    r14, field_R0			@ c += u6 * R0
+	umlal   r3, r4, r0, r14
+
+	bic	r14, r3, field_not_M 		@ t6 = c & M
+	str	r14, [sp, #4 + 6*4]
+	mov	r3, r3, lsr #26     		@ c >>= 26
+	orr	r3, r3, r4, asl #6
+	mov     r4, r4, lsr #26
+	mov     r14, field_R1			@ c += u6 * R1
+	umlal   r3, r4, r0, r14
+
+	/* I - interleaved with J */
+	ldr	r8, [r2, #8*4]   		@ b[8]
+	ldr	r7, [r1, #0*4]   		@ a[0]
+	ldr	r14, [r2, #7*4]   		@ b[7]
+	umull   r11, r12, r7, r8   		@ c' = a[0] * b[8]
+	ldr	r0, [r1, #1*4]   		@ a[1]
+	umlal   r3, r4, r7, r14   		@ c += a[0] * b[7]
+	ldr	r8, [r2, #6*4]   		@ b[6]
+	umlal   r11, r12, r0, r14   		@ c' += a[1] * b[7]
+	ldr	r7, [r1, #2*4]   		@ a[2]
+	umlal   r3, r4, r0, r8   		@ c += a[1] * b[6]
+	ldr	r14, [r2, #5*4]   		@ b[5]
+	umlal   r11, r12, r7, r8   		@ c' += a[2] * b[6]
+	ldr	r0, [r1, #3*4]   		@ a[3]
+	umlal   r3, r4, r7, r14   		@ c += a[2] * b[5]
+	ldr	r8, [r2, #4*4]   		@ b[4]
+	umlal   r11, r12, r0, r14   		@ c' += a[3] * b[5]
+	ldr	r7, [r1, #4*4]   		@ a[4]
+	umlal   r3, r4, r0, r8   		@ c += a[3] * b[4]
+	ldr	r14, [r2, #3*4]   		@ b[3]
+	umlal   r11, r12, r7, r8   		@ c' += a[4] * b[4]
+	ldr	r0, [r1, #5*4]   		@ a[5]
+	umlal   r3, r4, r7, r14   		@ c += a[4] * b[3]
+	ldr	r8, [r2, #2*4]   		@ b[2]
+	umlal   r11, r12, r0, r14   		@ c' += a[5] * b[3]
+	ldr	r7, [r1, #6*4]   		@ a[6]
+	umlal   r3, r4, r0, r8   		@ c += a[5] * b[2]
+	ldr	r14, [r2, #1*4]   		@ b[1]
+	umlal   r11, r12, r7, r8   		@ c' += a[6] * b[2]
+	ldr	r0, [r1, #7*4]   		@ a[7]
+	umlal   r3, r4, r7, r14   		@ c += a[6] * b[1]
+	ldr	r8, [r2, #0*4]   		@ b[0]
+	umlal   r11, r12, r0, r14   		@ c' += a[7] * b[1]
+	ldr	r7, [r1, #8*4]   		@ a[8]
+	umlal   r3, r4, r0, r8   		@ c += a[7] * b[0]
+	ldr	r14, [r2, #9*4]   		@ b[9]
+	umlal   r11, r12, r7, r8   		@ c' += a[8] * b[0]
+	ldr	r0, [r1, #9*4]   		@ a[9]
+	umlal	r5, r6, r7, r14   		@ d += a[8] * b[9]
+	ldr	r8, [r2, #8*4]   		@ b[8]
+	umull	r9, r10, r0, r14  		@ d' = a[9] * b[9]
+	umlal	r5, r6, r0, r8   		@ d += a[9] * b[8]
+
+	bic	r0, r5, field_not_M 		@ u7 = d & M
+	mov	r5, r5, lsr #26     		@ d >>= 26
+	orr	r5, r5, r6, asl #6
+	mov     r6, r6, lsr #26
+	movw    r14, field_R0			@ c += u7 * R0
+	umlal   r3, r4, r0, r14
+
+	bic	r14, r3, field_not_M 		@ t7 = c & M
+	str	r14, [sp, #4 + 7*4]
+	mov	r3, r3, lsr #26     		@ c >>= 26
+	orr	r3, r3, r4, asl #6
+	mov     r4, r4, lsr #26
+	mov     r14, field_R1			@ c += u7 * R1
+	umlal   r3, r4, r0, r14
+
+	/* J */
+	adds	r3, r3, r11			@ c += c'
+	adc	r4, r4, r12
+	adds	r5, r5, r9			@ d += d'
+	adc	r6, r6, r10
+
+	bic	r0, r5, field_not_M 		@ u8 = d & M
+	str	r0, [sp, #4 + 8*4]
+	mov	r5, r5, lsr #26     		@ d >>= 26
+	orr	r5, r5, r6, asl #6
+	mov     r6, r6, lsr #26
+	movw    r14, field_R0			@ c += u8 * R0
+	umlal   r3, r4, r0, r14
+
+	/******************************************
+	 * compute and write back result
+	 ******************************************
+	Allocation:
+	    r0    r
+	    r3:r4 c
+	    r5:r6 d
+	    r7    t0
+	    r8    t1
+	    r9    t2
+	    r11   u8
+	    r12   t9
+	    r1,r2,r10,r14 scratch
+
+	Note: do not read from a[] after here, it may overlap with r[]
+	*/
+	ldr	r0, [sp, #0]
+	add	r1, sp, #4 + 3*4		@ r[3..7] = t3..7, r11=u8, r12=t9
+	ldmia	r1, {r2,r7,r8,r9,r10,r11,r12}
+	add	r1, r0, #3*4
+	stmia	r1, {r2,r7,r8,r9,r10}
+
+	bic	r2, r3, field_not_M 		@ r[8] = c & M
+	str	r2, [r0, #8*4]
+	mov	r3, r3, lsr #26     		@ c >>= 26
+	orr	r3, r3, r4, asl #6
+	mov     r4, r4, lsr #26
+	mov     r14, field_R1			@ c += u8 * R1
+	umlal   r3, r4, r11, r14
+	movw    r14, field_R0			@ c += d * R0
+	umlal   r3, r4, r5, r14
+	adds	r3, r3, r12			@ c += t9
+	adc	r4, r4, #0
+
+	add	r1, sp, #4 + 0*4		@ r7,r8,r9 = t0,t1,t2
+	ldmia	r1, {r7,r8,r9}
+
+	ubfx	r2, r3, #0, #22     		@ r[9] = c & (M >> 4)
+	str	r2, [r0, #9*4]
+	mov	r3, r3, lsr #22     		@ c >>= 22
+	orr	r3, r3, r4, asl #10
+	mov     r4, r4, lsr #22
+	movw    r14, field_R1 << 4   		@ c += d * (R1 << 4)
+	umlal   r3, r4, r5, r14
+
+	movw    r14, field_R0 >> 4   		@ d = c * (R0 >> 4) + t0 (64x64 multiply+add)
+	umull	r5, r6, r3, r14			@ d = c.lo * (R0 >> 4)
+	adds	r5, r5, r7	    		@ d.lo += t0
+	mla	r6, r14, r4, r6			@ d.hi += c.hi * (R0 >> 4)
+	adc	r6, r6, 0	     		@ d.hi += carry
+
+	bic	r2, r5, field_not_M 		@ r[0] = d & M
+	str	r2, [r0, #0*4]
+
+	mov	r5, r5, lsr #26     		@ d >>= 26
+	orr	r5, r5, r6, asl #6
+	mov     r6, r6, lsr #26
+	
+	movw    r14, field_R1 >> 4   		@ d += c * (R1 >> 4) + t1 (64x64 multiply+add)
+	umull	r1, r2, r3, r14       		@ tmp = c.lo * (R1 >> 4)
+	adds	r5, r5, r8	    		@ d.lo += t1
+	adc	r6, r6, #0	    		@ d.hi += carry
+	adds	r5, r5, r1	    		@ d.lo += tmp.lo
+	mla	r2, r14, r4, r2      		@ tmp.hi += c.hi * (R1 >> 4)
+	adc	r6, r6, r2	   		@ d.hi += carry + tmp.hi
+
+	bic	r2, r5, field_not_M 		@ r[1] = d & M
+	str	r2, [r0, #1*4]
+	mov	r5, r5, lsr #26     		@ d >>= 26 (ignore hi)
+	orr	r5, r5, r6, asl #6
+
+	add	r5, r5, r9	  		@ d += t2
+	str	r5, [r0, #2*4]      		@ r[2] = d
+
+	add	sp, sp, #48
+	ldmfd	sp!, {r4, r5, r6, r7, r8, r9, r10, r11, pc}
+	.size	secp256k1_fe_mul_inner, .-secp256k1_fe_mul_inner
+
+	.align	2
+	.global secp256k1_fe_sqr_inner
+	.type	secp256k1_fe_sqr_inner, %function
+	@ Arguments:
+	@  r0  r	 Can overlap with a
+	@  r1  a
+	@ Stack (total 4+10*4 = 44)
+	@  sp + #0        saved 'r' pointer
+	@  sp + #4 + 4*X  t0,t1,t2,t3,t4,t5,t6,t7,u8,t9
+secp256k1_fe_sqr_inner:
+	stmfd	sp!, {r4, r5, r6, r7, r8, r9, r10, r11, r14}
+	sub	sp, sp, #48			@ frame=44 + alignment
+	str     r0, [sp, #0]			@ save result address, we need it only at the end
+	/******************************************
+	 * Main computation code.
+	 ******************************************
+
+	Allocation:
+	    r0,r14,r2,r7,r8   scratch
+	    r1       a (pointer)
+	    r3:r4    c
+	    r5:r6    d
+	    r11:r12  c'
+	    r9:r10   d'
+
+	Note: do not write to r[] here, it may overlap with a[]
+	*/
+	/* A interleaved with B */
+	ldr	r0, [r1, #1*4]			@ a[1]*2
+	ldr	r7, [r1, #0*4]			@ a[0]
+	mov	r0, r0, asl #1
+	ldr	r14, [r1, #9*4]			@ a[9]
+	umull	r3, r4, r7, r7			@ c = a[0] * a[0]
+	ldr	r8, [r1, #8*4]			@ a[8]
+	mov	r7, r7, asl #1
+	umull	r5, r6, r7, r14			@ d = a[0]*2 * a[9]
+	ldr	r7, [r1, #2*4]			@ a[2]*2
+	umull	r9, r10, r0, r14		@ d' = a[1]*2 * a[9]
+	ldr	r14, [r1, #7*4]			@ a[7]
+	umlal	r5, r6, r0, r8			@ d += a[1]*2 * a[8]
+	mov	r7, r7, asl #1
+	ldr	r0, [r1, #3*4]			@ a[3]*2
+	umlal	r9, r10, r7, r8			@ d' += a[2]*2 * a[8]
+	ldr	r8, [r1, #6*4]			@ a[6]
+	umlal	r5, r6, r7, r14			@ d += a[2]*2 * a[7]
+	mov	r0, r0, asl #1
+	ldr	r7, [r1, #4*4]			@ a[4]*2
+	umlal	r9, r10, r0, r14		@ d' += a[3]*2 * a[7]
+	ldr	r14, [r1, #5*4]			@ a[5]
+	mov	r7, r7, asl #1
+	umlal	r5, r6, r0, r8			@ d += a[3]*2 * a[6]
+	umlal	r9, r10, r7, r8			@ d' += a[4]*2 * a[6]
+	umlal	r5, r6, r7, r14			@ d += a[4]*2 * a[5]
+	umlal	r9, r10, r14, r14		@ d' += a[5] * a[5]
+
+	bic	r0, r5, field_not_M 		@ t9 = d & M
+	str     r0, [sp, #4 + 9*4]
+	mov	r5, r5, lsr #26     		@ d >>= 26 
+	orr	r5, r5, r6, asl #6
+	mov     r6, r6, lsr #26
+
+	/* B */
+	adds	r5, r5, r9			@ d += d'
+	adc	r6, r6, r10
+
+	bic	r0, r5, field_not_M 		@ u0 = d & M
+	mov	r5, r5, lsr #26     		@ d >>= 26
+	orr	r5, r5, r6, asl #6
+	mov     r6, r6, lsr #26
+	movw    r14, field_R0			@ c += u0 * R0
+	umlal   r3, r4, r0, r14
+	bic	r14, r3, field_not_M 		@ t0 = c & M
+	str	r14, [sp, #4 + 0*4]
+	mov	r3, r3, lsr #26     		@ c >>= 26
+	orr	r3, r3, r4, asl #6
+	mov     r4, r4, lsr #26
+	mov     r14, field_R1			@ c += u0 * R1
+	umlal   r3, r4, r0, r14
+
+	/* C interleaved with D */
+	ldr	r0, [r1, #0*4]			@ a[0]*2
+	ldr	r14, [r1, #1*4]			@ a[1]
+	mov	r0, r0, asl #1
+	ldr	r8, [r1, #2*4]			@ a[2]
+	umlal	r3, r4, r0, r14			@ c += a[0]*2 * a[1]
+	mov	r7, r8, asl #1                  @ a[2]*2
+	umull	r11, r12, r14, r14		@ c' = a[1] * a[1]
+	ldr	r14, [r1, #9*4]			@ a[9]
+	umlal	r11, r12, r0, r8		@ c' += a[0]*2 * a[2]
+	ldr	r0, [r1, #3*4]			@ a[3]*2
+	ldr	r8, [r1, #8*4]			@ a[8]
+	umlal	r5, r6, r7, r14			@ d += a[2]*2 * a[9]
+	mov	r0, r0, asl #1
+	ldr	r7, [r1, #4*4]			@ a[4]*2
+	umull	r9, r10, r0, r14		@ d' = a[3]*2 * a[9]
+	ldr	r14, [r1, #7*4]			@ a[7]
+	umlal	r5, r6, r0, r8			@ d += a[3]*2 * a[8]
+	mov	r7, r7, asl #1
+	ldr	r0, [r1, #5*4]			@ a[5]*2
+	umlal	r9, r10, r7, r8			@ d' += a[4]*2 * a[8]
+	ldr	r8, [r1, #6*4]			@ a[6]
+	mov	r0, r0, asl #1
+	umlal	r5, r6, r7, r14			@ d += a[4]*2 * a[7]
+	umlal	r9, r10, r0, r14		@ d' += a[5]*2 * a[7]
+	umlal	r5, r6, r0, r8			@ d += a[5]*2 * a[6]
+	umlal	r9, r10, r8, r8			@ d' += a[6] * a[6]
+
+	bic	r0, r5, field_not_M 		@ u1 = d & M
+	mov	r5, r5, lsr #26     		@ d >>= 26
+	orr	r5, r5, r6, asl #6
+	mov     r6, r6, lsr #26
+	movw    r14, field_R0			@ c += u1 * R0
+	umlal   r3, r4, r0, r14
+	bic	r14, r3, field_not_M 		@ t1 = c & M
+	str	r14, [sp, #4 + 1*4]
+	mov	r3, r3, lsr #26     		@ c >>= 26
+	orr	r3, r3, r4, asl #6
+	mov     r4, r4, lsr #26
+	mov     r14, field_R1			@ c += u1 * R1
+	umlal   r3, r4, r0, r14
+
+	/* D */
+	adds	r3, r3, r11			@ c += c'
+	adc	r4, r4, r12
+	adds	r5, r5, r9			@ d += d'
+	adc	r6, r6, r10
+
+	bic	r0, r5, field_not_M 		@ u2 = d & M
+	mov	r5, r5, lsr #26     		@ d >>= 26
+	orr	r5, r5, r6, asl #6
+	mov     r6, r6, lsr #26
+	movw    r14, field_R0			@ c += u2 * R0
+	umlal   r3, r4, r0, r14
+	bic	r14, r3, field_not_M 		@ t2 = c & M
+	str	r14, [sp, #4 + 2*4]
+	mov	r3, r3, lsr #26     		@ c >>= 26
+	orr	r3, r3, r4, asl #6
+	mov     r4, r4, lsr #26
+	mov     r14, field_R1			@ c += u2 * R1
+	umlal   r3, r4, r0, r14
+
+	/* E interleaved with F */
+	ldr	r7, [r1, #0*4]			@ a[0]*2
+	ldr	r0, [r1, #1*4]			@ a[1]*2
+	ldr	r14, [r1, #2*4]			@ a[2]
+	mov	r7, r7, asl #1
+	ldr	r8, [r1, #3*4]			@ a[3]
+	ldr	r2, [r1, #4*4]
+	umlal	r3, r4, r7, r8			@ c += a[0]*2 * a[3]
+	mov	r0, r0, asl #1
+	umull	r11, r12, r7, r2		@ c' = a[0]*2 * a[4]
+	mov	r2, r2, asl #1			@ a[4]*2
+	umlal	r11, r12, r0, r8		@ c' += a[1]*2 * a[3]
+	ldr	r8, [r1, #9*4]			@ a[9]
+	umlal	r3, r4, r0, r14			@ c += a[1]*2 * a[2]
+	ldr	r0, [r1, #5*4]			@ a[5]*2
+	umlal	r11, r12, r14, r14		@ c' += a[2] * a[2]
+	ldr	r14, [r1, #8*4]			@ a[8]
+	mov	r0, r0, asl #1
+	umlal	r5, r6, r2, r8			@ d += a[4]*2 * a[9]
+	ldr	r7, [r1, #6*4]			@ a[6]*2
+	umull	r9, r10, r0, r8			@ d' = a[5]*2 * a[9]
+	mov	r7, r7, asl #1
+	ldr	r8, [r1, #7*4]			@ a[7]
+	umlal	r5, r6, r0, r14			@ d += a[5]*2 * a[8]
+	umlal	r9, r10, r7, r14		@ d' += a[6]*2 * a[8]
+	umlal	r5, r6, r7, r8			@ d += a[6]*2 * a[7]
+	umlal	r9, r10, r8, r8			@ d' += a[7] * a[7]
+
+	bic	r0, r5, field_not_M 		@ u3 = d & M
+	mov	r5, r5, lsr #26     		@ d >>= 26
+	orr	r5, r5, r6, asl #6
+	mov     r6, r6, lsr #26
+	movw    r14, field_R0			@ c += u3 * R0
+	umlal   r3, r4, r0, r14
+	bic	r14, r3, field_not_M 		@ t3 = c & M
+	str	r14, [sp, #4 + 3*4]
+	mov	r3, r3, lsr #26     		@ c >>= 26
+	orr	r3, r3, r4, asl #6
+	mov     r4, r4, lsr #26
+	mov     r14, field_R1			@ c += u3 * R1
+	umlal   r3, r4, r0, r14
+
+	/* F */
+	adds	r3, r3, r11			@ c += c'
+	adc	r4, r4, r12
+	adds	r5, r5, r9			@ d += d'
+	adc	r6, r6, r10
+
+	bic	r0, r5, field_not_M 		@ u4 = d & M
+	mov	r5, r5, lsr #26     		@ d >>= 26
+	orr	r5, r5, r6, asl #6
+	mov     r6, r6, lsr #26
+	movw    r14, field_R0			@ c += u4 * R0
+	umlal   r3, r4, r0, r14
+	bic	r14, r3, field_not_M 		@ t4 = c & M
+	str	r14, [sp, #4 + 4*4]
+	mov	r3, r3, lsr #26     		@ c >>= 26
+	orr	r3, r3, r4, asl #6
+	mov     r4, r4, lsr #26
+	mov     r14, field_R1			@ c += u4 * R1
+	umlal   r3, r4, r0, r14
+
+	/* G interleaved with H */
+	ldr	r7, [r1, #0*4]			@ a[0]*2
+	ldr	r0, [r1, #1*4]			@ a[1]*2
+	mov	r7, r7, asl #1
+	ldr	r8, [r1, #5*4]			@ a[5]
+	ldr	r2, [r1, #6*4]			@ a[6]
+	umlal	r3, r4, r7, r8			@ c += a[0]*2 * a[5]
+	ldr	r14, [r1, #4*4]			@ a[4]
+	mov	r0, r0, asl #1
+	umull	r11, r12, r7, r2		@ c' = a[0]*2 * a[6]
+	ldr	r7, [r1, #2*4]			@ a[2]*2
+	umlal	r11, r12, r0, r8		@ c' += a[1]*2 * a[5]
+	mov	r7, r7, asl #1
+	ldr	r8, [r1, #3*4]			@ a[3]
+	umlal	r3, r4, r0, r14			@ c += a[1]*2 * a[4]
+	mov	r0, r2, asl #1			@ a[6]*2
+	umlal	r11, r12, r7, r14		@ c' += a[2]*2 * a[4]
+	ldr	r14, [r1, #9*4]			@ a[9]
+	umlal	r3, r4, r7, r8			@ c += a[2]*2 * a[3]
+	ldr	r7, [r1, #7*4]			@ a[7]*2
+	umlal	r11, r12, r8, r8		@ c' += a[3] * a[3]
+	mov	r7, r7, asl #1
+	ldr	r8, [r1, #8*4]			@ a[8]
+	umlal	r5, r6, r0, r14			@ d += a[6]*2 * a[9]
+	umull	r9, r10, r7, r14		@ d' = a[7]*2 * a[9]
+	umlal	r5, r6, r7, r8			@ d += a[7]*2 * a[8]
+	umlal	r9, r10, r8, r8			@ d' += a[8] * a[8]
+
+	bic	r0, r5, field_not_M 		@ u5 = d & M
+	mov	r5, r5, lsr #26     		@ d >>= 26
+	orr	r5, r5, r6, asl #6
+	mov     r6, r6, lsr #26
+	movw    r14, field_R0			@ c += u5 * R0
+	umlal   r3, r4, r0, r14
+	bic	r14, r3, field_not_M 		@ t5 = c & M
+	str	r14, [sp, #4 + 5*4]
+	mov	r3, r3, lsr #26     		@ c >>= 26
+	orr	r3, r3, r4, asl #6
+	mov     r4, r4, lsr #26
+	mov     r14, field_R1			@ c += u5 * R1
+	umlal   r3, r4, r0, r14
+
+	/* H */
+	adds	r3, r3, r11			@ c += c'
+	adc	r4, r4, r12
+	adds	r5, r5, r9			@ d += d'
+	adc	r6, r6, r10
+
+	bic	r0, r5, field_not_M 		@ u6 = d & M
+	mov	r5, r5, lsr #26     		@ d >>= 26
+	orr	r5, r5, r6, asl #6
+	mov     r6, r6, lsr #26
+	movw    r14, field_R0			@ c += u6 * R0
+	umlal   r3, r4, r0, r14
+	bic	r14, r3, field_not_M 		@ t6 = c & M
+	str	r14, [sp, #4 + 6*4]
+	mov	r3, r3, lsr #26     		@ c >>= 26
+	orr	r3, r3, r4, asl #6
+	mov     r4, r4, lsr #26
+	mov     r14, field_R1			@ c += u6 * R1
+	umlal   r3, r4, r0, r14
+
+	/* I interleaved with J */
+	ldr	r7, [r1, #0*4]			@ a[0]*2
+	ldr	r0, [r1, #1*4]			@ a[1]*2
+	mov	r7, r7, asl #1
+	ldr	r8, [r1, #7*4]			@ a[7]
+	ldr	r2, [r1, #8*4]			@ a[8]
+	umlal	r3, r4, r7, r8			@ c += a[0]*2 * a[7]
+	ldr	r14, [r1, #6*4]			@ a[6]
+	mov	r0, r0, asl #1
+	umull	r11, r12, r7, r2		@ c' = a[0]*2 * a[8]
+	ldr	r7, [r1, #2*4]			@ a[2]*2
+	umlal	r11, r12, r0, r8		@ c' += a[1]*2 * a[7]
+	ldr	r8, [r1, #5*4]			@ a[5]
+	umlal	r3, r4, r0, r14			@ c += a[1]*2 * a[6]
+	ldr	r0, [r1, #3*4]			@ a[3]*2
+	mov	r7, r7, asl #1
+	umlal	r11, r12, r7, r14		@ c' += a[2]*2 * a[6]
+	ldr	r14, [r1, #4*4]			@ a[4]
+	mov	r0, r0, asl #1
+	umlal	r3, r4, r7, r8			@ c += a[2]*2 * a[5]
+	mov	r2, r2, asl #1			@ a[8]*2
+	umlal	r11, r12, r0, r8		@ c' += a[3]*2 * a[5]
+	umlal	r3, r4, r0, r14			@ c += a[3]*2 * a[4]
+	umlal	r11, r12, r14, r14		@ c' += a[4] * a[4]
+	ldr	r8, [r1, #9*4]			@ a[9]
+	umlal	r5, r6, r2, r8			@ d += a[8]*2 * a[9]
+	@ r8 will be used in J
+
+	bic	r0, r5, field_not_M 		@ u7 = d & M
+	mov	r5, r5, lsr #26     		@ d >>= 26
+	orr	r5, r5, r6, asl #6
+	mov     r6, r6, lsr #26
+	movw    r14, field_R0			@ c += u7 * R0
+	umlal   r3, r4, r0, r14
+	bic	r14, r3, field_not_M 		@ t7 = c & M
+	str	r14, [sp, #4 + 7*4]
+	mov	r3, r3, lsr #26     		@ c >>= 26
+	orr	r3, r3, r4, asl #6
+	mov     r4, r4, lsr #26
+	mov     r14, field_R1			@ c += u7 * R1
+	umlal   r3, r4, r0, r14
+
+	/* J */
+	adds	r3, r3, r11			@ c += c'
+	adc	r4, r4, r12
+	umlal	r5, r6, r8, r8			@ d += a[9] * a[9]
+
+	bic	r0, r5, field_not_M 		@ u8 = d & M
+	str	r0, [sp, #4 + 8*4]
+	mov	r5, r5, lsr #26     		@ d >>= 26
+	orr	r5, r5, r6, asl #6
+	mov     r6, r6, lsr #26
+	movw    r14, field_R0			@ c += u8 * R0
+	umlal   r3, r4, r0, r14
+
+	/******************************************
+	 * compute and write back result
+	 ******************************************
+	Allocation:
+	    r0    r
+	    r3:r4 c
+	    r5:r6 d
+	    r7    t0
+	    r8    t1
+	    r9    t2
+	    r11   u8
+	    r12   t9
+	    r1,r2,r10,r14 scratch
+
+	Note: do not read from a[] after here, it may overlap with r[]
+	*/
+	ldr	r0, [sp, #0]
+	add	r1, sp, #4 + 3*4		@ r[3..7] = t3..7, r11=u8, r12=t9
+	ldmia	r1, {r2,r7,r8,r9,r10,r11,r12}
+	add	r1, r0, #3*4
+	stmia	r1, {r2,r7,r8,r9,r10}
+
+	bic	r2, r3, field_not_M 		@ r[8] = c & M
+	str	r2, [r0, #8*4]
+	mov	r3, r3, lsr #26     		@ c >>= 26
+	orr	r3, r3, r4, asl #6
+	mov     r4, r4, lsr #26
+	mov     r14, field_R1			@ c += u8 * R1
+	umlal   r3, r4, r11, r14
+	movw    r14, field_R0			@ c += d * R0
+	umlal   r3, r4, r5, r14
+	adds	r3, r3, r12			@ c += t9
+	adc	r4, r4, #0
+
+	add	r1, sp, #4 + 0*4		@ r7,r8,r9 = t0,t1,t2
+	ldmia	r1, {r7,r8,r9}
+
+	ubfx	r2, r3, #0, #22     		@ r[9] = c & (M >> 4)
+	str	r2, [r0, #9*4]
+	mov	r3, r3, lsr #22     		@ c >>= 22
+	orr	r3, r3, r4, asl #10
+	mov     r4, r4, lsr #22
+	movw    r14, field_R1 << 4   		@ c += d * (R1 << 4)
+	umlal   r3, r4, r5, r14
+
+	movw    r14, field_R0 >> 4   		@ d = c * (R0 >> 4) + t0 (64x64 multiply+add)
+	umull	r5, r6, r3, r14			@ d = c.lo * (R0 >> 4)
+	adds	r5, r5, r7	    		@ d.lo += t0
+	mla	r6, r14, r4, r6			@ d.hi += c.hi * (R0 >> 4)
+	adc	r6, r6, 0	     		@ d.hi += carry
+
+	bic	r2, r5, field_not_M 		@ r[0] = d & M
+	str	r2, [r0, #0*4]
+
+	mov	r5, r5, lsr #26     		@ d >>= 26
+	orr	r5, r5, r6, asl #6
+	mov     r6, r6, lsr #26
+	
+	movw    r14, field_R1 >> 4   		@ d += c * (R1 >> 4) + t1 (64x64 multiply+add)
+	umull	r1, r2, r3, r14       		@ tmp = c.lo * (R1 >> 4)
+	adds	r5, r5, r8	    		@ d.lo += t1
+	adc	r6, r6, #0	    		@ d.hi += carry
+	adds	r5, r5, r1	    		@ d.lo += tmp.lo
+	mla	r2, r14, r4, r2      		@ tmp.hi += c.hi * (R1 >> 4)
+	adc	r6, r6, r2	   		@ d.hi += carry + tmp.hi
+
+	bic	r2, r5, field_not_M 		@ r[1] = d & M
+	str	r2, [r0, #1*4]
+	mov	r5, r5, lsr #26     		@ d >>= 26 (ignore hi)
+	orr	r5, r5, r6, asl #6
+
+	add	r5, r5, r9	  		@ d += t2
+	str	r5, [r0, #2*4]      		@ r[2] = d
+
+	add	sp, sp, #48
+	ldmfd	sp!, {r4, r5, r6, r7, r8, r9, r10, r11, pc}
+	.size	secp256k1_fe_sqr_inner, .-secp256k1_fe_sqr_inner
+
diff --git a/depend/zcash/src/secp256k1/src/assumptions.h b/depend/zcash/src/secp256k1/src/assumptions.h
new file mode 100644
index 000000000..6dc527b28
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/assumptions.h
@@ -0,0 +1,80 @@
+/***********************************************************************
+ * Copyright (c) 2020 Pieter Wuille                                    *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_ASSUMPTIONS_H
+#define SECP256K1_ASSUMPTIONS_H
+
+#include <limits.h>
+
+#include "util.h"
+
+/* This library, like most software, relies on a number of compiler implementation defined (but not undefined)
+   behaviours. Although the behaviours we require are essentially universal we test them specifically here to
+   reduce the odds of experiencing an unwelcome surprise.
+*/
+
+struct secp256k1_assumption_checker {
+    /* This uses a trick to implement a static assertion in C89: a type with an array of negative size is not
+       allowed. */
+    int dummy_array[(
+        /* Bytes are 8 bits. */
+        (CHAR_BIT == 8) &&
+
+        /* No integer promotion for uint32_t. This ensures that we can multiply uintXX_t values where XX >= 32
+           without signed overflow, which would be undefined behaviour. */
+        (UINT_MAX <= UINT32_MAX) &&
+
+        /* Conversions from unsigned to signed outside of the bounds of the signed type are
+           implementation-defined. Verify that they function as reinterpreting the lower
+           bits of the input in two's complement notation. Do this for conversions:
+           - from uint(N)_t to int(N)_t with negative result
+           - from uint(2N)_t to int(N)_t with negative result
+           - from int(2N)_t to int(N)_t with negative result
+           - from int(2N)_t to int(N)_t with positive result */
+
+        /* To int8_t. */
+        ((int8_t)(uint8_t)0xAB == (int8_t)-(int8_t)0x55) &&
+        ((int8_t)(uint16_t)0xABCD == (int8_t)-(int8_t)0x33) &&
+        ((int8_t)(int16_t)(uint16_t)0xCDEF == (int8_t)(uint8_t)0xEF) &&
+        ((int8_t)(int16_t)(uint16_t)0x9234 == (int8_t)(uint8_t)0x34) &&
+
+        /* To int16_t. */
+        ((int16_t)(uint16_t)0xBCDE == (int16_t)-(int16_t)0x4322) &&
+        ((int16_t)(uint32_t)0xA1B2C3D4 == (int16_t)-(int16_t)0x3C2C) &&
+        ((int16_t)(int32_t)(uint32_t)0xC1D2E3F4 == (int16_t)(uint16_t)0xE3F4) &&
+        ((int16_t)(int32_t)(uint32_t)0x92345678 == (int16_t)(uint16_t)0x5678) &&
+
+        /* To int32_t. */
+        ((int32_t)(uint32_t)0xB2C3D4E5 == (int32_t)-(int32_t)0x4D3C2B1B) &&
+        ((int32_t)(uint64_t)0xA123B456C789D012ULL == (int32_t)-(int32_t)0x38762FEE) &&
+        ((int32_t)(int64_t)(uint64_t)0xC1D2E3F4A5B6C7D8ULL == (int32_t)(uint32_t)0xA5B6C7D8) &&
+        ((int32_t)(int64_t)(uint64_t)0xABCDEF0123456789ULL == (int32_t)(uint32_t)0x23456789) &&
+
+        /* To int64_t. */
+        ((int64_t)(uint64_t)0xB123C456D789E012ULL == (int64_t)-(int64_t)0x4EDC3BA928761FEEULL) &&
+#if defined(SECP256K1_WIDEMUL_INT128)
+        ((int64_t)(((uint128_t)0xA1234567B8901234ULL << 64) + 0xC5678901D2345678ULL) == (int64_t)-(int64_t)0x3A9876FE2DCBA988ULL) &&
+        (((int64_t)(int128_t)(((uint128_t)0xB1C2D3E4F5A6B7C8ULL << 64) + 0xD9E0F1A2B3C4D5E6ULL)) == (int64_t)(uint64_t)0xD9E0F1A2B3C4D5E6ULL) &&
+        (((int64_t)(int128_t)(((uint128_t)0xABCDEF0123456789ULL << 64) + 0x0123456789ABCDEFULL)) == (int64_t)(uint64_t)0x0123456789ABCDEFULL) &&
+
+        /* To int128_t. */
+        ((int128_t)(((uint128_t)0xB1234567C8901234ULL << 64) + 0xD5678901E2345678ULL) == (int128_t)(-(int128_t)0x8E1648B3F50E80DCULL * 0x8E1648B3F50E80DDULL + 0x5EA688D5482F9464ULL)) &&
+#endif
+
+        /* Right shift on negative signed values is implementation defined. Verify that it
+           acts as a right shift in two's complement with sign extension (i.e duplicating
+           the top bit into newly added bits). */
+        ((((int8_t)0xE8) >> 2) == (int8_t)(uint8_t)0xFA) &&
+        ((((int16_t)0xE9AC) >> 4) == (int16_t)(uint16_t)0xFE9A) &&
+        ((((int32_t)0x937C918A) >> 9) == (int32_t)(uint32_t)0xFFC9BE48) &&
+        ((((int64_t)0xA8B72231DF9CF4B9ULL) >> 19) == (int64_t)(uint64_t)0xFFFFF516E4463BF3ULL) &&
+#if defined(SECP256K1_WIDEMUL_INT128)
+        ((((int128_t)(((uint128_t)0xCD833A65684A0DBCULL << 64) + 0xB349312F71EA7637ULL)) >> 39) == (int128_t)(((uint128_t)0xFFFFFFFFFF9B0674ULL << 64) + 0xCAD0941B79669262ULL)) &&
+#endif
+    1) * 2 - 1];
+};
+
+#endif /* SECP256K1_ASSUMPTIONS_H */
diff --git a/depend/zcash/src/secp256k1/src/basic-config.h b/depend/zcash/src/secp256k1/src/basic-config.h
new file mode 100644
index 000000000..bb6b58259
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/basic-config.h
@@ -0,0 +1,34 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_BASIC_CONFIG_H
+#define SECP256K1_BASIC_CONFIG_H
+
+#ifdef USE_BASIC_CONFIG
+
+#undef USE_ASM_X86_64
+#undef USE_ECMULT_STATIC_PRECOMPUTATION
+#undef USE_EXTERNAL_ASM
+#undef USE_EXTERNAL_DEFAULT_CALLBACKS
+#undef USE_FIELD_INV_BUILTIN
+#undef USE_FIELD_INV_NUM
+#undef USE_NUM_GMP
+#undef USE_NUM_NONE
+#undef USE_SCALAR_INV_BUILTIN
+#undef USE_SCALAR_INV_NUM
+#undef USE_FORCE_WIDEMUL_INT64
+#undef USE_FORCE_WIDEMUL_INT128
+#undef ECMULT_WINDOW_SIZE
+
+#define USE_NUM_NONE 1
+#define USE_FIELD_INV_BUILTIN 1
+#define USE_SCALAR_INV_BUILTIN 1
+#define USE_WIDEMUL_64 1
+#define ECMULT_WINDOW_SIZE 15
+
+#endif /* USE_BASIC_CONFIG */
+
+#endif /* SECP256K1_BASIC_CONFIG_H */
diff --git a/depend/zcash/src/secp256k1/src/bench.h b/depend/zcash/src/secp256k1/src/bench.h
new file mode 100644
index 000000000..63c55df44
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/bench.h
@@ -0,0 +1,133 @@
+/***********************************************************************
+ * Copyright (c) 2014 Pieter Wuille                                    *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_BENCH_H
+#define SECP256K1_BENCH_H
+
+#include <stdint.h>
+#include <stdio.h>
+#include <string.h>
+#include "sys/time.h"
+
+static int64_t gettime_i64(void) {
+    struct timeval tv;
+    gettimeofday(&tv, NULL);
+    return (int64_t)tv.tv_usec + (int64_t)tv.tv_sec * 1000000LL;
+}
+
+#define FP_EXP (6)
+#define FP_MULT (1000000LL)
+
+/* Format fixed point number. */
+void print_number(const int64_t x) {
+    int64_t x_abs, y;
+    int c, i, rounding;
+    size_t ptr;
+    char buffer[30];
+
+    if (x == INT64_MIN) {
+        /* Prevent UB. */
+        printf("ERR");
+        return;
+    }
+    x_abs = x < 0 ? -x : x;
+
+    /* Determine how many decimals we want to show (more than FP_EXP makes no
+     * sense). */
+    y = x_abs;
+    c = 0;
+    while (y > 0LL && y < 100LL * FP_MULT && c < FP_EXP) {
+        y *= 10LL;
+        c++;
+    }
+
+    /* Round to 'c' decimals. */
+    y = x_abs;
+    rounding = 0;
+    for (i = c; i < FP_EXP; ++i) {
+        rounding = (y % 10) >= 5;
+        y /= 10;
+    }
+    y += rounding;
+
+    /* Format and print the number. */
+    ptr = sizeof(buffer) - 1;
+    buffer[ptr] = 0;
+    if (c != 0) {
+        for (i = 0; i < c; ++i) {
+            buffer[--ptr] = '0' + (y % 10);
+            y /= 10;
+        }
+        buffer[--ptr] = '.';
+    }
+    do {
+        buffer[--ptr] = '0' + (y % 10);
+        y /= 10;
+    } while (y != 0);
+    if (x < 0) {
+        buffer[--ptr] = '-';
+    }
+    printf("%s", &buffer[ptr]);
+}
+
+void run_benchmark(char *name, void (*benchmark)(void*, int), void (*setup)(void*), void (*teardown)(void*, int), void* data, int count, int iter) {
+    int i;
+    int64_t min = INT64_MAX;
+    int64_t sum = 0;
+    int64_t max = 0;
+    for (i = 0; i < count; i++) {
+        int64_t begin, total;
+        if (setup != NULL) {
+            setup(data);
+        }
+        begin = gettime_i64();
+        benchmark(data, iter);
+        total = gettime_i64() - begin;
+        if (teardown != NULL) {
+            teardown(data, iter);
+        }
+        if (total < min) {
+            min = total;
+        }
+        if (total > max) {
+            max = total;
+        }
+        sum += total;
+    }
+    printf("%s: min ", name);
+    print_number(min * FP_MULT / iter);
+    printf("us / avg ");
+    print_number(((sum * FP_MULT) / count) / iter);
+    printf("us / max ");
+    print_number(max * FP_MULT / iter);
+    printf("us\n");
+}
+
+int have_flag(int argc, char** argv, char *flag) {
+    char** argm = argv + argc;
+    argv++;
+    if (argv == argm) {
+        return 1;
+    }
+    while (argv != NULL && argv != argm) {
+        if (strcmp(*argv, flag) == 0) {
+            return 1;
+        }
+        argv++;
+    }
+    return 0;
+}
+
+int get_iters(int default_iters) {
+    char* env = getenv("SECP256K1_BENCH_ITERS");
+    if (env) {
+        return strtol(env, NULL, 0);
+    } else {
+        return default_iters;
+    }
+}
+
+#endif /* SECP256K1_BENCH_H */
diff --git a/depend/zcash/src/secp256k1/src/bench_ecdh.c b/depend/zcash/src/secp256k1/src/bench_ecdh.c
new file mode 100644
index 000000000..ab4b8f424
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/bench_ecdh.c
@@ -0,0 +1,59 @@
+/***********************************************************************
+ * Copyright (c) 2015 Pieter Wuille, Andrew Poelstra                   *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#include <string.h>
+
+#include "include/secp256k1.h"
+#include "include/secp256k1_ecdh.h"
+#include "util.h"
+#include "bench.h"
+
+typedef struct {
+    secp256k1_context *ctx;
+    secp256k1_pubkey point;
+    unsigned char scalar[32];
+} bench_ecdh_data;
+
+static void bench_ecdh_setup(void* arg) {
+    int i;
+    bench_ecdh_data *data = (bench_ecdh_data*)arg;
+    const unsigned char point[] = {
+        0x03,
+        0x54, 0x94, 0xc1, 0x5d, 0x32, 0x09, 0x97, 0x06,
+        0xc2, 0x39, 0x5f, 0x94, 0x34, 0x87, 0x45, 0xfd,
+        0x75, 0x7c, 0xe3, 0x0e, 0x4e, 0x8c, 0x90, 0xfb,
+        0xa2, 0xba, 0xd1, 0x84, 0xf8, 0x83, 0xc6, 0x9f
+    };
+
+    for (i = 0; i < 32; i++) {
+        data->scalar[i] = i + 1;
+    }
+    CHECK(secp256k1_ec_pubkey_parse(data->ctx, &data->point, point, sizeof(point)) == 1);
+}
+
+static void bench_ecdh(void* arg, int iters) {
+    int i;
+    unsigned char res[32];
+    bench_ecdh_data *data = (bench_ecdh_data*)arg;
+
+    for (i = 0; i < iters; i++) {
+        CHECK(secp256k1_ecdh(data->ctx, res, &data->point, data->scalar, NULL, NULL) == 1);
+    }
+}
+
+int main(void) {
+    bench_ecdh_data data;
+
+    int iters = get_iters(20000);
+
+    /* create a context with no capabilities */
+    data.ctx = secp256k1_context_create(SECP256K1_FLAGS_TYPE_CONTEXT);
+
+    run_benchmark("ecdh", bench_ecdh, bench_ecdh_setup, NULL, &data, 10, iters);
+
+    secp256k1_context_destroy(data.ctx);
+    return 0;
+}
diff --git a/depend/zcash/src/secp256k1/src/bench_ecmult.c b/depend/zcash/src/secp256k1/src/bench_ecmult.c
new file mode 100644
index 000000000..85b9e439e
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/bench_ecmult.c
@@ -0,0 +1,214 @@
+/***********************************************************************
+ * Copyright (c) 2017 Pieter Wuille                                    *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+#include <stdio.h>
+
+#include "include/secp256k1.h"
+
+#include "util.h"
+#include "hash_impl.h"
+#include "num_impl.h"
+#include "field_impl.h"
+#include "group_impl.h"
+#include "scalar_impl.h"
+#include "ecmult_impl.h"
+#include "bench.h"
+#include "secp256k1.c"
+
+#define POINTS 32768
+
+typedef struct {
+    /* Setup once in advance */
+    secp256k1_context* ctx;
+    secp256k1_scratch_space* scratch;
+    secp256k1_scalar* scalars;
+    secp256k1_ge* pubkeys;
+    secp256k1_scalar* seckeys;
+    secp256k1_gej* expected_output;
+    secp256k1_ecmult_multi_func ecmult_multi;
+
+    /* Changes per test */
+    size_t count;
+    int includes_g;
+
+    /* Changes per test iteration */
+    size_t offset1;
+    size_t offset2;
+
+    /* Test output. */
+    secp256k1_gej* output;
+} bench_data;
+
+static int bench_callback(secp256k1_scalar* sc, secp256k1_ge* ge, size_t idx, void* arg) {
+    bench_data* data = (bench_data*)arg;
+    if (data->includes_g) ++idx;
+    if (idx == 0) {
+        *sc = data->scalars[data->offset1];
+        *ge = secp256k1_ge_const_g;
+    } else {
+        *sc = data->scalars[(data->offset1 + idx) % POINTS];
+        *ge = data->pubkeys[(data->offset2 + idx - 1) % POINTS];
+    }
+    return 1;
+}
+
+static void bench_ecmult(void* arg, int iters) {
+    bench_data* data = (bench_data*)arg;
+
+    int includes_g = data->includes_g;
+    int iter;
+    int count = data->count;
+    iters = iters / data->count;
+
+    for (iter = 0; iter < iters; ++iter) {
+        data->ecmult_multi(&data->ctx->error_callback, &data->ctx->ecmult_ctx, data->scratch, &data->output[iter], data->includes_g ? &data->scalars[data->offset1] : NULL, bench_callback, arg, count - includes_g);
+        data->offset1 = (data->offset1 + count) % POINTS;
+        data->offset2 = (data->offset2 + count - 1) % POINTS;
+    }
+}
+
+static void bench_ecmult_setup(void* arg) {
+    bench_data* data = (bench_data*)arg;
+    data->offset1 = (data->count * 0x537b7f6f + 0x8f66a481) % POINTS;
+    data->offset2 = (data->count * 0x7f6f537b + 0x6a1a8f49) % POINTS;
+}
+
+static void bench_ecmult_teardown(void* arg, int iters) {
+    bench_data* data = (bench_data*)arg;
+    int iter;
+    iters = iters / data->count;
+    /* Verify the results in teardown, to avoid doing comparisons while benchmarking. */
+    for (iter = 0; iter < iters; ++iter) {
+        secp256k1_gej tmp;
+        secp256k1_gej_add_var(&tmp, &data->output[iter], &data->expected_output[iter], NULL);
+        CHECK(secp256k1_gej_is_infinity(&tmp));
+    }
+}
+
+static void generate_scalar(uint32_t num, secp256k1_scalar* scalar) {
+    secp256k1_sha256 sha256;
+    unsigned char c[11] = {'e', 'c', 'm', 'u', 'l', 't', 0, 0, 0, 0};
+    unsigned char buf[32];
+    int overflow = 0;
+    c[6] = num;
+    c[7] = num >> 8;
+    c[8] = num >> 16;
+    c[9] = num >> 24;
+    secp256k1_sha256_initialize(&sha256);
+    secp256k1_sha256_write(&sha256, c, sizeof(c));
+    secp256k1_sha256_finalize(&sha256, buf);
+    secp256k1_scalar_set_b32(scalar, buf, &overflow);
+    CHECK(!overflow);
+}
+
+static void run_test(bench_data* data, size_t count, int includes_g, int num_iters) {
+    char str[32];
+    static const secp256k1_scalar zero = SECP256K1_SCALAR_CONST(0, 0, 0, 0, 0, 0, 0, 0);
+    size_t iters = 1 + num_iters / count;
+    size_t iter;
+
+    data->count = count;
+    data->includes_g = includes_g;
+
+    /* Compute (the negation of) the expected results directly. */
+    data->offset1 = (data->count * 0x537b7f6f + 0x8f66a481) % POINTS;
+    data->offset2 = (data->count * 0x7f6f537b + 0x6a1a8f49) % POINTS;
+    for (iter = 0; iter < iters; ++iter) {
+        secp256k1_scalar tmp;
+        secp256k1_scalar total = data->scalars[(data->offset1++) % POINTS];
+        size_t i = 0;
+        for (i = 0; i + 1 < count; ++i) {
+            secp256k1_scalar_mul(&tmp, &data->seckeys[(data->offset2++) % POINTS], &data->scalars[(data->offset1++) % POINTS]);
+            secp256k1_scalar_add(&total, &total, &tmp);
+        }
+        secp256k1_scalar_negate(&total, &total);
+        secp256k1_ecmult(&data->ctx->ecmult_ctx, &data->expected_output[iter], NULL, &zero, &total);
+    }
+
+    /* Run the benchmark. */
+    sprintf(str, includes_g ? "ecmult_%ig" : "ecmult_%i", (int)count);
+    run_benchmark(str, bench_ecmult, bench_ecmult_setup, bench_ecmult_teardown, data, 10, count * iters);
+}
+
+int main(int argc, char **argv) {
+    bench_data data;
+    int i, p;
+    secp256k1_gej* pubkeys_gej;
+    size_t scratch_size;
+
+    int iters = get_iters(10000);
+
+    data.ctx = secp256k1_context_create(SECP256K1_CONTEXT_SIGN | SECP256K1_CONTEXT_VERIFY);
+    scratch_size = secp256k1_strauss_scratch_size(POINTS) + STRAUSS_SCRATCH_OBJECTS*16;
+    data.scratch = secp256k1_scratch_space_create(data.ctx, scratch_size);
+    data.ecmult_multi = secp256k1_ecmult_multi_var;
+
+    if (argc > 1) {
+        if(have_flag(argc, argv, "pippenger_wnaf")) {
+            printf("Using pippenger_wnaf:\n");
+            data.ecmult_multi = secp256k1_ecmult_pippenger_batch_single;
+        } else if(have_flag(argc, argv, "strauss_wnaf")) {
+            printf("Using strauss_wnaf:\n");
+            data.ecmult_multi = secp256k1_ecmult_strauss_batch_single;
+        } else if(have_flag(argc, argv, "simple")) {
+            printf("Using simple algorithm:\n");
+            data.ecmult_multi = secp256k1_ecmult_multi_var;
+            secp256k1_scratch_space_destroy(data.ctx, data.scratch);
+            data.scratch = NULL;
+        } else {
+            fprintf(stderr, "%s: unrecognized argument '%s'.\n", argv[0], argv[1]);
+            fprintf(stderr, "Use 'pippenger_wnaf', 'strauss_wnaf', 'simple' or no argument to benchmark a combined algorithm.\n");
+            return 1;
+        }
+    }
+
+    /* Allocate stuff */
+    data.scalars = malloc(sizeof(secp256k1_scalar) * POINTS);
+    data.seckeys = malloc(sizeof(secp256k1_scalar) * POINTS);
+    data.pubkeys = malloc(sizeof(secp256k1_ge) * POINTS);
+    data.expected_output = malloc(sizeof(secp256k1_gej) * (iters + 1));
+    data.output = malloc(sizeof(secp256k1_gej) * (iters + 1));
+
+    /* Generate a set of scalars, and private/public keypairs. */
+    pubkeys_gej = malloc(sizeof(secp256k1_gej) * POINTS);
+    secp256k1_gej_set_ge(&pubkeys_gej[0], &secp256k1_ge_const_g);
+    secp256k1_scalar_set_int(&data.seckeys[0], 1);
+    for (i = 0; i < POINTS; ++i) {
+        generate_scalar(i, &data.scalars[i]);
+        if (i) {
+            secp256k1_gej_double_var(&pubkeys_gej[i], &pubkeys_gej[i - 1], NULL);
+            secp256k1_scalar_add(&data.seckeys[i], &data.seckeys[i - 1], &data.seckeys[i - 1]);
+        }
+    }
+    secp256k1_ge_set_all_gej_var(data.pubkeys, pubkeys_gej, POINTS);
+    free(pubkeys_gej);
+
+    for (i = 1; i <= 8; ++i) {
+        run_test(&data, i, 1, iters);
+    }
+
+    /* This is disabled with low count of iterations because the loop runs 77 times even with iters=1
+    * and the higher it goes the longer the computation takes(more points)
+    * So we don't run this benchmark with low iterations to prevent slow down */
+     if (iters > 2) {
+        for (p = 0; p <= 11; ++p) {
+            for (i = 9; i <= 16; ++i) {
+                run_test(&data, i << p, 1, iters);
+            }
+        }
+    }
+
+    if (data.scratch != NULL) {
+        secp256k1_scratch_space_destroy(data.ctx, data.scratch);
+    }
+    secp256k1_context_destroy(data.ctx);
+    free(data.scalars);
+    free(data.pubkeys);
+    free(data.seckeys);
+    free(data.output);
+    free(data.expected_output);
+
+    return(0);
+}
diff --git a/depend/zcash/src/secp256k1/src/bench_internal.c b/depend/zcash/src/secp256k1/src/bench_internal.c
new file mode 100644
index 000000000..7fa6882c1
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/bench_internal.c
@@ -0,0 +1,431 @@
+/***********************************************************************
+ * Copyright (c) 2014-2015 Pieter Wuille                               *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+#include <stdio.h>
+
+#include "include/secp256k1.h"
+
+#include "assumptions.h"
+#include "util.h"
+#include "hash_impl.h"
+#include "num_impl.h"
+#include "field_impl.h"
+#include "group_impl.h"
+#include "scalar_impl.h"
+#include "ecmult_const_impl.h"
+#include "ecmult_impl.h"
+#include "bench.h"
+#include "secp256k1.c"
+
+typedef struct {
+    secp256k1_scalar scalar[2];
+    secp256k1_fe fe[4];
+    secp256k1_ge ge[2];
+    secp256k1_gej gej[2];
+    unsigned char data[64];
+    int wnaf[256];
+} bench_inv;
+
+void bench_setup(void* arg) {
+    bench_inv *data = (bench_inv*)arg;
+
+    static const unsigned char init[4][32] = {
+        /* Initializer for scalar[0], fe[0], first half of data, the X coordinate of ge[0],
+           and the (implied affine) X coordinate of gej[0]. */
+        {
+            0x02, 0x03, 0x05, 0x07, 0x0b, 0x0d, 0x11, 0x13,
+            0x17, 0x1d, 0x1f, 0x25, 0x29, 0x2b, 0x2f, 0x35,
+            0x3b, 0x3d, 0x43, 0x47, 0x49, 0x4f, 0x53, 0x59,
+            0x61, 0x65, 0x67, 0x6b, 0x6d, 0x71, 0x7f, 0x83
+        },
+        /* Initializer for scalar[1], fe[1], first half of data, the X coordinate of ge[1],
+           and the (implied affine) X coordinate of gej[1]. */
+        {
+            0x82, 0x83, 0x85, 0x87, 0x8b, 0x8d, 0x81, 0x83,
+            0x97, 0xad, 0xaf, 0xb5, 0xb9, 0xbb, 0xbf, 0xc5,
+            0xdb, 0xdd, 0xe3, 0xe7, 0xe9, 0xef, 0xf3, 0xf9,
+            0x11, 0x15, 0x17, 0x1b, 0x1d, 0xb1, 0xbf, 0xd3
+        },
+        /* Initializer for fe[2] and the Z coordinate of gej[0]. */
+        {
+            0x3d, 0x2d, 0xef, 0xf4, 0x25, 0x98, 0x4f, 0x5d,
+            0xe2, 0xca, 0x5f, 0x41, 0x3f, 0x3f, 0xce, 0x44,
+            0xaa, 0x2c, 0x53, 0x8a, 0xc6, 0x59, 0x1f, 0x38,
+            0x38, 0x23, 0xe4, 0x11, 0x27, 0xc6, 0xa0, 0xe7
+        },
+        /* Initializer for fe[3] and the Z coordinate of gej[1]. */
+        {
+            0xbd, 0x21, 0xa5, 0xe1, 0x13, 0x50, 0x73, 0x2e,
+            0x52, 0x98, 0xc8, 0x9e, 0xab, 0x00, 0xa2, 0x68,
+            0x43, 0xf5, 0xd7, 0x49, 0x80, 0x72, 0xa7, 0xf3,
+            0xd7, 0x60, 0xe6, 0xab, 0x90, 0x92, 0xdf, 0xc5
+        }
+    };
+
+    secp256k1_scalar_set_b32(&data->scalar[0], init[0], NULL);
+    secp256k1_scalar_set_b32(&data->scalar[1], init[1], NULL);
+    secp256k1_fe_set_b32(&data->fe[0], init[0]);
+    secp256k1_fe_set_b32(&data->fe[1], init[1]);
+    secp256k1_fe_set_b32(&data->fe[2], init[2]);
+    secp256k1_fe_set_b32(&data->fe[3], init[3]);
+    CHECK(secp256k1_ge_set_xo_var(&data->ge[0], &data->fe[0], 0));
+    CHECK(secp256k1_ge_set_xo_var(&data->ge[1], &data->fe[1], 1));
+    secp256k1_gej_set_ge(&data->gej[0], &data->ge[0]);
+    secp256k1_gej_rescale(&data->gej[0], &data->fe[2]);
+    secp256k1_gej_set_ge(&data->gej[1], &data->ge[1]);
+    secp256k1_gej_rescale(&data->gej[1], &data->fe[3]);
+    memcpy(data->data, init[0], 32);
+    memcpy(data->data + 32, init[1], 32);
+}
+
+void bench_scalar_add(void* arg, int iters) {
+    int i, j = 0;
+    bench_inv *data = (bench_inv*)arg;
+
+    for (i = 0; i < iters; i++) {
+        j += secp256k1_scalar_add(&data->scalar[0], &data->scalar[0], &data->scalar[1]);
+    }
+    CHECK(j <= iters);
+}
+
+void bench_scalar_negate(void* arg, int iters) {
+    int i;
+    bench_inv *data = (bench_inv*)arg;
+
+    for (i = 0; i < iters; i++) {
+        secp256k1_scalar_negate(&data->scalar[0], &data->scalar[0]);
+    }
+}
+
+void bench_scalar_sqr(void* arg, int iters) {
+    int i;
+    bench_inv *data = (bench_inv*)arg;
+
+    for (i = 0; i < iters; i++) {
+        secp256k1_scalar_sqr(&data->scalar[0], &data->scalar[0]);
+    }
+}
+
+void bench_scalar_mul(void* arg, int iters) {
+    int i;
+    bench_inv *data = (bench_inv*)arg;
+
+    for (i = 0; i < iters; i++) {
+        secp256k1_scalar_mul(&data->scalar[0], &data->scalar[0], &data->scalar[1]);
+    }
+}
+
+void bench_scalar_split(void* arg, int iters) {
+    int i, j = 0;
+    bench_inv *data = (bench_inv*)arg;
+
+    for (i = 0; i < iters; i++) {
+        secp256k1_scalar_split_lambda(&data->scalar[0], &data->scalar[1], &data->scalar[0]);
+        j += secp256k1_scalar_add(&data->scalar[0], &data->scalar[0], &data->scalar[1]);
+    }
+    CHECK(j <= iters);
+}
+
+void bench_scalar_inverse(void* arg, int iters) {
+    int i, j = 0;
+    bench_inv *data = (bench_inv*)arg;
+
+    for (i = 0; i < iters; i++) {
+        secp256k1_scalar_inverse(&data->scalar[0], &data->scalar[0]);
+        j += secp256k1_scalar_add(&data->scalar[0], &data->scalar[0], &data->scalar[1]);
+    }
+    CHECK(j <= iters);
+}
+
+void bench_scalar_inverse_var(void* arg, int iters) {
+    int i, j = 0;
+    bench_inv *data = (bench_inv*)arg;
+
+    for (i = 0; i < iters; i++) {
+        secp256k1_scalar_inverse_var(&data->scalar[0], &data->scalar[0]);
+        j += secp256k1_scalar_add(&data->scalar[0], &data->scalar[0], &data->scalar[1]);
+    }
+    CHECK(j <= iters);
+}
+
+void bench_field_normalize(void* arg, int iters) {
+    int i;
+    bench_inv *data = (bench_inv*)arg;
+
+    for (i = 0; i < iters; i++) {
+        secp256k1_fe_normalize(&data->fe[0]);
+    }
+}
+
+void bench_field_normalize_weak(void* arg, int iters) {
+    int i;
+    bench_inv *data = (bench_inv*)arg;
+
+    for (i = 0; i < iters; i++) {
+        secp256k1_fe_normalize_weak(&data->fe[0]);
+    }
+}
+
+void bench_field_mul(void* arg, int iters) {
+    int i;
+    bench_inv *data = (bench_inv*)arg;
+
+    for (i = 0; i < iters; i++) {
+        secp256k1_fe_mul(&data->fe[0], &data->fe[0], &data->fe[1]);
+    }
+}
+
+void bench_field_sqr(void* arg, int iters) {
+    int i;
+    bench_inv *data = (bench_inv*)arg;
+
+    for (i = 0; i < iters; i++) {
+        secp256k1_fe_sqr(&data->fe[0], &data->fe[0]);
+    }
+}
+
+void bench_field_inverse(void* arg, int iters) {
+    int i;
+    bench_inv *data = (bench_inv*)arg;
+
+    for (i = 0; i < iters; i++) {
+        secp256k1_fe_inv(&data->fe[0], &data->fe[0]);
+        secp256k1_fe_add(&data->fe[0], &data->fe[1]);
+    }
+}
+
+void bench_field_inverse_var(void* arg, int iters) {
+    int i;
+    bench_inv *data = (bench_inv*)arg;
+
+    for (i = 0; i < iters; i++) {
+        secp256k1_fe_inv_var(&data->fe[0], &data->fe[0]);
+        secp256k1_fe_add(&data->fe[0], &data->fe[1]);
+    }
+}
+
+void bench_field_sqrt(void* arg, int iters) {
+    int i, j = 0;
+    bench_inv *data = (bench_inv*)arg;
+    secp256k1_fe t;
+
+    for (i = 0; i < iters; i++) {
+        t = data->fe[0];
+        j += secp256k1_fe_sqrt(&data->fe[0], &t);
+        secp256k1_fe_add(&data->fe[0], &data->fe[1]);
+    }
+    CHECK(j <= iters);
+}
+
+void bench_group_double_var(void* arg, int iters) {
+    int i;
+    bench_inv *data = (bench_inv*)arg;
+
+    for (i = 0; i < iters; i++) {
+        secp256k1_gej_double_var(&data->gej[0], &data->gej[0], NULL);
+    }
+}
+
+void bench_group_add_var(void* arg, int iters) {
+    int i;
+    bench_inv *data = (bench_inv*)arg;
+
+    for (i = 0; i < iters; i++) {
+        secp256k1_gej_add_var(&data->gej[0], &data->gej[0], &data->gej[1], NULL);
+    }
+}
+
+void bench_group_add_affine(void* arg, int iters) {
+    int i;
+    bench_inv *data = (bench_inv*)arg;
+
+    for (i = 0; i < iters; i++) {
+        secp256k1_gej_add_ge(&data->gej[0], &data->gej[0], &data->ge[1]);
+    }
+}
+
+void bench_group_add_affine_var(void* arg, int iters) {
+    int i;
+    bench_inv *data = (bench_inv*)arg;
+
+    for (i = 0; i < iters; i++) {
+        secp256k1_gej_add_ge_var(&data->gej[0], &data->gej[0], &data->ge[1], NULL);
+    }
+}
+
+void bench_group_jacobi_var(void* arg, int iters) {
+    int i, j = 0;
+    bench_inv *data = (bench_inv*)arg;
+
+    for (i = 0; i < iters; i++) {
+        j += secp256k1_gej_has_quad_y_var(&data->gej[0]);
+        /* Vary the Y and Z coordinates of the input (the X coordinate doesn't matter to
+           secp256k1_gej_has_quad_y_var). Note that the resulting coordinates will
+           generally not correspond to a point on the curve, but this is not a problem
+           for the code being benchmarked here. Adding and normalizing have less
+           overhead than EC operations (which could guarantee the point remains on the
+           curve). */
+        secp256k1_fe_add(&data->gej[0].y, &data->fe[1]);
+        secp256k1_fe_add(&data->gej[0].z, &data->fe[2]);
+        secp256k1_fe_normalize_var(&data->gej[0].y);
+        secp256k1_fe_normalize_var(&data->gej[0].z);
+    }
+    CHECK(j <= iters);
+}
+
+void bench_group_to_affine_var(void* arg, int iters) {
+    int i;
+    bench_inv *data = (bench_inv*)arg;
+
+    for (i = 0; i < iters; ++i) {
+        secp256k1_ge_set_gej_var(&data->ge[1], &data->gej[0]);
+        /* Use the output affine X/Y coordinates to vary the input X/Y/Z coordinates.
+           Similar to bench_group_jacobi_var, this approach does not result in
+           coordinates of points on the curve. */
+        secp256k1_fe_add(&data->gej[0].x, &data->ge[1].y);
+        secp256k1_fe_add(&data->gej[0].y, &data->fe[2]);
+        secp256k1_fe_add(&data->gej[0].z, &data->ge[1].x);
+        secp256k1_fe_normalize_var(&data->gej[0].x);
+        secp256k1_fe_normalize_var(&data->gej[0].y);
+        secp256k1_fe_normalize_var(&data->gej[0].z);
+    }
+}
+
+void bench_ecmult_wnaf(void* arg, int iters) {
+    int i, bits = 0, overflow = 0;
+    bench_inv *data = (bench_inv*)arg;
+
+    for (i = 0; i < iters; i++) {
+        bits += secp256k1_ecmult_wnaf(data->wnaf, 256, &data->scalar[0], WINDOW_A);
+        overflow += secp256k1_scalar_add(&data->scalar[0], &data->scalar[0], &data->scalar[1]);
+    }
+    CHECK(overflow >= 0);
+    CHECK(bits <= 256*iters);
+}
+
+void bench_wnaf_const(void* arg, int iters) {
+    int i, bits = 0, overflow = 0;
+    bench_inv *data = (bench_inv*)arg;
+
+    for (i = 0; i < iters; i++) {
+        bits += secp256k1_wnaf_const(data->wnaf, &data->scalar[0], WINDOW_A, 256);
+        overflow += secp256k1_scalar_add(&data->scalar[0], &data->scalar[0], &data->scalar[1]);
+    }
+    CHECK(overflow >= 0);
+    CHECK(bits <= 256*iters);
+}
+
+
+void bench_sha256(void* arg, int iters) {
+    int i;
+    bench_inv *data = (bench_inv*)arg;
+    secp256k1_sha256 sha;
+
+    for (i = 0; i < iters; i++) {
+        secp256k1_sha256_initialize(&sha);
+        secp256k1_sha256_write(&sha, data->data, 32);
+        secp256k1_sha256_finalize(&sha, data->data);
+    }
+}
+
+void bench_hmac_sha256(void* arg, int iters) {
+    int i;
+    bench_inv *data = (bench_inv*)arg;
+    secp256k1_hmac_sha256 hmac;
+
+    for (i = 0; i < iters; i++) {
+        secp256k1_hmac_sha256_initialize(&hmac, data->data, 32);
+        secp256k1_hmac_sha256_write(&hmac, data->data, 32);
+        secp256k1_hmac_sha256_finalize(&hmac, data->data);
+    }
+}
+
+void bench_rfc6979_hmac_sha256(void* arg, int iters) {
+    int i;
+    bench_inv *data = (bench_inv*)arg;
+    secp256k1_rfc6979_hmac_sha256 rng;
+
+    for (i = 0; i < iters; i++) {
+        secp256k1_rfc6979_hmac_sha256_initialize(&rng, data->data, 64);
+        secp256k1_rfc6979_hmac_sha256_generate(&rng, data->data, 32);
+    }
+}
+
+void bench_context_verify(void* arg, int iters) {
+    int i;
+    (void)arg;
+    for (i = 0; i < iters; i++) {
+        secp256k1_context_destroy(secp256k1_context_create(SECP256K1_CONTEXT_VERIFY));
+    }
+}
+
+void bench_context_sign(void* arg, int iters) {
+    int i;
+    (void)arg;
+    for (i = 0; i < iters; i++) {
+        secp256k1_context_destroy(secp256k1_context_create(SECP256K1_CONTEXT_SIGN));
+    }
+}
+
+#ifndef USE_NUM_NONE
+void bench_num_jacobi(void* arg, int iters) {
+    int i, j = 0;
+    bench_inv *data = (bench_inv*)arg;
+    secp256k1_num nx, na, norder;
+
+    secp256k1_scalar_get_num(&nx, &data->scalar[0]);
+    secp256k1_scalar_order_get_num(&norder);
+    secp256k1_scalar_get_num(&na, &data->scalar[1]);
+
+    for (i = 0; i < iters; i++) {
+        j += secp256k1_num_jacobi(&nx, &norder);
+        secp256k1_num_add(&nx, &nx, &na);
+    }
+    CHECK(j <= iters);
+}
+#endif
+
+int main(int argc, char **argv) {
+    bench_inv data;
+    int iters = get_iters(20000);
+
+    if (have_flag(argc, argv, "scalar") || have_flag(argc, argv, "add")) run_benchmark("scalar_add", bench_scalar_add, bench_setup, NULL, &data, 10, iters*100);
+    if (have_flag(argc, argv, "scalar") || have_flag(argc, argv, "negate")) run_benchmark("scalar_negate", bench_scalar_negate, bench_setup, NULL, &data, 10, iters*100);
+    if (have_flag(argc, argv, "scalar") || have_flag(argc, argv, "sqr")) run_benchmark("scalar_sqr", bench_scalar_sqr, bench_setup, NULL, &data, 10, iters*10);
+    if (have_flag(argc, argv, "scalar") || have_flag(argc, argv, "mul")) run_benchmark("scalar_mul", bench_scalar_mul, bench_setup, NULL, &data, 10, iters*10);
+    if (have_flag(argc, argv, "scalar") || have_flag(argc, argv, "split")) run_benchmark("scalar_split", bench_scalar_split, bench_setup, NULL, &data, 10, iters);
+    if (have_flag(argc, argv, "scalar") || have_flag(argc, argv, "inverse")) run_benchmark("scalar_inverse", bench_scalar_inverse, bench_setup, NULL, &data, 10, 2000);
+    if (have_flag(argc, argv, "scalar") || have_flag(argc, argv, "inverse")) run_benchmark("scalar_inverse_var", bench_scalar_inverse_var, bench_setup, NULL, &data, 10, 2000);
+
+    if (have_flag(argc, argv, "field") || have_flag(argc, argv, "normalize")) run_benchmark("field_normalize", bench_field_normalize, bench_setup, NULL, &data, 10, iters*100);
+    if (have_flag(argc, argv, "field") || have_flag(argc, argv, "normalize")) run_benchmark("field_normalize_weak", bench_field_normalize_weak, bench_setup, NULL, &data, 10, iters*100);
+    if (have_flag(argc, argv, "field") || have_flag(argc, argv, "sqr")) run_benchmark("field_sqr", bench_field_sqr, bench_setup, NULL, &data, 10, iters*10);
+    if (have_flag(argc, argv, "field") || have_flag(argc, argv, "mul")) run_benchmark("field_mul", bench_field_mul, bench_setup, NULL, &data, 10, iters*10);
+    if (have_flag(argc, argv, "field") || have_flag(argc, argv, "inverse")) run_benchmark("field_inverse", bench_field_inverse, bench_setup, NULL, &data, 10, iters);
+    if (have_flag(argc, argv, "field") || have_flag(argc, argv, "inverse")) run_benchmark("field_inverse_var", bench_field_inverse_var, bench_setup, NULL, &data, 10, iters);
+    if (have_flag(argc, argv, "field") || have_flag(argc, argv, "sqrt")) run_benchmark("field_sqrt", bench_field_sqrt, bench_setup, NULL, &data, 10, iters);
+
+    if (have_flag(argc, argv, "group") || have_flag(argc, argv, "double")) run_benchmark("group_double_var", bench_group_double_var, bench_setup, NULL, &data, 10, iters*10);
+    if (have_flag(argc, argv, "group") || have_flag(argc, argv, "add")) run_benchmark("group_add_var", bench_group_add_var, bench_setup, NULL, &data, 10, iters*10);
+    if (have_flag(argc, argv, "group") || have_flag(argc, argv, "add")) run_benchmark("group_add_affine", bench_group_add_affine, bench_setup, NULL, &data, 10, iters*10);
+    if (have_flag(argc, argv, "group") || have_flag(argc, argv, "add")) run_benchmark("group_add_affine_var", bench_group_add_affine_var, bench_setup, NULL, &data, 10, iters*10);
+    if (have_flag(argc, argv, "group") || have_flag(argc, argv, "jacobi")) run_benchmark("group_jacobi_var", bench_group_jacobi_var, bench_setup, NULL, &data, 10, iters);
+    if (have_flag(argc, argv, "group") || have_flag(argc, argv, "to_affine")) run_benchmark("group_to_affine_var", bench_group_to_affine_var, bench_setup, NULL, &data, 10, iters);
+
+    if (have_flag(argc, argv, "ecmult") || have_flag(argc, argv, "wnaf")) run_benchmark("wnaf_const", bench_wnaf_const, bench_setup, NULL, &data, 10, iters);
+    if (have_flag(argc, argv, "ecmult") || have_flag(argc, argv, "wnaf")) run_benchmark("ecmult_wnaf", bench_ecmult_wnaf, bench_setup, NULL, &data, 10, iters);
+
+    if (have_flag(argc, argv, "hash") || have_flag(argc, argv, "sha256")) run_benchmark("hash_sha256", bench_sha256, bench_setup, NULL, &data, 10, iters);
+    if (have_flag(argc, argv, "hash") || have_flag(argc, argv, "hmac")) run_benchmark("hash_hmac_sha256", bench_hmac_sha256, bench_setup, NULL, &data, 10, iters);
+    if (have_flag(argc, argv, "hash") || have_flag(argc, argv, "rng6979")) run_benchmark("hash_rfc6979_hmac_sha256", bench_rfc6979_hmac_sha256, bench_setup, NULL, &data, 10, iters);
+
+    if (have_flag(argc, argv, "context") || have_flag(argc, argv, "verify")) run_benchmark("context_verify", bench_context_verify, bench_setup, NULL, &data, 10, 1 + iters/1000);
+    if (have_flag(argc, argv, "context") || have_flag(argc, argv, "sign")) run_benchmark("context_sign", bench_context_sign, bench_setup, NULL, &data, 10, 1 + iters/100);
+
+#ifndef USE_NUM_NONE
+    if (have_flag(argc, argv, "num") || have_flag(argc, argv, "jacobi")) run_benchmark("num_jacobi", bench_num_jacobi, bench_setup, NULL, &data, 10, iters*10);
+#endif
+    return 0;
+}
diff --git a/depend/zcash/src/secp256k1/src/bench_recover.c b/depend/zcash/src/secp256k1/src/bench_recover.c
new file mode 100644
index 000000000..3f6270ce8
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/bench_recover.c
@@ -0,0 +1,62 @@
+/***********************************************************************
+ * Copyright (c) 2014-2015 Pieter Wuille                               *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#include "include/secp256k1.h"
+#include "include/secp256k1_recovery.h"
+#include "util.h"
+#include "bench.h"
+
+typedef struct {
+    secp256k1_context *ctx;
+    unsigned char msg[32];
+    unsigned char sig[64];
+} bench_recover_data;
+
+void bench_recover(void* arg, int iters) {
+    int i;
+    bench_recover_data *data = (bench_recover_data*)arg;
+    secp256k1_pubkey pubkey;
+    unsigned char pubkeyc[33];
+
+    for (i = 0; i < iters; i++) {
+        int j;
+        size_t pubkeylen = 33;
+        secp256k1_ecdsa_recoverable_signature sig;
+        CHECK(secp256k1_ecdsa_recoverable_signature_parse_compact(data->ctx, &sig, data->sig, i % 2));
+        CHECK(secp256k1_ecdsa_recover(data->ctx, &pubkey, &sig, data->msg));
+        CHECK(secp256k1_ec_pubkey_serialize(data->ctx, pubkeyc, &pubkeylen, &pubkey, SECP256K1_EC_COMPRESSED));
+        for (j = 0; j < 32; j++) {
+            data->sig[j + 32] = data->msg[j];    /* Move former message to S. */
+            data->msg[j] = data->sig[j];         /* Move former R to message. */
+            data->sig[j] = pubkeyc[j + 1];       /* Move recovered pubkey X coordinate to R (which must be a valid X coordinate). */
+        }
+    }
+}
+
+void bench_recover_setup(void* arg) {
+    int i;
+    bench_recover_data *data = (bench_recover_data*)arg;
+
+    for (i = 0; i < 32; i++) {
+        data->msg[i] = 1 + i;
+    }
+    for (i = 0; i < 64; i++) {
+        data->sig[i] = 65 + i;
+    }
+}
+
+int main(void) {
+    bench_recover_data data;
+
+    int iters = get_iters(20000);
+
+    data.ctx = secp256k1_context_create(SECP256K1_CONTEXT_VERIFY);
+
+    run_benchmark("ecdsa_recover", bench_recover, bench_recover_setup, NULL, &data, 10, iters);
+
+    secp256k1_context_destroy(data.ctx);
+    return 0;
+}
diff --git a/depend/zcash/src/secp256k1/src/bench_schnorrsig.c b/depend/zcash/src/secp256k1/src/bench_schnorrsig.c
new file mode 100644
index 000000000..f7f591c41
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/bench_schnorrsig.c
@@ -0,0 +1,102 @@
+/***********************************************************************
+ * Copyright (c) 2018-2020 Andrew Poelstra, Jonas Nick                 *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#include <string.h>
+#include <stdlib.h>
+
+
+#include "include/secp256k1.h"
+#include "include/secp256k1_schnorrsig.h"
+#include "util.h"
+#include "bench.h"
+
+typedef struct {
+    secp256k1_context *ctx;
+    int n;
+
+    const secp256k1_keypair **keypairs;
+    const unsigned char **pk;
+    const unsigned char **sigs;
+    const unsigned char **msgs;
+} bench_schnorrsig_data;
+
+void bench_schnorrsig_sign(void* arg, int iters) {
+    bench_schnorrsig_data *data = (bench_schnorrsig_data *)arg;
+    int i;
+    unsigned char msg[32] = "benchmarkexamplemessagetemplate";
+    unsigned char sig[64];
+
+    for (i = 0; i < iters; i++) {
+        msg[0] = i;
+        msg[1] = i >> 8;
+        CHECK(secp256k1_schnorrsig_sign(data->ctx, sig, msg, data->keypairs[i], NULL, NULL));
+    }
+}
+
+void bench_schnorrsig_verify(void* arg, int iters) {
+    bench_schnorrsig_data *data = (bench_schnorrsig_data *)arg;
+    int i;
+
+    for (i = 0; i < iters; i++) {
+        secp256k1_xonly_pubkey pk;
+        CHECK(secp256k1_xonly_pubkey_parse(data->ctx, &pk, data->pk[i]) == 1);
+        CHECK(secp256k1_schnorrsig_verify(data->ctx, data->sigs[i], data->msgs[i], &pk));
+    }
+}
+
+int main(void) {
+    int i;
+    bench_schnorrsig_data data;
+    int iters = get_iters(10000);
+
+    data.ctx = secp256k1_context_create(SECP256K1_CONTEXT_VERIFY | SECP256K1_CONTEXT_SIGN);
+    data.keypairs = (const secp256k1_keypair **)malloc(iters * sizeof(secp256k1_keypair *));
+    data.pk = (const unsigned char **)malloc(iters * sizeof(unsigned char *));
+    data.msgs = (const unsigned char **)malloc(iters * sizeof(unsigned char *));
+    data.sigs = (const unsigned char **)malloc(iters * sizeof(unsigned char *));
+
+    for (i = 0; i < iters; i++) {
+        unsigned char sk[32];
+        unsigned char *msg = (unsigned char *)malloc(32);
+        unsigned char *sig = (unsigned char *)malloc(64);
+        secp256k1_keypair *keypair = (secp256k1_keypair *)malloc(sizeof(*keypair));
+        unsigned char *pk_char = (unsigned char *)malloc(32);
+        secp256k1_xonly_pubkey pk;
+        msg[0] = sk[0] = i;
+        msg[1] = sk[1] = i >> 8;
+        msg[2] = sk[2] = i >> 16;
+        msg[3] = sk[3] = i >> 24;
+        memset(&msg[4], 'm', 28);
+        memset(&sk[4], 's', 28);
+
+        data.keypairs[i] = keypair;
+        data.pk[i] = pk_char;
+        data.msgs[i] = msg;
+        data.sigs[i] = sig;
+
+        CHECK(secp256k1_keypair_create(data.ctx, keypair, sk));
+        CHECK(secp256k1_schnorrsig_sign(data.ctx, sig, msg, keypair, NULL, NULL));
+        CHECK(secp256k1_keypair_xonly_pub(data.ctx, &pk, NULL, keypair));
+        CHECK(secp256k1_xonly_pubkey_serialize(data.ctx, pk_char, &pk) == 1);
+    }
+
+    run_benchmark("schnorrsig_sign", bench_schnorrsig_sign, NULL, NULL, (void *) &data, 10, iters);
+    run_benchmark("schnorrsig_verify", bench_schnorrsig_verify, NULL, NULL, (void *) &data, 10, iters);
+
+    for (i = 0; i < iters; i++) {
+        free((void *)data.keypairs[i]);
+        free((void *)data.pk[i]);
+        free((void *)data.msgs[i]);
+        free((void *)data.sigs[i]);
+    }
+    free(data.keypairs);
+    free(data.pk);
+    free(data.msgs);
+    free(data.sigs);
+
+    secp256k1_context_destroy(data.ctx);
+    return 0;
+}
diff --git a/depend/zcash/src/secp256k1/src/bench_sign.c b/depend/zcash/src/secp256k1/src/bench_sign.c
new file mode 100644
index 000000000..933f367c4
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/bench_sign.c
@@ -0,0 +1,58 @@
+/***********************************************************************
+ * Copyright (c) 2014 Pieter Wuille                                    *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#include "include/secp256k1.h"
+#include "util.h"
+#include "bench.h"
+
+typedef struct {
+    secp256k1_context* ctx;
+    unsigned char msg[32];
+    unsigned char key[32];
+} bench_sign_data;
+
+static void bench_sign_setup(void* arg) {
+    int i;
+    bench_sign_data *data = (bench_sign_data*)arg;
+
+    for (i = 0; i < 32; i++) {
+        data->msg[i] = i + 1;
+    }
+    for (i = 0; i < 32; i++) {
+        data->key[i] = i + 65;
+    }
+}
+
+static void bench_sign_run(void* arg, int iters) {
+    int i;
+    bench_sign_data *data = (bench_sign_data*)arg;
+
+    unsigned char sig[74];
+    for (i = 0; i < iters; i++) {
+        size_t siglen = 74;
+        int j;
+        secp256k1_ecdsa_signature signature;
+        CHECK(secp256k1_ecdsa_sign(data->ctx, &signature, data->msg, data->key, NULL, NULL));
+        CHECK(secp256k1_ecdsa_signature_serialize_der(data->ctx, sig, &siglen, &signature));
+        for (j = 0; j < 32; j++) {
+            data->msg[j] = sig[j];
+            data->key[j] = sig[j + 32];
+        }
+    }
+}
+
+int main(void) {
+    bench_sign_data data;
+
+    int iters = get_iters(20000);
+
+    data.ctx = secp256k1_context_create(SECP256K1_CONTEXT_SIGN);
+
+    run_benchmark("ecdsa_sign", bench_sign_run, bench_sign_setup, NULL, &data, 10, iters);
+
+    secp256k1_context_destroy(data.ctx);
+    return 0;
+}
diff --git a/depend/zcash/src/secp256k1/src/bench_verify.c b/depend/zcash/src/secp256k1/src/bench_verify.c
new file mode 100644
index 000000000..c56aefd36
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/bench_verify.c
@@ -0,0 +1,115 @@
+/***********************************************************************
+ * Copyright (c) 2014 Pieter Wuille                                    *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#include <stdio.h>
+#include <string.h>
+
+#include "include/secp256k1.h"
+#include "util.h"
+#include "bench.h"
+
+#ifdef ENABLE_OPENSSL_TESTS
+#include <openssl/bn.h>
+#include <openssl/ecdsa.h>
+#include <openssl/obj_mac.h>
+#endif
+
+
+typedef struct {
+    secp256k1_context *ctx;
+    unsigned char msg[32];
+    unsigned char key[32];
+    unsigned char sig[72];
+    size_t siglen;
+    unsigned char pubkey[33];
+    size_t pubkeylen;
+#ifdef ENABLE_OPENSSL_TESTS
+    EC_GROUP* ec_group;
+#endif
+} bench_verify_data;
+
+static void bench_verify(void* arg, int iters) {
+    int i;
+    bench_verify_data* data = (bench_verify_data*)arg;
+
+    for (i = 0; i < iters; i++) {
+        secp256k1_pubkey pubkey;
+        secp256k1_ecdsa_signature sig;
+        data->sig[data->siglen - 1] ^= (i & 0xFF);
+        data->sig[data->siglen - 2] ^= ((i >> 8) & 0xFF);
+        data->sig[data->siglen - 3] ^= ((i >> 16) & 0xFF);
+        CHECK(secp256k1_ec_pubkey_parse(data->ctx, &pubkey, data->pubkey, data->pubkeylen) == 1);
+        CHECK(secp256k1_ecdsa_signature_parse_der(data->ctx, &sig, data->sig, data->siglen) == 1);
+        CHECK(secp256k1_ecdsa_verify(data->ctx, &sig, data->msg, &pubkey) == (i == 0));
+        data->sig[data->siglen - 1] ^= (i & 0xFF);
+        data->sig[data->siglen - 2] ^= ((i >> 8) & 0xFF);
+        data->sig[data->siglen - 3] ^= ((i >> 16) & 0xFF);
+    }
+}
+
+#ifdef ENABLE_OPENSSL_TESTS
+static void bench_verify_openssl(void* arg, int iters) {
+    int i;
+    bench_verify_data* data = (bench_verify_data*)arg;
+
+    for (i = 0; i < iters; i++) {
+        data->sig[data->siglen - 1] ^= (i & 0xFF);
+        data->sig[data->siglen - 2] ^= ((i >> 8) & 0xFF);
+        data->sig[data->siglen - 3] ^= ((i >> 16) & 0xFF);
+        {
+            EC_KEY *pkey = EC_KEY_new();
+            const unsigned char *pubkey = &data->pubkey[0];
+            int result;
+
+            CHECK(pkey != NULL);
+            result = EC_KEY_set_group(pkey, data->ec_group);
+            CHECK(result);
+            result = (o2i_ECPublicKey(&pkey, &pubkey, data->pubkeylen)) != NULL;
+            CHECK(result);
+            result = ECDSA_verify(0, &data->msg[0], sizeof(data->msg), &data->sig[0], data->siglen, pkey) == (i == 0);
+            CHECK(result);
+            EC_KEY_free(pkey);
+        }
+        data->sig[data->siglen - 1] ^= (i & 0xFF);
+        data->sig[data->siglen - 2] ^= ((i >> 8) & 0xFF);
+        data->sig[data->siglen - 3] ^= ((i >> 16) & 0xFF);
+    }
+}
+#endif
+
+int main(void) {
+    int i;
+    secp256k1_pubkey pubkey;
+    secp256k1_ecdsa_signature sig;
+    bench_verify_data data;
+
+    int iters = get_iters(20000);
+
+    data.ctx = secp256k1_context_create(SECP256K1_CONTEXT_SIGN | SECP256K1_CONTEXT_VERIFY);
+
+    for (i = 0; i < 32; i++) {
+        data.msg[i] = 1 + i;
+    }
+    for (i = 0; i < 32; i++) {
+        data.key[i] = 33 + i;
+    }
+    data.siglen = 72;
+    CHECK(secp256k1_ecdsa_sign(data.ctx, &sig, data.msg, data.key, NULL, NULL));
+    CHECK(secp256k1_ecdsa_signature_serialize_der(data.ctx, data.sig, &data.siglen, &sig));
+    CHECK(secp256k1_ec_pubkey_create(data.ctx, &pubkey, data.key));
+    data.pubkeylen = 33;
+    CHECK(secp256k1_ec_pubkey_serialize(data.ctx, data.pubkey, &data.pubkeylen, &pubkey, SECP256K1_EC_COMPRESSED) == 1);
+
+    run_benchmark("ecdsa_verify", bench_verify, NULL, NULL, &data, 10, iters);
+#ifdef ENABLE_OPENSSL_TESTS
+    data.ec_group = EC_GROUP_new_by_curve_name(NID_secp256k1);
+    run_benchmark("ecdsa_verify_openssl", bench_verify_openssl, NULL, NULL, &data, 10, iters);
+    EC_GROUP_free(data.ec_group);
+#endif
+
+    secp256k1_context_destroy(data.ctx);
+    return 0;
+}
diff --git a/depend/zcash/src/secp256k1/src/ecdsa.h b/depend/zcash/src/secp256k1/src/ecdsa.h
new file mode 100644
index 000000000..d5e54d8ce
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/ecdsa.h
@@ -0,0 +1,21 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_ECDSA_H
+#define SECP256K1_ECDSA_H
+
+#include <stddef.h>
+
+#include "scalar.h"
+#include "group.h"
+#include "ecmult.h"
+
+static int secp256k1_ecdsa_sig_parse(secp256k1_scalar *r, secp256k1_scalar *s, const unsigned char *sig, size_t size);
+static int secp256k1_ecdsa_sig_serialize(unsigned char *sig, size_t *size, const secp256k1_scalar *r, const secp256k1_scalar *s);
+static int secp256k1_ecdsa_sig_verify(const secp256k1_ecmult_context *ctx, const secp256k1_scalar* r, const secp256k1_scalar* s, const secp256k1_ge *pubkey, const secp256k1_scalar *message);
+static int secp256k1_ecdsa_sig_sign(const secp256k1_ecmult_gen_context *ctx, secp256k1_scalar* r, secp256k1_scalar* s, const secp256k1_scalar *seckey, const secp256k1_scalar *message, const secp256k1_scalar *nonce, int *recid);
+
+#endif /* SECP256K1_ECDSA_H */
diff --git a/depend/zcash/src/secp256k1/src/ecdsa_impl.h b/depend/zcash/src/secp256k1/src/ecdsa_impl.h
new file mode 100644
index 000000000..156a33d11
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/ecdsa_impl.h
@@ -0,0 +1,315 @@
+/***********************************************************************
+ * Copyright (c) 2013-2015 Pieter Wuille                               *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+
+#ifndef SECP256K1_ECDSA_IMPL_H
+#define SECP256K1_ECDSA_IMPL_H
+
+#include "scalar.h"
+#include "field.h"
+#include "group.h"
+#include "ecmult.h"
+#include "ecmult_gen.h"
+#include "ecdsa.h"
+
+/** Group order for secp256k1 defined as 'n' in "Standards for Efficient Cryptography" (SEC2) 2.7.1
+ *  sage: for t in xrange(1023, -1, -1):
+ *     ..   p = 2**256 - 2**32 - t
+ *     ..   if p.is_prime():
+ *     ..     print '%x'%p
+ *     ..     break
+ *   'fffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f'
+ *  sage: a = 0
+ *  sage: b = 7
+ *  sage: F = FiniteField (p)
+ *  sage: '%x' % (EllipticCurve ([F (a), F (b)]).order())
+ *   'fffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141'
+ */
+static const secp256k1_fe secp256k1_ecdsa_const_order_as_fe = SECP256K1_FE_CONST(
+    0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFEUL,
+    0xBAAEDCE6UL, 0xAF48A03BUL, 0xBFD25E8CUL, 0xD0364141UL
+);
+
+/** Difference between field and order, values 'p' and 'n' values defined in
+ *  "Standards for Efficient Cryptography" (SEC2) 2.7.1.
+ *  sage: p = 0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F
+ *  sage: a = 0
+ *  sage: b = 7
+ *  sage: F = FiniteField (p)
+ *  sage: '%x' % (p - EllipticCurve ([F (a), F (b)]).order())
+ *   '14551231950b75fc4402da1722fc9baee'
+ */
+static const secp256k1_fe secp256k1_ecdsa_const_p_minus_order = SECP256K1_FE_CONST(
+    0, 0, 0, 1, 0x45512319UL, 0x50B75FC4UL, 0x402DA172UL, 0x2FC9BAEEUL
+);
+
+static int secp256k1_der_read_len(size_t *len, const unsigned char **sigp, const unsigned char *sigend) {
+    size_t lenleft;
+    unsigned char b1;
+    VERIFY_CHECK(len != NULL);
+    *len = 0;
+    if (*sigp >= sigend) {
+        return 0;
+    }
+    b1 = *((*sigp)++);
+    if (b1 == 0xFF) {
+        /* X.690-0207 8.1.3.5.c the value 0xFF shall not be used. */
+        return 0;
+    }
+    if ((b1 & 0x80) == 0) {
+        /* X.690-0207 8.1.3.4 short form length octets */
+        *len = b1;
+        return 1;
+    }
+    if (b1 == 0x80) {
+        /* Indefinite length is not allowed in DER. */
+        return 0;
+    }
+    /* X.690-207 8.1.3.5 long form length octets */
+    lenleft = b1 & 0x7F; /* lenleft is at least 1 */
+    if (lenleft > (size_t)(sigend - *sigp)) {
+        return 0;
+    }
+    if (**sigp == 0) {
+        /* Not the shortest possible length encoding. */
+        return 0;
+    }
+    if (lenleft > sizeof(size_t)) {
+        /* The resulting length would exceed the range of a size_t, so
+         * certainly longer than the passed array size.
+         */
+        return 0;
+    }
+    while (lenleft > 0) {
+        *len = (*len << 8) | **sigp;
+        (*sigp)++;
+        lenleft--;
+    }
+    if (*len > (size_t)(sigend - *sigp)) {
+        /* Result exceeds the length of the passed array. */
+        return 0;
+    }
+    if (*len < 128) {
+        /* Not the shortest possible length encoding. */
+        return 0;
+    }
+    return 1;
+}
+
+static int secp256k1_der_parse_integer(secp256k1_scalar *r, const unsigned char **sig, const unsigned char *sigend) {
+    int overflow = 0;
+    unsigned char ra[32] = {0};
+    size_t rlen;
+
+    if (*sig == sigend || **sig != 0x02) {
+        /* Not a primitive integer (X.690-0207 8.3.1). */
+        return 0;
+    }
+    (*sig)++;
+    if (secp256k1_der_read_len(&rlen, sig, sigend) == 0) {
+        return 0;
+    }
+    if (rlen == 0 || *sig + rlen > sigend) {
+        /* Exceeds bounds or not at least length 1 (X.690-0207 8.3.1).  */
+        return 0;
+    }
+    if (**sig == 0x00 && rlen > 1 && (((*sig)[1]) & 0x80) == 0x00) {
+        /* Excessive 0x00 padding. */
+        return 0;
+    }
+    if (**sig == 0xFF && rlen > 1 && (((*sig)[1]) & 0x80) == 0x80) {
+        /* Excessive 0xFF padding. */
+        return 0;
+    }
+    if ((**sig & 0x80) == 0x80) {
+        /* Negative. */
+        overflow = 1;
+    }
+    /* There is at most one leading zero byte:
+     * if there were two leading zero bytes, we would have failed and returned 0
+     * because of excessive 0x00 padding already. */
+    if (rlen > 0 && **sig == 0) {
+        /* Skip leading zero byte */
+        rlen--;
+        (*sig)++;
+    }
+    if (rlen > 32) {
+        overflow = 1;
+    }
+    if (!overflow) {
+        memcpy(ra + 32 - rlen, *sig, rlen);
+        secp256k1_scalar_set_b32(r, ra, &overflow);
+    }
+    if (overflow) {
+        secp256k1_scalar_set_int(r, 0);
+    }
+    (*sig) += rlen;
+    return 1;
+}
+
+static int secp256k1_ecdsa_sig_parse(secp256k1_scalar *rr, secp256k1_scalar *rs, const unsigned char *sig, size_t size) {
+    const unsigned char *sigend = sig + size;
+    size_t rlen;
+    if (sig == sigend || *(sig++) != 0x30) {
+        /* The encoding doesn't start with a constructed sequence (X.690-0207 8.9.1). */
+        return 0;
+    }
+    if (secp256k1_der_read_len(&rlen, &sig, sigend) == 0) {
+        return 0;
+    }
+    if (rlen != (size_t)(sigend - sig)) {
+        /* Tuple exceeds bounds or garage after tuple. */
+        return 0;
+    }
+
+    if (!secp256k1_der_parse_integer(rr, &sig, sigend)) {
+        return 0;
+    }
+    if (!secp256k1_der_parse_integer(rs, &sig, sigend)) {
+        return 0;
+    }
+
+    if (sig != sigend) {
+        /* Trailing garbage inside tuple. */
+        return 0;
+    }
+
+    return 1;
+}
+
+static int secp256k1_ecdsa_sig_serialize(unsigned char *sig, size_t *size, const secp256k1_scalar* ar, const secp256k1_scalar* as) {
+    unsigned char r[33] = {0}, s[33] = {0};
+    unsigned char *rp = r, *sp = s;
+    size_t lenR = 33, lenS = 33;
+    secp256k1_scalar_get_b32(&r[1], ar);
+    secp256k1_scalar_get_b32(&s[1], as);
+    while (lenR > 1 && rp[0] == 0 && rp[1] < 0x80) { lenR--; rp++; }
+    while (lenS > 1 && sp[0] == 0 && sp[1] < 0x80) { lenS--; sp++; }
+    if (*size < 6+lenS+lenR) {
+        *size = 6 + lenS + lenR;
+        return 0;
+    }
+    *size = 6 + lenS + lenR;
+    sig[0] = 0x30;
+    sig[1] = 4 + lenS + lenR;
+    sig[2] = 0x02;
+    sig[3] = lenR;
+    memcpy(sig+4, rp, lenR);
+    sig[4+lenR] = 0x02;
+    sig[5+lenR] = lenS;
+    memcpy(sig+lenR+6, sp, lenS);
+    return 1;
+}
+
+static int secp256k1_ecdsa_sig_verify(const secp256k1_ecmult_context *ctx, const secp256k1_scalar *sigr, const secp256k1_scalar *sigs, const secp256k1_ge *pubkey, const secp256k1_scalar *message) {
+    unsigned char c[32];
+    secp256k1_scalar sn, u1, u2;
+#if !defined(EXHAUSTIVE_TEST_ORDER)
+    secp256k1_fe xr;
+#endif
+    secp256k1_gej pubkeyj;
+    secp256k1_gej pr;
+
+    if (secp256k1_scalar_is_zero(sigr) || secp256k1_scalar_is_zero(sigs)) {
+        return 0;
+    }
+
+    secp256k1_scalar_inverse_var(&sn, sigs);
+    secp256k1_scalar_mul(&u1, &sn, message);
+    secp256k1_scalar_mul(&u2, &sn, sigr);
+    secp256k1_gej_set_ge(&pubkeyj, pubkey);
+    secp256k1_ecmult(ctx, &pr, &pubkeyj, &u2, &u1);
+    if (secp256k1_gej_is_infinity(&pr)) {
+        return 0;
+    }
+
+#if defined(EXHAUSTIVE_TEST_ORDER)
+{
+    secp256k1_scalar computed_r;
+    secp256k1_ge pr_ge;
+    secp256k1_ge_set_gej(&pr_ge, &pr);
+    secp256k1_fe_normalize(&pr_ge.x);
+
+    secp256k1_fe_get_b32(c, &pr_ge.x);
+    secp256k1_scalar_set_b32(&computed_r, c, NULL);
+    return secp256k1_scalar_eq(sigr, &computed_r);
+}
+#else
+    secp256k1_scalar_get_b32(c, sigr);
+    secp256k1_fe_set_b32(&xr, c);
+
+    /** We now have the recomputed R point in pr, and its claimed x coordinate (modulo n)
+     *  in xr. Naively, we would extract the x coordinate from pr (requiring a inversion modulo p),
+     *  compute the remainder modulo n, and compare it to xr. However:
+     *
+     *        xr == X(pr) mod n
+     *    <=> exists h. (xr + h * n < p && xr + h * n == X(pr))
+     *    [Since 2 * n > p, h can only be 0 or 1]
+     *    <=> (xr == X(pr)) || (xr + n < p && xr + n == X(pr))
+     *    [In Jacobian coordinates, X(pr) is pr.x / pr.z^2 mod p]
+     *    <=> (xr == pr.x / pr.z^2 mod p) || (xr + n < p && xr + n == pr.x / pr.z^2 mod p)
+     *    [Multiplying both sides of the equations by pr.z^2 mod p]
+     *    <=> (xr * pr.z^2 mod p == pr.x) || (xr + n < p && (xr + n) * pr.z^2 mod p == pr.x)
+     *
+     *  Thus, we can avoid the inversion, but we have to check both cases separately.
+     *  secp256k1_gej_eq_x implements the (xr * pr.z^2 mod p == pr.x) test.
+     */
+    if (secp256k1_gej_eq_x_var(&xr, &pr)) {
+        /* xr * pr.z^2 mod p == pr.x, so the signature is valid. */
+        return 1;
+    }
+    if (secp256k1_fe_cmp_var(&xr, &secp256k1_ecdsa_const_p_minus_order) >= 0) {
+        /* xr + n >= p, so we can skip testing the second case. */
+        return 0;
+    }
+    secp256k1_fe_add(&xr, &secp256k1_ecdsa_const_order_as_fe);
+    if (secp256k1_gej_eq_x_var(&xr, &pr)) {
+        /* (xr + n) * pr.z^2 mod p == pr.x, so the signature is valid. */
+        return 1;
+    }
+    return 0;
+#endif
+}
+
+static int secp256k1_ecdsa_sig_sign(const secp256k1_ecmult_gen_context *ctx, secp256k1_scalar *sigr, secp256k1_scalar *sigs, const secp256k1_scalar *seckey, const secp256k1_scalar *message, const secp256k1_scalar *nonce, int *recid) {
+    unsigned char b[32];
+    secp256k1_gej rp;
+    secp256k1_ge r;
+    secp256k1_scalar n;
+    int overflow = 0;
+    int high;
+
+    secp256k1_ecmult_gen(ctx, &rp, nonce);
+    secp256k1_ge_set_gej(&r, &rp);
+    secp256k1_fe_normalize(&r.x);
+    secp256k1_fe_normalize(&r.y);
+    secp256k1_fe_get_b32(b, &r.x);
+    secp256k1_scalar_set_b32(sigr, b, &overflow);
+    if (recid) {
+        /* The overflow condition is cryptographically unreachable as hitting it requires finding the discrete log
+         * of some P where P.x >= order, and only 1 in about 2^127 points meet this criteria.
+         */
+        *recid = (overflow << 1) | secp256k1_fe_is_odd(&r.y);
+    }
+    secp256k1_scalar_mul(&n, sigr, seckey);
+    secp256k1_scalar_add(&n, &n, message);
+    secp256k1_scalar_inverse(sigs, nonce);
+    secp256k1_scalar_mul(sigs, sigs, &n);
+    secp256k1_scalar_clear(&n);
+    secp256k1_gej_clear(&rp);
+    secp256k1_ge_clear(&r);
+    high = secp256k1_scalar_is_high(sigs);
+    secp256k1_scalar_cond_negate(sigs, high);
+    if (recid) {
+            *recid ^= high;
+    }
+    /* P.x = order is on the curve, so technically sig->r could end up being zero, which would be an invalid signature.
+     * This is cryptographically unreachable as hitting it requires finding the discrete log of P.x = N.
+     */
+    return !secp256k1_scalar_is_zero(sigr) & !secp256k1_scalar_is_zero(sigs);
+}
+
+#endif /* SECP256K1_ECDSA_IMPL_H */
diff --git a/depend/zcash/src/secp256k1/src/eckey.h b/depend/zcash/src/secp256k1/src/eckey.h
new file mode 100644
index 000000000..5be3a64b8
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/eckey.h
@@ -0,0 +1,25 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_ECKEY_H
+#define SECP256K1_ECKEY_H
+
+#include <stddef.h>
+
+#include "group.h"
+#include "scalar.h"
+#include "ecmult.h"
+#include "ecmult_gen.h"
+
+static int secp256k1_eckey_pubkey_parse(secp256k1_ge *elem, const unsigned char *pub, size_t size);
+static int secp256k1_eckey_pubkey_serialize(secp256k1_ge *elem, unsigned char *pub, size_t *size, int compressed);
+
+static int secp256k1_eckey_privkey_tweak_add(secp256k1_scalar *key, const secp256k1_scalar *tweak);
+static int secp256k1_eckey_pubkey_tweak_add(const secp256k1_ecmult_context *ctx, secp256k1_ge *key, const secp256k1_scalar *tweak);
+static int secp256k1_eckey_privkey_tweak_mul(secp256k1_scalar *key, const secp256k1_scalar *tweak);
+static int secp256k1_eckey_pubkey_tweak_mul(const secp256k1_ecmult_context *ctx, secp256k1_ge *key, const secp256k1_scalar *tweak);
+
+#endif /* SECP256K1_ECKEY_H */
diff --git a/depend/zcash/src/secp256k1/src/eckey_impl.h b/depend/zcash/src/secp256k1/src/eckey_impl.h
new file mode 100644
index 000000000..a39cb7965
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/eckey_impl.h
@@ -0,0 +1,96 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_ECKEY_IMPL_H
+#define SECP256K1_ECKEY_IMPL_H
+
+#include "eckey.h"
+
+#include "scalar.h"
+#include "field.h"
+#include "group.h"
+#include "ecmult_gen.h"
+
+static int secp256k1_eckey_pubkey_parse(secp256k1_ge *elem, const unsigned char *pub, size_t size) {
+    if (size == 33 && (pub[0] == SECP256K1_TAG_PUBKEY_EVEN || pub[0] == SECP256K1_TAG_PUBKEY_ODD)) {
+        secp256k1_fe x;
+        return secp256k1_fe_set_b32(&x, pub+1) && secp256k1_ge_set_xo_var(elem, &x, pub[0] == SECP256K1_TAG_PUBKEY_ODD);
+    } else if (size == 65 && (pub[0] == SECP256K1_TAG_PUBKEY_UNCOMPRESSED || pub[0] == SECP256K1_TAG_PUBKEY_HYBRID_EVEN || pub[0] == SECP256K1_TAG_PUBKEY_HYBRID_ODD)) {
+        secp256k1_fe x, y;
+        if (!secp256k1_fe_set_b32(&x, pub+1) || !secp256k1_fe_set_b32(&y, pub+33)) {
+            return 0;
+        }
+        secp256k1_ge_set_xy(elem, &x, &y);
+        if ((pub[0] == SECP256K1_TAG_PUBKEY_HYBRID_EVEN || pub[0] == SECP256K1_TAG_PUBKEY_HYBRID_ODD) &&
+            secp256k1_fe_is_odd(&y) != (pub[0] == SECP256K1_TAG_PUBKEY_HYBRID_ODD)) {
+            return 0;
+        }
+        return secp256k1_ge_is_valid_var(elem);
+    } else {
+        return 0;
+    }
+}
+
+static int secp256k1_eckey_pubkey_serialize(secp256k1_ge *elem, unsigned char *pub, size_t *size, int compressed) {
+    if (secp256k1_ge_is_infinity(elem)) {
+        return 0;
+    }
+    secp256k1_fe_normalize_var(&elem->x);
+    secp256k1_fe_normalize_var(&elem->y);
+    secp256k1_fe_get_b32(&pub[1], &elem->x);
+    if (compressed) {
+        *size = 33;
+        pub[0] = secp256k1_fe_is_odd(&elem->y) ? SECP256K1_TAG_PUBKEY_ODD : SECP256K1_TAG_PUBKEY_EVEN;
+    } else {
+        *size = 65;
+        pub[0] = SECP256K1_TAG_PUBKEY_UNCOMPRESSED;
+        secp256k1_fe_get_b32(&pub[33], &elem->y);
+    }
+    return 1;
+}
+
+static int secp256k1_eckey_privkey_tweak_add(secp256k1_scalar *key, const secp256k1_scalar *tweak) {
+    secp256k1_scalar_add(key, key, tweak);
+    return !secp256k1_scalar_is_zero(key);
+}
+
+static int secp256k1_eckey_pubkey_tweak_add(const secp256k1_ecmult_context *ctx, secp256k1_ge *key, const secp256k1_scalar *tweak) {
+    secp256k1_gej pt;
+    secp256k1_scalar one;
+    secp256k1_gej_set_ge(&pt, key);
+    secp256k1_scalar_set_int(&one, 1);
+    secp256k1_ecmult(ctx, &pt, &pt, &one, tweak);
+
+    if (secp256k1_gej_is_infinity(&pt)) {
+        return 0;
+    }
+    secp256k1_ge_set_gej(key, &pt);
+    return 1;
+}
+
+static int secp256k1_eckey_privkey_tweak_mul(secp256k1_scalar *key, const secp256k1_scalar *tweak) {
+    int ret;
+    ret = !secp256k1_scalar_is_zero(tweak);
+
+    secp256k1_scalar_mul(key, key, tweak);
+    return ret;
+}
+
+static int secp256k1_eckey_pubkey_tweak_mul(const secp256k1_ecmult_context *ctx, secp256k1_ge *key, const secp256k1_scalar *tweak) {
+    secp256k1_scalar zero;
+    secp256k1_gej pt;
+    if (secp256k1_scalar_is_zero(tweak)) {
+        return 0;
+    }
+
+    secp256k1_scalar_set_int(&zero, 0);
+    secp256k1_gej_set_ge(&pt, key);
+    secp256k1_ecmult(ctx, &pt, &pt, tweak, &zero);
+    secp256k1_ge_set_gej(key, &pt);
+    return 1;
+}
+
+#endif /* SECP256K1_ECKEY_IMPL_H */
diff --git a/depend/zcash/src/secp256k1/src/ecmult.h b/depend/zcash/src/secp256k1/src/ecmult.h
new file mode 100644
index 000000000..7aa394a11
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/ecmult.h
@@ -0,0 +1,46 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014, 2017 Pieter Wuille, Andrew Poelstra       *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_ECMULT_H
+#define SECP256K1_ECMULT_H
+
+#include "num.h"
+#include "group.h"
+#include "scalar.h"
+#include "scratch.h"
+
+typedef struct {
+    /* For accelerating the computation of a*P + b*G: */
+    secp256k1_ge_storage (*pre_g)[];    /* odd multiples of the generator */
+    secp256k1_ge_storage (*pre_g_128)[]; /* odd multiples of 2^128*generator */
+} secp256k1_ecmult_context;
+
+static const size_t SECP256K1_ECMULT_CONTEXT_PREALLOCATED_SIZE;
+static void secp256k1_ecmult_context_init(secp256k1_ecmult_context *ctx);
+static void secp256k1_ecmult_context_build(secp256k1_ecmult_context *ctx, void **prealloc);
+static void secp256k1_ecmult_context_finalize_memcpy(secp256k1_ecmult_context *dst, const secp256k1_ecmult_context *src);
+static void secp256k1_ecmult_context_clear(secp256k1_ecmult_context *ctx);
+static int secp256k1_ecmult_context_is_built(const secp256k1_ecmult_context *ctx);
+
+/** Double multiply: R = na*A + ng*G */
+static void secp256k1_ecmult(const secp256k1_ecmult_context *ctx, secp256k1_gej *r, const secp256k1_gej *a, const secp256k1_scalar *na, const secp256k1_scalar *ng);
+
+typedef int (secp256k1_ecmult_multi_callback)(secp256k1_scalar *sc, secp256k1_ge *pt, size_t idx, void *data);
+
+/**
+ * Multi-multiply: R = inp_g_sc * G + sum_i ni * Ai.
+ * Chooses the right algorithm for a given number of points and scratch space
+ * size. Resets and overwrites the given scratch space. If the points do not
+ * fit in the scratch space the algorithm is repeatedly run with batches of
+ * points. If no scratch space is given then a simple algorithm is used that
+ * simply multiplies the points with the corresponding scalars and adds them up.
+ * Returns: 1 on success (including when inp_g_sc is NULL and n is 0)
+ *          0 if there is not enough scratch space for a single point or
+ *          callback returns 0
+ */
+static int secp256k1_ecmult_multi_var(const secp256k1_callback* error_callback, const secp256k1_ecmult_context *ctx, secp256k1_scratch *scratch, secp256k1_gej *r, const secp256k1_scalar *inp_g_sc, secp256k1_ecmult_multi_callback cb, void *cbdata, size_t n);
+
+#endif /* SECP256K1_ECMULT_H */
diff --git a/depend/zcash/src/secp256k1/src/ecmult_const.h b/depend/zcash/src/secp256k1/src/ecmult_const.h
new file mode 100644
index 000000000..d6f0ea222
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/ecmult_const.h
@@ -0,0 +1,20 @@
+/***********************************************************************
+ * Copyright (c) 2015 Andrew Poelstra                                  *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_ECMULT_CONST_H
+#define SECP256K1_ECMULT_CONST_H
+
+#include "scalar.h"
+#include "group.h"
+
+/**
+ * Multiply: R = q*A (in constant-time)
+ * Here `bits` should be set to the maximum bitlength of the _absolute value_ of `q`, plus
+ * one because we internally sometimes add 2 to the number during the WNAF conversion.
+ */
+static void secp256k1_ecmult_const(secp256k1_gej *r, const secp256k1_ge *a, const secp256k1_scalar *q, int bits);
+
+#endif /* SECP256K1_ECMULT_CONST_H */
diff --git a/depend/zcash/src/secp256k1/src/ecmult_const_impl.h b/depend/zcash/src/secp256k1/src/ecmult_const_impl.h
new file mode 100644
index 000000000..0e1fb965c
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/ecmult_const_impl.h
@@ -0,0 +1,254 @@
+/***********************************************************************
+ * Copyright (c) 2015 Pieter Wuille, Andrew Poelstra                   *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_ECMULT_CONST_IMPL_H
+#define SECP256K1_ECMULT_CONST_IMPL_H
+
+#include "scalar.h"
+#include "group.h"
+#include "ecmult_const.h"
+#include "ecmult_impl.h"
+
+/* This is like `ECMULT_TABLE_GET_GE` but is constant time */
+#define ECMULT_CONST_TABLE_GET_GE(r,pre,n,w) do { \
+    int m = 0; \
+    /* Extract the sign-bit for a constant time absolute-value. */ \
+    int mask = (n) >> (sizeof(n) * CHAR_BIT - 1); \
+    int abs_n = ((n) + mask) ^ mask; \
+    int idx_n = abs_n >> 1; \
+    secp256k1_fe neg_y; \
+    VERIFY_CHECK(((n) & 1) == 1); \
+    VERIFY_CHECK((n) >= -((1 << ((w)-1)) - 1)); \
+    VERIFY_CHECK((n) <=  ((1 << ((w)-1)) - 1)); \
+    VERIFY_SETUP(secp256k1_fe_clear(&(r)->x)); \
+    VERIFY_SETUP(secp256k1_fe_clear(&(r)->y)); \
+    /* Unconditionally set r->x = (pre)[m].x. r->y = (pre)[m].y. because it's either the correct one \
+     * or will get replaced in the later iterations, this is needed to make sure `r` is initialized. */ \
+    (r)->x = (pre)[m].x; \
+    (r)->y = (pre)[m].y; \
+    for (m = 1; m < ECMULT_TABLE_SIZE(w); m++) { \
+        /* This loop is used to avoid secret data in array indices. See
+         * the comment in ecmult_gen_impl.h for rationale. */ \
+        secp256k1_fe_cmov(&(r)->x, &(pre)[m].x, m == idx_n); \
+        secp256k1_fe_cmov(&(r)->y, &(pre)[m].y, m == idx_n); \
+    } \
+    (r)->infinity = 0; \
+    secp256k1_fe_negate(&neg_y, &(r)->y, 1); \
+    secp256k1_fe_cmov(&(r)->y, &neg_y, (n) != abs_n); \
+} while(0)
+
+
+/** Convert a number to WNAF notation.
+ *  The number becomes represented by sum(2^{wi} * wnaf[i], i=0..WNAF_SIZE(w)+1) - return_val.
+ *  It has the following guarantees:
+ *  - each wnaf[i] an odd integer between -(1 << w) and (1 << w)
+ *  - each wnaf[i] is nonzero
+ *  - the number of words set is always WNAF_SIZE(w) + 1
+ *
+ *  Adapted from `The Width-w NAF Method Provides Small Memory and Fast Elliptic Scalar
+ *  Multiplications Secure against Side Channel Attacks`, Okeya and Tagaki. M. Joye (Ed.)
+ *  CT-RSA 2003, LNCS 2612, pp. 328-443, 2003. Springer-Verlag Berlin Heidelberg 2003
+ *
+ *  Numbers reference steps of `Algorithm SPA-resistant Width-w NAF with Odd Scalar` on pp. 335
+ */
+static int secp256k1_wnaf_const(int *wnaf, const secp256k1_scalar *scalar, int w, int size) {
+    int global_sign;
+    int skew = 0;
+    int word = 0;
+
+    /* 1 2 3 */
+    int u_last;
+    int u;
+
+    int flip;
+    int bit;
+    secp256k1_scalar s;
+    int not_neg_one;
+
+    VERIFY_CHECK(w > 0);
+    VERIFY_CHECK(size > 0);
+
+    /* Note that we cannot handle even numbers by negating them to be odd, as is
+     * done in other implementations, since if our scalars were specified to have
+     * width < 256 for performance reasons, their negations would have width 256
+     * and we'd lose any performance benefit. Instead, we use a technique from
+     * Section 4.2 of the Okeya/Tagaki paper, which is to add either 1 (for even)
+     * or 2 (for odd) to the number we are encoding, returning a skew value indicating
+     * this, and having the caller compensate after doing the multiplication.
+     *
+     * In fact, we _do_ want to negate numbers to minimize their bit-lengths (and in
+     * particular, to ensure that the outputs from the endomorphism-split fit into
+     * 128 bits). If we negate, the parity of our number flips, inverting which of
+     * {1, 2} we want to add to the scalar when ensuring that it's odd. Further
+     * complicating things, -1 interacts badly with `secp256k1_scalar_cadd_bit` and
+     * we need to special-case it in this logic. */
+    flip = secp256k1_scalar_is_high(scalar);
+    /* We add 1 to even numbers, 2 to odd ones, noting that negation flips parity */
+    bit = flip ^ !secp256k1_scalar_is_even(scalar);
+    /* We check for negative one, since adding 2 to it will cause an overflow */
+    secp256k1_scalar_negate(&s, scalar);
+    not_neg_one = !secp256k1_scalar_is_one(&s);
+    s = *scalar;
+    secp256k1_scalar_cadd_bit(&s, bit, not_neg_one);
+    /* If we had negative one, flip == 1, s.d[0] == 0, bit == 1, so caller expects
+     * that we added two to it and flipped it. In fact for -1 these operations are
+     * identical. We only flipped, but since skewing is required (in the sense that
+     * the skew must be 1 or 2, never zero) and flipping is not, we need to change
+     * our flags to claim that we only skewed. */
+    global_sign = secp256k1_scalar_cond_negate(&s, flip);
+    global_sign *= not_neg_one * 2 - 1;
+    skew = 1 << bit;
+
+    /* 4 */
+    u_last = secp256k1_scalar_shr_int(&s, w);
+    do {
+        int even;
+
+        /* 4.1 4.4 */
+        u = secp256k1_scalar_shr_int(&s, w);
+        /* 4.2 */
+        even = ((u & 1) == 0);
+        /* In contrast to the original algorithm, u_last is always > 0 and
+         * therefore we do not need to check its sign. In particular, it's easy
+         * to see that u_last is never < 0 because u is never < 0. Moreover,
+         * u_last is never = 0 because u is never even after a loop
+         * iteration. The same holds analogously for the initial value of
+         * u_last (in the first loop iteration). */
+        VERIFY_CHECK(u_last > 0);
+        VERIFY_CHECK((u_last & 1) == 1);
+        u += even;
+        u_last -= even * (1 << w);
+
+        /* 4.3, adapted for global sign change */
+        wnaf[word++] = u_last * global_sign;
+
+        u_last = u;
+    } while (word * w < size);
+    wnaf[word] = u * global_sign;
+
+    VERIFY_CHECK(secp256k1_scalar_is_zero(&s));
+    VERIFY_CHECK(word == WNAF_SIZE_BITS(size, w));
+    return skew;
+}
+
+static void secp256k1_ecmult_const(secp256k1_gej *r, const secp256k1_ge *a, const secp256k1_scalar *scalar, int size) {
+    secp256k1_ge pre_a[ECMULT_TABLE_SIZE(WINDOW_A)];
+    secp256k1_ge tmpa;
+    secp256k1_fe Z;
+
+    int skew_1;
+    secp256k1_ge pre_a_lam[ECMULT_TABLE_SIZE(WINDOW_A)];
+    int wnaf_lam[1 + WNAF_SIZE(WINDOW_A - 1)];
+    int skew_lam;
+    secp256k1_scalar q_1, q_lam;
+    int wnaf_1[1 + WNAF_SIZE(WINDOW_A - 1)];
+
+    int i;
+
+    /* build wnaf representation for q. */
+    int rsize = size;
+    if (size > 128) {
+        rsize = 128;
+        /* split q into q_1 and q_lam (where q = q_1 + q_lam*lambda, and q_1 and q_lam are ~128 bit) */
+        secp256k1_scalar_split_lambda(&q_1, &q_lam, scalar);
+        skew_1   = secp256k1_wnaf_const(wnaf_1,   &q_1,   WINDOW_A - 1, 128);
+        skew_lam = secp256k1_wnaf_const(wnaf_lam, &q_lam, WINDOW_A - 1, 128);
+    } else
+    {
+        skew_1   = secp256k1_wnaf_const(wnaf_1, scalar, WINDOW_A - 1, size);
+        skew_lam = 0;
+    }
+
+    /* Calculate odd multiples of a.
+     * All multiples are brought to the same Z 'denominator', which is stored
+     * in Z. Due to secp256k1' isomorphism we can do all operations pretending
+     * that the Z coordinate was 1, use affine addition formulae, and correct
+     * the Z coordinate of the result once at the end.
+     */
+    secp256k1_gej_set_ge(r, a);
+    secp256k1_ecmult_odd_multiples_table_globalz_windowa(pre_a, &Z, r);
+    for (i = 0; i < ECMULT_TABLE_SIZE(WINDOW_A); i++) {
+        secp256k1_fe_normalize_weak(&pre_a[i].y);
+    }
+    if (size > 128) {
+        for (i = 0; i < ECMULT_TABLE_SIZE(WINDOW_A); i++) {
+            secp256k1_ge_mul_lambda(&pre_a_lam[i], &pre_a[i]);
+        }
+
+    }
+
+    /* first loop iteration (separated out so we can directly set r, rather
+     * than having it start at infinity, get doubled several times, then have
+     * its new value added to it) */
+    i = wnaf_1[WNAF_SIZE_BITS(rsize, WINDOW_A - 1)];
+    VERIFY_CHECK(i != 0);
+    ECMULT_CONST_TABLE_GET_GE(&tmpa, pre_a, i, WINDOW_A);
+    secp256k1_gej_set_ge(r, &tmpa);
+    if (size > 128) {
+        i = wnaf_lam[WNAF_SIZE_BITS(rsize, WINDOW_A - 1)];
+        VERIFY_CHECK(i != 0);
+        ECMULT_CONST_TABLE_GET_GE(&tmpa, pre_a_lam, i, WINDOW_A);
+        secp256k1_gej_add_ge(r, r, &tmpa);
+    }
+    /* remaining loop iterations */
+    for (i = WNAF_SIZE_BITS(rsize, WINDOW_A - 1) - 1; i >= 0; i--) {
+        int n;
+        int j;
+        for (j = 0; j < WINDOW_A - 1; ++j) {
+            secp256k1_gej_double(r, r);
+        }
+
+        n = wnaf_1[i];
+        ECMULT_CONST_TABLE_GET_GE(&tmpa, pre_a, n, WINDOW_A);
+        VERIFY_CHECK(n != 0);
+        secp256k1_gej_add_ge(r, r, &tmpa);
+        if (size > 128) {
+            n = wnaf_lam[i];
+            ECMULT_CONST_TABLE_GET_GE(&tmpa, pre_a_lam, n, WINDOW_A);
+            VERIFY_CHECK(n != 0);
+            secp256k1_gej_add_ge(r, r, &tmpa);
+        }
+    }
+
+    secp256k1_fe_mul(&r->z, &r->z, &Z);
+
+    {
+        /* Correct for wNAF skew */
+        secp256k1_ge correction = *a;
+        secp256k1_ge_storage correction_1_stor;
+        secp256k1_ge_storage correction_lam_stor;
+        secp256k1_ge_storage a2_stor;
+        secp256k1_gej tmpj;
+        secp256k1_gej_set_ge(&tmpj, &correction);
+        secp256k1_gej_double_var(&tmpj, &tmpj, NULL);
+        secp256k1_ge_set_gej(&correction, &tmpj);
+        secp256k1_ge_to_storage(&correction_1_stor, a);
+        if (size > 128) {
+            secp256k1_ge_to_storage(&correction_lam_stor, a);
+        }
+        secp256k1_ge_to_storage(&a2_stor, &correction);
+
+        /* For odd numbers this is 2a (so replace it), for even ones a (so no-op) */
+        secp256k1_ge_storage_cmov(&correction_1_stor, &a2_stor, skew_1 == 2);
+        if (size > 128) {
+            secp256k1_ge_storage_cmov(&correction_lam_stor, &a2_stor, skew_lam == 2);
+        }
+
+        /* Apply the correction */
+        secp256k1_ge_from_storage(&correction, &correction_1_stor);
+        secp256k1_ge_neg(&correction, &correction);
+        secp256k1_gej_add_ge(r, r, &correction);
+
+        if (size > 128) {
+            secp256k1_ge_from_storage(&correction, &correction_lam_stor);
+            secp256k1_ge_neg(&correction, &correction);
+            secp256k1_ge_mul_lambda(&correction, &correction);
+            secp256k1_gej_add_ge(r, r, &correction);
+        }
+    }
+}
+
+#endif /* SECP256K1_ECMULT_CONST_IMPL_H */
diff --git a/depend/zcash/src/secp256k1/src/ecmult_gen.h b/depend/zcash/src/secp256k1/src/ecmult_gen.h
new file mode 100644
index 000000000..539618dcb
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/ecmult_gen.h
@@ -0,0 +1,50 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_ECMULT_GEN_H
+#define SECP256K1_ECMULT_GEN_H
+
+#include "scalar.h"
+#include "group.h"
+
+#if ECMULT_GEN_PREC_BITS != 2 && ECMULT_GEN_PREC_BITS != 4 && ECMULT_GEN_PREC_BITS != 8
+#  error "Set ECMULT_GEN_PREC_BITS to 2, 4 or 8."
+#endif
+#define ECMULT_GEN_PREC_B ECMULT_GEN_PREC_BITS
+#define ECMULT_GEN_PREC_G (1 << ECMULT_GEN_PREC_B)
+#define ECMULT_GEN_PREC_N (256 / ECMULT_GEN_PREC_B)
+
+typedef struct {
+    /* For accelerating the computation of a*G:
+     * To harden against timing attacks, use the following mechanism:
+     * * Break up the multiplicand into groups of PREC_B bits, called n_0, n_1, n_2, ..., n_(PREC_N-1).
+     * * Compute sum(n_i * (PREC_G)^i * G + U_i, i=0 ... PREC_N-1), where:
+     *   * U_i = U * 2^i, for i=0 ... PREC_N-2
+     *   * U_i = U * (1-2^(PREC_N-1)), for i=PREC_N-1
+     *   where U is a point with no known corresponding scalar. Note that sum(U_i, i=0 ... PREC_N-1) = 0.
+     * For each i, and each of the PREC_G possible values of n_i, (n_i * (PREC_G)^i * G + U_i) is
+     * precomputed (call it prec(i, n_i)). The formula now becomes sum(prec(i, n_i), i=0 ... PREC_N-1).
+     * None of the resulting prec group elements have a known scalar, and neither do any of
+     * the intermediate sums while computing a*G.
+     */
+    secp256k1_ge_storage (*prec)[ECMULT_GEN_PREC_N][ECMULT_GEN_PREC_G]; /* prec[j][i] = (PREC_G)^j * i * G + U_i */
+    secp256k1_scalar blind;
+    secp256k1_gej initial;
+} secp256k1_ecmult_gen_context;
+
+static const size_t SECP256K1_ECMULT_GEN_CONTEXT_PREALLOCATED_SIZE;
+static void secp256k1_ecmult_gen_context_init(secp256k1_ecmult_gen_context* ctx);
+static void secp256k1_ecmult_gen_context_build(secp256k1_ecmult_gen_context* ctx, void **prealloc);
+static void secp256k1_ecmult_gen_context_finalize_memcpy(secp256k1_ecmult_gen_context *dst, const secp256k1_ecmult_gen_context* src);
+static void secp256k1_ecmult_gen_context_clear(secp256k1_ecmult_gen_context* ctx);
+static int secp256k1_ecmult_gen_context_is_built(const secp256k1_ecmult_gen_context* ctx);
+
+/** Multiply with the generator: R = a*G */
+static void secp256k1_ecmult_gen(const secp256k1_ecmult_gen_context* ctx, secp256k1_gej *r, const secp256k1_scalar *a);
+
+static void secp256k1_ecmult_gen_blind(secp256k1_ecmult_gen_context *ctx, const unsigned char *seed32);
+
+#endif /* SECP256K1_ECMULT_GEN_H */
diff --git a/depend/zcash/src/secp256k1/src/ecmult_gen_impl.h b/depend/zcash/src/secp256k1/src/ecmult_gen_impl.h
new file mode 100644
index 000000000..384a67fae
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/ecmult_gen_impl.h
@@ -0,0 +1,208 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014, 2015 Pieter Wuille, Gregory Maxwell       *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_ECMULT_GEN_IMPL_H
+#define SECP256K1_ECMULT_GEN_IMPL_H
+
+#include "util.h"
+#include "scalar.h"
+#include "group.h"
+#include "ecmult_gen.h"
+#include "hash_impl.h"
+#ifdef USE_ECMULT_STATIC_PRECOMPUTATION
+#include "ecmult_static_context.h"
+#endif
+
+#ifndef USE_ECMULT_STATIC_PRECOMPUTATION
+    static const size_t SECP256K1_ECMULT_GEN_CONTEXT_PREALLOCATED_SIZE = ROUND_TO_ALIGN(sizeof(*((secp256k1_ecmult_gen_context*) NULL)->prec));
+#else
+    static const size_t SECP256K1_ECMULT_GEN_CONTEXT_PREALLOCATED_SIZE = 0;
+#endif
+
+static void secp256k1_ecmult_gen_context_init(secp256k1_ecmult_gen_context *ctx) {
+    ctx->prec = NULL;
+}
+
+static void secp256k1_ecmult_gen_context_build(secp256k1_ecmult_gen_context *ctx, void **prealloc) {
+#ifndef USE_ECMULT_STATIC_PRECOMPUTATION
+    secp256k1_ge prec[ECMULT_GEN_PREC_N * ECMULT_GEN_PREC_G];
+    secp256k1_gej gj;
+    secp256k1_gej nums_gej;
+    int i, j;
+    size_t const prealloc_size = SECP256K1_ECMULT_GEN_CONTEXT_PREALLOCATED_SIZE;
+    void* const base = *prealloc;
+#endif
+
+    if (ctx->prec != NULL) {
+        return;
+    }
+#ifndef USE_ECMULT_STATIC_PRECOMPUTATION
+    ctx->prec = (secp256k1_ge_storage (*)[ECMULT_GEN_PREC_N][ECMULT_GEN_PREC_G])manual_alloc(prealloc, prealloc_size, base, prealloc_size);
+
+    /* get the generator */
+    secp256k1_gej_set_ge(&gj, &secp256k1_ge_const_g);
+
+    /* Construct a group element with no known corresponding scalar (nothing up my sleeve). */
+    {
+        static const unsigned char nums_b32[33] = "The scalar for this x is unknown";
+        secp256k1_fe nums_x;
+        secp256k1_ge nums_ge;
+        int r;
+        r = secp256k1_fe_set_b32(&nums_x, nums_b32);
+        (void)r;
+        VERIFY_CHECK(r);
+        r = secp256k1_ge_set_xo_var(&nums_ge, &nums_x, 0);
+        (void)r;
+        VERIFY_CHECK(r);
+        secp256k1_gej_set_ge(&nums_gej, &nums_ge);
+        /* Add G to make the bits in x uniformly distributed. */
+        secp256k1_gej_add_ge_var(&nums_gej, &nums_gej, &secp256k1_ge_const_g, NULL);
+    }
+
+    /* compute prec. */
+    {
+        secp256k1_gej precj[ECMULT_GEN_PREC_N * ECMULT_GEN_PREC_G]; /* Jacobian versions of prec. */
+        secp256k1_gej gbase;
+        secp256k1_gej numsbase;
+        gbase = gj; /* PREC_G^j * G */
+        numsbase = nums_gej; /* 2^j * nums. */
+        for (j = 0; j < ECMULT_GEN_PREC_N; j++) {
+            /* Set precj[j*PREC_G .. j*PREC_G+(PREC_G-1)] to (numsbase, numsbase + gbase, ..., numsbase + (PREC_G-1)*gbase). */
+            precj[j*ECMULT_GEN_PREC_G] = numsbase;
+            for (i = 1; i < ECMULT_GEN_PREC_G; i++) {
+                secp256k1_gej_add_var(&precj[j*ECMULT_GEN_PREC_G + i], &precj[j*ECMULT_GEN_PREC_G + i - 1], &gbase, NULL);
+            }
+            /* Multiply gbase by PREC_G. */
+            for (i = 0; i < ECMULT_GEN_PREC_B; i++) {
+                secp256k1_gej_double_var(&gbase, &gbase, NULL);
+            }
+            /* Multiply numbase by 2. */
+            secp256k1_gej_double_var(&numsbase, &numsbase, NULL);
+            if (j == ECMULT_GEN_PREC_N - 2) {
+                /* In the last iteration, numsbase is (1 - 2^j) * nums instead. */
+                secp256k1_gej_neg(&numsbase, &numsbase);
+                secp256k1_gej_add_var(&numsbase, &numsbase, &nums_gej, NULL);
+            }
+        }
+        secp256k1_ge_set_all_gej_var(prec, precj, ECMULT_GEN_PREC_N * ECMULT_GEN_PREC_G);
+    }
+    for (j = 0; j < ECMULT_GEN_PREC_N; j++) {
+        for (i = 0; i < ECMULT_GEN_PREC_G; i++) {
+            secp256k1_ge_to_storage(&(*ctx->prec)[j][i], &prec[j*ECMULT_GEN_PREC_G + i]);
+        }
+    }
+#else
+    (void)prealloc;
+    ctx->prec = (secp256k1_ge_storage (*)[ECMULT_GEN_PREC_N][ECMULT_GEN_PREC_G])secp256k1_ecmult_static_context;
+#endif
+    secp256k1_ecmult_gen_blind(ctx, NULL);
+}
+
+static int secp256k1_ecmult_gen_context_is_built(const secp256k1_ecmult_gen_context* ctx) {
+    return ctx->prec != NULL;
+}
+
+static void secp256k1_ecmult_gen_context_finalize_memcpy(secp256k1_ecmult_gen_context *dst, const secp256k1_ecmult_gen_context *src) {
+#ifndef USE_ECMULT_STATIC_PRECOMPUTATION
+    if (src->prec != NULL) {
+        /* We cast to void* first to suppress a -Wcast-align warning. */
+        dst->prec = (secp256k1_ge_storage (*)[ECMULT_GEN_PREC_N][ECMULT_GEN_PREC_G])(void*)((unsigned char*)dst + ((unsigned char*)src->prec - (unsigned char*)src));
+    }
+#else
+    (void)dst, (void)src;
+#endif
+}
+
+static void secp256k1_ecmult_gen_context_clear(secp256k1_ecmult_gen_context *ctx) {
+    secp256k1_scalar_clear(&ctx->blind);
+    secp256k1_gej_clear(&ctx->initial);
+    ctx->prec = NULL;
+}
+
+static void secp256k1_ecmult_gen(const secp256k1_ecmult_gen_context *ctx, secp256k1_gej *r, const secp256k1_scalar *gn) {
+    secp256k1_ge add;
+    secp256k1_ge_storage adds;
+    secp256k1_scalar gnb;
+    int bits;
+    int i, j;
+    memset(&adds, 0, sizeof(adds));
+    *r = ctx->initial;
+    /* Blind scalar/point multiplication by computing (n-b)G + bG instead of nG. */
+    secp256k1_scalar_add(&gnb, gn, &ctx->blind);
+    add.infinity = 0;
+    for (j = 0; j < ECMULT_GEN_PREC_N; j++) {
+        bits = secp256k1_scalar_get_bits(&gnb, j * ECMULT_GEN_PREC_B, ECMULT_GEN_PREC_B);
+        for (i = 0; i < ECMULT_GEN_PREC_G; i++) {
+            /** This uses a conditional move to avoid any secret data in array indexes.
+             *   _Any_ use of secret indexes has been demonstrated to result in timing
+             *   sidechannels, even when the cache-line access patterns are uniform.
+             *  See also:
+             *   "A word of warning", CHES 2013 Rump Session, by Daniel J. Bernstein and Peter Schwabe
+             *    (https://cryptojedi.org/peter/data/chesrump-20130822.pdf) and
+             *   "Cache Attacks and Countermeasures: the Case of AES", RSA 2006,
+             *    by Dag Arne Osvik, Adi Shamir, and Eran Tromer
+             *    (https://www.tau.ac.il/~tromer/papers/cache.pdf)
+             */
+            secp256k1_ge_storage_cmov(&adds, &(*ctx->prec)[j][i], i == bits);
+        }
+        secp256k1_ge_from_storage(&add, &adds);
+        secp256k1_gej_add_ge(r, r, &add);
+    }
+    bits = 0;
+    secp256k1_ge_clear(&add);
+    secp256k1_scalar_clear(&gnb);
+}
+
+/* Setup blinding values for secp256k1_ecmult_gen. */
+static void secp256k1_ecmult_gen_blind(secp256k1_ecmult_gen_context *ctx, const unsigned char *seed32) {
+    secp256k1_scalar b;
+    secp256k1_gej gb;
+    secp256k1_fe s;
+    unsigned char nonce32[32];
+    secp256k1_rfc6979_hmac_sha256 rng;
+    int overflow;
+    unsigned char keydata[64] = {0};
+    if (seed32 == NULL) {
+        /* When seed is NULL, reset the initial point and blinding value. */
+        secp256k1_gej_set_ge(&ctx->initial, &secp256k1_ge_const_g);
+        secp256k1_gej_neg(&ctx->initial, &ctx->initial);
+        secp256k1_scalar_set_int(&ctx->blind, 1);
+    }
+    /* The prior blinding value (if not reset) is chained forward by including it in the hash. */
+    secp256k1_scalar_get_b32(nonce32, &ctx->blind);
+    /** Using a CSPRNG allows a failure free interface, avoids needing large amounts of random data,
+     *   and guards against weak or adversarial seeds.  This is a simpler and safer interface than
+     *   asking the caller for blinding values directly and expecting them to retry on failure.
+     */
+    memcpy(keydata, nonce32, 32);
+    if (seed32 != NULL) {
+        memcpy(keydata + 32, seed32, 32);
+    }
+    secp256k1_rfc6979_hmac_sha256_initialize(&rng, keydata, seed32 ? 64 : 32);
+    memset(keydata, 0, sizeof(keydata));
+    /* Accept unobservably small non-uniformity. */
+    secp256k1_rfc6979_hmac_sha256_generate(&rng, nonce32, 32);
+    overflow = !secp256k1_fe_set_b32(&s, nonce32);
+    overflow |= secp256k1_fe_is_zero(&s);
+    secp256k1_fe_cmov(&s, &secp256k1_fe_one, overflow);
+    /* Randomize the projection to defend against multiplier sidechannels. */
+    secp256k1_gej_rescale(&ctx->initial, &s);
+    secp256k1_fe_clear(&s);
+    secp256k1_rfc6979_hmac_sha256_generate(&rng, nonce32, 32);
+    secp256k1_scalar_set_b32(&b, nonce32, NULL);
+    /* A blinding value of 0 works, but would undermine the projection hardening. */
+    secp256k1_scalar_cmov(&b, &secp256k1_scalar_one, secp256k1_scalar_is_zero(&b));
+    secp256k1_rfc6979_hmac_sha256_finalize(&rng);
+    memset(nonce32, 0, 32);
+    secp256k1_ecmult_gen(ctx, &gb, &b);
+    secp256k1_scalar_negate(&b, &b);
+    ctx->blind = b;
+    ctx->initial = gb;
+    secp256k1_scalar_clear(&b);
+    secp256k1_gej_clear(&gb);
+}
+
+#endif /* SECP256K1_ECMULT_GEN_IMPL_H */
diff --git a/depend/zcash/src/secp256k1/src/ecmult_impl.h b/depend/zcash/src/secp256k1/src/ecmult_impl.h
new file mode 100644
index 000000000..5c2edac68
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/ecmult_impl.h
@@ -0,0 +1,1083 @@
+/******************************************************************************
+ * Copyright (c) 2013, 2014, 2017 Pieter Wuille, Andrew Poelstra, Jonas Nick  *
+ * Distributed under the MIT software license, see the accompanying           *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.       *
+ ******************************************************************************/
+
+#ifndef SECP256K1_ECMULT_IMPL_H
+#define SECP256K1_ECMULT_IMPL_H
+
+#include <string.h>
+#include <stdint.h>
+
+#include "util.h"
+#include "group.h"
+#include "scalar.h"
+#include "ecmult.h"
+
+#if defined(EXHAUSTIVE_TEST_ORDER)
+/* We need to lower these values for exhaustive tests because
+ * the tables cannot have infinities in them (this breaks the
+ * affine-isomorphism stuff which tracks z-ratios) */
+#  if EXHAUSTIVE_TEST_ORDER > 128
+#    define WINDOW_A 5
+#    define WINDOW_G 8
+#  elif EXHAUSTIVE_TEST_ORDER > 8
+#    define WINDOW_A 4
+#    define WINDOW_G 4
+#  else
+#    define WINDOW_A 2
+#    define WINDOW_G 2
+#  endif
+#else
+/* optimal for 128-bit and 256-bit exponents. */
+#  define WINDOW_A 5
+/** Larger values for ECMULT_WINDOW_SIZE result in possibly better
+ *  performance at the cost of an exponentially larger precomputed
+ *  table. The exact table size is
+ *      (1 << (WINDOW_G - 2)) * sizeof(secp256k1_ge_storage)  bytes,
+ *  where sizeof(secp256k1_ge_storage) is typically 64 bytes but can
+ *  be larger due to platform-specific padding and alignment.
+ *  Two tables of this size are used (due to the endomorphism
+ *  optimization).
+ */
+#  define WINDOW_G ECMULT_WINDOW_SIZE
+#endif
+
+/* Noone will ever need more than a window size of 24. The code might
+ * be correct for larger values of ECMULT_WINDOW_SIZE but this is not
+ * not tested.
+ *
+ * The following limitations are known, and there are probably more:
+ * If WINDOW_G > 27 and size_t has 32 bits, then the code is incorrect
+ * because the size of the memory object that we allocate (in bytes)
+ * will not fit in a size_t.
+ * If WINDOW_G > 31 and int has 32 bits, then the code is incorrect
+ * because certain expressions will overflow.
+ */
+#if ECMULT_WINDOW_SIZE < 2 || ECMULT_WINDOW_SIZE > 24
+#  error Set ECMULT_WINDOW_SIZE to an integer in range [2..24].
+#endif
+
+#define WNAF_BITS 128
+#define WNAF_SIZE_BITS(bits, w) (((bits) + (w) - 1) / (w))
+#define WNAF_SIZE(w) WNAF_SIZE_BITS(WNAF_BITS, w)
+
+/** The number of entries a table with precomputed multiples needs to have. */
+#define ECMULT_TABLE_SIZE(w) (1 << ((w)-2))
+
+/* The number of objects allocated on the scratch space for ecmult_multi algorithms */
+#define PIPPENGER_SCRATCH_OBJECTS 6
+#define STRAUSS_SCRATCH_OBJECTS 6
+
+#define PIPPENGER_MAX_BUCKET_WINDOW 12
+
+/* Minimum number of points for which pippenger_wnaf is faster than strauss wnaf */
+#define ECMULT_PIPPENGER_THRESHOLD 88
+
+#define ECMULT_MAX_POINTS_PER_BATCH 5000000
+
+/** Fill a table 'prej' with precomputed odd multiples of a. Prej will contain
+ *  the values [1*a,3*a,...,(2*n-1)*a], so it space for n values. zr[0] will
+ *  contain prej[0].z / a.z. The other zr[i] values = prej[i].z / prej[i-1].z.
+ *  Prej's Z values are undefined, except for the last value.
+ */
+static void secp256k1_ecmult_odd_multiples_table(int n, secp256k1_gej *prej, secp256k1_fe *zr, const secp256k1_gej *a) {
+    secp256k1_gej d;
+    secp256k1_ge a_ge, d_ge;
+    int i;
+
+    VERIFY_CHECK(!a->infinity);
+
+    secp256k1_gej_double_var(&d, a, NULL);
+
+    /*
+     * Perform the additions on an isomorphism where 'd' is affine: drop the z coordinate
+     * of 'd', and scale the 1P starting value's x/y coordinates without changing its z.
+     */
+    d_ge.x = d.x;
+    d_ge.y = d.y;
+    d_ge.infinity = 0;
+
+    secp256k1_ge_set_gej_zinv(&a_ge, a, &d.z);
+    prej[0].x = a_ge.x;
+    prej[0].y = a_ge.y;
+    prej[0].z = a->z;
+    prej[0].infinity = 0;
+
+    zr[0] = d.z;
+    for (i = 1; i < n; i++) {
+        secp256k1_gej_add_ge_var(&prej[i], &prej[i-1], &d_ge, &zr[i]);
+    }
+
+    /*
+     * Each point in 'prej' has a z coordinate too small by a factor of 'd.z'. Only
+     * the final point's z coordinate is actually used though, so just update that.
+     */
+    secp256k1_fe_mul(&prej[n-1].z, &prej[n-1].z, &d.z);
+}
+
+/** Fill a table 'pre' with precomputed odd multiples of a.
+ *
+ *  There are two versions of this function:
+ *  - secp256k1_ecmult_odd_multiples_table_globalz_windowa which brings its
+ *    resulting point set to a single constant Z denominator, stores the X and Y
+ *    coordinates as ge_storage points in pre, and stores the global Z in rz.
+ *    It only operates on tables sized for WINDOW_A wnaf multiples.
+ *  - secp256k1_ecmult_odd_multiples_table_storage_var, which converts its
+ *    resulting point set to actually affine points, and stores those in pre.
+ *    It operates on tables of any size.
+ *
+ *  To compute a*P + b*G, we compute a table for P using the first function,
+ *  and for G using the second (which requires an inverse, but it only needs to
+ *  happen once).
+ */
+static void secp256k1_ecmult_odd_multiples_table_globalz_windowa(secp256k1_ge *pre, secp256k1_fe *globalz, const secp256k1_gej *a) {
+    secp256k1_gej prej[ECMULT_TABLE_SIZE(WINDOW_A)];
+    secp256k1_fe zr[ECMULT_TABLE_SIZE(WINDOW_A)];
+
+    /* Compute the odd multiples in Jacobian form. */
+    secp256k1_ecmult_odd_multiples_table(ECMULT_TABLE_SIZE(WINDOW_A), prej, zr, a);
+    /* Bring them to the same Z denominator. */
+    secp256k1_ge_globalz_set_table_gej(ECMULT_TABLE_SIZE(WINDOW_A), pre, globalz, prej, zr);
+}
+
+static void secp256k1_ecmult_odd_multiples_table_storage_var(const int n, secp256k1_ge_storage *pre, const secp256k1_gej *a) {
+    secp256k1_gej d;
+    secp256k1_ge d_ge, p_ge;
+    secp256k1_gej pj;
+    secp256k1_fe zi;
+    secp256k1_fe zr;
+    secp256k1_fe dx_over_dz_squared;
+    int i;
+
+    VERIFY_CHECK(!a->infinity);
+
+    secp256k1_gej_double_var(&d, a, NULL);
+
+    /* First, we perform all the additions in an isomorphic curve obtained by multiplying
+     * all `z` coordinates by 1/`d.z`. In these coordinates `d` is affine so we can use
+     * `secp256k1_gej_add_ge_var` to perform the additions. For each addition, we store
+     * the resulting y-coordinate and the z-ratio, since we only have enough memory to
+     * store two field elements. These are sufficient to efficiently undo the isomorphism
+     * and recompute all the `x`s.
+     */
+    d_ge.x = d.x;
+    d_ge.y = d.y;
+    d_ge.infinity = 0;
+
+    secp256k1_ge_set_gej_zinv(&p_ge, a, &d.z);
+    pj.x = p_ge.x;
+    pj.y = p_ge.y;
+    pj.z = a->z;
+    pj.infinity = 0;
+
+    for (i = 0; i < (n - 1); i++) {
+        secp256k1_fe_normalize_var(&pj.y);
+        secp256k1_fe_to_storage(&pre[i].y, &pj.y);
+        secp256k1_gej_add_ge_var(&pj, &pj, &d_ge, &zr);
+        secp256k1_fe_normalize_var(&zr);
+        secp256k1_fe_to_storage(&pre[i].x, &zr);
+    }
+
+    /* Invert d.z in the same batch, preserving pj.z so we can extract 1/d.z */
+    secp256k1_fe_mul(&zi, &pj.z, &d.z);
+    secp256k1_fe_inv_var(&zi, &zi);
+
+    /* Directly set `pre[n - 1]` to `pj`, saving the inverted z-coordinate so
+     * that we can combine it with the saved z-ratios to compute the other zs
+     * without any more inversions. */
+    secp256k1_ge_set_gej_zinv(&p_ge, &pj, &zi);
+    secp256k1_ge_to_storage(&pre[n - 1], &p_ge);
+
+    /* Compute the actual x-coordinate of D, which will be needed below. */
+    secp256k1_fe_mul(&d.z, &zi, &pj.z);  /* d.z = 1/d.z */
+    secp256k1_fe_sqr(&dx_over_dz_squared, &d.z);
+    secp256k1_fe_mul(&dx_over_dz_squared, &dx_over_dz_squared, &d.x);
+
+    /* Going into the second loop, we have set `pre[n-1]` to its final affine
+     * form, but still need to set `pre[i]` for `i` in 0 through `n-2`. We
+     * have `zi = (p.z * d.z)^-1`, where
+     *
+     *     `p.z` is the z-coordinate of the point on the isomorphic curve
+     *           which was ultimately assigned to `pre[n-1]`.
+     *     `d.z` is the multiplier that must be applied to all z-coordinates
+     *           to move from our isomorphic curve back to secp256k1; so the
+     *           product `p.z * d.z` is the z-coordinate of the secp256k1
+     *           point assigned to `pre[n-1]`.
+     *
+     * All subsequent inverse-z-coordinates can be obtained by multiplying this
+     * factor by successive z-ratios, which is much more efficient than directly
+     * computing each one.
+     *
+     * Importantly, these inverse-zs will be coordinates of points on secp256k1,
+     * while our other stored values come from computations on the isomorphic
+     * curve. So in the below loop, we will take care not to actually use `zi`
+     * or any derived values until we're back on secp256k1.
+     */
+    i = n - 1;
+    while (i > 0) {
+        secp256k1_fe zi2, zi3;
+        const secp256k1_fe *rzr;
+        i--;
+
+        secp256k1_ge_from_storage(&p_ge, &pre[i]);
+
+        /* For each remaining point, we extract the z-ratio from the stored
+         * x-coordinate, compute its z^-1 from that, and compute the full
+         * point from that. */
+        rzr = &p_ge.x;
+        secp256k1_fe_mul(&zi, &zi, rzr);
+        secp256k1_fe_sqr(&zi2, &zi);
+        secp256k1_fe_mul(&zi3, &zi2, &zi);
+        /* To compute the actual x-coordinate, we use the stored z ratio and
+         * y-coordinate, which we obtained from `secp256k1_gej_add_ge_var`
+         * in the loop above, as well as the inverse of the square of its
+         * z-coordinate. We store the latter in the `zi2` variable, which is
+         * computed iteratively starting from the overall Z inverse then
+         * multiplying by each z-ratio in turn.
+         *
+         * Denoting the z-ratio as `rzr`, we observe that it is equal to `h`
+         * from the inside of the above `gej_add_ge_var` call. This satisfies
+         *
+         *    rzr = d_x * z^2 - x * d_z^2
+         *
+         * where (`d_x`, `d_z`) are Jacobian coordinates of `D` and `(x, z)`
+         * are Jacobian coordinates of our desired point -- except both are on
+         * the isomorphic curve that we were using when we called `gej_add_ge_var`.
+         * To get back to secp256k1, we must multiply both `z`s by `d_z`, or
+         * equivalently divide both `x`s by `d_z^2`. Our equation then becomes
+         *
+         *    rzr = d_x * z^2 / d_z^2 - x
+         *
+         * (The left-hand-side, being a ratio of z-coordinates, is unaffected
+         * by the isomorphism.)
+         *
+         * Rearranging to solve for `x`, we have
+         *
+         *     x = d_x * z^2 / d_z^2 - rzr
+         *
+         * But what we actually want is the affine coordinate `X = x/z^2`,
+         * which will satisfy
+         *
+         *     X = d_x / d_z^2 - rzr / z^2
+         *       = dx_over_dz_squared - rzr * zi2
+         */
+        secp256k1_fe_mul(&p_ge.x, rzr, &zi2);
+        secp256k1_fe_negate(&p_ge.x, &p_ge.x, 1);
+        secp256k1_fe_add(&p_ge.x, &dx_over_dz_squared);
+        /* y is stored_y/z^3, as we expect */
+        secp256k1_fe_mul(&p_ge.y, &p_ge.y, &zi3);
+        /* Store */
+        secp256k1_ge_to_storage(&pre[i], &p_ge);
+    }
+}
+
+/** The following two macro retrieves a particular odd multiple from a table
+ *  of precomputed multiples. */
+#define ECMULT_TABLE_GET_GE(r,pre,n,w) do { \
+    VERIFY_CHECK(((n) & 1) == 1); \
+    VERIFY_CHECK((n) >= -((1 << ((w)-1)) - 1)); \
+    VERIFY_CHECK((n) <=  ((1 << ((w)-1)) - 1)); \
+    if ((n) > 0) { \
+        *(r) = (pre)[((n)-1)/2]; \
+    } else { \
+        *(r) = (pre)[(-(n)-1)/2]; \
+        secp256k1_fe_negate(&((r)->y), &((r)->y), 1); \
+    } \
+} while(0)
+
+#define ECMULT_TABLE_GET_GE_STORAGE(r,pre,n,w) do { \
+    VERIFY_CHECK(((n) & 1) == 1); \
+    VERIFY_CHECK((n) >= -((1 << ((w)-1)) - 1)); \
+    VERIFY_CHECK((n) <=  ((1 << ((w)-1)) - 1)); \
+    if ((n) > 0) { \
+        secp256k1_ge_from_storage((r), &(pre)[((n)-1)/2]); \
+    } else { \
+        secp256k1_ge_from_storage((r), &(pre)[(-(n)-1)/2]); \
+        secp256k1_fe_negate(&((r)->y), &((r)->y), 1); \
+    } \
+} while(0)
+
+static const size_t SECP256K1_ECMULT_CONTEXT_PREALLOCATED_SIZE =
+    ROUND_TO_ALIGN(sizeof((*((secp256k1_ecmult_context*) NULL)->pre_g)[0]) * ECMULT_TABLE_SIZE(WINDOW_G))
+    + ROUND_TO_ALIGN(sizeof((*((secp256k1_ecmult_context*) NULL)->pre_g_128)[0]) * ECMULT_TABLE_SIZE(WINDOW_G))
+    ;
+
+static void secp256k1_ecmult_context_init(secp256k1_ecmult_context *ctx) {
+    ctx->pre_g = NULL;
+    ctx->pre_g_128 = NULL;
+}
+
+static void secp256k1_ecmult_context_build(secp256k1_ecmult_context *ctx, void **prealloc) {
+    secp256k1_gej gj;
+    void* const base = *prealloc;
+    size_t const prealloc_size = SECP256K1_ECMULT_CONTEXT_PREALLOCATED_SIZE;
+
+    if (ctx->pre_g != NULL) {
+        return;
+    }
+
+    /* get the generator */
+    secp256k1_gej_set_ge(&gj, &secp256k1_ge_const_g);
+
+    {
+        size_t size = sizeof((*ctx->pre_g)[0]) * ((size_t)ECMULT_TABLE_SIZE(WINDOW_G));
+        /* check for overflow */
+        VERIFY_CHECK(size / sizeof((*ctx->pre_g)[0]) == ((size_t)ECMULT_TABLE_SIZE(WINDOW_G)));
+        ctx->pre_g = (secp256k1_ge_storage (*)[])manual_alloc(prealloc, sizeof((*ctx->pre_g)[0]) * ECMULT_TABLE_SIZE(WINDOW_G), base, prealloc_size);
+    }
+
+    /* precompute the tables with odd multiples */
+    secp256k1_ecmult_odd_multiples_table_storage_var(ECMULT_TABLE_SIZE(WINDOW_G), *ctx->pre_g, &gj);
+
+    {
+        secp256k1_gej g_128j;
+        int i;
+
+        size_t size = sizeof((*ctx->pre_g_128)[0]) * ((size_t) ECMULT_TABLE_SIZE(WINDOW_G));
+        /* check for overflow */
+        VERIFY_CHECK(size / sizeof((*ctx->pre_g_128)[0]) == ((size_t)ECMULT_TABLE_SIZE(WINDOW_G)));
+        ctx->pre_g_128 = (secp256k1_ge_storage (*)[])manual_alloc(prealloc, sizeof((*ctx->pre_g_128)[0]) * ECMULT_TABLE_SIZE(WINDOW_G), base, prealloc_size);
+
+        /* calculate 2^128*generator */
+        g_128j = gj;
+        for (i = 0; i < 128; i++) {
+            secp256k1_gej_double_var(&g_128j, &g_128j, NULL);
+        }
+        secp256k1_ecmult_odd_multiples_table_storage_var(ECMULT_TABLE_SIZE(WINDOW_G), *ctx->pre_g_128, &g_128j);
+    }
+}
+
+static void secp256k1_ecmult_context_finalize_memcpy(secp256k1_ecmult_context *dst, const secp256k1_ecmult_context *src) {
+    if (src->pre_g != NULL) {
+        /* We cast to void* first to suppress a -Wcast-align warning. */
+        dst->pre_g = (secp256k1_ge_storage (*)[])(void*)((unsigned char*)dst + ((unsigned char*)(src->pre_g) - (unsigned char*)src));
+    }
+    if (src->pre_g_128 != NULL) {
+        dst->pre_g_128 = (secp256k1_ge_storage (*)[])(void*)((unsigned char*)dst + ((unsigned char*)(src->pre_g_128) - (unsigned char*)src));
+    }
+}
+
+static int secp256k1_ecmult_context_is_built(const secp256k1_ecmult_context *ctx) {
+    return ctx->pre_g != NULL;
+}
+
+static void secp256k1_ecmult_context_clear(secp256k1_ecmult_context *ctx) {
+    secp256k1_ecmult_context_init(ctx);
+}
+
+/** Convert a number to WNAF notation. The number becomes represented by sum(2^i * wnaf[i], i=0..bits),
+ *  with the following guarantees:
+ *  - each wnaf[i] is either 0, or an odd integer between -(1<<(w-1) - 1) and (1<<(w-1) - 1)
+ *  - two non-zero entries in wnaf are separated by at least w-1 zeroes.
+ *  - the number of set values in wnaf is returned. This number is at most 256, and at most one more
+ *    than the number of bits in the (absolute value) of the input.
+ */
+static int secp256k1_ecmult_wnaf(int *wnaf, int len, const secp256k1_scalar *a, int w) {
+    secp256k1_scalar s;
+    int last_set_bit = -1;
+    int bit = 0;
+    int sign = 1;
+    int carry = 0;
+
+    VERIFY_CHECK(wnaf != NULL);
+    VERIFY_CHECK(0 <= len && len <= 256);
+    VERIFY_CHECK(a != NULL);
+    VERIFY_CHECK(2 <= w && w <= 31);
+
+    memset(wnaf, 0, len * sizeof(wnaf[0]));
+
+    s = *a;
+    if (secp256k1_scalar_get_bits(&s, 255, 1)) {
+        secp256k1_scalar_negate(&s, &s);
+        sign = -1;
+    }
+
+    while (bit < len) {
+        int now;
+        int word;
+        if (secp256k1_scalar_get_bits(&s, bit, 1) == (unsigned int)carry) {
+            bit++;
+            continue;
+        }
+
+        now = w;
+        if (now > len - bit) {
+            now = len - bit;
+        }
+
+        word = secp256k1_scalar_get_bits_var(&s, bit, now) + carry;
+
+        carry = (word >> (w-1)) & 1;
+        word -= carry << w;
+
+        wnaf[bit] = sign * word;
+        last_set_bit = bit;
+
+        bit += now;
+    }
+#ifdef VERIFY
+    CHECK(carry == 0);
+    while (bit < 256) {
+        CHECK(secp256k1_scalar_get_bits(&s, bit++, 1) == 0);
+    }
+#endif
+    return last_set_bit + 1;
+}
+
+struct secp256k1_strauss_point_state {
+    secp256k1_scalar na_1, na_lam;
+    int wnaf_na_1[129];
+    int wnaf_na_lam[129];
+    int bits_na_1;
+    int bits_na_lam;
+    size_t input_pos;
+};
+
+struct secp256k1_strauss_state {
+    secp256k1_gej* prej;
+    secp256k1_fe* zr;
+    secp256k1_ge* pre_a;
+    secp256k1_ge* pre_a_lam;
+    struct secp256k1_strauss_point_state* ps;
+};
+
+static void secp256k1_ecmult_strauss_wnaf(const secp256k1_ecmult_context *ctx, const struct secp256k1_strauss_state *state, secp256k1_gej *r, size_t num, const secp256k1_gej *a, const secp256k1_scalar *na, const secp256k1_scalar *ng) {
+    secp256k1_ge tmpa;
+    secp256k1_fe Z;
+    /* Splitted G factors. */
+    secp256k1_scalar ng_1, ng_128;
+    int wnaf_ng_1[129];
+    int bits_ng_1 = 0;
+    int wnaf_ng_128[129];
+    int bits_ng_128 = 0;
+    int i;
+    int bits = 0;
+    size_t np;
+    size_t no = 0;
+
+    for (np = 0; np < num; ++np) {
+        if (secp256k1_scalar_is_zero(&na[np]) || secp256k1_gej_is_infinity(&a[np])) {
+            continue;
+        }
+        state->ps[no].input_pos = np;
+        /* split na into na_1 and na_lam (where na = na_1 + na_lam*lambda, and na_1 and na_lam are ~128 bit) */
+        secp256k1_scalar_split_lambda(&state->ps[no].na_1, &state->ps[no].na_lam, &na[np]);
+
+        /* build wnaf representation for na_1 and na_lam. */
+        state->ps[no].bits_na_1   = secp256k1_ecmult_wnaf(state->ps[no].wnaf_na_1,   129, &state->ps[no].na_1,   WINDOW_A);
+        state->ps[no].bits_na_lam = secp256k1_ecmult_wnaf(state->ps[no].wnaf_na_lam, 129, &state->ps[no].na_lam, WINDOW_A);
+        VERIFY_CHECK(state->ps[no].bits_na_1 <= 129);
+        VERIFY_CHECK(state->ps[no].bits_na_lam <= 129);
+        if (state->ps[no].bits_na_1 > bits) {
+            bits = state->ps[no].bits_na_1;
+        }
+        if (state->ps[no].bits_na_lam > bits) {
+            bits = state->ps[no].bits_na_lam;
+        }
+        ++no;
+    }
+
+    /* Calculate odd multiples of a.
+     * All multiples are brought to the same Z 'denominator', which is stored
+     * in Z. Due to secp256k1' isomorphism we can do all operations pretending
+     * that the Z coordinate was 1, use affine addition formulae, and correct
+     * the Z coordinate of the result once at the end.
+     * The exception is the precomputed G table points, which are actually
+     * affine. Compared to the base used for other points, they have a Z ratio
+     * of 1/Z, so we can use secp256k1_gej_add_zinv_var, which uses the same
+     * isomorphism to efficiently add with a known Z inverse.
+     */
+    if (no > 0) {
+        /* Compute the odd multiples in Jacobian form. */
+        secp256k1_ecmult_odd_multiples_table(ECMULT_TABLE_SIZE(WINDOW_A), state->prej, state->zr, &a[state->ps[0].input_pos]);
+        for (np = 1; np < no; ++np) {
+            secp256k1_gej tmp = a[state->ps[np].input_pos];
+#ifdef VERIFY
+            secp256k1_fe_normalize_var(&(state->prej[(np - 1) * ECMULT_TABLE_SIZE(WINDOW_A) + ECMULT_TABLE_SIZE(WINDOW_A) - 1].z));
+#endif
+            secp256k1_gej_rescale(&tmp, &(state->prej[(np - 1) * ECMULT_TABLE_SIZE(WINDOW_A) + ECMULT_TABLE_SIZE(WINDOW_A) - 1].z));
+            secp256k1_ecmult_odd_multiples_table(ECMULT_TABLE_SIZE(WINDOW_A), state->prej + np * ECMULT_TABLE_SIZE(WINDOW_A), state->zr + np * ECMULT_TABLE_SIZE(WINDOW_A), &tmp);
+            secp256k1_fe_mul(state->zr + np * ECMULT_TABLE_SIZE(WINDOW_A), state->zr + np * ECMULT_TABLE_SIZE(WINDOW_A), &(a[state->ps[np].input_pos].z));
+        }
+        /* Bring them to the same Z denominator. */
+        secp256k1_ge_globalz_set_table_gej(ECMULT_TABLE_SIZE(WINDOW_A) * no, state->pre_a, &Z, state->prej, state->zr);
+    } else {
+        secp256k1_fe_set_int(&Z, 1);
+    }
+
+    for (np = 0; np < no; ++np) {
+        for (i = 0; i < ECMULT_TABLE_SIZE(WINDOW_A); i++) {
+            secp256k1_ge_mul_lambda(&state->pre_a_lam[np * ECMULT_TABLE_SIZE(WINDOW_A) + i], &state->pre_a[np * ECMULT_TABLE_SIZE(WINDOW_A) + i]);
+        }
+    }
+
+    if (ng) {
+        /* split ng into ng_1 and ng_128 (where gn = gn_1 + gn_128*2^128, and gn_1 and gn_128 are ~128 bit) */
+        secp256k1_scalar_split_128(&ng_1, &ng_128, ng);
+
+        /* Build wnaf representation for ng_1 and ng_128 */
+        bits_ng_1   = secp256k1_ecmult_wnaf(wnaf_ng_1,   129, &ng_1,   WINDOW_G);
+        bits_ng_128 = secp256k1_ecmult_wnaf(wnaf_ng_128, 129, &ng_128, WINDOW_G);
+        if (bits_ng_1 > bits) {
+            bits = bits_ng_1;
+        }
+        if (bits_ng_128 > bits) {
+            bits = bits_ng_128;
+        }
+    }
+
+    secp256k1_gej_set_infinity(r);
+
+    for (i = bits - 1; i >= 0; i--) {
+        int n;
+        secp256k1_gej_double_var(r, r, NULL);
+        for (np = 0; np < no; ++np) {
+            if (i < state->ps[np].bits_na_1 && (n = state->ps[np].wnaf_na_1[i])) {
+                ECMULT_TABLE_GET_GE(&tmpa, state->pre_a + np * ECMULT_TABLE_SIZE(WINDOW_A), n, WINDOW_A);
+                secp256k1_gej_add_ge_var(r, r, &tmpa, NULL);
+            }
+            if (i < state->ps[np].bits_na_lam && (n = state->ps[np].wnaf_na_lam[i])) {
+                ECMULT_TABLE_GET_GE(&tmpa, state->pre_a_lam + np * ECMULT_TABLE_SIZE(WINDOW_A), n, WINDOW_A);
+                secp256k1_gej_add_ge_var(r, r, &tmpa, NULL);
+            }
+        }
+        if (i < bits_ng_1 && (n = wnaf_ng_1[i])) {
+            ECMULT_TABLE_GET_GE_STORAGE(&tmpa, *ctx->pre_g, n, WINDOW_G);
+            secp256k1_gej_add_zinv_var(r, r, &tmpa, &Z);
+        }
+        if (i < bits_ng_128 && (n = wnaf_ng_128[i])) {
+            ECMULT_TABLE_GET_GE_STORAGE(&tmpa, *ctx->pre_g_128, n, WINDOW_G);
+            secp256k1_gej_add_zinv_var(r, r, &tmpa, &Z);
+        }
+    }
+
+    if (!r->infinity) {
+        secp256k1_fe_mul(&r->z, &r->z, &Z);
+    }
+}
+
+static void secp256k1_ecmult(const secp256k1_ecmult_context *ctx, secp256k1_gej *r, const secp256k1_gej *a, const secp256k1_scalar *na, const secp256k1_scalar *ng) {
+    secp256k1_gej prej[ECMULT_TABLE_SIZE(WINDOW_A)];
+    secp256k1_fe zr[ECMULT_TABLE_SIZE(WINDOW_A)];
+    secp256k1_ge pre_a[ECMULT_TABLE_SIZE(WINDOW_A)];
+    struct secp256k1_strauss_point_state ps[1];
+    secp256k1_ge pre_a_lam[ECMULT_TABLE_SIZE(WINDOW_A)];
+    struct secp256k1_strauss_state state;
+
+    state.prej = prej;
+    state.zr = zr;
+    state.pre_a = pre_a;
+    state.pre_a_lam = pre_a_lam;
+    state.ps = ps;
+    secp256k1_ecmult_strauss_wnaf(ctx, &state, r, 1, a, na, ng);
+}
+
+static size_t secp256k1_strauss_scratch_size(size_t n_points) {
+    static const size_t point_size = (2 * sizeof(secp256k1_ge) + sizeof(secp256k1_gej) + sizeof(secp256k1_fe)) * ECMULT_TABLE_SIZE(WINDOW_A) + sizeof(struct secp256k1_strauss_point_state) + sizeof(secp256k1_gej) + sizeof(secp256k1_scalar);
+    return n_points*point_size;
+}
+
+static int secp256k1_ecmult_strauss_batch(const secp256k1_callback* error_callback, const secp256k1_ecmult_context *ctx, secp256k1_scratch *scratch, secp256k1_gej *r, const secp256k1_scalar *inp_g_sc, secp256k1_ecmult_multi_callback cb, void *cbdata, size_t n_points, size_t cb_offset) {
+    secp256k1_gej* points;
+    secp256k1_scalar* scalars;
+    struct secp256k1_strauss_state state;
+    size_t i;
+    const size_t scratch_checkpoint = secp256k1_scratch_checkpoint(error_callback, scratch);
+
+    secp256k1_gej_set_infinity(r);
+    if (inp_g_sc == NULL && n_points == 0) {
+        return 1;
+    }
+
+    points = (secp256k1_gej*)secp256k1_scratch_alloc(error_callback, scratch, n_points * sizeof(secp256k1_gej));
+    scalars = (secp256k1_scalar*)secp256k1_scratch_alloc(error_callback, scratch, n_points * sizeof(secp256k1_scalar));
+    state.prej = (secp256k1_gej*)secp256k1_scratch_alloc(error_callback, scratch, n_points * ECMULT_TABLE_SIZE(WINDOW_A) * sizeof(secp256k1_gej));
+    state.zr = (secp256k1_fe*)secp256k1_scratch_alloc(error_callback, scratch, n_points * ECMULT_TABLE_SIZE(WINDOW_A) * sizeof(secp256k1_fe));
+    state.pre_a = (secp256k1_ge*)secp256k1_scratch_alloc(error_callback, scratch, n_points * ECMULT_TABLE_SIZE(WINDOW_A) * sizeof(secp256k1_ge));
+    state.pre_a_lam = (secp256k1_ge*)secp256k1_scratch_alloc(error_callback, scratch, n_points * ECMULT_TABLE_SIZE(WINDOW_A) * sizeof(secp256k1_ge));
+    state.ps = (struct secp256k1_strauss_point_state*)secp256k1_scratch_alloc(error_callback, scratch, n_points * sizeof(struct secp256k1_strauss_point_state));
+
+    if (points == NULL || scalars == NULL || state.prej == NULL || state.zr == NULL || state.pre_a == NULL || state.pre_a_lam == NULL || state.ps == NULL) {
+        secp256k1_scratch_apply_checkpoint(error_callback, scratch, scratch_checkpoint);
+        return 0;
+    }
+
+    for (i = 0; i < n_points; i++) {
+        secp256k1_ge point;
+        if (!cb(&scalars[i], &point, i+cb_offset, cbdata)) {
+            secp256k1_scratch_apply_checkpoint(error_callback, scratch, scratch_checkpoint);
+            return 0;
+        }
+        secp256k1_gej_set_ge(&points[i], &point);
+    }
+    secp256k1_ecmult_strauss_wnaf(ctx, &state, r, n_points, points, scalars, inp_g_sc);
+    secp256k1_scratch_apply_checkpoint(error_callback, scratch, scratch_checkpoint);
+    return 1;
+}
+
+/* Wrapper for secp256k1_ecmult_multi_func interface */
+static int secp256k1_ecmult_strauss_batch_single(const secp256k1_callback* error_callback, const secp256k1_ecmult_context *actx, secp256k1_scratch *scratch, secp256k1_gej *r, const secp256k1_scalar *inp_g_sc, secp256k1_ecmult_multi_callback cb, void *cbdata, size_t n) {
+    return secp256k1_ecmult_strauss_batch(error_callback, actx, scratch, r, inp_g_sc, cb, cbdata, n, 0);
+}
+
+static size_t secp256k1_strauss_max_points(const secp256k1_callback* error_callback, secp256k1_scratch *scratch) {
+    return secp256k1_scratch_max_allocation(error_callback, scratch, STRAUSS_SCRATCH_OBJECTS) / secp256k1_strauss_scratch_size(1);
+}
+
+/** Convert a number to WNAF notation.
+ *  The number becomes represented by sum(2^{wi} * wnaf[i], i=0..WNAF_SIZE(w)+1) - return_val.
+ *  It has the following guarantees:
+ *  - each wnaf[i] is either 0 or an odd integer between -(1 << w) and (1 << w)
+ *  - the number of words set is always WNAF_SIZE(w)
+ *  - the returned skew is 0 or 1
+ */
+static int secp256k1_wnaf_fixed(int *wnaf, const secp256k1_scalar *s, int w) {
+    int skew = 0;
+    int pos;
+    int max_pos;
+    int last_w;
+    const secp256k1_scalar *work = s;
+
+    if (secp256k1_scalar_is_zero(s)) {
+        for (pos = 0; pos < WNAF_SIZE(w); pos++) {
+            wnaf[pos] = 0;
+        }
+        return 0;
+    }
+
+    if (secp256k1_scalar_is_even(s)) {
+        skew = 1;
+    }
+
+    wnaf[0] = secp256k1_scalar_get_bits_var(work, 0, w) + skew;
+    /* Compute last window size. Relevant when window size doesn't divide the
+     * number of bits in the scalar */
+    last_w = WNAF_BITS - (WNAF_SIZE(w) - 1) * w;
+
+    /* Store the position of the first nonzero word in max_pos to allow
+     * skipping leading zeros when calculating the wnaf. */
+    for (pos = WNAF_SIZE(w) - 1; pos > 0; pos--) {
+        int val = secp256k1_scalar_get_bits_var(work, pos * w, pos == WNAF_SIZE(w)-1 ? last_w : w);
+        if(val != 0) {
+            break;
+        }
+        wnaf[pos] = 0;
+    }
+    max_pos = pos;
+    pos = 1;
+
+    while (pos <= max_pos) {
+        int val = secp256k1_scalar_get_bits_var(work, pos * w, pos == WNAF_SIZE(w)-1 ? last_w : w);
+        if ((val & 1) == 0) {
+            wnaf[pos - 1] -= (1 << w);
+            wnaf[pos] = (val + 1);
+        } else {
+            wnaf[pos] = val;
+        }
+        /* Set a coefficient to zero if it is 1 or -1 and the proceeding digit
+         * is strictly negative or strictly positive respectively. Only change
+         * coefficients at previous positions because above code assumes that
+         * wnaf[pos - 1] is odd.
+         */
+        if (pos >= 2 && ((wnaf[pos - 1] == 1 && wnaf[pos - 2] < 0) || (wnaf[pos - 1] == -1 && wnaf[pos - 2] > 0))) {
+            if (wnaf[pos - 1] == 1) {
+                wnaf[pos - 2] += 1 << w;
+            } else {
+                wnaf[pos - 2] -= 1 << w;
+            }
+            wnaf[pos - 1] = 0;
+        }
+        ++pos;
+    }
+
+    return skew;
+}
+
+struct secp256k1_pippenger_point_state {
+    int skew_na;
+    size_t input_pos;
+};
+
+struct secp256k1_pippenger_state {
+    int *wnaf_na;
+    struct secp256k1_pippenger_point_state* ps;
+};
+
+/*
+ * pippenger_wnaf computes the result of a multi-point multiplication as
+ * follows: The scalars are brought into wnaf with n_wnaf elements each. Then
+ * for every i < n_wnaf, first each point is added to a "bucket" corresponding
+ * to the point's wnaf[i]. Second, the buckets are added together such that
+ * r += 1*bucket[0] + 3*bucket[1] + 5*bucket[2] + ...
+ */
+static int secp256k1_ecmult_pippenger_wnaf(secp256k1_gej *buckets, int bucket_window, struct secp256k1_pippenger_state *state, secp256k1_gej *r, const secp256k1_scalar *sc, const secp256k1_ge *pt, size_t num) {
+    size_t n_wnaf = WNAF_SIZE(bucket_window+1);
+    size_t np;
+    size_t no = 0;
+    int i;
+    int j;
+
+    for (np = 0; np < num; ++np) {
+        if (secp256k1_scalar_is_zero(&sc[np]) || secp256k1_ge_is_infinity(&pt[np])) {
+            continue;
+        }
+        state->ps[no].input_pos = np;
+        state->ps[no].skew_na = secp256k1_wnaf_fixed(&state->wnaf_na[no*n_wnaf], &sc[np], bucket_window+1);
+        no++;
+    }
+    secp256k1_gej_set_infinity(r);
+
+    if (no == 0) {
+        return 1;
+    }
+
+    for (i = n_wnaf - 1; i >= 0; i--) {
+        secp256k1_gej running_sum;
+
+        for(j = 0; j < ECMULT_TABLE_SIZE(bucket_window+2); j++) {
+            secp256k1_gej_set_infinity(&buckets[j]);
+        }
+
+        for (np = 0; np < no; ++np) {
+            int n = state->wnaf_na[np*n_wnaf + i];
+            struct secp256k1_pippenger_point_state point_state = state->ps[np];
+            secp256k1_ge tmp;
+            int idx;
+
+            if (i == 0) {
+                /* correct for wnaf skew */
+                int skew = point_state.skew_na;
+                if (skew) {
+                    secp256k1_ge_neg(&tmp, &pt[point_state.input_pos]);
+                    secp256k1_gej_add_ge_var(&buckets[0], &buckets[0], &tmp, NULL);
+                }
+            }
+            if (n > 0) {
+                idx = (n - 1)/2;
+                secp256k1_gej_add_ge_var(&buckets[idx], &buckets[idx], &pt[point_state.input_pos], NULL);
+            } else if (n < 0) {
+                idx = -(n + 1)/2;
+                secp256k1_ge_neg(&tmp, &pt[point_state.input_pos]);
+                secp256k1_gej_add_ge_var(&buckets[idx], &buckets[idx], &tmp, NULL);
+            }
+        }
+
+        for(j = 0; j < bucket_window; j++) {
+            secp256k1_gej_double_var(r, r, NULL);
+        }
+
+        secp256k1_gej_set_infinity(&running_sum);
+        /* Accumulate the sum: bucket[0] + 3*bucket[1] + 5*bucket[2] + 7*bucket[3] + ...
+         *                   = bucket[0] +   bucket[1] +   bucket[2] +   bucket[3] + ...
+         *                   +         2 *  (bucket[1] + 2*bucket[2] + 3*bucket[3] + ...)
+         * using an intermediate running sum:
+         * running_sum = bucket[0] +   bucket[1] +   bucket[2] + ...
+         *
+         * The doubling is done implicitly by deferring the final window doubling (of 'r').
+         */
+        for(j = ECMULT_TABLE_SIZE(bucket_window+2) - 1; j > 0; j--) {
+            secp256k1_gej_add_var(&running_sum, &running_sum, &buckets[j], NULL);
+            secp256k1_gej_add_var(r, r, &running_sum, NULL);
+        }
+
+        secp256k1_gej_add_var(&running_sum, &running_sum, &buckets[0], NULL);
+        secp256k1_gej_double_var(r, r, NULL);
+        secp256k1_gej_add_var(r, r, &running_sum, NULL);
+    }
+    return 1;
+}
+
+/**
+ * Returns optimal bucket_window (number of bits of a scalar represented by a
+ * set of buckets) for a given number of points.
+ */
+static int secp256k1_pippenger_bucket_window(size_t n) {
+    if (n <= 1) {
+        return 1;
+    } else if (n <= 4) {
+        return 2;
+    } else if (n <= 20) {
+        return 3;
+    } else if (n <= 57) {
+        return 4;
+    } else if (n <= 136) {
+        return 5;
+    } else if (n <= 235) {
+        return 6;
+    } else if (n <= 1260) {
+        return 7;
+    } else if (n <= 4420) {
+        return 9;
+    } else if (n <= 7880) {
+        return 10;
+    } else if (n <= 16050) {
+        return 11;
+    } else {
+        return PIPPENGER_MAX_BUCKET_WINDOW;
+    }
+}
+
+/**
+ * Returns the maximum optimal number of points for a bucket_window.
+ */
+static size_t secp256k1_pippenger_bucket_window_inv(int bucket_window) {
+    switch(bucket_window) {
+        case 1: return 1;
+        case 2: return 4;
+        case 3: return 20;
+        case 4: return 57;
+        case 5: return 136;
+        case 6: return 235;
+        case 7: return 1260;
+        case 8: return 1260;
+        case 9: return 4420;
+        case 10: return 7880;
+        case 11: return 16050;
+        case PIPPENGER_MAX_BUCKET_WINDOW: return SIZE_MAX;
+    }
+    return 0;
+}
+
+
+SECP256K1_INLINE static void secp256k1_ecmult_endo_split(secp256k1_scalar *s1, secp256k1_scalar *s2, secp256k1_ge *p1, secp256k1_ge *p2) {
+    secp256k1_scalar tmp = *s1;
+    secp256k1_scalar_split_lambda(s1, s2, &tmp);
+    secp256k1_ge_mul_lambda(p2, p1);
+
+    if (secp256k1_scalar_is_high(s1)) {
+        secp256k1_scalar_negate(s1, s1);
+        secp256k1_ge_neg(p1, p1);
+    }
+    if (secp256k1_scalar_is_high(s2)) {
+        secp256k1_scalar_negate(s2, s2);
+        secp256k1_ge_neg(p2, p2);
+    }
+}
+
+/**
+ * Returns the scratch size required for a given number of points (excluding
+ * base point G) without considering alignment.
+ */
+static size_t secp256k1_pippenger_scratch_size(size_t n_points, int bucket_window) {
+    size_t entries = 2*n_points + 2;
+    size_t entry_size = sizeof(secp256k1_ge) + sizeof(secp256k1_scalar) + sizeof(struct secp256k1_pippenger_point_state) + (WNAF_SIZE(bucket_window+1)+1)*sizeof(int);
+    return (sizeof(secp256k1_gej) << bucket_window) + sizeof(struct secp256k1_pippenger_state) + entries * entry_size;
+}
+
+static int secp256k1_ecmult_pippenger_batch(const secp256k1_callback* error_callback, const secp256k1_ecmult_context *ctx, secp256k1_scratch *scratch, secp256k1_gej *r, const secp256k1_scalar *inp_g_sc, secp256k1_ecmult_multi_callback cb, void *cbdata, size_t n_points, size_t cb_offset) {
+    const size_t scratch_checkpoint = secp256k1_scratch_checkpoint(error_callback, scratch);
+    /* Use 2(n+1) with the endomorphism, when calculating batch
+     * sizes. The reason for +1 is that we add the G scalar to the list of
+     * other scalars. */
+    size_t entries = 2*n_points + 2;
+    secp256k1_ge *points;
+    secp256k1_scalar *scalars;
+    secp256k1_gej *buckets;
+    struct secp256k1_pippenger_state *state_space;
+    size_t idx = 0;
+    size_t point_idx = 0;
+    int i, j;
+    int bucket_window;
+
+    (void)ctx;
+    secp256k1_gej_set_infinity(r);
+    if (inp_g_sc == NULL && n_points == 0) {
+        return 1;
+    }
+
+    bucket_window = secp256k1_pippenger_bucket_window(n_points);
+    points = (secp256k1_ge *) secp256k1_scratch_alloc(error_callback, scratch, entries * sizeof(*points));
+    scalars = (secp256k1_scalar *) secp256k1_scratch_alloc(error_callback, scratch, entries * sizeof(*scalars));
+    state_space = (struct secp256k1_pippenger_state *) secp256k1_scratch_alloc(error_callback, scratch, sizeof(*state_space));
+    if (points == NULL || scalars == NULL || state_space == NULL) {
+        secp256k1_scratch_apply_checkpoint(error_callback, scratch, scratch_checkpoint);
+        return 0;
+    }
+
+    state_space->ps = (struct secp256k1_pippenger_point_state *) secp256k1_scratch_alloc(error_callback, scratch, entries * sizeof(*state_space->ps));
+    state_space->wnaf_na = (int *) secp256k1_scratch_alloc(error_callback, scratch, entries*(WNAF_SIZE(bucket_window+1)) * sizeof(int));
+    buckets = (secp256k1_gej *) secp256k1_scratch_alloc(error_callback, scratch, (1<<bucket_window) * sizeof(*buckets));
+    if (state_space->ps == NULL || state_space->wnaf_na == NULL || buckets == NULL) {
+        secp256k1_scratch_apply_checkpoint(error_callback, scratch, scratch_checkpoint);
+        return 0;
+    }
+
+    if (inp_g_sc != NULL) {
+        scalars[0] = *inp_g_sc;
+        points[0] = secp256k1_ge_const_g;
+        idx++;
+        secp256k1_ecmult_endo_split(&scalars[0], &scalars[1], &points[0], &points[1]);
+        idx++;
+    }
+
+    while (point_idx < n_points) {
+        if (!cb(&scalars[idx], &points[idx], point_idx + cb_offset, cbdata)) {
+            secp256k1_scratch_apply_checkpoint(error_callback, scratch, scratch_checkpoint);
+            return 0;
+        }
+        idx++;
+        secp256k1_ecmult_endo_split(&scalars[idx - 1], &scalars[idx], &points[idx - 1], &points[idx]);
+        idx++;
+        point_idx++;
+    }
+
+    secp256k1_ecmult_pippenger_wnaf(buckets, bucket_window, state_space, r, scalars, points, idx);
+
+    /* Clear data */
+    for(i = 0; (size_t)i < idx; i++) {
+        secp256k1_scalar_clear(&scalars[i]);
+        state_space->ps[i].skew_na = 0;
+        for(j = 0; j < WNAF_SIZE(bucket_window+1); j++) {
+            state_space->wnaf_na[i * WNAF_SIZE(bucket_window+1) + j] = 0;
+        }
+    }
+    for(i = 0; i < 1<<bucket_window; i++) {
+        secp256k1_gej_clear(&buckets[i]);
+    }
+    secp256k1_scratch_apply_checkpoint(error_callback, scratch, scratch_checkpoint);
+    return 1;
+}
+
+/* Wrapper for secp256k1_ecmult_multi_func interface */
+static int secp256k1_ecmult_pippenger_batch_single(const secp256k1_callback* error_callback, const secp256k1_ecmult_context *actx, secp256k1_scratch *scratch, secp256k1_gej *r, const secp256k1_scalar *inp_g_sc, secp256k1_ecmult_multi_callback cb, void *cbdata, size_t n) {
+    return secp256k1_ecmult_pippenger_batch(error_callback, actx, scratch, r, inp_g_sc, cb, cbdata, n, 0);
+}
+
+/**
+ * Returns the maximum number of points in addition to G that can be used with
+ * a given scratch space. The function ensures that fewer points may also be
+ * used.
+ */
+static size_t secp256k1_pippenger_max_points(const secp256k1_callback* error_callback, secp256k1_scratch *scratch) {
+    size_t max_alloc = secp256k1_scratch_max_allocation(error_callback, scratch, PIPPENGER_SCRATCH_OBJECTS);
+    int bucket_window;
+    size_t res = 0;
+
+    for (bucket_window = 1; bucket_window <= PIPPENGER_MAX_BUCKET_WINDOW; bucket_window++) {
+        size_t n_points;
+        size_t max_points = secp256k1_pippenger_bucket_window_inv(bucket_window);
+        size_t space_for_points;
+        size_t space_overhead;
+        size_t entry_size = sizeof(secp256k1_ge) + sizeof(secp256k1_scalar) + sizeof(struct secp256k1_pippenger_point_state) + (WNAF_SIZE(bucket_window+1)+1)*sizeof(int);
+
+        entry_size = 2*entry_size;
+        space_overhead = (sizeof(secp256k1_gej) << bucket_window) + entry_size + sizeof(struct secp256k1_pippenger_state);
+        if (space_overhead > max_alloc) {
+            break;
+        }
+        space_for_points = max_alloc - space_overhead;
+
+        n_points = space_for_points/entry_size;
+        n_points = n_points > max_points ? max_points : n_points;
+        if (n_points > res) {
+            res = n_points;
+        }
+        if (n_points < max_points) {
+            /* A larger bucket_window may support even more points. But if we
+             * would choose that then the caller couldn't safely use any number
+             * smaller than what this function returns */
+            break;
+        }
+    }
+    return res;
+}
+
+/* Computes ecmult_multi by simply multiplying and adding each point. Does not
+ * require a scratch space */
+static int secp256k1_ecmult_multi_simple_var(const secp256k1_ecmult_context *ctx, secp256k1_gej *r, const secp256k1_scalar *inp_g_sc, secp256k1_ecmult_multi_callback cb, void *cbdata, size_t n_points) {
+    size_t point_idx;
+    secp256k1_scalar szero;
+    secp256k1_gej tmpj;
+
+    secp256k1_scalar_set_int(&szero, 0);
+    secp256k1_gej_set_infinity(r);
+    secp256k1_gej_set_infinity(&tmpj);
+    /* r = inp_g_sc*G */
+    secp256k1_ecmult(ctx, r, &tmpj, &szero, inp_g_sc);
+    for (point_idx = 0; point_idx < n_points; point_idx++) {
+        secp256k1_ge point;
+        secp256k1_gej pointj;
+        secp256k1_scalar scalar;
+        if (!cb(&scalar, &point, point_idx, cbdata)) {
+            return 0;
+        }
+        /* r += scalar*point */
+        secp256k1_gej_set_ge(&pointj, &point);
+        secp256k1_ecmult(ctx, &tmpj, &pointj, &scalar, NULL);
+        secp256k1_gej_add_var(r, r, &tmpj, NULL);
+    }
+    return 1;
+}
+
+/* Compute the number of batches and the batch size given the maximum batch size and the
+ * total number of points */
+static int secp256k1_ecmult_multi_batch_size_helper(size_t *n_batches, size_t *n_batch_points, size_t max_n_batch_points, size_t n) {
+    if (max_n_batch_points == 0) {
+        return 0;
+    }
+    if (max_n_batch_points > ECMULT_MAX_POINTS_PER_BATCH) {
+        max_n_batch_points = ECMULT_MAX_POINTS_PER_BATCH;
+    }
+    if (n == 0) {
+        *n_batches = 0;
+        *n_batch_points = 0;
+        return 1;
+    }
+    /* Compute ceil(n/max_n_batch_points) and ceil(n/n_batches) */
+    *n_batches = 1 + (n - 1) / max_n_batch_points;
+    *n_batch_points = 1 + (n - 1) / *n_batches;
+    return 1;
+}
+
+typedef int (*secp256k1_ecmult_multi_func)(const secp256k1_callback* error_callback, const secp256k1_ecmult_context*, secp256k1_scratch*, secp256k1_gej*, const secp256k1_scalar*, secp256k1_ecmult_multi_callback cb, void*, size_t);
+static int secp256k1_ecmult_multi_var(const secp256k1_callback* error_callback, const secp256k1_ecmult_context *ctx, secp256k1_scratch *scratch, secp256k1_gej *r, const secp256k1_scalar *inp_g_sc, secp256k1_ecmult_multi_callback cb, void *cbdata, size_t n) {
+    size_t i;
+
+    int (*f)(const secp256k1_callback* error_callback, const secp256k1_ecmult_context*, secp256k1_scratch*, secp256k1_gej*, const secp256k1_scalar*, secp256k1_ecmult_multi_callback cb, void*, size_t, size_t);
+    size_t n_batches;
+    size_t n_batch_points;
+
+    secp256k1_gej_set_infinity(r);
+    if (inp_g_sc == NULL && n == 0) {
+        return 1;
+    } else if (n == 0) {
+        secp256k1_scalar szero;
+        secp256k1_scalar_set_int(&szero, 0);
+        secp256k1_ecmult(ctx, r, r, &szero, inp_g_sc);
+        return 1;
+    }
+    if (scratch == NULL) {
+        return secp256k1_ecmult_multi_simple_var(ctx, r, inp_g_sc, cb, cbdata, n);
+    }
+
+    /* Compute the batch sizes for Pippenger's algorithm given a scratch space. If it's greater than
+     * a threshold use Pippenger's algorithm. Otherwise use Strauss' algorithm.
+     * As a first step check if there's enough space for Pippenger's algo (which requires less space
+     * than Strauss' algo) and if not, use the simple algorithm. */
+    if (!secp256k1_ecmult_multi_batch_size_helper(&n_batches, &n_batch_points, secp256k1_pippenger_max_points(error_callback, scratch), n)) {
+        return secp256k1_ecmult_multi_simple_var(ctx, r, inp_g_sc, cb, cbdata, n);
+    }
+    if (n_batch_points >= ECMULT_PIPPENGER_THRESHOLD) {
+        f = secp256k1_ecmult_pippenger_batch;
+    } else {
+        if (!secp256k1_ecmult_multi_batch_size_helper(&n_batches, &n_batch_points, secp256k1_strauss_max_points(error_callback, scratch), n)) {
+            return secp256k1_ecmult_multi_simple_var(ctx, r, inp_g_sc, cb, cbdata, n);
+        }
+        f = secp256k1_ecmult_strauss_batch;
+    }
+    for(i = 0; i < n_batches; i++) {
+        size_t nbp = n < n_batch_points ? n : n_batch_points;
+        size_t offset = n_batch_points*i;
+        secp256k1_gej tmp;
+        if (!f(error_callback, ctx, scratch, &tmp, i == 0 ? inp_g_sc : NULL, cb, cbdata, nbp, offset)) {
+            return 0;
+        }
+        secp256k1_gej_add_var(r, r, &tmp, NULL);
+        n -= nbp;
+    }
+    return 1;
+}
+
+#endif /* SECP256K1_ECMULT_IMPL_H */
diff --git a/depend/zcash/src/secp256k1/src/field.h b/depend/zcash/src/secp256k1/src/field.h
new file mode 100644
index 000000000..ee222ee5d
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/field.h
@@ -0,0 +1,129 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_FIELD_H
+#define SECP256K1_FIELD_H
+
+/** Field element module.
+ *
+ *  Field elements can be represented in several ways, but code accessing
+ *  it (and implementations) need to take certain properties into account:
+ *  - Each field element can be normalized or not.
+ *  - Each field element has a magnitude, which represents how far away
+ *    its representation is away from normalization. Normalized elements
+ *    always have a magnitude of 1, but a magnitude of 1 doesn't imply
+ *    normality.
+ */
+
+#if defined HAVE_CONFIG_H
+#include "libsecp256k1-config.h"
+#endif
+
+#include "util.h"
+
+#if defined(SECP256K1_WIDEMUL_INT128)
+#include "field_5x52.h"
+#elif defined(SECP256K1_WIDEMUL_INT64)
+#include "field_10x26.h"
+#else
+#error "Please select wide multiplication implementation"
+#endif
+
+/** Normalize a field element. This brings the field element to a canonical representation, reduces
+ *  its magnitude to 1, and reduces it modulo field size `p`.
+ */
+static void secp256k1_fe_normalize(secp256k1_fe *r);
+
+/** Weakly normalize a field element: reduce its magnitude to 1, but don't fully normalize. */
+static void secp256k1_fe_normalize_weak(secp256k1_fe *r);
+
+/** Normalize a field element, without constant-time guarantee. */
+static void secp256k1_fe_normalize_var(secp256k1_fe *r);
+
+/** Verify whether a field element represents zero i.e. would normalize to a zero value. The field
+ *  implementation may optionally normalize the input, but this should not be relied upon. */
+static int secp256k1_fe_normalizes_to_zero(secp256k1_fe *r);
+
+/** Verify whether a field element represents zero i.e. would normalize to a zero value. The field
+ *  implementation may optionally normalize the input, but this should not be relied upon. */
+static int secp256k1_fe_normalizes_to_zero_var(secp256k1_fe *r);
+
+/** Set a field element equal to a small integer. Resulting field element is normalized. */
+static void secp256k1_fe_set_int(secp256k1_fe *r, int a);
+
+/** Sets a field element equal to zero, initializing all fields. */
+static void secp256k1_fe_clear(secp256k1_fe *a);
+
+/** Verify whether a field element is zero. Requires the input to be normalized. */
+static int secp256k1_fe_is_zero(const secp256k1_fe *a);
+
+/** Check the "oddness" of a field element. Requires the input to be normalized. */
+static int secp256k1_fe_is_odd(const secp256k1_fe *a);
+
+/** Compare two field elements. Requires magnitude-1 inputs. */
+static int secp256k1_fe_equal(const secp256k1_fe *a, const secp256k1_fe *b);
+
+/** Same as secp256k1_fe_equal, but may be variable time. */
+static int secp256k1_fe_equal_var(const secp256k1_fe *a, const secp256k1_fe *b);
+
+/** Compare two field elements. Requires both inputs to be normalized */
+static int secp256k1_fe_cmp_var(const secp256k1_fe *a, const secp256k1_fe *b);
+
+/** Set a field element equal to 32-byte big endian value. If successful, the resulting field element is normalized. */
+static int secp256k1_fe_set_b32(secp256k1_fe *r, const unsigned char *a);
+
+/** Convert a field element to a 32-byte big endian value. Requires the input to be normalized */
+static void secp256k1_fe_get_b32(unsigned char *r, const secp256k1_fe *a);
+
+/** Set a field element equal to the additive inverse of another. Takes a maximum magnitude of the input
+ *  as an argument. The magnitude of the output is one higher. */
+static void secp256k1_fe_negate(secp256k1_fe *r, const secp256k1_fe *a, int m);
+
+/** Multiplies the passed field element with a small integer constant. Multiplies the magnitude by that
+ *  small integer. */
+static void secp256k1_fe_mul_int(secp256k1_fe *r, int a);
+
+/** Adds a field element to another. The result has the sum of the inputs' magnitudes as magnitude. */
+static void secp256k1_fe_add(secp256k1_fe *r, const secp256k1_fe *a);
+
+/** Sets a field element to be the product of two others. Requires the inputs' magnitudes to be at most 8.
+ *  The output magnitude is 1 (but not guaranteed to be normalized). */
+static void secp256k1_fe_mul(secp256k1_fe *r, const secp256k1_fe *a, const secp256k1_fe * SECP256K1_RESTRICT b);
+
+/** Sets a field element to be the square of another. Requires the input's magnitude to be at most 8.
+ *  The output magnitude is 1 (but not guaranteed to be normalized). */
+static void secp256k1_fe_sqr(secp256k1_fe *r, const secp256k1_fe *a);
+
+/** If a has a square root, it is computed in r and 1 is returned. If a does not
+ *  have a square root, the root of its negation is computed and 0 is returned.
+ *  The input's magnitude can be at most 8. The output magnitude is 1 (but not
+ *  guaranteed to be normalized). The result in r will always be a square
+ *  itself. */
+static int secp256k1_fe_sqrt(secp256k1_fe *r, const secp256k1_fe *a);
+
+/** Checks whether a field element is a quadratic residue. */
+static int secp256k1_fe_is_quad_var(const secp256k1_fe *a);
+
+/** Sets a field element to be the (modular) inverse of another. Requires the input's magnitude to be
+ *  at most 8. The output magnitude is 1 (but not guaranteed to be normalized). */
+static void secp256k1_fe_inv(secp256k1_fe *r, const secp256k1_fe *a);
+
+/** Potentially faster version of secp256k1_fe_inv, without constant-time guarantee. */
+static void secp256k1_fe_inv_var(secp256k1_fe *r, const secp256k1_fe *a);
+
+/** Convert a field element to the storage type. */
+static void secp256k1_fe_to_storage(secp256k1_fe_storage *r, const secp256k1_fe *a);
+
+/** Convert a field element back from the storage type. */
+static void secp256k1_fe_from_storage(secp256k1_fe *r, const secp256k1_fe_storage *a);
+
+/** If flag is true, set *r equal to *a; otherwise leave it. Constant-time.  Both *r and *a must be initialized.*/
+static void secp256k1_fe_storage_cmov(secp256k1_fe_storage *r, const secp256k1_fe_storage *a, int flag);
+
+/** If flag is true, set *r equal to *a; otherwise leave it. Constant-time.  Both *r and *a must be initialized.*/
+static void secp256k1_fe_cmov(secp256k1_fe *r, const secp256k1_fe *a, int flag);
+
+#endif /* SECP256K1_FIELD_H */
diff --git a/depend/zcash/src/secp256k1/src/field_10x26.h b/depend/zcash/src/secp256k1/src/field_10x26.h
new file mode 100644
index 000000000..9eb65607f
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/field_10x26.h
@@ -0,0 +1,50 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_FIELD_REPR_H
+#define SECP256K1_FIELD_REPR_H
+
+#include <stdint.h>
+
+typedef struct {
+    /* X = sum(i=0..9, n[i]*2^(i*26)) mod p
+     * where p = 2^256 - 0x1000003D1
+     */
+    uint32_t n[10];
+#ifdef VERIFY
+    int magnitude;
+    int normalized;
+#endif
+} secp256k1_fe;
+
+/* Unpacks a constant into a overlapping multi-limbed FE element. */
+#define SECP256K1_FE_CONST_INNER(d7, d6, d5, d4, d3, d2, d1, d0) { \
+    (d0) & 0x3FFFFFFUL, \
+    (((uint32_t)d0) >> 26) | (((uint32_t)(d1) & 0xFFFFFUL) << 6), \
+    (((uint32_t)d1) >> 20) | (((uint32_t)(d2) & 0x3FFFUL) << 12), \
+    (((uint32_t)d2) >> 14) | (((uint32_t)(d3) & 0xFFUL) << 18), \
+    (((uint32_t)d3) >> 8) | (((uint32_t)(d4) & 0x3UL) << 24), \
+    (((uint32_t)d4) >> 2) & 0x3FFFFFFUL, \
+    (((uint32_t)d4) >> 28) | (((uint32_t)(d5) & 0x3FFFFFUL) << 4), \
+    (((uint32_t)d5) >> 22) | (((uint32_t)(d6) & 0xFFFFUL) << 10), \
+    (((uint32_t)d6) >> 16) | (((uint32_t)(d7) & 0x3FFUL) << 16), \
+    (((uint32_t)d7) >> 10) \
+}
+
+#ifdef VERIFY
+#define SECP256K1_FE_CONST(d7, d6, d5, d4, d3, d2, d1, d0) {SECP256K1_FE_CONST_INNER((d7), (d6), (d5), (d4), (d3), (d2), (d1), (d0)), 1, 1}
+#else
+#define SECP256K1_FE_CONST(d7, d6, d5, d4, d3, d2, d1, d0) {SECP256K1_FE_CONST_INNER((d7), (d6), (d5), (d4), (d3), (d2), (d1), (d0))}
+#endif
+
+typedef struct {
+    uint32_t n[8];
+} secp256k1_fe_storage;
+
+#define SECP256K1_FE_STORAGE_CONST(d7, d6, d5, d4, d3, d2, d1, d0) {{ (d0), (d1), (d2), (d3), (d4), (d5), (d6), (d7) }}
+#define SECP256K1_FE_STORAGE_CONST_GET(d) d.n[7], d.n[6], d.n[5], d.n[4],d.n[3], d.n[2], d.n[1], d.n[0]
+
+#endif /* SECP256K1_FIELD_REPR_H */
diff --git a/depend/zcash/src/secp256k1/src/field_10x26_impl.h b/depend/zcash/src/secp256k1/src/field_10x26_impl.h
new file mode 100644
index 000000000..62bffdc21
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/field_10x26_impl.h
@@ -0,0 +1,1167 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_FIELD_REPR_IMPL_H
+#define SECP256K1_FIELD_REPR_IMPL_H
+
+#include "util.h"
+#include "field.h"
+
+#ifdef VERIFY
+static void secp256k1_fe_verify(const secp256k1_fe *a) {
+    const uint32_t *d = a->n;
+    int m = a->normalized ? 1 : 2 * a->magnitude, r = 1;
+    r &= (d[0] <= 0x3FFFFFFUL * m);
+    r &= (d[1] <= 0x3FFFFFFUL * m);
+    r &= (d[2] <= 0x3FFFFFFUL * m);
+    r &= (d[3] <= 0x3FFFFFFUL * m);
+    r &= (d[4] <= 0x3FFFFFFUL * m);
+    r &= (d[5] <= 0x3FFFFFFUL * m);
+    r &= (d[6] <= 0x3FFFFFFUL * m);
+    r &= (d[7] <= 0x3FFFFFFUL * m);
+    r &= (d[8] <= 0x3FFFFFFUL * m);
+    r &= (d[9] <= 0x03FFFFFUL * m);
+    r &= (a->magnitude >= 0);
+    r &= (a->magnitude <= 32);
+    if (a->normalized) {
+        r &= (a->magnitude <= 1);
+        if (r && (d[9] == 0x03FFFFFUL)) {
+            uint32_t mid = d[8] & d[7] & d[6] & d[5] & d[4] & d[3] & d[2];
+            if (mid == 0x3FFFFFFUL) {
+                r &= ((d[1] + 0x40UL + ((d[0] + 0x3D1UL) >> 26)) <= 0x3FFFFFFUL);
+            }
+        }
+    }
+    VERIFY_CHECK(r == 1);
+}
+#endif
+
+static void secp256k1_fe_normalize(secp256k1_fe *r) {
+    uint32_t t0 = r->n[0], t1 = r->n[1], t2 = r->n[2], t3 = r->n[3], t4 = r->n[4],
+             t5 = r->n[5], t6 = r->n[6], t7 = r->n[7], t8 = r->n[8], t9 = r->n[9];
+
+    /* Reduce t9 at the start so there will be at most a single carry from the first pass */
+    uint32_t m;
+    uint32_t x = t9 >> 22; t9 &= 0x03FFFFFUL;
+
+    /* The first pass ensures the magnitude is 1, ... */
+    t0 += x * 0x3D1UL; t1 += (x << 6);
+    t1 += (t0 >> 26); t0 &= 0x3FFFFFFUL;
+    t2 += (t1 >> 26); t1 &= 0x3FFFFFFUL;
+    t3 += (t2 >> 26); t2 &= 0x3FFFFFFUL; m = t2;
+    t4 += (t3 >> 26); t3 &= 0x3FFFFFFUL; m &= t3;
+    t5 += (t4 >> 26); t4 &= 0x3FFFFFFUL; m &= t4;
+    t6 += (t5 >> 26); t5 &= 0x3FFFFFFUL; m &= t5;
+    t7 += (t6 >> 26); t6 &= 0x3FFFFFFUL; m &= t6;
+    t8 += (t7 >> 26); t7 &= 0x3FFFFFFUL; m &= t7;
+    t9 += (t8 >> 26); t8 &= 0x3FFFFFFUL; m &= t8;
+
+    /* ... except for a possible carry at bit 22 of t9 (i.e. bit 256 of the field element) */
+    VERIFY_CHECK(t9 >> 23 == 0);
+
+    /* At most a single final reduction is needed; check if the value is >= the field characteristic */
+    x = (t9 >> 22) | ((t9 == 0x03FFFFFUL) & (m == 0x3FFFFFFUL)
+        & ((t1 + 0x40UL + ((t0 + 0x3D1UL) >> 26)) > 0x3FFFFFFUL));
+
+    /* Apply the final reduction (for constant-time behaviour, we do it always) */
+    t0 += x * 0x3D1UL; t1 += (x << 6);
+    t1 += (t0 >> 26); t0 &= 0x3FFFFFFUL;
+    t2 += (t1 >> 26); t1 &= 0x3FFFFFFUL;
+    t3 += (t2 >> 26); t2 &= 0x3FFFFFFUL;
+    t4 += (t3 >> 26); t3 &= 0x3FFFFFFUL;
+    t5 += (t4 >> 26); t4 &= 0x3FFFFFFUL;
+    t6 += (t5 >> 26); t5 &= 0x3FFFFFFUL;
+    t7 += (t6 >> 26); t6 &= 0x3FFFFFFUL;
+    t8 += (t7 >> 26); t7 &= 0x3FFFFFFUL;
+    t9 += (t8 >> 26); t8 &= 0x3FFFFFFUL;
+
+    /* If t9 didn't carry to bit 22 already, then it should have after any final reduction */
+    VERIFY_CHECK(t9 >> 22 == x);
+
+    /* Mask off the possible multiple of 2^256 from the final reduction */
+    t9 &= 0x03FFFFFUL;
+
+    r->n[0] = t0; r->n[1] = t1; r->n[2] = t2; r->n[3] = t3; r->n[4] = t4;
+    r->n[5] = t5; r->n[6] = t6; r->n[7] = t7; r->n[8] = t8; r->n[9] = t9;
+
+#ifdef VERIFY
+    r->magnitude = 1;
+    r->normalized = 1;
+    secp256k1_fe_verify(r);
+#endif
+}
+
+static void secp256k1_fe_normalize_weak(secp256k1_fe *r) {
+    uint32_t t0 = r->n[0], t1 = r->n[1], t2 = r->n[2], t3 = r->n[3], t4 = r->n[4],
+             t5 = r->n[5], t6 = r->n[6], t7 = r->n[7], t8 = r->n[8], t9 = r->n[9];
+
+    /* Reduce t9 at the start so there will be at most a single carry from the first pass */
+    uint32_t x = t9 >> 22; t9 &= 0x03FFFFFUL;
+
+    /* The first pass ensures the magnitude is 1, ... */
+    t0 += x * 0x3D1UL; t1 += (x << 6);
+    t1 += (t0 >> 26); t0 &= 0x3FFFFFFUL;
+    t2 += (t1 >> 26); t1 &= 0x3FFFFFFUL;
+    t3 += (t2 >> 26); t2 &= 0x3FFFFFFUL;
+    t4 += (t3 >> 26); t3 &= 0x3FFFFFFUL;
+    t5 += (t4 >> 26); t4 &= 0x3FFFFFFUL;
+    t6 += (t5 >> 26); t5 &= 0x3FFFFFFUL;
+    t7 += (t6 >> 26); t6 &= 0x3FFFFFFUL;
+    t8 += (t7 >> 26); t7 &= 0x3FFFFFFUL;
+    t9 += (t8 >> 26); t8 &= 0x3FFFFFFUL;
+
+    /* ... except for a possible carry at bit 22 of t9 (i.e. bit 256 of the field element) */
+    VERIFY_CHECK(t9 >> 23 == 0);
+
+    r->n[0] = t0; r->n[1] = t1; r->n[2] = t2; r->n[3] = t3; r->n[4] = t4;
+    r->n[5] = t5; r->n[6] = t6; r->n[7] = t7; r->n[8] = t8; r->n[9] = t9;
+
+#ifdef VERIFY
+    r->magnitude = 1;
+    secp256k1_fe_verify(r);
+#endif
+}
+
+static void secp256k1_fe_normalize_var(secp256k1_fe *r) {
+    uint32_t t0 = r->n[0], t1 = r->n[1], t2 = r->n[2], t3 = r->n[3], t4 = r->n[4],
+             t5 = r->n[5], t6 = r->n[6], t7 = r->n[7], t8 = r->n[8], t9 = r->n[9];
+
+    /* Reduce t9 at the start so there will be at most a single carry from the first pass */
+    uint32_t m;
+    uint32_t x = t9 >> 22; t9 &= 0x03FFFFFUL;
+
+    /* The first pass ensures the magnitude is 1, ... */
+    t0 += x * 0x3D1UL; t1 += (x << 6);
+    t1 += (t0 >> 26); t0 &= 0x3FFFFFFUL;
+    t2 += (t1 >> 26); t1 &= 0x3FFFFFFUL;
+    t3 += (t2 >> 26); t2 &= 0x3FFFFFFUL; m = t2;
+    t4 += (t3 >> 26); t3 &= 0x3FFFFFFUL; m &= t3;
+    t5 += (t4 >> 26); t4 &= 0x3FFFFFFUL; m &= t4;
+    t6 += (t5 >> 26); t5 &= 0x3FFFFFFUL; m &= t5;
+    t7 += (t6 >> 26); t6 &= 0x3FFFFFFUL; m &= t6;
+    t8 += (t7 >> 26); t7 &= 0x3FFFFFFUL; m &= t7;
+    t9 += (t8 >> 26); t8 &= 0x3FFFFFFUL; m &= t8;
+
+    /* ... except for a possible carry at bit 22 of t9 (i.e. bit 256 of the field element) */
+    VERIFY_CHECK(t9 >> 23 == 0);
+
+    /* At most a single final reduction is needed; check if the value is >= the field characteristic */
+    x = (t9 >> 22) | ((t9 == 0x03FFFFFUL) & (m == 0x3FFFFFFUL)
+        & ((t1 + 0x40UL + ((t0 + 0x3D1UL) >> 26)) > 0x3FFFFFFUL));
+
+    if (x) {
+        t0 += 0x3D1UL; t1 += (x << 6);
+        t1 += (t0 >> 26); t0 &= 0x3FFFFFFUL;
+        t2 += (t1 >> 26); t1 &= 0x3FFFFFFUL;
+        t3 += (t2 >> 26); t2 &= 0x3FFFFFFUL;
+        t4 += (t3 >> 26); t3 &= 0x3FFFFFFUL;
+        t5 += (t4 >> 26); t4 &= 0x3FFFFFFUL;
+        t6 += (t5 >> 26); t5 &= 0x3FFFFFFUL;
+        t7 += (t6 >> 26); t6 &= 0x3FFFFFFUL;
+        t8 += (t7 >> 26); t7 &= 0x3FFFFFFUL;
+        t9 += (t8 >> 26); t8 &= 0x3FFFFFFUL;
+
+        /* If t9 didn't carry to bit 22 already, then it should have after any final reduction */
+        VERIFY_CHECK(t9 >> 22 == x);
+
+        /* Mask off the possible multiple of 2^256 from the final reduction */
+        t9 &= 0x03FFFFFUL;
+    }
+
+    r->n[0] = t0; r->n[1] = t1; r->n[2] = t2; r->n[3] = t3; r->n[4] = t4;
+    r->n[5] = t5; r->n[6] = t6; r->n[7] = t7; r->n[8] = t8; r->n[9] = t9;
+
+#ifdef VERIFY
+    r->magnitude = 1;
+    r->normalized = 1;
+    secp256k1_fe_verify(r);
+#endif
+}
+
+static int secp256k1_fe_normalizes_to_zero(secp256k1_fe *r) {
+    uint32_t t0 = r->n[0], t1 = r->n[1], t2 = r->n[2], t3 = r->n[3], t4 = r->n[4],
+             t5 = r->n[5], t6 = r->n[6], t7 = r->n[7], t8 = r->n[8], t9 = r->n[9];
+
+    /* z0 tracks a possible raw value of 0, z1 tracks a possible raw value of P */
+    uint32_t z0, z1;
+
+    /* Reduce t9 at the start so there will be at most a single carry from the first pass */
+    uint32_t x = t9 >> 22; t9 &= 0x03FFFFFUL;
+
+    /* The first pass ensures the magnitude is 1, ... */
+    t0 += x * 0x3D1UL; t1 += (x << 6);
+    t1 += (t0 >> 26); t0 &= 0x3FFFFFFUL; z0  = t0; z1  = t0 ^ 0x3D0UL;
+    t2 += (t1 >> 26); t1 &= 0x3FFFFFFUL; z0 |= t1; z1 &= t1 ^ 0x40UL;
+    t3 += (t2 >> 26); t2 &= 0x3FFFFFFUL; z0 |= t2; z1 &= t2;
+    t4 += (t3 >> 26); t3 &= 0x3FFFFFFUL; z0 |= t3; z1 &= t3;
+    t5 += (t4 >> 26); t4 &= 0x3FFFFFFUL; z0 |= t4; z1 &= t4;
+    t6 += (t5 >> 26); t5 &= 0x3FFFFFFUL; z0 |= t5; z1 &= t5;
+    t7 += (t6 >> 26); t6 &= 0x3FFFFFFUL; z0 |= t6; z1 &= t6;
+    t8 += (t7 >> 26); t7 &= 0x3FFFFFFUL; z0 |= t7; z1 &= t7;
+    t9 += (t8 >> 26); t8 &= 0x3FFFFFFUL; z0 |= t8; z1 &= t8;
+                                         z0 |= t9; z1 &= t9 ^ 0x3C00000UL;
+
+    /* ... except for a possible carry at bit 22 of t9 (i.e. bit 256 of the field element) */
+    VERIFY_CHECK(t9 >> 23 == 0);
+
+    return (z0 == 0) | (z1 == 0x3FFFFFFUL);
+}
+
+static int secp256k1_fe_normalizes_to_zero_var(secp256k1_fe *r) {
+    uint32_t t0, t1, t2, t3, t4, t5, t6, t7, t8, t9;
+    uint32_t z0, z1;
+    uint32_t x;
+
+    t0 = r->n[0];
+    t9 = r->n[9];
+
+    /* Reduce t9 at the start so there will be at most a single carry from the first pass */
+    x = t9 >> 22;
+
+    /* The first pass ensures the magnitude is 1, ... */
+    t0 += x * 0x3D1UL;
+
+    /* z0 tracks a possible raw value of 0, z1 tracks a possible raw value of P */
+    z0 = t0 & 0x3FFFFFFUL;
+    z1 = z0 ^ 0x3D0UL;
+
+    /* Fast return path should catch the majority of cases */
+    if ((z0 != 0UL) & (z1 != 0x3FFFFFFUL)) {
+        return 0;
+    }
+
+    t1 = r->n[1];
+    t2 = r->n[2];
+    t3 = r->n[3];
+    t4 = r->n[4];
+    t5 = r->n[5];
+    t6 = r->n[6];
+    t7 = r->n[7];
+    t8 = r->n[8];
+
+    t9 &= 0x03FFFFFUL;
+    t1 += (x << 6);
+
+    t1 += (t0 >> 26);
+    t2 += (t1 >> 26); t1 &= 0x3FFFFFFUL; z0 |= t1; z1 &= t1 ^ 0x40UL;
+    t3 += (t2 >> 26); t2 &= 0x3FFFFFFUL; z0 |= t2; z1 &= t2;
+    t4 += (t3 >> 26); t3 &= 0x3FFFFFFUL; z0 |= t3; z1 &= t3;
+    t5 += (t4 >> 26); t4 &= 0x3FFFFFFUL; z0 |= t4; z1 &= t4;
+    t6 += (t5 >> 26); t5 &= 0x3FFFFFFUL; z0 |= t5; z1 &= t5;
+    t7 += (t6 >> 26); t6 &= 0x3FFFFFFUL; z0 |= t6; z1 &= t6;
+    t8 += (t7 >> 26); t7 &= 0x3FFFFFFUL; z0 |= t7; z1 &= t7;
+    t9 += (t8 >> 26); t8 &= 0x3FFFFFFUL; z0 |= t8; z1 &= t8;
+                                         z0 |= t9; z1 &= t9 ^ 0x3C00000UL;
+
+    /* ... except for a possible carry at bit 22 of t9 (i.e. bit 256 of the field element) */
+    VERIFY_CHECK(t9 >> 23 == 0);
+
+    return (z0 == 0) | (z1 == 0x3FFFFFFUL);
+}
+
+SECP256K1_INLINE static void secp256k1_fe_set_int(secp256k1_fe *r, int a) {
+    r->n[0] = a;
+    r->n[1] = r->n[2] = r->n[3] = r->n[4] = r->n[5] = r->n[6] = r->n[7] = r->n[8] = r->n[9] = 0;
+#ifdef VERIFY
+    r->magnitude = 1;
+    r->normalized = 1;
+    secp256k1_fe_verify(r);
+#endif
+}
+
+SECP256K1_INLINE static int secp256k1_fe_is_zero(const secp256k1_fe *a) {
+    const uint32_t *t = a->n;
+#ifdef VERIFY
+    VERIFY_CHECK(a->normalized);
+    secp256k1_fe_verify(a);
+#endif
+    return (t[0] | t[1] | t[2] | t[3] | t[4] | t[5] | t[6] | t[7] | t[8] | t[9]) == 0;
+}
+
+SECP256K1_INLINE static int secp256k1_fe_is_odd(const secp256k1_fe *a) {
+#ifdef VERIFY
+    VERIFY_CHECK(a->normalized);
+    secp256k1_fe_verify(a);
+#endif
+    return a->n[0] & 1;
+}
+
+SECP256K1_INLINE static void secp256k1_fe_clear(secp256k1_fe *a) {
+    int i;
+#ifdef VERIFY
+    a->magnitude = 0;
+    a->normalized = 1;
+#endif
+    for (i=0; i<10; i++) {
+        a->n[i] = 0;
+    }
+}
+
+static int secp256k1_fe_cmp_var(const secp256k1_fe *a, const secp256k1_fe *b) {
+    int i;
+#ifdef VERIFY
+    VERIFY_CHECK(a->normalized);
+    VERIFY_CHECK(b->normalized);
+    secp256k1_fe_verify(a);
+    secp256k1_fe_verify(b);
+#endif
+    for (i = 9; i >= 0; i--) {
+        if (a->n[i] > b->n[i]) {
+            return 1;
+        }
+        if (a->n[i] < b->n[i]) {
+            return -1;
+        }
+    }
+    return 0;
+}
+
+static int secp256k1_fe_set_b32(secp256k1_fe *r, const unsigned char *a) {
+    int ret;
+    r->n[0] = (uint32_t)a[31] | ((uint32_t)a[30] << 8) | ((uint32_t)a[29] << 16) | ((uint32_t)(a[28] & 0x3) << 24);
+    r->n[1] = (uint32_t)((a[28] >> 2) & 0x3f) | ((uint32_t)a[27] << 6) | ((uint32_t)a[26] << 14) | ((uint32_t)(a[25] & 0xf) << 22);
+    r->n[2] = (uint32_t)((a[25] >> 4) & 0xf) | ((uint32_t)a[24] << 4) | ((uint32_t)a[23] << 12) | ((uint32_t)(a[22] & 0x3f) << 20);
+    r->n[3] = (uint32_t)((a[22] >> 6) & 0x3) | ((uint32_t)a[21] << 2) | ((uint32_t)a[20] << 10) | ((uint32_t)a[19] << 18);
+    r->n[4] = (uint32_t)a[18] | ((uint32_t)a[17] << 8) | ((uint32_t)a[16] << 16) | ((uint32_t)(a[15] & 0x3) << 24);
+    r->n[5] = (uint32_t)((a[15] >> 2) & 0x3f) | ((uint32_t)a[14] << 6) | ((uint32_t)a[13] << 14) | ((uint32_t)(a[12] & 0xf) << 22);
+    r->n[6] = (uint32_t)((a[12] >> 4) & 0xf) | ((uint32_t)a[11] << 4) | ((uint32_t)a[10] << 12) | ((uint32_t)(a[9] & 0x3f) << 20);
+    r->n[7] = (uint32_t)((a[9] >> 6) & 0x3) | ((uint32_t)a[8] << 2) | ((uint32_t)a[7] << 10) | ((uint32_t)a[6] << 18);
+    r->n[8] = (uint32_t)a[5] | ((uint32_t)a[4] << 8) | ((uint32_t)a[3] << 16) | ((uint32_t)(a[2] & 0x3) << 24);
+    r->n[9] = (uint32_t)((a[2] >> 2) & 0x3f) | ((uint32_t)a[1] << 6) | ((uint32_t)a[0] << 14);
+
+    ret = !((r->n[9] == 0x3FFFFFUL) & ((r->n[8] & r->n[7] & r->n[6] & r->n[5] & r->n[4] & r->n[3] & r->n[2]) == 0x3FFFFFFUL) & ((r->n[1] + 0x40UL + ((r->n[0] + 0x3D1UL) >> 26)) > 0x3FFFFFFUL));
+#ifdef VERIFY
+    r->magnitude = 1;
+    if (ret) {
+        r->normalized = 1;
+        secp256k1_fe_verify(r);
+    } else {
+        r->normalized = 0;
+    }
+#endif
+    return ret;
+}
+
+/** Convert a field element to a 32-byte big endian value. Requires the input to be normalized */
+static void secp256k1_fe_get_b32(unsigned char *r, const secp256k1_fe *a) {
+#ifdef VERIFY
+    VERIFY_CHECK(a->normalized);
+    secp256k1_fe_verify(a);
+#endif
+    r[0] = (a->n[9] >> 14) & 0xff;
+    r[1] = (a->n[9] >> 6) & 0xff;
+    r[2] = ((a->n[9] & 0x3F) << 2) | ((a->n[8] >> 24) & 0x3);
+    r[3] = (a->n[8] >> 16) & 0xff;
+    r[4] = (a->n[8] >> 8) & 0xff;
+    r[5] = a->n[8] & 0xff;
+    r[6] = (a->n[7] >> 18) & 0xff;
+    r[7] = (a->n[7] >> 10) & 0xff;
+    r[8] = (a->n[7] >> 2) & 0xff;
+    r[9] = ((a->n[7] & 0x3) << 6) | ((a->n[6] >> 20) & 0x3f);
+    r[10] = (a->n[6] >> 12) & 0xff;
+    r[11] = (a->n[6] >> 4) & 0xff;
+    r[12] = ((a->n[6] & 0xf) << 4) | ((a->n[5] >> 22) & 0xf);
+    r[13] = (a->n[5] >> 14) & 0xff;
+    r[14] = (a->n[5] >> 6) & 0xff;
+    r[15] = ((a->n[5] & 0x3f) << 2) | ((a->n[4] >> 24) & 0x3);
+    r[16] = (a->n[4] >> 16) & 0xff;
+    r[17] = (a->n[4] >> 8) & 0xff;
+    r[18] = a->n[4] & 0xff;
+    r[19] = (a->n[3] >> 18) & 0xff;
+    r[20] = (a->n[3] >> 10) & 0xff;
+    r[21] = (a->n[3] >> 2) & 0xff;
+    r[22] = ((a->n[3] & 0x3) << 6) | ((a->n[2] >> 20) & 0x3f);
+    r[23] = (a->n[2] >> 12) & 0xff;
+    r[24] = (a->n[2] >> 4) & 0xff;
+    r[25] = ((a->n[2] & 0xf) << 4) | ((a->n[1] >> 22) & 0xf);
+    r[26] = (a->n[1] >> 14) & 0xff;
+    r[27] = (a->n[1] >> 6) & 0xff;
+    r[28] = ((a->n[1] & 0x3f) << 2) | ((a->n[0] >> 24) & 0x3);
+    r[29] = (a->n[0] >> 16) & 0xff;
+    r[30] = (a->n[0] >> 8) & 0xff;
+    r[31] = a->n[0] & 0xff;
+}
+
+SECP256K1_INLINE static void secp256k1_fe_negate(secp256k1_fe *r, const secp256k1_fe *a, int m) {
+#ifdef VERIFY
+    VERIFY_CHECK(a->magnitude <= m);
+    secp256k1_fe_verify(a);
+#endif
+    r->n[0] = 0x3FFFC2FUL * 2 * (m + 1) - a->n[0];
+    r->n[1] = 0x3FFFFBFUL * 2 * (m + 1) - a->n[1];
+    r->n[2] = 0x3FFFFFFUL * 2 * (m + 1) - a->n[2];
+    r->n[3] = 0x3FFFFFFUL * 2 * (m + 1) - a->n[3];
+    r->n[4] = 0x3FFFFFFUL * 2 * (m + 1) - a->n[4];
+    r->n[5] = 0x3FFFFFFUL * 2 * (m + 1) - a->n[5];
+    r->n[6] = 0x3FFFFFFUL * 2 * (m + 1) - a->n[6];
+    r->n[7] = 0x3FFFFFFUL * 2 * (m + 1) - a->n[7];
+    r->n[8] = 0x3FFFFFFUL * 2 * (m + 1) - a->n[8];
+    r->n[9] = 0x03FFFFFUL * 2 * (m + 1) - a->n[9];
+#ifdef VERIFY
+    r->magnitude = m + 1;
+    r->normalized = 0;
+    secp256k1_fe_verify(r);
+#endif
+}
+
+SECP256K1_INLINE static void secp256k1_fe_mul_int(secp256k1_fe *r, int a) {
+    r->n[0] *= a;
+    r->n[1] *= a;
+    r->n[2] *= a;
+    r->n[3] *= a;
+    r->n[4] *= a;
+    r->n[5] *= a;
+    r->n[6] *= a;
+    r->n[7] *= a;
+    r->n[8] *= a;
+    r->n[9] *= a;
+#ifdef VERIFY
+    r->magnitude *= a;
+    r->normalized = 0;
+    secp256k1_fe_verify(r);
+#endif
+}
+
+SECP256K1_INLINE static void secp256k1_fe_add(secp256k1_fe *r, const secp256k1_fe *a) {
+#ifdef VERIFY
+    secp256k1_fe_verify(a);
+#endif
+    r->n[0] += a->n[0];
+    r->n[1] += a->n[1];
+    r->n[2] += a->n[2];
+    r->n[3] += a->n[3];
+    r->n[4] += a->n[4];
+    r->n[5] += a->n[5];
+    r->n[6] += a->n[6];
+    r->n[7] += a->n[7];
+    r->n[8] += a->n[8];
+    r->n[9] += a->n[9];
+#ifdef VERIFY
+    r->magnitude += a->magnitude;
+    r->normalized = 0;
+    secp256k1_fe_verify(r);
+#endif
+}
+
+#if defined(USE_EXTERNAL_ASM)
+
+/* External assembler implementation */
+void secp256k1_fe_mul_inner(uint32_t *r, const uint32_t *a, const uint32_t * SECP256K1_RESTRICT b);
+void secp256k1_fe_sqr_inner(uint32_t *r, const uint32_t *a);
+
+#else
+
+#ifdef VERIFY
+#define VERIFY_BITS(x, n) VERIFY_CHECK(((x) >> (n)) == 0)
+#else
+#define VERIFY_BITS(x, n) do { } while(0)
+#endif
+
+SECP256K1_INLINE static void secp256k1_fe_mul_inner(uint32_t *r, const uint32_t *a, const uint32_t * SECP256K1_RESTRICT b) {
+    uint64_t c, d;
+    uint64_t u0, u1, u2, u3, u4, u5, u6, u7, u8;
+    uint32_t t9, t1, t0, t2, t3, t4, t5, t6, t7;
+    const uint32_t M = 0x3FFFFFFUL, R0 = 0x3D10UL, R1 = 0x400UL;
+
+    VERIFY_BITS(a[0], 30);
+    VERIFY_BITS(a[1], 30);
+    VERIFY_BITS(a[2], 30);
+    VERIFY_BITS(a[3], 30);
+    VERIFY_BITS(a[4], 30);
+    VERIFY_BITS(a[5], 30);
+    VERIFY_BITS(a[6], 30);
+    VERIFY_BITS(a[7], 30);
+    VERIFY_BITS(a[8], 30);
+    VERIFY_BITS(a[9], 26);
+    VERIFY_BITS(b[0], 30);
+    VERIFY_BITS(b[1], 30);
+    VERIFY_BITS(b[2], 30);
+    VERIFY_BITS(b[3], 30);
+    VERIFY_BITS(b[4], 30);
+    VERIFY_BITS(b[5], 30);
+    VERIFY_BITS(b[6], 30);
+    VERIFY_BITS(b[7], 30);
+    VERIFY_BITS(b[8], 30);
+    VERIFY_BITS(b[9], 26);
+
+    /** [... a b c] is a shorthand for ... + a<<52 + b<<26 + c<<0 mod n.
+     *  for 0 <= x <= 9, px is a shorthand for sum(a[i]*b[x-i], i=0..x).
+     *  for 9 <= x <= 18, px is a shorthand for sum(a[i]*b[x-i], i=(x-9)..9)
+     *  Note that [x 0 0 0 0 0 0 0 0 0 0] = [x*R1 x*R0].
+     */
+
+    d  = (uint64_t)a[0] * b[9]
+       + (uint64_t)a[1] * b[8]
+       + (uint64_t)a[2] * b[7]
+       + (uint64_t)a[3] * b[6]
+       + (uint64_t)a[4] * b[5]
+       + (uint64_t)a[5] * b[4]
+       + (uint64_t)a[6] * b[3]
+       + (uint64_t)a[7] * b[2]
+       + (uint64_t)a[8] * b[1]
+       + (uint64_t)a[9] * b[0];
+    /* VERIFY_BITS(d, 64); */
+    /* [d 0 0 0 0 0 0 0 0 0] = [p9 0 0 0 0 0 0 0 0 0] */
+    t9 = d & M; d >>= 26;
+    VERIFY_BITS(t9, 26);
+    VERIFY_BITS(d, 38);
+    /* [d t9 0 0 0 0 0 0 0 0 0] = [p9 0 0 0 0 0 0 0 0 0] */
+
+    c  = (uint64_t)a[0] * b[0];
+    VERIFY_BITS(c, 60);
+    /* [d t9 0 0 0 0 0 0 0 0 c] = [p9 0 0 0 0 0 0 0 0 p0] */
+    d += (uint64_t)a[1] * b[9]
+       + (uint64_t)a[2] * b[8]
+       + (uint64_t)a[3] * b[7]
+       + (uint64_t)a[4] * b[6]
+       + (uint64_t)a[5] * b[5]
+       + (uint64_t)a[6] * b[4]
+       + (uint64_t)a[7] * b[3]
+       + (uint64_t)a[8] * b[2]
+       + (uint64_t)a[9] * b[1];
+    VERIFY_BITS(d, 63);
+    /* [d t9 0 0 0 0 0 0 0 0 c] = [p10 p9 0 0 0 0 0 0 0 0 p0] */
+    u0 = d & M; d >>= 26; c += u0 * R0;
+    VERIFY_BITS(u0, 26);
+    VERIFY_BITS(d, 37);
+    VERIFY_BITS(c, 61);
+    /* [d u0 t9 0 0 0 0 0 0 0 0 c-u0*R0] = [p10 p9 0 0 0 0 0 0 0 0 p0] */
+    t0 = c & M; c >>= 26; c += u0 * R1;
+    VERIFY_BITS(t0, 26);
+    VERIFY_BITS(c, 37);
+    /* [d u0 t9 0 0 0 0 0 0 0 c-u0*R1 t0-u0*R0] = [p10 p9 0 0 0 0 0 0 0 0 p0] */
+    /* [d 0 t9 0 0 0 0 0 0 0 c t0] = [p10 p9 0 0 0 0 0 0 0 0 p0] */
+
+    c += (uint64_t)a[0] * b[1]
+       + (uint64_t)a[1] * b[0];
+    VERIFY_BITS(c, 62);
+    /* [d 0 t9 0 0 0 0 0 0 0 c t0] = [p10 p9 0 0 0 0 0 0 0 p1 p0] */
+    d += (uint64_t)a[2] * b[9]
+       + (uint64_t)a[3] * b[8]
+       + (uint64_t)a[4] * b[7]
+       + (uint64_t)a[5] * b[6]
+       + (uint64_t)a[6] * b[5]
+       + (uint64_t)a[7] * b[4]
+       + (uint64_t)a[8] * b[3]
+       + (uint64_t)a[9] * b[2];
+    VERIFY_BITS(d, 63);
+    /* [d 0 t9 0 0 0 0 0 0 0 c t0] = [p11 p10 p9 0 0 0 0 0 0 0 p1 p0] */
+    u1 = d & M; d >>= 26; c += u1 * R0;
+    VERIFY_BITS(u1, 26);
+    VERIFY_BITS(d, 37);
+    VERIFY_BITS(c, 63);
+    /* [d u1 0 t9 0 0 0 0 0 0 0 c-u1*R0 t0] = [p11 p10 p9 0 0 0 0 0 0 0 p1 p0] */
+    t1 = c & M; c >>= 26; c += u1 * R1;
+    VERIFY_BITS(t1, 26);
+    VERIFY_BITS(c, 38);
+    /* [d u1 0 t9 0 0 0 0 0 0 c-u1*R1 t1-u1*R0 t0] = [p11 p10 p9 0 0 0 0 0 0 0 p1 p0] */
+    /* [d 0 0 t9 0 0 0 0 0 0 c t1 t0] = [p11 p10 p9 0 0 0 0 0 0 0 p1 p0] */
+
+    c += (uint64_t)a[0] * b[2]
+       + (uint64_t)a[1] * b[1]
+       + (uint64_t)a[2] * b[0];
+    VERIFY_BITS(c, 62);
+    /* [d 0 0 t9 0 0 0 0 0 0 c t1 t0] = [p11 p10 p9 0 0 0 0 0 0 p2 p1 p0] */
+    d += (uint64_t)a[3] * b[9]
+       + (uint64_t)a[4] * b[8]
+       + (uint64_t)a[5] * b[7]
+       + (uint64_t)a[6] * b[6]
+       + (uint64_t)a[7] * b[5]
+       + (uint64_t)a[8] * b[4]
+       + (uint64_t)a[9] * b[3];
+    VERIFY_BITS(d, 63);
+    /* [d 0 0 t9 0 0 0 0 0 0 c t1 t0] = [p12 p11 p10 p9 0 0 0 0 0 0 p2 p1 p0] */
+    u2 = d & M; d >>= 26; c += u2 * R0;
+    VERIFY_BITS(u2, 26);
+    VERIFY_BITS(d, 37);
+    VERIFY_BITS(c, 63);
+    /* [d u2 0 0 t9 0 0 0 0 0 0 c-u2*R0 t1 t0] = [p12 p11 p10 p9 0 0 0 0 0 0 p2 p1 p0] */
+    t2 = c & M; c >>= 26; c += u2 * R1;
+    VERIFY_BITS(t2, 26);
+    VERIFY_BITS(c, 38);
+    /* [d u2 0 0 t9 0 0 0 0 0 c-u2*R1 t2-u2*R0 t1 t0] = [p12 p11 p10 p9 0 0 0 0 0 0 p2 p1 p0] */
+    /* [d 0 0 0 t9 0 0 0 0 0 c t2 t1 t0] = [p12 p11 p10 p9 0 0 0 0 0 0 p2 p1 p0] */
+
+    c += (uint64_t)a[0] * b[3]
+       + (uint64_t)a[1] * b[2]
+       + (uint64_t)a[2] * b[1]
+       + (uint64_t)a[3] * b[0];
+    VERIFY_BITS(c, 63);
+    /* [d 0 0 0 t9 0 0 0 0 0 c t2 t1 t0] = [p12 p11 p10 p9 0 0 0 0 0 p3 p2 p1 p0] */
+    d += (uint64_t)a[4] * b[9]
+       + (uint64_t)a[5] * b[8]
+       + (uint64_t)a[6] * b[7]
+       + (uint64_t)a[7] * b[6]
+       + (uint64_t)a[8] * b[5]
+       + (uint64_t)a[9] * b[4];
+    VERIFY_BITS(d, 63);
+    /* [d 0 0 0 t9 0 0 0 0 0 c t2 t1 t0] = [p13 p12 p11 p10 p9 0 0 0 0 0 p3 p2 p1 p0] */
+    u3 = d & M; d >>= 26; c += u3 * R0;
+    VERIFY_BITS(u3, 26);
+    VERIFY_BITS(d, 37);
+    /* VERIFY_BITS(c, 64); */
+    /* [d u3 0 0 0 t9 0 0 0 0 0 c-u3*R0 t2 t1 t0] = [p13 p12 p11 p10 p9 0 0 0 0 0 p3 p2 p1 p0] */
+    t3 = c & M; c >>= 26; c += u3 * R1;
+    VERIFY_BITS(t3, 26);
+    VERIFY_BITS(c, 39);
+    /* [d u3 0 0 0 t9 0 0 0 0 c-u3*R1 t3-u3*R0 t2 t1 t0] = [p13 p12 p11 p10 p9 0 0 0 0 0 p3 p2 p1 p0] */
+    /* [d 0 0 0 0 t9 0 0 0 0 c t3 t2 t1 t0] = [p13 p12 p11 p10 p9 0 0 0 0 0 p3 p2 p1 p0] */
+
+    c += (uint64_t)a[0] * b[4]
+       + (uint64_t)a[1] * b[3]
+       + (uint64_t)a[2] * b[2]
+       + (uint64_t)a[3] * b[1]
+       + (uint64_t)a[4] * b[0];
+    VERIFY_BITS(c, 63);
+    /* [d 0 0 0 0 t9 0 0 0 0 c t3 t2 t1 t0] = [p13 p12 p11 p10 p9 0 0 0 0 p4 p3 p2 p1 p0] */
+    d += (uint64_t)a[5] * b[9]
+       + (uint64_t)a[6] * b[8]
+       + (uint64_t)a[7] * b[7]
+       + (uint64_t)a[8] * b[6]
+       + (uint64_t)a[9] * b[5];
+    VERIFY_BITS(d, 62);
+    /* [d 0 0 0 0 t9 0 0 0 0 c t3 t2 t1 t0] = [p14 p13 p12 p11 p10 p9 0 0 0 0 p4 p3 p2 p1 p0] */
+    u4 = d & M; d >>= 26; c += u4 * R0;
+    VERIFY_BITS(u4, 26);
+    VERIFY_BITS(d, 36);
+    /* VERIFY_BITS(c, 64); */
+    /* [d u4 0 0 0 0 t9 0 0 0 0 c-u4*R0 t3 t2 t1 t0] = [p14 p13 p12 p11 p10 p9 0 0 0 0 p4 p3 p2 p1 p0] */
+    t4 = c & M; c >>= 26; c += u4 * R1;
+    VERIFY_BITS(t4, 26);
+    VERIFY_BITS(c, 39);
+    /* [d u4 0 0 0 0 t9 0 0 0 c-u4*R1 t4-u4*R0 t3 t2 t1 t0] = [p14 p13 p12 p11 p10 p9 0 0 0 0 p4 p3 p2 p1 p0] */
+    /* [d 0 0 0 0 0 t9 0 0 0 c t4 t3 t2 t1 t0] = [p14 p13 p12 p11 p10 p9 0 0 0 0 p4 p3 p2 p1 p0] */
+
+    c += (uint64_t)a[0] * b[5]
+       + (uint64_t)a[1] * b[4]
+       + (uint64_t)a[2] * b[3]
+       + (uint64_t)a[3] * b[2]
+       + (uint64_t)a[4] * b[1]
+       + (uint64_t)a[5] * b[0];
+    VERIFY_BITS(c, 63);
+    /* [d 0 0 0 0 0 t9 0 0 0 c t4 t3 t2 t1 t0] = [p14 p13 p12 p11 p10 p9 0 0 0 p5 p4 p3 p2 p1 p0] */
+    d += (uint64_t)a[6] * b[9]
+       + (uint64_t)a[7] * b[8]
+       + (uint64_t)a[8] * b[7]
+       + (uint64_t)a[9] * b[6];
+    VERIFY_BITS(d, 62);
+    /* [d 0 0 0 0 0 t9 0 0 0 c t4 t3 t2 t1 t0] = [p15 p14 p13 p12 p11 p10 p9 0 0 0 p5 p4 p3 p2 p1 p0] */
+    u5 = d & M; d >>= 26; c += u5 * R0;
+    VERIFY_BITS(u5, 26);
+    VERIFY_BITS(d, 36);
+    /* VERIFY_BITS(c, 64); */
+    /* [d u5 0 0 0 0 0 t9 0 0 0 c-u5*R0 t4 t3 t2 t1 t0] = [p15 p14 p13 p12 p11 p10 p9 0 0 0 p5 p4 p3 p2 p1 p0] */
+    t5 = c & M; c >>= 26; c += u5 * R1;
+    VERIFY_BITS(t5, 26);
+    VERIFY_BITS(c, 39);
+    /* [d u5 0 0 0 0 0 t9 0 0 c-u5*R1 t5-u5*R0 t4 t3 t2 t1 t0] = [p15 p14 p13 p12 p11 p10 p9 0 0 0 p5 p4 p3 p2 p1 p0] */
+    /* [d 0 0 0 0 0 0 t9 0 0 c t5 t4 t3 t2 t1 t0] = [p15 p14 p13 p12 p11 p10 p9 0 0 0 p5 p4 p3 p2 p1 p0] */
+
+    c += (uint64_t)a[0] * b[6]
+       + (uint64_t)a[1] * b[5]
+       + (uint64_t)a[2] * b[4]
+       + (uint64_t)a[3] * b[3]
+       + (uint64_t)a[4] * b[2]
+       + (uint64_t)a[5] * b[1]
+       + (uint64_t)a[6] * b[0];
+    VERIFY_BITS(c, 63);
+    /* [d 0 0 0 0 0 0 t9 0 0 c t5 t4 t3 t2 t1 t0] = [p15 p14 p13 p12 p11 p10 p9 0 0 p6 p5 p4 p3 p2 p1 p0] */
+    d += (uint64_t)a[7] * b[9]
+       + (uint64_t)a[8] * b[8]
+       + (uint64_t)a[9] * b[7];
+    VERIFY_BITS(d, 61);
+    /* [d 0 0 0 0 0 0 t9 0 0 c t5 t4 t3 t2 t1 t0] = [p16 p15 p14 p13 p12 p11 p10 p9 0 0 p6 p5 p4 p3 p2 p1 p0] */
+    u6 = d & M; d >>= 26; c += u6 * R0;
+    VERIFY_BITS(u6, 26);
+    VERIFY_BITS(d, 35);
+    /* VERIFY_BITS(c, 64); */
+    /* [d u6 0 0 0 0 0 0 t9 0 0 c-u6*R0 t5 t4 t3 t2 t1 t0] = [p16 p15 p14 p13 p12 p11 p10 p9 0 0 p6 p5 p4 p3 p2 p1 p0] */
+    t6 = c & M; c >>= 26; c += u6 * R1;
+    VERIFY_BITS(t6, 26);
+    VERIFY_BITS(c, 39);
+    /* [d u6 0 0 0 0 0 0 t9 0 c-u6*R1 t6-u6*R0 t5 t4 t3 t2 t1 t0] = [p16 p15 p14 p13 p12 p11 p10 p9 0 0 p6 p5 p4 p3 p2 p1 p0] */
+    /* [d 0 0 0 0 0 0 0 t9 0 c t6 t5 t4 t3 t2 t1 t0] = [p16 p15 p14 p13 p12 p11 p10 p9 0 0 p6 p5 p4 p3 p2 p1 p0] */
+
+    c += (uint64_t)a[0] * b[7]
+       + (uint64_t)a[1] * b[6]
+       + (uint64_t)a[2] * b[5]
+       + (uint64_t)a[3] * b[4]
+       + (uint64_t)a[4] * b[3]
+       + (uint64_t)a[5] * b[2]
+       + (uint64_t)a[6] * b[1]
+       + (uint64_t)a[7] * b[0];
+    /* VERIFY_BITS(c, 64); */
+    VERIFY_CHECK(c <= 0x8000007C00000007ULL);
+    /* [d 0 0 0 0 0 0 0 t9 0 c t6 t5 t4 t3 t2 t1 t0] = [p16 p15 p14 p13 p12 p11 p10 p9 0 p7 p6 p5 p4 p3 p2 p1 p0] */
+    d += (uint64_t)a[8] * b[9]
+       + (uint64_t)a[9] * b[8];
+    VERIFY_BITS(d, 58);
+    /* [d 0 0 0 0 0 0 0 t9 0 c t6 t5 t4 t3 t2 t1 t0] = [p17 p16 p15 p14 p13 p12 p11 p10 p9 0 p7 p6 p5 p4 p3 p2 p1 p0] */
+    u7 = d & M; d >>= 26; c += u7 * R0;
+    VERIFY_BITS(u7, 26);
+    VERIFY_BITS(d, 32);
+    /* VERIFY_BITS(c, 64); */
+    VERIFY_CHECK(c <= 0x800001703FFFC2F7ULL);
+    /* [d u7 0 0 0 0 0 0 0 t9 0 c-u7*R0 t6 t5 t4 t3 t2 t1 t0] = [p17 p16 p15 p14 p13 p12 p11 p10 p9 0 p7 p6 p5 p4 p3 p2 p1 p0] */
+    t7 = c & M; c >>= 26; c += u7 * R1;
+    VERIFY_BITS(t7, 26);
+    VERIFY_BITS(c, 38);
+    /* [d u7 0 0 0 0 0 0 0 t9 c-u7*R1 t7-u7*R0 t6 t5 t4 t3 t2 t1 t0] = [p17 p16 p15 p14 p13 p12 p11 p10 p9 0 p7 p6 p5 p4 p3 p2 p1 p0] */
+    /* [d 0 0 0 0 0 0 0 0 t9 c t7 t6 t5 t4 t3 t2 t1 t0] = [p17 p16 p15 p14 p13 p12 p11 p10 p9 0 p7 p6 p5 p4 p3 p2 p1 p0] */
+
+    c += (uint64_t)a[0] * b[8]
+       + (uint64_t)a[1] * b[7]
+       + (uint64_t)a[2] * b[6]
+       + (uint64_t)a[3] * b[5]
+       + (uint64_t)a[4] * b[4]
+       + (uint64_t)a[5] * b[3]
+       + (uint64_t)a[6] * b[2]
+       + (uint64_t)a[7] * b[1]
+       + (uint64_t)a[8] * b[0];
+    /* VERIFY_BITS(c, 64); */
+    VERIFY_CHECK(c <= 0x9000007B80000008ULL);
+    /* [d 0 0 0 0 0 0 0 0 t9 c t7 t6 t5 t4 t3 t2 t1 t0] = [p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    d += (uint64_t)a[9] * b[9];
+    VERIFY_BITS(d, 57);
+    /* [d 0 0 0 0 0 0 0 0 t9 c t7 t6 t5 t4 t3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    u8 = d & M; d >>= 26; c += u8 * R0;
+    VERIFY_BITS(u8, 26);
+    VERIFY_BITS(d, 31);
+    /* VERIFY_BITS(c, 64); */
+    VERIFY_CHECK(c <= 0x9000016FBFFFC2F8ULL);
+    /* [d u8 0 0 0 0 0 0 0 0 t9 c-u8*R0 t7 t6 t5 t4 t3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+
+    r[3] = t3;
+    VERIFY_BITS(r[3], 26);
+    /* [d u8 0 0 0 0 0 0 0 0 t9 c-u8*R0 t7 t6 t5 t4 r3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    r[4] = t4;
+    VERIFY_BITS(r[4], 26);
+    /* [d u8 0 0 0 0 0 0 0 0 t9 c-u8*R0 t7 t6 t5 r4 r3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    r[5] = t5;
+    VERIFY_BITS(r[5], 26);
+    /* [d u8 0 0 0 0 0 0 0 0 t9 c-u8*R0 t7 t6 r5 r4 r3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    r[6] = t6;
+    VERIFY_BITS(r[6], 26);
+    /* [d u8 0 0 0 0 0 0 0 0 t9 c-u8*R0 t7 r6 r5 r4 r3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    r[7] = t7;
+    VERIFY_BITS(r[7], 26);
+    /* [d u8 0 0 0 0 0 0 0 0 t9 c-u8*R0 r7 r6 r5 r4 r3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+
+    r[8] = c & M; c >>= 26; c += u8 * R1;
+    VERIFY_BITS(r[8], 26);
+    VERIFY_BITS(c, 39);
+    /* [d u8 0 0 0 0 0 0 0 0 t9+c-u8*R1 r8-u8*R0 r7 r6 r5 r4 r3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    /* [d 0 0 0 0 0 0 0 0 0 t9+c r8 r7 r6 r5 r4 r3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    c   += d * R0 + t9;
+    VERIFY_BITS(c, 45);
+    /* [d 0 0 0 0 0 0 0 0 0 c-d*R0 r8 r7 r6 r5 r4 r3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    r[9] = c & (M >> 4); c >>= 22; c += d * (R1 << 4);
+    VERIFY_BITS(r[9], 22);
+    VERIFY_BITS(c, 46);
+    /* [d 0 0 0 0 0 0 0 0 r9+((c-d*R1<<4)<<22)-d*R0 r8 r7 r6 r5 r4 r3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    /* [d 0 0 0 0 0 0 0 -d*R1 r9+(c<<22)-d*R0 r8 r7 r6 r5 r4 r3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    /* [r9+(c<<22) r8 r7 r6 r5 r4 r3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+
+    d    = c * (R0 >> 4) + t0;
+    VERIFY_BITS(d, 56);
+    /* [r9+(c<<22) r8 r7 r6 r5 r4 r3 t2 t1 d-c*R0>>4] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    r[0] = d & M; d >>= 26;
+    VERIFY_BITS(r[0], 26);
+    VERIFY_BITS(d, 30);
+    /* [r9+(c<<22) r8 r7 r6 r5 r4 r3 t2 t1+d r0-c*R0>>4] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    d   += c * (R1 >> 4) + t1;
+    VERIFY_BITS(d, 53);
+    VERIFY_CHECK(d <= 0x10000003FFFFBFULL);
+    /* [r9+(c<<22) r8 r7 r6 r5 r4 r3 t2 d-c*R1>>4 r0-c*R0>>4] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    /* [r9 r8 r7 r6 r5 r4 r3 t2 d r0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    r[1] = d & M; d >>= 26;
+    VERIFY_BITS(r[1], 26);
+    VERIFY_BITS(d, 27);
+    VERIFY_CHECK(d <= 0x4000000ULL);
+    /* [r9 r8 r7 r6 r5 r4 r3 t2+d r1 r0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    d   += t2;
+    VERIFY_BITS(d, 27);
+    /* [r9 r8 r7 r6 r5 r4 r3 d r1 r0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    r[2] = d;
+    VERIFY_BITS(r[2], 27);
+    /* [r9 r8 r7 r6 r5 r4 r3 r2 r1 r0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+}
+
+SECP256K1_INLINE static void secp256k1_fe_sqr_inner(uint32_t *r, const uint32_t *a) {
+    uint64_t c, d;
+    uint64_t u0, u1, u2, u3, u4, u5, u6, u7, u8;
+    uint32_t t9, t0, t1, t2, t3, t4, t5, t6, t7;
+    const uint32_t M = 0x3FFFFFFUL, R0 = 0x3D10UL, R1 = 0x400UL;
+
+    VERIFY_BITS(a[0], 30);
+    VERIFY_BITS(a[1], 30);
+    VERIFY_BITS(a[2], 30);
+    VERIFY_BITS(a[3], 30);
+    VERIFY_BITS(a[4], 30);
+    VERIFY_BITS(a[5], 30);
+    VERIFY_BITS(a[6], 30);
+    VERIFY_BITS(a[7], 30);
+    VERIFY_BITS(a[8], 30);
+    VERIFY_BITS(a[9], 26);
+
+    /** [... a b c] is a shorthand for ... + a<<52 + b<<26 + c<<0 mod n.
+     *  px is a shorthand for sum(a[i]*a[x-i], i=0..x).
+     *  Note that [x 0 0 0 0 0 0 0 0 0 0] = [x*R1 x*R0].
+     */
+
+    d  = (uint64_t)(a[0]*2) * a[9]
+       + (uint64_t)(a[1]*2) * a[8]
+       + (uint64_t)(a[2]*2) * a[7]
+       + (uint64_t)(a[3]*2) * a[6]
+       + (uint64_t)(a[4]*2) * a[5];
+    /* VERIFY_BITS(d, 64); */
+    /* [d 0 0 0 0 0 0 0 0 0] = [p9 0 0 0 0 0 0 0 0 0] */
+    t9 = d & M; d >>= 26;
+    VERIFY_BITS(t9, 26);
+    VERIFY_BITS(d, 38);
+    /* [d t9 0 0 0 0 0 0 0 0 0] = [p9 0 0 0 0 0 0 0 0 0] */
+
+    c  = (uint64_t)a[0] * a[0];
+    VERIFY_BITS(c, 60);
+    /* [d t9 0 0 0 0 0 0 0 0 c] = [p9 0 0 0 0 0 0 0 0 p0] */
+    d += (uint64_t)(a[1]*2) * a[9]
+       + (uint64_t)(a[2]*2) * a[8]
+       + (uint64_t)(a[3]*2) * a[7]
+       + (uint64_t)(a[4]*2) * a[6]
+       + (uint64_t)a[5] * a[5];
+    VERIFY_BITS(d, 63);
+    /* [d t9 0 0 0 0 0 0 0 0 c] = [p10 p9 0 0 0 0 0 0 0 0 p0] */
+    u0 = d & M; d >>= 26; c += u0 * R0;
+    VERIFY_BITS(u0, 26);
+    VERIFY_BITS(d, 37);
+    VERIFY_BITS(c, 61);
+    /* [d u0 t9 0 0 0 0 0 0 0 0 c-u0*R0] = [p10 p9 0 0 0 0 0 0 0 0 p0] */
+    t0 = c & M; c >>= 26; c += u0 * R1;
+    VERIFY_BITS(t0, 26);
+    VERIFY_BITS(c, 37);
+    /* [d u0 t9 0 0 0 0 0 0 0 c-u0*R1 t0-u0*R0] = [p10 p9 0 0 0 0 0 0 0 0 p0] */
+    /* [d 0 t9 0 0 0 0 0 0 0 c t0] = [p10 p9 0 0 0 0 0 0 0 0 p0] */
+
+    c += (uint64_t)(a[0]*2) * a[1];
+    VERIFY_BITS(c, 62);
+    /* [d 0 t9 0 0 0 0 0 0 0 c t0] = [p10 p9 0 0 0 0 0 0 0 p1 p0] */
+    d += (uint64_t)(a[2]*2) * a[9]
+       + (uint64_t)(a[3]*2) * a[8]
+       + (uint64_t)(a[4]*2) * a[7]
+       + (uint64_t)(a[5]*2) * a[6];
+    VERIFY_BITS(d, 63);
+    /* [d 0 t9 0 0 0 0 0 0 0 c t0] = [p11 p10 p9 0 0 0 0 0 0 0 p1 p0] */
+    u1 = d & M; d >>= 26; c += u1 * R0;
+    VERIFY_BITS(u1, 26);
+    VERIFY_BITS(d, 37);
+    VERIFY_BITS(c, 63);
+    /* [d u1 0 t9 0 0 0 0 0 0 0 c-u1*R0 t0] = [p11 p10 p9 0 0 0 0 0 0 0 p1 p0] */
+    t1 = c & M; c >>= 26; c += u1 * R1;
+    VERIFY_BITS(t1, 26);
+    VERIFY_BITS(c, 38);
+    /* [d u1 0 t9 0 0 0 0 0 0 c-u1*R1 t1-u1*R0 t0] = [p11 p10 p9 0 0 0 0 0 0 0 p1 p0] */
+    /* [d 0 0 t9 0 0 0 0 0 0 c t1 t0] = [p11 p10 p9 0 0 0 0 0 0 0 p1 p0] */
+
+    c += (uint64_t)(a[0]*2) * a[2]
+       + (uint64_t)a[1] * a[1];
+    VERIFY_BITS(c, 62);
+    /* [d 0 0 t9 0 0 0 0 0 0 c t1 t0] = [p11 p10 p9 0 0 0 0 0 0 p2 p1 p0] */
+    d += (uint64_t)(a[3]*2) * a[9]
+       + (uint64_t)(a[4]*2) * a[8]
+       + (uint64_t)(a[5]*2) * a[7]
+       + (uint64_t)a[6] * a[6];
+    VERIFY_BITS(d, 63);
+    /* [d 0 0 t9 0 0 0 0 0 0 c t1 t0] = [p12 p11 p10 p9 0 0 0 0 0 0 p2 p1 p0] */
+    u2 = d & M; d >>= 26; c += u2 * R0;
+    VERIFY_BITS(u2, 26);
+    VERIFY_BITS(d, 37);
+    VERIFY_BITS(c, 63);
+    /* [d u2 0 0 t9 0 0 0 0 0 0 c-u2*R0 t1 t0] = [p12 p11 p10 p9 0 0 0 0 0 0 p2 p1 p0] */
+    t2 = c & M; c >>= 26; c += u2 * R1;
+    VERIFY_BITS(t2, 26);
+    VERIFY_BITS(c, 38);
+    /* [d u2 0 0 t9 0 0 0 0 0 c-u2*R1 t2-u2*R0 t1 t0] = [p12 p11 p10 p9 0 0 0 0 0 0 p2 p1 p0] */
+    /* [d 0 0 0 t9 0 0 0 0 0 c t2 t1 t0] = [p12 p11 p10 p9 0 0 0 0 0 0 p2 p1 p0] */
+
+    c += (uint64_t)(a[0]*2) * a[3]
+       + (uint64_t)(a[1]*2) * a[2];
+    VERIFY_BITS(c, 63);
+    /* [d 0 0 0 t9 0 0 0 0 0 c t2 t1 t0] = [p12 p11 p10 p9 0 0 0 0 0 p3 p2 p1 p0] */
+    d += (uint64_t)(a[4]*2) * a[9]
+       + (uint64_t)(a[5]*2) * a[8]
+       + (uint64_t)(a[6]*2) * a[7];
+    VERIFY_BITS(d, 63);
+    /* [d 0 0 0 t9 0 0 0 0 0 c t2 t1 t0] = [p13 p12 p11 p10 p9 0 0 0 0 0 p3 p2 p1 p0] */
+    u3 = d & M; d >>= 26; c += u3 * R0;
+    VERIFY_BITS(u3, 26);
+    VERIFY_BITS(d, 37);
+    /* VERIFY_BITS(c, 64); */
+    /* [d u3 0 0 0 t9 0 0 0 0 0 c-u3*R0 t2 t1 t0] = [p13 p12 p11 p10 p9 0 0 0 0 0 p3 p2 p1 p0] */
+    t3 = c & M; c >>= 26; c += u3 * R1;
+    VERIFY_BITS(t3, 26);
+    VERIFY_BITS(c, 39);
+    /* [d u3 0 0 0 t9 0 0 0 0 c-u3*R1 t3-u3*R0 t2 t1 t0] = [p13 p12 p11 p10 p9 0 0 0 0 0 p3 p2 p1 p0] */
+    /* [d 0 0 0 0 t9 0 0 0 0 c t3 t2 t1 t0] = [p13 p12 p11 p10 p9 0 0 0 0 0 p3 p2 p1 p0] */
+
+    c += (uint64_t)(a[0]*2) * a[4]
+       + (uint64_t)(a[1]*2) * a[3]
+       + (uint64_t)a[2] * a[2];
+    VERIFY_BITS(c, 63);
+    /* [d 0 0 0 0 t9 0 0 0 0 c t3 t2 t1 t0] = [p13 p12 p11 p10 p9 0 0 0 0 p4 p3 p2 p1 p0] */
+    d += (uint64_t)(a[5]*2) * a[9]
+       + (uint64_t)(a[6]*2) * a[8]
+       + (uint64_t)a[7] * a[7];
+    VERIFY_BITS(d, 62);
+    /* [d 0 0 0 0 t9 0 0 0 0 c t3 t2 t1 t0] = [p14 p13 p12 p11 p10 p9 0 0 0 0 p4 p3 p2 p1 p0] */
+    u4 = d & M; d >>= 26; c += u4 * R0;
+    VERIFY_BITS(u4, 26);
+    VERIFY_BITS(d, 36);
+    /* VERIFY_BITS(c, 64); */
+    /* [d u4 0 0 0 0 t9 0 0 0 0 c-u4*R0 t3 t2 t1 t0] = [p14 p13 p12 p11 p10 p9 0 0 0 0 p4 p3 p2 p1 p0] */
+    t4 = c & M; c >>= 26; c += u4 * R1;
+    VERIFY_BITS(t4, 26);
+    VERIFY_BITS(c, 39);
+    /* [d u4 0 0 0 0 t9 0 0 0 c-u4*R1 t4-u4*R0 t3 t2 t1 t0] = [p14 p13 p12 p11 p10 p9 0 0 0 0 p4 p3 p2 p1 p0] */
+    /* [d 0 0 0 0 0 t9 0 0 0 c t4 t3 t2 t1 t0] = [p14 p13 p12 p11 p10 p9 0 0 0 0 p4 p3 p2 p1 p0] */
+
+    c += (uint64_t)(a[0]*2) * a[5]
+       + (uint64_t)(a[1]*2) * a[4]
+       + (uint64_t)(a[2]*2) * a[3];
+    VERIFY_BITS(c, 63);
+    /* [d 0 0 0 0 0 t9 0 0 0 c t4 t3 t2 t1 t0] = [p14 p13 p12 p11 p10 p9 0 0 0 p5 p4 p3 p2 p1 p0] */
+    d += (uint64_t)(a[6]*2) * a[9]
+       + (uint64_t)(a[7]*2) * a[8];
+    VERIFY_BITS(d, 62);
+    /* [d 0 0 0 0 0 t9 0 0 0 c t4 t3 t2 t1 t0] = [p15 p14 p13 p12 p11 p10 p9 0 0 0 p5 p4 p3 p2 p1 p0] */
+    u5 = d & M; d >>= 26; c += u5 * R0;
+    VERIFY_BITS(u5, 26);
+    VERIFY_BITS(d, 36);
+    /* VERIFY_BITS(c, 64); */
+    /* [d u5 0 0 0 0 0 t9 0 0 0 c-u5*R0 t4 t3 t2 t1 t0] = [p15 p14 p13 p12 p11 p10 p9 0 0 0 p5 p4 p3 p2 p1 p0] */
+    t5 = c & M; c >>= 26; c += u5 * R1;
+    VERIFY_BITS(t5, 26);
+    VERIFY_BITS(c, 39);
+    /* [d u5 0 0 0 0 0 t9 0 0 c-u5*R1 t5-u5*R0 t4 t3 t2 t1 t0] = [p15 p14 p13 p12 p11 p10 p9 0 0 0 p5 p4 p3 p2 p1 p0] */
+    /* [d 0 0 0 0 0 0 t9 0 0 c t5 t4 t3 t2 t1 t0] = [p15 p14 p13 p12 p11 p10 p9 0 0 0 p5 p4 p3 p2 p1 p0] */
+
+    c += (uint64_t)(a[0]*2) * a[6]
+       + (uint64_t)(a[1]*2) * a[5]
+       + (uint64_t)(a[2]*2) * a[4]
+       + (uint64_t)a[3] * a[3];
+    VERIFY_BITS(c, 63);
+    /* [d 0 0 0 0 0 0 t9 0 0 c t5 t4 t3 t2 t1 t0] = [p15 p14 p13 p12 p11 p10 p9 0 0 p6 p5 p4 p3 p2 p1 p0] */
+    d += (uint64_t)(a[7]*2) * a[9]
+       + (uint64_t)a[8] * a[8];
+    VERIFY_BITS(d, 61);
+    /* [d 0 0 0 0 0 0 t9 0 0 c t5 t4 t3 t2 t1 t0] = [p16 p15 p14 p13 p12 p11 p10 p9 0 0 p6 p5 p4 p3 p2 p1 p0] */
+    u6 = d & M; d >>= 26; c += u6 * R0;
+    VERIFY_BITS(u6, 26);
+    VERIFY_BITS(d, 35);
+    /* VERIFY_BITS(c, 64); */
+    /* [d u6 0 0 0 0 0 0 t9 0 0 c-u6*R0 t5 t4 t3 t2 t1 t0] = [p16 p15 p14 p13 p12 p11 p10 p9 0 0 p6 p5 p4 p3 p2 p1 p0] */
+    t6 = c & M; c >>= 26; c += u6 * R1;
+    VERIFY_BITS(t6, 26);
+    VERIFY_BITS(c, 39);
+    /* [d u6 0 0 0 0 0 0 t9 0 c-u6*R1 t6-u6*R0 t5 t4 t3 t2 t1 t0] = [p16 p15 p14 p13 p12 p11 p10 p9 0 0 p6 p5 p4 p3 p2 p1 p0] */
+    /* [d 0 0 0 0 0 0 0 t9 0 c t6 t5 t4 t3 t2 t1 t0] = [p16 p15 p14 p13 p12 p11 p10 p9 0 0 p6 p5 p4 p3 p2 p1 p0] */
+
+    c += (uint64_t)(a[0]*2) * a[7]
+       + (uint64_t)(a[1]*2) * a[6]
+       + (uint64_t)(a[2]*2) * a[5]
+       + (uint64_t)(a[3]*2) * a[4];
+    /* VERIFY_BITS(c, 64); */
+    VERIFY_CHECK(c <= 0x8000007C00000007ULL);
+    /* [d 0 0 0 0 0 0 0 t9 0 c t6 t5 t4 t3 t2 t1 t0] = [p16 p15 p14 p13 p12 p11 p10 p9 0 p7 p6 p5 p4 p3 p2 p1 p0] */
+    d += (uint64_t)(a[8]*2) * a[9];
+    VERIFY_BITS(d, 58);
+    /* [d 0 0 0 0 0 0 0 t9 0 c t6 t5 t4 t3 t2 t1 t0] = [p17 p16 p15 p14 p13 p12 p11 p10 p9 0 p7 p6 p5 p4 p3 p2 p1 p0] */
+    u7 = d & M; d >>= 26; c += u7 * R0;
+    VERIFY_BITS(u7, 26);
+    VERIFY_BITS(d, 32);
+    /* VERIFY_BITS(c, 64); */
+    VERIFY_CHECK(c <= 0x800001703FFFC2F7ULL);
+    /* [d u7 0 0 0 0 0 0 0 t9 0 c-u7*R0 t6 t5 t4 t3 t2 t1 t0] = [p17 p16 p15 p14 p13 p12 p11 p10 p9 0 p7 p6 p5 p4 p3 p2 p1 p0] */
+    t7 = c & M; c >>= 26; c += u7 * R1;
+    VERIFY_BITS(t7, 26);
+    VERIFY_BITS(c, 38);
+    /* [d u7 0 0 0 0 0 0 0 t9 c-u7*R1 t7-u7*R0 t6 t5 t4 t3 t2 t1 t0] = [p17 p16 p15 p14 p13 p12 p11 p10 p9 0 p7 p6 p5 p4 p3 p2 p1 p0] */
+    /* [d 0 0 0 0 0 0 0 0 t9 c t7 t6 t5 t4 t3 t2 t1 t0] = [p17 p16 p15 p14 p13 p12 p11 p10 p9 0 p7 p6 p5 p4 p3 p2 p1 p0] */
+
+    c += (uint64_t)(a[0]*2) * a[8]
+       + (uint64_t)(a[1]*2) * a[7]
+       + (uint64_t)(a[2]*2) * a[6]
+       + (uint64_t)(a[3]*2) * a[5]
+       + (uint64_t)a[4] * a[4];
+    /* VERIFY_BITS(c, 64); */
+    VERIFY_CHECK(c <= 0x9000007B80000008ULL);
+    /* [d 0 0 0 0 0 0 0 0 t9 c t7 t6 t5 t4 t3 t2 t1 t0] = [p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    d += (uint64_t)a[9] * a[9];
+    VERIFY_BITS(d, 57);
+    /* [d 0 0 0 0 0 0 0 0 t9 c t7 t6 t5 t4 t3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    u8 = d & M; d >>= 26; c += u8 * R0;
+    VERIFY_BITS(u8, 26);
+    VERIFY_BITS(d, 31);
+    /* VERIFY_BITS(c, 64); */
+    VERIFY_CHECK(c <= 0x9000016FBFFFC2F8ULL);
+    /* [d u8 0 0 0 0 0 0 0 0 t9 c-u8*R0 t7 t6 t5 t4 t3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+
+    r[3] = t3;
+    VERIFY_BITS(r[3], 26);
+    /* [d u8 0 0 0 0 0 0 0 0 t9 c-u8*R0 t7 t6 t5 t4 r3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    r[4] = t4;
+    VERIFY_BITS(r[4], 26);
+    /* [d u8 0 0 0 0 0 0 0 0 t9 c-u8*R0 t7 t6 t5 r4 r3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    r[5] = t5;
+    VERIFY_BITS(r[5], 26);
+    /* [d u8 0 0 0 0 0 0 0 0 t9 c-u8*R0 t7 t6 r5 r4 r3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    r[6] = t6;
+    VERIFY_BITS(r[6], 26);
+    /* [d u8 0 0 0 0 0 0 0 0 t9 c-u8*R0 t7 r6 r5 r4 r3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    r[7] = t7;
+    VERIFY_BITS(r[7], 26);
+    /* [d u8 0 0 0 0 0 0 0 0 t9 c-u8*R0 r7 r6 r5 r4 r3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+
+    r[8] = c & M; c >>= 26; c += u8 * R1;
+    VERIFY_BITS(r[8], 26);
+    VERIFY_BITS(c, 39);
+    /* [d u8 0 0 0 0 0 0 0 0 t9+c-u8*R1 r8-u8*R0 r7 r6 r5 r4 r3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    /* [d 0 0 0 0 0 0 0 0 0 t9+c r8 r7 r6 r5 r4 r3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    c   += d * R0 + t9;
+    VERIFY_BITS(c, 45);
+    /* [d 0 0 0 0 0 0 0 0 0 c-d*R0 r8 r7 r6 r5 r4 r3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    r[9] = c & (M >> 4); c >>= 22; c += d * (R1 << 4);
+    VERIFY_BITS(r[9], 22);
+    VERIFY_BITS(c, 46);
+    /* [d 0 0 0 0 0 0 0 0 r9+((c-d*R1<<4)<<22)-d*R0 r8 r7 r6 r5 r4 r3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    /* [d 0 0 0 0 0 0 0 -d*R1 r9+(c<<22)-d*R0 r8 r7 r6 r5 r4 r3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    /* [r9+(c<<22) r8 r7 r6 r5 r4 r3 t2 t1 t0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+
+    d    = c * (R0 >> 4) + t0;
+    VERIFY_BITS(d, 56);
+    /* [r9+(c<<22) r8 r7 r6 r5 r4 r3 t2 t1 d-c*R0>>4] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    r[0] = d & M; d >>= 26;
+    VERIFY_BITS(r[0], 26);
+    VERIFY_BITS(d, 30);
+    /* [r9+(c<<22) r8 r7 r6 r5 r4 r3 t2 t1+d r0-c*R0>>4] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    d   += c * (R1 >> 4) + t1;
+    VERIFY_BITS(d, 53);
+    VERIFY_CHECK(d <= 0x10000003FFFFBFULL);
+    /* [r9+(c<<22) r8 r7 r6 r5 r4 r3 t2 d-c*R1>>4 r0-c*R0>>4] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    /* [r9 r8 r7 r6 r5 r4 r3 t2 d r0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    r[1] = d & M; d >>= 26;
+    VERIFY_BITS(r[1], 26);
+    VERIFY_BITS(d, 27);
+    VERIFY_CHECK(d <= 0x4000000ULL);
+    /* [r9 r8 r7 r6 r5 r4 r3 t2+d r1 r0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    d   += t2;
+    VERIFY_BITS(d, 27);
+    /* [r9 r8 r7 r6 r5 r4 r3 d r1 r0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    r[2] = d;
+    VERIFY_BITS(r[2], 27);
+    /* [r9 r8 r7 r6 r5 r4 r3 r2 r1 r0] = [p18 p17 p16 p15 p14 p13 p12 p11 p10 p9 p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+}
+#endif
+
+static void secp256k1_fe_mul(secp256k1_fe *r, const secp256k1_fe *a, const secp256k1_fe * SECP256K1_RESTRICT b) {
+#ifdef VERIFY
+    VERIFY_CHECK(a->magnitude <= 8);
+    VERIFY_CHECK(b->magnitude <= 8);
+    secp256k1_fe_verify(a);
+    secp256k1_fe_verify(b);
+    VERIFY_CHECK(r != b);
+    VERIFY_CHECK(a != b);
+#endif
+    secp256k1_fe_mul_inner(r->n, a->n, b->n);
+#ifdef VERIFY
+    r->magnitude = 1;
+    r->normalized = 0;
+    secp256k1_fe_verify(r);
+#endif
+}
+
+static void secp256k1_fe_sqr(secp256k1_fe *r, const secp256k1_fe *a) {
+#ifdef VERIFY
+    VERIFY_CHECK(a->magnitude <= 8);
+    secp256k1_fe_verify(a);
+#endif
+    secp256k1_fe_sqr_inner(r->n, a->n);
+#ifdef VERIFY
+    r->magnitude = 1;
+    r->normalized = 0;
+    secp256k1_fe_verify(r);
+#endif
+}
+
+static SECP256K1_INLINE void secp256k1_fe_cmov(secp256k1_fe *r, const secp256k1_fe *a, int flag) {
+    uint32_t mask0, mask1;
+    VG_CHECK_VERIFY(r->n, sizeof(r->n));
+    mask0 = flag + ~((uint32_t)0);
+    mask1 = ~mask0;
+    r->n[0] = (r->n[0] & mask0) | (a->n[0] & mask1);
+    r->n[1] = (r->n[1] & mask0) | (a->n[1] & mask1);
+    r->n[2] = (r->n[2] & mask0) | (a->n[2] & mask1);
+    r->n[3] = (r->n[3] & mask0) | (a->n[3] & mask1);
+    r->n[4] = (r->n[4] & mask0) | (a->n[4] & mask1);
+    r->n[5] = (r->n[5] & mask0) | (a->n[5] & mask1);
+    r->n[6] = (r->n[6] & mask0) | (a->n[6] & mask1);
+    r->n[7] = (r->n[7] & mask0) | (a->n[7] & mask1);
+    r->n[8] = (r->n[8] & mask0) | (a->n[8] & mask1);
+    r->n[9] = (r->n[9] & mask0) | (a->n[9] & mask1);
+#ifdef VERIFY
+    if (flag) {
+        r->magnitude = a->magnitude;
+        r->normalized = a->normalized;
+    }
+#endif
+}
+
+static SECP256K1_INLINE void secp256k1_fe_storage_cmov(secp256k1_fe_storage *r, const secp256k1_fe_storage *a, int flag) {
+    uint32_t mask0, mask1;
+    VG_CHECK_VERIFY(r->n, sizeof(r->n));
+    mask0 = flag + ~((uint32_t)0);
+    mask1 = ~mask0;
+    r->n[0] = (r->n[0] & mask0) | (a->n[0] & mask1);
+    r->n[1] = (r->n[1] & mask0) | (a->n[1] & mask1);
+    r->n[2] = (r->n[2] & mask0) | (a->n[2] & mask1);
+    r->n[3] = (r->n[3] & mask0) | (a->n[3] & mask1);
+    r->n[4] = (r->n[4] & mask0) | (a->n[4] & mask1);
+    r->n[5] = (r->n[5] & mask0) | (a->n[5] & mask1);
+    r->n[6] = (r->n[6] & mask0) | (a->n[6] & mask1);
+    r->n[7] = (r->n[7] & mask0) | (a->n[7] & mask1);
+}
+
+static void secp256k1_fe_to_storage(secp256k1_fe_storage *r, const secp256k1_fe *a) {
+#ifdef VERIFY
+    VERIFY_CHECK(a->normalized);
+#endif
+    r->n[0] = a->n[0] | a->n[1] << 26;
+    r->n[1] = a->n[1] >> 6 | a->n[2] << 20;
+    r->n[2] = a->n[2] >> 12 | a->n[3] << 14;
+    r->n[3] = a->n[3] >> 18 | a->n[4] << 8;
+    r->n[4] = a->n[4] >> 24 | a->n[5] << 2 | a->n[6] << 28;
+    r->n[5] = a->n[6] >> 4 | a->n[7] << 22;
+    r->n[6] = a->n[7] >> 10 | a->n[8] << 16;
+    r->n[7] = a->n[8] >> 16 | a->n[9] << 10;
+}
+
+static SECP256K1_INLINE void secp256k1_fe_from_storage(secp256k1_fe *r, const secp256k1_fe_storage *a) {
+    r->n[0] = a->n[0] & 0x3FFFFFFUL;
+    r->n[1] = a->n[0] >> 26 | ((a->n[1] << 6) & 0x3FFFFFFUL);
+    r->n[2] = a->n[1] >> 20 | ((a->n[2] << 12) & 0x3FFFFFFUL);
+    r->n[3] = a->n[2] >> 14 | ((a->n[3] << 18) & 0x3FFFFFFUL);
+    r->n[4] = a->n[3] >> 8 | ((a->n[4] << 24) & 0x3FFFFFFUL);
+    r->n[5] = (a->n[4] >> 2) & 0x3FFFFFFUL;
+    r->n[6] = a->n[4] >> 28 | ((a->n[5] << 4) & 0x3FFFFFFUL);
+    r->n[7] = a->n[5] >> 22 | ((a->n[6] << 10) & 0x3FFFFFFUL);
+    r->n[8] = a->n[6] >> 16 | ((a->n[7] << 16) & 0x3FFFFFFUL);
+    r->n[9] = a->n[7] >> 10;
+#ifdef VERIFY
+    r->magnitude = 1;
+    r->normalized = 1;
+#endif
+}
+
+#endif /* SECP256K1_FIELD_REPR_IMPL_H */
diff --git a/depend/zcash/src/secp256k1/src/field_5x52.h b/depend/zcash/src/secp256k1/src/field_5x52.h
new file mode 100644
index 000000000..50ee3f9ec
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/field_5x52.h
@@ -0,0 +1,55 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_FIELD_REPR_H
+#define SECP256K1_FIELD_REPR_H
+
+#include <stdint.h>
+
+typedef struct {
+    /* X = sum(i=0..4, n[i]*2^(i*52)) mod p
+     * where p = 2^256 - 0x1000003D1
+     */
+    uint64_t n[5];
+#ifdef VERIFY
+    int magnitude;
+    int normalized;
+#endif
+} secp256k1_fe;
+
+/* Unpacks a constant into a overlapping multi-limbed FE element. */
+#define SECP256K1_FE_CONST_INNER(d7, d6, d5, d4, d3, d2, d1, d0) { \
+    (d0) | (((uint64_t)(d1) & 0xFFFFFUL) << 32), \
+    ((uint64_t)(d1) >> 20) | (((uint64_t)(d2)) << 12) | (((uint64_t)(d3) & 0xFFUL) << 44), \
+    ((uint64_t)(d3) >> 8) | (((uint64_t)(d4) & 0xFFFFFFFUL) << 24), \
+    ((uint64_t)(d4) >> 28) | (((uint64_t)(d5)) << 4) | (((uint64_t)(d6) & 0xFFFFUL) << 36), \
+    ((uint64_t)(d6) >> 16) | (((uint64_t)(d7)) << 16) \
+}
+
+#ifdef VERIFY
+#define SECP256K1_FE_CONST(d7, d6, d5, d4, d3, d2, d1, d0) {SECP256K1_FE_CONST_INNER((d7), (d6), (d5), (d4), (d3), (d2), (d1), (d0)), 1, 1}
+#else
+#define SECP256K1_FE_CONST(d7, d6, d5, d4, d3, d2, d1, d0) {SECP256K1_FE_CONST_INNER((d7), (d6), (d5), (d4), (d3), (d2), (d1), (d0))}
+#endif
+
+typedef struct {
+    uint64_t n[4];
+} secp256k1_fe_storage;
+
+#define SECP256K1_FE_STORAGE_CONST(d7, d6, d5, d4, d3, d2, d1, d0) {{ \
+    (d0) | (((uint64_t)(d1)) << 32), \
+    (d2) | (((uint64_t)(d3)) << 32), \
+    (d4) | (((uint64_t)(d5)) << 32), \
+    (d6) | (((uint64_t)(d7)) << 32) \
+}}
+
+#define SECP256K1_FE_STORAGE_CONST_GET(d) \
+    (uint32_t)(d.n[3] >> 32), (uint32_t)d.n[3], \
+    (uint32_t)(d.n[2] >> 32), (uint32_t)d.n[2], \
+    (uint32_t)(d.n[1] >> 32), (uint32_t)d.n[1], \
+    (uint32_t)(d.n[0] >> 32), (uint32_t)d.n[0]
+
+#endif /* SECP256K1_FIELD_REPR_H */
diff --git a/depend/zcash/src/secp256k1/src/field_5x52_asm_impl.h b/depend/zcash/src/secp256k1/src/field_5x52_asm_impl.h
new file mode 100644
index 000000000..a2118044a
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/field_5x52_asm_impl.h
@@ -0,0 +1,502 @@
+/***********************************************************************
+ * Copyright (c) 2013-2014 Diederik Huys, Pieter Wuille                *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+/**
+ * Changelog:
+ * - March 2013, Diederik Huys:    original version
+ * - November 2014, Pieter Wuille: updated to use Peter Dettman's parallel multiplication algorithm
+ * - December 2014, Pieter Wuille: converted from YASM to GCC inline assembly
+ */
+
+#ifndef SECP256K1_FIELD_INNER5X52_IMPL_H
+#define SECP256K1_FIELD_INNER5X52_IMPL_H
+
+SECP256K1_INLINE static void secp256k1_fe_mul_inner(uint64_t *r, const uint64_t *a, const uint64_t * SECP256K1_RESTRICT b) {
+/**
+ * Registers: rdx:rax = multiplication accumulator
+ *            r9:r8   = c
+ *            r15:rcx = d
+ *            r10-r14 = a0-a4
+ *            rbx     = b
+ *            rdi     = r
+ *            rsi     = a / t?
+ */
+  uint64_t tmp1, tmp2, tmp3;
+__asm__ __volatile__(
+    "movq 0(%%rsi),%%r10\n"
+    "movq 8(%%rsi),%%r11\n"
+    "movq 16(%%rsi),%%r12\n"
+    "movq 24(%%rsi),%%r13\n"
+    "movq 32(%%rsi),%%r14\n"
+
+    /* d += a3 * b0 */
+    "movq 0(%%rbx),%%rax\n"
+    "mulq %%r13\n"
+    "movq %%rax,%%rcx\n"
+    "movq %%rdx,%%r15\n"
+    /* d += a2 * b1 */
+    "movq 8(%%rbx),%%rax\n"
+    "mulq %%r12\n"
+    "addq %%rax,%%rcx\n"
+    "adcq %%rdx,%%r15\n"
+    /* d += a1 * b2 */
+    "movq 16(%%rbx),%%rax\n"
+    "mulq %%r11\n"
+    "addq %%rax,%%rcx\n"
+    "adcq %%rdx,%%r15\n"
+    /* d = a0 * b3 */
+    "movq 24(%%rbx),%%rax\n"
+    "mulq %%r10\n"
+    "addq %%rax,%%rcx\n"
+    "adcq %%rdx,%%r15\n"
+    /* c = a4 * b4 */
+    "movq 32(%%rbx),%%rax\n"
+    "mulq %%r14\n"
+    "movq %%rax,%%r8\n"
+    "movq %%rdx,%%r9\n"
+    /* d += (c & M) * R */
+    "movq $0xfffffffffffff,%%rdx\n"
+    "andq %%rdx,%%rax\n"
+    "movq $0x1000003d10,%%rdx\n"
+    "mulq %%rdx\n"
+    "addq %%rax,%%rcx\n"
+    "adcq %%rdx,%%r15\n"
+    /* c >>= 52 (%%r8 only) */
+    "shrdq $52,%%r9,%%r8\n"
+    /* t3 (tmp1) = d & M */
+    "movq %%rcx,%%rsi\n"
+    "movq $0xfffffffffffff,%%rdx\n"
+    "andq %%rdx,%%rsi\n"
+    "movq %%rsi,%q1\n"
+    /* d >>= 52 */
+    "shrdq $52,%%r15,%%rcx\n"
+    "xorq %%r15,%%r15\n"
+    /* d += a4 * b0 */
+    "movq 0(%%rbx),%%rax\n"
+    "mulq %%r14\n"
+    "addq %%rax,%%rcx\n"
+    "adcq %%rdx,%%r15\n"
+    /* d += a3 * b1 */
+    "movq 8(%%rbx),%%rax\n"
+    "mulq %%r13\n"
+    "addq %%rax,%%rcx\n"
+    "adcq %%rdx,%%r15\n"
+    /* d += a2 * b2 */
+    "movq 16(%%rbx),%%rax\n"
+    "mulq %%r12\n"
+    "addq %%rax,%%rcx\n"
+    "adcq %%rdx,%%r15\n"
+    /* d += a1 * b3 */
+    "movq 24(%%rbx),%%rax\n"
+    "mulq %%r11\n"
+    "addq %%rax,%%rcx\n"
+    "adcq %%rdx,%%r15\n"
+    /* d += a0 * b4 */
+    "movq 32(%%rbx),%%rax\n"
+    "mulq %%r10\n"
+    "addq %%rax,%%rcx\n"
+    "adcq %%rdx,%%r15\n"
+    /* d += c * R */
+    "movq %%r8,%%rax\n"
+    "movq $0x1000003d10,%%rdx\n"
+    "mulq %%rdx\n"
+    "addq %%rax,%%rcx\n"
+    "adcq %%rdx,%%r15\n"
+    /* t4 = d & M (%%rsi) */
+    "movq %%rcx,%%rsi\n"
+    "movq $0xfffffffffffff,%%rdx\n"
+    "andq %%rdx,%%rsi\n"
+    /* d >>= 52 */
+    "shrdq $52,%%r15,%%rcx\n"
+    "xorq %%r15,%%r15\n"
+    /* tx = t4 >> 48 (tmp3) */
+    "movq %%rsi,%%rax\n"
+    "shrq $48,%%rax\n"
+    "movq %%rax,%q3\n"
+    /* t4 &= (M >> 4) (tmp2) */
+    "movq $0xffffffffffff,%%rax\n"
+    "andq %%rax,%%rsi\n"
+    "movq %%rsi,%q2\n"
+    /* c = a0 * b0 */
+    "movq 0(%%rbx),%%rax\n"
+    "mulq %%r10\n"
+    "movq %%rax,%%r8\n"
+    "movq %%rdx,%%r9\n"
+    /* d += a4 * b1 */
+    "movq 8(%%rbx),%%rax\n"
+    "mulq %%r14\n"
+    "addq %%rax,%%rcx\n"
+    "adcq %%rdx,%%r15\n"
+    /* d += a3 * b2 */
+    "movq 16(%%rbx),%%rax\n"
+    "mulq %%r13\n"
+    "addq %%rax,%%rcx\n"
+    "adcq %%rdx,%%r15\n"
+    /* d += a2 * b3 */
+    "movq 24(%%rbx),%%rax\n"
+    "mulq %%r12\n"
+    "addq %%rax,%%rcx\n"
+    "adcq %%rdx,%%r15\n"
+    /* d += a1 * b4 */
+    "movq 32(%%rbx),%%rax\n"
+    "mulq %%r11\n"
+    "addq %%rax,%%rcx\n"
+    "adcq %%rdx,%%r15\n"
+    /* u0 = d & M (%%rsi) */
+    "movq %%rcx,%%rsi\n"
+    "movq $0xfffffffffffff,%%rdx\n"
+    "andq %%rdx,%%rsi\n"
+    /* d >>= 52 */
+    "shrdq $52,%%r15,%%rcx\n"
+    "xorq %%r15,%%r15\n"
+    /* u0 = (u0 << 4) | tx (%%rsi) */
+    "shlq $4,%%rsi\n"
+    "movq %q3,%%rax\n"
+    "orq %%rax,%%rsi\n"
+    /* c += u0 * (R >> 4) */
+    "movq $0x1000003d1,%%rax\n"
+    "mulq %%rsi\n"
+    "addq %%rax,%%r8\n"
+    "adcq %%rdx,%%r9\n"
+    /* r[0] = c & M */
+    "movq %%r8,%%rax\n"
+    "movq $0xfffffffffffff,%%rdx\n"
+    "andq %%rdx,%%rax\n"
+    "movq %%rax,0(%%rdi)\n"
+    /* c >>= 52 */
+    "shrdq $52,%%r9,%%r8\n"
+    "xorq %%r9,%%r9\n"
+    /* c += a1 * b0 */
+    "movq 0(%%rbx),%%rax\n"
+    "mulq %%r11\n"
+    "addq %%rax,%%r8\n"
+    "adcq %%rdx,%%r9\n"
+    /* c += a0 * b1 */
+    "movq 8(%%rbx),%%rax\n"
+    "mulq %%r10\n"
+    "addq %%rax,%%r8\n"
+    "adcq %%rdx,%%r9\n"
+    /* d += a4 * b2 */
+    "movq 16(%%rbx),%%rax\n"
+    "mulq %%r14\n"
+    "addq %%rax,%%rcx\n"
+    "adcq %%rdx,%%r15\n"
+    /* d += a3 * b3 */
+    "movq 24(%%rbx),%%rax\n"
+    "mulq %%r13\n"
+    "addq %%rax,%%rcx\n"
+    "adcq %%rdx,%%r15\n"
+    /* d += a2 * b4 */
+    "movq 32(%%rbx),%%rax\n"
+    "mulq %%r12\n"
+    "addq %%rax,%%rcx\n"
+    "adcq %%rdx,%%r15\n"
+    /* c += (d & M) * R */
+    "movq %%rcx,%%rax\n"
+    "movq $0xfffffffffffff,%%rdx\n"
+    "andq %%rdx,%%rax\n"
+    "movq $0x1000003d10,%%rdx\n"
+    "mulq %%rdx\n"
+    "addq %%rax,%%r8\n"
+    "adcq %%rdx,%%r9\n"
+    /* d >>= 52 */
+    "shrdq $52,%%r15,%%rcx\n"
+    "xorq %%r15,%%r15\n"
+    /* r[1] = c & M */
+    "movq %%r8,%%rax\n"
+    "movq $0xfffffffffffff,%%rdx\n"
+    "andq %%rdx,%%rax\n"
+    "movq %%rax,8(%%rdi)\n"
+    /* c >>= 52 */
+    "shrdq $52,%%r9,%%r8\n"
+    "xorq %%r9,%%r9\n"
+    /* c += a2 * b0 */
+    "movq 0(%%rbx),%%rax\n"
+    "mulq %%r12\n"
+    "addq %%rax,%%r8\n"
+    "adcq %%rdx,%%r9\n"
+    /* c += a1 * b1 */
+    "movq 8(%%rbx),%%rax\n"
+    "mulq %%r11\n"
+    "addq %%rax,%%r8\n"
+    "adcq %%rdx,%%r9\n"
+    /* c += a0 * b2 (last use of %%r10 = a0) */
+    "movq 16(%%rbx),%%rax\n"
+    "mulq %%r10\n"
+    "addq %%rax,%%r8\n"
+    "adcq %%rdx,%%r9\n"
+    /* fetch t3 (%%r10, overwrites a0), t4 (%%rsi) */
+    "movq %q2,%%rsi\n"
+    "movq %q1,%%r10\n"
+    /* d += a4 * b3 */
+    "movq 24(%%rbx),%%rax\n"
+    "mulq %%r14\n"
+    "addq %%rax,%%rcx\n"
+    "adcq %%rdx,%%r15\n"
+    /* d += a3 * b4 */
+    "movq 32(%%rbx),%%rax\n"
+    "mulq %%r13\n"
+    "addq %%rax,%%rcx\n"
+    "adcq %%rdx,%%r15\n"
+    /* c += (d & M) * R */
+    "movq %%rcx,%%rax\n"
+    "movq $0xfffffffffffff,%%rdx\n"
+    "andq %%rdx,%%rax\n"
+    "movq $0x1000003d10,%%rdx\n"
+    "mulq %%rdx\n"
+    "addq %%rax,%%r8\n"
+    "adcq %%rdx,%%r9\n"
+    /* d >>= 52 (%%rcx only) */
+    "shrdq $52,%%r15,%%rcx\n"
+    /* r[2] = c & M */
+    "movq %%r8,%%rax\n"
+    "movq $0xfffffffffffff,%%rdx\n"
+    "andq %%rdx,%%rax\n"
+    "movq %%rax,16(%%rdi)\n"
+    /* c >>= 52 */
+    "shrdq $52,%%r9,%%r8\n"
+    "xorq %%r9,%%r9\n"
+    /* c += t3 */
+    "addq %%r10,%%r8\n"
+    /* c += d * R */
+    "movq %%rcx,%%rax\n"
+    "movq $0x1000003d10,%%rdx\n"
+    "mulq %%rdx\n"
+    "addq %%rax,%%r8\n"
+    "adcq %%rdx,%%r9\n"
+    /* r[3] = c & M */
+    "movq %%r8,%%rax\n"
+    "movq $0xfffffffffffff,%%rdx\n"
+    "andq %%rdx,%%rax\n"
+    "movq %%rax,24(%%rdi)\n"
+    /* c >>= 52 (%%r8 only) */
+    "shrdq $52,%%r9,%%r8\n"
+    /* c += t4 (%%r8 only) */
+    "addq %%rsi,%%r8\n"
+    /* r[4] = c */
+    "movq %%r8,32(%%rdi)\n"
+: "+S"(a), "=m"(tmp1), "=m"(tmp2), "=m"(tmp3)
+: "b"(b), "D"(r)
+: "%rax", "%rcx", "%rdx", "%r8", "%r9", "%r10", "%r11", "%r12", "%r13", "%r14", "%r15", "cc", "memory"
+);
+}
+
+SECP256K1_INLINE static void secp256k1_fe_sqr_inner(uint64_t *r, const uint64_t *a) {
+/**
+ * Registers: rdx:rax = multiplication accumulator
+ *            r9:r8   = c
+ *            rcx:rbx = d
+ *            r10-r14 = a0-a4
+ *            r15     = M (0xfffffffffffff)
+ *            rdi     = r
+ *            rsi     = a / t?
+ */
+  uint64_t tmp1, tmp2, tmp3;
+__asm__ __volatile__(
+    "movq 0(%%rsi),%%r10\n"
+    "movq 8(%%rsi),%%r11\n"
+    "movq 16(%%rsi),%%r12\n"
+    "movq 24(%%rsi),%%r13\n"
+    "movq 32(%%rsi),%%r14\n"
+    "movq $0xfffffffffffff,%%r15\n"
+
+    /* d = (a0*2) * a3 */
+    "leaq (%%r10,%%r10,1),%%rax\n"
+    "mulq %%r13\n"
+    "movq %%rax,%%rbx\n"
+    "movq %%rdx,%%rcx\n"
+    /* d += (a1*2) * a2 */
+    "leaq (%%r11,%%r11,1),%%rax\n"
+    "mulq %%r12\n"
+    "addq %%rax,%%rbx\n"
+    "adcq %%rdx,%%rcx\n"
+    /* c = a4 * a4 */
+    "movq %%r14,%%rax\n"
+    "mulq %%r14\n"
+    "movq %%rax,%%r8\n"
+    "movq %%rdx,%%r9\n"
+    /* d += (c & M) * R */
+    "andq %%r15,%%rax\n"
+    "movq $0x1000003d10,%%rdx\n"
+    "mulq %%rdx\n"
+    "addq %%rax,%%rbx\n"
+    "adcq %%rdx,%%rcx\n"
+    /* c >>= 52 (%%r8 only) */
+    "shrdq $52,%%r9,%%r8\n"
+    /* t3 (tmp1) = d & M */
+    "movq %%rbx,%%rsi\n"
+    "andq %%r15,%%rsi\n"
+    "movq %%rsi,%q1\n"
+    /* d >>= 52 */
+    "shrdq $52,%%rcx,%%rbx\n"
+    "xorq %%rcx,%%rcx\n"
+    /* a4 *= 2 */
+    "addq %%r14,%%r14\n"
+    /* d += a0 * a4 */
+    "movq %%r10,%%rax\n"
+    "mulq %%r14\n"
+    "addq %%rax,%%rbx\n"
+    "adcq %%rdx,%%rcx\n"
+    /* d+= (a1*2) * a3 */
+    "leaq (%%r11,%%r11,1),%%rax\n"
+    "mulq %%r13\n"
+    "addq %%rax,%%rbx\n"
+    "adcq %%rdx,%%rcx\n"
+    /* d += a2 * a2 */
+    "movq %%r12,%%rax\n"
+    "mulq %%r12\n"
+    "addq %%rax,%%rbx\n"
+    "adcq %%rdx,%%rcx\n"
+    /* d += c * R */
+    "movq %%r8,%%rax\n"
+    "movq $0x1000003d10,%%rdx\n"
+    "mulq %%rdx\n"
+    "addq %%rax,%%rbx\n"
+    "adcq %%rdx,%%rcx\n"
+    /* t4 = d & M (%%rsi) */
+    "movq %%rbx,%%rsi\n"
+    "andq %%r15,%%rsi\n"
+    /* d >>= 52 */
+    "shrdq $52,%%rcx,%%rbx\n"
+    "xorq %%rcx,%%rcx\n"
+    /* tx = t4 >> 48 (tmp3) */
+    "movq %%rsi,%%rax\n"
+    "shrq $48,%%rax\n"
+    "movq %%rax,%q3\n"
+    /* t4 &= (M >> 4) (tmp2) */
+    "movq $0xffffffffffff,%%rax\n"
+    "andq %%rax,%%rsi\n"
+    "movq %%rsi,%q2\n"
+    /* c = a0 * a0 */
+    "movq %%r10,%%rax\n"
+    "mulq %%r10\n"
+    "movq %%rax,%%r8\n"
+    "movq %%rdx,%%r9\n"
+    /* d += a1 * a4 */
+    "movq %%r11,%%rax\n"
+    "mulq %%r14\n"
+    "addq %%rax,%%rbx\n"
+    "adcq %%rdx,%%rcx\n"
+    /* d += (a2*2) * a3 */
+    "leaq (%%r12,%%r12,1),%%rax\n"
+    "mulq %%r13\n"
+    "addq %%rax,%%rbx\n"
+    "adcq %%rdx,%%rcx\n"
+    /* u0 = d & M (%%rsi) */
+    "movq %%rbx,%%rsi\n"
+    "andq %%r15,%%rsi\n"
+    /* d >>= 52 */
+    "shrdq $52,%%rcx,%%rbx\n"
+    "xorq %%rcx,%%rcx\n"
+    /* u0 = (u0 << 4) | tx (%%rsi) */
+    "shlq $4,%%rsi\n"
+    "movq %q3,%%rax\n"
+    "orq %%rax,%%rsi\n"
+    /* c += u0 * (R >> 4) */
+    "movq $0x1000003d1,%%rax\n"
+    "mulq %%rsi\n"
+    "addq %%rax,%%r8\n"
+    "adcq %%rdx,%%r9\n"
+    /* r[0] = c & M */
+    "movq %%r8,%%rax\n"
+    "andq %%r15,%%rax\n"
+    "movq %%rax,0(%%rdi)\n"
+    /* c >>= 52 */
+    "shrdq $52,%%r9,%%r8\n"
+    "xorq %%r9,%%r9\n"
+    /* a0 *= 2 */
+    "addq %%r10,%%r10\n"
+    /* c += a0 * a1 */
+    "movq %%r10,%%rax\n"
+    "mulq %%r11\n"
+    "addq %%rax,%%r8\n"
+    "adcq %%rdx,%%r9\n"
+    /* d += a2 * a4 */
+    "movq %%r12,%%rax\n"
+    "mulq %%r14\n"
+    "addq %%rax,%%rbx\n"
+    "adcq %%rdx,%%rcx\n"
+    /* d += a3 * a3 */
+    "movq %%r13,%%rax\n"
+    "mulq %%r13\n"
+    "addq %%rax,%%rbx\n"
+    "adcq %%rdx,%%rcx\n"
+    /* c += (d & M) * R */
+    "movq %%rbx,%%rax\n"
+    "andq %%r15,%%rax\n"
+    "movq $0x1000003d10,%%rdx\n"
+    "mulq %%rdx\n"
+    "addq %%rax,%%r8\n"
+    "adcq %%rdx,%%r9\n"
+    /* d >>= 52 */
+    "shrdq $52,%%rcx,%%rbx\n"
+    "xorq %%rcx,%%rcx\n"
+    /* r[1] = c & M */
+    "movq %%r8,%%rax\n"
+    "andq %%r15,%%rax\n"
+    "movq %%rax,8(%%rdi)\n"
+    /* c >>= 52 */
+    "shrdq $52,%%r9,%%r8\n"
+    "xorq %%r9,%%r9\n"
+    /* c += a0 * a2 (last use of %%r10) */
+    "movq %%r10,%%rax\n"
+    "mulq %%r12\n"
+    "addq %%rax,%%r8\n"
+    "adcq %%rdx,%%r9\n"
+    /* fetch t3 (%%r10, overwrites a0),t4 (%%rsi) */
+    "movq %q2,%%rsi\n"
+    "movq %q1,%%r10\n"
+    /* c += a1 * a1 */
+    "movq %%r11,%%rax\n"
+    "mulq %%r11\n"
+    "addq %%rax,%%r8\n"
+    "adcq %%rdx,%%r9\n"
+    /* d += a3 * a4 */
+    "movq %%r13,%%rax\n"
+    "mulq %%r14\n"
+    "addq %%rax,%%rbx\n"
+    "adcq %%rdx,%%rcx\n"
+    /* c += (d & M) * R */
+    "movq %%rbx,%%rax\n"
+    "andq %%r15,%%rax\n"
+    "movq $0x1000003d10,%%rdx\n"
+    "mulq %%rdx\n"
+    "addq %%rax,%%r8\n"
+    "adcq %%rdx,%%r9\n"
+    /* d >>= 52 (%%rbx only) */
+    "shrdq $52,%%rcx,%%rbx\n"
+    /* r[2] = c & M */
+    "movq %%r8,%%rax\n"
+    "andq %%r15,%%rax\n"
+    "movq %%rax,16(%%rdi)\n"
+    /* c >>= 52 */
+    "shrdq $52,%%r9,%%r8\n"
+    "xorq %%r9,%%r9\n"
+    /* c += t3 */
+    "addq %%r10,%%r8\n"
+    /* c += d * R */
+    "movq %%rbx,%%rax\n"
+    "movq $0x1000003d10,%%rdx\n"
+    "mulq %%rdx\n"
+    "addq %%rax,%%r8\n"
+    "adcq %%rdx,%%r9\n"
+    /* r[3] = c & M */
+    "movq %%r8,%%rax\n"
+    "andq %%r15,%%rax\n"
+    "movq %%rax,24(%%rdi)\n"
+    /* c >>= 52 (%%r8 only) */
+    "shrdq $52,%%r9,%%r8\n"
+    /* c += t4 (%%r8 only) */
+    "addq %%rsi,%%r8\n"
+    /* r[4] = c */
+    "movq %%r8,32(%%rdi)\n"
+: "+S"(a), "=m"(tmp1), "=m"(tmp2), "=m"(tmp3)
+: "D"(r)
+: "%rax", "%rbx", "%rcx", "%rdx", "%r8", "%r9", "%r10", "%r11", "%r12", "%r13", "%r14", "%r15", "cc", "memory"
+);
+}
+
+#endif /* SECP256K1_FIELD_INNER5X52_IMPL_H */
diff --git a/depend/zcash/src/secp256k1/src/field_5x52_impl.h b/depend/zcash/src/secp256k1/src/field_5x52_impl.h
new file mode 100644
index 000000000..3465ea324
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/field_5x52_impl.h
@@ -0,0 +1,501 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_FIELD_REPR_IMPL_H
+#define SECP256K1_FIELD_REPR_IMPL_H
+
+#if defined HAVE_CONFIG_H
+#include "libsecp256k1-config.h"
+#endif
+
+#include "util.h"
+#include "field.h"
+
+#if defined(USE_ASM_X86_64)
+#include "field_5x52_asm_impl.h"
+#else
+#include "field_5x52_int128_impl.h"
+#endif
+
+/** Implements arithmetic modulo FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFF FFFFFFFE FFFFFC2F,
+ *  represented as 5 uint64_t's in base 2^52. The values are allowed to contain >52 each. In particular,
+ *  each FieldElem has a 'magnitude' associated with it. Internally, a magnitude M means each element
+ *  is at most M*(2^53-1), except the most significant one, which is limited to M*(2^49-1). All operations
+ *  accept any input with magnitude at most M, and have different rules for propagating magnitude to their
+ *  output.
+ */
+
+#ifdef VERIFY
+static void secp256k1_fe_verify(const secp256k1_fe *a) {
+    const uint64_t *d = a->n;
+    int m = a->normalized ? 1 : 2 * a->magnitude, r = 1;
+   /* secp256k1 'p' value defined in "Standards for Efficient Cryptography" (SEC2) 2.7.1. */
+    r &= (d[0] <= 0xFFFFFFFFFFFFFULL * m);
+    r &= (d[1] <= 0xFFFFFFFFFFFFFULL * m);
+    r &= (d[2] <= 0xFFFFFFFFFFFFFULL * m);
+    r &= (d[3] <= 0xFFFFFFFFFFFFFULL * m);
+    r &= (d[4] <= 0x0FFFFFFFFFFFFULL * m);
+    r &= (a->magnitude >= 0);
+    r &= (a->magnitude <= 2048);
+    if (a->normalized) {
+        r &= (a->magnitude <= 1);
+        if (r && (d[4] == 0x0FFFFFFFFFFFFULL) && ((d[3] & d[2] & d[1]) == 0xFFFFFFFFFFFFFULL)) {
+            r &= (d[0] < 0xFFFFEFFFFFC2FULL);
+        }
+    }
+    VERIFY_CHECK(r == 1);
+}
+#endif
+
+static void secp256k1_fe_normalize(secp256k1_fe *r) {
+    uint64_t t0 = r->n[0], t1 = r->n[1], t2 = r->n[2], t3 = r->n[3], t4 = r->n[4];
+
+    /* Reduce t4 at the start so there will be at most a single carry from the first pass */
+    uint64_t m;
+    uint64_t x = t4 >> 48; t4 &= 0x0FFFFFFFFFFFFULL;
+
+    /* The first pass ensures the magnitude is 1, ... */
+    t0 += x * 0x1000003D1ULL;
+    t1 += (t0 >> 52); t0 &= 0xFFFFFFFFFFFFFULL;
+    t2 += (t1 >> 52); t1 &= 0xFFFFFFFFFFFFFULL; m = t1;
+    t3 += (t2 >> 52); t2 &= 0xFFFFFFFFFFFFFULL; m &= t2;
+    t4 += (t3 >> 52); t3 &= 0xFFFFFFFFFFFFFULL; m &= t3;
+
+    /* ... except for a possible carry at bit 48 of t4 (i.e. bit 256 of the field element) */
+    VERIFY_CHECK(t4 >> 49 == 0);
+
+    /* At most a single final reduction is needed; check if the value is >= the field characteristic */
+    x = (t4 >> 48) | ((t4 == 0x0FFFFFFFFFFFFULL) & (m == 0xFFFFFFFFFFFFFULL)
+        & (t0 >= 0xFFFFEFFFFFC2FULL));
+
+    /* Apply the final reduction (for constant-time behaviour, we do it always) */
+    t0 += x * 0x1000003D1ULL;
+    t1 += (t0 >> 52); t0 &= 0xFFFFFFFFFFFFFULL;
+    t2 += (t1 >> 52); t1 &= 0xFFFFFFFFFFFFFULL;
+    t3 += (t2 >> 52); t2 &= 0xFFFFFFFFFFFFFULL;
+    t4 += (t3 >> 52); t3 &= 0xFFFFFFFFFFFFFULL;
+
+    /* If t4 didn't carry to bit 48 already, then it should have after any final reduction */
+    VERIFY_CHECK(t4 >> 48 == x);
+
+    /* Mask off the possible multiple of 2^256 from the final reduction */
+    t4 &= 0x0FFFFFFFFFFFFULL;
+
+    r->n[0] = t0; r->n[1] = t1; r->n[2] = t2; r->n[3] = t3; r->n[4] = t4;
+
+#ifdef VERIFY
+    r->magnitude = 1;
+    r->normalized = 1;
+    secp256k1_fe_verify(r);
+#endif
+}
+
+static void secp256k1_fe_normalize_weak(secp256k1_fe *r) {
+    uint64_t t0 = r->n[0], t1 = r->n[1], t2 = r->n[2], t3 = r->n[3], t4 = r->n[4];
+
+    /* Reduce t4 at the start so there will be at most a single carry from the first pass */
+    uint64_t x = t4 >> 48; t4 &= 0x0FFFFFFFFFFFFULL;
+
+    /* The first pass ensures the magnitude is 1, ... */
+    t0 += x * 0x1000003D1ULL;
+    t1 += (t0 >> 52); t0 &= 0xFFFFFFFFFFFFFULL;
+    t2 += (t1 >> 52); t1 &= 0xFFFFFFFFFFFFFULL;
+    t3 += (t2 >> 52); t2 &= 0xFFFFFFFFFFFFFULL;
+    t4 += (t3 >> 52); t3 &= 0xFFFFFFFFFFFFFULL;
+
+    /* ... except for a possible carry at bit 48 of t4 (i.e. bit 256 of the field element) */
+    VERIFY_CHECK(t4 >> 49 == 0);
+
+    r->n[0] = t0; r->n[1] = t1; r->n[2] = t2; r->n[3] = t3; r->n[4] = t4;
+
+#ifdef VERIFY
+    r->magnitude = 1;
+    secp256k1_fe_verify(r);
+#endif
+}
+
+static void secp256k1_fe_normalize_var(secp256k1_fe *r) {
+    uint64_t t0 = r->n[0], t1 = r->n[1], t2 = r->n[2], t3 = r->n[3], t4 = r->n[4];
+
+    /* Reduce t4 at the start so there will be at most a single carry from the first pass */
+    uint64_t m;
+    uint64_t x = t4 >> 48; t4 &= 0x0FFFFFFFFFFFFULL;
+
+    /* The first pass ensures the magnitude is 1, ... */
+    t0 += x * 0x1000003D1ULL;
+    t1 += (t0 >> 52); t0 &= 0xFFFFFFFFFFFFFULL;
+    t2 += (t1 >> 52); t1 &= 0xFFFFFFFFFFFFFULL; m = t1;
+    t3 += (t2 >> 52); t2 &= 0xFFFFFFFFFFFFFULL; m &= t2;
+    t4 += (t3 >> 52); t3 &= 0xFFFFFFFFFFFFFULL; m &= t3;
+
+    /* ... except for a possible carry at bit 48 of t4 (i.e. bit 256 of the field element) */
+    VERIFY_CHECK(t4 >> 49 == 0);
+
+    /* At most a single final reduction is needed; check if the value is >= the field characteristic */
+    x = (t4 >> 48) | ((t4 == 0x0FFFFFFFFFFFFULL) & (m == 0xFFFFFFFFFFFFFULL)
+        & (t0 >= 0xFFFFEFFFFFC2FULL));
+
+    if (x) {
+        t0 += 0x1000003D1ULL;
+        t1 += (t0 >> 52); t0 &= 0xFFFFFFFFFFFFFULL;
+        t2 += (t1 >> 52); t1 &= 0xFFFFFFFFFFFFFULL;
+        t3 += (t2 >> 52); t2 &= 0xFFFFFFFFFFFFFULL;
+        t4 += (t3 >> 52); t3 &= 0xFFFFFFFFFFFFFULL;
+
+        /* If t4 didn't carry to bit 48 already, then it should have after any final reduction */
+        VERIFY_CHECK(t4 >> 48 == x);
+
+        /* Mask off the possible multiple of 2^256 from the final reduction */
+        t4 &= 0x0FFFFFFFFFFFFULL;
+    }
+
+    r->n[0] = t0; r->n[1] = t1; r->n[2] = t2; r->n[3] = t3; r->n[4] = t4;
+
+#ifdef VERIFY
+    r->magnitude = 1;
+    r->normalized = 1;
+    secp256k1_fe_verify(r);
+#endif
+}
+
+static int secp256k1_fe_normalizes_to_zero(secp256k1_fe *r) {
+    uint64_t t0 = r->n[0], t1 = r->n[1], t2 = r->n[2], t3 = r->n[3], t4 = r->n[4];
+
+    /* z0 tracks a possible raw value of 0, z1 tracks a possible raw value of P */
+    uint64_t z0, z1;
+
+    /* Reduce t4 at the start so there will be at most a single carry from the first pass */
+    uint64_t x = t4 >> 48; t4 &= 0x0FFFFFFFFFFFFULL;
+
+    /* The first pass ensures the magnitude is 1, ... */
+    t0 += x * 0x1000003D1ULL;
+    t1 += (t0 >> 52); t0 &= 0xFFFFFFFFFFFFFULL; z0  = t0; z1  = t0 ^ 0x1000003D0ULL;
+    t2 += (t1 >> 52); t1 &= 0xFFFFFFFFFFFFFULL; z0 |= t1; z1 &= t1;
+    t3 += (t2 >> 52); t2 &= 0xFFFFFFFFFFFFFULL; z0 |= t2; z1 &= t2;
+    t4 += (t3 >> 52); t3 &= 0xFFFFFFFFFFFFFULL; z0 |= t3; z1 &= t3;
+                                                z0 |= t4; z1 &= t4 ^ 0xF000000000000ULL;
+
+    /* ... except for a possible carry at bit 48 of t4 (i.e. bit 256 of the field element) */
+    VERIFY_CHECK(t4 >> 49 == 0);
+
+    return (z0 == 0) | (z1 == 0xFFFFFFFFFFFFFULL);
+}
+
+static int secp256k1_fe_normalizes_to_zero_var(secp256k1_fe *r) {
+    uint64_t t0, t1, t2, t3, t4;
+    uint64_t z0, z1;
+    uint64_t x;
+
+    t0 = r->n[0];
+    t4 = r->n[4];
+
+    /* Reduce t4 at the start so there will be at most a single carry from the first pass */
+    x = t4 >> 48;
+
+    /* The first pass ensures the magnitude is 1, ... */
+    t0 += x * 0x1000003D1ULL;
+
+    /* z0 tracks a possible raw value of 0, z1 tracks a possible raw value of P */
+    z0 = t0 & 0xFFFFFFFFFFFFFULL;
+    z1 = z0 ^ 0x1000003D0ULL;
+
+    /* Fast return path should catch the majority of cases */
+    if ((z0 != 0ULL) & (z1 != 0xFFFFFFFFFFFFFULL)) {
+        return 0;
+    }
+
+    t1 = r->n[1];
+    t2 = r->n[2];
+    t3 = r->n[3];
+
+    t4 &= 0x0FFFFFFFFFFFFULL;
+
+    t1 += (t0 >> 52);
+    t2 += (t1 >> 52); t1 &= 0xFFFFFFFFFFFFFULL; z0 |= t1; z1 &= t1;
+    t3 += (t2 >> 52); t2 &= 0xFFFFFFFFFFFFFULL; z0 |= t2; z1 &= t2;
+    t4 += (t3 >> 52); t3 &= 0xFFFFFFFFFFFFFULL; z0 |= t3; z1 &= t3;
+                                                z0 |= t4; z1 &= t4 ^ 0xF000000000000ULL;
+
+    /* ... except for a possible carry at bit 48 of t4 (i.e. bit 256 of the field element) */
+    VERIFY_CHECK(t4 >> 49 == 0);
+
+    return (z0 == 0) | (z1 == 0xFFFFFFFFFFFFFULL);
+}
+
+SECP256K1_INLINE static void secp256k1_fe_set_int(secp256k1_fe *r, int a) {
+    r->n[0] = a;
+    r->n[1] = r->n[2] = r->n[3] = r->n[4] = 0;
+#ifdef VERIFY
+    r->magnitude = 1;
+    r->normalized = 1;
+    secp256k1_fe_verify(r);
+#endif
+}
+
+SECP256K1_INLINE static int secp256k1_fe_is_zero(const secp256k1_fe *a) {
+    const uint64_t *t = a->n;
+#ifdef VERIFY
+    VERIFY_CHECK(a->normalized);
+    secp256k1_fe_verify(a);
+#endif
+    return (t[0] | t[1] | t[2] | t[3] | t[4]) == 0;
+}
+
+SECP256K1_INLINE static int secp256k1_fe_is_odd(const secp256k1_fe *a) {
+#ifdef VERIFY
+    VERIFY_CHECK(a->normalized);
+    secp256k1_fe_verify(a);
+#endif
+    return a->n[0] & 1;
+}
+
+SECP256K1_INLINE static void secp256k1_fe_clear(secp256k1_fe *a) {
+    int i;
+#ifdef VERIFY
+    a->magnitude = 0;
+    a->normalized = 1;
+#endif
+    for (i=0; i<5; i++) {
+        a->n[i] = 0;
+    }
+}
+
+static int secp256k1_fe_cmp_var(const secp256k1_fe *a, const secp256k1_fe *b) {
+    int i;
+#ifdef VERIFY
+    VERIFY_CHECK(a->normalized);
+    VERIFY_CHECK(b->normalized);
+    secp256k1_fe_verify(a);
+    secp256k1_fe_verify(b);
+#endif
+    for (i = 4; i >= 0; i--) {
+        if (a->n[i] > b->n[i]) {
+            return 1;
+        }
+        if (a->n[i] < b->n[i]) {
+            return -1;
+        }
+    }
+    return 0;
+}
+
+static int secp256k1_fe_set_b32(secp256k1_fe *r, const unsigned char *a) {
+    int ret;
+    r->n[0] = (uint64_t)a[31]
+            | ((uint64_t)a[30] << 8)
+            | ((uint64_t)a[29] << 16)
+            | ((uint64_t)a[28] << 24)
+            | ((uint64_t)a[27] << 32)
+            | ((uint64_t)a[26] << 40)
+            | ((uint64_t)(a[25] & 0xF)  << 48);
+    r->n[1] = (uint64_t)((a[25] >> 4) & 0xF)
+            | ((uint64_t)a[24] << 4)
+            | ((uint64_t)a[23] << 12)
+            | ((uint64_t)a[22] << 20)
+            | ((uint64_t)a[21] << 28)
+            | ((uint64_t)a[20] << 36)
+            | ((uint64_t)a[19] << 44);
+    r->n[2] = (uint64_t)a[18]
+            | ((uint64_t)a[17] << 8)
+            | ((uint64_t)a[16] << 16)
+            | ((uint64_t)a[15] << 24)
+            | ((uint64_t)a[14] << 32)
+            | ((uint64_t)a[13] << 40)
+            | ((uint64_t)(a[12] & 0xF) << 48);
+    r->n[3] = (uint64_t)((a[12] >> 4) & 0xF)
+            | ((uint64_t)a[11] << 4)
+            | ((uint64_t)a[10] << 12)
+            | ((uint64_t)a[9]  << 20)
+            | ((uint64_t)a[8]  << 28)
+            | ((uint64_t)a[7]  << 36)
+            | ((uint64_t)a[6]  << 44);
+    r->n[4] = (uint64_t)a[5]
+            | ((uint64_t)a[4] << 8)
+            | ((uint64_t)a[3] << 16)
+            | ((uint64_t)a[2] << 24)
+            | ((uint64_t)a[1] << 32)
+            | ((uint64_t)a[0] << 40);
+    ret = !((r->n[4] == 0x0FFFFFFFFFFFFULL) & ((r->n[3] & r->n[2] & r->n[1]) == 0xFFFFFFFFFFFFFULL) & (r->n[0] >= 0xFFFFEFFFFFC2FULL));
+#ifdef VERIFY
+    r->magnitude = 1;
+    if (ret) {
+        r->normalized = 1;
+        secp256k1_fe_verify(r);
+    } else {
+        r->normalized = 0;
+    }
+#endif
+    return ret;
+}
+
+/** Convert a field element to a 32-byte big endian value. Requires the input to be normalized */
+static void secp256k1_fe_get_b32(unsigned char *r, const secp256k1_fe *a) {
+#ifdef VERIFY
+    VERIFY_CHECK(a->normalized);
+    secp256k1_fe_verify(a);
+#endif
+    r[0] = (a->n[4] >> 40) & 0xFF;
+    r[1] = (a->n[4] >> 32) & 0xFF;
+    r[2] = (a->n[4] >> 24) & 0xFF;
+    r[3] = (a->n[4] >> 16) & 0xFF;
+    r[4] = (a->n[4] >> 8) & 0xFF;
+    r[5] = a->n[4] & 0xFF;
+    r[6] = (a->n[3] >> 44) & 0xFF;
+    r[7] = (a->n[3] >> 36) & 0xFF;
+    r[8] = (a->n[3] >> 28) & 0xFF;
+    r[9] = (a->n[3] >> 20) & 0xFF;
+    r[10] = (a->n[3] >> 12) & 0xFF;
+    r[11] = (a->n[3] >> 4) & 0xFF;
+    r[12] = ((a->n[2] >> 48) & 0xF) | ((a->n[3] & 0xF) << 4);
+    r[13] = (a->n[2] >> 40) & 0xFF;
+    r[14] = (a->n[2] >> 32) & 0xFF;
+    r[15] = (a->n[2] >> 24) & 0xFF;
+    r[16] = (a->n[2] >> 16) & 0xFF;
+    r[17] = (a->n[2] >> 8) & 0xFF;
+    r[18] = a->n[2] & 0xFF;
+    r[19] = (a->n[1] >> 44) & 0xFF;
+    r[20] = (a->n[1] >> 36) & 0xFF;
+    r[21] = (a->n[1] >> 28) & 0xFF;
+    r[22] = (a->n[1] >> 20) & 0xFF;
+    r[23] = (a->n[1] >> 12) & 0xFF;
+    r[24] = (a->n[1] >> 4) & 0xFF;
+    r[25] = ((a->n[0] >> 48) & 0xF) | ((a->n[1] & 0xF) << 4);
+    r[26] = (a->n[0] >> 40) & 0xFF;
+    r[27] = (a->n[0] >> 32) & 0xFF;
+    r[28] = (a->n[0] >> 24) & 0xFF;
+    r[29] = (a->n[0] >> 16) & 0xFF;
+    r[30] = (a->n[0] >> 8) & 0xFF;
+    r[31] = a->n[0] & 0xFF;
+}
+
+SECP256K1_INLINE static void secp256k1_fe_negate(secp256k1_fe *r, const secp256k1_fe *a, int m) {
+#ifdef VERIFY
+    VERIFY_CHECK(a->magnitude <= m);
+    secp256k1_fe_verify(a);
+#endif
+    r->n[0] = 0xFFFFEFFFFFC2FULL * 2 * (m + 1) - a->n[0];
+    r->n[1] = 0xFFFFFFFFFFFFFULL * 2 * (m + 1) - a->n[1];
+    r->n[2] = 0xFFFFFFFFFFFFFULL * 2 * (m + 1) - a->n[2];
+    r->n[3] = 0xFFFFFFFFFFFFFULL * 2 * (m + 1) - a->n[3];
+    r->n[4] = 0x0FFFFFFFFFFFFULL * 2 * (m + 1) - a->n[4];
+#ifdef VERIFY
+    r->magnitude = m + 1;
+    r->normalized = 0;
+    secp256k1_fe_verify(r);
+#endif
+}
+
+SECP256K1_INLINE static void secp256k1_fe_mul_int(secp256k1_fe *r, int a) {
+    r->n[0] *= a;
+    r->n[1] *= a;
+    r->n[2] *= a;
+    r->n[3] *= a;
+    r->n[4] *= a;
+#ifdef VERIFY
+    r->magnitude *= a;
+    r->normalized = 0;
+    secp256k1_fe_verify(r);
+#endif
+}
+
+SECP256K1_INLINE static void secp256k1_fe_add(secp256k1_fe *r, const secp256k1_fe *a) {
+#ifdef VERIFY
+    secp256k1_fe_verify(a);
+#endif
+    r->n[0] += a->n[0];
+    r->n[1] += a->n[1];
+    r->n[2] += a->n[2];
+    r->n[3] += a->n[3];
+    r->n[4] += a->n[4];
+#ifdef VERIFY
+    r->magnitude += a->magnitude;
+    r->normalized = 0;
+    secp256k1_fe_verify(r);
+#endif
+}
+
+static void secp256k1_fe_mul(secp256k1_fe *r, const secp256k1_fe *a, const secp256k1_fe * SECP256K1_RESTRICT b) {
+#ifdef VERIFY
+    VERIFY_CHECK(a->magnitude <= 8);
+    VERIFY_CHECK(b->magnitude <= 8);
+    secp256k1_fe_verify(a);
+    secp256k1_fe_verify(b);
+    VERIFY_CHECK(r != b);
+    VERIFY_CHECK(a != b);
+#endif
+    secp256k1_fe_mul_inner(r->n, a->n, b->n);
+#ifdef VERIFY
+    r->magnitude = 1;
+    r->normalized = 0;
+    secp256k1_fe_verify(r);
+#endif
+}
+
+static void secp256k1_fe_sqr(secp256k1_fe *r, const secp256k1_fe *a) {
+#ifdef VERIFY
+    VERIFY_CHECK(a->magnitude <= 8);
+    secp256k1_fe_verify(a);
+#endif
+    secp256k1_fe_sqr_inner(r->n, a->n);
+#ifdef VERIFY
+    r->magnitude = 1;
+    r->normalized = 0;
+    secp256k1_fe_verify(r);
+#endif
+}
+
+static SECP256K1_INLINE void secp256k1_fe_cmov(secp256k1_fe *r, const secp256k1_fe *a, int flag) {
+    uint64_t mask0, mask1;
+    VG_CHECK_VERIFY(r->n, sizeof(r->n));
+    mask0 = flag + ~((uint64_t)0);
+    mask1 = ~mask0;
+    r->n[0] = (r->n[0] & mask0) | (a->n[0] & mask1);
+    r->n[1] = (r->n[1] & mask0) | (a->n[1] & mask1);
+    r->n[2] = (r->n[2] & mask0) | (a->n[2] & mask1);
+    r->n[3] = (r->n[3] & mask0) | (a->n[3] & mask1);
+    r->n[4] = (r->n[4] & mask0) | (a->n[4] & mask1);
+#ifdef VERIFY
+    if (flag) {
+        r->magnitude = a->magnitude;
+        r->normalized = a->normalized;
+    }
+#endif
+}
+
+static SECP256K1_INLINE void secp256k1_fe_storage_cmov(secp256k1_fe_storage *r, const secp256k1_fe_storage *a, int flag) {
+    uint64_t mask0, mask1;
+    VG_CHECK_VERIFY(r->n, sizeof(r->n));
+    mask0 = flag + ~((uint64_t)0);
+    mask1 = ~mask0;
+    r->n[0] = (r->n[0] & mask0) | (a->n[0] & mask1);
+    r->n[1] = (r->n[1] & mask0) | (a->n[1] & mask1);
+    r->n[2] = (r->n[2] & mask0) | (a->n[2] & mask1);
+    r->n[3] = (r->n[3] & mask0) | (a->n[3] & mask1);
+}
+
+static void secp256k1_fe_to_storage(secp256k1_fe_storage *r, const secp256k1_fe *a) {
+#ifdef VERIFY
+    VERIFY_CHECK(a->normalized);
+#endif
+    r->n[0] = a->n[0] | a->n[1] << 52;
+    r->n[1] = a->n[1] >> 12 | a->n[2] << 40;
+    r->n[2] = a->n[2] >> 24 | a->n[3] << 28;
+    r->n[3] = a->n[3] >> 36 | a->n[4] << 16;
+}
+
+static SECP256K1_INLINE void secp256k1_fe_from_storage(secp256k1_fe *r, const secp256k1_fe_storage *a) {
+    r->n[0] = a->n[0] & 0xFFFFFFFFFFFFFULL;
+    r->n[1] = a->n[0] >> 52 | ((a->n[1] << 12) & 0xFFFFFFFFFFFFFULL);
+    r->n[2] = a->n[1] >> 40 | ((a->n[2] << 24) & 0xFFFFFFFFFFFFFULL);
+    r->n[3] = a->n[2] >> 28 | ((a->n[3] << 36) & 0xFFFFFFFFFFFFFULL);
+    r->n[4] = a->n[3] >> 16;
+#ifdef VERIFY
+    r->magnitude = 1;
+    r->normalized = 1;
+#endif
+}
+
+#endif /* SECP256K1_FIELD_REPR_IMPL_H */
diff --git a/depend/zcash/src/secp256k1/src/field_5x52_int128_impl.h b/depend/zcash/src/secp256k1/src/field_5x52_int128_impl.h
new file mode 100644
index 000000000..314002ee3
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/field_5x52_int128_impl.h
@@ -0,0 +1,279 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_FIELD_INNER5X52_IMPL_H
+#define SECP256K1_FIELD_INNER5X52_IMPL_H
+
+#include <stdint.h>
+
+#ifdef VERIFY
+#define VERIFY_BITS(x, n) VERIFY_CHECK(((x) >> (n)) == 0)
+#else
+#define VERIFY_BITS(x, n) do { } while(0)
+#endif
+
+SECP256K1_INLINE static void secp256k1_fe_mul_inner(uint64_t *r, const uint64_t *a, const uint64_t * SECP256K1_RESTRICT b) {
+    uint128_t c, d;
+    uint64_t t3, t4, tx, u0;
+    uint64_t a0 = a[0], a1 = a[1], a2 = a[2], a3 = a[3], a4 = a[4];
+    const uint64_t M = 0xFFFFFFFFFFFFFULL, R = 0x1000003D10ULL;
+
+    VERIFY_BITS(a[0], 56);
+    VERIFY_BITS(a[1], 56);
+    VERIFY_BITS(a[2], 56);
+    VERIFY_BITS(a[3], 56);
+    VERIFY_BITS(a[4], 52);
+    VERIFY_BITS(b[0], 56);
+    VERIFY_BITS(b[1], 56);
+    VERIFY_BITS(b[2], 56);
+    VERIFY_BITS(b[3], 56);
+    VERIFY_BITS(b[4], 52);
+    VERIFY_CHECK(r != b);
+    VERIFY_CHECK(a != b);
+
+    /*  [... a b c] is a shorthand for ... + a<<104 + b<<52 + c<<0 mod n.
+     *  for 0 <= x <= 4, px is a shorthand for sum(a[i]*b[x-i], i=0..x).
+     *  for 4 <= x <= 8, px is a shorthand for sum(a[i]*b[x-i], i=(x-4)..4)
+     *  Note that [x 0 0 0 0 0] = [x*R].
+     */
+
+    d  = (uint128_t)a0 * b[3]
+       + (uint128_t)a1 * b[2]
+       + (uint128_t)a2 * b[1]
+       + (uint128_t)a3 * b[0];
+    VERIFY_BITS(d, 114);
+    /* [d 0 0 0] = [p3 0 0 0] */
+    c  = (uint128_t)a4 * b[4];
+    VERIFY_BITS(c, 112);
+    /* [c 0 0 0 0 d 0 0 0] = [p8 0 0 0 0 p3 0 0 0] */
+    d += (c & M) * R; c >>= 52;
+    VERIFY_BITS(d, 115);
+    VERIFY_BITS(c, 60);
+    /* [c 0 0 0 0 0 d 0 0 0] = [p8 0 0 0 0 p3 0 0 0] */
+    t3 = d & M; d >>= 52;
+    VERIFY_BITS(t3, 52);
+    VERIFY_BITS(d, 63);
+    /* [c 0 0 0 0 d t3 0 0 0] = [p8 0 0 0 0 p3 0 0 0] */
+
+    d += (uint128_t)a0 * b[4]
+       + (uint128_t)a1 * b[3]
+       + (uint128_t)a2 * b[2]
+       + (uint128_t)a3 * b[1]
+       + (uint128_t)a4 * b[0];
+    VERIFY_BITS(d, 115);
+    /* [c 0 0 0 0 d t3 0 0 0] = [p8 0 0 0 p4 p3 0 0 0] */
+    d += c * R;
+    VERIFY_BITS(d, 116);
+    /* [d t3 0 0 0] = [p8 0 0 0 p4 p3 0 0 0] */
+    t4 = d & M; d >>= 52;
+    VERIFY_BITS(t4, 52);
+    VERIFY_BITS(d, 64);
+    /* [d t4 t3 0 0 0] = [p8 0 0 0 p4 p3 0 0 0] */
+    tx = (t4 >> 48); t4 &= (M >> 4);
+    VERIFY_BITS(tx, 4);
+    VERIFY_BITS(t4, 48);
+    /* [d t4+(tx<<48) t3 0 0 0] = [p8 0 0 0 p4 p3 0 0 0] */
+
+    c  = (uint128_t)a0 * b[0];
+    VERIFY_BITS(c, 112);
+    /* [d t4+(tx<<48) t3 0 0 c] = [p8 0 0 0 p4 p3 0 0 p0] */
+    d += (uint128_t)a1 * b[4]
+       + (uint128_t)a2 * b[3]
+       + (uint128_t)a3 * b[2]
+       + (uint128_t)a4 * b[1];
+    VERIFY_BITS(d, 115);
+    /* [d t4+(tx<<48) t3 0 0 c] = [p8 0 0 p5 p4 p3 0 0 p0] */
+    u0 = d & M; d >>= 52;
+    VERIFY_BITS(u0, 52);
+    VERIFY_BITS(d, 63);
+    /* [d u0 t4+(tx<<48) t3 0 0 c] = [p8 0 0 p5 p4 p3 0 0 p0] */
+    /* [d 0 t4+(tx<<48)+(u0<<52) t3 0 0 c] = [p8 0 0 p5 p4 p3 0 0 p0] */
+    u0 = (u0 << 4) | tx;
+    VERIFY_BITS(u0, 56);
+    /* [d 0 t4+(u0<<48) t3 0 0 c] = [p8 0 0 p5 p4 p3 0 0 p0] */
+    c += (uint128_t)u0 * (R >> 4);
+    VERIFY_BITS(c, 115);
+    /* [d 0 t4 t3 0 0 c] = [p8 0 0 p5 p4 p3 0 0 p0] */
+    r[0] = c & M; c >>= 52;
+    VERIFY_BITS(r[0], 52);
+    VERIFY_BITS(c, 61);
+    /* [d 0 t4 t3 0 c r0] = [p8 0 0 p5 p4 p3 0 0 p0] */
+
+    c += (uint128_t)a0 * b[1]
+       + (uint128_t)a1 * b[0];
+    VERIFY_BITS(c, 114);
+    /* [d 0 t4 t3 0 c r0] = [p8 0 0 p5 p4 p3 0 p1 p0] */
+    d += (uint128_t)a2 * b[4]
+       + (uint128_t)a3 * b[3]
+       + (uint128_t)a4 * b[2];
+    VERIFY_BITS(d, 114);
+    /* [d 0 t4 t3 0 c r0] = [p8 0 p6 p5 p4 p3 0 p1 p0] */
+    c += (d & M) * R; d >>= 52;
+    VERIFY_BITS(c, 115);
+    VERIFY_BITS(d, 62);
+    /* [d 0 0 t4 t3 0 c r0] = [p8 0 p6 p5 p4 p3 0 p1 p0] */
+    r[1] = c & M; c >>= 52;
+    VERIFY_BITS(r[1], 52);
+    VERIFY_BITS(c, 63);
+    /* [d 0 0 t4 t3 c r1 r0] = [p8 0 p6 p5 p4 p3 0 p1 p0] */
+
+    c += (uint128_t)a0 * b[2]
+       + (uint128_t)a1 * b[1]
+       + (uint128_t)a2 * b[0];
+    VERIFY_BITS(c, 114);
+    /* [d 0 0 t4 t3 c r1 r0] = [p8 0 p6 p5 p4 p3 p2 p1 p0] */
+    d += (uint128_t)a3 * b[4]
+       + (uint128_t)a4 * b[3];
+    VERIFY_BITS(d, 114);
+    /* [d 0 0 t4 t3 c t1 r0] = [p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    c += (d & M) * R; d >>= 52;
+    VERIFY_BITS(c, 115);
+    VERIFY_BITS(d, 62);
+    /* [d 0 0 0 t4 t3 c r1 r0] = [p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+
+    /* [d 0 0 0 t4 t3 c r1 r0] = [p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    r[2] = c & M; c >>= 52;
+    VERIFY_BITS(r[2], 52);
+    VERIFY_BITS(c, 63);
+    /* [d 0 0 0 t4 t3+c r2 r1 r0] = [p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    c   += d * R + t3;
+    VERIFY_BITS(c, 100);
+    /* [t4 c r2 r1 r0] = [p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    r[3] = c & M; c >>= 52;
+    VERIFY_BITS(r[3], 52);
+    VERIFY_BITS(c, 48);
+    /* [t4+c r3 r2 r1 r0] = [p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    c   += t4;
+    VERIFY_BITS(c, 49);
+    /* [c r3 r2 r1 r0] = [p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    r[4] = c;
+    VERIFY_BITS(r[4], 49);
+    /* [r4 r3 r2 r1 r0] = [p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+}
+
+SECP256K1_INLINE static void secp256k1_fe_sqr_inner(uint64_t *r, const uint64_t *a) {
+    uint128_t c, d;
+    uint64_t a0 = a[0], a1 = a[1], a2 = a[2], a3 = a[3], a4 = a[4];
+    int64_t t3, t4, tx, u0;
+    const uint64_t M = 0xFFFFFFFFFFFFFULL, R = 0x1000003D10ULL;
+
+    VERIFY_BITS(a[0], 56);
+    VERIFY_BITS(a[1], 56);
+    VERIFY_BITS(a[2], 56);
+    VERIFY_BITS(a[3], 56);
+    VERIFY_BITS(a[4], 52);
+
+    /**  [... a b c] is a shorthand for ... + a<<104 + b<<52 + c<<0 mod n.
+     *  px is a shorthand for sum(a[i]*a[x-i], i=0..x).
+     *  Note that [x 0 0 0 0 0] = [x*R].
+     */
+
+    d  = (uint128_t)(a0*2) * a3
+       + (uint128_t)(a1*2) * a2;
+    VERIFY_BITS(d, 114);
+    /* [d 0 0 0] = [p3 0 0 0] */
+    c  = (uint128_t)a4 * a4;
+    VERIFY_BITS(c, 112);
+    /* [c 0 0 0 0 d 0 0 0] = [p8 0 0 0 0 p3 0 0 0] */
+    d += (c & M) * R; c >>= 52;
+    VERIFY_BITS(d, 115);
+    VERIFY_BITS(c, 60);
+    /* [c 0 0 0 0 0 d 0 0 0] = [p8 0 0 0 0 p3 0 0 0] */
+    t3 = d & M; d >>= 52;
+    VERIFY_BITS(t3, 52);
+    VERIFY_BITS(d, 63);
+    /* [c 0 0 0 0 d t3 0 0 0] = [p8 0 0 0 0 p3 0 0 0] */
+
+    a4 *= 2;
+    d += (uint128_t)a0 * a4
+       + (uint128_t)(a1*2) * a3
+       + (uint128_t)a2 * a2;
+    VERIFY_BITS(d, 115);
+    /* [c 0 0 0 0 d t3 0 0 0] = [p8 0 0 0 p4 p3 0 0 0] */
+    d += c * R;
+    VERIFY_BITS(d, 116);
+    /* [d t3 0 0 0] = [p8 0 0 0 p4 p3 0 0 0] */
+    t4 = d & M; d >>= 52;
+    VERIFY_BITS(t4, 52);
+    VERIFY_BITS(d, 64);
+    /* [d t4 t3 0 0 0] = [p8 0 0 0 p4 p3 0 0 0] */
+    tx = (t4 >> 48); t4 &= (M >> 4);
+    VERIFY_BITS(tx, 4);
+    VERIFY_BITS(t4, 48);
+    /* [d t4+(tx<<48) t3 0 0 0] = [p8 0 0 0 p4 p3 0 0 0] */
+
+    c  = (uint128_t)a0 * a0;
+    VERIFY_BITS(c, 112);
+    /* [d t4+(tx<<48) t3 0 0 c] = [p8 0 0 0 p4 p3 0 0 p0] */
+    d += (uint128_t)a1 * a4
+       + (uint128_t)(a2*2) * a3;
+    VERIFY_BITS(d, 114);
+    /* [d t4+(tx<<48) t3 0 0 c] = [p8 0 0 p5 p4 p3 0 0 p0] */
+    u0 = d & M; d >>= 52;
+    VERIFY_BITS(u0, 52);
+    VERIFY_BITS(d, 62);
+    /* [d u0 t4+(tx<<48) t3 0 0 c] = [p8 0 0 p5 p4 p3 0 0 p0] */
+    /* [d 0 t4+(tx<<48)+(u0<<52) t3 0 0 c] = [p8 0 0 p5 p4 p3 0 0 p0] */
+    u0 = (u0 << 4) | tx;
+    VERIFY_BITS(u0, 56);
+    /* [d 0 t4+(u0<<48) t3 0 0 c] = [p8 0 0 p5 p4 p3 0 0 p0] */
+    c += (uint128_t)u0 * (R >> 4);
+    VERIFY_BITS(c, 113);
+    /* [d 0 t4 t3 0 0 c] = [p8 0 0 p5 p4 p3 0 0 p0] */
+    r[0] = c & M; c >>= 52;
+    VERIFY_BITS(r[0], 52);
+    VERIFY_BITS(c, 61);
+    /* [d 0 t4 t3 0 c r0] = [p8 0 0 p5 p4 p3 0 0 p0] */
+
+    a0 *= 2;
+    c += (uint128_t)a0 * a1;
+    VERIFY_BITS(c, 114);
+    /* [d 0 t4 t3 0 c r0] = [p8 0 0 p5 p4 p3 0 p1 p0] */
+    d += (uint128_t)a2 * a4
+       + (uint128_t)a3 * a3;
+    VERIFY_BITS(d, 114);
+    /* [d 0 t4 t3 0 c r0] = [p8 0 p6 p5 p4 p3 0 p1 p0] */
+    c += (d & M) * R; d >>= 52;
+    VERIFY_BITS(c, 115);
+    VERIFY_BITS(d, 62);
+    /* [d 0 0 t4 t3 0 c r0] = [p8 0 p6 p5 p4 p3 0 p1 p0] */
+    r[1] = c & M; c >>= 52;
+    VERIFY_BITS(r[1], 52);
+    VERIFY_BITS(c, 63);
+    /* [d 0 0 t4 t3 c r1 r0] = [p8 0 p6 p5 p4 p3 0 p1 p0] */
+
+    c += (uint128_t)a0 * a2
+       + (uint128_t)a1 * a1;
+    VERIFY_BITS(c, 114);
+    /* [d 0 0 t4 t3 c r1 r0] = [p8 0 p6 p5 p4 p3 p2 p1 p0] */
+    d += (uint128_t)a3 * a4;
+    VERIFY_BITS(d, 114);
+    /* [d 0 0 t4 t3 c r1 r0] = [p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    c += (d & M) * R; d >>= 52;
+    VERIFY_BITS(c, 115);
+    VERIFY_BITS(d, 62);
+    /* [d 0 0 0 t4 t3 c r1 r0] = [p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    r[2] = c & M; c >>= 52;
+    VERIFY_BITS(r[2], 52);
+    VERIFY_BITS(c, 63);
+    /* [d 0 0 0 t4 t3+c r2 r1 r0] = [p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+
+    c   += d * R + t3;
+    VERIFY_BITS(c, 100);
+    /* [t4 c r2 r1 r0] = [p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    r[3] = c & M; c >>= 52;
+    VERIFY_BITS(r[3], 52);
+    VERIFY_BITS(c, 48);
+    /* [t4+c r3 r2 r1 r0] = [p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    c   += t4;
+    VERIFY_BITS(c, 49);
+    /* [c r3 r2 r1 r0] = [p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+    r[4] = c;
+    VERIFY_BITS(r[4], 49);
+    /* [r4 r3 r2 r1 r0] = [p8 p7 p6 p5 p4 p3 p2 p1 p0] */
+}
+
+#endif /* SECP256K1_FIELD_INNER5X52_IMPL_H */
diff --git a/depend/zcash/src/secp256k1/src/field_impl.h b/depend/zcash/src/secp256k1/src/field_impl.h
new file mode 100644
index 000000000..f0096f631
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/field_impl.h
@@ -0,0 +1,293 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_FIELD_IMPL_H
+#define SECP256K1_FIELD_IMPL_H
+
+#if defined HAVE_CONFIG_H
+#include "libsecp256k1-config.h"
+#endif
+
+#include "util.h"
+#include "num.h"
+
+#if defined(SECP256K1_WIDEMUL_INT128)
+#include "field_5x52_impl.h"
+#elif defined(SECP256K1_WIDEMUL_INT64)
+#include "field_10x26_impl.h"
+#else
+#error "Please select wide multiplication implementation"
+#endif
+
+SECP256K1_INLINE static int secp256k1_fe_equal(const secp256k1_fe *a, const secp256k1_fe *b) {
+    secp256k1_fe na;
+    secp256k1_fe_negate(&na, a, 1);
+    secp256k1_fe_add(&na, b);
+    return secp256k1_fe_normalizes_to_zero(&na);
+}
+
+SECP256K1_INLINE static int secp256k1_fe_equal_var(const secp256k1_fe *a, const secp256k1_fe *b) {
+    secp256k1_fe na;
+    secp256k1_fe_negate(&na, a, 1);
+    secp256k1_fe_add(&na, b);
+    return secp256k1_fe_normalizes_to_zero_var(&na);
+}
+
+static int secp256k1_fe_sqrt(secp256k1_fe *r, const secp256k1_fe *a) {
+    /** Given that p is congruent to 3 mod 4, we can compute the square root of
+     *  a mod p as the (p+1)/4'th power of a.
+     *
+     *  As (p+1)/4 is an even number, it will have the same result for a and for
+     *  (-a). Only one of these two numbers actually has a square root however,
+     *  so we test at the end by squaring and comparing to the input.
+     *  Also because (p+1)/4 is an even number, the computed square root is
+     *  itself always a square (a ** ((p+1)/4) is the square of a ** ((p+1)/8)).
+     */
+    secp256k1_fe x2, x3, x6, x9, x11, x22, x44, x88, x176, x220, x223, t1;
+    int j;
+
+    VERIFY_CHECK(r != a);
+
+    /** The binary representation of (p + 1)/4 has 3 blocks of 1s, with lengths in
+     *  { 2, 22, 223 }. Use an addition chain to calculate 2^n - 1 for each block:
+     *  1, [2], 3, 6, 9, 11, [22], 44, 88, 176, 220, [223]
+     */
+
+    secp256k1_fe_sqr(&x2, a);
+    secp256k1_fe_mul(&x2, &x2, a);
+
+    secp256k1_fe_sqr(&x3, &x2);
+    secp256k1_fe_mul(&x3, &x3, a);
+
+    x6 = x3;
+    for (j=0; j<3; j++) {
+        secp256k1_fe_sqr(&x6, &x6);
+    }
+    secp256k1_fe_mul(&x6, &x6, &x3);
+
+    x9 = x6;
+    for (j=0; j<3; j++) {
+        secp256k1_fe_sqr(&x9, &x9);
+    }
+    secp256k1_fe_mul(&x9, &x9, &x3);
+
+    x11 = x9;
+    for (j=0; j<2; j++) {
+        secp256k1_fe_sqr(&x11, &x11);
+    }
+    secp256k1_fe_mul(&x11, &x11, &x2);
+
+    x22 = x11;
+    for (j=0; j<11; j++) {
+        secp256k1_fe_sqr(&x22, &x22);
+    }
+    secp256k1_fe_mul(&x22, &x22, &x11);
+
+    x44 = x22;
+    for (j=0; j<22; j++) {
+        secp256k1_fe_sqr(&x44, &x44);
+    }
+    secp256k1_fe_mul(&x44, &x44, &x22);
+
+    x88 = x44;
+    for (j=0; j<44; j++) {
+        secp256k1_fe_sqr(&x88, &x88);
+    }
+    secp256k1_fe_mul(&x88, &x88, &x44);
+
+    x176 = x88;
+    for (j=0; j<88; j++) {
+        secp256k1_fe_sqr(&x176, &x176);
+    }
+    secp256k1_fe_mul(&x176, &x176, &x88);
+
+    x220 = x176;
+    for (j=0; j<44; j++) {
+        secp256k1_fe_sqr(&x220, &x220);
+    }
+    secp256k1_fe_mul(&x220, &x220, &x44);
+
+    x223 = x220;
+    for (j=0; j<3; j++) {
+        secp256k1_fe_sqr(&x223, &x223);
+    }
+    secp256k1_fe_mul(&x223, &x223, &x3);
+
+    /* The final result is then assembled using a sliding window over the blocks. */
+
+    t1 = x223;
+    for (j=0; j<23; j++) {
+        secp256k1_fe_sqr(&t1, &t1);
+    }
+    secp256k1_fe_mul(&t1, &t1, &x22);
+    for (j=0; j<6; j++) {
+        secp256k1_fe_sqr(&t1, &t1);
+    }
+    secp256k1_fe_mul(&t1, &t1, &x2);
+    secp256k1_fe_sqr(&t1, &t1);
+    secp256k1_fe_sqr(r, &t1);
+
+    /* Check that a square root was actually calculated */
+
+    secp256k1_fe_sqr(&t1, r);
+    return secp256k1_fe_equal(&t1, a);
+}
+
+static void secp256k1_fe_inv(secp256k1_fe *r, const secp256k1_fe *a) {
+    secp256k1_fe x2, x3, x6, x9, x11, x22, x44, x88, x176, x220, x223, t1;
+    int j;
+
+    /** The binary representation of (p - 2) has 5 blocks of 1s, with lengths in
+     *  { 1, 2, 22, 223 }. Use an addition chain to calculate 2^n - 1 for each block:
+     *  [1], [2], 3, 6, 9, 11, [22], 44, 88, 176, 220, [223]
+     */
+
+    secp256k1_fe_sqr(&x2, a);
+    secp256k1_fe_mul(&x2, &x2, a);
+
+    secp256k1_fe_sqr(&x3, &x2);
+    secp256k1_fe_mul(&x3, &x3, a);
+
+    x6 = x3;
+    for (j=0; j<3; j++) {
+        secp256k1_fe_sqr(&x6, &x6);
+    }
+    secp256k1_fe_mul(&x6, &x6, &x3);
+
+    x9 = x6;
+    for (j=0; j<3; j++) {
+        secp256k1_fe_sqr(&x9, &x9);
+    }
+    secp256k1_fe_mul(&x9, &x9, &x3);
+
+    x11 = x9;
+    for (j=0; j<2; j++) {
+        secp256k1_fe_sqr(&x11, &x11);
+    }
+    secp256k1_fe_mul(&x11, &x11, &x2);
+
+    x22 = x11;
+    for (j=0; j<11; j++) {
+        secp256k1_fe_sqr(&x22, &x22);
+    }
+    secp256k1_fe_mul(&x22, &x22, &x11);
+
+    x44 = x22;
+    for (j=0; j<22; j++) {
+        secp256k1_fe_sqr(&x44, &x44);
+    }
+    secp256k1_fe_mul(&x44, &x44, &x22);
+
+    x88 = x44;
+    for (j=0; j<44; j++) {
+        secp256k1_fe_sqr(&x88, &x88);
+    }
+    secp256k1_fe_mul(&x88, &x88, &x44);
+
+    x176 = x88;
+    for (j=0; j<88; j++) {
+        secp256k1_fe_sqr(&x176, &x176);
+    }
+    secp256k1_fe_mul(&x176, &x176, &x88);
+
+    x220 = x176;
+    for (j=0; j<44; j++) {
+        secp256k1_fe_sqr(&x220, &x220);
+    }
+    secp256k1_fe_mul(&x220, &x220, &x44);
+
+    x223 = x220;
+    for (j=0; j<3; j++) {
+        secp256k1_fe_sqr(&x223, &x223);
+    }
+    secp256k1_fe_mul(&x223, &x223, &x3);
+
+    /* The final result is then assembled using a sliding window over the blocks. */
+
+    t1 = x223;
+    for (j=0; j<23; j++) {
+        secp256k1_fe_sqr(&t1, &t1);
+    }
+    secp256k1_fe_mul(&t1, &t1, &x22);
+    for (j=0; j<5; j++) {
+        secp256k1_fe_sqr(&t1, &t1);
+    }
+    secp256k1_fe_mul(&t1, &t1, a);
+    for (j=0; j<3; j++) {
+        secp256k1_fe_sqr(&t1, &t1);
+    }
+    secp256k1_fe_mul(&t1, &t1, &x2);
+    for (j=0; j<2; j++) {
+        secp256k1_fe_sqr(&t1, &t1);
+    }
+    secp256k1_fe_mul(r, a, &t1);
+}
+
+static void secp256k1_fe_inv_var(secp256k1_fe *r, const secp256k1_fe *a) {
+#if defined(USE_FIELD_INV_BUILTIN)
+    secp256k1_fe_inv(r, a);
+#elif defined(USE_FIELD_INV_NUM)
+    secp256k1_num n, m;
+    static const secp256k1_fe negone = SECP256K1_FE_CONST(
+        0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL,
+        0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFEUL, 0xFFFFFC2EUL
+    );
+    /* secp256k1 field prime, value p defined in "Standards for Efficient Cryptography" (SEC2) 2.7.1. */
+    static const unsigned char prime[32] = {
+        0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
+        0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
+        0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
+        0xFF,0xFF,0xFF,0xFE,0xFF,0xFF,0xFC,0x2F
+    };
+    unsigned char b[32];
+    int res;
+    secp256k1_fe c = *a;
+    secp256k1_fe_normalize_var(&c);
+    secp256k1_fe_get_b32(b, &c);
+    secp256k1_num_set_bin(&n, b, 32);
+    secp256k1_num_set_bin(&m, prime, 32);
+    secp256k1_num_mod_inverse(&n, &n, &m);
+    secp256k1_num_get_bin(b, 32, &n);
+    res = secp256k1_fe_set_b32(r, b);
+    (void)res;
+    VERIFY_CHECK(res);
+    /* Verify the result is the (unique) valid inverse using non-GMP code. */
+    secp256k1_fe_mul(&c, &c, r);
+    secp256k1_fe_add(&c, &negone);
+    CHECK(secp256k1_fe_normalizes_to_zero_var(&c));
+#else
+#error "Please select field inverse implementation"
+#endif
+}
+
+static int secp256k1_fe_is_quad_var(const secp256k1_fe *a) {
+#ifndef USE_NUM_NONE
+    unsigned char b[32];
+    secp256k1_num n;
+    secp256k1_num m;
+    /* secp256k1 field prime, value p defined in "Standards for Efficient Cryptography" (SEC2) 2.7.1. */
+    static const unsigned char prime[32] = {
+        0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
+        0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
+        0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
+        0xFF,0xFF,0xFF,0xFE,0xFF,0xFF,0xFC,0x2F
+    };
+
+    secp256k1_fe c = *a;
+    secp256k1_fe_normalize_var(&c);
+    secp256k1_fe_get_b32(b, &c);
+    secp256k1_num_set_bin(&n, b, 32);
+    secp256k1_num_set_bin(&m, prime, 32);
+    return secp256k1_num_jacobi(&n, &m) >= 0;
+#else
+    secp256k1_fe r;
+    return secp256k1_fe_sqrt(&r, a);
+#endif
+}
+
+static const secp256k1_fe secp256k1_fe_one = SECP256K1_FE_CONST(0, 0, 0, 0, 0, 0, 0, 1);
+
+#endif /* SECP256K1_FIELD_IMPL_H */
diff --git a/depend/zcash/src/secp256k1/src/gen_context.c b/depend/zcash/src/secp256k1/src/gen_context.c
new file mode 100644
index 000000000..05e7dee17
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/gen_context.c
@@ -0,0 +1,88 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014, 2015 Thomas Daede, Cory Fields            *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+/* Autotools creates libsecp256k1-config.h, of which ECMULT_GEN_PREC_BITS is needed.
+   ifndef guard so downstream users can define their own if they do not use autotools. */
+#if !defined(ECMULT_GEN_PREC_BITS)
+#include "libsecp256k1-config.h"
+#endif
+#define USE_BASIC_CONFIG 1
+#include "basic-config.h"
+
+#include "include/secp256k1.h"
+#include "assumptions.h"
+#include "util.h"
+#include "field_impl.h"
+#include "scalar_impl.h"
+#include "group_impl.h"
+#include "ecmult_gen_impl.h"
+
+static void default_error_callback_fn(const char* str, void* data) {
+    (void)data;
+    fprintf(stderr, "[libsecp256k1] internal consistency check failed: %s\n", str);
+    abort();
+}
+
+static const secp256k1_callback default_error_callback = {
+    default_error_callback_fn,
+    NULL
+};
+
+int main(int argc, char **argv) {
+    secp256k1_ecmult_gen_context ctx;
+    void *prealloc, *base;
+    int inner;
+    int outer;
+    FILE* fp;
+
+    (void)argc;
+    (void)argv;
+
+    fp = fopen("src/ecmult_static_context.h","w");
+    if (fp == NULL) {
+        fprintf(stderr, "Could not open src/ecmult_static_context.h for writing!\n");
+        return -1;
+    }
+
+    fprintf(fp, "#ifndef SECP256K1_ECMULT_STATIC_CONTEXT_H\n");
+    fprintf(fp, "#define SECP256K1_ECMULT_STATIC_CONTEXT_H\n");
+    fprintf(fp, "#include \"src/group.h\"\n");
+    fprintf(fp, "#define SC SECP256K1_GE_STORAGE_CONST\n");
+    fprintf(fp, "#if ECMULT_GEN_PREC_N != %d || ECMULT_GEN_PREC_G != %d\n", ECMULT_GEN_PREC_N, ECMULT_GEN_PREC_G);
+    fprintf(fp, "   #error configuration mismatch, invalid ECMULT_GEN_PREC_N, ECMULT_GEN_PREC_G. Try deleting ecmult_static_context.h before the build.\n");
+    fprintf(fp, "#endif\n");
+    fprintf(fp, "static const secp256k1_ge_storage secp256k1_ecmult_static_context[ECMULT_GEN_PREC_N][ECMULT_GEN_PREC_G] = {\n");
+
+    base = checked_malloc(&default_error_callback, SECP256K1_ECMULT_GEN_CONTEXT_PREALLOCATED_SIZE);
+    prealloc = base;
+    secp256k1_ecmult_gen_context_init(&ctx);
+    secp256k1_ecmult_gen_context_build(&ctx, &prealloc);
+    for(outer = 0; outer != ECMULT_GEN_PREC_N; outer++) {
+        fprintf(fp,"{\n");
+        for(inner = 0; inner != ECMULT_GEN_PREC_G; inner++) {
+            fprintf(fp,"    SC(%uu, %uu, %uu, %uu, %uu, %uu, %uu, %uu, %uu, %uu, %uu, %uu, %uu, %uu, %uu, %uu)", SECP256K1_GE_STORAGE_CONST_GET((*ctx.prec)[outer][inner]));
+            if (inner != ECMULT_GEN_PREC_G - 1) {
+                fprintf(fp,",\n");
+            } else {
+                fprintf(fp,"\n");
+            }
+        }
+        if (outer != ECMULT_GEN_PREC_N - 1) {
+            fprintf(fp,"},\n");
+        } else {
+            fprintf(fp,"}\n");
+        }
+    }
+    fprintf(fp,"};\n");
+    secp256k1_ecmult_gen_context_clear(&ctx);
+    free(base);
+
+    fprintf(fp, "#undef SC\n");
+    fprintf(fp, "#endif\n");
+    fclose(fp);
+
+    return 0;
+}
diff --git a/depend/zcash/src/secp256k1/src/group.h b/depend/zcash/src/secp256k1/src/group.h
new file mode 100644
index 000000000..40bf96122
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/group.h
@@ -0,0 +1,154 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_GROUP_H
+#define SECP256K1_GROUP_H
+
+#include "num.h"
+#include "field.h"
+
+/** A group element of the secp256k1 curve, in affine coordinates. */
+typedef struct {
+    secp256k1_fe x;
+    secp256k1_fe y;
+    int infinity; /* whether this represents the point at infinity */
+} secp256k1_ge;
+
+#define SECP256K1_GE_CONST(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p) {SECP256K1_FE_CONST((a),(b),(c),(d),(e),(f),(g),(h)), SECP256K1_FE_CONST((i),(j),(k),(l),(m),(n),(o),(p)), 0}
+#define SECP256K1_GE_CONST_INFINITY {SECP256K1_FE_CONST(0, 0, 0, 0, 0, 0, 0, 0), SECP256K1_FE_CONST(0, 0, 0, 0, 0, 0, 0, 0), 1}
+
+/** A group element of the secp256k1 curve, in jacobian coordinates. */
+typedef struct {
+    secp256k1_fe x; /* actual X: x/z^2 */
+    secp256k1_fe y; /* actual Y: y/z^3 */
+    secp256k1_fe z;
+    int infinity; /* whether this represents the point at infinity */
+} secp256k1_gej;
+
+#define SECP256K1_GEJ_CONST(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p) {SECP256K1_FE_CONST((a),(b),(c),(d),(e),(f),(g),(h)), SECP256K1_FE_CONST((i),(j),(k),(l),(m),(n),(o),(p)), SECP256K1_FE_CONST(0, 0, 0, 0, 0, 0, 0, 1), 0}
+#define SECP256K1_GEJ_CONST_INFINITY {SECP256K1_FE_CONST(0, 0, 0, 0, 0, 0, 0, 0), SECP256K1_FE_CONST(0, 0, 0, 0, 0, 0, 0, 0), SECP256K1_FE_CONST(0, 0, 0, 0, 0, 0, 0, 0), 1}
+
+typedef struct {
+    secp256k1_fe_storage x;
+    secp256k1_fe_storage y;
+} secp256k1_ge_storage;
+
+#define SECP256K1_GE_STORAGE_CONST(a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p) {SECP256K1_FE_STORAGE_CONST((a),(b),(c),(d),(e),(f),(g),(h)), SECP256K1_FE_STORAGE_CONST((i),(j),(k),(l),(m),(n),(o),(p))}
+
+#define SECP256K1_GE_STORAGE_CONST_GET(t) SECP256K1_FE_STORAGE_CONST_GET(t.x), SECP256K1_FE_STORAGE_CONST_GET(t.y)
+
+/** Set a group element equal to the point with given X and Y coordinates */
+static void secp256k1_ge_set_xy(secp256k1_ge *r, const secp256k1_fe *x, const secp256k1_fe *y);
+
+/** Set a group element (affine) equal to the point with the given X coordinate
+ *  and a Y coordinate that is a quadratic residue modulo p. The return value
+ *  is true iff a coordinate with the given X coordinate exists.
+ */
+static int secp256k1_ge_set_xquad(secp256k1_ge *r, const secp256k1_fe *x);
+
+/** Set a group element (affine) equal to the point with the given X coordinate, and given oddness
+ *  for Y. Return value indicates whether the result is valid. */
+static int secp256k1_ge_set_xo_var(secp256k1_ge *r, const secp256k1_fe *x, int odd);
+
+/** Check whether a group element is the point at infinity. */
+static int secp256k1_ge_is_infinity(const secp256k1_ge *a);
+
+/** Check whether a group element is valid (i.e., on the curve). */
+static int secp256k1_ge_is_valid_var(const secp256k1_ge *a);
+
+/** Set r equal to the inverse of a (i.e., mirrored around the X axis) */
+static void secp256k1_ge_neg(secp256k1_ge *r, const secp256k1_ge *a);
+
+/** Set a group element equal to another which is given in jacobian coordinates. Constant time. */
+static void secp256k1_ge_set_gej(secp256k1_ge *r, secp256k1_gej *a);
+
+/** Set a group element equal to another which is given in jacobian coordinates. */
+static void secp256k1_ge_set_gej_var(secp256k1_ge *r, secp256k1_gej *a);
+
+/** Set a batch of group elements equal to the inputs given in jacobian coordinates */
+static void secp256k1_ge_set_all_gej_var(secp256k1_ge *r, const secp256k1_gej *a, size_t len);
+
+/** Bring a batch inputs given in jacobian coordinates (with known z-ratios) to
+ *  the same global z "denominator". zr must contain the known z-ratios such
+ *  that mul(a[i].z, zr[i+1]) == a[i+1].z. zr[0] is ignored. The x and y
+ *  coordinates of the result are stored in r, the common z coordinate is
+ *  stored in globalz. */
+static void secp256k1_ge_globalz_set_table_gej(size_t len, secp256k1_ge *r, secp256k1_fe *globalz, const secp256k1_gej *a, const secp256k1_fe *zr);
+
+/** Set a group element (affine) equal to the point at infinity. */
+static void secp256k1_ge_set_infinity(secp256k1_ge *r);
+
+/** Set a group element (jacobian) equal to the point at infinity. */
+static void secp256k1_gej_set_infinity(secp256k1_gej *r);
+
+/** Set a group element (jacobian) equal to another which is given in affine coordinates. */
+static void secp256k1_gej_set_ge(secp256k1_gej *r, const secp256k1_ge *a);
+
+/** Compare the X coordinate of a group element (jacobian). */
+static int secp256k1_gej_eq_x_var(const secp256k1_fe *x, const secp256k1_gej *a);
+
+/** Set r equal to the inverse of a (i.e., mirrored around the X axis) */
+static void secp256k1_gej_neg(secp256k1_gej *r, const secp256k1_gej *a);
+
+/** Check whether a group element is the point at infinity. */
+static int secp256k1_gej_is_infinity(const secp256k1_gej *a);
+
+/** Check whether a group element's y coordinate is a quadratic residue. */
+static int secp256k1_gej_has_quad_y_var(const secp256k1_gej *a);
+
+/** Set r equal to the double of a. Constant time. */
+static void secp256k1_gej_double(secp256k1_gej *r, const secp256k1_gej *a);
+
+/** Set r equal to the double of a. If rzr is not-NULL this sets *rzr such that r->z == a->z * *rzr (where infinity means an implicit z = 0). */
+static void secp256k1_gej_double_var(secp256k1_gej *r, const secp256k1_gej *a, secp256k1_fe *rzr);
+
+/** Set r equal to the sum of a and b. If rzr is non-NULL this sets *rzr such that r->z == a->z * *rzr (a cannot be infinity in that case). */
+static void secp256k1_gej_add_var(secp256k1_gej *r, const secp256k1_gej *a, const secp256k1_gej *b, secp256k1_fe *rzr);
+
+/** Set r equal to the sum of a and b (with b given in affine coordinates, and not infinity). */
+static void secp256k1_gej_add_ge(secp256k1_gej *r, const secp256k1_gej *a, const secp256k1_ge *b);
+
+/** Set r equal to the sum of a and b (with b given in affine coordinates). This is more efficient
+    than secp256k1_gej_add_var. It is identical to secp256k1_gej_add_ge but without constant-time
+    guarantee, and b is allowed to be infinity. If rzr is non-NULL this sets *rzr such that r->z == a->z * *rzr (a cannot be infinity in that case). */
+static void secp256k1_gej_add_ge_var(secp256k1_gej *r, const secp256k1_gej *a, const secp256k1_ge *b, secp256k1_fe *rzr);
+
+/** Set r equal to the sum of a and b (with the inverse of b's Z coordinate passed as bzinv). */
+static void secp256k1_gej_add_zinv_var(secp256k1_gej *r, const secp256k1_gej *a, const secp256k1_ge *b, const secp256k1_fe *bzinv);
+
+/** Set r to be equal to lambda times a, where lambda is chosen in a way such that this is very fast. */
+static void secp256k1_ge_mul_lambda(secp256k1_ge *r, const secp256k1_ge *a);
+
+/** Clear a secp256k1_gej to prevent leaking sensitive information. */
+static void secp256k1_gej_clear(secp256k1_gej *r);
+
+/** Clear a secp256k1_ge to prevent leaking sensitive information. */
+static void secp256k1_ge_clear(secp256k1_ge *r);
+
+/** Convert a group element to the storage type. */
+static void secp256k1_ge_to_storage(secp256k1_ge_storage *r, const secp256k1_ge *a);
+
+/** Convert a group element back from the storage type. */
+static void secp256k1_ge_from_storage(secp256k1_ge *r, const secp256k1_ge_storage *a);
+
+/** If flag is true, set *r equal to *a; otherwise leave it. Constant-time.  Both *r and *a must be initialized.*/
+static void secp256k1_ge_storage_cmov(secp256k1_ge_storage *r, const secp256k1_ge_storage *a, int flag);
+
+/** Rescale a jacobian point by b which must be non-zero. Constant-time. */
+static void secp256k1_gej_rescale(secp256k1_gej *r, const secp256k1_fe *b);
+
+/** Determine if a point (which is assumed to be on the curve) is in the correct (sub)group of the curve.
+ *
+ * In normal mode, the used group is secp256k1, which has cofactor=1 meaning that every point on the curve is in the
+ * group, and this function returns always true.
+ *
+ * When compiling in exhaustive test mode, a slightly different curve equation is used, leading to a group with a
+ * (very) small subgroup, and that subgroup is what is used for all cryptographic operations. In that mode, this
+ * function checks whether a point that is on the curve is in fact also in that subgroup.
+ */
+static int secp256k1_ge_is_in_correct_subgroup(const secp256k1_ge* ge);
+
+#endif /* SECP256K1_GROUP_H */
diff --git a/depend/zcash/src/secp256k1/src/group_impl.h b/depend/zcash/src/secp256k1/src/group_impl.h
new file mode 100644
index 000000000..79177d7d7
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/group_impl.h
@@ -0,0 +1,693 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_GROUP_IMPL_H
+#define SECP256K1_GROUP_IMPL_H
+
+#include "num.h"
+#include "field.h"
+#include "group.h"
+
+/* These exhaustive group test orders and generators are chosen such that:
+ * - The field size is equal to that of secp256k1, so field code is the same.
+ * - The curve equation is of the form y^2=x^3+B for some constant B.
+ * - The subgroup has a generator 2*P, where P.x=1.
+ * - The subgroup has size less than 1000 to permit exhaustive testing.
+ * - The subgroup admits an endomorphism of the form lambda*(x,y) == (beta*x,y).
+ *
+ * These parameters are generated using sage/gen_exhaustive_groups.sage.
+ */
+#if defined(EXHAUSTIVE_TEST_ORDER)
+#  if EXHAUSTIVE_TEST_ORDER == 13
+static const secp256k1_ge secp256k1_ge_const_g = SECP256K1_GE_CONST(
+    0xc3459c3d, 0x35326167, 0xcd86cce8, 0x07a2417f,
+    0x5b8bd567, 0xde8538ee, 0x0d507b0c, 0xd128f5bb,
+    0x8e467fec, 0xcd30000a, 0x6cc1184e, 0x25d382c2,
+    0xa2f4494e, 0x2fbe9abc, 0x8b64abac, 0xd005fb24
+);
+static const secp256k1_fe secp256k1_fe_const_b = SECP256K1_FE_CONST(
+    0x3d3486b2, 0x159a9ca5, 0xc75638be, 0xb23a69bc,
+    0x946a45ab, 0x24801247, 0xb4ed2b8e, 0x26b6a417
+);
+#  elif EXHAUSTIVE_TEST_ORDER == 199
+static const secp256k1_ge secp256k1_ge_const_g = SECP256K1_GE_CONST(
+    0x226e653f, 0xc8df7744, 0x9bacbf12, 0x7d1dcbf9,
+    0x87f05b2a, 0xe7edbd28, 0x1f564575, 0xc48dcf18,
+    0xa13872c2, 0xe933bb17, 0x5d9ffd5b, 0xb5b6e10c,
+    0x57fe3c00, 0xbaaaa15a, 0xe003ec3e, 0x9c269bae
+);
+static const secp256k1_fe secp256k1_fe_const_b = SECP256K1_FE_CONST(
+    0x2cca28fa, 0xfc614b80, 0x2a3db42b, 0x00ba00b1,
+    0xbea8d943, 0xdace9ab2, 0x9536daea, 0x0074defb
+);
+#  else
+#    error No known generator for the specified exhaustive test group order.
+#  endif
+#else
+/** Generator for secp256k1, value 'g' defined in
+ *  "Standards for Efficient Cryptography" (SEC2) 2.7.1.
+ */
+static const secp256k1_ge secp256k1_ge_const_g = SECP256K1_GE_CONST(
+    0x79BE667EUL, 0xF9DCBBACUL, 0x55A06295UL, 0xCE870B07UL,
+    0x029BFCDBUL, 0x2DCE28D9UL, 0x59F2815BUL, 0x16F81798UL,
+    0x483ADA77UL, 0x26A3C465UL, 0x5DA4FBFCUL, 0x0E1108A8UL,
+    0xFD17B448UL, 0xA6855419UL, 0x9C47D08FUL, 0xFB10D4B8UL
+);
+
+static const secp256k1_fe secp256k1_fe_const_b = SECP256K1_FE_CONST(0, 0, 0, 0, 0, 0, 0, 7);
+#endif
+
+static void secp256k1_ge_set_gej_zinv(secp256k1_ge *r, const secp256k1_gej *a, const secp256k1_fe *zi) {
+    secp256k1_fe zi2;
+    secp256k1_fe zi3;
+    secp256k1_fe_sqr(&zi2, zi);
+    secp256k1_fe_mul(&zi3, &zi2, zi);
+    secp256k1_fe_mul(&r->x, &a->x, &zi2);
+    secp256k1_fe_mul(&r->y, &a->y, &zi3);
+    r->infinity = a->infinity;
+}
+
+static void secp256k1_ge_set_xy(secp256k1_ge *r, const secp256k1_fe *x, const secp256k1_fe *y) {
+    r->infinity = 0;
+    r->x = *x;
+    r->y = *y;
+}
+
+static int secp256k1_ge_is_infinity(const secp256k1_ge *a) {
+    return a->infinity;
+}
+
+static void secp256k1_ge_neg(secp256k1_ge *r, const secp256k1_ge *a) {
+    *r = *a;
+    secp256k1_fe_normalize_weak(&r->y);
+    secp256k1_fe_negate(&r->y, &r->y, 1);
+}
+
+static void secp256k1_ge_set_gej(secp256k1_ge *r, secp256k1_gej *a) {
+    secp256k1_fe z2, z3;
+    r->infinity = a->infinity;
+    secp256k1_fe_inv(&a->z, &a->z);
+    secp256k1_fe_sqr(&z2, &a->z);
+    secp256k1_fe_mul(&z3, &a->z, &z2);
+    secp256k1_fe_mul(&a->x, &a->x, &z2);
+    secp256k1_fe_mul(&a->y, &a->y, &z3);
+    secp256k1_fe_set_int(&a->z, 1);
+    r->x = a->x;
+    r->y = a->y;
+}
+
+static void secp256k1_ge_set_gej_var(secp256k1_ge *r, secp256k1_gej *a) {
+    secp256k1_fe z2, z3;
+    r->infinity = a->infinity;
+    if (a->infinity) {
+        return;
+    }
+    secp256k1_fe_inv_var(&a->z, &a->z);
+    secp256k1_fe_sqr(&z2, &a->z);
+    secp256k1_fe_mul(&z3, &a->z, &z2);
+    secp256k1_fe_mul(&a->x, &a->x, &z2);
+    secp256k1_fe_mul(&a->y, &a->y, &z3);
+    secp256k1_fe_set_int(&a->z, 1);
+    r->x = a->x;
+    r->y = a->y;
+}
+
+static void secp256k1_ge_set_all_gej_var(secp256k1_ge *r, const secp256k1_gej *a, size_t len) {
+    secp256k1_fe u;
+    size_t i;
+    size_t last_i = SIZE_MAX;
+
+    for (i = 0; i < len; i++) {
+        if (!a[i].infinity) {
+            /* Use destination's x coordinates as scratch space */
+            if (last_i == SIZE_MAX) {
+                r[i].x = a[i].z;
+            } else {
+                secp256k1_fe_mul(&r[i].x, &r[last_i].x, &a[i].z);
+            }
+            last_i = i;
+        }
+    }
+    if (last_i == SIZE_MAX) {
+        return;
+    }
+    secp256k1_fe_inv_var(&u, &r[last_i].x);
+
+    i = last_i;
+    while (i > 0) {
+        i--;
+        if (!a[i].infinity) {
+            secp256k1_fe_mul(&r[last_i].x, &r[i].x, &u);
+            secp256k1_fe_mul(&u, &u, &a[last_i].z);
+            last_i = i;
+        }
+    }
+    VERIFY_CHECK(!a[last_i].infinity);
+    r[last_i].x = u;
+
+    for (i = 0; i < len; i++) {
+        r[i].infinity = a[i].infinity;
+        if (!a[i].infinity) {
+            secp256k1_ge_set_gej_zinv(&r[i], &a[i], &r[i].x);
+        }
+    }
+}
+
+static void secp256k1_ge_globalz_set_table_gej(size_t len, secp256k1_ge *r, secp256k1_fe *globalz, const secp256k1_gej *a, const secp256k1_fe *zr) {
+    size_t i = len - 1;
+    secp256k1_fe zs;
+
+    if (len > 0) {
+        /* The z of the final point gives us the "global Z" for the table. */
+        r[i].x = a[i].x;
+        r[i].y = a[i].y;
+        /* Ensure all y values are in weak normal form for fast negation of points */
+        secp256k1_fe_normalize_weak(&r[i].y);
+        *globalz = a[i].z;
+        r[i].infinity = 0;
+        zs = zr[i];
+
+        /* Work our way backwards, using the z-ratios to scale the x/y values. */
+        while (i > 0) {
+            if (i != len - 1) {
+                secp256k1_fe_mul(&zs, &zs, &zr[i]);
+            }
+            i--;
+            secp256k1_ge_set_gej_zinv(&r[i], &a[i], &zs);
+        }
+    }
+}
+
+static void secp256k1_gej_set_infinity(secp256k1_gej *r) {
+    r->infinity = 1;
+    secp256k1_fe_clear(&r->x);
+    secp256k1_fe_clear(&r->y);
+    secp256k1_fe_clear(&r->z);
+}
+
+static void secp256k1_ge_set_infinity(secp256k1_ge *r) {
+    r->infinity = 1;
+    secp256k1_fe_clear(&r->x);
+    secp256k1_fe_clear(&r->y);
+}
+
+static void secp256k1_gej_clear(secp256k1_gej *r) {
+    r->infinity = 0;
+    secp256k1_fe_clear(&r->x);
+    secp256k1_fe_clear(&r->y);
+    secp256k1_fe_clear(&r->z);
+}
+
+static void secp256k1_ge_clear(secp256k1_ge *r) {
+    r->infinity = 0;
+    secp256k1_fe_clear(&r->x);
+    secp256k1_fe_clear(&r->y);
+}
+
+static int secp256k1_ge_set_xquad(secp256k1_ge *r, const secp256k1_fe *x) {
+    secp256k1_fe x2, x3;
+    r->x = *x;
+    secp256k1_fe_sqr(&x2, x);
+    secp256k1_fe_mul(&x3, x, &x2);
+    r->infinity = 0;
+    secp256k1_fe_add(&x3, &secp256k1_fe_const_b);
+    return secp256k1_fe_sqrt(&r->y, &x3);
+}
+
+static int secp256k1_ge_set_xo_var(secp256k1_ge *r, const secp256k1_fe *x, int odd) {
+    if (!secp256k1_ge_set_xquad(r, x)) {
+        return 0;
+    }
+    secp256k1_fe_normalize_var(&r->y);
+    if (secp256k1_fe_is_odd(&r->y) != odd) {
+        secp256k1_fe_negate(&r->y, &r->y, 1);
+    }
+    return 1;
+
+}
+
+static void secp256k1_gej_set_ge(secp256k1_gej *r, const secp256k1_ge *a) {
+   r->infinity = a->infinity;
+   r->x = a->x;
+   r->y = a->y;
+   secp256k1_fe_set_int(&r->z, 1);
+}
+
+static int secp256k1_gej_eq_x_var(const secp256k1_fe *x, const secp256k1_gej *a) {
+    secp256k1_fe r, r2;
+    VERIFY_CHECK(!a->infinity);
+    secp256k1_fe_sqr(&r, &a->z); secp256k1_fe_mul(&r, &r, x);
+    r2 = a->x; secp256k1_fe_normalize_weak(&r2);
+    return secp256k1_fe_equal_var(&r, &r2);
+}
+
+static void secp256k1_gej_neg(secp256k1_gej *r, const secp256k1_gej *a) {
+    r->infinity = a->infinity;
+    r->x = a->x;
+    r->y = a->y;
+    r->z = a->z;
+    secp256k1_fe_normalize_weak(&r->y);
+    secp256k1_fe_negate(&r->y, &r->y, 1);
+}
+
+static int secp256k1_gej_is_infinity(const secp256k1_gej *a) {
+    return a->infinity;
+}
+
+static int secp256k1_ge_is_valid_var(const secp256k1_ge *a) {
+    secp256k1_fe y2, x3;
+    if (a->infinity) {
+        return 0;
+    }
+    /* y^2 = x^3 + 7 */
+    secp256k1_fe_sqr(&y2, &a->y);
+    secp256k1_fe_sqr(&x3, &a->x); secp256k1_fe_mul(&x3, &x3, &a->x);
+    secp256k1_fe_add(&x3, &secp256k1_fe_const_b);
+    secp256k1_fe_normalize_weak(&x3);
+    return secp256k1_fe_equal_var(&y2, &x3);
+}
+
+static SECP256K1_INLINE void secp256k1_gej_double(secp256k1_gej *r, const secp256k1_gej *a) {
+    /* Operations: 3 mul, 4 sqr, 0 normalize, 12 mul_int/add/negate.
+     *
+     * Note that there is an implementation described at
+     *     https://hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html#doubling-dbl-2009-l
+     * which trades a multiply for a square, but in practice this is actually slower,
+     * mainly because it requires more normalizations.
+     */
+    secp256k1_fe t1,t2,t3,t4;
+
+    r->infinity = a->infinity;
+
+    secp256k1_fe_mul(&r->z, &a->z, &a->y);
+    secp256k1_fe_mul_int(&r->z, 2);       /* Z' = 2*Y*Z (2) */
+    secp256k1_fe_sqr(&t1, &a->x);
+    secp256k1_fe_mul_int(&t1, 3);         /* T1 = 3*X^2 (3) */
+    secp256k1_fe_sqr(&t2, &t1);           /* T2 = 9*X^4 (1) */
+    secp256k1_fe_sqr(&t3, &a->y);
+    secp256k1_fe_mul_int(&t3, 2);         /* T3 = 2*Y^2 (2) */
+    secp256k1_fe_sqr(&t4, &t3);
+    secp256k1_fe_mul_int(&t4, 2);         /* T4 = 8*Y^4 (2) */
+    secp256k1_fe_mul(&t3, &t3, &a->x);    /* T3 = 2*X*Y^2 (1) */
+    r->x = t3;
+    secp256k1_fe_mul_int(&r->x, 4);       /* X' = 8*X*Y^2 (4) */
+    secp256k1_fe_negate(&r->x, &r->x, 4); /* X' = -8*X*Y^2 (5) */
+    secp256k1_fe_add(&r->x, &t2);         /* X' = 9*X^4 - 8*X*Y^2 (6) */
+    secp256k1_fe_negate(&t2, &t2, 1);     /* T2 = -9*X^4 (2) */
+    secp256k1_fe_mul_int(&t3, 6);         /* T3 = 12*X*Y^2 (6) */
+    secp256k1_fe_add(&t3, &t2);           /* T3 = 12*X*Y^2 - 9*X^4 (8) */
+    secp256k1_fe_mul(&r->y, &t1, &t3);    /* Y' = 36*X^3*Y^2 - 27*X^6 (1) */
+    secp256k1_fe_negate(&t2, &t4, 2);     /* T2 = -8*Y^4 (3) */
+    secp256k1_fe_add(&r->y, &t2);         /* Y' = 36*X^3*Y^2 - 27*X^6 - 8*Y^4 (4) */
+}
+
+static void secp256k1_gej_double_var(secp256k1_gej *r, const secp256k1_gej *a, secp256k1_fe *rzr) {
+    /** For secp256k1, 2Q is infinity if and only if Q is infinity. This is because if 2Q = infinity,
+     *  Q must equal -Q, or that Q.y == -(Q.y), or Q.y is 0. For a point on y^2 = x^3 + 7 to have
+     *  y=0, x^3 must be -7 mod p. However, -7 has no cube root mod p.
+     *
+     *  Having said this, if this function receives a point on a sextic twist, e.g. by
+     *  a fault attack, it is possible for y to be 0. This happens for y^2 = x^3 + 6,
+     *  since -6 does have a cube root mod p. For this point, this function will not set
+     *  the infinity flag even though the point doubles to infinity, and the result
+     *  point will be gibberish (z = 0 but infinity = 0).
+     */
+    if (a->infinity) {
+        r->infinity = 1;
+        if (rzr != NULL) {
+            secp256k1_fe_set_int(rzr, 1);
+        }
+        return;
+    }
+
+    if (rzr != NULL) {
+        *rzr = a->y;
+        secp256k1_fe_normalize_weak(rzr);
+        secp256k1_fe_mul_int(rzr, 2);
+    }
+
+    secp256k1_gej_double(r, a);
+}
+
+static void secp256k1_gej_add_var(secp256k1_gej *r, const secp256k1_gej *a, const secp256k1_gej *b, secp256k1_fe *rzr) {
+    /* Operations: 12 mul, 4 sqr, 2 normalize, 12 mul_int/add/negate */
+    secp256k1_fe z22, z12, u1, u2, s1, s2, h, i, i2, h2, h3, t;
+
+    if (a->infinity) {
+        VERIFY_CHECK(rzr == NULL);
+        *r = *b;
+        return;
+    }
+
+    if (b->infinity) {
+        if (rzr != NULL) {
+            secp256k1_fe_set_int(rzr, 1);
+        }
+        *r = *a;
+        return;
+    }
+
+    r->infinity = 0;
+    secp256k1_fe_sqr(&z22, &b->z);
+    secp256k1_fe_sqr(&z12, &a->z);
+    secp256k1_fe_mul(&u1, &a->x, &z22);
+    secp256k1_fe_mul(&u2, &b->x, &z12);
+    secp256k1_fe_mul(&s1, &a->y, &z22); secp256k1_fe_mul(&s1, &s1, &b->z);
+    secp256k1_fe_mul(&s2, &b->y, &z12); secp256k1_fe_mul(&s2, &s2, &a->z);
+    secp256k1_fe_negate(&h, &u1, 1); secp256k1_fe_add(&h, &u2);
+    secp256k1_fe_negate(&i, &s1, 1); secp256k1_fe_add(&i, &s2);
+    if (secp256k1_fe_normalizes_to_zero_var(&h)) {
+        if (secp256k1_fe_normalizes_to_zero_var(&i)) {
+            secp256k1_gej_double_var(r, a, rzr);
+        } else {
+            if (rzr != NULL) {
+                secp256k1_fe_set_int(rzr, 0);
+            }
+            secp256k1_gej_set_infinity(r);
+        }
+        return;
+    }
+    secp256k1_fe_sqr(&i2, &i);
+    secp256k1_fe_sqr(&h2, &h);
+    secp256k1_fe_mul(&h3, &h, &h2);
+    secp256k1_fe_mul(&h, &h, &b->z);
+    if (rzr != NULL) {
+        *rzr = h;
+    }
+    secp256k1_fe_mul(&r->z, &a->z, &h);
+    secp256k1_fe_mul(&t, &u1, &h2);
+    r->x = t; secp256k1_fe_mul_int(&r->x, 2); secp256k1_fe_add(&r->x, &h3); secp256k1_fe_negate(&r->x, &r->x, 3); secp256k1_fe_add(&r->x, &i2);
+    secp256k1_fe_negate(&r->y, &r->x, 5); secp256k1_fe_add(&r->y, &t); secp256k1_fe_mul(&r->y, &r->y, &i);
+    secp256k1_fe_mul(&h3, &h3, &s1); secp256k1_fe_negate(&h3, &h3, 1);
+    secp256k1_fe_add(&r->y, &h3);
+}
+
+static void secp256k1_gej_add_ge_var(secp256k1_gej *r, const secp256k1_gej *a, const secp256k1_ge *b, secp256k1_fe *rzr) {
+    /* 8 mul, 3 sqr, 4 normalize, 12 mul_int/add/negate */
+    secp256k1_fe z12, u1, u2, s1, s2, h, i, i2, h2, h3, t;
+    if (a->infinity) {
+        VERIFY_CHECK(rzr == NULL);
+        secp256k1_gej_set_ge(r, b);
+        return;
+    }
+    if (b->infinity) {
+        if (rzr != NULL) {
+            secp256k1_fe_set_int(rzr, 1);
+        }
+        *r = *a;
+        return;
+    }
+    r->infinity = 0;
+
+    secp256k1_fe_sqr(&z12, &a->z);
+    u1 = a->x; secp256k1_fe_normalize_weak(&u1);
+    secp256k1_fe_mul(&u2, &b->x, &z12);
+    s1 = a->y; secp256k1_fe_normalize_weak(&s1);
+    secp256k1_fe_mul(&s2, &b->y, &z12); secp256k1_fe_mul(&s2, &s2, &a->z);
+    secp256k1_fe_negate(&h, &u1, 1); secp256k1_fe_add(&h, &u2);
+    secp256k1_fe_negate(&i, &s1, 1); secp256k1_fe_add(&i, &s2);
+    if (secp256k1_fe_normalizes_to_zero_var(&h)) {
+        if (secp256k1_fe_normalizes_to_zero_var(&i)) {
+            secp256k1_gej_double_var(r, a, rzr);
+        } else {
+            if (rzr != NULL) {
+                secp256k1_fe_set_int(rzr, 0);
+            }
+            secp256k1_gej_set_infinity(r);
+        }
+        return;
+    }
+    secp256k1_fe_sqr(&i2, &i);
+    secp256k1_fe_sqr(&h2, &h);
+    secp256k1_fe_mul(&h3, &h, &h2);
+    if (rzr != NULL) {
+        *rzr = h;
+    }
+    secp256k1_fe_mul(&r->z, &a->z, &h);
+    secp256k1_fe_mul(&t, &u1, &h2);
+    r->x = t; secp256k1_fe_mul_int(&r->x, 2); secp256k1_fe_add(&r->x, &h3); secp256k1_fe_negate(&r->x, &r->x, 3); secp256k1_fe_add(&r->x, &i2);
+    secp256k1_fe_negate(&r->y, &r->x, 5); secp256k1_fe_add(&r->y, &t); secp256k1_fe_mul(&r->y, &r->y, &i);
+    secp256k1_fe_mul(&h3, &h3, &s1); secp256k1_fe_negate(&h3, &h3, 1);
+    secp256k1_fe_add(&r->y, &h3);
+}
+
+static void secp256k1_gej_add_zinv_var(secp256k1_gej *r, const secp256k1_gej *a, const secp256k1_ge *b, const secp256k1_fe *bzinv) {
+    /* 9 mul, 3 sqr, 4 normalize, 12 mul_int/add/negate */
+    secp256k1_fe az, z12, u1, u2, s1, s2, h, i, i2, h2, h3, t;
+
+    if (b->infinity) {
+        *r = *a;
+        return;
+    }
+    if (a->infinity) {
+        secp256k1_fe bzinv2, bzinv3;
+        r->infinity = b->infinity;
+        secp256k1_fe_sqr(&bzinv2, bzinv);
+        secp256k1_fe_mul(&bzinv3, &bzinv2, bzinv);
+        secp256k1_fe_mul(&r->x, &b->x, &bzinv2);
+        secp256k1_fe_mul(&r->y, &b->y, &bzinv3);
+        secp256k1_fe_set_int(&r->z, 1);
+        return;
+    }
+    r->infinity = 0;
+
+    /** We need to calculate (rx,ry,rz) = (ax,ay,az) + (bx,by,1/bzinv). Due to
+     *  secp256k1's isomorphism we can multiply the Z coordinates on both sides
+     *  by bzinv, and get: (rx,ry,rz*bzinv) = (ax,ay,az*bzinv) + (bx,by,1).
+     *  This means that (rx,ry,rz) can be calculated as
+     *  (ax,ay,az*bzinv) + (bx,by,1), when not applying the bzinv factor to rz.
+     *  The variable az below holds the modified Z coordinate for a, which is used
+     *  for the computation of rx and ry, but not for rz.
+     */
+    secp256k1_fe_mul(&az, &a->z, bzinv);
+
+    secp256k1_fe_sqr(&z12, &az);
+    u1 = a->x; secp256k1_fe_normalize_weak(&u1);
+    secp256k1_fe_mul(&u2, &b->x, &z12);
+    s1 = a->y; secp256k1_fe_normalize_weak(&s1);
+    secp256k1_fe_mul(&s2, &b->y, &z12); secp256k1_fe_mul(&s2, &s2, &az);
+    secp256k1_fe_negate(&h, &u1, 1); secp256k1_fe_add(&h, &u2);
+    secp256k1_fe_negate(&i, &s1, 1); secp256k1_fe_add(&i, &s2);
+    if (secp256k1_fe_normalizes_to_zero_var(&h)) {
+        if (secp256k1_fe_normalizes_to_zero_var(&i)) {
+            secp256k1_gej_double_var(r, a, NULL);
+        } else {
+            secp256k1_gej_set_infinity(r);
+        }
+        return;
+    }
+    secp256k1_fe_sqr(&i2, &i);
+    secp256k1_fe_sqr(&h2, &h);
+    secp256k1_fe_mul(&h3, &h, &h2);
+    r->z = a->z; secp256k1_fe_mul(&r->z, &r->z, &h);
+    secp256k1_fe_mul(&t, &u1, &h2);
+    r->x = t; secp256k1_fe_mul_int(&r->x, 2); secp256k1_fe_add(&r->x, &h3); secp256k1_fe_negate(&r->x, &r->x, 3); secp256k1_fe_add(&r->x, &i2);
+    secp256k1_fe_negate(&r->y, &r->x, 5); secp256k1_fe_add(&r->y, &t); secp256k1_fe_mul(&r->y, &r->y, &i);
+    secp256k1_fe_mul(&h3, &h3, &s1); secp256k1_fe_negate(&h3, &h3, 1);
+    secp256k1_fe_add(&r->y, &h3);
+}
+
+
+static void secp256k1_gej_add_ge(secp256k1_gej *r, const secp256k1_gej *a, const secp256k1_ge *b) {
+    /* Operations: 7 mul, 5 sqr, 4 normalize, 21 mul_int/add/negate/cmov */
+    static const secp256k1_fe fe_1 = SECP256K1_FE_CONST(0, 0, 0, 0, 0, 0, 0, 1);
+    secp256k1_fe zz, u1, u2, s1, s2, t, tt, m, n, q, rr;
+    secp256k1_fe m_alt, rr_alt;
+    int infinity, degenerate;
+    VERIFY_CHECK(!b->infinity);
+    VERIFY_CHECK(a->infinity == 0 || a->infinity == 1);
+
+    /** In:
+     *    Eric Brier and Marc Joye, Weierstrass Elliptic Curves and Side-Channel Attacks.
+     *    In D. Naccache and P. Paillier, Eds., Public Key Cryptography, vol. 2274 of Lecture Notes in Computer Science, pages 335-345. Springer-Verlag, 2002.
+     *  we find as solution for a unified addition/doubling formula:
+     *    lambda = ((x1 + x2)^2 - x1 * x2 + a) / (y1 + y2), with a = 0 for secp256k1's curve equation.
+     *    x3 = lambda^2 - (x1 + x2)
+     *    2*y3 = lambda * (x1 + x2 - 2 * x3) - (y1 + y2).
+     *
+     *  Substituting x_i = Xi / Zi^2 and yi = Yi / Zi^3, for i=1,2,3, gives:
+     *    U1 = X1*Z2^2, U2 = X2*Z1^2
+     *    S1 = Y1*Z2^3, S2 = Y2*Z1^3
+     *    Z = Z1*Z2
+     *    T = U1+U2
+     *    M = S1+S2
+     *    Q = T*M^2
+     *    R = T^2-U1*U2
+     *    X3 = 4*(R^2-Q)
+     *    Y3 = 4*(R*(3*Q-2*R^2)-M^4)
+     *    Z3 = 2*M*Z
+     *  (Note that the paper uses xi = Xi / Zi and yi = Yi / Zi instead.)
+     *
+     *  This formula has the benefit of being the same for both addition
+     *  of distinct points and doubling. However, it breaks down in the
+     *  case that either point is infinity, or that y1 = -y2. We handle
+     *  these cases in the following ways:
+     *
+     *    - If b is infinity we simply bail by means of a VERIFY_CHECK.
+     *
+     *    - If a is infinity, we detect this, and at the end of the
+     *      computation replace the result (which will be meaningless,
+     *      but we compute to be constant-time) with b.x : b.y : 1.
+     *
+     *    - If a = -b, we have y1 = -y2, which is a degenerate case.
+     *      But here the answer is infinity, so we simply set the
+     *      infinity flag of the result, overriding the computed values
+     *      without even needing to cmov.
+     *
+     *    - If y1 = -y2 but x1 != x2, which does occur thanks to certain
+     *      properties of our curve (specifically, 1 has nontrivial cube
+     *      roots in our field, and the curve equation has no x coefficient)
+     *      then the answer is not infinity but also not given by the above
+     *      equation. In this case, we cmov in place an alternate expression
+     *      for lambda. Specifically (y1 - y2)/(x1 - x2). Where both these
+     *      expressions for lambda are defined, they are equal, and can be
+     *      obtained from each other by multiplication by (y1 + y2)/(y1 + y2)
+     *      then substitution of x^3 + 7 for y^2 (using the curve equation).
+     *      For all pairs of nonzero points (a, b) at least one is defined,
+     *      so this covers everything.
+     */
+
+    secp256k1_fe_sqr(&zz, &a->z);                       /* z = Z1^2 */
+    u1 = a->x; secp256k1_fe_normalize_weak(&u1);        /* u1 = U1 = X1*Z2^2 (1) */
+    secp256k1_fe_mul(&u2, &b->x, &zz);                  /* u2 = U2 = X2*Z1^2 (1) */
+    s1 = a->y; secp256k1_fe_normalize_weak(&s1);        /* s1 = S1 = Y1*Z2^3 (1) */
+    secp256k1_fe_mul(&s2, &b->y, &zz);                  /* s2 = Y2*Z1^2 (1) */
+    secp256k1_fe_mul(&s2, &s2, &a->z);                  /* s2 = S2 = Y2*Z1^3 (1) */
+    t = u1; secp256k1_fe_add(&t, &u2);                  /* t = T = U1+U2 (2) */
+    m = s1; secp256k1_fe_add(&m, &s2);                  /* m = M = S1+S2 (2) */
+    secp256k1_fe_sqr(&rr, &t);                          /* rr = T^2 (1) */
+    secp256k1_fe_negate(&m_alt, &u2, 1);                /* Malt = -X2*Z1^2 */
+    secp256k1_fe_mul(&tt, &u1, &m_alt);                 /* tt = -U1*U2 (2) */
+    secp256k1_fe_add(&rr, &tt);                         /* rr = R = T^2-U1*U2 (3) */
+    /** If lambda = R/M = 0/0 we have a problem (except in the "trivial"
+     *  case that Z = z1z2 = 0, and this is special-cased later on). */
+    degenerate = secp256k1_fe_normalizes_to_zero(&m) &
+                 secp256k1_fe_normalizes_to_zero(&rr);
+    /* This only occurs when y1 == -y2 and x1^3 == x2^3, but x1 != x2.
+     * This means either x1 == beta*x2 or beta*x1 == x2, where beta is
+     * a nontrivial cube root of one. In either case, an alternate
+     * non-indeterminate expression for lambda is (y1 - y2)/(x1 - x2),
+     * so we set R/M equal to this. */
+    rr_alt = s1;
+    secp256k1_fe_mul_int(&rr_alt, 2);       /* rr = Y1*Z2^3 - Y2*Z1^3 (2) */
+    secp256k1_fe_add(&m_alt, &u1);          /* Malt = X1*Z2^2 - X2*Z1^2 */
+
+    secp256k1_fe_cmov(&rr_alt, &rr, !degenerate);
+    secp256k1_fe_cmov(&m_alt, &m, !degenerate);
+    /* Now Ralt / Malt = lambda and is guaranteed not to be 0/0.
+     * From here on out Ralt and Malt represent the numerator
+     * and denominator of lambda; R and M represent the explicit
+     * expressions x1^2 + x2^2 + x1x2 and y1 + y2. */
+    secp256k1_fe_sqr(&n, &m_alt);                       /* n = Malt^2 (1) */
+    secp256k1_fe_mul(&q, &n, &t);                       /* q = Q = T*Malt^2 (1) */
+    /* These two lines use the observation that either M == Malt or M == 0,
+     * so M^3 * Malt is either Malt^4 (which is computed by squaring), or
+     * zero (which is "computed" by cmov). So the cost is one squaring
+     * versus two multiplications. */
+    secp256k1_fe_sqr(&n, &n);
+    secp256k1_fe_cmov(&n, &m, degenerate);              /* n = M^3 * Malt (2) */
+    secp256k1_fe_sqr(&t, &rr_alt);                      /* t = Ralt^2 (1) */
+    secp256k1_fe_mul(&r->z, &a->z, &m_alt);             /* r->z = Malt*Z (1) */
+    infinity = secp256k1_fe_normalizes_to_zero(&r->z) * (1 - a->infinity);
+    secp256k1_fe_mul_int(&r->z, 2);                     /* r->z = Z3 = 2*Malt*Z (2) */
+    secp256k1_fe_negate(&q, &q, 1);                     /* q = -Q (2) */
+    secp256k1_fe_add(&t, &q);                           /* t = Ralt^2-Q (3) */
+    secp256k1_fe_normalize_weak(&t);
+    r->x = t;                                           /* r->x = Ralt^2-Q (1) */
+    secp256k1_fe_mul_int(&t, 2);                        /* t = 2*x3 (2) */
+    secp256k1_fe_add(&t, &q);                           /* t = 2*x3 - Q: (4) */
+    secp256k1_fe_mul(&t, &t, &rr_alt);                  /* t = Ralt*(2*x3 - Q) (1) */
+    secp256k1_fe_add(&t, &n);                           /* t = Ralt*(2*x3 - Q) + M^3*Malt (3) */
+    secp256k1_fe_negate(&r->y, &t, 3);                  /* r->y = Ralt*(Q - 2x3) - M^3*Malt (4) */
+    secp256k1_fe_normalize_weak(&r->y);
+    secp256k1_fe_mul_int(&r->x, 4);                     /* r->x = X3 = 4*(Ralt^2-Q) */
+    secp256k1_fe_mul_int(&r->y, 4);                     /* r->y = Y3 = 4*Ralt*(Q - 2x3) - 4*M^3*Malt (4) */
+
+    /** In case a->infinity == 1, replace r with (b->x, b->y, 1). */
+    secp256k1_fe_cmov(&r->x, &b->x, a->infinity);
+    secp256k1_fe_cmov(&r->y, &b->y, a->infinity);
+    secp256k1_fe_cmov(&r->z, &fe_1, a->infinity);
+    r->infinity = infinity;
+}
+
+static void secp256k1_gej_rescale(secp256k1_gej *r, const secp256k1_fe *s) {
+    /* Operations: 4 mul, 1 sqr */
+    secp256k1_fe zz;
+    VERIFY_CHECK(!secp256k1_fe_is_zero(s));
+    secp256k1_fe_sqr(&zz, s);
+    secp256k1_fe_mul(&r->x, &r->x, &zz);                /* r->x *= s^2 */
+    secp256k1_fe_mul(&r->y, &r->y, &zz);
+    secp256k1_fe_mul(&r->y, &r->y, s);                  /* r->y *= s^3 */
+    secp256k1_fe_mul(&r->z, &r->z, s);                  /* r->z *= s   */
+}
+
+static void secp256k1_ge_to_storage(secp256k1_ge_storage *r, const secp256k1_ge *a) {
+    secp256k1_fe x, y;
+    VERIFY_CHECK(!a->infinity);
+    x = a->x;
+    secp256k1_fe_normalize(&x);
+    y = a->y;
+    secp256k1_fe_normalize(&y);
+    secp256k1_fe_to_storage(&r->x, &x);
+    secp256k1_fe_to_storage(&r->y, &y);
+}
+
+static void secp256k1_ge_from_storage(secp256k1_ge *r, const secp256k1_ge_storage *a) {
+    secp256k1_fe_from_storage(&r->x, &a->x);
+    secp256k1_fe_from_storage(&r->y, &a->y);
+    r->infinity = 0;
+}
+
+static SECP256K1_INLINE void secp256k1_ge_storage_cmov(secp256k1_ge_storage *r, const secp256k1_ge_storage *a, int flag) {
+    secp256k1_fe_storage_cmov(&r->x, &a->x, flag);
+    secp256k1_fe_storage_cmov(&r->y, &a->y, flag);
+}
+
+static void secp256k1_ge_mul_lambda(secp256k1_ge *r, const secp256k1_ge *a) {
+    static const secp256k1_fe beta = SECP256K1_FE_CONST(
+        0x7ae96a2bul, 0x657c0710ul, 0x6e64479eul, 0xac3434e9ul,
+        0x9cf04975ul, 0x12f58995ul, 0xc1396c28ul, 0x719501eeul
+    );
+    *r = *a;
+    secp256k1_fe_mul(&r->x, &r->x, &beta);
+}
+
+static int secp256k1_gej_has_quad_y_var(const secp256k1_gej *a) {
+    secp256k1_fe yz;
+
+    if (a->infinity) {
+        return 0;
+    }
+
+    /* We rely on the fact that the Jacobi symbol of 1 / a->z^3 is the same as
+     * that of a->z. Thus a->y / a->z^3 is a quadratic residue iff a->y * a->z
+       is */
+    secp256k1_fe_mul(&yz, &a->y, &a->z);
+    return secp256k1_fe_is_quad_var(&yz);
+}
+
+static int secp256k1_ge_is_in_correct_subgroup(const secp256k1_ge* ge) {
+#ifdef EXHAUSTIVE_TEST_ORDER
+    secp256k1_gej out;
+    int i;
+
+    /* A very simple EC multiplication ladder that avoids a dependency on ecmult. */
+    secp256k1_gej_set_infinity(&out);
+    for (i = 0; i < 32; ++i) {
+        secp256k1_gej_double_var(&out, &out, NULL);
+        if ((((uint32_t)EXHAUSTIVE_TEST_ORDER) >> (31 - i)) & 1) {
+            secp256k1_gej_add_ge_var(&out, &out, ge, NULL);
+        }
+    }
+    return secp256k1_gej_is_infinity(&out);
+#else
+    (void)ge;
+    /* The real secp256k1 group has cofactor 1, so the subgroup is the entire curve. */
+    return 1;
+#endif
+}
+
+#endif /* SECP256K1_GROUP_IMPL_H */
diff --git a/depend/zcash/src/secp256k1/src/hash.h b/depend/zcash/src/secp256k1/src/hash.h
new file mode 100644
index 000000000..0947a0969
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/hash.h
@@ -0,0 +1,41 @@
+/***********************************************************************
+ * Copyright (c) 2014 Pieter Wuille                                    *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_HASH_H
+#define SECP256K1_HASH_H
+
+#include <stdlib.h>
+#include <stdint.h>
+
+typedef struct {
+    uint32_t s[8];
+    uint32_t buf[16]; /* In big endian */
+    size_t bytes;
+} secp256k1_sha256;
+
+static void secp256k1_sha256_initialize(secp256k1_sha256 *hash);
+static void secp256k1_sha256_write(secp256k1_sha256 *hash, const unsigned char *data, size_t size);
+static void secp256k1_sha256_finalize(secp256k1_sha256 *hash, unsigned char *out32);
+
+typedef struct {
+    secp256k1_sha256 inner, outer;
+} secp256k1_hmac_sha256;
+
+static void secp256k1_hmac_sha256_initialize(secp256k1_hmac_sha256 *hash, const unsigned char *key, size_t size);
+static void secp256k1_hmac_sha256_write(secp256k1_hmac_sha256 *hash, const unsigned char *data, size_t size);
+static void secp256k1_hmac_sha256_finalize(secp256k1_hmac_sha256 *hash, unsigned char *out32);
+
+typedef struct {
+    unsigned char v[32];
+    unsigned char k[32];
+    int retry;
+} secp256k1_rfc6979_hmac_sha256;
+
+static void secp256k1_rfc6979_hmac_sha256_initialize(secp256k1_rfc6979_hmac_sha256 *rng, const unsigned char *key, size_t keylen);
+static void secp256k1_rfc6979_hmac_sha256_generate(secp256k1_rfc6979_hmac_sha256 *rng, unsigned char *out, size_t outlen);
+static void secp256k1_rfc6979_hmac_sha256_finalize(secp256k1_rfc6979_hmac_sha256 *rng);
+
+#endif /* SECP256K1_HASH_H */
diff --git a/depend/zcash/src/secp256k1/src/hash_impl.h b/depend/zcash/src/secp256k1/src/hash_impl.h
new file mode 100644
index 000000000..f8cd3a163
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/hash_impl.h
@@ -0,0 +1,297 @@
+/***********************************************************************
+ * Copyright (c) 2014 Pieter Wuille                                    *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_HASH_IMPL_H
+#define SECP256K1_HASH_IMPL_H
+
+#include "hash.h"
+#include "util.h"
+
+#include <stdlib.h>
+#include <stdint.h>
+#include <string.h>
+
+#define Ch(x,y,z) ((z) ^ ((x) & ((y) ^ (z))))
+#define Maj(x,y,z) (((x) & (y)) | ((z) & ((x) | (y))))
+#define Sigma0(x) (((x) >> 2 | (x) << 30) ^ ((x) >> 13 | (x) << 19) ^ ((x) >> 22 | (x) << 10))
+#define Sigma1(x) (((x) >> 6 | (x) << 26) ^ ((x) >> 11 | (x) << 21) ^ ((x) >> 25 | (x) << 7))
+#define sigma0(x) (((x) >> 7 | (x) << 25) ^ ((x) >> 18 | (x) << 14) ^ ((x) >> 3))
+#define sigma1(x) (((x) >> 17 | (x) << 15) ^ ((x) >> 19 | (x) << 13) ^ ((x) >> 10))
+
+#define Round(a,b,c,d,e,f,g,h,k,w) do { \
+    uint32_t t1 = (h) + Sigma1(e) + Ch((e), (f), (g)) + (k) + (w); \
+    uint32_t t2 = Sigma0(a) + Maj((a), (b), (c)); \
+    (d) += t1; \
+    (h) = t1 + t2; \
+} while(0)
+
+#if defined(SECP256K1_BIG_ENDIAN)
+#define BE32(x) (x)
+#elif defined(SECP256K1_LITTLE_ENDIAN)
+#define BE32(p) ((((p) & 0xFF) << 24) | (((p) & 0xFF00) << 8) | (((p) & 0xFF0000) >> 8) | (((p) & 0xFF000000) >> 24))
+#endif
+
+static void secp256k1_sha256_initialize(secp256k1_sha256 *hash) {
+    hash->s[0] = 0x6a09e667ul;
+    hash->s[1] = 0xbb67ae85ul;
+    hash->s[2] = 0x3c6ef372ul;
+    hash->s[3] = 0xa54ff53aul;
+    hash->s[4] = 0x510e527ful;
+    hash->s[5] = 0x9b05688cul;
+    hash->s[6] = 0x1f83d9abul;
+    hash->s[7] = 0x5be0cd19ul;
+    hash->bytes = 0;
+}
+
+/** Perform one SHA-256 transformation, processing 16 big endian 32-bit words. */
+static void secp256k1_sha256_transform(uint32_t* s, const uint32_t* chunk) {
+    uint32_t a = s[0], b = s[1], c = s[2], d = s[3], e = s[4], f = s[5], g = s[6], h = s[7];
+    uint32_t w0, w1, w2, w3, w4, w5, w6, w7, w8, w9, w10, w11, w12, w13, w14, w15;
+
+    Round(a, b, c, d, e, f, g, h, 0x428a2f98, w0 = BE32(chunk[0]));
+    Round(h, a, b, c, d, e, f, g, 0x71374491, w1 = BE32(chunk[1]));
+    Round(g, h, a, b, c, d, e, f, 0xb5c0fbcf, w2 = BE32(chunk[2]));
+    Round(f, g, h, a, b, c, d, e, 0xe9b5dba5, w3 = BE32(chunk[3]));
+    Round(e, f, g, h, a, b, c, d, 0x3956c25b, w4 = BE32(chunk[4]));
+    Round(d, e, f, g, h, a, b, c, 0x59f111f1, w5 = BE32(chunk[5]));
+    Round(c, d, e, f, g, h, a, b, 0x923f82a4, w6 = BE32(chunk[6]));
+    Round(b, c, d, e, f, g, h, a, 0xab1c5ed5, w7 = BE32(chunk[7]));
+    Round(a, b, c, d, e, f, g, h, 0xd807aa98, w8 = BE32(chunk[8]));
+    Round(h, a, b, c, d, e, f, g, 0x12835b01, w9 = BE32(chunk[9]));
+    Round(g, h, a, b, c, d, e, f, 0x243185be, w10 = BE32(chunk[10]));
+    Round(f, g, h, a, b, c, d, e, 0x550c7dc3, w11 = BE32(chunk[11]));
+    Round(e, f, g, h, a, b, c, d, 0x72be5d74, w12 = BE32(chunk[12]));
+    Round(d, e, f, g, h, a, b, c, 0x80deb1fe, w13 = BE32(chunk[13]));
+    Round(c, d, e, f, g, h, a, b, 0x9bdc06a7, w14 = BE32(chunk[14]));
+    Round(b, c, d, e, f, g, h, a, 0xc19bf174, w15 = BE32(chunk[15]));
+
+    Round(a, b, c, d, e, f, g, h, 0xe49b69c1, w0 += sigma1(w14) + w9 + sigma0(w1));
+    Round(h, a, b, c, d, e, f, g, 0xefbe4786, w1 += sigma1(w15) + w10 + sigma0(w2));
+    Round(g, h, a, b, c, d, e, f, 0x0fc19dc6, w2 += sigma1(w0) + w11 + sigma0(w3));
+    Round(f, g, h, a, b, c, d, e, 0x240ca1cc, w3 += sigma1(w1) + w12 + sigma0(w4));
+    Round(e, f, g, h, a, b, c, d, 0x2de92c6f, w4 += sigma1(w2) + w13 + sigma0(w5));
+    Round(d, e, f, g, h, a, b, c, 0x4a7484aa, w5 += sigma1(w3) + w14 + sigma0(w6));
+    Round(c, d, e, f, g, h, a, b, 0x5cb0a9dc, w6 += sigma1(w4) + w15 + sigma0(w7));
+    Round(b, c, d, e, f, g, h, a, 0x76f988da, w7 += sigma1(w5) + w0 + sigma0(w8));
+    Round(a, b, c, d, e, f, g, h, 0x983e5152, w8 += sigma1(w6) + w1 + sigma0(w9));
+    Round(h, a, b, c, d, e, f, g, 0xa831c66d, w9 += sigma1(w7) + w2 + sigma0(w10));
+    Round(g, h, a, b, c, d, e, f, 0xb00327c8, w10 += sigma1(w8) + w3 + sigma0(w11));
+    Round(f, g, h, a, b, c, d, e, 0xbf597fc7, w11 += sigma1(w9) + w4 + sigma0(w12));
+    Round(e, f, g, h, a, b, c, d, 0xc6e00bf3, w12 += sigma1(w10) + w5 + sigma0(w13));
+    Round(d, e, f, g, h, a, b, c, 0xd5a79147, w13 += sigma1(w11) + w6 + sigma0(w14));
+    Round(c, d, e, f, g, h, a, b, 0x06ca6351, w14 += sigma1(w12) + w7 + sigma0(w15));
+    Round(b, c, d, e, f, g, h, a, 0x14292967, w15 += sigma1(w13) + w8 + sigma0(w0));
+
+    Round(a, b, c, d, e, f, g, h, 0x27b70a85, w0 += sigma1(w14) + w9 + sigma0(w1));
+    Round(h, a, b, c, d, e, f, g, 0x2e1b2138, w1 += sigma1(w15) + w10 + sigma0(w2));
+    Round(g, h, a, b, c, d, e, f, 0x4d2c6dfc, w2 += sigma1(w0) + w11 + sigma0(w3));
+    Round(f, g, h, a, b, c, d, e, 0x53380d13, w3 += sigma1(w1) + w12 + sigma0(w4));
+    Round(e, f, g, h, a, b, c, d, 0x650a7354, w4 += sigma1(w2) + w13 + sigma0(w5));
+    Round(d, e, f, g, h, a, b, c, 0x766a0abb, w5 += sigma1(w3) + w14 + sigma0(w6));
+    Round(c, d, e, f, g, h, a, b, 0x81c2c92e, w6 += sigma1(w4) + w15 + sigma0(w7));
+    Round(b, c, d, e, f, g, h, a, 0x92722c85, w7 += sigma1(w5) + w0 + sigma0(w8));
+    Round(a, b, c, d, e, f, g, h, 0xa2bfe8a1, w8 += sigma1(w6) + w1 + sigma0(w9));
+    Round(h, a, b, c, d, e, f, g, 0xa81a664b, w9 += sigma1(w7) + w2 + sigma0(w10));
+    Round(g, h, a, b, c, d, e, f, 0xc24b8b70, w10 += sigma1(w8) + w3 + sigma0(w11));
+    Round(f, g, h, a, b, c, d, e, 0xc76c51a3, w11 += sigma1(w9) + w4 + sigma0(w12));
+    Round(e, f, g, h, a, b, c, d, 0xd192e819, w12 += sigma1(w10) + w5 + sigma0(w13));
+    Round(d, e, f, g, h, a, b, c, 0xd6990624, w13 += sigma1(w11) + w6 + sigma0(w14));
+    Round(c, d, e, f, g, h, a, b, 0xf40e3585, w14 += sigma1(w12) + w7 + sigma0(w15));
+    Round(b, c, d, e, f, g, h, a, 0x106aa070, w15 += sigma1(w13) + w8 + sigma0(w0));
+
+    Round(a, b, c, d, e, f, g, h, 0x19a4c116, w0 += sigma1(w14) + w9 + sigma0(w1));
+    Round(h, a, b, c, d, e, f, g, 0x1e376c08, w1 += sigma1(w15) + w10 + sigma0(w2));
+    Round(g, h, a, b, c, d, e, f, 0x2748774c, w2 += sigma1(w0) + w11 + sigma0(w3));
+    Round(f, g, h, a, b, c, d, e, 0x34b0bcb5, w3 += sigma1(w1) + w12 + sigma0(w4));
+    Round(e, f, g, h, a, b, c, d, 0x391c0cb3, w4 += sigma1(w2) + w13 + sigma0(w5));
+    Round(d, e, f, g, h, a, b, c, 0x4ed8aa4a, w5 += sigma1(w3) + w14 + sigma0(w6));
+    Round(c, d, e, f, g, h, a, b, 0x5b9cca4f, w6 += sigma1(w4) + w15 + sigma0(w7));
+    Round(b, c, d, e, f, g, h, a, 0x682e6ff3, w7 += sigma1(w5) + w0 + sigma0(w8));
+    Round(a, b, c, d, e, f, g, h, 0x748f82ee, w8 += sigma1(w6) + w1 + sigma0(w9));
+    Round(h, a, b, c, d, e, f, g, 0x78a5636f, w9 += sigma1(w7) + w2 + sigma0(w10));
+    Round(g, h, a, b, c, d, e, f, 0x84c87814, w10 += sigma1(w8) + w3 + sigma0(w11));
+    Round(f, g, h, a, b, c, d, e, 0x8cc70208, w11 += sigma1(w9) + w4 + sigma0(w12));
+    Round(e, f, g, h, a, b, c, d, 0x90befffa, w12 += sigma1(w10) + w5 + sigma0(w13));
+    Round(d, e, f, g, h, a, b, c, 0xa4506ceb, w13 += sigma1(w11) + w6 + sigma0(w14));
+    Round(c, d, e, f, g, h, a, b, 0xbef9a3f7, w14 + sigma1(w12) + w7 + sigma0(w15));
+    Round(b, c, d, e, f, g, h, a, 0xc67178f2, w15 + sigma1(w13) + w8 + sigma0(w0));
+
+    s[0] += a;
+    s[1] += b;
+    s[2] += c;
+    s[3] += d;
+    s[4] += e;
+    s[5] += f;
+    s[6] += g;
+    s[7] += h;
+}
+
+static void secp256k1_sha256_write(secp256k1_sha256 *hash, const unsigned char *data, size_t len) {
+    size_t bufsize = hash->bytes & 0x3F;
+    hash->bytes += len;
+    VERIFY_CHECK(hash->bytes >= len);
+    while (len >= 64 - bufsize) {
+        /* Fill the buffer, and process it. */
+        size_t chunk_len = 64 - bufsize;
+        memcpy(((unsigned char*)hash->buf) + bufsize, data, chunk_len);
+        data += chunk_len;
+        len -= chunk_len;
+        secp256k1_sha256_transform(hash->s, hash->buf);
+        bufsize = 0;
+    }
+    if (len) {
+        /* Fill the buffer with what remains. */
+        memcpy(((unsigned char*)hash->buf) + bufsize, data, len);
+    }
+}
+
+static void secp256k1_sha256_finalize(secp256k1_sha256 *hash, unsigned char *out32) {
+    static const unsigned char pad[64] = {0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
+    uint32_t sizedesc[2];
+    uint32_t out[8];
+    int i = 0;
+    sizedesc[0] = BE32(hash->bytes >> 29);
+    sizedesc[1] = BE32(hash->bytes << 3);
+    secp256k1_sha256_write(hash, pad, 1 + ((119 - (hash->bytes % 64)) % 64));
+    secp256k1_sha256_write(hash, (const unsigned char*)sizedesc, 8);
+    for (i = 0; i < 8; i++) {
+        out[i] = BE32(hash->s[i]);
+        hash->s[i] = 0;
+    }
+    memcpy(out32, (const unsigned char*)out, 32);
+}
+
+/* Initializes a sha256 struct and writes the 64 byte string
+ * SHA256(tag)||SHA256(tag) into it. */
+static void secp256k1_sha256_initialize_tagged(secp256k1_sha256 *hash, const unsigned char *tag, size_t taglen) {
+    unsigned char buf[32];
+    secp256k1_sha256_initialize(hash);
+    secp256k1_sha256_write(hash, tag, taglen);
+    secp256k1_sha256_finalize(hash, buf);
+
+    secp256k1_sha256_initialize(hash);
+    secp256k1_sha256_write(hash, buf, 32);
+    secp256k1_sha256_write(hash, buf, 32);
+}
+
+static void secp256k1_hmac_sha256_initialize(secp256k1_hmac_sha256 *hash, const unsigned char *key, size_t keylen) {
+    size_t n;
+    unsigned char rkey[64];
+    if (keylen <= sizeof(rkey)) {
+        memcpy(rkey, key, keylen);
+        memset(rkey + keylen, 0, sizeof(rkey) - keylen);
+    } else {
+        secp256k1_sha256 sha256;
+        secp256k1_sha256_initialize(&sha256);
+        secp256k1_sha256_write(&sha256, key, keylen);
+        secp256k1_sha256_finalize(&sha256, rkey);
+        memset(rkey + 32, 0, 32);
+    }
+
+    secp256k1_sha256_initialize(&hash->outer);
+    for (n = 0; n < sizeof(rkey); n++) {
+        rkey[n] ^= 0x5c;
+    }
+    secp256k1_sha256_write(&hash->outer, rkey, sizeof(rkey));
+
+    secp256k1_sha256_initialize(&hash->inner);
+    for (n = 0; n < sizeof(rkey); n++) {
+        rkey[n] ^= 0x5c ^ 0x36;
+    }
+    secp256k1_sha256_write(&hash->inner, rkey, sizeof(rkey));
+    memset(rkey, 0, sizeof(rkey));
+}
+
+static void secp256k1_hmac_sha256_write(secp256k1_hmac_sha256 *hash, const unsigned char *data, size_t size) {
+    secp256k1_sha256_write(&hash->inner, data, size);
+}
+
+static void secp256k1_hmac_sha256_finalize(secp256k1_hmac_sha256 *hash, unsigned char *out32) {
+    unsigned char temp[32];
+    secp256k1_sha256_finalize(&hash->inner, temp);
+    secp256k1_sha256_write(&hash->outer, temp, 32);
+    memset(temp, 0, 32);
+    secp256k1_sha256_finalize(&hash->outer, out32);
+}
+
+
+static void secp256k1_rfc6979_hmac_sha256_initialize(secp256k1_rfc6979_hmac_sha256 *rng, const unsigned char *key, size_t keylen) {
+    secp256k1_hmac_sha256 hmac;
+    static const unsigned char zero[1] = {0x00};
+    static const unsigned char one[1] = {0x01};
+
+    memset(rng->v, 0x01, 32); /* RFC6979 3.2.b. */
+    memset(rng->k, 0x00, 32); /* RFC6979 3.2.c. */
+
+    /* RFC6979 3.2.d. */
+    secp256k1_hmac_sha256_initialize(&hmac, rng->k, 32);
+    secp256k1_hmac_sha256_write(&hmac, rng->v, 32);
+    secp256k1_hmac_sha256_write(&hmac, zero, 1);
+    secp256k1_hmac_sha256_write(&hmac, key, keylen);
+    secp256k1_hmac_sha256_finalize(&hmac, rng->k);
+    secp256k1_hmac_sha256_initialize(&hmac, rng->k, 32);
+    secp256k1_hmac_sha256_write(&hmac, rng->v, 32);
+    secp256k1_hmac_sha256_finalize(&hmac, rng->v);
+
+    /* RFC6979 3.2.f. */
+    secp256k1_hmac_sha256_initialize(&hmac, rng->k, 32);
+    secp256k1_hmac_sha256_write(&hmac, rng->v, 32);
+    secp256k1_hmac_sha256_write(&hmac, one, 1);
+    secp256k1_hmac_sha256_write(&hmac, key, keylen);
+    secp256k1_hmac_sha256_finalize(&hmac, rng->k);
+    secp256k1_hmac_sha256_initialize(&hmac, rng->k, 32);
+    secp256k1_hmac_sha256_write(&hmac, rng->v, 32);
+    secp256k1_hmac_sha256_finalize(&hmac, rng->v);
+    rng->retry = 0;
+}
+
+static void secp256k1_rfc6979_hmac_sha256_generate(secp256k1_rfc6979_hmac_sha256 *rng, unsigned char *out, size_t outlen) {
+    /* RFC6979 3.2.h. */
+    static const unsigned char zero[1] = {0x00};
+    if (rng->retry) {
+        secp256k1_hmac_sha256 hmac;
+        secp256k1_hmac_sha256_initialize(&hmac, rng->k, 32);
+        secp256k1_hmac_sha256_write(&hmac, rng->v, 32);
+        secp256k1_hmac_sha256_write(&hmac, zero, 1);
+        secp256k1_hmac_sha256_finalize(&hmac, rng->k);
+        secp256k1_hmac_sha256_initialize(&hmac, rng->k, 32);
+        secp256k1_hmac_sha256_write(&hmac, rng->v, 32);
+        secp256k1_hmac_sha256_finalize(&hmac, rng->v);
+    }
+
+    while (outlen > 0) {
+        secp256k1_hmac_sha256 hmac;
+        int now = outlen;
+        secp256k1_hmac_sha256_initialize(&hmac, rng->k, 32);
+        secp256k1_hmac_sha256_write(&hmac, rng->v, 32);
+        secp256k1_hmac_sha256_finalize(&hmac, rng->v);
+        if (now > 32) {
+            now = 32;
+        }
+        memcpy(out, rng->v, now);
+        out += now;
+        outlen -= now;
+    }
+
+    rng->retry = 1;
+}
+
+static void secp256k1_rfc6979_hmac_sha256_finalize(secp256k1_rfc6979_hmac_sha256 *rng) {
+    memset(rng->k, 0, 32);
+    memset(rng->v, 0, 32);
+    rng->retry = 0;
+}
+
+#undef BE32
+#undef Round
+#undef sigma1
+#undef sigma0
+#undef Sigma1
+#undef Sigma0
+#undef Maj
+#undef Ch
+
+#endif /* SECP256K1_HASH_IMPL_H */
diff --git a/depend/zcash/src/secp256k1/src/modules/ecdh/Makefile.am.include b/depend/zcash/src/secp256k1/src/modules/ecdh/Makefile.am.include
new file mode 100644
index 000000000..e3088b469
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/modules/ecdh/Makefile.am.include
@@ -0,0 +1,8 @@
+include_HEADERS += include/secp256k1_ecdh.h
+noinst_HEADERS += src/modules/ecdh/main_impl.h
+noinst_HEADERS += src/modules/ecdh/tests_impl.h
+if USE_BENCHMARK
+noinst_PROGRAMS += bench_ecdh
+bench_ecdh_SOURCES = src/bench_ecdh.c
+bench_ecdh_LDADD = libsecp256k1.la $(SECP_LIBS) $(COMMON_LIB)
+endif
diff --git a/depend/zcash/src/secp256k1/src/modules/ecdh/main_impl.h b/depend/zcash/src/secp256k1/src/modules/ecdh/main_impl.h
new file mode 100644
index 000000000..1ac67086b
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/modules/ecdh/main_impl.h
@@ -0,0 +1,71 @@
+/***********************************************************************
+ * Copyright (c) 2015 Andrew Poelstra                                  *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_MODULE_ECDH_MAIN_H
+#define SECP256K1_MODULE_ECDH_MAIN_H
+
+#include "include/secp256k1_ecdh.h"
+#include "ecmult_const_impl.h"
+
+static int ecdh_hash_function_sha256(unsigned char *output, const unsigned char *x32, const unsigned char *y32, void *data) {
+    unsigned char version = (y32[31] & 0x01) | 0x02;
+    secp256k1_sha256 sha;
+    (void)data;
+
+    secp256k1_sha256_initialize(&sha);
+    secp256k1_sha256_write(&sha, &version, 1);
+    secp256k1_sha256_write(&sha, x32, 32);
+    secp256k1_sha256_finalize(&sha, output);
+
+    return 1;
+}
+
+const secp256k1_ecdh_hash_function secp256k1_ecdh_hash_function_sha256 = ecdh_hash_function_sha256;
+const secp256k1_ecdh_hash_function secp256k1_ecdh_hash_function_default = ecdh_hash_function_sha256;
+
+int secp256k1_ecdh(const secp256k1_context* ctx, unsigned char *output, const secp256k1_pubkey *point, const unsigned char *scalar, secp256k1_ecdh_hash_function hashfp, void *data) {
+    int ret = 0;
+    int overflow = 0;
+    secp256k1_gej res;
+    secp256k1_ge pt;
+    secp256k1_scalar s;
+    unsigned char x[32];
+    unsigned char y[32];
+
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(output != NULL);
+    ARG_CHECK(point != NULL);
+    ARG_CHECK(scalar != NULL);
+
+    if (hashfp == NULL) {
+        hashfp = secp256k1_ecdh_hash_function_default;
+    }
+
+    secp256k1_pubkey_load(ctx, &pt, point);
+    secp256k1_scalar_set_b32(&s, scalar, &overflow);
+
+    overflow |= secp256k1_scalar_is_zero(&s);
+    secp256k1_scalar_cmov(&s, &secp256k1_scalar_one, overflow);
+
+    secp256k1_ecmult_const(&res, &pt, &s, 256);
+    secp256k1_ge_set_gej(&pt, &res);
+
+    /* Compute a hash of the point */
+    secp256k1_fe_normalize(&pt.x);
+    secp256k1_fe_normalize(&pt.y);
+    secp256k1_fe_get_b32(x, &pt.x);
+    secp256k1_fe_get_b32(y, &pt.y);
+
+    ret = hashfp(output, x, y, data);
+
+    memset(x, 0, 32);
+    memset(y, 0, 32);
+    secp256k1_scalar_clear(&s);
+
+    return !!ret & !overflow;
+}
+
+#endif /* SECP256K1_MODULE_ECDH_MAIN_H */
diff --git a/depend/zcash/src/secp256k1/src/modules/ecdh/tests_impl.h b/depend/zcash/src/secp256k1/src/modules/ecdh/tests_impl.h
new file mode 100644
index 000000000..be07447a4
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/modules/ecdh/tests_impl.h
@@ -0,0 +1,132 @@
+/***********************************************************************
+ * Copyright (c) 2015 Andrew Poelstra                                  *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_MODULE_ECDH_TESTS_H
+#define SECP256K1_MODULE_ECDH_TESTS_H
+
+int ecdh_hash_function_test_fail(unsigned char *output, const unsigned char *x, const unsigned char *y, void *data) {
+    (void)output;
+    (void)x;
+    (void)y;
+    (void)data;
+    return 0;
+}
+
+int ecdh_hash_function_custom(unsigned char *output, const unsigned char *x, const unsigned char *y, void *data) {
+    (void)data;
+    /* Save x and y as uncompressed public key */
+    output[0] = 0x04;
+    memcpy(output + 1, x, 32);
+    memcpy(output + 33, y, 32);
+    return 1;
+}
+
+void test_ecdh_api(void) {
+    /* Setup context that just counts errors */
+    secp256k1_context *tctx = secp256k1_context_create(SECP256K1_CONTEXT_SIGN);
+    secp256k1_pubkey point;
+    unsigned char res[32];
+    unsigned char s_one[32] = { 0 };
+    int32_t ecount = 0;
+    s_one[31] = 1;
+
+    secp256k1_context_set_error_callback(tctx, counting_illegal_callback_fn, &ecount);
+    secp256k1_context_set_illegal_callback(tctx, counting_illegal_callback_fn, &ecount);
+    CHECK(secp256k1_ec_pubkey_create(tctx, &point, s_one) == 1);
+
+    /* Check all NULLs are detected */
+    CHECK(secp256k1_ecdh(tctx, res, &point, s_one, NULL, NULL) == 1);
+    CHECK(ecount == 0);
+    CHECK(secp256k1_ecdh(tctx, NULL, &point, s_one, NULL, NULL) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_ecdh(tctx, res, NULL, s_one, NULL, NULL) == 0);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_ecdh(tctx, res, &point, NULL, NULL, NULL) == 0);
+    CHECK(ecount == 3);
+    CHECK(secp256k1_ecdh(tctx, res, &point, s_one, NULL, NULL) == 1);
+    CHECK(ecount == 3);
+
+    /* Cleanup */
+    secp256k1_context_destroy(tctx);
+}
+
+void test_ecdh_generator_basepoint(void) {
+    unsigned char s_one[32] = { 0 };
+    secp256k1_pubkey point[2];
+    int i;
+
+    s_one[31] = 1;
+    /* Check against pubkey creation when the basepoint is the generator */
+    for (i = 0; i < 100; ++i) {
+        secp256k1_sha256 sha;
+        unsigned char s_b32[32];
+        unsigned char output_ecdh[65];
+        unsigned char output_ser[32];
+        unsigned char point_ser[65];
+        size_t point_ser_len = sizeof(point_ser);
+        secp256k1_scalar s;
+
+        random_scalar_order(&s);
+        secp256k1_scalar_get_b32(s_b32, &s);
+
+        CHECK(secp256k1_ec_pubkey_create(ctx, &point[0], s_one) == 1);
+        CHECK(secp256k1_ec_pubkey_create(ctx, &point[1], s_b32) == 1);
+
+        /* compute using ECDH function with custom hash function */
+        CHECK(secp256k1_ecdh(ctx, output_ecdh, &point[0], s_b32, ecdh_hash_function_custom, NULL) == 1);
+        /* compute "explicitly" */
+        CHECK(secp256k1_ec_pubkey_serialize(ctx, point_ser, &point_ser_len, &point[1], SECP256K1_EC_UNCOMPRESSED) == 1);
+        /* compare */
+        CHECK(secp256k1_memcmp_var(output_ecdh, point_ser, 65) == 0);
+
+        /* compute using ECDH function with default hash function */
+        CHECK(secp256k1_ecdh(ctx, output_ecdh, &point[0], s_b32, NULL, NULL) == 1);
+        /* compute "explicitly" */
+        CHECK(secp256k1_ec_pubkey_serialize(ctx, point_ser, &point_ser_len, &point[1], SECP256K1_EC_COMPRESSED) == 1);
+        secp256k1_sha256_initialize(&sha);
+        secp256k1_sha256_write(&sha, point_ser, point_ser_len);
+        secp256k1_sha256_finalize(&sha, output_ser);
+        /* compare */
+        CHECK(secp256k1_memcmp_var(output_ecdh, output_ser, 32) == 0);
+    }
+}
+
+void test_bad_scalar(void) {
+    unsigned char s_zero[32] = { 0 };
+    unsigned char s_overflow[32] = {
+        0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+        0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xfe,
+        0xba, 0xae, 0xdc, 0xe6, 0xaf, 0x48, 0xa0, 0x3b,
+        0xbf, 0xd2, 0x5e, 0x8c, 0xd0, 0x36, 0x41, 0x41
+    };
+    unsigned char s_rand[32] = { 0 };
+    unsigned char output[32];
+    secp256k1_scalar rand;
+    secp256k1_pubkey point;
+
+    /* Create random point */
+    random_scalar_order(&rand);
+    secp256k1_scalar_get_b32(s_rand, &rand);
+    CHECK(secp256k1_ec_pubkey_create(ctx, &point, s_rand) == 1);
+
+    /* Try to multiply it by bad values */
+    CHECK(secp256k1_ecdh(ctx, output, &point, s_zero, NULL, NULL) == 0);
+    CHECK(secp256k1_ecdh(ctx, output, &point, s_overflow, NULL, NULL) == 0);
+    /* ...and a good one */
+    s_overflow[31] -= 1;
+    CHECK(secp256k1_ecdh(ctx, output, &point, s_overflow, NULL, NULL) == 1);
+
+    /* Hash function failure results in ecdh failure */
+    CHECK(secp256k1_ecdh(ctx, output, &point, s_overflow, ecdh_hash_function_test_fail, NULL) == 0);
+}
+
+void run_ecdh_tests(void) {
+    test_ecdh_api();
+    test_ecdh_generator_basepoint();
+    test_bad_scalar();
+}
+
+#endif /* SECP256K1_MODULE_ECDH_TESTS_H */
diff --git a/depend/zcash/src/secp256k1/src/modules/extrakeys/Makefile.am.include b/depend/zcash/src/secp256k1/src/modules/extrakeys/Makefile.am.include
new file mode 100644
index 000000000..0d901ec1f
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/modules/extrakeys/Makefile.am.include
@@ -0,0 +1,4 @@
+include_HEADERS += include/secp256k1_extrakeys.h
+noinst_HEADERS += src/modules/extrakeys/tests_impl.h
+noinst_HEADERS += src/modules/extrakeys/tests_exhaustive_impl.h
+noinst_HEADERS += src/modules/extrakeys/main_impl.h
diff --git a/depend/zcash/src/secp256k1/src/modules/extrakeys/main_impl.h b/depend/zcash/src/secp256k1/src/modules/extrakeys/main_impl.h
new file mode 100644
index 000000000..7390b2271
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/modules/extrakeys/main_impl.h
@@ -0,0 +1,261 @@
+/***********************************************************************
+ * Copyright (c) 2020 Jonas Nick                                       *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_MODULE_EXTRAKEYS_MAIN_H
+#define SECP256K1_MODULE_EXTRAKEYS_MAIN_H
+
+#include "include/secp256k1.h"
+#include "include/secp256k1_extrakeys.h"
+
+static SECP256K1_INLINE int secp256k1_xonly_pubkey_load(const secp256k1_context* ctx, secp256k1_ge *ge, const secp256k1_xonly_pubkey *pubkey) {
+    return secp256k1_pubkey_load(ctx, ge, (const secp256k1_pubkey *) pubkey);
+}
+
+static SECP256K1_INLINE void secp256k1_xonly_pubkey_save(secp256k1_xonly_pubkey *pubkey, secp256k1_ge *ge) {
+    secp256k1_pubkey_save((secp256k1_pubkey *) pubkey, ge);
+}
+
+int secp256k1_xonly_pubkey_parse(const secp256k1_context* ctx, secp256k1_xonly_pubkey *pubkey, const unsigned char *input32) {
+    secp256k1_ge pk;
+    secp256k1_fe x;
+
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(pubkey != NULL);
+    memset(pubkey, 0, sizeof(*pubkey));
+    ARG_CHECK(input32 != NULL);
+
+    if (!secp256k1_fe_set_b32(&x, input32)) {
+        return 0;
+    }
+    if (!secp256k1_ge_set_xo_var(&pk, &x, 0)) {
+        return 0;
+    }
+    if (!secp256k1_ge_is_in_correct_subgroup(&pk)) {
+        return 0;
+    }
+    secp256k1_xonly_pubkey_save(pubkey, &pk);
+    return 1;
+}
+
+int secp256k1_xonly_pubkey_serialize(const secp256k1_context* ctx, unsigned char *output32, const secp256k1_xonly_pubkey *pubkey) {
+    secp256k1_ge pk;
+
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(output32 != NULL);
+    memset(output32, 0, 32);
+    ARG_CHECK(pubkey != NULL);
+
+    if (!secp256k1_xonly_pubkey_load(ctx, &pk, pubkey)) {
+        return 0;
+    }
+    secp256k1_fe_get_b32(output32, &pk.x);
+    return 1;
+}
+
+/** Keeps a group element as is if it has an even Y and otherwise negates it.
+ *  y_parity is set to 0 in the former case and to 1 in the latter case.
+ *  Requires that the coordinates of r are normalized. */
+static int secp256k1_extrakeys_ge_even_y(secp256k1_ge *r) {
+    int y_parity = 0;
+    VERIFY_CHECK(!secp256k1_ge_is_infinity(r));
+
+    if (secp256k1_fe_is_odd(&r->y)) {
+        secp256k1_fe_negate(&r->y, &r->y, 1);
+        y_parity = 1;
+    }
+    return y_parity;
+}
+
+int secp256k1_xonly_pubkey_from_pubkey(const secp256k1_context* ctx, secp256k1_xonly_pubkey *xonly_pubkey, int *pk_parity, const secp256k1_pubkey *pubkey) {
+    secp256k1_ge pk;
+    int tmp;
+
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(xonly_pubkey != NULL);
+    ARG_CHECK(pubkey != NULL);
+
+    if (!secp256k1_pubkey_load(ctx, &pk, pubkey)) {
+        return 0;
+    }
+    tmp = secp256k1_extrakeys_ge_even_y(&pk);
+    if (pk_parity != NULL) {
+        *pk_parity = tmp;
+    }
+    secp256k1_xonly_pubkey_save(xonly_pubkey, &pk);
+    return 1;
+}
+
+int secp256k1_xonly_pubkey_tweak_add(const secp256k1_context* ctx, secp256k1_pubkey *output_pubkey, const secp256k1_xonly_pubkey *internal_pubkey, const unsigned char *tweak32) {
+    secp256k1_ge pk;
+
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(output_pubkey != NULL);
+    memset(output_pubkey, 0, sizeof(*output_pubkey));
+    ARG_CHECK(secp256k1_ecmult_context_is_built(&ctx->ecmult_ctx));
+    ARG_CHECK(internal_pubkey != NULL);
+    ARG_CHECK(tweak32 != NULL);
+
+    if (!secp256k1_xonly_pubkey_load(ctx, &pk, internal_pubkey)
+        || !secp256k1_ec_pubkey_tweak_add_helper(&ctx->ecmult_ctx, &pk, tweak32)) {
+        return 0;
+    }
+    secp256k1_pubkey_save(output_pubkey, &pk);
+    return 1;
+}
+
+int secp256k1_xonly_pubkey_tweak_add_check(const secp256k1_context* ctx, const unsigned char *tweaked_pubkey32, int tweaked_pk_parity, const secp256k1_xonly_pubkey *internal_pubkey, const unsigned char *tweak32) {
+    secp256k1_ge pk;
+    unsigned char pk_expected32[32];
+
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(secp256k1_ecmult_context_is_built(&ctx->ecmult_ctx));
+    ARG_CHECK(internal_pubkey != NULL);
+    ARG_CHECK(tweaked_pubkey32 != NULL);
+    ARG_CHECK(tweak32 != NULL);
+
+    if (!secp256k1_xonly_pubkey_load(ctx, &pk, internal_pubkey)
+        || !secp256k1_ec_pubkey_tweak_add_helper(&ctx->ecmult_ctx, &pk, tweak32)) {
+        return 0;
+    }
+    secp256k1_fe_normalize_var(&pk.x);
+    secp256k1_fe_normalize_var(&pk.y);
+    secp256k1_fe_get_b32(pk_expected32, &pk.x);
+
+    return secp256k1_memcmp_var(&pk_expected32, tweaked_pubkey32, 32) == 0
+            && secp256k1_fe_is_odd(&pk.y) == tweaked_pk_parity;
+}
+
+static void secp256k1_keypair_save(secp256k1_keypair *keypair, const secp256k1_scalar *sk, secp256k1_ge *pk) {
+    secp256k1_scalar_get_b32(&keypair->data[0], sk);
+    secp256k1_pubkey_save((secp256k1_pubkey *)&keypair->data[32], pk);
+}
+
+
+static int secp256k1_keypair_seckey_load(const secp256k1_context* ctx, secp256k1_scalar *sk, const secp256k1_keypair *keypair) {
+    int ret;
+
+    ret = secp256k1_scalar_set_b32_seckey(sk, &keypair->data[0]);
+    /* We can declassify ret here because sk is only zero if a keypair function
+     * failed (which zeroes the keypair) and its return value is ignored. */
+    secp256k1_declassify(ctx, &ret, sizeof(ret));
+    ARG_CHECK(ret);
+    return ret;
+}
+
+/* Load a keypair into pk and sk (if non-NULL). This function declassifies pk
+ * and ARG_CHECKs that the keypair is not invalid. It always initializes sk and
+ * pk with dummy values. */
+static int secp256k1_keypair_load(const secp256k1_context* ctx, secp256k1_scalar *sk, secp256k1_ge *pk, const secp256k1_keypair *keypair) {
+    int ret;
+    const secp256k1_pubkey *pubkey = (const secp256k1_pubkey *)&keypair->data[32];
+
+    /* Need to declassify the pubkey because pubkey_load ARG_CHECKs if it's
+     * invalid. */
+    secp256k1_declassify(ctx, pubkey, sizeof(*pubkey));
+    ret = secp256k1_pubkey_load(ctx, pk, pubkey);
+    if (sk != NULL) {
+        ret = ret && secp256k1_keypair_seckey_load(ctx, sk, keypair);
+    }
+    if (!ret) {
+        *pk = secp256k1_ge_const_g;
+        if (sk != NULL) {
+            *sk = secp256k1_scalar_one;
+        }
+    }
+    return ret;
+}
+
+int secp256k1_keypair_create(const secp256k1_context* ctx, secp256k1_keypair *keypair, const unsigned char *seckey32) {
+    secp256k1_scalar sk;
+    secp256k1_ge pk;
+    int ret = 0;
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(keypair != NULL);
+    memset(keypair, 0, sizeof(*keypair));
+    ARG_CHECK(secp256k1_ecmult_gen_context_is_built(&ctx->ecmult_gen_ctx));
+    ARG_CHECK(seckey32 != NULL);
+
+    ret = secp256k1_ec_pubkey_create_helper(&ctx->ecmult_gen_ctx, &sk, &pk, seckey32);
+    secp256k1_keypair_save(keypair, &sk, &pk);
+    secp256k1_memczero(keypair, sizeof(*keypair), !ret);
+
+    secp256k1_scalar_clear(&sk);
+    return ret;
+}
+
+int secp256k1_keypair_sec(const secp256k1_context* ctx, unsigned char *seckey, const secp256k1_keypair *keypair) {
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(seckey != NULL);
+    memset(seckey, 0, 32);
+    ARG_CHECK(keypair != NULL);
+
+    memcpy(seckey, &keypair->data[0], 32);
+    return 1;
+}
+
+int secp256k1_keypair_pub(const secp256k1_context* ctx, secp256k1_pubkey *pubkey, const secp256k1_keypair *keypair) {
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(pubkey != NULL);
+    memset(pubkey, 0, sizeof(*pubkey));
+    ARG_CHECK(keypair != NULL);
+
+    memcpy(pubkey->data, &keypair->data[32], sizeof(*pubkey));
+    return 1;
+}
+
+int secp256k1_keypair_xonly_pub(const secp256k1_context* ctx, secp256k1_xonly_pubkey *pubkey, int *pk_parity, const secp256k1_keypair *keypair) {
+    secp256k1_ge pk;
+    int tmp;
+
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(pubkey != NULL);
+    memset(pubkey, 0, sizeof(*pubkey));
+    ARG_CHECK(keypair != NULL);
+
+    if (!secp256k1_keypair_load(ctx, NULL, &pk, keypair)) {
+        return 0;
+    }
+    tmp = secp256k1_extrakeys_ge_even_y(&pk);
+    if (pk_parity != NULL) {
+        *pk_parity = tmp;
+    }
+    secp256k1_xonly_pubkey_save(pubkey, &pk);
+
+    return 1;
+}
+
+int secp256k1_keypair_xonly_tweak_add(const secp256k1_context* ctx, secp256k1_keypair *keypair, const unsigned char *tweak32) {
+    secp256k1_ge pk;
+    secp256k1_scalar sk;
+    int y_parity;
+    int ret;
+
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(secp256k1_ecmult_context_is_built(&ctx->ecmult_ctx));
+    ARG_CHECK(keypair != NULL);
+    ARG_CHECK(tweak32 != NULL);
+
+    ret = secp256k1_keypair_load(ctx, &sk, &pk, keypair);
+    memset(keypair, 0, sizeof(*keypair));
+
+    y_parity = secp256k1_extrakeys_ge_even_y(&pk);
+    if (y_parity == 1) {
+        secp256k1_scalar_negate(&sk, &sk);
+    }
+
+    ret &= secp256k1_ec_seckey_tweak_add_helper(&sk, tweak32);
+    ret &= secp256k1_ec_pubkey_tweak_add_helper(&ctx->ecmult_ctx, &pk, tweak32);
+
+    secp256k1_declassify(ctx, &ret, sizeof(ret));
+    if (ret) {
+        secp256k1_keypair_save(keypair, &sk, &pk);
+    }
+
+    secp256k1_scalar_clear(&sk);
+    return ret;
+}
+
+#endif
diff --git a/depend/zcash/src/secp256k1/src/modules/extrakeys/tests_exhaustive_impl.h b/depend/zcash/src/secp256k1/src/modules/extrakeys/tests_exhaustive_impl.h
new file mode 100644
index 000000000..0aca4fb72
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/modules/extrakeys/tests_exhaustive_impl.h
@@ -0,0 +1,68 @@
+/***********************************************************************
+ * Copyright (c) 2020 Pieter Wuille                                    *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_MODULE_EXTRAKEYS_TESTS_EXHAUSTIVE_H
+#define SECP256K1_MODULE_EXTRAKEYS_TESTS_EXHAUSTIVE_H
+
+#include "src/modules/extrakeys/main_impl.h"
+#include "include/secp256k1_extrakeys.h"
+
+static void test_exhaustive_extrakeys(const secp256k1_context *ctx, const secp256k1_ge* group) {
+    secp256k1_keypair keypair[EXHAUSTIVE_TEST_ORDER - 1];
+    secp256k1_pubkey pubkey[EXHAUSTIVE_TEST_ORDER - 1];
+    secp256k1_xonly_pubkey xonly_pubkey[EXHAUSTIVE_TEST_ORDER - 1];
+    int parities[EXHAUSTIVE_TEST_ORDER - 1];
+    unsigned char xonly_pubkey_bytes[EXHAUSTIVE_TEST_ORDER - 1][32];
+    int i;
+
+    for (i = 1; i < EXHAUSTIVE_TEST_ORDER; i++) {
+        secp256k1_fe fe;
+        secp256k1_scalar scalar_i;
+        unsigned char buf[33];
+        int parity;
+
+        secp256k1_scalar_set_int(&scalar_i, i);
+        secp256k1_scalar_get_b32(buf, &scalar_i);
+
+        /* Construct pubkey and keypair. */
+        CHECK(secp256k1_keypair_create(ctx, &keypair[i - 1], buf));
+        CHECK(secp256k1_ec_pubkey_create(ctx, &pubkey[i - 1], buf));
+
+        /* Construct serialized xonly_pubkey from keypair. */
+        CHECK(secp256k1_keypair_xonly_pub(ctx, &xonly_pubkey[i - 1], &parities[i - 1], &keypair[i - 1]));
+        CHECK(secp256k1_xonly_pubkey_serialize(ctx, xonly_pubkey_bytes[i - 1], &xonly_pubkey[i - 1]));
+
+        /* Parse the xonly_pubkey back and verify it matches the previously serialized value. */
+        CHECK(secp256k1_xonly_pubkey_parse(ctx, &xonly_pubkey[i - 1], xonly_pubkey_bytes[i - 1]));
+        CHECK(secp256k1_xonly_pubkey_serialize(ctx, buf, &xonly_pubkey[i - 1]));
+        CHECK(secp256k1_memcmp_var(xonly_pubkey_bytes[i - 1], buf, 32) == 0);
+
+        /* Construct the xonly_pubkey from the pubkey, and verify it matches the same. */
+        CHECK(secp256k1_xonly_pubkey_from_pubkey(ctx, &xonly_pubkey[i - 1], &parity, &pubkey[i - 1]));
+        CHECK(parity == parities[i - 1]);
+        CHECK(secp256k1_xonly_pubkey_serialize(ctx, buf, &xonly_pubkey[i - 1]));
+        CHECK(secp256k1_memcmp_var(xonly_pubkey_bytes[i - 1], buf, 32) == 0);
+
+        /* Compare the xonly_pubkey bytes against the precomputed group. */
+        secp256k1_fe_set_b32(&fe, xonly_pubkey_bytes[i - 1]);
+        CHECK(secp256k1_fe_equal_var(&fe, &group[i].x));
+
+        /* Check the parity against the precomputed group. */
+        fe = group[i].y;
+        secp256k1_fe_normalize_var(&fe);
+        CHECK(secp256k1_fe_is_odd(&fe) == parities[i - 1]);
+
+        /* Verify that the higher half is identical to the lower half mirrored. */
+        if (i > EXHAUSTIVE_TEST_ORDER / 2) {
+            CHECK(secp256k1_memcmp_var(xonly_pubkey_bytes[i - 1], xonly_pubkey_bytes[EXHAUSTIVE_TEST_ORDER - i - 1], 32) == 0);
+            CHECK(parities[i - 1] == 1 - parities[EXHAUSTIVE_TEST_ORDER - i - 1]);
+        }
+    }
+
+    /* TODO: keypair/xonly_pubkey tweak tests */
+}
+
+#endif
diff --git a/depend/zcash/src/secp256k1/src/modules/extrakeys/tests_impl.h b/depend/zcash/src/secp256k1/src/modules/extrakeys/tests_impl.h
new file mode 100644
index 000000000..9473a7dd4
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/modules/extrakeys/tests_impl.h
@@ -0,0 +1,549 @@
+/***********************************************************************
+ * Copyright (c) 2020 Jonas Nick                                       *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_MODULE_EXTRAKEYS_TESTS_H
+#define SECP256K1_MODULE_EXTRAKEYS_TESTS_H
+
+#include "secp256k1_extrakeys.h"
+
+static secp256k1_context* api_test_context(int flags, int *ecount) {
+    secp256k1_context *ctx0 = secp256k1_context_create(flags);
+    secp256k1_context_set_error_callback(ctx0, counting_illegal_callback_fn, ecount);
+    secp256k1_context_set_illegal_callback(ctx0, counting_illegal_callback_fn, ecount);
+    return ctx0;
+}
+
+void test_xonly_pubkey(void) {
+    secp256k1_pubkey pk;
+    secp256k1_xonly_pubkey xonly_pk, xonly_pk_tmp;
+    secp256k1_ge pk1;
+    secp256k1_ge pk2;
+    secp256k1_fe y;
+    unsigned char sk[32];
+    unsigned char xy_sk[32];
+    unsigned char buf32[32];
+    unsigned char ones32[32];
+    unsigned char zeros64[64] = { 0 };
+    int pk_parity;
+    int i;
+
+    int ecount;
+    secp256k1_context *none = api_test_context(SECP256K1_CONTEXT_NONE, &ecount);
+    secp256k1_context *sign = api_test_context(SECP256K1_CONTEXT_SIGN, &ecount);
+    secp256k1_context *verify = api_test_context(SECP256K1_CONTEXT_VERIFY, &ecount);
+
+    secp256k1_testrand256(sk);
+    memset(ones32, 0xFF, 32);
+    secp256k1_testrand256(xy_sk);
+    CHECK(secp256k1_ec_pubkey_create(sign, &pk, sk) == 1);
+    CHECK(secp256k1_xonly_pubkey_from_pubkey(none, &xonly_pk, &pk_parity, &pk) == 1);
+
+    /* Test xonly_pubkey_from_pubkey */
+    ecount = 0;
+    CHECK(secp256k1_xonly_pubkey_from_pubkey(none, &xonly_pk, &pk_parity, &pk) == 1);
+    CHECK(secp256k1_xonly_pubkey_from_pubkey(sign, &xonly_pk, &pk_parity, &pk) == 1);
+    CHECK(secp256k1_xonly_pubkey_from_pubkey(verify, &xonly_pk, &pk_parity, &pk) == 1);
+    CHECK(secp256k1_xonly_pubkey_from_pubkey(none, NULL, &pk_parity, &pk) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_xonly_pubkey_from_pubkey(none, &xonly_pk, NULL, &pk) == 1);
+    CHECK(secp256k1_xonly_pubkey_from_pubkey(none, &xonly_pk, &pk_parity, NULL) == 0);
+    CHECK(ecount == 2);
+    memset(&pk, 0, sizeof(pk));
+    CHECK(secp256k1_xonly_pubkey_from_pubkey(none, &xonly_pk, &pk_parity, &pk) == 0);
+    CHECK(ecount == 3);
+
+    /* Choose a secret key such that the resulting pubkey and xonly_pubkey match. */
+    memset(sk, 0, sizeof(sk));
+    sk[0] = 1;
+    CHECK(secp256k1_ec_pubkey_create(ctx, &pk, sk) == 1);
+    CHECK(secp256k1_xonly_pubkey_from_pubkey(ctx, &xonly_pk, &pk_parity, &pk) == 1);
+    CHECK(secp256k1_memcmp_var(&pk, &xonly_pk, sizeof(pk)) == 0);
+    CHECK(pk_parity == 0);
+
+    /* Choose a secret key such that pubkey and xonly_pubkey are each others
+     * negation. */
+    sk[0] = 2;
+    CHECK(secp256k1_ec_pubkey_create(ctx, &pk, sk) == 1);
+    CHECK(secp256k1_xonly_pubkey_from_pubkey(ctx, &xonly_pk, &pk_parity, &pk) == 1);
+    CHECK(secp256k1_memcmp_var(&xonly_pk, &pk, sizeof(xonly_pk)) != 0);
+    CHECK(pk_parity == 1);
+    secp256k1_pubkey_load(ctx, &pk1, &pk);
+    secp256k1_pubkey_load(ctx, &pk2, (secp256k1_pubkey *) &xonly_pk);
+    CHECK(secp256k1_fe_equal(&pk1.x, &pk2.x) == 1);
+    secp256k1_fe_negate(&y, &pk2.y, 1);
+    CHECK(secp256k1_fe_equal(&pk1.y, &y) == 1);
+
+    /* Test xonly_pubkey_serialize and xonly_pubkey_parse */
+    ecount = 0;
+    CHECK(secp256k1_xonly_pubkey_serialize(none, NULL, &xonly_pk) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_xonly_pubkey_serialize(none, buf32, NULL) == 0);
+    CHECK(secp256k1_memcmp_var(buf32, zeros64, 32) == 0);
+    CHECK(ecount == 2);
+    {
+        /* A pubkey filled with 0s will fail to serialize due to pubkey_load
+         * special casing. */
+        secp256k1_xonly_pubkey pk_tmp;
+        memset(&pk_tmp, 0, sizeof(pk_tmp));
+        CHECK(secp256k1_xonly_pubkey_serialize(none, buf32, &pk_tmp) == 0);
+    }
+    /* pubkey_load called illegal callback */
+    CHECK(ecount == 3);
+
+    CHECK(secp256k1_xonly_pubkey_serialize(none, buf32, &xonly_pk) == 1);
+    ecount = 0;
+    CHECK(secp256k1_xonly_pubkey_parse(none, NULL, buf32) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_xonly_pubkey_parse(none, &xonly_pk, NULL) == 0);
+    CHECK(ecount == 2);
+
+    /* Serialization and parse roundtrip */
+    CHECK(secp256k1_xonly_pubkey_from_pubkey(none, &xonly_pk, NULL, &pk) == 1);
+    CHECK(secp256k1_xonly_pubkey_serialize(ctx, buf32, &xonly_pk) == 1);
+    CHECK(secp256k1_xonly_pubkey_parse(ctx, &xonly_pk_tmp, buf32) == 1);
+    CHECK(secp256k1_memcmp_var(&xonly_pk, &xonly_pk_tmp, sizeof(xonly_pk)) == 0);
+
+    /* Test parsing invalid field elements */
+    memset(&xonly_pk, 1, sizeof(xonly_pk));
+    /* Overflowing field element */
+    CHECK(secp256k1_xonly_pubkey_parse(none, &xonly_pk, ones32) == 0);
+    CHECK(secp256k1_memcmp_var(&xonly_pk, zeros64, sizeof(xonly_pk)) == 0);
+    memset(&xonly_pk, 1, sizeof(xonly_pk));
+    /* There's no point with x-coordinate 0 on secp256k1 */
+    CHECK(secp256k1_xonly_pubkey_parse(none, &xonly_pk, zeros64) == 0);
+    CHECK(secp256k1_memcmp_var(&xonly_pk, zeros64, sizeof(xonly_pk)) == 0);
+    /* If a random 32-byte string can not be parsed with ec_pubkey_parse
+     * (because interpreted as X coordinate it does not correspond to a point on
+     * the curve) then xonly_pubkey_parse should fail as well. */
+    for (i = 0; i < count; i++) {
+        unsigned char rand33[33];
+        secp256k1_testrand256(&rand33[1]);
+        rand33[0] = SECP256K1_TAG_PUBKEY_EVEN;
+        if (!secp256k1_ec_pubkey_parse(ctx, &pk, rand33, 33)) {
+            memset(&xonly_pk, 1, sizeof(xonly_pk));
+            CHECK(secp256k1_xonly_pubkey_parse(ctx, &xonly_pk, &rand33[1]) == 0);
+            CHECK(secp256k1_memcmp_var(&xonly_pk, zeros64, sizeof(xonly_pk)) == 0);
+        } else {
+            CHECK(secp256k1_xonly_pubkey_parse(ctx, &xonly_pk, &rand33[1]) == 1);
+        }
+    }
+    CHECK(ecount == 2);
+
+    secp256k1_context_destroy(none);
+    secp256k1_context_destroy(sign);
+    secp256k1_context_destroy(verify);
+}
+
+void test_xonly_pubkey_tweak(void) {
+    unsigned char zeros64[64] = { 0 };
+    unsigned char overflows[32];
+    unsigned char sk[32];
+    secp256k1_pubkey internal_pk;
+    secp256k1_xonly_pubkey internal_xonly_pk;
+    secp256k1_pubkey output_pk;
+    int pk_parity;
+    unsigned char tweak[32];
+    int i;
+
+    int ecount;
+    secp256k1_context *none = api_test_context(SECP256K1_CONTEXT_NONE, &ecount);
+    secp256k1_context *sign = api_test_context(SECP256K1_CONTEXT_SIGN, &ecount);
+    secp256k1_context *verify = api_test_context(SECP256K1_CONTEXT_VERIFY, &ecount);
+
+    memset(overflows, 0xff, sizeof(overflows));
+    secp256k1_testrand256(tweak);
+    secp256k1_testrand256(sk);
+    CHECK(secp256k1_ec_pubkey_create(ctx, &internal_pk, sk) == 1);
+    CHECK(secp256k1_xonly_pubkey_from_pubkey(none, &internal_xonly_pk, &pk_parity, &internal_pk) == 1);
+
+    ecount = 0;
+    CHECK(secp256k1_xonly_pubkey_tweak_add(none, &output_pk, &internal_xonly_pk, tweak) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_xonly_pubkey_tweak_add(sign, &output_pk, &internal_xonly_pk, tweak) == 0);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_xonly_pubkey_tweak_add(verify, &output_pk, &internal_xonly_pk, tweak) == 1);
+    CHECK(secp256k1_xonly_pubkey_tweak_add(verify, NULL, &internal_xonly_pk, tweak) == 0);
+    CHECK(ecount == 3);
+    CHECK(secp256k1_xonly_pubkey_tweak_add(verify, &output_pk, NULL, tweak) == 0);
+    CHECK(ecount == 4);
+    /* NULL internal_xonly_pk zeroes the output_pk */
+    CHECK(secp256k1_memcmp_var(&output_pk, zeros64, sizeof(output_pk)) == 0);
+    CHECK(secp256k1_xonly_pubkey_tweak_add(verify, &output_pk, &internal_xonly_pk, NULL) == 0);
+    CHECK(ecount == 5);
+    /* NULL tweak zeroes the output_pk */
+    CHECK(secp256k1_memcmp_var(&output_pk, zeros64, sizeof(output_pk)) == 0);
+
+    /* Invalid tweak zeroes the output_pk */
+    CHECK(secp256k1_xonly_pubkey_tweak_add(verify, &output_pk, &internal_xonly_pk, overflows) == 0);
+    CHECK(secp256k1_memcmp_var(&output_pk, zeros64, sizeof(output_pk))  == 0);
+
+    /* A zero tweak is fine */
+    CHECK(secp256k1_xonly_pubkey_tweak_add(verify, &output_pk, &internal_xonly_pk, zeros64) == 1);
+
+    /* Fails if the resulting key was infinity */
+    for (i = 0; i < count; i++) {
+        secp256k1_scalar scalar_tweak;
+        /* Because sk may be negated before adding, we need to try with tweak =
+         * sk as well as tweak = -sk. */
+        secp256k1_scalar_set_b32(&scalar_tweak, sk, NULL);
+        secp256k1_scalar_negate(&scalar_tweak, &scalar_tweak);
+        secp256k1_scalar_get_b32(tweak, &scalar_tweak);
+        CHECK((secp256k1_xonly_pubkey_tweak_add(verify, &output_pk, &internal_xonly_pk, sk) == 0)
+              || (secp256k1_xonly_pubkey_tweak_add(verify, &output_pk, &internal_xonly_pk, tweak) == 0));
+        CHECK(secp256k1_memcmp_var(&output_pk, zeros64, sizeof(output_pk)) == 0);
+    }
+
+    /* Invalid pk with a valid tweak */
+    memset(&internal_xonly_pk, 0, sizeof(internal_xonly_pk));
+    secp256k1_testrand256(tweak);
+    ecount = 0;
+    CHECK(secp256k1_xonly_pubkey_tweak_add(verify, &output_pk, &internal_xonly_pk, tweak) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_memcmp_var(&output_pk, zeros64, sizeof(output_pk))  == 0);
+
+    secp256k1_context_destroy(none);
+    secp256k1_context_destroy(sign);
+    secp256k1_context_destroy(verify);
+}
+
+void test_xonly_pubkey_tweak_check(void) {
+    unsigned char zeros64[64] = { 0 };
+    unsigned char overflows[32];
+    unsigned char sk[32];
+    secp256k1_pubkey internal_pk;
+    secp256k1_xonly_pubkey internal_xonly_pk;
+    secp256k1_pubkey output_pk;
+    secp256k1_xonly_pubkey output_xonly_pk;
+    unsigned char output_pk32[32];
+    unsigned char buf32[32];
+    int pk_parity;
+    unsigned char tweak[32];
+
+    int ecount;
+    secp256k1_context *none = api_test_context(SECP256K1_CONTEXT_NONE, &ecount);
+    secp256k1_context *sign = api_test_context(SECP256K1_CONTEXT_SIGN, &ecount);
+    secp256k1_context *verify = api_test_context(SECP256K1_CONTEXT_VERIFY, &ecount);
+
+    memset(overflows, 0xff, sizeof(overflows));
+    secp256k1_testrand256(tweak);
+    secp256k1_testrand256(sk);
+    CHECK(secp256k1_ec_pubkey_create(ctx, &internal_pk, sk) == 1);
+    CHECK(secp256k1_xonly_pubkey_from_pubkey(none, &internal_xonly_pk, &pk_parity, &internal_pk) == 1);
+
+    ecount = 0;
+    CHECK(secp256k1_xonly_pubkey_tweak_add(verify, &output_pk, &internal_xonly_pk, tweak) == 1);
+    CHECK(secp256k1_xonly_pubkey_from_pubkey(verify, &output_xonly_pk, &pk_parity, &output_pk) == 1);
+    CHECK(secp256k1_xonly_pubkey_serialize(ctx, buf32, &output_xonly_pk) == 1);
+    CHECK(secp256k1_xonly_pubkey_tweak_add_check(none, buf32, pk_parity, &internal_xonly_pk, tweak) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_xonly_pubkey_tweak_add_check(sign, buf32, pk_parity, &internal_xonly_pk, tweak) == 0);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_xonly_pubkey_tweak_add_check(verify, buf32, pk_parity, &internal_xonly_pk, tweak) == 1);
+    CHECK(secp256k1_xonly_pubkey_tweak_add_check(verify, NULL, pk_parity, &internal_xonly_pk, tweak) == 0);
+    CHECK(ecount == 3);
+    /* invalid pk_parity value */
+    CHECK(secp256k1_xonly_pubkey_tweak_add_check(verify, buf32, 2, &internal_xonly_pk, tweak) == 0);
+    CHECK(ecount == 3);
+    CHECK(secp256k1_xonly_pubkey_tweak_add_check(verify, buf32, pk_parity, NULL, tweak) == 0);
+    CHECK(ecount == 4);
+    CHECK(secp256k1_xonly_pubkey_tweak_add_check(verify, buf32, pk_parity, &internal_xonly_pk, NULL) == 0);
+    CHECK(ecount == 5);
+
+    memset(tweak, 1, sizeof(tweak));
+    CHECK(secp256k1_xonly_pubkey_from_pubkey(ctx, &internal_xonly_pk, NULL, &internal_pk) == 1);
+    CHECK(secp256k1_xonly_pubkey_tweak_add(ctx, &output_pk, &internal_xonly_pk, tweak) == 1);
+    CHECK(secp256k1_xonly_pubkey_from_pubkey(ctx, &output_xonly_pk, &pk_parity, &output_pk) == 1);
+    CHECK(secp256k1_xonly_pubkey_serialize(ctx, output_pk32, &output_xonly_pk) == 1);
+    CHECK(secp256k1_xonly_pubkey_tweak_add_check(ctx, output_pk32, pk_parity, &internal_xonly_pk, tweak) == 1);
+
+    /* Wrong pk_parity */
+    CHECK(secp256k1_xonly_pubkey_tweak_add_check(ctx, output_pk32, !pk_parity, &internal_xonly_pk, tweak) == 0);
+    /* Wrong public key */
+    CHECK(secp256k1_xonly_pubkey_serialize(ctx, buf32, &internal_xonly_pk) == 1);
+    CHECK(secp256k1_xonly_pubkey_tweak_add_check(ctx, buf32, pk_parity, &internal_xonly_pk, tweak) == 0);
+
+    /* Overflowing tweak not allowed */
+    CHECK(secp256k1_xonly_pubkey_tweak_add_check(ctx, output_pk32, pk_parity, &internal_xonly_pk, overflows) == 0);
+    CHECK(secp256k1_xonly_pubkey_tweak_add(ctx, &output_pk, &internal_xonly_pk, overflows) == 0);
+    CHECK(secp256k1_memcmp_var(&output_pk, zeros64, sizeof(output_pk)) == 0);
+    CHECK(ecount == 5);
+
+    secp256k1_context_destroy(none);
+    secp256k1_context_destroy(sign);
+    secp256k1_context_destroy(verify);
+}
+
+/* Starts with an initial pubkey and recursively creates N_PUBKEYS - 1
+ * additional pubkeys by calling tweak_add. Then verifies every tweak starting
+ * from the last pubkey. */
+#define N_PUBKEYS 32
+void test_xonly_pubkey_tweak_recursive(void) {
+    unsigned char sk[32];
+    secp256k1_pubkey pk[N_PUBKEYS];
+    unsigned char pk_serialized[32];
+    unsigned char tweak[N_PUBKEYS - 1][32];
+    int i;
+
+    secp256k1_testrand256(sk);
+    CHECK(secp256k1_ec_pubkey_create(ctx, &pk[0], sk) == 1);
+    /* Add tweaks */
+    for (i = 0; i < N_PUBKEYS - 1; i++) {
+        secp256k1_xonly_pubkey xonly_pk;
+        memset(tweak[i], i + 1, sizeof(tweak[i]));
+        CHECK(secp256k1_xonly_pubkey_from_pubkey(ctx, &xonly_pk, NULL, &pk[i]) == 1);
+        CHECK(secp256k1_xonly_pubkey_tweak_add(ctx, &pk[i + 1], &xonly_pk, tweak[i]) == 1);
+    }
+
+    /* Verify tweaks */
+    for (i = N_PUBKEYS - 1; i > 0; i--) {
+        secp256k1_xonly_pubkey xonly_pk;
+        int pk_parity;
+        CHECK(secp256k1_xonly_pubkey_from_pubkey(ctx, &xonly_pk, &pk_parity, &pk[i]) == 1);
+        CHECK(secp256k1_xonly_pubkey_serialize(ctx, pk_serialized, &xonly_pk) == 1);
+        CHECK(secp256k1_xonly_pubkey_from_pubkey(ctx, &xonly_pk, NULL, &pk[i - 1]) == 1);
+        CHECK(secp256k1_xonly_pubkey_tweak_add_check(ctx, pk_serialized, pk_parity, &xonly_pk, tweak[i - 1]) == 1);
+    }
+}
+#undef N_PUBKEYS
+
+void test_keypair(void) {
+    unsigned char sk[32];
+    unsigned char sk_tmp[32];
+    unsigned char zeros96[96] = { 0 };
+    unsigned char overflows[32];
+    secp256k1_keypair keypair;
+    secp256k1_pubkey pk, pk_tmp;
+    secp256k1_xonly_pubkey xonly_pk, xonly_pk_tmp;
+    int pk_parity, pk_parity_tmp;
+    int ecount;
+    secp256k1_context *none = api_test_context(SECP256K1_CONTEXT_NONE, &ecount);
+    secp256k1_context *sign = api_test_context(SECP256K1_CONTEXT_SIGN, &ecount);
+    secp256k1_context *verify = api_test_context(SECP256K1_CONTEXT_VERIFY, &ecount);
+
+    CHECK(sizeof(zeros96) == sizeof(keypair));
+    memset(overflows, 0xFF, sizeof(overflows));
+
+    /* Test keypair_create */
+    ecount = 0;
+    secp256k1_testrand256(sk);
+    CHECK(secp256k1_keypair_create(none, &keypair, sk) == 0);
+    CHECK(secp256k1_memcmp_var(zeros96, &keypair, sizeof(keypair)) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_keypair_create(verify, &keypair, sk) == 0);
+    CHECK(secp256k1_memcmp_var(zeros96, &keypair, sizeof(keypair)) == 0);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_keypair_create(sign, &keypair, sk) == 1);
+    CHECK(secp256k1_keypair_create(sign, NULL, sk) == 0);
+    CHECK(ecount == 3);
+    CHECK(secp256k1_keypair_create(sign, &keypair, NULL) == 0);
+    CHECK(secp256k1_memcmp_var(zeros96, &keypair, sizeof(keypair)) == 0);
+    CHECK(ecount == 4);
+
+    /* Invalid secret key */
+    CHECK(secp256k1_keypair_create(sign, &keypair, zeros96) == 0);
+    CHECK(secp256k1_memcmp_var(zeros96, &keypair, sizeof(keypair)) == 0);
+    CHECK(secp256k1_keypair_create(sign, &keypair, overflows) == 0);
+    CHECK(secp256k1_memcmp_var(zeros96, &keypair, sizeof(keypair)) == 0);
+
+    /* Test keypair_pub */
+    ecount = 0;
+    secp256k1_testrand256(sk);
+    CHECK(secp256k1_keypair_create(ctx, &keypair, sk) == 1);
+    CHECK(secp256k1_keypair_pub(none, &pk, &keypair) == 1);
+    CHECK(secp256k1_keypair_pub(none, NULL, &keypair) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_keypair_pub(none, &pk, NULL) == 0);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_memcmp_var(zeros96, &pk, sizeof(pk)) == 0);
+
+    /* Using an invalid keypair is fine for keypair_pub */
+    memset(&keypair, 0, sizeof(keypair));
+    CHECK(secp256k1_keypair_pub(none, &pk, &keypair) == 1);
+    CHECK(secp256k1_memcmp_var(zeros96, &pk, sizeof(pk)) == 0);
+
+    /* keypair holds the same pubkey as pubkey_create */
+    CHECK(secp256k1_ec_pubkey_create(sign, &pk, sk) == 1);
+    CHECK(secp256k1_keypair_create(sign, &keypair, sk) == 1);
+    CHECK(secp256k1_keypair_pub(none, &pk_tmp, &keypair) == 1);
+    CHECK(secp256k1_memcmp_var(&pk, &pk_tmp, sizeof(pk)) == 0);
+
+    /** Test keypair_xonly_pub **/
+    ecount = 0;
+    secp256k1_testrand256(sk);
+    CHECK(secp256k1_keypair_create(ctx, &keypair, sk) == 1);
+    CHECK(secp256k1_keypair_xonly_pub(none, &xonly_pk, &pk_parity, &keypair) == 1);
+    CHECK(secp256k1_keypair_xonly_pub(none, NULL, &pk_parity, &keypair) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_keypair_xonly_pub(none, &xonly_pk, NULL, &keypair) == 1);
+    CHECK(secp256k1_keypair_xonly_pub(none, &xonly_pk, &pk_parity, NULL) == 0);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_memcmp_var(zeros96, &xonly_pk, sizeof(xonly_pk)) == 0);
+    /* Using an invalid keypair will set the xonly_pk to 0 (first reset
+     * xonly_pk). */
+    CHECK(secp256k1_keypair_xonly_pub(none, &xonly_pk, &pk_parity, &keypair) == 1);
+    memset(&keypair, 0, sizeof(keypair));
+    CHECK(secp256k1_keypair_xonly_pub(none, &xonly_pk, &pk_parity, &keypair) == 0);
+    CHECK(secp256k1_memcmp_var(zeros96, &xonly_pk, sizeof(xonly_pk)) == 0);
+    CHECK(ecount == 3);
+
+    /** keypair holds the same xonly pubkey as pubkey_create **/
+    CHECK(secp256k1_ec_pubkey_create(sign, &pk, sk) == 1);
+    CHECK(secp256k1_xonly_pubkey_from_pubkey(none, &xonly_pk, &pk_parity, &pk) == 1);
+    CHECK(secp256k1_keypair_create(sign, &keypair, sk) == 1);
+    CHECK(secp256k1_keypair_xonly_pub(none, &xonly_pk_tmp, &pk_parity_tmp, &keypair) == 1);
+    CHECK(secp256k1_memcmp_var(&xonly_pk, &xonly_pk_tmp, sizeof(pk)) == 0);
+    CHECK(pk_parity == pk_parity_tmp);
+
+    /* Test keypair_seckey */
+    ecount = 0;
+    secp256k1_testrand256(sk);
+    CHECK(secp256k1_keypair_create(ctx, &keypair, sk) == 1);
+    CHECK(secp256k1_keypair_sec(none, sk_tmp, &keypair) == 1);
+    CHECK(secp256k1_keypair_sec(none, NULL, &keypair) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_keypair_sec(none, sk_tmp, NULL) == 0);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_memcmp_var(zeros96, sk_tmp, sizeof(sk_tmp)) == 0);
+
+    /* keypair returns the same seckey it got */
+    CHECK(secp256k1_keypair_create(sign, &keypair, sk) == 1);
+    CHECK(secp256k1_keypair_sec(none, sk_tmp, &keypair) == 1);
+    CHECK(secp256k1_memcmp_var(sk, sk_tmp, sizeof(sk_tmp)) == 0);
+
+
+    /* Using an invalid keypair is fine for keypair_seckey */
+    memset(&keypair, 0, sizeof(keypair));
+    CHECK(secp256k1_keypair_sec(none, sk_tmp, &keypair) == 1);
+    CHECK(secp256k1_memcmp_var(zeros96, sk_tmp, sizeof(sk_tmp)) == 0);
+
+    secp256k1_context_destroy(none);
+    secp256k1_context_destroy(sign);
+    secp256k1_context_destroy(verify);
+}
+
+void test_keypair_add(void) {
+    unsigned char sk[32];
+    secp256k1_keypair keypair;
+    unsigned char overflows[32];
+    unsigned char zeros96[96] = { 0 };
+    unsigned char tweak[32];
+    int i;
+    int ecount = 0;
+    secp256k1_context *none = api_test_context(SECP256K1_CONTEXT_NONE, &ecount);
+    secp256k1_context *sign = api_test_context(SECP256K1_CONTEXT_SIGN, &ecount);
+    secp256k1_context *verify = api_test_context(SECP256K1_CONTEXT_VERIFY, &ecount);
+
+    CHECK(sizeof(zeros96) == sizeof(keypair));
+    secp256k1_testrand256(sk);
+    secp256k1_testrand256(tweak);
+    memset(overflows, 0xFF, 32);
+    CHECK(secp256k1_keypair_create(ctx, &keypair, sk) == 1);
+
+    CHECK(secp256k1_keypair_xonly_tweak_add(none, &keypair, tweak) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_keypair_xonly_tweak_add(sign, &keypair, tweak) == 0);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_keypair_xonly_tweak_add(verify, &keypair, tweak) == 1);
+    CHECK(secp256k1_keypair_xonly_tweak_add(verify, NULL, tweak) == 0);
+    CHECK(ecount == 3);
+    CHECK(secp256k1_keypair_xonly_tweak_add(verify, &keypair, NULL) == 0);
+    CHECK(ecount == 4);
+    /* This does not set the keypair to zeroes */
+    CHECK(secp256k1_memcmp_var(&keypair, zeros96, sizeof(keypair)) != 0);
+
+    /* Invalid tweak zeroes the keypair */
+    CHECK(secp256k1_keypair_create(ctx, &keypair, sk) == 1);
+    CHECK(secp256k1_keypair_xonly_tweak_add(ctx, &keypair, overflows) == 0);
+    CHECK(secp256k1_memcmp_var(&keypair, zeros96, sizeof(keypair))  == 0);
+
+    /* A zero tweak is fine */
+    CHECK(secp256k1_keypair_create(ctx, &keypair, sk) == 1);
+    CHECK(secp256k1_keypair_xonly_tweak_add(ctx, &keypair, zeros96) == 1);
+
+    /* Fails if the resulting keypair was (sk=0, pk=infinity) */
+    for (i = 0; i < count; i++) {
+        secp256k1_scalar scalar_tweak;
+        secp256k1_keypair keypair_tmp;
+        secp256k1_testrand256(sk);
+        CHECK(secp256k1_keypair_create(ctx, &keypair, sk) == 1);
+        memcpy(&keypair_tmp, &keypair, sizeof(keypair));
+        /* Because sk may be negated before adding, we need to try with tweak =
+         * sk as well as tweak = -sk. */
+        secp256k1_scalar_set_b32(&scalar_tweak, sk, NULL);
+        secp256k1_scalar_negate(&scalar_tweak, &scalar_tweak);
+        secp256k1_scalar_get_b32(tweak, &scalar_tweak);
+        CHECK((secp256k1_keypair_xonly_tweak_add(ctx, &keypair, sk) == 0)
+              || (secp256k1_keypair_xonly_tweak_add(ctx, &keypair_tmp, tweak) == 0));
+        CHECK(secp256k1_memcmp_var(&keypair, zeros96, sizeof(keypair)) == 0
+              || secp256k1_memcmp_var(&keypair_tmp, zeros96, sizeof(keypair_tmp)) == 0);
+    }
+
+    /* Invalid keypair with a valid tweak */
+    memset(&keypair, 0, sizeof(keypair));
+    secp256k1_testrand256(tweak);
+    ecount = 0;
+    CHECK(secp256k1_keypair_xonly_tweak_add(verify, &keypair, tweak) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_memcmp_var(&keypair, zeros96, sizeof(keypair))  == 0);
+    /* Only seckey part of keypair invalid */
+    CHECK(secp256k1_keypair_create(ctx, &keypair, sk) == 1);
+    memset(&keypair, 0, 32);
+    CHECK(secp256k1_keypair_xonly_tweak_add(verify, &keypair, tweak) == 0);
+    CHECK(ecount == 2);
+    /* Only pubkey part of keypair invalid */
+    CHECK(secp256k1_keypair_create(ctx, &keypair, sk) == 1);
+    memset(&keypair.data[32], 0, 64);
+    CHECK(secp256k1_keypair_xonly_tweak_add(verify, &keypair, tweak) == 0);
+    CHECK(ecount == 3);
+
+    /* Check that the keypair_tweak_add implementation is correct */
+    CHECK(secp256k1_keypair_create(ctx, &keypair, sk) == 1);
+    for (i = 0; i < count; i++) {
+        secp256k1_xonly_pubkey internal_pk;
+        secp256k1_xonly_pubkey output_pk;
+        secp256k1_pubkey output_pk_xy;
+        secp256k1_pubkey output_pk_expected;
+        unsigned char pk32[32];
+        unsigned char sk32[32];
+        int pk_parity;
+
+        secp256k1_testrand256(tweak);
+        CHECK(secp256k1_keypair_xonly_pub(ctx, &internal_pk, NULL, &keypair) == 1);
+        CHECK(secp256k1_keypair_xonly_tweak_add(ctx, &keypair, tweak) == 1);
+        CHECK(secp256k1_keypair_xonly_pub(ctx, &output_pk, &pk_parity, &keypair) == 1);
+
+        /* Check that it passes xonly_pubkey_tweak_add_check */
+        CHECK(secp256k1_xonly_pubkey_serialize(ctx, pk32, &output_pk) == 1);
+        CHECK(secp256k1_xonly_pubkey_tweak_add_check(ctx, pk32, pk_parity, &internal_pk, tweak) == 1);
+
+        /* Check that the resulting pubkey matches xonly_pubkey_tweak_add */
+        CHECK(secp256k1_keypair_pub(ctx, &output_pk_xy, &keypair) == 1);
+        CHECK(secp256k1_xonly_pubkey_tweak_add(ctx, &output_pk_expected, &internal_pk, tweak) == 1);
+        CHECK(secp256k1_memcmp_var(&output_pk_xy, &output_pk_expected, sizeof(output_pk_xy)) == 0);
+
+        /* Check that the secret key in the keypair is tweaked correctly */
+        CHECK(secp256k1_keypair_sec(none, sk32, &keypair) == 1);
+        CHECK(secp256k1_ec_pubkey_create(ctx, &output_pk_expected, sk32) == 1);
+        CHECK(secp256k1_memcmp_var(&output_pk_xy, &output_pk_expected, sizeof(output_pk_xy)) == 0);
+    }
+    secp256k1_context_destroy(none);
+    secp256k1_context_destroy(sign);
+    secp256k1_context_destroy(verify);
+}
+
+void run_extrakeys_tests(void) {
+    /* xonly key test cases */
+    test_xonly_pubkey();
+    test_xonly_pubkey_tweak();
+    test_xonly_pubkey_tweak_check();
+    test_xonly_pubkey_tweak_recursive();
+
+    /* keypair tests */
+    test_keypair();
+    test_keypair_add();
+}
+
+#endif
diff --git a/depend/zcash/src/secp256k1/src/modules/recovery/Makefile.am.include b/depend/zcash/src/secp256k1/src/modules/recovery/Makefile.am.include
new file mode 100644
index 000000000..e2d3f1248
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/modules/recovery/Makefile.am.include
@@ -0,0 +1,9 @@
+include_HEADERS += include/secp256k1_recovery.h
+noinst_HEADERS += src/modules/recovery/main_impl.h
+noinst_HEADERS += src/modules/recovery/tests_impl.h
+noinst_HEADERS += src/modules/recovery/tests_exhaustive_impl.h
+if USE_BENCHMARK
+noinst_PROGRAMS += bench_recover
+bench_recover_SOURCES = src/bench_recover.c
+bench_recover_LDADD = libsecp256k1.la $(SECP_LIBS) $(COMMON_LIB)
+endif
diff --git a/depend/zcash/src/secp256k1/src/modules/recovery/main_impl.h b/depend/zcash/src/secp256k1/src/modules/recovery/main_impl.h
new file mode 100644
index 000000000..7a440a729
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/modules/recovery/main_impl.h
@@ -0,0 +1,160 @@
+/***********************************************************************
+ * Copyright (c) 2013-2015 Pieter Wuille                               *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_MODULE_RECOVERY_MAIN_H
+#define SECP256K1_MODULE_RECOVERY_MAIN_H
+
+#include "include/secp256k1_recovery.h"
+
+static void secp256k1_ecdsa_recoverable_signature_load(const secp256k1_context* ctx, secp256k1_scalar* r, secp256k1_scalar* s, int* recid, const secp256k1_ecdsa_recoverable_signature* sig) {
+    (void)ctx;
+    if (sizeof(secp256k1_scalar) == 32) {
+        /* When the secp256k1_scalar type is exactly 32 byte, use its
+         * representation inside secp256k1_ecdsa_signature, as conversion is very fast.
+         * Note that secp256k1_ecdsa_signature_save must use the same representation. */
+        memcpy(r, &sig->data[0], 32);
+        memcpy(s, &sig->data[32], 32);
+    } else {
+        secp256k1_scalar_set_b32(r, &sig->data[0], NULL);
+        secp256k1_scalar_set_b32(s, &sig->data[32], NULL);
+    }
+    *recid = sig->data[64];
+}
+
+static void secp256k1_ecdsa_recoverable_signature_save(secp256k1_ecdsa_recoverable_signature* sig, const secp256k1_scalar* r, const secp256k1_scalar* s, int recid) {
+    if (sizeof(secp256k1_scalar) == 32) {
+        memcpy(&sig->data[0], r, 32);
+        memcpy(&sig->data[32], s, 32);
+    } else {
+        secp256k1_scalar_get_b32(&sig->data[0], r);
+        secp256k1_scalar_get_b32(&sig->data[32], s);
+    }
+    sig->data[64] = recid;
+}
+
+int secp256k1_ecdsa_recoverable_signature_parse_compact(const secp256k1_context* ctx, secp256k1_ecdsa_recoverable_signature* sig, const unsigned char *input64, int recid) {
+    secp256k1_scalar r, s;
+    int ret = 1;
+    int overflow = 0;
+
+    (void)ctx;
+    ARG_CHECK(sig != NULL);
+    ARG_CHECK(input64 != NULL);
+    ARG_CHECK(recid >= 0 && recid <= 3);
+
+    secp256k1_scalar_set_b32(&r, &input64[0], &overflow);
+    ret &= !overflow;
+    secp256k1_scalar_set_b32(&s, &input64[32], &overflow);
+    ret &= !overflow;
+    if (ret) {
+        secp256k1_ecdsa_recoverable_signature_save(sig, &r, &s, recid);
+    } else {
+        memset(sig, 0, sizeof(*sig));
+    }
+    return ret;
+}
+
+int secp256k1_ecdsa_recoverable_signature_serialize_compact(const secp256k1_context* ctx, unsigned char *output64, int *recid, const secp256k1_ecdsa_recoverable_signature* sig) {
+    secp256k1_scalar r, s;
+
+    (void)ctx;
+    ARG_CHECK(output64 != NULL);
+    ARG_CHECK(sig != NULL);
+    ARG_CHECK(recid != NULL);
+
+    secp256k1_ecdsa_recoverable_signature_load(ctx, &r, &s, recid, sig);
+    secp256k1_scalar_get_b32(&output64[0], &r);
+    secp256k1_scalar_get_b32(&output64[32], &s);
+    return 1;
+}
+
+int secp256k1_ecdsa_recoverable_signature_convert(const secp256k1_context* ctx, secp256k1_ecdsa_signature* sig, const secp256k1_ecdsa_recoverable_signature* sigin) {
+    secp256k1_scalar r, s;
+    int recid;
+
+    (void)ctx;
+    ARG_CHECK(sig != NULL);
+    ARG_CHECK(sigin != NULL);
+
+    secp256k1_ecdsa_recoverable_signature_load(ctx, &r, &s, &recid, sigin);
+    secp256k1_ecdsa_signature_save(sig, &r, &s);
+    return 1;
+}
+
+static int secp256k1_ecdsa_sig_recover(const secp256k1_ecmult_context *ctx, const secp256k1_scalar *sigr, const secp256k1_scalar* sigs, secp256k1_ge *pubkey, const secp256k1_scalar *message, int recid) {
+    unsigned char brx[32];
+    secp256k1_fe fx;
+    secp256k1_ge x;
+    secp256k1_gej xj;
+    secp256k1_scalar rn, u1, u2;
+    secp256k1_gej qj;
+    int r;
+
+    if (secp256k1_scalar_is_zero(sigr) || secp256k1_scalar_is_zero(sigs)) {
+        return 0;
+    }
+
+    secp256k1_scalar_get_b32(brx, sigr);
+    r = secp256k1_fe_set_b32(&fx, brx);
+    (void)r;
+    VERIFY_CHECK(r); /* brx comes from a scalar, so is less than the order; certainly less than p */
+    if (recid & 2) {
+        if (secp256k1_fe_cmp_var(&fx, &secp256k1_ecdsa_const_p_minus_order) >= 0) {
+            return 0;
+        }
+        secp256k1_fe_add(&fx, &secp256k1_ecdsa_const_order_as_fe);
+    }
+    if (!secp256k1_ge_set_xo_var(&x, &fx, recid & 1)) {
+        return 0;
+    }
+    secp256k1_gej_set_ge(&xj, &x);
+    secp256k1_scalar_inverse_var(&rn, sigr);
+    secp256k1_scalar_mul(&u1, &rn, message);
+    secp256k1_scalar_negate(&u1, &u1);
+    secp256k1_scalar_mul(&u2, &rn, sigs);
+    secp256k1_ecmult(ctx, &qj, &xj, &u2, &u1);
+    secp256k1_ge_set_gej_var(pubkey, &qj);
+    return !secp256k1_gej_is_infinity(&qj);
+}
+
+int secp256k1_ecdsa_sign_recoverable(const secp256k1_context* ctx, secp256k1_ecdsa_recoverable_signature *signature, const unsigned char *msghash32, const unsigned char *seckey, secp256k1_nonce_function noncefp, const void* noncedata) {
+    secp256k1_scalar r, s;
+    int ret, recid;
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(secp256k1_ecmult_gen_context_is_built(&ctx->ecmult_gen_ctx));
+    ARG_CHECK(msghash32 != NULL);
+    ARG_CHECK(signature != NULL);
+    ARG_CHECK(seckey != NULL);
+
+    ret = secp256k1_ecdsa_sign_inner(ctx, &r, &s, &recid, msghash32, seckey, noncefp, noncedata);
+    secp256k1_ecdsa_recoverable_signature_save(signature, &r, &s, recid);
+    return ret;
+}
+
+int secp256k1_ecdsa_recover(const secp256k1_context* ctx, secp256k1_pubkey *pubkey, const secp256k1_ecdsa_recoverable_signature *signature, const unsigned char *msghash32) {
+    secp256k1_ge q;
+    secp256k1_scalar r, s;
+    secp256k1_scalar m;
+    int recid;
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(secp256k1_ecmult_context_is_built(&ctx->ecmult_ctx));
+    ARG_CHECK(msghash32 != NULL);
+    ARG_CHECK(signature != NULL);
+    ARG_CHECK(pubkey != NULL);
+
+    secp256k1_ecdsa_recoverable_signature_load(ctx, &r, &s, &recid, signature);
+    VERIFY_CHECK(recid >= 0 && recid < 4);  /* should have been caught in parse_compact */
+    secp256k1_scalar_set_b32(&m, msghash32, NULL);
+    if (secp256k1_ecdsa_sig_recover(&ctx->ecmult_ctx, &r, &s, &q, &m, recid)) {
+        secp256k1_pubkey_save(pubkey, &q);
+        return 1;
+    } else {
+        memset(pubkey, 0, sizeof(*pubkey));
+        return 0;
+    }
+}
+
+#endif /* SECP256K1_MODULE_RECOVERY_MAIN_H */
diff --git a/depend/zcash/src/secp256k1/src/modules/recovery/tests_exhaustive_impl.h b/depend/zcash/src/secp256k1/src/modules/recovery/tests_exhaustive_impl.h
new file mode 100644
index 000000000..0ba9409c6
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/modules/recovery/tests_exhaustive_impl.h
@@ -0,0 +1,149 @@
+/***********************************************************************
+ * Copyright (c) 2016 Andrew Poelstra                                  *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_MODULE_RECOVERY_EXHAUSTIVE_TESTS_H
+#define SECP256K1_MODULE_RECOVERY_EXHAUSTIVE_TESTS_H
+
+#include "src/modules/recovery/main_impl.h"
+#include "include/secp256k1_recovery.h"
+
+void test_exhaustive_recovery_sign(const secp256k1_context *ctx, const secp256k1_ge *group) {
+    int i, j, k;
+    uint64_t iter = 0;
+
+    /* Loop */
+    for (i = 1; i < EXHAUSTIVE_TEST_ORDER; i++) {  /* message */
+        for (j = 1; j < EXHAUSTIVE_TEST_ORDER; j++) {  /* key */
+            if (skip_section(&iter)) continue;
+            for (k = 1; k < EXHAUSTIVE_TEST_ORDER; k++) {  /* nonce */
+                const int starting_k = k;
+                secp256k1_fe r_dot_y_normalized;
+                secp256k1_ecdsa_recoverable_signature rsig;
+                secp256k1_ecdsa_signature sig;
+                secp256k1_scalar sk, msg, r, s, expected_r;
+                unsigned char sk32[32], msg32[32];
+                int expected_recid;
+                int recid;
+                int overflow;
+                secp256k1_scalar_set_int(&msg, i);
+                secp256k1_scalar_set_int(&sk, j);
+                secp256k1_scalar_get_b32(sk32, &sk);
+                secp256k1_scalar_get_b32(msg32, &msg);
+
+                secp256k1_ecdsa_sign_recoverable(ctx, &rsig, msg32, sk32, secp256k1_nonce_function_smallint, &k);
+
+                /* Check directly */
+                secp256k1_ecdsa_recoverable_signature_load(ctx, &r, &s, &recid, &rsig);
+                r_from_k(&expected_r, group, k, &overflow);
+                CHECK(r == expected_r);
+                CHECK((k * s) % EXHAUSTIVE_TEST_ORDER == (i + r * j) % EXHAUSTIVE_TEST_ORDER ||
+                      (k * (EXHAUSTIVE_TEST_ORDER - s)) % EXHAUSTIVE_TEST_ORDER == (i + r * j) % EXHAUSTIVE_TEST_ORDER);
+                /* The recid's second bit is for conveying overflow (R.x value >= group order).
+                 * In the actual secp256k1 this is an astronomically unlikely event, but in the
+                 * small group used here, it will be the case for all points except the ones where
+                 * R.x=1 (which the group is specifically selected to have).
+                 * Note that this isn't actually useful; full recovery would need to convey
+                 * floor(R.x / group_order), but only one bit is used as that is sufficient
+                 * in the real group. */
+                expected_recid = overflow ? 2 : 0;
+                r_dot_y_normalized = group[k].y;
+                secp256k1_fe_normalize(&r_dot_y_normalized);
+                /* Also the recovery id is flipped depending if we hit the low-s branch */
+                if ((k * s) % EXHAUSTIVE_TEST_ORDER == (i + r * j) % EXHAUSTIVE_TEST_ORDER) {
+                    expected_recid |= secp256k1_fe_is_odd(&r_dot_y_normalized);
+                } else {
+                    expected_recid |= !secp256k1_fe_is_odd(&r_dot_y_normalized);
+                }
+                CHECK(recid == expected_recid);
+
+                /* Convert to a standard sig then check */
+                secp256k1_ecdsa_recoverable_signature_convert(ctx, &sig, &rsig);
+                secp256k1_ecdsa_signature_load(ctx, &r, &s, &sig);
+                /* Note that we compute expected_r *after* signing -- this is important
+                 * because our nonce-computing function function might change k during
+                 * signing. */
+                r_from_k(&expected_r, group, k, NULL);
+                CHECK(r == expected_r);
+                CHECK((k * s) % EXHAUSTIVE_TEST_ORDER == (i + r * j) % EXHAUSTIVE_TEST_ORDER ||
+                      (k * (EXHAUSTIVE_TEST_ORDER - s)) % EXHAUSTIVE_TEST_ORDER == (i + r * j) % EXHAUSTIVE_TEST_ORDER);
+
+                /* Overflow means we've tried every possible nonce */
+                if (k < starting_k) {
+                    break;
+                }
+            }
+        }
+    }
+}
+
+void test_exhaustive_recovery_verify(const secp256k1_context *ctx, const secp256k1_ge *group) {
+    /* This is essentially a copy of test_exhaustive_verify, with recovery added */
+    int s, r, msg, key;
+    uint64_t iter = 0;
+    for (s = 1; s < EXHAUSTIVE_TEST_ORDER; s++) {
+        for (r = 1; r < EXHAUSTIVE_TEST_ORDER; r++) {
+            for (msg = 1; msg < EXHAUSTIVE_TEST_ORDER; msg++) {
+                for (key = 1; key < EXHAUSTIVE_TEST_ORDER; key++) {
+                    secp256k1_ge nonconst_ge;
+                    secp256k1_ecdsa_recoverable_signature rsig;
+                    secp256k1_ecdsa_signature sig;
+                    secp256k1_pubkey pk;
+                    secp256k1_scalar sk_s, msg_s, r_s, s_s;
+                    secp256k1_scalar s_times_k_s, msg_plus_r_times_sk_s;
+                    int recid = 0;
+                    int k, should_verify;
+                    unsigned char msg32[32];
+
+                    if (skip_section(&iter)) continue;
+
+                    secp256k1_scalar_set_int(&s_s, s);
+                    secp256k1_scalar_set_int(&r_s, r);
+                    secp256k1_scalar_set_int(&msg_s, msg);
+                    secp256k1_scalar_set_int(&sk_s, key);
+                    secp256k1_scalar_get_b32(msg32, &msg_s);
+
+                    /* Verify by hand */
+                    /* Run through every k value that gives us this r and check that *one* works.
+                     * Note there could be none, there could be multiple, ECDSA is weird. */
+                    should_verify = 0;
+                    for (k = 0; k < EXHAUSTIVE_TEST_ORDER; k++) {
+                        secp256k1_scalar check_x_s;
+                        r_from_k(&check_x_s, group, k, NULL);
+                        if (r_s == check_x_s) {
+                            secp256k1_scalar_set_int(&s_times_k_s, k);
+                            secp256k1_scalar_mul(&s_times_k_s, &s_times_k_s, &s_s);
+                            secp256k1_scalar_mul(&msg_plus_r_times_sk_s, &r_s, &sk_s);
+                            secp256k1_scalar_add(&msg_plus_r_times_sk_s, &msg_plus_r_times_sk_s, &msg_s);
+                            should_verify |= secp256k1_scalar_eq(&s_times_k_s, &msg_plus_r_times_sk_s);
+                        }
+                    }
+                    /* nb we have a "high s" rule */
+                    should_verify &= !secp256k1_scalar_is_high(&s_s);
+
+                    /* We would like to try recovering the pubkey and checking that it matches,
+                     * but pubkey recovery is impossible in the exhaustive tests (the reason
+                     * being that there are 12 nonzero r values, 12 nonzero points, and no
+                     * overlap between the sets, so there are no valid signatures). */
+
+                    /* Verify by converting to a standard signature and calling verify */
+                    secp256k1_ecdsa_recoverable_signature_save(&rsig, &r_s, &s_s, recid);
+                    secp256k1_ecdsa_recoverable_signature_convert(ctx, &sig, &rsig);
+                    memcpy(&nonconst_ge, &group[sk_s], sizeof(nonconst_ge));
+                    secp256k1_pubkey_save(&pk, &nonconst_ge);
+                    CHECK(should_verify ==
+                          secp256k1_ecdsa_verify(ctx, &sig, msg32, &pk));
+                }
+            }
+        }
+    }
+}
+
+static void test_exhaustive_recovery(const secp256k1_context *ctx, const secp256k1_ge *group) {
+    test_exhaustive_recovery_sign(ctx, group);
+    test_exhaustive_recovery_verify(ctx, group);
+}
+
+#endif /* SECP256K1_MODULE_RECOVERY_EXHAUSTIVE_TESTS_H */
diff --git a/depend/zcash/src/secp256k1/src/modules/recovery/tests_impl.h b/depend/zcash/src/secp256k1/src/modules/recovery/tests_impl.h
new file mode 100644
index 000000000..40dba87ce
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/modules/recovery/tests_impl.h
@@ -0,0 +1,393 @@
+/***********************************************************************
+ * Copyright (c) 2013-2015 Pieter Wuille                               *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_MODULE_RECOVERY_TESTS_H
+#define SECP256K1_MODULE_RECOVERY_TESTS_H
+
+static int recovery_test_nonce_function(unsigned char *nonce32, const unsigned char *msg32, const unsigned char *key32, const unsigned char *algo16, void *data, unsigned int counter) {
+    (void) msg32;
+    (void) key32;
+    (void) algo16;
+    (void) data;
+
+    /* On the first run, return 0 to force a second run */
+    if (counter == 0) {
+        memset(nonce32, 0, 32);
+        return 1;
+    }
+    /* On the second run, return an overflow to force a third run */
+    if (counter == 1) {
+        memset(nonce32, 0xff, 32);
+        return 1;
+    }
+    /* On the next run, return a valid nonce, but flip a coin as to whether or not to fail signing. */
+    memset(nonce32, 1, 32);
+    return secp256k1_testrand_bits(1);
+}
+
+void test_ecdsa_recovery_api(void) {
+    /* Setup contexts that just count errors */
+    secp256k1_context *none = secp256k1_context_create(SECP256K1_CONTEXT_NONE);
+    secp256k1_context *sign = secp256k1_context_create(SECP256K1_CONTEXT_SIGN);
+    secp256k1_context *vrfy = secp256k1_context_create(SECP256K1_CONTEXT_VERIFY);
+    secp256k1_context *both = secp256k1_context_create(SECP256K1_CONTEXT_SIGN | SECP256K1_CONTEXT_VERIFY);
+    secp256k1_pubkey pubkey;
+    secp256k1_pubkey recpubkey;
+    secp256k1_ecdsa_signature normal_sig;
+    secp256k1_ecdsa_recoverable_signature recsig;
+    unsigned char privkey[32] = { 1 };
+    unsigned char message[32] = { 2 };
+    int32_t ecount = 0;
+    int recid = 0;
+    unsigned char sig[74];
+    unsigned char zero_privkey[32] = { 0 };
+    unsigned char over_privkey[32] = { 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+                                       0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+                                       0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+                                       0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff };
+
+    secp256k1_context_set_error_callback(none, counting_illegal_callback_fn, &ecount);
+    secp256k1_context_set_error_callback(sign, counting_illegal_callback_fn, &ecount);
+    secp256k1_context_set_error_callback(vrfy, counting_illegal_callback_fn, &ecount);
+    secp256k1_context_set_error_callback(both, counting_illegal_callback_fn, &ecount);
+    secp256k1_context_set_illegal_callback(none, counting_illegal_callback_fn, &ecount);
+    secp256k1_context_set_illegal_callback(sign, counting_illegal_callback_fn, &ecount);
+    secp256k1_context_set_illegal_callback(vrfy, counting_illegal_callback_fn, &ecount);
+    secp256k1_context_set_illegal_callback(both, counting_illegal_callback_fn, &ecount);
+
+    /* Construct and verify corresponding public key. */
+    CHECK(secp256k1_ec_seckey_verify(ctx, privkey) == 1);
+    CHECK(secp256k1_ec_pubkey_create(ctx, &pubkey, privkey) == 1);
+
+    /* Check bad contexts and NULLs for signing */
+    ecount = 0;
+    CHECK(secp256k1_ecdsa_sign_recoverable(none, &recsig, message, privkey, NULL, NULL) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_ecdsa_sign_recoverable(sign, &recsig, message, privkey, NULL, NULL) == 1);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_ecdsa_sign_recoverable(vrfy, &recsig, message, privkey, NULL, NULL) == 0);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_ecdsa_sign_recoverable(both, &recsig, message, privkey, NULL, NULL) == 1);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_ecdsa_sign_recoverable(both, NULL, message, privkey, NULL, NULL) == 0);
+    CHECK(ecount == 3);
+    CHECK(secp256k1_ecdsa_sign_recoverable(both, &recsig, NULL, privkey, NULL, NULL) == 0);
+    CHECK(ecount == 4);
+    CHECK(secp256k1_ecdsa_sign_recoverable(both, &recsig, message, NULL, NULL, NULL) == 0);
+    CHECK(ecount == 5);
+    /* This will fail or succeed randomly, and in either case will not ARG_CHECK failure */
+    secp256k1_ecdsa_sign_recoverable(both, &recsig, message, privkey, recovery_test_nonce_function, NULL);
+    CHECK(ecount == 5);
+    /* These will all fail, but not in ARG_CHECK way */
+    CHECK(secp256k1_ecdsa_sign_recoverable(both, &recsig, message, zero_privkey, NULL, NULL) == 0);
+    CHECK(secp256k1_ecdsa_sign_recoverable(both, &recsig, message, over_privkey, NULL, NULL) == 0);
+    /* This one will succeed. */
+    CHECK(secp256k1_ecdsa_sign_recoverable(both, &recsig, message, privkey, NULL, NULL) == 1);
+    CHECK(ecount == 5);
+
+    /* Check signing with a goofy nonce function */
+
+    /* Check bad contexts and NULLs for recovery */
+    ecount = 0;
+    CHECK(secp256k1_ecdsa_recover(none, &recpubkey, &recsig, message) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_ecdsa_recover(sign, &recpubkey, &recsig, message) == 0);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_ecdsa_recover(vrfy, &recpubkey, &recsig, message) == 1);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_ecdsa_recover(both, &recpubkey, &recsig, message) == 1);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_ecdsa_recover(both, NULL, &recsig, message) == 0);
+    CHECK(ecount == 3);
+    CHECK(secp256k1_ecdsa_recover(both, &recpubkey, NULL, message) == 0);
+    CHECK(ecount == 4);
+    CHECK(secp256k1_ecdsa_recover(both, &recpubkey, &recsig, NULL) == 0);
+    CHECK(ecount == 5);
+
+    /* Check NULLs for conversion */
+    CHECK(secp256k1_ecdsa_sign(both, &normal_sig, message, privkey, NULL, NULL) == 1);
+    ecount = 0;
+    CHECK(secp256k1_ecdsa_recoverable_signature_convert(both, NULL, &recsig) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_ecdsa_recoverable_signature_convert(both, &normal_sig, NULL) == 0);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_ecdsa_recoverable_signature_convert(both, &normal_sig, &recsig) == 1);
+
+    /* Check NULLs for de/serialization */
+    CHECK(secp256k1_ecdsa_sign_recoverable(both, &recsig, message, privkey, NULL, NULL) == 1);
+    ecount = 0;
+    CHECK(secp256k1_ecdsa_recoverable_signature_serialize_compact(both, NULL, &recid, &recsig) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_ecdsa_recoverable_signature_serialize_compact(both, sig, NULL, &recsig) == 0);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_ecdsa_recoverable_signature_serialize_compact(both, sig, &recid, NULL) == 0);
+    CHECK(ecount == 3);
+    CHECK(secp256k1_ecdsa_recoverable_signature_serialize_compact(both, sig, &recid, &recsig) == 1);
+
+    CHECK(secp256k1_ecdsa_recoverable_signature_parse_compact(both, NULL, sig, recid) == 0);
+    CHECK(ecount == 4);
+    CHECK(secp256k1_ecdsa_recoverable_signature_parse_compact(both, &recsig, NULL, recid) == 0);
+    CHECK(ecount == 5);
+    CHECK(secp256k1_ecdsa_recoverable_signature_parse_compact(both, &recsig, sig, -1) == 0);
+    CHECK(ecount == 6);
+    CHECK(secp256k1_ecdsa_recoverable_signature_parse_compact(both, &recsig, sig, 5) == 0);
+    CHECK(ecount == 7);
+    /* overflow in signature will fail but not affect ecount */
+    memcpy(sig, over_privkey, 32);
+    CHECK(secp256k1_ecdsa_recoverable_signature_parse_compact(both, &recsig, sig, recid) == 0);
+    CHECK(ecount == 7);
+
+    /* cleanup */
+    secp256k1_context_destroy(none);
+    secp256k1_context_destroy(sign);
+    secp256k1_context_destroy(vrfy);
+    secp256k1_context_destroy(both);
+}
+
+void test_ecdsa_recovery_end_to_end(void) {
+    unsigned char extra[32] = {0x00};
+    unsigned char privkey[32];
+    unsigned char message[32];
+    secp256k1_ecdsa_signature signature[5];
+    secp256k1_ecdsa_recoverable_signature rsignature[5];
+    unsigned char sig[74];
+    secp256k1_pubkey pubkey;
+    secp256k1_pubkey recpubkey;
+    int recid = 0;
+
+    /* Generate a random key and message. */
+    {
+        secp256k1_scalar msg, key;
+        random_scalar_order_test(&msg);
+        random_scalar_order_test(&key);
+        secp256k1_scalar_get_b32(privkey, &key);
+        secp256k1_scalar_get_b32(message, &msg);
+    }
+
+    /* Construct and verify corresponding public key. */
+    CHECK(secp256k1_ec_seckey_verify(ctx, privkey) == 1);
+    CHECK(secp256k1_ec_pubkey_create(ctx, &pubkey, privkey) == 1);
+
+    /* Serialize/parse compact and verify/recover. */
+    extra[0] = 0;
+    CHECK(secp256k1_ecdsa_sign_recoverable(ctx, &rsignature[0], message, privkey, NULL, NULL) == 1);
+    CHECK(secp256k1_ecdsa_sign(ctx, &signature[0], message, privkey, NULL, NULL) == 1);
+    CHECK(secp256k1_ecdsa_sign_recoverable(ctx, &rsignature[4], message, privkey, NULL, NULL) == 1);
+    CHECK(secp256k1_ecdsa_sign_recoverable(ctx, &rsignature[1], message, privkey, NULL, extra) == 1);
+    extra[31] = 1;
+    CHECK(secp256k1_ecdsa_sign_recoverable(ctx, &rsignature[2], message, privkey, NULL, extra) == 1);
+    extra[31] = 0;
+    extra[0] = 1;
+    CHECK(secp256k1_ecdsa_sign_recoverable(ctx, &rsignature[3], message, privkey, NULL, extra) == 1);
+    CHECK(secp256k1_ecdsa_recoverable_signature_serialize_compact(ctx, sig, &recid, &rsignature[4]) == 1);
+    CHECK(secp256k1_ecdsa_recoverable_signature_convert(ctx, &signature[4], &rsignature[4]) == 1);
+    CHECK(secp256k1_memcmp_var(&signature[4], &signature[0], 64) == 0);
+    CHECK(secp256k1_ecdsa_verify(ctx, &signature[4], message, &pubkey) == 1);
+    memset(&rsignature[4], 0, sizeof(rsignature[4]));
+    CHECK(secp256k1_ecdsa_recoverable_signature_parse_compact(ctx, &rsignature[4], sig, recid) == 1);
+    CHECK(secp256k1_ecdsa_recoverable_signature_convert(ctx, &signature[4], &rsignature[4]) == 1);
+    CHECK(secp256k1_ecdsa_verify(ctx, &signature[4], message, &pubkey) == 1);
+    /* Parse compact (with recovery id) and recover. */
+    CHECK(secp256k1_ecdsa_recoverable_signature_parse_compact(ctx, &rsignature[4], sig, recid) == 1);
+    CHECK(secp256k1_ecdsa_recover(ctx, &recpubkey, &rsignature[4], message) == 1);
+    CHECK(secp256k1_memcmp_var(&pubkey, &recpubkey, sizeof(pubkey)) == 0);
+    /* Serialize/destroy/parse signature and verify again. */
+    CHECK(secp256k1_ecdsa_recoverable_signature_serialize_compact(ctx, sig, &recid, &rsignature[4]) == 1);
+    sig[secp256k1_testrand_bits(6)] += 1 + secp256k1_testrand_int(255);
+    CHECK(secp256k1_ecdsa_recoverable_signature_parse_compact(ctx, &rsignature[4], sig, recid) == 1);
+    CHECK(secp256k1_ecdsa_recoverable_signature_convert(ctx, &signature[4], &rsignature[4]) == 1);
+    CHECK(secp256k1_ecdsa_verify(ctx, &signature[4], message, &pubkey) == 0);
+    /* Recover again */
+    CHECK(secp256k1_ecdsa_recover(ctx, &recpubkey, &rsignature[4], message) == 0 ||
+          secp256k1_memcmp_var(&pubkey, &recpubkey, sizeof(pubkey)) != 0);
+}
+
+/* Tests several edge cases. */
+void test_ecdsa_recovery_edge_cases(void) {
+    const unsigned char msg32[32] = {
+        'T', 'h', 'i', 's', ' ', 'i', 's', ' ',
+        'a', ' ', 'v', 'e', 'r', 'y', ' ', 's',
+        'e', 'c', 'r', 'e', 't', ' ', 'm', 'e',
+        's', 's', 'a', 'g', 'e', '.', '.', '.'
+    };
+    const unsigned char sig64[64] = {
+        /* Generated by signing the above message with nonce 'This is the nonce we will use...'
+         * and secret key 0 (which is not valid), resulting in recid 1. */
+        0x67, 0xCB, 0x28, 0x5F, 0x9C, 0xD1, 0x94, 0xE8,
+        0x40, 0xD6, 0x29, 0x39, 0x7A, 0xF5, 0x56, 0x96,
+        0x62, 0xFD, 0xE4, 0x46, 0x49, 0x99, 0x59, 0x63,
+        0x17, 0x9A, 0x7D, 0xD1, 0x7B, 0xD2, 0x35, 0x32,
+        0x4B, 0x1B, 0x7D, 0xF3, 0x4C, 0xE1, 0xF6, 0x8E,
+        0x69, 0x4F, 0xF6, 0xF1, 0x1A, 0xC7, 0x51, 0xDD,
+        0x7D, 0xD7, 0x3E, 0x38, 0x7E, 0xE4, 0xFC, 0x86,
+        0x6E, 0x1B, 0xE8, 0xEC, 0xC7, 0xDD, 0x95, 0x57
+    };
+    secp256k1_pubkey pubkey;
+    /* signature (r,s) = (4,4), which can be recovered with all 4 recids. */
+    const unsigned char sigb64[64] = {
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x04,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x04,
+    };
+    secp256k1_pubkey pubkeyb;
+    secp256k1_ecdsa_recoverable_signature rsig;
+    secp256k1_ecdsa_signature sig;
+    int recid;
+
+    CHECK(secp256k1_ecdsa_recoverable_signature_parse_compact(ctx, &rsig, sig64, 0));
+    CHECK(!secp256k1_ecdsa_recover(ctx, &pubkey, &rsig, msg32));
+    CHECK(secp256k1_ecdsa_recoverable_signature_parse_compact(ctx, &rsig, sig64, 1));
+    CHECK(secp256k1_ecdsa_recover(ctx, &pubkey, &rsig, msg32));
+    CHECK(secp256k1_ecdsa_recoverable_signature_parse_compact(ctx, &rsig, sig64, 2));
+    CHECK(!secp256k1_ecdsa_recover(ctx, &pubkey, &rsig, msg32));
+    CHECK(secp256k1_ecdsa_recoverable_signature_parse_compact(ctx, &rsig, sig64, 3));
+    CHECK(!secp256k1_ecdsa_recover(ctx, &pubkey, &rsig, msg32));
+
+    for (recid = 0; recid < 4; recid++) {
+        int i;
+        int recid2;
+        /* (4,4) encoded in DER. */
+        unsigned char sigbder[8] = {0x30, 0x06, 0x02, 0x01, 0x04, 0x02, 0x01, 0x04};
+        unsigned char sigcder_zr[7] = {0x30, 0x05, 0x02, 0x00, 0x02, 0x01, 0x01};
+        unsigned char sigcder_zs[7] = {0x30, 0x05, 0x02, 0x01, 0x01, 0x02, 0x00};
+        unsigned char sigbderalt1[39] = {
+            0x30, 0x25, 0x02, 0x20, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x04, 0x02, 0x01, 0x04,
+        };
+        unsigned char sigbderalt2[39] = {
+            0x30, 0x25, 0x02, 0x01, 0x04, 0x02, 0x20, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x04,
+        };
+        unsigned char sigbderalt3[40] = {
+            0x30, 0x26, 0x02, 0x21, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x04, 0x02, 0x01, 0x04,
+        };
+        unsigned char sigbderalt4[40] = {
+            0x30, 0x26, 0x02, 0x01, 0x04, 0x02, 0x21, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x04,
+        };
+        /* (order + r,4) encoded in DER. */
+        unsigned char sigbderlong[40] = {
+            0x30, 0x26, 0x02, 0x21, 0x00, 0xFF, 0xFF, 0xFF,
+            0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+            0xFF, 0xFF, 0xFF, 0xFF, 0xFE, 0xBA, 0xAE, 0xDC,
+            0xE6, 0xAF, 0x48, 0xA0, 0x3B, 0xBF, 0xD2, 0x5E,
+            0x8C, 0xD0, 0x36, 0x41, 0x45, 0x02, 0x01, 0x04
+        };
+        CHECK(secp256k1_ecdsa_recoverable_signature_parse_compact(ctx, &rsig, sigb64, recid) == 1);
+        CHECK(secp256k1_ecdsa_recover(ctx, &pubkeyb, &rsig, msg32) == 1);
+        CHECK(secp256k1_ecdsa_signature_parse_der(ctx, &sig, sigbder, sizeof(sigbder)) == 1);
+        CHECK(secp256k1_ecdsa_verify(ctx, &sig, msg32, &pubkeyb) == 1);
+        for (recid2 = 0; recid2 < 4; recid2++) {
+            secp256k1_pubkey pubkey2b;
+            CHECK(secp256k1_ecdsa_recoverable_signature_parse_compact(ctx, &rsig, sigb64, recid2) == 1);
+            CHECK(secp256k1_ecdsa_recover(ctx, &pubkey2b, &rsig, msg32) == 1);
+            /* Verifying with (order + r,4) should always fail. */
+            CHECK(secp256k1_ecdsa_signature_parse_der(ctx, &sig, sigbderlong, sizeof(sigbderlong)) == 1);
+            CHECK(secp256k1_ecdsa_verify(ctx, &sig, msg32, &pubkeyb) == 0);
+        }
+        /* DER parsing tests. */
+        /* Zero length r/s. */
+        CHECK(secp256k1_ecdsa_signature_parse_der(ctx, &sig, sigcder_zr, sizeof(sigcder_zr)) == 0);
+        CHECK(secp256k1_ecdsa_signature_parse_der(ctx, &sig, sigcder_zs, sizeof(sigcder_zs)) == 0);
+        /* Leading zeros. */
+        CHECK(secp256k1_ecdsa_signature_parse_der(ctx, &sig, sigbderalt1, sizeof(sigbderalt1)) == 0);
+        CHECK(secp256k1_ecdsa_signature_parse_der(ctx, &sig, sigbderalt2, sizeof(sigbderalt2)) == 0);
+        CHECK(secp256k1_ecdsa_signature_parse_der(ctx, &sig, sigbderalt3, sizeof(sigbderalt3)) == 0);
+        CHECK(secp256k1_ecdsa_signature_parse_der(ctx, &sig, sigbderalt4, sizeof(sigbderalt4)) == 0);
+        sigbderalt3[4] = 1;
+        CHECK(secp256k1_ecdsa_signature_parse_der(ctx, &sig, sigbderalt3, sizeof(sigbderalt3)) == 1);
+        CHECK(secp256k1_ecdsa_verify(ctx, &sig, msg32, &pubkeyb) == 0);
+        sigbderalt4[7] = 1;
+        CHECK(secp256k1_ecdsa_signature_parse_der(ctx, &sig, sigbderalt4, sizeof(sigbderalt4)) == 1);
+        CHECK(secp256k1_ecdsa_verify(ctx, &sig, msg32, &pubkeyb) == 0);
+        /* Damage signature. */
+        sigbder[7]++;
+        CHECK(secp256k1_ecdsa_signature_parse_der(ctx, &sig, sigbder, sizeof(sigbder)) == 1);
+        CHECK(secp256k1_ecdsa_verify(ctx, &sig, msg32, &pubkeyb) == 0);
+        sigbder[7]--;
+        CHECK(secp256k1_ecdsa_signature_parse_der(ctx, &sig, sigbder, 6) == 0);
+        CHECK(secp256k1_ecdsa_signature_parse_der(ctx, &sig, sigbder, sizeof(sigbder) - 1) == 0);
+        for(i = 0; i < 8; i++) {
+            int c;
+            unsigned char orig = sigbder[i];
+            /*Try every single-byte change.*/
+            for (c = 0; c < 256; c++) {
+                if (c == orig ) {
+                    continue;
+                }
+                sigbder[i] = c;
+                CHECK(secp256k1_ecdsa_signature_parse_der(ctx, &sig, sigbder, sizeof(sigbder)) == 0 || secp256k1_ecdsa_verify(ctx, &sig, msg32, &pubkeyb) == 0);
+            }
+            sigbder[i] = orig;
+        }
+    }
+
+    /* Test r/s equal to zero */
+    {
+        /* (1,1) encoded in DER. */
+        unsigned char sigcder[8] = {0x30, 0x06, 0x02, 0x01, 0x01, 0x02, 0x01, 0x01};
+        unsigned char sigc64[64] = {
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01,
+        };
+        secp256k1_pubkey pubkeyc;
+        CHECK(secp256k1_ecdsa_recoverable_signature_parse_compact(ctx, &rsig, sigc64, 0) == 1);
+        CHECK(secp256k1_ecdsa_recover(ctx, &pubkeyc, &rsig, msg32) == 1);
+        CHECK(secp256k1_ecdsa_signature_parse_der(ctx, &sig, sigcder, sizeof(sigcder)) == 1);
+        CHECK(secp256k1_ecdsa_verify(ctx, &sig, msg32, &pubkeyc) == 1);
+        sigcder[4] = 0;
+        sigc64[31] = 0;
+        CHECK(secp256k1_ecdsa_recoverable_signature_parse_compact(ctx, &rsig, sigc64, 0) == 1);
+        CHECK(secp256k1_ecdsa_recover(ctx, &pubkeyb, &rsig, msg32) == 0);
+        CHECK(secp256k1_ecdsa_signature_parse_der(ctx, &sig, sigcder, sizeof(sigcder)) == 1);
+        CHECK(secp256k1_ecdsa_verify(ctx, &sig, msg32, &pubkeyc) == 0);
+        sigcder[4] = 1;
+        sigcder[7] = 0;
+        sigc64[31] = 1;
+        sigc64[63] = 0;
+        CHECK(secp256k1_ecdsa_recoverable_signature_parse_compact(ctx, &rsig, sigc64, 0) == 1);
+        CHECK(secp256k1_ecdsa_recover(ctx, &pubkeyb, &rsig, msg32) == 0);
+        CHECK(secp256k1_ecdsa_signature_parse_der(ctx, &sig, sigcder, sizeof(sigcder)) == 1);
+        CHECK(secp256k1_ecdsa_verify(ctx, &sig, msg32, &pubkeyc) == 0);
+    }
+}
+
+void run_recovery_tests(void) {
+    int i;
+    for (i = 0; i < count; i++) {
+        test_ecdsa_recovery_api();
+    }
+    for (i = 0; i < 64*count; i++) {
+        test_ecdsa_recovery_end_to_end();
+    }
+    test_ecdsa_recovery_edge_cases();
+}
+
+#endif /* SECP256K1_MODULE_RECOVERY_TESTS_H */
diff --git a/depend/zcash/src/secp256k1/src/modules/schnorrsig/Makefile.am.include b/depend/zcash/src/secp256k1/src/modules/schnorrsig/Makefile.am.include
new file mode 100644
index 000000000..568bcc352
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/modules/schnorrsig/Makefile.am.include
@@ -0,0 +1,9 @@
+include_HEADERS += include/secp256k1_schnorrsig.h
+noinst_HEADERS += src/modules/schnorrsig/main_impl.h
+noinst_HEADERS += src/modules/schnorrsig/tests_impl.h
+noinst_HEADERS += src/modules/schnorrsig/tests_exhaustive_impl.h
+if USE_BENCHMARK
+noinst_PROGRAMS += bench_schnorrsig
+bench_schnorrsig_SOURCES = src/bench_schnorrsig.c
+bench_schnorrsig_LDADD = libsecp256k1.la $(SECP_LIBS) $(COMMON_LIB)
+endif
diff --git a/depend/zcash/src/secp256k1/src/modules/schnorrsig/main_impl.h b/depend/zcash/src/secp256k1/src/modules/schnorrsig/main_impl.h
new file mode 100644
index 000000000..22e1b33a5
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/modules/schnorrsig/main_impl.h
@@ -0,0 +1,239 @@
+/***********************************************************************
+ * Copyright (c) 2018-2020 Andrew Poelstra, Jonas Nick                 *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_MODULE_SCHNORRSIG_MAIN_H
+#define SECP256K1_MODULE_SCHNORRSIG_MAIN_H
+
+#include "include/secp256k1.h"
+#include "include/secp256k1_schnorrsig.h"
+#include "hash.h"
+
+/* Initializes SHA256 with fixed midstate. This midstate was computed by applying
+ * SHA256 to SHA256("BIP0340/nonce")||SHA256("BIP0340/nonce"). */
+static void secp256k1_nonce_function_bip340_sha256_tagged(secp256k1_sha256 *sha) {
+    secp256k1_sha256_initialize(sha);
+    sha->s[0] = 0x46615b35ul;
+    sha->s[1] = 0xf4bfbff7ul;
+    sha->s[2] = 0x9f8dc671ul;
+    sha->s[3] = 0x83627ab3ul;
+    sha->s[4] = 0x60217180ul;
+    sha->s[5] = 0x57358661ul;
+    sha->s[6] = 0x21a29e54ul;
+    sha->s[7] = 0x68b07b4cul;
+
+    sha->bytes = 64;
+}
+
+/* Initializes SHA256 with fixed midstate. This midstate was computed by applying
+ * SHA256 to SHA256("BIP0340/aux")||SHA256("BIP0340/aux"). */
+static void secp256k1_nonce_function_bip340_sha256_tagged_aux(secp256k1_sha256 *sha) {
+    secp256k1_sha256_initialize(sha);
+    sha->s[0] = 0x24dd3219ul;
+    sha->s[1] = 0x4eba7e70ul;
+    sha->s[2] = 0xca0fabb9ul;
+    sha->s[3] = 0x0fa3166dul;
+    sha->s[4] = 0x3afbe4b1ul;
+    sha->s[5] = 0x4c44df97ul;
+    sha->s[6] = 0x4aac2739ul;
+    sha->s[7] = 0x249e850aul;
+
+    sha->bytes = 64;
+}
+
+/* algo16 argument for nonce_function_bip340 to derive the nonce exactly as stated in BIP-340
+ * by using the correct tagged hash function. */
+static const unsigned char bip340_algo16[16] = "BIP0340/nonce\0\0\0";
+
+static int nonce_function_bip340(unsigned char *nonce32, const unsigned char *msg32, const unsigned char *key32, const unsigned char *xonly_pk32, const unsigned char *algo16, void *data) {
+    secp256k1_sha256 sha;
+    unsigned char masked_key[32];
+    int i;
+
+    if (algo16 == NULL) {
+        return 0;
+    }
+
+    if (data != NULL) {
+        secp256k1_nonce_function_bip340_sha256_tagged_aux(&sha);
+        secp256k1_sha256_write(&sha, data, 32);
+        secp256k1_sha256_finalize(&sha, masked_key);
+        for (i = 0; i < 32; i++) {
+            masked_key[i] ^= key32[i];
+        }
+    }
+
+    /* Tag the hash with algo16 which is important to avoid nonce reuse across
+     * algorithms. If this nonce function is used in BIP-340 signing as defined
+     * in the spec, an optimized tagging implementation is used. */
+    if (secp256k1_memcmp_var(algo16, bip340_algo16, 16) == 0) {
+        secp256k1_nonce_function_bip340_sha256_tagged(&sha);
+    } else {
+        int algo16_len = 16;
+        /* Remove terminating null bytes */
+        while (algo16_len > 0 && !algo16[algo16_len - 1]) {
+            algo16_len--;
+        }
+        secp256k1_sha256_initialize_tagged(&sha, algo16, algo16_len);
+    }
+
+    /* Hash (masked-)key||pk||msg using the tagged hash as per the spec */
+    if (data != NULL) {
+        secp256k1_sha256_write(&sha, masked_key, 32);
+    } else {
+        secp256k1_sha256_write(&sha, key32, 32);
+    }
+    secp256k1_sha256_write(&sha, xonly_pk32, 32);
+    secp256k1_sha256_write(&sha, msg32, 32);
+    secp256k1_sha256_finalize(&sha, nonce32);
+    return 1;
+}
+
+const secp256k1_nonce_function_hardened secp256k1_nonce_function_bip340 = nonce_function_bip340;
+
+/* Initializes SHA256 with fixed midstate. This midstate was computed by applying
+ * SHA256 to SHA256("BIP0340/challenge")||SHA256("BIP0340/challenge"). */
+static void secp256k1_schnorrsig_sha256_tagged(secp256k1_sha256 *sha) {
+    secp256k1_sha256_initialize(sha);
+    sha->s[0] = 0x9cecba11ul;
+    sha->s[1] = 0x23925381ul;
+    sha->s[2] = 0x11679112ul;
+    sha->s[3] = 0xd1627e0ful;
+    sha->s[4] = 0x97c87550ul;
+    sha->s[5] = 0x003cc765ul;
+    sha->s[6] = 0x90f61164ul;
+    sha->s[7] = 0x33e9b66aul;
+    sha->bytes = 64;
+}
+
+static void secp256k1_schnorrsig_challenge(secp256k1_scalar* e, const unsigned char *r32, const unsigned char *msg32, const unsigned char *pubkey32)
+{
+    unsigned char buf[32];
+    secp256k1_sha256 sha;
+
+    /* tagged hash(r.x, pk.x, msg32) */
+    secp256k1_schnorrsig_sha256_tagged(&sha);
+    secp256k1_sha256_write(&sha, r32, 32);
+    secp256k1_sha256_write(&sha, pubkey32, 32);
+    secp256k1_sha256_write(&sha, msg32, 32);
+    secp256k1_sha256_finalize(&sha, buf);
+    /* Set scalar e to the challenge hash modulo the curve order as per
+     * BIP340. */
+    secp256k1_scalar_set_b32(e, buf, NULL);
+}
+
+int secp256k1_schnorrsig_sign(const secp256k1_context* ctx, unsigned char *sig64, const unsigned char *msg32, const secp256k1_keypair *keypair, secp256k1_nonce_function_hardened noncefp, void *ndata) {
+    secp256k1_scalar sk;
+    secp256k1_scalar e;
+    secp256k1_scalar k;
+    secp256k1_gej rj;
+    secp256k1_ge pk;
+    secp256k1_ge r;
+    unsigned char buf[32] = { 0 };
+    unsigned char pk_buf[32];
+    unsigned char seckey[32];
+    int ret = 1;
+
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(secp256k1_ecmult_gen_context_is_built(&ctx->ecmult_gen_ctx));
+    ARG_CHECK(sig64 != NULL);
+    ARG_CHECK(msg32 != NULL);
+    ARG_CHECK(keypair != NULL);
+
+    if (noncefp == NULL) {
+        noncefp = secp256k1_nonce_function_bip340;
+    }
+
+    ret &= secp256k1_keypair_load(ctx, &sk, &pk, keypair);
+    /* Because we are signing for a x-only pubkey, the secret key is negated
+     * before signing if the point corresponding to the secret key does not
+     * have an even Y. */
+    if (secp256k1_fe_is_odd(&pk.y)) {
+        secp256k1_scalar_negate(&sk, &sk);
+    }
+
+    secp256k1_scalar_get_b32(seckey, &sk);
+    secp256k1_fe_get_b32(pk_buf, &pk.x);
+    ret &= !!noncefp(buf, msg32, seckey, pk_buf, bip340_algo16, ndata);
+    secp256k1_scalar_set_b32(&k, buf, NULL);
+    ret &= !secp256k1_scalar_is_zero(&k);
+    secp256k1_scalar_cmov(&k, &secp256k1_scalar_one, !ret);
+
+    secp256k1_ecmult_gen(&ctx->ecmult_gen_ctx, &rj, &k);
+    secp256k1_ge_set_gej(&r, &rj);
+
+    /* We declassify r to allow using it as a branch point. This is fine
+     * because r is not a secret. */
+    secp256k1_declassify(ctx, &r, sizeof(r));
+    secp256k1_fe_normalize_var(&r.y);
+    if (secp256k1_fe_is_odd(&r.y)) {
+        secp256k1_scalar_negate(&k, &k);
+    }
+    secp256k1_fe_normalize_var(&r.x);
+    secp256k1_fe_get_b32(&sig64[0], &r.x);
+
+    secp256k1_schnorrsig_challenge(&e, &sig64[0], msg32, pk_buf);
+    secp256k1_scalar_mul(&e, &e, &sk);
+    secp256k1_scalar_add(&e, &e, &k);
+    secp256k1_scalar_get_b32(&sig64[32], &e);
+
+    secp256k1_memczero(sig64, 64, !ret);
+    secp256k1_scalar_clear(&k);
+    secp256k1_scalar_clear(&sk);
+    memset(seckey, 0, sizeof(seckey));
+
+    return ret;
+}
+
+int secp256k1_schnorrsig_verify(const secp256k1_context* ctx, const unsigned char *sig64, const unsigned char *msg32, const secp256k1_xonly_pubkey *pubkey) {
+    secp256k1_scalar s;
+    secp256k1_scalar e;
+    secp256k1_gej rj;
+    secp256k1_ge pk;
+    secp256k1_gej pkj;
+    secp256k1_fe rx;
+    secp256k1_ge r;
+    unsigned char buf[32];
+    int overflow;
+
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(secp256k1_ecmult_context_is_built(&ctx->ecmult_ctx));
+    ARG_CHECK(sig64 != NULL);
+    ARG_CHECK(msg32 != NULL);
+    ARG_CHECK(pubkey != NULL);
+
+    if (!secp256k1_fe_set_b32(&rx, &sig64[0])) {
+        return 0;
+    }
+
+    secp256k1_scalar_set_b32(&s, &sig64[32], &overflow);
+    if (overflow) {
+        return 0;
+    }
+
+    if (!secp256k1_xonly_pubkey_load(ctx, &pk, pubkey)) {
+        return 0;
+    }
+
+    /* Compute e. */
+    secp256k1_fe_get_b32(buf, &pk.x);
+    secp256k1_schnorrsig_challenge(&e, &sig64[0], msg32, buf);
+
+    /* Compute rj =  s*G + (-e)*pkj */
+    secp256k1_scalar_negate(&e, &e);
+    secp256k1_gej_set_ge(&pkj, &pk);
+    secp256k1_ecmult(&ctx->ecmult_ctx, &rj, &pkj, &e, &s);
+
+    secp256k1_ge_set_gej_var(&r, &rj);
+    if (secp256k1_ge_is_infinity(&r)) {
+        return 0;
+    }
+
+    secp256k1_fe_normalize_var(&r.y);
+    return !secp256k1_fe_is_odd(&r.y) &&
+           secp256k1_fe_equal_var(&rx, &r.x);
+}
+
+#endif
diff --git a/depend/zcash/src/secp256k1/src/modules/schnorrsig/tests_exhaustive_impl.h b/depend/zcash/src/secp256k1/src/modules/schnorrsig/tests_exhaustive_impl.h
new file mode 100644
index 000000000..b4a428729
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/modules/schnorrsig/tests_exhaustive_impl.h
@@ -0,0 +1,206 @@
+/***********************************************************************
+ * Copyright (c) 2020 Pieter Wuille                                    *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_MODULE_SCHNORRSIG_TESTS_EXHAUSTIVE_H
+#define SECP256K1_MODULE_SCHNORRSIG_TESTS_EXHAUSTIVE_H
+
+#include "include/secp256k1_schnorrsig.h"
+#include "src/modules/schnorrsig/main_impl.h"
+
+static const unsigned char invalid_pubkey_bytes[][32] = {
+    /* 0 */
+    {
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
+    },
+    /* 2 */
+    {
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2
+    },
+    /* order */
+    {
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+        ((EXHAUSTIVE_TEST_ORDER + 0UL) >> 24) & 0xFF,
+        ((EXHAUSTIVE_TEST_ORDER + 0UL) >> 16) & 0xFF,
+        ((EXHAUSTIVE_TEST_ORDER + 0UL) >> 8) & 0xFF,
+        (EXHAUSTIVE_TEST_ORDER + 0UL) & 0xFF
+    },
+    /* order + 1 */
+    {
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+        ((EXHAUSTIVE_TEST_ORDER + 1UL) >> 24) & 0xFF,
+        ((EXHAUSTIVE_TEST_ORDER + 1UL) >> 16) & 0xFF,
+        ((EXHAUSTIVE_TEST_ORDER + 1UL) >> 8) & 0xFF,
+        (EXHAUSTIVE_TEST_ORDER + 1UL) & 0xFF
+    },
+    /* field size */
+    {
+        0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+        0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFE, 0xFF, 0xFF, 0xFC, 0x2F
+    },
+    /* field size + 1 (note that 1 is legal) */
+    {
+        0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+        0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFE, 0xFF, 0xFF, 0xFC, 0x30
+    },
+    /* 2^256 - 1 */
+    {
+        0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+        0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF
+    }
+};
+
+#define NUM_INVALID_KEYS (sizeof(invalid_pubkey_bytes) / sizeof(invalid_pubkey_bytes[0]))
+
+static int secp256k1_hardened_nonce_function_smallint(unsigned char *nonce32, const unsigned char *msg32,
+                                                      const unsigned char *key32, const unsigned char *xonly_pk32,
+                                                      const unsigned char *algo16, void* data) {
+    secp256k1_scalar s;
+    int *idata = data;
+    (void)msg32;
+    (void)key32;
+    (void)xonly_pk32;
+    (void)algo16;
+    secp256k1_scalar_set_int(&s, *idata);
+    secp256k1_scalar_get_b32(nonce32, &s);
+    return 1;
+}
+
+static void test_exhaustive_schnorrsig_verify(const secp256k1_context *ctx, const secp256k1_xonly_pubkey* pubkeys, unsigned char (*xonly_pubkey_bytes)[32], const int* parities) {
+    int d;
+    uint64_t iter = 0;
+    /* Iterate over the possible public keys to verify against (through their corresponding DL d). */
+    for (d = 1; d <= EXHAUSTIVE_TEST_ORDER / 2; ++d) {
+        int actual_d;
+        unsigned k;
+        unsigned char pk32[32];
+        memcpy(pk32, xonly_pubkey_bytes[d - 1], 32);
+        actual_d = parities[d - 1] ? EXHAUSTIVE_TEST_ORDER - d : d;
+        /* Iterate over the possible valid first 32 bytes in the signature, through their corresponding DL k.
+           Values above EXHAUSTIVE_TEST_ORDER/2 refer to the entries in invalid_pubkey_bytes. */
+        for (k = 1; k <= EXHAUSTIVE_TEST_ORDER / 2 + NUM_INVALID_KEYS; ++k) {
+            unsigned char sig64[64];
+            int actual_k = -1;
+            int e_done[EXHAUSTIVE_TEST_ORDER] = {0};
+            int e_count_done = 0;
+            if (skip_section(&iter)) continue;
+            if (k <= EXHAUSTIVE_TEST_ORDER / 2) {
+                memcpy(sig64, xonly_pubkey_bytes[k - 1], 32);
+                actual_k = parities[k - 1] ? EXHAUSTIVE_TEST_ORDER - k : k;
+            } else {
+                memcpy(sig64, invalid_pubkey_bytes[k - 1 - EXHAUSTIVE_TEST_ORDER / 2], 32);
+            }
+            /* Randomly generate messages until all challenges have been hit. */
+            while (e_count_done < EXHAUSTIVE_TEST_ORDER) {
+                secp256k1_scalar e;
+                unsigned char msg32[32];
+                secp256k1_testrand256(msg32);
+                secp256k1_schnorrsig_challenge(&e, sig64, msg32, pk32);
+                /* Only do work if we hit a challenge we haven't tried before. */
+                if (!e_done[e]) {
+                    /* Iterate over the possible valid last 32 bytes in the signature.
+                       0..order=that s value; order+1=random bytes */
+                    int count_valid = 0, s;
+                    for (s = 0; s <= EXHAUSTIVE_TEST_ORDER + 1; ++s) {
+                        int expect_valid, valid;
+                        if (s <= EXHAUSTIVE_TEST_ORDER) {
+                            secp256k1_scalar s_s;
+                            secp256k1_scalar_set_int(&s_s, s);
+                            secp256k1_scalar_get_b32(sig64 + 32, &s_s);
+                            expect_valid = actual_k != -1 && s != EXHAUSTIVE_TEST_ORDER &&
+                                           (s_s == (actual_k + actual_d * e) % EXHAUSTIVE_TEST_ORDER);
+                        } else {
+                            secp256k1_testrand256(sig64 + 32);
+                            expect_valid = 0;
+                        }
+                        valid = secp256k1_schnorrsig_verify(ctx, sig64, msg32, &pubkeys[d - 1]);
+                        CHECK(valid == expect_valid);
+                        count_valid += valid;
+                    }
+                    /* Exactly one s value must verify, unless R is illegal. */
+                    CHECK(count_valid == (actual_k != -1));
+                    /* Don't retry other messages that result in the same challenge. */
+                    e_done[e] = 1;
+                    ++e_count_done;
+                }
+            }
+        }
+    }
+}
+
+static void test_exhaustive_schnorrsig_sign(const secp256k1_context *ctx, unsigned char (*xonly_pubkey_bytes)[32], const secp256k1_keypair* keypairs, const int* parities) {
+    int d, k;
+    uint64_t iter = 0;
+    /* Loop over keys. */
+    for (d = 1; d < EXHAUSTIVE_TEST_ORDER; ++d) {
+        int actual_d = d;
+        if (parities[d - 1]) actual_d = EXHAUSTIVE_TEST_ORDER - d;
+        /* Loop over nonces. */
+        for (k = 1; k < EXHAUSTIVE_TEST_ORDER; ++k) {
+            int e_done[EXHAUSTIVE_TEST_ORDER] = {0};
+            int e_count_done = 0;
+            unsigned char msg32[32];
+            unsigned char sig64[64];
+            int actual_k = k;
+            if (skip_section(&iter)) continue;
+            if (parities[k - 1]) actual_k = EXHAUSTIVE_TEST_ORDER - k;
+            /* Generate random messages until all challenges have been tried. */
+            while (e_count_done < EXHAUSTIVE_TEST_ORDER) {
+                secp256k1_scalar e;
+                secp256k1_testrand256(msg32);
+                secp256k1_schnorrsig_challenge(&e, xonly_pubkey_bytes[k - 1], msg32, xonly_pubkey_bytes[d - 1]);
+                /* Only do work if we hit a challenge we haven't tried before. */
+                if (!e_done[e]) {
+                    secp256k1_scalar expected_s = (actual_k + e * actual_d) % EXHAUSTIVE_TEST_ORDER;
+                    unsigned char expected_s_bytes[32];
+                    secp256k1_scalar_get_b32(expected_s_bytes, &expected_s);
+                    /* Invoke the real function to construct a signature. */
+                    CHECK(secp256k1_schnorrsig_sign(ctx, sig64, msg32, &keypairs[d - 1], secp256k1_hardened_nonce_function_smallint, &k));
+                    /* The first 32 bytes must match the xonly pubkey for the specified k. */
+                    CHECK(secp256k1_memcmp_var(sig64, xonly_pubkey_bytes[k - 1], 32) == 0);
+                    /* The last 32 bytes must match the expected s value. */
+                    CHECK(secp256k1_memcmp_var(sig64 + 32, expected_s_bytes, 32) == 0);
+                    /* Don't retry other messages that result in the same challenge. */
+                    e_done[e] = 1;
+                    ++e_count_done;
+                }
+            }
+        }
+    }
+}
+
+static void test_exhaustive_schnorrsig(const secp256k1_context *ctx) {
+    secp256k1_keypair keypair[EXHAUSTIVE_TEST_ORDER - 1];
+    secp256k1_xonly_pubkey xonly_pubkey[EXHAUSTIVE_TEST_ORDER - 1];
+    int parity[EXHAUSTIVE_TEST_ORDER - 1];
+    unsigned char xonly_pubkey_bytes[EXHAUSTIVE_TEST_ORDER - 1][32];
+    unsigned i;
+
+    /* Verify that all invalid_pubkey_bytes are actually invalid. */
+    for (i = 0; i < NUM_INVALID_KEYS; ++i) {
+        secp256k1_xonly_pubkey pk;
+        CHECK(!secp256k1_xonly_pubkey_parse(ctx, &pk, invalid_pubkey_bytes[i]));
+    }
+
+    /* Construct keypairs and xonly-pubkeys for the entire group. */
+    for (i = 1; i < EXHAUSTIVE_TEST_ORDER; ++i) {
+        secp256k1_scalar scalar_i;
+        unsigned char buf[32];
+        secp256k1_scalar_set_int(&scalar_i, i);
+        secp256k1_scalar_get_b32(buf, &scalar_i);
+        CHECK(secp256k1_keypair_create(ctx, &keypair[i - 1], buf));
+        CHECK(secp256k1_keypair_xonly_pub(ctx, &xonly_pubkey[i - 1], &parity[i - 1], &keypair[i - 1]));
+        CHECK(secp256k1_xonly_pubkey_serialize(ctx, xonly_pubkey_bytes[i - 1], &xonly_pubkey[i - 1]));
+    }
+
+    test_exhaustive_schnorrsig_sign(ctx, xonly_pubkey_bytes, keypair, parity);
+    test_exhaustive_schnorrsig_verify(ctx, xonly_pubkey, xonly_pubkey_bytes, parity);
+}
+
+#endif
diff --git a/depend/zcash/src/secp256k1/src/modules/schnorrsig/tests_impl.h b/depend/zcash/src/secp256k1/src/modules/schnorrsig/tests_impl.h
new file mode 100644
index 000000000..338462fc9
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/modules/schnorrsig/tests_impl.h
@@ -0,0 +1,806 @@
+/***********************************************************************
+ * Copyright (c) 2018-2020 Andrew Poelstra, Jonas Nick                 *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_MODULE_SCHNORRSIG_TESTS_H
+#define SECP256K1_MODULE_SCHNORRSIG_TESTS_H
+
+#include "secp256k1_schnorrsig.h"
+
+/* Checks that a bit flip in the n_flip-th argument (that has n_bytes many
+ * bytes) changes the hash function
+ */
+void nonce_function_bip340_bitflip(unsigned char **args, size_t n_flip, size_t n_bytes) {
+    unsigned char nonces[2][32];
+    CHECK(nonce_function_bip340(nonces[0], args[0], args[1], args[2], args[3], args[4]) == 1);
+    secp256k1_testrand_flip(args[n_flip], n_bytes);
+    CHECK(nonce_function_bip340(nonces[1], args[0], args[1], args[2], args[3], args[4]) == 1);
+    CHECK(secp256k1_memcmp_var(nonces[0], nonces[1], 32) != 0);
+}
+
+/* Tests for the equality of two sha256 structs. This function only produces a
+ * correct result if an integer multiple of 64 many bytes have been written
+ * into the hash functions. */
+void test_sha256_eq(const secp256k1_sha256 *sha1, const secp256k1_sha256 *sha2) {
+    /* Is buffer fully consumed? */
+    CHECK((sha1->bytes & 0x3F) == 0);
+
+    CHECK(sha1->bytes == sha2->bytes);
+    CHECK(secp256k1_memcmp_var(sha1->s, sha2->s, sizeof(sha1->s)) == 0);
+}
+
+void run_nonce_function_bip340_tests(void) {
+    unsigned char tag[13] = "BIP0340/nonce";
+    unsigned char aux_tag[11] = "BIP0340/aux";
+    unsigned char algo16[16] = "BIP0340/nonce\0\0\0";
+    secp256k1_sha256 sha;
+    secp256k1_sha256 sha_optimized;
+    unsigned char nonce[32];
+    unsigned char msg[32];
+    unsigned char key[32];
+    unsigned char pk[32];
+    unsigned char aux_rand[32];
+    unsigned char *args[5];
+    int i;
+
+    /* Check that hash initialized by
+     * secp256k1_nonce_function_bip340_sha256_tagged has the expected
+     * state. */
+    secp256k1_sha256_initialize_tagged(&sha, tag, sizeof(tag));
+    secp256k1_nonce_function_bip340_sha256_tagged(&sha_optimized);
+    test_sha256_eq(&sha, &sha_optimized);
+
+   /* Check that hash initialized by
+    * secp256k1_nonce_function_bip340_sha256_tagged_aux has the expected
+    * state. */
+    secp256k1_sha256_initialize_tagged(&sha, aux_tag, sizeof(aux_tag));
+    secp256k1_nonce_function_bip340_sha256_tagged_aux(&sha_optimized);
+    test_sha256_eq(&sha, &sha_optimized);
+
+    secp256k1_testrand256(msg);
+    secp256k1_testrand256(key);
+    secp256k1_testrand256(pk);
+    secp256k1_testrand256(aux_rand);
+
+    /* Check that a bitflip in an argument results in different nonces. */
+    args[0] = msg;
+    args[1] = key;
+    args[2] = pk;
+    args[3] = algo16;
+    args[4] = aux_rand;
+    for (i = 0; i < count; i++) {
+        nonce_function_bip340_bitflip(args, 0, 32);
+        nonce_function_bip340_bitflip(args, 1, 32);
+        nonce_function_bip340_bitflip(args, 2, 32);
+        /* Flip algo16 special case "BIP0340/nonce" */
+        nonce_function_bip340_bitflip(args, 3, 16);
+        /* Flip algo16 again */
+        nonce_function_bip340_bitflip(args, 3, 16);
+        nonce_function_bip340_bitflip(args, 4, 32);
+    }
+
+    /* NULL algo16 is disallowed */
+    CHECK(nonce_function_bip340(nonce, msg, key, pk, NULL, NULL) == 0);
+    /* Empty algo16 is fine */
+    memset(algo16, 0x00, 16);
+    CHECK(nonce_function_bip340(nonce, msg, key, pk, algo16, NULL) == 1);
+    /* algo16 with terminating null bytes is fine */
+    algo16[1] = 65;
+    CHECK(nonce_function_bip340(nonce, msg, key, pk, algo16, NULL) == 1);
+    /* Other algo16 is fine */
+    memset(algo16, 0xFF, 16);
+    CHECK(nonce_function_bip340(nonce, msg, key, pk, algo16, NULL) == 1);
+
+    /* NULL aux_rand argument is allowed. */
+    CHECK(nonce_function_bip340(nonce, msg, key, pk, algo16, NULL) == 1);
+}
+
+void test_schnorrsig_api(void) {
+    unsigned char sk1[32];
+    unsigned char sk2[32];
+    unsigned char sk3[32];
+    unsigned char msg[32];
+    secp256k1_keypair keypairs[3];
+    secp256k1_keypair invalid_keypair = { 0 };
+    secp256k1_xonly_pubkey pk[3];
+    secp256k1_xonly_pubkey zero_pk;
+    unsigned char sig[64];
+
+    /** setup **/
+    secp256k1_context *none = secp256k1_context_create(SECP256K1_CONTEXT_NONE);
+    secp256k1_context *sign = secp256k1_context_create(SECP256K1_CONTEXT_SIGN);
+    secp256k1_context *vrfy = secp256k1_context_create(SECP256K1_CONTEXT_VERIFY);
+    secp256k1_context *both = secp256k1_context_create(SECP256K1_CONTEXT_SIGN | SECP256K1_CONTEXT_VERIFY);
+    int ecount;
+
+    secp256k1_context_set_error_callback(none, counting_illegal_callback_fn, &ecount);
+    secp256k1_context_set_error_callback(sign, counting_illegal_callback_fn, &ecount);
+    secp256k1_context_set_error_callback(vrfy, counting_illegal_callback_fn, &ecount);
+    secp256k1_context_set_error_callback(both, counting_illegal_callback_fn, &ecount);
+    secp256k1_context_set_illegal_callback(none, counting_illegal_callback_fn, &ecount);
+    secp256k1_context_set_illegal_callback(sign, counting_illegal_callback_fn, &ecount);
+    secp256k1_context_set_illegal_callback(vrfy, counting_illegal_callback_fn, &ecount);
+    secp256k1_context_set_illegal_callback(both, counting_illegal_callback_fn, &ecount);
+
+    secp256k1_testrand256(sk1);
+    secp256k1_testrand256(sk2);
+    secp256k1_testrand256(sk3);
+    secp256k1_testrand256(msg);
+    CHECK(secp256k1_keypair_create(ctx, &keypairs[0], sk1) == 1);
+    CHECK(secp256k1_keypair_create(ctx, &keypairs[1], sk2) == 1);
+    CHECK(secp256k1_keypair_create(ctx, &keypairs[2], sk3) == 1);
+    CHECK(secp256k1_keypair_xonly_pub(ctx, &pk[0], NULL, &keypairs[0]) == 1);
+    CHECK(secp256k1_keypair_xonly_pub(ctx, &pk[1], NULL, &keypairs[1]) == 1);
+    CHECK(secp256k1_keypair_xonly_pub(ctx, &pk[2], NULL, &keypairs[2]) == 1);
+    memset(&zero_pk, 0, sizeof(zero_pk));
+
+    /** main test body **/
+    ecount = 0;
+    CHECK(secp256k1_schnorrsig_sign(none, sig, msg, &keypairs[0], NULL, NULL) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_schnorrsig_sign(vrfy, sig, msg, &keypairs[0], NULL, NULL) == 0);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_schnorrsig_sign(sign, sig, msg, &keypairs[0], NULL, NULL) == 1);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_schnorrsig_sign(sign, NULL, msg, &keypairs[0], NULL, NULL) == 0);
+    CHECK(ecount == 3);
+    CHECK(secp256k1_schnorrsig_sign(sign, sig, NULL, &keypairs[0], NULL, NULL) == 0);
+    CHECK(ecount == 4);
+    CHECK(secp256k1_schnorrsig_sign(sign, sig, msg, NULL, NULL, NULL) == 0);
+    CHECK(ecount == 5);
+    CHECK(secp256k1_schnorrsig_sign(sign, sig, msg, &invalid_keypair, NULL, NULL) == 0);
+    CHECK(ecount == 6);
+
+    ecount = 0;
+    CHECK(secp256k1_schnorrsig_sign(sign, sig, msg, &keypairs[0], NULL, NULL) == 1);
+    CHECK(secp256k1_schnorrsig_verify(none, sig, msg, &pk[0]) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_schnorrsig_verify(sign, sig, msg, &pk[0]) == 0);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_schnorrsig_verify(vrfy, sig, msg, &pk[0]) == 1);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_schnorrsig_verify(vrfy, NULL, msg, &pk[0]) == 0);
+    CHECK(ecount == 3);
+    CHECK(secp256k1_schnorrsig_verify(vrfy, sig, NULL, &pk[0]) == 0);
+    CHECK(ecount == 4);
+    CHECK(secp256k1_schnorrsig_verify(vrfy, sig, msg, NULL) == 0);
+    CHECK(ecount == 5);
+    CHECK(secp256k1_schnorrsig_verify(vrfy, sig, msg, &zero_pk) == 0);
+    CHECK(ecount == 6);
+
+    secp256k1_context_destroy(none);
+    secp256k1_context_destroy(sign);
+    secp256k1_context_destroy(vrfy);
+    secp256k1_context_destroy(both);
+}
+
+/* Checks that hash initialized by secp256k1_schnorrsig_sha256_tagged has the
+ * expected state. */
+void test_schnorrsig_sha256_tagged(void) {
+    char tag[17] = "BIP0340/challenge";
+    secp256k1_sha256 sha;
+    secp256k1_sha256 sha_optimized;
+
+    secp256k1_sha256_initialize_tagged(&sha, (unsigned char *) tag, sizeof(tag));
+    secp256k1_schnorrsig_sha256_tagged(&sha_optimized);
+    test_sha256_eq(&sha, &sha_optimized);
+}
+
+/* Helper function for schnorrsig_bip_vectors
+ * Signs the message and checks that it's the same as expected_sig. */
+void test_schnorrsig_bip_vectors_check_signing(const unsigned char *sk, const unsigned char *pk_serialized, unsigned char *aux_rand, const unsigned char *msg, const unsigned char *expected_sig) {
+    unsigned char sig[64];
+    secp256k1_keypair keypair;
+    secp256k1_xonly_pubkey pk, pk_expected;
+
+    CHECK(secp256k1_keypair_create(ctx, &keypair, sk));
+    CHECK(secp256k1_schnorrsig_sign(ctx, sig, msg, &keypair, NULL, aux_rand));
+    CHECK(secp256k1_memcmp_var(sig, expected_sig, 64) == 0);
+
+    CHECK(secp256k1_xonly_pubkey_parse(ctx, &pk_expected, pk_serialized));
+    CHECK(secp256k1_keypair_xonly_pub(ctx, &pk, NULL, &keypair));
+    CHECK(secp256k1_memcmp_var(&pk, &pk_expected, sizeof(pk)) == 0);
+    CHECK(secp256k1_schnorrsig_verify(ctx, sig, msg, &pk));
+}
+
+/* Helper function for schnorrsig_bip_vectors
+ * Checks that both verify and verify_batch (TODO) return the same value as expected. */
+void test_schnorrsig_bip_vectors_check_verify(const unsigned char *pk_serialized, const unsigned char *msg32, const unsigned char *sig, int expected) {
+    secp256k1_xonly_pubkey pk;
+
+    CHECK(secp256k1_xonly_pubkey_parse(ctx, &pk, pk_serialized));
+    CHECK(expected == secp256k1_schnorrsig_verify(ctx, sig, msg32, &pk));
+}
+
+/* Test vectors according to BIP-340 ("Schnorr Signatures for secp256k1"). See
+ * https://github.com/bitcoin/bips/blob/master/bip-0340/test-vectors.csv. */
+void test_schnorrsig_bip_vectors(void) {
+    {
+        /* Test vector 0 */
+        const unsigned char sk[32] = {
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x03
+        };
+        const unsigned char pk[32] = {
+            0xF9, 0x30, 0x8A, 0x01, 0x92, 0x58, 0xC3, 0x10,
+            0x49, 0x34, 0x4F, 0x85, 0xF8, 0x9D, 0x52, 0x29,
+            0xB5, 0x31, 0xC8, 0x45, 0x83, 0x6F, 0x99, 0xB0,
+            0x86, 0x01, 0xF1, 0x13, 0xBC, 0xE0, 0x36, 0xF9
+        };
+        unsigned char aux_rand[32] = {
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+        };
+        const unsigned char msg[32] = {
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00
+        };
+        const unsigned char sig[64] = {
+            0xE9, 0x07, 0x83, 0x1F, 0x80, 0x84, 0x8D, 0x10,
+            0x69, 0xA5, 0x37, 0x1B, 0x40, 0x24, 0x10, 0x36,
+            0x4B, 0xDF, 0x1C, 0x5F, 0x83, 0x07, 0xB0, 0x08,
+            0x4C, 0x55, 0xF1, 0xCE, 0x2D, 0xCA, 0x82, 0x15,
+            0x25, 0xF6, 0x6A, 0x4A, 0x85, 0xEA, 0x8B, 0x71,
+            0xE4, 0x82, 0xA7, 0x4F, 0x38, 0x2D, 0x2C, 0xE5,
+            0xEB, 0xEE, 0xE8, 0xFD, 0xB2, 0x17, 0x2F, 0x47,
+            0x7D, 0xF4, 0x90, 0x0D, 0x31, 0x05, 0x36, 0xC0
+        };
+        test_schnorrsig_bip_vectors_check_signing(sk, pk, aux_rand, msg, sig);
+        test_schnorrsig_bip_vectors_check_verify(pk, msg, sig, 1);
+    }
+    {
+        /* Test vector 1 */
+        const unsigned char sk[32] = {
+            0xB7, 0xE1, 0x51, 0x62, 0x8A, 0xED, 0x2A, 0x6A,
+            0xBF, 0x71, 0x58, 0x80, 0x9C, 0xF4, 0xF3, 0xC7,
+            0x62, 0xE7, 0x16, 0x0F, 0x38, 0xB4, 0xDA, 0x56,
+            0xA7, 0x84, 0xD9, 0x04, 0x51, 0x90, 0xCF, 0xEF
+        };
+        const unsigned char pk[32] = {
+            0xDF, 0xF1, 0xD7, 0x7F, 0x2A, 0x67, 0x1C, 0x5F,
+            0x36, 0x18, 0x37, 0x26, 0xDB, 0x23, 0x41, 0xBE,
+            0x58, 0xFE, 0xAE, 0x1D, 0xA2, 0xDE, 0xCE, 0xD8,
+            0x43, 0x24, 0x0F, 0x7B, 0x50, 0x2B, 0xA6, 0x59
+        };
+        unsigned char aux_rand[32] = {
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01
+        };
+        const unsigned char msg[32] = {
+            0x24, 0x3F, 0x6A, 0x88, 0x85, 0xA3, 0x08, 0xD3,
+            0x13, 0x19, 0x8A, 0x2E, 0x03, 0x70, 0x73, 0x44,
+            0xA4, 0x09, 0x38, 0x22, 0x29, 0x9F, 0x31, 0xD0,
+            0x08, 0x2E, 0xFA, 0x98, 0xEC, 0x4E, 0x6C, 0x89
+        };
+        const unsigned char sig[64] = {
+            0x68, 0x96, 0xBD, 0x60, 0xEE, 0xAE, 0x29, 0x6D,
+            0xB4, 0x8A, 0x22, 0x9F, 0xF7, 0x1D, 0xFE, 0x07,
+            0x1B, 0xDE, 0x41, 0x3E, 0x6D, 0x43, 0xF9, 0x17,
+            0xDC, 0x8D, 0xCF, 0x8C, 0x78, 0xDE, 0x33, 0x41,
+            0x89, 0x06, 0xD1, 0x1A, 0xC9, 0x76, 0xAB, 0xCC,
+            0xB2, 0x0B, 0x09, 0x12, 0x92, 0xBF, 0xF4, 0xEA,
+            0x89, 0x7E, 0xFC, 0xB6, 0x39, 0xEA, 0x87, 0x1C,
+            0xFA, 0x95, 0xF6, 0xDE, 0x33, 0x9E, 0x4B, 0x0A
+        };
+        test_schnorrsig_bip_vectors_check_signing(sk, pk, aux_rand, msg, sig);
+        test_schnorrsig_bip_vectors_check_verify(pk, msg, sig, 1);
+    }
+    {
+        /* Test vector 2 */
+        const unsigned char sk[32] = {
+            0xC9, 0x0F, 0xDA, 0xA2, 0x21, 0x68, 0xC2, 0x34,
+            0xC4, 0xC6, 0x62, 0x8B, 0x80, 0xDC, 0x1C, 0xD1,
+            0x29, 0x02, 0x4E, 0x08, 0x8A, 0x67, 0xCC, 0x74,
+            0x02, 0x0B, 0xBE, 0xA6, 0x3B, 0x14, 0xE5, 0xC9
+        };
+        const unsigned char pk[32] = {
+            0xDD, 0x30, 0x8A, 0xFE, 0xC5, 0x77, 0x7E, 0x13,
+            0x12, 0x1F, 0xA7, 0x2B, 0x9C, 0xC1, 0xB7, 0xCC,
+            0x01, 0x39, 0x71, 0x53, 0x09, 0xB0, 0x86, 0xC9,
+            0x60, 0xE1, 0x8F, 0xD9, 0x69, 0x77, 0x4E, 0xB8
+        };
+        unsigned char aux_rand[32] = {
+            0xC8, 0x7A, 0xA5, 0x38, 0x24, 0xB4, 0xD7, 0xAE,
+            0x2E, 0xB0, 0x35, 0xA2, 0xB5, 0xBB, 0xBC, 0xCC,
+            0x08, 0x0E, 0x76, 0xCD, 0xC6, 0xD1, 0x69, 0x2C,
+            0x4B, 0x0B, 0x62, 0xD7, 0x98, 0xE6, 0xD9, 0x06
+        };
+        const unsigned char msg[32] = {
+            0x7E, 0x2D, 0x58, 0xD8, 0xB3, 0xBC, 0xDF, 0x1A,
+            0xBA, 0xDE, 0xC7, 0x82, 0x90, 0x54, 0xF9, 0x0D,
+            0xDA, 0x98, 0x05, 0xAA, 0xB5, 0x6C, 0x77, 0x33,
+            0x30, 0x24, 0xB9, 0xD0, 0xA5, 0x08, 0xB7, 0x5C
+        };
+        const unsigned char sig[64] = {
+            0x58, 0x31, 0xAA, 0xEE, 0xD7, 0xB4, 0x4B, 0xB7,
+            0x4E, 0x5E, 0xAB, 0x94, 0xBA, 0x9D, 0x42, 0x94,
+            0xC4, 0x9B, 0xCF, 0x2A, 0x60, 0x72, 0x8D, 0x8B,
+            0x4C, 0x20, 0x0F, 0x50, 0xDD, 0x31, 0x3C, 0x1B,
+            0xAB, 0x74, 0x58, 0x79, 0xA5, 0xAD, 0x95, 0x4A,
+            0x72, 0xC4, 0x5A, 0x91, 0xC3, 0xA5, 0x1D, 0x3C,
+            0x7A, 0xDE, 0xA9, 0x8D, 0x82, 0xF8, 0x48, 0x1E,
+            0x0E, 0x1E, 0x03, 0x67, 0x4A, 0x6F, 0x3F, 0xB7
+        };
+        test_schnorrsig_bip_vectors_check_signing(sk, pk, aux_rand, msg, sig);
+        test_schnorrsig_bip_vectors_check_verify(pk, msg, sig, 1);
+    }
+    {
+        /* Test vector 3 */
+        const unsigned char sk[32] = {
+            0x0B, 0x43, 0x2B, 0x26, 0x77, 0x93, 0x73, 0x81,
+            0xAE, 0xF0, 0x5B, 0xB0, 0x2A, 0x66, 0xEC, 0xD0,
+            0x12, 0x77, 0x30, 0x62, 0xCF, 0x3F, 0xA2, 0x54,
+            0x9E, 0x44, 0xF5, 0x8E, 0xD2, 0x40, 0x17, 0x10
+        };
+        const unsigned char pk[32] = {
+            0x25, 0xD1, 0xDF, 0xF9, 0x51, 0x05, 0xF5, 0x25,
+            0x3C, 0x40, 0x22, 0xF6, 0x28, 0xA9, 0x96, 0xAD,
+            0x3A, 0x0D, 0x95, 0xFB, 0xF2, 0x1D, 0x46, 0x8A,
+            0x1B, 0x33, 0xF8, 0xC1, 0x60, 0xD8, 0xF5, 0x17
+        };
+        unsigned char aux_rand[32] = {
+            0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+            0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+            0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+            0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF
+        };
+        const unsigned char msg[32] = {
+            0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+            0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+            0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+            0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF
+        };
+        const unsigned char sig[64] = {
+            0x7E, 0xB0, 0x50, 0x97, 0x57, 0xE2, 0x46, 0xF1,
+            0x94, 0x49, 0x88, 0x56, 0x51, 0x61, 0x1C, 0xB9,
+            0x65, 0xEC, 0xC1, 0xA1, 0x87, 0xDD, 0x51, 0xB6,
+            0x4F, 0xDA, 0x1E, 0xDC, 0x96, 0x37, 0xD5, 0xEC,
+            0x97, 0x58, 0x2B, 0x9C, 0xB1, 0x3D, 0xB3, 0x93,
+            0x37, 0x05, 0xB3, 0x2B, 0xA9, 0x82, 0xAF, 0x5A,
+            0xF2, 0x5F, 0xD7, 0x88, 0x81, 0xEB, 0xB3, 0x27,
+            0x71, 0xFC, 0x59, 0x22, 0xEF, 0xC6, 0x6E, 0xA3
+        };
+        test_schnorrsig_bip_vectors_check_signing(sk, pk, aux_rand, msg, sig);
+        test_schnorrsig_bip_vectors_check_verify(pk, msg, sig, 1);
+    }
+    {
+        /* Test vector 4 */
+        const unsigned char pk[32] = {
+            0xD6, 0x9C, 0x35, 0x09, 0xBB, 0x99, 0xE4, 0x12,
+            0xE6, 0x8B, 0x0F, 0xE8, 0x54, 0x4E, 0x72, 0x83,
+            0x7D, 0xFA, 0x30, 0x74, 0x6D, 0x8B, 0xE2, 0xAA,
+            0x65, 0x97, 0x5F, 0x29, 0xD2, 0x2D, 0xC7, 0xB9
+        };
+        const unsigned char msg[32] = {
+            0x4D, 0xF3, 0xC3, 0xF6, 0x8F, 0xCC, 0x83, 0xB2,
+            0x7E, 0x9D, 0x42, 0xC9, 0x04, 0x31, 0xA7, 0x24,
+            0x99, 0xF1, 0x78, 0x75, 0xC8, 0x1A, 0x59, 0x9B,
+            0x56, 0x6C, 0x98, 0x89, 0xB9, 0x69, 0x67, 0x03
+        };
+        const unsigned char sig[64] = {
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x3B, 0x78, 0xCE, 0x56, 0x3F,
+            0x89, 0xA0, 0xED, 0x94, 0x14, 0xF5, 0xAA, 0x28,
+            0xAD, 0x0D, 0x96, 0xD6, 0x79, 0x5F, 0x9C, 0x63,
+            0x76, 0xAF, 0xB1, 0x54, 0x8A, 0xF6, 0x03, 0xB3,
+            0xEB, 0x45, 0xC9, 0xF8, 0x20, 0x7D, 0xEE, 0x10,
+            0x60, 0xCB, 0x71, 0xC0, 0x4E, 0x80, 0xF5, 0x93,
+            0x06, 0x0B, 0x07, 0xD2, 0x83, 0x08, 0xD7, 0xF4
+        };
+        test_schnorrsig_bip_vectors_check_verify(pk, msg, sig, 1);
+    }
+    {
+        /* Test vector 5 */
+        const unsigned char pk[32] = {
+            0xEE, 0xFD, 0xEA, 0x4C, 0xDB, 0x67, 0x77, 0x50,
+            0xA4, 0x20, 0xFE, 0xE8, 0x07, 0xEA, 0xCF, 0x21,
+            0xEB, 0x98, 0x98, 0xAE, 0x79, 0xB9, 0x76, 0x87,
+            0x66, 0xE4, 0xFA, 0xA0, 0x4A, 0x2D, 0x4A, 0x34
+        };
+        secp256k1_xonly_pubkey pk_parsed;
+        /* No need to check the signature of the test vector as parsing the pubkey already fails */
+        CHECK(!secp256k1_xonly_pubkey_parse(ctx, &pk_parsed, pk));
+    }
+    {
+        /* Test vector 6 */
+        const unsigned char pk[32] = {
+            0xDF, 0xF1, 0xD7, 0x7F, 0x2A, 0x67, 0x1C, 0x5F,
+            0x36, 0x18, 0x37, 0x26, 0xDB, 0x23, 0x41, 0xBE,
+            0x58, 0xFE, 0xAE, 0x1D, 0xA2, 0xDE, 0xCE, 0xD8,
+            0x43, 0x24, 0x0F, 0x7B, 0x50, 0x2B, 0xA6, 0x59
+        };
+        const unsigned char msg[32] = {
+            0x24, 0x3F, 0x6A, 0x88, 0x85, 0xA3, 0x08, 0xD3,
+            0x13, 0x19, 0x8A, 0x2E, 0x03, 0x70, 0x73, 0x44,
+            0xA4, 0x09, 0x38, 0x22, 0x29, 0x9F, 0x31, 0xD0,
+            0x08, 0x2E, 0xFA, 0x98, 0xEC, 0x4E, 0x6C, 0x89
+        };
+        const unsigned char sig[64] = {
+            0xFF, 0xF9, 0x7B, 0xD5, 0x75, 0x5E, 0xEE, 0xA4,
+            0x20, 0x45, 0x3A, 0x14, 0x35, 0x52, 0x35, 0xD3,
+            0x82, 0xF6, 0x47, 0x2F, 0x85, 0x68, 0xA1, 0x8B,
+            0x2F, 0x05, 0x7A, 0x14, 0x60, 0x29, 0x75, 0x56,
+            0x3C, 0xC2, 0x79, 0x44, 0x64, 0x0A, 0xC6, 0x07,
+            0xCD, 0x10, 0x7A, 0xE1, 0x09, 0x23, 0xD9, 0xEF,
+            0x7A, 0x73, 0xC6, 0x43, 0xE1, 0x66, 0xBE, 0x5E,
+            0xBE, 0xAF, 0xA3, 0x4B, 0x1A, 0xC5, 0x53, 0xE2
+        };
+        test_schnorrsig_bip_vectors_check_verify(pk, msg, sig, 0);
+    }
+    {
+        /* Test vector 7 */
+        const unsigned char pk[32] = {
+            0xDF, 0xF1, 0xD7, 0x7F, 0x2A, 0x67, 0x1C, 0x5F,
+            0x36, 0x18, 0x37, 0x26, 0xDB, 0x23, 0x41, 0xBE,
+            0x58, 0xFE, 0xAE, 0x1D, 0xA2, 0xDE, 0xCE, 0xD8,
+            0x43, 0x24, 0x0F, 0x7B, 0x50, 0x2B, 0xA6, 0x59
+        };
+        const unsigned char msg[32] = {
+            0x24, 0x3F, 0x6A, 0x88, 0x85, 0xA3, 0x08, 0xD3,
+            0x13, 0x19, 0x8A, 0x2E, 0x03, 0x70, 0x73, 0x44,
+            0xA4, 0x09, 0x38, 0x22, 0x29, 0x9F, 0x31, 0xD0,
+            0x08, 0x2E, 0xFA, 0x98, 0xEC, 0x4E, 0x6C, 0x89
+        };
+        const unsigned char sig[64] = {
+            0x1F, 0xA6, 0x2E, 0x33, 0x1E, 0xDB, 0xC2, 0x1C,
+            0x39, 0x47, 0x92, 0xD2, 0xAB, 0x11, 0x00, 0xA7,
+            0xB4, 0x32, 0xB0, 0x13, 0xDF, 0x3F, 0x6F, 0xF4,
+            0xF9, 0x9F, 0xCB, 0x33, 0xE0, 0xE1, 0x51, 0x5F,
+            0x28, 0x89, 0x0B, 0x3E, 0xDB, 0x6E, 0x71, 0x89,
+            0xB6, 0x30, 0x44, 0x8B, 0x51, 0x5C, 0xE4, 0xF8,
+            0x62, 0x2A, 0x95, 0x4C, 0xFE, 0x54, 0x57, 0x35,
+            0xAA, 0xEA, 0x51, 0x34, 0xFC, 0xCD, 0xB2, 0xBD
+        };
+        test_schnorrsig_bip_vectors_check_verify(pk, msg, sig, 0);
+    }
+    {
+        /* Test vector 8 */
+        const unsigned char pk[32] = {
+            0xDF, 0xF1, 0xD7, 0x7F, 0x2A, 0x67, 0x1C, 0x5F,
+            0x36, 0x18, 0x37, 0x26, 0xDB, 0x23, 0x41, 0xBE,
+            0x58, 0xFE, 0xAE, 0x1D, 0xA2, 0xDE, 0xCE, 0xD8,
+            0x43, 0x24, 0x0F, 0x7B, 0x50, 0x2B, 0xA6, 0x59
+        };
+        const unsigned char msg[32] = {
+            0x24, 0x3F, 0x6A, 0x88, 0x85, 0xA3, 0x08, 0xD3,
+            0x13, 0x19, 0x8A, 0x2E, 0x03, 0x70, 0x73, 0x44,
+            0xA4, 0x09, 0x38, 0x22, 0x29, 0x9F, 0x31, 0xD0,
+            0x08, 0x2E, 0xFA, 0x98, 0xEC, 0x4E, 0x6C, 0x89
+        };
+        const unsigned char sig[64] = {
+            0x6C, 0xFF, 0x5C, 0x3B, 0xA8, 0x6C, 0x69, 0xEA,
+            0x4B, 0x73, 0x76, 0xF3, 0x1A, 0x9B, 0xCB, 0x4F,
+            0x74, 0xC1, 0x97, 0x60, 0x89, 0xB2, 0xD9, 0x96,
+            0x3D, 0xA2, 0xE5, 0x54, 0x3E, 0x17, 0x77, 0x69,
+            0x96, 0x17, 0x64, 0xB3, 0xAA, 0x9B, 0x2F, 0xFC,
+            0xB6, 0xEF, 0x94, 0x7B, 0x68, 0x87, 0xA2, 0x26,
+            0xE8, 0xD7, 0xC9, 0x3E, 0x00, 0xC5, 0xED, 0x0C,
+            0x18, 0x34, 0xFF, 0x0D, 0x0C, 0x2E, 0x6D, 0xA6
+        };
+        test_schnorrsig_bip_vectors_check_verify(pk, msg, sig, 0);
+    }
+    {
+        /* Test vector 9 */
+        const unsigned char pk[32] = {
+            0xDF, 0xF1, 0xD7, 0x7F, 0x2A, 0x67, 0x1C, 0x5F,
+            0x36, 0x18, 0x37, 0x26, 0xDB, 0x23, 0x41, 0xBE,
+            0x58, 0xFE, 0xAE, 0x1D, 0xA2, 0xDE, 0xCE, 0xD8,
+            0x43, 0x24, 0x0F, 0x7B, 0x50, 0x2B, 0xA6, 0x59
+        };
+        const unsigned char msg[32] = {
+            0x24, 0x3F, 0x6A, 0x88, 0x85, 0xA3, 0x08, 0xD3,
+            0x13, 0x19, 0x8A, 0x2E, 0x03, 0x70, 0x73, 0x44,
+            0xA4, 0x09, 0x38, 0x22, 0x29, 0x9F, 0x31, 0xD0,
+            0x08, 0x2E, 0xFA, 0x98, 0xEC, 0x4E, 0x6C, 0x89
+        };
+        const unsigned char sig[64] = {
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x12, 0x3D, 0xDA, 0x83, 0x28, 0xAF, 0x9C, 0x23,
+            0xA9, 0x4C, 0x1F, 0xEE, 0xCF, 0xD1, 0x23, 0xBA,
+            0x4F, 0xB7, 0x34, 0x76, 0xF0, 0xD5, 0x94, 0xDC,
+            0xB6, 0x5C, 0x64, 0x25, 0xBD, 0x18, 0x60, 0x51
+        };
+        test_schnorrsig_bip_vectors_check_verify(pk, msg, sig, 0);
+    }
+    {
+        /* Test vector 10 */
+        const unsigned char pk[32] = {
+            0xDF, 0xF1, 0xD7, 0x7F, 0x2A, 0x67, 0x1C, 0x5F,
+            0x36, 0x18, 0x37, 0x26, 0xDB, 0x23, 0x41, 0xBE,
+            0x58, 0xFE, 0xAE, 0x1D, 0xA2, 0xDE, 0xCE, 0xD8,
+            0x43, 0x24, 0x0F, 0x7B, 0x50, 0x2B, 0xA6, 0x59
+        };
+        const unsigned char msg[32] = {
+            0x24, 0x3F, 0x6A, 0x88, 0x85, 0xA3, 0x08, 0xD3,
+            0x13, 0x19, 0x8A, 0x2E, 0x03, 0x70, 0x73, 0x44,
+            0xA4, 0x09, 0x38, 0x22, 0x29, 0x9F, 0x31, 0xD0,
+            0x08, 0x2E, 0xFA, 0x98, 0xEC, 0x4E, 0x6C, 0x89
+        };
+        const unsigned char sig[64] = {
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01,
+            0x76, 0x15, 0xFB, 0xAF, 0x5A, 0xE2, 0x88, 0x64,
+            0x01, 0x3C, 0x09, 0x97, 0x42, 0xDE, 0xAD, 0xB4,
+            0xDB, 0xA8, 0x7F, 0x11, 0xAC, 0x67, 0x54, 0xF9,
+            0x37, 0x80, 0xD5, 0xA1, 0x83, 0x7C, 0xF1, 0x97
+        };
+        test_schnorrsig_bip_vectors_check_verify(pk, msg, sig, 0);
+    }
+    {
+        /* Test vector 11 */
+        const unsigned char pk[32] = {
+            0xDF, 0xF1, 0xD7, 0x7F, 0x2A, 0x67, 0x1C, 0x5F,
+            0x36, 0x18, 0x37, 0x26, 0xDB, 0x23, 0x41, 0xBE,
+            0x58, 0xFE, 0xAE, 0x1D, 0xA2, 0xDE, 0xCE, 0xD8,
+            0x43, 0x24, 0x0F, 0x7B, 0x50, 0x2B, 0xA6, 0x59
+        };
+        const unsigned char msg[32] = {
+            0x24, 0x3F, 0x6A, 0x88, 0x85, 0xA3, 0x08, 0xD3,
+            0x13, 0x19, 0x8A, 0x2E, 0x03, 0x70, 0x73, 0x44,
+            0xA4, 0x09, 0x38, 0x22, 0x29, 0x9F, 0x31, 0xD0,
+            0x08, 0x2E, 0xFA, 0x98, 0xEC, 0x4E, 0x6C, 0x89
+        };
+        const unsigned char sig[64] = {
+            0x4A, 0x29, 0x8D, 0xAC, 0xAE, 0x57, 0x39, 0x5A,
+            0x15, 0xD0, 0x79, 0x5D, 0xDB, 0xFD, 0x1D, 0xCB,
+            0x56, 0x4D, 0xA8, 0x2B, 0x0F, 0x26, 0x9B, 0xC7,
+            0x0A, 0x74, 0xF8, 0x22, 0x04, 0x29, 0xBA, 0x1D,
+            0x69, 0xE8, 0x9B, 0x4C, 0x55, 0x64, 0xD0, 0x03,
+            0x49, 0x10, 0x6B, 0x84, 0x97, 0x78, 0x5D, 0xD7,
+            0xD1, 0xD7, 0x13, 0xA8, 0xAE, 0x82, 0xB3, 0x2F,
+            0xA7, 0x9D, 0x5F, 0x7F, 0xC4, 0x07, 0xD3, 0x9B
+        };
+        test_schnorrsig_bip_vectors_check_verify(pk, msg, sig, 0);
+    }
+    {
+        /* Test vector 12 */
+        const unsigned char pk[32] = {
+            0xDF, 0xF1, 0xD7, 0x7F, 0x2A, 0x67, 0x1C, 0x5F,
+            0x36, 0x18, 0x37, 0x26, 0xDB, 0x23, 0x41, 0xBE,
+            0x58, 0xFE, 0xAE, 0x1D, 0xA2, 0xDE, 0xCE, 0xD8,
+            0x43, 0x24, 0x0F, 0x7B, 0x50, 0x2B, 0xA6, 0x59
+        };
+        const unsigned char msg[32] = {
+            0x24, 0x3F, 0x6A, 0x88, 0x85, 0xA3, 0x08, 0xD3,
+            0x13, 0x19, 0x8A, 0x2E, 0x03, 0x70, 0x73, 0x44,
+            0xA4, 0x09, 0x38, 0x22, 0x29, 0x9F, 0x31, 0xD0,
+            0x08, 0x2E, 0xFA, 0x98, 0xEC, 0x4E, 0x6C, 0x89
+        };
+        const unsigned char sig[64] = {
+            0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+            0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+            0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+            0xFF, 0xFF, 0xFF, 0xFE, 0xFF, 0xFF, 0xFC, 0x2F,
+            0x69, 0xE8, 0x9B, 0x4C, 0x55, 0x64, 0xD0, 0x03,
+            0x49, 0x10, 0x6B, 0x84, 0x97, 0x78, 0x5D, 0xD7,
+            0xD1, 0xD7, 0x13, 0xA8, 0xAE, 0x82, 0xB3, 0x2F,
+            0xA7, 0x9D, 0x5F, 0x7F, 0xC4, 0x07, 0xD3, 0x9B
+        };
+        test_schnorrsig_bip_vectors_check_verify(pk, msg, sig, 0);
+    }
+    {
+        /* Test vector 13 */
+        const unsigned char pk[32] = {
+            0xDF, 0xF1, 0xD7, 0x7F, 0x2A, 0x67, 0x1C, 0x5F,
+            0x36, 0x18, 0x37, 0x26, 0xDB, 0x23, 0x41, 0xBE,
+            0x58, 0xFE, 0xAE, 0x1D, 0xA2, 0xDE, 0xCE, 0xD8,
+            0x43, 0x24, 0x0F, 0x7B, 0x50, 0x2B, 0xA6, 0x59
+        };
+        const unsigned char msg[32] = {
+            0x24, 0x3F, 0x6A, 0x88, 0x85, 0xA3, 0x08, 0xD3,
+            0x13, 0x19, 0x8A, 0x2E, 0x03, 0x70, 0x73, 0x44,
+            0xA4, 0x09, 0x38, 0x22, 0x29, 0x9F, 0x31, 0xD0,
+            0x08, 0x2E, 0xFA, 0x98, 0xEC, 0x4E, 0x6C, 0x89
+        };
+        const unsigned char sig[64] = {
+            0x6C, 0xFF, 0x5C, 0x3B, 0xA8, 0x6C, 0x69, 0xEA,
+            0x4B, 0x73, 0x76, 0xF3, 0x1A, 0x9B, 0xCB, 0x4F,
+            0x74, 0xC1, 0x97, 0x60, 0x89, 0xB2, 0xD9, 0x96,
+            0x3D, 0xA2, 0xE5, 0x54, 0x3E, 0x17, 0x77, 0x69,
+            0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+            0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFE,
+            0xBA, 0xAE, 0xDC, 0xE6, 0xAF, 0x48, 0xA0, 0x3B,
+            0xBF, 0xD2, 0x5E, 0x8C, 0xD0, 0x36, 0x41, 0x41
+        };
+        test_schnorrsig_bip_vectors_check_verify(pk, msg, sig, 0);
+    }
+    {
+        /* Test vector 14 */
+        const unsigned char pk[32] = {
+            0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+            0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+            0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+            0xFF, 0xFF, 0xFF, 0xFE, 0xFF, 0xFF, 0xFC, 0x30
+        };
+        secp256k1_xonly_pubkey pk_parsed;
+        /* No need to check the signature of the test vector as parsing the pubkey already fails */
+        CHECK(!secp256k1_xonly_pubkey_parse(ctx, &pk_parsed, pk));
+    }
+}
+
+/* Nonce function that returns constant 0 */
+static int nonce_function_failing(unsigned char *nonce32, const unsigned char *msg32, const unsigned char *key32, const unsigned char *xonly_pk32, const unsigned char *algo16, void *data) {
+    (void) msg32;
+    (void) key32;
+    (void) xonly_pk32;
+    (void) algo16;
+    (void) data;
+    (void) nonce32;
+    return 0;
+}
+
+/* Nonce function that sets nonce to 0 */
+static int nonce_function_0(unsigned char *nonce32, const unsigned char *msg32, const unsigned char *key32, const unsigned char *xonly_pk32, const unsigned char *algo16, void *data) {
+    (void) msg32;
+    (void) key32;
+    (void) xonly_pk32;
+    (void) algo16;
+    (void) data;
+
+    memset(nonce32, 0, 32);
+    return 1;
+}
+
+/* Nonce function that sets nonce to 0xFF...0xFF */
+static int nonce_function_overflowing(unsigned char *nonce32, const unsigned char *msg32, const unsigned char *key32, const unsigned char *xonly_pk32, const unsigned char *algo16, void *data) {
+    (void) msg32;
+    (void) key32;
+    (void) xonly_pk32;
+    (void) algo16;
+    (void) data;
+
+    memset(nonce32, 0xFF, 32);
+    return 1;
+}
+
+void test_schnorrsig_sign(void) {
+    unsigned char sk[32];
+    secp256k1_keypair keypair;
+    const unsigned char msg[32] = "this is a msg for a schnorrsig..";
+    unsigned char sig[64];
+    unsigned char zeros64[64] = { 0 };
+
+    secp256k1_testrand256(sk);
+    CHECK(secp256k1_keypair_create(ctx, &keypair, sk));
+    CHECK(secp256k1_schnorrsig_sign(ctx, sig, msg, &keypair, NULL, NULL) == 1);
+
+    /* Test different nonce functions */
+    memset(sig, 1, sizeof(sig));
+    CHECK(secp256k1_schnorrsig_sign(ctx, sig, msg, &keypair, nonce_function_failing, NULL) == 0);
+    CHECK(secp256k1_memcmp_var(sig, zeros64, sizeof(sig)) == 0);
+    memset(&sig, 1, sizeof(sig));
+    CHECK(secp256k1_schnorrsig_sign(ctx, sig, msg, &keypair, nonce_function_0, NULL) == 0);
+    CHECK(secp256k1_memcmp_var(sig, zeros64, sizeof(sig)) == 0);
+    CHECK(secp256k1_schnorrsig_sign(ctx, sig, msg, &keypair, nonce_function_overflowing, NULL) == 1);
+    CHECK(secp256k1_memcmp_var(sig, zeros64, sizeof(sig)) != 0);
+}
+
+#define N_SIGS 3
+/* Creates N_SIGS valid signatures and verifies them with verify and
+ * verify_batch (TODO). Then flips some bits and checks that verification now
+ * fails. */
+void test_schnorrsig_sign_verify(void) {
+    unsigned char sk[32];
+    unsigned char msg[N_SIGS][32];
+    unsigned char sig[N_SIGS][64];
+    size_t i;
+    secp256k1_keypair keypair;
+    secp256k1_xonly_pubkey pk;
+    secp256k1_scalar s;
+
+    secp256k1_testrand256(sk);
+    CHECK(secp256k1_keypair_create(ctx, &keypair, sk));
+    CHECK(secp256k1_keypair_xonly_pub(ctx, &pk, NULL, &keypair));
+
+    for (i = 0; i < N_SIGS; i++) {
+        secp256k1_testrand256(msg[i]);
+        CHECK(secp256k1_schnorrsig_sign(ctx, sig[i], msg[i], &keypair, NULL, NULL));
+        CHECK(secp256k1_schnorrsig_verify(ctx, sig[i], msg[i], &pk));
+    }
+
+    {
+        /* Flip a few bits in the signature and in the message and check that
+         * verify and verify_batch (TODO) fail */
+        size_t sig_idx = secp256k1_testrand_int(N_SIGS);
+        size_t byte_idx = secp256k1_testrand_int(32);
+        unsigned char xorbyte = secp256k1_testrand_int(254)+1;
+        sig[sig_idx][byte_idx] ^= xorbyte;
+        CHECK(!secp256k1_schnorrsig_verify(ctx, sig[sig_idx], msg[sig_idx], &pk));
+        sig[sig_idx][byte_idx] ^= xorbyte;
+
+        byte_idx = secp256k1_testrand_int(32);
+        sig[sig_idx][32+byte_idx] ^= xorbyte;
+        CHECK(!secp256k1_schnorrsig_verify(ctx, sig[sig_idx], msg[sig_idx], &pk));
+        sig[sig_idx][32+byte_idx] ^= xorbyte;
+
+        byte_idx = secp256k1_testrand_int(32);
+        msg[sig_idx][byte_idx] ^= xorbyte;
+        CHECK(!secp256k1_schnorrsig_verify(ctx, sig[sig_idx], msg[sig_idx], &pk));
+        msg[sig_idx][byte_idx] ^= xorbyte;
+
+        /* Check that above bitflips have been reversed correctly */
+        CHECK(secp256k1_schnorrsig_verify(ctx, sig[sig_idx], msg[sig_idx], &pk));
+    }
+
+    /* Test overflowing s */
+    CHECK(secp256k1_schnorrsig_sign(ctx, sig[0], msg[0], &keypair, NULL, NULL));
+    CHECK(secp256k1_schnorrsig_verify(ctx, sig[0], msg[0], &pk));
+    memset(&sig[0][32], 0xFF, 32);
+    CHECK(!secp256k1_schnorrsig_verify(ctx, sig[0], msg[0], &pk));
+
+    /* Test negative s */
+    CHECK(secp256k1_schnorrsig_sign(ctx, sig[0], msg[0], &keypair, NULL, NULL));
+    CHECK(secp256k1_schnorrsig_verify(ctx, sig[0], msg[0], &pk));
+    secp256k1_scalar_set_b32(&s, &sig[0][32], NULL);
+    secp256k1_scalar_negate(&s, &s);
+    secp256k1_scalar_get_b32(&sig[0][32], &s);
+    CHECK(!secp256k1_schnorrsig_verify(ctx, sig[0], msg[0], &pk));
+}
+#undef N_SIGS
+
+void test_schnorrsig_taproot(void) {
+    unsigned char sk[32];
+    secp256k1_keypair keypair;
+    secp256k1_xonly_pubkey internal_pk;
+    unsigned char internal_pk_bytes[32];
+    secp256k1_xonly_pubkey output_pk;
+    unsigned char output_pk_bytes[32];
+    unsigned char tweak[32];
+    int pk_parity;
+    unsigned char msg[32];
+    unsigned char sig[64];
+
+    /* Create output key */
+    secp256k1_testrand256(sk);
+    CHECK(secp256k1_keypair_create(ctx, &keypair, sk) == 1);
+    CHECK(secp256k1_keypair_xonly_pub(ctx, &internal_pk, NULL, &keypair) == 1);
+    /* In actual taproot the tweak would be hash of internal_pk */
+    CHECK(secp256k1_xonly_pubkey_serialize(ctx, tweak, &internal_pk) == 1);
+    CHECK(secp256k1_keypair_xonly_tweak_add(ctx, &keypair, tweak) == 1);
+    CHECK(secp256k1_keypair_xonly_pub(ctx, &output_pk, &pk_parity, &keypair) == 1);
+    CHECK(secp256k1_xonly_pubkey_serialize(ctx, output_pk_bytes, &output_pk) == 1);
+
+    /* Key spend */
+    secp256k1_testrand256(msg);
+    CHECK(secp256k1_schnorrsig_sign(ctx, sig, msg, &keypair, NULL, NULL) == 1);
+    /* Verify key spend */
+    CHECK(secp256k1_xonly_pubkey_parse(ctx, &output_pk, output_pk_bytes) == 1);
+    CHECK(secp256k1_schnorrsig_verify(ctx, sig, msg, &output_pk) == 1);
+
+    /* Script spend */
+    CHECK(secp256k1_xonly_pubkey_serialize(ctx, internal_pk_bytes, &internal_pk) == 1);
+    /* Verify script spend */
+    CHECK(secp256k1_xonly_pubkey_parse(ctx, &internal_pk, internal_pk_bytes) == 1);
+    CHECK(secp256k1_xonly_pubkey_tweak_add_check(ctx, output_pk_bytes, pk_parity, &internal_pk, tweak) == 1);
+}
+
+void run_schnorrsig_tests(void) {
+    int i;
+    run_nonce_function_bip340_tests();
+
+    test_schnorrsig_api();
+    test_schnorrsig_sha256_tagged();
+    test_schnorrsig_bip_vectors();
+    for (i = 0; i < count; i++) {
+        test_schnorrsig_sign();
+        test_schnorrsig_sign_verify();
+    }
+    test_schnorrsig_taproot();
+}
+
+#endif
diff --git a/depend/zcash/src/secp256k1/src/num.h b/depend/zcash/src/secp256k1/src/num.h
new file mode 100644
index 000000000..59a5cf2d7
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/num.h
@@ -0,0 +1,74 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_NUM_H
+#define SECP256K1_NUM_H
+
+#ifndef USE_NUM_NONE
+
+#if defined HAVE_CONFIG_H
+#include "libsecp256k1-config.h"
+#endif
+
+#if defined(USE_NUM_GMP)
+#include "num_gmp.h"
+#else
+#error "Please select num implementation"
+#endif
+
+/** Copy a number. */
+static void secp256k1_num_copy(secp256k1_num *r, const secp256k1_num *a);
+
+/** Convert a number's absolute value to a binary big-endian string.
+ *  There must be enough place. */
+static void secp256k1_num_get_bin(unsigned char *r, unsigned int rlen, const secp256k1_num *a);
+
+/** Set a number to the value of a binary big-endian string. */
+static void secp256k1_num_set_bin(secp256k1_num *r, const unsigned char *a, unsigned int alen);
+
+/** Compute a modular inverse. The input must be less than the modulus. */
+static void secp256k1_num_mod_inverse(secp256k1_num *r, const secp256k1_num *a, const secp256k1_num *m);
+
+/** Compute the jacobi symbol (a|b). b must be positive and odd. */
+static int secp256k1_num_jacobi(const secp256k1_num *a, const secp256k1_num *b);
+
+/** Compare the absolute value of two numbers. */
+static int secp256k1_num_cmp(const secp256k1_num *a, const secp256k1_num *b);
+
+/** Test whether two number are equal (including sign). */
+static int secp256k1_num_eq(const secp256k1_num *a, const secp256k1_num *b);
+
+/** Add two (signed) numbers. */
+static void secp256k1_num_add(secp256k1_num *r, const secp256k1_num *a, const secp256k1_num *b);
+
+/** Subtract two (signed) numbers. */
+static void secp256k1_num_sub(secp256k1_num *r, const secp256k1_num *a, const secp256k1_num *b);
+
+/** Multiply two (signed) numbers. */
+static void secp256k1_num_mul(secp256k1_num *r, const secp256k1_num *a, const secp256k1_num *b);
+
+/** Replace a number by its remainder modulo m. M's sign is ignored. The result is a number between 0 and m-1,
+    even if r was negative. */
+static void secp256k1_num_mod(secp256k1_num *r, const secp256k1_num *m);
+
+/** Right-shift the passed number by bits bits. */
+static void secp256k1_num_shift(secp256k1_num *r, int bits);
+
+/** Check whether a number is zero. */
+static int secp256k1_num_is_zero(const secp256k1_num *a);
+
+/** Check whether a number is one. */
+static int secp256k1_num_is_one(const secp256k1_num *a);
+
+/** Check whether a number is strictly negative. */
+static int secp256k1_num_is_neg(const secp256k1_num *a);
+
+/** Change a number's sign. */
+static void secp256k1_num_negate(secp256k1_num *r);
+
+#endif
+
+#endif /* SECP256K1_NUM_H */
diff --git a/depend/zcash/src/secp256k1/src/num_gmp.h b/depend/zcash/src/secp256k1/src/num_gmp.h
new file mode 100644
index 000000000..cc6c51a5f
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/num_gmp.h
@@ -0,0 +1,20 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_NUM_REPR_H
+#define SECP256K1_NUM_REPR_H
+
+#include <gmp.h>
+
+#define NUM_LIMBS ((256+GMP_NUMB_BITS-1)/GMP_NUMB_BITS)
+
+typedef struct {
+    mp_limb_t data[2*NUM_LIMBS];
+    int neg;
+    int limbs;
+} secp256k1_num;
+
+#endif /* SECP256K1_NUM_REPR_H */
diff --git a/depend/zcash/src/secp256k1/src/num_gmp_impl.h b/depend/zcash/src/secp256k1/src/num_gmp_impl.h
new file mode 100644
index 000000000..c07947dd9
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/num_gmp_impl.h
@@ -0,0 +1,288 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_NUM_REPR_IMPL_H
+#define SECP256K1_NUM_REPR_IMPL_H
+
+#include <string.h>
+#include <stdlib.h>
+#include <gmp.h>
+
+#include "util.h"
+#include "num.h"
+
+#ifdef VERIFY
+static void secp256k1_num_sanity(const secp256k1_num *a) {
+    VERIFY_CHECK(a->limbs == 1 || (a->limbs > 1 && a->data[a->limbs-1] != 0));
+}
+#else
+#define secp256k1_num_sanity(a) do { } while(0)
+#endif
+
+static void secp256k1_num_copy(secp256k1_num *r, const secp256k1_num *a) {
+    *r = *a;
+}
+
+static void secp256k1_num_get_bin(unsigned char *r, unsigned int rlen, const secp256k1_num *a) {
+    unsigned char tmp[65];
+    int len = 0;
+    int shift = 0;
+    if (a->limbs>1 || a->data[0] != 0) {
+        len = mpn_get_str(tmp, 256, (mp_limb_t*)a->data, a->limbs);
+    }
+    while (shift < len && tmp[shift] == 0) shift++;
+    VERIFY_CHECK(len-shift <= (int)rlen);
+    memset(r, 0, rlen - len + shift);
+    if (len > shift) {
+        memcpy(r + rlen - len + shift, tmp + shift, len - shift);
+    }
+    memset(tmp, 0, sizeof(tmp));
+}
+
+static void secp256k1_num_set_bin(secp256k1_num *r, const unsigned char *a, unsigned int alen) {
+    int len;
+    VERIFY_CHECK(alen > 0);
+    VERIFY_CHECK(alen <= 64);
+    len = mpn_set_str(r->data, a, alen, 256);
+    if (len == 0) {
+        r->data[0] = 0;
+        len = 1;
+    }
+    VERIFY_CHECK(len <= NUM_LIMBS*2);
+    r->limbs = len;
+    r->neg = 0;
+    while (r->limbs > 1 && r->data[r->limbs-1]==0) {
+        r->limbs--;
+    }
+}
+
+static void secp256k1_num_add_abs(secp256k1_num *r, const secp256k1_num *a, const secp256k1_num *b) {
+    mp_limb_t c = mpn_add(r->data, a->data, a->limbs, b->data, b->limbs);
+    r->limbs = a->limbs;
+    if (c != 0) {
+        VERIFY_CHECK(r->limbs < 2*NUM_LIMBS);
+        r->data[r->limbs++] = c;
+    }
+}
+
+static void secp256k1_num_sub_abs(secp256k1_num *r, const secp256k1_num *a, const secp256k1_num *b) {
+    mp_limb_t c = mpn_sub(r->data, a->data, a->limbs, b->data, b->limbs);
+    (void)c;
+    VERIFY_CHECK(c == 0);
+    r->limbs = a->limbs;
+    while (r->limbs > 1 && r->data[r->limbs-1]==0) {
+        r->limbs--;
+    }
+}
+
+static void secp256k1_num_mod(secp256k1_num *r, const secp256k1_num *m) {
+    secp256k1_num_sanity(r);
+    secp256k1_num_sanity(m);
+
+    if (r->limbs >= m->limbs) {
+        mp_limb_t t[2*NUM_LIMBS];
+        mpn_tdiv_qr(t, r->data, 0, r->data, r->limbs, m->data, m->limbs);
+        memset(t, 0, sizeof(t));
+        r->limbs = m->limbs;
+        while (r->limbs > 1 && r->data[r->limbs-1]==0) {
+            r->limbs--;
+        }
+    }
+
+    if (r->neg && (r->limbs > 1 || r->data[0] != 0)) {
+        secp256k1_num_sub_abs(r, m, r);
+        r->neg = 0;
+    }
+}
+
+static void secp256k1_num_mod_inverse(secp256k1_num *r, const secp256k1_num *a, const secp256k1_num *m) {
+    int i;
+    mp_limb_t g[NUM_LIMBS+1];
+    mp_limb_t u[NUM_LIMBS+1];
+    mp_limb_t v[NUM_LIMBS+1];
+    mp_size_t sn;
+    mp_size_t gn;
+    secp256k1_num_sanity(a);
+    secp256k1_num_sanity(m);
+
+    /** mpn_gcdext computes: (G,S) = gcdext(U,V), where
+     *  * G = gcd(U,V)
+     *  * G = U*S + V*T
+     *  * U has equal or more limbs than V, and V has no padding
+     *  If we set U to be (a padded version of) a, and V = m:
+     *    G = a*S + m*T
+     *    G = a*S mod m
+     *  Assuming G=1:
+     *    S = 1/a mod m
+     */
+    VERIFY_CHECK(m->limbs <= NUM_LIMBS);
+    VERIFY_CHECK(m->data[m->limbs-1] != 0);
+    for (i = 0; i < m->limbs; i++) {
+        u[i] = (i < a->limbs) ? a->data[i] : 0;
+        v[i] = m->data[i];
+    }
+    sn = NUM_LIMBS+1;
+    gn = mpn_gcdext(g, r->data, &sn, u, m->limbs, v, m->limbs);
+    (void)gn;
+    VERIFY_CHECK(gn == 1);
+    VERIFY_CHECK(g[0] == 1);
+    r->neg = a->neg ^ m->neg;
+    if (sn < 0) {
+        mpn_sub(r->data, m->data, m->limbs, r->data, -sn);
+        r->limbs = m->limbs;
+        while (r->limbs > 1 && r->data[r->limbs-1]==0) {
+            r->limbs--;
+        }
+    } else {
+        r->limbs = sn;
+    }
+    memset(g, 0, sizeof(g));
+    memset(u, 0, sizeof(u));
+    memset(v, 0, sizeof(v));
+}
+
+static int secp256k1_num_jacobi(const secp256k1_num *a, const secp256k1_num *b) {
+    int ret;
+    mpz_t ga, gb;
+    secp256k1_num_sanity(a);
+    secp256k1_num_sanity(b);
+    VERIFY_CHECK(!b->neg && (b->limbs > 0) && (b->data[0] & 1));
+
+    mpz_inits(ga, gb, NULL);
+
+    mpz_import(gb, b->limbs, -1, sizeof(mp_limb_t), 0, 0, b->data);
+    mpz_import(ga, a->limbs, -1, sizeof(mp_limb_t), 0, 0, a->data);
+    if (a->neg) {
+        mpz_neg(ga, ga);
+    }
+
+    ret = mpz_jacobi(ga, gb);
+
+    mpz_clears(ga, gb, NULL);
+
+    return ret;
+}
+
+static int secp256k1_num_is_one(const secp256k1_num *a) {
+    return (a->limbs == 1 && a->data[0] == 1);
+}
+
+static int secp256k1_num_is_zero(const secp256k1_num *a) {
+    return (a->limbs == 1 && a->data[0] == 0);
+}
+
+static int secp256k1_num_is_neg(const secp256k1_num *a) {
+    return (a->limbs > 1 || a->data[0] != 0) && a->neg;
+}
+
+static int secp256k1_num_cmp(const secp256k1_num *a, const secp256k1_num *b) {
+    if (a->limbs > b->limbs) {
+        return 1;
+    }
+    if (a->limbs < b->limbs) {
+        return -1;
+    }
+    return mpn_cmp(a->data, b->data, a->limbs);
+}
+
+static int secp256k1_num_eq(const secp256k1_num *a, const secp256k1_num *b) {
+    if (a->limbs > b->limbs) {
+        return 0;
+    }
+    if (a->limbs < b->limbs) {
+        return 0;
+    }
+    if ((a->neg && !secp256k1_num_is_zero(a)) != (b->neg && !secp256k1_num_is_zero(b))) {
+        return 0;
+    }
+    return mpn_cmp(a->data, b->data, a->limbs) == 0;
+}
+
+static void secp256k1_num_subadd(secp256k1_num *r, const secp256k1_num *a, const secp256k1_num *b, int bneg) {
+    if (!(b->neg ^ bneg ^ a->neg)) { /* a and b have the same sign */
+        r->neg = a->neg;
+        if (a->limbs >= b->limbs) {
+            secp256k1_num_add_abs(r, a, b);
+        } else {
+            secp256k1_num_add_abs(r, b, a);
+        }
+    } else {
+        if (secp256k1_num_cmp(a, b) > 0) {
+            r->neg = a->neg;
+            secp256k1_num_sub_abs(r, a, b);
+        } else {
+            r->neg = b->neg ^ bneg;
+            secp256k1_num_sub_abs(r, b, a);
+        }
+    }
+}
+
+static void secp256k1_num_add(secp256k1_num *r, const secp256k1_num *a, const secp256k1_num *b) {
+    secp256k1_num_sanity(a);
+    secp256k1_num_sanity(b);
+    secp256k1_num_subadd(r, a, b, 0);
+}
+
+static void secp256k1_num_sub(secp256k1_num *r, const secp256k1_num *a, const secp256k1_num *b) {
+    secp256k1_num_sanity(a);
+    secp256k1_num_sanity(b);
+    secp256k1_num_subadd(r, a, b, 1);
+}
+
+static void secp256k1_num_mul(secp256k1_num *r, const secp256k1_num *a, const secp256k1_num *b) {
+    mp_limb_t tmp[2*NUM_LIMBS+1];
+    secp256k1_num_sanity(a);
+    secp256k1_num_sanity(b);
+
+    VERIFY_CHECK(a->limbs + b->limbs <= 2*NUM_LIMBS+1);
+    if ((a->limbs==1 && a->data[0]==0) || (b->limbs==1 && b->data[0]==0)) {
+        r->limbs = 1;
+        r->neg = 0;
+        r->data[0] = 0;
+        return;
+    }
+    if (a->limbs >= b->limbs) {
+        mpn_mul(tmp, a->data, a->limbs, b->data, b->limbs);
+    } else {
+        mpn_mul(tmp, b->data, b->limbs, a->data, a->limbs);
+    }
+    r->limbs = a->limbs + b->limbs;
+    if (r->limbs > 1 && tmp[r->limbs - 1]==0) {
+        r->limbs--;
+    }
+    VERIFY_CHECK(r->limbs <= 2*NUM_LIMBS);
+    mpn_copyi(r->data, tmp, r->limbs);
+    r->neg = a->neg ^ b->neg;
+    memset(tmp, 0, sizeof(tmp));
+}
+
+static void secp256k1_num_shift(secp256k1_num *r, int bits) {
+    if (bits % GMP_NUMB_BITS) {
+        /* Shift within limbs. */
+        mpn_rshift(r->data, r->data, r->limbs, bits % GMP_NUMB_BITS);
+    }
+    if (bits >= GMP_NUMB_BITS) {
+        int i;
+        /* Shift full limbs. */
+        for (i = 0; i < r->limbs; i++) {
+            int index = i + (bits / GMP_NUMB_BITS);
+            if (index < r->limbs && index < 2*NUM_LIMBS) {
+                r->data[i] = r->data[index];
+            } else {
+                r->data[i] = 0;
+            }
+        }
+    }
+    while (r->limbs>1 && r->data[r->limbs-1]==0) {
+        r->limbs--;
+    }
+}
+
+static void secp256k1_num_negate(secp256k1_num *r) {
+    r->neg ^= 1;
+}
+
+#endif /* SECP256K1_NUM_REPR_IMPL_H */
diff --git a/depend/zcash/src/secp256k1/src/num_impl.h b/depend/zcash/src/secp256k1/src/num_impl.h
new file mode 100644
index 000000000..880598efe
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/num_impl.h
@@ -0,0 +1,24 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_NUM_IMPL_H
+#define SECP256K1_NUM_IMPL_H
+
+#if defined HAVE_CONFIG_H
+#include "libsecp256k1-config.h"
+#endif
+
+#include "num.h"
+
+#if defined(USE_NUM_GMP)
+#include "num_gmp_impl.h"
+#elif defined(USE_NUM_NONE)
+/* Nothing. */
+#else
+#error "Please select num implementation"
+#endif
+
+#endif /* SECP256K1_NUM_IMPL_H */
diff --git a/depend/zcash/src/secp256k1/src/scalar.h b/depend/zcash/src/secp256k1/src/scalar.h
new file mode 100644
index 000000000..0b737f940
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/scalar.h
@@ -0,0 +1,117 @@
+/***********************************************************************
+ * Copyright (c) 2014 Pieter Wuille                                    *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_SCALAR_H
+#define SECP256K1_SCALAR_H
+
+#include "num.h"
+#include "util.h"
+
+#if defined HAVE_CONFIG_H
+#include "libsecp256k1-config.h"
+#endif
+
+#if defined(EXHAUSTIVE_TEST_ORDER)
+#include "scalar_low.h"
+#elif defined(SECP256K1_WIDEMUL_INT128)
+#include "scalar_4x64.h"
+#elif defined(SECP256K1_WIDEMUL_INT64)
+#include "scalar_8x32.h"
+#else
+#error "Please select wide multiplication implementation"
+#endif
+
+/** Clear a scalar to prevent the leak of sensitive data. */
+static void secp256k1_scalar_clear(secp256k1_scalar *r);
+
+/** Access bits from a scalar. All requested bits must belong to the same 32-bit limb. */
+static unsigned int secp256k1_scalar_get_bits(const secp256k1_scalar *a, unsigned int offset, unsigned int count);
+
+/** Access bits from a scalar. Not constant time. */
+static unsigned int secp256k1_scalar_get_bits_var(const secp256k1_scalar *a, unsigned int offset, unsigned int count);
+
+/** Set a scalar from a big endian byte array. The scalar will be reduced modulo group order `n`.
+ * In:      bin:        pointer to a 32-byte array.
+ * Out:     r:          scalar to be set.
+ *          overflow:   non-zero if the scalar was bigger or equal to `n` before reduction, zero otherwise (can be NULL).
+ */
+static void secp256k1_scalar_set_b32(secp256k1_scalar *r, const unsigned char *bin, int *overflow);
+
+/** Set a scalar from a big endian byte array and returns 1 if it is a valid
+ *  seckey and 0 otherwise. */
+static int secp256k1_scalar_set_b32_seckey(secp256k1_scalar *r, const unsigned char *bin);
+
+/** Set a scalar to an unsigned integer. */
+static void secp256k1_scalar_set_int(secp256k1_scalar *r, unsigned int v);
+
+/** Convert a scalar to a byte array. */
+static void secp256k1_scalar_get_b32(unsigned char *bin, const secp256k1_scalar* a);
+
+/** Add two scalars together (modulo the group order). Returns whether it overflowed. */
+static int secp256k1_scalar_add(secp256k1_scalar *r, const secp256k1_scalar *a, const secp256k1_scalar *b);
+
+/** Conditionally add a power of two to a scalar. The result is not allowed to overflow. */
+static void secp256k1_scalar_cadd_bit(secp256k1_scalar *r, unsigned int bit, int flag);
+
+/** Multiply two scalars (modulo the group order). */
+static void secp256k1_scalar_mul(secp256k1_scalar *r, const secp256k1_scalar *a, const secp256k1_scalar *b);
+
+/** Shift a scalar right by some amount strictly between 0 and 16, returning
+ *  the low bits that were shifted off */
+static int secp256k1_scalar_shr_int(secp256k1_scalar *r, int n);
+
+/** Compute the square of a scalar (modulo the group order). */
+static void secp256k1_scalar_sqr(secp256k1_scalar *r, const secp256k1_scalar *a);
+
+/** Compute the inverse of a scalar (modulo the group order). */
+static void secp256k1_scalar_inverse(secp256k1_scalar *r, const secp256k1_scalar *a);
+
+/** Compute the inverse of a scalar (modulo the group order), without constant-time guarantee. */
+static void secp256k1_scalar_inverse_var(secp256k1_scalar *r, const secp256k1_scalar *a);
+
+/** Compute the complement of a scalar (modulo the group order). */
+static void secp256k1_scalar_negate(secp256k1_scalar *r, const secp256k1_scalar *a);
+
+/** Check whether a scalar equals zero. */
+static int secp256k1_scalar_is_zero(const secp256k1_scalar *a);
+
+/** Check whether a scalar equals one. */
+static int secp256k1_scalar_is_one(const secp256k1_scalar *a);
+
+/** Check whether a scalar, considered as an nonnegative integer, is even. */
+static int secp256k1_scalar_is_even(const secp256k1_scalar *a);
+
+/** Check whether a scalar is higher than the group order divided by 2. */
+static int secp256k1_scalar_is_high(const secp256k1_scalar *a);
+
+/** Conditionally negate a number, in constant time.
+ * Returns -1 if the number was negated, 1 otherwise */
+static int secp256k1_scalar_cond_negate(secp256k1_scalar *a, int flag);
+
+#ifndef USE_NUM_NONE
+/** Convert a scalar to a number. */
+static void secp256k1_scalar_get_num(secp256k1_num *r, const secp256k1_scalar *a);
+
+/** Get the order of the group as a number. */
+static void secp256k1_scalar_order_get_num(secp256k1_num *r);
+#endif
+
+/** Compare two scalars. */
+static int secp256k1_scalar_eq(const secp256k1_scalar *a, const secp256k1_scalar *b);
+
+/** Find r1 and r2 such that r1+r2*2^128 = k. */
+static void secp256k1_scalar_split_128(secp256k1_scalar *r1, secp256k1_scalar *r2, const secp256k1_scalar *k);
+/** Find r1 and r2 such that r1+r2*lambda = k,
+ * where r1 and r2 or their negations are maximum 128 bits long (see secp256k1_ge_mul_lambda). */
+static void secp256k1_scalar_split_lambda(secp256k1_scalar *r1, secp256k1_scalar *r2, const secp256k1_scalar *k);
+
+/** Multiply a and b (without taking the modulus!), divide by 2**shift, and round to the nearest integer. Shift must be at least 256. */
+static void secp256k1_scalar_mul_shift_var(secp256k1_scalar *r, const secp256k1_scalar *a, const secp256k1_scalar *b, unsigned int shift);
+
+/** If flag is true, set *r equal to *a; otherwise leave it. Constant-time.  Both *r and *a must be initialized.*/
+static void secp256k1_scalar_cmov(secp256k1_scalar *r, const secp256k1_scalar *a, int flag);
+
+#endif /* SECP256K1_SCALAR_H */
diff --git a/depend/zcash/src/secp256k1/src/scalar_4x64.h b/depend/zcash/src/secp256k1/src/scalar_4x64.h
new file mode 100644
index 000000000..700964291
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/scalar_4x64.h
@@ -0,0 +1,19 @@
+/***********************************************************************
+ * Copyright (c) 2014 Pieter Wuille                                    *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_SCALAR_REPR_H
+#define SECP256K1_SCALAR_REPR_H
+
+#include <stdint.h>
+
+/** A scalar modulo the group order of the secp256k1 curve. */
+typedef struct {
+    uint64_t d[4];
+} secp256k1_scalar;
+
+#define SECP256K1_SCALAR_CONST(d7, d6, d5, d4, d3, d2, d1, d0) {{((uint64_t)(d1)) << 32 | (d0), ((uint64_t)(d3)) << 32 | (d2), ((uint64_t)(d5)) << 32 | (d4), ((uint64_t)(d7)) << 32 | (d6)}}
+
+#endif /* SECP256K1_SCALAR_REPR_H */
diff --git a/depend/zcash/src/secp256k1/src/scalar_4x64_impl.h b/depend/zcash/src/secp256k1/src/scalar_4x64_impl.h
new file mode 100644
index 000000000..e3a70927f
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/scalar_4x64_impl.h
@@ -0,0 +1,986 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_SCALAR_REPR_IMPL_H
+#define SECP256K1_SCALAR_REPR_IMPL_H
+
+/* Limbs of the secp256k1 order. */
+#define SECP256K1_N_0 ((uint64_t)0xBFD25E8CD0364141ULL)
+#define SECP256K1_N_1 ((uint64_t)0xBAAEDCE6AF48A03BULL)
+#define SECP256K1_N_2 ((uint64_t)0xFFFFFFFFFFFFFFFEULL)
+#define SECP256K1_N_3 ((uint64_t)0xFFFFFFFFFFFFFFFFULL)
+
+/* Limbs of 2^256 minus the secp256k1 order. */
+#define SECP256K1_N_C_0 (~SECP256K1_N_0 + 1)
+#define SECP256K1_N_C_1 (~SECP256K1_N_1)
+#define SECP256K1_N_C_2 (1)
+
+/* Limbs of half the secp256k1 order. */
+#define SECP256K1_N_H_0 ((uint64_t)0xDFE92F46681B20A0ULL)
+#define SECP256K1_N_H_1 ((uint64_t)0x5D576E7357A4501DULL)
+#define SECP256K1_N_H_2 ((uint64_t)0xFFFFFFFFFFFFFFFFULL)
+#define SECP256K1_N_H_3 ((uint64_t)0x7FFFFFFFFFFFFFFFULL)
+
+SECP256K1_INLINE static void secp256k1_scalar_clear(secp256k1_scalar *r) {
+    r->d[0] = 0;
+    r->d[1] = 0;
+    r->d[2] = 0;
+    r->d[3] = 0;
+}
+
+SECP256K1_INLINE static void secp256k1_scalar_set_int(secp256k1_scalar *r, unsigned int v) {
+    r->d[0] = v;
+    r->d[1] = 0;
+    r->d[2] = 0;
+    r->d[3] = 0;
+}
+
+SECP256K1_INLINE static unsigned int secp256k1_scalar_get_bits(const secp256k1_scalar *a, unsigned int offset, unsigned int count) {
+    VERIFY_CHECK((offset + count - 1) >> 6 == offset >> 6);
+    return (a->d[offset >> 6] >> (offset & 0x3F)) & ((((uint64_t)1) << count) - 1);
+}
+
+SECP256K1_INLINE static unsigned int secp256k1_scalar_get_bits_var(const secp256k1_scalar *a, unsigned int offset, unsigned int count) {
+    VERIFY_CHECK(count < 32);
+    VERIFY_CHECK(offset + count <= 256);
+    if ((offset + count - 1) >> 6 == offset >> 6) {
+        return secp256k1_scalar_get_bits(a, offset, count);
+    } else {
+        VERIFY_CHECK((offset >> 6) + 1 < 4);
+        return ((a->d[offset >> 6] >> (offset & 0x3F)) | (a->d[(offset >> 6) + 1] << (64 - (offset & 0x3F)))) & ((((uint64_t)1) << count) - 1);
+    }
+}
+
+SECP256K1_INLINE static int secp256k1_scalar_check_overflow(const secp256k1_scalar *a) {
+    int yes = 0;
+    int no = 0;
+    no |= (a->d[3] < SECP256K1_N_3); /* No need for a > check. */
+    no |= (a->d[2] < SECP256K1_N_2);
+    yes |= (a->d[2] > SECP256K1_N_2) & ~no;
+    no |= (a->d[1] < SECP256K1_N_1);
+    yes |= (a->d[1] > SECP256K1_N_1) & ~no;
+    yes |= (a->d[0] >= SECP256K1_N_0) & ~no;
+    return yes;
+}
+
+SECP256K1_INLINE static int secp256k1_scalar_reduce(secp256k1_scalar *r, unsigned int overflow) {
+    uint128_t t;
+    VERIFY_CHECK(overflow <= 1);
+    t = (uint128_t)r->d[0] + overflow * SECP256K1_N_C_0;
+    r->d[0] = t & 0xFFFFFFFFFFFFFFFFULL; t >>= 64;
+    t += (uint128_t)r->d[1] + overflow * SECP256K1_N_C_1;
+    r->d[1] = t & 0xFFFFFFFFFFFFFFFFULL; t >>= 64;
+    t += (uint128_t)r->d[2] + overflow * SECP256K1_N_C_2;
+    r->d[2] = t & 0xFFFFFFFFFFFFFFFFULL; t >>= 64;
+    t += (uint64_t)r->d[3];
+    r->d[3] = t & 0xFFFFFFFFFFFFFFFFULL;
+    return overflow;
+}
+
+static int secp256k1_scalar_add(secp256k1_scalar *r, const secp256k1_scalar *a, const secp256k1_scalar *b) {
+    int overflow;
+    uint128_t t = (uint128_t)a->d[0] + b->d[0];
+    r->d[0] = t & 0xFFFFFFFFFFFFFFFFULL; t >>= 64;
+    t += (uint128_t)a->d[1] + b->d[1];
+    r->d[1] = t & 0xFFFFFFFFFFFFFFFFULL; t >>= 64;
+    t += (uint128_t)a->d[2] + b->d[2];
+    r->d[2] = t & 0xFFFFFFFFFFFFFFFFULL; t >>= 64;
+    t += (uint128_t)a->d[3] + b->d[3];
+    r->d[3] = t & 0xFFFFFFFFFFFFFFFFULL; t >>= 64;
+    overflow = t + secp256k1_scalar_check_overflow(r);
+    VERIFY_CHECK(overflow == 0 || overflow == 1);
+    secp256k1_scalar_reduce(r, overflow);
+    return overflow;
+}
+
+static void secp256k1_scalar_cadd_bit(secp256k1_scalar *r, unsigned int bit, int flag) {
+    uint128_t t;
+    VERIFY_CHECK(bit < 256);
+    bit += ((uint32_t) flag - 1) & 0x100;  /* forcing (bit >> 6) > 3 makes this a noop */
+    t = (uint128_t)r->d[0] + (((uint64_t)((bit >> 6) == 0)) << (bit & 0x3F));
+    r->d[0] = t & 0xFFFFFFFFFFFFFFFFULL; t >>= 64;
+    t += (uint128_t)r->d[1] + (((uint64_t)((bit >> 6) == 1)) << (bit & 0x3F));
+    r->d[1] = t & 0xFFFFFFFFFFFFFFFFULL; t >>= 64;
+    t += (uint128_t)r->d[2] + (((uint64_t)((bit >> 6) == 2)) << (bit & 0x3F));
+    r->d[2] = t & 0xFFFFFFFFFFFFFFFFULL; t >>= 64;
+    t += (uint128_t)r->d[3] + (((uint64_t)((bit >> 6) == 3)) << (bit & 0x3F));
+    r->d[3] = t & 0xFFFFFFFFFFFFFFFFULL;
+#ifdef VERIFY
+    VERIFY_CHECK((t >> 64) == 0);
+    VERIFY_CHECK(secp256k1_scalar_check_overflow(r) == 0);
+#endif
+}
+
+static void secp256k1_scalar_set_b32(secp256k1_scalar *r, const unsigned char *b32, int *overflow) {
+    int over;
+    r->d[0] = (uint64_t)b32[31] | (uint64_t)b32[30] << 8 | (uint64_t)b32[29] << 16 | (uint64_t)b32[28] << 24 | (uint64_t)b32[27] << 32 | (uint64_t)b32[26] << 40 | (uint64_t)b32[25] << 48 | (uint64_t)b32[24] << 56;
+    r->d[1] = (uint64_t)b32[23] | (uint64_t)b32[22] << 8 | (uint64_t)b32[21] << 16 | (uint64_t)b32[20] << 24 | (uint64_t)b32[19] << 32 | (uint64_t)b32[18] << 40 | (uint64_t)b32[17] << 48 | (uint64_t)b32[16] << 56;
+    r->d[2] = (uint64_t)b32[15] | (uint64_t)b32[14] << 8 | (uint64_t)b32[13] << 16 | (uint64_t)b32[12] << 24 | (uint64_t)b32[11] << 32 | (uint64_t)b32[10] << 40 | (uint64_t)b32[9] << 48 | (uint64_t)b32[8] << 56;
+    r->d[3] = (uint64_t)b32[7] | (uint64_t)b32[6] << 8 | (uint64_t)b32[5] << 16 | (uint64_t)b32[4] << 24 | (uint64_t)b32[3] << 32 | (uint64_t)b32[2] << 40 | (uint64_t)b32[1] << 48 | (uint64_t)b32[0] << 56;
+    over = secp256k1_scalar_reduce(r, secp256k1_scalar_check_overflow(r));
+    if (overflow) {
+        *overflow = over;
+    }
+}
+
+static void secp256k1_scalar_get_b32(unsigned char *bin, const secp256k1_scalar* a) {
+    bin[0]  = (unsigned char) (a->d[3] >> 56);
+    bin[1]  = (unsigned char) (a->d[3] >> 48);
+    bin[2]  = (unsigned char) (a->d[3] >> 40);
+    bin[3]  = (unsigned char) (a->d[3] >> 32);
+    bin[4]  = (unsigned char) (a->d[3] >> 24);
+    bin[5]  = (unsigned char) (a->d[3] >> 16);
+    bin[6]  = (unsigned char) (a->d[3] >> 8);
+    bin[7]  = (unsigned char) (a->d[3]);
+    bin[8]  = (unsigned char) (a->d[2] >> 56);
+    bin[9]  = (unsigned char) (a->d[2] >> 48);
+    bin[10] = (unsigned char) (a->d[2] >> 40);
+    bin[11] = (unsigned char) (a->d[2] >> 32);
+    bin[12] = (unsigned char) (a->d[2] >> 24);
+    bin[13] = (unsigned char) (a->d[2] >> 16);
+    bin[14] = (unsigned char) (a->d[2] >> 8);
+    bin[15] = (unsigned char) (a->d[2]);
+    bin[16] = (unsigned char) (a->d[1] >> 56);
+    bin[17] = (unsigned char) (a->d[1] >> 48);
+    bin[18] = (unsigned char) (a->d[1] >> 40);
+    bin[19] = (unsigned char) (a->d[1] >> 32);
+    bin[20] = (unsigned char) (a->d[1] >> 24);
+    bin[21] = (unsigned char) (a->d[1] >> 16);
+    bin[22] = (unsigned char) (a->d[1] >> 8);
+    bin[23] = (unsigned char) (a->d[1]);
+    bin[24] = (unsigned char) (a->d[0] >> 56);
+    bin[25] = (unsigned char) (a->d[0] >> 48);
+    bin[26] = (unsigned char) (a->d[0] >> 40);
+    bin[27] = (unsigned char) (a->d[0] >> 32);
+    bin[28] = (unsigned char) (a->d[0] >> 24);
+    bin[29] = (unsigned char) (a->d[0] >> 16);
+    bin[30] = (unsigned char) (a->d[0] >> 8);
+    bin[31] = (unsigned char) (a->d[0]);
+}
+
+SECP256K1_INLINE static int secp256k1_scalar_is_zero(const secp256k1_scalar *a) {
+    return (a->d[0] | a->d[1] | a->d[2] | a->d[3]) == 0;
+}
+
+static void secp256k1_scalar_negate(secp256k1_scalar *r, const secp256k1_scalar *a) {
+    uint64_t nonzero = 0xFFFFFFFFFFFFFFFFULL * (secp256k1_scalar_is_zero(a) == 0);
+    uint128_t t = (uint128_t)(~a->d[0]) + SECP256K1_N_0 + 1;
+    r->d[0] = t & nonzero; t >>= 64;
+    t += (uint128_t)(~a->d[1]) + SECP256K1_N_1;
+    r->d[1] = t & nonzero; t >>= 64;
+    t += (uint128_t)(~a->d[2]) + SECP256K1_N_2;
+    r->d[2] = t & nonzero; t >>= 64;
+    t += (uint128_t)(~a->d[3]) + SECP256K1_N_3;
+    r->d[3] = t & nonzero;
+}
+
+SECP256K1_INLINE static int secp256k1_scalar_is_one(const secp256k1_scalar *a) {
+    return ((a->d[0] ^ 1) | a->d[1] | a->d[2] | a->d[3]) == 0;
+}
+
+static int secp256k1_scalar_is_high(const secp256k1_scalar *a) {
+    int yes = 0;
+    int no = 0;
+    no |= (a->d[3] < SECP256K1_N_H_3);
+    yes |= (a->d[3] > SECP256K1_N_H_3) & ~no;
+    no |= (a->d[2] < SECP256K1_N_H_2) & ~yes; /* No need for a > check. */
+    no |= (a->d[1] < SECP256K1_N_H_1) & ~yes;
+    yes |= (a->d[1] > SECP256K1_N_H_1) & ~no;
+    yes |= (a->d[0] > SECP256K1_N_H_0) & ~no;
+    return yes;
+}
+
+static int secp256k1_scalar_cond_negate(secp256k1_scalar *r, int flag) {
+    /* If we are flag = 0, mask = 00...00 and this is a no-op;
+     * if we are flag = 1, mask = 11...11 and this is identical to secp256k1_scalar_negate */
+    uint64_t mask = !flag - 1;
+    uint64_t nonzero = (secp256k1_scalar_is_zero(r) != 0) - 1;
+    uint128_t t = (uint128_t)(r->d[0] ^ mask) + ((SECP256K1_N_0 + 1) & mask);
+    r->d[0] = t & nonzero; t >>= 64;
+    t += (uint128_t)(r->d[1] ^ mask) + (SECP256K1_N_1 & mask);
+    r->d[1] = t & nonzero; t >>= 64;
+    t += (uint128_t)(r->d[2] ^ mask) + (SECP256K1_N_2 & mask);
+    r->d[2] = t & nonzero; t >>= 64;
+    t += (uint128_t)(r->d[3] ^ mask) + (SECP256K1_N_3 & mask);
+    r->d[3] = t & nonzero;
+    return 2 * (mask == 0) - 1;
+}
+
+/* Inspired by the macros in OpenSSL's crypto/bn/asm/x86_64-gcc.c. */
+
+/** Add a*b to the number defined by (c0,c1,c2). c2 must never overflow. */
+#define muladd(a,b) { \
+    uint64_t tl, th; \
+    { \
+        uint128_t t = (uint128_t)a * b; \
+        th = t >> 64;         /* at most 0xFFFFFFFFFFFFFFFE */ \
+        tl = t; \
+    } \
+    c0 += tl;                 /* overflow is handled on the next line */ \
+    th += (c0 < tl);          /* at most 0xFFFFFFFFFFFFFFFF */ \
+    c1 += th;                 /* overflow is handled on the next line */ \
+    c2 += (c1 < th);          /* never overflows by contract (verified in the next line) */ \
+    VERIFY_CHECK((c1 >= th) || (c2 != 0)); \
+}
+
+/** Add a*b to the number defined by (c0,c1). c1 must never overflow. */
+#define muladd_fast(a,b) { \
+    uint64_t tl, th; \
+    { \
+        uint128_t t = (uint128_t)a * b; \
+        th = t >> 64;         /* at most 0xFFFFFFFFFFFFFFFE */ \
+        tl = t; \
+    } \
+    c0 += tl;                 /* overflow is handled on the next line */ \
+    th += (c0 < tl);          /* at most 0xFFFFFFFFFFFFFFFF */ \
+    c1 += th;                 /* never overflows by contract (verified in the next line) */ \
+    VERIFY_CHECK(c1 >= th); \
+}
+
+/** Add 2*a*b to the number defined by (c0,c1,c2). c2 must never overflow. */
+#define muladd2(a,b) { \
+    uint64_t tl, th, th2, tl2; \
+    { \
+        uint128_t t = (uint128_t)a * b; \
+        th = t >> 64;               /* at most 0xFFFFFFFFFFFFFFFE */ \
+        tl = t; \
+    } \
+    th2 = th + th;                  /* at most 0xFFFFFFFFFFFFFFFE (in case th was 0x7FFFFFFFFFFFFFFF) */ \
+    c2 += (th2 < th);               /* never overflows by contract (verified the next line) */ \
+    VERIFY_CHECK((th2 >= th) || (c2 != 0)); \
+    tl2 = tl + tl;                  /* at most 0xFFFFFFFFFFFFFFFE (in case the lowest 63 bits of tl were 0x7FFFFFFFFFFFFFFF) */ \
+    th2 += (tl2 < tl);              /* at most 0xFFFFFFFFFFFFFFFF */ \
+    c0 += tl2;                      /* overflow is handled on the next line */ \
+    th2 += (c0 < tl2);              /* second overflow is handled on the next line */ \
+    c2 += (c0 < tl2) & (th2 == 0);  /* never overflows by contract (verified the next line) */ \
+    VERIFY_CHECK((c0 >= tl2) || (th2 != 0) || (c2 != 0)); \
+    c1 += th2;                      /* overflow is handled on the next line */ \
+    c2 += (c1 < th2);               /* never overflows by contract (verified the next line) */ \
+    VERIFY_CHECK((c1 >= th2) || (c2 != 0)); \
+}
+
+/** Add a to the number defined by (c0,c1,c2). c2 must never overflow. */
+#define sumadd(a) { \
+    unsigned int over; \
+    c0 += (a);                  /* overflow is handled on the next line */ \
+    over = (c0 < (a));         \
+    c1 += over;                 /* overflow is handled on the next line */ \
+    c2 += (c1 < over);          /* never overflows by contract */ \
+}
+
+/** Add a to the number defined by (c0,c1). c1 must never overflow, c2 must be zero. */
+#define sumadd_fast(a) { \
+    c0 += (a);                 /* overflow is handled on the next line */ \
+    c1 += (c0 < (a));          /* never overflows by contract (verified the next line) */ \
+    VERIFY_CHECK((c1 != 0) | (c0 >= (a))); \
+    VERIFY_CHECK(c2 == 0); \
+}
+
+/** Extract the lowest 64 bits of (c0,c1,c2) into n, and left shift the number 64 bits. */
+#define extract(n) { \
+    (n) = c0; \
+    c0 = c1; \
+    c1 = c2; \
+    c2 = 0; \
+}
+
+/** Extract the lowest 64 bits of (c0,c1,c2) into n, and left shift the number 64 bits. c2 is required to be zero. */
+#define extract_fast(n) { \
+    (n) = c0; \
+    c0 = c1; \
+    c1 = 0; \
+    VERIFY_CHECK(c2 == 0); \
+}
+
+static void secp256k1_scalar_reduce_512(secp256k1_scalar *r, const uint64_t *l) {
+#ifdef USE_ASM_X86_64
+    /* Reduce 512 bits into 385. */
+    uint64_t m0, m1, m2, m3, m4, m5, m6;
+    uint64_t p0, p1, p2, p3, p4;
+    uint64_t c;
+
+    __asm__ __volatile__(
+    /* Preload. */
+    "movq 32(%%rsi), %%r11\n"
+    "movq 40(%%rsi), %%r12\n"
+    "movq 48(%%rsi), %%r13\n"
+    "movq 56(%%rsi), %%r14\n"
+    /* Initialize r8,r9,r10 */
+    "movq 0(%%rsi), %%r8\n"
+    "xorq %%r9, %%r9\n"
+    "xorq %%r10, %%r10\n"
+    /* (r8,r9) += n0 * c0 */
+    "movq %8, %%rax\n"
+    "mulq %%r11\n"
+    "addq %%rax, %%r8\n"
+    "adcq %%rdx, %%r9\n"
+    /* extract m0 */
+    "movq %%r8, %q0\n"
+    "xorq %%r8, %%r8\n"
+    /* (r9,r10) += l1 */
+    "addq 8(%%rsi), %%r9\n"
+    "adcq $0, %%r10\n"
+    /* (r9,r10,r8) += n1 * c0 */
+    "movq %8, %%rax\n"
+    "mulq %%r12\n"
+    "addq %%rax, %%r9\n"
+    "adcq %%rdx, %%r10\n"
+    "adcq $0, %%r8\n"
+    /* (r9,r10,r8) += n0 * c1 */
+    "movq %9, %%rax\n"
+    "mulq %%r11\n"
+    "addq %%rax, %%r9\n"
+    "adcq %%rdx, %%r10\n"
+    "adcq $0, %%r8\n"
+    /* extract m1 */
+    "movq %%r9, %q1\n"
+    "xorq %%r9, %%r9\n"
+    /* (r10,r8,r9) += l2 */
+    "addq 16(%%rsi), %%r10\n"
+    "adcq $0, %%r8\n"
+    "adcq $0, %%r9\n"
+    /* (r10,r8,r9) += n2 * c0 */
+    "movq %8, %%rax\n"
+    "mulq %%r13\n"
+    "addq %%rax, %%r10\n"
+    "adcq %%rdx, %%r8\n"
+    "adcq $0, %%r9\n"
+    /* (r10,r8,r9) += n1 * c1 */
+    "movq %9, %%rax\n"
+    "mulq %%r12\n"
+    "addq %%rax, %%r10\n"
+    "adcq %%rdx, %%r8\n"
+    "adcq $0, %%r9\n"
+    /* (r10,r8,r9) += n0 */
+    "addq %%r11, %%r10\n"
+    "adcq $0, %%r8\n"
+    "adcq $0, %%r9\n"
+    /* extract m2 */
+    "movq %%r10, %q2\n"
+    "xorq %%r10, %%r10\n"
+    /* (r8,r9,r10) += l3 */
+    "addq 24(%%rsi), %%r8\n"
+    "adcq $0, %%r9\n"
+    "adcq $0, %%r10\n"
+    /* (r8,r9,r10) += n3 * c0 */
+    "movq %8, %%rax\n"
+    "mulq %%r14\n"
+    "addq %%rax, %%r8\n"
+    "adcq %%rdx, %%r9\n"
+    "adcq $0, %%r10\n"
+    /* (r8,r9,r10) += n2 * c1 */
+    "movq %9, %%rax\n"
+    "mulq %%r13\n"
+    "addq %%rax, %%r8\n"
+    "adcq %%rdx, %%r9\n"
+    "adcq $0, %%r10\n"
+    /* (r8,r9,r10) += n1 */
+    "addq %%r12, %%r8\n"
+    "adcq $0, %%r9\n"
+    "adcq $0, %%r10\n"
+    /* extract m3 */
+    "movq %%r8, %q3\n"
+    "xorq %%r8, %%r8\n"
+    /* (r9,r10,r8) += n3 * c1 */
+    "movq %9, %%rax\n"
+    "mulq %%r14\n"
+    "addq %%rax, %%r9\n"
+    "adcq %%rdx, %%r10\n"
+    "adcq $0, %%r8\n"
+    /* (r9,r10,r8) += n2 */
+    "addq %%r13, %%r9\n"
+    "adcq $0, %%r10\n"
+    "adcq $0, %%r8\n"
+    /* extract m4 */
+    "movq %%r9, %q4\n"
+    /* (r10,r8) += n3 */
+    "addq %%r14, %%r10\n"
+    "adcq $0, %%r8\n"
+    /* extract m5 */
+    "movq %%r10, %q5\n"
+    /* extract m6 */
+    "movq %%r8, %q6\n"
+    : "=g"(m0), "=g"(m1), "=g"(m2), "=g"(m3), "=g"(m4), "=g"(m5), "=g"(m6)
+    : "S"(l), "i"(SECP256K1_N_C_0), "i"(SECP256K1_N_C_1)
+    : "rax", "rdx", "r8", "r9", "r10", "r11", "r12", "r13", "r14", "cc");
+
+    /* Reduce 385 bits into 258. */
+    __asm__ __volatile__(
+    /* Preload */
+    "movq %q9, %%r11\n"
+    "movq %q10, %%r12\n"
+    "movq %q11, %%r13\n"
+    /* Initialize (r8,r9,r10) */
+    "movq %q5, %%r8\n"
+    "xorq %%r9, %%r9\n"
+    "xorq %%r10, %%r10\n"
+    /* (r8,r9) += m4 * c0 */
+    "movq %12, %%rax\n"
+    "mulq %%r11\n"
+    "addq %%rax, %%r8\n"
+    "adcq %%rdx, %%r9\n"
+    /* extract p0 */
+    "movq %%r8, %q0\n"
+    "xorq %%r8, %%r8\n"
+    /* (r9,r10) += m1 */
+    "addq %q6, %%r9\n"
+    "adcq $0, %%r10\n"
+    /* (r9,r10,r8) += m5 * c0 */
+    "movq %12, %%rax\n"
+    "mulq %%r12\n"
+    "addq %%rax, %%r9\n"
+    "adcq %%rdx, %%r10\n"
+    "adcq $0, %%r8\n"
+    /* (r9,r10,r8) += m4 * c1 */
+    "movq %13, %%rax\n"
+    "mulq %%r11\n"
+    "addq %%rax, %%r9\n"
+    "adcq %%rdx, %%r10\n"
+    "adcq $0, %%r8\n"
+    /* extract p1 */
+    "movq %%r9, %q1\n"
+    "xorq %%r9, %%r9\n"
+    /* (r10,r8,r9) += m2 */
+    "addq %q7, %%r10\n"
+    "adcq $0, %%r8\n"
+    "adcq $0, %%r9\n"
+    /* (r10,r8,r9) += m6 * c0 */
+    "movq %12, %%rax\n"
+    "mulq %%r13\n"
+    "addq %%rax, %%r10\n"
+    "adcq %%rdx, %%r8\n"
+    "adcq $0, %%r9\n"
+    /* (r10,r8,r9) += m5 * c1 */
+    "movq %13, %%rax\n"
+    "mulq %%r12\n"
+    "addq %%rax, %%r10\n"
+    "adcq %%rdx, %%r8\n"
+    "adcq $0, %%r9\n"
+    /* (r10,r8,r9) += m4 */
+    "addq %%r11, %%r10\n"
+    "adcq $0, %%r8\n"
+    "adcq $0, %%r9\n"
+    /* extract p2 */
+    "movq %%r10, %q2\n"
+    /* (r8,r9) += m3 */
+    "addq %q8, %%r8\n"
+    "adcq $0, %%r9\n"
+    /* (r8,r9) += m6 * c1 */
+    "movq %13, %%rax\n"
+    "mulq %%r13\n"
+    "addq %%rax, %%r8\n"
+    "adcq %%rdx, %%r9\n"
+    /* (r8,r9) += m5 */
+    "addq %%r12, %%r8\n"
+    "adcq $0, %%r9\n"
+    /* extract p3 */
+    "movq %%r8, %q3\n"
+    /* (r9) += m6 */
+    "addq %%r13, %%r9\n"
+    /* extract p4 */
+    "movq %%r9, %q4\n"
+    : "=&g"(p0), "=&g"(p1), "=&g"(p2), "=g"(p3), "=g"(p4)
+    : "g"(m0), "g"(m1), "g"(m2), "g"(m3), "g"(m4), "g"(m5), "g"(m6), "i"(SECP256K1_N_C_0), "i"(SECP256K1_N_C_1)
+    : "rax", "rdx", "r8", "r9", "r10", "r11", "r12", "r13", "cc");
+
+    /* Reduce 258 bits into 256. */
+    __asm__ __volatile__(
+    /* Preload */
+    "movq %q5, %%r10\n"
+    /* (rax,rdx) = p4 * c0 */
+    "movq %7, %%rax\n"
+    "mulq %%r10\n"
+    /* (rax,rdx) += p0 */
+    "addq %q1, %%rax\n"
+    "adcq $0, %%rdx\n"
+    /* extract r0 */
+    "movq %%rax, 0(%q6)\n"
+    /* Move to (r8,r9) */
+    "movq %%rdx, %%r8\n"
+    "xorq %%r9, %%r9\n"
+    /* (r8,r9) += p1 */
+    "addq %q2, %%r8\n"
+    "adcq $0, %%r9\n"
+    /* (r8,r9) += p4 * c1 */
+    "movq %8, %%rax\n"
+    "mulq %%r10\n"
+    "addq %%rax, %%r8\n"
+    "adcq %%rdx, %%r9\n"
+    /* Extract r1 */
+    "movq %%r8, 8(%q6)\n"
+    "xorq %%r8, %%r8\n"
+    /* (r9,r8) += p4 */
+    "addq %%r10, %%r9\n"
+    "adcq $0, %%r8\n"
+    /* (r9,r8) += p2 */
+    "addq %q3, %%r9\n"
+    "adcq $0, %%r8\n"
+    /* Extract r2 */
+    "movq %%r9, 16(%q6)\n"
+    "xorq %%r9, %%r9\n"
+    /* (r8,r9) += p3 */
+    "addq %q4, %%r8\n"
+    "adcq $0, %%r9\n"
+    /* Extract r3 */
+    "movq %%r8, 24(%q6)\n"
+    /* Extract c */
+    "movq %%r9, %q0\n"
+    : "=g"(c)
+    : "g"(p0), "g"(p1), "g"(p2), "g"(p3), "g"(p4), "D"(r), "i"(SECP256K1_N_C_0), "i"(SECP256K1_N_C_1)
+    : "rax", "rdx", "r8", "r9", "r10", "cc", "memory");
+#else
+    uint128_t c;
+    uint64_t c0, c1, c2;
+    uint64_t n0 = l[4], n1 = l[5], n2 = l[6], n3 = l[7];
+    uint64_t m0, m1, m2, m3, m4, m5;
+    uint32_t m6;
+    uint64_t p0, p1, p2, p3;
+    uint32_t p4;
+
+    /* Reduce 512 bits into 385. */
+    /* m[0..6] = l[0..3] + n[0..3] * SECP256K1_N_C. */
+    c0 = l[0]; c1 = 0; c2 = 0;
+    muladd_fast(n0, SECP256K1_N_C_0);
+    extract_fast(m0);
+    sumadd_fast(l[1]);
+    muladd(n1, SECP256K1_N_C_0);
+    muladd(n0, SECP256K1_N_C_1);
+    extract(m1);
+    sumadd(l[2]);
+    muladd(n2, SECP256K1_N_C_0);
+    muladd(n1, SECP256K1_N_C_1);
+    sumadd(n0);
+    extract(m2);
+    sumadd(l[3]);
+    muladd(n3, SECP256K1_N_C_0);
+    muladd(n2, SECP256K1_N_C_1);
+    sumadd(n1);
+    extract(m3);
+    muladd(n3, SECP256K1_N_C_1);
+    sumadd(n2);
+    extract(m4);
+    sumadd_fast(n3);
+    extract_fast(m5);
+    VERIFY_CHECK(c0 <= 1);
+    m6 = c0;
+
+    /* Reduce 385 bits into 258. */
+    /* p[0..4] = m[0..3] + m[4..6] * SECP256K1_N_C. */
+    c0 = m0; c1 = 0; c2 = 0;
+    muladd_fast(m4, SECP256K1_N_C_0);
+    extract_fast(p0);
+    sumadd_fast(m1);
+    muladd(m5, SECP256K1_N_C_0);
+    muladd(m4, SECP256K1_N_C_1);
+    extract(p1);
+    sumadd(m2);
+    muladd(m6, SECP256K1_N_C_0);
+    muladd(m5, SECP256K1_N_C_1);
+    sumadd(m4);
+    extract(p2);
+    sumadd_fast(m3);
+    muladd_fast(m6, SECP256K1_N_C_1);
+    sumadd_fast(m5);
+    extract_fast(p3);
+    p4 = c0 + m6;
+    VERIFY_CHECK(p4 <= 2);
+
+    /* Reduce 258 bits into 256. */
+    /* r[0..3] = p[0..3] + p[4] * SECP256K1_N_C. */
+    c = p0 + (uint128_t)SECP256K1_N_C_0 * p4;
+    r->d[0] = c & 0xFFFFFFFFFFFFFFFFULL; c >>= 64;
+    c += p1 + (uint128_t)SECP256K1_N_C_1 * p4;
+    r->d[1] = c & 0xFFFFFFFFFFFFFFFFULL; c >>= 64;
+    c += p2 + (uint128_t)p4;
+    r->d[2] = c & 0xFFFFFFFFFFFFFFFFULL; c >>= 64;
+    c += p3;
+    r->d[3] = c & 0xFFFFFFFFFFFFFFFFULL; c >>= 64;
+#endif
+
+    /* Final reduction of r. */
+    secp256k1_scalar_reduce(r, c + secp256k1_scalar_check_overflow(r));
+}
+
+static void secp256k1_scalar_mul_512(uint64_t l[8], const secp256k1_scalar *a, const secp256k1_scalar *b) {
+#ifdef USE_ASM_X86_64
+    const uint64_t *pb = b->d;
+    __asm__ __volatile__(
+    /* Preload */
+    "movq 0(%%rdi), %%r15\n"
+    "movq 8(%%rdi), %%rbx\n"
+    "movq 16(%%rdi), %%rcx\n"
+    "movq 0(%%rdx), %%r11\n"
+    "movq 8(%%rdx), %%r12\n"
+    "movq 16(%%rdx), %%r13\n"
+    "movq 24(%%rdx), %%r14\n"
+    /* (rax,rdx) = a0 * b0 */
+    "movq %%r15, %%rax\n"
+    "mulq %%r11\n"
+    /* Extract l0 */
+    "movq %%rax, 0(%%rsi)\n"
+    /* (r8,r9,r10) = (rdx) */
+    "movq %%rdx, %%r8\n"
+    "xorq %%r9, %%r9\n"
+    "xorq %%r10, %%r10\n"
+    /* (r8,r9,r10) += a0 * b1 */
+    "movq %%r15, %%rax\n"
+    "mulq %%r12\n"
+    "addq %%rax, %%r8\n"
+    "adcq %%rdx, %%r9\n"
+    "adcq $0, %%r10\n"
+    /* (r8,r9,r10) += a1 * b0 */
+    "movq %%rbx, %%rax\n"
+    "mulq %%r11\n"
+    "addq %%rax, %%r8\n"
+    "adcq %%rdx, %%r9\n"
+    "adcq $0, %%r10\n"
+    /* Extract l1 */
+    "movq %%r8, 8(%%rsi)\n"
+    "xorq %%r8, %%r8\n"
+    /* (r9,r10,r8) += a0 * b2 */
+    "movq %%r15, %%rax\n"
+    "mulq %%r13\n"
+    "addq %%rax, %%r9\n"
+    "adcq %%rdx, %%r10\n"
+    "adcq $0, %%r8\n"
+    /* (r9,r10,r8) += a1 * b1 */
+    "movq %%rbx, %%rax\n"
+    "mulq %%r12\n"
+    "addq %%rax, %%r9\n"
+    "adcq %%rdx, %%r10\n"
+    "adcq $0, %%r8\n"
+    /* (r9,r10,r8) += a2 * b0 */
+    "movq %%rcx, %%rax\n"
+    "mulq %%r11\n"
+    "addq %%rax, %%r9\n"
+    "adcq %%rdx, %%r10\n"
+    "adcq $0, %%r8\n"
+    /* Extract l2 */
+    "movq %%r9, 16(%%rsi)\n"
+    "xorq %%r9, %%r9\n"
+    /* (r10,r8,r9) += a0 * b3 */
+    "movq %%r15, %%rax\n"
+    "mulq %%r14\n"
+    "addq %%rax, %%r10\n"
+    "adcq %%rdx, %%r8\n"
+    "adcq $0, %%r9\n"
+    /* Preload a3 */
+    "movq 24(%%rdi), %%r15\n"
+    /* (r10,r8,r9) += a1 * b2 */
+    "movq %%rbx, %%rax\n"
+    "mulq %%r13\n"
+    "addq %%rax, %%r10\n"
+    "adcq %%rdx, %%r8\n"
+    "adcq $0, %%r9\n"
+    /* (r10,r8,r9) += a2 * b1 */
+    "movq %%rcx, %%rax\n"
+    "mulq %%r12\n"
+    "addq %%rax, %%r10\n"
+    "adcq %%rdx, %%r8\n"
+    "adcq $0, %%r9\n"
+    /* (r10,r8,r9) += a3 * b0 */
+    "movq %%r15, %%rax\n"
+    "mulq %%r11\n"
+    "addq %%rax, %%r10\n"
+    "adcq %%rdx, %%r8\n"
+    "adcq $0, %%r9\n"
+    /* Extract l3 */
+    "movq %%r10, 24(%%rsi)\n"
+    "xorq %%r10, %%r10\n"
+    /* (r8,r9,r10) += a1 * b3 */
+    "movq %%rbx, %%rax\n"
+    "mulq %%r14\n"
+    "addq %%rax, %%r8\n"
+    "adcq %%rdx, %%r9\n"
+    "adcq $0, %%r10\n"
+    /* (r8,r9,r10) += a2 * b2 */
+    "movq %%rcx, %%rax\n"
+    "mulq %%r13\n"
+    "addq %%rax, %%r8\n"
+    "adcq %%rdx, %%r9\n"
+    "adcq $0, %%r10\n"
+    /* (r8,r9,r10) += a3 * b1 */
+    "movq %%r15, %%rax\n"
+    "mulq %%r12\n"
+    "addq %%rax, %%r8\n"
+    "adcq %%rdx, %%r9\n"
+    "adcq $0, %%r10\n"
+    /* Extract l4 */
+    "movq %%r8, 32(%%rsi)\n"
+    "xorq %%r8, %%r8\n"
+    /* (r9,r10,r8) += a2 * b3 */
+    "movq %%rcx, %%rax\n"
+    "mulq %%r14\n"
+    "addq %%rax, %%r9\n"
+    "adcq %%rdx, %%r10\n"
+    "adcq $0, %%r8\n"
+    /* (r9,r10,r8) += a3 * b2 */
+    "movq %%r15, %%rax\n"
+    "mulq %%r13\n"
+    "addq %%rax, %%r9\n"
+    "adcq %%rdx, %%r10\n"
+    "adcq $0, %%r8\n"
+    /* Extract l5 */
+    "movq %%r9, 40(%%rsi)\n"
+    /* (r10,r8) += a3 * b3 */
+    "movq %%r15, %%rax\n"
+    "mulq %%r14\n"
+    "addq %%rax, %%r10\n"
+    "adcq %%rdx, %%r8\n"
+    /* Extract l6 */
+    "movq %%r10, 48(%%rsi)\n"
+    /* Extract l7 */
+    "movq %%r8, 56(%%rsi)\n"
+    : "+d"(pb)
+    : "S"(l), "D"(a->d)
+    : "rax", "rbx", "rcx", "r8", "r9", "r10", "r11", "r12", "r13", "r14", "r15", "cc", "memory");
+#else
+    /* 160 bit accumulator. */
+    uint64_t c0 = 0, c1 = 0;
+    uint32_t c2 = 0;
+
+    /* l[0..7] = a[0..3] * b[0..3]. */
+    muladd_fast(a->d[0], b->d[0]);
+    extract_fast(l[0]);
+    muladd(a->d[0], b->d[1]);
+    muladd(a->d[1], b->d[0]);
+    extract(l[1]);
+    muladd(a->d[0], b->d[2]);
+    muladd(a->d[1], b->d[1]);
+    muladd(a->d[2], b->d[0]);
+    extract(l[2]);
+    muladd(a->d[0], b->d[3]);
+    muladd(a->d[1], b->d[2]);
+    muladd(a->d[2], b->d[1]);
+    muladd(a->d[3], b->d[0]);
+    extract(l[3]);
+    muladd(a->d[1], b->d[3]);
+    muladd(a->d[2], b->d[2]);
+    muladd(a->d[3], b->d[1]);
+    extract(l[4]);
+    muladd(a->d[2], b->d[3]);
+    muladd(a->d[3], b->d[2]);
+    extract(l[5]);
+    muladd_fast(a->d[3], b->d[3]);
+    extract_fast(l[6]);
+    VERIFY_CHECK(c1 == 0);
+    l[7] = c0;
+#endif
+}
+
+static void secp256k1_scalar_sqr_512(uint64_t l[8], const secp256k1_scalar *a) {
+#ifdef USE_ASM_X86_64
+    __asm__ __volatile__(
+    /* Preload */
+    "movq 0(%%rdi), %%r11\n"
+    "movq 8(%%rdi), %%r12\n"
+    "movq 16(%%rdi), %%r13\n"
+    "movq 24(%%rdi), %%r14\n"
+    /* (rax,rdx) = a0 * a0 */
+    "movq %%r11, %%rax\n"
+    "mulq %%r11\n"
+    /* Extract l0 */
+    "movq %%rax, 0(%%rsi)\n"
+    /* (r8,r9,r10) = (rdx,0) */
+    "movq %%rdx, %%r8\n"
+    "xorq %%r9, %%r9\n"
+    "xorq %%r10, %%r10\n"
+    /* (r8,r9,r10) += 2 * a0 * a1 */
+    "movq %%r11, %%rax\n"
+    "mulq %%r12\n"
+    "addq %%rax, %%r8\n"
+    "adcq %%rdx, %%r9\n"
+    "adcq $0, %%r10\n"
+    "addq %%rax, %%r8\n"
+    "adcq %%rdx, %%r9\n"
+    "adcq $0, %%r10\n"
+    /* Extract l1 */
+    "movq %%r8, 8(%%rsi)\n"
+    "xorq %%r8, %%r8\n"
+    /* (r9,r10,r8) += 2 * a0 * a2 */
+    "movq %%r11, %%rax\n"
+    "mulq %%r13\n"
+    "addq %%rax, %%r9\n"
+    "adcq %%rdx, %%r10\n"
+    "adcq $0, %%r8\n"
+    "addq %%rax, %%r9\n"
+    "adcq %%rdx, %%r10\n"
+    "adcq $0, %%r8\n"
+    /* (r9,r10,r8) += a1 * a1 */
+    "movq %%r12, %%rax\n"
+    "mulq %%r12\n"
+    "addq %%rax, %%r9\n"
+    "adcq %%rdx, %%r10\n"
+    "adcq $0, %%r8\n"
+    /* Extract l2 */
+    "movq %%r9, 16(%%rsi)\n"
+    "xorq %%r9, %%r9\n"
+    /* (r10,r8,r9) += 2 * a0 * a3 */
+    "movq %%r11, %%rax\n"
+    "mulq %%r14\n"
+    "addq %%rax, %%r10\n"
+    "adcq %%rdx, %%r8\n"
+    "adcq $0, %%r9\n"
+    "addq %%rax, %%r10\n"
+    "adcq %%rdx, %%r8\n"
+    "adcq $0, %%r9\n"
+    /* (r10,r8,r9) += 2 * a1 * a2 */
+    "movq %%r12, %%rax\n"
+    "mulq %%r13\n"
+    "addq %%rax, %%r10\n"
+    "adcq %%rdx, %%r8\n"
+    "adcq $0, %%r9\n"
+    "addq %%rax, %%r10\n"
+    "adcq %%rdx, %%r8\n"
+    "adcq $0, %%r9\n"
+    /* Extract l3 */
+    "movq %%r10, 24(%%rsi)\n"
+    "xorq %%r10, %%r10\n"
+    /* (r8,r9,r10) += 2 * a1 * a3 */
+    "movq %%r12, %%rax\n"
+    "mulq %%r14\n"
+    "addq %%rax, %%r8\n"
+    "adcq %%rdx, %%r9\n"
+    "adcq $0, %%r10\n"
+    "addq %%rax, %%r8\n"
+    "adcq %%rdx, %%r9\n"
+    "adcq $0, %%r10\n"
+    /* (r8,r9,r10) += a2 * a2 */
+    "movq %%r13, %%rax\n"
+    "mulq %%r13\n"
+    "addq %%rax, %%r8\n"
+    "adcq %%rdx, %%r9\n"
+    "adcq $0, %%r10\n"
+    /* Extract l4 */
+    "movq %%r8, 32(%%rsi)\n"
+    "xorq %%r8, %%r8\n"
+    /* (r9,r10,r8) += 2 * a2 * a3 */
+    "movq %%r13, %%rax\n"
+    "mulq %%r14\n"
+    "addq %%rax, %%r9\n"
+    "adcq %%rdx, %%r10\n"
+    "adcq $0, %%r8\n"
+    "addq %%rax, %%r9\n"
+    "adcq %%rdx, %%r10\n"
+    "adcq $0, %%r8\n"
+    /* Extract l5 */
+    "movq %%r9, 40(%%rsi)\n"
+    /* (r10,r8) += a3 * a3 */
+    "movq %%r14, %%rax\n"
+    "mulq %%r14\n"
+    "addq %%rax, %%r10\n"
+    "adcq %%rdx, %%r8\n"
+    /* Extract l6 */
+    "movq %%r10, 48(%%rsi)\n"
+    /* Extract l7 */
+    "movq %%r8, 56(%%rsi)\n"
+    :
+    : "S"(l), "D"(a->d)
+    : "rax", "rdx", "r8", "r9", "r10", "r11", "r12", "r13", "r14", "cc", "memory");
+#else
+    /* 160 bit accumulator. */
+    uint64_t c0 = 0, c1 = 0;
+    uint32_t c2 = 0;
+
+    /* l[0..7] = a[0..3] * b[0..3]. */
+    muladd_fast(a->d[0], a->d[0]);
+    extract_fast(l[0]);
+    muladd2(a->d[0], a->d[1]);
+    extract(l[1]);
+    muladd2(a->d[0], a->d[2]);
+    muladd(a->d[1], a->d[1]);
+    extract(l[2]);
+    muladd2(a->d[0], a->d[3]);
+    muladd2(a->d[1], a->d[2]);
+    extract(l[3]);
+    muladd2(a->d[1], a->d[3]);
+    muladd(a->d[2], a->d[2]);
+    extract(l[4]);
+    muladd2(a->d[2], a->d[3]);
+    extract(l[5]);
+    muladd_fast(a->d[3], a->d[3]);
+    extract_fast(l[6]);
+    VERIFY_CHECK(c1 == 0);
+    l[7] = c0;
+#endif
+}
+
+#undef sumadd
+#undef sumadd_fast
+#undef muladd
+#undef muladd_fast
+#undef muladd2
+#undef extract
+#undef extract_fast
+
+static void secp256k1_scalar_mul(secp256k1_scalar *r, const secp256k1_scalar *a, const secp256k1_scalar *b) {
+    uint64_t l[8];
+    secp256k1_scalar_mul_512(l, a, b);
+    secp256k1_scalar_reduce_512(r, l);
+}
+
+static int secp256k1_scalar_shr_int(secp256k1_scalar *r, int n) {
+    int ret;
+    VERIFY_CHECK(n > 0);
+    VERIFY_CHECK(n < 16);
+    ret = r->d[0] & ((1 << n) - 1);
+    r->d[0] = (r->d[0] >> n) + (r->d[1] << (64 - n));
+    r->d[1] = (r->d[1] >> n) + (r->d[2] << (64 - n));
+    r->d[2] = (r->d[2] >> n) + (r->d[3] << (64 - n));
+    r->d[3] = (r->d[3] >> n);
+    return ret;
+}
+
+static void secp256k1_scalar_sqr(secp256k1_scalar *r, const secp256k1_scalar *a) {
+    uint64_t l[8];
+    secp256k1_scalar_sqr_512(l, a);
+    secp256k1_scalar_reduce_512(r, l);
+}
+
+static void secp256k1_scalar_split_128(secp256k1_scalar *r1, secp256k1_scalar *r2, const secp256k1_scalar *k) {
+    r1->d[0] = k->d[0];
+    r1->d[1] = k->d[1];
+    r1->d[2] = 0;
+    r1->d[3] = 0;
+    r2->d[0] = k->d[2];
+    r2->d[1] = k->d[3];
+    r2->d[2] = 0;
+    r2->d[3] = 0;
+}
+
+SECP256K1_INLINE static int secp256k1_scalar_eq(const secp256k1_scalar *a, const secp256k1_scalar *b) {
+    return ((a->d[0] ^ b->d[0]) | (a->d[1] ^ b->d[1]) | (a->d[2] ^ b->d[2]) | (a->d[3] ^ b->d[3])) == 0;
+}
+
+SECP256K1_INLINE static void secp256k1_scalar_mul_shift_var(secp256k1_scalar *r, const secp256k1_scalar *a, const secp256k1_scalar *b, unsigned int shift) {
+    uint64_t l[8];
+    unsigned int shiftlimbs;
+    unsigned int shiftlow;
+    unsigned int shifthigh;
+    VERIFY_CHECK(shift >= 256);
+    secp256k1_scalar_mul_512(l, a, b);
+    shiftlimbs = shift >> 6;
+    shiftlow = shift & 0x3F;
+    shifthigh = 64 - shiftlow;
+    r->d[0] = shift < 512 ? (l[0 + shiftlimbs] >> shiftlow | (shift < 448 && shiftlow ? (l[1 + shiftlimbs] << shifthigh) : 0)) : 0;
+    r->d[1] = shift < 448 ? (l[1 + shiftlimbs] >> shiftlow | (shift < 384 && shiftlow ? (l[2 + shiftlimbs] << shifthigh) : 0)) : 0;
+    r->d[2] = shift < 384 ? (l[2 + shiftlimbs] >> shiftlow | (shift < 320 && shiftlow ? (l[3 + shiftlimbs] << shifthigh) : 0)) : 0;
+    r->d[3] = shift < 320 ? (l[3 + shiftlimbs] >> shiftlow) : 0;
+    secp256k1_scalar_cadd_bit(r, 0, (l[(shift - 1) >> 6] >> ((shift - 1) & 0x3f)) & 1);
+}
+
+static SECP256K1_INLINE void secp256k1_scalar_cmov(secp256k1_scalar *r, const secp256k1_scalar *a, int flag) {
+    uint64_t mask0, mask1;
+    VG_CHECK_VERIFY(r->d, sizeof(r->d));
+    mask0 = flag + ~((uint64_t)0);
+    mask1 = ~mask0;
+    r->d[0] = (r->d[0] & mask0) | (a->d[0] & mask1);
+    r->d[1] = (r->d[1] & mask0) | (a->d[1] & mask1);
+    r->d[2] = (r->d[2] & mask0) | (a->d[2] & mask1);
+    r->d[3] = (r->d[3] & mask0) | (a->d[3] & mask1);
+}
+
+#endif /* SECP256K1_SCALAR_REPR_IMPL_H */
diff --git a/depend/zcash/src/secp256k1/src/scalar_8x32.h b/depend/zcash/src/secp256k1/src/scalar_8x32.h
new file mode 100644
index 000000000..17863ef93
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/scalar_8x32.h
@@ -0,0 +1,19 @@
+/***********************************************************************
+ * Copyright (c) 2014 Pieter Wuille                                    *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_SCALAR_REPR_H
+#define SECP256K1_SCALAR_REPR_H
+
+#include <stdint.h>
+
+/** A scalar modulo the group order of the secp256k1 curve. */
+typedef struct {
+    uint32_t d[8];
+} secp256k1_scalar;
+
+#define SECP256K1_SCALAR_CONST(d7, d6, d5, d4, d3, d2, d1, d0) {{(d0), (d1), (d2), (d3), (d4), (d5), (d6), (d7)}}
+
+#endif /* SECP256K1_SCALAR_REPR_H */
diff --git a/depend/zcash/src/secp256k1/src/scalar_8x32_impl.h b/depend/zcash/src/secp256k1/src/scalar_8x32_impl.h
new file mode 100644
index 000000000..bf98e01d7
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/scalar_8x32_impl.h
@@ -0,0 +1,734 @@
+/***********************************************************************
+ * Copyright (c) 2014 Pieter Wuille                                    *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_SCALAR_REPR_IMPL_H
+#define SECP256K1_SCALAR_REPR_IMPL_H
+
+/* Limbs of the secp256k1 order. */
+#define SECP256K1_N_0 ((uint32_t)0xD0364141UL)
+#define SECP256K1_N_1 ((uint32_t)0xBFD25E8CUL)
+#define SECP256K1_N_2 ((uint32_t)0xAF48A03BUL)
+#define SECP256K1_N_3 ((uint32_t)0xBAAEDCE6UL)
+#define SECP256K1_N_4 ((uint32_t)0xFFFFFFFEUL)
+#define SECP256K1_N_5 ((uint32_t)0xFFFFFFFFUL)
+#define SECP256K1_N_6 ((uint32_t)0xFFFFFFFFUL)
+#define SECP256K1_N_7 ((uint32_t)0xFFFFFFFFUL)
+
+/* Limbs of 2^256 minus the secp256k1 order. */
+#define SECP256K1_N_C_0 (~SECP256K1_N_0 + 1)
+#define SECP256K1_N_C_1 (~SECP256K1_N_1)
+#define SECP256K1_N_C_2 (~SECP256K1_N_2)
+#define SECP256K1_N_C_3 (~SECP256K1_N_3)
+#define SECP256K1_N_C_4 (1)
+
+/* Limbs of half the secp256k1 order. */
+#define SECP256K1_N_H_0 ((uint32_t)0x681B20A0UL)
+#define SECP256K1_N_H_1 ((uint32_t)0xDFE92F46UL)
+#define SECP256K1_N_H_2 ((uint32_t)0x57A4501DUL)
+#define SECP256K1_N_H_3 ((uint32_t)0x5D576E73UL)
+#define SECP256K1_N_H_4 ((uint32_t)0xFFFFFFFFUL)
+#define SECP256K1_N_H_5 ((uint32_t)0xFFFFFFFFUL)
+#define SECP256K1_N_H_6 ((uint32_t)0xFFFFFFFFUL)
+#define SECP256K1_N_H_7 ((uint32_t)0x7FFFFFFFUL)
+
+SECP256K1_INLINE static void secp256k1_scalar_clear(secp256k1_scalar *r) {
+    r->d[0] = 0;
+    r->d[1] = 0;
+    r->d[2] = 0;
+    r->d[3] = 0;
+    r->d[4] = 0;
+    r->d[5] = 0;
+    r->d[6] = 0;
+    r->d[7] = 0;
+}
+
+SECP256K1_INLINE static void secp256k1_scalar_set_int(secp256k1_scalar *r, unsigned int v) {
+    r->d[0] = v;
+    r->d[1] = 0;
+    r->d[2] = 0;
+    r->d[3] = 0;
+    r->d[4] = 0;
+    r->d[5] = 0;
+    r->d[6] = 0;
+    r->d[7] = 0;
+}
+
+SECP256K1_INLINE static unsigned int secp256k1_scalar_get_bits(const secp256k1_scalar *a, unsigned int offset, unsigned int count) {
+    VERIFY_CHECK((offset + count - 1) >> 5 == offset >> 5);
+    return (a->d[offset >> 5] >> (offset & 0x1F)) & ((1 << count) - 1);
+}
+
+SECP256K1_INLINE static unsigned int secp256k1_scalar_get_bits_var(const secp256k1_scalar *a, unsigned int offset, unsigned int count) {
+    VERIFY_CHECK(count < 32);
+    VERIFY_CHECK(offset + count <= 256);
+    if ((offset + count - 1) >> 5 == offset >> 5) {
+        return secp256k1_scalar_get_bits(a, offset, count);
+    } else {
+        VERIFY_CHECK((offset >> 5) + 1 < 8);
+        return ((a->d[offset >> 5] >> (offset & 0x1F)) | (a->d[(offset >> 5) + 1] << (32 - (offset & 0x1F)))) & ((((uint32_t)1) << count) - 1);
+    }
+}
+
+SECP256K1_INLINE static int secp256k1_scalar_check_overflow(const secp256k1_scalar *a) {
+    int yes = 0;
+    int no = 0;
+    no |= (a->d[7] < SECP256K1_N_7); /* No need for a > check. */
+    no |= (a->d[6] < SECP256K1_N_6); /* No need for a > check. */
+    no |= (a->d[5] < SECP256K1_N_5); /* No need for a > check. */
+    no |= (a->d[4] < SECP256K1_N_4);
+    yes |= (a->d[4] > SECP256K1_N_4) & ~no;
+    no |= (a->d[3] < SECP256K1_N_3) & ~yes;
+    yes |= (a->d[3] > SECP256K1_N_3) & ~no;
+    no |= (a->d[2] < SECP256K1_N_2) & ~yes;
+    yes |= (a->d[2] > SECP256K1_N_2) & ~no;
+    no |= (a->d[1] < SECP256K1_N_1) & ~yes;
+    yes |= (a->d[1] > SECP256K1_N_1) & ~no;
+    yes |= (a->d[0] >= SECP256K1_N_0) & ~no;
+    return yes;
+}
+
+SECP256K1_INLINE static int secp256k1_scalar_reduce(secp256k1_scalar *r, uint32_t overflow) {
+    uint64_t t;
+    VERIFY_CHECK(overflow <= 1);
+    t = (uint64_t)r->d[0] + overflow * SECP256K1_N_C_0;
+    r->d[0] = t & 0xFFFFFFFFUL; t >>= 32;
+    t += (uint64_t)r->d[1] + overflow * SECP256K1_N_C_1;
+    r->d[1] = t & 0xFFFFFFFFUL; t >>= 32;
+    t += (uint64_t)r->d[2] + overflow * SECP256K1_N_C_2;
+    r->d[2] = t & 0xFFFFFFFFUL; t >>= 32;
+    t += (uint64_t)r->d[3] + overflow * SECP256K1_N_C_3;
+    r->d[3] = t & 0xFFFFFFFFUL; t >>= 32;
+    t += (uint64_t)r->d[4] + overflow * SECP256K1_N_C_4;
+    r->d[4] = t & 0xFFFFFFFFUL; t >>= 32;
+    t += (uint64_t)r->d[5];
+    r->d[5] = t & 0xFFFFFFFFUL; t >>= 32;
+    t += (uint64_t)r->d[6];
+    r->d[6] = t & 0xFFFFFFFFUL; t >>= 32;
+    t += (uint64_t)r->d[7];
+    r->d[7] = t & 0xFFFFFFFFUL;
+    return overflow;
+}
+
+static int secp256k1_scalar_add(secp256k1_scalar *r, const secp256k1_scalar *a, const secp256k1_scalar *b) {
+    int overflow;
+    uint64_t t = (uint64_t)a->d[0] + b->d[0];
+    r->d[0] = t & 0xFFFFFFFFULL; t >>= 32;
+    t += (uint64_t)a->d[1] + b->d[1];
+    r->d[1] = t & 0xFFFFFFFFULL; t >>= 32;
+    t += (uint64_t)a->d[2] + b->d[2];
+    r->d[2] = t & 0xFFFFFFFFULL; t >>= 32;
+    t += (uint64_t)a->d[3] + b->d[3];
+    r->d[3] = t & 0xFFFFFFFFULL; t >>= 32;
+    t += (uint64_t)a->d[4] + b->d[4];
+    r->d[4] = t & 0xFFFFFFFFULL; t >>= 32;
+    t += (uint64_t)a->d[5] + b->d[5];
+    r->d[5] = t & 0xFFFFFFFFULL; t >>= 32;
+    t += (uint64_t)a->d[6] + b->d[6];
+    r->d[6] = t & 0xFFFFFFFFULL; t >>= 32;
+    t += (uint64_t)a->d[7] + b->d[7];
+    r->d[7] = t & 0xFFFFFFFFULL; t >>= 32;
+    overflow = t + secp256k1_scalar_check_overflow(r);
+    VERIFY_CHECK(overflow == 0 || overflow == 1);
+    secp256k1_scalar_reduce(r, overflow);
+    return overflow;
+}
+
+static void secp256k1_scalar_cadd_bit(secp256k1_scalar *r, unsigned int bit, int flag) {
+    uint64_t t;
+    VERIFY_CHECK(bit < 256);
+    bit += ((uint32_t) flag - 1) & 0x100;  /* forcing (bit >> 5) > 7 makes this a noop */
+    t = (uint64_t)r->d[0] + (((uint32_t)((bit >> 5) == 0)) << (bit & 0x1F));
+    r->d[0] = t & 0xFFFFFFFFULL; t >>= 32;
+    t += (uint64_t)r->d[1] + (((uint32_t)((bit >> 5) == 1)) << (bit & 0x1F));
+    r->d[1] = t & 0xFFFFFFFFULL; t >>= 32;
+    t += (uint64_t)r->d[2] + (((uint32_t)((bit >> 5) == 2)) << (bit & 0x1F));
+    r->d[2] = t & 0xFFFFFFFFULL; t >>= 32;
+    t += (uint64_t)r->d[3] + (((uint32_t)((bit >> 5) == 3)) << (bit & 0x1F));
+    r->d[3] = t & 0xFFFFFFFFULL; t >>= 32;
+    t += (uint64_t)r->d[4] + (((uint32_t)((bit >> 5) == 4)) << (bit & 0x1F));
+    r->d[4] = t & 0xFFFFFFFFULL; t >>= 32;
+    t += (uint64_t)r->d[5] + (((uint32_t)((bit >> 5) == 5)) << (bit & 0x1F));
+    r->d[5] = t & 0xFFFFFFFFULL; t >>= 32;
+    t += (uint64_t)r->d[6] + (((uint32_t)((bit >> 5) == 6)) << (bit & 0x1F));
+    r->d[6] = t & 0xFFFFFFFFULL; t >>= 32;
+    t += (uint64_t)r->d[7] + (((uint32_t)((bit >> 5) == 7)) << (bit & 0x1F));
+    r->d[7] = t & 0xFFFFFFFFULL;
+#ifdef VERIFY
+    VERIFY_CHECK((t >> 32) == 0);
+    VERIFY_CHECK(secp256k1_scalar_check_overflow(r) == 0);
+#endif
+}
+
+static void secp256k1_scalar_set_b32(secp256k1_scalar *r, const unsigned char *b32, int *overflow) {
+    int over;
+    r->d[0] = (uint32_t)b32[31] | (uint32_t)b32[30] << 8 | (uint32_t)b32[29] << 16 | (uint32_t)b32[28] << 24;
+    r->d[1] = (uint32_t)b32[27] | (uint32_t)b32[26] << 8 | (uint32_t)b32[25] << 16 | (uint32_t)b32[24] << 24;
+    r->d[2] = (uint32_t)b32[23] | (uint32_t)b32[22] << 8 | (uint32_t)b32[21] << 16 | (uint32_t)b32[20] << 24;
+    r->d[3] = (uint32_t)b32[19] | (uint32_t)b32[18] << 8 | (uint32_t)b32[17] << 16 | (uint32_t)b32[16] << 24;
+    r->d[4] = (uint32_t)b32[15] | (uint32_t)b32[14] << 8 | (uint32_t)b32[13] << 16 | (uint32_t)b32[12] << 24;
+    r->d[5] = (uint32_t)b32[11] | (uint32_t)b32[10] << 8 | (uint32_t)b32[9] << 16 | (uint32_t)b32[8] << 24;
+    r->d[6] = (uint32_t)b32[7] | (uint32_t)b32[6] << 8 | (uint32_t)b32[5] << 16 | (uint32_t)b32[4] << 24;
+    r->d[7] = (uint32_t)b32[3] | (uint32_t)b32[2] << 8 | (uint32_t)b32[1] << 16 | (uint32_t)b32[0] << 24;
+    over = secp256k1_scalar_reduce(r, secp256k1_scalar_check_overflow(r));
+    if (overflow) {
+        *overflow = over;
+    }
+}
+
+static void secp256k1_scalar_get_b32(unsigned char *bin, const secp256k1_scalar* a) {
+    bin[0] = a->d[7] >> 24; bin[1] = a->d[7] >> 16; bin[2] = a->d[7] >> 8; bin[3] = a->d[7];
+    bin[4] = a->d[6] >> 24; bin[5] = a->d[6] >> 16; bin[6] = a->d[6] >> 8; bin[7] = a->d[6];
+    bin[8] = a->d[5] >> 24; bin[9] = a->d[5] >> 16; bin[10] = a->d[5] >> 8; bin[11] = a->d[5];
+    bin[12] = a->d[4] >> 24; bin[13] = a->d[4] >> 16; bin[14] = a->d[4] >> 8; bin[15] = a->d[4];
+    bin[16] = a->d[3] >> 24; bin[17] = a->d[3] >> 16; bin[18] = a->d[3] >> 8; bin[19] = a->d[3];
+    bin[20] = a->d[2] >> 24; bin[21] = a->d[2] >> 16; bin[22] = a->d[2] >> 8; bin[23] = a->d[2];
+    bin[24] = a->d[1] >> 24; bin[25] = a->d[1] >> 16; bin[26] = a->d[1] >> 8; bin[27] = a->d[1];
+    bin[28] = a->d[0] >> 24; bin[29] = a->d[0] >> 16; bin[30] = a->d[0] >> 8; bin[31] = a->d[0];
+}
+
+SECP256K1_INLINE static int secp256k1_scalar_is_zero(const secp256k1_scalar *a) {
+    return (a->d[0] | a->d[1] | a->d[2] | a->d[3] | a->d[4] | a->d[5] | a->d[6] | a->d[7]) == 0;
+}
+
+static void secp256k1_scalar_negate(secp256k1_scalar *r, const secp256k1_scalar *a) {
+    uint32_t nonzero = 0xFFFFFFFFUL * (secp256k1_scalar_is_zero(a) == 0);
+    uint64_t t = (uint64_t)(~a->d[0]) + SECP256K1_N_0 + 1;
+    r->d[0] = t & nonzero; t >>= 32;
+    t += (uint64_t)(~a->d[1]) + SECP256K1_N_1;
+    r->d[1] = t & nonzero; t >>= 32;
+    t += (uint64_t)(~a->d[2]) + SECP256K1_N_2;
+    r->d[2] = t & nonzero; t >>= 32;
+    t += (uint64_t)(~a->d[3]) + SECP256K1_N_3;
+    r->d[3] = t & nonzero; t >>= 32;
+    t += (uint64_t)(~a->d[4]) + SECP256K1_N_4;
+    r->d[4] = t & nonzero; t >>= 32;
+    t += (uint64_t)(~a->d[5]) + SECP256K1_N_5;
+    r->d[5] = t & nonzero; t >>= 32;
+    t += (uint64_t)(~a->d[6]) + SECP256K1_N_6;
+    r->d[6] = t & nonzero; t >>= 32;
+    t += (uint64_t)(~a->d[7]) + SECP256K1_N_7;
+    r->d[7] = t & nonzero;
+}
+
+SECP256K1_INLINE static int secp256k1_scalar_is_one(const secp256k1_scalar *a) {
+    return ((a->d[0] ^ 1) | a->d[1] | a->d[2] | a->d[3] | a->d[4] | a->d[5] | a->d[6] | a->d[7]) == 0;
+}
+
+static int secp256k1_scalar_is_high(const secp256k1_scalar *a) {
+    int yes = 0;
+    int no = 0;
+    no |= (a->d[7] < SECP256K1_N_H_7);
+    yes |= (a->d[7] > SECP256K1_N_H_7) & ~no;
+    no |= (a->d[6] < SECP256K1_N_H_6) & ~yes; /* No need for a > check. */
+    no |= (a->d[5] < SECP256K1_N_H_5) & ~yes; /* No need for a > check. */
+    no |= (a->d[4] < SECP256K1_N_H_4) & ~yes; /* No need for a > check. */
+    no |= (a->d[3] < SECP256K1_N_H_3) & ~yes;
+    yes |= (a->d[3] > SECP256K1_N_H_3) & ~no;
+    no |= (a->d[2] < SECP256K1_N_H_2) & ~yes;
+    yes |= (a->d[2] > SECP256K1_N_H_2) & ~no;
+    no |= (a->d[1] < SECP256K1_N_H_1) & ~yes;
+    yes |= (a->d[1] > SECP256K1_N_H_1) & ~no;
+    yes |= (a->d[0] > SECP256K1_N_H_0) & ~no;
+    return yes;
+}
+
+static int secp256k1_scalar_cond_negate(secp256k1_scalar *r, int flag) {
+    /* If we are flag = 0, mask = 00...00 and this is a no-op;
+     * if we are flag = 1, mask = 11...11 and this is identical to secp256k1_scalar_negate */
+    uint32_t mask = !flag - 1;
+    uint32_t nonzero = 0xFFFFFFFFUL * (secp256k1_scalar_is_zero(r) == 0);
+    uint64_t t = (uint64_t)(r->d[0] ^ mask) + ((SECP256K1_N_0 + 1) & mask);
+    r->d[0] = t & nonzero; t >>= 32;
+    t += (uint64_t)(r->d[1] ^ mask) + (SECP256K1_N_1 & mask);
+    r->d[1] = t & nonzero; t >>= 32;
+    t += (uint64_t)(r->d[2] ^ mask) + (SECP256K1_N_2 & mask);
+    r->d[2] = t & nonzero; t >>= 32;
+    t += (uint64_t)(r->d[3] ^ mask) + (SECP256K1_N_3 & mask);
+    r->d[3] = t & nonzero; t >>= 32;
+    t += (uint64_t)(r->d[4] ^ mask) + (SECP256K1_N_4 & mask);
+    r->d[4] = t & nonzero; t >>= 32;
+    t += (uint64_t)(r->d[5] ^ mask) + (SECP256K1_N_5 & mask);
+    r->d[5] = t & nonzero; t >>= 32;
+    t += (uint64_t)(r->d[6] ^ mask) + (SECP256K1_N_6 & mask);
+    r->d[6] = t & nonzero; t >>= 32;
+    t += (uint64_t)(r->d[7] ^ mask) + (SECP256K1_N_7 & mask);
+    r->d[7] = t & nonzero;
+    return 2 * (mask == 0) - 1;
+}
+
+
+/* Inspired by the macros in OpenSSL's crypto/bn/asm/x86_64-gcc.c. */
+
+/** Add a*b to the number defined by (c0,c1,c2). c2 must never overflow. */
+#define muladd(a,b) { \
+    uint32_t tl, th; \
+    { \
+        uint64_t t = (uint64_t)a * b; \
+        th = t >> 32;         /* at most 0xFFFFFFFE */ \
+        tl = t; \
+    } \
+    c0 += tl;                 /* overflow is handled on the next line */ \
+    th += (c0 < tl);          /* at most 0xFFFFFFFF */ \
+    c1 += th;                 /* overflow is handled on the next line */ \
+    c2 += (c1 < th);          /* never overflows by contract (verified in the next line) */ \
+    VERIFY_CHECK((c1 >= th) || (c2 != 0)); \
+}
+
+/** Add a*b to the number defined by (c0,c1). c1 must never overflow. */
+#define muladd_fast(a,b) { \
+    uint32_t tl, th; \
+    { \
+        uint64_t t = (uint64_t)a * b; \
+        th = t >> 32;         /* at most 0xFFFFFFFE */ \
+        tl = t; \
+    } \
+    c0 += tl;                 /* overflow is handled on the next line */ \
+    th += (c0 < tl);          /* at most 0xFFFFFFFF */ \
+    c1 += th;                 /* never overflows by contract (verified in the next line) */ \
+    VERIFY_CHECK(c1 >= th); \
+}
+
+/** Add 2*a*b to the number defined by (c0,c1,c2). c2 must never overflow. */
+#define muladd2(a,b) { \
+    uint32_t tl, th, th2, tl2; \
+    { \
+        uint64_t t = (uint64_t)a * b; \
+        th = t >> 32;               /* at most 0xFFFFFFFE */ \
+        tl = t; \
+    } \
+    th2 = th + th;                  /* at most 0xFFFFFFFE (in case th was 0x7FFFFFFF) */ \
+    c2 += (th2 < th);               /* never overflows by contract (verified the next line) */ \
+    VERIFY_CHECK((th2 >= th) || (c2 != 0)); \
+    tl2 = tl + tl;                  /* at most 0xFFFFFFFE (in case the lowest 63 bits of tl were 0x7FFFFFFF) */ \
+    th2 += (tl2 < tl);              /* at most 0xFFFFFFFF */ \
+    c0 += tl2;                      /* overflow is handled on the next line */ \
+    th2 += (c0 < tl2);              /* second overflow is handled on the next line */ \
+    c2 += (c0 < tl2) & (th2 == 0);  /* never overflows by contract (verified the next line) */ \
+    VERIFY_CHECK((c0 >= tl2) || (th2 != 0) || (c2 != 0)); \
+    c1 += th2;                      /* overflow is handled on the next line */ \
+    c2 += (c1 < th2);               /* never overflows by contract (verified the next line) */ \
+    VERIFY_CHECK((c1 >= th2) || (c2 != 0)); \
+}
+
+/** Add a to the number defined by (c0,c1,c2). c2 must never overflow. */
+#define sumadd(a) { \
+    unsigned int over; \
+    c0 += (a);                  /* overflow is handled on the next line */ \
+    over = (c0 < (a)); \
+    c1 += over;                 /* overflow is handled on the next line */ \
+    c2 += (c1 < over);          /* never overflows by contract */ \
+}
+
+/** Add a to the number defined by (c0,c1). c1 must never overflow, c2 must be zero. */
+#define sumadd_fast(a) { \
+    c0 += (a);                 /* overflow is handled on the next line */ \
+    c1 += (c0 < (a));          /* never overflows by contract (verified the next line) */ \
+    VERIFY_CHECK((c1 != 0) | (c0 >= (a))); \
+    VERIFY_CHECK(c2 == 0); \
+}
+
+/** Extract the lowest 32 bits of (c0,c1,c2) into n, and left shift the number 32 bits. */
+#define extract(n) { \
+    (n) = c0; \
+    c0 = c1; \
+    c1 = c2; \
+    c2 = 0; \
+}
+
+/** Extract the lowest 32 bits of (c0,c1,c2) into n, and left shift the number 32 bits. c2 is required to be zero. */
+#define extract_fast(n) { \
+    (n) = c0; \
+    c0 = c1; \
+    c1 = 0; \
+    VERIFY_CHECK(c2 == 0); \
+}
+
+static void secp256k1_scalar_reduce_512(secp256k1_scalar *r, const uint32_t *l) {
+    uint64_t c;
+    uint32_t n0 = l[8], n1 = l[9], n2 = l[10], n3 = l[11], n4 = l[12], n5 = l[13], n6 = l[14], n7 = l[15];
+    uint32_t m0, m1, m2, m3, m4, m5, m6, m7, m8, m9, m10, m11, m12;
+    uint32_t p0, p1, p2, p3, p4, p5, p6, p7, p8;
+
+    /* 96 bit accumulator. */
+    uint32_t c0, c1, c2;
+
+    /* Reduce 512 bits into 385. */
+    /* m[0..12] = l[0..7] + n[0..7] * SECP256K1_N_C. */
+    c0 = l[0]; c1 = 0; c2 = 0;
+    muladd_fast(n0, SECP256K1_N_C_0);
+    extract_fast(m0);
+    sumadd_fast(l[1]);
+    muladd(n1, SECP256K1_N_C_0);
+    muladd(n0, SECP256K1_N_C_1);
+    extract(m1);
+    sumadd(l[2]);
+    muladd(n2, SECP256K1_N_C_0);
+    muladd(n1, SECP256K1_N_C_1);
+    muladd(n0, SECP256K1_N_C_2);
+    extract(m2);
+    sumadd(l[3]);
+    muladd(n3, SECP256K1_N_C_0);
+    muladd(n2, SECP256K1_N_C_1);
+    muladd(n1, SECP256K1_N_C_2);
+    muladd(n0, SECP256K1_N_C_3);
+    extract(m3);
+    sumadd(l[4]);
+    muladd(n4, SECP256K1_N_C_0);
+    muladd(n3, SECP256K1_N_C_1);
+    muladd(n2, SECP256K1_N_C_2);
+    muladd(n1, SECP256K1_N_C_3);
+    sumadd(n0);
+    extract(m4);
+    sumadd(l[5]);
+    muladd(n5, SECP256K1_N_C_0);
+    muladd(n4, SECP256K1_N_C_1);
+    muladd(n3, SECP256K1_N_C_2);
+    muladd(n2, SECP256K1_N_C_3);
+    sumadd(n1);
+    extract(m5);
+    sumadd(l[6]);
+    muladd(n6, SECP256K1_N_C_0);
+    muladd(n5, SECP256K1_N_C_1);
+    muladd(n4, SECP256K1_N_C_2);
+    muladd(n3, SECP256K1_N_C_3);
+    sumadd(n2);
+    extract(m6);
+    sumadd(l[7]);
+    muladd(n7, SECP256K1_N_C_0);
+    muladd(n6, SECP256K1_N_C_1);
+    muladd(n5, SECP256K1_N_C_2);
+    muladd(n4, SECP256K1_N_C_3);
+    sumadd(n3);
+    extract(m7);
+    muladd(n7, SECP256K1_N_C_1);
+    muladd(n6, SECP256K1_N_C_2);
+    muladd(n5, SECP256K1_N_C_3);
+    sumadd(n4);
+    extract(m8);
+    muladd(n7, SECP256K1_N_C_2);
+    muladd(n6, SECP256K1_N_C_3);
+    sumadd(n5);
+    extract(m9);
+    muladd(n7, SECP256K1_N_C_3);
+    sumadd(n6);
+    extract(m10);
+    sumadd_fast(n7);
+    extract_fast(m11);
+    VERIFY_CHECK(c0 <= 1);
+    m12 = c0;
+
+    /* Reduce 385 bits into 258. */
+    /* p[0..8] = m[0..7] + m[8..12] * SECP256K1_N_C. */
+    c0 = m0; c1 = 0; c2 = 0;
+    muladd_fast(m8, SECP256K1_N_C_0);
+    extract_fast(p0);
+    sumadd_fast(m1);
+    muladd(m9, SECP256K1_N_C_0);
+    muladd(m8, SECP256K1_N_C_1);
+    extract(p1);
+    sumadd(m2);
+    muladd(m10, SECP256K1_N_C_0);
+    muladd(m9, SECP256K1_N_C_1);
+    muladd(m8, SECP256K1_N_C_2);
+    extract(p2);
+    sumadd(m3);
+    muladd(m11, SECP256K1_N_C_0);
+    muladd(m10, SECP256K1_N_C_1);
+    muladd(m9, SECP256K1_N_C_2);
+    muladd(m8, SECP256K1_N_C_3);
+    extract(p3);
+    sumadd(m4);
+    muladd(m12, SECP256K1_N_C_0);
+    muladd(m11, SECP256K1_N_C_1);
+    muladd(m10, SECP256K1_N_C_2);
+    muladd(m9, SECP256K1_N_C_3);
+    sumadd(m8);
+    extract(p4);
+    sumadd(m5);
+    muladd(m12, SECP256K1_N_C_1);
+    muladd(m11, SECP256K1_N_C_2);
+    muladd(m10, SECP256K1_N_C_3);
+    sumadd(m9);
+    extract(p5);
+    sumadd(m6);
+    muladd(m12, SECP256K1_N_C_2);
+    muladd(m11, SECP256K1_N_C_3);
+    sumadd(m10);
+    extract(p6);
+    sumadd_fast(m7);
+    muladd_fast(m12, SECP256K1_N_C_3);
+    sumadd_fast(m11);
+    extract_fast(p7);
+    p8 = c0 + m12;
+    VERIFY_CHECK(p8 <= 2);
+
+    /* Reduce 258 bits into 256. */
+    /* r[0..7] = p[0..7] + p[8] * SECP256K1_N_C. */
+    c = p0 + (uint64_t)SECP256K1_N_C_0 * p8;
+    r->d[0] = c & 0xFFFFFFFFUL; c >>= 32;
+    c += p1 + (uint64_t)SECP256K1_N_C_1 * p8;
+    r->d[1] = c & 0xFFFFFFFFUL; c >>= 32;
+    c += p2 + (uint64_t)SECP256K1_N_C_2 * p8;
+    r->d[2] = c & 0xFFFFFFFFUL; c >>= 32;
+    c += p3 + (uint64_t)SECP256K1_N_C_3 * p8;
+    r->d[3] = c & 0xFFFFFFFFUL; c >>= 32;
+    c += p4 + (uint64_t)p8;
+    r->d[4] = c & 0xFFFFFFFFUL; c >>= 32;
+    c += p5;
+    r->d[5] = c & 0xFFFFFFFFUL; c >>= 32;
+    c += p6;
+    r->d[6] = c & 0xFFFFFFFFUL; c >>= 32;
+    c += p7;
+    r->d[7] = c & 0xFFFFFFFFUL; c >>= 32;
+
+    /* Final reduction of r. */
+    secp256k1_scalar_reduce(r, c + secp256k1_scalar_check_overflow(r));
+}
+
+static void secp256k1_scalar_mul_512(uint32_t *l, const secp256k1_scalar *a, const secp256k1_scalar *b) {
+    /* 96 bit accumulator. */
+    uint32_t c0 = 0, c1 = 0, c2 = 0;
+
+    /* l[0..15] = a[0..7] * b[0..7]. */
+    muladd_fast(a->d[0], b->d[0]);
+    extract_fast(l[0]);
+    muladd(a->d[0], b->d[1]);
+    muladd(a->d[1], b->d[0]);
+    extract(l[1]);
+    muladd(a->d[0], b->d[2]);
+    muladd(a->d[1], b->d[1]);
+    muladd(a->d[2], b->d[0]);
+    extract(l[2]);
+    muladd(a->d[0], b->d[3]);
+    muladd(a->d[1], b->d[2]);
+    muladd(a->d[2], b->d[1]);
+    muladd(a->d[3], b->d[0]);
+    extract(l[3]);
+    muladd(a->d[0], b->d[4]);
+    muladd(a->d[1], b->d[3]);
+    muladd(a->d[2], b->d[2]);
+    muladd(a->d[3], b->d[1]);
+    muladd(a->d[4], b->d[0]);
+    extract(l[4]);
+    muladd(a->d[0], b->d[5]);
+    muladd(a->d[1], b->d[4]);
+    muladd(a->d[2], b->d[3]);
+    muladd(a->d[3], b->d[2]);
+    muladd(a->d[4], b->d[1]);
+    muladd(a->d[5], b->d[0]);
+    extract(l[5]);
+    muladd(a->d[0], b->d[6]);
+    muladd(a->d[1], b->d[5]);
+    muladd(a->d[2], b->d[4]);
+    muladd(a->d[3], b->d[3]);
+    muladd(a->d[4], b->d[2]);
+    muladd(a->d[5], b->d[1]);
+    muladd(a->d[6], b->d[0]);
+    extract(l[6]);
+    muladd(a->d[0], b->d[7]);
+    muladd(a->d[1], b->d[6]);
+    muladd(a->d[2], b->d[5]);
+    muladd(a->d[3], b->d[4]);
+    muladd(a->d[4], b->d[3]);
+    muladd(a->d[5], b->d[2]);
+    muladd(a->d[6], b->d[1]);
+    muladd(a->d[7], b->d[0]);
+    extract(l[7]);
+    muladd(a->d[1], b->d[7]);
+    muladd(a->d[2], b->d[6]);
+    muladd(a->d[3], b->d[5]);
+    muladd(a->d[4], b->d[4]);
+    muladd(a->d[5], b->d[3]);
+    muladd(a->d[6], b->d[2]);
+    muladd(a->d[7], b->d[1]);
+    extract(l[8]);
+    muladd(a->d[2], b->d[7]);
+    muladd(a->d[3], b->d[6]);
+    muladd(a->d[4], b->d[5]);
+    muladd(a->d[5], b->d[4]);
+    muladd(a->d[6], b->d[3]);
+    muladd(a->d[7], b->d[2]);
+    extract(l[9]);
+    muladd(a->d[3], b->d[7]);
+    muladd(a->d[4], b->d[6]);
+    muladd(a->d[5], b->d[5]);
+    muladd(a->d[6], b->d[4]);
+    muladd(a->d[7], b->d[3]);
+    extract(l[10]);
+    muladd(a->d[4], b->d[7]);
+    muladd(a->d[5], b->d[6]);
+    muladd(a->d[6], b->d[5]);
+    muladd(a->d[7], b->d[4]);
+    extract(l[11]);
+    muladd(a->d[5], b->d[7]);
+    muladd(a->d[6], b->d[6]);
+    muladd(a->d[7], b->d[5]);
+    extract(l[12]);
+    muladd(a->d[6], b->d[7]);
+    muladd(a->d[7], b->d[6]);
+    extract(l[13]);
+    muladd_fast(a->d[7], b->d[7]);
+    extract_fast(l[14]);
+    VERIFY_CHECK(c1 == 0);
+    l[15] = c0;
+}
+
+static void secp256k1_scalar_sqr_512(uint32_t *l, const secp256k1_scalar *a) {
+    /* 96 bit accumulator. */
+    uint32_t c0 = 0, c1 = 0, c2 = 0;
+
+    /* l[0..15] = a[0..7]^2. */
+    muladd_fast(a->d[0], a->d[0]);
+    extract_fast(l[0]);
+    muladd2(a->d[0], a->d[1]);
+    extract(l[1]);
+    muladd2(a->d[0], a->d[2]);
+    muladd(a->d[1], a->d[1]);
+    extract(l[2]);
+    muladd2(a->d[0], a->d[3]);
+    muladd2(a->d[1], a->d[2]);
+    extract(l[3]);
+    muladd2(a->d[0], a->d[4]);
+    muladd2(a->d[1], a->d[3]);
+    muladd(a->d[2], a->d[2]);
+    extract(l[4]);
+    muladd2(a->d[0], a->d[5]);
+    muladd2(a->d[1], a->d[4]);
+    muladd2(a->d[2], a->d[3]);
+    extract(l[5]);
+    muladd2(a->d[0], a->d[6]);
+    muladd2(a->d[1], a->d[5]);
+    muladd2(a->d[2], a->d[4]);
+    muladd(a->d[3], a->d[3]);
+    extract(l[6]);
+    muladd2(a->d[0], a->d[7]);
+    muladd2(a->d[1], a->d[6]);
+    muladd2(a->d[2], a->d[5]);
+    muladd2(a->d[3], a->d[4]);
+    extract(l[7]);
+    muladd2(a->d[1], a->d[7]);
+    muladd2(a->d[2], a->d[6]);
+    muladd2(a->d[3], a->d[5]);
+    muladd(a->d[4], a->d[4]);
+    extract(l[8]);
+    muladd2(a->d[2], a->d[7]);
+    muladd2(a->d[3], a->d[6]);
+    muladd2(a->d[4], a->d[5]);
+    extract(l[9]);
+    muladd2(a->d[3], a->d[7]);
+    muladd2(a->d[4], a->d[6]);
+    muladd(a->d[5], a->d[5]);
+    extract(l[10]);
+    muladd2(a->d[4], a->d[7]);
+    muladd2(a->d[5], a->d[6]);
+    extract(l[11]);
+    muladd2(a->d[5], a->d[7]);
+    muladd(a->d[6], a->d[6]);
+    extract(l[12]);
+    muladd2(a->d[6], a->d[7]);
+    extract(l[13]);
+    muladd_fast(a->d[7], a->d[7]);
+    extract_fast(l[14]);
+    VERIFY_CHECK(c1 == 0);
+    l[15] = c0;
+}
+
+#undef sumadd
+#undef sumadd_fast
+#undef muladd
+#undef muladd_fast
+#undef muladd2
+#undef extract
+#undef extract_fast
+
+static void secp256k1_scalar_mul(secp256k1_scalar *r, const secp256k1_scalar *a, const secp256k1_scalar *b) {
+    uint32_t l[16];
+    secp256k1_scalar_mul_512(l, a, b);
+    secp256k1_scalar_reduce_512(r, l);
+}
+
+static int secp256k1_scalar_shr_int(secp256k1_scalar *r, int n) {
+    int ret;
+    VERIFY_CHECK(n > 0);
+    VERIFY_CHECK(n < 16);
+    ret = r->d[0] & ((1 << n) - 1);
+    r->d[0] = (r->d[0] >> n) + (r->d[1] << (32 - n));
+    r->d[1] = (r->d[1] >> n) + (r->d[2] << (32 - n));
+    r->d[2] = (r->d[2] >> n) + (r->d[3] << (32 - n));
+    r->d[3] = (r->d[3] >> n) + (r->d[4] << (32 - n));
+    r->d[4] = (r->d[4] >> n) + (r->d[5] << (32 - n));
+    r->d[5] = (r->d[5] >> n) + (r->d[6] << (32 - n));
+    r->d[6] = (r->d[6] >> n) + (r->d[7] << (32 - n));
+    r->d[7] = (r->d[7] >> n);
+    return ret;
+}
+
+static void secp256k1_scalar_sqr(secp256k1_scalar *r, const secp256k1_scalar *a) {
+    uint32_t l[16];
+    secp256k1_scalar_sqr_512(l, a);
+    secp256k1_scalar_reduce_512(r, l);
+}
+
+static void secp256k1_scalar_split_128(secp256k1_scalar *r1, secp256k1_scalar *r2, const secp256k1_scalar *k) {
+    r1->d[0] = k->d[0];
+    r1->d[1] = k->d[1];
+    r1->d[2] = k->d[2];
+    r1->d[3] = k->d[3];
+    r1->d[4] = 0;
+    r1->d[5] = 0;
+    r1->d[6] = 0;
+    r1->d[7] = 0;
+    r2->d[0] = k->d[4];
+    r2->d[1] = k->d[5];
+    r2->d[2] = k->d[6];
+    r2->d[3] = k->d[7];
+    r2->d[4] = 0;
+    r2->d[5] = 0;
+    r2->d[6] = 0;
+    r2->d[7] = 0;
+}
+
+SECP256K1_INLINE static int secp256k1_scalar_eq(const secp256k1_scalar *a, const secp256k1_scalar *b) {
+    return ((a->d[0] ^ b->d[0]) | (a->d[1] ^ b->d[1]) | (a->d[2] ^ b->d[2]) | (a->d[3] ^ b->d[3]) | (a->d[4] ^ b->d[4]) | (a->d[5] ^ b->d[5]) | (a->d[6] ^ b->d[6]) | (a->d[7] ^ b->d[7])) == 0;
+}
+
+SECP256K1_INLINE static void secp256k1_scalar_mul_shift_var(secp256k1_scalar *r, const secp256k1_scalar *a, const secp256k1_scalar *b, unsigned int shift) {
+    uint32_t l[16];
+    unsigned int shiftlimbs;
+    unsigned int shiftlow;
+    unsigned int shifthigh;
+    VERIFY_CHECK(shift >= 256);
+    secp256k1_scalar_mul_512(l, a, b);
+    shiftlimbs = shift >> 5;
+    shiftlow = shift & 0x1F;
+    shifthigh = 32 - shiftlow;
+    r->d[0] = shift < 512 ? (l[0 + shiftlimbs] >> shiftlow | (shift < 480 && shiftlow ? (l[1 + shiftlimbs] << shifthigh) : 0)) : 0;
+    r->d[1] = shift < 480 ? (l[1 + shiftlimbs] >> shiftlow | (shift < 448 && shiftlow ? (l[2 + shiftlimbs] << shifthigh) : 0)) : 0;
+    r->d[2] = shift < 448 ? (l[2 + shiftlimbs] >> shiftlow | (shift < 416 && shiftlow ? (l[3 + shiftlimbs] << shifthigh) : 0)) : 0;
+    r->d[3] = shift < 416 ? (l[3 + shiftlimbs] >> shiftlow | (shift < 384 && shiftlow ? (l[4 + shiftlimbs] << shifthigh) : 0)) : 0;
+    r->d[4] = shift < 384 ? (l[4 + shiftlimbs] >> shiftlow | (shift < 352 && shiftlow ? (l[5 + shiftlimbs] << shifthigh) : 0)) : 0;
+    r->d[5] = shift < 352 ? (l[5 + shiftlimbs] >> shiftlow | (shift < 320 && shiftlow ? (l[6 + shiftlimbs] << shifthigh) : 0)) : 0;
+    r->d[6] = shift < 320 ? (l[6 + shiftlimbs] >> shiftlow | (shift < 288 && shiftlow ? (l[7 + shiftlimbs] << shifthigh) : 0)) : 0;
+    r->d[7] = shift < 288 ? (l[7 + shiftlimbs] >> shiftlow)  : 0;
+    secp256k1_scalar_cadd_bit(r, 0, (l[(shift - 1) >> 5] >> ((shift - 1) & 0x1f)) & 1);
+}
+
+static SECP256K1_INLINE void secp256k1_scalar_cmov(secp256k1_scalar *r, const secp256k1_scalar *a, int flag) {
+    uint32_t mask0, mask1;
+    VG_CHECK_VERIFY(r->d, sizeof(r->d));
+    mask0 = flag + ~((uint32_t)0);
+    mask1 = ~mask0;
+    r->d[0] = (r->d[0] & mask0) | (a->d[0] & mask1);
+    r->d[1] = (r->d[1] & mask0) | (a->d[1] & mask1);
+    r->d[2] = (r->d[2] & mask0) | (a->d[2] & mask1);
+    r->d[3] = (r->d[3] & mask0) | (a->d[3] & mask1);
+    r->d[4] = (r->d[4] & mask0) | (a->d[4] & mask1);
+    r->d[5] = (r->d[5] & mask0) | (a->d[5] & mask1);
+    r->d[6] = (r->d[6] & mask0) | (a->d[6] & mask1);
+    r->d[7] = (r->d[7] & mask0) | (a->d[7] & mask1);
+}
+
+#endif /* SECP256K1_SCALAR_REPR_IMPL_H */
diff --git a/depend/zcash/src/secp256k1/src/scalar_impl.h b/depend/zcash/src/secp256k1/src/scalar_impl.h
new file mode 100644
index 000000000..61c1fbd58
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/scalar_impl.h
@@ -0,0 +1,516 @@
+/***********************************************************************
+ * Copyright (c) 2014 Pieter Wuille                                    *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_SCALAR_IMPL_H
+#define SECP256K1_SCALAR_IMPL_H
+
+#ifdef VERIFY
+#include <string.h>
+#endif
+
+#include "scalar.h"
+#include "util.h"
+
+#if defined HAVE_CONFIG_H
+#include "libsecp256k1-config.h"
+#endif
+
+#if defined(EXHAUSTIVE_TEST_ORDER)
+#include "scalar_low_impl.h"
+#elif defined(SECP256K1_WIDEMUL_INT128)
+#include "scalar_4x64_impl.h"
+#elif defined(SECP256K1_WIDEMUL_INT64)
+#include "scalar_8x32_impl.h"
+#else
+#error "Please select wide multiplication implementation"
+#endif
+
+static const secp256k1_scalar secp256k1_scalar_one = SECP256K1_SCALAR_CONST(0, 0, 0, 0, 0, 0, 0, 1);
+static const secp256k1_scalar secp256k1_scalar_zero = SECP256K1_SCALAR_CONST(0, 0, 0, 0, 0, 0, 0, 0);
+
+#ifndef USE_NUM_NONE
+static void secp256k1_scalar_get_num(secp256k1_num *r, const secp256k1_scalar *a) {
+    unsigned char c[32];
+    secp256k1_scalar_get_b32(c, a);
+    secp256k1_num_set_bin(r, c, 32);
+}
+
+/** secp256k1 curve order, see secp256k1_ecdsa_const_order_as_fe in ecdsa_impl.h */
+static void secp256k1_scalar_order_get_num(secp256k1_num *r) {
+#if defined(EXHAUSTIVE_TEST_ORDER)
+    static const unsigned char order[32] = {
+        0,0,0,0,0,0,0,0,
+        0,0,0,0,0,0,0,0,
+        0,0,0,0,0,0,0,0,
+        0,0,0,0,0,0,0,EXHAUSTIVE_TEST_ORDER
+    };
+#else
+    static const unsigned char order[32] = {
+        0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
+        0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFE,
+        0xBA,0xAE,0xDC,0xE6,0xAF,0x48,0xA0,0x3B,
+        0xBF,0xD2,0x5E,0x8C,0xD0,0x36,0x41,0x41
+    };
+#endif
+    secp256k1_num_set_bin(r, order, 32);
+}
+#endif
+
+static int secp256k1_scalar_set_b32_seckey(secp256k1_scalar *r, const unsigned char *bin) {
+    int overflow;
+    secp256k1_scalar_set_b32(r, bin, &overflow);
+    return (!overflow) & (!secp256k1_scalar_is_zero(r));
+}
+
+static void secp256k1_scalar_inverse(secp256k1_scalar *r, const secp256k1_scalar *x) {
+#if defined(EXHAUSTIVE_TEST_ORDER)
+    int i;
+    *r = 0;
+    for (i = 0; i < EXHAUSTIVE_TEST_ORDER; i++)
+        if ((i * *x) % EXHAUSTIVE_TEST_ORDER == 1)
+            *r = i;
+    /* If this VERIFY_CHECK triggers we were given a noninvertible scalar (and thus
+     * have a composite group order; fix it in exhaustive_tests.c). */
+    VERIFY_CHECK(*r != 0);
+}
+#else
+    secp256k1_scalar *t;
+    int i;
+    /* First compute xN as x ^ (2^N - 1) for some values of N,
+     * and uM as x ^ M for some values of M. */
+    secp256k1_scalar x2, x3, x6, x8, x14, x28, x56, x112, x126;
+    secp256k1_scalar u2, u5, u9, u11, u13;
+
+    secp256k1_scalar_sqr(&u2, x);
+    secp256k1_scalar_mul(&x2, &u2,  x);
+    secp256k1_scalar_mul(&u5, &u2, &x2);
+    secp256k1_scalar_mul(&x3, &u5,  &u2);
+    secp256k1_scalar_mul(&u9, &x3, &u2);
+    secp256k1_scalar_mul(&u11, &u9, &u2);
+    secp256k1_scalar_mul(&u13, &u11, &u2);
+
+    secp256k1_scalar_sqr(&x6, &u13);
+    secp256k1_scalar_sqr(&x6, &x6);
+    secp256k1_scalar_mul(&x6, &x6, &u11);
+
+    secp256k1_scalar_sqr(&x8, &x6);
+    secp256k1_scalar_sqr(&x8, &x8);
+    secp256k1_scalar_mul(&x8, &x8,  &x2);
+
+    secp256k1_scalar_sqr(&x14, &x8);
+    for (i = 0; i < 5; i++) {
+        secp256k1_scalar_sqr(&x14, &x14);
+    }
+    secp256k1_scalar_mul(&x14, &x14, &x6);
+
+    secp256k1_scalar_sqr(&x28, &x14);
+    for (i = 0; i < 13; i++) {
+        secp256k1_scalar_sqr(&x28, &x28);
+    }
+    secp256k1_scalar_mul(&x28, &x28, &x14);
+
+    secp256k1_scalar_sqr(&x56, &x28);
+    for (i = 0; i < 27; i++) {
+        secp256k1_scalar_sqr(&x56, &x56);
+    }
+    secp256k1_scalar_mul(&x56, &x56, &x28);
+
+    secp256k1_scalar_sqr(&x112, &x56);
+    for (i = 0; i < 55; i++) {
+        secp256k1_scalar_sqr(&x112, &x112);
+    }
+    secp256k1_scalar_mul(&x112, &x112, &x56);
+
+    secp256k1_scalar_sqr(&x126, &x112);
+    for (i = 0; i < 13; i++) {
+        secp256k1_scalar_sqr(&x126, &x126);
+    }
+    secp256k1_scalar_mul(&x126, &x126, &x14);
+
+    /* Then accumulate the final result (t starts at x126). */
+    t = &x126;
+    for (i = 0; i < 3; i++) {
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(t, t, &u5); /* 101 */
+    for (i = 0; i < 4; i++) { /* 0 */
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(t, t, &x3); /* 111 */
+    for (i = 0; i < 4; i++) { /* 0 */
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(t, t, &u5); /* 101 */
+    for (i = 0; i < 5; i++) { /* 0 */
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(t, t, &u11); /* 1011 */
+    for (i = 0; i < 4; i++) {
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(t, t, &u11); /* 1011 */
+    for (i = 0; i < 4; i++) { /* 0 */
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(t, t, &x3); /* 111 */
+    for (i = 0; i < 5; i++) { /* 00 */
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(t, t, &x3); /* 111 */
+    for (i = 0; i < 6; i++) { /* 00 */
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(t, t, &u13); /* 1101 */
+    for (i = 0; i < 4; i++) { /* 0 */
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(t, t, &u5); /* 101 */
+    for (i = 0; i < 3; i++) {
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(t, t, &x3); /* 111 */
+    for (i = 0; i < 5; i++) { /* 0 */
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(t, t, &u9); /* 1001 */
+    for (i = 0; i < 6; i++) { /* 000 */
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(t, t, &u5); /* 101 */
+    for (i = 0; i < 10; i++) { /* 0000000 */
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(t, t, &x3); /* 111 */
+    for (i = 0; i < 4; i++) { /* 0 */
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(t, t, &x3); /* 111 */
+    for (i = 0; i < 9; i++) { /* 0 */
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(t, t, &x8); /* 11111111 */
+    for (i = 0; i < 5; i++) { /* 0 */
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(t, t, &u9); /* 1001 */
+    for (i = 0; i < 6; i++) { /* 00 */
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(t, t, &u11); /* 1011 */
+    for (i = 0; i < 4; i++) {
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(t, t, &u13); /* 1101 */
+    for (i = 0; i < 5; i++) {
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(t, t, &x2); /* 11 */
+    for (i = 0; i < 6; i++) { /* 00 */
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(t, t, &u13); /* 1101 */
+    for (i = 0; i < 10; i++) { /* 000000 */
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(t, t, &u13); /* 1101 */
+    for (i = 0; i < 4; i++) {
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(t, t, &u9); /* 1001 */
+    for (i = 0; i < 6; i++) { /* 00000 */
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(t, t, x); /* 1 */
+    for (i = 0; i < 8; i++) { /* 00 */
+        secp256k1_scalar_sqr(t, t);
+    }
+    secp256k1_scalar_mul(r, t, &x6); /* 111111 */
+}
+
+SECP256K1_INLINE static int secp256k1_scalar_is_even(const secp256k1_scalar *a) {
+    return !(a->d[0] & 1);
+}
+#endif
+
+static void secp256k1_scalar_inverse_var(secp256k1_scalar *r, const secp256k1_scalar *x) {
+#if defined(USE_SCALAR_INV_BUILTIN)
+    secp256k1_scalar_inverse(r, x);
+#elif defined(USE_SCALAR_INV_NUM)
+    unsigned char b[32];
+    secp256k1_num n, m;
+    secp256k1_scalar t = *x;
+    secp256k1_scalar_get_b32(b, &t);
+    secp256k1_num_set_bin(&n, b, 32);
+    secp256k1_scalar_order_get_num(&m);
+    secp256k1_num_mod_inverse(&n, &n, &m);
+    secp256k1_num_get_bin(b, 32, &n);
+    secp256k1_scalar_set_b32(r, b, NULL);
+    /* Verify that the inverse was computed correctly, without GMP code. */
+    secp256k1_scalar_mul(&t, &t, r);
+    CHECK(secp256k1_scalar_is_one(&t));
+#else
+#error "Please select scalar inverse implementation"
+#endif
+}
+
+/* These parameters are generated using sage/gen_exhaustive_groups.sage. */
+#if defined(EXHAUSTIVE_TEST_ORDER)
+#  if EXHAUSTIVE_TEST_ORDER == 13
+#    define EXHAUSTIVE_TEST_LAMBDA 9
+#  elif EXHAUSTIVE_TEST_ORDER == 199
+#    define EXHAUSTIVE_TEST_LAMBDA 92
+#  else
+#    error No known lambda for the specified exhaustive test group order.
+#  endif
+
+/**
+ * Find r1 and r2 given k, such that r1 + r2 * lambda == k mod n; unlike in the
+ * full case we don't bother making r1 and r2 be small, we just want them to be
+ * nontrivial to get full test coverage for the exhaustive tests. We therefore
+ * (arbitrarily) set r2 = k + 5 (mod n) and r1 = k - r2 * lambda (mod n).
+ */
+static void secp256k1_scalar_split_lambda(secp256k1_scalar *r1, secp256k1_scalar *r2, const secp256k1_scalar *k) {
+    *r2 = (*k + 5) % EXHAUSTIVE_TEST_ORDER;
+    *r1 = (*k + (EXHAUSTIVE_TEST_ORDER - *r2) * EXHAUSTIVE_TEST_LAMBDA) % EXHAUSTIVE_TEST_ORDER;
+}
+#else
+/**
+ * The Secp256k1 curve has an endomorphism, where lambda * (x, y) = (beta * x, y), where
+ * lambda is: */
+static const secp256k1_scalar secp256k1_const_lambda = SECP256K1_SCALAR_CONST(
+    0x5363AD4CUL, 0xC05C30E0UL, 0xA5261C02UL, 0x8812645AUL,
+    0x122E22EAUL, 0x20816678UL, 0xDF02967CUL, 0x1B23BD72UL
+);
+
+#ifdef VERIFY
+static void secp256k1_scalar_split_lambda_verify(const secp256k1_scalar *r1, const secp256k1_scalar *r2, const secp256k1_scalar *k);
+#endif
+
+/*
+ * Both lambda and beta are primitive cube roots of unity.  That is lamba^3 == 1 mod n and
+ * beta^3 == 1 mod p, where n is the curve order and p is the field order.
+ *
+ * Futhermore, because (X^3 - 1) = (X - 1)(X^2 + X + 1), the primitive cube roots of unity are
+ * roots of X^2 + X + 1.  Therefore lambda^2 + lamba == -1 mod n and beta^2 + beta == -1 mod p.
+ * (The other primitive cube roots of unity are lambda^2 and beta^2 respectively.)
+ *
+ * Let l = -1/2 + i*sqrt(3)/2, the complex root of X^2 + X + 1. We can define a ring
+ * homomorphism phi : Z[l] -> Z_n where phi(a + b*l) == a + b*lambda mod n. The kernel of phi
+ * is a lattice over Z[l] (considering Z[l] as a Z-module). This lattice is generated by a
+ * reduced basis {a1 + b1*l, a2 + b2*l} where
+ *
+ * - a1 =      {0x30,0x86,0xd2,0x21,0xa7,0xd4,0x6b,0xcd,0xe8,0x6c,0x90,0xe4,0x92,0x84,0xeb,0x15}
+ * - b1 =     -{0xe4,0x43,0x7e,0xd6,0x01,0x0e,0x88,0x28,0x6f,0x54,0x7f,0xa9,0x0a,0xbf,0xe4,0xc3}
+ * - a2 = {0x01,0x14,0xca,0x50,0xf7,0xa8,0xe2,0xf3,0xf6,0x57,0xc1,0x10,0x8d,0x9d,0x44,0xcf,0xd8}
+ * - b2 =      {0x30,0x86,0xd2,0x21,0xa7,0xd4,0x6b,0xcd,0xe8,0x6c,0x90,0xe4,0x92,0x84,0xeb,0x15}
+ *
+ * "Guide to Elliptic Curve Cryptography" (Hankerson, Menezes, Vanstone) gives an algorithm
+ * (algorithm 3.74) to find k1 and k2 given k, such that k1 + k2 * lambda == k mod n, and k1
+ * and k2 are small in absolute value.
+ *
+ * The algorithm computes c1 = round(b2 * k / n) and c2 = round((-b1) * k / n), and gives
+ * k1 = k - (c1*a1 + c2*a2) and k2 = -(c1*b1 + c2*b2). Instead, we use modular arithmetic, and
+ * compute r2 = k2 mod n, and r1 = k1 mod n = (k - r2 * lambda) mod n, avoiding the need for
+ * the constants a1 and a2.
+ *
+ * g1, g2 are precomputed constants used to replace division with a rounded multiplication
+ * when decomposing the scalar for an endomorphism-based point multiplication.
+ *
+ * The possibility of using precomputed estimates is mentioned in "Guide to Elliptic Curve
+ * Cryptography" (Hankerson, Menezes, Vanstone) in section 3.5.
+ *
+ * The derivation is described in the paper "Efficient Software Implementation of Public-Key
+ * Cryptography on Sensor Networks Using the MSP430X Microcontroller" (Gouvea, Oliveira, Lopez),
+ * Section 4.3 (here we use a somewhat higher-precision estimate):
+ * d = a1*b2 - b1*a2
+ * g1 = round(2^384 * b2/d)
+ * g2 = round(2^384 * (-b1)/d)
+ *
+ * (Note that d is also equal to the curve order, n, here because [a1,b1] and [a2,b2]
+ * can be found as outputs of the Extended Euclidean Algorithm on inputs n and lambda).
+ *
+ * The function below splits k into r1 and r2, such that
+ * - r1 + lambda * r2 == k (mod n)
+ * - either r1 < 2^128 or -r1 mod n < 2^128
+ * - either r2 < 2^128 or -r2 mod n < 2^128
+ *
+ * See proof below.
+ */
+static void secp256k1_scalar_split_lambda(secp256k1_scalar *r1, secp256k1_scalar *r2, const secp256k1_scalar *k) {
+    secp256k1_scalar c1, c2;
+    static const secp256k1_scalar minus_b1 = SECP256K1_SCALAR_CONST(
+        0x00000000UL, 0x00000000UL, 0x00000000UL, 0x00000000UL,
+        0xE4437ED6UL, 0x010E8828UL, 0x6F547FA9UL, 0x0ABFE4C3UL
+    );
+    static const secp256k1_scalar minus_b2 = SECP256K1_SCALAR_CONST(
+        0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFEUL,
+        0x8A280AC5UL, 0x0774346DUL, 0xD765CDA8UL, 0x3DB1562CUL
+    );
+    static const secp256k1_scalar g1 = SECP256K1_SCALAR_CONST(
+        0x3086D221UL, 0xA7D46BCDUL, 0xE86C90E4UL, 0x9284EB15UL,
+        0x3DAA8A14UL, 0x71E8CA7FUL, 0xE893209AUL, 0x45DBB031UL
+    );
+    static const secp256k1_scalar g2 = SECP256K1_SCALAR_CONST(
+        0xE4437ED6UL, 0x010E8828UL, 0x6F547FA9UL, 0x0ABFE4C4UL,
+        0x221208ACUL, 0x9DF506C6UL, 0x1571B4AEUL, 0x8AC47F71UL
+    );
+    VERIFY_CHECK(r1 != k);
+    VERIFY_CHECK(r2 != k);
+    /* these _var calls are constant time since the shift amount is constant */
+    secp256k1_scalar_mul_shift_var(&c1, k, &g1, 384);
+    secp256k1_scalar_mul_shift_var(&c2, k, &g2, 384);
+    secp256k1_scalar_mul(&c1, &c1, &minus_b1);
+    secp256k1_scalar_mul(&c2, &c2, &minus_b2);
+    secp256k1_scalar_add(r2, &c1, &c2);
+    secp256k1_scalar_mul(r1, r2, &secp256k1_const_lambda);
+    secp256k1_scalar_negate(r1, r1);
+    secp256k1_scalar_add(r1, r1, k);
+
+#ifdef VERIFY
+    secp256k1_scalar_split_lambda_verify(r1, r2, k);
+#endif
+}
+
+#ifdef VERIFY
+/*
+ * Proof for secp256k1_scalar_split_lambda's bounds.
+ *
+ * Let
+ *  - epsilon1 = 2^256 * |g1/2^384 - b2/d|
+ *  - epsilon2 = 2^256 * |g2/2^384 - (-b1)/d|
+ *  - c1 = round(k*g1/2^384)
+ *  - c2 = round(k*g2/2^384)
+ *
+ * Lemma 1: |c1 - k*b2/d| < 2^-1 + epsilon1
+ *
+ *    |c1 - k*b2/d|
+ *  =
+ *    |c1 - k*g1/2^384 + k*g1/2^384 - k*b2/d|
+ * <=   {triangle inequality}
+ *    |c1 - k*g1/2^384| + |k*g1/2^384 - k*b2/d|
+ *  =
+ *    |c1 - k*g1/2^384| + k*|g1/2^384 - b2/d|
+ * <    {rounding in c1 and 0 <= k < 2^256}
+ *    2^-1 + 2^256 * |g1/2^384 - b2/d|
+ *  =   {definition of epsilon1}
+ *    2^-1 + epsilon1
+ *
+ * Lemma 2: |c2 - k*(-b1)/d| < 2^-1 + epsilon2
+ *
+ *    |c2 - k*(-b1)/d|
+ *  =
+ *    |c2 - k*g2/2^384 + k*g2/2^384 - k*(-b1)/d|
+ * <=   {triangle inequality}
+ *    |c2 - k*g2/2^384| + |k*g2/2^384 - k*(-b1)/d|
+ *  =
+ *    |c2 - k*g2/2^384| + k*|g2/2^384 - (-b1)/d|
+ * <    {rounding in c2 and 0 <= k < 2^256}
+ *    2^-1 + 2^256 * |g2/2^384 - (-b1)/d|
+ *  =   {definition of epsilon2}
+ *    2^-1 + epsilon2
+ *
+ * Let
+ *  - k1 = k - c1*a1 - c2*a2
+ *  - k2 = - c1*b1 - c2*b2
+ *
+ * Lemma 3: |k1| < (a1 + a2 + 1)/2 < 2^128
+ *
+ *    |k1|
+ *  =   {definition of k1}
+ *    |k - c1*a1 - c2*a2|
+ *  =   {(a1*b2 - b1*a2)/n = 1}
+ *    |k*(a1*b2 - b1*a2)/n - c1*a1 - c2*a2|
+ *  =
+ *    |a1*(k*b2/n - c1) + a2*(k*(-b1)/n - c2)|
+ * <=   {triangle inequality}
+ *    a1*|k*b2/n - c1| + a2*|k*(-b1)/n - c2|
+ * <    {Lemma 1 and Lemma 2}
+ *    a1*(2^-1 + epslion1) + a2*(2^-1 + epsilon2)
+ * <    {rounding up to an integer}
+ *    (a1 + a2 + 1)/2
+ * <    {rounding up to a power of 2}
+ *    2^128
+ *
+ * Lemma 4: |k2| < (-b1 + b2)/2 + 1 < 2^128
+ *
+ *    |k2|
+ *  =   {definition of k2}
+ *    |- c1*a1 - c2*a2|
+ *  =   {(b1*b2 - b1*b2)/n = 0}
+ *    |k*(b1*b2 - b1*b2)/n - c1*b1 - c2*b2|
+ *  =
+ *    |b1*(k*b2/n - c1) + b2*(k*(-b1)/n - c2)|
+ * <=   {triangle inequality}
+ *    (-b1)*|k*b2/n - c1| + b2*|k*(-b1)/n - c2|
+ * <    {Lemma 1 and Lemma 2}
+ *    (-b1)*(2^-1 + epslion1) + b2*(2^-1 + epsilon2)
+ * <    {rounding up to an integer}
+ *    (-b1 + b2)/2 + 1
+ * <    {rounding up to a power of 2}
+ *    2^128
+ *
+ * Let
+ *  - r2 = k2 mod n
+ *  - r1 = k - r2*lambda mod n.
+ *
+ * Notice that r1 is defined such that r1 + r2 * lambda == k (mod n).
+ *
+ * Lemma 5: r1 == k1 mod n.
+ *
+ *    r1
+ * ==   {definition of r1 and r2}
+ *    k - k2*lambda
+ * ==   {definition of k2}
+ *    k - (- c1*b1 - c2*b2)*lambda
+ * ==
+ *    k + c1*b1*lambda + c2*b2*lambda
+ * ==  {a1 + b1*lambda == 0 mod n and a2 + b2*lambda == 0 mod n}
+ *    k - c1*a1 - c2*a2
+ * ==  {definition of k1}
+ *    k1
+ *
+ * From Lemma 3, Lemma 4, Lemma 5 and the definition of r2, we can conclude that
+ *
+ *  - either r1 < 2^128 or -r1 mod n < 2^128
+ *  - either r2 < 2^128 or -r2 mod n < 2^128.
+ *
+ * Q.E.D.
+ */
+static void secp256k1_scalar_split_lambda_verify(const secp256k1_scalar *r1, const secp256k1_scalar *r2, const secp256k1_scalar *k) {
+    secp256k1_scalar s;
+    unsigned char buf1[32];
+    unsigned char buf2[32];
+
+    /* (a1 + a2 + 1)/2 is 0xa2a8918ca85bafe22016d0b917e4dd77 */
+    static const unsigned char k1_bound[32] = {
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0xa2, 0xa8, 0x91, 0x8c, 0xa8, 0x5b, 0xaf, 0xe2, 0x20, 0x16, 0xd0, 0xb9, 0x17, 0xe4, 0xdd, 0x77
+    };
+
+    /* (-b1 + b2)/2 + 1 is 0x8a65287bd47179fb2be08846cea267ed */
+    static const unsigned char k2_bound[32] = {
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x8a, 0x65, 0x28, 0x7b, 0xd4, 0x71, 0x79, 0xfb, 0x2b, 0xe0, 0x88, 0x46, 0xce, 0xa2, 0x67, 0xed
+    };
+
+    secp256k1_scalar_mul(&s, &secp256k1_const_lambda, r2);
+    secp256k1_scalar_add(&s, &s, r1);
+    VERIFY_CHECK(secp256k1_scalar_eq(&s, k));
+
+    secp256k1_scalar_negate(&s, r1);
+    secp256k1_scalar_get_b32(buf1, r1);
+    secp256k1_scalar_get_b32(buf2, &s);
+    VERIFY_CHECK(secp256k1_memcmp_var(buf1, k1_bound, 32) < 0 || secp256k1_memcmp_var(buf2, k1_bound, 32) < 0);
+
+    secp256k1_scalar_negate(&s, r2);
+    secp256k1_scalar_get_b32(buf1, r2);
+    secp256k1_scalar_get_b32(buf2, &s);
+    VERIFY_CHECK(secp256k1_memcmp_var(buf1, k2_bound, 32) < 0 || secp256k1_memcmp_var(buf2, k2_bound, 32) < 0);
+}
+#endif /* VERIFY */
+#endif /* !defined(EXHAUSTIVE_TEST_ORDER) */
+
+#endif /* SECP256K1_SCALAR_IMPL_H */
diff --git a/depend/zcash/src/secp256k1/src/scalar_low.h b/depend/zcash/src/secp256k1/src/scalar_low.h
new file mode 100644
index 000000000..67051bd30
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/scalar_low.h
@@ -0,0 +1,17 @@
+/***********************************************************************
+ * Copyright (c) 2015 Andrew Poelstra                                  *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_SCALAR_REPR_H
+#define SECP256K1_SCALAR_REPR_H
+
+#include <stdint.h>
+
+/** A scalar modulo the group order of the secp256k1 curve. */
+typedef uint32_t secp256k1_scalar;
+
+#define SECP256K1_SCALAR_CONST(d7, d6, d5, d4, d3, d2, d1, d0) (d0)
+
+#endif /* SECP256K1_SCALAR_REPR_H */
diff --git a/depend/zcash/src/secp256k1/src/scalar_low_impl.h b/depend/zcash/src/secp256k1/src/scalar_low_impl.h
new file mode 100644
index 000000000..98ffd1536
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/scalar_low_impl.h
@@ -0,0 +1,128 @@
+/***********************************************************************
+ * Copyright (c) 2015 Andrew Poelstra                                  *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_SCALAR_REPR_IMPL_H
+#define SECP256K1_SCALAR_REPR_IMPL_H
+
+#include "scalar.h"
+
+#include <string.h>
+
+SECP256K1_INLINE static int secp256k1_scalar_is_even(const secp256k1_scalar *a) {
+    return !(*a & 1);
+}
+
+SECP256K1_INLINE static void secp256k1_scalar_clear(secp256k1_scalar *r) { *r = 0; }
+SECP256K1_INLINE static void secp256k1_scalar_set_int(secp256k1_scalar *r, unsigned int v) { *r = v; }
+
+SECP256K1_INLINE static unsigned int secp256k1_scalar_get_bits(const secp256k1_scalar *a, unsigned int offset, unsigned int count) {
+    if (offset < 32)
+        return ((*a >> offset) & ((((uint32_t)1) << count) - 1));
+    else
+        return 0;
+}
+
+SECP256K1_INLINE static unsigned int secp256k1_scalar_get_bits_var(const secp256k1_scalar *a, unsigned int offset, unsigned int count) {
+    return secp256k1_scalar_get_bits(a, offset, count);
+}
+
+SECP256K1_INLINE static int secp256k1_scalar_check_overflow(const secp256k1_scalar *a) { return *a >= EXHAUSTIVE_TEST_ORDER; }
+
+static int secp256k1_scalar_add(secp256k1_scalar *r, const secp256k1_scalar *a, const secp256k1_scalar *b) {
+    *r = (*a + *b) % EXHAUSTIVE_TEST_ORDER;
+    return *r < *b;
+}
+
+static void secp256k1_scalar_cadd_bit(secp256k1_scalar *r, unsigned int bit, int flag) {
+    if (flag && bit < 32)
+        *r += ((uint32_t)1 << bit);
+#ifdef VERIFY
+    VERIFY_CHECK(bit < 32);
+    /* Verify that adding (1 << bit) will not overflow any in-range scalar *r by overflowing the underlying uint32_t. */
+    VERIFY_CHECK(((uint32_t)1 << bit) - 1 <= UINT32_MAX - EXHAUSTIVE_TEST_ORDER);
+    VERIFY_CHECK(secp256k1_scalar_check_overflow(r) == 0);
+#endif
+}
+
+static void secp256k1_scalar_set_b32(secp256k1_scalar *r, const unsigned char *b32, int *overflow) {
+    int i;
+    int over = 0;
+    *r = 0;
+    for (i = 0; i < 32; i++) {
+        *r = (*r * 0x100) + b32[i];
+        if (*r >= EXHAUSTIVE_TEST_ORDER) {
+            over = 1;
+            *r %= EXHAUSTIVE_TEST_ORDER;
+        }
+    }
+    if (overflow) *overflow = over;
+}
+
+static void secp256k1_scalar_get_b32(unsigned char *bin, const secp256k1_scalar* a) {
+    memset(bin, 0, 32);
+    bin[28] = *a >> 24; bin[29] = *a >> 16; bin[30] = *a >> 8; bin[31] = *a;
+}
+
+SECP256K1_INLINE static int secp256k1_scalar_is_zero(const secp256k1_scalar *a) {
+    return *a == 0;
+}
+
+static void secp256k1_scalar_negate(secp256k1_scalar *r, const secp256k1_scalar *a) {
+    if (*a == 0) {
+        *r = 0;
+    } else {
+        *r = EXHAUSTIVE_TEST_ORDER - *a;
+    }
+}
+
+SECP256K1_INLINE static int secp256k1_scalar_is_one(const secp256k1_scalar *a) {
+    return *a == 1;
+}
+
+static int secp256k1_scalar_is_high(const secp256k1_scalar *a) {
+    return *a > EXHAUSTIVE_TEST_ORDER / 2;
+}
+
+static int secp256k1_scalar_cond_negate(secp256k1_scalar *r, int flag) {
+    if (flag) secp256k1_scalar_negate(r, r);
+    return flag ? -1 : 1;
+}
+
+static void secp256k1_scalar_mul(secp256k1_scalar *r, const secp256k1_scalar *a, const secp256k1_scalar *b) {
+    *r = (*a * *b) % EXHAUSTIVE_TEST_ORDER;
+}
+
+static int secp256k1_scalar_shr_int(secp256k1_scalar *r, int n) {
+    int ret;
+    VERIFY_CHECK(n > 0);
+    VERIFY_CHECK(n < 16);
+    ret = *r & ((1 << n) - 1);
+    *r >>= n;
+    return ret;
+}
+
+static void secp256k1_scalar_sqr(secp256k1_scalar *r, const secp256k1_scalar *a) {
+    *r = (*a * *a) % EXHAUSTIVE_TEST_ORDER;
+}
+
+static void secp256k1_scalar_split_128(secp256k1_scalar *r1, secp256k1_scalar *r2, const secp256k1_scalar *a) {
+    *r1 = *a;
+    *r2 = 0;
+}
+
+SECP256K1_INLINE static int secp256k1_scalar_eq(const secp256k1_scalar *a, const secp256k1_scalar *b) {
+    return *a == *b;
+}
+
+static SECP256K1_INLINE void secp256k1_scalar_cmov(secp256k1_scalar *r, const secp256k1_scalar *a, int flag) {
+    uint32_t mask0, mask1;
+    VG_CHECK_VERIFY(r, sizeof(*r));
+    mask0 = flag + ~((uint32_t)0);
+    mask1 = ~mask0;
+    *r = (*r & mask0) | (*a & mask1);
+}
+
+#endif /* SECP256K1_SCALAR_REPR_IMPL_H */
diff --git a/depend/zcash/src/secp256k1/src/scratch.h b/depend/zcash/src/secp256k1/src/scratch.h
new file mode 100644
index 000000000..9dcb7581f
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/scratch.h
@@ -0,0 +1,42 @@
+/***********************************************************************
+ * Copyright (c) 2017 Andrew Poelstra                                  *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_SCRATCH_H
+#define SECP256K1_SCRATCH_H
+
+/* The typedef is used internally; the struct name is used in the public API
+ * (where it is exposed as a different typedef) */
+typedef struct secp256k1_scratch_space_struct {
+    /** guard against interpreting this object as other types */
+    unsigned char magic[8];
+    /** actual allocated data */
+    void *data;
+    /** amount that has been allocated (i.e. `data + offset` is the next
+     *  available pointer)  */
+    size_t alloc_size;
+    /** maximum size available to allocate */
+    size_t max_size;
+} secp256k1_scratch;
+
+static secp256k1_scratch* secp256k1_scratch_create(const secp256k1_callback* error_callback, size_t max_size);
+
+static void secp256k1_scratch_destroy(const secp256k1_callback* error_callback, secp256k1_scratch* scratch);
+
+/** Returns an opaque object used to "checkpoint" a scratch space. Used
+ *  with `secp256k1_scratch_apply_checkpoint` to undo allocations. */
+static size_t secp256k1_scratch_checkpoint(const secp256k1_callback* error_callback, const secp256k1_scratch* scratch);
+
+/** Applies a check point received from `secp256k1_scratch_checkpoint`,
+ *  undoing all allocations since that point. */
+static void secp256k1_scratch_apply_checkpoint(const secp256k1_callback* error_callback, secp256k1_scratch* scratch, size_t checkpoint);
+
+/** Returns the maximum allocation the scratch space will allow */
+static size_t secp256k1_scratch_max_allocation(const secp256k1_callback* error_callback, const secp256k1_scratch* scratch, size_t n_objects);
+
+/** Returns a pointer into the most recently allocated frame, or NULL if there is insufficient available space */
+static void *secp256k1_scratch_alloc(const secp256k1_callback* error_callback, secp256k1_scratch* scratch, size_t n);
+
+#endif
diff --git a/depend/zcash/src/secp256k1/src/scratch_impl.h b/depend/zcash/src/secp256k1/src/scratch_impl.h
new file mode 100644
index 000000000..688e18eb6
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/scratch_impl.h
@@ -0,0 +1,99 @@
+/***********************************************************************
+ * Copyright (c) 2017 Andrew Poelstra                                  *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_SCRATCH_IMPL_H
+#define SECP256K1_SCRATCH_IMPL_H
+
+#include "util.h"
+#include "scratch.h"
+
+static secp256k1_scratch* secp256k1_scratch_create(const secp256k1_callback* error_callback, size_t size) {
+    const size_t base_alloc = ROUND_TO_ALIGN(sizeof(secp256k1_scratch));
+    void *alloc = checked_malloc(error_callback, base_alloc + size);
+    secp256k1_scratch* ret = (secp256k1_scratch *)alloc;
+    if (ret != NULL) {
+        memset(ret, 0, sizeof(*ret));
+        memcpy(ret->magic, "scratch", 8);
+        ret->data = (void *) ((char *) alloc + base_alloc);
+        ret->max_size = size;
+    }
+    return ret;
+}
+
+static void secp256k1_scratch_destroy(const secp256k1_callback* error_callback, secp256k1_scratch* scratch) {
+    if (scratch != NULL) {
+        VERIFY_CHECK(scratch->alloc_size == 0); /* all checkpoints should be applied */
+        if (secp256k1_memcmp_var(scratch->magic, "scratch", 8) != 0) {
+            secp256k1_callback_call(error_callback, "invalid scratch space");
+            return;
+        }
+        memset(scratch->magic, 0, sizeof(scratch->magic));
+        free(scratch);
+    }
+}
+
+static size_t secp256k1_scratch_checkpoint(const secp256k1_callback* error_callback, const secp256k1_scratch* scratch) {
+    if (secp256k1_memcmp_var(scratch->magic, "scratch", 8) != 0) {
+        secp256k1_callback_call(error_callback, "invalid scratch space");
+        return 0;
+    }
+    return scratch->alloc_size;
+}
+
+static void secp256k1_scratch_apply_checkpoint(const secp256k1_callback* error_callback, secp256k1_scratch* scratch, size_t checkpoint) {
+    if (secp256k1_memcmp_var(scratch->magic, "scratch", 8) != 0) {
+        secp256k1_callback_call(error_callback, "invalid scratch space");
+        return;
+    }
+    if (checkpoint > scratch->alloc_size) {
+        secp256k1_callback_call(error_callback, "invalid checkpoint");
+        return;
+    }
+    scratch->alloc_size = checkpoint;
+}
+
+static size_t secp256k1_scratch_max_allocation(const secp256k1_callback* error_callback, const secp256k1_scratch* scratch, size_t objects) {
+    if (secp256k1_memcmp_var(scratch->magic, "scratch", 8) != 0) {
+        secp256k1_callback_call(error_callback, "invalid scratch space");
+        return 0;
+    }
+    /* Ensure that multiplication will not wrap around */
+    if (ALIGNMENT > 1 && objects > SIZE_MAX/(ALIGNMENT - 1)) {
+        return 0;
+    }
+    if (scratch->max_size - scratch->alloc_size <= objects * (ALIGNMENT - 1)) {
+        return 0;
+    }
+    return scratch->max_size - scratch->alloc_size - objects * (ALIGNMENT - 1);
+}
+
+static void *secp256k1_scratch_alloc(const secp256k1_callback* error_callback, secp256k1_scratch* scratch, size_t size) {
+    void *ret;
+    size_t rounded_size;
+
+    rounded_size = ROUND_TO_ALIGN(size);
+    /* Check that rounding did not wrap around */
+    if (rounded_size < size) {
+        return NULL;
+    }
+    size = rounded_size;
+
+    if (secp256k1_memcmp_var(scratch->magic, "scratch", 8) != 0) {
+        secp256k1_callback_call(error_callback, "invalid scratch space");
+        return NULL;
+    }
+
+    if (size > scratch->max_size - scratch->alloc_size) {
+        return NULL;
+    }
+    ret = (void *) ((char *) scratch->data + scratch->alloc_size);
+    memset(ret, 0, size);
+    scratch->alloc_size += size;
+
+    return ret;
+}
+
+#endif
diff --git a/depend/zcash/src/secp256k1/src/secp256k1.c b/depend/zcash/src/secp256k1/src/secp256k1.c
new file mode 100644
index 000000000..4f56c27c8
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/secp256k1.c
@@ -0,0 +1,776 @@
+/***********************************************************************
+ * Copyright (c) 2013-2015 Pieter Wuille                               *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#include "include/secp256k1.h"
+#include "include/secp256k1_preallocated.h"
+
+#include "assumptions.h"
+#include "util.h"
+#include "num_impl.h"
+#include "field_impl.h"
+#include "scalar_impl.h"
+#include "group_impl.h"
+#include "ecmult_impl.h"
+#include "ecmult_const_impl.h"
+#include "ecmult_gen_impl.h"
+#include "ecdsa_impl.h"
+#include "eckey_impl.h"
+#include "hash_impl.h"
+#include "scratch_impl.h"
+#include "selftest.h"
+
+#if defined(VALGRIND)
+# include <valgrind/memcheck.h>
+#endif
+
+#define ARG_CHECK(cond) do { \
+    if (EXPECT(!(cond), 0)) { \
+        secp256k1_callback_call(&ctx->illegal_callback, #cond); \
+        return 0; \
+    } \
+} while(0)
+
+#define ARG_CHECK_NO_RETURN(cond) do { \
+    if (EXPECT(!(cond), 0)) { \
+        secp256k1_callback_call(&ctx->illegal_callback, #cond); \
+    } \
+} while(0)
+
+#ifndef USE_EXTERNAL_DEFAULT_CALLBACKS
+#include <stdlib.h>
+#include <stdio.h>
+static void secp256k1_default_illegal_callback_fn(const char* str, void* data) {
+    (void)data;
+    fprintf(stderr, "[libsecp256k1] illegal argument: %s\n", str);
+    abort();
+}
+static void secp256k1_default_error_callback_fn(const char* str, void* data) {
+    (void)data;
+    fprintf(stderr, "[libsecp256k1] internal consistency check failed: %s\n", str);
+    abort();
+}
+#else
+void secp256k1_default_illegal_callback_fn(const char* str, void* data);
+void secp256k1_default_error_callback_fn(const char* str, void* data);
+#endif
+
+static const secp256k1_callback default_illegal_callback = {
+    secp256k1_default_illegal_callback_fn,
+    NULL
+};
+
+static const secp256k1_callback default_error_callback = {
+    secp256k1_default_error_callback_fn,
+    NULL
+};
+
+struct secp256k1_context_struct {
+    secp256k1_ecmult_context ecmult_ctx;
+    secp256k1_ecmult_gen_context ecmult_gen_ctx;
+    secp256k1_callback illegal_callback;
+    secp256k1_callback error_callback;
+    int declassify;
+};
+
+static const secp256k1_context secp256k1_context_no_precomp_ = {
+    { 0 },
+    { 0 },
+    { secp256k1_default_illegal_callback_fn, 0 },
+    { secp256k1_default_error_callback_fn, 0 },
+    0
+};
+const secp256k1_context *secp256k1_context_no_precomp = &secp256k1_context_no_precomp_;
+
+size_t secp256k1_context_preallocated_size(unsigned int flags) {
+    size_t ret = ROUND_TO_ALIGN(sizeof(secp256k1_context));
+    /* A return value of 0 is reserved as an indicator for errors when we call this function internally. */
+    VERIFY_CHECK(ret != 0);
+
+    if (EXPECT((flags & SECP256K1_FLAGS_TYPE_MASK) != SECP256K1_FLAGS_TYPE_CONTEXT, 0)) {
+            secp256k1_callback_call(&default_illegal_callback,
+                                    "Invalid flags");
+            return 0;
+    }
+
+    if (flags & SECP256K1_FLAGS_BIT_CONTEXT_SIGN) {
+        ret += SECP256K1_ECMULT_GEN_CONTEXT_PREALLOCATED_SIZE;
+    }
+    if (flags & SECP256K1_FLAGS_BIT_CONTEXT_VERIFY) {
+        ret += SECP256K1_ECMULT_CONTEXT_PREALLOCATED_SIZE;
+    }
+    return ret;
+}
+
+size_t secp256k1_context_preallocated_clone_size(const secp256k1_context* ctx) {
+    size_t ret = ROUND_TO_ALIGN(sizeof(secp256k1_context));
+    VERIFY_CHECK(ctx != NULL);
+    if (secp256k1_ecmult_gen_context_is_built(&ctx->ecmult_gen_ctx)) {
+        ret += SECP256K1_ECMULT_GEN_CONTEXT_PREALLOCATED_SIZE;
+    }
+    if (secp256k1_ecmult_context_is_built(&ctx->ecmult_ctx)) {
+        ret += SECP256K1_ECMULT_CONTEXT_PREALLOCATED_SIZE;
+    }
+    return ret;
+}
+
+secp256k1_context* secp256k1_context_preallocated_create(void* prealloc, unsigned int flags) {
+    void* const base = prealloc;
+    size_t prealloc_size;
+    secp256k1_context* ret;
+
+    if (!secp256k1_selftest()) {
+        secp256k1_callback_call(&default_error_callback, "self test failed");
+    }
+
+    prealloc_size = secp256k1_context_preallocated_size(flags);
+    if (prealloc_size == 0) {
+        return NULL;
+    }
+    VERIFY_CHECK(prealloc != NULL);
+    ret = (secp256k1_context*)manual_alloc(&prealloc, sizeof(secp256k1_context), base, prealloc_size);
+    ret->illegal_callback = default_illegal_callback;
+    ret->error_callback = default_error_callback;
+
+    secp256k1_ecmult_context_init(&ret->ecmult_ctx);
+    secp256k1_ecmult_gen_context_init(&ret->ecmult_gen_ctx);
+
+    /* Flags have been checked by secp256k1_context_preallocated_size. */
+    VERIFY_CHECK((flags & SECP256K1_FLAGS_TYPE_MASK) == SECP256K1_FLAGS_TYPE_CONTEXT);
+    if (flags & SECP256K1_FLAGS_BIT_CONTEXT_SIGN) {
+        secp256k1_ecmult_gen_context_build(&ret->ecmult_gen_ctx, &prealloc);
+    }
+    if (flags & SECP256K1_FLAGS_BIT_CONTEXT_VERIFY) {
+        secp256k1_ecmult_context_build(&ret->ecmult_ctx, &prealloc);
+    }
+    ret->declassify = !!(flags & SECP256K1_FLAGS_BIT_CONTEXT_DECLASSIFY);
+
+    return (secp256k1_context*) ret;
+}
+
+secp256k1_context* secp256k1_context_create(unsigned int flags) {
+    size_t const prealloc_size = secp256k1_context_preallocated_size(flags);
+    secp256k1_context* ctx = (secp256k1_context*)checked_malloc(&default_error_callback, prealloc_size);
+    if (EXPECT(secp256k1_context_preallocated_create(ctx, flags) == NULL, 0)) {
+        free(ctx);
+        return NULL;
+    }
+
+    return ctx;
+}
+
+secp256k1_context* secp256k1_context_preallocated_clone(const secp256k1_context* ctx, void* prealloc) {
+    size_t prealloc_size;
+    secp256k1_context* ret;
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(prealloc != NULL);
+
+    prealloc_size = secp256k1_context_preallocated_clone_size(ctx);
+    ret = (secp256k1_context*)prealloc;
+    memcpy(ret, ctx, prealloc_size);
+    secp256k1_ecmult_gen_context_finalize_memcpy(&ret->ecmult_gen_ctx, &ctx->ecmult_gen_ctx);
+    secp256k1_ecmult_context_finalize_memcpy(&ret->ecmult_ctx, &ctx->ecmult_ctx);
+    return ret;
+}
+
+secp256k1_context* secp256k1_context_clone(const secp256k1_context* ctx) {
+    secp256k1_context* ret;
+    size_t prealloc_size;
+
+    VERIFY_CHECK(ctx != NULL);
+    prealloc_size = secp256k1_context_preallocated_clone_size(ctx);
+    ret = (secp256k1_context*)checked_malloc(&ctx->error_callback, prealloc_size);
+    ret = secp256k1_context_preallocated_clone(ctx, ret);
+    return ret;
+}
+
+void secp256k1_context_preallocated_destroy(secp256k1_context* ctx) {
+    ARG_CHECK_NO_RETURN(ctx != secp256k1_context_no_precomp);
+    if (ctx != NULL) {
+        secp256k1_ecmult_context_clear(&ctx->ecmult_ctx);
+        secp256k1_ecmult_gen_context_clear(&ctx->ecmult_gen_ctx);
+    }
+}
+
+void secp256k1_context_destroy(secp256k1_context* ctx) {
+    if (ctx != NULL) {
+        secp256k1_context_preallocated_destroy(ctx);
+        free(ctx);
+    }
+}
+
+void secp256k1_context_set_illegal_callback(secp256k1_context* ctx, void (*fun)(const char* message, void* data), const void* data) {
+    ARG_CHECK_NO_RETURN(ctx != secp256k1_context_no_precomp);
+    if (fun == NULL) {
+        fun = secp256k1_default_illegal_callback_fn;
+    }
+    ctx->illegal_callback.fn = fun;
+    ctx->illegal_callback.data = data;
+}
+
+void secp256k1_context_set_error_callback(secp256k1_context* ctx, void (*fun)(const char* message, void* data), const void* data) {
+    ARG_CHECK_NO_RETURN(ctx != secp256k1_context_no_precomp);
+    if (fun == NULL) {
+        fun = secp256k1_default_error_callback_fn;
+    }
+    ctx->error_callback.fn = fun;
+    ctx->error_callback.data = data;
+}
+
+secp256k1_scratch_space* secp256k1_scratch_space_create(const secp256k1_context* ctx, size_t max_size) {
+    VERIFY_CHECK(ctx != NULL);
+    return secp256k1_scratch_create(&ctx->error_callback, max_size);
+}
+
+void secp256k1_scratch_space_destroy(const secp256k1_context *ctx, secp256k1_scratch_space* scratch) {
+    VERIFY_CHECK(ctx != NULL);
+    secp256k1_scratch_destroy(&ctx->error_callback, scratch);
+}
+
+/* Mark memory as no-longer-secret for the purpose of analysing constant-time behaviour
+ *  of the software. This is setup for use with valgrind but could be substituted with
+ *  the appropriate instrumentation for other analysis tools.
+ */
+static SECP256K1_INLINE void secp256k1_declassify(const secp256k1_context* ctx, const void *p, size_t len) {
+#if defined(VALGRIND)
+    if (EXPECT(ctx->declassify,0)) VALGRIND_MAKE_MEM_DEFINED(p, len);
+#else
+    (void)ctx;
+    (void)p;
+    (void)len;
+#endif
+}
+
+static int secp256k1_pubkey_load(const secp256k1_context* ctx, secp256k1_ge* ge, const secp256k1_pubkey* pubkey) {
+    if (sizeof(secp256k1_ge_storage) == 64) {
+        /* When the secp256k1_ge_storage type is exactly 64 byte, use its
+         * representation inside secp256k1_pubkey, as conversion is very fast.
+         * Note that secp256k1_pubkey_save must use the same representation. */
+        secp256k1_ge_storage s;
+        memcpy(&s, &pubkey->data[0], sizeof(s));
+        secp256k1_ge_from_storage(ge, &s);
+    } else {
+        /* Otherwise, fall back to 32-byte big endian for X and Y. */
+        secp256k1_fe x, y;
+        secp256k1_fe_set_b32(&x, pubkey->data);
+        secp256k1_fe_set_b32(&y, pubkey->data + 32);
+        secp256k1_ge_set_xy(ge, &x, &y);
+    }
+    ARG_CHECK(!secp256k1_fe_is_zero(&ge->x));
+    return 1;
+}
+
+static void secp256k1_pubkey_save(secp256k1_pubkey* pubkey, secp256k1_ge* ge) {
+    if (sizeof(secp256k1_ge_storage) == 64) {
+        secp256k1_ge_storage s;
+        secp256k1_ge_to_storage(&s, ge);
+        memcpy(&pubkey->data[0], &s, sizeof(s));
+    } else {
+        VERIFY_CHECK(!secp256k1_ge_is_infinity(ge));
+        secp256k1_fe_normalize_var(&ge->x);
+        secp256k1_fe_normalize_var(&ge->y);
+        secp256k1_fe_get_b32(pubkey->data, &ge->x);
+        secp256k1_fe_get_b32(pubkey->data + 32, &ge->y);
+    }
+}
+
+int secp256k1_ec_pubkey_parse(const secp256k1_context* ctx, secp256k1_pubkey* pubkey, const unsigned char *input, size_t inputlen) {
+    secp256k1_ge Q;
+
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(pubkey != NULL);
+    memset(pubkey, 0, sizeof(*pubkey));
+    ARG_CHECK(input != NULL);
+    if (!secp256k1_eckey_pubkey_parse(&Q, input, inputlen)) {
+        return 0;
+    }
+    if (!secp256k1_ge_is_in_correct_subgroup(&Q)) {
+        return 0;
+    }
+    secp256k1_pubkey_save(pubkey, &Q);
+    secp256k1_ge_clear(&Q);
+    return 1;
+}
+
+int secp256k1_ec_pubkey_serialize(const secp256k1_context* ctx, unsigned char *output, size_t *outputlen, const secp256k1_pubkey* pubkey, unsigned int flags) {
+    secp256k1_ge Q;
+    size_t len;
+    int ret = 0;
+
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(outputlen != NULL);
+    ARG_CHECK(*outputlen >= ((flags & SECP256K1_FLAGS_BIT_COMPRESSION) ? 33u : 65u));
+    len = *outputlen;
+    *outputlen = 0;
+    ARG_CHECK(output != NULL);
+    memset(output, 0, len);
+    ARG_CHECK(pubkey != NULL);
+    ARG_CHECK((flags & SECP256K1_FLAGS_TYPE_MASK) == SECP256K1_FLAGS_TYPE_COMPRESSION);
+    if (secp256k1_pubkey_load(ctx, &Q, pubkey)) {
+        ret = secp256k1_eckey_pubkey_serialize(&Q, output, &len, flags & SECP256K1_FLAGS_BIT_COMPRESSION);
+        if (ret) {
+            *outputlen = len;
+        }
+    }
+    return ret;
+}
+
+static void secp256k1_ecdsa_signature_load(const secp256k1_context* ctx, secp256k1_scalar* r, secp256k1_scalar* s, const secp256k1_ecdsa_signature* sig) {
+    (void)ctx;
+    if (sizeof(secp256k1_scalar) == 32) {
+        /* When the secp256k1_scalar type is exactly 32 byte, use its
+         * representation inside secp256k1_ecdsa_signature, as conversion is very fast.
+         * Note that secp256k1_ecdsa_signature_save must use the same representation. */
+        memcpy(r, &sig->data[0], 32);
+        memcpy(s, &sig->data[32], 32);
+    } else {
+        secp256k1_scalar_set_b32(r, &sig->data[0], NULL);
+        secp256k1_scalar_set_b32(s, &sig->data[32], NULL);
+    }
+}
+
+static void secp256k1_ecdsa_signature_save(secp256k1_ecdsa_signature* sig, const secp256k1_scalar* r, const secp256k1_scalar* s) {
+    if (sizeof(secp256k1_scalar) == 32) {
+        memcpy(&sig->data[0], r, 32);
+        memcpy(&sig->data[32], s, 32);
+    } else {
+        secp256k1_scalar_get_b32(&sig->data[0], r);
+        secp256k1_scalar_get_b32(&sig->data[32], s);
+    }
+}
+
+int secp256k1_ecdsa_signature_parse_der(const secp256k1_context* ctx, secp256k1_ecdsa_signature* sig, const unsigned char *input, size_t inputlen) {
+    secp256k1_scalar r, s;
+
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(sig != NULL);
+    ARG_CHECK(input != NULL);
+
+    if (secp256k1_ecdsa_sig_parse(&r, &s, input, inputlen)) {
+        secp256k1_ecdsa_signature_save(sig, &r, &s);
+        return 1;
+    } else {
+        memset(sig, 0, sizeof(*sig));
+        return 0;
+    }
+}
+
+int secp256k1_ecdsa_signature_parse_compact(const secp256k1_context* ctx, secp256k1_ecdsa_signature* sig, const unsigned char *input64) {
+    secp256k1_scalar r, s;
+    int ret = 1;
+    int overflow = 0;
+
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(sig != NULL);
+    ARG_CHECK(input64 != NULL);
+
+    secp256k1_scalar_set_b32(&r, &input64[0], &overflow);
+    ret &= !overflow;
+    secp256k1_scalar_set_b32(&s, &input64[32], &overflow);
+    ret &= !overflow;
+    if (ret) {
+        secp256k1_ecdsa_signature_save(sig, &r, &s);
+    } else {
+        memset(sig, 0, sizeof(*sig));
+    }
+    return ret;
+}
+
+int secp256k1_ecdsa_signature_serialize_der(const secp256k1_context* ctx, unsigned char *output, size_t *outputlen, const secp256k1_ecdsa_signature* sig) {
+    secp256k1_scalar r, s;
+
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(output != NULL);
+    ARG_CHECK(outputlen != NULL);
+    ARG_CHECK(sig != NULL);
+
+    secp256k1_ecdsa_signature_load(ctx, &r, &s, sig);
+    return secp256k1_ecdsa_sig_serialize(output, outputlen, &r, &s);
+}
+
+int secp256k1_ecdsa_signature_serialize_compact(const secp256k1_context* ctx, unsigned char *output64, const secp256k1_ecdsa_signature* sig) {
+    secp256k1_scalar r, s;
+
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(output64 != NULL);
+    ARG_CHECK(sig != NULL);
+
+    secp256k1_ecdsa_signature_load(ctx, &r, &s, sig);
+    secp256k1_scalar_get_b32(&output64[0], &r);
+    secp256k1_scalar_get_b32(&output64[32], &s);
+    return 1;
+}
+
+int secp256k1_ecdsa_signature_normalize(const secp256k1_context* ctx, secp256k1_ecdsa_signature *sigout, const secp256k1_ecdsa_signature *sigin) {
+    secp256k1_scalar r, s;
+    int ret = 0;
+
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(sigin != NULL);
+
+    secp256k1_ecdsa_signature_load(ctx, &r, &s, sigin);
+    ret = secp256k1_scalar_is_high(&s);
+    if (sigout != NULL) {
+        if (ret) {
+            secp256k1_scalar_negate(&s, &s);
+        }
+        secp256k1_ecdsa_signature_save(sigout, &r, &s);
+    }
+
+    return ret;
+}
+
+int secp256k1_ecdsa_verify(const secp256k1_context* ctx, const secp256k1_ecdsa_signature *sig, const unsigned char *msghash32, const secp256k1_pubkey *pubkey) {
+    secp256k1_ge q;
+    secp256k1_scalar r, s;
+    secp256k1_scalar m;
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(secp256k1_ecmult_context_is_built(&ctx->ecmult_ctx));
+    ARG_CHECK(msghash32 != NULL);
+    ARG_CHECK(sig != NULL);
+    ARG_CHECK(pubkey != NULL);
+
+    secp256k1_scalar_set_b32(&m, msghash32, NULL);
+    secp256k1_ecdsa_signature_load(ctx, &r, &s, sig);
+    return (!secp256k1_scalar_is_high(&s) &&
+            secp256k1_pubkey_load(ctx, &q, pubkey) &&
+            secp256k1_ecdsa_sig_verify(&ctx->ecmult_ctx, &r, &s, &q, &m));
+}
+
+static SECP256K1_INLINE void buffer_append(unsigned char *buf, unsigned int *offset, const void *data, unsigned int len) {
+    memcpy(buf + *offset, data, len);
+    *offset += len;
+}
+
+static int nonce_function_rfc6979(unsigned char *nonce32, const unsigned char *msg32, const unsigned char *key32, const unsigned char *algo16, void *data, unsigned int counter) {
+   unsigned char keydata[112];
+   unsigned int offset = 0;
+   secp256k1_rfc6979_hmac_sha256 rng;
+   unsigned int i;
+   /* We feed a byte array to the PRNG as input, consisting of:
+    * - the private key (32 bytes) and message (32 bytes), see RFC 6979 3.2d.
+    * - optionally 32 extra bytes of data, see RFC 6979 3.6 Additional Data.
+    * - optionally 16 extra bytes with the algorithm name.
+    * Because the arguments have distinct fixed lengths it is not possible for
+    *  different argument mixtures to emulate each other and result in the same
+    *  nonces.
+    */
+   buffer_append(keydata, &offset, key32, 32);
+   buffer_append(keydata, &offset, msg32, 32);
+   if (data != NULL) {
+       buffer_append(keydata, &offset, data, 32);
+   }
+   if (algo16 != NULL) {
+       buffer_append(keydata, &offset, algo16, 16);
+   }
+   secp256k1_rfc6979_hmac_sha256_initialize(&rng, keydata, offset);
+   memset(keydata, 0, sizeof(keydata));
+   for (i = 0; i <= counter; i++) {
+       secp256k1_rfc6979_hmac_sha256_generate(&rng, nonce32, 32);
+   }
+   secp256k1_rfc6979_hmac_sha256_finalize(&rng);
+   return 1;
+}
+
+const secp256k1_nonce_function secp256k1_nonce_function_rfc6979 = nonce_function_rfc6979;
+const secp256k1_nonce_function secp256k1_nonce_function_default = nonce_function_rfc6979;
+
+static int secp256k1_ecdsa_sign_inner(const secp256k1_context* ctx, secp256k1_scalar* r, secp256k1_scalar* s, int* recid, const unsigned char *msg32, const unsigned char *seckey, secp256k1_nonce_function noncefp, const void* noncedata) {
+    secp256k1_scalar sec, non, msg;
+    int ret = 0;
+    int is_sec_valid;
+    unsigned char nonce32[32];
+    unsigned int count = 0;
+    /* Default initialization here is important so we won't pass uninit values to the cmov in the end */
+    *r = secp256k1_scalar_zero;
+    *s = secp256k1_scalar_zero;
+    if (recid) {
+        *recid = 0;
+    }
+    if (noncefp == NULL) {
+        noncefp = secp256k1_nonce_function_default;
+    }
+
+    /* Fail if the secret key is invalid. */
+    is_sec_valid = secp256k1_scalar_set_b32_seckey(&sec, seckey);
+    secp256k1_scalar_cmov(&sec, &secp256k1_scalar_one, !is_sec_valid);
+    secp256k1_scalar_set_b32(&msg, msg32, NULL);
+    while (1) {
+        int is_nonce_valid;
+        ret = !!noncefp(nonce32, msg32, seckey, NULL, (void*)noncedata, count);
+        if (!ret) {
+            break;
+        }
+        is_nonce_valid = secp256k1_scalar_set_b32_seckey(&non, nonce32);
+        /* The nonce is still secret here, but it being invalid is is less likely than 1:2^255. */
+        secp256k1_declassify(ctx, &is_nonce_valid, sizeof(is_nonce_valid));
+        if (is_nonce_valid) {
+            ret = secp256k1_ecdsa_sig_sign(&ctx->ecmult_gen_ctx, r, s, &sec, &msg, &non, recid);
+            /* The final signature is no longer a secret, nor is the fact that we were successful or not. */
+            secp256k1_declassify(ctx, &ret, sizeof(ret));
+            if (ret) {
+                break;
+            }
+        }
+        count++;
+    }
+    /* We don't want to declassify is_sec_valid and therefore the range of
+     * seckey. As a result is_sec_valid is included in ret only after ret was
+     * used as a branching variable. */
+    ret &= is_sec_valid;
+    memset(nonce32, 0, 32);
+    secp256k1_scalar_clear(&msg);
+    secp256k1_scalar_clear(&non);
+    secp256k1_scalar_clear(&sec);
+    secp256k1_scalar_cmov(r, &secp256k1_scalar_zero, !ret);
+    secp256k1_scalar_cmov(s, &secp256k1_scalar_zero, !ret);
+    if (recid) {
+        const int zero = 0;
+        secp256k1_int_cmov(recid, &zero, !ret);
+    }
+    return ret;
+}
+
+int secp256k1_ecdsa_sign(const secp256k1_context* ctx, secp256k1_ecdsa_signature *signature, const unsigned char *msghash32, const unsigned char *seckey, secp256k1_nonce_function noncefp, const void* noncedata) {
+    secp256k1_scalar r, s;
+    int ret;
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(secp256k1_ecmult_gen_context_is_built(&ctx->ecmult_gen_ctx));
+    ARG_CHECK(msghash32 != NULL);
+    ARG_CHECK(signature != NULL);
+    ARG_CHECK(seckey != NULL);
+
+    ret = secp256k1_ecdsa_sign_inner(ctx, &r, &s, NULL, msghash32, seckey, noncefp, noncedata);
+    secp256k1_ecdsa_signature_save(signature, &r, &s);
+    return ret;
+}
+
+int secp256k1_ec_seckey_verify(const secp256k1_context* ctx, const unsigned char *seckey) {
+    secp256k1_scalar sec;
+    int ret;
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(seckey != NULL);
+
+    ret = secp256k1_scalar_set_b32_seckey(&sec, seckey);
+    secp256k1_scalar_clear(&sec);
+    return ret;
+}
+
+static int secp256k1_ec_pubkey_create_helper(const secp256k1_ecmult_gen_context *ecmult_gen_ctx, secp256k1_scalar *seckey_scalar, secp256k1_ge *p, const unsigned char *seckey) {
+    secp256k1_gej pj;
+    int ret;
+
+    ret = secp256k1_scalar_set_b32_seckey(seckey_scalar, seckey);
+    secp256k1_scalar_cmov(seckey_scalar, &secp256k1_scalar_one, !ret);
+
+    secp256k1_ecmult_gen(ecmult_gen_ctx, &pj, seckey_scalar);
+    secp256k1_ge_set_gej(p, &pj);
+    return ret;
+}
+
+int secp256k1_ec_pubkey_create(const secp256k1_context* ctx, secp256k1_pubkey *pubkey, const unsigned char *seckey) {
+    secp256k1_ge p;
+    secp256k1_scalar seckey_scalar;
+    int ret = 0;
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(pubkey != NULL);
+    memset(pubkey, 0, sizeof(*pubkey));
+    ARG_CHECK(secp256k1_ecmult_gen_context_is_built(&ctx->ecmult_gen_ctx));
+    ARG_CHECK(seckey != NULL);
+
+    ret = secp256k1_ec_pubkey_create_helper(&ctx->ecmult_gen_ctx, &seckey_scalar, &p, seckey);
+    secp256k1_pubkey_save(pubkey, &p);
+    secp256k1_memczero(pubkey, sizeof(*pubkey), !ret);
+
+    secp256k1_scalar_clear(&seckey_scalar);
+    return ret;
+}
+
+int secp256k1_ec_seckey_negate(const secp256k1_context* ctx, unsigned char *seckey) {
+    secp256k1_scalar sec;
+    int ret = 0;
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(seckey != NULL);
+
+    ret = secp256k1_scalar_set_b32_seckey(&sec, seckey);
+    secp256k1_scalar_cmov(&sec, &secp256k1_scalar_zero, !ret);
+    secp256k1_scalar_negate(&sec, &sec);
+    secp256k1_scalar_get_b32(seckey, &sec);
+
+    secp256k1_scalar_clear(&sec);
+    return ret;
+}
+
+int secp256k1_ec_privkey_negate(const secp256k1_context* ctx, unsigned char *seckey) {
+    return secp256k1_ec_seckey_negate(ctx, seckey);
+}
+
+int secp256k1_ec_pubkey_negate(const secp256k1_context* ctx, secp256k1_pubkey *pubkey) {
+    int ret = 0;
+    secp256k1_ge p;
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(pubkey != NULL);
+
+    ret = secp256k1_pubkey_load(ctx, &p, pubkey);
+    memset(pubkey, 0, sizeof(*pubkey));
+    if (ret) {
+        secp256k1_ge_neg(&p, &p);
+        secp256k1_pubkey_save(pubkey, &p);
+    }
+    return ret;
+}
+
+
+static int secp256k1_ec_seckey_tweak_add_helper(secp256k1_scalar *sec, const unsigned char *tweak32) {
+    secp256k1_scalar term;
+    int overflow = 0;
+    int ret = 0;
+
+    secp256k1_scalar_set_b32(&term, tweak32, &overflow);
+    ret = (!overflow) & secp256k1_eckey_privkey_tweak_add(sec, &term);
+    secp256k1_scalar_clear(&term);
+    return ret;
+}
+
+int secp256k1_ec_seckey_tweak_add(const secp256k1_context* ctx, unsigned char *seckey, const unsigned char *tweak32) {
+    secp256k1_scalar sec;
+    int ret = 0;
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(seckey != NULL);
+    ARG_CHECK(tweak32 != NULL);
+
+    ret = secp256k1_scalar_set_b32_seckey(&sec, seckey);
+    ret &= secp256k1_ec_seckey_tweak_add_helper(&sec, tweak32);
+    secp256k1_scalar_cmov(&sec, &secp256k1_scalar_zero, !ret);
+    secp256k1_scalar_get_b32(seckey, &sec);
+
+    secp256k1_scalar_clear(&sec);
+    return ret;
+}
+
+int secp256k1_ec_privkey_tweak_add(const secp256k1_context* ctx, unsigned char *seckey, const unsigned char *tweak32) {
+    return secp256k1_ec_seckey_tweak_add(ctx, seckey, tweak32);
+}
+
+static int secp256k1_ec_pubkey_tweak_add_helper(const secp256k1_ecmult_context* ecmult_ctx, secp256k1_ge *p, const unsigned char *tweak32) {
+    secp256k1_scalar term;
+    int overflow = 0;
+    secp256k1_scalar_set_b32(&term, tweak32, &overflow);
+    return !overflow && secp256k1_eckey_pubkey_tweak_add(ecmult_ctx, p, &term);
+}
+
+int secp256k1_ec_pubkey_tweak_add(const secp256k1_context* ctx, secp256k1_pubkey *pubkey, const unsigned char *tweak32) {
+    secp256k1_ge p;
+    int ret = 0;
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(secp256k1_ecmult_context_is_built(&ctx->ecmult_ctx));
+    ARG_CHECK(pubkey != NULL);
+    ARG_CHECK(tweak32 != NULL);
+
+    ret = secp256k1_pubkey_load(ctx, &p, pubkey);
+    memset(pubkey, 0, sizeof(*pubkey));
+    ret = ret && secp256k1_ec_pubkey_tweak_add_helper(&ctx->ecmult_ctx, &p, tweak32);
+    if (ret) {
+        secp256k1_pubkey_save(pubkey, &p);
+    }
+
+    return ret;
+}
+
+int secp256k1_ec_seckey_tweak_mul(const secp256k1_context* ctx, unsigned char *seckey, const unsigned char *tweak32) {
+    secp256k1_scalar factor;
+    secp256k1_scalar sec;
+    int ret = 0;
+    int overflow = 0;
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(seckey != NULL);
+    ARG_CHECK(tweak32 != NULL);
+
+    secp256k1_scalar_set_b32(&factor, tweak32, &overflow);
+    ret = secp256k1_scalar_set_b32_seckey(&sec, seckey);
+    ret &= (!overflow) & secp256k1_eckey_privkey_tweak_mul(&sec, &factor);
+    secp256k1_scalar_cmov(&sec, &secp256k1_scalar_zero, !ret);
+    secp256k1_scalar_get_b32(seckey, &sec);
+
+    secp256k1_scalar_clear(&sec);
+    secp256k1_scalar_clear(&factor);
+    return ret;
+}
+
+int secp256k1_ec_privkey_tweak_mul(const secp256k1_context* ctx, unsigned char *seckey, const unsigned char *tweak32) {
+    return secp256k1_ec_seckey_tweak_mul(ctx, seckey, tweak32);
+}
+
+int secp256k1_ec_pubkey_tweak_mul(const secp256k1_context* ctx, secp256k1_pubkey *pubkey, const unsigned char *tweak32) {
+    secp256k1_ge p;
+    secp256k1_scalar factor;
+    int ret = 0;
+    int overflow = 0;
+    VERIFY_CHECK(ctx != NULL);
+    ARG_CHECK(secp256k1_ecmult_context_is_built(&ctx->ecmult_ctx));
+    ARG_CHECK(pubkey != NULL);
+    ARG_CHECK(tweak32 != NULL);
+
+    secp256k1_scalar_set_b32(&factor, tweak32, &overflow);
+    ret = !overflow && secp256k1_pubkey_load(ctx, &p, pubkey);
+    memset(pubkey, 0, sizeof(*pubkey));
+    if (ret) {
+        if (secp256k1_eckey_pubkey_tweak_mul(&ctx->ecmult_ctx, &p, &factor)) {
+            secp256k1_pubkey_save(pubkey, &p);
+        } else {
+            ret = 0;
+        }
+    }
+
+    return ret;
+}
+
+int secp256k1_context_randomize(secp256k1_context* ctx, const unsigned char *seed32) {
+    VERIFY_CHECK(ctx != NULL);
+    if (secp256k1_ecmult_gen_context_is_built(&ctx->ecmult_gen_ctx)) {
+        secp256k1_ecmult_gen_blind(&ctx->ecmult_gen_ctx, seed32);
+    }
+    return 1;
+}
+
+int secp256k1_ec_pubkey_combine(const secp256k1_context* ctx, secp256k1_pubkey *pubnonce, const secp256k1_pubkey * const *pubnonces, size_t n) {
+    size_t i;
+    secp256k1_gej Qj;
+    secp256k1_ge Q;
+
+    ARG_CHECK(pubnonce != NULL);
+    memset(pubnonce, 0, sizeof(*pubnonce));
+    ARG_CHECK(n >= 1);
+    ARG_CHECK(pubnonces != NULL);
+
+    secp256k1_gej_set_infinity(&Qj);
+
+    for (i = 0; i < n; i++) {
+        secp256k1_pubkey_load(ctx, &Q, pubnonces[i]);
+        secp256k1_gej_add_ge(&Qj, &Qj, &Q);
+    }
+    if (secp256k1_gej_is_infinity(&Qj)) {
+        return 0;
+    }
+    secp256k1_ge_set_gej(&Q, &Qj);
+    secp256k1_pubkey_save(pubnonce, &Q);
+    return 1;
+}
+
+#ifdef ENABLE_MODULE_ECDH
+# include "modules/ecdh/main_impl.h"
+#endif
+
+#ifdef ENABLE_MODULE_RECOVERY
+# include "modules/recovery/main_impl.h"
+#endif
+
+#ifdef ENABLE_MODULE_EXTRAKEYS
+# include "modules/extrakeys/main_impl.h"
+#endif
+
+#ifdef ENABLE_MODULE_SCHNORRSIG
+# include "modules/schnorrsig/main_impl.h"
+#endif
diff --git a/depend/zcash/src/secp256k1/src/selftest.h b/depend/zcash/src/secp256k1/src/selftest.h
new file mode 100644
index 000000000..52f1b8442
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/selftest.h
@@ -0,0 +1,32 @@
+/***********************************************************************
+ * Copyright (c) 2020 Pieter Wuille                                    *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_SELFTEST_H
+#define SECP256K1_SELFTEST_H
+
+#include "hash.h"
+
+#include <string.h>
+
+static int secp256k1_selftest_sha256(void) {
+    static const char *input63 = "For this sample, this 63-byte string will be used as input data";
+    static const unsigned char output32[32] = {
+        0xf0, 0x8a, 0x78, 0xcb, 0xba, 0xee, 0x08, 0x2b, 0x05, 0x2a, 0xe0, 0x70, 0x8f, 0x32, 0xfa, 0x1e,
+        0x50, 0xc5, 0xc4, 0x21, 0xaa, 0x77, 0x2b, 0xa5, 0xdb, 0xb4, 0x06, 0xa2, 0xea, 0x6b, 0xe3, 0x42,
+    };
+    unsigned char out[32];
+    secp256k1_sha256 hasher;
+    secp256k1_sha256_initialize(&hasher);
+    secp256k1_sha256_write(&hasher, (const unsigned char*)input63, 63);
+    secp256k1_sha256_finalize(&hasher, out);
+    return secp256k1_memcmp_var(out, output32, 32) == 0;
+}
+
+static int secp256k1_selftest(void) {
+    return secp256k1_selftest_sha256();
+}
+
+#endif /* SECP256K1_SELFTEST_H */
diff --git a/depend/zcash/src/secp256k1/src/testrand.h b/depend/zcash/src/secp256k1/src/testrand.h
new file mode 100644
index 000000000..667d1867b
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/testrand.h
@@ -0,0 +1,47 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_TESTRAND_H
+#define SECP256K1_TESTRAND_H
+
+#if defined HAVE_CONFIG_H
+#include "libsecp256k1-config.h"
+#endif
+
+/* A non-cryptographic RNG used only for test infrastructure. */
+
+/** Seed the pseudorandom number generator for testing. */
+SECP256K1_INLINE static void secp256k1_testrand_seed(const unsigned char *seed16);
+
+/** Generate a pseudorandom number in the range [0..2**32-1]. */
+static uint32_t secp256k1_testrand32(void);
+
+/** Generate a pseudorandom number in the range [0..2**bits-1]. Bits must be 1 or
+ *  more. */
+static uint32_t secp256k1_testrand_bits(int bits);
+
+/** Generate a pseudorandom number in the range [0..range-1]. */
+static uint32_t secp256k1_testrand_int(uint32_t range);
+
+/** Generate a pseudorandom 32-byte array. */
+static void secp256k1_testrand256(unsigned char *b32);
+
+/** Generate a pseudorandom 32-byte array with long sequences of zero and one bits. */
+static void secp256k1_testrand256_test(unsigned char *b32);
+
+/** Generate pseudorandom bytes with long sequences of zero and one bits. */
+static void secp256k1_testrand_bytes_test(unsigned char *bytes, size_t len);
+
+/** Flip a single random bit in a byte array */
+static void secp256k1_testrand_flip(unsigned char *b, size_t len);
+
+/** Initialize the test RNG using (hex encoded) array up to 16 bytes, or randomly if hexseed is NULL. */
+static void secp256k1_testrand_init(const char* hexseed);
+
+/** Print final test information. */
+static void secp256k1_testrand_finish(void);
+
+#endif /* SECP256K1_TESTRAND_H */
diff --git a/depend/zcash/src/secp256k1/src/testrand_impl.h b/depend/zcash/src/secp256k1/src/testrand_impl.h
new file mode 100644
index 000000000..e643778f3
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/testrand_impl.h
@@ -0,0 +1,158 @@
+/***********************************************************************
+ * Copyright (c) 2013-2015 Pieter Wuille                               *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_TESTRAND_IMPL_H
+#define SECP256K1_TESTRAND_IMPL_H
+
+#include <stdint.h>
+#include <stdio.h>
+#include <string.h>
+
+#include "testrand.h"
+#include "hash.h"
+
+static secp256k1_rfc6979_hmac_sha256 secp256k1_test_rng;
+static uint32_t secp256k1_test_rng_precomputed[8];
+static int secp256k1_test_rng_precomputed_used = 8;
+static uint64_t secp256k1_test_rng_integer;
+static int secp256k1_test_rng_integer_bits_left = 0;
+
+SECP256K1_INLINE static void secp256k1_testrand_seed(const unsigned char *seed16) {
+    secp256k1_rfc6979_hmac_sha256_initialize(&secp256k1_test_rng, seed16, 16);
+}
+
+SECP256K1_INLINE static uint32_t secp256k1_testrand32(void) {
+    if (secp256k1_test_rng_precomputed_used == 8) {
+        secp256k1_rfc6979_hmac_sha256_generate(&secp256k1_test_rng, (unsigned char*)(&secp256k1_test_rng_precomputed[0]), sizeof(secp256k1_test_rng_precomputed));
+        secp256k1_test_rng_precomputed_used = 0;
+    }
+    return secp256k1_test_rng_precomputed[secp256k1_test_rng_precomputed_used++];
+}
+
+static uint32_t secp256k1_testrand_bits(int bits) {
+    uint32_t ret;
+    if (secp256k1_test_rng_integer_bits_left < bits) {
+        secp256k1_test_rng_integer |= (((uint64_t)secp256k1_testrand32()) << secp256k1_test_rng_integer_bits_left);
+        secp256k1_test_rng_integer_bits_left += 32;
+    }
+    ret = secp256k1_test_rng_integer;
+    secp256k1_test_rng_integer >>= bits;
+    secp256k1_test_rng_integer_bits_left -= bits;
+    ret &= ((~((uint32_t)0)) >> (32 - bits));
+    return ret;
+}
+
+static uint32_t secp256k1_testrand_int(uint32_t range) {
+    /* We want a uniform integer between 0 and range-1, inclusive.
+     * B is the smallest number such that range <= 2**B.
+     * two mechanisms implemented here:
+     * - generate B bits numbers until one below range is found, and return it
+     * - find the largest multiple M of range that is <= 2**(B+A), generate B+A
+     *   bits numbers until one below M is found, and return it modulo range
+     * The second mechanism consumes A more bits of entropy in every iteration,
+     * but may need fewer iterations due to M being closer to 2**(B+A) then
+     * range is to 2**B. The array below (indexed by B) contains a 0 when the
+     * first mechanism is to be used, and the number A otherwise.
+     */
+    static const int addbits[] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 0};
+    uint32_t trange, mult;
+    int bits = 0;
+    if (range <= 1) {
+        return 0;
+    }
+    trange = range - 1;
+    while (trange > 0) {
+        trange >>= 1;
+        bits++;
+    }
+    if (addbits[bits]) {
+        bits = bits + addbits[bits];
+        mult = ((~((uint32_t)0)) >> (32 - bits)) / range;
+        trange = range * mult;
+    } else {
+        trange = range;
+        mult = 1;
+    }
+    while(1) {
+        uint32_t x = secp256k1_testrand_bits(bits);
+        if (x < trange) {
+            return (mult == 1) ? x : (x % range);
+        }
+    }
+}
+
+static void secp256k1_testrand256(unsigned char *b32) {
+    secp256k1_rfc6979_hmac_sha256_generate(&secp256k1_test_rng, b32, 32);
+}
+
+static void secp256k1_testrand_bytes_test(unsigned char *bytes, size_t len) {
+    size_t bits = 0;
+    memset(bytes, 0, len);
+    while (bits < len * 8) {
+        int now;
+        uint32_t val;
+        now = 1 + (secp256k1_testrand_bits(6) * secp256k1_testrand_bits(5) + 16) / 31;
+        val = secp256k1_testrand_bits(1);
+        while (now > 0 && bits < len * 8) {
+            bytes[bits / 8] |= val << (bits % 8);
+            now--;
+            bits++;
+        }
+    }
+}
+
+static void secp256k1_testrand256_test(unsigned char *b32) {
+    secp256k1_testrand_bytes_test(b32, 32);
+}
+
+static void secp256k1_testrand_flip(unsigned char *b, size_t len) {
+    b[secp256k1_testrand_int(len)] ^= (1 << secp256k1_testrand_int(8));
+}
+
+static void secp256k1_testrand_init(const char* hexseed) {
+    unsigned char seed16[16] = {0};
+    if (hexseed && strlen(hexseed) != 0) {
+        int pos = 0;
+        while (pos < 16 && hexseed[0] != 0 && hexseed[1] != 0) {
+            unsigned short sh;
+            if ((sscanf(hexseed, "%2hx", &sh)) == 1) {
+                seed16[pos] = sh;
+            } else {
+                break;
+            }
+            hexseed += 2;
+            pos++;
+        }
+    } else {
+        FILE *frand = fopen("/dev/urandom", "r");
+        if ((frand == NULL) || fread(&seed16, 1, sizeof(seed16), frand) != sizeof(seed16)) {
+            uint64_t t = time(NULL) * (uint64_t)1337;
+            fprintf(stderr, "WARNING: could not read 16 bytes from /dev/urandom; falling back to insecure PRNG\n");
+            seed16[0] ^= t;
+            seed16[1] ^= t >> 8;
+            seed16[2] ^= t >> 16;
+            seed16[3] ^= t >> 24;
+            seed16[4] ^= t >> 32;
+            seed16[5] ^= t >> 40;
+            seed16[6] ^= t >> 48;
+            seed16[7] ^= t >> 56;
+        }
+        if (frand) {
+            fclose(frand);
+        }
+    }
+
+    printf("random seed = %02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x\n", seed16[0], seed16[1], seed16[2], seed16[3], seed16[4], seed16[5], seed16[6], seed16[7], seed16[8], seed16[9], seed16[10], seed16[11], seed16[12], seed16[13], seed16[14], seed16[15]);
+    secp256k1_testrand_seed(seed16);
+}
+
+static void secp256k1_testrand_finish(void) {
+    unsigned char run32[32];
+    secp256k1_testrand256(run32);
+    printf("random run = %02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x%02x\n", run32[0], run32[1], run32[2], run32[3], run32[4], run32[5], run32[6], run32[7], run32[8], run32[9], run32[10], run32[11], run32[12], run32[13], run32[14], run32[15]);
+}
+
+#endif /* SECP256K1_TESTRAND_IMPL_H */
diff --git a/depend/zcash/src/secp256k1/src/tests.c b/depend/zcash/src/secp256k1/src/tests.c
new file mode 100644
index 000000000..c2d5e2892
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/tests.c
@@ -0,0 +1,5696 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014, 2015 Pieter Wuille, Gregory Maxwell       *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#if defined HAVE_CONFIG_H
+#include "libsecp256k1-config.h"
+#endif
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include <time.h>
+
+#include "secp256k1.c"
+#include "include/secp256k1.h"
+#include "include/secp256k1_preallocated.h"
+#include "testrand_impl.h"
+
+#ifdef ENABLE_OPENSSL_TESTS
+#include "openssl/bn.h"
+#include "openssl/ec.h"
+#include "openssl/ecdsa.h"
+#include "openssl/obj_mac.h"
+# if OPENSSL_VERSION_NUMBER < 0x10100000L
+void ECDSA_SIG_get0(const ECDSA_SIG *sig, const BIGNUM **pr, const BIGNUM **ps) {*pr = sig->r; *ps = sig->s;}
+# endif
+#endif
+
+#include "contrib/lax_der_parsing.c"
+#include "contrib/lax_der_privatekey_parsing.c"
+
+static int count = 64;
+static secp256k1_context *ctx = NULL;
+
+static void counting_illegal_callback_fn(const char* str, void* data) {
+    /* Dummy callback function that just counts. */
+    int32_t *p;
+    (void)str;
+    p = data;
+    (*p)++;
+}
+
+static void uncounting_illegal_callback_fn(const char* str, void* data) {
+    /* Dummy callback function that just counts (backwards). */
+    int32_t *p;
+    (void)str;
+    p = data;
+    (*p)--;
+}
+
+void random_field_element_test(secp256k1_fe *fe) {
+    do {
+        unsigned char b32[32];
+        secp256k1_testrand256_test(b32);
+        if (secp256k1_fe_set_b32(fe, b32)) {
+            break;
+        }
+    } while(1);
+}
+
+void random_field_element_magnitude(secp256k1_fe *fe) {
+    secp256k1_fe zero;
+    int n = secp256k1_testrand_int(9);
+    secp256k1_fe_normalize(fe);
+    if (n == 0) {
+        return;
+    }
+    secp256k1_fe_clear(&zero);
+    secp256k1_fe_negate(&zero, &zero, 0);
+    secp256k1_fe_mul_int(&zero, n - 1);
+    secp256k1_fe_add(fe, &zero);
+#ifdef VERIFY
+    CHECK(fe->magnitude == n);
+#endif
+}
+
+void random_group_element_test(secp256k1_ge *ge) {
+    secp256k1_fe fe;
+    do {
+        random_field_element_test(&fe);
+        if (secp256k1_ge_set_xo_var(ge, &fe, secp256k1_testrand_bits(1))) {
+            secp256k1_fe_normalize(&ge->y);
+            break;
+        }
+    } while(1);
+    ge->infinity = 0;
+}
+
+void random_group_element_jacobian_test(secp256k1_gej *gej, const secp256k1_ge *ge) {
+    secp256k1_fe z2, z3;
+    do {
+        random_field_element_test(&gej->z);
+        if (!secp256k1_fe_is_zero(&gej->z)) {
+            break;
+        }
+    } while(1);
+    secp256k1_fe_sqr(&z2, &gej->z);
+    secp256k1_fe_mul(&z3, &z2, &gej->z);
+    secp256k1_fe_mul(&gej->x, &ge->x, &z2);
+    secp256k1_fe_mul(&gej->y, &ge->y, &z3);
+    gej->infinity = ge->infinity;
+}
+
+void random_scalar_order_test(secp256k1_scalar *num) {
+    do {
+        unsigned char b32[32];
+        int overflow = 0;
+        secp256k1_testrand256_test(b32);
+        secp256k1_scalar_set_b32(num, b32, &overflow);
+        if (overflow || secp256k1_scalar_is_zero(num)) {
+            continue;
+        }
+        break;
+    } while(1);
+}
+
+void random_scalar_order(secp256k1_scalar *num) {
+    do {
+        unsigned char b32[32];
+        int overflow = 0;
+        secp256k1_testrand256(b32);
+        secp256k1_scalar_set_b32(num, b32, &overflow);
+        if (overflow || secp256k1_scalar_is_zero(num)) {
+            continue;
+        }
+        break;
+    } while(1);
+}
+
+void random_scalar_order_b32(unsigned char *b32) {
+    secp256k1_scalar num;
+    random_scalar_order(&num);
+    secp256k1_scalar_get_b32(b32, &num);
+}
+
+void run_context_tests(int use_prealloc) {
+    secp256k1_pubkey pubkey;
+    secp256k1_pubkey zero_pubkey;
+    secp256k1_ecdsa_signature sig;
+    unsigned char ctmp[32];
+    int32_t ecount;
+    int32_t ecount2;
+    secp256k1_context *none;
+    secp256k1_context *sign;
+    secp256k1_context *vrfy;
+    secp256k1_context *both;
+    void *none_prealloc = NULL;
+    void *sign_prealloc = NULL;
+    void *vrfy_prealloc = NULL;
+    void *both_prealloc = NULL;
+
+    secp256k1_gej pubj;
+    secp256k1_ge pub;
+    secp256k1_scalar msg, key, nonce;
+    secp256k1_scalar sigr, sigs;
+
+    if (use_prealloc) {
+        none_prealloc = malloc(secp256k1_context_preallocated_size(SECP256K1_CONTEXT_NONE));
+        sign_prealloc = malloc(secp256k1_context_preallocated_size(SECP256K1_CONTEXT_SIGN));
+        vrfy_prealloc = malloc(secp256k1_context_preallocated_size(SECP256K1_CONTEXT_VERIFY));
+        both_prealloc = malloc(secp256k1_context_preallocated_size(SECP256K1_CONTEXT_SIGN | SECP256K1_CONTEXT_VERIFY));
+        CHECK(none_prealloc != NULL);
+        CHECK(sign_prealloc != NULL);
+        CHECK(vrfy_prealloc != NULL);
+        CHECK(both_prealloc != NULL);
+        none = secp256k1_context_preallocated_create(none_prealloc, SECP256K1_CONTEXT_NONE);
+        sign = secp256k1_context_preallocated_create(sign_prealloc, SECP256K1_CONTEXT_SIGN);
+        vrfy = secp256k1_context_preallocated_create(vrfy_prealloc, SECP256K1_CONTEXT_VERIFY);
+        both = secp256k1_context_preallocated_create(both_prealloc, SECP256K1_CONTEXT_SIGN | SECP256K1_CONTEXT_VERIFY);
+    } else {
+        none = secp256k1_context_create(SECP256K1_CONTEXT_NONE);
+        sign = secp256k1_context_create(SECP256K1_CONTEXT_SIGN);
+        vrfy = secp256k1_context_create(SECP256K1_CONTEXT_VERIFY);
+        both = secp256k1_context_create(SECP256K1_CONTEXT_SIGN | SECP256K1_CONTEXT_VERIFY);
+    }
+
+    memset(&zero_pubkey, 0, sizeof(zero_pubkey));
+
+    ecount = 0;
+    ecount2 = 10;
+    secp256k1_context_set_illegal_callback(vrfy, counting_illegal_callback_fn, &ecount);
+    secp256k1_context_set_illegal_callback(sign, counting_illegal_callback_fn, &ecount2);
+    /* set error callback (to a function that still aborts in case malloc() fails in secp256k1_context_clone() below) */
+    secp256k1_context_set_error_callback(sign, secp256k1_default_illegal_callback_fn, NULL);
+    CHECK(sign->error_callback.fn != vrfy->error_callback.fn);
+    CHECK(sign->error_callback.fn == secp256k1_default_illegal_callback_fn);
+
+    /* check if sizes for cloning are consistent */
+    CHECK(secp256k1_context_preallocated_clone_size(none) == secp256k1_context_preallocated_size(SECP256K1_CONTEXT_NONE));
+    CHECK(secp256k1_context_preallocated_clone_size(sign) == secp256k1_context_preallocated_size(SECP256K1_CONTEXT_SIGN));
+    CHECK(secp256k1_context_preallocated_clone_size(vrfy) == secp256k1_context_preallocated_size(SECP256K1_CONTEXT_VERIFY));
+    CHECK(secp256k1_context_preallocated_clone_size(both) == secp256k1_context_preallocated_size(SECP256K1_CONTEXT_SIGN | SECP256K1_CONTEXT_VERIFY));
+
+    /*** clone and destroy all of them to make sure cloning was complete ***/
+    {
+        secp256k1_context *ctx_tmp;
+
+        if (use_prealloc) {
+            /* clone into a non-preallocated context and then again into a new preallocated one. */
+            ctx_tmp = none; none = secp256k1_context_clone(none); secp256k1_context_preallocated_destroy(ctx_tmp);
+            free(none_prealloc); none_prealloc = malloc(secp256k1_context_preallocated_size(SECP256K1_CONTEXT_NONE)); CHECK(none_prealloc != NULL);
+            ctx_tmp = none; none = secp256k1_context_preallocated_clone(none, none_prealloc); secp256k1_context_destroy(ctx_tmp);
+
+            ctx_tmp = sign; sign = secp256k1_context_clone(sign); secp256k1_context_preallocated_destroy(ctx_tmp);
+            free(sign_prealloc); sign_prealloc = malloc(secp256k1_context_preallocated_size(SECP256K1_CONTEXT_SIGN)); CHECK(sign_prealloc != NULL);
+            ctx_tmp = sign; sign = secp256k1_context_preallocated_clone(sign, sign_prealloc); secp256k1_context_destroy(ctx_tmp);
+
+            ctx_tmp = vrfy; vrfy = secp256k1_context_clone(vrfy); secp256k1_context_preallocated_destroy(ctx_tmp);
+            free(vrfy_prealloc); vrfy_prealloc = malloc(secp256k1_context_preallocated_size(SECP256K1_CONTEXT_VERIFY)); CHECK(vrfy_prealloc != NULL);
+            ctx_tmp = vrfy; vrfy = secp256k1_context_preallocated_clone(vrfy, vrfy_prealloc); secp256k1_context_destroy(ctx_tmp);
+
+            ctx_tmp = both; both = secp256k1_context_clone(both); secp256k1_context_preallocated_destroy(ctx_tmp);
+            free(both_prealloc); both_prealloc = malloc(secp256k1_context_preallocated_size(SECP256K1_CONTEXT_SIGN | SECP256K1_CONTEXT_VERIFY)); CHECK(both_prealloc != NULL);
+            ctx_tmp = both; both = secp256k1_context_preallocated_clone(both, both_prealloc); secp256k1_context_destroy(ctx_tmp);
+        } else {
+            /* clone into a preallocated context and then again into a new non-preallocated one. */
+            void *prealloc_tmp;
+
+            prealloc_tmp = malloc(secp256k1_context_preallocated_size(SECP256K1_CONTEXT_NONE)); CHECK(prealloc_tmp != NULL);
+            ctx_tmp = none; none = secp256k1_context_preallocated_clone(none, prealloc_tmp); secp256k1_context_destroy(ctx_tmp);
+            ctx_tmp = none; none = secp256k1_context_clone(none); secp256k1_context_preallocated_destroy(ctx_tmp);
+            free(prealloc_tmp);
+
+            prealloc_tmp = malloc(secp256k1_context_preallocated_size(SECP256K1_CONTEXT_SIGN)); CHECK(prealloc_tmp != NULL);
+            ctx_tmp = sign; sign = secp256k1_context_preallocated_clone(sign, prealloc_tmp); secp256k1_context_destroy(ctx_tmp);
+            ctx_tmp = sign; sign = secp256k1_context_clone(sign); secp256k1_context_preallocated_destroy(ctx_tmp);
+            free(prealloc_tmp);
+
+            prealloc_tmp = malloc(secp256k1_context_preallocated_size(SECP256K1_CONTEXT_VERIFY)); CHECK(prealloc_tmp != NULL);
+            ctx_tmp = vrfy; vrfy = secp256k1_context_preallocated_clone(vrfy, prealloc_tmp); secp256k1_context_destroy(ctx_tmp);
+            ctx_tmp = vrfy; vrfy = secp256k1_context_clone(vrfy); secp256k1_context_preallocated_destroy(ctx_tmp);
+            free(prealloc_tmp);
+
+            prealloc_tmp = malloc(secp256k1_context_preallocated_size(SECP256K1_CONTEXT_SIGN | SECP256K1_CONTEXT_VERIFY)); CHECK(prealloc_tmp != NULL);
+            ctx_tmp = both; both = secp256k1_context_preallocated_clone(both, prealloc_tmp); secp256k1_context_destroy(ctx_tmp);
+            ctx_tmp = both; both = secp256k1_context_clone(both); secp256k1_context_preallocated_destroy(ctx_tmp);
+            free(prealloc_tmp);
+        }
+    }
+
+    /* Verify that the error callback makes it across the clone. */
+    CHECK(sign->error_callback.fn != vrfy->error_callback.fn);
+    CHECK(sign->error_callback.fn == secp256k1_default_illegal_callback_fn);
+    /* And that it resets back to default. */
+    secp256k1_context_set_error_callback(sign, NULL, NULL);
+    CHECK(vrfy->error_callback.fn == sign->error_callback.fn);
+
+    /*** attempt to use them ***/
+    random_scalar_order_test(&msg);
+    random_scalar_order_test(&key);
+    secp256k1_ecmult_gen(&both->ecmult_gen_ctx, &pubj, &key);
+    secp256k1_ge_set_gej(&pub, &pubj);
+
+    /* Verify context-type checking illegal-argument errors. */
+    memset(ctmp, 1, 32);
+    CHECK(secp256k1_ec_pubkey_create(vrfy, &pubkey, ctmp) == 0);
+    CHECK(ecount == 1);
+    VG_UNDEF(&pubkey, sizeof(pubkey));
+    CHECK(secp256k1_ec_pubkey_create(sign, &pubkey, ctmp) == 1);
+    VG_CHECK(&pubkey, sizeof(pubkey));
+    CHECK(secp256k1_ecdsa_sign(vrfy, &sig, ctmp, ctmp, NULL, NULL) == 0);
+    CHECK(ecount == 2);
+    VG_UNDEF(&sig, sizeof(sig));
+    CHECK(secp256k1_ecdsa_sign(sign, &sig, ctmp, ctmp, NULL, NULL) == 1);
+    VG_CHECK(&sig, sizeof(sig));
+    CHECK(ecount2 == 10);
+    CHECK(secp256k1_ecdsa_verify(sign, &sig, ctmp, &pubkey) == 0);
+    CHECK(ecount2 == 11);
+    CHECK(secp256k1_ecdsa_verify(vrfy, &sig, ctmp, &pubkey) == 1);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_ec_pubkey_tweak_add(sign, &pubkey, ctmp) == 0);
+    CHECK(ecount2 == 12);
+    CHECK(secp256k1_ec_pubkey_tweak_add(vrfy, &pubkey, ctmp) == 1);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_ec_pubkey_tweak_mul(sign, &pubkey, ctmp) == 0);
+    CHECK(ecount2 == 13);
+    CHECK(secp256k1_ec_pubkey_negate(vrfy, &pubkey) == 1);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_ec_pubkey_negate(sign, &pubkey) == 1);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_ec_pubkey_negate(sign, NULL) == 0);
+    CHECK(ecount2 == 14);
+    CHECK(secp256k1_ec_pubkey_negate(vrfy, &zero_pubkey) == 0);
+    CHECK(ecount == 3);
+    CHECK(secp256k1_ec_pubkey_tweak_mul(vrfy, &pubkey, ctmp) == 1);
+    CHECK(ecount == 3);
+    CHECK(secp256k1_context_randomize(vrfy, ctmp) == 1);
+    CHECK(ecount == 3);
+    CHECK(secp256k1_context_randomize(vrfy, NULL) == 1);
+    CHECK(ecount == 3);
+    CHECK(secp256k1_context_randomize(sign, ctmp) == 1);
+    CHECK(ecount2 == 14);
+    CHECK(secp256k1_context_randomize(sign, NULL) == 1);
+    CHECK(ecount2 == 14);
+    secp256k1_context_set_illegal_callback(vrfy, NULL, NULL);
+    secp256k1_context_set_illegal_callback(sign, NULL, NULL);
+
+    /* obtain a working nonce */
+    do {
+        random_scalar_order_test(&nonce);
+    } while(!secp256k1_ecdsa_sig_sign(&both->ecmult_gen_ctx, &sigr, &sigs, &key, &msg, &nonce, NULL));
+
+    /* try signing */
+    CHECK(secp256k1_ecdsa_sig_sign(&sign->ecmult_gen_ctx, &sigr, &sigs, &key, &msg, &nonce, NULL));
+    CHECK(secp256k1_ecdsa_sig_sign(&both->ecmult_gen_ctx, &sigr, &sigs, &key, &msg, &nonce, NULL));
+
+    /* try verifying */
+    CHECK(secp256k1_ecdsa_sig_verify(&vrfy->ecmult_ctx, &sigr, &sigs, &pub, &msg));
+    CHECK(secp256k1_ecdsa_sig_verify(&both->ecmult_ctx, &sigr, &sigs, &pub, &msg));
+
+    /* cleanup */
+    if (use_prealloc) {
+        secp256k1_context_preallocated_destroy(none);
+        secp256k1_context_preallocated_destroy(sign);
+        secp256k1_context_preallocated_destroy(vrfy);
+        secp256k1_context_preallocated_destroy(both);
+        free(none_prealloc);
+        free(sign_prealloc);
+        free(vrfy_prealloc);
+        free(both_prealloc);
+    } else {
+        secp256k1_context_destroy(none);
+        secp256k1_context_destroy(sign);
+        secp256k1_context_destroy(vrfy);
+        secp256k1_context_destroy(both);
+    }
+    /* Defined as no-op. */
+    secp256k1_context_destroy(NULL);
+    secp256k1_context_preallocated_destroy(NULL);
+
+}
+
+void run_scratch_tests(void) {
+    const size_t adj_alloc = ((500 + ALIGNMENT - 1) / ALIGNMENT) * ALIGNMENT;
+
+    int32_t ecount = 0;
+    size_t checkpoint;
+    size_t checkpoint_2;
+    secp256k1_context *none = secp256k1_context_create(SECP256K1_CONTEXT_NONE);
+    secp256k1_scratch_space *scratch;
+    secp256k1_scratch_space local_scratch;
+
+    /* Test public API */
+    secp256k1_context_set_illegal_callback(none, counting_illegal_callback_fn, &ecount);
+    secp256k1_context_set_error_callback(none, counting_illegal_callback_fn, &ecount);
+
+    scratch = secp256k1_scratch_space_create(none, 1000);
+    CHECK(scratch != NULL);
+    CHECK(ecount == 0);
+
+    /* Test internal API */
+    CHECK(secp256k1_scratch_max_allocation(&none->error_callback, scratch, 0) == 1000);
+    CHECK(secp256k1_scratch_max_allocation(&none->error_callback, scratch, 1) == 1000 - (ALIGNMENT - 1));
+    CHECK(scratch->alloc_size == 0);
+    CHECK(scratch->alloc_size % ALIGNMENT == 0);
+
+    /* Allocating 500 bytes succeeds */
+    checkpoint = secp256k1_scratch_checkpoint(&none->error_callback, scratch);
+    CHECK(secp256k1_scratch_alloc(&none->error_callback, scratch, 500) != NULL);
+    CHECK(secp256k1_scratch_max_allocation(&none->error_callback, scratch, 0) == 1000 - adj_alloc);
+    CHECK(secp256k1_scratch_max_allocation(&none->error_callback, scratch, 1) == 1000 - adj_alloc - (ALIGNMENT - 1));
+    CHECK(scratch->alloc_size != 0);
+    CHECK(scratch->alloc_size % ALIGNMENT == 0);
+
+    /* Allocating another 501 bytes fails */
+    CHECK(secp256k1_scratch_alloc(&none->error_callback, scratch, 501) == NULL);
+    CHECK(secp256k1_scratch_max_allocation(&none->error_callback, scratch, 0) == 1000 - adj_alloc);
+    CHECK(secp256k1_scratch_max_allocation(&none->error_callback, scratch, 1) == 1000 - adj_alloc - (ALIGNMENT - 1));
+    CHECK(scratch->alloc_size != 0);
+    CHECK(scratch->alloc_size % ALIGNMENT == 0);
+
+    /* ...but it succeeds once we apply the checkpoint to undo it */
+    secp256k1_scratch_apply_checkpoint(&none->error_callback, scratch, checkpoint);
+    CHECK(scratch->alloc_size == 0);
+    CHECK(secp256k1_scratch_max_allocation(&none->error_callback, scratch, 0) == 1000);
+    CHECK(secp256k1_scratch_alloc(&none->error_callback, scratch, 500) != NULL);
+    CHECK(scratch->alloc_size != 0);
+
+    /* try to apply a bad checkpoint */
+    checkpoint_2 = secp256k1_scratch_checkpoint(&none->error_callback, scratch);
+    secp256k1_scratch_apply_checkpoint(&none->error_callback, scratch, checkpoint);
+    CHECK(ecount == 0);
+    secp256k1_scratch_apply_checkpoint(&none->error_callback, scratch, checkpoint_2); /* checkpoint_2 is after checkpoint */
+    CHECK(ecount == 1);
+    secp256k1_scratch_apply_checkpoint(&none->error_callback, scratch, (size_t) -1); /* this is just wildly invalid */
+    CHECK(ecount == 2);
+
+    /* try to use badly initialized scratch space */
+    secp256k1_scratch_space_destroy(none, scratch);
+    memset(&local_scratch, 0, sizeof(local_scratch));
+    scratch = &local_scratch;
+    CHECK(!secp256k1_scratch_max_allocation(&none->error_callback, scratch, 0));
+    CHECK(ecount == 3);
+    CHECK(secp256k1_scratch_alloc(&none->error_callback, scratch, 500) == NULL);
+    CHECK(ecount == 4);
+    secp256k1_scratch_space_destroy(none, scratch);
+    CHECK(ecount == 5);
+
+    /* Test that large integers do not wrap around in a bad way */
+    scratch = secp256k1_scratch_space_create(none, 1000);
+    /* Try max allocation with a large number of objects. Only makes sense if
+     * ALIGNMENT is greater than 1 because otherwise the objects take no extra
+     * space. */
+    CHECK(ALIGNMENT <= 1 || !secp256k1_scratch_max_allocation(&none->error_callback, scratch, (SIZE_MAX / (ALIGNMENT - 1)) + 1));
+    /* Try allocating SIZE_MAX to test wrap around which only happens if
+     * ALIGNMENT > 1, otherwise it returns NULL anyway because the scratch
+     * space is too small. */
+    CHECK(secp256k1_scratch_alloc(&none->error_callback, scratch, SIZE_MAX) == NULL);
+    secp256k1_scratch_space_destroy(none, scratch);
+
+    /* cleanup */
+    secp256k1_scratch_space_destroy(none, NULL); /* no-op */
+    secp256k1_context_destroy(none);
+}
+
+/***** HASH TESTS *****/
+
+void run_sha256_tests(void) {
+    static const char *inputs[8] = {
+        "", "abc", "message digest", "secure hash algorithm", "SHA256 is considered to be safe",
+        "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq",
+        "For this sample, this 63-byte string will be used as input data",
+        "This is exactly 64 bytes long, not counting the terminating byte"
+    };
+    static const unsigned char outputs[8][32] = {
+        {0xe3, 0xb0, 0xc4, 0x42, 0x98, 0xfc, 0x1c, 0x14, 0x9a, 0xfb, 0xf4, 0xc8, 0x99, 0x6f, 0xb9, 0x24, 0x27, 0xae, 0x41, 0xe4, 0x64, 0x9b, 0x93, 0x4c, 0xa4, 0x95, 0x99, 0x1b, 0x78, 0x52, 0xb8, 0x55},
+        {0xba, 0x78, 0x16, 0xbf, 0x8f, 0x01, 0xcf, 0xea, 0x41, 0x41, 0x40, 0xde, 0x5d, 0xae, 0x22, 0x23, 0xb0, 0x03, 0x61, 0xa3, 0x96, 0x17, 0x7a, 0x9c, 0xb4, 0x10, 0xff, 0x61, 0xf2, 0x00, 0x15, 0xad},
+        {0xf7, 0x84, 0x6f, 0x55, 0xcf, 0x23, 0xe1, 0x4e, 0xeb, 0xea, 0xb5, 0xb4, 0xe1, 0x55, 0x0c, 0xad, 0x5b, 0x50, 0x9e, 0x33, 0x48, 0xfb, 0xc4, 0xef, 0xa3, 0xa1, 0x41, 0x3d, 0x39, 0x3c, 0xb6, 0x50},
+        {0xf3, 0x0c, 0xeb, 0x2b, 0xb2, 0x82, 0x9e, 0x79, 0xe4, 0xca, 0x97, 0x53, 0xd3, 0x5a, 0x8e, 0xcc, 0x00, 0x26, 0x2d, 0x16, 0x4c, 0xc0, 0x77, 0x08, 0x02, 0x95, 0x38, 0x1c, 0xbd, 0x64, 0x3f, 0x0d},
+        {0x68, 0x19, 0xd9, 0x15, 0xc7, 0x3f, 0x4d, 0x1e, 0x77, 0xe4, 0xe1, 0xb5, 0x2d, 0x1f, 0xa0, 0xf9, 0xcf, 0x9b, 0xea, 0xea, 0xd3, 0x93, 0x9f, 0x15, 0x87, 0x4b, 0xd9, 0x88, 0xe2, 0xa2, 0x36, 0x30},
+        {0x24, 0x8d, 0x6a, 0x61, 0xd2, 0x06, 0x38, 0xb8, 0xe5, 0xc0, 0x26, 0x93, 0x0c, 0x3e, 0x60, 0x39, 0xa3, 0x3c, 0xe4, 0x59, 0x64, 0xff, 0x21, 0x67, 0xf6, 0xec, 0xed, 0xd4, 0x19, 0xdb, 0x06, 0xc1},
+        {0xf0, 0x8a, 0x78, 0xcb, 0xba, 0xee, 0x08, 0x2b, 0x05, 0x2a, 0xe0, 0x70, 0x8f, 0x32, 0xfa, 0x1e, 0x50, 0xc5, 0xc4, 0x21, 0xaa, 0x77, 0x2b, 0xa5, 0xdb, 0xb4, 0x06, 0xa2, 0xea, 0x6b, 0xe3, 0x42},
+        {0xab, 0x64, 0xef, 0xf7, 0xe8, 0x8e, 0x2e, 0x46, 0x16, 0x5e, 0x29, 0xf2, 0xbc, 0xe4, 0x18, 0x26, 0xbd, 0x4c, 0x7b, 0x35, 0x52, 0xf6, 0xb3, 0x82, 0xa9, 0xe7, 0xd3, 0xaf, 0x47, 0xc2, 0x45, 0xf8}
+    };
+    int i;
+    for (i = 0; i < 8; i++) {
+        unsigned char out[32];
+        secp256k1_sha256 hasher;
+        secp256k1_sha256_initialize(&hasher);
+        secp256k1_sha256_write(&hasher, (const unsigned char*)(inputs[i]), strlen(inputs[i]));
+        secp256k1_sha256_finalize(&hasher, out);
+        CHECK(secp256k1_memcmp_var(out, outputs[i], 32) == 0);
+        if (strlen(inputs[i]) > 0) {
+            int split = secp256k1_testrand_int(strlen(inputs[i]));
+            secp256k1_sha256_initialize(&hasher);
+            secp256k1_sha256_write(&hasher, (const unsigned char*)(inputs[i]), split);
+            secp256k1_sha256_write(&hasher, (const unsigned char*)(inputs[i] + split), strlen(inputs[i]) - split);
+            secp256k1_sha256_finalize(&hasher, out);
+            CHECK(secp256k1_memcmp_var(out, outputs[i], 32) == 0);
+        }
+    }
+}
+
+void run_hmac_sha256_tests(void) {
+    static const char *keys[6] = {
+        "\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b\x0b",
+        "\x4a\x65\x66\x65",
+        "\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa",
+        "\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0a\x0b\x0c\x0d\x0e\x0f\x10\x11\x12\x13\x14\x15\x16\x17\x18\x19",
+        "\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa",
+        "\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa\xaa"
+    };
+    static const char *inputs[6] = {
+        "\x48\x69\x20\x54\x68\x65\x72\x65",
+        "\x77\x68\x61\x74\x20\x64\x6f\x20\x79\x61\x20\x77\x61\x6e\x74\x20\x66\x6f\x72\x20\x6e\x6f\x74\x68\x69\x6e\x67\x3f",
+        "\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd\xdd",
+        "\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd\xcd",
+        "\x54\x65\x73\x74\x20\x55\x73\x69\x6e\x67\x20\x4c\x61\x72\x67\x65\x72\x20\x54\x68\x61\x6e\x20\x42\x6c\x6f\x63\x6b\x2d\x53\x69\x7a\x65\x20\x4b\x65\x79\x20\x2d\x20\x48\x61\x73\x68\x20\x4b\x65\x79\x20\x46\x69\x72\x73\x74",
+        "\x54\x68\x69\x73\x20\x69\x73\x20\x61\x20\x74\x65\x73\x74\x20\x75\x73\x69\x6e\x67\x20\x61\x20\x6c\x61\x72\x67\x65\x72\x20\x74\x68\x61\x6e\x20\x62\x6c\x6f\x63\x6b\x2d\x73\x69\x7a\x65\x20\x6b\x65\x79\x20\x61\x6e\x64\x20\x61\x20\x6c\x61\x72\x67\x65\x72\x20\x74\x68\x61\x6e\x20\x62\x6c\x6f\x63\x6b\x2d\x73\x69\x7a\x65\x20\x64\x61\x74\x61\x2e\x20\x54\x68\x65\x20\x6b\x65\x79\x20\x6e\x65\x65\x64\x73\x20\x74\x6f\x20\x62\x65\x20\x68\x61\x73\x68\x65\x64\x20\x62\x65\x66\x6f\x72\x65\x20\x62\x65\x69\x6e\x67\x20\x75\x73\x65\x64\x20\x62\x79\x20\x74\x68\x65\x20\x48\x4d\x41\x43\x20\x61\x6c\x67\x6f\x72\x69\x74\x68\x6d\x2e"
+    };
+    static const unsigned char outputs[6][32] = {
+        {0xb0, 0x34, 0x4c, 0x61, 0xd8, 0xdb, 0x38, 0x53, 0x5c, 0xa8, 0xaf, 0xce, 0xaf, 0x0b, 0xf1, 0x2b, 0x88, 0x1d, 0xc2, 0x00, 0xc9, 0x83, 0x3d, 0xa7, 0x26, 0xe9, 0x37, 0x6c, 0x2e, 0x32, 0xcf, 0xf7},
+        {0x5b, 0xdc, 0xc1, 0x46, 0xbf, 0x60, 0x75, 0x4e, 0x6a, 0x04, 0x24, 0x26, 0x08, 0x95, 0x75, 0xc7, 0x5a, 0x00, 0x3f, 0x08, 0x9d, 0x27, 0x39, 0x83, 0x9d, 0xec, 0x58, 0xb9, 0x64, 0xec, 0x38, 0x43},
+        {0x77, 0x3e, 0xa9, 0x1e, 0x36, 0x80, 0x0e, 0x46, 0x85, 0x4d, 0xb8, 0xeb, 0xd0, 0x91, 0x81, 0xa7, 0x29, 0x59, 0x09, 0x8b, 0x3e, 0xf8, 0xc1, 0x22, 0xd9, 0x63, 0x55, 0x14, 0xce, 0xd5, 0x65, 0xfe},
+        {0x82, 0x55, 0x8a, 0x38, 0x9a, 0x44, 0x3c, 0x0e, 0xa4, 0xcc, 0x81, 0x98, 0x99, 0xf2, 0x08, 0x3a, 0x85, 0xf0, 0xfa, 0xa3, 0xe5, 0x78, 0xf8, 0x07, 0x7a, 0x2e, 0x3f, 0xf4, 0x67, 0x29, 0x66, 0x5b},
+        {0x60, 0xe4, 0x31, 0x59, 0x1e, 0xe0, 0xb6, 0x7f, 0x0d, 0x8a, 0x26, 0xaa, 0xcb, 0xf5, 0xb7, 0x7f, 0x8e, 0x0b, 0xc6, 0x21, 0x37, 0x28, 0xc5, 0x14, 0x05, 0x46, 0x04, 0x0f, 0x0e, 0xe3, 0x7f, 0x54},
+        {0x9b, 0x09, 0xff, 0xa7, 0x1b, 0x94, 0x2f, 0xcb, 0x27, 0x63, 0x5f, 0xbc, 0xd5, 0xb0, 0xe9, 0x44, 0xbf, 0xdc, 0x63, 0x64, 0x4f, 0x07, 0x13, 0x93, 0x8a, 0x7f, 0x51, 0x53, 0x5c, 0x3a, 0x35, 0xe2}
+    };
+    int i;
+    for (i = 0; i < 6; i++) {
+        secp256k1_hmac_sha256 hasher;
+        unsigned char out[32];
+        secp256k1_hmac_sha256_initialize(&hasher, (const unsigned char*)(keys[i]), strlen(keys[i]));
+        secp256k1_hmac_sha256_write(&hasher, (const unsigned char*)(inputs[i]), strlen(inputs[i]));
+        secp256k1_hmac_sha256_finalize(&hasher, out);
+        CHECK(secp256k1_memcmp_var(out, outputs[i], 32) == 0);
+        if (strlen(inputs[i]) > 0) {
+            int split = secp256k1_testrand_int(strlen(inputs[i]));
+            secp256k1_hmac_sha256_initialize(&hasher, (const unsigned char*)(keys[i]), strlen(keys[i]));
+            secp256k1_hmac_sha256_write(&hasher, (const unsigned char*)(inputs[i]), split);
+            secp256k1_hmac_sha256_write(&hasher, (const unsigned char*)(inputs[i] + split), strlen(inputs[i]) - split);
+            secp256k1_hmac_sha256_finalize(&hasher, out);
+            CHECK(secp256k1_memcmp_var(out, outputs[i], 32) == 0);
+        }
+    }
+}
+
+void run_rfc6979_hmac_sha256_tests(void) {
+    static const unsigned char key1[65] = {0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f, 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17, 0x18, 0x19, 0x1a, 0x1b, 0x1c, 0x1d, 0x1e, 0x1f, 0x00, 0x4b, 0xf5, 0x12, 0x2f, 0x34, 0x45, 0x54, 0xc5, 0x3b, 0xde, 0x2e, 0xbb, 0x8c, 0xd2, 0xb7, 0xe3, 0xd1, 0x60, 0x0a, 0xd6, 0x31, 0xc3, 0x85, 0xa5, 0xd7, 0xcc, 0xe2, 0x3c, 0x77, 0x85, 0x45, 0x9a, 0};
+    static const unsigned char out1[3][32] = {
+        {0x4f, 0xe2, 0x95, 0x25, 0xb2, 0x08, 0x68, 0x09, 0x15, 0x9a, 0xcd, 0xf0, 0x50, 0x6e, 0xfb, 0x86, 0xb0, 0xec, 0x93, 0x2c, 0x7b, 0xa4, 0x42, 0x56, 0xab, 0x32, 0x1e, 0x42, 0x1e, 0x67, 0xe9, 0xfb},
+        {0x2b, 0xf0, 0xff, 0xf1, 0xd3, 0xc3, 0x78, 0xa2, 0x2d, 0xc5, 0xde, 0x1d, 0x85, 0x65, 0x22, 0x32, 0x5c, 0x65, 0xb5, 0x04, 0x49, 0x1a, 0x0c, 0xbd, 0x01, 0xcb, 0x8f, 0x3a, 0xa6, 0x7f, 0xfd, 0x4a},
+        {0xf5, 0x28, 0xb4, 0x10, 0xcb, 0x54, 0x1f, 0x77, 0x00, 0x0d, 0x7a, 0xfb, 0x6c, 0x5b, 0x53, 0xc5, 0xc4, 0x71, 0xea, 0xb4, 0x3e, 0x46, 0x6d, 0x9a, 0xc5, 0x19, 0x0c, 0x39, 0xc8, 0x2f, 0xd8, 0x2e}
+    };
+
+    static const unsigned char key2[64] = {0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xe3, 0xb0, 0xc4, 0x42, 0x98, 0xfc, 0x1c, 0x14, 0x9a, 0xfb, 0xf4, 0xc8, 0x99, 0x6f, 0xb9, 0x24, 0x27, 0xae, 0x41, 0xe4, 0x64, 0x9b, 0x93, 0x4c, 0xa4, 0x95, 0x99, 0x1b, 0x78, 0x52, 0xb8, 0x55};
+    static const unsigned char out2[3][32] = {
+        {0x9c, 0x23, 0x6c, 0x16, 0x5b, 0x82, 0xae, 0x0c, 0xd5, 0x90, 0x65, 0x9e, 0x10, 0x0b, 0x6b, 0xab, 0x30, 0x36, 0xe7, 0xba, 0x8b, 0x06, 0x74, 0x9b, 0xaf, 0x69, 0x81, 0xe1, 0x6f, 0x1a, 0x2b, 0x95},
+        {0xdf, 0x47, 0x10, 0x61, 0x62, 0x5b, 0xc0, 0xea, 0x14, 0xb6, 0x82, 0xfe, 0xee, 0x2c, 0x9c, 0x02, 0xf2, 0x35, 0xda, 0x04, 0x20, 0x4c, 0x1d, 0x62, 0xa1, 0x53, 0x6c, 0x6e, 0x17, 0xae, 0xd7, 0xa9},
+        {0x75, 0x97, 0x88, 0x7c, 0xbd, 0x76, 0x32, 0x1f, 0x32, 0xe3, 0x04, 0x40, 0x67, 0x9a, 0x22, 0xcf, 0x7f, 0x8d, 0x9d, 0x2e, 0xac, 0x39, 0x0e, 0x58, 0x1f, 0xea, 0x09, 0x1c, 0xe2, 0x02, 0xba, 0x94}
+    };
+
+    secp256k1_rfc6979_hmac_sha256 rng;
+    unsigned char out[32];
+    int i;
+
+    secp256k1_rfc6979_hmac_sha256_initialize(&rng, key1, 64);
+    for (i = 0; i < 3; i++) {
+        secp256k1_rfc6979_hmac_sha256_generate(&rng, out, 32);
+        CHECK(secp256k1_memcmp_var(out, out1[i], 32) == 0);
+    }
+    secp256k1_rfc6979_hmac_sha256_finalize(&rng);
+
+    secp256k1_rfc6979_hmac_sha256_initialize(&rng, key1, 65);
+    for (i = 0; i < 3; i++) {
+        secp256k1_rfc6979_hmac_sha256_generate(&rng, out, 32);
+        CHECK(secp256k1_memcmp_var(out, out1[i], 32) != 0);
+    }
+    secp256k1_rfc6979_hmac_sha256_finalize(&rng);
+
+    secp256k1_rfc6979_hmac_sha256_initialize(&rng, key2, 64);
+    for (i = 0; i < 3; i++) {
+        secp256k1_rfc6979_hmac_sha256_generate(&rng, out, 32);
+        CHECK(secp256k1_memcmp_var(out, out2[i], 32) == 0);
+    }
+    secp256k1_rfc6979_hmac_sha256_finalize(&rng);
+}
+
+/***** RANDOM TESTS *****/
+
+void test_rand_bits(int rand32, int bits) {
+    /* (1-1/2^B)^rounds[B] < 1/10^9, so rounds is the number of iterations to
+     * get a false negative chance below once in a billion */
+    static const unsigned int rounds[7] = {1, 30, 73, 156, 322, 653, 1316};
+    /* We try multiplying the results with various odd numbers, which shouldn't
+     * influence the uniform distribution modulo a power of 2. */
+    static const uint32_t mults[6] = {1, 3, 21, 289, 0x9999, 0x80402011};
+    /* We only select up to 6 bits from the output to analyse */
+    unsigned int usebits = bits > 6 ? 6 : bits;
+    unsigned int maxshift = bits - usebits;
+    /* For each of the maxshift+1 usebits-bit sequences inside a bits-bit
+       number, track all observed outcomes, one per bit in a uint64_t. */
+    uint64_t x[6][27] = {{0}};
+    unsigned int i, shift, m;
+    /* Multiply the output of all rand calls with the odd number m, which
+       should not change the uniformity of its distribution. */
+    for (i = 0; i < rounds[usebits]; i++) {
+        uint32_t r = (rand32 ? secp256k1_testrand32() : secp256k1_testrand_bits(bits));
+        CHECK((((uint64_t)r) >> bits) == 0);
+        for (m = 0; m < sizeof(mults) / sizeof(mults[0]); m++) {
+            uint32_t rm = r * mults[m];
+            for (shift = 0; shift <= maxshift; shift++) {
+                x[m][shift] |= (((uint64_t)1) << ((rm >> shift) & ((1 << usebits) - 1)));
+            }
+        }
+    }
+    for (m = 0; m < sizeof(mults) / sizeof(mults[0]); m++) {
+        for (shift = 0; shift <= maxshift; shift++) {
+            /* Test that the lower usebits bits of x[shift] are 1 */
+            CHECK(((~x[m][shift]) << (64 - (1 << usebits))) == 0);
+        }
+    }
+}
+
+/* Subrange must be a whole divisor of range, and at most 64 */
+void test_rand_int(uint32_t range, uint32_t subrange) {
+    /* (1-1/subrange)^rounds < 1/10^9 */
+    int rounds = (subrange * 2073) / 100;
+    int i;
+    uint64_t x = 0;
+    CHECK((range % subrange) == 0);
+    for (i = 0; i < rounds; i++) {
+        uint32_t r = secp256k1_testrand_int(range);
+        CHECK(r < range);
+        r = r % subrange;
+        x |= (((uint64_t)1) << r);
+    }
+    /* Test that the lower subrange bits of x are 1. */
+    CHECK(((~x) << (64 - subrange)) == 0);
+}
+
+void run_rand_bits(void) {
+    size_t b;
+    test_rand_bits(1, 32);
+    for (b = 1; b <= 32; b++) {
+        test_rand_bits(0, b);
+    }
+}
+
+void run_rand_int(void) {
+    static const uint32_t ms[] = {1, 3, 17, 1000, 13771, 999999, 33554432};
+    static const uint32_t ss[] = {1, 3, 6, 9, 13, 31, 64};
+    unsigned int m, s;
+    for (m = 0; m < sizeof(ms) / sizeof(ms[0]); m++) {
+        for (s = 0; s < sizeof(ss) / sizeof(ss[0]); s++) {
+            test_rand_int(ms[m] * ss[s], ss[s]);
+        }
+    }
+}
+
+/***** NUM TESTS *****/
+
+#ifndef USE_NUM_NONE
+void random_num_negate(secp256k1_num *num) {
+    if (secp256k1_testrand_bits(1)) {
+        secp256k1_num_negate(num);
+    }
+}
+
+void random_num_order_test(secp256k1_num *num) {
+    secp256k1_scalar sc;
+    random_scalar_order_test(&sc);
+    secp256k1_scalar_get_num(num, &sc);
+}
+
+void random_num_order(secp256k1_num *num) {
+    secp256k1_scalar sc;
+    random_scalar_order(&sc);
+    secp256k1_scalar_get_num(num, &sc);
+}
+
+void test_num_negate(void) {
+    secp256k1_num n1;
+    secp256k1_num n2;
+    random_num_order_test(&n1); /* n1 = R */
+    random_num_negate(&n1);
+    secp256k1_num_copy(&n2, &n1); /* n2 = R */
+    secp256k1_num_sub(&n1, &n2, &n1); /* n1 = n2-n1 = 0 */
+    CHECK(secp256k1_num_is_zero(&n1));
+    secp256k1_num_copy(&n1, &n2); /* n1 = R */
+    secp256k1_num_negate(&n1); /* n1 = -R */
+    CHECK(!secp256k1_num_is_zero(&n1));
+    secp256k1_num_add(&n1, &n2, &n1); /* n1 = n2+n1 = 0 */
+    CHECK(secp256k1_num_is_zero(&n1));
+    secp256k1_num_copy(&n1, &n2); /* n1 = R */
+    secp256k1_num_negate(&n1); /* n1 = -R */
+    CHECK(secp256k1_num_is_neg(&n1) != secp256k1_num_is_neg(&n2));
+    secp256k1_num_negate(&n1); /* n1 = R */
+    CHECK(secp256k1_num_eq(&n1, &n2));
+}
+
+void test_num_add_sub(void) {
+    int i;
+    secp256k1_scalar s;
+    secp256k1_num n1;
+    secp256k1_num n2;
+    secp256k1_num n1p2, n2p1, n1m2, n2m1;
+    random_num_order_test(&n1); /* n1 = R1 */
+    if (secp256k1_testrand_bits(1)) {
+        random_num_negate(&n1);
+    }
+    random_num_order_test(&n2); /* n2 = R2 */
+    if (secp256k1_testrand_bits(1)) {
+        random_num_negate(&n2);
+    }
+    secp256k1_num_add(&n1p2, &n1, &n2); /* n1p2 = R1 + R2 */
+    secp256k1_num_add(&n2p1, &n2, &n1); /* n2p1 = R2 + R1 */
+    secp256k1_num_sub(&n1m2, &n1, &n2); /* n1m2 = R1 - R2 */
+    secp256k1_num_sub(&n2m1, &n2, &n1); /* n2m1 = R2 - R1 */
+    CHECK(secp256k1_num_eq(&n1p2, &n2p1));
+    CHECK(!secp256k1_num_eq(&n1p2, &n1m2));
+    secp256k1_num_negate(&n2m1); /* n2m1 = -R2 + R1 */
+    CHECK(secp256k1_num_eq(&n2m1, &n1m2));
+    CHECK(!secp256k1_num_eq(&n2m1, &n1));
+    secp256k1_num_add(&n2m1, &n2m1, &n2); /* n2m1 = -R2 + R1 + R2 = R1 */
+    CHECK(secp256k1_num_eq(&n2m1, &n1));
+    CHECK(!secp256k1_num_eq(&n2p1, &n1));
+    secp256k1_num_sub(&n2p1, &n2p1, &n2); /* n2p1 = R2 + R1 - R2 = R1 */
+    CHECK(secp256k1_num_eq(&n2p1, &n1));
+
+    /* check is_one */
+    secp256k1_scalar_set_int(&s, 1);
+    secp256k1_scalar_get_num(&n1, &s);
+    CHECK(secp256k1_num_is_one(&n1));
+    /* check that 2^n + 1 is never 1 */
+    secp256k1_scalar_get_num(&n2, &s);
+    for (i = 0; i < 250; ++i) {
+        secp256k1_num_add(&n1, &n1, &n1);    /* n1 *= 2 */
+        secp256k1_num_add(&n1p2, &n1, &n2);  /* n1p2 = n1 + 1 */
+        CHECK(!secp256k1_num_is_one(&n1p2));
+    }
+}
+
+void test_num_mod(void) {
+    int i;
+    secp256k1_scalar s;
+    secp256k1_num order, n;
+
+    /* check that 0 mod anything is 0 */
+    random_scalar_order_test(&s);
+    secp256k1_scalar_get_num(&order, &s);
+    secp256k1_scalar_set_int(&s, 0);
+    secp256k1_scalar_get_num(&n, &s);
+    secp256k1_num_mod(&n, &order);
+    CHECK(secp256k1_num_is_zero(&n));
+
+    /* check that anything mod 1 is 0 */
+    secp256k1_scalar_set_int(&s, 1);
+    secp256k1_scalar_get_num(&order, &s);
+    secp256k1_scalar_get_num(&n, &s);
+    secp256k1_num_mod(&n, &order);
+    CHECK(secp256k1_num_is_zero(&n));
+
+    /* check that increasing the number past 2^256 does not break this */
+    random_scalar_order_test(&s);
+    secp256k1_scalar_get_num(&n, &s);
+    /* multiply by 2^8, which'll test this case with high probability */
+    for (i = 0; i < 8; ++i) {
+        secp256k1_num_add(&n, &n, &n);
+    }
+    secp256k1_num_mod(&n, &order);
+    CHECK(secp256k1_num_is_zero(&n));
+}
+
+void test_num_jacobi(void) {
+    secp256k1_scalar sqr;
+    secp256k1_scalar small;
+    secp256k1_scalar five;  /* five is not a quadratic residue */
+    secp256k1_num order, n;
+    int i;
+    /* squares mod 5 are 1, 4 */
+    const int jacobi5[10] = { 0, 1, -1, -1, 1, 0, 1, -1, -1, 1 };
+
+    /* check some small values with 5 as the order */
+    secp256k1_scalar_set_int(&five, 5);
+    secp256k1_scalar_get_num(&order, &five);
+    for (i = 0; i < 10; ++i) {
+        secp256k1_scalar_set_int(&small, i);
+        secp256k1_scalar_get_num(&n, &small);
+        CHECK(secp256k1_num_jacobi(&n, &order) == jacobi5[i]);
+    }
+
+    /** test large values with 5 as group order */
+    secp256k1_scalar_get_num(&order, &five);
+    /* we first need a scalar which is not a multiple of 5 */
+    do {
+        secp256k1_num fiven;
+        random_scalar_order_test(&sqr);
+        secp256k1_scalar_get_num(&fiven, &five);
+        secp256k1_scalar_get_num(&n, &sqr);
+        secp256k1_num_mod(&n, &fiven);
+    } while (secp256k1_num_is_zero(&n));
+    /* next force it to be a residue. 2 is a nonresidue mod 5 so we can
+     * just multiply by two, i.e. add the number to itself */
+    if (secp256k1_num_jacobi(&n, &order) == -1) {
+        secp256k1_num_add(&n, &n, &n);
+    }
+
+    /* test residue */
+    CHECK(secp256k1_num_jacobi(&n, &order) == 1);
+    /* test nonresidue */
+    secp256k1_num_add(&n, &n, &n);
+    CHECK(secp256k1_num_jacobi(&n, &order) == -1);
+
+    /** test with secp group order as order */
+    secp256k1_scalar_order_get_num(&order);
+    random_scalar_order_test(&sqr);
+    secp256k1_scalar_sqr(&sqr, &sqr);
+    /* test residue */
+    secp256k1_scalar_get_num(&n, &sqr);
+    CHECK(secp256k1_num_jacobi(&n, &order) == 1);
+    /* test nonresidue */
+    secp256k1_scalar_mul(&sqr, &sqr, &five);
+    secp256k1_scalar_get_num(&n, &sqr);
+    CHECK(secp256k1_num_jacobi(&n, &order) == -1);
+    /* test multiple of the order*/
+    CHECK(secp256k1_num_jacobi(&order, &order) == 0);
+
+    /* check one less than the order */
+    secp256k1_scalar_set_int(&small, 1);
+    secp256k1_scalar_get_num(&n, &small);
+    secp256k1_num_sub(&n, &order, &n);
+    CHECK(secp256k1_num_jacobi(&n, &order) == 1);  /* sage confirms this is 1 */
+}
+
+void run_num_smalltests(void) {
+    int i;
+    for (i = 0; i < 100*count; i++) {
+        test_num_negate();
+        test_num_add_sub();
+        test_num_mod();
+        test_num_jacobi();
+    }
+}
+#endif
+
+/***** SCALAR TESTS *****/
+
+void scalar_test(void) {
+    secp256k1_scalar s;
+    secp256k1_scalar s1;
+    secp256k1_scalar s2;
+#ifndef USE_NUM_NONE
+    secp256k1_num snum, s1num, s2num;
+    secp256k1_num order, half_order;
+#endif
+    unsigned char c[32];
+
+    /* Set 's' to a random scalar, with value 'snum'. */
+    random_scalar_order_test(&s);
+
+    /* Set 's1' to a random scalar, with value 's1num'. */
+    random_scalar_order_test(&s1);
+
+    /* Set 's2' to a random scalar, with value 'snum2', and byte array representation 'c'. */
+    random_scalar_order_test(&s2);
+    secp256k1_scalar_get_b32(c, &s2);
+
+#ifndef USE_NUM_NONE
+    secp256k1_scalar_get_num(&snum, &s);
+    secp256k1_scalar_get_num(&s1num, &s1);
+    secp256k1_scalar_get_num(&s2num, &s2);
+
+    secp256k1_scalar_order_get_num(&order);
+    half_order = order;
+    secp256k1_num_shift(&half_order, 1);
+#endif
+
+    {
+        int i;
+        /* Test that fetching groups of 4 bits from a scalar and recursing n(i)=16*n(i-1)+p(i) reconstructs it. */
+        secp256k1_scalar n;
+        secp256k1_scalar_set_int(&n, 0);
+        for (i = 0; i < 256; i += 4) {
+            secp256k1_scalar t;
+            int j;
+            secp256k1_scalar_set_int(&t, secp256k1_scalar_get_bits(&s, 256 - 4 - i, 4));
+            for (j = 0; j < 4; j++) {
+                secp256k1_scalar_add(&n, &n, &n);
+            }
+            secp256k1_scalar_add(&n, &n, &t);
+        }
+        CHECK(secp256k1_scalar_eq(&n, &s));
+    }
+
+    {
+        /* Test that fetching groups of randomly-sized bits from a scalar and recursing n(i)=b*n(i-1)+p(i) reconstructs it. */
+        secp256k1_scalar n;
+        int i = 0;
+        secp256k1_scalar_set_int(&n, 0);
+        while (i < 256) {
+            secp256k1_scalar t;
+            int j;
+            int now = secp256k1_testrand_int(15) + 1;
+            if (now + i > 256) {
+                now = 256 - i;
+            }
+            secp256k1_scalar_set_int(&t, secp256k1_scalar_get_bits_var(&s, 256 - now - i, now));
+            for (j = 0; j < now; j++) {
+                secp256k1_scalar_add(&n, &n, &n);
+            }
+            secp256k1_scalar_add(&n, &n, &t);
+            i += now;
+        }
+        CHECK(secp256k1_scalar_eq(&n, &s));
+    }
+
+#ifndef USE_NUM_NONE
+    {
+        /* Test that adding the scalars together is equal to adding their numbers together modulo the order. */
+        secp256k1_num rnum;
+        secp256k1_num r2num;
+        secp256k1_scalar r;
+        secp256k1_num_add(&rnum, &snum, &s2num);
+        secp256k1_num_mod(&rnum, &order);
+        secp256k1_scalar_add(&r, &s, &s2);
+        secp256k1_scalar_get_num(&r2num, &r);
+        CHECK(secp256k1_num_eq(&rnum, &r2num));
+    }
+
+    {
+        /* Test that multiplying the scalars is equal to multiplying their numbers modulo the order. */
+        secp256k1_scalar r;
+        secp256k1_num r2num;
+        secp256k1_num rnum;
+        secp256k1_num_mul(&rnum, &snum, &s2num);
+        secp256k1_num_mod(&rnum, &order);
+        secp256k1_scalar_mul(&r, &s, &s2);
+        secp256k1_scalar_get_num(&r2num, &r);
+        CHECK(secp256k1_num_eq(&rnum, &r2num));
+        /* The result can only be zero if at least one of the factors was zero. */
+        CHECK(secp256k1_scalar_is_zero(&r) == (secp256k1_scalar_is_zero(&s) || secp256k1_scalar_is_zero(&s2)));
+        /* The results can only be equal to one of the factors if that factor was zero, or the other factor was one. */
+        CHECK(secp256k1_num_eq(&rnum, &snum) == (secp256k1_scalar_is_zero(&s) || secp256k1_scalar_is_one(&s2)));
+        CHECK(secp256k1_num_eq(&rnum, &s2num) == (secp256k1_scalar_is_zero(&s2) || secp256k1_scalar_is_one(&s)));
+    }
+
+    {
+        secp256k1_scalar neg;
+        secp256k1_num negnum;
+        secp256k1_num negnum2;
+        /* Check that comparison with zero matches comparison with zero on the number. */
+        CHECK(secp256k1_num_is_zero(&snum) == secp256k1_scalar_is_zero(&s));
+        /* Check that comparison with the half order is equal to testing for high scalar. */
+        CHECK(secp256k1_scalar_is_high(&s) == (secp256k1_num_cmp(&snum, &half_order) > 0));
+        secp256k1_scalar_negate(&neg, &s);
+        secp256k1_num_sub(&negnum, &order, &snum);
+        secp256k1_num_mod(&negnum, &order);
+        /* Check that comparison with the half order is equal to testing for high scalar after negation. */
+        CHECK(secp256k1_scalar_is_high(&neg) == (secp256k1_num_cmp(&negnum, &half_order) > 0));
+        /* Negating should change the high property, unless the value was already zero. */
+        CHECK((secp256k1_scalar_is_high(&s) == secp256k1_scalar_is_high(&neg)) == secp256k1_scalar_is_zero(&s));
+        secp256k1_scalar_get_num(&negnum2, &neg);
+        /* Negating a scalar should be equal to (order - n) mod order on the number. */
+        CHECK(secp256k1_num_eq(&negnum, &negnum2));
+        secp256k1_scalar_add(&neg, &neg, &s);
+        /* Adding a number to its negation should result in zero. */
+        CHECK(secp256k1_scalar_is_zero(&neg));
+        secp256k1_scalar_negate(&neg, &neg);
+        /* Negating zero should still result in zero. */
+        CHECK(secp256k1_scalar_is_zero(&neg));
+    }
+
+    {
+        /* Test secp256k1_scalar_mul_shift_var. */
+        secp256k1_scalar r;
+        secp256k1_num one;
+        secp256k1_num rnum;
+        secp256k1_num rnum2;
+        unsigned char cone[1] = {0x01};
+        unsigned int shift = 256 + secp256k1_testrand_int(257);
+        secp256k1_scalar_mul_shift_var(&r, &s1, &s2, shift);
+        secp256k1_num_mul(&rnum, &s1num, &s2num);
+        secp256k1_num_shift(&rnum, shift - 1);
+        secp256k1_num_set_bin(&one, cone, 1);
+        secp256k1_num_add(&rnum, &rnum, &one);
+        secp256k1_num_shift(&rnum, 1);
+        secp256k1_scalar_get_num(&rnum2, &r);
+        CHECK(secp256k1_num_eq(&rnum, &rnum2));
+    }
+
+    {
+        /* test secp256k1_scalar_shr_int */
+        secp256k1_scalar r;
+        int i;
+        random_scalar_order_test(&r);
+        for (i = 0; i < 100; ++i) {
+            int low;
+            int shift = 1 + secp256k1_testrand_int(15);
+            int expected = r.d[0] % (1 << shift);
+            low = secp256k1_scalar_shr_int(&r, shift);
+            CHECK(expected == low);
+        }
+    }
+#endif
+
+    {
+        /* Test that scalar inverses are equal to the inverse of their number modulo the order. */
+        if (!secp256k1_scalar_is_zero(&s)) {
+            secp256k1_scalar inv;
+#ifndef USE_NUM_NONE
+            secp256k1_num invnum;
+            secp256k1_num invnum2;
+#endif
+            secp256k1_scalar_inverse(&inv, &s);
+#ifndef USE_NUM_NONE
+            secp256k1_num_mod_inverse(&invnum, &snum, &order);
+            secp256k1_scalar_get_num(&invnum2, &inv);
+            CHECK(secp256k1_num_eq(&invnum, &invnum2));
+#endif
+            secp256k1_scalar_mul(&inv, &inv, &s);
+            /* Multiplying a scalar with its inverse must result in one. */
+            CHECK(secp256k1_scalar_is_one(&inv));
+            secp256k1_scalar_inverse(&inv, &inv);
+            /* Inverting one must result in one. */
+            CHECK(secp256k1_scalar_is_one(&inv));
+#ifndef USE_NUM_NONE
+            secp256k1_scalar_get_num(&invnum, &inv);
+            CHECK(secp256k1_num_is_one(&invnum));
+#endif
+        }
+    }
+
+    {
+        /* Test commutativity of add. */
+        secp256k1_scalar r1, r2;
+        secp256k1_scalar_add(&r1, &s1, &s2);
+        secp256k1_scalar_add(&r2, &s2, &s1);
+        CHECK(secp256k1_scalar_eq(&r1, &r2));
+    }
+
+    {
+        secp256k1_scalar r1, r2;
+        secp256k1_scalar b;
+        int i;
+        /* Test add_bit. */
+        int bit = secp256k1_testrand_bits(8);
+        secp256k1_scalar_set_int(&b, 1);
+        CHECK(secp256k1_scalar_is_one(&b));
+        for (i = 0; i < bit; i++) {
+            secp256k1_scalar_add(&b, &b, &b);
+        }
+        r1 = s1;
+        r2 = s1;
+        if (!secp256k1_scalar_add(&r1, &r1, &b)) {
+            /* No overflow happened. */
+            secp256k1_scalar_cadd_bit(&r2, bit, 1);
+            CHECK(secp256k1_scalar_eq(&r1, &r2));
+            /* cadd is a noop when flag is zero */
+            secp256k1_scalar_cadd_bit(&r2, bit, 0);
+            CHECK(secp256k1_scalar_eq(&r1, &r2));
+        }
+    }
+
+    {
+        /* Test commutativity of mul. */
+        secp256k1_scalar r1, r2;
+        secp256k1_scalar_mul(&r1, &s1, &s2);
+        secp256k1_scalar_mul(&r2, &s2, &s1);
+        CHECK(secp256k1_scalar_eq(&r1, &r2));
+    }
+
+    {
+        /* Test associativity of add. */
+        secp256k1_scalar r1, r2;
+        secp256k1_scalar_add(&r1, &s1, &s2);
+        secp256k1_scalar_add(&r1, &r1, &s);
+        secp256k1_scalar_add(&r2, &s2, &s);
+        secp256k1_scalar_add(&r2, &s1, &r2);
+        CHECK(secp256k1_scalar_eq(&r1, &r2));
+    }
+
+    {
+        /* Test associativity of mul. */
+        secp256k1_scalar r1, r2;
+        secp256k1_scalar_mul(&r1, &s1, &s2);
+        secp256k1_scalar_mul(&r1, &r1, &s);
+        secp256k1_scalar_mul(&r2, &s2, &s);
+        secp256k1_scalar_mul(&r2, &s1, &r2);
+        CHECK(secp256k1_scalar_eq(&r1, &r2));
+    }
+
+    {
+        /* Test distributitivity of mul over add. */
+        secp256k1_scalar r1, r2, t;
+        secp256k1_scalar_add(&r1, &s1, &s2);
+        secp256k1_scalar_mul(&r1, &r1, &s);
+        secp256k1_scalar_mul(&r2, &s1, &s);
+        secp256k1_scalar_mul(&t, &s2, &s);
+        secp256k1_scalar_add(&r2, &r2, &t);
+        CHECK(secp256k1_scalar_eq(&r1, &r2));
+    }
+
+    {
+        /* Test square. */
+        secp256k1_scalar r1, r2;
+        secp256k1_scalar_sqr(&r1, &s1);
+        secp256k1_scalar_mul(&r2, &s1, &s1);
+        CHECK(secp256k1_scalar_eq(&r1, &r2));
+    }
+
+    {
+        /* Test multiplicative identity. */
+        secp256k1_scalar r1, v1;
+        secp256k1_scalar_set_int(&v1,1);
+        secp256k1_scalar_mul(&r1, &s1, &v1);
+        CHECK(secp256k1_scalar_eq(&r1, &s1));
+    }
+
+    {
+        /* Test additive identity. */
+        secp256k1_scalar r1, v0;
+        secp256k1_scalar_set_int(&v0,0);
+        secp256k1_scalar_add(&r1, &s1, &v0);
+        CHECK(secp256k1_scalar_eq(&r1, &s1));
+    }
+
+    {
+        /* Test zero product property. */
+        secp256k1_scalar r1, v0;
+        secp256k1_scalar_set_int(&v0,0);
+        secp256k1_scalar_mul(&r1, &s1, &v0);
+        CHECK(secp256k1_scalar_eq(&r1, &v0));
+    }
+
+}
+
+void run_scalar_set_b32_seckey_tests(void) {
+    unsigned char b32[32];
+    secp256k1_scalar s1;
+    secp256k1_scalar s2;
+
+    /* Usually set_b32 and set_b32_seckey give the same result */
+    random_scalar_order_b32(b32);
+    secp256k1_scalar_set_b32(&s1, b32, NULL);
+    CHECK(secp256k1_scalar_set_b32_seckey(&s2, b32) == 1);
+    CHECK(secp256k1_scalar_eq(&s1, &s2) == 1);
+
+    memset(b32, 0, sizeof(b32));
+    CHECK(secp256k1_scalar_set_b32_seckey(&s2, b32) == 0);
+    memset(b32, 0xFF, sizeof(b32));
+    CHECK(secp256k1_scalar_set_b32_seckey(&s2, b32) == 0);
+}
+
+void run_scalar_tests(void) {
+    int i;
+    for (i = 0; i < 128 * count; i++) {
+        scalar_test();
+    }
+    for (i = 0; i < count; i++) {
+        run_scalar_set_b32_seckey_tests();
+    }
+
+    {
+        /* (-1)+1 should be zero. */
+        secp256k1_scalar s, o;
+        secp256k1_scalar_set_int(&s, 1);
+        CHECK(secp256k1_scalar_is_one(&s));
+        secp256k1_scalar_negate(&o, &s);
+        secp256k1_scalar_add(&o, &o, &s);
+        CHECK(secp256k1_scalar_is_zero(&o));
+        secp256k1_scalar_negate(&o, &o);
+        CHECK(secp256k1_scalar_is_zero(&o));
+    }
+
+#ifndef USE_NUM_NONE
+    {
+        /* Test secp256k1_scalar_set_b32 boundary conditions */
+        secp256k1_num order;
+        secp256k1_scalar scalar;
+        unsigned char bin[32];
+        unsigned char bin_tmp[32];
+        int overflow = 0;
+        /* 2^256-1 - order */
+        static const secp256k1_scalar all_ones_minus_order = SECP256K1_SCALAR_CONST(
+            0x00000000UL, 0x00000000UL, 0x00000000UL, 0x00000001UL,
+            0x45512319UL, 0x50B75FC4UL, 0x402DA173UL, 0x2FC9BEBEUL
+        );
+
+        /* A scalar set to 0s should be 0. */
+        memset(bin, 0, 32);
+        secp256k1_scalar_set_b32(&scalar, bin, &overflow);
+        CHECK(overflow == 0);
+        CHECK(secp256k1_scalar_is_zero(&scalar));
+
+        /* A scalar with value of the curve order should be 0. */
+        secp256k1_scalar_order_get_num(&order);
+        secp256k1_num_get_bin(bin, 32, &order);
+        secp256k1_scalar_set_b32(&scalar, bin, &overflow);
+        CHECK(overflow == 1);
+        CHECK(secp256k1_scalar_is_zero(&scalar));
+
+        /* A scalar with value of the curve order minus one should not overflow. */
+        bin[31] -= 1;
+        secp256k1_scalar_set_b32(&scalar, bin, &overflow);
+        CHECK(overflow == 0);
+        secp256k1_scalar_get_b32(bin_tmp, &scalar);
+        CHECK(secp256k1_memcmp_var(bin, bin_tmp, 32) == 0);
+
+        /* A scalar set to all 1s should overflow. */
+        memset(bin, 0xFF, 32);
+        secp256k1_scalar_set_b32(&scalar, bin, &overflow);
+        CHECK(overflow == 1);
+        CHECK(secp256k1_scalar_eq(&scalar, &all_ones_minus_order));
+    }
+#endif
+
+    {
+        /* Does check_overflow check catch all ones? */
+        static const secp256k1_scalar overflowed = SECP256K1_SCALAR_CONST(
+            0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL,
+            0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL
+        );
+        CHECK(secp256k1_scalar_check_overflow(&overflowed));
+    }
+
+    {
+        /* Static test vectors.
+         * These were reduced from ~10^12 random vectors based on comparison-decision
+         *  and edge-case coverage on 32-bit and 64-bit implementations.
+         * The responses were generated with Sage 5.9.
+         */
+        secp256k1_scalar x;
+        secp256k1_scalar y;
+        secp256k1_scalar z;
+        secp256k1_scalar zz;
+        secp256k1_scalar one;
+        secp256k1_scalar r1;
+        secp256k1_scalar r2;
+#if defined(USE_SCALAR_INV_NUM)
+        secp256k1_scalar zzv;
+#endif
+        int overflow;
+        unsigned char chal[33][2][32] = {
+            {{0xff, 0xff, 0x03, 0x07, 0x00, 0x00, 0x00, 0x00,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x03,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0xf8, 0xff, 0xff,
+              0xff, 0xff, 0x03, 0x00, 0xc0, 0xff, 0xff, 0xff},
+             {0xff, 0xff, 0xff, 0xff, 0xff, 0x0f, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xf8,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0x03, 0x00, 0x00, 0x00, 0x00, 0xe0, 0xff}},
+            {{0xef, 0xff, 0x1f, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0xfe, 0xff, 0xff, 0xff, 0xff, 0xff, 0x3f, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00},
+             {0xff, 0xff, 0xff, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xe0,
+              0xff, 0xff, 0xff, 0xff, 0xfc, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0x7f, 0x00, 0x80, 0xff}},
+            {{0xff, 0xff, 0xff, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x06, 0x00, 0x00,
+              0x80, 0x00, 0x00, 0x80, 0xff, 0x3f, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0xf8, 0xff, 0xff, 0xff, 0x00},
+             {0x00, 0x00, 0xfc, 0xff, 0xff, 0xff, 0xff, 0x80,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0x0f, 0x00, 0xe0,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0x7f, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x7f, 0xff, 0xff, 0xff}},
+            {{0xff, 0xff, 0xff, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x80, 0x00, 0x00, 0x80,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x00,
+              0x00, 0x1e, 0xf8, 0xff, 0xff, 0xff, 0xfd, 0xff},
+             {0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x1f,
+              0x00, 0x00, 0x00, 0xf8, 0xff, 0x03, 0x00, 0xe0,
+              0xff, 0x0f, 0x00, 0x00, 0x00, 0x00, 0xf0, 0xff,
+              0xf3, 0xff, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00}},
+            {{0x80, 0x00, 0x00, 0x80, 0xff, 0xff, 0xff, 0x00,
+              0x00, 0x1c, 0x00, 0x00, 0x00, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xe0, 0xff, 0xff, 0xff, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0xe0, 0xff, 0xff, 0xff},
+             {0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x03, 0x00,
+              0xf8, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0x1f, 0x00, 0x00, 0x80, 0xff, 0xff, 0x3f,
+              0x00, 0xfe, 0xff, 0xff, 0xff, 0xdf, 0xff, 0xff}},
+            {{0xff, 0xff, 0xff, 0xff, 0x00, 0x0f, 0xfc, 0x9f,
+              0xff, 0xff, 0xff, 0x00, 0x80, 0x00, 0x00, 0x80,
+              0xff, 0x0f, 0xfc, 0xff, 0x7f, 0x00, 0x00, 0x00,
+              0x00, 0xf8, 0xff, 0xff, 0xff, 0xff, 0xff, 0x00},
+             {0x08, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x80,
+              0x00, 0x00, 0xf8, 0xff, 0x0f, 0xc0, 0xff, 0xff,
+              0xff, 0x1f, 0x00, 0x00, 0x00, 0xc0, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0x07, 0x80, 0xff, 0xff, 0xff}},
+            {{0xff, 0xff, 0xff, 0xff, 0xff, 0x3f, 0x00, 0x00,
+              0x80, 0x00, 0x00, 0x80, 0xff, 0xff, 0xff, 0xff,
+              0xf7, 0xff, 0xff, 0xef, 0xff, 0xff, 0xff, 0x00,
+              0xff, 0xff, 0xff, 0x00, 0x00, 0x00, 0x00, 0xf0},
+             {0x00, 0x00, 0x00, 0x00, 0xf8, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0x01, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x80, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff}},
+            {{0x00, 0xf8, 0xff, 0x03, 0xff, 0xff, 0xff, 0x00,
+              0x00, 0xfe, 0xff, 0xff, 0xff, 0xff, 0xff, 0x00,
+              0x80, 0x00, 0x00, 0x80, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0x03, 0xc0, 0xff, 0x0f, 0xfc, 0xff},
+             {0xff, 0xff, 0xff, 0xff, 0xff, 0xe0, 0xff, 0xff,
+              0xff, 0x01, 0x00, 0x00, 0x00, 0x3f, 0x00, 0xc0,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff}},
+            {{0x8f, 0x0f, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0xf8, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0x7f, 0x00, 0x00, 0x80, 0x00, 0x00, 0x80,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x00},
+             {0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0x0f, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}},
+            {{0x00, 0x00, 0x00, 0xc0, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0x03, 0x00, 0x80, 0x00, 0x00, 0x80,
+              0xff, 0xff, 0xff, 0x00, 0x00, 0x80, 0xff, 0x7f},
+             {0xff, 0xcf, 0xff, 0xff, 0x01, 0x00, 0x00, 0x00,
+              0x00, 0xc0, 0xff, 0xcf, 0xff, 0xff, 0xff, 0xff,
+              0xbf, 0xff, 0x0e, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x80, 0xff, 0xff, 0xff, 0xff, 0x00, 0x00, 0x00}},
+            {{0x00, 0x00, 0x00, 0x00, 0x00, 0x80, 0xff, 0xff,
+              0xff, 0xff, 0x00, 0xfc, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0x00, 0x80, 0x00, 0x00, 0x80,
+              0xff, 0x01, 0xfc, 0xff, 0x01, 0x00, 0xfe, 0xff},
+             {0xff, 0xff, 0xff, 0x03, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xc0,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x03, 0x00}},
+            {{0xff, 0xff, 0xff, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0xe0, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0x00, 0xf8, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0x7f, 0x00, 0x00, 0x00, 0x80, 0x00, 0x00, 0x80},
+             {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0xf8, 0xff, 0x01, 0x00, 0xf0, 0xff, 0xff,
+              0xe0, 0xff, 0x0f, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}},
+            {{0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0xf8, 0xff, 0x00},
+             {0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x00, 0x00,
+              0xfc, 0xff, 0xff, 0x3f, 0xf0, 0xff, 0xff, 0x3f,
+              0x00, 0x00, 0xf8, 0x07, 0x00, 0x00, 0x00, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0x0f, 0x7e, 0x00, 0x00}},
+            {{0x00, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x80, 0x00, 0x00, 0x80,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0x1f, 0x00, 0x00, 0xfe, 0x07, 0x00},
+             {0x00, 0x00, 0x00, 0xf0, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xfb, 0xff, 0x07, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x60}},
+            {{0xff, 0x01, 0x00, 0xff, 0xff, 0xff, 0x0f, 0x00,
+              0x80, 0x7f, 0xfe, 0xff, 0xff, 0xff, 0xff, 0x03,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x80, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff},
+             {0xff, 0xff, 0x1f, 0x00, 0xf0, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0x3f, 0x00, 0x00, 0x00, 0x00}},
+            {{0x80, 0x00, 0x00, 0x00, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff},
+             {0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xf1, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x03,
+              0x00, 0x00, 0x00, 0xe0, 0xff, 0xff, 0xff, 0xff}},
+            {{0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x00,
+              0x7e, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0xc0, 0xff, 0xff, 0xcf, 0xff, 0x1f, 0x00, 0x00,
+              0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x80},
+             {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0xe0, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0x3f, 0x00, 0x7e,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}},
+            {{0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0xfc, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0x03, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x7c, 0x00},
+             {0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x80,
+              0xff, 0xff, 0x7f, 0x00, 0x80, 0x00, 0x00, 0x00,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x00,
+              0x00, 0x00, 0xe0, 0xff, 0xff, 0xff, 0xff, 0xff}},
+            {{0xff, 0xff, 0xff, 0xff, 0xff, 0x1f, 0x00, 0x80,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x00,
+              0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x80,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x00},
+             {0xf0, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0x3f, 0x00, 0x00, 0x80,
+              0xff, 0x01, 0x00, 0x00, 0x00, 0x00, 0xff, 0xff,
+              0xff, 0x7f, 0xf8, 0xff, 0xff, 0x1f, 0x00, 0xfe}},
+            {{0xff, 0xff, 0xff, 0x3f, 0xf8, 0xff, 0xff, 0xff,
+              0xff, 0x03, 0xfe, 0x01, 0x00, 0x00, 0x00, 0x00,
+              0xf0, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x07},
+             {0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x00,
+              0x80, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x80,
+              0xff, 0xff, 0xff, 0xff, 0x01, 0x80, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x00}},
+            {{0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00},
+             {0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xfe,
+              0xba, 0xae, 0xdc, 0xe6, 0xaf, 0x48, 0xa0, 0x3b,
+              0xbf, 0xd2, 0x5e, 0x8c, 0xd0, 0x36, 0x41, 0x40}},
+            {{0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01},
+             {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}},
+            {{0x7f, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff},
+             {0x7f, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff}},
+            {{0xff, 0xff, 0xff, 0xff, 0xff, 0x00, 0x00, 0xc0,
+              0xff, 0x0f, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0xf0, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x7f},
+             {0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x01, 0x00,
+              0xf0, 0xff, 0xff, 0xff, 0xff, 0x07, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0xfe, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0x01, 0xff, 0xff, 0xff}},
+            {{0x7f, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff},
+             {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02}},
+            {{0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xfe,
+              0xba, 0xae, 0xdc, 0xe6, 0xaf, 0x48, 0xa0, 0x3b,
+              0xbf, 0xd2, 0x5e, 0x8c, 0xd0, 0x36, 0x41, 0x40},
+             {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01}},
+            {{0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0x7e, 0x00, 0x00, 0xc0, 0xff, 0xff, 0x07, 0x00,
+              0x80, 0x00, 0x00, 0x00, 0x80, 0x00, 0x00, 0x00,
+              0xfc, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff},
+             {0xff, 0x01, 0x00, 0x00, 0x00, 0xe0, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0x1f, 0x00, 0x80,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0x03, 0x00, 0x00,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff}},
+            {{0xff, 0xff, 0xf0, 0xff, 0xff, 0xff, 0xff, 0x00,
+              0xf0, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x00,
+              0x00, 0xe0, 0xff, 0xff, 0xff, 0xff, 0xff, 0x01,
+              0x80, 0x00, 0x00, 0x80, 0xff, 0xff, 0xff, 0xff},
+             {0x00, 0x00, 0x00, 0x00, 0x00, 0xe0, 0xff, 0xff,
+              0xff, 0xff, 0x3f, 0x00, 0xf8, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0x3f, 0x00, 0x00, 0xc0, 0xf1, 0x7f, 0x00}},
+            {{0xff, 0xff, 0xff, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0xc0, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x80, 0x00, 0x00, 0x80, 0xff, 0xff, 0xff, 0x00},
+             {0x00, 0xf8, 0xff, 0xff, 0xff, 0xff, 0xff, 0x01,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xf8, 0xff,
+              0xff, 0x7f, 0x00, 0x00, 0x00, 0x00, 0x80, 0x1f,
+              0x00, 0x00, 0xfc, 0xff, 0xff, 0x01, 0xff, 0xff}},
+            {{0x00, 0xfe, 0xff, 0xff, 0xff, 0xff, 0xff, 0x00,
+              0x80, 0x00, 0x00, 0x80, 0xff, 0x03, 0xe0, 0x01,
+              0xff, 0xff, 0xff, 0x00, 0x00, 0x00, 0xfc, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x00},
+             {0xff, 0xff, 0xff, 0xff, 0x00, 0x00, 0x00, 0x00,
+              0xfe, 0xff, 0xff, 0xf0, 0x07, 0x00, 0x3c, 0x80,
+              0xff, 0xff, 0xff, 0xff, 0xfc, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0x07, 0xe0, 0xff, 0x00, 0x00, 0x00}},
+            {{0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x00,
+              0xfc, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x07, 0xf8,
+              0x00, 0x00, 0x00, 0x00, 0x80, 0x00, 0x00, 0x80},
+             {0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0x0c, 0x80, 0x00,
+              0x00, 0x00, 0x00, 0xc0, 0x7f, 0xfe, 0xff, 0x1f,
+              0x00, 0xfe, 0xff, 0x03, 0x00, 0x00, 0xfe, 0xff}},
+            {{0xff, 0xff, 0x81, 0xff, 0xff, 0xff, 0xff, 0x00,
+              0x80, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0x83,
+              0xff, 0xff, 0x00, 0x00, 0x80, 0x00, 0x00, 0x80,
+              0xff, 0xff, 0x7f, 0x00, 0x00, 0x00, 0x00, 0xf0},
+             {0xff, 0x01, 0x00, 0x00, 0x00, 0x00, 0xf8, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0x1f, 0x00, 0x00,
+              0xf8, 0x07, 0x00, 0x80, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xc7, 0xff, 0xff, 0xe0, 0xff, 0xff, 0xff}},
+            {{0x82, 0xc9, 0xfa, 0xb0, 0x68, 0x04, 0xa0, 0x00,
+              0x82, 0xc9, 0xfa, 0xb0, 0x68, 0x04, 0xa0, 0x00,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0x6f, 0x03, 0xfb,
+              0xfa, 0x8a, 0x7d, 0xdf, 0x13, 0x86, 0xe2, 0x03},
+             {0x82, 0xc9, 0xfa, 0xb0, 0x68, 0x04, 0xa0, 0x00,
+              0x82, 0xc9, 0xfa, 0xb0, 0x68, 0x04, 0xa0, 0x00,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0x6f, 0x03, 0xfb,
+              0xfa, 0x8a, 0x7d, 0xdf, 0x13, 0x86, 0xe2, 0x03}}
+        };
+        unsigned char res[33][2][32] = {
+            {{0x0c, 0x3b, 0x0a, 0xca, 0x8d, 0x1a, 0x2f, 0xb9,
+              0x8a, 0x7b, 0x53, 0x5a, 0x1f, 0xc5, 0x22, 0xa1,
+              0x07, 0x2a, 0x48, 0xea, 0x02, 0xeb, 0xb3, 0xd6,
+              0x20, 0x1e, 0x86, 0xd0, 0x95, 0xf6, 0x92, 0x35},
+             {0xdc, 0x90, 0x7a, 0x07, 0x2e, 0x1e, 0x44, 0x6d,
+              0xf8, 0x15, 0x24, 0x5b, 0x5a, 0x96, 0x37, 0x9c,
+              0x37, 0x7b, 0x0d, 0xac, 0x1b, 0x65, 0x58, 0x49,
+              0x43, 0xb7, 0x31, 0xbb, 0xa7, 0xf4, 0x97, 0x15}},
+            {{0xf1, 0xf7, 0x3a, 0x50, 0xe6, 0x10, 0xba, 0x22,
+              0x43, 0x4d, 0x1f, 0x1f, 0x7c, 0x27, 0xca, 0x9c,
+              0xb8, 0xb6, 0xa0, 0xfc, 0xd8, 0xc0, 0x05, 0x2f,
+              0xf7, 0x08, 0xe1, 0x76, 0xdd, 0xd0, 0x80, 0xc8},
+             {0xe3, 0x80, 0x80, 0xb8, 0xdb, 0xe3, 0xa9, 0x77,
+              0x00, 0xb0, 0xf5, 0x2e, 0x27, 0xe2, 0x68, 0xc4,
+              0x88, 0xe8, 0x04, 0xc1, 0x12, 0xbf, 0x78, 0x59,
+              0xe6, 0xa9, 0x7c, 0xe1, 0x81, 0xdd, 0xb9, 0xd5}},
+            {{0x96, 0xe2, 0xee, 0x01, 0xa6, 0x80, 0x31, 0xef,
+              0x5c, 0xd0, 0x19, 0xb4, 0x7d, 0x5f, 0x79, 0xab,
+              0xa1, 0x97, 0xd3, 0x7e, 0x33, 0xbb, 0x86, 0x55,
+              0x60, 0x20, 0x10, 0x0d, 0x94, 0x2d, 0x11, 0x7c},
+             {0xcc, 0xab, 0xe0, 0xe8, 0x98, 0x65, 0x12, 0x96,
+              0x38, 0x5a, 0x1a, 0xf2, 0x85, 0x23, 0x59, 0x5f,
+              0xf9, 0xf3, 0xc2, 0x81, 0x70, 0x92, 0x65, 0x12,
+              0x9c, 0x65, 0x1e, 0x96, 0x00, 0xef, 0xe7, 0x63}},
+            {{0xac, 0x1e, 0x62, 0xc2, 0x59, 0xfc, 0x4e, 0x5c,
+              0x83, 0xb0, 0xd0, 0x6f, 0xce, 0x19, 0xf6, 0xbf,
+              0xa4, 0xb0, 0xe0, 0x53, 0x66, 0x1f, 0xbf, 0xc9,
+              0x33, 0x47, 0x37, 0xa9, 0x3d, 0x5d, 0xb0, 0x48},
+             {0x86, 0xb9, 0x2a, 0x7f, 0x8e, 0xa8, 0x60, 0x42,
+              0x26, 0x6d, 0x6e, 0x1c, 0xa2, 0xec, 0xe0, 0xe5,
+              0x3e, 0x0a, 0x33, 0xbb, 0x61, 0x4c, 0x9f, 0x3c,
+              0xd1, 0xdf, 0x49, 0x33, 0xcd, 0x72, 0x78, 0x18}},
+            {{0xf7, 0xd3, 0xcd, 0x49, 0x5c, 0x13, 0x22, 0xfb,
+              0x2e, 0xb2, 0x2f, 0x27, 0xf5, 0x8a, 0x5d, 0x74,
+              0xc1, 0x58, 0xc5, 0xc2, 0x2d, 0x9f, 0x52, 0xc6,
+              0x63, 0x9f, 0xba, 0x05, 0x76, 0x45, 0x7a, 0x63},
+             {0x8a, 0xfa, 0x55, 0x4d, 0xdd, 0xa3, 0xb2, 0xc3,
+              0x44, 0xfd, 0xec, 0x72, 0xde, 0xef, 0xc0, 0x99,
+              0xf5, 0x9f, 0xe2, 0x52, 0xb4, 0x05, 0x32, 0x58,
+              0x57, 0xc1, 0x8f, 0xea, 0xc3, 0x24, 0x5b, 0x94}},
+            {{0x05, 0x83, 0xee, 0xdd, 0x64, 0xf0, 0x14, 0x3b,
+              0xa0, 0x14, 0x4a, 0x3a, 0x41, 0x82, 0x7c, 0xa7,
+              0x2c, 0xaa, 0xb1, 0x76, 0xbb, 0x59, 0x64, 0x5f,
+              0x52, 0xad, 0x25, 0x29, 0x9d, 0x8f, 0x0b, 0xb0},
+             {0x7e, 0xe3, 0x7c, 0xca, 0xcd, 0x4f, 0xb0, 0x6d,
+              0x7a, 0xb2, 0x3e, 0xa0, 0x08, 0xb9, 0xa8, 0x2d,
+              0xc2, 0xf4, 0x99, 0x66, 0xcc, 0xac, 0xd8, 0xb9,
+              0x72, 0x2a, 0x4a, 0x3e, 0x0f, 0x7b, 0xbf, 0xf4}},
+            {{0x8c, 0x9c, 0x78, 0x2b, 0x39, 0x61, 0x7e, 0xf7,
+              0x65, 0x37, 0x66, 0x09, 0x38, 0xb9, 0x6f, 0x70,
+              0x78, 0x87, 0xff, 0xcf, 0x93, 0xca, 0x85, 0x06,
+              0x44, 0x84, 0xa7, 0xfe, 0xd3, 0xa4, 0xe3, 0x7e},
+             {0xa2, 0x56, 0x49, 0x23, 0x54, 0xa5, 0x50, 0xe9,
+              0x5f, 0xf0, 0x4d, 0xe7, 0xdc, 0x38, 0x32, 0x79,
+              0x4f, 0x1c, 0xb7, 0xe4, 0xbb, 0xf8, 0xbb, 0x2e,
+              0x40, 0x41, 0x4b, 0xcc, 0xe3, 0x1e, 0x16, 0x36}},
+            {{0x0c, 0x1e, 0xd7, 0x09, 0x25, 0x40, 0x97, 0xcb,
+              0x5c, 0x46, 0xa8, 0xda, 0xef, 0x25, 0xd5, 0xe5,
+              0x92, 0x4d, 0xcf, 0xa3, 0xc4, 0x5d, 0x35, 0x4a,
+              0xe4, 0x61, 0x92, 0xf3, 0xbf, 0x0e, 0xcd, 0xbe},
+             {0xe4, 0xaf, 0x0a, 0xb3, 0x30, 0x8b, 0x9b, 0x48,
+              0x49, 0x43, 0xc7, 0x64, 0x60, 0x4a, 0x2b, 0x9e,
+              0x95, 0x5f, 0x56, 0xe8, 0x35, 0xdc, 0xeb, 0xdc,
+              0xc7, 0xc4, 0xfe, 0x30, 0x40, 0xc7, 0xbf, 0xa4}},
+            {{0xd4, 0xa0, 0xf5, 0x81, 0x49, 0x6b, 0xb6, 0x8b,
+              0x0a, 0x69, 0xf9, 0xfe, 0xa8, 0x32, 0xe5, 0xe0,
+              0xa5, 0xcd, 0x02, 0x53, 0xf9, 0x2c, 0xe3, 0x53,
+              0x83, 0x36, 0xc6, 0x02, 0xb5, 0xeb, 0x64, 0xb8},
+             {0x1d, 0x42, 0xb9, 0xf9, 0xe9, 0xe3, 0x93, 0x2c,
+              0x4c, 0xee, 0x6c, 0x5a, 0x47, 0x9e, 0x62, 0x01,
+              0x6b, 0x04, 0xfe, 0xa4, 0x30, 0x2b, 0x0d, 0x4f,
+              0x71, 0x10, 0xd3, 0x55, 0xca, 0xf3, 0x5e, 0x80}},
+            {{0x77, 0x05, 0xf6, 0x0c, 0x15, 0x9b, 0x45, 0xe7,
+              0xb9, 0x11, 0xb8, 0xf5, 0xd6, 0xda, 0x73, 0x0c,
+              0xda, 0x92, 0xea, 0xd0, 0x9d, 0xd0, 0x18, 0x92,
+              0xce, 0x9a, 0xaa, 0xee, 0x0f, 0xef, 0xde, 0x30},
+             {0xf1, 0xf1, 0xd6, 0x9b, 0x51, 0xd7, 0x77, 0x62,
+              0x52, 0x10, 0xb8, 0x7a, 0x84, 0x9d, 0x15, 0x4e,
+              0x07, 0xdc, 0x1e, 0x75, 0x0d, 0x0c, 0x3b, 0xdb,
+              0x74, 0x58, 0x62, 0x02, 0x90, 0x54, 0x8b, 0x43}},
+            {{0xa6, 0xfe, 0x0b, 0x87, 0x80, 0x43, 0x67, 0x25,
+              0x57, 0x5d, 0xec, 0x40, 0x50, 0x08, 0xd5, 0x5d,
+              0x43, 0xd7, 0xe0, 0xaa, 0xe0, 0x13, 0xb6, 0xb0,
+              0xc0, 0xd4, 0xe5, 0x0d, 0x45, 0x83, 0xd6, 0x13},
+             {0x40, 0x45, 0x0a, 0x92, 0x31, 0xea, 0x8c, 0x60,
+              0x8c, 0x1f, 0xd8, 0x76, 0x45, 0xb9, 0x29, 0x00,
+              0x26, 0x32, 0xd8, 0xa6, 0x96, 0x88, 0xe2, 0xc4,
+              0x8b, 0xdb, 0x7f, 0x17, 0x87, 0xcc, 0xc8, 0xf2}},
+            {{0xc2, 0x56, 0xe2, 0xb6, 0x1a, 0x81, 0xe7, 0x31,
+              0x63, 0x2e, 0xbb, 0x0d, 0x2f, 0x81, 0x67, 0xd4,
+              0x22, 0xe2, 0x38, 0x02, 0x25, 0x97, 0xc7, 0x88,
+              0x6e, 0xdf, 0xbe, 0x2a, 0xa5, 0x73, 0x63, 0xaa},
+             {0x50, 0x45, 0xe2, 0xc3, 0xbd, 0x89, 0xfc, 0x57,
+              0xbd, 0x3c, 0xa3, 0x98, 0x7e, 0x7f, 0x36, 0x38,
+              0x92, 0x39, 0x1f, 0x0f, 0x81, 0x1a, 0x06, 0x51,
+              0x1f, 0x8d, 0x6a, 0xff, 0x47, 0x16, 0x06, 0x9c}},
+            {{0x33, 0x95, 0xa2, 0x6f, 0x27, 0x5f, 0x9c, 0x9c,
+              0x64, 0x45, 0xcb, 0xd1, 0x3c, 0xee, 0x5e, 0x5f,
+              0x48, 0xa6, 0xaf, 0xe3, 0x79, 0xcf, 0xb1, 0xe2,
+              0xbf, 0x55, 0x0e, 0xa2, 0x3b, 0x62, 0xf0, 0xe4},
+             {0x14, 0xe8, 0x06, 0xe3, 0xbe, 0x7e, 0x67, 0x01,
+              0xc5, 0x21, 0x67, 0xd8, 0x54, 0xb5, 0x7f, 0xa4,
+              0xf9, 0x75, 0x70, 0x1c, 0xfd, 0x79, 0xdb, 0x86,
+              0xad, 0x37, 0x85, 0x83, 0x56, 0x4e, 0xf0, 0xbf}},
+            {{0xbc, 0xa6, 0xe0, 0x56, 0x4e, 0xef, 0xfa, 0xf5,
+              0x1d, 0x5d, 0x3f, 0x2a, 0x5b, 0x19, 0xab, 0x51,
+              0xc5, 0x8b, 0xdd, 0x98, 0x28, 0x35, 0x2f, 0xc3,
+              0x81, 0x4f, 0x5c, 0xe5, 0x70, 0xb9, 0xeb, 0x62},
+             {0xc4, 0x6d, 0x26, 0xb0, 0x17, 0x6b, 0xfe, 0x6c,
+              0x12, 0xf8, 0xe7, 0xc1, 0xf5, 0x2f, 0xfa, 0x91,
+              0x13, 0x27, 0xbd, 0x73, 0xcc, 0x33, 0x31, 0x1c,
+              0x39, 0xe3, 0x27, 0x6a, 0x95, 0xcf, 0xc5, 0xfb}},
+            {{0x30, 0xb2, 0x99, 0x84, 0xf0, 0x18, 0x2a, 0x6e,
+              0x1e, 0x27, 0xed, 0xa2, 0x29, 0x99, 0x41, 0x56,
+              0xe8, 0xd4, 0x0d, 0xef, 0x99, 0x9c, 0xf3, 0x58,
+              0x29, 0x55, 0x1a, 0xc0, 0x68, 0xd6, 0x74, 0xa4},
+             {0x07, 0x9c, 0xe7, 0xec, 0xf5, 0x36, 0x73, 0x41,
+              0xa3, 0x1c, 0xe5, 0x93, 0x97, 0x6a, 0xfd, 0xf7,
+              0x53, 0x18, 0xab, 0xaf, 0xeb, 0x85, 0xbd, 0x92,
+              0x90, 0xab, 0x3c, 0xbf, 0x30, 0x82, 0xad, 0xf6}},
+            {{0xc6, 0x87, 0x8a, 0x2a, 0xea, 0xc0, 0xa9, 0xec,
+              0x6d, 0xd3, 0xdc, 0x32, 0x23, 0xce, 0x62, 0x19,
+              0xa4, 0x7e, 0xa8, 0xdd, 0x1c, 0x33, 0xae, 0xd3,
+              0x4f, 0x62, 0x9f, 0x52, 0xe7, 0x65, 0x46, 0xf4},
+             {0x97, 0x51, 0x27, 0x67, 0x2d, 0xa2, 0x82, 0x87,
+              0x98, 0xd3, 0xb6, 0x14, 0x7f, 0x51, 0xd3, 0x9a,
+              0x0b, 0xd0, 0x76, 0x81, 0xb2, 0x4f, 0x58, 0x92,
+              0xa4, 0x86, 0xa1, 0xa7, 0x09, 0x1d, 0xef, 0x9b}},
+            {{0xb3, 0x0f, 0x2b, 0x69, 0x0d, 0x06, 0x90, 0x64,
+              0xbd, 0x43, 0x4c, 0x10, 0xe8, 0x98, 0x1c, 0xa3,
+              0xe1, 0x68, 0xe9, 0x79, 0x6c, 0x29, 0x51, 0x3f,
+              0x41, 0xdc, 0xdf, 0x1f, 0xf3, 0x60, 0xbe, 0x33},
+             {0xa1, 0x5f, 0xf7, 0x1d, 0xb4, 0x3e, 0x9b, 0x3c,
+              0xe7, 0xbd, 0xb6, 0x06, 0xd5, 0x60, 0x06, 0x6d,
+              0x50, 0xd2, 0xf4, 0x1a, 0x31, 0x08, 0xf2, 0xea,
+              0x8e, 0xef, 0x5f, 0x7d, 0xb6, 0xd0, 0xc0, 0x27}},
+            {{0x62, 0x9a, 0xd9, 0xbb, 0x38, 0x36, 0xce, 0xf7,
+              0x5d, 0x2f, 0x13, 0xec, 0xc8, 0x2d, 0x02, 0x8a,
+              0x2e, 0x72, 0xf0, 0xe5, 0x15, 0x9d, 0x72, 0xae,
+              0xfc, 0xb3, 0x4f, 0x02, 0xea, 0xe1, 0x09, 0xfe},
+             {0x00, 0x00, 0x00, 0x00, 0xfa, 0x0a, 0x3d, 0xbc,
+              0xad, 0x16, 0x0c, 0xb6, 0xe7, 0x7c, 0x8b, 0x39,
+              0x9a, 0x43, 0xbb, 0xe3, 0xc2, 0x55, 0x15, 0x14,
+              0x75, 0xac, 0x90, 0x9b, 0x7f, 0x9a, 0x92, 0x00}},
+            {{0x8b, 0xac, 0x70, 0x86, 0x29, 0x8f, 0x00, 0x23,
+              0x7b, 0x45, 0x30, 0xaa, 0xb8, 0x4c, 0xc7, 0x8d,
+              0x4e, 0x47, 0x85, 0xc6, 0x19, 0xe3, 0x96, 0xc2,
+              0x9a, 0xa0, 0x12, 0xed, 0x6f, 0xd7, 0x76, 0x16},
+             {0x45, 0xaf, 0x7e, 0x33, 0xc7, 0x7f, 0x10, 0x6c,
+              0x7c, 0x9f, 0x29, 0xc1, 0xa8, 0x7e, 0x15, 0x84,
+              0xe7, 0x7d, 0xc0, 0x6d, 0xab, 0x71, 0x5d, 0xd0,
+              0x6b, 0x9f, 0x97, 0xab, 0xcb, 0x51, 0x0c, 0x9f}},
+            {{0x9e, 0xc3, 0x92, 0xb4, 0x04, 0x9f, 0xc8, 0xbb,
+              0xdd, 0x9e, 0xc6, 0x05, 0xfd, 0x65, 0xec, 0x94,
+              0x7f, 0x2c, 0x16, 0xc4, 0x40, 0xac, 0x63, 0x7b,
+              0x7d, 0xb8, 0x0c, 0xe4, 0x5b, 0xe3, 0xa7, 0x0e},
+             {0x43, 0xf4, 0x44, 0xe8, 0xcc, 0xc8, 0xd4, 0x54,
+              0x33, 0x37, 0x50, 0xf2, 0x87, 0x42, 0x2e, 0x00,
+              0x49, 0x60, 0x62, 0x02, 0xfd, 0x1a, 0x7c, 0xdb,
+              0x29, 0x6c, 0x6d, 0x54, 0x53, 0x08, 0xd1, 0xc8}},
+            {{0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00},
+             {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00}},
+            {{0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00},
+             {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01}},
+            {{0x27, 0x59, 0xc7, 0x35, 0x60, 0x71, 0xa6, 0xf1,
+              0x79, 0xa5, 0xfd, 0x79, 0x16, 0xf3, 0x41, 0xf0,
+              0x57, 0xb4, 0x02, 0x97, 0x32, 0xe7, 0xde, 0x59,
+              0xe2, 0x2d, 0x9b, 0x11, 0xea, 0x2c, 0x35, 0x92},
+             {0x27, 0x59, 0xc7, 0x35, 0x60, 0x71, 0xa6, 0xf1,
+              0x79, 0xa5, 0xfd, 0x79, 0x16, 0xf3, 0x41, 0xf0,
+              0x57, 0xb4, 0x02, 0x97, 0x32, 0xe7, 0xde, 0x59,
+              0xe2, 0x2d, 0x9b, 0x11, 0xea, 0x2c, 0x35, 0x92}},
+            {{0x28, 0x56, 0xac, 0x0e, 0x4f, 0x98, 0x09, 0xf0,
+              0x49, 0xfa, 0x7f, 0x84, 0xac, 0x7e, 0x50, 0x5b,
+              0x17, 0x43, 0x14, 0x89, 0x9c, 0x53, 0xa8, 0x94,
+              0x30, 0xf2, 0x11, 0x4d, 0x92, 0x14, 0x27, 0xe8},
+             {0x39, 0x7a, 0x84, 0x56, 0x79, 0x9d, 0xec, 0x26,
+              0x2c, 0x53, 0xc1, 0x94, 0xc9, 0x8d, 0x9e, 0x9d,
+              0x32, 0x1f, 0xdd, 0x84, 0x04, 0xe8, 0xe2, 0x0a,
+              0x6b, 0xbe, 0xbb, 0x42, 0x40, 0x67, 0x30, 0x6c}},
+            {{0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01,
+              0x45, 0x51, 0x23, 0x19, 0x50, 0xb7, 0x5f, 0xc4,
+              0x40, 0x2d, 0xa1, 0x73, 0x2f, 0xc9, 0xbe, 0xbd},
+             {0x27, 0x59, 0xc7, 0x35, 0x60, 0x71, 0xa6, 0xf1,
+              0x79, 0xa5, 0xfd, 0x79, 0x16, 0xf3, 0x41, 0xf0,
+              0x57, 0xb4, 0x02, 0x97, 0x32, 0xe7, 0xde, 0x59,
+              0xe2, 0x2d, 0x9b, 0x11, 0xea, 0x2c, 0x35, 0x92}},
+            {{0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+              0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xfe,
+              0xba, 0xae, 0xdc, 0xe6, 0xaf, 0x48, 0xa0, 0x3b,
+              0xbf, 0xd2, 0x5e, 0x8c, 0xd0, 0x36, 0x41, 0x40},
+             {0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+              0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01}},
+            {{0x1c, 0xc4, 0xf7, 0xda, 0x0f, 0x65, 0xca, 0x39,
+              0x70, 0x52, 0x92, 0x8e, 0xc3, 0xc8, 0x15, 0xea,
+              0x7f, 0x10, 0x9e, 0x77, 0x4b, 0x6e, 0x2d, 0xdf,
+              0xe8, 0x30, 0x9d, 0xda, 0xe8, 0x9a, 0x65, 0xae},
+             {0x02, 0xb0, 0x16, 0xb1, 0x1d, 0xc8, 0x57, 0x7b,
+              0xa2, 0x3a, 0xa2, 0xa3, 0x38, 0x5c, 0x8f, 0xeb,
+              0x66, 0x37, 0x91, 0xa8, 0x5f, 0xef, 0x04, 0xf6,
+              0x59, 0x75, 0xe1, 0xee, 0x92, 0xf6, 0x0e, 0x30}},
+            {{0x8d, 0x76, 0x14, 0xa4, 0x14, 0x06, 0x9f, 0x9a,
+              0xdf, 0x4a, 0x85, 0xa7, 0x6b, 0xbf, 0x29, 0x6f,
+              0xbc, 0x34, 0x87, 0x5d, 0xeb, 0xbb, 0x2e, 0xa9,
+              0xc9, 0x1f, 0x58, 0xd6, 0x9a, 0x82, 0xa0, 0x56},
+             {0xd4, 0xb9, 0xdb, 0x88, 0x1d, 0x04, 0xe9, 0x93,
+              0x8d, 0x3f, 0x20, 0xd5, 0x86, 0xa8, 0x83, 0x07,
+              0xdb, 0x09, 0xd8, 0x22, 0x1f, 0x7f, 0xf1, 0x71,
+              0xc8, 0xe7, 0x5d, 0x47, 0xaf, 0x8b, 0x72, 0xe9}},
+            {{0x83, 0xb9, 0x39, 0xb2, 0xa4, 0xdf, 0x46, 0x87,
+              0xc2, 0xb8, 0xf1, 0xe6, 0x4c, 0xd1, 0xe2, 0xa9,
+              0xe4, 0x70, 0x30, 0x34, 0xbc, 0x52, 0x7c, 0x55,
+              0xa6, 0xec, 0x80, 0xa4, 0xe5, 0xd2, 0xdc, 0x73},
+             {0x08, 0xf1, 0x03, 0xcf, 0x16, 0x73, 0xe8, 0x7d,
+              0xb6, 0x7e, 0x9b, 0xc0, 0xb4, 0xc2, 0xa5, 0x86,
+              0x02, 0x77, 0xd5, 0x27, 0x86, 0xa5, 0x15, 0xfb,
+              0xae, 0x9b, 0x8c, 0xa9, 0xf9, 0xf8, 0xa8, 0x4a}},
+            {{0x8b, 0x00, 0x49, 0xdb, 0xfa, 0xf0, 0x1b, 0xa2,
+              0xed, 0x8a, 0x9a, 0x7a, 0x36, 0x78, 0x4a, 0xc7,
+              0xf7, 0xad, 0x39, 0xd0, 0x6c, 0x65, 0x7a, 0x41,
+              0xce, 0xd6, 0xd6, 0x4c, 0x20, 0x21, 0x6b, 0xc7},
+             {0xc6, 0xca, 0x78, 0x1d, 0x32, 0x6c, 0x6c, 0x06,
+              0x91, 0xf2, 0x1a, 0xe8, 0x43, 0x16, 0xea, 0x04,
+              0x3c, 0x1f, 0x07, 0x85, 0xf7, 0x09, 0x22, 0x08,
+              0xba, 0x13, 0xfd, 0x78, 0x1e, 0x3f, 0x6f, 0x62}},
+            {{0x25, 0x9b, 0x7c, 0xb0, 0xac, 0x72, 0x6f, 0xb2,
+              0xe3, 0x53, 0x84, 0x7a, 0x1a, 0x9a, 0x98, 0x9b,
+              0x44, 0xd3, 0x59, 0xd0, 0x8e, 0x57, 0x41, 0x40,
+              0x78, 0xa7, 0x30, 0x2f, 0x4c, 0x9c, 0xb9, 0x68},
+             {0xb7, 0x75, 0x03, 0x63, 0x61, 0xc2, 0x48, 0x6e,
+              0x12, 0x3d, 0xbf, 0x4b, 0x27, 0xdf, 0xb1, 0x7a,
+              0xff, 0x4e, 0x31, 0x07, 0x83, 0xf4, 0x62, 0x5b,
+              0x19, 0xa5, 0xac, 0xa0, 0x32, 0x58, 0x0d, 0xa7}},
+            {{0x43, 0x4f, 0x10, 0xa4, 0xca, 0xdb, 0x38, 0x67,
+              0xfa, 0xae, 0x96, 0xb5, 0x6d, 0x97, 0xff, 0x1f,
+              0xb6, 0x83, 0x43, 0xd3, 0xa0, 0x2d, 0x70, 0x7a,
+              0x64, 0x05, 0x4c, 0xa7, 0xc1, 0xa5, 0x21, 0x51},
+             {0xe4, 0xf1, 0x23, 0x84, 0xe1, 0xb5, 0x9d, 0xf2,
+              0xb8, 0x73, 0x8b, 0x45, 0x2b, 0x35, 0x46, 0x38,
+              0x10, 0x2b, 0x50, 0xf8, 0x8b, 0x35, 0xcd, 0x34,
+              0xc8, 0x0e, 0xf6, 0xdb, 0x09, 0x35, 0xf0, 0xda}},
+            {{0xdb, 0x21, 0x5c, 0x8d, 0x83, 0x1d, 0xb3, 0x34,
+              0xc7, 0x0e, 0x43, 0xa1, 0x58, 0x79, 0x67, 0x13,
+              0x1e, 0x86, 0x5d, 0x89, 0x63, 0xe6, 0x0a, 0x46,
+              0x5c, 0x02, 0x97, 0x1b, 0x62, 0x43, 0x86, 0xf5},
+             {0xdb, 0x21, 0x5c, 0x8d, 0x83, 0x1d, 0xb3, 0x34,
+              0xc7, 0x0e, 0x43, 0xa1, 0x58, 0x79, 0x67, 0x13,
+              0x1e, 0x86, 0x5d, 0x89, 0x63, 0xe6, 0x0a, 0x46,
+              0x5c, 0x02, 0x97, 0x1b, 0x62, 0x43, 0x86, 0xf5}}
+        };
+        secp256k1_scalar_set_int(&one, 1);
+        for (i = 0; i < 33; i++) {
+            secp256k1_scalar_set_b32(&x, chal[i][0], &overflow);
+            CHECK(!overflow);
+            secp256k1_scalar_set_b32(&y, chal[i][1], &overflow);
+            CHECK(!overflow);
+            secp256k1_scalar_set_b32(&r1, res[i][0], &overflow);
+            CHECK(!overflow);
+            secp256k1_scalar_set_b32(&r2, res[i][1], &overflow);
+            CHECK(!overflow);
+            secp256k1_scalar_mul(&z, &x, &y);
+            CHECK(!secp256k1_scalar_check_overflow(&z));
+            CHECK(secp256k1_scalar_eq(&r1, &z));
+            if (!secp256k1_scalar_is_zero(&y)) {
+                secp256k1_scalar_inverse(&zz, &y);
+                CHECK(!secp256k1_scalar_check_overflow(&zz));
+#if defined(USE_SCALAR_INV_NUM)
+                secp256k1_scalar_inverse_var(&zzv, &y);
+                CHECK(secp256k1_scalar_eq(&zzv, &zz));
+#endif
+                secp256k1_scalar_mul(&z, &z, &zz);
+                CHECK(!secp256k1_scalar_check_overflow(&z));
+                CHECK(secp256k1_scalar_eq(&x, &z));
+                secp256k1_scalar_mul(&zz, &zz, &y);
+                CHECK(!secp256k1_scalar_check_overflow(&zz));
+                CHECK(secp256k1_scalar_eq(&one, &zz));
+            }
+            secp256k1_scalar_mul(&z, &x, &x);
+            CHECK(!secp256k1_scalar_check_overflow(&z));
+            secp256k1_scalar_sqr(&zz, &x);
+            CHECK(!secp256k1_scalar_check_overflow(&zz));
+            CHECK(secp256k1_scalar_eq(&zz, &z));
+            CHECK(secp256k1_scalar_eq(&r2, &zz));
+        }
+    }
+}
+
+/***** FIELD TESTS *****/
+
+void random_fe(secp256k1_fe *x) {
+    unsigned char bin[32];
+    do {
+        secp256k1_testrand256(bin);
+        if (secp256k1_fe_set_b32(x, bin)) {
+            return;
+        }
+    } while(1);
+}
+
+void random_fe_test(secp256k1_fe *x) {
+    unsigned char bin[32];
+    do {
+        secp256k1_testrand256_test(bin);
+        if (secp256k1_fe_set_b32(x, bin)) {
+            return;
+        }
+    } while(1);
+}
+
+void random_fe_non_zero(secp256k1_fe *nz) {
+    int tries = 10;
+    while (--tries >= 0) {
+        random_fe(nz);
+        secp256k1_fe_normalize(nz);
+        if (!secp256k1_fe_is_zero(nz)) {
+            break;
+        }
+    }
+    /* Infinitesimal probability of spurious failure here */
+    CHECK(tries >= 0);
+}
+
+void random_fe_non_square(secp256k1_fe *ns) {
+    secp256k1_fe r;
+    random_fe_non_zero(ns);
+    if (secp256k1_fe_sqrt(&r, ns)) {
+        secp256k1_fe_negate(ns, ns, 1);
+    }
+}
+
+int check_fe_equal(const secp256k1_fe *a, const secp256k1_fe *b) {
+    secp256k1_fe an = *a;
+    secp256k1_fe bn = *b;
+    secp256k1_fe_normalize_weak(&an);
+    secp256k1_fe_normalize_var(&bn);
+    return secp256k1_fe_equal_var(&an, &bn);
+}
+
+int check_fe_inverse(const secp256k1_fe *a, const secp256k1_fe *ai) {
+    secp256k1_fe x;
+    secp256k1_fe one = SECP256K1_FE_CONST(0, 0, 0, 0, 0, 0, 0, 1);
+    secp256k1_fe_mul(&x, a, ai);
+    return check_fe_equal(&x, &one);
+}
+
+void run_field_convert(void) {
+    static const unsigned char b32[32] = {
+        0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07,
+        0x11, 0x12, 0x13, 0x14, 0x15, 0x16, 0x17, 0x18,
+        0x22, 0x23, 0x24, 0x25, 0x26, 0x27, 0x28, 0x29,
+        0x33, 0x34, 0x35, 0x36, 0x37, 0x38, 0x39, 0x40
+    };
+    static const secp256k1_fe_storage fes = SECP256K1_FE_STORAGE_CONST(
+        0x00010203UL, 0x04050607UL, 0x11121314UL, 0x15161718UL,
+        0x22232425UL, 0x26272829UL, 0x33343536UL, 0x37383940UL
+    );
+    static const secp256k1_fe fe = SECP256K1_FE_CONST(
+        0x00010203UL, 0x04050607UL, 0x11121314UL, 0x15161718UL,
+        0x22232425UL, 0x26272829UL, 0x33343536UL, 0x37383940UL
+    );
+    secp256k1_fe fe2;
+    unsigned char b322[32];
+    secp256k1_fe_storage fes2;
+    /* Check conversions to fe. */
+    CHECK(secp256k1_fe_set_b32(&fe2, b32));
+    CHECK(secp256k1_fe_equal_var(&fe, &fe2));
+    secp256k1_fe_from_storage(&fe2, &fes);
+    CHECK(secp256k1_fe_equal_var(&fe, &fe2));
+    /* Check conversion from fe. */
+    secp256k1_fe_get_b32(b322, &fe);
+    CHECK(secp256k1_memcmp_var(b322, b32, 32) == 0);
+    secp256k1_fe_to_storage(&fes2, &fe);
+    CHECK(secp256k1_memcmp_var(&fes2, &fes, sizeof(fes)) == 0);
+}
+
+int fe_secp256k1_memcmp_var(const secp256k1_fe *a, const secp256k1_fe *b) {
+    secp256k1_fe t = *b;
+#ifdef VERIFY
+    t.magnitude = a->magnitude;
+    t.normalized = a->normalized;
+#endif
+    return secp256k1_memcmp_var(a, &t, sizeof(secp256k1_fe));
+}
+
+void run_field_misc(void) {
+    secp256k1_fe x;
+    secp256k1_fe y;
+    secp256k1_fe z;
+    secp256k1_fe q;
+    secp256k1_fe fe5 = SECP256K1_FE_CONST(0, 0, 0, 0, 0, 0, 0, 5);
+    int i, j;
+    for (i = 0; i < 5*count; i++) {
+        secp256k1_fe_storage xs, ys, zs;
+        random_fe(&x);
+        random_fe_non_zero(&y);
+        /* Test the fe equality and comparison operations. */
+        CHECK(secp256k1_fe_cmp_var(&x, &x) == 0);
+        CHECK(secp256k1_fe_equal_var(&x, &x));
+        z = x;
+        secp256k1_fe_add(&z,&y);
+        /* Test fe conditional move; z is not normalized here. */
+        q = x;
+        secp256k1_fe_cmov(&x, &z, 0);
+#ifdef VERIFY
+        CHECK(x.normalized && x.magnitude == 1);
+#endif
+        secp256k1_fe_cmov(&x, &x, 1);
+        CHECK(fe_secp256k1_memcmp_var(&x, &z) != 0);
+        CHECK(fe_secp256k1_memcmp_var(&x, &q) == 0);
+        secp256k1_fe_cmov(&q, &z, 1);
+#ifdef VERIFY
+        CHECK(!q.normalized && q.magnitude == z.magnitude);
+#endif
+        CHECK(fe_secp256k1_memcmp_var(&q, &z) == 0);
+        secp256k1_fe_normalize_var(&x);
+        secp256k1_fe_normalize_var(&z);
+        CHECK(!secp256k1_fe_equal_var(&x, &z));
+        secp256k1_fe_normalize_var(&q);
+        secp256k1_fe_cmov(&q, &z, (i&1));
+#ifdef VERIFY
+        CHECK(q.normalized && q.magnitude == 1);
+#endif
+        for (j = 0; j < 6; j++) {
+            secp256k1_fe_negate(&z, &z, j+1);
+            secp256k1_fe_normalize_var(&q);
+            secp256k1_fe_cmov(&q, &z, (j&1));
+#ifdef VERIFY
+            CHECK((q.normalized != (j&1)) && q.magnitude == ((j&1) ? z.magnitude : 1));
+#endif
+        }
+        secp256k1_fe_normalize_var(&z);
+        /* Test storage conversion and conditional moves. */
+        secp256k1_fe_to_storage(&xs, &x);
+        secp256k1_fe_to_storage(&ys, &y);
+        secp256k1_fe_to_storage(&zs, &z);
+        secp256k1_fe_storage_cmov(&zs, &xs, 0);
+        secp256k1_fe_storage_cmov(&zs, &zs, 1);
+        CHECK(secp256k1_memcmp_var(&xs, &zs, sizeof(xs)) != 0);
+        secp256k1_fe_storage_cmov(&ys, &xs, 1);
+        CHECK(secp256k1_memcmp_var(&xs, &ys, sizeof(xs)) == 0);
+        secp256k1_fe_from_storage(&x, &xs);
+        secp256k1_fe_from_storage(&y, &ys);
+        secp256k1_fe_from_storage(&z, &zs);
+        /* Test that mul_int, mul, and add agree. */
+        secp256k1_fe_add(&y, &x);
+        secp256k1_fe_add(&y, &x);
+        z = x;
+        secp256k1_fe_mul_int(&z, 3);
+        CHECK(check_fe_equal(&y, &z));
+        secp256k1_fe_add(&y, &x);
+        secp256k1_fe_add(&z, &x);
+        CHECK(check_fe_equal(&z, &y));
+        z = x;
+        secp256k1_fe_mul_int(&z, 5);
+        secp256k1_fe_mul(&q, &x, &fe5);
+        CHECK(check_fe_equal(&z, &q));
+        secp256k1_fe_negate(&x, &x, 1);
+        secp256k1_fe_add(&z, &x);
+        secp256k1_fe_add(&q, &x);
+        CHECK(check_fe_equal(&y, &z));
+        CHECK(check_fe_equal(&q, &y));
+    }
+}
+
+void run_field_inv(void) {
+    secp256k1_fe x, xi, xii;
+    int i;
+    for (i = 0; i < 10*count; i++) {
+        random_fe_non_zero(&x);
+        secp256k1_fe_inv(&xi, &x);
+        CHECK(check_fe_inverse(&x, &xi));
+        secp256k1_fe_inv(&xii, &xi);
+        CHECK(check_fe_equal(&x, &xii));
+    }
+}
+
+void run_field_inv_var(void) {
+    secp256k1_fe x, xi, xii;
+    int i;
+    for (i = 0; i < 10*count; i++) {
+        random_fe_non_zero(&x);
+        secp256k1_fe_inv_var(&xi, &x);
+        CHECK(check_fe_inverse(&x, &xi));
+        secp256k1_fe_inv_var(&xii, &xi);
+        CHECK(check_fe_equal(&x, &xii));
+    }
+}
+
+void run_sqr(void) {
+    secp256k1_fe x, s;
+
+    {
+        int i;
+        secp256k1_fe_set_int(&x, 1);
+        secp256k1_fe_negate(&x, &x, 1);
+
+        for (i = 1; i <= 512; ++i) {
+            secp256k1_fe_mul_int(&x, 2);
+            secp256k1_fe_normalize(&x);
+            secp256k1_fe_sqr(&s, &x);
+        }
+    }
+}
+
+void test_sqrt(const secp256k1_fe *a, const secp256k1_fe *k) {
+    secp256k1_fe r1, r2;
+    int v = secp256k1_fe_sqrt(&r1, a);
+    CHECK((v == 0) == (k == NULL));
+
+    if (k != NULL) {
+        /* Check that the returned root is +/- the given known answer */
+        secp256k1_fe_negate(&r2, &r1, 1);
+        secp256k1_fe_add(&r1, k); secp256k1_fe_add(&r2, k);
+        secp256k1_fe_normalize(&r1); secp256k1_fe_normalize(&r2);
+        CHECK(secp256k1_fe_is_zero(&r1) || secp256k1_fe_is_zero(&r2));
+    }
+}
+
+void run_sqrt(void) {
+    secp256k1_fe ns, x, s, t;
+    int i;
+
+    /* Check sqrt(0) is 0 */
+    secp256k1_fe_set_int(&x, 0);
+    secp256k1_fe_sqr(&s, &x);
+    test_sqrt(&s, &x);
+
+    /* Check sqrt of small squares (and their negatives) */
+    for (i = 1; i <= 100; i++) {
+        secp256k1_fe_set_int(&x, i);
+        secp256k1_fe_sqr(&s, &x);
+        test_sqrt(&s, &x);
+        secp256k1_fe_negate(&t, &s, 1);
+        test_sqrt(&t, NULL);
+    }
+
+    /* Consistency checks for large random values */
+    for (i = 0; i < 10; i++) {
+        int j;
+        random_fe_non_square(&ns);
+        for (j = 0; j < count; j++) {
+            random_fe(&x);
+            secp256k1_fe_sqr(&s, &x);
+            test_sqrt(&s, &x);
+            secp256k1_fe_negate(&t, &s, 1);
+            test_sqrt(&t, NULL);
+            secp256k1_fe_mul(&t, &s, &ns);
+            test_sqrt(&t, NULL);
+        }
+    }
+}
+
+/***** GROUP TESTS *****/
+
+void ge_equals_ge(const secp256k1_ge *a, const secp256k1_ge *b) {
+    CHECK(a->infinity == b->infinity);
+    if (a->infinity) {
+        return;
+    }
+    CHECK(secp256k1_fe_equal_var(&a->x, &b->x));
+    CHECK(secp256k1_fe_equal_var(&a->y, &b->y));
+}
+
+/* This compares jacobian points including their Z, not just their geometric meaning. */
+int gej_xyz_equals_gej(const secp256k1_gej *a, const secp256k1_gej *b) {
+    secp256k1_gej a2;
+    secp256k1_gej b2;
+    int ret = 1;
+    ret &= a->infinity == b->infinity;
+    if (ret && !a->infinity) {
+        a2 = *a;
+        b2 = *b;
+        secp256k1_fe_normalize(&a2.x);
+        secp256k1_fe_normalize(&a2.y);
+        secp256k1_fe_normalize(&a2.z);
+        secp256k1_fe_normalize(&b2.x);
+        secp256k1_fe_normalize(&b2.y);
+        secp256k1_fe_normalize(&b2.z);
+        ret &= secp256k1_fe_cmp_var(&a2.x, &b2.x) == 0;
+        ret &= secp256k1_fe_cmp_var(&a2.y, &b2.y) == 0;
+        ret &= secp256k1_fe_cmp_var(&a2.z, &b2.z) == 0;
+    }
+    return ret;
+}
+
+void ge_equals_gej(const secp256k1_ge *a, const secp256k1_gej *b) {
+    secp256k1_fe z2s;
+    secp256k1_fe u1, u2, s1, s2;
+    CHECK(a->infinity == b->infinity);
+    if (a->infinity) {
+        return;
+    }
+    /* Check a.x * b.z^2 == b.x && a.y * b.z^3 == b.y, to avoid inverses. */
+    secp256k1_fe_sqr(&z2s, &b->z);
+    secp256k1_fe_mul(&u1, &a->x, &z2s);
+    u2 = b->x; secp256k1_fe_normalize_weak(&u2);
+    secp256k1_fe_mul(&s1, &a->y, &z2s); secp256k1_fe_mul(&s1, &s1, &b->z);
+    s2 = b->y; secp256k1_fe_normalize_weak(&s2);
+    CHECK(secp256k1_fe_equal_var(&u1, &u2));
+    CHECK(secp256k1_fe_equal_var(&s1, &s2));
+}
+
+void test_ge(void) {
+    int i, i1;
+    int runs = 6;
+    /* 25 points are used:
+     * - infinity
+     * - for each of four random points p1 p2 p3 p4, we add the point, its
+     *   negation, and then those two again but with randomized Z coordinate.
+     * - The same is then done for lambda*p1 and lambda^2*p1.
+     */
+    secp256k1_ge *ge = (secp256k1_ge *)checked_malloc(&ctx->error_callback, sizeof(secp256k1_ge) * (1 + 4 * runs));
+    secp256k1_gej *gej = (secp256k1_gej *)checked_malloc(&ctx->error_callback, sizeof(secp256k1_gej) * (1 + 4 * runs));
+    secp256k1_fe zf;
+    secp256k1_fe zfi2, zfi3;
+
+    secp256k1_gej_set_infinity(&gej[0]);
+    secp256k1_ge_clear(&ge[0]);
+    secp256k1_ge_set_gej_var(&ge[0], &gej[0]);
+    for (i = 0; i < runs; i++) {
+        int j;
+        secp256k1_ge g;
+        random_group_element_test(&g);
+        if (i >= runs - 2) {
+            secp256k1_ge_mul_lambda(&g, &ge[1]);
+        }
+        if (i >= runs - 1) {
+            secp256k1_ge_mul_lambda(&g, &g);
+        }
+        ge[1 + 4 * i] = g;
+        ge[2 + 4 * i] = g;
+        secp256k1_ge_neg(&ge[3 + 4 * i], &g);
+        secp256k1_ge_neg(&ge[4 + 4 * i], &g);
+        secp256k1_gej_set_ge(&gej[1 + 4 * i], &ge[1 + 4 * i]);
+        random_group_element_jacobian_test(&gej[2 + 4 * i], &ge[2 + 4 * i]);
+        secp256k1_gej_set_ge(&gej[3 + 4 * i], &ge[3 + 4 * i]);
+        random_group_element_jacobian_test(&gej[4 + 4 * i], &ge[4 + 4 * i]);
+        for (j = 0; j < 4; j++) {
+            random_field_element_magnitude(&ge[1 + j + 4 * i].x);
+            random_field_element_magnitude(&ge[1 + j + 4 * i].y);
+            random_field_element_magnitude(&gej[1 + j + 4 * i].x);
+            random_field_element_magnitude(&gej[1 + j + 4 * i].y);
+            random_field_element_magnitude(&gej[1 + j + 4 * i].z);
+        }
+    }
+
+    /* Generate random zf, and zfi2 = 1/zf^2, zfi3 = 1/zf^3 */
+    do {
+        random_field_element_test(&zf);
+    } while(secp256k1_fe_is_zero(&zf));
+    random_field_element_magnitude(&zf);
+    secp256k1_fe_inv_var(&zfi3, &zf);
+    secp256k1_fe_sqr(&zfi2, &zfi3);
+    secp256k1_fe_mul(&zfi3, &zfi3, &zfi2);
+
+    for (i1 = 0; i1 < 1 + 4 * runs; i1++) {
+        int i2;
+        for (i2 = 0; i2 < 1 + 4 * runs; i2++) {
+            /* Compute reference result using gej + gej (var). */
+            secp256k1_gej refj, resj;
+            secp256k1_ge ref;
+            secp256k1_fe zr;
+            secp256k1_gej_add_var(&refj, &gej[i1], &gej[i2], secp256k1_gej_is_infinity(&gej[i1]) ? NULL : &zr);
+            /* Check Z ratio. */
+            if (!secp256k1_gej_is_infinity(&gej[i1]) && !secp256k1_gej_is_infinity(&refj)) {
+                secp256k1_fe zrz; secp256k1_fe_mul(&zrz, &zr, &gej[i1].z);
+                CHECK(secp256k1_fe_equal_var(&zrz, &refj.z));
+            }
+            secp256k1_ge_set_gej_var(&ref, &refj);
+
+            /* Test gej + ge with Z ratio result (var). */
+            secp256k1_gej_add_ge_var(&resj, &gej[i1], &ge[i2], secp256k1_gej_is_infinity(&gej[i1]) ? NULL : &zr);
+            ge_equals_gej(&ref, &resj);
+            if (!secp256k1_gej_is_infinity(&gej[i1]) && !secp256k1_gej_is_infinity(&resj)) {
+                secp256k1_fe zrz; secp256k1_fe_mul(&zrz, &zr, &gej[i1].z);
+                CHECK(secp256k1_fe_equal_var(&zrz, &resj.z));
+            }
+
+            /* Test gej + ge (var, with additional Z factor). */
+            {
+                secp256k1_ge ge2_zfi = ge[i2]; /* the second term with x and y rescaled for z = 1/zf */
+                secp256k1_fe_mul(&ge2_zfi.x, &ge2_zfi.x, &zfi2);
+                secp256k1_fe_mul(&ge2_zfi.y, &ge2_zfi.y, &zfi3);
+                random_field_element_magnitude(&ge2_zfi.x);
+                random_field_element_magnitude(&ge2_zfi.y);
+                secp256k1_gej_add_zinv_var(&resj, &gej[i1], &ge2_zfi, &zf);
+                ge_equals_gej(&ref, &resj);
+            }
+
+            /* Test gej + ge (const). */
+            if (i2 != 0) {
+                /* secp256k1_gej_add_ge does not support its second argument being infinity. */
+                secp256k1_gej_add_ge(&resj, &gej[i1], &ge[i2]);
+                ge_equals_gej(&ref, &resj);
+            }
+
+            /* Test doubling (var). */
+            if ((i1 == 0 && i2 == 0) || ((i1 + 3)/4 == (i2 + 3)/4 && ((i1 + 3)%4)/2 == ((i2 + 3)%4)/2)) {
+                secp256k1_fe zr2;
+                /* Normal doubling with Z ratio result. */
+                secp256k1_gej_double_var(&resj, &gej[i1], &zr2);
+                ge_equals_gej(&ref, &resj);
+                /* Check Z ratio. */
+                secp256k1_fe_mul(&zr2, &zr2, &gej[i1].z);
+                CHECK(secp256k1_fe_equal_var(&zr2, &resj.z));
+                /* Normal doubling. */
+                secp256k1_gej_double_var(&resj, &gej[i2], NULL);
+                ge_equals_gej(&ref, &resj);
+                /* Constant-time doubling. */
+                secp256k1_gej_double(&resj, &gej[i2]);
+                ge_equals_gej(&ref, &resj);
+            }
+
+            /* Test adding opposites. */
+            if ((i1 == 0 && i2 == 0) || ((i1 + 3)/4 == (i2 + 3)/4 && ((i1 + 3)%4)/2 != ((i2 + 3)%4)/2)) {
+                CHECK(secp256k1_ge_is_infinity(&ref));
+            }
+
+            /* Test adding infinity. */
+            if (i1 == 0) {
+                CHECK(secp256k1_ge_is_infinity(&ge[i1]));
+                CHECK(secp256k1_gej_is_infinity(&gej[i1]));
+                ge_equals_gej(&ref, &gej[i2]);
+            }
+            if (i2 == 0) {
+                CHECK(secp256k1_ge_is_infinity(&ge[i2]));
+                CHECK(secp256k1_gej_is_infinity(&gej[i2]));
+                ge_equals_gej(&ref, &gej[i1]);
+            }
+        }
+    }
+
+    /* Test adding all points together in random order equals infinity. */
+    {
+        secp256k1_gej sum = SECP256K1_GEJ_CONST_INFINITY;
+        secp256k1_gej *gej_shuffled = (secp256k1_gej *)checked_malloc(&ctx->error_callback, (4 * runs + 1) * sizeof(secp256k1_gej));
+        for (i = 0; i < 4 * runs + 1; i++) {
+            gej_shuffled[i] = gej[i];
+        }
+        for (i = 0; i < 4 * runs + 1; i++) {
+            int swap = i + secp256k1_testrand_int(4 * runs + 1 - i);
+            if (swap != i) {
+                secp256k1_gej t = gej_shuffled[i];
+                gej_shuffled[i] = gej_shuffled[swap];
+                gej_shuffled[swap] = t;
+            }
+        }
+        for (i = 0; i < 4 * runs + 1; i++) {
+            secp256k1_gej_add_var(&sum, &sum, &gej_shuffled[i], NULL);
+        }
+        CHECK(secp256k1_gej_is_infinity(&sum));
+        free(gej_shuffled);
+    }
+
+    /* Test batch gej -> ge conversion without known z ratios. */
+    {
+        secp256k1_ge *ge_set_all = (secp256k1_ge *)checked_malloc(&ctx->error_callback, (4 * runs + 1) * sizeof(secp256k1_ge));
+        secp256k1_ge_set_all_gej_var(ge_set_all, gej, 4 * runs + 1);
+        for (i = 0; i < 4 * runs + 1; i++) {
+            secp256k1_fe s;
+            random_fe_non_zero(&s);
+            secp256k1_gej_rescale(&gej[i], &s);
+            ge_equals_gej(&ge_set_all[i], &gej[i]);
+        }
+        free(ge_set_all);
+    }
+
+    /* Test batch gej -> ge conversion with many infinities. */
+    for (i = 0; i < 4 * runs + 1; i++) {
+        random_group_element_test(&ge[i]);
+        /* randomly set half the points to infinity */
+        if(secp256k1_fe_is_odd(&ge[i].x)) {
+            secp256k1_ge_set_infinity(&ge[i]);
+        }
+        secp256k1_gej_set_ge(&gej[i], &ge[i]);
+    }
+    /* batch invert */
+    secp256k1_ge_set_all_gej_var(ge, gej, 4 * runs + 1);
+    /* check result */
+    for (i = 0; i < 4 * runs + 1; i++) {
+        ge_equals_gej(&ge[i], &gej[i]);
+    }
+
+    free(ge);
+    free(gej);
+}
+
+
+void test_intialized_inf(void) {
+    secp256k1_ge p;
+    secp256k1_gej pj, npj, infj1, infj2, infj3;
+    secp256k1_fe zinv;
+
+    /* Test that adding P+(-P) results in a fully initalized infinity*/
+    random_group_element_test(&p);
+    secp256k1_gej_set_ge(&pj, &p);
+    secp256k1_gej_neg(&npj, &pj);
+
+    secp256k1_gej_add_var(&infj1, &pj, &npj, NULL);
+    CHECK(secp256k1_gej_is_infinity(&infj1));
+    CHECK(secp256k1_fe_is_zero(&infj1.x));
+    CHECK(secp256k1_fe_is_zero(&infj1.y));
+    CHECK(secp256k1_fe_is_zero(&infj1.z));
+
+    secp256k1_gej_add_ge_var(&infj2, &npj, &p, NULL);
+    CHECK(secp256k1_gej_is_infinity(&infj2));
+    CHECK(secp256k1_fe_is_zero(&infj2.x));
+    CHECK(secp256k1_fe_is_zero(&infj2.y));
+    CHECK(secp256k1_fe_is_zero(&infj2.z));
+
+    secp256k1_fe_set_int(&zinv, 1);
+    secp256k1_gej_add_zinv_var(&infj3, &npj, &p, &zinv);
+    CHECK(secp256k1_gej_is_infinity(&infj3));
+    CHECK(secp256k1_fe_is_zero(&infj3.x));
+    CHECK(secp256k1_fe_is_zero(&infj3.y));
+    CHECK(secp256k1_fe_is_zero(&infj3.z));
+
+
+}
+
+void test_add_neg_y_diff_x(void) {
+    /* The point of this test is to check that we can add two points
+     * whose y-coordinates are negatives of each other but whose x
+     * coordinates differ. If the x-coordinates were the same, these
+     * points would be negatives of each other and their sum is
+     * infinity. This is cool because it "covers up" any degeneracy
+     * in the addition algorithm that would cause the xy coordinates
+     * of the sum to be wrong (since infinity has no xy coordinates).
+     * HOWEVER, if the x-coordinates are different, infinity is the
+     * wrong answer, and such degeneracies are exposed. This is the
+     * root of https://github.com/bitcoin-core/secp256k1/issues/257
+     * which this test is a regression test for.
+     *
+     * These points were generated in sage as
+     * # secp256k1 params
+     * F = FiniteField (0xFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F)
+     * C = EllipticCurve ([F (0), F (7)])
+     * G = C.lift_x(0x79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798)
+     * N = FiniteField(G.order())
+     *
+     * # endomorphism values (lambda is 1^{1/3} in N, beta is 1^{1/3} in F)
+     * x = polygen(N)
+     * lam  = (1 - x^3).roots()[1][0]
+     *
+     * # random "bad pair"
+     * P = C.random_element()
+     * Q = -int(lam) * P
+     * print "    P: %x %x" % P.xy()
+     * print "    Q: %x %x" % Q.xy()
+     * print "P + Q: %x %x" % (P + Q).xy()
+     */
+    secp256k1_gej aj = SECP256K1_GEJ_CONST(
+        0x8d24cd95, 0x0a355af1, 0x3c543505, 0x44238d30,
+        0x0643d79f, 0x05a59614, 0x2f8ec030, 0xd58977cb,
+        0x001e337a, 0x38093dcd, 0x6c0f386d, 0x0b1293a8,
+        0x4d72c879, 0xd7681924, 0x44e6d2f3, 0x9190117d
+    );
+    secp256k1_gej bj = SECP256K1_GEJ_CONST(
+        0xc7b74206, 0x1f788cd9, 0xabd0937d, 0x164a0d86,
+        0x95f6ff75, 0xf19a4ce9, 0xd013bd7b, 0xbf92d2a7,
+        0xffe1cc85, 0xc7f6c232, 0x93f0c792, 0xf4ed6c57,
+        0xb28d3786, 0x2897e6db, 0xbb192d0b, 0x6e6feab2
+    );
+    secp256k1_gej sumj = SECP256K1_GEJ_CONST(
+        0x671a63c0, 0x3efdad4c, 0x389a7798, 0x24356027,
+        0xb3d69010, 0x278625c3, 0x5c86d390, 0x184a8f7a,
+        0x5f6409c2, 0x2ce01f2b, 0x511fd375, 0x25071d08,
+        0xda651801, 0x70e95caf, 0x8f0d893c, 0xbed8fbbe
+    );
+    secp256k1_ge b;
+    secp256k1_gej resj;
+    secp256k1_ge res;
+    secp256k1_ge_set_gej(&b, &bj);
+
+    secp256k1_gej_add_var(&resj, &aj, &bj, NULL);
+    secp256k1_ge_set_gej(&res, &resj);
+    ge_equals_gej(&res, &sumj);
+
+    secp256k1_gej_add_ge(&resj, &aj, &b);
+    secp256k1_ge_set_gej(&res, &resj);
+    ge_equals_gej(&res, &sumj);
+
+    secp256k1_gej_add_ge_var(&resj, &aj, &b, NULL);
+    secp256k1_ge_set_gej(&res, &resj);
+    ge_equals_gej(&res, &sumj);
+}
+
+void run_ge(void) {
+    int i;
+    for (i = 0; i < count * 32; i++) {
+        test_ge();
+    }
+    test_add_neg_y_diff_x();
+    test_intialized_inf();
+}
+
+void test_ec_combine(void) {
+    secp256k1_scalar sum = SECP256K1_SCALAR_CONST(0, 0, 0, 0, 0, 0, 0, 0);
+    secp256k1_pubkey data[6];
+    const secp256k1_pubkey* d[6];
+    secp256k1_pubkey sd;
+    secp256k1_pubkey sd2;
+    secp256k1_gej Qj;
+    secp256k1_ge Q;
+    int i;
+    for (i = 1; i <= 6; i++) {
+        secp256k1_scalar s;
+        random_scalar_order_test(&s);
+        secp256k1_scalar_add(&sum, &sum, &s);
+        secp256k1_ecmult_gen(&ctx->ecmult_gen_ctx, &Qj, &s);
+        secp256k1_ge_set_gej(&Q, &Qj);
+        secp256k1_pubkey_save(&data[i - 1], &Q);
+        d[i - 1] = &data[i - 1];
+        secp256k1_ecmult_gen(&ctx->ecmult_gen_ctx, &Qj, &sum);
+        secp256k1_ge_set_gej(&Q, &Qj);
+        secp256k1_pubkey_save(&sd, &Q);
+        CHECK(secp256k1_ec_pubkey_combine(ctx, &sd2, d, i) == 1);
+        CHECK(secp256k1_memcmp_var(&sd, &sd2, sizeof(sd)) == 0);
+    }
+}
+
+void run_ec_combine(void) {
+    int i;
+    for (i = 0; i < count * 8; i++) {
+         test_ec_combine();
+    }
+}
+
+void test_group_decompress(const secp256k1_fe* x) {
+    /* The input itself, normalized. */
+    secp256k1_fe fex = *x;
+    secp256k1_fe fez;
+    /* Results of set_xquad_var, set_xo_var(..., 0), set_xo_var(..., 1). */
+    secp256k1_ge ge_quad, ge_even, ge_odd;
+    secp256k1_gej gej_quad;
+    /* Return values of the above calls. */
+    int res_quad, res_even, res_odd;
+
+    secp256k1_fe_normalize_var(&fex);
+
+    res_quad = secp256k1_ge_set_xquad(&ge_quad, &fex);
+    res_even = secp256k1_ge_set_xo_var(&ge_even, &fex, 0);
+    res_odd = secp256k1_ge_set_xo_var(&ge_odd, &fex, 1);
+
+    CHECK(res_quad == res_even);
+    CHECK(res_quad == res_odd);
+
+    if (res_quad) {
+        secp256k1_fe_normalize_var(&ge_quad.x);
+        secp256k1_fe_normalize_var(&ge_odd.x);
+        secp256k1_fe_normalize_var(&ge_even.x);
+        secp256k1_fe_normalize_var(&ge_quad.y);
+        secp256k1_fe_normalize_var(&ge_odd.y);
+        secp256k1_fe_normalize_var(&ge_even.y);
+
+        /* No infinity allowed. */
+        CHECK(!ge_quad.infinity);
+        CHECK(!ge_even.infinity);
+        CHECK(!ge_odd.infinity);
+
+        /* Check that the x coordinates check out. */
+        CHECK(secp256k1_fe_equal_var(&ge_quad.x, x));
+        CHECK(secp256k1_fe_equal_var(&ge_even.x, x));
+        CHECK(secp256k1_fe_equal_var(&ge_odd.x, x));
+
+        /* Check that the Y coordinate result in ge_quad is a square. */
+        CHECK(secp256k1_fe_is_quad_var(&ge_quad.y));
+
+        /* Check odd/even Y in ge_odd, ge_even. */
+        CHECK(secp256k1_fe_is_odd(&ge_odd.y));
+        CHECK(!secp256k1_fe_is_odd(&ge_even.y));
+
+        /* Check secp256k1_gej_has_quad_y_var. */
+        secp256k1_gej_set_ge(&gej_quad, &ge_quad);
+        CHECK(secp256k1_gej_has_quad_y_var(&gej_quad));
+        do {
+            random_fe_test(&fez);
+        } while (secp256k1_fe_is_zero(&fez));
+        secp256k1_gej_rescale(&gej_quad, &fez);
+        CHECK(secp256k1_gej_has_quad_y_var(&gej_quad));
+        secp256k1_gej_neg(&gej_quad, &gej_quad);
+        CHECK(!secp256k1_gej_has_quad_y_var(&gej_quad));
+        do {
+            random_fe_test(&fez);
+        } while (secp256k1_fe_is_zero(&fez));
+        secp256k1_gej_rescale(&gej_quad, &fez);
+        CHECK(!secp256k1_gej_has_quad_y_var(&gej_quad));
+        secp256k1_gej_neg(&gej_quad, &gej_quad);
+        CHECK(secp256k1_gej_has_quad_y_var(&gej_quad));
+    }
+}
+
+void run_group_decompress(void) {
+    int i;
+    for (i = 0; i < count * 4; i++) {
+        secp256k1_fe fe;
+        random_fe_test(&fe);
+        test_group_decompress(&fe);
+    }
+}
+
+/***** ECMULT TESTS *****/
+
+void run_ecmult_chain(void) {
+    /* random starting point A (on the curve) */
+    secp256k1_gej a = SECP256K1_GEJ_CONST(
+        0x8b30bbe9, 0xae2a9906, 0x96b22f67, 0x0709dff3,
+        0x727fd8bc, 0x04d3362c, 0x6c7bf458, 0xe2846004,
+        0xa357ae91, 0x5c4a6528, 0x1309edf2, 0x0504740f,
+        0x0eb33439, 0x90216b4f, 0x81063cb6, 0x5f2f7e0f
+    );
+    /* two random initial factors xn and gn */
+    secp256k1_scalar xn = SECP256K1_SCALAR_CONST(
+        0x84cc5452, 0xf7fde1ed, 0xb4d38a8c, 0xe9b1b84c,
+        0xcef31f14, 0x6e569be9, 0x705d357a, 0x42985407
+    );
+    secp256k1_scalar gn = SECP256K1_SCALAR_CONST(
+        0xa1e58d22, 0x553dcd42, 0xb2398062, 0x5d4c57a9,
+        0x6e9323d4, 0x2b3152e5, 0xca2c3990, 0xedc7c9de
+    );
+    /* two small multipliers to be applied to xn and gn in every iteration: */
+    static const secp256k1_scalar xf = SECP256K1_SCALAR_CONST(0, 0, 0, 0, 0, 0, 0, 0x1337);
+    static const secp256k1_scalar gf = SECP256K1_SCALAR_CONST(0, 0, 0, 0, 0, 0, 0, 0x7113);
+    /* accumulators with the resulting coefficients to A and G */
+    secp256k1_scalar ae = SECP256K1_SCALAR_CONST(0, 0, 0, 0, 0, 0, 0, 1);
+    secp256k1_scalar ge = SECP256K1_SCALAR_CONST(0, 0, 0, 0, 0, 0, 0, 0);
+    /* actual points */
+    secp256k1_gej x;
+    secp256k1_gej x2;
+    int i;
+
+    /* the point being computed */
+    x = a;
+    for (i = 0; i < 200*count; i++) {
+        /* in each iteration, compute X = xn*X + gn*G; */
+        secp256k1_ecmult(&ctx->ecmult_ctx, &x, &x, &xn, &gn);
+        /* also compute ae and ge: the actual accumulated factors for A and G */
+        /* if X was (ae*A+ge*G), xn*X + gn*G results in (xn*ae*A + (xn*ge+gn)*G) */
+        secp256k1_scalar_mul(&ae, &ae, &xn);
+        secp256k1_scalar_mul(&ge, &ge, &xn);
+        secp256k1_scalar_add(&ge, &ge, &gn);
+        /* modify xn and gn */
+        secp256k1_scalar_mul(&xn, &xn, &xf);
+        secp256k1_scalar_mul(&gn, &gn, &gf);
+
+        /* verify */
+        if (i == 19999) {
+            /* expected result after 19999 iterations */
+            secp256k1_gej rp = SECP256K1_GEJ_CONST(
+                0xD6E96687, 0xF9B10D09, 0x2A6F3543, 0x9D86CEBE,
+                0xA4535D0D, 0x409F5358, 0x6440BD74, 0xB933E830,
+                0xB95CBCA2, 0xC77DA786, 0x539BE8FD, 0x53354D2D,
+                0x3B4F566A, 0xE6580454, 0x07ED6015, 0xEE1B2A88
+            );
+
+            secp256k1_gej_neg(&rp, &rp);
+            secp256k1_gej_add_var(&rp, &rp, &x, NULL);
+            CHECK(secp256k1_gej_is_infinity(&rp));
+        }
+    }
+    /* redo the computation, but directly with the resulting ae and ge coefficients: */
+    secp256k1_ecmult(&ctx->ecmult_ctx, &x2, &a, &ae, &ge);
+    secp256k1_gej_neg(&x2, &x2);
+    secp256k1_gej_add_var(&x2, &x2, &x, NULL);
+    CHECK(secp256k1_gej_is_infinity(&x2));
+}
+
+void test_point_times_order(const secp256k1_gej *point) {
+    /* X * (point + G) + (order-X) * (pointer + G) = 0 */
+    secp256k1_scalar x;
+    secp256k1_scalar nx;
+    secp256k1_scalar zero = SECP256K1_SCALAR_CONST(0, 0, 0, 0, 0, 0, 0, 0);
+    secp256k1_scalar one = SECP256K1_SCALAR_CONST(0, 0, 0, 0, 0, 0, 0, 1);
+    secp256k1_gej res1, res2;
+    secp256k1_ge res3;
+    unsigned char pub[65];
+    size_t psize = 65;
+    random_scalar_order_test(&x);
+    secp256k1_scalar_negate(&nx, &x);
+    secp256k1_ecmult(&ctx->ecmult_ctx, &res1, point, &x, &x); /* calc res1 = x * point + x * G; */
+    secp256k1_ecmult(&ctx->ecmult_ctx, &res2, point, &nx, &nx); /* calc res2 = (order - x) * point + (order - x) * G; */
+    secp256k1_gej_add_var(&res1, &res1, &res2, NULL);
+    CHECK(secp256k1_gej_is_infinity(&res1));
+    secp256k1_ge_set_gej(&res3, &res1);
+    CHECK(secp256k1_ge_is_infinity(&res3));
+    CHECK(secp256k1_ge_is_valid_var(&res3) == 0);
+    CHECK(secp256k1_eckey_pubkey_serialize(&res3, pub, &psize, 0) == 0);
+    psize = 65;
+    CHECK(secp256k1_eckey_pubkey_serialize(&res3, pub, &psize, 1) == 0);
+    /* check zero/one edge cases */
+    secp256k1_ecmult(&ctx->ecmult_ctx, &res1, point, &zero, &zero);
+    secp256k1_ge_set_gej(&res3, &res1);
+    CHECK(secp256k1_ge_is_infinity(&res3));
+    secp256k1_ecmult(&ctx->ecmult_ctx, &res1, point, &one, &zero);
+    secp256k1_ge_set_gej(&res3, &res1);
+    ge_equals_gej(&res3, point);
+    secp256k1_ecmult(&ctx->ecmult_ctx, &res1, point, &zero, &one);
+    secp256k1_ge_set_gej(&res3, &res1);
+    ge_equals_ge(&res3, &secp256k1_ge_const_g);
+}
+
+/* These scalars reach large (in absolute value) outputs when fed to secp256k1_scalar_split_lambda.
+ *
+ * They are computed as:
+ * - For a in [-2, -1, 0, 1, 2]:
+ *   - For b in [-3, -1, 1, 3]:
+ *     - Output (a*LAMBDA + (ORDER+b)/2) % ORDER
+ */
+static const secp256k1_scalar scalars_near_split_bounds[20] = {
+    SECP256K1_SCALAR_CONST(0xd938a566, 0x7f479e3e, 0xb5b3c7fa, 0xefdb3749, 0x3aa0585c, 0xc5ea2367, 0xe1b660db, 0x0209e6fc),
+    SECP256K1_SCALAR_CONST(0xd938a566, 0x7f479e3e, 0xb5b3c7fa, 0xefdb3749, 0x3aa0585c, 0xc5ea2367, 0xe1b660db, 0x0209e6fd),
+    SECP256K1_SCALAR_CONST(0xd938a566, 0x7f479e3e, 0xb5b3c7fa, 0xefdb3749, 0x3aa0585c, 0xc5ea2367, 0xe1b660db, 0x0209e6fe),
+    SECP256K1_SCALAR_CONST(0xd938a566, 0x7f479e3e, 0xb5b3c7fa, 0xefdb3749, 0x3aa0585c, 0xc5ea2367, 0xe1b660db, 0x0209e6ff),
+    SECP256K1_SCALAR_CONST(0x2c9c52b3, 0x3fa3cf1f, 0x5ad9e3fd, 0x77ed9ba5, 0xb294b893, 0x3722e9a5, 0x00e698ca, 0x4cf7632d),
+    SECP256K1_SCALAR_CONST(0x2c9c52b3, 0x3fa3cf1f, 0x5ad9e3fd, 0x77ed9ba5, 0xb294b893, 0x3722e9a5, 0x00e698ca, 0x4cf7632e),
+    SECP256K1_SCALAR_CONST(0x2c9c52b3, 0x3fa3cf1f, 0x5ad9e3fd, 0x77ed9ba5, 0xb294b893, 0x3722e9a5, 0x00e698ca, 0x4cf7632f),
+    SECP256K1_SCALAR_CONST(0x2c9c52b3, 0x3fa3cf1f, 0x5ad9e3fd, 0x77ed9ba5, 0xb294b893, 0x3722e9a5, 0x00e698ca, 0x4cf76330),
+    SECP256K1_SCALAR_CONST(0x7fffffff, 0xffffffff, 0xffffffff, 0xffffffff, 0xd576e735, 0x57a4501d, 0xdfe92f46, 0x681b209f),
+    SECP256K1_SCALAR_CONST(0x7fffffff, 0xffffffff, 0xffffffff, 0xffffffff, 0xd576e735, 0x57a4501d, 0xdfe92f46, 0x681b20a0),
+    SECP256K1_SCALAR_CONST(0x7fffffff, 0xffffffff, 0xffffffff, 0xffffffff, 0xd576e735, 0x57a4501d, 0xdfe92f46, 0x681b20a1),
+    SECP256K1_SCALAR_CONST(0x7fffffff, 0xffffffff, 0xffffffff, 0xffffffff, 0xd576e735, 0x57a4501d, 0xdfe92f46, 0x681b20a2),
+    SECP256K1_SCALAR_CONST(0xd363ad4c, 0xc05c30e0, 0xa5261c02, 0x88126459, 0xf85915d7, 0x7825b696, 0xbeebc5c2, 0x833ede11),
+    SECP256K1_SCALAR_CONST(0xd363ad4c, 0xc05c30e0, 0xa5261c02, 0x88126459, 0xf85915d7, 0x7825b696, 0xbeebc5c2, 0x833ede12),
+    SECP256K1_SCALAR_CONST(0xd363ad4c, 0xc05c30e0, 0xa5261c02, 0x88126459, 0xf85915d7, 0x7825b696, 0xbeebc5c2, 0x833ede13),
+    SECP256K1_SCALAR_CONST(0xd363ad4c, 0xc05c30e0, 0xa5261c02, 0x88126459, 0xf85915d7, 0x7825b696, 0xbeebc5c2, 0x833ede14),
+    SECP256K1_SCALAR_CONST(0x26c75a99, 0x80b861c1, 0x4a4c3805, 0x1024c8b4, 0x704d760e, 0xe95e7cd3, 0xde1bfdb1, 0xce2c5a42),
+    SECP256K1_SCALAR_CONST(0x26c75a99, 0x80b861c1, 0x4a4c3805, 0x1024c8b4, 0x704d760e, 0xe95e7cd3, 0xde1bfdb1, 0xce2c5a43),
+    SECP256K1_SCALAR_CONST(0x26c75a99, 0x80b861c1, 0x4a4c3805, 0x1024c8b4, 0x704d760e, 0xe95e7cd3, 0xde1bfdb1, 0xce2c5a44),
+    SECP256K1_SCALAR_CONST(0x26c75a99, 0x80b861c1, 0x4a4c3805, 0x1024c8b4, 0x704d760e, 0xe95e7cd3, 0xde1bfdb1, 0xce2c5a45)
+};
+
+void test_ecmult_target(const secp256k1_scalar* target, int mode) {
+    /* Mode: 0=ecmult_gen, 1=ecmult, 2=ecmult_const */
+    secp256k1_scalar n1, n2;
+    secp256k1_ge p;
+    secp256k1_gej pj, p1j, p2j, ptj;
+    static const secp256k1_scalar zero = SECP256K1_SCALAR_CONST(0, 0, 0, 0, 0, 0, 0, 0);
+
+    /* Generate random n1,n2 such that n1+n2 = -target. */
+    random_scalar_order_test(&n1);
+    secp256k1_scalar_add(&n2, &n1, target);
+    secp256k1_scalar_negate(&n2, &n2);
+
+    /* Generate a random input point. */
+    if (mode != 0) {
+        random_group_element_test(&p);
+        secp256k1_gej_set_ge(&pj, &p);
+    }
+
+    /* EC multiplications */
+    if (mode == 0) {
+        secp256k1_ecmult_gen(&ctx->ecmult_gen_ctx, &p1j, &n1);
+        secp256k1_ecmult_gen(&ctx->ecmult_gen_ctx, &p2j, &n2);
+        secp256k1_ecmult_gen(&ctx->ecmult_gen_ctx, &ptj, target);
+    } else if (mode == 1) {
+        secp256k1_ecmult(&ctx->ecmult_ctx, &p1j, &pj, &n1, &zero);
+        secp256k1_ecmult(&ctx->ecmult_ctx, &p2j, &pj, &n2, &zero);
+        secp256k1_ecmult(&ctx->ecmult_ctx, &ptj, &pj, target, &zero);
+    } else {
+        secp256k1_ecmult_const(&p1j, &p, &n1, 256);
+        secp256k1_ecmult_const(&p2j, &p, &n2, 256);
+        secp256k1_ecmult_const(&ptj, &p, target, 256);
+    }
+
+    /* Add them all up: n1*P + n2*P + target*P = (n1+n2+target)*P = (n1+n1-n1-n2)*P = 0. */
+    secp256k1_gej_add_var(&ptj, &ptj, &p1j, NULL);
+    secp256k1_gej_add_var(&ptj, &ptj, &p2j, NULL);
+    CHECK(secp256k1_gej_is_infinity(&ptj));
+}
+
+void run_ecmult_near_split_bound(void) {
+    int i;
+    unsigned j;
+    for (i = 0; i < 4*count; ++i) {
+        for (j = 0; j < sizeof(scalars_near_split_bounds) / sizeof(scalars_near_split_bounds[0]); ++j) {
+            test_ecmult_target(&scalars_near_split_bounds[j], 0);
+            test_ecmult_target(&scalars_near_split_bounds[j], 1);
+            test_ecmult_target(&scalars_near_split_bounds[j], 2);
+        }
+    }
+}
+
+void run_point_times_order(void) {
+    int i;
+    secp256k1_fe x = SECP256K1_FE_CONST(0, 0, 0, 0, 0, 0, 0, 2);
+    static const secp256k1_fe xr = SECP256K1_FE_CONST(
+        0x7603CB59, 0xB0EF6C63, 0xFE608479, 0x2A0C378C,
+        0xDB3233A8, 0x0F8A9A09, 0xA877DEAD, 0x31B38C45
+    );
+    for (i = 0; i < 500; i++) {
+        secp256k1_ge p;
+        if (secp256k1_ge_set_xo_var(&p, &x, 1)) {
+            secp256k1_gej j;
+            CHECK(secp256k1_ge_is_valid_var(&p));
+            secp256k1_gej_set_ge(&j, &p);
+            test_point_times_order(&j);
+        }
+        secp256k1_fe_sqr(&x, &x);
+    }
+    secp256k1_fe_normalize_var(&x);
+    CHECK(secp256k1_fe_equal_var(&x, &xr));
+}
+
+void ecmult_const_random_mult(void) {
+    /* random starting point A (on the curve) */
+    secp256k1_ge a = SECP256K1_GE_CONST(
+        0x6d986544, 0x57ff52b8, 0xcf1b8126, 0x5b802a5b,
+        0xa97f9263, 0xb1e88044, 0x93351325, 0x91bc450a,
+        0x535c59f7, 0x325e5d2b, 0xc391fbe8, 0x3c12787c,
+        0x337e4a98, 0xe82a9011, 0x0123ba37, 0xdd769c7d
+    );
+    /* random initial factor xn */
+    secp256k1_scalar xn = SECP256K1_SCALAR_CONST(
+        0x649d4f77, 0xc4242df7, 0x7f2079c9, 0x14530327,
+        0xa31b876a, 0xd2d8ce2a, 0x2236d5c6, 0xd7b2029b
+    );
+    /* expected xn * A (from sage) */
+    secp256k1_ge expected_b = SECP256K1_GE_CONST(
+        0x23773684, 0x4d209dc7, 0x098a786f, 0x20d06fcd,
+        0x070a38bf, 0xc11ac651, 0x03004319, 0x1e2a8786,
+        0xed8c3b8e, 0xc06dd57b, 0xd06ea66e, 0x45492b0f,
+        0xb84e4e1b, 0xfb77e21f, 0x96baae2a, 0x63dec956
+    );
+    secp256k1_gej b;
+    secp256k1_ecmult_const(&b, &a, &xn, 256);
+
+    CHECK(secp256k1_ge_is_valid_var(&a));
+    ge_equals_gej(&expected_b, &b);
+}
+
+void ecmult_const_commutativity(void) {
+    secp256k1_scalar a;
+    secp256k1_scalar b;
+    secp256k1_gej res1;
+    secp256k1_gej res2;
+    secp256k1_ge mid1;
+    secp256k1_ge mid2;
+    random_scalar_order_test(&a);
+    random_scalar_order_test(&b);
+
+    secp256k1_ecmult_const(&res1, &secp256k1_ge_const_g, &a, 256);
+    secp256k1_ecmult_const(&res2, &secp256k1_ge_const_g, &b, 256);
+    secp256k1_ge_set_gej(&mid1, &res1);
+    secp256k1_ge_set_gej(&mid2, &res2);
+    secp256k1_ecmult_const(&res1, &mid1, &b, 256);
+    secp256k1_ecmult_const(&res2, &mid2, &a, 256);
+    secp256k1_ge_set_gej(&mid1, &res1);
+    secp256k1_ge_set_gej(&mid2, &res2);
+    ge_equals_ge(&mid1, &mid2);
+}
+
+void ecmult_const_mult_zero_one(void) {
+    secp256k1_scalar zero = SECP256K1_SCALAR_CONST(0, 0, 0, 0, 0, 0, 0, 0);
+    secp256k1_scalar one = SECP256K1_SCALAR_CONST(0, 0, 0, 0, 0, 0, 0, 1);
+    secp256k1_scalar negone;
+    secp256k1_gej res1;
+    secp256k1_ge res2;
+    secp256k1_ge point;
+    secp256k1_scalar_negate(&negone, &one);
+
+    random_group_element_test(&point);
+    secp256k1_ecmult_const(&res1, &point, &zero, 3);
+    secp256k1_ge_set_gej(&res2, &res1);
+    CHECK(secp256k1_ge_is_infinity(&res2));
+    secp256k1_ecmult_const(&res1, &point, &one, 2);
+    secp256k1_ge_set_gej(&res2, &res1);
+    ge_equals_ge(&res2, &point);
+    secp256k1_ecmult_const(&res1, &point, &negone, 256);
+    secp256k1_gej_neg(&res1, &res1);
+    secp256k1_ge_set_gej(&res2, &res1);
+    ge_equals_ge(&res2, &point);
+}
+
+void ecmult_const_chain_multiply(void) {
+    /* Check known result (randomly generated test problem from sage) */
+    const secp256k1_scalar scalar = SECP256K1_SCALAR_CONST(
+        0x4968d524, 0x2abf9b7a, 0x466abbcf, 0x34b11b6d,
+        0xcd83d307, 0x827bed62, 0x05fad0ce, 0x18fae63b
+    );
+    const secp256k1_gej expected_point = SECP256K1_GEJ_CONST(
+        0x5494c15d, 0x32099706, 0xc2395f94, 0x348745fd,
+        0x757ce30e, 0x4e8c90fb, 0xa2bad184, 0xf883c69f,
+        0x5d195d20, 0xe191bf7f, 0x1be3e55f, 0x56a80196,
+        0x6071ad01, 0xf1462f66, 0xc997fa94, 0xdb858435
+    );
+    secp256k1_gej point;
+    secp256k1_ge res;
+    int i;
+
+    secp256k1_gej_set_ge(&point, &secp256k1_ge_const_g);
+    for (i = 0; i < 100; ++i) {
+        secp256k1_ge tmp;
+        secp256k1_ge_set_gej(&tmp, &point);
+        secp256k1_ecmult_const(&point, &tmp, &scalar, 256);
+    }
+    secp256k1_ge_set_gej(&res, &point);
+    ge_equals_gej(&res, &expected_point);
+}
+
+void run_ecmult_const_tests(void) {
+    ecmult_const_mult_zero_one();
+    ecmult_const_random_mult();
+    ecmult_const_commutativity();
+    ecmult_const_chain_multiply();
+}
+
+typedef struct {
+    secp256k1_scalar *sc;
+    secp256k1_ge *pt;
+} ecmult_multi_data;
+
+static int ecmult_multi_callback(secp256k1_scalar *sc, secp256k1_ge *pt, size_t idx, void *cbdata) {
+    ecmult_multi_data *data = (ecmult_multi_data*) cbdata;
+    *sc = data->sc[idx];
+    *pt = data->pt[idx];
+    return 1;
+}
+
+static int ecmult_multi_false_callback(secp256k1_scalar *sc, secp256k1_ge *pt, size_t idx, void *cbdata) {
+    (void)sc;
+    (void)pt;
+    (void)idx;
+    (void)cbdata;
+    return 0;
+}
+
+void test_ecmult_multi(secp256k1_scratch *scratch, secp256k1_ecmult_multi_func ecmult_multi) {
+    int ncount;
+    secp256k1_scalar szero;
+    secp256k1_scalar sc[32];
+    secp256k1_ge pt[32];
+    secp256k1_gej r;
+    secp256k1_gej r2;
+    ecmult_multi_data data;
+
+    data.sc = sc;
+    data.pt = pt;
+    secp256k1_scalar_set_int(&szero, 0);
+
+    /* No points to multiply */
+    CHECK(ecmult_multi(&ctx->error_callback, &ctx->ecmult_ctx, scratch, &r, NULL, ecmult_multi_callback, &data, 0));
+
+    /* Check 1- and 2-point multiplies against ecmult */
+    for (ncount = 0; ncount < count; ncount++) {
+        secp256k1_ge ptg;
+        secp256k1_gej ptgj;
+        random_scalar_order(&sc[0]);
+        random_scalar_order(&sc[1]);
+
+        random_group_element_test(&ptg);
+        secp256k1_gej_set_ge(&ptgj, &ptg);
+        pt[0] = ptg;
+        pt[1] = secp256k1_ge_const_g;
+
+        /* only G scalar */
+        secp256k1_ecmult(&ctx->ecmult_ctx, &r2, &ptgj, &szero, &sc[0]);
+        CHECK(ecmult_multi(&ctx->error_callback, &ctx->ecmult_ctx, scratch, &r, &sc[0], ecmult_multi_callback, &data, 0));
+        secp256k1_gej_neg(&r2, &r2);
+        secp256k1_gej_add_var(&r, &r, &r2, NULL);
+        CHECK(secp256k1_gej_is_infinity(&r));
+
+        /* 1-point */
+        secp256k1_ecmult(&ctx->ecmult_ctx, &r2, &ptgj, &sc[0], &szero);
+        CHECK(ecmult_multi(&ctx->error_callback, &ctx->ecmult_ctx, scratch, &r, &szero, ecmult_multi_callback, &data, 1));
+        secp256k1_gej_neg(&r2, &r2);
+        secp256k1_gej_add_var(&r, &r, &r2, NULL);
+        CHECK(secp256k1_gej_is_infinity(&r));
+
+        /* Try to multiply 1 point, but callback returns false */
+        CHECK(!ecmult_multi(&ctx->error_callback, &ctx->ecmult_ctx, scratch, &r, &szero, ecmult_multi_false_callback, &data, 1));
+
+        /* 2-point */
+        secp256k1_ecmult(&ctx->ecmult_ctx, &r2, &ptgj, &sc[0], &sc[1]);
+        CHECK(ecmult_multi(&ctx->error_callback, &ctx->ecmult_ctx, scratch, &r, &szero, ecmult_multi_callback, &data, 2));
+        secp256k1_gej_neg(&r2, &r2);
+        secp256k1_gej_add_var(&r, &r, &r2, NULL);
+        CHECK(secp256k1_gej_is_infinity(&r));
+
+        /* 2-point with G scalar */
+        secp256k1_ecmult(&ctx->ecmult_ctx, &r2, &ptgj, &sc[0], &sc[1]);
+        CHECK(ecmult_multi(&ctx->error_callback, &ctx->ecmult_ctx, scratch, &r, &sc[1], ecmult_multi_callback, &data, 1));
+        secp256k1_gej_neg(&r2, &r2);
+        secp256k1_gej_add_var(&r, &r, &r2, NULL);
+        CHECK(secp256k1_gej_is_infinity(&r));
+    }
+
+    /* Check infinite outputs of various forms */
+    for (ncount = 0; ncount < count; ncount++) {
+        secp256k1_ge ptg;
+        size_t i, j;
+        size_t sizes[] = { 2, 10, 32 };
+
+        for (j = 0; j < 3; j++) {
+            for (i = 0; i < 32; i++) {
+                random_scalar_order(&sc[i]);
+                secp256k1_ge_set_infinity(&pt[i]);
+            }
+            CHECK(ecmult_multi(&ctx->error_callback, &ctx->ecmult_ctx, scratch, &r, &szero, ecmult_multi_callback, &data, sizes[j]));
+            CHECK(secp256k1_gej_is_infinity(&r));
+        }
+
+        for (j = 0; j < 3; j++) {
+            for (i = 0; i < 32; i++) {
+                random_group_element_test(&ptg);
+                pt[i] = ptg;
+                secp256k1_scalar_set_int(&sc[i], 0);
+            }
+            CHECK(ecmult_multi(&ctx->error_callback, &ctx->ecmult_ctx, scratch, &r, &szero, ecmult_multi_callback, &data, sizes[j]));
+            CHECK(secp256k1_gej_is_infinity(&r));
+        }
+
+        for (j = 0; j < 3; j++) {
+            random_group_element_test(&ptg);
+            for (i = 0; i < 16; i++) {
+                random_scalar_order(&sc[2*i]);
+                secp256k1_scalar_negate(&sc[2*i + 1], &sc[2*i]);
+                pt[2 * i] = ptg;
+                pt[2 * i + 1] = ptg;
+            }
+
+            CHECK(ecmult_multi(&ctx->error_callback, &ctx->ecmult_ctx, scratch, &r, &szero, ecmult_multi_callback, &data, sizes[j]));
+            CHECK(secp256k1_gej_is_infinity(&r));
+
+            random_scalar_order(&sc[0]);
+            for (i = 0; i < 16; i++) {
+                random_group_element_test(&ptg);
+
+                sc[2*i] = sc[0];
+                sc[2*i+1] = sc[0];
+                pt[2 * i] = ptg;
+                secp256k1_ge_neg(&pt[2*i+1], &pt[2*i]);
+            }
+
+            CHECK(ecmult_multi(&ctx->error_callback, &ctx->ecmult_ctx, scratch, &r, &szero, ecmult_multi_callback, &data, sizes[j]));
+            CHECK(secp256k1_gej_is_infinity(&r));
+        }
+
+        random_group_element_test(&ptg);
+        secp256k1_scalar_set_int(&sc[0], 0);
+        pt[0] = ptg;
+        for (i = 1; i < 32; i++) {
+            pt[i] = ptg;
+
+            random_scalar_order(&sc[i]);
+            secp256k1_scalar_add(&sc[0], &sc[0], &sc[i]);
+            secp256k1_scalar_negate(&sc[i], &sc[i]);
+        }
+
+        CHECK(ecmult_multi(&ctx->error_callback, &ctx->ecmult_ctx, scratch, &r, &szero, ecmult_multi_callback, &data, 32));
+        CHECK(secp256k1_gej_is_infinity(&r));
+    }
+
+    /* Check random points, constant scalar */
+    for (ncount = 0; ncount < count; ncount++) {
+        size_t i;
+        secp256k1_gej_set_infinity(&r);
+
+        random_scalar_order(&sc[0]);
+        for (i = 0; i < 20; i++) {
+            secp256k1_ge ptg;
+            sc[i] = sc[0];
+            random_group_element_test(&ptg);
+            pt[i] = ptg;
+            secp256k1_gej_add_ge_var(&r, &r, &pt[i], NULL);
+        }
+
+        secp256k1_ecmult(&ctx->ecmult_ctx, &r2, &r, &sc[0], &szero);
+        CHECK(ecmult_multi(&ctx->error_callback, &ctx->ecmult_ctx, scratch, &r, &szero, ecmult_multi_callback, &data, 20));
+        secp256k1_gej_neg(&r2, &r2);
+        secp256k1_gej_add_var(&r, &r, &r2, NULL);
+        CHECK(secp256k1_gej_is_infinity(&r));
+    }
+
+    /* Check random scalars, constant point */
+    for (ncount = 0; ncount < count; ncount++) {
+        size_t i;
+        secp256k1_ge ptg;
+        secp256k1_gej p0j;
+        secp256k1_scalar rs;
+        secp256k1_scalar_set_int(&rs, 0);
+
+        random_group_element_test(&ptg);
+        for (i = 0; i < 20; i++) {
+            random_scalar_order(&sc[i]);
+            pt[i] = ptg;
+            secp256k1_scalar_add(&rs, &rs, &sc[i]);
+        }
+
+        secp256k1_gej_set_ge(&p0j, &pt[0]);
+        secp256k1_ecmult(&ctx->ecmult_ctx, &r2, &p0j, &rs, &szero);
+        CHECK(ecmult_multi(&ctx->error_callback, &ctx->ecmult_ctx, scratch, &r, &szero, ecmult_multi_callback, &data, 20));
+        secp256k1_gej_neg(&r2, &r2);
+        secp256k1_gej_add_var(&r, &r, &r2, NULL);
+        CHECK(secp256k1_gej_is_infinity(&r));
+    }
+
+    /* Sanity check that zero scalars don't cause problems */
+    for (ncount = 0; ncount < 20; ncount++) {
+        random_scalar_order(&sc[ncount]);
+        random_group_element_test(&pt[ncount]);
+    }
+
+    secp256k1_scalar_clear(&sc[0]);
+    CHECK(ecmult_multi(&ctx->error_callback, &ctx->ecmult_ctx, scratch, &r, &szero, ecmult_multi_callback, &data, 20));
+    secp256k1_scalar_clear(&sc[1]);
+    secp256k1_scalar_clear(&sc[2]);
+    secp256k1_scalar_clear(&sc[3]);
+    secp256k1_scalar_clear(&sc[4]);
+    CHECK(ecmult_multi(&ctx->error_callback, &ctx->ecmult_ctx, scratch, &r, &szero, ecmult_multi_callback, &data, 6));
+    CHECK(ecmult_multi(&ctx->error_callback, &ctx->ecmult_ctx, scratch, &r, &szero, ecmult_multi_callback, &data, 5));
+    CHECK(secp256k1_gej_is_infinity(&r));
+
+    /* Run through s0*(t0*P) + s1*(t1*P) exhaustively for many small values of s0, s1, t0, t1 */
+    {
+        const size_t TOP = 8;
+        size_t s0i, s1i;
+        size_t t0i, t1i;
+        secp256k1_ge ptg;
+        secp256k1_gej ptgj;
+
+        random_group_element_test(&ptg);
+        secp256k1_gej_set_ge(&ptgj, &ptg);
+
+        for(t0i = 0; t0i < TOP; t0i++) {
+            for(t1i = 0; t1i < TOP; t1i++) {
+                secp256k1_gej t0p, t1p;
+                secp256k1_scalar t0, t1;
+
+                secp256k1_scalar_set_int(&t0, (t0i + 1) / 2);
+                secp256k1_scalar_cond_negate(&t0, t0i & 1);
+                secp256k1_scalar_set_int(&t1, (t1i + 1) / 2);
+                secp256k1_scalar_cond_negate(&t1, t1i & 1);
+
+                secp256k1_ecmult(&ctx->ecmult_ctx, &t0p, &ptgj, &t0, &szero);
+                secp256k1_ecmult(&ctx->ecmult_ctx, &t1p, &ptgj, &t1, &szero);
+
+                for(s0i = 0; s0i < TOP; s0i++) {
+                    for(s1i = 0; s1i < TOP; s1i++) {
+                        secp256k1_scalar tmp1, tmp2;
+                        secp256k1_gej expected, actual;
+
+                        secp256k1_ge_set_gej(&pt[0], &t0p);
+                        secp256k1_ge_set_gej(&pt[1], &t1p);
+
+                        secp256k1_scalar_set_int(&sc[0], (s0i + 1) / 2);
+                        secp256k1_scalar_cond_negate(&sc[0], s0i & 1);
+                        secp256k1_scalar_set_int(&sc[1], (s1i + 1) / 2);
+                        secp256k1_scalar_cond_negate(&sc[1], s1i & 1);
+
+                        secp256k1_scalar_mul(&tmp1, &t0, &sc[0]);
+                        secp256k1_scalar_mul(&tmp2, &t1, &sc[1]);
+                        secp256k1_scalar_add(&tmp1, &tmp1, &tmp2);
+
+                        secp256k1_ecmult(&ctx->ecmult_ctx, &expected, &ptgj, &tmp1, &szero);
+                        CHECK(ecmult_multi(&ctx->error_callback, &ctx->ecmult_ctx, scratch, &actual, &szero, ecmult_multi_callback, &data, 2));
+                        secp256k1_gej_neg(&expected, &expected);
+                        secp256k1_gej_add_var(&actual, &actual, &expected, NULL);
+                        CHECK(secp256k1_gej_is_infinity(&actual));
+                    }
+                }
+            }
+        }
+    }
+}
+
+void test_ecmult_multi_batch_single(secp256k1_ecmult_multi_func ecmult_multi) {
+    secp256k1_scalar szero;
+    secp256k1_scalar sc;
+    secp256k1_ge pt;
+    secp256k1_gej r;
+    ecmult_multi_data data;
+    secp256k1_scratch *scratch_empty;
+
+    random_group_element_test(&pt);
+    random_scalar_order(&sc);
+    data.sc = &sc;
+    data.pt = &pt;
+    secp256k1_scalar_set_int(&szero, 0);
+
+    /* Try to multiply 1 point, but scratch space is empty.*/
+    scratch_empty = secp256k1_scratch_create(&ctx->error_callback, 0);
+    CHECK(!ecmult_multi(&ctx->error_callback, &ctx->ecmult_ctx, scratch_empty, &r, &szero, ecmult_multi_callback, &data, 1));
+    secp256k1_scratch_destroy(&ctx->error_callback, scratch_empty);
+}
+
+void test_secp256k1_pippenger_bucket_window_inv(void) {
+    int i;
+
+    CHECK(secp256k1_pippenger_bucket_window_inv(0) == 0);
+    for(i = 1; i <= PIPPENGER_MAX_BUCKET_WINDOW; i++) {
+        /* Bucket_window of 8 is not used with endo */
+        if (i == 8) {
+            continue;
+        }
+        CHECK(secp256k1_pippenger_bucket_window(secp256k1_pippenger_bucket_window_inv(i)) == i);
+        if (i != PIPPENGER_MAX_BUCKET_WINDOW) {
+            CHECK(secp256k1_pippenger_bucket_window(secp256k1_pippenger_bucket_window_inv(i)+1) > i);
+        }
+    }
+}
+
+/**
+ * Probabilistically test the function returning the maximum number of possible points
+ * for a given scratch space.
+ */
+void test_ecmult_multi_pippenger_max_points(void) {
+    size_t scratch_size = secp256k1_testrand_int(256);
+    size_t max_size = secp256k1_pippenger_scratch_size(secp256k1_pippenger_bucket_window_inv(PIPPENGER_MAX_BUCKET_WINDOW-1)+512, 12);
+    secp256k1_scratch *scratch;
+    size_t n_points_supported;
+    int bucket_window = 0;
+
+    for(; scratch_size < max_size; scratch_size+=256) {
+        size_t i;
+        size_t total_alloc;
+        size_t checkpoint;
+        scratch = secp256k1_scratch_create(&ctx->error_callback, scratch_size);
+        CHECK(scratch != NULL);
+        checkpoint = secp256k1_scratch_checkpoint(&ctx->error_callback, scratch);
+        n_points_supported = secp256k1_pippenger_max_points(&ctx->error_callback, scratch);
+        if (n_points_supported == 0) {
+            secp256k1_scratch_destroy(&ctx->error_callback, scratch);
+            continue;
+        }
+        bucket_window = secp256k1_pippenger_bucket_window(n_points_supported);
+        /* allocate `total_alloc` bytes over `PIPPENGER_SCRATCH_OBJECTS` many allocations */
+        total_alloc = secp256k1_pippenger_scratch_size(n_points_supported, bucket_window);
+        for (i = 0; i < PIPPENGER_SCRATCH_OBJECTS - 1; i++) {
+            CHECK(secp256k1_scratch_alloc(&ctx->error_callback, scratch, 1));
+            total_alloc--;
+        }
+        CHECK(secp256k1_scratch_alloc(&ctx->error_callback, scratch, total_alloc));
+        secp256k1_scratch_apply_checkpoint(&ctx->error_callback, scratch, checkpoint);
+        secp256k1_scratch_destroy(&ctx->error_callback, scratch);
+    }
+    CHECK(bucket_window == PIPPENGER_MAX_BUCKET_WINDOW);
+}
+
+void test_ecmult_multi_batch_size_helper(void) {
+    size_t n_batches, n_batch_points, max_n_batch_points, n;
+
+    max_n_batch_points = 0;
+    n = 1;
+    CHECK(secp256k1_ecmult_multi_batch_size_helper(&n_batches, &n_batch_points, max_n_batch_points, n) == 0);
+
+    max_n_batch_points = 1;
+    n = 0;
+    CHECK(secp256k1_ecmult_multi_batch_size_helper(&n_batches, &n_batch_points, max_n_batch_points, n) == 1);
+    CHECK(n_batches == 0);
+    CHECK(n_batch_points == 0);
+
+    max_n_batch_points = 2;
+    n = 5;
+    CHECK(secp256k1_ecmult_multi_batch_size_helper(&n_batches, &n_batch_points, max_n_batch_points, n) == 1);
+    CHECK(n_batches == 3);
+    CHECK(n_batch_points == 2);
+
+    max_n_batch_points = ECMULT_MAX_POINTS_PER_BATCH;
+    n = ECMULT_MAX_POINTS_PER_BATCH;
+    CHECK(secp256k1_ecmult_multi_batch_size_helper(&n_batches, &n_batch_points, max_n_batch_points, n) == 1);
+    CHECK(n_batches == 1);
+    CHECK(n_batch_points == ECMULT_MAX_POINTS_PER_BATCH);
+
+    max_n_batch_points = ECMULT_MAX_POINTS_PER_BATCH + 1;
+    n = ECMULT_MAX_POINTS_PER_BATCH + 1;
+    CHECK(secp256k1_ecmult_multi_batch_size_helper(&n_batches, &n_batch_points, max_n_batch_points, n) == 1);
+    CHECK(n_batches == 2);
+    CHECK(n_batch_points == ECMULT_MAX_POINTS_PER_BATCH/2 + 1);
+
+    max_n_batch_points = 1;
+    n = SIZE_MAX;
+    CHECK(secp256k1_ecmult_multi_batch_size_helper(&n_batches, &n_batch_points, max_n_batch_points, n) == 1);
+    CHECK(n_batches == SIZE_MAX);
+    CHECK(n_batch_points == 1);
+
+    max_n_batch_points = 2;
+    n = SIZE_MAX;
+    CHECK(secp256k1_ecmult_multi_batch_size_helper(&n_batches, &n_batch_points, max_n_batch_points, n) == 1);
+    CHECK(n_batches == SIZE_MAX/2 + 1);
+    CHECK(n_batch_points == 2);
+}
+
+/**
+ * Run secp256k1_ecmult_multi_var with num points and a scratch space restricted to
+ * 1 <= i <= num points.
+ */
+void test_ecmult_multi_batching(void) {
+    static const int n_points = 2*ECMULT_PIPPENGER_THRESHOLD;
+    secp256k1_scalar scG;
+    secp256k1_scalar szero;
+    secp256k1_scalar *sc = (secp256k1_scalar *)checked_malloc(&ctx->error_callback, sizeof(secp256k1_scalar) * n_points);
+    secp256k1_ge *pt = (secp256k1_ge *)checked_malloc(&ctx->error_callback, sizeof(secp256k1_ge) * n_points);
+    secp256k1_gej r;
+    secp256k1_gej r2;
+    ecmult_multi_data data;
+    int i;
+    secp256k1_scratch *scratch;
+
+    secp256k1_gej_set_infinity(&r2);
+    secp256k1_scalar_set_int(&szero, 0);
+
+    /* Get random scalars and group elements and compute result */
+    random_scalar_order(&scG);
+    secp256k1_ecmult(&ctx->ecmult_ctx, &r2, &r2, &szero, &scG);
+    for(i = 0; i < n_points; i++) {
+        secp256k1_ge ptg;
+        secp256k1_gej ptgj;
+        random_group_element_test(&ptg);
+        secp256k1_gej_set_ge(&ptgj, &ptg);
+        pt[i] = ptg;
+        random_scalar_order(&sc[i]);
+        secp256k1_ecmult(&ctx->ecmult_ctx, &ptgj, &ptgj, &sc[i], NULL);
+        secp256k1_gej_add_var(&r2, &r2, &ptgj, NULL);
+    }
+    data.sc = sc;
+    data.pt = pt;
+    secp256k1_gej_neg(&r2, &r2);
+
+    /* Test with empty scratch space. It should compute the correct result using
+     * ecmult_mult_simple algorithm which doesn't require a scratch space. */
+    scratch = secp256k1_scratch_create(&ctx->error_callback, 0);
+    CHECK(secp256k1_ecmult_multi_var(&ctx->error_callback, &ctx->ecmult_ctx, scratch, &r, &scG, ecmult_multi_callback, &data, n_points));
+    secp256k1_gej_add_var(&r, &r, &r2, NULL);
+    CHECK(secp256k1_gej_is_infinity(&r));
+    secp256k1_scratch_destroy(&ctx->error_callback, scratch);
+
+    /* Test with space for 1 point in pippenger. That's not enough because
+     * ecmult_multi selects strauss which requires more memory. It should
+     * therefore select the simple algorithm. */
+    scratch = secp256k1_scratch_create(&ctx->error_callback, secp256k1_pippenger_scratch_size(1, 1) + PIPPENGER_SCRATCH_OBJECTS*ALIGNMENT);
+    CHECK(secp256k1_ecmult_multi_var(&ctx->error_callback, &ctx->ecmult_ctx, scratch, &r, &scG, ecmult_multi_callback, &data, n_points));
+    secp256k1_gej_add_var(&r, &r, &r2, NULL);
+    CHECK(secp256k1_gej_is_infinity(&r));
+    secp256k1_scratch_destroy(&ctx->error_callback, scratch);
+
+    for(i = 1; i <= n_points; i++) {
+        if (i > ECMULT_PIPPENGER_THRESHOLD) {
+            int bucket_window = secp256k1_pippenger_bucket_window(i);
+            size_t scratch_size = secp256k1_pippenger_scratch_size(i, bucket_window);
+            scratch = secp256k1_scratch_create(&ctx->error_callback, scratch_size + PIPPENGER_SCRATCH_OBJECTS*ALIGNMENT);
+        } else {
+            size_t scratch_size = secp256k1_strauss_scratch_size(i);
+            scratch = secp256k1_scratch_create(&ctx->error_callback, scratch_size + STRAUSS_SCRATCH_OBJECTS*ALIGNMENT);
+        }
+        CHECK(secp256k1_ecmult_multi_var(&ctx->error_callback, &ctx->ecmult_ctx, scratch, &r, &scG, ecmult_multi_callback, &data, n_points));
+        secp256k1_gej_add_var(&r, &r, &r2, NULL);
+        CHECK(secp256k1_gej_is_infinity(&r));
+        secp256k1_scratch_destroy(&ctx->error_callback, scratch);
+    }
+    free(sc);
+    free(pt);
+}
+
+void run_ecmult_multi_tests(void) {
+    secp256k1_scratch *scratch;
+
+    test_secp256k1_pippenger_bucket_window_inv();
+    test_ecmult_multi_pippenger_max_points();
+    scratch = secp256k1_scratch_create(&ctx->error_callback, 819200);
+    test_ecmult_multi(scratch, secp256k1_ecmult_multi_var);
+    test_ecmult_multi(NULL, secp256k1_ecmult_multi_var);
+    test_ecmult_multi(scratch, secp256k1_ecmult_pippenger_batch_single);
+    test_ecmult_multi_batch_single(secp256k1_ecmult_pippenger_batch_single);
+    test_ecmult_multi(scratch, secp256k1_ecmult_strauss_batch_single);
+    test_ecmult_multi_batch_single(secp256k1_ecmult_strauss_batch_single);
+    secp256k1_scratch_destroy(&ctx->error_callback, scratch);
+
+    /* Run test_ecmult_multi with space for exactly one point */
+    scratch = secp256k1_scratch_create(&ctx->error_callback, secp256k1_strauss_scratch_size(1) + STRAUSS_SCRATCH_OBJECTS*ALIGNMENT);
+    test_ecmult_multi(scratch, secp256k1_ecmult_multi_var);
+    secp256k1_scratch_destroy(&ctx->error_callback, scratch);
+
+    test_ecmult_multi_batch_size_helper();
+    test_ecmult_multi_batching();
+}
+
+void test_wnaf(const secp256k1_scalar *number, int w) {
+    secp256k1_scalar x, two, t;
+    int wnaf[256];
+    int zeroes = -1;
+    int i;
+    int bits;
+    secp256k1_scalar_set_int(&x, 0);
+    secp256k1_scalar_set_int(&two, 2);
+    bits = secp256k1_ecmult_wnaf(wnaf, 256, number, w);
+    CHECK(bits <= 256);
+    for (i = bits-1; i >= 0; i--) {
+        int v = wnaf[i];
+        secp256k1_scalar_mul(&x, &x, &two);
+        if (v) {
+            CHECK(zeroes == -1 || zeroes >= w-1); /* check that distance between non-zero elements is at least w-1 */
+            zeroes=0;
+            CHECK((v & 1) == 1); /* check non-zero elements are odd */
+            CHECK(v <= (1 << (w-1)) - 1); /* check range below */
+            CHECK(v >= -(1 << (w-1)) - 1); /* check range above */
+        } else {
+            CHECK(zeroes != -1); /* check that no unnecessary zero padding exists */
+            zeroes++;
+        }
+        if (v >= 0) {
+            secp256k1_scalar_set_int(&t, v);
+        } else {
+            secp256k1_scalar_set_int(&t, -v);
+            secp256k1_scalar_negate(&t, &t);
+        }
+        secp256k1_scalar_add(&x, &x, &t);
+    }
+    CHECK(secp256k1_scalar_eq(&x, number)); /* check that wnaf represents number */
+}
+
+void test_constant_wnaf_negate(const secp256k1_scalar *number) {
+    secp256k1_scalar neg1 = *number;
+    secp256k1_scalar neg2 = *number;
+    int sign1 = 1;
+    int sign2 = 1;
+
+    if (!secp256k1_scalar_get_bits(&neg1, 0, 1)) {
+        secp256k1_scalar_negate(&neg1, &neg1);
+        sign1 = -1;
+    }
+    sign2 = secp256k1_scalar_cond_negate(&neg2, secp256k1_scalar_is_even(&neg2));
+    CHECK(sign1 == sign2);
+    CHECK(secp256k1_scalar_eq(&neg1, &neg2));
+}
+
+void test_constant_wnaf(const secp256k1_scalar *number, int w) {
+    secp256k1_scalar x, shift;
+    int wnaf[256] = {0};
+    int i;
+    int skew;
+    int bits = 256;
+    secp256k1_scalar num = *number;
+    secp256k1_scalar scalar_skew;
+
+    secp256k1_scalar_set_int(&x, 0);
+    secp256k1_scalar_set_int(&shift, 1 << w);
+    for (i = 0; i < 16; ++i) {
+        secp256k1_scalar_shr_int(&num, 8);
+    }
+    bits = 128;
+    skew = secp256k1_wnaf_const(wnaf, &num, w, bits);
+
+    for (i = WNAF_SIZE_BITS(bits, w); i >= 0; --i) {
+        secp256k1_scalar t;
+        int v = wnaf[i];
+        CHECK(v != 0); /* check nonzero */
+        CHECK(v & 1);  /* check parity */
+        CHECK(v > -(1 << w)); /* check range above */
+        CHECK(v < (1 << w));  /* check range below */
+
+        secp256k1_scalar_mul(&x, &x, &shift);
+        if (v >= 0) {
+            secp256k1_scalar_set_int(&t, v);
+        } else {
+            secp256k1_scalar_set_int(&t, -v);
+            secp256k1_scalar_negate(&t, &t);
+        }
+        secp256k1_scalar_add(&x, &x, &t);
+    }
+    /* Skew num because when encoding numbers as odd we use an offset */
+    secp256k1_scalar_set_int(&scalar_skew, 1 << (skew == 2));
+    secp256k1_scalar_add(&num, &num, &scalar_skew);
+    CHECK(secp256k1_scalar_eq(&x, &num));
+}
+
+void test_fixed_wnaf(const secp256k1_scalar *number, int w) {
+    secp256k1_scalar x, shift;
+    int wnaf[256] = {0};
+    int i;
+    int skew;
+    secp256k1_scalar num = *number;
+
+    secp256k1_scalar_set_int(&x, 0);
+    secp256k1_scalar_set_int(&shift, 1 << w);
+    for (i = 0; i < 16; ++i) {
+        secp256k1_scalar_shr_int(&num, 8);
+    }
+    skew = secp256k1_wnaf_fixed(wnaf, &num, w);
+
+    for (i = WNAF_SIZE(w)-1; i >= 0; --i) {
+        secp256k1_scalar t;
+        int v = wnaf[i];
+        CHECK(v == 0 || v & 1);  /* check parity */
+        CHECK(v > -(1 << w)); /* check range above */
+        CHECK(v < (1 << w));  /* check range below */
+
+        secp256k1_scalar_mul(&x, &x, &shift);
+        if (v >= 0) {
+            secp256k1_scalar_set_int(&t, v);
+        } else {
+            secp256k1_scalar_set_int(&t, -v);
+            secp256k1_scalar_negate(&t, &t);
+        }
+        secp256k1_scalar_add(&x, &x, &t);
+    }
+    /* If skew is 1 then add 1 to num */
+    secp256k1_scalar_cadd_bit(&num, 0, skew == 1);
+    CHECK(secp256k1_scalar_eq(&x, &num));
+}
+
+/* Checks that the first 8 elements of wnaf are equal to wnaf_expected and the
+ * rest is 0.*/
+void test_fixed_wnaf_small_helper(int *wnaf, int *wnaf_expected, int w) {
+    int i;
+    for (i = WNAF_SIZE(w)-1; i >= 8; --i) {
+        CHECK(wnaf[i] == 0);
+    }
+    for (i = 7; i >= 0; --i) {
+        CHECK(wnaf[i] == wnaf_expected[i]);
+    }
+}
+
+void test_fixed_wnaf_small(void) {
+    int w = 4;
+    int wnaf[256] = {0};
+    int i;
+    int skew;
+    secp256k1_scalar num;
+
+    secp256k1_scalar_set_int(&num, 0);
+    skew = secp256k1_wnaf_fixed(wnaf, &num, w);
+    for (i = WNAF_SIZE(w)-1; i >= 0; --i) {
+        int v = wnaf[i];
+        CHECK(v == 0);
+    }
+    CHECK(skew == 0);
+
+    secp256k1_scalar_set_int(&num, 1);
+    skew = secp256k1_wnaf_fixed(wnaf, &num, w);
+    for (i = WNAF_SIZE(w)-1; i >= 1; --i) {
+        int v = wnaf[i];
+        CHECK(v == 0);
+    }
+    CHECK(wnaf[0] == 1);
+    CHECK(skew == 0);
+
+    {
+        int wnaf_expected[8] = { 0xf, 0xf, 0xf, 0xf, 0xf, 0xf, 0xf, 0xf };
+        secp256k1_scalar_set_int(&num, 0xffffffff);
+        skew = secp256k1_wnaf_fixed(wnaf, &num, w);
+        test_fixed_wnaf_small_helper(wnaf, wnaf_expected, w);
+        CHECK(skew == 0);
+    }
+    {
+        int wnaf_expected[8] = { -1, -1, -1, -1, -1, -1, -1, 0xf };
+        secp256k1_scalar_set_int(&num, 0xeeeeeeee);
+        skew = secp256k1_wnaf_fixed(wnaf, &num, w);
+        test_fixed_wnaf_small_helper(wnaf, wnaf_expected, w);
+        CHECK(skew == 1);
+    }
+    {
+        int wnaf_expected[8] = { 1, 0, 1, 0, 1, 0, 1, 0 };
+        secp256k1_scalar_set_int(&num, 0x01010101);
+        skew = secp256k1_wnaf_fixed(wnaf, &num, w);
+        test_fixed_wnaf_small_helper(wnaf, wnaf_expected, w);
+        CHECK(skew == 0);
+    }
+    {
+        int wnaf_expected[8] = { -0xf, 0, 0xf, -0xf, 0, 0xf, 1, 0 };
+        secp256k1_scalar_set_int(&num, 0x01ef1ef1);
+        skew = secp256k1_wnaf_fixed(wnaf, &num, w);
+        test_fixed_wnaf_small_helper(wnaf, wnaf_expected, w);
+        CHECK(skew == 0);
+    }
+}
+
+void run_wnaf(void) {
+    int i;
+    secp256k1_scalar n = {{0}};
+
+    test_constant_wnaf(&n, 4);
+    /* Sanity check: 1 and 2 are the smallest odd and even numbers and should
+     *               have easier-to-diagnose failure modes  */
+    n.d[0] = 1;
+    test_constant_wnaf(&n, 4);
+    n.d[0] = 2;
+    test_constant_wnaf(&n, 4);
+    /* Test -1, because it's a special case in wnaf_const */
+    n = secp256k1_scalar_one;
+    secp256k1_scalar_negate(&n, &n);
+    test_constant_wnaf(&n, 4);
+
+    /* Test -2, which may not lead to overflows in wnaf_const */
+    secp256k1_scalar_add(&n, &secp256k1_scalar_one, &secp256k1_scalar_one);
+    secp256k1_scalar_negate(&n, &n);
+    test_constant_wnaf(&n, 4);
+
+    /* Test (1/2) - 1 = 1/-2 and 1/2 = (1/-2) + 1
+       as corner cases of negation handling in wnaf_const */
+    secp256k1_scalar_inverse(&n, &n);
+    test_constant_wnaf(&n, 4);
+
+    secp256k1_scalar_add(&n, &n, &secp256k1_scalar_one);
+    test_constant_wnaf(&n, 4);
+
+    /* Test 0 for fixed wnaf */
+    test_fixed_wnaf_small();
+    /* Random tests */
+    for (i = 0; i < count; i++) {
+        random_scalar_order(&n);
+        test_wnaf(&n, 4+(i%10));
+        test_constant_wnaf_negate(&n);
+        test_constant_wnaf(&n, 4 + (i % 10));
+        test_fixed_wnaf(&n, 4 + (i % 10));
+    }
+    secp256k1_scalar_set_int(&n, 0);
+    CHECK(secp256k1_scalar_cond_negate(&n, 1) == -1);
+    CHECK(secp256k1_scalar_is_zero(&n));
+    CHECK(secp256k1_scalar_cond_negate(&n, 0) == 1);
+    CHECK(secp256k1_scalar_is_zero(&n));
+}
+
+void test_ecmult_constants(void) {
+    /* Test ecmult_gen() for [0..36) and [order-36..0). */
+    secp256k1_scalar x;
+    secp256k1_gej r;
+    secp256k1_ge ng;
+    int i;
+    int j;
+    secp256k1_ge_neg(&ng, &secp256k1_ge_const_g);
+    for (i = 0; i < 36; i++ ) {
+        secp256k1_scalar_set_int(&x, i);
+        secp256k1_ecmult_gen(&ctx->ecmult_gen_ctx, &r, &x);
+        for (j = 0; j < i; j++) {
+            if (j == i - 1) {
+                ge_equals_gej(&secp256k1_ge_const_g, &r);
+            }
+            secp256k1_gej_add_ge(&r, &r, &ng);
+        }
+        CHECK(secp256k1_gej_is_infinity(&r));
+    }
+    for (i = 1; i <= 36; i++ ) {
+        secp256k1_scalar_set_int(&x, i);
+        secp256k1_scalar_negate(&x, &x);
+        secp256k1_ecmult_gen(&ctx->ecmult_gen_ctx, &r, &x);
+        for (j = 0; j < i; j++) {
+            if (j == i - 1) {
+                ge_equals_gej(&ng, &r);
+            }
+            secp256k1_gej_add_ge(&r, &r, &secp256k1_ge_const_g);
+        }
+        CHECK(secp256k1_gej_is_infinity(&r));
+    }
+}
+
+void run_ecmult_constants(void) {
+    test_ecmult_constants();
+}
+
+void test_ecmult_gen_blind(void) {
+    /* Test ecmult_gen() blinding and confirm that the blinding changes, the affine points match, and the z's don't match. */
+    secp256k1_scalar key;
+    secp256k1_scalar b;
+    unsigned char seed32[32];
+    secp256k1_gej pgej;
+    secp256k1_gej pgej2;
+    secp256k1_gej i;
+    secp256k1_ge pge;
+    random_scalar_order_test(&key);
+    secp256k1_ecmult_gen(&ctx->ecmult_gen_ctx, &pgej, &key);
+    secp256k1_testrand256(seed32);
+    b = ctx->ecmult_gen_ctx.blind;
+    i = ctx->ecmult_gen_ctx.initial;
+    secp256k1_ecmult_gen_blind(&ctx->ecmult_gen_ctx, seed32);
+    CHECK(!secp256k1_scalar_eq(&b, &ctx->ecmult_gen_ctx.blind));
+    secp256k1_ecmult_gen(&ctx->ecmult_gen_ctx, &pgej2, &key);
+    CHECK(!gej_xyz_equals_gej(&pgej, &pgej2));
+    CHECK(!gej_xyz_equals_gej(&i, &ctx->ecmult_gen_ctx.initial));
+    secp256k1_ge_set_gej(&pge, &pgej);
+    ge_equals_gej(&pge, &pgej2);
+}
+
+void test_ecmult_gen_blind_reset(void) {
+    /* Test ecmult_gen() blinding reset and confirm that the blinding is consistent. */
+    secp256k1_scalar b;
+    secp256k1_gej initial;
+    secp256k1_ecmult_gen_blind(&ctx->ecmult_gen_ctx, 0);
+    b = ctx->ecmult_gen_ctx.blind;
+    initial = ctx->ecmult_gen_ctx.initial;
+    secp256k1_ecmult_gen_blind(&ctx->ecmult_gen_ctx, 0);
+    CHECK(secp256k1_scalar_eq(&b, &ctx->ecmult_gen_ctx.blind));
+    CHECK(gej_xyz_equals_gej(&initial, &ctx->ecmult_gen_ctx.initial));
+}
+
+void run_ecmult_gen_blind(void) {
+    int i;
+    test_ecmult_gen_blind_reset();
+    for (i = 0; i < 10; i++) {
+        test_ecmult_gen_blind();
+    }
+}
+
+/***** ENDOMORPHISH TESTS *****/
+void test_scalar_split(const secp256k1_scalar* full) {
+    secp256k1_scalar s, s1, slam;
+    const unsigned char zero[32] = {0};
+    unsigned char tmp[32];
+
+    secp256k1_scalar_split_lambda(&s1, &slam, full);
+
+    /* check slam*lambda + s1 == full */
+    secp256k1_scalar_mul(&s, &secp256k1_const_lambda, &slam);
+    secp256k1_scalar_add(&s, &s, &s1);
+    CHECK(secp256k1_scalar_eq(&s, full));
+
+    /* check that both are <= 128 bits in size */
+    if (secp256k1_scalar_is_high(&s1)) {
+        secp256k1_scalar_negate(&s1, &s1);
+    }
+    if (secp256k1_scalar_is_high(&slam)) {
+        secp256k1_scalar_negate(&slam, &slam);
+    }
+
+    secp256k1_scalar_get_b32(tmp, &s1);
+    CHECK(secp256k1_memcmp_var(zero, tmp, 16) == 0);
+    secp256k1_scalar_get_b32(tmp, &slam);
+    CHECK(secp256k1_memcmp_var(zero, tmp, 16) == 0);
+}
+
+
+void run_endomorphism_tests(void) {
+    unsigned i;
+    static secp256k1_scalar s;
+    test_scalar_split(&secp256k1_scalar_zero);
+    test_scalar_split(&secp256k1_scalar_one);
+    secp256k1_scalar_negate(&s,&secp256k1_scalar_one);
+    test_scalar_split(&s);
+    test_scalar_split(&secp256k1_const_lambda);
+    secp256k1_scalar_add(&s, &secp256k1_const_lambda, &secp256k1_scalar_one);
+    test_scalar_split(&s);
+
+    for (i = 0; i < 100U * count; ++i) {
+        secp256k1_scalar full;
+        random_scalar_order_test(&full);
+        test_scalar_split(&full);
+    }
+    for (i = 0; i < sizeof(scalars_near_split_bounds) / sizeof(scalars_near_split_bounds[0]); ++i) {
+        test_scalar_split(&scalars_near_split_bounds[i]);
+    }
+}
+
+void ec_pubkey_parse_pointtest(const unsigned char *input, int xvalid, int yvalid) {
+    unsigned char pubkeyc[65];
+    secp256k1_pubkey pubkey;
+    secp256k1_ge ge;
+    size_t pubkeyclen;
+    int32_t ecount;
+    ecount = 0;
+    secp256k1_context_set_illegal_callback(ctx, counting_illegal_callback_fn, &ecount);
+    for (pubkeyclen = 3; pubkeyclen <= 65; pubkeyclen++) {
+        /* Smaller sizes are tested exhaustively elsewhere. */
+        int32_t i;
+        memcpy(&pubkeyc[1], input, 64);
+        VG_UNDEF(&pubkeyc[pubkeyclen], 65 - pubkeyclen);
+        for (i = 0; i < 256; i++) {
+            /* Try all type bytes. */
+            int xpass;
+            int ypass;
+            int ysign;
+            pubkeyc[0] = i;
+            /* What sign does this point have? */
+            ysign = (input[63] & 1) + 2;
+            /* For the current type (i) do we expect parsing to work? Handled all of compressed/uncompressed/hybrid. */
+            xpass = xvalid && (pubkeyclen == 33) && ((i & 254) == 2);
+            /* Do we expect a parse and re-serialize as uncompressed to give a matching y? */
+            ypass = xvalid && yvalid && ((i & 4) == ((pubkeyclen == 65) << 2)) &&
+                ((i == 4) || ((i & 251) == ysign)) && ((pubkeyclen == 33) || (pubkeyclen == 65));
+            if (xpass || ypass) {
+                /* These cases must parse. */
+                unsigned char pubkeyo[65];
+                size_t outl;
+                memset(&pubkey, 0, sizeof(pubkey));
+                VG_UNDEF(&pubkey, sizeof(pubkey));
+                ecount = 0;
+                CHECK(secp256k1_ec_pubkey_parse(ctx, &pubkey, pubkeyc, pubkeyclen) == 1);
+                VG_CHECK(&pubkey, sizeof(pubkey));
+                outl = 65;
+                VG_UNDEF(pubkeyo, 65);
+                CHECK(secp256k1_ec_pubkey_serialize(ctx, pubkeyo, &outl, &pubkey, SECP256K1_EC_COMPRESSED) == 1);
+                VG_CHECK(pubkeyo, outl);
+                CHECK(outl == 33);
+                CHECK(secp256k1_memcmp_var(&pubkeyo[1], &pubkeyc[1], 32) == 0);
+                CHECK((pubkeyclen != 33) || (pubkeyo[0] == pubkeyc[0]));
+                if (ypass) {
+                    /* This test isn't always done because we decode with alternative signs, so the y won't match. */
+                    CHECK(pubkeyo[0] == ysign);
+                    CHECK(secp256k1_pubkey_load(ctx, &ge, &pubkey) == 1);
+                    memset(&pubkey, 0, sizeof(pubkey));
+                    VG_UNDEF(&pubkey, sizeof(pubkey));
+                    secp256k1_pubkey_save(&pubkey, &ge);
+                    VG_CHECK(&pubkey, sizeof(pubkey));
+                    outl = 65;
+                    VG_UNDEF(pubkeyo, 65);
+                    CHECK(secp256k1_ec_pubkey_serialize(ctx, pubkeyo, &outl, &pubkey, SECP256K1_EC_UNCOMPRESSED) == 1);
+                    VG_CHECK(pubkeyo, outl);
+                    CHECK(outl == 65);
+                    CHECK(pubkeyo[0] == 4);
+                    CHECK(secp256k1_memcmp_var(&pubkeyo[1], input, 64) == 0);
+                }
+                CHECK(ecount == 0);
+            } else {
+                /* These cases must fail to parse. */
+                memset(&pubkey, 0xfe, sizeof(pubkey));
+                ecount = 0;
+                VG_UNDEF(&pubkey, sizeof(pubkey));
+                CHECK(secp256k1_ec_pubkey_parse(ctx, &pubkey, pubkeyc, pubkeyclen) == 0);
+                VG_CHECK(&pubkey, sizeof(pubkey));
+                CHECK(ecount == 0);
+                CHECK(secp256k1_pubkey_load(ctx, &ge, &pubkey) == 0);
+                CHECK(ecount == 1);
+            }
+        }
+    }
+    secp256k1_context_set_illegal_callback(ctx, NULL, NULL);
+}
+
+void run_ec_pubkey_parse_test(void) {
+#define SECP256K1_EC_PARSE_TEST_NVALID (12)
+    const unsigned char valid[SECP256K1_EC_PARSE_TEST_NVALID][64] = {
+        {
+            /* Point with leading and trailing zeros in x and y serialization. */
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x42, 0x52,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x64, 0xef, 0xa1, 0x7b, 0x77, 0x61, 0xe1, 0xe4, 0x27, 0x06, 0x98, 0x9f, 0xb4, 0x83,
+            0xb8, 0xd2, 0xd4, 0x9b, 0xf7, 0x8f, 0xae, 0x98, 0x03, 0xf0, 0x99, 0xb8, 0x34, 0xed, 0xeb, 0x00
+        },
+        {
+            /* Point with x equal to a 3rd root of unity.*/
+            0x7a, 0xe9, 0x6a, 0x2b, 0x65, 0x7c, 0x07, 0x10, 0x6e, 0x64, 0x47, 0x9e, 0xac, 0x34, 0x34, 0xe9,
+            0x9c, 0xf0, 0x49, 0x75, 0x12, 0xf5, 0x89, 0x95, 0xc1, 0x39, 0x6c, 0x28, 0x71, 0x95, 0x01, 0xee,
+            0x42, 0x18, 0xf2, 0x0a, 0xe6, 0xc6, 0x46, 0xb3, 0x63, 0xdb, 0x68, 0x60, 0x58, 0x22, 0xfb, 0x14,
+            0x26, 0x4c, 0xa8, 0xd2, 0x58, 0x7f, 0xdd, 0x6f, 0xbc, 0x75, 0x0d, 0x58, 0x7e, 0x76, 0xa7, 0xee,
+        },
+        {
+            /* Point with largest x. (1/2) */
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xfe, 0xff, 0xff, 0xfc, 0x2c,
+            0x0e, 0x99, 0x4b, 0x14, 0xea, 0x72, 0xf8, 0xc3, 0xeb, 0x95, 0xc7, 0x1e, 0xf6, 0x92, 0x57, 0x5e,
+            0x77, 0x50, 0x58, 0x33, 0x2d, 0x7e, 0x52, 0xd0, 0x99, 0x5c, 0xf8, 0x03, 0x88, 0x71, 0xb6, 0x7d,
+        },
+        {
+            /* Point with largest x. (2/2) */
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xfe, 0xff, 0xff, 0xfc, 0x2c,
+            0xf1, 0x66, 0xb4, 0xeb, 0x15, 0x8d, 0x07, 0x3c, 0x14, 0x6a, 0x38, 0xe1, 0x09, 0x6d, 0xa8, 0xa1,
+            0x88, 0xaf, 0xa7, 0xcc, 0xd2, 0x81, 0xad, 0x2f, 0x66, 0xa3, 0x07, 0xfb, 0x77, 0x8e, 0x45, 0xb2,
+        },
+        {
+            /* Point with smallest x. (1/2) */
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01,
+            0x42, 0x18, 0xf2, 0x0a, 0xe6, 0xc6, 0x46, 0xb3, 0x63, 0xdb, 0x68, 0x60, 0x58, 0x22, 0xfb, 0x14,
+            0x26, 0x4c, 0xa8, 0xd2, 0x58, 0x7f, 0xdd, 0x6f, 0xbc, 0x75, 0x0d, 0x58, 0x7e, 0x76, 0xa7, 0xee,
+        },
+        {
+            /* Point with smallest x. (2/2) */
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01,
+            0xbd, 0xe7, 0x0d, 0xf5, 0x19, 0x39, 0xb9, 0x4c, 0x9c, 0x24, 0x97, 0x9f, 0xa7, 0xdd, 0x04, 0xeb,
+            0xd9, 0xb3, 0x57, 0x2d, 0xa7, 0x80, 0x22, 0x90, 0x43, 0x8a, 0xf2, 0xa6, 0x81, 0x89, 0x54, 0x41,
+        },
+        {
+            /* Point with largest y. (1/3) */
+            0x1f, 0xe1, 0xe5, 0xef, 0x3f, 0xce, 0xb5, 0xc1, 0x35, 0xab, 0x77, 0x41, 0x33, 0x3c, 0xe5, 0xa6,
+            0xe8, 0x0d, 0x68, 0x16, 0x76, 0x53, 0xf6, 0xb2, 0xb2, 0x4b, 0xcb, 0xcf, 0xaa, 0xaf, 0xf5, 0x07,
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xfe, 0xff, 0xff, 0xfc, 0x2e,
+        },
+        {
+            /* Point with largest y. (2/3) */
+            0xcb, 0xb0, 0xde, 0xab, 0x12, 0x57, 0x54, 0xf1, 0xfd, 0xb2, 0x03, 0x8b, 0x04, 0x34, 0xed, 0x9c,
+            0xb3, 0xfb, 0x53, 0xab, 0x73, 0x53, 0x91, 0x12, 0x99, 0x94, 0xa5, 0x35, 0xd9, 0x25, 0xf6, 0x73,
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xfe, 0xff, 0xff, 0xfc, 0x2e,
+        },
+        {
+            /* Point with largest y. (3/3) */
+            0x14, 0x6d, 0x3b, 0x65, 0xad, 0xd9, 0xf5, 0x4c, 0xcc, 0xa2, 0x85, 0x33, 0xc8, 0x8e, 0x2c, 0xbc,
+            0x63, 0xf7, 0x44, 0x3e, 0x16, 0x58, 0x78, 0x3a, 0xb4, 0x1f, 0x8e, 0xf9, 0x7c, 0x2a, 0x10, 0xb5,
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xfe, 0xff, 0xff, 0xfc, 0x2e,
+        },
+        {
+            /* Point with smallest y. (1/3) */
+            0x1f, 0xe1, 0xe5, 0xef, 0x3f, 0xce, 0xb5, 0xc1, 0x35, 0xab, 0x77, 0x41, 0x33, 0x3c, 0xe5, 0xa6,
+            0xe8, 0x0d, 0x68, 0x16, 0x76, 0x53, 0xf6, 0xb2, 0xb2, 0x4b, 0xcb, 0xcf, 0xaa, 0xaf, 0xf5, 0x07,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01,
+        },
+        {
+            /* Point with smallest y. (2/3) */
+            0xcb, 0xb0, 0xde, 0xab, 0x12, 0x57, 0x54, 0xf1, 0xfd, 0xb2, 0x03, 0x8b, 0x04, 0x34, 0xed, 0x9c,
+            0xb3, 0xfb, 0x53, 0xab, 0x73, 0x53, 0x91, 0x12, 0x99, 0x94, 0xa5, 0x35, 0xd9, 0x25, 0xf6, 0x73,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01,
+        },
+        {
+            /* Point with smallest y. (3/3) */
+            0x14, 0x6d, 0x3b, 0x65, 0xad, 0xd9, 0xf5, 0x4c, 0xcc, 0xa2, 0x85, 0x33, 0xc8, 0x8e, 0x2c, 0xbc,
+            0x63, 0xf7, 0x44, 0x3e, 0x16, 0x58, 0x78, 0x3a, 0xb4, 0x1f, 0x8e, 0xf9, 0x7c, 0x2a, 0x10, 0xb5,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01
+        }
+    };
+#define SECP256K1_EC_PARSE_TEST_NXVALID (4)
+    const unsigned char onlyxvalid[SECP256K1_EC_PARSE_TEST_NXVALID][64] = {
+        {
+            /* Valid if y overflow ignored (y = 1 mod p). (1/3) */
+            0x1f, 0xe1, 0xe5, 0xef, 0x3f, 0xce, 0xb5, 0xc1, 0x35, 0xab, 0x77, 0x41, 0x33, 0x3c, 0xe5, 0xa6,
+            0xe8, 0x0d, 0x68, 0x16, 0x76, 0x53, 0xf6, 0xb2, 0xb2, 0x4b, 0xcb, 0xcf, 0xaa, 0xaf, 0xf5, 0x07,
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xfe, 0xff, 0xff, 0xfc, 0x30,
+        },
+        {
+            /* Valid if y overflow ignored (y = 1 mod p). (2/3) */
+            0xcb, 0xb0, 0xde, 0xab, 0x12, 0x57, 0x54, 0xf1, 0xfd, 0xb2, 0x03, 0x8b, 0x04, 0x34, 0xed, 0x9c,
+            0xb3, 0xfb, 0x53, 0xab, 0x73, 0x53, 0x91, 0x12, 0x99, 0x94, 0xa5, 0x35, 0xd9, 0x25, 0xf6, 0x73,
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xfe, 0xff, 0xff, 0xfc, 0x30,
+        },
+        {
+            /* Valid if y overflow ignored (y = 1 mod p). (3/3)*/
+            0x14, 0x6d, 0x3b, 0x65, 0xad, 0xd9, 0xf5, 0x4c, 0xcc, 0xa2, 0x85, 0x33, 0xc8, 0x8e, 0x2c, 0xbc,
+            0x63, 0xf7, 0x44, 0x3e, 0x16, 0x58, 0x78, 0x3a, 0xb4, 0x1f, 0x8e, 0xf9, 0x7c, 0x2a, 0x10, 0xb5,
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xfe, 0xff, 0xff, 0xfc, 0x30,
+        },
+        {
+            /* x on curve, y is from y^2 = x^3 + 8. */
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x03
+        }
+    };
+#define SECP256K1_EC_PARSE_TEST_NINVALID (7)
+    const unsigned char invalid[SECP256K1_EC_PARSE_TEST_NINVALID][64] = {
+        {
+            /* x is third root of -8, y is -1 * (x^3+7); also on the curve for y^2 = x^3 + 9. */
+            0x0a, 0x2d, 0x2b, 0xa9, 0x35, 0x07, 0xf1, 0xdf, 0x23, 0x37, 0x70, 0xc2, 0xa7, 0x97, 0x96, 0x2c,
+            0xc6, 0x1f, 0x6d, 0x15, 0xda, 0x14, 0xec, 0xd4, 0x7d, 0x8d, 0x27, 0xae, 0x1c, 0xd5, 0xf8, 0x53,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01,
+        },
+        {
+            /* Valid if x overflow ignored (x = 1 mod p). */
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xfe, 0xff, 0xff, 0xfc, 0x30,
+            0x42, 0x18, 0xf2, 0x0a, 0xe6, 0xc6, 0x46, 0xb3, 0x63, 0xdb, 0x68, 0x60, 0x58, 0x22, 0xfb, 0x14,
+            0x26, 0x4c, 0xa8, 0xd2, 0x58, 0x7f, 0xdd, 0x6f, 0xbc, 0x75, 0x0d, 0x58, 0x7e, 0x76, 0xa7, 0xee,
+        },
+        {
+            /* Valid if x overflow ignored (x = 1 mod p). */
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xfe, 0xff, 0xff, 0xfc, 0x30,
+            0xbd, 0xe7, 0x0d, 0xf5, 0x19, 0x39, 0xb9, 0x4c, 0x9c, 0x24, 0x97, 0x9f, 0xa7, 0xdd, 0x04, 0xeb,
+            0xd9, 0xb3, 0x57, 0x2d, 0xa7, 0x80, 0x22, 0x90, 0x43, 0x8a, 0xf2, 0xa6, 0x81, 0x89, 0x54, 0x41,
+        },
+        {
+            /* x is -1, y is the result of the sqrt ladder; also on the curve for y^2 = x^3 - 5. */
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xfe, 0xff, 0xff, 0xfc, 0x2e,
+            0xf4, 0x84, 0x14, 0x5c, 0xb0, 0x14, 0x9b, 0x82, 0x5d, 0xff, 0x41, 0x2f, 0xa0, 0x52, 0xa8, 0x3f,
+            0xcb, 0x72, 0xdb, 0x61, 0xd5, 0x6f, 0x37, 0x70, 0xce, 0x06, 0x6b, 0x73, 0x49, 0xa2, 0xaa, 0x28,
+        },
+        {
+            /* x is -1, y is the result of the sqrt ladder; also on the curve for y^2 = x^3 - 5. */
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xfe, 0xff, 0xff, 0xfc, 0x2e,
+            0x0b, 0x7b, 0xeb, 0xa3, 0x4f, 0xeb, 0x64, 0x7d, 0xa2, 0x00, 0xbe, 0xd0, 0x5f, 0xad, 0x57, 0xc0,
+            0x34, 0x8d, 0x24, 0x9e, 0x2a, 0x90, 0xc8, 0x8f, 0x31, 0xf9, 0x94, 0x8b, 0xb6, 0x5d, 0x52, 0x07,
+        },
+        {
+            /* x is zero, y is the result of the sqrt ladder; also on the curve for y^2 = x^3 - 7. */
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x8f, 0x53, 0x7e, 0xef, 0xdf, 0xc1, 0x60, 0x6a, 0x07, 0x27, 0xcd, 0x69, 0xb4, 0xa7, 0x33, 0x3d,
+            0x38, 0xed, 0x44, 0xe3, 0x93, 0x2a, 0x71, 0x79, 0xee, 0xcb, 0x4b, 0x6f, 0xba, 0x93, 0x60, 0xdc,
+        },
+        {
+            /* x is zero, y is the result of the sqrt ladder; also on the curve for y^2 = x^3 - 7. */
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x70, 0xac, 0x81, 0x10, 0x20, 0x3e, 0x9f, 0x95, 0xf8, 0xd8, 0x32, 0x96, 0x4b, 0x58, 0xcc, 0xc2,
+            0xc7, 0x12, 0xbb, 0x1c, 0x6c, 0xd5, 0x8e, 0x86, 0x11, 0x34, 0xb4, 0x8f, 0x45, 0x6c, 0x9b, 0x53
+        }
+    };
+    const unsigned char pubkeyc[66] = {
+        /* Serialization of G. */
+        0x04, 0x79, 0xBE, 0x66, 0x7E, 0xF9, 0xDC, 0xBB, 0xAC, 0x55, 0xA0, 0x62, 0x95, 0xCE, 0x87, 0x0B,
+        0x07, 0x02, 0x9B, 0xFC, 0xDB, 0x2D, 0xCE, 0x28, 0xD9, 0x59, 0xF2, 0x81, 0x5B, 0x16, 0xF8, 0x17,
+        0x98, 0x48, 0x3A, 0xDA, 0x77, 0x26, 0xA3, 0xC4, 0x65, 0x5D, 0xA4, 0xFB, 0xFC, 0x0E, 0x11, 0x08,
+        0xA8, 0xFD, 0x17, 0xB4, 0x48, 0xA6, 0x85, 0x54, 0x19, 0x9C, 0x47, 0xD0, 0x8F, 0xFB, 0x10, 0xD4,
+        0xB8, 0x00
+    };
+    unsigned char sout[65];
+    unsigned char shortkey[2];
+    secp256k1_ge ge;
+    secp256k1_pubkey pubkey;
+    size_t len;
+    int32_t i;
+    int32_t ecount;
+    int32_t ecount2;
+    ecount = 0;
+    /* Nothing should be reading this far into pubkeyc. */
+    VG_UNDEF(&pubkeyc[65], 1);
+    secp256k1_context_set_illegal_callback(ctx, counting_illegal_callback_fn, &ecount);
+    /* Zero length claimed, fail, zeroize, no illegal arg error. */
+    memset(&pubkey, 0xfe, sizeof(pubkey));
+    ecount = 0;
+    VG_UNDEF(shortkey, 2);
+    VG_UNDEF(&pubkey, sizeof(pubkey));
+    CHECK(secp256k1_ec_pubkey_parse(ctx, &pubkey, shortkey, 0) == 0);
+    VG_CHECK(&pubkey, sizeof(pubkey));
+    CHECK(ecount == 0);
+    CHECK(secp256k1_pubkey_load(ctx, &ge, &pubkey) == 0);
+    CHECK(ecount == 1);
+    /* Length one claimed, fail, zeroize, no illegal arg error. */
+    for (i = 0; i < 256 ; i++) {
+        memset(&pubkey, 0xfe, sizeof(pubkey));
+        ecount = 0;
+        shortkey[0] = i;
+        VG_UNDEF(&shortkey[1], 1);
+        VG_UNDEF(&pubkey, sizeof(pubkey));
+        CHECK(secp256k1_ec_pubkey_parse(ctx, &pubkey, shortkey, 1) == 0);
+        VG_CHECK(&pubkey, sizeof(pubkey));
+        CHECK(ecount == 0);
+        CHECK(secp256k1_pubkey_load(ctx, &ge, &pubkey) == 0);
+        CHECK(ecount == 1);
+    }
+    /* Length two claimed, fail, zeroize, no illegal arg error. */
+    for (i = 0; i < 65536 ; i++) {
+        memset(&pubkey, 0xfe, sizeof(pubkey));
+        ecount = 0;
+        shortkey[0] = i & 255;
+        shortkey[1] = i >> 8;
+        VG_UNDEF(&pubkey, sizeof(pubkey));
+        CHECK(secp256k1_ec_pubkey_parse(ctx, &pubkey, shortkey, 2) == 0);
+        VG_CHECK(&pubkey, sizeof(pubkey));
+        CHECK(ecount == 0);
+        CHECK(secp256k1_pubkey_load(ctx, &ge, &pubkey) == 0);
+        CHECK(ecount == 1);
+    }
+    memset(&pubkey, 0xfe, sizeof(pubkey));
+    ecount = 0;
+    VG_UNDEF(&pubkey, sizeof(pubkey));
+    /* 33 bytes claimed on otherwise valid input starting with 0x04, fail, zeroize output, no illegal arg error. */
+    CHECK(secp256k1_ec_pubkey_parse(ctx, &pubkey, pubkeyc, 33) == 0);
+    VG_CHECK(&pubkey, sizeof(pubkey));
+    CHECK(ecount == 0);
+    CHECK(secp256k1_pubkey_load(ctx, &ge, &pubkey) == 0);
+    CHECK(ecount == 1);
+    /* NULL pubkey, illegal arg error. Pubkey isn't rewritten before this step, since it's NULL into the parser. */
+    CHECK(secp256k1_ec_pubkey_parse(ctx, NULL, pubkeyc, 65) == 0);
+    CHECK(ecount == 2);
+    /* NULL input string. Illegal arg and zeroize output. */
+    memset(&pubkey, 0xfe, sizeof(pubkey));
+    ecount = 0;
+    VG_UNDEF(&pubkey, sizeof(pubkey));
+    CHECK(secp256k1_ec_pubkey_parse(ctx, &pubkey, NULL, 65) == 0);
+    VG_CHECK(&pubkey, sizeof(pubkey));
+    CHECK(ecount == 1);
+    CHECK(secp256k1_pubkey_load(ctx, &ge, &pubkey) == 0);
+    CHECK(ecount == 2);
+    /* 64 bytes claimed on input starting with 0x04, fail, zeroize output, no illegal arg error. */
+    memset(&pubkey, 0xfe, sizeof(pubkey));
+    ecount = 0;
+    VG_UNDEF(&pubkey, sizeof(pubkey));
+    CHECK(secp256k1_ec_pubkey_parse(ctx, &pubkey, pubkeyc, 64) == 0);
+    VG_CHECK(&pubkey, sizeof(pubkey));
+    CHECK(ecount == 0);
+    CHECK(secp256k1_pubkey_load(ctx, &ge, &pubkey) == 0);
+    CHECK(ecount == 1);
+    /* 66 bytes claimed, fail, zeroize output, no illegal arg error. */
+    memset(&pubkey, 0xfe, sizeof(pubkey));
+    ecount = 0;
+    VG_UNDEF(&pubkey, sizeof(pubkey));
+    CHECK(secp256k1_ec_pubkey_parse(ctx, &pubkey, pubkeyc, 66) == 0);
+    VG_CHECK(&pubkey, sizeof(pubkey));
+    CHECK(ecount == 0);
+    CHECK(secp256k1_pubkey_load(ctx, &ge, &pubkey) == 0);
+    CHECK(ecount == 1);
+    /* Valid parse. */
+    memset(&pubkey, 0, sizeof(pubkey));
+    ecount = 0;
+    VG_UNDEF(&pubkey, sizeof(pubkey));
+    CHECK(secp256k1_ec_pubkey_parse(ctx, &pubkey, pubkeyc, 65) == 1);
+    CHECK(secp256k1_ec_pubkey_parse(secp256k1_context_no_precomp, &pubkey, pubkeyc, 65) == 1);
+    VG_CHECK(&pubkey, sizeof(pubkey));
+    CHECK(ecount == 0);
+    VG_UNDEF(&ge, sizeof(ge));
+    CHECK(secp256k1_pubkey_load(ctx, &ge, &pubkey) == 1);
+    VG_CHECK(&ge.x, sizeof(ge.x));
+    VG_CHECK(&ge.y, sizeof(ge.y));
+    VG_CHECK(&ge.infinity, sizeof(ge.infinity));
+    ge_equals_ge(&secp256k1_ge_const_g, &ge);
+    CHECK(ecount == 0);
+    /* secp256k1_ec_pubkey_serialize illegal args. */
+    ecount = 0;
+    len = 65;
+    CHECK(secp256k1_ec_pubkey_serialize(ctx, NULL, &len, &pubkey, SECP256K1_EC_UNCOMPRESSED) == 0);
+    CHECK(ecount == 1);
+    CHECK(len == 0);
+    CHECK(secp256k1_ec_pubkey_serialize(ctx, sout, NULL, &pubkey, SECP256K1_EC_UNCOMPRESSED) == 0);
+    CHECK(ecount == 2);
+    len = 65;
+    VG_UNDEF(sout, 65);
+    CHECK(secp256k1_ec_pubkey_serialize(ctx, sout, &len, NULL, SECP256K1_EC_UNCOMPRESSED) == 0);
+    VG_CHECK(sout, 65);
+    CHECK(ecount == 3);
+    CHECK(len == 0);
+    len = 65;
+    CHECK(secp256k1_ec_pubkey_serialize(ctx, sout, &len, &pubkey, ~0) == 0);
+    CHECK(ecount == 4);
+    CHECK(len == 0);
+    len = 65;
+    VG_UNDEF(sout, 65);
+    CHECK(secp256k1_ec_pubkey_serialize(ctx, sout, &len, &pubkey, SECP256K1_EC_UNCOMPRESSED) == 1);
+    VG_CHECK(sout, 65);
+    CHECK(ecount == 4);
+    CHECK(len == 65);
+    /* Multiple illegal args. Should still set arg error only once. */
+    ecount = 0;
+    ecount2 = 11;
+    CHECK(secp256k1_ec_pubkey_parse(ctx, NULL, NULL, 65) == 0);
+    CHECK(ecount == 1);
+    /* Does the illegal arg callback actually change the behavior? */
+    secp256k1_context_set_illegal_callback(ctx, uncounting_illegal_callback_fn, &ecount2);
+    CHECK(secp256k1_ec_pubkey_parse(ctx, NULL, NULL, 65) == 0);
+    CHECK(ecount == 1);
+    CHECK(ecount2 == 10);
+    secp256k1_context_set_illegal_callback(ctx, NULL, NULL);
+    /* Try a bunch of prefabbed points with all possible encodings. */
+    for (i = 0; i < SECP256K1_EC_PARSE_TEST_NVALID; i++) {
+        ec_pubkey_parse_pointtest(valid[i], 1, 1);
+    }
+    for (i = 0; i < SECP256K1_EC_PARSE_TEST_NXVALID; i++) {
+        ec_pubkey_parse_pointtest(onlyxvalid[i], 1, 0);
+    }
+    for (i = 0; i < SECP256K1_EC_PARSE_TEST_NINVALID; i++) {
+        ec_pubkey_parse_pointtest(invalid[i], 0, 0);
+    }
+}
+
+void run_eckey_edge_case_test(void) {
+    const unsigned char orderc[32] = {
+        0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+        0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xfe,
+        0xba, 0xae, 0xdc, 0xe6, 0xaf, 0x48, 0xa0, 0x3b,
+        0xbf, 0xd2, 0x5e, 0x8c, 0xd0, 0x36, 0x41, 0x41
+    };
+    const unsigned char zeros[sizeof(secp256k1_pubkey)] = {0x00};
+    unsigned char ctmp[33];
+    unsigned char ctmp2[33];
+    secp256k1_pubkey pubkey;
+    secp256k1_pubkey pubkey2;
+    secp256k1_pubkey pubkey_one;
+    secp256k1_pubkey pubkey_negone;
+    const secp256k1_pubkey *pubkeys[3];
+    size_t len;
+    int32_t ecount;
+    /* Group order is too large, reject. */
+    CHECK(secp256k1_ec_seckey_verify(ctx, orderc) == 0);
+    VG_UNDEF(&pubkey, sizeof(pubkey));
+    CHECK(secp256k1_ec_pubkey_create(ctx, &pubkey, orderc) == 0);
+    VG_CHECK(&pubkey, sizeof(pubkey));
+    CHECK(secp256k1_memcmp_var(&pubkey, zeros, sizeof(secp256k1_pubkey)) == 0);
+    /* Maximum value is too large, reject. */
+    memset(ctmp, 255, 32);
+    CHECK(secp256k1_ec_seckey_verify(ctx, ctmp) == 0);
+    memset(&pubkey, 1, sizeof(pubkey));
+    VG_UNDEF(&pubkey, sizeof(pubkey));
+    CHECK(secp256k1_ec_pubkey_create(ctx, &pubkey, ctmp) == 0);
+    VG_CHECK(&pubkey, sizeof(pubkey));
+    CHECK(secp256k1_memcmp_var(&pubkey, zeros, sizeof(secp256k1_pubkey)) == 0);
+    /* Zero is too small, reject. */
+    memset(ctmp, 0, 32);
+    CHECK(secp256k1_ec_seckey_verify(ctx, ctmp) == 0);
+    memset(&pubkey, 1, sizeof(pubkey));
+    VG_UNDEF(&pubkey, sizeof(pubkey));
+    CHECK(secp256k1_ec_pubkey_create(ctx, &pubkey, ctmp) == 0);
+    VG_CHECK(&pubkey, sizeof(pubkey));
+    CHECK(secp256k1_memcmp_var(&pubkey, zeros, sizeof(secp256k1_pubkey)) == 0);
+    /* One must be accepted. */
+    ctmp[31] = 0x01;
+    CHECK(secp256k1_ec_seckey_verify(ctx, ctmp) == 1);
+    memset(&pubkey, 0, sizeof(pubkey));
+    VG_UNDEF(&pubkey, sizeof(pubkey));
+    CHECK(secp256k1_ec_pubkey_create(ctx, &pubkey, ctmp) == 1);
+    VG_CHECK(&pubkey, sizeof(pubkey));
+    CHECK(secp256k1_memcmp_var(&pubkey, zeros, sizeof(secp256k1_pubkey)) > 0);
+    pubkey_one = pubkey;
+    /* Group order + 1 is too large, reject. */
+    memcpy(ctmp, orderc, 32);
+    ctmp[31] = 0x42;
+    CHECK(secp256k1_ec_seckey_verify(ctx, ctmp) == 0);
+    memset(&pubkey, 1, sizeof(pubkey));
+    VG_UNDEF(&pubkey, sizeof(pubkey));
+    CHECK(secp256k1_ec_pubkey_create(ctx, &pubkey, ctmp) == 0);
+    VG_CHECK(&pubkey, sizeof(pubkey));
+    CHECK(secp256k1_memcmp_var(&pubkey, zeros, sizeof(secp256k1_pubkey)) == 0);
+    /* -1 must be accepted. */
+    ctmp[31] = 0x40;
+    CHECK(secp256k1_ec_seckey_verify(ctx, ctmp) == 1);
+    memset(&pubkey, 0, sizeof(pubkey));
+    VG_UNDEF(&pubkey, sizeof(pubkey));
+    CHECK(secp256k1_ec_pubkey_create(ctx, &pubkey, ctmp) == 1);
+    VG_CHECK(&pubkey, sizeof(pubkey));
+    CHECK(secp256k1_memcmp_var(&pubkey, zeros, sizeof(secp256k1_pubkey)) > 0);
+    pubkey_negone = pubkey;
+    /* Tweak of zero leaves the value unchanged. */
+    memset(ctmp2, 0, 32);
+    CHECK(secp256k1_ec_seckey_tweak_add(ctx, ctmp, ctmp2) == 1);
+    CHECK(secp256k1_memcmp_var(orderc, ctmp, 31) == 0 && ctmp[31] == 0x40);
+    memcpy(&pubkey2, &pubkey, sizeof(pubkey));
+    CHECK(secp256k1_ec_pubkey_tweak_add(ctx, &pubkey, ctmp2) == 1);
+    CHECK(secp256k1_memcmp_var(&pubkey, &pubkey2, sizeof(pubkey)) == 0);
+    /* Multiply tweak of zero zeroizes the output. */
+    CHECK(secp256k1_ec_seckey_tweak_mul(ctx, ctmp, ctmp2) == 0);
+    CHECK(secp256k1_memcmp_var(zeros, ctmp, 32) == 0);
+    CHECK(secp256k1_ec_pubkey_tweak_mul(ctx, &pubkey, ctmp2) == 0);
+    CHECK(secp256k1_memcmp_var(&pubkey, zeros, sizeof(pubkey)) == 0);
+    memcpy(&pubkey, &pubkey2, sizeof(pubkey));
+    /* If seckey_tweak_add or seckey_tweak_mul are called with an overflowing
+    seckey, the seckey is zeroized. */
+    memcpy(ctmp, orderc, 32);
+    memset(ctmp2, 0, 32);
+    ctmp2[31] = 0x01;
+    CHECK(secp256k1_ec_seckey_verify(ctx, ctmp2) == 1);
+    CHECK(secp256k1_ec_seckey_verify(ctx, ctmp) == 0);
+    CHECK(secp256k1_ec_seckey_tweak_add(ctx, ctmp, ctmp2) == 0);
+    CHECK(secp256k1_memcmp_var(zeros, ctmp, 32) == 0);
+    memcpy(ctmp, orderc, 32);
+    CHECK(secp256k1_ec_seckey_tweak_mul(ctx, ctmp, ctmp2) == 0);
+    CHECK(secp256k1_memcmp_var(zeros, ctmp, 32) == 0);
+    /* If seckey_tweak_add or seckey_tweak_mul are called with an overflowing
+    tweak, the seckey is zeroized. */
+    memcpy(ctmp, orderc, 32);
+    ctmp[31] = 0x40;
+    CHECK(secp256k1_ec_seckey_tweak_add(ctx, ctmp, orderc) == 0);
+    CHECK(secp256k1_memcmp_var(zeros, ctmp, 32) == 0);
+    memcpy(ctmp, orderc, 32);
+    ctmp[31] = 0x40;
+    CHECK(secp256k1_ec_seckey_tweak_mul(ctx, ctmp, orderc) == 0);
+    CHECK(secp256k1_memcmp_var(zeros, ctmp, 32) == 0);
+    memcpy(ctmp, orderc, 32);
+    ctmp[31] = 0x40;
+    /* If pubkey_tweak_add or pubkey_tweak_mul are called with an overflowing
+    tweak, the pubkey is zeroized. */
+    CHECK(secp256k1_ec_pubkey_tweak_add(ctx, &pubkey, orderc) == 0);
+    CHECK(secp256k1_memcmp_var(&pubkey, zeros, sizeof(pubkey)) == 0);
+    memcpy(&pubkey, &pubkey2, sizeof(pubkey));
+    CHECK(secp256k1_ec_pubkey_tweak_mul(ctx, &pubkey, orderc) == 0);
+    CHECK(secp256k1_memcmp_var(&pubkey, zeros, sizeof(pubkey)) == 0);
+    memcpy(&pubkey, &pubkey2, sizeof(pubkey));
+    /* If the resulting key in secp256k1_ec_seckey_tweak_add and
+     * secp256k1_ec_pubkey_tweak_add is 0 the functions fail and in the latter
+     * case the pubkey is zeroized. */
+    memcpy(ctmp, orderc, 32);
+    ctmp[31] = 0x40;
+    memset(ctmp2, 0, 32);
+    ctmp2[31] = 1;
+    CHECK(secp256k1_ec_seckey_tweak_add(ctx, ctmp2, ctmp) == 0);
+    CHECK(secp256k1_memcmp_var(zeros, ctmp2, 32) == 0);
+    ctmp2[31] = 1;
+    CHECK(secp256k1_ec_pubkey_tweak_add(ctx, &pubkey, ctmp2) == 0);
+    CHECK(secp256k1_memcmp_var(&pubkey, zeros, sizeof(pubkey)) == 0);
+    memcpy(&pubkey, &pubkey2, sizeof(pubkey));
+    /* Tweak computation wraps and results in a key of 1. */
+    ctmp2[31] = 2;
+    CHECK(secp256k1_ec_seckey_tweak_add(ctx, ctmp2, ctmp) == 1);
+    CHECK(secp256k1_memcmp_var(ctmp2, zeros, 31) == 0 && ctmp2[31] == 1);
+    ctmp2[31] = 2;
+    CHECK(secp256k1_ec_pubkey_tweak_add(ctx, &pubkey, ctmp2) == 1);
+    ctmp2[31] = 1;
+    CHECK(secp256k1_ec_pubkey_create(ctx, &pubkey2, ctmp2) == 1);
+    CHECK(secp256k1_memcmp_var(&pubkey, &pubkey2, sizeof(pubkey)) == 0);
+    /* Tweak mul * 2 = 1+1. */
+    CHECK(secp256k1_ec_pubkey_tweak_add(ctx, &pubkey, ctmp2) == 1);
+    ctmp2[31] = 2;
+    CHECK(secp256k1_ec_pubkey_tweak_mul(ctx, &pubkey2, ctmp2) == 1);
+    CHECK(secp256k1_memcmp_var(&pubkey, &pubkey2, sizeof(pubkey)) == 0);
+    /* Test argument errors. */
+    ecount = 0;
+    secp256k1_context_set_illegal_callback(ctx, counting_illegal_callback_fn, &ecount);
+    CHECK(ecount == 0);
+    /* Zeroize pubkey on parse error. */
+    memset(&pubkey, 0, 32);
+    CHECK(secp256k1_ec_pubkey_tweak_add(ctx, &pubkey, ctmp2) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_memcmp_var(&pubkey, zeros, sizeof(pubkey)) == 0);
+    memcpy(&pubkey, &pubkey2, sizeof(pubkey));
+    memset(&pubkey2, 0, 32);
+    CHECK(secp256k1_ec_pubkey_tweak_mul(ctx, &pubkey2, ctmp2) == 0);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_memcmp_var(&pubkey2, zeros, sizeof(pubkey2)) == 0);
+    /* Plain argument errors. */
+    ecount = 0;
+    CHECK(secp256k1_ec_seckey_verify(ctx, ctmp) == 1);
+    CHECK(ecount == 0);
+    CHECK(secp256k1_ec_seckey_verify(ctx, NULL) == 0);
+    CHECK(ecount == 1);
+    ecount = 0;
+    memset(ctmp2, 0, 32);
+    ctmp2[31] = 4;
+    CHECK(secp256k1_ec_pubkey_tweak_add(ctx, NULL, ctmp2) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_ec_pubkey_tweak_add(ctx, &pubkey, NULL) == 0);
+    CHECK(ecount == 2);
+    ecount = 0;
+    memset(ctmp2, 0, 32);
+    ctmp2[31] = 4;
+    CHECK(secp256k1_ec_pubkey_tweak_mul(ctx, NULL, ctmp2) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_ec_pubkey_tweak_mul(ctx, &pubkey, NULL) == 0);
+    CHECK(ecount == 2);
+    ecount = 0;
+    memset(ctmp2, 0, 32);
+    CHECK(secp256k1_ec_seckey_tweak_add(ctx, NULL, ctmp2) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_ec_seckey_tweak_add(ctx, ctmp, NULL) == 0);
+    CHECK(ecount == 2);
+    ecount = 0;
+    memset(ctmp2, 0, 32);
+    ctmp2[31] = 1;
+    CHECK(secp256k1_ec_seckey_tweak_mul(ctx, NULL, ctmp2) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_ec_seckey_tweak_mul(ctx, ctmp, NULL) == 0);
+    CHECK(ecount == 2);
+    ecount = 0;
+    CHECK(secp256k1_ec_pubkey_create(ctx, NULL, ctmp) == 0);
+    CHECK(ecount == 1);
+    memset(&pubkey, 1, sizeof(pubkey));
+    CHECK(secp256k1_ec_pubkey_create(ctx, &pubkey, NULL) == 0);
+    CHECK(ecount == 2);
+    CHECK(secp256k1_memcmp_var(&pubkey, zeros, sizeof(secp256k1_pubkey)) == 0);
+    /* secp256k1_ec_pubkey_combine tests. */
+    ecount = 0;
+    pubkeys[0] = &pubkey_one;
+    VG_UNDEF(&pubkeys[0], sizeof(secp256k1_pubkey *));
+    VG_UNDEF(&pubkeys[1], sizeof(secp256k1_pubkey *));
+    VG_UNDEF(&pubkeys[2], sizeof(secp256k1_pubkey *));
+    memset(&pubkey, 255, sizeof(secp256k1_pubkey));
+    VG_UNDEF(&pubkey, sizeof(secp256k1_pubkey));
+    CHECK(secp256k1_ec_pubkey_combine(ctx, &pubkey, pubkeys, 0) == 0);
+    VG_CHECK(&pubkey, sizeof(secp256k1_pubkey));
+    CHECK(secp256k1_memcmp_var(&pubkey, zeros, sizeof(secp256k1_pubkey)) == 0);
+    CHECK(ecount == 1);
+    CHECK(secp256k1_ec_pubkey_combine(ctx, NULL, pubkeys, 1) == 0);
+    CHECK(secp256k1_memcmp_var(&pubkey, zeros, sizeof(secp256k1_pubkey)) == 0);
+    CHECK(ecount == 2);
+    memset(&pubkey, 255, sizeof(secp256k1_pubkey));
+    VG_UNDEF(&pubkey, sizeof(secp256k1_pubkey));
+    CHECK(secp256k1_ec_pubkey_combine(ctx, &pubkey, NULL, 1) == 0);
+    VG_CHECK(&pubkey, sizeof(secp256k1_pubkey));
+    CHECK(secp256k1_memcmp_var(&pubkey, zeros, sizeof(secp256k1_pubkey)) == 0);
+    CHECK(ecount == 3);
+    pubkeys[0] = &pubkey_negone;
+    memset(&pubkey, 255, sizeof(secp256k1_pubkey));
+    VG_UNDEF(&pubkey, sizeof(secp256k1_pubkey));
+    CHECK(secp256k1_ec_pubkey_combine(ctx, &pubkey, pubkeys, 1) == 1);
+    VG_CHECK(&pubkey, sizeof(secp256k1_pubkey));
+    CHECK(secp256k1_memcmp_var(&pubkey, zeros, sizeof(secp256k1_pubkey)) > 0);
+    CHECK(ecount == 3);
+    len = 33;
+    CHECK(secp256k1_ec_pubkey_serialize(ctx, ctmp, &len, &pubkey, SECP256K1_EC_COMPRESSED) == 1);
+    CHECK(secp256k1_ec_pubkey_serialize(ctx, ctmp2, &len, &pubkey_negone, SECP256K1_EC_COMPRESSED) == 1);
+    CHECK(secp256k1_memcmp_var(ctmp, ctmp2, 33) == 0);
+    /* Result is infinity. */
+    pubkeys[0] = &pubkey_one;
+    pubkeys[1] = &pubkey_negone;
+    memset(&pubkey, 255, sizeof(secp256k1_pubkey));
+    VG_UNDEF(&pubkey, sizeof(secp256k1_pubkey));
+    CHECK(secp256k1_ec_pubkey_combine(ctx, &pubkey, pubkeys, 2) == 0);
+    VG_CHECK(&pubkey, sizeof(secp256k1_pubkey));
+    CHECK(secp256k1_memcmp_var(&pubkey, zeros, sizeof(secp256k1_pubkey)) == 0);
+    CHECK(ecount == 3);
+    /* Passes through infinity but comes out one. */
+    pubkeys[2] = &pubkey_one;
+    memset(&pubkey, 255, sizeof(secp256k1_pubkey));
+    VG_UNDEF(&pubkey, sizeof(secp256k1_pubkey));
+    CHECK(secp256k1_ec_pubkey_combine(ctx, &pubkey, pubkeys, 3) == 1);
+    VG_CHECK(&pubkey, sizeof(secp256k1_pubkey));
+    CHECK(secp256k1_memcmp_var(&pubkey, zeros, sizeof(secp256k1_pubkey)) > 0);
+    CHECK(ecount == 3);
+    len = 33;
+    CHECK(secp256k1_ec_pubkey_serialize(ctx, ctmp, &len, &pubkey, SECP256K1_EC_COMPRESSED) == 1);
+    CHECK(secp256k1_ec_pubkey_serialize(ctx, ctmp2, &len, &pubkey_one, SECP256K1_EC_COMPRESSED) == 1);
+    CHECK(secp256k1_memcmp_var(ctmp, ctmp2, 33) == 0);
+    /* Adds to two. */
+    pubkeys[1] = &pubkey_one;
+    memset(&pubkey, 255, sizeof(secp256k1_pubkey));
+    VG_UNDEF(&pubkey, sizeof(secp256k1_pubkey));
+    CHECK(secp256k1_ec_pubkey_combine(ctx, &pubkey, pubkeys, 2) == 1);
+    VG_CHECK(&pubkey, sizeof(secp256k1_pubkey));
+    CHECK(secp256k1_memcmp_var(&pubkey, zeros, sizeof(secp256k1_pubkey)) > 0);
+    CHECK(ecount == 3);
+    secp256k1_context_set_illegal_callback(ctx, NULL, NULL);
+}
+
+void run_eckey_negate_test(void) {
+    unsigned char seckey[32];
+    unsigned char seckey_tmp[32];
+
+    random_scalar_order_b32(seckey);
+    memcpy(seckey_tmp, seckey, 32);
+
+    /* Verify negation changes the key and changes it back */
+    CHECK(secp256k1_ec_seckey_negate(ctx, seckey) == 1);
+    CHECK(secp256k1_memcmp_var(seckey, seckey_tmp, 32) != 0);
+    CHECK(secp256k1_ec_seckey_negate(ctx, seckey) == 1);
+    CHECK(secp256k1_memcmp_var(seckey, seckey_tmp, 32) == 0);
+
+    /* Check that privkey alias gives same result */
+    CHECK(secp256k1_ec_seckey_negate(ctx, seckey) == 1);
+    CHECK(secp256k1_ec_privkey_negate(ctx, seckey_tmp) == 1);
+    CHECK(secp256k1_memcmp_var(seckey, seckey_tmp, 32) == 0);
+
+    /* Negating all 0s fails */
+    memset(seckey, 0, 32);
+    memset(seckey_tmp, 0, 32);
+    CHECK(secp256k1_ec_seckey_negate(ctx, seckey) == 0);
+    /* Check that seckey is not modified */
+    CHECK(secp256k1_memcmp_var(seckey, seckey_tmp, 32) == 0);
+
+    /* Negating an overflowing seckey fails and the seckey is zeroed. In this
+     * test, the seckey has 16 random bytes to ensure that ec_seckey_negate
+     * doesn't just set seckey to a constant value in case of failure. */
+    random_scalar_order_b32(seckey);
+    memset(seckey, 0xFF, 16);
+    memset(seckey_tmp, 0, 32);
+    CHECK(secp256k1_ec_seckey_negate(ctx, seckey) == 0);
+    CHECK(secp256k1_memcmp_var(seckey, seckey_tmp, 32) == 0);
+}
+
+void random_sign(secp256k1_scalar *sigr, secp256k1_scalar *sigs, const secp256k1_scalar *key, const secp256k1_scalar *msg, int *recid) {
+    secp256k1_scalar nonce;
+    do {
+        random_scalar_order_test(&nonce);
+    } while(!secp256k1_ecdsa_sig_sign(&ctx->ecmult_gen_ctx, sigr, sigs, key, msg, &nonce, recid));
+}
+
+void test_ecdsa_sign_verify(void) {
+    secp256k1_gej pubj;
+    secp256k1_ge pub;
+    secp256k1_scalar one;
+    secp256k1_scalar msg, key;
+    secp256k1_scalar sigr, sigs;
+    int recid;
+    int getrec;
+    random_scalar_order_test(&msg);
+    random_scalar_order_test(&key);
+    secp256k1_ecmult_gen(&ctx->ecmult_gen_ctx, &pubj, &key);
+    secp256k1_ge_set_gej(&pub, &pubj);
+    getrec = secp256k1_testrand_bits(1);
+    random_sign(&sigr, &sigs, &key, &msg, getrec?&recid:NULL);
+    if (getrec) {
+        CHECK(recid >= 0 && recid < 4);
+    }
+    CHECK(secp256k1_ecdsa_sig_verify(&ctx->ecmult_ctx, &sigr, &sigs, &pub, &msg));
+    secp256k1_scalar_set_int(&one, 1);
+    secp256k1_scalar_add(&msg, &msg, &one);
+    CHECK(!secp256k1_ecdsa_sig_verify(&ctx->ecmult_ctx, &sigr, &sigs, &pub, &msg));
+}
+
+void run_ecdsa_sign_verify(void) {
+    int i;
+    for (i = 0; i < 10*count; i++) {
+        test_ecdsa_sign_verify();
+    }
+}
+
+/** Dummy nonce generation function that just uses a precomputed nonce, and fails if it is not accepted. Use only for testing. */
+static int precomputed_nonce_function(unsigned char *nonce32, const unsigned char *msg32, const unsigned char *key32, const unsigned char *algo16, void *data, unsigned int counter) {
+    (void)msg32;
+    (void)key32;
+    (void)algo16;
+    memcpy(nonce32, data, 32);
+    return (counter == 0);
+}
+
+static int nonce_function_test_fail(unsigned char *nonce32, const unsigned char *msg32, const unsigned char *key32, const unsigned char *algo16, void *data, unsigned int counter) {
+   /* Dummy nonce generator that has a fatal error on the first counter value. */
+   if (counter == 0) {
+       return 0;
+   }
+   return nonce_function_rfc6979(nonce32, msg32, key32, algo16, data, counter - 1);
+}
+
+static int nonce_function_test_retry(unsigned char *nonce32, const unsigned char *msg32, const unsigned char *key32, const unsigned char *algo16, void *data, unsigned int counter) {
+   /* Dummy nonce generator that produces unacceptable nonces for the first several counter values. */
+   if (counter < 3) {
+       memset(nonce32, counter==0 ? 0 : 255, 32);
+       if (counter == 2) {
+           nonce32[31]--;
+       }
+       return 1;
+   }
+   if (counter < 5) {
+       static const unsigned char order[] = {
+           0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
+           0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFE,
+           0xBA,0xAE,0xDC,0xE6,0xAF,0x48,0xA0,0x3B,
+           0xBF,0xD2,0x5E,0x8C,0xD0,0x36,0x41,0x41
+       };
+       memcpy(nonce32, order, 32);
+       if (counter == 4) {
+           nonce32[31]++;
+       }
+       return 1;
+   }
+   /* Retry rate of 6979 is negligible esp. as we only call this in deterministic tests. */
+   /* If someone does fine a case where it retries for secp256k1, we'd like to know. */
+   if (counter > 5) {
+       return 0;
+   }
+   return nonce_function_rfc6979(nonce32, msg32, key32, algo16, data, counter - 5);
+}
+
+int is_empty_signature(const secp256k1_ecdsa_signature *sig) {
+    static const unsigned char res[sizeof(secp256k1_ecdsa_signature)] = {0};
+    return secp256k1_memcmp_var(sig, res, sizeof(secp256k1_ecdsa_signature)) == 0;
+}
+
+void test_ecdsa_end_to_end(void) {
+    unsigned char extra[32] = {0x00};
+    unsigned char privkey[32];
+    unsigned char message[32];
+    unsigned char privkey2[32];
+    secp256k1_ecdsa_signature signature[6];
+    secp256k1_scalar r, s;
+    unsigned char sig[74];
+    size_t siglen = 74;
+    unsigned char pubkeyc[65];
+    size_t pubkeyclen = 65;
+    secp256k1_pubkey pubkey;
+    secp256k1_pubkey pubkey_tmp;
+    unsigned char seckey[300];
+    size_t seckeylen = 300;
+
+    /* Generate a random key and message. */
+    {
+        secp256k1_scalar msg, key;
+        random_scalar_order_test(&msg);
+        random_scalar_order_test(&key);
+        secp256k1_scalar_get_b32(privkey, &key);
+        secp256k1_scalar_get_b32(message, &msg);
+    }
+
+    /* Construct and verify corresponding public key. */
+    CHECK(secp256k1_ec_seckey_verify(ctx, privkey) == 1);
+    CHECK(secp256k1_ec_pubkey_create(ctx, &pubkey, privkey) == 1);
+
+    /* Verify exporting and importing public key. */
+    CHECK(secp256k1_ec_pubkey_serialize(ctx, pubkeyc, &pubkeyclen, &pubkey, secp256k1_testrand_bits(1) == 1 ? SECP256K1_EC_COMPRESSED : SECP256K1_EC_UNCOMPRESSED));
+    memset(&pubkey, 0, sizeof(pubkey));
+    CHECK(secp256k1_ec_pubkey_parse(ctx, &pubkey, pubkeyc, pubkeyclen) == 1);
+
+    /* Verify negation changes the key and changes it back */
+    memcpy(&pubkey_tmp, &pubkey, sizeof(pubkey));
+    CHECK(secp256k1_ec_pubkey_negate(ctx, &pubkey_tmp) == 1);
+    CHECK(secp256k1_memcmp_var(&pubkey_tmp, &pubkey, sizeof(pubkey)) != 0);
+    CHECK(secp256k1_ec_pubkey_negate(ctx, &pubkey_tmp) == 1);
+    CHECK(secp256k1_memcmp_var(&pubkey_tmp, &pubkey, sizeof(pubkey)) == 0);
+
+    /* Verify private key import and export. */
+    CHECK(ec_privkey_export_der(ctx, seckey, &seckeylen, privkey, secp256k1_testrand_bits(1) == 1));
+    CHECK(ec_privkey_import_der(ctx, privkey2, seckey, seckeylen) == 1);
+    CHECK(secp256k1_memcmp_var(privkey, privkey2, 32) == 0);
+
+    /* Optionally tweak the keys using addition. */
+    if (secp256k1_testrand_int(3) == 0) {
+        int ret1;
+        int ret2;
+        int ret3;
+        unsigned char rnd[32];
+        unsigned char privkey_tmp[32];
+        secp256k1_pubkey pubkey2;
+        secp256k1_testrand256_test(rnd);
+        memcpy(privkey_tmp, privkey, 32);
+        ret1 = secp256k1_ec_seckey_tweak_add(ctx, privkey, rnd);
+        ret2 = secp256k1_ec_pubkey_tweak_add(ctx, &pubkey, rnd);
+        /* Check that privkey alias gives same result */
+        ret3 = secp256k1_ec_privkey_tweak_add(ctx, privkey_tmp, rnd);
+        CHECK(ret1 == ret2);
+        CHECK(ret2 == ret3);
+        if (ret1 == 0) {
+            return;
+        }
+        CHECK(secp256k1_memcmp_var(privkey, privkey_tmp, 32) == 0);
+        CHECK(secp256k1_ec_pubkey_create(ctx, &pubkey2, privkey) == 1);
+        CHECK(secp256k1_memcmp_var(&pubkey, &pubkey2, sizeof(pubkey)) == 0);
+    }
+
+    /* Optionally tweak the keys using multiplication. */
+    if (secp256k1_testrand_int(3) == 0) {
+        int ret1;
+        int ret2;
+        int ret3;
+        unsigned char rnd[32];
+        unsigned char privkey_tmp[32];
+        secp256k1_pubkey pubkey2;
+        secp256k1_testrand256_test(rnd);
+        memcpy(privkey_tmp, privkey, 32);
+        ret1 = secp256k1_ec_seckey_tweak_mul(ctx, privkey, rnd);
+        ret2 = secp256k1_ec_pubkey_tweak_mul(ctx, &pubkey, rnd);
+        /* Check that privkey alias gives same result */
+        ret3 = secp256k1_ec_privkey_tweak_mul(ctx, privkey_tmp, rnd);
+        CHECK(ret1 == ret2);
+        CHECK(ret2 == ret3);
+        if (ret1 == 0) {
+            return;
+        }
+        CHECK(secp256k1_memcmp_var(privkey, privkey_tmp, 32) == 0);
+        CHECK(secp256k1_ec_pubkey_create(ctx, &pubkey2, privkey) == 1);
+        CHECK(secp256k1_memcmp_var(&pubkey, &pubkey2, sizeof(pubkey)) == 0);
+    }
+
+    /* Sign. */
+    CHECK(secp256k1_ecdsa_sign(ctx, &signature[0], message, privkey, NULL, NULL) == 1);
+    CHECK(secp256k1_ecdsa_sign(ctx, &signature[4], message, privkey, NULL, NULL) == 1);
+    CHECK(secp256k1_ecdsa_sign(ctx, &signature[1], message, privkey, NULL, extra) == 1);
+    extra[31] = 1;
+    CHECK(secp256k1_ecdsa_sign(ctx, &signature[2], message, privkey, NULL, extra) == 1);
+    extra[31] = 0;
+    extra[0] = 1;
+    CHECK(secp256k1_ecdsa_sign(ctx, &signature[3], message, privkey, NULL, extra) == 1);
+    CHECK(secp256k1_memcmp_var(&signature[0], &signature[4], sizeof(signature[0])) == 0);
+    CHECK(secp256k1_memcmp_var(&signature[0], &signature[1], sizeof(signature[0])) != 0);
+    CHECK(secp256k1_memcmp_var(&signature[0], &signature[2], sizeof(signature[0])) != 0);
+    CHECK(secp256k1_memcmp_var(&signature[0], &signature[3], sizeof(signature[0])) != 0);
+    CHECK(secp256k1_memcmp_var(&signature[1], &signature[2], sizeof(signature[0])) != 0);
+    CHECK(secp256k1_memcmp_var(&signature[1], &signature[3], sizeof(signature[0])) != 0);
+    CHECK(secp256k1_memcmp_var(&signature[2], &signature[3], sizeof(signature[0])) != 0);
+    /* Verify. */
+    CHECK(secp256k1_ecdsa_verify(ctx, &signature[0], message, &pubkey) == 1);
+    CHECK(secp256k1_ecdsa_verify(ctx, &signature[1], message, &pubkey) == 1);
+    CHECK(secp256k1_ecdsa_verify(ctx, &signature[2], message, &pubkey) == 1);
+    CHECK(secp256k1_ecdsa_verify(ctx, &signature[3], message, &pubkey) == 1);
+    /* Test lower-S form, malleate, verify and fail, test again, malleate again */
+    CHECK(!secp256k1_ecdsa_signature_normalize(ctx, NULL, &signature[0]));
+    secp256k1_ecdsa_signature_load(ctx, &r, &s, &signature[0]);
+    secp256k1_scalar_negate(&s, &s);
+    secp256k1_ecdsa_signature_save(&signature[5], &r, &s);
+    CHECK(secp256k1_ecdsa_verify(ctx, &signature[5], message, &pubkey) == 0);
+    CHECK(secp256k1_ecdsa_signature_normalize(ctx, NULL, &signature[5]));
+    CHECK(secp256k1_ecdsa_signature_normalize(ctx, &signature[5], &signature[5]));
+    CHECK(!secp256k1_ecdsa_signature_normalize(ctx, NULL, &signature[5]));
+    CHECK(!secp256k1_ecdsa_signature_normalize(ctx, &signature[5], &signature[5]));
+    CHECK(secp256k1_ecdsa_verify(ctx, &signature[5], message, &pubkey) == 1);
+    secp256k1_scalar_negate(&s, &s);
+    secp256k1_ecdsa_signature_save(&signature[5], &r, &s);
+    CHECK(!secp256k1_ecdsa_signature_normalize(ctx, NULL, &signature[5]));
+    CHECK(secp256k1_ecdsa_verify(ctx, &signature[5], message, &pubkey) == 1);
+    CHECK(secp256k1_memcmp_var(&signature[5], &signature[0], 64) == 0);
+
+    /* Serialize/parse DER and verify again */
+    CHECK(secp256k1_ecdsa_signature_serialize_der(ctx, sig, &siglen, &signature[0]) == 1);
+    memset(&signature[0], 0, sizeof(signature[0]));
+    CHECK(secp256k1_ecdsa_signature_parse_der(ctx, &signature[0], sig, siglen) == 1);
+    CHECK(secp256k1_ecdsa_verify(ctx, &signature[0], message, &pubkey) == 1);
+    /* Serialize/destroy/parse DER and verify again. */
+    siglen = 74;
+    CHECK(secp256k1_ecdsa_signature_serialize_der(ctx, sig, &siglen, &signature[0]) == 1);
+    sig[secp256k1_testrand_int(siglen)] += 1 + secp256k1_testrand_int(255);
+    CHECK(secp256k1_ecdsa_signature_parse_der(ctx, &signature[0], sig, siglen) == 0 ||
+          secp256k1_ecdsa_verify(ctx, &signature[0], message, &pubkey) == 0);
+}
+
+void test_random_pubkeys(void) {
+    secp256k1_ge elem;
+    secp256k1_ge elem2;
+    unsigned char in[65];
+    /* Generate some randomly sized pubkeys. */
+    size_t len = secp256k1_testrand_bits(2) == 0 ? 65 : 33;
+    if (secp256k1_testrand_bits(2) == 0) {
+        len = secp256k1_testrand_bits(6);
+    }
+    if (len == 65) {
+      in[0] = secp256k1_testrand_bits(1) ? 4 : (secp256k1_testrand_bits(1) ? 6 : 7);
+    } else {
+      in[0] = secp256k1_testrand_bits(1) ? 2 : 3;
+    }
+    if (secp256k1_testrand_bits(3) == 0) {
+        in[0] = secp256k1_testrand_bits(8);
+    }
+    if (len > 1) {
+        secp256k1_testrand256(&in[1]);
+    }
+    if (len > 33) {
+        secp256k1_testrand256(&in[33]);
+    }
+    if (secp256k1_eckey_pubkey_parse(&elem, in, len)) {
+        unsigned char out[65];
+        unsigned char firstb;
+        int res;
+        size_t size = len;
+        firstb = in[0];
+        /* If the pubkey can be parsed, it should round-trip... */
+        CHECK(secp256k1_eckey_pubkey_serialize(&elem, out, &size, len == 33));
+        CHECK(size == len);
+        CHECK(secp256k1_memcmp_var(&in[1], &out[1], len-1) == 0);
+        /* ... except for the type of hybrid inputs. */
+        if ((in[0] != 6) && (in[0] != 7)) {
+            CHECK(in[0] == out[0]);
+        }
+        size = 65;
+        CHECK(secp256k1_eckey_pubkey_serialize(&elem, in, &size, 0));
+        CHECK(size == 65);
+        CHECK(secp256k1_eckey_pubkey_parse(&elem2, in, size));
+        ge_equals_ge(&elem,&elem2);
+        /* Check that the X9.62 hybrid type is checked. */
+        in[0] = secp256k1_testrand_bits(1) ? 6 : 7;
+        res = secp256k1_eckey_pubkey_parse(&elem2, in, size);
+        if (firstb == 2 || firstb == 3) {
+            if (in[0] == firstb + 4) {
+              CHECK(res);
+            } else {
+              CHECK(!res);
+            }
+        }
+        if (res) {
+            ge_equals_ge(&elem,&elem2);
+            CHECK(secp256k1_eckey_pubkey_serialize(&elem, out, &size, 0));
+            CHECK(secp256k1_memcmp_var(&in[1], &out[1], 64) == 0);
+        }
+    }
+}
+
+void run_random_pubkeys(void) {
+    int i;
+    for (i = 0; i < 10*count; i++) {
+        test_random_pubkeys();
+    }
+}
+
+void run_ecdsa_end_to_end(void) {
+    int i;
+    for (i = 0; i < 64*count; i++) {
+        test_ecdsa_end_to_end();
+    }
+}
+
+int test_ecdsa_der_parse(const unsigned char *sig, size_t siglen, int certainly_der, int certainly_not_der) {
+    static const unsigned char zeroes[32] = {0};
+#ifdef ENABLE_OPENSSL_TESTS
+    static const unsigned char max_scalar[32] = {
+        0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+        0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xfe,
+        0xba, 0xae, 0xdc, 0xe6, 0xaf, 0x48, 0xa0, 0x3b,
+        0xbf, 0xd2, 0x5e, 0x8c, 0xd0, 0x36, 0x41, 0x40
+    };
+#endif
+
+    int ret = 0;
+
+    secp256k1_ecdsa_signature sig_der;
+    unsigned char roundtrip_der[2048];
+    unsigned char compact_der[64];
+    size_t len_der = 2048;
+    int parsed_der = 0, valid_der = 0, roundtrips_der = 0;
+
+    secp256k1_ecdsa_signature sig_der_lax;
+    unsigned char roundtrip_der_lax[2048];
+    unsigned char compact_der_lax[64];
+    size_t len_der_lax = 2048;
+    int parsed_der_lax = 0, valid_der_lax = 0, roundtrips_der_lax = 0;
+
+#ifdef ENABLE_OPENSSL_TESTS
+    ECDSA_SIG *sig_openssl;
+    const BIGNUM *r = NULL, *s = NULL;
+    const unsigned char *sigptr;
+    unsigned char roundtrip_openssl[2048];
+    int len_openssl = 2048;
+    int parsed_openssl, valid_openssl = 0, roundtrips_openssl = 0;
+#endif
+
+    parsed_der = secp256k1_ecdsa_signature_parse_der(ctx, &sig_der, sig, siglen);
+    if (parsed_der) {
+        ret |= (!secp256k1_ecdsa_signature_serialize_compact(ctx, compact_der, &sig_der)) << 0;
+        valid_der = (secp256k1_memcmp_var(compact_der, zeroes, 32) != 0) && (secp256k1_memcmp_var(compact_der + 32, zeroes, 32) != 0);
+    }
+    if (valid_der) {
+        ret |= (!secp256k1_ecdsa_signature_serialize_der(ctx, roundtrip_der, &len_der, &sig_der)) << 1;
+        roundtrips_der = (len_der == siglen) && secp256k1_memcmp_var(roundtrip_der, sig, siglen) == 0;
+    }
+
+    parsed_der_lax = ecdsa_signature_parse_der_lax(ctx, &sig_der_lax, sig, siglen);
+    if (parsed_der_lax) {
+        ret |= (!secp256k1_ecdsa_signature_serialize_compact(ctx, compact_der_lax, &sig_der_lax)) << 10;
+        valid_der_lax = (secp256k1_memcmp_var(compact_der_lax, zeroes, 32) != 0) && (secp256k1_memcmp_var(compact_der_lax + 32, zeroes, 32) != 0);
+    }
+    if (valid_der_lax) {
+        ret |= (!secp256k1_ecdsa_signature_serialize_der(ctx, roundtrip_der_lax, &len_der_lax, &sig_der_lax)) << 11;
+        roundtrips_der_lax = (len_der_lax == siglen) && secp256k1_memcmp_var(roundtrip_der_lax, sig, siglen) == 0;
+    }
+
+    if (certainly_der) {
+        ret |= (!parsed_der) << 2;
+    }
+    if (certainly_not_der) {
+        ret |= (parsed_der) << 17;
+    }
+    if (valid_der) {
+        ret |= (!roundtrips_der) << 3;
+    }
+
+    if (valid_der) {
+        ret |= (!roundtrips_der_lax) << 12;
+        ret |= (len_der != len_der_lax) << 13;
+        ret |= ((len_der != len_der_lax) || (secp256k1_memcmp_var(roundtrip_der_lax, roundtrip_der, len_der) != 0)) << 14;
+    }
+    ret |= (roundtrips_der != roundtrips_der_lax) << 15;
+    if (parsed_der) {
+        ret |= (!parsed_der_lax) << 16;
+    }
+
+#ifdef ENABLE_OPENSSL_TESTS
+    sig_openssl = ECDSA_SIG_new();
+    sigptr = sig;
+    parsed_openssl = (d2i_ECDSA_SIG(&sig_openssl, &sigptr, siglen) != NULL);
+    if (parsed_openssl) {
+        ECDSA_SIG_get0(sig_openssl, &r, &s);
+        valid_openssl = !BN_is_negative(r) && !BN_is_negative(s) && BN_num_bits(r) > 0 && BN_num_bits(r) <= 256 && BN_num_bits(s) > 0 && BN_num_bits(s) <= 256;
+        if (valid_openssl) {
+            unsigned char tmp[32] = {0};
+            BN_bn2bin(r, tmp + 32 - BN_num_bytes(r));
+            valid_openssl = secp256k1_memcmp_var(tmp, max_scalar, 32) < 0;
+        }
+        if (valid_openssl) {
+            unsigned char tmp[32] = {0};
+            BN_bn2bin(s, tmp + 32 - BN_num_bytes(s));
+            valid_openssl = secp256k1_memcmp_var(tmp, max_scalar, 32) < 0;
+        }
+    }
+    len_openssl = i2d_ECDSA_SIG(sig_openssl, NULL);
+    if (len_openssl <= 2048) {
+        unsigned char *ptr = roundtrip_openssl;
+        CHECK(i2d_ECDSA_SIG(sig_openssl, &ptr) == len_openssl);
+        roundtrips_openssl = valid_openssl && ((size_t)len_openssl == siglen) && (secp256k1_memcmp_var(roundtrip_openssl, sig, siglen) == 0);
+    } else {
+        len_openssl = 0;
+    }
+    ECDSA_SIG_free(sig_openssl);
+
+    ret |= (parsed_der && !parsed_openssl) << 4;
+    ret |= (valid_der && !valid_openssl) << 5;
+    ret |= (roundtrips_openssl && !parsed_der) << 6;
+    ret |= (roundtrips_der != roundtrips_openssl) << 7;
+    if (roundtrips_openssl) {
+        ret |= (len_der != (size_t)len_openssl) << 8;
+        ret |= ((len_der != (size_t)len_openssl) || (secp256k1_memcmp_var(roundtrip_der, roundtrip_openssl, len_der) != 0)) << 9;
+    }
+#endif
+    return ret;
+}
+
+static void assign_big_endian(unsigned char *ptr, size_t ptrlen, uint32_t val) {
+    size_t i;
+    for (i = 0; i < ptrlen; i++) {
+        int shift = ptrlen - 1 - i;
+        if (shift >= 4) {
+            ptr[i] = 0;
+        } else {
+            ptr[i] = (val >> shift) & 0xFF;
+        }
+    }
+}
+
+static void damage_array(unsigned char *sig, size_t *len) {
+    int pos;
+    int action = secp256k1_testrand_bits(3);
+    if (action < 1 && *len > 3) {
+        /* Delete a byte. */
+        pos = secp256k1_testrand_int(*len);
+        memmove(sig + pos, sig + pos + 1, *len - pos - 1);
+        (*len)--;
+        return;
+    } else if (action < 2 && *len < 2048) {
+        /* Insert a byte. */
+        pos = secp256k1_testrand_int(1 + *len);
+        memmove(sig + pos + 1, sig + pos, *len - pos);
+        sig[pos] = secp256k1_testrand_bits(8);
+        (*len)++;
+        return;
+    } else if (action < 4) {
+        /* Modify a byte. */
+        sig[secp256k1_testrand_int(*len)] += 1 + secp256k1_testrand_int(255);
+        return;
+    } else { /* action < 8 */
+        /* Modify a bit. */
+        sig[secp256k1_testrand_int(*len)] ^= 1 << secp256k1_testrand_bits(3);
+        return;
+    }
+}
+
+static void random_ber_signature(unsigned char *sig, size_t *len, int* certainly_der, int* certainly_not_der) {
+    int der;
+    int nlow[2], nlen[2], nlenlen[2], nhbit[2], nhbyte[2], nzlen[2];
+    size_t tlen, elen, glen;
+    int indet;
+    int n;
+
+    *len = 0;
+    der = secp256k1_testrand_bits(2) == 0;
+    *certainly_der = der;
+    *certainly_not_der = 0;
+    indet = der ? 0 : secp256k1_testrand_int(10) == 0;
+
+    for (n = 0; n < 2; n++) {
+        /* We generate two classes of numbers: nlow==1 "low" ones (up to 32 bytes), nlow==0 "high" ones (32 bytes with 129 top bits set, or larger than 32 bytes) */
+        nlow[n] = der ? 1 : (secp256k1_testrand_bits(3) != 0);
+        /* The length of the number in bytes (the first byte of which will always be nonzero) */
+        nlen[n] = nlow[n] ? secp256k1_testrand_int(33) : 32 + secp256k1_testrand_int(200) * secp256k1_testrand_int(8) / 8;
+        CHECK(nlen[n] <= 232);
+        /* The top bit of the number. */
+        nhbit[n] = (nlow[n] == 0 && nlen[n] == 32) ? 1 : (nlen[n] == 0 ? 0 : secp256k1_testrand_bits(1));
+        /* The top byte of the number (after the potential hardcoded 16 0xFF characters for "high" 32 bytes numbers) */
+        nhbyte[n] = nlen[n] == 0 ? 0 : (nhbit[n] ? 128 + secp256k1_testrand_bits(7) : 1 + secp256k1_testrand_int(127));
+        /* The number of zero bytes in front of the number (which is 0 or 1 in case of DER, otherwise we extend up to 300 bytes) */
+        nzlen[n] = der ? ((nlen[n] == 0 || nhbit[n]) ? 1 : 0) : (nlow[n] ? secp256k1_testrand_int(3) : secp256k1_testrand_int(300 - nlen[n]) * secp256k1_testrand_int(8) / 8);
+        if (nzlen[n] > ((nlen[n] == 0 || nhbit[n]) ? 1 : 0)) {
+            *certainly_not_der = 1;
+        }
+        CHECK(nlen[n] + nzlen[n] <= 300);
+        /* The length of the length descriptor for the number. 0 means short encoding, anything else is long encoding. */
+        nlenlen[n] = nlen[n] + nzlen[n] < 128 ? 0 : (nlen[n] + nzlen[n] < 256 ? 1 : 2);
+        if (!der) {
+            /* nlenlen[n] max 127 bytes */
+            int add = secp256k1_testrand_int(127 - nlenlen[n]) * secp256k1_testrand_int(16) * secp256k1_testrand_int(16) / 256;
+            nlenlen[n] += add;
+            if (add != 0) {
+                *certainly_not_der = 1;
+            }
+        }
+        CHECK(nlen[n] + nzlen[n] + nlenlen[n] <= 427);
+    }
+
+    /* The total length of the data to go, so far */
+    tlen = 2 + nlenlen[0] + nlen[0] + nzlen[0] + 2 + nlenlen[1] + nlen[1] + nzlen[1];
+    CHECK(tlen <= 856);
+
+    /* The length of the garbage inside the tuple. */
+    elen = (der || indet) ? 0 : secp256k1_testrand_int(980 - tlen) * secp256k1_testrand_int(8) / 8;
+    if (elen != 0) {
+        *certainly_not_der = 1;
+    }
+    tlen += elen;
+    CHECK(tlen <= 980);
+
+    /* The length of the garbage after the end of the tuple. */
+    glen = der ? 0 : secp256k1_testrand_int(990 - tlen) * secp256k1_testrand_int(8) / 8;
+    if (glen != 0) {
+        *certainly_not_der = 1;
+    }
+    CHECK(tlen + glen <= 990);
+
+    /* Write the tuple header. */
+    sig[(*len)++] = 0x30;
+    if (indet) {
+        /* Indeterminate length */
+        sig[(*len)++] = 0x80;
+        *certainly_not_der = 1;
+    } else {
+        int tlenlen = tlen < 128 ? 0 : (tlen < 256 ? 1 : 2);
+        if (!der) {
+            int add = secp256k1_testrand_int(127 - tlenlen) * secp256k1_testrand_int(16) * secp256k1_testrand_int(16) / 256;
+            tlenlen += add;
+            if (add != 0) {
+                *certainly_not_der = 1;
+            }
+        }
+        if (tlenlen == 0) {
+            /* Short length notation */
+            sig[(*len)++] = tlen;
+        } else {
+            /* Long length notation */
+            sig[(*len)++] = 128 + tlenlen;
+            assign_big_endian(sig + *len, tlenlen, tlen);
+            *len += tlenlen;
+        }
+        tlen += tlenlen;
+    }
+    tlen += 2;
+    CHECK(tlen + glen <= 1119);
+
+    for (n = 0; n < 2; n++) {
+        /* Write the integer header. */
+        sig[(*len)++] = 0x02;
+        if (nlenlen[n] == 0) {
+            /* Short length notation */
+            sig[(*len)++] = nlen[n] + nzlen[n];
+        } else {
+            /* Long length notation. */
+            sig[(*len)++] = 128 + nlenlen[n];
+            assign_big_endian(sig + *len, nlenlen[n], nlen[n] + nzlen[n]);
+            *len += nlenlen[n];
+        }
+        /* Write zero padding */
+        while (nzlen[n] > 0) {
+            sig[(*len)++] = 0x00;
+            nzlen[n]--;
+        }
+        if (nlen[n] == 32 && !nlow[n]) {
+            /* Special extra 16 0xFF bytes in "high" 32-byte numbers */
+            int i;
+            for (i = 0; i < 16; i++) {
+                sig[(*len)++] = 0xFF;
+            }
+            nlen[n] -= 16;
+        }
+        /* Write first byte of number */
+        if (nlen[n] > 0) {
+            sig[(*len)++] = nhbyte[n];
+            nlen[n]--;
+        }
+        /* Generate remaining random bytes of number */
+        secp256k1_testrand_bytes_test(sig + *len, nlen[n]);
+        *len += nlen[n];
+        nlen[n] = 0;
+    }
+
+    /* Generate random garbage inside tuple. */
+    secp256k1_testrand_bytes_test(sig + *len, elen);
+    *len += elen;
+
+    /* Generate end-of-contents bytes. */
+    if (indet) {
+        sig[(*len)++] = 0;
+        sig[(*len)++] = 0;
+        tlen += 2;
+    }
+    CHECK(tlen + glen <= 1121);
+
+    /* Generate random garbage outside tuple. */
+    secp256k1_testrand_bytes_test(sig + *len, glen);
+    *len += glen;
+    tlen += glen;
+    CHECK(tlen <= 1121);
+    CHECK(tlen == *len);
+}
+
+void run_ecdsa_der_parse(void) {
+    int i,j;
+    for (i = 0; i < 200 * count; i++) {
+        unsigned char buffer[2048];
+        size_t buflen = 0;
+        int certainly_der = 0;
+        int certainly_not_der = 0;
+        random_ber_signature(buffer, &buflen, &certainly_der, &certainly_not_der);
+        CHECK(buflen <= 2048);
+        for (j = 0; j < 16; j++) {
+            int ret = 0;
+            if (j > 0) {
+                damage_array(buffer, &buflen);
+                /* We don't know anything anymore about the DERness of the result */
+                certainly_der = 0;
+                certainly_not_der = 0;
+            }
+            ret = test_ecdsa_der_parse(buffer, buflen, certainly_der, certainly_not_der);
+            if (ret != 0) {
+                size_t k;
+                fprintf(stderr, "Failure %x on ", ret);
+                for (k = 0; k < buflen; k++) {
+                    fprintf(stderr, "%02x ", buffer[k]);
+                }
+                fprintf(stderr, "\n");
+            }
+            CHECK(ret == 0);
+        }
+    }
+}
+
+/* Tests several edge cases. */
+void test_ecdsa_edge_cases(void) {
+    int t;
+    secp256k1_ecdsa_signature sig;
+
+    /* Test the case where ECDSA recomputes a point that is infinity. */
+    {
+        secp256k1_gej keyj;
+        secp256k1_ge key;
+        secp256k1_scalar msg;
+        secp256k1_scalar sr, ss;
+        secp256k1_scalar_set_int(&ss, 1);
+        secp256k1_scalar_negate(&ss, &ss);
+        secp256k1_scalar_inverse(&ss, &ss);
+        secp256k1_scalar_set_int(&sr, 1);
+        secp256k1_ecmult_gen(&ctx->ecmult_gen_ctx, &keyj, &sr);
+        secp256k1_ge_set_gej(&key, &keyj);
+        msg = ss;
+        CHECK(secp256k1_ecdsa_sig_verify(&ctx->ecmult_ctx, &sr, &ss, &key, &msg) == 0);
+    }
+
+    /* Verify signature with r of zero fails. */
+    {
+        const unsigned char pubkey_mods_zero[33] = {
+            0x02, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+            0xfe, 0xba, 0xae, 0xdc, 0xe6, 0xaf, 0x48, 0xa0,
+            0x3b, 0xbf, 0xd2, 0x5e, 0x8c, 0xd0, 0x36, 0x41,
+            0x41
+        };
+        secp256k1_ge key;
+        secp256k1_scalar msg;
+        secp256k1_scalar sr, ss;
+        secp256k1_scalar_set_int(&ss, 1);
+        secp256k1_scalar_set_int(&msg, 0);
+        secp256k1_scalar_set_int(&sr, 0);
+        CHECK(secp256k1_eckey_pubkey_parse(&key, pubkey_mods_zero, 33));
+        CHECK(secp256k1_ecdsa_sig_verify(&ctx->ecmult_ctx, &sr, &ss, &key, &msg) == 0);
+    }
+
+    /* Verify signature with s of zero fails. */
+    {
+        const unsigned char pubkey[33] = {
+            0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x01
+        };
+        secp256k1_ge key;
+        secp256k1_scalar msg;
+        secp256k1_scalar sr, ss;
+        secp256k1_scalar_set_int(&ss, 0);
+        secp256k1_scalar_set_int(&msg, 0);
+        secp256k1_scalar_set_int(&sr, 1);
+        CHECK(secp256k1_eckey_pubkey_parse(&key, pubkey, 33));
+        CHECK(secp256k1_ecdsa_sig_verify(&ctx->ecmult_ctx, &sr, &ss, &key, &msg) == 0);
+    }
+
+    /* Verify signature with message 0 passes. */
+    {
+        const unsigned char pubkey[33] = {
+            0x02, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x02
+        };
+        const unsigned char pubkey2[33] = {
+            0x02, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+            0xfe, 0xba, 0xae, 0xdc, 0xe6, 0xaf, 0x48, 0xa0,
+            0x3b, 0xbf, 0xd2, 0x5e, 0x8c, 0xd0, 0x36, 0x41,
+            0x43
+        };
+        secp256k1_ge key;
+        secp256k1_ge key2;
+        secp256k1_scalar msg;
+        secp256k1_scalar sr, ss;
+        secp256k1_scalar_set_int(&ss, 2);
+        secp256k1_scalar_set_int(&msg, 0);
+        secp256k1_scalar_set_int(&sr, 2);
+        CHECK(secp256k1_eckey_pubkey_parse(&key, pubkey, 33));
+        CHECK(secp256k1_eckey_pubkey_parse(&key2, pubkey2, 33));
+        CHECK(secp256k1_ecdsa_sig_verify(&ctx->ecmult_ctx, &sr, &ss, &key, &msg) == 1);
+        CHECK(secp256k1_ecdsa_sig_verify(&ctx->ecmult_ctx, &sr, &ss, &key2, &msg) == 1);
+        secp256k1_scalar_negate(&ss, &ss);
+        CHECK(secp256k1_ecdsa_sig_verify(&ctx->ecmult_ctx, &sr, &ss, &key, &msg) == 1);
+        CHECK(secp256k1_ecdsa_sig_verify(&ctx->ecmult_ctx, &sr, &ss, &key2, &msg) == 1);
+        secp256k1_scalar_set_int(&ss, 1);
+        CHECK(secp256k1_ecdsa_sig_verify(&ctx->ecmult_ctx, &sr, &ss, &key, &msg) == 0);
+        CHECK(secp256k1_ecdsa_sig_verify(&ctx->ecmult_ctx, &sr, &ss, &key2, &msg) == 0);
+    }
+
+    /* Verify signature with message 1 passes. */
+    {
+        const unsigned char pubkey[33] = {
+            0x02, 0x14, 0x4e, 0x5a, 0x58, 0xef, 0x5b, 0x22,
+            0x6f, 0xd2, 0xe2, 0x07, 0x6a, 0x77, 0xcf, 0x05,
+            0xb4, 0x1d, 0xe7, 0x4a, 0x30, 0x98, 0x27, 0x8c,
+            0x93, 0xe6, 0xe6, 0x3c, 0x0b, 0xc4, 0x73, 0x76,
+            0x25
+        };
+        const unsigned char pubkey2[33] = {
+            0x02, 0x8a, 0xd5, 0x37, 0xed, 0x73, 0xd9, 0x40,
+            0x1d, 0xa0, 0x33, 0xd2, 0xdc, 0xf0, 0xaf, 0xae,
+            0x34, 0xcf, 0x5f, 0x96, 0x4c, 0x73, 0x28, 0x0f,
+            0x92, 0xc0, 0xf6, 0x9d, 0xd9, 0xb2, 0x09, 0x10,
+            0x62
+        };
+        const unsigned char csr[32] = {
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01,
+            0x45, 0x51, 0x23, 0x19, 0x50, 0xb7, 0x5f, 0xc4,
+            0x40, 0x2d, 0xa1, 0x72, 0x2f, 0xc9, 0xba, 0xeb
+        };
+        secp256k1_ge key;
+        secp256k1_ge key2;
+        secp256k1_scalar msg;
+        secp256k1_scalar sr, ss;
+        secp256k1_scalar_set_int(&ss, 1);
+        secp256k1_scalar_set_int(&msg, 1);
+        secp256k1_scalar_set_b32(&sr, csr, NULL);
+        CHECK(secp256k1_eckey_pubkey_parse(&key, pubkey, 33));
+        CHECK(secp256k1_eckey_pubkey_parse(&key2, pubkey2, 33));
+        CHECK(secp256k1_ecdsa_sig_verify(&ctx->ecmult_ctx, &sr, &ss, &key, &msg) == 1);
+        CHECK(secp256k1_ecdsa_sig_verify(&ctx->ecmult_ctx, &sr, &ss, &key2, &msg) == 1);
+        secp256k1_scalar_negate(&ss, &ss);
+        CHECK(secp256k1_ecdsa_sig_verify(&ctx->ecmult_ctx, &sr, &ss, &key, &msg) == 1);
+        CHECK(secp256k1_ecdsa_sig_verify(&ctx->ecmult_ctx, &sr, &ss, &key2, &msg) == 1);
+        secp256k1_scalar_set_int(&ss, 2);
+        secp256k1_scalar_inverse_var(&ss, &ss);
+        CHECK(secp256k1_ecdsa_sig_verify(&ctx->ecmult_ctx, &sr, &ss, &key, &msg) == 0);
+        CHECK(secp256k1_ecdsa_sig_verify(&ctx->ecmult_ctx, &sr, &ss, &key2, &msg) == 0);
+    }
+
+    /* Verify signature with message -1 passes. */
+    {
+        const unsigned char pubkey[33] = {
+            0x03, 0xaf, 0x97, 0xff, 0x7d, 0x3a, 0xf6, 0xa0,
+            0x02, 0x94, 0xbd, 0x9f, 0x4b, 0x2e, 0xd7, 0x52,
+            0x28, 0xdb, 0x49, 0x2a, 0x65, 0xcb, 0x1e, 0x27,
+            0x57, 0x9c, 0xba, 0x74, 0x20, 0xd5, 0x1d, 0x20,
+            0xf1
+        };
+        const unsigned char csr[32] = {
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01,
+            0x45, 0x51, 0x23, 0x19, 0x50, 0xb7, 0x5f, 0xc4,
+            0x40, 0x2d, 0xa1, 0x72, 0x2f, 0xc9, 0xba, 0xee
+        };
+        secp256k1_ge key;
+        secp256k1_scalar msg;
+        secp256k1_scalar sr, ss;
+        secp256k1_scalar_set_int(&ss, 1);
+        secp256k1_scalar_set_int(&msg, 1);
+        secp256k1_scalar_negate(&msg, &msg);
+        secp256k1_scalar_set_b32(&sr, csr, NULL);
+        CHECK(secp256k1_eckey_pubkey_parse(&key, pubkey, 33));
+        CHECK(secp256k1_ecdsa_sig_verify(&ctx->ecmult_ctx, &sr, &ss, &key, &msg) == 1);
+        secp256k1_scalar_negate(&ss, &ss);
+        CHECK(secp256k1_ecdsa_sig_verify(&ctx->ecmult_ctx, &sr, &ss, &key, &msg) == 1);
+        secp256k1_scalar_set_int(&ss, 3);
+        secp256k1_scalar_inverse_var(&ss, &ss);
+        CHECK(secp256k1_ecdsa_sig_verify(&ctx->ecmult_ctx, &sr, &ss, &key, &msg) == 0);
+    }
+
+    /* Signature where s would be zero. */
+    {
+        secp256k1_pubkey pubkey;
+        size_t siglen;
+        int32_t ecount;
+        unsigned char signature[72];
+        static const unsigned char nonce[32] = {
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01,
+        };
+        static const unsigned char nonce2[32] = {
+            0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,
+            0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFF,0xFE,
+            0xBA,0xAE,0xDC,0xE6,0xAF,0x48,0xA0,0x3B,
+            0xBF,0xD2,0x5E,0x8C,0xD0,0x36,0x41,0x40
+        };
+        const unsigned char key[32] = {
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+            0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01,
+        };
+        unsigned char msg[32] = {
+            0x86, 0x41, 0x99, 0x81, 0x06, 0x23, 0x44, 0x53,
+            0xaa, 0x5f, 0x9d, 0x6a, 0x31, 0x78, 0xf4, 0xf7,
+            0xb8, 0x12, 0xe0, 0x0b, 0x81, 0x7a, 0x77, 0x62,
+            0x65, 0xdf, 0xdd, 0x31, 0xb9, 0x3e, 0x29, 0xa9,
+        };
+        ecount = 0;
+        secp256k1_context_set_illegal_callback(ctx, counting_illegal_callback_fn, &ecount);
+        CHECK(secp256k1_ecdsa_sign(ctx, &sig, msg, key, precomputed_nonce_function, nonce) == 0);
+        CHECK(secp256k1_ecdsa_sign(ctx, &sig, msg, key, precomputed_nonce_function, nonce2) == 0);
+        msg[31] = 0xaa;
+        CHECK(secp256k1_ecdsa_sign(ctx, &sig, msg, key, precomputed_nonce_function, nonce) == 1);
+        CHECK(ecount == 0);
+        CHECK(secp256k1_ecdsa_sign(ctx, NULL, msg, key, precomputed_nonce_function, nonce2) == 0);
+        CHECK(ecount == 1);
+        CHECK(secp256k1_ecdsa_sign(ctx, &sig, NULL, key, precomputed_nonce_function, nonce2) == 0);
+        CHECK(ecount == 2);
+        CHECK(secp256k1_ecdsa_sign(ctx, &sig, msg, NULL, precomputed_nonce_function, nonce2) == 0);
+        CHECK(ecount == 3);
+        CHECK(secp256k1_ecdsa_sign(ctx, &sig, msg, key, precomputed_nonce_function, nonce2) == 1);
+        CHECK(secp256k1_ec_pubkey_create(ctx, &pubkey, key) == 1);
+        CHECK(secp256k1_ecdsa_verify(ctx, NULL, msg, &pubkey) == 0);
+        CHECK(ecount == 4);
+        CHECK(secp256k1_ecdsa_verify(ctx, &sig, NULL, &pubkey) == 0);
+        CHECK(ecount == 5);
+        CHECK(secp256k1_ecdsa_verify(ctx, &sig, msg, NULL) == 0);
+        CHECK(ecount == 6);
+        CHECK(secp256k1_ecdsa_verify(ctx, &sig, msg, &pubkey) == 1);
+        CHECK(ecount == 6);
+        CHECK(secp256k1_ec_pubkey_create(ctx, &pubkey, NULL) == 0);
+        CHECK(ecount == 7);
+        /* That pubkeyload fails via an ARGCHECK is a little odd but makes sense because pubkeys are an opaque data type. */
+        CHECK(secp256k1_ecdsa_verify(ctx, &sig, msg, &pubkey) == 0);
+        CHECK(ecount == 8);
+        siglen = 72;
+        CHECK(secp256k1_ecdsa_signature_serialize_der(ctx, NULL, &siglen, &sig) == 0);
+        CHECK(ecount == 9);
+        CHECK(secp256k1_ecdsa_signature_serialize_der(ctx, signature, NULL, &sig) == 0);
+        CHECK(ecount == 10);
+        CHECK(secp256k1_ecdsa_signature_serialize_der(ctx, signature, &siglen, NULL) == 0);
+        CHECK(ecount == 11);
+        CHECK(secp256k1_ecdsa_signature_serialize_der(ctx, signature, &siglen, &sig) == 1);
+        CHECK(ecount == 11);
+        CHECK(secp256k1_ecdsa_signature_parse_der(ctx, NULL, signature, siglen) == 0);
+        CHECK(ecount == 12);
+        CHECK(secp256k1_ecdsa_signature_parse_der(ctx, &sig, NULL, siglen) == 0);
+        CHECK(ecount == 13);
+        CHECK(secp256k1_ecdsa_signature_parse_der(ctx, &sig, signature, siglen) == 1);
+        CHECK(ecount == 13);
+        siglen = 10;
+        /* Too little room for a signature does not fail via ARGCHECK. */
+        CHECK(secp256k1_ecdsa_signature_serialize_der(ctx, signature, &siglen, &sig) == 0);
+        CHECK(ecount == 13);
+        ecount = 0;
+        CHECK(secp256k1_ecdsa_signature_normalize(ctx, NULL, NULL) == 0);
+        CHECK(ecount == 1);
+        CHECK(secp256k1_ecdsa_signature_serialize_compact(ctx, NULL, &sig) == 0);
+        CHECK(ecount == 2);
+        CHECK(secp256k1_ecdsa_signature_serialize_compact(ctx, signature, NULL) == 0);
+        CHECK(ecount == 3);
+        CHECK(secp256k1_ecdsa_signature_serialize_compact(ctx, signature, &sig) == 1);
+        CHECK(ecount == 3);
+        CHECK(secp256k1_ecdsa_signature_parse_compact(ctx, NULL, signature) == 0);
+        CHECK(ecount == 4);
+        CHECK(secp256k1_ecdsa_signature_parse_compact(ctx, &sig, NULL) == 0);
+        CHECK(ecount == 5);
+        CHECK(secp256k1_ecdsa_signature_parse_compact(ctx, &sig, signature) == 1);
+        CHECK(ecount == 5);
+        memset(signature, 255, 64);
+        CHECK(secp256k1_ecdsa_signature_parse_compact(ctx, &sig, signature) == 0);
+        CHECK(ecount == 5);
+        secp256k1_context_set_illegal_callback(ctx, NULL, NULL);
+    }
+
+    /* Nonce function corner cases. */
+    for (t = 0; t < 2; t++) {
+        static const unsigned char zero[32] = {0x00};
+        int i;
+        unsigned char key[32];
+        unsigned char msg[32];
+        secp256k1_ecdsa_signature sig2;
+        secp256k1_scalar sr[512], ss;
+        const unsigned char *extra;
+        extra = t == 0 ? NULL : zero;
+        memset(msg, 0, 32);
+        msg[31] = 1;
+        /* High key results in signature failure. */
+        memset(key, 0xFF, 32);
+        CHECK(secp256k1_ecdsa_sign(ctx, &sig, msg, key, NULL, extra) == 0);
+        CHECK(is_empty_signature(&sig));
+        /* Zero key results in signature failure. */
+        memset(key, 0, 32);
+        CHECK(secp256k1_ecdsa_sign(ctx, &sig, msg, key, NULL, extra) == 0);
+        CHECK(is_empty_signature(&sig));
+        /* Nonce function failure results in signature failure. */
+        key[31] = 1;
+        CHECK(secp256k1_ecdsa_sign(ctx, &sig, msg, key, nonce_function_test_fail, extra) == 0);
+        CHECK(is_empty_signature(&sig));
+        /* The retry loop successfully makes its way to the first good value. */
+        CHECK(secp256k1_ecdsa_sign(ctx, &sig, msg, key, nonce_function_test_retry, extra) == 1);
+        CHECK(!is_empty_signature(&sig));
+        CHECK(secp256k1_ecdsa_sign(ctx, &sig2, msg, key, nonce_function_rfc6979, extra) == 1);
+        CHECK(!is_empty_signature(&sig2));
+        CHECK(secp256k1_memcmp_var(&sig, &sig2, sizeof(sig)) == 0);
+        /* The default nonce function is deterministic. */
+        CHECK(secp256k1_ecdsa_sign(ctx, &sig2, msg, key, NULL, extra) == 1);
+        CHECK(!is_empty_signature(&sig2));
+        CHECK(secp256k1_memcmp_var(&sig, &sig2, sizeof(sig)) == 0);
+        /* The default nonce function changes output with different messages. */
+        for(i = 0; i < 256; i++) {
+            int j;
+            msg[0] = i;
+            CHECK(secp256k1_ecdsa_sign(ctx, &sig2, msg, key, NULL, extra) == 1);
+            CHECK(!is_empty_signature(&sig2));
+            secp256k1_ecdsa_signature_load(ctx, &sr[i], &ss, &sig2);
+            for (j = 0; j < i; j++) {
+                CHECK(!secp256k1_scalar_eq(&sr[i], &sr[j]));
+            }
+        }
+        msg[0] = 0;
+        msg[31] = 2;
+        /* The default nonce function changes output with different keys. */
+        for(i = 256; i < 512; i++) {
+            int j;
+            key[0] = i - 256;
+            CHECK(secp256k1_ecdsa_sign(ctx, &sig2, msg, key, NULL, extra) == 1);
+            CHECK(!is_empty_signature(&sig2));
+            secp256k1_ecdsa_signature_load(ctx, &sr[i], &ss, &sig2);
+            for (j = 0; j < i; j++) {
+                CHECK(!secp256k1_scalar_eq(&sr[i], &sr[j]));
+            }
+        }
+        key[0] = 0;
+    }
+
+    {
+        /* Check that optional nonce arguments do not have equivalent effect. */
+        const unsigned char zeros[32] = {0};
+        unsigned char nonce[32];
+        unsigned char nonce2[32];
+        unsigned char nonce3[32];
+        unsigned char nonce4[32];
+        VG_UNDEF(nonce,32);
+        VG_UNDEF(nonce2,32);
+        VG_UNDEF(nonce3,32);
+        VG_UNDEF(nonce4,32);
+        CHECK(nonce_function_rfc6979(nonce, zeros, zeros, NULL, NULL, 0) == 1);
+        VG_CHECK(nonce,32);
+        CHECK(nonce_function_rfc6979(nonce2, zeros, zeros, zeros, NULL, 0) == 1);
+        VG_CHECK(nonce2,32);
+        CHECK(nonce_function_rfc6979(nonce3, zeros, zeros, NULL, (void *)zeros, 0) == 1);
+        VG_CHECK(nonce3,32);
+        CHECK(nonce_function_rfc6979(nonce4, zeros, zeros, zeros, (void *)zeros, 0) == 1);
+        VG_CHECK(nonce4,32);
+        CHECK(secp256k1_memcmp_var(nonce, nonce2, 32) != 0);
+        CHECK(secp256k1_memcmp_var(nonce, nonce3, 32) != 0);
+        CHECK(secp256k1_memcmp_var(nonce, nonce4, 32) != 0);
+        CHECK(secp256k1_memcmp_var(nonce2, nonce3, 32) != 0);
+        CHECK(secp256k1_memcmp_var(nonce2, nonce4, 32) != 0);
+        CHECK(secp256k1_memcmp_var(nonce3, nonce4, 32) != 0);
+    }
+
+
+    /* Privkey export where pubkey is the point at infinity. */
+    {
+        unsigned char privkey[300];
+        unsigned char seckey[32] = {
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,
+            0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xfe,
+            0xba, 0xae, 0xdc, 0xe6, 0xaf, 0x48, 0xa0, 0x3b,
+            0xbf, 0xd2, 0x5e, 0x8c, 0xd0, 0x36, 0x41, 0x41,
+        };
+        size_t outlen = 300;
+        CHECK(!ec_privkey_export_der(ctx, privkey, &outlen, seckey, 0));
+        outlen = 300;
+        CHECK(!ec_privkey_export_der(ctx, privkey, &outlen, seckey, 1));
+    }
+}
+
+void run_ecdsa_edge_cases(void) {
+    test_ecdsa_edge_cases();
+}
+
+#ifdef ENABLE_OPENSSL_TESTS
+EC_KEY *get_openssl_key(const unsigned char *key32) {
+    unsigned char privkey[300];
+    size_t privkeylen;
+    const unsigned char* pbegin = privkey;
+    int compr = secp256k1_testrand_bits(1);
+    EC_KEY *ec_key = EC_KEY_new_by_curve_name(NID_secp256k1);
+    CHECK(ec_privkey_export_der(ctx, privkey, &privkeylen, key32, compr));
+    CHECK(d2i_ECPrivateKey(&ec_key, &pbegin, privkeylen));
+    CHECK(EC_KEY_check_key(ec_key));
+    return ec_key;
+}
+
+void test_ecdsa_openssl(void) {
+    secp256k1_gej qj;
+    secp256k1_ge q;
+    secp256k1_scalar sigr, sigs;
+    secp256k1_scalar one;
+    secp256k1_scalar msg2;
+    secp256k1_scalar key, msg;
+    EC_KEY *ec_key;
+    unsigned int sigsize = 80;
+    size_t secp_sigsize = 80;
+    unsigned char message[32];
+    unsigned char signature[80];
+    unsigned char key32[32];
+    secp256k1_testrand256_test(message);
+    secp256k1_scalar_set_b32(&msg, message, NULL);
+    random_scalar_order_test(&key);
+    secp256k1_scalar_get_b32(key32, &key);
+    secp256k1_ecmult_gen(&ctx->ecmult_gen_ctx, &qj, &key);
+    secp256k1_ge_set_gej(&q, &qj);
+    ec_key = get_openssl_key(key32);
+    CHECK(ec_key != NULL);
+    CHECK(ECDSA_sign(0, message, sizeof(message), signature, &sigsize, ec_key));
+    CHECK(secp256k1_ecdsa_sig_parse(&sigr, &sigs, signature, sigsize));
+    CHECK(secp256k1_ecdsa_sig_verify(&ctx->ecmult_ctx, &sigr, &sigs, &q, &msg));
+    secp256k1_scalar_set_int(&one, 1);
+    secp256k1_scalar_add(&msg2, &msg, &one);
+    CHECK(!secp256k1_ecdsa_sig_verify(&ctx->ecmult_ctx, &sigr, &sigs, &q, &msg2));
+
+    random_sign(&sigr, &sigs, &key, &msg, NULL);
+    CHECK(secp256k1_ecdsa_sig_serialize(signature, &secp_sigsize, &sigr, &sigs));
+    CHECK(ECDSA_verify(0, message, sizeof(message), signature, secp_sigsize, ec_key) == 1);
+
+    EC_KEY_free(ec_key);
+}
+
+void run_ecdsa_openssl(void) {
+    int i;
+    for (i = 0; i < 10*count; i++) {
+        test_ecdsa_openssl();
+    }
+}
+#endif
+
+#ifdef ENABLE_MODULE_ECDH
+# include "modules/ecdh/tests_impl.h"
+#endif
+
+#ifdef ENABLE_MODULE_RECOVERY
+# include "modules/recovery/tests_impl.h"
+#endif
+
+#ifdef ENABLE_MODULE_EXTRAKEYS
+# include "modules/extrakeys/tests_impl.h"
+#endif
+
+#ifdef ENABLE_MODULE_SCHNORRSIG
+# include "modules/schnorrsig/tests_impl.h"
+#endif
+
+void run_secp256k1_memczero_test(void) {
+    unsigned char buf1[6] = {1, 2, 3, 4, 5, 6};
+    unsigned char buf2[sizeof(buf1)];
+
+    /* secp256k1_memczero(..., ..., 0) is a noop. */
+    memcpy(buf2, buf1, sizeof(buf1));
+    secp256k1_memczero(buf1, sizeof(buf1), 0);
+    CHECK(secp256k1_memcmp_var(buf1, buf2, sizeof(buf1)) == 0);
+
+    /* secp256k1_memczero(..., ..., 1) zeros the buffer. */
+    memset(buf2, 0, sizeof(buf2));
+    secp256k1_memczero(buf1, sizeof(buf1) , 1);
+    CHECK(secp256k1_memcmp_var(buf1, buf2, sizeof(buf1)) == 0);
+}
+
+void int_cmov_test(void) {
+    int r = INT_MAX;
+    int a = 0;
+
+    secp256k1_int_cmov(&r, &a, 0);
+    CHECK(r == INT_MAX);
+
+    r = 0; a = INT_MAX;
+    secp256k1_int_cmov(&r, &a, 1);
+    CHECK(r == INT_MAX);
+
+    a = 0;
+    secp256k1_int_cmov(&r, &a, 1);
+    CHECK(r == 0);
+
+    a = 1;
+    secp256k1_int_cmov(&r, &a, 1);
+    CHECK(r == 1);
+
+    r = 1; a = 0;
+    secp256k1_int_cmov(&r, &a, 0);
+    CHECK(r == 1);
+
+}
+
+void fe_cmov_test(void) {
+    static const secp256k1_fe zero = SECP256K1_FE_CONST(0, 0, 0, 0, 0, 0, 0, 0);
+    static const secp256k1_fe one = SECP256K1_FE_CONST(0, 0, 0, 0, 0, 0, 0, 1);
+    static const secp256k1_fe max = SECP256K1_FE_CONST(
+        0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL,
+        0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL
+    );
+    secp256k1_fe r = max;
+    secp256k1_fe a = zero;
+
+    secp256k1_fe_cmov(&r, &a, 0);
+    CHECK(secp256k1_memcmp_var(&r, &max, sizeof(r)) == 0);
+
+    r = zero; a = max;
+    secp256k1_fe_cmov(&r, &a, 1);
+    CHECK(secp256k1_memcmp_var(&r, &max, sizeof(r)) == 0);
+
+    a = zero;
+    secp256k1_fe_cmov(&r, &a, 1);
+    CHECK(secp256k1_memcmp_var(&r, &zero, sizeof(r)) == 0);
+
+    a = one;
+    secp256k1_fe_cmov(&r, &a, 1);
+    CHECK(secp256k1_memcmp_var(&r, &one, sizeof(r)) == 0);
+
+    r = one; a = zero;
+    secp256k1_fe_cmov(&r, &a, 0);
+    CHECK(secp256k1_memcmp_var(&r, &one, sizeof(r)) == 0);
+}
+
+void fe_storage_cmov_test(void) {
+    static const secp256k1_fe_storage zero = SECP256K1_FE_STORAGE_CONST(0, 0, 0, 0, 0, 0, 0, 0);
+    static const secp256k1_fe_storage one = SECP256K1_FE_STORAGE_CONST(0, 0, 0, 0, 0, 0, 0, 1);
+    static const secp256k1_fe_storage max = SECP256K1_FE_STORAGE_CONST(
+        0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL,
+        0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL
+    );
+    secp256k1_fe_storage r = max;
+    secp256k1_fe_storage a = zero;
+
+    secp256k1_fe_storage_cmov(&r, &a, 0);
+    CHECK(secp256k1_memcmp_var(&r, &max, sizeof(r)) == 0);
+
+    r = zero; a = max;
+    secp256k1_fe_storage_cmov(&r, &a, 1);
+    CHECK(secp256k1_memcmp_var(&r, &max, sizeof(r)) == 0);
+
+    a = zero;
+    secp256k1_fe_storage_cmov(&r, &a, 1);
+    CHECK(secp256k1_memcmp_var(&r, &zero, sizeof(r)) == 0);
+
+    a = one;
+    secp256k1_fe_storage_cmov(&r, &a, 1);
+    CHECK(secp256k1_memcmp_var(&r, &one, sizeof(r)) == 0);
+
+    r = one; a = zero;
+    secp256k1_fe_storage_cmov(&r, &a, 0);
+    CHECK(secp256k1_memcmp_var(&r, &one, sizeof(r)) == 0);
+}
+
+void scalar_cmov_test(void) {
+    static const secp256k1_scalar zero = SECP256K1_SCALAR_CONST(0, 0, 0, 0, 0, 0, 0, 0);
+    static const secp256k1_scalar one = SECP256K1_SCALAR_CONST(0, 0, 0, 0, 0, 0, 0, 1);
+    static const secp256k1_scalar max = SECP256K1_SCALAR_CONST(
+        0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL,
+        0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL
+    );
+    secp256k1_scalar r = max;
+    secp256k1_scalar a = zero;
+
+    secp256k1_scalar_cmov(&r, &a, 0);
+    CHECK(secp256k1_memcmp_var(&r, &max, sizeof(r)) == 0);
+
+    r = zero; a = max;
+    secp256k1_scalar_cmov(&r, &a, 1);
+    CHECK(secp256k1_memcmp_var(&r, &max, sizeof(r)) == 0);
+
+    a = zero;
+    secp256k1_scalar_cmov(&r, &a, 1);
+    CHECK(secp256k1_memcmp_var(&r, &zero, sizeof(r)) == 0);
+
+    a = one;
+    secp256k1_scalar_cmov(&r, &a, 1);
+    CHECK(secp256k1_memcmp_var(&r, &one, sizeof(r)) == 0);
+
+    r = one; a = zero;
+    secp256k1_scalar_cmov(&r, &a, 0);
+    CHECK(secp256k1_memcmp_var(&r, &one, sizeof(r)) == 0);
+}
+
+void ge_storage_cmov_test(void) {
+    static const secp256k1_ge_storage zero = SECP256K1_GE_STORAGE_CONST(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0);
+    static const secp256k1_ge_storage one = SECP256K1_GE_STORAGE_CONST(0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1);
+    static const secp256k1_ge_storage max = SECP256K1_GE_STORAGE_CONST(
+        0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL,
+        0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL,
+        0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL,
+        0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL, 0xFFFFFFFFUL
+    );
+    secp256k1_ge_storage r = max;
+    secp256k1_ge_storage a = zero;
+
+    secp256k1_ge_storage_cmov(&r, &a, 0);
+    CHECK(secp256k1_memcmp_var(&r, &max, sizeof(r)) == 0);
+
+    r = zero; a = max;
+    secp256k1_ge_storage_cmov(&r, &a, 1);
+    CHECK(secp256k1_memcmp_var(&r, &max, sizeof(r)) == 0);
+
+    a = zero;
+    secp256k1_ge_storage_cmov(&r, &a, 1);
+    CHECK(secp256k1_memcmp_var(&r, &zero, sizeof(r)) == 0);
+
+    a = one;
+    secp256k1_ge_storage_cmov(&r, &a, 1);
+    CHECK(secp256k1_memcmp_var(&r, &one, sizeof(r)) == 0);
+
+    r = one; a = zero;
+    secp256k1_ge_storage_cmov(&r, &a, 0);
+    CHECK(secp256k1_memcmp_var(&r, &one, sizeof(r)) == 0);
+}
+
+void run_cmov_tests(void) {
+    int_cmov_test();
+    fe_cmov_test();
+    fe_storage_cmov_test();
+    scalar_cmov_test();
+    ge_storage_cmov_test();
+}
+
+int main(int argc, char **argv) {
+    /* Disable buffering for stdout to improve reliability of getting
+     * diagnostic information. Happens right at the start of main because
+     * setbuf must be used before any other operation on the stream. */
+    setbuf(stdout, NULL);
+    /* Also disable buffering for stderr because it's not guaranteed that it's
+     * unbuffered on all systems. */
+    setbuf(stderr, NULL);
+
+    /* find iteration count */
+    if (argc > 1) {
+        count = strtol(argv[1], NULL, 0);
+    } else {
+        const char* env = getenv("SECP256K1_TEST_ITERS");
+        if (env) {
+            count = strtol(env, NULL, 0);
+        }
+    }
+    if (count <= 0) {
+        fputs("An iteration count of 0 or less is not allowed.\n", stderr);
+        return EXIT_FAILURE;
+    }
+    printf("test count = %i\n", count);
+
+    /* find random seed */
+    secp256k1_testrand_init(argc > 2 ? argv[2] : NULL);
+
+    /* initialize */
+    run_context_tests(0);
+    run_context_tests(1);
+    run_scratch_tests();
+    ctx = secp256k1_context_create(SECP256K1_CONTEXT_SIGN | SECP256K1_CONTEXT_VERIFY);
+    if (secp256k1_testrand_bits(1)) {
+        unsigned char rand32[32];
+        secp256k1_testrand256(rand32);
+        CHECK(secp256k1_context_randomize(ctx, secp256k1_testrand_bits(1) ? rand32 : NULL));
+    }
+
+    run_rand_bits();
+    run_rand_int();
+
+    run_sha256_tests();
+    run_hmac_sha256_tests();
+    run_rfc6979_hmac_sha256_tests();
+
+#ifndef USE_NUM_NONE
+    /* num tests */
+    run_num_smalltests();
+#endif
+
+    /* scalar tests */
+    run_scalar_tests();
+
+    /* field tests */
+    run_field_inv();
+    run_field_inv_var();
+    run_field_misc();
+    run_field_convert();
+    run_sqr();
+    run_sqrt();
+
+    /* group tests */
+    run_ge();
+    run_group_decompress();
+
+    /* ecmult tests */
+    run_wnaf();
+    run_point_times_order();
+    run_ecmult_near_split_bound();
+    run_ecmult_chain();
+    run_ecmult_constants();
+    run_ecmult_gen_blind();
+    run_ecmult_const_tests();
+    run_ecmult_multi_tests();
+    run_ec_combine();
+
+    /* endomorphism tests */
+    run_endomorphism_tests();
+
+    /* EC point parser test */
+    run_ec_pubkey_parse_test();
+
+    /* EC key edge cases */
+    run_eckey_edge_case_test();
+
+    /* EC key arithmetic test */
+    run_eckey_negate_test();
+
+#ifdef ENABLE_MODULE_ECDH
+    /* ecdh tests */
+    run_ecdh_tests();
+#endif
+
+    /* ecdsa tests */
+    run_random_pubkeys();
+    run_ecdsa_der_parse();
+    run_ecdsa_sign_verify();
+    run_ecdsa_end_to_end();
+    run_ecdsa_edge_cases();
+#ifdef ENABLE_OPENSSL_TESTS
+    run_ecdsa_openssl();
+#endif
+
+#ifdef ENABLE_MODULE_RECOVERY
+    /* ECDSA pubkey recovery tests */
+    run_recovery_tests();
+#endif
+
+#ifdef ENABLE_MODULE_EXTRAKEYS
+    run_extrakeys_tests();
+#endif
+
+#ifdef ENABLE_MODULE_SCHNORRSIG
+    run_schnorrsig_tests();
+#endif
+
+    /* util tests */
+    run_secp256k1_memczero_test();
+
+    run_cmov_tests();
+
+    secp256k1_testrand_finish();
+
+    /* shutdown */
+    secp256k1_context_destroy(ctx);
+
+    printf("no problems found\n");
+    return 0;
+}
diff --git a/depend/zcash/src/secp256k1/src/tests_exhaustive.c b/depend/zcash/src/secp256k1/src/tests_exhaustive.c
new file mode 100644
index 000000000..2bb538144
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/tests_exhaustive.c
@@ -0,0 +1,454 @@
+/***********************************************************************
+ * Copyright (c) 2016 Andrew Poelstra                                  *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#if defined HAVE_CONFIG_H
+#include "libsecp256k1-config.h"
+#endif
+
+#include <stdio.h>
+#include <stdlib.h>
+
+#include <time.h>
+
+#undef USE_ECMULT_STATIC_PRECOMPUTATION
+
+#ifndef EXHAUSTIVE_TEST_ORDER
+/* see group_impl.h for allowable values */
+#define EXHAUSTIVE_TEST_ORDER 13
+#endif
+
+#include "include/secp256k1.h"
+#include "assumptions.h"
+#include "group.h"
+#include "secp256k1.c"
+#include "testrand_impl.h"
+
+static int count = 2;
+
+/** stolen from tests.c */
+void ge_equals_ge(const secp256k1_ge *a, const secp256k1_ge *b) {
+    CHECK(a->infinity == b->infinity);
+    if (a->infinity) {
+        return;
+    }
+    CHECK(secp256k1_fe_equal_var(&a->x, &b->x));
+    CHECK(secp256k1_fe_equal_var(&a->y, &b->y));
+}
+
+void ge_equals_gej(const secp256k1_ge *a, const secp256k1_gej *b) {
+    secp256k1_fe z2s;
+    secp256k1_fe u1, u2, s1, s2;
+    CHECK(a->infinity == b->infinity);
+    if (a->infinity) {
+        return;
+    }
+    /* Check a.x * b.z^2 == b.x && a.y * b.z^3 == b.y, to avoid inverses. */
+    secp256k1_fe_sqr(&z2s, &b->z);
+    secp256k1_fe_mul(&u1, &a->x, &z2s);
+    u2 = b->x; secp256k1_fe_normalize_weak(&u2);
+    secp256k1_fe_mul(&s1, &a->y, &z2s); secp256k1_fe_mul(&s1, &s1, &b->z);
+    s2 = b->y; secp256k1_fe_normalize_weak(&s2);
+    CHECK(secp256k1_fe_equal_var(&u1, &u2));
+    CHECK(secp256k1_fe_equal_var(&s1, &s2));
+}
+
+void random_fe(secp256k1_fe *x) {
+    unsigned char bin[32];
+    do {
+        secp256k1_testrand256(bin);
+        if (secp256k1_fe_set_b32(x, bin)) {
+            return;
+        }
+    } while(1);
+}
+/** END stolen from tests.c */
+
+static uint32_t num_cores = 1;
+static uint32_t this_core = 0;
+
+SECP256K1_INLINE static int skip_section(uint64_t* iter) {
+    if (num_cores == 1) return 0;
+    *iter += 0xe7037ed1a0b428dbULL;
+    return ((((uint32_t)*iter ^ (*iter >> 32)) * num_cores) >> 32) != this_core;
+}
+
+int secp256k1_nonce_function_smallint(unsigned char *nonce32, const unsigned char *msg32,
+                                      const unsigned char *key32, const unsigned char *algo16,
+                                      void *data, unsigned int attempt) {
+    secp256k1_scalar s;
+    int *idata = data;
+    (void)msg32;
+    (void)key32;
+    (void)algo16;
+    /* Some nonces cannot be used because they'd cause s and/or r to be zero.
+     * The signing function has retry logic here that just re-calls the nonce
+     * function with an increased `attempt`. So if attempt > 0 this means we
+     * need to change the nonce to avoid an infinite loop. */
+    if (attempt > 0) {
+        *idata = (*idata + 1) % EXHAUSTIVE_TEST_ORDER;
+    }
+    secp256k1_scalar_set_int(&s, *idata);
+    secp256k1_scalar_get_b32(nonce32, &s);
+    return 1;
+}
+
+void test_exhaustive_endomorphism(const secp256k1_ge *group) {
+    int i;
+    for (i = 0; i < EXHAUSTIVE_TEST_ORDER; i++) {
+        secp256k1_ge res;
+        secp256k1_ge_mul_lambda(&res, &group[i]);
+        ge_equals_ge(&group[i * EXHAUSTIVE_TEST_LAMBDA % EXHAUSTIVE_TEST_ORDER], &res);
+    }
+}
+
+void test_exhaustive_addition(const secp256k1_ge *group, const secp256k1_gej *groupj) {
+    int i, j;
+    uint64_t iter = 0;
+
+    /* Sanity-check (and check infinity functions) */
+    CHECK(secp256k1_ge_is_infinity(&group[0]));
+    CHECK(secp256k1_gej_is_infinity(&groupj[0]));
+    for (i = 1; i < EXHAUSTIVE_TEST_ORDER; i++) {
+        CHECK(!secp256k1_ge_is_infinity(&group[i]));
+        CHECK(!secp256k1_gej_is_infinity(&groupj[i]));
+    }
+
+    /* Check all addition formulae */
+    for (j = 0; j < EXHAUSTIVE_TEST_ORDER; j++) {
+        secp256k1_fe fe_inv;
+        if (skip_section(&iter)) continue;
+        secp256k1_fe_inv(&fe_inv, &groupj[j].z);
+        for (i = 0; i < EXHAUSTIVE_TEST_ORDER; i++) {
+            secp256k1_ge zless_gej;
+            secp256k1_gej tmp;
+            /* add_var */
+            secp256k1_gej_add_var(&tmp, &groupj[i], &groupj[j], NULL);
+            ge_equals_gej(&group[(i + j) % EXHAUSTIVE_TEST_ORDER], &tmp);
+            /* add_ge */
+            if (j > 0) {
+                secp256k1_gej_add_ge(&tmp, &groupj[i], &group[j]);
+                ge_equals_gej(&group[(i + j) % EXHAUSTIVE_TEST_ORDER], &tmp);
+            }
+            /* add_ge_var */
+            secp256k1_gej_add_ge_var(&tmp, &groupj[i], &group[j], NULL);
+            ge_equals_gej(&group[(i + j) % EXHAUSTIVE_TEST_ORDER], &tmp);
+            /* add_zinv_var */
+            zless_gej.infinity = groupj[j].infinity;
+            zless_gej.x = groupj[j].x;
+            zless_gej.y = groupj[j].y;
+            secp256k1_gej_add_zinv_var(&tmp, &groupj[i], &zless_gej, &fe_inv);
+            ge_equals_gej(&group[(i + j) % EXHAUSTIVE_TEST_ORDER], &tmp);
+        }
+    }
+
+    /* Check doubling */
+    for (i = 0; i < EXHAUSTIVE_TEST_ORDER; i++) {
+        secp256k1_gej tmp;
+        secp256k1_gej_double(&tmp, &groupj[i]);
+        ge_equals_gej(&group[(2 * i) % EXHAUSTIVE_TEST_ORDER], &tmp);
+        secp256k1_gej_double_var(&tmp, &groupj[i], NULL);
+        ge_equals_gej(&group[(2 * i) % EXHAUSTIVE_TEST_ORDER], &tmp);
+    }
+
+    /* Check negation */
+    for (i = 1; i < EXHAUSTIVE_TEST_ORDER; i++) {
+        secp256k1_ge tmp;
+        secp256k1_gej tmpj;
+        secp256k1_ge_neg(&tmp, &group[i]);
+        ge_equals_ge(&group[EXHAUSTIVE_TEST_ORDER - i], &tmp);
+        secp256k1_gej_neg(&tmpj, &groupj[i]);
+        ge_equals_gej(&group[EXHAUSTIVE_TEST_ORDER - i], &tmpj);
+    }
+}
+
+void test_exhaustive_ecmult(const secp256k1_context *ctx, const secp256k1_ge *group, const secp256k1_gej *groupj) {
+    int i, j, r_log;
+    uint64_t iter = 0;
+    for (r_log = 1; r_log < EXHAUSTIVE_TEST_ORDER; r_log++) {
+        for (j = 0; j < EXHAUSTIVE_TEST_ORDER; j++) {
+            if (skip_section(&iter)) continue;
+            for (i = 0; i < EXHAUSTIVE_TEST_ORDER; i++) {
+                secp256k1_gej tmp;
+                secp256k1_scalar na, ng;
+                secp256k1_scalar_set_int(&na, i);
+                secp256k1_scalar_set_int(&ng, j);
+
+                secp256k1_ecmult(&ctx->ecmult_ctx, &tmp, &groupj[r_log], &na, &ng);
+                ge_equals_gej(&group[(i * r_log + j) % EXHAUSTIVE_TEST_ORDER], &tmp);
+
+                if (i > 0) {
+                    secp256k1_ecmult_const(&tmp, &group[i], &ng, 256);
+                    ge_equals_gej(&group[(i * j) % EXHAUSTIVE_TEST_ORDER], &tmp);
+                }
+            }
+        }
+    }
+}
+
+typedef struct {
+    secp256k1_scalar sc[2];
+    secp256k1_ge pt[2];
+} ecmult_multi_data;
+
+static int ecmult_multi_callback(secp256k1_scalar *sc, secp256k1_ge *pt, size_t idx, void *cbdata) {
+    ecmult_multi_data *data = (ecmult_multi_data*) cbdata;
+    *sc = data->sc[idx];
+    *pt = data->pt[idx];
+    return 1;
+}
+
+void test_exhaustive_ecmult_multi(const secp256k1_context *ctx, const secp256k1_ge *group) {
+    int i, j, k, x, y;
+    uint64_t iter = 0;
+    secp256k1_scratch *scratch = secp256k1_scratch_create(&ctx->error_callback, 4096);
+    for (i = 0; i < EXHAUSTIVE_TEST_ORDER; i++) {
+        for (j = 0; j < EXHAUSTIVE_TEST_ORDER; j++) {
+            for (k = 0; k < EXHAUSTIVE_TEST_ORDER; k++) {
+                for (x = 0; x < EXHAUSTIVE_TEST_ORDER; x++) {
+                    if (skip_section(&iter)) continue;
+                    for (y = 0; y < EXHAUSTIVE_TEST_ORDER; y++) {
+                        secp256k1_gej tmp;
+                        secp256k1_scalar g_sc;
+                        ecmult_multi_data data;
+
+                        secp256k1_scalar_set_int(&data.sc[0], i);
+                        secp256k1_scalar_set_int(&data.sc[1], j);
+                        secp256k1_scalar_set_int(&g_sc, k);
+                        data.pt[0] = group[x];
+                        data.pt[1] = group[y];
+
+                        secp256k1_ecmult_multi_var(&ctx->error_callback, &ctx->ecmult_ctx, scratch, &tmp, &g_sc, ecmult_multi_callback, &data, 2);
+                        ge_equals_gej(&group[(i * x + j * y + k) % EXHAUSTIVE_TEST_ORDER], &tmp);
+                    }
+                }
+            }
+        }
+    }
+    secp256k1_scratch_destroy(&ctx->error_callback, scratch);
+}
+
+void r_from_k(secp256k1_scalar *r, const secp256k1_ge *group, int k, int* overflow) {
+    secp256k1_fe x;
+    unsigned char x_bin[32];
+    k %= EXHAUSTIVE_TEST_ORDER;
+    x = group[k].x;
+    secp256k1_fe_normalize(&x);
+    secp256k1_fe_get_b32(x_bin, &x);
+    secp256k1_scalar_set_b32(r, x_bin, overflow);
+}
+
+void test_exhaustive_verify(const secp256k1_context *ctx, const secp256k1_ge *group) {
+    int s, r, msg, key;
+    uint64_t iter = 0;
+    for (s = 1; s < EXHAUSTIVE_TEST_ORDER; s++) {
+        for (r = 1; r < EXHAUSTIVE_TEST_ORDER; r++) {
+            for (msg = 1; msg < EXHAUSTIVE_TEST_ORDER; msg++) {
+                for (key = 1; key < EXHAUSTIVE_TEST_ORDER; key++) {
+                    secp256k1_ge nonconst_ge;
+                    secp256k1_ecdsa_signature sig;
+                    secp256k1_pubkey pk;
+                    secp256k1_scalar sk_s, msg_s, r_s, s_s;
+                    secp256k1_scalar s_times_k_s, msg_plus_r_times_sk_s;
+                    int k, should_verify;
+                    unsigned char msg32[32];
+
+                    if (skip_section(&iter)) continue;
+
+                    secp256k1_scalar_set_int(&s_s, s);
+                    secp256k1_scalar_set_int(&r_s, r);
+                    secp256k1_scalar_set_int(&msg_s, msg);
+                    secp256k1_scalar_set_int(&sk_s, key);
+
+                    /* Verify by hand */
+                    /* Run through every k value that gives us this r and check that *one* works.
+                     * Note there could be none, there could be multiple, ECDSA is weird. */
+                    should_verify = 0;
+                    for (k = 0; k < EXHAUSTIVE_TEST_ORDER; k++) {
+                        secp256k1_scalar check_x_s;
+                        r_from_k(&check_x_s, group, k, NULL);
+                        if (r_s == check_x_s) {
+                            secp256k1_scalar_set_int(&s_times_k_s, k);
+                            secp256k1_scalar_mul(&s_times_k_s, &s_times_k_s, &s_s);
+                            secp256k1_scalar_mul(&msg_plus_r_times_sk_s, &r_s, &sk_s);
+                            secp256k1_scalar_add(&msg_plus_r_times_sk_s, &msg_plus_r_times_sk_s, &msg_s);
+                            should_verify |= secp256k1_scalar_eq(&s_times_k_s, &msg_plus_r_times_sk_s);
+                        }
+                    }
+                    /* nb we have a "high s" rule */
+                    should_verify &= !secp256k1_scalar_is_high(&s_s);
+
+                    /* Verify by calling verify */
+                    secp256k1_ecdsa_signature_save(&sig, &r_s, &s_s);
+                    memcpy(&nonconst_ge, &group[sk_s], sizeof(nonconst_ge));
+                    secp256k1_pubkey_save(&pk, &nonconst_ge);
+                    secp256k1_scalar_get_b32(msg32, &msg_s);
+                    CHECK(should_verify ==
+                          secp256k1_ecdsa_verify(ctx, &sig, msg32, &pk));
+                }
+            }
+        }
+    }
+}
+
+void test_exhaustive_sign(const secp256k1_context *ctx, const secp256k1_ge *group) {
+    int i, j, k;
+    uint64_t iter = 0;
+
+    /* Loop */
+    for (i = 1; i < EXHAUSTIVE_TEST_ORDER; i++) {  /* message */
+        for (j = 1; j < EXHAUSTIVE_TEST_ORDER; j++) {  /* key */
+            if (skip_section(&iter)) continue;
+            for (k = 1; k < EXHAUSTIVE_TEST_ORDER; k++) {  /* nonce */
+                const int starting_k = k;
+                secp256k1_ecdsa_signature sig;
+                secp256k1_scalar sk, msg, r, s, expected_r;
+                unsigned char sk32[32], msg32[32];
+                secp256k1_scalar_set_int(&msg, i);
+                secp256k1_scalar_set_int(&sk, j);
+                secp256k1_scalar_get_b32(sk32, &sk);
+                secp256k1_scalar_get_b32(msg32, &msg);
+
+                secp256k1_ecdsa_sign(ctx, &sig, msg32, sk32, secp256k1_nonce_function_smallint, &k);
+
+                secp256k1_ecdsa_signature_load(ctx, &r, &s, &sig);
+                /* Note that we compute expected_r *after* signing -- this is important
+                 * because our nonce-computing function function might change k during
+                 * signing. */
+                r_from_k(&expected_r, group, k, NULL);
+                CHECK(r == expected_r);
+                CHECK((k * s) % EXHAUSTIVE_TEST_ORDER == (i + r * j) % EXHAUSTIVE_TEST_ORDER ||
+                      (k * (EXHAUSTIVE_TEST_ORDER - s)) % EXHAUSTIVE_TEST_ORDER == (i + r * j) % EXHAUSTIVE_TEST_ORDER);
+
+                /* Overflow means we've tried every possible nonce */
+                if (k < starting_k) {
+                    break;
+                }
+            }
+        }
+    }
+
+    /* We would like to verify zero-knowledge here by counting how often every
+     * possible (s, r) tuple appears, but because the group order is larger
+     * than the field order, when coercing the x-values to scalar values, some
+     * appear more often than others, so we are actually not zero-knowledge.
+     * (This effect also appears in the real code, but the difference is on the
+     * order of 1/2^128th the field order, so the deviation is not useful to a
+     * computationally bounded attacker.)
+     */
+}
+
+#ifdef ENABLE_MODULE_RECOVERY
+#include "src/modules/recovery/tests_exhaustive_impl.h"
+#endif
+
+#ifdef ENABLE_MODULE_EXTRAKEYS
+#include "src/modules/extrakeys/tests_exhaustive_impl.h"
+#endif
+
+#ifdef ENABLE_MODULE_SCHNORRSIG
+#include "src/modules/schnorrsig/tests_exhaustive_impl.h"
+#endif
+
+int main(int argc, char** argv) {
+    int i;
+    secp256k1_gej groupj[EXHAUSTIVE_TEST_ORDER];
+    secp256k1_ge group[EXHAUSTIVE_TEST_ORDER];
+    unsigned char rand32[32];
+    secp256k1_context *ctx;
+
+    /* Disable buffering for stdout to improve reliability of getting
+     * diagnostic information. Happens right at the start of main because
+     * setbuf must be used before any other operation on the stream. */
+    setbuf(stdout, NULL);
+    /* Also disable buffering for stderr because it's not guaranteed that it's
+     * unbuffered on all systems. */
+    setbuf(stderr, NULL);
+
+    printf("Exhaustive tests for order %lu\n", (unsigned long)EXHAUSTIVE_TEST_ORDER);
+
+    /* find iteration count */
+    if (argc > 1) {
+        count = strtol(argv[1], NULL, 0);
+    }
+    printf("test count = %i\n", count);
+
+    /* find random seed */
+    secp256k1_testrand_init(argc > 2 ? argv[2] : NULL);
+
+    /* set up split processing */
+    if (argc > 4) {
+        num_cores = strtol(argv[3], NULL, 0);
+        this_core = strtol(argv[4], NULL, 0);
+        if (num_cores < 1 || this_core >= num_cores) {
+            fprintf(stderr, "Usage: %s [count] [seed] [numcores] [thiscore]\n", argv[0]);
+            return 1;
+        }
+        printf("running tests for core %lu (out of [0..%lu])\n", (unsigned long)this_core, (unsigned long)num_cores - 1);
+    }
+
+    while (count--) {
+        /* Build context */
+        ctx = secp256k1_context_create(SECP256K1_CONTEXT_SIGN | SECP256K1_CONTEXT_VERIFY);
+        secp256k1_testrand256(rand32);
+        CHECK(secp256k1_context_randomize(ctx, rand32));
+
+        /* Generate the entire group */
+        secp256k1_gej_set_infinity(&groupj[0]);
+        secp256k1_ge_set_gej(&group[0], &groupj[0]);
+        for (i = 1; i < EXHAUSTIVE_TEST_ORDER; i++) {
+            secp256k1_gej_add_ge(&groupj[i], &groupj[i - 1], &secp256k1_ge_const_g);
+            secp256k1_ge_set_gej(&group[i], &groupj[i]);
+            if (count != 0) {
+                /* Set a different random z-value for each Jacobian point, except z=1
+                   is used in the last iteration. */
+                secp256k1_fe z;
+                random_fe(&z);
+                secp256k1_gej_rescale(&groupj[i], &z);
+            }
+
+            /* Verify against ecmult_gen */
+            {
+                secp256k1_scalar scalar_i;
+                secp256k1_gej generatedj;
+                secp256k1_ge generated;
+
+                secp256k1_scalar_set_int(&scalar_i, i);
+                secp256k1_ecmult_gen(&ctx->ecmult_gen_ctx, &generatedj, &scalar_i);
+                secp256k1_ge_set_gej(&generated, &generatedj);
+
+                CHECK(group[i].infinity == 0);
+                CHECK(generated.infinity == 0);
+                CHECK(secp256k1_fe_equal_var(&generated.x, &group[i].x));
+                CHECK(secp256k1_fe_equal_var(&generated.y, &group[i].y));
+            }
+        }
+
+        /* Run the tests */
+        test_exhaustive_endomorphism(group);
+        test_exhaustive_addition(group, groupj);
+        test_exhaustive_ecmult(ctx, group, groupj);
+        test_exhaustive_ecmult_multi(ctx, group);
+        test_exhaustive_sign(ctx, group);
+        test_exhaustive_verify(ctx, group);
+
+#ifdef ENABLE_MODULE_RECOVERY
+        test_exhaustive_recovery(ctx, group);
+#endif
+#ifdef ENABLE_MODULE_EXTRAKEYS
+        test_exhaustive_extrakeys(ctx, group);
+#endif
+#ifdef ENABLE_MODULE_SCHNORRSIG
+        test_exhaustive_schnorrsig(ctx);
+#endif
+
+        secp256k1_context_destroy(ctx);
+    }
+
+    secp256k1_testrand_finish();
+
+    printf("no problems found\n");
+    return 0;
+}
diff --git a/depend/zcash/src/secp256k1/src/util.h b/depend/zcash/src/secp256k1/src/util.h
new file mode 100644
index 000000000..2644e0043
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/util.h
@@ -0,0 +1,279 @@
+/***********************************************************************
+ * Copyright (c) 2013, 2014 Pieter Wuille                              *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#ifndef SECP256K1_UTIL_H
+#define SECP256K1_UTIL_H
+
+#if defined HAVE_CONFIG_H
+#include "libsecp256k1-config.h"
+#endif
+
+#include <stdlib.h>
+#include <stdint.h>
+#include <stdio.h>
+#include <limits.h>
+
+typedef struct {
+    void (*fn)(const char *text, void* data);
+    const void* data;
+} secp256k1_callback;
+
+static SECP256K1_INLINE void secp256k1_callback_call(const secp256k1_callback * const cb, const char * const text) {
+    cb->fn(text, (void*)cb->data);
+}
+
+#ifdef DETERMINISTIC
+#define TEST_FAILURE(msg) do { \
+    fprintf(stderr, "%s\n", msg); \
+    abort(); \
+} while(0);
+#else
+#define TEST_FAILURE(msg) do { \
+    fprintf(stderr, "%s:%d: %s\n", __FILE__, __LINE__, msg); \
+    abort(); \
+} while(0)
+#endif
+
+#if SECP256K1_GNUC_PREREQ(3, 0)
+#define EXPECT(x,c) __builtin_expect((x),(c))
+#else
+#define EXPECT(x,c) (x)
+#endif
+
+#ifdef DETERMINISTIC
+#define CHECK(cond) do { \
+    if (EXPECT(!(cond), 0)) { \
+        TEST_FAILURE("test condition failed"); \
+    } \
+} while(0)
+#else
+#define CHECK(cond) do { \
+    if (EXPECT(!(cond), 0)) { \
+        TEST_FAILURE("test condition failed: " #cond); \
+    } \
+} while(0)
+#endif
+
+/* Like assert(), but when VERIFY is defined, and side-effect safe. */
+#if defined(COVERAGE)
+#define VERIFY_CHECK(check)
+#define VERIFY_SETUP(stmt)
+#elif defined(VERIFY)
+#define VERIFY_CHECK CHECK
+#define VERIFY_SETUP(stmt) do { stmt; } while(0)
+#else
+#define VERIFY_CHECK(cond) do { (void)(cond); } while(0)
+#define VERIFY_SETUP(stmt)
+#endif
+
+/* Define `VG_UNDEF` and `VG_CHECK` when VALGRIND is defined  */
+#if !defined(VG_CHECK)
+# if defined(VALGRIND)
+#  include <valgrind/memcheck.h>
+#  define VG_UNDEF(x,y) VALGRIND_MAKE_MEM_UNDEFINED((x),(y))
+#  define VG_CHECK(x,y) VALGRIND_CHECK_MEM_IS_DEFINED((x),(y))
+# else
+#  define VG_UNDEF(x,y)
+#  define VG_CHECK(x,y)
+# endif
+#endif
+
+/* Like `VG_CHECK` but on VERIFY only */
+#if defined(VERIFY)
+#define VG_CHECK_VERIFY(x,y) VG_CHECK((x), (y))
+#else
+#define VG_CHECK_VERIFY(x,y)
+#endif
+
+static SECP256K1_INLINE void *checked_malloc(const secp256k1_callback* cb, size_t size) {
+    void *ret = malloc(size);
+    if (ret == NULL) {
+        secp256k1_callback_call(cb, "Out of memory");
+    }
+    return ret;
+}
+
+static SECP256K1_INLINE void *checked_realloc(const secp256k1_callback* cb, void *ptr, size_t size) {
+    void *ret = realloc(ptr, size);
+    if (ret == NULL) {
+        secp256k1_callback_call(cb, "Out of memory");
+    }
+    return ret;
+}
+
+#if defined(__BIGGEST_ALIGNMENT__)
+#define ALIGNMENT __BIGGEST_ALIGNMENT__
+#else
+/* Using 16 bytes alignment because common architectures never have alignment
+ * requirements above 8 for any of the types we care about. In addition we
+ * leave some room because currently we don't care about a few bytes. */
+#define ALIGNMENT 16
+#endif
+
+#define ROUND_TO_ALIGN(size) (((size + ALIGNMENT - 1) / ALIGNMENT) * ALIGNMENT)
+
+/* Assume there is a contiguous memory object with bounds [base, base + max_size)
+ * of which the memory range [base, *prealloc_ptr) is already allocated for usage,
+ * where *prealloc_ptr is an aligned pointer. In that setting, this functions
+ * reserves the subobject [*prealloc_ptr, *prealloc_ptr + alloc_size) of
+ * alloc_size bytes by increasing *prealloc_ptr accordingly, taking into account
+ * alignment requirements.
+ *
+ * The function returns an aligned pointer to the newly allocated subobject.
+ *
+ * This is useful for manual memory management: if we're simply given a block
+ * [base, base + max_size), the caller can use this function to allocate memory
+ * in this block and keep track of the current allocation state with *prealloc_ptr.
+ *
+ * It is VERIFY_CHECKed that there is enough space left in the memory object and
+ * *prealloc_ptr is aligned relative to base.
+ */
+static SECP256K1_INLINE void *manual_alloc(void** prealloc_ptr, size_t alloc_size, void* base, size_t max_size) {
+    size_t aligned_alloc_size = ROUND_TO_ALIGN(alloc_size);
+    void* ret;
+    VERIFY_CHECK(prealloc_ptr != NULL);
+    VERIFY_CHECK(*prealloc_ptr != NULL);
+    VERIFY_CHECK(base != NULL);
+    VERIFY_CHECK((unsigned char*)*prealloc_ptr >= (unsigned char*)base);
+    VERIFY_CHECK(((unsigned char*)*prealloc_ptr - (unsigned char*)base) % ALIGNMENT == 0);
+    VERIFY_CHECK((unsigned char*)*prealloc_ptr - (unsigned char*)base + aligned_alloc_size <= max_size);
+    ret = *prealloc_ptr;
+    *prealloc_ptr = (unsigned char*)*prealloc_ptr + aligned_alloc_size;
+    return ret;
+}
+
+/* Macro for restrict, when available and not in a VERIFY build. */
+#if defined(SECP256K1_BUILD) && defined(VERIFY)
+# define SECP256K1_RESTRICT
+#else
+# if (!defined(__STDC_VERSION__) || (__STDC_VERSION__ < 199901L) )
+#  if SECP256K1_GNUC_PREREQ(3,0)
+#   define SECP256K1_RESTRICT __restrict__
+#  elif (defined(_MSC_VER) && _MSC_VER >= 1400)
+#   define SECP256K1_RESTRICT __restrict
+#  else
+#   define SECP256K1_RESTRICT
+#  endif
+# else
+#  define SECP256K1_RESTRICT restrict
+# endif
+#endif
+
+#if defined(_WIN32)
+# define I64FORMAT "I64d"
+# define I64uFORMAT "I64u"
+#else
+# define I64FORMAT "lld"
+# define I64uFORMAT "llu"
+#endif
+
+#if defined(__GNUC__)
+# define SECP256K1_GNUC_EXT __extension__
+#else
+# define SECP256K1_GNUC_EXT
+#endif
+
+/* If SECP256K1_{LITTLE,BIG}_ENDIAN is not explicitly provided, infer from various other system macros. */
+#if !defined(SECP256K1_LITTLE_ENDIAN) && !defined(SECP256K1_BIG_ENDIAN)
+/* Inspired by https://github.com/rofl0r/endianness.h/blob/9853923246b065a3b52d2c43835f3819a62c7199/endianness.h#L52L73 */
+# if (defined(__BYTE_ORDER__) && defined(__ORDER_LITTLE_ENDIAN__) && __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__) || \
+     defined(_X86_) || defined(__x86_64__) || defined(__i386__) || \
+     defined(__i486__) || defined(__i586__) || defined(__i686__) || \
+     defined(__MIPSEL) || defined(_MIPSEL) || defined(MIPSEL) || \
+     defined(__ARMEL__) || defined(__AARCH64EL__) || \
+     (defined(__LITTLE_ENDIAN__) && __LITTLE_ENDIAN__ == 1) || \
+     (defined(_LITTLE_ENDIAN) && _LITTLE_ENDIAN == 1) || \
+     defined(_M_IX86) || defined(_M_AMD64) || defined(_M_ARM) /* MSVC */
+#  define SECP256K1_LITTLE_ENDIAN
+# endif
+# if (defined(__BYTE_ORDER__) && defined(__ORDER_BIG_ENDIAN__) && __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__) || \
+     defined(__MIPSEB) || defined(_MIPSEB) || defined(MIPSEB) || \
+     defined(__MICROBLAZEEB__) || defined(__ARMEB__) || defined(__AARCH64EB__) || \
+     (defined(__BIG_ENDIAN__) && __BIG_ENDIAN__ == 1) || \
+     (defined(_BIG_ENDIAN) && _BIG_ENDIAN == 1)
+#  define SECP256K1_BIG_ENDIAN
+# endif
+#endif
+#if defined(SECP256K1_LITTLE_ENDIAN) == defined(SECP256K1_BIG_ENDIAN)
+# error Please make sure that either SECP256K1_LITTLE_ENDIAN or SECP256K1_BIG_ENDIAN is set, see src/util.h.
+#endif
+
+/* Zero memory if flag == 1. Flag must be 0 or 1. Constant time. */
+static SECP256K1_INLINE void secp256k1_memczero(void *s, size_t len, int flag) {
+    unsigned char *p = (unsigned char *)s;
+    /* Access flag with a volatile-qualified lvalue.
+       This prevents clang from figuring out (after inlining) that flag can
+       take only be 0 or 1, which leads to variable time code. */
+    volatile int vflag = flag;
+    unsigned char mask = -(unsigned char) vflag;
+    while (len) {
+        *p &= ~mask;
+        p++;
+        len--;
+    }
+}
+
+/** Semantics like memcmp. Variable-time.
+ *
+ * We use this to avoid possible compiler bugs with memcmp, e.g.
+ * https://gcc.gnu.org/bugzilla/show_bug.cgi?id=95189
+ */
+static SECP256K1_INLINE int secp256k1_memcmp_var(const void *s1, const void *s2, size_t n) {
+    const unsigned char *p1 = s1, *p2 = s2;
+    size_t i;
+
+    for (i = 0; i < n; i++) {
+        int diff = p1[i] - p2[i];
+        if (diff != 0) {
+            return diff;
+        }
+    }
+    return 0;
+}
+
+/** If flag is true, set *r equal to *a; otherwise leave it. Constant-time.  Both *r and *a must be initialized and non-negative.*/
+static SECP256K1_INLINE void secp256k1_int_cmov(int *r, const int *a, int flag) {
+    unsigned int mask0, mask1, r_masked, a_masked;
+    /* Access flag with a volatile-qualified lvalue.
+       This prevents clang from figuring out (after inlining) that flag can
+       take only be 0 or 1, which leads to variable time code. */
+    volatile int vflag = flag;
+
+    /* Casting a negative int to unsigned and back to int is implementation defined behavior */
+    VERIFY_CHECK(*r >= 0 && *a >= 0);
+
+    mask0 = (unsigned int)vflag + ~0u;
+    mask1 = ~mask0;
+    r_masked = ((unsigned int)*r & mask0);
+    a_masked = ((unsigned int)*a & mask1);
+
+    *r = (int)(r_masked | a_masked);
+}
+
+/* If USE_FORCE_WIDEMUL_{INT128,INT64} is set, use that wide multiplication implementation.
+ * Otherwise use the presence of __SIZEOF_INT128__ to decide.
+ */
+#if defined(USE_FORCE_WIDEMUL_INT128)
+# define SECP256K1_WIDEMUL_INT128 1
+#elif defined(USE_FORCE_WIDEMUL_INT64)
+# define SECP256K1_WIDEMUL_INT64 1
+#elif defined(UINT128_MAX) || defined(__SIZEOF_INT128__)
+# define SECP256K1_WIDEMUL_INT128 1
+#else
+# define SECP256K1_WIDEMUL_INT64 1
+#endif
+#if defined(SECP256K1_WIDEMUL_INT128)
+# if !defined(UINT128_MAX) && defined(__SIZEOF_INT128__)
+SECP256K1_GNUC_EXT typedef unsigned __int128 uint128_t;
+SECP256K1_GNUC_EXT typedef __int128 int128_t;
+#define UINT128_MAX ((uint128_t)(-1))
+#define INT128_MAX ((int128_t)(UINT128_MAX >> 1))
+#define INT128_MIN (-INT128_MAX - 1)
+/* No (U)INT128_C macros because compilers providing __int128 do not support 128-bit literals.  */
+# endif
+#endif
+
+#endif /* SECP256K1_UTIL_H */
diff --git a/depend/zcash/src/secp256k1/src/valgrind_ctime_test.c b/depend/zcash/src/secp256k1/src/valgrind_ctime_test.c
new file mode 100644
index 000000000..40980bb27
--- /dev/null
+++ b/depend/zcash/src/secp256k1/src/valgrind_ctime_test.c
@@ -0,0 +1,163 @@
+/***********************************************************************
+ * Copyright (c) 2020 Gregory Maxwell                                  *
+ * Distributed under the MIT software license, see the accompanying    *
+ * file COPYING or https://www.opensource.org/licenses/mit-license.php.*
+ ***********************************************************************/
+
+#include <valgrind/memcheck.h>
+#include "include/secp256k1.h"
+#include "assumptions.h"
+#include "util.h"
+
+#ifdef ENABLE_MODULE_ECDH
+# include "include/secp256k1_ecdh.h"
+#endif
+
+#ifdef ENABLE_MODULE_RECOVERY
+# include "include/secp256k1_recovery.h"
+#endif
+
+#ifdef ENABLE_MODULE_EXTRAKEYS
+# include "include/secp256k1_extrakeys.h"
+#endif
+
+#ifdef ENABLE_MODULE_SCHNORRSIG
+#include "include/secp256k1_schnorrsig.h"
+#endif
+
+int main(void) {
+    secp256k1_context* ctx;
+    secp256k1_ecdsa_signature signature;
+    secp256k1_pubkey pubkey;
+    size_t siglen = 74;
+    size_t outputlen = 33;
+    int i;
+    int ret;
+    unsigned char msg[32];
+    unsigned char key[32];
+    unsigned char sig[74];
+    unsigned char spubkey[33];
+#ifdef ENABLE_MODULE_RECOVERY
+    secp256k1_ecdsa_recoverable_signature recoverable_signature;
+    int recid;
+#endif
+#ifdef ENABLE_MODULE_EXTRAKEYS
+    secp256k1_keypair keypair;
+#endif
+
+    if (!RUNNING_ON_VALGRIND) {
+        fprintf(stderr, "This test can only usefully be run inside valgrind.\n");
+        fprintf(stderr, "Usage: libtool --mode=execute valgrind ./valgrind_ctime_test\n");
+        exit(1);
+    }
+
+    /** In theory, testing with a single secret input should be sufficient:
+     *  If control flow depended on secrets the tool would generate an error.
+     */
+    for (i = 0; i < 32; i++) {
+        key[i] = i + 65;
+    }
+    for (i = 0; i < 32; i++) {
+        msg[i] = i + 1;
+    }
+
+    ctx = secp256k1_context_create(SECP256K1_CONTEXT_SIGN
+                                   | SECP256K1_CONTEXT_VERIFY
+                                   | SECP256K1_CONTEXT_DECLASSIFY);
+
+    /* Test keygen. */
+    VALGRIND_MAKE_MEM_UNDEFINED(key, 32);
+    ret = secp256k1_ec_pubkey_create(ctx, &pubkey, key);
+    VALGRIND_MAKE_MEM_DEFINED(&pubkey, sizeof(secp256k1_pubkey));
+    VALGRIND_MAKE_MEM_DEFINED(&ret, sizeof(ret));
+    CHECK(ret);
+    CHECK(secp256k1_ec_pubkey_serialize(ctx, spubkey, &outputlen, &pubkey, SECP256K1_EC_COMPRESSED) == 1);
+
+    /* Test signing. */
+    VALGRIND_MAKE_MEM_UNDEFINED(key, 32);
+    ret = secp256k1_ecdsa_sign(ctx, &signature, msg, key, NULL, NULL);
+    VALGRIND_MAKE_MEM_DEFINED(&signature, sizeof(secp256k1_ecdsa_signature));
+    VALGRIND_MAKE_MEM_DEFINED(&ret, sizeof(ret));
+    CHECK(ret);
+    CHECK(secp256k1_ecdsa_signature_serialize_der(ctx, sig, &siglen, &signature));
+
+#ifdef ENABLE_MODULE_ECDH
+    /* Test ECDH. */
+    VALGRIND_MAKE_MEM_UNDEFINED(key, 32);
+    ret = secp256k1_ecdh(ctx, msg, &pubkey, key, NULL, NULL);
+    VALGRIND_MAKE_MEM_DEFINED(&ret, sizeof(ret));
+    CHECK(ret == 1);
+#endif
+
+#ifdef ENABLE_MODULE_RECOVERY
+    /* Test signing a recoverable signature. */
+    VALGRIND_MAKE_MEM_UNDEFINED(key, 32);
+    ret = secp256k1_ecdsa_sign_recoverable(ctx, &recoverable_signature, msg, key, NULL, NULL);
+    VALGRIND_MAKE_MEM_DEFINED(&recoverable_signature, sizeof(recoverable_signature));
+    VALGRIND_MAKE_MEM_DEFINED(&ret, sizeof(ret));
+    CHECK(ret);
+    CHECK(secp256k1_ecdsa_recoverable_signature_serialize_compact(ctx, sig, &recid, &recoverable_signature));
+    CHECK(recid >= 0 && recid <= 3);
+#endif
+
+    VALGRIND_MAKE_MEM_UNDEFINED(key, 32);
+    ret = secp256k1_ec_seckey_verify(ctx, key);
+    VALGRIND_MAKE_MEM_DEFINED(&ret, sizeof(ret));
+    CHECK(ret == 1);
+
+    VALGRIND_MAKE_MEM_UNDEFINED(key, 32);
+    ret = secp256k1_ec_seckey_negate(ctx, key);
+    VALGRIND_MAKE_MEM_DEFINED(&ret, sizeof(ret));
+    CHECK(ret == 1);
+
+    VALGRIND_MAKE_MEM_UNDEFINED(key, 32);
+    VALGRIND_MAKE_MEM_UNDEFINED(msg, 32);
+    ret = secp256k1_ec_seckey_tweak_add(ctx, key, msg);
+    VALGRIND_MAKE_MEM_DEFINED(&ret, sizeof(ret));
+    CHECK(ret == 1);
+
+    VALGRIND_MAKE_MEM_UNDEFINED(key, 32);
+    VALGRIND_MAKE_MEM_UNDEFINED(msg, 32);
+    ret = secp256k1_ec_seckey_tweak_mul(ctx, key, msg);
+    VALGRIND_MAKE_MEM_DEFINED(&ret, sizeof(ret));
+    CHECK(ret == 1);
+
+    /* Test context randomisation. Do this last because it leaves the context tainted. */
+    VALGRIND_MAKE_MEM_UNDEFINED(key, 32);
+    ret = secp256k1_context_randomize(ctx, key);
+    VALGRIND_MAKE_MEM_DEFINED(&ret, sizeof(ret));
+    CHECK(ret);
+
+    /* Test keypair_create and keypair_xonly_tweak_add. */
+#ifdef ENABLE_MODULE_EXTRAKEYS
+    VALGRIND_MAKE_MEM_UNDEFINED(key, 32);
+    ret = secp256k1_keypair_create(ctx, &keypair, key);
+    VALGRIND_MAKE_MEM_DEFINED(&ret, sizeof(ret));
+    CHECK(ret == 1);
+
+    /* The tweak is not treated as a secret in keypair_tweak_add */
+    VALGRIND_MAKE_MEM_DEFINED(msg, 32);
+    ret = secp256k1_keypair_xonly_tweak_add(ctx, &keypair, msg);
+    VALGRIND_MAKE_MEM_DEFINED(&ret, sizeof(ret));
+    CHECK(ret == 1);
+
+    VALGRIND_MAKE_MEM_UNDEFINED(key, 32);
+    VALGRIND_MAKE_MEM_UNDEFINED(&keypair, sizeof(keypair));
+    ret = secp256k1_keypair_sec(ctx, key, &keypair);
+    VALGRIND_MAKE_MEM_DEFINED(&ret, sizeof(ret));
+    CHECK(ret == 1);
+#endif
+
+#ifdef ENABLE_MODULE_SCHNORRSIG
+    VALGRIND_MAKE_MEM_UNDEFINED(key, 32);
+    ret = secp256k1_keypair_create(ctx, &keypair, key);
+    VALGRIND_MAKE_MEM_DEFINED(&ret, sizeof(ret));
+    CHECK(ret == 1);
+    ret = secp256k1_schnorrsig_sign(ctx, sig, msg, &keypair, NULL, NULL);
+    VALGRIND_MAKE_MEM_DEFINED(&ret, sizeof(ret));
+    CHECK(ret == 1);
+#endif
+
+    secp256k1_context_destroy(ctx);
+    return 0;
+}
diff --git a/depend/zcash/src/sendalert.cpp b/depend/zcash/src/sendalert.cpp
new file mode 100644
index 000000000..d1b839e74
--- /dev/null
+++ b/depend/zcash/src/sendalert.cpp
@@ -0,0 +1,173 @@
+// Copyright (c) 2016-2020 The Zcash developers
+// Original code from: https://gist.github.com/laanwj/0e689cfa37b52bcbbb44
+
+/*
+
+To set up a new alert system
+----------------------------
+
+Create a new alert key pair:
+openssl ecparam -name secp256k1 -genkey -param_enc explicit -outform PEM -out data.pem
+
+Get the private key in hex:
+openssl ec -in data.pem -outform DER | tail -c 279 | xxd -p -c 279
+
+Get the public key in hex:
+openssl ec -in data.pem -pubout -outform DER | tail -c 65 | xxd -p -c 65
+
+Update the public keys found in chainparams.cpp.
+
+
+To send an alert message
+------------------------
+
+Copy the private keys into alertkeys.h.
+
+Modify the alert parameters, id and message found in this file.
+
+Build and run with -sendalert or -printalert.
+
+./zcashd -printtoconsole -sendalert
+
+One minute after starting up, the alert will be broadcast. It is then
+flooded through the network until the nRelayUntil time, and will be
+active until nExpiration OR the alert is cancelled.
+
+If you make a mistake, send another alert with nCancel set to cancel
+the bad alert.
+
+*/
+
+#include "main.h"
+#include "net.h"
+#include "alert.h"
+#include "init.h"
+
+#include "util.h"
+#include "utiltime.h"
+#include "key.h"
+#include "clientversion.h"
+#include "chainparams.h"
+
+#include "alertkeys.h"
+
+
+static const int64_t DAYS = 24 * 60 * 60;
+
+void ThreadSendAlert()
+{
+    if (!mapArgs.count("-sendalert") && !mapArgs.count("-printalert"))
+        return;
+
+    MilliSleep(60*1000); // Wait a minute so we get connected
+
+    //
+    // Alerts are relayed around the network until nRelayUntil, flood
+    // filling to every node.
+    // After the relay time is past, new nodes are told about alerts
+    // when they connect to peers, until either nExpiration or
+    // the alert is cancelled by a newer alert.
+    // Nodes never save alerts to disk, they are in-memory-only.
+    //
+    CAlert alert;
+    alert.nRelayUntil   = GetTime() + 15 * 60;
+    alert.nExpiration   = GetTime() + 10 * 365 * 24 * 60 * 60;
+    alert.nID           = 1007;  // use https://github.com/zcash/zcash/wiki/specification#assigned-numbers to keep track of alert IDs
+    alert.nCancel       = 1006;  // cancels previous messages up to this ID number
+
+    // These versions are protocol versions
+    // 170002 : 1.0.0
+    // 170006 : 1.1.2
+    // 170007 : 2.0.0
+    // 170010 : 2.1.2
+    // 170011 : 3.0.0
+    alert.nMinVer       = 170002;
+    alert.nMaxVer       = 170010;
+
+    //
+    // main.cpp:
+    //  1000 for Misc warnings like out of disk space and clock is wrong
+    //  2000 for longer invalid proof-of-work chain
+    //  Higher numbers mean higher priority
+    //  4000 or higher will put the RPC into safe mode
+    alert.nPriority     = 4000;
+    alert.strComment    = "";
+    alert.strStatusBar  = "Your client is out of date and incompatible with the Heartwood network upgrade. Please update to a recent version of Zcash (3.0.0 or later).";
+    alert.strRPCError   = alert.strStatusBar;
+
+    // Set specific client version/versions here. If setSubVer is empty, no filtering on subver is done:
+    // alert.setSubVer.insert(std::string("/MagicBean:0.7.2/"));
+    const std::vector<std::string> useragents = {}; //{"MagicBean", "BeanStalk", "AppleSeed", "EleosZcash"};
+
+    for (const std::string& useragent : useragents) {
+    }
+
+    // Sanity check
+    assert(alert.strComment.length() <= 65536); // max length in alert.h
+    assert(alert.strStatusBar.length() <= 256);
+    assert(alert.strRPCError.length() <= 256);
+
+    // Sign
+    const CChainParams& chainparams = Params();
+    std::string networkID = chainparams.NetworkIDString();
+    bool fIsTestNet = networkID.compare("test") == 0;
+    std::vector<unsigned char> vchTmp(ParseHex(fIsTestNet ? pszTestNetPrivKey : pszPrivKey));
+    CPrivKey vchPrivKey(vchTmp.begin(), vchTmp.end());
+
+    CDataStream sMsg(SER_NETWORK, CLIENT_VERSION);
+    sMsg << *(CUnsignedAlert*)&alert;
+    alert.vchMsg = std::vector<unsigned char>(sMsg.begin(), sMsg.end());
+    std::optional<CKey> key = CKey::FromPrivKey(vchPrivKey, false);
+    if (!key.has_value()) {
+        printf("ThreadSendAlert() : key.SetPrivKey failed\n");
+        return;
+    }
+    if (!key.value().Sign(Hash(alert.vchMsg.begin(), alert.vchMsg.end()), alert.vchSig))
+    {
+        printf("ThreadSendAlert() : key.Sign failed\n");
+        return;
+    }
+
+    // Test
+    CDataStream sBuffer(SER_NETWORK, CLIENT_VERSION);
+    sBuffer << alert;
+    CAlert alert2;
+    sBuffer >> alert2;
+    if (!alert2.CheckSignature(chainparams.AlertKey()))
+    {
+        printf("ThreadSendAlert() : CheckSignature failed\n");
+        return;
+    }
+    assert(alert2.vchMsg == alert.vchMsg);
+    assert(alert2.vchSig == alert.vchSig);
+    alert.SetNull();
+    printf("\nThreadSendAlert:\n");
+    printf("hash=%s\n", alert2.GetHash().ToString().c_str());
+    printf("%s\n", alert2.ToString().c_str());
+    printf("vchMsg=%s\n", HexStr(alert2.vchMsg).c_str());
+    printf("vchSig=%s\n", HexStr(alert2.vchSig).c_str());
+
+    // Confirm
+    if (!mapArgs.count("-sendalert"))
+        return;
+    while (vNodes.size() < 1 && !ShutdownRequested())
+        MilliSleep(500);
+    if (ShutdownRequested())
+        return;
+
+    // Send
+    printf("ThreadSendAlert() : Sending alert\n");
+    int nSent = 0;
+    {
+        LOCK(cs_vNodes);
+        for (CNode* pnode : vNodes)
+        {
+            if (alert2.RelayTo(pnode))
+            {
+                printf("ThreadSendAlert() : Sent alert to %s\n", pnode->addr.ToString().c_str());
+                nSent++;
+            }
+        }
+    }
+    printf("ThreadSendAlert() : Alert sent to %d nodes\n", nSent);
+}
diff --git a/depend/zcash/src/serialize.h b/depend/zcash/src/serialize.h
new file mode 100644
index 000000000..db3f75276
--- /dev/null
+++ b/depend/zcash/src/serialize.h
@@ -0,0 +1,1178 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_SERIALIZE_H
+#define BITCOIN_SERIALIZE_H
+
+#include "compat/endian.h"
+
+#include <algorithm>
+#include <array>
+#include <assert.h>
+#include <ios>
+#include <limits>
+#include <list>
+#include <map>
+#include <memory>
+#include <optional>
+#include <set>
+#include <stdint.h>
+#include <string>
+#include <string.h>
+#include <utility>
+#include <vector>
+
+
+#include <rust/ed25519/types.h>
+
+#include "prevector.h"
+
+static const unsigned int MAX_SIZE = 0x02000000;
+
+/**
+ * Dummy data type to identify deserializing constructors.
+ *
+ * By convention, a constructor of a type T with signature
+ *
+ *   template <typename Stream> T::T(deserialize_type, Stream& s)
+ *
+ * is a deserializing constructor, which builds the type by
+ * deserializing it from s. If T contains const fields, this
+ * is likely the only way to do so.
+ */
+struct deserialize_type {};
+constexpr deserialize_type deserialize {};
+
+/**
+ * Used to bypass the rule against non-const reference to temporary
+ * where it makes sense with wrappers such as CFlatData or CTxDB
+ */
+template<typename T>
+inline T& REF(const T& val)
+{
+    return const_cast<T&>(val);
+}
+
+/**
+ * Used to acquire a non-const pointer "this" to generate bodies
+ * of const serialization operations from a template
+ */
+template<typename T>
+inline T* NCONST_PTR(const T* val)
+{
+    return const_cast<T*>(val);
+}
+
+/**
+ * Get begin pointer of vector (non-const version).
+ * @note These functions avoid the undefined case of indexing into an empty
+ * vector, as well as that of indexing after the end of the vector.
+ */
+template <typename V>
+inline typename V::value_type* begin_ptr(V& v)
+{
+    return v.empty() ? NULL : &v[0];
+}
+/** Get begin pointer of vector (const version) */
+template <typename V>
+inline const typename V::value_type* begin_ptr(const V& v)
+{
+    return v.empty() ? NULL : &v[0];
+}
+/** Get end pointer of vector (non-const version) */
+template <typename V>
+inline typename V::value_type* end_ptr(V& v)
+{
+    return v.empty() ? NULL : (&v[0] + v.size());
+}
+/** Get end pointer of vector (const version) */
+template <typename V>
+inline const typename V::value_type* end_ptr(const V& v)
+{
+    return v.empty() ? NULL : (&v[0] + v.size());
+}
+
+/*
+ * Lowest-level serialization and conversion.
+ * @note Sizes of these types are verified in the tests
+ */
+template<typename Stream> inline void ser_writedata8(Stream &s, uint8_t obj)
+{
+    s.write((char*)&obj, 1);
+}
+template<typename Stream> inline void ser_writedata16(Stream &s, uint16_t obj)
+{
+    obj = htole16(obj);
+    s.write((char*)&obj, 2);
+}
+template<typename Stream> inline void ser_writedata32(Stream &s, uint32_t obj)
+{
+    obj = htole32(obj);
+    s.write((char*)&obj, 4);
+}
+template<typename Stream> inline void ser_writedata32be(Stream &s, uint32_t obj)
+{
+    obj = htobe32(obj);
+    s.write((char*)&obj, 4);
+}
+template<typename Stream> inline void ser_writedata64(Stream &s, uint64_t obj)
+{
+    obj = htole64(obj);
+    s.write((char*)&obj, 8);
+}
+template<typename Stream> inline uint8_t ser_readdata8(Stream &s)
+{
+    uint8_t obj;
+    s.read((char*)&obj, 1);
+    return obj;
+}
+template<typename Stream> inline uint16_t ser_readdata16(Stream &s)
+{
+    uint16_t obj;
+    s.read((char*)&obj, 2);
+    return le16toh(obj);
+}
+template<typename Stream> inline uint32_t ser_readdata32(Stream &s)
+{
+    uint32_t obj;
+    s.read((char*)&obj, 4);
+    return le32toh(obj);
+}
+template<typename Stream> inline uint32_t ser_readdata32be(Stream &s)
+{
+    uint32_t obj;
+    s.read((char*)&obj, 4);
+    return be32toh(obj);
+}
+template<typename Stream> inline uint64_t ser_readdata64(Stream &s)
+{
+    uint64_t obj;
+    s.read((char*)&obj, 8);
+    return le64toh(obj);
+}
+inline uint64_t ser_double_to_uint64(double x)
+{
+    union { double x; uint64_t y; } tmp;
+    tmp.x = x;
+    return tmp.y;
+}
+inline uint32_t ser_float_to_uint32(float x)
+{
+    union { float x; uint32_t y; } tmp;
+    tmp.x = x;
+    return tmp.y;
+}
+inline double ser_uint64_to_double(uint64_t y)
+{
+    union { double x; uint64_t y; } tmp;
+    tmp.y = y;
+    return tmp.x;
+}
+inline float ser_uint32_to_float(uint32_t y)
+{
+    union { float x; uint32_t y; } tmp;
+    tmp.y = y;
+    return tmp.x;
+}
+
+
+/////////////////////////////////////////////////////////////////
+//
+// Templates for serializing to anything that looks like a stream,
+// i.e. anything that supports .read(char*, size_t) and .write(char*, size_t)
+//
+
+class CSizeComputer;
+
+enum
+{
+    // primary actions
+    SER_NETWORK         = (1 << 0),
+    SER_DISK            = (1 << 1),
+    SER_GETHASH         = (1 << 2),
+};
+
+#define READWRITE(obj)      (::SerReadWrite(s, (obj), ser_action))
+#define READWRITEMANY(...)      (::SerReadWriteMany(s, ser_action, __VA_ARGS__))
+
+/**
+ * Implement two methods, "Serialize" and "Unserialize", for serializable objects. These are
+ * actually wrappers over the "SerializationOp" template method, which implements the body of each
+ * classes' serialization code. Adding "ADD_SERIALIZE_METHODS" in the body of the class causes these
+ * wrapper methods to be added as members.
+ */
+#define ADD_SERIALIZE_METHODS                                         \
+    template<typename Stream>                                         \
+    void Serialize(Stream& s) const {                                 \
+        NCONST_PTR(this)->SerializationOp(s, CSerActionSerialize());  \
+    }                                                                 \
+    template<typename Stream>                                         \
+    void Unserialize(Stream& s) {                                     \
+        SerializationOp(s, CSerActionUnserialize());                  \
+    }
+
+template<typename Stream> inline void Serialize(Stream& s, char a    ) { ser_writedata8(s, a); } // TODO Get rid of bare char
+template<typename Stream> inline void Serialize(Stream& s, int8_t a  ) { ser_writedata8(s, a); }
+template<typename Stream> inline void Serialize(Stream& s, uint8_t a ) { ser_writedata8(s, a); }
+template<typename Stream> inline void Serialize(Stream& s, int16_t a ) { ser_writedata16(s, a); }
+template<typename Stream> inline void Serialize(Stream& s, uint16_t a) { ser_writedata16(s, a); }
+template<typename Stream> inline void Serialize(Stream& s, int32_t a ) { ser_writedata32(s, a); }
+template<typename Stream> inline void Serialize(Stream& s, uint32_t a) { ser_writedata32(s, a); }
+template<typename Stream> inline void Serialize(Stream& s, int64_t a ) { ser_writedata64(s, a); }
+template<typename Stream> inline void Serialize(Stream& s, uint64_t a) { ser_writedata64(s, a); }
+template<typename Stream> inline void Serialize(Stream& s, float a   ) { ser_writedata32(s, ser_float_to_uint32(a)); }
+template<typename Stream> inline void Serialize(Stream& s, double a  ) { ser_writedata64(s, ser_double_to_uint64(a)); }
+
+template<typename Stream> inline void Unserialize(Stream& s, char& a    ) { a = ser_readdata8(s); } // TODO Get rid of bare char
+template<typename Stream> inline void Unserialize(Stream& s, int8_t& a  ) { a = ser_readdata8(s); }
+template<typename Stream> inline void Unserialize(Stream& s, uint8_t& a ) { a = ser_readdata8(s); }
+template<typename Stream> inline void Unserialize(Stream& s, int16_t& a ) { a = ser_readdata16(s); }
+template<typename Stream> inline void Unserialize(Stream& s, uint16_t& a) { a = ser_readdata16(s); }
+template<typename Stream> inline void Unserialize(Stream& s, int32_t& a ) { a = ser_readdata32(s); }
+template<typename Stream> inline void Unserialize(Stream& s, uint32_t& a) { a = ser_readdata32(s); }
+template<typename Stream> inline void Unserialize(Stream& s, int64_t& a ) { a = ser_readdata64(s); }
+template<typename Stream> inline void Unserialize(Stream& s, uint64_t& a) { a = ser_readdata64(s); }
+template<typename Stream> inline void Unserialize(Stream& s, float& a   ) { a = ser_uint32_to_float(ser_readdata32(s)); }
+template<typename Stream> inline void Unserialize(Stream& s, double& a  ) { a = ser_uint64_to_double(ser_readdata64(s)); }
+
+template<typename Stream> inline void Serialize(Stream& s, bool a)    { char f=a; ser_writedata8(s, f); }
+template<typename Stream> inline void Unserialize(Stream& s, bool& a) { char f=ser_readdata8(s); a=f; }
+
+
+
+
+
+
+/**
+ * Compact Size
+ * size <  253        -- 1 byte
+ * size <= 0xFFFF     -- 3 bytes  (253 + 2 bytes)
+ * size <= 0xFFFFFFFF -- 5 bytes  (254 + 4 bytes)
+ * size >  0xFFFFFFFF -- 9 bytes  (255 + 8 bytes)
+ */
+inline unsigned int GetSizeOfCompactSize(uint64_t nSize)
+{
+    if (nSize < 253)                return 1;
+    else if (nSize <= 0xFFFFu)      return 3;
+    else if (nSize <= 0xFFFFFFFFu)  return 5;
+    else                            return 9;
+}
+
+inline void WriteCompactSize(CSizeComputer& os, uint64_t nSize);
+
+template<typename Stream>
+void WriteCompactSize(Stream& os, uint64_t nSize)
+{
+    if (nSize < 253)
+    {
+        ser_writedata8(os, nSize);
+    }
+    else if (nSize <= 0xFFFFu)
+    {
+        ser_writedata8(os, 253);
+        ser_writedata16(os, nSize);
+    }
+    else if (nSize <= 0xFFFFFFFFu)
+    {
+        ser_writedata8(os, 254);
+        ser_writedata32(os, nSize);
+    }
+    else
+    {
+        ser_writedata8(os, 255);
+        ser_writedata64(os, nSize);
+    }
+}
+
+template<typename Stream>
+uint64_t ReadCompactSize(Stream& is)
+{
+    uint8_t chSize = ser_readdata8(is);
+    uint64_t nSizeRet = 0;
+    if (chSize < 253)
+    {
+        nSizeRet = chSize;
+    }
+    else if (chSize == 253)
+    {
+        nSizeRet = ser_readdata16(is);
+        if (nSizeRet < 253)
+            throw std::ios_base::failure("non-canonical ReadCompactSize()");
+    }
+    else if (chSize == 254)
+    {
+        nSizeRet = ser_readdata32(is);
+        if (nSizeRet < 0x10000u)
+            throw std::ios_base::failure("non-canonical ReadCompactSize()");
+    }
+    else
+    {
+        nSizeRet = ser_readdata64(is);
+        if (nSizeRet < 0x100000000ULL)
+            throw std::ios_base::failure("non-canonical ReadCompactSize()");
+    }
+    if (nSizeRet > (uint64_t)MAX_SIZE)
+        throw std::ios_base::failure("ReadCompactSize(): size too large");
+    return nSizeRet;
+}
+
+/**
+ * Variable-length integers: bytes are a MSB base-128 encoding of the number.
+ * The high bit in each byte signifies whether another digit follows. To make
+ * sure the encoding is one-to-one, one is subtracted from all but the last digit.
+ * Thus, the byte sequence a[] with length len, where all but the last byte
+ * has bit 128 set, encodes the number:
+ *
+ *  (a[len-1] & 0x7F) + sum(i=1..len-1, 128^i*((a[len-i-1] & 0x7F)+1))
+ *
+ * Properties:
+ * * Very small (0-127: 1 byte, 128-16511: 2 bytes, 16512-2113663: 3 bytes)
+ * * Every integer has exactly one encoding
+ * * Encoding does not depend on size of original integer type
+ * * No redundancy: every (infinite) byte sequence corresponds to a list
+ *   of encoded integers.
+ *
+ * 0:         [0x00]  256:        [0x81 0x00]
+ * 1:         [0x01]  16383:      [0xFE 0x7F]
+ * 127:       [0x7F]  16384:      [0xFF 0x00]
+ * 128:  [0x80 0x00]  16511: [0x80 0xFF 0x7F]
+ * 255:  [0x80 0x7F]  65535: [0x82 0xFD 0x7F]
+ * 2^32:           [0x8E 0xFE 0xFE 0xFF 0x00]
+ */
+
+template<typename I>
+inline unsigned int GetSizeOfVarInt(I n)
+{
+    int nRet = 0;
+    while(true) {
+        nRet++;
+        if (n <= 0x7F)
+            break;
+        n = (n >> 7) - 1;
+    }
+    return nRet;
+}
+
+template<typename I>
+inline void WriteVarInt(CSizeComputer& os, I n);
+
+template<typename Stream, typename I>
+void WriteVarInt(Stream& os, I n)
+{
+    unsigned char tmp[(sizeof(n)*8+6)/7];
+    int len=0;
+    while(true) {
+        tmp[len] = (n & 0x7F) | (len ? 0x80 : 0x00);
+        if (n <= 0x7F)
+            break;
+        n = (n >> 7) - 1;
+        len++;
+    }
+    do {
+        ser_writedata8(os, tmp[len]);
+    } while(len--);
+}
+
+template<typename Stream, typename I>
+I ReadVarInt(Stream& is)
+{
+    I n = 0;
+    while(true) {
+        unsigned char chData = ser_readdata8(is);
+        n = (n << 7) | (chData & 0x7F);
+        if (chData & 0x80)
+            n++;
+        else
+            return n;
+    }
+}
+
+#define FLATDATA(obj) REF(CFlatData((char*)&(obj), (char*)&(obj) + sizeof(obj)))
+#define VARINT(obj) REF(WrapVarInt(REF(obj)))
+#define COMPACTSIZE(obj) REF(CCompactSize(REF(obj)))
+#define LIMITED_STRING(obj,n) REF(LimitedString< n >(REF(obj)))
+
+/**
+ * Wrapper for serializing arrays and POD.
+ */
+class CFlatData
+{
+protected:
+    char* pbegin;
+    char* pend;
+public:
+    CFlatData(void* pbeginIn, void* pendIn) : pbegin((char*)pbeginIn), pend((char*)pendIn) { }
+    template <class T, class TAl>
+    explicit CFlatData(std::vector<T,TAl> &v)
+    {
+        pbegin = (char*)begin_ptr(v);
+        pend = (char*)end_ptr(v);
+    }
+    template <unsigned int N, typename T, typename S, typename D>
+    explicit CFlatData(prevector<N, T, S, D> &v)
+    {
+        pbegin = (char*)begin_ptr(v);
+        pend = (char*)end_ptr(v);
+    }
+    char* begin() { return pbegin; }
+    const char* begin() const { return pbegin; }
+    char* end() { return pend; }
+    const char* end() const { return pend; }
+
+    template<typename Stream>
+    void Serialize(Stream& s) const
+    {
+        s.write(pbegin, pend - pbegin);
+    }
+
+    template<typename Stream>
+    void Unserialize(Stream& s)
+    {
+        s.read(pbegin, pend - pbegin);
+    }
+};
+
+template<typename I>
+class CVarInt
+{
+protected:
+    I &n;
+public:
+    CVarInt(I& nIn) : n(nIn) { }
+
+    template<typename Stream>
+    void Serialize(Stream &s) const {
+        WriteVarInt<Stream,I>(s, n);
+    }
+
+    template<typename Stream>
+    void Unserialize(Stream& s) {
+        n = ReadVarInt<Stream,I>(s);
+    }
+};
+
+class CCompactSize
+{
+protected:
+    uint64_t &n;
+public:
+    CCompactSize(uint64_t& nIn) : n(nIn) { }
+
+    template<typename Stream>
+    void Serialize(Stream &s) const {
+        WriteCompactSize<Stream>(s, n);
+    }
+
+    template<typename Stream>
+    void Unserialize(Stream& s) {
+        n = ReadCompactSize<Stream>(s);
+    }
+};
+
+template<size_t Limit>
+class LimitedString
+{
+protected:
+    std::string& string;
+public:
+    LimitedString(std::string& _string) : string(_string) {}
+
+    template<typename Stream>
+    void Unserialize(Stream& s)
+    {
+        size_t size = ReadCompactSize(s);
+        if (size > Limit) {
+            throw std::ios_base::failure("String length limit exceeded");
+        }
+        string.resize(size);
+        if (size != 0)
+            s.read((char*)&string[0], size);
+    }
+
+    template<typename Stream>
+    void Serialize(Stream& s) const
+    {
+        WriteCompactSize(s, string.size());
+        if (!string.empty())
+            s.write((char*)&string[0], string.size());
+    }
+};
+
+template<typename I>
+CVarInt<I> WrapVarInt(I& n) { return CVarInt<I>(n); }
+
+/**
+ * Forward declarations
+ */
+
+/**
+ *  string
+ */
+template<typename Stream, typename C, typename T, typename A>
+void Serialize(Stream& os, const std::basic_string<C, T, A>& str);
+
+template<typename Stream, typename C, typename T, typename A>
+void Unserialize(Stream& is, std::basic_string<C, T, A>& str);
+
+/**
+ * prevector
+ * prevectors of unsigned char are a special case and are intended to be serialized as a single opaque blob.
+ */
+template<typename Stream, unsigned int N, typename T> void Serialize_impl(Stream& os, const prevector<N, T>& v, const unsigned char&);
+template<typename Stream, unsigned int N, typename T, typename V> void Serialize_impl(Stream& os, const prevector<N, T>& v, const V&);
+template<typename Stream, unsigned int N, typename T> inline void Serialize(Stream& os, const prevector<N, T>& v);
+template<typename Stream, unsigned int N, typename T> void Unserialize_impl(Stream& is, prevector<N, T>& v, const unsigned char&);
+template<typename Stream, unsigned int N, typename T, typename V> void Unserialize_impl(Stream& is, prevector<N, T>& v, const V&);
+template<typename Stream, unsigned int N, typename T> inline void Unserialize(Stream& is, prevector<N, T>& v);
+
+/**
+ * vector
+ * vectors of unsigned char are a special case and are intended to be serialized as a single opaque blob.
+ */
+template<typename Stream, typename T, typename A> void Serialize_impl(Stream& os, const std::vector<T, A>& v, const unsigned char&);
+template<typename Stream, typename T, typename A, typename V> void Serialize_impl(Stream& os, const std::vector<T, A>& v, const V&);
+template<typename Stream, typename T, typename A> inline void Serialize(Stream& os, const std::vector<T, A>& v);
+template<typename Stream, typename T, typename A> void Unserialize_impl(Stream& is, std::vector<T, A>& v, const unsigned char&);
+template<typename Stream, typename T, typename A, typename V> void Unserialize_impl(Stream& is, std::vector<T, A>& v, const V&);
+template<typename Stream, typename T, typename A> inline void Unserialize(Stream& is, std::vector<T, A>& v);
+
+/**
+ * optional
+ */
+template<typename Stream, typename T> void Serialize(Stream& os, const std::optional<T>& item);
+template<typename Stream, typename T> void Unserialize(Stream& is, std::optional<T>& item);
+
+/**
+ * array
+ */
+template<typename Stream, typename T, std::size_t N> void Serialize(Stream& os, const std::array<T, N>& item);
+template<typename Stream, typename T, std::size_t N> void Unserialize(Stream& is, std::array<T, N>& item);
+
+/**
+ * pair
+ */
+template<typename Stream, typename K, typename T> void Serialize(Stream& os, const std::pair<K, T>& item);
+template<typename Stream, typename K, typename T> void Unserialize(Stream& is, std::pair<K, T>& item);
+
+/**
+ * map
+ */
+template<typename Stream, typename K, typename T, typename Pred, typename A> void Serialize(Stream& os, const std::map<K, T, Pred, A>& m);
+template<typename Stream, typename K, typename T, typename Pred, typename A> void Unserialize(Stream& is, std::map<K, T, Pred, A>& m);
+
+/**
+ * set
+ */
+template<typename Stream, typename K, typename Pred, typename A> void Serialize(Stream& os, const std::set<K, Pred, A>& m);
+template<typename Stream, typename K, typename Pred, typename A> void Unserialize(Stream& is, std::set<K, Pred, A>& m);
+
+/**
+ * list
+ */
+template<typename Stream, typename T, typename A> void Serialize(Stream& os, const std::list<T, A>& m);
+template<typename Stream, typename T, typename A> void Unserialize(Stream& is, std::list<T, A>& m);
+
+/**
+ * shared_ptr
+ */
+template<typename Stream, typename T> void Serialize(Stream& os, const std::shared_ptr<const T>& p);
+template<typename Stream, typename T> void Unserialize(Stream& os, std::shared_ptr<const T>& p);
+
+/**
+ * unique_ptr
+ */
+template<typename Stream, typename T> void Serialize(Stream& os, const std::unique_ptr<const T>& p);
+template<typename Stream, typename T> void Unserialize(Stream& os, std::unique_ptr<const T>& p);
+
+/**
+ * Ed25519SigningKey
+ */
+template<typename Stream> void Serialize(Stream& os, const Ed25519SigningKey& item);
+template<typename Stream> void Unserialize(Stream& is, Ed25519SigningKey& item);
+
+/**
+ * Ed25519VerificationKey
+ */
+template<typename Stream> void Serialize(Stream& os, const Ed25519VerificationKey& item);
+template<typename Stream> void Unserialize(Stream& is, Ed25519VerificationKey& item);
+
+/**
+ * Ed25519Signature
+ */
+template<typename Stream> void Serialize(Stream& os, const Ed25519Signature& item);
+template<typename Stream> void Unserialize(Stream& is, Ed25519Signature& item);
+
+
+
+/**
+ * If none of the specialized versions above matched, default to calling member function.
+ */
+template<typename Stream, typename T>
+inline void Serialize(Stream& os, const T& a)
+{
+    a.Serialize(os);
+}
+
+template<typename Stream, typename T>
+inline void Unserialize(Stream& is, T& a)
+{
+    a.Unserialize(is);
+}
+
+
+
+
+
+/**
+ * string
+ */
+template<typename Stream, typename C, typename T, typename A>
+void Serialize(Stream& os, const std::basic_string<C, T, A>& str)
+{
+    WriteCompactSize(os, str.size());
+    if (!str.empty())
+        os.write((char*)&str[0], str.size() * sizeof(str[0]));
+}
+
+template<typename Stream, typename C, typename T, typename A>
+void Unserialize(Stream& is, std::basic_string<C, T, A>& str)
+{
+    unsigned int nSize = ReadCompactSize(is);
+    str.resize(nSize);
+    if (nSize != 0)
+        is.read((char*)&str[0], nSize * sizeof(str[0]));
+}
+
+
+
+/**
+ * prevector
+ */
+template<typename Stream, unsigned int N, typename T>
+void Serialize_impl(Stream& os, const prevector<N, T>& v, const unsigned char&)
+{
+    WriteCompactSize(os, v.size());
+    if (!v.empty())
+        os.write((char*)&v[0], v.size() * sizeof(T));
+}
+
+template<typename Stream, unsigned int N, typename T, typename V>
+void Serialize_impl(Stream& os, const prevector<N, T>& v, const V&)
+{
+    WriteCompactSize(os, v.size());
+    for (typename prevector<N, T>::const_iterator vi = v.begin(); vi != v.end(); ++vi)
+        ::Serialize(os, (*vi));
+}
+
+template<typename Stream, unsigned int N, typename T>
+inline void Serialize(Stream& os, const prevector<N, T>& v)
+{
+    Serialize_impl(os, v, T());
+}
+
+
+template<typename Stream, unsigned int N, typename T>
+void Unserialize_impl(Stream& is, prevector<N, T>& v, const unsigned char&)
+{
+    // Limit size per read so bogus size value won't cause out of memory
+    v.clear();
+    unsigned int nSize = ReadCompactSize(is);
+    unsigned int i = 0;
+    while (i < nSize)
+    {
+        unsigned int blk = std::min(nSize - i, (unsigned int)(1 + 4999999 / sizeof(T)));
+        v.resize(i + blk);
+        is.read((char*)&v[i], blk * sizeof(T));
+        i += blk;
+    }
+}
+
+template<typename Stream, unsigned int N, typename T, typename V>
+void Unserialize_impl(Stream& is, prevector<N, T>& v, const V&)
+{
+    v.clear();
+    unsigned int nSize = ReadCompactSize(is);
+    unsigned int i = 0;
+    unsigned int nMid = 0;
+    while (nMid < nSize)
+    {
+        nMid += 5000000 / sizeof(T);
+        if (nMid > nSize)
+            nMid = nSize;
+        v.resize(nMid);
+        for (; i < nMid; i++)
+            Unserialize(is, v[i]);
+    }
+}
+
+template<typename Stream, unsigned int N, typename T>
+inline void Unserialize(Stream& is, prevector<N, T>& v)
+{
+    Unserialize_impl(is, v, T());
+}
+
+
+
+/**
+ * vector
+ */
+template<typename Stream, typename T, typename A>
+void Serialize_impl(Stream& os, const std::vector<T, A>& v, const unsigned char&)
+{
+    WriteCompactSize(os, v.size());
+    if (!v.empty())
+        os.write((char*)&v[0], v.size() * sizeof(T));
+}
+
+template<typename Stream, typename T, typename A, typename V>
+void Serialize_impl(Stream& os, const std::vector<T, A>& v, const V&)
+{
+    WriteCompactSize(os, v.size());
+    for (typename std::vector<T, A>::const_iterator vi = v.begin(); vi != v.end(); ++vi)
+        ::Serialize(os, (*vi));
+}
+
+template<typename Stream, typename T, typename A>
+inline void Serialize(Stream& os, const std::vector<T, A>& v)
+{
+    Serialize_impl(os, v, T());
+}
+
+
+template<typename Stream, typename T, typename A>
+void Unserialize_impl(Stream& is, std::vector<T, A>& v, const unsigned char&)
+{
+    // Limit size per read so bogus size value won't cause out of memory
+    v.clear();
+    unsigned int nSize = ReadCompactSize(is);
+    unsigned int i = 0;
+    while (i < nSize)
+    {
+        unsigned int blk = std::min(nSize - i, (unsigned int)(1 + 4999999 / sizeof(T)));
+        v.resize(i + blk);
+        is.read((char*)&v[i], blk * sizeof(T));
+        i += blk;
+    }
+}
+
+template<typename Stream, typename T, typename A, typename V>
+void Unserialize_impl(Stream& is, std::vector<T, A>& v, const V&)
+{
+    v.clear();
+    unsigned int nSize = ReadCompactSize(is);
+    unsigned int i = 0;
+    unsigned int nMid = 0;
+    while (nMid < nSize)
+    {
+        nMid += 5000000 / sizeof(T);
+        if (nMid > nSize)
+            nMid = nSize;
+        v.resize(nMid);
+        for (; i < nMid; i++)
+            Unserialize(is, v[i]);
+    }
+}
+
+template<typename Stream, typename T, typename A>
+inline void Unserialize(Stream& is, std::vector<T, A>& v)
+{
+    Unserialize_impl(is, v, T());
+}
+
+
+
+/**
+ * optional
+ */
+template<typename Stream, typename T>
+void Serialize(Stream& os, const std::optional<T>& item)
+{
+    // If the value is there, put 0x01 and then serialize the value.
+    // If it's not, put 0x00.
+    if (item) {
+        unsigned char discriminant = 0x01;
+        Serialize(os, discriminant);
+        Serialize(os, *item);
+    } else {
+        unsigned char discriminant = 0x00;
+        Serialize(os, discriminant);
+    }
+}
+
+template<typename Stream, typename T>
+void Unserialize(Stream& is, std::optional<T>& item)
+{
+    unsigned char discriminant = 0x00;
+    Unserialize(is, discriminant);
+
+    if (discriminant == 0x00) {
+        item = std::nullopt;
+    } else if (discriminant == 0x01) {
+        T object;
+        Unserialize(is, object);
+        item = object;
+    } else {
+        throw std::ios_base::failure("non-canonical optional discriminant");
+    }
+}
+
+
+
+/**
+ * array
+ */
+template<typename Stream, typename T, std::size_t N>
+void Serialize(Stream& os, const std::array<T, N>& item)
+{
+    for (size_t i = 0; i < N; i++) {
+        Serialize(os, item[i]);
+    }
+}
+
+template<typename Stream, typename T, std::size_t N>
+void Unserialize(Stream& is, std::array<T, N>& item)
+{
+    for (size_t i = 0; i < N; i++) {
+        Unserialize(is, item[i]);
+    }
+}
+
+
+/**
+ * pair
+ */
+template<typename Stream, typename K, typename T>
+void Serialize(Stream& os, const std::pair<K, T>& item)
+{
+    Serialize(os, item.first);
+    Serialize(os, item.second);
+}
+
+template<typename Stream, typename K, typename T>
+void Unserialize(Stream& is, std::pair<K, T>& item)
+{
+    Unserialize(is, item.first);
+    Unserialize(is, item.second);
+}
+
+
+
+/**
+ * map
+ */
+template<typename Stream, typename K, typename T, typename Pred, typename A>
+void Serialize(Stream& os, const std::map<K, T, Pred, A>& m)
+{
+    WriteCompactSize(os, m.size());
+    for (typename std::map<K, T, Pred, A>::const_iterator mi = m.begin(); mi != m.end(); ++mi)
+        Serialize(os, (*mi));
+}
+
+template<typename Stream, typename K, typename T, typename Pred, typename A>
+void Unserialize(Stream& is, std::map<K, T, Pred, A>& m)
+{
+    m.clear();
+    unsigned int nSize = ReadCompactSize(is);
+    typename std::map<K, T, Pred, A>::iterator mi = m.begin();
+    for (unsigned int i = 0; i < nSize; i++)
+    {
+        std::pair<K, T> item;
+        Unserialize(is, item);
+        mi = m.insert(mi, item);
+    }
+}
+
+
+
+/**
+ * set
+ */
+template<typename Stream, typename K, typename Pred, typename A>
+void Serialize(Stream& os, const std::set<K, Pred, A>& m)
+{
+    WriteCompactSize(os, m.size());
+    for (typename std::set<K, Pred, A>::const_iterator it = m.begin(); it != m.end(); ++it)
+        Serialize(os, (*it));
+}
+
+template<typename Stream, typename K, typename Pred, typename A>
+void Unserialize(Stream& is, std::set<K, Pred, A>& m)
+{
+    m.clear();
+    unsigned int nSize = ReadCompactSize(is);
+    typename std::set<K, Pred, A>::iterator it = m.begin();
+    for (unsigned int i = 0; i < nSize; i++)
+    {
+        K key;
+        Unserialize(is, key);
+        it = m.insert(it, key);
+    }
+}
+
+
+
+/**
+ * list
+ */
+template<typename Stream, typename T, typename A>
+void Serialize(Stream& os, const std::list<T, A>& l)
+{
+    WriteCompactSize(os, l.size());
+    for (typename std::list<T, A>::const_iterator it = l.begin(); it != l.end(); ++it)
+        Serialize(os, (*it));
+}
+
+template<typename Stream, typename T, typename A>
+void Unserialize(Stream& is, std::list<T, A>& l)
+{
+    l.clear();
+    unsigned int nSize = ReadCompactSize(is);
+    typename std::list<T, A>::iterator it = l.begin();
+    for (unsigned int i = 0; i < nSize; i++)
+    {
+        T item;
+        Unserialize(is, item);
+        l.push_back(item);
+    }
+}
+
+
+
+/**
+ * unique_ptr
+ */
+template<typename Stream, typename T> void
+Serialize(Stream& os, const std::unique_ptr<const T>& p)
+{
+    Serialize(os, *p);
+}
+
+template<typename Stream, typename T>
+void Unserialize(Stream& is, std::unique_ptr<const T>& p)
+{
+    p.reset(new T(deserialize, is));
+}
+
+
+
+/**
+ * shared_ptr
+ */
+template<typename Stream, typename T> void
+Serialize(Stream& os, const std::shared_ptr<const T>& p)
+{
+    Serialize(os, *p);
+}
+
+template<typename Stream, typename T>
+void Unserialize(Stream& is, std::shared_ptr<const T>& p)
+{
+    p = std::make_shared<const T>(deserialize, is);
+}
+
+
+
+/**
+ * Ed25519SigningKey
+ */
+template<typename Stream>
+void Serialize(Stream& os, const Ed25519SigningKey& sk)
+{
+    os.write((char*)sk.bytes, ED25519_SIGNING_KEY_LEN);
+}
+
+template<typename Stream>
+void Unserialize(Stream& is, Ed25519SigningKey& sk)
+{
+    is.read((char*)sk.bytes, ED25519_SIGNING_KEY_LEN);
+}
+
+
+
+/**
+ * Ed25519VerificationKey
+ */
+template<typename Stream>
+void Serialize(Stream& os, const Ed25519VerificationKey& vk)
+{
+    os.write((char*)vk.bytes, ED25519_VERIFICATION_KEY_LEN);
+}
+
+template<typename Stream>
+void Unserialize(Stream& is, Ed25519VerificationKey& vk)
+{
+    is.read((char*)vk.bytes, ED25519_VERIFICATION_KEY_LEN);
+}
+
+
+
+/**
+ * Ed25519Signature
+ */
+template<typename Stream>
+void Serialize(Stream& os, const Ed25519Signature& sig)
+{
+    os.write((char*)sig.bytes, ED25519_SIGNATURE_LEN);
+}
+
+template<typename Stream>
+void Unserialize(Stream& is, Ed25519Signature& sig)
+{
+    is.read((char*)sig.bytes, ED25519_SIGNATURE_LEN);
+}
+
+
+
+/**
+ * Support for ADD_SERIALIZE_METHODS and READWRITE macro
+ */
+struct CSerActionSerialize
+{
+    constexpr bool ForRead() const { return false; }
+};
+struct CSerActionUnserialize
+{
+    constexpr bool ForRead() const { return true; }
+};
+
+template<typename Stream, typename T>
+inline void SerReadWrite(Stream& s, const T& obj, CSerActionSerialize ser_action)
+{
+    ::Serialize(s, obj);
+}
+
+template<typename Stream, typename T>
+inline void SerReadWrite(Stream& s, T& obj, CSerActionUnserialize ser_action)
+{
+    ::Unserialize(s, obj);
+}
+
+
+
+
+
+
+
+
+
+/* ::GetSerializeSize implementations
+ *
+ * Computing the serialized size of objects is done through a special stream
+ * object of type CSizeComputer, which only records the number of bytes written
+ * to it.
+ *
+ * If your Serialize or SerializationOp method has non-trivial overhead for
+ * serialization, it may be worthwhile to implement a specialized version for
+ * CSizeComputer, which uses the s.seek() method to record bytes that would
+ * be written instead.
+ */
+class CSizeComputer
+{
+protected:
+    size_t nSize;
+
+    const int nType;
+    const int nVersion;
+public:
+    CSizeComputer(int nTypeIn, int nVersionIn) : nSize(0), nType(nTypeIn), nVersion(nVersionIn) {}
+
+    void write(const char *psz, size_t _nSize)
+    {
+        this->nSize += _nSize;
+    }
+
+    /** Pretend _nSize bytes are written, without specifying them. */
+    void seek(size_t _nSize)
+    {
+        this->nSize += _nSize;
+    }
+
+    template<typename T>
+    CSizeComputer& operator<<(const T& obj)
+    {
+        ::Serialize(*this, obj);
+        return (*this);
+    }
+
+    size_t size() const {
+        return nSize;
+    }
+
+    int GetVersion() const { return nVersion; }
+    int GetType() const { return nType; }
+};
+
+template<typename Stream>
+void SerializeMany(Stream& s)
+{
+}
+
+template<typename Stream, typename Arg>
+void SerializeMany(Stream& s, Arg&& arg)
+{
+    ::Serialize(s, std::forward<Arg>(arg));
+}
+
+template<typename Stream, typename Arg, typename... Args>
+void SerializeMany(Stream& s, Arg&& arg, Args&&... args)
+{
+    ::Serialize(s, std::forward<Arg>(arg));
+    ::SerializeMany(s, std::forward<Args>(args)...);
+}
+
+template<typename Stream>
+inline void UnserializeMany(Stream& s)
+{
+}
+
+template<typename Stream, typename Arg>
+inline void UnserializeMany(Stream& s, Arg& arg)
+{
+    ::Unserialize(s, arg);
+}
+
+template<typename Stream, typename Arg, typename... Args>
+inline void UnserializeMany(Stream& s, Arg& arg, Args&... args)
+{
+    ::Unserialize(s, arg);
+    ::UnserializeMany(s, args...);
+}
+
+template<typename Stream, typename... Args>
+inline void SerReadWriteMany(Stream& s, CSerActionSerialize ser_action, Args&&... args)
+{
+    ::SerializeMany(s, std::forward<Args>(args)...);
+}
+
+template<typename Stream, typename... Args>
+inline void SerReadWriteMany(Stream& s, CSerActionUnserialize ser_action, Args&... args)
+{
+    ::UnserializeMany(s, args...);
+}
+
+template<typename I>
+inline void WriteVarInt(CSizeComputer &s, I n)
+{
+    s.seek(GetSizeOfVarInt<I>(n));
+}
+
+inline void WriteCompactSize(CSizeComputer &s, uint64_t nSize)
+{
+    s.seek(GetSizeOfCompactSize(nSize));
+}
+
+template <typename T>
+size_t GetSerializeSize(const T& t, int nType, int nVersion = 0)
+{
+    return (CSizeComputer(nType, nVersion) << t).size();
+}
+
+template <typename S, typename T>
+size_t GetSerializeSize(const S& s, const T& t)
+{
+    return (CSizeComputer(s.GetType(), s.GetVersion()) << t).size();
+}
+
+#endif // BITCOIN_SERIALIZE_H
diff --git a/depend/zcash/src/spentindex.h b/depend/zcash/src/spentindex.h
new file mode 100644
index 000000000..9f85c62b0
--- /dev/null
+++ b/depend/zcash/src/spentindex.h
@@ -0,0 +1,97 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_SPENTINDEX_H
+#define BITCOIN_SPENTINDEX_H
+
+#include "uint256.h"
+#include "amount.h"
+
+struct CSpentIndexKey {
+    uint256 txid;
+    unsigned int outputIndex;
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(txid);
+        READWRITE(outputIndex);
+    }
+
+    CSpentIndexKey(uint256 t, unsigned int i) {
+        txid = t;
+        outputIndex = i;
+    }
+
+    CSpentIndexKey() {
+        SetNull();
+    }
+
+    void SetNull() {
+        txid.SetNull();
+        outputIndex = 0;
+    }
+};
+
+struct CSpentIndexValue {
+    uint256 txid;
+    unsigned int inputIndex;
+    int blockHeight;
+    CAmount satoshis;
+    int addressType;
+    uint160 addressHash;
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(txid);
+        READWRITE(inputIndex);
+        READWRITE(blockHeight);
+        READWRITE(satoshis);
+        READWRITE(addressType);
+        READWRITE(addressHash);
+    }
+
+    CSpentIndexValue(uint256 t, unsigned int i, int h, CAmount s, int type, uint160 a) {
+        txid = t;
+        inputIndex = i;
+        blockHeight = h;
+        satoshis = s;
+        addressType = type;
+        addressHash = a;
+    }
+
+    CSpentIndexValue() {
+        SetNull();
+    }
+
+    void SetNull() {
+        txid.SetNull();
+        inputIndex = 0;
+        blockHeight = 0;
+        satoshis = 0;
+        addressType = 0;
+        addressHash.SetNull();
+    }
+
+    bool IsNull() const {
+        return txid.IsNull();
+    }
+};
+
+struct CSpentIndexKeyCompare
+{
+    bool operator()(const CSpentIndexKey& a, const CSpentIndexKey& b) const {
+        if (a.txid == b.txid) {
+            return a.outputIndex < b.outputIndex;
+        } else {
+            return a.txid < b.txid;
+        }
+    }
+};
+
+#endif // BITCOIN_SPENTINDEX_H
diff --git a/depend/zcash/src/streams.h b/depend/zcash/src/streams.h
new file mode 100644
index 000000000..b10375f27
--- /dev/null
+++ b/depend/zcash/src/streams.h
@@ -0,0 +1,704 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_STREAMS_H
+#define BITCOIN_STREAMS_H
+
+#include "support/allocators/zeroafterfree.h"
+#include "serialize.h"
+
+#include <algorithm>
+#include <assert.h>
+#include <ios>
+#include <limits>
+#include <map>
+#include <set>
+#include <stdint.h>
+#include <stdio.h>
+#include <string>
+#include <string.h>
+#include <utility>
+#include <vector>
+
+/**
+ * Wrapper around C++ stream objects, enabling them to be passed into Rust code.
+ */
+template<typename Stream>
+class RustStream {
+    Stream* stream;
+
+public:
+    RustStream(Stream& stream_) : stream(&stream_) {}
+
+    static long read_callback(void* context, unsigned char* pch, size_t nSize)
+    {
+        return reinterpret_cast<RustStream*>(context)->read(
+            reinterpret_cast<char*>(pch), nSize);
+    }
+
+    static long write_callback(void* context, const unsigned char* pch, size_t nSize)
+    {
+        return reinterpret_cast<RustStream*>(context)->write(
+            reinterpret_cast<const char*>(pch), nSize);
+    }
+
+    long read(char* pch, size_t nSize)
+    {
+        try {
+            stream->read(pch, nSize);
+            return nSize;
+        } catch (std::ios_base::failure e) {
+            // TODO: log
+            return -1;
+        }
+    }
+
+    long write(const char* pch, size_t nSize)
+    {
+        try {
+            stream->write(pch, nSize);
+            return nSize;
+        } catch (std::ios_base::failure e) {
+            // TODO: log
+            return -1;
+        }
+    }
+};
+
+template<typename Stream>
+class OverrideStream
+{
+    Stream* stream;
+
+    const int nType;
+    const int nVersion;
+
+public:
+    OverrideStream(Stream* stream_, int nType_, int nVersion_) : stream(stream_), nType(nType_), nVersion(nVersion_) {}
+
+    template<typename T>
+    OverrideStream<Stream>& operator<<(const T& obj)
+    {
+        // Serialize to this stream
+        ::Serialize(*this, obj);
+        return (*this);
+    }
+
+    template<typename T>
+    OverrideStream<Stream>& operator>>(T&& obj)
+    {
+        // Unserialize from this stream
+        ::Unserialize(*this, obj);
+        return (*this);
+    }
+
+    void write(const char* pch, size_t nSize)
+    {
+        stream->write(pch, nSize);
+    }
+
+    void read(char* pch, size_t nSize)
+    {
+        stream->read(pch, nSize);
+    }
+
+    int GetVersion() const { return nVersion; }
+    int GetType() const { return nType; }
+};
+
+template<typename S>
+OverrideStream<S> WithVersion(S* s, int nVersion)
+{
+    return OverrideStream<S>(s, s->GetType(), nVersion);
+}
+
+/** Double ended buffer combining vector and stream-like interfaces.
+ *
+ * >> and << read and write unformatted data using the above serialization templates.
+ * Fills with data in linear time; some stringstream implementations take N^2 time.
+ */
+template<typename SerializeType>
+class CBaseDataStream
+{
+protected:
+    typedef SerializeType vector_type;
+    vector_type vch;
+    unsigned int nReadPos;
+
+    int nType;
+    int nVersion;
+public:
+
+    typedef typename vector_type::allocator_type   allocator_type;
+    typedef typename vector_type::size_type        size_type;
+    typedef typename vector_type::difference_type  difference_type;
+    typedef typename vector_type::reference        reference;
+    typedef typename vector_type::const_reference  const_reference;
+    typedef typename vector_type::value_type       value_type;
+    typedef typename vector_type::iterator         iterator;
+    typedef typename vector_type::const_iterator   const_iterator;
+    typedef typename vector_type::reverse_iterator reverse_iterator;
+
+    explicit CBaseDataStream(int nTypeIn, int nVersionIn)
+    {
+        Init(nTypeIn, nVersionIn);
+    }
+
+    CBaseDataStream(const_iterator pbegin, const_iterator pend, int nTypeIn, int nVersionIn) : vch(pbegin, pend)
+    {
+        Init(nTypeIn, nVersionIn);
+    }
+
+    CBaseDataStream(const char* pbegin, const char* pend, int nTypeIn, int nVersionIn) : vch(pbegin, pend)
+    {
+        Init(nTypeIn, nVersionIn);
+    }
+
+    CBaseDataStream(const vector_type& vchIn, int nTypeIn, int nVersionIn) : vch(vchIn.begin(), vchIn.end())
+    {
+        Init(nTypeIn, nVersionIn);
+    }
+
+    CBaseDataStream(const std::vector<char>& vchIn, int nTypeIn, int nVersionIn) : vch(vchIn.begin(), vchIn.end())
+    {
+        Init(nTypeIn, nVersionIn);
+    }
+
+    CBaseDataStream(const std::vector<unsigned char>& vchIn, int nTypeIn, int nVersionIn) : vch(vchIn.begin(), vchIn.end())
+    {
+        Init(nTypeIn, nVersionIn);
+    }
+
+    template <typename... Args>
+    CBaseDataStream(int nTypeIn, int nVersionIn, Args&&... args)
+    {
+        Init(nTypeIn, nVersionIn);
+        ::SerializeMany(*this, std::forward<Args>(args)...);
+    }
+
+    void Init(int nTypeIn, int nVersionIn)
+    {
+        nReadPos = 0;
+        nType = nTypeIn;
+        nVersion = nVersionIn;
+    }
+
+    CBaseDataStream& operator+=(const CBaseDataStream& b)
+    {
+        vch.insert(vch.end(), b.begin(), b.end());
+        return *this;
+    }
+
+    friend CBaseDataStream operator+(const CBaseDataStream& a, const CBaseDataStream& b)
+    {
+        CBaseDataStream ret = a;
+        ret += b;
+        return (ret);
+    }
+
+    std::string str() const
+    {
+        return (std::string(begin(), end()));
+    }
+
+
+    //
+    // Vector subset
+    //
+    const_iterator begin() const                     { return vch.begin() + nReadPos; }
+    iterator begin()                                 { return vch.begin() + nReadPos; }
+    const_iterator end() const                       { return vch.end(); }
+    iterator end()                                   { return vch.end(); }
+    size_type size() const                           { return vch.size() - nReadPos; }
+    bool empty() const                               { return vch.size() == nReadPos; }
+    void resize(size_type n, value_type c=0)         { vch.resize(n + nReadPos, c); }
+    void reserve(size_type n)                        { vch.reserve(n + nReadPos); }
+    const_reference operator[](size_type pos) const  { return vch[pos + nReadPos]; }
+    reference operator[](size_type pos)              { return vch[pos + nReadPos]; }
+    void clear()                                     { vch.clear(); nReadPos = 0; }
+    iterator insert(iterator it, const char& x=char()) { return vch.insert(it, x); }
+    void insert(iterator it, size_type n, const char& x) { vch.insert(it, n, x); }
+    value_type* data()                               { return vch.data() + nReadPos; }
+    const value_type* data() const                   { return vch.data() + nReadPos; }
+
+    void insert(iterator it, std::vector<char>::const_iterator first, std::vector<char>::const_iterator last)
+    {
+        if (last == first) return;
+        assert(last - first > 0);
+        if (it == vch.begin() + nReadPos && (unsigned int)(last - first) <= nReadPos)
+        {
+            // special case for inserting at the front when there's room
+            nReadPos -= (last - first);
+            memcpy(&vch[nReadPos], &first[0], last - first);
+        }
+        else
+            vch.insert(it, first, last);
+    }
+
+    void insert(iterator it, const char* first, const char* last)
+    {
+        if (last == first) return;
+        assert(last - first > 0);
+        if (it == vch.begin() + nReadPos && (unsigned int)(last - first) <= nReadPos)
+        {
+            // special case for inserting at the front when there's room
+            nReadPos -= (last - first);
+            memcpy(&vch[nReadPos], &first[0], last - first);
+        }
+        else
+            vch.insert(it, first, last);
+    }
+
+    iterator erase(iterator it)
+    {
+        if (it == vch.begin() + nReadPos)
+        {
+            // special case for erasing from the front
+            if (++nReadPos >= vch.size())
+            {
+                // whenever we reach the end, we take the opportunity to clear the buffer
+                nReadPos = 0;
+                return vch.erase(vch.begin(), vch.end());
+            }
+            return vch.begin() + nReadPos;
+        }
+        else
+            return vch.erase(it);
+    }
+
+    iterator erase(iterator first, iterator last)
+    {
+        if (first == vch.begin() + nReadPos)
+        {
+            // special case for erasing from the front
+            if (last == vch.end())
+            {
+                nReadPos = 0;
+                return vch.erase(vch.begin(), vch.end());
+            }
+            else
+            {
+                nReadPos = (last - vch.begin());
+                return last;
+            }
+        }
+        else
+            return vch.erase(first, last);
+    }
+
+    inline void Compact()
+    {
+        vch.erase(vch.begin(), vch.begin() + nReadPos);
+        nReadPos = 0;
+    }
+
+    bool Rewind(size_type n)
+    {
+        // Rewind by n characters if the buffer hasn't been compacted yet
+        if (n > nReadPos)
+            return false;
+        nReadPos -= n;
+        return true;
+    }
+
+
+    //
+    // Stream subset
+    //
+    bool eof() const             { return size() == 0; }
+    CBaseDataStream* rdbuf()         { return this; }
+    int in_avail()               { return size(); }
+
+    void SetType(int n)          { nType = n; }
+    int GetType() const          { return nType; }
+    void SetVersion(int n)       { nVersion = n; }
+    int GetVersion() const       { return nVersion; }
+
+    void read(char* pch, size_t nSize)
+    {
+        if (nSize == 0) return;
+
+        if (pch == nullptr) {
+            throw std::ios_base::failure("CBaseDataStream::read(): cannot read from null pointer");
+        }
+
+        // Read from the beginning of the buffer
+        unsigned int nReadPosNext = nReadPos + nSize;
+        if (nReadPosNext >= vch.size())
+        {
+            if (nReadPosNext > vch.size())
+            {
+                throw std::ios_base::failure("CBaseDataStream::read(): end of data");
+            }
+            memcpy(pch, &vch[nReadPos], nSize);
+            nReadPos = 0;
+            vch.clear();
+            return;
+        }
+        memcpy(pch, &vch[nReadPos], nSize);
+        nReadPos = nReadPosNext;
+    }
+
+    void ignore(int nSize)
+    {
+        // Ignore from the beginning of the buffer
+        if (nSize < 0) {
+            throw std::ios_base::failure("CDataStream::ignore(): nSize negative");
+        }
+        unsigned int nReadPosNext = nReadPos + nSize;
+        if (nReadPosNext >= vch.size())
+        {
+            if (nReadPosNext > vch.size())
+                throw std::ios_base::failure("CBaseDataStream::ignore(): end of data");
+            nReadPos = 0;
+            vch.clear();
+            return;
+        }
+        nReadPos = nReadPosNext;
+    }
+
+    void write(const char* pch, size_t nSize)
+    {
+        // Write to the end of the buffer
+        vch.insert(vch.end(), pch, pch + nSize);
+    }
+
+    template<typename Stream>
+    void Serialize(Stream& s) const
+    {
+        // Special case: stream << stream concatenates like stream += stream
+        if (!vch.empty())
+            s.write((char*)&vch[0], vch.size() * sizeof(vch[0]));
+    }
+
+    template<typename T>
+    CBaseDataStream& operator<<(const T& obj)
+    {
+        // Serialize to this stream
+        ::Serialize(*this, obj);
+        return (*this);
+    }
+
+    template<typename T>
+    CBaseDataStream& operator>>(T& obj)
+    {
+        // Unserialize from this stream
+        ::Unserialize(*this, obj);
+        return (*this);
+    }
+
+    void GetAndClear(CSerializeData &d) {
+        d.insert(d.end(), begin(), end());
+        clear();
+    }
+};
+
+class CDataStream : public CBaseDataStream<CSerializeData>
+{
+public:
+    explicit CDataStream(int nTypeIn, int nVersionIn) : CBaseDataStream(nTypeIn, nVersionIn) { }
+
+    CDataStream(const_iterator pbegin, const_iterator pend, int nTypeIn, int nVersionIn) :
+            CBaseDataStream(pbegin, pend, nTypeIn, nVersionIn) { }
+
+#if !defined(_MSC_VER) || _MSC_VER >= 1300
+    CDataStream(const char* pbegin, const char* pend, int nTypeIn, int nVersionIn) :
+            CBaseDataStream(pbegin, pend, nTypeIn, nVersionIn) { }
+#endif
+
+    CDataStream(const vector_type& vchIn, int nTypeIn, int nVersionIn) :
+            CBaseDataStream(vchIn, nTypeIn, nVersionIn) { }
+
+    CDataStream(const std::vector<char>& vchIn, int nTypeIn, int nVersionIn) :
+            CBaseDataStream(vchIn, nTypeIn, nVersionIn) { }
+
+    CDataStream(const std::vector<unsigned char>& vchIn, int nTypeIn, int nVersionIn) :
+            CBaseDataStream(vchIn, nTypeIn, nVersionIn) { }
+
+    template <typename... Args>
+    CDataStream(int nTypeIn, int nVersionIn, Args&&... args) :
+            CBaseDataStream(nTypeIn, nVersionIn, args...) { }
+
+};
+
+
+
+
+
+
+
+
+
+
+/** Non-refcounted RAII wrapper for FILE*
+ *
+ * Will automatically close the file when it goes out of scope if not null.
+ * If you're returning the file pointer, return file.release().
+ * If you need to close the file early, use file.fclose() instead of fclose(file).
+ */
+class CAutoFile
+{
+private:
+    // Disallow copies
+    CAutoFile(const CAutoFile&);
+    CAutoFile& operator=(const CAutoFile&);
+
+    const int nType;
+    const int nVersion;
+
+    FILE* file;	
+
+public:
+    CAutoFile(FILE* filenew, int nTypeIn, int nVersionIn) : nType(nTypeIn), nVersion(nVersionIn)
+    {
+        file = filenew;
+    }
+
+    ~CAutoFile()
+    {
+        fclose();
+    }
+
+    void fclose()
+    {
+        if (file) {
+            ::fclose(file);
+            file = NULL;
+        }
+    }
+
+    /** Get wrapped FILE* with transfer of ownership.
+     * @note This will invalidate the CAutoFile object, and makes it the responsibility of the caller
+     * of this function to clean up the returned FILE*.
+     */
+    FILE* release()             { FILE* ret = file; file = NULL; return ret; }
+
+    /** Get wrapped FILE* without transfer of ownership.
+     * @note Ownership of the FILE* will remain with this class. Use this only if the scope of the
+     * CAutoFile outlives use of the passed pointer.
+     */
+    FILE* Get() const           { return file; }
+
+    /** Return true if the wrapped FILE* is NULL, false otherwise.
+     */
+    bool IsNull() const         { return (file == NULL); }
+
+    //
+    // Stream subset
+    //
+    int GetType() const          { return nType; }
+    int GetVersion() const       { return nVersion; }
+
+    void read(char* pch, size_t nSize)
+    {
+        if (!file)
+            throw std::ios_base::failure("CAutoFile::read: file handle is NULL");
+        if (fread(pch, 1, nSize, file) != nSize)
+            throw std::ios_base::failure(feof(file) ? "CAutoFile::read: end of file" : "CAutoFile::read: fread failed");
+    }
+
+    void ignore(size_t nSize)
+    {
+        if (!file)
+            throw std::ios_base::failure("CAutoFile::ignore: file handle is NULL");
+        unsigned char data[4096];
+        while (nSize > 0) {
+            size_t nNow = std::min<size_t>(nSize, sizeof(data));
+            if (fread(data, 1, nNow, file) != nNow)
+                throw std::ios_base::failure(feof(file) ? "CAutoFile::ignore: end of file" : "CAutoFile::read: fread failed");
+            nSize -= nNow;
+        }
+    }
+
+    void write(const char* pch, size_t nSize)
+    {
+        if (!file)
+            throw std::ios_base::failure("CAutoFile::write: file handle is NULL");
+        if (fwrite(pch, 1, nSize, file) != nSize)
+            throw std::ios_base::failure("CAutoFile::write: write failed");
+    }
+
+    template<typename T>
+    CAutoFile& operator<<(const T& obj)
+    {
+        // Serialize to this stream
+        if (!file)
+            throw std::ios_base::failure("CAutoFile::operator<<: file handle is NULL");
+        ::Serialize(*this, obj);
+        return (*this);
+    }
+
+    template<typename T>
+    CAutoFile& operator>>(T& obj)
+    {
+        // Unserialize from this stream
+        if (!file)
+            throw std::ios_base::failure("CAutoFile::operator>>: file handle is NULL");
+        ::Unserialize(*this, obj);
+        return (*this);
+    }
+};
+
+/** Non-refcounted RAII wrapper around a FILE* that implements a ring buffer to
+ *  deserialize from. It guarantees the ability to rewind a given number of bytes.
+ *
+ *  Will automatically close the file when it goes out of scope if not null.
+ *  If you need to close the file early, use file.fclose() instead of fclose(file).
+ */
+class CBufferedFile
+{
+private:
+    // Disallow copies
+    CBufferedFile(const CBufferedFile&);
+    CBufferedFile& operator=(const CBufferedFile&);
+
+    const int nType;
+    const int nVersion;
+
+    FILE *src;            // source file
+    uint64_t nSrcPos;     // how many bytes have been read from source
+    uint64_t nReadPos;    // how many bytes have been read from this
+    uint64_t nReadLimit;  // up to which position we're allowed to read
+    uint64_t nRewind;     // how many bytes we guarantee to rewind
+    std::vector<char> vchBuf; // the buffer
+
+protected:
+    // read data from the source to fill the buffer
+    bool Fill() {
+        assert(nReadPos == nSrcPos);
+        unsigned int pos = nSrcPos % vchBuf.size();
+        unsigned int readNow = vchBuf.size() - pos;
+        unsigned int nAvail = vchBuf.size() - nRewind;
+        if (nAvail < readNow)
+            readNow = nAvail;
+        if (readNow == 0)
+            return false;
+        size_t nBytes = fread((void*)&vchBuf[pos], 1, readNow, src);
+        if (nBytes == 0) {
+            throw std::ios_base::failure(eof() ? "CBufferedFile::Fill: end of file" : "CBufferedFile::Fill: fread failed");
+        }
+        nSrcPos += nBytes;
+        return true;
+    }
+
+public:
+    CBufferedFile(FILE *fileIn, uint64_t nBufSize, uint64_t nRewindIn, int nTypeIn, int nVersionIn) :
+        nType(nTypeIn), nVersion(nVersionIn), nSrcPos(0), nReadPos(0), nReadLimit((uint64_t)(-1)), nRewind(nRewindIn), vchBuf(nBufSize, 0)
+    {
+        if (nRewindIn >= nBufSize)
+            throw std::ios_base::failure("Rewind limit must be less than buffer size");
+        src = fileIn;
+    }
+
+    ~CBufferedFile()
+    {
+        fclose();
+    }
+
+    int GetVersion() const { return nVersion; }
+    int GetType() const { return nType; }
+
+    void fclose()
+    {
+        if (src) {
+            ::fclose(src);
+            src = NULL;
+        }
+    }
+
+    // check whether we're at the end of the source file
+    bool eof() const {
+        return src == NULL || (nReadPos == nSrcPos && feof(src));
+    }
+
+    // read a number of bytes
+    void read(char *pch, size_t nSize) {
+        if (nSize == 0) return;
+
+        if (pch == nullptr) {
+            throw std::ios_base::failure("CBufferedFile::read(): cannot read from null pointer");
+        }
+
+        if (nSize + nReadPos > nReadLimit)
+            throw std::ios_base::failure("Read attempted past buffer limit");
+        while (nSize > 0) {
+            if (nReadPos == nSrcPos)
+                Fill();
+            unsigned int pos = nReadPos % vchBuf.size();
+            size_t nNow = nSize;
+            if (nNow + pos > vchBuf.size())
+                nNow = vchBuf.size() - pos;
+            if (nNow + nReadPos > nSrcPos)
+                nNow = nSrcPos - nReadPos;
+            memcpy(pch, &vchBuf[pos], nNow);
+            nReadPos += nNow;
+            pch += nNow;
+            nSize -= nNow;
+        }
+    }
+
+    // return the current reading position
+    uint64_t GetPos() {
+        return nReadPos;
+    }
+
+    // rewind to a given reading position
+    bool SetPos(uint64_t nPos) {
+        size_t bufsize = vchBuf.size();
+        if (nPos + bufsize < nSrcPos) {
+            // rewinding too far, rewind as far as possible
+            nReadPos = nSrcPos - bufsize;
+            return false;
+        }
+        if (nPos > nSrcPos) {
+            // can't go this far forward, go as far as possible
+            nReadPos = nSrcPos;
+            return false;
+        }
+        nReadPos = nPos;
+        return true;
+    }
+
+    bool Seek(uint64_t nPos) {
+        long nLongPos = nPos;
+        if (nPos != (uint64_t)nLongPos)
+            return false;
+        if (fseek(src, nLongPos, SEEK_SET))
+            return false;
+        nLongPos = ftell(src);
+        nSrcPos = nLongPos;
+        nReadPos = nLongPos;
+        return true;
+    }
+
+    // prevent reading beyond a certain position
+    // no argument removes the limit
+    bool SetLimit(uint64_t nPos = (uint64_t)(-1)) {
+        if (nPos < nReadPos)
+            return false;
+        nReadLimit = nPos;
+        return true;
+    }
+
+    template<typename T>
+    CBufferedFile& operator>>(T& obj) {
+        // Unserialize from this stream
+        ::Unserialize(*this, obj);
+        return (*this);
+    }
+
+    // search for a given byte in the stream, and remain positioned on it
+    void FindByte(char ch) {
+        while (true) {
+            if (nReadPos == nSrcPos)
+                Fill();
+            if (vchBuf[nReadPos % vchBuf.size()] == ch)
+                break;
+            nReadPos++;
+        }
+    }
+};
+
+#endif // BITCOIN_STREAMS_H
diff --git a/depend/zcash/src/support/allocators/secure.h b/depend/zcash/src/support/allocators/secure.h
new file mode 100644
index 000000000..eb4d3c560
--- /dev/null
+++ b/depend/zcash/src/support/allocators/secure.h
@@ -0,0 +1,61 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_SUPPORT_ALLOCATORS_SECURE_H
+#define BITCOIN_SUPPORT_ALLOCATORS_SECURE_H
+
+#include "support/lockedpool.h"
+#include "support/cleanse.h"
+
+#include <string>
+
+//
+// Allocator that locks its contents from being paged
+// out of memory and clears its contents before deletion.
+//
+template <typename T>
+struct secure_allocator : public std::allocator<T> {
+    // MSVC8 default copy constructor is broken
+    typedef std::allocator<T> base;
+    typedef typename base::size_type size_type;
+    typedef typename base::difference_type difference_type;
+    typedef typename base::pointer pointer;
+    typedef typename base::const_pointer const_pointer;
+    typedef typename base::reference reference;
+    typedef typename base::const_reference const_reference;
+    typedef typename base::value_type value_type;
+    secure_allocator() throw() {}
+    secure_allocator(const secure_allocator& a) throw() : base(a) {}
+    template <typename U>
+    secure_allocator(const secure_allocator<U>& a) throw() : base(a)
+    {
+    }
+    ~secure_allocator() throw() {}
+    template <typename _Other>
+    struct rebind {
+        typedef secure_allocator<_Other> other;
+    };
+
+    T* allocate(std::size_t n, const void* hint = 0)
+    {
+        T* allocation = static_cast<T*>(LockedPoolManager::Instance().alloc(sizeof(T) * n));
+        if (!allocation) {
+            throw std::bad_alloc();
+        }
+        return allocation;
+    }
+
+    void deallocate(T* p, std::size_t n) noexcept
+    {
+        assert(p != nullptr);
+        memory_cleanse(p, sizeof(T) * n);
+        LockedPoolManager::Instance().free(p);
+    }
+};
+
+// This is exactly like std::string, but with a custom allocator.
+typedef std::basic_string<char, std::char_traits<char>, secure_allocator<char> > SecureString;
+
+#endif // BITCOIN_SUPPORT_ALLOCATORS_SECURE_H
diff --git a/depend/zcash/src/support/allocators/zeroafterfree.h b/depend/zcash/src/support/allocators/zeroafterfree.h
new file mode 100644
index 000000000..19075f4e6
--- /dev/null
+++ b/depend/zcash/src/support/allocators/zeroafterfree.h
@@ -0,0 +1,48 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_SUPPORT_ALLOCATORS_ZEROAFTERFREE_H
+#define BITCOIN_SUPPORT_ALLOCATORS_ZEROAFTERFREE_H
+
+#include "support/cleanse.h"
+
+#include <memory>
+#include <vector>
+
+template <typename T>
+struct zero_after_free_allocator : public std::allocator<T> {
+    // MSVC8 default copy constructor is broken
+    typedef std::allocator<T> base;
+    typedef typename base::size_type size_type;
+    typedef typename base::difference_type difference_type;
+    typedef typename base::pointer pointer;
+    typedef typename base::const_pointer const_pointer;
+    typedef typename base::reference reference;
+    typedef typename base::const_reference const_reference;
+    typedef typename base::value_type value_type;
+    zero_after_free_allocator() throw() {}
+    zero_after_free_allocator(const zero_after_free_allocator& a) throw() : base(a) {}
+    template <typename U>
+    zero_after_free_allocator(const zero_after_free_allocator<U>& a) throw() : base(a)
+    {
+    }
+    ~zero_after_free_allocator() throw() {}
+    template <typename _Other>
+    struct rebind {
+        typedef zero_after_free_allocator<_Other> other;
+    };
+
+    void deallocate(T* p, std::size_t n)
+    {
+        if (p != NULL)
+            memory_cleanse(p, sizeof(T) * n);
+        std::allocator<T>::deallocate(p, n);
+    }
+};
+
+// Byte-vector that clears its contents before deletion.
+typedef std::vector<char, zero_after_free_allocator<char> > CSerializeData;
+
+#endif // BITCOIN_SUPPORT_ALLOCATORS_ZEROAFTERFREE_H
diff --git a/depend/zcash/src/support/cleanse.cpp b/depend/zcash/src/support/cleanse.cpp
new file mode 100644
index 000000000..8e02a2b08
--- /dev/null
+++ b/depend/zcash/src/support/cleanse.cpp
@@ -0,0 +1,38 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "cleanse.h"
+
+#include <cstring>
+
+#if defined(_MSC_VER)
+#include <Windows.h> // For SecureZeroMemory.
+#endif
+
+void memory_cleanse(void *ptr, size_t len)
+{
+#if defined(_MSC_VER)
+    /* SecureZeroMemory is guaranteed not to be optimized out by MSVC. */
+    SecureZeroMemory(ptr, len);
+#else
+    std::memset(ptr, 0, len);
+
+    /* In order to prevent the compiler from optimizing out the memset, this uses an
+     * unremovable (see https://gcc.gnu.org/onlinedocs/gcc/Extended-Asm.html#Volatile )
+     * asm block that the compiler must assume could access arbitrary memory, including
+     * the zero bytes written by std::memset.
+     *
+     * Quoting Adam Langley <agl@google.com> in commit ad1907fe73334d6c696c8539646c21b11178f20f
+     * in BoringSSL (ISC License):
+     *    As best as we can tell, this is sufficient to break any optimisations that
+     *    might try to eliminate "superfluous" memsets.
+     * This method is used by memzero_explicit() in the Linux kernel, too. Its advantage is that it
+     * is pretty efficient because the compiler can still implement the memset() efficiently,
+     * just not remove it entirely. See "Dead Store Elimination (Still) Considered Harmful" by
+     * Yang et al. (USENIX Security 2017) for more background.
+     */
+    __asm__ __volatile__("" : : "r"(ptr) : "memory");
+#endif
+}
diff --git a/depend/zcash/src/support/cleanse.h b/depend/zcash/src/support/cleanse.h
new file mode 100644
index 000000000..1b2bdc13e
--- /dev/null
+++ b/depend/zcash/src/support/cleanse.h
@@ -0,0 +1,15 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_SUPPORT_CLEANSE_H
+#define BITCOIN_SUPPORT_CLEANSE_H
+
+#include <stdlib.h>
+
+/** Secure overwrite a buffer (possibly containing secret data) with zero-bytes. The write
+ * operation will not be optimized out by the compiler. */
+void memory_cleanse(void *ptr, size_t len);
+
+#endif // BITCOIN_SUPPORT_CLEANSE_H
diff --git a/depend/zcash/src/support/events.h b/depend/zcash/src/support/events.h
new file mode 100644
index 000000000..e14961231
--- /dev/null
+++ b/depend/zcash/src/support/events.h
@@ -0,0 +1,56 @@
+// Copyright (c) 2016 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_SUPPORT_EVENTS_H
+#define BITCOIN_SUPPORT_EVENTS_H
+
+#include <ios>
+#include <memory>
+
+#include <event2/event.h>
+#include <event2/http.h>
+
+#define MAKE_RAII(type) \
+/* deleter */\
+struct type##_deleter {\
+    void operator()(struct type* ob) {\
+        type##_free(ob);\
+    }\
+};\
+/* unique ptr typedef */\
+typedef std::unique_ptr<struct type, type##_deleter> raii_##type
+
+MAKE_RAII(event_base);
+MAKE_RAII(event);
+MAKE_RAII(evhttp);
+MAKE_RAII(evhttp_request);
+MAKE_RAII(evhttp_connection);
+
+raii_event_base obtain_event_base() {
+    auto result = raii_event_base(event_base_new());
+    if (!result.get())
+        throw std::runtime_error("cannot create event_base");
+    return result;
+}
+
+raii_event obtain_event(struct event_base* base, evutil_socket_t s, short events, event_callback_fn cb, void* arg) {
+    return raii_event(event_new(base, s, events, cb, arg));
+}
+
+raii_evhttp obtain_evhttp(struct event_base* base) {
+    return raii_evhttp(evhttp_new(base));
+}
+
+raii_evhttp_request obtain_evhttp_request(void(*cb)(struct evhttp_request *, void *), void *arg) {
+    return raii_evhttp_request(evhttp_request_new(cb, arg));
+}
+
+raii_evhttp_connection obtain_evhttp_connection_base(struct event_base* base, std::string host, uint16_t port) {
+    auto result = raii_evhttp_connection(evhttp_connection_base_new(base, NULL, host.c_str(), port));
+    if (!result.get())
+        throw std::runtime_error("create connection failed");
+    return result;
+}
+
+#endif // BITCOIN_SUPPORT_EVENTS_H
diff --git a/depend/zcash/src/support/lockedpool.cpp b/depend/zcash/src/support/lockedpool.cpp
new file mode 100644
index 000000000..582decedd
--- /dev/null
+++ b/depend/zcash/src/support/lockedpool.cpp
@@ -0,0 +1,417 @@
+// Copyright (c) 2016 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "support/lockedpool.h"
+#include "support/cleanse.h"
+
+#if defined(HAVE_CONFIG_H)
+#include "config/bitcoin-config.h"
+#endif
+
+#ifdef WIN32
+#ifndef NOMINMAX
+#define NOMINMAX
+#endif
+#include <windows.h>
+#else
+#include <sys/mman.h> // for mmap
+#include <sys/resource.h> // for getrlimit
+#include <limits.h> // for PAGESIZE
+#include <unistd.h> // for sysconf
+#endif
+
+#include <algorithm>
+#include <cassert>
+#ifdef ARENA_DEBUG
+#include <iomanip>
+#include <iostream>
+#endif
+
+LockedPoolManager* LockedPoolManager::_instance = nullptr;
+
+/*******************************************************************************/
+// Utilities
+//
+/** Align up to power of 2 */
+static inline size_t align_up(size_t x, size_t align)
+{
+    return (x + align - 1) & ~(align - 1);
+}
+
+/*******************************************************************************/
+// Implementation: Arena
+
+Arena::Arena(void *base_in, size_t size_in, size_t alignment_in):
+    base(static_cast<char*>(base_in)), end(static_cast<char*>(base_in) + size_in), alignment(alignment_in)
+{
+    // Start with one free chunk that covers the entire arena
+    auto it = size_to_free_chunk.emplace(size_in, base);
+    chunks_free.emplace(base, it);
+    chunks_free_end.emplace(base + size_in, it);
+}
+
+Arena::~Arena()
+{
+}
+
+void* Arena::alloc(size_t size)
+{
+    // Round to next multiple of alignment
+    size = align_up(size, alignment);
+
+    // Don't handle zero-sized chunks
+    if (size == 0)
+        return nullptr;
+
+    // Pick a large enough free-chunk. Returns an iterator pointing to the first element that is not less than key.
+    // This allocation strategy is best-fit. According to "Dynamic Storage Allocation: A Survey and Critical Review",
+    // Wilson et. al. 1995, https://www.scs.stanford.edu/14wi-cs140/sched/readings/wilson.pdf , best-fit and first-fit
+    // policies seem to work well in practice.
+    auto size_ptr_it = size_to_free_chunk.lower_bound(size);
+    if (size_ptr_it == size_to_free_chunk.end())
+        return nullptr;
+
+    // Create the used-chunk, taking its space from the end of the free-chunk
+    const size_t size_remaining = size_ptr_it->first - size;
+    auto alloced = chunks_used.emplace(size_ptr_it->second + size_remaining, size).first;
+    chunks_free_end.erase(size_ptr_it->second + size_ptr_it->first);
+    if (size_ptr_it->first == size) {
+        // whole chunk is used up
+        chunks_free.erase(size_ptr_it->second);
+    } else {
+        // still some memory left in the chunk
+        auto it_remaining = size_to_free_chunk.emplace(size_remaining, size_ptr_it->second);
+        chunks_free[size_ptr_it->second] = it_remaining;
+        chunks_free_end.emplace(size_ptr_it->second + size_remaining, it_remaining);
+    }
+    size_to_free_chunk.erase(size_ptr_it);
+
+    return reinterpret_cast<void*>(alloced->first);
+}
+
+void Arena::free(void *ptr) noexcept
+{
+    // Freeing the nullptr pointer is OK.
+    if (ptr == nullptr) {
+        return;
+    }
+
+    // Remove chunk from used map
+    auto i = chunks_used.find(static_cast<char*>(ptr));
+    if (i == chunks_used.end()) {
+        assert(!"Arena: invalid or double free");
+    }
+    std::pair<char*, size_t> freed = *i;
+    chunks_used.erase(i);
+
+    // coalesce freed with previous chunk
+    auto prev = chunks_free_end.find(freed.first);
+    if (prev != chunks_free_end.end()) {
+        freed.first -= prev->second->first;
+        freed.second += prev->second->first;
+        size_to_free_chunk.erase(prev->second);
+        chunks_free_end.erase(prev);
+    }
+
+    // coalesce freed with chunk after freed
+    auto next = chunks_free.find(freed.first + freed.second);
+    if (next != chunks_free.end()) {
+        freed.second += next->second->first;
+        size_to_free_chunk.erase(next->second);
+        chunks_free.erase(next);
+    }
+
+    // Add/set space with coalesced free chunk
+    auto it = size_to_free_chunk.emplace(freed.second, freed.first);
+    chunks_free[freed.first] = it;
+    chunks_free_end[freed.first + freed.second] = it;
+}
+
+Arena::Stats Arena::stats() const
+{
+    Arena::Stats r{ 0, 0, 0, chunks_used.size(), chunks_free.size() };
+    for (const auto& chunk: chunks_used)
+        r.used += chunk.second;
+    for (const auto& chunk: chunks_free)
+        r.free += chunk.second->first;
+    r.total = r.used + r.free;
+    return r;
+}
+
+#ifdef ARENA_DEBUG
+static void printchunk(void* base, size_t sz, bool used) {
+    std::cout <<
+        "0x" << std::hex << std::setw(16) << std::setfill('0') << base <<
+        " 0x" << std::hex << std::setw(16) << std::setfill('0') << sz <<
+        " 0x" << used << std::endl;
+}
+void Arena::walk() const
+{
+    for (const auto& chunk: chunks_used)
+        printchunk(chunk.first, chunk.second, true);
+    std::cout << std::endl;
+    for (const auto& chunk: chunks_free)
+        printchunk(chunk.first, chunk.second->first, false);
+    std::cout << std::endl;
+}
+#endif
+
+/*******************************************************************************/
+// Implementation: Win32LockedPageAllocator
+
+#ifdef WIN32
+/** LockedPageAllocator specialized for Windows.
+ */
+class Win32LockedPageAllocator: public LockedPageAllocator
+{
+public:
+    Win32LockedPageAllocator();
+    void* AllocateLocked(size_t len, bool *lockingSuccess);
+    void FreeLocked(void* addr, size_t len);
+    size_t GetLimit();
+private:
+    size_t page_size;
+};
+
+Win32LockedPageAllocator::Win32LockedPageAllocator()
+{
+    // Determine system page size in bytes
+    SYSTEM_INFO sSysInfo;
+    GetSystemInfo(&sSysInfo);
+    page_size = sSysInfo.dwPageSize;
+}
+void *Win32LockedPageAllocator::AllocateLocked(size_t len, bool *lockingSuccess)
+{
+    len = align_up(len, page_size);
+    void *addr = VirtualAlloc(nullptr, len, MEM_COMMIT | MEM_RESERVE, PAGE_READWRITE);
+    if (addr) {
+        // VirtualLock is used to attempt to keep keying material out of swap. Note
+        // that it does not provide this as a guarantee, but, in practice, memory
+        // that has been VirtualLock'd almost never gets written to the pagefile
+        // except in rare circumstances where memory is extremely low.
+        *lockingSuccess = VirtualLock(const_cast<void*>(addr), len) != 0;
+    }
+    return addr;
+}
+void Win32LockedPageAllocator::FreeLocked(void* addr, size_t len)
+{
+    len = align_up(len, page_size);
+    memory_cleanse(addr, len);
+    VirtualUnlock(const_cast<void*>(addr), len);
+}
+
+size_t Win32LockedPageAllocator::GetLimit()
+{
+    // TODO is there a limit on windows, how to get it?
+    return std::numeric_limits<size_t>::max();
+}
+#endif
+
+/*******************************************************************************/
+// Implementation: PosixLockedPageAllocator
+
+#ifndef WIN32
+/** LockedPageAllocator specialized for OSes that don't try to be
+ * special snowflakes.
+ */
+class PosixLockedPageAllocator: public LockedPageAllocator
+{
+public:
+    PosixLockedPageAllocator();
+    void* AllocateLocked(size_t len, bool *lockingSuccess);
+    void FreeLocked(void* addr, size_t len);
+    size_t GetLimit();
+private:
+    size_t page_size;
+};
+
+PosixLockedPageAllocator::PosixLockedPageAllocator()
+{
+    // Determine system page size in bytes
+#if defined(PAGESIZE) // defined in limits.h
+    page_size = PAGESIZE;
+#else                   // assume some POSIX OS
+    page_size = sysconf(_SC_PAGESIZE);
+#endif
+}
+
+// Some systems (at least OS X) do not define MAP_ANONYMOUS yet and define
+// MAP_ANON which is deprecated
+#ifndef MAP_ANONYMOUS
+#define MAP_ANONYMOUS MAP_ANON
+#endif
+
+void *PosixLockedPageAllocator::AllocateLocked(size_t len, bool *lockingSuccess)
+{
+    void *addr;
+    len = align_up(len, page_size);
+    addr = mmap(nullptr, len, PROT_READ|PROT_WRITE, MAP_PRIVATE|MAP_ANONYMOUS, -1, 0);
+    if (addr == MAP_FAILED) {
+        return nullptr;
+    }
+    if (addr) {
+        *lockingSuccess = mlock(addr, len) == 0;
+#if defined(MADV_DONTDUMP) // Linux
+        madvise(addr, len, MADV_DONTDUMP);
+#elif defined(MADV_NOCORE) // FreeBSD
+        madvise(addr, len, MADV_NOCORE);
+#endif
+    }
+    return addr;
+}
+void PosixLockedPageAllocator::FreeLocked(void* addr, size_t len)
+{
+    len = align_up(len, page_size);
+    memory_cleanse(addr, len);
+    munlock(addr, len);
+    munmap(addr, len);
+}
+size_t PosixLockedPageAllocator::GetLimit()
+{
+#ifdef RLIMIT_MEMLOCK
+    struct rlimit rlim;
+    if (getrlimit(RLIMIT_MEMLOCK, &rlim) == 0) {
+        if (rlim.rlim_cur != RLIM_INFINITY) {
+            return rlim.rlim_cur;
+        }
+    }
+#endif
+    return std::numeric_limits<size_t>::max();
+}
+#endif
+
+/*******************************************************************************/
+// Implementation: LockedPool
+
+LockedPool::LockedPool(std::unique_ptr<LockedPageAllocator> allocator_in, LockingFailed_Callback lf_cb_in):
+    allocator(std::move(allocator_in)), lf_cb(lf_cb_in), cumulative_bytes_locked(0)
+{
+}
+
+LockedPool::~LockedPool()
+{
+}
+void* LockedPool::alloc(size_t size)
+{
+    std::lock_guard<std::mutex> lock(mutex);
+
+    // Don't handle impossible sizes
+    if (size == 0 || size > ARENA_SIZE)
+        return nullptr;
+
+    // Try allocating from each current arena
+    for (auto &arena: arenas) {
+        void *addr = arena.alloc(size);
+        if (addr) {
+            return addr;
+        }
+    }
+    // If that fails, create a new one
+    if (new_arena(ARENA_SIZE, ARENA_ALIGN)) {
+        return arenas.back().alloc(size);
+    }
+    return nullptr;
+}
+
+void LockedPool::free(void *ptr) noexcept
+{
+    // Freeing the nullptr pointer is OK.
+    if (ptr == nullptr) {
+        return;
+    }
+
+    std::lock_guard<std::mutex> lock(mutex);
+    // TODO we can do better than this linear search by keeping a map of arena
+    // extents to arena, and looking up the address.
+    for (auto &arena: arenas) {
+        if (arena.addressInArena(ptr)) {
+            arena.free(ptr);
+            return;
+        }
+    }
+    assert(!"LockedPool: invalid address not pointing to any arena");
+}
+
+LockedPool::Stats LockedPool::stats() const
+{
+    std::lock_guard<std::mutex> lock(mutex);
+    LockedPool::Stats r{0, 0, 0, cumulative_bytes_locked, 0, 0};
+    for (const auto &arena: arenas) {
+        Arena::Stats i = arena.stats();
+        r.used += i.used;
+        r.free += i.free;
+        r.total += i.total;
+        r.chunks_used += i.chunks_used;
+        r.chunks_free += i.chunks_free;
+    }
+    return r;
+}
+
+bool LockedPool::new_arena(size_t size, size_t align)
+{
+    bool locked;
+    // If this is the first arena, handle this specially: Cap the upper size
+    // by the process limit. This makes sure that the first arena will at least
+    // be locked. An exception to this is if the process limit is 0:
+    // in this case no memory can be locked at all so we'll skip past this logic.
+    if (arenas.empty()) {
+        size_t limit = allocator->GetLimit();
+        if (limit > 0) {
+            size = std::min(size, limit);
+        }
+    }
+    void *addr = allocator->AllocateLocked(size, &locked);
+    if (!addr) {
+        return false;
+    }
+    if (locked) {
+        cumulative_bytes_locked += size;
+    } else if (lf_cb) { // Call the locking-failed callback if locking failed
+        if (!lf_cb()) { // If the callback returns false, free the memory and fail, otherwise consider the user warned and proceed.
+            allocator->FreeLocked(addr, size);
+            return false;
+        }
+    }
+    arenas.emplace_back(allocator.get(), addr, size, align);
+    return true;
+}
+
+LockedPool::LockedPageArena::LockedPageArena(LockedPageAllocator *allocator_in, void *base_in, size_t size_in, size_t align_in):
+    Arena(base_in, size_in, align_in), base(base_in), size(size_in), allocator(allocator_in)
+{
+}
+LockedPool::LockedPageArena::~LockedPageArena()
+{
+    allocator->FreeLocked(base, size);
+}
+
+/*******************************************************************************/
+// Implementation: LockedPoolManager
+//
+LockedPoolManager::LockedPoolManager(std::unique_ptr<LockedPageAllocator> allocator):
+    LockedPool(std::move(allocator), &LockedPoolManager::LockingFailed)
+{
+}
+
+bool LockedPoolManager::LockingFailed()
+{
+    // TODO: log something but how? without including util.h
+    return true;
+}
+
+void LockedPoolManager::CreateInstance()
+{
+    // Using a local static instance guarantees that the object is initialized
+    // when it's first needed and also deinitialized after all objects that use
+    // it are done with it.  I can think of one unlikely scenario where we may
+    // have a static deinitialization order/problem, but the check in
+    // LockedPoolManagerBase's destructor helps us detect if that ever happens.
+#ifdef WIN32
+    std::unique_ptr<LockedPageAllocator> allocator(new Win32LockedPageAllocator());
+#else
+    std::unique_ptr<LockedPageAllocator> allocator(new PosixLockedPageAllocator());
+#endif
+    static LockedPoolManager instance(std::move(allocator));
+    LockedPoolManager::_instance = &instance;
+}
diff --git a/depend/zcash/src/support/lockedpool.h b/depend/zcash/src/support/lockedpool.h
new file mode 100644
index 000000000..c73c6e9b6
--- /dev/null
+++ b/depend/zcash/src/support/lockedpool.h
@@ -0,0 +1,238 @@
+// Copyright (c) 2016 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_SUPPORT_LOCKEDPOOL_H
+#define BITCOIN_SUPPORT_LOCKEDPOOL_H
+
+#include <stdint.h>
+#include <list>
+#include <map>
+#include <mutex>
+#include <memory>
+#include <unordered_map>
+
+/**
+ * OS-dependent allocation and deallocation of locked/pinned memory pages.
+ * Abstract base class.
+ */
+class LockedPageAllocator
+{
+public:
+    virtual ~LockedPageAllocator() {}
+    /** Allocate and lock memory pages.
+     * If len is not a multiple of the system page size, it is rounded up.
+     * Returns nullptr in case of allocation failure.
+     *
+     * If locking the memory pages could not be accomplished it will still
+     * return the memory, however the lockingSuccess flag will be false.
+     * lockingSuccess is undefined if the allocation fails.
+     */
+    virtual void* AllocateLocked(size_t len, bool *lockingSuccess) = 0;
+
+    /** Unlock and free memory pages.
+     * Clear the memory before unlocking.
+     */
+    virtual void FreeLocked(void* addr, size_t len) = 0;
+
+    /** Get the total limit on the amount of memory that may be locked by this
+     * process, in bytes. Return size_t max if there is no limit or the limit
+     * is unknown. Return 0 if no memory can be locked at all.
+     */
+    virtual size_t GetLimit() = 0;
+};
+
+/* An arena manages a contiguous region of memory by dividing it into
+ * chunks.
+ */
+class Arena
+{
+public:
+    Arena(void *base, size_t size, size_t alignment);
+    virtual ~Arena();
+
+    Arena(const Arena& other) = delete; // non construction-copyable
+    Arena& operator=(const Arena&) = delete; // non copyable
+
+    /** Memory statistics. */
+    struct Stats
+    {
+        size_t used;
+        size_t free;
+        size_t total;
+        size_t chunks_used;
+        size_t chunks_free;
+    };
+
+    /** Allocate size bytes from this arena.
+     * Returns pointer on success, or 0 if memory is full or
+     * the application tried to allocate 0 bytes.
+     */
+    void* alloc(size_t size);
+
+    /** Free a previously allocated chunk of memory.
+     * Freeing the zero pointer has no effect.
+     */
+    void free(void *ptr) noexcept;
+
+    /** Get arena usage statistics */
+    Stats stats() const;
+
+#ifdef ARENA_DEBUG
+    void walk() const;
+#endif
+
+    /** Return whether a pointer points inside this arena.
+     * This returns base <= ptr < (base+size) so only use it for (inclusive)
+     * chunk starting addresses.
+     */
+    bool addressInArena(void *ptr) const { return ptr >= base && ptr < end; }
+private:
+    typedef std::multimap<size_t, char*> SizeToChunkSortedMap;
+    /** Map to enable O(log(n)) best-fit allocation, as it's sorted by size */
+    SizeToChunkSortedMap size_to_free_chunk;
+
+    typedef std::unordered_map<char*, SizeToChunkSortedMap::const_iterator> ChunkToSizeMap;
+    /** Map from begin of free chunk to its node in size_to_free_chunk */
+    ChunkToSizeMap chunks_free;
+    /** Map from end of free chunk to its node in size_to_free_chunk */
+    ChunkToSizeMap chunks_free_end;
+
+    /** Map from begin of used chunk to its size */
+    std::unordered_map<char*, size_t> chunks_used;
+
+    /** Base address of arena */
+    char* base;
+    /** End address of arena */
+    char* end;
+    /** Minimum chunk alignment */
+    size_t alignment;
+};
+
+/** Pool for locked memory chunks.
+ *
+ * To avoid sensitive key data from being swapped to disk, the memory in this pool
+ * is locked/pinned.
+ *
+ * An arena manages a contiguous region of memory. The pool starts out with one arena
+ * but can grow to multiple arenas if the need arises.
+ *
+ * Unlike a normal C heap, the administrative structures are separate from the managed
+ * memory. This has been done as the sizes and bases of objects are not in themselves sensitive
+ * information, as to conserve precious locked memory. In some operating systems
+ * the amount of memory that can be locked is small.
+ */
+class LockedPool
+{
+public:
+    /** Size of one arena of locked memory. This is a compromise.
+     * Do not set this too low, as managing many arenas will increase
+     * allocation and deallocation overhead. Setting it too high allocates
+     * more locked memory from the OS than strictly necessary.
+     */
+    static const size_t ARENA_SIZE = 256*1024;
+    /** Chunk alignment. Another compromise. Setting this too high will waste
+     * memory, setting it too low will facilitate fragmentation.
+     */
+    static const size_t ARENA_ALIGN = 16;
+
+    /** Callback when allocation succeeds but locking fails.
+     */
+    typedef bool (*LockingFailed_Callback)();
+
+    /** Memory statistics. */
+    struct Stats
+    {
+        size_t used;
+        size_t free;
+        size_t total;
+        size_t locked;
+        size_t chunks_used;
+        size_t chunks_free;
+    };
+
+    /** Create a new LockedPool. This takes ownership of the MemoryPageLocker,
+     * you can only instantiate this with LockedPool(std::move(...)).
+     *
+     * The second argument is an optional callback when locking a newly allocated arena failed.
+     * If this callback is provided and returns false, the allocation fails (hard fail), if
+     * it returns true the allocation proceeds, but it could warn.
+     */
+    explicit LockedPool(std::unique_ptr<LockedPageAllocator> allocator, LockingFailed_Callback lf_cb_in = nullptr);
+    ~LockedPool();
+
+    LockedPool(const LockedPool& other) = delete; // non construction-copyable
+    LockedPool& operator=(const LockedPool&) = delete; // non copyable
+
+    /** Allocate size bytes from this arena.
+     * Returns pointer on success, or 0 if memory is full or
+     * the application tried to allocate 0 bytes.
+     */
+    void* alloc(size_t size);
+
+    /** Free a previously allocated chunk of memory.
+     * Freeing the zero pointer has no effect.
+     */
+    void free(void *ptr) noexcept;
+
+    /** Get pool usage statistics */
+    Stats stats() const;
+private:
+    std::unique_ptr<LockedPageAllocator> allocator;
+
+    /** Create an arena from locked pages */
+    class LockedPageArena: public Arena
+    {
+    public:
+        LockedPageArena(LockedPageAllocator *alloc_in, void *base_in, size_t size, size_t align);
+        ~LockedPageArena();
+    private:
+        void *base;
+        size_t size;
+        LockedPageAllocator *allocator;
+    };
+
+    bool new_arena(size_t size, size_t align);
+
+    std::list<LockedPageArena> arenas;
+    LockingFailed_Callback lf_cb;
+    size_t cumulative_bytes_locked;
+    /** Mutex protects access to this pool's data structures, including arenas.
+     */
+    mutable std::mutex mutex;
+};
+
+/**
+ * Singleton class to keep track of locked (ie, non-swappable) memory, for use in
+ * std::allocator templates.
+ *
+ * Some implementations of the STL allocate memory in some constructors (i.e., see
+ * MSVC's vector<T> implementation where it allocates 1 byte of memory in the allocator.)
+ * Due to the unpredictable order of static initializers, we have to make sure the
+ * LockedPoolManager instance exists before any other STL-based objects that use
+ * secure_allocator are created. So instead of having LockedPoolManager also be
+ * static-initialized, it is created on demand.
+ */
+class LockedPoolManager : public LockedPool
+{
+public:
+    /** Return the current instance, or create it once */
+    static LockedPoolManager& Instance()
+    {
+        static std::once_flag init_flag;
+        std::call_once(init_flag, LockedPoolManager::CreateInstance);
+        return *LockedPoolManager::_instance;
+    }
+
+private:
+    explicit LockedPoolManager(std::unique_ptr<LockedPageAllocator> allocator);
+
+    /** Create a new LockedPoolManager specialized to the OS */
+    static void CreateInstance();
+    /** Called when locking fails, warn the user here */
+    static bool LockingFailed();
+
+    static LockedPoolManager* _instance;
+};
+
+#endif // BITCOIN_SUPPORT_LOCKEDPOOL_H
diff --git a/depend/zcash/src/sync.cpp b/depend/zcash/src/sync.cpp
new file mode 100644
index 000000000..da839ecae
--- /dev/null
+++ b/depend/zcash/src/sync.cpp
@@ -0,0 +1,224 @@
+// Copyright (c) 2011-2012 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "sync.h"
+
+#include "util.h"
+#include "utilstrencodings.h"
+
+#include <stdio.h>
+
+#include <boost/thread.hpp>
+
+#ifdef DEBUG_LOCKCONTENTION
+void PrintLockContention(const char* pszName, const char* pszFile, int nLine)
+{
+    LogPrintf("LOCKCONTENTION: %s\n", pszName);
+    LogPrintf("Locker: %s:%d\n", pszFile, nLine);
+}
+#endif /* DEBUG_LOCKCONTENTION */
+
+#ifdef DEBUG_LOCKORDER
+//
+// Early deadlock detection.
+// Problem being solved:
+//    Thread 1 locks  A, then B, then C
+//    Thread 2 locks  D, then C, then A
+//     --> may result in deadlock between the two threads, depending on when they run.
+// Solution implemented here:
+// Keep track of pairs of locks: (A before B), (A before C), etc.
+// Complain if any thread tries to lock in a different order.
+//
+
+struct CLockLocation {
+    CLockLocation(const char* pszName, const char* pszFile, int nLine, bool fTryIn)
+    {
+        mutexName = pszName;
+        sourceFile = pszFile;
+        sourceLine = nLine;
+        fTry = fTryIn;
+    }
+
+    std::string ToString() const
+    {
+        return mutexName + "  " + sourceFile + ":" + itostr(sourceLine) + (fTry ? " (TRY)" : "");
+    }
+
+    std::string MutexName() const { return mutexName; }
+
+    bool fTry;
+private:
+    std::string mutexName;
+    std::string sourceFile;
+    int sourceLine;
+};
+
+typedef std::vector<std::pair<void*, CLockLocation> > LockStack;
+typedef std::map<std::pair<void*, void*>, LockStack> LockOrders;
+typedef std::set<std::pair<void*, void*> > InvLockOrders;
+
+struct LockData {
+    // Very ugly hack: as the global constructs and destructors run single
+    // threaded, we use this boolean to know whether LockData still exists,
+    // as DeleteLock can get called by global CCriticalSection destructors
+    // after LockData disappears.
+    bool available;
+    LockData() : available(true) {}
+    ~LockData() { available = false; }
+
+    LockOrders lockorders;
+    InvLockOrders invlockorders;
+    boost::mutex dd_mutex;
+};
+LockData& GetLockData() {
+    static LockData lockdata;
+    return lockdata;
+}
+
+boost::thread_specific_ptr<LockStack> lockstack;
+
+static void potential_deadlock_detected(const std::pair<void*, void*>& mismatch, const LockStack& s1, const LockStack& s2)
+{
+    // We attempt to not assert on probably-not deadlocks by assuming that
+    // a try lock will immediately have otherwise bailed if it had
+    // failed to get the lock
+    // We do this by, for the locks which triggered the potential deadlock,
+    // in either lockorder, checking that the second of the two which is locked
+    // is only a TRY_LOCK, ignoring locks if they are reentrant.
+    bool firstLocked = false;
+    bool secondLocked = false;
+    bool onlyMaybeDeadlock = false;
+
+    LogPrintf("POTENTIAL DEADLOCK DETECTED\n");
+    LogPrintf("Previous lock order was:\n");
+    for (const std::pair<void*, CLockLocation> & i : s2) {
+        if (i.first == mismatch.first) {
+            LogPrintf(" (1)");
+            if (!firstLocked && secondLocked && i.second.fTry)
+                onlyMaybeDeadlock = true;
+            firstLocked = true;
+        }
+        if (i.first == mismatch.second) {
+            LogPrintf(" (2)");
+            if (!secondLocked && firstLocked && i.second.fTry)
+                onlyMaybeDeadlock = true;
+            secondLocked = true;
+        }
+        LogPrintf(" %s\n", i.second.ToString());
+    }
+    firstLocked = false;
+    secondLocked = false;
+    LogPrintf("Current lock order is:\n");
+    for (const std::pair<void*, CLockLocation> & i : s1) {
+        if (i.first == mismatch.first) {
+            LogPrintf(" (1)");
+            if (!firstLocked && secondLocked && i.second.fTry)
+                onlyMaybeDeadlock = true;
+            firstLocked = true;
+        }
+        if (i.first == mismatch.second) {
+            LogPrintf(" (2)");
+            if (!secondLocked && firstLocked && i.second.fTry)
+                onlyMaybeDeadlock = true;
+            secondLocked = true;
+        }
+        LogPrintf(" %s\n", i.second.ToString());
+    }
+    assert(onlyMaybeDeadlock);
+}
+
+static void push_lock(void* c, const CLockLocation& locklocation, bool fTry)
+{
+    if (lockstack.get() == NULL)
+        lockstack.reset(new LockStack);
+
+    LockData& lockdata = GetLockData();
+    boost::unique_lock<boost::mutex> lock(lockdata.dd_mutex);
+
+    (*lockstack).push_back(std::make_pair(c, locklocation));
+
+    if (!fTry) {
+        for (const std::pair<void*, CLockLocation> & i : (*lockstack)) {
+            if (i.first == c)
+                break;
+
+            std::pair<void*, void*> p1 = std::make_pair(i.first, c);
+            if (lockdata.lockorders.count(p1))
+                continue;
+            lockdata.lockorders[p1] = (*lockstack);
+
+            std::pair<void*, void*> p2 = std::make_pair(c, i.first);
+            lockdata.invlockorders.insert(p2);
+            if (lockdata.lockorders.count(p2))
+                potential_deadlock_detected(p1, lockdata.lockorders[p2], lockdata.lockorders[p1]);
+        }
+    }
+}
+
+static void pop_lock()
+{
+    (*lockstack).pop_back();
+}
+
+void EnterCritical(const char* pszName, const char* pszFile, int nLine, void* cs, bool fTry)
+{
+    push_lock(cs, CLockLocation(pszName, pszFile, nLine, fTry), fTry);
+}
+
+void LeaveCritical()
+{
+    pop_lock();
+}
+
+std::string LocksHeld()
+{
+    std::string result;
+    for (const std::pair<void*, CLockLocation> & i : *lockstack)
+        result += i.second.ToString() + std::string("\n");
+    return result;
+}
+
+void AssertLockHeldInternal(const char* pszName, const char* pszFile, int nLine, void* cs)
+{
+    for (const std::pair<void*, CLockLocation> & i : *lockstack)
+        if (i.first == cs)
+            return;
+    fprintf(stderr, "Assertion failed: lock %s not held in %s:%i; locks held:\n%s", pszName, pszFile, nLine, LocksHeld().c_str());
+    abort();
+}
+
+void AssertLockNotHeldInternal(const char* pszName, const char* pszFile, int nLine, void* cs)
+{
+    for (const std::pair<void*, CLockLocation>& i : *lockstack) {
+        if (i.first == cs) {
+            fprintf(stderr, "Assertion failed: lock %s held in %s:%i; locks held:\n%s", pszName, pszFile, nLine, LocksHeld().c_str());
+            abort();
+        }
+    }
+}
+
+void DeleteLock(void* cs)
+{
+    LockData& lockdata = GetLockData();
+    if (!lockdata.available) {
+        // We're already shutting down.
+        return;
+    }
+    boost::unique_lock<boost::mutex> lock(lockdata.dd_mutex);
+    std::pair<void*, void*> item = std::make_pair(cs, (void*)0);
+    LockOrders::iterator it = lockdata.lockorders.lower_bound(item);
+    while (it != lockdata.lockorders.end() && it->first.first == cs) {
+        std::pair<void*, void*> invitem = std::make_pair(it->first.second, it->first.first);
+        lockdata.invlockorders.erase(invitem);
+        lockdata.lockorders.erase(it++);
+    }
+    InvLockOrders::iterator invit = lockdata.invlockorders.lower_bound(item);
+    while (invit != lockdata.invlockorders.end() && invit->first == cs) {
+        std::pair<void*, void*> invinvitem = std::make_pair(invit->second, invit->first);
+        lockdata.lockorders.erase(invinvitem);
+        lockdata.invlockorders.erase(invit++);
+    }
+}
+
+#endif /* DEBUG_LOCKORDER */
diff --git a/depend/zcash/src/sync.h b/depend/zcash/src/sync.h
new file mode 100644
index 000000000..f8925821f
--- /dev/null
+++ b/depend/zcash/src/sync.h
@@ -0,0 +1,295 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_SYNC_H
+#define BITCOIN_SYNC_H
+
+#include "threadsafety.h"
+
+#include <boost/thread/condition_variable.hpp>
+#include <boost/thread/locks.hpp>
+#include <boost/thread/mutex.hpp>
+#include <boost/thread/recursive_mutex.hpp>
+
+
+////////////////////////////////////////////////
+//                                            //
+// THE SIMPLE DEFINITION, EXCLUDING DEBUG CODE //
+//                                            //
+////////////////////////////////////////////////
+
+/*
+CCriticalSection mutex;
+    boost::recursive_mutex mutex;
+
+LOCK(mutex);
+    boost::unique_lock<boost::recursive_mutex> criticalblock(mutex);
+
+LOCK2(mutex1, mutex2);
+    boost::unique_lock<boost::recursive_mutex> criticalblock1(mutex1);
+    boost::unique_lock<boost::recursive_mutex> criticalblock2(mutex2);
+
+TRY_LOCK(mutex, name);
+    boost::unique_lock<boost::recursive_mutex> name(mutex, boost::try_to_lock_t);
+
+ENTER_CRITICAL_SECTION(mutex); // no RAII
+    mutex.lock();
+
+LEAVE_CRITICAL_SECTION(mutex); // no RAII
+    mutex.unlock();
+ */
+
+///////////////////////////////
+//                           //
+// THE ACTUAL IMPLEMENTATION //
+//                           //
+///////////////////////////////
+
+/**
+ * Template mixin that adds -Wthread-safety locking
+ * annotations to a subset of the mutex API.
+ */
+template <typename PARENT>
+class LOCKABLE AnnotatedMixin : public PARENT
+{
+public:
+    void lock() EXCLUSIVE_LOCK_FUNCTION()
+    {
+        PARENT::lock();
+    }
+
+    void unlock() UNLOCK_FUNCTION()
+    {
+        PARENT::unlock();
+    }
+
+    bool try_lock() EXCLUSIVE_TRYLOCK_FUNCTION(true)
+    {
+        return PARENT::try_lock();
+    }
+};
+
+#ifdef DEBUG_LOCKORDER
+void EnterCritical(const char* pszName, const char* pszFile, int nLine, void* cs, bool fTry = false);
+void LeaveCritical();
+std::string LocksHeld();
+void AssertLockHeldInternal(const char* pszName, const char* pszFile, int nLine, void* cs);
+void AssertLockNotHeldInternal(const char* pszName, const char* pszFile, int nLine, void* cs);
+void DeleteLock(void* cs);
+#else
+void static inline EnterCritical(const char* pszName, const char* pszFile, int nLine, void* cs, bool fTry = false) {}
+void static inline LeaveCritical() {}
+void static inline AssertLockHeldInternal(const char* pszName, const char* pszFile, int nLine, void* cs) {}
+void static inline AssertLockNotHeldInternal(const char* pszName, const char* pszFile, int nLine, void* cs) {}
+void static inline DeleteLock(void* cs) {}
+#endif
+#define AssertLockHeld(cs) AssertLockHeldInternal(#cs, __FILE__, __LINE__, &cs)
+#define AssertLockNotHeld(cs) AssertLockNotHeldInternal(#cs, __FILE__, __LINE__, &cs)
+
+/**
+ * Wrapped boost mutex: supports recursive locking, but no waiting
+ * TODO: We should move away from using the recursive lock by default.
+ */
+class CCriticalSection : public AnnotatedMixin<boost::recursive_mutex>
+{
+public:
+    ~CCriticalSection() {
+        DeleteLock((void*)this);
+    }
+};
+
+typedef CCriticalSection CDynamicCriticalSection;
+/** Wrapped boost mutex: supports waiting but not recursive locking */
+typedef AnnotatedMixin<boost::mutex> CWaitableCriticalSection;
+
+/** Just a typedef for boost::condition_variable, can be wrapped later if desired */
+typedef boost::condition_variable CConditionVariable;
+
+#ifdef DEBUG_LOCKCONTENTION
+void PrintLockContention(const char* pszName, const char* pszFile, int nLine);
+#endif
+
+/** Wrapper around boost::unique_lock<Mutex> */
+template <typename Mutex>
+class SCOPED_LOCKABLE CMutexLock
+{
+private:
+    boost::unique_lock<Mutex> lock;
+
+    void Enter(const char* pszName, const char* pszFile, int nLine)
+    {
+        EnterCritical(pszName, pszFile, nLine, (void*)(lock.mutex()));
+#ifdef DEBUG_LOCKCONTENTION
+        if (!lock.try_lock()) {
+            PrintLockContention(pszName, pszFile, nLine);
+#endif
+            lock.lock();
+#ifdef DEBUG_LOCKCONTENTION
+        }
+#endif
+    }
+
+    bool TryEnter(const char* pszName, const char* pszFile, int nLine)
+    {
+        EnterCritical(pszName, pszFile, nLine, (void*)(lock.mutex()), true);
+        lock.try_lock();
+        if (!lock.owns_lock())
+            LeaveCritical();
+        return lock.owns_lock();
+    }
+
+public:
+    CMutexLock(Mutex& mutexIn, const char* pszName, const char* pszFile, int nLine, bool fTry = false) EXCLUSIVE_LOCK_FUNCTION(mutexIn) : lock(mutexIn, boost::defer_lock)
+    {
+        if (fTry)
+            TryEnter(pszName, pszFile, nLine);
+        else
+            Enter(pszName, pszFile, nLine);
+    }
+
+    CMutexLock(Mutex* pmutexIn, const char* pszName, const char* pszFile, int nLine, bool fTry = false) EXCLUSIVE_LOCK_FUNCTION(pmutexIn)
+    {
+        if (!pmutexIn) return;
+
+        lock = boost::unique_lock<Mutex>(*pmutexIn, boost::defer_lock);
+        if (fTry)
+            TryEnter(pszName, pszFile, nLine);
+        else
+            Enter(pszName, pszFile, nLine);
+    }
+
+    ~CMutexLock() UNLOCK_FUNCTION()
+    {
+        if (lock.owns_lock())
+            LeaveCritical();
+    }
+
+    operator bool()
+    {
+        return lock.owns_lock();
+    }
+};
+
+typedef CMutexLock<CCriticalSection> CCriticalBlock;
+
+#define PASTE(x, y) x ## y
+#define PASTE2(x, y) PASTE(x, y)
+
+#define LOCK(cs) CCriticalBlock PASTE2(criticalblock, __COUNTER__)(cs, #cs, __FILE__, __LINE__)
+#define LOCK2(cs1, cs2) CCriticalBlock criticalblock1(cs1, #cs1, __FILE__, __LINE__), criticalblock2(cs2, #cs2, __FILE__, __LINE__)
+#define TRY_LOCK(cs, name) CCriticalBlock name(cs, #cs, __FILE__, __LINE__, true)
+
+#define ENTER_CRITICAL_SECTION(cs)                            \
+    {                                                         \
+        EnterCritical(#cs, __FILE__, __LINE__, (void*)(&cs)); \
+        (cs).lock();                                          \
+    }
+
+#define LEAVE_CRITICAL_SECTION(cs) \
+    {                              \
+        (cs).unlock();             \
+        LeaveCritical();           \
+    }
+
+class CSemaphore
+{
+private:
+    boost::condition_variable condition;
+    boost::mutex mutex;
+    int value;
+
+public:
+    CSemaphore(int init) : value(init) {}
+
+    void wait()
+    {
+        boost::unique_lock<boost::mutex> lock(mutex);
+        while (value < 1) {
+            condition.wait(lock);
+        }
+        value--;
+    }
+
+    bool try_wait()
+    {
+        boost::unique_lock<boost::mutex> lock(mutex);
+        if (value < 1)
+            return false;
+        value--;
+        return true;
+    }
+
+    void post()
+    {
+        {
+            boost::unique_lock<boost::mutex> lock(mutex);
+            value++;
+        }
+        condition.notify_one();
+    }
+};
+
+/** RAII-style semaphore lock */
+class CSemaphoreGrant
+{
+private:
+    CSemaphore* sem;
+    bool fHaveGrant;
+
+public:
+    void Acquire()
+    {
+        if (fHaveGrant)
+            return;
+        sem->wait();
+        fHaveGrant = true;
+    }
+
+    void Release()
+    {
+        if (!fHaveGrant)
+            return;
+        sem->post();
+        fHaveGrant = false;
+    }
+
+    bool TryAcquire()
+    {
+        if (!fHaveGrant && sem->try_wait())
+            fHaveGrant = true;
+        return fHaveGrant;
+    }
+
+    void MoveTo(CSemaphoreGrant& grant)
+    {
+        grant.Release();
+        grant.sem = sem;
+        grant.fHaveGrant = fHaveGrant;
+        sem = NULL;
+        fHaveGrant = false;
+    }
+
+    CSemaphoreGrant() : sem(NULL), fHaveGrant(false) {}
+
+    CSemaphoreGrant(CSemaphore& sema, bool fTry = false) : sem(&sema), fHaveGrant(false)
+    {
+        if (fTry)
+            TryAcquire();
+        else
+            Acquire();
+    }
+
+    ~CSemaphoreGrant()
+    {
+        Release();
+    }
+
+    operator bool()
+    {
+        return fHaveGrant;
+    }
+};
+
+#endif // BITCOIN_SYNC_H
diff --git a/depend/zcash/src/test/Checkpoints_tests.cpp b/depend/zcash/src/test/Checkpoints_tests.cpp
new file mode 100644
index 000000000..81b9146a5
--- /dev/null
+++ b/depend/zcash/src/test/Checkpoints_tests.cpp
@@ -0,0 +1,29 @@
+// Copyright (c) 2011-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+//
+// Unit tests for block-chain checkpoints
+//
+
+#include "checkpoints.h"
+
+#include "uint256.h"
+#include "test/test_bitcoin.h"
+#include "chainparams.h"
+
+#include <boost/test/unit_test.hpp>
+
+using namespace std;
+
+BOOST_FIXTURE_TEST_SUITE(Checkpoints_tests, BasicTestingSetup) // DISABLED_TEST_SUITE
+
+// TODO: checkpoints have been removed for now.
+/*
+BOOST_AUTO_TEST_CASE(sanity)
+{
+    const CCheckpointData& checkpoints = Params(CBaseChainParams::MAIN).Checkpoints();
+    BOOST_CHECK(Checkpoints::GetTotalBlocksEstimate(checkpoints) >= 134444);
+}
+*/
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/DoS_tests.cpp b/depend/zcash/src/test/DoS_tests.cpp
new file mode 100644
index 000000000..ad170451b
--- /dev/null
+++ b/depend/zcash/src/test/DoS_tests.cpp
@@ -0,0 +1,212 @@
+// Copyright (c) 2011-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+//
+// Unit tests for denial-of-service detection/prevention code
+//
+
+
+
+#include "consensus/upgrades.h"
+#include "keystore.h"
+#include "main.h"
+#include "net.h"
+#include "pow.h"
+#include "script/sign.h"
+#include "serialize.h"
+#include "util.h"
+
+#include "test/test_bitcoin.h"
+
+#include <stdint.h>
+
+#include <boost/assign/list_of.hpp> // for 'map_list_of()'
+#include <boost/date_time/posix_time/posix_time_types.hpp>
+#include <boost/test/unit_test.hpp>
+#include <boost/test/data/test_case.hpp>
+
+// Tests this internal-to-main.cpp method:
+extern bool AddOrphanTx(const CTransaction& tx, NodeId peer);
+extern void EraseOrphansFor(NodeId peer);
+extern unsigned int LimitOrphanTxSize(unsigned int nMaxOrphans);
+struct COrphanTx {
+    CTransaction tx;
+    NodeId fromPeer;
+};
+extern std::map<uint256, COrphanTx> mapOrphanTransactions;
+extern std::map<uint256, std::set<uint256> > mapOrphanTransactionsByPrev;
+
+CService ip(uint32_t i)
+{
+    struct in_addr s;
+    s.s_addr = i;
+    return CService(CNetAddr(s), Params().GetDefaultPort());
+}
+
+BOOST_FIXTURE_TEST_SUITE(DoS_tests, TestingSetup)
+
+BOOST_AUTO_TEST_CASE(DoS_banning)
+{
+    const Consensus::Params& params = Params().GetConsensus();
+    CNode::ClearBanned();
+    CAddress addr1(ip(0xa0b0c001));
+    CNode dummyNode1(INVALID_SOCKET, addr1, "", true);
+    dummyNode1.nVersion = 1;
+    Misbehaving(dummyNode1.GetId(), 100); // Should get banned
+    SendMessages(params, &dummyNode1);
+    BOOST_CHECK(CNode::IsBanned(addr1));
+    BOOST_CHECK(!CNode::IsBanned(ip(0xa0b0c001|0x0000ff00))); // Different IP, not banned
+
+    CAddress addr2(ip(0xa0b0c002));
+    CNode dummyNode2(INVALID_SOCKET, addr2, "", true);
+    dummyNode2.nVersion = 1;
+    Misbehaving(dummyNode2.GetId(), 50);
+    SendMessages(params, &dummyNode2);
+    BOOST_CHECK(!CNode::IsBanned(addr2)); // 2 not banned yet...
+    BOOST_CHECK(CNode::IsBanned(addr1));  // ... but 1 still should be
+    Misbehaving(dummyNode2.GetId(), 50);
+    SendMessages(params, &dummyNode2);
+    BOOST_CHECK(CNode::IsBanned(addr2));
+}
+
+BOOST_AUTO_TEST_CASE(DoS_banscore)
+{
+    const Consensus::Params& params = Params().GetConsensus();
+    CNode::ClearBanned();
+    mapArgs["-banscore"] = "111"; // because 11 is my favorite number
+    CAddress addr1(ip(0xa0b0c001));
+    CNode dummyNode1(INVALID_SOCKET, addr1, "", true);
+    dummyNode1.nVersion = 1;
+    Misbehaving(dummyNode1.GetId(), 100);
+    SendMessages(params, &dummyNode1);
+    BOOST_CHECK(!CNode::IsBanned(addr1));
+    Misbehaving(dummyNode1.GetId(), 10);
+    SendMessages(params, &dummyNode1);
+    BOOST_CHECK(!CNode::IsBanned(addr1));
+    Misbehaving(dummyNode1.GetId(), 1);
+    SendMessages(params, &dummyNode1);
+    BOOST_CHECK(CNode::IsBanned(addr1));
+    mapArgs.erase("-banscore");
+}
+
+BOOST_AUTO_TEST_CASE(DoS_bantime)
+{
+    const Consensus::Params& params = Params().GetConsensus();
+    CNode::ClearBanned();
+    int64_t nStartTime = GetTime();
+    SetMockTime(nStartTime); // Overrides future calls to GetTime()
+
+    CAddress addr(ip(0xa0b0c001));
+    CNode dummyNode(INVALID_SOCKET, addr, "", true);
+    dummyNode.nVersion = 1;
+
+    Misbehaving(dummyNode.GetId(), 100);
+    SendMessages(params, &dummyNode);
+    BOOST_CHECK(CNode::IsBanned(addr));
+
+    SetMockTime(nStartTime+60*60);
+    BOOST_CHECK(CNode::IsBanned(addr));
+
+    SetMockTime(nStartTime+60*60*24+1);
+    BOOST_CHECK(!CNode::IsBanned(addr));
+}
+
+CTransaction RandomOrphan()
+{
+    std::map<uint256, COrphanTx>::iterator it;
+    it = mapOrphanTransactions.lower_bound(GetRandHash());
+    if (it == mapOrphanTransactions.end())
+        it = mapOrphanTransactions.begin();
+    return it->second.tx;
+}
+
+// Parameterized testing over consensus branch ids
+BOOST_DATA_TEST_CASE(DoS_mapOrphans, boost::unit_test::data::xrange(static_cast<int>(Consensus::MAX_NETWORK_UPGRADES)))
+{
+    uint32_t consensusBranchId = NetworkUpgradeInfo[sample].nBranchId;
+
+    CKey key = CKey::TestOnlyRandomKey(true);
+    CBasicKeyStore keystore;
+    keystore.AddKey(key);
+
+    // 50 orphan transactions:
+    for (int i = 0; i < 50; i++)
+    {
+        CMutableTransaction tx;
+        tx.vin.resize(1);
+        tx.vin[0].prevout.n = 0;
+        tx.vin[0].prevout.hash = GetRandHash();
+        tx.vin[0].scriptSig << OP_1;
+        tx.vout.resize(1);
+        tx.vout[0].nValue = 1*CENT;
+        tx.vout[0].scriptPubKey = GetScriptForDestination(key.GetPubKey().GetID());
+
+        AddOrphanTx(tx, i);
+    }
+
+    // ... and 50 that depend on other orphans:
+    for (int i = 0; i < 50; i++)
+    {
+        CTransaction txPrev = RandomOrphan();
+
+        CMutableTransaction tx;
+        tx.vin.resize(1);
+        tx.vin[0].prevout.n = 0;
+        tx.vin[0].prevout.hash = txPrev.GetHash();
+        tx.vout.resize(1);
+        tx.vout[0].nValue = 1*CENT;
+        tx.vout[0].scriptPubKey = GetScriptForDestination(key.GetPubKey().GetID());
+        const PrecomputedTransactionData txdata(tx, {txPrev.vout[0]});
+        SignSignature(keystore, txPrev, tx, txdata, 0, SIGHASH_ALL, consensusBranchId);
+
+        AddOrphanTx(tx, i);
+    }
+
+    // This really-big orphan should be ignored:
+    for (int i = 0; i < 10; i++)
+    {
+        CTransaction txPrev = RandomOrphan();
+
+        CMutableTransaction tx;
+        tx.vout.resize(1);
+        tx.vout[0].nValue = 1*CENT;
+        tx.vout[0].scriptPubKey = GetScriptForDestination(key.GetPubKey().GetID());
+        tx.vin.resize(500);
+        for (unsigned int j = 0; j < tx.vin.size(); j++)
+        {
+            tx.vin[j].prevout.n = j;
+            tx.vin[j].prevout.hash = txPrev.GetHash();
+        }
+        // Fake the coins being spent (the random orphan doesn't actually have them all).
+        std::vector<CTxOut> allPrevOutputs;
+        allPrevOutputs.resize(tx.vin.size(), txPrev.vout[0]);
+        const PrecomputedTransactionData txdata(tx, allPrevOutputs);
+        SignSignature(keystore, txPrev, tx, txdata, 0, SIGHASH_ALL, consensusBranchId);
+        // Re-use same signature for other inputs
+        // (they don't have to be valid for this test)
+        for (unsigned int j = 1; j < tx.vin.size(); j++)
+            tx.vin[j].scriptSig = tx.vin[0].scriptSig;
+
+        BOOST_CHECK(!AddOrphanTx(tx, i));
+    }
+
+    // Test EraseOrphansFor:
+    for (NodeId i = 0; i < 3; i++)
+    {
+        size_t sizeBefore = mapOrphanTransactions.size();
+        EraseOrphansFor(i);
+        BOOST_CHECK(mapOrphanTransactions.size() < sizeBefore);
+    }
+
+    // Test LimitOrphanTxSize() function:
+    LimitOrphanTxSize(40);
+    BOOST_CHECK(mapOrphanTransactions.size() <= 40);
+    LimitOrphanTxSize(10);
+    BOOST_CHECK(mapOrphanTransactions.size() <= 10);
+    LimitOrphanTxSize(0);
+    BOOST_CHECK(mapOrphanTransactions.empty());
+    BOOST_CHECK(mapOrphanTransactionsByPrev.empty());
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/Makefile b/depend/zcash/src/test/Makefile
new file mode 100644
index 000000000..87bf73fec
--- /dev/null
+++ b/depend/zcash/src/test/Makefile
@@ -0,0 +1,6 @@
+all:
+	$(MAKE) -C .. bitcoin_test
+clean:
+	$(MAKE) -C .. bitcoin_test_clean
+check:
+	$(MAKE) -C .. bitcoin_test_check
diff --git a/depend/zcash/src/test/README.md b/depend/zcash/src/test/README.md
new file mode 100644
index 000000000..70d42320a
--- /dev/null
+++ b/depend/zcash/src/test/README.md
@@ -0,0 +1,43 @@
+# Notes
+The sources in this directory are unit test cases.  Boost includes a
+unit testing framework, and since bitcoin already uses boost, it makes
+sense to simply use this framework rather than require developers to
+configure some other framework (we want as few impediments to creating
+unit tests as possible).
+
+The build system is setup to compile an executable called "test_bitcoin"
+that runs all of the unit tests.  The main source file is called
+test_bitcoin.cpp, which simply includes other files that contain the
+actual unit tests (outside of a couple required preprocessor
+directives).  The pattern is to create one test file for each class or
+source file for which you want to create unit tests.  The file naming
+convention is "<source_filename>_tests.cpp" and such files should wrap
+their tests in a test suite called "<source_filename>_tests".  For an
+examples of this pattern, examine uint160_tests.cpp and
+uint256_tests.cpp.
+
+Add the source files to /src/Makefile.test.include to add them to the build.
+
+For further reading, I found the following website to be helpful in
+explaining how the boost unit test framework works:
+[https://web.archive.org/web/20160304091452/http://www.alittlemadness.com/2009/03/31/c-unit-testing-with-boosttest/](https://web.archive.org/web/20160304091452/http://www.alittlemadness.com/2009/03/31/c-unit-testing-with-boosttest/).
+
+test_bitcoin has some built-in command-line arguments; for
+example, to run just the getarg_tests verbosely:
+
+    test_bitcoin --log_level=all --run_test=getarg_tests
+
+... or to run just the doubledash test:
+
+    test_bitcoin --run_test=getarg_tests/doubledash
+
+Run  test_bitcoin --help   for the full list.
+
+### bitcoin-util-test.py
+
+The test directory also contains the bitcoin-util-test.py tool, which tests bitcoin utils (currently just bitcoin-tx). This test gets run automatically during the `make check` build process. It is also possible to run the test manually from the src directory:
+
+```
+test/bitcoin-util-test.py --srcdir=[current directory]
+
+```
\ No newline at end of file
diff --git a/depend/zcash/src/test/addrman_tests.cpp b/depend/zcash/src/test/addrman_tests.cpp
new file mode 100644
index 000000000..711cd018b
--- /dev/null
+++ b/depend/zcash/src/test/addrman_tests.cpp
@@ -0,0 +1,522 @@
+// Copyright (c) 2012-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+#include "addrman.h"
+#include "test/test_bitcoin.h"
+#include <string>
+#include <boost/test/unit_test.hpp>
+
+#include "hash.h"
+#include "random.h"
+
+using namespace std;
+
+class CAddrManTest : public CAddrMan
+{
+    uint64_t state;
+
+public:
+    CAddrManTest()
+    {
+        state = 1;
+    }
+
+    //! Ensure that bucket placement is always the same for testing purposes.
+    void MakeDeterministic()
+    {
+        nKey.SetNull();
+        insecure_rand = FastRandomContext(true);
+    }
+
+    int RandomInt(int nMax)
+    {
+        state = (CHashWriter(SER_GETHASH, 0) << state).GetHash().GetCheapHash();
+        return (unsigned int)(state % nMax);
+    }
+
+    CAddrInfo* Find(const CNetAddr& addr, int* pnId = NULL)
+    {
+        return CAddrMan::Find(addr, pnId);
+    }
+
+    CAddrInfo* Create(const CAddress& addr, const CNetAddr& addrSource, int* pnId = NULL)
+    {
+        return CAddrMan::Create(addr, addrSource, pnId);
+    }
+
+    void Delete(int nId)
+    {
+        CAddrMan::Delete(nId);
+    }
+};
+
+BOOST_FIXTURE_TEST_SUITE(addrman_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(addrman_simple)
+{
+    CAddrManTest addrman;
+
+    // Set addrman addr placement to be deterministic.
+    addrman.MakeDeterministic();
+
+    CNetAddr source = CNetAddr("252.2.2.2");
+
+    // Test 1: Does Addrman respond correctly when empty.
+    BOOST_CHECK(addrman.size() == 0);
+    CAddrInfo addr_null = addrman.Select();
+    BOOST_CHECK(addr_null.ToString() == "[::]:0");
+
+    // Test 2: Does Addrman::Add work as expected.
+    CService addr1 = CService("250.1.1.1", 8333);
+    addrman.Add(CAddress(addr1), source);
+    BOOST_CHECK(addrman.size() == 1);
+    CAddrInfo addr_ret1 = addrman.Select();
+    BOOST_CHECK(addr_ret1.ToString() == "250.1.1.1:8333");
+
+    // Test 3: Does IP address deduplication work correctly.
+    //  Expected dup IP should not be added.
+    CService addr1_dup = CService("250.1.1.1", 8333);
+    addrman.Add(CAddress(addr1_dup), source);
+    BOOST_CHECK(addrman.size() == 1);
+
+
+    // Test 5: New table has one addr and we add a diff addr we should
+    //  have two addrs.
+    CService addr2 = CService("250.1.1.2", 8333);
+    addrman.Add(CAddress(addr2), source);
+    BOOST_CHECK(addrman.size() == 2);
+
+    // Test 6: AddrMan::Clear() should empty the new table.
+    addrman.Clear();
+    BOOST_CHECK(addrman.size() == 0);
+    CAddrInfo addr_null2 = addrman.Select();
+    BOOST_CHECK(addr_null2.ToString() == "[::]:0");
+}
+
+BOOST_AUTO_TEST_CASE(addrman_ports)
+{
+    CAddrManTest addrman;
+
+    // Set addrman addr placement to be deterministic.
+    addrman.MakeDeterministic();
+
+    CNetAddr source = CNetAddr("252.2.2.2");
+
+    BOOST_CHECK(addrman.size() == 0);
+
+    // Test 7; Addr with same IP but diff port does not replace existing addr.
+    CService addr1 = CService("250.1.1.1", 8333);
+    addrman.Add(CAddress(addr1), source);
+    BOOST_CHECK(addrman.size() == 1);
+
+    CService addr1_port = CService("250.1.1.1", 8334);
+    addrman.Add(CAddress(addr1_port), source);
+    BOOST_CHECK(addrman.size() == 1);
+    CAddrInfo addr_ret2 = addrman.Select();
+    BOOST_CHECK(addr_ret2.ToString() == "250.1.1.1:8333");
+
+    // Test 8: Add same IP but diff port to tried table, it doesn't get added.
+    //  Perhaps this is not ideal behavior but it is the current behavior.
+    addrman.Good(CAddress(addr1_port));
+    BOOST_CHECK(addrman.size() == 1);
+    bool newOnly = true;
+    CAddrInfo addr_ret3 = addrman.Select(newOnly);
+    BOOST_CHECK(addr_ret3.ToString() == "250.1.1.1:8333");
+}
+
+
+BOOST_AUTO_TEST_CASE(addrman_select)
+{
+    CAddrManTest addrman;
+
+    // Set addrman addr placement to be deterministic.
+    addrman.MakeDeterministic();
+
+    CNetAddr source = CNetAddr("252.2.2.2");
+
+    // Test 9: Select from new with 1 addr in new.
+    CService addr1 = CService("250.1.1.1", 8333);
+    addrman.Add(CAddress(addr1), source);
+    BOOST_CHECK(addrman.size() == 1);
+
+    bool newOnly = true;
+    CAddrInfo addr_ret1 = addrman.Select(newOnly);
+    BOOST_CHECK(addr_ret1.ToString() == "250.1.1.1:8333");
+
+    // Test 10: move addr to tried, select from new expected nothing returned.
+    addrman.Good(CAddress(addr1));
+    BOOST_CHECK(addrman.size() == 1);
+    CAddrInfo addr_ret2 = addrman.Select(newOnly);
+    BOOST_CHECK(addr_ret2.ToString() == "[::]:0");
+
+    CAddrInfo addr_ret3 = addrman.Select();
+    BOOST_CHECK(addr_ret3.ToString() == "250.1.1.1:8333");
+
+    BOOST_CHECK(addrman.size() == 1);
+
+
+    // Add three addresses to new table.
+    CService addr2 = CService("250.3.1.1", 8333);
+    CService addr3 = CService("250.3.2.2", 9999);
+    CService addr4 = CService("250.3.3.3", 9999);
+
+    addrman.Add(CAddress(addr2), CService("250.3.1.1", 8333));
+    addrman.Add(CAddress(addr3), CService("250.3.1.1", 8333));
+    addrman.Add(CAddress(addr4), CService("250.4.1.1", 8333));
+
+    // Add three addresses to tried table.
+    CService addr5 = CService("250.4.4.4", 8333);
+    CService addr6 = CService("250.4.5.5", 7777);
+    CService addr7 = CService("250.4.6.6", 8333);
+
+    addrman.Add(CAddress(addr5), CService("250.3.1.1", 8333));
+    addrman.Good(CAddress(addr5));
+    addrman.Add(CAddress(addr6), CService("250.3.1.1", 8333));
+    addrman.Good(CAddress(addr6));
+    addrman.Add(CAddress(addr7), CService("250.1.1.3", 8333));
+    addrman.Good(CAddress(addr7));
+
+    // Test 11: 6 addrs + 1 addr from last test = 7.
+    BOOST_CHECK(addrman.size() == 7);
+
+    // Test 12: Select pulls from new and tried regardless of port number.
+    std::set<uint16_t> ports;
+    for (int i = 0; i < 20; ++i) {
+        ports.insert(addrman.Select().GetPort());
+    }
+    BOOST_CHECK_EQUAL(ports.size(), 3);
+}
+
+BOOST_AUTO_TEST_CASE(addrman_new_collisions)
+{
+    CAddrManTest addrman;
+
+    // Set addrman addr placement to be deterministic.
+    addrman.MakeDeterministic();
+
+    CNetAddr source = CNetAddr("252.2.2.2");
+
+    BOOST_CHECK(addrman.size() == 0);
+
+    for (unsigned int i = 1; i < 18; i++) {
+        CService addr = CService("250.1.1." + boost::to_string(i));
+        addrman.Add(CAddress(addr), source);
+
+        //Test 13: No collision in new table yet.
+        BOOST_CHECK(addrman.size() == i);
+    }
+
+    //Test 14: new table collision!
+    CService addr1 = CService("250.1.1.18");
+    addrman.Add(CAddress(addr1), source);
+    BOOST_CHECK(addrman.size() == 17);
+
+    CService addr2 = CService("250.1.1.19");
+    addrman.Add(CAddress(addr2), source);
+    BOOST_CHECK(addrman.size() == 18);
+}
+
+BOOST_AUTO_TEST_CASE(addrman_tried_collisions)
+{
+    CAddrManTest addrman;
+
+    // Set addrman addr placement to be deterministic.
+    addrman.MakeDeterministic();
+
+    CNetAddr source = CNetAddr("252.2.2.2");
+
+    BOOST_CHECK(addrman.size() == 0);
+
+    for (unsigned int i = 1; i < 80; i++) {
+        CService addr = CService("250.1.1." + boost::to_string(i));
+        addrman.Add(CAddress(addr), source);
+        addrman.Good(CAddress(addr));
+
+        //Test 15: No collision in tried table yet.
+        BOOST_TEST_MESSAGE(addrman.size());
+        BOOST_CHECK(addrman.size() == i);
+    }
+
+    //Test 16: tried table collision!
+    CService addr1 = CService("250.1.1.80");
+    addrman.Add(CAddress(addr1), source);
+    BOOST_CHECK(addrman.size() == 79);
+
+    CService addr2 = CService("250.1.1.81");
+    addrman.Add(CAddress(addr2), source);
+    BOOST_CHECK(addrman.size() == 80);
+}
+
+BOOST_AUTO_TEST_CASE(addrman_find)
+{
+    CAddrManTest addrman;
+
+    // Set addrman addr placement to be deterministic.
+    addrman.MakeDeterministic();
+
+    BOOST_CHECK(addrman.size() == 0);
+
+    CAddress addr1 = CAddress(CService("250.1.2.1", 8333));
+    CAddress addr2 = CAddress(CService("250.1.2.1", 9999));
+    CAddress addr3 = CAddress(CService("251.255.2.1", 8333));
+
+    CNetAddr source1 = CNetAddr("250.1.2.1");
+    CNetAddr source2 = CNetAddr("250.1.2.2");
+
+    addrman.Add(addr1, source1);
+    addrman.Add(addr2, source2);
+    addrman.Add(addr3, source1);
+
+    // Test 17: ensure Find returns an IP matching what we searched on.
+    CAddrInfo* info1 = addrman.Find(addr1);
+    BOOST_CHECK(info1);
+    if (info1)
+        BOOST_CHECK(info1->ToString() == "250.1.2.1:8333");
+
+    // Test 18; Find does not discriminate by port number.
+    CAddrInfo* info2 = addrman.Find(addr2);
+    BOOST_CHECK(info2);
+    if (info2)
+        BOOST_CHECK(info2->ToString() == info1->ToString());
+
+    // Test 19: Find returns another IP matching what we searched on.
+    CAddrInfo* info3 = addrman.Find(addr3);
+    BOOST_CHECK(info3);
+    if (info3)
+        BOOST_CHECK(info3->ToString() == "251.255.2.1:8333");
+}
+
+BOOST_AUTO_TEST_CASE(addrman_create)
+{
+    CAddrManTest addrman;
+
+    // Set addrman addr placement to be deterministic.
+    addrman.MakeDeterministic();
+
+    BOOST_CHECK(addrman.size() == 0);
+
+    CAddress addr1 = CAddress(CService("250.1.2.1", 8333));
+    CNetAddr source1 = CNetAddr("250.1.2.1");
+
+    int nId;
+    CAddrInfo* pinfo = addrman.Create(addr1, source1, &nId);
+
+    // Test 20: The result should be the same as the input addr.
+    BOOST_CHECK(pinfo->ToString() == "250.1.2.1:8333");
+
+    CAddrInfo* info2 = addrman.Find(addr1);
+    BOOST_CHECK(info2->ToString() == "250.1.2.1:8333");
+}
+
+
+BOOST_AUTO_TEST_CASE(addrman_delete)
+{
+    CAddrManTest addrman;
+
+    // Set addrman addr placement to be deterministic.
+    addrman.MakeDeterministic();
+
+    BOOST_CHECK(addrman.size() == 0);
+
+    CAddress addr1 = CAddress(CService("250.1.2.1", 8333));
+    CNetAddr source1 = CNetAddr("250.1.2.1");
+
+    int nId;
+    addrman.Create(addr1, source1, &nId);
+
+    // Test 21: Delete should actually delete the addr.
+    BOOST_CHECK(addrman.size() == 1);
+    addrman.Delete(nId);
+    BOOST_CHECK(addrman.size() == 0);
+    CAddrInfo* info2 = addrman.Find(addr1);
+    BOOST_CHECK(info2 == NULL);
+}
+
+BOOST_AUTO_TEST_CASE(addrman_getaddr)
+{
+    CAddrManTest addrman;
+
+    // Set addrman addr placement to be deterministic.
+    addrman.MakeDeterministic();
+
+    // Test 22: Sanity check, GetAddr should never return anything if addrman
+    //  is empty.
+    BOOST_CHECK(addrman.size() == 0);
+    vector<CAddress> vAddr1 = addrman.GetAddr();
+    BOOST_CHECK(vAddr1.size() == 0);
+
+    CAddress addr1 = CAddress(CService("250.250.2.1", 8333));
+    addr1.nTime = GetTime(); // Set time so isTerrible = false
+    CAddress addr2 = CAddress(CService("250.251.2.2", 9999));
+    addr2.nTime = GetTime();
+    CAddress addr3 = CAddress(CService("251.252.2.3", 8333));
+    addr3.nTime = GetTime();
+    CAddress addr4 = CAddress(CService("252.253.3.4", 8333));
+    addr4.nTime = GetTime();
+    CAddress addr5 = CAddress(CService("252.254.4.5", 8333));
+    addr5.nTime = GetTime();
+    CNetAddr source1 = CNetAddr("250.1.2.1");
+    CNetAddr source2 = CNetAddr("250.2.3.3");
+
+    // Test 23: Ensure GetAddr works with new addresses.
+    addrman.Add(addr1, source1);
+    addrman.Add(addr2, source2);
+    addrman.Add(addr3, source1);
+    addrman.Add(addr4, source2);
+    addrman.Add(addr5, source1);
+
+    // GetAddr returns 23% of addresses, 23% of 5 is 1 rounded down.
+    BOOST_CHECK(addrman.GetAddr().size() == 1); 
+
+    // Test 24: Ensure GetAddr works with new and tried addresses.
+    addrman.Good(CAddress(addr1));
+    addrman.Good(CAddress(addr2));
+    BOOST_CHECK(addrman.GetAddr().size() == 1);
+
+    // Test 25: Ensure GetAddr still returns 23% when addrman has many addrs.
+    for (unsigned int i = 1; i < (8 * 256); i++) {
+        int octet1 = i % 256;
+        int octet2 = (i / 256) % 256;
+        int octet3 = (i / (256 * 2)) % 256;
+        string strAddr = boost::to_string(octet1) + "." + boost::to_string(octet2) + "." + boost::to_string(octet3) + ".23";
+        CAddress addr = CAddress(CService(strAddr));
+        
+        // Ensure that for all addrs in addrman, isTerrible == false.
+        addr.nTime = GetTime();
+        addrman.Add(addr, CNetAddr(strAddr));
+        if (i % 8 == 0)
+            addrman.Good(addr);
+    }
+    vector<CAddress> vAddr = addrman.GetAddr();
+
+    size_t percent23 = (addrman.size() * 23) / 100;
+    BOOST_CHECK(vAddr.size() == percent23);
+    BOOST_CHECK(vAddr.size() == 461);
+    // (Addrman.size() < number of addresses added) due to address collisions.
+    BOOST_CHECK(addrman.size() == 2007);
+}
+
+
+BOOST_AUTO_TEST_CASE(caddrinfo_get_tried_bucket)
+{
+    CAddrManTest addrman;
+
+    // Set addrman addr placement to be deterministic.
+    addrman.MakeDeterministic();
+
+    CAddress addr1 = CAddress(CService("250.1.1.1", 8333));
+    CAddress addr2 = CAddress(CService("250.1.1.1", 9999));
+
+    CNetAddr source1 = CNetAddr("250.1.1.1");
+
+
+    CAddrInfo info1 = CAddrInfo(addr1, source1);
+
+    uint256 nKey1 = (uint256)(CHashWriter(SER_GETHASH, 0) << 1).GetHash();
+    uint256 nKey2 = (uint256)(CHashWriter(SER_GETHASH, 0) << 2).GetHash();
+
+
+    BOOST_CHECK(info1.GetTriedBucket(nKey1) == 40);
+
+    // Test 26: Make sure key actually randomizes bucket placement. A fail on
+    //  this test could be a security issue.
+    BOOST_CHECK(info1.GetTriedBucket(nKey1) != info1.GetTriedBucket(nKey2));
+
+    // Test 27: Two addresses with same IP but different ports can map to
+    //  different buckets because they have different keys.
+    CAddrInfo info2 = CAddrInfo(addr2, source1);
+
+    BOOST_CHECK(info1.GetKey() != info2.GetKey());
+    BOOST_CHECK(info1.GetTriedBucket(nKey1) != info2.GetTriedBucket(nKey1));
+
+    set<int> buckets;
+    for (int i = 0; i < 255; i++) {
+        CAddrInfo infoi = CAddrInfo(
+            CAddress(CService("250.1.1." + boost::to_string(i))),
+            CNetAddr("250.1.1." + boost::to_string(i)));
+        int bucket = infoi.GetTriedBucket(nKey1);
+        buckets.insert(bucket);
+    }
+    // Test 28: IP addresses in the same group (\16 prefix for IPv4) should
+    //  never get more than 8 buckets
+    BOOST_CHECK(buckets.size() == 8);
+
+    buckets.clear();
+    for (int j = 0; j < 255; j++) {
+        CAddrInfo infoj = CAddrInfo(
+            CAddress(CService("250." + boost::to_string(j) + ".1.1")),
+            CNetAddr("250." + boost::to_string(j) + ".1.1"));
+        int bucket = infoj.GetTriedBucket(nKey1);
+        buckets.insert(bucket);
+    }
+    // Test 29: IP addresses in the different groups should map to more than
+    //  8 buckets.
+    BOOST_CHECK(buckets.size() == 160);
+}
+
+BOOST_AUTO_TEST_CASE(caddrinfo_get_new_bucket)
+{
+    CAddrManTest addrman;
+
+    // Set addrman addr placement to be deterministic.
+    addrman.MakeDeterministic();
+
+    CAddress addr1 = CAddress(CService("250.1.2.1", 8333));
+    CAddress addr2 = CAddress(CService("250.1.2.1", 9999));
+
+    CNetAddr source1 = CNetAddr("250.1.2.1");
+
+    CAddrInfo info1 = CAddrInfo(addr1, source1);
+
+    uint256 nKey1 = (uint256)(CHashWriter(SER_GETHASH, 0) << 1).GetHash();
+    uint256 nKey2 = (uint256)(CHashWriter(SER_GETHASH, 0) << 2).GetHash();
+
+    BOOST_CHECK(info1.GetNewBucket(nKey1) == 786);
+
+    // Test 30: Make sure key actually randomizes bucket placement. A fail on
+    //  this test could be a security issue.
+    BOOST_CHECK(info1.GetNewBucket(nKey1) != info1.GetNewBucket(nKey2));
+
+    // Test 31: Ports should not affect bucket placement in the addr
+    CAddrInfo info2 = CAddrInfo(addr2, source1);
+    BOOST_CHECK(info1.GetKey() != info2.GetKey());
+    BOOST_CHECK(info1.GetNewBucket(nKey1) == info2.GetNewBucket(nKey1));
+
+    set<int> buckets;
+    for (int i = 0; i < 255; i++) {
+        CAddrInfo infoi = CAddrInfo(
+            CAddress(CService("250.1.1." + boost::to_string(i))),
+            CNetAddr("250.1.1." + boost::to_string(i)));
+        int bucket = infoi.GetNewBucket(nKey1);
+        buckets.insert(bucket);
+    }
+    // Test 32: IP addresses in the same group (\16 prefix for IPv4) should
+    //  always map to the same bucket.
+    BOOST_CHECK(buckets.size() == 1);
+
+    buckets.clear();
+    for (int j = 0; j < 4 * 255; j++) {
+        CAddrInfo infoj = CAddrInfo(CAddress(
+                                        CService(
+                                            boost::to_string(250 + (j / 255)) + "." + boost::to_string(j % 256) + ".1.1")),
+            CNetAddr("251.4.1.1"));
+        int bucket = infoj.GetNewBucket(nKey1);
+        buckets.insert(bucket);
+    }
+    // Test 33: IP addresses in the same source groups should map to no more
+    //  than 64 buckets.
+    BOOST_CHECK(buckets.size() <= 64);
+
+    buckets.clear();
+    for (int p = 0; p < 255; p++) {
+        CAddrInfo infoj = CAddrInfo(
+            CAddress(CService("250.1.1.1")),
+            CNetAddr("250." + boost::to_string(p) + ".1.1"));
+        int bucket = infoj.GetNewBucket(nKey1);
+        buckets.insert(bucket);
+    }
+    // Test 34: IP addresses in the different source groups should map to more
+    //  than 64 buckets.
+    BOOST_CHECK(buckets.size() > 64);
+}
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/alert_tests.cpp b/depend/zcash/src/test/alert_tests.cpp
new file mode 100644
index 000000000..029825628
--- /dev/null
+++ b/depend/zcash/src/test/alert_tests.cpp
@@ -0,0 +1,412 @@
+// Copyright (c) 2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+//
+// Unit tests for alert system
+//
+
+#include "alert.h"
+#include "chain.h"
+#include "chainparams.h"
+#include "clientversion.h"
+#include "fs.h"
+#include "test/data/alertTests.raw.h"
+
+#include "rpc/protocol.h"
+#include "rpc/server.h"
+#include "serialize.h"
+#include "streams.h"
+#include "utilstrencodings.h"
+#include "utiltest.h"
+#include "warnings.h"
+
+#include "test/test_bitcoin.h"
+
+#include <fstream>
+
+#include <boost/test/unit_test.hpp>
+
+#include "key.h"
+#include "alertkeys.h"
+#include <iostream>
+
+/*
+ * If the alert key pairs have changed, the test suite will fail as the
+ * test data is now invalid.  To create valid test data, signed with a
+ * new alert private key, follow these steps:
+ *
+ * 1. Copy your private key into alertkeys.h.  Don't commit this file!
+ *    See sendalert.cpp for more info.
+ *
+ * 2. Set the GENERATE_ALERTS_FLAG to true.
+ *
+ * 3. Build and run:
+ *    test_bitcoin -t Generate_Alert_Test_Data
+ *
+ * 4. Test data is saved in your current directory as alertTests.raw.NEW
+ *    Copy this file to: src/test/data/alertTests.raw
+ *
+ *    For debugging purposes, terminal output can be copied into:
+ *    src/test/data/alertTests.raw.h
+ *
+ * 5. Clean up...
+ *    - Set GENERATE_ALERTS_FLAG back to false.
+ *    - Remove your private key from alertkeys.h
+ *
+ * 6. Build and verify the new test data:
+ *    test_bitcoin -t Alert_tests
+ *
+ */
+#define GENERATE_ALERTS_FLAG false
+
+#if GENERATE_ALERTS_FLAG
+
+// NOTE:
+// A function SignAndSave() was used by Bitcoin Core to create alert test data
+// but it has not been made publicly available.  So instead, we have adapted
+// some publicly available code which achieves the intended result:
+// https://gist.github.com/lukem512/9b272bd35e2cdefbf386
+
+
+// Code to output a C-style array of values
+template<typename T>
+std::string HexStrArray(const T itbegin, const T itend, int lineLength)
+{
+    std::string rv;
+    static const char hexmap[16] = { '0', '1', '2', '3', '4', '5', '6', '7',
+                                     '8', '9', 'a', 'b', 'c', 'd', 'e', 'f' };
+    rv.reserve((itend-itbegin)*3);
+    int i = 0;
+    for(T it = itbegin; it < itend; ++it)
+    {
+        unsigned char val = (unsigned char)(*it);
+        if(it != itbegin)
+        {
+            if (i % lineLength == 0)
+                rv.push_back('\n');
+            else
+                rv.push_back(' ');
+        }
+        rv.push_back('0');
+        rv.push_back('x');
+        rv.push_back(hexmap[val>>4]);
+        rv.push_back(hexmap[val&15]);
+        rv.push_back(',');
+        i++;
+    }
+
+    return rv;
+}
+
+template<typename T>
+inline std::string HexStrArray(const T& vch, int lineLength)
+{
+    return HexStrArray(vch.begin(), vch.end(), lineLength);
+}
+
+
+// Sign CAlert with alert private key
+bool SignAlert(CAlert &alert)
+{
+    // serialize alert data
+    CDataStream sMsg(SER_NETWORK, PROTOCOL_VERSION);
+    sMsg << *(CUnsignedAlert*)&alert;
+    alert.vchMsg = std::vector<unsigned char>(sMsg.begin(), sMsg.end());
+
+    // sign alert
+    std::vector<unsigned char> vchTmp(ParseHex(pszPrivKey));
+    CPrivKey vchPrivKey(vchTmp.begin(), vchTmp.end());
+    std::optional<CKey> key = CKey::FromPrivKey(vchPrivKey, false);
+    if (!key.has_value()) {
+        printf("key.SetPrivKey failed\n");
+        return false;
+    }
+    if (!key.value().Sign(Hash(alert.vchMsg.begin(), alert.vchMsg.end()), alert.vchSig))
+    {
+        printf("SignAlert() : key.Sign failed\n");
+        return false;
+    }
+    return true;
+}
+
+// Sign a CAlert and serialize it
+bool SignAndSerialize(CAlert &alert, CDataStream &buffer)
+{
+    // Sign
+    if(!SignAlert(alert))
+    {
+        printf("SignAndSerialize() : could not sign alert\n");
+        return false;
+    }
+    // ...and save!
+    buffer << alert;
+    return true;
+}
+
+void GenerateAlertTests()
+{
+    CDataStream sBuffer(SER_DISK, CLIENT_VERSION);
+
+    CAlert alert;
+    alert.nRelayUntil   = 60;
+    alert.nExpiration   = 24 * 60 * 60;
+    alert.nID           = 1;
+    alert.nCancel       = 0;  // cancels previous messages up to this ID number
+    alert.nMinVer       = 0;  // These versions are protocol versions
+    alert.nMaxVer       = 999001;
+    alert.nPriority     = 1;
+    alert.strComment    = "Alert comment";
+    alert.strStatusBar  = "Alert 1";
+
+    // Replace SignAndSave with SignAndSerialize
+    SignAndSerialize(alert, sBuffer);
+
+    // More tests go here ...
+    alert.setSubVer.insert(std::string("/MagicBean:0.1.0/"));
+    alert.strStatusBar  = "Alert 1 for MagicBean 0.1.0";
+    SignAndSerialize(alert, sBuffer);
+
+    alert.setSubVer.insert(std::string("/MagicBean:0.2.0/"));
+    alert.strStatusBar  = "Alert 1 for MagicBean 0.1.0, 0.2.0";
+    SignAndSerialize(alert, sBuffer);
+
+    alert.setSubVer.insert(std::string("/MagicBean:0.2.1(foo)/"));
+    alert.strStatusBar  = "Alert 1 for MagicBean 0.1.0, 0.2.0, 0.2.1(foo)";
+    SignAndSerialize(alert, sBuffer);
+
+    alert.setSubVer.insert(std::string("/MagicBean:0.2.1/"));
+    alert.strStatusBar  = "Alert 1 for MagicBean 0.1.0, 0.2.0, 0.2.1(foo), 0.2.1";
+    SignAndSerialize(alert, sBuffer);
+
+    alert.setSubVer.clear();
+    ++alert.nID;
+    alert.nCancel = 1;
+    alert.nPriority = 100;
+    alert.strStatusBar  = "Alert 2, cancels 1";
+    SignAndSerialize(alert, sBuffer);
+
+    alert.nExpiration += 60;
+    ++alert.nID;
+    SignAndSerialize(alert, sBuffer);
+
+    ++alert.nID;
+    alert.nPriority = 5000;
+    alert.strStatusBar  = "Alert 3, disables RPC";
+    alert.strRPCError = "RPC disabled";
+    SignAndSerialize(alert, sBuffer);
+
+    ++alert.nID;
+    alert.nPriority = 5000;
+    alert.strStatusBar  = "Alert 4, re-enables RPC";
+    alert.strRPCError = "";
+    SignAndSerialize(alert, sBuffer);
+
+    ++alert.nID;
+    alert.nMinVer = 11;
+    alert.nMaxVer = 22;
+    alert.nPriority = 100;
+    SignAndSerialize(alert, sBuffer);
+
+    ++alert.nID;
+    alert.strStatusBar  = "Alert 2 for MagicBean 0.1.0";
+    alert.setSubVer.insert(std::string("/MagicBean:0.1.0/"));
+    SignAndSerialize(alert, sBuffer);
+
+    ++alert.nID;
+    alert.nMinVer = 0;
+    alert.nMaxVer = 999999;
+    alert.strStatusBar  = "Evil Alert'; /bin/ls; echo '";
+    alert.setSubVer.clear();
+    bool b = SignAndSerialize(alert, sBuffer);
+
+    if (b) {
+        // Print the hex array, which will become the contents of alertTest.raw.h
+        std::vector<unsigned char> vch = std::vector<unsigned char>(sBuffer.begin(), sBuffer.end());
+        printf("%s\n", HexStrArray(vch, 8).c_str());
+
+        // Write the data to alertTests.raw.NEW, to be copied to src/test/data/alertTests.raw
+        std::ofstream outfile("alertTests.raw.NEW", std::ios::out | std::ios::binary);
+        outfile.write((const char*)&vch[0], vch.size());
+        outfile.close();
+    }
+}
+
+
+
+struct GenerateAlertTestsFixture : public TestingSetup {
+  GenerateAlertTestsFixture() {}
+  ~GenerateAlertTestsFixture() {}
+};
+
+BOOST_FIXTURE_TEST_SUITE(Generate_Alert_Test_Data, GenerateAlertTestsFixture); // DISABLED_TEST_SUITE
+BOOST_AUTO_TEST_CASE(GenerateTheAlertTests)
+{
+    GenerateAlertTests();
+}
+BOOST_AUTO_TEST_SUITE_END()
+
+
+#else
+
+
+struct ReadAlerts : public TestingSetup
+{
+    ReadAlerts()
+    {
+        std::vector<unsigned char> vch(alert_tests::alertTests, alert_tests::alertTests + sizeof(alert_tests::alertTests));
+        CDataStream stream(vch, SER_DISK, CLIENT_VERSION);
+        try {
+            while (!stream.eof())
+            {
+                CAlert alert;
+                stream >> alert;
+                alerts.push_back(alert);
+            }
+        }
+        catch (const std::exception&) { }
+    }
+    ~ReadAlerts() { }
+
+    static std::vector<std::string> read_lines(fs::path filepath)
+    {
+        std::vector<std::string> result;
+
+        std::ifstream f(filepath.string().c_str());
+        std::string line;
+        while (std::getline(f,line))
+            result.push_back(line);
+
+        return result;
+    }
+
+    std::vector<CAlert> alerts;
+};
+
+BOOST_FIXTURE_TEST_SUITE(Alert_tests, ReadAlerts)
+
+
+BOOST_AUTO_TEST_CASE(AlertApplies)
+{
+    SetMockTime(11);
+    const std::vector<unsigned char>& alertKey = Params(CBaseChainParams::MAIN).AlertKey();
+
+    for (const CAlert& alert : alerts)
+    {
+        BOOST_CHECK(alert.CheckSignature(alertKey));
+    }
+
+    BOOST_CHECK(alerts.size() >= 3);
+
+    // Matches:
+    BOOST_CHECK(alerts[0].AppliesTo(1, ""));
+    BOOST_CHECK(alerts[0].AppliesTo(999001, ""));
+    BOOST_CHECK(alerts[0].AppliesTo(1, "/MagicBean:11.11.11/"));
+
+    BOOST_CHECK(alerts[1].AppliesTo(1, "/MagicBean:0.1.0/"));
+    BOOST_CHECK(alerts[1].AppliesTo(999001, "/MagicBean:0.1.0/"));
+
+    BOOST_CHECK(alerts[2].AppliesTo(1, "/MagicBean:0.1.0/"));
+    BOOST_CHECK(alerts[2].AppliesTo(1, "/MagicBean:0.2.0/"));
+    BOOST_CHECK(alerts[2].AppliesTo(1, "/MagicBean:0.2.0(foo)/"));
+    BOOST_CHECK(alerts[2].AppliesTo(1, "/MagicBean:0.2.0(bar)/"));
+
+    BOOST_CHECK(alerts[3].AppliesTo(1, "/MagicBean:0.1.0/"));
+    BOOST_CHECK(alerts[3].AppliesTo(1, "/MagicBean:0.2.0/"));
+    BOOST_CHECK(alerts[2].AppliesTo(1, "/MagicBean:0.2.0(foo)/"));
+    BOOST_CHECK(alerts[3].AppliesTo(1, "/MagicBean:0.2.1(foo)/"));
+
+    BOOST_CHECK(alerts[4].AppliesTo(1, "/MagicBean:0.1.0/"));
+    BOOST_CHECK(alerts[4].AppliesTo(1, "/MagicBean:0.2.0/"));
+    BOOST_CHECK(alerts[4].AppliesTo(1, "/MagicBean:0.2.1(foo)/"));
+    BOOST_CHECK(alerts[4].AppliesTo(1, "/MagicBean:0.2.1/"));
+
+    // Don't match:
+    BOOST_CHECK(!alerts[0].AppliesTo(-1, ""));
+    BOOST_CHECK(!alerts[0].AppliesTo(999002, ""));
+
+    BOOST_CHECK(!alerts[1].AppliesTo(1, ""));
+    BOOST_CHECK(!alerts[1].AppliesTo(1, "MagicBean:0.1.0"));
+    BOOST_CHECK(!alerts[1].AppliesTo(1, "/MagicBean:0.1.0"));
+    BOOST_CHECK(!alerts[1].AppliesTo(1, "MagicBean:0.1.0/"));
+    BOOST_CHECK(!alerts[1].AppliesTo(-1, "/MagicBean:0.1.0/"));
+    BOOST_CHECK(!alerts[1].AppliesTo(999002, "/MagicBean:0.1.0/"));
+    BOOST_CHECK(!alerts[1].AppliesTo(1, "/MagicBean:0.1.0/FlowerPot:0.0.1/"));
+    BOOST_CHECK(!alerts[1].AppliesTo(1, "/MagicBean:0.2.0/"));
+
+    // SubVer with comment doesn't match SubVer pattern without
+    BOOST_CHECK(!alerts[2].AppliesTo(1, "/MagicBean:0.2.1/"));
+    BOOST_CHECK(!alerts[2].AppliesTo(1, "/MagicBean:0.3.0/"));
+
+    // SubVer without comment doesn't match SubVer pattern with
+    BOOST_CHECK(!alerts[3].AppliesTo(1, "/MagicBean:0.2.1/"));
+
+    SetMockTime(0);
+}
+
+
+BOOST_AUTO_TEST_CASE(AlertNotify)
+{
+    SetMockTime(11);
+    const std::vector<unsigned char>& alertKey = Params(CBaseChainParams::MAIN).AlertKey();
+
+    fs::path temp = fs::temp_directory_path() /
+        fs::unique_path("alertnotify-%%%%.txt");
+
+    mapArgs["-alertnotify"] = std::string("echo %s >> ") + temp.string();
+
+    for (CAlert alert : alerts)
+        alert.ProcessAlert(alertKey, false);
+
+    std::vector<std::string> r = read_lines(temp);
+    BOOST_CHECK_EQUAL(r.size(), 6u);
+
+// Windows built-in echo semantics are different than posixy shells. Quotes and
+// whitespace are printed literally.
+
+#ifndef WIN32
+    BOOST_CHECK_EQUAL(r[0], "Alert 1");
+    BOOST_CHECK_EQUAL(r[1], "Alert 2, cancels 1");
+    BOOST_CHECK_EQUAL(r[2], "Alert 2, cancels 1");
+    BOOST_CHECK_EQUAL(r[3], "Alert 3, disables RPC");
+    BOOST_CHECK_EQUAL(r[4], "Alert 4, reenables RPC"); // dashes should be removed
+    BOOST_CHECK_EQUAL(r[5], "Evil Alert; /bin/ls; echo "); // single-quotes should be removed
+#else
+    BOOST_CHECK_EQUAL(r[0], "'Alert 1' ");
+    BOOST_CHECK_EQUAL(r[1], "'Alert 2, cancels 1' ");
+    BOOST_CHECK_EQUAL(r[2], "'Alert 2, cancels 1' ");
+    BOOST_CHECK_EQUAL(r[3], "'Alert 3, disables RPC' ");
+    BOOST_CHECK_EQUAL(r[4], "'Alert 4, reenables RPC' "); // dashes should be removed
+    BOOST_CHECK_EQUAL(r[5], "'Evil Alert; /bin/ls; echo ' ");
+#endif
+    fs::remove(temp);
+
+    SetMockTime(0);
+    mapAlerts.clear();
+}
+
+BOOST_AUTO_TEST_CASE(AlertDisablesRPC)
+{
+    SetMockTime(11);
+    const std::vector<unsigned char>& alertKey = Params(CBaseChainParams::MAIN).AlertKey();
+
+    // Command should work before alerts
+    BOOST_CHECK_EQUAL(GetWarnings("rpc").first, "");
+
+    // First alert should disable RPC
+    alerts[7].ProcessAlert(alertKey, false);
+    BOOST_CHECK_EQUAL(alerts[7].strRPCError, "RPC disabled");
+    BOOST_CHECK_EQUAL(GetWarnings("rpc").first, "RPC disabled");
+
+    // Second alert should re-enable RPC
+    alerts[8].ProcessAlert(alertKey, false);
+    BOOST_CHECK_EQUAL(alerts[8].strRPCError, "");
+    BOOST_CHECK_EQUAL(GetWarnings("rpc").first, "");
+
+    SetMockTime(0);
+    mapAlerts.clear();
+}
+
+BOOST_AUTO_TEST_SUITE_END()
+
+#endif
diff --git a/depend/zcash/src/test/allocator_tests.cpp b/depend/zcash/src/test/allocator_tests.cpp
new file mode 100644
index 000000000..0099b32d1
--- /dev/null
+++ b/depend/zcash/src/test/allocator_tests.cpp
@@ -0,0 +1,228 @@
+// Copyright (c) 2012-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "util.h"
+
+#include "support/allocators/secure.h"
+#include "test/test_bitcoin.h"
+
+#include <boost/test/unit_test.hpp>
+
+BOOST_FIXTURE_TEST_SUITE(allocator_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(arena_tests)
+{
+    // Fake memory base address for testing
+    // without actually using memory.
+    void *synth_base = reinterpret_cast<void*>(0x08000000);
+    const size_t synth_size = 1024*1024;
+    Arena b(synth_base, synth_size, 16);
+    void *chunk = b.alloc(1000);
+#ifdef ARENA_DEBUG
+    b.walk();
+#endif
+    BOOST_CHECK(chunk != nullptr);
+    BOOST_CHECK(b.stats().used == 1008); // Aligned to 16
+    BOOST_CHECK(b.stats().total == synth_size); // Nothing has disappeared?
+    b.free(chunk);
+#ifdef ARENA_DEBUG
+    b.walk();
+#endif
+    BOOST_CHECK(b.stats().used == 0);
+    BOOST_CHECK(b.stats().free == synth_size);
+
+    void *a0 = b.alloc(128);
+    void *a1 = b.alloc(256);
+    void *a2 = b.alloc(512);
+    BOOST_CHECK(b.stats().used == 896);
+    BOOST_CHECK(b.stats().total == synth_size);
+#ifdef ARENA_DEBUG
+    b.walk();
+#endif
+    b.free(a0);
+#ifdef ARENA_DEBUG
+    b.walk();
+#endif
+    BOOST_CHECK(b.stats().used == 768);
+    b.free(a1);
+    BOOST_CHECK(b.stats().used == 512);
+    void *a3 = b.alloc(128);
+#ifdef ARENA_DEBUG
+    b.walk();
+#endif
+    BOOST_CHECK(b.stats().used == 640);
+    b.free(a2);
+    BOOST_CHECK(b.stats().used == 128);
+    b.free(a3);
+    BOOST_CHECK(b.stats().used == 0);
+    BOOST_CHECK_EQUAL(b.stats().chunks_used, 0);
+    BOOST_CHECK(b.stats().total == synth_size);
+    BOOST_CHECK(b.stats().free == synth_size);
+    BOOST_CHECK_EQUAL(b.stats().chunks_free, 1);
+
+    std::vector<void*> addr;
+    BOOST_CHECK(b.alloc(0) == nullptr); // allocating 0 always returns nullptr
+#ifdef ARENA_DEBUG
+    b.walk();
+#endif
+    // Sweeping allocate all memory
+    for (int x=0; x<1024; ++x)
+        addr.push_back(b.alloc(1024));
+    BOOST_CHECK(b.stats().free == 0);
+    BOOST_CHECK(b.alloc(1024) == nullptr); // memory is full, this must return nullptr
+    BOOST_CHECK(b.alloc(0) == nullptr);
+    for (int x=0; x<1024; ++x)
+        b.free(addr[x]);
+    addr.clear();
+    BOOST_CHECK(b.stats().total == synth_size);
+    BOOST_CHECK(b.stats().free == synth_size);
+
+    // Now in the other direction...
+    for (int x=0; x<1024; ++x)
+        addr.push_back(b.alloc(1024));
+    for (int x=0; x<1024; ++x)
+        b.free(addr[1023-x]);
+    addr.clear();
+
+    // Now allocate in smaller unequal chunks, then deallocate haphazardly
+    // Not all the chunks will succeed allocating, but freeing nullptr is
+    // allowed so that is no problem.
+    for (int x=0; x<2048; ++x)
+        addr.push_back(b.alloc(x+1));
+    for (int x=0; x<2048; ++x)
+        b.free(addr[((x*23)%2048)^242]);
+    addr.clear();
+
+    // Go entirely wild: free and alloc interleaved,
+    // generate targets and sizes using pseudo-randomness.
+    for (int x=0; x<2048; ++x)
+        addr.push_back(0);
+    uint32_t s = 0x12345678;
+    for (int x=0; x<5000; ++x) {
+        int idx = s & (addr.size()-1);
+        if (s & 0x80000000) {
+            b.free(addr[idx]);
+            addr[idx] = 0;
+        } else if(!addr[idx]) {
+            addr[idx] = b.alloc((s >> 16) & 2047);
+        }
+        bool lsb = s & 1;
+        s >>= 1;
+        if (lsb)
+            s ^= 0xf00f00f0; // LFSR period 0xf7ffffe1
+    }
+    for (void *ptr: addr)
+        b.free(ptr);
+    addr.clear();
+
+    BOOST_CHECK(b.stats().total == synth_size);
+    BOOST_CHECK(b.stats().free == synth_size);
+
+    // Check that Arena::free may be called on nullptr.
+    b.free(nullptr);
+}
+
+/** Mock LockedPageAllocator for testing */
+class TestLockedPageAllocator: public LockedPageAllocator
+{
+public:
+    TestLockedPageAllocator(int count_in, int lockedcount_in): count(count_in), lockedcount(lockedcount_in) {}
+    void* AllocateLocked(size_t len, bool *lockingSuccess)
+    {
+        *lockingSuccess = false;
+        if (count > 0) {
+            --count;
+
+            if (lockedcount > 0) {
+                --lockedcount;
+                *lockingSuccess = true;
+            }
+
+            return reinterpret_cast<void*>(0x08000000 + (count<<24)); // Fake address, do not actually use this memory
+        }
+        return 0;
+    }
+    void FreeLocked(void* addr, size_t len)
+    {
+    }
+    size_t GetLimit()
+    {
+        return std::numeric_limits<size_t>::max();
+    }
+private:
+    int count;
+    int lockedcount;
+};
+
+BOOST_AUTO_TEST_CASE(lockedpool_tests_mock)
+{
+    // Test over three virtual arenas, of which one will succeed being locked
+    std::unique_ptr<LockedPageAllocator> x(new TestLockedPageAllocator(3, 1));
+    LockedPool pool(std::move(x));
+    BOOST_CHECK(pool.stats().total == 0);
+    BOOST_CHECK(pool.stats().locked == 0);
+
+    // Ensure unreasonable requests are refused without allocating anything
+    void *invalid_toosmall = pool.alloc(0);
+    BOOST_CHECK(invalid_toosmall == nullptr);
+    BOOST_CHECK(pool.stats().used == 0);
+    BOOST_CHECK(pool.stats().free == 0);
+    void *invalid_toobig = pool.alloc(LockedPool::ARENA_SIZE+1);
+    BOOST_CHECK(invalid_toobig == nullptr);
+    BOOST_CHECK(pool.stats().used == 0);
+    BOOST_CHECK(pool.stats().free == 0);
+
+    void *a0 = pool.alloc(LockedPool::ARENA_SIZE / 2);
+    BOOST_CHECK(a0);
+    BOOST_CHECK(pool.stats().locked == LockedPool::ARENA_SIZE);
+    void *a1 = pool.alloc(LockedPool::ARENA_SIZE / 2);
+    BOOST_CHECK(a1);
+    void *a2 = pool.alloc(LockedPool::ARENA_SIZE / 2);
+    BOOST_CHECK(a2);
+    void *a3 = pool.alloc(LockedPool::ARENA_SIZE / 2);
+    BOOST_CHECK(a3);
+    void *a4 = pool.alloc(LockedPool::ARENA_SIZE / 2);
+    BOOST_CHECK(a4);
+    void *a5 = pool.alloc(LockedPool::ARENA_SIZE / 2);
+    BOOST_CHECK(a5);
+    // We've passed a count of three arenas, so this allocation should fail
+    void *a6 = pool.alloc(16);
+    BOOST_CHECK(!a6);
+
+    pool.free(a0);
+    pool.free(a2);
+    pool.free(a4);
+    pool.free(a1);
+    pool.free(a3);
+    pool.free(a5);
+    BOOST_CHECK(pool.stats().total == 3*LockedPool::ARENA_SIZE);
+    BOOST_CHECK(pool.stats().locked == LockedPool::ARENA_SIZE);
+    BOOST_CHECK(pool.stats().used == 0);
+}
+
+// These tests used the live LockedPoolManager object, this is also used
+// by other tests so the conditions are somewhat less controllable and thus the
+// tests are somewhat more error-prone.
+BOOST_AUTO_TEST_CASE(lockedpool_tests_live)
+{
+    LockedPoolManager &pool = LockedPoolManager::Instance();
+    LockedPool::Stats initial = pool.stats();
+
+    void *a0 = pool.alloc(16);
+    BOOST_CHECK(a0);
+    // Test reading and writing the allocated memory
+    *((uint32_t*)a0) = 0x1234;
+    BOOST_CHECK(*((uint32_t*)a0) == 0x1234);
+
+    pool.free(a0);
+    // If more than one new arena was allocated for the above tests, something is wrong
+    BOOST_CHECK(pool.stats().total <= (initial.total + LockedPool::ARENA_SIZE));
+    // Usage must be back to where it started
+    BOOST_CHECK(pool.stats().used == initial.used);
+
+    // Check that LockedPool::free may be called on nullptr.
+    pool.free(nullptr);
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/arith_uint256_tests.cpp b/depend/zcash/src/test/arith_uint256_tests.cpp
new file mode 100644
index 000000000..a1b7e2625
--- /dev/null
+++ b/depend/zcash/src/test/arith_uint256_tests.cpp
@@ -0,0 +1,567 @@
+// Copyright (c) 2011-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include <boost/test/unit_test.hpp>
+#include <stdint.h>
+#include <sstream>
+#include <iomanip>
+#include <limits>
+#include <cmath>
+#include "uint256.h"
+#include "arith_uint256.h"
+#include <string>
+#include "version.h"
+#include "test/test_bitcoin.h"
+
+BOOST_FIXTURE_TEST_SUITE(arith_uint256_tests, BasicTestingSetup)
+
+/// Convert vector to arith_uint256, via uint256 blob
+inline arith_uint256 arith_uint256V(const std::vector<unsigned char>& vch)
+{
+    return UintToArith256(uint256(vch));
+}
+
+const unsigned char R1Array[] =
+    "\x9c\x52\x4a\xdb\xcf\x56\x11\x12\x2b\x29\x12\x5e\x5d\x35\xd2\xd2"
+    "\x22\x81\xaa\xb5\x33\xf0\x08\x32\xd5\x56\xb1\xf9\xea\xe5\x1d\x7d";
+const char R1ArrayHex[] = "7D1DE5EAF9B156D53208F033B5AA8122D2d2355d5e12292b121156cfdb4a529c";
+const double R1Ldouble = 0.4887374590559308955; // R1L equals roughly R1Ldouble * 2^256
+const arith_uint256 R1L = arith_uint256V(std::vector<unsigned char>(R1Array,R1Array+32));
+const uint64_t R1LLow64 = 0x121156cfdb4a529cULL;
+
+const unsigned char R2Array[] =
+    "\x70\x32\x1d\x7c\x47\xa5\x6b\x40\x26\x7e\x0a\xc3\xa6\x9c\xb6\xbf"
+    "\x13\x30\x47\xa3\x19\x2d\xda\x71\x49\x13\x72\xf0\xb4\xca\x81\xd7";
+const arith_uint256 R2L = arith_uint256V(std::vector<unsigned char>(R2Array,R2Array+32));
+
+const char R1LplusR2L[] = "549FB09FEA236A1EA3E31D4D58F1B1369288D204211CA751527CFC175767850C";
+
+const unsigned char ZeroArray[] =
+    "\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"
+    "\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00";
+const arith_uint256 ZeroL = arith_uint256V(std::vector<unsigned char>(ZeroArray,ZeroArray+32));
+
+const unsigned char OneArray[] =
+    "\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"
+    "\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00";
+const arith_uint256 OneL = arith_uint256V(std::vector<unsigned char>(OneArray,OneArray+32));
+
+const unsigned char MaxArray[] =
+    "\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff"
+    "\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff";
+const arith_uint256 MaxL = arith_uint256V(std::vector<unsigned char>(MaxArray,MaxArray+32));
+
+const arith_uint256 HalfL = (OneL << 255);
+std::string ArrayToString(const unsigned char A[], unsigned int width)
+{
+    std::stringstream Stream;
+    Stream << std::hex;
+    for (unsigned int i = 0; i < width; ++i)
+    {
+        Stream<<std::setw(2)<<std::setfill('0')<<(unsigned int)A[width-i-1];
+    }
+    return Stream.str();
+}
+
+BOOST_AUTO_TEST_CASE( basics ) // constructors, equality, inequality
+{
+    BOOST_CHECK(1 == 0+1);
+    // constructor arith_uint256(vector<char>):
+    BOOST_CHECK(R1L.ToString() == ArrayToString(R1Array,32));
+    BOOST_CHECK(R2L.ToString() == ArrayToString(R2Array,32));
+    BOOST_CHECK(ZeroL.ToString() == ArrayToString(ZeroArray,32));
+    BOOST_CHECK(OneL.ToString() == ArrayToString(OneArray,32));
+    BOOST_CHECK(MaxL.ToString() == ArrayToString(MaxArray,32));
+    BOOST_CHECK(OneL.ToString() != ArrayToString(ZeroArray,32));
+
+    // == and !=
+    BOOST_CHECK(R1L != R2L);
+    BOOST_CHECK(ZeroL != OneL);
+    BOOST_CHECK(OneL != ZeroL);
+    BOOST_CHECK(MaxL != ZeroL);
+    BOOST_CHECK(~MaxL == ZeroL);
+    BOOST_CHECK( ((R1L ^ R2L) ^ R1L) == R2L);
+
+    uint64_t Tmp64 = 0xc4dab720d9c7acaaULL;
+    for (unsigned int i = 0; i < 256; ++i)
+    {
+        BOOST_CHECK(ZeroL != (OneL << i));
+        BOOST_CHECK((OneL << i) != ZeroL);
+        BOOST_CHECK(R1L != (R1L ^ (OneL << i)));
+        BOOST_CHECK(((arith_uint256(Tmp64) ^ (OneL << i) ) != Tmp64 ));
+    }
+    BOOST_CHECK(ZeroL == (OneL << 256));
+
+    // String Constructor and Copy Constructor
+    BOOST_CHECK(arith_uint256("0x"+R1L.ToString()) == R1L);
+    BOOST_CHECK(arith_uint256("0x"+R2L.ToString()) == R2L);
+    BOOST_CHECK(arith_uint256("0x"+ZeroL.ToString()) == ZeroL);
+    BOOST_CHECK(arith_uint256("0x"+OneL.ToString()) == OneL);
+    BOOST_CHECK(arith_uint256("0x"+MaxL.ToString()) == MaxL);
+    BOOST_CHECK(arith_uint256(R1L.ToString()) == R1L);
+    BOOST_CHECK(arith_uint256("   0x"+R1L.ToString()+"   ") == R1L);
+    BOOST_CHECK(arith_uint256("") == ZeroL);
+    BOOST_CHECK(R1L == arith_uint256(R1ArrayHex));
+    BOOST_CHECK(arith_uint256(R1L) == R1L);
+    BOOST_CHECK((arith_uint256(R1L^R2L)^R2L) == R1L);
+    BOOST_CHECK(arith_uint256(ZeroL) == ZeroL);
+    BOOST_CHECK(arith_uint256(OneL) == OneL);
+
+    // uint64_t constructor
+    BOOST_CHECK( (R1L & arith_uint256("0xffffffffffffffff")) == arith_uint256(R1LLow64));
+    BOOST_CHECK(ZeroL == arith_uint256(0));
+    BOOST_CHECK(OneL == arith_uint256(1));
+    BOOST_CHECK(arith_uint256("0xffffffffffffffff") = arith_uint256(0xffffffffffffffffULL));
+
+    // Assignment (from base_uint)
+    arith_uint256 tmpL = ~ZeroL; BOOST_CHECK(tmpL == ~ZeroL);
+    tmpL = ~OneL; BOOST_CHECK(tmpL == ~OneL);
+    tmpL = ~R1L; BOOST_CHECK(tmpL == ~R1L);
+    tmpL = ~R2L; BOOST_CHECK(tmpL == ~R2L);
+    tmpL = ~MaxL; BOOST_CHECK(tmpL == ~MaxL);
+}
+
+void shiftArrayRight(unsigned char* to, const unsigned char* from, unsigned int arrayLength, unsigned int bitsToShift)
+{
+    for (unsigned int T=0; T < arrayLength; ++T)
+    {
+        unsigned int F = (T+bitsToShift/8);
+        if (F < arrayLength)
+            to[T]  = from[F] >> (bitsToShift%8);
+        else
+            to[T] = 0;
+        if (F + 1 < arrayLength)
+            to[T] |= from[(F+1)] << (8-bitsToShift%8);
+    }
+}
+
+void shiftArrayLeft(unsigned char* to, const unsigned char* from, unsigned int arrayLength, unsigned int bitsToShift)
+{
+    for (unsigned int T=0; T < arrayLength; ++T)
+    {
+        if (T >= bitsToShift/8)
+        {
+            unsigned int F = T-bitsToShift/8;
+            to[T]  = from[F] << (bitsToShift%8);
+            if (T >= bitsToShift/8+1)
+                to[T] |= from[F-1] >> (8-bitsToShift%8);
+        }
+        else {
+            to[T] = 0;
+        }
+    }
+}
+
+BOOST_AUTO_TEST_CASE( shifts ) { // "<<"  ">>"  "<<="  ">>="
+    unsigned char TmpArray[32];
+    arith_uint256 TmpL;
+    for (unsigned int i = 0; i < 256; ++i)
+    {
+        shiftArrayLeft(TmpArray, OneArray, 32, i);
+        BOOST_CHECK(arith_uint256V(std::vector<unsigned char>(TmpArray,TmpArray+32)) == (OneL << i));
+        TmpL = OneL; TmpL <<= i;
+        BOOST_CHECK(TmpL == (OneL << i));
+        BOOST_CHECK((HalfL >> (255-i)) == (OneL << i));
+        TmpL = HalfL; TmpL >>= (255-i);
+        BOOST_CHECK(TmpL == (OneL << i));
+
+        shiftArrayLeft(TmpArray, R1Array, 32, i);
+        BOOST_CHECK(arith_uint256V(std::vector<unsigned char>(TmpArray,TmpArray+32)) == (R1L << i));
+        TmpL = R1L; TmpL <<= i;
+        BOOST_CHECK(TmpL == (R1L << i));
+
+        shiftArrayRight(TmpArray, R1Array, 32, i);
+        BOOST_CHECK(arith_uint256V(std::vector<unsigned char>(TmpArray,TmpArray+32)) == (R1L >> i));
+        TmpL = R1L; TmpL >>= i;
+        BOOST_CHECK(TmpL == (R1L >> i));
+
+        shiftArrayLeft(TmpArray, MaxArray, 32, i);
+        BOOST_CHECK(arith_uint256V(std::vector<unsigned char>(TmpArray,TmpArray+32)) == (MaxL << i));
+        TmpL = MaxL; TmpL <<= i;
+        BOOST_CHECK(TmpL == (MaxL << i));
+
+        shiftArrayRight(TmpArray, MaxArray, 32, i);
+        BOOST_CHECK(arith_uint256V(std::vector<unsigned char>(TmpArray,TmpArray+32)) == (MaxL >> i));
+        TmpL = MaxL; TmpL >>= i;
+        BOOST_CHECK(TmpL == (MaxL >> i));
+    }
+    arith_uint256 c1L = arith_uint256(0x0123456789abcdefULL);
+    arith_uint256 c2L = c1L << 128;
+    for (unsigned int i = 0; i < 128; ++i) {
+        BOOST_CHECK((c1L << i) == (c2L >> (128-i)));
+    }
+    for (unsigned int i = 128; i < 256; ++i) {
+        BOOST_CHECK((c1L << i) == (c2L << (i-128)));
+    }
+}
+
+BOOST_AUTO_TEST_CASE( unaryOperators ) // !    ~    -
+{
+    BOOST_CHECK(!ZeroL);
+    BOOST_CHECK(!(!OneL));
+    for (unsigned int i = 0; i < 256; ++i)
+        BOOST_CHECK(!(!(OneL<<i)));
+    BOOST_CHECK(!(!R1L));
+    BOOST_CHECK(!(!MaxL));
+
+    BOOST_CHECK(~ZeroL == MaxL);
+
+    unsigned char TmpArray[32];
+    for (unsigned int i = 0; i < 32; ++i) { TmpArray[i] = ~R1Array[i]; }
+    BOOST_CHECK(arith_uint256V(std::vector<unsigned char>(TmpArray,TmpArray+32)) == (~R1L));
+
+    BOOST_CHECK(-ZeroL == ZeroL);
+    BOOST_CHECK(-R1L == (~R1L)+1);
+    for (unsigned int i = 0; i < 256; ++i)
+        BOOST_CHECK(-(OneL<<i) == (MaxL << i));
+}
+
+
+// Check if doing _A_ _OP_ _B_ results in the same as applying _OP_ onto each
+// element of Aarray and Barray, and then converting the result into an arith_uint256.
+#define CHECKBITWISEOPERATOR(_A_,_B_,_OP_)                              \
+    for (unsigned int i = 0; i < 32; ++i) { TmpArray[i] = _A_##Array[i] _OP_ _B_##Array[i]; } \
+    BOOST_CHECK(arith_uint256V(std::vector<unsigned char>(TmpArray,TmpArray+32)) == (_A_##L _OP_ _B_##L));
+
+#define CHECKASSIGNMENTOPERATOR(_A_,_B_,_OP_)                           \
+    TmpL = _A_##L; TmpL _OP_##= _B_##L; BOOST_CHECK(TmpL == (_A_##L _OP_ _B_##L));
+
+BOOST_AUTO_TEST_CASE( bitwiseOperators )
+{
+    unsigned char TmpArray[32];
+
+    CHECKBITWISEOPERATOR(R1,R2,|)
+    CHECKBITWISEOPERATOR(R1,R2,^)
+    CHECKBITWISEOPERATOR(R1,R2,&)
+    CHECKBITWISEOPERATOR(R1,Zero,|)
+    CHECKBITWISEOPERATOR(R1,Zero,^)
+    CHECKBITWISEOPERATOR(R1,Zero,&)
+    CHECKBITWISEOPERATOR(R1,Max,|)
+    CHECKBITWISEOPERATOR(R1,Max,^)
+    CHECKBITWISEOPERATOR(R1,Max,&)
+    CHECKBITWISEOPERATOR(Zero,R1,|)
+    CHECKBITWISEOPERATOR(Zero,R1,^)
+    CHECKBITWISEOPERATOR(Zero,R1,&)
+    CHECKBITWISEOPERATOR(Max,R1,|)
+    CHECKBITWISEOPERATOR(Max,R1,^)
+    CHECKBITWISEOPERATOR(Max,R1,&)
+
+    arith_uint256 TmpL;
+    CHECKASSIGNMENTOPERATOR(R1,R2,|)
+    CHECKASSIGNMENTOPERATOR(R1,R2,^)
+    CHECKASSIGNMENTOPERATOR(R1,R2,&)
+    CHECKASSIGNMENTOPERATOR(R1,Zero,|)
+    CHECKASSIGNMENTOPERATOR(R1,Zero,^)
+    CHECKASSIGNMENTOPERATOR(R1,Zero,&)
+    CHECKASSIGNMENTOPERATOR(R1,Max,|)
+    CHECKASSIGNMENTOPERATOR(R1,Max,^)
+    CHECKASSIGNMENTOPERATOR(R1,Max,&)
+    CHECKASSIGNMENTOPERATOR(Zero,R1,|)
+    CHECKASSIGNMENTOPERATOR(Zero,R1,^)
+    CHECKASSIGNMENTOPERATOR(Zero,R1,&)
+    CHECKASSIGNMENTOPERATOR(Max,R1,|)
+    CHECKASSIGNMENTOPERATOR(Max,R1,^)
+    CHECKASSIGNMENTOPERATOR(Max,R1,&)
+
+    uint64_t Tmp64 = 0xe1db685c9a0b47a2ULL;
+    TmpL = R1L; TmpL |= Tmp64;  BOOST_CHECK(TmpL == (R1L | arith_uint256(Tmp64)));
+    TmpL = R1L; TmpL |= 0; BOOST_CHECK(TmpL == R1L);
+    TmpL ^= 0; BOOST_CHECK(TmpL == R1L);
+    TmpL ^= Tmp64;  BOOST_CHECK(TmpL == (R1L ^ arith_uint256(Tmp64)));
+}
+
+BOOST_AUTO_TEST_CASE( comparison ) // <= >= < >
+{
+    arith_uint256 TmpL;
+    for (unsigned int i = 0; i < 256; ++i) {
+        TmpL= OneL<< i;
+        BOOST_CHECK( TmpL >= ZeroL && TmpL > ZeroL && ZeroL < TmpL && ZeroL <= TmpL);
+        BOOST_CHECK( TmpL >= 0 && TmpL > 0 && 0 < TmpL && 0 <= TmpL);
+        TmpL |= R1L;
+        BOOST_CHECK( TmpL >= R1L ); BOOST_CHECK( (TmpL == R1L) != (TmpL > R1L)); BOOST_CHECK( (TmpL == R1L) || !( TmpL <= R1L));
+        BOOST_CHECK( R1L <= TmpL ); BOOST_CHECK( (R1L == TmpL) != (R1L < TmpL)); BOOST_CHECK( (TmpL == R1L) || !( R1L >= TmpL));
+        BOOST_CHECK(! (TmpL < R1L)); BOOST_CHECK(! (R1L > TmpL));
+    }
+}
+
+BOOST_AUTO_TEST_CASE( plusMinus )
+{
+    arith_uint256 TmpL = 0;
+    BOOST_CHECK(R1L+R2L == arith_uint256(R1LplusR2L));
+    TmpL += R1L;
+    BOOST_CHECK(TmpL == R1L);
+    TmpL += R2L;
+    BOOST_CHECK(TmpL == R1L + R2L);
+    BOOST_CHECK(OneL+MaxL == ZeroL);
+    BOOST_CHECK(MaxL+OneL == ZeroL);
+    for (unsigned int i = 1; i < 256; ++i) {
+        BOOST_CHECK( (MaxL >> i) + OneL == (HalfL >> (i-1)) );
+        BOOST_CHECK( OneL + (MaxL >> i) == (HalfL >> (i-1)) );
+        TmpL = (MaxL>>i); TmpL += OneL;
+        BOOST_CHECK( TmpL == (HalfL >> (i-1)) );
+        TmpL = (MaxL>>i); TmpL += 1;
+        BOOST_CHECK( TmpL == (HalfL >> (i-1)) );
+        TmpL = (MaxL>>i);
+        BOOST_CHECK( TmpL++ == (MaxL>>i) );
+        BOOST_CHECK( TmpL == (HalfL >> (i-1)));
+    }
+    BOOST_CHECK(arith_uint256(0xbedc77e27940a7ULL) + 0xee8d836fce66fbULL == arith_uint256(0xbedc77e27940a7ULL + 0xee8d836fce66fbULL));
+    TmpL = arith_uint256(0xbedc77e27940a7ULL); TmpL += 0xee8d836fce66fbULL;
+    BOOST_CHECK(TmpL == arith_uint256(0xbedc77e27940a7ULL+0xee8d836fce66fbULL));
+    TmpL -= 0xee8d836fce66fbULL;  BOOST_CHECK(TmpL == 0xbedc77e27940a7ULL);
+    TmpL = R1L;
+    BOOST_CHECK(++TmpL == R1L+1);
+
+    BOOST_CHECK(R1L -(-R2L) == R1L+R2L);
+    BOOST_CHECK(R1L -(-OneL) == R1L+OneL);
+    BOOST_CHECK(R1L - OneL == R1L+(-OneL));
+    for (unsigned int i = 1; i < 256; ++i) {
+        BOOST_CHECK((MaxL>>i) - (-OneL)  == (HalfL >> (i-1)));
+        BOOST_CHECK((HalfL >> (i-1)) - OneL == (MaxL>>i));
+        TmpL = (HalfL >> (i-1));
+        BOOST_CHECK(TmpL-- == (HalfL >> (i-1)));
+        BOOST_CHECK(TmpL == (MaxL >> i));
+        TmpL = (HalfL >> (i-1));
+        BOOST_CHECK(--TmpL == (MaxL >> i));
+    }
+    TmpL = R1L;
+    BOOST_CHECK(--TmpL == R1L-1);
+}
+
+BOOST_AUTO_TEST_CASE( multiply )
+{
+    BOOST_CHECK((R1L * R1L).ToString() == "62a38c0486f01e45879d7910a7761bf30d5237e9873f9bff3642a732c4d84f10");
+    BOOST_CHECK((R1L * R2L).ToString() == "de37805e9986996cfba76ff6ba51c008df851987d9dd323f0e5de07760529c40");
+    BOOST_CHECK((R1L * ZeroL) == ZeroL);
+    BOOST_CHECK((R1L * OneL) == R1L);
+    BOOST_CHECK((R1L * MaxL) == -R1L);
+    BOOST_CHECK((R2L * R1L) == (R1L * R2L));
+    BOOST_CHECK((R2L * R2L).ToString() == "ac8c010096767d3cae5005dec28bb2b45a1d85ab7996ccd3e102a650f74ff100");
+    BOOST_CHECK((R2L * ZeroL) == ZeroL);
+    BOOST_CHECK((R2L * OneL) == R2L);
+    BOOST_CHECK((R2L * MaxL) == -R2L);
+
+    BOOST_CHECK(MaxL * MaxL == OneL);
+
+    BOOST_CHECK((R1L * 0) == 0);
+    BOOST_CHECK((R1L * 1) == R1L);
+    BOOST_CHECK((R1L * 3).ToString() == "7759b1c0ed14047f961ad09b20ff83687876a0181a367b813634046f91def7d4");
+    BOOST_CHECK((R2L * 0x87654321UL).ToString() == "23f7816e30c4ae2017257b7a0fa64d60402f5234d46e746b61c960d09a26d070");
+}
+
+BOOST_AUTO_TEST_CASE( divide )
+{
+    arith_uint256 D1L("AD7133AC1977FA2B7");
+    arith_uint256 D2L("ECD751716");
+    BOOST_CHECK((R1L / D1L).ToString() == "00000000000000000b8ac01106981635d9ed112290f8895545a7654dde28fb3a");
+    BOOST_CHECK((R1L / D2L).ToString() == "000000000873ce8efec5b67150bad3aa8c5fcb70e947586153bf2cec7c37c57a");
+    BOOST_CHECK(R1L / OneL == R1L);
+    BOOST_CHECK(R1L / MaxL == ZeroL);
+    BOOST_CHECK(MaxL / R1L == 2);
+    BOOST_CHECK_THROW(R1L / ZeroL, uint_error);
+    BOOST_CHECK((R2L / D1L).ToString() == "000000000000000013e1665895a1cc981de6d93670105a6b3ec3b73141b3a3c5");
+    BOOST_CHECK((R2L / D2L).ToString() == "000000000e8f0abe753bb0afe2e9437ee85d280be60882cf0bd1aaf7fa3cc2c4");
+    BOOST_CHECK(R2L / OneL == R2L);
+    BOOST_CHECK(R2L / MaxL == ZeroL);
+    BOOST_CHECK(MaxL / R2L == 1);
+    BOOST_CHECK_THROW(R2L / ZeroL, uint_error);
+}
+
+
+bool almostEqual(double d1, double d2)
+{
+    return fabs(d1-d2) <= 4*fabs(d1)*std::numeric_limits<double>::epsilon();
+}
+
+BOOST_AUTO_TEST_CASE( methods ) // GetHex SetHex size() GetLow64 GetSerializeSize, Serialize, Unserialize
+{
+    BOOST_CHECK(R1L.GetHex() == R1L.ToString());
+    BOOST_CHECK(R2L.GetHex() == R2L.ToString());
+    BOOST_CHECK(OneL.GetHex() == OneL.ToString());
+    BOOST_CHECK(MaxL.GetHex() == MaxL.ToString());
+    arith_uint256 TmpL(R1L);
+    BOOST_CHECK(TmpL == R1L);
+    TmpL.SetHex(R2L.ToString());   BOOST_CHECK(TmpL == R2L);
+    TmpL.SetHex(ZeroL.ToString()); BOOST_CHECK(TmpL == 0);
+    TmpL.SetHex(HalfL.ToString()); BOOST_CHECK(TmpL == HalfL);
+
+    TmpL.SetHex(R1L.ToString());
+    BOOST_CHECK(R1L.size() == 32);
+    BOOST_CHECK(R2L.size() == 32);
+    BOOST_CHECK(ZeroL.size() == 32);
+    BOOST_CHECK(MaxL.size() == 32);
+    BOOST_CHECK(R1L.GetLow64()  == R1LLow64);
+    BOOST_CHECK(HalfL.GetLow64() ==0x0000000000000000ULL);
+    BOOST_CHECK(OneL.GetLow64() ==0x0000000000000001ULL);
+
+    for (unsigned int i = 0; i < 255; ++i)
+    {
+        BOOST_CHECK((OneL << i).getdouble() == ldexp(1.0,i));
+    }
+    BOOST_CHECK(ZeroL.getdouble() == 0.0);
+    for (int i = 256; i > 53; --i)
+        BOOST_CHECK(almostEqual((R1L>>(256-i)).getdouble(), ldexp(R1Ldouble,i)));
+    uint64_t R1L64part = (R1L>>192).GetLow64();
+    for (int i = 53; i > 0; --i) // doubles can store all integers in {0,...,2^54-1} exactly
+    {
+        BOOST_CHECK((R1L>>(256-i)).getdouble() == (double)(R1L64part >> (64-i)));
+    }
+}
+
+BOOST_AUTO_TEST_CASE(bignum_SetCompact)
+{
+    arith_uint256 num;
+    bool fNegative;
+    bool fOverflow;
+    num.SetCompact(0, &fNegative, &fOverflow);
+    BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000000");
+    BOOST_CHECK_EQUAL(num.GetCompact(), 0U);
+    BOOST_CHECK_EQUAL(fNegative, false);
+    BOOST_CHECK_EQUAL(fOverflow, false);
+
+    num.SetCompact(0x00123456, &fNegative, &fOverflow);
+    BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000000");
+    BOOST_CHECK_EQUAL(num.GetCompact(), 0U);
+    BOOST_CHECK_EQUAL(fNegative, false);
+    BOOST_CHECK_EQUAL(fOverflow, false);
+
+    num.SetCompact(0x01003456, &fNegative, &fOverflow);
+    BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000000");
+    BOOST_CHECK_EQUAL(num.GetCompact(), 0U);
+    BOOST_CHECK_EQUAL(fNegative, false);
+    BOOST_CHECK_EQUAL(fOverflow, false);
+
+    num.SetCompact(0x02000056, &fNegative, &fOverflow);
+    BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000000");
+    BOOST_CHECK_EQUAL(num.GetCompact(), 0U);
+    BOOST_CHECK_EQUAL(fNegative, false);
+    BOOST_CHECK_EQUAL(fOverflow, false);
+
+    num.SetCompact(0x03000000, &fNegative, &fOverflow);
+    BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000000");
+    BOOST_CHECK_EQUAL(num.GetCompact(), 0U);
+    BOOST_CHECK_EQUAL(fNegative, false);
+    BOOST_CHECK_EQUAL(fOverflow, false);
+
+    num.SetCompact(0x04000000, &fNegative, &fOverflow);
+    BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000000");
+    BOOST_CHECK_EQUAL(num.GetCompact(), 0U);
+    BOOST_CHECK_EQUAL(fNegative, false);
+    BOOST_CHECK_EQUAL(fOverflow, false);
+
+    num.SetCompact(0x00923456, &fNegative, &fOverflow);
+    BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000000");
+    BOOST_CHECK_EQUAL(num.GetCompact(), 0U);
+    BOOST_CHECK_EQUAL(fNegative, false);
+    BOOST_CHECK_EQUAL(fOverflow, false);
+
+    num.SetCompact(0x01803456, &fNegative, &fOverflow);
+    BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000000");
+    BOOST_CHECK_EQUAL(num.GetCompact(), 0U);
+    BOOST_CHECK_EQUAL(fNegative, false);
+    BOOST_CHECK_EQUAL(fOverflow, false);
+
+    num.SetCompact(0x02800056, &fNegative, &fOverflow);
+    BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000000");
+    BOOST_CHECK_EQUAL(num.GetCompact(), 0U);
+    BOOST_CHECK_EQUAL(fNegative, false);
+    BOOST_CHECK_EQUAL(fOverflow, false);
+
+    num.SetCompact(0x03800000, &fNegative, &fOverflow);
+    BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000000");
+    BOOST_CHECK_EQUAL(num.GetCompact(), 0U);
+    BOOST_CHECK_EQUAL(fNegative, false);
+    BOOST_CHECK_EQUAL(fOverflow, false);
+
+    num.SetCompact(0x04800000, &fNegative, &fOverflow);
+    BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000000");
+    BOOST_CHECK_EQUAL(num.GetCompact(), 0U);
+    BOOST_CHECK_EQUAL(fNegative, false);
+    BOOST_CHECK_EQUAL(fOverflow, false);
+
+    num.SetCompact(0x01123456, &fNegative, &fOverflow);
+    BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000000012");
+    BOOST_CHECK_EQUAL(num.GetCompact(), 0x01120000U);
+    BOOST_CHECK_EQUAL(fNegative, false);
+    BOOST_CHECK_EQUAL(fOverflow, false);
+
+    // Make sure that we don't generate compacts with the 0x00800000 bit set
+    num = 0x80;
+    BOOST_CHECK_EQUAL(num.GetCompact(), 0x02008000U);
+
+    num.SetCompact(0x01fedcba, &fNegative, &fOverflow);
+    BOOST_CHECK_EQUAL(num.GetHex(), "000000000000000000000000000000000000000000000000000000000000007e");
+    BOOST_CHECK_EQUAL(num.GetCompact(true), 0x01fe0000U);
+    BOOST_CHECK_EQUAL(fNegative, true);
+    BOOST_CHECK_EQUAL(fOverflow, false);
+
+    num.SetCompact(0x02123456, &fNegative, &fOverflow);
+    BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000001234");
+    BOOST_CHECK_EQUAL(num.GetCompact(), 0x02123400U);
+    BOOST_CHECK_EQUAL(fNegative, false);
+    BOOST_CHECK_EQUAL(fOverflow, false);
+
+    num.SetCompact(0x03123456, &fNegative, &fOverflow);
+    BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000000123456");
+    BOOST_CHECK_EQUAL(num.GetCompact(), 0x03123456U);
+    BOOST_CHECK_EQUAL(fNegative, false);
+    BOOST_CHECK_EQUAL(fOverflow, false);
+
+    num.SetCompact(0x04123456, &fNegative, &fOverflow);
+    BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000012345600");
+    BOOST_CHECK_EQUAL(num.GetCompact(), 0x04123456U);
+    BOOST_CHECK_EQUAL(fNegative, false);
+    BOOST_CHECK_EQUAL(fOverflow, false);
+
+    num.SetCompact(0x04923456, &fNegative, &fOverflow);
+    BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000012345600");
+    BOOST_CHECK_EQUAL(num.GetCompact(true), 0x04923456U);
+    BOOST_CHECK_EQUAL(fNegative, true);
+    BOOST_CHECK_EQUAL(fOverflow, false);
+
+    num.SetCompact(0x05009234, &fNegative, &fOverflow);
+    BOOST_CHECK_EQUAL(num.GetHex(), "0000000000000000000000000000000000000000000000000000000092340000");
+    BOOST_CHECK_EQUAL(num.GetCompact(), 0x05009234U);
+    BOOST_CHECK_EQUAL(fNegative, false);
+    BOOST_CHECK_EQUAL(fOverflow, false);
+
+    num.SetCompact(0x20123456, &fNegative, &fOverflow);
+    BOOST_CHECK_EQUAL(num.GetHex(), "1234560000000000000000000000000000000000000000000000000000000000");
+    BOOST_CHECK_EQUAL(num.GetCompact(), 0x20123456U);
+    BOOST_CHECK_EQUAL(fNegative, false);
+    BOOST_CHECK_EQUAL(fOverflow, false);
+
+    num.SetCompact(0xff123456, &fNegative, &fOverflow);
+    BOOST_CHECK_EQUAL(fNegative, false);
+    BOOST_CHECK_EQUAL(fOverflow, true);
+}
+
+
+BOOST_AUTO_TEST_CASE( getmaxcoverage ) // some more tests just to get 100% coverage
+{
+    // ~R1L give a base_uint<256>
+    BOOST_CHECK((~~R1L >> 10) == (R1L >> 10));
+    BOOST_CHECK((~~R1L << 10) == (R1L << 10));
+    BOOST_CHECK(!(~~R1L < R1L));
+    BOOST_CHECK(~~R1L <= R1L);
+    BOOST_CHECK(!(~~R1L > R1L));
+    BOOST_CHECK(~~R1L >= R1L);
+    BOOST_CHECK(!(R1L < ~~R1L));
+    BOOST_CHECK(R1L <= ~~R1L);
+    BOOST_CHECK(!(R1L > ~~R1L));
+    BOOST_CHECK(R1L >= ~~R1L);
+
+    BOOST_CHECK(~~R1L + R2L == R1L + ~~R2L);
+    BOOST_CHECK(~~R1L - R2L == R1L - ~~R2L);
+    BOOST_CHECK(~R1L != R1L); BOOST_CHECK(R1L != ~R1L);
+    unsigned char TmpArray[32];
+    CHECKBITWISEOPERATOR(~R1,R2,|)
+    CHECKBITWISEOPERATOR(~R1,R2,^)
+    CHECKBITWISEOPERATOR(~R1,R2,&)
+    CHECKBITWISEOPERATOR(R1,~R2,|)
+    CHECKBITWISEOPERATOR(R1,~R2,^)
+    CHECKBITWISEOPERATOR(R1,~R2,&)
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/base32_tests.cpp b/depend/zcash/src/test/base32_tests.cpp
new file mode 100644
index 000000000..7779461aa
--- /dev/null
+++ b/depend/zcash/src/test/base32_tests.cpp
@@ -0,0 +1,25 @@
+// Copyright (c) 2012-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "utilstrencodings.h"
+#include "test/test_bitcoin.h"
+
+#include <boost/test/unit_test.hpp>
+
+BOOST_FIXTURE_TEST_SUITE(base32_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(base32_testvectors)
+{
+    static const std::string vstrIn[]  = {"","f","fo","foo","foob","fooba","foobar"};
+    static const std::string vstrOut[] = {"","my======","mzxq====","mzxw6===","mzxw6yq=","mzxw6ytb","mzxw6ytboi======"};
+    for (unsigned int i=0; i<sizeof(vstrIn)/sizeof(vstrIn[0]); i++)
+    {
+        std::string strEnc = EncodeBase32(vstrIn[i]);
+        BOOST_CHECK_EQUAL(strEnc, vstrOut[i]);
+        std::string strDec = DecodeBase32(vstrOut[i]);
+        BOOST_CHECK_EQUAL(strDec, vstrIn[i]);
+    }
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/base58_tests.cpp b/depend/zcash/src/test/base58_tests.cpp
new file mode 100644
index 000000000..1e5d2621f
--- /dev/null
+++ b/depend/zcash/src/test/base58_tests.cpp
@@ -0,0 +1,199 @@
+// Copyright (c) 2011-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "base58.h"
+
+#include "test/data/base58_encode_decode.json.h"
+#include "test/data/base58_keys_invalid.json.h"
+#include "test/data/base58_keys_valid.json.h"
+
+#include "key.h"
+#include "key_io.h"
+#include "script/script.h"
+#include "test/test_bitcoin.h"
+#include "test/test_util.h"
+#include "uint256.h"
+#include "util.h"
+#include "utilstrencodings.h"
+
+#include <univalue.h>
+
+#include <boost/test/unit_test.hpp>
+
+
+BOOST_FIXTURE_TEST_SUITE(base58_tests, BasicTestingSetup)
+
+// Goal: test low-level base58 encoding functionality
+BOOST_AUTO_TEST_CASE(base58_EncodeBase58)
+{
+    UniValue tests = read_json(std::string(json_tests::base58_encode_decode, json_tests::base58_encode_decode + sizeof(json_tests::base58_encode_decode)));
+    for (size_t idx = 0; idx < tests.size(); idx++) {
+        UniValue test = tests[idx];
+        std::string strTest = test.write();
+        if (test.size() < 2) // Allow for extra stuff (useful for comments)
+        {
+            BOOST_ERROR("Bad test: " << strTest);
+            continue;
+        }
+        std::vector<unsigned char> sourcedata = ParseHex(test[0].get_str());
+        std::string base58string = test[1].get_str();
+        BOOST_CHECK_MESSAGE(
+                    EncodeBase58(begin_ptr(sourcedata), end_ptr(sourcedata)) == base58string,
+                    strTest);
+    }
+}
+
+// Goal: test low-level base58 decoding functionality
+BOOST_AUTO_TEST_CASE(base58_DecodeBase58)
+{
+    UniValue tests = read_json(std::string(json_tests::base58_encode_decode, json_tests::base58_encode_decode + sizeof(json_tests::base58_encode_decode)));
+    std::vector<unsigned char> result;
+
+    for (size_t idx = 0; idx < tests.size(); idx++) {
+        UniValue test = tests[idx];
+        std::string strTest = test.write();
+        if (test.size() < 2) // Allow for extra stuff (useful for comments)
+        {
+            BOOST_ERROR("Bad test: " << strTest);
+            continue;
+        }
+        std::vector<unsigned char> expected = ParseHex(test[0].get_str());
+        std::string base58string = test[1].get_str();
+        BOOST_CHECK_MESSAGE(DecodeBase58(base58string, result), strTest);
+        BOOST_CHECK_MESSAGE(result.size() == expected.size() && std::equal(result.begin(), result.end(), expected.begin()), strTest);
+    }
+
+    BOOST_CHECK(!DecodeBase58("invalid", result));
+
+    // check that DecodeBase58 skips whitespace, but still fails with unexpected non-whitespace at the end.
+    BOOST_CHECK(!DecodeBase58(" \t\n\v\f\r skip \r\f\v\n\t a", result));
+    BOOST_CHECK( DecodeBase58(" \t\n\v\f\r skip \r\f\v\n\t ", result));
+    std::vector<unsigned char> expected = ParseHex("971a55");
+    BOOST_CHECK_EQUAL_COLLECTIONS(result.begin(), result.end(), expected.begin(), expected.end());
+}
+
+// Goal: check that parsed keys match test payload
+BOOST_AUTO_TEST_CASE(base58_keys_valid_parse)
+{
+    UniValue tests = read_json(std::string(json_tests::base58_keys_valid, json_tests::base58_keys_valid + sizeof(json_tests::base58_keys_valid)));
+    CKey privkey;
+    CTxDestination destination;
+    SelectParams(CBaseChainParams::MAIN);
+
+    for (size_t idx = 0; idx < tests.size(); idx++) {
+        UniValue test = tests[idx];
+        std::string strTest = test.write();
+        if (test.size() < 3) { // Allow for extra stuff (useful for comments)
+            BOOST_ERROR("Bad test: " << strTest);
+            continue;
+        }
+        std::string exp_base58string = test[0].get_str();
+        std::vector<unsigned char> exp_payload = ParseHex(test[1].get_str());
+        const UniValue &metadata = test[2].get_obj();
+        bool isPrivkey = find_value(metadata, "isPrivkey").get_bool();
+        bool isTestnet = find_value(metadata, "chain").get_str() == "testnet";
+        if (isTestnet) {
+            SelectParams(CBaseChainParams::TESTNET);
+        } else {
+            SelectParams(CBaseChainParams::MAIN);
+        }
+
+        KeyIO keyIO(Params());
+        if (isPrivkey) {
+            bool isCompressed = find_value(metadata, "isCompressed").get_bool();
+            // Must be valid private key
+            privkey = keyIO.DecodeSecret(exp_base58string);
+            BOOST_CHECK_MESSAGE(privkey.IsValid(), "!IsValid:" + strTest);
+            BOOST_CHECK_MESSAGE(privkey.IsCompressed() == isCompressed, "compressed mismatch:" + strTest);
+            BOOST_CHECK_MESSAGE(privkey.size() == exp_payload.size() && std::equal(privkey.begin(), privkey.end(), exp_payload.begin()), "key mismatch:" + strTest);
+
+            // Private key must be invalid public key
+            destination = keyIO.DecodeDestination(exp_base58string);
+            BOOST_CHECK_MESSAGE(!IsValidDestination(destination), "IsValid privkey as pubkey:" + strTest);
+        } else {
+            // Must be valid public key
+            destination = keyIO.DecodeDestination(exp_base58string);
+            CScript script = GetScriptForDestination(destination);
+            BOOST_CHECK_MESSAGE(IsValidDestination(destination), "!IsValid:" + strTest);
+            BOOST_CHECK_EQUAL(HexStr(script), HexStr(exp_payload));
+
+            // Public key must be invalid private key
+            privkey = keyIO.DecodeSecret(exp_base58string);
+            BOOST_CHECK_MESSAGE(!privkey.IsValid(), "IsValid pubkey as privkey:" + strTest);
+        }
+    }
+}
+
+// Goal: check that generated keys match test vectors
+BOOST_AUTO_TEST_CASE(base58_keys_valid_gen)
+{
+    UniValue tests = read_json(std::string(json_tests::base58_keys_valid, json_tests::base58_keys_valid + sizeof(json_tests::base58_keys_valid)));
+
+    for (size_t idx = 0; idx < tests.size(); idx++) {
+        UniValue test = tests[idx];
+        std::string strTest = test.write();
+        if (test.size() < 3) // Allow for extra stuff (useful for comments)
+        {
+            BOOST_ERROR("Bad test: " << strTest);
+            continue;
+        }
+        std::string exp_base58string = test[0].get_str();
+        std::vector<unsigned char> exp_payload = ParseHex(test[1].get_str());
+        const UniValue &metadata = test[2].get_obj();
+        bool isPrivkey = find_value(metadata, "isPrivkey").get_bool();
+        bool isTestnet = find_value(metadata, "chain").get_str() == "testnet";
+        if (isTestnet) {
+            SelectParams(CBaseChainParams::TESTNET);
+        } else {
+            SelectParams(CBaseChainParams::MAIN);
+        }
+
+        KeyIO keyIO(Params());
+        if (isPrivkey) {
+            bool isCompressed = find_value(metadata, "isCompressed").get_bool();
+            CKey key;
+            key.Set(exp_payload.begin(), exp_payload.end(), isCompressed);
+            assert(key.IsValid());
+            BOOST_CHECK_MESSAGE(keyIO.EncodeSecret(key) == exp_base58string, "result mismatch: " + strTest);
+        } else {
+            CTxDestination dest;
+            CScript exp_script(exp_payload.begin(), exp_payload.end());
+            ExtractDestination(exp_script, dest);
+            std::string address = keyIO.EncodeDestination(dest);
+            BOOST_CHECK_EQUAL(address, exp_base58string);
+        }
+    }
+
+    SelectParams(CBaseChainParams::MAIN);
+}
+
+// Goal: check that base58 parsing code is robust against a variety of corrupted data
+BOOST_AUTO_TEST_CASE(base58_keys_invalid)
+{
+    UniValue tests = read_json(std::string(json_tests::base58_keys_invalid, json_tests::base58_keys_invalid + sizeof(json_tests::base58_keys_invalid))); // Negative testcases
+    CKey privkey;
+    CTxDestination destination;
+
+    KeyIO keyIO(Params());
+    for (size_t idx = 0; idx < tests.size(); idx++) {
+        UniValue test = tests[idx];
+        std::string strTest = test.write();
+        if (test.size() < 1) // Allow for extra stuff (useful for comments)
+        {
+            BOOST_ERROR("Bad test: " << strTest);
+            continue;
+        }
+        std::string exp_base58string = test[0].get_str();
+
+        // must be invalid as public and as private key
+        destination = keyIO.DecodeDestination(exp_base58string);
+        BOOST_CHECK_MESSAGE(!IsValidDestination(destination), "IsValid pubkey:" + strTest);
+        privkey = keyIO.DecodeSecret(exp_base58string);
+        BOOST_CHECK_MESSAGE(!privkey.IsValid(), "IsValid privkey:" + strTest);
+    }
+}
+
+
+BOOST_AUTO_TEST_SUITE_END()
+
diff --git a/depend/zcash/src/test/base64_tests.cpp b/depend/zcash/src/test/base64_tests.cpp
new file mode 100644
index 000000000..1996b38f1
--- /dev/null
+++ b/depend/zcash/src/test/base64_tests.cpp
@@ -0,0 +1,25 @@
+// Copyright (c) 2011-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "utilstrencodings.h"
+#include "test/test_bitcoin.h"
+
+#include <boost/test/unit_test.hpp>
+
+BOOST_FIXTURE_TEST_SUITE(base64_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(base64_testvectors)
+{
+    static const std::string vstrIn[]  = {"","f","fo","foo","foob","fooba","foobar"};
+    static const std::string vstrOut[] = {"","Zg==","Zm8=","Zm9v","Zm9vYg==","Zm9vYmE=","Zm9vYmFy"};
+    for (unsigned int i=0; i<sizeof(vstrIn)/sizeof(vstrIn[0]); i++)
+    {
+        std::string strEnc = EncodeBase64(vstrIn[i]);
+        BOOST_CHECK_EQUAL(strEnc, vstrOut[i]);
+        std::string strDec = DecodeBase64(strEnc);
+        BOOST_CHECK_EQUAL(strDec, vstrIn[i]);
+    }
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/bctest.py b/depend/zcash/src/test/bctest.py
new file mode 100644
index 000000000..9859186e6
--- /dev/null
+++ b/depend/zcash/src/test/bctest.py
@@ -0,0 +1,127 @@
+# Copyright 2014 BitPay, Inc.
+# Copyright 2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+import subprocess
+import os
+import json
+import sys
+import binascii
+import difflib
+import logging
+import pprint
+
+def parse_output(a, fmt):
+    """Parse the output according to specified format.
+
+    Raise an error if the output can't be parsed."""
+    if fmt == 'json': # json: compare parsed data
+        return json.loads(a)
+    elif fmt == 'hex': # hex: parse and compare binary data
+        return binascii.a2b_hex(a.strip())
+    else:
+        raise NotImplementedError("Don't know how to compare %s" % fmt)
+
+def bctest(testDir, testObj, exeext):
+    """Runs a single test, comparing output and RC to expected output and RC.
+
+    Raises an error if input can't be read, executable fails, or output/RC
+    are not as expected. Error is caught by bctester() and reported.
+    """
+    # Get the exec names and arguments
+    execprog = testObj['exec'] + exeext
+    execargs = testObj['args']
+    execrun = [execprog] + execargs
+
+    # Read the input data (if there is any)
+    stdinCfg = None
+    inputData = None
+    if "input" in testObj:
+        filename = testDir + "/" + testObj['input']
+        inputData = open(filename, encoding='utf8').read()
+        stdinCfg = subprocess.PIPE
+
+    # Read the expected output data (if there is any)
+    outputFn = None
+    outputData = None
+    if "output_cmp" in testObj:
+        outputFn = testObj['output_cmp']
+        outputType = os.path.splitext(outputFn)[1][1:] # output type from file extension (determines how to compare)
+        try:
+            outputData = open(testDir + "/" + outputFn, encoding='utf8').read()
+        except:
+            logging.error("Output file " + outputFn + " can not be opened")
+            raise
+        if not outputData:
+            logging.error("Output data missing for " + outputFn)
+            raise Exception
+
+    # Run the test
+    proc = subprocess.Popen(execrun, stdin=stdinCfg, stdout=subprocess.PIPE, stderr=subprocess.PIPE,universal_newlines=True)
+    try:
+        outs = proc.communicate(input=inputData)
+    except OSError:
+        logging.error("OSError, Failed to execute " + execprog)
+        raise
+
+    if outputData:
+        data_mismatch, formatting_mismatch = False, False
+        # Parse command output and expected output
+        try:
+            a_parsed = parse_output(outs[0], outputType)
+        except Exception as e:
+            logging.error('Error parsing command output as %s: %s' % (outputType,e))
+            raise
+        try:
+            b_parsed = parse_output(outputData, outputType)
+        except Exception as e:
+            logging.error('Error parsing expected output %s as %s: %s' % (outputFn,outputType,e))
+            raise
+        # Compare data
+        if a_parsed != b_parsed:
+            logging.error("Output data mismatch for " + outputFn + " (format " + outputType + ")")
+            data_mismatch = True
+        # Compare formatting
+        if outs[0] != outputData:
+            error_message = "Output formatting mismatch for " + outputFn + ":\n"
+            error_message += "".join(difflib.context_diff(outputData.splitlines(True),
+                                                          outs[0].splitlines(True),
+                                                          fromfile=outputFn,
+                                                          tofile="returned"))
+            logging.error(error_message)
+            formatting_mismatch = True
+
+        assert not data_mismatch and not formatting_mismatch
+
+    # Compare the return code to the expected return code
+    wantRC = 0
+    if "return_code" in testObj:
+        wantRC = testObj['return_code']
+    if proc.returncode != wantRC:
+        logging.error("Return code mismatch for " + outputFn)
+        raise Exception
+
+def bctester(testDir, input_basename, buildenv):
+    """ Loads and parses the input file, runs all tests and reports results"""
+    input_filename = testDir + "/" + input_basename
+    raw_data = open(input_filename, encoding='utf8').read()
+    input_data = json.loads(raw_data)
+
+    failed_testcases = []
+
+    for testObj in input_data:
+        try:
+            bctest(testDir, testObj, buildenv.exeext)
+            logging.info("PASSED: " + testObj["description"])
+        except:
+            logging.info("FAILED: " + testObj["description"])
+            failed_testcases.append(testObj["description"])
+
+    if failed_testcases:
+        error_message = "FAILED_TESTCASES:\n"
+        error_message += pprint.pformat(failed_testcases, width=400)
+        logging.error(error_message)
+        sys.exit(1)
+    else:
+        sys.exit(0)
diff --git a/depend/zcash/src/test/bech32_tests.cpp b/depend/zcash/src/test/bech32_tests.cpp
new file mode 100644
index 000000000..8d81644c1
--- /dev/null
+++ b/depend/zcash/src/test/bech32_tests.cpp
@@ -0,0 +1,125 @@
+// Copyright (c) 2017 Pieter Wuille
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "bech32.h"
+#include "test/test_bitcoin.h"
+#include "utilstrencodings.h"
+
+#include <boost/test/unit_test.hpp>
+
+BOOST_FIXTURE_TEST_SUITE(bech32_tests, BasicTestingSetup)
+
+bool CaseInsensitiveEqual(const std::string &s1, const std::string &s2)
+{
+    if (s1.size() != s2.size()) return false;
+    for (size_t i = 0; i < s1.size(); ++i) {
+        char c1 = s1[i];
+        if (c1 >= 'A' && c1 <= 'Z') c1 -= ('A' - 'a');
+        char c2 = s2[i];
+        if (c2 >= 'A' && c2 <= 'Z') c2 -= ('A' - 'a');
+        if (c1 != c2) return false;
+    }
+    return true;
+}
+
+BOOST_AUTO_TEST_CASE(bip173_testvectors_valid)
+{
+    static const std::tuple<std::string, std::string, std::string> CASES[] = {
+        {"A12UEL5L", "a", ""},
+        {"a12uel5l", "a", ""},
+        {
+            "an83characterlonghumanreadablepartthatcontainsthenumber1andtheexcludedcharactersbio1tt5tgs",
+            "an83characterlonghumanreadablepartthatcontainsthenumber1andtheexcludedcharactersbio",
+            "",
+        },
+        {
+            "an84characterslonghumanreadablepartthatcontainsthenumber1andtheexcludedcharactersbio1569pvx",
+            "an84characterslonghumanreadablepartthatcontainsthenumber1andtheexcludedcharactersbio",
+            "",
+        },
+        {"abcdef1qpzry9x8gf2tvdw0s3jn54khce6mua7lmqqqxw", "abcdef", "00443214c74254b635cf84653a56d7c675be77df"},
+        {
+            "11qqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqc8247j",
+            "1",
+            "000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000",
+        },
+        {
+            "split1checkupstagehandshakeupstreamerranterredcaperred2y9e3w",
+            "split",
+            "c5f38b70305f519bf66d85fb6cf03058f3dde463ecd7918f2dc743918f2d",
+        },
+        {"?1ezyfcl", "?", ""},
+    };
+    for (const auto& [str, hrp, data] : CASES) {
+        auto ret = bech32::Decode(str);
+        BOOST_CHECK(!ret.first.empty());
+        BOOST_CHECK_EQUAL(ret.first, hrp);
+
+        std::vector<unsigned char> decoded;
+        decoded.reserve((ret.second.size() * 5) / 8);
+        auto success = ConvertBits<5, 8, false>([&](unsigned char c) { decoded.push_back(c); }, ret.second.begin(), ret.second.end());
+        BOOST_CHECK(success);
+        BOOST_CHECK_EQUAL(HexStr(decoded.begin(), decoded.end()), data);
+
+        std::string recode = bech32::Encode(ret.first, ret.second);
+        BOOST_CHECK(!recode.empty());
+        BOOST_CHECK(CaseInsensitiveEqual(str, recode));
+    }
+}
+
+BOOST_AUTO_TEST_CASE(bip173_testvectors_invalid)
+{
+    static const std::string CASES[] = {
+        " 1nwldj5",
+        "\x7f""1axkwrx",
+        "\x80""1eym55h",
+        "pzry9x0s0muk",
+        "1pzry9x0s0muk",
+        "x1b4n0q5v",
+        "li1dgmt3",
+        "de1lg7wt\xff",
+        "A1G7SGD8",
+        "10a06t8",
+        "1qzzfhee",
+    };
+    for (const std::string& str : CASES) {
+        auto ret = bech32::Decode(str);
+        BOOST_CHECK(ret.first.empty());
+    }
+}
+
+BOOST_AUTO_TEST_CASE(bech32_deterministic_valid)
+{
+    for (size_t i = 0; i < 255; i++) {
+        std::vector<unsigned char> input(32, i);
+        auto encoded = bech32::Encode("a", input);
+        if (i < 32) {
+            // Valid input
+            BOOST_CHECK(!encoded.empty());
+            auto ret = bech32::Decode(encoded);
+            BOOST_CHECK(ret.first == "a");
+            BOOST_CHECK(ret.second == input);
+        } else {
+            // Invalid input
+            BOOST_CHECK(encoded.empty());
+        }
+    }
+
+    for (size_t i = 0; i < 255; i++) {
+        std::vector<unsigned char> input(43, i);
+        auto encoded = bech32::Encode("a", input);
+        if (i < 32) {
+            // Valid input
+            BOOST_CHECK(!encoded.empty());
+            auto ret = bech32::Decode(encoded);
+            BOOST_CHECK(ret.first == "a");
+            BOOST_CHECK(ret.second == input);
+        } else {
+            // Invalid input
+            BOOST_CHECK(encoded.empty());
+        }
+    }
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/bip32_tests.cpp b/depend/zcash/src/test/bip32_tests.cpp
new file mode 100644
index 000000000..2a78dc9d6
--- /dev/null
+++ b/depend/zcash/src/test/bip32_tests.cpp
@@ -0,0 +1,140 @@
+// Copyright (c) 2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include <boost/test/unit_test.hpp>
+
+#include "key.h"
+#include "key_io.h"
+#include "uint256.h"
+#include "util.h"
+#include "utilstrencodings.h"
+#include "test/test_bitcoin.h"
+
+#include <string>
+#include <vector>
+
+struct TestDerivation {
+    std::string pub;
+    std::string prv;
+    unsigned int nChild;
+};
+
+struct TestVector {
+    std::string strHexMaster;
+    std::vector<TestDerivation> vDerive;
+
+    TestVector(std::string strHexMasterIn) : strHexMaster(strHexMasterIn) {}
+
+    TestVector& operator()(std::string pub, std::string prv, unsigned int nChild) {
+        vDerive.push_back(TestDerivation());
+        TestDerivation &der = vDerive.back();
+        der.pub = pub;
+        der.prv = prv;
+        der.nChild = nChild;
+        return *this;
+    }
+};
+
+TestVector test1 =
+  TestVector("000102030405060708090a0b0c0d0e0f")
+    ("xpub661MyMwAqRbcFtXgS5sYJABqqG9YLmC4Q1Rdap9gSE8NqtwybGhePY2gZ29ESFjqJoCu1Rupje8YtGqsefD265TMg7usUDFdp6W1EGMcet8",
+     "xprv9s21ZrQH143K3QTDL4LXw2F7HEK3wJUD2nW2nRk4stbPy6cq3jPPqjiChkVvvNKmPGJxWUtg6LnF5kejMRNNU3TGtRBeJgk33yuGBxrMPHi",
+     0x80000000)
+    ("xpub68Gmy5EdvgibQVfPdqkBBCHxA5htiqg55crXYuXoQRKfDBFA1WEjWgP6LHhwBZeNK1VTsfTFUHCdrfp1bgwQ9xv5ski8PX9rL2dZXvgGDnw",
+     "xprv9uHRZZhk6KAJC1avXpDAp4MDc3sQKNxDiPvvkX8Br5ngLNv1TxvUxt4cV1rGL5hj6KCesnDYUhd7oWgT11eZG7XnxHrnYeSvkzY7d2bhkJ7",
+     1)
+    ("xpub6ASuArnXKPbfEwhqN6e3mwBcDTgzisQN1wXN9BJcM47sSikHjJf3UFHKkNAWbWMiGj7Wf5uMash7SyYq527Hqck2AxYysAA7xmALppuCkwQ",
+     "xprv9wTYmMFdV23N2TdNG573QoEsfRrWKQgWeibmLntzniatZvR9BmLnvSxqu53Kw1UmYPxLgboyZQaXwTCg8MSY3H2EU4pWcQDnRnrVA1xe8fs",
+     0x80000002)
+    ("xpub6D4BDPcP2GT577Vvch3R8wDkScZWzQzMMUm3PWbmWvVJrZwQY4VUNgqFJPMM3No2dFDFGTsxxpG5uJh7n7epu4trkrX7x7DogT5Uv6fcLW5",
+     "xprv9z4pot5VBttmtdRTWfWQmoH1taj2axGVzFqSb8C9xaxKymcFzXBDptWmT7FwuEzG3ryjH4ktypQSAewRiNMjANTtpgP4mLTj34bhnZX7UiM",
+     2)
+    ("xpub6FHa3pjLCk84BayeJxFW2SP4XRrFd1JYnxeLeU8EqN3vDfZmbqBqaGJAyiLjTAwm6ZLRQUMv1ZACTj37sR62cfN7fe5JnJ7dh8zL4fiyLHV",
+     "xprvA2JDeKCSNNZky6uBCviVfJSKyQ1mDYahRjijr5idH2WwLsEd4Hsb2Tyh8RfQMuPh7f7RtyzTtdrbdqqsunu5Mm3wDvUAKRHSC34sJ7in334",
+     1000000000)
+    ("xpub6H1LXWLaKsWFhvm6RVpEL9P4KfRZSW7abD2ttkWP3SSQvnyA8FSVqNTEcYFgJS2UaFcxupHiYkro49S8yGasTvXEYBVPamhGW6cFJodrTHy",
+     "xprvA41z7zogVVwxVSgdKUHDy1SKmdb533PjDz7J6N6mV6uS3ze1ai8FHa8kmHScGpWmj4WggLyQjgPie1rFSruoUihUZREPSL39UNdE3BBDu76",
+     0);
+
+TestVector test2 =
+  TestVector("fffcf9f6f3f0edeae7e4e1dedbd8d5d2cfccc9c6c3c0bdbab7b4b1aeaba8a5a29f9c999693908d8a8784817e7b7875726f6c696663605d5a5754514e4b484542")
+    ("xpub661MyMwAqRbcFW31YEwpkMuc5THy2PSt5bDMsktWQcFF8syAmRUapSCGu8ED9W6oDMSgv6Zz8idoc4a6mr8BDzTJY47LJhkJ8UB7WEGuduB",
+     "xprv9s21ZrQH143K31xYSDQpPDxsXRTUcvj2iNHm5NUtrGiGG5e2DtALGdso3pGz6ssrdK4PFmM8NSpSBHNqPqm55Qn3LqFtT2emdEXVYsCzC2U",
+     0)
+    ("xpub69H7F5d8KSRgmmdJg2KhpAK8SR3DjMwAdkxj3ZuxV27CprR9LgpeyGmXUbC6wb7ERfvrnKZjXoUmmDznezpbZb7ap6r1D3tgFxHmwMkQTPH",
+     "xprv9vHkqa6EV4sPZHYqZznhT2NPtPCjKuDKGY38FBWLvgaDx45zo9WQRUT3dKYnjwih2yJD9mkrocEZXo1ex8G81dwSM1fwqWpWkeS3v86pgKt",
+     0xFFFFFFFF)
+    ("xpub6ASAVgeehLbnwdqV6UKMHVzgqAG8Gr6riv3Fxxpj8ksbH9ebxaEyBLZ85ySDhKiLDBrQSARLq1uNRts8RuJiHjaDMBU4Zn9h8LZNnBC5y4a",
+     "xprv9wSp6B7kry3Vj9m1zSnLvN3xH8RdsPP1Mh7fAaR7aRLcQMKTR2vidYEeEg2mUCTAwCd6vnxVrcjfy2kRgVsFawNzmjuHc2YmYRmagcEPdU9",
+     1)
+    ("xpub6DF8uhdarytz3FWdA8TvFSvvAh8dP3283MY7p2V4SeE2wyWmG5mg5EwVvmdMVCQcoNJxGoWaU9DCWh89LojfZ537wTfunKau47EL2dhHKon",
+     "xprv9zFnWC6h2cLgpmSA46vutJzBcfJ8yaJGg8cX1e5StJh45BBciYTRXSd25UEPVuesF9yog62tGAQtHjXajPPdbRCHuWS6T8XA2ECKADdw4Ef",
+     0xFFFFFFFE)
+    ("xpub6ERApfZwUNrhLCkDtcHTcxd75RbzS1ed54G1LkBUHQVHQKqhMkhgbmJbZRkrgZw4koxb5JaHWkY4ALHY2grBGRjaDMzQLcgJvLJuZZvRcEL",
+     "xprvA1RpRA33e1JQ7ifknakTFpgNXPmW2YvmhqLQYMmrj4xJXXWYpDPS3xz7iAxn8L39njGVyuoseXzU6rcxFLJ8HFsTjSyQbLYnMpCqE2VbFWc",
+     2)
+    ("xpub6FnCn6nSzZAw5Tw7cgR9bi15UV96gLZhjDstkXXxvCLsUXBGXPdSnLFbdpq8p9HmGsApME5hQTZ3emM2rnY5agb9rXpVGyy3bdW6EEgAtqt",
+     "xprvA2nrNbFZABcdryreWet9Ea4LvTJcGsqrMzxHx98MMrotbir7yrKCEXw7nadnHM8Dq38EGfSh6dqA9QWTyefMLEcBYJUuekgW4BYPJcr9E7j",
+     0);
+
+void RunTest(const TestVector &test) {
+    std::vector<unsigned char> seed = ParseHex(test.strHexMaster);
+    CExtKey key = CExtKey::Master(&seed[0], seed.size()).value();
+    CExtPubKey pubkey = key.Neuter();
+    KeyIO keyIO(Params());
+    for (const TestDerivation &derive : test.vDerive) {
+        unsigned char data[74];
+        key.Encode(data);
+        pubkey.Encode(data);
+
+        // Test private key
+        BOOST_CHECK(keyIO.EncodeExtKey(key) == derive.prv);
+        BOOST_CHECK(keyIO.DecodeExtKey(derive.prv) == key); //ensure a base58 decoded key also matches
+
+        // Test public key
+        BOOST_CHECK(keyIO.EncodeExtPubKey(pubkey) == derive.pub);
+        BOOST_CHECK(keyIO.DecodeExtPubKey(derive.pub) == pubkey); //ensure a base58 decoded pubkey also matches
+
+        // Derive new keys
+        auto keyNew = key.Derive(derive.nChild);
+        BOOST_CHECK(keyNew.has_value());
+        CExtPubKey pubkeyNew = keyNew.value().Neuter();
+        if (!(derive.nChild & 0x80000000)) {
+            // Compare with public derivation
+            CExtPubKey pubkeyNew2;
+            BOOST_CHECK(pubkey.Derive(pubkeyNew2, derive.nChild));
+            BOOST_CHECK(pubkeyNew == pubkeyNew2);
+        }
+        key = keyNew.value();
+        pubkey = pubkeyNew;
+
+        CDataStream ssPub(SER_DISK, CLIENT_VERSION);
+        ssPub << pubkeyNew;
+        BOOST_CHECK(ssPub.size() == 75);
+
+        CDataStream ssPriv(SER_DISK, CLIENT_VERSION);
+        ssPriv << keyNew.value();
+        BOOST_CHECK(ssPriv.size() == 75);
+
+        CExtPubKey pubCheck;
+        CExtKey privCheck;
+        ssPub >> pubCheck;
+        ssPriv >> privCheck;
+
+        BOOST_CHECK(pubCheck == pubkeyNew);
+        BOOST_CHECK(privCheck == keyNew);
+    }
+}
+
+BOOST_FIXTURE_TEST_SUITE(bip32_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(bip32_test1) {
+    RunTest(test1);
+}
+
+BOOST_AUTO_TEST_CASE(bip32_test2) {
+    RunTest(test2);
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/bitcoin-util-test.py b/depend/zcash/src/test/bitcoin-util-test.py
new file mode 100755
index 000000000..b0282376d
--- /dev/null
+++ b/depend/zcash/src/test/bitcoin-util-test.py
@@ -0,0 +1,45 @@
+#!/usr/bin/env python3
+# Copyright 2014 BitPay, Inc.
+# Copyright 2016 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+import os
+import bctest
+import buildenv
+import argparse
+import logging
+
+help_text="""Test framework for bitcoin utils.
+
+Runs automatically during `make check`.
+
+Can also be run manually from the src directory by specifying the source directory:
+
+test/bitcoin-util-test.py --srcdir='srcdir' [--verbose]
+"""
+
+if __name__ == '__main__':
+    # Try to get the source directory from the environment variables. This will
+    # be set for `make check` automated runs. If environment variable is not set,
+    # then get the source directory from command line args.
+    try:
+        srcdir = os.environ["srcdir"]
+        verbose = False
+    except:
+        parser = argparse.ArgumentParser(description=help_text)
+        parser.add_argument('-s', '--srcdir')
+        parser.add_argument('-v', '--verbose', action='store_true')
+        args = parser.parse_args()
+        srcdir = args.srcdir
+        verbose = args.verbose
+
+    if verbose:
+        level = logging.DEBUG
+    else:
+        level = logging.ERROR
+    formatter = '%(asctime)s - %(levelname)s - %(message)s'
+    # Add the format/level to the logger
+    logging.basicConfig(format = formatter, level=level)
+
+    bctest.bctester(srcdir + "/test/data", "bitcoin-util-test.json", buildenv)
diff --git a/depend/zcash/src/test/bloom_tests.cpp b/depend/zcash/src/test/bloom_tests.cpp
new file mode 100644
index 000000000..e8807e970
--- /dev/null
+++ b/depend/zcash/src/test/bloom_tests.cpp
@@ -0,0 +1,540 @@
+// Copyright (c) 2012-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "bloom.h"
+
+#include "clientversion.h"
+#include "key.h"
+#include "key_io.h"
+#include "merkleblock.h"
+#include "random.h"
+#include "serialize.h"
+#include "streams.h"
+#include "uint256.h"
+#include "util.h"
+#include "utilstrencodings.h"
+#include "test/test_bitcoin.h"
+
+#include <vector>
+
+#include <boost/test/unit_test.hpp>
+#include <boost/tuple/tuple.hpp>
+
+using namespace std;
+
+BOOST_FIXTURE_TEST_SUITE(bloom_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(bloom_create_insert_serialize)
+{
+    CBloomFilter filter(3, 0.01, 0, BLOOM_UPDATE_ALL);
+
+    BOOST_CHECK_MESSAGE( !filter.contains(ParseHex("99108ad8ed9bb6274d3980bab5a85c048f0950c8")), "Bloom filter should be empty!");
+    filter.insert(ParseHex("99108ad8ed9bb6274d3980bab5a85c048f0950c8"));
+    BOOST_CHECK_MESSAGE( filter.contains(ParseHex("99108ad8ed9bb6274d3980bab5a85c048f0950c8")), "Bloom filter doesn't contain just-inserted object!");
+    // One bit different in first byte
+    BOOST_CHECK_MESSAGE(!filter.contains(ParseHex("19108ad8ed9bb6274d3980bab5a85c048f0950c8")), "Bloom filter contains something it shouldn't!");
+
+    filter.insert(ParseHex("b5a2c786d9ef4658287ced5914b37a1b4aa32eee"));
+    BOOST_CHECK_MESSAGE(filter.contains(ParseHex("b5a2c786d9ef4658287ced5914b37a1b4aa32eee")), "Bloom filter doesn't contain just-inserted object (2)!");
+
+    filter.insert(ParseHex("b9300670b4c5366e95b2699e8b18bc75e5f729c5"));
+    BOOST_CHECK_MESSAGE(filter.contains(ParseHex("b9300670b4c5366e95b2699e8b18bc75e5f729c5")), "Bloom filter doesn't contain just-inserted object (3)!");
+
+    CDataStream stream(SER_NETWORK, PROTOCOL_VERSION);
+    stream << filter;
+
+    vector<unsigned char> vch = ParseHex("03614e9b050000000000000001");
+    vector<char> expected(vch.size());
+
+    for (unsigned int i = 0; i < vch.size(); i++)
+        expected[i] = (char)vch[i];
+
+    BOOST_CHECK_EQUAL_COLLECTIONS(stream.begin(), stream.end(), expected.begin(), expected.end());
+
+    BOOST_CHECK_MESSAGE( filter.contains(ParseHex("99108ad8ed9bb6274d3980bab5a85c048f0950c8")), "Bloom filter doesn't contain just-inserted object!");
+}
+
+BOOST_AUTO_TEST_CASE(bloom_create_insert_serialize_with_tweak)
+{
+    // Same test as bloom_create_insert_serialize, but we add a nTweak of 100
+    CBloomFilter filter(3, 0.01, 2147483649UL, BLOOM_UPDATE_ALL);
+
+    filter.insert(ParseHex("99108ad8ed9bb6274d3980bab5a85c048f0950c8"));
+    BOOST_CHECK_MESSAGE( filter.contains(ParseHex("99108ad8ed9bb6274d3980bab5a85c048f0950c8")), "Bloom filter doesn't contain just-inserted object!");
+    // One bit different in first byte
+    BOOST_CHECK_MESSAGE(!filter.contains(ParseHex("19108ad8ed9bb6274d3980bab5a85c048f0950c8")), "Bloom filter contains something it shouldn't!");
+
+    filter.insert(ParseHex("b5a2c786d9ef4658287ced5914b37a1b4aa32eee"));
+    BOOST_CHECK_MESSAGE(filter.contains(ParseHex("b5a2c786d9ef4658287ced5914b37a1b4aa32eee")), "Bloom filter doesn't contain just-inserted object (2)!");
+
+    filter.insert(ParseHex("b9300670b4c5366e95b2699e8b18bc75e5f729c5"));
+    BOOST_CHECK_MESSAGE(filter.contains(ParseHex("b9300670b4c5366e95b2699e8b18bc75e5f729c5")), "Bloom filter doesn't contain just-inserted object (3)!");
+
+    CDataStream stream(SER_NETWORK, PROTOCOL_VERSION);
+    stream << filter;
+
+    vector<unsigned char> vch = ParseHex("03ce4299050000000100008001");
+    vector<char> expected(vch.size());
+
+    for (unsigned int i = 0; i < vch.size(); i++)
+        expected[i] = (char)vch[i];
+
+    BOOST_CHECK_EQUAL_COLLECTIONS(stream.begin(), stream.end(), expected.begin(), expected.end());
+}
+
+BOOST_AUTO_TEST_CASE(bloom_create_insert_key)
+{
+    KeyIO keyIO(Params());
+    std::string strSecret = std::string("5Kg1gnAjaLfKiwhhPpGS3QfRg2m6awQvaj98JCZBZQ5SuS2F15C");
+    CKey key = keyIO.DecodeSecret(strSecret);
+    CPubKey pubkey = key.GetPubKey();
+    vector<unsigned char> vchPubKey(pubkey.begin(), pubkey.end());
+
+    CBloomFilter filter(2, 0.001, 0, BLOOM_UPDATE_ALL);
+    filter.insert(vchPubKey);
+    uint160 hash = pubkey.GetID();
+    filter.insert(vector<unsigned char>(hash.begin(), hash.end()));
+
+    CDataStream stream(SER_NETWORK, PROTOCOL_VERSION);
+    stream << filter;
+
+    vector<unsigned char> vch = ParseHex("038fc16b080000000000000001");
+    vector<char> expected(vch.size());
+
+    for (unsigned int i = 0; i < vch.size(); i++)
+        expected[i] = (char)vch[i];
+
+    BOOST_CHECK_EQUAL_COLLECTIONS(stream.begin(), stream.end(), expected.begin(), expected.end());
+}
+
+BOOST_AUTO_TEST_CASE(bloom_match)
+{
+    // Random real transaction (b4749f017444b051c44dfd2720e88f314ff94f3dd6d56d40ef65854fcd7fff6b)
+    CTransaction tx;
+    CDataStream stream(ParseHex("01000000010b26e9b7735eb6aabdf358bab62f9816a21ba9ebdb719d5299e88607d722c190000000008b4830450220070aca44506c5cef3a16ed519d7c3c39f8aab192c4e1c90d065f37b8a4af6141022100a8e160b856c2d43d27d8fba71e5aef6405b8643ac4cb7cb3c462aced7f14711a0141046d11fee51b0e60666d5049a9101a72741df480b96ee26488a4d3466b95c9a40ac5eeef87e10a5cd336c19a84565f80fa6c547957b7700ff4dfbdefe76036c339ffffffff021bff3d11000000001976a91404943fdd508053c75000106d3bc6e2754dbcff1988ac2f15de00000000001976a914a266436d2965547608b9e15d9032a7b9d64fa43188ac00000000"), SER_DISK, CLIENT_VERSION);
+    stream >> tx;
+
+    // and one which spends it (e2769b09e784f32f62ef849763d4f45b98e07ba658647343b915ff832b110436)
+    unsigned char ch[] = {0x01, 0x00, 0x00, 0x00, 0x01, 0x6b, 0xff, 0x7f, 0xcd, 0x4f, 0x85, 0x65, 0xef, 0x40, 0x6d, 0xd5, 0xd6, 0x3d, 0x4f, 0xf9, 0x4f, 0x31, 0x8f, 0xe8, 0x20, 0x27, 0xfd, 0x4d, 0xc4, 0x51, 0xb0, 0x44, 0x74, 0x01, 0x9f, 0x74, 0xb4, 0x00, 0x00, 0x00, 0x00, 0x8c, 0x49, 0x30, 0x46, 0x02, 0x21, 0x00, 0xda, 0x0d, 0xc6, 0xae, 0xce, 0xfe, 0x1e, 0x06, 0xef, 0xdf, 0x05, 0x77, 0x37, 0x57, 0xde, 0xb1, 0x68, 0x82, 0x09, 0x30, 0xe3, 0xb0, 0xd0, 0x3f, 0x46, 0xf5, 0xfc, 0xf1, 0x50, 0xbf, 0x99, 0x0c, 0x02, 0x21, 0x00, 0xd2, 0x5b, 0x5c, 0x87, 0x04, 0x00, 0x76, 0xe4, 0xf2, 0x53, 0xf8, 0x26, 0x2e, 0x76, 0x3e, 0x2d, 0xd5, 0x1e, 0x7f, 0xf0, 0xbe, 0x15, 0x77, 0x27, 0xc4, 0xbc, 0x42, 0x80, 0x7f, 0x17, 0xbd, 0x39, 0x01, 0x41, 0x04, 0xe6, 0xc2, 0x6e, 0xf6, 0x7d, 0xc6, 0x10, 0xd2, 0xcd, 0x19, 0x24, 0x84, 0x78, 0x9a, 0x6c, 0xf9, 0xae, 0xa9, 0x93, 0x0b, 0x94, 0x4b, 0x7e, 0x2d, 0xb5, 0x34, 0x2b, 0x9d, 0x9e, 0x5b, 0x9f, 0xf7, 0x9a, 0xff, 0x9a, 0x2e, 0xe1, 0x97, 0x8d, 0xd7, 0xfd, 0x01, 0xdf, 0xc5, 0x22, 0xee, 0x02, 0x28, 0x3d, 0x3b, 0x06, 0xa9, 0xd0, 0x3a, 0xcf, 0x80, 0x96, 0x96, 0x8d, 0x7d, 0xbb, 0x0f, 0x91, 0x78, 0xff, 0xff, 0xff, 0xff, 0x02, 0x8b, 0xa7, 0x94, 0x0e, 0x00, 0x00, 0x00, 0x00, 0x19, 0x76, 0xa9, 0x14, 0xba, 0xde, 0xec, 0xfd, 0xef, 0x05, 0x07, 0x24, 0x7f, 0xc8, 0xf7, 0x42, 0x41, 0xd7, 0x3b, 0xc0, 0x39, 0x97, 0x2d, 0x7b, 0x88, 0xac, 0x40, 0x94, 0xa8, 0x02, 0x00, 0x00, 0x00, 0x00, 0x19, 0x76, 0xa9, 0x14, 0xc1, 0x09, 0x32, 0x48, 0x3f, 0xec, 0x93, 0xed, 0x51, 0xf5, 0xfe, 0x95, 0xe7, 0x25, 0x59, 0xf2, 0xcc, 0x70, 0x43, 0xf9, 0x88, 0xac, 0x00, 0x00, 0x00, 0x00, 0x00};
+    vector<unsigned char> vch(ch, ch + sizeof(ch) -1);
+    CDataStream spendStream(vch, SER_DISK, CLIENT_VERSION);
+    CTransaction spendingTx;
+    spendStream >> spendingTx;
+
+    CBloomFilter filter(10, 0.000001, 0, BLOOM_UPDATE_ALL);
+    filter.insert(uint256S("0xb4749f017444b051c44dfd2720e88f314ff94f3dd6d56d40ef65854fcd7fff6b"));
+    BOOST_CHECK_MESSAGE(filter.IsRelevantAndUpdate(tx), "Simple Bloom filter didn't match tx hash");
+
+    filter = CBloomFilter(10, 0.000001, 0, BLOOM_UPDATE_ALL);
+    // byte-reversed tx hash
+    filter.insert(ParseHex("6bff7fcd4f8565ef406dd5d63d4ff94f318fe82027fd4dc451b04474019f74b4"));
+    BOOST_CHECK_MESSAGE(filter.IsRelevantAndUpdate(tx), "Simple Bloom filter didn't match manually serialized tx hash");
+
+    filter = CBloomFilter(10, 0.000001, 0, BLOOM_UPDATE_ALL);
+    filter.insert(ParseHex("30450220070aca44506c5cef3a16ed519d7c3c39f8aab192c4e1c90d065f37b8a4af6141022100a8e160b856c2d43d27d8fba71e5aef6405b8643ac4cb7cb3c462aced7f14711a01"));
+    BOOST_CHECK_MESSAGE(filter.IsRelevantAndUpdate(tx), "Simple Bloom filter didn't match input signature");
+
+    filter = CBloomFilter(10, 0.000001, 0, BLOOM_UPDATE_ALL);
+    filter.insert(ParseHex("046d11fee51b0e60666d5049a9101a72741df480b96ee26488a4d3466b95c9a40ac5eeef87e10a5cd336c19a84565f80fa6c547957b7700ff4dfbdefe76036c339"));
+    BOOST_CHECK_MESSAGE(filter.IsRelevantAndUpdate(tx), "Simple Bloom filter didn't match input pub key");
+
+    filter = CBloomFilter(10, 0.000001, 0, BLOOM_UPDATE_ALL);
+    filter.insert(ParseHex("04943fdd508053c75000106d3bc6e2754dbcff19"));
+    BOOST_CHECK_MESSAGE(filter.IsRelevantAndUpdate(tx), "Simple Bloom filter didn't match output address");
+    BOOST_CHECK_MESSAGE(filter.IsRelevantAndUpdate(spendingTx), "Simple Bloom filter didn't add output");
+
+    filter = CBloomFilter(10, 0.000001, 0, BLOOM_UPDATE_ALL);
+    filter.insert(ParseHex("a266436d2965547608b9e15d9032a7b9d64fa431"));
+    BOOST_CHECK_MESSAGE(filter.IsRelevantAndUpdate(tx), "Simple Bloom filter didn't match output address");
+
+    filter = CBloomFilter(10, 0.000001, 0, BLOOM_UPDATE_ALL);
+    filter.insert(COutPoint(uint256S("0x90c122d70786e899529d71dbeba91ba216982fb6ba58f3bdaab65e73b7e9260b"), 0));
+    BOOST_CHECK_MESSAGE(filter.IsRelevantAndUpdate(tx), "Simple Bloom filter didn't match COutPoint");
+
+    filter = CBloomFilter(10, 0.000001, 0, BLOOM_UPDATE_ALL);
+    COutPoint prevOutPoint(uint256S("0x90c122d70786e899529d71dbeba91ba216982fb6ba58f3bdaab65e73b7e9260b"), 0);
+    {
+        vector<unsigned char> data(32 + sizeof(unsigned int));
+        memcpy(&data[0], prevOutPoint.hash.begin(), 32);
+        memcpy(&data[32], &prevOutPoint.n, sizeof(unsigned int));
+        filter.insert(data);
+    }
+    BOOST_CHECK_MESSAGE(filter.IsRelevantAndUpdate(tx), "Simple Bloom filter didn't match manually serialized COutPoint");
+
+    filter = CBloomFilter(10, 0.000001, 0, BLOOM_UPDATE_ALL);
+    filter.insert(uint256S("00000009e784f32f62ef849763d4f45b98e07ba658647343b915ff832b110436"));
+    BOOST_CHECK_MESSAGE(!filter.IsRelevantAndUpdate(tx), "Simple Bloom filter matched random tx hash");
+
+    filter = CBloomFilter(10, 0.000001, 0, BLOOM_UPDATE_ALL);
+    filter.insert(ParseHex("0000006d2965547608b9e15d9032a7b9d64fa431"));
+    BOOST_CHECK_MESSAGE(!filter.IsRelevantAndUpdate(tx), "Simple Bloom filter matched random address");
+
+    filter = CBloomFilter(10, 0.000001, 0, BLOOM_UPDATE_ALL);
+    filter.insert(COutPoint(uint256S("0x90c122d70786e899529d71dbeba91ba216982fb6ba58f3bdaab65e73b7e9260b"), 1));
+    BOOST_CHECK_MESSAGE(!filter.IsRelevantAndUpdate(tx), "Simple Bloom filter matched COutPoint for an output we didn't care about");
+
+    filter = CBloomFilter(10, 0.000001, 0, BLOOM_UPDATE_ALL);
+    filter.insert(COutPoint(uint256S("0x000000d70786e899529d71dbeba91ba216982fb6ba58f3bdaab65e73b7e9260b"), 0));
+    BOOST_CHECK_MESSAGE(!filter.IsRelevantAndUpdate(tx), "Simple Bloom filter matched COutPoint for an output we didn't care about");
+}
+
+BOOST_AUTO_TEST_CASE(merkle_block_1)
+{
+    // Random real block (0000000000013b8ab2cd513b0261a14096412195a72a0c4827d229dcc7e0f7af)
+    // With 9 txes
+    CBlock block;
+    CDataStream stream(ParseHex("0100000090f0a9f110702f808219ebea1173056042a714bad51b916cb6800000000000005275289558f51c9966699404ae2294730c3c9f9bda53523ce50e9b95e558da2fdb261b4d4c86041b0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001ab1bf93000901000000010000000000000000000000000000000000000000000000000000000000000000ffffffff07044c86041b0146ffffffff0100f2052a01000000434104e18f7afbe4721580e81e8414fc8c24d7cfacf254bb5c7b949450c3e997c2dc1242487a8169507b631eb3771f2b425483fb13102c4eb5d858eef260fe70fbfae0ac00000000010000000196608ccbafa16abada902780da4dc35dafd7af05fa0da08cf833575f8cf9e836000000004a493046022100dab24889213caf43ae6adc41cf1c9396c08240c199f5225acf45416330fd7dbd022100fe37900e0644bf574493a07fc5edba06dbc07c311b947520c2d514bc5725dcb401ffffffff0100f2052a010000001976a914f15d1921f52e4007b146dfa60f369ed2fc393ce288ac000000000100000001fb766c1288458c2bafcfec81e48b24d98ec706de6b8af7c4e3c29419bfacb56d000000008c493046022100f268ba165ce0ad2e6d93f089cfcd3785de5c963bb5ea6b8c1b23f1ce3e517b9f022100da7c0f21adc6c401887f2bfd1922f11d76159cbc597fbd756a23dcbb00f4d7290141042b4e8625a96127826915a5b109852636ad0da753c9e1d5606a50480cd0c40f1f8b8d898235e571fe9357d9ec842bc4bba1827daaf4de06d71844d0057707966affffffff0280969800000000001976a9146963907531db72d0ed1a0cfb471ccb63923446f388ac80d6e34c000000001976a914f0688ba1c0d1ce182c7af6741e02658c7d4dfcd388ac000000000100000002c40297f730dd7b5a99567eb8d27b78758f607507c52292d02d4031895b52f2ff010000008b483045022100f7edfd4b0aac404e5bab4fd3889e0c6c41aa8d0e6fa122316f68eddd0a65013902205b09cc8b2d56e1cd1f7f2fafd60a129ed94504c4ac7bdc67b56fe67512658b3e014104732012cb962afa90d31b25d8fb0e32c94e513ab7a17805c14ca4c3423e18b4fb5d0e676841733cb83abaf975845c9f6f2a8097b7d04f4908b18368d6fc2d68ecffffffffca5065ff9617cbcba45eb23726df6498a9b9cafed4f54cbab9d227b0035ddefb000000008a473044022068010362a13c7f9919fa832b2dee4e788f61f6f5d344a7c2a0da6ae740605658022006d1af525b9a14a35c003b78b72bd59738cd676f845d1ff3fc25049e01003614014104732012cb962afa90d31b25d8fb0e32c94e513ab7a17805c14ca4c3423e18b4fb5d0e676841733cb83abaf975845c9f6f2a8097b7d04f4908b18368d6fc2d68ecffffffff01001ec4110200000043410469ab4181eceb28985b9b4e895c13fa5e68d85761b7eee311db5addef76fa8621865134a221bd01f28ec9999ee3e021e60766e9d1f3458c115fb28650605f11c9ac000000000100000001cdaf2f758e91c514655e2dc50633d1e4c84989f8aa90a0dbc883f0d23ed5c2fa010000008b48304502207ab51be6f12a1962ba0aaaf24a20e0b69b27a94fac5adf45aa7d2d18ffd9236102210086ae728b370e5329eead9accd880d0cb070aea0c96255fae6c4f1ddcce1fd56e014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffff02404b4c00000000001976a9142b6ba7c9d796b75eef7942fc9288edd37c32f5c388ac002d3101000000001976a9141befba0cdc1ad56529371864d9f6cb042faa06b588ac000000000100000001b4a47603e71b61bc3326efd90111bf02d2f549b067f4c4a8fa183b57a0f800cb010000008a4730440220177c37f9a505c3f1a1f0ce2da777c339bd8339ffa02c7cb41f0a5804f473c9230220585b25a2ee80eb59292e52b987dad92acb0c64eced92ed9ee105ad153cdb12d001410443bd44f683467e549dae7d20d1d79cbdb6df985c6e9c029c8d0c6cb46cc1a4d3cf7923c5021b27f7a0b562ada113bc85d5fda5a1b41e87fe6e8802817cf69996ffffffff0280651406000000001976a9145505614859643ab7b547cd7f1f5e7e2a12322d3788ac00aa0271000000001976a914ea4720a7a52fc166c55ff2298e07baf70ae67e1b88ac00000000010000000586c62cd602d219bb60edb14a3e204de0705176f9022fe49a538054fb14abb49e010000008c493046022100f2bc2aba2534becbdf062eb993853a42bbbc282083d0daf9b4b585bd401aa8c9022100b1d7fd7ee0b95600db8535bbf331b19eed8d961f7a8e54159c53675d5f69df8c014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffff03ad0e58ccdac3df9dc28a218bcf6f1997b0a93306faaa4b3a28ae83447b2179010000008b483045022100be12b2937179da88599e27bb31c3525097a07cdb52422d165b3ca2f2020ffcf702200971b51f853a53d644ebae9ec8f3512e442b1bcb6c315a5b491d119d10624c83014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffff2acfcab629bbc8685792603762c921580030ba144af553d271716a95089e107b010000008b483045022100fa579a840ac258871365dd48cd7552f96c8eea69bd00d84f05b283a0dab311e102207e3c0ee9234814cfbb1b659b83671618f45abc1326b9edcc77d552a4f2a805c0014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffffdcdc6023bbc9944a658ddc588e61eacb737ddf0a3cd24f113b5a8634c517fcd2000000008b4830450221008d6df731df5d32267954bd7d2dda2302b74c6c2a6aa5c0ca64ecbabc1af03c75022010e55c571d65da7701ae2da1956c442df81bbf076cdbac25133f99d98a9ed34c014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffffe15557cd5ce258f479dfd6dc6514edf6d7ed5b21fcfa4a038fd69f06b83ac76e010000008b483045022023b3e0ab071eb11de2eb1cc3a67261b866f86bf6867d4558165f7c8c8aca2d86022100dc6e1f53a91de3efe8f63512850811f26284b62f850c70ca73ed5de8771fb451014104462e76fd4067b3a0aa42070082dcb0bf2f388b6495cf33d789904f07d0f55c40fbd4b82963c69b3dc31895d0c772c812b1d5fbcade15312ef1c0e8ebbb12dcd4ffffffff01404b4c00000000001976a9142b6ba7c9d796b75eef7942fc9288edd37c32f5c388ac00000000010000000166d7577163c932b4f9690ca6a80b6e4eb001f0a2fa9023df5595602aae96ed8d000000008a4730440220262b42546302dfb654a229cefc86432b89628ff259dc87edd1154535b16a67e102207b4634c020a97c3e7bbd0d4d19da6aa2269ad9dded4026e896b213d73ca4b63f014104979b82d02226b3a4597523845754d44f13639e3bf2df5e82c6aab2bdc79687368b01b1ab8b19875ae3c90d661a3d0a33161dab29934edeb36aa01976be3baf8affffffff02404b4c00000000001976a9144854e695a02af0aeacb823ccbc272134561e0a1688ac40420f00000000001976a914abee93376d6b37b5c2940655a6fcaf1c8e74237988ac0000000001000000014e3f8ef2e91349a9059cb4f01e54ab2597c1387161d3da89919f7ea6acdbb371010000008c49304602210081f3183471a5ca22307c0800226f3ef9c353069e0773ac76bb580654d56aa523022100d4c56465bdc069060846f4fbf2f6b20520b2a80b08b168b31e66ddb9c694e240014104976c79848e18251612f8940875b2b08d06e6dc73b9840e8860c066b7e87432c477e9a59a453e71e6d76d5fe34058b800a098fc1740ce3012e8fc8a00c96af966ffffffff02c0e1e400000000001976a9144134e75a6fcb6042034aab5e18570cf1f844f54788ac404b4c00000000001976a9142b6ba7c9d796b75eef7942fc9288edd37c32f5c388ac00000000"), SER_NETWORK, PROTOCOL_VERSION);
+    stream >> block;
+
+    CBloomFilter filter(10, 0.000001, 0, BLOOM_UPDATE_ALL);
+    // Match the last transaction
+    filter.insert(uint256S("0x74d681e0e03bafa802c8aa084379aa98d9fcd632ddc2ed9782b586ec87451f20"));
+
+    CMerkleBlock merkleBlock(block, filter);
+    BOOST_CHECK(merkleBlock.header.GetHash() == block.GetHash());
+
+    BOOST_CHECK(merkleBlock.vMatchedTxn.size() == 1);
+    pair<unsigned int, uint256> pair = merkleBlock.vMatchedTxn[0];
+
+    BOOST_CHECK(merkleBlock.vMatchedTxn[0].second == uint256S("0x74d681e0e03bafa802c8aa084379aa98d9fcd632ddc2ed9782b586ec87451f20"));
+    BOOST_CHECK(merkleBlock.vMatchedTxn[0].first == 8);
+
+    vector<uint256> vMatched;
+    BOOST_CHECK(merkleBlock.txn.ExtractMatches(vMatched) == block.hashMerkleRoot);
+    BOOST_CHECK(vMatched.size() == merkleBlock.vMatchedTxn.size());
+    for (unsigned int i = 0; i < vMatched.size(); i++)
+        BOOST_CHECK(vMatched[i] == merkleBlock.vMatchedTxn[i].second);
+
+    // Also match the 8th transaction
+    filter.insert(uint256S("0xdd1fd2a6fc16404faf339881a90adbde7f4f728691ac62e8f168809cdfae1053"));
+    merkleBlock = CMerkleBlock(block, filter);
+    BOOST_CHECK(merkleBlock.header.GetHash() == block.GetHash());
+
+    BOOST_CHECK(merkleBlock.vMatchedTxn.size() == 2);
+
+    BOOST_CHECK(merkleBlock.vMatchedTxn[1] == pair);
+
+    BOOST_CHECK(merkleBlock.vMatchedTxn[0].second == uint256S("0xdd1fd2a6fc16404faf339881a90adbde7f4f728691ac62e8f168809cdfae1053"));
+    BOOST_CHECK(merkleBlock.vMatchedTxn[0].first == 7);
+
+    BOOST_CHECK(merkleBlock.txn.ExtractMatches(vMatched) == block.hashMerkleRoot);
+    BOOST_CHECK(vMatched.size() == merkleBlock.vMatchedTxn.size());
+    for (unsigned int i = 0; i < vMatched.size(); i++)
+        BOOST_CHECK(vMatched[i] == merkleBlock.vMatchedTxn[i].second);
+}
+
+BOOST_AUTO_TEST_CASE(merkle_block_2)
+{
+    // Random real block (000000005a4ded781e667e06ceefafb71410b511fe0d5adc3e5a27ecbec34ae6)
+    // With 4 txes
+    CBlock block;
+    CDataStream stream(ParseHex("0100000075616236cc2126035fadb38deb65b9102cc2c41c09cdf29fc051906800000000fe7d5e12ef0ff901f6050211249919b1c0653771832b3a80c66cea42847f0ae1d4d26e49ffff001d00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000f0a441000401000000010000000000000000000000000000000000000000000000000000000000000000ffffffff0804ffff001d029105ffffffff0100f2052a010000004341046d8709a041d34357697dfcb30a9d05900a6294078012bf3bb09c6f9b525f1d16d5503d7905db1ada9501446ea00728668fc5719aa80be2fdfc8a858a4dbdd4fbac00000000010000000255605dc6f5c3dc148b6da58442b0b2cd422be385eab2ebea4119ee9c268d28350000000049483045022100aa46504baa86df8a33b1192b1b9367b4d729dc41e389f2c04f3e5c7f0559aae702205e82253a54bf5c4f65b7428551554b2045167d6d206dfe6a2e198127d3f7df1501ffffffff55605dc6f5c3dc148b6da58442b0b2cd422be385eab2ebea4119ee9c268d2835010000004847304402202329484c35fa9d6bb32a55a70c0982f606ce0e3634b69006138683bcd12cbb6602200c28feb1e2555c3210f1dddb299738b4ff8bbe9667b68cb8764b5ac17b7adf0001ffffffff0200e1f505000000004341046a0765b5865641ce08dd39690aade26dfbf5511430ca428a3089261361cef170e3929a68aee3d8d4848b0c5111b0a37b82b86ad559fd2a745b44d8e8d9dfdc0cac00180d8f000000004341044a656f065871a353f216ca26cef8dde2f03e8c16202d2e8ad769f02032cb86a5eb5e56842e92e19141d60a01928f8dd2c875a390f67c1f6c94cfc617c0ea45afac0000000001000000025f9a06d3acdceb56be1bfeaa3e8a25e62d182fa24fefe899d1c17f1dad4c2028000000004847304402205d6058484157235b06028c30736c15613a28bdb768ee628094ca8b0030d4d6eb0220328789c9a2ec27ddaec0ad5ef58efded42e6ea17c2e1ce838f3d6913f5e95db601ffffffff5f9a06d3acdceb56be1bfeaa3e8a25e62d182fa24fefe899d1c17f1dad4c2028010000004a493046022100c45af050d3cea806cedd0ab22520c53ebe63b987b8954146cdca42487b84bdd6022100b9b027716a6b59e640da50a864d6dd8a0ef24c76ce62391fa3eabaf4d2886d2d01ffffffff0200e1f505000000004341046a0765b5865641ce08dd39690aade26dfbf5511430ca428a3089261361cef170e3929a68aee3d8d4848b0c5111b0a37b82b86ad559fd2a745b44d8e8d9dfdc0cac00180d8f000000004341046a0765b5865641ce08dd39690aade26dfbf5511430ca428a3089261361cef170e3929a68aee3d8d4848b0c5111b0a37b82b86ad559fd2a745b44d8e8d9dfdc0cac000000000100000002e2274e5fea1bf29d963914bd301aa63b64daaf8a3e88f119b5046ca5738a0f6b0000000048473044022016e7a727a061ea2254a6c358376aaa617ac537eb836c77d646ebda4c748aac8b0220192ce28bf9f2c06a6467e6531e27648d2b3e2e2bae85159c9242939840295ba501ffffffffe2274e5fea1bf29d963914bd301aa63b64daaf8a3e88f119b5046ca5738a0f6b010000004a493046022100b7a1a755588d4190118936e15cd217d133b0e4a53c3c15924010d5648d8925c9022100aaef031874db2114f2d869ac2de4ae53908fbfea5b2b1862e181626bb9005c9f01ffffffff0200e1f505000000004341044a656f065871a353f216ca26cef8dde2f03e8c16202d2e8ad769f02032cb86a5eb5e56842e92e19141d60a01928f8dd2c875a390f67c1f6c94cfc617c0ea45afac00180d8f000000004341046a0765b5865641ce08dd39690aade26dfbf5511430ca428a3089261361cef170e3929a68aee3d8d4848b0c5111b0a37b82b86ad559fd2a745b44d8e8d9dfdc0cac00000000"), SER_NETWORK, PROTOCOL_VERSION);
+    stream >> block;
+
+    CBloomFilter filter(10, 0.000001, 0, BLOOM_UPDATE_ALL);
+    // Match the first transaction
+    filter.insert(uint256S("0xe980fe9f792d014e73b95203dc1335c5f9ce19ac537a419e6df5b47aecb93b70"));
+
+    CMerkleBlock merkleBlock(block, filter);
+    BOOST_CHECK(merkleBlock.header.GetHash() == block.GetHash());
+
+    BOOST_CHECK(merkleBlock.vMatchedTxn.size() == 1);
+    pair<unsigned int, uint256> pair = merkleBlock.vMatchedTxn[0];
+
+    BOOST_CHECK(merkleBlock.vMatchedTxn[0].second == uint256S("0xe980fe9f792d014e73b95203dc1335c5f9ce19ac537a419e6df5b47aecb93b70"));
+    BOOST_CHECK(merkleBlock.vMatchedTxn[0].first == 0);
+
+    vector<uint256> vMatched;
+    BOOST_CHECK(merkleBlock.txn.ExtractMatches(vMatched) == block.hashMerkleRoot);
+    BOOST_CHECK(vMatched.size() == merkleBlock.vMatchedTxn.size());
+    for (unsigned int i = 0; i < vMatched.size(); i++)
+        BOOST_CHECK(vMatched[i] == merkleBlock.vMatchedTxn[i].second);
+
+    // Match an output from the second transaction (the pubkey for address 1DZTzaBHUDM7T3QvUKBz4qXMRpkg8jsfB5)
+    // This should match the third transaction because it spends the output matched
+    // It also matches the fourth transaction, which spends to the pubkey again
+    filter.insert(ParseHex("044a656f065871a353f216ca26cef8dde2f03e8c16202d2e8ad769f02032cb86a5eb5e56842e92e19141d60a01928f8dd2c875a390f67c1f6c94cfc617c0ea45af"));
+
+    merkleBlock = CMerkleBlock(block, filter);
+    BOOST_CHECK(merkleBlock.header.GetHash() == block.GetHash());
+
+    BOOST_CHECK(merkleBlock.vMatchedTxn.size() == 4);
+
+    BOOST_CHECK(pair == merkleBlock.vMatchedTxn[0]);
+
+    BOOST_CHECK(merkleBlock.vMatchedTxn[1].second == uint256S("0x28204cad1d7fc1d199e8ef4fa22f182de6258a3eaafe1bbe56ebdcacd3069a5f"));
+    BOOST_CHECK(merkleBlock.vMatchedTxn[1].first == 1);
+
+    BOOST_CHECK(merkleBlock.vMatchedTxn[2].second == uint256S("0x6b0f8a73a56c04b519f1883e8aafda643ba61a30bd1439969df21bea5f4e27e2"));
+    BOOST_CHECK(merkleBlock.vMatchedTxn[2].first == 2);
+
+    BOOST_CHECK(merkleBlock.vMatchedTxn[3].second == uint256S("0x3c1d7e82342158e4109df2e0b6348b6e84e403d8b4046d7007663ace63cddb23"));
+    BOOST_CHECK(merkleBlock.vMatchedTxn[3].first == 3);
+
+    BOOST_CHECK(merkleBlock.txn.ExtractMatches(vMatched) == block.hashMerkleRoot);
+    BOOST_CHECK(vMatched.size() == merkleBlock.vMatchedTxn.size());
+    for (unsigned int i = 0; i < vMatched.size(); i++)
+        BOOST_CHECK(vMatched[i] == merkleBlock.vMatchedTxn[i].second);
+}
+
+BOOST_AUTO_TEST_CASE(merkle_block_2_with_update_none)
+{
+    // Random real block (000000005a4ded781e667e06ceefafb71410b511fe0d5adc3e5a27ecbec34ae6)
+    // With 4 txes
+    CBlock block;
+    CDataStream stream(ParseHex("0100000075616236cc2126035fadb38deb65b9102cc2c41c09cdf29fc051906800000000fe7d5e12ef0ff901f6050211249919b1c0653771832b3a80c66cea42847f0ae1d4d26e49ffff001d00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000f0a441000401000000010000000000000000000000000000000000000000000000000000000000000000ffffffff0804ffff001d029105ffffffff0100f2052a010000004341046d8709a041d34357697dfcb30a9d05900a6294078012bf3bb09c6f9b525f1d16d5503d7905db1ada9501446ea00728668fc5719aa80be2fdfc8a858a4dbdd4fbac00000000010000000255605dc6f5c3dc148b6da58442b0b2cd422be385eab2ebea4119ee9c268d28350000000049483045022100aa46504baa86df8a33b1192b1b9367b4d729dc41e389f2c04f3e5c7f0559aae702205e82253a54bf5c4f65b7428551554b2045167d6d206dfe6a2e198127d3f7df1501ffffffff55605dc6f5c3dc148b6da58442b0b2cd422be385eab2ebea4119ee9c268d2835010000004847304402202329484c35fa9d6bb32a55a70c0982f606ce0e3634b69006138683bcd12cbb6602200c28feb1e2555c3210f1dddb299738b4ff8bbe9667b68cb8764b5ac17b7adf0001ffffffff0200e1f505000000004341046a0765b5865641ce08dd39690aade26dfbf5511430ca428a3089261361cef170e3929a68aee3d8d4848b0c5111b0a37b82b86ad559fd2a745b44d8e8d9dfdc0cac00180d8f000000004341044a656f065871a353f216ca26cef8dde2f03e8c16202d2e8ad769f02032cb86a5eb5e56842e92e19141d60a01928f8dd2c875a390f67c1f6c94cfc617c0ea45afac0000000001000000025f9a06d3acdceb56be1bfeaa3e8a25e62d182fa24fefe899d1c17f1dad4c2028000000004847304402205d6058484157235b06028c30736c15613a28bdb768ee628094ca8b0030d4d6eb0220328789c9a2ec27ddaec0ad5ef58efded42e6ea17c2e1ce838f3d6913f5e95db601ffffffff5f9a06d3acdceb56be1bfeaa3e8a25e62d182fa24fefe899d1c17f1dad4c2028010000004a493046022100c45af050d3cea806cedd0ab22520c53ebe63b987b8954146cdca42487b84bdd6022100b9b027716a6b59e640da50a864d6dd8a0ef24c76ce62391fa3eabaf4d2886d2d01ffffffff0200e1f505000000004341046a0765b5865641ce08dd39690aade26dfbf5511430ca428a3089261361cef170e3929a68aee3d8d4848b0c5111b0a37b82b86ad559fd2a745b44d8e8d9dfdc0cac00180d8f000000004341046a0765b5865641ce08dd39690aade26dfbf5511430ca428a3089261361cef170e3929a68aee3d8d4848b0c5111b0a37b82b86ad559fd2a745b44d8e8d9dfdc0cac000000000100000002e2274e5fea1bf29d963914bd301aa63b64daaf8a3e88f119b5046ca5738a0f6b0000000048473044022016e7a727a061ea2254a6c358376aaa617ac537eb836c77d646ebda4c748aac8b0220192ce28bf9f2c06a6467e6531e27648d2b3e2e2bae85159c9242939840295ba501ffffffffe2274e5fea1bf29d963914bd301aa63b64daaf8a3e88f119b5046ca5738a0f6b010000004a493046022100b7a1a755588d4190118936e15cd217d133b0e4a53c3c15924010d5648d8925c9022100aaef031874db2114f2d869ac2de4ae53908fbfea5b2b1862e181626bb9005c9f01ffffffff0200e1f505000000004341044a656f065871a353f216ca26cef8dde2f03e8c16202d2e8ad769f02032cb86a5eb5e56842e92e19141d60a01928f8dd2c875a390f67c1f6c94cfc617c0ea45afac00180d8f000000004341046a0765b5865641ce08dd39690aade26dfbf5511430ca428a3089261361cef170e3929a68aee3d8d4848b0c5111b0a37b82b86ad559fd2a745b44d8e8d9dfdc0cac00000000"), SER_NETWORK, PROTOCOL_VERSION);
+    stream >> block;
+
+    CBloomFilter filter(10, 0.000001, 0, BLOOM_UPDATE_NONE);
+    // Match the first transaction
+    filter.insert(uint256S("0xe980fe9f792d014e73b95203dc1335c5f9ce19ac537a419e6df5b47aecb93b70"));
+
+    CMerkleBlock merkleBlock(block, filter);
+    BOOST_CHECK(merkleBlock.header.GetHash() == block.GetHash());
+
+    BOOST_CHECK(merkleBlock.vMatchedTxn.size() == 1);
+    pair<unsigned int, uint256> pair = merkleBlock.vMatchedTxn[0];
+
+    BOOST_CHECK(merkleBlock.vMatchedTxn[0].second == uint256S("0xe980fe9f792d014e73b95203dc1335c5f9ce19ac537a419e6df5b47aecb93b70"));
+    BOOST_CHECK(merkleBlock.vMatchedTxn[0].first == 0);
+
+    vector<uint256> vMatched;
+    BOOST_CHECK(merkleBlock.txn.ExtractMatches(vMatched) == block.hashMerkleRoot);
+    BOOST_CHECK(vMatched.size() == merkleBlock.vMatchedTxn.size());
+    for (unsigned int i = 0; i < vMatched.size(); i++)
+        BOOST_CHECK(vMatched[i] == merkleBlock.vMatchedTxn[i].second);
+
+    // Match an output from the second transaction (the pubkey for address 1DZTzaBHUDM7T3QvUKBz4qXMRpkg8jsfB5)
+    // This should not match the third transaction though it spends the output matched
+    // It will match the fourth transaction, which has another pay-to-pubkey output to the same address
+    filter.insert(ParseHex("044a656f065871a353f216ca26cef8dde2f03e8c16202d2e8ad769f02032cb86a5eb5e56842e92e19141d60a01928f8dd2c875a390f67c1f6c94cfc617c0ea45af"));
+
+    merkleBlock = CMerkleBlock(block, filter);
+    BOOST_CHECK(merkleBlock.header.GetHash() == block.GetHash());
+
+    BOOST_CHECK(merkleBlock.vMatchedTxn.size() == 3);
+
+    BOOST_CHECK(pair == merkleBlock.vMatchedTxn[0]);
+
+    BOOST_CHECK(merkleBlock.vMatchedTxn[1].second == uint256S("0x28204cad1d7fc1d199e8ef4fa22f182de6258a3eaafe1bbe56ebdcacd3069a5f"));
+    BOOST_CHECK(merkleBlock.vMatchedTxn[1].first == 1);
+
+    BOOST_CHECK(merkleBlock.vMatchedTxn[2].second == uint256S("0x3c1d7e82342158e4109df2e0b6348b6e84e403d8b4046d7007663ace63cddb23"));
+    BOOST_CHECK(merkleBlock.vMatchedTxn[2].first == 3);
+
+    BOOST_CHECK(merkleBlock.txn.ExtractMatches(vMatched) == block.hashMerkleRoot);
+    BOOST_CHECK(vMatched.size() == merkleBlock.vMatchedTxn.size());
+    for (unsigned int i = 0; i < vMatched.size(); i++)
+        BOOST_CHECK(vMatched[i] == merkleBlock.vMatchedTxn[i].second);
+}
+
+BOOST_AUTO_TEST_CASE(merkle_block_3_and_serialize)
+{
+    // Random real block (000000000000dab0130bbcc991d3d7ae6b81aa6f50a798888dfe62337458dc45)
+    // With one tx
+    CBlock block;
+    CDataStream stream(ParseHex("0100000079cda856b143d9db2c1caff01d1aecc8630d30625d10e8b4b8b0000000000000b50cc069d6a3e33e3ff84a5c41d9d3febe7c770fdcc96b2c3ff60abe184f196367291b4d4c86041b0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000008fa45d63000101000000010000000000000000000000000000000000000000000000000000000000000000ffffffff08044c86041b020a02ffffffff0100f2052a01000000434104ecd3229b0571c3be876feaac0442a9f13c5a572742927af1dc623353ecf8c202225f64868137a18cdd85cbbb4c74fbccfd4f49639cf1bdc94a5672bb15ad5d4cac00000000"), SER_NETWORK, PROTOCOL_VERSION);
+    stream >> block;
+
+    CBloomFilter filter(10, 0.000001, 0, BLOOM_UPDATE_ALL);
+    // Match the only transaction
+    filter.insert(uint256S("0x63194f18be0af63f2c6bc9dc0f777cbefed3d9415c4af83f3ee3a3d669c00cb5"));
+
+    CMerkleBlock merkleBlock(block, filter);
+    BOOST_CHECK(merkleBlock.header.GetHash() == block.GetHash());
+
+    BOOST_CHECK(merkleBlock.vMatchedTxn.size() == 1);
+
+    BOOST_CHECK(merkleBlock.vMatchedTxn[0].second == uint256S("0x63194f18be0af63f2c6bc9dc0f777cbefed3d9415c4af83f3ee3a3d669c00cb5"));
+    BOOST_CHECK(merkleBlock.vMatchedTxn[0].first == 0);
+
+    vector<uint256> vMatched;
+    BOOST_CHECK(merkleBlock.txn.ExtractMatches(vMatched) == block.hashMerkleRoot);
+    BOOST_CHECK(vMatched.size() == merkleBlock.vMatchedTxn.size());
+    for (unsigned int i = 0; i < vMatched.size(); i++)
+        BOOST_CHECK(vMatched[i] == merkleBlock.vMatchedTxn[i].second);
+
+    CDataStream merkleStream(SER_NETWORK, PROTOCOL_VERSION);
+    merkleStream << merkleBlock;
+
+    vector<unsigned char> vch = ParseHex("0100000079cda856b143d9db2c1caff01d1aecc8630d30625d10e8b4b8b0000000000000b50cc069d6a3e33e3ff84a5c41d9d3febe7c770fdcc96b2c3ff60abe184f196367291b4d4c86041b0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000008fa45d63000100000001b50cc069d6a3e33e3ff84a5c41d9d3febe7c770fdcc96b2c3ff60abe184f19630101");
+    vector<char> expected(vch.size());
+
+    for (unsigned int i = 0; i < vch.size(); i++)
+        expected[i] = (char)vch[i];
+
+    BOOST_CHECK_EQUAL_COLLECTIONS(expected.begin(), expected.end(), merkleStream.begin(), merkleStream.end());
+}
+
+BOOST_AUTO_TEST_CASE(merkle_block_4)
+{
+    // Random real block (000000000000b731f2eef9e8c63173adfb07e41bd53eb0ef0a6b720d6cb6dea4)
+    // With 7 txes
+    CBlock block;
+    CDataStream stream(ParseHex("0100000082bb869cf3a793432a66e826e05a6fc37469f8efb7421dc880670100000000007f16c5962e8bd963659c793ce370d95f093bc7e367117b3c30c1f8fdd0d9728776381b4d4c86041b000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000554b8529000701000000010000000000000000000000000000000000000000000000000000000000000000ffffffff07044c86041b0136ffffffff0100f2052a01000000434104eaafc2314def4ca98ac970241bcab022b9c1e1f4ea423a20f134c876f2c01ec0f0dd5b2e86e7168cefe0d81113c3807420ce13ad1357231a2252247d97a46a91ac000000000100000001bcad20a6a29827d1424f08989255120bf7f3e9e3cdaaa6bb31b0737fe048724300000000494830450220356e834b046cadc0f8ebb5a8a017b02de59c86305403dad52cd77b55af062ea10221009253cd6c119d4729b77c978e1e2aa19f5ea6e0e52b3f16e32fa608cd5bab753901ffffffff02008d380c010000001976a9142b4b8072ecbba129b6453c63e129e643207249ca88ac0065cd1d000000001976a9141b8dd13b994bcfc787b32aeadf58ccb3615cbd5488ac000000000100000003fdacf9b3eb077412e7a968d2e4f11b9a9dee312d666187ed77ee7d26af16cb0b000000008c493046022100ea1608e70911ca0de5af51ba57ad23b9a51db8d28f82c53563c56a05c20f5a87022100a8bdc8b4a8acc8634c6b420410150775eb7f2474f5615f7fccd65af30f310fbf01410465fdf49e29b06b9a1582287b6279014f834edc317695d125ef623c1cc3aaece245bd69fcad7508666e9c74a49dc9056d5fc14338ef38118dc4afae5fe2c585caffffffff309e1913634ecb50f3c4f83e96e70b2df071b497b8973a3e75429df397b5af83000000004948304502202bdb79c596a9ffc24e96f4386199aba386e9bc7b6071516e2b51dda942b3a1ed022100c53a857e76b724fc14d45311eac5019650d415c3abb5428f3aae16d8e69bec2301ffffffff2089e33491695080c9edc18a428f7d834db5b6d372df13ce2b1b0e0cbcb1e6c10000000049483045022100d4ce67c5896ee251c810ac1ff9ceccd328b497c8f553ab6e08431e7d40bad6b5022033119c0c2b7d792d31f1187779c7bd95aefd93d90a715586d73801d9b47471c601ffffffff0100714460030000001976a914c7b55141d097ea5df7a0ed330cf794376e53ec8d88ac0000000001000000045bf0e214aa4069a3e792ecee1e1bf0c1d397cde8dd08138f4b72a00681743447000000008b48304502200c45de8c4f3e2c1821f2fc878cba97b1e6f8807d94930713aa1c86a67b9bf1e40221008581abfef2e30f957815fc89978423746b2086375ca8ecf359c85c2a5b7c88ad01410462bb73f76ca0994fcb8b4271e6fb7561f5c0f9ca0cf6485261c4a0dc894f4ab844c6cdfb97cd0b60ffb5018ffd6238f4d87270efb1d3ae37079b794a92d7ec95ffffffffd669f7d7958d40fc59d2253d88e0f248e29b599c80bbcec344a83dda5f9aa72c000000008a473044022078124c8beeaa825f9e0b30bff96e564dd859432f2d0cb3b72d3d5d93d38d7e930220691d233b6c0f995be5acb03d70a7f7a65b6bc9bdd426260f38a1346669507a3601410462bb73f76ca0994fcb8b4271e6fb7561f5c0f9ca0cf6485261c4a0dc894f4ab844c6cdfb97cd0b60ffb5018ffd6238f4d87270efb1d3ae37079b794a92d7ec95fffffffff878af0d93f5229a68166cf051fd372bb7a537232946e0a46f53636b4dafdaa4000000008c493046022100c717d1714551663f69c3c5759bdbb3a0fcd3fab023abc0e522fe6440de35d8290221008d9cbe25bffc44af2b18e81c58eb37293fd7fe1c2e7b46fc37ee8c96c50ab1e201410462bb73f76ca0994fcb8b4271e6fb7561f5c0f9ca0cf6485261c4a0dc894f4ab844c6cdfb97cd0b60ffb5018ffd6238f4d87270efb1d3ae37079b794a92d7ec95ffffffff27f2b668859cd7f2f894aa0fd2d9e60963bcd07c88973f425f999b8cbfd7a1e2000000008c493046022100e00847147cbf517bcc2f502f3ddc6d284358d102ed20d47a8aa788a62f0db780022100d17b2d6fa84dcaf1c95d88d7e7c30385aecf415588d749afd3ec81f6022cecd701410462bb73f76ca0994fcb8b4271e6fb7561f5c0f9ca0cf6485261c4a0dc894f4ab844c6cdfb97cd0b60ffb5018ffd6238f4d87270efb1d3ae37079b794a92d7ec95ffffffff0100c817a8040000001976a914b6efd80d99179f4f4ff6f4dd0a007d018c385d2188ac000000000100000001834537b2f1ce8ef9373a258e10545ce5a50b758df616cd4356e0032554ebd3c4000000008b483045022100e68f422dd7c34fdce11eeb4509ddae38201773dd62f284e8aa9d96f85099d0b002202243bd399ff96b649a0fad05fa759d6a882f0af8c90cf7632c2840c29070aec20141045e58067e815c2f464c6a2a15f987758374203895710c2d452442e28496ff38ba8f5fd901dc20e29e88477167fe4fc299bf818fd0d9e1632d467b2a3d9503b1aaffffffff0280d7e636030000001976a914f34c3e10eb387efe872acb614c89e78bfca7815d88ac404b4c00000000001976a914a84e272933aaf87e1715d7786c51dfaeb5b65a6f88ac00000000010000000143ac81c8e6f6ef307dfe17f3d906d999e23e0189fda838c5510d850927e03ae7000000008c4930460221009c87c344760a64cb8ae6685a3eec2c1ac1bed5b88c87de51acd0e124f266c16602210082d07c037359c3a257b5c63ebd90f5a5edf97b2ac1c434b08ca998839f346dd40141040ba7e521fa7946d12edbb1d1e95a15c34bd4398195e86433c92b431cd315f455fe30032ede69cad9d1e1ed6c3c4ec0dbfced53438c625462afb792dcb098544bffffffff0240420f00000000001976a9144676d1b820d63ec272f1900d59d43bc6463d96f888ac40420f00000000001976a914648d04341d00d7968b3405c034adc38d4d8fb9bd88ac00000000010000000248cc917501ea5c55f4a8d2009c0567c40cfe037c2e71af017d0a452ff705e3f1000000008b483045022100bf5fdc86dc5f08a5d5c8e43a8c9d5b1ed8c65562e280007b52b133021acd9acc02205e325d613e555f772802bf413d36ba807892ed1a690a77811d3033b3de226e0a01410429fa713b124484cb2bd7b5557b2c0b9df7b2b1fee61825eadc5ae6c37a9920d38bfccdc7dc3cb0c47d7b173dbc9db8d37db0a33ae487982c59c6f8606e9d1791ffffffff41ed70551dd7e841883ab8f0b16bf04176b7d1480e4f0af9f3d4c3595768d068000000008b4830450221008513ad65187b903aed1102d1d0c47688127658c51106753fed0151ce9c16b80902201432b9ebcb87bd04ceb2de66035fbbaf4bf8b00d1cfe41f1a1f7338f9ad79d210141049d4cf80125bf50be1709f718c07ad15d0fc612b7da1f5570dddc35f2a352f0f27c978b06820edca9ef982c35fda2d255afba340068c5035552368bc7200c1488ffffffff0100093d00000000001976a9148edb68822f1ad580b043c7b3df2e400f8699eb4888ac00000000"), SER_NETWORK, PROTOCOL_VERSION);
+    stream >> block;
+
+    CBloomFilter filter(10, 0.000001, 0, BLOOM_UPDATE_ALL);
+    // Match the last transaction
+    filter.insert(uint256S("0x0a2a92f0bda4727d0a13eaddf4dd9ac6b5c61a1429e6b2b818f19b15df0ac154"));
+
+    CMerkleBlock merkleBlock(block, filter);
+    BOOST_CHECK(merkleBlock.header.GetHash() == block.GetHash());
+
+    BOOST_CHECK(merkleBlock.vMatchedTxn.size() == 1);
+    pair<unsigned int, uint256> pair = merkleBlock.vMatchedTxn[0];
+
+    BOOST_CHECK(merkleBlock.vMatchedTxn[0].second == uint256S("0x0a2a92f0bda4727d0a13eaddf4dd9ac6b5c61a1429e6b2b818f19b15df0ac154"));
+    BOOST_CHECK(merkleBlock.vMatchedTxn[0].first == 6);
+
+    vector<uint256> vMatched;
+    BOOST_CHECK(merkleBlock.txn.ExtractMatches(vMatched) == block.hashMerkleRoot);
+    BOOST_CHECK(vMatched.size() == merkleBlock.vMatchedTxn.size());
+    for (unsigned int i = 0; i < vMatched.size(); i++)
+        BOOST_CHECK(vMatched[i] == merkleBlock.vMatchedTxn[i].second);
+
+    // Also match the 4th transaction
+    filter.insert(uint256S("0x02981fa052f0481dbc5868f4fc2166035a10f27a03cfd2de67326471df5bc041"));
+    merkleBlock = CMerkleBlock(block, filter);
+    BOOST_CHECK(merkleBlock.header.GetHash() == block.GetHash());
+
+    BOOST_CHECK(merkleBlock.vMatchedTxn.size() == 2);
+
+    BOOST_CHECK(merkleBlock.vMatchedTxn[0].second == uint256S("0x02981fa052f0481dbc5868f4fc2166035a10f27a03cfd2de67326471df5bc041"));
+    BOOST_CHECK(merkleBlock.vMatchedTxn[0].first == 3);
+
+    BOOST_CHECK(merkleBlock.vMatchedTxn[1] == pair);
+
+    BOOST_CHECK(merkleBlock.txn.ExtractMatches(vMatched) == block.hashMerkleRoot);
+    BOOST_CHECK(vMatched.size() == merkleBlock.vMatchedTxn.size());
+    for (unsigned int i = 0; i < vMatched.size(); i++)
+        BOOST_CHECK(vMatched[i] == merkleBlock.vMatchedTxn[i].second);
+}
+
+BOOST_AUTO_TEST_CASE(merkle_block_4_test_p2pubkey_only)
+{
+    // Random real block (000000000000b731f2eef9e8c63173adfb07e41bd53eb0ef0a6b720d6cb6dea4)
+    // With 7 txes
+    CBlock block;
+    CDataStream stream(ParseHex("0100000082bb869cf3a793432a66e826e05a6fc37469f8efb7421dc880670100000000007f16c5962e8bd963659c793ce370d95f093bc7e367117b3c30c1f8fdd0d9728776381b4d4c86041b000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000554b8529000701000000010000000000000000000000000000000000000000000000000000000000000000ffffffff07044c86041b0136ffffffff0100f2052a01000000434104eaafc2314def4ca98ac970241bcab022b9c1e1f4ea423a20f134c876f2c01ec0f0dd5b2e86e7168cefe0d81113c3807420ce13ad1357231a2252247d97a46a91ac000000000100000001bcad20a6a29827d1424f08989255120bf7f3e9e3cdaaa6bb31b0737fe048724300000000494830450220356e834b046cadc0f8ebb5a8a017b02de59c86305403dad52cd77b55af062ea10221009253cd6c119d4729b77c978e1e2aa19f5ea6e0e52b3f16e32fa608cd5bab753901ffffffff02008d380c010000001976a9142b4b8072ecbba129b6453c63e129e643207249ca88ac0065cd1d000000001976a9141b8dd13b994bcfc787b32aeadf58ccb3615cbd5488ac000000000100000003fdacf9b3eb077412e7a968d2e4f11b9a9dee312d666187ed77ee7d26af16cb0b000000008c493046022100ea1608e70911ca0de5af51ba57ad23b9a51db8d28f82c53563c56a05c20f5a87022100a8bdc8b4a8acc8634c6b420410150775eb7f2474f5615f7fccd65af30f310fbf01410465fdf49e29b06b9a1582287b6279014f834edc317695d125ef623c1cc3aaece245bd69fcad7508666e9c74a49dc9056d5fc14338ef38118dc4afae5fe2c585caffffffff309e1913634ecb50f3c4f83e96e70b2df071b497b8973a3e75429df397b5af83000000004948304502202bdb79c596a9ffc24e96f4386199aba386e9bc7b6071516e2b51dda942b3a1ed022100c53a857e76b724fc14d45311eac5019650d415c3abb5428f3aae16d8e69bec2301ffffffff2089e33491695080c9edc18a428f7d834db5b6d372df13ce2b1b0e0cbcb1e6c10000000049483045022100d4ce67c5896ee251c810ac1ff9ceccd328b497c8f553ab6e08431e7d40bad6b5022033119c0c2b7d792d31f1187779c7bd95aefd93d90a715586d73801d9b47471c601ffffffff0100714460030000001976a914c7b55141d097ea5df7a0ed330cf794376e53ec8d88ac0000000001000000045bf0e214aa4069a3e792ecee1e1bf0c1d397cde8dd08138f4b72a00681743447000000008b48304502200c45de8c4f3e2c1821f2fc878cba97b1e6f8807d94930713aa1c86a67b9bf1e40221008581abfef2e30f957815fc89978423746b2086375ca8ecf359c85c2a5b7c88ad01410462bb73f76ca0994fcb8b4271e6fb7561f5c0f9ca0cf6485261c4a0dc894f4ab844c6cdfb97cd0b60ffb5018ffd6238f4d87270efb1d3ae37079b794a92d7ec95ffffffffd669f7d7958d40fc59d2253d88e0f248e29b599c80bbcec344a83dda5f9aa72c000000008a473044022078124c8beeaa825f9e0b30bff96e564dd859432f2d0cb3b72d3d5d93d38d7e930220691d233b6c0f995be5acb03d70a7f7a65b6bc9bdd426260f38a1346669507a3601410462bb73f76ca0994fcb8b4271e6fb7561f5c0f9ca0cf6485261c4a0dc894f4ab844c6cdfb97cd0b60ffb5018ffd6238f4d87270efb1d3ae37079b794a92d7ec95fffffffff878af0d93f5229a68166cf051fd372bb7a537232946e0a46f53636b4dafdaa4000000008c493046022100c717d1714551663f69c3c5759bdbb3a0fcd3fab023abc0e522fe6440de35d8290221008d9cbe25bffc44af2b18e81c58eb37293fd7fe1c2e7b46fc37ee8c96c50ab1e201410462bb73f76ca0994fcb8b4271e6fb7561f5c0f9ca0cf6485261c4a0dc894f4ab844c6cdfb97cd0b60ffb5018ffd6238f4d87270efb1d3ae37079b794a92d7ec95ffffffff27f2b668859cd7f2f894aa0fd2d9e60963bcd07c88973f425f999b8cbfd7a1e2000000008c493046022100e00847147cbf517bcc2f502f3ddc6d284358d102ed20d47a8aa788a62f0db780022100d17b2d6fa84dcaf1c95d88d7e7c30385aecf415588d749afd3ec81f6022cecd701410462bb73f76ca0994fcb8b4271e6fb7561f5c0f9ca0cf6485261c4a0dc894f4ab844c6cdfb97cd0b60ffb5018ffd6238f4d87270efb1d3ae37079b794a92d7ec95ffffffff0100c817a8040000001976a914b6efd80d99179f4f4ff6f4dd0a007d018c385d2188ac000000000100000001834537b2f1ce8ef9373a258e10545ce5a50b758df616cd4356e0032554ebd3c4000000008b483045022100e68f422dd7c34fdce11eeb4509ddae38201773dd62f284e8aa9d96f85099d0b002202243bd399ff96b649a0fad05fa759d6a882f0af8c90cf7632c2840c29070aec20141045e58067e815c2f464c6a2a15f987758374203895710c2d452442e28496ff38ba8f5fd901dc20e29e88477167fe4fc299bf818fd0d9e1632d467b2a3d9503b1aaffffffff0280d7e636030000001976a914f34c3e10eb387efe872acb614c89e78bfca7815d88ac404b4c00000000001976a914a84e272933aaf87e1715d7786c51dfaeb5b65a6f88ac00000000010000000143ac81c8e6f6ef307dfe17f3d906d999e23e0189fda838c5510d850927e03ae7000000008c4930460221009c87c344760a64cb8ae6685a3eec2c1ac1bed5b88c87de51acd0e124f266c16602210082d07c037359c3a257b5c63ebd90f5a5edf97b2ac1c434b08ca998839f346dd40141040ba7e521fa7946d12edbb1d1e95a15c34bd4398195e86433c92b431cd315f455fe30032ede69cad9d1e1ed6c3c4ec0dbfced53438c625462afb792dcb098544bffffffff0240420f00000000001976a9144676d1b820d63ec272f1900d59d43bc6463d96f888ac40420f00000000001976a914648d04341d00d7968b3405c034adc38d4d8fb9bd88ac00000000010000000248cc917501ea5c55f4a8d2009c0567c40cfe037c2e71af017d0a452ff705e3f1000000008b483045022100bf5fdc86dc5f08a5d5c8e43a8c9d5b1ed8c65562e280007b52b133021acd9acc02205e325d613e555f772802bf413d36ba807892ed1a690a77811d3033b3de226e0a01410429fa713b124484cb2bd7b5557b2c0b9df7b2b1fee61825eadc5ae6c37a9920d38bfccdc7dc3cb0c47d7b173dbc9db8d37db0a33ae487982c59c6f8606e9d1791ffffffff41ed70551dd7e841883ab8f0b16bf04176b7d1480e4f0af9f3d4c3595768d068000000008b4830450221008513ad65187b903aed1102d1d0c47688127658c51106753fed0151ce9c16b80902201432b9ebcb87bd04ceb2de66035fbbaf4bf8b00d1cfe41f1a1f7338f9ad79d210141049d4cf80125bf50be1709f718c07ad15d0fc612b7da1f5570dddc35f2a352f0f27c978b06820edca9ef982c35fda2d255afba340068c5035552368bc7200c1488ffffffff0100093d00000000001976a9148edb68822f1ad580b043c7b3df2e400f8699eb4888ac00000000"), SER_NETWORK, PROTOCOL_VERSION);
+    stream >> block;
+
+    CBloomFilter filter(10, 0.000001, 0, BLOOM_UPDATE_P2PUBKEY_ONLY);
+    // Match the generation pubkey
+    filter.insert(ParseHex("04eaafc2314def4ca98ac970241bcab022b9c1e1f4ea423a20f134c876f2c01ec0f0dd5b2e86e7168cefe0d81113c3807420ce13ad1357231a2252247d97a46a91"));
+    // ...and the output address of the 4th transaction
+    filter.insert(ParseHex("b6efd80d99179f4f4ff6f4dd0a007d018c385d21"));
+
+    CMerkleBlock merkleBlock(block, filter);
+    BOOST_CHECK(merkleBlock.header.GetHash() == block.GetHash());
+
+    // We should match the generation outpoint
+    BOOST_CHECK(filter.contains(COutPoint(uint256S("0x147caa76786596590baa4e98f5d9f48b86c7765e489f7a6ff3360fe5c674360b"), 0)));
+    // ... but not the 4th transaction's output (its not pay-2-pubkey)
+    BOOST_CHECK(!filter.contains(COutPoint(uint256S("0x02981fa052f0481dbc5868f4fc2166035a10f27a03cfd2de67326471df5bc041"), 0)));
+}
+
+BOOST_AUTO_TEST_CASE(merkle_block_4_test_update_none)
+{
+    // Random real block (000000000000b731f2eef9e8c63173adfb07e41bd53eb0ef0a6b720d6cb6dea4)
+    // With 7 txes
+    CBlock block;
+    CDataStream stream(ParseHex("0100000082bb869cf3a793432a66e826e05a6fc37469f8efb7421dc880670100000000007f16c5962e8bd963659c793ce370d95f093bc7e367117b3c30c1f8fdd0d9728776381b4d4c86041b000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000554b8529000701000000010000000000000000000000000000000000000000000000000000000000000000ffffffff07044c86041b0136ffffffff0100f2052a01000000434104eaafc2314def4ca98ac970241bcab022b9c1e1f4ea423a20f134c876f2c01ec0f0dd5b2e86e7168cefe0d81113c3807420ce13ad1357231a2252247d97a46a91ac000000000100000001bcad20a6a29827d1424f08989255120bf7f3e9e3cdaaa6bb31b0737fe048724300000000494830450220356e834b046cadc0f8ebb5a8a017b02de59c86305403dad52cd77b55af062ea10221009253cd6c119d4729b77c978e1e2aa19f5ea6e0e52b3f16e32fa608cd5bab753901ffffffff02008d380c010000001976a9142b4b8072ecbba129b6453c63e129e643207249ca88ac0065cd1d000000001976a9141b8dd13b994bcfc787b32aeadf58ccb3615cbd5488ac000000000100000003fdacf9b3eb077412e7a968d2e4f11b9a9dee312d666187ed77ee7d26af16cb0b000000008c493046022100ea1608e70911ca0de5af51ba57ad23b9a51db8d28f82c53563c56a05c20f5a87022100a8bdc8b4a8acc8634c6b420410150775eb7f2474f5615f7fccd65af30f310fbf01410465fdf49e29b06b9a1582287b6279014f834edc317695d125ef623c1cc3aaece245bd69fcad7508666e9c74a49dc9056d5fc14338ef38118dc4afae5fe2c585caffffffff309e1913634ecb50f3c4f83e96e70b2df071b497b8973a3e75429df397b5af83000000004948304502202bdb79c596a9ffc24e96f4386199aba386e9bc7b6071516e2b51dda942b3a1ed022100c53a857e76b724fc14d45311eac5019650d415c3abb5428f3aae16d8e69bec2301ffffffff2089e33491695080c9edc18a428f7d834db5b6d372df13ce2b1b0e0cbcb1e6c10000000049483045022100d4ce67c5896ee251c810ac1ff9ceccd328b497c8f553ab6e08431e7d40bad6b5022033119c0c2b7d792d31f1187779c7bd95aefd93d90a715586d73801d9b47471c601ffffffff0100714460030000001976a914c7b55141d097ea5df7a0ed330cf794376e53ec8d88ac0000000001000000045bf0e214aa4069a3e792ecee1e1bf0c1d397cde8dd08138f4b72a00681743447000000008b48304502200c45de8c4f3e2c1821f2fc878cba97b1e6f8807d94930713aa1c86a67b9bf1e40221008581abfef2e30f957815fc89978423746b2086375ca8ecf359c85c2a5b7c88ad01410462bb73f76ca0994fcb8b4271e6fb7561f5c0f9ca0cf6485261c4a0dc894f4ab844c6cdfb97cd0b60ffb5018ffd6238f4d87270efb1d3ae37079b794a92d7ec95ffffffffd669f7d7958d40fc59d2253d88e0f248e29b599c80bbcec344a83dda5f9aa72c000000008a473044022078124c8beeaa825f9e0b30bff96e564dd859432f2d0cb3b72d3d5d93d38d7e930220691d233b6c0f995be5acb03d70a7f7a65b6bc9bdd426260f38a1346669507a3601410462bb73f76ca0994fcb8b4271e6fb7561f5c0f9ca0cf6485261c4a0dc894f4ab844c6cdfb97cd0b60ffb5018ffd6238f4d87270efb1d3ae37079b794a92d7ec95fffffffff878af0d93f5229a68166cf051fd372bb7a537232946e0a46f53636b4dafdaa4000000008c493046022100c717d1714551663f69c3c5759bdbb3a0fcd3fab023abc0e522fe6440de35d8290221008d9cbe25bffc44af2b18e81c58eb37293fd7fe1c2e7b46fc37ee8c96c50ab1e201410462bb73f76ca0994fcb8b4271e6fb7561f5c0f9ca0cf6485261c4a0dc894f4ab844c6cdfb97cd0b60ffb5018ffd6238f4d87270efb1d3ae37079b794a92d7ec95ffffffff27f2b668859cd7f2f894aa0fd2d9e60963bcd07c88973f425f999b8cbfd7a1e2000000008c493046022100e00847147cbf517bcc2f502f3ddc6d284358d102ed20d47a8aa788a62f0db780022100d17b2d6fa84dcaf1c95d88d7e7c30385aecf415588d749afd3ec81f6022cecd701410462bb73f76ca0994fcb8b4271e6fb7561f5c0f9ca0cf6485261c4a0dc894f4ab844c6cdfb97cd0b60ffb5018ffd6238f4d87270efb1d3ae37079b794a92d7ec95ffffffff0100c817a8040000001976a914b6efd80d99179f4f4ff6f4dd0a007d018c385d2188ac000000000100000001834537b2f1ce8ef9373a258e10545ce5a50b758df616cd4356e0032554ebd3c4000000008b483045022100e68f422dd7c34fdce11eeb4509ddae38201773dd62f284e8aa9d96f85099d0b002202243bd399ff96b649a0fad05fa759d6a882f0af8c90cf7632c2840c29070aec20141045e58067e815c2f464c6a2a15f987758374203895710c2d452442e28496ff38ba8f5fd901dc20e29e88477167fe4fc299bf818fd0d9e1632d467b2a3d9503b1aaffffffff0280d7e636030000001976a914f34c3e10eb387efe872acb614c89e78bfca7815d88ac404b4c00000000001976a914a84e272933aaf87e1715d7786c51dfaeb5b65a6f88ac00000000010000000143ac81c8e6f6ef307dfe17f3d906d999e23e0189fda838c5510d850927e03ae7000000008c4930460221009c87c344760a64cb8ae6685a3eec2c1ac1bed5b88c87de51acd0e124f266c16602210082d07c037359c3a257b5c63ebd90f5a5edf97b2ac1c434b08ca998839f346dd40141040ba7e521fa7946d12edbb1d1e95a15c34bd4398195e86433c92b431cd315f455fe30032ede69cad9d1e1ed6c3c4ec0dbfced53438c625462afb792dcb098544bffffffff0240420f00000000001976a9144676d1b820d63ec272f1900d59d43bc6463d96f888ac40420f00000000001976a914648d04341d00d7968b3405c034adc38d4d8fb9bd88ac00000000010000000248cc917501ea5c55f4a8d2009c0567c40cfe037c2e71af017d0a452ff705e3f1000000008b483045022100bf5fdc86dc5f08a5d5c8e43a8c9d5b1ed8c65562e280007b52b133021acd9acc02205e325d613e555f772802bf413d36ba807892ed1a690a77811d3033b3de226e0a01410429fa713b124484cb2bd7b5557b2c0b9df7b2b1fee61825eadc5ae6c37a9920d38bfccdc7dc3cb0c47d7b173dbc9db8d37db0a33ae487982c59c6f8606e9d1791ffffffff41ed70551dd7e841883ab8f0b16bf04176b7d1480e4f0af9f3d4c3595768d068000000008b4830450221008513ad65187b903aed1102d1d0c47688127658c51106753fed0151ce9c16b80902201432b9ebcb87bd04ceb2de66035fbbaf4bf8b00d1cfe41f1a1f7338f9ad79d210141049d4cf80125bf50be1709f718c07ad15d0fc612b7da1f5570dddc35f2a352f0f27c978b06820edca9ef982c35fda2d255afba340068c5035552368bc7200c1488ffffffff0100093d00000000001976a9148edb68822f1ad580b043c7b3df2e400f8699eb4888ac00000000"), SER_NETWORK, PROTOCOL_VERSION);
+    stream >> block;
+
+    CBloomFilter filter(10, 0.000001, 0, BLOOM_UPDATE_NONE);
+    // Match the generation pubkey
+    filter.insert(ParseHex("04eaafc2314def4ca98ac970241bcab022b9c1e1f4ea423a20f134c876f2c01ec0f0dd5b2e86e7168cefe0d81113c3807420ce13ad1357231a2252247d97a46a91"));
+    // ...and the output address of the 4th transaction
+    filter.insert(ParseHex("b6efd80d99179f4f4ff6f4dd0a007d018c385d21"));
+
+    CMerkleBlock merkleBlock(block, filter);
+    BOOST_CHECK(merkleBlock.header.GetHash() == block.GetHash());
+
+    // We shouldn't match any outpoints (UPDATE_NONE)
+    BOOST_CHECK(!filter.contains(COutPoint(uint256S("0x147caa76786596590baa4e98f5d9f48b86c7765e489f7a6ff3360fe5c674360b"), 0)));
+    BOOST_CHECK(!filter.contains(COutPoint(uint256S("0x02981fa052f0481dbc5868f4fc2166035a10f27a03cfd2de67326471df5bc041"), 0)));
+}
+
+static std::vector<unsigned char> RandomData()
+{
+    uint256 r = GetRandHash();
+    return std::vector<unsigned char>(r.begin(), r.end());
+}
+
+BOOST_AUTO_TEST_CASE(rolling_bloom)
+{
+    // last-100-entry, 1% false positive:
+    CRollingBloomFilter rb1(100, 0.01);
+
+    // Overfill:
+    static const int DATASIZE=399;
+    std::vector<unsigned char> data[DATASIZE];
+    for (int i = 0; i < DATASIZE; i++) {
+        data[i] = RandomData();
+        rb1.insert(data[i]);
+    }
+    // Last 100 guaranteed to be remembered:
+    for (int i = 299; i < DATASIZE; i++) {
+        BOOST_CHECK(rb1.contains(data[i]));
+    }
+
+    // false positive rate is 1%, so we should get about 100 hits if
+    // testing 10,000 random keys. We get worst-case false positive
+    // behavior when the filter is as full as possible, which is
+    // when we've inserted one minus an integer multiple of nElement*2.
+    unsigned int nHits = 0;
+    for (int i = 0; i < 10000; i++) {
+        if (rb1.contains(RandomData()))
+            ++nHits;
+    }
+    // Run test_bitcoin with --log_level=message to see BOOST_TEST_MESSAGEs:
+    BOOST_TEST_MESSAGE("RollingBloomFilter got " << nHits << " false positives (~100 expected)");
+
+    // Insanely unlikely to get a fp count outside this range:
+    BOOST_CHECK(nHits > 25);
+    BOOST_CHECK(nHits < 175);
+
+    BOOST_CHECK(rb1.contains(data[DATASIZE-1]));
+    rb1.reset();
+    BOOST_CHECK(!rb1.contains(data[DATASIZE-1]));
+
+    // Now roll through data, make sure last 100 entries
+    // are always remembered:
+    for (int i = 0; i < DATASIZE; i++) {
+        if (i >= 100)
+            BOOST_CHECK(rb1.contains(data[i-100]));
+        rb1.insert(data[i]);
+        BOOST_CHECK(rb1.contains(data[i]));
+    }
+
+    // Insert 999 more random entries:
+    for (int i = 0; i < 999; i++) {
+        std::vector<unsigned char> d = RandomData();
+        rb1.insert(d);
+        BOOST_CHECK(rb1.contains(d));
+    }
+    // Sanity check to make sure the filter isn't just filling up:
+    nHits = 0;
+    for (int i = 0; i < DATASIZE; i++) {
+        if (rb1.contains(data[i]))
+            ++nHits;
+    }
+    // Expect about 5 false positives, more than 100 means
+    // something is definitely broken.
+    BOOST_TEST_MESSAGE("RollingBloomFilter got " << nHits << " false positives (~5 expected)");
+    BOOST_CHECK(nHits < 100);
+
+    // last-1000-entry, 0.01% false positive:
+    CRollingBloomFilter rb2(1000, 0.001);
+    for (int i = 0; i < DATASIZE; i++) {
+        rb2.insert(data[i]);
+    }
+    // ... room for all of them:
+    for (int i = 0; i < DATASIZE; i++) {
+        BOOST_CHECK(rb2.contains(data[i]));
+    }
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/buildenv.py.in b/depend/zcash/src/test/buildenv.py.in
new file mode 100644
index 000000000..674928a96
--- /dev/null
+++ b/depend/zcash/src/test/buildenv.py.in
@@ -0,0 +1,2 @@
+#!/usr/bin/env python3
+exeext="@EXEEXT@"
diff --git a/depend/zcash/src/test/checkblock_tests.cpp b/depend/zcash/src/test/checkblock_tests.cpp
new file mode 100644
index 000000000..ae4c53ce2
--- /dev/null
+++ b/depend/zcash/src/test/checkblock_tests.cpp
@@ -0,0 +1,66 @@
+// Copyright (c) 2013-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "clientversion.h"
+#include "consensus/validation.h"
+#include "fs.h"
+#include "main.h"
+#include "proof_verifier.h"
+#include "test/test_bitcoin.h"
+#include "utiltime.h"
+#include "zcash/Proof.hpp"
+
+#include <cstdio>
+
+#include <boost/test/unit_test.hpp>
+
+
+BOOST_FIXTURE_TEST_SUITE(CheckBlock_tests, BasicTestingSetup)
+
+bool read_block(const std::string& filename, CBlock& block)
+{
+    fs::path testFile = fs::current_path() / "data" / filename;
+#ifdef TEST_DATA_DIR
+    if (!fs::exists(testFile))
+    {
+        testFile = fs::path(BOOST_PP_STRINGIZE(TEST_DATA_DIR)) / filename;
+    }
+#endif
+    FILE* fp = fsbridge::fopen(testFile, "rb");
+    if (!fp) return false;
+
+    fseek(fp, 8, SEEK_SET); // skip msgheader/size
+
+    CAutoFile filein(fp, SER_DISK, CLIENT_VERSION);
+    if (filein.IsNull()) return false;
+
+    filein >> block;
+
+    return true;
+}
+
+BOOST_AUTO_TEST_CASE(May15)
+{
+    // Putting a 1MB binary file in the git repository is not a great
+    // idea, so this test is only run if you manually download
+    // test/data/Mar12Fork.dat from
+    // http://sourceforge.net/projects/bitcoin/files/Bitcoin/blockchain/Mar12Fork.dat/download
+    unsigned int tMay15 = 1368576000;
+    SetMockTime(tMay15); // Test as if it was right at May 15
+
+    CBlock forkingBlock;
+    if (read_block("Mar12Fork.dat", forkingBlock))
+    {
+        CValidationState state;
+
+        // After May 15'th, big blocks are OK:
+        forkingBlock.nTime = tMay15; // Invalidates PoW
+        auto verifier = ProofVerifier::Strict();
+        BOOST_CHECK(CheckBlock(forkingBlock, state, Params(), verifier, false, false, true));
+    }
+
+    SetMockTime(0);
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/checkqueue_tests.cpp b/depend/zcash/src/test/checkqueue_tests.cpp
new file mode 100644
index 000000000..e52fd1278
--- /dev/null
+++ b/depend/zcash/src/test/checkqueue_tests.cpp
@@ -0,0 +1,441 @@
+// Copyright (c) 2012-2017 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or http://www.opensource.org/licenses/mit-license.php.
+
+#include "util.h"
+#include "utiltime.h"
+
+#include "test/test_bitcoin.h"
+#include "checkqueue.h"
+#include <boost/test/unit_test.hpp>
+#include <boost/thread.hpp>
+#include <atomic>
+#include <thread>
+#include <vector>
+#include <mutex>
+#include <condition_variable>
+
+#include <unordered_set>
+#include <memory>
+#include "random.h"
+
+static const int nScriptCheckThreads = 8;
+
+BOOST_FIXTURE_TEST_SUITE(checkqueue_tests, TestingSetup)
+
+static const int QUEUE_BATCH_SIZE = 128;
+
+struct FakeCheck {
+    bool operator()()
+    {
+        return true;
+    }
+    void swap(FakeCheck& x){};
+};
+
+struct FakeCheckCheckCompletion {
+    static std::atomic<size_t> n_calls;
+    bool operator()()
+    {
+        ++n_calls;
+        return true;
+    }
+    void swap(FakeCheckCheckCompletion& x){};
+};
+
+struct FailingCheck {
+    bool fails;
+    FailingCheck(bool fails) : fails(fails){};
+    FailingCheck() : fails(true){};
+    bool operator()()
+    {
+        return !fails;
+    }
+    void swap(FailingCheck& x)
+    {
+        std::swap(fails, x.fails);
+    };
+};
+
+struct UniqueCheck {
+    static std::mutex m;
+    static std::unordered_multiset<size_t> results;
+    size_t check_id;
+    UniqueCheck(size_t check_id_in) : check_id(check_id_in){};
+    UniqueCheck() : check_id(0){};
+    bool operator()()
+    {
+        std::lock_guard<std::mutex> l(m);
+        results.insert(check_id);
+        return true;
+    }
+    void swap(UniqueCheck& x) { std::swap(x.check_id, check_id); };
+};
+
+
+struct MemoryCheck {
+    static std::atomic<size_t> fake_allocated_memory;
+    bool b {false};
+    bool operator()()
+    {
+        return true;
+    }
+    MemoryCheck(){};
+    MemoryCheck(const MemoryCheck& x)
+    {
+        // We have to do this to make sure that destructor calls are paired
+        //
+        // Really, copy constructor should be deletable, but CCheckQueue breaks
+        // if it is deleted because of internal push_back.
+        fake_allocated_memory += b;
+    };
+    MemoryCheck(bool b_) : b(b_)
+    {
+        fake_allocated_memory += b;
+    };
+    ~MemoryCheck(){
+        fake_allocated_memory -= b;
+    
+    };
+    void swap(MemoryCheck& x) { std::swap(b, x.b); };
+};
+
+struct FrozenCleanupCheck {
+    static std::atomic<uint64_t> nFrozen;
+    static std::condition_variable cv;
+    static std::mutex m;
+    // Freezing can't be the default initialized behavior given how the queue
+    // swaps in default initialized Checks.
+    bool should_freeze {false};
+    bool operator()()
+    {
+        return true;
+    }
+    FrozenCleanupCheck() {}
+    ~FrozenCleanupCheck()
+    {
+        if (should_freeze) {
+            std::unique_lock<std::mutex> l(m);
+            nFrozen = 1;
+            cv.notify_one();
+            cv.wait(l, []{ return nFrozen == 0;});
+        }
+    }
+    void swap(FrozenCleanupCheck& x){std::swap(should_freeze, x.should_freeze);};
+};
+
+// Static Allocations
+std::mutex FrozenCleanupCheck::m{};
+std::atomic<uint64_t> FrozenCleanupCheck::nFrozen{0};
+std::condition_variable FrozenCleanupCheck::cv{};
+std::mutex UniqueCheck::m;
+std::unordered_multiset<size_t> UniqueCheck::results;
+std::atomic<size_t> FakeCheckCheckCompletion::n_calls{0};
+std::atomic<size_t> MemoryCheck::fake_allocated_memory{0};
+
+// Queue Typedefs
+typedef CCheckQueue<FakeCheckCheckCompletion> Correct_Queue;
+typedef CCheckQueue<FakeCheck> Standard_Queue;
+typedef CCheckQueue<FailingCheck> Failing_Queue;
+typedef CCheckQueue<UniqueCheck> Unique_Queue;
+typedef CCheckQueue<MemoryCheck> Memory_Queue;
+typedef CCheckQueue<FrozenCleanupCheck> FrozenCleanup_Queue;
+
+
+/** This test case checks that the CCheckQueue works properly
+ * with each specified size_t Checks pushed.
+ */
+void Correct_Queue_range(std::vector<size_t> range)
+{
+    auto small_queue = std::unique_ptr<Correct_Queue>(new Correct_Queue {QUEUE_BATCH_SIZE});
+    boost::thread_group tg;
+    for (auto x = 0; x < nScriptCheckThreads; ++x) {
+       tg.create_thread([&]{small_queue->Thread();});
+    }
+    // Make vChecks here to save on malloc (this test can be slow...)
+    std::vector<FakeCheckCheckCompletion> vChecks;
+    for (auto i : range) {
+        size_t total = i;
+        FakeCheckCheckCompletion::n_calls = 0;
+        CCheckQueueControl<FakeCheckCheckCompletion> control(small_queue.get());
+        while (total) {
+            vChecks.resize(std::min(total, (size_t) GetRand(10)));
+            total -= vChecks.size();
+            control.Add(vChecks);
+        }
+        BOOST_REQUIRE(control.Wait());
+        if (FakeCheckCheckCompletion::n_calls != i) {
+            BOOST_REQUIRE_EQUAL(FakeCheckCheckCompletion::n_calls, i);
+            BOOST_TEST_MESSAGE("Failure on trial " << i << " expected, got " << FakeCheckCheckCompletion::n_calls);
+        }
+    }
+    tg.interrupt_all();
+    tg.join_all();
+}
+
+/** Test that 0 checks is correct
+ */
+BOOST_AUTO_TEST_CASE(test_CheckQueue_Correct_Zero)
+{
+    std::vector<size_t> range;
+    range.push_back((size_t)0);
+    Correct_Queue_range(range);
+}
+/** Test that 1 check is correct
+ */
+BOOST_AUTO_TEST_CASE(test_CheckQueue_Correct_One)
+{
+    std::vector<size_t> range;
+    range.push_back((size_t)1);
+    Correct_Queue_range(range);
+}
+/** Test that MAX check is correct
+ */
+BOOST_AUTO_TEST_CASE(test_CheckQueue_Correct_Max)
+{
+    std::vector<size_t> range;
+    range.push_back(100000);
+    Correct_Queue_range(range);
+}
+/** Test that random numbers of checks are correct
+ */
+BOOST_AUTO_TEST_CASE(test_CheckQueue_Correct_Random)
+{
+    std::vector<size_t> range;
+    range.reserve(100000/1000);
+    for (size_t i = 2; i < 100000; i += std::max((size_t)1, (size_t)GetRand(std::min((size_t)1000, ((size_t)100000) - i))))
+        range.push_back(i);
+    Correct_Queue_range(range);
+}
+
+
+/** Test that failing checks are caught */
+BOOST_AUTO_TEST_CASE(test_CheckQueue_Catches_Failure)
+{
+    auto fail_queue = std::unique_ptr<Failing_Queue>(new Failing_Queue {QUEUE_BATCH_SIZE});
+
+    boost::thread_group tg;
+    for (auto x = 0; x < nScriptCheckThreads; ++x) {
+       tg.create_thread([&]{fail_queue->Thread();});
+    }
+
+    for (size_t i = 0; i < 1001; ++i) {
+        CCheckQueueControl<FailingCheck> control(fail_queue.get());
+        size_t remaining = i;
+        while (remaining) {
+            size_t r = GetRand(10);
+
+            std::vector<FailingCheck> vChecks;
+            vChecks.reserve(r);
+            for (size_t k = 0; k < r && remaining; k++, remaining--)
+                vChecks.emplace_back(remaining == 1);
+            control.Add(vChecks);
+        }
+        bool success = control.Wait();
+        if (i > 0) {
+            BOOST_REQUIRE(!success);
+        } else if (i == 0) {
+            BOOST_REQUIRE(success);
+        }
+    }
+    tg.interrupt_all();
+    tg.join_all();
+}
+// Test that a block validation which fails does not interfere with
+// future blocks, ie, the bad state is cleared.
+BOOST_AUTO_TEST_CASE(test_CheckQueue_Recovers_From_Failure)
+{
+    auto fail_queue = std::unique_ptr<Failing_Queue>(new Failing_Queue {QUEUE_BATCH_SIZE});
+    boost::thread_group tg;
+    for (auto x = 0; x < nScriptCheckThreads; ++x) {
+       tg.create_thread([&]{fail_queue->Thread();});
+    }
+
+    for (auto times = 0; times < 10; ++times) {
+        for (bool end_fails : {true, false}) {
+            CCheckQueueControl<FailingCheck> control(fail_queue.get());
+            {
+                std::vector<FailingCheck> vChecks;
+                vChecks.resize(100, false);
+                vChecks[99] = end_fails;
+                control.Add(vChecks);
+            }
+            bool r =control.Wait();
+            BOOST_REQUIRE(r || end_fails);
+        }
+    }
+    tg.interrupt_all();
+    tg.join_all();
+}
+
+// Test that unique checks are actually all called individually, rather than
+// just one check being called repeatedly. Test that checks are not called
+// more than once as well
+BOOST_AUTO_TEST_CASE(test_CheckQueue_UniqueCheck)
+{
+    auto queue = std::unique_ptr<Unique_Queue>(new Unique_Queue {QUEUE_BATCH_SIZE});
+    boost::thread_group tg;
+    for (auto x = 0; x < nScriptCheckThreads; ++x) {
+       tg.create_thread([&]{queue->Thread();});
+
+    }
+
+    size_t COUNT = 100000;
+    size_t total = COUNT;
+    {
+        CCheckQueueControl<UniqueCheck> control(queue.get());
+        while (total) {
+            size_t r = GetRand(10);
+            std::vector<UniqueCheck> vChecks;
+            for (size_t k = 0; k < r && total; k++)
+                vChecks.emplace_back(--total);
+            control.Add(vChecks);
+        }
+    }
+    bool r = true;
+    BOOST_REQUIRE_EQUAL(UniqueCheck::results.size(), COUNT);
+    for (size_t i = 0; i < COUNT; ++i)
+        r = r && UniqueCheck::results.count(i) == 1;
+    BOOST_REQUIRE(r);
+    tg.interrupt_all();
+    tg.join_all();
+}
+
+
+// Test that blocks which might allocate lots of memory free their memory aggressively.
+//
+// This test attempts to catch a pathological case where by lazily freeing
+// checks might mean leaving a check un-swapped out, and decreasing by 1 each
+// time could leave the data hanging across a sequence of blocks.
+BOOST_AUTO_TEST_CASE(test_CheckQueue_Memory)
+{
+    auto queue = std::unique_ptr<Memory_Queue>(new Memory_Queue {QUEUE_BATCH_SIZE});
+    boost::thread_group tg;
+    for (auto x = 0; x < nScriptCheckThreads; ++x) {
+       tg.create_thread([&]{queue->Thread();});
+    }
+    for (size_t i = 0; i < 1000; ++i) {
+        size_t total = i;
+        {
+            CCheckQueueControl<MemoryCheck> control(queue.get());
+            while (total) {
+                size_t r = GetRand(10);
+                std::vector<MemoryCheck> vChecks;
+                for (size_t k = 0; k < r && total; k++) {
+                    total--;
+                    // Each iteration leaves data at the front, back, and middle
+                    // to catch any sort of deallocation failure
+                    vChecks.emplace_back(total == 0 || total == i || total == i/2);
+                }
+                control.Add(vChecks);
+            }
+        }
+        BOOST_REQUIRE_EQUAL(MemoryCheck::fake_allocated_memory, 0);
+    }
+    tg.interrupt_all();
+    tg.join_all();
+}
+
+// Test that a new verification cannot occur until all checks 
+// have been destructed
+BOOST_AUTO_TEST_CASE(test_CheckQueue_FrozenCleanup)
+{
+    auto queue = std::unique_ptr<FrozenCleanup_Queue>(new FrozenCleanup_Queue {QUEUE_BATCH_SIZE});
+    boost::thread_group tg;
+    bool fails = false;
+    for (auto x = 0; x < nScriptCheckThreads; ++x) {
+        tg.create_thread([&]{queue->Thread();});
+    }
+    std::thread t0([&]() {
+        CCheckQueueControl<FrozenCleanupCheck> control(queue.get());
+        std::vector<FrozenCleanupCheck> vChecks(1);
+        // Freezing can't be the default initialized behavior given how the queue
+        // swaps in default initialized Checks (otherwise freezing destructor
+        // would get called twice).
+        vChecks[0].should_freeze = true;
+        control.Add(vChecks);
+        control.Wait(); // Hangs here
+    });
+    {
+        std::unique_lock<std::mutex> l(FrozenCleanupCheck::m);
+        // Wait until the queue has finished all jobs and frozen
+        FrozenCleanupCheck::cv.wait(l, [](){return FrozenCleanupCheck::nFrozen == 1;});
+        // Try to get control of the queue a bunch of times
+        for (auto x = 0; x < 100 && !fails; ++x) {
+            fails = queue->ControlMutex.try_lock();
+        }
+        // Unfreeze
+        FrozenCleanupCheck::nFrozen = 0;
+    }
+    // Awaken frozen destructor
+    FrozenCleanupCheck::cv.notify_one();
+    // Wait for control to finish
+    t0.join();
+    tg.interrupt_all();
+    tg.join_all();
+    BOOST_REQUIRE(!fails);
+}
+
+
+/** Test that CCheckQueueControl is threadsafe */
+BOOST_AUTO_TEST_CASE(test_CheckQueueControl_Locks)
+{
+    auto queue = std::unique_ptr<Standard_Queue>(new Standard_Queue{QUEUE_BATCH_SIZE});
+    {
+        boost::thread_group tg;
+        std::atomic<int> nThreads {0};
+        std::atomic<int> fails {0};
+        for (size_t i = 0; i < 3; ++i) {
+            tg.create_thread(
+                    [&]{
+                    CCheckQueueControl<FakeCheck> control(queue.get());
+                    // While sleeping, no other thread should execute to this point
+                    auto observed = ++nThreads;
+                    MilliSleep(10);
+                    fails += observed  != nThreads;
+                    });
+        }
+        tg.join_all();
+        BOOST_REQUIRE_EQUAL(fails, 0);
+    }
+    {
+        boost::thread_group tg;
+        std::mutex m;
+        bool has_lock {false};
+        bool has_tried {false};
+        bool done {false};
+        bool done_ack {false};
+        std::condition_variable cv;
+        {
+            std::unique_lock<std::mutex> l(m);
+            tg.create_thread([&]{
+                    CCheckQueueControl<FakeCheck> control(queue.get());
+                    std::unique_lock<std::mutex> l(m);
+                    has_lock = true;
+                    cv.notify_one();
+                    cv.wait(l, [&]{return has_tried;});
+                    done = true;
+                    cv.notify_one();
+                    // Wait until the done is acknowledged
+                    //
+                    cv.wait(l, [&]{return done_ack;});
+                    });
+            // Wait for thread to get the lock
+            cv.wait(l, [&](){return has_lock;});
+            bool fails = false;
+            for (auto x = 0; x < 100 && !fails; ++x) {
+                fails = queue->ControlMutex.try_lock();
+            }
+            has_tried = true;
+            cv.notify_one();
+            cv.wait(l, [&](){return done;});
+            // Acknowledge the done
+            done_ack = true;
+            cv.notify_one();
+            BOOST_REQUIRE(!fails);
+        }
+        tg.join_all();
+    }
+}
+BOOST_AUTO_TEST_SUITE_END()
+
diff --git a/depend/zcash/src/test/coins_tests.cpp b/depend/zcash/src/test/coins_tests.cpp
new file mode 100644
index 000000000..543c29b4c
--- /dev/null
+++ b/depend/zcash/src/test/coins_tests.cpp
@@ -0,0 +1,759 @@
+// Copyright (c) 2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "coins.h"
+#include "test_random.h"
+#include "script/standard.h"
+#include "uint256.h"
+#include "utilstrencodings.h"
+#include "test/test_bitcoin.h"
+#include "consensus/validation.h"
+#include "main.h"
+#include "undo.h"
+#include "primitives/transaction.h"
+#include "pubkey.h"
+#include "transaction_builder.h"
+#include "zcash/Note.hpp"
+#include "zcash/address/mnemonic.h"
+
+#include <vector>
+#include <map>
+
+#include <boost/test/unit_test.hpp>
+#include "zcash/IncrementalMerkleTree.hpp"
+
+namespace
+{
+class CCoinsViewTest : public CCoinsView
+{
+    uint256 hashBestBlock_;
+    uint256 hashBestSproutAnchor_;
+    uint256 hashBestSaplingAnchor_;
+    uint256 hashBestOrchardAnchor_;
+    std::map<uint256, CCoins> map_;
+    std::map<uint256, SproutMerkleTree> mapSproutAnchors_;
+    std::map<uint256, SaplingMerkleTree> mapSaplingAnchors_;
+    std::map<uint256, OrchardMerkleFrontier> mapOrchardAnchors_;
+    std::map<uint256, bool> mapSproutNullifiers_;
+    std::map<uint256, bool> mapSaplingNullifiers_;
+    std::map<uint256, bool> mapOrchardNullifiers_;
+
+public:
+    CCoinsViewTest() {
+        hashBestSproutAnchor_ = SproutMerkleTree::empty_root();
+        hashBestSaplingAnchor_ = SaplingMerkleTree::empty_root();
+        hashBestOrchardAnchor_ = OrchardMerkleFrontier::empty_root();
+    }
+
+    bool GetSproutAnchorAt(const uint256& rt, SproutMerkleTree &tree) const {
+        if (rt == SproutMerkleTree::empty_root()) {
+            SproutMerkleTree new_tree;
+            tree = new_tree;
+            return true;
+        }
+
+        std::map<uint256, SproutMerkleTree>::const_iterator it = mapSproutAnchors_.find(rt);
+        if (it == mapSproutAnchors_.end()) {
+            return false;
+        } else {
+            tree = it->second;
+            return true;
+        }
+    }
+
+    bool GetSaplingAnchorAt(const uint256& rt, SaplingMerkleTree &tree) const {
+        if (rt == SaplingMerkleTree::empty_root()) {
+            SaplingMerkleTree new_tree;
+            tree = new_tree;
+            return true;
+        }
+
+        std::map<uint256, SaplingMerkleTree>::const_iterator it = mapSaplingAnchors_.find(rt);
+        if (it == mapSaplingAnchors_.end()) {
+            return false;
+        } else {
+            tree = it->second;
+            return true;
+        }
+    }
+
+    bool GetOrchardAnchorAt(const uint256& rt, OrchardMerkleFrontier &tree) const {
+        if (rt == OrchardMerkleFrontier::empty_root()) {
+            OrchardMerkleFrontier new_tree;
+            tree = new_tree;
+            return true;
+        }
+
+        std::map<uint256, OrchardMerkleFrontier>::const_iterator it = mapOrchardAnchors_.find(rt);
+        if (it == mapOrchardAnchors_.end()) {
+            return false;
+        } else {
+            tree = it->second;
+            return true;
+        }
+    }
+
+    bool GetNullifier(const uint256 &nf, ShieldedType type) const
+    {
+        const std::map<uint256, bool>* mapToUse;
+        switch (type) {
+            case SPROUT:
+                mapToUse = &mapSproutNullifiers_;
+                break;
+            case SAPLING:
+                mapToUse = &mapSaplingNullifiers_;
+                break;
+            case ORCHARD:
+                mapToUse = &mapOrchardNullifiers_;
+                break;
+            default:
+                throw std::runtime_error("Unknown shielded type");
+        }
+        std::map<uint256, bool>::const_iterator it = mapToUse->find(nf);
+        if (it == mapToUse->end()) {
+            return false;
+        } else {
+            // The map shouldn't contain any false entries.
+            assert(it->second);
+            return true;
+        }
+    }
+
+    uint256 GetBestAnchor(ShieldedType type) const {
+        switch (type) {
+            case SPROUT:
+                return hashBestSproutAnchor_;
+                break;
+            case SAPLING:
+                return hashBestSaplingAnchor_;
+                break;
+            case ORCHARD:
+                return hashBestOrchardAnchor_;
+                break;
+            default:
+                throw std::runtime_error("Unknown shielded type");
+        }
+    }
+
+    bool GetCoins(const uint256& txid, CCoins& coins) const
+    {
+        std::map<uint256, CCoins>::const_iterator it = map_.find(txid);
+        if (it == map_.end()) {
+            return false;
+        }
+        coins = it->second;
+        if (coins.IsPruned() && insecure_rand() % 2 == 0) {
+            // Randomly return false in case of an empty entry.
+            return false;
+        }
+        return true;
+    }
+
+    bool HaveCoins(const uint256& txid) const
+    {
+        CCoins coins;
+        return GetCoins(txid, coins);
+    }
+
+    uint256 GetBestBlock() const { return hashBestBlock_; }
+
+    void BatchWriteNullifiers(CNullifiersMap& mapNullifiers, std::map<uint256, bool>& cacheNullifiers)
+    {
+        for (CNullifiersMap::iterator it = mapNullifiers.begin(); it != mapNullifiers.end(); ) {
+            if (it->second.flags & CNullifiersCacheEntry::DIRTY) {
+                // Same optimization used in CCoinsViewDB is to only write dirty entries.
+                if (it->second.entered) {
+                    cacheNullifiers[it->first] = true;
+                } else {
+                    cacheNullifiers.erase(it->first);
+                }
+            }
+            it = mapNullifiers.erase(it);
+        }
+    }
+
+    template<typename Tree, typename Map, typename MapEntry>
+    void BatchWriteAnchors(Map& mapAnchors, std::map<uint256, Tree>& cacheAnchors)
+    {
+        for (auto it = mapAnchors.begin(); it != mapAnchors.end(); ) {
+            if (it->second.flags & MapEntry::DIRTY) {
+                // Same optimization used in CCoinsViewDB is to only write dirty entries.
+                if (it->second.entered) {
+                    if (it->first != Tree::empty_root()) {
+                        auto ret = cacheAnchors.insert(std::make_pair(it->first, Tree())).first;
+                        ret->second = it->second.tree;
+                    }
+                } else {
+                    cacheAnchors.erase(it->first);
+                }
+            }
+            it = mapAnchors.erase(it);
+        }
+    }
+
+    bool BatchWrite(CCoinsMap& mapCoins,
+                    const uint256& hashBlock,
+                    const uint256& hashSproutAnchor,
+                    const uint256& hashSaplingAnchor,
+                    const uint256& hashOrchardAnchor,
+                    CAnchorsSproutMap& mapSproutAnchors,
+                    CAnchorsSaplingMap& mapSaplingAnchors,
+                    CAnchorsOrchardMap& mapOrchardAnchors,
+                    CNullifiersMap& mapSproutNullifiers,
+                    CNullifiersMap& mapSaplingNullifiers,
+                    CNullifiersMap& mapOrchardNullifiers,
+                    CHistoryCacheMap &historyCacheMap)
+    {
+        for (CCoinsMap::iterator it = mapCoins.begin(); it != mapCoins.end(); ) {
+            if (it->second.flags & CCoinsCacheEntry::DIRTY) {
+                // Same optimization used in CCoinsViewDB is to only write dirty entries.
+                map_[it->first] = it->second.coins;
+                if (it->second.coins.IsPruned() && insecure_rand() % 3 == 0) {
+                    // Randomly delete empty entries on write.
+                    map_.erase(it->first);
+                }
+            }
+            it = mapCoins.erase(it);
+        }
+
+        BatchWriteAnchors<SproutMerkleTree, CAnchorsSproutMap, CAnchorsSproutCacheEntry>(mapSproutAnchors, mapSproutAnchors_);
+        BatchWriteAnchors<SaplingMerkleTree, CAnchorsSaplingMap, CAnchorsSaplingCacheEntry>(mapSaplingAnchors, mapSaplingAnchors_);
+        BatchWriteAnchors<OrchardMerkleFrontier, CAnchorsOrchardMap, CAnchorsOrchardCacheEntry>(mapOrchardAnchors, mapOrchardAnchors_);
+
+        BatchWriteNullifiers(mapSproutNullifiers, mapSproutNullifiers_);
+        BatchWriteNullifiers(mapSaplingNullifiers, mapSaplingNullifiers_);
+        BatchWriteNullifiers(mapOrchardNullifiers, mapOrchardNullifiers_);
+
+        if (!hashBlock.IsNull())
+            hashBestBlock_ = hashBlock;
+        if (!hashSproutAnchor.IsNull())
+            hashBestSproutAnchor_ = hashSproutAnchor;
+        if (!hashSaplingAnchor.IsNull())
+            hashBestSaplingAnchor_ = hashSaplingAnchor;
+        if (!hashOrchardAnchor.IsNull())
+            hashBestOrchardAnchor_ = hashOrchardAnchor;
+        return true;
+    }
+
+    bool GetStats(CCoinsStats& stats) const { return false; }
+};
+
+class CCoinsViewCacheTest : public CCoinsViewCache
+{
+public:
+    CCoinsViewCacheTest(CCoinsView* base) : CCoinsViewCache(base) {}
+
+    void SelfTest() const
+    {
+        // Manually recompute the dynamic usage of the whole data, and compare it.
+        size_t ret = memusage::DynamicUsage(cacheCoins) +
+                     memusage::DynamicUsage(cacheSproutAnchors) +
+                     memusage::DynamicUsage(cacheSaplingAnchors) +
+                     memusage::DynamicUsage(cacheOrchardAnchors) +
+                     memusage::DynamicUsage(cacheSproutNullifiers) +
+                     memusage::DynamicUsage(cacheSaplingNullifiers) +
+                     memusage::DynamicUsage(cacheOrchardNullifiers) +
+                     memusage::DynamicUsage(historyCacheMap);
+        for (CCoinsMap::iterator it = cacheCoins.begin(); it != cacheCoins.end(); it++) {
+            ret += it->second.coins.DynamicMemoryUsage();
+        }
+        BOOST_CHECK_EQUAL(DynamicMemoryUsage(), ret);
+    }
+
+};
+
+class TxWithNullifiers
+{
+public:
+    CTransaction tx;
+    uint256 sproutNullifier;
+    uint256 saplingNullifier;
+    uint256 orchardNullifier;
+
+    TxWithNullifiers()
+    {
+        CMutableTransaction mutableTx;
+
+        sproutNullifier = GetRandHash();
+        JSDescription jsd;
+        jsd.nullifiers[0] = sproutNullifier;
+        mutableTx.vJoinSplit.emplace_back(jsd);
+        
+        saplingNullifier = GetRandHash();
+        SpendDescription sd;
+        sd.nullifier = saplingNullifier;
+        mutableTx.vShieldedSpend.push_back(sd);
+
+        // The Orchard bundle builder always pads to two Actions, so we can just
+        // use an empty builder to create a dummy Orchard bundle.
+        uint256 orchardAnchor;
+        uint256 dataToBeSigned;
+        auto builder = orchard::Builder(true, true, orchardAnchor);
+        mutableTx.orchardBundle = builder.Build().value().ProveAndSign({}, dataToBeSigned).value();
+        orchardNullifier = mutableTx.orchardBundle.GetNullifiers()[0];
+
+        tx = CTransaction(mutableTx);
+    }
+};
+
+}
+
+uint256 appendRandomSproutCommitment(SproutMerkleTree &tree)
+{
+    libzcash::SproutSpendingKey k = libzcash::SproutSpendingKey::random();
+    libzcash::SproutPaymentAddress addr = k.address();
+
+    libzcash::SproutNote note(addr.a_pk, 0, uint256(), uint256());
+
+    auto cm = note.cm();
+    tree.append(cm);
+    return cm;
+}
+
+template<typename Tree> void AppendRandomLeaf(Tree &tree);
+template<> void AppendRandomLeaf(SproutMerkleTree &tree) { tree.append(GetRandHash()); }
+template<> void AppendRandomLeaf(SaplingMerkleTree &tree) { tree.append(GetRandHash()); }
+template<> void AppendRandomLeaf(OrchardMerkleFrontier &tree) {
+    // OrchardMerkleFrontier only has APIs to append entire bundles, but
+    // fortunately the tests only require that the tree root change.
+    // TODO: Remove the need to create proofs by having a testing-only way to
+    // append a random leaf to OrchardMerkleFrontier.
+    uint256 orchardAnchor;
+    uint256 dataToBeSigned;
+    auto builder = orchard::Builder(true, true, orchardAnchor);
+    auto bundle = builder.Build().value().ProveAndSign({}, dataToBeSigned).value();
+    tree.AppendBundle(bundle);
+}
+
+template<typename Tree> bool GetAnchorAt(const CCoinsViewCacheTest &cache, const uint256 &rt, Tree &tree);
+template<> bool GetAnchorAt(const CCoinsViewCacheTest &cache, const uint256 &rt, SproutMerkleTree &tree) { return cache.GetSproutAnchorAt(rt, tree); }
+template<> bool GetAnchorAt(const CCoinsViewCacheTest &cache, const uint256 &rt, SaplingMerkleTree &tree) { return cache.GetSaplingAnchorAt(rt, tree); }
+template<> bool GetAnchorAt(const CCoinsViewCacheTest &cache, const uint256 &rt, OrchardMerkleFrontier &tree) { return cache.GetOrchardAnchorAt(rt, tree); }
+
+BOOST_FIXTURE_TEST_SUITE(coins_tests, BasicTestingSetup)
+
+void checkNullifierCache(const CCoinsViewCacheTest &cache, const TxWithNullifiers &txWithNullifiers, bool shouldBeInCache) {
+    // Make sure the nullifiers have not gotten mixed up
+    BOOST_CHECK(!cache.GetNullifier(txWithNullifiers.sproutNullifier, SAPLING));
+    BOOST_CHECK(!cache.GetNullifier(txWithNullifiers.sproutNullifier, ORCHARD));
+    BOOST_CHECK(!cache.GetNullifier(txWithNullifiers.saplingNullifier, SPROUT));
+    BOOST_CHECK(!cache.GetNullifier(txWithNullifiers.saplingNullifier, ORCHARD));
+    BOOST_CHECK(!cache.GetNullifier(txWithNullifiers.orchardNullifier, SPROUT));
+    BOOST_CHECK(!cache.GetNullifier(txWithNullifiers.orchardNullifier, SAPLING));
+    // Check if the nullifiers either are or are not in the cache
+    bool containsSproutNullifier = cache.GetNullifier(txWithNullifiers.sproutNullifier, SPROUT);
+    bool containsSaplingNullifier = cache.GetNullifier(txWithNullifiers.saplingNullifier, SAPLING);
+    bool containsOrchardNullifier = cache.GetNullifier(txWithNullifiers.orchardNullifier, ORCHARD);
+    BOOST_CHECK(containsSproutNullifier == shouldBeInCache);
+    BOOST_CHECK(containsSaplingNullifier == shouldBeInCache);
+    BOOST_CHECK(containsOrchardNullifier == shouldBeInCache);
+}
+
+BOOST_AUTO_TEST_CASE(chained_joinsplits)
+{
+    // TODO update this or add a similar test when the SaplingNote class exist
+    CCoinsViewTest base;
+    CCoinsViewCacheTest cache(&base);
+
+    SproutMerkleTree tree;
+
+    JSDescription js1;
+    js1.anchor = tree.root();
+    js1.commitments[0] = appendRandomSproutCommitment(tree);
+    js1.commitments[1] = appendRandomSproutCommitment(tree);
+
+    // Although it's not possible given our assumptions, if
+    // two joinsplits create the same treestate twice, we should
+    // still be able to anchor to it.
+    JSDescription js1b;
+    js1b.anchor = tree.root();
+    js1b.commitments[0] = js1.commitments[0];
+    js1b.commitments[1] = js1.commitments[1];
+
+    JSDescription js2;
+    JSDescription js3;
+
+    js2.anchor = tree.root();
+    js3.anchor = tree.root();
+
+    js2.commitments[0] = appendRandomSproutCommitment(tree);
+    js2.commitments[1] = appendRandomSproutCommitment(tree);
+
+    js3.commitments[0] = appendRandomSproutCommitment(tree);
+    js3.commitments[1] = appendRandomSproutCommitment(tree);
+
+    {
+        CMutableTransaction mtx;
+        mtx.vJoinSplit.push_back(js2);
+
+        BOOST_CHECK(cache.HaveShieldedRequirements(mtx) == std::optional<UnsatisfiedShieldedReq>(UnsatisfiedShieldedReq::SproutUnknownAnchor));
+    }
+
+    {
+        // js2 is trying to anchor to js1 but js1
+        // appears afterwards -- not a permitted ordering
+        CMutableTransaction mtx;
+        mtx.vJoinSplit.push_back(js2);
+        mtx.vJoinSplit.push_back(js1);
+
+        BOOST_CHECK(cache.HaveShieldedRequirements(mtx) == std::optional<UnsatisfiedShieldedReq>(UnsatisfiedShieldedReq::SproutUnknownAnchor));
+    }
+
+    {
+        CMutableTransaction mtx;
+        mtx.vJoinSplit.push_back(js1);
+        mtx.vJoinSplit.push_back(js2);
+
+        BOOST_CHECK(cache.HaveShieldedRequirements(mtx) == std::nullopt);
+    }
+
+    {
+        CMutableTransaction mtx;
+        mtx.vJoinSplit.push_back(js1);
+        mtx.vJoinSplit.push_back(js2);
+        mtx.vJoinSplit.push_back(js3);
+
+        BOOST_CHECK(cache.HaveShieldedRequirements(mtx) == std::nullopt);
+    }
+
+    {
+        CMutableTransaction mtx;
+        mtx.vJoinSplit.push_back(js1);
+        mtx.vJoinSplit.push_back(js1b);
+        mtx.vJoinSplit.push_back(js2);
+        mtx.vJoinSplit.push_back(js3);
+
+        BOOST_CHECK(cache.HaveShieldedRequirements(mtx) == std::nullopt);
+    }
+}
+
+static const unsigned int NUM_SIMULATION_ITERATIONS = 40000;
+
+// This is a large randomized insert/remove simulation test on a variable-size
+// stack of caches on top of CCoinsViewTest.
+//
+// It will randomly create/update/delete CCoins entries to a tip of caches, with
+// txids picked from a limited list of random 256-bit hashes. Occasionally, a
+// new tip is added to the stack of caches, or the tip is flushed and removed.
+//
+// During the process, booleans are kept to make sure that the randomized
+// operation hits all branches.
+BOOST_AUTO_TEST_CASE(coins_cache_simulation_test)
+{
+    // Various coverage trackers.
+    bool removed_all_caches = false;
+    bool reached_4_caches = false;
+    bool added_an_entry = false;
+    bool removed_an_entry = false;
+    bool updated_an_entry = false;
+    bool found_an_entry = false;
+    bool missed_an_entry = false;
+
+    // A simple map to track what we expect the cache stack to represent.
+    std::map<uint256, CCoins> result;
+
+    // The cache stack.
+    CCoinsViewTest base; // A CCoinsViewTest at the bottom.
+    std::vector<CCoinsViewCacheTest*> stack; // A stack of CCoinsViewCaches on top.
+    stack.push_back(new CCoinsViewCacheTest(&base)); // Start with one cache.
+
+    // Use a limited set of random transaction ids, so we do test overwriting entries.
+    std::vector<uint256> txids;
+    txids.resize(NUM_SIMULATION_ITERATIONS / 8);
+    for (unsigned int i = 0; i < txids.size(); i++) {
+        txids[i] = GetRandHash();
+    }
+
+    for (unsigned int i = 0; i < NUM_SIMULATION_ITERATIONS; i++) {
+        // Do a random modification.
+        {
+            uint256 txid = txids[insecure_rand() % txids.size()]; // txid we're going to modify in this iteration.
+            CCoins& coins = result[txid];
+            CCoinsModifier entry = stack.back()->ModifyCoins(txid);
+            BOOST_CHECK(coins == *entry);
+            if (insecure_rand() % 5 == 0 || coins.IsPruned()) {
+                if (coins.IsPruned()) {
+                    added_an_entry = true;
+                } else {
+                    updated_an_entry = true;
+                }
+                coins.nVersion = insecure_rand();
+                coins.vout.resize(1);
+                coins.vout[0].nValue = insecure_rand();
+                *entry = coins;
+            } else {
+                coins.Clear();
+                entry->Clear();
+                removed_an_entry = true;
+            }
+        }
+
+        // Once every 1000 iterations and at the end, verify the full cache.
+        if (insecure_rand() % 1000 == 1 || i == NUM_SIMULATION_ITERATIONS - 1) {
+            for (std::map<uint256, CCoins>::iterator it = result.begin(); it != result.end(); it++) {
+                const CCoins* coins = stack.back()->AccessCoins(it->first);
+                if (coins) {
+                    BOOST_CHECK(*coins == it->second);
+                    found_an_entry = true;
+                } else {
+                    BOOST_CHECK(it->second.IsPruned());
+                    missed_an_entry = true;
+                }
+            }
+            for (const CCoinsViewCacheTest *test : stack) {
+                test->SelfTest();
+            }
+        }
+
+        if (insecure_rand() % 100 == 0) {
+            // Every 100 iterations, change the cache stack.
+            if (stack.size() > 0 && insecure_rand() % 2 == 0) {
+                stack.back()->Flush();
+                delete stack.back();
+                stack.pop_back();
+            }
+            if (stack.size() == 0 || (stack.size() < 4 && insecure_rand() % 2)) {
+                CCoinsView* tip = &base;
+                if (stack.size() > 0) {
+                    tip = stack.back();
+                } else {
+                    removed_all_caches = true;
+                }
+                stack.push_back(new CCoinsViewCacheTest(tip));
+                if (stack.size() == 4) {
+                    reached_4_caches = true;
+                }
+            }
+        }
+    }
+
+    // Clean up the stack.
+    while (stack.size() > 0) {
+        delete stack.back();
+        stack.pop_back();
+    }
+
+    // Verify coverage.
+    BOOST_CHECK(removed_all_caches);
+    BOOST_CHECK(reached_4_caches);
+    BOOST_CHECK(added_an_entry);
+    BOOST_CHECK(removed_an_entry);
+    BOOST_CHECK(updated_an_entry);
+    BOOST_CHECK(found_an_entry);
+    BOOST_CHECK(missed_an_entry);
+}
+
+BOOST_AUTO_TEST_CASE(coins_coinbase_spends)
+{
+    CCoinsViewTest base;
+    CCoinsViewCacheTest cache(&base);
+
+    // Create coinbase transaction
+    CMutableTransaction mtx;
+    mtx.vin.resize(1);
+    mtx.vin[0].scriptSig = CScript() << OP_1;
+    mtx.vin[0].nSequence = 0;
+    mtx.vout.resize(1);
+    mtx.vout[0].nValue = 500;
+    mtx.vout[0].scriptPubKey = CScript() << OP_1;
+
+    CTransaction tx(mtx);
+
+    BOOST_CHECK(tx.IsCoinBase());
+
+    CValidationState state;
+    UpdateCoins(tx, cache, 100);
+
+    // Create coinbase spend
+    CMutableTransaction mtx2;
+    mtx2.vin.resize(1);
+    mtx2.vin[0].prevout = COutPoint(tx.GetHash(), 0);
+    mtx2.vin[0].scriptSig = CScript() << OP_1;
+    mtx2.vin[0].nSequence = 0;
+
+    {
+        CTransaction tx2(mtx2);
+        BOOST_CHECK(Consensus::CheckTxInputs(tx2, state, cache, 100+COINBASE_MATURITY, Params().GetConsensus()));
+    }
+
+    mtx2.vout.resize(1);
+    mtx2.vout[0].nValue = 500;
+    mtx2.vout[0].scriptPubKey = CScript() << OP_1;
+
+    {
+        CTransaction tx2(mtx2);
+        BOOST_CHECK(!Consensus::CheckTxInputs(tx2, state, cache, 100+COINBASE_MATURITY, Params().GetConsensus()));
+        BOOST_CHECK(state.GetRejectReason() == "bad-txns-coinbase-spend-has-transparent-outputs");
+    }
+}
+
+// This test is similar to the previous test
+// except the emphasis is on testing the functionality of UpdateCoins
+// random txs are created and UpdateCoins is used to update the cache stack
+BOOST_AUTO_TEST_CASE(updatecoins_simulation_test)
+{
+    // A simple map to track what we expect the cache stack to represent.
+    std::map<uint256, CCoins> result;
+
+    // The cache stack.
+    CCoinsViewTest base; // A CCoinsViewTest at the bottom.
+    std::vector<CCoinsViewCacheTest*> stack; // A stack of CCoinsViewCaches on top.
+    stack.push_back(new CCoinsViewCacheTest(&base)); // Start with one cache.
+
+    // Track the txids we've used and whether they have been spent or not
+    std::map<uint256, CAmount> coinbaseids;
+    std::set<uint256> alltxids;
+
+    for (unsigned int i = 0; i < NUM_SIMULATION_ITERATIONS; i++) {
+        {
+            CMutableTransaction tx;
+            tx.vin.resize(1);
+            tx.vout.resize(1);
+            tx.vout[0].nValue = i; //Keep txs unique
+            unsigned int height = insecure_rand();
+
+            // 1/10 times create a coinbase
+            if (insecure_rand() % 10 == 0 || coinbaseids.size() < 10) {
+                coinbaseids[tx.GetHash()] = tx.vout[0].nValue;
+                assert(CTransaction(tx).IsCoinBase());
+            }
+            // 9/10 times create a regular tx
+            else {
+                uint256 prevouthash;
+                // equally likely to spend coinbase or non coinbase
+                std::set<uint256>::iterator txIt = alltxids.lower_bound(GetRandHash());
+                if (txIt == alltxids.end()) {
+                    txIt = alltxids.begin();
+                }
+                prevouthash = *txIt;
+
+                // Construct the tx to spend the coins of prevouthash
+                tx.vin[0].prevout.hash = prevouthash;
+                tx.vin[0].prevout.n = 0;
+
+                // Update the expected result of prevouthash to know these coins are spent
+                CCoins& oldcoins = result[prevouthash];
+                oldcoins.Clear();
+
+                alltxids.erase(prevouthash);
+                coinbaseids.erase(prevouthash);
+
+                assert(!CTransaction(tx).IsCoinBase());
+            }
+            // Track this tx to possibly spend later
+            alltxids.insert(tx.GetHash());
+
+            // Update the expected result to know about the new output coins
+            CCoins &coins = result[tx.GetHash()];
+            coins.FromTx(tx, height);
+
+            UpdateCoins(tx, *(stack.back()), height);
+        }
+
+        // Once every 1000 iterations and at the end, verify the full cache.
+        if (insecure_rand() % 1000 == 1 || i == NUM_SIMULATION_ITERATIONS - 1) {
+            for (std::map<uint256, CCoins>::iterator it = result.begin(); it != result.end(); it++) {
+                const CCoins* coins = stack.back()->AccessCoins(it->first);
+                if (coins) {
+                    BOOST_CHECK(*coins == it->second);
+                 } else {
+                    BOOST_CHECK(it->second.IsPruned());
+                 }
+            }
+        }
+
+        if (insecure_rand() % 100 == 0) {
+            // Every 100 iterations, change the cache stack.
+            if (stack.size() > 0 && insecure_rand() % 2 == 0) {
+                stack.back()->Flush();
+                delete stack.back();
+                stack.pop_back();
+            }
+            if (stack.size() == 0 || (stack.size() < 4 && insecure_rand() % 2)) {
+                CCoinsView* tip = &base;
+                if (stack.size() > 0) {
+                    tip = stack.back();
+                }
+                stack.push_back(new CCoinsViewCacheTest(tip));
+           }
+        }
+    }
+
+    // Clean up the stack.
+    while (stack.size() > 0) {
+        delete stack.back();
+        stack.pop_back();
+    }
+}
+
+BOOST_AUTO_TEST_CASE(ccoins_serialization)
+{
+    // Good example
+    CDataStream ss1(ParseHex("0104835800816115944e077fe7c803cfa57f29b36bf87c1d358bb85e"), SER_DISK, CLIENT_VERSION);
+    CCoins cc1;
+    ss1 >> cc1;
+    BOOST_CHECK_EQUAL(cc1.nVersion, 1);
+    BOOST_CHECK_EQUAL(cc1.fCoinBase, false);
+    BOOST_CHECK_EQUAL(cc1.nHeight, 203998);
+    BOOST_CHECK_EQUAL(cc1.vout.size(), 2);
+    BOOST_CHECK_EQUAL(cc1.IsAvailable(0), false);
+    BOOST_CHECK_EQUAL(cc1.IsAvailable(1), true);
+    BOOST_CHECK_EQUAL(cc1.vout[1].nValue, 60000000000ULL);
+    BOOST_CHECK_EQUAL(HexStr(cc1.vout[1].scriptPubKey), HexStr(GetScriptForDestination(CKeyID(uint160(ParseHex("816115944e077fe7c803cfa57f29b36bf87c1d35"))))));
+
+    // Good example
+    CDataStream ss2(ParseHex("0109044086ef97d5790061b01caab50f1b8e9c50a5057eb43c2d9563a4eebbd123008c988f1a4a4de2161e0f50aac7f17e7f9555caa486af3b"), SER_DISK, CLIENT_VERSION);
+    CCoins cc2;
+    ss2 >> cc2;
+    BOOST_CHECK_EQUAL(cc2.nVersion, 1);
+    BOOST_CHECK_EQUAL(cc2.fCoinBase, true);
+    BOOST_CHECK_EQUAL(cc2.nHeight, 120891);
+    BOOST_CHECK_EQUAL(cc2.vout.size(), 17);
+    for (int i = 0; i < 17; i++) {
+        BOOST_CHECK_EQUAL(cc2.IsAvailable(i), i == 4 || i == 16);
+    }
+    BOOST_CHECK_EQUAL(cc2.vout[4].nValue, 234925952);
+    BOOST_CHECK_EQUAL(HexStr(cc2.vout[4].scriptPubKey), HexStr(GetScriptForDestination(CKeyID(uint160(ParseHex("61b01caab50f1b8e9c50a5057eb43c2d9563a4ee"))))));
+    BOOST_CHECK_EQUAL(cc2.vout[16].nValue, 110397);
+    BOOST_CHECK_EQUAL(HexStr(cc2.vout[16].scriptPubKey), HexStr(GetScriptForDestination(CKeyID(uint160(ParseHex("8c988f1a4a4de2161e0f50aac7f17e7f9555caa4"))))));
+
+    // Smallest possible example
+    CDataStream ssx(SER_DISK, CLIENT_VERSION);
+    BOOST_CHECK_EQUAL(HexStr(ssx.begin(), ssx.end()), "");
+
+    CDataStream ss3(ParseHex("0002000600"), SER_DISK, CLIENT_VERSION);
+    CCoins cc3;
+    ss3 >> cc3;
+    BOOST_CHECK_EQUAL(cc3.nVersion, 0);
+    BOOST_CHECK_EQUAL(cc3.fCoinBase, false);
+    BOOST_CHECK_EQUAL(cc3.nHeight, 0);
+    BOOST_CHECK_EQUAL(cc3.vout.size(), 1);
+    BOOST_CHECK_EQUAL(cc3.IsAvailable(0), true);
+    BOOST_CHECK_EQUAL(cc3.vout[0].nValue, 0);
+    BOOST_CHECK_EQUAL(cc3.vout[0].scriptPubKey.size(), 0);
+
+    // scriptPubKey that ends beyond the end of the stream
+    CDataStream ss4(ParseHex("0002000800"), SER_DISK, CLIENT_VERSION);
+    try {
+        CCoins cc4;
+        ss4 >> cc4;
+        BOOST_CHECK_MESSAGE(false, "We should have thrown");
+    } catch (const std::ios_base::failure& e) {
+    }
+
+    // Very large scriptPubKey (3*10^9 bytes) past the end of the stream
+    CDataStream tmp(SER_DISK, CLIENT_VERSION);
+    uint64_t x = 3000000000ULL;
+    tmp << VARINT(x);
+    BOOST_CHECK_EQUAL(HexStr(tmp.begin(), tmp.end()), "8a95c0bb00");
+    CDataStream ss5(ParseHex("0002008a95c0bb0000"), SER_DISK, CLIENT_VERSION);
+    try {
+        CCoins cc5;
+        ss5 >> cc5;
+        BOOST_CHECK_MESSAGE(false, "We should have thrown");
+    } catch (const std::ios_base::failure& e) {
+    }
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/compress_tests.cpp b/depend/zcash/src/test/compress_tests.cpp
new file mode 100644
index 000000000..5227f6cfd
--- /dev/null
+++ b/depend/zcash/src/test/compress_tests.cpp
@@ -0,0 +1,65 @@
+// Copyright (c) 2012-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "compressor.h"
+#include "util.h"
+#include "test/test_bitcoin.h"
+
+#include <stdint.h>
+
+#include <boost/test/unit_test.hpp>
+
+// amounts 0.00000001 .. 0.00100000
+#define NUM_MULTIPLES_UNIT 100000
+
+// amounts 0.01 .. 100.00
+#define NUM_MULTIPLES_CENT 10000
+
+// amounts 1 .. 10000
+#define NUM_MULTIPLES_1BTC 10000
+
+// amounts 50 .. 21000000
+#define NUM_MULTIPLES_50BTC 420000
+
+BOOST_FIXTURE_TEST_SUITE(compress_tests, BasicTestingSetup)
+
+bool static TestEncode(uint64_t in) {
+    return in == CTxOutCompressor::DecompressAmount(CTxOutCompressor::CompressAmount(in));
+}
+
+bool static TestDecode(uint64_t in) {
+    return in == CTxOutCompressor::CompressAmount(CTxOutCompressor::DecompressAmount(in));
+}
+
+bool static TestPair(uint64_t dec, uint64_t enc) {
+    return CTxOutCompressor::CompressAmount(dec) == enc &&
+           CTxOutCompressor::DecompressAmount(enc) == dec;
+}
+
+BOOST_AUTO_TEST_CASE(compress_amounts)
+{
+    BOOST_CHECK(TestPair(            0,       0x0));
+    BOOST_CHECK(TestPair(            1,       0x1));
+    BOOST_CHECK(TestPair(         CENT,       0x7));
+    BOOST_CHECK(TestPair(         COIN,       0x9));
+    BOOST_CHECK(TestPair(      50*COIN,      0x32));
+    BOOST_CHECK(TestPair(21000000*COIN, 0x1406f40));
+
+    for (uint64_t i = 1; i <= NUM_MULTIPLES_UNIT; i++)
+        BOOST_CHECK(TestEncode(i));
+
+    for (uint64_t i = 1; i <= NUM_MULTIPLES_CENT; i++)
+        BOOST_CHECK(TestEncode(i * CENT));
+
+    for (uint64_t i = 1; i <= NUM_MULTIPLES_1BTC; i++)
+        BOOST_CHECK(TestEncode(i * COIN));
+
+    for (uint64_t i = 1; i <= NUM_MULTIPLES_50BTC; i++)
+        BOOST_CHECK(TestEncode(i * 50 * COIN));
+
+    for (uint64_t i = 0; i < 100000; i++)
+        BOOST_CHECK(TestDecode(i));
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/convertbits_tests.cpp b/depend/zcash/src/test/convertbits_tests.cpp
new file mode 100644
index 000000000..1a4786912
--- /dev/null
+++ b/depend/zcash/src/test/convertbits_tests.cpp
@@ -0,0 +1,52 @@
+// Copyright (c) 2018 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include <utilstrencodings.h>
+#include <test/test_bitcoin.h>
+#include <zcash/NoteEncryption.hpp>
+
+#include <boost/test/unit_test.hpp>
+
+BOOST_FIXTURE_TEST_SUITE(convertbits_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(convertbits_deterministic)
+{
+    for (size_t i = 0; i < 256; i++) {
+        std::vector<unsigned char> input(32, i);
+        std::vector<unsigned char> data;
+        std::vector<unsigned char> output;
+        ConvertBits<8, 5, true>([&](unsigned char c) { data.push_back(c); }, input.begin(), input.end());
+        ConvertBits<5, 8, false>([&](unsigned char c) { output.push_back(c); }, data.begin(), data.end());
+        BOOST_CHECK_EQUAL(data.size(), 52);
+        BOOST_CHECK_EQUAL(output.size(), 32);
+        BOOST_CHECK(input == output);
+    }
+
+    for (size_t i = 0; i < 256; i++) {
+        std::vector<unsigned char> input(43, i);
+        std::vector<unsigned char> data;
+        std::vector<unsigned char> output;
+        ConvertBits<8, 5, true>([&](unsigned char c) { data.push_back(c); }, input.begin(), input.end());
+        ConvertBits<5, 8, false>([&](unsigned char c) { output.push_back(c); }, data.begin(), data.end());
+        BOOST_CHECK_EQUAL(data.size(), 69);
+        BOOST_CHECK_EQUAL(output.size(), 43);
+        BOOST_CHECK(input == output);
+    }
+}
+
+BOOST_AUTO_TEST_CASE(convertbits_random)
+{
+    for (size_t i = 0; i < 1000; i++) {
+        auto input = libzcash::random_uint256();
+        std::vector<unsigned char> data;
+        std::vector<unsigned char> output;
+        ConvertBits<8, 5, true>([&](unsigned char c) { data.push_back(c); }, input.begin(), input.end());
+        ConvertBits<5, 8, false>([&](unsigned char c) { output.push_back(c); }, data.begin(), data.end());
+        BOOST_CHECK_EQUAL(data.size(), 52);
+        BOOST_CHECK_EQUAL(output.size(), 32);
+        BOOST_CHECK(input == uint256(output));
+    }
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/crypto_tests.cpp b/depend/zcash/src/test/crypto_tests.cpp
new file mode 100644
index 000000000..821cf59dc
--- /dev/null
+++ b/depend/zcash/src/test/crypto_tests.cpp
@@ -0,0 +1,507 @@
+// Copyright (c) 2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "crypto/aes.h"
+#include "crypto/chacha20.h"
+#include "crypto/ripemd160.h"
+#include "crypto/sha1.h"
+#include "crypto/sha256.h"
+#include "crypto/sha512.h"
+#include "crypto/hmac_sha256.h"
+#include "crypto/hmac_sha512.h"
+#include "test_random.h"
+#include "utilstrencodings.h"
+#include "test/test_bitcoin.h"
+
+#include <vector>
+
+#include <boost/assign/list_of.hpp>
+#include <boost/test/unit_test.hpp>
+
+BOOST_FIXTURE_TEST_SUITE(crypto_tests, BasicTestingSetup)
+
+template<typename Hasher, typename In, typename Out>
+void TestVector(const Hasher &h, const In &in, const Out &out) {
+    Out hash;
+    BOOST_CHECK(out.size() == h.OUTPUT_SIZE);
+    hash.resize(out.size());
+    {
+        // Test that writing the whole input string at once works.
+        Hasher(h).Write((unsigned char*)&in[0], in.size()).Finalize(&hash[0]);
+        BOOST_CHECK(hash == out);
+    }
+    for (int i=0; i<32; i++) {
+        // Test that writing the string broken up in random pieces works.
+        Hasher hasher(h);
+        size_t pos = 0;
+        while (pos < in.size()) {
+            size_t len = insecure_rand() % ((in.size() - pos + 1) / 2 + 1);
+            hasher.Write((unsigned char*)&in[pos], len);
+            pos += len;
+            if (pos > 0 && pos + 2 * out.size() > in.size() && pos < in.size()) {
+                // Test that writing the rest at once to a copy of a hasher works.
+                Hasher(hasher).Write((unsigned char*)&in[pos], in.size() - pos).Finalize(&hash[0]);
+                BOOST_CHECK(hash == out);
+            }
+        }
+        hasher.Finalize(&hash[0]);
+        BOOST_CHECK(hash == out);
+    }
+}
+
+void TestSHA1(const std::string &in, const std::string &hexout) { TestVector(CSHA1(), in, ParseHex(hexout));}
+void TestSHA256(const std::string &in, const std::string &hexout) { TestVector(CSHA256(), in, ParseHex(hexout));}
+void TestSHA512(const std::string &in, const std::string &hexout) { TestVector(CSHA512(), in, ParseHex(hexout));}
+void TestRIPEMD160(const std::string &in, const std::string &hexout) { TestVector(CRIPEMD160(), in, ParseHex(hexout));}
+
+void TestHMACSHA256(const std::string &hexkey, const std::string &hexin, const std::string &hexout) {
+    std::vector<unsigned char> key = ParseHex(hexkey);
+    TestVector(CHMAC_SHA256(&key[0], key.size()), ParseHex(hexin), ParseHex(hexout));
+}
+
+void TestHMACSHA512(const std::string &hexkey, const std::string &hexin, const std::string &hexout) {
+    std::vector<unsigned char> key = ParseHex(hexkey);
+    TestVector(CHMAC_SHA512(&key[0], key.size()), ParseHex(hexin), ParseHex(hexout));
+}
+
+void TestAES128(const std::string &hexkey, const std::string &hexin, const std::string &hexout)
+{
+    std::vector<unsigned char> key = ParseHex(hexkey);
+    std::vector<unsigned char> in = ParseHex(hexin);
+    std::vector<unsigned char> correctout = ParseHex(hexout);
+    std::vector<unsigned char> buf, buf2;
+
+    assert(key.size() == 16);
+    assert(in.size() == 16);
+    assert(correctout.size() == 16);
+    AES128Encrypt enc(&key[0]);
+    buf.resize(correctout.size());
+    buf2.resize(correctout.size());
+    enc.Encrypt(&buf[0], &in[0]);
+    BOOST_CHECK_EQUAL(HexStr(buf), HexStr(correctout));
+    AES128Decrypt dec(&key[0]);
+    dec.Decrypt(&buf2[0], &buf[0]);
+    BOOST_CHECK_EQUAL(HexStr(buf2), HexStr(in));
+}
+
+void TestAES256(const std::string &hexkey, const std::string &hexin, const std::string &hexout)
+{
+    std::vector<unsigned char> key = ParseHex(hexkey);
+    std::vector<unsigned char> in = ParseHex(hexin);
+    std::vector<unsigned char> correctout = ParseHex(hexout);
+    std::vector<unsigned char> buf;
+
+    assert(key.size() == 32);
+    assert(in.size() == 16);
+    assert(correctout.size() == 16);
+    AES256Encrypt enc(&key[0]);
+    buf.resize(correctout.size());
+    enc.Encrypt(&buf[0], &in[0]);
+    BOOST_CHECK(buf == correctout);
+    AES256Decrypt dec(&key[0]);
+    dec.Decrypt(&buf[0], &buf[0]);
+    BOOST_CHECK(buf == in);
+}
+
+void TestAES128CBC(const std::string &hexkey, const std::string &hexiv, bool pad, const std::string &hexin, const std::string &hexout)
+{
+    std::vector<unsigned char> key = ParseHex(hexkey);
+    std::vector<unsigned char> iv = ParseHex(hexiv);
+    std::vector<unsigned char> in = ParseHex(hexin);
+    std::vector<unsigned char> correctout = ParseHex(hexout);
+    std::vector<unsigned char> realout(in.size() + AES_BLOCKSIZE);
+
+    // Encrypt the plaintext and verify that it equals the cipher
+    AES128CBCEncrypt enc(&key[0], &iv[0], pad);
+    int size = enc.Encrypt(&in[0], in.size(), &realout[0]);
+    realout.resize(size);
+    BOOST_CHECK(realout.size() == correctout.size());
+    BOOST_CHECK_MESSAGE(realout == correctout, HexStr(realout) + std::string(" != ") + hexout);
+
+    // Decrypt the cipher and verify that it equals the plaintext
+    std::vector<unsigned char> decrypted(correctout.size());
+    AES128CBCDecrypt dec(&key[0], &iv[0], pad);
+    size = dec.Decrypt(&correctout[0], correctout.size(), &decrypted[0]);
+    decrypted.resize(size);
+    BOOST_CHECK(decrypted.size() == in.size());
+    BOOST_CHECK_MESSAGE(decrypted == in, HexStr(decrypted) + std::string(" != ") + hexin);
+
+    // Encrypt and re-decrypt substrings of the plaintext and verify that they equal each-other
+    for(std::vector<unsigned char>::iterator i(in.begin()); i != in.end(); ++i)
+    {
+        std::vector<unsigned char> sub(i, in.end());
+        std::vector<unsigned char> subout(sub.size() + AES_BLOCKSIZE);
+        int _size = enc.Encrypt(&sub[0], sub.size(), &subout[0]);
+        if (_size != 0)
+        {
+            subout.resize(_size);
+            std::vector<unsigned char> subdecrypted(subout.size());
+            _size = dec.Decrypt(&subout[0], subout.size(), &subdecrypted[0]);
+            subdecrypted.resize(_size);
+            BOOST_CHECK(decrypted.size() == in.size());
+            BOOST_CHECK_MESSAGE(subdecrypted == sub, HexStr(subdecrypted) + std::string(" != ") + HexStr(sub));
+        }
+    }
+}
+
+void TestAES256CBC(const std::string &hexkey, const std::string &hexiv, bool pad, const std::string &hexin, const std::string &hexout)
+{
+    std::vector<unsigned char> key = ParseHex(hexkey);
+    std::vector<unsigned char> iv = ParseHex(hexiv);
+    std::vector<unsigned char> in = ParseHex(hexin);
+    std::vector<unsigned char> correctout = ParseHex(hexout);
+    std::vector<unsigned char> realout(in.size() + AES_BLOCKSIZE);
+
+    // Encrypt the plaintext and verify that it equals the cipher
+    AES256CBCEncrypt enc(&key[0], &iv[0], pad);
+    int size = enc.Encrypt(&in[0], in.size(), &realout[0]);
+    realout.resize(size);
+    BOOST_CHECK(realout.size() == correctout.size());
+    BOOST_CHECK_MESSAGE(realout == correctout, HexStr(realout) + std::string(" != ") + hexout);
+
+    // Decrypt the cipher and verify that it equals the plaintext
+    std::vector<unsigned char> decrypted(correctout.size());
+    AES256CBCDecrypt dec(&key[0], &iv[0], pad);
+    size = dec.Decrypt(&correctout[0], correctout.size(), &decrypted[0]);
+    decrypted.resize(size);
+    BOOST_CHECK(decrypted.size() == in.size());
+    BOOST_CHECK_MESSAGE(decrypted == in, HexStr(decrypted) + std::string(" != ") + hexin);
+
+    // Encrypt and re-decrypt substrings of the plaintext and verify that they equal each-other
+    for(std::vector<unsigned char>::iterator i(in.begin()); i != in.end(); ++i)
+    {
+        std::vector<unsigned char> sub(i, in.end());
+        std::vector<unsigned char> subout(sub.size() + AES_BLOCKSIZE);
+        int _size = enc.Encrypt(&sub[0], sub.size(), &subout[0]);
+        if (_size != 0)
+        {
+            subout.resize(_size);
+            std::vector<unsigned char> subdecrypted(subout.size());
+            _size = dec.Decrypt(&subout[0], subout.size(), &subdecrypted[0]);
+            subdecrypted.resize(_size);
+            BOOST_CHECK(decrypted.size() == in.size());
+            BOOST_CHECK_MESSAGE(subdecrypted == sub, HexStr(subdecrypted) + std::string(" != ") + HexStr(sub));
+        }
+    }
+}
+
+void TestChaCha20(const std::string &hexkey, uint64_t nonce, uint64_t seek, const std::string& hexout)
+{
+    std::vector<unsigned char> key = ParseHex(hexkey);
+    ChaCha20 rng(key.data(), key.size());
+    rng.SetIV(nonce);
+    rng.Seek(seek);
+    std::vector<unsigned char> out = ParseHex(hexout);
+    std::vector<unsigned char> outres;
+    outres.resize(out.size());
+    rng.Output(outres.data(), outres.size());
+    BOOST_CHECK(out == outres);
+}
+
+std::string LongTestString(void) {
+    std::string ret;
+    for (int i=0; i<200000; i++) {
+        ret += (unsigned char)(i);
+        ret += (unsigned char)(i >> 4);
+        ret += (unsigned char)(i >> 8);
+        ret += (unsigned char)(i >> 12);
+        ret += (unsigned char)(i >> 16);
+    }
+    return ret;
+}
+
+const std::string test1 = LongTestString();
+
+BOOST_AUTO_TEST_CASE(ripemd160_testvectors) {
+    TestRIPEMD160("", "9c1185a5c5e9fc54612808977ee8f548b2258d31");
+    TestRIPEMD160("abc", "8eb208f7e05d987a9b044a8e98c6b087f15a0bfc");
+    TestRIPEMD160("message digest", "5d0689ef49d2fae572b881b123a85ffa21595f36");
+    TestRIPEMD160("secure hash algorithm", "20397528223b6a5f4cbc2808aba0464e645544f9");
+    TestRIPEMD160("RIPEMD160 is considered to be safe", "a7d78608c7af8a8e728778e81576870734122b66");
+    TestRIPEMD160("abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq",
+                  "12a053384a9c0c88e405a06c27dcf49ada62eb2b");
+    TestRIPEMD160("For this sample, this 63-byte string will be used as input data",
+                  "de90dbfee14b63fb5abf27c2ad4a82aaa5f27a11");
+    TestRIPEMD160("This is exactly 64 bytes long, not counting the terminating byte",
+                  "eda31d51d3a623b81e19eb02e24ff65d27d67b37");
+    TestRIPEMD160(std::string(1000000, 'a'), "52783243c1697bdbe16d37f97f68f08325dc1528");
+    TestRIPEMD160(test1, "464243587bd146ea835cdf57bdae582f25ec45f1");
+}
+
+BOOST_AUTO_TEST_CASE(sha1_testvectors) {
+    TestSHA1("", "da39a3ee5e6b4b0d3255bfef95601890afd80709");
+    TestSHA1("abc", "a9993e364706816aba3e25717850c26c9cd0d89d");
+    TestSHA1("message digest", "c12252ceda8be8994d5fa0290a47231c1d16aae3");
+    TestSHA1("secure hash algorithm", "d4d6d2f0ebe317513bbd8d967d89bac5819c2f60");
+    TestSHA1("SHA1 is considered to be safe", "f2b6650569ad3a8720348dd6ea6c497dee3a842a");
+    TestSHA1("abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq",
+             "84983e441c3bd26ebaae4aa1f95129e5e54670f1");
+    TestSHA1("For this sample, this 63-byte string will be used as input data",
+             "4f0ea5cd0585a23d028abdc1a6684e5a8094dc49");
+    TestSHA1("This is exactly 64 bytes long, not counting the terminating byte",
+             "fb679f23e7d1ce053313e66e127ab1b444397057");
+    TestSHA1(std::string(1000000, 'a'), "34aa973cd4c4daa4f61eeb2bdbad27316534016f");
+    TestSHA1(test1, "b7755760681cbfd971451668f32af5774f4656b5");
+}
+
+BOOST_AUTO_TEST_CASE(sha256_testvectors) {
+    TestSHA256("", "e3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855");
+    TestSHA256("abc", "ba7816bf8f01cfea414140de5dae2223b00361a396177a9cb410ff61f20015ad");
+    TestSHA256("message digest",
+               "f7846f55cf23e14eebeab5b4e1550cad5b509e3348fbc4efa3a1413d393cb650");
+    TestSHA256("secure hash algorithm",
+               "f30ceb2bb2829e79e4ca9753d35a8ecc00262d164cc077080295381cbd643f0d");
+    TestSHA256("SHA256 is considered to be safe",
+               "6819d915c73f4d1e77e4e1b52d1fa0f9cf9beaead3939f15874bd988e2a23630");
+    TestSHA256("abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq",
+               "248d6a61d20638b8e5c026930c3e6039a33ce45964ff2167f6ecedd419db06c1");
+    TestSHA256("For this sample, this 63-byte string will be used as input data",
+               "f08a78cbbaee082b052ae0708f32fa1e50c5c421aa772ba5dbb406a2ea6be342");
+    TestSHA256("This is exactly 64 bytes long, not counting the terminating byte",
+               "ab64eff7e88e2e46165e29f2bce41826bd4c7b3552f6b382a9e7d3af47c245f8");
+    TestSHA256("As Bitcoin relies on 80 byte header hashes, we want to have an example for that.",
+               "7406e8de7d6e4fffc573daef05aefb8806e7790f55eab5576f31349743cca743");
+    TestSHA256(std::string(1000000, 'a'),
+               "cdc76e5c9914fb9281a1c7e284d73e67f1809a48a497200e046d39ccc7112cd0");
+    TestSHA256(test1, "a316d55510b49662420f49d145d42fb83f31ef8dc016aa4e32df049991a91e26");
+}
+
+BOOST_AUTO_TEST_CASE(sha512_testvectors) {
+    TestSHA512("",
+               "cf83e1357eefb8bdf1542850d66d8007d620e4050b5715dc83f4a921d36ce9ce"
+               "47d0d13c5d85f2b0ff8318d2877eec2f63b931bd47417a81a538327af927da3e");
+    TestSHA512("abc",
+               "ddaf35a193617abacc417349ae20413112e6fa4e89a97ea20a9eeee64b55d39a"
+               "2192992a274fc1a836ba3c23a3feebbd454d4423643ce80e2a9ac94fa54ca49f");
+    TestSHA512("message digest",
+               "107dbf389d9e9f71a3a95f6c055b9251bc5268c2be16d6c13492ea45b0199f33"
+               "09e16455ab1e96118e8a905d5597b72038ddb372a89826046de66687bb420e7c");
+    TestSHA512("secure hash algorithm",
+               "7746d91f3de30c68cec0dd693120a7e8b04d8073cb699bdce1a3f64127bca7a3"
+               "d5db502e814bb63c063a7a5043b2df87c61133395f4ad1edca7fcf4b30c3236e");
+    TestSHA512("SHA512 is considered to be safe",
+               "099e6468d889e1c79092a89ae925a9499b5408e01b66cb5b0a3bd0dfa51a9964"
+               "6b4a3901caab1318189f74cd8cf2e941829012f2449df52067d3dd5b978456c2");
+    TestSHA512("abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq",
+               "204a8fc6dda82f0a0ced7beb8e08a41657c16ef468b228a8279be331a703c335"
+               "96fd15c13b1b07f9aa1d3bea57789ca031ad85c7a71dd70354ec631238ca3445");
+    TestSHA512("For this sample, this 63-byte string will be used as input data",
+               "b3de4afbc516d2478fe9b518d063bda6c8dd65fc38402dd81d1eb7364e72fb6e"
+               "6663cf6d2771c8f5a6da09601712fb3d2a36c6ffea3e28b0818b05b0a8660766");
+    TestSHA512("This is exactly 64 bytes long, not counting the terminating byte",
+               "70aefeaa0e7ac4f8fe17532d7185a289bee3b428d950c14fa8b713ca09814a38"
+               "7d245870e007a80ad97c369d193e41701aa07f3221d15f0e65a1ff970cedf030");
+    TestSHA512("abcdefghbcdefghicdefghijdefghijkefghijklfghijklmghijklmnhijklmno"
+               "ijklmnopjklmnopqklmnopqrlmnopqrsmnopqrstnopqrstu",
+               "8e959b75dae313da8cf4f72814fc143f8f7779c6eb9f7fa17299aeadb6889018"
+               "501d289e4900f7e4331b99dec4b5433ac7d329eeb6dd26545e96e55b874be909");
+    TestSHA512(std::string(1000000, 'a'),
+               "e718483d0ce769644e2e42c7bc15b4638e1f98b13b2044285632a803afa973eb"
+               "de0ff244877ea60a4cb0432ce577c31beb009c5c2c49aa2e4eadb217ad8cc09b");
+    TestSHA512(test1,
+               "40cac46c147e6131c5193dd5f34e9d8bb4951395f27b08c558c65ff4ba2de594"
+               "37de8c3ef5459d76a52cedc02dc499a3c9ed9dedbfb3281afd9653b8a112fafc");
+}
+
+BOOST_AUTO_TEST_CASE(hmac_sha256_testvectors) {
+    // test cases 1, 2, 3, 4, 6 and 7 of RFC 4231
+    TestHMACSHA256("0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b",
+                   "4869205468657265",
+                   "b0344c61d8db38535ca8afceaf0bf12b881dc200c9833da726e9376c2e32cff7");
+    TestHMACSHA256("4a656665",
+                   "7768617420646f2079612077616e7420666f72206e6f7468696e673f",
+                   "5bdcc146bf60754e6a042426089575c75a003f089d2739839dec58b964ec3843");
+    TestHMACSHA256("aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
+                   "dddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd"
+                   "dddddddddddddddddddddddddddddddddddd",
+                   "773ea91e36800e46854db8ebd09181a72959098b3ef8c122d9635514ced565fe");
+    TestHMACSHA256("0102030405060708090a0b0c0d0e0f10111213141516171819",
+                   "cdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcd"
+                   "cdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcd",
+                   "82558a389a443c0ea4cc819899f2083a85f0faa3e578f8077a2e3ff46729665b");
+    TestHMACSHA256("aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
+                   "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
+                   "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
+                   "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
+                   "aaaaaa",
+                   "54657374205573696e67204c6172676572205468616e20426c6f636b2d53697a"
+                   "65204b6579202d2048617368204b6579204669727374",
+                   "60e431591ee0b67f0d8a26aacbf5b77f8e0bc6213728c5140546040f0ee37f54");
+    TestHMACSHA256("aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
+                   "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
+                   "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
+                   "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
+                   "aaaaaa",
+                   "5468697320697320612074657374207573696e672061206c6172676572207468"
+                   "616e20626c6f636b2d73697a65206b657920616e642061206c61726765722074"
+                   "68616e20626c6f636b2d73697a6520646174612e20546865206b6579206e6565"
+                   "647320746f20626520686173686564206265666f7265206265696e6720757365"
+                   "642062792074686520484d414320616c676f726974686d2e",
+                   "9b09ffa71b942fcb27635fbcd5b0e944bfdc63644f0713938a7f51535c3a35e2");
+}
+
+BOOST_AUTO_TEST_CASE(hmac_sha512_testvectors) {
+    // test cases 1, 2, 3, 4, 6 and 7 of RFC 4231
+    TestHMACSHA512("0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b0b",
+                   "4869205468657265",
+                   "87aa7cdea5ef619d4ff0b4241a1d6cb02379f4e2ce4ec2787ad0b30545e17cde"
+                   "daa833b7d6b8a702038b274eaea3f4e4be9d914eeb61f1702e696c203a126854");
+    TestHMACSHA512("4a656665",
+                   "7768617420646f2079612077616e7420666f72206e6f7468696e673f",
+                   "164b7a7bfcf819e2e395fbe73b56e0a387bd64222e831fd610270cd7ea250554"
+                   "9758bf75c05a994a6d034f65f8f0e6fdcaeab1a34d4a6b4b636e070a38bce737");
+    TestHMACSHA512("aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa",
+                   "dddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd"
+                   "dddddddddddddddddddddddddddddddddddd",
+                   "fa73b0089d56a284efb0f0756c890be9b1b5dbdd8ee81a3655f83e33b2279d39"
+                   "bf3e848279a722c806b485a47e67c807b946a337bee8942674278859e13292fb");
+    TestHMACSHA512("0102030405060708090a0b0c0d0e0f10111213141516171819",
+                   "cdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcd"
+                   "cdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcdcd",
+                   "b0ba465637458c6990e5a8c5f61d4af7e576d97ff94b872de76f8050361ee3db"
+                   "a91ca5c11aa25eb4d679275cc5788063a5f19741120c4f2de2adebeb10a298dd");
+    TestHMACSHA512("aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
+                   "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
+                   "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
+                   "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
+                   "aaaaaa",
+                   "54657374205573696e67204c6172676572205468616e20426c6f636b2d53697a"
+                   "65204b6579202d2048617368204b6579204669727374",
+                   "80b24263c7c1a3ebb71493c1dd7be8b49b46d1f41b4aeec1121b013783f8f352"
+                   "6b56d037e05f2598bd0fd2215d6a1e5295e64f73f63f0aec8b915a985d786598");
+    TestHMACSHA512("aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
+                   "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
+                   "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
+                   "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
+                   "aaaaaa",
+                   "5468697320697320612074657374207573696e672061206c6172676572207468"
+                   "616e20626c6f636b2d73697a65206b657920616e642061206c61726765722074"
+                   "68616e20626c6f636b2d73697a6520646174612e20546865206b6579206e6565"
+                   "647320746f20626520686173686564206265666f7265206265696e6720757365"
+                   "642062792074686520484d414320616c676f726974686d2e",
+                   "e37b6a775dc87dbaa4dfa9f96e5e3ffddebd71f8867289865df5a32d20cdc944"
+                   "b6022cac3c4982b10d5eeb55c3e4de15134676fb6de0446065c97440fa8c6a58");
+}
+
+BOOST_AUTO_TEST_CASE(aes_testvectors) {
+    // AES test vectors from FIPS 197.
+    TestAES128("000102030405060708090a0b0c0d0e0f", "00112233445566778899aabbccddeeff", "69c4e0d86a7b0430d8cdb78070b4c55a");
+    TestAES256("000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", "00112233445566778899aabbccddeeff", "8ea2b7ca516745bfeafc49904b496089");
+
+    // AES-ECB test vectors from NIST sp800-38a.
+    TestAES128("2b7e151628aed2a6abf7158809cf4f3c", "6bc1bee22e409f96e93d7e117393172a", "3ad77bb40d7a3660a89ecaf32466ef97");
+    TestAES128("2b7e151628aed2a6abf7158809cf4f3c", "ae2d8a571e03ac9c9eb76fac45af8e51", "f5d3d58503b9699de785895a96fdbaaf");
+    TestAES128("2b7e151628aed2a6abf7158809cf4f3c", "30c81c46a35ce411e5fbc1191a0a52ef", "43b1cd7f598ece23881b00e3ed030688");
+    TestAES128("2b7e151628aed2a6abf7158809cf4f3c", "f69f2445df4f9b17ad2b417be66c3710", "7b0c785e27e8ad3f8223207104725dd4");
+    TestAES256("603deb1015ca71be2b73aef0857d77811f352c073b6108d72d9810a30914dff4", "6bc1bee22e409f96e93d7e117393172a", "f3eed1bdb5d2a03c064b5a7e3db181f8");
+    TestAES256("603deb1015ca71be2b73aef0857d77811f352c073b6108d72d9810a30914dff4", "ae2d8a571e03ac9c9eb76fac45af8e51", "591ccb10d410ed26dc5ba74a31362870");
+    TestAES256("603deb1015ca71be2b73aef0857d77811f352c073b6108d72d9810a30914dff4", "30c81c46a35ce411e5fbc1191a0a52ef", "b6ed21b99ca6f4f9f153e7b1beafed1d");
+    TestAES256("603deb1015ca71be2b73aef0857d77811f352c073b6108d72d9810a30914dff4", "f69f2445df4f9b17ad2b417be66c3710", "23304b7a39f9f3ff067d8d8f9e24ecc7");
+}
+
+BOOST_AUTO_TEST_CASE(aes_cbc_testvectors) {
+
+    // NIST AES CBC 128-bit encryption test-vectors
+    TestAES128CBC("2b7e151628aed2a6abf7158809cf4f3c", "000102030405060708090A0B0C0D0E0F", false, \
+                  "6bc1bee22e409f96e93d7e117393172a", "7649abac8119b246cee98e9b12e9197d");
+    TestAES128CBC("2b7e151628aed2a6abf7158809cf4f3c", "7649ABAC8119B246CEE98E9B12E9197D", false, \
+                  "ae2d8a571e03ac9c9eb76fac45af8e51", "5086cb9b507219ee95db113a917678b2");
+    TestAES128CBC("2b7e151628aed2a6abf7158809cf4f3c", "5086cb9b507219ee95db113a917678b2", false, \
+                  "30c81c46a35ce411e5fbc1191a0a52ef", "73bed6b8e3c1743b7116e69e22229516");
+    TestAES128CBC("2b7e151628aed2a6abf7158809cf4f3c", "73bed6b8e3c1743b7116e69e22229516", false, \
+                  "f69f2445df4f9b17ad2b417be66c3710", "3ff1caa1681fac09120eca307586e1a7");
+
+    // The same vectors with padding enabled
+    TestAES128CBC("2b7e151628aed2a6abf7158809cf4f3c", "000102030405060708090A0B0C0D0E0F", true, \
+                  "6bc1bee22e409f96e93d7e117393172a", "7649abac8119b246cee98e9b12e9197d8964e0b149c10b7b682e6e39aaeb731c");
+    TestAES128CBC("2b7e151628aed2a6abf7158809cf4f3c", "7649ABAC8119B246CEE98E9B12E9197D", true, \
+                  "ae2d8a571e03ac9c9eb76fac45af8e51", "5086cb9b507219ee95db113a917678b255e21d7100b988ffec32feeafaf23538");
+    TestAES128CBC("2b7e151628aed2a6abf7158809cf4f3c", "5086cb9b507219ee95db113a917678b2", true, \
+                  "30c81c46a35ce411e5fbc1191a0a52ef", "73bed6b8e3c1743b7116e69e22229516f6eccda327bf8e5ec43718b0039adceb");
+    TestAES128CBC("2b7e151628aed2a6abf7158809cf4f3c", "73bed6b8e3c1743b7116e69e22229516", true, \
+                  "f69f2445df4f9b17ad2b417be66c3710", "3ff1caa1681fac09120eca307586e1a78cb82807230e1321d3fae00d18cc2012");
+
+    // NIST AES CBC 256-bit encryption test-vectors
+    TestAES256CBC("603deb1015ca71be2b73aef0857d77811f352c073b6108d72d9810a30914dff4", \
+                  "000102030405060708090A0B0C0D0E0F", false, "6bc1bee22e409f96e93d7e117393172a", \
+                  "f58c4c04d6e5f1ba779eabfb5f7bfbd6");
+    TestAES256CBC("603deb1015ca71be2b73aef0857d77811f352c073b6108d72d9810a30914dff4", \
+                  "F58C4C04D6E5F1BA779EABFB5F7BFBD6", false, "ae2d8a571e03ac9c9eb76fac45af8e51", \
+                  "9cfc4e967edb808d679f777bc6702c7d");
+    TestAES256CBC("603deb1015ca71be2b73aef0857d77811f352c073b6108d72d9810a30914dff4", \
+                  "9CFC4E967EDB808D679F777BC6702C7D", false, "30c81c46a35ce411e5fbc1191a0a52ef",
+                  "39f23369a9d9bacfa530e26304231461");
+    TestAES256CBC("603deb1015ca71be2b73aef0857d77811f352c073b6108d72d9810a30914dff4", \
+                  "39F23369A9D9BACFA530E26304231461", false, "f69f2445df4f9b17ad2b417be66c3710", \
+                  "b2eb05e2c39be9fcda6c19078c6a9d1b");
+
+    // The same vectors with padding enabled
+    TestAES256CBC("603deb1015ca71be2b73aef0857d77811f352c073b6108d72d9810a30914dff4", \
+                  "000102030405060708090A0B0C0D0E0F", true, "6bc1bee22e409f96e93d7e117393172a", \
+                  "f58c4c04d6e5f1ba779eabfb5f7bfbd6485a5c81519cf378fa36d42b8547edc0");
+    TestAES256CBC("603deb1015ca71be2b73aef0857d77811f352c073b6108d72d9810a30914dff4", \
+                  "F58C4C04D6E5F1BA779EABFB5F7BFBD6", true, "ae2d8a571e03ac9c9eb76fac45af8e51", \
+                  "9cfc4e967edb808d679f777bc6702c7d3a3aa5e0213db1a9901f9036cf5102d2");
+    TestAES256CBC("603deb1015ca71be2b73aef0857d77811f352c073b6108d72d9810a30914dff4", \
+                  "9CFC4E967EDB808D679F777BC6702C7D", true, "30c81c46a35ce411e5fbc1191a0a52ef",
+                  "39f23369a9d9bacfa530e263042314612f8da707643c90a6f732b3de1d3f5cee");
+    TestAES256CBC("603deb1015ca71be2b73aef0857d77811f352c073b6108d72d9810a30914dff4", \
+                  "39F23369A9D9BACFA530E26304231461", true, "f69f2445df4f9b17ad2b417be66c3710", \
+                  "b2eb05e2c39be9fcda6c19078c6a9d1b3f461796d6b0d6b2e0c2a72b4d80e644");
+}
+
+
+BOOST_AUTO_TEST_CASE(chacha20_testvector)
+{
+    // Test vector from RFC 7539
+    TestChaCha20("000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 0x4a000000UL, 1,
+                 "224f51f3401bd9e12fde276fb8631ded8c131f823d2c06e27e4fcaec9ef3cf788a3b0aa372600a92b57974cded2b9334794cb"
+                 "a40c63e34cdea212c4cf07d41b769a6749f3f630f4122cafe28ec4dc47e26d4346d70b98c73f3e9c53ac40c5945398b6eda1a"
+                 "832c89c167eacd901d7e2bf363");
+
+    // Test vectors from https://tools.ietf.org/html/draft-agl-tls-chacha20poly1305-04#section-7
+    TestChaCha20("0000000000000000000000000000000000000000000000000000000000000000", 0, 0,
+                 "76b8e0ada0f13d90405d6ae55386bd28bdd219b8a08ded1aa836efcc8b770dc7da41597c5157488d7724e03fb8d84a376a43b"
+                 "8f41518a11cc387b669b2ee6586");
+    TestChaCha20("0000000000000000000000000000000000000000000000000000000000000001", 0, 0,
+                 "4540f05a9f1fb296d7736e7b208e3c96eb4fe1834688d2604f450952ed432d41bbe2a0b6ea7566d2a5d1e7e20d42af2c53d79"
+                 "2b1c43fea817e9ad275ae546963");
+    TestChaCha20("0000000000000000000000000000000000000000000000000000000000000000", 0x0100000000000000ULL, 0,
+                 "de9cba7bf3d69ef5e786dc63973f653a0b49e015adbff7134fcb7df137821031e85a050278a7084527214f73efc7fa5b52770"
+                 "62eb7a0433e445f41e3");
+    TestChaCha20("0000000000000000000000000000000000000000000000000000000000000000", 1, 0,
+                 "ef3fdfd6c61578fbf5cf35bd3dd33b8009631634d21e42ac33960bd138e50d32111e4caf237ee53ca8ad6426194a88545ddc4"
+                 "97a0b466e7d6bbdb0041b2f586b");
+    TestChaCha20("000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 0x0706050403020100ULL, 0,
+                 "f798a189f195e66982105ffb640bb7757f579da31602fc93ec01ac56f85ac3c134a4547b733b46413042c9440049176905d3b"
+                 "e59ea1c53f15916155c2be8241a38008b9a26bc35941e2444177c8ade6689de95264986d95889fb60e84629c9bd9a5acb1cc1"
+                 "18be563eb9b3a4a472f82e09a7e778492b562ef7130e88dfe031c79db9d4f7c7a899151b9a475032b63fc385245fe054e3dd5"
+                 "a97a5f576fe064025d3ce042c566ab2c507b138db853e3d6959660996546cc9c4a6eafdc777c040d70eaf46f76dad3979e5c5"
+                 "360c3317166a1c894c94a371876a94df7628fe4eaaf2ccb27d5aaae0ad7ad0f9d4b6ad3b54098746d4524d38407a6deb3ab78"
+                 "fab78c9");
+}
+
+BOOST_AUTO_TEST_CASE(countbits_tests)
+{
+    FastRandomContext ctx;
+    for (int i = 0; i <= 64; ++i) {
+        if (i == 0) {
+            // Check handling of zero.
+            BOOST_CHECK_EQUAL(CountBits(0), 0);
+        } else if (i < 10) {
+            for (uint64_t j = 1 << (i - 1); (j >> i) == 0; ++j) {
+                // Exhaustively test up to 10 bits
+                BOOST_CHECK_EQUAL(CountBits(j), i);
+            }
+        } else {
+            for (int k = 0; k < 1000; k++) {
+                // Randomly test 1000 samples of each length above 10 bits.
+                uint64_t j = ((uint64_t)1) << (i - 1) | ctx.randbits(i - 1);
+                BOOST_CHECK_EQUAL(CountBits(j), i);
+            }
+        }
+    }
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/data/README.md b/depend/zcash/src/test/data/README.md
new file mode 100644
index 000000000..bc31cbf3e
--- /dev/null
+++ b/depend/zcash/src/test/data/README.md
@@ -0,0 +1,12 @@
+Description
+------------
+
+This directory contains data-driven tests for various aspects of Bitcoin.
+
+License
+--------
+
+The data files in this directory are distributed under the MIT software
+license, see the accompanying file COPYING or
+https://www.opensource.org/licenses/mit-license.php .
+
diff --git a/depend/zcash/src/test/data/alertTests.raw b/depend/zcash/src/test/data/alertTests.raw
new file mode 100644
index 000000000..03e35439e
Binary files /dev/null and b/depend/zcash/src/test/data/alertTests.raw differ
diff --git a/depend/zcash/src/test/data/base58_encode_decode.json b/depend/zcash/src/test/data/base58_encode_decode.json
new file mode 100644
index 000000000..9448f256d
--- /dev/null
+++ b/depend/zcash/src/test/data/base58_encode_decode.json
@@ -0,0 +1,14 @@
+[
+["", ""],
+["61", "2g"],
+["626262", "a3gV"],
+["636363", "aPEr"],
+["73696d706c792061206c6f6e6720737472696e67", "2cFupjhnEsSn59qHXstmK2ffpLv2"],
+["00eb15231dfceb60925886b67d065299925915aeb172c06647", "1NS17iag9jJgTHD1VXjvLCEnZuQ3rJDE9L"],
+["516b6fcd0f", "ABnLTmg"],
+["bf4f89001e670274dd", "3SEo3LWLoPntC"],
+["572e4794", "3EFU7m"],
+["ecac89cad93923c02321", "EJDM8drfXA6uyA"],
+["10c8511e", "Rt5zm"],
+["00000000000000000000", "1111111111"]
+]
diff --git a/depend/zcash/src/test/data/base58_keys_invalid.json b/depend/zcash/src/test/data/base58_keys_invalid.json
new file mode 100644
index 000000000..a088620f1
--- /dev/null
+++ b/depend/zcash/src/test/data/base58_keys_invalid.json
@@ -0,0 +1,152 @@
+[
+    [
+        ""
+    ], 
+    [
+        "x"
+    ], 
+    [
+        "37qgekLpCCHrQuSjvX3fs496FWTGsHFHizjJAs6NPcR47aefnnCWECAhHV6E3g4YN7u7Yuwod5Y"
+    ], 
+    [
+        "dzb7VV1Ui55BARxv7ATxAtCUeJsANKovDGWFVgpTbhq9gvPqP3yv"
+    ], 
+    [
+        "MuNu7ZAEDFiHthiunm7dPjwKqrVNCM3mAz6rP9zFveQu14YA8CxExSJTHcVP9DErn6u84E6Ej7S"
+    ], 
+    [
+        "rPpQpYknyNQ5AEHuY6H8ijJJrYc2nDKKk9jjmKEXsWzyAQcFGpDLU2Zvsmoi8JLR7hAwoy3RQWf"
+    ], 
+    [
+        "4Uc3FmN6NQ6zLBK5QQBXRBUREaaHwCZYsGCueHauuDmJpZKn6jkEskMB2Zi2CNgtb5r6epWEFfUJq"
+    ], 
+    [
+        "7aQgR5DFQ25vyXmqZAWmnVCjL3PkBcdVkBUpjrjMTcghHx3E8wb"
+    ], 
+    [
+        "17QpPprjeg69fW1DV8DcYYCKvWjYhXvWkov6MJ1iTTvMFj6weAqW7wybZeH57WTNxXVCRH4veVs"
+    ], 
+    [
+        "KxuACDviz8Xvpn1xAh9MfopySZNuyajYMZWz16Dv2mHHryznWUp3"
+    ], 
+    [
+        "7nK3GSmqdXJQtdohvGfJ7KsSmn3TmGqExug49583bDAL91pVSGq5xS9SHoAYL3Wv3ijKTit65th"
+    ], 
+    [
+        "cTivdBmq7bay3RFGEBBuNfMh2P1pDCgRYN2Wbxmgwr4ki3jNUL2va"
+    ], 
+    [
+        "gjMV4vjNjyMrna4fsAr8bWxAbwtmMUBXJS3zL4NJt5qjozpbQLmAfK1uA3CquSqsZQMpoD1g2nk"
+    ], 
+    [
+        "emXm1naBMoVzPjbk7xpeTVMFy4oDEe25UmoyGgKEB1gGWsK8kRGs"
+    ], 
+    [
+        "7VThQnNRj1o3Zyvc7XHPRrjDf8j2oivPTeDXnRPYWeYGE4pXeRJDZgf28ppti5hsHWXS2GSobdqyo"
+    ], 
+    [
+        "1G9u6oCVCPh2o8m3t55ACiYvG1y5BHewUkDSdiQarDcYXXhFHYdzMdYfUAhfxn5vNZBwpgUNpso"
+    ], 
+    [
+        "31QQ7ZMLkScDiB4VyZjuptr7AEc9j1SjstF7pRoLhHTGkW4Q2y9XELobQmhhWxeRvqcukGd1XCq"
+    ], 
+    [
+        "DHqKSnpxa8ZdQyH8keAhvLTrfkyBMQxqngcQA5N8LQ9KVt25kmGN"
+    ], 
+    [
+        "2LUHcJPbwLCy9GLH1qXmfmAwvadWw4bp4PCpDfduLqV17s6iDcy1imUwhQJhAoNoN1XNmweiJP4i"
+    ], 
+    [
+        "7USRzBXAnmck8fX9HmW7RAb4qt92VFX6soCnts9s74wxm4gguVhtG5of8fZGbNPJA83irHVY6bCos"
+    ], 
+    [
+        "1DGezo7BfVebZxAbNT3XGujdeHyNNBF3vnficYoTSp4PfK2QaML9bHzAMxke3wdKdHYWmsMTJVu"
+    ], 
+    [
+        "2D12DqDZKwCxxkzs1ZATJWvgJGhQ4cFi3WrizQ5zLAyhN5HxuAJ1yMYaJp8GuYsTLLxTAz6otCfb"
+    ], 
+    [
+        "8AFJzuTujXjw1Z6M3fWhQ1ujDW7zsV4ePeVjVo7D1egERqSW9nZ"
+    ], 
+    [
+        "163Q17qLbTCue8YY3AvjpUhotuaodLm2uqMhpYirsKjVqnxJRWTEoywMVY3NbBAHuhAJ2cF9GAZ"
+    ], 
+    [
+        "2MnmgiRH4eGLyLc9eAqStzk7dFgBjFtUCtu"
+    ], 
+    [
+        "461QQ2sYWxU7H2PV4oBwJGNch8XVTYYbZxU"
+    ], 
+    [
+        "2UCtv53VttmQYkVU4VMtXB31REvQg4ABzs41AEKZ8UcB7DAfVzdkV9JDErwGwyj5AUHLkmgZeobs"
+    ], 
+    [
+        "cSNjAsnhgtiFMi6MtfvgscMB2Cbhn2v1FUYfviJ1CdjfidvmeW6mn"
+    ], 
+    [
+        "gmsow2Y6EWAFDFE1CE4Hd3Tpu2BvfmBfG1SXsuRARbnt1WjkZnFh1qGTiptWWbjsq2Q6qvpgJVj"
+    ], 
+    [
+        "nksUKSkzS76v8EsSgozXGMoQFiCoCHzCVajFKAXqzK5on9ZJYVHMD5CKwgmX3S3c7M1U3xabUny"
+    ], 
+    [
+        "L3favK1UzFGgdzYBF2oBT5tbayCo4vtVBLJhg2iYuMeePxWG8SQc"
+    ], 
+    [
+        "7VxLxGGtYT6N99GdEfi6xz56xdQ8nP2dG1CavuXx7Rf2PrvNMTBNevjkfgs9JmkcGm6EXpj8ipyPZ"
+    ], 
+    [
+        "2mbZwFXF6cxShaCo2czTRB62WTx9LxhTtpP"
+    ], 
+    [
+        "dB7cwYdcPSgiyAwKWL3JwCVwSk6epU2txw"
+    ], 
+    [
+        "HPhFUhUAh8ZQQisH8QQWafAxtQYju3SFTX"
+    ], 
+    [
+        "4ctAH6AkHzq5ioiM1m9T3E2hiYEev5mTsB"
+    ], 
+    [
+        "Hn1uFi4dNexWrqARpjMqgT6cX1UsNPuV3cHdGg9ExyXw8HTKadbktRDtdeVmY3M1BxJStiL4vjJ"
+    ], 
+    [
+        "Sq3fDbvutABmnAHHExJDgPLQn44KnNC7UsXuT7KZecpaYDMU9Txs"
+    ], 
+    [
+        "6TqWyrqdgUEYDQU1aChMuFMMEimHX44qHFzCUgGfqxGgZNMUVWJ"
+    ], 
+    [
+        "giqJo7oWqFxNKWyrgcBxAVHXnjJ1t6cGoEffce5Y1y7u649Noj5wJ4mmiUAKEVVrYAGg2KPB3Y4"
+    ], 
+    [
+        "cNzHY5e8vcmM3QVJUcjCyiKMYfeYvyueq5qCMV3kqcySoLyGLYUK"
+    ], 
+    [
+        "37uTe568EYc9WLoHEd9jXEvUiWbq5LFLscNyqvAzLU5vBArUJA6eydkLmnMwJDjkL5kXc2VK7ig"
+    ], 
+    [
+        "EsYbG4tWWWY45G31nox838qNdzksbPySWc"
+    ], 
+    [
+        "nbuzhfwMoNzA3PaFnyLcRxE9bTJPDkjZ6Rf6Y6o2ckXZfzZzXBT"
+    ], 
+    [
+        "cQN9PoxZeCWK1x56xnz6QYAsvR11XAce3Ehp3gMUdfSQ53Y2mPzx"
+    ], 
+    [
+        "1Gm3N3rkef6iMbx4voBzaxtXcmmiMTqZPhcuAepRzYUJQW4qRpEnHvMojzof42hjFRf8PE2jPde"
+    ], 
+    [
+        "2TAq2tuN6x6m233bpT7yqdYQPELdTDJn1eU"
+    ], 
+    [
+        "ntEtnnGhqPii4joABvBtSEJG6BxjT2tUZqE8PcVYgk3RHpgxgHDCQxNbLJf7ardf1dDk2oCQ7Cf"
+    ], 
+    [
+        "Ky1YjoZNgQ196HJV3HpdkecfhRBmRZdMJk89Hi5KGfpfPwS2bUbfd"
+    ], 
+    [
+        "2A1q1YsMZowabbvta7kTy2Fd6qN4r5ZCeG3qLpvZBMzCixMUdkN2Y4dHB1wPsZAeVXUGD83MfRED"
+    ]
+]
diff --git a/depend/zcash/src/test/data/base58_keys_valid.json b/depend/zcash/src/test/data/base58_keys_valid.json
new file mode 100644
index 000000000..0668d125d
--- /dev/null
+++ b/depend/zcash/src/test/data/base58_keys_valid.json
@@ -0,0 +1,426 @@
+[
+    [
+        "t1T8yaLVhNqxA5KJcmiqqFN88e8DNp2PBfF",
+        "76a91465a16059864a2fdbc7c99a4723a8395bc6f188eb88ac",
+        {
+            "isPrivkey": false,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "t3VDyGHn9mbyCf448m2cHTu5uXvsJpKHbiZ",
+        "a91474f209f6ea907e2ea48f74fae05782ae8a66525787",
+        {
+            "isPrivkey": false,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "tmHMBeeYRuc2eVicLNfP15YLxbQsooCA6jb",
+        "76a91453c0307d6851aa0ce7825ba883c6bd9ad242b48688ac",
+        {
+            "isPrivkey": false,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "t2Fbo6DBKKVYw1SfrY8bEgz56hYEhywhEN6",
+        "a9146349a418fc4578d10a372b54b45c280cc8c4382f87",
+        {
+            "isPrivkey": false,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "5Kd3NBUAdUnhyzenEwVLy9pBKxSwXvE9FMPyR4UKZvpe6E3AgLr",
+        "eddbdc1168f1daeadbd3e44c1e3f8f5a284c2029f78ad26af98583a499de5b19",
+        {
+            "isCompressed": false,
+            "isPrivkey": true,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "Kz6UJmQACJmLtaQj5A3JAge4kVTNQ8gbvXuwbmCj7bsaabudb3RD",
+        "55c9bccb9ed68446d1b75273bbce89d7fe013a8acd1625514420fb2aca1a21c4",
+        {
+            "isCompressed": true,
+            "isPrivkey": true,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "9213qJab2HNEpMpYNBa7wHGFKKbkDn24jpANDs2huN3yi4J11ko",
+        "36cb93b9ab1bdabf7fb9f2c04f1b9cc879933530ae7842398eef5a63a56800c2",
+        {
+            "isCompressed": false,
+            "isPrivkey": true,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "cTpB4YiyKiBcPxnefsDpbnDxFDffjqJob8wGCEDXxgQ7zQoMXJdH",
+        "b9f4892c9e8282028fea1d2667c4dc5213564d41fc5783896a0d843fc15089f3",
+        {
+            "isCompressed": true,
+            "isPrivkey": true,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "t1TpfguJj5zxKUfWcsNTrh6eod2XXsTKtvB",
+        "76a9146d23156cbbdcc82a5a47eee4c2c7c583c18b6bf488ac",
+        {
+            "isPrivkey": false,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "t3hc9Y2stuEWjS2dRDtGdiu3enMpxAbeUiK",
+        "a914fcc5460dd6e2487c7d75b1963625da0e8f4c597587",
+        {
+            "isPrivkey": false,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "tmXm2g5ouU8Pzksmqx3KYmeoeaWrAvj3rB5",
+        "76a914f1d470f9b02370fdec2e6b708b08ac431bf7a5f788ac",
+        {
+            "isPrivkey": false,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "t2QYxHjM8btztWTsMnFnZNurm7RXENk9ZhR",
+        "a914c579342c2c4c9220205e2cdc285617040c924a0a87",
+        {
+            "isPrivkey": false,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "5K494XZwps2bGyeL71pWid4noiSNA2cfCibrvRWqcHSptoFn7rc",
+        "a326b95ebae30164217d7a7f57d72ab2b54e3be64928a19da0210b9568d4015e",
+        {
+            "isCompressed": false,
+            "isPrivkey": true,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "L1RrrnXkcKut5DEMwtDthjwRcTTwED36thyL1DebVrKuwvohjMNi",
+        "7d998b45c219a1e38e99e7cbd312ef67f77a455a9b50c730c27f02c6f730dfb4",
+        {
+            "isCompressed": true,
+            "isPrivkey": true,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "93DVKyFYwSN6wEo3E2fCrFPUp17FtrtNi2Lf7n4G3garFb16CRj",
+        "d6bca256b5abc5602ec2e1c121a08b0da2556587430bcf7e1898af2224885203",
+        {
+            "isCompressed": false,
+            "isPrivkey": true,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "cTDVKtMGVYWTHCb1AFjmVbEbWjvKpKqKgMaR3QJxToMSQAhmCeTN",
+        "a81ca4e8f90181ec4b61b6a7eb998af17b2cb04de8a03b504b9e34c4c61db7d9",
+        {
+            "isCompressed": true,
+            "isPrivkey": true,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "t1UxCT4RrCbGH36etfQaPF1svNtZVhsqs5A",
+        "76a9147987ccaa53d02c8873487ef919677cd3db7a691288ac",
+        {
+            "isPrivkey": false,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "t3Teyxv1gF8FZ9MW8WN4MvTxQ4JScABsKfL",
+        "a91463bcc565f9e68ee0189dd5cc67f1b0e5f02f45cb87",
+        {
+            "isPrivkey": false,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "tmXYBLe2Q9MbXfgGb2QqdN7RWdi7tQ2z8ya",
+        "76a914ef66444b5b17f14e8fae6e7e19b045a78c54fd7988ac",
+        {
+            "isPrivkey": false,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "t2QQcXALz4745JEgzuAEsJNgt6nBQpsqegu",
+        "a914c3e55fceceaa4391ed2a9677f4a4d34eacd021a087",
+        {
+            "isPrivkey": false,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "5KaBW9vNtWNhc3ZEDyNCiXLPdVPHCikRxSBWwV9NrpLLa4LsXi9",
+        "e75d936d56377f432f404aabb406601f892fd49da90eb6ac558a733c93b47252",
+        {
+            "isCompressed": false,
+            "isPrivkey": true,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "L1axzbSyynNYA8mCAhzxkipKkfHtAXYF4YQnhSKcLV8YXA874fgT",
+        "8248bd0375f2f75d7e274ae544fb920f51784480866b102384190b1addfbaa5c",
+        {
+            "isCompressed": true,
+            "isPrivkey": true,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "927CnUkUbasYtDwYwVn2j8GdTuACNnKkjZ1rpZd2yBB1CLcnXpo",
+        "44c4f6a096eac5238291a94cc24c01e3b19b8d8cef72874a079e00a242237a52",
+        {
+            "isCompressed": false,
+            "isPrivkey": true,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "cUcfCMRjiQf85YMzzQEk9d1s5A4K7xL5SmBCLrezqXFuTVefyhY7",
+        "d1de707020a9059d6d3abaf85e17967c6555151143db13dbb06db78df0f15c69",
+        {
+            "isCompressed": true,
+            "isPrivkey": true,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "t1ZiM4oLF7hvboF4LPqhbBg7RLgJCCJC6Tj",
+        "76a914adc1cc2081a27206fae25792f28bbc55b831549d88ac",
+        {
+            "isPrivkey": false,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "t3LoV8q8R44fSbe84DBKDk3sAEoYum4hQYj",
+        "a914188f91a931947eddd7432d6e614387e32b24470987",
+        {
+            "isPrivkey": false,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "tmBmkeJmwF3UgVXqJLzEin49ftK1HmsqYup",
+        "76a9141694f5bc1a7295b600f40018a618a6ea48eeb49888ac",
+        {
+            "isPrivkey": false,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "t2Byypnbxh2Pfk7VqLMzYfiNeD72o6yvtqX",
+        "a9143b9b3fd7a50d4f08d1a5b0f62f644fa7115ae2f387",
+        {
+            "isPrivkey": false,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "5HtH6GdcwCJA4ggWEL1B3jzBBUB8HPiBi9SBc5h9i4Wk4PSeApR",
+        "091035445ef105fa1bb125eccfb1882f3fe69592265956ade751fd095033d8d0",
+        {
+            "isCompressed": false,
+            "isPrivkey": true,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "L2xSYmMeVo3Zek3ZTsv9xUrXVAmrWxJ8Ua4cw8pkfbQhcEFhkXT8",
+        "ab2b4bcdfc91d34dee0ae2a8c6b6668dadaeb3a88b9859743156f462325187af",
+        {
+            "isCompressed": true,
+            "isPrivkey": true,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "92xFEve1Z9N8Z641KQQS7ByCSb8kGjsDzw6fAmjHN1LZGKQXyMq",
+        "b4204389cef18bbe2b353623cbf93e8678fbc92a475b664ae98ed594e6cf0856",
+        {
+            "isCompressed": false,
+            "isPrivkey": true,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "cVM65tdYu1YK37tNoAyGoJTR13VBYFva1vg9FLuPAsJijGvG6NEA",
+        "e7b230133f1b5489843260236b06edca25f66adb1be455fbd38d4010d48faeef",
+        {
+            "isCompressed": true,
+            "isPrivkey": true,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "t1boxWWuUs3dVUFeUMiPqCdwD4QtL1AMx9G",
+        "76a914c4c1b72491ede1eedaca00618407ee0b772cad0d88ac",
+        {
+            "isPrivkey": false,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "t3h5bvzkCXkiMttmQScK56UjVcqeD3NnReW",
+        "a914f6fe69bcb548a829cce4c57bf6fff8af3a5981f987",
+        {
+            "isPrivkey": false,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "tmDBvm2S5yAj5pVAvB4th1DDVpLq3KuN8S1",
+        "76a914261f83568a098a8638844bd7aeca039d5f2352c088ac",
+        {
+            "isPrivkey": false,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "t2TooyZ7BmQTBkgCVhdNQsPfeVdQoWqsHQa",
+        "a914e930e1834a4d234702773951d627cce82fbb5d2e87",
+        {
+            "isPrivkey": false,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "5KQmDryMNDcisTzRp3zEq9e4awRmJrEVU1j5vFRTKpRNYPqYrMg",
+        "d1fab7ab7385ad26872237f1eb9789aa25cc986bacc695e07ac571d6cdac8bc0",
+        {
+            "isCompressed": false,
+            "isPrivkey": true,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "L39Fy7AC2Hhj95gh3Yb2AU5YHh1mQSAHgpNixvm27poizcJyLtUi",
+        "b0bbede33ef254e8376aceb1510253fc3550efd0fcf84dcd0c9998b288f166b3",
+        {
+            "isCompressed": true,
+            "isPrivkey": true,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "91cTVUcgydqyZLgaANpf1fvL55FH53QMm4BsnCADVNYuWuqdVys",
+        "037f4192c630f399d9271e26c575269b1d15be553ea1a7217f0cb8513cef41cb",
+        {
+            "isCompressed": false,
+            "isPrivkey": true,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "cQspfSzsgLeiJGB2u8vrAiWpCU4MxUT6JseWo2SjXy4Qbzn2fwDw",
+        "6251e205e8ad508bab5596bee086ef16cd4b239e0cc0c5d7c4e6035441e7d5de",
+        {
+            "isCompressed": true,
+            "isPrivkey": true,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "t1SWDbHDTatR1ag8yTFLdVWd1erfu7Pbbjk",
+        "76a9145eadaf9bb7121f0f192561a5a62f5e5f5421029288ac",
+        {
+            "isPrivkey": false,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "t3QKR6mLBwPY6DeqHwjJCxUwSsGUToB5sWJ",
+        "a9143f210e7277c899c3a155cc1c90f4106cbddeec6e87",
+        {
+            "isPrivkey": false,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "tmU1EeoNHCfmWpeZWeRnKmNeVdHJgZjse5G",
+        "76a914c8a3c2a09a298592c3e180f02487cd91ba3400b588ac",
+        {
+            "isPrivkey": false,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "t2LZVwB5A2n5U9odwMbLd1g5Bz9Z3ZFoCJH",
+        "a91499b31df7c9068d1481b596578ddbb4d3bd90baeb87",
+        {
+            "isPrivkey": false,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "5KL6zEaMtPRXZKo1bbMq7JDjjo1bJuQcsgL33je3oY8uSJCR5b4",
+        "c7666842503db6dc6ea061f092cfb9c388448629a6fe868d068c42a488b478ae",
+        {
+            "isCompressed": false,
+            "isPrivkey": true,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "KwV9KAfwbwt51veZWNscRTeZs9CKpojyu1MsPnaKTF5kz69H1UN2",
+        "07f0803fc5399e773555ab1e8939907e9badacc17ca129e67a2f5f2ff84351dd",
+        {
+            "isCompressed": true,
+            "isPrivkey": true,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "93N87D6uxSBzwXvpokpzg8FFmfQPmvX4xHoWQe3pLdYpbiwT5YV",
+        "ea577acfb5d1d14d3b7b195c321566f12f87d2b77ea3a53f68df7ebf8604a801",
+        {
+            "isCompressed": false,
+            "isPrivkey": true,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "cMxXusSihaX58wpJ3tNuuUcZEQGt6DKJ1wEpxys88FFaQCYjku9h",
+        "0b3b34f0958d8a268193a9814da92c3e8b58b4a4378a542863e34ac289cd830c",
+        {
+            "isCompressed": true,
+            "isPrivkey": true,
+            "chain": "testnet"
+        }
+    ],
+    [
+        "t1Lgcj4m5r7eDWctWQM7ete85hHivQxMjBZ",
+        "76a9141ed467017f043e91ed4c44b4e8dd674db211c4e688ac",
+        {
+            "isPrivkey": false,
+            "chain": "mainnet"
+        }
+    ],
+    [
+        "t3TCuHUxH3LGnsFYTUbSwHrRXxTaEA8hAaf",
+        "a9145ece0cadddc415b1980f001785947120acdb36fc87",
+        {
+            "isPrivkey": false,
+            "chain": "mainnet"
+        }
+    ]
+]
diff --git a/depend/zcash/src/test/data/bitcoin-util-test.json b/depend/zcash/src/test/data/bitcoin-util-test.json
new file mode 100644
index 000000000..468af73b2
--- /dev/null
+++ b/depend/zcash/src/test/data/bitcoin-util-test.json
@@ -0,0 +1,160 @@
+[
+  { "exec": "./zcash-tx",
+    "args": ["-create"],
+    "output_cmp": "blanktx.hex",
+    "description": "Creates a blank transaction"
+  },
+  { "exec": "./zcash-tx",
+    "args": ["-json","-create"],
+    "output_cmp": "blanktx.json",
+    "description": "Creates a blank transaction (output in json)"
+  },
+  { "exec": "./zcash-tx",
+    "args": ["-"],
+    "input": "blanktx.hex",
+    "output_cmp": "blanktx.hex",
+    "description": "Creates a blank transaction when nothing is piped into bitcoin-tx"
+  },
+  { "exec": "./zcash-tx",
+    "args": ["-json","-"],
+    "input": "blanktx.hex",
+    "output_cmp": "blanktx.json",
+    "description": "Creates a blank transaction when nothing is piped into bitcoin-tx (output in json)"
+  },
+  { "exec": "./zcash-tx",
+    "args": ["-", "delin=1"],
+    "input": "tx394b54bb.hex",
+    "output_cmp": "tt-delin1-out.hex",
+    "description": "Deletes a single input from a transaction"
+  },
+  { "exec": "./zcash-tx",
+    "args": ["-json", "-", "delin=1"],
+    "input": "tx394b54bb.hex",
+    "output_cmp": "tt-delin1-out.json",
+    "description": "Deletes a single input from a transaction (output in json)"
+  },
+  { "exec": "./zcash-tx",
+    "args": ["-", "delin=31"],
+    "input": "tx394b54bb.hex",
+    "return_code": 1,
+    "description": "Attempts to delete an input with a bad index from a transaction. Expected to fail."
+  },
+  { "exec": "./zcash-tx",
+    "args": ["-", "delout=1"],
+    "input": "tx394b54bb.hex",
+    "output_cmp": "tt-delout1-out.hex",
+    "description": "Deletes a single output from a transaction"
+  },
+  { "exec": "./zcash-tx",
+    "args": ["-json", "-", "delout=1"],
+    "input": "tx394b54bb.hex",
+    "output_cmp": "tt-delout1-out.json",
+    "description": "Deletes a single output from a transaction (output in json)"
+  },
+  { "exec": "./zcash-tx",
+    "args": ["-", "delout=2"],
+    "input": "tx394b54bb.hex",
+    "return_code": 1,
+    "description": "Attempts to delete an output with a bad index from a transaction. Expected to fail."
+  },
+  { "exec": "./zcash-tx",
+    "args": ["-", "locktime=317000"],
+    "input": "tx394b54bb.hex",
+    "output_cmp": "tt-locktime317000-out.hex",
+    "description": "Adds an nlocktime to a transaction"
+  },
+  { "exec": "./zcash-tx",
+    "args": ["-json", "-", "locktime=317000"],
+    "input": "tx394b54bb.hex",
+    "output_cmp": "tt-locktime317000-out.json",
+    "description": "Adds an nlocktime to a transaction (output in json)"
+  },
+  { "exec": "./zcash-tx",
+    "args":
+    ["-create",
+     "in=5897de6bd6027a475eadd57019d4e6872c396d0716c4875a5f1a6fcfdf385c1f:0",
+     "in=bf829c6bcf84579331337659d31f89dfd138f7f7785802d5501c92333145ca7c:18",
+     "in=22a6f904655d53ae2ff70e701a0bbd90aa3975c0f40bfc6cc996a9049e31cdfc:1",
+     "outaddr=0.18:t1LmWJddYzkTmTQjZrX7ZkFjmuEu5XKpGKb",
+     "outaddr=4:t1g1aXFye74HKJ24VviTxo3AW4BZbyCni5H"],
+    "output_cmp": "txcreate1.hex",
+    "description": "Creates a new transaction with three inputs and two outputs"
+  },
+  { "exec": "./zcash-tx",
+    "args":
+    ["-json",
+     "-create",
+     "in=5897de6bd6027a475eadd57019d4e6872c396d0716c4875a5f1a6fcfdf385c1f:0",
+     "in=bf829c6bcf84579331337659d31f89dfd138f7f7785802d5501c92333145ca7c:18",
+     "in=22a6f904655d53ae2ff70e701a0bbd90aa3975c0f40bfc6cc996a9049e31cdfc:1",
+     "outaddr=0.18:t1LmWJddYzkTmTQjZrX7ZkFjmuEu5XKpGKb",
+     "outaddr=4:t1g1aXFye74HKJ24VviTxo3AW4BZbyCni5H"],
+    "output_cmp": "txcreate1.json",
+    "description": "Creates a new transaction with three inputs and two outputs (output in json)"
+  },
+  { "exec": "./zcash-tx",
+    "args": ["-create", "outscript=0:"],
+    "output_cmp": "txcreate2.hex",
+    "description": "Creates a new transaction with a single empty output script"
+  },
+  { "exec": "./zcash-tx",
+    "args": ["-json", "-create", "outscript=0:"],
+    "output_cmp": "txcreate2.json",
+    "description": "Creates a new transaction with a single empty output script (output in json)"
+  },
+  { "exec": "./zcash-tx",
+    "args":
+    ["-create",
+     "in=4d49a71ec9da436f71ec4ee231d04f292a29cd316f598bb7068feccabdc59485:0",
+     "set=privatekeys:[\"5HpHagT65TZzG1PH3CSu63k8DbpvD8s5ip4nEB3kEsreAnchuDf\"]",
+     "set=prevtxs:[{\"txid\":\"4d49a71ec9da436f71ec4ee231d04f292a29cd316f598bb7068feccabdc59485\",\"vout\":0,\"scriptPubKey\":\"76a91491b24bf9f5288532960ac687abb035127b1d28a588ac\"}]",
+     "sign=1:ALL",
+     "outaddr=0.001:t1Ruz6gK4QPZoPPGpHaieupnnh62mktjQE7"],
+    "output_cmp": "txcreatesign.hex",
+    "description": "Creates a new transaction with a single input and a single output, and then signs the transaction"
+  },
+  { "exec": "./zcash-tx",
+    "args":
+    ["-json",
+     "-create",
+     "in=4d49a71ec9da436f71ec4ee231d04f292a29cd316f598bb7068feccabdc59485:0",
+     "set=privatekeys:[\"5HpHagT65TZzG1PH3CSu63k8DbpvD8s5ip4nEB3kEsreAnchuDf\"]",
+     "set=prevtxs:[{\"txid\":\"4d49a71ec9da436f71ec4ee231d04f292a29cd316f598bb7068feccabdc59485\",\"vout\":0,\"scriptPubKey\":\"76a91491b24bf9f5288532960ac687abb035127b1d28a588ac\"}]",
+     "sign=1:ALL",
+     "outaddr=0.001:t1Ruz6gK4QPZoPPGpHaieupnnh62mktjQE7"],
+    "output_cmp": "txcreatesign.json",
+    "description": "Creates a new transaction with a single input and a single output, and then signs the transaction (output in json)"
+  },
+  { "exec": "./zcash-tx",
+    "args":
+    ["-create",
+     "in=5897de6bd6027a475eadd57019d4e6872c396d0716c4875a5f1a6fcfdf385c1f:0:4294967293",
+     "outaddr=0.18:t1LmWJddYzkTmTQjZrX7ZkFjmuEu5XKpGKb"],
+    "output_cmp": "txcreatedata_seq0.hex",
+    "description": "Creates a new transaction with one input with sequence number and one address output"
+  },
+  { "exec": "./zcash-tx",
+    "args":
+    ["-json",
+     "-create",
+     "in=5897de6bd6027a475eadd57019d4e6872c396d0716c4875a5f1a6fcfdf385c1f:0:4294967293",
+     "outaddr=0.18:t1LmWJddYzkTmTQjZrX7ZkFjmuEu5XKpGKb"],
+    "output_cmp": "txcreatedata_seq0.json",
+    "description": "Creates a new transaction with one input with sequence number and one address output (output in json)"
+  },
+  { "exec": "./zcash-tx",
+    "args":
+    ["01000000011f5c38dfcf6f1a5f5a87c416076d392c87e6d41970d5ad5e477a02d66bde97580000000000fdffffff0180a81201000000001976a9141fc11f39be1729bf973a7ab6a615ca4729d6457488ac00000000",
+     "in=5897de6bd6027a475eadd57019d4e6872c396d0716c4875a5f1a6fcfdf385c1f:0:1"],
+    "output_cmp": "txcreatedata_seq1.hex",
+    "description": "Adds a new input with sequence number to a transaction"
+  },
+  { "exec": "./zcash-tx",
+    "args":
+    ["-json",
+     "01000000011f5c38dfcf6f1a5f5a87c416076d392c87e6d41970d5ad5e477a02d66bde97580000000000fdffffff0180a81201000000001976a9141fc11f39be1729bf973a7ab6a615ca4729d6457488ac00000000",
+     "in=5897de6bd6027a475eadd57019d4e6872c396d0716c4875a5f1a6fcfdf385c1f:0:1"],
+    "output_cmp": "txcreatedata_seq1.json",
+    "description": "Adds a new input with sequence number to a transaction (output in json)"
+  }
+]
diff --git a/depend/zcash/src/test/data/blanktx.hex b/depend/zcash/src/test/data/blanktx.hex
new file mode 100644
index 000000000..36b6f00fb
--- /dev/null
+++ b/depend/zcash/src/test/data/blanktx.hex
@@ -0,0 +1 @@
+01000000000000000000
diff --git a/depend/zcash/src/test/data/blanktx.json b/depend/zcash/src/test/data/blanktx.json
new file mode 100644
index 000000000..f6d6ab588
--- /dev/null
+++ b/depend/zcash/src/test/data/blanktx.json
@@ -0,0 +1,10 @@
+{
+    "txid": "d21633ba23f70118185227be58a63527675641ad37967e2aa461559f577aec43",
+    "version": 1,
+    "locktime": 0,
+    "vin": [
+    ],
+    "vout": [
+    ],
+    "hex": "01000000000000000000"
+}
diff --git a/depend/zcash/src/test/data/merkle_commitments.json b/depend/zcash/src/test/data/merkle_commitments.json
new file mode 100644
index 000000000..7c9ffea77
--- /dev/null
+++ b/depend/zcash/src/test/data/merkle_commitments.json
@@ -0,0 +1,18 @@
+[
+	"bab6e8992959caf0ca94847c36b4e648a7f88a9b9c6a62ea387cf1fb9badfd62",
+	"43c9a4b21555b832a79fc12ce27a97d4f4eca1638e7161a780db1d5ebc35eb68",
+	"fb92a6142315bb3396b693222bf2d0e260b448cda74e189063cf774048456083",
+	"e44a57cd544018937680d385817be3a3e35bb5b87ceeea93d536ea95828a4992",
+	"43f48bfb9ab6f12ef91ce83e8f9190ce5dff2721784c90e08a50a67403367cff",
+	"fce910561c3c7ebf14ed5d712e6838cdc6f1145c87eec256b7181f9df6d0c468",
+	"b1e7016392805b227b11e58ba629f9a6684a0b4c34306e85e47548c43ecd168b",
+	"2d9a49d9425449a449cc62d16febaf9c7f8b32349752ecc39191c36130b4c050",
+	"53969b31a862b893dde857b8b7d4f53ce0e2c21a0f70d48ba1aef3a05fddff70",
+	"17f8fabd440fdf9e2eafd75a3407e8bbde048d2d2232cd803d5763004af61ed8",
+	"9b7805cb5e8ef337c13c73cab58ee719bf33a4a80ecc161bfe714269eca4928b",
+	"a3ebada94d4329899ae136391604799d8cea39c0c331f9aaaa4a1e73ab63e904",
+	"12091a20c9ebe67c2793bb71a6fdddb0ffe3ca781fcf1e192428161f186c3fbe",
+	"e9c65749638df548b8909c0ea1d0f79079a6bb3235c649a8806322c87f968018",
+	"8e8fddf0438a4263bc926fcfa6733dc201633959f294103533a2cb9328bb65c4",
+	"206a202bd08dd31f77afc7114b17850192b83948cff5828df0d638cbe734c884"
+]
diff --git a/depend/zcash/src/test/data/merkle_commitments_sapling.json b/depend/zcash/src/test/data/merkle_commitments_sapling.json
new file mode 100644
index 000000000..de5936b0e
--- /dev/null
+++ b/depend/zcash/src/test/data/merkle_commitments_sapling.json
@@ -0,0 +1,18 @@
+[
+	"556f3af94225d46b1ef652abc9005dee873b2e245eef07fd5be587e0f21023b0",
+	"5814b127a6c6b8f07ed03f0f6e2843ff04c9851ff824a4e5b4dad5b5f3475722",
+	"6c030e6d7460f91668cc842ceb78cdb54470469e78cd59cf903d3a6e1aa03e7c",
+	"30a0d08406b9e3693ee4c062bd1e6816f95bf14f5a13aafa1d57942c6c1d4250",
+	"12fc3e7298eb327a88abcc406fbe595e45dddd9b4209803b2e0baa3a8663ecaa",
+	"021a35cfe13d16891c1409d0f6e8865f51dd54792e5108a6f9e55e0dd44867f7",
+	"2e0bfc1e123edcb6252251611650f3667371f781b60302385c414716c75e8abc",
+	"11a5e54bf9a9b57e1c163904999ad1527f1e126c685111e18193decca2dd1ada",
+	"4674f7836089063143fc18b673b2d92f888c63380e3680385d47bcdbd5fe273a",
+	"0830165f36a69e416d51cc09cc5668692dee35d98539d3317999fdf87d8fcac7",
+	"02372c746664e0898576972ca6d0500c7c8ec42f144622349d133b06e837faf0",
+	"08c6d7dd3d2e387f7b84d6769f2b6cbe308918ab81e0f7321bd0945868d7d4e6",
+	"26e8c4061f2ad984d19f2c0a4436b9800e529069c0b0d3186d4683e83bb7eb8c",
+	"037cc2391338956026521beca5c81b541b7f2d1ead7758bf4d1588dbbcb8fa22",
+	"1cc467cfd2b504e156c9a38bc5c0e4f5ea6cc208054d2d0653a7e561ac3a3ef4",
+	"15ac4057a9a94536eca9802de65e985319e89627c9c64bc94626b712bc61363a"
+]
diff --git a/depend/zcash/src/test/data/merkle_path.json b/depend/zcash/src/test/data/merkle_path.json
new file mode 100644
index 000000000..c8abce285
--- /dev/null
+++ b/depend/zcash/src/test/data/merkle_path.json
@@ -0,0 +1,122 @@
+[
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f9220dc766fab492ccf3d1e49d4f374b5235fa56506aac2224d39f943fcd49202974c20da5698be17b9b46962335799779fbeca8ce5d491c0d26243bafef9ea1837a9d82068eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430000000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f9220dc766fab492ccf3d1e49d4f374b5235fa56506aac2224d39f943fcd49202974c2029e5251f4a256e88a8994ff938d64eae2995f3cf29b82cf229c126fb5d0c2c202068eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430000000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f9220dc766fab492ccf3d1e49d4f374b5235fa56506aac2224d39f943fcd49202974c2029e5251f4a256e88a8994ff938d64eae2995f3cf29b82cf229c126fb5d0c2c202062fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0100000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f9220dc766fab492ccf3d1e49d4f374b5235fa56506aac2224d39f943fcd49202974c20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2068eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430000000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f9220dc766fab492ccf3d1e49d4f374b5235fa56506aac2224d39f943fcd49202974c20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2062fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0100000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f9220dc766fab492ccf3d1e49d4f374b5235fa56506aac2224d39f943fcd49202974c209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386182092498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae40200000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f9220c18a5a58ffc07d5935e12dfaab5702a40a69f98e2369b1aa39e752f3d19cf45420a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2068eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430000000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f9220c18a5a58ffc07d5935e12dfaab5702a40a69f98e2369b1aa39e752f3d19cf45420a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2062fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0100000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f9220c18a5a58ffc07d5935e12dfaab5702a40a69f98e2369b1aa39e752f3d19cf454209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386182092498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae40200000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f9220c18a5a58ffc07d5935e12dfaab5702a40a69f98e2369b1aa39e752f3d19cf454209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f3861820836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0300000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f922095f164e3a9675937a0f765fc9ef5174be80db7677b1a1c9c6ec9210252194f2f20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2068eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430000000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f922095f164e3a9675937a0f765fc9ef5174be80db7677b1a1c9c6ec9210252194f2f20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2062fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0100000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f922095f164e3a9675937a0f765fc9ef5174be80db7677b1a1c9c6ec9210252194f2f209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386182092498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae40200000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f922095f164e3a9675937a0f765fc9ef5174be80db7677b1a1c9c6ec9210252194f2f209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f3861820836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0300000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f922046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20da5698be17b9b46962335799779fbeca8ce5d491c0d26243bafef9ea1837a9d82068c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc0400000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f92202d29c34237e2c44f6cce2a696fecbb33585003043043f7ae4132d7325ba1442e20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2068eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430000000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f92202d29c34237e2c44f6cce2a696fecbb33585003043043f7ae4132d7325ba1442e20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2062fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0100000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f92202d29c34237e2c44f6cce2a696fecbb33585003043043f7ae4132d7325ba1442e209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386182092498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae40200000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f92202d29c34237e2c44f6cce2a696fecbb33585003043043f7ae4132d7325ba1442e209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f3861820836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0300000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f922046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20dad31d7ac0c2e17effd233d64b7b72647a8e201fcb32db9bcfe666beef7465652068c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc0400000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f922046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20dad31d7ac0c2e17effd233d64b7b72647a8e201fcb32db9bcfe666beef74656520ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430500000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f9220112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2068eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430000000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f9220112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2062fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0100000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f9220112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386182092498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae40200000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f9220112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f3861820836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0300000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f922046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad104742068c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc0400000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f922046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad1047420ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430500000000000000",
+	"04203f0a406181105968fdaee30679e3273c66b72bf9a7f5debbf3b5a0a26e359f922046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af22050c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d0600000000000000",
+	"0420964fdc89e8879f11ea0878f19a459fc538e2dfc3c3011e95f12e3ea9b62ce7c420112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2068eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430000000000000000",
+	"0420964fdc89e8879f11ea0878f19a459fc538e2dfc3c3011e95f12e3ea9b62ce7c420112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2062fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0100000000000000",
+	"0420964fdc89e8879f11ea0878f19a459fc538e2dfc3c3011e95f12e3ea9b62ce7c420112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386182092498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae40200000000000000",
+	"0420964fdc89e8879f11ea0878f19a459fc538e2dfc3c3011e95f12e3ea9b62ce7c420112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f3861820836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0300000000000000",
+	"0420964fdc89e8879f11ea0878f19a459fc538e2dfc3c3011e95f12e3ea9b62ce7c42046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad104742068c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc0400000000000000",
+	"0420964fdc89e8879f11ea0878f19a459fc538e2dfc3c3011e95f12e3ea9b62ce7c42046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad1047420ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430500000000000000",
+	"0420964fdc89e8879f11ea0878f19a459fc538e2dfc3c3011e95f12e3ea9b62ce7c42046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af22050c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d0600000000000000",
+	"0420964fdc89e8879f11ea0878f19a459fc538e2dfc3c3011e95f12e3ea9b62ce7c42046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af2208b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b10700000000000000",
+	"042054e7a5de06e6c2632d036a3d7099cffefcb2e2ed36bdb18378be25d7058d2c8d20112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2068eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430000000000000000",
+	"042054e7a5de06e6c2632d036a3d7099cffefcb2e2ed36bdb18378be25d7058d2c8d20112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2062fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0100000000000000",
+	"042054e7a5de06e6c2632d036a3d7099cffefcb2e2ed36bdb18378be25d7058d2c8d20112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386182092498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae40200000000000000",
+	"042054e7a5de06e6c2632d036a3d7099cffefcb2e2ed36bdb18378be25d7058d2c8d20112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f3861820836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0300000000000000",
+	"042054e7a5de06e6c2632d036a3d7099cffefcb2e2ed36bdb18378be25d7058d2c8d2046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad104742068c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc0400000000000000",
+	"042054e7a5de06e6c2632d036a3d7099cffefcb2e2ed36bdb18378be25d7058d2c8d2046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad1047420ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430500000000000000",
+	"042054e7a5de06e6c2632d036a3d7099cffefcb2e2ed36bdb18378be25d7058d2c8d2046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af22050c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d0600000000000000",
+	"042054e7a5de06e6c2632d036a3d7099cffefcb2e2ed36bdb18378be25d7058d2c8d2046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af2208b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b10700000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620dc766fab492ccf3d1e49d4f374b5235fa56506aac2224d39f943fcd49202974c20da5698be17b9b46962335799779fbeca8ce5d491c0d26243bafef9ea1837a9d820d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf8170800000000000000",
+	"0420ad2ef0c46c0d80ebea75780d5af0773db8330bcc4fb893d27a66ae8807fb380c20112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2068eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430000000000000000",
+	"0420ad2ef0c46c0d80ebea75780d5af0773db8330bcc4fb893d27a66ae8807fb380c20112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2062fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0100000000000000",
+	"0420ad2ef0c46c0d80ebea75780d5af0773db8330bcc4fb893d27a66ae8807fb380c20112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386182092498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae40200000000000000",
+	"0420ad2ef0c46c0d80ebea75780d5af0773db8330bcc4fb893d27a66ae8807fb380c20112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f3861820836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0300000000000000",
+	"0420ad2ef0c46c0d80ebea75780d5af0773db8330bcc4fb893d27a66ae8807fb380c2046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad104742068c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc0400000000000000",
+	"0420ad2ef0c46c0d80ebea75780d5af0773db8330bcc4fb893d27a66ae8807fb380c2046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad1047420ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430500000000000000",
+	"0420ad2ef0c46c0d80ebea75780d5af0773db8330bcc4fb893d27a66ae8807fb380c2046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af22050c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d0600000000000000",
+	"0420ad2ef0c46c0d80ebea75780d5af0773db8330bcc4fb893d27a66ae8807fb380c2046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af2208b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b10700000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620dc766fab492ccf3d1e49d4f374b5235fa56506aac2224d39f943fcd49202974c207486d2fdb0c7f26f90fac18655da5e24b224b4db70249c8493c66ebc8accc4e120d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf8170800000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620dc766fab492ccf3d1e49d4f374b5235fa56506aac2224d39f943fcd49202974c207486d2fdb0c7f26f90fac18655da5e24b224b4db70249c8493c66ebc8accc4e12070ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b96530900000000000000",
+	"04204ec90fa2545921c69d159afcd5a369dfe6837050304753d564dc7156f43a37f320112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2068eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430000000000000000",
+	"04204ec90fa2545921c69d159afcd5a369dfe6837050304753d564dc7156f43a37f320112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2062fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0100000000000000",
+	"04204ec90fa2545921c69d159afcd5a369dfe6837050304753d564dc7156f43a37f320112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386182092498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae40200000000000000",
+	"04204ec90fa2545921c69d159afcd5a369dfe6837050304753d564dc7156f43a37f320112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f3861820836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0300000000000000",
+	"04204ec90fa2545921c69d159afcd5a369dfe6837050304753d564dc7156f43a37f32046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad104742068c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc0400000000000000",
+	"04204ec90fa2545921c69d159afcd5a369dfe6837050304753d564dc7156f43a37f32046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad1047420ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430500000000000000",
+	"04204ec90fa2545921c69d159afcd5a369dfe6837050304753d564dc7156f43a37f32046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af22050c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d0600000000000000",
+	"04204ec90fa2545921c69d159afcd5a369dfe6837050304753d564dc7156f43a37f32046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af2208b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b10700000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620dc766fab492ccf3d1e49d4f374b5235fa56506aac2224d39f943fcd49202974c20a1e12cd7bb8d53016cbf0729cfc1bead8759a9e97a7eb50a416a27ced07e755020d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf8170800000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620dc766fab492ccf3d1e49d4f374b5235fa56506aac2224d39f943fcd49202974c20a1e12cd7bb8d53016cbf0729cfc1bead8759a9e97a7eb50a416a27ced07e75502070ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b96530900000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620dc766fab492ccf3d1e49d4f374b5235fa56506aac2224d39f943fcd49202974c20fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a412004e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba30a00000000000000",
+	"0420af2e33b28e8f9ffbd012e2b9706f58c55e8669153b84cb6d470b9eb9af2957d720112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2068eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430000000000000000",
+	"0420af2e33b28e8f9ffbd012e2b9706f58c55e8669153b84cb6d470b9eb9af2957d720112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2062fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0100000000000000",
+	"0420af2e33b28e8f9ffbd012e2b9706f58c55e8669153b84cb6d470b9eb9af2957d720112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386182092498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae40200000000000000",
+	"0420af2e33b28e8f9ffbd012e2b9706f58c55e8669153b84cb6d470b9eb9af2957d720112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f3861820836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0300000000000000",
+	"0420af2e33b28e8f9ffbd012e2b9706f58c55e8669153b84cb6d470b9eb9af2957d72046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad104742068c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc0400000000000000",
+	"0420af2e33b28e8f9ffbd012e2b9706f58c55e8669153b84cb6d470b9eb9af2957d72046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad1047420ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430500000000000000",
+	"0420af2e33b28e8f9ffbd012e2b9706f58c55e8669153b84cb6d470b9eb9af2957d72046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af22050c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d0600000000000000",
+	"0420af2e33b28e8f9ffbd012e2b9706f58c55e8669153b84cb6d470b9eb9af2957d72046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af2208b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b10700000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620285abab9bfaf21e7d065e6ce8321c06190b3faae71bcf74466543cea31354fd820a1e12cd7bb8d53016cbf0729cfc1bead8759a9e97a7eb50a416a27ced07e755020d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf8170800000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620285abab9bfaf21e7d065e6ce8321c06190b3faae71bcf74466543cea31354fd820a1e12cd7bb8d53016cbf0729cfc1bead8759a9e97a7eb50a416a27ced07e75502070ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b96530900000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620285abab9bfaf21e7d065e6ce8321c06190b3faae71bcf74466543cea31354fd820fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a412004e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba30a00000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620285abab9bfaf21e7d065e6ce8321c06190b3faae71bcf74466543cea31354fd820fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a41208b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b0b00000000000000",
+	"04203a338d8b043cce01afc28d14b0db710d1cb65f85995d43e5cedb2cce823f540d20112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2068eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430000000000000000",
+	"04203a338d8b043cce01afc28d14b0db710d1cb65f85995d43e5cedb2cce823f540d20112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2062fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0100000000000000",
+	"04203a338d8b043cce01afc28d14b0db710d1cb65f85995d43e5cedb2cce823f540d20112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386182092498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae40200000000000000",
+	"04203a338d8b043cce01afc28d14b0db710d1cb65f85995d43e5cedb2cce823f540d20112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f3861820836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0300000000000000",
+	"04203a338d8b043cce01afc28d14b0db710d1cb65f85995d43e5cedb2cce823f540d2046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad104742068c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc0400000000000000",
+	"04203a338d8b043cce01afc28d14b0db710d1cb65f85995d43e5cedb2cce823f540d2046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad1047420ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430500000000000000",
+	"04203a338d8b043cce01afc28d14b0db710d1cb65f85995d43e5cedb2cce823f540d2046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af22050c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d0600000000000000",
+	"04203a338d8b043cce01afc28d14b0db710d1cb65f85995d43e5cedb2cce823f540d2046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af2208b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b10700000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620a71b761f798e038f1fd874f4691b8d0134f5ef9816efe7be0b977a8a65a1adb420a1e12cd7bb8d53016cbf0729cfc1bead8759a9e97a7eb50a416a27ced07e755020d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf8170800000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620a71b761f798e038f1fd874f4691b8d0134f5ef9816efe7be0b977a8a65a1adb420a1e12cd7bb8d53016cbf0729cfc1bead8759a9e97a7eb50a416a27ced07e75502070ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b96530900000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620a71b761f798e038f1fd874f4691b8d0134f5ef9816efe7be0b977a8a65a1adb420fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a412004e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba30a00000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620a71b761f798e038f1fd874f4691b8d0134f5ef9816efe7be0b977a8a65a1adb420fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a41208b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b0b00000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f62520da5698be17b9b46962335799779fbeca8ce5d491c0d26243bafef9ea1837a9d8201880967fc8226380a849c63532bba67990f7d0a10e9c90b848f58d634957c6e90c00000000000000",
+	"0420395b7bc8527f05ce6185e2a4edc9b61f72fa86412eddebd4037946b4f55c561820112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2068eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430000000000000000",
+	"0420395b7bc8527f05ce6185e2a4edc9b61f72fa86412eddebd4037946b4f55c561820112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2062fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0100000000000000",
+	"0420395b7bc8527f05ce6185e2a4edc9b61f72fa86412eddebd4037946b4f55c561820112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386182092498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae40200000000000000",
+	"0420395b7bc8527f05ce6185e2a4edc9b61f72fa86412eddebd4037946b4f55c561820112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f3861820836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0300000000000000",
+	"0420395b7bc8527f05ce6185e2a4edc9b61f72fa86412eddebd4037946b4f55c56182046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad104742068c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc0400000000000000",
+	"0420395b7bc8527f05ce6185e2a4edc9b61f72fa86412eddebd4037946b4f55c56182046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad1047420ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430500000000000000",
+	"0420395b7bc8527f05ce6185e2a4edc9b61f72fa86412eddebd4037946b4f55c56182046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af22050c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d0600000000000000",
+	"0420395b7bc8527f05ce6185e2a4edc9b61f72fa86412eddebd4037946b4f55c56182046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af2208b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b10700000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620768a5942a0cd57b8875959f40013c9827121ed35c0765960ae7e73c8eee6d45420a1e12cd7bb8d53016cbf0729cfc1bead8759a9e97a7eb50a416a27ced07e755020d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf8170800000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620768a5942a0cd57b8875959f40013c9827121ed35c0765960ae7e73c8eee6d45420a1e12cd7bb8d53016cbf0729cfc1bead8759a9e97a7eb50a416a27ced07e75502070ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b96530900000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620768a5942a0cd57b8875959f40013c9827121ed35c0765960ae7e73c8eee6d45420fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a412004e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba30a00000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620768a5942a0cd57b8875959f40013c9827121ed35c0765960ae7e73c8eee6d45420fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a41208b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b0b00000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f62520180c3d1ca03b5519a6551eec8bf1632002f748303132f30036a844028d4f3e96201880967fc8226380a849c63532bba67990f7d0a10e9c90b848f58d634957c6e90c00000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f62520180c3d1ca03b5519a6551eec8bf1632002f748303132f30036a844028d4f3e9620be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a09120d00000000000000",
+	"0420458cab4492ce89c6b50161e0583c2115e7900db964a53b49e152828d6a3991af20112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2068eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430000000000000000",
+	"0420458cab4492ce89c6b50161e0583c2115e7900db964a53b49e152828d6a3991af20112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd20a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae2062fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0100000000000000",
+	"0420458cab4492ce89c6b50161e0583c2115e7900db964a53b49e152828d6a3991af20112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386182092498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae40200000000000000",
+	"0420458cab4492ce89c6b50161e0583c2115e7900db964a53b49e152828d6a3991af20112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd209f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f3861820836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0300000000000000",
+	"0420458cab4492ce89c6b50161e0583c2115e7900db964a53b49e152828d6a3991af2046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad104742068c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc0400000000000000",
+	"0420458cab4492ce89c6b50161e0583c2115e7900db964a53b49e152828d6a3991af2046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad1047420ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430500000000000000",
+	"0420458cab4492ce89c6b50161e0583c2115e7900db964a53b49e152828d6a3991af2046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af22050c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d0600000000000000",
+	"0420458cab4492ce89c6b50161e0583c2115e7900db964a53b49e152828d6a3991af2046c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f20aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af2208b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b10700000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620305205dbbecab7b01ec2538467c2fe41f7845eb45487bcf2f7d7bd52207f644120a1e12cd7bb8d53016cbf0729cfc1bead8759a9e97a7eb50a416a27ced07e755020d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf8170800000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620305205dbbecab7b01ec2538467c2fe41f7845eb45487bcf2f7d7bd52207f644120a1e12cd7bb8d53016cbf0729cfc1bead8759a9e97a7eb50a416a27ced07e75502070ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b96530900000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620305205dbbecab7b01ec2538467c2fe41f7845eb45487bcf2f7d7bd52207f644120fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a412004e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba30a00000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620305205dbbecab7b01ec2538467c2fe41f7845eb45487bcf2f7d7bd52207f644120fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a41208b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b0b00000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625202f7a96ecc725694533a999db6786f6016bcfdca5c9353151837faf43d93c50ef201880967fc8226380a849c63532bba67990f7d0a10e9c90b848f58d634957c6e90c00000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625202f7a96ecc725694533a999db6786f6016bcfdca5c9353151837faf43d93c50ef20be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a09120d00000000000000",
+	"04206cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80620ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f62520e97f16ad143359999c90a7d2a3e7daa94ad980842226d9323d3f4f0ab62460a72084c834e7cb38d6f08d82f5cf4839b8920185174b11c7af771fd38dd02b206a200e00000000000000"
+]
diff --git a/depend/zcash/src/test/data/merkle_path_sapling.json b/depend/zcash/src/test/data/merkle_path_sapling.json
new file mode 100644
index 000000000..f07969da8
--- /dev/null
+++ b/depend/zcash/src/test/data/merkle_path_sapling.json
@@ -0,0 +1,122 @@
+[
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c20ffe9fc03f18b176c998806439ff0bb8ad193afdb27b2ccbc88856916dd804e3420817de36ab2d57feb077634bca77819c8e0bd298c04f6fed0e6a83cc1356ca15520225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580000000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c20ffe9fc03f18b176c998806439ff0bb8ad193afdb27b2ccbc88856916dd804e342037b3a0921a4047e617bde62b8958f86c010e6af6cc650959b9f50af8c7e8392620225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580000000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c20ffe9fc03f18b176c998806439ff0bb8ad193afdb27b2ccbc88856916dd804e342037b3a0921a4047e617bde62b8958f86c010e6af6cc650959b9f50af8c7e8392620b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f550100000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c20ffe9fc03f18b176c998806439ff0bb8ad193afdb27b2ccbc88856916dd804e3420f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580000000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c20ffe9fc03f18b176c998806439ff0bb8ad193afdb27b2ccbc88856916dd804e3420f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f550100000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c20ffe9fc03f18b176c998806439ff0bb8ad193afdb27b2ccbc88856916dd804e342062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6662050421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a0300200000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c2031d39685384e4ea322594d99a15aa8bdd8cc5cd6724410fa385b8d5447f1740220f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580000000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c2031d39685384e4ea322594d99a15aa8bdd8cc5cd6724410fa385b8d5447f1740220f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f550100000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c2031d39685384e4ea322594d99a15aa8bdd8cc5cd6724410fa385b8d5447f174022062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6662050421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a0300200000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c2031d39685384e4ea322594d99a15aa8bdd8cc5cd6724410fa385b8d5447f174022062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e666207c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0300000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c20f0321eea8e13c2f3a567f894c9738759d9d01e64ec259caf2cecca61374c157320f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580000000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c20f0321eea8e13c2f3a567f894c9738759d9d01e64ec259caf2cecca61374c157320f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f550100000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c20f0321eea8e13c2f3a567f894c9738759d9d01e64ec259caf2cecca61374c15732062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6662050421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a0300200000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c20f0321eea8e13c2f3a567f894c9738759d9d01e64ec259caf2cecca61374c15732062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e666207c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0300000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420817de36ab2d57feb077634bca77819c8e0bd298c04f6fed0e6a83cc1356ca15520f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a020400000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c2082c424de0185a63f6ce0aa65d3d55890748af44bb4bb5822a9a21df34546d32220f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580000000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c2082c424de0185a63f6ce0aa65d3d55890748af44bb4bb5822a9a21df34546d32220f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f550100000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c2082c424de0185a63f6ce0aa65d3d55890748af44bb4bb5822a9a21df34546d3222062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6662050421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a0300200000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c2082c424de0185a63f6ce0aa65d3d55890748af44bb4bb5822a9a21df34546d3222062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e666207c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0300000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f655186564206ab2e08286c36f6fe4374baebdc28b97e2f1f4ea3544fafd8a6489f42824bf0e20f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a020400000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f655186564206ab2e08286c36f6fe4374baebdc28b97e2f1f4ea3544fafd8a6489f42824bf0e20aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc120500000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c20130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2420f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580000000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c20130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2420f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f550100000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c20130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f242062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6662050421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a0300200000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c20130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f242062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e666207c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0300000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c20f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a020400000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c20aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc120500000000000000",
+	"0420d8283386ef2ef07ebdbb4383c12a739a953a4d6e0d6fb1139a4036d693bfbb6c201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd72420da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a5110600000000000000",
+	"0420109713c6c346ab0b17904ae18d101d92a98a612116a3f787043c802b55d5573120130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2420f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580000000000000000",
+	"0420109713c6c346ab0b17904ae18d101d92a98a612116a3f787043c802b55d5573120130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2420f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f550100000000000000",
+	"0420109713c6c346ab0b17904ae18d101d92a98a612116a3f787043c802b55d5573120130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f242062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6662050421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a0300200000000000000",
+	"0420109713c6c346ab0b17904ae18d101d92a98a612116a3f787043c802b55d5573120130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f242062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e666207c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0300000000000000",
+	"0420109713c6c346ab0b17904ae18d101d92a98a612116a3f787043c802b55d55731201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c20f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a020400000000000000",
+	"0420109713c6c346ab0b17904ae18d101d92a98a612116a3f787043c802b55d55731201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c20aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc120500000000000000",
+	"0420109713c6c346ab0b17904ae18d101d92a98a612116a3f787043c802b55d55731201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd72420da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a5110600000000000000",
+	"0420109713c6c346ab0b17904ae18d101d92a98a612116a3f787043c802b55d55731201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd72420bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e0700000000000000",
+	"0420bced38e720c8eab9b3b8b2959e5a8b8dda2b2537f6ea71c8e2aea8834a9af54220130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2420f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580000000000000000",
+	"0420bced38e720c8eab9b3b8b2959e5a8b8dda2b2537f6ea71c8e2aea8834a9af54220130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2420f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f550100000000000000",
+	"0420bced38e720c8eab9b3b8b2959e5a8b8dda2b2537f6ea71c8e2aea8834a9af54220130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f242062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6662050421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a0300200000000000000",
+	"0420bced38e720c8eab9b3b8b2959e5a8b8dda2b2537f6ea71c8e2aea8834a9af54220130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f242062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e666207c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0300000000000000",
+	"0420bced38e720c8eab9b3b8b2959e5a8b8dda2b2537f6ea71c8e2aea8834a9af542201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c20f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a020400000000000000",
+	"0420bced38e720c8eab9b3b8b2959e5a8b8dda2b2537f6ea71c8e2aea8834a9af542201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c20aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc120500000000000000",
+	"0420bced38e720c8eab9b3b8b2959e5a8b8dda2b2537f6ea71c8e2aea8834a9af542201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd72420da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a5110600000000000000",
+	"0420bced38e720c8eab9b3b8b2959e5a8b8dda2b2537f6ea71c8e2aea8834a9af542201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd72420bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e0700000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20ffe9fc03f18b176c998806439ff0bb8ad193afdb27b2ccbc88856916dd804e3420817de36ab2d57feb077634bca77819c8e0bd298c04f6fed0e6a83cc1356ca15520c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f1630080800000000000000",
+	"042094d3061a43d999e95bab82684aeb53d0a381b40e33a80abfc5c05e25b0a91d0f20130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2420f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580000000000000000",
+	"042094d3061a43d999e95bab82684aeb53d0a381b40e33a80abfc5c05e25b0a91d0f20130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2420f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f550100000000000000",
+	"042094d3061a43d999e95bab82684aeb53d0a381b40e33a80abfc5c05e25b0a91d0f20130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f242062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6662050421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a0300200000000000000",
+	"042094d3061a43d999e95bab82684aeb53d0a381b40e33a80abfc5c05e25b0a91d0f20130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f242062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e666207c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0300000000000000",
+	"042094d3061a43d999e95bab82684aeb53d0a381b40e33a80abfc5c05e25b0a91d0f201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c20f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a020400000000000000",
+	"042094d3061a43d999e95bab82684aeb53d0a381b40e33a80abfc5c05e25b0a91d0f201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c20aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc120500000000000000",
+	"042094d3061a43d999e95bab82684aeb53d0a381b40e33a80abfc5c05e25b0a91d0f201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd72420da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a5110600000000000000",
+	"042094d3061a43d999e95bab82684aeb53d0a381b40e33a80abfc5c05e25b0a91d0f201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd72420bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e0700000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20ffe9fc03f18b176c998806439ff0bb8ad193afdb27b2ccbc88856916dd804e342076bd791f7708c0b6f5a348d574032e07ce3b1929daae19530346f5de955d543c20c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f1630080800000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20ffe9fc03f18b176c998806439ff0bb8ad193afdb27b2ccbc88856916dd804e342076bd791f7708c0b6f5a348d574032e07ce3b1929daae19530346f5de955d543c203a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f774460900000000000000",
+	"042061ae87cb694e8237accda801c8271a8a9d4ffc2581aebf923f5227f24c6bb92a20130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2420f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580000000000000000",
+	"042061ae87cb694e8237accda801c8271a8a9d4ffc2581aebf923f5227f24c6bb92a20130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2420f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f550100000000000000",
+	"042061ae87cb694e8237accda801c8271a8a9d4ffc2581aebf923f5227f24c6bb92a20130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f242062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6662050421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a0300200000000000000",
+	"042061ae87cb694e8237accda801c8271a8a9d4ffc2581aebf923f5227f24c6bb92a20130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f242062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e666207c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0300000000000000",
+	"042061ae87cb694e8237accda801c8271a8a9d4ffc2581aebf923f5227f24c6bb92a201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c20f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a020400000000000000",
+	"042061ae87cb694e8237accda801c8271a8a9d4ffc2581aebf923f5227f24c6bb92a201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c20aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc120500000000000000",
+	"042061ae87cb694e8237accda801c8271a8a9d4ffc2581aebf923f5227f24c6bb92a201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd72420da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a5110600000000000000",
+	"042061ae87cb694e8237accda801c8271a8a9d4ffc2581aebf923f5227f24c6bb92a201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd72420bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e0700000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20ffe9fc03f18b176c998806439ff0bb8ad193afdb27b2ccbc88856916dd804e3420635c0b1b8035705127dc3f672191b4958ad331f9134117e3ba7d721f712b614420c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f1630080800000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20ffe9fc03f18b176c998806439ff0bb8ad193afdb27b2ccbc88856916dd804e3420635c0b1b8035705127dc3f672191b4958ad331f9134117e3ba7d721f712b6144203a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f774460900000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20ffe9fc03f18b176c998806439ff0bb8ad193afdb27b2ccbc88856916dd804e3420cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef3173220e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c6080a00000000000000",
+	"04208850438b439403c52a62aa6c81280ce5ea92bc5ff899ada6933c6afddc882e1820130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2420f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580000000000000000",
+	"04208850438b439403c52a62aa6c81280ce5ea92bc5ff899ada6933c6afddc882e1820130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2420f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f550100000000000000",
+	"04208850438b439403c52a62aa6c81280ce5ea92bc5ff899ada6933c6afddc882e1820130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f242062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6662050421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a0300200000000000000",
+	"04208850438b439403c52a62aa6c81280ce5ea92bc5ff899ada6933c6afddc882e1820130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f242062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e666207c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0300000000000000",
+	"04208850438b439403c52a62aa6c81280ce5ea92bc5ff899ada6933c6afddc882e18201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c20f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a020400000000000000",
+	"04208850438b439403c52a62aa6c81280ce5ea92bc5ff899ada6933c6afddc882e18201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c20aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc120500000000000000",
+	"04208850438b439403c52a62aa6c81280ce5ea92bc5ff899ada6933c6afddc882e18201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd72420da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a5110600000000000000",
+	"04208850438b439403c52a62aa6c81280ce5ea92bc5ff899ada6933c6afddc882e18201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd72420bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e0700000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20130266c8ace013b416e56be57600a9da16e136df92231a964613e2885cce756620635c0b1b8035705127dc3f672191b4958ad331f9134117e3ba7d721f712b614420c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f1630080800000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20130266c8ace013b416e56be57600a9da16e136df92231a964613e2885cce756620635c0b1b8035705127dc3f672191b4958ad331f9134117e3ba7d721f712b6144203a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f774460900000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20130266c8ace013b416e56be57600a9da16e136df92231a964613e2885cce756620cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef3173220e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c6080a00000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20130266c8ace013b416e56be57600a9da16e136df92231a964613e2885cce756620cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef3173220f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c37020b00000000000000",
+	"0420c9cd5269cd697706cb0745d57f66e5ba4a5051fb910127318d283f751910ac7120130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2420f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580000000000000000",
+	"0420c9cd5269cd697706cb0745d57f66e5ba4a5051fb910127318d283f751910ac7120130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2420f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f550100000000000000",
+	"0420c9cd5269cd697706cb0745d57f66e5ba4a5051fb910127318d283f751910ac7120130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f242062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6662050421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a0300200000000000000",
+	"0420c9cd5269cd697706cb0745d57f66e5ba4a5051fb910127318d283f751910ac7120130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f242062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e666207c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0300000000000000",
+	"0420c9cd5269cd697706cb0745d57f66e5ba4a5051fb910127318d283f751910ac71201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c20f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a020400000000000000",
+	"0420c9cd5269cd697706cb0745d57f66e5ba4a5051fb910127318d283f751910ac71201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c20aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc120500000000000000",
+	"0420c9cd5269cd697706cb0745d57f66e5ba4a5051fb910127318d283f751910ac71201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd72420da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a5110600000000000000",
+	"0420c9cd5269cd697706cb0745d57f66e5ba4a5051fb910127318d283f751910ac71201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd72420bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e0700000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20c2b786e4ab72ae4f01c7241bc056817b19d42bc85107f42c3fd3a9b9e98f156420635c0b1b8035705127dc3f672191b4958ad331f9134117e3ba7d721f712b614420c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f1630080800000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20c2b786e4ab72ae4f01c7241bc056817b19d42bc85107f42c3fd3a9b9e98f156420635c0b1b8035705127dc3f672191b4958ad331f9134117e3ba7d721f712b6144203a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f774460900000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20c2b786e4ab72ae4f01c7241bc056817b19d42bc85107f42c3fd3a9b9e98f156420cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef3173220e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c6080a00000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20c2b786e4ab72ae4f01c7241bc056817b19d42bc85107f42c3fd3a9b9e98f156420cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef3173220f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c37020b00000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c20817de36ab2d57feb077634bca77819c8e0bd298c04f6fed0e6a83cc1356ca1552022fab8bcdb88154dbf5877ad1e2d7f1b541bc8a5ec1b52266095381339c27c030c00000000000000",
+	"04203cf9ea50bea2cebf829213d91c098813d11dbe5c6696cdaefab3249dbf892f5e20130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2420f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580000000000000000",
+	"04203cf9ea50bea2cebf829213d91c098813d11dbe5c6696cdaefab3249dbf892f5e20130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2420f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f550100000000000000",
+	"04203cf9ea50bea2cebf829213d91c098813d11dbe5c6696cdaefab3249dbf892f5e20130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f242062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6662050421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a0300200000000000000",
+	"04203cf9ea50bea2cebf829213d91c098813d11dbe5c6696cdaefab3249dbf892f5e20130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f242062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e666207c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0300000000000000",
+	"04203cf9ea50bea2cebf829213d91c098813d11dbe5c6696cdaefab3249dbf892f5e201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c20f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a020400000000000000",
+	"04203cf9ea50bea2cebf829213d91c098813d11dbe5c6696cdaefab3249dbf892f5e201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c20aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc120500000000000000",
+	"04203cf9ea50bea2cebf829213d91c098813d11dbe5c6696cdaefab3249dbf892f5e201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd72420da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a5110600000000000000",
+	"04203cf9ea50bea2cebf829213d91c098813d11dbe5c6696cdaefab3249dbf892f5e201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd72420bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e0700000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20cd6db4bcd77d6ca695b9579f9ec5791d106f83b69118bb3a2a2a99f63779e06720635c0b1b8035705127dc3f672191b4958ad331f9134117e3ba7d721f712b614420c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f1630080800000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20cd6db4bcd77d6ca695b9579f9ec5791d106f83b69118bb3a2a2a99f63779e06720635c0b1b8035705127dc3f672191b4958ad331f9134117e3ba7d721f712b6144203a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f774460900000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20cd6db4bcd77d6ca695b9579f9ec5791d106f83b69118bb3a2a2a99f63779e06720cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef3173220e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c6080a00000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20cd6db4bcd77d6ca695b9579f9ec5791d106f83b69118bb3a2a2a99f63779e06720cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef3173220f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c37020b00000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c2045d573e80606a552974215e13b5d3e7b4dd8675c77b8d612d293475ee139b9472022fab8bcdb88154dbf5877ad1e2d7f1b541bc8a5ec1b52266095381339c27c030c00000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c2045d573e80606a552974215e13b5d3e7b4dd8675c77b8d612d293475ee139b947208cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e8260d00000000000000",
+	"04201d73ff8e39cff60ff0d6402cc752a3351f1b434dccfa1941da3b1e422b73a33c20130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2420f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580000000000000000",
+	"04201d73ff8e39cff60ff0d6402cc752a3351f1b434dccfa1941da3b1e422b73a33c20130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2420f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826420b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f550100000000000000",
+	"04201d73ff8e39cff60ff0d6402cc752a3351f1b434dccfa1941da3b1e422b73a33c20130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f242062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6662050421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a0300200000000000000",
+	"04201d73ff8e39cff60ff0d6402cc752a3351f1b434dccfa1941da3b1e422b73a33c20130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f242062324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e666207c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0300000000000000",
+	"04201d73ff8e39cff60ff0d6402cc752a3351f1b434dccfa1941da3b1e422b73a33c201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c20f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a020400000000000000",
+	"04201d73ff8e39cff60ff0d6402cc752a3351f1b434dccfa1941da3b1e422b73a33c201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c20aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc120500000000000000",
+	"04201d73ff8e39cff60ff0d6402cc752a3351f1b434dccfa1941da3b1e422b73a33c201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd72420da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a5110600000000000000",
+	"04201d73ff8e39cff60ff0d6402cc752a3351f1b434dccfa1941da3b1e422b73a33c201fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656420eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd72420bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e0700000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20076795f3651049c8895a7d127eb9bb4a17698da400430b33fdd06b1d8160394020635c0b1b8035705127dc3f672191b4958ad331f9134117e3ba7d721f712b614420c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f1630080800000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20076795f3651049c8895a7d127eb9bb4a17698da400430b33fdd06b1d8160394020635c0b1b8035705127dc3f672191b4958ad331f9134117e3ba7d721f712b6144203a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f774460900000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20076795f3651049c8895a7d127eb9bb4a17698da400430b33fdd06b1d8160394020cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef3173220e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c6080a00000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20076795f3651049c8895a7d127eb9bb4a17698da400430b33fdd06b1d8160394020cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef3173220f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c37020b00000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c20afa80a9a1bb8b6aad144cfb53e0bab004dd541c8b72025ae694bb60d6050a5322022fab8bcdb88154dbf5877ad1e2d7f1b541bc8a5ec1b52266095381339c27c030c00000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c20afa80a9a1bb8b6aad144cfb53e0bab004dd541c8b72025ae694bb60d6050a532208cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e8260d00000000000000",
+	"04200d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d20002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c205991131c5c25911b35fcea2a8343e2dfd7a4d5b45493390e0cb184394d91c349203a3661bc12b72646c94bc6c92796e81953985ee62d80a9ec3645a9a95740ac150e00000000000000"
+]
diff --git a/depend/zcash/src/test/data/merkle_roots.json b/depend/zcash/src/test/data/merkle_roots.json
new file mode 100644
index 000000000..d34ba6b16
--- /dev/null
+++ b/depend/zcash/src/test/data/merkle_roots.json
@@ -0,0 +1,18 @@
+[
+	"95bf71d8e803b8601c14b5949d0f92690181154ef9d82eb3e24852266823317a",
+	"73f18d3f9cd11010aa01d4f444039e566f14ef282109df9649b2eb75e7a53ed1",
+	"dcde8a273c9672bee1a894d7f7f4abb81078f52b498e095f2a87d0aec5addf25",
+	"4677d481ec6d1e97969afbc530958d1cbb4f1c047af6fdad4687cd10830e02bd",
+	"74cd9d82de30c4222a06d420b75522ae1273729c1d8419446adf1184df61dc69",
+	"2ff57f5468c6afdad30ec0fb6c2cb67289f12584e2c20c4e0065f66748697d77",
+	"27e4ce010670801911c5765a003b15f75cde31d7378bd36540f593c8a44b3011",
+	"62231ef2ec8c4da461072871ab7bc9de10253fcb40e164ddbad05b47e0b7fb69",
+	"733a4ce688fdf07efb9e9f5a4b2dafff87cfe198fbe1dff71e028ef4cdee1f1b",
+	"df39ed31924facdd69a93db07311d45fceac7a4987c091648044f37e6ecbb0d2",
+	"87795c069bdb55281c666b9cb872d13174334ce135c12823541e9536489a9107",
+	"438c80f532903b283230446514e400c329b29483db4fe9e279fdfc79e8f4347d",
+	"08afb2813eda17e94aba1ab28ec191d4af99283cd4f1c5a04c0c2bc221bc3119",
+	"a8b3ab3284f3288f7caa21bd2b69789a159ab4188b0908825b34723305c1228c",
+	"db9b289e620de7dca2ae8fdac96808752e32e7a2c6d97ce0755dcebaa03123ab",
+	"0bf622cb9f901b7532433ea2e7c1b7632f5935899b62dcf897a71551997dc8cc"
+]
diff --git a/depend/zcash/src/test/data/merkle_roots_orchard.h b/depend/zcash/src/test/data/merkle_roots_orchard.h
new file mode 100644
index 000000000..482ab9716
--- /dev/null
+++ b/depend/zcash/src/test/data/merkle_roots_orchard.h
@@ -0,0 +1,5595 @@
+#ifndef ZCASH_TEST_DATA_MERKLE_ROOTS_ORCHARD_H
+#define ZCASH_TEST_DATA_MERKLE_ROOTS_ORCHARD_H
+
+struct OrchardMerkleTestVec {
+    std::vector<unsigned char> bundle;
+    std::vector<std::vector<unsigned char>> commitments;
+    std::vector<unsigned char> anchor;
+};
+
+// These constants were derived by generation using the property-testing
+// infrastructure of librustzcash. Anchor values were computed
+// using https://github.com/zcash-hackworks/zcash-test-vectors/pull/39/files#diff-53efbb4ad196b84742420f65d1ef919a9dc4385bb0f2cb2b8903031a003886a3
+static const std::vector<OrchardMerkleTestVec> merkle_roots_orchard =
+{{
+    .bundle = {
+        0x05, 0x3e, 0xfc, 0x10, 0xea, 0xe4, 0x98, 0x7d, 0xb7, 0xbd, 0xde, 0x08,
+        0xe9, 0x76, 0x66, 0x06, 0xa5, 0xa2, 0x7d, 0xa5, 0x00, 0xfb, 0x73, 0x70,
+        0x44, 0x1a, 0x24, 0x47, 0x0c, 0x75, 0xcf, 0xba, 0x16, 0x2b, 0x4b, 0x68,
+        0x69, 0xd4, 0xac, 0xe3, 0x67, 0x3c, 0xdc, 0xa2, 0x9e, 0x32, 0x3b, 0x2b,
+        0xd9, 0x70, 0x07, 0x57, 0x14, 0xde, 0xb7, 0x79, 0xd5, 0xa8, 0xbd, 0x5c,
+        0x6d, 0xc8, 0x0c, 0xbf, 0x2d, 0x97, 0x45, 0xbd, 0xe5, 0x7c, 0x62, 0x4f,
+        0x98, 0x47, 0xce, 0xb6, 0x6a, 0x88, 0x8f, 0x93, 0xeb, 0x2f, 0x29, 0x43,
+        0xd2, 0x98, 0x5a, 0xbe, 0x51, 0x6f, 0x41, 0x4f, 0xba, 0x6e, 0xff, 0x94,
+        0x17, 0x68, 0x13, 0x5c, 0xf4, 0x99, 0x33, 0x22, 0x90, 0x99, 0xa4, 0x4e,
+        0xc9, 0x9a, 0x75, 0xe1, 0xe1, 0xcb, 0x46, 0x40, 0xf9, 0xb5, 0xbd, 0xec,
+        0x6b, 0x32, 0x23, 0x85, 0x6f, 0xea, 0x16, 0x39, 0x0a, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x0c, 0xbe, 0x5f, 0x19, 0x51, 0x04, 0xdb,
+        0xee, 0x8a, 0xfd, 0x75, 0xf8, 0x6b, 0xb8, 0x3b, 0x22, 0x49, 0xdf, 0x47,
+        0x50, 0x96, 0x89, 0x91, 0x46, 0x41, 0xb1, 0xf4, 0x50, 0x66, 0xc5, 0xe2,
+        0x82, 0x85, 0xba, 0xf0, 0x58, 0x18, 0xde, 0x40, 0xaa, 0x23, 0xe7, 0xde,
+        0xc8, 0x70, 0x08, 0x42, 0xbc, 0xdc, 0xc5, 0xcf, 0xbd, 0x75, 0x8c, 0x01,
+        0xae, 0x1d, 0x1f, 0xde, 0xde, 0x01, 0xf5, 0x20, 0x37, 0xdb, 0xd6, 0xdb,
+        0xd0, 0x92, 0x71, 0xe0, 0x77, 0x79, 0x4b, 0x8b, 0xc1, 0x37, 0x5a, 0x0c,
+        0xa7, 0xfb, 0xfe, 0x70, 0x19, 0x2f, 0x86, 0xb2, 0xb6, 0x11, 0x5c, 0x5d,
+        0x4f, 0x77, 0x35, 0x3f, 0x83, 0x78, 0x31, 0x50, 0x08, 0xfb, 0x29, 0x98,
+        0xb4, 0x30, 0xa5, 0x73, 0x1d, 0x67, 0x26, 0x20, 0x7d, 0xc0, 0xf0, 0xec,
+        0x81, 0xea, 0x64, 0xaf, 0x5c, 0xf6, 0x12, 0x95, 0x69, 0x01, 0xe7, 0x2f,
+        0x0e, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x78, 0x6c, 0x58,
+        0x5f, 0xe3, 0x4d, 0x36, 0xdc, 0xa2, 0x7a, 0xfd, 0x4d, 0xdf, 0xde, 0x94,
+        0x04, 0x49, 0x81, 0xea, 0x52, 0x37, 0xd3, 0xa7, 0xae, 0xbd, 0x34, 0x8b,
+        0xe3, 0x08, 0x89, 0xb3, 0xa1, 0x68, 0x34, 0x70, 0x80, 0x9e, 0x1f, 0xe9,
+        0xca, 0x85, 0x2a, 0xe3, 0xcb, 0x80, 0x72, 0xab, 0x42, 0xb1, 0xc9, 0x28,
+        0xd6, 0x1d, 0x45, 0x45, 0xd1, 0x42, 0xc6, 0xde, 0xa1, 0xc1, 0x56, 0xcf,
+        0x14, 0x0e, 0x5f, 0x77, 0x7d, 0xc3, 0xd4, 0x1a, 0x55, 0xef, 0xa1, 0x50,
+        0x00, 0x79, 0xab, 0xbe, 0x5e, 0xea, 0x58, 0x85, 0x06, 0x8b, 0xa5, 0x16,
+        0xa7, 0x74, 0x08, 0xbd, 0x07, 0xca, 0x79, 0x04, 0x85, 0xee, 0x94, 0x88,
+        0x05, 0x3a, 0x30, 0xc5, 0x96, 0xb4, 0x30, 0x14, 0x10, 0x5d, 0x34, 0x77,
+        0xe6, 0xf5, 0x78, 0xc8, 0x92, 0x40, 0xd1, 0xd1, 0xee, 0x17, 0x43, 0xb7,
+        0x7b, 0xb6, 0xad, 0xc4, 0x0a, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x4d, 0x4d, 0x45, 0x9d, 0x8a, 0x3c, 0x8b, 0xa1, 0x00, 0x19, 0x38,
+        0x54, 0x84, 0x45, 0xba, 0xaa, 0x7a, 0xb0, 0xb4, 0x28, 0xf0, 0xcf, 0x01,
+        0x42, 0xc3, 0x4b, 0xb8, 0xa3, 0x78, 0x69, 0xa3, 0x1d, 0x8c, 0x85, 0xa1,
+        0x59, 0x12, 0xce, 0x6f, 0x54, 0xb8, 0x90, 0xef, 0xb5, 0x16, 0xf8, 0x3b,
+        0xaa, 0x0e, 0x15, 0x54, 0x3c, 0x0f, 0x10, 0x12, 0xe2, 0x13, 0xf2, 0xe1,
+        0x4c, 0x58, 0x32, 0x55, 0x35, 0xd2, 0x93, 0xba, 0xb7, 0x20, 0xc3, 0x6f,
+        0x9b, 0xff, 0x13, 0x15, 0xf7, 0x13, 0x6f, 0x51, 0xcc, 0x9d, 0xf4, 0xaa,
+        0x82, 0x68, 0x32, 0xa1, 0xe2, 0x06, 0x75, 0x7b, 0xa6, 0xe7, 0x11, 0x11,
+        0xaf, 0x9d, 0xdc, 0xe7, 0xf0, 0x65, 0x01, 0xf3, 0x63, 0x76, 0x8c, 0x5b,
+        0xca, 0x3f, 0x26, 0x46, 0x60, 0x83, 0x4d, 0x4d, 0xf4, 0x46, 0xd1, 0x3e,
+        0xfc, 0xd7, 0xc6, 0xf1, 0x7b, 0x16, 0x7a, 0xac, 0x1a, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x1e, 0xf9, 0x6d, 0x36, 0x5a, 0x06, 0x8c,
+        0xc4, 0xee, 0xdf, 0x0d, 0x50, 0x69, 0x29, 0x39, 0x6b, 0x6b, 0xfd, 0x9a,
+        0xfb, 0xc7, 0xa8, 0xb7, 0xb0, 0x25, 0xd9, 0x53, 0x71, 0xb5, 0xb1, 0x90,
+        0x94, 0x2f, 0x0a, 0x81, 0x7d, 0x47, 0xd8, 0x00, 0x83, 0x8e, 0x25, 0x75,
+        0x2e, 0x39, 0xec, 0xf0, 0x46, 0xed, 0x7c, 0x44, 0x19, 0x70, 0x07, 0xa8,
+        0x58, 0xa2, 0xd3, 0x76, 0xde, 0x77, 0x6b, 0x11, 0x19, 0xe4, 0xa7, 0x57,
+        0x9d, 0x8c, 0x95, 0xdd, 0x7e, 0x8d, 0x6b, 0xee, 0xed, 0x61, 0x9d, 0xf1,
+        0x61, 0x98, 0x1f, 0x5a, 0x51, 0x73, 0xfc, 0x10, 0x2f, 0x75, 0x36, 0xc4,
+        0x37, 0x63, 0xe2, 0xc4, 0x8a, 0xbd, 0x86, 0x16, 0x81, 0x1c, 0x6f, 0x5f,
+        0x76, 0x9e, 0xa4, 0x53, 0x9b, 0xba, 0xff, 0x0f, 0x19, 0x8a, 0x6c, 0xdf,
+        0x3b, 0x28, 0x0d, 0xd4, 0x99, 0x26, 0x16, 0x3b, 0xd5, 0x3f, 0x53, 0xa1,
+        0x21, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0xe3, 0xf5,
+        0x32, 0xd1, 0xb1, 0xe0, 0xfb, 0xff, 0xb5, 0xeb, 0x62, 0xbc, 0x5a, 0x30,
+        0x9f, 0xff, 0x99, 0x77, 0x83, 0x63, 0x6b, 0xa7, 0xbc, 0xc1, 0xb3, 0xf1,
+        0x85, 0x1d, 0x99, 0x02, 0x62, 0x8a, 0xc9, 0x24, 0x81, 0xd4, 0xff, 0xae,
+        0x74, 0x05, 0xfd, 0xb5, 0x07, 0x2b, 0x1e, 0xe0, 0x45, 0x40, 0xcf, 0xe8,
+        0x01, 0x3c, 0x00, 0xd9, 0xd4, 0x9d, 0x66, 0xff, 0x28, 0x36, 0xc1, 0xc8,
+        0x7e, 0x03, 0x97, 0xca, 0xfc, 0x13, 0x5e, 0x9d, 0x92, 0x53, 0xcc, 0x35,
+        0x93, 0xec, 0x53, 0x29, 0xb9, 0x70, 0x3d, 0xb9, 0x1c, 0x5f, 0x22, 0x97,
+        0xea, 0xd4, 0xf3, 0xdb, 0x67, 0x65, 0x05, 0x8d, 0x4e, 0x4e, 0xdc, 0xb8,
+        0x84, 0x67, 0x7e, 0x2c, 0x18, 0xd1, 0xe6, 0x95, 0xfd, 0xd6, 0x99, 0x5e,
+        0x9f, 0xd1, 0xa3, 0xd8, 0xa2, 0x76, 0x7c, 0x54, 0xcf, 0xff, 0x51, 0xb6,
+        0xbe, 0xea, 0xeb, 0xd0, 0x1f, 0x64, 0xf6, 0x65, 0xa8, 0xf2, 0x0b, 0x38,
+        0x41, 0xdb, 0x72, 0x86, 0x8b, 0xb4, 0x97, 0x5e, 0x8d, 0x0d, 0x71, 0x70,
+        0x83, 0x0c, 0x74, 0x98, 0x8a, 0x1e, 0x0c, 0x5e, 0x57, 0xe4, 0xd2, 0x16,
+        0x11, 0x4f, 0x6b, 0x57, 0x9a, 0x61, 0xcb, 0x11, 0xbd, 0x2f, 0xfc, 0x65,
+        0x7f, 0xb5, 0x06, 0x05, 0x51, 0x61, 0x09, 0xe1, 0x7b, 0x83, 0x5f, 0x0d,
+        0x1b, 0xfd, 0x69, 0xd9, 0x95, 0x67, 0x38, 0xa6, 0xe5, 0x78, 0xee, 0xc1,
+        0xed, 0x04, 0x57, 0x1b, 0xcc, 0xf1, 0xd6, 0x10, 0xf6, 0x80, 0x0b, 0xb0,
+        0x9a, 0xf0, 0x53, 0x52, 0xac, 0x35, 0xad, 0xce, 0xfa, 0x0a, 0x89, 0x74,
+        0x25, 0x1e, 0x39, 0x69, 0xb5, 0xea, 0x6a, 0xb8, 0xab, 0xb5, 0x28, 0x15,
+        0x89, 0xab, 0xc6, 0x45, 0x9f, 0xac, 0x00, 0x19, 0x00, 0x53, 0x92, 0x5f,
+        0x56, 0xe7, 0x6f, 0xe3, 0x59, 0x43, 0x98, 0xb5, 0xe1, 0xcd, 0x60, 0xe6,
+        0x39, 0xec, 0x9e, 0x32, 0x60, 0x6a, 0x18, 0xab, 0xa7, 0xe9, 0x0f, 0xa6,
+        0x3f, 0x98, 0x8d, 0xd1, 0x6a, 0x41, 0xc3, 0x1a, 0x16, 0x8e, 0x71, 0xe4,
+        0x2f, 0xb5, 0x34, 0x9f, 0x0c, 0xdc, 0x08, 0xe5, 0xb2, 0xca, 0xab, 0xc4,
+        0x4f, 0x17, 0x09, 0xf6, 0x4d, 0x70, 0x60, 0x37, 0x79, 0x1a, 0x6d, 0xcc,
+        0x6c, 0x2d, 0x7c, 0x18, 0xbe, 0x2d, 0x14, 0xb3, 0x70, 0x38, 0x89, 0x03,
+        0x8a, 0xeb, 0x49, 0x21, 0xd3, 0x55, 0xf0, 0xba, 0x11, 0xd2, 0xe9, 0xb8,
+        0x64, 0x0a, 0xc2, 0x1f, 0xb0, 0xf5, 0x18, 0xbe, 0xa3, 0x39, 0x62, 0x00,
+        0xb8, 0x1d, 0xd5, 0x64, 0x00, 0x56, 0x08, 0xac, 0xb9, 0xaa, 0x2a, 0xd4,
+        0x33, 0xbe, 0xc6, 0x4b, 0x91, 0x12, 0x1a, 0x76, 0x6a, 0xe4, 0xc2, 0x7a,
+        0x82, 0x69, 0x7e, 0x14, 0x3d, 0x9f, 0xae, 0x19, 0x5e, 0xbf, 0xa0, 0xe9,
+        0x71, 0x22, 0x3a, 0x66, 0xa7, 0xb4, 0x81, 0x62, 0x52, 0x4e, 0x6c, 0xaf,
+        0x3f, 0x0a, 0x50, 0xfc, 0x31, 0xe5, 0x24, 0xab, 0xbd, 0x7b, 0x4d, 0x1e,
+        0x59, 0x3a, 0x09, 0x5f, 0x9f, 0x3d, 0x8d, 0xbd, 0x99, 0xad, 0xc3, 0xe9,
+        0xef, 0xea, 0xd1, 0x9c, 0x60, 0x99, 0xf9, 0x15, 0x47, 0x11, 0xa9, 0x48,
+        0xb5, 0xa5, 0x7a, 0x0b, 0xb3, 0xf6, 0x18, 0xec, 0x85, 0x60, 0xbf, 0x54,
+        0x70, 0xd2, 0x3d, 0xdd, 0x43, 0xde, 0x84, 0xa9, 0x41, 0x17, 0xf4, 0xc5,
+        0xcb, 0x5e, 0x9a, 0x29, 0xc6, 0x5f, 0x67, 0xda, 0x43, 0x34, 0xa0, 0xa8,
+        0xbf, 0xc7, 0x18, 0xbd, 0x4c, 0x4e, 0xc2, 0x04, 0x4a, 0x2e, 0xc1, 0x6f,
+        0x3c, 0xb2, 0x6f, 0x4b, 0x14, 0xc7, 0x2c, 0x1d, 0xed, 0x6f, 0xdf, 0xcb,
+        0x26, 0x06, 0x77, 0xb6, 0xa7, 0x9d, 0x0a, 0x6a, 0xd3, 0xde, 0x0f, 0x5f,
+        0xff, 0x67, 0x9f, 0x6e, 0x5c, 0x79, 0xd0, 0xa7, 0xcd, 0x93, 0xd7, 0x08,
+        0x23, 0x3d, 0x61, 0x5a, 0x1c, 0xdb, 0xc7, 0x26, 0xc2, 0x42, 0x10, 0x19,
+        0xc2, 0x0b, 0x44, 0x51, 0x01, 0x60, 0x4f, 0x03, 0xf0, 0x11, 0x2a, 0xa7,
+        0x4f, 0x3f, 0xb1, 0x37, 0x83, 0x68, 0x42, 0x30, 0x10, 0x9b, 0xfd, 0xda,
+        0x94, 0x66, 0x07, 0x85, 0x67, 0x45, 0xd2, 0x61, 0xf8, 0xb8, 0x4a, 0xf8,
+        0xea, 0xbf, 0xe5, 0xbb, 0xb2, 0xdc, 0x4a, 0x1e, 0x6d, 0x79, 0x0d, 0xf0,
+        0x9b, 0xc1, 0x19, 0x7c, 0x73, 0x3f, 0x31, 0x7b, 0x44, 0x79, 0x70, 0x3b,
+        0xf0, 0xde, 0x0a, 0xb0, 0x56, 0x07, 0x57, 0xa3, 0x04, 0x1d, 0x88, 0x27,
+        0xe6, 0x9b, 0x21, 0xbb, 0xd4, 0x7d, 0xdb, 0x14, 0xa5, 0x33, 0x94, 0x65,
+        0x55, 0x8b, 0x37, 0xdf, 0xaa, 0x50, 0xdc, 0x79, 0xac, 0x20, 0x8b, 0xbb,
+        0xf3, 0xe6, 0xf6, 0x41, 0x39, 0x49, 0x1d, 0x77, 0xf7, 0x8f, 0x35, 0xa4,
+        0x47, 0xf5, 0x11, 0x1a, 0x5b, 0xb7, 0x6b, 0xf4, 0xd9, 0xd2, 0x8a, 0xe3,
+        0xb5, 0x09, 0x7d, 0xff, 0xf6, 0xc6, 0x40, 0xfd, 0x2d, 0xc4, 0x13, 0x7c,
+        0x2e, 0xef, 0x9c, 0x67, 0xca, 0x2c, 0x20, 0xba, 0x9b, 0xcd, 0x4c, 0x88,
+        0xd8, 0x55, 0x88, 0x7a, 0x08, 0x4f, 0x7f, 0xc3, 0x40, 0x4c, 0x7b, 0x5c,
+        0x60, 0xcc, 0x80, 0x32, 0x3a, 0x97, 0xd5, 0xf7, 0x7f, 0xd4, 0x51, 0x4c,
+        0x07, 0xbf, 0x54, 0xa2, 0x96, 0x17, 0xb3, 0x1a, 0xf4, 0xed, 0xa0, 0x3b,
+        0xb2, 0x5e, 0x17, 0x76, 0x2a, 0x96, 0xfa, 0x8b, 0x48, 0xd9, 0xff, 0x6f,
+        0xe6, 0x46, 0x5c, 0x58, 0x8c, 0xdf, 0xb4, 0x27, 0x91, 0xb2, 0x80, 0xa7,
+        0xd9, 0xac, 0x26, 0xf7, 0x9f, 0x87, 0xf9, 0xf8, 0xb2, 0xc7, 0x23, 0x45,
+        0xfd, 0x56, 0x3c, 0x72, 0x4c, 0xde, 0x96, 0xc4, 0x1f, 0xd7, 0xa3, 0xc0,
+        0x15, 0xa4, 0x96, 0x64, 0x22, 0xf7, 0x1e, 0x3f, 0xd2, 0xea, 0x1f, 0xfc,
+        0x0e, 0x9c, 0xd8, 0x94, 0x46, 0xc5, 0x88, 0x41, 0xc0, 0x26, 0xe1, 0x5c,
+        0x05, 0x9e, 0x49, 0xc1, 0x0c, 0x22, 0xe7, 0xf9, 0xcc, 0xdb, 0x0b, 0xfb,
+        0x92, 0x2f, 0x5b, 0xb7, 0x42, 0x08, 0x85, 0xc8, 0x66, 0x7b, 0x62, 0xd7,
+        0xfc, 0x2a, 0x3d, 0xd7, 0xe2, 0x4d, 0xad, 0xa6, 0x9a, 0xb1, 0x64, 0xf1,
+        0xb8, 0xf8, 0xc6, 0x73, 0x2f, 0xdb, 0xbe, 0x18, 0x56, 0x7d, 0x42, 0x44,
+        0xae, 0xaa, 0xfc, 0x93, 0x49, 0x31, 0x0b, 0x29, 0xc4, 0x12, 0xdf, 0x34,
+        0xf6, 0x97, 0xda, 0x1c, 0x7f, 0x49, 0xff, 0x49, 0x00, 0x8d, 0xf4, 0x7b,
+        0x4c, 0xdc, 0xc9, 0xe4, 0x31, 0xd4, 0x6c, 0x74, 0xee, 0x79, 0xb3, 0x0e,
+        0xe1, 0x2c, 0x70, 0x2b, 0xaf, 0x45, 0x9e, 0xec, 0xcc, 0x00, 0x8b, 0xe4,
+        0x64, 0x07, 0x90, 0x25, 0x01, 0x71, 0x11, 0xe7, 0x48, 0x61, 0xe8, 0x03,
+        0x7f, 0x66, 0x13, 0xa5, 0xd8, 0x27, 0xf2, 0x0b, 0xc7, 0x24, 0x27, 0xa2,
+        0x62, 0x9a, 0x9e, 0x16, 0x17, 0xca, 0xdd, 0xa6, 0x52, 0x39, 0xa7, 0xe4,
+        0x9f, 0xae, 0xb1, 0xdc, 0x3a, 0x07, 0xad, 0xa7, 0x04, 0xcf, 0xe6, 0x38,
+        0xce, 0x56, 0x44, 0xed, 0x3d, 0x0c, 0x03, 0xc2, 0x03, 0xd8, 0xcb, 0x35,
+        0x13, 0x51, 0x18, 0xb3, 0xcc, 0xdc, 0xf7, 0xa5, 0xdb, 0x58, 0xd8, 0x8e,
+        0x02, 0xe2, 0xea, 0x85, 0x82, 0x2d, 0x17, 0x91, 0x08, 0xfe, 0x62, 0x63,
+        0x8a, 0x19, 0x2b, 0xc2, 0x6b, 0x21, 0x25, 0xb9, 0xa8, 0xa2, 0x65, 0x54,
+        0x54, 0xd7, 0xd2, 0x13, 0x8f, 0xa2, 0x17, 0xd7, 0x21, 0x3d, 0x38, 0x66,
+        0x36, 0x3e, 0x7d, 0xe0, 0x01, 0x6c, 0x63, 0xc3, 0x45, 0x73, 0xf6, 0xa7,
+        0x9b, 0x4c, 0xf1, 0x79, 0x09, 0xc8, 0x61, 0xae, 0xec, 0x6f, 0x0a, 0xac,
+        0x2c, 0xa0, 0x8a, 0xfc, 0x74, 0x65, 0x4e, 0x4f, 0x6f, 0xc5, 0x0b, 0x89,
+        0x1b, 0xed, 0xeb, 0x5e, 0x7a, 0xf1, 0x11, 0x89, 0xdb, 0x83, 0xb3, 0x83,
+        0xa8, 0xb4, 0x06, 0x26, 0x76, 0x17, 0x8a, 0x8f, 0x0f, 0xea, 0x03, 0xc0,
+        0xca, 0x64, 0x8f, 0x49, 0xb1, 0x08, 0x81, 0x55, 0xb9, 0xbb, 0x19, 0x0b,
+        0x7c, 0xe8, 0xfd, 0xcd, 0xed, 0xa9, 0xbb, 0x8d, 0xa7, 0xfb, 0xe1, 0x36,
+        0x6c, 0x5a, 0x98, 0x94, 0xa4, 0x7f, 0x58, 0x19, 0xd6, 0x6b, 0x73, 0x02,
+        0x74, 0xaf, 0xe9, 0x7c, 0xc6, 0x76, 0x48, 0x42, 0xee, 0xa6, 0xe5, 0xda,
+        0xb0, 0x47, 0xc7, 0x61, 0x32, 0xe2, 0x0a, 0x67, 0x9a, 0xd4, 0xfd, 0xfb,
+        0xd2, 0xe3, 0x72, 0x0d, 0xff, 0x9e, 0xfc, 0x3e, 0x7b, 0xa3, 0x97, 0x53,
+        0xaf, 0xec, 0x6d, 0x31, 0x45, 0x63, 0x93, 0x12, 0x0c, 0xe2, 0x3a, 0x27,
+        0xde, 0xf4, 0x4f, 0xbe, 0x60, 0xcb, 0xbb, 0x6a, 0xdb, 0x38, 0x97, 0x24,
+        0xd2, 0xdf, 0x54, 0x74, 0xaf, 0x1f, 0x93, 0x2d, 0xba, 0x68, 0x20, 0xb0,
+        0x19, 0x47, 0x6c, 0x29, 0x1a, 0x59, 0x44, 0x2c, 0x92, 0x80, 0x51, 0xe4,
+        0x3d, 0x57, 0x7b, 0x4d, 0xa8, 0xa8, 0x2d, 0x82, 0x58, 0xc5, 0x02, 0x97,
+        0x49, 0x5d, 0xb6, 0xa5, 0x59, 0x28, 0x45, 0xc6, 0x10, 0x77, 0xf3, 0x97,
+        0x89, 0x80, 0xb9, 0xc9, 0x6a, 0x6d, 0xd2, 0x46, 0xa2, 0xbd, 0x09, 0xd6,
+        0x80, 0x3e, 0xaf, 0x8a, 0x70, 0x5d, 0x95, 0x07, 0x66, 0xeb, 0x2e, 0x49,
+        0xc8, 0x28, 0x3a, 0x6e, 0x08, 0x19, 0x06, 0xc9, 0x12, 0xc0, 0x4d, 0x9a,
+        0x98, 0x12, 0x4e, 0x39, 0xbd, 0x9c, 0xc7, 0x80, 0x81, 0xbb, 0x4b, 0x6b,
+        0x8a, 0x29, 0x7b, 0x7f, 0xd6, 0xc9, 0xfa, 0x8e, 0xf1, 0xf9, 0x85, 0xf8,
+        0x2c, 0x62, 0x58, 0x49, 0x14, 0x65, 0x79, 0x83, 0x8e, 0x96, 0xa9, 0xb7,
+        0x9e, 0xcc, 0x07, 0xf4, 0x14, 0x15, 0x0e, 0xc2, 0x9e, 0xab, 0xbe, 0x80,
+        0xb5, 0xc8, 0x46, 0xf3, 0x80, 0x87, 0xa9, 0xf3, 0x09, 0x27, 0xcc, 0x76,
+        0x1d, 0x4f, 0xdc, 0xf5, 0x06, 0x18, 0x45, 0x07, 0x95, 0xc1, 0x22, 0x37,
+        0x8c, 0x3c, 0x24, 0x83, 0xa5, 0xbc, 0x02, 0x6b, 0x7d, 0x61, 0xba, 0xd5,
+        0x29, 0x24, 0x41, 0xa8, 0x73, 0x41, 0xfe, 0xc0, 0x58, 0x0e, 0x4e, 0x65,
+        0x0f, 0xfc, 0x5e, 0x8f, 0xe2, 0x12, 0x89, 0x57, 0x00, 0xb7, 0x6f, 0x53,
+        0xa9, 0x3c, 0x80, 0xf1, 0x55, 0x9b, 0x8c, 0x2b, 0x5e, 0x50, 0x60, 0xf6,
+        0x49, 0x98, 0x46, 0x19, 0x04, 0x83, 0x17, 0xf4, 0x0f, 0xfd, 0xf2, 0xb9,
+        0x24, 0x87, 0xe7, 0x01, 0x55, 0xaf, 0x56, 0xd6, 0xb3, 0xc7, 0xa7, 0xd0,
+        0xd4, 0x87, 0x81, 0x83, 0xf8, 0x08, 0x0a, 0xca, 0xa0, 0x13, 0x47, 0x23,
+        0x35, 0x15, 0x7c, 0xe4, 0xad, 0x02, 0xc0, 0x07, 0xef, 0x3b, 0x07, 0x9a,
+        0xf4, 0x22, 0xf4, 0x32, 0x07, 0x30, 0xca, 0xa0, 0x7a, 0x28, 0x96, 0xcc,
+        0xf9, 0x0c, 0x84, 0x23, 0xe0, 0x31, 0xed, 0x1b, 0x5b, 0xe2, 0x89, 0x58,
+        0x0f, 0xab, 0x65, 0x76, 0x7a, 0x2c, 0xc2, 0x31, 0x1d, 0xe3, 0x30, 0x66,
+        0xe1, 0x17, 0x28, 0x39, 0x4e, 0x14, 0x5f, 0x1b, 0x75, 0xbe, 0xff, 0x30,
+        0xd6, 0x27, 0x38, 0xd8, 0x8b, 0x08, 0xb5, 0xe8, 0x08, 0x85, 0x96, 0xae,
+        0x83, 0xa6, 0x2b, 0x36, 0x45, 0x41, 0xa0, 0xae, 0x65, 0xbe, 0x7d, 0x37,
+        0xef, 0x03, 0xf5, 0x44, 0xe3, 0x68, 0xf0, 0xcd, 0x33, 0xeb, 0x01, 0xc4,
+        0x64, 0x33, 0x4e, 0x30, 0x8b, 0xe0, 0x7d, 0x2c, 0x69, 0x3d, 0x45, 0x8b,
+        0x83, 0x3c, 0xfb, 0xe8, 0xa4, 0xf2, 0x96, 0x2e, 0x1c, 0xd9, 0x6d, 0x47,
+        0xe2, 0x41, 0x60, 0x4f, 0xf4, 0xe0, 0xcc, 0x7d, 0xb9, 0x65, 0xa9, 0x76,
+        0x05, 0x92, 0x79, 0x0b, 0xe8, 0xd0, 0x88, 0xcf, 0xd0, 0xe8, 0x23, 0x60,
+        0xc2, 0x79, 0x41, 0x5c, 0x09, 0xaa, 0x16, 0x94, 0x55, 0x04, 0xf6, 0xe6,
+        0x0a, 0x05, 0x5c, 0xcd, 0x6b, 0x9e, 0xf5, 0x50, 0x4b, 0xb6, 0x13, 0xf9,
+        0x31, 0x39, 0xff, 0x82, 0xca, 0x40, 0xdc, 0xd2, 0x1f, 0x1c, 0xf7, 0x62,
+        0xae, 0xbb, 0x0a, 0xc9, 0x6c, 0xca, 0xae, 0x89, 0x65, 0xb2, 0xfe, 0x01,
+        0x0a, 0x2d, 0xe4, 0xa8, 0x62, 0xd6, 0xd8, 0x4c, 0x43, 0x52, 0x52, 0x35,
+        0xc8, 0xf0, 0xdd, 0x6d, 0xcd, 0x59, 0xfc, 0x9b, 0x92, 0x64, 0xca, 0x63,
+        0xb7, 0xac, 0xb5, 0xe3, 0x9d, 0x7f, 0x89, 0x6a, 0x2f, 0x5d, 0x25, 0x20,
+        0xda, 0x94, 0xdb, 0xff, 0xb1, 0xac, 0x17, 0xd5, 0xa9, 0x5d, 0x86, 0x55,
+        0x93, 0x29, 0xf3, 0xe0, 0xb7, 0x0c, 0x38, 0x07, 0xee, 0x42, 0x95, 0xc0,
+        0x8c, 0xa4, 0xa1, 0x85, 0xe8, 0x88, 0x13, 0x1d, 0x89, 0x54, 0x43, 0xb0,
+        0xb3, 0xd5, 0x23, 0x2a, 0x88, 0x6e, 0x0e, 0x0d, 0xa8, 0xb0, 0x84, 0x43,
+        0x5d, 0x39, 0x3e, 0x07, 0xb3, 0x50, 0x40, 0x6a, 0x88, 0x4b, 0x6f, 0xa4,
+        0x32, 0x97, 0x46, 0xd3, 0x65, 0xf1, 0x7a, 0x86, 0x1a, 0x5a, 0x39, 0x70,
+        0xbe, 0x80, 0x2f, 0x16, 0x9b, 0x3a, 0x86, 0x4b, 0x84, 0xb1, 0xcc, 0xfa,
+        0x2d, 0xc5, 0x0d, 0x6b, 0x5c, 0x93, 0x10, 0xa4, 0x21, 0xe3, 0xd4, 0xee,
+        0x17, 0x9a, 0xb3, 0x05, 0xea, 0x3e, 0xb0, 0xfb, 0xe1, 0x53, 0xec, 0x50,
+        0x37, 0xce, 0xb6, 0x13, 0x88, 0x8d, 0xc8, 0x2f, 0x94, 0x26, 0x41, 0x2a,
+        0xeb, 0xbc, 0xb5, 0xf7, 0xc5, 0x1b, 0x37, 0x48, 0xac, 0xaf, 0x7f, 0x0b,
+        0x8f, 0xc4, 0xd1, 0x37, 0x3b, 0x48, 0x2b, 0x93, 0x01, 0x07, 0x4d, 0x54,
+        0x54, 0x07, 0x58, 0xec, 0x01, 0x9c, 0x8f, 0x5b, 0x05, 0x4d, 0x04, 0x43,
+        0x24, 0x08, 0x33, 0x81, 0x63, 0x02, 0x17, 0x8d, 0x86, 0xe8, 0xff, 0xc4,
+        0xa3, 0x10, 0x5b, 0x39, 0xee, 0x07, 0x78, 0x5e, 0xb1, 0xa3, 0x5a, 0x70,
+        0xa6, 0x12, 0x39, 0xaf, 0xf6, 0xb9, 0xe3, 0xc0, 0x1c, 0xb4, 0x1a, 0xbf,
+        0x4a, 0x05, 0x65, 0x86, 0xea, 0xb1, 0x65, 0x27, 0x87, 0xb3, 0x7f, 0x04,
+        0xf6, 0xd8, 0x92, 0xe4, 0xc2, 0x12, 0x9f, 0xa3, 0x26, 0xf4, 0x43, 0x20,
+        0x86, 0xb2, 0x5f, 0x78, 0x18, 0x61, 0x13, 0xbb, 0xf7, 0x96, 0x66, 0x94,
+        0x39, 0x00, 0x27, 0x02, 0x6b, 0xa7, 0xaa, 0x4c, 0x93, 0x1b, 0xe0, 0x98,
+        0x5f, 0x4f, 0x09, 0x20, 0xcf, 0x26, 0x56, 0x88, 0xf8, 0xc7, 0xd4, 0x09,
+        0xad, 0xdb, 0xbe, 0x65, 0x68, 0x4c, 0x33, 0xb3, 0xac, 0xf4, 0x12, 0xe3,
+        0x19, 0xc7, 0x7a, 0xbd, 0x42, 0x41, 0xa6, 0xd1, 0x87, 0x3e, 0xb2, 0x6a,
+        0xea, 0x4b, 0xe0, 0x43, 0x4c, 0xe5, 0x32, 0x2d, 0x54, 0x89, 0x10, 0xbe,
+        0xe9, 0xf5, 0x19, 0x90, 0xe2, 0xae, 0xbc, 0xb0, 0x22, 0x3a, 0xee, 0x9b,
+        0xb5, 0xc3, 0xb6, 0xa0, 0x67, 0x2a, 0x94, 0x63, 0xf6, 0xc2, 0x18, 0xe8,
+        0x2a, 0xde, 0x72, 0x07, 0xd6, 0x7e, 0xa3, 0xad, 0xe7, 0xb6, 0xa7, 0xb8,
+        0x82, 0xf5, 0x63, 0xfc, 0x12, 0x05, 0x69, 0xf2, 0x30, 0x99, 0xbc, 0xf3,
+        0xa4, 0x75, 0x9f, 0x6c, 0x94, 0x78, 0x39, 0xab, 0x80, 0xab, 0x7d, 0x7e,
+        0x90, 0x18, 0xce, 0x06, 0x89, 0x12, 0x8f, 0x3d, 0x96, 0x9d, 0x18, 0x97,
+        0xe1, 0x61, 0xfb, 0x42, 0xb1, 0x70, 0x41, 0x79, 0x1a, 0x0a, 0x1b, 0x8a,
+        0x29, 0x38, 0x0b, 0x08, 0x68, 0x91, 0x9b, 0x49, 0x42, 0x29, 0x3a, 0x89,
+        0x7d, 0x1d, 0x6c, 0x82, 0xef, 0xe9, 0x0c, 0xde, 0x36, 0x71, 0x16, 0x6a,
+        0xb1, 0xc5, 0x78, 0xe8, 0x2c, 0x2b, 0x34, 0xab, 0x63, 0xb2, 0x8a, 0x73,
+        0x0e, 0x92, 0xe0, 0x8e, 0x56, 0x27, 0x39, 0x29, 0xe5, 0xf8, 0x40, 0xab,
+        0xd3, 0x38, 0xca, 0x02, 0x56, 0x7b, 0xbb, 0x51, 0x46, 0xb5, 0x10, 0x0e,
+        0x18, 0xff, 0xec, 0x59, 0x27, 0xf1, 0x79, 0xe8, 0x5e, 0x84, 0x9b, 0x4f,
+        0x92, 0x6d, 0xa6, 0xb2, 0xd8, 0x10, 0x64, 0x4e, 0xe3, 0xdd, 0xc0, 0xb7,
+        0x5b, 0x30, 0x6c, 0xb7, 0xba, 0xa5, 0x12, 0xee, 0xe2, 0xbb, 0x4b, 0x79,
+        0x5f, 0x4f, 0xb1, 0x41, 0xa8, 0x00, 0x63, 0x41, 0xab, 0xa4, 0x05, 0x48,
+        0xaa, 0x02, 0xe8, 0xe8, 0xa0, 0x43, 0xda, 0xf4, 0xf9, 0xa7, 0x3a, 0x3a,
+        0x94, 0x34, 0xd4, 0xdb, 0x3c, 0xb0, 0x9f, 0x1a, 0x02, 0xa4, 0x33, 0x7c,
+        0x8b, 0xa1, 0x29, 0xd3, 0xd8, 0x12, 0x93, 0x71, 0x91, 0x84, 0xbc, 0x57,
+        0x4c, 0xa8, 0xb3, 0xe2, 0x37, 0xc6, 0x62, 0x74, 0xf6, 0xbb, 0xdc, 0x37,
+        0xe1, 0xd2, 0x92, 0x70, 0x62, 0xd1, 0x5a, 0x32, 0x47, 0x49, 0x17, 0xb0,
+        0xf9, 0x67, 0x58, 0xd3, 0x00, 0x31, 0x20, 0x06, 0x19, 0x74, 0xf9, 0x2a,
+        0x62, 0x1c, 0x36, 0x83, 0x67, 0xed, 0x86, 0x40, 0x4b, 0x13, 0x8b, 0xd2,
+        0x79, 0xe0, 0xee, 0x67, 0x8b, 0xc0, 0x3f, 0x92, 0xf2, 0xa2, 0x1b, 0x69,
+        0x0b, 0x08, 0x17, 0xb6, 0x93, 0x48, 0xe8, 0x7d, 0x16, 0x5a, 0x07, 0x2b,
+        0x7a, 0x35, 0x97, 0x89, 0x3c, 0xb5, 0xe0, 0x96, 0xc8, 0xff, 0x65, 0xb8,
+        0xf8, 0x54, 0x66, 0xa6, 0x75, 0x99, 0x5b, 0x78, 0xba, 0x2e, 0xfd, 0x56,
+        0x98, 0xb4, 0x49, 0xd8, 0x7b, 0x52, 0x45, 0xb8, 0x7d, 0x57, 0xd3, 0x03,
+        0xfa, 0x50, 0xbb, 0xdc, 0x9e, 0xd1, 0xbe, 0x48, 0xde, 0xc2, 0x9a, 0x5e,
+        0x5d, 0x90, 0xf3, 0x2a, 0x72, 0x13, 0x60, 0xd9, 0xac, 0xc1, 0x71, 0xa6,
+        0xa0, 0x83, 0xda, 0xc6, 0x93, 0x78, 0xe0, 0x72, 0xae, 0x66, 0x38, 0x7e,
+        0x86, 0xdb, 0x26, 0x08, 0xf6, 0x5a, 0x9f, 0xcc, 0xc2, 0x0f, 0x23, 0xe1,
+        0xf0, 0x1d, 0xe9, 0xac, 0x7f, 0x08, 0x6b, 0x0d, 0xf8, 0xd3, 0x32, 0x10,
+        0x26, 0xad, 0xcd, 0xc7, 0xc6, 0xfa, 0x48, 0xcc, 0xbe, 0x7a, 0x2e, 0x9e,
+        0xbb, 0x61, 0x74, 0x62, 0xd1, 0xe8, 0x26, 0xea, 0xed, 0x0b, 0xac, 0x2b,
+        0x71, 0x4a, 0x09, 0x0c, 0xee, 0x47, 0x4f, 0x08, 0x37, 0x78, 0x1c, 0x8e,
+        0x88, 0x9d, 0x1e, 0x6c, 0x8c, 0x92, 0xee, 0xbe, 0xf4, 0x65, 0xb5, 0x31,
+        0xa6, 0x45, 0xcb, 0x7b, 0x95, 0x14, 0xeb, 0xb3, 0x7c, 0xf5, 0x02, 0x58,
+        0x79, 0xc6, 0x0b, 0xbe, 0x55, 0xca, 0x72, 0x91, 0x83, 0xb4, 0xf4, 0x2c,
+        0x61, 0x38, 0xc6, 0x92, 0x3f, 0x7f, 0xdb, 0x24, 0x98, 0x48, 0x60, 0x1d,
+        0x2a, 0x16, 0xae, 0x80, 0xc7, 0x95, 0xef, 0xdf, 0x19, 0x17, 0x2a, 0xa2,
+        0xca, 0xcc, 0x5e, 0x2c, 0x28, 0x96, 0xd8, 0x04, 0x87, 0xd5, 0x08, 0x5a,
+        0x16, 0x6e, 0x29, 0xc5, 0x0c, 0x6d, 0xe6, 0xa8, 0x72, 0x0c
+    },
+    .commitments = {
+        { 0x68, 0x13, 0x5c, 0xf4, 0x99, 0x33, 0x22, 0x90, 0x99, 0xa4, 0x4e, 0xc9, 0x9a, 0x75, 0xe1, 0xe1, 0xcb, 0x46, 0x40, 0xf9, 0xb5, 0xbd, 0xec, 0x6b, 0x32, 0x23, 0x85, 0x6f, 0xea, 0x16, 0x39, 0x0a },
+        { 0x78, 0x31, 0x50, 0x08, 0xfb, 0x29, 0x98, 0xb4, 0x30, 0xa5, 0x73, 0x1d, 0x67, 0x26, 0x20, 0x7d, 0xc0, 0xf0, 0xec, 0x81, 0xea, 0x64, 0xaf, 0x5c, 0xf6, 0x12, 0x95, 0x69, 0x01, 0xe7, 0x2f, 0x0e },
+        { 0xee, 0x94, 0x88, 0x05, 0x3a, 0x30, 0xc5, 0x96, 0xb4, 0x30, 0x14, 0x10, 0x5d, 0x34, 0x77, 0xe6, 0xf5, 0x78, 0xc8, 0x92, 0x40, 0xd1, 0xd1, 0xee, 0x17, 0x43, 0xb7, 0x7b, 0xb6, 0xad, 0xc4, 0x0a },
+        { 0x9d, 0xdc, 0xe7, 0xf0, 0x65, 0x01, 0xf3, 0x63, 0x76, 0x8c, 0x5b, 0xca, 0x3f, 0x26, 0x46, 0x60, 0x83, 0x4d, 0x4d, 0xf4, 0x46, 0xd1, 0x3e, 0xfc, 0xd7, 0xc6, 0xf1, 0x7b, 0x16, 0x7a, 0xac, 0x1a },
+        { 0xbd, 0x86, 0x16, 0x81, 0x1c, 0x6f, 0x5f, 0x76, 0x9e, 0xa4, 0x53, 0x9b, 0xba, 0xff, 0x0f, 0x19, 0x8a, 0x6c, 0xdf, 0x3b, 0x28, 0x0d, 0xd4, 0x99, 0x26, 0x16, 0x3b, 0xd5, 0x3f, 0x53, 0xa1, 0x21 },
+    },
+    .anchor = {
+        0xc8, 0x75, 0xbe, 0x2d, 0x60, 0x87, 0x3f, 0x8b, 0xcd, 0xeb, 0x91, 0x28,
+        0x2e, 0x64, 0x2e, 0x0c, 0xc6, 0x5f, 0xf7, 0xd0, 0x64, 0x2d, 0x13, 0x7b,
+        0x28, 0xcf, 0x28, 0xcc, 0x9c, 0x52, 0x7f, 0x0e
+    }
+},
+{
+    .bundle = {
+        0x05, 0xc6, 0x2d, 0xad, 0x07, 0x79, 0x12, 0x80, 0x26, 0x39, 0x2a, 0x56,
+        0xe0, 0x98, 0x9c, 0x89, 0xff, 0x78, 0x53, 0x7f, 0x88, 0x96, 0x65, 0xc5,
+        0xa9, 0x65, 0xc3, 0x41, 0xa8, 0x6f, 0xcd, 0x29, 0x18, 0x35, 0xdc, 0x36,
+        0x4c, 0xdf, 0xa9, 0x3c, 0x33, 0xdb, 0x77, 0xd2, 0x98, 0x9f, 0x74, 0xe2,
+        0x6e, 0xc9, 0xc5, 0x62, 0xc1, 0x63, 0x84, 0xb5, 0x97, 0xf2, 0x12, 0xb5,
+        0x58, 0xc6, 0x81, 0x5e, 0x27, 0xa6, 0xa6, 0xbf, 0xe6, 0xb1, 0x8f, 0xbe,
+        0x1b, 0xd0, 0x46, 0xeb, 0x0b, 0x6f, 0xb3, 0xa8, 0x59, 0xc2, 0x8c, 0x5e,
+        0x11, 0xb3, 0x26, 0x4c, 0xd8, 0xfb, 0xa9, 0xdf, 0x20, 0x87, 0xfb, 0x34,
+        0xa2, 0x31, 0x11, 0xbe, 0x48, 0x8a, 0xfc, 0x50, 0x4c, 0x11, 0xaf, 0x2d,
+        0xfb, 0x35, 0xda, 0x93, 0x2f, 0x65, 0x72, 0xee, 0xcd, 0x19, 0xa6, 0xc8,
+        0x54, 0x09, 0x5b, 0x01, 0x68, 0x30, 0x88, 0xe8, 0x25, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0xaf, 0xf8, 0x7f, 0xb8, 0xd5, 0xeb, 0xe6,
+        0x40, 0x7e, 0x38, 0x01, 0xe8, 0x08, 0x7f, 0xed, 0x75, 0x52, 0xc4, 0x80,
+        0x72, 0xce, 0xdf, 0xc2, 0x64, 0x19, 0x8f, 0x1f, 0x61, 0x13, 0x97, 0xe3,
+        0xa7, 0xe7, 0x69, 0x44, 0x0e, 0x7a, 0x63, 0x66, 0x8c, 0xe6, 0x94, 0x72,
+        0x4a, 0xbb, 0x75, 0x99, 0x08, 0xe5, 0x36, 0xa0, 0xf1, 0x2b, 0x38, 0x22,
+        0x1c, 0xfe, 0x9a, 0x70, 0x4e, 0xb1, 0x2e, 0x63, 0x3b, 0xfd, 0x14, 0x41,
+        0x89, 0x99, 0x57, 0x54, 0x8f, 0xe5, 0x7b, 0x96, 0x9f, 0x4a, 0x14, 0x6e,
+        0x24, 0x91, 0x7c, 0xb3, 0x21, 0xda, 0xdc, 0x21, 0x40, 0xd7, 0xac, 0x11,
+        0xa0, 0xb4, 0xcd, 0x4a, 0x3f, 0x6f, 0x01, 0x84, 0x37, 0xde, 0x72, 0x2d,
+        0xa9, 0xa9, 0x88, 0x1c, 0x6d, 0x17, 0x6f, 0xf4, 0x19, 0x60, 0x84, 0x4e,
+        0x6e, 0x0a, 0x3a, 0xd6, 0xcf, 0x8e, 0xdb, 0x6a, 0xf4, 0xf1, 0xc2, 0x8a,
+        0x34, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xf5, 0x87, 0xc7,
+        0x9c, 0xcd, 0x90, 0x26, 0x81, 0xdc, 0xf1, 0xd2, 0xa0, 0xbc, 0x55, 0xcd,
+        0x1a, 0xd5, 0xd3, 0xec, 0xd2, 0xec, 0x3c, 0x60, 0x7d, 0xc8, 0x35, 0xe0,
+        0x3e, 0xa1, 0xa6, 0x16, 0xaa, 0xf0, 0xee, 0x7a, 0xf5, 0x97, 0x6f, 0x2e,
+        0xb4, 0xc7, 0x58, 0x39, 0x62, 0xe2, 0x48, 0xf2, 0x1b, 0x4a, 0x52, 0x07,
+        0x60, 0xd2, 0x0b, 0x8f, 0xa8, 0x05, 0x16, 0xb2, 0x09, 0xff, 0xea, 0x73,
+        0x38, 0xcd, 0xd5, 0x48, 0x84, 0x03, 0x85, 0xb3, 0x3d, 0x02, 0xad, 0xec,
+        0xab, 0x5b, 0x64, 0x8e, 0x6d, 0x1b, 0x41, 0x76, 0x82, 0xdc, 0x62, 0x24,
+        0x71, 0x0d, 0xac, 0x94, 0x5e, 0x28, 0xb7, 0x7c, 0xa1, 0x44, 0xc3, 0xb9,
+        0x59, 0xf9, 0xe5, 0x08, 0x0d, 0xfd, 0x55, 0x0a, 0x84, 0x82, 0x58, 0x34,
+        0xfb, 0x39, 0x2b, 0x6e, 0xe6, 0x61, 0xf8, 0x9b, 0x2b, 0xfb, 0xa5, 0xfb,
+        0x45, 0x44, 0x4e, 0x67, 0x3a, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0xc9, 0x3b, 0x9e, 0x98, 0xf4, 0x86, 0xc4, 0x5a, 0x83, 0xdc, 0x67,
+        0xf1, 0x9a, 0x16, 0xe8, 0xf8, 0x69, 0xbd, 0x9e, 0x16, 0x9a, 0x08, 0x6e,
+        0x4a, 0xa6, 0x0b, 0x0c, 0x78, 0x78, 0x1d, 0xbe, 0x0d, 0x68, 0xe9, 0x10,
+        0x9e, 0x9f, 0x42, 0xe9, 0x8e, 0x4f, 0x01, 0x6f, 0x6f, 0xe2, 0xe8, 0xbc,
+        0x88, 0xd4, 0x06, 0x0b, 0x63, 0xd1, 0xcb, 0x16, 0x51, 0xca, 0x31, 0x43,
+        0xd2, 0xc8, 0x3a, 0xf2, 0x05, 0x03, 0x88, 0xe1, 0xa2, 0xd0, 0xd6, 0xc6,
+        0x8d, 0x63, 0x86, 0xec, 0x05, 0x6c, 0x71, 0x25, 0x08, 0x0b, 0x0f, 0x41,
+        0xbf, 0xe2, 0xfd, 0x12, 0x3a, 0x9f, 0x15, 0x9c, 0xec, 0x9b, 0xce, 0x03,
+        0xa4, 0x5e, 0xc3, 0x6d, 0xce, 0xb0, 0xa0, 0xb1, 0xf8, 0x1e, 0x3f, 0x16,
+        0x72, 0x49, 0x91, 0x78, 0x1f, 0xae, 0xfa, 0x68, 0x38, 0x24, 0xe7, 0x4e,
+        0x81, 0x20, 0xf7, 0x46, 0x53, 0x08, 0xe9, 0xd9, 0x21, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x90, 0x10, 0xd9, 0x42, 0x26, 0x76, 0x43,
+        0x27, 0x28, 0xf4, 0xbb, 0xc1, 0xa0, 0xb9, 0xc4, 0x30, 0xf3, 0x54, 0x07,
+        0x50, 0xb3, 0xa6, 0x0c, 0xd9, 0x54, 0xe2, 0x71, 0x1c, 0x1d, 0xb0, 0xf1,
+        0x83, 0xd4, 0x82, 0xf7, 0xf4, 0x51, 0xed, 0x68, 0xf8, 0x30, 0xe8, 0x22,
+        0xe7, 0x03, 0x0d, 0xe8, 0xe9, 0x1a, 0x52, 0x98, 0x35, 0xf3, 0x48, 0xe3,
+        0x92, 0xff, 0xfc, 0x49, 0x3b, 0x50, 0x8e, 0x33, 0x33, 0x55, 0xd2, 0xdc,
+        0x23, 0xa7, 0x89, 0x6a, 0xb1, 0xee, 0x1e, 0xac, 0x7c, 0x42, 0x31, 0x1d,
+        0x89, 0xdf, 0x85, 0x3d, 0x47, 0xb2, 0x87, 0x61, 0xa6, 0xdc, 0x86, 0x86,
+        0x2d, 0xab, 0xa5, 0xab, 0x3d, 0x9c, 0x35, 0xf2, 0x03, 0x20, 0x36, 0x09,
+        0x92, 0xf6, 0xa8, 0x8a, 0xa5, 0xc8, 0x70, 0xcd, 0xb5, 0x9c, 0x45, 0x97,
+        0xfe, 0x08, 0xfb, 0xf8, 0xe1, 0xf3, 0xb2, 0x14, 0x73, 0x3d, 0x89, 0x23,
+        0x2a, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x03, 0x9b, 0xb5,
+        0x27, 0x55, 0x4f, 0x11, 0xfe, 0xff, 0x1b, 0x6f, 0xc4, 0xc2, 0xa0, 0x15,
+        0x4d, 0xdf, 0x7c, 0x8d, 0x7d, 0xf4, 0x7e, 0x8c, 0x59, 0x16, 0x27, 0xec,
+        0x74, 0xce, 0x73, 0xe6, 0x41, 0xe7, 0x26, 0x71, 0xd0, 0x59, 0xdf, 0x2f,
+        0x9c, 0x05, 0xfd, 0xb5, 0x07, 0x54, 0x50, 0x8d, 0x8f, 0xca, 0x2e, 0x23,
+        0xef, 0x94, 0xd7, 0x9e, 0xa2, 0x95, 0x36, 0x73, 0x13, 0x94, 0x4f, 0x1a,
+        0xc2, 0x8b, 0x23, 0x74, 0x85, 0x79, 0x61, 0x2e, 0x21, 0x59, 0x05, 0xcc,
+        0x01, 0xa2, 0xd7, 0xa7, 0xc2, 0x61, 0xd6, 0x56, 0x36, 0x05, 0xe1, 0x3d,
+        0x96, 0x87, 0x39, 0xf4, 0xdc, 0xef, 0x91, 0x7a, 0x85, 0x2f, 0x00, 0x2a,
+        0x92, 0xf0, 0x67, 0x4b, 0x9c, 0x78, 0x67, 0x64, 0x10, 0x64, 0x85, 0x17,
+        0xcc, 0xc5, 0x04, 0x91, 0xc2, 0xf2, 0xe3, 0x50, 0xb4, 0xac, 0xd3, 0x2f,
+        0x6f, 0x33, 0x28, 0xbf, 0x97, 0x96, 0x3b, 0x22, 0x78, 0xcd, 0xc0, 0x68,
+        0x12, 0x5c, 0xbe, 0x70, 0xf4, 0x00, 0x18, 0xfa, 0x81, 0xe3, 0x89, 0x17,
+        0x3f, 0xe0, 0x8e, 0xa8, 0x8a, 0x87, 0xc7, 0xe8, 0x8c, 0x0e, 0xe5, 0x28,
+        0x82, 0x86, 0x35, 0xc6, 0xc2, 0x52, 0x0c, 0x56, 0x60, 0x66, 0x27, 0xd3,
+        0xcf, 0xa7, 0x9a, 0xec, 0xde, 0x97, 0x90, 0x2e, 0x5d, 0x85, 0xfc, 0xd4,
+        0x38, 0x23, 0x5f, 0xbf, 0x15, 0x93, 0x10, 0x59, 0x1b, 0x17, 0xdc, 0x1f,
+        0x51, 0xff, 0xd3, 0xc3, 0x77, 0x6f, 0x2a, 0x1d, 0xc3, 0x79, 0x90, 0xd3,
+        0x28, 0xfb, 0xf9, 0xcb, 0x13, 0x88, 0x5b, 0xab, 0x52, 0x89, 0xeb, 0x2a,
+        0x7b, 0x14, 0xdd, 0x42, 0x3e, 0x45, 0xd1, 0x2f, 0x7a, 0x6f, 0x55, 0x92,
+        0xcb, 0x61, 0xb6, 0xb0, 0xe0, 0x1f, 0xde, 0xe3, 0x76, 0x97, 0xab, 0x16,
+        0x9b, 0x0d, 0xc3, 0x8c, 0xb5, 0xa0, 0x7a, 0x59, 0x93, 0x3d, 0x84, 0x30,
+        0xca, 0x13, 0x66, 0x99, 0x51, 0xb4, 0x2d, 0x3d, 0xba, 0x90, 0x6f, 0xcf,
+        0x96, 0x90, 0xbb, 0xd4, 0x0d, 0x53, 0x1a, 0xe6, 0x2f, 0x43, 0xc9, 0x2b,
+        0x1c, 0x2e, 0x01, 0x61, 0x4f, 0x54, 0xa7, 0x91, 0xda, 0x3d, 0xcc, 0xbe,
+        0xcf, 0x64, 0xa9, 0xda, 0xfb, 0x6c, 0xe1, 0x81, 0x4c, 0x21, 0x5a, 0x8f,
+        0xf7, 0xa5, 0x50, 0x1c, 0x32, 0x6e, 0xc2, 0xed, 0x5d, 0x6f, 0x4e, 0x5b,
+        0xf3, 0xf7, 0xad, 0x9d, 0xeb, 0xb8, 0x08, 0xef, 0x16, 0x31, 0x0f, 0x83,
+        0xb4, 0x1d, 0xce, 0xcb, 0x9c, 0x1d, 0xc6, 0xb5, 0x77, 0x94, 0x03, 0x86,
+        0x7e, 0xd1, 0x5a, 0x7e, 0xe4, 0xf9, 0x93, 0x4f, 0x01, 0xee, 0x76, 0xc8,
+        0x49, 0x87, 0x2e, 0xd1, 0x69, 0xd9, 0x99, 0xe6, 0x09, 0x9d, 0x3c, 0x53,
+        0x48, 0x85, 0x3e, 0xfc, 0xe2, 0x52, 0x33, 0x30, 0xd5, 0xd5, 0x91, 0xb0,
+        0xd9, 0x30, 0xaf, 0xe3, 0xba, 0xf1, 0xf8, 0x09, 0x88, 0x9b, 0xe6, 0xc4,
+        0x62, 0x97, 0xb3, 0x0a, 0x3b, 0x8e, 0xd7, 0x1b, 0x5a, 0xef, 0xcf, 0xb2,
+        0xc1, 0x45, 0x48, 0xed, 0xa0, 0x5c, 0x89, 0xc6, 0x58, 0x20, 0x42, 0x26,
+        0x80, 0x64, 0xd7, 0x33, 0xdc, 0x47, 0x02, 0x15, 0x82, 0x60, 0xaf, 0x60,
+        0x61, 0xfd, 0x79, 0xca, 0xdc, 0x3f, 0xcf, 0x03, 0xa6, 0x1a, 0x5f, 0x95,
+        0xbd, 0x97, 0x5a, 0xf2, 0x21, 0x0f, 0x7e, 0xb5, 0x2e, 0xd9, 0x7a, 0xc0,
+        0x6f, 0x3d, 0xce, 0x91, 0xb5, 0x49, 0xf7, 0x2c, 0xe5, 0x81, 0xa0, 0xda,
+        0x8e, 0x58, 0x7f, 0x50, 0x4a, 0x5e, 0x33, 0xc1, 0x37, 0xd7, 0x74, 0xf7,
+        0xe1, 0x7b, 0x2f, 0xf4, 0x76, 0x0a, 0x49, 0x7a, 0x11, 0x08, 0x31, 0xf0,
+        0x3d, 0xcd, 0x14, 0x3b, 0x03, 0xa0, 0x9f, 0x76, 0x8e, 0x5b, 0x3d, 0x9c,
+        0xd4, 0xb2, 0xde, 0xcd, 0xeb, 0x33, 0xce, 0xf6, 0xef, 0xe1, 0x56, 0xf8,
+        0xf0, 0xbd, 0xd8, 0xac, 0x6c, 0xf4, 0x0e, 0xc6, 0xc7, 0x3a, 0xbf, 0x12,
+        0x56, 0xbe, 0x71, 0x8b, 0xe9, 0x73, 0x4a, 0x66, 0xe5, 0x50, 0x5f, 0xe5,
+        0x5e, 0x99, 0xfb, 0x82, 0x9e, 0xae, 0x1b, 0xe2, 0x1f, 0x34, 0xae, 0x16,
+        0x84, 0xb4, 0xa9, 0x7c, 0x65, 0x70, 0xe9, 0x84, 0xde, 0x6e, 0xd3, 0xf4,
+        0x67, 0xbb, 0x4c, 0x16, 0xd5, 0x59, 0x03, 0xc0, 0xef, 0xfd, 0x9b, 0x75,
+        0x06, 0xdb, 0x66, 0x8f, 0x89, 0xeb, 0x45, 0xcc, 0x4a, 0xa5, 0x40, 0x14,
+        0xb1, 0x25, 0x44, 0x1b, 0x1d, 0x90, 0x5d, 0xeb, 0x2e, 0xa0, 0x55, 0xd9,
+        0xc9, 0x2b, 0xaf, 0x01, 0x6a, 0x18, 0x22, 0x06, 0x87, 0x6d, 0xf3, 0xbd,
+        0x5d, 0x09, 0xf4, 0xe0, 0xf8, 0xef, 0x39, 0xdf, 0xf1, 0x16, 0x97, 0x38,
+        0x1c, 0x64, 0xb1, 0xe8, 0x5b, 0x76, 0xd9, 0xfb, 0x20, 0xf7, 0x53, 0xf0,
+        0xc8, 0xd1, 0x6e, 0x52, 0x88, 0xae, 0xc4, 0x13, 0x05, 0x00, 0xf9, 0xa4,
+        0xf8, 0x00, 0xff, 0x8a, 0x5f, 0xee, 0x32, 0xd9, 0x1d, 0x6a, 0x01, 0x4e,
+        0x2e, 0x36, 0xdc, 0xf0, 0x06, 0xdd, 0x25, 0xe2, 0x05, 0x6a, 0xda, 0xaa,
+        0xdc, 0x4c, 0x99, 0xff, 0x3c, 0x21, 0x0c, 0xc5, 0x01, 0xdc, 0x9d, 0x9f,
+        0x41, 0xa5, 0x69, 0x1f, 0xf0, 0xad, 0x5d, 0x08, 0x2d, 0x4a, 0xe9, 0x48,
+        0xbd, 0x44, 0x3a, 0xc7, 0xad, 0x86, 0x92, 0x24, 0x04, 0xa1, 0x12, 0xd9,
+        0x16, 0x25, 0xe3, 0x07, 0x05, 0xa3, 0xa9, 0x34, 0x96, 0x1f, 0x1c, 0x61,
+        0x43, 0x42, 0xa4, 0x5b, 0x52, 0x34, 0xf0, 0x55, 0xb6, 0x91, 0x10, 0x46,
+        0x6c, 0x13, 0x9e, 0x06, 0x16, 0xde, 0xf5, 0x13, 0x82, 0xaf, 0x46, 0xd3,
+        0x21, 0x63, 0x47, 0x72, 0x33, 0xc8, 0x85, 0x25, 0x46, 0x3a, 0x00, 0x79,
+        0xc5, 0xbc, 0x48, 0xc5, 0xb1, 0x21, 0x80, 0x44, 0x92, 0x05, 0xe8, 0x16,
+        0xf0, 0x23, 0x80, 0x17, 0xe2, 0xd2, 0x54, 0x93, 0xff, 0xbb, 0x69, 0xfb,
+        0xd2, 0x6b, 0xcd, 0x56, 0x82, 0xf0, 0xda, 0xa1, 0x8e, 0x7f, 0xb7, 0x06,
+        0x6a, 0x69, 0x8c, 0xb9, 0x26, 0x9c, 0x14, 0x50, 0x2d, 0x64, 0x32, 0xfa,
+        0x84, 0xbd, 0x2c, 0x5b, 0xf9, 0xf6, 0x94, 0x82, 0xad, 0x14, 0xa6, 0xf5,
+        0xde, 0xe2, 0xe9, 0x9c, 0x7c, 0x95, 0x69, 0x25, 0x3e, 0xad, 0x9c, 0xbd,
+        0x7a, 0xe5, 0xcb, 0xe8, 0xf3, 0xef, 0xc2, 0x5d, 0x23, 0x02, 0xc8, 0x18,
+        0xcd, 0xba, 0x55, 0x63, 0x8e, 0x57, 0xa3, 0xf6, 0x84, 0xb0, 0x49, 0x34,
+        0x2e, 0x0a, 0x2e, 0x6f, 0x63, 0x2f, 0xcc, 0xb4, 0x62, 0x15, 0x0d, 0xaa,
+        0x2e, 0x83, 0xbd, 0xde, 0x65, 0xa8, 0x02, 0x6d, 0xc0, 0xcb, 0xdd, 0xa5,
+        0x8a, 0xed, 0x3e, 0x33, 0x07, 0xea, 0x52, 0x8a, 0xec, 0x14, 0x6d, 0xb7,
+        0x52, 0x9b, 0x97, 0x35, 0xb4, 0x74, 0xd8, 0x5b, 0x5c, 0x41, 0x16, 0x7b,
+        0x98, 0xb2, 0x09, 0xfb, 0x03, 0x5f, 0xe2, 0xb7, 0x48, 0xfb, 0x50, 0x71,
+        0x2b, 0xea, 0xfb, 0xed, 0x6c, 0x80, 0x86, 0x4a, 0x01, 0x21, 0xe7, 0xdd,
+        0x9e, 0x2d, 0x71, 0xb5, 0x8a, 0x95, 0xdf, 0xa0, 0x57, 0x9f, 0x65, 0xcc,
+        0xd1, 0xfa, 0x8b, 0xae, 0xf0, 0x39, 0x83, 0x6f, 0x29, 0xf1, 0xb9, 0xb7,
+        0xce, 0x88, 0x0e, 0xdc, 0x2d, 0xea, 0xb5, 0x49, 0x09, 0x7d, 0x9f, 0x12,
+        0xfe, 0x5d, 0xb4, 0x90, 0xec, 0xa3, 0x00, 0x39, 0x5d, 0xa4, 0x72, 0x3b,
+        0xc5, 0xd6, 0xe7, 0x1d, 0x35, 0xc7, 0x9d, 0xf8, 0x61, 0x3f, 0xa6, 0x69,
+        0xc7, 0xe9, 0x1e, 0xea, 0x20, 0xcf, 0xc7, 0x0d, 0x4f, 0x4f, 0xff, 0x68,
+        0x18, 0x83, 0x9a, 0xd8, 0x19, 0x25, 0xab, 0x85, 0xb6, 0xb2, 0xfe, 0x7e,
+        0x0e, 0xa8, 0xfe, 0x7c, 0x94, 0x40, 0x73, 0x21, 0x59, 0xd0, 0xbc, 0x30,
+        0xc0, 0x07, 0xa1, 0x78, 0x0e, 0xde, 0x9a, 0xe9, 0xb2, 0x69, 0xd7, 0xd8,
+        0x37, 0xde, 0xb7, 0x10, 0x03, 0x99, 0x4f, 0x3c, 0x33, 0xa0, 0xd3, 0x62,
+        0xd6, 0xa1, 0x2b, 0xf7, 0x2e, 0x1e, 0x1e, 0x55, 0x03, 0x00, 0x71, 0x64,
+        0x27, 0x0c, 0x58, 0x1b, 0xff, 0x22, 0x98, 0x10, 0xea, 0xaa, 0x94, 0x8e,
+        0xea, 0xe8, 0x2b, 0x9f, 0xc4, 0xbc, 0x51, 0x6f, 0x63, 0x97, 0x24, 0xf8,
+        0xca, 0x2b, 0x10, 0x3d, 0x54, 0xc8, 0x31, 0x75, 0x06, 0x53, 0xb6, 0xc0,
+        0xe0, 0xa4, 0x57, 0xea, 0x42, 0xa3, 0xaa, 0x72, 0x44, 0xfa, 0x7a, 0x49,
+        0xbf, 0x0d, 0xdc, 0x20, 0x57, 0x55, 0xa5, 0xc7, 0xbe, 0xee, 0xa7, 0x8c,
+        0xba, 0x3c, 0xb2, 0xc2, 0x4d, 0x67, 0x97, 0x7b, 0xbc, 0xe8, 0x4b, 0x4a,
+        0x49, 0x40, 0x74, 0xdd, 0xf8, 0x6b, 0x64, 0xd7, 0x99, 0x1c, 0x57, 0x57,
+        0x85, 0x1a, 0x1b, 0x45, 0x32, 0x72, 0xd4, 0xdd, 0xa9, 0x66, 0xf7, 0x62,
+        0x9a, 0x1a, 0x7f, 0xc0, 0x65, 0x67, 0x63, 0x24, 0xf8, 0x5b, 0x68, 0x01,
+        0x04, 0x69, 0xa9, 0xf5, 0x0a, 0xc6, 0x2d, 0x28, 0x6e, 0xde, 0x14, 0xb7,
+        0x81, 0x75, 0xc2, 0x8e, 0x97, 0x79, 0xff, 0xec, 0xcc, 0xd5, 0xcf, 0x88,
+        0x48, 0x10, 0x50, 0xd6, 0xac, 0xa0, 0xfd, 0x8f, 0x64, 0xc8, 0x80, 0x09,
+        0x07, 0x24, 0x29, 0xba, 0x3e, 0x02, 0x89, 0x80, 0x3e, 0x76, 0x14, 0xfd,
+        0xba, 0xec, 0xc2, 0x80, 0x94, 0x0a, 0xe6, 0x3a, 0x78, 0xf6, 0xb1, 0x63,
+        0xb7, 0x3b, 0x98, 0x78, 0xa4, 0xf2, 0x99, 0x42, 0xc2, 0x1b, 0x36, 0x55,
+        0xe8, 0xce, 0x26, 0x17, 0x40, 0xd3, 0xf7, 0x63, 0xdc, 0x4e, 0x82, 0x36,
+        0xf7, 0xdf, 0xb4, 0xd3, 0x0a, 0x13, 0x80, 0x00, 0x69, 0xc5, 0x07, 0xba,
+        0xa2, 0x05, 0x9d, 0x2c, 0xac, 0x9b, 0xc7, 0xc6, 0xb7, 0x89, 0x93, 0x06,
+        0x65, 0x77, 0xc1, 0x84, 0x56, 0xbf, 0x41, 0xc6, 0x7b, 0x99, 0x31, 0xc6,
+        0xa6, 0x74, 0x99, 0xef, 0xfb, 0x8d, 0x20, 0xf2, 0x42, 0xaa, 0xd9, 0xb1,
+        0x22, 0x13, 0x76, 0xb8, 0xfa, 0xe1, 0x73, 0x66, 0x85, 0xc2, 0x57, 0xee,
+        0x1e, 0x1f, 0x9e, 0x31, 0xb0, 0x7a, 0x87, 0xd0, 0x15, 0x32, 0x5c, 0x4d,
+        0xf6, 0x3e, 0x8d, 0x3f, 0xfa, 0x14, 0x1e, 0x6e, 0xcb, 0x0b, 0x95, 0x48,
+        0x75, 0x82, 0xb0, 0xe5, 0x98, 0x43, 0xbe, 0x98, 0x34, 0x92, 0x9a, 0xb2,
+        0x16, 0x41, 0x8a, 0xa9, 0x97, 0x63, 0x0c, 0x9d, 0x47, 0x1a, 0x03, 0x8d,
+        0x25, 0x94, 0xa0, 0x68, 0xe9, 0xd7, 0x8c, 0x62, 0x1e, 0xb1, 0x6c, 0x60,
+        0xf7, 0xe0, 0x50, 0x60, 0xcd, 0x43, 0x36, 0x4c, 0x50, 0xa7, 0xc9, 0x5c,
+        0x79, 0xf8, 0x8d, 0x2a, 0x1c, 0x66, 0x90, 0x45, 0x84, 0x4d, 0x41, 0x92,
+        0xa5, 0x2f, 0xa4, 0x54, 0xc7, 0xa6, 0x00, 0xa1, 0x37, 0xc3, 0x4c, 0xf2,
+        0x3f, 0xa1, 0x33, 0x8a, 0xdf, 0xd8, 0xce, 0xb7, 0x67, 0x49, 0xf2, 0xd2,
+        0xc9, 0x07, 0xcd, 0x75, 0xdf, 0xfe, 0x9c, 0x11, 0xef, 0x51, 0x42, 0xe8,
+        0xeb, 0x8c, 0x75, 0xfc, 0x33, 0xca, 0x1c, 0x34, 0xce, 0x61, 0xb6, 0xae,
+        0x80, 0xf5, 0x79, 0x0f, 0x96, 0xf4, 0x94, 0x09, 0xd5, 0xdd, 0x1f, 0x2e,
+        0x01, 0xa5, 0xa3, 0x78, 0x8e, 0xeb, 0x2f, 0x2b, 0x2f, 0x03, 0xb2, 0x0f,
+        0xe6, 0xeb, 0x93, 0x07, 0x40, 0x9b, 0x4a, 0x43, 0xd6, 0xd6, 0xcb, 0x3f,
+        0x09, 0x8a, 0x4d, 0xbc, 0xc4, 0xe5, 0xff, 0xd9, 0x6a, 0x71, 0x51, 0xd0,
+        0xaa, 0x46, 0xc5, 0x78, 0x3f, 0xf8, 0xfe, 0xc3, 0xe1, 0x98, 0xaa, 0xce,
+        0x83, 0x02, 0x46, 0x1e, 0x2a, 0x76, 0xde, 0xc1, 0xad, 0x81, 0x9e, 0x14,
+        0x2d, 0xb0, 0x3d, 0x04, 0x98, 0x51, 0x00, 0xd1, 0x1f, 0x34, 0xb3, 0xe4,
+        0xd5, 0xa3, 0x1a, 0x57, 0xd4, 0x39, 0x44, 0xfc, 0xbf, 0xc8, 0x62, 0x4a,
+        0x69, 0x6b, 0x3c, 0x2d, 0x1b, 0xfc, 0x7a, 0x1b, 0x49, 0x6b, 0xc4, 0x60,
+        0xb4, 0x89, 0xc6, 0x76, 0x66, 0xa0, 0xb5, 0x4d, 0xf4, 0x50, 0x2c, 0xf7,
+        0xdb, 0x9a, 0x22, 0x96, 0x0e, 0x1a, 0xb3, 0xc5, 0x63, 0xd2, 0x0b, 0x5b,
+        0xcc, 0x60, 0xaa, 0xed, 0x49, 0xd9, 0x8b, 0xc6, 0x9f, 0x47, 0xf0, 0x96,
+        0xa8, 0x46, 0xca, 0x92, 0x96, 0x45, 0x31, 0x87, 0xd8, 0x71, 0xc4, 0x1b,
+        0x3d, 0x07, 0x5b, 0x64, 0x70, 0x0d, 0x84, 0x49, 0x09, 0x39, 0x36, 0x29,
+        0xf4, 0x29, 0xee, 0xc2, 0x48, 0x15, 0x97, 0xf5, 0x3c, 0xc5, 0x34, 0x4b,
+        0x19, 0x31, 0x2a, 0x46, 0x5b, 0xde, 0xdd, 0xe0, 0x36, 0x6d, 0x67, 0x1b,
+        0xbc, 0x00, 0x08, 0x7b, 0x6c, 0x8b, 0xda, 0xd0, 0x2c, 0x8d, 0xbe, 0x9b,
+        0x14, 0x82, 0xcf, 0xe3, 0x9c, 0x85, 0xe7, 0xeb, 0x6c, 0x15, 0xfb, 0x8c,
+        0xb1, 0x8c, 0x1f, 0x92, 0x75, 0x2b, 0x75, 0x08, 0xc4, 0x6f, 0x2e, 0xf4,
+        0x45, 0xee, 0x92, 0x17, 0x4c, 0xe3, 0x7e, 0xf0, 0xbc, 0x90, 0x4f, 0x5f,
+        0xc4, 0x23, 0x70, 0x26, 0x65, 0x9b, 0x97, 0xab, 0x68, 0x91, 0x06, 0x3d,
+        0x41, 0x81, 0x76, 0x66, 0xa4, 0x48, 0x09, 0x96, 0xb6, 0x8b, 0x3c, 0xda,
+        0xd3, 0x19, 0x07, 0x1d, 0x62, 0xf5, 0x9c, 0x57, 0xcb, 0xcd, 0x50, 0x6a,
+        0x23, 0xac, 0x5d, 0x35, 0x1a, 0x07, 0x8b, 0xda, 0xca, 0x89, 0x04, 0x8a,
+        0x59, 0x06, 0x46, 0x1a, 0xf4, 0x6e, 0x3e, 0xb7, 0x20, 0xa7, 0xc4, 0xda,
+        0xea, 0x3b, 0x9e, 0xf3, 0x63, 0xfa, 0x33, 0xc4, 0x76, 0xc3, 0x04, 0x31,
+        0xc3, 0x63, 0x40, 0x70, 0x0e, 0x85, 0x9d, 0xc5, 0x5f, 0xda, 0xe9, 0x3c,
+        0x33, 0xd2, 0x4e, 0x4c, 0xdc, 0xef, 0x11, 0xc8, 0x46, 0x28, 0x95, 0x24,
+        0xdb, 0x1a, 0xfe, 0xe8, 0xda, 0x96, 0x82, 0x87, 0x59, 0x92, 0x15, 0x4d,
+        0x4b, 0xd5, 0x9a, 0x55, 0x15, 0x8b, 0x87, 0xea, 0x5f, 0xe7, 0xad, 0xc5,
+        0x89, 0xd9, 0x40, 0xe8, 0x01, 0x70, 0x33, 0x03, 0x59, 0xb7, 0x4c, 0x52,
+        0x75, 0x3c, 0x76, 0x58, 0xe1, 0xae, 0x4a, 0x41, 0x69, 0x00, 0xce, 0x6a,
+        0xbd, 0x1c, 0x62, 0x9e, 0x8b, 0xbd, 0xf5, 0xeb, 0x30, 0x2a, 0xf5, 0x87,
+        0xae, 0x90, 0x45, 0xf5, 0x32, 0xd5, 0x98, 0x55, 0xc3, 0x0a, 0x16, 0x9e,
+        0x2c, 0xaf, 0xa5, 0x53, 0x52, 0xe0, 0x63, 0xfe, 0x3a, 0x14, 0x94, 0x09,
+        0xb1, 0x57, 0x22, 0x01, 0x6f, 0x88, 0x90, 0x3f, 0xb4, 0xed, 0xea, 0x7d,
+        0xe3, 0xd6, 0x00, 0x23, 0xfd, 0x2f, 0xe1, 0x5a, 0x30, 0xbc, 0x47, 0xb9,
+        0xbf, 0xa9, 0xd7, 0x1a, 0x7b, 0xae, 0xb8, 0x9b, 0xd1, 0x8f, 0x8a, 0xca,
+        0xc0, 0xd4, 0x3b, 0xd8, 0x80, 0x55, 0xcd, 0xd5, 0x5a, 0x7c, 0x87, 0x8f,
+        0xca, 0xe5, 0x53, 0x77, 0xa6, 0x08, 0x6c, 0xfe, 0x93, 0xdf, 0x29, 0xae,
+        0xc1, 0x6c, 0xf3, 0xe7, 0xc0, 0x1a, 0xdb, 0xbf, 0x98, 0xc9, 0x50, 0xaf,
+        0xa1, 0x9d, 0x35, 0x88, 0x1e, 0xdf, 0xf4, 0xbb, 0xfb, 0xd1, 0xc8, 0xb6,
+        0x74, 0x8b, 0xba, 0x44, 0x42, 0x94, 0xf4, 0x17, 0xe3, 0xf8, 0xf7, 0x53,
+        0x03, 0x29, 0x4f, 0xc7, 0x6d, 0x81, 0x75, 0xf3, 0xf2, 0x9f, 0xf5, 0x0d,
+        0xa7, 0xa6, 0x6f, 0x55, 0xa0, 0xc0, 0x40, 0xc9, 0xfb, 0x90, 0x65, 0xf2,
+        0x83, 0xb5, 0xc6, 0x29, 0x6e, 0x4f, 0xee, 0x14, 0x20, 0x71, 0xf9, 0x5e,
+        0xac, 0xd0, 0x44, 0x5c, 0x62, 0x48, 0x61, 0xc9, 0x82, 0xe4, 0x62, 0xb7,
+        0xd0, 0xa9, 0x94, 0x67, 0x8b, 0xc3, 0x35, 0xdb, 0x5a, 0x46, 0xb1, 0x76,
+        0x47, 0x20, 0x58, 0x4b, 0x8d, 0x8e, 0x5b, 0x2d, 0xfa, 0xf7, 0x46, 0x71,
+        0xf0, 0xb0, 0x41, 0x0f, 0x50, 0xe9, 0xbd, 0xb1, 0x65, 0xe8, 0xe7, 0x23,
+        0x4d, 0xe5, 0xfa, 0xe1, 0x1a, 0x06, 0xc9, 0xb5, 0xf9, 0xf0, 0x80, 0x74,
+        0x4c, 0xc4, 0x16, 0x48, 0x3a, 0x22, 0x43, 0x6e, 0x1d, 0x94, 0xa6, 0xb8,
+        0x2a, 0x35, 0x55, 0x80, 0xd3, 0x17, 0xb2, 0xc2, 0x00, 0xee, 0xa5, 0x52,
+        0xe0, 0xef, 0x9a, 0x99, 0xb4, 0x17, 0x4a, 0x79, 0x18, 0x6e, 0xd5, 0xe8,
+        0x85, 0x36, 0x0d, 0xf5, 0x08, 0x63, 0xac, 0xe8, 0xca, 0xa1, 0x8c, 0x05,
+        0x87, 0xa0, 0x73, 0xc4, 0x22, 0xb1, 0x4c, 0x9a, 0xe5, 0xe4, 0x3b, 0x98,
+        0xa2, 0x03, 0x2e, 0x77, 0x50, 0x6b, 0xd8, 0x54, 0x33, 0x11, 0xe2, 0xff,
+        0xbe, 0xf3, 0x27, 0xe7, 0xf0, 0xc6, 0x45, 0x2e, 0x7a, 0xbe, 0xb8, 0xcd,
+        0xac, 0x7e, 0x76, 0xf7, 0xb8, 0x90, 0x5d, 0xb6, 0x15, 0xf6, 0xe8, 0xce,
+        0xa0, 0xac, 0x7a, 0x0f, 0x19, 0x34, 0x35, 0xe7, 0xb5, 0x49, 0x68, 0x1b,
+        0x06, 0x05, 0x0a, 0xdf, 0x91, 0x5b, 0xd2, 0x3b, 0x1c, 0x9b, 0x65, 0x47,
+        0x58, 0x0c, 0x17, 0xe2, 0x1e, 0x4d, 0x66, 0x92, 0x1f, 0xb7, 0x73, 0xe4,
+        0x93, 0xae, 0xbb, 0xdf, 0xd6, 0x74, 0xf9, 0xda, 0x7b, 0x1b, 0xae, 0xae,
+        0xa8, 0x97, 0x49, 0x81, 0x32, 0xa4, 0x6b, 0x6a, 0x41, 0xdf, 0x57, 0x20,
+        0x3d, 0x8b, 0x13, 0xad, 0x79, 0xd0, 0x94, 0x29, 0x0e, 0x07, 0x2f, 0x32,
+        0x88, 0xec, 0x72, 0x68, 0x0d, 0x6d, 0xd5, 0x57, 0x28, 0x97, 0xfb, 0x41,
+        0xa7, 0xc7, 0x9f, 0x38, 0xcc, 0x4c, 0x3c, 0x0f, 0xb7, 0x46, 0x66, 0x47,
+        0x6c, 0xa1, 0x2c, 0x47, 0xf6, 0x96, 0xf0, 0xe7, 0xfb, 0x92, 0x1c, 0x96,
+        0xd0, 0x01, 0xba, 0x8b, 0xa7, 0x7e, 0xad, 0x0f, 0x8f, 0xa3, 0x34, 0x9e,
+        0x86, 0x86, 0xa1, 0x66, 0x8d, 0x98, 0x6e, 0x32, 0xa9, 0x4c, 0xf9, 0x28,
+        0xcb, 0x1f, 0x1f, 0x97, 0x74, 0x9d, 0x3d, 0xd6, 0xaa, 0x0c, 0x34, 0x02,
+        0xa8, 0x3a, 0xa7, 0xa4, 0x66, 0xbf, 0x9a, 0xdc, 0xc0, 0x5f, 0x9c, 0x38,
+        0xa9, 0xe0, 0x3c, 0x07, 0xfa, 0xc4, 0xac, 0xc7, 0x2d, 0xa7, 0xe0, 0x59,
+        0x1f, 0xda, 0xde, 0xaa, 0xd2, 0x22, 0x64, 0x51, 0x23, 0xaa, 0x7b, 0x48,
+        0xb7, 0x70, 0x62, 0x11, 0x38, 0x41, 0x17, 0xe7, 0xf8, 0xf5, 0x8e, 0x3e,
+        0xb8, 0x52, 0x8c, 0x66, 0x70, 0x22, 0x7e, 0x56, 0x22, 0xea, 0x67, 0xd0,
+        0xc2, 0x48, 0x29, 0xb7, 0xb5, 0xe9, 0x22, 0x82, 0x30, 0x12, 0x28, 0x6d,
+        0x28, 0xdb, 0x88, 0x73, 0xee, 0xe6, 0x90, 0x9e, 0x5a, 0xa0, 0x6d, 0xa4,
+        0xf7, 0x0f, 0xe4, 0xb2, 0x8f, 0x34, 0x42, 0x74, 0xa3, 0x21, 0x6d, 0x26,
+        0x06, 0x94, 0xc1, 0xac, 0xd5, 0x6c, 0x42, 0xb4, 0x67, 0xdd, 0xab, 0xc8,
+        0xdd, 0x67, 0x1b, 0x29, 0x02, 0x0d, 0xb6, 0x84, 0x1d, 0x1b
+    },
+    .commitments = {
+        { 0x31, 0x11, 0xbe, 0x48, 0x8a, 0xfc, 0x50, 0x4c, 0x11, 0xaf, 0x2d, 0xfb, 0x35, 0xda, 0x93, 0x2f, 0x65, 0x72, 0xee, 0xcd, 0x19, 0xa6, 0xc8, 0x54, 0x09, 0x5b, 0x01, 0x68, 0x30, 0x88, 0xe8, 0x25 },
+        { 0x6f, 0x01, 0x84, 0x37, 0xde, 0x72, 0x2d, 0xa9, 0xa9, 0x88, 0x1c, 0x6d, 0x17, 0x6f, 0xf4, 0x19, 0x60, 0x84, 0x4e, 0x6e, 0x0a, 0x3a, 0xd6, 0xcf, 0x8e, 0xdb, 0x6a, 0xf4, 0xf1, 0xc2, 0x8a, 0x34 },
+        { 0x44, 0xc3, 0xb9, 0x59, 0xf9, 0xe5, 0x08, 0x0d, 0xfd, 0x55, 0x0a, 0x84, 0x82, 0x58, 0x34, 0xfb, 0x39, 0x2b, 0x6e, 0xe6, 0x61, 0xf8, 0x9b, 0x2b, 0xfb, 0xa5, 0xfb, 0x45, 0x44, 0x4e, 0x67, 0x3a },
+        { 0x5e, 0xc3, 0x6d, 0xce, 0xb0, 0xa0, 0xb1, 0xf8, 0x1e, 0x3f, 0x16, 0x72, 0x49, 0x91, 0x78, 0x1f, 0xae, 0xfa, 0x68, 0x38, 0x24, 0xe7, 0x4e, 0x81, 0x20, 0xf7, 0x46, 0x53, 0x08, 0xe9, 0xd9, 0x21 },
+        { 0x9c, 0x35, 0xf2, 0x03, 0x20, 0x36, 0x09, 0x92, 0xf6, 0xa8, 0x8a, 0xa5, 0xc8, 0x70, 0xcd, 0xb5, 0x9c, 0x45, 0x97, 0xfe, 0x08, 0xfb, 0xf8, 0xe1, 0xf3, 0xb2, 0x14, 0x73, 0x3d, 0x89, 0x23, 0x2a },
+    },
+    .anchor = {
+        0xf2, 0x49, 0x6f, 0x72, 0xdd, 0x17, 0xc3, 0x1b, 0xd9, 0x42, 0x83, 0x32,
+        0xf4, 0xc0, 0x4f, 0x01, 0xd5, 0xd4, 0x7f, 0xc4, 0xf5, 0x8a, 0x8b, 0xa3,
+        0x65, 0xe8, 0x7b, 0xad, 0x50, 0x1a, 0x46, 0x10
+    }
+},
+{
+    .bundle = {
+        0x05, 0x4a, 0x6c, 0xd0, 0x4a, 0x95, 0xe8, 0x75, 0xe8, 0x4a, 0x72, 0x47,
+        0x6a, 0xf5, 0xed, 0xc4, 0x4d, 0xf8, 0x5c, 0xd4, 0x38, 0xd8, 0xa3, 0x43,
+        0x00, 0x78, 0x95, 0x3e, 0x6d, 0x18, 0x10, 0x82, 0xa9, 0x8c, 0x1b, 0x88,
+        0xcb, 0x01, 0xe8, 0x56, 0xfa, 0x38, 0xef, 0xcd, 0x55, 0xfe, 0x3b, 0xce,
+        0xd0, 0x0f, 0xdf, 0xe9, 0x19, 0x26, 0x92, 0xa4, 0x8c, 0xd9, 0xc1, 0x79,
+        0x5c, 0x5d, 0xa8, 0xe4, 0x34, 0x32, 0xa8, 0x99, 0xb5, 0xc1, 0x0d, 0x3f,
+        0x35, 0x21, 0x6e, 0x03, 0xa9, 0xbe, 0xbb, 0x4e, 0x21, 0xe5, 0x59, 0x75,
+        0x3b, 0x77, 0x67, 0xcf, 0xe6, 0x72, 0x98, 0x93, 0x72, 0x59, 0xc7, 0x3f,
+        0x93, 0xca, 0x38, 0x0a, 0x17, 0xb6, 0xa0, 0xf2, 0x4e, 0xf0, 0x6d, 0x13,
+        0x9b, 0xaa, 0x1b, 0x70, 0xe6, 0x78, 0xa7, 0x3d, 0x0e, 0x65, 0x78, 0x58,
+        0x04, 0xd8, 0x8c, 0x96, 0x6a, 0xcf, 0x10, 0x37, 0x38, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x04, 0x74, 0xd9, 0x15, 0xad, 0xf4, 0x91,
+        0x1d, 0x9f, 0xc7, 0xa8, 0xc8, 0xef, 0x0a, 0x85, 0xfc, 0x8d, 0x95, 0x07,
+        0x8d, 0x2b, 0x80, 0x7d, 0xd2, 0xd0, 0xe7, 0x74, 0x47, 0x95, 0x56, 0xe4,
+        0xa8, 0x9e, 0x70, 0x7e, 0x8c, 0x29, 0x96, 0x7e, 0x03, 0x5d, 0xc6, 0x56,
+        0x62, 0x3b, 0xee, 0x84, 0xb8, 0x73, 0x0c, 0x1b, 0x63, 0x15, 0xea, 0x11,
+        0x3f, 0x13, 0x0d, 0x58, 0xaf, 0x9d, 0x94, 0xab, 0x1e, 0x8d, 0x28, 0x15,
+        0x29, 0x49, 0x34, 0x84, 0x1b, 0x8c, 0xc3, 0xb9, 0xf8, 0xec, 0x57, 0x52,
+        0xa6, 0xa0, 0xd0, 0xbc, 0x52, 0x71, 0x4c, 0x73, 0xdb, 0x78, 0xf0, 0x65,
+        0x11, 0x68, 0x4e, 0xc4, 0x39, 0xfe, 0xca, 0x8d, 0xf1, 0xc0, 0x4c, 0xda,
+        0x0c, 0xfc, 0xdc, 0x23, 0x4c, 0x17, 0x14, 0x71, 0xdf, 0x7a, 0xad, 0x90,
+        0xac, 0x9e, 0x28, 0x64, 0xb6, 0xe1, 0xbe, 0x0d, 0xfc, 0x6a, 0x40, 0x41,
+        0x23, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xb9, 0xc6, 0x92,
+        0xf0, 0x47, 0x05, 0xb2, 0x67, 0xf5, 0x74, 0xc8, 0x8b, 0x91, 0x1f, 0xd5,
+        0xd8, 0xc8, 0xb1, 0xe6, 0x55, 0xf3, 0xbe, 0x8f, 0x7d, 0x91, 0x8f, 0x61,
+        0x96, 0x9c, 0x71, 0x18, 0x0f, 0x38, 0xb5, 0x86, 0x3c, 0x0c, 0xa2, 0x3b,
+        0x29, 0xd7, 0x04, 0x4d, 0xee, 0x2b, 0x05, 0x59, 0xc1, 0xd5, 0x99, 0x5c,
+        0x13, 0xce, 0x7a, 0xc1, 0x73, 0x27, 0x17, 0x2d, 0xfc, 0xa4, 0x41, 0x48,
+        0x1d, 0x31, 0x64, 0xc3, 0x65, 0x8f, 0x58, 0x40, 0xe4, 0x13, 0x3f, 0x50,
+        0x53, 0x59, 0xf4, 0x3e, 0x2f, 0x56, 0xd9, 0xbe, 0xcb, 0x56, 0x91, 0xb2,
+        0x53, 0x78, 0x43, 0x3a, 0x33, 0x23, 0x5c, 0x23, 0x91, 0x83, 0x7d, 0x8d,
+        0xc9, 0xa8, 0x99, 0x1c, 0x17, 0x8d, 0x65, 0x02, 0x85, 0x0c, 0x1f, 0x91,
+        0xb1, 0xd4, 0x1a, 0x97, 0x3e, 0xf5, 0xa9, 0xec, 0x4b, 0x10, 0xbf, 0x46,
+        0x24, 0x67, 0xa7, 0xd4, 0x21, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x19, 0x7f, 0x13, 0x95, 0x5e, 0xbc, 0x85, 0x78, 0x1d, 0x1a, 0x97,
+        0x1c, 0x3d, 0x4b, 0xad, 0xc5, 0x43, 0x47, 0xb8, 0x8f, 0x4d, 0xe0, 0x80,
+        0x19, 0xb7, 0x2e, 0x06, 0xdb, 0xbd, 0x26, 0xaa, 0x31, 0xf2, 0x55, 0xf2,
+        0x99, 0x2d, 0x7b, 0x15, 0x92, 0x73, 0x4f, 0x1d, 0xe2, 0x4a, 0x43, 0xf0,
+        0x9c, 0x75, 0x1d, 0xb6, 0x4c, 0xac, 0x84, 0xd0, 0x72, 0x46, 0xef, 0x03,
+        0x83, 0x5d, 0xbe, 0xd4, 0x2d, 0x6c, 0x47, 0x14, 0xbc, 0xf4, 0x5d, 0xbe,
+        0xff, 0xc3, 0xf7, 0x86, 0x05, 0xa1, 0x75, 0x8f, 0xbe, 0xf2, 0xeb, 0x6a,
+        0x10, 0xb1, 0xc7, 0xb5, 0xab, 0xec, 0x18, 0x91, 0x74, 0x6e, 0xb6, 0xb0,
+        0xb3, 0xb6, 0x7b, 0xf5, 0x11, 0x92, 0xe3, 0x0e, 0x8b, 0x39, 0x9c, 0xed,
+        0xef, 0xd8, 0xb6, 0x4f, 0x23, 0x86, 0xad, 0x1c, 0xac, 0x70, 0xbd, 0xcc,
+        0xd7, 0xca, 0xc1, 0x95, 0x1a, 0x3e, 0x86, 0xb5, 0x37, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0xa4, 0xe1, 0x63, 0xb5, 0xe0, 0x93, 0x90,
+        0x5d, 0x57, 0x66, 0x7d, 0x83, 0xd9, 0xc1, 0x22, 0xe9, 0x1a, 0xff, 0xc8,
+        0x46, 0xc6, 0x16, 0xb9, 0x0d, 0x85, 0x7f, 0x94, 0x28, 0xf7, 0x2c, 0x6e,
+        0x1a, 0x14, 0x54, 0x53, 0x2b, 0xb4, 0x58, 0x31, 0xdb, 0x04, 0xe8, 0x79,
+        0x48, 0x87, 0xa3, 0x36, 0x68, 0x94, 0x4c, 0x96, 0x39, 0xf6, 0xdc, 0xcf,
+        0x01, 0xdd, 0x5f, 0x9a, 0x3b, 0x24, 0x28, 0x46, 0x37, 0xb5, 0x0b, 0x1a,
+        0x9b, 0x9b, 0x4f, 0x5d, 0xc7, 0x87, 0x8e, 0xcd, 0x6d, 0x4b, 0x25, 0x82,
+        0x15, 0x14, 0xa4, 0x64, 0xaa, 0x8a, 0xc9, 0x32, 0xf9, 0x33, 0x1a, 0xb4,
+        0xf1, 0x33, 0x4d, 0x7f, 0x85, 0xce, 0x62, 0x6d, 0x31, 0x28, 0xca, 0x6c,
+        0x8f, 0xd2, 0x72, 0x21, 0x59, 0x12, 0xde, 0x64, 0xfb, 0x74, 0xc4, 0x5d,
+        0x56, 0xf4, 0x37, 0x4c, 0xe5, 0xbf, 0x05, 0x37, 0xee, 0x2e, 0x38, 0x20,
+        0x07, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x41, 0x71,
+        0x8f, 0xcb, 0xcb, 0x66, 0xfb, 0xff, 0xe7, 0x71, 0x79, 0x31, 0xb4, 0x6d,
+        0x57, 0x0b, 0xfc, 0xbf, 0x7b, 0xbe, 0x71, 0xff, 0x6d, 0xee, 0x38, 0x83,
+        0x32, 0x52, 0xd1, 0xb8, 0xd0, 0x3a, 0x38, 0x5b, 0xc9, 0x62, 0x4d, 0x41,
+        0x4e, 0x30, 0xfd, 0xb5, 0x07, 0xd6, 0xed, 0x23, 0x3b, 0xb7, 0x94, 0x85,
+        0xdf, 0xc2, 0x11, 0xfa, 0x87, 0xc0, 0xd5, 0x9a, 0x00, 0xa1, 0xd1, 0x42,
+        0xe0, 0x4f, 0x59, 0x0d, 0x3c, 0xbe, 0x1a, 0xd0, 0x23, 0x35, 0x39, 0xac,
+        0x78, 0xf4, 0xe9, 0x91, 0xce, 0x34, 0x74, 0xcc, 0x2f, 0xe3, 0xfe, 0xfc,
+        0xad, 0xfc, 0xec, 0x2e, 0x2c, 0x7e, 0x20, 0x37, 0xcd, 0xed, 0x35, 0x03,
+        0x39, 0xa6, 0xc5, 0x28, 0x3b, 0x4b, 0x07, 0x52, 0xc9, 0x3c, 0xf2, 0x3c,
+        0xe5, 0x75, 0x07, 0x1b, 0x04, 0x04, 0x56, 0x3c, 0x21, 0x70, 0x1a, 0xb0,
+        0xf1, 0xab, 0xc8, 0xcc, 0x45, 0xb8, 0xda, 0x5c, 0xd1, 0xea, 0xd8, 0x01,
+        0xe2, 0x57, 0xd9, 0xb9, 0xb2, 0xec, 0x14, 0x95, 0xe9, 0xa8, 0x08, 0x02,
+        0x97, 0x50, 0xcd, 0x17, 0x7c, 0x0d, 0xbd, 0x0d, 0x32, 0xf9, 0x41, 0xbe,
+        0x6f, 0x8f, 0x6f, 0x32, 0xc2, 0x12, 0xc2, 0xdd, 0x59, 0xef, 0xe7, 0x89,
+        0x79, 0x6f, 0xd1, 0xd2, 0x28, 0x98, 0xe3, 0x68, 0xfc, 0xd2, 0x79, 0x3c,
+        0x67, 0x80, 0x82, 0xa8, 0x31, 0xd6, 0x0e, 0x50, 0x9e, 0x51, 0x0e, 0x7e,
+        0xa4, 0x12, 0x15, 0xbd, 0x3e, 0xbe, 0xf8, 0x34, 0xb1, 0xed, 0x56, 0x6c,
+        0x3d, 0x94, 0x56, 0x79, 0x22, 0x56, 0xc6, 0x80, 0xc5, 0x2c, 0x1b, 0x33,
+        0xf4, 0x3c, 0xc7, 0x86, 0xe2, 0x58, 0x9f, 0xe4, 0x4c, 0xea, 0x4d, 0x6b,
+        0x69, 0x38, 0xf2, 0x9b, 0x4a, 0xa3, 0x11, 0xe7, 0x92, 0xee, 0x89, 0x1a,
+        0xd5, 0x52, 0x31, 0xb4, 0x36, 0xba, 0xbe, 0xc0, 0x2a, 0xe4, 0x8b, 0x78,
+        0xe0, 0xb7, 0x06, 0x7e, 0x34, 0xf5, 0x4c, 0xfe, 0xa5, 0x69, 0xdf, 0x7d,
+        0x0a, 0x67, 0x65, 0x9b, 0x05, 0x38, 0x8b, 0xa7, 0x8b, 0x51, 0x4a, 0x84,
+        0xdf, 0xff, 0xac, 0x4b, 0x49, 0xca, 0x52, 0x56, 0xf0, 0x6a, 0x5a, 0x33,
+        0xc1, 0x49, 0x38, 0x9d, 0x78, 0x7e, 0x92, 0x57, 0x80, 0xce, 0xcf, 0x7a,
+        0x30, 0x6a, 0xa5, 0xc8, 0xc8, 0xc7, 0x35, 0x39, 0xdc, 0x66, 0x50, 0xd4,
+        0x8f, 0x72, 0x87, 0x98, 0xc9, 0x19, 0xe6, 0xd6, 0x51, 0x56, 0xa8, 0x21,
+        0xfe, 0xb4, 0x5c, 0x84, 0x9d, 0xab, 0xbf, 0x13, 0x01, 0xab, 0x63, 0x40,
+        0x41, 0x12, 0x42, 0x84, 0xe2, 0xb5, 0x9d, 0x7f, 0xf2, 0x50, 0x1f, 0x32,
+        0xd0, 0x06, 0x2b, 0xda, 0xb9, 0x79, 0xaf, 0xf9, 0xf7, 0x8d, 0x1e, 0x45,
+        0x50, 0xca, 0x87, 0xd2, 0xbc, 0xcc, 0x02, 0x67, 0xd9, 0xd5, 0xc2, 0x7f,
+        0x22, 0x5d, 0x4b, 0xa4, 0xf7, 0xb9, 0xbd, 0xaf, 0xe9, 0xe1, 0x3a, 0xf8,
+        0xd6, 0x2a, 0xda, 0xb5, 0xc4, 0x74, 0x8d, 0x29, 0x72, 0x88, 0xdb, 0x6c,
+        0x49, 0x6c, 0xaf, 0x02, 0x37, 0xaa, 0xd7, 0xc0, 0x16, 0x44, 0x45, 0x68,
+        0xf7, 0xd9, 0xc2, 0x18, 0xb8, 0xb7, 0x30, 0xdb, 0x98, 0x91, 0x80, 0xdf,
+        0xc7, 0x24, 0x58, 0x1b, 0x3b, 0x8d, 0xe9, 0x6d, 0xb4, 0x0a, 0xcf, 0xbd,
+        0xb6, 0x78, 0x5b, 0x12, 0x86, 0xb1, 0x93, 0xeb, 0xb5, 0x11, 0xa6, 0x97,
+        0x53, 0xb2, 0xe8, 0x43, 0x42, 0xae, 0x8f, 0x8e, 0xd8, 0xb6, 0x55, 0x11,
+        0x43, 0x43, 0x52, 0xde, 0x1f, 0x28, 0xc4, 0x3d, 0x30, 0xd3, 0x9e, 0x51,
+        0x0a, 0x4a, 0xd7, 0x0f, 0x2d, 0x58, 0x37, 0x99, 0x5c, 0xa3, 0x96, 0x50,
+        0x42, 0x94, 0xc2, 0xef, 0xb7, 0x2a, 0x4e, 0xe2, 0x75, 0xd2, 0x0d, 0x84,
+        0x15, 0xee, 0xea, 0x3e, 0x87, 0xd7, 0xf4, 0x86, 0x4b, 0xd9, 0x9d, 0x55,
+        0xa9, 0x0e, 0x95, 0xc2, 0x38, 0x43, 0x4e, 0x85, 0x07, 0xe9, 0x55, 0xea,
+        0xc4, 0x77, 0x11, 0x68, 0x72, 0x8a, 0xe7, 0x5e, 0xda, 0xc4, 0x52, 0xaa,
+        0xeb, 0xab, 0xf1, 0x57, 0x47, 0x4d, 0x6a, 0xf6, 0xfa, 0x89, 0xee, 0xaf,
+        0x31, 0xec, 0x6d, 0x6e, 0x37, 0x44, 0xa4, 0xf2, 0xc3, 0xa1, 0x8b, 0xaa,
+        0xb4, 0x0f, 0x0e, 0x56, 0xcd, 0xaf, 0xde, 0x4c, 0x6f, 0x1f, 0xcf, 0xc3,
+        0x74, 0x75, 0x1d, 0x63, 0x9b, 0x42, 0x9d, 0x2a, 0xfd, 0x21, 0xd4, 0x50,
+        0x2b, 0x78, 0xc6, 0x43, 0x23, 0x96, 0x68, 0x36, 0xc1, 0x99, 0x9b, 0xc1,
+        0x14, 0x53, 0x39, 0xe7, 0xba, 0x56, 0xd9, 0x92, 0x3c, 0x2a, 0x3b, 0x19,
+        0x06, 0x1a, 0xb0, 0x3e, 0xd2, 0x32, 0xab, 0x47, 0x9b, 0x83, 0xc7, 0x86,
+        0xdd, 0x48, 0x0b, 0x1d, 0xc0, 0x05, 0x8f, 0x96, 0xbf, 0x82, 0x47, 0xc3,
+        0xec, 0x44, 0x30, 0xad, 0xc5, 0xbf, 0x24, 0x5f, 0xef, 0x74, 0x64, 0xe6,
+        0x6e, 0x0c, 0xce, 0x85, 0x66, 0x52, 0x25, 0xbb, 0x24, 0xc9, 0x5e, 0xb9,
+        0x5b, 0x35, 0x31, 0x1a, 0xd4, 0x29, 0x92, 0xee, 0xc6, 0x77, 0x19, 0xb5,
+        0xeb, 0x19, 0xc0, 0x9c, 0x70, 0x16, 0x12, 0x7f, 0x6f, 0xe8, 0xf0, 0xc4,
+        0x2d, 0xdf, 0xb3, 0xdb, 0xd9, 0xcb, 0x60, 0xeb, 0xe1, 0xc6, 0x34, 0x37,
+        0xf2, 0xf4, 0x94, 0xbe, 0xc4, 0x04, 0xff, 0x5f, 0x9e, 0xf5, 0x49, 0x85,
+        0x9b, 0xe8, 0xdc, 0x98, 0x1e, 0x35, 0x0c, 0x45, 0x14, 0x13, 0xb7, 0x93,
+        0x89, 0xbd, 0x51, 0xb8, 0xa8, 0x59, 0x06, 0x3e, 0x34, 0x88, 0xa5, 0xd4,
+        0x07, 0x00, 0x23, 0xde, 0x67, 0xf7, 0xeb, 0xa8, 0x42, 0x61, 0x32, 0x72,
+        0x31, 0x25, 0xee, 0x7d, 0x51, 0xc9, 0x80, 0x1b, 0x8e, 0x01, 0xf0, 0x43,
+        0x27, 0x81, 0xed, 0x18, 0x49, 0xee, 0x65, 0x60, 0xa1, 0x2c, 0xa3, 0x47,
+        0x52, 0xc2, 0xa2, 0x19, 0x71, 0x82, 0xa7, 0xc2, 0xab, 0xf2, 0x01, 0xb9,
+        0x31, 0x81, 0x34, 0x87, 0x5c, 0x41, 0x33, 0x47, 0xba, 0xad, 0x60, 0xd2,
+        0x0c, 0xa2, 0xbd, 0xcc, 0xef, 0x92, 0xfd, 0x11, 0xa5, 0x23, 0x8a, 0xb7,
+        0x5a, 0x81, 0x9e, 0x06, 0xd8, 0x52, 0x51, 0xe2, 0xad, 0x41, 0x04, 0xb4,
+        0xdc, 0xbc, 0xd6, 0x93, 0x5f, 0xe2, 0x75, 0xf0, 0xc8, 0xfa, 0x91, 0x19,
+        0x72, 0x08, 0x7b, 0xed, 0x92, 0x84, 0x1b, 0xae, 0x17, 0x8f, 0xc0, 0x8c,
+        0x84, 0x07, 0x3c, 0x7c, 0x59, 0x96, 0x61, 0xf3, 0x0c, 0xd1, 0xf6, 0x10,
+        0x78, 0x4f, 0xd4, 0xcd, 0x3d, 0x85, 0x6e, 0x69, 0x72, 0x8b, 0x16, 0xf3,
+        0x6f, 0x8c, 0x6e, 0x37, 0x65, 0x22, 0xfc, 0xc3, 0xd7, 0xa3, 0x8c, 0xb3,
+        0x17, 0x31, 0x10, 0x03, 0x28, 0x8c, 0xe2, 0xa1, 0x20, 0x82, 0xef, 0x12,
+        0x89, 0x1e, 0xb9, 0x94, 0x37, 0xf5, 0x4c, 0xa4, 0xc4, 0x33, 0x20, 0xb3,
+        0x75, 0x77, 0x34, 0xc8, 0xf9, 0x67, 0xcf, 0xca, 0x80, 0x4f, 0x4e, 0xfe,
+        0x30, 0x16, 0x5a, 0x2f, 0x19, 0xb5, 0x27, 0x03, 0xb0, 0x0a, 0x47, 0x87,
+        0x0a, 0x97, 0x4a, 0x7d, 0x0b, 0x76, 0xe2, 0x41, 0xe3, 0x61, 0x71, 0xc8,
+        0x5e, 0xe2, 0xfd, 0xdf, 0x9c, 0x98, 0x2e, 0x77, 0x69, 0x31, 0x99, 0xb3,
+        0x19, 0xc4, 0xb4, 0x6b, 0xd0, 0xb1, 0x55, 0x68, 0x75, 0xbe, 0x3a, 0x8b,
+        0x73, 0x62, 0xd6, 0xdf, 0x1d, 0x0c, 0x98, 0x25, 0xe1, 0x14, 0xb5, 0x7d,
+        0xb4, 0xa8, 0x37, 0x3f, 0xd7, 0x11, 0xc9, 0xd3, 0x54, 0x5f, 0xac, 0xad,
+        0x29, 0xbf, 0xd3, 0x8b, 0xa6, 0x8a, 0xe8, 0xfc, 0xe5, 0x16, 0xd1, 0x8f,
+        0xdd, 0x78, 0xec, 0xd9, 0x3b, 0x28, 0x3c, 0x02, 0x27, 0x9e, 0x1f, 0xb5,
+        0xa5, 0xf2, 0x35, 0xa0, 0x9e, 0x72, 0x3a, 0x69, 0x31, 0x58, 0xe5, 0x5e,
+        0x73, 0x0b, 0x82, 0xd5, 0x9e, 0x84, 0x95, 0x82, 0x59, 0x1a, 0xd8, 0x6d,
+        0xb7, 0x63, 0x12, 0x25, 0xe7, 0x68, 0xbc, 0x35, 0x8d, 0x20, 0x0e, 0x60,
+        0x43, 0x12, 0xd6, 0x51, 0x41, 0xfd, 0xfa, 0xf5, 0xc9, 0x17, 0x87, 0x40,
+        0x8a, 0x7c, 0xca, 0xe9, 0x66, 0x90, 0x2a, 0x4a, 0x70, 0xad, 0xa7, 0x9d,
+        0xd4, 0xb9, 0xb1, 0x53, 0xd0, 0x28, 0xdb, 0x2b, 0x71, 0x36, 0x63, 0x02,
+        0xc8, 0x58, 0x0c, 0x68, 0xde, 0x23, 0xd3, 0x8e, 0xbb, 0x0e, 0x81, 0x10,
+        0xe4, 0x54, 0x5e, 0xe5, 0xf1, 0x03, 0xda, 0x15, 0x60, 0x4c, 0xde, 0xd4,
+        0x3d, 0xe8, 0xbf, 0x9e, 0x62, 0x48, 0xb2, 0xc5, 0x66, 0x68, 0x1e, 0xda,
+        0x0c, 0xd0, 0xf4, 0xea, 0x9b, 0x99, 0xcb, 0x2c, 0x0e, 0x47, 0x35, 0xc7,
+        0xd1, 0x11, 0xcc, 0x6a, 0xf5, 0x22, 0xbd, 0xe1, 0xdb, 0xc1, 0xba, 0x3f,
+        0xba, 0x8e, 0x4f, 0x8d, 0x19, 0xeb, 0x0d, 0x34, 0xc1, 0x8e, 0xfa, 0xf6,
+        0xa0, 0x3d, 0x67, 0x05, 0xe0, 0x91, 0xec, 0x57, 0xb3, 0x4d, 0xc3, 0x77,
+        0xa1, 0x4c, 0xb7, 0xc6, 0xda, 0xa8, 0x1c, 0xee, 0xf2, 0xe2, 0x29, 0x19,
+        0x1e, 0x83, 0x74, 0xfc, 0xbb, 0x95, 0xf7, 0x05, 0xb0, 0x56, 0xbb, 0x55,
+        0x26, 0x82, 0xca, 0x11, 0xd8, 0x2e, 0x20, 0x5e, 0x2e, 0xa5, 0x49, 0x45,
+        0xdd, 0x40, 0xbd, 0x8c, 0xf8, 0x68, 0x2d, 0xd9, 0x92, 0xab, 0xfd, 0xdb,
+        0xf5, 0xb9, 0xd0, 0xb7, 0x50, 0xa7, 0x84, 0x5c, 0xe0, 0xac, 0xf2, 0x68,
+        0xe9, 0x91, 0xfa, 0x9b, 0x72, 0xf0, 0xc0, 0xdd, 0xc7, 0xfb, 0x58, 0xd5,
+        0x70, 0x82, 0x9f, 0xbc, 0x3d, 0x65, 0x0b, 0x8b, 0x08, 0x0b, 0x76, 0xb4,
+        0x1e, 0xd5, 0x1e, 0x0a, 0x0a, 0x8c, 0x60, 0x7a, 0xae, 0x34, 0xc5, 0xb0,
+        0x86, 0x17, 0xa3, 0x0b, 0xd0, 0x38, 0xf6, 0x4a, 0xfc, 0x8d, 0x2d, 0x45,
+        0x06, 0x72, 0xa8, 0x29, 0xff, 0x8f, 0xd2, 0xc3, 0x65, 0x2d, 0x0a, 0x0a,
+        0x13, 0xdd, 0x4d, 0x0a, 0x85, 0xec, 0x91, 0xa3, 0xb1, 0x6e, 0xc9, 0x06,
+        0x08, 0x81, 0xf6, 0x44, 0xac, 0xf0, 0x9d, 0x68, 0xf8, 0xfc, 0xfb, 0xd7,
+        0x61, 0x4f, 0x82, 0x2b, 0xe9, 0x7d, 0xb3, 0x60, 0x4e, 0x77, 0xd6, 0x8d,
+        0xab, 0x46, 0xd9, 0x4f, 0x46, 0x5c, 0xf0, 0xa9, 0x3d, 0x34, 0xf9, 0xdf,
+        0xf0, 0x6a, 0x6e, 0xa2, 0x41, 0xea, 0x69, 0xc4, 0x37, 0x43, 0xd1, 0xc7,
+        0xd4, 0x52, 0x83, 0x18, 0x3a, 0x8e, 0xce, 0xad, 0xa5, 0x7b, 0x0a, 0x98,
+        0x7b, 0xfd, 0x93, 0xf7, 0xf7, 0x46, 0x94, 0xc6, 0xa5, 0x10, 0xac, 0x5e,
+        0xfa, 0x41, 0xde, 0x8f, 0xce, 0x73, 0xe7, 0x0e, 0x41, 0x62, 0x5f, 0x71,
+        0x36, 0xd7, 0x4c, 0x23, 0x68, 0x03, 0x74, 0x93, 0xac, 0x16, 0x63, 0x5f,
+        0x13, 0x35, 0xc3, 0x1d, 0x04, 0x01, 0x32, 0x2c, 0xf9, 0xf8, 0xd1, 0x6b,
+        0x86, 0xec, 0x57, 0xc7, 0xb5, 0x9b, 0xdd, 0xa8, 0x8f, 0x43, 0xd9, 0x94,
+        0x4b, 0xa8, 0xe2, 0x3e, 0x23, 0x0c, 0xa8, 0xad, 0x9e, 0x5f, 0x9c, 0xa6,
+        0x9e, 0xa6, 0x3d, 0xf4, 0x49, 0xaa, 0xb0, 0x7a, 0x1d, 0x7a, 0x3b, 0xe2,
+        0xef, 0x1b, 0x1c, 0x2b, 0xdd, 0xac, 0xbb, 0xa8, 0x58, 0xb3, 0xa4, 0x22,
+        0xd1, 0xfa, 0x25, 0x23, 0x22, 0x58, 0x26, 0xd7, 0x48, 0x9f, 0x7b, 0xdf,
+        0xf7, 0x44, 0xba, 0x9f, 0xda, 0x7a, 0x01, 0x0a, 0x9e, 0xbc, 0x4a, 0xfa,
+        0xc1, 0x6c, 0xec, 0x9d, 0xd6, 0x8e, 0x70, 0xd8, 0xcc, 0x60, 0x2a, 0x82,
+        0x97, 0x2d, 0x53, 0x67, 0x81, 0xf0, 0xe6, 0x55, 0x66, 0x0c, 0xbb, 0x60,
+        0xa9, 0x8b, 0x49, 0x81, 0x21, 0xe7, 0xb7, 0x17, 0x34, 0x8e, 0x2b, 0xee,
+        0x07, 0x4c, 0x07, 0x55, 0x78, 0x06, 0x94, 0x56, 0xca, 0x95, 0xb2, 0x75,
+        0x16, 0xc4, 0x53, 0x64, 0xda, 0x2b, 0x02, 0x99, 0x45, 0x68, 0xff, 0xe0,
+        0x9f, 0x31, 0xdd, 0x3e, 0x69, 0xb7, 0x66, 0x58, 0x80, 0x55, 0x18, 0x8e,
+        0xa3, 0xf3, 0xe8, 0x1c, 0xc8, 0x43, 0x80, 0x9b, 0x92, 0x8b, 0x84, 0x01,
+        0x6c, 0x66, 0x84, 0xca, 0xbb, 0x2f, 0xf5, 0x8e, 0xef, 0x92, 0x2f, 0x0c,
+        0xb4, 0xd2, 0x2e, 0x77, 0xd4, 0x2d, 0x71, 0xff, 0x09, 0x33, 0xc0, 0x6d,
+        0xc2, 0x64, 0x2b, 0x32, 0xfc, 0xf2, 0x90, 0xb9, 0xf7, 0x15, 0xb0, 0x2c,
+        0x40, 0x47, 0x85, 0x57, 0x1e, 0x7e, 0xda, 0x7a, 0xfd, 0x8d, 0x3e, 0x4e,
+        0x8b, 0xef, 0x15, 0x53, 0xf1, 0x2b, 0x8f, 0x73, 0xf7, 0xce, 0xdf, 0x51,
+        0x02, 0x34, 0xa7, 0x33, 0xf8, 0xfb, 0x59, 0xcb, 0x3f, 0x6b, 0xf3, 0x0a,
+        0x65, 0xf7, 0x41, 0xf4, 0x3c, 0x48, 0x50, 0x68, 0xe0, 0x0b, 0xf4, 0x23,
+        0x5e, 0x68, 0x97, 0xff, 0x98, 0xdf, 0xa4, 0xcf, 0xa2, 0xc3, 0xc8, 0x79,
+        0xb6, 0xf4, 0x8c, 0x7c, 0xb9, 0x12, 0x3f, 0xad, 0xc5, 0xf2, 0x1d, 0x20,
+        0x9d, 0x29, 0xdc, 0x3b, 0xe8, 0x46, 0xe0, 0x5b, 0x9c, 0x4c, 0x48, 0x55,
+        0xd5, 0x1e, 0x5e, 0x7b, 0x72, 0x07, 0x36, 0x75, 0x24, 0x41, 0x73, 0x9e,
+        0x1f, 0x63, 0x6f, 0x77, 0xed, 0x61, 0xe7, 0x5e, 0xc5, 0xe8, 0xf8, 0x13,
+        0x0e, 0xce, 0x60, 0x1c, 0x5e, 0x2b, 0xa7, 0xe3, 0xf5, 0x67, 0x0c, 0x89,
+        0xb2, 0x1b, 0xc2, 0x1d, 0xa8, 0xa5, 0xfc, 0x6d, 0x05, 0x12, 0xd2, 0x0e,
+        0xa2, 0xff, 0xc4, 0xf1, 0xfb, 0x20, 0xcc, 0x91, 0x15, 0xc4, 0xde, 0x8c,
+        0x29, 0x94, 0xe2, 0xbc, 0x09, 0x16, 0x1b, 0x5c, 0x7c, 0xb7, 0x74, 0xe9,
+        0xea, 0x2e, 0xf6, 0x10, 0xb0, 0xa2, 0x8a, 0x70, 0x18, 0xe4, 0xd4, 0x01,
+        0x76, 0xf8, 0xe1, 0xa0, 0xf0, 0xc7, 0xfe, 0x9f, 0x0b, 0xda, 0x45, 0x1d,
+        0x81, 0x6e, 0xeb, 0xd1, 0x8a, 0x98, 0xe1, 0xe2, 0x55, 0x81, 0x34, 0xa1,
+        0x90, 0x16, 0x2c, 0xb5, 0x22, 0xc0, 0xce, 0x05, 0xb1, 0x0f, 0x34, 0xe0,
+        0xfd, 0x5e, 0x68, 0x2b, 0x74, 0x63, 0x78, 0x94, 0x41, 0x89, 0x5a, 0xd6,
+        0x15, 0x95, 0xbe, 0x63, 0x45, 0x9a, 0x32, 0x89, 0x74, 0xf6, 0xce, 0x2b,
+        0xd4, 0x28, 0x6d, 0x47, 0x12, 0xb3, 0xec, 0x6f, 0xc6, 0x9d, 0xc3, 0x44,
+        0x8f, 0x61, 0xc4, 0xa2, 0x78, 0xcd, 0xb8, 0x88, 0xe2, 0xe6, 0x45, 0xf8,
+        0x20, 0xbe, 0x59, 0x26, 0x3b, 0xfd, 0x3b, 0xef, 0xba, 0x46, 0x25, 0xbd,
+        0x61, 0x8c, 0x70, 0x44, 0x4b, 0x1d, 0xbd, 0x90, 0x7b, 0x86, 0x66, 0xbe,
+        0x07, 0xa1, 0x5f, 0x21, 0x9d, 0xf2, 0x57, 0x6f, 0xae, 0x9d, 0x5b, 0xec,
+        0x1a, 0x2d, 0x6d, 0x02, 0xc1, 0x96, 0xf3, 0xdf, 0x45, 0x41, 0x90, 0x0b,
+        0x66, 0x63, 0xc6, 0xb0, 0x3e, 0x3c, 0x1d, 0x58, 0x11, 0x11, 0x12, 0x2f,
+        0xcf, 0x98, 0x42, 0xdd, 0x85, 0x0c, 0xa4, 0x3c, 0x06, 0x19, 0xf3, 0x87,
+        0xaa, 0x8c, 0xb3, 0x24, 0x45, 0x92, 0x30, 0xae, 0x3d, 0xb0, 0x5a, 0xec,
+        0xa8, 0xb3, 0x95, 0x15, 0x94, 0x62, 0x16, 0x6c, 0x9a, 0xda, 0x4d, 0x05,
+        0x98, 0x2c, 0xe1, 0xf9, 0xcf, 0xfe, 0xb8, 0x75, 0x0a, 0x93, 0xc3, 0x5d,
+        0xb3, 0x8b, 0x17, 0x1f, 0x03, 0x41, 0xf0, 0x74, 0xf8, 0x20, 0xee, 0x6e,
+        0x34, 0x05, 0x03, 0x84, 0x3c, 0x0a, 0x72, 0x61, 0x51, 0x42, 0x5e, 0x22,
+        0x21, 0x40, 0xb3, 0x16, 0x98, 0xee, 0x7d, 0x0d, 0x95, 0xd0, 0x7f, 0x6d,
+        0x4d, 0xa2, 0x8f, 0x11, 0x3b, 0x7f, 0x6d, 0x12, 0x7d, 0xb0, 0x27, 0x2b,
+        0x97, 0xcb, 0x0d, 0x48, 0x9c, 0xb2, 0x78, 0xc9, 0xed, 0x5e, 0x2b, 0xe0,
+        0x58, 0xae, 0x43, 0x12, 0x84, 0x51, 0x87, 0x3e, 0xc9, 0xf0, 0x6b, 0x38,
+        0xe3, 0x9f, 0x40, 0xf6, 0xfa, 0x50, 0x57, 0x07, 0x3a, 0x0b, 0xf7, 0x20,
+        0x79, 0x7b, 0x34, 0x62, 0x52, 0xb4, 0x50, 0xfc, 0xea, 0xf0, 0x41, 0x67,
+        0x40, 0x20, 0x5d, 0xbb, 0x50, 0x99, 0xa1, 0x61, 0xba, 0x97, 0xe6, 0x62,
+        0x0c, 0x4e, 0x48, 0x14, 0x4c, 0x8c, 0x8c, 0x68, 0xd0, 0x98, 0x4c, 0xa9,
+        0xda, 0x07, 0xa0, 0x65, 0xa9, 0x19, 0xcd, 0xe1, 0xae, 0x23, 0x94, 0xd6,
+        0x78, 0x11, 0xf6, 0xe7, 0xf1, 0xe8, 0xc6, 0x4e, 0x5b, 0x2e, 0x34, 0x69,
+        0x7e, 0x3f, 0x8c, 0x9a, 0xd5, 0x79, 0xfd, 0x2d, 0xa2, 0x6e, 0xf7, 0xe3,
+        0xf6, 0x80, 0xc7, 0xd2, 0x9e, 0x86, 0x2c, 0xcc, 0x89, 0x1c, 0x68, 0x62,
+        0xcc, 0xd7, 0xd0, 0xae, 0x41, 0xab, 0x7b, 0x73, 0xa6, 0x70, 0xe5, 0x75,
+        0x8b, 0xbb, 0xc6, 0x20, 0xdc, 0x1f, 0xdc, 0x72, 0x4f, 0xdc, 0x30, 0x9b,
+        0x27, 0x77, 0xc6, 0xb9, 0x7d, 0x23, 0xe2, 0xeb, 0xb7, 0x99, 0xb0, 0x96,
+        0xaa, 0xab, 0x39, 0xe3, 0xa0, 0x40, 0xd3, 0x8d, 0xb6, 0x41, 0x0a, 0xf8,
+        0x69, 0x85, 0xf0, 0xa0, 0xad, 0xb2, 0x97, 0xc2, 0xaa, 0x79, 0xe2, 0x14,
+        0x8d, 0x3a, 0x19, 0x9d, 0x8c, 0x8e, 0x9c, 0x0d, 0xb9, 0xe0, 0x3a, 0x2a,
+        0x86, 0x8a, 0x73, 0x8a, 0xd7, 0x09, 0x01, 0xa5, 0x27, 0x20, 0x7e, 0x40,
+        0x94, 0x6b, 0x9c, 0xa6, 0xbd, 0x57, 0xea, 0xda, 0x16, 0x35, 0xf2, 0x54,
+        0xb1, 0x40, 0xf4, 0x12, 0xc0, 0x48, 0x75, 0xc2, 0xcf, 0xca, 0x74, 0x23,
+        0x2b, 0xe0, 0x1d, 0xf2, 0x7d, 0x55, 0x0b, 0x14, 0xb3, 0xba, 0x3d, 0x4b,
+        0xbb, 0xb4, 0x1f, 0x4e, 0x34, 0xa5, 0x82, 0xf2, 0xe9, 0x01, 0x63, 0x77,
+        0xf5, 0xae, 0x08, 0xca, 0xa2, 0x94, 0x38, 0x24, 0xfd, 0x83, 0xf0, 0x39,
+        0x76, 0xaa, 0x02, 0xe7, 0xd5, 0x7f, 0x3b, 0x0f, 0x14, 0xd7, 0xdf, 0x68,
+        0x9f, 0x06, 0x40, 0x05, 0x4b, 0xea, 0x2b, 0xc6, 0x24, 0x20, 0x61, 0xb6,
+        0x57, 0xf3, 0xd3, 0x93, 0xec, 0x2c, 0x0b, 0x68, 0xc1, 0x37, 0x50, 0xe1,
+        0x3e, 0x4d, 0x7f, 0x53, 0xf0, 0x5e, 0x12, 0xaa, 0xae, 0x8e, 0x3d, 0x97,
+        0x19, 0x5c, 0x98, 0xa1, 0x51, 0x40, 0xff, 0x35, 0x96, 0xac, 0x5e, 0x82,
+        0xd4, 0xca, 0xe4, 0x23, 0x35, 0x23, 0xc0, 0xd5, 0x1a, 0x25, 0xcc, 0xe9,
+        0x75, 0xe9, 0x95, 0x0e, 0x51, 0x04, 0xa8, 0xe9, 0x65, 0x08, 0x76, 0xa7,
+        0xb7, 0x4d, 0x28, 0x25, 0x0c, 0x7e, 0xf1, 0x0d, 0xb7, 0x3a, 0x8f, 0xd1,
+        0x26, 0x85, 0xfd, 0x9f, 0x3e, 0x22, 0x79, 0x34, 0x0e, 0xe8, 0xbe, 0xac,
+        0x5c, 0x96, 0x90, 0x02, 0x88, 0x15, 0xee, 0x35, 0x15, 0xc1, 0x35, 0x68,
+        0xbb, 0xbe, 0x38, 0xbe, 0x56, 0xe5, 0xe6, 0x86, 0x35, 0xb4, 0xb0, 0xa5,
+        0x67, 0x6b, 0x6b, 0xc4, 0x1b, 0x86, 0x01, 0xd2, 0xdf, 0x06
+    },
+    .commitments = {
+        { 0xca, 0x38, 0x0a, 0x17, 0xb6, 0xa0, 0xf2, 0x4e, 0xf0, 0x6d, 0x13, 0x9b, 0xaa, 0x1b, 0x70, 0xe6, 0x78, 0xa7, 0x3d, 0x0e, 0x65, 0x78, 0x58, 0x04, 0xd8, 0x8c, 0x96, 0x6a, 0xcf, 0x10, 0x37, 0x38 },
+        { 0xfe, 0xca, 0x8d, 0xf1, 0xc0, 0x4c, 0xda, 0x0c, 0xfc, 0xdc, 0x23, 0x4c, 0x17, 0x14, 0x71, 0xdf, 0x7a, 0xad, 0x90, 0xac, 0x9e, 0x28, 0x64, 0xb6, 0xe1, 0xbe, 0x0d, 0xfc, 0x6a, 0x40, 0x41, 0x23 },
+        { 0x83, 0x7d, 0x8d, 0xc9, 0xa8, 0x99, 0x1c, 0x17, 0x8d, 0x65, 0x02, 0x85, 0x0c, 0x1f, 0x91, 0xb1, 0xd4, 0x1a, 0x97, 0x3e, 0xf5, 0xa9, 0xec, 0x4b, 0x10, 0xbf, 0x46, 0x24, 0x67, 0xa7, 0xd4, 0x21 },
+        { 0xb6, 0x7b, 0xf5, 0x11, 0x92, 0xe3, 0x0e, 0x8b, 0x39, 0x9c, 0xed, 0xef, 0xd8, 0xb6, 0x4f, 0x23, 0x86, 0xad, 0x1c, 0xac, 0x70, 0xbd, 0xcc, 0xd7, 0xca, 0xc1, 0x95, 0x1a, 0x3e, 0x86, 0xb5, 0x37 },
+        { 0xce, 0x62, 0x6d, 0x31, 0x28, 0xca, 0x6c, 0x8f, 0xd2, 0x72, 0x21, 0x59, 0x12, 0xde, 0x64, 0xfb, 0x74, 0xc4, 0x5d, 0x56, 0xf4, 0x37, 0x4c, 0xe5, 0xbf, 0x05, 0x37, 0xee, 0x2e, 0x38, 0x20, 0x07 },
+    },
+    .anchor = {
+        0xfe, 0x29, 0x24, 0xb2, 0x64, 0x60, 0xa6, 0xd2, 0x53, 0xea, 0xba, 0xcb,
+        0x8b, 0xaf, 0x24, 0x1e, 0x2f, 0x7b, 0xaf, 0x59, 0x46, 0x16, 0xd0, 0x8b,
+        0xb0, 0x98, 0x34, 0xd5, 0xf1, 0xae, 0x04, 0x18
+    }
+},
+{
+    .bundle = {
+        0x05, 0x49, 0x9f, 0x4d, 0x66, 0x67, 0x9a, 0x3d, 0x5b, 0xee, 0x6f, 0xc5,
+        0x9a, 0x62, 0xca, 0x8b, 0x4a, 0x51, 0xd8, 0x72, 0xcd, 0x43, 0x52, 0x24,
+        0xfd, 0x90, 0xae, 0xc7, 0xba, 0x72, 0x42, 0xe4, 0x2f, 0xa4, 0xdf, 0xab,
+        0x23, 0x99, 0xc9, 0xa5, 0x95, 0x0e, 0xfb, 0x09, 0x13, 0xec, 0x79, 0xee,
+        0x13, 0xef, 0x59, 0xff, 0xf6, 0xb2, 0x48, 0xb0, 0x47, 0xb2, 0xf0, 0x04,
+        0x1b, 0xc2, 0x2d, 0x37, 0x36, 0x12, 0xdc, 0x3b, 0x03, 0x32, 0xb8, 0x63,
+        0x94, 0x87, 0x7a, 0xf8, 0x53, 0x80, 0xc6, 0xd3, 0x35, 0x3e, 0xba, 0x9f,
+        0xe8, 0x28, 0x18, 0x00, 0x0a, 0x1c, 0x39, 0xb5, 0x46, 0xa3, 0xb1, 0x1e,
+        0x1b, 0xfd, 0x22, 0x61, 0xb6, 0x2d, 0x4a, 0x70, 0x96, 0x40, 0x05, 0x44,
+        0x72, 0x03, 0x34, 0x90, 0xb8, 0x3d, 0x18, 0x42, 0x02, 0xe0, 0x26, 0x72,
+        0xc2, 0xff, 0x12, 0x76, 0x6c, 0x4e, 0x7d, 0x4f, 0x0b, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x18, 0x07, 0xb1, 0x61, 0x85, 0x42, 0x87,
+        0x13, 0xc2, 0x33, 0x28, 0x5a, 0xae, 0xe4, 0x57, 0x07, 0xe5, 0xaf, 0xe8,
+        0x58, 0x92, 0x08, 0xc2, 0x64, 0x27, 0x45, 0x68, 0xfd, 0xba, 0x07, 0x81,
+        0x8d, 0x87, 0x3e, 0x22, 0xb8, 0x45, 0x4b, 0x63, 0x45, 0x93, 0x91, 0x38,
+        0x0c, 0x2e, 0xff, 0x18, 0x22, 0x46, 0x13, 0xbf, 0x65, 0x79, 0xc1, 0x1e,
+        0xeb, 0x6f, 0x2f, 0x76, 0x1b, 0x56, 0x76, 0x23, 0x08, 0x26, 0x01, 0xae,
+        0x25, 0x60, 0xa4, 0x83, 0x01, 0x7e, 0xdb, 0x11, 0x89, 0x20, 0xed, 0xe4,
+        0xc3, 0xf5, 0xd7, 0x1a, 0x73, 0xd7, 0x35, 0xdf, 0x2f, 0x31, 0xbc, 0x75,
+        0x28, 0xa0, 0x5d, 0xb7, 0xa6, 0xef, 0xc2, 0xc8, 0xe1, 0x29, 0xb5, 0x1d,
+        0xc6, 0x2b, 0xcb, 0xdc, 0x3f, 0x3e, 0x1a, 0x58, 0x2c, 0xd2, 0x83, 0xc7,
+        0x98, 0x07, 0x57, 0x53, 0xcd, 0x83, 0x12, 0x17, 0x33, 0x81, 0xfa, 0x1f,
+        0x34, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x2e, 0xae, 0x32,
+        0xe5, 0x0f, 0xa9, 0x4d, 0xeb, 0xf5, 0x31, 0x68, 0xae, 0xe7, 0xde, 0xe1,
+        0x0e, 0x2d, 0xbc, 0x97, 0x8f, 0x8f, 0x0f, 0xdf, 0xa5, 0x2b, 0x9d, 0x3f,
+        0x06, 0x62, 0xb4, 0x67, 0x13, 0xea, 0xf0, 0x4c, 0xa9, 0x6e, 0x8b, 0xd1,
+        0x29, 0x93, 0x95, 0xec, 0x92, 0x11, 0xd3, 0x56, 0xa4, 0x0b, 0x56, 0x16,
+        0x8a, 0x0a, 0xa4, 0x2d, 0x28, 0x86, 0xc4, 0x25, 0xa7, 0x13, 0x36, 0x9d,
+        0x3a, 0xfa, 0xa0, 0x25, 0x5e, 0xcf, 0xf7, 0x6d, 0xcd, 0x5c, 0xdb, 0xd4,
+        0x4d, 0xa5, 0x34, 0x23, 0xbd, 0x31, 0x3a, 0x72, 0x2e, 0xd6, 0xd5, 0xe3,
+        0x0e, 0xd7, 0xa1, 0x50, 0xbc, 0x4d, 0xb7, 0xcf, 0xb7, 0x22, 0x3b, 0xc8,
+        0xe6, 0x9d, 0x13, 0x2b, 0xdd, 0x85, 0x07, 0x0c, 0xaf, 0x9e, 0x12, 0xa1,
+        0xbb, 0xe2, 0xe1, 0x4a, 0x63, 0x0b, 0xec, 0x08, 0x44, 0x18, 0x1c, 0x01,
+        0x4e, 0x57, 0x77, 0xd1, 0x15, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x8c, 0xb8, 0xe3, 0x48, 0x4f, 0xfa, 0xda, 0xac, 0xa0, 0x0b, 0xa3,
+        0x65, 0x3f, 0x16, 0xab, 0x73, 0x89, 0x05, 0x51, 0xce, 0x1d, 0x5b, 0xf4,
+        0x9e, 0x7f, 0x53, 0x7d, 0x65, 0xdc, 0x87, 0x92, 0x13, 0x49, 0xa1, 0xd2,
+        0x43, 0x3c, 0xdf, 0xa8, 0x51, 0xe6, 0x83, 0x8f, 0x64, 0x69, 0x0c, 0x6e,
+        0xdc, 0xfa, 0x0b, 0xa8, 0xc1, 0xef, 0xcd, 0xb5, 0x20, 0xa6, 0xf5, 0x7c,
+        0x55, 0x75, 0xaa, 0x3c, 0x22, 0x27, 0x9e, 0xcd, 0x6a, 0xa0, 0x92, 0xe3,
+        0xf0, 0xe4, 0x70, 0x01, 0x7c, 0xbb, 0xd9, 0x43, 0x20, 0x8f, 0xba, 0x24,
+        0x36, 0x4d, 0x8e, 0x96, 0xfc, 0x36, 0xb4, 0x10, 0xb3, 0x99, 0xfa, 0x69,
+        0xa7, 0xc2, 0x0a, 0x21, 0xa5, 0xe2, 0x0a, 0x76, 0xd6, 0xc5, 0x05, 0xe9,
+        0x67, 0xcb, 0x9d, 0x50, 0xd7, 0x53, 0xe3, 0xd1, 0x35, 0x3c, 0xce, 0x32,
+        0x6e, 0xef, 0x55, 0x5f, 0xa3, 0x31, 0xb6, 0x9c, 0x21, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x89, 0x01, 0xee, 0x13, 0x65, 0x64, 0x83,
+        0xe7, 0xcc, 0xef, 0xf1, 0xf8, 0x47, 0xba, 0x1d, 0x5c, 0xcb, 0x4d, 0x7e,
+        0x10, 0xe8, 0x90, 0x2f, 0x87, 0x2b, 0x64, 0xdd, 0x18, 0xe9, 0x23, 0xbd,
+        0xa1, 0x9d, 0x5a, 0x8a, 0x18, 0xf4, 0xe0, 0x16, 0xb9, 0x26, 0xe4, 0x98,
+        0x58, 0x21, 0x2d, 0x9a, 0xdb, 0x2a, 0x63, 0x6f, 0x06, 0x53, 0x5d, 0x20,
+        0xad, 0x32, 0xd7, 0xd7, 0xbd, 0xca, 0x51, 0xb6, 0x17, 0x0d, 0x2b, 0xc5,
+        0xbd, 0x92, 0xfd, 0x8a, 0x52, 0x05, 0x68, 0x33, 0x36, 0x5d, 0xd7, 0x92,
+        0x97, 0x89, 0x4d, 0x18, 0xd9, 0x1b, 0xf9, 0x74, 0x34, 0x73, 0xc5, 0x41,
+        0x7c, 0x90, 0xc8, 0x9d, 0xbb, 0xd0, 0xc7, 0x3f, 0x0f, 0x98, 0x76, 0x3b,
+        0xed, 0x8b, 0x14, 0x80, 0x0f, 0x37, 0x88, 0xc9, 0x80, 0x83, 0xc8, 0x0e,
+        0x1c, 0x88, 0x90, 0x46, 0x64, 0x4c, 0x95, 0x6f, 0x01, 0xe2, 0x4b, 0x1d,
+        0x38, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x03, 0x98, 0xdd,
+        0xc8, 0x0c, 0x8c, 0x37, 0xfc, 0xff, 0xec, 0xa3, 0x82, 0x7c, 0x64, 0xa0,
+        0x46, 0xa2, 0x17, 0x49, 0xec, 0x16, 0x6d, 0x30, 0x8f, 0x1c, 0xb8, 0x93,
+        0x6c, 0x93, 0x0a, 0x18, 0x99, 0xef, 0x43, 0x04, 0xb9, 0x8c, 0xd0, 0x01,
+        0xca, 0x00, 0xfd, 0xb5, 0x07, 0x50, 0x58, 0xeb, 0xbe, 0xf8, 0x6b, 0x26,
+        0x76, 0x45, 0x45, 0x3a, 0x18, 0xe9, 0x9a, 0xfc, 0xa3, 0x00, 0x41, 0xcd,
+        0x21, 0x9d, 0x6f, 0x74, 0x80, 0xfa, 0xc3, 0x53, 0xf7, 0xac, 0xba, 0xe0,
+        0xaa, 0xa7, 0xa0, 0x6c, 0x65, 0x9a, 0x4f, 0x1d, 0x14, 0x53, 0x23, 0xab,
+        0xb6, 0xbe, 0xb8, 0xd6, 0x9d, 0x84, 0x5e, 0x09, 0x15, 0x8b, 0x70, 0x97,
+        0x1b, 0xc3, 0x78, 0x26, 0xfd, 0x2f, 0xa0, 0xcb, 0x4d, 0x36, 0x30, 0xa1,
+        0x2d, 0x05, 0xc1, 0xe6, 0xcc, 0xba, 0xaa, 0x47, 0x85, 0x63, 0x09, 0x67,
+        0x6d, 0x24, 0x3f, 0x1a, 0xf2, 0xe7, 0x99, 0x71, 0x29, 0xea, 0xaa, 0x1c,
+        0x3f, 0x4f, 0x11, 0x4a, 0xe0, 0xc4, 0xf2, 0x0d, 0x77, 0xd4, 0xb9, 0xa1,
+        0xcb, 0x51, 0x7e, 0xa7, 0xf5, 0xbf, 0x38, 0x5e, 0x13, 0x9f, 0x11, 0xd0,
+        0x29, 0xf2, 0x46, 0x90, 0x3a, 0x5c, 0x7f, 0xae, 0xb6, 0xe3, 0x7c, 0x91,
+        0x04, 0x53, 0xf1, 0x80, 0x07, 0x33, 0x18, 0x85, 0xe0, 0x9e, 0x02, 0x5c,
+        0xde, 0x40, 0xd3, 0xf9, 0x2d, 0x7b, 0x74, 0x01, 0xe5, 0x04, 0xdc, 0x0a,
+        0x35, 0xf7, 0x16, 0xbe, 0xe5, 0x19, 0xb8, 0xfa, 0x38, 0x26, 0x86, 0x4e,
+        0xdf, 0xf2, 0xa1, 0x66, 0x66, 0x00, 0xa7, 0x20, 0x8e, 0xc3, 0xad, 0x8c,
+        0xa6, 0xf4, 0xc0, 0xaa, 0x91, 0x18, 0xde, 0xf6, 0x15, 0x13, 0x42, 0x87,
+        0x85, 0xd1, 0x02, 0x74, 0x3c, 0x8b, 0x32, 0x6a, 0xa1, 0x35, 0x67, 0x4d,
+        0xe4, 0xef, 0xa0, 0x50, 0x82, 0xd8, 0xda, 0xce, 0x07, 0x85, 0x44, 0xad,
+        0xe7, 0x91, 0x05, 0x92, 0xd8, 0xc5, 0x70, 0x42, 0xe6, 0x74, 0x83, 0xa8,
+        0x58, 0x23, 0xdd, 0x99, 0xee, 0xc7, 0x40, 0xc5, 0x40, 0x24, 0xeb, 0xec,
+        0x2f, 0x59, 0x46, 0x17, 0x62, 0x50, 0x1b, 0x4e, 0x42, 0x06, 0xde, 0x29,
+        0x11, 0x3d, 0x4a, 0x75, 0x75, 0x46, 0xb2, 0x5a, 0xc4, 0x60, 0xb4, 0xce,
+        0x03, 0xb1, 0xf7, 0x9d, 0xf3, 0xd9, 0xa6, 0x0e, 0x49, 0x34, 0x71, 0x6c,
+        0xd7, 0x3a, 0x4f, 0xf2, 0xeb, 0x68, 0xb5, 0xbf, 0xb6, 0xdc, 0xcd, 0x49,
+        0x5d, 0x6f, 0x3c, 0xff, 0x1d, 0x29, 0x12, 0x3f, 0xe5, 0x6a, 0x49, 0xf7,
+        0xe5, 0xde, 0x9c, 0x04, 0x25, 0x74, 0x3b, 0xcc, 0xd9, 0x46, 0x09, 0x54,
+        0x93, 0x76, 0xfb, 0x27, 0x57, 0x35, 0x9f, 0x6c, 0x42, 0x28, 0xd8, 0x40,
+        0x1b, 0x57, 0x87, 0x4c, 0x17, 0x3e, 0xd0, 0xb3, 0xa6, 0xdf, 0x32, 0x2c,
+        0xc0, 0x67, 0xd7, 0x39, 0xa2, 0x93, 0x71, 0x51, 0x88, 0xa5, 0x2e, 0xfc,
+        0x38, 0xcd, 0xbc, 0xf5, 0x7b, 0x0f, 0xad, 0x37, 0x59, 0x87, 0x92, 0xc3,
+        0x04, 0xf0, 0x4a, 0xf8, 0xd9, 0xf1, 0xf5, 0x3e, 0xc3, 0x63, 0xc8, 0xf2,
+        0xdc, 0x8c, 0xd3, 0xe2, 0xfe, 0x91, 0x55, 0x4a, 0xbc, 0xe6, 0x63, 0xd9,
+        0x62, 0xa0, 0x0c, 0x9a, 0x51, 0x62, 0x18, 0xbc, 0xcf, 0x86, 0x2f, 0x78,
+        0x26, 0xcd, 0xde, 0x60, 0x13, 0xd2, 0x55, 0x6d, 0x77, 0xe0, 0x05, 0x65,
+        0xc1, 0xdd, 0xe1, 0x52, 0xb5, 0xfc, 0xe6, 0x2a, 0xb5, 0x5b, 0x9b, 0x2e,
+        0xcd, 0x3a, 0x33, 0x49, 0x1a, 0xb9, 0xcf, 0xee, 0x81, 0xa9, 0x37, 0xf7,
+        0x55, 0xa5, 0xe1, 0x16, 0x04, 0x5e, 0xe4, 0xfa, 0x2e, 0x25, 0xcb, 0xc6,
+        0x12, 0xba, 0xb3, 0x86, 0xac, 0x24, 0x7c, 0x35, 0x08, 0x93, 0x72, 0x66,
+        0xc1, 0x83, 0xef, 0x81, 0x47, 0x65, 0xa1, 0x0d, 0xbc, 0xea, 0xde, 0xed,
+        0x40, 0x79, 0xa9, 0x3b, 0x53, 0x04, 0x14, 0xc1, 0xc8, 0xe7, 0xff, 0x0c,
+        0x2c, 0x99, 0xdb, 0x3d, 0xd0, 0xde, 0x34, 0xc4, 0x1f, 0xce, 0x14, 0x8d,
+        0xc0, 0xd9, 0xf3, 0x19, 0x73, 0x37, 0xea, 0xd4, 0x6c, 0xc0, 0xaf, 0xc0,
+        0xf9, 0x3b, 0x66, 0xdc, 0x80, 0x80, 0x4b, 0x13, 0x18, 0x2c, 0xc7, 0x1f,
+        0x1f, 0x90, 0x03, 0xaa, 0xd0, 0xd2, 0xc4, 0x3e, 0x3b, 0x3f, 0x07, 0x90,
+        0x6a, 0xb7, 0x7b, 0x55, 0xfd, 0xbd, 0x78, 0xa9, 0xb3, 0xe0, 0xaf, 0x76,
+        0x07, 0x62, 0xfb, 0xa0, 0xd7, 0x6a, 0x72, 0x6e, 0xcb, 0x7d, 0xcb, 0x13,
+        0x07, 0xbd, 0xef, 0xf8, 0x72, 0xb0, 0x8c, 0x70, 0x2a, 0x32, 0x7b, 0xdc,
+        0xda, 0xa5, 0x38, 0xa4, 0xd7, 0xc3, 0x5e, 0x9f, 0x5c, 0x6f, 0x65, 0x7b,
+        0x6e, 0x1d, 0xc4, 0xe6, 0xcd, 0xe5, 0xc3, 0x95, 0xaa, 0x51, 0xe1, 0x62,
+        0x3d, 0xe4, 0x6a, 0x78, 0x77, 0x86, 0x36, 0xf6, 0xe3, 0xf2, 0xfb, 0x03,
+        0xff, 0x94, 0x90, 0x34, 0x8c, 0xd5, 0xa4, 0xd6, 0x39, 0xd3, 0x92, 0x7a,
+        0x01, 0x06, 0x22, 0x4a, 0x76, 0xf8, 0x3d, 0xe3, 0x61, 0xe3, 0x77, 0x11,
+        0x03, 0xd3, 0x44, 0x9a, 0xdd, 0xdf, 0x63, 0xbf, 0x58, 0xb8, 0x40, 0x4b,
+        0x56, 0x1b, 0xf4, 0x94, 0x80, 0xd6, 0x4b, 0x77, 0xab, 0xed, 0x6e, 0x64,
+        0x6a, 0xbf, 0x2e, 0x11, 0x09, 0x1c, 0x2c, 0x51, 0xef, 0xaa, 0x8a, 0x34,
+        0xe5, 0xb6, 0x68, 0x15, 0x0e, 0x12, 0x57, 0x0f, 0xb0, 0x6c, 0x74, 0x5c,
+        0xcf, 0xd8, 0xb0, 0x9f, 0x42, 0x7b, 0x4e, 0x83, 0x71, 0xaa, 0xdd, 0xca,
+        0xef, 0x83, 0x96, 0x5b, 0xfd, 0xbe, 0xee, 0x8b, 0xcd, 0x3e, 0xbd, 0x48,
+        0xdb, 0x81, 0x83, 0xe1, 0x98, 0x4e, 0x6a, 0xa0, 0xdd, 0x92, 0xf8, 0xfa,
+        0x14, 0xc4, 0x33, 0x99, 0xa6, 0x2b, 0xc2, 0x7f, 0xb2, 0x8f, 0x5a, 0xcb,
+        0x7e, 0x43, 0xda, 0x58, 0xe4, 0x74, 0xf5, 0x2c, 0x5b, 0x6b, 0x54, 0x18,
+        0xec, 0x9b, 0xe2, 0xa9, 0xbb, 0xbd, 0x76, 0x63, 0x04, 0xf2, 0x7b, 0xba,
+        0x93, 0xc6, 0x96, 0x5f, 0x5a, 0xa0, 0x28, 0xfa, 0x47, 0x8d, 0xc0, 0x47,
+        0xb3, 0x37, 0x5c, 0x26, 0x02, 0xfe, 0xaf, 0x52, 0x73, 0x61, 0x74, 0x1f,
+        0x3d, 0x12, 0xfe, 0xca, 0xfe, 0xe0, 0x9a, 0x23, 0x68, 0x92, 0xb7, 0x92,
+        0xc1, 0xe2, 0xbb, 0x0b, 0x3d, 0xd6, 0xe2, 0x4f, 0x1c, 0xf2, 0xc2, 0xc7,
+        0x06, 0xca, 0x61, 0x1f, 0xa2, 0xae, 0x62, 0x34, 0xbb, 0x38, 0x68, 0x1e,
+        0x5c, 0xc4, 0x23, 0x38, 0x78, 0x3a, 0xe9, 0x48, 0x96, 0x5e, 0x81, 0xe4,
+        0xb9, 0xf7, 0x96, 0xa6, 0x52, 0x40, 0x7c, 0x75, 0xe9, 0x3c, 0x7a, 0xc2,
+        0x82, 0xa7, 0x84, 0x05, 0xdb, 0xb2, 0xa9, 0x04, 0xcc, 0x57, 0xc8, 0x01,
+        0x54, 0x85, 0xaf, 0x84, 0x1c, 0x28, 0x61, 0x6b, 0x0a, 0x6d, 0xde, 0x57,
+        0x37, 0xf6, 0x6c, 0xdf, 0x71, 0x1c, 0x47, 0x24, 0x25, 0x22, 0xbc, 0x3c,
+        0xd9, 0xfa, 0x09, 0xc9, 0x61, 0xfb, 0x9d, 0xca, 0xc2, 0x71, 0x60, 0xd7,
+        0x8f, 0x18, 0x57, 0x25, 0x54, 0xc5, 0x28, 0x0b, 0x3c, 0xe0, 0x57, 0xe9,
+        0xf6, 0xc5, 0x67, 0x4a, 0x56, 0xdf, 0xe9, 0x8a, 0xc2, 0xc6, 0x36, 0x84,
+        0x4b, 0xe5, 0x04, 0x09, 0x04, 0xd1, 0x1e, 0x7a, 0xcc, 0x12, 0x48, 0x35,
+        0x54, 0x1b, 0xd5, 0x5b, 0x37, 0xb9, 0x6d, 0x48, 0xed, 0xf3, 0xcd, 0xd9,
+        0xa6, 0x58, 0x90, 0x62, 0xa4, 0xbc, 0x2f, 0xfd, 0xb1, 0x0e, 0x4e, 0xad,
+        0x9e, 0x76, 0xb5, 0x27, 0x22, 0x7b, 0xa7, 0x6d, 0xee, 0x42, 0xb3, 0x69,
+        0x97, 0xef, 0xd9, 0x68, 0x3d, 0xa3, 0xf3, 0x84, 0x4b, 0x61, 0x2f, 0x7a,
+        0x29, 0x58, 0xcb, 0xf3, 0xfd, 0x09, 0x18, 0xdc, 0x96, 0x6b, 0xab, 0xf8,
+        0x31, 0xd3, 0xcc, 0x73, 0x14, 0x5a, 0xe7, 0x3f, 0x4c, 0xd8, 0xfd, 0x5e,
+        0x81, 0xc5, 0x1e, 0xb5, 0x6b, 0xb8, 0xfb, 0xc0, 0x67, 0x16, 0xb2, 0x59,
+        0x36, 0xf9, 0x46, 0x77, 0xfc, 0xf1, 0x68, 0xb0, 0x47, 0x40, 0x6b, 0x57,
+        0x6d, 0xc7, 0xd3, 0x1a, 0xff, 0xe6, 0x72, 0x98, 0xa8, 0x65, 0xea, 0xa2,
+        0xdd, 0xaa, 0xad, 0xe9, 0xfc, 0x37, 0x82, 0x2e, 0x35, 0x83, 0x1b, 0x39,
+        0xfd, 0xa6, 0x1c, 0x85, 0x7d, 0xc4, 0xf4, 0xa1, 0xac, 0xf9, 0xd5, 0x5a,
+        0x8c, 0xcb, 0x0b, 0xa4, 0x2c, 0x4e, 0xda, 0xe4, 0x30, 0xf6, 0x13, 0xc6,
+        0xed, 0x59, 0x89, 0xc7, 0x87, 0xba, 0x6d, 0x31, 0xc2, 0x2a, 0x75, 0x88,
+        0x66, 0xce, 0xe4, 0xa3, 0xb6, 0x62, 0x3f, 0x53, 0xde, 0xa3, 0x3d, 0x10,
+        0xae, 0x73, 0xab, 0xd9, 0x26, 0xa6, 0xa3, 0x12, 0x3b, 0x62, 0xfd, 0x2f,
+        0x5f, 0x1e, 0xf5, 0xb4, 0x92, 0xea, 0xc6, 0x87, 0xcd, 0x06, 0xa7, 0xe4,
+        0x57, 0x7b, 0xe3, 0x9d, 0xdf, 0x01, 0x24, 0x50, 0x6e, 0x42, 0x66, 0xf6,
+        0xe0, 0xe2, 0x2e, 0x80, 0x4e, 0xb3, 0x8e, 0xea, 0x89, 0x6e, 0x73, 0x6e,
+        0x32, 0x6d, 0x2c, 0xf2, 0x02, 0xff, 0x61, 0x58, 0xe7, 0x23, 0xbb, 0x67,
+        0xed, 0x5a, 0xbd, 0x09, 0xde, 0x65, 0xb8, 0x47, 0x3e, 0x00, 0xb7, 0xc9,
+        0x01, 0xf7, 0xbd, 0xdd, 0x87, 0x3e, 0x33, 0x6a, 0x35, 0x9d, 0x64, 0x2e,
+        0x5a, 0x2f, 0xbd, 0xbf, 0x5e, 0x59, 0x1c, 0x71, 0xfd, 0x4b, 0x3a, 0xfc,
+        0xf9, 0x0a, 0x81, 0xe3, 0x36, 0xbd, 0x06, 0xd7, 0x63, 0xd4, 0x14, 0xbf,
+        0x44, 0xfd, 0x01, 0x0b, 0x4d, 0x7d, 0xe2, 0xd8, 0xb5, 0xb0, 0xcb, 0x4c,
+        0xf1, 0x42, 0x37, 0x19, 0x57, 0x19, 0xa2, 0xc9, 0xea, 0xf0, 0x81, 0x84,
+        0x28, 0x6f, 0xa2, 0x20, 0x35, 0x23, 0x5e, 0xcd, 0xa1, 0x76, 0x6d, 0xc3,
+        0x9b, 0x8d, 0xc0, 0x03, 0x9c, 0xf9, 0x1a, 0x67, 0xf5, 0xc1, 0x2e, 0x55,
+        0x79, 0xba, 0x48, 0xea, 0x38, 0x04, 0xea, 0xbe, 0xe3, 0x49, 0xd1, 0xd8,
+        0x09, 0x56, 0xae, 0x51, 0xde, 0xca, 0xbb, 0x5e, 0xaf, 0x99, 0x99, 0x0c,
+        0xe2, 0xe5, 0xc2, 0xb7, 0x9e, 0x0e, 0x3c, 0x4e, 0x5d, 0xf0, 0x80, 0xf1,
+        0xbb, 0x5f, 0x74, 0x6b, 0xfd, 0x52, 0xa8, 0xc0, 0x67, 0x87, 0xc1, 0x89,
+        0x64, 0x60, 0x0c, 0x69, 0x8f, 0x08, 0xb1, 0xe7, 0xe1, 0x1d, 0xa1, 0x1e,
+        0x29, 0xe5, 0xf0, 0x4a, 0x43, 0x64, 0x0d, 0x57, 0xd9, 0xf7, 0xdf, 0x7d,
+        0x5c, 0x75, 0x28, 0xad, 0xa0, 0xb0, 0x99, 0xb5, 0x67, 0x99, 0x2a, 0x93,
+        0x64, 0xf1, 0xf6, 0x9b, 0xfa, 0x26, 0x7f, 0xf2, 0x6a, 0x74, 0x96, 0x81,
+        0xf2, 0x6a, 0x26, 0x15, 0xb5, 0x18, 0x67, 0xda, 0x42, 0x9b, 0x38, 0x12,
+        0x34, 0x46, 0xc4, 0xf9, 0x2c, 0xe9, 0xea, 0x97, 0xce, 0x37, 0x83, 0x00,
+        0x10, 0xad, 0x03, 0x00, 0x3f, 0x92, 0x6c, 0x3a, 0x43, 0x31, 0x9e, 0xe2,
+        0x99, 0x6f, 0x42, 0x6f, 0xab, 0xd7, 0x37, 0x56, 0x8b, 0x0a, 0xc2, 0x80,
+        0xdc, 0xe1, 0x54, 0x72, 0x95, 0x6f, 0x3a, 0xe7, 0xe4, 0x10, 0xec, 0x62,
+        0x6f, 0x24, 0x19, 0x80, 0x82, 0x6c, 0xcd, 0x1d, 0x99, 0xf3, 0x29, 0x56,
+        0xe3, 0xbe, 0xb6, 0xf4, 0x40, 0x97, 0x8c, 0x1e, 0xbb, 0x90, 0xbe, 0x20,
+        0xc1, 0x02, 0x6a, 0xac, 0x1c, 0x80, 0xc8, 0x20, 0x67, 0x1d, 0x6f, 0xc9,
+        0x75, 0x63, 0x3d, 0x40, 0x17, 0x83, 0x0f, 0x9c, 0x19, 0x95, 0x0a, 0xf1,
+        0x67, 0x98, 0x5a, 0xc9, 0xdb, 0x1b, 0x1b, 0xbb, 0x25, 0x0b, 0xbd, 0xc3,
+        0xb2, 0xfe, 0xf0, 0x05, 0xce, 0x7c, 0x20, 0xbb, 0x91, 0x00, 0xab, 0x80,
+        0xaf, 0x0e, 0xb0, 0x13, 0xfa, 0xdd, 0x84, 0x73, 0x31, 0x7b, 0x4d, 0x13,
+        0xcf, 0xb0, 0xc8, 0xf1, 0x6c, 0x46, 0x3a, 0x3f, 0xb2, 0x37, 0xe0, 0x74,
+        0x4e, 0x88, 0xf4, 0x46, 0x5a, 0x78, 0x9e, 0x13, 0xec, 0xf7, 0x82, 0x09,
+        0x90, 0x4d, 0x24, 0x5b, 0x25, 0xea, 0xa8, 0x3d, 0x25, 0xe9, 0x75, 0x0a,
+        0x70, 0xe1, 0x3f, 0x4f, 0x3d, 0x5e, 0xc5, 0x41, 0x4e, 0x15, 0x77, 0x2f,
+        0xc7, 0x12, 0xca, 0x45, 0x02, 0xdd, 0x50, 0xde, 0x20, 0x14, 0x9c, 0xf8,
+        0xf2, 0x7a, 0x81, 0xb0, 0x40, 0x75, 0x76, 0x40, 0x47, 0x27, 0xb2, 0x74,
+        0x97, 0xf0, 0x54, 0x8b, 0x59, 0x90, 0x35, 0xea, 0x91, 0xed, 0x39, 0x72,
+        0xb5, 0x2c, 0x07, 0xec, 0x22, 0xef, 0x90, 0x48, 0x25, 0x94, 0x45, 0xf2,
+        0x4f, 0x1c, 0x65, 0x58, 0xb0, 0xfa, 0x68, 0xd2, 0x65, 0xf4, 0xd1, 0x1a,
+        0x62, 0x99, 0xa8, 0x54, 0x02, 0xa4, 0x04, 0xb5, 0xe0, 0xb5, 0xda, 0x4b,
+        0x18, 0x71, 0xeb, 0xe1, 0xf0, 0xa8, 0xe3, 0xb8, 0x37, 0xee, 0xdf, 0xb6,
+        0x2e, 0xa2, 0xdf, 0x35, 0xd6, 0x0a, 0x04, 0x76, 0xa9, 0x92, 0x48, 0xfc,
+        0xa5, 0xd3, 0x4c, 0x72, 0xb9, 0x97, 0xe4, 0xd6, 0x1c, 0x4c, 0xa5, 0x83,
+        0x21, 0xb2, 0xd9, 0xe2, 0x65, 0x0b, 0xca, 0x88, 0x7a, 0x8f, 0x66, 0x61,
+        0x76, 0x11, 0x1e, 0x0d, 0x3c, 0x7c, 0x86, 0xbc, 0xaf, 0x11, 0x79, 0x55,
+        0x65, 0xaf, 0x13, 0x17, 0xa5, 0xe5, 0xc9, 0x1c, 0x5e, 0x6c, 0xa5, 0x3f,
+        0xfa, 0xf4, 0x6e, 0xba, 0xa0, 0x7b, 0xae, 0x57, 0xc8, 0xe9, 0x7c, 0xe5,
+        0x66, 0x00, 0xc5, 0xab, 0xd8, 0xdd, 0xf0, 0x4f, 0xf2, 0xc5, 0xaf, 0xe3,
+        0xa7, 0xa4, 0x8b, 0x48, 0x07, 0x6b, 0xdc, 0xe0, 0x0c, 0x7d, 0x03, 0x08,
+        0xe3, 0x88, 0x5c, 0x05, 0xa2, 0x94, 0x4f, 0x19, 0x3b, 0x68, 0x96, 0x1c,
+        0xcd, 0x61, 0xb9, 0x12, 0xf1, 0x7d, 0x6e, 0xf3, 0x07, 0x5c, 0xf7, 0x97,
+        0x77, 0xec, 0x29, 0xe6, 0xc4, 0x6e, 0x47, 0xa6, 0x90, 0x6c, 0xde, 0x2d,
+        0x27, 0xd7, 0x45, 0xc3, 0x36, 0x79, 0xb0, 0xfa, 0x0d, 0xd6, 0x40, 0x0a,
+        0x42, 0x2d, 0xff, 0x15, 0x29, 0x34, 0x00, 0xc3, 0xad, 0xff, 0xd9, 0xbc,
+        0x97, 0xe6, 0x4b, 0xf2, 0xc0, 0xda, 0x94, 0x50, 0x31, 0xca, 0x90, 0xc9,
+        0x23, 0x36, 0x68, 0xa9, 0x83, 0xef, 0xd8, 0x71, 0x43, 0xd8, 0xc2, 0x34,
+        0x42, 0xa9, 0x5d, 0x25, 0x04, 0x96, 0xd3, 0xfa, 0x1b, 0x16, 0x1e, 0x32,
+        0x44, 0x73, 0x60, 0xe0, 0xc1, 0x06, 0x57, 0x1f, 0x60, 0xf6, 0x5d, 0x94,
+        0x9e, 0x97, 0x4e, 0xab, 0xea, 0x43, 0x32, 0x43, 0xa1, 0xbb, 0xbd, 0x19,
+        0x11, 0xf9, 0x93, 0x3d, 0x68, 0x2d, 0xd5, 0xbf, 0x31, 0x1d, 0x5b, 0x9f,
+        0xc6, 0x51, 0x56, 0x68, 0xdc, 0x99, 0x24, 0x5f, 0x84, 0x2c, 0x34, 0xe6,
+        0xa8, 0xc1, 0xe4, 0x46, 0xbe, 0xc1, 0x26, 0x44, 0xde, 0x53, 0xfc, 0x53,
+        0x28, 0xe8, 0x03, 0xe4, 0x7a, 0xdb, 0xc9, 0xbc, 0x8b, 0xda, 0x93, 0xf7,
+        0x83, 0x7e, 0x7e, 0x53, 0x42, 0x6e, 0xd7, 0xe1, 0x31, 0xbe, 0x20, 0x31,
+        0x89, 0x86, 0xb5, 0x11, 0x40, 0x87, 0x44, 0x2e, 0x97, 0x9e, 0x0b, 0x32,
+        0xb6, 0x0d, 0xc2, 0xb1, 0xe6, 0xca, 0xf4, 0x6f, 0x5b, 0x65, 0x42, 0x6c,
+        0xa0, 0x03, 0x7d, 0xbd, 0x0a, 0xb9, 0xcd, 0x80, 0xaf, 0x06, 0x93, 0x93,
+        0x60, 0xdd, 0x81, 0x12, 0x1c, 0xec, 0x3c, 0xbc, 0x9f, 0xc4, 0x8f, 0x88,
+        0x9e, 0xca, 0xd0, 0xf0, 0xb6, 0xf0, 0x18, 0x63, 0xcb, 0x85, 0x4b, 0x0b,
+        0x3a, 0xd0, 0x48, 0xe8, 0x60, 0x98, 0x75, 0x9c, 0x6a, 0xb1, 0xab, 0xad,
+        0xe5, 0x8f, 0x6a, 0x5a, 0x9f, 0xb7, 0x7f, 0x61, 0xac, 0x41, 0xa9, 0x85,
+        0x2c, 0xa0, 0xc0, 0xe1, 0xc1, 0xa5, 0x65, 0xa1, 0x99, 0x20, 0xb8, 0x2f,
+        0x8e, 0xd9, 0xb6, 0x8b, 0xba, 0xc2, 0xc1, 0x3f, 0xc9, 0xfa, 0xa9, 0x48,
+        0x18, 0x20, 0x55, 0x73, 0xa8, 0x31, 0x6b, 0xed, 0x5d, 0xfe, 0x86, 0x1a,
+        0x2e, 0xec, 0x13, 0xda, 0xee, 0xbd, 0xcc, 0x08, 0x22, 0xa8, 0xbe, 0x4d,
+        0xf0, 0xf2, 0x6d, 0x17, 0x5d, 0x03, 0xef, 0x08, 0xb1, 0xfd, 0xce, 0xc2,
+        0x5a, 0x9a, 0x3b, 0x55, 0xbb, 0x65, 0xb9, 0x6d, 0x91, 0xc8, 0xd9, 0x0f,
+        0xe7, 0x25, 0x46, 0xad, 0xab, 0xf0, 0x6d, 0xe2, 0xc2, 0xae, 0xff, 0xd8,
+        0xdd, 0x2d, 0x8d, 0xf4, 0x5f, 0x91, 0x0c, 0xd1, 0xfb, 0xd3, 0x85, 0xeb,
+        0x0f, 0xfe, 0xf7, 0x63, 0x2b, 0x0a, 0x2b, 0x71, 0x04, 0x30, 0x36, 0xfa,
+        0x76, 0xe3, 0x14, 0x66, 0x78, 0x9a, 0x71, 0x7d, 0x37, 0xf6, 0x77, 0xc1,
+        0x44, 0xd1, 0x33, 0xe1, 0x5f, 0xb5, 0xcd, 0x66, 0x32, 0xe7, 0x11, 0x74,
+        0x76, 0xde, 0xeb, 0xc0, 0x4c, 0x38, 0xb6, 0xd7, 0x58, 0x15, 0x18, 0x3f,
+        0xdd, 0xbe, 0xea, 0x17, 0x81, 0xd0, 0x0f, 0xc3, 0xfc, 0xf5, 0x55, 0x87,
+        0x4d, 0xe2, 0xa6, 0x35, 0x51, 0xb8, 0xd4, 0x6a, 0x7f, 0x74, 0xf6, 0xa9,
+        0x6c, 0x88, 0x58, 0x77, 0x05, 0xc2, 0x24, 0xd5, 0x16, 0xe5, 0x1e, 0xf5,
+        0x61, 0xcd, 0xd7, 0x2d, 0x09, 0xb2, 0xa1, 0xe7, 0x0a, 0x16, 0xdd, 0x1f,
+        0x89, 0x79, 0x97, 0x53, 0xb9, 0xec, 0x78, 0xe1, 0x9e, 0x27, 0x25, 0x60,
+        0x67, 0x9e, 0x1f, 0xc3, 0x69, 0xdb, 0x6c, 0x3a, 0xcd, 0x42, 0xdb, 0x1c,
+        0xb3, 0x4c, 0x97, 0x52, 0xca, 0xaa, 0xfc, 0x78, 0x00, 0xad, 0xb2, 0xde,
+        0xb2, 0x59, 0x2c, 0x17, 0xfa, 0x8e, 0x4b, 0xe0, 0x00, 0x4b, 0xf0, 0xb6,
+        0xa1, 0x46, 0x5f, 0xc8, 0x64, 0xee, 0xc0, 0xcd, 0xdf, 0x97, 0xb3, 0x71,
+        0x0e, 0x27, 0xfc, 0xb4, 0x96, 0x8b, 0x38, 0xee, 0xc6, 0xf4, 0x1d, 0x34,
+        0xef, 0x25, 0x8a, 0xf2, 0x4b, 0xbd, 0x4b, 0x4a, 0x9e, 0x82, 0xef, 0x39,
+        0xc9, 0x2c, 0xba, 0x85, 0x4b, 0xdf, 0xe8, 0x3d, 0x8d, 0x4e, 0x85, 0x5b,
+        0xb8, 0x07, 0x59, 0xd1, 0x0f, 0x6f, 0xb7, 0x98, 0x6b, 0x3c, 0xea, 0xc4,
+        0x70, 0xfb, 0x13, 0x9d, 0xa5, 0x1d, 0x34, 0xbc, 0x0a, 0x61, 0x61, 0x90,
+        0x44, 0x2e, 0x13, 0xa0, 0x50, 0xdd, 0x36, 0xb5, 0xf8, 0x48, 0x78, 0xe9,
+        0xc9, 0x62, 0x7b, 0xa7, 0x39, 0x2a, 0xab, 0x80, 0x95, 0xf3, 0x12, 0x80,
+        0xf6, 0x51, 0x64, 0xb4, 0x87, 0xf2, 0xcd, 0xca, 0x4b, 0x0c, 0x68, 0xc0,
+        0xc8, 0x4c, 0xb4, 0xcf, 0x34, 0x89, 0x2e, 0x3f, 0xda, 0x34, 0xd3, 0xa1,
+        0xbf, 0x23, 0x81, 0xcc, 0x7d, 0x30, 0x55, 0x99, 0xac, 0xc5, 0x9f, 0x13,
+        0xea, 0x8d, 0x18, 0xe8, 0x21, 0xb9, 0x3f, 0xa6, 0x0c, 0xa5, 0x22, 0x59,
+        0x17, 0xbe, 0xee, 0xa3, 0xce, 0xae, 0xde, 0xc5, 0xb7, 0x05
+    },
+    .commitments = {
+        { 0xfd, 0x22, 0x61, 0xb6, 0x2d, 0x4a, 0x70, 0x96, 0x40, 0x05, 0x44, 0x72, 0x03, 0x34, 0x90, 0xb8, 0x3d, 0x18, 0x42, 0x02, 0xe0, 0x26, 0x72, 0xc2, 0xff, 0x12, 0x76, 0x6c, 0x4e, 0x7d, 0x4f, 0x0b },
+        { 0xef, 0xc2, 0xc8, 0xe1, 0x29, 0xb5, 0x1d, 0xc6, 0x2b, 0xcb, 0xdc, 0x3f, 0x3e, 0x1a, 0x58, 0x2c, 0xd2, 0x83, 0xc7, 0x98, 0x07, 0x57, 0x53, 0xcd, 0x83, 0x12, 0x17, 0x33, 0x81, 0xfa, 0x1f, 0x34 },
+        { 0x22, 0x3b, 0xc8, 0xe6, 0x9d, 0x13, 0x2b, 0xdd, 0x85, 0x07, 0x0c, 0xaf, 0x9e, 0x12, 0xa1, 0xbb, 0xe2, 0xe1, 0x4a, 0x63, 0x0b, 0xec, 0x08, 0x44, 0x18, 0x1c, 0x01, 0x4e, 0x57, 0x77, 0xd1, 0x15 },
+        { 0xc2, 0x0a, 0x21, 0xa5, 0xe2, 0x0a, 0x76, 0xd6, 0xc5, 0x05, 0xe9, 0x67, 0xcb, 0x9d, 0x50, 0xd7, 0x53, 0xe3, 0xd1, 0x35, 0x3c, 0xce, 0x32, 0x6e, 0xef, 0x55, 0x5f, 0xa3, 0x31, 0xb6, 0x9c, 0x21 },
+        { 0xd0, 0xc7, 0x3f, 0x0f, 0x98, 0x76, 0x3b, 0xed, 0x8b, 0x14, 0x80, 0x0f, 0x37, 0x88, 0xc9, 0x80, 0x83, 0xc8, 0x0e, 0x1c, 0x88, 0x90, 0x46, 0x64, 0x4c, 0x95, 0x6f, 0x01, 0xe2, 0x4b, 0x1d, 0x38 },
+    },
+    .anchor = {
+        0x3c, 0x18, 0xb6, 0x31, 0xde, 0xa5, 0x35, 0x62, 0xf1, 0xfd, 0x7a, 0xfa,
+        0xeb, 0x88, 0x2d, 0x4f, 0x1f, 0xce, 0xfe, 0x2f, 0x17, 0xa0, 0xf7, 0x0e,
+        0xb8, 0xcc, 0xf9, 0xb7, 0xb8, 0xfc, 0x43, 0x14
+    }
+},
+{
+    .bundle = {
+        0x05, 0xb9, 0x2c, 0x24, 0x30, 0xf2, 0x38, 0x09, 0x01, 0x42, 0xc0, 0x9e,
+        0x05, 0xd2, 0x10, 0xa0, 0x25, 0xf2, 0x18, 0xe6, 0x24, 0x00, 0x24, 0x6d,
+        0xb5, 0x96, 0x76, 0xce, 0x4f, 0x36, 0x89, 0xeb, 0x23, 0xc2, 0xf1, 0x15,
+        0xcf, 0xe9, 0xae, 0x32, 0x6e, 0x0e, 0x01, 0xac, 0xf0, 0xc5, 0x54, 0xe4,
+        0xe8, 0x71, 0x86, 0x80, 0x4c, 0xa1, 0xfc, 0x92, 0x73, 0xd1, 0x5a, 0x9e,
+        0x3d, 0x4f, 0x7f, 0x09, 0x32, 0x26, 0xda, 0x93, 0xa2, 0xdc, 0xb2, 0x53,
+        0x83, 0xbc, 0x30, 0xe4, 0xec, 0x81, 0xa0, 0x8a, 0x42, 0xf1, 0x6e, 0xf6,
+        0x5e, 0x00, 0x90, 0xe8, 0xba, 0x4e, 0xaf, 0xfc, 0x3b, 0x70, 0xcd, 0xe0,
+        0x8e, 0xcf, 0x79, 0xd1, 0xb1, 0x1e, 0x3b, 0xa2, 0x8f, 0xc2, 0x14, 0x8f,
+        0x21, 0xa6, 0x6f, 0xe1, 0x89, 0xe0, 0xff, 0xb6, 0x78, 0x60, 0xd4, 0x91,
+        0x26, 0x5c, 0x18, 0x5a, 0x35, 0xb3, 0x9b, 0xb5, 0x2b, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x33, 0x25, 0x96, 0x2f, 0x3a, 0xca, 0x11,
+        0x3e, 0x81, 0xab, 0x4a, 0xa5, 0x40, 0xab, 0x6e, 0x95, 0x92, 0xc2, 0x48,
+        0x8e, 0xec, 0x5b, 0xd0, 0x7a, 0x4f, 0xdd, 0x07, 0xe3, 0x10, 0x13, 0xdf,
+        0x2d, 0x08, 0xf3, 0xdc, 0x2f, 0xae, 0x85, 0x59, 0x24, 0x93, 0x0d, 0xdd,
+        0xb9, 0xd1, 0xfb, 0x9c, 0x39, 0x6e, 0x48, 0x21, 0x82, 0x68, 0xf4, 0x06,
+        0x6e, 0x11, 0x98, 0x53, 0xcf, 0xbd, 0xfc, 0x0c, 0x3d, 0x26, 0xdd, 0x90,
+        0x6c, 0x9e, 0x7f, 0xff, 0xfe, 0x81, 0x45, 0x5b, 0x92, 0xaf, 0x74, 0x7e,
+        0x83, 0x00, 0xb8, 0xf8, 0x07, 0x89, 0x53, 0x13, 0x9b, 0x7f, 0x3d, 0x1f,
+        0x07, 0xf7, 0x71, 0x24, 0x90, 0x69, 0x00, 0xdb, 0x33, 0x01, 0xa4, 0xfd,
+        0x80, 0x50, 0x2f, 0xa7, 0xf0, 0xcc, 0x83, 0x42, 0x6e, 0x7a, 0xf2, 0x23,
+        0x1f, 0xcf, 0x61, 0x2c, 0x0d, 0x25, 0xb6, 0x84, 0x88, 0x81, 0x3f, 0xcb,
+        0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x24, 0x9c, 0x48,
+        0xf6, 0x44, 0x8a, 0x0c, 0xb3, 0x34, 0xbf, 0x1a, 0xc1, 0xff, 0x26, 0x66,
+        0x59, 0x2e, 0xee, 0x28, 0x4d, 0xf0, 0x35, 0x3b, 0x4c, 0x35, 0x89, 0xbb,
+        0x4a, 0x97, 0xf3, 0xac, 0xa3, 0x13, 0x0b, 0x90, 0xce, 0x8e, 0xc7, 0x9a,
+        0xc7, 0xda, 0x18, 0xdc, 0x36, 0x3c, 0x4f, 0xe5, 0x60, 0xaf, 0x04, 0x3c,
+        0x9b, 0xe9, 0x9d, 0xd3, 0x90, 0x9e, 0xa7, 0x5d, 0xa1, 0xd2, 0xee, 0x2b,
+        0x2a, 0x09, 0xb8, 0x81, 0x7e, 0xd8, 0x1b, 0x3d, 0x55, 0xf2, 0x11, 0x56,
+        0x87, 0x0a, 0xd6, 0xc9, 0xed, 0x4f, 0x9f, 0xda, 0xf9, 0xd9, 0xc7, 0xa9,
+        0xb5, 0xc5, 0x81, 0xf6, 0xc7, 0xf9, 0x0d, 0x66, 0xb9, 0xfb, 0x46, 0x7e,
+        0xfc, 0xa6, 0xe1, 0xd5, 0x48, 0xc9, 0x30, 0x48, 0x75, 0xfc, 0x33, 0xd3,
+        0xe5, 0x64, 0xf2, 0x9e, 0xe0, 0x99, 0x7e, 0xbd, 0x18, 0x7d, 0x98, 0x59,
+        0x10, 0x03, 0x4d, 0xbc, 0x04, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x4d, 0xcc, 0xb6, 0xea, 0xf3, 0xbf, 0x41, 0x66, 0x8f, 0x28, 0x6b,
+        0x08, 0xf6, 0xa1, 0x96, 0x1d, 0xf6, 0x5e, 0xd8, 0x15, 0x36, 0x84, 0xd8,
+        0x7f, 0xc8, 0x9c, 0xf2, 0xee, 0x05, 0x32, 0xa7, 0x39, 0x36, 0x7d, 0xbf,
+        0x26, 0xc4, 0x86, 0x5c, 0xfa, 0xe6, 0xbc, 0x42, 0x09, 0x52, 0x7b, 0x9c,
+        0x4f, 0xd6, 0x9a, 0x81, 0x1e, 0x0f, 0x33, 0x86, 0x31, 0xd4, 0xea, 0x3d,
+        0x82, 0x9e, 0x74, 0xea, 0x2c, 0x18, 0xca, 0x7b, 0x21, 0x0c, 0x5e, 0x62,
+        0x01, 0x0a, 0xfa, 0x2f, 0x18, 0x8c, 0x98, 0x82, 0x12, 0xa9, 0x3f, 0x53,
+        0xda, 0xd2, 0x92, 0x76, 0xaa, 0x4d, 0x66, 0xbd, 0x7e, 0x60, 0x0f, 0xa1,
+        0x24, 0x39, 0x0e, 0xaf, 0x40, 0x8e, 0x20, 0x9e, 0xf0, 0x69, 0xe1, 0xb3,
+        0xe6, 0xbc, 0x63, 0xba, 0xce, 0x32, 0xd2, 0xf0, 0x68, 0x39, 0xd1, 0xfe,
+        0xd8, 0x18, 0x17, 0xbf, 0xcc, 0x1f, 0x6f, 0xa6, 0x14, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x84, 0xf2, 0x98, 0xa4, 0x78, 0x80, 0x6d,
+        0x99, 0x2e, 0x11, 0xc4, 0xd4, 0xca, 0xe3, 0xc0, 0xf2, 0x5b, 0x1e, 0x17,
+        0x34, 0xf4, 0x64, 0xdf, 0xea, 0xdb, 0x07, 0x61, 0x21, 0x32, 0x78, 0xfa,
+        0x10, 0x06, 0xc4, 0xc8, 0x7f, 0xf8, 0xf6, 0x35, 0xac, 0x38, 0xfe, 0x94,
+        0x86, 0x1b, 0x3f, 0x34, 0x38, 0x56, 0x0f, 0x66, 0xfb, 0x12, 0xdc, 0x00,
+        0x1e, 0xab, 0xfd, 0x2e, 0x0d, 0x74, 0x28, 0xe6, 0x34, 0x5c, 0xbb, 0x44,
+        0x4b, 0x44, 0xa5, 0xb3, 0xf4, 0xcf, 0x81, 0x56, 0x88, 0x19, 0xa8, 0xdc,
+        0xf0, 0xe7, 0xfd, 0x53, 0x01, 0x2d, 0x62, 0xf4, 0xa2, 0xb3, 0x2d, 0x58,
+        0x9b, 0xc4, 0xa1, 0x97, 0x8e, 0xee, 0x60, 0xdf, 0x35, 0x19, 0xe0, 0xd9,
+        0xb0, 0x77, 0xf3, 0xcc, 0x29, 0x7c, 0x62, 0x0e, 0xdd, 0xd5, 0x2e, 0x1e,
+        0x22, 0xb3, 0x7c, 0xe5, 0x5e, 0xc9, 0xf8, 0xe3, 0xc3, 0x37, 0x0f, 0xb3,
+        0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x03, 0x60, 0xb9,
+        0x36, 0xb5, 0xf9, 0x96, 0x02, 0x00, 0xb9, 0x2a, 0x35, 0x91, 0x4f, 0x5f,
+        0xc2, 0x9c, 0x0e, 0x11, 0x27, 0xa5, 0x63, 0xba, 0x91, 0x11, 0x32, 0xce,
+        0x03, 0xdf, 0x90, 0x33, 0xe5, 0x84, 0x0e, 0x70, 0xf8, 0x67, 0x5f, 0xc6,
+        0xae, 0x2c, 0xfd, 0xb5, 0x07, 0x6b, 0xa0, 0x28, 0xf3, 0x6e, 0x8f, 0x04,
+        0x83, 0xf8, 0x2c, 0x37, 0x69, 0x02, 0x86, 0x85, 0x6d, 0x10, 0xb9, 0x81,
+        0x08, 0x46, 0xd4, 0xad, 0x8d, 0xf2, 0x4d, 0x6a, 0x01, 0x0a, 0x82, 0x9c,
+        0xc2, 0xdf, 0x61, 0xc7, 0x75, 0x3d, 0x35, 0x5e, 0x62, 0x85, 0xb3, 0x7d,
+        0x4e, 0x28, 0xdb, 0xba, 0xf1, 0xd9, 0xf2, 0x20, 0x6c, 0x79, 0xb5, 0x64,
+        0x41, 0x0b, 0x2d, 0xf9, 0x25, 0x01, 0x4a, 0x82, 0x71, 0x00, 0xad, 0x8a,
+        0xf2, 0x28, 0xdc, 0x9f, 0xec, 0xb7, 0x7c, 0x49, 0xb0, 0x9f, 0x34, 0xed,
+        0x4e, 0xfd, 0x35, 0x2e, 0x8d, 0xda, 0xa7, 0xaa, 0x62, 0xf8, 0xa8, 0x25,
+        0xb8, 0x46, 0x81, 0x88, 0xc1, 0x0c, 0xb9, 0xb1, 0x9b, 0xca, 0xd3, 0xc7,
+        0xe8, 0xc8, 0xc0, 0x89, 0x1d, 0xdc, 0x65, 0xdc, 0x1c, 0x11, 0x6d, 0x9b,
+        0xf2, 0x8c, 0xfa, 0x11, 0x5d, 0x25, 0x73, 0xb0, 0x66, 0x42, 0x38, 0x63,
+        0xe8, 0xac, 0xd7, 0x8c, 0xb7, 0xe6, 0x8e, 0x99, 0xc3, 0xc9, 0x24, 0xbe,
+        0xf3, 0xf6, 0x0c, 0x91, 0xc8, 0x79, 0x56, 0x63, 0x9d, 0xfe, 0x2a, 0xb0,
+        0xab, 0x7f, 0xaa, 0x07, 0xd9, 0x74, 0xbc, 0xdc, 0xd5, 0x68, 0xaa, 0x0f,
+        0xbb, 0xd4, 0x30, 0x15, 0x04, 0x1f, 0xdc, 0xc1, 0x69, 0x18, 0x9b, 0xe3,
+        0x64, 0x74, 0xb5, 0xf1, 0x5c, 0xc6, 0x42, 0x16, 0x8d, 0xd6, 0x15, 0x05,
+        0xfe, 0x56, 0x99, 0x53, 0x68, 0x2c, 0x50, 0xd6, 0x6d, 0x41, 0x48, 0x21,
+        0xf7, 0x89, 0x8b, 0x76, 0x6a, 0xc5, 0xa6, 0xe7, 0xfd, 0x25, 0xcb, 0x9e,
+        0x55, 0x1a, 0xdd, 0x49, 0x31, 0x95, 0x85, 0x94, 0xd5, 0xd1, 0xe5, 0x8b,
+        0x84, 0x85, 0xf3, 0x27, 0x2f, 0x5b, 0xb4, 0x7b, 0x2c, 0x72, 0xc1, 0x5f,
+        0x3e, 0x75, 0x0e, 0x82, 0xe5, 0x21, 0xc7, 0x78, 0x4e, 0x89, 0xad, 0x6f,
+        0x96, 0xf2, 0x9c, 0x23, 0x03, 0x9c, 0x45, 0xae, 0xa8, 0xe1, 0xc2, 0x09,
+        0x27, 0xbc, 0xe8, 0x9f, 0xd7, 0xbd, 0xe6, 0x97, 0x40, 0xf8, 0x07, 0x7a,
+        0x31, 0x8b, 0xdd, 0xbc, 0xf3, 0x01, 0xa9, 0x5f, 0x06, 0x89, 0x36, 0x21,
+        0x40, 0x39, 0x59, 0xd5, 0x2e, 0x27, 0x6d, 0x93, 0xf4, 0x88, 0x46, 0xce,
+        0x07, 0x47, 0x47, 0xb5, 0x70, 0xa8, 0xfc, 0x3b, 0x98, 0x0b, 0xa4, 0xdb,
+        0x04, 0x06, 0xb2, 0x66, 0x6b, 0x51, 0x0e, 0x0f, 0xd4, 0xbf, 0x09, 0x01,
+        0x81, 0xbe, 0x3d, 0xf5, 0xf2, 0x96, 0x25, 0xaa, 0x7c, 0xc7, 0x5a, 0xc3,
+        0x60, 0xe1, 0xad, 0x2d, 0x24, 0x02, 0xab, 0x7f, 0x6a, 0x85, 0xda, 0x30,
+        0xf0, 0xef, 0x8d, 0x13, 0x64, 0x34, 0xd5, 0x2b, 0xa1, 0xa5, 0x00, 0x8e,
+        0x6b, 0xd9, 0x89, 0xa6, 0xd8, 0xcc, 0xba, 0xce, 0x25, 0x8a, 0xd5, 0x46,
+        0x8e, 0x16, 0xa0, 0x7a, 0x61, 0x53, 0x17, 0xba, 0x7a, 0xa8, 0xf1, 0x62,
+        0x43, 0x01, 0xed, 0xb7, 0x20, 0xc4, 0x61, 0xbc, 0x80, 0xe6, 0xd6, 0x62,
+        0xa5, 0x90, 0x44, 0x7b, 0xd5, 0xc8, 0x54, 0x6e, 0xb7, 0x9e, 0xbb, 0x25,
+        0x92, 0x93, 0x4e, 0x6d, 0x6c, 0xc8, 0xf6, 0x1b, 0x4d, 0x80, 0x1d, 0xc5,
+        0xc7, 0xb7, 0x4c, 0x26, 0xfc, 0x06, 0x72, 0x8e, 0x7e, 0x62, 0x77, 0xba,
+        0x5b, 0x78, 0x10, 0x65, 0xf2, 0x83, 0x02, 0xa1, 0x69, 0x99, 0x06, 0xa8,
+        0xa9, 0xc2, 0xdb, 0xff, 0x37, 0xfd, 0xb1, 0x27, 0x91, 0xe0, 0xca, 0xc0,
+        0x61, 0xb5, 0x3b, 0xa5, 0x66, 0xf7, 0x1d, 0x4f, 0xe6, 0x05, 0xc6, 0xa8,
+        0x44, 0xac, 0x18, 0x25, 0x29, 0xaa, 0x19, 0x7a, 0x04, 0x5b, 0xd3, 0xa1,
+        0xba, 0xc4, 0xc5, 0xaa, 0x9a, 0x99, 0x16, 0xd1, 0xfd, 0x9b, 0x71, 0xda,
+        0xc7, 0x85, 0x9e, 0x44, 0xc6, 0x34, 0x1b, 0xf8, 0x2b, 0x91, 0xfe, 0x49,
+        0x1c, 0x51, 0x05, 0x12, 0xbe, 0x7b, 0xff, 0x0e, 0x61, 0x14, 0xe1, 0xe9,
+        0xec, 0x8f, 0x35, 0xe4, 0xcc, 0xc2, 0x14, 0xb2, 0x0e, 0xf3, 0x9c, 0x09,
+        0xe9, 0x79, 0xb8, 0x7e, 0xa2, 0x00, 0x6e, 0x08, 0x88, 0xec, 0x99, 0x4a,
+        0x50, 0x5c, 0x42, 0xe0, 0x18, 0xd5, 0xe8, 0x3b, 0x8c, 0xfc, 0xc1, 0x58,
+        0x4b, 0xda, 0xe0, 0x9a, 0xa7, 0xb2, 0x3a, 0xde, 0x8d, 0xbf, 0xf5, 0x81,
+        0xe5, 0x73, 0x3a, 0xc3, 0xfe, 0x5e, 0x2d, 0x7d, 0x19, 0x6b, 0x70, 0xcc,
+        0xd2, 0xfe, 0xbd, 0x8e, 0x05, 0x26, 0x43, 0xd0, 0x1d, 0x2f, 0x48, 0x3b,
+        0x6c, 0x05, 0xe6, 0x29, 0x84, 0x6c, 0x7a, 0x0e, 0xb4, 0xbd, 0x79, 0x7a,
+        0x33, 0x25, 0x24, 0x90, 0xb1, 0x78, 0xa2, 0x85, 0xa1, 0x05, 0xca, 0xc2,
+        0x99, 0xd9, 0x71, 0x34, 0x37, 0x28, 0xd2, 0x67, 0x65, 0xb6, 0x9e, 0x40,
+        0x38, 0xcf, 0xa7, 0xe9, 0x4e, 0x18, 0x0a, 0x80, 0x3d, 0x8a, 0xe8, 0x13,
+        0x18, 0x56, 0x94, 0xb6, 0x50, 0xdd, 0x35, 0x1f, 0xdc, 0x0d, 0x26, 0xf8,
+        0xcc, 0x79, 0xa7, 0xbc, 0xd9, 0xcd, 0xfa, 0x5c, 0x45, 0xa0, 0x94, 0x05,
+        0x9a, 0x75, 0xdb, 0x4a, 0xda, 0xea, 0x93, 0x60, 0x57, 0xe8, 0x19, 0x04,
+        0x55, 0x49, 0x79, 0x3a, 0x3f, 0xb5, 0xb3, 0x9a, 0xe4, 0x15, 0x29, 0xdd,
+        0xe3, 0x5f, 0xea, 0x1b, 0xf8, 0x11, 0x67, 0x7e, 0x94, 0xd1, 0xc3, 0x98,
+        0xff, 0x78, 0xc0, 0x6e, 0xdf, 0xae, 0xa2, 0xf8, 0xef, 0xf5, 0x02, 0x45,
+        0x93, 0x8a, 0xd9, 0x38, 0x37, 0x25, 0x2c, 0x89, 0x57, 0xff, 0xa2, 0x62,
+        0xe5, 0x83, 0x4f, 0xf4, 0xd5, 0x76, 0x13, 0xa3, 0x73, 0x46, 0x4e, 0x0f,
+        0xac, 0xc0, 0x0a, 0xa4, 0x1a, 0xbb, 0xd4, 0xab, 0xe9, 0x65, 0xa7, 0x57,
+        0xc7, 0x40, 0xf4, 0xc1, 0x13, 0xb2, 0x36, 0xe5, 0xe0, 0x26, 0xf7, 0xf6,
+        0x71, 0x70, 0xd5, 0x99, 0x25, 0x14, 0x72, 0x7c, 0x35, 0xe9, 0x7c, 0x65,
+        0xf8, 0x6f, 0x42, 0xe6, 0x32, 0xf1, 0xc8, 0x84, 0xe5, 0x3e, 0x74, 0x94,
+        0xf4, 0xf3, 0xa8, 0xc3, 0xe0, 0x78, 0xfe, 0xde, 0xee, 0x68, 0xd3, 0x47,
+        0x0b, 0x51, 0x19, 0x35, 0x26, 0x42, 0x51, 0x43, 0x4f, 0x9c, 0x88, 0x32,
+        0xb1, 0xf0, 0x07, 0xc5, 0x8c, 0xda, 0xe2, 0xbe, 0x55, 0x16, 0x0d, 0x0d,
+        0x89, 0xcc, 0x68, 0x51, 0x59, 0xa1, 0xaa, 0x90, 0xbd, 0xb1, 0x05, 0x8b,
+        0x1d, 0xfa, 0x6f, 0x36, 0x3f, 0xd6, 0x96, 0x9f, 0x3d, 0x50, 0x10, 0x7c,
+        0xd8, 0xf6, 0xe9, 0x41, 0xdf, 0xee, 0xf0, 0x62, 0xcc, 0xe6, 0xcd, 0x8c,
+        0xd5, 0x42, 0xfa, 0xe9, 0xe4, 0x72, 0x3d, 0x2b, 0x37, 0xe0, 0x9c, 0x17,
+        0xac, 0x6a, 0x1c, 0x3b, 0xdd, 0x14, 0xd1, 0xe1, 0xea, 0x00, 0x3a, 0xe7,
+        0xcf, 0x81, 0xf0, 0x46, 0xb1, 0xd6, 0x35, 0xd7, 0x07, 0x5b, 0xc1, 0x6c,
+        0x00, 0xb9, 0x83, 0x1f, 0x48, 0xc9, 0xd4, 0x1e, 0x25, 0x18, 0x66, 0x4d,
+        0xe7, 0xab, 0xba, 0xfe, 0x01, 0x6c, 0xb0, 0xff, 0x5c, 0xb4, 0xfb, 0x2a,
+        0x01, 0x1d, 0x67, 0x6d, 0x65, 0xb7, 0xaa, 0x41, 0xcc, 0x33, 0xe3, 0x8e,
+        0x0a, 0xfc, 0x6f, 0x6c, 0x09, 0x1e, 0xf9, 0x9b, 0xc5, 0x5b, 0x14, 0xb9,
+        0xef, 0x89, 0xee, 0x6d, 0xa0, 0xad, 0x4e, 0x31, 0xbb, 0xa3, 0xa0, 0xc2,
+        0xcf, 0xfa, 0x9d, 0x1b, 0x80, 0xb6, 0x76, 0xe9, 0x45, 0xe8, 0x9f, 0xc0,
+        0xca, 0xc9, 0x6f, 0x4f, 0x1d, 0x82, 0xbf, 0xa6, 0x11, 0x96, 0x1f, 0x5b,
+        0x3b, 0x83, 0xbe, 0x15, 0xec, 0xdc, 0xe9, 0x2c, 0xbe, 0x00, 0x37, 0x85,
+        0x59, 0x40, 0xdb, 0x50, 0xca, 0xd5, 0x0e, 0x50, 0x3b, 0xf8, 0x3e, 0x97,
+        0x04, 0xea, 0xe5, 0x64, 0xf1, 0x99, 0x66, 0x0a, 0xc0, 0x92, 0xce, 0x94,
+        0x42, 0x5a, 0x41, 0x80, 0x11, 0xa4, 0xea, 0x0e, 0xe7, 0xb4, 0x61, 0x67,
+        0x14, 0xb8, 0xe0, 0xd3, 0x1e, 0x28, 0x83, 0x39, 0x1f, 0x41, 0x4c, 0xde,
+        0xf9, 0xe9, 0xbd, 0x95, 0x47, 0x1d, 0xe8, 0x96, 0x58, 0xd4, 0x0d, 0x37,
+        0x4b, 0x9a, 0x11, 0x50, 0xd6, 0x12, 0x9a, 0xf7, 0x70, 0x18, 0xba, 0xf7,
+        0x69, 0xa5, 0x28, 0x38, 0x52, 0x3a, 0x73, 0x26, 0xc0, 0xe7, 0x84, 0x3e,
+        0xd6, 0xd0, 0xbc, 0x75, 0xd1, 0xf5, 0xd5, 0x87, 0x42, 0xd8, 0x11, 0xdb,
+        0x4a, 0x2a, 0xe0, 0xa0, 0x4a, 0x34, 0x85, 0x1c, 0x54, 0xfc, 0x03, 0xc4,
+        0x6c, 0xd8, 0x36, 0x79, 0x4c, 0x4b, 0x1c, 0x7f, 0x2f, 0x73, 0x02, 0xd7,
+        0x65, 0x3d, 0x9b, 0x43, 0x2a, 0x1a, 0x41, 0xb6, 0xb4, 0xa6, 0x90, 0xb7,
+        0xa2, 0xfc, 0x91, 0xf4, 0x02, 0x66, 0x37, 0x5a, 0x50, 0xd7, 0x24, 0xfa,
+        0x40, 0x7e, 0x28, 0x79, 0x4a, 0x85, 0xba, 0x98, 0x55, 0x76, 0x3f, 0x87,
+        0x6d, 0x49, 0x2d, 0x11, 0x62, 0xa3, 0x48, 0x12, 0xb9, 0x03, 0xca, 0x1e,
+        0xe7, 0xb2, 0xd2, 0x60, 0x5a, 0xd1, 0x1e, 0x33, 0xc5, 0xfb, 0x64, 0x7a,
+        0x6b, 0x64, 0x24, 0x55, 0x4e, 0x81, 0x37, 0x1f, 0xb7, 0xcc, 0xba, 0x03,
+        0x61, 0xc7, 0x35, 0x35, 0xef, 0x1c, 0x0e, 0x78, 0xbe, 0xd4, 0xb8, 0x8a,
+        0xe2, 0x6c, 0x39, 0x40, 0xab, 0x3b, 0x77, 0xbe, 0x4d, 0x99, 0x30, 0x9d,
+        0xd5, 0xc9, 0xf3, 0x15, 0x02, 0xb6, 0xdd, 0x10, 0x1f, 0x7a, 0x99, 0x3d,
+        0x04, 0x2a, 0xd8, 0x45, 0xfa, 0x20, 0x38, 0x94, 0x91, 0xdc, 0x51, 0xea,
+        0x0d, 0xe0, 0xa8, 0xe2, 0x58, 0x5b, 0xda, 0x6f, 0xaf, 0x0a, 0x6c, 0x8c,
+        0x29, 0xfd, 0xcf, 0xfe, 0x8e, 0x03, 0x1f, 0x07, 0x82, 0xd5, 0xfb, 0x5e,
+        0xf6, 0x2a, 0x9b, 0xa8, 0x0d, 0x1c, 0x6a, 0xe7, 0xa9, 0x5a, 0x96, 0x92,
+        0x62, 0xc1, 0x03, 0x1b, 0x60, 0x98, 0x76, 0x2b, 0xad, 0x0e, 0x1d, 0x01,
+        0x4d, 0x77, 0x03, 0x3e, 0x3c, 0xd6, 0x35, 0x4e, 0x05, 0x96, 0xd2, 0x47,
+        0x0b, 0x79, 0x14, 0x8e, 0x46, 0xc7, 0x5d, 0x4b, 0xb7, 0x6f, 0x25, 0xe6,
+        0x45, 0xed, 0x57, 0xeb, 0x16, 0xa2, 0xbc, 0x6e, 0xf5, 0x56, 0xdb, 0x47,
+        0xcb, 0x8b, 0xa9, 0xa0, 0xcc, 0x2d, 0x2a, 0xe7, 0xe0, 0x63, 0xea, 0x30,
+        0x73, 0x89, 0x09, 0xd4, 0xa9, 0x2d, 0xce, 0x8c, 0xba, 0x65, 0xb8, 0xa6,
+        0x25, 0xd7, 0x12, 0xf1, 0xca, 0x45, 0x50, 0x78, 0x0b, 0xb9, 0xb0, 0x07,
+        0x3e, 0x6b, 0x11, 0x2e, 0x3c, 0x6d, 0x42, 0x1d, 0xc7, 0xc4, 0x6e, 0xe8,
+        0xc6, 0x30, 0xe8, 0xcc, 0x06, 0x29, 0x45, 0x22, 0x16, 0x82, 0xfb, 0x18,
+        0x08, 0xab, 0xe0, 0x79, 0x3e, 0x5e, 0x14, 0x78, 0xea, 0x71, 0x11, 0x85,
+        0x0d, 0x5d, 0x0d, 0x18, 0xcf, 0x1a, 0x9c, 0x17, 0xc1, 0x4e, 0x39, 0x10,
+        0x8c, 0x85, 0x4f, 0xf0, 0x6f, 0x9e, 0xa5, 0x33, 0x75, 0x48, 0x7b, 0x83,
+        0xb3, 0x3b, 0x11, 0xb8, 0x23, 0xda, 0xc2, 0x7b, 0xe8, 0x43, 0xf8, 0xd7,
+        0xf1, 0x0f, 0x87, 0x06, 0xbc, 0x3e, 0x7d, 0x66, 0x8e, 0xac, 0x6d, 0xdb,
+        0x37, 0x46, 0x19, 0x5e, 0x70, 0x56, 0x8a, 0xcd, 0x64, 0x24, 0x63, 0xc3,
+        0xc3, 0x16, 0xa4, 0x74, 0xc9, 0xd9, 0x62, 0x46, 0x0d, 0x8d, 0xb5, 0xf5,
+        0x6c, 0x25, 0x9c, 0x2e, 0x8f, 0x15, 0x90, 0x8a, 0x88, 0xc5, 0x74, 0x8f,
+        0xc3, 0x4c, 0x7b, 0x47, 0xcc, 0xa1, 0x23, 0xf1, 0x9b, 0x5a, 0x9a, 0x57,
+        0xf1, 0x41, 0xbb, 0xc6, 0x9c, 0xc8, 0xc3, 0xd7, 0x7f, 0xd9, 0x72, 0x1c,
+        0x01, 0xfc, 0x31, 0xe5, 0x8c, 0x8d, 0x5d, 0xce, 0x95, 0x98, 0x2f, 0x9a,
+        0xd5, 0xfd, 0x01, 0x5f, 0xe3, 0xdb, 0x77, 0xe4, 0x8f, 0x6a, 0xab, 0xa8,
+        0x8f, 0x4c, 0x2a, 0xa0, 0x5b, 0xc8, 0x0a, 0x4c, 0x03, 0x00, 0xd2, 0x28,
+        0xb6, 0x54, 0x26, 0x6b, 0x69, 0xfc, 0x70, 0x58, 0x38, 0x88, 0x4a, 0xa9,
+        0xc3, 0xb0, 0x0c, 0x98, 0x5b, 0xa6, 0x93, 0x79, 0x85, 0xa2, 0x6f, 0x67,
+        0xc2, 0xa1, 0x06, 0xdb, 0xbf, 0x31, 0x94, 0x4f, 0x17, 0xf0, 0xdb, 0xcb,
+        0x37, 0xd2, 0xa7, 0xa7, 0xb0, 0xf7, 0x3a, 0x4e, 0x62, 0xcc, 0x7c, 0x7a,
+        0x63, 0x05, 0x1c, 0x16, 0x67, 0x8d, 0x12, 0x4c, 0xd9, 0xb8, 0xfb, 0x56,
+        0x77, 0xdd, 0xfe, 0x93, 0xaa, 0xb8, 0x93, 0x1f, 0xbb, 0x16, 0x23, 0x02,
+        0xc6, 0xe0, 0x70, 0x00, 0x12, 0xd4, 0x95, 0xd9, 0xa4, 0xfb, 0xf4, 0x80,
+        0x77, 0xcb, 0x00, 0x6a, 0x99, 0x40, 0x72, 0x6f, 0x0a, 0xb5, 0xce, 0x36,
+        0xc2, 0x7a, 0xc4, 0x03, 0x5a, 0x2d, 0xa0, 0xf6, 0x52, 0x9b, 0x9d, 0x5f,
+        0x5b, 0x7a, 0x89, 0x01, 0x09, 0x22, 0xd1, 0x87, 0xae, 0xe8, 0x05, 0xbc,
+        0x53, 0x61, 0x96, 0x6d, 0x2f, 0x97, 0x03, 0xb1, 0x7d, 0xa4, 0xed, 0x9e,
+        0x46, 0xed, 0xf8, 0x4b, 0x5c, 0xa8, 0xb0, 0xaf, 0x9d, 0x37, 0xef, 0xd8,
+        0x26, 0x05, 0x5a, 0x26, 0xd2, 0x0d, 0x8d, 0x85, 0xa3, 0x3a, 0x97, 0x62,
+        0x6c, 0x04, 0xd7, 0xf7, 0x4d, 0xbf, 0x0e, 0x4b, 0x7d, 0xc7, 0xfe, 0x2e,
+        0x53, 0x79, 0xa5, 0x12, 0x3b, 0x26, 0xfa, 0x80, 0x21, 0xc7, 0x21, 0xf8,
+        0xc4, 0x3f, 0x77, 0x9e, 0xb9, 0x37, 0x9a, 0x1b, 0xa0, 0xdd, 0xe9, 0x34,
+        0x47, 0xad, 0xdf, 0xf5, 0x70, 0x9e, 0x14, 0x56, 0x43, 0x6e, 0x75, 0xb1,
+        0x78, 0x43, 0x8f, 0xea, 0xd2, 0x09, 0x3a, 0x65, 0x18, 0x81, 0xd7, 0x3b,
+        0xde, 0x32, 0xba, 0x59, 0x33, 0x18, 0xe8, 0xe5, 0x9c, 0x0c, 0xe4, 0xaa,
+        0x76, 0x19, 0x39, 0x74, 0x9f, 0x4c, 0x07, 0x92, 0x53, 0x80, 0x3a, 0xb1,
+        0x90, 0xc8, 0xce, 0x32, 0x3b, 0x07, 0x46, 0x8d, 0x21, 0x76, 0x52, 0x70,
+        0x1d, 0x83, 0x2e, 0x7f, 0x0e, 0x29, 0xde, 0x48, 0x32, 0x2e, 0xda, 0xab,
+        0xa5, 0xc8, 0xb9, 0x09, 0x7a, 0xe0, 0x44, 0xa3, 0x72, 0x3c, 0xac, 0x8f,
+        0xbc, 0xd4, 0xdc, 0x3e, 0xd2, 0x5f, 0xd1, 0x53, 0x15, 0x82, 0x81, 0x3d,
+        0x56, 0x01, 0xa3, 0xd9, 0xb6, 0x63, 0x7d, 0xfc, 0x71, 0xe9, 0x90, 0x99,
+        0x5d, 0x20, 0xf9, 0x8a, 0xc2, 0x86, 0xb6, 0xe0, 0x73, 0x17, 0xe9, 0xbd,
+        0x25, 0x94, 0xd3, 0xa1, 0x9b, 0xd9, 0xe4, 0x51, 0xc2, 0x52, 0x8a, 0x53,
+        0x09, 0x48, 0x49, 0xe7, 0xa7, 0x67, 0xe6, 0x5b, 0xf0, 0xb6, 0xc4, 0xa8,
+        0xa5, 0xb3, 0x58, 0x88, 0xe2, 0x37, 0xde, 0xdf, 0x95, 0x99, 0xde, 0x2c,
+        0xc1, 0xd0, 0x9d, 0x92, 0xac, 0xca, 0x5d, 0xdd, 0x14, 0xec, 0x59, 0x00,
+        0xa0, 0x51, 0xbd, 0xdb, 0xb3, 0x1c, 0xf8, 0xe4, 0x8e, 0x63, 0xc2, 0x69,
+        0x1f, 0x96, 0x57, 0xf7, 0x43, 0x63, 0xde, 0x89, 0xc8, 0x48, 0x71, 0x03,
+        0x91, 0x45, 0xb4, 0x68, 0x67, 0xc0, 0x6f, 0xdb, 0x1f, 0xdb, 0xcd, 0x02,
+        0x01, 0xdb, 0xd4, 0x83, 0x01, 0x70, 0x5f, 0xfa, 0xdf, 0x10, 0xed, 0x67,
+        0xaf, 0xa1, 0x42, 0xf2, 0x3a, 0x2f, 0xb8, 0x35, 0x1a, 0x98, 0xa6, 0x6b,
+        0x42, 0xd9, 0x62, 0x70, 0x68, 0xf3, 0x8a, 0x15, 0x90, 0x6d, 0x98, 0x51,
+        0x65, 0x0b, 0xda, 0xcd, 0xd7, 0x1c, 0xf4, 0x7e, 0x34, 0x2e, 0x5b, 0xc4,
+        0x61, 0xdc, 0xb6, 0x81, 0x5f, 0x92, 0x42, 0x43, 0xc9, 0xd6, 0x54, 0x51,
+        0x90, 0x6a, 0x90, 0xb6, 0x05, 0xc1, 0xf2, 0x95, 0x5f, 0x06, 0xb7, 0x89,
+        0xa2, 0x7f, 0x08, 0x22, 0x5a, 0x42, 0xe5, 0xd9, 0xd6, 0x58, 0x35, 0xb9,
+        0x7d, 0x14, 0x99, 0xb3, 0x26, 0x20, 0xc3, 0xd7, 0x6b, 0x79, 0x0e, 0x0a,
+        0x57, 0xf6, 0x0c, 0x86, 0x92, 0x87, 0xb2, 0x00, 0x3c, 0x4c, 0x9b, 0x91,
+        0x3d, 0x32, 0x4b, 0xfd, 0xd0, 0xb2, 0xf8, 0xa9, 0x84, 0x7d, 0x42, 0x19,
+        0x6d, 0x39, 0xe7, 0x3c, 0xb5, 0x86, 0x7d, 0xad, 0x4b, 0xa8, 0x8c, 0xa5,
+        0xf5, 0xbc, 0xfb, 0xf7, 0x70, 0xd0, 0x89, 0x3e, 0xa6, 0x74, 0x07, 0xa0,
+        0xaf, 0xb6, 0x95, 0x6f, 0x85, 0xa4, 0x16, 0x01, 0xa6, 0xb8, 0x4a, 0xaf,
+        0x99, 0x07, 0x03, 0x3e, 0xc9, 0xa6, 0x98, 0x87, 0xd0, 0x26, 0x25, 0xb0,
+        0x47, 0xae, 0xdf, 0xa2, 0xf4, 0xcb, 0x58, 0xc2, 0xa5, 0x2c, 0x02, 0x7d,
+        0x81, 0xd0, 0xba, 0xb1, 0x89, 0x0b, 0x5a, 0x53, 0x40, 0xc0, 0x96, 0x2f,
+        0xf8, 0x31, 0xec, 0xc5, 0xe9, 0x18, 0x97, 0xe0, 0xda, 0xf1, 0xdf, 0xfd,
+        0x28, 0xbc, 0x02, 0xfc, 0x46, 0xb0, 0x03, 0x03, 0x4f, 0x26, 0x29, 0x10,
+        0x94, 0x93, 0xab, 0x09, 0x59, 0xb5, 0xed, 0xd5, 0xa7, 0x3a, 0x08, 0x35,
+        0xa6, 0x7e, 0x7b, 0x68, 0x4e, 0xb6, 0xd2, 0x13, 0x30, 0x09, 0x85, 0x2b,
+        0x76, 0xad, 0xe2, 0xf5, 0x21, 0x13, 0xee, 0x71, 0xa6, 0x12, 0x3f, 0x51,
+        0x32, 0xa8, 0xb7, 0xad, 0x13, 0xfe, 0x4c, 0x2f, 0xf7, 0x4e, 0xab, 0xb6,
+        0x58, 0xf4, 0xe9, 0xbd, 0x7b, 0x4b, 0x05, 0x10, 0x45, 0x80, 0xea, 0xdb,
+        0xe9, 0x97, 0x43, 0x2d, 0xc3, 0x0c, 0x45, 0x15, 0x2a, 0x15, 0xcd, 0xc6,
+        0xec, 0x15, 0xb2, 0x36, 0xef, 0xbd, 0x31, 0x3d, 0xe1, 0x36, 0x3c, 0x49,
+        0x82, 0xdd, 0xa9, 0x5a, 0xb1, 0xf1, 0x6f, 0x6a, 0x57, 0x24, 0x83, 0x2e,
+        0xf8, 0x05, 0xdb, 0x84, 0x07, 0x43, 0x61, 0x7f, 0xd0, 0xbb, 0xb6, 0x1a,
+        0x42, 0xe4, 0xad, 0xf2, 0xf6, 0xbb, 0x49, 0x31, 0x9f, 0xbf, 0xd1, 0xb7,
+        0xc3, 0x34, 0xf3, 0xb0, 0x16, 0xe2, 0x56, 0x39, 0x44, 0x0e, 0x35, 0x75,
+        0x4a, 0x5d, 0x82, 0xbc, 0xd8, 0xee, 0x2f, 0xfa, 0xbb, 0x38, 0x1c, 0xff,
+        0x91, 0x49, 0x3b, 0x83, 0xe5, 0x8a, 0xb4, 0x27, 0x94, 0xed, 0x38, 0x6e,
+        0xde, 0x33, 0x8e, 0x12, 0xa9, 0x12, 0x9b, 0x08, 0x38, 0x38, 0xc0, 0xce,
+        0x00, 0xe0, 0x1d, 0xe9, 0x3f, 0x60, 0x8a, 0x89, 0x07, 0x57, 0x75, 0x1b,
+        0x6a, 0xc0, 0x0b, 0x23, 0x32, 0xd0, 0xd2, 0xa4, 0x1a, 0xda, 0xa5, 0x50,
+        0x1e, 0xbc, 0x70, 0x47, 0x39, 0xab, 0x66, 0x94, 0x4e, 0x2c, 0x02, 0x5a,
+        0x57, 0xe4, 0xbf, 0x19, 0xf8, 0x1f, 0xa2, 0xe7, 0x59, 0xf7, 0xee, 0x7c,
+        0xbd, 0x85, 0xbb, 0xa6, 0x0e, 0x41, 0x1a, 0x41, 0xec, 0x0b
+    },
+    .commitments = {
+        { 0xcf, 0x79, 0xd1, 0xb1, 0x1e, 0x3b, 0xa2, 0x8f, 0xc2, 0x14, 0x8f, 0x21, 0xa6, 0x6f, 0xe1, 0x89, 0xe0, 0xff, 0xb6, 0x78, 0x60, 0xd4, 0x91, 0x26, 0x5c, 0x18, 0x5a, 0x35, 0xb3, 0x9b, 0xb5, 0x2b },
+        { 0x69, 0x00, 0xdb, 0x33, 0x01, 0xa4, 0xfd, 0x80, 0x50, 0x2f, 0xa7, 0xf0, 0xcc, 0x83, 0x42, 0x6e, 0x7a, 0xf2, 0x23, 0x1f, 0xcf, 0x61, 0x2c, 0x0d, 0x25, 0xb6, 0x84, 0x88, 0x81, 0x3f, 0xcb, 0x11 },
+        { 0xfb, 0x46, 0x7e, 0xfc, 0xa6, 0xe1, 0xd5, 0x48, 0xc9, 0x30, 0x48, 0x75, 0xfc, 0x33, 0xd3, 0xe5, 0x64, 0xf2, 0x9e, 0xe0, 0x99, 0x7e, 0xbd, 0x18, 0x7d, 0x98, 0x59, 0x10, 0x03, 0x4d, 0xbc, 0x04 },
+        { 0x39, 0x0e, 0xaf, 0x40, 0x8e, 0x20, 0x9e, 0xf0, 0x69, 0xe1, 0xb3, 0xe6, 0xbc, 0x63, 0xba, 0xce, 0x32, 0xd2, 0xf0, 0x68, 0x39, 0xd1, 0xfe, 0xd8, 0x18, 0x17, 0xbf, 0xcc, 0x1f, 0x6f, 0xa6, 0x14 },
+        { 0xee, 0x60, 0xdf, 0x35, 0x19, 0xe0, 0xd9, 0xb0, 0x77, 0xf3, 0xcc, 0x29, 0x7c, 0x62, 0x0e, 0xdd, 0xd5, 0x2e, 0x1e, 0x22, 0xb3, 0x7c, 0xe5, 0x5e, 0xc9, 0xf8, 0xe3, 0xc3, 0x37, 0x0f, 0xb3, 0x11 },
+    },
+    .anchor = {
+        0x44, 0x33, 0xe8, 0xfe, 0xfb, 0xc7, 0x68, 0xcf, 0x4f, 0xae, 0x51, 0x2f,
+        0x63, 0x97, 0x82, 0xee, 0x6b, 0xbd, 0x83, 0x21, 0xfc, 0xd8, 0x9c, 0x5b,
+        0xde, 0xfb, 0x6d, 0x8f, 0xce, 0x8d, 0xd9, 0x1b
+    }
+},
+{
+    .bundle = {
+        0x05, 0x11, 0x09, 0x03, 0xd3, 0x56, 0x31, 0xa0, 0xc4, 0xfa, 0x90, 0xae,
+        0x46, 0xea, 0x70, 0xc2, 0xae, 0x0d, 0x20, 0x87, 0x73, 0xa5, 0x92, 0xc8,
+        0xb5, 0x35, 0x55, 0xfd, 0x89, 0xad, 0x85, 0x94, 0x0d, 0x06, 0x81, 0x62,
+        0x5a, 0x04, 0x0f, 0x5a, 0x32, 0xfb, 0xa3, 0x22, 0x0d, 0x19, 0x5b, 0x8b,
+        0xac, 0x5c, 0x8c, 0x35, 0xf4, 0x01, 0x21, 0x10, 0x7a, 0x4b, 0x10, 0x05,
+        0x25, 0x31, 0x2d, 0x79, 0x3d, 0xdc, 0x5e, 0xbc, 0x34, 0x34, 0xa9, 0xc9,
+        0x12, 0x44, 0x57, 0xff, 0x12, 0x7b, 0x20, 0x68, 0xf9, 0xa5, 0xca, 0xa5,
+        0x45, 0x9e, 0x79, 0xca, 0xb2, 0x2e, 0x20, 0x3d, 0x74, 0x24, 0x9f, 0x29,
+        0x83, 0x19, 0xa9, 0xe5, 0x13, 0x82, 0x6e, 0x11, 0x06, 0xa3, 0xa9, 0x5f,
+        0x5e, 0x7a, 0x71, 0xc0, 0xd1, 0xdf, 0xc4, 0xc2, 0x21, 0x25, 0xe6, 0xd6,
+        0x45, 0xc2, 0x79, 0x78, 0x84, 0x6b, 0xc4, 0x4b, 0x37, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x47, 0x9b, 0x4c, 0x34, 0xd6, 0x05, 0x8d,
+        0x06, 0xe5, 0x77, 0x72, 0x2a, 0x69, 0x39, 0x10, 0xf4, 0xb4, 0x11, 0x13,
+        0x46, 0xbc, 0xd9, 0x20, 0x01, 0xea, 0x5b, 0x60, 0x05, 0xb5, 0x3b, 0xb0,
+        0x90, 0x11, 0x47, 0x6a, 0xc0, 0x8b, 0x9b, 0xe2, 0xda, 0x2b, 0x14, 0x8b,
+        0xcd, 0xde, 0x09, 0x4f, 0xff, 0xe9, 0xe4, 0x06, 0x37, 0x6f, 0x71, 0x53,
+        0x8a, 0x7f, 0xe2, 0x93, 0xf1, 0x48, 0x8a, 0x93, 0x35, 0xd3, 0x26, 0x7b,
+        0x6d, 0x7f, 0xa2, 0xc5, 0x34, 0x46, 0xc0, 0x0b, 0xec, 0xa9, 0xc1, 0xec,
+        0x9b, 0x0f, 0x63, 0x75, 0x9c, 0xd7, 0x06, 0x79, 0x4e, 0x92, 0x5a, 0x89,
+        0x28, 0x49, 0xb8, 0xb7, 0x08, 0xcf, 0xf9, 0x98, 0x0d, 0xea, 0xae, 0xb9,
+        0x9a, 0xab, 0x22, 0xa8, 0x66, 0x92, 0x9d, 0xc2, 0x4d, 0x1d, 0x80, 0x56,
+        0x5e, 0x7a, 0x2c, 0xdf, 0x74, 0x5d, 0x0a, 0xb9, 0x67, 0x6e, 0xdf, 0x2c,
+        0x0d, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x8c, 0x57, 0x77,
+        0xd8, 0x89, 0x19, 0x28, 0x1d, 0x19, 0x87, 0x2f, 0xe0, 0x9b, 0x94, 0x49,
+        0x1b, 0xcc, 0xf3, 0x02, 0x51, 0xe5, 0x4a, 0x3b, 0xf0, 0x91, 0x73, 0x4f,
+        0xfd, 0xb4, 0x03, 0x95, 0x19, 0xe2, 0xc5, 0x92, 0xbb, 0x1c, 0x22, 0x7d,
+        0x38, 0x2b, 0x41, 0xf0, 0x79, 0x6d, 0x09, 0x6c, 0x12, 0x15, 0x75, 0x13,
+        0xd6, 0xd6, 0x50, 0x18, 0xfe, 0x42, 0xc3, 0xf2, 0xd0, 0x65, 0x76, 0x77,
+        0x3e, 0x1f, 0x39, 0x51, 0x78, 0xb0, 0x4f, 0x59, 0xc3, 0xd2, 0x0d, 0x25,
+        0xa9, 0xd4, 0x1f, 0x68, 0xca, 0xce, 0x65, 0xb6, 0xe4, 0x9f, 0x88, 0x94,
+        0x02, 0x10, 0x8e, 0x15, 0xb7, 0x3e, 0x95, 0x38, 0xa0, 0x98, 0x35, 0xdf,
+        0xe3, 0x97, 0x53, 0xce, 0xbb, 0xdf, 0x66, 0xc6, 0x0b, 0x44, 0xed, 0x14,
+        0x4a, 0xe3, 0xbb, 0x06, 0x90, 0x57, 0xe4, 0x43, 0x1d, 0x84, 0x29, 0xf3,
+        0x61, 0xc6, 0x9d, 0x21, 0x0f, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0xe9, 0xbd, 0xaa, 0xa2, 0x69, 0xbb, 0x1c, 0xc7, 0x25, 0x5d, 0x8b,
+        0xc1, 0x5f, 0xfc, 0x66, 0x5e, 0x89, 0xfa, 0x7d, 0x77, 0x86, 0xcf, 0x0d,
+        0x97, 0x18, 0x7c, 0x4d, 0x9d, 0xfa, 0xb2, 0x62, 0x1f, 0xd2, 0x5e, 0x4b,
+        0x05, 0x5c, 0x55, 0xa2, 0x11, 0x36, 0xd5, 0x34, 0x2f, 0xf6, 0x8b, 0xcf,
+        0x64, 0x48, 0x81, 0x90, 0x35, 0xa4, 0x98, 0x89, 0x39, 0xa5, 0x4c, 0xe1,
+        0xa6, 0xbf, 0x29, 0xb6, 0x0c, 0xe2, 0xf6, 0xf8, 0x8f, 0xa6, 0x0e, 0x6b,
+        0x9f, 0x71, 0xa1, 0x83, 0x37, 0x1d, 0xcd, 0x8b, 0xa4, 0xea, 0xde, 0xf8,
+        0xb8, 0x55, 0x87, 0x8f, 0xfa, 0x16, 0x1c, 0x0a, 0xd3, 0xe6, 0x36, 0x9b,
+        0x1a, 0xc5, 0xad, 0x66, 0x19, 0xe9, 0x6c, 0x95, 0xfd, 0xe4, 0x69, 0xf4,
+        0xf7, 0x20, 0x2e, 0xb0, 0x31, 0xac, 0x95, 0xd8, 0xd2, 0x3f, 0x31, 0x03,
+        0x16, 0x6a, 0x44, 0x4c, 0xf1, 0x2c, 0x4b, 0x81, 0x3f, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x80, 0x95, 0x47, 0x24, 0x61, 0x5b, 0x48,
+        0xa1, 0xda, 0xac, 0x04, 0x09, 0x61, 0xc8, 0xfa, 0x70, 0xa3, 0xb8, 0xaa,
+        0xa5, 0xe4, 0x11, 0x0d, 0xb2, 0xc9, 0xf9, 0x44, 0x2b, 0xe7, 0xe3, 0x5b,
+        0xb0, 0xc0, 0x14, 0xb8, 0x2d, 0x19, 0x67, 0x6d, 0x6c, 0x37, 0x92, 0xf3,
+        0x62, 0x2c, 0x03, 0x9a, 0x61, 0xe7, 0xdf, 0x3f, 0x2b, 0xe3, 0xe2, 0x3a,
+        0xcf, 0xf4, 0x20, 0x61, 0x64, 0xd3, 0x29, 0x99, 0x13, 0xe5, 0xed, 0x13,
+        0xe1, 0xdb, 0xf6, 0x94, 0x7d, 0xe5, 0x02, 0xde, 0x77, 0x98, 0x57, 0x03,
+        0x11, 0x20, 0x8c, 0x29, 0x3c, 0x58, 0xc0, 0x0d, 0xc0, 0xaa, 0x44, 0xc4,
+        0xbf, 0x21, 0xd4, 0x1b, 0x18, 0x8a, 0x8c, 0x06, 0x1c, 0x64, 0xea, 0x83,
+        0x37, 0xf8, 0x11, 0x11, 0xdd, 0x38, 0x6b, 0xef, 0x22, 0xfe, 0x0f, 0x52,
+        0xe2, 0xc6, 0xa7, 0x8f, 0xbc, 0xc0, 0xd9, 0x0d, 0xcf, 0x28, 0xb2, 0xdf,
+        0x1b, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02, 0x6b, 0x9b,
+        0x6f, 0x44, 0x41, 0x83, 0x00, 0x00, 0xf0, 0xec, 0xf4, 0x99, 0xcd, 0xac,
+        0x49, 0xa4, 0x09, 0x55, 0x76, 0x0a, 0x34, 0x66, 0x36, 0x59, 0x97, 0xd4,
+        0xff, 0x07, 0xcf, 0x4e, 0xe1, 0x95, 0x32, 0x8c, 0x95, 0x46, 0x95, 0x9d,
+        0x8a, 0x0a, 0xfd, 0xb5, 0x07, 0xf7, 0x1d, 0x41, 0x83, 0x18, 0x16, 0xfb,
+        0xad, 0x5d, 0x50, 0x76, 0xd1, 0x0a, 0x5d, 0xa1, 0x52, 0xc0, 0x5a, 0xb2,
+        0x72, 0x87, 0x27, 0x1c, 0xae, 0xa2, 0xc5, 0xba, 0x6f, 0xa1, 0x67, 0xe3,
+        0xcb, 0xaa, 0x31, 0x58, 0xd2, 0x23, 0x00, 0x28, 0xdf, 0x3a, 0x59, 0x9c,
+        0x6a, 0xae, 0x17, 0x03, 0x65, 0x29, 0xbc, 0x15, 0x15, 0x6a, 0x65, 0x58,
+        0xe2, 0x9c, 0xed, 0xab, 0x0f, 0x06, 0x14, 0x74, 0x56, 0x51, 0xda, 0xe2,
+        0x87, 0xfc, 0x9a, 0x54, 0x00, 0xbc, 0xe8, 0xd4, 0x04, 0xe0, 0xef, 0x3a,
+        0xe1, 0xa2, 0x15, 0x5b, 0xb0, 0xc8, 0x02, 0x1e, 0x1b, 0x09, 0x6b, 0xc5,
+        0xb8, 0xb3, 0x31, 0xf4, 0x2e, 0xb8, 0x14, 0x15, 0x55, 0x11, 0x65, 0x98,
+        0xd1, 0xfe, 0x26, 0x85, 0x68, 0x37, 0xc6, 0x64, 0x19, 0x4e, 0xb7, 0xd5,
+        0xe0, 0x5a, 0x53, 0x5e, 0x05, 0x64, 0x35, 0x14, 0x48, 0x16, 0xe1, 0xeb,
+        0x4e, 0xc0, 0x1a, 0x5d, 0xfd, 0xc1, 0xfd, 0x50, 0x70, 0x1c, 0x96, 0x07,
+        0xca, 0x0a, 0x90, 0x74, 0x60, 0x63, 0x79, 0xcf, 0x68, 0x09, 0x7a, 0xb7,
+        0xc3, 0x46, 0x43, 0xf8, 0xf5, 0x26, 0x60, 0xbf, 0xb8, 0xe6, 0x69, 0xd7,
+        0x07, 0x18, 0xbe, 0x0c, 0xc4, 0x8f, 0xbf, 0x8e, 0x67, 0xd0, 0xa1, 0xb9,
+        0xa9, 0xad, 0x02, 0x21, 0xcf, 0xe3, 0xa7, 0xbe, 0xa2, 0x21, 0x06, 0xb8,
+        0x5e, 0x71, 0x24, 0x47, 0xe5, 0x01, 0x92, 0x33, 0x8f, 0x05, 0xdb, 0x93,
+        0xce, 0xee, 0x93, 0x05, 0x45, 0x47, 0x34, 0xff, 0x4b, 0x4d, 0xc5, 0x69,
+        0xce, 0xa5, 0xe3, 0x10, 0xb2, 0xc4, 0x62, 0x82, 0xc8, 0xbb, 0xfb, 0x1f,
+        0x81, 0x11, 0xa1, 0x61, 0x2e, 0xe8, 0x47, 0x68, 0xe6, 0x93, 0x04, 0x43,
+        0x38, 0x74, 0x51, 0x53, 0xd8, 0x4e, 0x39, 0x0e, 0xf6, 0xfa, 0x2e, 0x1f,
+        0xb8, 0x30, 0xc3, 0x00, 0x21, 0x85, 0x72, 0x81, 0x36, 0x8a, 0x5a, 0xb6,
+        0xb5, 0xa7, 0x03, 0x95, 0x03, 0x62, 0xaf, 0xb8, 0x24, 0x87, 0x17, 0x53,
+        0x10, 0x94, 0x10, 0x2d, 0x70, 0x9f, 0x14, 0xef, 0x84, 0x3e, 0x99, 0xd4,
+        0xac, 0xd6, 0xaf, 0x23, 0x8d, 0xad, 0xbf, 0x9a, 0x82, 0xa4, 0xd8, 0x41,
+        0x3a, 0xd1, 0x01, 0x10, 0x42, 0x40, 0x5b, 0xff, 0x7b, 0x07, 0x34, 0xc7,
+        0xf7, 0x5f, 0x86, 0xc4, 0xc0, 0x27, 0xdf, 0xc2, 0xe1, 0xaa, 0x19, 0xbd,
+        0x08, 0xba, 0x92, 0x86, 0xeb, 0x40, 0x8d, 0xff, 0x32, 0x04, 0x7d, 0x3f,
+        0xc7, 0xdb, 0x15, 0xbb, 0x42, 0xfc, 0x81, 0xe0, 0xa9, 0x73, 0xe0, 0x4b,
+        0x19, 0xad, 0x7b, 0xcf, 0x86, 0xcd, 0x6d, 0x82, 0xc4, 0x1a, 0x43, 0x8a,
+        0x91, 0x03, 0xc3, 0x63, 0x57, 0x3b, 0x08, 0x7b, 0x01, 0x39, 0x29, 0x3a,
+        0x7a, 0x00, 0x3c, 0x67, 0x0d, 0x9d, 0x42, 0xed, 0xd1, 0x3f, 0x85, 0x91,
+        0x57, 0x28, 0x09, 0x26, 0xb9, 0xb2, 0xfc, 0x4e, 0x9c, 0xa7, 0x17, 0x70,
+        0x31, 0x7c, 0xce, 0x64, 0x2e, 0x76, 0xbc, 0x5d, 0x0d, 0xaf, 0xea, 0x3d,
+        0x3e, 0xa7, 0x00, 0x56, 0x6c, 0xea, 0x75, 0x65, 0x3a, 0x5a, 0x25, 0x0d,
+        0x27, 0xd2, 0x06, 0x04, 0xf8, 0xe1, 0x02, 0x6e, 0x00, 0xee, 0x42, 0x46,
+        0xd4, 0x65, 0xda, 0xa9, 0xf6, 0xd1, 0x33, 0x1b, 0x6c, 0xae, 0xf7, 0x89,
+        0x7d, 0xd5, 0xe3, 0xba, 0x19, 0x2a, 0xf6, 0x65, 0x9d, 0xac, 0x6e, 0x99,
+        0xf4, 0xf0, 0x6d, 0x06, 0x71, 0x26, 0x5c, 0xa1, 0xbc, 0x04, 0xe9, 0xdb,
+        0x41, 0xdc, 0x4c, 0x40, 0x0c, 0xfa, 0x31, 0x2c, 0x9b, 0x7e, 0xce, 0xbd,
+        0x01, 0x82, 0x7d, 0x61, 0xd6, 0xab, 0x64, 0x72, 0x6d, 0x77, 0xb9, 0x47,
+        0x14, 0x36, 0xc2, 0x2d, 0x2e, 0xaf, 0x66, 0x18, 0xcd, 0x64, 0xd8, 0xa4,
+        0x11, 0xd6, 0x2c, 0x66, 0x5a, 0xcc, 0x28, 0x46, 0xee, 0x98, 0x20, 0x5a,
+        0x73, 0x3f, 0x2c, 0xed, 0xe0, 0x7a, 0xea, 0xe4, 0xf1, 0xfa, 0xbc, 0xd8,
+        0xfe, 0x45, 0x70, 0x65, 0x74, 0xc0, 0x81, 0xf8, 0x27, 0xae, 0x60, 0x35,
+        0x03, 0x86, 0xea, 0x5a, 0xd3, 0x62, 0xbb, 0xe4, 0xed, 0xa7, 0x1f, 0x8b,
+        0xd0, 0xb1, 0x80, 0x0b, 0x16, 0x82, 0x44, 0x5f, 0xdd, 0x7a, 0x06, 0x3c,
+        0x8e, 0x9d, 0xe2, 0xde, 0x19, 0xfd, 0x38, 0x15, 0x5e, 0x05, 0x3d, 0x47,
+        0xf9, 0xdd, 0x40, 0xb7, 0xd1, 0xe8, 0xb0, 0xda, 0x5e, 0x59, 0x9b, 0x54,
+        0x6d, 0x44, 0x51, 0xe5, 0x9a, 0x99, 0x5c, 0x07, 0x48, 0xae, 0x2b, 0x87,
+        0xff, 0xd2, 0x4b, 0x7e, 0x82, 0xfb, 0x22, 0xd3, 0x0f, 0xbe, 0x10, 0x97,
+        0xa2, 0x4c, 0xac, 0xdc, 0xc5, 0xc7, 0x37, 0x73, 0x12, 0xb2, 0xb0, 0x37,
+        0x17, 0x55, 0x99, 0x3b, 0xd8, 0x56, 0x24, 0x4d, 0xf3, 0x2e, 0xb9, 0x2d,
+        0x68, 0x8c, 0xaf, 0x9c, 0x5b, 0xfa, 0xcc, 0x51, 0x52, 0xa7, 0xaa, 0x14,
+        0x37, 0x4b, 0xb3, 0x93, 0x44, 0x7b, 0x60, 0xbb, 0x20, 0xdb, 0xff, 0x11,
+        0x72, 0xe7, 0x8b, 0x02, 0xef, 0x30, 0x46, 0x3b, 0x03, 0x2c, 0xc9, 0x90,
+        0x85, 0xe0, 0xb5, 0x6b, 0xfb, 0x99, 0xc9, 0x83, 0x95, 0xbf, 0x1b, 0xdf,
+        0xfa, 0x36, 0x6a, 0xfe, 0xd9, 0xc8, 0x38, 0x1d, 0x4c, 0x68, 0xd7, 0x5e,
+        0x20, 0x3b, 0x3d, 0xad, 0x12, 0x6a, 0x65, 0xea, 0x96, 0x9a, 0xdf, 0xb0,
+        0x84, 0x4f, 0x3f, 0x3a, 0x58, 0xf9, 0xb9, 0x24, 0xa2, 0x6c, 0xd7, 0x2e,
+        0xbd, 0x31, 0x86, 0xd7, 0x51, 0x71, 0x80, 0x09, 0x37, 0x81, 0x21, 0xa5,
+        0x76, 0x2e, 0xb1, 0x55, 0xb5, 0x8e, 0x2f, 0x9c, 0x00, 0xef, 0x5f, 0x09,
+        0x5c, 0xc8, 0xa1, 0x60, 0xdc, 0x8f, 0x1b, 0x6b, 0xb2, 0x15, 0x52, 0x32,
+        0xfc, 0x83, 0x64, 0x49, 0x25, 0x5b, 0xa9, 0x6b, 0x01, 0x1f, 0x2f, 0x3d,
+        0x4a, 0xb0, 0x55, 0x68, 0x5f, 0x1c, 0xfe, 0xc1, 0x7c, 0x64, 0x99, 0xbe,
+        0x6b, 0x7c, 0x82, 0x74, 0x27, 0x13, 0xf8, 0xc9, 0x15, 0xc3, 0x57, 0xf5,
+        0x6c, 0xfd, 0xd0, 0x9c, 0x69, 0x21, 0x91, 0xc5, 0xfa, 0x73, 0x5b, 0x7a,
+        0x3e, 0x2f, 0x00, 0x4e, 0x06, 0xe3, 0x8d, 0x2c, 0x94, 0xf3, 0xe9, 0xe4,
+        0xd4, 0x8b, 0xed, 0xae, 0x22, 0xb5, 0x5f, 0x8e, 0x72, 0x06, 0x9b, 0xb1,
+        0x9d, 0x75, 0x0d, 0x5b, 0x27, 0x3d, 0x40, 0x6b, 0xe4, 0xcb, 0xd3, 0x72,
+        0xa6, 0xce, 0x99, 0x50, 0xd2, 0x13, 0xe4, 0x2f, 0xeb, 0xe4, 0xcc, 0x6b,
+        0xbc, 0xb8, 0x4a, 0xcf, 0xfb, 0x60, 0xea, 0x05, 0x29, 0x90, 0x1d, 0x36,
+        0x04, 0xb3, 0x15, 0x46, 0xf2, 0x8e, 0xab, 0x08, 0xe3, 0x63, 0x4d, 0x87,
+        0x0d, 0x9b, 0xe8, 0x94, 0xff, 0x77, 0x5c, 0xa1, 0xf9, 0xb1, 0xe0, 0x2e,
+        0x40, 0x35, 0x34, 0x34, 0xe0, 0x20, 0x2f, 0x1a, 0xd1, 0xe3, 0xb9, 0xeb,
+        0xa3, 0xd5, 0xa9, 0xec, 0x2e, 0x1e, 0xdf, 0x5e, 0xae, 0x65, 0x7a, 0xec,
+        0x54, 0x25, 0x24, 0x6c, 0x16, 0x8c, 0x51, 0x82, 0x8b, 0x10, 0xf2, 0xc3,
+        0x89, 0xcb, 0xad, 0x16, 0x12, 0x28, 0x01, 0xbc, 0x0e, 0x77, 0x05, 0xb9,
+        0x4e, 0x02, 0x41, 0xdd, 0xd4, 0x73, 0x0a, 0xf8, 0x05, 0x19, 0xee, 0x0c,
+        0x8b, 0xf5, 0xce, 0xc6, 0xe6, 0xb9, 0x78, 0x26, 0xac, 0x73, 0xa6, 0x44,
+        0xce, 0xcc, 0xe7, 0xcb, 0x67, 0x76, 0x77, 0xe1, 0xce, 0x80, 0x1b, 0x3a,
+        0x70, 0xe3, 0xb4, 0x60, 0x7a, 0x9e, 0x30, 0x86, 0x80, 0xec, 0x8d, 0x3a,
+        0x52, 0xd8, 0xc2, 0xf1, 0x22, 0xd9, 0x72, 0x2d, 0x17, 0x59, 0xa8, 0xa5,
+        0x2d, 0x1c, 0xd4, 0x92, 0x03, 0x0c, 0x61, 0x08, 0xaf, 0x69, 0x75, 0xfd,
+        0xc5, 0xeb, 0xae, 0x4d, 0xb0, 0x39, 0x36, 0x1d, 0x1d, 0xf7, 0x21, 0xab,
+        0x1f, 0x89, 0x06, 0x3d, 0xfa, 0x6e, 0x46, 0x67, 0xcf, 0x30, 0x4a, 0xb6,
+        0xa1, 0x8a, 0xa7, 0xd6, 0xda, 0xe4, 0x08, 0x89, 0x74, 0x1e, 0xbc, 0x6c,
+        0x4d, 0xca, 0x1c, 0xbe, 0x6b, 0x31, 0x5e, 0x06, 0x53, 0xe0, 0xd5, 0x94,
+        0x79, 0x7e, 0xae, 0x6e, 0x8c, 0x39, 0x70, 0xf9, 0xed, 0x35, 0x06, 0x45,
+        0x83, 0x05, 0x1a, 0x5a, 0x5a, 0xf3, 0x1f, 0x24, 0xd8, 0x13, 0x8b, 0xc0,
+        0x2e, 0xc8, 0xe9, 0x1a, 0x9f, 0x2c, 0x5e, 0x76, 0x5c, 0x60, 0x0e, 0xe3,
+        0x80, 0xdf, 0x1b, 0x86, 0x22, 0xbb, 0x17, 0xc7, 0x66, 0xb8, 0x69, 0xe1,
+        0x56, 0x29, 0x35, 0x9f, 0x48, 0x37, 0xe0, 0x8f, 0xcd, 0x7c, 0x96, 0xa0,
+        0x5f, 0xb5, 0x47, 0xd8, 0x75, 0xfc, 0x12, 0x9d, 0x54, 0xe9, 0xa9, 0x73,
+        0x41, 0x88, 0x38, 0x04, 0x81, 0x24, 0x59, 0xda, 0x1b, 0x05, 0xbc, 0xc2,
+        0x96, 0x4f, 0x26, 0xb2, 0xb4, 0x0b, 0x8e, 0x10, 0x66, 0x5f, 0x2f, 0x5e,
+        0xaa, 0x26, 0x14, 0x5c, 0x81, 0x00, 0xa6, 0xfd, 0x7e, 0xf0, 0xe8, 0x82,
+        0xf2, 0xd7, 0xcb, 0x07, 0x0e, 0x26, 0xa4, 0xeb, 0xb2, 0xc4, 0xea, 0x08,
+        0xe1, 0xed, 0x0d, 0xa4, 0x5f, 0x33, 0xbf, 0xcc, 0x77, 0x5c, 0x94, 0xd3,
+        0xce, 0x85, 0x3e, 0x66, 0x4c, 0x34, 0x09, 0x3d, 0x92, 0xee, 0x78, 0x39,
+        0x60, 0xb1, 0xcd, 0x23, 0x0e, 0xdc, 0xc7, 0x63, 0xb4, 0xb4, 0x40, 0xb3,
+        0x36, 0x80, 0x96, 0xf8, 0x86, 0xd6, 0xad, 0xf8, 0xa9, 0x74, 0x24, 0x91,
+        0x39, 0x70, 0x23, 0xea, 0x7d, 0xed, 0x81, 0xb1, 0x12, 0x73, 0x51, 0xd1,
+        0xe3, 0xd8, 0x84, 0xee, 0x31, 0x7f, 0x0b, 0xef, 0x31, 0x37, 0xeb, 0x61,
+        0xc6, 0x5f, 0xe3, 0x7d, 0x73, 0x46, 0xa6, 0x0d, 0xca, 0x55, 0xc6, 0x84,
+        0x9c, 0xa6, 0x22, 0xf0, 0x78, 0x70, 0x92, 0xf3, 0xa0, 0xb2, 0x3e, 0x41,
+        0xaf, 0xf2, 0x7c, 0x16, 0x12, 0x90, 0x28, 0x83, 0x72, 0x29, 0x8f, 0x8f,
+        0x20, 0x97, 0xd0, 0xe1, 0x19, 0xe7, 0x34, 0x61, 0x00, 0x8a, 0x28, 0x8e,
+        0x13, 0xbf, 0xd7, 0xb7, 0x48, 0xf1, 0x90, 0x12, 0xad, 0x76, 0x4c, 0x99,
+        0x1b, 0xd2, 0x8a, 0x6c, 0x92, 0x52, 0xc8, 0xdf, 0x26, 0x89, 0xbd, 0x72,
+        0xce, 0x56, 0x22, 0x72, 0x14, 0xef, 0x82, 0xca, 0xbd, 0x1b, 0x74, 0x8c,
+        0xbd, 0xb1, 0x8f, 0x87, 0x24, 0xc9, 0x44, 0x45, 0xea, 0x5f, 0x8b, 0x0e,
+        0x70, 0xc7, 0xfa, 0xe7, 0x23, 0xcc, 0xe7, 0xe0, 0x35, 0xbd, 0xef, 0x49,
+        0x76, 0xa7, 0xb0, 0xfa, 0x53, 0x38, 0x5c, 0xfb, 0x9c, 0x58, 0xfa, 0xab,
+        0x74, 0x68, 0xf2, 0x3f, 0xf9, 0x8e, 0x6f, 0x6a, 0x4d, 0xce, 0x66, 0xdc,
+        0x92, 0x3c, 0xd2, 0x09, 0x5e, 0x9e, 0x4b, 0x82, 0x8a, 0xc3, 0x05, 0xf6,
+        0x61, 0x72, 0x40, 0x23, 0x3d, 0xb5, 0x9e, 0xe4, 0x4c, 0x86, 0x26, 0x8a,
+        0xee, 0x0a, 0xbb, 0x09, 0xd4, 0x5f, 0xcb, 0x6e, 0xee, 0x77, 0xa7, 0x3e,
+        0x37, 0x5a, 0x54, 0xb1, 0x14, 0x59, 0x7e, 0x99, 0x88, 0x65, 0x1a, 0x8b,
+        0x67, 0xad, 0x21, 0xb3, 0x14, 0xf3, 0x09, 0x58, 0x29, 0x34, 0x10, 0x95,
+        0x01, 0xda, 0xba, 0x49, 0x7a, 0x90, 0x82, 0xf2, 0x02, 0xd9, 0xaa, 0x56,
+        0x37, 0xe1, 0xe5, 0x7e, 0x93, 0xd4, 0xb1, 0x22, 0x40, 0x5b, 0x74, 0x98,
+        0x0e, 0x4c, 0xf0, 0x25, 0x04, 0x68, 0x7b, 0xcc, 0xa2, 0xdd, 0xc6, 0xc4,
+        0x74, 0xa4, 0x24, 0x00, 0x39, 0xc7, 0x5a, 0xaf, 0xf2, 0x76, 0x43, 0x2b,
+        0x25, 0x83, 0x47, 0x9c, 0xbc, 0xf7, 0x34, 0xa4, 0x40, 0x5c, 0xa3, 0xe7,
+        0x23, 0x94, 0xad, 0xe8, 0x4d, 0x44, 0x4b, 0x10, 0x4a, 0xe7, 0x27, 0xc2,
+        0xdd, 0xa4, 0xc4, 0xc5, 0x3a, 0x3d, 0xf4, 0x59, 0x03, 0x11, 0x10, 0x49,
+        0x6e, 0xff, 0x17, 0x00, 0x48, 0x02, 0x48, 0x18, 0x99, 0x03, 0x5b, 0xcf,
+        0x5b, 0xaf, 0x27, 0xe6, 0x0b, 0xc9, 0x77, 0x17, 0xd6, 0x29, 0x45, 0xcf,
+        0x95, 0xa4, 0x1c, 0x22, 0x07, 0x7f, 0x9a, 0x2d, 0xa2, 0xcb, 0x62, 0x6a,
+        0x5b, 0x83, 0x0d, 0xf4, 0x0d, 0x30, 0x81, 0xad, 0x57, 0x97, 0xcd, 0xfe,
+        0x72, 0x6e, 0xda, 0x35, 0x18, 0x81, 0x52, 0x75, 0x93, 0x97, 0x0f, 0x72,
+        0x98, 0x62, 0x06, 0xbc, 0x32, 0xd8, 0x7a, 0x76, 0xca, 0x6f, 0x86, 0xa3,
+        0x97, 0xcc, 0x24, 0xfe, 0xbc, 0x4d, 0x33, 0x5d, 0xf2, 0x91, 0x5e, 0x41,
+        0xea, 0x52, 0x82, 0x76, 0x7c, 0xe6, 0x58, 0xe5, 0xd6, 0x56, 0x2f, 0x09,
+        0x9e, 0x5d, 0x1b, 0x5a, 0xe5, 0x25, 0xa9, 0xa5, 0xbf, 0x3e, 0x2b, 0xdb,
+        0x2e, 0xe8, 0x1c, 0xbd, 0x6f, 0x80, 0xb0, 0xc9, 0x91, 0xdb, 0x98, 0x95,
+        0x3c, 0x37, 0xbd, 0xe1, 0x76, 0xf0, 0x49, 0x94, 0xb1, 0x99, 0x82, 0xce,
+        0x29, 0xfc, 0xf1, 0xc3, 0xb1, 0x41, 0xe7, 0x44, 0xe5, 0x3a, 0xc9, 0x23,
+        0x49, 0xd7, 0x50, 0xbf, 0xfe, 0xe9, 0x52, 0x88, 0x8a, 0x2d, 0x6b, 0x14,
+        0x47, 0x8e, 0x79, 0xed, 0x0d, 0x30, 0x80, 0x5b, 0x9f, 0x91, 0x21, 0xd1,
+        0xdf, 0x6c, 0x7f, 0x0d, 0xdc, 0xcf, 0x47, 0x57, 0x67, 0xb6, 0x96, 0x4e,
+        0x97, 0x3d, 0xa0, 0x27, 0xfe, 0xcd, 0xce, 0xdd, 0xde, 0x67, 0x16, 0x68,
+        0x70, 0x59, 0xbe, 0xe1, 0x74, 0xab, 0xc8, 0xb0, 0xb3, 0x34, 0xe0, 0x4e,
+        0x29, 0x26, 0xb2, 0x4d, 0x3d, 0x74, 0x7f, 0x60, 0x3c, 0xb4, 0xca, 0xb2,
+        0x2e, 0xca, 0xb7, 0xb9, 0xf0, 0x4f, 0xd2, 0xca, 0x41, 0xee, 0x61, 0x7c,
+        0x0a, 0x34, 0xaa, 0xc6, 0xc5, 0x5d, 0x86, 0x61, 0x53, 0xb8, 0x15, 0xc9,
+        0x67, 0x9c, 0x1b, 0x16, 0x00, 0x2c, 0xb1, 0x09, 0x2d, 0x27, 0xee, 0xb8,
+        0x66, 0x14, 0xca, 0xc4, 0x0d, 0x50, 0x86, 0xde, 0x39, 0x64, 0xf9, 0xdb,
+        0x34, 0x25, 0x53, 0xe9, 0x12, 0xfa, 0xbd, 0x2e, 0x38, 0x67, 0x6f, 0x33,
+        0x23, 0x57, 0x37, 0x0b, 0x8c, 0x6e, 0x90, 0x2d, 0xd8, 0x82, 0x51, 0xbc,
+        0xf3, 0xc3, 0xdb, 0x94, 0x90, 0x47, 0x8b, 0xcb, 0x77, 0xf5, 0x9a, 0xe8,
+        0xbd, 0xb5, 0x26, 0x97, 0x8a, 0x46, 0xea, 0xc5, 0x8c, 0x51, 0x72, 0x67,
+        0xbc, 0x7d, 0x32, 0x72, 0xde, 0xb0, 0x1f, 0xc9, 0x48, 0x12, 0x05, 0xf6,
+        0x1b, 0x54, 0xd7, 0xba, 0x89, 0x8b, 0xe2, 0xbf, 0x05, 0x85, 0x60, 0xcd,
+        0xcf, 0x71, 0xb6, 0x4c, 0x56, 0xdd, 0x51, 0x93, 0xbf, 0x3d, 0x8b, 0x20,
+        0x0a, 0x9f, 0xea, 0xda, 0x2a, 0xcf, 0x2c, 0x33, 0xdb, 0xd8, 0x7e, 0x0b,
+        0xdd, 0xd2, 0xab, 0x38, 0xad, 0x1c, 0xa4, 0x05, 0xc9, 0xaf, 0x7e, 0x40,
+        0x6a, 0xeb, 0x4b, 0x98, 0x80, 0x77, 0xdf, 0x7c, 0xee, 0x96, 0xa5, 0xb0,
+        0x32, 0x98, 0xe0, 0x55, 0x97, 0x77, 0x31, 0x5c, 0xc1, 0x2d, 0x17, 0xb4,
+        0xe6, 0xbf, 0xb0, 0x98, 0x71, 0x71, 0xa4, 0xd7, 0x92, 0x20, 0x39, 0xe1,
+        0xef, 0xe7, 0xd2, 0x04, 0xd8, 0x27, 0xb1, 0xdf, 0x3a, 0x7b, 0xae, 0x4f,
+        0x0a, 0xfd, 0xff, 0xd0, 0xa3, 0x80, 0xe6, 0xf8, 0xf5, 0xa7, 0xdd, 0x9f,
+        0x62, 0xf8, 0x2b, 0x35, 0x74, 0x56, 0x86, 0xa0, 0x75, 0xd6, 0xb3, 0x0d,
+        0x93, 0x9f, 0x95, 0x3b, 0xfc, 0x29, 0xa7, 0x95, 0xb8, 0x50, 0x84, 0x23,
+        0x01, 0xee, 0x88, 0x82, 0xc4, 0xf5, 0xbd, 0x0f, 0x59, 0xc1, 0x81, 0x6e,
+        0xbc, 0xa3, 0x9d, 0xdf, 0x72, 0x13, 0xe9, 0x7d, 0xb6, 0x9b, 0x34, 0x7f,
+        0x1a, 0xc8, 0x6d, 0x3a, 0xbf, 0xae, 0x7c, 0x81, 0xe5, 0x28, 0x38, 0x50,
+        0xe4, 0xa5, 0x5b, 0x7f, 0xe7, 0x9d, 0xf9, 0x02, 0xec, 0x5b, 0x5d, 0xf1,
+        0x82, 0x5d, 0xde, 0xff, 0xd2, 0x92, 0x3f, 0xa8, 0xff, 0xae, 0x57, 0xaf,
+        0x6d, 0x19, 0xbe, 0x4b, 0x7e, 0x1d, 0x39, 0x89, 0x1c, 0x50, 0x05, 0x87,
+        0x07, 0x51, 0xba, 0x57, 0x78, 0xba, 0x0e, 0xa7, 0x78, 0xfb, 0x03, 0x45,
+        0x2b, 0x77, 0xdb, 0x40, 0x13, 0x6c, 0x79, 0x75, 0x5d, 0xa9, 0xe5, 0xe7,
+        0x2c, 0x0c, 0x15, 0xec, 0x44, 0xc6, 0x18, 0x9f, 0xdd, 0xe0, 0x2e, 0xe3,
+        0x3a, 0x42, 0x0c, 0xe7, 0xe7, 0x67, 0x36, 0x53, 0xa0, 0xcc, 0x91, 0x4f,
+        0x34, 0x5a, 0xfe, 0x29, 0x9a, 0x21, 0xbe, 0xf3, 0xbd, 0x95, 0xac, 0x6a,
+        0xec, 0xec, 0x74, 0x43, 0xb1, 0x21, 0x11, 0x0b, 0x45, 0x69, 0xa7, 0x48,
+        0x2b, 0x6c, 0xb5, 0x16, 0x7f, 0x84, 0xe4, 0x0e, 0xce, 0xd2, 0x31, 0x8a,
+        0x40, 0x1d, 0x02, 0x13, 0x78, 0x3b, 0x45, 0x4f, 0xa7, 0x03, 0x80, 0x7d,
+        0x90, 0x09, 0xe2, 0x70, 0xf2, 0xce, 0x49, 0xab, 0x3c, 0x6b, 0xc6, 0xa4,
+        0x0b, 0x53, 0x6b, 0xfb, 0x21, 0x3d, 0xcf, 0x71, 0xf9, 0x06, 0x19, 0xbe,
+        0x46, 0xa4, 0xa4, 0xb0, 0xf2, 0xa7, 0xa6, 0xfb, 0xb7, 0x27, 0xc2, 0x19,
+        0x75, 0x20, 0x01, 0xd5, 0x25, 0xe5, 0x9c, 0xc5, 0xdf, 0x58, 0x22, 0xb2,
+        0x52, 0xef, 0x54, 0x37, 0xf8, 0x96, 0xfd, 0x9e, 0x11, 0x8e, 0x02, 0x1c,
+        0xd1, 0x22, 0x88, 0xa0, 0x21, 0x85, 0x88, 0x6a, 0xdb, 0x3e, 0xb7, 0xf2,
+        0x55, 0x42, 0x6a, 0x34, 0x92, 0x74, 0x0f, 0x1e, 0xe1, 0x75, 0x55, 0x71,
+        0xb5, 0x2d, 0x42, 0xf3, 0x97, 0xb6, 0x51, 0xba, 0x8e, 0xa6, 0xc6, 0xdd,
+        0x9e, 0x28, 0x66, 0x05, 0xef, 0x8c, 0x87, 0x31, 0x52, 0x07, 0xb9, 0x83,
+        0xb0, 0x1a, 0x80, 0xdd, 0x28, 0xa5, 0xe9, 0x20, 0xac, 0x17, 0x50, 0x62,
+        0x56, 0xaf, 0x26, 0xce, 0x7a, 0x68, 0x84, 0x4f, 0xbd, 0x4a, 0xd0, 0xfa,
+        0x7f, 0xf0, 0x25, 0x17, 0x20, 0x80, 0xd8, 0x59, 0x6d, 0xc6, 0x4c, 0xbf,
+        0x68, 0x1c, 0x6d, 0xec, 0xd5, 0x30, 0x3b, 0xba, 0x85, 0xc1, 0x37, 0x51,
+        0x68, 0x2b, 0x95, 0xe7, 0x8e, 0xce, 0x99, 0xd9, 0x27, 0x8b, 0xd6, 0x3e,
+        0xf7, 0x9e, 0x0f, 0x47, 0x00, 0xa6, 0x4b, 0xa6, 0xa5, 0xeb, 0xca, 0xdf,
+        0xf2, 0x20, 0xb9, 0xa4, 0x77, 0x97, 0x6e, 0x76, 0x70, 0x7f, 0xf1, 0xc0,
+        0xe9, 0x72, 0x48, 0xcc, 0x91, 0xb4, 0x19, 0x09, 0x9d, 0x8a, 0xef, 0x43,
+        0xfa, 0xff, 0x14, 0x71, 0x75, 0x16, 0x1e, 0x1f, 0xab, 0x01
+    },
+    .commitments = {
+        { 0x19, 0xa9, 0xe5, 0x13, 0x82, 0x6e, 0x11, 0x06, 0xa3, 0xa9, 0x5f, 0x5e, 0x7a, 0x71, 0xc0, 0xd1, 0xdf, 0xc4, 0xc2, 0x21, 0x25, 0xe6, 0xd6, 0x45, 0xc2, 0x79, 0x78, 0x84, 0x6b, 0xc4, 0x4b, 0x37 },
+        { 0xcf, 0xf9, 0x98, 0x0d, 0xea, 0xae, 0xb9, 0x9a, 0xab, 0x22, 0xa8, 0x66, 0x92, 0x9d, 0xc2, 0x4d, 0x1d, 0x80, 0x56, 0x5e, 0x7a, 0x2c, 0xdf, 0x74, 0x5d, 0x0a, 0xb9, 0x67, 0x6e, 0xdf, 0x2c, 0x0d },
+        { 0x98, 0x35, 0xdf, 0xe3, 0x97, 0x53, 0xce, 0xbb, 0xdf, 0x66, 0xc6, 0x0b, 0x44, 0xed, 0x14, 0x4a, 0xe3, 0xbb, 0x06, 0x90, 0x57, 0xe4, 0x43, 0x1d, 0x84, 0x29, 0xf3, 0x61, 0xc6, 0x9d, 0x21, 0x0f },
+        { 0xc5, 0xad, 0x66, 0x19, 0xe9, 0x6c, 0x95, 0xfd, 0xe4, 0x69, 0xf4, 0xf7, 0x20, 0x2e, 0xb0, 0x31, 0xac, 0x95, 0xd8, 0xd2, 0x3f, 0x31, 0x03, 0x16, 0x6a, 0x44, 0x4c, 0xf1, 0x2c, 0x4b, 0x81, 0x3f },
+        { 0x8a, 0x8c, 0x06, 0x1c, 0x64, 0xea, 0x83, 0x37, 0xf8, 0x11, 0x11, 0xdd, 0x38, 0x6b, 0xef, 0x22, 0xfe, 0x0f, 0x52, 0xe2, 0xc6, 0xa7, 0x8f, 0xbc, 0xc0, 0xd9, 0x0d, 0xcf, 0x28, 0xb2, 0xdf, 0x1b },
+    },
+    .anchor = {
+        0xc2, 0x17, 0x65, 0x74, 0xdc, 0x6c, 0x15, 0x84, 0xa8, 0x36, 0xee, 0x58,
+        0x94, 0x54, 0x26, 0xe3, 0xbd, 0x76, 0x7f, 0x7f, 0xa4, 0x90, 0xed, 0x68,
+        0xee, 0xdc, 0x88, 0xc2, 0xaa, 0xdb, 0xbb, 0x21
+    }
+},
+{
+    .bundle = {
+        0x05, 0x5c, 0x05, 0x22, 0xf8, 0xfc, 0x7d, 0x0c, 0x7b, 0x6b, 0x8f, 0x97,
+        0x8d, 0x61, 0x84, 0x31, 0x6d, 0x44, 0x1e, 0x49, 0x46, 0x7f, 0x86, 0x06,
+        0xdc, 0x19, 0x90, 0x65, 0xe8, 0xbe, 0xa3, 0xea, 0x8e, 0xfa, 0x23, 0x52,
+        0x07, 0xa5, 0xb4, 0xa6, 0x3d, 0xb2, 0xcd, 0xcc, 0x77, 0x9f, 0x04, 0x30,
+        0x64, 0x3c, 0x36, 0x96, 0x4f, 0xcd, 0x6a, 0xc2, 0x80, 0xd4, 0x2d, 0x1d,
+        0xe4, 0x7b, 0xa9, 0xd2, 0x0a, 0x85, 0x3b, 0x6e, 0x88, 0x19, 0xd7, 0x88,
+        0x56, 0x97, 0x15, 0x68, 0x12, 0x52, 0x44, 0xe0, 0x7b, 0x48, 0x50, 0xd6,
+        0x57, 0x83, 0x28, 0x34, 0x77, 0xb0, 0xf2, 0xb2, 0x06, 0xfa, 0x8a, 0x62,
+        0x80, 0x7a, 0x3c, 0x6d, 0xc5, 0x93, 0xb9, 0x65, 0xa4, 0xa3, 0x11, 0x8a,
+        0x0e, 0x9e, 0x80, 0xd0, 0x78, 0x2c, 0xb4, 0x13, 0x99, 0x79, 0x0b, 0xa7,
+        0xf6, 0x49, 0x77, 0x1c, 0x74, 0x43, 0xa3, 0x6d, 0x01, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0xea, 0xbc, 0xfa, 0x89, 0x38, 0x12, 0x07,
+        0x9a, 0xbd, 0x6d, 0x9b, 0x69, 0x40, 0x49, 0x9f, 0x08, 0x7f, 0x65, 0x47,
+        0xeb, 0x2b, 0xca, 0xf3, 0x1c, 0x78, 0xc0, 0xbe, 0x39, 0x37, 0xc0, 0xf6,
+        0xba, 0x54, 0xb3, 0x79, 0x66, 0x0c, 0x9c, 0x13, 0x4f, 0x8e, 0xa1, 0x32,
+        0x86, 0x28, 0x5c, 0xf3, 0x02, 0xaa, 0xee, 0x4d, 0xd4, 0x15, 0xda, 0xfd,
+        0xa0, 0x5a, 0x2a, 0xa9, 0x1b, 0xc3, 0x98, 0x4c, 0x09, 0x06, 0xb8, 0x31,
+        0xea, 0xc0, 0x77, 0xf6, 0x9c, 0x27, 0x22, 0xde, 0x05, 0x5d, 0x6c, 0xa5,
+        0xb0, 0x2e, 0x3b, 0xa8, 0x63, 0xce, 0x03, 0xd0, 0x00, 0xc7, 0x5e, 0x81,
+        0xf3, 0xb5, 0x01, 0x06, 0xaf, 0x0b, 0xbb, 0x5a, 0xfb, 0xb7, 0xc5, 0x00,
+        0x5e, 0x14, 0x9f, 0x8b, 0x5b, 0xf5, 0xfe, 0x35, 0x40, 0xb3, 0x7d, 0x31,
+        0xe3, 0xc2, 0xb2, 0x14, 0x33, 0x73, 0x59, 0xda, 0xe3, 0x31, 0x30, 0x23,
+        0x11, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x7a, 0xb1, 0xff,
+        0xed, 0x1b, 0xd1, 0xa6, 0x51, 0x57, 0x13, 0x47, 0xf5, 0x62, 0x7a, 0x59,
+        0xe3, 0xe4, 0x08, 0xf7, 0x70, 0x5c, 0x69, 0x4d, 0xe6, 0x20, 0xf5, 0xd6,
+        0x7d, 0x63, 0xf1, 0x9f, 0xac, 0x48, 0x1d, 0x93, 0x79, 0xb5, 0xe8, 0x9f,
+        0xbd, 0x65, 0x9b, 0xdf, 0x84, 0x0e, 0x2b, 0x32, 0x60, 0x99, 0xbb, 0xbb,
+        0x09, 0x3d, 0x57, 0x5a, 0x42, 0x68, 0xc1, 0xee, 0xed, 0x4e, 0xa9, 0x7d,
+        0x3e, 0x0c, 0x4e, 0xe3, 0x10, 0x8a, 0x45, 0x76, 0xfb, 0x52, 0x9d, 0x2c,
+        0x58, 0x45, 0xed, 0xeb, 0x05, 0x9d, 0x65, 0x3f, 0x9f, 0x19, 0xef, 0xed,
+        0xfd, 0x74, 0xc0, 0x18, 0x9e, 0x78, 0x80, 0x01, 0x8c, 0x93, 0x35, 0x52,
+        0xa5, 0xc9, 0xd7, 0x3e, 0x50, 0xf6, 0xdb, 0xcf, 0xa4, 0x1e, 0xa3, 0xd0,
+        0xa5, 0x29, 0x46, 0xb1, 0x87, 0x8e, 0xda, 0x5c, 0x96, 0xd7, 0xd8, 0xb0,
+        0xe4, 0x71, 0x68, 0x0b, 0x27, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0xf9, 0xb9, 0x2a, 0xcb, 0x4b, 0x69, 0xb5, 0x11, 0xba, 0x9b, 0x99,
+        0x07, 0xf1, 0xe1, 0x60, 0x74, 0x47, 0x92, 0x99, 0x6f, 0x92, 0xb8, 0x29,
+        0x84, 0xc8, 0x3d, 0xee, 0x2d, 0x40, 0xf0, 0xf2, 0x82, 0x55, 0x0b, 0x8a,
+        0xdb, 0xe5, 0xd9, 0x79, 0x3f, 0x91, 0xc8, 0x08, 0x10, 0xd7, 0x07, 0xd7,
+        0xdf, 0xc5, 0x9b, 0x65, 0x93, 0xaf, 0x6c, 0x80, 0xca, 0x6e, 0x14, 0xe1,
+        0x94, 0x8b, 0x72, 0x26, 0x17, 0x92, 0xb9, 0xef, 0x3e, 0x28, 0x4d, 0x26,
+        0xe6, 0x98, 0xa7, 0xcd, 0xf8, 0x8c, 0x89, 0xef, 0xcd, 0xfc, 0x41, 0xe6,
+        0xe4, 0xaa, 0x77, 0x09, 0x3e, 0xc8, 0xce, 0xb1, 0x17, 0xfc, 0xe4, 0x91,
+        0xb1, 0x62, 0x8b, 0xa8, 0x4e, 0x08, 0x63, 0xb6, 0x27, 0x72, 0x7d, 0xf9,
+        0xa1, 0x98, 0xb0, 0x9d, 0xd0, 0xe3, 0x1a, 0xff, 0x7c, 0xba, 0xec, 0x87,
+        0xcd, 0x93, 0x3d, 0x0f, 0x76, 0x58, 0xea, 0xcb, 0x3a, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x94, 0xe5, 0x72, 0xbb, 0xc8, 0x7f, 0x4d,
+        0x38, 0x22, 0x4e, 0xdd, 0xa5, 0x4b, 0xf4, 0x31, 0x36, 0x22, 0x95, 0x24,
+        0xe8, 0x70, 0x22, 0xe7, 0x11, 0x65, 0x42, 0x59, 0x54, 0xec, 0x0b, 0xb4,
+        0x25, 0x8d, 0x39, 0x52, 0x32, 0x2d, 0x2b, 0xcf, 0x95, 0x65, 0xee, 0x90,
+        0x37, 0xec, 0xdf, 0x71, 0x21, 0x18, 0x53, 0x38, 0xe6, 0xa6, 0xd7, 0x8b,
+        0x0d, 0x46, 0x43, 0x05, 0xea, 0x20, 0xf4, 0xe1, 0x07, 0xc0, 0x41, 0xea,
+        0x80, 0x06, 0x68, 0x84, 0x55, 0x06, 0xd4, 0xf5, 0x6c, 0xe0, 0xbc, 0x5a,
+        0xc7, 0x9f, 0x82, 0x15, 0x4e, 0x3c, 0x5a, 0x0c, 0x58, 0xde, 0x71, 0x2b,
+        0x37, 0x49, 0x7f, 0xc1, 0x12, 0x90, 0x5f, 0x7a, 0x5e, 0x88, 0xa0, 0x16,
+        0xa1, 0x66, 0x8d, 0xdd, 0x41, 0xea, 0xcb, 0x91, 0x28, 0x78, 0xc7, 0xcb,
+        0xeb, 0x42, 0xa9, 0x31, 0x90, 0x33, 0x98, 0xe0, 0x5f, 0xdc, 0xe6, 0x8b,
+        0x29, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x4f, 0xba,
+        0xa4, 0xa9, 0xe3, 0xd2, 0xfd, 0xff, 0x95, 0x43, 0xd8, 0x9b, 0x8e, 0x70,
+        0x21, 0xe0, 0x9a, 0x69, 0x9d, 0x60, 0x08, 0xd4, 0x93, 0xa5, 0x01, 0xad,
+        0xaf, 0x18, 0xc0, 0xe4, 0xdf, 0x72, 0xbe, 0xf6, 0x6c, 0x00, 0xbf, 0xff,
+        0xd9, 0x23, 0xfd, 0xb5, 0x07, 0x0e, 0xaa, 0x36, 0x84, 0x78, 0xbf, 0x48,
+        0x6d, 0x1c, 0xd3, 0x0e, 0x07, 0xd7, 0x8a, 0x53, 0x66, 0xfa, 0x47, 0x0e,
+        0xea, 0x00, 0xbe, 0x09, 0x8c, 0x8e, 0x27, 0x3b, 0x11, 0x89, 0x62, 0x52,
+        0x8a, 0xda, 0xa2, 0x8a, 0x92, 0xe1, 0x9f, 0x59, 0x10, 0x48, 0x58, 0xe2,
+        0x55, 0x71, 0x62, 0x25, 0x13, 0xf5, 0x77, 0xf8, 0xc4, 0xc0, 0x39, 0xc5,
+        0xf8, 0x0e, 0x32, 0x57, 0xf8, 0x60, 0x0a, 0xc3, 0xa8, 0x96, 0x79, 0xf5,
+        0x6e, 0x36, 0xde, 0x1d, 0xcd, 0xdc, 0xfe, 0x2e, 0xc5, 0x52, 0xaf, 0x04,
+        0xc7, 0x45, 0x71, 0x25, 0x51, 0x17, 0x38, 0xfa, 0xfb, 0x01, 0x04, 0xd2,
+        0x84, 0x91, 0x7b, 0x50, 0x92, 0x0e, 0x4d, 0xa6, 0xab, 0x85, 0x25, 0x84,
+        0x00, 0xe7, 0xe7, 0x60, 0x0d, 0xf1, 0xdc, 0xb9, 0xbe, 0xa8, 0xbc, 0xdb,
+        0xa4, 0x49, 0x76, 0xb2, 0x7a, 0x87, 0x2d, 0x04, 0xc5, 0x93, 0xed, 0x89,
+        0xcd, 0x94, 0x0f, 0xc1, 0xac, 0x77, 0x5b, 0x55, 0xb6, 0x60, 0x06, 0x05,
+        0xd5, 0x0c, 0xe0, 0x64, 0xdd, 0x43, 0x51, 0x51, 0xca, 0xfd, 0xa5, 0x3c,
+        0x0d, 0x8c, 0xb9, 0xfc, 0x44, 0xd5, 0xbc, 0x86, 0x41, 0xd1, 0x3a, 0x75,
+        0xec, 0xf3, 0xcc, 0x48, 0x32, 0x8e, 0x5e, 0x67, 0x94, 0x2e, 0x49, 0xd7,
+        0x75, 0x03, 0x2c, 0x5a, 0x73, 0x64, 0xb6, 0x74, 0x5f, 0xec, 0x0c, 0xdb,
+        0x0e, 0x55, 0x6b, 0x80, 0xc9, 0x67, 0xef, 0x60, 0xa7, 0xaf, 0x35, 0x81,
+        0x75, 0x1b, 0x1e, 0x7c, 0xa6, 0x14, 0xc1, 0x5c, 0xeb, 0xf8, 0xad, 0xc7,
+        0x56, 0x93, 0xa9, 0x04, 0x49, 0xcf, 0x1d, 0x6f, 0xa3, 0x55, 0x71, 0xa3,
+        0xe2, 0x4b, 0x3e, 0x9d, 0xc7, 0xa0, 0xc5, 0x45, 0x0f, 0xcd, 0x78, 0xdb,
+        0x4f, 0x4a, 0xee, 0x97, 0xc0, 0x6d, 0x89, 0xdd, 0xd9, 0xcb, 0xec, 0x9d,
+        0x50, 0x40, 0x66, 0x8a, 0xbd, 0xc0, 0x08, 0x0f, 0x80, 0x25, 0xbb, 0xe2,
+        0xbe, 0xca, 0xf0, 0x46, 0x85, 0x5d, 0xd5, 0x65, 0x89, 0x42, 0x27, 0xe6,
+        0x7f, 0xe4, 0x78, 0xd9, 0x1a, 0x8f, 0x60, 0xbf, 0x12, 0x44, 0x63, 0x6a,
+        0x26, 0x27, 0x63, 0xe4, 0xfe, 0x36, 0x76, 0xf0, 0xe2, 0x39, 0xf7, 0xb3,
+        0x24, 0xf8, 0xc7, 0x5a, 0xea, 0xe6, 0xf6, 0x41, 0x46, 0x74, 0x01, 0xb3,
+        0x04, 0x3c, 0x4f, 0x98, 0xa7, 0x85, 0x8d, 0x37, 0x19, 0x08, 0x0e, 0x6c,
+        0x97, 0x9f, 0xbf, 0xfc, 0xe9, 0x1e, 0xcb, 0x6d, 0x21, 0xab, 0x4e, 0x59,
+        0xbf, 0xa5, 0x15, 0xc3, 0xed, 0x97, 0x0b, 0xbb, 0x9b, 0x27, 0xa5, 0xbe,
+        0x4a, 0x98, 0x88, 0x48, 0xc9, 0xb6, 0xbb, 0x29, 0x5c, 0xee, 0x37, 0x14,
+        0x55, 0xaa, 0xb0, 0xd9, 0x3a, 0xbd, 0x23, 0x4b, 0xcb, 0xea, 0xe9, 0x7f,
+        0xab, 0x7a, 0xd6, 0x6b, 0xcc, 0xfa, 0x50, 0x33, 0x9e, 0xa2, 0xe8, 0x8c,
+        0x70, 0x98, 0xd3, 0xaf, 0xa2, 0xcf, 0x9f, 0x13, 0x29, 0x7d, 0x88, 0xc7,
+        0x61, 0x5e, 0x42, 0x04, 0x3f, 0x16, 0xfd, 0x9d, 0x86, 0x4c, 0xe3, 0x60,
+        0x72, 0x7e, 0x08, 0x75, 0x83, 0xd6, 0x2f, 0x4c, 0xb5, 0x69, 0x8a, 0xe1,
+        0x09, 0xa4, 0x5e, 0x2f, 0x1a, 0xd2, 0xe3, 0xe1, 0x39, 0xe1, 0x59, 0x94,
+        0x1d, 0x23, 0x2c, 0x3e, 0x7c, 0xeb, 0xce, 0x58, 0x68, 0xf3, 0x83, 0x32,
+        0x90, 0x06, 0xac, 0x4e, 0xc3, 0x86, 0xfb, 0x1f, 0xfb, 0xcf, 0x88, 0x87,
+        0x40, 0xf2, 0x3f, 0x51, 0xd9, 0x4d, 0xa8, 0xcb, 0x28, 0x3d, 0x7c, 0xb8,
+        0x87, 0x62, 0x8a, 0x5a, 0x6d, 0xf7, 0x52, 0x14, 0xfa, 0x6d, 0xb1, 0xbe,
+        0xd6, 0xf1, 0x6b, 0x3b, 0x09, 0x2d, 0x00, 0x25, 0x09, 0x88, 0x99, 0xc2,
+        0x62, 0x1f, 0xd9, 0x90, 0xd7, 0x60, 0xec, 0xb4, 0xd2, 0x7c, 0x9d, 0xa0,
+        0xb3, 0xd9, 0xdb, 0x5e, 0x61, 0x23, 0x4d, 0x56, 0xec, 0xa5, 0xe1, 0xf0,
+        0x42, 0x8d, 0x3a, 0x8d, 0x44, 0x1a, 0x88, 0x21, 0x5d, 0x30, 0xf0, 0xd4,
+        0x22, 0x9b, 0x11, 0x8f, 0x8b, 0xab, 0x3e, 0x03, 0xad, 0xdd, 0x57, 0x69,
+        0xe3, 0x87, 0xc2, 0x28, 0x77, 0xaf, 0x90, 0xd8, 0x64, 0xb7, 0xe3, 0xdf,
+        0xd5, 0xb8, 0xb5, 0xc5, 0xa9, 0xe0, 0x4c, 0x53, 0xba, 0x91, 0x60, 0x19,
+        0x4b, 0x16, 0x13, 0x68, 0x0a, 0xa1, 0x83, 0x1f, 0xa9, 0xf0, 0x4f, 0x86,
+        0xc9, 0x2d, 0xe9, 0xe6, 0x7a, 0xd4, 0x05, 0x74, 0x3c, 0xde, 0x81, 0x0f,
+        0x29, 0x3d, 0x5d, 0xb6, 0x14, 0xc2, 0x41, 0xcb, 0xb0, 0x69, 0xb2, 0xfa,
+        0xdc, 0xf1, 0xe4, 0x35, 0xad, 0x1e, 0xfe, 0xda, 0x4c, 0xaf, 0x26, 0xd9,
+        0x89, 0x37, 0xc9, 0x88, 0x5b, 0x5c, 0xfa, 0x45, 0x99, 0xa9, 0xd6, 0xcc,
+        0x94, 0xbd, 0xfe, 0x06, 0x61, 0x69, 0x4b, 0xfc, 0xd3, 0x19, 0x27, 0xee,
+        0xe3, 0xc7, 0x94, 0x52, 0x93, 0x5e, 0xc1, 0x19, 0x25, 0xea, 0x8d, 0xcb,
+        0x60, 0x5d, 0x82, 0xdd, 0x22, 0x47, 0x71, 0xd0, 0x69, 0x1d, 0xe5, 0x5c,
+        0x99, 0xa2, 0xc5, 0x12, 0x52, 0xd1, 0xbb, 0x82, 0x58, 0xb7, 0xca, 0xc6,
+        0x3a, 0xcc, 0x5c, 0x1b, 0xf4, 0x23, 0xe1, 0x90, 0x5b, 0x2e, 0x1c, 0xd9,
+        0xb9, 0xe8, 0x92, 0x3e, 0x7b, 0x41, 0x8d, 0xae, 0x83, 0xed, 0x41, 0xe4,
+        0x5c, 0x77, 0x37, 0xd4, 0xaf, 0x82, 0xfc, 0x8d, 0x4b, 0xf3, 0x40, 0x08,
+        0x08, 0xc3, 0xbc, 0x09, 0xc0, 0x65, 0x7c, 0x6a, 0x66, 0x1f, 0xa8, 0xcd,
+        0xac, 0x54, 0x61, 0x2c, 0xe0, 0x62, 0x33, 0x9a, 0x08, 0x12, 0x4f, 0xea,
+        0x38, 0x6a, 0x2c, 0x49, 0x00, 0x01, 0x1b, 0x44, 0x38, 0xb1, 0x62, 0xcf,
+        0xb9, 0x01, 0x15, 0x6a, 0xdc, 0x98, 0xd0, 0xce, 0xe7, 0x3b, 0x95, 0x9d,
+        0xbe, 0x98, 0xc0, 0x7a, 0xe0, 0x89, 0xa8, 0x3c, 0x59, 0xf6, 0xe1, 0x42,
+        0x2d, 0xc6, 0xaf, 0x8e, 0x37, 0xa0, 0x97, 0x9d, 0xef, 0x35, 0x00, 0x40,
+        0x8c, 0xe7, 0x22, 0x0f, 0xd9, 0x1f, 0xd1, 0xb0, 0x28, 0xea, 0xe1, 0xd8,
+        0x16, 0xa5, 0x2c, 0xcc, 0x2b, 0xcd, 0x8b, 0x1b, 0xfa, 0x32, 0xb3, 0xd0,
+        0xab, 0xc9, 0x55, 0x05, 0x16, 0x9b, 0x04, 0xac, 0x60, 0x6a, 0x3c, 0x5f,
+        0x91, 0x11, 0xa2, 0xb3, 0x67, 0x05, 0xec, 0xb5, 0x5a, 0xec, 0x58, 0xec,
+        0xb0, 0x41, 0x60, 0x77, 0x46, 0x7d, 0xf2, 0x80, 0x23, 0x4c, 0xc5, 0x52,
+        0xe8, 0xc4, 0x37, 0x6d, 0xdc, 0x28, 0x78, 0x2f, 0x66, 0x6c, 0xa7, 0x51,
+        0xde, 0x0e, 0xf7, 0x92, 0x1f, 0x6e, 0xaf, 0x33, 0x7b, 0xfa, 0x87, 0x77,
+        0xb0, 0x27, 0x71, 0xed, 0xb0, 0x1a, 0xbf, 0x05, 0x2b, 0xef, 0xe9, 0x20,
+        0x2a, 0x19, 0x0f, 0xd9, 0xe3, 0x03, 0x71, 0x48, 0x83, 0x33, 0xdd, 0xf5,
+        0xcc, 0xac, 0xc2, 0xe1, 0x2e, 0x05, 0xea, 0xa6, 0xe3, 0x5b, 0x53, 0xdb,
+        0x90, 0x8e, 0x58, 0x2c, 0xb5, 0xe3, 0xf8, 0x84, 0x2a, 0xc5, 0xa4, 0xa6,
+        0xe1, 0xf7, 0xe1, 0x09, 0x08, 0xf0, 0x50, 0x55, 0x43, 0xd2, 0xaf, 0x74,
+        0x70, 0x0c, 0xc1, 0xfc, 0x7d, 0xf0, 0xa9, 0x00, 0x3d, 0x63, 0x54, 0x6c,
+        0x0e, 0xed, 0xab, 0x61, 0x14, 0x8f, 0x3e, 0xb1, 0x0c, 0x4b, 0x0a, 0x95,
+        0xa8, 0x09, 0x1d, 0x65, 0xf6, 0xb4, 0xf5, 0x29, 0x3e, 0x81, 0x8a, 0x71,
+        0x6c, 0xfc, 0x90, 0x70, 0x98, 0x4e, 0xb1, 0xe0, 0xfb, 0x97, 0x88, 0xd3,
+        0x94, 0x31, 0x27, 0x1b, 0xda, 0x8c, 0x28, 0x95, 0x6d, 0x5e, 0x05, 0x09,
+        0x13, 0xc6, 0x93, 0x76, 0x07, 0x8b, 0x64, 0xc7, 0x5a, 0x1a, 0xbe, 0xaf,
+        0x43, 0x7d, 0xf0, 0x30, 0x33, 0x61, 0xa4, 0xbb, 0xf9, 0x7f, 0x77, 0xc4,
+        0x00, 0xf1, 0xdd, 0x5d, 0x5d, 0xbb, 0x9c, 0x4b, 0xbe, 0xfa, 0xd3, 0x31,
+        0xad, 0x14, 0x20, 0x62, 0xb0, 0x5b, 0xd2, 0xbf, 0x65, 0x05, 0xa9, 0x72,
+        0xab, 0x29, 0x60, 0xcf, 0x1f, 0x22, 0x4d, 0x02, 0x7f, 0xef, 0x02, 0xa0,
+        0x6b, 0xf6, 0x6d, 0xea, 0x95, 0xee, 0x62, 0xbd, 0xa2, 0x9a, 0xee, 0x1d,
+        0x8f, 0xd2, 0x0f, 0xc7, 0x3d, 0x54, 0xe9, 0x4b, 0xda, 0x83, 0x95, 0x17,
+        0xe7, 0x4b, 0xa4, 0x1c, 0x7f, 0x73, 0x26, 0x08, 0x1c, 0xf9, 0xfd, 0x51,
+        0xf1, 0xdc, 0x58, 0x24, 0x16, 0xdf, 0xc2, 0x87, 0x8a, 0x85, 0xd4, 0x03,
+        0x21, 0xd6, 0xe3, 0x1c, 0xd1, 0xe5, 0x99, 0x6b, 0x89, 0x29, 0x0c, 0x03,
+        0x6e, 0xdc, 0x14, 0xc2, 0x89, 0x77, 0xec, 0x32, 0x7d, 0xbf, 0x0d, 0xec,
+        0x4e, 0x74, 0x96, 0xdc, 0x1b, 0x78, 0x72, 0x37, 0x12, 0x3a, 0x4a, 0xd6,
+        0x60, 0xc8, 0x25, 0x0e, 0xa3, 0xe3, 0x24, 0x48, 0x3a, 0x78, 0x0f, 0xa5,
+        0x7b, 0xb0, 0x47, 0x0e, 0x76, 0x47, 0x5d, 0x78, 0x46, 0x53, 0x83, 0x8f,
+        0xde, 0x21, 0xcd, 0x09, 0xf2, 0x6e, 0x88, 0x98, 0xf4, 0x80, 0x6d, 0x73,
+        0x87, 0xf3, 0x1b, 0xdb, 0xf7, 0x34, 0x08, 0x73, 0x7a, 0xf5, 0x1e, 0x68,
+        0x9c, 0x25, 0x35, 0x39, 0x93, 0xbd, 0xa9, 0x9a, 0xf7, 0x25, 0x19, 0xfc,
+        0xb1, 0xdb, 0x32, 0xb3, 0x3c, 0x1d, 0x36, 0x4e, 0x91, 0x73, 0xe8, 0x18,
+        0xcf, 0xae, 0x33, 0xff, 0x0a, 0xf9, 0xe5, 0x82, 0xc0, 0x52, 0x23, 0x4f,
+        0xc5, 0x9e, 0x8a, 0xcc, 0x56, 0xc8, 0x53, 0xe5, 0x99, 0x36, 0xd1, 0x4f,
+        0xa8, 0x64, 0x46, 0xd5, 0x56, 0x30, 0x06, 0x07, 0x4e, 0x4d, 0x3d, 0x32,
+        0xa9, 0x4b, 0xd1, 0x68, 0x80, 0x58, 0x45, 0xb5, 0x2d, 0x12, 0x6c, 0x7b,
+        0x27, 0x6c, 0xa6, 0x71, 0x53, 0xc4, 0x7e, 0x22, 0x79, 0xe6, 0x2e, 0x04,
+        0x3d, 0xba, 0x22, 0x80, 0x5c, 0x9f, 0x50, 0x4f, 0x7f, 0x25, 0x32, 0x89,
+        0x18, 0x56, 0x3c, 0x5d, 0xd1, 0xda, 0xf8, 0xec, 0x6f, 0xd9, 0x57, 0x4f,
+        0x36, 0xcb, 0x7b, 0x89, 0xa0, 0x5f, 0xa7, 0x57, 0x8f, 0x3e, 0xe3, 0x1a,
+        0xb9, 0xcf, 0x5d, 0xbe, 0x0f, 0x70, 0x7e, 0x65, 0x2a, 0x6d, 0x3c, 0xab,
+        0x61, 0xcc, 0x5b, 0x49, 0x73, 0x42, 0xa8, 0x14, 0x28, 0xa5, 0x8f, 0x2e,
+        0xcd, 0x6b, 0x39, 0x09, 0x6e, 0x60, 0x3b, 0x93, 0x5b, 0xda, 0x87, 0x42,
+        0x51, 0x0e, 0x05, 0xc4, 0xad, 0x92, 0xac, 0xd0, 0x22, 0x94, 0xfd, 0x44,
+        0xb9, 0x2b, 0x7d, 0xdf, 0xbc, 0x79, 0x5a, 0x05, 0x24, 0x30, 0x5d, 0xd5,
+        0xf9, 0xac, 0x48, 0xfd, 0x83, 0x76, 0xc3, 0x0a, 0xb3, 0x1c, 0x40, 0x36,
+        0x43, 0xa9, 0x90, 0x88, 0x11, 0x5f, 0xbc, 0x0e, 0xea, 0x68, 0x0d, 0x96,
+        0x1b, 0x40, 0x33, 0x92, 0x91, 0x25, 0x81, 0xd5, 0x61, 0x40, 0x65, 0xec,
+        0xf4, 0x9d, 0x2d, 0x1e, 0xd7, 0x41, 0x2c, 0x07, 0x52, 0x23, 0x05, 0xcd,
+        0xdd, 0x33, 0xf3, 0xa8, 0xa3, 0x42, 0xe7, 0xc6, 0x8b, 0xc5, 0x21, 0x3c,
+        0x20, 0x1b, 0xba, 0x22, 0x12, 0xf5, 0xba, 0xf0, 0xfc, 0xe8, 0x0c, 0xad,
+        0x87, 0x89, 0x98, 0xef, 0xc0, 0x2b, 0xf3, 0x22, 0xdc, 0x4d, 0xa9, 0x40,
+        0x74, 0x41, 0x07, 0xc0, 0xa2, 0xc8, 0x01, 0xaa, 0x39, 0xa9, 0x3d, 0x6f,
+        0xa7, 0x27, 0x2b, 0xc1, 0x64, 0xcd, 0x7a, 0x6d, 0x99, 0x0b, 0xf1, 0x5f,
+        0xc5, 0x3a, 0xeb, 0xc3, 0x31, 0x3d, 0x7b, 0x25, 0x9b, 0x81, 0x88, 0xb2,
+        0x8e, 0x9c, 0x99, 0x24, 0x7f, 0xca, 0x69, 0x0d, 0xcb, 0xd2, 0x68, 0x89,
+        0x86, 0xe1, 0x98, 0x0f, 0x33, 0xa8, 0xae, 0xfb, 0x83, 0x01, 0x95, 0x37,
+        0x5d, 0x82, 0xbf, 0x49, 0x0e, 0xa8, 0xa1, 0x4f, 0x91, 0x47, 0xdb, 0xd6,
+        0x3d, 0x3c, 0xcc, 0x84, 0x00, 0x4b, 0xbd, 0x63, 0x6a, 0x36, 0x89, 0x17,
+        0x07, 0x21, 0xdb, 0xf1, 0x8c, 0xcb, 0xcb, 0xb9, 0x4a, 0x92, 0x68, 0x2f,
+        0x96, 0x1b, 0x28, 0x47, 0x13, 0x24, 0x21, 0xba, 0x6d, 0xc8, 0x5b, 0x40,
+        0xee, 0x8a, 0x3d, 0x86, 0x27, 0xa3, 0xcb, 0x35, 0x2f, 0x64, 0x31, 0x35,
+        0x82, 0x1c, 0x3e, 0x1a, 0x02, 0x26, 0x72, 0xb2, 0xf5, 0x7d, 0xfd, 0xa2,
+        0xd0, 0x6a, 0x5c, 0x04, 0x42, 0x2c, 0x5f, 0x84, 0xd0, 0xd7, 0x70, 0x1e,
+        0x56, 0x74, 0x1f, 0xe0, 0x1b, 0x66, 0x1e, 0x6a, 0x07, 0x09, 0x23, 0x97,
+        0x33, 0x1c, 0xc1, 0xf9, 0x71, 0xbb, 0xad, 0xd8, 0x8d, 0x42, 0x43, 0x38,
+        0x1d, 0x4a, 0x19, 0x42, 0x4a, 0x31, 0xed, 0xb9, 0xf5, 0x0b, 0xfd, 0xea,
+        0xd0, 0xc3, 0x44, 0xc7, 0x41, 0x5d, 0xc9, 0x0c, 0x1e, 0xfd, 0xf1, 0x43,
+        0xb0, 0xdb, 0x61, 0x35, 0xdb, 0xf6, 0x59, 0x20, 0xda, 0xf3, 0x9f, 0x4e,
+        0x5a, 0x16, 0x6d, 0x96, 0x7e, 0xc8, 0xb2, 0xb0, 0xf0, 0x52, 0x77, 0x07,
+        0x32, 0xf0, 0x87, 0x4b, 0x84, 0x6d, 0xdb, 0xa9, 0x16, 0x4a, 0xa9, 0x2c,
+        0xb7, 0x4e, 0xeb, 0x3c, 0xf2, 0xba, 0x37, 0x71, 0x02, 0xd0, 0xd1, 0x6f,
+        0xb6, 0x86, 0xc1, 0x76, 0xf1, 0x59, 0x77, 0x7f, 0x17, 0x71, 0x56, 0xa8,
+        0x07, 0xd7, 0xc3, 0x3a, 0xa8, 0xe6, 0xef, 0x47, 0x40, 0xc3, 0x9e, 0x5c,
+        0xc0, 0xcb, 0x9f, 0x05, 0x19, 0xf3, 0xbb, 0xfb, 0xd4, 0x2d, 0x39, 0x73,
+        0x4e, 0x09, 0x88, 0x8b, 0x75, 0xca, 0x02, 0x27, 0x19, 0x94, 0x43, 0x11,
+        0x01, 0xae, 0xd3, 0xa7, 0x20, 0xdc, 0xd1, 0x23, 0x72, 0x26, 0x79, 0x78,
+        0x24, 0xea, 0x2a, 0x3a, 0xa9, 0x06, 0xce, 0xa8, 0x04, 0x60, 0xdd, 0xca,
+        0xf0, 0x3e, 0x09, 0x98, 0x4b, 0x1c, 0x23, 0xc0, 0x1a, 0x56, 0xa0, 0xfc,
+        0xa7, 0xaf, 0xd7, 0xad, 0xe4, 0x7e, 0x83, 0xef, 0xbd, 0xae, 0xca, 0xb2,
+        0xc4, 0xdc, 0x1b, 0xa1, 0xe8, 0xef, 0xe3, 0x23, 0x73, 0x80, 0x7d, 0x4f,
+        0x5c, 0xc8, 0x21, 0x50, 0x6c, 0xb7, 0x17, 0x81, 0xad, 0xcd, 0x25, 0xac,
+        0x2d, 0x13, 0x09, 0x10, 0xdb, 0x65, 0x92, 0x34, 0x2c, 0x98, 0x93, 0xc3,
+        0x3a, 0xec, 0xba, 0x31, 0xdd, 0x55, 0xb6, 0xc6, 0x7f, 0xa0, 0xc8, 0xd2,
+        0x91, 0x0b, 0x52, 0x33, 0x85, 0x29, 0x70, 0x16, 0x1a, 0x2b, 0x67, 0x84,
+        0xba, 0xab, 0xda, 0x87, 0xc3, 0xc9, 0x2a, 0x64, 0x5b, 0x54, 0x4a, 0xc5,
+        0xc0, 0xcf, 0xca, 0x94, 0xfd, 0xe4, 0x45, 0x3b, 0xca, 0x6a, 0x7a, 0x04,
+        0xd1, 0x7b, 0xdd, 0x28, 0x05, 0xc5, 0x13, 0xda, 0x5f, 0x7e, 0x79, 0xfa,
+        0xad, 0xba, 0xde, 0xf4, 0xe3, 0x4d, 0xfe, 0xb2, 0x78, 0x57, 0x44, 0xc7,
+        0xbf, 0x60, 0x2d, 0x95, 0xeb, 0x58, 0x6b, 0x7e, 0x8b, 0x5f, 0x55, 0x9d,
+        0xe9, 0x9c, 0x39, 0x35, 0xb3, 0x0f, 0xef, 0xd6, 0xd4, 0x31, 0x9d, 0xfd,
+        0xe6, 0xc0, 0x2d, 0x45, 0x56, 0x58, 0x87, 0x10, 0xd0, 0x73, 0xea, 0x7b,
+        0x6a, 0xe5, 0x96, 0xf8, 0xa1, 0x78, 0x19, 0x09, 0x0f, 0xea, 0x1a, 0x3d,
+        0x3e, 0x6d, 0x6a, 0x01, 0xb6, 0xd7, 0x44, 0x88, 0x51, 0x26, 0xa0, 0x6b,
+        0xde, 0x43, 0x19, 0x45, 0x73, 0x17, 0xf5, 0x6d, 0xac, 0x13, 0xe3, 0xbc,
+        0xc2, 0x89, 0x64, 0x65, 0xc7, 0x00, 0x06, 0x7c, 0xd5, 0x33, 0x0d, 0x18,
+        0xc2, 0xe5, 0x75, 0x6c, 0xd6, 0x8a, 0xdb, 0xf5, 0x62, 0xc4, 0x7a, 0x1b,
+        0xca, 0x61, 0x1c, 0x3e, 0x0c, 0x18, 0x11, 0xa4, 0x02, 0x61, 0xed, 0x5f,
+        0xc0, 0x03, 0x98, 0xaf, 0xf8, 0x64, 0xf7, 0xd6, 0xe7, 0x11, 0x2a, 0x0e,
+        0x44, 0x45, 0xcf, 0xd3, 0x12, 0x3c, 0xf7, 0x65, 0x3e, 0xdf, 0xa1, 0xca,
+        0xc9, 0x44, 0xbc, 0x04, 0x63, 0x82, 0x15, 0x55, 0xad, 0xb5, 0xb9, 0x67,
+        0x7e, 0x4d, 0x06, 0xb1, 0xdc, 0x4b, 0xbc, 0xc8, 0xac, 0x29, 0x78, 0xdc,
+        0x7c, 0x3f, 0x17, 0xa4, 0xb0, 0xb8, 0x24, 0x1e, 0x91, 0x4a, 0xcc, 0x17,
+        0x4a, 0x9a, 0x58, 0x15, 0xc1, 0x68, 0x82, 0xea, 0x13, 0xca, 0xea, 0xa4,
+        0x19, 0xd4, 0xca, 0x09, 0x07, 0x88, 0xd7, 0x1b, 0x43, 0x18, 0x33, 0x08,
+        0xcf, 0xc7, 0x7c, 0xc5, 0x11, 0x9c, 0x2b, 0x87, 0xc8, 0x5b, 0x22, 0x58,
+        0xc5, 0x06, 0x42, 0x11, 0x0b, 0x98, 0xb0, 0x7f, 0xb3, 0xdc, 0x0f, 0x1f,
+        0xb3, 0x27, 0x30, 0x81, 0x2e, 0x0d, 0x78, 0xa9, 0xe6, 0xc5, 0x9e, 0x23,
+        0xa4, 0x9c, 0x1e, 0x88, 0xbc, 0xba, 0x8e, 0x90, 0x2c, 0xbb, 0x95, 0xe8,
+        0x63, 0xc9, 0xb9, 0x05, 0x90, 0x4d, 0x37, 0xff, 0x97, 0x35, 0x7b, 0x60,
+        0x12, 0x25, 0x50, 0x1d, 0xe9, 0x1b, 0x13, 0x4b, 0x9e, 0xce, 0x12, 0x89,
+        0x85, 0x90, 0xdb, 0xa2, 0xb6, 0xc0, 0xdf, 0xc6, 0x01, 0x28, 0x5d, 0x7f,
+        0x62, 0xc7, 0x2e, 0x7a, 0xa7, 0xba, 0xb5, 0x19, 0xa7, 0x3d, 0x94, 0x24,
+        0x10, 0xe9, 0x8e, 0xbe, 0x73, 0xd2, 0xb7, 0xa5, 0x21, 0xea, 0x46, 0xe6,
+        0x27, 0x41, 0x83, 0xa1, 0xe7, 0x7b, 0xb5, 0x14, 0x62, 0x53, 0x75, 0x29,
+        0x81, 0xa2, 0x86, 0xf2, 0x11, 0x37, 0xaf, 0xbf, 0xd8, 0x17, 0xd2, 0x9e,
+        0x89, 0x76, 0x93, 0xc0, 0xe1, 0x70, 0xa4, 0x3e, 0x83, 0x27, 0xf9, 0x65,
+        0x98, 0x0e, 0xd2, 0x96, 0xa9, 0x7a, 0xa6, 0x89, 0xf4, 0x4c, 0x53, 0x4e,
+        0x71, 0x27, 0x5a, 0x93, 0xed, 0xa8, 0x27, 0x04, 0x69, 0xe0, 0x0a, 0xbf,
+        0xe5, 0x1b, 0x88, 0xb3, 0xcc, 0xc4, 0x6f, 0x5a, 0x01, 0x6b, 0xcc, 0xfb,
+        0x4f, 0xdf, 0xf5, 0xb4, 0xc9, 0xea, 0xb7, 0x50, 0xbf, 0x12, 0xc0, 0xd6,
+        0xb8, 0x4d, 0x90, 0x12, 0x13, 0x30, 0xc2, 0xc0, 0xa4, 0x32, 0xd5, 0xa4,
+        0x7f, 0xda, 0xf4, 0x76, 0x02, 0x5f, 0x37, 0x2c, 0xc1, 0xd9, 0x4b, 0x2f,
+        0xf4, 0xe3, 0x04, 0x28, 0x98, 0x14, 0x20, 0x72, 0x8c, 0x01, 0xb6, 0x02,
+        0x00, 0x8d, 0xfb, 0x12, 0x8e, 0x7c, 0x63, 0x6a, 0x3e, 0x5c, 0x2c, 0xb8,
+        0xaa, 0xe1, 0xc5, 0xd5, 0x10, 0x15, 0xcf, 0x23, 0xb7, 0x21, 0x9a, 0x21,
+        0xe4, 0x35, 0xb1, 0xa7, 0x48, 0x9a, 0x49, 0xf4, 0x31, 0x4a, 0xa9, 0x3c,
+        0x91, 0x5f, 0x8e, 0x8e, 0x3c, 0xf1, 0xec, 0x9e, 0xb0, 0x23, 0x8f, 0x22,
+        0xac, 0xc5, 0xb7, 0x4d, 0x2c, 0xf1, 0x4d, 0x22, 0xd8, 0x31
+    },
+    .commitments = {
+        { 0x7a, 0x3c, 0x6d, 0xc5, 0x93, 0xb9, 0x65, 0xa4, 0xa3, 0x11, 0x8a, 0x0e, 0x9e, 0x80, 0xd0, 0x78, 0x2c, 0xb4, 0x13, 0x99, 0x79, 0x0b, 0xa7, 0xf6, 0x49, 0x77, 0x1c, 0x74, 0x43, 0xa3, 0x6d, 0x01 },
+        { 0x0b, 0xbb, 0x5a, 0xfb, 0xb7, 0xc5, 0x00, 0x5e, 0x14, 0x9f, 0x8b, 0x5b, 0xf5, 0xfe, 0x35, 0x40, 0xb3, 0x7d, 0x31, 0xe3, 0xc2, 0xb2, 0x14, 0x33, 0x73, 0x59, 0xda, 0xe3, 0x31, 0x30, 0x23, 0x11 },
+        { 0x93, 0x35, 0x52, 0xa5, 0xc9, 0xd7, 0x3e, 0x50, 0xf6, 0xdb, 0xcf, 0xa4, 0x1e, 0xa3, 0xd0, 0xa5, 0x29, 0x46, 0xb1, 0x87, 0x8e, 0xda, 0x5c, 0x96, 0xd7, 0xd8, 0xb0, 0xe4, 0x71, 0x68, 0x0b, 0x27 },
+        { 0x62, 0x8b, 0xa8, 0x4e, 0x08, 0x63, 0xb6, 0x27, 0x72, 0x7d, 0xf9, 0xa1, 0x98, 0xb0, 0x9d, 0xd0, 0xe3, 0x1a, 0xff, 0x7c, 0xba, 0xec, 0x87, 0xcd, 0x93, 0x3d, 0x0f, 0x76, 0x58, 0xea, 0xcb, 0x3a },
+        { 0x90, 0x5f, 0x7a, 0x5e, 0x88, 0xa0, 0x16, 0xa1, 0x66, 0x8d, 0xdd, 0x41, 0xea, 0xcb, 0x91, 0x28, 0x78, 0xc7, 0xcb, 0xeb, 0x42, 0xa9, 0x31, 0x90, 0x33, 0x98, 0xe0, 0x5f, 0xdc, 0xe6, 0x8b, 0x29 },
+    },
+    .anchor = {
+        0x71, 0x83, 0x98, 0x6f, 0x46, 0xfc, 0x71, 0x28, 0x5e, 0x3b, 0xcf, 0x81,
+        0x47, 0x3d, 0x3d, 0x2d, 0x78, 0xf3, 0x1f, 0x19, 0xa5, 0xea, 0xa3, 0xb6,
+        0x2f, 0xb9, 0x06, 0x20, 0x4f, 0x2e, 0x2a, 0x31
+    }
+},
+{
+    .bundle = {
+        0x05, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x5b, 0x69, 0x27,
+        0x12, 0x71, 0x0a, 0x63, 0x18, 0xf3, 0x0c, 0x30, 0x21, 0xb9, 0x62, 0x23,
+        0x3b, 0xd2, 0x80, 0x52, 0x22, 0x07, 0xdd, 0xf4, 0x04, 0x09, 0x70, 0x0f,
+        0xf1, 0x42, 0xb8, 0x74, 0x13, 0x72, 0xd3, 0x30, 0xcb, 0xa1, 0xd6, 0x0a,
+        0x1e, 0x27, 0x74, 0x57, 0xdb, 0x55, 0x36, 0xc9, 0xd0, 0x44, 0x75, 0x0a,
+        0x65, 0x6e, 0xdb, 0x86, 0x9b, 0x97, 0x6a, 0x9d, 0xb9, 0xe9, 0x31, 0xae,
+        0x05, 0x94, 0x92, 0xc9, 0x01, 0x95, 0x73, 0x31, 0xd5, 0xe7, 0x94, 0xe5,
+        0x9a, 0xd4, 0x73, 0x67, 0x51, 0x68, 0x0f, 0x2f, 0xde, 0xca, 0x12, 0x3f,
+        0xf3, 0xcb, 0xe0, 0xc6, 0x3a, 0x2d, 0xc8, 0x61, 0x36, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x9a, 0xf3, 0x29, 0xb7, 0xd4, 0x66, 0xbd, 0xa9, 0xca, 0x95, 0x5f,
+        0x39, 0x99, 0x2c, 0xee, 0xa1, 0x0e, 0x3b, 0x0f, 0xe5, 0xa1, 0x72, 0x71,
+        0x44, 0xf3, 0x7e, 0xa9, 0x23, 0x89, 0x1b, 0xda, 0x16, 0xed, 0x58, 0xf2,
+        0x8f, 0xd7, 0x64, 0x70, 0xfb, 0x06, 0x40, 0xa7, 0x1f, 0x7c, 0xbf, 0xd7,
+        0x9e, 0x17, 0xde, 0xd3, 0xbe, 0x28, 0x27, 0x5b, 0x54, 0x49, 0x95, 0x30,
+        0xb6, 0xd0, 0x09, 0xcb, 0x1e, 0x5c, 0xd8, 0x54, 0x1a, 0x4c, 0x92, 0x0e,
+        0x4d, 0x7e, 0xac, 0x65, 0x71, 0xa6, 0xe9, 0x3b, 0x40, 0xcb, 0xda, 0x99,
+        0xf3, 0x48, 0xf1, 0x70, 0x40, 0x0f, 0x91, 0x81, 0xb8, 0x1e, 0xb2, 0xcf,
+        0x17, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x66, 0x4e, 0x28, 0x90, 0x2b, 0xd0, 0xd2,
+        0x34, 0x1b, 0x74, 0x05, 0xfd, 0x26, 0x45, 0x2f, 0x07, 0xa4, 0x08, 0x67,
+        0x34, 0x80, 0xf0, 0xf1, 0x92, 0xc6, 0xcc, 0xdc, 0x9e, 0x9f, 0xed, 0x24,
+        0x1b, 0x69, 0x73, 0xeb, 0xf8, 0x49, 0x88, 0xf5, 0x3c, 0xc6, 0xd5, 0x20,
+        0x7b, 0x51, 0x13, 0x89, 0xf6, 0x38, 0x40, 0x75, 0x37, 0xb3, 0xad, 0x54,
+        0xa3, 0xec, 0xca, 0x76, 0x70, 0xdd, 0x27, 0x1a, 0xaf, 0x65, 0x90, 0x97,
+        0x4e, 0xcb, 0x6e, 0x62, 0xb4, 0x8d, 0x21, 0x9f, 0xcf, 0xf7, 0x5d, 0x6d,
+        0xf8, 0x55, 0x8e, 0xb6, 0xb5, 0xd4, 0x3e, 0x17, 0x3c, 0x88, 0x45, 0xb0,
+        0x59, 0x31, 0x5c, 0x56, 0x10, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xdb, 0xcc, 0x7d,
+        0x26, 0x70, 0xae, 0xde, 0x1c, 0x47, 0x9f, 0xaa, 0x82, 0x59, 0xce, 0xa3,
+        0x51, 0xfc, 0x51, 0x9f, 0xea, 0xb9, 0xa1, 0x8b, 0x22, 0x1a, 0x82, 0xb9,
+        0x47, 0xae, 0x90, 0x0f, 0x0a, 0x31, 0xb4, 0xa1, 0xe2, 0x6d, 0xe9, 0xea,
+        0x3a, 0xda, 0xbb, 0xcb, 0xb0, 0x29, 0x5a, 0xe3, 0xa9, 0xcf, 0x77, 0x78,
+        0xa6, 0xab, 0xfe, 0x57, 0x84, 0x31, 0x70, 0x78, 0xbc, 0x2d, 0x8e, 0xc9,
+        0x38, 0x0c, 0xe2, 0xec, 0x64, 0xa3, 0xd3, 0x5a, 0xca, 0x95, 0x4f, 0x9f,
+        0x77, 0xfc, 0xb6, 0x96, 0xb2, 0x13, 0xb1, 0x09, 0xc9, 0xef, 0x55, 0x14,
+        0xf2, 0x84, 0x1a, 0xd0, 0xd9, 0x6f, 0x49, 0x17, 0x38, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x8d, 0x6e, 0xb3, 0x5d, 0x63, 0xf8, 0xa8, 0xa0, 0x6d, 0xf6, 0x03,
+        0x76, 0xee, 0x22, 0xe7, 0xb6, 0x41, 0xb1, 0x3f, 0xb1, 0x01, 0x1b, 0xb4,
+        0x52, 0x28, 0x02, 0xf9, 0xc1, 0xb9, 0x22, 0xc5, 0x3c, 0xc2, 0xfe, 0x3a,
+        0x79, 0x56, 0x68, 0x11, 0xbd, 0x98, 0x90, 0xee, 0xd0, 0xea, 0xe4, 0x4a,
+        0x6d, 0xda, 0x6a, 0x02, 0x6b, 0x9b, 0x54, 0x34, 0xd7, 0x76, 0x29, 0x47,
+        0x6b, 0x3b, 0xa4, 0x9c, 0x90, 0x2c, 0x02, 0x15, 0x93, 0x8c, 0x51, 0x65,
+        0xff, 0xd4, 0x67, 0x0d, 0xd5, 0xec, 0xff, 0xae, 0xb2, 0x4c, 0x4c, 0x35,
+        0xde, 0x59, 0x4e, 0xad, 0xc8, 0xf4, 0xd4, 0xd6, 0x0e, 0xac, 0xb9, 0xc0,
+        0x31, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x4d, 0xcb,
+        0x28, 0xd4, 0x44, 0x6e, 0x07, 0x00, 0xfa, 0x2f, 0x5c, 0x60, 0x1f, 0xff,
+        0x26, 0xa7, 0x19, 0x08, 0x14, 0x99, 0x09, 0x04, 0xe3, 0xd9, 0xc9, 0x3f,
+        0xec, 0x2c, 0xf6, 0x88, 0x8d, 0x0d, 0xb8, 0x22, 0x0c, 0x76, 0xa6, 0x6d,
+        0x4a, 0x31, 0xfd, 0xb5, 0x07, 0xee, 0xa5, 0x68, 0xc0, 0xa1, 0x83, 0xc6,
+        0x77, 0xc2, 0x0a, 0x53, 0x3b, 0x38, 0xea, 0x9e, 0xfb, 0x06, 0x4e, 0xc2,
+        0x16, 0x5a, 0x8e, 0x95, 0xc0, 0xb8, 0x5f, 0x3c, 0x5a, 0x98, 0xb5, 0x02,
+        0xdb, 0x8c, 0xd8, 0x33, 0x42, 0x12, 0x22, 0x18, 0xdf, 0x80, 0x52, 0x95,
+        0x6e, 0x9b, 0x3f, 0xa1, 0x99, 0xda, 0x62, 0x8d, 0xed, 0xfb, 0xdb, 0x9f,
+        0x42, 0x84, 0xb4, 0x09, 0xc7, 0x28, 0x5c, 0x51, 0x84, 0xf4, 0xa8, 0x2d,
+        0xea, 0xc2, 0x96, 0x9f, 0x17, 0x06, 0xc0, 0x8a, 0x96, 0x32, 0x73, 0x65,
+        0xc6, 0xaa, 0x26, 0x6a, 0xe5, 0xe8, 0xb3, 0x81, 0xd9, 0x1a, 0x2b, 0x5e,
+        0xed, 0x3f, 0x17, 0xfd, 0x28, 0xd4, 0x65, 0x66, 0xf4, 0x8f, 0xa0, 0x3c,
+        0x39, 0xd1, 0x76, 0xe8, 0xab, 0x74, 0x3b, 0x3e, 0x7d, 0x85, 0x07, 0x24,
+        0x1d, 0x3e, 0x1a, 0x6b, 0xed, 0x61, 0x93, 0x2a, 0x95, 0x83, 0xfb, 0x9c,
+        0x2d, 0xcf, 0x41, 0x07, 0xb3, 0x9b, 0x48, 0x0b, 0xf6, 0xb9, 0x32, 0x8d,
+        0x28, 0x1f, 0xbd, 0xbb, 0x6d, 0x77, 0xc3, 0x7d, 0x15, 0xde, 0x6b, 0xfa,
+        0x32, 0xb2, 0x1e, 0xf7, 0x27, 0x15, 0x3a, 0x86, 0xb5, 0xc2, 0xf2, 0xc0,
+        0xce, 0x6a, 0xfd, 0xf6, 0x1f, 0x56, 0xba, 0xfa, 0x06, 0xaf, 0x26, 0x4a,
+        0x32, 0xbf, 0x69, 0xdf, 0x43, 0xae, 0xd4, 0xde, 0x6f, 0x4f, 0xe1, 0x2a,
+        0x41, 0x76, 0xcb, 0x2f, 0xe9, 0x1a, 0x7a, 0x71, 0x4d, 0x8e, 0xc0, 0x24,
+        0x2f, 0x72, 0x06, 0x68, 0x93, 0x2e, 0xa5, 0x24, 0x41, 0xf4, 0x88, 0x58,
+        0x8a, 0xb7, 0xed, 0x42, 0x0c, 0x39, 0x58, 0xab, 0xc2, 0xf6, 0x51, 0x44,
+        0xb8, 0x2d, 0x76, 0x82, 0x06, 0x55, 0xa8, 0x3e, 0x2b, 0x08, 0xc2, 0x54,
+        0x2b, 0x58, 0xf8, 0xda, 0x65, 0xf5, 0x8f, 0x61, 0x45, 0x3f, 0xd0, 0xf9,
+        0x6d, 0xfc, 0x6d, 0x95, 0xb1, 0xa8, 0x94, 0x5c, 0x01, 0x5b, 0x69, 0x72,
+        0xf7, 0x6c, 0xf1, 0x26, 0x0d, 0x00, 0xcc, 0x79, 0x09, 0xac, 0x01, 0x22,
+        0x01, 0xe0, 0xd0, 0x84, 0xec, 0xe4, 0x4d, 0x80, 0x44, 0x3c, 0xd7, 0x97,
+        0xa1, 0x13, 0xc4, 0xa7, 0x38, 0x88, 0x2f, 0x43, 0xcc, 0xce, 0x8e, 0xf1,
+        0x7a, 0x2c, 0x12, 0x5a, 0xe8, 0x78, 0xa7, 0x6b, 0x78, 0xd1, 0xf1, 0x01,
+        0xb1, 0xc1, 0x6d, 0xdb, 0xcb, 0xc1, 0x98, 0x07, 0xa4, 0x98, 0x8e, 0xcd,
+        0x9f, 0xa4, 0x29, 0x56, 0xeb, 0xe9, 0x87, 0x10, 0x27, 0x0b, 0x7e, 0x2a,
+        0x29, 0xb4, 0xd5, 0x8f, 0x4b, 0x23, 0x9b, 0x62, 0xc0, 0x41, 0x10, 0x62,
+        0xb6, 0xbe, 0x2a, 0x12, 0x26, 0xc9, 0x3e, 0x18, 0x48, 0xbe, 0x49, 0x5b,
+        0xd5, 0x41, 0x21, 0x3d, 0x59, 0x33, 0x32, 0xae, 0x60, 0xd2, 0xe8, 0x29,
+        0xf6, 0xe3, 0x84, 0x94, 0x88, 0x6e, 0x57, 0x94, 0xd9, 0x7a, 0x0d, 0x0c,
+        0x22, 0x22, 0xe6, 0xca, 0xa7, 0xa3, 0x2b, 0x00, 0x0d, 0xf5, 0x8c, 0xf7,
+        0xeb, 0x3c, 0x21, 0x57, 0x26, 0x77, 0x38, 0xb0, 0xe3, 0x86, 0x88, 0xff,
+        0x5c, 0x9a, 0x80, 0xfe, 0x82, 0x14, 0xc0, 0x57, 0x83, 0x71, 0x32, 0x1a,
+        0x85, 0x8b, 0x7b, 0x56, 0x02, 0x40, 0x68, 0x43, 0xbd, 0xb3, 0x84, 0x7a,
+        0x00, 0x97, 0xca, 0xcd, 0x02, 0x68, 0xe8, 0x5d, 0xcc, 0x40, 0x98, 0x5e,
+        0x5a, 0x36, 0xc7, 0xf0, 0x2b, 0xa7, 0x99, 0xbd, 0xd0, 0x66, 0x2b, 0xb0,
+        0xf5, 0xff, 0x9b, 0x51, 0x8f, 0x19, 0x89, 0x23, 0x88, 0x75, 0xdb, 0xad,
+        0xaf, 0xc9, 0x65, 0x73, 0x38, 0x26, 0xff, 0xcc, 0x7b, 0xaf, 0xef, 0xd1,
+        0x3e, 0xaf, 0x82, 0xd7, 0xf1, 0xff, 0x01, 0x87, 0x57, 0x58, 0x5f, 0x45,
+        0x1f, 0xcf, 0x01, 0x62, 0x74, 0x31, 0x41, 0x28, 0x14, 0xcb, 0x12, 0x24,
+        0x46, 0xc0, 0x39, 0x3a, 0x8a, 0xa1, 0x2a, 0xc7, 0x19, 0x35, 0xee, 0x0b,
+        0xa0, 0xd5, 0xda, 0xb6, 0x07, 0xaf, 0x93, 0x69, 0xec, 0xaf, 0xba, 0xe3,
+        0x16, 0xf8, 0x9e, 0x4e, 0x09, 0xad, 0xcb, 0x02, 0x08, 0x6e, 0x08, 0x58,
+        0x2c, 0x70, 0x4b, 0x83, 0x69, 0x9a, 0x02, 0x6c, 0x27, 0xe2, 0xd9, 0x82,
+        0x02, 0x93, 0xb3, 0xe7, 0x9c, 0x82, 0x41, 0x26, 0x27, 0x52, 0x3a, 0x2d,
+        0x03, 0x70, 0x23, 0xc4, 0xf1, 0x68, 0x3d, 0xc0, 0x38, 0x43, 0x71, 0xf2,
+        0x34, 0x16, 0xed, 0xb9, 0xc2, 0xf9, 0xa1, 0x63, 0x8f, 0xc3, 0x4b, 0xef,
+        0x41, 0x93, 0x27, 0xd6, 0x6e, 0x41, 0x83, 0xd0, 0x1f, 0x51, 0x98, 0x24,
+        0x15, 0xb6, 0xf6, 0x46, 0x8c, 0x91, 0x44, 0xa4, 0x79, 0xeb, 0x3a, 0x2c,
+        0x40, 0xea, 0xaf, 0x75, 0x62, 0xbf, 0x40, 0x4c, 0x6f, 0x45, 0x31, 0x76,
+        0xdb, 0x06, 0x6e, 0xe2, 0x57, 0xed, 0xec, 0xd4, 0x7a, 0xd6, 0xd0, 0xf3,
+        0x54, 0x3d, 0xc7, 0x69, 0xad, 0x7a, 0xbf, 0xdc, 0x25, 0x6c, 0xbe, 0xa6,
+        0xa7, 0x88, 0xc7, 0xb1, 0x2f, 0x2e, 0xea, 0xb6, 0x50, 0x3d, 0x87, 0xd5,
+        0xd1, 0xbf, 0xd2, 0xe1, 0xbb, 0x17, 0x86, 0xa8, 0xb2, 0xab, 0x37, 0xb8,
+        0xb3, 0x48, 0x59, 0x9f, 0xc0, 0x3d, 0x53, 0xbb, 0x7f, 0x47, 0x10, 0x28,
+        0x98, 0xf1, 0xba, 0x1b, 0x01, 0x8e, 0x7b, 0x07, 0xeb, 0x7d, 0x0a, 0x26,
+        0x3e, 0x54, 0x15, 0x9e, 0xb9, 0xed, 0xc0, 0xcd, 0x7b, 0x49, 0x8d, 0x2a,
+        0xc9, 0xc9, 0x57, 0xaf, 0xe5, 0x8e, 0x4c, 0xcc, 0x19, 0xb7, 0x70, 0x38,
+        0x72, 0x32, 0xb3, 0x87, 0x96, 0x6c, 0xa9, 0xc7, 0x28, 0xa2, 0x6d, 0x0a,
+        0x4a, 0x7d, 0x6b, 0xc3, 0x55, 0x8e, 0x2e, 0x55, 0x0b, 0x79, 0xc7, 0xb0,
+        0xcc, 0x68, 0x5b, 0x43, 0x14, 0x4e, 0x5b, 0xd1, 0x1c, 0x00, 0xe9, 0x8d,
+        0xba, 0xa7, 0x28, 0xd3, 0xe8, 0x3c, 0x0a, 0x46, 0x2f, 0xb9, 0xaa, 0x10,
+        0x0c, 0xf2, 0xae, 0x97, 0x48, 0xcc, 0x3b, 0x37, 0xd2, 0x8a, 0x3e, 0x94,
+        0x51, 0x7f, 0x65, 0xb2, 0x87, 0x8d, 0x1f, 0x68, 0xe4, 0xaf, 0x1d, 0xb0,
+        0x08, 0x8f, 0x34, 0x13, 0xec, 0xf0, 0xf6, 0x0b, 0x85, 0x70, 0x67, 0xa0,
+        0x64, 0x52, 0x8a, 0x49, 0x3a, 0x4c, 0x42, 0xfc, 0x50, 0xbe, 0x19, 0xff,
+        0x0f, 0x54, 0x0b, 0xe2, 0xac, 0x3d, 0x4f, 0x62, 0x47, 0xdc, 0xbd, 0x09,
+        0x0e, 0x6c, 0xca, 0x0e, 0x27, 0x3b, 0x33, 0x23, 0x22, 0x6c, 0x70, 0x3c,
+        0xc8, 0x2b, 0xf5, 0x9b, 0xa6, 0x75, 0x7a, 0x56, 0x16, 0xb2, 0x0c, 0xb5,
+        0xde, 0x59, 0xec, 0x2e, 0x56, 0xee, 0xaf, 0xb5, 0x0b, 0xd9, 0x85, 0x24,
+        0x4d, 0x01, 0xfb, 0x5b, 0x5a, 0xd8, 0x89, 0x3b, 0x37, 0x89, 0x9d, 0x7e,
+        0x77, 0x25, 0xbc, 0x19, 0x00, 0x19, 0x71, 0x2f, 0x99, 0x92, 0x3b, 0x36,
+        0x5d, 0x02, 0x27, 0x02, 0x8e, 0x35, 0x0b, 0x42, 0x45, 0x50, 0xf6, 0x2b,
+        0x26, 0x40, 0x9a, 0x61, 0xac, 0x46, 0x7a, 0x95, 0x1e, 0x34, 0xc3, 0xe4,
+        0xef, 0x15, 0x56, 0x08, 0xb3, 0x51, 0xd1, 0x1b, 0xc5, 0xb4, 0xb7, 0xf7,
+        0x93, 0x95, 0xe4, 0x7f, 0x95, 0x63, 0xc8, 0xe1, 0x2c, 0x32, 0x23, 0xa0,
+        0xa1, 0x3d, 0xaa, 0x13, 0xec, 0xfb, 0x1d, 0xc0, 0x5e, 0x90, 0x88, 0x0c,
+        0x78, 0x70, 0x22, 0x9f, 0x17, 0x1d, 0x7a, 0x5a, 0x70, 0x37, 0x43, 0x6f,
+        0x4f, 0x8a, 0xda, 0x6b, 0xb6, 0x0e, 0xa3, 0x56, 0x94, 0xb8, 0x83, 0x85,
+        0xe3, 0x0a, 0x9b, 0xc7, 0xca, 0xb8, 0xda, 0x06, 0x3e, 0x43, 0xfa, 0x67,
+        0x91, 0xb9, 0x15, 0x96, 0x59, 0x83, 0x6a, 0x85, 0x3f, 0x7b, 0x3f, 0xc4,
+        0x28, 0x8e, 0x45, 0x05, 0x74, 0xf5, 0x1b, 0xb2, 0x5e, 0x24, 0xa3, 0x1a,
+        0xed, 0x9c, 0xfb, 0xb3, 0xc7, 0xe3, 0x63, 0x4e, 0x87, 0x7f, 0x9e, 0x35,
+        0x8b, 0x99, 0x0b, 0x65, 0x1d, 0xff, 0xe1, 0x60, 0x2a, 0x9e, 0xcf, 0x57,
+        0xc2, 0x1a, 0xbf, 0xf7, 0xc3, 0x5f, 0x71, 0x77, 0x6b, 0xaf, 0x19, 0xc6,
+        0xb4, 0x00, 0x55, 0xc9, 0xfd, 0xd5, 0x96, 0x6d, 0x53, 0xcc, 0xef, 0x56,
+        0x73, 0xe2, 0x41, 0x56, 0x3f, 0x7b, 0x5f, 0x3c, 0xf0, 0x42, 0x0f, 0xc0,
+        0x23, 0x2f, 0x0d, 0x4e, 0xb6, 0x6e, 0x00, 0x92, 0x63, 0x36, 0x00, 0x0d,
+        0x27, 0x57, 0x08, 0xd9, 0x4d, 0x99, 0xbd, 0xc9, 0xe9, 0xac, 0x07, 0x8d,
+        0x22, 0x8e, 0x64, 0x60, 0x68, 0xa8, 0xdb, 0xc2, 0xe1, 0x8b, 0x75, 0x2f,
+        0xd1, 0x69, 0xa8, 0xab, 0x27, 0xc0, 0x3c, 0xc1, 0xf4, 0xe3, 0xb2, 0xb3,
+        0x17, 0x12, 0x07, 0x27, 0x1c, 0x84, 0x82, 0x8a, 0xbc, 0x5a, 0xb6, 0x82,
+        0x89, 0xfc, 0x0d, 0xd1, 0xbf, 0x67, 0x28, 0xb3, 0xc5, 0xda, 0x77, 0xd6,
+        0x1d, 0x73, 0x4b, 0x0a, 0x5a, 0xe1, 0x76, 0xbe, 0xae, 0xc0, 0x33, 0x55,
+        0xea, 0x06, 0x2f, 0x02, 0xcf, 0xb6, 0xce, 0x41, 0xd4, 0x42, 0xb4, 0xe8,
+        0x0a, 0xbb, 0x69, 0xd8, 0xcd, 0x74, 0x80, 0xba, 0x74, 0x4a, 0x8c, 0x86,
+        0xec, 0x07, 0x89, 0x0f, 0x7b, 0x68, 0xe0, 0x26, 0x67, 0x7a, 0x3c, 0xff,
+        0xe7, 0x8f, 0x8d, 0x4f, 0x92, 0xe1, 0x5e, 0x20, 0x16, 0x00, 0xa0, 0xb3,
+        0xf7, 0x18, 0x1d, 0xb5, 0x49, 0x70, 0xf7, 0xf9, 0x2e, 0x48, 0x9f, 0x8a,
+        0x53, 0x4f, 0x68, 0xc8, 0xac, 0xbc, 0xf9, 0xcd, 0x6a, 0xe5, 0xca, 0xf1,
+        0x22, 0x42, 0xaa, 0xb6, 0x8a, 0xdd, 0x7c, 0x2d, 0xac, 0x13, 0x04, 0x5e,
+        0xe8, 0x89, 0x66, 0xec, 0xda, 0x27, 0xe1, 0x1c, 0x07, 0xf5, 0x28, 0x84,
+        0xdd, 0xa3, 0x0b, 0x82, 0xb8, 0x20, 0xdb, 0x20, 0xa1, 0xb1, 0x27, 0xb4,
+        0xa0, 0xaa, 0x8b, 0x03, 0xed, 0xaf, 0x66, 0xf6, 0x01, 0x84, 0x14, 0xef,
+        0x6e, 0x25, 0xe7, 0xe4, 0x0a, 0xea, 0x44, 0x08, 0xb4, 0xe6, 0x0d, 0x36,
+        0x26, 0xd4, 0x15, 0x02, 0x1d, 0x78, 0xc1, 0xdd, 0x2c, 0xff, 0x36, 0x08,
+        0x03, 0x57, 0x9d, 0x46, 0xdd, 0x7a, 0x51, 0xd0, 0x8c, 0x50, 0xde, 0x13,
+        0xd6, 0xd6, 0xc4, 0x01, 0x7c, 0x48, 0xe0, 0x95, 0xc7, 0x18, 0xfd, 0x71,
+        0x23, 0x4a, 0x0c, 0x63, 0xb5, 0xd6, 0xc3, 0x18, 0x0e, 0xb7, 0xb6, 0x83,
+        0x10, 0xf0, 0x33, 0x33, 0x5e, 0x81, 0xe1, 0x75, 0x9c, 0x96, 0xc3, 0x22,
+        0xd8, 0x9b, 0xd3, 0x7b, 0xb7, 0x51, 0x5b, 0x3f, 0xa6, 0x79, 0x02, 0x3e,
+        0xfb, 0x64, 0x9c, 0x28, 0x12, 0x9c, 0x93, 0xb9, 0x32, 0x85, 0x1f, 0xc4,
+        0xfa, 0xe6, 0xd7, 0x2f, 0xbd, 0x7a, 0xe2, 0xa6, 0x1f, 0x18, 0xb4, 0x0e,
+        0x55, 0x45, 0xc6, 0x9c, 0xf1, 0x99, 0x3f, 0x47, 0x70, 0x17, 0x7c, 0x2c,
+        0x3c, 0xb9, 0x07, 0x44, 0x33, 0xc9, 0xdf, 0xfb, 0xdb, 0xa1, 0x32, 0x90,
+        0x5f, 0xc4, 0xfa, 0x30, 0x4a, 0xb5, 0x39, 0x58, 0xcf, 0x54, 0x84, 0x97,
+        0x35, 0xdd, 0xe0, 0xfa, 0x6a, 0x8d, 0xa6, 0x8f, 0x31, 0x4b, 0x00, 0xdd,
+        0xef, 0xd4, 0x39, 0x2d, 0x80, 0x74, 0x99, 0x21, 0x6e, 0x90, 0x04, 0x0c,
+        0xe5, 0xf8, 0x47, 0x2f, 0x7e, 0x31, 0xc2, 0xc6, 0xe3, 0xd2, 0xed, 0x39,
+        0x8b, 0x4f, 0xba, 0x1c, 0xd0, 0xb9, 0x70, 0x82, 0xdf, 0xee, 0xfe, 0xe2,
+        0x60, 0x28, 0xe4, 0xbe, 0x6a, 0xdd, 0x7c, 0xee, 0x34, 0x01, 0x69, 0xd2,
+        0x4b, 0x80, 0xc3, 0xbb, 0x8f, 0xe9, 0xdb, 0xa5, 0x68, 0x40, 0x45, 0xd6,
+        0x80, 0xde, 0xbc, 0xcf, 0xd9, 0x85, 0xf4, 0x9c, 0x3f, 0x44, 0x47, 0x05,
+        0xde, 0x34, 0xb4, 0x4f, 0xf7, 0x42, 0xf4, 0x5b, 0x5a, 0xcd, 0xbf, 0xcd,
+        0xb5, 0x3c, 0x98, 0x6d, 0xba, 0x45, 0x91, 0x0d, 0x8d, 0x88, 0x8b, 0xe3,
+        0x71, 0xb0, 0xa7, 0x0a, 0xad, 0x2a, 0x51, 0xa1, 0x9d, 0x95, 0x56, 0x81,
+        0xdb, 0xbf, 0x0c, 0x22, 0x1e, 0x5a, 0x7c, 0x93, 0xf3, 0x75, 0x30, 0xc9,
+        0x8e, 0x9b, 0xe5, 0x4f, 0x35, 0xbf, 0x9a, 0x81, 0x38, 0x04, 0xfa, 0x06,
+        0x52, 0xe0, 0xcb, 0x69, 0x88, 0x08, 0x83, 0x5e, 0x52, 0x85, 0xad, 0x13,
+        0xec, 0x30, 0x61, 0x9e, 0xb5, 0x78, 0xa3, 0xdc, 0x79, 0x11, 0x57, 0x70,
+        0x71, 0x67, 0xdc, 0x3e, 0x58, 0x82, 0x88, 0x0e, 0xf7, 0x52, 0x64, 0x34,
+        0x83, 0x6e, 0xba, 0xcb, 0x5c, 0x38, 0xd0, 0x15, 0xae, 0xeb, 0xd3, 0xfa,
+        0x91, 0x8e, 0xe8, 0x3e, 0xdc, 0x21, 0xb2, 0xc2, 0x39, 0x1d, 0xe5, 0x93,
+        0xd5, 0x11, 0x49, 0x4e, 0x00, 0xbc, 0x27, 0xe7, 0x05, 0xcd, 0x09, 0x7a,
+        0xe0, 0xbb, 0x88, 0x14, 0x85, 0x76, 0x95, 0xb0, 0x5e, 0x2e, 0x41, 0x41,
+        0x12, 0x0c, 0x24, 0x5c, 0xe9, 0x3e, 0xc6, 0xbd, 0x4d, 0xca, 0x0a, 0xd4,
+        0x19, 0x58, 0xcd, 0x1f, 0x92, 0xe0, 0x6a, 0x4d, 0xfe, 0x11, 0xaa, 0xbf,
+        0xd2, 0x68, 0xb7, 0x7b, 0x8b, 0xcf, 0xc9, 0xd7, 0xc8, 0xc8, 0xf3, 0x45,
+        0x02, 0x55, 0x2d, 0xad, 0x9e, 0xbb, 0x72, 0x3b, 0x89, 0x37, 0x74, 0xc3,
+        0x3b, 0x5e, 0x85, 0xef, 0xa0, 0x4c, 0xe6, 0x25, 0x98, 0x62, 0x9a, 0x87,
+        0x25, 0x90, 0xe2, 0xad, 0xc0, 0x03, 0x55, 0xe0, 0x32, 0xf8, 0xa6, 0xee,
+        0xcd, 0x82, 0x77, 0xbb, 0xdb, 0x16, 0x74, 0x25, 0xcc, 0x1d, 0x30, 0x7f,
+        0xfa, 0x4e, 0xd5, 0xf7, 0x5e, 0x65, 0x18, 0x50, 0x4d, 0xfd, 0x32, 0x7e,
+        0x4c, 0xb2, 0xe6, 0x5e, 0x7a, 0xd5, 0x57, 0xd2, 0x09, 0x4f, 0xd2, 0x14,
+        0x94, 0x34, 0x19, 0x0e, 0x7c, 0x3f, 0xa6, 0x3a, 0xe4, 0x72, 0x99, 0xf4,
+        0x36, 0x8c, 0x84, 0xb2, 0x1a, 0x0f, 0xf1, 0x14, 0x86, 0xfb, 0xbc, 0x2b,
+        0x62, 0x62, 0xa4, 0x23, 0x9a, 0x5e, 0x6b, 0xce, 0xdc, 0xd5, 0xc6, 0x12,
+        0xe9, 0xbc, 0x4f, 0xda, 0xa9, 0x67, 0x77, 0x2e, 0x97, 0xb8, 0x7b, 0xf0,
+        0xf2, 0x48, 0x94, 0xa9, 0xcf, 0x95, 0x23, 0x7d, 0x48, 0xfa, 0xd6, 0xe1,
+        0x4a, 0x42, 0xa5, 0x8a, 0x75, 0x3a, 0x0d, 0x58, 0xd0, 0xa3, 0x0a, 0x4f,
+        0x24, 0x4a, 0x67, 0x3b, 0x6e, 0xcc, 0x48, 0xb2, 0x8e, 0x6b, 0xcd, 0xeb,
+        0xa9, 0xd3, 0xfb, 0x69, 0x2f, 0x8a, 0xb7, 0xa3, 0xe6, 0xb3, 0x74, 0x0f,
+        0xca, 0xb4, 0xa9, 0xa3, 0x41, 0xff, 0x20, 0x1c, 0x5f, 0xf9, 0xfd, 0xe0,
+        0x82, 0xd2, 0xea, 0x25, 0xb4, 0x57, 0xbe, 0xee, 0x63, 0xbe, 0xe5, 0x58,
+        0x42, 0x29, 0x1a, 0x58, 0xa6, 0x02, 0x20, 0x73, 0x64, 0x00, 0x8c, 0x62,
+        0x07, 0x8b, 0x9d, 0xf0, 0x1e, 0xa3, 0x8e, 0x91, 0x3a, 0xa6, 0x8a, 0xbe,
+        0xc8, 0xe0, 0x29, 0x53, 0xea, 0x87, 0x6a, 0x9c, 0x2a, 0xa3, 0xa1, 0xea,
+        0x11, 0xb0, 0xc1, 0xd6, 0xbf, 0x61, 0xf6, 0x40, 0xd1, 0x57, 0x55, 0x55,
+        0x3c, 0xc4, 0x44, 0x48, 0x9e, 0x86, 0xc1, 0xe9, 0x48, 0xa3, 0x04, 0xbd,
+        0xbb, 0x71, 0x9b, 0xaa, 0x92, 0x98, 0xf5, 0x10, 0x51, 0xc3, 0x7f, 0xce,
+        0xb9, 0x5d, 0x10, 0xcd, 0x99, 0x9d, 0xb9, 0x47, 0x60, 0x52, 0x24, 0x00,
+        0x56, 0x6b, 0x13, 0x27, 0x3c, 0x3e, 0xcf, 0x65, 0xa3, 0x29, 0x1e, 0x30,
+        0x7d, 0x11, 0xd6, 0x92, 0xe4, 0x27, 0x42, 0xb9, 0xa5, 0x4a, 0xe3, 0xc9,
+        0x7e, 0x95, 0xa3, 0x64, 0x97, 0x90, 0x98, 0x5c, 0x84, 0x79, 0x54, 0xe3,
+        0x5e, 0x89, 0xa3, 0x1f, 0x0c, 0xc9, 0x7c, 0xa0, 0x2e, 0xd6, 0x2d, 0x2b,
+        0x60, 0xec, 0x07, 0x8b, 0xa1, 0x0d, 0x74, 0x24, 0x4a, 0xc6, 0x56, 0xfd,
+        0x8a, 0xf6, 0x57, 0x7b, 0xcb, 0x91, 0x3a, 0x3d, 0x1a, 0x6a, 0xf5, 0xa5,
+        0x73, 0xef, 0x64, 0x1f, 0x55, 0x1f, 0x67, 0xea, 0xb5, 0x56, 0x12, 0x33,
+        0x05, 0x13, 0xb4, 0x29, 0xb7, 0xa5, 0x24, 0x79, 0xf9, 0xd4, 0x12, 0x50,
+        0xfd, 0xeb, 0x6a, 0xb1, 0x8e, 0xc6, 0x99, 0x85, 0xe7, 0x0f, 0x59, 0x0b,
+        0xa6, 0xee, 0xb6, 0x03, 0x35, 0xb8, 0x5d, 0x86, 0x7f, 0x33, 0xa7, 0x05,
+        0x14, 0xdc, 0xd0, 0xf8, 0x57, 0x28, 0x9b, 0x2d, 0x40, 0x63, 0x0f, 0x5e,
+        0xd9, 0x46, 0xc2, 0xc9, 0x28, 0x64, 0x29, 0xa9, 0x09, 0x93, 0x88, 0xfd,
+        0xa4, 0xeb, 0xc9, 0x38, 0x1d, 0x21, 0x24, 0x9c, 0xaf, 0x90, 0xc1, 0x28,
+        0xe7, 0x54, 0xe7, 0x77, 0xfa, 0x25, 0x2d, 0x4e, 0x4e, 0xab, 0x95, 0x5c,
+        0x7f, 0x78, 0xd2, 0xc0, 0xb5, 0x99, 0xb4, 0xd2, 0x6d, 0x94, 0x8c, 0x97,
+        0xb3, 0xab, 0x83, 0x24, 0x92, 0x7c, 0xf8, 0x11, 0x4c, 0xa7, 0xdd, 0x00,
+        0x91, 0xf2, 0x2f, 0x6c, 0xe0, 0xf6, 0x6b, 0x1e, 0xf3, 0x28, 0xfe, 0x18,
+        0x94, 0x9a, 0xde, 0x68, 0xc0, 0x6a, 0x39, 0x1a, 0x19, 0x31, 0xc9, 0x67,
+        0x49, 0x4a, 0x52, 0xa7, 0x84, 0x25, 0x53, 0xb2, 0x09, 0x4a, 0x2a, 0x2d,
+        0x9d, 0x61, 0x32, 0x09, 0xc6, 0x10, 0x68, 0x87, 0x88, 0xfb, 0x52, 0xf6,
+        0xd8, 0x0a, 0x8e, 0x02, 0x03, 0x09, 0xfc, 0x0e, 0xc9, 0x1d, 0xeb, 0x8b,
+        0xe7, 0x65, 0x9a, 0x29, 0x5d, 0x1f, 0xb9, 0x9d, 0x02, 0x0b, 0x81, 0x75,
+        0xb4, 0x5f, 0x28, 0x9d, 0x47, 0x45, 0xe9, 0x95, 0x30, 0x2c, 0xe9, 0x86,
+        0x50, 0x2c, 0x25, 0xe4, 0x11, 0xcb, 0x2e, 0x93, 0xfa, 0xf2, 0x45, 0x17,
+        0x61, 0xbd, 0x97, 0x89, 0x69, 0xd3, 0xde, 0x22, 0xc1, 0x65, 0xa1, 0xa8,
+        0xc9, 0xcc, 0x8c, 0xfc, 0x41, 0x27, 0x00, 0xd3, 0xb5, 0x06, 0x45, 0x9d,
+        0x60, 0x30, 0x72, 0x37, 0xbd, 0xc9, 0x6c, 0x73, 0x11, 0x91, 0x89, 0x83,
+        0xc9, 0x77, 0x9c, 0x17, 0x0c, 0x2a, 0x40, 0x24, 0xc8, 0xe1, 0xa7, 0x14,
+        0x39, 0x74, 0xc9, 0x49, 0x43, 0x23, 0x53, 0x16, 0xd6, 0x57, 0xf7, 0xcd,
+        0xb9, 0xe8, 0x44, 0x83, 0x52, 0x0b, 0xe5, 0xad, 0x63, 0xe4, 0xd7, 0x7a,
+        0xd6, 0x35, 0xb8, 0x53, 0x21, 0xe1, 0xc7, 0x09, 0x9b, 0xa2, 0x70, 0x99,
+        0x38, 0x38, 0x57, 0x40, 0x77, 0xd6, 0x8e, 0x32, 0xf5, 0xbf, 0x4f, 0x7f,
+        0x99, 0x50, 0x75, 0xe9, 0x62, 0x0b, 0x21, 0x8b, 0x82, 0x4f, 0xe0, 0xea,
+        0x63, 0x67, 0x54, 0xad, 0xee, 0x76, 0x93, 0xcb, 0x96, 0x17
+    },
+    .commitments = {
+        { 0x94, 0x92, 0xc9, 0x01, 0x95, 0x73, 0x31, 0xd5, 0xe7, 0x94, 0xe5, 0x9a, 0xd4, 0x73, 0x67, 0x51, 0x68, 0x0f, 0x2f, 0xde, 0xca, 0x12, 0x3f, 0xf3, 0xcb, 0xe0, 0xc6, 0x3a, 0x2d, 0xc8, 0x61, 0x36 },
+        { 0x5c, 0xd8, 0x54, 0x1a, 0x4c, 0x92, 0x0e, 0x4d, 0x7e, 0xac, 0x65, 0x71, 0xa6, 0xe9, 0x3b, 0x40, 0xcb, 0xda, 0x99, 0xf3, 0x48, 0xf1, 0x70, 0x40, 0x0f, 0x91, 0x81, 0xb8, 0x1e, 0xb2, 0xcf, 0x17 },
+        { 0x65, 0x90, 0x97, 0x4e, 0xcb, 0x6e, 0x62, 0xb4, 0x8d, 0x21, 0x9f, 0xcf, 0xf7, 0x5d, 0x6d, 0xf8, 0x55, 0x8e, 0xb6, 0xb5, 0xd4, 0x3e, 0x17, 0x3c, 0x88, 0x45, 0xb0, 0x59, 0x31, 0x5c, 0x56, 0x10 },
+        { 0x0c, 0xe2, 0xec, 0x64, 0xa3, 0xd3, 0x5a, 0xca, 0x95, 0x4f, 0x9f, 0x77, 0xfc, 0xb6, 0x96, 0xb2, 0x13, 0xb1, 0x09, 0xc9, 0xef, 0x55, 0x14, 0xf2, 0x84, 0x1a, 0xd0, 0xd9, 0x6f, 0x49, 0x17, 0x38 },
+        { 0x2c, 0x02, 0x15, 0x93, 0x8c, 0x51, 0x65, 0xff, 0xd4, 0x67, 0x0d, 0xd5, 0xec, 0xff, 0xae, 0xb2, 0x4c, 0x4c, 0x35, 0xde, 0x59, 0x4e, 0xad, 0xc8, 0xf4, 0xd4, 0xd6, 0x0e, 0xac, 0xb9, 0xc0, 0x31 },
+    },
+    .anchor = {
+        0xa3, 0x6e, 0xe6, 0xa9, 0x71, 0x99, 0xaa, 0x81, 0x4a, 0xb9, 0xba, 0x8c,
+        0xf7, 0x2e, 0xc9, 0x88, 0x44, 0x2a, 0xc6, 0x67, 0x31, 0xcc, 0x1d, 0xb7,
+        0x0d, 0xeb, 0x55, 0x19, 0x9d, 0x75, 0x4f, 0x13
+    }
+},
+{
+    .bundle = {
+        0x05, 0x96, 0x83, 0x24, 0xc6, 0x55, 0xee, 0xe4, 0x3e, 0x6d, 0x83, 0xd7,
+        0xc2, 0x86, 0xfe, 0x8f, 0x9c, 0x92, 0x3c, 0x28, 0xa2, 0x1c, 0x0a, 0x76,
+        0x28, 0x7f, 0x41, 0x54, 0x29, 0x4b, 0x7d, 0xfa, 0x32, 0xa8, 0x25, 0xdb,
+        0x6b, 0x2c, 0x5a, 0x62, 0xfb, 0x6f, 0xcb, 0x58, 0xc2, 0xc0, 0xdf, 0xa2,
+        0xcf, 0xda, 0x73, 0x7e, 0x54, 0x7d, 0xf5, 0xf6, 0x58, 0xbe, 0x8a, 0xf5,
+        0x92, 0x5b, 0x90, 0xf5, 0x2b, 0x6f, 0x86, 0xd0, 0x2b, 0xf8, 0x4a, 0x34,
+        0x3d, 0x1e, 0x09, 0xbc, 0x76, 0x1e, 0x90, 0x20, 0x7c, 0xe2, 0x1d, 0xca,
+        0xd4, 0xac, 0x2a, 0x8d, 0x4e, 0xfd, 0x16, 0xcc, 0x48, 0x7c, 0x13, 0x19,
+        0x07, 0xe6, 0x58, 0x63, 0x2a, 0x79, 0x0b, 0x84, 0xc2, 0x78, 0x7f, 0x87,
+        0x33, 0x28, 0x3f, 0xe6, 0xd2, 0x32, 0x60, 0x0d, 0x73, 0xba, 0x89, 0x79,
+        0x5b, 0xad, 0x40, 0x0c, 0x4b, 0x9b, 0x77, 0xa0, 0x29, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x9e, 0x1d, 0xdf, 0x71, 0x05, 0x63, 0xee,
+        0x37, 0x4b, 0x5d, 0xd1, 0xa0, 0x1e, 0x90, 0x4d, 0xe8, 0x60, 0xe4, 0x30,
+        0x3b, 0xbb, 0xcd, 0x76, 0xfd, 0xd6, 0xb5, 0x98, 0x2f, 0x4b, 0x20, 0x10,
+        0x88, 0x5c, 0x6a, 0x7e, 0x98, 0x13, 0x54, 0xdc, 0x11, 0xf7, 0x61, 0xc1,
+        0xc7, 0x66, 0x61, 0x4a, 0x4c, 0x2e, 0xdc, 0xc6, 0x1c, 0xfa, 0x7a, 0xb4,
+        0x95, 0xfc, 0x4f, 0x5b, 0x7f, 0x91, 0x53, 0x6d, 0x14, 0xe0, 0x94, 0x7e,
+        0xbc, 0xfc, 0x25, 0x1d, 0x4a, 0x34, 0xa0, 0x06, 0xf9, 0x6b, 0xf6, 0x6d,
+        0x38, 0xc5, 0xc5, 0xa0, 0x61, 0x53, 0x4a, 0x7a, 0x45, 0x02, 0xcf, 0x72,
+        0x90, 0xe8, 0xaf, 0xaf, 0xbc, 0x4e, 0x15, 0x6a, 0x3b, 0x37, 0x24, 0x5d,
+        0xe5, 0xd9, 0x77, 0x64, 0xe1, 0x7d, 0x8c, 0x46, 0x46, 0x70, 0x38, 0xd8,
+        0xc7, 0xae, 0x5c, 0xee, 0x82, 0x25, 0xa1, 0xe2, 0xa2, 0xad, 0x7f, 0x4a,
+        0x25, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x09, 0xfe, 0x8e,
+        0x20, 0x50, 0xfc, 0x7c, 0x4a, 0x92, 0x4f, 0x21, 0xcf, 0xdd, 0x5a, 0x77,
+        0xdd, 0x27, 0xda, 0x1b, 0xae, 0xac, 0x4e, 0xaa, 0x24, 0x2b, 0xe4, 0xde,
+        0x29, 0x6d, 0x37, 0x03, 0x2f, 0x0e, 0xb0, 0xd5, 0x15, 0xe8, 0xc7, 0x07,
+        0x0a, 0xdd, 0x19, 0x0f, 0xfd, 0x33, 0x03, 0x33, 0xf1, 0x76, 0xaf, 0xc3,
+        0x96, 0xef, 0xdc, 0x62, 0x10, 0x66, 0x8f, 0x0d, 0x53, 0x56, 0x8a, 0x09,
+        0x2a, 0x88, 0x33, 0xfb, 0xaf, 0x58, 0xaa, 0x65, 0x7b, 0x85, 0x7a, 0x08,
+        0xea, 0x78, 0x11, 0x98, 0x1b, 0xff, 0x8e, 0xe8, 0x78, 0x6a, 0xe7, 0x61,
+        0xe9, 0x80, 0x33, 0x57, 0x37, 0xc8, 0xd4, 0xae, 0x2f, 0xdd, 0x8e, 0x1a,
+        0xf4, 0x86, 0xfd, 0x57, 0x39, 0x3c, 0x41, 0xbd, 0x93, 0x83, 0xc8, 0x76,
+        0x3d, 0x17, 0xfe, 0x14, 0xeb, 0xed, 0x7b, 0x0f, 0x2b, 0x08, 0x42, 0x96,
+        0x30, 0x1f, 0x72, 0xbd, 0x07, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0xf1, 0x39, 0x94, 0x63, 0x18, 0x28, 0x68, 0x91, 0xa4, 0x25, 0x6b,
+        0x51, 0x32, 0xd9, 0x57, 0x2b, 0x3c, 0x4a, 0x48, 0x58, 0x6e, 0xc2, 0x73,
+        0x6e, 0x0d, 0xd9, 0xa5, 0x17, 0x93, 0x59, 0x8e, 0x31, 0xdd, 0x69, 0x19,
+        0x52, 0x44, 0xc0, 0x8a, 0x1e, 0xd9, 0x85, 0xd3, 0xc2, 0x71, 0x16, 0x67,
+        0xb0, 0x02, 0x98, 0xd3, 0x4e, 0xb6, 0x0a, 0xbb, 0x83, 0xcc, 0xf2, 0xe7,
+        0x13, 0xf8, 0xf5, 0xc5, 0x06, 0x74, 0x54, 0x7d, 0xf8, 0x2d, 0x91, 0xa6,
+        0x1f, 0xdf, 0x06, 0x5f, 0x2b, 0x25, 0x76, 0x4e, 0xea, 0x4c, 0x22, 0x91,
+        0x79, 0x26, 0x4b, 0xbe, 0x25, 0x8a, 0x26, 0x08, 0x94, 0xc7, 0xf8, 0x56,
+        0x0d, 0x92, 0x78, 0xa1, 0xa9, 0x69, 0x31, 0x11, 0xfa, 0x4c, 0x47, 0x00,
+        0x70, 0xd6, 0x2c, 0xef, 0x52, 0x67, 0x61, 0x1f, 0xec, 0x8f, 0xeb, 0xad,
+        0x0e, 0x3c, 0x97, 0x73, 0xb7, 0xef, 0x8f, 0x02, 0x1d, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0xa6, 0x9a, 0xf0, 0x1e, 0xcf, 0x81, 0x8a,
+        0x63, 0x84, 0x87, 0x1a, 0x5d, 0x93, 0x1b, 0xd4, 0x25, 0xb3, 0x0f, 0xd2,
+        0xcc, 0xf6, 0x80, 0x9d, 0xe9, 0x6f, 0xe3, 0x64, 0x87, 0x16, 0xf3, 0x74,
+        0x1d, 0xb1, 0xb8, 0x5d, 0xc4, 0x76, 0xc8, 0xee, 0x4b, 0x7d, 0x7d, 0x1a,
+        0x49, 0x93, 0x10, 0xeb, 0xdc, 0xfb, 0xc8, 0xd5, 0xb2, 0xc0, 0xba, 0xe4,
+        0xf5, 0x90, 0xb1, 0x00, 0x1d, 0x9d, 0xa2, 0x0b, 0x1f, 0xb1, 0x25, 0x8c,
+        0x78, 0x12, 0x70, 0xd5, 0x0d, 0x39, 0x4f, 0x0a, 0xcf, 0x1f, 0x3d, 0xc3,
+        0x1b, 0x53, 0x9c, 0xfa, 0x02, 0xae, 0x06, 0x59, 0x2e, 0x8c, 0xb2, 0x42,
+        0x7f, 0x0e, 0x05, 0x39, 0x8d, 0x44, 0x37, 0x42, 0x53, 0xe5, 0x53, 0x0f,
+        0x77, 0x64, 0xfd, 0x67, 0x04, 0xe9, 0xb7, 0xb5, 0x06, 0x4a, 0x3d, 0x5b,
+        0xcb, 0x52, 0x5a, 0xff, 0x1d, 0xab, 0xde, 0x9f, 0x09, 0x1c, 0xa1, 0xb6,
+        0x13, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x03, 0x6d, 0xf1,
+        0xca, 0x56, 0xd1, 0x39, 0x05, 0x00, 0x61, 0xb3, 0x46, 0x1d, 0xbe, 0xc0,
+        0x2f, 0x88, 0x06, 0xe1, 0x04, 0x7e, 0xce, 0xbd, 0xd9, 0x3e, 0xdf, 0x47,
+        0xfd, 0xc3, 0x98, 0x2a, 0x0c, 0xe3, 0xfb, 0xde, 0xb6, 0x73, 0x72, 0xa3,
+        0xa7, 0x3e, 0xfd, 0xb5, 0x07, 0x05, 0xa9, 0xf4, 0x30, 0x7e, 0xba, 0x59,
+        0xb9, 0xad, 0x5f, 0xe6, 0xff, 0x33, 0x06, 0xc1, 0xce, 0x81, 0xd3, 0x9c,
+        0xcd, 0xb8, 0xfc, 0xcf, 0xd1, 0xdb, 0x78, 0x26, 0x37, 0x48, 0xb7, 0x1a,
+        0x7e, 0xbb, 0x7f, 0x57, 0xef, 0x12, 0x54, 0x43, 0x85, 0x6b, 0x0e, 0xc2,
+        0x40, 0xfe, 0xdc, 0x36, 0xfa, 0xee, 0x67, 0x52, 0x6e, 0x0c, 0x86, 0x57,
+        0x57, 0xe9, 0x46, 0xaa, 0xf7, 0x8d, 0x60, 0xbc, 0xcc, 0x5f, 0xba, 0xa9,
+        0x9c, 0xbc, 0x78, 0xeb, 0xed, 0x4b, 0x34, 0x5e, 0x91, 0xe7, 0xe1, 0xa8,
+        0xec, 0xf0, 0xa6, 0xa1, 0x79, 0xf4, 0x8f, 0xac, 0xba, 0x15, 0x34, 0xb7,
+        0x30, 0xd0, 0x98, 0x1b, 0x49, 0xca, 0xc6, 0x0d, 0xfd, 0x84, 0xe6, 0x6e,
+        0x10, 0x48, 0x43, 0x78, 0x55, 0x55, 0x62, 0x13, 0x3d, 0x35, 0x7d, 0xab,
+        0x44, 0xbb, 0x58, 0x42, 0xba, 0xfa, 0x09, 0xd5, 0x9d, 0xeb, 0x5b, 0xda,
+        0x40, 0x49, 0x0e, 0xe2, 0x2f, 0x05, 0x78, 0xd2, 0xfe, 0xc2, 0x6c, 0xbc,
+        0xf6, 0xd3, 0x7b, 0xb3, 0x05, 0x0a, 0xbd, 0x6c, 0xee, 0xc6, 0x3f, 0xe0,
+        0xb9, 0xf6, 0x92, 0x13, 0x99, 0x7d, 0xca, 0x0c, 0xf9, 0x57, 0xd2, 0x06,
+        0xc6, 0xf2, 0x04, 0x05, 0x4b, 0xc2, 0x31, 0xcb, 0x0e, 0x16, 0x69, 0x31,
+        0xe7, 0xa6, 0x06, 0xf5, 0x93, 0xdd, 0x31, 0x7e, 0x1c, 0x7d, 0x8f, 0xca,
+        0xf1, 0xf2, 0x06, 0x8f, 0xf6, 0xef, 0x69, 0x82, 0xcb, 0x0c, 0xeb, 0x92,
+        0x34, 0x65, 0x7a, 0xd1, 0xb5, 0xb2, 0xff, 0x90, 0x49, 0x4f, 0x08, 0x35,
+        0xcc, 0x38, 0xff, 0x84, 0x9c, 0x93, 0x66, 0xe2, 0x63, 0xd1, 0x26, 0x8d,
+        0xea, 0xef, 0xf5, 0x9f, 0x2d, 0xf5, 0xc5, 0xfa, 0x76, 0xb9, 0xa5, 0xeb,
+        0xfa, 0xc1, 0xc5, 0xd3, 0x36, 0x2b, 0x59, 0xdd, 0x6b, 0x05, 0x31, 0x14,
+        0xdd, 0x8a, 0xed, 0x4c, 0x1b, 0x33, 0x6d, 0x3f, 0x78, 0x3f, 0x1b, 0x53,
+        0xa5, 0x38, 0x18, 0x2b, 0x2c, 0x0e, 0xf0, 0xf4, 0x99, 0xff, 0xb3, 0x24,
+        0xc2, 0xbb, 0x92, 0xee, 0x7a, 0x3e, 0x1f, 0xdc, 0xfd, 0x58, 0x9c, 0xfd,
+        0xb7, 0xa7, 0x4b, 0xd3, 0x68, 0x27, 0x7b, 0x60, 0xd2, 0x31, 0xe8, 0x98,
+        0x47, 0x32, 0x1c, 0xde, 0x63, 0x91, 0xb7, 0x0a, 0x49, 0x28, 0xd1, 0x55,
+        0x86, 0xd2, 0x14, 0x99, 0x44, 0x61, 0xd6, 0x81, 0x58, 0xb0, 0x8e, 0x0d,
+        0x25, 0x10, 0xcc, 0xf7, 0xd1, 0x42, 0x53, 0x78, 0xf7, 0x1e, 0xac, 0x93,
+        0x56, 0xa0, 0xab, 0x3a, 0x37, 0x81, 0x1b, 0x07, 0x1e, 0xcf, 0xf2, 0xf9,
+        0x66, 0x9a, 0x35, 0xaa, 0xa3, 0x84, 0x8c, 0x68, 0x9e, 0x71, 0x46, 0x57,
+        0x35, 0xa4, 0x12, 0x78, 0x41, 0x32, 0x44, 0xab, 0xab, 0xee, 0x37, 0xb9,
+        0x0e, 0xe6, 0xe2, 0xd0, 0x5b, 0x2b, 0xd6, 0x28, 0x16, 0x7e, 0x8c, 0x28,
+        0x6b, 0x7b, 0x13, 0x48, 0x72, 0x64, 0xd5, 0x99, 0x84, 0xfe, 0x44, 0xfc,
+        0xa0, 0x28, 0x52, 0x9f, 0x0f, 0x7c, 0x27, 0xc0, 0x95, 0xe0, 0x7d, 0x34,
+        0x8b, 0x76, 0x26, 0x1a, 0x12, 0x95, 0xd0, 0x3d, 0x63, 0xad, 0x93, 0xc5,
+        0x63, 0x67, 0xa5, 0x9a, 0x08, 0x15, 0x71, 0xe5, 0xb2, 0xa2, 0xf8, 0x07,
+        0xe0, 0x11, 0xdd, 0xcf, 0x94, 0x5c, 0x2f, 0x16, 0x8e, 0x72, 0x40, 0x29,
+        0x8b, 0xb7, 0x71, 0xdb, 0x62, 0x96, 0x5f, 0x2a, 0x9a, 0x7d, 0x3d, 0x08,
+        0x59, 0xe6, 0xa4, 0xab, 0x46, 0x3f, 0x74, 0x29, 0x5a, 0x36, 0xba, 0x7d,
+        0xb4, 0xeb, 0x4a, 0xd6, 0x8a, 0x84, 0xb3, 0x18, 0x0e, 0x1e, 0x09, 0xfc,
+        0x0d, 0xd4, 0xed, 0xc0, 0x67, 0x42, 0x60, 0x3d, 0xf1, 0x84, 0x2c, 0xda,
+        0x51, 0x79, 0xb7, 0x43, 0x26, 0x2a, 0x8e, 0xd1, 0xd0, 0xa0, 0xd3, 0x9e,
+        0xee, 0x34, 0x76, 0x53, 0x08, 0xe2, 0x63, 0x95, 0x45, 0x18, 0xe4, 0x29,
+        0x0b, 0xd1, 0xb3, 0xf4, 0x56, 0x6a, 0xf4, 0x38, 0xcb, 0xda, 0xb9, 0x25,
+        0x93, 0xff, 0xdb, 0xc0, 0x54, 0xeb, 0xbd, 0x79, 0x41, 0x55, 0x1a, 0x04,
+        0x49, 0x51, 0x59, 0xd3, 0xb2, 0x22, 0x96, 0x6b, 0x1a, 0xfb, 0xb5, 0x8c,
+        0x67, 0x45, 0x1a, 0x37, 0x77, 0xbd, 0x11, 0x7c, 0x26, 0x4d, 0x16, 0x26,
+        0xd0, 0xa1, 0xad, 0x6c, 0xa5, 0x3a, 0x55, 0xc7, 0xd7, 0xeb, 0x0d, 0x7a,
+        0x8c, 0xfe, 0xf8, 0xaf, 0xbd, 0x3a, 0x19, 0xd0, 0x92, 0xea, 0x79, 0x46,
+        0x4f, 0x55, 0x86, 0xbe, 0x4b, 0xa7, 0x1f, 0xf5, 0x6d, 0x9a, 0x65, 0x94,
+        0x48, 0xad, 0x4f, 0x49, 0x2e, 0x38, 0x75, 0x51, 0x1f, 0xe6, 0x9b, 0xbb,
+        0xd9, 0x95, 0x0c, 0xd8, 0x8b, 0xfc, 0x61, 0xe5, 0x7b, 0xc4, 0x3b, 0x93,
+        0xb3, 0xbc, 0x84, 0x2b, 0x74, 0xda, 0x08, 0xdd, 0x74, 0x96, 0x4b, 0xa8,
+        0x88, 0x21, 0xf8, 0xa7, 0xac, 0x15, 0xb8, 0xbc, 0x59, 0x68, 0xb1, 0x3a,
+        0x4a, 0xb6, 0x39, 0x9f, 0x1e, 0x43, 0x4e, 0xc2, 0xab, 0xe4, 0xdb, 0xb4,
+        0x02, 0x39, 0x54, 0xf3, 0xb8, 0xcb, 0x81, 0x6e, 0xb0, 0x71, 0xfd, 0xb8,
+        0x16, 0x10, 0x49, 0xaf, 0x24, 0xff, 0x9a, 0x45, 0xc8, 0xb9, 0xfd, 0x02,
+        0xb8, 0xce, 0x1e, 0xe5, 0xdb, 0x25, 0xd9, 0x1e, 0x57, 0xf9, 0x80, 0x23,
+        0x09, 0x22, 0x5c, 0xc5, 0x4a, 0x0a, 0x77, 0xbe, 0x5e, 0x35, 0x80, 0xa4,
+        0x1c, 0x82, 0x68, 0xfc, 0xc0, 0xad, 0x0e, 0xec, 0x1f, 0x12, 0x53, 0x7a,
+        0x0f, 0x9d, 0x31, 0x18, 0xbd, 0x3e, 0xd2, 0x1a, 0x11, 0x1d, 0x28, 0x0a,
+        0x86, 0xa1, 0xad, 0xcf, 0x64, 0x00, 0xf8, 0x06, 0xb3, 0x3f, 0xb4, 0x35,
+        0x58, 0x6c, 0x47, 0x93, 0xce, 0xf4, 0x73, 0xe5, 0x11, 0xfb, 0x23, 0xa6,
+        0xb3, 0x04, 0xf2, 0x8d, 0x77, 0xc2, 0x7a, 0x7d, 0xe6, 0x7c, 0x1a, 0xcb,
+        0xf0, 0x70, 0xfb, 0x23, 0x5d, 0x79, 0xae, 0xf3, 0x39, 0x72, 0x93, 0x87,
+        0x03, 0xab, 0x72, 0x3f, 0x49, 0x48, 0xab, 0x64, 0x10, 0xa1, 0xf9, 0xa8,
+        0x82, 0xf7, 0x9d, 0x0c, 0xdf, 0x43, 0x6a, 0x12, 0x76, 0x99, 0xd0, 0x29,
+        0xc6, 0xe1, 0xe8, 0x09, 0xeb, 0x33, 0xc2, 0x30, 0x73, 0x97, 0xd5, 0xb6,
+        0x51, 0x59, 0xb1, 0x88, 0x3b, 0xab, 0xe8, 0x78, 0x96, 0x7f, 0x14, 0xdc,
+        0x05, 0x43, 0x09, 0x74, 0x66, 0x73, 0xd5, 0xec, 0x96, 0x59, 0x1f, 0x69,
+        0xc5, 0x7b, 0xfa, 0x10, 0x5b, 0x2e, 0xd8, 0x6b, 0x63, 0xb2, 0x49, 0xb9,
+        0x80, 0x9e, 0xa0, 0x4c, 0xe8, 0xb1, 0x58, 0xa3, 0x69, 0x39, 0x74, 0x9a,
+        0x59, 0x8d, 0xf4, 0xf9, 0x8d, 0x6e, 0x15, 0x2f, 0xea, 0xe1, 0x86, 0x3e,
+        0x84, 0x1a, 0xd5, 0x28, 0x8c, 0x75, 0xd8, 0xdc, 0x59, 0x4e, 0x6c, 0xb1,
+        0x77, 0xd3, 0x0d, 0x08, 0x8d, 0x41, 0x92, 0xc1, 0xc8, 0x5b, 0x49, 0xa0,
+        0x82, 0x4b, 0x0b, 0x8e, 0x89, 0x3d, 0xd5, 0x2d, 0xda, 0xc0, 0x2d, 0xb0,
+        0x06, 0x6f, 0xd7, 0x2d, 0x0b, 0xa9, 0x2a, 0x8f, 0x3c, 0x1b, 0xbb, 0x9f,
+        0x7b, 0x5c, 0xe9, 0x7b, 0x83, 0x7d, 0xd4, 0x85, 0xfb, 0xe8, 0xae, 0x60,
+        0x27, 0xff, 0xc4, 0x05, 0xb6, 0x2b, 0xb6, 0x94, 0xcb, 0x75, 0xab, 0x3b,
+        0x14, 0x9b, 0x42, 0xa9, 0x99, 0xe5, 0xfd, 0x82, 0x8c, 0x7b, 0xa5, 0x08,
+        0x80, 0x9a, 0xb9, 0x1b, 0x15, 0x04, 0x64, 0xfe, 0x5c, 0xa1, 0x43, 0x8c,
+        0x28, 0xcc, 0x6b, 0x3e, 0x45, 0xe1, 0xf5, 0x48, 0x2b, 0x63, 0xb4, 0x90,
+        0x88, 0xa0, 0xb5, 0x2d, 0xe6, 0x8f, 0xd9, 0x61, 0x62, 0xa8, 0x1f, 0xc0,
+        0x58, 0x0f, 0x58, 0x88, 0x41, 0xd1, 0xa9, 0x99, 0x7a, 0x14, 0x7d, 0x2d,
+        0x4b, 0xda, 0x65, 0xf2, 0x0d, 0xb0, 0x62, 0xa6, 0x11, 0xa1, 0xeb, 0xcc,
+        0x50, 0x00, 0xa2, 0xbd, 0x56, 0xe6, 0x7c, 0x87, 0xf7, 0xb9, 0x52, 0x2d,
+        0x60, 0x4a, 0x6b, 0x87, 0xf8, 0xcb, 0x4a, 0xc6, 0xf1, 0x71, 0x91, 0xd0,
+        0x76, 0xbd, 0x3b, 0x93, 0x78, 0xa0, 0xad, 0x1f, 0xa8, 0xd7, 0x3f, 0x6d,
+        0x27, 0x22, 0xa4, 0xcf, 0xc1, 0xb9, 0x54, 0x3a, 0xbc, 0xd5, 0x98, 0x2a,
+        0xe4, 0x60, 0xc3, 0x19, 0x7a, 0xe8, 0x6a, 0x9e, 0xb1, 0x1c, 0x68, 0x8c,
+        0x5a, 0x79, 0x6d, 0xa6, 0xfb, 0xb3, 0x86, 0xfe, 0x60, 0x51, 0xa1, 0xd0,
+        0x47, 0x9f, 0xe2, 0x9b, 0x75, 0xcf, 0x72, 0xdf, 0xf4, 0x91, 0xa1, 0xde,
+        0x20, 0x60, 0x8a, 0x05, 0x88, 0xdf, 0xa7, 0x3f, 0x7f, 0x9d, 0xd9, 0x48,
+        0x0b, 0x9b, 0x4a, 0xf6, 0xbb, 0x4e, 0x88, 0x60, 0x90, 0xa4, 0xd2, 0x69,
+        0xc6, 0x2f, 0x43, 0xb7, 0xd4, 0x52, 0x50, 0x2d, 0x67, 0xf3, 0x16, 0xfb,
+        0xc6, 0x68, 0x86, 0x71, 0x51, 0xcb, 0xeb, 0xa3, 0x61, 0x5a, 0x62, 0xdf,
+        0xb0, 0xbd, 0x8d, 0x0e, 0x82, 0x3a, 0x30, 0xc2, 0x91, 0x74, 0xb4, 0x80,
+        0xa8, 0x2d, 0xd4, 0x55, 0x9f, 0x3f, 0x61, 0xd2, 0x3e, 0x03, 0x34, 0x94,
+        0x4f, 0x40, 0xca, 0xd6, 0x0f, 0xb6, 0xa9, 0x3a, 0xa5, 0xdb, 0xfa, 0x84,
+        0x87, 0x1c, 0x80, 0xa1, 0x6a, 0x45, 0x34, 0x9f, 0x22, 0xa2, 0xa9, 0x7d,
+        0xa9, 0x3d, 0xec, 0x20, 0xe2, 0xc7, 0xef, 0xf2, 0x7c, 0xf3, 0x68, 0x4f,
+        0x1c, 0x20, 0xed, 0xc5, 0x00, 0x72, 0x80, 0x09, 0xa7, 0x69, 0xf9, 0x58,
+        0xf2, 0x45, 0xb7, 0x6a, 0xbf, 0xbe, 0xd4, 0xc4, 0xfd, 0x92, 0xac, 0xc4,
+        0x34, 0x6d, 0xa0, 0x12, 0xe5, 0x0b, 0xcc, 0x5a, 0xc9, 0x2a, 0xfd, 0x34,
+        0x29, 0xb2, 0x8f, 0x77, 0xaa, 0x0f, 0x65, 0xbc, 0xd0, 0x08, 0x48, 0x73,
+        0xa0, 0xac, 0x22, 0x87, 0xed, 0x50, 0xbc, 0x92, 0xfc, 0xe3, 0x83, 0xba,
+        0x38, 0x3d, 0x92, 0xbb, 0x3b, 0x12, 0x2f, 0xa6, 0x62, 0x49, 0x64, 0x0f,
+        0x80, 0xc7, 0x22, 0x70, 0x44, 0x19, 0x54, 0x0a, 0xb2, 0x1a, 0x4a, 0x90,
+        0x8c, 0x6b, 0x03, 0x5e, 0xb0, 0xb8, 0x71, 0x38, 0xf1, 0x1a, 0xd4, 0x5f,
+        0xb2, 0x38, 0x93, 0x30, 0x07, 0x89, 0x39, 0xa6, 0x74, 0x8d, 0x7c, 0x2e,
+        0x47, 0x8a, 0x99, 0xa7, 0x51, 0x23, 0xb2, 0x58, 0x67, 0x38, 0x0d, 0x16,
+        0xce, 0x74, 0x5a, 0x9b, 0x80, 0xff, 0x73, 0xf5, 0x95, 0x35, 0x0f, 0x61,
+        0xf6, 0xdb, 0xfa, 0xcc, 0x85, 0x98, 0x91, 0x31, 0x76, 0x94, 0xf1, 0x5b,
+        0x4a, 0x42, 0xaa, 0xa5, 0xfc, 0xdc, 0x75, 0x75, 0x22, 0xf3, 0x2e, 0x72,
+        0x7c, 0x0e, 0xc0, 0xb8, 0xf9, 0xe4, 0x19, 0xe0, 0x79, 0xbd, 0x89, 0x1a,
+        0xb7, 0xb7, 0x8c, 0x7c, 0x29, 0x33, 0xb4, 0x3d, 0x49, 0x68, 0xf3, 0x7a,
+        0x63, 0x3b, 0x42, 0x7f, 0x77, 0x0a, 0x15, 0xe1, 0x53, 0x5d, 0x11, 0x40,
+        0xd7, 0x3a, 0xeb, 0x0a, 0x58, 0xdc, 0xa3, 0x3f, 0x05, 0xda, 0x45, 0xee,
+        0x51, 0x16, 0x63, 0x85, 0x52, 0x3a, 0x8e, 0x73, 0x34, 0x8d, 0xde, 0x5f,
+        0xcc, 0xd4, 0x49, 0xfa, 0xc7, 0xe0, 0xbf, 0x39, 0x3a, 0x84, 0xd5, 0xa0,
+        0xdf, 0xbe, 0x87, 0xfd, 0xf7, 0x70, 0x5c, 0x17, 0x6d, 0x90, 0x43, 0xc7,
+        0xc5, 0xbc, 0x04, 0xd1, 0xa1, 0x80, 0xad, 0x77, 0x26, 0xe4, 0x35, 0x44,
+        0x53, 0x8f, 0x9f, 0x24, 0x68, 0xaa, 0xf7, 0xee, 0x16, 0xad, 0x4f, 0x7b,
+        0x13, 0x49, 0x7b, 0x46, 0x70, 0xaf, 0x89, 0x3f, 0xe8, 0xc0, 0xcc, 0x6b,
+        0x53, 0x3e, 0x27, 0xf2, 0x3f, 0x27, 0x05, 0x6e, 0x1a, 0x7d, 0x15, 0xd2,
+        0x0b, 0x93, 0xae, 0x9b, 0x0e, 0x15, 0x6e, 0x06, 0xd5, 0x97, 0x91, 0x50,
+        0x9b, 0x01, 0xd4, 0xd4, 0xa2, 0x58, 0x87, 0xc8, 0x7a, 0x87, 0x9a, 0xff,
+        0x3f, 0x75, 0x0d, 0xb7, 0xc9, 0xd3, 0xd4, 0xfe, 0x81, 0xd8, 0x7a, 0x35,
+        0xb4, 0x0c, 0xc0, 0x8c, 0x56, 0xa8, 0x2a, 0xbe, 0x46, 0x98, 0x1a, 0xfa,
+        0xde, 0xcd, 0x01, 0xb9, 0x2c, 0x35, 0x92, 0x41, 0xf7, 0xe5, 0xca, 0x20,
+        0x3f, 0xbc, 0xf3, 0x7f, 0xad, 0x8e, 0x55, 0xb6, 0xb4, 0xfb, 0x5a, 0x1a,
+        0x0e, 0xce, 0x23, 0x63, 0x70, 0x56, 0xf0, 0x1d, 0xed, 0x7f, 0x61, 0xf5,
+        0x53, 0x3e, 0xa1, 0xb4, 0xcb, 0x8e, 0x6c, 0xf8, 0x62, 0x14, 0x64, 0xf1,
+        0x46, 0xc3, 0xce, 0xe0, 0x43, 0x46, 0x49, 0x93, 0x34, 0xa3, 0x5b, 0x80,
+        0x3c, 0x49, 0xf0, 0xb1, 0x2c, 0xfa, 0x9a, 0xf7, 0xd4, 0x14, 0xe2, 0x00,
+        0xd4, 0xdd, 0x99, 0x5c, 0x12, 0xef, 0xd9, 0xa2, 0x63, 0x54, 0xa4, 0xfb,
+        0xdd, 0x55, 0x75, 0x5d, 0x4a, 0x9a, 0x7c, 0xc0, 0xd2, 0x9b, 0x09, 0x84,
+        0x24, 0x46, 0x69, 0x77, 0xc5, 0x76, 0xb4, 0x61, 0xdd, 0xbe, 0x00, 0xd7,
+        0x61, 0x15, 0x2a, 0x99, 0x9a, 0xed, 0xba, 0x7f, 0xab, 0x73, 0xcd, 0x01,
+        0x67, 0xb5, 0xd6, 0x92, 0xc0, 0x9f, 0xef, 0xc4, 0x16, 0xa1, 0xff, 0x5b,
+        0x30, 0xaa, 0x69, 0xe0, 0x84, 0xc8, 0xcb, 0x87, 0x1c, 0xd3, 0x5d, 0xd3,
+        0xf2, 0x05, 0xd3, 0x9d, 0xe4, 0x19, 0x3b, 0x2c, 0xa0, 0xd0, 0x04, 0x2c,
+        0x50, 0x00, 0xc4, 0xf3, 0x5a, 0xc1, 0xbe, 0x0e, 0xc4, 0x97, 0xb5, 0x84,
+        0x1b, 0x94, 0x9a, 0xf4, 0x41, 0xce, 0xc0, 0x91, 0x1a, 0xc5, 0xda, 0xcf,
+        0xd8, 0xa6, 0x86, 0x62, 0x12, 0xac, 0x52, 0xaa, 0xb3, 0x8c, 0x36, 0x07,
+        0x29, 0x33, 0x15, 0xef, 0x8a, 0x16, 0xdf, 0x18, 0x79, 0x30, 0x33, 0x6f,
+        0xa0, 0xf0, 0x26, 0x31, 0x35, 0xea, 0xe1, 0x29, 0x96, 0x38, 0x8e, 0xca,
+        0x2e, 0x08, 0x20, 0x63, 0xbb, 0xd6, 0x45, 0x27, 0x9b, 0x1a, 0xcf, 0xf0,
+        0x9b, 0x4c, 0xa7, 0x4e, 0x02, 0xf3, 0xdd, 0xbd, 0x05, 0x73, 0xd0, 0x39,
+        0xb7, 0xa1, 0x23, 0x8f, 0x94, 0xee, 0x78, 0x36, 0xf5, 0xc5, 0x6e, 0xe2,
+        0x31, 0x74, 0x4b, 0xcf, 0xd6, 0xa0, 0x7f, 0xe9, 0x3d, 0x7d, 0x3b, 0x2c,
+        0x78, 0x75, 0x14, 0xd6, 0x0e, 0xd4, 0x58, 0x36, 0xdf, 0xd6, 0x8f, 0x2f,
+        0x2a, 0x33, 0x16, 0xd8, 0x84, 0xa4, 0xa1, 0x20, 0xd5, 0x79, 0x75, 0x1b,
+        0xae, 0xa5, 0x4b, 0xa1, 0x22, 0x28, 0xa0, 0xc1, 0x1f, 0x00, 0xc2, 0xa5,
+        0xb3, 0x68, 0x5c, 0xa1, 0xc1, 0x53, 0x29, 0x48, 0x52, 0x95, 0xc8, 0xbf,
+        0x66, 0x6d, 0xf3, 0x95, 0x20, 0x9b, 0x9f, 0x69, 0xb1, 0xff, 0xa6, 0x9f,
+        0xdb, 0x09, 0x0d, 0x2a, 0x6a, 0x23, 0x5f, 0x92, 0x4a, 0xbf, 0x49, 0xec,
+        0xc9, 0x58, 0x87, 0xc2, 0x72, 0x6c, 0xf5, 0xf9, 0x67, 0x97, 0x0f, 0x8b,
+        0xdb, 0xef, 0x1f, 0xb8, 0x23, 0x60, 0xef, 0x06, 0xd8, 0x01, 0x20, 0xb3,
+        0x96, 0x00, 0xf6, 0x13, 0x27, 0x3e, 0x4b, 0xea, 0x8b, 0xce, 0x2e, 0x9b,
+        0x57, 0x61, 0x02, 0xf9, 0x86, 0xf3, 0x0a, 0xe5, 0x59, 0x89, 0x0e, 0x9b,
+        0x87, 0xb0, 0x21, 0x21, 0x8e, 0x06, 0x59, 0xb1, 0xa3, 0x7b, 0x6b, 0x85,
+        0xc5, 0x22, 0xca, 0xab, 0x82, 0xf1, 0x65, 0x21, 0xb8, 0xa3, 0x3b, 0x4a,
+        0xad, 0x79, 0xcd, 0xfe, 0x07, 0x52, 0x0d, 0xa5, 0x2e, 0x69, 0x14, 0xca,
+        0x15, 0x25, 0x8c, 0x85, 0x3e, 0x76, 0xdc, 0x73, 0xf3, 0xdc, 0xfc, 0x70,
+        0xc5, 0x11, 0x4b, 0x04, 0x6c, 0x0e, 0x90, 0x24, 0x32, 0xba, 0xed, 0x4c,
+        0x69, 0x4f, 0x58, 0x94, 0xfe, 0x75, 0x70, 0xd8, 0xfc, 0xbe, 0xe7, 0x00,
+        0xe7, 0x0a, 0x4f, 0x76, 0xea, 0x1c, 0x29, 0x07, 0xaf, 0xd0, 0x76, 0x7e,
+        0xd1, 0x7d, 0xdc, 0xa0, 0xd2, 0x80, 0x23, 0x64, 0xc3, 0x9d, 0x23, 0x4a,
+        0xf4, 0x7d, 0x8e, 0xae, 0x60, 0x8b, 0xcf, 0xc8, 0x16, 0x7a, 0x97, 0xec,
+        0x75, 0x2c, 0x56, 0x38, 0xe1, 0x0c, 0xf2, 0x89, 0x34, 0x47, 0xb9, 0x71,
+        0x5d, 0x5a, 0xda, 0x96, 0xa4, 0x14, 0xb0, 0x01, 0x98, 0x5e, 0xd7, 0xc8,
+        0xe3, 0x6b, 0x4d, 0x02, 0x2f, 0xe6, 0x1f, 0x09, 0xee, 0x10, 0x9f, 0xfe,
+        0x67, 0x52, 0x69, 0xbf, 0x98, 0xb7, 0xc8, 0xf9, 0x67, 0x41, 0xf7, 0xea,
+        0x0d, 0x80, 0x98, 0x1c, 0x0f, 0xe1, 0xc1, 0xf1, 0xdb, 0x28, 0xd1, 0x56,
+        0x08, 0x5c, 0xa3, 0x23, 0x7a, 0x1c, 0x10, 0xef, 0x84, 0x62, 0x35, 0xaa,
+        0xd1, 0x35, 0x94, 0xe6, 0x69, 0x16, 0x60, 0x29, 0x92, 0x1b, 0x49, 0xcb,
+        0x35, 0x02, 0x83, 0x31, 0xf8, 0x6a, 0xe1, 0x4f, 0x72, 0xfb, 0xc3, 0x14,
+        0xc8, 0x2b, 0x88, 0xa1, 0xa5, 0x2f, 0x68, 0xae, 0xc3, 0x99, 0x75, 0x35,
+        0xff, 0xa6, 0x23, 0x71, 0xcc, 0x25, 0xe9, 0x9e, 0xde, 0x2d, 0xd0, 0x93,
+        0x0e, 0x93, 0xbb, 0x9c, 0x7e, 0xc2, 0xd2, 0x30, 0x6c, 0x2d, 0x81, 0x26,
+        0x4b, 0xcb, 0x2e, 0x35, 0x2b, 0xa2, 0x8d, 0x49, 0x0d, 0xff, 0xe5, 0xd3,
+        0x61, 0xd1, 0x6c, 0xf2, 0xcb, 0x1d, 0x37, 0x70, 0x0a, 0x2f, 0xff, 0x2c,
+        0x37, 0xe2, 0x7b, 0x2a, 0x93, 0x87, 0x3b, 0xf4, 0x43, 0x4d, 0x62, 0x39,
+        0x3f, 0x68, 0xba, 0x80, 0xf1, 0x0d, 0xdf, 0xc0, 0xa1, 0xb4, 0xba, 0xc4,
+        0x8f, 0xc0, 0x68, 0x7d, 0x80, 0xea, 0x9c, 0xd9, 0xfa, 0x4b, 0xe5, 0x1c,
+        0x12, 0x2f, 0xd0, 0x7c, 0x67, 0x8f, 0x14, 0xaa, 0x3a, 0x3c, 0x09, 0x52,
+        0x99, 0xf4, 0x1e, 0x96, 0xb0, 0xca, 0xe8, 0xc9, 0x4e, 0x00, 0x31, 0x7a,
+        0xda, 0xc0, 0xe6, 0x5b, 0xca, 0xb7, 0x4b, 0xbe, 0xaa, 0x0d, 0xf6, 0xf2,
+        0x09, 0xb6, 0x6a, 0x40, 0x24, 0x1c, 0x1b, 0xaa, 0x7d, 0x58, 0x7b, 0xc8,
+        0xbf, 0xa0, 0xd6, 0x16, 0x58, 0x90, 0x3c, 0xcd, 0xfb, 0x8e, 0xbf, 0xe9,
+        0xff, 0x29, 0xfd, 0x2b, 0xf7, 0x01, 0x41, 0xee, 0x25, 0xff, 0x0d, 0xc2,
+        0xf9, 0x93, 0xcb, 0x3a, 0x24, 0x0e, 0xce, 0xc1, 0xc3, 0x89, 0xef, 0xc1,
+        0x30, 0x65, 0x37, 0xbf, 0xef, 0xf6, 0x0e, 0x86, 0x83, 0x79, 0x32, 0x03,
+        0x9b, 0x12, 0xe2, 0x44, 0x54, 0xdc, 0x04, 0x8f, 0x8c, 0x94, 0x21, 0x75,
+        0x88, 0x6f, 0x26, 0xf3, 0x1d, 0x8b, 0xae, 0x1b, 0x04, 0x1e, 0xee, 0x2a,
+        0x9a, 0x21, 0x56, 0x72, 0x2b, 0xef, 0x75, 0x30, 0xbd, 0x28
+    },
+    .commitments = {
+        { 0xe6, 0x58, 0x63, 0x2a, 0x79, 0x0b, 0x84, 0xc2, 0x78, 0x7f, 0x87, 0x33, 0x28, 0x3f, 0xe6, 0xd2, 0x32, 0x60, 0x0d, 0x73, 0xba, 0x89, 0x79, 0x5b, 0xad, 0x40, 0x0c, 0x4b, 0x9b, 0x77, 0xa0, 0x29 },
+        { 0x4e, 0x15, 0x6a, 0x3b, 0x37, 0x24, 0x5d, 0xe5, 0xd9, 0x77, 0x64, 0xe1, 0x7d, 0x8c, 0x46, 0x46, 0x70, 0x38, 0xd8, 0xc7, 0xae, 0x5c, 0xee, 0x82, 0x25, 0xa1, 0xe2, 0xa2, 0xad, 0x7f, 0x4a, 0x25 },
+        { 0xdd, 0x8e, 0x1a, 0xf4, 0x86, 0xfd, 0x57, 0x39, 0x3c, 0x41, 0xbd, 0x93, 0x83, 0xc8, 0x76, 0x3d, 0x17, 0xfe, 0x14, 0xeb, 0xed, 0x7b, 0x0f, 0x2b, 0x08, 0x42, 0x96, 0x30, 0x1f, 0x72, 0xbd, 0x07 },
+        { 0x92, 0x78, 0xa1, 0xa9, 0x69, 0x31, 0x11, 0xfa, 0x4c, 0x47, 0x00, 0x70, 0xd6, 0x2c, 0xef, 0x52, 0x67, 0x61, 0x1f, 0xec, 0x8f, 0xeb, 0xad, 0x0e, 0x3c, 0x97, 0x73, 0xb7, 0xef, 0x8f, 0x02, 0x1d },
+        { 0x44, 0x37, 0x42, 0x53, 0xe5, 0x53, 0x0f, 0x77, 0x64, 0xfd, 0x67, 0x04, 0xe9, 0xb7, 0xb5, 0x06, 0x4a, 0x3d, 0x5b, 0xcb, 0x52, 0x5a, 0xff, 0x1d, 0xab, 0xde, 0x9f, 0x09, 0x1c, 0xa1, 0xb6, 0x13 },
+    },
+    .anchor = {
+        0x6e, 0xff, 0x53, 0xfe, 0x45, 0xb4, 0x0c, 0x37, 0xfe, 0x29, 0x7b, 0xf8,
+        0xbe, 0x34, 0x5f, 0x33, 0xcd, 0x6c, 0xa5, 0x81, 0x07, 0x5a, 0xc8, 0xab,
+        0xc7, 0xfb, 0x11, 0xa8, 0xb1, 0x68, 0x71, 0x06
+    }
+},
+{
+    .bundle = {
+        0x05, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xb3, 0x8f, 0x91,
+        0x6d, 0x17, 0x60, 0x8c, 0xb6, 0xcc, 0xe2, 0xe9, 0x8b, 0xb4, 0x26, 0x8d,
+        0x13, 0x72, 0x2b, 0x9c, 0x9a, 0xb2, 0xb7, 0xbd, 0xac, 0x1e, 0xf9, 0xfb,
+        0xfa, 0x58, 0x65, 0x28, 0x28, 0xf5, 0x7a, 0x59, 0x69, 0xbc, 0x00, 0x1e,
+        0x63, 0xbc, 0xa1, 0x0e, 0x9f, 0x1e, 0xa5, 0x20, 0x24, 0xcc, 0x2f, 0x73,
+        0xff, 0xfc, 0x2f, 0x0c, 0xd8, 0xb0, 0xd3, 0x17, 0x8a, 0xde, 0x56, 0x2b,
+        0x09, 0x80, 0x23, 0x61, 0x98, 0x92, 0x47, 0xb1, 0xb6, 0x2e, 0xd1, 0xce,
+        0xa5, 0x5a, 0xab, 0x89, 0xec, 0x29, 0x87, 0xf3, 0x05, 0x2f, 0x1d, 0x1a,
+        0x29, 0x84, 0x60, 0x9d, 0x1f, 0x1e, 0x80, 0xd6, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x2c, 0xd2, 0x14, 0xba, 0xcf, 0xd4, 0x24, 0x23, 0x57, 0xf4, 0xfc,
+        0x6f, 0x1d, 0x78, 0x28, 0x5c, 0x63, 0xb5, 0x36, 0xaf, 0x42, 0x68, 0x96,
+        0xe9, 0x70, 0x3f, 0xea, 0x56, 0x8e, 0xaf, 0xb2, 0x3a, 0xaf, 0x64, 0xec,
+        0x4f, 0xf6, 0x2d, 0xcb, 0xd5, 0xb5, 0x2c, 0xdc, 0xf4, 0x8e, 0xe8, 0x5a,
+        0x64, 0xed, 0x97, 0xad, 0x40, 0x5a, 0x13, 0x7f, 0x4d, 0xbd, 0xc7, 0xca,
+        0x38, 0x1b, 0x8c, 0xeb, 0x0b, 0xfa, 0xb8, 0xed, 0x98, 0x20, 0xb7, 0x9a,
+        0x0d, 0xe9, 0x96, 0xcd, 0x0e, 0x8f, 0x52, 0xb2, 0x4b, 0x02, 0xec, 0x89,
+        0x5f, 0x3f, 0xce, 0x56, 0xa4, 0x67, 0x79, 0xb5, 0x03, 0x09, 0x83, 0x5a,
+        0x23, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0xf3, 0xbb, 0x9d, 0xdd, 0xf0, 0x17, 0x5e,
+        0x06, 0x96, 0x4f, 0xb4, 0x07, 0x66, 0xdd, 0x0c, 0xbe, 0xad, 0x83, 0x98,
+        0x6e, 0xb5, 0x18, 0xf4, 0x2d, 0xdc, 0x37, 0x1c, 0x2b, 0x50, 0x2f, 0xa7,
+        0x14, 0x60, 0x07, 0x67, 0x28, 0xb3, 0x64, 0xcf, 0xc2, 0x65, 0x40, 0x5c,
+        0x7b, 0x44, 0x12, 0x42, 0x2f, 0x6d, 0xe2, 0x13, 0x63, 0x2a, 0x36, 0x7e,
+        0x89, 0x31, 0x6d, 0xbc, 0xbe, 0xbb, 0x74, 0xae, 0xbd, 0xd9, 0xfe, 0x9f,
+        0x36, 0x08, 0xa6, 0xc6, 0xff, 0x09, 0x93, 0x58, 0xa6, 0x94, 0xf6, 0xae,
+        0xce, 0x4d, 0xa0, 0xc5, 0x35, 0x62, 0x8a, 0x88, 0x82, 0x43, 0x52, 0x9c,
+        0xa9, 0xb1, 0xf7, 0xa8, 0x10, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x85, 0x2c, 0xd0,
+        0xe2, 0x74, 0x56, 0x45, 0xb4, 0xe4, 0xe8, 0xf2, 0x4e, 0x56, 0x87, 0xe8,
+        0x1e, 0xaf, 0xa8, 0xbf, 0x87, 0x5d, 0x98, 0xb8, 0x8e, 0xd6, 0x95, 0x4f,
+        0x73, 0x36, 0xde, 0x38, 0x1d, 0x8e, 0xc0, 0x2c, 0x70, 0x30, 0x9d, 0x8c,
+        0x64, 0x76, 0x6d, 0x9a, 0xb9, 0x17, 0x0c, 0xe7, 0xaa, 0x9f, 0x1c, 0xba,
+        0xd7, 0xaf, 0x03, 0x43, 0x18, 0xbe, 0xac, 0x26, 0xc4, 0x1b, 0x5f, 0xdf,
+        0x16, 0x1f, 0x01, 0xf1, 0xf8, 0xf4, 0xb5, 0x64, 0xd8, 0xb0, 0xff, 0xd3,
+        0x2a, 0xff, 0x11, 0x24, 0x3d, 0xee, 0x25, 0x82, 0xb4, 0xa3, 0xef, 0xbb,
+        0xce, 0xc9, 0x20, 0x02, 0x6c, 0x5e, 0x1f, 0x44, 0x1e, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x28, 0xfd, 0x47, 0xa4, 0x8d, 0x2f, 0x43, 0xeb, 0xc8, 0xb9, 0x0f,
+        0x86, 0x03, 0x1e, 0x1e, 0xb0, 0x67, 0xd5, 0xd7, 0x40, 0x2c, 0x27, 0xcb,
+        0xde, 0x9e, 0x5d, 0x4f, 0x22, 0xd4, 0x2d, 0x09, 0x2b, 0xad, 0x1b, 0x28,
+        0x44, 0xb7, 0xf7, 0x68, 0x2b, 0x94, 0x9d, 0xb3, 0x30, 0xdb, 0xd3, 0x77,
+        0x12, 0x8f, 0x18, 0xdb, 0xf1, 0x40, 0x7b, 0xdc, 0x5f, 0x51, 0x95, 0x61,
+        0x1e, 0xb1, 0x6b, 0x5b, 0x97, 0xa0, 0x65, 0x87, 0xcc, 0xc0, 0x3f, 0x14,
+        0x92, 0x94, 0x65, 0xcd, 0x3d, 0x93, 0x37, 0x90, 0xda, 0xb1, 0x23, 0xae,
+        0x4e, 0x57, 0x55, 0x8a, 0x7a, 0xf4, 0xfc, 0x06, 0x1e, 0x6b, 0x46, 0x7f,
+        0x1c, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0xc3, 0x86,
+        0x77, 0xd1, 0xbd, 0xf7, 0x06, 0x00, 0x1e, 0x18, 0x60, 0x86, 0xf7, 0x90,
+        0x0d, 0xdf, 0x7f, 0x0e, 0x9b, 0x78, 0x5e, 0x5e, 0xa7, 0xb5, 0x90, 0x52,
+        0x0d, 0x2e, 0x91, 0x2f, 0x70, 0xcc, 0xb2, 0x46, 0xed, 0xce, 0x28, 0xaf,
+        0xdc, 0x22, 0xfd, 0xb5, 0x07, 0x8d, 0x20, 0x62, 0x62, 0x90, 0x13, 0x0e,
+        0x09, 0xa3, 0x77, 0xe7, 0x93, 0xe8, 0x81, 0xbf, 0x6f, 0x33, 0x81, 0xf8,
+        0x6f, 0x07, 0x2b, 0x34, 0xf3, 0x78, 0x6d, 0x84, 0xce, 0xd7, 0x15, 0x6b,
+        0x2b, 0xac, 0xe7, 0xf2, 0xea, 0x4c, 0x7a, 0xe9, 0xcc, 0x48, 0x48, 0x69,
+        0x2a, 0x52, 0x14, 0x94, 0x00, 0x2e, 0x24, 0xae, 0x29, 0xe2, 0xd5, 0xf8,
+        0x5c, 0x45, 0x11, 0x14, 0xb8, 0xfc, 0x11, 0x2b, 0xc0, 0x16, 0x17, 0xe1,
+        0x73, 0xed, 0xf7, 0x32, 0x44, 0x1f, 0x30, 0x4b, 0x38, 0xe2, 0x87, 0x73,
+        0x2f, 0x49, 0xf5, 0x12, 0xa6, 0xf2, 0x43, 0x02, 0xca, 0xaa, 0x01, 0xaf,
+        0x5b, 0x06, 0x87, 0xee, 0x65, 0x76, 0x2f, 0xdc, 0x86, 0xb7, 0xa0, 0xc9,
+        0x25, 0x97, 0x61, 0x77, 0x43, 0x2f, 0x88, 0x07, 0xff, 0xb0, 0xac, 0x6a,
+        0xf8, 0x6d, 0xb4, 0xce, 0xb4, 0x9a, 0x2f, 0xe0, 0x3a, 0x46, 0xa4, 0xcd,
+        0x30, 0x69, 0x2a, 0x86, 0x85, 0x1a, 0x9f, 0xaa, 0x10, 0xfc, 0xf4, 0x2f,
+        0x76, 0xde, 0x9a, 0x94, 0x7e, 0x21, 0x48, 0x90, 0xbd, 0x9e, 0xf8, 0x32,
+        0x6e, 0x0d, 0x2e, 0x67, 0x02, 0xb9, 0x77, 0xa4, 0x49, 0xc2, 0x09, 0x3e,
+        0x7c, 0xff, 0x20, 0xc2, 0xf2, 0x8a, 0x63, 0xec, 0x88, 0x8d, 0x68, 0xbc,
+        0x83, 0x66, 0x5e, 0x0a, 0x41, 0xa8, 0xf6, 0x07, 0xa2, 0xb7, 0xb9, 0x73,
+        0x01, 0xb6, 0x10, 0xca, 0xb3, 0x65, 0x50, 0xab, 0xed, 0x84, 0x40, 0x17,
+        0xb8, 0x5d, 0xf0, 0xdb, 0x49, 0x09, 0x3d, 0x79, 0x1a, 0x9e, 0x13, 0x9b,
+        0xef, 0x4f, 0x73, 0x51, 0x9e, 0xa7, 0xfe, 0x16, 0x4f, 0x17, 0x90, 0xc3,
+        0x6b, 0xb8, 0x58, 0xfe, 0x8a, 0xae, 0xab, 0x8c, 0x33, 0x0e, 0xd2, 0x6a,
+        0x71, 0x52, 0x06, 0x0d, 0x8c, 0x0f, 0x14, 0x79, 0x60, 0x0b, 0xa0, 0x58,
+        0x86, 0x1e, 0xa9, 0x8d, 0x7a, 0xb8, 0xc8, 0xd1, 0x26, 0x49, 0x40, 0xb4,
+        0x38, 0xe8, 0x2b, 0xfb, 0xbf, 0x4f, 0xda, 0xbe, 0xb3, 0x28, 0x54, 0xc9,
+        0x4c, 0xb6, 0x39, 0xad, 0xdd, 0xfb, 0xd6, 0x59, 0x82, 0x83, 0x11, 0xf9,
+        0xea, 0xcc, 0xf8, 0x44, 0xa9, 0x14, 0x78, 0x80, 0xa2, 0xc4, 0xff, 0xef,
+        0x14, 0x8f, 0xb5, 0x29, 0xcb, 0x1e, 0x0e, 0xf2, 0xb4, 0x7f, 0x28, 0xd2,
+        0xd9, 0x3a, 0x9c, 0xd6, 0xb9, 0xc8, 0xc2, 0x56, 0x1e, 0xfc, 0x0c, 0x1f,
+        0x26, 0xa0, 0xf3, 0xfd, 0x90, 0x69, 0x25, 0x8c, 0x75, 0xd4, 0x5b, 0xef,
+        0x99, 0x0c, 0x2e, 0x1d, 0x1b, 0xdf, 0x82, 0x63, 0x86, 0x3f, 0xd8, 0x7f,
+        0xef, 0x2d, 0x24, 0xde, 0x7d, 0x03, 0xc8, 0xca, 0xf4, 0x88, 0xba, 0x56,
+        0x52, 0xae, 0x82, 0x28, 0xb5, 0x32, 0xcf, 0x1e, 0xf1, 0xc6, 0xec, 0x57,
+        0x0c, 0xf1, 0x84, 0x19, 0x7c, 0x5e, 0x68, 0x4d, 0x17, 0x13, 0x83, 0x71,
+        0xe4, 0x54, 0x3d, 0xbf, 0x91, 0x6a, 0xa1, 0x5c, 0x78, 0x09, 0x26, 0xc8,
+        0x13, 0x6c, 0xde, 0x46, 0x44, 0xbb, 0x28, 0x7f, 0x1b, 0xfc, 0xa1, 0xc6,
+        0x2d, 0xb7, 0xfc, 0x84, 0xfa, 0xb3, 0x37, 0xf7, 0x59, 0x40, 0xd4, 0x58,
+        0x01, 0x81, 0x79, 0xb4, 0xe3, 0xa8, 0x26, 0x99, 0x98, 0x12, 0x52, 0x27,
+        0x63, 0x57, 0x31, 0xa9, 0xdd, 0xe9, 0xaa, 0xb7, 0x2f, 0x0f, 0xd4, 0x99,
+        0x46, 0x94, 0x1b, 0x1e, 0xf8, 0xe6, 0xe0, 0x92, 0x4d, 0xf8, 0xbb, 0x97,
+        0x3b, 0xdd, 0xcc, 0x68, 0xdc, 0x56, 0x8f, 0x48, 0x2d, 0x2a, 0x18, 0xce,
+        0xbe, 0x4e, 0x9c, 0x41, 0x67, 0x60, 0xa4, 0xdf, 0xaa, 0xc4, 0x34, 0x97,
+        0xda, 0x1a, 0x15, 0xe6, 0x9b, 0xd5, 0xbf, 0xdd, 0x15, 0x47, 0xbf, 0x7a,
+        0xe6, 0x36, 0xac, 0x19, 0x18, 0xa4, 0x6c, 0x8e, 0x5a, 0xaf, 0x92, 0x0a,
+        0x2f, 0x7d, 0x26, 0x11, 0xad, 0xc4, 0xb6, 0xcc, 0xb5, 0x39, 0x94, 0xf2,
+        0xd8, 0x14, 0x7f, 0x24, 0xb9, 0x81, 0x9b, 0x2b, 0xc4, 0x97, 0x06, 0x13,
+        0x1a, 0xaa, 0x83, 0xc2, 0x1b, 0x74, 0x7c, 0x3b, 0x89, 0x03, 0xd9, 0x10,
+        0x6a, 0x7b, 0x0a, 0xf0, 0x9f, 0xe0, 0xd0, 0x7d, 0xe5, 0x81, 0xd8, 0x22,
+        0xed, 0xe3, 0x55, 0x2d, 0x56, 0x3e, 0x39, 0x87, 0xfe, 0xb4, 0x95, 0x96,
+        0x0d, 0x01, 0x45, 0x7e, 0xb0, 0xe2, 0x2e, 0x77, 0x3b, 0x16, 0x11, 0x04,
+        0x29, 0xaa, 0x34, 0x5a, 0xb7, 0xb9, 0x05, 0xae, 0x8f, 0x0e, 0x38, 0xa7,
+        0x2e, 0x81, 0x8f, 0x0c, 0xb3, 0xbd, 0xb1, 0xac, 0x2a, 0x36, 0x17, 0x32,
+        0x44, 0x65, 0x71, 0x7e, 0x2f, 0xc5, 0x4f, 0x4c, 0x27, 0xc7, 0x6d, 0xdf,
+        0xb3, 0x7d, 0xf5, 0x1c, 0x7c, 0x84, 0x8e, 0x29, 0xb5, 0x2d, 0xaa, 0x4f,
+        0x97, 0x69, 0xb3, 0x0b, 0x90, 0x1d, 0x69, 0x0c, 0x5e, 0x15, 0x99, 0xbe,
+        0x0b, 0x25, 0x66, 0x59, 0x36, 0xbb, 0xd9, 0xf5, 0x66, 0x86, 0x47, 0x00,
+        0xde, 0xf7, 0x64, 0x5d, 0x28, 0x2d, 0xdc, 0x25, 0xe4, 0x69, 0x61, 0xaa,
+        0xda, 0xf0, 0xed, 0xed, 0xef, 0x30, 0x70, 0xf9, 0xe4, 0xba, 0x4a, 0xd1,
+        0x35, 0x97, 0x55, 0x58, 0x9a, 0x54, 0xee, 0x2d, 0xa8, 0x14, 0xe4, 0x9f,
+        0x32, 0xc8, 0xb5, 0x16, 0xd2, 0xc1, 0xad, 0x9b, 0x8c, 0xeb, 0x1a, 0xfd,
+        0x64, 0xb0, 0xd2, 0x65, 0x6b, 0xfc, 0x25, 0x9b, 0x55, 0x0d, 0x5e, 0x88,
+        0x6e, 0x37, 0xa3, 0x4e, 0x02, 0x3f, 0x4a, 0xd6, 0x95, 0x66, 0xd2, 0xfa,
+        0x58, 0x3c, 0x98, 0xd1, 0xf0, 0xd2, 0x53, 0x70, 0x65, 0x0c, 0xb5, 0x17,
+        0x1e, 0x30, 0x23, 0x43, 0x7f, 0x99, 0xbd, 0x97, 0x49, 0x4e, 0x94, 0x87,
+        0xaf, 0x1b, 0xa4, 0xb8, 0xc6, 0x7c, 0xa5, 0x43, 0x73, 0xac, 0x46, 0x64,
+        0x59, 0x66, 0xef, 0x2b, 0x48, 0xe9, 0x7c, 0x18, 0x19, 0x73, 0x94, 0x3d,
+        0x36, 0x97, 0x2e, 0x7d, 0x76, 0x8f, 0x74, 0x7e, 0x7e, 0x69, 0xd0, 0xa4,
+        0x71, 0xc0, 0xda, 0x66, 0x47, 0x80, 0xe7, 0x87, 0x11, 0xbd, 0xea, 0xa1,
+        0x11, 0x91, 0xd0, 0x61, 0x44, 0xa0, 0x09, 0x4c, 0x52, 0x14, 0x2e, 0xe6,
+        0x39, 0x74, 0xa5, 0x62, 0xfc, 0x57, 0xdc, 0x55, 0x88, 0x75, 0xc1, 0xc9,
+        0x49, 0x2c, 0x5f, 0x9d, 0x61, 0x88, 0x7f, 0x45, 0x7b, 0xa0, 0x42, 0xca,
+        0x39, 0x39, 0x09, 0x44, 0xd4, 0x6f, 0x70, 0x69, 0x01, 0x2c, 0x95, 0x1c,
+        0x2d, 0xeb, 0xf6, 0x08, 0x9d, 0x46, 0xd9, 0x90, 0xb2, 0x58, 0xae, 0x9a,
+        0x03, 0xc2, 0x18, 0xfe, 0x80, 0x52, 0xc7, 0xff, 0x3e, 0x23, 0xb7, 0x38,
+        0x9b, 0x9e, 0xab, 0xe4, 0xd8, 0x91, 0x4b, 0x8f, 0x42, 0x03, 0x9a, 0xb7,
+        0x0f, 0x10, 0xbc, 0x69, 0xf2, 0xa0, 0x21, 0x74, 0x56, 0x65, 0xe1, 0xc8,
+        0xbd, 0xb0, 0x75, 0x93, 0xc1, 0x1f, 0x68, 0xc4, 0x22, 0xb2, 0xf9, 0xa4,
+        0x10, 0x94, 0x64, 0xdb, 0x88, 0xb6, 0x0f, 0xba, 0xa6, 0x4d, 0xc5, 0x3f,
+        0x18, 0xbd, 0x44, 0x34, 0xce, 0xd2, 0xab, 0xba, 0xae, 0x69, 0xf9, 0x79,
+        0x01, 0x7f, 0xe4, 0x78, 0x09, 0xbc, 0xd6, 0xf4, 0xf3, 0x23, 0xfa, 0x5f,
+        0xc9, 0x28, 0x1a, 0x01, 0x7c, 0x1f, 0xb1, 0xb0, 0x23, 0xa7, 0x0b, 0x1f,
+        0x68, 0x25, 0x19, 0x98, 0xb1, 0x73, 0xd4, 0xb7, 0x41, 0x12, 0x9d, 0x6a,
+        0x9d, 0x6d, 0xb9, 0x0a, 0xe1, 0x06, 0x03, 0xf3, 0xc8, 0x4a, 0xa4, 0x66,
+        0x6e, 0xdf, 0x82, 0x04, 0x2f, 0x69, 0x54, 0x08, 0xda, 0xd4, 0x39, 0xf1,
+        0x4c, 0x25, 0x57, 0xbd, 0x1d, 0x59, 0xb4, 0xf1, 0x09, 0x99, 0x55, 0xd0,
+        0x09, 0x20, 0x53, 0x25, 0x34, 0x40, 0xed, 0x8e, 0x30, 0xcb, 0xd6, 0x77,
+        0x9f, 0xa1, 0xc0, 0x8b, 0xb1, 0x99, 0x14, 0x66, 0x4a, 0x16, 0xf6, 0x5f,
+        0xa4, 0x73, 0x21, 0x98, 0xc4, 0xb8, 0x0c, 0xd2, 0x7d, 0x83, 0x2c, 0xde,
+        0xec, 0x9b, 0xb4, 0x87, 0xde, 0xed, 0x99, 0x17, 0xf5, 0xbf, 0xfa, 0x2b,
+        0x1b, 0x9b, 0xe5, 0x26, 0xcd, 0x77, 0x17, 0xba, 0xe0, 0x64, 0xae, 0x90,
+        0xae, 0x9b, 0xbb, 0x7f, 0xaf, 0x90, 0xfa, 0x17, 0xa7, 0x01, 0xe6, 0xcb,
+        0xd7, 0x96, 0x32, 0x5d, 0xba, 0xd9, 0x8f, 0xe2, 0x5c, 0x54, 0xae, 0x3a,
+        0xd0, 0x5f, 0xd3, 0x3e, 0x69, 0x3f, 0xc3, 0x8a, 0x77, 0x46, 0x43, 0x1c,
+        0xb0, 0x56, 0x3d, 0x6c, 0x67, 0xc1, 0x2d, 0x65, 0x61, 0x65, 0x97, 0x8e,
+        0xf7, 0x11, 0x72, 0x9d, 0x8a, 0x84, 0x84, 0x4d, 0x21, 0xf0, 0x5a, 0x00,
+        0x6b, 0x32, 0xc3, 0x18, 0xfd, 0x01, 0x90, 0x7a, 0xb6, 0xd0, 0x00, 0x9f,
+        0x6d, 0x57, 0x3d, 0xd3, 0x51, 0xc5, 0x94, 0xd8, 0xf7, 0xfd, 0xcf, 0x8d,
+        0xd6, 0x78, 0xa5, 0xad, 0x20, 0x00, 0x34, 0x61, 0x87, 0x5f, 0xfa, 0xee,
+        0xd2, 0x1e, 0x54, 0x4d, 0xfa, 0x0b, 0x88, 0x4d, 0x60, 0x68, 0x90, 0x7c,
+        0x4b, 0xfc, 0x1f, 0x41, 0x45, 0xc8, 0x13, 0xcb, 0x65, 0x4b, 0x69, 0x23,
+        0x3f, 0x3f, 0x7e, 0x0f, 0x1b, 0xff, 0x21, 0x77, 0x36, 0x89, 0xaf, 0x87,
+        0x34, 0xa0, 0x2e, 0x84, 0x0d, 0xc8, 0x9c, 0x67, 0x2d, 0x44, 0xa3, 0x29,
+        0x2a, 0x70, 0xd0, 0xea, 0x28, 0xb1, 0x69, 0xa5, 0xa7, 0x5a, 0x97, 0x59,
+        0x39, 0xcd, 0x11, 0xa5, 0x43, 0x9d, 0x7e, 0x1c, 0x45, 0xf2, 0x37, 0x00,
+        0x77, 0xa4, 0x7a, 0x18, 0x82, 0x4c, 0x76, 0x00, 0x5b, 0xd1, 0x1a, 0x38,
+        0x55, 0xe2, 0xc7, 0x50, 0x63, 0x96, 0x60, 0x29, 0xca, 0x08, 0x40, 0x5b,
+        0x60, 0x87, 0x8c, 0xdb, 0x8d, 0xc6, 0xff, 0x6d, 0x38, 0xeb, 0x82, 0xbe,
+        0xc8, 0x6e, 0xd4, 0x15, 0x5e, 0x59, 0x40, 0x38, 0xee, 0x15, 0xc4, 0x35,
+        0x45, 0x43, 0x90, 0xc8, 0x7a, 0x30, 0x28, 0x31, 0xa9, 0xac, 0x62, 0xaa,
+        0xee, 0x6e, 0x12, 0xa3, 0xac, 0xa6, 0x99, 0xc9, 0x61, 0x1f, 0x53, 0xbc,
+        0x10, 0x92, 0x27, 0xe0, 0x16, 0x11, 0x93, 0xa2, 0xdc, 0xaf, 0x3c, 0x41,
+        0x48, 0x4b, 0x9c, 0x07, 0x52, 0xbd, 0x32, 0x69, 0xab, 0x81, 0x23, 0x8b,
+        0x2e, 0x96, 0xdc, 0x15, 0x70, 0xdc, 0xcc, 0x6d, 0xe9, 0x8a, 0x5b, 0x7f,
+        0xeb, 0x82, 0x23, 0xd1, 0x86, 0x92, 0x59, 0x9b, 0x02, 0xf0, 0x25, 0x6c,
+        0x83, 0x48, 0xbb, 0x1f, 0x04, 0xd0, 0x94, 0x44, 0x72, 0xae, 0xf3, 0xe2,
+        0xb8, 0xa0, 0xb6, 0x8b, 0x8f, 0x02, 0xcb, 0x4d, 0x0d, 0x48, 0x2a, 0xa5,
+        0x47, 0xde, 0x5a, 0x08, 0xa2, 0xbd, 0xc6, 0xdf, 0x34, 0xbb, 0x41, 0xf9,
+        0x08, 0x6e, 0x63, 0x7a, 0x5a, 0xb5, 0xd7, 0x55, 0xed, 0x3e, 0x35, 0x48,
+        0xd7, 0xe5, 0x48, 0x22, 0x7a, 0xaf, 0x77, 0x5e, 0x71, 0xb2, 0x95, 0xb2,
+        0xde, 0xb1, 0x14, 0xcd, 0x17, 0x2b, 0x3d, 0xfb, 0xd7, 0x43, 0x46, 0xf7,
+        0xe3, 0xff, 0x3c, 0x17, 0xe2, 0x4f, 0xd5, 0x71, 0x89, 0x03, 0x9c, 0x90,
+        0xfa, 0x05, 0x0c, 0x57, 0x1d, 0x3f, 0xaa, 0x2b, 0x3f, 0x04, 0x71, 0x4c,
+        0x77, 0xed, 0x30, 0xa6, 0x47, 0x33, 0xfc, 0xf3, 0x98, 0xca, 0x92, 0x46,
+        0x49, 0xdd, 0xcc, 0xa0, 0x8b, 0xc6, 0x6f, 0x54, 0x2e, 0x44, 0xe8, 0x02,
+        0x70, 0x09, 0x29, 0xe8, 0xfa, 0x65, 0xcf, 0x2d, 0x3e, 0xa7, 0x6c, 0x6e,
+        0x98, 0xcd, 0x0b, 0x0b, 0x50, 0x1e, 0xb8, 0x3b, 0xfd, 0xb0, 0x88, 0xdb,
+        0xc9, 0x03, 0x2b, 0xf7, 0x55, 0x60, 0x0d, 0xa8, 0x00, 0x3e, 0x5d, 0x0b,
+        0x6c, 0x29, 0xbd, 0x39, 0xe6, 0x8e, 0x7f, 0x95, 0x58, 0x4b, 0x9d, 0x14,
+        0xb1, 0xe0, 0xdc, 0xc3, 0x8f, 0xf1, 0x2f, 0x1c, 0x2e, 0x29, 0x0b, 0xe0,
+        0x80, 0xa8, 0x95, 0x8d, 0xb0, 0xc6, 0xd0, 0xfe, 0x66, 0x81, 0xac, 0x15,
+        0x05, 0x79, 0xd4, 0x0f, 0x12, 0x1e, 0x77, 0x7b, 0x45, 0x7b, 0xad, 0xa9,
+        0x3f, 0xe3, 0xc3, 0x6b, 0x87, 0xdb, 0x37, 0xa2, 0x36, 0x5a, 0xa8, 0xce,
+        0xf2, 0xd6, 0x16, 0xb8, 0x27, 0x3d, 0xb9, 0xd1, 0x4d, 0x01, 0xcd, 0x54,
+        0x45, 0x49, 0x41, 0xaa, 0x25, 0x12, 0xe0, 0xc0, 0x2c, 0x9f, 0x01, 0xe1,
+        0x84, 0xc3, 0xc9, 0xaa, 0xeb, 0x3d, 0xf2, 0x6e, 0xdf, 0xc9, 0xac, 0x5a,
+        0x4e, 0x17, 0x81, 0xc1, 0xcc, 0x9f, 0xfc, 0x7c, 0x4c, 0x7c, 0xe0, 0xb4,
+        0x2a, 0x50, 0xf5, 0x04, 0xc3, 0x65, 0xe1, 0x64, 0x0c, 0x12, 0x10, 0x8c,
+        0x82, 0xc6, 0x21, 0x0d, 0xdd, 0xcb, 0xc0, 0x10, 0x29, 0xe8, 0x36, 0x87,
+        0xeb, 0x21, 0x3c, 0x0d, 0xee, 0xd2, 0x1b, 0xea, 0x9a, 0x97, 0x5e, 0xf9,
+        0xc2, 0x9b, 0x74, 0xde, 0x36, 0x54, 0x7f, 0xe1, 0x6f, 0x97, 0xfd, 0x45,
+        0x57, 0xac, 0xee, 0xc2, 0x54, 0x0a, 0x6c, 0x35, 0xe6, 0x76, 0x6f, 0xeb,
+        0x67, 0x7e, 0x1a, 0x23, 0x25, 0x6a, 0x78, 0x94, 0x4c, 0x71, 0xc8, 0x59,
+        0xa7, 0xe1, 0x39, 0x93, 0x81, 0x1b, 0x26, 0x70, 0x1c, 0x98, 0xa0, 0x2d,
+        0x2a, 0xe3, 0x20, 0xad, 0xcd, 0xf9, 0x64, 0x39, 0xec, 0x16, 0x63, 0xbd,
+        0x5c, 0xe1, 0x1f, 0xc7, 0x82, 0x05, 0x06, 0x6b, 0x81, 0xc7, 0x54, 0xea,
+        0xc4, 0x70, 0x25, 0x85, 0x55, 0x2b, 0x5a, 0xf0, 0x13, 0x32, 0x47, 0x57,
+        0x5f, 0x1f, 0xd9, 0x4c, 0x8e, 0x5e, 0x46, 0x42, 0x5e, 0xa0, 0x28, 0xb3,
+        0x6c, 0x50, 0xa0, 0x51, 0x9a, 0x1b, 0x86, 0xfa, 0x42, 0xa6, 0x6a, 0x62,
+        0x59, 0xf6, 0x45, 0x3b, 0x09, 0xfe, 0xba, 0x4f, 0x0a, 0xde, 0x3f, 0x1e,
+        0x3b, 0x34, 0x8d, 0xc0, 0x0a, 0x3b, 0xbc, 0xf3, 0x33, 0xfc, 0x35, 0x0d,
+        0xf1, 0xdf, 0x41, 0x11, 0xe2, 0xa4, 0xe1, 0xf2, 0x00, 0xb5, 0x93, 0x36,
+        0xae, 0xc5, 0x80, 0x53, 0x08, 0x6c, 0xa2, 0x38, 0xe5, 0xc2, 0xe3, 0x2c,
+        0xde, 0x36, 0x21, 0xe4, 0x6e, 0x5d, 0x33, 0x15, 0x33, 0x0f, 0x8a, 0x41,
+        0x57, 0x2d, 0xbb, 0xf5, 0x4d, 0x2a, 0x40, 0x0d, 0x6a, 0x27, 0x91, 0x6d,
+        0xcd, 0x3f, 0x12, 0xc6, 0xd4, 0x9b, 0xd9, 0xdb, 0x8e, 0x66, 0xaa, 0x38,
+        0x8f, 0xd8, 0x6b, 0x31, 0x58, 0x8f, 0x08, 0x7b, 0x49, 0x4b, 0xf7, 0xd8,
+        0xbd, 0x6d, 0xa3, 0x89, 0x2e, 0xec, 0xcd, 0x3a, 0xff, 0x27, 0x0e, 0x42,
+        0xda, 0xf9, 0x90, 0xd3, 0xf1, 0xfd, 0x49, 0xa1, 0xd4, 0x31, 0xc7, 0x85,
+        0x8a, 0x83, 0xa7, 0x62, 0x7f, 0x43, 0x35, 0x5b, 0xa2, 0x0c, 0x91, 0xb4,
+        0xbd, 0xec, 0xa3, 0x51, 0x02, 0x45, 0x12, 0x2d, 0xa2, 0xf7, 0x23, 0x76,
+        0x6d, 0xd2, 0xde, 0xb7, 0xcf, 0x12, 0xc4, 0x18, 0xac, 0xda, 0x9b, 0xaa,
+        0x20, 0xea, 0x1c, 0xb3, 0x2a, 0xa2, 0x3a, 0x5c, 0xaf, 0xe2, 0x9f, 0xda,
+        0x88, 0xc9, 0x86, 0x1a, 0x10, 0x76, 0x0c, 0xa8, 0xd3, 0x8d, 0x7d, 0xa7,
+        0xa8, 0x4a, 0xde, 0x20, 0x8f, 0x93, 0xcb, 0x37, 0xf5, 0xa3, 0xf5, 0x1d,
+        0x5f, 0x6d, 0x97, 0xcb, 0x5d, 0xec, 0xf1, 0x1b, 0xae, 0xa8, 0x6d, 0x46,
+        0x11, 0x10, 0xb7, 0x0e, 0xb0, 0x46, 0x87, 0x65, 0x1e, 0x1f, 0x5e, 0x32,
+        0x5f, 0x9f, 0xf3, 0x7e, 0x69, 0xbc, 0xb3, 0x9e, 0x5e, 0xa2, 0xfc, 0xc1,
+        0xd7, 0x09, 0x06, 0x78, 0xd2, 0x34, 0x2b, 0x52, 0x9e, 0xcc, 0x14, 0xa1,
+        0x16, 0xaa, 0xcf, 0xa5, 0x63, 0xb0, 0x1a, 0x0e, 0x72, 0x5a, 0xd2, 0xd0,
+        0xeb, 0x1b, 0xa9, 0xcb, 0xda, 0x85, 0xc6, 0x08, 0x92, 0xe0, 0x6d, 0xa9,
+        0x0e, 0x5f, 0x37, 0x68, 0xf5, 0xa8, 0x8a, 0x19, 0x07, 0x7d, 0xb5, 0x38,
+        0x23, 0x18, 0x79, 0xe3, 0xab, 0x74, 0x98, 0x44, 0x03, 0x59, 0xc9, 0xf2,
+        0x58, 0x23, 0xa8, 0x5a, 0xf3, 0x1c, 0x52, 0x52, 0xd2, 0x4e, 0x6e, 0x5d,
+        0x85, 0x36, 0xa7, 0x03, 0x5e, 0xf3, 0x17, 0x0f, 0xa6, 0x83, 0x6c, 0x1f,
+        0x2d, 0x0d, 0x97, 0x9f, 0x71, 0xf4, 0x72, 0x6b, 0x46, 0xbb, 0x82, 0x8c,
+        0x3b, 0x96, 0xf5, 0xd5, 0x3f, 0xe6, 0xfb, 0x54, 0x42, 0x9e, 0x0c, 0x37,
+        0xf5, 0x8e, 0x37, 0x7d, 0x81, 0x16, 0x7e, 0x9e, 0xaa, 0x7b, 0x82, 0x73,
+        0xcb, 0x28, 0xf0, 0x1c, 0x88, 0x24, 0xae, 0xd9, 0x0e, 0xaa, 0x9c, 0x59,
+        0xa3, 0x7d, 0xa8, 0xfc, 0x6b, 0x71, 0x6d, 0xa7, 0x47, 0x83, 0x7a, 0x14,
+        0x93, 0x64, 0x44, 0xec, 0x03, 0xa6, 0x07, 0xb4, 0x9d, 0xd2, 0x85, 0x92,
+        0x16, 0x8e, 0x65, 0x2f, 0x55, 0x20, 0xca, 0x55, 0x1c, 0x9b, 0x87, 0x73,
+        0x38, 0x27, 0x9f, 0xa4, 0xe4, 0x62, 0x10, 0x87, 0x47, 0x84, 0x60, 0xcf,
+        0x5a, 0x66, 0x0d, 0x28, 0xaf, 0xb6, 0xcc, 0xfb, 0x71, 0x3b, 0x55, 0x62,
+        0xac, 0x48, 0x04, 0xc8, 0x42, 0xeb, 0xd5, 0x7a, 0x2c, 0xbc, 0x00, 0xfd,
+        0xd0, 0x75, 0x60, 0x2a, 0x09, 0x52, 0x3a, 0xa8, 0x57, 0xed, 0xce, 0x32,
+        0x28, 0x58, 0xd8, 0x03, 0xec, 0xa3, 0x48, 0x15, 0xff, 0x01, 0x8f, 0xfb,
+        0xda, 0xd5, 0x53, 0x48, 0xab, 0xe3, 0x4b, 0x44, 0x08, 0xcb, 0xde, 0x85,
+        0x6c, 0xda, 0x85, 0xf7, 0x90, 0x0b, 0x58, 0x48, 0xa0, 0x1b, 0xbf, 0xa6,
+        0xdf, 0x2d, 0x56, 0x7a, 0x34, 0x4a, 0x3f, 0xb8, 0x9c, 0xe9, 0x35, 0x7a,
+        0x19, 0x13, 0x62, 0xa8, 0x76, 0xf2, 0x77, 0x63, 0x57, 0xde, 0x31, 0x52,
+        0xe6, 0x0c, 0x05, 0xcb, 0xec, 0xe5, 0x52, 0x06, 0x7d, 0x23, 0x4f, 0x59,
+        0xcc, 0xbe, 0xf9, 0xae, 0x3e, 0x42, 0x52, 0x81, 0x38, 0xe1, 0x9f, 0xe1,
+        0x0c, 0xc5, 0xf3, 0x25, 0x4f, 0xbc, 0x69, 0x6e, 0x44, 0xb0, 0xc0, 0x58,
+        0x6b, 0x32, 0x73, 0x36, 0x00, 0x2a, 0xe8, 0xe8, 0x2f, 0xe9, 0x0a, 0x59,
+        0xc9, 0xc8, 0xf9, 0x0a, 0x56, 0xb1, 0x53, 0x00, 0xfb, 0x84, 0x3d, 0xbb,
+        0x1a, 0xbf, 0x8b, 0xb2, 0xf3, 0x41, 0xe9, 0xe7, 0xdb, 0xd3, 0x55, 0xb6,
+        0x0b, 0x06, 0x71, 0x97, 0x09, 0xba, 0xc5, 0x54, 0xd8, 0x5c, 0xea, 0x03,
+        0x00, 0xa3, 0x5f, 0xf4, 0xda, 0x98, 0x93, 0x04, 0x41, 0xbd, 0xfa, 0x31,
+        0x9a, 0x9c, 0x83, 0xf2, 0xad, 0x8f, 0x07, 0xb9, 0x0a, 0x3f
+    },
+    .commitments = {
+        { 0x80, 0x23, 0x61, 0x98, 0x92, 0x47, 0xb1, 0xb6, 0x2e, 0xd1, 0xce, 0xa5, 0x5a, 0xab, 0x89, 0xec, 0x29, 0x87, 0xf3, 0x05, 0x2f, 0x1d, 0x1a, 0x29, 0x84, 0x60, 0x9d, 0x1f, 0x1e, 0x80, 0xd6, 0x00 },
+        { 0xfa, 0xb8, 0xed, 0x98, 0x20, 0xb7, 0x9a, 0x0d, 0xe9, 0x96, 0xcd, 0x0e, 0x8f, 0x52, 0xb2, 0x4b, 0x02, 0xec, 0x89, 0x5f, 0x3f, 0xce, 0x56, 0xa4, 0x67, 0x79, 0xb5, 0x03, 0x09, 0x83, 0x5a, 0x23 },
+        { 0xd9, 0xfe, 0x9f, 0x36, 0x08, 0xa6, 0xc6, 0xff, 0x09, 0x93, 0x58, 0xa6, 0x94, 0xf6, 0xae, 0xce, 0x4d, 0xa0, 0xc5, 0x35, 0x62, 0x8a, 0x88, 0x82, 0x43, 0x52, 0x9c, 0xa9, 0xb1, 0xf7, 0xa8, 0x10 },
+        { 0x1f, 0x01, 0xf1, 0xf8, 0xf4, 0xb5, 0x64, 0xd8, 0xb0, 0xff, 0xd3, 0x2a, 0xff, 0x11, 0x24, 0x3d, 0xee, 0x25, 0x82, 0xb4, 0xa3, 0xef, 0xbb, 0xce, 0xc9, 0x20, 0x02, 0x6c, 0x5e, 0x1f, 0x44, 0x1e },
+        { 0xa0, 0x65, 0x87, 0xcc, 0xc0, 0x3f, 0x14, 0x92, 0x94, 0x65, 0xcd, 0x3d, 0x93, 0x37, 0x90, 0xda, 0xb1, 0x23, 0xae, 0x4e, 0x57, 0x55, 0x8a, 0x7a, 0xf4, 0xfc, 0x06, 0x1e, 0x6b, 0x46, 0x7f, 0x1c },
+    },
+    .anchor = {
+        0x15, 0x61, 0x18, 0xf7, 0xa5, 0xd8, 0xbb, 0x90, 0xb5, 0xf2, 0xd3, 0x3a,
+        0x71, 0xb5, 0x15, 0xb7, 0xf4, 0xbe, 0x7a, 0x98, 0xb0, 0xff, 0x4e, 0xc4,
+        0x3a, 0x16, 0x70, 0x03, 0xb0, 0x72, 0xe4, 0x34
+    }
+}};
+
+#endif // ZCASH_TEST_DATA_MERKLE_ROOTS_ORCHARD_H
diff --git a/depend/zcash/src/test/data/merkle_roots_sapling.json b/depend/zcash/src/test/data/merkle_roots_sapling.json
new file mode 100644
index 000000000..27ed76f42
--- /dev/null
+++ b/depend/zcash/src/test/data/merkle_roots_sapling.json
@@ -0,0 +1,18 @@
+[
+	"8c3daa300c9710bf24d2595536e7c80ff8d147faca726636d28e8683a0c27703",
+	"8611f17378eb55e8c3c3f0a5f002e2b0a7ca39442fc928322b8072d1079c213d",
+	"3db73b998d536be0e1c2ec124df8e0f383ae7b602968ff6a5276ca0695023c46",
+	"7ac2e6442fec5970e116dfa4f2ee606f395366cafb1fa7dfd6c3de3ce18c4363",
+	"6a8f11ab2a11c262e39ed4ea3825ae6c94739ccf94479cb69402c5722b034532",
+	"149595eed0b54a7e694cc8a68372525b9ae2c7b102514f527460db91eb690565",
+	"8c0432f1994a2381a7a4b5fda770336011f9e0b30784f9a5597901619c797045",
+	"e780c48d70420601f3313ff8488d7766b70c059c53aa3cda2ff1ef57ff62383c",
+	"f919f03caaed8a2c60f58c0d43838f83e670dc7e8ccd25daa04a13f3e8f45541",
+	"74f32b36629724038e71cbd6823b5a666440205a7d1a9242e95870b53d81f34a",
+	"a4af205a4e1ee02102866b23a68930ac33efda9235832f49b17fcc4939be4525",
+	"a946a42f1636045a16e65b2308e036d9da70089686c87c692e45912bd1cab772",
+	"a1db2dbac055364c1cb43cbeb49c7e2815bff855122602a2ad0fb981a91e0e39",
+	"16329b3ba4f0640f4d306532d9ea6ba0fbf0e70e44ed57d27b4277ed9cda6849",
+	"7b6523b2d9b23f72fec6234aa6a1f8fae3dba1c6a266023ea8b1826feba7a25c",
+	"5c0bea7e17bde5bee4eb795c2eec3d389a68da587b36dd687b134826ecc09308"
+]
diff --git a/depend/zcash/src/test/data/merkle_serialization.json b/depend/zcash/src/test/data/merkle_serialization.json
new file mode 100644
index 000000000..21f79388b
--- /dev/null
+++ b/depend/zcash/src/test/data/merkle_serialization.json
@@ -0,0 +1,18 @@
+[
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0000",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0168eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c94300",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0001019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f38618",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0192498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae401019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f38618",
+	"01ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430002000146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f",
+	"01ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430168c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc02000146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f",
+	"018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b1000201aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af20146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f",
+	"018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b10150c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d0201aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af20146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f",
+	"0170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965300030000016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a806",
+	"0170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965301d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf817030000016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a806",
+	"018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b000301fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a4100016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a806",
+	"018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b0104e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba30301fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a4100016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a806",
+	"01be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a091200030001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a806",
+	"01be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a0912011880967fc8226380a849c63532bba67990f7d0a10e9c90b848f58d634957c6e9030001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a806",
+	"01c465bb2893cba233351094f259396301c23d73a6cf6f92bc63428a43f0dd8f8e000301e97f16ad143359999c90a7d2a3e7daa94ad980842226d9323d3f4f0ab62460a701ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a806",
+	"01c465bb2893cba233351094f259396301c23d73a6cf6f92bc63428a43f0dd8f8e0184c834e7cb38d6f08d82f5cf4839b8920185174b11c7af771fd38dd02b206a200301e97f16ad143359999c90a7d2a3e7daa94ad980842226d9323d3f4f0ab62460a701ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a806"
+]
diff --git a/depend/zcash/src/test/data/merkle_serialization_sapling.json b/depend/zcash/src/test/data/merkle_serialization_sapling.json
new file mode 100644
index 000000000..854e8b9e3
--- /dev/null
+++ b/depend/zcash/src/test/data/merkle_serialization_sapling.json
@@ -0,0 +1,18 @@
+[
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f550000",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f5501225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b1145800",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c00010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e666",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0150421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a030010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e666",
+	"01aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc12000200011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f655186564",
+	"01aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc1201f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a020200011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f655186564",
+	"01bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e000201eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f655186564",
+	"01bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e01da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a5110201eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f655186564",
+	"013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744600030000010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d",
+	"013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744601c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f163008030000010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d",
+	"01f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c3702000301cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef3173200010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d",
+	"01f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c370201e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c6080301cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef3173200010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d",
+	"018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e82600030001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d",
+	"018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e8260122fab8bcdb88154dbf5877ad1e2d7f1b541bc8a5ec1b52266095381339c27c03030001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d",
+	"01f43e3aac61e5a753062d4d0508c26ceaf5e4c0c58ba3c956e104b5d2cf67c41c0003015991131c5c25911b35fcea2a8343e2dfd7a4d5b45493390e0cb184394d91c34901002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d",
+	"01f43e3aac61e5a753062d4d0508c26ceaf5e4c0c58ba3c956e104b5d2cf67c41c013a3661bc12b72646c94bc6c92796e81953985ee62d80a9ec3645a9a95740ac1503015991131c5c25911b35fcea2a8343e2dfd7a4d5b45493390e0cb184394d91c34901002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d"
+]
diff --git a/depend/zcash/src/test/data/merkle_witness_serialization.json b/depend/zcash/src/test/data/merkle_witness_serialization.json
new file mode 100644
index 000000000..779d4a468
--- /dev/null
+++ b/depend/zcash/src/test/data/merkle_witness_serialization.json
@@ -0,0 +1,138 @@
+[
+	"0000000162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba00",
+	"0000000262fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba68eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c94300",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba00000168eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c94300",
+	"0000000262fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba68eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430101836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0000",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba00000168eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430101836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0000",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0168eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c94300000101836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0000",
+	"0000000362fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba68eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae00",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba00000268eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae00",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0168eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430001a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae00",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0001019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386180192498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae400",
+	"0000000362fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba68eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae0101ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430000",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba00000268eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae0101ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430000",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0168eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430001a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae0101ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430000",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0001019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386180192498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae40101ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430000",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0192498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae401019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f38618000101ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430000",
+	"0000000362fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba68eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae0101ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430168c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc00",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba00000268eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae0101ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430168c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc00",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0168eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430001a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae0101ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430168c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc00",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0001019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386180192498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae40101ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430168c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc00",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0192498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae401019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f38618000101ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430168c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc00",
+	"01ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430002000146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f0168c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc00",
+	"0000000362fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba68eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae01018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b1000101aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af2",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba00000268eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae01018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b1000101aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af2",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0168eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430001a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae01018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b1000101aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af2",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0001019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386180192498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae401018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b1000101aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af2",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0192498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae401019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386180001018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b1000101aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af2",
+	"01ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430002000146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f0168c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc01018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b10000",
+	"01ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430168c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc02000146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f0001018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b10000",
+	"0000000462fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba68eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd00",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba00000368eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd00",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0168eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430002a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd00",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0001019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386180292498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae4112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd00",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0192498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae401019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f3861801112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd00",
+	"01ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430002000146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f0268c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad1047400",
+	"01ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430168c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc02000146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f01050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad1047400",
+	"018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b1000201aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af20146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f0150c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d00",
+	"0000000462fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba68eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd010170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b96530000",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba00000368eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd010170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b96530000",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0168eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430002a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd010170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b96530000",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0001019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386180292498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae4112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd010170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b96530000",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0192498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae401019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f3861801112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd010170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b96530000",
+	"01ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430002000146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f0268c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad10474010170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b96530000",
+	"01ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430168c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc02000146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f01050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad10474010170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b96530000",
+	"018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b1000201aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af20146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f0150c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d010170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b96530000",
+	"018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b10150c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d0201aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af20146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f00010170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b96530000",
+	"0000000462fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba68eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd010170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965301d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf81700",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba00000368eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd010170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965301d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf81700",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0168eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430002a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd010170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965301d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf81700",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0001019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386180292498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae4112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd010170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965301d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf81700",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0192498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae401019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f3861801112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd010170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965301d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf81700",
+	"01ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430002000146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f0268c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad10474010170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965301d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf81700",
+	"01ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430168c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc02000146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f01050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad10474010170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965301d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf81700",
+	"018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b1000201aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af20146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f0150c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d010170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965301d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf81700",
+	"018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b10150c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d0201aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af20146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f00010170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965301d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf81700",
+	"0170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965300030000016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80601d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf81700",
+	"0000000462fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba68eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd01018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b000101fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a41",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba00000368eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd01018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b000101fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a41",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0168eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430002a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd01018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b000101fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a41",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0001019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386180292498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae4112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd01018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b000101fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a41",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0192498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae401019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f3861801112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd01018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b000101fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a41",
+	"01ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430002000146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f0268c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad1047401018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b000101fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a41",
+	"01ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430168c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc02000146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f01050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad1047401018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b000101fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a41",
+	"018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b1000201aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af20146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f0150c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d01018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b000101fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a41",
+	"018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b10150c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d0201aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af20146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f0001018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b000101fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a41",
+	"0170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965300030000016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80601d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf81701018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b0000",
+	"0170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965301d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf817030000016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a8060001018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b0000",
+	"0000000462fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba68eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd01018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b0104e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba30101fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a41",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba00000368eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd01018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b0104e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba30101fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a41",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0168eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430002a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd01018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b0104e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba30101fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a41",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0001019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386180292498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae4112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd01018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b0104e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba30101fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a41",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0192498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae401019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f3861801112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd01018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b0104e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba30101fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a41",
+	"01ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430002000146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f0268c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad1047401018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b0104e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba30101fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a41",
+	"01ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430168c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc02000146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f01050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad1047401018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b0104e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba30101fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a41",
+	"018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b1000201aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af20146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f0150c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d01018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b0104e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba30101fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a41",
+	"018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b10150c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d0201aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af20146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f0001018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b0104e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba30101fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a41",
+	"0170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965300030000016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80602d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf817a1e12cd7bb8d53016cbf0729cfc1bead8759a9e97a7eb50a416a27ced07e755000",
+	"0170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965301d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf817030000016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80601a1e12cd7bb8d53016cbf0729cfc1bead8759a9e97a7eb50a416a27ced07e755000",
+	"018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b000301fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a4100016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a8060104e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba300",
+	"0000000462fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba68eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd0101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a091200020001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba00000368eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd0101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a091200020001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0168eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430002a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd0101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a091200020001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0001019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386180292498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae4112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd0101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a091200020001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0192498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae401019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f3861801112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd0101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a091200020001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"01ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430002000146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f0268c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad104740101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a091200020001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"01ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430168c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc02000146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f01050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad104740101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a091200020001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b1000201aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af20146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f0150c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d0101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a091200020001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b10150c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d0201aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af20146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f000101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a091200020001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"0170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965300030000016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80602d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf817a1e12cd7bb8d53016cbf0729cfc1bead8759a9e97a7eb50a416a27ced07e75500101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a09120000",
+	"0170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965301d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf817030000016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80601a1e12cd7bb8d53016cbf0729cfc1bead8759a9e97a7eb50a416a27ced07e75500101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a09120000",
+	"018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b000301fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a4100016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a8060104e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba30101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a09120000",
+	"018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b0104e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba30301fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a4100016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a806000101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a09120000",
+	"0000000462fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba68eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd0101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a0912011880967fc8226380a849c63532bba67990f7d0a10e9c90b848f58d634957c6e9020001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba00000368eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd0101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a0912011880967fc8226380a849c63532bba67990f7d0a10e9c90b848f58d634957c6e9020001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0168eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430002a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd0101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a0912011880967fc8226380a849c63532bba67990f7d0a10e9c90b848f58d634957c6e9020001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0001019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386180292498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae4112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd0101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a0912011880967fc8226380a849c63532bba67990f7d0a10e9c90b848f58d634957c6e9020001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0192498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae401019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f3861801112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd0101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a0912011880967fc8226380a849c63532bba67990f7d0a10e9c90b848f58d634957c6e9020001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"01ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430002000146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f0268c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad104740101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a0912011880967fc8226380a849c63532bba67990f7d0a10e9c90b848f58d634957c6e9020001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"01ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430168c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc02000146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f01050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad104740101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a0912011880967fc8226380a849c63532bba67990f7d0a10e9c90b848f58d634957c6e9020001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b1000201aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af20146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f0150c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d0101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a0912011880967fc8226380a849c63532bba67990f7d0a10e9c90b848f58d634957c6e9020001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b10150c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d0201aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af20146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f000101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a0912011880967fc8226380a849c63532bba67990f7d0a10e9c90b848f58d634957c6e9020001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"0170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965300030000016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80602d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf817a1e12cd7bb8d53016cbf0729cfc1bead8759a9e97a7eb50a416a27ced07e75500101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a0912011880967fc8226380a849c63532bba67990f7d0a10e9c90b848f58d634957c6e900",
+	"0170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965301d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf817030000016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80601a1e12cd7bb8d53016cbf0729cfc1bead8759a9e97a7eb50a416a27ced07e75500101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a0912011880967fc8226380a849c63532bba67990f7d0a10e9c90b848f58d634957c6e900",
+	"018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b000301fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a4100016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a8060104e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba30101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a0912011880967fc8226380a849c63532bba67990f7d0a10e9c90b848f58d634957c6e900",
+	"018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b0104e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba30301fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a4100016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a806000101be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a0912011880967fc8226380a849c63532bba67990f7d0a10e9c90b848f58d634957c6e900",
+	"01be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a091200030001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a806011880967fc8226380a849c63532bba67990f7d0a10e9c90b848f58d634957c6e900",
+	"0000000462fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba68eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd0101c465bb2893cba233351094f259396301c23d73a6cf6f92bc63428a43f0dd8f8e000201e97f16ad143359999c90a7d2a3e7daa94ad980842226d9323d3f4f0ab62460a701ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba00000368eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd0101c465bb2893cba233351094f259396301c23d73a6cf6f92bc63428a43f0dd8f8e000201e97f16ad143359999c90a7d2a3e7daa94ad980842226d9323d3f4f0ab62460a701ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0168eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430002a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd0101c465bb2893cba233351094f259396301c23d73a6cf6f92bc63428a43f0dd8f8e000201e97f16ad143359999c90a7d2a3e7daa94ad980842226d9323d3f4f0ab62460a701ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0001019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386180292498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae4112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd0101c465bb2893cba233351094f259396301c23d73a6cf6f92bc63428a43f0dd8f8e000201e97f16ad143359999c90a7d2a3e7daa94ad980842226d9323d3f4f0ab62460a701ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0192498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae401019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f3861801112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd0101c465bb2893cba233351094f259396301c23d73a6cf6f92bc63428a43f0dd8f8e000201e97f16ad143359999c90a7d2a3e7daa94ad980842226d9323d3f4f0ab62460a701ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"01ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430002000146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f0268c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad104740101c465bb2893cba233351094f259396301c23d73a6cf6f92bc63428a43f0dd8f8e000201e97f16ad143359999c90a7d2a3e7daa94ad980842226d9323d3f4f0ab62460a701ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"01ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430168c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc02000146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f01050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad104740101c465bb2893cba233351094f259396301c23d73a6cf6f92bc63428a43f0dd8f8e000201e97f16ad143359999c90a7d2a3e7daa94ad980842226d9323d3f4f0ab62460a701ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b1000201aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af20146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f0150c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d0101c465bb2893cba233351094f259396301c23d73a6cf6f92bc63428a43f0dd8f8e000201e97f16ad143359999c90a7d2a3e7daa94ad980842226d9323d3f4f0ab62460a701ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b10150c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d0201aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af20146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f000101c465bb2893cba233351094f259396301c23d73a6cf6f92bc63428a43f0dd8f8e000201e97f16ad143359999c90a7d2a3e7daa94ad980842226d9323d3f4f0ab62460a701ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625",
+	"0170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965300030000016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80602d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf817a1e12cd7bb8d53016cbf0729cfc1bead8759a9e97a7eb50a416a27ced07e75500101c465bb2893cba233351094f259396301c23d73a6cf6f92bc63428a43f0dd8f8e000101e97f16ad143359999c90a7d2a3e7daa94ad980842226d9323d3f4f0ab62460a7",
+	"0170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965301d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf817030000016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80601a1e12cd7bb8d53016cbf0729cfc1bead8759a9e97a7eb50a416a27ced07e75500101c465bb2893cba233351094f259396301c23d73a6cf6f92bc63428a43f0dd8f8e000101e97f16ad143359999c90a7d2a3e7daa94ad980842226d9323d3f4f0ab62460a7",
+	"018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b000301fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a4100016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a8060104e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba30101c465bb2893cba233351094f259396301c23d73a6cf6f92bc63428a43f0dd8f8e000101e97f16ad143359999c90a7d2a3e7daa94ad980842226d9323d3f4f0ab62460a7",
+	"018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b0104e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba30301fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a4100016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a806000101c465bb2893cba233351094f259396301c23d73a6cf6f92bc63428a43f0dd8f8e000101e97f16ad143359999c90a7d2a3e7daa94ad980842226d9323d3f4f0ab62460a7",
+	"01be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a091200030001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a806011880967fc8226380a849c63532bba67990f7d0a10e9c90b848f58d634957c6e90101c465bb2893cba233351094f259396301c23d73a6cf6f92bc63428a43f0dd8f8e0000",
+	"01be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a0912011880967fc8226380a849c63532bba67990f7d0a10e9c90b848f58d634957c6e9030001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a806000101c465bb2893cba233351094f259396301c23d73a6cf6f92bc63428a43f0dd8f8e0000",
+	"0000000562fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba68eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd458cab4492ce89c6b50161e0583c2115e7900db964a53b49e152828d6a3991af00",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba00000468eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c943a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd458cab4492ce89c6b50161e0583c2115e7900db964a53b49e152828d6a3991af00",
+	"0162fdad9bfbf17c38ea626a9c9b8af8a748e6b4367c8494caf0ca592999e8b6ba0168eb35bc5e1ddb80a761718e63a1ecf4d4977ae22cc19fa732b85515b2a4c9430003a6637c3308b7b8e6eabc3c9c3bd672b568d73c8de4cf14ca2a004ff20c86c7ae112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd458cab4492ce89c6b50161e0583c2115e7900db964a53b49e152828d6a3991af00",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0001019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f386180392498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae4112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd458cab4492ce89c6b50161e0583c2115e7900db964a53b49e152828d6a3991af00",
+	"01836045484077cf6390184ea7cd48b460e2d0f22b2293b69633bb152314a692fb0192498a8295ea36d593eaee7cb8b55be3a3e37b8185d3807693184054cd574ae401019f5b2b1e4bf7e7318d0a1f417ca6bca36077025b3d11e074b94cd55ce9f3861802112e79af601aaa3c0a48e6c37930ccad4b5a3340a373a14d7b79697e5ee730dd458cab4492ce89c6b50161e0583c2115e7900db964a53b49e152828d6a3991af00",
+	"01ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430002000146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f0368c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad10474458cab4492ce89c6b50161e0583c2115e7900db964a53b49e152828d6a3991af00",
+	"01ff7c360374a6508ae0904c782127ff5dce90918f3ee81cf92ef1b69afb8bf4430168c4d0f69d1f18b756c2ee875c14f1c6cd38682e715ded14bf7e3c1c5610e9fc02000146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f02050a753bb419723abb7f22486c2a7182e390f47927435bc2c2f7fda93ad10474458cab4492ce89c6b50161e0583c2115e7900db964a53b49e152828d6a3991af00",
+	"018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b1000201aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af20146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f0250c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d458cab4492ce89c6b50161e0583c2115e7900db964a53b49e152828d6a3991af00",
+	"018b16cd3ec44875e4856e30344c0b4a68a6f929a68be5117b225b80926301e7b10150c0b43061c39191c3ec529734328b7f9cafeb6fd162cc49a4495442d9499a2d0201aed51ae31f597f976bac0f62cd5e563203ead4b5202d6459c5d45466dd737af20146c2fe50e8c66a8b402bdf071f52c7f509f7a04597f31886b2823e288a936d9f01458cab4492ce89c6b50161e0583c2115e7900db964a53b49e152828d6a3991af00",
+	"0170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965300030000016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80603d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf817a1e12cd7bb8d53016cbf0729cfc1bead8759a9e97a7eb50a416a27ced07e7550305205dbbecab7b01ec2538467c2fe41f7845eb45487bcf2f7d7bd52207f644100",
+	"0170ffdd5fa0f3aea18bd4700f1ac2e2e03cf5d4b7b857e8dd93b862a8319b965301d81ef64a0063573d80cd32222d8d04debbe807345ad7af2e9edf0f44bdfaf817030000016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80602a1e12cd7bb8d53016cbf0729cfc1bead8759a9e97a7eb50a416a27ced07e7550305205dbbecab7b01ec2538467c2fe41f7845eb45487bcf2f7d7bd52207f644100",
+	"018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b000301fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a4100016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a8060204e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba3305205dbbecab7b01ec2538467c2fe41f7845eb45487bcf2f7d7bd52207f644100",
+	"018b92a4ec694271fe1b16cc0ea8a433bf19e78eb5ca733cc137f38e5ecb05789b0104e963ab731e4aaaaaf931c3c039ea8c9d7904163936e19a8929434da9adeba30301fe190d5e3beaf1084c1b1cb6621d262c0cd8cd16454ef0188441abf05d356a4100016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a80601305205dbbecab7b01ec2538467c2fe41f7845eb45487bcf2f7d7bd52207f644100",
+	"01be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a091200030001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a806021880967fc8226380a849c63532bba67990f7d0a10e9c90b848f58d634957c6e92f7a96ecc725694533a999db6786f6016bcfdca5c9353151837faf43d93c50ef00",
+	"01be3f6c181f162824191ecf1f78cae3ffb0ddfda671bb93277ce6ebc9201a0912011880967fc8226380a849c63532bba67990f7d0a10e9c90b848f58d634957c6e9030001ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a806012f7a96ecc725694533a999db6786f6016bcfdca5c9353151837faf43d93c50ef00",
+	"01c465bb2893cba233351094f259396301c23d73a6cf6f92bc63428a43f0dd8f8e000301e97f16ad143359999c90a7d2a3e7daa94ad980842226d9323d3f4f0ab62460a701ec4b1458a3cf805199803a1231e906ba095f969a5775ca4ac73348473e70f625016cbbfc183a1017859c6a088838ae487be84321274a039773a35b434b7610a8060184c834e7cb38d6f08d82f5cf4839b8920185174b11c7af771fd38dd02b206a2000"
+]
diff --git a/depend/zcash/src/test/data/merkle_witness_serialization_sapling.json b/depend/zcash/src/test/data/merkle_witness_serialization_sapling.json
new file mode 100644
index 000000000..aa5f5f5f1
--- /dev/null
+++ b/depend/zcash/src/test/data/merkle_witness_serialization_sapling.json
@@ -0,0 +1,138 @@
+[
+	"00000001b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f5500",
+	"00000002b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b1145800",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55000001225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b1145800",
+	"00000002b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b1145801017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0000",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55000001225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b1145801017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0000",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f5501225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458000001017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0000",
+	"00000003b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826400",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55000002225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826400",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f5501225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580001f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a826400",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c00010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6660150421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a03000",
+	"00000003b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a82640101aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc120000",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55000002225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a82640101aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc120000",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f5501225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580001f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a82640101aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc120000",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c00010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6660150421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a0300101aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc120000",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0150421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a030010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e666000101aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc120000",
+	"00000003b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a82640101aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc1201f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a0200",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55000002225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a82640101aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc1201f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a0200",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f5501225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580001f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a82640101aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc1201f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a0200",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c00010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6660150421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a0300101aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc1201f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a0200",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0150421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a030010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e666000101aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc1201f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a0200",
+	"01aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc12000200011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656401f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a0200",
+	"00000003b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a82640101bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e000101eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55000002225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a82640101bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e000101eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f5501225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580001f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a82640101bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e000101eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c00010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6660150421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a0300101bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e000101eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0150421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a030010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e666000101bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e000101eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724",
+	"01aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc12000200011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656401f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a020101bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e0000",
+	"01aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc1201f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a020200011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f655186564000101bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e0000",
+	"00000004b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2400",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55000003225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2400",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f5501225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580002f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2400",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c00010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6660250421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a030130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2400",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0150421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a030010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e66601130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2400",
+	"01aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc12000200011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656402f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a02d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c00",
+	"01aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc1201f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a020200011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656401d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c00",
+	"01bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e000201eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656401da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a51100",
+	"00000004b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2401013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f774460000",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55000003225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2401013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f774460000",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f5501225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580002f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2401013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f774460000",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c00010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6660250421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a030130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2401013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f774460000",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0150421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a030010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e66601130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2401013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f774460000",
+	"01aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc12000200011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656402f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a02d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c01013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f774460000",
+	"01aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc1201f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a020200011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656401d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c01013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f774460000",
+	"01bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e000201eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656401da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a51101013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f774460000",
+	"01bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e01da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a5110201eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f6551865640001013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f774460000",
+	"00000004b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2401013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744601c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f16300800",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55000003225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2401013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744601c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f16300800",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f5501225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580002f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2401013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744601c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f16300800",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c00010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6660250421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a030130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2401013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744601c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f16300800",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0150421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a030010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e66601130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2401013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744601c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f16300800",
+	"01aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc12000200011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656402f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a02d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c01013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744601c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f16300800",
+	"01aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc1201f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a020200011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656401d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c01013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744601c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f16300800",
+	"01bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e000201eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656401da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a51101013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744601c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f16300800",
+	"01bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e01da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a5110201eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f6551865640001013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744601c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f16300800",
+	"013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744600030000010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d01c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f16300800",
+	"00000004b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f240101f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c3702000101cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef31732",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55000003225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f240101f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c3702000101cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef31732",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f5501225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580002f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f240101f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c3702000101cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef31732",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c00010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6660250421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a030130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f240101f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c3702000101cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef31732",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0150421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a030010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e66601130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f240101f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c3702000101cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef31732",
+	"01aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc12000200011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656402f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a02d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c0101f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c3702000101cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef31732",
+	"01aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc1201f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a020200011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656401d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c0101f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c3702000101cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef31732",
+	"01bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e000201eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656401da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a5110101f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c3702000101cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef31732",
+	"01bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e01da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a5110201eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f655186564000101f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c3702000101cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef31732",
+	"013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744600030000010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d01c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f1630080101f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c37020000",
+	"013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744601c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f163008030000010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d000101f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c37020000",
+	"00000004b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f240101f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c370201e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c6080101cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef31732",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55000003225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f240101f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c370201e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c6080101cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef31732",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f5501225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580002f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f240101f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c370201e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c6080101cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef31732",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c00010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6660250421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a030130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f240101f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c370201e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c6080101cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef31732",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0150421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a030010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e66601130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f240101f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c370201e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c6080101cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef31732",
+	"01aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc12000200011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656402f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a02d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c0101f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c370201e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c6080101cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef31732",
+	"01aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc1201f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a020200011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656401d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c0101f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c370201e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c6080101cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef31732",
+	"01bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e000201eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656401da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a5110101f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c370201e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c6080101cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef31732",
+	"01bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e01da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a5110201eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f655186564000101f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c370201e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c6080101cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef31732",
+	"013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744600030000010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d02c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f163008635c0b1b8035705127dc3f672191b4958ad331f9134117e3ba7d721f712b614400",
+	"013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744601c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f163008030000010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d01635c0b1b8035705127dc3f672191b4958ad331f9134117e3ba7d721f712b614400",
+	"01f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c3702000301cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef3173200010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d01e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c60800",
+	"00000004b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2401018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e82600020001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55000003225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2401018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e82600020001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f5501225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580002f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2401018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e82600020001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c00010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6660250421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a030130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2401018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e82600020001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0150421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a030010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e66601130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2401018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e82600020001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"01aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc12000200011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656402f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a02d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c01018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e82600020001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"01aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc1201f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a020200011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656401d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c01018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e82600020001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"01bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e000201eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656401da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a51101018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e82600020001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"01bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e01da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a5110201eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f6551865640001018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e82600020001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744600030000010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d02c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f163008635c0b1b8035705127dc3f672191b4958ad331f9134117e3ba7d721f712b614401018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e8260000",
+	"013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744601c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f163008030000010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d01635c0b1b8035705127dc3f672191b4958ad331f9134117e3ba7d721f712b614401018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e8260000",
+	"01f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c3702000301cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef3173200010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d01e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c60801018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e8260000",
+	"01f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c370201e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c6080301cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef3173200010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d0001018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e8260000",
+	"00000004b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2401018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e8260122fab8bcdb88154dbf5877ad1e2d7f1b541bc8a5ec1b52266095381339c27c03020001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55000003225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2401018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e8260122fab8bcdb88154dbf5877ad1e2d7f1b541bc8a5ec1b52266095381339c27c03020001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f5501225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580002f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2401018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e8260122fab8bcdb88154dbf5877ad1e2d7f1b541bc8a5ec1b52266095381339c27c03020001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c00010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6660250421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a030130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2401018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e8260122fab8bcdb88154dbf5877ad1e2d7f1b541bc8a5ec1b52266095381339c27c03020001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0150421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a030010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e66601130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f2401018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e8260122fab8bcdb88154dbf5877ad1e2d7f1b541bc8a5ec1b52266095381339c27c03020001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"01aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc12000200011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656402f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a02d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c01018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e8260122fab8bcdb88154dbf5877ad1e2d7f1b541bc8a5ec1b52266095381339c27c03020001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"01aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc1201f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a020200011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656401d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c01018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e8260122fab8bcdb88154dbf5877ad1e2d7f1b541bc8a5ec1b52266095381339c27c03020001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"01bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e000201eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656401da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a51101018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e8260122fab8bcdb88154dbf5877ad1e2d7f1b541bc8a5ec1b52266095381339c27c03020001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"01bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e01da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a5110201eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f6551865640001018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e8260122fab8bcdb88154dbf5877ad1e2d7f1b541bc8a5ec1b52266095381339c27c03020001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744600030000010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d02c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f163008635c0b1b8035705127dc3f672191b4958ad331f9134117e3ba7d721f712b614401018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e8260122fab8bcdb88154dbf5877ad1e2d7f1b541bc8a5ec1b52266095381339c27c0300",
+	"013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744601c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f163008030000010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d01635c0b1b8035705127dc3f672191b4958ad331f9134117e3ba7d721f712b614401018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e8260122fab8bcdb88154dbf5877ad1e2d7f1b541bc8a5ec1b52266095381339c27c0300",
+	"01f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c3702000301cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef3173200010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d01e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c60801018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e8260122fab8bcdb88154dbf5877ad1e2d7f1b541bc8a5ec1b52266095381339c27c0300",
+	"01f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c370201e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c6080301cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef3173200010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d0001018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e8260122fab8bcdb88154dbf5877ad1e2d7f1b541bc8a5ec1b52266095381339c27c0300",
+	"018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e82600030001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d0122fab8bcdb88154dbf5877ad1e2d7f1b541bc8a5ec1b52266095381339c27c0300",
+	"00000004b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f240101f43e3aac61e5a753062d4d0508c26ceaf5e4c0c58ba3c956e104b5d2cf67c41c0002015991131c5c25911b35fcea2a8343e2dfd7a4d5b45493390e0cb184394d91c34901002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55000003225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f240101f43e3aac61e5a753062d4d0508c26ceaf5e4c0c58ba3c956e104b5d2cf67c41c0002015991131c5c25911b35fcea2a8343e2dfd7a4d5b45493390e0cb184394d91c34901002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f5501225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580002f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f240101f43e3aac61e5a753062d4d0508c26ceaf5e4c0c58ba3c956e104b5d2cf67c41c0002015991131c5c25911b35fcea2a8343e2dfd7a4d5b45493390e0cb184394d91c34901002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c00010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6660250421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a030130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f240101f43e3aac61e5a753062d4d0508c26ceaf5e4c0c58ba3c956e104b5d2cf67c41c0002015991131c5c25911b35fcea2a8343e2dfd7a4d5b45493390e0cb184394d91c34901002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0150421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a030010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e66601130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f240101f43e3aac61e5a753062d4d0508c26ceaf5e4c0c58ba3c956e104b5d2cf67c41c0002015991131c5c25911b35fcea2a8343e2dfd7a4d5b45493390e0cb184394d91c34901002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"01aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc12000200011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656402f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a02d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c0101f43e3aac61e5a753062d4d0508c26ceaf5e4c0c58ba3c956e104b5d2cf67c41c0002015991131c5c25911b35fcea2a8343e2dfd7a4d5b45493390e0cb184394d91c34901002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"01aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc1201f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a020200011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656401d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c0101f43e3aac61e5a753062d4d0508c26ceaf5e4c0c58ba3c956e104b5d2cf67c41c0002015991131c5c25911b35fcea2a8343e2dfd7a4d5b45493390e0cb184394d91c34901002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"01bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e000201eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656401da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a5110101f43e3aac61e5a753062d4d0508c26ceaf5e4c0c58ba3c956e104b5d2cf67c41c0002015991131c5c25911b35fcea2a8343e2dfd7a4d5b45493390e0cb184394d91c34901002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"01bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e01da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a5110201eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f655186564000101f43e3aac61e5a753062d4d0508c26ceaf5e4c0c58ba3c956e104b5d2cf67c41c0002015991131c5c25911b35fcea2a8343e2dfd7a4d5b45493390e0cb184394d91c34901002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c",
+	"013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744600030000010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d02c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f163008635c0b1b8035705127dc3f672191b4958ad331f9134117e3ba7d721f712b61440101f43e3aac61e5a753062d4d0508c26ceaf5e4c0c58ba3c956e104b5d2cf67c41c0001015991131c5c25911b35fcea2a8343e2dfd7a4d5b45493390e0cb184394d91c349",
+	"013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744601c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f163008030000010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d01635c0b1b8035705127dc3f672191b4958ad331f9134117e3ba7d721f712b61440101f43e3aac61e5a753062d4d0508c26ceaf5e4c0c58ba3c956e104b5d2cf67c41c0001015991131c5c25911b35fcea2a8343e2dfd7a4d5b45493390e0cb184394d91c349",
+	"01f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c3702000301cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef3173200010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d01e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c6080101f43e3aac61e5a753062d4d0508c26ceaf5e4c0c58ba3c956e104b5d2cf67c41c0001015991131c5c25911b35fcea2a8343e2dfd7a4d5b45493390e0cb184394d91c349",
+	"01f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c370201e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c6080301cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef3173200010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d000101f43e3aac61e5a753062d4d0508c26ceaf5e4c0c58ba3c956e104b5d2cf67c41c0001015991131c5c25911b35fcea2a8343e2dfd7a4d5b45493390e0cb184394d91c349",
+	"018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e82600030001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d0122fab8bcdb88154dbf5877ad1e2d7f1b541bc8a5ec1b52266095381339c27c030101f43e3aac61e5a753062d4d0508c26ceaf5e4c0c58ba3c956e104b5d2cf67c41c0000",
+	"018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e8260122fab8bcdb88154dbf5877ad1e2d7f1b541bc8a5ec1b52266095381339c27c03030001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d000101f43e3aac61e5a753062d4d0508c26ceaf5e4c0c58ba3c956e104b5d2cf67c41c0000",
+	"00000005b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f241d73ff8e39cff60ff0d6402cc752a3351f1b434dccfa1941da3b1e422b73a33c00",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f55000004225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b11458f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f241d73ff8e39cff60ff0d6402cc752a3351f1b434dccfa1941da3b1e422b73a33c00",
+	"01b02310f2e087e55bfd07ef5e242e3b87ee5d00c9ab52f61e6bd42542f93a6f5501225747f3b5d5dab4e5a424f81f85c904ff43286e0f3fd07ef0b8c6a627b114580003f2c6ff34520c4ed63159b5ad4e99712fe64e3b4add73c66218e9797ac15a8264130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f241d73ff8e39cff60ff0d6402cc752a3351f1b434dccfa1941da3b1e422b73a33c00",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c00010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e6660350421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a030130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f241d73ff8e39cff60ff0d6402cc752a3351f1b434dccfa1941da3b1e422b73a33c00",
+	"017c3ea01a6e3a3d90cf59cd789e467044b5cd78eb2c84cc6816f960746d0e036c0150421d6c2c94571dfaaa135a4ff15bf916681ebd62c0e43e69e3b90684d0a030010162324ff2c329e99193a74d28a585a3c167a93bf41a255135529c913bd9b1e66602130adab3afe0931c42f058efb1381c2dce6cc768ad7964330146bf88b2b34f241d73ff8e39cff60ff0d6402cc752a3351f1b434dccfa1941da3b1e422b73a33c00",
+	"01aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc12000200011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656403f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a02d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c1d73ff8e39cff60ff0d6402cc752a3351f1b434dccfa1941da3b1e422b73a33c00",
+	"01aaec63863aaa0b2e3b8009429bdddd455e59be6f40ccab887a32eb98723efc1201f76748d40d5ee5f9a608512e7954dd515f86e8f6d009141c89163de1cf351a020200011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656402d0c26e22b78df58552b4fd61e8883a70f9011556b2e14b80ff23c591db7dbc4c1d73ff8e39cff60ff0d6402cc752a3351f1b434dccfa1941da3b1e422b73a33c00",
+	"01bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e000201eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f65518656402da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a5111d73ff8e39cff60ff0d6402cc752a3351f1b434dccfa1941da3b1e422b73a33c00",
+	"01bc8a5ec71647415c380203b681f7717366f3501661512225b6dc3e121efc0b2e01da1adda2ccde9381e11151686c121e7f52d19a990439161c7eb5a9f94be5a5110201eb97b35d826f55a65e23ea7febf38fadea8517312ca79346c129a277260fd724011fb189b02ad2f7c6b0d09bd5691c4896c28269da3d4ba768b1b446f655186564011d73ff8e39cff60ff0d6402cc752a3351f1b434dccfa1941da3b1e422b73a33c00",
+	"013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744600030000010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d03c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f163008635c0b1b8035705127dc3f672191b4958ad331f9134117e3ba7d721f712b6144076795f3651049c8895a7d127eb9bb4a17698da400430b33fdd06b1d8160394000",
+	"013a27fed5dbbc475d3880360e38638c882fd9b273b618fc433106896083f7744601c7ca8f7df8fd997931d33985d935ee2d696856cc09cc516d419ea6365f163008030000010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d02635c0b1b8035705127dc3f672191b4958ad331f9134117e3ba7d721f712b6144076795f3651049c8895a7d127eb9bb4a17698da400430b33fdd06b1d8160394000",
+	"01f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c3702000301cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef3173200010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d02e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c608076795f3651049c8895a7d127eb9bb4a17698da400430b33fdd06b1d8160394000",
+	"01f0fa37e8063b139d342246142fc48e7c0c50d0a62c97768589e06466742c370201e6d4d7685894d01b32f7e081ab188930be6c2b9f76d6847b7f382e3dddd7c6080301cca46d2249e0d79669b8ad2e8c3fc5e67a8501112aa4e572fe03a1868ef3173200010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d01076795f3651049c8895a7d127eb9bb4a17698da400430b33fdd06b1d8160394000",
+	"018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e82600030001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d0222fab8bcdb88154dbf5877ad1e2d7f1b541bc8a5ec1b52266095381339c27c03afa80a9a1bb8b6aad144cfb53e0bab004dd541c8b72025ae694bb60d6050a53200",
+	"018cebb73be883466d18d3b0c06990520e80b936440a2c9fd184d92a1f06c4e8260122fab8bcdb88154dbf5877ad1e2d7f1b541bc8a5ec1b52266095381339c27c03030001002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d01afa80a9a1bb8b6aad144cfb53e0bab004dd541c8b72025ae694bb60d6050a53200",
+	"01f43e3aac61e5a753062d4d0508c26ceaf5e4c0c58ba3c956e104b5d2cf67c41c0003015991131c5c25911b35fcea2a8343e2dfd7a4d5b45493390e0cb184394d91c34901002df68503da9247dfde6585cb8c9fa94897cf21735f8fc1b32116ef474de05c010d6b42350c11df4fcc17987c13d8492ba4e8b3f31eb9baff9be5d8890cfa512d013a3661bc12b72646c94bc6c92796e81953985ee62d80a9ec3645a9a95740ac1500"
+]
diff --git a/depend/zcash/src/test/data/sapling_key_components.json b/depend/zcash/src/test/data/sapling_key_components.json
new file mode 100644
index 000000000..417650b1e
--- /dev/null
+++ b/depend/zcash/src/test/data/sapling_key_components.json
@@ -0,0 +1,14 @@
+[
+    ["From https://github.com/zcash-hackworks/zcash-test-vectors/blob/master/sapling_key_components.py"],
+    ["sk, ask, nsk, ovk, ak, nk, ivk, default_d, default_pk_d, note_v, note_r, note_cm, note_pos, note_nf"],
+    ["0000000000000000000000000000000000000000000000000000000000000000", "06880e0df04583674f05d25dcf1119cf18f84420407823aa47a53e474aa14885", "056e5e74ac7e2d26018533275e42b081f53133ecb6eaeaf01cb60bdda04e1130", "3bd696b9e13851865ee47c1d03acb5034e224d6e4fa4ab7c17049bd91369d198", "2016f18efa0efd770776328095bad71f793a5d8c58c298303e27e10f38ec44f3", "bad63fbd78a919fb88fb25a7270e04302d067bac19153c388386e5f2779ecff7", "04924751145f0faa2d9d71a5549d563eb145e22e50a9add7dfcb03edd07c0bb7", "f19d9b797e39f337445839", "1574ae41e876d7e3149fc2d3265155a945c46765f131a18cebf7c4aab0d24cdb", 0, "0000000000000000000000061536ec550286898e778dcc0e98e4ac39ac6d1739", "396407ddf23e088f270608ce4fd4fec95018c0bcc2c614b97ed5703215f93ccb", 0, "6340ab472775d96762e77d00462360bf5e1d868fa2439ca19fecfd4f56d6fa44"],
+    ["0101010101010101010101010101010101010101010101010101010101010101", "04530aaf312c514fb79437acd728ba60ba187707ec35735ee5ff8bbf295643c9", "08cdda39d6e9955649c653b2f46f2335f3ddc80c090f1f8c005f7bd0eac2ac11", "5be4d6c9799a801b72367d3c72723bf0c88b4ac82a39d792161b6dce1062943b", "1805e38a2e5fa481f8964bff4719131902c10152d3f20b0284ae27c5ff5eff82", "d215746c8a88a84745f64dff956758eeccb30a74988b7f4acf18b98b844d53c4", "06a468fc40c21874d7052223d9d06b9d2d198d41679010b58869b266443818c5", "aef180f6e34e354b888f81", "8bd30f0622a909ba96a2a31e831092b3cfd3e9680e9ab07ba6b7dd36a33eb1a6", 12227227834928555328, "064e80dd899f863802968bdfed6b55ab15708bf1266f0300b6751a6eeea08b47", "5069d4ca72ae539ab2311ca3cf6b260ee1892f45ac018b2edf85fb0b509378b5", 763714296, "939d2e4c1763372e1dc7ad1954318883d759b21a2ab4cd83aee257a7c3b09e67"],
+    ["0202020202020202020202020202020202020202020202020202020202020202", "0317426a1ac16f06cb5cf861b7c1b747af1212d8d9f36a3d06780afe7e3d1cee", "0b7f11adab2e5e8ae4bf6b6e2150422ac6766e16fd38eae87548d75537713b1d", "498f1e499fd44f772268a7e596608eba840b81d581c302835bc9dd280e39f48b", "c664ca5dd168743a9ab1a0df74fcc3e8bec734ec9d62b80a9a85deb54e5783ab", "6ea0a84d9193abf4b69eaa3115ef24dec3aa8a92b7c09c164a2e59e05380d595", "0545954130ef3d209295d23ab96fbed17d2f3e5fa9c03650e73087dca3241c47", "7599f0bf9b57cd2dc299b6", "5a2f01087790d98dd8653c5c22c6444ded5eeeee188aef5df0284b5139171466", 6007711596147559040, "0aae3ba87d1d4a016c4da07c0adb11515b3e788b9eb977cb637c4c1bb5f27c14", "51f1554e9f8387aab001b1701766968240b7b7d532c37f16737f43980aa785db", 1527428592, "141dae598fb4f91c368494914d95c40811451fb931c7b3598049ff348f6a8fe9"],
+    ["0303030303030303030303030303030303030303030303030303030303030303", "039580bb94bceee503095c815cfcd3797851a70ce91eee80044e8fcae1a1c300", "0b72b0592e1cbd0655e087f2bd8aa5678cd9da43d5fcd27a155eb6e9a58562e6", "5efc2508bee63d1ad39fc24eb50222ccb4dac75b7c64479382973b55e0787614", "ea84e8963e75a66146b9a55531fa3c5d3f344ccfdbaa0f61a8380d5d7ede9c3c", "2a1c3c8d593bd806389092946ca278aacf05ee59f1d0cf61bd1d9408f5367db7", "0026c731f014fcac95920c4055ff06c4dd7991c9dff7fcb1e43cc2bf64a96a63", "1b81614f1dadea0f8d0a58", "5c5f9242f9df5b896531a8f7f0b12f83d7eae6ef88a5854ec61f76cffc55eb25", 18234939431076114368, "0428113e839dbdd588d7bb1fd2355eed5b1b90cf87eeef54eaf54f14a9b2a434", "6c9bd160aa5cd5b944160d2e2139885d10bd3743e3dbcc353bfba8b382e48ce0", 2291142888, "a147ec8b75ee3cb937079db583812cbd2a475686053b4e30b3a680ff12aa4755"],
+    ["0404040404040404040404040404040404040404040404040404040404040404", "0deac8d4051808a00c4daa490a7763657b823f341168a04355d805329dd13682", "07058a1d2a09d202af68d11d663d517441487c014ff4f072827182ed0befc17e", "edc45ffddcc8a71dec35d68595b3e4685675d49a0d41a5a6dbe8ace3ec756e1b", "1ae0dd58f034ad75017f6476689cff01de5f71a851fa0c13de417ebb8983e855", "3ce4d9e3951cb21ba030a7a9c02c8a761e6cde19eec5481ccd2150a1d64a5d72", "041d1ab04bf124b7dce09f70d3df6420d31fb40c7c313c2458467dc6f72bfa67", "fcfb68a40d4bc6a04b09c4", "2bdbb9149709bbd1c944de2fe92205f977696f544c1d38ff242c62037f332a8b", 12015423192295118080, "04bb57849c020cca67699c4d84c14e968059e8bd3c0159ac097c7455138557e5", "367f1bc72bfb264b042d630be7bf15671ecf8c23858b3b1f82007b3ebf54c8bd", 3054857184, "133dbf0103270dd02bebb84e62a1732a38628fc4f2fa2bf2ca85efd4a3bd9a8a"],
+    ["0505050505050505050505050505050505050505050505050505050505050505", "0726c8df241fe308741eadf7898773cb4d626c07c0f1a86140054a764d88e6ea", "014629050bed13cda61b880038f4e8bf2ea3b5544a6e6e9b9f74412af410e6fb", "2a37282333bb777c6d6b6970f9553591408522abf90bb24c3186d7f0391fbcc6", "88c9a4b3904bc97bb4e7b9edfc0d0ef4fdc055b882579e334c86e314597682e6", "eeda4997210de059372a48154d8eace770a30014d924444b02673c62956b2582", "038e17a254562364f529fc79d241cc10a8fb911f80379f3ba77c30e4801d3fea", "eb519882ad1e5cc654cd59", "df8f9bd2159ed8f7a2516e96b5118a6486978f23ca102d537f20a8b5ccda276b", 5795906953514121792, "02c0946cf55cc8b24cd7c9435aef450fe9735fc6f45f8449540c6b600461f068", "4c5b1ade69017344906695efe1f2bcc5741df791df0f7abc00c111ac307d26e8", 3818571480, "e1a7c9b620bef20f58c53e7597e588e55ff2b2bf2d127a62eb77e9b99ed92a33"],
+    ["0606060606060606060606060606060606060606060606060606060606060606", "0d4c07289b73c4134bfa44f2bec2a9cea482fe8ac20c7566e5a708bcb416f8e8", "07d127825bc003881b729306fb8ce1724563b01a78486e44ed01287f135b6132", "06515f354d445097b64c75ccba2424f3a27c5e8cb0125e88ef73a848e8052cf6", "5eb9108f70a0e4f5df7d2d5f4d164bb211a22e5cf19cbee43e5d945107db27ff", "0f427ab0e3039cb132fae0d893f9964bc79ef057c407cacfa9f84e9d95853894", "05c2744f0855da03dc9e385c4b3558ba2cc11f312dc1e5c0336995434989c5b5", "bebb0fb46b8aaff89040f6", "8ccbc1711dcf773f04442580693c4923d271875b38328d28d5bd430b1fa01dd1", 18023134788442677120, "07218908d0baea24758b6f97033e9bfbc3745bcb0d1fc8c1e7fe52fd470bf949", "551e3a785bcbbc5bdba0c44ebff4f2e0b69010eac21ac06d4dacb02505a22b57", 287318480, "111ed507b4e661f986bbec8ffa4caf962399ae3487cf96b15749e04b0ecd74fc"],
+    ["0707070707070707070707070707070707070707070707070707070707070707", "062c873f494455ddf0ed2c7beb8fdd1243f6a3ae1d7e4260c02350f1374ab474", "0bd66e3c3c4568f4c6f4546a4af1d1dd0d73ab34eeec234275251b8bdb355c07", "73e3bb3246f6782a3dde12734b41eaa688fe945dda74bd64edda11d31edce0e9", "5ed251df8adfa656d36b676b470c55eeb34c631232e617cee6b3bca9af9a3f28", "d48903a87a390eb564e6326c861793400a74667048e1c68d210a4b0db1674cdc", "02845fb08bf6bbc2aaa8fc5a6da93401c9806cd09d05bbe18336e18028c81687", "ad6e2e185a3100e3a6a8b3", "a98d05fbb04c7f6e945624c12c1328f7c8c4728f894a0d8b36f182b80628cb32", 11803618549661680832, "0c4af942b12db1ea7b0af2eb1bed2f43d6c31c171f1dd8b456edd42df2af6551", "232b8cf73659a83f2275cdadb72bf806a06085672798f571e6cd3c8766c57fab", 1051032776, "9098b68bcc12d2b383655b7c26e58a7c3e5d0f02537085ce2b804a85bd87e8d2"],
+    ["0808080808080808080808080808080808080808080808080808080808080808", "0d7b5acacc671e3c3a900bf3849487ac42cd190223feb3ba8fff11f33dd99d03", "08bbff70afbdaaea532acbed96aa4e07dd43a473b6e3d7fab9756c484fa19f04", "04b53a065818e202ab7f917eee1b48d0a5b9620c19d66f63b1a1eb771dd17d14", "d221aa88c4481448088e22ebd97b7c6c1612900abae7b75e20cae8dbee484036", "df0b5c233493e8e3681d2a68c317b4b00d48962a4351380d0738dfe71caf60ed", "01e060f1f14a9b13d2d2205b1a4bc3ec501d05f71c7d780f354e4b4fb8b4c999", "21c90e1c658b3efe86af58", "ef2cfd620ed21c04280806f8ed4f6da4455947125e3b325c4081b94a4b17649e", 5584102310880684544, "0457313208a6ba646b4a4e32f369b1bc603479f25e023bd35463c89d44563e8c", "044dea8f0792fd885b9b2303085aa0c2362324b5b59b64bc56bd3e5d37a8487b", 1814747072, "20d67cb1be6b0d84f5a7a4fd71885b0787ed20045c369a64ee2b5bcc50172fa8"],
+    ["0909090909090909090909090909090909090909090909090909090909090909", "0c1ec964442f305882e9902e656ce1ff4afb1b1e018d9460883bba80a940bbeb", "00fdbb1e14637019ad9c98b7953e3a888bbf71cbe55eb90052210491191b4368", "6d129d1ecdea4f68a0068b73081a0d1a281a9eca444750cc6cad0eb3a7673457", "a80b2ec0f29b0564bf342b264fa2356c9d700bd7e7d7d5fb1153a3ec3e52c371", "52aaa269626a888f2b9c49d9a9fdde2543ad6c6f0fe88f35b769653b10004462", "00ed89ffd50297c2f3f96e2a3e0827d5ed381ac9eb2babb5413df9d98bea95db", "233c4ab886a55e3ba374c0", "da4f872b48f6156e31305a3887e47e5f25251a831c9336307b8d67c0e09e8eb6", 17811330145809239872, "0300c93fb93b7d9a0d992916db5f8a09a9fa0c88852eadf956a2193674edbb6e", "37eb1de4638bdacb2b8ecbbb0a550e9b4164cf77aa56deeff467cee8bea776d3", 2578461368, "e9c9930d71a37ca17773b815e296fb721972fee7738485580c673c3b87743665"]
+]
diff --git a/depend/zcash/src/test/data/script_invalid.json b/depend/zcash/src/test/data/script_invalid.json
new file mode 100644
index 000000000..7a50b8330
--- /dev/null
+++ b/depend/zcash/src/test/data/script_invalid.json
@@ -0,0 +1,772 @@
+[
+["Format is: [scriptSig, scriptPubKey, flags, ... comments]"],
+["It is evaluated as if there was a crediting coinbase transaction with two 0"],
+["pushes as scriptSig, and one output of 0 satoshi and given scriptPubKey,"],
+["followed by a spending transaction which spends this output as only input (and"],
+["correct prevout hash), using the given scriptSig. All nLockTimes are 0, all"],
+["nSequences are max."],
+
+["", "DEPTH", "P2SH,STRICTENC",   "Test the test: we should have an empty stack after scriptSig evaluation"],
+["  ", "DEPTH", "P2SH,STRICTENC", "and multiple spaces should not change that."],
+["   ", "DEPTH", "P2SH,STRICTENC"],
+["    ", "DEPTH", "P2SH,STRICTENC"],
+
+["", "", "P2SH,STRICTENC"],
+["", "NOP", "P2SH,STRICTENC"],
+["", "NOP DEPTH", "P2SH,STRICTENC"],
+["NOP", "", "P2SH,STRICTENC"],
+["NOP", "DEPTH", "P2SH,STRICTENC"],
+["NOP","NOP", "P2SH,STRICTENC"],
+["NOP","NOP DEPTH", "P2SH,STRICTENC"],
+
+["DEPTH", "", "P2SH,STRICTENC"],
+
+["0x4c01","0x01 NOP", "P2SH,STRICTENC", "PUSHDATA1 with not enough bytes"],
+["0x4d0200ff","0x01 NOP", "P2SH,STRICTENC", "PUSHDATA2 with not enough bytes"],
+["0x4e03000000ffff","0x01 NOP", "P2SH,STRICTENC", "PUSHDATA4 with not enough bytes"],
+
+["1", "IF 0x50 ENDIF 1", "P2SH,STRICTENC", "0x50 is reserved"],
+["0x52", "0x5f ADD 0x60 EQUAL", "P2SH,STRICTENC", "0x51 through 0x60 push 1 through 16 onto stack"],
+["0","NOP", "P2SH,STRICTENC"],
+["1", "IF VER ELSE 1 ENDIF", "P2SH,STRICTENC", "VER non-functional"],
+["0", "IF VERIF ELSE 1 ENDIF", "P2SH,STRICTENC", "VERIF illegal everywhere"],
+["0", "IF ELSE 1 ELSE VERIF ENDIF", "P2SH,STRICTENC", "VERIF illegal everywhere"],
+["0", "IF VERNOTIF ELSE 1 ENDIF", "P2SH,STRICTENC", "VERNOTIF illegal everywhere"],
+["0", "IF ELSE 1 ELSE VERNOTIF ENDIF", "P2SH,STRICTENC", "VERNOTIF illegal everywhere"],
+
+["1 IF", "1 ENDIF", "P2SH,STRICTENC", "IF/ENDIF can't span scriptSig/scriptPubKey"],
+["1 IF 0 ENDIF", "1 ENDIF", "P2SH,STRICTENC"],
+["1 ELSE 0 ENDIF", "1", "P2SH,STRICTENC"],
+["0 NOTIF", "123", "P2SH,STRICTENC"],
+
+["0", "DUP IF ENDIF", "P2SH,STRICTENC"],
+["0", "IF 1 ENDIF", "P2SH,STRICTENC"],
+["0", "DUP IF ELSE ENDIF", "P2SH,STRICTENC"],
+["0", "IF 1 ELSE ENDIF", "P2SH,STRICTENC"],
+["0", "NOTIF ELSE 1 ENDIF", "P2SH,STRICTENC"],
+
+["0 1", "IF IF 1 ELSE 0 ENDIF ENDIF", "P2SH,STRICTENC"],
+["0 0", "IF IF 1 ELSE 0 ENDIF ENDIF", "P2SH,STRICTENC"],
+["1 0", "IF IF 1 ELSE 0 ENDIF ELSE IF 0 ELSE 1 ENDIF ENDIF", "P2SH,STRICTENC"],
+["0 1", "IF IF 1 ELSE 0 ENDIF ELSE IF 0 ELSE 1 ENDIF ENDIF", "P2SH,STRICTENC"],
+
+["0 0", "NOTIF IF 1 ELSE 0 ENDIF ENDIF", "P2SH,STRICTENC"],
+["0 1", "NOTIF IF 1 ELSE 0 ENDIF ENDIF", "P2SH,STRICTENC"],
+["1 1", "NOTIF IF 1 ELSE 0 ENDIF ELSE IF 0 ELSE 1 ENDIF ENDIF", "P2SH,STRICTENC"],
+["0 0", "NOTIF IF 1 ELSE 0 ENDIF ELSE IF 0 ELSE 1 ENDIF ENDIF", "P2SH,STRICTENC"],
+
+["1", "IF RETURN ELSE ELSE 1 ENDIF", "P2SH,STRICTENC", "Multiple ELSEs"],
+["1", "IF 1 ELSE ELSE RETURN ENDIF", "P2SH,STRICTENC"],
+
+["1", "ENDIF", "P2SH,STRICTENC", "Malformed IF/ELSE/ENDIF sequence"],
+["1", "ELSE ENDIF", "P2SH,STRICTENC"],
+["1", "ENDIF ELSE", "P2SH,STRICTENC"],
+["1", "ENDIF ELSE IF", "P2SH,STRICTENC"],
+["1", "IF ELSE ENDIF ELSE", "P2SH,STRICTENC"],
+["1", "IF ELSE ENDIF ELSE ENDIF", "P2SH,STRICTENC"],
+["1", "IF ENDIF ENDIF", "P2SH,STRICTENC"],
+["1", "IF ELSE ELSE ENDIF ENDIF", "P2SH,STRICTENC"],
+
+["1", "RETURN", "P2SH,STRICTENC"],
+["1", "DUP IF RETURN ENDIF", "P2SH,STRICTENC"],
+
+["1", "RETURN 'data'", "P2SH,STRICTENC", "canonical prunable txout format"],
+["0 IF", "RETURN ENDIF 1", "P2SH,STRICTENC", "still prunable because IF/ENDIF can't span scriptSig/scriptPubKey"],
+
+["0", "VERIFY 1", "P2SH,STRICTENC"],
+["1", "VERIFY", "P2SH,STRICTENC"],
+["1", "VERIFY 0", "P2SH,STRICTENC"],
+
+["1 TOALTSTACK", "FROMALTSTACK 1", "P2SH,STRICTENC", "alt stack not shared between sig/pubkey"],
+
+["IFDUP", "DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["DROP", "DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["DUP", "DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["1", "DUP 1 ADD 2 EQUALVERIFY 0 EQUAL", "P2SH,STRICTENC"],
+["NOP", "NIP", "P2SH,STRICTENC"],
+["NOP", "1 NIP", "P2SH,STRICTENC"],
+["NOP", "1 0 NIP", "P2SH,STRICTENC"],
+["NOP", "OVER 1", "P2SH,STRICTENC"],
+["1", "OVER", "P2SH,STRICTENC"],
+["0 1", "OVER DEPTH 3 EQUALVERIFY", "P2SH,STRICTENC"],
+["19 20 21", "PICK 19 EQUALVERIFY DEPTH 2 EQUAL", "P2SH,STRICTENC"],
+["NOP", "0 PICK", "P2SH,STRICTENC"],
+["1", "-1 PICK", "P2SH,STRICTENC"],
+["19 20 21", "0 PICK 20 EQUALVERIFY DEPTH 3 EQUAL", "P2SH,STRICTENC"],
+["19 20 21", "1 PICK 21 EQUALVERIFY DEPTH 3 EQUAL", "P2SH,STRICTENC"],
+["19 20 21", "2 PICK 22 EQUALVERIFY DEPTH 3 EQUAL", "P2SH,STRICTENC"],
+["NOP", "0 ROLL", "P2SH,STRICTENC"],
+["1", "-1 ROLL", "P2SH,STRICTENC"],
+["19 20 21", "0 ROLL 20 EQUALVERIFY DEPTH 2 EQUAL", "P2SH,STRICTENC"],
+["19 20 21", "1 ROLL 21 EQUALVERIFY DEPTH 2 EQUAL", "P2SH,STRICTENC"],
+["19 20 21", "2 ROLL 22 EQUALVERIFY DEPTH 2 EQUAL", "P2SH,STRICTENC"],
+["NOP", "ROT 1", "P2SH,STRICTENC"],
+["NOP", "1 ROT 1", "P2SH,STRICTENC"],
+["NOP", "1 2 ROT 1", "P2SH,STRICTENC"],
+["NOP", "0 1 2 ROT", "P2SH,STRICTENC"],
+["NOP", "SWAP 1", "P2SH,STRICTENC"],
+["1", "SWAP 1", "P2SH,STRICTENC"],
+["0 1", "SWAP 1 EQUALVERIFY", "P2SH,STRICTENC"],
+["NOP", "TUCK 1", "P2SH,STRICTENC"],
+["1", "TUCK 1", "P2SH,STRICTENC"],
+["1 0", "TUCK DEPTH 3 EQUALVERIFY SWAP 2DROP", "P2SH,STRICTENC"],
+["NOP", "2DUP 1", "P2SH,STRICTENC"],
+["1", "2DUP 1", "P2SH,STRICTENC"],
+["NOP", "3DUP 1", "P2SH,STRICTENC"],
+["1", "3DUP 1", "P2SH,STRICTENC"],
+["1 2", "3DUP 1", "P2SH,STRICTENC"],
+["NOP", "2OVER 1", "P2SH,STRICTENC"],
+["1", "2 3 2OVER 1", "P2SH,STRICTENC"],
+["NOP", "2SWAP 1", "P2SH,STRICTENC"],
+["1", "2 3 2SWAP 1", "P2SH,STRICTENC"],
+
+["'a' 'b'", "CAT", "P2SH,STRICTENC", "CAT disabled"],
+["'a' 'b' 0", "IF CAT ELSE 1 ENDIF", "P2SH,STRICTENC", "CAT disabled"],
+["'abc' 1 1", "SUBSTR", "P2SH,STRICTENC", "SUBSTR disabled"],
+["'abc' 1 1 0", "IF SUBSTR ELSE 1 ENDIF", "P2SH,STRICTENC", "SUBSTR disabled"],
+["'abc' 2 0", "IF LEFT ELSE 1 ENDIF", "P2SH,STRICTENC", "LEFT disabled"],
+["'abc' 2 0", "IF RIGHT ELSE 1 ENDIF", "P2SH,STRICTENC", "RIGHT disabled"],
+
+["NOP", "SIZE 1", "P2SH,STRICTENC"],
+
+["'abc'", "IF INVERT ELSE 1 ENDIF", "P2SH,STRICTENC", "INVERT disabled"],
+["1 2 0 IF AND ELSE 1 ENDIF", "NOP", "P2SH,STRICTENC", "AND disabled"],
+["1 2 0 IF OR ELSE 1 ENDIF", "NOP", "P2SH,STRICTENC", "OR disabled"],
+["1 2 0 IF XOR ELSE 1 ENDIF", "NOP", "P2SH,STRICTENC", "XOR disabled"],
+["2 0 IF 2MUL ELSE 1 ENDIF", "NOP", "P2SH,STRICTENC", "2MUL disabled"],
+["2 0 IF 2DIV ELSE 1 ENDIF", "NOP", "P2SH,STRICTENC", "2DIV disabled"],
+["2 2 0 IF MUL ELSE 1 ENDIF", "NOP", "P2SH,STRICTENC", "MUL disabled"],
+["2 2 0 IF DIV ELSE 1 ENDIF", "NOP", "P2SH,STRICTENC", "DIV disabled"],
+["2 2 0 IF MOD ELSE 1 ENDIF", "NOP", "P2SH,STRICTENC", "MOD disabled"],
+["2 2 0 IF LSHIFT ELSE 1 ENDIF", "NOP", "P2SH,STRICTENC", "LSHIFT disabled"],
+["2 2 0 IF RSHIFT ELSE 1 ENDIF", "NOP", "P2SH,STRICTENC", "RSHIFT disabled"],
+
+["", "EQUAL NOT", "P2SH,STRICTENC", "EQUAL must error when there are no stack items"],
+["0", "EQUAL NOT", "P2SH,STRICTENC", "EQUAL must error when there are not 2 stack items"],
+["0 1","EQUAL", "P2SH,STRICTENC"],
+["1 1 ADD", "0 EQUAL", "P2SH,STRICTENC"],
+["11 1 ADD 12 SUB", "11 EQUAL", "P2SH,STRICTENC"],
+
+["2147483648 0 ADD", "NOP", "P2SH,STRICTENC", "arithmetic operands must be in range [-2^31...2^31] "],
+["-2147483648 0 ADD", "NOP", "P2SH,STRICTENC", "arithmetic operands must be in range [-2^31...2^31] "],
+["2147483647 DUP ADD", "4294967294 NUMEQUAL", "P2SH,STRICTENC", "NUMEQUAL must be in numeric range"],
+["'abcdef' NOT", "0 EQUAL", "P2SH,STRICTENC", "NOT is an arithmetic operand"],
+
+["2 DUP MUL", "4 EQUAL", "P2SH,STRICTENC", "disabled"],
+["2 DUP DIV", "1 EQUAL", "P2SH,STRICTENC", "disabled"],
+["2 2MUL", "4 EQUAL", "P2SH,STRICTENC", "disabled"],
+["2 2DIV", "1 EQUAL", "P2SH,STRICTENC", "disabled"],
+["7 3 MOD", "1 EQUAL", "P2SH,STRICTENC", "disabled"],
+["2 2 LSHIFT", "8 EQUAL", "P2SH,STRICTENC", "disabled"],
+["2 1 RSHIFT", "1 EQUAL", "P2SH,STRICTENC", "disabled"],
+
+["1","NOP1 NOP2 NOP3 NOP4 NOP5 NOP6 NOP7 NOP8 NOP9 NOP10 2 EQUAL", "P2SH,STRICTENC"],
+["'NOP_1_to_10' NOP1 NOP2 NOP3 NOP4 NOP5 NOP6 NOP7 NOP8 NOP9 NOP10","'NOP_1_to_11' EQUAL", "P2SH,STRICTENC"],
+
+["Ensure 100% coverage of discouraged NOPS"],
+["1", "NOP1",  "P2SH,DISCOURAGE_UPGRADABLE_NOPS"],
+["1", "NOP2",  "P2SH,DISCOURAGE_UPGRADABLE_NOPS"],
+["1", "NOP3",  "P2SH,DISCOURAGE_UPGRADABLE_NOPS"],
+["1", "NOP4",  "P2SH,DISCOURAGE_UPGRADABLE_NOPS"],
+["1", "NOP5",  "P2SH,DISCOURAGE_UPGRADABLE_NOPS"],
+["1", "NOP6",  "P2SH,DISCOURAGE_UPGRADABLE_NOPS"],
+["1", "NOP7",  "P2SH,DISCOURAGE_UPGRADABLE_NOPS"],
+["1", "NOP8",  "P2SH,DISCOURAGE_UPGRADABLE_NOPS"],
+["1", "NOP9",  "P2SH,DISCOURAGE_UPGRADABLE_NOPS"],
+["1", "NOP10", "P2SH,DISCOURAGE_UPGRADABLE_NOPS"],
+
+["NOP10", "1", "P2SH,DISCOURAGE_UPGRADABLE_NOPS", "Discouraged NOP10 in scriptSig"],
+
+["1 0x01 0xb9", "HASH160 0x14 0x15727299b05b45fdaf9ac9ecf7565cfe27c3e567 EQUAL",
+ "P2SH,DISCOURAGE_UPGRADABLE_NOPS", "Discouraged NOP10 in redeemScript"],
+
+["0x50","1", "P2SH,STRICTENC", "opcode 0x50 is reserved"],
+["1", "IF 0xba ELSE 1 ENDIF", "P2SH,STRICTENC", "opcodes above NOP10 invalid if executed"],
+["1", "IF 0xbb ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xbc ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xbd ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xbe ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xbf ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xc0 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xc1 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xc2 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xc3 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xc4 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xc5 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xc6 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xc7 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xc8 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xc9 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xca ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xcb ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xcc ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xcd ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xce ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xcf ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xd0 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xd1 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xd2 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xd3 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xd4 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xd5 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xd6 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xd7 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xd8 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xd9 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xda ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xdb ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xdc ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xdd ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xde ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xdf ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xe0 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xe1 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xe2 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xe3 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xe4 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xe5 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xe6 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xe7 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xe8 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xe9 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xea ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xeb ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xec ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xed ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xee ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xef ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xf0 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xf1 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xf2 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xf3 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xf4 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xf5 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xf6 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xf7 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xf8 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xf9 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xfa ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xfb ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xfc ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xfd ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xfe ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 0xff ELSE 1 ENDIF", "P2SH,STRICTENC"],
+
+["1 IF 1 ELSE", "0xff ENDIF", "P2SH,STRICTENC", "invalid because scriptSig and scriptPubKey are processed separately"],
+
+["NOP", "RIPEMD160", "P2SH,STRICTENC"],
+["NOP", "SHA1", "P2SH,STRICTENC"],
+["NOP", "SHA256", "P2SH,STRICTENC"],
+["NOP", "HASH160", "P2SH,STRICTENC"],
+["NOP", "HASH256", "P2SH,STRICTENC"],
+
+["NOP",
+"'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb'",
+"P2SH,STRICTENC",
+">520 byte push"],
+["0",
+"IF 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' ENDIF 1",
+"P2SH,STRICTENC",
+">520 byte push in non-executed IF branch"],
+["1",
+"0x61616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161",
+"P2SH,STRICTENC",
+">201 opcodes executed. 0x61 is NOP"],
+["0",
+"IF 0x6161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161 ENDIF 1",
+"P2SH,STRICTENC",
+">201 opcodes including non-executed IF branch. 0x61 is NOP"],
+["1 2 3 4 5 0x6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f",
+"1 2 3 4 5 6 0x6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f",
+"P2SH,STRICTENC",
+">1,000 stack size (0x6f is 3DUP)"],
+["1 2 3 4 5 0x6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f",
+"1 TOALTSTACK 2 TOALTSTACK 3 4 5 6 0x6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f",
+"P2SH,STRICTENC",
+">1,000 stack+altstack size"],
+["NOP",
+"0 'aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 0x6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f 2DUP 0x616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161",
+"P2SH,STRICTENC",
+"10,001-byte scriptPubKey"],
+
+["NOP1","NOP10", "P2SH,STRICTENC"],
+
+["1","VER", "P2SH,STRICTENC", "OP_VER is reserved"],
+["1","VERIF", "P2SH,STRICTENC", "OP_VERIF is reserved"],
+["1","VERNOTIF", "P2SH,STRICTENC", "OP_VERNOTIF is reserved"],
+["1","RESERVED", "P2SH,STRICTENC", "OP_RESERVED is reserved"],
+["1","RESERVED1", "P2SH,STRICTENC", "OP_RESERVED1 is reserved"],
+["1","RESERVED2", "P2SH,STRICTENC", "OP_RESERVED2 is reserved"],
+["1","0xba", "P2SH,STRICTENC", "0xba == OP_NOP10 + 1"],
+
+["2147483648", "1ADD 1", "P2SH,STRICTENC", "We cannot do math on 5-byte integers"],
+["2147483648", "NEGATE 1", "P2SH,STRICTENC", "We cannot do math on 5-byte integers"],
+["-2147483648", "1ADD 1", "P2SH,STRICTENC", "Because we use a sign bit, -2147483648 is also 5 bytes"],
+["2147483647", "1ADD 1SUB 1", "P2SH,STRICTENC", "We cannot do math on 5-byte integers, even if the result is 4-bytes"],
+["2147483648", "1SUB 1", "P2SH,STRICTENC", "We cannot do math on 5-byte integers, even if the result is 4-bytes"],
+
+["2147483648 1", "BOOLOR 1", "P2SH,STRICTENC", "We cannot do BOOLOR on 5-byte integers (but we can still do IF etc)"],
+["2147483648 1", "BOOLAND 1", "P2SH,STRICTENC", "We cannot do BOOLAND on 5-byte integers"],
+
+["1", "1 ENDIF", "P2SH,STRICTENC", "ENDIF without IF"],
+["1", "IF 1", "P2SH,STRICTENC", "IF without ENDIF"],
+["1 IF 1", "ENDIF", "P2SH,STRICTENC", "IFs don't carry over"],
+
+["NOP", "IF 1 ENDIF", "P2SH,STRICTENC", "The following tests check the if(stack.size() < N) tests in each opcode"],
+["NOP", "NOTIF 1 ENDIF", "P2SH,STRICTENC", "They are here to catch copy-and-paste errors"],
+["NOP", "VERIFY 1", "P2SH,STRICTENC", "Most of them are duplicated elsewhere,"],
+
+["NOP", "TOALTSTACK 1", "P2SH,STRICTENC", "but, hey, more is always better, right?"],
+["1", "FROMALTSTACK", "P2SH,STRICTENC"],
+["1", "2DROP 1", "P2SH,STRICTENC"],
+["1", "2DUP", "P2SH,STRICTENC"],
+["1 1", "3DUP", "P2SH,STRICTENC"],
+["1 1 1", "2OVER", "P2SH,STRICTENC"],
+["1 1 1 1 1", "2ROT", "P2SH,STRICTENC"],
+["1 1 1", "2SWAP", "P2SH,STRICTENC"],
+["NOP", "IFDUP 1", "P2SH,STRICTENC"],
+["NOP", "DROP 1", "P2SH,STRICTENC"],
+["NOP", "DUP 1", "P2SH,STRICTENC"],
+["1", "NIP", "P2SH,STRICTENC"],
+["1", "OVER", "P2SH,STRICTENC"],
+["1 1 1 3", "PICK", "P2SH,STRICTENC"],
+["0", "PICK 1", "P2SH,STRICTENC"],
+["1 1 1 3", "ROLL", "P2SH,STRICTENC"],
+["0", "ROLL 1", "P2SH,STRICTENC"],
+["1 1", "ROT", "P2SH,STRICTENC"],
+["1", "SWAP", "P2SH,STRICTENC"],
+["1", "TUCK", "P2SH,STRICTENC"],
+
+["NOP", "SIZE 1", "P2SH,STRICTENC"],
+
+["1", "EQUAL 1", "P2SH,STRICTENC"],
+["1", "EQUALVERIFY 1", "P2SH,STRICTENC"],
+
+["NOP", "1ADD 1", "P2SH,STRICTENC"],
+["NOP", "1SUB 1", "P2SH,STRICTENC"],
+["NOP", "NEGATE 1", "P2SH,STRICTENC"],
+["NOP", "ABS 1", "P2SH,STRICTENC"],
+["NOP", "NOT 1", "P2SH,STRICTENC"],
+["NOP", "0NOTEQUAL 1", "P2SH,STRICTENC"],
+
+["1", "ADD", "P2SH,STRICTENC"],
+["1", "SUB", "P2SH,STRICTENC"],
+["1", "BOOLAND", "P2SH,STRICTENC"],
+["1", "BOOLOR", "P2SH,STRICTENC"],
+["1", "NUMEQUAL", "P2SH,STRICTENC"],
+["1", "NUMEQUALVERIFY 1", "P2SH,STRICTENC"],
+["1", "NUMNOTEQUAL", "P2SH,STRICTENC"],
+["1", "LESSTHAN", "P2SH,STRICTENC"],
+["1", "GREATERTHAN", "P2SH,STRICTENC"],
+["1", "LESSTHANOREQUAL", "P2SH,STRICTENC"],
+["1", "GREATERTHANOREQUAL", "P2SH,STRICTENC"],
+["1", "MIN", "P2SH,STRICTENC"],
+["1", "MAX", "P2SH,STRICTENC"],
+["1 1", "WITHIN", "P2SH,STRICTENC"],
+
+["NOP", "RIPEMD160 1", "P2SH,STRICTENC"],
+["NOP", "SHA1 1", "P2SH,STRICTENC"],
+["NOP", "SHA256 1", "P2SH,STRICTENC"],
+["NOP", "HASH160 1", "P2SH,STRICTENC"],
+["NOP", "HASH256 1", "P2SH,STRICTENC"],
+
+["Increase CHECKSIG and CHECKMULTISIG negative test coverage"],
+["", "CHECKSIG NOT", "STRICTENC", "CHECKSIG must error when there are no stack items"],
+["0", "CHECKSIG NOT", "STRICTENC", "CHECKSIG must error when there are not 2 stack items"],
+["", "CHECKMULTISIG NOT", "STRICTENC", "CHECKMULTISIG must error when there are no stack items"],
+["", "-1 CHECKMULTISIG NOT", "STRICTENC", "CHECKMULTISIG must error when the specified number of pubkeys is negative"],
+["", "1 CHECKMULTISIG NOT", "STRICTENC", "CHECKMULTISIG must error when there are not enough pubkeys on the stack"],
+["", "-1 0 CHECKMULTISIG NOT", "STRICTENC", "CHECKMULTISIG must error when the specified number of signatures is negative"],
+["", "1 'pk1' 1 CHECKMULTISIG NOT", "STRICTENC", "CHECKMULTISIG must error when there are not enough signatures on the stack"],
+["", "'dummy' 'sig1' 1 'pk1' 1 CHECKMULTISIG IF 1 ENDIF", "", "CHECKMULTISIG must push false to stack when signature is invalid when NOT in strict enc mode"],
+
+["",
+"0 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG",
+"P2SH,STRICTENC",
+"202 CHECKMULTISIGS, fails due to 201 op limit"],
+
+["1",
+"0 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY 0 0 CHECKMULTISIGVERIFY",
+"P2SH,STRICTENC"],
+
+["",
+"NOP NOP NOP NOP NOP NOP NOP NOP NOP NOP NOP NOP NOP 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIG 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIG 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIG 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIG 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIG 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIG 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIG 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIG 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIG",
+"P2SH,STRICTENC",
+"Fails due to 201 sig op limit"],
+
+["1",
+"NOP NOP NOP NOP NOP NOP NOP NOP NOP NOP NOP NOP NOP 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIGVERIFY 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIGVERIFY 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIGVERIFY 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIGVERIFY 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIGVERIFY 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIGVERIFY 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIGVERIFY 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIGVERIFY 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIGVERIFY",
+"P2SH,STRICTENC"],
+
+
+["0 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21", "21 CHECKMULTISIG 1", "P2SH,STRICTENC", "nPubKeys > 20"],
+["0 'sig' 1 0", "CHECKMULTISIG 1", "P2SH,STRICTENC", "nSigs > nPubKeys"],
+
+
+["NOP 0x01 1", "HASH160 0x14 0xda1745e9b549bd0bfa1a569971c77eba30cd5a4b EQUAL", "P2SH,STRICTENC", "Tests for Script.IsPushOnly()"],
+["NOP1 0x01 1", "HASH160 0x14 0xda1745e9b549bd0bfa1a569971c77eba30cd5a4b EQUAL", "P2SH,STRICTENC"],
+
+["0 0x01 0x50", "HASH160 0x14 0xece424a6bb6ddf4db592c0faed60685047a361b1 EQUAL", "P2SH,STRICTENC", "OP_RESERVED in P2SH should fail"],
+["0 0x01 VER", "HASH160 0x14 0x0f4d7845db968f2a81b530b6f3c1d6246d4c7e01 EQUAL", "P2SH,STRICTENC", "OP_VER in P2SH should fail"],
+
+["0x00", "'00' EQUAL", "P2SH,STRICTENC", "Basic OP_0 execution"],
+
+["MINIMALDATA enforcement for PUSHDATAs"],
+
+["0x4c 0x00", "DROP 1", "MINIMALDATA", "Empty vector minimally represented by OP_0"],
+["0x01 0x81", "DROP 1", "MINIMALDATA", "-1 minimally represented by OP_1NEGATE"],
+["0x01 0x01", "DROP 1", "MINIMALDATA", "1 to 16 minimally represented by OP_1 to OP_16"],
+["0x01 0x02", "DROP 1", "MINIMALDATA"],
+["0x01 0x03", "DROP 1", "MINIMALDATA"],
+["0x01 0x04", "DROP 1", "MINIMALDATA"],
+["0x01 0x05", "DROP 1", "MINIMALDATA"],
+["0x01 0x06", "DROP 1", "MINIMALDATA"],
+["0x01 0x07", "DROP 1", "MINIMALDATA"],
+["0x01 0x08", "DROP 1", "MINIMALDATA"],
+["0x01 0x09", "DROP 1", "MINIMALDATA"],
+["0x01 0x0a", "DROP 1", "MINIMALDATA"],
+["0x01 0x0b", "DROP 1", "MINIMALDATA"],
+["0x01 0x0c", "DROP 1", "MINIMALDATA"],
+["0x01 0x0d", "DROP 1", "MINIMALDATA"],
+["0x01 0x0e", "DROP 1", "MINIMALDATA"],
+["0x01 0x0f", "DROP 1", "MINIMALDATA"],
+["0x01 0x10", "DROP 1", "MINIMALDATA"],
+
+["0x4c 0x48 0x111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111", "DROP 1", "MINIMALDATA",
+ "PUSHDATA1 of 72 bytes minimally represented by direct push"],
+
+["0x4d 0xFF00 0x111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111", "DROP 1", "MINIMALDATA",
+ "PUSHDATA2 of 255 bytes minimally represented by PUSHDATA1"],
+
+["0x4e 0x00010000 0x11111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111", "DROP 1", "MINIMALDATA",
+ "PUSHDATA4 of 256 bytes minimally represented by PUSHDATA2"],
+
+
+["MINIMALDATA enforcement for numeric arguments"],
+
+["0x01 0x00", "NOT DROP 1", "MINIMALDATA", "numequals 0"],
+["0x02 0x0000", "NOT DROP 1", "MINIMALDATA", "numequals 0"],
+["0x01 0x80", "NOT DROP 1", "MINIMALDATA", "0x80 (negative zero) numequals 0"],
+["0x02 0x0080", "NOT DROP 1", "MINIMALDATA", "numequals 0"],
+["0x02 0x0500", "NOT DROP 1", "MINIMALDATA", "numequals 5"],
+["0x03 0x050000", "NOT DROP 1", "MINIMALDATA", "numequals 5"],
+["0x02 0x0580", "NOT DROP 1", "MINIMALDATA", "numequals -5"],
+["0x03 0x050080", "NOT DROP 1", "MINIMALDATA", "numequals -5"],
+["0x03 0xff7f80", "NOT DROP 1", "MINIMALDATA", "Minimal encoding is 0xffff"],
+["0x03 0xff7f00", "NOT DROP 1", "MINIMALDATA", "Minimal encoding is 0xff7f"],
+["0x04 0xffff7f80", "NOT DROP 1", "MINIMALDATA", "Minimal encoding is 0xffffff"],
+["0x04 0xffff7f00", "NOT DROP 1", "MINIMALDATA", "Minimal encoding is 0xffff7f"],
+
+["Test every numeric-accepting opcode for correct handling of the numeric minimal encoding rule"],
+
+["1 0x02 0x0000", "PICK DROP", "MINIMALDATA"],
+["1 0x02 0x0000", "ROLL DROP 1", "MINIMALDATA"],
+["0x02 0x0000", "1ADD DROP 1", "MINIMALDATA"],
+["0x02 0x0000", "1SUB DROP 1", "MINIMALDATA"],
+["0x02 0x0000", "NEGATE DROP 1", "MINIMALDATA"],
+["0x02 0x0000", "ABS DROP 1", "MINIMALDATA"],
+["0x02 0x0000", "NOT DROP 1", "MINIMALDATA"],
+["0x02 0x0000", "0NOTEQUAL DROP 1", "MINIMALDATA"],
+
+["0 0x02 0x0000", "ADD DROP 1", "MINIMALDATA"],
+["0x02 0x0000 0", "ADD DROP 1", "MINIMALDATA"],
+["0 0x02 0x0000", "SUB DROP 1", "MINIMALDATA"],
+["0x02 0x0000 0", "SUB DROP 1", "MINIMALDATA"],
+["0 0x02 0x0000", "BOOLAND DROP 1", "MINIMALDATA"],
+["0x02 0x0000 0", "BOOLAND DROP 1", "MINIMALDATA"],
+["0 0x02 0x0000", "BOOLOR DROP 1", "MINIMALDATA"],
+["0x02 0x0000 0", "BOOLOR DROP 1", "MINIMALDATA"],
+["0 0x02 0x0000", "NUMEQUAL DROP 1", "MINIMALDATA"],
+["0x02 0x0000 1", "NUMEQUAL DROP 1", "MINIMALDATA"],
+["0 0x02 0x0000", "NUMEQUALVERIFY 1", "MINIMALDATA"],
+["0x02 0x0000 0", "NUMEQUALVERIFY 1", "MINIMALDATA"],
+["0 0x02 0x0000", "NUMNOTEQUAL DROP 1", "MINIMALDATA"],
+["0x02 0x0000 0", "NUMNOTEQUAL DROP 1", "MINIMALDATA"],
+["0 0x02 0x0000", "LESSTHAN DROP 1", "MINIMALDATA"],
+["0x02 0x0000 0", "LESSTHAN DROP 1", "MINIMALDATA"],
+["0 0x02 0x0000", "GREATERTHAN DROP 1", "MINIMALDATA"],
+["0x02 0x0000 0", "GREATERTHAN DROP 1", "MINIMALDATA"],
+["0 0x02 0x0000", "LESSTHANOREQUAL DROP 1", "MINIMALDATA"],
+["0x02 0x0000 0", "LESSTHANOREQUAL DROP 1", "MINIMALDATA"],
+["0 0x02 0x0000", "GREATERTHANOREQUAL DROP 1", "MINIMALDATA"],
+["0x02 0x0000 0", "GREATERTHANOREQUAL DROP 1", "MINIMALDATA"],
+["0 0x02 0x0000", "MIN DROP 1", "MINIMALDATA"],
+["0x02 0x0000 0", "MIN DROP 1", "MINIMALDATA"],
+["0 0x02 0x0000", "MAX DROP 1", "MINIMALDATA"],
+["0x02 0x0000 0", "MAX DROP 1", "MINIMALDATA"],
+
+["0x02 0x0000 0 0", "WITHIN DROP 1", "MINIMALDATA"],
+["0 0x02 0x0000 0", "WITHIN DROP 1", "MINIMALDATA"],
+["0 0 0x02 0x0000", "WITHIN DROP 1", "MINIMALDATA"],
+
+["0 0 0x02 0x0000", "CHECKMULTISIG DROP 1", "MINIMALDATA"],
+["0 0x02 0x0000 0", "CHECKMULTISIG DROP 1", "MINIMALDATA"],
+["0 0x02 0x0000 0 1", "CHECKMULTISIG DROP 1", "MINIMALDATA"],
+["0 0 0x02 0x0000", "CHECKMULTISIGVERIFY 1", "MINIMALDATA"],
+["0 0x02 0x0000 0", "CHECKMULTISIGVERIFY 1", "MINIMALDATA"],
+
+
+["Order of CHECKMULTISIG evaluation tests, inverted by swapping the order of"],
+["pubkeys/signatures so they fail due to the STRICTENC rules on validly encoded"],
+["signatures and pubkeys."],
+[
+    "0 0x47 0x3044022044dc17b0887c161bb67ba9635bf758735bdde503e4b0a0987f587f14a4e1143d022009a215772d49a85dae40d8ca03955af26ad3978a0ff965faa12915e9586249a501 0x47 0x3044022044dc17b0887c161bb67ba9635bf758735bdde503e4b0a0987f587f14a4e1143d022009a215772d49a85dae40d8ca03955af26ad3978a0ff965faa12915e9586249a501",
+    "2 0x21 0x02865c40293a680cb9c020e7b1e106d8c1916d3cef99aa431a56d253e69256dac0 0 2 CHECKMULTISIG NOT",
+    "STRICTENC",
+    "2-of-2 CHECKMULTISIG NOT with the first pubkey invalid, and both signatures validly encoded."
+],
+[
+    "0 0x47 0x3044022044dc17b0887c161bb67ba9635bf758735bdde503e4b0a0987f587f14a4e1143d022009a215772d49a85dae40d8ca03955af26ad3978a0ff965faa12915e9586249a501 1",
+    "2 0x21 0x02865c40293a680cb9c020e7b1e106d8c1916d3cef99aa431a56d253e69256dac0 0x21 0x02865c40293a680cb9c020e7b1e106d8c1916d3cef99aa431a56d253e69256dac0 2 CHECKMULTISIG NOT",
+    "STRICTENC",
+    "2-of-2 CHECKMULTISIG NOT with both pubkeys valid, but first signature invalid."
+],
+
+["Increase DERSIG test coverage"],
+["0x4a 0x0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "0 CHECKSIG NOT", "", "Overly long signature is incorrectly encoded"],
+["0x25 0x30220220000000000000000000000000000000000000000000000000000000000000000000", "0 CHECKSIG NOT", "", "Missing S is incorrectly encoded"],
+["0x27 0x3024021077777777777777777777777777777777020a7777777777777777777777777777777701", "0 CHECKSIG NOT", "", "S with invalid S length is incorrectly encoded"],
+["0x27 0x302403107777777777777777777777777777777702107777777777777777777777777777777701", "0 CHECKSIG NOT", "", "Non-integer R is incorrectly encoded"],
+["0x27 0x302402107777777777777777777777777777777703107777777777777777777777777777777701", "0 CHECKSIG NOT", "", "Non-integer S is incorrectly encoded"],
+["0x17 0x3014020002107777777777777777777777777777777701", "0 CHECKSIG NOT", "", "Zero-length R is incorrectly encoded"],
+["0x17 0x3014021077777777777777777777777777777777020001", "0 CHECKSIG NOT", "", "Zero-length S is incorrectly encoded"],
+["0x27 0x302402107777777777777777777777777777777702108777777777777777777777777777777701", "0 CHECKSIG NOT", "", "Negative S is incorrectly encoded"],
+
+["Automatically generated test cases"],
+[
+    "0x47 0x304402200a5c6163f07b8c3b013c4d1d6dba25e780b39658d79ba37af7057a3b7f15ffa102201fd9b4eaa9943f734928b99a83592c2e7bf342ea2680f6a2bb705167966b742001",
+    "0x41 0x0479be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8 CHECKSIG",
+    "",
+    "P2PK, bad sig"
+],
+[
+    "0x47 0x3044022034bb0494b50b8ef130e2185bb220265b9284ef5b4b8a8da4d8415df489c83b5102206259a26d9cc0a125ac26af6153b17c02956855ebe1467412f066e402f5f05d1201 0x21 0x03363d90d446b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640",
+    "DUP HASH160 0x14 0xc0834c0c158f53be706d234c38fd52de7eece656 EQUALVERIFY CHECKSIG",
+    "",
+    "P2PKH, bad pubkey"
+],
+[
+    "0x47 0x304402204710a85181663b32d25c70ec2bbd14adff5ddfff6cb50d09e155ef5f541fc86c0220056b0cc949be9386ecc5f6c2ac0493269031dbb185781db90171b54ac127790201",
+    "0x41 0x048282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f5150811f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf CHECKSIG",
+    "",
+    "P2PK anyonecanpay marked with normal hashtype"
+],
+[
+    "0x47 0x3044022003fef42ed6c7be8917441218f525a60e2431be978e28b7aca4d7a532cc413ae8022067a1f82c74e8d69291b90d148778405c6257bbcfc2353cc38a3e1f22bf44254601 0x23 0x210279be667ef9dcbbac54a06295ce870b07029bfcdb2dce28d959f2815b16f81798ac",
+    "HASH160 0x14 0x23b0ad3477f2178bc0b3eed26e4e6316f4e83aa1 EQUAL",
+    "P2SH",
+    "P2SH(P2PK), bad redeemscript"
+],
+[
+    "0x47 0x304402204e2eb034be7b089534ac9e798cf6a2c79f38bcb34d1b179efd6f2de0841735db022071461beb056b5a7be1819da6a3e3ce3662831ecc298419ca101eb6887b5dd6a401 0x19 0x76a9147cf9c846cd4882efec4bf07e44ebdad495c94f4b88ac",
+    "HASH160 0x14 0x2df519943d5acc0ef5222091f9dfe3543f489a82 EQUAL",
+    "P2SH",
+    "P2SH(P2PKH), bad sig"
+],
+[
+    "0 0x47 0x3044022051254b9fb476a52d85530792b578f86fea70ec1ffb4393e661bcccb23d8d63d3022076505f94a403c86097841944e044c70c2045ce90e36de51f7e9d3828db98a07501 0x47 0x304402200a358f750934b3feb822f1966bfcd8bbec9eeaa3a8ca941e11ee5960e181fa01022050bf6b5a8e7750f70354ae041cb68a7bade67ec6c3ab19eb359638974410626e01 0",
+    "3 0x21 0x0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798 0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 0x21 0x03363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640 3 CHECKMULTISIG",
+    "",
+    "3-of-3, 2 sigs"
+],
+[
+    "0 0x47 0x304402205b7d2c2f177ae76cfbbf14d589c113b0b35db753d305d5562dd0b61cbf366cfb02202e56f93c4f08a27f986cd424ffc48a462c3202c4902104d4d0ff98ed28f4bf8001 0 0x4c69 0x52210279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f8179821038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f515082103363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff464053ae",
+    "HASH160 0x14 0xc9e4a896d149702d0d1695434feddd52e24ad78d EQUAL",
+    "P2SH",
+    "P2SH(2-of-3), 1 sig"
+],
+[
+    "0x47 0x304402200060558477337b9022e70534f1fea71a318caf836812465a2509931c5e7c4987022078ec32bd50ac9e03a349ba953dfd9fe1c8d2dd8bdb1d38ddca844d3d5c78c11801",
+    "0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 CHECKSIG",
+    "",
+    "P2PK with too much R padding"
+],
+[
+    "0x48 0x304502202de8c03fc525285c9c535631019a5f2af7c6454fa9eb392a3756a4917c420edd02210046130bf2baf7cfc065067c8b9e33a066d9c15edcea9feb0ca2d233e3597925b401",
+    "0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 CHECKSIG",
+    "",
+    "P2PK with too much S padding"
+],
+[
+    "0x47 0x30440220d7a0417c3f6d1a15094d1cf2a3378ca0503eb8a57630953a9e2987e21ddd0a6502207a6266d686c99090920249991d3d42065b6d43eb70187b219c0db82e4f94d1a201",
+    "0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 CHECKSIG",
+    "",
+    "P2PK with too little R padding"
+],
+[
+    "0x47 0x30440220005ece1335e7f757a1a1f476a7fb5bd90964e8a022489f890614a04acfb734c002206c12b8294a6513c7710e8c82d3c23d75cdbfe83200eb7efb495701958501a5d601",
+    "0x21 0x03363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640 CHECKSIG NOT",
+    "",
+    "P2PK NOT with bad sig with too much R padding"
+],
+[
+    "0x47 0x30440220005ece1335e7f657a1a1f476a7fb5bd90964e8a022489f890614a04acfb734c002206c12b8294a6513c7710e8c82d3c23d75cdbfe83200eb7efb495701958501a5d601",
+    "0x21 0x03363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640 CHECKSIG NOT",
+    "",
+    "P2PK NOT with too much R padding"
+],
+[
+    "0x47 0x30440220d7a0417c3f6d1a15094d1cf2a3378ca0503eb8a57630953a9e2987e21ddd0a6502207a6266d686c99090920249991d3d42065b6d43eb70187b219c0db82e4f94d1a201",
+    "0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 CHECKSIG",
+    "",
+    "BIP66 example 1"
+],
+[
+    "0x47 0x304402208e43c0b91f7c1e5bc58e41c8185f8a6086e111b0090187968a86f2822462d3c902200a58f4076b1133b18ff1dc83ee51676e44c60cc608d9534e0df5ace0424fc0be01",
+    "0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 CHECKSIG NOT",
+    "",
+    "BIP66 example 2"
+],
+[
+    "0",
+    "0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 CHECKSIG",
+    "",
+    "BIP66 example 3"
+],
+[
+    "1",
+    "0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 CHECKSIG",
+    "",
+    "BIP66 example 5"
+],
+[
+    "1",
+    "0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 CHECKSIG NOT",
+    "",
+    "BIP66 example 6"
+],
+[
+    "0 0x47 0x30440220cae00b1444babfbf6071b0ba8707f6bd373da3df494d6e74119b0430c5db810502205d5231b8c5939c8ff0c82242656d6e06edb073d42af336c99fe8837c36ea39d501 0x47 0x3044022027c2714269ca5aeecc4d70edc88ba5ee0e3da4986e9216028f489ab4f1b8efce022022bd545b4951215267e4c5ceabd4c5350331b2e4a0b6494c56f361fa5a57a1a201",
+    "2 0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 0x21 0x03363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640 2 CHECKMULTISIG",
+    "",
+    "BIP66 example 7"
+],
+[
+    "0 0x47 0x30440220b119d67d389315308d1745f734a51ff3ec72e06081e84e236fdf9dc2f5d2a64802204b04e3bc38674c4422ea317231d642b56dc09d214a1ecbbf16ecca01ed996e2201 0x47 0x3044022079ea80afd538d9ada421b5101febeb6bc874e01dde5bca108c1d0479aec339a4022004576db8f66130d1df686ccf00935703689d69cf539438da1edab208b0d63c4801",
+    "2 0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 0x21 0x03363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640 2 CHECKMULTISIG NOT",
+    "",
+    "BIP66 example 8"
+],
+[
+    "0 0 0x47 0x3044022081aa9d436f2154e8b6d600516db03d78de71df685b585a9807ead4210bd883490220534bb6bdf318a419ac0749660b60e78d17d515558ef369bf872eff405b676b2e01",
+    "2 0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 0x21 0x03363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640 2 CHECKMULTISIG",
+    "",
+    "BIP66 example 9"
+],
+[
+    "0 0 0x47 0x30440220da6f441dc3b4b2c84cfa8db0cd5b34ed92c9e01686de5a800d40498b70c0dcac02207c2cf91b0c32b860c4cd4994be36cfb84caf8bb7c3a8e4d96a31b2022c5299c501",
+    "2 0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 0x21 0x03363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640 2 CHECKMULTISIG NOT",
+    "",
+    "BIP66 example 10"
+],
+[
+    "0 0x47 0x30440220cae00b1444babfbf6071b0ba8707f6bd373da3df494d6e74119b0430c5db810502205d5231b8c5939c8ff0c82242656d6e06edb073d42af336c99fe8837c36ea39d501 0",
+    "2 0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 0x21 0x03363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640 2 CHECKMULTISIG",
+    "",
+    "BIP66 example 11"
+],
+[
+    "0x48 0x304402203e4516da7253cf068effec6b95c41221c0cf3a8e6ccb8cbf1725b562e9afde2c022054e1c258c2981cdfba5df1f46661fb6541c44f77ca0092f3600331abfffb12510101",
+    "0x21 0x03363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640 CHECKSIG",
+    "",
+    "P2PK with multi-byte hashtype"
+],
+[
+    "0x48 0x304502203e4516da7253cf068effec6b95c41221c0cf3a8e6ccb8cbf1725b562e9afde2c022100ab1e3da73d67e32045a20e0b999e049978ea8d6ee5480d485fcf2ce0d03b2ef001",
+    "0x21 0x03363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640 CHECKSIG",
+    "LOW_S",
+    "P2PK with high S"
+],
+[
+    "0x47 0x3044022057292e2d4dfe775becdd0a9e6547997c728cdf35390f6a017da56d654d374e4902206b643be2fc53763b4e284845bfea2c597d2dc7759941dce937636c9d341b71ed01",
+    "0x41 0x0679be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8 CHECKSIG",
+    "STRICTENC",
+    "P2PK with hybrid pubkey"
+],
+[
+    "0x47 0x30440220035d554e3153c14950c9993f41c496607a8e24093db0595be7bf875cf64fcf1f02204731c8c4e5daf15e706cec19cdd8f2c5b1d05490e11dab8465ed426569b6e92101",
+    "0x41 0x0679be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8 CHECKSIG NOT",
+    "",
+    "P2PK NOT with hybrid pubkey but no STRICTENC"
+],
+[
+    "0x47 0x30440220035d554e3153c14950c9993f41c496607a8e24093db0595be7bf875cf64fcf1f02204731c8c4e5daf15e706cec19cdd8f2c5b1d05490e11dab8465ed426569b6e92101",
+    "0x41 0x0679be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8 CHECKSIG NOT",
+    "STRICTENC",
+    "P2PK NOT with hybrid pubkey"
+],
+[
+    "0x47 0x30440220035d554e3153c04950c9993f41c496607a8e24093db0595be7bf875cf64fcf1f02204731c8c4e5daf15e706cec19cdd8f2c5b1d05490e11dab8465ed426569b6e92101",
+    "0x41 0x0679be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8 CHECKSIG NOT",
+    "STRICTENC",
+    "P2PK NOT with invalid hybrid pubkey"
+],
+[
+    "0 0x47 0x3044022079c7824d6c868e0e1a273484e28c2654a27d043c8a27f49f52cb72efed0759090220452bbbf7089574fa082095a4fc1b3a16bafcf97a3a34d745fafc922cce66b27201",
+    "1 0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 0x41 0x0679be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8 2 CHECKMULTISIG",
+    "STRICTENC",
+    "1-of-2 with the first 1 hybrid pubkey"
+],
+[
+    "0x47 0x304402206177d513ec2cda444c021a1f4f656fc4c72ba108ae063e157eb86dc3575784940220666fc66702815d0e5413bb9b1df22aed44f5f1efb8b99d41dd5dc9a5be6d205205",
+    "0x41 0x048282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f5150811f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf CHECKSIG",
+    "STRICTENC",
+    "P2PK with undefined hashtype"
+],
+[
+    "0x47 0x304402207409b5b320296e5e2136a7b281a7f803028ca4ca44e2b83eebd46932677725de02202d4eea1c8d3c98e6f42614f54764e6e5e6542e213eb4d079737e9a8b6e9812ec05",
+    "0x41 0x048282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f5150811f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf CHECKSIG NOT",
+    "STRICTENC",
+    "P2PK NOT with invalid sig and undefined hashtype"
+],
+[
+    "1 0x47 0x3044022051254b9fb476a52d85530792b578f86fea70ec1ffb4393e661bcccb23d8d63d3022076505f94a403c86097841944e044c70c2045ce90e36de51f7e9d3828db98a07501 0x47 0x304402200a358f750934b3feb822f1966bfcd8bbec9eeaa3a8ca941e11ee5960e181fa01022050bf6b5a8e7750f70354ae041cb68a7bade67ec6c3ab19eb359638974410626e01 0x47 0x304402200955d031fff71d8653221e85e36c3c85533d2312fc3045314b19650b7ae2f81002202a6bb8505e36201909d0921f01abff390ae6b7ff97bbf959f98aedeb0a56730901",
+    "3 0x21 0x0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798 0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 0x21 0x03363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640 3 CHECKMULTISIG",
+    "NULLDUMMY",
+    "3-of-3 with nonzero dummy"
+],
+[
+    "1 0x47 0x304402201bb2edab700a5d020236df174fefed78087697143731f659bea59642c759c16d022061f42cdbae5bcd3e8790f20bf76687443436e94a634321c16a72aa54cbc7c2ea01 0x47 0x304402204bb4a64f2a6e5c7fb2f07fef85ee56fde5e6da234c6a984262307a20e99842d702206f8303aaba5e625d223897e2ffd3f88ef1bcffef55f38dc3768e5f2e94c923f901 0x47 0x3044022040c2809b71fffb155ec8b82fe7a27f666bd97f941207be4e14ade85a1249dd4d02204d56c85ec525dd18e29a0533d5ddf61b6b1bb32980c2f63edf951aebf7a27bfe01",
+    "3 0x21 0x0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798 0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 0x21 0x03363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640 3 CHECKMULTISIG NOT",
+    "NULLDUMMY",
+    "3-of-3 NOT with invalid sig with nonzero dummy"
+],
+[
+    "0 0x47 0x304402200abeb4bd07f84222f474aed558cfbdfc0b4e96cde3c2935ba7098b1ff0bd74c302204a04c1ca67b2a20abee210cf9a21023edccbbf8024b988812634233115c6b73901 DUP",
+    "2 0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 2 CHECKMULTISIG",
+    "SIGPUSHONLY",
+    "2-of-2 with two identical keys and sigs pushed using OP_DUP"
+],
+[
+    "0x47 0x304402203e4516da7253cf068effec6b95c41221c0cf3a8e6ccb8cbf1725b562e9afde2c022054e1c258c2981cdfba5df1f46661fb6541c44f77ca0092f3600331abfffb125101 0x23 0x2103363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640ac",
+    "0x21 0x03363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640 CHECKSIG",
+    "",
+    "P2SH(P2PK) with non-push scriptSig but no SIGPUSHONLY"
+],
+[
+    "0x47 0x304402203e4516da7253cf068effec6b95c41221c0cf3a8e6ccb8cbf1725b562e9afde2c022054e1c258c2981cdfba5df1f46661fb6541c44f77ca0092f3600331abfffb125101 0x23 0x2103363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640ac",
+    "0x21 0x03363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640 CHECKSIG",
+    "SIGPUSHONLY",
+    "P2SH(P2PK) with non-push scriptSig"
+],
+[
+    "0 0x47 0x304402205451ce65ad844dbb978b8bdedf5082e33b43cae8279c30f2c74d9e9ee49a94f802203fe95a7ccf74da7a232ee523ef4a53cb4d14bdd16289680cdb97a63819b8f42f01 0x46 0x304402205451ce65ad844dbb978b8bdedf5082e33b43cae8279c30f2c74d9e9ee49a94f802203fe95a7ccf74da7a232ee523ef4a53cb4d14bdd16289680cdb97a63819b8f42f",
+    "2 0x21 0x02a673638cb9587cb68ea08dbef685c6f2d2a751a8b3c6f2a7e9a4999e6e4bfaf5 0x21 0x02a673638cb9587cb68ea08dbef685c6f2d2a751a8b3c6f2a7e9a4999e6e4bfaf5 0x21 0x02a673638cb9587cb68ea08dbef685c6f2d2a751a8b3c6f2a7e9a4999e6e4bfaf5 3 CHECKMULTISIG",
+    "P2SH,STRICTENC",
+    "2-of-3 with one valid and one invalid signature due to parse error, nSigs > validSigs"
+],
+[
+    "11 0x47 0x304402200a5c6163f07b8d3b013c4d1d6dba25e780b39658d79ba37af7057a3b7f15ffa102201fd9b4eaa9943f734928b99a83592c2e7bf342ea2680f6a2bb705167966b742001",
+    "0x41 0x0479be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8 CHECKSIG",
+    "CLEANSTACK,P2SH",
+    "P2PK with unnecessary input"
+],
+[
+    "11 0x47 0x304402202f7505132be14872581f35d74b759212d9da40482653f1ffa3116c3294a4a51702206adbf347a2240ca41c66522b1a22a41693610b76a8e7770645dc721d1635854f01 0x43 0x410479be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8ac",
+    "HASH160 0x14 0x31edc23bdafda4639e669f89ad6b2318dd79d032 EQUAL",
+    "CLEANSTACK,P2SH",
+    "P2SH with unnecessary input"
+],
+
+["The End"]
+]
diff --git a/depend/zcash/src/test/data/script_valid.json b/depend/zcash/src/test/data/script_valid.json
new file mode 100644
index 000000000..3ccc192e2
--- /dev/null
+++ b/depend/zcash/src/test/data/script_valid.json
@@ -0,0 +1,834 @@
+[
+["Format is: [scriptSig, scriptPubKey, flags, ... comments]"],
+["It is evaluated as if there was a crediting coinbase transaction with two 0"],
+["pushes as scriptSig, and one output of 0 satoshi and given scriptPubKey,"],
+["followed by a spending transaction which spends this output as only input (and"],
+["correct prevout hash), using the given scriptSig. All nLockTimes are 0, all"],
+["nSequences are max."],
+
+["", "DEPTH 0 EQUAL", "P2SH,STRICTENC", "Test the test: we should have an empty stack after scriptSig evaluation"],
+["  ", "DEPTH 0 EQUAL", "P2SH,STRICTENC", "and multiple spaces should not change that."],
+["   ", "DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["    ", "DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["1 2", "2 EQUALVERIFY 1 EQUAL", "P2SH,STRICTENC", "Similarly whitespace around and between symbols"],
+["1  2", "2 EQUALVERIFY 1 EQUAL", "P2SH,STRICTENC"],
+["  1  2", "2 EQUALVERIFY 1 EQUAL", "P2SH,STRICTENC"],
+["1  2  ", "2 EQUALVERIFY 1 EQUAL", "P2SH,STRICTENC"],
+["  1  2  ", "2 EQUALVERIFY 1 EQUAL", "P2SH,STRICTENC"],
+
+["1", "", "P2SH,STRICTENC"],
+["0x02 0x01 0x00", "", "P2SH,STRICTENC", "all bytes are significant, not only the last one"],
+["0x09 0x00000000 0x00000000 0x10", "", "P2SH,STRICTENC", "equals zero when cast to Int64"],
+
+["0x01 0x0b", "11 EQUAL", "P2SH,STRICTENC", "push 1 byte"],
+["0x02 0x417a", "'Az' EQUAL", "P2SH,STRICTENC"],
+["0x4b 0x417a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a7a",
+ "'Azzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz' EQUAL", "P2SH,STRICTENC", "push 75 bytes"],
+
+["0x4c 0x01 0x07","7 EQUAL", "P2SH,STRICTENC", "0x4c is OP_PUSHDATA1"],
+["0x4d 0x0100 0x08","8 EQUAL", "P2SH,STRICTENC", "0x4d is OP_PUSHDATA2"],
+["0x4e 0x01000000 0x09","9 EQUAL", "P2SH,STRICTENC", "0x4e is OP_PUSHDATA4"],
+
+["0x4c 0x00","0 EQUAL", "P2SH,STRICTENC"],
+["0x4d 0x0000","0 EQUAL", "P2SH,STRICTENC"],
+["0x4e 0x00000000","0 EQUAL", "P2SH,STRICTENC"],
+["0x4f 1000 ADD","999 EQUAL", "P2SH,STRICTENC"],
+["0", "IF 0x50 ENDIF 1", "P2SH,STRICTENC", "0x50 is reserved (ok if not executed)"],
+["0x51", "0x5f ADD 0x60 EQUAL", "P2SH,STRICTENC", "0x51 through 0x60 push 1 through 16 onto stack"],
+["1","NOP", "P2SH,STRICTENC"],
+["0", "IF VER ELSE 1 ENDIF", "P2SH,STRICTENC", "VER non-functional (ok if not executed)"],
+["0", "IF RESERVED RESERVED1 RESERVED2 ELSE 1 ENDIF", "P2SH,STRICTENC", "RESERVED ok in un-executed IF"],
+
+["1", "DUP IF ENDIF", "P2SH,STRICTENC"],
+["1", "IF 1 ENDIF", "P2SH,STRICTENC"],
+["1", "DUP IF ELSE ENDIF", "P2SH,STRICTENC"],
+["1", "IF 1 ELSE ENDIF", "P2SH,STRICTENC"],
+["0", "IF ELSE 1 ENDIF", "P2SH,STRICTENC"],
+
+["1 1", "IF IF 1 ELSE 0 ENDIF ENDIF", "P2SH,STRICTENC"],
+["1 0", "IF IF 1 ELSE 0 ENDIF ENDIF", "P2SH,STRICTENC"],
+["1 1", "IF IF 1 ELSE 0 ENDIF ELSE IF 0 ELSE 1 ENDIF ENDIF", "P2SH,STRICTENC"],
+["0 0", "IF IF 1 ELSE 0 ENDIF ELSE IF 0 ELSE 1 ENDIF ENDIF", "P2SH,STRICTENC"],
+
+["1 0", "NOTIF IF 1 ELSE 0 ENDIF ENDIF", "P2SH,STRICTENC"],
+["1 1", "NOTIF IF 1 ELSE 0 ENDIF ENDIF", "P2SH,STRICTENC"],
+["1 0", "NOTIF IF 1 ELSE 0 ENDIF ELSE IF 0 ELSE 1 ENDIF ENDIF", "P2SH,STRICTENC"],
+["0 1", "NOTIF IF 1 ELSE 0 ENDIF ELSE IF 0 ELSE 1 ENDIF ENDIF", "P2SH,STRICTENC"],
+
+["0", "IF 0 ELSE 1 ELSE 0 ENDIF", "P2SH,STRICTENC", "Multiple ELSE's are valid and executed inverts on each ELSE encountered"],
+["1", "IF 1 ELSE 0 ELSE ENDIF", "P2SH,STRICTENC"],
+["1", "IF ELSE 0 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["1", "IF 1 ELSE 0 ELSE 1 ENDIF ADD 2 EQUAL", "P2SH,STRICTENC"],
+["'' 1", "IF SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ENDIF 0x14 0x68ca4fec736264c13b859bac43d5173df6871682 EQUAL", "P2SH,STRICTENC"],
+
+["1", "NOTIF 0 ELSE 1 ELSE 0 ENDIF", "P2SH,STRICTENC", "Multiple ELSE's are valid and execution inverts on each ELSE encountered"],
+["0", "NOTIF 1 ELSE 0 ELSE ENDIF", "P2SH,STRICTENC"],
+["0", "NOTIF ELSE 0 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "NOTIF 1 ELSE 0 ELSE 1 ENDIF ADD 2 EQUAL", "P2SH,STRICTENC"],
+["'' 0", "NOTIF SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ELSE ELSE SHA1 ENDIF 0x14 0x68ca4fec736264c13b859bac43d5173df6871682 EQUAL", "P2SH,STRICTENC"],
+
+["0", "IF 1 IF RETURN ELSE RETURN ELSE RETURN ENDIF ELSE 1 IF 1 ELSE RETURN ELSE 1 ENDIF ELSE RETURN ENDIF ADD 2 EQUAL", "P2SH,STRICTENC", "Nested ELSE ELSE"],
+["1", "NOTIF 0 NOTIF RETURN ELSE RETURN ELSE RETURN ENDIF ELSE 0 NOTIF 1 ELSE RETURN ELSE 1 ENDIF ELSE RETURN ENDIF ADD 2 EQUAL", "P2SH,STRICTENC"],
+
+["0", "IF RETURN ENDIF 1", "P2SH,STRICTENC", "RETURN only works if executed"],
+
+["1 1", "VERIFY", "P2SH,STRICTENC"],
+["1 0x05 0x01 0x00 0x00 0x00 0x00", "VERIFY", "P2SH,STRICTENC", "values >4 bytes can be cast to boolean"],
+["1 0x01 0x80", "IF 0 ENDIF", "P2SH,STRICTENC", "negative 0 is false"],
+
+["10 0 11 TOALTSTACK DROP FROMALTSTACK", "ADD 21 EQUAL", "P2SH,STRICTENC"],
+["'gavin_was_here' TOALTSTACK 11 FROMALTSTACK", "'gavin_was_here' EQUALVERIFY 11 EQUAL", "P2SH,STRICTENC"],
+
+["0 IFDUP", "DEPTH 1 EQUALVERIFY 0 EQUAL", "P2SH,STRICTENC"],
+["1 IFDUP", "DEPTH 2 EQUALVERIFY 1 EQUALVERIFY 1 EQUAL", "P2SH,STRICTENC"],
+["0x05 0x0100000000 IFDUP", "DEPTH 2 EQUALVERIFY 0x05 0x0100000000 EQUAL", "P2SH,STRICTENC", "IFDUP dups non ints"],
+["0 DROP", "DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["0", "DUP 1 ADD 1 EQUALVERIFY 0 EQUAL", "P2SH,STRICTENC"],
+["0 1", "NIP", "P2SH,STRICTENC"],
+["1 0", "OVER DEPTH 3 EQUALVERIFY", "P2SH,STRICTENC"],
+["22 21 20", "0 PICK 20 EQUALVERIFY DEPTH 3 EQUAL", "P2SH,STRICTENC"],
+["22 21 20", "1 PICK 21 EQUALVERIFY DEPTH 3 EQUAL", "P2SH,STRICTENC"],
+["22 21 20", "2 PICK 22 EQUALVERIFY DEPTH 3 EQUAL", "P2SH,STRICTENC"],
+["22 21 20", "0 ROLL 20 EQUALVERIFY DEPTH 2 EQUAL", "P2SH,STRICTENC"],
+["22 21 20", "1 ROLL 21 EQUALVERIFY DEPTH 2 EQUAL", "P2SH,STRICTENC"],
+["22 21 20", "2 ROLL 22 EQUALVERIFY DEPTH 2 EQUAL", "P2SH,STRICTENC"],
+["22 21 20", "ROT 22 EQUAL", "P2SH,STRICTENC"],
+["22 21 20", "ROT DROP 20 EQUAL", "P2SH,STRICTENC"],
+["22 21 20", "ROT DROP DROP 21 EQUAL", "P2SH,STRICTENC"],
+["22 21 20", "ROT ROT 21 EQUAL", "P2SH,STRICTENC"],
+["22 21 20", "ROT ROT ROT 20 EQUAL", "P2SH,STRICTENC"],
+["25 24 23 22 21 20", "2ROT 24 EQUAL", "P2SH,STRICTENC"],
+["25 24 23 22 21 20", "2ROT DROP 25 EQUAL", "P2SH,STRICTENC"],
+["25 24 23 22 21 20", "2ROT 2DROP 20 EQUAL", "P2SH,STRICTENC"],
+["25 24 23 22 21 20", "2ROT 2DROP DROP 21 EQUAL", "P2SH,STRICTENC"],
+["25 24 23 22 21 20", "2ROT 2DROP 2DROP 22 EQUAL", "P2SH,STRICTENC"],
+["25 24 23 22 21 20", "2ROT 2DROP 2DROP DROP 23 EQUAL", "P2SH,STRICTENC"],
+["25 24 23 22 21 20", "2ROT 2ROT 22 EQUAL", "P2SH,STRICTENC"],
+["25 24 23 22 21 20", "2ROT 2ROT 2ROT 20 EQUAL", "P2SH,STRICTENC"],
+["1 0", "SWAP 1 EQUALVERIFY 0 EQUAL", "P2SH,STRICTENC"],
+["0 1", "TUCK DEPTH 3 EQUALVERIFY SWAP 2DROP", "P2SH,STRICTENC"],
+["13 14", "2DUP ROT EQUALVERIFY EQUAL", "P2SH,STRICTENC"],
+["-1 0 1 2", "3DUP DEPTH 7 EQUALVERIFY ADD ADD 3 EQUALVERIFY 2DROP 0 EQUALVERIFY", "P2SH,STRICTENC"],
+["1 2 3 5", "2OVER ADD ADD 8 EQUALVERIFY ADD ADD 6 EQUAL", "P2SH,STRICTENC"],
+["1 3 5 7", "2SWAP ADD 4 EQUALVERIFY ADD 12 EQUAL", "P2SH,STRICTENC"],
+["0", "SIZE 0 EQUAL", "P2SH,STRICTENC"],
+["1", "SIZE 1 EQUAL", "P2SH,STRICTENC"],
+["127", "SIZE 1 EQUAL", "P2SH,STRICTENC"],
+["128", "SIZE 2 EQUAL", "P2SH,STRICTENC"],
+["32767", "SIZE 2 EQUAL", "P2SH,STRICTENC"],
+["32768", "SIZE 3 EQUAL", "P2SH,STRICTENC"],
+["8388607", "SIZE 3 EQUAL", "P2SH,STRICTENC"],
+["8388608", "SIZE 4 EQUAL", "P2SH,STRICTENC"],
+["2147483647", "SIZE 4 EQUAL", "P2SH,STRICTENC"],
+["2147483648", "SIZE 5 EQUAL", "P2SH,STRICTENC"],
+["549755813887", "SIZE 5 EQUAL", "P2SH,STRICTENC"],
+["549755813888", "SIZE 6 EQUAL", "P2SH,STRICTENC"],
+["9223372036854775807", "SIZE 8 EQUAL", "P2SH,STRICTENC"],
+["-1", "SIZE 1 EQUAL", "P2SH,STRICTENC"],
+["-127", "SIZE 1 EQUAL", "P2SH,STRICTENC"],
+["-128", "SIZE 2 EQUAL", "P2SH,STRICTENC"],
+["-32767", "SIZE 2 EQUAL", "P2SH,STRICTENC"],
+["-32768", "SIZE 3 EQUAL", "P2SH,STRICTENC"],
+["-8388607", "SIZE 3 EQUAL", "P2SH,STRICTENC"],
+["-8388608", "SIZE 4 EQUAL", "P2SH,STRICTENC"],
+["-2147483647", "SIZE 4 EQUAL", "P2SH,STRICTENC"],
+["-2147483648", "SIZE 5 EQUAL", "P2SH,STRICTENC"],
+["-549755813887", "SIZE 5 EQUAL", "P2SH,STRICTENC"],
+["-549755813888", "SIZE 6 EQUAL", "P2SH,STRICTENC"],
+["-9223372036854775807", "SIZE 8 EQUAL", "P2SH,STRICTENC"],
+["'abcdefghijklmnopqrstuvwxyz'", "SIZE 26 EQUAL", "P2SH,STRICTENC"],
+
+["42", "SIZE 1 EQUALVERIFY 42 EQUAL", "P2SH,STRICTENC", "SIZE does not consume argument"],
+
+["2 -2 ADD", "0 EQUAL", "P2SH,STRICTENC"],
+["2147483647 -2147483647 ADD", "0 EQUAL", "P2SH,STRICTENC"],
+["-1 -1 ADD", "-2 EQUAL", "P2SH,STRICTENC"],
+
+["0 0","EQUAL", "P2SH,STRICTENC"],
+["1 1 ADD", "2 EQUAL", "P2SH,STRICTENC"],
+["1 1ADD", "2 EQUAL", "P2SH,STRICTENC"],
+["111 1SUB", "110 EQUAL", "P2SH,STRICTENC"],
+["111 1 ADD 12 SUB", "100 EQUAL", "P2SH,STRICTENC"],
+["0 ABS", "0 EQUAL", "P2SH,STRICTENC"],
+["16 ABS", "16 EQUAL", "P2SH,STRICTENC"],
+["-16 ABS", "-16 NEGATE EQUAL", "P2SH,STRICTENC"],
+["0 NOT", "NOP", "P2SH,STRICTENC"],
+["1 NOT", "0 EQUAL", "P2SH,STRICTENC"],
+["11 NOT", "0 EQUAL", "P2SH,STRICTENC"],
+["0 0NOTEQUAL", "0 EQUAL", "P2SH,STRICTENC"],
+["1 0NOTEQUAL", "1 EQUAL", "P2SH,STRICTENC"],
+["111 0NOTEQUAL", "1 EQUAL", "P2SH,STRICTENC"],
+["-111 0NOTEQUAL", "1 EQUAL", "P2SH,STRICTENC"],
+["1 1 BOOLAND", "NOP", "P2SH,STRICTENC"],
+["1 0 BOOLAND", "NOT", "P2SH,STRICTENC"],
+["0 1 BOOLAND", "NOT", "P2SH,STRICTENC"],
+["0 0 BOOLAND", "NOT", "P2SH,STRICTENC"],
+["16 17 BOOLAND", "NOP", "P2SH,STRICTENC"],
+["1 1 BOOLOR", "NOP", "P2SH,STRICTENC"],
+["1 0 BOOLOR", "NOP", "P2SH,STRICTENC"],
+["0 1 BOOLOR", "NOP", "P2SH,STRICTENC"],
+["0 0 BOOLOR", "NOT", "P2SH,STRICTENC"],
+["16 17 BOOLOR", "NOP", "P2SH,STRICTENC"],
+["11 10 1 ADD", "NUMEQUAL", "P2SH,STRICTENC"],
+["11 10 1 ADD", "NUMEQUALVERIFY 1", "P2SH,STRICTENC"],
+["11 10 1 ADD", "NUMNOTEQUAL NOT", "P2SH,STRICTENC"],
+["111 10 1 ADD", "NUMNOTEQUAL", "P2SH,STRICTENC"],
+["11 10", "LESSTHAN NOT", "P2SH,STRICTENC"],
+["4 4", "LESSTHAN NOT", "P2SH,STRICTENC"],
+["10 11", "LESSTHAN", "P2SH,STRICTENC"],
+["-11 11", "LESSTHAN", "P2SH,STRICTENC"],
+["-11 -10", "LESSTHAN", "P2SH,STRICTENC"],
+["11 10", "GREATERTHAN", "P2SH,STRICTENC"],
+["4 4", "GREATERTHAN NOT", "P2SH,STRICTENC"],
+["10 11", "GREATERTHAN NOT", "P2SH,STRICTENC"],
+["-11 11", "GREATERTHAN NOT", "P2SH,STRICTENC"],
+["-11 -10", "GREATERTHAN NOT", "P2SH,STRICTENC"],
+["11 10", "LESSTHANOREQUAL NOT", "P2SH,STRICTENC"],
+["4 4", "LESSTHANOREQUAL", "P2SH,STRICTENC"],
+["10 11", "LESSTHANOREQUAL", "P2SH,STRICTENC"],
+["-11 11", "LESSTHANOREQUAL", "P2SH,STRICTENC"],
+["-11 -10", "LESSTHANOREQUAL", "P2SH,STRICTENC"],
+["11 10", "GREATERTHANOREQUAL", "P2SH,STRICTENC"],
+["4 4", "GREATERTHANOREQUAL", "P2SH,STRICTENC"],
+["10 11", "GREATERTHANOREQUAL NOT", "P2SH,STRICTENC"],
+["-11 11", "GREATERTHANOREQUAL NOT", "P2SH,STRICTENC"],
+["-11 -10", "GREATERTHANOREQUAL NOT", "P2SH,STRICTENC"],
+["1 0 MIN", "0 NUMEQUAL", "P2SH,STRICTENC"],
+["0 1 MIN", "0 NUMEQUAL", "P2SH,STRICTENC"],
+["-1 0 MIN", "-1 NUMEQUAL", "P2SH,STRICTENC"],
+["0 -2147483647 MIN", "-2147483647 NUMEQUAL", "P2SH,STRICTENC"],
+["2147483647 0 MAX", "2147483647 NUMEQUAL", "P2SH,STRICTENC"],
+["0 100 MAX", "100 NUMEQUAL", "P2SH,STRICTENC"],
+["-100 0 MAX", "0 NUMEQUAL", "P2SH,STRICTENC"],
+["0 -2147483647 MAX", "0 NUMEQUAL", "P2SH,STRICTENC"],
+["0 0 1", "WITHIN", "P2SH,STRICTENC"],
+["1 0 1", "WITHIN NOT", "P2SH,STRICTENC"],
+["0 -2147483647 2147483647", "WITHIN", "P2SH,STRICTENC"],
+["-1 -100 100", "WITHIN", "P2SH,STRICTENC"],
+["11 -100 100", "WITHIN", "P2SH,STRICTENC"],
+["-2147483647 -100 100", "WITHIN NOT", "P2SH,STRICTENC"],
+["2147483647 -100 100", "WITHIN NOT", "P2SH,STRICTENC"],
+
+["2147483647 2147483647 SUB", "0 EQUAL", "P2SH,STRICTENC"],
+["2147483647 DUP ADD", "4294967294 EQUAL", "P2SH,STRICTENC", ">32 bit EQUAL is valid"],
+["2147483647 NEGATE DUP ADD", "-4294967294 EQUAL", "P2SH,STRICTENC"],
+
+["''", "RIPEMD160 0x14 0x9c1185a5c5e9fc54612808977ee8f548b2258d31 EQUAL", "P2SH,STRICTENC"],
+["'a'", "RIPEMD160 0x14 0x0bdc9d2d256b3ee9daae347be6f4dc835a467ffe EQUAL", "P2SH,STRICTENC"],
+["'abcdefghijklmnopqrstuvwxyz'", "RIPEMD160 0x14 0xf71c27109c692c1b56bbdceb5b9d2865b3708dbc EQUAL", "P2SH,STRICTENC"],
+["''", "SHA1 0x14 0xda39a3ee5e6b4b0d3255bfef95601890afd80709 EQUAL", "P2SH,STRICTENC"],
+["'a'", "SHA1 0x14 0x86f7e437faa5a7fce15d1ddcb9eaeaea377667b8 EQUAL", "P2SH,STRICTENC"],
+["'abcdefghijklmnopqrstuvwxyz'", "SHA1 0x14 0x32d10c7b8cf96570ca04ce37f2a19d84240d3a89 EQUAL", "P2SH,STRICTENC"],
+["''", "SHA256 0x20 0xe3b0c44298fc1c149afbf4c8996fb92427ae41e4649b934ca495991b7852b855 EQUAL", "P2SH,STRICTENC"],
+["'a'", "SHA256 0x20 0xca978112ca1bbdcafac231b39a23dc4da786eff8147c4e72b9807785afee48bb EQUAL", "P2SH,STRICTENC"],
+["'abcdefghijklmnopqrstuvwxyz'", "SHA256 0x20 0x71c480df93d6ae2f1efad1447c66c9525e316218cf51fc8d9ed832f2daf18b73 EQUAL", "P2SH,STRICTENC"],
+["''", "DUP HASH160 SWAP SHA256 RIPEMD160 EQUAL", "P2SH,STRICTENC"],
+["''", "DUP HASH256 SWAP SHA256 SHA256 EQUAL", "P2SH,STRICTENC"],
+["''", "NOP HASH160 0x14 0xb472a266d0bd89c13706a4132ccfb16f7c3b9fcb EQUAL", "P2SH,STRICTENC"],
+["'a'", "HASH160 NOP 0x14 0x994355199e516ff76c4fa4aab39337b9d84cf12b EQUAL", "P2SH,STRICTENC"],
+["'abcdefghijklmnopqrstuvwxyz'", "HASH160 0x4c 0x14 0xc286a1af0947f58d1ad787385b1c2c4a976f9e71 EQUAL", "P2SH,STRICTENC"],
+["''", "HASH256 0x20 0x5df6e0e2761359d30a8275058e299fcc0381534545f55cf43e41983f5d4c9456 EQUAL", "P2SH,STRICTENC"],
+["'a'", "HASH256 0x20 0xbf5d3affb73efd2ec6c36ad3112dd933efed63c4e1cbffcfa88e2759c144f2d8 EQUAL", "P2SH,STRICTENC"],
+["'abcdefghijklmnopqrstuvwxyz'", "HASH256 0x4c 0x20 0xca139bc10c2f660da42666f72e89a225936fc60f193c161124a672050c434671 EQUAL", "P2SH,STRICTENC"],
+
+
+["1","NOP1 NOP2 NOP3 NOP4 NOP5 NOP6 NOP7 NOP8 NOP9 NOP10 1 EQUAL", "P2SH,STRICTENC"],
+["'NOP_1_to_10' NOP1 NOP2 NOP3 NOP4 NOP5 NOP6 NOP7 NOP8 NOP9 NOP10","'NOP_1_to_10' EQUAL", "P2SH,STRICTENC"],
+
+["1", "NOP", "P2SH,STRICTENC,DISCOURAGE_UPGRADABLE_NOPS", "Discourage NOPx flag allows OP_NOP"],
+
+["0", "IF NOP10 ENDIF 1", "P2SH,STRICTENC,DISCOURAGE_UPGRADABLE_NOPS",
+ "Discouraged NOPs are allowed if not executed"],
+
+["0", "IF 0xba ELSE 1 ENDIF", "P2SH,STRICTENC", "opcodes above NOP10 invalid if executed"],
+["0", "IF 0xbb ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xbc ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xbd ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xbe ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xbf ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xc0 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xc1 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xc2 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xc3 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xc4 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xc5 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xc6 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xc7 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xc8 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xc9 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xca ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xcb ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xcc ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xcd ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xce ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xcf ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xd0 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xd1 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xd2 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xd3 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xd4 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xd5 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xd6 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xd7 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xd8 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xd9 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xda ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xdb ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xdc ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xdd ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xde ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xdf ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xe0 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xe1 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xe2 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xe3 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xe4 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xe5 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xe6 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xe7 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xe8 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xe9 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xea ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xeb ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xec ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xed ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xee ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xef ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xf0 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xf1 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xf2 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xf3 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xf4 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xf5 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xf6 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xf7 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xf8 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xf9 ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xfa ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xfb ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xfc ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xfd ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xfe ELSE 1 ENDIF", "P2SH,STRICTENC"],
+["0", "IF 0xff ELSE 1 ENDIF", "P2SH,STRICTENC"],
+
+["NOP",
+"'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb'",
+"P2SH,STRICTENC",
+"520 byte push"],
+["1",
+"0x616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161",
+"P2SH,STRICTENC",
+"201 opcodes executed. 0x61 is NOP"],
+["1 2 3 4 5 0x6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f",
+"1 2 3 4 5 0x6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f",
+"P2SH,STRICTENC",
+"1,000 stack size (0x6f is 3DUP)"],
+["1 TOALTSTACK 2 TOALTSTACK 3 4 5 0x6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f",
+"1 2 3 4 5 6 7 0x6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f",
+"P2SH,STRICTENC",
+"1,000 stack size (altstack cleared between scriptSig/scriptPubKey)"],
+["'aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 0x6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f",
+"'aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 'bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb' 0x6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f6f 2DUP 0x616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161616161",
+"P2SH,STRICTENC",
+"Max-size (10,000-byte), max-push(520 bytes), max-opcodes(201), max stack size(1,000 items). 0x6f is 3DUP, 0x61 is NOP"],
+
+["0",
+"IF 0x5050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050505050 ENDIF 1",
+"P2SH,STRICTENC",
+">201 opcodes, but RESERVED (0x50) doesn't count towards opcode limit."],
+
+["NOP","1", "P2SH,STRICTENC"],
+
+["1", "0x01 0x01 EQUAL", "P2SH,STRICTENC", "The following is useful for checking implementations of BN_bn2mpi"],
+["127", "0x01 0x7F EQUAL", "P2SH,STRICTENC"],
+["128", "0x02 0x8000 EQUAL", "P2SH,STRICTENC", "Leave room for the sign bit"],
+["32767", "0x02 0xFF7F EQUAL", "P2SH,STRICTENC"],
+["32768", "0x03 0x008000 EQUAL", "P2SH,STRICTENC"],
+["8388607", "0x03 0xFFFF7F EQUAL", "P2SH,STRICTENC"],
+["8388608", "0x04 0x00008000 EQUAL", "P2SH,STRICTENC"],
+["2147483647", "0x04 0xFFFFFF7F EQUAL", "P2SH,STRICTENC"],
+["2147483648", "0x05 0x0000008000 EQUAL", "P2SH,STRICTENC"],
+["549755813887", "0x05 0xFFFFFFFF7F EQUAL", "P2SH,STRICTENC"],
+["549755813888", "0x06 0xFFFFFFFF7F EQUAL", "P2SH,STRICTENC"],
+["9223372036854775807", "0x08 0xFFFFFFFFFFFFFF7F EQUAL", "P2SH,STRICTENC"],
+["-1", "0x01 0x81 EQUAL", "P2SH,STRICTENC", "Numbers are little-endian with the MSB being a sign bit"],
+["-127", "0x01 0xFF EQUAL", "P2SH,STRICTENC"],
+["-128", "0x02 0x8080 EQUAL", "P2SH,STRICTENC"],
+["-32767", "0x02 0xFFFF EQUAL", "P2SH,STRICTENC"],
+["-32768", "0x03 0x008080 EQUAL", "P2SH,STRICTENC"],
+["-8388607", "0x03 0xFFFFFF EQUAL", "P2SH,STRICTENC"],
+["-8388608", "0x04 0x00008080 EQUAL", "P2SH,STRICTENC"],
+["-2147483647", "0x04 0xFFFFFFFF EQUAL", "P2SH,STRICTENC"],
+["-2147483648", "0x05 0x0000008080 EQUAL", "P2SH,STRICTENC"],
+["-4294967295", "0x05 0xFFFFFFFF80 EQUAL", "P2SH,STRICTENC"],
+["-549755813887", "0x05 0xFFFFFFFFFF EQUAL", "P2SH,STRICTENC"],
+["-549755813888", "0x06 0x000000008080 EQUAL", "P2SH,STRICTENC"],
+["-9223372036854775807", "0x08 0xFFFFFFFFFFFFFFFF EQUAL", "P2SH,STRICTENC"],
+
+["2147483647", "1ADD 2147483648 EQUAL", "P2SH,STRICTENC", "We can do math on 4-byte integers, and compare 5-byte ones"],
+["2147483647", "1ADD 1", "P2SH,STRICTENC"],
+["-2147483647", "1ADD 1", "P2SH,STRICTENC"],
+
+["1", "0x02 0x0100 EQUAL NOT", "P2SH,STRICTENC", "Not the same byte array..."],
+["1", "0x02 0x0100 NUMEQUAL", "P2SH,STRICTENC", "... but they are numerically equal"],
+["11", "0x4c 0x03 0x0b0000 NUMEQUAL", "P2SH,STRICTENC"],
+["0", "0x01 0x80 EQUAL NOT", "P2SH,STRICTENC"],
+["0", "0x01 0x80 NUMEQUAL", "P2SH,STRICTENC", "Zero numerically equals negative zero"],
+["0", "0x02 0x0080 NUMEQUAL", "P2SH,STRICTENC"],
+["0x03 0x000080", "0x04 0x00000080 NUMEQUAL", "P2SH,STRICTENC"],
+["0x03 0x100080", "0x04 0x10000080 NUMEQUAL", "P2SH,STRICTENC"],
+["0x03 0x100000", "0x04 0x10000000 NUMEQUAL", "P2SH,STRICTENC"],
+
+["NOP", "NOP 1", "P2SH,STRICTENC", "The following tests check the if(stack.size() < N) tests in each opcode"],
+["1", "IF 1 ENDIF", "P2SH,STRICTENC", "They are here to catch copy-and-paste errors"],
+["0", "NOTIF 1 ENDIF", "P2SH,STRICTENC", "Most of them are duplicated elsewhere,"],
+["1", "VERIFY 1", "P2SH,STRICTENC", "but, hey, more is always better, right?"],
+
+["0", "TOALTSTACK 1", "P2SH,STRICTENC"],
+["1", "TOALTSTACK FROMALTSTACK", "P2SH,STRICTENC"],
+["0 0", "2DROP 1", "P2SH,STRICTENC"],
+["0 1", "2DUP", "P2SH,STRICTENC"],
+["0 0 1", "3DUP", "P2SH,STRICTENC"],
+["0 1 0 0", "2OVER", "P2SH,STRICTENC"],
+["0 1 0 0 0 0", "2ROT", "P2SH,STRICTENC"],
+["0 1 0 0", "2SWAP", "P2SH,STRICTENC"],
+["1", "IFDUP", "P2SH,STRICTENC"],
+["NOP", "DEPTH 1", "P2SH,STRICTENC"],
+["0", "DROP 1", "P2SH,STRICTENC"],
+["1", "DUP", "P2SH,STRICTENC"],
+["0 1", "NIP", "P2SH,STRICTENC"],
+["1 0", "OVER", "P2SH,STRICTENC"],
+["1 0 0 0 3", "PICK", "P2SH,STRICTENC"],
+["1 0", "PICK", "P2SH,STRICTENC"],
+["1 0 0 0 3", "ROLL", "P2SH,STRICTENC"],
+["1 0", "ROLL", "P2SH,STRICTENC"],
+["1 0 0", "ROT", "P2SH,STRICTENC"],
+["1 0", "SWAP", "P2SH,STRICTENC"],
+["0 1", "TUCK", "P2SH,STRICTENC"],
+
+["1", "SIZE", "P2SH,STRICTENC"],
+
+["0 0", "EQUAL", "P2SH,STRICTENC"],
+["0 0", "EQUALVERIFY 1", "P2SH,STRICTENC"],
+["0 0 1", "EQUAL EQUAL", "P2SH,STRICTENC", "OP_0 and bools must have identical byte representations"],
+
+["0", "1ADD", "P2SH,STRICTENC"],
+["2", "1SUB", "P2SH,STRICTENC"],
+["-1", "NEGATE", "P2SH,STRICTENC"],
+["-1", "ABS", "P2SH,STRICTENC"],
+["0", "NOT", "P2SH,STRICTENC"],
+["-1", "0NOTEQUAL", "P2SH,STRICTENC"],
+
+["1 0", "ADD", "P2SH,STRICTENC"],
+["1 0", "SUB", "P2SH,STRICTENC"],
+["-1 -1", "BOOLAND", "P2SH,STRICTENC"],
+["-1 0", "BOOLOR", "P2SH,STRICTENC"],
+["0 0", "NUMEQUAL", "P2SH,STRICTENC"],
+["0 0", "NUMEQUALVERIFY 1", "P2SH,STRICTENC"],
+["-1 0", "NUMNOTEQUAL", "P2SH,STRICTENC"],
+["-1 0", "LESSTHAN", "P2SH,STRICTENC"],
+["1 0", "GREATERTHAN", "P2SH,STRICTENC"],
+["0 0", "LESSTHANOREQUAL", "P2SH,STRICTENC"],
+["0 0", "GREATERTHANOREQUAL", "P2SH,STRICTENC"],
+["-1 0", "MIN", "P2SH,STRICTENC"],
+["1 0", "MAX", "P2SH,STRICTENC"],
+["-1 -1 0", "WITHIN", "P2SH,STRICTENC"],
+
+["0", "RIPEMD160", "P2SH,STRICTENC"],
+["0", "SHA1", "P2SH,STRICTENC"],
+["0", "SHA256", "P2SH,STRICTENC"],
+["0", "HASH160", "P2SH,STRICTENC"],
+["0", "HASH256", "P2SH,STRICTENC"],
+
+["NOP", "NOP1 1", "P2SH,STRICTENC"],
+["NOP", "NOP2 1", "P2SH,STRICTENC"],
+["NOP", "NOP3 1", "P2SH,STRICTENC"],
+["NOP", "NOP4 1", "P2SH,STRICTENC"],
+["NOP", "NOP5 1", "P2SH,STRICTENC"],
+["NOP", "NOP6 1", "P2SH,STRICTENC"],
+["NOP", "NOP7 1", "P2SH,STRICTENC"],
+["NOP", "NOP8 1", "P2SH,STRICTENC"],
+["NOP", "NOP9 1", "P2SH,STRICTENC"],
+["NOP", "NOP10 1", "P2SH,STRICTENC"],
+
+["", "0 0 0 CHECKMULTISIG VERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC", "CHECKMULTISIG is allowed to have zero keys and/or sigs"],
+["", "0 0 0 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 0 1 CHECKMULTISIG VERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC", "Zero sigs means no sigs are checked"],
+["", "0 0 0 1 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+
+["", "0 0 0 CHECKMULTISIG VERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC", "CHECKMULTISIG is allowed to have zero keys and/or sigs"],
+["", "0 0 0 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 0 1 CHECKMULTISIG VERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC", "Zero sigs means no sigs are checked"],
+["", "0 0 0 1 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+
+["", "0 0 'a' 'b' 2 CHECKMULTISIG VERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC", "Test from up to 20 pubkeys, all not checked"],
+["", "0 0 'a' 'b' 'c' 3 CHECKMULTISIG VERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 4 CHECKMULTISIG VERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 5 CHECKMULTISIG VERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 6 CHECKMULTISIG VERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 7 CHECKMULTISIG VERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 8 CHECKMULTISIG VERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 9 CHECKMULTISIG VERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 10 CHECKMULTISIG VERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 11 CHECKMULTISIG VERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 12 CHECKMULTISIG VERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 13 CHECKMULTISIG VERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 14 CHECKMULTISIG VERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 15 CHECKMULTISIG VERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 16 CHECKMULTISIG VERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 17 CHECKMULTISIG VERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 18 CHECKMULTISIG VERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 19 CHECKMULTISIG VERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIG VERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 1 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 2 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 3 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 4 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 5 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 6 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 7 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 8 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 9 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 10 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 11 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 12 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 13 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 14 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 15 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 16 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 17 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 18 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 19 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+["", "0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIGVERIFY DEPTH 0 EQUAL", "P2SH,STRICTENC"],
+
+["",
+"0 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG 0 0 CHECKMULTISIG",
+"P2SH,STRICTENC",
+"nOpCount is incremented by the number of keys evaluated in addition to the usual one op per op. In this case we have zero keys, so we can execute 201 CHECKMULTISIGS"],
+
+["1",
+"0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY 0 0 0 CHECKMULTISIGVERIFY",
+"P2SH,STRICTENC"],
+
+["",
+"NOP NOP NOP NOP NOP NOP NOP NOP NOP NOP NOP NOP 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIG 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIG 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIG 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIG 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIG 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIG 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIG 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIG 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIG",
+"P2SH,STRICTENC",
+"Even though there are no signatures being checked nOpCount is incremented by the number of keys."],
+
+["1",
+"NOP NOP NOP NOP NOP NOP NOP NOP NOP NOP NOP NOP 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIGVERIFY 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIGVERIFY 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIGVERIFY 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIGVERIFY 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIGVERIFY 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIGVERIFY 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIGVERIFY 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIGVERIFY 0 0 'a' 'b' 'c' 'd' 'e' 'f' 'g' 'h' 'i' 'j' 'k' 'l' 'm' 'n' 'o' 'p' 'q' 'r' 's' 't' 20 CHECKMULTISIGVERIFY",
+"P2SH,STRICTENC"],
+
+["0 0x01 1", "HASH160 0x14 0xda1745e9b549bd0bfa1a569971c77eba30cd5a4b EQUAL", "P2SH,STRICTENC", "Very basic P2SH"],
+["0x4c 0 0x01 1", "HASH160 0x14 0xda1745e9b549bd0bfa1a569971c77eba30cd5a4b EQUAL", "P2SH,STRICTENC"],
+
+["0x40 0x42424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242",
+"0x4d 0x4000 0x42424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242 EQUAL",
+"P2SH,STRICTENC",
+"Basic PUSH signedness check"],
+
+["0x4c 0x40 0x42424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242",
+"0x4d 0x4000 0x42424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242424242 EQUAL",
+"P2SH,STRICTENC",
+"Basic PUSHDATA1 signedness check"],
+
+["all PUSHDATA forms are equivalent"],
+
+["0x4c 0x4b 0x111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111", "0x4b 0x111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111 EQUAL", "", "PUSHDATA1 of 75 bytes equals direct push of it"],
+["0x4d 0xFF00 0x111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111", "0x4c 0xFF 0x111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111 EQUAL", "", "PUSHDATA2 of 255 bytes equals PUSHDATA1 of it"],
+
+["0x00", "SIZE 0 EQUAL", "P2SH,STRICTENC", "Basic OP_0 execution"],
+
+["Numeric pushes"],
+
+["0x01 0x81", "0x4f EQUAL", "", "OP1_NEGATE pushes 0x81"],
+["0x01 0x01", "0x51 EQUAL", "", "OP_1  pushes 0x01"],
+["0x01 0x02", "0x52 EQUAL", "", "OP_2  pushes 0x02"],
+["0x01 0x03", "0x53 EQUAL", "", "OP_3  pushes 0x03"],
+["0x01 0x04", "0x54 EQUAL", "", "OP_4  pushes 0x04"],
+["0x01 0x05", "0x55 EQUAL", "", "OP_5  pushes 0x05"],
+["0x01 0x06", "0x56 EQUAL", "", "OP_6  pushes 0x06"],
+["0x01 0x07", "0x57 EQUAL", "", "OP_7  pushes 0x07"],
+["0x01 0x08", "0x58 EQUAL", "", "OP_8  pushes 0x08"],
+["0x01 0x09", "0x59 EQUAL", "", "OP_9  pushes 0x09"],
+["0x01 0x0a", "0x5a EQUAL", "", "OP_10 pushes 0x0a"],
+["0x01 0x0b", "0x5b EQUAL", "", "OP_11 pushes 0x0b"],
+["0x01 0x0c", "0x5c EQUAL", "", "OP_12 pushes 0x0c"],
+["0x01 0x0d", "0x5d EQUAL", "", "OP_13 pushes 0x0d"],
+["0x01 0x0e", "0x5e EQUAL", "", "OP_14 pushes 0x0e"],
+["0x01 0x0f", "0x5f EQUAL", "", "OP_15 pushes 0x0f"],
+["0x01 0x10", "0x60 EQUAL", "", "OP_16 pushes 0x10"],
+
+["Equivalency of different numeric encodings"],
+
+["0x02 0x8000", "128 NUMEQUAL", "", "0x8000 equals 128"],
+["0x01 0x00", "0 NUMEQUAL", "", "0x00 numequals 0"],
+["0x01 0x80", "0 NUMEQUAL", "", "0x80 (negative zero) numequals 0"],
+["0x02 0x0080", "0 NUMEQUAL", "", "0x0080 numequals 0"],
+["0x02 0x0500", "5 NUMEQUAL", "", "0x0500 numequals 5"],
+["0x03 0xff7f80", "0x02 0xffff NUMEQUAL", "", ""],
+["0x03 0xff7f00", "0x02 0xff7f NUMEQUAL", "", ""],
+["0x04 0xffff7f80", "0x03 0xffffff NUMEQUAL", "", ""],
+["0x04 0xffff7f00", "0x03 0xffff7f NUMEQUAL", "", ""],
+
+["Unevaluated non-minimal pushes are ignored"],
+
+["0 IF 0x4c 0x00 ENDIF 1", "", "MINIMALDATA", "non-minimal PUSHDATA1 ignored"],
+["0 IF 0x4d 0x0000 ENDIF 1", "", "MINIMALDATA", "non-minimal PUSHDATA2 ignored"],
+["0 IF 0x4c 0x00000000 ENDIF 1", "", "MINIMALDATA", "non-minimal PUSHDATA4 ignored"],
+["0 IF 0x01 0x81 ENDIF 1", "", "MINIMALDATA", "1NEGATE equiv"],
+["0 IF 0x01 0x01 ENDIF 1", "", "MINIMALDATA", "OP_1  equiv"],
+["0 IF 0x01 0x02 ENDIF 1", "", "MINIMALDATA", "OP_2  equiv"],
+["0 IF 0x01 0x03 ENDIF 1", "", "MINIMALDATA", "OP_3  equiv"],
+["0 IF 0x01 0x04 ENDIF 1", "", "MINIMALDATA", "OP_4  equiv"],
+["0 IF 0x01 0x05 ENDIF 1", "", "MINIMALDATA", "OP_5  equiv"],
+["0 IF 0x01 0x06 ENDIF 1", "", "MINIMALDATA", "OP_6  equiv"],
+["0 IF 0x01 0x07 ENDIF 1", "", "MINIMALDATA", "OP_7  equiv"],
+["0 IF 0x01 0x08 ENDIF 1", "", "MINIMALDATA", "OP_8  equiv"],
+["0 IF 0x01 0x09 ENDIF 1", "", "MINIMALDATA", "OP_9  equiv"],
+["0 IF 0x01 0x0a ENDIF 1", "", "MINIMALDATA", "OP_10 equiv"],
+["0 IF 0x01 0x0b ENDIF 1", "", "MINIMALDATA", "OP_11 equiv"],
+["0 IF 0x01 0x0c ENDIF 1", "", "MINIMALDATA", "OP_12 equiv"],
+["0 IF 0x01 0x0d ENDIF 1", "", "MINIMALDATA", "OP_13 equiv"],
+["0 IF 0x01 0x0e ENDIF 1", "", "MINIMALDATA", "OP_14 equiv"],
+["0 IF 0x01 0x0f ENDIF 1", "", "MINIMALDATA", "OP_15 equiv"],
+["0 IF 0x01 0x10 ENDIF 1", "", "MINIMALDATA", "OP_16 equiv"],
+
+["Numeric minimaldata rules are only applied when a stack item is numerically evaluated; the push itself is allowed"],
+
+["0x01 0x00", "1", "MINIMALDATA"],
+["0x01 0x80", "1", "MINIMALDATA"],
+["0x02 0x0180", "1", "MINIMALDATA"],
+["0x02 0x0100", "1", "MINIMALDATA"],
+["0x02 0x0200", "1", "MINIMALDATA"],
+["0x02 0x0300", "1", "MINIMALDATA"],
+["0x02 0x0400", "1", "MINIMALDATA"],
+["0x02 0x0500", "1", "MINIMALDATA"],
+["0x02 0x0600", "1", "MINIMALDATA"],
+["0x02 0x0700", "1", "MINIMALDATA"],
+["0x02 0x0800", "1", "MINIMALDATA"],
+["0x02 0x0900", "1", "MINIMALDATA"],
+["0x02 0x0a00", "1", "MINIMALDATA"],
+["0x02 0x0b00", "1", "MINIMALDATA"],
+["0x02 0x0c00", "1", "MINIMALDATA"],
+["0x02 0x0d00", "1", "MINIMALDATA"],
+["0x02 0x0e00", "1", "MINIMALDATA"],
+["0x02 0x0f00", "1", "MINIMALDATA"],
+["0x02 0x1000", "1", "MINIMALDATA"],
+
+["Valid version of the 'Test every numeric-accepting opcode for correct handling of the numeric minimal encoding rule' script_invalid test"],
+
+["1 0x02 0x0000", "PICK DROP", ""],
+["1 0x02 0x0000", "ROLL DROP 1", ""],
+["0x02 0x0000", "1ADD DROP 1", ""],
+["0x02 0x0000", "1SUB DROP 1", ""],
+["0x02 0x0000", "NEGATE DROP 1", ""],
+["0x02 0x0000", "ABS DROP 1", ""],
+["0x02 0x0000", "NOT DROP 1", ""],
+["0x02 0x0000", "0NOTEQUAL DROP 1", ""],
+
+["0 0x02 0x0000", "ADD DROP 1", ""],
+["0x02 0x0000 0", "ADD DROP 1", ""],
+["0 0x02 0x0000", "SUB DROP 1", ""],
+["0x02 0x0000 0", "SUB DROP 1", ""],
+["0 0x02 0x0000", "BOOLAND DROP 1", ""],
+["0x02 0x0000 0", "BOOLAND DROP 1", ""],
+["0 0x02 0x0000", "BOOLOR DROP 1", ""],
+["0x02 0x0000 0", "BOOLOR DROP 1", ""],
+["0 0x02 0x0000", "NUMEQUAL DROP 1", ""],
+["0x02 0x0000 1", "NUMEQUAL DROP 1", ""],
+["0 0x02 0x0000", "NUMEQUALVERIFY 1", ""],
+["0x02 0x0000 0", "NUMEQUALVERIFY 1", ""],
+["0 0x02 0x0000", "NUMNOTEQUAL DROP 1", ""],
+["0x02 0x0000 0", "NUMNOTEQUAL DROP 1", ""],
+["0 0x02 0x0000", "LESSTHAN DROP 1", ""],
+["0x02 0x0000 0", "LESSTHAN DROP 1", ""],
+["0 0x02 0x0000", "GREATERTHAN DROP 1", ""],
+["0x02 0x0000 0", "GREATERTHAN DROP 1", ""],
+["0 0x02 0x0000", "LESSTHANOREQUAL DROP 1", ""],
+["0x02 0x0000 0", "LESSTHANOREQUAL DROP 1", ""],
+["0 0x02 0x0000", "GREATERTHANOREQUAL DROP 1", ""],
+["0x02 0x0000 0", "GREATERTHANOREQUAL DROP 1", ""],
+["0 0x02 0x0000", "MIN DROP 1", ""],
+["0x02 0x0000 0", "MIN DROP 1", ""],
+["0 0x02 0x0000", "MAX DROP 1", ""],
+["0x02 0x0000 0", "MAX DROP 1", ""],
+
+["0x02 0x0000 0 0", "WITHIN DROP 1", ""],
+["0 0x02 0x0000 0", "WITHIN DROP 1", ""],
+["0 0 0x02 0x0000", "WITHIN DROP 1", ""],
+
+["0 0 0x02 0x0000", "CHECKMULTISIG DROP 1", ""],
+["0 0x02 0x0000 0", "CHECKMULTISIG DROP 1", ""],
+["0 0x02 0x0000 0 1", "CHECKMULTISIG DROP 1", ""],
+["0 0 0x02 0x0000", "CHECKMULTISIGVERIFY 1", ""],
+["0 0x02 0x0000 0", "CHECKMULTISIGVERIFY 1", ""],
+
+["While not really correctly DER encoded, the empty signature is allowed by"],
+["STRICTENC to provide a compact way to provide a deliberately invalid signature."],
+["0", "0x21 0x02865c40293a680cb9c020e7b1e106d8c1916d3cef99aa431a56d253e69256dac0 CHECKSIG NOT", "STRICTENC"],
+["0 0", "1 0x21 0x02865c40293a680cb9c020e7b1e106d8c1916d3cef99aa431a56d253e69256dac0 1 CHECKMULTISIG NOT", "STRICTENC"],
+
+["CHECKMULTISIG evaluation order tests. CHECKMULTISIG evaluates signatures and"],
+["pubkeys in a specific order, and will exit early if the number of signatures"],
+["left to check is greater than the number of keys left. As STRICTENC fails the"],
+["script when it reaches an invalidly encoded signature or pubkey, we can use it"],
+["to test the exact order in which signatures and pubkeys are evaluated by"],
+["distinguishing CHECKMULTISIG returning false on the stack and the script as a"],
+["whole failing."],
+["See also the corresponding inverted versions of these tests in script_invalid.json"],
+[
+    "0 0x47 0x3044022044dc17b0887c161bb67ba9635bf758735bdde503e4b0a0987f587f14a4e1143d022009a215772d49a85dae40d8ca03955af26ad3978a0ff965faa12915e9586249a501 0x47 0x3044022044dc17b0887c161bb67ba9635bf758735bdde503e4b0a0987f587f14a4e1143d022009a215772d49a85dae40d8ca03955af26ad3978a0ff965faa12915e9586249a501",
+    "2 0 0x21 0x02865c40293a680cb9c020e7b1e106d8c1916d3cef99aa431a56d253e69256dac0 2 CHECKMULTISIG NOT",
+    "STRICTENC",
+    "2-of-2 CHECKMULTISIG NOT with the second pubkey invalid, and both signatures validly encoded. Valid pubkey fails, and CHECKMULTISIG exits early, prior to evaluation of second invalid pubkey."
+],
+[
+    "0 0 0x47 0x3044022044dc17b0887c161bb67ba9635bf758735bdde503e4b0a0987f587f14a4e1143d022009a215772d49a85dae40d8ca03955af26ad3978a0ff965faa12915e9586249a501",
+    "2 0x21 0x02865c40293a680cb9c020e7b1e106d8c1916d3cef99aa431a56d253e69256dac0 0x21 0x02865c40293a680cb9c020e7b1e106d8c1916d3cef99aa431a56d253e69256dac0 2 CHECKMULTISIG NOT",
+    "STRICTENC",
+    "2-of-2 CHECKMULTISIG NOT with both pubkeys valid, but second signature invalid. Valid pubkey fails, and CHECKMULTISIG exits early, prior to evaluation of second invalid signature."
+],
+
+["Automatically generated test cases"],
+[
+    "0x47 0x304402200a5c6163f07b8d3b013c4d1d6dba25e780b39658d79ba37af7057a3b7f15ffa102201fd9b4eaa9943f734928b99a83592c2e7bf342ea2680f6a2bb705167966b742001",
+    "0x41 0x0479be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8 CHECKSIG",
+    "",
+    "P2PK"
+],
+[
+    "0x47 0x304402206e05a6fe23c59196ffe176c9ddc31e73a9885638f9d1328d47c0c703863b8876022076feb53811aa5b04e0e79f938eb19906cc5e67548bc555a8e8b8b0fc603d840c01 0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508",
+    "DUP HASH160 0x14 0x1018853670f9f3b0582c5b9ee8ce93764ac32b93 EQUALVERIFY CHECKSIG",
+    "",
+    "P2PKH"
+],
+[
+    "0x47 0x304402204710a85181663b32d25c70ec2bbd14adff5ddfff6cb50d09e155ef5f541fc86c0220056b0cc949be9386ecc5f6c2ac0493269031dbb185781db90171b54ac127790281",
+    "0x41 0x048282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f5150811f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf CHECKSIG",
+    "",
+    "P2PK anyonecanpay"
+],
+[
+    "0x47 0x3044022003fef42ed6c7be8917441218f525a60e2431be978e28b7aca4d7a532cc413ae8022067a1f82c74e8d69291b90d148778405c6257bbcfc2353cc38a3e1f22bf44254601 0x23 0x210279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798ac",
+    "HASH160 0x14 0x23b0ad3477f2178bc0b3eed26e4e6316f4e83aa1 EQUAL",
+    "P2SH",
+    "P2SH(P2PK)"
+],
+[
+    "0x47 0x304402204e2eb034be7b089534ac9e798cf6a2c79f38bcb34d1b179efd6f2de0841735db022071461beb056b5a7be1819da6a3e3ce3662831ecc298419ca101eb6887b5dd6a401 0x19 0x76a9147cf9c846cd4882efec4bf07e44ebdad495c94f4b88ac",
+    "HASH160 0x14 0x2df519943d5acc0ef5222091f9dfe3543f489a82 EQUAL",
+    "",
+    "P2SH(P2PKH), bad sig but no VERIFY_P2SH"
+],
+[
+    "0 0x47 0x3044022051254b9fb476a52d85530792b578f86fea70ec1ffb4393e661bcccb23d8d63d3022076505f94a403c86097841944e044c70c2045ce90e36de51f7e9d3828db98a07501 0x47 0x304402200a358f750934b3feb822f1966bfcd8bbec9eeaa3a8ca941e11ee5960e181fa01022050bf6b5a8e7750f70354ae041cb68a7bade67ec6c3ab19eb359638974410626e01 0x47 0x304402200955d031fff71d8653221e85e36c3c85533d2312fc3045314b19650b7ae2f81002202a6bb8505e36201909d0921f01abff390ae6b7ff97bbf959f98aedeb0a56730901",
+    "3 0x21 0x0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798 0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 0x21 0x03363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640 3 CHECKMULTISIG",
+    "",
+    "3-of-3"
+],
+[
+    "0 0x47 0x304402205b7d2c2f177ae76cfbbf14d589c113b0b35db753d305d5562dd0b61cbf366cfb02202e56f93c4f08a27f986cd424ffc48a462c3202c4902104d4d0ff98ed28f4bf8001 0x47 0x30440220563e5b3b1fc11662a84bc5ea2a32cc3819703254060ba30d639a1aaf2d5068ad0220601c1f47ddc76d93284dd9ed68f7c9974c4a0ea7cbe8a247d6bc3878567a5fca01 0x4c69 0x52210279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f8179821038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f515082103363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff464053ae",
+    "HASH160 0x14 0xc9e4a896d149702d0d1695434feddd52e24ad78d EQUAL",
+    "P2SH",
+    "P2SH(2-of-3)"
+],
+[
+    "0",
+    "0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 CHECKSIG NOT",
+    "",
+    "BIP66 example 4"
+],
+[
+    "0 0x47 0x30440220b119d67d389315308d1745f734a51ff3ec72e06081e84e236fdf9dc2f5d2a64802204b04e3bc38674c4422ea317231d642b56dc09d214a1ecbbf16ecca01ed996e2201 0",
+    "2 0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 0x21 0x03363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640 2 CHECKMULTISIG NOT",
+    "",
+    "BIP66 example 12"
+],
+[
+    "0x48 0x304502203e4516da7253cf068effec6b95c41221c0cf3a8e6ccb8cbf1725b562e9afde2c022100ab1e3da73d67e32045a20e0b999e049978ea8d6ee5480d485fcf2ce0d03b2ef001",
+    "0x21 0x03363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640 CHECKSIG",
+    "",
+    "P2PK with high S but no LOW_S"
+],
+[
+    "0x47 0x3044022057292e2d4dfe775becdd0a9e6547997c728cdf35390f6a017da56d654d374e4902206b643be2fc53763b4e284845bfea2c597d2dc7759941dce937636c9d341b71ed01",
+    "0x41 0x0679be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8 CHECKSIG",
+    "",
+    "P2PK with hybrid pubkey but no STRICTENC"
+],
+[
+    "0x47 0x30440220035d554e3153c04950c9993f41c496607a8e24093db0595be7bf875cf64fcf1f02204731c8c4e5daf15e706cec19cdd8f2c5b1d05490e11dab8465ed426569b6e92101",
+    "0x41 0x0679be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8 CHECKSIG NOT",
+    "",
+    "P2PK NOT with invalid hybrid pubkey but no STRICTENC"
+],
+[
+    "0 0x47 0x304402202e79441ad1baf5a07fb86bae3753184f6717d9692680947ea8b6e8b777c69af1022079a262e13d868bb5a0964fefe3ba26942e1b0669af1afb55ef3344bc9d4fc4c401",
+    "1 0x41 0x0679be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8 0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 2 CHECKMULTISIG",
+    "",
+    "1-of-2 with the second 1 hybrid pubkey and no STRICTENC"
+],
+[
+    "0 0x47 0x304402202e79441ad1baf5a07fb86bae3753184f6717d9692680947ea8b6e8b777c69af1022079a262e13d868bb5a0964fefe3ba26942e1b0669af1afb55ef3344bc9d4fc4c401",
+    "1 0x41 0x0679be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8 0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 2 CHECKMULTISIG",
+    "STRICTENC",
+    "1-of-2 with the second 1 hybrid pubkey"
+],
+[
+    "0x47 0x304402206177d513ec2cda444c021a1f4f656fc4c72ba108ae063e157eb86dc3575784940220666fc66702815d0e5413bb9b1df22aed44f5f1efb8b99d41dd5dc9a5be6d205205",
+    "0x41 0x048282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f5150811f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf CHECKSIG",
+    "",
+    "P2PK with undefined hashtype but no STRICTENC"
+],
+[
+    "0x47 0x304402207409b5b320296e5e2136a7b281a7f803028ca4ca44e2b83eebd46932677725de02202d4eea1c8d3c98e6f42614f54764e6e5e6542e213eb4d079737e9a8b6e9812ec05",
+    "0x41 0x048282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f5150811f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf CHECKSIG NOT",
+    "",
+    "P2PK NOT with invalid sig and undefined hashtype but no STRICTENC"
+],
+[
+    "1 0x47 0x3044022051254b9fb476a52d85530792b578f86fea70ec1ffb4393e661bcccb23d8d63d3022076505f94a403c86097841944e044c70c2045ce90e36de51f7e9d3828db98a07501 0x47 0x304402200a358f750934b3feb822f1966bfcd8bbec9eeaa3a8ca941e11ee5960e181fa01022050bf6b5a8e7750f70354ae041cb68a7bade67ec6c3ab19eb359638974410626e01 0x47 0x304402200955d031fff71d8653221e85e36c3c85533d2312fc3045314b19650b7ae2f81002202a6bb8505e36201909d0921f01abff390ae6b7ff97bbf959f98aedeb0a56730901",
+    "3 0x21 0x0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798 0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 0x21 0x03363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640 3 CHECKMULTISIG",
+    "",
+    "3-of-3 with nonzero dummy but no NULLDUMMY"
+],
+[
+    "1 0x47 0x304402201bb2edab700a5d020236df174fefed78087697143731f659bea59642c759c16d022061f42cdbae5bcd3e8790f20bf76687443436e94a634321c16a72aa54cbc7c2ea01 0x47 0x304402204bb4a64f2a6e5c7fb2f07fef85ee56fde5e6da234c6a984262307a20e99842d702206f8303aaba5e625d223897e2ffd3f88ef1bcffef55f38dc3768e5f2e94c923f901 0x47 0x3044022040c2809b71fffb155ec8b82fe7a27f666bd97f941207be4e14ade85a1249dd4d02204d56c85ec525dd18e29a0533d5ddf61b6b1bb32980c2f63edf951aebf7a27bfe01",
+    "3 0x21 0x0279be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798 0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 0x21 0x03363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640 3 CHECKMULTISIG NOT",
+    "",
+    "3-of-3 NOT with invalid sig and nonzero dummy but no NULLDUMMY"
+],
+[
+    "0 0x47 0x304402200abeb4bd07f84222f474aed558cfbdfc0b4e96cde3c2935ba7098b1ff0bd74c302204a04c1ca67b2a20abee210cf9a21023edccbbf8024b988812634233115c6b73901 DUP",
+    "2 0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 2 CHECKMULTISIG",
+    "",
+    "2-of-2 with two identical keys and sigs pushed using OP_DUP but no SIGPUSHONLY"
+],
+[
+    "0 0x47 0x304402200abeb4bd07f84222f474aed558cfbdfc0b4e96cde3c2935ba7098b1ff0bd74c302204a04c1ca67b2a20abee210cf9a21023edccbbf8024b988812634233115c6b73901 0x47 0x304402200abeb4bd07f84222f474aed558cfbdfc0b4e96cde3c2935ba7098b1ff0bd74c302204a04c1ca67b2a20abee210cf9a21023edccbbf8024b988812634233115c6b73901",
+    "2 0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 0x21 0x038282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508 2 CHECKMULTISIG",
+    "SIGPUSHONLY",
+    "2-of-2 with two identical keys and sigs pushed"
+],
+[
+    "11 0x47 0x304402200a5c6163f07b8d3b013c4d1d6dba25e780b39658d79ba37af7057a3b7f15ffa102201fd9b4eaa9943f734928b99a83592c2e7bf342ea2680f6a2bb705167966b742001",
+    "0x41 0x0479be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8 CHECKSIG",
+    "P2SH",
+    "P2PK with unnecessary input but no CLEANSTACK"
+],
+[
+    "11 0x47 0x304402202f7505132be14872581f35d74b759212d9da40482653f1ffa3116c3294a4a51702206adbf347a2240ca41c66522b1a22a41693610b76a8e7770645dc721d1635854f01 0x43 0x410479be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8ac",
+    "HASH160 0x14 0x31edc23bdafda4639e669f89ad6b2318dd79d032 EQUAL",
+    "P2SH",
+    "P2SH with unnecessary input but no CLEANSTACK"
+],
+[
+    "0x47 0x304402202f7505132be14872581f35d74b759212d9da40482653f1ffa3116c3294a4a51702206adbf347a2240ca41c66522b1a22a41693610b76a8e7770645dc721d1635854f01 0x43 0x410479be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8ac",
+    "HASH160 0x14 0x31edc23bdafda4639e669f89ad6b2318dd79d032 EQUAL",
+    "CLEANSTACK,P2SH",
+    "P2SH with CLEANSTACK"
+],
+
+["The End"]
+]
diff --git a/depend/zcash/src/test/data/sighash.json b/depend/zcash/src/test/data/sighash.json
new file mode 100644
index 000000000..1880e9721
--- /dev/null
+++ b/depend/zcash/src/test/data/sighash.json
@@ -0,0 +1,503 @@
+[
+	["raw_transaction, script, input_index, hashType, branchId, signature_hash (result)"],
+	["d3eb213d049a832bc8e1c61e0f1371714ae418237f197c9acf63fce44ff8ba2dbeb3f35137000000000852ac6a6a00516351dd7d61c25a60f20caf48f82b17766f2d90118a96e3854156c0d6956cbed0e0808de948780100000001658a9bd0693d5ae62793e7b79eb4d37b43327de95eda9d2c380e00e17c7fd426e92401e821000000000653ac00650052ffffffff78f86af520c313c4e3a3312861e337008d0ebd5f04d3c60d6c28fb2d62cb33010300000004ac6565acffffffff024409a703000000000080ab46010000000004526551acd861618500", "5300", 2, -1850779480, 1991772603, "babf52bd53cb32319849168c7b4ddc9564c5a06a1886ee4b8fca484d6ff8af8e"],
+	["030000807082c403031a80798e423ee0ab6b66e592751cb9b8c6ceef64179c8602b5a8ea18a506faf302000000020063ffffffff243f83975c1d5fb9aac1c1adc33b2896d509eaa50fcf6cbb2edd5ba280c2e4fb000000000400525163ffffffff0b9961c95296c66f01c58d9c3570b752053ef522024b5383451123878b2954f3020000000463ac6a65ffffffff039b3841020000000007006a63536a5251b6f48b0100000000070065635363536aee30c2000000000009636a515163ac6551ac000000000000000000", "655100006a0000", 2, 1201521521, 733220448, "bffe8fbbd897630aa5524b4693e6fd60bc5b7d996c5cfe565c24e119a66bbbf8"],
+	["030000807082c40304a19701086b6279609f89944eab02169e43568e3561d953111ad945903f429b750300000002000052ac7fcebf34281673b8800063b66a1eb1f84ce95be1cbf62b7d45aa72bd2e2982876b9601000000036500524bc32bb46066ece12eec4508cfce05436530377ba4695bd396f8592ee3688ee82d04ad2702000000086a526a00005151acffffffffcf80ce5238715d601a4e0971f72ae7cffb3139cdb8153cd2783dc9cd94ab5e630100000001517f685326039922ff02000000000451636a53b10a4203000000000763656a51636a5148acff030000000002526a000000000000000000", "526a526551", 1, -2099366258, 1537743641, "6ac231695862484a2a7bd2d7678456bacc9001d1436b492bf91854c21572089d"],
+	["030000807082c403022fa7d094521cb30dc1536ecbb1637d720215ce3a371075086dda7fea474eddc603000000065251520053653f29a03e115dcdc392b42457c992b88d7c3a165d855fef63ea181625d5f199516274596b03000000075363ac0051536327f26e4603bd7eb902000000000600656a65535174025f040000000009656a655252656a53630686a5020000000003ac5365d99afd200000000000", "6aac636352", 0, -2111468976, 733220448, "e33f351b43e70b31497580c4d6a48dfc675a69f48703e30a76f8ee22f981a414"],
+	["0400008085202f890186bdd4bd2dfa4ce2cf12b1a1f4f3dccda677cddd4208ca9d5ed09021285950ff030000000451ac0052419132d801d6ff5d0300000000036a6a51f6437586ec746209571f6603000000000155aa1ca2ef227dc93c147c474f64ac1364fcb26ea51029fc73f81fc0326ae54dc4c3d1651cee89545baa4ace65122202e328d0802e0d1a7f98da2d71c46d96733f11690a0724e3c71015d028e25a2cc761dacc8100da367a0e02d310a9d08b70c358c541c94b920075d4d1e25a5d143fb650ed655934639d1b18bdb7db7f6b03f62f8594614e446c456d547fd135f954fe84438f97d87c7e59a5beb76e9210971a94ca900c24387c6c84ee612394a91103945ea52983e8c0b12e7c6396d86fc31e4570cf8a706d15f6663f7a1199bff1fbcbed9bd821b947338524f091bc7f42f75eb93a5986955c385dd977ac8c81e7b2f9ac2be4a9641dcae2b2a53d5fccba4487141039e52e640ac098d14a49101a069491a93a940d76fcdafda531fb7b7f56dc11ae62cebabc0943ddf09dfadc8b2e939862aa60ed13497a1f6521ec45c85844fbac2ed98e1c3928ef8a03fb0960000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000021b9138fd437162b799ce399e2ddddb2a7ec476614c1f923f2894391f7d786b5a627fdddfc132f09174e03bc2fa79f68ff33c8f9fccb97d03776acac88701f90c76cf5a17aef77067f2b94ab9235596436fa532e8a758ef697910a50a23fcbea68a52af793d1506041b73ee0e6d5aa3c51a2aeb11adfb3ddaa9928db6aaea0ca60e15e219331e0f488969de0840fb45ce41a9e6efcbbc79e901e1e246b7f33e1e757b5cc0eea92bcfebcbe4027c07282b7c3e05922166b17e24b1c7e8fd9b22d015d410cb0e26a29e38995adf4152f908eb6d35742ba253825a4550e7ba2273ffd7afa6963fab971a4d3633247169996eefbb513667a202b7a05809546f3f6a07d6194456c807fc4e214b9db31cb7cf1a804fb9d0663702a3af0decb9d03a7b23d58af948bc0615d5a8ea5ef8446b0d26763f3431e217fa09222c457a08fc5021112fba38703da5f286e8c9cac2ae6dab5e87f0f873687ca9fe1d419257b953a9b11a7ba8fcc97aa1589cb2e5e6f44581770a2087cc0245eee29c30ac7c42842ffa06fad995cfd8ee1907a8c1d11016c5d2f1be3a5c3fc4026b40d7398e3f66ba7c4621e24fcb854e3daada282510e3efc0398605f632e54f9333050a5ea422f8063dd9d7519e0a3684f2bcdd5b661d25d1fac13ecafeb9897573fcaae93dffb56567ae15dc4df3d1f7bcabd00ac162aeec4b9b1a51eccd16657814a273713a70cd457501743b9cbca006f283dbf0d183d4ddbb133c5f3b4fb002adc80ff1e36fed5569fa8d281d0dc14f061c11738562f332d59425b7ba8874065d94e68ed818f7f4e9fb251ffb2db185b52d98b7dfc5a84a837fb5739ace4dbf0a645361dc8ff9525255d3eac1b97185781bb28a3d3a8bdd678cf2b0c86ac539d85e7a51b829ec36e3b2386eb4dedfb31754775cf7349184185a71f0197fb69bd8a1427b5befbd4f45fce5136a41acbf497fdb1605d7440be4f38d65a2b164be057fc0456166f22492004290539102805ff25715e44b8b38ecba089b57eb355184b38365fc7359a94f98903e74711807a80e46ee6db4208eca2a043cb9c4e354933049155de0d63dae5a573a0d83242fb35b46d9e69a0fe784b3c9a70031947464f12b096907dee09cc9682fe53d896ceb3476bf0e9fcaa4602ddd6c08e231608d4ef3cc9d8783fbaea31d3ce04b5cf277635d1b8838dc399d0cd277159706edd7e40c2973fc6f9f00202e54281421ffb7246e1efcdf609b3efb1c2b652115e615d67daeb199ac09d0c762d3259627d3d2a2738a093c11249385b66216b8a8a0b1766bf4be345dad4b0e4dcf85efff114411a8b0d3211137c063a0b4dc487e12b1b5abee28e079113ad7043c88b3f48f7a26f4aaae148c9eff3e81f8a75bc31c3dc49bf39c536d27d6bdfab408abe3e0b899ad52033500c2ef66e42c88be470f4c2a3d3834f403e5c428b71af961017e5b04fd7a7761183dd792086ad402c02f8888673dcc9af26ea84c64589d7584d575f5f774ad41409f7e6f2f4c974a7c280c94c03f2d441076673645345be3290c8af56223951e5db9b5b54ac42b393f36f2e45853104577101bb621e1c643012d1ad0027ec07a5025899491d1e033c85c9d9b9ea52e4217dc616b38462eb206fe627de5fb80ca19f43b015e2806c1e84996d86e73ff042f95d325d7e6822845d24b5c1d05ff098ca06e83d16416565cebffeff8ed7532f389eb1b720f1549baa65fc8c4b04691aae8f81ec93abd207026eb61e9628202f8cefc9f5dac155acc97e56c471d5019a5e08d05662b2aaa681af7ebf7b26af202d0334ebd1d7c423ac300d118afcc6efae9b484c105ae7fdd9c3bc86d8ea339fd918fd98291be80b0638c9bf3447adc4eda37888c11d87d350e05c1cc05b418605733435330c2fece5ccc920224144a461ff71d76ecb7f4a5d8d25affc1d513eeb7859f414de92a123c2daf59dadcc1274ecb233052368e577e210073ddabc3f691fd8f391636c0dccf7f4f28845393c932fd734380eb8a9aed3f1f7b79774512b8417f0cac2167f54c7d1d04529a2449f200780a946c23876cc7c54860226985ca63f7d0a0d9e4f6e04f36476b89abe60f03a3fb7e0fee0261c300e96748fcb15290e23bddf06868fe6cb3b95bf4de7df06c17750fb18a0d4afd935a68181f340c35cda55dc787083d7422982b39daece5acc5b9cf73c717f3b9d800cda3d166561a56a034589d7f56c33599e4c1e42ef2a393ab045d7cad23819585cb33a19ffa6ca00da28ec052b9e26240662a9da99a82a90991f666aca185f04ebaf8ad972afa56769c74143dce1a02e23dae9078b7ab610a51ea9b0b2702323867bc76cba6978cd91e399728a581f8e399838331f4a19318e6f02bbf0a07faca006d1ece5dbc4ef60e4ca9b803675f0e7b952bda1c38fafa67f0ba4aee228e01c616df001ea19c6dfc4447c613ecd9d870887f8538f901ab7ce34ca8d50f4c47a85f8d9a28675d7745b9e9c2aedf456e32642b5b04cc5ab6bded93e52e74d7e96edcfa6814c3c4b06bd78a74e4271acadee3c12547323cb0baa4ff51b64602ffd9691519fd24918b25162d5f705b3b18c37bc090f58e921a1d02975b47ca04640dd64aad692a614efbf6046d2a44163ed6eb29a4914f4224dacb7c45ae8f5d0b8bea91043cf756ddd8efd0010000000000000000c7304e01000000006a315cb510625d07cab1eff9c4f690e8ea2424d6523193128c4ff29614fca074145da4abd63d5b9d4d0cae97aca87a9a4ec8037af12cddc3cc35d2fc581a332bde1da903c042a1285dcb0de071fee4c0f88398744357284fcc6da9784e91f44d00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000636e479fe29952a7011be310c3944f7521fca4afadb8dd8523f3bc70fb07ed6b7bebd412109a65425d7cf02ad41d30445613d9461726f2cedc93009498ae95d7781bc7df42cc09f82384d1e1203900e1a35e5ef026589967b05a119b7e04eb679c3121d6e8f94e610971838f1948df59b9083a88f630d5bb634b693a2ccef4cfd186ee102c3aa49e82a29b906037f42d06c92687175c15c077fab1e1cac6e81be6ede64a63277e0d6a05718c2a9745455f44efe31f368041de73d6b14b28c4c90dbc2c8c86760089cb52a412bb79eb27fd73b95f8bb5aece5a868835ec75e8661b00d240bb68f1bda15d4ae862ab9e7d19dd33e84f3a95297b65723cce592b25ff27d41fcc6265ea8cea3dc3d01c627b2e03bf26eb2b9f98e8449c7e6e2a197f2fce46c731593501898afa7d6d2d2d2a753b23548cf1a44a3ded9733831133cdb824cb446ace709a77a6e28aa409e048851cee860afad6b463bf4df500d6953163e0cdea61fbcb8ff0239e58868413b0179f62dfacc74ff65a6d4da75598b2cb3c1a328b0045356658eab826e1b876aae8d3a4b3d16177abfa41d84585ed349833774882bccdce1cf9522993016b040acfcd87e6653d6508a9884f0eb2922c4dd5b7aa2fd47336719cd39ea954583cc79d4ea1b75de383b8fc68cbecda7045c76b00553669d0fb14256bc9c54cb02525001cdd3c530e8f45b4cec1af5a1498ae2efa15deb46b7e872ccdf4335e6dded2f895d0f2d526a61436038e38a6995537b3833ef63a1852b790b83879bab71af91f0bebd5fbc3ae6173bfe2210d22f91c50a9fd8b61729f1399156321ea4725fb0bb3ddf5c6f9153903ab96cad3c3d1c8078ab8fcd1ae5f32a2d6a250dd99e8ee40f9b96e3224d40736dcb08909bc51d164ede53382b6f68044771a06219afd87c18338e603c23ff8d13fdd3e01c9affbb6db2d4913e1abc1917e22c6bdea253ad01f5dc7f1ee09b3798a59662232055d90ce2078bad031ac359a488942e5610b649dcc22b86941866b3028dda00cc240fc9a8771056a70befb9af01580bfe205a02a03b7f16a5828b8b7931d308010361b3e836570b95ec6530a5fa180727378d8b18f3924016cd1f6ef38e79992cd7a555f0577a1fa25558f8767b672cabd22f31a7d785675b0d63ead186fb7c315a033644517193b4d0cd57ed20be120e04a41f96fec334c4001117f546545feb6eeaac6b9b3d024d4c26d6e522bc379b57a1efd7cfa81090039153a5e77edd53926828af25cacb1c2586a4742647d58eb60faca0ba2b73dab253c4af0fdc412546ce1a37df2f3eff5909191b64e8629880f82aae67e9ecd83bc527efd161a9587943e0ebe6e04b0536b23e3048b84b7084af9a09a81484f76465cff280af9431c8a6c86c7d308c685db086b9ce82cc048da1b655f5b1008e6b5a2725aaa08906a6e4a831750767441ced33483851cfc064c08b0264d7e14e85dd62b2c8da563938c36b9ffb8c77e548ea0819f05844e884ba6c237e2fe1ce26a5c2efc54ab3e7d6d4fa025a3a21bb05cf0df08614837f02a3360736825300904728277a7bdae8e7d80bf36b8d0dcce5136cd38a5c5ead2d025aeee9659661c4bc581268a94f7c09db4073cbe5b519ac6f77f9bf9e47937fb552004eae298503f8ca08eb3687872270976a9ab8989d2ab1916cea51f5204ad1e936e037c585bc5a859bf83cdc1487f76b25690ea58d997a70dc87880b346387becf2658a942bd52dd6ba19f41e13a509d4b3d4bd3e0681b3b887a51dd0233b2cdfb495d8a6db11bfa9b60fcd9939c8ff0d391ffb9cca715ba6e07fd65e3495e4cfad391ed55f144bba55616687f3accdae153205e613a6a47a79bac4e5843f85789589d6d1ce7af54b5c3127b8fd9ded117b4749910c64d04921cf164742ba7c1f7685befb3bffd1bf3654fff9e0ac85e0ab6b2d56af13836a9e19dcbed082fb4fcae90a67f6a059072a286fe2e22db9e2b4b0bac92ec0f58b10b3eb2ec3c10227873554d90fada5742c5a2db9a38c71f1a30e551c91d0ab038c4f5f0cf4222af3a7cd1398158ed4827466ab9ea1bb56892e9184282562fd4f5621680af8652511eb4e6ca3253f992bd03abe60347da2618f83364aea9d72c0ec8295c38d9c7f496df06ef37d7652fb1465f398b465867c28cc34969abf520e31a19c39158164aeea2a10115e85e13670ddda4a677bc70ec0431d2dcdfc5f0f987b97cb3f16eb47fe9fc9a0cfc5c6ae7a92c3ecc734bf0dd13a21aa9d9672ba67e8517503f8a20b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "00536552", 0, -614666394, 733220448, "b45d939bf1d079e6cc456b5a096210a6cab025d4766bc0a76c130bba3bf9a4b4"],
+	["0400008085202f8901709087f7a055f6c005a6219d3a06d63c1cfd34771a8d6653b20d2d765fc476a702000000076a6351650053538fd087fc03366ae3050000000005656a52ac65cd341601000000000038676605000000000153a28faaa400000000877223020000000002cd4b6718f17f823ab197e733e5cd574e6619f7c79b73affcfb3fb9117823479797389aad81488f380a2490799c20537c5ad02cc3ada0fb024e2aeadb5de36730928c56fe0d36738bffbe787aa7e342da00e893ccbd3b4369fd06a8a56de598eff519fe289ef16ae3c56f3d826592e4e7974dbaeca85806e35b362e86c8259d4010504c83eb84ee9f83baea5915516401710e4cdc17809f7193b94d4628782d00049f80fa1ecad1380b0bb1313ccfeb763b61c625ec8ebc990d44a9afbb82358017985c16651000645094db7bd162c487b9c8a96755cb357f6369b574670aa43650febdd7005775ef96923b76dd572e655f1ada340d654573b3471a875c38d4c71acc7bbf1f3b0b86f463f089a098b0934553578171994d1901f20d8f4b17f19c8850ce55addf143b68eb29c22fabdadd9fefb1ebd25dfee611915d978595ec5ed13a21aa9d9672ba67e8517503f8a20b000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000f9d22ccc24d1ffc9d3718bd68293f0cd3a7584722fc2e72788329cbab8a93a3f19f618bf7dab9c9b3b01d6771676a2aa4e1808d2ce53c7941c63ecb51198896e4201951dce1ca87fccc8c290d3b33f80533db6fcd92ffa6b65f9d0e78caf5a47a689fe106d71cbbbe0e57be40965339ed7c7accb6bb0167ecb3ffc4866d5ecd8d2299cb8c1fc93318fff28806100038831331c2e1dfa7b3565f695aefbb26ab0ce3621ed508e257962940fb6249c7940d73990dae5c8e5b9ac432a48d9bd79dd117d1ae937eb59b95568bcf275b4c43ec4b00baddade385e0b276bb4d96bc14d4060cb8fe0023f9c227634a8804db7a03981496de298d802741e2dbb4e15d72bc96ec9d5c3b3890aa3b49736fc7e3cae0544af2d50a08125ff78a10d6a5cfc0ad314653b8e2f5e053380f0ed158bb0a154ab6273956479b698958af654c72f60d13a21aa9d9672ba67e8517503f8a20b0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000297a6aa4b7a6fff07970ea681589a3769d5bfd9f1688e614d7ff5d565a31f149ff98703cafe7913d576d5a2f796aca286691ef2aaca8bd058f7df3d0bb1d50d55654b9b86da3620fb40518710bd04dffc16748f2b0b0d1a8a27024f20c8572d3e42f2a636c9c7f4d3f9e0e7c1ed65a1eec1c42ad38e8c947ffc154893a74d52e97134cc82d1644006d13c7d1a2ac87ab53dbe4d41dca6ea9c67ff50451e814a4ba2c3e1478f504603c28144c976e97664ee7e56d1657f37bd3380877b6e0c950bbf527ada3348e89ee4ab66d44f49cad03d39ff04c01da551863253d226238676a79abd3282fb14dfd84590a52a29a6fadf774120c739b6d1aec3b14ff3a6cc4a793d20378f462cd85579bee055e855724ee788fb5d3b9d1ad64960d6fe8445975a02515aa2e03ef4a989afa847ad30ca4134585bf19438ee218699301a20bbf618e30cc1f9f88e140a5de666e1909506181b10e84aa0a5cfc08d6cf4d44e8b7ee5812dcaec935201733097cf7ee732effa8fc2b34daa482690c0422342c1afd139ff8fb6def0cbb6aed75b34ac39579723cc7521e8ea0dd80a7b294c08c992a50782aaa289ca69161e7e074d9a06462f2b407751fce7a44d31b99d7c160e68e3f62ab2b2be6e97e83ac40a74f04ab4a8cec4dec9287eeb851f5698da1a60a56f4cf69268d2f519c0a7da4e3c927493a7369cedfb57756303ec43c5ac15ccd4d2e7e1158b43d74607d6f332c5333c24db312bd45f33ab038bba5c32dcde8d572713a008c12e6e9e82bd98b871a0a52462a38a2f2146d7dc83d3a4dda277fec77a703710e21d0f6b5fe03752fde35eb3e688f4a1ed3f4228072c1250f056de52182ef5df4afa9dd256da7bcb14585ff7fcf3101a795a8ede65e35a91ee54e87beee61a27a860ae51d5dac9cb5a3e90ce3dfa9c8f9e0704134bc18cef491134e6d6645c69c0dea4702783f07d281f34bc04a2ab509a9907c01c7783c89c49990db7d3439785599bc29ccec2d0bd5d87f9a53b8df96ca88d7acdf270db44c1d7287f5917b388c22eae9695b524f533773bdf47573d93976470e18195f1dece3a3f38decb1e02bed8b5ee598352f78203696f4a7820bbfa82b243fa515f5d645f75317574313f40a3aaa3f2e495a971ace6e712ef9b618cc9ac3bb1c44e51af84df14d0715514d71815df0f2a6e9ae87d47eeda795bb098c6ec7b4df35efa055cef9f1b7778c16c88dc2e48ae528b24bacd173569978017ceda1968cf8b82af26efddf72b316aa9ad3e065e8c27ea5fc3fe200195d598fd314302ee9e4ee5f95bbee649ab3c564420eb1aff2d78ccfe42ef9477ce9b6dda6802daf508ce33cf4a11d2d9a4a338c3d1cedb04ffaf0dc08ae50b51431cc724c71cbe8a5e1d5fc17c4433bb5a600274836764b7db37b28958e145c47f8764d4ca1dc1fdf21ad5ae6e53e6b5fb3678ac25ab1755e99de96666146d8eaf41d7c5ce8c074a65c3a9778e723d524424e4a6d830fe8b34ed8f1e0e54707da37ff7da4e173776ff0ac0bd37737b4b74c3c6a129be147f74f4c15a8a7d61f62db6e159b9995bd4a667fea680844ce494c9207b04c198333318043c3ce7ab110e9d5e518f5b3d3fbae9c0a39b10c0afb1bf34e010934baa1218a5901c19dc8499cd5ad632a8e9e7c7f1dea6309001e754f3d69dd2773ff2d40eed992ac5566acdfafb10a25c8e912f32abe2b16644967498119fe593a19f9d395f78a8b674c6f828826dad2e3ddfe519ad50efe5d19cbb141bdca96fbaf8535ba9fee0e566a79ab2d5c15ed28f743f985aec89b62a71d408b5440058340b190ed60b142bf098cc25ea6447e95a006c392cfd16f4e8012ecbebb0a4d1d0cad450a592a462c1924e7971a07d637caeab4e3d80fc897ad70d149b038d6779d4ed3514f70c3df1c15836dba6d09bc97ae89f4729c4d5c6e4acf28247917b8ecafa58fe017dd8d2a6399943f3bca8f5827c238b8c7144adcc2f1c5ef2018f81615dd8927aa815adb7c3b350c2bc3b184069328909471a81ffd1c5e253053782dfcdf6d7313399e5172a566034a7e2d64a57336af8c8d5812a6b702b13596cc384e6d5b25c6c6b1afbf52b78a3e1d6d91586da0866eabf9023982f135fb6291290d8531a959950bfe65e57c140426bd108d2913504f0c7fa6d48cd1ebd58cad3163aae8abce718a759f6c6c0c2128240a891a96c6250bacf96d3d6533c7db121ad2774ee98d7212aa32df6d18080037d43ad1682bcd4c049b8742a358f50f8982f0f3b97bcefa89f20a9c926bc5a9ed7deb4cac89358e3321119674deda733818c1019a08ecbc9b9d72529381198b9009515e34d7b0d244e015e88bdf51f9fb1707ba04d82d604ea5ec495b8599083ccbc1fa8d833ea419b81d9d88f7aedc8250639444a45671ef96e7605cd134c3a3a0a734353349623ba3c2e0ee0c0bd7658f78479528d0c8d6f00408714ae19c24eeabaa6d26e89b166cf6a9aa55ef6025d676f4551d74368d12e808074b33557cc8373b32524e2126f0c8d9d28745c72f7653175b75702c68555b9a03462f1f59063bb46c049afeea865b2c9c188d3e85a35207833d38c688d06180d7b25651dc932539f3d0fc745b100cad678496949f00db28890520b30daeb7f69688c9501da76953c00a46245d7ceab38f211af504f016f6a3d00000000000000000000000000e52255a8e338cc950300891c599e7da1c6753d691a306f844877850a06962bf1a36b5564907f65633b6a4fcc1993053074904fc32c5222e0cc987dd78eface22844d07cb3820a78c502b8b367bf95e1cb6d857a364556598fc7379a98203b8ae00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000fb86c8188595e3625962402c61a657489ffe6ab650f327f098c6fd4c09cdc66a4d5ef41cdac81de459663e27f823c386704c90abe564c0d20966ae05fd88456a09b5907d837b55acef45156489cd03dec659270a73aed52f060c202d1ebeff7f59e2e1442231e9c50ebb0d812bae98c83f0e808a9a9fd20aa4e47a7aff0650d0ff61eb887ca9762e531128419f249151feed645b2afe46107850ad73994e68819bbe5aaad9099d7fd7af31a2a8d4ac1940a77a2184f2ac8cc075abeddd043b009a84e381de617efa1c3cdab91d0164ae23fa4b9bcd21c970f74db507f2b985dc440c8a2843d868e5db4672f1e476bde81c95d9ede4d655b3bdd07102f077f785d21acc826d6c96ad18505b0c270a4c290cfa49cf64ee796cac4d54ef93231fce46642128c01fecf1cc54ec9a816c22c886a83e8a87adaf80c15f9e6412fb5d0bb8091761fd5270ee1620564e5b51881cd2e7d57c8f12453a3bc75434466373e9b7454877949380d5ead5d102ea40dba481d08d454e6c6f561bcfb93c64a8fdd2230362dfe8e7883529a68018bfdf978903efc902fba6da6df1e7ff0614a876666eaf1cd006301cd8fe69b99c705879115eebdc80a187c1d627c77e490fc5c762c916b96722319332253f60c60c289a5a306146f1c9ca3458debb285e41f69a8731d92183952c3fa21a816b47e2fb8bd107f2a39c654cc15945f858c292a07712a4f08f04992bcaf4e7fdda2ca67e8cbd7e41145d4efb7a39764ab310b67335feab78d1e11533cc1297e0cd5f56e819087e1f40adec2f2749a2918222de24f151f21563b798da0f9c1a0bc2dc9462a2574c7546d1fa10465dfa5be6a8d269873962832e886fd387db1156dd2fccd94dd6ca6f34afaaaa14dd7df06d90cf18d341f89d281bbd5040075b5ea2634db23210638b1c37ab472809e79eb12cc39be2d45054731dc69341bfe7551cd434503317e25535c2b1a55a3460def356541b5425bff99b747d178175128af6ad7ebdaa0b294a40999b994117ad9975e402ba9e9edb92a3e5a7698c64f937b2bba4884c482af63ee4aa3bceffa7d66dbf8d9c9ceb7ab8b7f01525f0b944d950dda0790597a75d1967bdd4b970275aeae8305bbfa6724845ce1133f09c466bf6d43d84f5060f5c92211d62a478af2c84b42c7f3177e89c986f005a3921e3ab6eb9b8ee913c5e3c4204f57958fa3eea519c6470f2c9f4a2ccc47b2cc5abcd36f9b48f562b8b0271831f2acae17f826000d5401ebffa4b885cbc4db55b13e2085f49344255a1551499c586ac1d55ecf0b6699af6ada3e2c09f93671db397bad0c8c0f0b31e07d538baeff1f170158cecb9454e985266e29108619f5421c6a17b84940936b4618b97253eaad694ac0d1a6fcc09db73797604450824333eebbbb93cb963e092db02f90ba37bec480e6294736ca55947fad3dd9167aac66c1e8708b4285ab1a9ecca65ec351a4653f2c8730a84b108f4cbd9980a4a82adf1bdc33fb7de9dfcc37e9bbad79cfab350673aafaa13f4fa13381be0dd5d00f4765a5dd99cd26b00d363f94b0d762c97e64c8ab9a602b47258bd8ae49cbfba8cebf19c3029f218f19995efb9b5ad37d5acb1fcf6cca91565517f80d3de7529500f24f95a2f2343bb427e12538cac1778f12ce1f4318deda54eb5b6d98b9b2b474643ac4c999ec244730e48edbe5f599bdfdbda074862812bf98d2fd4f7cd378d9c2975d0c21a8e11e4a0786874f8c4b3f2af236c7197bd1c01cbe94250ceb25c7fcbdd5e925aa678080dd8d443c22260cd33a9183a5f129fff5d7cc9f0a612ae414a153f7f8941a9cadc70ae3673b0ed7eb39b575ce589c9b46ca1b589ab58660817046978e6b9d0fcc5310d59c9fca0bd7598c6f82e3d1cbc2671174c95c366bddae3962d57fea3c85051b431eaa9f624a436423319679eb57f3398200b58a8466c2e56f27d02a6e6a8833faf9d40a3e3f966cf7a36b156f1b485730cdb7de4b7be387f14f8fc6dd834a3817b26e0fe56675701ac77b53a6cd39979907b99fb76fb58db08edb69a471ead50daff07ac9310ef2e15025b5025fde91d63fc5b068e7f705b43265c87850d3ab06ec79abddd984fca7398458faa49179ac52a56670843fc1dc9e7730088db085ed48d0d948a0fffc25cf2a788d21bd171d25e995ecd8a9ef5d890ca19b4b8dd88b44075f551671461250be8cd5bd272287dce90f071ec990eac50e5e34810004663037bab967254794fe5773e0249a359d0e10d1405143a1b41b44568fe79d20200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "6a635153", 0, 632861428, 1991772603, "a2c051263d6524ce728379afb092f8c1057f34c1390ff6da189522ec9a847313"],
+	["030000807082c4030426584e5cebb609e26b0b88d2181cc3542a87a223b174698fabda4fd41350a60d030000000400516353ffffffff34f3324ef8ae913d26ea57fe6225c37d36f63ccadf12d2023c2301b06eb724c90300000002ac65ffffffff6323ad3ace661dd8b6f27ccd95db8f6d0916a4074528f4f2d30a508bf0b787ee010000000965ac6352ac536a52634cb6cac19667adce27cb08b5dd91080c658afc8c4dda7bced091047e1152a4bd8a8670050100000006655351006a53ffffffff01b77feb030000000004656aac5178fdb4690000000000", "6565ac65ac", 2, 2000788494, 1991772603, "a2706bbd3908670a1d6b72f554601dc94d13f9f8d95d0284cfa6f00b1a89d3be"],
+	["cfc3153102003fb803528b7792aecaad2facd147d3bc63f12cecb26b46c22695c896294838000000000465ac516a6e8ce00cf5d508b3b24be49fa387cef1e01713408547d61c29f233c8ce5009d6bde72340000000000165b68c216f036660790300000000056a5253ac6a2c0a17050000000001655b671202000000000451ac51530000000000", "65", 0, 715866192, 4122551051, "fc7da0fd40df9cf56b44fc9d60effbd30816b039b3838aeb306ad39aad66c55d"],
+	["b0f61144012c61c5852385bf7f3971cb133ce70c04f784a7d98d158c4ecbf176a21bd099f30000000000ffffffff03248bdd02000000000551ac00655340e4720400000000066aac006a51650f5ba80200000000036563ac0000000000", "ac00636a00ac65", 0, 786677151, 4122551051, "69b181694208b4e23e3ac7727bbca19cec1e3740a33ecf7323cf4770f2aa6a12"],
+	["030000807082c40304efe3880c2e6e85180bfd6116180bcc11454fe4778715bbda6b4343579b68636a000000000665655353006ad7145c627cb3404fa758dd871a00766100a8442d90c6ceb1d36ee04ba12054fb9c0fb8eb000000000553acacac6affffffffc782939a44ff0f0cd388cf78ad630f37fd235ff404611ea1b67e209512b2b9be030000000165ffffffffe82f1ef636890148211b7349c9b0c396f129fa5fb641fb0f2d090e0e5876f7a60000000002ac65ffffffff022d7d95010000000002535146d1000500000000005a457331d0c6a21600", "ac51526a6a", 1, 1521928556, 4179206552, "88ac315c7ee8c29a479a330de9531e140a6a6413d35cb2fe0f48400fcb6b4a2d"],
+	["0400008085202f89044a203ea14d1c4e9b1dc75a6cddb08073ef4213e9299013dbfe20128df9a4b083030000000007df05d7d6faaf3e38f5e8939e34897eac1c38eaaada3bf79ab51b26c5114c6a839800af0300000004536a6551f5b7db6280a0989dd202d5d5f97209aa338ad4a91b364ece26ed3e00c8d8065fc76320bf0300000006655253515151ffffffff41216a984de52f5f82e57a2bb385e4beffa569462a8374ac3e444c1dc3230f4a010000000500ac65525382a09d5403f44a03040000000002ac6a67f9b60500000000025351b32a41050000000007ac65656a6a5251bc9cb49300000000eb8e670100000000049bf66f6cfd201e1ef402152e1fba2e7fbb9780f0b25099df8172aeb08e59ec38c1e67ab0de20dd1751f362c470fa79f28bca2b7a2416f590b76b5032aa3efd32f5ffda252df50df5a8b6ccf706dae8006a2a4be580b9c7961c71d741e473e44beacfd93217e563e86a840cdc73873e7d4fb4979edb4d14676cbdb17468bb1b62d0e062a6ad54880dc8e0b48c182242ee6c5681bb9b112405d0c835de9fb45ce462b9750e2fa1509f06391d3cc59bd56a13af88e78f6fc129ccdf64168dc5bf64d6a856c52497b60e05a39eb593a82b032c62193c4d72243e4e052e538449d395d49b1106f911558ba015c59c9705b8a6a8b7caf7b12141367e6fef183cab6055bbe5ca867c5c7c789acd4674eea2e0b1d1718980c69d2f6ebe95563c3fd4ebef6c519be00c2222f7baf31fbd3d21ba88526e512af7abc3b0f8b299a5b8bf92d3d0e10d1405143a1b41b44568fe79d20200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000025268a8716ba58eaf6a0a8e441732bd3850303d7eb84326b93951bfc3d7a98d6df8b7c739f638a468996f161a9159267724a0ca4065a5a3b65f83e1937be4907fdfeb7629a6c73802c826ff3520e33cb77ef1225ca34220dc07acdc7aca51c2c54c120d81516433b1f771e3407a4cca6c1e0a733187b08c80643012fb473ca9c0f9701508a0cfc08d4acd7512738ba62ce76e28695855583957d6e85089fcc8742edf78bf2fa916e3fb355051793d813c7120563b203022ca99fb8172018956dd384cf13191d75566c4adadc2a3f837274bb52ac6ce916970e53f69fa689c32b88a35321d6e73315c78b9f49fe09d95bc9df6eec22318f0d5dd96ee485b7b703dcf35235cc79477dc1d34ccde3481350a4ae3c300f83f08ebf9bf200766aac439fd06ec078f98b074665091356e309d7ab319d1fc8c3a52c738eb7d57d39d274d0e10d1405143a1b41b44568fe79d202000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000a54cd804962f868ea3b72126a651b25c280f3cb249ebb41fa06a78b00db634a7ffa45efbb21f6353c0ed81dec36940b428b551a90273519a8625e7421176213cab0820e54c9ed40b4c54d86f37d9135e5a9a83725ac06ad1224039336e9be3b61dcba56721e1b75725588c3260103365f1adb481940ad1f63e923bc8db44fa5865b0d76aaedf4053f9eebc4bc71fda11f39b277fd9ae41be4d53733be6730209453f6d3a5f49ff966714a9873d762234caa42c909e0cd8dc173035dd545916d6a36a507081168d02c7bfe659c2578223a3d6dc1e0aecd7c5f2ee2f013c1987a940bfb2f6e52b2f2ea4d219eba2d4e638cc585c80b8c57a3a359e9a1006598dcfc50cc07b3e5cb8de17c3edd81366dd083976111037434c8b407b480073c9d3e29220961b002437c2d37951be12187d80ddad85aacf07d6e5ca4a73ee784e4079d0e10d1405143a1b41b44568fe79d20200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017eb14e7aec40e117fd0cd01390a4c3e5145fc12d0c9e7e9961d8452aba943a06146618b7d6af5da50d25f73380ad0222cfa1974587b2a2337a4a4462a18050ca8110dec0b67efbda09d415c7770a6394a014f39ab98628a963d5d22e7737c317681713fe75cbf3bc831593e4f6778c64d3821127ad8a0b0c9a455a66082e7d3825626af20f04b35b3d7ab50736223383cc0f0ddc611d39fb4000ab3462f061b2e2bbcae79559b915c5a1ba8d118b7194f3cfdae7ba9229964316ca16fa543bd4b2b93ee5563d701be5d0b9ee0f70a67343df933fb8ce2de234cdd5ee0fc55f082e6edba036b3959d5071820f9539b7c322b225d7262210398231e29b7ecb37487f3363c61fe337ea6948fed67b4ec0f85898ec5969c2bc2c272862fed76a5035fd9cad5a635778fce6f7ebaff60cc19a3a6fcfb675be6e301355da8fb6f1226d0e10d1405143a1b41b44568fe79d20200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004cfdc8ab4b1c1da8e659a57cd4175cd3a7eea9b1263d98fcd46f0841e13870733e61e68983653cd6727cbd60b13e4b992ad5102319854c17956ded82148c4ea16420970f47f4bea78452ab309ae4055567b7edbc0accb398f33b6c69443369cc81e498fdf57ee4fc71b4096df2831374e7d6723a601a07f631822df2809672ceee04eeaac378eead55f8c37d9813877ca7781f364934dcc2f93afbee557193a443f77e6e0aebd413b24c265c202dfa9b0d52c01d3f4d52c19682210638a0e3945e430e3d9b8472df7b99e26bebbafa40985df21d0b1336c62b705eb4b53cb843fe5285a60be79c53a2cbada0745c4abdd738f0da5f684f0994322b8a0538717c07bc37b1b86e37c32c39528058fbc82fba71359a59145999ddae82e52e88a965d5f3e6a70f41cf03146b6f96e839c8b9cebdb0ea41949c9e523a16d1b5e211c055f4f4c947abfc7b82e52d2fee0be64f8a25e6ea5aae60518e92e5b4a28db8b1e8d98b30392048d18c18dbb4ccb593b3d6a51bb493f8371f88ce8c17cfd57d69229c231cd54596c7e5982e59f8bf46283baf362ad1848b1857f91da50db044952c56efa7442ba7e20ec91f5af2367a78fcf2b975dda9e63418468d794ca430aa25e60132339ba58909e86e31034f5e3bd39adaa77081a808fd7b9ac2d6a7ff191473f2ee5b26e94c1284eef2c603f141bc5c0d67befb2cd5bff32fe41cfc8d4263ee223209154dc0222952b0430a825da75686b8fcba3c7378507e24f055c88a27546a0cf1a22957019d6dcae6f034e8417ea2254b5c6b23de6174465e0268339875d09f383ee215593e93bc63300abd1f32f967fdccf84b03e8822f3f3defce1ef8933a43c727abd2fca4d530d9ac219c388dfb84b6a56db8fe989184a2917a81147277d785bc18732c20e98d09f5833816b0d2926900253baa8b1627de743a2661c8a8f88a196eb8968e59e6c52140b687bfaa1b1495befba608b36b4e977e922ac528797da0081d5ed2bf5a4feba351310beb61e1d348f1f6c179742e223e4624276149ee1b486530bbe586fa39a922faf39e9d4e9d21ca1616053647a047ec9c869b44dd1e4eaaddbed8be80e9f100a946dd136ba37180f1d7863ac2dfc2db89201e9c65d43118d3f7ad9d459f816adea90518c0423bb4ba6f61f9129342a9f7a690a95f7a78ca121e08e766b1569acce588255d2efdcbe4b5c231c1e5b4084ce18fb71ba5b1b4763ab6333418a355c1ce5cbada2d0a44f4f78826545b8ec16aa717d0625f22ec5328ed202a0902b4bd95d2ee7123697fb8a0580361623eca58dd0faf20e0cb58666e6d913068f269167e570507453f81ec9fdc200c37bc2a3f4ea4aff22d329084ddc95f9430b23217eb136fb17a3eeaa07e966dac263ad32c5f890c1bb29a786a92f50b07b04908734726026eb25203be9d91ddc4e060d01573fa8897d6cbf0c88a7bf67e4bc90ccca513edae58b7d3634ab49e2da96312e858f494bf56f75e53ce484492439b0c0c1369a778023861fe8da520a18cc49bf0b1743a3da8632c03ae69157847541cffecbb97ebf7ba7b22d6f636f7b9e548cdebc29a9fdf07d0627b4469aa71438338546f39a7ab790a528c70f9d5a6d87a9e4bc951b8e742c66c1d40c4eec76aa30ddb0070a12f40d1e9cfc831949cba74a548e39c41663caa7d97ac7c83faeae49ba579cc16e655ff4b64cd9e61faa2bab0b07c7457a09bf6cfaf799ea47881f750eb902c61dc33b0589dbcf474462cfb8e4e1d1dac1232891f8d2638aa066284fe23e0b0460ce50f2205c4d6a0dce716722b335171b42c6242d92e2674e6957e70cb9956298abfa19359f5bda999dcd982b7e66652e9264e53c78dd540c3c3d71ed754829bb4b03a4407b88638d55699ca4c17e48dcaab50fc945637b42201741302ee8784a6f0e992b73396700e419faa8ca7594960f918c4d2ffd1be3524c9163e1ad55099d44553cbdd276327b0f341d4d94ad186e32bfc164291af82c7a9e7cb8a7e857e0fd738ea2d4c9f9f70d324fbe730ca9aa6f6d5b58c6df2cbeff7fe5345fd66b8a1b47a3abe679f717d87eb5de4ef6aeb017f72a5e190f045f54558c22db6e8894503a6ac242bdc7c7b2bb66bf25a1b7022f024503ecf32197ba082137e45dd9a11dfa1fd37b50a68ca805708c1dab9d06fd0fbd61884a73c7df36ae117d95d875f21758bb5480428b5e3e322439dcbf568f68f17fc58ba189848edb96cdc88b1d51551ccd6ce2760e6d3694778019a422ebb4d344e72817f4b8cab0ae7e02e3136e3a9ad0452a04614ce6f6f49af4a17ab1e580ae69647a0d90afcca7ccde572503949f29719f142fe52ba8c244d33d0c736d0abc049e56bfabe637aff781668538088308d3594d6311becf07b413624199ba862d6f387a38f35a83d307df07e5000916f9e7f9ad0e6b885c8dcc1fa9dc7f36255ed20c3af3f5ce12b869f1859c9119e6e09c39295b3ab7f77e082dbcad1d663effa7af0fe9f34e69011815d87c72aefb5adb23707e8461a0d6705f7a66ec337db6816b257b2255722ae94c79ba4362f9f4b10c79f855e49f8e05057cc16f5c4858bc5379777620a883b0a686c9bd7bb6d4d5e9e46b1f9b71cadf346a6f97a70f9c6463d0e4f18e08a432fc0d0527408f1d0f3a46a0425516a6e03f360d23fd4f662e180c8c6a2ee82ed2dfdbef7aa5ed65322d67ec7f2b842889ce0a14984648cca0434e9ac764f311d66398fe323cf04d7f8d83b8ee7fbfaa5cdb92025182bce8447092906e3bb16d7720a99d42e2c9dd06f5b292faab9a34697aeaf54af7a00a2dd17ab7f99401d8af38289ecf840737d863642b1c2e958e3a475592798e5bf16e9ec9ab34a19e378730299eaa57f5d0161cced6e762aea0cc741b15c4f9226b7bea58dfd1a664554e30a84486b3741a66bb6bd32a13e98e429a27377dc291b321c0adac8415877d7938f74fb89645ec3c83b3719ecbf9126074a2e8f461c1615d54a5d4f8bd485fafb5d1dadf23439236834486c3afba3cd536928621ab833337a544c3d8f5fb63402fbf25c6dca93ebab7c68759ecb93ed0393c56c66e2744eb8ae7dc038606e58a6dabaed497bd2180b14f0f9e197081c28e89e8509523cb64256ffcae5884d3f7757b60826b44de279edc607b7787f9de109c885c497e916253e6e74dc70a6e39779a71625f22b70f768ea4a871322ec16fd33d1afdab0b838e9f4b50f11c9e6cb0da093d93b0b235413ba039fef541e8bc8fe6ca45d1117f27f0474ce8df483ec73117840b7319ad9c47419775b6074cf8895095c92fceea3823420fda36607a5ed9c170639e8e110ca413e27d3aa873eca2253993bc56439a6ead9592e2f026b72355345029822c152146ecc31c456112970bfe8662c28cfdbf007a348b8fb7b061574618be119235ee8032f2a85d1a44d0507cbe0215a9f302f65bf36308dc861c4f62390890f345e036b0f5802737beaf8ea4b5200fb323b63c7f774cf7d10023c07b5fd8c8af00f2de4cf534be267ca0cded84010eba6420270cb6dcd15c0ab5c01f980e2550615e7d1bb62d8adc8ae4acaaf68704173224a6e8b638601a194573042bc9b4284f7719809e5507bdb873520ebefe2959c072630d73a7faca35dd7827845aa7dc870027eef86aaad5e4df2ba393f22c19d7c394f6ac0a0ca1d1a8846cf0a49828d232eff4f6c9712737b4619d0ec6473a2de313e82c2adb0f28c2af819af37ae71fd65b378cc372acac5e52ce1c08231c32c32cec1ad3ff4c943e3a630408c312da85e62c157f0ef673be3dbbc51c12d1c34634ecfa6212754d99aaee105dedfa973d0153bd75a1b312815fdad59c13c56d8bea03a41ef6922c5cbaded20910a54c79234393025ddc8dac00f06c96184b8a6943cdf2be40e9612739482de4d9e99189ce440b36c5d66ad7337c7136de3356ceca6b6c55a7c17e0c3a57129471f9eb20d44f2fc4b5ce71691d5714e998037122da1b69529358c6d3462c7230268a6b27973e31b236d3c75fa31847ab7274fda79377990180043c9d571d18bf28bdf59d6f519750264ff074def78dd58986f4f52e9cb7b49d143aaec12ec1a4630ede4a5f5db5b77b3adf46fc01cd46a4e2187cfa113c0e86b03a9802661f09322640775c5eee5ea2ef91af58561b791b89479084c758110c708daad41e24d81a7d7c7beecfb988e593569bc73ea67ff35e7fe3533bb7a56cb22f71d51d3d417e79cd3ad57ea81d127a9e0301251599f3d179deedb931256f708ef51766709224a202814041a4b6e4c5746749953c2a786e2ef0c174a73e36b5734a0b198ec2f3a33100ee4fe2d6afc99be6b06616f0fa8d623da7e5893425f0f3742ef381ed58ce4182d5200bd9272f2df404c8b34c978d3ee5910170237f526110db4971a60203c2b1c76bde06f777cc84189df46a3ae44c9a79b7419544794005747dd32501a1d0e1c405869314ed4b182a35b404197374fed6046de8888c6f55c1e5a7b0bc846418f5b62e4ad72996ef96e96a829d5876d933178103aa506bda32b2e14d6babd880de12746b19640091799fda2669ec479b7083a9e67573285d4c6e8dc05f6ac55017c7075eed74be9762b80803268948af3ddad9a1f53e8cdf0482a28bd94602ce315c233e540c9045ad3dcdbf053f554d1152e5b73e30858b9c6af98c43929dbb052e56f6a5dfad62f4a742482523086c2538c2119de07f907b008784f8a8837adff93b16cd350d8556f2f095165cc2099bcb33ee758dc538f964903c775e8500d778c2a71248890d182e9573031386eab933c4490bc2530604ea5f48742be0ead485e403ad9fe8e70c7dab4b1eec63caa529b01c6a9febbb6acdd2ce541f718374e4a96acc475143be37b36048b0cb9fe9f918255b8d132280d0b1f1fbc6eabd8fd638af840512ab69e166198e2a93b1ecaae6fea6c3e1497642bc480f3f4aa63aa8be2a07111af3ccf7db1831f6ad08656b9af9c9e7610cb7b24127fd602fe6e3d34ac5b6337c2fc10dc1d1674044e3e93c5e8a89301018a149f0bf7fab78a386801d83583ff7f94098bfed6532a26b9df4d371a745e2c9a3a4b842329cbe8364f02af729adb00f1fd57d2f2dc2a825abef11eb1dd531e5f064be87dc5d07f293aa53740a64bff540d8a9fb7803757328371e7a05b2b8631f698a0486b99285afcff90e78885ec86d5432408ea0efdc17c336387ce5d64db2f0dfb929faf62d22e5ebd53c3910ae5b39297df7dfe37b67b496bd496c69ad63653e64a01bda9e62cda3923d25128da070295ee7b377405a8f06332ca0aa40bfcba2a72dde31cb6864b7b323d62226e00f13f2454d0192d1b9034aa3d705000000000000000000000000646395ab429cbd9a0dcd41d7351a2d49e98724fe611916f09687996d1f15b6e828f7a4672abda184060b3f9c8d1d18c125301a6d9060d52e17c110668a524e3159bcb4bca10d192951c8e3c08238fc94f914da3fc6b344c3794028b1a2dc0ac6000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000008a214d179266347bef59c97d80777417a0e9e3a8164eea3b4ab6aea27ef47a424e2e3b8b7772dd6b1595d8d73f1c31cf4a5ac6b5c81760d439634e62cd1caa7fe902d8af815d21c3346096d18e93ac05131fe098a12a081bd0133b94c98c691536adc495a170e00c093ed6bb10997a395ae19d4a004c96e4dd2c25574e2fa0ef6c4d7ea22eb723e4922e6897826f3f87f2fc979aeec6d99703ce63bbb815c3df217e131923eddf34efdff4797310e23e80cef8aa57b8433bad4cc4e302c36ec29515f7d494d7f22d33545500a35c8757e404374a0602ba8c9795cb324e0a48d0f67730401414fc146ab9270e604b43e7e555e670b639c780d6b6ffb1cabe9239685e7b63f901fbc0cc8e47c09e46e2201e493dd14e71e783c8079ea0187a6a335730c7a424c495e02f4859f86da9334f783286c628ae37387232cfd11fbb6128624ccb3809b912ebcb8eed4332d69d88e1f5cdd018ca80e43527968dd99e7153a612269c9854505a5710f9b14bcce66e6a18a05c8f86edef391053f594f5976347f66aa4697b24b72c6928e0c9c8b8fc328103fbd8cb11d62527afb0fa19eb4281fd508e3e0ad995bbc4313cf47098b37d159c2619793c15a3f12c32930bfeb0c4946165b7b9c99865f7748d6370efcfb98ad2ae802a1e390e24b39497d953d45d0d3e2046af922bf1030e51d69e3ca9e8c44d6157ab847c1067169e13c19091f99bbae70537ed3df555756101284dbf3ba19faa2a7632a5644a422e6715afdd4cb74feb004f4a3d489aa901e5fb3aa5d106b076b3917c766e8b5191ab4cb4640b04916a88f88189694e2b76707aa71cd19bf897015b957b26cbd6ef54727b25c4f0bf2fe5667eb9440c101cbd4fae11dbcfea771a7318566d5c4004ef5fbd212857ae589a7a2b30bb317afea9f6129b29b94ab4c64638e262c1bf3327adaf26b26f3a017a48ab7afb628a2e12ec9ad722d67d95a14d8288da01cc0af2300e6d1ef1822360a7b481d5e4e604f1ffe68b1bfc255a94a2e796ddeccc54afe37b5cc99e8c7edbb5b1f2f8b6a6bd5f8f4b0e5d8f4a80e740a887582f7ebb0bc56735378b605c4d8fa706d7e3bb0b71ca3432989c70ddf587ff52c876350db8d5dbced511d3e86efaa5ad2204cba2631ca05c5402396987899c5065dcebd2ea9aa9343c11febd3626e5d7aeb07e5ba48ebcc86881590f84a8c55de5f2748f671288c544ae4086da21861b562f9e9c791da0148fcf0fc3277f784d5f47ff6740189bc4866bf516773bb564e20f85ce74d5689a989a4b79e0c9ce26e031d3cb2b486feb375571d0d325525a5b883992b3b1da7824a3271bc322b69ee09f110ac900792555ac4ce18c9ec3ccb42aa82c39e281ff1ebab553bc30c40950883859cbf2dd9dd06bef8aa513801483ae1a7da673b9b5e81d33708836da0aa39271394a3ca655000d25bc58090fe9759a450cec24a1c38949252bc48fcbed31fc3f5f36237a3ca2b6343862a6111866723fc039c03bd53256302c86f52efcfdbb0a288bc95a1eb3693c21c2fed5e3109ae1b2e09364e1285104cb4f594906b9c21b429dec9e8cbff5851c3bb5a2a4c7678b74c2586c3e014737711ecc350a7d64946917c24dc6c3fae336d05393574594d99f68e98d8455103473b12d6863361ec2987cc9ddc43b5130a024b4ea88763743ea7775bce16cdd0ac4dda6b85be5ea327ab520de23571fcbf30d72fb542eef4619b3b69d29e7739fc8bc1626caf729017b864aa682f35d4089c9f9c9f4071a92651f5ce3bd8a01303eda247c1ae4f904e8fb67fa52fbecb86d280cfab73d683101b633e706990ebae50d1a8078a9ab8e6276a812ec1cb7edd43638a64aa0a32b51685b5300677ad58bde7f15ac0317420f3da9c9bea24f44ad9ea6a6eb6430297fa1c59b1f7f40ba31efb919d8f9342ee27dfb2083884c26b3ee1ce9cc217b778bff3b57d4fbb341a124a36cbf19550578a280d7edc36a81d29250b67efa21cac30cb4347b4fdf4f49860cf8463dfcb908560f59c03a7778d8538086ffec9ce9e66840317e9c6ef0eeb382d48087680c90761ea98fda09dd20027f2a2b6380e1eb6eae5a5055e949647aa382a8d925b2d52c38749ccafca96e8b09ccf35e971672345ab505cb7f7a659505000000000000000000000000a43ac7a316c78a56fa9637d05ca8a5d9c79beec49852da60156d81ab21700cb7831b8a869fc0a9cbe48d51a7182d3fbbf567a810142f064a41a863c8b74c22e0822ed6b63a6397f73fb99af45f87f2058625fd8a5222185af1bcf251b248736400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000f9aecc65334c3d69fe513bfb242cc4a4edafcbe7e808626dbc9955e592aaf878b92d79e6110f551fe846cc40e77937ab5d42bc8eec97afe3c1b806cf0eb7c39f6edc8c4f7e89e531b2d405372cef4df3a3182faff68c73d600e601fb38892bf55f56226a7f770849a195fa07b7bb5a7c3907fea8c0dc4e7a796e86843455c2660ac8b46b74a1f8c9f79f483069f8f334190d5cfa58ec57367f543b7e1a546b25d8b0aeea9e9c5f724f3af5b72c686df35b6cdf7cbfe3442c6e8ebfa56f4a3c3d8f26defbb72ade7ed2f7aa858d960163c09aae20563073880d92b2d3ff11f03c9fb02021cdd84f1412cd21714a469e0cc3398349920e46d3ee89952682af94cfd4f2ebd21e9ef32dead4056561fc6f88495bfcd96df96bf13c96f33a74c093a9dfc05ef4a5708cce350115d034a920c8c2319438170fdd37a5cb28706c7e84875a22cf8923741c3951bf91556984ac86d71993073055c31c74c919dc1c6441504adfd81d732c66ecda369bbfdd2a9896830fc1fe20564f6a3af638abb60fc1cf46294cb51f6bdcba182ed199dcfc3f81621e53a629815b3d49fff40c47cd30da2d2ec58fed464041d89ca27f32706c96674997af3b0a089a09fd91396ec4329097af15c996c1fe33ae29ecd571ea296161f2ac850caddedf3eb41fbaebefa934b8f38a2b5b827337471aa454412d0952d28e6aad459feb94ba6d275bd52c1d6bd6123287784b1b6622e833a81b7d1199c795395a1eb659d9c34e62db7e745b9cb55bd6cef30136921b91d8524825cd129987048339de1e13adb18ec630a9a05ae1462f688899330a9adf12601cd86cc67e36c1526406bc8f1e9607ce8d5b7acad2f4992b3ed41c1edf9ac2f222665fe3acf0dc0d1ba8aaa091f092654215add95ffffcc55dd2cbc9554f50a0125be78b26d6586a90de6fb9b564a31c76f8b595d08fbcaed57463fb044b4283bbd40076fb37968ec92b308495da4a515e14e3e693374fb4dfb9366b2fba7fadb1156b6dfabb9c782051f2b34e98580eaf7032fad0336ab36793be9fe15ac4e14d11b3cca54085e6433f92309153bef41ec7ed82f270e192288ffd61501db12449e53042cc63547b5cc7fb322e5a3aee2ad60f0d9eae4106a7af6e2cfc663061ae6d123c842ec69dcc7e48730a279a1d22a3930cb11293a97b721d89bcbb697e5126056f120161d8d30d2fb691f017de81e5fc67fbc3d9ab3aa63c9fa2c96bb6669b419f9a8ba11f524e56f42150393e151632bbca17224db3564bb5d24d13a091519ce5736e88b8aac8bb71ff65848f1a6c4c89a48a8b12ec19d1129b874b66b572756158d78a091aaf24b6212ee4e3e7bb3ed1e2da9d476c21843cda5163a8cd1ddd15907e6db58bf9df3383b3653911816ccf5c2a070cf3d1c08f7d9bfe2f5a799dee89e640b12296ad8a5b5dc870f992a08ba07b79ee4e213a25e873159a41240cecdc5b06c57b1456dc0aad08fd43b242262d4da469148a0ebc1e51d060841c73425bc8ab260e8c9f8ed0dab2d2218842d48b4011fb409c97f428d0939d8576f80f55918961bd503c29b3e921286171c72a706f7c5c85281025048dc00209a6759bc79ce92e1d0a68031aacb0becb906d9806a89495d9f8272b685c1756d4ac37c02bed87c4b3410a68f6036661d32f8a9217b476893360fb0e6ebb2c7b1b6b81496957ed7d028e0730ece44c459ff66119b964e02b9fc6ef016c8ebdeda911d8e8641e92fb8e77ee8bd346ab435cce3c5ea8f3b35068a9d6e8d7bcedc43bc92d9c42dd05559fbec1c7d993e7fabada87a70e1fae96b69129ef1dd624f9f02cca6f5adf7ed9ce14f9d168108d3d2f4b8f80e2e69b84ffa11536071a072d8d4875c3834c0c0d0d5bc2f850752e611f0780354eecbd23f1a0a66ce6f8322a21a7a90c1959c4c831bbdca9fc89c58484024392d70a46b39add3cca2ab9a9d8911e25c6fcdcfe004d3980bf042ed394dd52477a1ea336318e491674f170d21b240559b501ff3fce37e81faedaf3cd90b88c85b434a9249dd78fbf2fdb9665b5275cf0651a608ad80f966a1e7cafd55f74e604eba14781fbc9dda61ee58395387abe6cce86f3e67db9c6ef46794f46b505c6cce9a13bb37aa7d9b56a8e726da4f9d418ea43e7000000000000000063d5380300000000c755b9837050f200d2fb731ddb8631de1fc58a5a37b719adb72b98ba5028d7c647664843e62855742767e9bfadf0ac2467bf17846497e35748af23e38819033469e348eca0c5c0b3ff17cacc673d09f0388679fef05c27a8541727ef22475f67000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004b9bbb034867feb99ef5e82c7e03a4fef209a1602969822631c02370c83d708af36641c64f9bd4bc1b555d85d5ee91e11fa355962916fd09e0836aa86bd806105ee714d8eddaf03feea36f47d5b311471a712a112fc7af5e5aee4e7208c3adadd31f5584ba552c6b8ba1636f44e414e5ac5cfa9fe926901331ba0f7cdd1bd41038c6e76c903d075b30edb70ff709452e7e7f0afcde73e31340213f6fea1bd3adea6a20c957722022d53fc4a1bd1d9207054ae3b8d1a0a5ab76d79f45e5284f6b74e230e40dac07652fb27dd51dac86268ad391a6a81714010a18080c1a69f60e392040784160fccda485505bb6aeefb64733bccca3af902d42d7847e522da05009a09dafe59da6ba7de4b418459620130014579486ed7e2bbd7e8a868cad267f4bf225423a2a91d2e95139de1a17f8a4def965aca5eae8ca6ff33e0a88e4cb13fa2bb0eb867c8ba41ebe0794d484da8e444e1aebe3ad0bb7f6fbaee9d55cc55cfa4827c14017ef838c3ded731fba1e5eda3e3eb26a906edaaa6e49a4102f43dcd8e49d0b3b41ce0093d7cfe6d7f428965752b1af656059fb22c14526bc858bd85454bdbdc381b61ac72ca02214e3637a0a07b6fae25948a9559367d1264fe97007022d1c24d7b21c26ce37b423cb9ba8c0d058bd6f9fc5a4941d3d65f8c55db74a5a09a5ef0a4246d9494d7bd98fa5a97eb1e6ed557dba4b454bdf3b6df8e14f1240fb23c76c74e84c323864687f534b868abc1a4e417f3ff13d6997d22d49cea3395ed918f427df80f119d486713b4dfeca4b9bb844269394bdef58b37fd4385765082f325ee8e44246646cb0367d920f5b574b402a86deade44e20b8aacd147c347da937ad8586faffc0e28825b194650efcd5431a04e68f8a292e69871ad608678f0b7f2392cf017633bd57a9b621b9ae79a4399d987962f3ab2034bc1eea1b4ac4f5b004fa8f1c35a524dd4b9aec21acce68cc9eb9cc3ae22e61d1e63dc7bd41ca6cbfdf2d5255f2c34b975e29ebf853ac682fd0a005ace5c1dc3df19810515374c9bb53bff6ac7b631ab5fdb2e9f2a8c609b91f3707f65522f11067282103c81526779004825147df581cd02e66f0ddf2955b0ab2384d22de98846ebf61dd3f172586bf960d02db161ef9b10be0d0351764b365e8c6a9338681c551836a7b50bf7ebaf534920c25d074119dad7e536a6aad17719d4a7e1a1875047969b3aa6dd25a93e175881f098606632543ac845e506a14830567440acce8f670fa7dbbd02fbba0184cd1c84c1c2fb05d7e102c88f119f2b61f45485a6710bf268bd2ecad7420c6efdbbea78c8c056b8ebe257a7d5746f44e218cd52f004e6eca06d2917ce1e3633a61da28c6fc2fa85aa47cded9f619218569badd7952f7868ccf040edfa839ca25e523d2396312eaea38921eb3f274719be5d206c34146b7d09507d0b48fa30fcc91b8b5a5e9cb45daf804950e5a53580a2ea549b4d6ff5206d909d764b4d42db5fc8c72c425c2cfc41801434d45004858ff8a68f067c16a8f827a326ff39011213d2f07a8587414999a53f2d1ca1e504dbcd7582948f79df68c2a323e8ec0b3f3d2c216591a9f4598ecc22a242ee3e34a6ace6e2d8c7a95b825b47ca50dd6619cffed591f5aff15607103129fe87703b99bdfef9eee11e6fee18e63e73b8f67989f1ccf1aca39027419f80304b6fb8cca8104c5d27dfca09f58ab03b9b4e67d1340a4f6898c9204969bb603069e0b49a79fe692c92e45b671924cb7da0e276b0aeb5ea0c6110c5db3f76a9c20909bbf69a622b7c8a388e4d7d947d73bc7b40d0d3ee3dc9ca4e7ed997e9b124f2d9b2226068a62b24d5acaab494a9dbb140e5487d3971c3a8b889a302db9fd972dadc33c75bebaf6ade2935c6aac0735ddb66098b984260912aa020bb747c4e477b962d2ec45b646d702f0ceeeb558693ee2190b7bc829ed7053841f41f982c81e7cb1843b7d01dd55b8d1857fa11f66caf408bf57025d8852e200de61abbeb60018e14465c032b040dcd02425d62e64eda60f559b20def85a757d570bece82a8f0870ebe5b1616607831c7a3d1a75dcf88e419593e68d5b275d9f5947bd7c02c6ad0eb5ed5592796643df81334baf9750d37db37f46948728805f62d96e5345a2f96c02383e6f1edc0a2ff29c89461809732e242743a1a1ffe1c149b669e6e764fe84165295a680d05fc98bbee0dda62c50c2627cbd81282c77b3d46ac2de0a35af4c1feab2df1f77bb1b78a24f58af03b75821d3273d7f67f6a96bbb6fbb0200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "ac6552ac", 1, 2106559170, 3925833126, "338da09f97035081a1d7a8b51ce140403b5fcbb8d3632844f52468611560c860"],
+	["0400008085202f8904ff06c14d2b79550390c36db62474bf038b95bd5daac47da6a961c9c9d53de1d20100000007ac5152536363acffffffffd63422c135e0c0fa7c0334868186dadadaa6ded297920bf6e35a560b5e94cd520100000008ac65005263ac5351ffffffff5d0906d4c536f43bde778866695e0ae84f7f02883845ddb6bdbffb0e55598317000000000753ac5265535363ffffffff05e668ea5a9df633ec595bb814bb6a8587d659171f4308c7d9b74c957cd3b0320100000003ac0053ffffffff043277a9010000000009536a636a000051ac514b91c901000000000763006563acac001a97e7010000000005535252516595ce29030000000000860c7639849f131892115701000000000251df85929b5ca6f67857fc07515127c3a2a236d77cadcdc5dfaeaadd16923fde4bf0201d506a55dfd1fcfd285d1edd4d49a0280826ee7f6415c75ff6b48f2e2276baf60f32285b1d39fb141ea9c4b297efe9d276cb40c3b4d9f66c57110b8772acdbe34fd52c9578f7a22d3f314b89da3f5f5f75e0869b04c9624c2b2d0976be80b38800e5138025dfe2d578e4293d9b5c74b75ed514d363e5ebb3ba0778a51a566fd33088f0a99e69207267078ee0eab615ab9310897049104a780ff82e64f99d0c4e5ee8007ccf5d13dfb536f4a77ff2a515dad33beec14379d8ed4cb7f818df4f796cf3f8e68b5101b34f14ab320019571a80dfc5abd0a3b60795f8fd4a3a1b6a2423fd76f82987a8630878d315139ad57ed8597b418c4b4ba5d4369d9ed694c22c2f994142abfca4ce23bdae91b0a13633f0896fbdb89d022dca84c785cf03b75821d3273d7f67f6a96bbb6fbb02000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000f03b623f1585f7db15d30ea906e33d5c1ba0e920c8c8f276ee3d1d313cc7f0560b539df28fffd2849b63bdc7a0b8d8d5f6570f56ce548409824ec6c9d2f6f83f2a094e42cb17fc28bc99de18943e1c44c12f020dc62dabd16748c9ce0a9ee8b50bb878dd006476b8adaf14c4e3af3c622c087ce4398fa052c96e13c44cb67f39e5f4cb630d9371dbcf1b73855d5a9ee6fd86e22b9cd52da466d3b5238083b8ed5e0af90b8ed13fa39f30fd8840a082ce7563b7cb5a2806f04b06ba5b3f191204b4eee69052a35bef669e4b5f6fecc0334a87c6eb4304105d2699996c8d6c6e5ecae3dacca6bd6eae186cb6b41b20c0f8ec2d86bed10100c5a0415685f15154d062138c616be024f43bd30e6c224b458e42dccd5194793a88906e93eb55bfd56fbfee127c3a9ce5eed58a0566cc00c58c254ad30909544fe2d49c846c2b13797503b75821d3273d7f67f6a96bbb6fbb0200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001b31e45d0b01bcf3aa88bbad013febc2056554665a0a6da3a5e045ae5600ee94dd565b582700d0bb42341b30bd332fa2653b901969edb31e1c593cbba6639fe6963a3423d5c8f355e62dd465b8992df03d0bbaa1a3f19e6c4173a1a1a91b742e643d91b48ab494ed3cef4faa04474d4ef6e688830b2359b945431f90192303782561431eee94b9dc7c048dda565900a3a8f1a26ba7d8542af8828fb58b312a2a23566e9a77332b1d71e40de1a6b180bce408df4228e35bb9716f5635567017087f4f403d50dcd7991d2fb30082896db5f4d3fb91c4d58faa1fe909b2e1b677a15f71d4174b13c20751b6fad9222d7e8411cf15a7e37b6ec31ef98ca3fc3dfe79d115b459aa7a0275634cb1d8746939b4fca481627b9fb3dc07c4544046600e83ea2d12bebd0db99cdbc0cf41c964da45d9bfe43894b9895af68979f19db1535487bddf0b7eb6fac642bf926eccd676f636b3867ba57eb151498c61b45fdbe6cfbec45f1897228337efc83fbd865d8b1c8581ed0acd591a63b482b208fe64c161e780f89ba1448e34d3e0a49b010bbb61e16d18ec13b0db5efc3b66282ff28be485a3f452c4b81878a058349493b7bf65839fe683d434383a9315a1fd41f2f0aad3b368105df26866592a7c48d48cbb0833f0856e9d241b34288c37a3e4d04f5da63502b8f634cde41388d43fc0f7dc5476516b25eebb8f1e5888b94bcba636030900950bf992be55decf4c685271ca339c61d678c2438e9269d83827a15751f5b9f36d3877aa4be22d06751ecdec65ec968cf29c7e701e731b5c87a0edf603a385cc2786aeb41a88bf3b468d28309c881416a281796623845c1a5652b4693aefd1599ee8453e91bed14c5935136dc5c3c63b3acab9bd744f0ddf8d952378f509b2f972847eec1eade2431125d3c68f0be2d7fa39375ef22ad6d2ec664435e136ebd860b43550bf5262da193fca89fcbe93cbb2fc691cf73941a9174dcd250756e513088af3e53df1bde24214a6f651b9cc382a63de8d4664607d3c4442cd4cb0bf6539526c03a30a8689865956a4f965bb35c1192c21bd632ad6c7f0562a1a51d8a2c04aab6b8884c71f185ccb921f14792ae48b9c5f42aaa1e4915aa4b39e27304f1846c81d9bfcf18771b85e8cdc48a1f61030e45aa8a8da1d37df10e9b1113d09bcd625f1d11813888dfc1fc90b7b0d7464241e188beed754330e1487bf37e8d2de2b773fbfa76c9147059b08b2ae418298235f90e8e6029e6445a30fcf84524a5ee4cf1cd86aeeb301a3603a789b96708a0537cc4bda8c08b5d52ee57eecc25754b0a0a37cc8eb8cf320756839e48f3de0e2b0300000000000000004331b903000000003bfe41e71bf06587f844bb15f0fd6f3f3cf6926ad14378503e1fa20a6329c6b5fa59354c692f4df39d3c184e7532bdbdc178408b8987f338a2c945366167e77ab40b32fd55159033e5c6f9e6910d9d6c848c673b8cfbdfd6d25c1385185b52a9000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000008efdcad41d4cb705bdc0c42b68df2877d7fe1647bfb9c5263673ec71031100c6550efe567ac3f6029faceb485b06ab3e97be553a9b3da5118af802f106209491fc9975bea23e394bc7db0b42793be11d95c4d86433340b2fe7d3ec5d9bbfdf2653f544a3f3f0e6a49aa94c217cf13bf780827ad2f46f9cd8798b625965da3b5046ef91092d65d61fa589b24754ee8a5aa966fb1fbef9dadcbd37fcd72f6a5733d3ab1eb4361d833266e3c181b10bb56f30e64af38d400db653729d8ee90a3953adc3ce3e54ccd292d3154505a3739ae67fa255447f5c6c8329e3611c8406be96524883e248a2f42281ffe611a676b50ed4e486c335522cd370e65807ae1ecb04b26c16bd538a5ee8d7b9f63baf183d7334932dc225607646d652850736eaf935d2d351eabd4d2c8a34ea78707cdd71c2b76d840a492f9e5cc12cd5383a4051407261b73a1393f7802afbed258bd77a291abd5de266ac9843d980f7dc2ffab3b7e7053340289319ae604ae20a7c8cdeadd9e12c33dd0da8af72ee6ebef86acdc892244e5805f192c812ca2d0fa28a4e1c3ce493c436b373185731ade511f1756008d8df706b8ba4b97cbc6a738482b3f341039a9de2c03f3df436336d948532d8e700537dda2fd1c9c8104caf3ec29f22e5eb8f1d4ecfc471d56a87b19e17327a313cecc7f9bc1f5ac3929289992b7569734267625f2e265ab6867f37456bab8bf0a58c743df066ba2d95e48b953e9a88327563067d8f71449a7dc2e1536158e9e68163326a02b622a1a24bb2beab37a3c48403148db5a42870b14ab29687c6ae73e0f5892d9751abd253df10750ad33b26bd8cb6354040775d4d7e27392747b15027d0a9f91afaefcc624f3aa84840c1b73146053bf5774efe09c929e7210b654b221389363bd5ef950e4ecde1c20e9939d8cc8320774ca2230a74ee087f17a571546d823cdb152272b7ab68d1078199108c7795b668b5fcab660b5fa44c208033308c75ea6422b2507d64b407b45730b0036bfa26bd0bf8598c114b68c3e012dc2c125c790e82eb16b01cfa94132b589a43acd2535cf3839d3eb700d5332cc4d1609cfbfc4bb7b6e97351e15dc51525a0db36323633f4847492e0be9f48b2ed28a1925600e9270b4462d6d3631aa405e03df62c19d968f57f97113e334d32d13fd39b9db2a8c0547780cfbc7821c53b0287f6acce3b0260232815fcd4988a87cfe1df2cb946489f5457fbbb7751586037b1266f709183e8a39e8d1f5a8479fe7ac1eb3460f6fb233f2d5838ad9827c27a4fbfeae676821e6c840a9a14d8eeee00f8aff361a4d92dd24a1bfd56e8209694a0bc51c5280321ff5bb5dd4c0a6cbaae2a969ef22aca03e11e138d3793f06bab4849d2289d7922e9f427669904e95ef7d059badf05f92046ac98426ffae96a0664ae0335d6d4d22ff3a2e16b8402bdd75c8709c298748d693a4052c9e98e2d009957fccb62a4dc691d0f3000f4293b2c234fe28c34b19c91e77520fc61b7b6c5864045f282a73dc3e5e0be95a3189f09858c5d8fffa5870cea2e847a232aff3d73293a29705cb24a3522a429acf2f5b4fe69b7748fe94ae09308fa399a5fae9271075ca40efa272a01749da84139f6d2d2134dfc7fafc161a00987afd2bbd44e83ec3fb2424bd4fc4fac671fa0858d7fabf69de58fd12a363a8b5d8fedb4671eac8d31ee6ec3836b0feada8d61140ff0296767f9f479f33a4cb9b0a11d4b15b00d34afdd981ce30cb05596b114496c1fd6a040344d149f5b067a67e253c324f91e2324f6a935dd691629b3c51f57289e23e658b060f116cc35e3fefa29729d0810872a2b79a46c57b19279fd97c564ae81050c3fae7c94dbb5d8732b9fd8a84e7d1ddcd349a14d84704799829ae1a5ec1f88342004a65ad94c6b92b5378f66ebfe7d00eed050da96707f1fe0b363d3b9f291f91f9d203013f5e0d617c1d3f32316d484af905d509f2645435a989cd6c0523757666a6195a8e9153df9bfee9a6cc298bf0c4354e0a8c66d01fddfb13c304522c0a66c460d9da4a02085eaa4a017e6ee1578464b9cde93a41bd38c5e9a35020b7c9b40bdfd0a4d042bd6792ed6c9ab0024307729ecb671b07dc917b9dff1761f1f9a74555c6b849dd22f169be3008de5c43e01000000000000000000000000e4fa7c3233e102d2992d20c1e24aa6246248da32e97f1b6002bddbadcdc04771aa21a170943881c618fa4dd9fc7d5896ecd15e410b89697ace828f577c125d1603a28f6b7e0bae6bc82602d93184809dc0940956ebbc9d75f6fe7c2ea76df99c00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ecbf664c73847aa1c6788fd79c7f4b9437358c84c876c53717683098be6c9c3c02c8939fa163b0c949e6c2fe1a49325660b7d6d8b61b15d7f47161f17ae115ad723531d02f6bd485bbfd150cc02b41484c16044c19e566b5970a4c200bc0db01722d5d179ad0102b72e25b1a5a40e0476aa52d74ee2f62bb75576cc7f9fd6632fa126b74eb8acfa7241de7feb12e5888e9ed05374426db869448380f058044c8cabd821e2a6d0b109db84205cd72a72aaeb9e45091d2adf56372d99ff86accf0fe17f062051ce83fbb5ef0ac7931d08d3aeca62e12b71d74958c0c3f09cdcc673e010cee7c0acca253dea75065fe3dbe498d0184ff355c8a9ce592502fd7633b024268c36d9e6da30e0b94ef1c168fd544ebc1cabaa67d34ca3afbe91e56800163a583dcca49d9699f1454a406eefd7ffc6fe14bea3e27ba729d0b0c1c8046e75accecc00d32fa192b2fd3bc485d49372cb363d866f35cc878698732384189a9096155ed3e19c8539be8ac8df7d6dc8626164f5a556960a54ed0a8860a07f010fded1c5aa9ed7bdc15e5b03bfda19fe4da0ebafee639d17c106f4e9dae607fe1df049ffd679151ddcf41d3c332402fdb3a60e210640615b579c584bf96fd742bf23d7df8e585b072ea55b9b0cc6c0ecd8877795fff31b51ca45db3f7c6c0a128340ead4721c2c77adcfc469d86a0816d4ea4f8b8e79a610c4cbbdf7442ca0412a587be5957357eee3bf857c1b60c9b23096f2995c2570a8d3fbcfab0a7976e6e246950f75cae86fa7360e3bdcbee0d090f825809fb7eb3fccc2cc3d90bd260765a6132898e3ddd1728c6b97b98af0f8b3c221cba40caa87da71e78a16858f61f68ca9b57e3fc14038750533d646c04f5001b843dfc168cfd9e410ef8ae17da652fa02cd04b67bf0df54667282e625677096ef6a22b84f901257521f1e44ea1d497afcce4aea609990924d0309e902a7465d1fb27ef59f268b86c7251203ef8868441a0a14a468d2df26e5cc436130d096c4466bffa88fa482393ba0a513d2b2761f9f270a1da48ee2aa5d5c2c6f2438b329f3c171c14addd1396df11154651e9c410be3b4195a12fb1835066b4c798b7bbcce2103ae42d96be89c3cdc363a75b8ad0b5016b86c97ffc69759496baedb6b0da0281b4cffe11533683e0bc244b85285fba4cd666d6cd2ad20dc6dc862f375d08f8d37cf57eeafc7e61494d1b6238fb94a06f7f0cf90c6b74164b2dff499449588c2cba8281b0f30aad49ccaaa51baad4c45b18f828a077ff70d97e4b547e1fcb417d7a4fd47caf125a4ac91bff3d67c709624365dd9c756dd375d89273f86fe231f2745499c4aef61a9de2a0685c0d2e581124a8cde2ff033be8073c17498a0a693bbaccb28688c44e1e4c4f90ea2a8dd8f511ec930a8f7b2aff545ab1f65c7b754a62bef4344a0d39a0896fca8c5594839fe0892aa52b57cc30a7c5b75448f73eff2962cc95a6da33be151861d5a267d323bd301be3840db6b089a42145f5f967fae659042d0a207790d3746d588d99338b37e3dfc95a53b9d4459bc0bb8294b0c7f7f1c1692bcba9d0ef1d17769f808643713d96e20ecba9e26b26c243fc4f048da1913f50ab199509e6b5313371a0a0dea08b91b913a8db8b3440ed3f53dd07b77f2a9f261b35737f1a6129158dacc0e1cf86c75e4459887f00825f0e54c81c4c222d2f3882a512e9f54b5fd873214601e1acfd96d9d52a7e9acb503aff04279c684d1a2786cd058e2503c60ddf43f659e67df76ec967c22a069e679f735751ba091359cbaed56b30137f2f7283a2614ab6f187137bf56dcd662cf21bcf90bc7a75148f47f6a3577c579111926ec7c85dc13b8dd07601806f7cd35a996e19b8a521967daa8ee66f124d11d41512f15e777b884eaa9a3729a7042f85de2cc7ad6c57d7b287bc7a3db1c2429d34481b79f66373327e9e1465b3e06aaabd4ad72dcaccd62025de2836dc28189135b589bd7f801e273528527a5c72207133b5bd9096ce2b214e2cb8d7f876a06e56fba3664e65f48314c450d81aab99ddd07ca4ae4ede391eac3c1e6981c39b3f0bead67234afe5ad4d4c9562283dba0e71743e4fdaaed518ba0ff878ee5d9d408f8603235f3e318f8fd80398c81ab1d5a357850000000000000000418de70300000000dbd6736364a15bbc5d3660ca52988b2daa2e02a47264b251c442cc8c9f74b3b1e1e1e7f5c8dac1233bda88e769689380d962a2c21f7e356f14ff00d627dcaf68272242d7cb0be618777f6c8e7684bbd023b0d0aba7b01b50b2a5ef46c53aaa540000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000080526020d7fbe1f6fc3fcc2225be76ed9b7865107926ae0555a3666d03afe6080ec985d733679aeb70f0246036b28e37fd8d0867f7bfab279afa139d9e3a36010a583583a4843f7336d286ab66f3d03e1f313dc4b47aa964c07908058e836aea928387d9cebd6ff8121ad56338b5a126b9eecc3562e9fd032fe7287b72a976c7f9ef0a94beb9aa4c61c145c79ffc8943a2c0e85f7509d324fb657561ab4929490c7ec5e7f1602b0cc579e264849545936d69604e5d4227c544cc1c016f517289c5a9cf2d703e92aa5bef1ab4b5fc83c31dc2d68c9dc3ef98e1ce8df5469ee081783f243593c83026fa41bdc232ab9983a50fa556f25669b62afd8699f89407cf0da816f65db6c6f68ab0dbb5b7212260c3fbca299e43df4ed945e2d55a64902f1a5159b4b95efe80434b97c78a1ca6de89143a1de9d8039f9f0066bfe0c8acfc09bd502fe567e27d19b7f2ac7470c29e5cea9e7bead69345f56ae4db875466c7010ba4327ec291a080e021cfeb81a69aa0124978d1ce7e149749aef2eadca251bb121ac216a64f7e0b56e4b6674c3483764212fba18773ea6f46a185a18b0393dd91681dec386b37969573b7774a172e6198f760c39474a1ac5280dcaa283fbdcaa5074143310b1f16fa307f44164509d993ed209e46826aafbbd567f0609318bb18235042ca3f27a0f4c3d8818d259adf93d7d4f9dc8554f78fad53abe6d71f6bbfe689026c259e89d62c8896cced17790bd965c96526137e1e8dc259b76bb3c3a19036693e4fc1fcbd616c8d1dd58fc60ca617d26331c555f34e0a64bfa29b1d260596f0f108d373eff89935e832cfee8e019c80b4470d73bf83f2b773dba08f3fa84726d5f123e2b618ca40da49b611826a5734ed725070e1358249d7f64af639179972dd45e56bcce5583e9259eb6ca877bb3702625b0c52f1976da2e23b3d36413eb300b6edc9ed3570ce741119c2edaa63ed4691efe2547707dbd6cd4dbcb0cc1bf61cab0691e58dc8f189eea4044900e96ca3fe9c74e7c74ee8e9aa479d0ccd8c8c4312510011256434d394e8ea73ffa38471c5aba82d31dd405db5666776516fd90a1021b90ebd6ee9ef29f920c31fcf7290e5bd074b95969ac093716cd000512536ce945d7c55669c01c08b954a1ccc40ed74bfb2a16cc9a9e22be5cc20b08d8a6eac9018f656ebbcf8e32814986ac54fc5af682061aa125b55b1af74b61544ae628b55d1a64eff104284b8b51aebcfc9ede1c672af7dfb4f1e5a4aebb4ca32a89495553cf9de4eb943ee860215cb438801fd87c7322bc1f1404d890cbe64288fa61c8c29e5ec91b8ec7e8203dfc1eede1c7d3d02c22278a17b0b61b03d56a83e82f174e4a9a02f755a2cc232b3a2a0981e2111c53c6a6f887d7843d502c2830949c043d7cc1afdbf257fe4e2aca18c0b517d73e62037f263dfdbe0ff3460c64558d1425247e1e9c9f25595a58ba18471b14905f40b13df069f199f0afc293139efda18449ad5556ecfd054f5ddfda1536210990ef01375954c2b181b16737f04345a26e23292c7fd974e3d98ad0e9c3c3d7d214d25261b6eb73f74192b12ccb4ecdd12f3071020dfd6d8823c67abab795c2ccd6f0e24c5e872dfd680eec6309ab38a0fc771d48934022aeb256296dae8753b76b80b618e9bd0f0c6d3b2364258d068a257258bc38613e8c7d45367adcceedc2ee93a77fcebc9bca4fd80eb987068e5865c8c40edd903e23a013336ac6c0f40f0d98b431274957358cfdc08c035152ea0d038abdc21e3dcf510a4d56f7d46c94982569b95e3b3d3e105adaa49f49ef17011def7f86af36112b2501c5219e1a8b357d28e561f14432a73d19b975c541464caa41880c50eb6442e6d73045631af2044bbbbcb54494b366cb47b6b4a26e440b67d0ba0d45953ea5a23cada21cc364eaf89607846fe46801c175f2ec6d649dbe8f55e570bd13c250ff86c6a7c330162c232337117a92f39ee3c36c9b4080cf3b118939f680a9bac114c1afea43ae2002f143e9c712fc1b856da99af8711e9183154db7b36ab9a21a2cbd5475d82aad7ab52603a8115bc2190dc4a7d7b7bcad60974f64edd51f37e2d85c32cbd330b2932a68a2426abcf6328d724393dd98e32ccc8cf336c3dcd7f39cbfecbdfb60d801eec43dc3da8b848043f7e9dea6486259c40ce55720f340640b62d73fc52f062c2c86857b5437917eeafd53db40f02bc71fb127f619a6237fb5843ebae185c8665b052c0b45ee3169f733fe615a42798213a54788ad880407c0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "acac6a530065", 2, -971439271, 0, "15ad9b2d82ef52600e2d18b5a34f8974422a59c09d653ccf307639270bb03e9d"],
+	["9c87690d04f6d6acae5e7cf61c8319f40f4a7c1f2eae712aa7dfea831e83a636f28f93287c010000000752636553ac6a5105dd80f808c91f96b91cab30e6607e39d018f429dd6f2f53fb53af1d1b915f5348c7e9490100000002acac31e98e65e47718b8194a671f65eb667dadb93ef5234005bb6a53bad268aa97ce032c643c02000000096a0000655253515252ffffffffb7efc27a8ecdca4602beb22ff4164530f29f8a4ec40f021a67e7e3f89f55b3c20200000005ac635163518ed762cf015156c00500000000095365ac6551525253636e351b5600", "516553", 0, 1974215324, 1953719636, "e5284e016405de2404fbfe2314f6d3bd68ecbbf780337c70af18645974e724d7"],
+	["0400008085202f89017d225df732b40f5c67beb29a7c31fd76b5192622e099f440d47eee8322b0692502000000066a51525363acfd23cc660262e5b00100000000046353005268d8db000000000002526a0afa2d23b92e240083981a0400000000027214d9c7b4b68b144a72788f4a2ba072e3b1bc8ae1ed2316622fa3546ef57ba3fa8d86a9aaac3dcd49f7555431c1db59e08ac4b5fdc51dfccd2cbb03ed9b5744954eab2345c9a292ba7e34ee43f395a47ca1ff4801bbac28c7beeb3f1efcf81e4a5872a57246615fd2d6f446b382df3b166a194d25dd4ba273da54604b0b3301a4b1cfe7e4b0203b50e8adb2f519d3c8f96f2eae5deac1ec4d8a3ca3bbc13bf6d0e8c38827ee45a36bd6e414ea9230ba37f5e969e26d1f3c7af59aebf56eecbcd2c04f43cf73ec1c7edc7e06d0b9daab60ecb27d70e6b1b2babaef3ec526cdd21899263078c7106ccc5e218c697c957f5ef1189e425d9924cd661e51f39c28a7a3ecc4a8f422cd68e070983c3b9d728a9ce3a8dce47b168f553ea7f676a8c309767f26557babe768d4667d8dc6e6a1c7c53bb1c9422ee2468c081ed8165215ca3fe615a42798213a54788ad880407c00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000f4819089c7a37ea2b51484cab030f2cd252d859b813647e91d16f8b803a4e3339b1663b14260f53523c4aa59cb86f284e668a1e3a5f4dc7b9ab41f82659b0d3ccd8ee1099717b6dd4a9e0eba64434bda904bbb47ea705948354aea4cc22408fd875aac4da6eebbd9d9602da386b55db7146c7b8f0efa82d3286c54dacd6cb5aa710c19f655f1a9bfa3e5ac6631020abf308b41230f35f2e9413f20f956cb3299d0f694d61808f9c0993fafed7fce4acf687d382caf81da7f50e974b9c1471dd422160089b76a032da3fb128cda72d59db263336eb0d1c5b979b795070dc18291d487d81b645980cfe09cf06399d2d2f70d585ac56b45afff7ac2652e8f840c5c7f00e057870d743b047ac2cba014d1cff030a84d9a67f27a312e9284d268bf9bad574912f6512a84a86e5101596e5ab0ff0c6cd6461783f8d6ee81851d39f2403fe615a42798213a54788ad880407c0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004ca2724951bb2fece91e4787200d545f05f3bdf62590f68a73349e74532f08605d99da8f6c7982ad0dce64560994df0231d1ea53855b8b9ebac95dae1d8dad8447980a8a1dba0e6fcab48230196e602e67eab22177c0000dd1e597e2f3327b39631292c5e4206a0d2fe21dfbd59fabd65b45c177af0543cff4d4008ac806d595b4572a98811fe2c258fdf1196a64a3655d8d1970864941383234dbe2cf71fd3799c12edd119c9a5534fb7f9d50c478ee586b09d1f32e22544ef5411eda7e9acc39ba290b59d01e37b1c558403582b920cef44d21633626aeb36b39868b63d394f2e0a5bc258f2ed4275f3d8981bd41e49306dd7c50f7592a91fd27f97c297db9e8751968ac734f6404f8ce316a094aaadf293ff63165adac1b28649e398f3ec35663bbb6f9fd441dc3018e06b2af107b1f6aa99e63d3818fc8dba0113717b6a59d590a2be762a15da486342e75ed3d44dde802fad4d8dc73415c5de0722485ccf7400d17f1bd8d17613f7052d27636ff4f00c85b7ff278a2c39ed1da51c0254b0d2f8fbcbc6a0edb37eec59565e7c9a6f747ff29336ec5d6f356b831f3ba26b1710cda7cd04cdd65c5544612a4531bcc75de713433627d3266dd5f3f19001f73926378ef64f394ec85fff70db040552fc17760df2adc28a1476a45972508934f074575270ab126f52b380c7c04d7ebed7ba4a9b29b6d4743f5f7d7d78756fe190f0fdca714d7d52bc76e1bcee14bbfe4b51e6a1ebd677f134c7b4fa27461519be3a4d993830b87bf3ea4db5e92b76dc4e5cb79ef225aed13594e01dc4ac6eacb204706060d0bd5bdfc213b626fc0380bd5a787b73ad22aee0754d8538797039d24c21584688a2c7b6ff1bdfdb67f999a2054fc4b4f8a2f775a4724534ee6ba3e593823f199a65ab147896ec9b6553125ef962cf3d836b8e0c87bc4e92c193341af367da21040d068e55e539e06d3f9191fa5f819a6e2315617553549d31f214f8494f872cbc286d7f96e26bf9bf649193ba750e66b6cd24b7d71f19d1a5612e4a31d32b5c9b42f62d877124387c9361fcb4bdc81812a5a9cceb973746f37c56256f31f59d030bbe2ff3c593a1d61498d85e907096f25add098e1995e82591925ba2f5dbaec31d7207ac573e34061bdf34ccd5e547ed960f37ddef95948b36975257c3a43930659b417024577356a526fb4c343d18710d24f172c2d3be76af83f12f32214638fcc23970a7627196ddd36215192536c122e303c8b5765a7e4ce99457a0a5c65b7ea4bee5357b6cfc1c0c277f257d5492ff4a7ead0b2bfa9a784cf0bf88ed575576f107f06071911241ffc284d44de55a1a5ecb5cc72c5dc5e2ee397cc9df1cae8d6a02147cc2a31e5c777d4d72e38ca1ce658d8bf59efa7d1cd661bb44cf1bb975c535f285192ec23d7ab79263581aa2fcf9c5b1244903ae5b6b8d104aebb988c35e15241c07c057fb3189c86bb0182747383b3d8c63dcd8fbe9ac02c04301e1e180be86e9c202930b14d9a5af3437abc4eaa14dff1c6a188ccca0a082b695d026549aded18aef7c0a4337c855ed3201dbfa5aa767fbe64dffb78841a1bc3f396b5c8155e2e0a2b18df766e60b37b029e3cdd7943bc55261012e29a36365a0bfba1cc6fc813cad530b43d554d49834afd85a5047ea04b79fd88d3273305cc1e7ba743be2933063038669676c875273cd23c47d7b308cc5d33dddaaee1c2984e3f3679eb586297794dfe96ded290813bb9ae7d8976171dbd84594b4a66681cafe4ba1a37c37ee5bb0b384d0486237c7993ed7394617accee193de2c194bd070511959a6387875e83a0336d3f7986e0fa7b95b43becbc6f7bb4577779c763079b0257befceacb51119b6abab51d8a27a562ec6c1ea6d4ddd08d26e369a241fb82725c60be5b697efe6579a872fb5b2b6d02c8b0c077189bd06021a0665dab5040288810956c62f7a3c6b659d817e7e74df1bebf23f52a9f8f721f90e2f54f688ec89c91784a9c8513f1d4d64aa2e1aa560815d9204f98f3d7f2a0497e12d214d4458ff8f5016ef3ebacc022f1e1608f8bb39ce94e1737a7d1b6a3478503a5b2781f1a28060df2dc548e92dab32f416005d67a618dce0c2782e8fd6309354de0d6939924efac81cf5408c3acdba59d337e17ba68ade362397d8ee176b72a6afcf10981e928ce3bae1273f94d83202b9138d4a90e6b539bb19ea089fc3fc1f0bb902b282be0eb4446baf86d042a74a20fee0aac7cff05085a800a0f8a84a63097ac66a1997f968d8bce5c973a27216ade9b06eeb060ad3c607559c35066175863edb6d6ae518ede89e1c7b07f38c716fb7a2223b0c59f7dc8edc7220f0f095448b80ab14435aa1d0ed9a9871fd77ba85b4413e0c02d42cfb692efe8abafea42d9265b55b319f70a9dd170f9ce894e1d03112a2781f029428d009270faaf1547370a77c73a7a8b9b23bbb029c43e4ef0e7ee9bf098f422e671ae330e638ea1f79b3f969b9261677e9cb91f9c0008324819fd68971e438af59b9510cef1e1401b89c2a57c8413a58d2345545f83366b575cd3324d69fc25f9d684b210126f302b418947a13ab9ca62ad498b1dca3ef3fd960f329d7ec5793c6676a4fb7824a366ae72ae6817fb5ffb720c0450928e783c1ade5812008700f162c38b62624e46fe1a48db22712f8feb67c7b59f8d23fb4f83d45e2028abf4ea551d592944003c0b1ae4f602309320e9ecb9de2d503bd099762a445695ea32fa2ec8439f8c94a69b41de50ef01795d5d48e0d4fd6181f85c48d511c3cacfbfcee5168abc7fde37b111ee2b6ab736745d1ba7033c6aab6cbe676264ec2d27a899ee0b35354674028b6842a6277f202f4c9f465afdd18140048e3575e8b946f9b2352b4ca58d811cb2a72243a14de47ee40c367b72755ed5489eb3ca2ceffff9cd1d3c8a5afaf440f887a9ea71d601ccd4ff12db950fd9786a5638528422f0c6d7469ba52da726ced7b955570429b5413d3adf668fdf38001a28608e9067c3f3f710ae5cfa01a7118cf47f19faee8cd8cf94e80f32bf56809e52b6c0b8537935062b70bef5821798039b919225554d552634e410b095c9e5f272bda2f6608be61c71dd9dbfaf2ae63f2d45fd1b7d5e7f164779c150f146bc13cd2cb8b7be0be9331ad78ea798fe05468f589c0c59dc05dce4f5a55362dc198fcb93c655e22ab4ea47a079630641ff2be3b086a68631e12fad4d1732a13248f8a21929640ecd7d3c45dab18490954f5432589c02947409a6c39c853285fd2b05b4fc328a387163a22d6549c144776695ac3bd4223b780ffed67742b92e652fafaa297642df2e3a0c2c9d19bf21f73402014018f85e2f7270bf96bb488288dcdd5e04445bc6ad49a78d356c293462ca72620159aad1bf833c664835b5148ce8f61858160cadd2050cb8f91908f370e24b5b439f402ff7ae08884e37110edf02d3bc6687b621e534af67cc25c76e1f1cc5e8089650b18afdf08173dd261ce34943c394236c5086c69f4b1ba606ec191843496cc085020d4c4465f26a4579494d82f23b0523b397b5a04a1408341982ac77eae4c5c979414e5c16d6a6da46c163846a76ab692e9f2e3ee2d5b2b8b51f0f3718bb1b4d98c202b214a25439eeee806e0110e84f95068bed2ff80f85f9bc99cd2c74724c3ba7ff7ad454a1e5016b241f0a212da7d554be50da9827d62f15b98fc22464d76f80e11a985738ae1ff35b7678580c65da9cea69a6663890d34d8e4b16e6f39d5d4f6034acf9c3cef4af1acf276092fb36409e07b1d1d95d222c30660a1ae0b2d83f6eddf9c4eec3b70124b527d1d9dc71dc3b34aabba1cfc8b82af968412e6007fdce5cdf222c99d03311e82046130f37a2bb818625798fd8b8e56eb2025b18c89064d283696a0b3a2091bb6464176d5f4b9584261c0c0f6b5fb3a21f5147677f438acbd38f841f21bc8ed7f40094450b2c9c22f121281fbdba4d574984e92edcc08684640d4d11ce4c7a2922b7d27c523d6d03be333902f43f0499154e67bf6a10653de98014af238ec4929433f975d37c0990d6d690a26cea49c46d4a214d2f0bfb749b83af00f291c40bf9810942783b23c4c6794f9bc111e52daded948ab97e7dcdb22e1b11c1456fad8f65e2d52fc8fe5dee60396bbeb19428d604538a6f7ba39734c69bc467d0e12520c558b3a36603926037fb7ff8a0f5ef76c06c16a883460e1a6d85fa0a147c7a81e6df7b3f9a7a47ff3bc9fbd9f6dba19b1b5b669e0fbdaddbfab3fd8687c345f3968957859970a8ea38d372c4514c11653fa3e2cc4cf620215522d849a9ffd13c4c354507507366bcbfc2b7de679de166d8d518de31b95c780581171067636710f1a47d84648e04064c435c02b245f89d8b85527ceb95e33606f03e29fca52c8d44bf57732ac6f8610d4b46d4d04a8082602e7d3f3a43369d023d97e3f3738a9506c5028422a658cf96e3e5d0e2c7d0ba629aadb49def1e29127adcc3b66fd7604f6df18f338063c429fa51021256e35838d0d201622d25ba5f241c7f73b1368a7d725429fec86fdfd3554863fc39b8b2ff29978462ddd13bd9cd5843fa10245f65f61d44a6cc72bccffc1daf1879b31299180f53bcbd4c3320e2e052ebc6491c831015f01341092d93d8fc4aacd282e5931152d321e569320413fd3465d3e441fa27e8544c5dde5c41ae77819ed3d8e03d0c066e0d4dafee2cadc2eae6e54f02f22d6e7d1e7c840f02376574c16c88beef3e65a3169b779246c590fef6fff978244e62b55bdbe06262b351a897749869ceb009adb93066f1de00f7bad1e1d28c6fa735f8cb1850aaed329bfb26339d11d6e730b8d5bc9e4affded00b7dd0c422e8d0d41e882dd95d52ac42bc3e172af3365014e537d800313c5ef068e7b97f6da9982a27d7e111f14e37724d04f896e3a8662a77ae1df01fda8abfc0994ce7ecfc049ba6bfdb9b666c11dfb12960cf24893fae4ba8df1225c4b10b3309611f9eacdfbbb03db7cf83fbb63a539e81b77126e00a88203eeab36e6290407a98d411104c83377bdcc188d172fa14831258f2ce2d42fe93ef9041541fe11b235196368158a00cb7d68ff7fedee26dfd25c58054649823a5c6141b930f3c0bbc356560b7c3e77cba08f79c278848286010131e7d1d363ca5707883caf7f4b632b2069cfd0a54c0a4f8a06af3c548133275f257ac90179f58363ebfdce35e3884c8f92665bf2f04bdf9260523ab7d9532ed9d326e76fbe85305b951c8750057fbbfc956fc15e5afa0de212373aa85fd4185985d58e9cfc61934d2f8d73577dd1c528623a78d1dc13013ec703c4e33ee5771a20abe3c79ec62253e841e9258f960000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "0065", 0, -78167730, 733220448, "c434730ad3d5b12a7d4d50c0c4ec4d8379e22daf7b8e7173595a5c2c7330e52d"],
+	["5015656e01bff4395ce026963944fd404c55ba84b88b86a077d472df775b9c0e9a50268c6b0000000001acffffffff03486fb00400000000095152000063526aac659a98730300000000055152006351da7ed8040000000005ac53ac6a5335a0171300", "ac516a52ac65", 0, -1545901198, 4179206552, "d1bd65d1d6eac9401ea91be2e93a04cd3b7f1efeee46673f690ed90a512abd12"],
+	["0400008085202f89032838d7366b913c61aeae373a6811fe20926383f9f41f561786c7d632a668b93d02000000036a0065077ed084ddc5b7a14a65d2dc195db3bc1d65812b8ba5ae44561a6c04627c3407bfb9238c020000000100249e2c877925fbde5ad76fb057d3c9d324a1151cebc7d34c3abaefd7eb473bb4865e7d84000000000153b26de598011a75f3040000000001630000000096152e0e9dca42010000000002955a1ecbd02f632f493dd585ced6482282a4c348913108cef86c07609ab4bc39cb84767dfd428b4b183211640afa6b10ec8abe0db0aac9aff21caafd25910a58ab1cbc245a550cd139348890bfb48553028b956ae4554e7177a4af5b2cd8598815bd91e31840eeb0de52ed1bf3d9025584fbfd82408694cd5f231567b228edc140c56aaff518b6979e56b1e3fa149089adbc45f566326778a4327b1ff8bcc607de2076f2517e717324e8079578040505df9b0fd5371485cbd8b9c57ba529ca068304ae76aa4d01a4b76a4becea246cc6868940ca38b367e8250af2b092f9c4abfe70886d91e809191be3cbc5969957e5bd237fbd3eb84b0bbceae7c2c85ab75a215ada325e224a409d7d3b7ccf6011c70e6b84acd9c0bc240f605e2bafe314b62d699f98ba9a259ea71a9969e2174ba771e36dd7be5c2724e6b80c9577cb53712127703dd50d13b0dfe9232e502436030000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002d1d9de9e023427f8ca36a25b3c1f0063fd024fafcf4fd43b5d4069d21236c8d6be731400f19763cea9953e392bf809bb03f5c96ca85ea2d82b1df45ee0a4460af36c307cafdd6addb886c39431b7bf61ae29b40ff3bb44409a2802222f182e36e621b640d79b05094c9ca865c83f9b4623843088c3135fb238950d0acafe74137e2e14cf08d1e6091e48ba081172979f6a5cd3ec56b607ba576b9bd1555778b2a85449f6ec12d98af62d0d9eb0851bd5d92afdd19f4ebb88ef5370c9dfbd4e88869b7527f052ce08be87c2225a28b8b894bbf95041e21c9e0821044cf59d697bcbb4c3fd73fb2dcaccf3833fea92da715978b1c9d9c26d4493724b11edd4169427750ab53e1e2b4bc81e620576e2075c39a2769beda031f4eabc949adec371f61be578aca3955b519c41e50556d568e9d97790f3b40df1ef0ce78313ebbec4c2127703dd50d13b0dfe9232e5024360300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004237e4468143f4bb0476dbb6b522e4e70f8b368be9f805ba3a70b8f114311588dd8ebdaf151ba7958af4a5fa3bf00924b6120e4cc53bee20cd9e963cf3860f01499e4b241b54516b3953531ea0776737311df40a0359bae7d08458a63ef825aaa9126708e5d01e8e9dd31e13b13077aecebc31cc4ab230732d87e21d4727bcbf292fb0da052a4cbd36544af634eb172083aa3b72d7a4df3d0f53b30f59286a4c76195345695c4bfa146835716c85b5c440d8b802a6fe29c8bf674debfcff9af6ac8d7b7183ccf26b6dd4fcabb6b66fc59853cdde206d6a08746d62752313ed77fd5bdac514876bcbeab8676348a19533056e8977610ba9e3b3d7a704d7b8e4dedd673c37ef79e8553e278ad4d4a73597292c7fbd09cd59bf710d7175cad3394073432305aed84e4b99a52a66fb0badb4ab35d83f777e9847d08dd1c1f404f2f0bc397ec8942647116de9c536ac180a03f5908be272c60f66c839649ca62c52165b35f98e251933d5b920ce86f8a98076ef6b928fa10fd9bda76a2717f69a9121768c3be52bcdd0e8311cfb5de0705e0fd7ba3681737ea605af32fa004722b6c291320ab2ac98a1888b5afe2925c8f3584e88c847bf4f76e4d1c1e5a0084a67255bbbe067c4a6df2cee3415b7386349be1ad6a7648af12894237ec7f7337c7ba66ea18a8c314ffc5b55819992cf46dccdf32003b1b7d89a926d55bffbc6fb33a73a00e19e8df9d3dac86b99af033ff236ed7ae4ede7ea7860defad446216eb48f04003f19f2d6801eeb0cdab3545c51efe4092c30e02b97eefa74371d1886fed4a03b6ca85c855901e229147e22c8e181833e4aff461d8c7acdea802c9bf0f60d5ec850ed954501924182d334e7368a23cb576b7d7431bd780742cc11fd57289cc582752e337e3f7a4edc319b47c87c4e0442330bc63f1e71248754028a6c0da3d8ee92d5d9b7fac7e4563e70ef1f77937a96526a342c45ca8300388247ca4fbb67f254e3a23520d8b1405f9f6f35f046f5476bacc580b3515e192e5be1efbfc94863d4be05f30ffc44d49a6d03a8518e136460631121e0319550ffa433faa748045112345aa6f330e2224337114a8b4fc9d1988497abe04e6a0c5e62130bbdfc09c96ff0206d5c2c431e3319724c656a20184be2d7a440064b640f65f4189513730a00570a4a815c1a7e51632a8ee2ffab7bbfe075a321620ddd6d81dc6dab1a42cb527fccb4a51df66a6b20dc05cd7e32a39cabf09756fc60624013fa8c5ee52e90a9108b06802ea23dd4d4b078f6291043fc107dadb32458beddd94e33e8b173fcb94520db6b5c85eea9505438cbf9a60a9acea36a1e0f9fd1625fa4933a9efffc0b21a6cd85948312af9381d1323d71d1b6856be727413c0103114736587f26c8d6825b8fcc378c87bfdc40d8c0ae29eccee12a76cb4135758675aa77548185c728622b7f090cd6d18e6a4a3ce8912d468380419561760add7eee6de500aa2387097a9403894b1a1a7650cc5e4cc83cebc703aff1f439371f23f796ec2ed78d4d02571e89379d7e2ee23a1c9c192a1b3fb0ea6da191a3527cd4695678235c219684b5dc2739bc7f22f557bc1f0642aaa5432ea50227dfe4f9b9afd3d02f2fc74636f091bcdff1f2dd71550e341e2882b7621f171316a67ce360e0be33f3e9449e3e2e39fc7583dbd8a86c888414dc18e676eed500ea484c10e2f6d812ec6bd1615734bd7c907da2a4b16d82180c935f82fc658b23a2507f6b9801dd0ce01b01955a374a03a21a2cedb3ca8e9733dbf9da3eef4eb543e5c75d8d9104e5468fc460750f60c1911f09c95632b964b4f02e6254ba31bca10b702aca5b3589edea6b03081a8e086d6fbb8e89e3c630a67dc44304992e5369b5bfd6b22aaf409b6b3b258fda6d18f304bf7fbaecbda8a94d8dd2ed44c93db9111e8a6a693dc2135597fb4c4f5c657517a9b2c55adb012b69d366e4d437b4448a020a7e203841147bf6473f4b31372eb034622feb7a5d453bd130a311c59e5fa90fe1c05706201354a162d64cfdcc3cdac49826921083f7829c9543b351353e75bb26f30ec390ad1f725e8ba0d7d727401e1f188fda7d87dc7bd393e091f24aa2156f2f96b2863ea5e24968c00ea980dd744ee5984a0b9b4b669707ed90d3cc0dc39e6af02fd3fe1ecf26d22824ee1e6131be36f579c77f0b0166f35967b2c49d7648ea4d9642b2a3d19398e4ffc2a92146797effbef8b850a6b1276ffb78200dee06e427e042166e744007fc03f8c2fcb76b4eed14bb82f6b44d6d886ecb32e2656a980fd154c552ffdc595d05f08bc77fdea667effca144cc0f213f5b5dbb0ddcf9e06bd809e116353bc204b95924354a81cb32c7349ab640662c803ef6c2b9c1b6d2ee4b19967f7f391a22642d83ba18727579d37d8c7e4f9c5867e5af01be83e05ef0c6104f45bde5b846b870c81a2a1bdb4054bfc8433e2e92437e3023e8008532857433850c20dfd63d0dea2f8f14364f7f312990f937ddc52b91b985c90fbfba7d85a59a3488987ab1a01f9791b84a6a15a3be7453e66ef1c3443c3b596526213b93a77db3c16d79c260e50265451c65a48364617fc97108125461537f02a363432a3a4e71f6beb53070a0fbad27cf0053a3d363b8bbecc0adf86af9004a6ecd0811fca046947d4c199013e48e4ec4d4385254f4f23b6a5fa682eb791a93840ff7a4cb9df73a12aaf0858678d421c6d9889de44fc2021fadc5a3c82258ad1c5d134e83dcd5e0837091a4b718b6ec93bee72d8aafc74dc8e323ce13159b933711107f7edc1618f53a5d5e5c78b0f6153b42b1e2589d70185e7faa9d6092c5d6115b2cdfdbc02e620afab4f4c04ee1770c927188e91fcc71a333db4559ef4d6ca44738b9789e810de1627a442e9a304ba1a070a2b9e3ebce847b55ed4924f98c4995f025fe06a8a0a983cfc321c0e1e07fac5cc1ea0755939db238ae0c33140d803ce4ad95ad9958a634563a6336f1c81920e6ea11b3620a4de094187af33cdc36466ab474687f2c18a7b7ee9e07719b5337dbbaf7bf9926582fc7a597471cc7064841f29110839d6b0caf58e3a3e1fed7545df57216c35580f34c2a6c729549521b3356ee32872d9bbdce3b69cea5b9326fbf142abd9c41b19321086d86787ed25889f87bd086e16fac14e83673292b48b2685413662c9c0e98d4a4de8c634922ea9c66381bc14a51c9a2194c8b30ec1f39f19f2b3e08eec4b0eb978d8c62cc83d66b0776b2b1c314587cc1af0b15f2f7cbbe9db4021e0d7a330929e7d5df88c225c64465d200435564f0338cb22de14c6017a865824698aa6e7cfdb2c82764188e3cd2663b7ef03dc27da799e5b442d4bc7e95db97337aca59d88798ada7bd8a880da264289e093efb2cffc15f8a0bbac82ab8f28471422e9ea48c4c5a3766045cbe368d89d682fa599d32055195a8287021316c60e96eea6cd39da86c0d2e3a30afc76c0231d353aacdd8725350c6434a191568138b97759feffc1c49b153ea83c385e49ee46e78ac8b29402cc5eb3f2c34c569ac13a700d8c54b0589294874fcc4340bd3e0baa2782ec2445714c5d48d9fb023b786558eb0c765014912db74dd80718b5d35591b26b1c61f2aa9400b741e2ddf0cacf0c921769c0096c4497691cc4c22736675d30ebaced61da7e30ac2d11c3223ee1a823726ec5079dd5f385ba25cdfe35fa95f6488cd9015e9a46de59b390cbf44fe51b4e830f5803fa7c568a76a840829a4100ee46f94720255ce01b048cc8b486f72233be5aa8951cc8b40011660fef344a2287f9e85e96d70bd039316aae6f0da9726d2ba2109f9671ca7178c96a1cd5cf855a53e7d8c43d00fc6be1815ae4ee71d22a3afa6ff24685ce37752e3cb05795bffbc7cbffee99a0c15522c52012a2457b2acaee4506d26ae5ebcf02d92cea505c97479bfdd24058791fec69cd667c85df5027225364c991583aeb3bf17a215b3dde0ee2622247d4d5944b87e797f18e1e616d1305c27e23d853cc5034e5f89238526f673ea088688bf856fe27d40789b579db840b0f2f15545e51fba669c80b117866211caeebba25bb88ada2a4e6d6825490ba0838b8b057532cc5a4227b121d43a9300dd17017ceb93cd7ae51135e3734bbe81e3158447b2b378eec0d896742ffd7165e57c3a333aa6f48ad45a1984a4e4e1b90ead1641169039cf95803a3670cd25c83d31b458758a0767bc9e5f283f7e81e5fec6d01eb0e5733f0933c75edf268bffe79adfb8b4411fe04b39601e9bcdc630627a60e24b1337766d94518d7c485e1c40707fae36b174aa17fa9fe3233c0d33da57a0bcd5e7cce0989ef9099530269dce6a28c56093f4ffb7f91205ec38456ed3e3efc7a2a90d9f891f17c88d18b0e697ed3fbeacb3f94becf6b1dead789099a0f5d2142719942dfd224bedbf59dbb929694851b495d6d434cc547acfbb367b8626d215d8c5bd60bc6a53a1a6653d894f06710f8a6f9b605e121646f7958cba9326fa3344bf08e2479622029756d18e47f8dcce9ffe7029eaf010b0e57dfd840dd041fa9f219258df392ccea7ddbf648865c5fe29d61b0c6f05449d2229a92a5dc975d87d7ce76c272bd3b1386ae0cbc0d96950bc88324c561689c87cc4eea8530d9b786565c6a910e0a68aae27060be2f010590070035314c3e718e92eda62c2c2ac2cfea3a02d5c4217302854acc5782b8eab18179d4a4708b7fb7a0f52a349aa96f74f3f9d2010e59f4dff6c8139210626c80a089b233fa9442a7c17e70a9023567d7508c0adbe9b1f9ef0977d1afd392162fac2c4f38a58f25692691a4ef2383f29c20349ff744da8ff0ddff2de7ef15bc8223a19ff3d530a65419482b9c70c32eb06d3184224f1d613a567e604753329f3ab8135adcfdd5ebe7f89c56f0bfefa985295719c9fe26b8b4e03ad73edde000a2f748c2f0b28121820ab14c4ed3eee8e3470529c1afc3c81c07922d9a364f71c3611d80ea86276c7b5fd06df9a7b132bab91e1f3257e6dba64e063aa3c51f44f70e083ae27fbca97e2bf9f43644d3255f195a8572b33737782903a016c4e53a9af0967b15a8f385f8effc217198f62ddb0947d73d76e42635f09757f63b83e337033f2336d2f267aaf7651e04661e0af5ab262d55788ab962fa45587027b58f26fe7d957f5c79b26f131f2c7c74db80ef04965dfba5763ef8feb036f0b609ce127d610eab5a9119266a31fea674bf859fb32b1ec301fb90c58e576306ff34051d2612483ac3fe46bb77bb75b2fbb30d76eedc3359a8b48284e67a0473767e641ac23f0f722cc76a410ed13e02c6f18c25e632ea317521f48eaa767afc28fb0a778c52e47e180000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "63", 1, -2055945936, 4179206552, "94a4ce71bcfd989b906fc4e7c196ddc6a1d0e10da6c8cd119c3684b821894c0d"],
+	["3ae1474c020e2691dc0f0e93fa19ed902b2d01b01c81880d6f4064bbff4e1c530bd6ae1ed700000000016a23fa1bb6d2c59698179eb0b66883efa5d2ed6de3c19f5d74edcacf9a22e09136d562603d020000000365acac02c5f10502f4e136020000000009ac6a6a526a006a52004b7982020000000004520000000000000000", "5352ac52006a6a", 1, 1908853816, 0, "22fa46472a0efc963b712f21721080cf73756b152e9a14b1915dba2b6713e679"],
+	["0400008085202f89042882845a35882812a6a14215a43560500d6457506ad982a2a45135fd73e23bd50000000009515153526a51526aacffffffff8c5cf576bd16c82eb7ce2643a24817485d4dbce5cf28e1256a4819d9f94b0ad2010000000765535365ac516a14315bfb8ec2d7fc22e01b43e0cdf07444fd3302bfdfb62e5df8fc18e998bf8cf9e1b8350200000007536a6552535365ffffffff8d4e630a73c3f6b91a80c33eb3fbb30150af336621cf0e7afd518574145ebf0502000000025252ffffffff0433fe9d050000000005535165536a0efc4d010000000007636352ac526aac7f271104000000000551ac6a5365eaec3701000000000000000000bb56331976e17301000000000247151a789573696e4d485f6df5761877939f123043c61f3f995d1fad82b5901c593f531cfed8c26fadb7aee8aaf4c84b4de8eedb9d9d93d72ff31fdcd3c3700ae7855bd0827f6e32779599b24ecdedc1545fbb161c6a25f69da569fdd42af9b0345397afb52d57a930576ca4f6e1fb0c6d10fe474d14315a83fcb97958e687ce99b50787b6536d0ff5ad4a49b499a963c9da9eebee086f8ebb87e48ac329fea9bd8ea4e6a0ec05f767eec4b4b8416c783d80ca9f6fee6374dd22a72a73e4da560b11cbc517b94ef480bca66f052c80e9b85070f1ef211ecf967df378fd99dda4b06563a603ff2618cfe8de2e3c7383d7d5eebd57c539a540d4b70a33e0b4f79672b78b881e9d8048a6fa53024cb2039d58b801575be01d1605b1616057d3f52c8ac6b4646b724087ede0571614cc935905ed4c27df3161dce561768895a6d6fe743d709d2ac03a94fc8c81d553d4430a000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d4ba745bf90861b222d120da65d50757a894771b03fa7903b65b15dfd21fb1a9d526b247191d0fa9e5065b39905ac79a2f15f2b44bc5b058465fbb6d15c7b347a673332c217135bd39452348bd0789c4c447e5a47186be9852d90c812ce6b8f3cc0953691ccb78ce64c0dfc6f0c98e9bd72d621bd57dd2866101a55d8670d900cda5dd1599dd9c0e8ad210decd4641020f843c758e85170abb9d6fe4252c24caac553204e474aef89cfb7a6e94942b731999fe5dea7e60934904bb11228d767afbddbc4bff772a480806babbf9d9da47f2818e29134b0b4158f65390c7062074644fa5b8930d3b1ca26a17c557858da0c53b57a22b4947306e3605e4d4031d73ebfd36e0301d1e22d025ef0852d7f76d35ec492afb72b84a0ba576f92b972edc846d78f9294b283b83572deb65c577e875d107b10a1d4f3e77c58c2a0c029598743d709d2ac03a94fc8c81d553d4430a000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000034d5014a0ba821801ef520de62c88b388427740bab3d3983ea2c00abe6124d79a36383af1f7751e980e247d9b7063aedac02c3b79729578f0b6727e317b37723d882546735b89dd69ff30089d364ab4b566808c9d103ad2a56142cc1f04f023d65ebce63dc80d8d5e7eb5949a1fa58a85f430b3cffc0b88b0c602d64240384c1f092cbfd8673832a70c8ac840f11c970bc8975b81434ab4fe5c770e6e14279b93e3a800def2f9699c5f1553730c4dd856d9d5d5965bc1040cfae3431b0591370d43080935c13085ff2ef5309c5e80542a61c9f6483cf287c567c3dc2024cba85c97298866b6d8c24d318c1b5e32999a8bb3013805127c5919f289d13a324fe9c6a99045a6c904839abd07e72c140b1c60de318bd18ec70020f9c32199b60fca1297fce4b26f869efde5b05ac837925078cc3f6d617e42f7b913e3624e61148bce6d2c3841d7b771c42f1a18b020ed54d0dc25d4d804d0633dcf07aec5763f2d288b6722a0db373c1d9086bb8bd57096becf0515a7435af92b7284cd3ef3e925830b8e1833a9d7ded8d7177965c2d395f3910c6ce3238c54e5600d519400a359b965d1209034bd4729cdb73cee00d19f50cc08f81396c4fd4fbc8491d09d2463e8641bfd20c15e70b3d185d9fe91b9838edccf4d25e7cb19fb571a22e50b48bcb4470b02cb4de7c0aa41bd741bb6255872ff70bc1d79038d8cecb8f8bd97a2813bfef5872cf2427368c0951f3dbaef4c184003da3c1f1f3ff43f4d1e2e9ff66651c6cd5b532a8d8669e3d39938a714be51f0e888e7223befe27da885762e2f1dbdab0281c6b38dc1fd0e34fdec56ab6719ad4c093aec5d2530a302d51907a591d19b7ff34a202a5f47f6c92dec3290a0482c8179986e650384db4125c648d8759bbc6ec5e31b3d984c12978755ae17afb5b85fd4eaa67aca53939b0947492602eb4e7a2aeca7e4784a0ffc63e6eb5f4065098169121659e7d464804d823e39ecf6306ce99b89e079b1248dda5129334d102cef86d8ce78e01ad3c69df0dbf54aa25f810677d7d5d99adface689fee5684927136eb1c6ca87ea6306834ad35acd16646fd6207cd056c5e59d0b7d3f836ffc103831058aef27118fcb81b3907b3e1a1bc134dbe4053621fcd30d0dde033c67d879512dad1beead07a16e524a427a56a8f4a83088fef4abf47cd16af45817f911928c1cdd49cbc4b454299d7769fd6182ca76284e8c0413bf4476ac2c42a35b7d398ad99717b4a557d088e03335895e97c3da742ae879f310d4e356cb76d266a29acec181d8c6bb19a2b70b3923e05af0fd85e5632d67662833943bf6dd1574a0183d089e3e8d3cccd31625abf86f4a0967e903d533639d11d73d3046821c4dc1159c9b913c5cfa35693ceeaf97debe446b06a31d9782d33579f4855cb2de085954bf6906e28bd7a9f9a189502db726bc293c19492309259b84f298ac9920dc0de05bf21c30e6690064d9f055b6bec8561fffefd7dc55518782725827111ede16b4291b6528df236f2a19cc6f4dcc8d048b8609cdbf3d7992f34cc1307a6aa4fa92568ae927c8bdd6d61aba897c84b4e513c9582d01b01b270ec354c7b7055f5b2ed3a39ffc5b0b63fdc56d020667fdaf6ae2efc5b73ee166c274e9723f3e700a924afbd02b2a4aa5842b8517b6b52328f290f7d984daee7144d955d1251d50b11a12d5cf0492af9232ade2120132a44343ee6ccb761f26fd668c55fc96db5cc25a75c58cc8b06ffe45f39b2feb73e84a1c7f2f653b170f922f90a3ffb8de745f2dc69ec0474615218eb30d17bad88dddf72c4da0dea58a147266990f2972e688250e003e94fbc27d0e447558f4fb9217d14f44e39d6604811cd322fe2df3375b825b161ec9c5c90d1ea556eafb2a72fd76e220e742abbc69fc7fb4621ded39cffaca643c86ce2afbfbb191b97febdc542cc8efc3015ae33310181e434c13a38de7295aec42d35c7119a4fdbe345ca509099ecd4ac2e4c2c8b2c9eccf8c2d73e5e713d0531a7e1b2233ba59e24dbeef0629888a5ce74238ed37155bb33371c1fa431e3473c1dbc2e0e34060189216a3f0cd2b03e649a0e684ad282daf1da1f209036e992ed997ec74081c3df84f94c68c4a4cd828f81c7d4477c9e1ce695634330a42933739ca2cc4ec6b9110b715481482a85e087a64a1f6de646d8aab882f72b8682c51b0a67b97c71b675496a34747d60c73bf1425d5a311a6b5975a966fefb34aadca8fb6145316de0ac5d25666f7fd97b0c2bd0648b7679c43c8b4b81208794c4b907b99ec43f5c194fc83dd7a2b2d8f8206f16e3c151f4d88cbd661c53243863fc55328df1083762083c8cfd4a990d93fbfe9b464ee427d87bc77faeaba5ca361acfa563ed7d47278c73f29f7935e98f6215f6e674f6b4defbe9115d6f67944914f93a90eeb1ca249f0e9a0d164d08b7848abdf864a0f51aa43015a4c8b4b01dbf0a69868ff56e56a880c7145c35d5dd7e68fc0b18105efbc4ab001c16678ba4568d9cdaac7b15bb401e6b9b05f9f38d7cae08ec6074131ac27031fcd1b2c7d7b254770a7454a05a8b4aab90daaca9008929fb497ae26ad570c214fa21ab8a6a5999cf8380987ba20ec9efc8b29079b0b8f7468dc792b1e51cc35036f0b015b493faf300b9edbb7ab25b3caa3357911cef8d08a5a463fe18a78a9b304092e5d2ce12ae7687d43188ac001dcfa5e296a9b92df53ba4c57df96cf4e9b39a9af49bcde0a3016af3ce126e7ee5fab4bec9e34f146264be8f4a7e54a4e76160c0fdf67694468ebe40be667953726539985f364c46be50ff978cc783ed400beed1b9b27539746c0f06283ef4ffc5f2106cf051db9e59d3a593d0f93b96b2688e09c541e0b8b6a8a78c816a6e5aeee337d0a3c6ddf00518ad83b8e55d30c865dc91cb59fb59cb031576afddf072d56da56f8fa614a0847387e751d7d19caa407a36585451e5000dd5da70c61ff00022a43a8c27e4f716d33d8213d2197de490cf374a386fe61b383b18b1f73e611d8370b44944412085f0312611233130b4ef8d95f733fb20cc661836db8fa348574c513e511052e1389106887b21992a0ff4839cd5acd57f839cc5babe7712171324d449b6c563750499422c51df156bba5e6a70cd49dfa7253cb8b7c7e03f79e8abed08ff43a56c9716d7604ffda71571acdd272cea97450e20d9b7f19a346436c3417a70af240d8674ff26807761f617eabc4d7dd36544c258de12f7dcc08ab2e9c9e3439bda9f0f9a33699a12500c34cff2dd37f714fa39deaf634e1b63fe72fed3d39beaafbd43cbc1b97aa34c26a8a22bb4fee2e119ff3c7fef3e420c9f30c869fb7def3c76a7377165d1f23fef88eaa13b10c476542a6822f120b6a4a31ac4aeff9594d285d775d502c50d7a805bbcf34049309b0b07a14d47052f7e58bef3568754d7f8ab37a18b97e656029fd6ddbf17fc1ea4c13199382b51113737e8da8e07fd05d1434980d6afe53303dd17595eb52f8511645a3391987ce491f8f5df3bad745e2a16527d442d1c753cf4dbf35cc3a008548030c9b40c8e8c90a2b6b9aab687291a05fcd9ac28b4d9db2dd1cbd85ba121bc92d10fa53869ece530ac1e3b5778332e1d1a4232bcb110f853f60e0c6b20bb4a1d2862f24d89d29dec821a9909cbf55a3ce5a63e4eceb39820db27a2d822ccbbb9a29ba0dc216480fb94822f9c809f04ea448e7f2e4b72d68346597cd05e2c94e9658bbf54fbc024f22e3d44eb236415dd76f8fc0c599da7c6b3a8b3694a901acacc27ee660e3677bbdf83466ba3f61f34f8312750f82176b8c1e5405bf85df88cfe77855f4568c0dfdea1a4e17e61136014e5cf14df02ac2339eefa0d7320537836fced62a939ed5cc635eda1e3e101f823d7ce12664801e2472aa013e3dc6d7473bd859be27998365cb36d59382273b3f63eef4d8875506b35cd7b893a4c9decf6050be3965a2808addf84bc4e35319cc15be5c070966e05a2c08917042801f2b76b8cc4b00940348547505000000000000000000000000c0978cc6c55971cc3702736f1a1d3d6d1bee472081d2284476a5f2527bac5946e9049479b0bfe084b35b30e52be477d4add752e18c9c24346c9821484df2e26f1be9c7d5698bff4a6ad4d19566e977584bcccd163f7a8ecba49e4f3581264b7e0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000024537adb3fc08e57af7c9816f6473512e1e42d6c2077b98479f1958f05c08fb4fb4f54d88f3601c0e89f2a7c45c3da22c3bcc9a9488c7d21699d8856ab3b36d448dc3be512bcc9ceb09a1bbd6c202c0d0f5a5ce6f303bd0210b6e4b87b7572bfd31d4d24e7f4731ab9d73a700583b10628c1616f34c8f223511577d13cb2445dfb7e5790be62b59a815e976f95bf2d9267eedea95861a849f82296b09791cd9c16eaa77e258937a20778bb19d9e98e23ed39c198643bfdffa65b3a1f060b19841697c88bb7ecd273a249b6f33aa4c5b95d600dd03c9648a2f56b8c00ab94505f2909dabbb51aef6d2a87ca3f554b4de1521b90dab4fb366829901e4c21df80d8f72d6bed5311b6b35915fcd0a6dbc1fc2c13b1af04ab338abc2458bf20921e10be6b03048b4d45254447c13631e928cd22001cd92598e9b30e98dc81b44267f4b2ac2bc91c254319c6e07a3da0c52da546046f5d86a0f71c68683fdaacdf19b7d9950b28deface1ab0fac69c7ab7572b9d48afc1334ea986331979bddb419b2b28c8e6ef5ca61048fb954c295042b0ab8dc78ac65f60fbe298cb2f07b3c9ba719b403f44ae7046cc2d0dc23176d10d0574aad293c475ea9d22cfca2b07b4e626de7241a782c7fdc2e15db492cec1f8178cc3b62a56d250f5d03acb5e60a3df3f0a0b5862fd45963d0b0572ac97e67f9d3e95992ae60fca5250cb8caa75c9315da4a8a0b2dacb973f6d6aae81606818f338684d1eb5e900d9706a4d80ce4ebdd22b4497da3d2b5656ae426697349fbbc7d5ef9d788e36a4da8cda3986b44d57ef08ce3af8e01b70ac33a44ff80c74cce7129da1660b7c1a07384ff15ae0a53ddc9cb2e23197f63e7e47436ea3e58977ef0dcc20be15439cf90a602d870c197f75f7d28cbfb01c7dfb6711c418769fae20e4d0a6208d1b559c82c936c3a19075795d5a1d0ec879244300e7c4fd37bc7191ad9933fc0b35c585a79af99db9ec3c8322f1fd1e0645406417415bb0275e482b2956a40da3651e28882fd96838bc8250b180d7c8edca26747b57598a54bab53283d7f8418553e2f9c89b38e4088118fe3aac2e967b6891b21b89ab849b8340c36c1d2fb85471db81124494428448ce82ef405ce1ed65b3f8d96eb3c8e0ce4dc27770f1ca9f42feb0119e1ed9997faa26d64cc512bdf832fd385b4104ea583b9c893c427916e0309f425da29e28a06eae5f43126caaf81b2c958fa66c64abcf36cabe493d54e0187af36ecf9f2bb78308a77ec35c1efbe3de22e57f8535c207dcf8142376fe0a9325d9cc6c0477fa3e7c111a34010371b309e99b258ff3ac8e926c3e03ace0031dda9b4a50501fdb161f079b098c63822a82bb7c319099c42382d4692323b7b714232d2b0ce2b21372eb945866111e4c32d1c3a4227e6748cdd9d6daedaf638d44aa826706a534c4b0322bc0dddd94f54d1dd695d841969014e0dc35d4fab15c00ccaeda6d994d94e58e7437eeec55b9fe0864edb0da6f2a19684ef6d0f4acd5e332f05aaf5453e7883fc0954ae6b05c1816187d4c5e7977e2f6811d4dbf5add7a99bcf3dfd308ed656acec50fb8c03a8712602507bb9cdf1d1ffa4d77efb24a9cad47462b54b5aae98e7c8dc8e0b2e5a3cc27ce8a132bf8ca4c6566fdfe2f11f5e223d903c151ef4ce65eef392d0ceed22cbfe40005eb000bf8c1445b685ebfe8a89cd523606263b11d32a736fab9a775a66d3f68042369d6d6215656569d05b1561eff189b1c20c42805d4b2dffd6ba9a3788d662a59bb1c50750e771e0835340ca2b8c7d57b5e0fc114c485af54645df7086fbe3ea258acbaab941b9bd757e2d725d2e5c0e37f435b63e7fed4a45b741dc24c3151cc6293ea98a8e71538aef9e058a348974ac29ba0c29c562328edaed46504ba9d0e37a628d5741627336e513e3a0329396d15b3ce9c7f949f0720d753aad614571d480d0501134a5e7d6f1e6ef1bd8a700332a31dd97d1482157624b271dd267b0ae0ad057c5ebeb0d5b6281e9b68ec9ade3ff909e693ef46ca278accfe9460df40a7cca22c5f310c961339a7a1d8a0dd90a4314b04b92547f7cca8ec348cc22b82f6324aae8f9f361f5a4e1e7cc8f426ba9c91f72ae793db342cca56d60471a2f25d23f29bab16e1b301000000000000000000000000264430af355c2bbd436cf4f1132b98112ef8ac09f54385dd2d2a2c3604527cf8353046e32aa3db489bb17412fc29b944d996e38ce585f2502a555ae933d6cbd672c67783245d4a62b90b508f07df60c5728f02615ecfbc8b68ce16df7dfaf6d30000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000086af4a7e7f062a1302a3f7e11083d40420c2d4ed4dd5715880b30bb81de3cae6f3a65afe023e464fd28b073acd8be500ffbd97c1b5f33b171a147ec4ec27bfcae3acb62a53e69ce1d540c2e1f6edd0a6321c5b539d00095bbea0ef3f940e30a44a59767869a7b75b44b4e36a5c8eaf944a6c76d7e30653b9a8bdac5bfbdcac492275d031744da242dbbd825f388091e854a4bb603d3960cc576ca6c97f0f6a6cf89c11bd869eb177c5a0ed3df3e0e8a7a638f824d6257d715e5d55144092c964549bab5000448ff8e070a06a68d5fd533c5347a294c723ebc795c18161c9d189ee19a285feb80f1457a06163684e764dd1d1ab5495a1e2f96cec7c224c18faa7e2a45d1702ab931a8df02f322761ce129c8acfe7fe6b7e4c71b68ef33baef8b861b68cd836d25a62bbc4bd8149075a4f710848ba933aa51a30b8ed06bc6e2c2bf27f0fa47ca47aef17f327329243e75c123f12cbbc07ca4cb484041a20f6322aadb46e5ad3468e1dbf8e3ce718007d02e105abae676886478a9109b05d40a007fce2c2ffad3b457ba3d0ef567c2eab93075abaf70620f520a7060fcbfc202443755582f9f4237da64d6518c3fba02f7d92f31b1d1b40708e873bf9456692d4d7dc6fa6f4e61fb436be4240a5adf89ffef47b1b336f7a150f6caca4e8172fe74a1cdf5e030a47bca6b5a7b33d2216a1521b8cf0d2cd34e9bc468ea7b4450f6cd4ed3d02feb32d3878cc040943ae525f26abba211812d01796d588eb9585f43f24b9ab8761bb859a5477bf8b15580eb485f11ee95aac42a81aaca225081e4baba4431e2fed8ca5369bb7618894d6fdd29b751470dfb5fb716665e5e720bdb8c8fc526c49fd7aa2d6b133fe84bd4f0e383852fd5d1922a3d87ea29edd7ae3227fa439cc43c00e43e4c75193abddc420c807b45fd347f618380c5f0c0090db742ebb0d42f085d3bda67f4ce740d1a1498568582fdb06ec428cffa0bd64b1b39441b165b65ee4cf3d15992351a0ac180ed8d1be1558d04855d6a1d09aa6ed502fc866e045054c3c4c2f8155a4913492ff20c1ed3951c54b7dfd43bfac482dc93ce0f82ad6c09ed467a2de42ec7091f9e9bc80fb4ea4b87c28760909c3453766ccf3c3eca7bbd290992db82d4779fb07de6b3cc122996a5a54cf6b278b49bce3f9374baaed2eca2909f10161a5eba217664615fa116f49a741913f558c62d8c3e1444c4076fa8cb7532670bc2e50cd97a5b16ae5fcdd57e6e43ccd75108d45657e79ca1f50ae5a3df78626e89142647dec6664a52af44659b0564c28728fdc4f1795e4f58b3a5410deef9705f1b5d53f54e6c4b8df2f454601fb461bbc33a69dc68a714aba4436ee4908429a17fab313b7a2b011cb4ecc6e7a411d7e11410e17d69aea4cf025af9c1801132d7cd9f9084b144bc58fd97c615bace2a209f9495c16f230ec11dcf1f56a54d484911ce0a7419643c950a21a88c9b089a6dcb8e719fb673646e031f5c29fe204d5bac80c609ce69630bbba68cd23931e7ada645414dc9a6a4da038746c8ceefdc41811907568e34e4855fb5d080fb78ce5303b9799f6abf03aa29530c8d0c0c4a0a8140cdec6bde08a0244e07c5ebc48560bf90d43ee9961a33a9f23e91af26ba43d5c49a19b9788d8ac0094e2f0f489059d53fd1d798dbd8637978717b5943dec1e40fc8a83932af869942aeb7edaa81e5ec669f2b410b863574067cbaffb9122bd5be412ea35f0efa21166b0122fac4ef87dae281280bfff473d7ea3deb7402f416a3f19cebcd16e1118db5c48755addb7c789f8435f744809dca4b9e6b431f73ad0095c4a3ab6824ada0c71690813d89e768eda92e85a749087979d35227a29aca7ae29bfa9be09f402d0bd2f4d231ef22400f202141abf5bb95b974b589264373dcb458554a2384ef2e646ee418537a383f3c34b27033570711c8b19f35356ebf6d4bf13305781c1e509f209cb773c4f6831e026e9a3749bb084db8248c3968fb986d52d10c6ccf291543748093427bccca22d3be2177308e30e113e60a7b262bfc9a10a0a0772250473e0456e36bfa09135314636c0052c8f8ef9f715e9399e38617da0bfa871d757ade0e0c24f48fb3abefcf128904a20abbfb03a8130381888a735a6c369e6cdd353ef03000000000000000000000000f93db0363cba2b6c543892cccd45cea5bccc9efe20155465b01953beea94cfc82ef26cabb964e29895de53b6f7dd50248970e895729822e2f101d7f4c016739fcb1f35ca6916c93e4db06bf1695f399914cbc7e18d0c78cf8c22ed2fcf243a3c00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000f59a368ccf9ca79d451c7d25304ad82f786440c36ee18cfcc418cefa0306030782d9bd271ccbb0a1879718ae7fc9ac37ec9c8894a32a566da75e249f293da5e64d78b1791f8abde730ee5baf36c49079d9f9a687943362ddcda30ba94ed8c3909931d288d6fb068f2defd86d7b0bd228396a3cc9c358519555de7903a928d8a6429f44dbc4af22feb2886dd127c7493694a50dd6d5b9030f70b7683de75076abb61721909819f17e3e407144c89abcaf2a29d3447fdd4faaea12d6cabf534b17e8b5a053951c24013957febdd3354bc9a092d139e5a79f901c3178ebcc175b2a8fd3def33dbd1b9ffb507c16494c2c3bc768a45432bb8d75d1740d8d1efb770c92a442d1a784e725127d548a89b1a0e9cd531c9e939a8fc94f9938057ef938f4887425e1a8a2e4275a3eb6451bc71311e6e26f8f263ca48e746c0eae834bec5cb7f83d082b1b19b96ef299771c32ca31c63f4cef437ec8a6dfc9481f8f3ab34474c08458e0047ab977259b0cbec0c8b2463bcb5fe7054407b54380775a3a6e3e94ff5b180fbe3033be3fa74b5331e3073a7beeddd5dca9a3dbedc1efa45ec12a80c7c16a789b35fb9989089e0de0621d2d057232a2ebceab769ec2ac72c14d60c3fc41835c00871e5bf170a3832030cc7af3352c878f70b67bf318bf237f70fafb01ab682f4a8a0e1a9aabcc2fff6b1c08a930824d6aaaddee62099de02af113f5a6b3c4f39b10212aec4dc28ba83bc0dfb95e20c1f8b4cbdb8b5ac23af35b1e68fe9e218b1f7667170b672dfa42701fe9b6291006d5d8d87f5c7489b68fadf3cd355381dbc368dc0cffdaafdb3c7d7ca68fc429e0406a8cbffc09312bbecd565c2b4adddedd67a8e6ad7cae03d1fef0c1bf85fc5c48e329f928d84607c838fa08beedd13e1080287521fab449474e218073483e452b68c90d7d0ccde7c84e4292519452e87ee34335c0016747b92312d773624ebdd42f6ed82bd46f0a970379ccee458fe397322cc704dc14c699aab42495f5b2d667e5be65f83e931102b13a4a81dffa2a36da38a1623ad19a551b007d31479bbf9d3ed718f2760c8bc1d39564bc8e4f026f5d1bc7126c247831cc0a64c53efde4dcc28eb00a5ee58e4335e5be978bd528a5a98036fc9fdf990fde09334f9ce6a03f01626fe91411d883c0e569e2cd56474003ee2ffb1b94cdb7339601b93ae48e245d7b6c3c328757d9cff6c2604bbbd8619fe4f92ddb175bde7b4c9a8ae60c58c8b50cdc741cf1a1e97b6bd4354c29bfbb1369ec0bb0ad56f2942cce4c60ed40b2240c766588b4031f9a09ca602921c10bc2d9643bf4986db88daad4ccc26343f45ce7610e288c1786c8b06f7cfeaf32ad40fb96b66bf27f1b75a535d789b74cf586985350655283a783bc4c94eb44e4aff7566c6f1c0a9afee35f0e2671588458d97b5f06e589befe4bf73532ab78c7d0e263d28095f76b30064f555f16b688c0efd6b3f10f3a1f4bec6402df5d8ee5d5929181bbe0f8745102d288b1cd3e634cae56338d420a5bc0d668b083395418e79a0882828569920825f1008468808e4b8a297170307dfaa840be0ec4d822a62817ac37ac8f359f4d7199362115366fe2cb0e0a760c3371e43d76cad4814fb3a8cd5c5743729b75d4e1b6d8f5d6b635f915c03b4f45cd4f04cbb96bf78e36ab375bc5cc677cc4fc980baaa44986c84c4afedb85bf407b842d2eb173074e444917bb76120ca913f693d510dd0ad9168096b20addfe4187a9f12228e59a72adf1402a5dddfe38f06d2dd00b3d128c799c6c291ee8f5188c8f08387d8503d392851234fe82738dc103f10957e61f80d69a22a50b0824b591f0c7d4ef0cb1221cadf8f2d6b204aebc072e3c2ae203d0010ab4c6ea6e5bdd27cd6e7d581dc93f94bda96df5543fe626dfd5384edcb32d696ee1ca2ad9ddfd7ffbd4f03cd2b19de13bf66096f71299416189c30809b9f49d99b4a9d676cd1394373330a27b9fc171d908fc287ee0682d492632188936f04831a6dd4aea4da376dc0014c4c3b61f2927b81b5ee3bec6d3eebbc5e84782c41fb746fc069fa4da2103dd7fc84d78acf79ff8df03796af4b1e2cdd365ce8231a4af171a5cad0de7505af550013e2238d0479ef34c209568121dd9fcd042d5810ae56139ce490651e3f5536c0d3060818f130c794f60df3be7d41e99b8b8f43eb2791e97d31973276ed7216d127e7de50cdb9a18c844c94fdf2251f505079bc50395323e50f0ab467b037ec79ad0dee0e484049adb916c79c9d10ff841610f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "acac006a5363", 1, -285889158, 733220448, "3342def4b8945d00ce2897e76f2aeca0e8617b4f47da206198b00935fe3ff4ff"],
+	["cf789221012f4ddf5b113f76787f4c000cc192c2b5b546d3c1a145edb0bd12ca9220616315020000000663ac6a650052ffffffff01c8e62e0400000000036563630000000000", "51", 0, -617165021, 1953719636, "76441365519ba73372294f66f6fa1bd12211e0ca0e0af7b4de5ebaaa5f56d585"],
+	["0400008085202f8903de8e9133a8028eb725d2200bdfc1f8105843d7e9ecf13efd71ba4dfc956011c80000000005ac52ac0063a0053547770289ed101a3d9f5415d3472a1c7d320e0d8719db54d44ae0cd5f9389701ffe0000000006516a6a63636affffffffc390591a8dcec9c6570f71ee0a7fd90a6cfb5ebd80fe484f51ef27156ab324ef010000000651510000636affffffff03b97b24000000000000caa0b2000000000006656a65635352533b2d0000000000000000000000000000e4803d0500000000015309bf478590da9de728cb6dede753c182622b74184a67895d8f8505d4ab84bb09e6f97819be78e4de826a77294de2498ca1ee85f65e51c7a4c8a33ca511f854c9c90bff07db9d6300c40de545db56a3a0710e36941d7072ffdb24db8fc2eef13a9623bbc696fac4414cb03ef1fd3f1c089a207635fd558746b9789a43d83081dc97425687fff84381fe9544d9845c64d96f5c8218926ed86b8fb72fa5ee4694fda4cafd56bbae372d9cb6d216661f5a7d2522df5e628f68376b574ad2b6797dd60180a760eb767a33d7e7d7deab6046ed10afbc0855e19fe2353bb6cb0bb507e41788f6716eecf9ccbe90be21bb65842c4915717839b8a1919719bdbb09ad6546a30455b9d2065f07b30dc121880e39e6b8ce5d2598d4325d7243f4858b9aa590891727bd90df46aab9e3ebb9ea0358b0963753db70c9625c6b98e7d958ee54e0e484049adb916c79c9d10ff841610f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003129805ecd28bb96539844ee4024d92b43d5677aa530d4e34e41b8be61695f652410694b8ed08ad4e102643b9b50d8a92e7a0045945a1158852d5b7cf1bae6111e38b489f25840c3f3433c00f8c805fe60744c72484d93def7ddb5fcd2ff5f9823161633ccbb5f6fb79358a82086d68ff2704c8117b402de1029a6917c8e677b6dc0e9a90c049b20aed1e5695e5a1fdb2e174dde0d14d9216eda8507fa863df316697215d16205e00e92b6e2a3522c608ee96d201ef29e43f2fc4ec8ae825b407907073f412e0fcd659de139917c83952ad730ee8c0c2c4c5f048881ebdc71cc35ee8e4c32d654b7999f64313df8e85e0333ef83d76a2ab6cca5ea9503380dd6beca6531562fe0b0447e490f965e9e007717f8b8ee092837be7c767b4704ae6d4583de2bdaeed6d4703d788b77b3c80e7d04ec583dfd3f4c9ac4a503114f4a4cb334c097a1eaa7e3f60a236d572af9743e6119f223680e26d8f2a205e5213ba99700d20515683745e442a2c4374f04108ec0453c2d1d4fa6039c6c5295825b526c51b419fe209f80e07f7d4ef6f9c07fc6d1f4f872e1ad8fadf2e97a2b87760038064b765e0f1b2930529df5de5213c47f12d0f7cc623c269ab62aaefb64d5172d5cf03fd8e5a9fc68831ae10955de4b002b705a75115024a16ab37e4f294daef59aad4a3fd3320bc66adf9b5409f8f1a25a2a7ff369f944908a6b93bab633bb4d95a7a2eeb8efa82456b6bb3d74617d4a7ef2347362cc54a98b07d9be0c65e2ca2e187d713e51686d02f8a7ddfb6b98b414375e087ccb0ef67b442595ee12e20794b4c7ddac1ae3f1f4f0efb9c6ad24230dc58c27ce8d74cf05dbe6704d900084b7ec893000d81a532619b47886216dd6451b9ad949117b2fe1a09950a2a82ef4411676993bff9538041078ea3a3cb93a7d7b1963e5468c6613d5f6dc5ca6f3237514ca7536cd6d03d86ad734eb2431d0017d615cf38abf8fc07d0c6251a65e26c5e4ddc8758d5d36a9ce4f65af1884ffb50fa5b83fbe8f064b198e9592c4fb5f9638168468f5642531d56d9d2464bfd4fbefe167e8f42fc133769f4967efedd91f9b739543e6706beef0a08eea498b536182565d998a01d192522be3d9391c137d706ebd73c66132238d732587d7c9e0bce341764507d1169e6a7f36d5394625898863031e93aa2a6ef16d29e02d69e2f2bcc0f8756c54ca8140a44e6f22ff912a585c2efc89857ec9d5e58b344d880f2106b081bcadc4420650b3839a34a9e1bdb5ab021391690382d7be2a0dc1a3e8dfacb84f737137387886783210db056e6e2f827c44f7bfe302c251c45d631b20921d481f547b1709413b900599bbdcb3a32d1dcaa85d169694982b432e4a57accea948e0f18f933451d1d6e4f51f36ea2c0a0809bf044027e5ecad7fa4b55e6ce67ad35dc12b5a94824951826e543b25301e66e9711710e64591fbf5caf0b2f92e6ba6fbb58fe3e1057b525d9e0fe9db23a6251f72336f4efbf913c50fb67f8384e2c1e08615a77bbe12121800e414c2cf9503a04ad1e157b2a83a7210324dfcd59a1f01f48e71796a2d746f7d14c0976623b00ecfec8bbd14a17d1d4d0f7bd96292e59b3e9c3a2745c0ae89bae319a43d173f16959ce9f22eb4495552c999ca49e3783f754fe8a1324ca73862fbb5d33615dd8ab2e68f94f8f0d1614659913b4b805902909a19a77275c2411c09a46d74aada7a6110e667a46e5dd493abede6df3b9d1830c20265642529193646582e5251abf6d4093250eee4e5e56d2a835cf67a5086eb125d4c848ff335dcc9a9aecdbd63969acd0ad1474170858e7bb4668b10b010c57daa1c081fbd0aa5b686ea3e18b7a61a3a32f7b7609f622a6322bd035169afff90490b054dd3479bffbae443e8f82b15eaa729a49c286299d5600b4706a2f4711b4bc43984b333c7d6b3c7b6606f99ff96b23cf675db3bb0bd36b4e48f956e29b5b8b7210a4b1c41d0536120a474ddd6c930eeef960b1f065d2936975102beee8a0618db2f5d1c5a68b0645967b9fde9b8b62acd7e8b70be254e6fad3c2e75bd27960e9c5b6bdbc232c055acadce0d8a78b72b9becaa5eb15dc768f573c5893eb40284965c12e935d67dde7b9fac5863e2ab4af2e15057bf574276c715613f6b39982a2cf16cb6ac4abb4731bfa546876b24c4330baf4b4d53438cf00756b22bdc7bcff2ee2f278cb57202671909fe427f64194235adfdb616da51073da5b309b6b9ecd672eef36c18d2ad930c61655f8d17f9cc0f02eb176e8524a539ed2b4c2ef9a04afdc5d3ab3244d9f4c3d6bc372d24d697ddc8e25c3e8249d677529c4a69d96d141bf892d71ed0345133788e5b070b0a54bef1421dd72402510136ea585625fd761611cecdd548e1bab8798d0ce20e54c9bf19c9ae0d58136a989450149baac0fff4c90b47fd1da171778f0fa620bdc6b0d0dcf424834f5353558e63d1bd273be93c9258c90011fa61c04f8ba2cf42cae93ab1167c65da31d55688d0ebbd2725ef212543a19890914d2acbe9ebe8dbf680ded55c76b8c7b32b06abd36d82869d77238bb96ff2045b3b402c54a691ba64fd3b0aa27abb0d4baa0ef28b78254745d7010a6ce29bfff4488bc2651a453f782a22988fb673d6cabc81c76d55878890ce4487603e538dc188cd5a3c685f473660aa0d119a0d264f02e3448c6d5385d21c9751a7126e7ceec6b49a17d609000b77045351fdfbcfede98bc827d8a455fc5207db50768048f826193d2dcfbf11f13a6b1d7c5d392d605efe4229a9f9de268d83250a9149e03e26a38202430b71ecab0cf932192bf716f208345eebfa03e33e09e74613d1b482072b3ca36c49225afe5598be54d04642540d10afab25ca6f9bf46117d5c35d83b185b5e85b3aaf83cf59e1a2bccbccd2c0cbd3b864b0076d55b86d8854397498c2f2dffe8b73e8969af4f95e66023fb01b06f0c7e3856d222c7a213190363f94d5f768032eb0122f8a0860ec2195aaa25b681f9560ebdbfefd1dac52ee78c0c72991d4aebca466a4c3d3033b87588d4d9314717f6ef7b1fe94f36e8b64c99cd8e9410a81d75d6288af395af96af68208a677d52353cc23afc58c8eb08676dbfd0402b5f30066109aea60e97bdeae97d4209c9d1cc4b623d682ca461b539f92305cdf6f6dcc9aa859be175aab05cccebd7e43872280f929a317b79c0cde5df4aa57e8090cca357d1120ce31d76b6eec57a4a452c5e30a3942e5e3b831872540c2f241652ca5dfcfc7ae76706d98f4750fbc273fd6341a506495a800b5dde5e1138bda01ef415d5e69dd22f7b7bdded794a782d3861f4eaa95129f1c5a21a6463e1bd3cf366f0ba4c3fda457ca0b4daa2d3e82e82090866101bb47f6ea0d29a14bc03c351da56701b6efa2c70974f912fbb582ff4941b6a2a8053707d84fd7f9c29676001722251383a28186d40ee4189690cc10aaf11dbcbe085c7961a7a7cdfdd2b1c1a79831a6a49cf701844df785f3ffd3e73d9320f67276e7b79920f776a4c9b69312dd376cb9c1ceddcef2868d0282118bbae7ffbeeeb8c91515c2f5d6880a92c17928a93ecf9d771959981d0416138321e5b7a0d824d9c214d944a153b5547a479b882b97bd86d309fdf18290e5a78dfaa823f1088e4614f31abf3b3402fb4a565e6b466ad905c5bf2f750ee869fa8723b836be360255ee215434eefcabd461f6cbcae1bad3e7fc833cf487175302cd04812587b07310bb997a4953d307e7b5b89d2026adeddb045a014457f02522b83133a418ddd8e57b461f0b63ea1792b8598eba713405c445b0cf41b779433d91e78900239f4d8dba9052f53f90f7466b93ae576cd23e81714956307886f7485399e14c0c68a9a8aa33b2f7fcd2eecb1731a1cde7a1d9b5985e5a8a126680a27880adbcfa2ecea1690cd57513b755828ebbf1fcd1b158c543fa8600183562279c531b41552c298077243a37304f702a1ba91d9da3feb6bd21b9ccf22180ba4d9409eeafb2d46537fa7b8010000000000000000749f9704000000003286dd93e65d6c813adfc7bb708438b2663ab5e343d4f09d30679a7775feb69fc7ef69ba110e947a7e0e6a1fa0405a01402d04e5f9ac5bed3f14bf1a1e164170d53399af26b1238640b5e9f5e29a7cfb0e38f7293809d457b77539e555edb4bc000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000005101ba1537d7aa166334187148abd82b03d132ed20cf48ff898a3a5775c4531674723224cedc54dcb4159f22e1c2330d40157b7f96abbc87a16afd9a2d33aea5900693cd54ec49db6916748b39c4bb699fbce488d14b208d804554bce66803c76a0e164bd290e9d36e44d4b9d0c6c591e2cf77ac73de7dc0b511bc1934ae902af4c1d2b40a4c872f2b03cdc70b292059c7b91655078bec08507a350bf4254583c9dcf0396467d0bf09f5e9f151cecc3677de8703645559f06c8d50ae3984b183df4f4a7808e28ba8dcd77cbe0de00c007bf8de552bf36af0a940032a6fb663c65bb7d2d11856fb665b7364dd732930fd4759cf343a06daaee08091ad3ede93eff51bb9a979dac797dc69fbdf9e1d46042aa1332f2e31a84ddd5098d82bd6a38c4ab308ca9a775fc12159d01783209c9113a94c163bfb8243c62469058acd6064efb57811ab088cbde156474334470dc1cb0a7a41a7e4c4041a7d51c04bb201a23dcc61eb1aaa685e41c7e63a565538ebf22f55f529be87457188c39b3807dfe282fab38e03629bb40dbecf28aa8b61355b917be18713517ffd9d722ece7909fc1f71b1cb8f870c14a940dff0a54573b132900ab672009f2b22aa0a8dc8ca238abed94f3fb922989dbb5b765bdd9fb38c3076e562c11713d3e3e222309b548563f24aa8cbdb64b9e837451c2478be7ec1a321d621f1260cb94f5d96eab4c2c77388e925eff6f5a418db4162457292fa0c600970d926b7b8740016ad04ebea53d57477d2d61f8b3c9ee776b6f1a28267fb72430204e3b0be5f46ed00b1955a69e04542708dfcdc7834b39b31cec74777382ac89202a8c798aa1db49691410a18b05cdb51ecae9201fccebf75dd6a247e14804421f9c321670b235289ff32f19c484b461e389a44ed023115ad694c7cacb315cc01b789044d2ef0b797fda2127122682fe982277809b40ca849a45c454a776071fa7ca1b0fa21c208e1da89f283719b4a60055f509b4855a26a5de82f9ead01a329273b14f784acb6c1d8c4489f13a426bd7583aa660825b84733dad5e2978fb613688294ec3d0f37e4cf0410d05e2f0d7c5137770233dc664364e3c078a8c031cca5c84c357167ff7b5ffe70842727bf84811d6e8fbfe9ba3ca7dfb256ac1e2dda541d1eb8b1b5ee62be9552f82c6f8ab826f1e80a0242967f1aa8432f3abe7266185331040639ea1cbd27774abdac9e0007adffd7a1e9b8e62f6f8092d5632c0e2df38ef70f020dcafca81023148e7a662b718d3f7b08777382cf2964b57e6463bccaea832928749ded9239861ecbba77974224163b2f8ccdc7fc790199c0c96d745c3685e63b0c1e2293f7ea24955fda3399a433bf52a83e691fe9d2d6858668ab2b782606d28d9fd2437bf4a209dbd24ed660efb585cb5e4f3f53af2055fafa91208f2b8634dd8af9e8bd53d4fd51e1d7ecffe458c9009699b6fbd340c293e067c98046726e540e14ac2ef8b3fedfd81a752594567fb94feace3f3db61f73ce6e7eea5e0910a4eaf264e8a802fcc42661fdf24aa38b36b3d1d74d390b847f281828f52dc92294c074606252bf31dd9ffdd06caaa792eadf9d9b5477f28daa38622584ec2c3e4e56f64be58b59d30fa79a3e2a37a2c350d9712d79c90b5f3a398b16f4eb5fbb8be8d39d77ae1d612b9acb11472dbe4318dc25786029524cfd12edcf35423d69ab1b72b15d95901396ba5a66fa7bfe62ebe0840b421b2107890aa29101ff616ef992a64703d700cf081e920e18661447559595a3a940a66676ec8be7c28614c24f9e1d862bc77112a697053c3137359666d10fd61173644d2962ae3d541027a8ebc5ddb5d6b819a9d852bee309d918928e852094537cbf25c8acd663128c0711fba0cb44e486b8dbffb0abc2fb16b93a490df26e8ecb18c4210721a7086d8d8359c6743bb4ad5f61ecf7cdcd7bf74a629e8a35ad0031556b9d16da48d71ef002b5576ff6f1f45dc0d73218b1eabb47b5afd2e9b3c4c44c53156e774e961fd5e7adf2f3ab7a7bcb874c21bc3671fb220ab1ad40b46143fe2006a9553a9497b9811fb4ec4f781830fe903cddb2d924610a83704c7beff5fd52cbfe169addcf9079e31e248a541024c59e8f5f5781d0b142dd2a004172063dcbf9e59638066847313388b3b04fbb8c52af47e25206e76a0dac54a85b2808f5e86aa56c12afba8087b8a35704a8aa3c3cc702313094d3470ed0134d0162a30062d22659ca647db7f44cccd41b320927679b939a8e3f259a31d7ca7b13b93809680300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "6a6a51ac6a5300656a", 2, -1675895865, 4179206552, "75a7a20a191e8e2b375dcad5606a815293dfc16a36f394e284c44f3acc4d3721"],
+	["b57265150493221cadc077913fe8d381ff1b4b85c999b3396973ff375ab38f45ac80178f6700000000009556a831fb56d5ed124b399fc7d56aab2622b5060d45bcbf83cb2d376026a251677937a2020000000963636a0052000051acffffffff4dd496fea0ba95c4c2bdf8c6112319053ead5943b41a59864b705220e8896c9f030000000753636a52535300ffffffffe8f23e4030d29162e74510cdafaa1625947f752343f8f8ea6b9ae829d24d6ae00300000009526551525151630000ffffffff0266ea9f04000000000863ac6365ac525163664a4a0500000000040053ac51cc7a59cb00", "6553006aac6a5152", 3, -2077629284, 3925833126, "803eeade3f5d9fcda5e956266ce775df829e6080ee3aef748329b7689b515565"],
+	["0400008085202f8902ac93b5601f90d14cae665360c9c1c8a3016e8c2b97a6c80ccb23394ce138b1f6030000000551636aac524e35a28137a66bcc09f5d2decf0eccae8a67f31b37b05dbde986ea6ba57461712cc3ceef0100000008536500ac52526553ffffffff0369f2ed030000000009ac6a525363535251007b8e8e0000000000016a2130c0020000000008ac52656a6551acac000000000000000090be760300000000018211c46f36cd5168e7c9b7e7efe44dda66c8f1662cba34768e7e50e7d868bb064ae87342dbf0a508aa97426bcbdba7750b99e0b89d67742fabb18691c0ceb55ee90659befb1e89f03a2076511d4a03057916c5bbbb3beccdb09e45bc6045b7795cdc6313864219c2b7a03fea8c1470a19c616e87423eea290afeeb9a07f97d734ddcc7c2803a195050fecabe78885e8f942b9ea499aaeaa815c46c5077b8a3f44613f908081f4433075acce71ed2add1c846da9338178ae46059cad13e93a34b3ac0fbb39984a30eff49deb0b65af8fc73afadfad5904a025a60f76a8625f87a154f4067ff82a27c92fc1e2a744de68ad6239781a6a76578186a050c715c1008a8cf7868356e29409d1e33ff7c78ffca7787b82aae06c75fa1819aa785069246593c013e7e6c72a7823fe75c4d4d8f6daf32d0f6d9b6cb4366530ac49f7436e0939a8e3f259a31d7ca7b13b938096803000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000047e1c745825a1f90284b36d1dce5b19a768cea8124c36d1b5818f1c5b627a96d4d88c60cac6fba4adf9120c2a2c2dda951ad9a49207ae856706ebd6d9d0c6643d2228964aeb466321d207bb78b6dde7aab10562b53c7ca73d7cd46d81309b481743141d16c2b949625a61110707cbf75446dfe4b52172b560cfee6fc4a683d49ce97599d01b474d50e1a887e8a718076560cf7329c3ea4c0bc68a6ed7834192e31956bc94ba55498a2879034ac1fe34b5d555c25df135eff73c1eb241f2f598948eeebe4b7ab09638a9b72e9aa7b130ca3b6f5483145ce181700f91c856c40b3d5ac43fd93e15cc09b7a4c04ed4a853842a8471ff88873abfbe29f8e61e29815afa3dd8eae3b1d3e5f6cfc55dc8f6d5e935ae1a736f936753a44ba8ca1d3731f885043410c7bef7a58a1669b80048694bae927eb279e567c3195856a7ec137952503c22ca5fc368ecce1482eaf68465120f68eb40a62db7abe0fb1ef7077792b88769ab113e9aeb4d88eb43815931cf8150bbbf9b4ea69dba5036a3d0b94a4c90ea54aa161d564120b3ac3ca1ffb26e377708afdcc12fb2defb1efdca70b23d81540e520945ff4459aa42e199e086ada08eadca7602cd7662ea3050497bd353b27bd1dc3027345934f2be545ba02ccc1aac42be08297065746c644e24f9a4cdbb1c9dbc14cfe808dc04b952ce18b31420d1559463bd01c0349465470e882a7b12dec7505cf6614f7ba41a2cd4845c664a71f67f0fa1885d6c40dcc0a6665df98c8037aad903bd70b5872d7f2c895968488a7eed632bbe96500ec38d3bf9873e03bcb06bab09d6f01f9bc2713b388a5fc74951950bb654f90385cf03eda708f21c0c8de0e53e541354ef0d1e4ccd74e61d786a8ce28d1629bb58560d2a951ce407943f88bb19d7bf6fd34a7d023b0837aebbffc359fcf0a858f21d6ec8460502f1c8209300929d867c3e70627b0910e60c79d2c1d4da2b036052954e68b1b9f230faa07e49bd180397bd4194bb61903a39a0b5e87b037a30ecbfb33ad1a164314610d31b36a2d5058270d39cbe068075e47cb79b5b98db1da82effd883e46d7e5bb684773171b7fe961adfd04da2566f1850facd460ed0c73cf86cecbdd608dab81c7badffc815800be56ff265263459595469044fdf13ef5c1305637f5fbcbc85a49a2b9614cb9674e772664479e32cceee6358bdae60c93c4dc7774995b52d31a0f0e9e20f09876090b1d8a5eef7751c4542f5196ae9d44d28b844026c3c63d1c909702826235ad1dc9a34db871a4cfeefc8b5d2c095dddba192b1b23f9064421614bca623e6b69cf97d64b22fa26f964df42cfe068dff283b42ea120869eb6d0641247c3f8d1fa5e36eb862b7c7c518d83a17a98f17e53c85301b5cc7fbc2c28f6bb9d1cdea2c34860aeadb2056b3e48d4c0935a296f9b33f8e58f1274e17f6311f2e38328c9cb5fb6b721f549d26f002c5584f5ce68502d100b4483bc9b0ad3d66fd4088f0e5ef206483593daef4207237a6e191a3bb509d0f79b50f03d369e4f2279813fac290e4bcb210f5531905c25d7c6c6641dabdefce6c15e7ef37b91db718b15608332892f0e0398f38d33342f9078065399d50301bb0069b354d51c82125a3e7f111819e3b6f6244016b86dbfd721d95158c2ccce8e6459501a44143b3a65bae7ac0c336c6c043a37b30cb15ec23f4d77e27b4dbf359c04385e5c5926b27e5a954210f2fdaedd615e470c7d43f22ee86d69fc7bacd3354fc18975cad4220c12dfaf5deb8365491374d76d5a2c9a278cb41d52b9972f9d95bac5337322bef6e084b5f34733ad4781c6eda7c71fe387ce70904b485bfd25d3921ab1106a943959331f3682afa40e4ba32c70a6fcc598a0f7dd1c3b86d6a8049425e70f42fa0c9a802187b0229d9064c9c8d6501131646a8c9d30307f9cfd611d5528fafaa08032ea45d271219a5b4fdf13caf82f22f5b8931e8e920a139beefc8f8d263336bf7fb0cd8521f1264221c5fa9e801a9ba923dbec7b7c32cf2208b5f1e3bb7837455392913752de659855cd4d3c5a8dce605a9fb914c272288f758a09136e1bc2f51b3d48203916aeee423917f528d187f49c8d55345dc4bf0bf18fae25b06ee2752421a9b3fe1fb97532779cff7d5a17a4581cdb1f635440d742dcd8124c3860e5d1a1b8b57a1460624537e8603188f71455bb13c89cac60f5140874d50fb5e81a825a8d876ad04c4c0dbf0f57e1d8e26b79d2f655f9d2e71c85c23c1886854afb352f6a2cd1bb01d0699165a0c3567161c3893e958c9f8f1a2d0b274ec533d076645c75b4cef1513b8f090a222d7a2b657a042ded647890249579e9e3283681e9dd0d2537396f0824ebc30145a5f9ce45a9f07e241729384865a4783533651df0ca5ccb40ac24c5b81b357cb9b36e88adbe119cf14f04b1a07b6016789727129ecf268e7ee5654d4c9a0b264d749db05bf39639fca4c8dd9d07e1e532a600ae4a336b2597584799e884f9e77d72a6932ae19df817624e31edcaaed1cc037402b53d31c630aea3f37e709674fca0f32b22485032a61060b50afa5a7662be1cfc4d9973164eb267c9959f4b534f1d35474d9685fdfc7a08fe3751bd7124197c74cd8fbd01fd824a774bba15cc10faff82fe6e05e21f6835d383290b4ecceef8b3821d882b5ecaf7f45554b3f8a29d2adfa3de8016e9b2773aefdc75e6e96f7712157bfb50f5cf2a4a8a94085e57b5cd2e7ac10bdc51eb4a7f9e50c3095981570c371be108111f6fd3b751076974bccfa93aef3c43f95a3db28f6c8777b917bf8d5663b97ea190494101a7f41fec493278a65c986715607bc4582c0fc69e2740724eb8bcf28cd122951918e1d5993cc2346cb6fb95f7ee22114e9959d1f370fbba0bf7967482396153a24ec9b149f080a04945d372184305595b21ac60a1dfb94b48a71afb7e819c48f33b243753bb299f9ddfecbb1970126d85924039bd23a8dd49ab050fe1a070026dce99eb3bb22a8065154172abd716bc473ef30da0ba56ec45f5af3048e0f08b00293f60bc23a3936ec6ffcb165cf297f5f78153f1b1287310b8cf4a4ae0bc1670272c358cd20d34efb3c88c241157aedb25deb9270066d79f7a8969efacb01d1bfd70442ef0186866e2e47ccd1db0bde6225cdf4150c67d6b5cc2336a16af9c9db7deb230a47327d09412d0fb8563bc35ce0e5a586e86c51b767bf43b0ccc089b9043db6fa2bde8565662b30bbca1d13377f8799fac58d4b126355a58343c85198272a26cbe0cb853725e887a47865e46c73b0cc32a420e5449b00fed7051f6b0551cbef1b77ef0c58cdd8905fd726869d8784780b12933f46e7fbebac61637848d600f8d07872fb500dc179cf25a3854bd211f6e5ee4bb5a58857aa35b99b1ded0ea6c83f9b747b46256349cb74fcdc67e5d8e1670262e0406bc345659d8ba9e3994f37d4950b84c1f3eb1ed71f1f6080c98e381caab2649559be6e91ea2486f2d94912615074d550c80c8f0c0ca0b16a54e684473573fb94365bbbfc88517e4d44bae82d1d766094ab5151b7f16ff7cb9661d858b06f08c8d37c124333a433af80f830f95371547be0a69383437cc7a56522f75b026dbb2adb75d824abf78ad626e44f05c0f1acc718fb922f7614e342f2287d7109d4415a2148f4b86b28cf747c34d5e0c3c956150a7ddb66c604f59e01886c29888fa4c3aa8e424d5203914ee5dc22c3eecaa259bd5d50de750f3611bfd79d82ff62305db8f29e2d2ead48a88dbb0b8bda1dfa18ef80dd664324beb99ba59c908830bc226ff781bccc71d82a8f607e7689da33e8c69f7b9be3fd9eca3f2804c2e80997d7a06537d77c6435598f564d1938f8553fce49bb2bf4f9f8b8efcac89cd84603fc284f3acfb6f46624fb3c49a9344169600fcf1ccdba1e78387cbf9344bafa03f085bf55a362cd576ec2633afe840805c463723cb6d77b81124d20202d156178d056097d6689b4f0c35769656a5605fb54445cb8d977ccab5dbb4c3ab3161c9358970a8a5a8ca40131b26c67c9c9f405438e173c8cfeda961260821ea175c0da821c84e16e4935a6959644875abf0953c1d38c7bca456e1d3edb38de0c3800175289f3fba185389c823c247c413e82baf6391eeb5e6b85fe693a54a52e8c40b3dd89a4b1558f0e3fe83d094ceafd95afc174e6c35c9c9b3874e761fd106f8adbee15f7fa38c0c1ff8e46624e35388f1ded853a53493ae9e3089ad5b2a431f351aec24cab86f904faed8db528017f9d336e3f29b475bc471035b772c88431024833bb7d44a9258d97935f0c9356b1d8ac1e939aab5bd5a727fa1cab7fcef10068d0f6ee08d654117f86478ab876ca14bc94813219a0dc0bd5941dcb7c1252cd1138930de53ed72bff0e1e229ca6951bb06f50a890c08cc5ba14a0efa9db9afdc57fc7c4617ac463d23ba9dad698ba37285a17b7a5c9cdc1e29cb5f77ae42bc11ca309919597019f0ae0942a0926b341e6677bf8cf7ccb6ce3650734e570a03a33c821165c0d5230d92780933268fb8d98fd8e2303fc0f7fb0349b6180aa73a30125d25812a7e7095253fae53039d65f936f6c1bb8ec2b136a5829ef1751c0b221338a350954262d24865fba2a57620fbfbc62ec29cbefaf83f9e5bf0b96bb2fa6ff0c08b9abc54a22e8358a8d90f64fd2d1fc18433eff149786cf69ad036fde1c3c4aba62b39fce9b12f9bae1542d534daf34b734c73efc857d5745662fc05badfd4af341115657968d9a4548dffe807a0ba34ab50a0c225033d9fc2e597a3288a88656de87f4da068914dfd87e046ce22d1a96e9a4407833f7f84299eaee5297e4a865c1071e4b95b698482d65b0a35b56942b7f33badbb1f927990bce67ae3ffbab8c1312efeb946722b4b64015e709410c91790d1ca6584d648a0f59f862706c7a66a75ab63bb1798d2bef1660dcad8bf12f4fc7179dc9ce72afbcd64b7d6a7bc2a11950f2838fececfc60809735413aeff1d7def762cf17deef3105e02c10fcc8a92cd045a531e0cf3165b44c8ce105e340f1d1545deb5560e1ff0f448872233f3e79f3b0ad06d8b5ebd29591cbdaf1ecd0955e6e37f5f35fdfcb112dbf9f68ddb86cd4f19370bb62d7c66d3daec4c08bff1b4b10972107a7bdddb96a4e124ba676f3c174ea60f33edfa88a31d590e6fed87403c73c8c9fb7902157edf4ae75c183bfeaf9cc4031ab905aa5e7971b5af4dc5632fdedf5c1955a3ae0871b6b32bc85a4131c3bbea7a61cb669e49e30514da2b5e63e7f82e29ff80b4526cbd621c827b849b1c2ff01fb67bf64afdab0bafe1642c4f015a7d97a3984af266814357d6ebe8cc023fd1128e420cc0369a8100300000000000000000000000064b8defd2145509168fb7ee718ccd5281b35b45b8f70985e68f57bb39c95e6d113448191a4870ad8be7feb1ea9835c7f17b8d31d643288c081c6b502290888ce06ee6ee2b0a82b0d582e297cdce5e66bd247267681fc73acb7c13edc47ef076700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000975e632df7b1ca379476d8c2ab7669fdf66ea887efb45dd27ae6274bdae5e1ac612357e1b89d0441065930aa7b7ef5916ad9e81f470f6b5415ddb38a273eb2bce225d8861a2817b7e7086dcc6ee6cd3b5c9f84288a9a20284dee1831b5d24c58f0912b08406fb164a10da5c269f4ab6a1a374dab5c77e567ad48f69a12b78d246eb4832a4acf30be29325a716ba4932010e9e0f2e3fe227109dbb3cbd960ad69a81dfddf57e9e36753a90bbd7a300604b50f06c7e12e5407356e51fc9323a2182224491aa1226e35f2de0498268f591338cfc005fec13c922a16919b28169c866c1fe42ce8e58dea1035cfaff33afa66575d41ae8d11bd16708bc3f847a8a85688e15815af2a475b874a39fca70aad48c91253589741fdb865b73f3a4fb566969eb0d4acdb3116bc498834e785945d4f3cd93fa5dc2941b6f61bcc93e4094c0270d02162a8a95d910948918ad80fd69f874e8023adb3971e5a2281d8b5822b4b7410f26530c2e512354d7bded1cf75db4e80ca6684df3a97e7181b535ecbd2e72859fa09c423200497d9cd2783bfc27ae714d2c4a66786122bc18cd167ca90bb480bea535906479583d7abd5cd827c5f2f956a91f76862407e49d7a4ad816a79d0a86b4e53764b6176f2893a176dab0a4f19645bd2792755efd0da3b6f0a6ef8c92c6b38944f02084dbbf1a7748e8b9913c679d6c67fc427202297a353f19e17b34687416c56b1d79876f35f8ccba1359bfad6afc3197ce1573aa30329caccb6204def9f203ea973617dc5575cf071374027936e5173085d86f144ab867d23fcedfbe11e7e87a1cd464dddeaa956edb605720f686895486f1a88a7d93229499521eb7178b4d584dd13eb6b885580ae94d47dc1e3d25f04c8508578fd6ccbb05890f4c6287ec2ff2e39e6ffedb33aad860240b114349dbcc22f967b2f3f2d98c0ecfab276f465abbbb10b8c869b575091ad4c8dd3f53ea59ce2883703e9e11c83d0fe17f1832e3dd411e54cf72ac43e42c50487e850737e00fdb15922a914f96e5e010327e215f34295786aa4496bb350f3789883afa7e8c9afdf5ca30b3edd02e6bfb3f5cf3682dff194794cd1401417d2343a939f1440072494c13bd71ff3a40863dc90b918e17b299d27c7d12c24ecac1aeb09c1a7b1613fe5b270845159819146d270be4e84caea47520671b3fe0536b248bb3e3c29c6af78460653408b7f857d93876646cf0ab964216d3f6a947253a38d6b4b44c1e0deb4498a056a5fdfb6b886499576cb41ccedcdfe3f352772e32c219dfa80e5bb52b448a3301b92664eb267b268995d56010bd5f0c46522ee92dc5661fca7136fefe3bb7a9f29965fa2ede2dfc425225d968dca403df9c82e6221a753b6a5ea0aa3f9b9b8a3854958d85aeca995fe8c6dbbd59f71c511942abde39bf431b06a5390c2fc338f3ad8a303b1efc21b558c5db66129076bec487aef18222924501988b7bf4a841b7e12ed162c1165f9c22ea282eceaec297bed4709a55101f4ee401bcb79cd94f87d394ebc2067ab9ffd7b24bd55818c7f51f8b7296d6987af006ba24111e8db1cfece0e867cf1e51970316f1d9dee832095b72cb38d9caa0dddbd98f5fc0267af6c4b35b0815950a617cd3a2fb9add117fe9821e880e4de7f92b2e37e77967015d97708ba17c32a31f6ae07494f2c8f5495431105a596cbef9c62695593d46e501735c986656bf4e0ed99a67334f886d41ebcfc09e1a28b4d2109fd8251267bd98e4ceff9295eb806fdd9d9b76eb5079fc4dee337cc3b0a93cb3382be35facef0060b17291c34cf76d21fe71d388131c9d3a2a3aec96e3ad2d2dad4fe22b2e15a9bda2d1279dd7088e1deb8ccfd64f75270b48cffa4954a70a01f40c5f2e9a875e4f5410245fc632e5e99040c127ad5c4c034dfbe8688dd0046e3131d08424feced55ac6a375d85eacf4c891720b1613065b7f20c1e3e9e6db9c70530461208caf191c02e9018cf25a50aeacd602c750860977778086ca4596c26532ad560da5eba251768bd49980e7df771a5ce1d347bc736c349abbb2933b04385f8eedd7fd8061dbbcbb76d2d8cdfaab67b1263885cbe18acfdbc1a59a3887b9762586970a5e186819e0f00630fdcfbdc731156d10b5bf974c30300000000000000002ee82d0400000000b9ba188479635d7d218c497b87113c6ad344d6ff1058a510a6f13d29df16a2e8e5c2f1f55a7f0d8782f0b5d82b1e0c103daefed1fdc01681f0266b0127da3da5beab255ea0b83a311e1c209c22ab3eed0e4d0e7785ef26956eb412ec847cfd730000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000061016a257d068747c533cb7d7617e3d7c747c245c472c549c28f5d93213e1f7f24f8108ecbc19adfd4694702255e2dbd9ecf98c856dfe91c34109d11edb24fc41b217857a8029e7dfeeef3f1ff1efb0afb6e6fdd419e99b733e8ea35d848491b8f4531713708ba6402bbef72107f558baf1ea215e44d8d97d9f4d946b37f3619c34a80d5a67c824a06b6a9c7958152c815e1697134ced6a9033b1ff44987bc11a2125bce349d137ed833805d2751032f5a91e8a9d3ba8a3c4f5fb8c972dbee5b102cd8cf693ae47ea29208448908dd390bbd9d0595491bbb153db7737e06cc5e558e2dfca66719359c804658788b32f1f908e74d3db15ca552bd49953f42748d2809b2dbe1116d124d26fe15832354bb859ddb7d7a191aaee66dffd021ae2f5235f8f2c2d38d7bc22316b857c09a55d7cd597752c10f1f214e9c0055ca863213cb1878fe8edfa073d826375d9971894fc5f9e1e9243f43a45bbd73f62a401802a9277451276c0276cb8241bdee34c8b051217f138eac3559fb7452b1d14e1ea405a0d92757eeb13bb833b8bdd17ad0206395e5c66b718f190563aa7be500e58ea0f734f761bebbe293986f5eea669b5f4b6cde83b9f34c40bfea38494233d605c8649e466b12608e806f75fbc181e1669fbb63a56783c303b4c7e44a9ae4e57f22c19504686daff3695448f3903c674aca33fe01d2c7daf6d75c99a2b75e928241a09d05d6f3421b565cb0723a1cfd849724ef38937890bba8ae427dcc4f9807e7af37e82f41c73fabc5cadb8fcbcafa355bf8a0895fe8023724e5bba5d1a661cba1dcbe9b6791c616577217fd1487b5c77a3b318aed5f38d905ca991f106a03b9ab465c1791dc13e0eeedd1d00b06c6e6b90f257e122e9b07c094410453f93b54134fc4456bccf6f354379cef1e75121d6e2d067da414359dc4c51aebd0dcee8f7f401375a4eaa6a282d6b21afa9a6c4093ecc668ddc8174356b47814e637142bbb696d3e3dfe08bd922a5b1353a674c39c8d4816d67042682acea1962c7a73cc5f94ee49503c24c59bf309f300d485c70399cb8ca9a9a6974f412fd009ff4e9b1e0dce378ee89e3a825486f66e1a103598329ba6cf5d785c615432f2550330041a191ff554a0de3e4792195dc91fe391450bad05fdffa73fedd6639146fca8f8b1250c247cfa38f46860120f2e37d06de3b5f5fa2695270a941677f298e6ea01bdd10f29eb393195cfbeea26391a152c3b2c24d9dcc02bde98d08c11fe61561e117ae129e9235a3934aa206b4f0a835ba91e81204564c2c9fea3b425d54a424919a9009b9c0910d6b6fac73f2ada35d60fceb524003eba547ea50a68dbcf24576034dd09821b3bd2c4614deff0453cc97487ecf6d73f99e9c775ab2fbaa68de5c7ee1cb177c499a9464e2491e0634854d4395007ea7e34c2fba9f525ecb351dbe4f1a6ced522f95f5ab4e2307e6ccf39d7d38346db6e5069c37c95fa08326c4d95a112c66b0626ac970aa9ddab0209047f121c94d161f6cff5633565a34f3d64b67502a5c4737977f011965a18be3f887dc9da65e65490ccf57d5a3c1ca9650e70bec211c55cf89ad438e2f49cb4b4083b1a8307bd89f9b22fd7f37fd90bddedd0dcd0562fff404fbdafb0a2460a2f7ac09bea1ad159776344b0cdf923b555ff0a1bd049daff51d83f8726a1fe8a9447bd86ecefbe99219cde9b78d6379bab4845ca5ba541a852aa09ecb81b0a7e04bf7a1987c7687c0f3ce56395ab0e04e1d726ea1c2d868668545f23911781f6e94895d029c947c0361b5e167265045b560650155e29516e962c159060aff997c5bcf17cb667719aad0efa942ddda94b98f9c0dbb6062643fa46dfa18949f10961c2bceb8c31b2e90954636e0f8755a73ab6824e637c92248d038124ea882b899b7c0452d2a69cc0036057f0dbfbd65643cd64995f5e0d0bcf2f1db365c49486f4151b2e32e5fd537e5e6d07d09c3ba5c2830fc39af1917a94e452fea535c680913973f5ef36f5f5723e0fdebe9c6f56d28fe21a4bf6645d2a13baf359549f6f936d77e0f06195e4b9519c2e2c8c3e265f1096b6d3c12011a604025a5e6d51573e7d23405b95c6351b9ccbdd0e8dde2152e9b490e39d0df10ba028c1a3f1a981da6a0ec2d4b3010000000000000000000000002cf54bcc6ac89ec2caa55f448b682c7b3b7e5985c6fca5e8aef1095bfff06983d006baafa6c30a8ce66c5b1e58ec508a398b1b34c792907d3f1b4eb3bbfca9b7043bb653cc96c20e4ea5fbd5c7c56309ac0eaea3c2f512ae2677ac3f6627ab0f000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000005ddfa3c590b38f5233083ae5877e88b798532c3c67c64e4855cd6d2aa5af433127416104486ca58d5f16e66ef4a20f1f63ff05cdff64f281a9585aa7a5eecfd1a4f815b9ba614a005f2c5541f4e6b7c7506a02c5518612fd561784d767051092519a9118abb787e22ffda3c6a2b6ba9fec584b7bcab4e6e1cd6156fd165face557f889d87d248206689adbd0c6dbc43f968936b481bd4543532c2ae8d5531c4d08d4a14a3306ab6e01e00c4b45371b0fa04a497e9b3e3e7a010e13b04e8fc30d0c4bfc16051ab0fe2c734078f274398cfed8a3be4e2991de9d06a493b8d8bd18b1b299995ab4ca491c4882eeee6d7854bcfa8af7c6b8c4e6b5ae4ae86a92f11ba8d485cb6f2625675f1d3edf77c2f51784075cb18c33c1f6c6125441e21aff959de232e1092200bd5ee7e692d1ce817598618cdee738177abb2184851b0ee0c9b81d8ab6044a089b6d61f22a5427ecf9568cc5ae88009c67353819ca914f638010c7b3164ce9c7079272bdf2f3eea32fd43c44e4eeedcbf3197f097f86de4427cdbcae6e7dcfe2eeef9bdd211c002113c4dced8a582cc50220e31d87c1a0a3ccb79258b3aece560e80a6f39423d3ce80975fcd6b01002af5e70b601314b7c669fd287ebe4cd628eb5276035db4ed2770e5b1e86a46bbe914f71aca7013c75478771958326d5deffc57e5042f6741f2877b023b8dc2ceff0b766aab8e0a717fa234575c15f785080a554906619ea294f1d325274d6cddf1b12ba8bcbf481bd277b47c2c199d596e17ce1f2f6c0195b6a3c5513905257c1a427b87f2382e21f801a893432aa9b7cd1368e1d7d0a9bcc723484cf93fd352ac3e4f50e9ce7084844d56f13f666abb24a86b58e71ce7b3e8b032b6816bea9ad74bda21c774da8113b21940dee4276079592306af1f389100dc8114c8299b1b11af8c6b8ceb765137892b91c5fc92649f7c89cef51a50b6fe672571fb5d8b22c20c37fca1f239279011b9542d734fa634206e5369738bc75286cbefee4e5b17814062b56fcbe4bf0fd5aeb9278e1d4dcac0c32c625ebb79b034e6948cb6df8da4b8d2ace97c94f024f17010e076db03bc4a82f2cd2d79f03650c04fdbd9c8d85b192faf60d4ab9e7934469e81110695c73751cb42e15a13974e3658b7fb5d22ac77c7f9020bcd1d71fa4448e05acafad8e748ddd45e517b942f675631b7050e2782da4d48f939658c25bc2c0cc2342d17960aa38ea419d99800fb4530c583012c5f53f4ef4b925d73419d93460c8d0fbb4f7d38b80de0866efd542d5fb6fa27fdc7db76159d0270afc087af8dd55e03d0d928e0d336449e8daaf01bab3a26086687ba2740ff48cb6a042fb2cf104bccafc310f39e442f69570b83049040872aab9352633fb395eb2661f6ec386382e49f6cca889b91af714c14848f01893f523bddbbb98ad5ede6dfcdcf1b1cbc6fb236a90abe229f8acc60dd1187b6fdf50bdf9732fae355b94383d5cbab80e8490c81cbaff8f170ac7024650724336712a85a6b81d3a6ef831cd2e53271a89767befe104d0d16ef8e575703d8833a8ac304ac1def104f9cde08e694ad3b3461afce5497e386ee68c5cc96f77e87b7db3b7417de4ed08182f82d58710febbb85027848c7289a44d7d6c7750c6ba5cbfe210cc1ec3498de0bc9e868d7f199bd3162717c61ac36e5e41ee372eb13a746137973a132e54e653d1b028164be421778fae067f96c94904a86c6001fe196ce981048c983ab1784d5816d914c4db07598d78af65e2fc1e1a6b9df6989926ac21ff5260a60b9468a8c854848af11267b405fb52489eb16f1f572e3188bba0e9a620b0826b66ed9fe5ee3ddaabd52033bafdcc3450aa8c9061622aaca555c100d7381cc7fc7035664a38f3e8fe9e9826e0794e3478a3299bed0b8ccfae75937a20c8718ad796532168a838ffcb7f473f8a883ae0c9033db6706367198d88e8edabe515f0d494e84d2814dad04d670f1f764dd6f244a61ef761397e0cdf5b1980d6d9982648b6f809fa6dfe423a30c1ab0b6091b208803d3bb9da8d6e2f45ee08fc14c93cce599ad37cf649e3b8f898e7684375da4ca5d9cae0ad9713359ce92267e9b6d7c7fafa326bd6a18098bd38a9e6684ee8647f1f219cb79152aa0ce4407da9d897d21a4803a8c7a63b9f1fb27005bcab91393a0c85481dad8b3c1e4b4152df1af3dd5594d764a9a261933f3683101d7e67a07556d3bc2a464dc9fbf5fec46174787223aa7417cf61d19bc46b26d4777bb480b87643649ad56a17f200100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "526551006aac63", 1, -1329777543, 4179206552, "ab17ad7414023a3f38b2f3b73711491a8cc81f3e813aa258fa619cc1f7742a83"],
+	["44a1e47e01cf739f9ef190e698689644d0f0e85a34638c64a3d6c8fbd38e58b889b3c2aa320000000000a9293a3f03cc2dfa000000000007ac525353515153a8a46e010000000008530053636300535123f8f6040000000000c1db36e800", "5252636351525152ac", 0, 1897704157, 3925833126, "2e48abf5592588582188308baa7cafdacf68cf3877025d3873e81fb93f9d99a4"],
+	["030000807082c40302413d57c678bc45b9a672aae27119e6304648fccbc478fa1ec706f27405e0126b0100000009656a53ac6a65ac6552ffffffffb4b97058faa5345736127614bd2c87bf451d6db8ea4770d48938e46a1b8fd6db0000000006510051525351ffffffff02513140030000000006630052656500cd907b0500000000025265000000000000000000", "6a00536a536553", 0, 2073189423, 1537743641, "ca04fdd26fe6eaee9407cc41fb4c3634b34e8fb39f52bae02482ba02da9b0561"],
+	["1a2c472d01113415f907ec5eb768d2db4c4ddb9be7e846941c151b2c769702704161aef3d60000000001006b293ec601737efb0200000000076a6a526a6a5363d841531d00", "65ac", 0, 1383149317, 1953719636, "8dc3bb40ba396a36a24161d24e9e27c2cc7676d58cab54b11d63c50e32ef6710"],
+	["030000807082c40302ed2d70660af61c99ef1bca0df4062803c69ee05aa3a0ec1ae7375cdd169af11f00000000075251ac006a6a6ad7667e6950883b9b0967b9e4692c73b3b8db871a905b5680b8ebed2d7182d6afce6d8a470200000004006a65acffffffff047d927300000000000252658cb3580000000000026351dcd9a3050000000003acac522c8b5e050000000000863db180dd56420a00", "51", 1, 394209512, 1537743641, "ad7ac5cfbf1022e78f0721a59831d7a5bcbc42d19f0963ce0698fa53b3892c4f"],
+	["030000807082c40304b23197851a64b67e2358e3bb000a537b4a721d58017c701f90ec09e9c09f735102000000026a52ffffffffb3f368a63ff1f5e93576a5b25852e6465ec58bb40bfa0e99204e813544b4d43f0300000009ac5153655200656351b739121120488057068e474ec518e1823e04d35c1ed1d487673f176b0d824f9a67398c440300000008630051ac63ac6a5195413a34b128c9090824bb42f7531ad44dad7ba4233126149561426dc3f60ce0c41adc0500000000086a53630051656551ffffffff04f3d54e02000000000953536a5100ac526363bf208e0200000000086aac636a5265526ae16f920100000000020000ec125f050000000000000000000000000000", "6a655100", 3, 1308865135, 3925833126, "4fbff437c00c728ba15d3a8e1c3408363e57626905e8360452fdba0cc85d52fd"],
+	["ba616279022c751659fb9e7bdb54d17fea1121f87a79b57e67f619e24001e2879d27c0203e010000000800516a0065ac5351ffffffff1d388c8b227fa4813c1958efd40fa1a743eea57dca2c2b8cf3e7a3f7e7311cdf01000000026500ffffffff01d86cc90000000000016a3a3b839c00", "ac5252", 0, 412428732, 4179206552, "def01c0bbb464be0b2ac521a0dab68138f43be74b4c0051d61db655e203aa823"],
+	["0400008085202f89039cdf932e1388f1342dcfbbc6cde2c09fdaef89a98985cc041153b5c8e7cdc33c000000000800006300ac6a5151ffffffffab7c5cf9d9ca28c6e2741e0b03e543839a6f8a76489a7c76a67e6f6fb615c0490000000009005263acac6a6a6353edd07dde34a28150430c21c6af996e0f5a743acb928eed9f4c0883406d2f03d9716a69f20300000006516a636a6a6379f1132d01fce20404000000000463ac6a52000000002c0777056100e00500000000033aef6d98596f1d4856aea1cc3f5bb57d2d5a03fe125edeb5c02084ed727dd7010264887325f3389864f9dde6982a1c2379df38f1fa112dd756c1bb62162b6d590591bae078ac8bbfe5b7f256f581dab32dec3b9b826c9f170863b583b1f7286a6980063594a5b71f483af919298fe67f802d4001d62ffd03d9a76046cd23e89519c8c3f7b614952caf4c25a0819a423704b894bcf39db48f632dc53d84462644590db6b24858cbabb67cb238b19f63825ea7ff8543f07d4a12d58e9f208d3f885fd35698b4886505137b6e25ab4002827afeac15a4ed456103bbf0b0859f84fc9e24c97df6d69fd220ff5985eaa351476eb678fc63b22b7c207e7a1be4cb3341c408331ad09e529f5b4f857e6815ac8450d10046250b811d95ed3251767c1f8e947c769156964a29d94749ef7f50665dc9248d1d20f2ef317557c20c3bc54e966d4777bb480b87643649ad56a17f20010000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001aa814acf59f8a0e2ee83c51e833856305e030fc2e72cff9518c6be7fbbfe940b16cc742fdc6ffaeedbbe6631ad673417ed56be1962ba29b92d050724c8a3b6b780978a742160eed59a597535b0d39acc0ede986dbb376aa22b6e11ae037e74dd3f7f55c7b984cc043cb098cfe730c6037bdc578e435b13d935c60bd109012a5a373c4d746c27b6e448bab81d1c3582e9bcc852b8c42efb98718ecca1975b1a180d90eebc0083d713101b3eb513d53c90da14273c1c5690e985c3d08ac1b7954e3fb187f94205b34564f850d3d38c70be859e282afdd4d52ab5568668db57dfaa3c620d510a8c1c743179caebb138a9b828c471967896f71ace9837f14f03b89475be76a8ee5e3df29ae67e8bbe35677a50260c35192e146883d93a60debe297f6b7f6dc52739239c852cdd83d2c70762786678c9b8d0491cdb71709a8056f396d4777bb480b87643649ad56a17f20010000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001f9b48b306c98aa39b42ebb91a508f0585adccb0f0d87f8956c409cdfa7d5aef0d54d3e95915462f36ee9b419cf35042db0c4cf5924e3ebd1a3aa05804e1c73f5cdcb71e1738f22e928af7a328948f20c4bf6d28abc9a8905cd0d93696dc153793bd209412d494973528eb815f8a4da66a0aa8fa71bd7df1c65919f04e381b1038eb13f121287505729ff1c501389fd4ec6a6304c6afdef2c1b0f1a0fdcb5ab2df33f5090d401af9445e53a528daafb8acf2b3a15e182c1c2288865be920360fd8b16a80193962a0bd847d110a708012c4c93112c82ddc609236d0cdb7a66d359f093f39e1aea56093d96a12f1807039b7fc6d009f923d3d8c415c5fc653348071a5c23b8266b54981480bb7981da5694d530532c00b14c086ddb1e6fb978b6e6ed96b8a12466e27db87e67fefe39ea5663283c56e01d4ffe6a3de8b43a13a3a6d4777bb480b87643649ad56a17f200100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001695c926c15ae65efcf73a1ce2c410f591003d7d700d12749ff28200562284a6c67974ecb1260e0a273356dbef411ae638429688271997ee06da88bd0f88f76063c5181c54b4441dc094172ab4901ef34ab97619063823c6f89073beb308f024ee4f50210d4841f1712cf198a7136cbf456315202f8e644e21d478f81849f5f22e5c557964fe4748e41ac614fbbab3847de59bf7f459af3e422ce99b6e5967b1561555743ab4eaf6c164b129dbf53ba8520d790d60cf0aae819cedf3a1e7a24ab862c4634ef8cc4a55456151086cdd61cbce1fcd36efe7cbcc407b5d84861f55e1d207f2c91c678f26a981de892f9e849aca8724fe69b4423385bfa89765fec12c432768dd74d9cb95dcc6563b49899aac59c7b1c47b4daf219f252ce0fba119f5e71385f13552c3eb205f45d6efaebb43247d54e7d534026ede61d06ac3a799219d7601470942694472c4f2b89ceea5d5737d9e64b06080f7ff41fb3e478d81b63a58a2ce8d8dea32e56401a9614579163c264f4f4568c045694efc9f0f02680a4bbdd8ccba51bbe47667c6c93d5d5a14fe40de11e2c239c1183badc6629d349702aece9e550cb91973615adb913ce0ec2174ebea288aeff8434f9e19cc8d2cb6599d56210c88974ef9c0a6d0cee7a5a5393027bd275eb5688834e8ce6a388e79e7ff23c1e20f787adb5047e3ca34a2fb7fe00bfe308175eb32316d0c0b75de6bc2688169b5d14958e0b71fb0ac2d6cf0de4b198d68cb0529cd757a363bf7f361a8a9fb1fbf423b43ea3f7c59182e172aa3cef7e52b587e28cdc402ded95115688104cb7db27bc53a9b6ac6bfb8332162e39b173b0a7075946b1d0150b0b22afc8dfb6e28c9920f1885e1aa83a98f81f74462986d0ea7f24d4feed651a0eb95cae1dbcd93a28ddd1745526ca5d41173f8efe7674de17310553e250dc80412f8427b3edd258486b84600a9690b95df6a1d9252ffab46a33e23c386aa326fdf33de1fcfb3963ea8de75dea6dc0e1ef67d745a86bd2408b815839a238ec965146b7b726decccab0d4b9ed7745e4dd3eb46c1e972566cb0c5cc174aa5a1e7790a7fd3d7656c65071f9aa2e89b8fa46e8cffe8917fa5b71f380331be22efb795cd3054588bee6152526b11b5c93994fe50b1e425270468af01ab1d8e4a3f5e8a9c534b547a674f54381d5c56eaeb869512d277b36c467e22bf0283838c1e496058594eb5cb051664eb517b5342187f280ba4d9d9940056c2214afaf86a40477a0d3de4a7863cfffcb92788399160df006e73d7ff9268d2d239313d539a9dae534e9afebce06ef9be455235331c1be969619af800e2d050000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "6a52acac656a6a52", 0, -495539591, 733220448, "f8526816a2d296285040a42569ddd8f7eb2e39bbed085eff94d25dda1ec7f108"],
+	["030000807082c40302cf89a1ce27d277ca79ff3bf66b402fef26c1cefa9381b872852530073351692f010000000953530052535365acacffffffffeba3218eef229fadf5bf1198fa37c0e28409047e1e335b0f536ddb8116cfed76030000000152ffffffff01e994fd020000000005acac00ac530e51c6d712eb191000", "635252", 1, -1751495181, 733220448, "eb19037ac125873aa4cda6b9c9bff99956c5c7d56522c3bb65e0ca6d52d84e4c"],
+	["030000807082c4030430a76ef359680e27f2d75e4d1f0e3e47710202b74efa4c97935ccfc38fc0e58802000000076a635265ac65534ff0d46791983e2fa297bf04be9263f3c5587b1669675f9ade48e7ea20910bb95272d94a01000000096363006352006551518a8a6a782de4045462fe24a5c6d2221a2a3a5fe7217602bf4c20d24405f93656b051299d02000000096a63536363535300520445fbe30e3bd49f87ad0a47647dc7e1f70c3cd9c29e2a03f2df1001b978367f37f7e8e402000000025363a705241204e0ef56040000000009ac656a53006a6a52007ef3bc01000000000853ac63ac6a63536338b3280300000000096352636a53536553acdb91610100000000016a00000000936e6c1400", "65536a", 0, -174711270, 3925833126, "7512ae8ec43c84f5cd73fd4f1c5bfba044de77f44818a4208ebd258ee4bc8354"],
+	["27d8f97304c06f1b82b8c285a2202047386b68dad107412d5d7930d6e39d4c5141176bd8450100000006525300acac639591311ed296b3eecaa635f8171a549d44f1afc6c171d23daa675c678b6fd675ee6afbb903000000045351006affffffff00cc8f29d7ad1f9160af03a27f200d93725f984fa85e2ca509a7eec4273fb42800000000016524424e5a163b3bcb51395f46702e913eda43db04148605fef1ba0f4986734e9c81ecf0d6010000000751ac6a00ac656387c98287040113730500000000096351acac520052ac533d9ade0300000000030000636d9f3d0000000000025351ad01cc000000000004656553650c766fb000", "", 3, -893359516, 1537743641, "f479844a4883d5b3e1ef404d8a7643eeef258b675e8deb549f356a8157e874a8"],
+	["7250144c01a71fda18522c0025a29a4fa0deb730beafc37061b275ea1f7c787b1e7c8261870300000009ac51acac6a655165acffffffff031f7abb0000000000030051000dbcfe02000000000252516c60ff000000000005635152636a0000000000", "52acac6300536552", 0, -1793992803, 4179206552, "337c82b5aa24ce165ea36ddcd166fc8d94e6ac770cc5365096c0e6f558962196"],
+	["030000807082c403040bf552f5a4c88617efb5cce3a30f40e289ef61f72a415cd6be528f02229af8500200000006536a52ac65659bfaca51aa2358bd375cd6af429bdc9f09fc6adf93b553a3c77e5f04587037661194860003000000046a6a6a532a5a7a6678eeda01495c9c9b09c7648bbc5fc1b2bf5606e1cd1ed299fc61585099de9f32020000000400635165a24c6ae23e1cb50e0c91685bc19cbf7e20b489eb3917b9ad2941ba43df707c6a855e679b00000000026300dd5ef50f02e8a86900000000000068c010010000000008006552ac630000ac0d06191f0000000000", "5163", 3, 1788939760, 1537743641, "c17654b088e0ae0f32a60f58157a026dd85774174be434bc347df3ec570d86a3"],
+	["3757076c0319131d85cdc5cb07d740d173c0a675bb23c5278cf373373ebac3a61952b14b6f02000000085365636565656552ffffffffdf6d77cded6fba1c121c6db5734a03599f5b2f0c6947dc5694ad46108fcc7952010000000851006a6a65ac6552ffffffff36316dd4e5fd4de6e2f9b31098a2632d71c5a8f6e2db34e6b4050bae039f190400000000066553acac65531ec1990a0227e0cd05000000000953006a00516551ac513ea5770200000000025365e638235a00", "52526a6a", 1, 1552490335, 733220448, "7723a0c2ddf9ccbaf1a2174e99b91d1e696721d081da2217557b8b9043fb2885"],
+	["cf518260027eb741c90247a97088bc8ced8bf2959c548e1db2b75f9051ca4c2fbf9b4b50a500000000004736423a3aaad1bd5e01f21cde6a647955340b90c02365e202c46612ba139364ac508c8802000000026352ffffffff02cb865c000000000005515200655395f3db02000000000952006a6a6563535351dd45a6b800", "53526352", 0, 368781436, 4179206552, "87be6103108a57a41ea095ce72241f0062fd959bb7dff9c51bde9fef8f0bdd8d"],
+	["d7dd050c034d4879061f196395901b6de16f18e4899841764288f16efb4fa680618206d8ec0200000009ac6551ac005352ac65ffffffffdbf0a9be46c366a2afb1637ff01ca23e7d2bf52eadf6f2e8216da50607f2b16c01000000050065510052ffffffff069e43dc4770b9c495df7ecb2288ea2f7773f3d71336bb89cb17538070ed735c00000000026353ffffffff012a4acf05000000000952006aac6aac5200520000000000", "63", 2, 964643083, 1537743641, "3349f36085180c0066918e821f7d186cf1905f408c93fc03640e97eae97e26ac"],
+	["823076350105289e536a364f13a4834859848cd9634dba8140440155db31a3b1af4ff99ece0100000007005152526aac63ffffffff015f1a1e00000000000551636563530000000000", "52006363006565", 0, -1477912765, 1991772603, "012e916796b1325ccb7acc3f917d5389eea1998e4855b3e2c76c9734ebdd25a9"],
+	["030000807082c40302ee5e9cb39e6d8b373caf35c91687ad8e71451bbb7f105bc980d54cbf8440fd760200000004636a6363a6895e135f42b445e619edce0bf67d9a2e89b3a94ad8c53c24b64906ba2c4ab8976d5fd000000000055263655365ffffffff018cc5eb01000000000800ac516a00006a00000000000000000000", "6552525252", 1, -1124826919, 1991772603, "893ecfb1594bea5c389565d6c8cdff645661c43980d5d1513483361f9c73fb50"],
+	["030000807082c403034c3f16862364248fbfe8bdbc90be8b08197eef6622788206f2fb58d4b57fb9e8010000000665006353ac65ffffffff6b89b1b47d6fa696cdc80dfd45ea60f3ccc0ede824aee3d2a78ac430f866787300000000096a6351ac6a52ac51acffffffff92c9d31b779c0a4c3ac653d615097cf83ec5c37053fdd435981892d96661a5100000000000ffffffff025f91ce020000000006525351656a63174b430000000000076553ac51526352c4fd247fc0afb00600", "53000052", 1, 289969865, 4179206552, "b076c3480b1552e4fa1146c8b266a66f212f096b1140ad7cc2f3a6911346d6d5"],
+	["46f6810b03deb70b57625b567c0ab448b2aa5e9d7ef402e852f38a5dd922b7d5f2a34b20bc020000000151ffffffff45635627285967f830279cfc92eda02bf533d0c169e1e3a2725b22906839d28a020000000663ac53656553ffffffff6dbb37f30f91d27a47cd33c4e5a5450f12448c55e59ff2da9a7cfd9b33b99d9101000000046351635119feb24101571a10000000000000a977a0c500", "5300510000", 2, 2137812300, 0, "e88785b7d483036ccd5a8639bfb51966f3b6f466b8443d75cee9f03c5380474d"],
+	["030000807082c4030168d19f7a91d5b1f5144401b4a77b3e0352f96ecd8cb013e4fb1d77ea964101410200000006006a5353656affffffff040803e3050000000002636a26b1c0030000000005526a536565636dcc0000000000076365636aac5163b488680100000000056a51006552000000001de1740100", "63520051", 0, 5841324, 1537743641, "ff25c815ca008d4e1f2afe456a9db020600bcb40b4d2424ff2d70743498338bf"],
+	["82d3584f045a04100f40239796768e070e3c0e86d435219b717e1ef6c6781f1aef895074f60200000002536a1f41c4bce3e2d5b039b8fce2afec16f7b08659e08fe8ab499e77037c12a539d37a5e1f0d02000000026a00ffffffff3de2922b6900a62627fce50b4e37dd47bb8f4816a4fd56fb1f577402a6136bba0300000009ac6353000065525300ffffffff0776dffd3ea6752954c474b69d72d8d4203875aa0a62422ffe2ca65607ec8cb3020000000100ff89a5b103f5d41904000000000057fdd60000000000016530050501000000000753526a5163ac534ff8e92200", "", 0, 82494689, 1991772603, "38de132e658674c4424e3bddb6834de340192cca4bcf86a6901d231f9077804c"],
+	["f98ae10c04218c58909d6232c7971f996c51ca86e3137f338b6574beb3a0d6c5cfc5d97db7020000000763005263ac6a6a29540f9211a13be80aff842f56aeb7a75f762ac28c8e15c15d9ad5b887b60bc1d78a25f4020000000151578f6c226ca2dc81d0ed3694cc4af08f1ed8efbce7bee5c68af930db1a5134942d2dee22020000000163ffffffffec2503187c9dae61ed7d65020ec03d77ef466cf4a9f0ca7f2c9e32899f78ec2b00000000096a6a536a5200656353ffffffff02fe94e503000000000463ac00657ba06201000000000553005363635242a88c00", "00ac52", 1, 482774984, 1953719636, "e9266722b3b4e052af1d56374e64bc878aa40df697d8774b0a9efde653407ef3"],
+	["a17c541604514c5abca09543e057a949ea013bcf7ee0fc3498bebdc68d2eb61e955a8c7d3901000000036a6a63ffffffff9f4ffea1c753baa6975278a6ae63dbfd66c222d05bcb069c72a523f9cd6b60e3000000000463ac6a51058c30b6a1a2964506e21e2e471dd167410d82c17b2979949ad2aeee19a3fcf40ef86d1f0300000007515365535352acffffffff89dfa9472f3ff413764b39fb14d58291acd0697403abead22247aed70e0a2020030000000252acffffffff0463a7e505000000000700656300535252f37d56020000000000d41fbe040000000009acac526a536351526a87a9e30200000000056352516352e8d9388700", "52635365656a6a51", 2, -491110692, 0, "0ab6b2009e4b3225059befa3fecd9a8260471bb2b7e3d4779a7107ea9abf9c24"],
+	["f87d9c0f04c49f87835071fbaf0e79262cc39c80185c8570e5934418ac1de7f2f7a548d2bc0000000001ac1ab1e2d25b4407c6f4de0275689fb93276046ea08b004b57a719583427b1553723354e4300000000095251536aac526aacacffffffff39708679a4af11becb0417313e22b2e68f4d02d4f660fbeb3bef38fbadfb41470000000003530052fffffffff2c00d32facf4d63e5510687129d3d5daa779b56c93b8fff9bdb27f9b681802c0000000000ffffffff049f0d32000000000006acac635352651175d405000000000465656300e37896050000000002516a32bb9c0100000000095365655200ac52516a0000000000", "516a52", 3, -86308894, 3925833126, "29f8fda549e03e784c0bb845f55af275b80a12cad725439965bfb5f7be959ebc"],
+	["1c344e04045c17cf137215583ded6525cc20fd9ba35fc74e7103691dc1d3a48b6e911c480c0200000005ac6a006365ffffffffb4bec56244696e93dc874e6dbe9f51dba79fc9adb6b18e77a47931b65fdf62c7000000000500536a51637d344ec0bda8c11968940d183f757290aaede4acbb4299507fee759a9e7f688c6a45fca90100000003525253ffffffff2942eb9a855cb49778e7d6ee1042f5e6035667cd5702d8e2df91991bc4ab67fc0300000002ac53aa34d2b602e79c750500000000046a53ac518b0a96050000000004ac5263ac0000000000", "ac52ac", 1, 152560412, 1537743641, "be43f24d5398c440315a52cdb838db2be2a63b65c4c0ca2e416adccb6e66f97c"],
+	["21dbb50701d3a8477e6ad80e2660f2cf1c6636b878ff744ae1f6bfa03f72d37e0d7241f124020000000163ffffffff028675ee0400000000066551655351513c09f1000000000002530053a5515100", "63", 0, -1398630854, 4122551051, "88703afd3c635d909b0728403df482157781ea42f46152949b249f3aca21d429"],
+	["0400008085202f890407f9063d8e864c3a8da0c618f2e90a4dea8e6b9b974aa590c7ef8256c5f3b10801000000075251ac53006a6a8a6642ef82b607409ae1b64981343d91c8ed819aedaafca3dd92806b44b61b6a5f7121440200000000ffffffff52ed94bcb9421cfdf10b31a675b9d6c22a088c6f6c8e723fab9bbb90c36dce730200000006526aacac6a53ffffffff4688e93d467fc777eb0ac4e143b7498ec77273e95df2dae08afb991782e8c13b02000000036a656affffffff046647450200000000096aac51ac53526a526a7704a10400000000050052acac00ec4a5d05000000000652650000ac53e3c5870100000000010000000000f9fe12131da6cd05000000000494fdb1e0d4672ba6752d4d81b080cc81345aff37ebbc9addfdc982ca932ba5649e075c54e07051a5f5d4ea5c073904431ba00801c20bb4c3773c880c3911b964da43c28670f7b0e0aaa546dec0817d6783048b1bbf3aa00f1b05210d8ec91168b5b549b078e1b775dba13fa302c347577a34cac4399094b5f53163cca74852b787ed1e55d3e11b2803cf78e649df440fc77cc1b0599dc906fd9e9a4c25eeb6a96679606427c5ae8dd8a670471bebdffc85390098690e334497a6ce1e5329e37c71bd278902fc326e70ac5025695795774c6b783453d71cd73adc19e7abbd0b69afb1579ca4bf7871077a3c7d402c0411157b09c0a99326f0ba0d99ab71ae7a3c3b93e21ff9f82c7da400f8859eac76ff9e8dab42d2c8f680e9eefe5b3c20b54983056a72feeadb99495787cc92390bc836f46d89df38b8ab7558a037c9ff0235a4ab0210143ac01907e1156fc95a01000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004a2387e52f4086deb4217b8d10f4419c758321e9ff3d7d7c22acd105b57e248e5ed29b6d85621c338fb5c751b10deb2573fd4b35faadf7edb8db5bc124b75724d192483bf148db57b18d4235b8cd66385adb020f30809b2e94bb1f44768d3dd91180ef1ff3f571eff3f886559927fdf8c9e7459eb3839655f6bd96a914249f6acbf477f0401e953f5bf331cd918826461f6774484127ac74d6d906483c4f5ab93dcb77995180e23ddf99145ad74f61d1a58460d6406fa9a7b70968b6c9ebd20981fdbb8db99ee49a9a716f8ac98f8de25a30d002f87486c47a3259635a62d41363ba4aefa707b7390401dbb4ecc2cc7aeb1398e7c2170584b64bb180b8906f3fa1483a847223cba87f8102c89b0e52837783edb818e46cf89ae44ea8f82942b93e90a3c1034c62047da60dc19486b08a363d8406f967b93a47f52de4b25b70f3a4ab0210143ac01907e1156fc95a010000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000017b96b77030660aceaaab4e1b61181e5213936e92533d7028931591fdc5be3bb8265bfd68599e3bca6099c32b598a8e45fc419a844852bf2f8bf9695b988065a2dc8fddd44330de40ae2b401bf75ee75353b5b16d3b8c6e62bc243ec6d4e59f09b2bfecb48b0a31d9250f5fdab745feb1f015c91fa2bef621ff5ec499ffd3d19288667400f9fd6c05b3ed7bd633b7b1906ef6edd68555ac5c462ca354bbf5ebd46ec18836e1fae785be809af6a2c1e787bc77ec0afa95b737b9e15400fb716f08b9e66276cbe72ab6ac28dd8be9d64afc6809c02d1f5487407289d477a6d0f81f176d188fe1518f51f190788ad59bf0522a5e30d30d57c2ce91d171d0f2addd6b5165696026f14a8bfd29da8d2c54043fbaf2d7c6f572526eb0d90a8b9c9571a90ebc9c8fb8a31f882bf43a9f371d883ef672c366ab53054f487ed0ff4cdfb1da4ab0210143ac01907e1156fc95a0100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ddaf2ff348148da845f4713d2753bb716fc9bf66fc9f3ba532eb39d20ca0740fb531f1cbc46715bda558e76754519fa1a483099e56ea6ad0e7bfe8b83e44f942c9413c499d3124c92a528e1657accca8746c11b5e4920310546a9ed4fd18ef52ab8090a22e10edf5fa88c73b52a88174f7a13b1302c6ae964024186feda483b11e5b4d8a8c231523889d0fb80923cbd1609f0892b7d2c1ef168c35c674fcad25d1e8065f2aa54d66e24c3b781e018a8cbc37bc97a468939d92df2b33d65a87560d02b23133d77461944e19ddab48c91829e5f4c8a1a01ca4c15ee5b7b012e15e8b2e6e8871fb21a9073440bd95b871fc3579e6189d70aeef4e4961380a23d1d95dd4011d009b12c3f66a0f017e23a2ec596cc8cdd3354903d44998b9ec441aaad72062ccc2bc2091a0ef81c4df155c5d7f33f4accf8d8806ab5faf61e9a75d55a4ab0210143ac01907e1156fc95a01000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000445c441dff831080cda4bab4446838d51a0b97c0a235f5ad4357b8b42ffbe256b0156b5fe169cfa13f97b35d6c803b9ea622943d27dbfbffee3ea1482b9c17d1ccc2fecfb0e597c6316d5bf933feb549c2d2b241b15c3b94fe8b3fbc091c754e6b75c80f4a295959fcf601ea5b4cdbfc29501e65c262400292851b78e3505cedad16289831bbb0ecab885af6455dbc20e3edd0dbe1d1b9f15382d4b42d8d4740d8e7ff1689e535957e1c934c55a7de0ab3701d746df00870902ef76d89d3f3f4ab688762a07a6be4e2dd7325326b3b06a9f86ecae16c4998f49e9465e15f09bbdd62b3ea75b418fd509eb12160980e65d59d91ae8ed9e74b673ec0fe0b33dea96813c674871866772359e51fe65e68456d30ec2fadfe672bb26e2d3ddf1cc4e61879d9c260701c6eebb53e2b00321bb0957b128561b418bbd53eba828329f57b949771a5912bb088ffc73d93e08a7a0f6827053fa08d36168ba78e7cfe1327e1c8ce04466d80d175db6b5a59045cd99edebc2cbca933112b2a0a4431530523ce8c37141a70edd37ad2eb6c2680d2a8ffdd0b6dc4c36e9b6cc68a2126d6aa3f1f41327c110b7338f11f3a7d718312f85c759f9ea35849cdf22342eb97791220f1f975f26d344996e3e86e735f2ac403c63c56d4df96da90abe4d7c28d8f924b3d85f2d2d0d152cb5ed133ba77c565daa97aab997c15203e2cec10d8270d480e4fae2e7a43ddd82d9da424a50377582083e54d0e953e3cd572902244cfc1a607ec5039a734d6376ce21f890a74fd52ef2e67ca7868380fd7038483b62bcac17574630a930fdcbf218bb89e74985f7ae04b64f98d5613ad7767e9a07164681791f21f2d0cdd60de69f6e73c091f26b0cb4bc3d2836c5fb1ea1eabf6f301d102c497cff8e2353b803dd2b829957abbe34563ce191130d244e727c3568871b9f7a8fec75d1107e0e805861c3c6a396d065e3ad991c6185d2d74a60b09d1d6e70e08d28fd2f72d5b5dda0064aea40e3e79495cae9386328a051cafd4136ea74e498d9e6e533dffbb92d1067f1deae8f55a43b7b30a37bd291f359de79adebe8163a70f36d34090d547b3fc7eb5c72713410746c347e246d364d9de65c13849b91ea32af2e4f677cf648da4cc5eea2f747d78d56baac1c25c19352e0492d6c1c561a91a6642f0b19d4e21f13bf95d64794a22616a0b76ae1cb012c0cbcfd3426e53f1ef1a999a918acfaa32ab1e1226e17858d1fe57c1fc9101c45862b203669034a1633917e8885c15c3bec920eac70fdbfd5bc4d449bc86e15f6d0f288fd77b2d92ff15b766a604c4b3063c686da65401e59a2c95b50a101b134feeeeb4c4d4d3cd3b989cab7da2534d91ce7b233414fc67048dc27a129c3080f9b4a1a7e7d8056d79cd4a039a491f3a1906bd637f2c41876d3f852c435359473b3729e56ce9b485cb380cc079f06fb682eba274d981b05986e768f813f8861db3539c23f5a996fa5213cd230162d2ca67564b8e23d1ffb6685ecaf128c15bc7ced3cf430ed86358e8da31aca53633cb70e73a311910620ca79583adb419d63721e777c48f7b6b1fea9a682bf79d49e8596a7a1aa9d902f6f1f75590dc45d11dab5169f18fb355bedf5560d4efa6ac4854a7deaca62a4644e19098fe972c136a8bef27b824dc28d0184a5b6b15bd1369617e219f879e136d24e91cc7ba891ad066e091970c7ac1387e0687ed86d628ab033c6063fb10f33c7250e71f0ecc245e8a491636aa0180e7fda198ca131dc17682564b75fcb497a79a8834015b6e3400ac1ee9b7d7f46216bc250f032b7aac7372941ea895285646af38ab3bbb95716ddb6f7304e2f6ef07fba8de0bf827d6e6224921d7b0696a2b3139b50a45b180690303e827e7e189476f8a0c8e7ac0d6445572dacdffbd72a51880b7b761af919c9fa4ddaf5e6ff0cd37175f1f7a1865512d9c45087b64ab7c4aaa67a481de9f94488ee79fc022b5282904b0cfea6b29b98ad80ae9688c386e0ac7c39a538d91f5e42fdc4c92eed724e158947f217195f1c1ab0dd75447c2d9ea179105870f959a6d66bf505923d2336b5a580ad176d404945e6f7b5be97d9a1e571aab91858289a14a18f55e13cc33292cbae1b3c3447c2c26eaad25dfe98cde5f0ce32e99786574df1422840c3cc437a0229730f397cbd6b6aee7c3ad8cf0bcda975efadb559417c432afe83a805055a107a99ea77f9f20c16286c73c8be6d6582f99e7c7d82447631a514d71f6f03271f2dfddf8f286509300ebc6865ff1c0f227afed169a4f4ef32124e5372c8176fbb93b9a07436aad55fd0881775e1394400af863f21ca591bc6b011af8465a9e7651bd07ca8b2506baa626498a6758113f7c0012aac9ebf64d6bc6d12946e9f675c72e44998af1483a8ea12ed54ea069b3b38aeb0c91a0862f5190e4ce19b3c76fd4e4dd60847995976d53858c1a3c5d13cf8efdfdbe0ffd44ff122be38dbb11ecc2105e9ae31f06383474f95018f6d0f491196c664214c38163416e15663470c03daa5cb0c6e4e27f67668caadfdfca8874e250650e69d6b5ab06374ca1ea4431c536f22b45e9b9c180d69a9ce552517a33e0498bfe02eb67429d88020d1ff9d6c26582cd1cf7e2da8672fd62bbac506a46b8fb51d232bdd7d40c1c4fbcc708938f12159a5b16c6da3d3991d7151f0e0ad4c48d964678f8be999f4b544581e43b4755a1a14212747f9c7f1e6828c8ada75a8eea288309b0c3cdd8c03384fbab18a8fac1132076224267016b3a7ff36515a49c33cc383c1d20cdd5e7a2ba4e1d51eee266917f0ae3178fc500bab8168d41d38b9c5b0a6d7fc90fd65c3739f44e6be2b274a51d58cc20cc122cd402bd157b0e07fe1f131ee192ae3ae9760a5a3b109957c775432ab63d96ca23a6dcf729a235f060517bb6b9bb62f76c740d2963cd0447662d47342647f1f05df53ccf37ec82b55dbb71e3f069576c29ff8a00babf93ecfc71e193632a113984779b610285ad690c892066e6748a4dbf9807f0f44ee82034fb07dce9ad0184de15da4e3aee7e212a7147b6c5373b7b64e48a32eb13d2b3cb617a7c73dee59c87c8eecf0e013f0da662c843c57a01e4dd64eb7d1f2ad32d605a5dd086165b95283d0caf6ead01a62ce169ebca8a1502bb31997e92fae77807c8fce7cea36758abe052de1ae8e7074ce4f5259c6566a61e26810dad9247dcaf507f6481ff0cc1f45fab6cac09fc307bfa8766035dce8e00b13b1732e759327326dc434d8d4bba6f9b67d22b3500e06f63b7979ba6e81cf6c3cabe84b868ffa8657ddee34118967124539d928db4a791a2b3d74df11bbb5324eada0fc74922a60069c6f634a31fcf996fb9152edbd503f8cebf1cf6b5d7caad152d4e9f9489a9c2232e106c3b04eeded9a9b1262af90f984e46dc351ff79c01e884db1db8c1324d273078d6da5bce8303673389d22169643a673e095e5e3a7ba6668411a3bcb421e41a2eeaf87d65cd282952f40acccedbab368d081a1512fb27bf96569d1a289e2a75a4ba462cd1ac8efe6c7a259ddaf1cebf8e382090be66189eeb21e066ad1e527c4cf333c7e5f1a0139e1fe87ed110e202168b53c249a47cdc8f5e7ca34376a2f0693c4c83d413f2a6f4eb5b54c654d2af4fde9288971b63a882e146ca8936d0d460df82448579b51637412fda169794cc5234f80dd215a3d84c2c14ef8ac5273e181cc23aae5f356cf718df71045658b29fca9d16132c714e6d4f716ef9c4798501f114c94ac0e6030412213f1abd388787cfbf4cbea7a38cd0fd1183a3ee8977179bd5c5b483f9108d1964b6f0d0338d2dfc1c367d9e59e134f6a910046d8e583c92f60471bd8811c745cbe49f1287ab651c7fcc60ea280e17327ecae8e7042c90a378c4dda4be7bd7bfd324bd977d289fc184393ca67eea94466c4b157e59e75a6ae7d64ff0783ace0df8166eab9c70ff9210b657d03767a98e8a3d2ea7705c4b321b8bc4373d6abdc3d746e8c7858d75cfc30b8aacd7ebbca24b89749d9b62dbaeb4daa1f6589082657f7e5e565934846d5c368806773e53b927d193d40c231666b599013cdefc00eaec2361c3d4e387207f7f3190ca4b2b72488240f84f9f30abbe3f42c7c3831ef777b924d81b9578a6d93564604cf9bc4078f2e386ccc7c583d4046585222f559bf3cfd4b3e9c2d656fc8d7b612e5bbb90dc10c3f520635067edb472452bada8d6b3757294e00906fcb0fd745ad7dbde232daa0ac5be7a8996efe423b7955a8b90659c03d798a96ca462e532752cc1c328f8ac1d1d2903ea89f22d92d4261803e812e0b53dedad66262500f7353123c4c463c93707aa1862c5633acfe65272adf0cd050945258cf1c7bd7653c0ee377140b34d0642f5fcc1e42c41099027291e17cd2749f8e65c2eae56c8596ac518dde90935a679654794b94731fe44d4c54f0638efd1b3cf75a74680627fd1b36999d76e85f88ebb2460a79a28aef05a0cf4cf831d6582b17f1455ab3feceab0febfbb517a19d996edea473c79282f0f938a960e950f456a7fe767308f0ae87388346e11d16dd72f7a163f0cc98b6e40a425d5019d1d9a7a51041a87d72ee0b60ebcb3e36cb8058db01cd3698b433cc3914f2389f3832c85639a5b0ba7b5d6157704c51b0ccccb7c5539e5ef8e96eb3c9816c6e7b063525f3492ecd9d2569d67d35db5a9457df2ab86b774c0f975b3aa5b840c49e16c7b9aade6ea625018a5af8078662a2d840989d42beefcbf29e7f5a5e3314b2e26ab051ef8fbaa247766afd67b1e1e26e9a42ecb0e6d5eccb7cc6f29c64d493f922009c88887cdacd6a5cb20a06fd008d02a98924fd7b175371e4d5d7b6d0dff85006a734869bb37bfaad9791610321dbc2ce4e5692dfa69c4e2d7f6c83863c6af130961e49b3e740b6c5f198a53f544085508e80bdcdbe66aa7e74942ec4368a11eae0a22dba770cd07fb549db469472a75a92506dd4fc933aeb3438daf2bc23b878daf07c7f2cece6fa6bb45b6f8b3434d21447cb021838327b5e316ae552ab8b521976c5a2e65ae13a6ac6cb61bd6d80491f7e7ff87e9857ddf7ee7b1885ebfc12f43156926fdc274df6d3e2fe81adb24cecdecfe1c7b18ba5df382fb532667e4560daf64f3dc28733826a313b50b53dc9b83ee830862662aaa02a873509e697c3b3940dc65524f413586cce5db2e2854057c9f65bbdc5dff30930c0c15697e660f06a620cab0556273f7f446b1a8b5b232aaf85f66d72c678343e9a391412bb1615d54d744bdb10443d1d5eb9e5e14157cffba6b38b7b81668635bd4116624617463ccdaddd75397329487dd08c54f1f993b822677e6f4bcf18a30e010000000000000000758ecf0400000000921f0ab1205f59a3e977fa205e0bed62f3a198b698262e0588e4446e5af606d992021dae5ee74343630e2b90e2690a24cd28bbb80fc52ae1c8ac46149a40f1008097cad372fd9130ad392959aa60941d7a91c51d48a4c1e4a42b94c64ad302a1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000007e32c04b85196e33493027fc468a7a91004a9899b85747fef23470bc803bd3b0db3dc2f275c415bd9caf25536e25f0993c5b3bff8fa5ce0ed1c538ac161f7e89750ac4d9939188be2f7982443a2cd0a1800731ba59a10583818b4425cf59f4175018dbb2d6ee485befed239768326501f6d7cc0430aa4c6d8c6246d53d150f576a8721c44f9d581a6b097a801c0dca919096771da1aa735cc031615f884c32dfe796e56f92ae08aa4fb0b3aa7ea6484d4bfe50618c443e0d5ec5ffd95d76c262e4e5b5abcce54fbf6a31884360a56ab2ad78083bbe977b00b5ab56c37fccec35c1436e5e68250c0f4bc19cdd118a57ecb5999f8aaa165f70c8293e262b1f81b34a67bacbf1b747623fd494407a396066fdf0f6b882c7c341de233aa890c692558a455967a60d0253dfe98bfac46af408e2ebbda32b930c1fa782f64c3468690a86ba07ed3ff35dd2958321d5c44f79c04b393b019c218e01a17d3216ce586e8696d307b8d4a6084b6304cb460c5f4ced4df04cf6a1299ffab0d3e4dfbcb30f71d9d732e9bfb2e1875ec24beb8e91b8fa98ee0f3f8bc6f21384154681a75b43f6f3489ed35358a99bb8cb181b2f91fe0bd55cd7cffd66b74b208d1b3e961adaec897292f9c0b304254ea1516da722501cce8ac0ab7c25baf04fdb817ea580bb5a834d2b280b0c913968ca6ff55ea88e6f0b074d144fc1652bb381f7eb596242b1ae67abdf76e3dcbdea378ff0c0a559a3b7d172487f2afef2fbaf1c7cb2f3db3163747d87335807ba7e3e2781418bddd9581507120ba4be4df869d1a54ec3fb2a499c1b30660c6d8a890277798ed1acb13c09ae867f1d6d5221b10577bc9c83179d21ef62723de8a6e2f22f2d94becb4ed613011eafae8300893d245b042775d18f4c9be1b4a62cd0888866ce391dbe5f1756f5708747e350350c90c07f28733025be0d714dc546a708f0c3dd447e46aef48bfd4ccdea3682f706247c2eeb41772b27034d98ab6ef0cae5bc7822d6612934510dd739597350e27b86e229f4857cd0e67eca518e877dbe1aeb3955352b33a22f7cd2153a576cdafc5140656a0124cc4e6bedde34f16a511625dd87a85dbcab0645e26d04d047899aac1ff0a38730fc7882573ae3f56ad15f53ffed601a09d924e327b05e1e5fedb44f152cf5bd0c6b7f6236e6ec3f7ec5c740afb0797f3312017488d4f1c3a28a5c92b6e61eaed3fb7802c15f349defb5b0413500f43bc88d4bfe8f1aa2ceda052077d04b4e4fc87943751bca1424da5099129d536efa39915eda696274fc079cee8c425dcfe0fdf626b64f6cf941830dc7508771b1b7048d6ce7cd52ea1900d01e165921c2a7928bd5a59de0f72aa7aaa54e781d664867581184fc1ef9a5ee56dd56c69a943e63bf62af62d3b2b95753e02c99eb90b55e5d415aea30c935d181becd70dfd769cffb713cc41d0d6c9943da0dc8de41becd4fdb9a1c2d92fdeed803a21c882b440ce20a9878160ce05abd096a84d4d0fae1d18769d2f1a3903817f9ea2a05fee12f30bd51d9ae7bc65d0eed1028f7ec5338dc87da9fc486bd6180418e964256b916f67535f7e9a68d736d3cc8acc41c5734d6d794a34545e449d485a51fbf084ba987d99fd25352040ea046b5f17dab4344495e015d3276d138b08234c24d11de4d04846d9396fe684ff1b20f2a9969e3ac9e4b22a687321a169fca0f965d77c906fe60bd29b86d28a786e4d48a10c2cd30feb6b94b7b2c7f6e8a86548b5aa9cdfe8b2a5cde8b1e5ae57e05554e527477d743fee853ccccd1a37a831af64358ca332d2712037afc8682974197823c657e181a19d6f8e8b0176ca32e1461bd37ea2ef1d4a5a63d2c99ee84758ec3f3f763defe249cdffa328f01abd34d11d7a3b0be3ebfed90b707d3da1dfe36eaf6779467ca466d2a0dee30d3027942ceaae4a7413fac38f0635ab2c79cd25224bee6831ff253bfa9682db34b11610f06ed05179634139360824be37782db717794993f7490f6b9f6d63b20863e80537d761fa0c710b2082b7443826cbcfc19064aa8131ecff7d1c7334c8f93459a4b20d52428de2d7000a702cecdab1661752b21107f18be83a3c303dfd2bf6f7a260bc3e9c63727d60be479e28890f5b3d7afb302b62de05eb8df31a83a1a64ab35eddce84ad8c1b36b6726ace54a59bfeec17fcafade24448840dafb2c420cf4b86d81909db25f2d1fc873181f8212f52b8e501c26b94ef2111e6b43cfef77d78473750591b817dc73fd0312dbadc6a77af4454a3fc8b80400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "63ac0063ac", 2, -493218056, 0, "ae2cd3e68f3b82e6d91a5710db92838621033248c820dbd4f386ae390a87d80c"],
+	["e60bfc000346897ff25109b6bee18b6bcbefbf2ff5255db13574e1026fd450b89f17f525690000000004525251632e7d086dbab5e9eb5f14809c305949cd50ffe33e94ca2e88fb386f85daa436d7635c65170200000000ffffffff7232ed4fee7187648488b5ba05de2e71adc731a9ea76cb5c89c0c381d1d097760100000005526353ac6af6cb1b7a0445984e0500000000016ad8543d02000000000652516a636a65969205040000000004510063630d3ee0050000000009ac6a5200515165ac516455476300", "", 0, -1351194477, 733220448, "7d4e6e8f7c0d14f7b07164d14f8b8aab68bf159cf7712b6779738f593ec87367"],
+	["b4a26d670308a623134f56f00de667c5db1e6ff444e709c774ab4011f986416b6bcb91f2230200000008ac6a6aac6565ac52ffffffff3d93b1298c910fb42bf49bff62679c355691fff1654a556d93996ca6960de22a00000000095252636563536a52006496542286a931539a85c00dba90363f61f77257cffe7faf04a3670d258272865d3a74a60200000009000053516a5351000017de3858033f337102000000000951ac535365516a52ac56788b020000000000c6b8b5000000000007ac6553536a6363bf0fa85c00", "520052", 1, 5151012, 3925833126, "8850b89273ac6ce02867ec27eed09a316d37284be4bebc4c06c0d930e6afa597"],
+	["0400008085202f8902b49c206d9d338a868c127f8fec35580279761662aee001978f1125a18106b8440200000000ffffffff361f46937e356896c8384951c24a922c424d71b0e1b31b959c5d4562eb61be4c0100000006630065650052ffffffff04946c190400000000060052525253633ad6750100000000016a48c719020000000007005263525363ac859ed60200000000016abe3dc9a9bc5a2503bca49c050000000003b22e33f5e6337fb2b92915012fdf92f629fb9d9473ecd5d5fffd4aebc60d24e1e10b5d263036f3ee0bdcf24f0d654a9cf26f59335c3c7d043825272c7e9fff1af2167e9e0df0bac4efb07358a489e9d7ed32a8996946f11ddcbf0f2a56301c432054be466cbb0e59e2d5b50f6a9c3ea7bf312845aa4eadde0fa2da13c345979ba534bd07fe130b93cc97345c22000dd6da1f2944bb1b78a5bf06a6c61db8b1fb6a664d4a7f0bd2a7e4f01b8d184193d73a211dc8217eaf0509acdf31bb478aa0bcff7d8ef2422f0f7fd0ada6086b5a60356c6fa5dc77abeec7b4ffd4927298f2d63785ac92f0f3ac2e4a0c5a40475fe6224a9b71155b76a2d818ca73b2cdade04741b69ee40e10ea844f4ee797a853478105ec919ee485b1ae33a6680a843134d4bd287813aac8ef7e860d665fb2f9c52ee67b6a4e0d2b54952e8d5a83dcbc1173fd0312dbadc6a77af4454a3fc8b80400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000025efca7c6c95449a2affe3cdc5306bcf91c7dcabaf57c6dae67dfdab2306d0af92bd0c7cc6e6ccad66b6b928e6b29a99c4fd6750ae491a1c8a6d6c097a3b0c51337808a4561124552039f60539bba93504f74a71a73b6963fb843b33b31ad0d570b1b4e2e41fe1dc75408003695acf4941cb302502a81e8de5b186827939a715f4dd96a77e36541e9c22072e75e92ba2368f06ac918095d15ad49d680cf82114ea795db3c5501788136fc7aefdba5a5d8fc1785a92a19d9d025fb3942d95fabd9c7bf057fd9ebe8bc8510a4f5f6a61390a9a1020e9d0f0a4a0694af3ebec8b281c1a40c4f25360e971783cf45c10f8b50b48a5be54dba52ce681c4cbedd8957e21b87c71b3f8d32bce32c125891c20b6b406de95707d14d85c423df1a57f9425123b556403a83edb0a652ff96028f677a9f1f42a25a1277c7ff3ac9d3c3e70e173fd0312dbadc6a77af4454a3fc8b8040000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004256b335d20cbc0f716e1898d5e525e388d304f6831893c047eae03cb92dc3ea05dc63b15a9fdfca23cf2e5cacc89fa2ff48f090cade1b78f964a9fe662b7c680d185e84abe173db7d9f1c0c958b044192b2db7f859fda250f5092859dd4a65b1adce205cb5839c1b995d1757940e92a0f155821a5849d12a2b378e0404ea3babba03eb75387e0c6f5a62655a1fb9874eb56285e5f9c535183c227288df196919eb874208f6d0f95be6638e69406ab7adb8100e920cb2aaa64b7e0e1023262898040efa72f724c78af6d809520c99394a20e6b5ada8e1c7298d6c5f0c059403d2492c34486c372d1a295f015c1088eb9f2269f13813c04d2e9c783efc5e3368cd0be5aaa834cda461ddd6a55a839c052f2c67a79683060f5eeb444322623dabf8de98bcd9e71c56f430c3e72389a5619ec09fcd810d5beb2de9164f8e55b421973fd0312dbadc6a77af4454a3fc8b80400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004e02e9e0a2b958f7aba2eff1b0efed6fcf5f5355486f47eece7a3ed466eb746561faa64643aabd2c9b625e064d41792eecd55e1ec81304b6188ca9de3d3a11f63e6eb985c93888555b7b8113f630ad4760a48568fadcaa999f033574fe704cc96d8e16dd1a6533c3439288d578d697f806adf6465f535cfd66d3e51c373844b3b1d5eadf3e03d7fc753571fb59b437973e357445598c046d48cf86ed4a3813080758b6430b0e08be59c4ef32e72fc3ccc6d19647011a5a42069bb4945729bfe73f62faac5e10c10c82111083a8f308fb99194544e290684fa89ab3f47d62163269f2644e8fd06c7352c397afaaa7a43140bd2b56dd494f3c7bd779e002047472509cae282379b8b53d00b22da1825933c19963df498bbacace8d40064c59bf01b3e2215e2d46743b2ea222ba619c56606934b4bb29e522d1a38609b7a2a2cc1cedb4d55cbd67f1af553a6d0b14fb4b049349e45d6ec171ef5f5d9d79820da31b8286bcf7724d75e88b795f7668fc0115fa1f5c7590a0d2f0395770abb67f7ccb029210240f977b48d8a236fc57207a2634282d2c3b8064270ddb256700d2ebcf05a5249ac9725491fe6070b0b92c922f491ee3a4d6d5706580505fe38c3fe53821e28bb4fb8539a93f6dcebb306daaf731ffbe2802b9e7fe8560fbffd737eabbac049b3c1cc5adbacde66bc557c9f6bcbc965a3892770d70c84b887da2b82b10a442e3becb2ae0857264a38b83d5bbd6cd22611ff3b420695e416fc1ddca5628ca360f6a97513b728ec027d2c1b1385a04237537a40950c3a0e3855d31965c1b36dfeeb61ad4af2b413d85b56a8cf2ee88b0f0b5cccd853461268ed3e2490c0c329bc2210bf844592e75bea6038d4531d9c13330728d14cb19307d01551eb35ae42e4f369a434dd84c71109ac088a0b339729c5d13ddd71f60ca2cc8fef122922b1fd84022b3f1ec3ddd07327c8427bf2bd478c376fb891159b92d5d1850ee276f34ade7564aa47d7162f24d08bb0d140a6ceab1aa2a2ec7e22f620bdeec507d18e79f46b033d4ad256aaee7b74848b77c75cbfad9e2cd1b9d40ce2c43a9fc33d2550fc131e6fcff888ff55adb14f1cd19163dd4268ca1676e65a3b830f648f733f105991022b63ea6b298538c128d9c0203a72555690291b4fcc5cb449adaf462d00fe17242f94e2b2ae3c34e810f79ea9311809a6bb996f9fdf37241fb3b512c59cc170c5bb29136ce51eb687e83b509044922915768bdd546447e8affedb2e2277311d40f8c16d8dac5929b05ce22c3c250aa4319bd458b9ec19124445c63ec834f967d88aea5066421b6c6fe077ddddcea67548fe78e1d3db354657d421c18ee87f34ba07197c05bc2d41ea0e503b01c9123fc6f43e9778a67aebf726d86a2859fd14a05be4d71273cb934bb709da7c156e276ad6730ed91ca32bcd319a46fbe222b66c4f02fcca87b59c0d45eafc1dcb96bb14ad8e56a154e16470e7f2bfbdb3d33d7120feb53bf260057687e1d805cbbf494dc15aa2fa944ce5f8c44167f231767e69ec9175aa678e5bac62796d6b9256c42be3d87473c6d85929fbaacfe7ffce917f88c4b225c7d99107e19b4a29c70b6dd3871e47d5c35d136f7fe001ea33ed3f9d2f203c6bcb8eb8823c90f47ed3c8df320ecf0d2231557506354956e0541842b771144a9957aa01ff5b98e6f90cc856ab234dcb2a75d1ca7f0cc641d01e78712a781ddb07903df27079d4e799fd708bd0eed0a1a454a8b7bcc35e4ebc5bd4949643d040b0dcf658dac0433b95a82271d0a4f3a22de14be9f19cfbc72e8b0c6a58034030c0ecfe15c7a58a4fcbad91ec5937b36aaee99b7f1d2d9cf44cc562293041e4d99b2ba53fb503de844b1e9cfa463f4136b539567748248bd7d5f86397870a4702e0f0004733cc3a40f8c8dd3abc101222117d7715dd326c687bcfc04828cacf9a8b42dddd9e0b87f693f42392a69652f7417f472fca7114c9a61163974f78608bbbdba94530897a16c4a021ec80abd2160142911ae6f5f23a44881a3a4e9a06ecbb0b158e2ee483f7a597a31e6f2bb6103af89fc6f3bddb7018cb012c97bb98106b417d1f5bd89f42e3fbbe7a5dd0c3dd1e32c115e69a9625c99fc98a0be5d13143b837a43714ea8491863edc8ac465cf856ea08abfa8c6429ccdfa9002d0eb8053812e805d5f7ac39b26131b3f9fe52987d1b68f429a06e9d53155aa7937ab63bac94b97f2e5af71af197d4c55ee6fe24c9aade269b97b5c246258d5e61c64b0c4b877f9d1967fd27ee7fcecbed95ebf6d0bc60e94483ca6306393927ddedcc7ece4ad736c5733888464ceb54a0ea5fb6397b874854e43a2f187bca009dc7c98a9e504961c14e6f7fd495d44393e2eff496dbe0a7ce9a3ac29e1d2cd1305cb8bb6cbb6d3c1d9f054e205aedfb849a4740f80f02a67d363d658ab9878b2dbd43594c30c78e32a6053e00ee822e6da7106760d645d78f4a3b3629698773b47b4f3f4d989e32df9420a592cc7883d1c0d50efa2e10950c5b32968e60e8e5b4b8ef929e44cf4740e5c7aa5deb99adc19b20d43010c8123f156bc7baa892eb6bd8edd3544515145055661ba91c36771121df50eefff3d3231e1f2aca7782b90c9624eec7c5e17be3456f01055a09ea6303ea4073f5e8bcfc9036f02a663962b9b5ddd71c86d16e36247844eaf8220b846eaeb320d9ca3314f3c36984230fb1fbce160aad3e236354bb7d5be2e2cdeceee0922a594f045b0d071315ecde52fd6cb1d680a24d00e8142f8ffc0e31fbcc5f44d62992009c211866d3081ab5f0af86658399865865b679cf57a6fe596fe6dc7b83cdbc853e8a03057202931f0829ba4ce3b87ed22eb66d0b106ee31bcdeefab54b3dfd16924593f96418d719f812c3eac124bf234fb11e4f5797b76167c86e42bdc406a6264843399d1451261fa1e8bd8e280918dbe2066c2b9cbabd0168556441fa324240a5e97f98834e3c076cc74fe2d626a7a84f0d5cc759fd8ed89d82375dac7295880e8aa188456fc1cf3fc8cc19606ccc4a7fdc2bf60a7355352e626561e6c6e189a190becafe5854bb4e410d23f22ef7e3023cec1e2fccc23f00a8b0955e8f0a40ea57380b052aa2d996239a5fef99c22cadba7bf46edb2208e9b73516bec05810a584e2c60ec2c6f035d6a19051ecac8006770339d349e0ea6d02d740845b17237e8827635fe7d9395152854a16b2ea108be7631a8cda0c6a200632f2f789d9c842264857797b33c63ae96f627795953529b1484fb4fb3c13befd9a4163632d48721f1388f09731412e16b4869bf7d09df5de4e36d2ce6f9809e5a8ed45298365b2894dc3c2e2dc7f654e40fd7cdd267374cc44dd86cefb2e413bde6fe296451f7dac54c78bafe7b3251e7c15f3562ae081366ed59aef9f82cbb9988d8cde2674a592cc8600f335408ffdbbb12c0cbe15fc9594a2d4fb91a756a1146ba8f324c39e1b29c392555bdba9fbfe37038992fd38d9c7b1289d9c80491dea7af7260685b85972bb94c7e7f73db2cdbec77535a31975c58816913a7ec48a8e32a4194a14b5b44c13ae4e50b98cd931ca040b7d3a0b9969996cdb049bee068e831e0a966a149deb75aed408c31c2a3c82cda1aab7f425800aa1dbd26947c1797b9e55570fc6a0c26450958f21dfa3b7e7ca0ed428f1e471953a754695a4055435eca0d37d39897629de7730449397eac275f7d5c66827b0cc8b68061532f2ce8584957272f782c4d5e981ef0cb530c95ec796f344a4c50bd266ee5bdf06858da438c6ec7a979dcf66055a22e187e2f0afb7a1da51535d27b84250f3b040f68434a155e6917a4c457a67a4f3cd9fec3fedd00522df5a9a1eae4099996b4d121bec347d5f0c08dac004b1809e60d88a3e9bd4c989a2b0b205ebac0e6c42359075b4e960fc1da93b8afa191f4c4f84bf7ee0f01c658af83b29cebf7b947f2c7efe7d9257fcd31f629e7a6300c4058118241297999901b37952d41f34ab7eca0769f9d23f1e6cf3fe8f4ae818048794549382d6806f72a1a544f1755283aaa19d164cb7ba4e53fc4ca4a1571c1d83391cf419bc8ebed37ef9bff137393f1275482e5969de4c54bbe2fb0d4babaadaef481f521b825924efb7d408672c69ae689e1154c0b3f02ac6f7aa44d3e44ae8ca6f2e0ecc934fbbb0e8cd9b9cc7a48164045f425c6f1750a100cc48da6fcf3acefca8a7e362abb44e0c5358db5525414d105925513eff43e9392f2e6311a395da59998d213db7207f49e6534637b2eca06bf0a6f5efa8997846fafa6c3503c002512aa4e4031cbb1dfe299d4dfdcfdc53525212d4407abddb16106f1bc03b49286a5cc723ef715793e7552f9c286814685d8c3be767436f1a1a7360fb8c08505964874a12189de18fe785f7af571a7b933be8eb03250509f6b9c6681ca1c799cd160c7cbd53e96c34fbbb88b4a7f0b0edc649cea5db2ca307de367a94ef6bc758bd0414210d43d50d93c74275b5f20e3597f50b93addf8fbfcb924f59a5e8930c4b518dff015e204a2693cb5d9ac1010c1def6188fc333c3421fd329c30c93bf940066cff0744a889f429f1f951566ac5a9d0ce502498a47b2ccfa414e509260748cdf3e94c9ac13f51b0dc2b7d883c8f3b051b262f76aa3858a224cf177705ae616853ecc2a66277bf391475e935cb57008293af528bb6502482fd0b0259a347af418de0fea27c82823baa005523bb3714b281de8337e2c34a1dfe56e15c80998480ab9ce47417de1568d0a9f6acca8e0574e228a86629f894a01c736097cb608594024502a92cf27dcaf7b1d3fed4706ec293601173bcc33a3847eeb40e732e01b945fea3e59b92df7198be4dbfe8af7061b4267eeb01f118388bc75e09cfb18208475344466dbc425759571ec0314ca389df2a5be655c9fb86a1b8ffee1bdeeab4e43f7bd34349f6ec3cb69dfb7934902371cc15b2c471d6c9497e410fdeee0c535749775b9208ef2cc728579ab454e509d48f39daa436b6b781b2db66c849c03ba5da1ee7a9545befac683d220ace9c770369d740e2fd76fc0e91640b1dda06ead1442d062d7da0d2ebd8c272f2e8ff14f824e9d210ce601301312f0bdd0ab911ac8f20ebf41e2f0895d2139b77b066b7e8cb826f9c393344178c8298936d82c23f9dae101dcb9002c420602d30ecf62dfe54ffe00e4bbce1bd98f3cb0004be4d975c94f9e93faf60ddb42aca56336cecf788b59d559917b0d6249b4fe9f69bd23b17a15ce42458e8a66ab614c3ec6b4f7b2ca7fef909e11e9c8023ec88919489f6278848cd7e553bebf3e1582898cff565efee5b76c447f00366f429b03626b89a5ac6a0e71f631f304032d437300000000000000000000000000e8d8a042243675a5aa4f3651211c977055f9034b74d3e763d4d902a8946c14119754c0fcef27a8c2e73358b1f21e5e7c8b572e41d18e1d7f037ac9263a0a3aa8f69e800716a80dd812626361152c6c856bac21759176835892107ac006e8a83f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000e84968c3942ff4c6075f5e3a16f8bd5eb742689bc6d6418dc762a27d0479ceaafd68e5b0144579685a53b3aef58baf59870e6f6f1efd00979f9894762095de0d5a196a9fe8c118e4a4628cbc452bc4d554a683d96f54f447b07c6c94ed843e4e77f1da3490be11799954c483d479fd37804ebf861bf508c114f6a0598268a58f6098569e822c0dce9ccf706e74fdb457be39a4d89bd3c1fa32efa4c7da8045e3192321f626ddfd0b5c8ee25811f0847dabe80e09f3c714e1f594c1cf5be7d6c5e0eff4b94cea938bf2305b98abcc66ef030a9cea1142980e844c37e9f7753f3a92550ef21a71a9ec92ed57ad72aa9fd42e271bfb5bc33e2487e58aa5fa7ceac68a3697e44f7f3ffb8ff22380eb45f1301cbc0b2121593f6e7f3edab9bd4f3a7d9e5afe41dce40c305b44ee1c17ca0ef3326e3929ae81423d40c860d1bb859bdb545629003f9cd84c3320472a19e4df9c3ee7a04fef3afc4291e85f35921c4498a7c83d35a836fadbb2eb6831b81ba1c2a2f7081a27ee46194d9a9adf674ec24081c4517b46da6e83291f59e7846499622e9d993f58362a04eb95ada9356dd756f8e711e7e842eb231c30f9f88a03000bf31fd2740668610f056896fc84d7ab15490d62eab288ce2db60ace5aeea727e6c95b68db0a14ef645578d46445d6f7c7d4d440abc72764222d24816d825e1122dd29a44fc05586bd7d8df56bf1157cc8eaf202e39ed52ebc981b8f8a64a28b19d3294e63138676c86b39d331a14de1f1a7efd4c0b18df15dc45a4594891b48a6dc95785a6dd562a010fd5521139b00bc2e21a28499b17bedeebefdc8a0e7472544714b26208875d8acfc81638d23f1070f1bad3eb1cff1ce728e2fdf1227fc250b77f7e6883561a0dce69bad3973a699d5c90e23e7695fddef562aac6c8609f6a74e2a603265500863ac6fb9fe57692b882b104a643e8bfcf0659fdc8dc0bbab2ea63312a3b28d3a44b98ee99b95cd02d0422d96d333d3425271981e6bf9eea4832b88350c699d1ecf4b0761cdf62fffd173474397ad95678213af993681e3020d297a6694cb66233be86980d5e87e15d384c74a70594f933273e4b631511007b3447018afcec7b350ec3c6d6e5a2abea42f757c2ed3e8ae7d03293c3434b9ddf65eb88689dc1dbef675cb1d7a59cbd599a58e14b69ed0bbdb6736636ecb5c3bc16adad3bc30c0db5a257b0082fcbc73ec3075cbbbc7c84429bd9c27cd928898f6691d5ca723f755b509d33d321a364cf12fd577516ae69edf3aca9bed40d82f95827f9e6852ee407406841355fc37150a03de376f74a1d7c2234c0d682dfa72fd9648ca61f60abc76c943a9fc9e2fbaffb7e8d1a7101770262b33546a153e223cd96615ade6366d7b9b4667b6bc5979bbc0a9f93dae66ed11105d5710da26d2c15c62aad44482173a915da105a4d0e808f1a0fe2d974c4e20792afd078390d0be9073fb898a5f061e05c9ba1427a16eb917e7affb712fec034a5f0b0667e0503817fd6c840d13a2e66cecc0e95d77336fbc025c569e72c6ccd35f81a86ee0ae6f13456acfa9f632d6d21eb8785837eef3a0f3fa7157aa4608133cabb0e167edaf0c0670aa9b3d0a898644bf4cf2653242b36a52b960a5b2ffc0d77315b08038960206fcb885b26409a5a8f6d9a3df92dd81bf1ae3407643520aa322e183973f4a69ae416308545dcac87520cc99692fd47a3826b07715ba8b33a43c9674058506afd9d33d5d5969e5cccacde2a7131c809408992d1f5c4385962dfa4ab31f7bc60b149f9c619ca684fe2919b6897861985e370f15ebbc45cc2f4991e6e7246f11c3347da7e9d4ca994cbf5eed80e7819d1a5d6107b795994477ed9f62288229b082b62086478a3647ab3bff913d1f5ab3d4e7d747826f7d79fe93259bbba7030a7b5bd62b1c8259ef64d6e7b76f712661c54926f62bcd6e8003b8f32a042acc6170644a913f82948b93646d39c67a4633017bed6a4f2743c3b6c511aa8f86aa45927e99ac2cc24bad02fe402b4c1fbaf927c2b39cea00dd77d941a441fb6981ce7de93bff5a911080359ba34cef2bf1ba6388e81e7836e53d121d4d78dc3c8c41b2e1f9af0989ca498e69b8f467c5debfb79c1c680b2b340b1629e2d145d31d6cdbd70e8f03000000000000000000000000510379c36829fec54d0703e8ba8aed2ffdef04e08321458f232afe8ff5d0123f439998e26764bc3de8dd67fcab0a741fed8c4ce4306f46bee0f41b4641a206ad290ec42ea851cd1f9565646b7d8ff76b9ed3953c67455c85db74d0587507589c000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001dbb41fcd5190073cc2bc506612179d13e57dec9e6d4d8138727ec2814238cd4901e81381bc594ff4a030aab9991dd41ad8d06747993bae27d562cf60aab64cfe3e444daefd637efce1e28e8ba0454b3d0b3439b41bb32e7e129cc1b9a538824b383cf8858955e6d14d4ec1e39927d4783776a752f22672561941a358710fc0debc38e051e12c0e0b2d6fdd8ba244a06a6eceed314c7dbfa14236319ce5c5f3edfb5f8ea3178a79286508bd3d462fd658cf8046dc128dfcab401b3cc692994aebf9bba3be2824bf527d56a65d2387e513a907fdcd32b7ea23f888bad3fa800f2504038176e2127a673592f9dcab1295143c9fd2cf9945d38c5860d6a2ea0553871c03df94976a58b983732b3f612170c7e50f009b38534a3572c66abb51bae5a60bda550856af8a9611a143400cffd2bc4609778f0ba279e9e4207fe3ebcd861589c53c835aab4d085606d2132a1bd5830ea481fc3e5c670ec859ca98fca13a46b43bb2bab37c3eb69c6dd7dee1ee8b7c65eb440abba51a2a53fe22737e0b63b2bafead2f1f0e8283c9dc6283face13d60c35d178909332a38ab9b7a7d115811cac972c74957cdec662bb945e6fb5ee9db40875afbdc55a7bcd3370d38059a6725254857dd27b425f4085e1e34acf871f35bafceb97b054f3febc5034a9096c920833f055d6f3366ec01d18ba963cf83a7eae426b1d8487e82148448e6ed6de14bed6e7a067e8818ea4c71fdf5c9e8621bc81c48c79ac0d8050d3f971e21d5d634213eee3c0c74276b268240a6c7ab36bdd68d437af09b66c8d84d7f4356f6dca2227346c054ba00a280fcf8c445194c39124c7c289288bd0f7a08805e81e3f2d7981ae255b5f604c55bd475a6c012896b5d6011a337d1300227939127e5ddaf3e67f1375fc36c90a05bc4e36c73eb97e8ff215798c380287a14e474a5298ff4a31c3c694e94a29c77b300eddb6a7854c4cbc1dc453779da471c424750551a3fc5d7e2b717798bc2d303bf7808c611b7d09c5105812b634a7c03ce3391b86ea560fc3b2cb4fabd8aa1a1f070188c2a87f49d3a002e93b110665b9516cac678ea626c5a730f893f8284c283a7ca78ce49eb5387eca0d423b7b7c81c7f6148a1905b53708d49a0e0e9758b70429b105c86dc7eb966132baa1f3ba88a61eb761773cf858094776583308106a73311d4d7517e4c634a734c6d67e0e97a4ec8f0395dcfbce1d0532850d5f9ec369385ea881913eb0a5631c4edabd68075c8f718666b159bb9a4feefd3ac4d86e06c01a408ae6ad3b09d3dd73e47fd24d09ee86de2d8899158c853118ecd54a2df65fdbd256910a78bc3821a208596dbce08ae35a25f04c93e91089009a2fe52b024555b3a0a89f7931ac2692b55b6333035681a6c5c271db4b105e2086943826599f4a1867179bfe1338ee9368e8cf20da54ad594295024deb8c302cea2992ff06b98175e98813577bf4f54ee6b1e49833e62a7fa2d1051b6c7697318990fe166dcf4f95e6f89885b8fd70e34ad01cc6a3cadd0574be1a9bec2df577ea1f1a6cb8b1dc98db177e33a0b830f77f8785b3bad40d0e8528d8acc7a45fb6c766c38ffd05aa6cf5336b4a03cfe41dab1c417d4b4e70691bcf0fc8b31c42e6efb579bc7f2b2a3e2d2bdca74b39727ef983a2520d37bae124991fb4970cbe00b04802e4b84561a1a5bdafcd6dffa3a8b484eec492df50f467158f6773a36f028abd6d5df21ffcdb7107250a5c6c8141fdc5b3dfa50cb858563f141418b7d5df15d61295aab27072286714d441cb8e22cfd92c9499f89322f39871d3929931a1813e11e8e0db26b70099439b2035aac1e14cd3e4f074797de26455f4d70ca8d38fcb498502495eb22a8a023a5dafd8753749a2651c4b27b1eaa5548c1e26ecc322902db2acacd9d68ba21c3dc809c5edbc6cc1c4b71dc918cc01c5344b2f3f3821555b54ba6c7189f4b4ac2aee9ed6f6ef9da726aa4383940e8c8c3361435d81edc14da98900119a5a6beb064b9d3da3a7c3bda126c8c4b1cfa137c9f579fe46935a33c95eca3aca75f48bb5ecadf0330ea8269a0e960fcb8607317b2738d928f7d47448ae0e67681d4cafd8237b618b4b80ed67818e5a1987369872d2d1d502c423a682a38936cc875909d8163c004000000000000000000000000cf2515a5c6af4d827a27520435a1d84ff8c13be7bd9330adefdb5226d5b659329217043553c08deab2600ba75c5a4c5333f78096672e3e27e9a4204fdd2c8c7ba1f8143946a99458f120ff5d5dd50f5a6238bd36c9d2ebde374fa4e49d11bb2e000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000006326a195a8e9c6df115cc48929032edfdeca4574b455525ba2914b389492d28e925926e29ca31996cff33d26c62bc974d279b3f405bf1b9a191ec78817cca5dbad4bac5419f659f42ed57db0213d879469279a4fd22337726b6d5301d0ac1609ab01252ee11451ba6cb24c8d39d39344caed5cc312c9d26d4e2878c4a0d2713da769e2e2be022a7ecfa498689a6f4ce9f475a6400ee041e2e3cee9f3f61d2eb8aab181d0ba963280372cb856e65e151516ed6c09ac40fe6aff23ea73f67550d0219e46f32d4cccf20246a655c0d2f7ccb36a60202811ee8c8dc4d1b85736b6c2d4f88eca033a1ad819ba2953e65dba493b0f55bd8a752bdcbb5be10e04a11b3bfe4b5cf62237db01e29b664e7717d76a1ba5a4649301a0eb7fb0df05acf08f52e91e980d223d6b735a57e8b255ed7cbb288482466b2a9a8fcca96247b9ee2d90b55b6148a0a829208b060067695e364c4aabc2e36554258dc78cc8240a883860085a3a30a3a95e84632f8deed75465c570d5c7aadb5cc10b4f94fa5e166840ed2495a1616d12191cc67b05a89c6cae220326f148cc34ca95f56da85cdc042ea52b2ccfe5151005c0d1d1afb1421bf8d4f5cbce51c1e76cc837908c291cdd5c14b0223970f2b59db34eb67dc942c52d3bf27cc5d1763c9f345c0eaad54c9efae8400856628554e872b3ba555bb6a57d985b6970f30468979dbb290366fd8619c3ab3491cfed0354ceedd9cf0c3b45288ade3ee0763b801f5e5991cb2bd4cb355fe6f3d4d9c1d58081dc6fbe70a3cdce6a034ac5c20c9c8a76a8cf1d3d13c05790d67e5d96d91e3a9c9bb15b4884f37290098e15cc2d3dc0cc62fec7f07506856afa650553523d21bdb53045918af606c553f9a31a0d9d14c92ca00f54f6b5cfa4221330c99effb2062c0e647e712dd28d4aa5db820fb045e51e956448d3c2cf2491b9fb43b7f8a3e879ce44e5beefc95e35ba8a4dd405b8629d86f1db5ec5ed2ecca24929b0f7f2e7bbaee2ee8682530c8afcbce60db902223b71f70187bc159cc908193b77f57f77651fc86b670c16fc3f0993834e2c4c6163b9f4a0127df62b5833c4537cd8519b43a1b9fbb8b5fe45b9a5eb01b471000ffc0776f8459aa296503746fb57cb00884c0924baff81016f8ac3566a3638d36b128150a6c953b53b1aef4184796a0d18dedadc486f2561afc17797cdf3d2c47dde88dd76da8a068be1f641c5a27ffc27c867a145926f592cec70e3ed677a72f9be1170f8759bf4a287c13da05b21ee9da14136e71871b53e5e5bdfc02370a40ab46923254f2d45eb2d67a2b9546d1184b13bf6ff4d091489dec9d6068a0a87fbdbc09bc6938620569481922904aee10c311e00490035efc28ce7cb639d854c5f9af7dcfd3469cef1cbf863093a1c9fab1ff2601cc707dfab73942d471a3090fa024f64e4651e250958320bc7e68004aaf6f78d0ff347e4a102e7c59f4770bab0a5757696b90596e3e2fa7902608bfbac974fb0532944f33f72d90aca7e13430433ee185dd135f4727b32819247b882e7b742faee2b05f5e37da976a196cc2478a4400dd4a9c845e08fb405267d2c185c1fe7fdd47383cc890a97bb30961b7580326853a28910bdb6a6c0d6c439bb104b7e34bef9295145b0da6e79f41aa453cd7f141ddd3f862e1ef34578cf886081f6fa1de13876706fac17e1be4b630412c0ae42c9c22f6be56e0acc37afecda7437b1dd1c41fa06c3cbcb8383a926192f79cf2b50845e9ad975b188332f987991700bcba26c29d7e6683a195d8572282af79584a126211cab16b621ca638193435287b7a2971ff97860fd36f8e4f9b3ef3e44f7fdee261f1f9b102a3e1a1aa07bc4e028bb6bb35ad9cba14914b46fd2d5f89413eb94d4140782c091936e05b3a748f9ac3d78bc78c54024a6d7223edc0e6a9c5f37b9f3f504f6f352609723c17f13074d007c955e9a8875aef104003e75195a2d355189bcec7cc9fc336372f263e72917aeb2079181a70765575fc690188931017d93f63d17ea38eddd02e20b0fb100e15e03fa5a0c47a4e623dfec6ddc0dc47f7d58cd8ed27e6275fa4a4f71df561d0a16b459db895684eda27a1d17967ee5fe2da497dffdf3e0a477b723e13ff98adfea4a7ceec129344b4f69d3c80ddca267a1a782fe8bd4a069a4833a049bbbbd368ef6642fd9dceb1da23500562e11efeecd949476b778576a836254fa9851fb198c762b67284172a4dfa2e46307d5394bdabf7af91a5b60c53128e11138a2ea603e2c27b7b6de720700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "", 0, 1555615774, 733220448, "0cda9fa3c787f38fccdfe5881daf3a5408795f02419e3a47f3a90a9f23ef1b21"],
+	["64fed37404cdde3fdbdb474a598df85c530d9127eb855b918f85cd81f0667dfcdcf6f1698d010000000452516352ffffffff0f00e8ed2d8a5a507ccf122d867d56b6f9b920bd72a7cf9cb9fb42347b61e03f03000000085365ac0065655153897f608e8b8b49a4eede45a28cff22106ffe94fa0d3d8da20c4a8dff8cfe3ab3f6f557500300000006655165000065ffffffff389ef1365de1ee0f05ca149ef62a42e94e1c904cc93f6745facefe7e0841237d02000000086a63655352515151ffffffff03c8b5a1010000000000687b12050000000006526a65ac536a66340002000000000252520000000000", "63ac5365526a00", 3, 774081322, 4179206552, "5f9138238fb3f5a918fc4f61d7f975d560538ccdfb40be9502f5e0554c5d74cf"],
+	["25dc7f1a01956105bb1ff163d46ecb063d9e11b025cfcdc44314105ddcd4ec1f69b15acfb0020000000265acffffffff017c3f070400000000026a510000000000", "5263006552", 0, -857234835, 1537743641, "d8065d170552dd2cde60652ab624346a00b48e3907b933dcee7712a39016d6e0"],
+	["0400008085202f89018ba430ef8b2495b563f32f9778b0026e78194ebfb1cc4ffa634c2edd0f0d423703000000000075ac4401f810c30300000000046565005300000000045d810f188a0305000000000478bccbfc4993bec91d62f16f126d5dd024181af0b757adb062adde00a4dd9b4c5e9ba84743651b21200897a52b01d1dc592f69258a812e1d7e9fa32d46b2d3519098b1e519deb6bb29e0dc50a2a007d31b03b4df38b09685453ca8d3e41c681b22d20c4ef05147a1dc14e7e80838523db9955cde4c878b1fc6a12a6c4861e44a7884e50bba5157e0d9d59d36f124972fe4a5c2cb3b79c6e64986c974b6b9495206e8ef0b92d260ca87532fcac6019bb30b45ea20d8e2545a008caf248a4be35b90a4c91415e70df1a892ee2e722af6f1e5c3c16c54558bb5fb33c0f8d5526ef8f29b9d68ad7d900db7de59fbed696ee635ac7861103c7fba58fcba2a43d8b9f6ac118db0cf399b6af2829fb9b9c3e5fa7d244205eb1607e1292bc20382e7c3c1551c03d170414b9959426703e067b27fa4482e133d7a3f4dc570dec0586707013128e11138a2ea603e2c27b7b6de7207000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000cff87e957b647e3014270935add68d0a20448d0a4c335dd723a5d0cf9817c111d6a2841b5c867db6a1ed920d8ff07a4873d4701b922e031a1614ac3b19a4be5f41fa5b21bac9a9ff16b950cedab741a9c93c0136cb119494d063e2f27176ef7b48f4127793dbb87ab6f43467371cb880b388cd8247c5423bed59bb39eae56bddef9a4c7a1dc627443ec5c7766654a1f36bf7054c22ccfc27a1c033b758ff5e7bd07c8d8d8c98911e2ddefc4b9a666d71625ebe66bc1f8291260da2c145f515cb382179f6ca719fffe9b8593944f1bad40e421bcf20e5497832730785f18521806929d11de4fdd21a238ea2e0a1cfff6477424da226023e2e30e4185fdb32e80a6a239078d8d273b521e90eb2838aef0a40ee970531729104e2000c2a32e8a19bff4ce071fca061205a19feed66de9194807af7c4711decb606767c05ae1653583128e11138a2ea603e2c27b7b6de7207000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000a4664648a040bc2a0ce1b9c879215aecc30efe9f3330196111bb6c3fde29c5afcca7487cdf976bf77349701d04e1911e2f135e65a0fd37daac29ff2735a26f198c5a6364a103e8789467321400aab2bca5bd6b98099a4be1f48ec2017544e65bc7e6e676ba398e404227c5956955e5f0fa0e6463067289fbbfb56ad2cb85de8f314a624219dcdf4bb57cb2d7c48f7df59df1a2e670325efc308e330957e6d9ae34b04b40d8664eb3a39819f0398f3ffe02bef371f7800be0f4cb90b70269c19100a025a4c74ed65a9403bc3ad5da8ea1011478a7a1800a4696ba5fed00aef13ea877e097e78a55ac771457a164017cb0723dd5e07cb8dadb9c056736481acc02fe089a162ec9f1574459542daf2bdef93512ffc224fb0e3bdbb4dd25256f73c3c2392b18e8bc1b8368b983e6bdf5d740aee735543eb00f0ed95ad20448fdcebb3128e11138a2ea603e2c27b7b6de72070000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000008acce62377919adcca3d7db137fb2bd54c5afbfa37738086961d8a4ed6a7ea5630e0cc8b551d67ed405b397abe52475b3ae36252080d7b88ffd133502bd6f86f9dc439a48772aa85b6759f75357231d77045c918081ed2c6f77b1519fe1d679fe1d2297c2bad310b27219fc5f56f29780be7b62074286b76dda38256b4533366ad4c6de5d8fbd8743aafc97a685ced7454f829f40b9c350acde2893461359e19f00663440e639a3f39d8f3dfd5ae9a7a4df6ce82ac2d57ce2c99bc5634c39762396c8562e9727e3153798eb05865b046df1d716847858ca8131f2d253fd6ad7fefe31f5507c1eb993338fe86009ef7dca4cfbade6919f380957f82a754ce5ad6dbc8d48628ed88f12206476a71c6e1ae7f4cbec64d528f34ae46a0e5c43f97c2ea6e3f21e13fb3bb1b3d0b385dc1ca3b116dbf42ffa7860a40b0c7bb089eca273128e11138a2ea603e2c27b7b6de7207000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000049268c14f6395e2bfbf49d47c169cf6209827811a99f13b34b4d9f8cc388e0f9110e3fb562b6f352ac58d26787eb86770977718ae940e5f2e5270f97d3823b301b55132dbd115fd1b8110b9237ab792f78747945f9e68a4d57b803f212c44422a1ae2fc2e31aa68d2927f0afa60652dabce27d8948f558fc13ba5b5a7fd70f64befed1ef42ba4ea3207c510a04ff3bd4a92fcdd41d33bbaef3f2c145855d521c3ea2c722e5624101e39933e8d1e925842fccc1517b1b303f8e72b1daa255193308e2b1401455cde6d9ed1fabae04353bc21cb41f5e52d958b562bdb6e99d2e0e77ff070bdbdfa7f013dfcbf9a83724e089c47194a7ae0322bafe29ad6ffeb65f109cac1e595b6eb64a94b00155d08b94c3a9c598d8e9bdea1f93a63c18f0cda7b8d2ff2ccefd030e4ad8540937cfd895c80e560fdac0a36e804e1a2fdee8ef889b17f0afb8599539b9b901837000434b7db5b8fa3983556f0e66a824052c3a1f48e22d5cda38ad34d7967d847b54903f28a7773fbb0aba792c1fd5a73bc7175da15a577ad4584a3cb4fa7c1244b7589bcd6c52827f3e956f844e0d2feb2ba2707760e3ba7f8739b4e214e99cefe074a0a69f62357fe5fddea854901a21fdf54ff4f31211bbe2fc1c78057a61b63b7424c0f2d263526767727724fe3c68058032860b3e43da8e255e3f706bdfbe9bc87a9d27932396298fccfb5d2055a1446b1f5afea78f243f9705104fc1bcacdbc3a13ea063469ddf206e5dd80da84d4dbfee1608b59e23a1271037d3a2f52562e3a81fe2a7634c66746e257a3948d5a392e53af750824692898c1572c7f4182e959d77a205377a5b1ceef0a0b6c56e02784bdb73cf83421723b9e982527d5caede4fda354c45c39a3e9b04152bdf3f03311d78787e9f2791c333814d45ac4c29a539356069227aa4226fe5dc280faf26fdf732033918ba8449346e3282da2582d67d114866d9a8c31eda1244cfe700baa9cb33c8cda9a647a894dac9e800cb4769a9c9a97fa3a0c039bd8c94467891330cb49a47d2570d5b05090b281cd153adc8d06ee5d52524741979432f3f5057c8c312ec1feb10b1f8b44c0cba64feeb086ee224f0bf8de769fabf886c94af8e177c61b8f7d33fe2523253228e5db3e83a721adfa06ad88c50c8a0b832d2ce9bafc25b78b2f182c71a08aacf63f8688ecc980d814922cd1753f5e6fb194d4d29e534e0e2b87409db7c7ace96d2d6caeb9b84c10c7d5a705b6ec4bfb7a92b253046daad59a7bc8a6d1d95648b6ab1f68887cc873c10947d8edac575e64a22f677967f8b8286ae0093bb21d033d1943faf8cdbeadce32a652a00da39f05b2a74912aa055126b91f814b17123c4893b0417743c9de6a0f8a401368128519304294ed515a36116493f3a0bcd59cfade8aa4a49f9a1e1faa1064d5547d783bf403ccabc6f72a46919b8868c7b82ea5c87a67ed427a78b22363e883cefc3bbddd910c8d290502b1c0e834812f119b7f3326c0d9c3018aa060ea54d31cddfdc8e3d2343dad28da6db0618c861b5e23240311ca23c5041e50b26ff1b84b4075c04bfa51392ba7df719bad47f3fd635ffe55a4f1bcf42d4e16572d431788b602127a1fa457225302614bd8eebaa49a05483c224458a5fe2526c3905122b9ed22f6d1a1662f7f6f7c172d216c46db2209f3e032f596a28299d9edb3046a45838fb83040009206ea4992bb70eb7bb74e65389b42e15a6940f5efd2fecbacdb8069ff71545ce78d199a920bc14deeb1f214499e448ed08fc27398964fe2945a88d694badbab37e8b0eb2accbf62807155c024ffec8d88b9f1c56c07c7b908bda54e9b121b28eeeb46a5c27f3b4343a74dbe6c98acb3b147002c9fde89bd4bbddc8c74f1d43b7c3924f5c7135b7350ea1e3c0c7f4d3252682b61c194b7dd76c721db70c2061b4fee593419990daa35678d237c41d7a45459d958b05a1f19fdbfc5cb9a62dca14cdb81225524aabd7b1df437efa689e63458f0e6324fbb7179ac743eac16af6e4c4aa1b31a7dc6140b4dc238f8c16cd73b4b0731560aa4cfb0a996927d91ba6843e55d62ec8537b47fc9e438c8e1420ae30f5b50c7180355787101dbb24383d671c2c066f0776659e36cdaa3f682ef5b93b9c83122a489942c2af2162454879813bd80495a93405ad07a7a6a3b47d6d504fe440e2a39723e75ae4f484e58ed7eb4b763771ca1c38aa4e20aab960a2c680508fc90c2d8fc397c572c3fb2d8c7d1d19ddd362114ec692b35ee0681ef2244f47e44279e0264d9df9d7477c3a55a2d4a7c2c6747acf3fefa291afa57aa76bf7347e8ec2863c7d4f79f5d67b97e301f628d800c8663e34cf6c15d7014eb2f19a35cc62d0c7a3227df60ec0c53890e6a2fd09e95487dd21bc5a42c670c1be4bb40a1ab6395d93d5052a19a08a2ff4824efc72c1f7b3c9a9c4cf2e9d00c254a492244232cdce44da589ae87bf6ee9f7f91d2ec062065ff41b1bf5386673c166761cca38a8c79fdc15484a06af8f5fe74ddac8ced38c73160b3b53f32173f6cb654e53ef793388d178f5539ab505c5d44a054ecc9c70c618526b045063f2be23a0c30a62dda7aaa73b718064c64723b6b7a913cf28e64831b74c06f175b737adca1f55226930a0cac04de0a66592629b28b3d8f2449bfe11402ed93f6db729f29287a9ddd4a354a2cc1f665877a24f0616f87526600cbd73f5d44e3731fdc26db62689f00b210a7ae995cdf1f00925c11801f69a8e565d0ddd96cfad712c0a29a2daf7a5e714a5606f62ce7bf3d210c7c27810286ee927484e0375f2a67703b621e8cd70bcecf39dbd5a8906ed7ac4ea4a86243622e2ad1d5cdc1251f045cd7f1f08ddb59d63a184448f66327c9a3e26ba385f485f804648a2975836fe407767f6287321fcdb4a8ace00b9099b8f776f3a77d43fbd8c583abf598dd4d55bfe6a7baf03097783d56dcd02cafcfa423befd46b77f32af07dee16311829539920456c67f4c40582dc0b99de988a2a8429876eba3b77188a9d876ea5b0bfdedacc0be14d4bf310f64c677aa330442490d5cecad24fc81ee084616288ebe559dc5d87d61ed3e800a8b01c49a9ccbbc8c18c39825d709971418bf0926d6c9540445ca970d8ad8a1956bb227393ca897d874f79accdfc75a548e7711cf76187aeb1f98a38dbe562844fea1c3c3d56855ed6d6a4a7e59f89b6bbf1442150f54a25cb30d66ffb47a15e3dc181a04b48d724e1d5dbc16523d90ecc4598ba591692acfc7e92b7e9283e811975bd176a4c84db6ad5f7ab0939c0104580bb102ab1bf464962edd4ea87fdb9c7ef8e7a03a343b1ce8a617b407e99c9ec0c3cee17dfeaef07af135815a10f3618142dc758fdb948bc055581e6ab0e11dc4408c2ae0fde714852e0a21edfa0317d12c56f18d28337738ceac0ba323a64e32688083088fba27b0f8d228c4bd7e431da3d6b77c988f3012b943139be6c05870cfc4ea6138d9b8d120e93a87f798ff1135968f3e05b1f0390597494a097e12fc4a67dfe7580fe8bbfa708a798205af9ed16d02c9e2672a4bf2e8ea623252838de344bcf5fe9e254b6faba79a8aff48d9cddbd89b69180ef7a22849045584ed5060705133a1adbf38762ecdfe9a496139821841b63a98fd9d378a2b504eeee6c21efb9b0728933e9937093fbd541b3fc13c4727e0fc059fd36c8b68bab002b384d84cff91c0c21102343610845f5d112baf7cea1202e7c4837e313fe6fe669bfc52dc05a017d5273780af1dd0e375a640d52aa484fb12e8fba401b8bdb5270fdb2574f538957eb5ae413ec84c8de7dcd47e6b85e00ac44e5fbbee182ff02dbe6d86e8b060711e884713659df56920816e34aa6007b34db4ab1a3fab553ec707034ec8b67c7f7dc2a2bc98ffc0338544172924427a4d33faeb17e194c55945833af1712e940186f0b88eff5ae00d19183405a754e0392dc54e5bd8b71819d017a0d31e369a2488b987dc914cafcb25d0478724755f4020e5e5fbdcb15ed10852f5164e3c98cc7ead68bd79b5e1e0d6bbe81dd8f62a382da034218e99c12497fb7ad180d5371d9714db0c7a6624999db28e15ea9aa2b84a77f233c0e59d4b7be0d56dae25d92d71015ef5ba65dc639c1087edc19f313608b2b80a68649246e4ef2893edbd769fbd78b27ee74eccf95d996616775bcb3b83fd00981019da3e22cb7fa8d84a9861c20fb55a2f7b79aa0ca66a83c9bbd5812251648a34de933cf82b87f5952ddba56b6ff9502af6e3c459d464cb6b199186a3de3534829117644825888bff13c4933a639a4bb1f50822cf8e42bee2a21cc446b83c10d7bf3c6cbaa7930fd424b3055152959b992826b5546b46261f5711bade47795de3d6342c40e767bada6b050488efcac14c5f6a65811e6993294cf61c019769e070358e8434ffa10ee3996549849c05ca040e5e9c3b0dc1e78bbb9e5202916953219714f00ee529687a46157ed62135442443e654937147f3b5eb13c3e8cab4fd2ee0ccc38ce06c403ada1836a7adeb51b1a2789ff049998abf75c2c724df478fbcdbf3cd54796dc10bb53bfdff2db1983f45872773d2ad399af23b1de6eb22281d8b03f053d08a0e1a90f8dafe188a0372a5c5be35cc7be5d2588fabb7b4c3b21613a7bd86f7247eadaf059a9360d47351fda78ad698767db08707102a42b9681e5888d946d58fb965603058ea37fa9397528f9646a2c85ec036b1902fb8c8383584677f02aad58c7151c0fe1d13668067314d21759f38c9e01fa628208bf8782006f42b4383c3033ac753e5882e962e0042218aa9862862a593137e3fc7231012e1d9eb7094be0a2ec560421ac50b859323ba2c05185b8a525b652b56e2381dfe796fd3776bab91652d63564f69b2230dd5fdaac68980a3449f9565b004dc7f6f3ae8a996513d6a6954a599946b16be4ecbfb3b3bcf6d1c014518eb34ae7abb77d7b82eb24c38a98ac3cacc1e4c645a640de46b2c092146711f37ce082079cc6c6a7ac828ac8724f6b41d437c6a8ca2a76c7ab4b981c980364a3d53febac81c47b6f6e899a767cd51461e263d8c75daa1fccf10d5eb4b28b1602e2b6c33591d8452b8f804901e88a3da485f1decc12f0bdb08d096c1dcef9155aa511479d6d5aa241318024c98868d5f3150512b619687c3b77b6727fe25af244b5a5cd6f6611af065650bc263188e0ecc29d99ed8e430fc53928f1b2c991dfd7ee72ff33e4845bd20779e2db472ef0c50aa3b91311b49aefa8ca0a31ba32af7973c7c20c2c21f128a4df88ad9f3dbb6d86538e7def44d76a5eb1b6eab1a00562999c4ee8f486189726d433daa76c1c7ab897a4e227d353867e5cf70000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "acac5165515353", 0, 1108358069, 733220448, "22492644183864de11c03f4217e75ba5c7822a8d6d08f6be4ff21118c91a8844"],
+	["030000807082c4030315bac40f067fe920f5dbdaa1f1e6c4d36b0d4e95b2b4a8073464456014d2ba1f0000000006650000ac52632340beb608d3aece3b527611fec58d53f5d354b3e530d4af981f2eb8ac5c5b6caaec42f80300000004ac63650084fe09c35a57a57e233274da85271e15499fc1dececea6b7ec875494935f7f171fcef4e70200000007526a6aacac006519538dc201fff5f501000000000363525200000000a2fed80500", "00006365536a520051", 0, -290543487, 3925833126, "6711aefc287ce9cfa4e3dbadd70a06251256081b7d3f0b0d9935af3ae94909d2"],
+	["a1f0e57203868535fb63f748e72b911f518055eb513c6ff7716a364db348a6395d3d3b3b4e0000000007ac636365526a6ab89f61ab6856c631303706b8020dcb08ebd45cabc58199e624182373bcfe6e6e3d17e80b02000000060065526aac52ffffffff4563460b1da2cddee35d9c42546debbc5d6e66b39aa08038009a6b734faf4dcc0100000001aca6cd0f62025ce9f8000000000004006a53005e4abc0300000000066a5151ac51000000000000", "63", 1, -509899676, 733220448, "d2d0c68fedb5524f6fa2751e4786dbc2b206201a7b7b75f36e5120a92a288fd1"],
+	["0400008085202f8903cbae58262608135e0ba192d76fe71843c7bdc8b3c7cc82b277c1dd39f0868638010000000363ac5224880ce9226c3bffda138b7697b49c184a492030615ce169c698eb28e5e49831a051e19303000000066300ac6a5263ffffffffba178f4b66cb1f4d78b0ba5b663b2a1b5cce8053c08326a15310908c25a4d7230000000005635253006a3c00414b02362bf8030000000005acac516a65e7f2f6030000000009516a51525100ac53630000000000000000b6489c000000000001b961bdd0edf07f1125aab4877b3c44eb81333e7d05ecee62d3deacb9366fd40da79c6d4b73c39beee0279c76206bef13f729599f415f73be89a8e2e2beb2c236529b91b21e4666569bba1efbd5fa89187b287da6ee264a38454a0f258a63726a3ca0e2186d1fb5d1a13cffdc19d666e69b1aa71364f9d901d5a198add8c5a419fe91bd412252bd19ddaae764f5e596d9e6bc0bed5b96201af1d1c785730bc01b4738bbbed495b2171a854a0bf94c2be909357cca03105dad162823c8bca9fb221df01c24c3ceda20c79bd253fdca7b9e4adec296670717fc6f00378f4fbafd22c818e0bf10b19bd6b1904c9fae869d5d09e5bf5a1b3a7ab58c7924cd0058057c6732e274f798022e39822ef6a4de773b767e3d5113878c1dabc55aeae68186e3964325371e47f1241e9797e8de99925cf2a97018dfed03553b94d28360d2a7e4140ccae362639a83fdc691d3eca64d02000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000026bf29a6d1f6e463f918425a7a66aba2ac2b9f42f237f4fd9769a31db7da3b95e3e4904938776ea73cbe5bc4e26fc731f564dd981ad50077e9261453d570f4c354a69c1c7d1e0ae2b9171a46c2dfc7b96d7aaf8dee000f95324a40c83994e68d4a131ca4077dd5d2469e1bc430f6787d80b827150706c2216554c9bf18dab628187c760b37af1b094659a76d075f3d8dead73fdf062b297c36a5ee83204764d66c9934c30cf7a6f2953642d84c9d8a3fa56ce1956db4fcc7bafea6dcf0a7922c923045fe66fe7a20d14a4a1bf1da5ad627e23a0511ac541e33d9a36b916fc791deb988881abd915b7d0382551bb306afffde5223012cc150ce7379102191d5e2ce1f246d5318254f604bc92b904344fbc816dbc180703197326814c27ec880a998b28802cdcf7263607b398bc424589dd305e43480e3721ad306abebcd77e923596df56f2378ad0e38ba6cb13b08d83a683f3c14f7466a55978a9ca5b58440f28067c396a7bd411992959746ce6af01a6e667166d09dd915c8c4fd49a8e7df4db38104754eea93119bbb2110ed41ae0083312d1d83d7db47c9fd33d6c894cce9d023d3cea6c804c69559959dc27b4d0533d153d8e022de9d417745ddeeb328680a9d9840c0eba105c4464d2d1e8f3354ff10283e7ca9cb066649303150b7cb71ce13bdf1f4b343caa36fd1660d0fd54476b628a62e88dcd23eeb6a5d780014bb4094e3e1a3f56d1beb855805a25c5341164f04e74f7f39ea2315c7d036a513ba54e1a63dc9b645adf0e5f4aa76008e74e6cda9f87f2da8c6d1b1acb9460d0f893ea73cd3526897aee20381404c28f54e52661eb3a599c221a19367225906cd5ee63da8b30a652b79741d2e4bce4b0f8f7bf7e7daedf2f43d731d346f27c9f7b979d6d69b05bf682401acef077e6c55a5544362269cabf8be3fb55bd498f2bd7ccf2409e68c7e8f5b5e19a4f1de3bfb5d46c2f1a6fd4be5723eab1802aeac57030abd21b68428f819991acd59685819cef1db7c957c6b5fc4a8b36ae762ce99b18c4a5fbc156856ecb9c39d04184dcd6a4886bd2e01fe72a110bfca2d3b784c32a489f2d92103abb2a3aa1e293e0297616a98657253a119a04fd05a4b75bdb01983b1af9e27e50b5bae59878d10a3cee4ccdd748b601ff6323331b9aabbf9092f49d1997a5777b8b0898a911f4d7a1c834aa04275ab6a97903b90165065f8ef0e908df62d8f2a1421977a2d5aab4def1ed801d864612264fc9c4bbe0daca690ba6b6a65198c161f0211f659b80c7a6d32985df6dc2378e8e84bde7aa17a7ced50e83aa0da92dcb8fcf00aa63b76f735d5ee152f00ceef2d14c5f7beeff1e1a95483967d2cca0d8c250b4effd8a176044df6ee8c8ea9f86b204ed5b8a140a310f5d66b626f8ce6a205c76475fd39fc736cc12a37c1495e9a1b27bfbff75f8a2396aa26fb8659b1a2662c2eceaadeeb36b70b6569317afd7e40b2f78f35c1070f9c3535486c9f68dcc95239306660bf88d9659f38f548b38768db947e52dd1d24ee04e01a897813c5884d3abcfceeb58e127376287c3b69bf6aafa587584e1a25c00063f6502bbb4b483ea4edc78a145018418fe16e624ec68a24d01045becca3a64c9e16ab00fd4b62b6f45588c5e9097cfe856d8d9b3a50898d98411addcd8314f03fb01d5830c524224e6a2c89e383e27236c54157fe3bf1c9ce9947243cb1bdcea6b8cce8ab2795c19a22bf8e991a8854f142a5c61d64699f7f353b51df39d09387b1c7ddaa9947336a5333b4da33181a60bbeb9a9211452adcbc32b3dac9dbe718e13018e18fa1a0f096a63b97b75a29f622de307d3fa2f8e7e8783d202609d88a29ac7950b4341472ee08d7857c5f0d3ea7e2e2290646247c8698414c862ffd60b53e6ce748e42358bd80799d9fb0637ae9ce7c59ffb2bab526b49a2a1c0805cbec1c7454037387b0fadbdc48312c12673d304609c6e45a5ff29080c200c3411571c4211ddc343b1ae51ed076a02d23b84bd76744abd1e127491f90bc6b0e79072568dd55871c3e3cc73cf9fbe399050906e78bf80576ee28dcde39a257441e0f03d1b4cdb1264c86ef99d4adfb896dc090f69f2a4ec2e3092e0570e458efb634a0535f6718f3bbc948b0ba9a1cb13241726776b77c21bf2fa29d29d6f21c9f8cfbe5352904202435c3a8555c4804ffc488cec6ff148ac9762662d1a5bf5abf3d428be4456c250c8b5b32fd66e2c3d909457d41c8da52368ef0a1a99795c7ef13229d6fb9b7a15c5d0831d537ef80a58633d384bc589882a73bea794a2829a4e55541f4dfa159cc9b610fc077562e4f0c7a68681802924dd6b250ba9a5c2be085e26c1b42742c1f49112ab2559cd3fcad436fc074f492aacbee2d3a05e75c8e8b6bd6ded649bd16fcda311ab448f2b2ca96ac7ca857f7f9ed3266cf57d9f2332e0e4e78c51c3395d11532df838d054dad047216e4563f82ba8af69d0988623ad3a85d0f2b2831ff51bf70eb664c1d225fe2d4d6bfbf922a50127f3686679ece28319fbaf16454cc169a9f9e86b1e96550adad23b62bd54410ae8cc7b1c6ecf3c6e5300b5666e7d8e6bae5a4056b85cbb4ee55e6b3ee562378bc436cb204f20999d03dbbea88f481101a3f5a48475c73fa523a4d64dd41b27b2f4a6bd15ad5ee11176d4fafd997e02b783a1040000000000000000000000007ae13dccc44269a543e4c7e17871d3317af643df2fdbf597c4ce2dc291bd33fbbb38f456d917f41f9e4634d56d44936b9fb0cfc5f02e19e416de89fcccc0bfcb56eefce3a1d96c3259777c6446d54f58e65623d2c82a3745265cad45e9f0c2bc0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000028b3c28f539f0739286dcdacac278f9a5133f3d0501f80a9e7db88bbb27f49b0972acb479cfe8b8a13ce60b33c38455fcf2712550e644cd5b20e1a00fa6a9efc7a15ff1cbb90d415ce0f9cd77969babf3ac17eb3b4dd8b1a5cac27a22e4fbf1b9a39b6810ba064d700a3bb45724dfbf2a4943ca54d5d3694e8847253c1cdfe2c4d63bff2490763598f9c86eedbebc577eefa12820944b21f3feeaa58748ad6adf289d5bff60adcd839c502ac4b60b90c86bd7e14f14086b52ab05d74b47ba1e299eb09eafe454e2d462510d250ba1f36d1341b1a5b6aa7fa7aa35b5936fc3656585cb2136f2ec8fbb865760cc71db3c5e61001b5bfcd92abc09ee3987e00d68e25aa47ed00441499045ff32c1b9e67a9b6e083d6c6e8dfd018e560da580ea1f79c0571fb0ac54d8aa3e0a88b4d60776e233e9e556c84f0d86027801b7da4174ffed59b9e745ac2e3929bc6c610cc8bbbc0c6856be8604deb906705068de02900af995eaf71605e8d4a8ecef267dff817c2b2183190be8fdb6b28480f4ad62d9bfea66971b8c2d5f7e47e8922665c4a36561600f5f4069675b3e2c79fad4f5850335c18910b2451c6eb2507f75e070309146bc2c54f75ad2acfe240a23eac9e8528abd83d985647524f9fb615866bc2bf2a076026bece009e1d36b1d301b226ab7bbd0b4711c5260b122352f87c58a1e17cc1c1478a90a5d7afa60e76afe1bc10b5742d46f7d0ebcb34cc3d97225149d22ef76f76b64b6dccd43db7fc0af7e4742bd635e10c802f75d5f654ce7784f9aec987b5d80e9ed6537a59b63799175537fab49dd0996a760e1b890415ad996e1e8192afea500ed8c6ae20f2e2b6bc24a48008c337fbe794e34ca2db443327a4ad8439b622fee48cf8bcd2d3fe2ccecba7453b58fc97de0f98ba7e3a9cc73bf27262e0c45b70eab8e94ee5f5ae9b3e43603fd0659bb5e0ff86e65b8ee5c1769d4fbe8d7eb563499d94f534ed5372e95c4f815fe3115791276f3e93cb901c185f4c9a8824202622078271fa2b1249de7c7bce3e489238d762cf78b47538f9330ce3a337eadfa50041c9ee961a78fea7a794668fef33739f9815d6b693f8fb698970dfa8592b3c5ab5020de404aa4a8296631f874977c1720ec5e42119f132db62c6eda3d3cd1959c2e62535393359478a2c222be999dc4649eaab51ae354577d6f9df17bce83a8f26bcf2b698b2a46b4a827abe61aeb68a15621ed45d2b885b2f637540da9057167f75ba693ea9c0151256f090ec1898ff489595298e2032083e2b1210a8268946626b8a47d37fe5d51d5959c3f16c4c7fafe944ede103045057aa87c54b9a4a713ea9e2b7f1ee41a3463b9c567c85f9cfc168b6f6d5c5377d1a1d113e4b52ca81e9dd7fd4fd10dae5038572c678a2a9b9f4db01dfd44533261f2065e156973312fbe6c652e99e98827fb1322421c3e98eab807d8d0f9ade7e589c5a5b358dd9c2df7f81970e533fe81c01374c0f3bd420e46af3fb2e072914087e69cc14aeca26ad27631e8ccac64ecb41249e5000d9950f02bd3e4bebe7aa5cbbe6a357462d181963fbc72a718f55c870f106b07dcff31bd045ae1c361143170a1d80ba9a7840c5def0c54c174ba2fed14e81dd3eae3a61c195d075bae1697632d6cdf3e497f07be83e98092c386f6458b87dbc87e0181a41e2cca84ba11654db4f603ef773ce417de78bbea5bd0cf9c25d856bb718fa36d6240f1dceda1cd946d1ad1b0c59eb4c786dc6b45f046f7b3765ba2fdda746d768d6486a6aa9adb7f2ffb77ee092a1a09eb3574ca4f19fda677f14987c5e4b3d1890e6f2ed15bab9d73fc285abb8be1620abd5700b1afec9452accb603aa432c022465a92c15d3eb77a8513629b23ce96c2044b69f3d511450c0fa49a482babbcf0976fb91970d6d8a9c173f54168bfe603ffc0fc317525975ec80796b76471fff1b8d826fd445f6ef79ca1cc56a77f46defcf56cc0622f088040f112b020c19202613df53f39c7f508007c2691d7aece9be206bfacdae295ddc7ab69bf5d094351628cbce01457a4501d248356d02ecfc23cc33331653b557b7f7037193cfbad55376f37f092d88a433174406cc36482e7d87705725a2a0759f3b5afa10639cef2cb56b4b9242c87c275b0000000000000000f1a4c80500000000fd40bc780a15e4189cb11143ae964d2c788c909ccd19685dcfcb3d4f040ff853a7daa6dff065fc49f5116bbdb37b49571c18ffca198fcca0df2dcc2b263a8c3772e619db11051cd333e182f19f462af0ce9a5867e0d3029a6837bb4fe82431df00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000115bc6c4da80685f11ac67b6cbf5595e435882fa611205d5b71d2169d0e6312c114e52318ed475336e3ea422ac8b819cde734c0ae102dc9405af12d8f3f25b3ded3a260d4d19d1bbf00aa7f46c2f55752f3d5e96464ed8381d92fd108772829e7605d036f323601f117596eecbf1f479c9bc6a2971ca17ab57bbb9a2179e77a239a3fa74ef259e0413a96d4d61e2f6999edfbd929dbbae203263acea1310ba798acb85958d16da7dcec90af4c9b4c57de040bfced836e2acf4a10c1d185bb995ea786eb91053e126eca09ab4a51486244f8e4c850ce02cbf4383e486001e1642e1872519662d020e3af5a302a565a474a823e79e546f6a7082b5402e3063f8af0bce2349b0aadc6582d56d825e2d07294f4e756286768280ab8129b74178657a4d8c950e1d5904a882dbc3184b2ad7b906bb2c84fc3e8ddd24939572fe5542d5d2254db05464a6afbe125f90a0bf707f61205c9c57ff971e0dca9899ebe6734aba864f74f7b1ed369085236df1ae9a317357de337ff57e44ad8300a141eaf607447acca164ce9e61f8b45c3238ae65226d0983c8cd64c05d08ccd5f325319aeea1e1efc8dbfb24b31307b3d3eb0c39fe0f3b73550e7086e7701cda2c69113d8c76e51921e3aa0df80ab278d24b3fced808be5b4c5f02faf98e48af924113b0a8108a83049be003f74b20613188836a244d9e0761e33e688039c0cfd79fd4e46f7942bfbbeb41222b2eb3d68e68f8e16cee2e405a10bd309e055199c20d56ea8bed0a72ca99dc4dfb0fc7f2a1c99ffddc87a3e96cdb7dbb83be47dd0953da6c3c9fe81670ab412942ae06897be99621e66b67c5f914b43e095d7ed3c741113ec9e4c98af7729fc9cd56712b2d34a83386293d9271c6ee13707f4d61d92d0b1ec228d9ceed0a77adc6aac9f5dc77cfb18355258391413cadb448a6b74b665a28f13ccf607780b45c3d3a44397120e26137203f306995ceaf644e3b6e1a174f2e3fc7b462e3940eaf2cf9c2d5a6501693e3a742043de16e67f7dc2a94110a8b1c99a59ff978881157ef80c85484ac2e3ca90c9c4fa37d5ae09c4349f5f3edca9c9c541998c391f64f9561a37aedddbdd58c3a553c23c5ca9f9df0166bf39998e446baf98d42b4810f7e539f1d9df71f22dc05a2ab72b4e540b9da64d003b383b1983ca2858ba676f24baec52c8e90d3533d9b2fdc2f9b4290872a95b353bd4ecca6d7fcc06e1ea28c22d5981338a2f22887ac00175053b9a5da5ad790688a7bae695c1def808885094c14ed1eabf4e52b753ef5025223c90a4f06b4fa7958b8c61fb2e3a0c6a253d956aa353e2effab792c072e08c009fc991cc2daf22202e9e7ad85a4126a987ba089989750d999a557672d9f8b952e996732478dc4e84f30932bbf0f4f84cb96480ba9a2ddd90cbb3eda1ec480bc6e65a73c00b7e2cbe38ca688939b326fb0e5cc9cdc87b388737d5c4be321f53a8452c29903ccff365a1ef2b6d3500470bd356dd04c00dcf3ce26b2fac4b50df7a8c957b2d7c666ec8aad55c689c067e3de88e66207f521fa81c148214dda862e87a17d30f755a2fca822d364a4b7aa872e14d2f7ff102edd5bc7883100c70b1cdc8f2b5a6a2e8995d78f7e592e35c98ea1ab105b9407c6f143b832e4da9e134c39cadc76434430a56ee939902d4edb7f0e312fe99b8f774281abbaebb66e3e5c47b209f7749e5d8e40c7b861a8da416915c64fc5e0c8efb8cad3e894d360db088fcc12882d00bf93cfef908480f4bbcc9bc28be5fd1efb9a43bf49b3a1f2ad3510d65a64e69cec564c5a7e747c7def52996a63e06c76ac4c7cb8a33a1b7eebc312e85f0e29f9096a63f1b6fa5e7e256bcbabb7c2e4df249ba02b2aa5a114375f2d0e1b3d4ec1ea99711b9781bfa9f835a4a95e883e0b6f6d9aae7f6329b66bc27cf0f8a84b8557c536b9d812ebdf38ae668a40fa2042655613d48c65ac5d9bcdf7d17711c523a8acc8ab40399f0e8caaee240966c3cca704e9ec46a06b274251e52a6c60e6d2e41c34d76adecb18f1f8dbc73ce85e0f0c151508da93e4115718f7ab0a3ff3353c76b9f4c660e1f983bf77e517b22ef4bd96ab62ffc2efbcfdb9c1dad168be6ed50f23525df882d06bd3108552f2a6e1dcf68e2551e7e885e5b05789f598e3429b4d37ba5e90e257e75791db7e4805238f6d251a5c45dd622728b333480792101917b8e99af3b3956304c8bc763f426e6cdd35a848753fb046a462a536ba5ae0562dd6e2ca93141cc452a59c03eb8dcd11cf27da23c2590700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "00ac6a516365655351", 1, -811551679, 0, "0d2d5868c9a5b4a3fda058e47c869fd3d1d79802b87752030651fc286020de44"],
+	["030000807082c4030201dca99c819f73344514b8b2c457daf041217fc4fbca3ffafdeb724e28dcba6703000000036553525c798cace6559b8ff27577da5b7af37307fb2951f7b688f28235623959731467b841fc7b010000000800635300516aac00e1387b4d013f4a85000000000007526a0053005263df3118b40000000000", "", 1, 330646265, 4179206552, "03214b13daeca0e8afea6d55ab3b6e0ecfe0515e0d5d378dbd138059e32873c5"],
+	["030000807082c403023840e94cb4beadbd76193556539257da2101af21bd8abca73d58b7752172500f00000000046a5363630d544be10c9f631b0ad46a4a01268155d46d004bca40e276d2346047612179ba61adf6100300000006536351636552ffffffff0107b5d5050000000002650035f9999677db5d0f00", "6a5300006a", 1, -1706212067, 733220448, "a2fa4f83e843a85b9cc9c228c799417903dd13dbf0ddb9464c9f5a546a9ace8e"],
+	["b93234700229f29768720efa4354263d5b9235d80b525d111f627e86386505dcc6c722fc930100000005636a6aac00ffffffff08544f5587be8b8e1ed6cbc9ed681a44a5cb772def4881bd40f9322f03cd11ae0000000007ac52acac0053650e57932a049f89a405000000000600ac5153ac65d44a33030000000003ac0051605d62010000000007ac535351636a528f889e05000000000851ac63006a6a00520000000000", "65635353", 0, 263488105, 0, "20d89287106ec00c63203295b167d51f019002c2212cc251962aa3585a7d8d42"],
+	["0400008085202f8902fb8c69965e5ec6b21c9c9fc76474ca78998b1f657b7287be9ebbb17ab2264a23020000000900526a6551ac51ac65941f45491932dadfa6294308e8679cdead13d7d3f01fd63befc9a4fcab6b230288d1cebe000000000552005265ac7d8d736101f6031a000000000006525252005100a17211424a5f0704111d2f0400000000031570ac6ad9ceef34495c67da1eb907c043ec4a97da140f0b0143a71e0c27f21674010914b2d1c4e8cef1c8d9ad1ad9d901818e4a434d63b6eeed79663a58561094101367b55695b5fb0cc161edce33f4246e8e423dd94eb1db6f507997916531d2166fc03563fb2e51c57145fb8dae5227b40739869d958b936a0a65f7e0ee3bc6166aed69fa1577c7bc8ba0b1be0d90454dd9869b9c8bc70ad89cb0c10974b12df7cb375aac6f929ca3cbd4517bd8449f6c8b74ddcf58978a133dccc3c0198c316ef3a0e777e5aeffd21a3b3ecd373c22ef7807bc369047baa8214c9327382518ef09d0ade18a6ecddb8b3e0ffb81c6dd14f7d333147eb933a90f66f915af8cd95b98826683a71682440361a602c630a0453b48e1e8c80a4655a1f99609066eb5cfaa027923b780c80de073daa50715d39f9280f45746ab7d2b8c77b4695ad4c452a59c03eb8dcd11cf27da23c259070000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004b353de200b3544126b4044e964ea0f0ca5d846bea284d11c645ece95a48e93e1dc0bd9f3eacc931f6178e35e1c363f4cee019817e0ab2c5876e69c24a3c6915d66e13e6a1d548a53817622ca4e2250f0fef20b1ae0e1dc89c7fac0c80306fca6eecd56e8223082fb7c6cfa0f70b62db29003815224161a4097cf391697737ee87b66544a61c9ed1118419488f479ed94770d64c10e2f91fa61d463589ca08050f2424eff41166d231019b8def0777da2b06c6df0d8b2b174c1babd1cac3cff83b38010948406f0842923bc619acbf497a46c4dfe626d1c1affad528e6ee3873d193e6d8bf722de9ff4ded159f643830af2e46b0924484fe04d71fa41efb4a4fe3cbd61ccbdda0652be1db5e8d614ecad91713b525d7d7ffc95a98d076732b2f463690778cb08a5b24508771ea6175f4281a50671503d114d4507da4843708dcc452a59c03eb8dcd11cf27da23c25907000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000441343dd1ceeb234978f28e9737d657cd298a2d92336c84c6e54efdcd8f548dc9d670785226e277861c12ae26ed39c9baf24e18c53275f9952ee932bba43b5618ab18f54f3a46d6971e87d53c0823e83320ddd91f0f87c6a346b5ae3b536f591600ab247f58618f4f1c2daa99f1b5b5de60b7d6e66b6381e8f0d49e198da2247b1663a0442d49cce6a9e446714779c4f6c4239d77b8ebef7af60b7185a2ddbef28aa8b5ced4d3a204411171d85100d4fd999feec611563caa6baac6601a5bfe728767b5280a55f382964e35d57c4187e45988ba5d0de9aeb10259c9354f5bf83c4c883c3ebfe5529d793f06d5f29db421a07cdc979c3c3932a25b4ea3831e355cce474009550c1fb9c7416a588afaf9372355f16528d002ecb5cf02be85793245bc01899326751be7dc3d42ace0abf9d54dfbeb27dc3e00ee4aa50be34abbbf4c452a59c03eb8dcd11cf27da23c2590700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003e0f4b947d4e654c47523c1f58382c11ba43a2a8fb5dcbaf25be50e76e1a7f569a0da4ab32741084ee9482f1e199e9fd2ce76cadfcea383295ae7a971aa251a13a10951a58345f654de25303b326f1e18f9d4ec09175b4aaac33dd0576b7b8702ba8ed354a1c52f06d0115ebf94d81bb0e41f62ddbd31f67d841909c27b0b979bad51049cd377e632757a80bc8588d55bb0b7d0deb956b5518787ba02d25b461f792d55f4b2e3281510940e59d811f4724602f5a28537559684bfea5e15f364eefe9d89eacddf207b4e3c7b22ab1ef5664d6ed14300802431e0247c765253ba8b95ed789c65924a99c808030449caf1803cb911f0b5e7d1c7fb30eaff421dde4bd0e268c7a83aa7eecb537f5b3cbc5b574bf8a30f2db40da7a934a5ea3936c8e05f2d6112d1da8a598cd433aeec6ac88718955b2829281725e34c98979dd104f59f63cfe10e0798f1e747d95b6657310939a1c71d9f9d307373fc606b0b4e86939d74becde98c2a24e085c229b4751e894d8b8df3177ca3fca41ddb76842e5cfa1868e8fca1032d0830b1b2b02af1b164f5c86ad279f96d2a5299eb39da9ce7af3cf6f313620358b1142eff9e5cf7295492a113d9d057a8a37dc5ece5d00e2db4a24644ec7c98dcab023471db2e1adb73a563ed6bd7f83852d2312fb83c49aa1ee5e0bee24ed3c69c7b8cd5a1d15220fffca1f5c35d6be43f908b7ace755431ad73accd363265acc3b478cf9fa2d2d561c824ce2cd76080ef5e8920726f97b16bf3935706b2e50cc0549f267fb81521c71b69975b9e21fc89faf1b9e6cae6103941dc8cee60a9f26b8db596f1dccca00b6972bc81a9e9b02f8ab1ba50a864c3442155b01b34fae61cc008d94cb52d8d953af9f2f672c7eeca41657b9d04289fff80d2eb7d764fe2d7c577433d95dfe4e25873a28f676e3f2c2c70e8049388e4e340d252725009669ebe662307a80cb286c791d918fc529b5fd258d83f9107c30ba52dcffc2edcd4603d78a2c74027794fc292a19f88c8b51be7078385f8379d620979f03b4936e5cb1404b914008aac568179940c4707d7ad7a27b3da269ab35d66d478eee3723178cdc803f3b36306edd2f8c17213beb80bb2f60dc03f65bd811926d6f6c810075540d5153a569cddd46e6e20b1aaf3412af71d647b4d3477a7e114ccaa47073b78829e4f23008c1f17c4c18c861df0780844492f2f23e669718df0560f774c83511327527c323fbc7d11994d1e53e104f3294b12b1c38c4288df26ea2912b40f92849d3d355bb67d91efde23ed7cc9cb976c57003980c564bf0362bc92f61d60f1f9da4e0e6350be597c94d41792724436e0b2809a307d676f69135ec20f3a4fa6ab42ada2dc37481b2521ed95cf76c9506c598a9e49f0e5b3b66f9a156c02edf4b0e347375ab1ab1789f08f2c5ec6a0174be53d2c95c5fae993f874d0022c2576e21b0e313db7db91f03f51577a9e80a91f113257a37aa52cf986c72811a149fca2ae84f0b0da821c06da27c9dc2afb0715603a648e926d4ed99450542f42ddb43fc4ffcb226ce9aaad928ce5a2fc70c05139518c0a97c638a73233f4c6126ed6bb00a9a001d556e7f8bc62e2b0179196815afa2c6ecfc43e9f4c41ce0fd3308af3c6b20ecacc414d269892d68f31aa74d650fd6f55d0df5afbf44a7f09bb5981ed2a203ed2e95667ed968c8a7e1eb4aeb419ae95a0bc01eccd59e18a595a3a5581cd9639fca2f85f22817125583bfe8f81bd3697a1e1c9a83fdee8ba0393aa6a20c9a85d1da1c4003596cc907f3ea4a7b1e94f282c5d4846182e56b8f9e3df093b3ff8ad115200a65891ce403b9080bc682472d33e47449591a74501ab1a8a33e6b33caa3b223f925a9131ea0023642c3a0bc18f143f783a37e384818a1d30d23cdc3c67870d0c7dc4834dc87cda7df4b41413d8301e53e85066e826032b164492f0eb8ab0fa074a23829163ba08b8c5a5b9d59a5af92a5395e49c0f17b8c074c8fe408eb570bd2e5fadd0fa74cf87677f19cbbf0146ae6bb0f0e1b65bd687ee0b72925f56cd4aeda53ce001f33e8154fea40b595e106bb43b71b04d323ee4a9adccab7794f4fc896da263dd5ef4bd4954c4036dd72cb55183a427f1d8c13e0710e9eaabf67a1a68c0ac3ff95c0d1e7a37d70ba7d3da4babba91b15912971ddf4d3ade1448dc8f0ddd79d8a2f0f1c1d6cb000c3bc07c9fd5c595fb0ef26017c532086fd877c59c4a5634ce101809f23d4459a1956a7d4524b2fb4248d27b37da297242b6bdde6edca9c2e5a25352ba8edda14abb0000cbdec8a21ed7074ae38347896546f91002b94390ac4783be170b53b41f5aee6938cfa71ac8bbc1e0337253382d10ffd77c646de8ea425aab8e90ccb73d42edccd8fbfe825d9ee651fb1003e5aa6ff5379d7dc62d7dba18308174d4d700d04f6cf22dad05a3129e32b10f38e97f8e58ed4d4714e356d25e17a649c220056a98b58ab35d28e5670f1307bce04e1fe72ffac6ee666a48f0c839a52f685d7b839e47616945d7e54284314bcc94c77d06b5f0dc718cd2609c7a1ee6224bbde8174d22979b928df8371a1a7948a1e4eff3919687b67ee7ad6a074d5f8cb28032f9e8ed6b6a41786daa4f59714bb65914a1609f9ec8c80869d2b61ad6cda2dbbf574c7c885abdeda916c0d6192722185477a28482e64fa7dea9738ecd3871ad895b0b34f5e63b96f9ff05026c580a05f1aa7682cf47a0687f42a398c9355040f7f9d466adb920b721dd380572351fd9e6ca6881eaaaad4aaf656202191b5a98333866944ff5a78766ae48223f2366c1b23c9b1aaed612da9be2c2bf445f7568bc24a5e416665fc39cc87939a7feb6d47c9084c18000459f9594d0279d97b41a41f092b30ae6786cab08b8c720a41922229f0fac60a3e466b05f19a42505fe55576966212582456a32060b08e9815e2cb01494f393f8855e7f3fc0c9b1383e80a3d06f9444fd9a961263136a4ed42dd876ea5b99bc253485a1eebf11cd5d0e2b346d8470a9a9d6ebe7b2d95b27d160250d0382c4c2895f5e8d6379b4e8b61d9b275c97f7397b03fddebe4ace7c4eefa209bf09f7b0622eb9d7b8e2650ab84c639b17c40b5bbeeca873823349f3a6a5b8174af53f91002affac8331be45c7a6b057989d8fd33b0833fd728866246c901a12be1187a87f00e0d9210893db8adece0f301f971a48a198475e8c45890c2ed8215aedb4bd1303ab4555d95cb72c146b51552336a48933f3b1e04a694e20b584ed234ca3d832dbb9271609e5254e5f55967cbc3717093074b002d8e7c719e8619ebeabe238a5320d10a292b543ad2144a2b99a9cea7355ba15a942aba499cd88b83985e97f601f8c1aaa361105bd16bb8db8e3987f852a3f2d800e6d28eb9025bf7dee19e115c6b5f5488684de3f17c77651355150b93c9321bad854c1d0f45683100315ceeec88a950373c3daaa48870f104ccaef0b48bc9b098f642dfef528851e10c26343c2e6ebeb872f80eb647b977a5aa1018fc1093be20c7ae95137479d602c945cbdbea2248a3850802ebf26cd7200c1d43d8236a1b9d3d60e0fbd6661c00313145e586d10e36db144a2c7eb2dcbe327dfb82b96603447bc13f43333fbb8cad129fb594e1e5b1e46ca3069c5713ec4d7613f06603cbc9ed85129125f3caa26054da116f465dab00e12927bb57e252ce64edfb6b62763ff6278ab52041552c805c60f7a340dc3b30cc658663bf59e1c0567d9b6be98e166f07e101bcf59d3bf09642f589f12896346c05dcada285a79379dfbad4b2d464a80e2ba15efe656ebee9aee5d8b3015d728c77244677a7ac5216a3bd5b661824d96dd99252163718dd487833d30d821c71c7f43f019509c8c31bc0852142b97d794b5744c642b4409dce2dd628d1a45472a8c9fa014c8f39369e88426bb6de92df3026aa0fed3dff711b8d9cb409c5347bc83872f1ff5647b77ae3c59c0916be84f921f2d8add5e93c8fba4110b057e05032c043780b16b02ac6df30500000000000000000000000007b8189731dc37a14487b8c0f7456a4d7f6003284386385945e79a28f428c614f3c4c0794ac5c0d47ead40d3f0eb25c0cd8adf289c1480248334610f704087c58992275784d6af9e66bf3d8bfdcbaf57e5af89c28d0f17e5af4917dc2e41d57900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000e2869061a7016e8e78a5970cfb4a5e7deeea3119824766dc65c73f7d1486ca579df25e076220b5e608d29703b67f879d23d4704a64d958c28b37968a0e89d909947361ed31e01a36126f40813f11d17be0fcaa427f7201c1f9b956f1df0ed1ff30a3a163ca26b74b6347bf3aef2c7bb1ef1dad627d6b8c7e55b3c13704aefa08eb607a41f9d5d4d7c2609f9a1a2565b198f7226fa3f2c063bf06be7c21f28e38e443a170c855c4e98090135fc3c87091f6512e6039fc184ebbbdd837cc9db1f61c6c4c5a468d89d13a560029a8604e822cdb9c70bec10a15f177fb78e77ee4e294667afb55df68e2c15d981bdeef644a8b9227b4ff52e9926abedffb829f0ce66c0aafd724899f3e7c73d4e9f79c83cc84ad396fddceaea861e98d2b1a4923728a038624de64d4e75271a7e30d43a2fe482458f08d8e6200f05381673800b40095234f72105a847184e7a90609bcc35f3fe53f36dff63ba42361ad1a7cad612d1721571947fa53d7de4385ec2f718fbe48163ed9268c613a4f7627360338cac7a10c08719ccbe756c6f9bc679a174a93e21922817da02ca728e3f103daf7015424500651176d561c16962563b5d555aa93783f413d33864e99c144e8b3d767f592ca0be53d6edaced1d9c590384111e52ec3e2f5d83b2ed7df151cc23bae283d1ad1dc4bb3059f024d96b01ffc727760079d850d5cc7afa58bf3aad4a5abd5b0ddb2b79bf9bc0d3371f2258514cfa1c002c8d96139b82a7d09e671b70c15272658010ab97048cafe0109da1ec4d85782607293a0f7bb3685b13bdb143a59f4525999fbd2700b1447c6cef0bdddc2e65968e076e62941565e698535af6a9b940ae34fdceee116321d2f296352955d0eca852db96a671bfa23e5074474ac559981d2af350e3e371f95c2046e8751f6179c19c38df18ee3d049dc0ef0e59dcfbf7b93e78092d972110392c4fcf5679ed463675732e25fa7da8b8dee7e02d3d9ef563ac4c9cae00c26e6a82fb9a8f016cbf0baf4264648932ac20210f85b89459af6da5f04df9fa8c2f4fea3d6424f32bd2a66600cb2b0e2e7c6d5a428b5ab6052206f6cff13818ea29bea53c2c13ceab3639967e9886f14f68e059b97cc23a338485aa9144965c0bf6f5365b72a900942a748355f781136a1adf51704b1b2eb5f4cbf0a34e6e49385f175f91f5ee7be63271af4d6296d21b7f20fdeedb99f8fbaa3baea5ad6fbbfb214debcb112f5dfffdb5f8ed5340870a48fe746271affa7a88754c1a344b22d6083fd826a1d81a970e5fc4c9bb409ef731e6b6946aa8772faa03ad98268b3b9219cc4a85bdee7ca21014cea9cb5681e37d2d0b0d8aa6d66ea2d22d92ed493de9800ab09b2274c1b9764b3adeb88ee6cabdc1f90f2dd8d5e283b6ad07dac721374e4c4db5cb5f9d615459221f884827a709cfc3e00515ce1f89bcdefda10124fa7acc407c1ed590219b93aa020ff2aff05b766c22db1a71bb7e1b0c75e3c45d76c4795f979e05f20de9882cff775282a5617d83adf2f5a3ac70a82febc03888121e1058ceee4f04621b35380f6b6bc9d144be4ef988b60064d339fc7a8d17e659e284c52b551b3a11f1fc85d97934854f4992337f8ae9183fbe1aeb9d3d45154c068ff270dfbe9ee7a731873d7d682e5b66384aceb9bc3893b56ffa28027ff759799a36af48e92df584d7ce06657f706ae4cae3a48ce5ac0ac9b628a49c6b948f2b78b5e85ce80ce1f5044f444486b9d7dc11a577fdd89961012e5a6b381be71d824224b8e6031cc44ff827df5c08185674e081a361569be6a07943b167547efa98f88ae870d5f4b29849ea04d2f58c440a42ce1bf1724e6752e9d044edc2d00a87e70ca18abca156083df63cd10ef4cc8ad89c6be5526ead9c192965606aa8f4c6112c8627345a27d8cffbe095300090a4d2bb45585d7a45208575800d058c8dae0b8b454328d583fbf38a26f77bf551b7300f777a7d71ab63937fa47ed4dd026f61057944507e1006adbc66cff0439944164fc3d03da19834d604f8288e065d947ad510236cd0af37f3dc019929b075df9997776924c5667f90841fec598ba0340753837b86938f128664495c17a3a190a98edba887c02c1bef827be1de1be90b9c224ee862b50ea0956d62582cf03000000000000000000000000f1670a7fd2016d7e432d24838e0736482e3d6697d5f54040aa4243e49f5d5af5453359b963ccfdeea4b797e60aa96ded055e813addac79b009528589e059bc5727165603e7c3641a5726cca46f152e3655d5faa4d0c8bf8c5d446250e57754b20000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000039c73d884481de29ee24632661203e06e0fa22a0db6f659773704d65991fa4f1c9a8c14fbd18c72ced7e15624838e0409d39277c5fe0ad0b97bb771bc59a040a5efbdf7f98b59879dfdd3a34afd327f52107ccb144542939da7e57e29d30b8b1624d614590823edbba688115c7155f00750d4bd2c3bfd50876996799c4d9717cc0ec1c30590a12a9260ca757629047d22807f90182f5598b69ebf0b7019bb65898da151e5838e9182884f377c4f61effcfecffc6740a60ab356405fa302accfa9419f0c6f91bfbe1af14e19871d6b313666066a746f5477c90fdd544d81233aa5a4b8844f158bd7988457fcccb45ddd3ca025ecec1c544f51d819ef32ee77b72d1d892446e00d40ac68274f4eb1c6b5e18edf86adcccd0e0ba24bca2adedecfe061f53a08d51b4caa9a7fce68368089fdbd41807e2d073048aeb345134c571d03b77f7ede1d0aabb13d6fa6baf1661f1ef4632093e7c9d46a674ad4024251470fc99dea0b720df1935687682281588b267ecd44784a08c0118ef77ed91a5863c3d22dad5548e69c4bc0de4d63a49847cff6102d4f135c8d772beadf53a9cf3992eb90daf26caaa0af715ad656b0e20a427fcdaf243beffd30bc36333b306f3942ebe79d9977a0bd0d06f954161e24c0c073686248db440fc8698da63a73eebb3316e53e0a92a0e784dd99d6c322a2fb39c748ff8efe39e60f4ffa9004cdadee126b73fa18586fae917d299aac6da3c9f4782a44bbf7eafaf186fd888eb25a265d59208f05f7c57d0f6c0ae1aa9ae5030d8b0c30d23f73e91c270287b79806b580a05f8cac14abcb4a804c132c8289a2f5b942557d4f1372120587af8986bb832b3917b2aba811df16904a5d25e757afbee94a0c86cc6faa34933068021bc92c69e91a8a620d68a3749b8d140b8902174f3b41fbc2fd691df39fd04d7ac1e025acf53b4fba4005940fa8a609d5521ac3a0f90aec8c19f0b41a8e474263a42ab0baa10a41445c391d94c1b749465fd7b8a96212cab3201ea6cc55068c02c0160210f97bed3c4544d5da100aac2a2f6c0b74d133f36d5c55bc94cd0c531637dfd38e384b34a6bded2703c13ba0dce037adba3c523288fac8daf5fb97d3feffb581a5ec9ca0f5705de03b0fbea7811e471559c8d47316f7240884ecd87816e9cd877fa0027e38e9e8a9a8d4566a8f51373bb7dcb5f9a4dc083606627e2db8b92a9e4d3d0d4a8daf642a631381b03e4cb59d02b1912b7987ec9b15a1917651dd77562a197b1ef1641c1948a65cd97758de5d88aca607452ac15795e7cef7baa4c8e4831a7f6920a287bc6096e9bc953ce7b2a48487bd2f8dd0e882dfef7d472455ed9045f27062e781bd8b8a66dae727bcbfec041397eb2813c7544d7137ea8639bf6991ac2da28dcb6b5986d9369dabb9fc02dc6a302cf8ea0bdcd47408cdaedcdfb9f55b8b3e677388c52c2a5e59185dfbd0d32eac751b5b24776db351c7e5a520f5e763ca007084ff1ca70df2a26d83454a6aa291cb4bf3d11c0f0dcb049d2a438396b6c9dc945975e46df8424880e15afdbe0e8ea637c2174b51d0bbab94a1a43307121b6f4a9ce7be9a70bae822982542a5c44aa038af98692d1717fb184d53bac8491111d449c5f1c727bc98493fd4fe2dea9ff999399e3058dbf41665adca4d473e57b8b6ef76f9743a4dda24168e7ebee2f574037f9186b4cf4b6093ef50051087ec5b7f84f041b71cda4a4c5610eb009fcaf4a6d3011bd5aee6ea4e25c982f1e5b2393cef5d011670da5dc33fac9bd20c84b29f2bb71b2b2c8cc3a720387e433c300877872df358bcdd3080175aae2166fcd7194ca6870b248e80cac36ebe5d88432656959d3c1365552701702dfb956c9d43f686415d4f1941db442038dc1fefa5b0de02dec523102ddd11333ba699040f06a81cfe07300bc8b2eb08da0d1dbc7571dcf8ce858d9480fa9ace171e7f7638ed225671ce281f7c16fcb1f996b8efd739690718b73ded983d4aa85ef80d441a87fc216ded703b02095eadb0a0b1487c273f7875fc75eb8f0b5cac4df5dd2e956afc6ae1037efed159dbf27ad3107911306ab5a0d8c26a48fdf2ccc94203ce0faed56df931862091e62d473d391275ac11cba70d646a61811a17281f722db82ee5af1c4e0e4f8989f6b232d442d351b0d1aabf1f7744c13ec979d19b9e64adc09c05aff0d364673d494dc129ce47b79a8964a02aebf3909863cd9f9ba4ac10ecb000b3042ffc62d2f55337bb311bb4f1eb746409f87d2927ece06bb79010100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "6a5251516aac5151", 1, 1984983045, 4179206552, "9a9851ff6322925495da2b53904cd3c7d1cd4a04766ee6a4c0297e7785ac9093"],
+	["8500f01f0131c0eb29610026b6aea11ba51329e0d4d46541703d92f5ebb06d5008ca7b90800200000003636a53ffffffff027a4f98050000000008000053ac6a5363ac262f7a03000000000563656aac6303e7943900", "51acac535200516365", 0, -677674969, 1953719636, "1555705830ee25f1865c0456560d4377e034305e2abb6b57722c055a54ac5037"],
+	["0400008085202f89036c1ec73feaae52a2a5a9e83e7fe0f43e93582a1df3b6788cc18ccf006ac1389d0000000007535353630063ac356f5fc376248143bcf0b3b3e1cdbf37c6920a610a2d7dc3760c8bd0a4e4fab6e24861e50000000007650065ac526a51ffffffff37ac21fa33176d741e1de663d503a03a2b317f7e656dd91a54dbd82d3652ca9b0300000006ac6a5151536558389539036ec2bc0000000000046a515165f5f79d05000000000100e3f70b050000000000de0be34c7e2f7c1046071b040000000001f8e78345d5783a18b6a2320f1cbb019dab4a6eabf540ec4abf6915d5eea47fb773c86cfc7c028062b7430b0e3d1f539a8938118f8f044a77ee53fdc31c91c31e621007a7ac8c39fb804a7f6a0475f8df32a37ec1c0da64afbaa4252c129d63165334a4b084e2e81f427b961a27cccbbef3e4cdf5e2ece9be8d2597664707d50d30a11fe830268ecdf66ef25cb3d6c347ebe0b18bd7780bf119982bdb9e46126d290d2fa3f0a4e9c811fffe87be8fe44b0b3dc700aacd155076028fec16fd38665544cf9825f3a32394d6deed676f96cfadfc2dac68624783dda3cec548beb68067ac9dd150579001acbef70d4a04a92e45cf2637f49d7be239ab136e316df77071fdabdfe9c71c1f7b28f1c6d3f746b44be4427261985d319ed5144651e9a0798fc52f754a86607a255ccbdb9ad1774495d55de657209d8dddcc240c065459244f1eb746409f87d2927ece06bb79010100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002bb1acef8858ce9675f95e0d0b0346d6a8d5c4390997b2400c85b2fa290e25328fd8a0f8f8f4705ff7e90faaa90a0d747cd9bf284be7125a41fe8f33759bb4304fad31fcc62f91d82984cfce707c8c40883b13cd96e776e50ff634450b840e73712e084ecd055c23451bcc92948c3e574324002eeff5e07ad5fcca522ebcb7fea30b34a38e7b32e9c462986a49d3f69b90f892b7d89f47b59b8bf1bc95693ad6c88a127601b5249f4b85200ecf008702b7988a707a077888790a28d620afbbe4b37b67794ad3f0ba27898f756459d47c3d26a6b0faee9f93433d6aac707b45e946a15a90292cac6b65e81173349e98579522bec21e7e657fc008edfd55b46054b0db0a83f09769b9c4cdca7a84ddc2ce40de456ef807fd5ac4939cbd4789153abc8db8232b46710f4709e018f3ca25c53e18212ed75092c08c715e681607b13dbddc5d0cf35995997fff505a5573a5eba47182eed892f25d4d67c5785acd527f0f33b05780bc18dcc5aba5d3cf8e6200ca39e2df971a84f787adaf7248c2ee93ecb9f2dd847123ba392029ea81a650b78c2e5c4825074600b24dea8be0dd4749a48b728538f9ee5ff7ef55b7fec05e90a64e66feb25b1b4ff8aa27195e2104c50413bdf25d1e72da1fdfda29b9e639fa37e32d68baa5fa67c89d2dbf3434b52b97c2960837e945ce5fc916725200ea1775a1b5bad0583b0ab8a4a549874b48f74f81694738b7ae079f72e3b0995efeeb4ae27123f0e5d137d5d8531b00e9ad6a129d4d03e4ad9ebdc5c51b45f0dee823fead1a5955bfab8740f2a5e7316b96beb726c521cfc1936f256ed4af00af50bd7ae7ec6eefaf5cce980b8bb70de7574e319f3f2f8bf68d906380a78098e7bea7c82b626bb65454d7149a0f81c0658267964f56f3409b74ca8df9428a5b96fafe88b7a17bbf6c1e898ffe6b7011907beb2bc51e7b9fb12eb584dd9905a2b568f2f1239ba5a6ff9d4d8ba1f3e7202dae6f4b2bc619b7e1684d02ffd61178e00175c86f4aa933eaa702577ec5650c372adf2fbf398611f5a952663e5583894692a9412e913a7e2a3c8b8657ada113be046d7ff0b788f8fcad8d1b1137a27eb2eb415edbfbc16a15d1e5838a716ff29fe1c73d5596c2965a4fe9f6e43993890e7681e4277b25bc84e30cda36fe0065761151355e550d0af5d5984313d900bcecf967a41dad840eb3483240bc55ebd3a9ef543133675505ae2668a63c86fcca2777cb8617fd18e1382b37ffbe87437e3f4e061aaed175bc376fe0e3c63f6dec925ab08960e99ceac89dafda9fd2c4fb68f88941309be29fe6514c8659ee1b4e788e553287148ff59ae77241fb8a2a0fdd66689961cf3f8c83c76d264f99853f542dc0c4e6f30379246b74bc15dff9d2faa19551a8453428e34c669cc086d20043880505381304c63a90e9420d85748c1c572729c05eb896e1693e2bba042de773ce213fe5a6e71b5ffd7259b3a61da4422a40ebda08ef8db5edc0b4ccd53f04ac406dc0b0022b599fb00115d02ed0b8d1f77d257613a83dc6813f9ec44e61b359220378de4735ff1d175dee0e3f1d1ff1ba3c5599c8e10374b80316b13aac4aef5f3b2f31c2fc2efae995cbf29fc6bea01186f8004a07338dcf13ebe041853722801fcc3a424d6ad4a8400a27a289a3ea4073d351ccb4df7061d0fd6f24e4983116aaa9a5cacb66ab5897abb39326337cc45c1f8e96cfccb734af90a7885153732b987c218e78b3906f1f1cf5c58a3d0092d5af146c9d45a7d2156a3b319a74866747f8991eeec9602c8f908dffac7a100e6a5a540400e4dd5ca751b7eca32915de27eba25e34e0ab121395514d7fd6a57e15896ad2b1c8f7e476e4e3b1788ca0503602ce29d3e31ba3d1f973b0eb50775510aa9fff199346d028eb292c7e803cfa3a6187bc744a7cd19cd496680393cb75203dc6265166fed8d3fcd08073d5f4203492a1814a111194bd147465288fad80f371ccda91992e23a038d8091a3ac97c04c67a7043cf530eb6c8536f2d35f6b12c1e1dff326718891da5c465e3064a39ba27a2f032629738df9d94e6e067290fedbfb6c9024a405e61f4db01c647a0fa94d6b3dc6fc106a8a57afbf31f9c03658672d0c1422dfe840fb6ed679fd8c07e45509c33dc0e8be4c4981983aedd2499c06fd3dc074e9c828de3de174669a3f1800172abe1474c19afa659515dd683fc324794a2823d4e1027ef0f5c4681312c6e06d4231b3c1fefef0cb759a10c589c14ca389058f828731794140949805e8be17f6490626d69b3e3ba320f286faebf1797d74ad8228645052dba67d5ef90d3a5be9f729706d923e6f2e093e7344d4cef84e8d9d87c9143030910edd4b8421be022809e3748e17db72d6a27547fc713ff8df6c96b2e2a9473d96e98b2855f72855e942ac453175a82608e1c4ff69db90a9c1c0561322e9438915c40b7bd3e10fb1570ea5d8e2e18250b35145a2a355bc3de1068f2ba2530c7658d0de44ba943f6bb92e295acea99b4ebc34374a8169e20dbb3b1c8662dd004f8e14561217976b208b7a21eba82d42873f6e779a4d5ad8738252198e2e608175535c3e926c38462d2f979b3cc875415f9e1338b3fb0d21f7ac7e4ce10cf99378098be17e871fa86e9e90345aa50a6cbb96767420da50cf86916e980422d110ef0201961e03000000000000000000000000ebba0adf8403f4b1a82b2ed17df88092405b14c201fbb5f05e97ac698c417c2f06e2cb4f59fef92e48bdd5fed71f5b402ee83deb1d5558032e0ccc402e2f3c394941e855b2f38e5b5118516ad908bc1bed5a9f253e6a57e8efbefc57177097770000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000082120d24a24d8f85a07ef8a32c90bf07535ad627795daff3d1bef009d5819f04d3ef31fa6df42035a71d4f1e0a025167aae29c33c78ea5649c7f16f2815cd8a25deeb45def843aeeb3a36b349f2d5600512bb904196dd4b07c850af0044a960908046df13da0aa83bb92431c42ac149b0f0a2f08f420554e925292ab538dcecb307ee69c7d1f2f0d40b379c3a90c2278185a458d28828be7795af600fdeae69499f9e917b005e2f4fcc4a332cc19cfc87f021b0d16f47c0f7500dd825ac0c3188460456a367228c691dc288f3baa3807a95dba75e9cf0686b0cb4da8f9590b24b07e9b70a6a32f8dcca5f419854bb341006d631d38cb2e1dcc6a140421f0af8f49bf60eb495dd79f1122b2436ca245f0344822ee7844258051f960787f6aa28b97496ee7ceeeac41f6c3c445f63a95205665fc64d09a066345fc77e9c8cf136fb94da773c61ace75ea84c2ce55b8c8c26617d303715146bc7891ab0e4320ceba18ebdeb2925151e3263a519845d5f485307ce33b680537b4ba849a796a3f247551499e26a0cb4a2032c3ac5b07e74f6d54e76c6ef1952f4e583670484a144b80581cde846623f8646836eef1a6ca09e3251e6a41a51eaf70c54f23f23c756a24ac7aa41f4068e2f3ff02611910696a2cc3b628fa39736c597d99071a5dc3e381fb133de313df74ef50015c4441e9d1008e0af79bcc53eecb8a28e19740e436f20194b299aec17d9cd343d86be9bcb247788e30fecde095944dd8aa223299ad893d5b4967c4cad2a8ce32c6b3f9a26058f6bf8c67ee509a731015a9a81f63b4dae070eaf2ef63b4baaf65be29327f2f6f32e7439caa55cd71824015e489ff9edcdd163152c8382ff85bee13c418a059f7956d5e0d919143cfbefc6735f48e30a1f9e1f5b38b5b27d9ac6bf7f89e3c27f83f89febc5c897b4ff29b4f7b0dbfa238d7fe38facf02973f0a3eed921c85dc0244c38a35b059313ef1d06953a46771f603ac96a9f5df06aa3f1faed634c3da9225fd796c118e8acc1c58baa233b112d0fcf315937ff6fa873de17ee64bf74201bb03bbe15bb2bc0f91cdb788938cc02cb35f8da9ee21112431ae70ad77fa52d94a717f82f135963a0db457c607906494d358e52f775f9c03b289ff7834ca7649a0606266008b9f4e97a04d38f061b6b1d2647a29638a3846d92e871168e1ba7fd0d756a96ca240cbc65292a08b37b07f6615a8f41ece78850b6de60cb86383b96261da9e59ea9d8d8fb26f85d1afc26eee60e64618f74b299b0bc9f01a33f582f953c09daa73e6a1d890af40558c1232eb4759e417af4143f7dbc7ea63992e3782e0db8cb3dadc8c8b0637acb389066fc2867bfcaba45bcc2c7960f2247ff95ca90b9449d018d071b99be66bdb97e96d475ec8e7ce58d633934e6a9077452341731c255c6a85ea0ec81536776d8d1a7225522444b612bf39e2600ae30f9e8cb4b9819bb197d35e9aef4d5b76959e0766541941488a8aacf54d825fb7602d50d246c6aa86e575e140a204385398ab935d67124076b3a7958213545587b996fa6d129ca11a3ac83b2e1140b04758d1ec8d9e1f6a17d2da205207b2ec35f4fc5557643af5c92ce74c4a4cbe071965ec8664d3b13ea0ac2481abb38ebfdd57ac4d4040c1c65172883be93e69880ff5318138c11d94a54e5641b0f086fff187d6b9b1a59423423956129723caa8178dbfe9d668180cc6a810f255d5e45701d9affa5fa4653a93f21e5ece81acc910a6228c6f6cf9c02e533fc9f7bab6765246d8837b20525a5ba5a52e3a719e1f9569fef1cb13f4fdb5917d0669e054a30cbcf35935f849f9481649c51e0e0577434cb2cdea56a09d3d87cd1bb851e557b633c9f5969f415f96085d826857ed5ebb2fcccc91d4fe3b8a7d43724e018e0122a2c7cffdbb7ac47c086895084de0977632178b0324cfbd1b96cc08ae2d8067bdce94c1221dbc00740f6b06725461c1b73161c0bac2a31051e3e045b3c8989269d4a3e6c5225c682f53f2984e7ba88b980cb412c0181fc22418dacba46418eefb2da61351e4475fbf1abd721443302d90db5c20c40e6231c37554258e44eaaf14b8782a64db04bf021b2d22a7c878b0312cad3a47ad5039675cc8516f10033578125e0cf8e25000000000000000000a6dc60200000000788eeaaa2fce69a4c90736ada16a2cd33d8e4e07c99e9b55daca9cdc62093dedd6784cbd14f17d45dd0384d477ef4bbe5fc1cf1b00ec3f96d6e5a69ede6621745986adc2d9da951fb8ee083841878dc820c3831868cabcc18fa168863671144d00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000e1cd337c9f38c72896c2af0910debc4b7cbd3a72e6124a205a96bf11a05e312d9db371ff2faeaa8bffd676ac2e63ba4eee68565c4da1508f634f3e03b20453e8a70e25d5878f0fdfb2dbc59d43c85787e6738586e60b6688472e3a20f5929ec5585c2cfb81cbb093d6cdcd19d7a6b21daf340a4f16e0fb003fb5d05ae28ecfff924c547acb655f0d3f61a80591e80434a70be098a020ea51d0f26d493e5059de96b6913053970d4fb3273d340f2387759dd9b2a09b9bd27b29ad2e0ea26812c57089da84267b2ccfd0eb62ae3811b54143a710784ea7ed1b8cfd6ac455b760d0298c4674fd8f0059982d65b794d7b419f7d0eaa2626fefc5f9a75ce827e1b97a06a2d450d5086840e08a832ac43251616f6b49b5de04ae2a0cbfc34e73a99bf28242c57bba4a7437396cc4d071f5827f655b955ad1e03ec410bb3f909f76a1679844fd32701d911804b5d7b5bb127c913690c8c51f4a9e40b0438349a29ea00ef5e10d3c38ee04ecc189c4f2092b679fadf95a74b9862b3ff9a55bd7183216854d1969e6a167ba208732934cf9cb6b6a30b975121aa9fdb184d819dd4f33c9d8b9d0430df8ca72162f065a6609112616b5a8845859cb6d5b27de0c1d422aee26c693342ccff1bc5507103cc398653068c24025cd56d9571529946c477d5a2d6feab236cf74653cf133245fc6ac44cac2ab4496d9a85725dd62dbecc033360467c5279face0e4a3d1e803a9678bcfe42794d2549813ab2ea383b59124dbc49ee69453c7ec4e2a447859239ac873f7388adf35798663dc7225bf9e8a779ea7b5701280011d19f397b104428dad67749d8c6929686474a360f7a158418b107fe918e8e451e92d0d56a45efb746dc6035966f50caf9058b0f353405dfe8da712fd477a1f21aedde4b5a55d98b17689d81a0fceb3cee75a6aabd5f3fc5a5dd40c41581bb009765bae88b849b82bcf427419321a98a41055ea5e602152b8ef1cb6beeafe23374919bd86e1193bc112f1e4931f51dde464463c2957bc65445fd86f5e32fb3a3152d9014eeb7b885114e46217331e34913f41f561be0ddb8e1942ac315a5cb6137fe4675e48b2ddcbf345c679a5a10c3a269f70e7413e5a7e721a0fbd16c7096d62cb9c17b4f1f83d6fccd5096859af18e8ddc75d0eb069e2520aed7b9c2fa820249149b782dfdd2793540b0a2a02d2e28ee1c68fa3c1e0a9cca184a20cedd415daa3795714d79ce005ce0392401dcfafe3ba1ef636b6d5241616d97d4ba6be5eed300e73556dfcdb552d50333d20f8b5887769ae943c31ec54c5438254247d24bed1e1b27931bf2cb44f899f52bb1d621db714133534f857cd9b42e3d23ee8d20544b306ab15d2737b41e3030739908ba65c4c8e6cecc91f5aec8ae34ab203c9da8bd16a9279dc9970fe717502ffea84b91a11fe24ec8ec65ec4c164f75af661e2f67406fdf67517dab3327a553a6cca69193e5abc9228b79af1cf8be90c7d65cab0801775457aad814323b79389cd1f78226268f5cef7dcca76455e5588058312718f04a6497c22eb141f3d81b91880ec8d757dfd0f6a993ef1af3080081655d0bb753003d6a41e5dd76991d5e566a4577840ffe690654d1c87fa1aad5116f71302f954df59158f95868077047c0d06b0a13493f42b91e09ed8ca5507c5fbfc81521f0a549edce4ed31566e2f57d8b3cf116859e198343857abb4f7e996defede5afd220a79157a866dffe6fed591e7a1274cf6de1bc538736daa1da6dfb872db00400beae24d05a8a9f65f81e8a8cea6813a21bb3cd2ab8c9f8755494b002d76f3dec6e811e811fe9aef3f838e4cd4d5c3519b26dab2215a737c0602820741be7c29de8a8863ebf604f172a7becd042c7b794073986bf8510b46585c1a860f3b8fd8a7be225a616c62cfe07fb4e613d5be72381ac1c23216e25ff7f1b4036612c52b4faabd60e44c52e5619b2923baa88d0b94ab30cdf1b7ddb0e997395e9fd8fd9cadd8499980d9709a8d7694795332adad62f33775b0cb61200f0c8cb743979936e30c5de62802e02a3379c3deadc0e3538244bde1e29f5ef0ad345398934259765e13453a9223c163fa74f94c8f33312f81b371418948622e1d4b0f84dd1cfce2b7b2fe3900d4f23637066a0c3cbdd3132e3f99d478e1efac588832575b2c0254078e2ae3d4097ca7a87b5dca52a20ac8fd612a704d206f82f8e3a6334cda0a9028ec1f58c06234276bf018cde0c10f9a657a09db39040c4c01aa9a7ce928210d08129be009ce80b98180490000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "655263acac", 0, 180739533, 1991772603, "37ad3d085ac16bc4429a5856a6b16266a31544a4ed24e9053ce0c107c8ec1052"],
+	["6250fc0d023fa6e22054cb7b74c22e6b069f8510b6c6dba92df2c7c993b79d6169026f36a30000000005acac525263ffffffff0f5f09997363ef9262323bfb62adc1523b4edf7ce58d8379aafdc8b33c7ab3990100000004656a636aa09e625b03ae3bdd010000000006ac63515252aca6ab01050000000004acac5265813a090500000000066a52ac6a00635ef08dc600", "51656a5263655251ac", 1, -147186056, 1991772603, "1f483a683cf92030e50a19a70b3510db25b8aaa91e73ae04300f4bcae7d89c4e"],
+	["030000807082c403028b5c992226cffd65d02990aba11cf2e0606aeccec89d72d3719a4d34457d82710100000008525300525253636adbdd4db235c1c3c7eae57358d158b4684068d1673cbbbe6ba5b7d2b77fa2c040b91ce15e01000000025353bfa6f76e038f606e0500000000066353526551000e88260200000000085165516a65526a526d89b60500000000000000000086216e1200", "51630052ac6a53", 0, -1598937296, 0, "d8178bd7ff7ab7268e5509afcecf3fbd2e23876d6079c0a962ba82baaa743edc"],
+	["030000807082c403020a5555a54f7298284f81e34bc7b8b3d0b63335fb89282b362367ad0b4030f7ce02000000065165515251ace9e35bcb4a07a0bdc2cf0f8a556ffe4dbba5dc13526193ebcccf16c0089e3ed863a92f5c0000000009ac5300636a6a0053ac6a60f594013633a8030000000006655352005152000000003453ea1a00", "00530000636500ac53", 0, -568405915, 0, "cc9de88621f289659fb2c06126110c201914400add2760b6194554eacb03370e"],
+	["e9f8c06701c75a3193938f8aa03b45a86727d487a016a1548c29881f53aa4f52d299ad053403000000076365656a656a52ffffffff0115a6b3020000000003516a6a3b820ad100", "636a52006a00ac65", 0, 1478987624, 1991772603, "de1948c29ba1bfe33565c8d15a475d9e9c14da10206beabd197acb77043f238f"],
+	["8ee88d3e0187866597f61261ffeeee7b4bb7c4e7f2fe80232221c1a0607a25e3f83d17ee59000000000263ac02420ff7045ff885050000000003006a63979f970000000000046300515391b72f020000000007516aac6552acacea21c2010000000001630000000000", "", 0, 1201299194, 4179206552, "c30f47f6f63eb4bd287557b939191a326374c0bc755c9b21b70d421e49532f7a"],
+	["030000807082c40303a138aedb010d8e3c6af52f77ce9c74c21af0975e2b3661dedc46e0b52f563dc00200000000b2f43a876ca34596f09764431e0a7c02b0193fef25c57140de9f8dbe9bf804fdd37079dc010000000251510bc48b6868ae2d90318c033025d00cf50f30b8f16baca49ad9243a4d7c3043553f9eef3b00000000070052ac00005353ed099ca403a6f25d02000000000353ac53b1a429050000000005ac6352536ac17d1e02000000000251513d8a8cfa867edb0b00", "6a630051", 0, -399216632, 4179206552, "7c06c92416117fc37787964aed160a9815ebc162e2454eeb11b41507114b4a02"],
+	["ae1d1f7802186fb6bed34fb4fcdb2a6484df65c66ecd334b1eeb04d5613b4f3f45f0a831f2010000000452525100ffffffff6ef1221983bbdbcfc81c7e9b1c1a197e6991b08e0e043afdec6303a6ed8310950300000001521410b6d804142f340500000000030063534e19300300000000066363acac6a53c132ae010000000007656a6a535263ac3b5be800000000000900006a6a53655263accf3ed32100", "6365acac5263", 1, 1378892689, 3925833126, "e8a84f64328357a70a0e83970c27f707cfd823e69098606176110c622e667d48"],
+	["b0edf417036998bd243e88471e0b80af52b0376353a3172ee196aab832d52d94aabdc6ba5001000000035200acffffffff99b664c3b2603fee83f424774d21dce458afc1a13c366824934594289ef3cfa50300000000ffffffff588c8a2b4f9c74c7b78c0f9e2c80a82d1f27aa5a59d329d07bf508db7ead3dd4020000000251513cbc82520363086f0500000000086a005351520000acb04152050000000007ac51ac536363518a49640500000000003854051a00", "6a53656363", 0, -127863005, 4122551051, "4309760fe36f81665f57a04ae1953be0e4739add684669077df10e3483092972"],
+	["6634f23002eef87ca043373843584ab83af8a55e4245c5245dbfe40dd5a784e7319693aacd030000000552ac516a63ffffffff1350e51cfdc54925d95bafdd567975aeec0790bcafcd13aaeed9e34ccd7842ea0200000006526351ac00acffffffff0315c48b050000000004526352008a0d9901000000000088598c05000000000263527be16d0500", "516553656a63", 0, -1999011771, 0, "f975eb55750243fd7f43612dd7b82edf814729d6001a86b6f132c9cabf0e0c02"],
+	["030000807082c40301f82ac8e2d886617b936d76b4f7167454a5747840331a822088d07b90039e161f010000000451630052ffffffff02e8e3de03000000000163d67adb02000000000653516a51536a0de17606032ec70000", "536a5365", 0, -1168472345, 3925833126, "5f8b89cba1d3f5c6d0b60a071d755e54a0e806719e7688e486307034c067658b"],
+	["7713a73e034e135d7928ca5eb11729bcd2365055c3a36697b872a453be8d145b1fb6063a87020000000400525363ffffffffc7feee6faa08499a9e223c6d554cf56c5520c8d30c4374e508c54bd1c8fb61ed02000000040051526a297548501d8a8676d00cafe003bebc957ea9127d8c728985b0b6ea4bfd80a5e95202ff60000000000152ffffffff0374a4c10300000000065351636a6a51d84b6b040000000009636a53ac6363005351d0a7ea02000000000263002a0a3dce00", "0063000051006aac", 1, 1440270874, 4122551051, "c9a39913065e242bc3979f139096452e311009bd3067bc67299c1c4b093f2135"],
+	["bdbbf9380114bca1b7b49679dc1bb54d4a87e2295fc53a44d782a22736c10543c40b1a5a4c0200000004526a6a00ffffffff01ee344a0400000000095363005163655200ac0000000000", "53526552000065", 0, -1471511577, 1953719636, "0aaebefec655af4fd0b4ccaff94c0906305fd375c14e2dcb7c3eea0256ddb367"],
+	["94e9952502e6afeca2310ce07578994c125046027f8456cc26ab75c7cdadbeb4ed403e1dd40200000003ac52acffffffff2f0479de369a279aa7fbfbde9825858b3a66aaeba0837e4b8fd57f2412886e5000000000055353acac63e7ad8bc70239948d0100000000026a5286a2570200000000095200516a650051515224bd079800", "6a0052", 1, 1859309507, 0, "0ee3d63386e034615a49b3d1999c2846c7d28165c2616e10bd748ff0bb21aca1"],
+	["030000807082c40304f2b5215ca72bce0839376eae784f24ac09ddf1dbb6da9f6e766f1cd33daddfc70000000009ac6a526aac006553ac11cf02de9037d77cc9c8f482153f25fddb69b3cd10e0fae77dd3512c6e70f781d1e2407d00000000056a65005253ffffffff5da31d27845daf2d9ab2fd4bfff8e90a12ad32075eb62f77579ea4051663f7a2030000000165c9951d3855f453b8b71cc96bd250880632ecc0dc19c9088e4d243c87d442e588d2bc360002000000008e111d20032cceda000000000000e97ced05000000000665516352656a788039030000000001aced238aa060c7361900", "0063ac636a63", 0, -1214062869, 3925833126, "6245a14a6764752f5904feb96e0e4aaf2f48ec63785de8ade5968f019892bc4e"],
+	["0400008085202f8903c36dffa38bc87d95ffe231ad65cc97ac114198ee6dccf2e896e70f5de1f69f27010000000153ffffffff70cd31753348f6b3e26c22faaf3135ea49c045d0a437939d0044a2425b1677fe020000000700630052ac536a2dcddfa8e4e0d3154f8f5c04e815de65a7e3854a9138ff0948d6ce14b3cf9e881942ba0703000000040051ac00ffffffff0350c4e4020000000000b50fcc020000000009656565ac535163515276d4890500000000036aac6300000000000000002b147b0100000000048e08d03a916dd34f4cef5d13d7d6c9b1a8b7b686f5affe607d3627a9340cea010ae39d0cf08a946e18551195f38d95864e346e2e0f69dcc5243d51eed21c0005ac27b5225782cbad732b9719d2653c1d88819017123558040da1a9e808a65f97c5b7d3a79db71cbadfff73dd4d5ff7c0daf7a7e009015fc6bb01ce690fb9aef1ea22ced225fa03b1a93141c2a711b4584976fd21daa92ff12ba5552b91a52c036af8c80668d6d147e28fb2d838161e703bad664f8ce37aad16612e37a040a2ffcf3de5554eb52ad27119a69f9d57b212fd4613e2ca8607e12072ad95a11883ece8dfdd0011c62a8b63fbd5b748316bc89e61342da211ead0f7d5d3952ada3b524b41df4152bf5ceb6f7ab9094e4dc4e6030f23bfeec69616d98a154a0b9395c29a7138851c7b65d28667cd2dbcd1041948413d733110381b984339d80a6d3d10e928210d08129be009ce80b981804900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000b879473bc4c69cca1be2a5be367dcd0a3672fd77c3cc49e4caa65d10e1b56eca6e613172a55d2d0aba487d1d25fb129896170ef4aa88fab3db9adc98e1d59266cbb4e3c9e1d3973527a645dbe519ddae8d8d60f87ac534e5042d934773e4a21da2c5b5cc27bccc17762325ad902aebbd08abd45a231da6f27d09ad884df2f93268b237130f999727f3ec3b59efe907014dbc7019b853e2ae6347a79366950dd158500cd1cf07b8fe81b35754c1ab1d14fbbd67d0ac1585071f4a4d9d45611e106c28bd5c771f8c0c5ebca5710b75dca3b16fbdd3127ba95a59d057779de1074f158312aedab156e9716f016de7b62b3a174c32f51f7c85b136849986ea6ea129686aa385a281c19b1975d093d9b9df128236cc1a33eeb3f737e5364fe10d107535d174d0c1b670e8675a33e6434b385acdc71f1f7f240be40ed661db5182d1bae928210d08129be009ce80b981804900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000197769d5ff735a526b7b9aba0c224c6994a331106a12c2b3e590f016e50d000425a5a001eb66e6218877971b808c4d209018e962f45233db1bd09a63149764634d4a1eb729ffb8a5f616777b0f99dede53dc481e5c369725f70937e19e8c68a564874c1acb2f13eba54bcb33d98c2f7366710fb0de23b7a29862e06402c1e1c2fb6fb46a21a6c4b223dc2bed4b81db202d3465e93a6ef731ed65bc649bf512cd50e0b667156536a19b1933e28374a7b0bc7ac1e7b767b1237ac1c873885a38a56d6a25200e3f5cf8478d0d6e69319418680934b7c649ef39be4b7e5e501e3352247efbe19c04a95774a514938b51bb3bf7b1a199c372f008e4a5587c1312ab8daeb7257eca3309074fac78c7dc578c72081cb5a8a33c89d22b0a5d360466aaa9dabb3b5cc896c436fc88345cfb46fd0bcd6a15201152fa8f17c439b97b4795bee928210d08129be009ce80b98180490000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000031f3c5a22c08437f83c2015e546a76000c963755b455a7f0b5ef6f312db79e7259cfb9eef6951c4371ae3b5a56614748b10385b0f735e04555bd9d3a1d88951acc7c1ee42241581c07f0553568a004b44fbc23600573f1518589ffc14d1cf130dec36a986ea6dc3a3e7b94e12b8553d506805fdc0f10e0330b76d8f0f670e4d9e8772d5df8f4583ad3c40532365e7e4e49a0ed4f9e414f7f5178891fa834683af8a1861596948769d891f0a9057377ae2ed0714b23b5a90f23eebb2ac03ef81c5fa22567a627a8f1fce7c46cc93861af4815bfab27bc98c74c77529301792d1d61ae88d51ac1bd75293b4d7ff84b8200e4fbdde7888a2df42f17f60e839527de8bb8f34b5620769fc74a0411b579da207ecbde7e27d28bed30f9f6c9399b832b7f032c6c6fd85ff7ad5bc83316117833fac7826fcbf2335d4b023e46c36592c6e928210d08129be009ce80b98180490000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004a42d7848f1357371f079b2b4d1bf7198edb88909febb5df8b2b5c73839c97c5e92d77e8ba4af7cd590806a0ae58c3e005d7a3c71cfb3f814fe1d60282f39bf1173e9dec94ac6334ac3faf15faea71ba0693f5cab84449e49293cab1f26cf4994e6eed0ac401e84587f70205217ac378f4fc1b5c791358b712364e9056de08995ce92238b60f143c1b466a5c58689dba09193966b1cfb47f7e915c6264d7c330afa80827871b5c3cfa0c8151a2740e57acc8357eb3243e5ad31176d562b1f099e194eccd58b377d3a0cd2dc934f1504f8f7c39b2681c26600cf829b11e13f99582c3ff64ea21364a9826c5fb55d33676f95b9e4125603a9303b2fbfd29ae05c3f051ef6476fa0370d8b57830d63f054460eb6d60638f9f2945adb4ab8f4694d520802eda281f9b635b412b95d6470a4012692a4dddf124e572b7d59e1aad0e13bb3c6e6544f45213a3942aa2c0bb56f3e136bb723b1628b78e60fd990581c9680977d0f0b1750aff67b6ec1bc52e8f398e199b99e4751f2ccf284419493c3aeee59047de2065c5a7a6bdaa8c7fa93fd2691cd1cdfbdbd0bd79aafea7b7f70c7d71e8f1f51545bed16dd02081651b3d64dffde06085b6896db85de6ab8b5c76ebf060f33beaa9514a6c0db817d9076d1de61c1316378c2847a54298097bd71595265d0cc4baafb64aaa76c78d45adc40e3bd6383c74b95f76e13a889af35fcdc4af1ca021323e2a1fa049d4297c19ed6a1200cddff1d5bd5a2463fa9277ce9e0a785996e5ac143dd7b5ce605116cc19c5b1d060cd37931b9fd6ae44d0d0135e7fa024b2f897a92f23ed22109e79bb37032510107c10bde5bfb88b98d3d29a0f99995281008ba9e6fd863c33e260731a11c9b2cc873bf73e4b9cdd5b519f8b1ba5ed308dd6f9be82ae4f081c14d11f80ba7bdfd1579b1a7bdb6b3386c0e9981948d5ce77ffecf78b6015359676965c4a897e846c08e646aeed12e2a2a0e233bdcc103eafd87f3faf29c4da26632d924df94ca2090c1062dc433a6e930b0e7975ed747f2afd10c9d78c8584463d21b6fc1a683779100aae1ecc27f75a64493f8ad7b3c471912801c7de35f0bc06d0859dec0c9cf2da50e5114e6b866962cd21f230b5b7338f2dea4c4ef2116ab91665e1876dee30b95aeda04870f31231f0ba24890b056af680710d382348879cccac9f91e75a478b68e04536235c83413d48ba7bd4aca08a9c3d89581794b9530f273de03f54c4679d8801db2c8ebf544c9db4886744d5f338357045822e56ea4fe8f1101dd12ff45f8dae0da3d01c883264511dcebc13a85948f5df59aa26ce02223050da73e6426e9a5f6b892be744b2ce66cf0ae3255c5a242759121ceb022679bec2a80495cb27fb43affedf12ba3fbb2e928669b127c74e0700134d04b7c637d339572fb3f0560596c11bec025f8d177b864932aa81ed8b81fdb9bcb79effae4647505e2ff5c298f6d882c3c702b6fa506ff9d894429ee07dc9d519e7726690d6b4bce48eac85ed9761f3594c480194ef8cacda8c23c018d71666f6f02eddecd09ff8c1bd33b6e8ccd8d5db7226bb9c06794a4595fe896841026818628c04485b33dc5650f7f0e4ae1bd3dc5505675e6fe08804597b8113f8c609c994a615aa5097f345a5dff295a6b625062ac72691452639af18d1c27694fb41b4c72f59e8eb1a210019410bfc15dd9ed2640079efc65e75346791d188e2b57745ade4f69ffa84d09163bb9052517476de04bd8c3b39316ff001a7aafa615ff40f497ec4330d4039c7bd9e8f130e15a0caba68241b1b850fccc155923993ef33f5f8ab1837b1487642448f96b0e9ed1e892a22d1565b647e542440b14afdd3b3d8b5b1d94f7c904dbc9e3fc76fd7ff7d6992e4b9c2aab99541a11421f1876427771ce33c3771d8aebd9cf1659eeeec045b1570e06896108a34c0cc6f0abd9144b6a8700c60f5e13609e2a584102def34a6d593b214ec70d4b4742a0a7ef45c273855902989a196f02a7ddc2e5fea8878b4c4de1d1eb18c33f653cbefa3eb99ca5dbc66831420d5fcdd746f4b671136aeb621756e2acbb1a95d2a40bdba0b8b88b35546dad591a8fc764c231dae98a7af5a37a882617cab80f895f362fbdc8c3c6349e610da52c8062bb337da51820187acbcf9c3ed58a4c67ad9380a8fac20b9fea22118bbfeef1289fe3e111b06aec2e1e6a26a1584928285eece20b0239e186d4309f4f4765d7bab15e30d1a3bc02333b63487c69a7d0720a02e07bbe60bfacad8e0300ea284fcc2a5cd4515199d7a9d681022020ed5b36d57eb13aec23bc93ca3a14c344adf10bc708bc7d0a6a01a2d9017ed17f02addc79a8a9402e77340ad00775c58e1c60e77668106d80374fb16cbf858d924bc0c652c7ed3d0ed920d3c68a7a48eb0ec610a075fd79bfa20d88aba569f0882c00d28fc1c033ad32faba31e8f8c766d4c966578dae4e7b201c3254318661d0b04b24459d75adc1096567231d36e9097c4d50a3086e62b951e985f5adb2fbbf1217efe740c6d7e0bf5cef78be123388735fed8b63e8da9192c8e7348bb9cd03be86af009462ca6942248aec01a1ab59162730f7e5518284e2bf40a1f3b83a7017b48aa2e4189063c787355e399d802701fb805c30db9bf65e99a91f26d08f6f896777b56da5778b830014e348a2dd69d12b65c34aa247e28c87ef470475ca4c01b38fc5416ff64726379237ce52722eaa3277b39d02544e03d07093f265da88ce0f9a6082aa716aca2ebf6941cb4dd621f43ae9e792defb3a10d4604524a9da52fdd6e73d8cd9b678b5e3a84e0d4c3c1179b20d8e5888e7e64bf7a52d18665a82d30204247244178e90c5514113a65138ce95cc23caf9da9e9a9cd2884d24677d4a213d92d101fc807da617f3a340a81a2d4a6a74ccf37d5b0cb41778c2c295039b894b88bb23bcef68a109b889ccc54eef899723036131add94e6241133db7c568b2f0b55b186bd56999b974b9856e736883b50820d0eace1c30bc6ec2d4867f2607d01a686f7937608d86ed576228380ebf20ce6d179f0e30b84357b9c8ac99f36888f00b5bace149db1d39278d37021351ea1e95b8fd9f27e70833711de35cbb41047b3edb7c59c72025bc8f853db9e493515193eccdceb5568b8827863980d84042b261a0c226524c2c499ec51a5827543267caeb7eacdb034f5f238869cab2c780bad9fb7f0baaa0ec76c8a52f4c43b78ddc8ae3ec854eddb3bbc90a32c1e2082f81eb90e92e7d75c0d24ff7b067e930d99fa0090a58460b6a8b0849041f5452b52d66840799613dd25a72917960d0ac1e4e8e4b8b7d0d464e1500540bf308a0f461b4dc3a3731d4a30a5a8b144bb5ab74bbde29b2986697bd9786f29dfd22807f51331b14109efb954067db095b024d1a735be0b04f0eefb9d39b4f95203f688e6b3e89e51d0b3a08755aa3d677e5e23f904bd2ce02be3c2abbf2ec82e9d22f5269a20fe9fb3f8827710f1bba95a7a0fdf58305d842d771a055e4ee66144e25b1f688abfd8896f27f01761f9ccbd20c5df05f1825bda3a0f50a700519eef1dbff5d10e32086f50552abe5c1a656f9076862e57f68b14aae810c971ac5f3fd479fcb59012dd43b9b168e0e94ef86481d956d0c45877b6ffab8b5c7c5df16655a284ffe45958d3ef2f6265319073082f1f8f381fae649685743c78d5d0f274bbef1b227443a962433c22e68ef92a65bf47b0c9c91c39bf888c030ddbbc50ebc2a80cc699d11e04ae32ced7457cb403c35a0df1c5b14eeec57039e74a9768ae1c5dd585dca873d5873fe7e9b9083540d567e1aa291fa16119c9808b83200f535ae96e5939384e14fbc60c74b13196dbcf17a586cffac576ab9c186429cd32ba809ee69aa345227f54b226de16daac09a670de1ef92e97d5c1acd3eceba6b406b27baaf80f0d93b143e50c2b858d321c0595d8401df1137e2dc0753a16f9e8d1e9b82c4892b03573e0b73f592b79b5d5ba499cf7ff527249f36d69fd1d949ae962e2db3a33c7783df5f695ff04a946428b1678f437cfeabc5a3f98dd5a567909db694790eaa6f44cde53a61c1ec606eacdb2843a447b1489ec52d2d21a4c6ddfbb46e0dd8b98baa70b24123b5bec5915fa67381e6f78eaaab8d8249b9fde18db12b8886d91b4bb52f22f81cb0eb6f370f448bb245926b3f02a9fa837fabe344690af537438d3e55995ace00edd26676e0bef732ee24d2b2756850f8142bfcd3f48b8c8d84e072c8674f092507398d711c47157a659df3919b7d540e0497322b8f33baaa74438f143b759a2884431a3c8d101443f83f52d553987ed990ff280bce1e0f7dfe9e4d9165d2a2460021f12484134533783875732133ff1845ea9faaf4976c8bd914579b6f181b7a03e0167b2c5bdbb76de2605c7b7a66f987338104f71e0719598941d7e32c71756bceaa18e1d67a89eeb16193c4c02d1e7e50df89a00703d39503dd83cc754671c269f9048d5ebd6da1d5279b0528a9ced0e32d15d2fa85722c3069150318b7b2c2d5084f74d47019491346e322d73af3792b0b4a41e97e1c2d6ef5c432f70887f5782440fb09669c80c19a491e3fa202e2f50eafbb66e02ab2b7d93ffba746134744a28ece2b7b88cee096e8b5f15db1f5ed192db73097d962723f0e2ebaebeda175382dc6a07d8e80ed63dfe145df082a4274f368d94af184b0ac2e9d2cffeb9d62a75b347f0de450ae17b4c283a59484df985446eb6835c770bab8e9dc4b2e43805a8222512da4eed221d9b90e66d2f2c2d46b51f16c432f275415ae35d3eae2411042d5ba7d85b9a4e2b11f1ac7726f092aea47cd0db4e1b839afedcecd11903ebb9f88f3ca560cf18674511293dfccdcdb69972ccb9e912e46feedef95ad4d509a4bdf82ab1885811dee1d4c9764a81b8ae5692e139d87110d573f10b57374736dfa1b50c52c0a0886746b173c243bad30a4da78eb76b07b0ae0c61677127bac1529c067bef7950e646fe05f2f11938d4a69010f3cc8bd5b369122160a3dc8785d3073a2d68c31f3940427438a2c17af00c9541b521f43cdefd2d528e9f0a2bfa5ce1db46fb3be55d5007d1a8090ebba683be016b4b789b4d7addff7135e4974766da7bd023927c28a86a561de87087c8ac8bd3ce990983ae866227e5595732a0a77afa36a7aeba3931dff2c2070a60f5aaa4ca537c80780e860445238c2d67e8bed50a1c4e25ae6bf155e4397417d11c40d3ba8b1b1c4b14c9856711481b2e7674a1342539dc987026d922633c6e1109aab2541d055167e6b528af0c1122682782c8cef6e09d04873b313549e305e144d41d05bd5497e869ac7fd0cc8e852be4e00f10333b90100000000000000000000000000b10cad5b5758de0cf204b4011b250f73339f74fe09c03e267949339dfd6327d6a6b5c525235a65965c8eed2984cb98bf7ae9432c49565624a28aabeb0bfbbf1b8e1c3fd8d677eadf0c80f5f9ca557dc45af6dcbc24972adc6118717a170d74b300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d788bd1b437459c5ee74a582f3a873048611dadc9702928e2e660d99f6b377ba398ec439f2ac46c1f8a85e925468b2237383df69533bb8afe275a33271db0e77cfa261c779f4bbdc23e7b7af45b57374845075b7948f3022c2e25754e1035d43feea22c1110e37e4583c85ffbd0540d52d2f0eec8de0462d63b407cc5120d6c8373d44a75d5ea9ac53d6f6a3835071771bd38ec7e3f127a00aad304e0d910b0272ed43d850e31f9ece364a7ecb433e8b23b26f9f4cfed3e5b1fbdd07fb097a5f117464d42cfd36b696510581cbda441545e6e1930eb16a9e550425344e4c78381220e29ab2489ba8879b87f56dd9d6b90f9e4269e33e78e679f6fd7eb95b093a509b51e79ff5e25f9801a4ef96f3eff384a0b1fddb443230fc0f9078686e6d89464109e7a94bdb011d3f87a1a9abb684c0fed3f3a87e3c7b01b08dbfb323d7d65a41142b8f3ed29925cf7f293e5a64b4e4d8d45f3028bfbc996d6ac94217507c927456a2d535f2c3513eef4097aac5f3e584fb9c3238f14581b860a56db416dfeef217ea9c0ea7fbf22a181c5aab3759706b4a2a4354ee25b8339f85a60d73db4fe1982472762a409b7c872e82e7b5bf0c95bad1906c84eefb6e8a3332c2b8dd1d7d1e464ba4e6d2105b6c60d2c6613bd178ca282a88e0e83defeedd5c162f5f3717994ab634ee5f4ab4b4f83657d27fb6b3cf75e9c271a12980ee50d9257485a0cdf7d8fbe1d98b57e1fc87f9bfb71acb950f2f96f760619d404d308f5339fef693d7e1b4cba51b291c2505299e2eb9c5fa3b6f45aefe63d33ada3872dc75934f1963abe1394dbca2c877382356685b2c9d6e1ce10f261fabd344e1f00c45a18026a3c455491de58b725464e7d77d4ca2ed7c6a13af3ddce5513ac0d8b483992c61afb11af8c291237d287606174a4f7f439c57756d924e6b066ab7e0ea07eb7e450c0a9f78deec07b23a1ba6bb17ed9ad3cbb5387a796d31fafe980d7e4cccb4862856915e2a635752bc9f153901a2f8361d0f44cea9ae5dc70aac639f3baaacc7a15cf02727c2ba32797ac2671db1c6b8c3c9e7b47a24c035ff7a72a4960bd2dfccf512df795649091ddeec19fda09ed1127e5eb4199cb3cdc785042fc823b3a890247108d60c867b98f5f363e1efbac3a2071e537c957dd87c5938ebf4b904f476924f65b299fd291705c61841014e5edf6f7140eef29ad6359a8360e82a998b95b5551009540aae1f3aa1d3bc1d33811d25ef47b014bc9b3bb2a22e344c17e89d7eb622a859d0b48f3afd9c97d861b3014d62215c03fa1a52bfb2c72d2056e0ef79b4a1d75483d1abc08d0750b1942b5d32be0b20f796759e88357b59e03bf07a8f6a307f50e52df8ee1abe3f3da11e32a951da6466fd3d08af1bc088b330f7d62ffa84b9adfe72d16da7e8590991061c34f7fbe03a7bebec7278ccecf59c30170fef892d53a419735b5b486cbe2fb87911f36f93f777722909f92fa4135f6047a7bf453833989b92bee9cf5ef9b00b6ef314faf20b51263f44ee4539d75c8af2f619bf0f259dc855a67d0fd5f1a055232259a92d294aadc33d2cacae66b395e5106713efd152ff8ff8da87fd97b0c4bcbcc43b3c0e1d4f4a1af5b3d27c94619dd31dc76ec285947331b9f4eb19d38ae738bc7ce6aeb4eafda5c9495464ab6e1d2291bc05b67f827ef0c78242d26b82705741ffe995956e1ab755677f670e77f6633803d88f449d1087da990d85a18a0d431928a158891a68ecc987b4712c3c393f98b26b2a7a8e4bcf50739f6814a4d67dbb4fcb3687f9e517631b27baffd29ebe74f18c5f33303e6b2ba23658209fc5f4e8f8955dceab2347f1b7585eccf4d8f734d043677bc7127c971f735a4f0653ae67c750bb4e7861fd2345bcb813fbed6eca028245e5a0064b0a13eb90e94f823e3c0e4fa26189393470ee2487010f3f188cd23897f20fdc091df8b07adfbeb87646d8db6cb623ac7fc76942974c309128a577f1f6cf7acbafb660a1dbc92d36ed5ae68a89f1f643949d0f2fb900af625f20ccbd62a21bea80dbb174e90c699ab613b43b1024ae1630615db37fbbcb9cedbee1f21b76ff7b24190e9ffc11acb4dc8c7351825422f1e4e5a6557a4eac4039f0b978b081aeaca55a019b2d46f70000000000000000fea29c0000000000ab0f28e255da71e4cae880865049fc8bed68d3aaefa88460057de6c6e30907c3aad8db73d71e4d235018b83c4093384ce081812abf7224446ef2fa062248d15273364ddbfc32401570107465dbfbd759dcdc055ab0b6e65d98a1b21c73cb8fcf000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009dba1ef0fc2f48da6ab62f97172d48bcd6d5386a9de90cf6282e2fa1961d201b6c6b4756dc9ba8e7f1ff29475426a12740ff1a6ecea0d3cc971ba869afd82e140f4a5a73b66513527b193f483723994c684dd0ff5d5b6cb26d22e22381dcff2fb4e9ea7bb91de3eab2edbc85cf39e851c9462ac600098908c2d7317331ddffee94f346a3252ade7aad96377a2c4451f92ca57cf979e4c4c334528a0d9196ab4a392df96ecb6654b4bc414fd955cde997f9e51bb540a4d5507b9d07454b80d0e84ed64b3f1a9a6407e8c640693afc70893aef8e5c3273f9e1e4c40111976c362a1acbb75ae1f2e142f833751624a037acbed7ed85cae4543c92c42c5facb223535f26ff8b83b03b997c5dbf28d182a04b12a1ab11c101489eb210f708d7268c9c6cc970c84116ea8f7b43261c1015975efbf5e35b1ec064f4f2ba4c10ddc90a3612ea6d19605ee8f0f3dcf046264d1e3a270ed623b077da5916b1aae2889afae0e8b342f933ab991c34a3f1890e5406f3e502532b7fe2c9a90531848282322622fa3383710295af4c704616ed1fbaf1b747aade6c8a2389abb9812d462157283307afaa0b5b8b078f322f1de35eef48859f06bd07c442aaf5fe79a56b264d35aac03afa050df748e40af543702c27b691eefce19e45de4c116d1b91ddcab82985e16707c15137c86409d4993dd44c3654adf3604fd0bb76e40a381e3e042cdffebb0ee5f54727fdc818d477d4b0468b7bfa7f06a1f46f592c0cc791088924b607f1848c7213b756167b1fd282332665d9cc70d2328299ba4d5ae9290a5c0460a8b5c3d0aa6f2c57a381a57d4806e9f7179409f672a59be00b42488e6c00a462e1b079e3d9dd865cd6cc1e8d5d8cc10a4a7c66f3328fbb283ec01b102671d1cd78ec9a989476a3d2accdd5ef80999bf87ef6b4a66d829a4371613b4b2fe5ab39edfc20fb4a7ab2ebd15af5fb90af808d85dd9875bf0aa7d9578bede035edf2aadeb976bf06969c2d3c4765508423ffc9b0039885a53561f35d1b3152dd4c8a08c387274124b09091d93367310a7964e463eecce9856e0b53767d66937eb87c3b7e2765050baa0f2f10951343deebe0b9ed8f910baab1d68e1a0196c0f84adc089a86ff605e8a3e4d3eef3f8c7fa34a6c4c5618fa88bdfe57a016f8fe30affeda5bc7b2c3cbeb02767ef039294113dc6352f5ef8817934d0f18afbb72bd57942e10de1564388749f9b78cb94bd1b28fcec1bc3dfef4fe27f05b8e68982c46039aecc27a5599bb1287871f801cf79197d0974c6ea92c6c4b066084db434bcf707dca50d35767a3d09bd50f761dbc790f24e6ce6174e63e1aedda11754da560848a77087bc734b4a941c6ace874b88cb0cd522bfb6978b000ba929112ca3612beefcacf89e3c58bf8a752ca2f5f066a6765ac8e401e3085bdf7e577b469899d1d74cb10a0c64fad9a67b048a01525cb39bea47a292150856a5f2502d9842666355ee23114c0ad21406ada8e8b71ede6390b61814a8d3eeb3cab0a4f7ae2b55a056c4ebc93819ab0c62c87cfba3ba92a0838f692ae66097829f7b09e184a09543ebb8e16ab6afb4a5efaa088e5062859a178cc42587194becb610ebff84eee2034f6729d6efbb48c459eee423e6f8032cfccb2f09d846b77b8974e137e8c5c9f1971e547cfeb5b02ffe1550cbe95aec2f77e18111f59d4b580e02750a581854b56b781bce10804d23cafc7cc9e993f39d6ee65afdc7fc05caf587a4e2bda8b13df334ea7ae239297f97df75af63a7c9d88aa73413ec4d588d5d82d579cc62f71ed55b2321beabaf3b051f2103d99a0379a79f7e5571c75277182113f094a7713d62332dfe6fc6c8bffcddb1724976cf7d5d9bc8f8cd1cd371969a7b8dbe5ca620839d332e7151d6bbbf756f256f2c8a50cab663037402a5084ce0e3cfe9f02fa284b92b067e53afbc769e6e3a4528f30427c34aa5297723bd20f9713356dea03ad2ba2236953e4369c8a890f2970dfabe5948df57e6a9ba4c91caa3778c4283d39e26f6929082ef712e5278bc1a0612fd35a4649751426e0193521f50dce5d159e7a44c373e242863f16378061c1ff57573aa18b4c6260244be1fff6bfc500998dd158e5c00102ee1dc0ccbb191ba20cec72c33e7de425b503000000000000000000000000790c06706c7c53b7b3478173a77bd0ee1d8c7ca85d04dde7df8dbdbcf99c2058cf44dd9712c9ba5905edda0c3114340ba8fb1d8a34290ea7c03366f92ecb41f36dee256ef4d4db128630552560c23e5f53c515139d44d1cf8b9e86662101f93a00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d4223a32723232581d50ab8536ef9b283b5ed8a2be936984cbb1e9049a0344510fa1e919b4f3fb9c42656b5cd71a47db84b22ee8b8302065a6a4d455f782a70332c901830056ab0d59dd51b32d63c38a6390205947ff008010aec75dea3346b9f494e994ba0003c0239784cc8509d6ce3d4de43d4eca4fc832b6df39728f782272deab8891cc18027aa85bb32437c490d5185034e6999d3f02a1e4d5c6e3c3c6c01dc283ca46996364f1a7eb84f89bdfe2f4c1cbbb3e3707e9ddee1ecfe831058c9425d5bd3bcb21157d61b4654f7415b97ccdec008afd41df539473e49a3402d05f57bdddc729b0b23caedfaa4ac799d59a2bb4497448a9e9ed6ccd64674ababb8bbb909a95ee46e470ba8af50b2b91bb1b60d82f06ecc624861b97dea8dcd1efc3c00f76a48cf615d59f9d89b4dec481e6f6297c1046de3a15a2f856f2db166dd0b50cad0b246f89a63396ce60fac6b2e99bd2efce89bf13f1b9b2a84a0b0449f3a908f51bc13077c7afdececb20f90f41e2dd07d4e577a09b6c22fe56eabf91a1b6d78ad4586e3cb84d163046f7703c7a1dc8e29827c66a88b2f3fd979fc20e5dd83c7cf56593fccda8e8599b17d70ced3d60bc3b781fee025b76d115ea8d54c34ddc25ce42a1cc87aeaa07ab34e7e75f02e5264700fb80b57018dd438c6df70563d72b3f3eaeb57132b0721b76fd3eebf13cc629e4e2406c1f277cb71560ba17677a9139aa65d2384da109d5fd6b638726546e46d33d1bc255c66221e643150de2d3ab8c5ca8d73531733669a3f1f9a816c00cfcd3c9b9c4f10872d08f19b2f14b352936bb0143a33d8afdb5327da1167132d330c3bac9a7ba5b0b4c88eac7f9a4742662a24d0ca603cc9f978e0ba34b13a6948fa68e9679789bfcba0e1161ad7d5530630d37a6437e22fc55cacd3dddf499d2a513276646d368209e048d620a95863038754b53e35b732a815ebc8d60ff3355dfc1a9b9dc90f9e6816d6650be0292e259005104de999f6f106848f3614efa3f80d825d5d57affceee1805d56ee72f6474b5cd223116a5e13690da5590c8dde26ba6e4574726ca3942a35fb76f1606caf8274eb2ed8ffb803e64edaa12949cedca1dcfb8bdf201560b1078e0c1a1dddde91dc1b78bb8c7209d0bc45722f12a1610abe0c9e0b87e70883f213457af292c9367bb96a66af53ee1416651751b6b8a902075ed392b543f71b81b5fdf5bcea3961ee79388d4ed154d65add42b8e5cf42d7f0ecc504412a0516fe2a72b04085a7d0e75b2a4e730d42a907c95fb2265c9bb4fa6e7cf0733c1ea003e9b9cb892237a4d23a78ac75fe34ef393a96484488271e2d6100edc6f8e949d09eb69a2e3f7ef89e698cf288dc6b6eb1d33b5c9a08e027e7f95d8f4de93636c6edcdcdf7a0d456e81a67f3e8fb51b5a72c72ec973cb2b419e6473e37e72eeb9096325e02deaf023aafbcbfb8b828649f8a765538ca16c82cde6937b942d607b7eb1b42cba1a33879169241a77442ec996940eab9ba4603edfe2caf6f898cfadbfa0c8b8f80d67c07a16c9bf1d9de7795ada93de147dce8fe7058fe18e76b2aed5e428809f9d1c4e133b23b33a04407310851691838c4b564c809ba3d0e13f4c6711aed2acefe13df3e1ca07a4d2ee15475828f34c472ddf8cbf1fc5c23186911c6489265ba29bc6e9daccabaaaa38e6505547a0393e620aa8b00cde17d124317fe97c0cd11f177ba1b6cf6c7706eae97633941edb3fd9c599b057bc2ea373fd7ab96092ab860ba05444ddeadc02c259debdee36212ba043fa92d7183baf9da5e08b6087111a86fc988e4608a31196c05d34db7bfb1be8f2125830300d9dc34ccced8c95ed5d26f50ef092a369baabcf8523197172a65ddce761a5b58ef57ad9978f7d68433a358daacf2596afbebdb4bd6149ef46d464eb1bcd8e9587c7db9f77b0de9fe05dd14cd1f3002f7f0555dca20a67ae04ccb605d51ca1fbea55cc35b86fe4dfd07589dffd8d5a8133fd6f8657b715b4a03368b90e788e2d7c09a9709fc15105248de23c0988368c33f4af186980a009c80b62e3d847b6459176601a71a7af0fc2cab08c73cf6a5965e05c266b8963d114a563edfa69df32a790c8f80ba00e60a47df951385257a4c4a8684ab4eb14c7277fdb2a2cfc0fdce51b09f17983e26942f6483581b3767429c102ebaa3e310f1730d61aa40bf5f2352e9c1a31d690d301a0badd65ddc9c657fb39ec493a904e7d58830201f4a1c2d8813691f1e3afd6b333bab23e004fa4da953f0a17180600000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "6363516565", 0, -980942363, 3925833126, "687a47139c1a6bcc092feb9a31a8e568ac6a07c37bffb20f66ad313e2483160e"],
+	["64114672018aabbb7d09474b94917b2472c63eaaac6381c5c04c3a67b653688ae4550c94dd0200000006636563655165ffffffff0297a1cd020000000001630d875d0000000000066a656552acac9f23505d00", "53", 0, -1642963481, 4179206552, "e2550c6a93aaffbc6cd584f88a15b8afe9948c380cec497009659e37f6f4555d"],
+	["59ff915603bd502d89d8fde2d383933b6e8f31f1a45b95d41c1a2c1ae19a650858f894818e0200000000fffffffff71f2dae207644d82c397d1164151a7b98d19e1eb343c5d15324c4f2af69f1340000000001634f624e3cb5f9fbb7d57bc73210b41c279d880ddbeead6d4d10601aa4924fb6de5b9ac21d03000000026551ffffffff0246dc2c050000000009630063526a6551636374481f0100000000076553ac6500ac52078f880300", "516a", 2, -1338039070, 4122551051, "c820fa82aece4e8aebb289643097501445f54bfce77c68d1ca3f5003a1883382"],
+	["2a11e07d025c35daec2985791ee31915af1c184a4d891742022194a24ab35e6c0cd602b3170200000000fdb99bf08b9c562ee38c2340585d3737306a6bde997fbce8f8fbf42a1e7bd07c1053d7d2010000000253acffffffff04b177a301000000000151e0303d02000000000251ac09808003000000000552525300ac5c858e0500000000016a71bbcc9e00", "6500", 0, -535865282, 1537743641, "c4551e260fe0d6f68b8dcfedfd1b8a9a829afc407f49f3765f81e9dd53eae8d6"],
+	["030000807082c403021adbed987e30e923080cc2423df6450223b1051967bfb0956b4412bffe7c7c670300000007536a6a6aac00acfa9ed120702455307fbdeece82afcaa9282fcea6aabc791fb1516a9c8c00d97d790a76b70300000003ac00637419017201a678fc030000000009ac52516a65635265ac9f733feab8490a1800", "6a636352656363", 1, -253875849, 733220448, "8dfb4857f144692a87941e61950d04899fccb5d356e23338504d908f7861959e"],
+	["7b220303032d54f203348f01efad66b1806695e2e220e9ec08c94121a7e079a6b4118915a40300000003006363fffffffff4246b18232c74db75675067b5447785b839a3261b888401b1fdc0ab5ab925670200000000ffffffff9c61af153aed76924dd8d1dfd16df64f6fb490a0d0e452c1a5fda2b63e2ce77401000000066500536a0053c2f7777f04b5a96704000000000252000e7184040000000009630053ac536353006a4d5a8204000000000563535152ac6850bb02000000000652526500516a72d4f58900", "656a6a6a6a630063", 1, 1884134298, 4179206552, "a199c40ffb9f925c31bbb986a438767e0476037dcc65717318dd5926806f3f8d"],
+	["030000807082c403015eeabed45fd052ac308b1f4c66e3b239a97e9da04b3b1203b0b3e976de84daf50200000006526a516500004c009f99036c05f103000000000165e367e5020000000000c94dc1010000000001514ef545e4cb61c20f00", "656551636a636a", 0, 922857378, 4122551051, "3546965efe2f708bbf578f02c0236e45272e99626d1c04d7b88a37fab2a579d4"],
+	["030000807082c40304a2c94a639af9fa07cc092d241599dc5f102e8eb0a73d6f264ddee336be5cb2600000000000b5dc291b3526fa41a503005d66ce9990f1a64833e1077cc3b1ffc42fb22ae150c5e770f7010000000500000000521930692e7582c0be34c972e934dfed9ba8a2c8bd0cd6e9c422926f18d1001b4308b7940d0300000005526aac6aacffffffffbbdf99ff39ddbc985c3b6f5c1a8ab657474eaeab5132be168bd7bbc9f37c8d5f010000000652005252006a03f4a1b002e02f82030000000008530051ac006552ac74e9cd05000000000000000000d8f2250d00", "5200006a516a6a", 0, -1811760672, 1537743641, "26c2fbe8e25d7c0f44b5c45aec7555638b8d26479f085d65161e06c81322a141"],
+	["77d0471401c02812a3ff7c4a52943bfd62bb91d6746dfc9937f189a340daef151fd1c3fc500000000000ffffffff0139337800000000000965535165ac636365000000000000", "52acac536565", 0, 1339383891, 4122551051, "551d40265ee7b3fbdbea8e16cef5166be5fcaf33987cb0c4108ecae8ce126753"],
+	["233efc0a045383d723fa13744b00383c0efe5c4e9c18885f2e6731fdbfff3bc92a65585934010000000100ffffffff0cb73860e4d4f26d85debf8316ef6c5ce18f17f5f806c859a5801abdc2573f1202000000080000525153635100413a862c76320918cfa2b4a38aeb517959b5788b2c3b227caa79777c0da9eadc49a28916010000000951536a51ac526553526081bf973d9be8f6f6b6a557ccb09262e3fa2f5e198cf851851394f8a4242bf454b0693200000000066a53656a6351ffffffff01b745a5050000000001000000000000", "636352530053", 0, 651033717, 1991772603, "373e491e9b11f7b802cc20889b7943f0c77799424f8913375aa524399f61f011"],
+	["0400008085202f890433ebf6deafc66bc1da4508d8e43a6f859865dc4ddb5a1d22ac5fbeef8a7f12b701000000055353515151ba05dda1c4b29e5c67b85d1271b66f95127f19a062a93a6939f1dbe584bb807febfcfad20300000000ffffffff29a834911f4141a32cde61cd11b0cbd60179716d2cac3750ff26993f2b991370020000000465516352fbbbba301efc65b7cbef0e570c7bdea10657f8ec5a40a065af451fbf4ee07929824848f4030000000963ac00005151ac6563ffffffff012a20410500000000036a65000000000027addd0ff9b8e30300000000049c8a2e409b910d474ae43ea53b1eb5f1f9a3834dad50b40badaa4735eafe8fc95085b048d65bc83aeb7a607dcb7960863ff1e68a4a407c3279aaff9e9ef7892d8f1c380d87b88feabaaed84a701b22c4e0d77c31e2b743e8ebf20cf7fddea1d70089d7332750ef8c945628c7995b9a168ba1f8c8bcfaad00137333637df29dc124cb94672099ab5db713e7d4604f1b94412aa792089b1ef258809a4a630cab9ac3f09668dd67c3b7415a521a8db0697cbf7283c6f3d5ae3d52fb95a6cd68401bc34ab3407668be51d236122307dd83f8ea9f817b63f60f7bc89f3c3d61b188fcb87583d6e44821515d7f24b2e07a6be9ad4e668fa9e6e02ff0b7ae2cac9677a53a4b0cd246aaa70f3982489d904d14ed62695ff27322a0b44070fdf744baf80d2a43f653c6c0b7a2257ac99039c768cab2ea7cdfd89ff0fcb3affcbf311b8d1bd6b333bab23e004fa4da953f0a171806000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000459aafbd0f9b02c2080cd0166c6c4da042d3303950644a7c55418272345b102b73b0b168db9b0a5926d95323b82884659ec7f5f003b6369418a49d2839a8a50dc073d57aa432c00e3530db774dd35ac477130d7ce4c988f937f1f16d3b01c3620818d63718b34dd1d8390a604aa7816196c08999e2ce61dd6bbc22d9c8d3416380d25eec2a87c754bf261f847d2dfd2539e375005af20d4d4bc4f126e04410c69e36a529b6d98d1bb540047465fead394e7901932479b9354d0daf7ebaea80c3d7ee2d4a5de8536c7ae6a25b25fa255f7ebebf24b1ccae5a3b999e2de060b6673432d39740420574a020c888173b84ce5a39968846cab499cfcd16bf3f673673730452fec69ebc93757b06e33ce6f82dada7d96e5bba155d465f09441376628ea870f7f2255856698c45bf04ff6d512acb8c61afece1857503689b24639201f8d6b333bab23e004fa4da953f0a1718060000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009daf4c584d0e0dc5a9ee1376f1002f2e4d7d8d35356be8338ca73bfb29e645c387fe42cde6b9b295c59d19188179b7cd84269a79e09f00bec810f91fe711652142def01bf5c5c39d090abcb6351148ce722a65969abe8252a58ee764d90ff47c711872b4673f95c9b5c734594dc729823b0d41ab7c01db87058b69e173f6e52cb9dcb2affba7143d07e7d912d9714eb31a298f84368ef07532320552861b1b5ca47ac50008946cbd8e90ffd826ae78799ec1f8b8446b81bbf19d715de713a5268d9eca2d0a17e3a2c1f4b9d52504270af39b189d3c6150395bf730fbede7e937a0bee6e27cc67264038eddafefd0f0c86b0ead7eb0cb26ceb7e7c0d4184bd61ac4170437db0c6de3133b955589b5803df9403110f85a1ec120b47cb7f3f2de69fb8fc27025e426a98f3a5041ea7e4801a7d10a4ed227c188c0d9076b875819f2d6b333bab23e004fa4da953f0a171806000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ed7ee048607650e722d6a919ea1eac9763bf6b0c95acdc623a2ca0a6902c48bc2057c87c6e2edcb5e14e1f4ff64b4d2b1605f92275ae3704ea6c304c380699138759b64b7f98797e07e5b18db8f6687229bc6e653f80395452a11adaac7358ebde79edc926b80b4c228fbfd8a40c22fee2b5d7892ed6a17cb12f0cc4a4114927fe7837c74c2045a53bd4992bc0213e1d456c4df1af1ee18e33128a23b3ced584bdb196c2b00f1900cb6eb1174a25c33e710a2dadfefc2210a531d4413ae0305c14ea253882a8179ce3950cbbeb44f58e74e6920175016a9c74785bb22a3a1676f7a12b637642670dcd70a0532a420497bd77d089830fdfa56e6ade48f32f312062cab347cb821ffca2764735429b1825681efd83d5e3e50ea82875271ac6fec9f9b270a2c7f83e923c2f3a5d89bcbef0b6f5fe9190df0e6a988ad8c2cbcb59a9d6b333bab23e004fa4da953f0a171806000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000040731076051411b9380a2c5de17a16b349af463159b8917755fd5f869e6ca600a1e917eb26896777d5d6592effc892b39b9c79b222cc5c8c5938be0f80bac7765a9e06de165b6c62ebbeb8f7a9b084b8b57e53a18e59ff236cf8e50f6e4e923e83d426c420cc87a9652849dfc2c43231c5542ca98b98db5b4bab0771b19a8d147a3c4f4b0a06f45d8dc3a6942ffecc98a916ae4bb6fda7c3260e8429df3ba838bce4d6f7c974a520545cf5505565d9bee6b5dd24ecb5d56a7de0904871685c3e2feeda3ded7745689a0afeee63051df3211ec6ea52658f97fc68532ff72a5a24a277db778cb5195d81307878076d617f5048c58ff8f33e23042e818e17cc49ad513942c361d0ac08cbbb87235d280ba82e691bb2bd9f37d8d7b9f75733ecefa0c44e0cc09301a1072797d6000dd5da519ffc863688ace3bfa870cf2d6958b825124f3584dfa98528af01343c810248536287bac1ae739a9b149a4e848fb0516b3e6edb4aabbca28271c62e37344138c9dadfe14e3816f83b3e8d6680be05e77618301781e62a6b632ca44ac9f22054f8976fb5e1e6dacfd85b3c8162b0595841f209071972c042dab76f71d29e9e2401955d2a024b0c6f163a53825716b2b33e3d03590029ea76cc4c613893a978c172c0b16c38012e57ea327ab2a11e2c1f593ca59f62c65910427886121db5aebff5ff4c8807c2df561872d21f9b3449522901afc1d592d73ac9b7747887efdf091e1189e8b134db0004b553dd0337a0fe5a5ddf2a4f8ecf156582a2e2961fb75d7cd9a04a39677ab4427361e0403ec0b8fea520e071d2d2481b11ab482cd56096dcdaa45c3884435007a9e10c5ceee29c10ba7a7c61768f5234a75d8cd74a02e8f99c299a87f57f3f3de65398a674bd9fe289c93246310fdae02f0024430bfae259e56ac9a958ec178463b5cf6006d515d3f448fd281351882c1808295f1c2f88075a16199cc35afdb0be78c83d91c4dd53405e0937c42c70cae8775e598d32b04d93a7b1c1dbaf5c6035b28d72bb9e53f6bdae72c9340862a67b4516f759aa3fea9951d94bb21dd6349b804ccf570a5eb8a633f244cb89acb7c976ef6a5729a9bcda1f209f926c18bd1436fc9c3e36ecbef4aea390f2531ca017823a8bbc19ae58406822f26da4e9f7a6a00d797db85afd60e74f17441598cf4dcfd7665191e02a18cc79fa65de141876e5a71cc97582c26872af9ac21a21d4e68b0ff027885f931bfc0f2beb95a9362c846274df9b368d039cd48f48169b2c07fad4ef3c6cbed62ea4c66f51e67bc05b44bc405e3c19cb033709be01362a0531da1c5b54058748138e35eb9457fc17ad0089e73f99905a1e75473efd26a04744e4fe782af3ed57d783e0167183297bd627af4bcb2451985778a5e725c1ab15a05d11722bf81276907e3c4395a3e38720e1a916901ff5032127f3deee114ecbd497c2f970a123a6c796fd8c0b7a9c9c42391fb19a473769965e79637f38c5264b53d31944044a74b29ce3bbc578b847885b2f57c6b63715b404901378f8477d8b70a87eda927842a09133ba98238d23423e7691e580b385f8d03a6d10cf3a540e2a8acc74dd47872f2613a7912de1c057c71942a3f97569646496d023b006d19febff10d904a7e968871bfd327fff6d4472d3f2b2a91cf29e6b0294ff192660fd614bf4225fddc1c55da487b82d2c644a82d64f7c0f5f5aac14aed6514a595c737b7629ac9c487ef9b99604c30993fd22455261cf781203a80c8791e78c9a857c9b70e317380d84d1a9bc166dc8dd4eb4e7da1c38faebd3ae5196569c70d61f5e3baec32b4274a086e43e895e6c18914e7305793fb584443bff3567580ed01ae5e858e12bac86d3369bdf2f95950e6dd3bb73dc4525f58501c712bfb806d474bc854ca963a170fe536b7db8f661a5b06cb06fb75eb349d9523e9532a0499f5298dd79af758287eb68c241d0e1bc4b51b192fdc463dcee42be6938001044c760e9262f36f4e9396d076d2089c8bb639bd949c64f7b2ed1f403a617a6e66d5b29249b18728ed7b776aa1d86516ce853ae23174b4f32dcbb530611926dfb60914c3d11f58326a24efb582dd4e9c4b98702492f6f33560f6db773ac4f369ae0a9ce01faec1816f171a2c27a7d3c9dab3ec8016c1de2cf58062d6040469d7c716f0801e6de6254c063b6132efb0d5931b89983530507ca45e4c85b0561b76f4906ed6ac045d206403243a7359b3103082fadacf81af62367faea8ebe049561a01870fbc643b7d0ba59b3182b56c29a49a2594544cddf752cee2c1390cabe486919a1263897361ffc9c9abf65ebafbbe926c0afb4cca80a7a8db011febc4cf93c207fcb1c2555c63cebc924fbed09882f94fb3abe1b6f06cbee7e4afe47f292cbd6c30f8c9659f80bf652195885858ba259d12c06b86e0536ecef51daf5426ca586c83e2ec9b5b2a46003c777f46b971fc6c3ccb9f2c05bd208cf8d9bc5c540d20cd18b5fb86a2e3ed60f41f08afcbe00899cb33be405ddf9b597997e7b2f1a6a6a7e303f4b53ba081da14ae6f8c813693589ac4acdaa6933471856e6c58081dcc32974ab077c1985046caf231de61f66f10c09f57bbe48d1fcd9369e1ba88a1c4052178f356c3cf26218d207bbbb574bc304a1be2e3f091bdd3a82595b92d19586e028b7b38f1e1fb59ba4c2eda09f2bab9b1b2bc0560b6c00066a185ba0648869fe2432c0116d57457d394d91a91adc23e147ff7f65a94c60383dac3d8a26ce5bb14d4095d636e9adba63b75738101a83345da56933aab6013226c0968d0d49383d4e648cd40f55c8d487e0826b8e9b55231eb5d38502aa7f527d13bcdb97a1a7c6f9a5adc5193441a15ce0ffd3e2ba30e5a6d5b785bafea4824bd8e5f38924f5109fd82e94abd2f82cc1fd167449fba6466ab7d93effe4e2e3572444d5a767c45c69ad73d966f282f561b0e98d55292474a49bb5c6c8eea809d2ee409eca130148237d7dbe5756a90e547063dd6542dbc1b2516cfcebbd7c81339c66c76c405472bc6a55704c2aba710a1ea1f7bff88fa2ceac3c303e90fd90757ac1c317f28a9f9244f3f467f5def7be81825da80423f0633f8f130e7c3d1a455fa3e84726511c9efa640a6efab80bbc2cf1dd4f76c64745440933e7ca30c433bdb0dba15bb039a2ed6f99e6356477cb629ff646dfe15d92f5c40c94241bf03077c918e577a9c266c73e63a65fe310280d3596d4d3d7d0bd562e84439902f6dcd91c23ca9d59383f2a35c21146813b155753d2ac40bdd5562a2738a00031f7e99223c92b67cd9869747987d37ec9417c84744174f46cde1c5f31fa607c8a539f17064f002ccff0376149c554caecd517d06b273c436f5a08ff6173e49909ba8e71c76e5ed926341d57495e0406c0b6f0e55a998e5300bd2f1b75c4d1b2879b63d9117664faa0d5bb7f95594ff229c121f811ae30a72b8d8431eab77e5146de6d0e3896d3f4c1abeeb80b0ac90690aa38ea10aae8f623c547cba6e28da0043d2a133ab38a84dc95776167083634487fa24d8a82aa2f67efc6456f8cfcc0a6de46c2aa2f2a52b5b176ee4b444728a794ab917967381dcaa644df255993a10b6eb8a5ff29f3e34ac1a9725209c0af5416721fe722222a47b40b0e1fa26bb470ae3bb0f0c31d613a67a70ea8675feffd16feaa4107527e01ecc6b333bca5a51c5a725a9f25239428affd363e7650cf1a33d07256b10a3664f3690309dcc316124bd984136b0747c596e912d159f8e7948fc1e430bc5523c832eaec40c4fc84deb25609fc66e53c04809ef2d7bef6b42dcb4f8a2ae528a5a10c19ab30403dacdc478e66887a22da5e5f03b9aa2ed694e1addad03b59affb5458c9896877f654421f1deef897e8978e62dd5f7ec9cd6d8735d8f5729475e18949d91dc3ba7b5e0278b250c40c2ff76916c6dc869638c264d7ab5100fc8f855849be8f88f28317a68353af30900fe4ba98027dc0e7408dcc0e10d300e35d13818623b51ea931c8cb8661da9bf96539a1afada83db36fbba252a5086cc2256e97689d81002b5f6adbef08e57df19c96c5635ac7eb7adda2ed3a24b51756eec26da67555a7031571bee1e6a4a364c0749eba83d6034ce823cb1372ef35e9a1ead74e630b3b1839be0a6e0f0597ace1ed79a5c0f075effedef74dd4d1fdd084371ef04cecc04aaff66e5c9e7ba9ca4b31f8f989082e376ccd74c91b17049621b8ce39f601739643f299d7344b7cf79ae7fbe943ea333867093ec71cd71bd30d48194810b508b662592562f4876a53b517cb79a74826064e6b1b6da21b86307a5cd1eeeb90e34a891f464888470391745538d271a7fed6f70a3743142cc073e5ffa80bc73402116ef2274f1dfea4130e6869bf3a632f8d9092f873759d7c0a4aeeef0d3c61285dcc863f673512ea064dd0110c3b06be7bbebe4288feff7d026a697db380119040efdd039978e125b1f3eaf6d312e941456b8bc1bfddfb476d1117f02d516e6dff2133f02cd70507f86439a97db0f2b5544bff91b00037261307db08d312ea28c23c18b3fabf44c5094ed56302c18d1e1fcda3b9d23dd7e54a30dbdf6d35005186465912cddc2c3cf2d5acf4076be6cbf4ed16ed9d72ced620003e1cbe98429f8cf0392854aafda17f710b47ce78ccc22dba53a996d0539d9da9f8baf0688c6148e308d38a619f98e0fafe3952860dfb1a0727c6abb8e1a9c3edb97eb0f731101b3ffc5f82767f999e8af7cc7ab4bcac958f23ea333c231e6f44fcf8e2cac2cde48b0bb0b8974a406cd048b15a12fc1cfa4485777c313f47071b83b26a8e7c12474ef0c08593fb66709ded3fb4d8938cff3178b7cadc7919a2a59e8d0689a4b707061c826debb3078b4f616aeddec97c9bc07abf565031e36a4c8c11a1bcf3a3cfe4e2e3e6836b13da21f5704d8227d81b3fbb2ad639820d6b2be3e5e75f032d80f9e7eac0a1ae61f07ed33a144922bad53a4c5b2a07f4176fbf2ae2d61af1d5d87da6c116dd379836bf7be54c297865abe10d8ab19d7e77222ad868759ca853cfe2137d6ab5803077c5b341ddae1874583f0bf8b6b03b2398c5fdc42babf24687f9749aa0fb70f317feee7d7acb49d2060570a3a9604a3de2f6f31347b77173f8f73a03519fd5f463f876a107dc1c043945ef1d3b13c80eeaef03fe219cfbb1deffcf83ed8a085db679233efcf5382797b29b75b2028c8545c61236d72b83767b141c0a294c0abdbfc61a12409157ac0b345a1e524131efe7bbb9e49f53997527a98098e49f13607a13de40bd43d33b66f25c0b3f8ac71c70d657f7c5627bff6ccda295d3d5da95ee6c925e80d536ccb6d6e7310c6020000000000000000159bef0100000000a114750769f09ab4c6fa252c26c07e9a816f16bc4eb370b0a24265dff0febd9e05b3753156e554370ebe26962bd5b5e6c5b0b5088221a8d718d21acb6b85915b4ca810aa1152beda32629c89d2e4c5787107747c1eb1739891a136af6439f7a900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000a20fa4fe59618b4e9ba40539119baa32166b80fafa4e170dcd576f96d1750e88cbb49f12f0d0a24fbbc24ffd5ea000eb39c58473c300c787827f52b795052ce11166186c9fb3a2b74fb85b4dc32900455ab0054510be92388ee43c96d0dd883c55a69d12fdadae44e111a53841ecc9076e91e0a9441cd0afda4b2be75196571ad6ac5d81a95b421e7b4a7dfb4296f268e49ea989e805b8cb26fb1822e124f25856d5b3a5de8626a2c1a141737fbd8439f64a96f14e496cb06c786e5cbd2d48a0d661a7ed586467757467cf70a982c568cf32737165da7ae820299ab25a696c4a6be6a0066b83489caceede12ab2951dd104bd2b5c70d71ef7e54b5594e6c08948941a749556858b6516f949945f7f433e1e8ccb3a6d2f233ac7ae26496eff19476b64070a269e8851a8cbdb39d08067ac1c45afa2577ed55bf409500485d9c02fb0c2c11b9277a150039f45b90cc2333fa823c2c36c205c941de3de4e9ab5b3bd0b8165468231f12d46ac751c0ccc3be2c47fd63ec9a13d665ab51c485d183954f74fafc73aded3807ddc7491eedde3814cfeb6d2e968847a983329c3b71d7ef7ebc967399076d83bf69c9d1f2ff5dfd9b1a835057d4cc8d99f683c25c4cfd6f1175cfbaef884316eea62a222d652ddc64b2e56a79a98ea9d27344ec44bb1fbb9b4d9e45f99a1da407a1a66f8d2693345cfee4a68ad8cca3f6a8ad88c05a19031aaa75d2d2e0a89f8ebda44e305ecbefb674dc1ed07fae189d51f965c4fa8ee5d26be42c565cdea6f24fe07e01e48ab87ea16fe5c658580200f2513791b89c685c738ed522ff2fc08f7f1d6412f5babb6ee87d3d731f4b58f75438be654c470991119e33a4a7d5c141dea981b664fabef1becae9eaf7df2dfd4f759542d5a8fac00de7d89e700ab8d56d53b0a700ed0791c0f12f3600d983bd79b258ff66733161675ce19c7aedddc621ec77a4760f7f08a5d3aecee6900a9970d19ddbe90651213aeea970b5851d5387fa1aa745c9b4b356c89bc41ecd4c332338e04b4bf895306bf3cf742bb613f115a21fb7602da2b2d9cca68e45dc5d8f145b1ca16822f898e84b9f5c74b09807e456424dbe9f5d38218d762b019548a63d5cc95c9a047928c970112adbc493baebdd8636d0dbfc5403e427b0564c87595eaa860066b01d73e551a2f219ae815c9d438b2ad3846bfda1a11b77136ab4259243fbc1b9ce1ac4e2da40a7485def117996867af1693a456cf8e634198cd89d76a27295e482a2d2c67ba104138a881dc40d2d704d73f0768df0e71b3c9f14d8fcdc8360a23939236208b03139713ea22b88972a1e9a1c63bfb0fa39f0b096b2d94e2a4fe1020d53bf6148a9dcda849333f18c3ede85804c851ed76f1176cdbfd49a8010710f40864459c165aa4f7ffc2318bc8540d9a5ced4409fa8c42a523f0c62b67c9d4f476e2896198bda1a212e423325f6b78199d804577c2e6579d0be63ebae03ca3c545e9462079d44120b588694f19f34c5186e02c05717bb7f42ce462acb855fdfb1544cb4570db9d31b487b6bae9b917c9a203ee8d7824ed116e7f4896e7c01d1807613a717a4249cdf15cfd95cc6460ff5e6d42ed7820282b81119c70be08598161108df62b6f17a69954b8d531dbdc1e8b690e72e48f62227016265927ffe497f165282ab48cfd8b245c6b7c8278d0789ac7bf267404432f8b0a37c1640acaa5882a156b8c705bd55784555e9a74b9ac48de285935b52ff98db76f1995432be052c924ce120db134b812043fbb691a6367dc4922e9fc68ca54d4c7479261ef326cbe38ef9d7cf2b7e79067a23e207626de15eee5c09fae65e353bcbbb04f2fea4293a2f4edb8a65a47fc3348706fcced19fd18484678246fd17883eaa322fefa38a05d8cd954155ecb491ac257dff6634ffb805e418c4201bfe2db3e1fdd704d86d9232c110177cc7527a44fc46b5fe2203953fbc963ea413429dc27dfb747be10ebfaca12e74a0dbbe5873d527ce25de320dd6c54846b5cc15fe76cda611da4557294d709ff12acc7a06b8b01e49a083e718192242574db282b1a883ab75c75776819e1edf70a81245a130a9f51c4d17d64a795f7cf56c2255119e42f8efd5c4e5c8cc258d218e59b2ef965a18e60e1beec50000000000000000f491a402000000001cc80f19de68efa54b608ee2adcd44159fe2b50d6fbaff5504b22c9bf9a9f055f97e30dabbbf5fd61998edebead7a392af1b26c29998fdf37eedcf05610c654a0c1c60ab923efb448730b99321353f66357c2817ddeb21aac736c30ed712e88500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000b931c4948e10c69a89636de9489e3da6caa47112734486220ce054ce3fed9ebcdc3b6b9abdd819b87941f44b96789a878174c42e4cc5ef86c323a2e4e79a0d5c2beb9af43fc8ca5f5f2a137536b0797e3dcec04921cd1a80dc3a01dbbaf2aa88b1b6ad6e50b10fa42af7cdc7244e8dd6eccb57529617950a358d8e19da13c00defc3ed20761082832612f440cf805a712ebf35d443b4dcfb39901b401d447f41e56dc8f622f6bd688887dbf700e7ecdc77c0c7e56f124bff49a8f269840be7493552c57dacbedabac58954873b002ae5ed98494efba400e1b42cd13d0f4e02b09c712cda8e899def3697e4ff880463eaabe30d077a45af05690b0f6eeef705de3ef361b7a6209d461a5970f01765254b18a25c940833b6d7d30e83707ee1eb8fec580d7768cce9629966de919cc47a01b6ec6253c78dbbef41ff29d62ffeddcda7fadc363a4d400e17cd1ebc7c52a47aac3e4cf7c710b950de728a9ea4c42343f8e69ed32aa0934a3fc6e5a97c61a1eaf18db14074d5ada0636dcc495d50ac2c0c4a33ec95d0b17b7f950ca1a6dea4fa4ace12cda19e7f8da2be8e084ffd19e1dd2f605c7e96e5a88c3fae9caf4a298f5eb2626eba15df631bc90b325ac4953080e4565b7a9352a3184eb4a21c59620b6782b774659cbd369f7cdc0d74f68ae0c6054430faf175e24f5a6bceeaf0f77076b3831e1a5f8afa500921a4a10edffeb53b1379ef6eb4359558f0d2eb7f776bedb36bd52c9526b7ab90e01235f08f3bb418521e5925070ce32594dae400e1a23cfef9ea8e41684869e37a36da7828b41c5ef35c3449b09fc8eefdf1f10e456fe087e8706e7a93b5b2422ba438344267e4738fd86201ffc95a69869c97b54fb596bbeaf0a7de15dffa1f5714353c4360c515f2aee188c876ebe3ff33ab8984818cc857425d3af99c884c0e151f9325b3028a6c95ce6b7d424fe26d6f6a0e3614afbe905017b48b643d7d6ab6f3bd51b3bc3bcc25229384fe9f38a52dfbf8ff3cc58bd0c7051c121edd6825b65c7586f1cde48121f594107818a24bbbf2971dc29b9b99306e997c710007e9a48cf4ac5a77a57704903b634ff218c5848f7cde1968a7c1c30d5570aa5510b76922eaa855c1e85897973b8d91590f1cea2877c4437aa7ee561ecb646dcdb9a5a59888a666ead975798e04b5f4644c01f64b38466c4fd282c57c4f76072a69924a8d2b231734dd6d6d4dc27c11488b55916829c63cb249055e53fc953adb89ae9463fdeecce70121d30e08dcaac2374d28f4db9939fee9b9b0ab710a3ee66bcbb5c5296214b4d63e77cf750426d1310f5111608afc30f749a532d19a8b5bc49fd316cb4e783a758d7570773ccf54e058338dd3181c8e18b986498666e20061fa8be5689613e816d952f80fe8e6b874d344ee72e3a1e814656e643137d7e0327f779951c3413ef201004f523fb4686c8d3b9d73b2c0f4d0cc595e1bd3b3499286c30278cabb3d04dbf6c409fc7359e00891327f2a636a69acf207f1ecd654982e3b152a0b03c3d35345f67f740e0686760f0a3b99eebf5868602babbf8e53459d8c1b0d817a8a5ecae570ca3e4c50a499e1760b2e713eb338889ab83d27e9eb7c972015ad4c6782a294495c751d714f8bf2497550fad5ff3b528853b0031d7cf6a6e12661bc7891d49be91b0faa63b7bba12412d8c7d90fbae1d54d564e58931f02268241f2b7538e47d8d3aee247e17710b4e1e9d46eb14928029a1bf183a5b48c43916445901224ffc1fc676cc0773ece4fe77247553a6f72e4bc72e84f8bc037d5d352460b93025896063b37a2074093e412cacd7dfbdff99c69a43cdc24b01e981097b7e9cb920854049224d44d7e7c3a2ed9f335d977e534910e8fe941a2e11ea32153bd64c397088136dab4c8f1e123723b740a00dc6fbe73518dcc4b88556dbee9800f5175759f495e6fa726a8f8564a4ce05fd2579829286a41f14aa74118567252a81b59aef13b408f984e2774f1f85abef05e7ab234f2e226557e38007818bbe5cd8bbb01810060f1acc10a64a4bf55a2a9fb427c76e1b2dfd5ea0a894e358d7dfff84518203f8a41b89c91406f00252c99c9c53ac895012fed500a262f4919af5aca97802dbe7ffffc5e74cfd0fa699cc22e2962d82f7fd79c1db9a4f9f1143d7be43e5bd75b931fccb80e7e3e3b5fd9b958cb752a455a570568edfe7a54f15ee71c4ecdc83ef1e74dd6627cd572a2b9bddb077e503747cc0edb8ca7edcf97452467e78ad672f166729c7f5b1c5a7defb40c00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "", 2, -1434801918, 733220448, "7fa57e5b35de5d6e78ae4da57f7b070d6c511c2d7a207e01cc4cdfb189401399"],
+	["f62e417b019dfd02e31809db4d127552756adf7f8c0db8cad25ceae14cbbde2fa425e3b5640300000000ffffffff03d8fda60200000000060000656500658207450000000000076a6a52acac6351bd2f6d00000000000651536a65006a0000000000", "53ac", 0, 1321390450, 3925833126, "8268e3a2e21b6de35e57dd00b98259414ae2d44cb5b4b485989dc3c417cf71cb"],
+	["d6cfe45604ee1222c4508a93d2ea88878bca9882a8bb29613852f0289915064a775c3a71c10100000006006353535363ffffffffaa384ab2b6f6b2bb88eeea5722083a66f260b853e7c3eca0addfe22771bfe2b5030000000765ac005352530098bd31167f0c85fb5decd304fc95e823d33fa688a3d8e493dbf7acdbfd1514c351afaa090100000008ac006aac6a51006affffffffb89904ca37a20f72713cddc2167e6e0185b0cee7115b0f4b81cb88fa1c995e8f00000000016affffffff03d4410a000000000009516a6a516a65655151273a57040000000006ac51ac655200d47df70200000000000000000000", "", 2, 115384016, 0, "7dfb71e04a010f9672d70deeae93b42df4a2792d65175e75ec9a4f2fce9c51d2"],
+	["0400008085202f8904a664835d3cba0b5a356933f743c340368081541ca261f7ded33019fb2b25aab6010000000851005253636a5365fffffffff0c0493980acc1adc8f0a49fb67e9a6828c1217cb23048f876ebe3b925e4c23502000000000c4fa972b6dd5e07d9f1e0c15270d712f916d8e3d16cb871fe2ef26badf2ca4c79587f1400000000086a516a5200515352ffffffffc0bceaa7dd25a752a74faf5750a7b12055329611e893164b4b25617579d391cc020000000153ffffffff02030f2b020000000006005365525353efd6ec020000000006510065ac536a547b6e11f1c75b14888126040000000002a072d5653eac9ddc1c6fcd2834d22838d1d6d15e932e481fe67db60b3ec9c348b4e94f7777d7eff0df43cbe72620558e8d998b7a75e0bf0eedaff260a48a1b1405ef80c1b0cee040774afed6ad3012f91e70111e1ccdc8602c47dddaa691b3a01a6eac798b405d6eb730283168ba39bd75b533b5f6fef7a99fd1878717805cdf57af72774605cbf73d61634961a1a69866e39790d2ebf42e4fadda3f776f80e806c1d341e47df083357c20598f3ca897ca44bf5e51aa4fce914f66a3f096f1f26d52d2231b845bb02fc0aa2e7e36c26006d1baf3d93aeee2dd57319de23d26480da0b9cccdcb00a738ccbb4d192380df1f49a353c5bd2db4aaaf74918c09e9e0749ef67ccfd3be02977840bc82b05a8c2f266f33990599cb3339d4bdf19a3de46a25c02f22208c89d42d7bb91c39632b08898234831992808821d22556b54889e78ad672f166729c7f5b1c5a7defb40c00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002270ce6bb553a9cb465276f377e7b24d565f3ffa14b097328e727e24443ce5673b75c3345ad1aa142cc05d2028b0072d777224e51167a48939800e8a5acca4daeafa87bb5b29620d1a149318693316aa9766b0138b2f99bd5c69367599f6f1ea96915712887eaa89a26b1e2bfa7334aa8d70425a4a04475be569881de784109571d21740b08f45116c1794fb6bbafb87c4ba2d2be308fa1e765bcdeb855f4556a2eda63eabf2c99e9a83114ed712aeea6f29635209d7cf252a59bf7ec8278bd0e5d59215a70481236805eb204f89b8890a842feb7b9eae8b03722a33fea23f46e81afbeef19feeaa8f707f6d5bc4e6b2d14623fd34de9155db2c78de674f20c7fc1a53be6183f224ac35e0ae799baebc854134551fdd5c8d4c76a422472f4cc6e29d0769ba990fd97f5cf36ed69050b5ce25a2090aedbd016df5a27cdfc1869e78ad672f166729c7f5b1c5a7defb40c00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001aee5bd04936018161bdec4a7ac852aeb8183e5bf9541cc97a4de19a9e848a2b49629e7a4c79c7a20710ff525de8243ae2dd42eb9562eb225cdb4464d8518d425bed068eecf84e23013b1d55c1b12c74d80da98a273f15a0a44ee37dde928ea8916c1d4b8f42d4a6a2914dabdd6e5c2103889e67edd279da95bc77ad2163f1f231447d925f5081d19dc0a2421cc9067c6732814cc1232514c7122fbac45d44cbb23a75cb08fc9cb47e89108947a5e4898909a0b1801d0daf4b989ae76d3954bb635f071b94aa5e7f20dd4d685a8c9313164c4c6bb4917a5a421ee8cd78d290cc1cd62828e76de6f7574a90c10a01f937049d6278f9c7e4b72b9f2431cac47db5eb02c5ce63f41046e30b667c2f011d0cc20ffc509a47584daf0d1489c583b02f9e0ef2f18a192b64aab5c945dabc528d01523b7b103b4841292105355c6a4f3ff31de4a09a9bb2bb54c82a631876c877adc131b1872cc14827fcc03bb1a125d4474446e307b82d0dc42e5f33b07d324694053515371eca7bd48e4603b384e0450a09b58f03eb3dfebcc9e646a2dbcf26ba9b293234a69f2156d1370e52d5f8e181ba88da3d8358f59215c626b763fc7c2ee6e4339d9283686094715098b777b5fb25ddff17c568f963049220d0f0e3d19978c9281d08cb56b7be01dd80e2d1b58e5b1d6e369269be32291f9fcc1bc5d5992e347fca7b2e0b963240a533679bce883527ae958fab4970bf45a09576144d8e8537d030049c2af5d24948dcaf0c83f7f072dfaedaee4b8cdc730c26742ee1bf946c93e4aec9886c224c8e0a1e98c061cf3f69034ff56656cf4c0c9a7893698e919d005383ad03f441e3bd028895f587e5dae36184a81828e493f6486836a477f2cf973e586dd34dac6fb6c71ec0185896775223f2e6eb56c79a083fa2bf9938ae496298d0f067ac58260fecd9a8d7eec8ae456addaba35110b3ba911e1cd519c5fb1112433839f9ca657108221fc5c2d42d51881cf9a6f48df6508a50c1eb7db154c3bf264be4fecd71095b814fb26c44e12a7c0428b7b325017ba7630e405613453590cb829cc3d738490b18b61afd56e8e463ca3a8585938e20b67bd3ea1bd18ae3e91a7bb40dde4e6bebe2c332e5cffa275602f46eeb95d006b32c67aaa85b2660886895689a481b32022d913c9e209a07eab288c4b15584766962a13cbbfe2fa9fbe7083e1aa618bff613b56baaab5b25e6af4091d6dc80241ae4dc891336b259fc3523ef013819af5a6cf03560753ac1b63cfde0a9a476a10bcd82328ef5a6a861d3d4e6a72353ea72a00c3f8c9498eb8f9c419b5c6956f25847ab1e598cf1c9101000000000000000058c07300000000001b6cb09b369d16aad8b2c8f5378a7468c0a72d1d2761161a6e1feb2364a7a23b0614618ee9229a428dcda47d26fa0fe82d7ba01823a3f851d00b777d313486ec0c66f87dce22df192d4da851f0ed2d64079276394f9b5533641f2961ca3a09eb0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000041ae18186c49b9d1c037e052547bf73294d4aea4d45d24bd9de86d97474be88fe34834be20ad313112b517a6d9ee5c07c32ad5783f7c33e0e2a9512fee267d31e39f38ca867cac301a9a2eac70a23620870acabc03b2700f8956cca827e3c275750a1763c2bfb6ab8004db51ab695b9dca6c8431ea684f5daf2bf5873e7a7f63ba850a7e55ecc06c8e6aa1474db0b70db61b62be1cba3d4f48621e0c491bed333f67c80f0da05bbfbbd4c943c1ea1f71fca13967ab32fa41797754ae5b0dc2e19e725d2c1fa3b0562f55b6a91f3aad2bfbb3db6bb324f37742b42d2ded06a71b4bda1b94368aae31e2ef8339919b9ec76324ef10d2c551403f934289987a1eefbe077cfa814fa9778203f3dcf2b6c613606c1125e9845868ea7d50f7ee9bea21b1bfa79295f74a41d414ed01fffc5910a43d6d6ea35a042da4f2af991e6cf8f66a3d8ed6ee47f1fbb6d68ad5142b3161d535ec86f717eb896ae7b9444ecfcb5535f9ec246888a7b455404b7ad0ae517ccda83deafd9ba3d4928be4a43abf68a44884fb1a3af7bb4cfa988428c162b2eed56529e3255b8bb18622a33507cb1f5f2a3fe0c988b649730901f453623fd1268114dbde5c0fada14256c3dddbeac92a74201e651b07fb43e3c35f9d6875d2c124e34650066da6da1bbb6464e187e2c4fcf5833a42dbf69c6c43494b98e0b7e4727fe641e19dbe226835ba4ced1906bb25569bea5c4e52c48239d0ea5ef5674d25694676a8fc09706498f0ed9bdc9280aad13890e9624e6b549b5a7e090f695a54c9a9244cde4369efe035b412637b172a7890090e7550e5dbce01bc3d30a6db1bfc3c3a04aff93011d0e5495d26b1d90953f7c5ba4381e5aafbc785611d6b329fb140fd9ed44da9b540e7162d6a2e5a882741837e48a665e81cc65f1b5912060790974d97046e8507b7344d66978d504b38df84533490b340bc3375f546e6d251f31f4560d7b77c3297f28e51e8ec04b4dc684f0821b374ae6d2a8a1eca9f515390144ba2d2e1a08525af6a3679b91572bfdc9bea9ba05208f490ce941b622bc8a9979e6a4e8d5f6d5157d6ef8fb6f4dd97ca93706910867f9ca7e1b99cd9f9afe217b9cdc974ac12c8ad0df650ce726f21ddeaba57593c3d539c2278b8f01899ccfe7ec16d05dc3cdfa219b248ad30cd30d7ec2143d940e60293b557652f8749ac402a036cc0c9e28747d13ed12debde03319170801b2dbca30f10e4629c9260d280ef9817722278a3ac24955d02ef3ff7c33231ec2bffcbdfa0da68ebc319ccd7926e08ddb9afc654a28bf8dd80b336e9301fd50ebd9b28d221f944e004036291c3e3708420a729a7bbf4929f5c4f983717b9f99331e8df2e571529e00ca4d6aa1915b4108a0ed204afc764a571d3bd376934102173558b1fa3ccdfd164e07e518d1452f385e7c0e54e8bcafe8ee03242719f1d69537afd79f68ee688c16a82123255446466d6139ee92407cc1fa0118817735268fb9c00cda1c856a0198884d4f4b89c595288569777526506ebded3eef6afb088944325b16dcb53ccd70aef94572fb67593b588df8d1de888eb5541c5d670d0fcbabea0b8fa362413d1419f02b2219632b2a15790b5047b3b9146eb4e1556f624972f4f62a2c9482279a3c7bef39b344f90d67a6d2c95dd41a541b309710ad4334afc062329b01250abe75556505d9df0210d1a4e08e02333ceb1bc3b12a43d4a3eb5be881fa695cac0cff7fe47b8d8d0ed1b6fb934235802f3e0fc7a676f894f82e784ea8128c3cfa0dd938ae735ef0cb901f8c7f4911a5bd436c44c8f38f1a5fc1f389fdc784624891e007d4f4e161065c20f34c06c8d09915866e7e542042de43820a9ce6b2009ec89688e04dc5107c8d466f07cb6d457d0efd25181d40d2d70c443c8aaa65226f280b501672570c3a5beaa5c31db01c37c0d58f249a7a3f59a041129ac74a357ab68f296a084ab45f442839bb2e37fcdb76a5a5187c7a9ea8a3270cb47c3d402e92e5f05f833a4a95470c0491413930e7014f5d85b440d0f9322daccfe1bd2783c026f2b284c734baf6f7898af17548c160c0013ce8f220fa1cd1d6fa88458fbd8b145bed23bebc36e93bf74553f742896f1731613393eb1ff9742c565e2a159a23aaedb42259948a8031d08b312fffa2767e44fb8008bdb3713bfaadbd498636a97500126b5ba82a983b485ce01bff6d415d0f129393b69e48d081c00085c8e5a36351cb60118c29f1d6256b94abf473154e7a60e297861604538fe2e35231655766c0400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "", 3, -2110593793, 1953719636, "c05171c47210c078d5ff1eba8379ede63ebf90cafb5b7a9c24a189235e16c2c4"],
+	["030000807082c4030365e341e767a266b71d700883782525ad4e44f6eba69acaf714337cc0c518a2dd0100000004656351527f5bd5e4b27ee990f15e31383837ce95975d6e5736fc8c8058d780c8e5fed527cf86792a02000000030063527bc478a48cfd99fe201457538cb9253b30f050d03e39b25ca7cc8d1b89e95efb6af5944801000000050063636352ffffffff03a5a537030000000003ac52002cf31a0100000000036a53639e6d9d030000000004ac5263ac000000000000000000", "536a535163", 1, -1155270941, 1953719636, "19bccdba7f3f62d349a05bbd731d581542bfbb81367875de1f461006a63c7267"],
+	["09baf0330311a32e1aeae2eba5ee5b107d8b93a62ce56a0c6f13639da98fac1f28e70174d403000000006e09b6acaf73ddd13d7848286e0c636e4c043f02d4f1a6bc0a55dc0d352a47720d5fd85303000000016a2033eca0a2937e17f8b38773550dd73168e413cbcb0774c66509985db8024cf93bc663f4000000000752526365acac65ffffffff02f0c46e050000000008636565516a00ac65d42c93010000000001520000000000", "", 2, 205465108, 1991772603, "496d33ce5c1b2b989c455900fd06c96aeb3d8f89a13fa27c51c21caf711b75f5"],
+	["030000807082c403041fc2b5bf78481a5fd70a7a2ee7756a6b250ce68e6b5233db369390c9645b276801000000026365184de9fdcbb0d1acb81b64e22eae0ef95d5db7de9b199cfa6445451f809b899aefa41eda0100000006005151ac636386cf4328bffbb852c5059930f59b0836a3700940747535ffad83dac23b3985553b8728b70300000007ac51ac65535352ffffffff5a88f3f68d0759fd0a0cfddc1d760f34ead139d63f2e9e9c6c2f4676eab9ad20000000000200acbeecbddd04ab5786000000000002530048e79201000000000765ac6363ac63539d314d02000000000253657e4e8d030000000005656aacac52000000000000000000", "53515363", 0, 474500544, 1537743641, "0fa44851e0c120894fd209ef9683fdfcca0292204f913c8c2dd87e4b11d72328"],
+	["740d482c0493a4c1d27c88dc55449ac8a1df8828675c61bda14529b3f8a3f93873e2b1f13b020000000151ffffffff31bb0a96b0692b9a17f92ae5147b5e8e9aae8639bfeb8c8cc34c5f17145b10bb000000000045d66c01c79a82d7c367709fceff9ed2e2a2371033dcb1fd6bf4cd82ab3e1f1ab941b3c500000000076a00ac00526500ffffffffd2afc1075a4c364c99e730e71f56ede584b9acfb372a70d3ca2e64b9ff0ea61100000000065200656363aceaf377da04458d580000000000055153535165c9241904000000000951536a636a52516553c6ec59000000000007ac6a636353006aee083b0000000000086563516a63ac6351a1cd8c6c00", "5265", 2, -1275115598, 3925833126, "3b240c20c25c6e85aaae7dc31066124d0fee0ffb0b8f6d78ea25c23cad9d0ed6"],
+	["030000807082c40304ecfc7b20d335a27b848c0701ebe6a58bd291c3dabc9c3c8417f0e5f73743cf790200000007636a63530051003c15c81cf4822a13834e27caadb9df6bc0aa505f301becd18de5d1655ced2e6f7b675659030000000353006affffffff174aa155d3f53626123d69a1a483314e54665ccf642da969175d5eef2dc8b650000000000200516811501a9ca9e9054d33766ad1b41874592eb26ea8b2d92a3f1d35b02d390cd6bb070fe90300000009535352536a6563516a5c68ddf60225bff301000000000251515cdeca03000000000951535265656a65526a000000000000000000", "006300acac52", 1, 1811676553, 1953719636, "b66fe33637ec08658754de65deaefbbd127f7f52b1a896f3e6cdf8a716f39efc"],
+	["030000807082c4030483c933f16cba623b7a498ac52b72c06b6128d7bd49b443e4ec6c386a6db0beb20100000009ac0065520051ac6a537423bf75c7ec3ac9043620d7452d83a6d9210a24bcc5e95d0d38315df90907ef4de119c0030000000765525152520052f5f1c23ef87913c72ec758f6f0272eeaeecacd0581dff1cb0ffa055bda93bb3c52d0cc800300000007525151536551ac898d76e862d5b0c606296531b611746f02eabe40fd2fa9d13dec27870365f1ecccedd366000000000453526a6a9b34c07f01dcacea01000000000351ac633df22c4d0000000000", "5151", 3, 699434420, 4122551051, "463deac1089e9ff76c6eb18ed16b1574a7d51d424bd1ed82c9c10cecfcce4b88"],
+	["030000807082c403035ba34931e3878b0bcbca05b6da472928095335df652276545b26ee716c568f3e02000000086a0065ac6a63ac51ffffffff1469d88cfd75db4474c2aea12b43d67e78867f64a3007550dd85e412b06e291003000000046a51515148434fb76e3d13223455ebc0ff3e511ec51029d6f62a0e96719d50e68c29e5253f866c1f02000000075200535351ac00ffffffff048ffa2b000000000005526a6a5353701ddd030000000004ac5165525f41c20500000000090053655251536a00513326040100000000056500ac5365000000000000000000", "635363525251525351", 2, -1169890386, 0, "a4a89b2a31fddf978487688bc565d13561a1a6905b6856ebccd3fac41ba532a6"],
+	["030000807082c40303139c47ceb9b5ce7a20c3f4d77d441e62278d11e243d09de9cb341903341e8c640100000008656565635300636a91e9bc28e5dd4f56b4d0aa4111ade4c89b5615f0fe6d044a2b66ec92dfb7403d8fc6328d0100000005536552656affffffff651d8d56949de102c9ffec7bb5c0d70096949c503e38e9f21815e75b373680740100000006ac5152525353ffffffff02935ebe0400000000060000536a520011194804000000000952636352536a6a00ac0000000025c7751700", "000063", 2, -173331522, 733220448, "98dd7451cd36653a949d752c1910df3454d736c08aa7c6edb1dd421cc5eb51a7"],
+	["8b0cb07c0394040b60c7436d73f7fed0678a522aa3ad60faa1a83dd0137599ac745fe2b9460000000000ffffffff17ee1a81f40c3349c392b695f8342bc92d5a46aedc1bbe558b533b28e0c0c2030100000000ffffffff5f7a608f792d9d1ce1e4098bb88687a17d61162153f6f0a6f525a7fd1087c131000000000076fb787101fa1463050000000009515363525352ac51000000000000", "6a", 1, -1106875474, 0, "5032ddd00274d6d1c351bd1ad2f85241eb548d2f28c96f4b0dba16125d215505"],
+	["0400008085202f8901814a259cb64e75a9835b5d006442eaa89111d9c9a70880d46b81a8196a516fe602000000036551acff2f8fe4044b77d3050000000003ac526aadc0c50500000000007f433000000000000751ac515163005186954d0200000000016a32ccf732c6225b149211a30300000000019ca8ce3952ea624d712ec5bba4a0601d43b735b594a3475f63351c35fa4738e394d8888449c8688c8de04610cefb0a58fc27ca09e253e1d60467a7b81e1a0900f99bdc9f5a7c30dd45324eb51ab8af708c6a8e1fdbbb4309c91aa262a2f6e31c3ea0b3762d8cb3cca8d4e20b84878255852d91898420098db7965163dded2dc8a81839a05d0248f63315c6e9af327de28591bc48eded6980c9b5a6b3d554a5e79b4e2ae1af207782ac3c9d46f1d925ae57dcce910e488dd137a5194347831696ec50b85ccafcc58ec65107fdd157dbadfb81492872eb324b85598fd8d06ebd1595c2b455df8c61dea938c1f32ffbaac7dd009832a5a6879de5e4aeb437d4b35edd02107243bb7dfc64518e2b28aeb4e2a30404c48e44766693c00f6b6840851c982dfa8bd1879218ed52ce437c8154ad01af29506860814b53784354bc249ec80e297861604538fe2e35231655766c0400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001dbaa643a891091c2f629e79d6d4a1c84254f2958b7c4e7cfc0f9c200f4ddf84f680c0a8b2bbd5176d0902c5161aed13b8d1fca18684fe25e80ec3ecf3f1e6649b406d56dd120b219bccda6130649e891da24d001cf98a7c2acd2cc357e72ab3c8dd2fd525d0a35804d1eecf838fe0e2a58d4b45c399fb1edf24a2d257bdcf098d4cf104e37418eda4a76d695b4d653502182a332eaaeef8e9e0c90b5478cfa846dd68a58c7654eb92a9e1e735d846cc715accfebe20c94869f08f6d5d604a69331f8909e00ef8a820861b24ee7a17f0edaa5f21a845a0a7783c9f3a6915f8b37a9a70096459d74a2be66fcb7394663c2d5da136483bfaac6b0fe3a571769905ed2039ce839dee842a9708d616d7c6d13cd19a6942ee7877de1dc401c962a300084078c187926c836905ddc245c644a85c73e7df8248f99d4938fb507860e158f554e91433c1742f9356315c3ae8db36187e129fd6501e0df665492acdbdf982e1a3cede032430a824fe5c380046ba76c932e5bceafc6f478753fa7abea1c4d9ea6e80b01a9c3008c2e8f508bbd25b367840485a537a777c8aa4fbda96e2876566bf1d4f927fb014ff7ae5aba203de10dd6ec9a97eb5bbd0115dc67efb8172d099b012a8b4e832212283315f90841e6510ad0bfb4e563a929f3e7ea135f06671bae10511f20fcac164942d579f47f7a4e5f0fb6d2dcc014c048a540842fcd536d3282405c485fb55c6cd9c067c88993470d06e3a089c673e8353c7ab52e523a45c0ece4455756451bf2feb12379d89571a2eef2c987a210272df68c24a0a01d27092987ed906b864de2eb28e08761087120e9610148169018d6ea0e71bfb628e216002f94b69ea03732ac61fe761f0f60ad085bf7aa7fe6e4ea9471bf34f21353a281f2e9fecd64f2774bbcc8370d01dfeb2bc3572591a4440ce87ef69d195abb1e70991141c39a1473df29b7c660f8c44e787acb6e5f12b08904d53138114db6bc0587987078cefdc737d8c5a611fe8e8f17f5fb811080ffe87ea05ed2a0421f49d9aedf47eab740a3c5b3817ff4a652ddb85bb67506bafc76c01498b0bf512a18d6f5096bea719bd891b607706742d90c85230bdfcd9a043b37d3512b84762cad1e01122957c4b018675e4a8a97d9671f4dcad77e516ec6e97dfad6ff922a369bfbbbd139b32ffe8576ad36d7e201e7d46b9affaa4ab3a280a83ebdb1a93e6ac4e91b0f8f874561b01208c39060030549a07593ad4d82dee9eea682035986a02b986e158f5efbccbabe1cb73a5d87cb0081b742b7ce6be1a19bbab5462fccd47800808f3f8fb27c1578f5e3f9c0c01b8c87be6c01c4b8240400000000000000000000000019e13148be8f3eea0925c3334eda9ba0688f01adb58556d987bf9cada43845e34c5ec765acb0f8ac98bf1eae8b4f6ec7a1e10411dc4b9d136c99ca06f6ebdb1e55d9f06e355d50d9c285bcdbae639b6a8560bdf8b2787b3b33dd72ff19129fb1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004230756f97f88f47cb6f6ae6b9a0c099cca9fe7136c66273f5e4718ebebc48fe8246b6f06d376931ee027c8ca34fdd115b9b350d39ae7d73bda694db9377742e051cff3bcaec36d1600daa94eeee70e533000edab4724c65f8f13cc6a9adc2af8127bc81554a3b12521c46664d19862272c30da98addd5e682d398ef63b0ff1ecd32e56b4e60ce7ca2bd8396582f9b46fbc736d70da55882a01e3580c7d785637aff3338bae9be9e5a118066740408071e67da28fe38e718afe1694989d1bba4b23daa54a956feb2f953541523c218436b5b92ba21113f50cb3e957e90895eb0e5e91ecb3e966698b3dfa41cf73f04be9cbfffa634f341ece0ff3d21c77b88b40f8162a13db032865980b017d80301428996163f27e815961958443205fce3e21237def2cb0f020d4038047c0bc32ee1b939e1b68d3cc28f879a252e2956946b6b761b4641417a7851888e3434deb023598a7f09086b4dcbbea93f02a5f334d0d0c441e807d8284cd5744e570aa65e3a8f33d05360260763c165166e85b410424b5b0d6ddf49125c4b9dc77e6caca886ff99840701730fd593bdd9a40600aa0894290db5a392de7ba3731db5838142fa225c16fc1269bee1a7687027cfea6c2b5e46550fc36c69222a38705485a6ab17e2cba31795c0246d83a8049e361f2e7ee4ccbfe6b0c52bf01dd8e0ef556272cf29d283ec8b557b496e4e36a4b86c70d524563c2867ce0546c5787f0c5d1d24f94b4e9bac4edaad6527bfda912c9dae56b0dd4d725c947d0c69ac81736b323811708761817c0cbc95557e60653db7bb9800187a7e027dcd45c4de6fe24d8fe1b2f7088a48ec96a66b9e71aabb2f75e7393a2e1608db1234b126d9d8a5ce1809be199cb1715d646e41b1a236f3d296b9b3f374bde5861a39a7011ddcde3ad066531f0ce821445c5a59082262422a4d00a9484ecc8eb64abb8408bc3c2ff5c83216e88e291e33776600aab27e794b02accc99bb005c71e80f275de514c57a7ac8c74a59cdba88d6be9affbee0bffdd21f150e461d7e09dc0d606d1d6aad8ffc5ff035ad5c2de4cff7d73776056b36c82c177057b2d4e0d6ce40ac9f5bf510427c384ef606c29f8c853503521fbe4516e9fc4316863bbcd448f8ea82b56ef198071542114e94b5843c526f1129a640d0b908727187b6ce00bbce65b22ef3d4a7e532eb84ac5128c41a0d820b2ddefea39cf73ca11181448b8f47b4c036fa46650d0fc5810658d0e473a5e82d8137395575fd0f2657f8b639dac3fc9db7b4e1a592be3028b4bedbb7d4612bf4319d6d8dc8d19c7d578a4e44bd02d605990fda0bcbfdb0e04e95016a65e3cb763f369d70554ecf17be3dfa6aacc96bbaf2572704ce551c03c8577a299214242feaa730b9d14961279b254fc62f76e88b991e1a2b7b2bb8a92218630630e7361ea90a117deb266e6bddad81e95ee9f190d696b0fa82730fc6082bcaa72246607dbcd20e0245c4b217e1c856e3a136cb2397f56ac7726fda4d10b1e7e1efa3282cb293441fe69db0451d11363fc76b1150d2d291ddb436e2845578564d333c966e2f862c6850ddc3c0440004be560befb31de9739c937add7b6717862538986c8f28751723fec4eaa8afebe20d6bbef74a5a7e2d847a8eb179e46e159325b6c43098e63863307914b5a5cff75b87d23d18bb67d1ab792bd8b64a99c1d642bef171f514055e34063a7f7e444fe4c9bdea484933ff05f44b983a8983b2b7f1fdef8e1f937ce278a14782754d77ff62180f9fb7d4dc571490ca0f90fe45254b9188a161a6d7695a44d385bc1ddbf26d6dfcfb2f25aeb803be9a0f63718b4c4c4bd4f07dc68010b6ca507ec00f5cabda6b6c57b560f362b9b889c8de8bae8a440a1fc6bb4a94de4b22598f3ca0f5218a40d4b5077d902c9a68498ada5ef5429351a121652d79391f65a8d5b89f726022faafc0f1e47ccad5fd18f69780a59639e25151f85a12d15cf382a77588c226341237b8185d45809d9e326661db29622773c8010866707e196a118385761141b1b5f8689b1a3adcd8faaf712659a39ff9650a811de24df60e4d36732ed778bf4e6a89d0e1e70f439e34f52274d5309fb0ee6b9f5f555f8d98a53ee286e68eb866234a1311318e73547d74a161ea30ee607922e2a4ae6b951adba1075ac318616fe225e4b42b7323ec73a2489adf6999f33b1997ca5e0c81e14c9b61f884d895d2023f0da7d813ae861ea574aa747c36f41a13ab3f07d8b1bbb850420d8aafe21b79480feb97f3e880797c0500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "515353535352536aac", 0, -258027617, 1537743641, "687249b4ddff0e67d43d357b792ccaf6269c36e55899a6742d54957f615b3304"],
+	["8eb29659015b2ea11d947fe73817d0fb88e8276b33c83e6a20df801446f0ddcf341ce3a781010000000953516551ac53525165ffffffff0246efea00000000000965005300ac635300653247c8000000000001653ad8249000", "535100", 0, 1487116399, 4122551051, "81a4b9872ff60412fbb4be297e21caf79101901ff0942ae29f7065fc79db7daf"],
+	["030000807082c40304531ae3da1162e1ab74d64d255999970223f53113880193511e4c0760ddbedecc00000000056553acac63a16608a09b7ae30d5425dea83ab6248a8db2832a3c6db0cdce0bfec6a8462c7f4f520a270300000003536352ffffffff1bec9c69ff9dea87cf4ec1c5223d0fc3214ce431b82258d1f8467cd922a672160000000000ffffffffb32e231ed42aabe624c971147b9d8a495d2641c365c90f6dd2a0bbb1c0b0144c03000000076a5252ac6a6a52ffffffff03803d3f0100000000026365ca17be0000000000070000635263516a2c93b301000000000553516a0053000000008a81390200", "ac6553", 1, -820003571, 733220448, "ee5a0b51671a9d497ffd2581add5c022d3526cfcd4dae3eec50868c0bc1fbdb9"],
+	["0400008085202f8901b07bc5fd42f10c66ae01c7f2e4fe778d6c536227dfdb77d31f6f42228318c5ce020000000851006a656a650053fb4a70ce048c8d1d020000000007635263536a5100f862ab030000000004005200632a8f53020000000005636a516a6a8156280200000000000000000000000000a5397004000000000277020472e3a4f0946d2cff9bb02601bdd216884dd7a303c97e50091dffbb2deaa52db1eba5ff0db6be49972781394514527d9ac8f4fc86ec33f7f745a2796b2075462a35c9148097e1c3b31d216edb623b6c59c77176563296df4e1fc4f25c73209c6871d5abd5c5588201c8262628c110c83f442054f90c3ed5d9e0d52872ee62e9299fca511de67fa1dd599fd1a502bd081b3c013e16d41cb992ead6950ba76c560964d77cabb6b968c1eca6cdaa418defae7cd9de099cd8ba4296fde221c8b2908ce2f524ff20a495d7ba18775fb175bdc9dbdac98caef98edca720b3a18f97ba350e1e6c0326af2993e8a2e0a26c6dbae2f6563cf1c365a0bee76223307c2f4867c551a7475520bb1bf307c3d2325c1ff5a80b223339ed556f52987b934e599b7b327bf88d527bf173791489cca54fb5f23c3114ad4b10e895b9a37f4b270d8aafe21b79480feb97f3e880797c050000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000005604f03c85006e695c3017bb4084b3c045e217758a47af866502118e63cc0d4072426241ce66221a24cd66ee905af2bab87510178cc0142ea58c58ca3dfde33eae7ee515bad53a5809a0abaaeeb492b7062e030cfacdb20ea58344b2d096fdce1fb81b21c0da382738d70eb20e0a5c0b3f7e7948bc8d266275cebac6095150cc95e31cb621c3d0ce16bf86809d58d0c06671093b37c20849a6fe0d349bff598489e57e432109ed8a0a3bb296e8acaab9b18e1fc9cba5d409793a8d9f2916ba12375719f4521fcaee821809e988b91aaed98d1e2dcc4d6c084aa25b367f5d4b621ac6939f374dabf279383b503d9ac242fb5e0603667ed661c8b5e7c72092d5787576cbb86cfd44819cc416a9657047b05ffd71f042970fbcc0e9d76f04d95b88e659bd5218f3d39732f04abbf9cc3a6cfd1a2371c4f851bd0b225845f4b804420d8aafe21b79480feb97f3e880797c050000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000309fb849db01e2242e5fa8afea25beea07eee9abee7366a46ebf15bc26c763ce407444d2288695e83c92e7afbdac441c3dcdde25499913375e5be2d79d0d5c63efc31986ddccfe56c2ef5aa0886272e318b7b9e9ee27f29cda376d87541f47c6972e755cc4dc2906e8ad82334bbf68e3f175c6682abf38d45b180966f7830f0efe0abe04e2df2d60b6510fbc911166b9418789ffa53492393f5ad6898d852ab7d0297940bee94002e7ae749b46753840288ecef7d52bdb4a234bb8de7a404b35c7201d6b444272f64e1f5ebe1a97879a4d1d5a45ef172e8e9264d52ba2066ee670a02a05642b8c7921a92b7a55bbc659d335ea3c1b5fe368f984dcbf62634efbe1224f953ffba395ce56540cef09637a3fd1c4b6b79b3f0676c9a90e037a1940c81e50b9e508fee3e24d5de9fe4a574da4217704bdd1ba0fdecfb933a2c6f0f61bd20cbd0248c97a8f06ca7cc4bc7342e57327862a5850aa011320fd239e7df592b0c740e9342741cee7f755a4341bb5b19e6244cb8486682ae508ab2d8e0ec0d2c3798cb5fe513bb44837d00324ebd01bbea7c9ff3f28885bd3e85f51646d027b68076fb323dcfd639869b2a7b24a5c82cf13b33ac88c4a1f4630991935f6fff324f7d03a30a0643f4746d027548023285de345a9ca8b53f13698ca5e986130e2483d316926bf9d0ac36b9e56f502ff876477050c2b9cbf98d31c2005e0936e2eca0c7416ce59044bee8605082587806410ea6dad4daa475c484a599b13fa7e259e9ee0323c8209e32df72200b88fefd2b2d5911dc65d832c68b5e5eb64a7b839f92ff17b43a894f21b2d6089cdfb330a4fc8e3bfd140129a5c2897fbea20754cc06e2040a680ed6750295f9daf4dde9ce380fd8bbb09c922fd3b94d5eb5022d0eea288f13512b557fdb29150c8766d9725d16cc410de53cb4d672b333f3b5de00882f34b2ec48749dbcfea69af60b4241881557a30d1d130ab079c2f72715ddc3136c25a367f8f7e541a807c445ebf4b438f129c5d2771d7c492f0cf3cc4585e4738103bb96f871392cb6798621f6ba962895cfe2ed1910aa653791e35cb157d748248410014afad48f46d9721d41213c2d311c1fb1493c778ac50c9df00b7c17b583d7b6238d82bd28ff499ced630836ed7a25881cbc3e21b8c5fc4d159ad2ebbc405c027f9ab6fc10c601c62e76aa6e1d6c084193e19712d46a64a674b6561e2f1ad894775bbd570e8c388cf1abee47e05b78f2d377b71555ae7d98840f2a5c66da35e4f4c5fe82a2f993f2ebc1a1d0ba17dae68004d1adcb06918cde2197b7af49525a967a79da3f4b9a27d6ccb4980e3be562304b5c64d85880b13a6ff88198e775095b96381ffd23a4dacdc6576219442e71673850c3589c14e8280cb920e0645c63cf2f0c8f5a3b2f47bea1cfcff33758f4f114ceae1bf331372231508e2f822e5d69d13dda775fbf61fd5ab12d234a2ed1a07206540d43e3f6a8232ab2d6ef4d05b189c393191c721c0f0bddce34e70d441c770a697d97a072d275ae26b4089e936b33464984de6d2d56afcf7f2206a39f1e6aa21d61d472a3fac2046a3508adff4fef38e5fe372f4b491fd45e3c53f7f0ba8cdf4fa73ce0fa5c9810e3a8904991827a93d89556230513d3644f2b0a58439ff3c0180a8c6a46b4aa82f31b493751bfbad9903ab664464a09f6eb544129ba51d1c3b475ab8ac84abd70ea990fa994abb84025093d09a813910aa6423dae6108852d81ac71f57f4737b2e1a62330b4b4fb117f003d42df751fbe84e5ba198dae395635e78fcaaae478dc6eec7b6d604e59e88cec0482e90b652cc716c444ff87fc3acaf4443ae270fe9246eb65468d2bf5ca5c62f20372a04e565d19f5ff83236fb9d81b10028554dd76295fcd761e86ffab5a632a2763e2c9d67164c25eaf36b4cea3ffb7d41e466e5956ec44628b3e4282d31ce360b2967a2545ad9e0b738bc560bfe281a96de5dd8b8f6f1ef360bf9a336bf62390e4d22ed63001c9b80706a2aae611b5b2fc3925e832c8d08e010fcbf5b1603efa8073e432cadd0df27b1a38cc5269958a17b4e9d32ac12baec1c1aac71909982ee59991b79c40f282e52b1ffd4dff5bd3545cf4d9dd71e942458f1f072e224e2d558b749d4ae307d384f8fd8b1266733435fbb004ad3b03b8fbd0261a2816ac9a6d68b655ac1b8a82cf7d2291c6037034bb3ba85a546c4ddabbe0220361b218d0b798235d3fd3cc17c31c8b4f221e5b9d7f4f294eaa9aec0cac83d387abf1695b682289b618b4ee6b4f0c56d3c4f69ed470c4147b84dfc32364e00e9bec36ce22f4b379f2053c27277516f8ef2a441f9062e4753ef9d2b442e7168deccaea038d3edf5dc215be6cdfc305386f804e51b5dea097353fbccec6bbeceb5ad77b243d004d53113aa3e8be756b9c1d9f74834dc534c1f3934302fdeb9100b0f4c9fd11d010bf08680ba03b326aa00357fb5ab1bbc530291256d90b08856f77f55747d5fd759196ac404fad59e8a665b50d26f9edd50528f138bea269b1cdbea861d6a002fdfea960292e4e4e17907112d23134e867d176cafca5c2ec829d19a4e60e49f71df79808b8cfa1773850a4630376052d7634d7343088d7190ced4fab3311ddcb97ad0014f232ae87bf17b5e0727dc8366df51fbe2d6d7e78aeefbfaa12ba245d75b46737a6e70908082b98c4506eb928396bada16edd8a2c032727db9d268eccf0b695a438fcfe38149bd534f834735bb8d0d05c259984e960b64e90ab45edd9203325b61ca60d6f3e023df4e65bc1e1d5863d4433a56ba6cad38e717746b7eefe254c5eb5e92e69f0337091bd8be5e0934ca359ebb13e00b4bb78f22a681ccfcc285cdf529f71cf9a58b60520ca43bdea23d54875b709fbed7252eece6f85ab4c924204cadad9c31a95e0b4c481263d1e6773688885ebe475f4d219f6e0e54eb08ce3ed0393127a7538b7d2a4b521ccfa6d5927d214386b5cf36fecbd33a63af2293ed5445e69c287591f1e5535d7d97399ed1f9132a9a5e591d761e170ca64b4f62503536d2d7c454949a05cc42b758a8a3fd3eaa4f5052205b258fad5c46ca3a8b09e5c613b1450e1054773a43ad9ea3986ec04fb557679af28160dafce81ea94338b6fa1be19960a78648534448a04b391f0dad4863249d20507eecb0d789bfb28bc18f481e460cc0f4b93c060a55cc0ed8134ef5208559d57169b8f979630b47e9f275f68de0488b152a57b5a8550e2554b66b22e44c5bc55ce3d59181b6e56ccbf963411db19cf5be2adf59164d9902b9fb47ca67e39db59277d8727b394e8b996e18a3ee57eab2754bf06603cc95cb8187fd2739636fe751e2d582d5332cfc4f7b73b2ec45ebc95c5433ffe64079612ebeb9ed17abb10fb9f4409ac3859eade944403085d2c93eb1442fd49d7848c2adfe28091ba03f710b2b4e186ee013584667d963aa4a468eae3f20cdbad05247cb35560e85272b9d2766ca91d18d507ed40b99eb9bc5854c4684416e7c8c4c3cad809645c1c035b4cc9de8789bd1d576c9ecad931f8a22dfe81e9012973ce9059723deb585079f83b6f866a1c471382a2be7871362314a238fff7db15aeb6a79243e2c6be6c66fc040ceb465f53cb8d5c926f1ec5514bcfa834f217201880dc5c640deeea38a7c0cd5f40786647499460f09a3cec45bad75a17fccf6a1bafb77747ba8d6b0e883a7b14ee24f2376d5b04ceb53dbd9cdb375accc510a205115d6c827d32e7f776081d84d2cb869b429b1fb2ee8408e34b1151d3cdb2617ebe68958251651db7c7ffd1e3c7960b1fcd79b4b378858bd157803c1aff40b094397e1128fe9fb9b8ededca1e5e77594cccdbf4a40800224f3152e135ecaeed3f048feb35188abbd38a9431962c01b215610097f5d3b56121849b2ba3f5247ce12957d10b2e71103b648ee5ec82b4decab74a18d64571af6ba3c23f5b35a3415da61805fce91f988d27157685c20321af65744f616a17a5084505e2fb4f7a1e0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "6a", 0, -160501909, 3925833126, "3f5bbfc07574fa4b91a16d2e9e0166f94465081f948eb8d7f9c9412969eb98ae"],
+	["dbaf933a01c8f0b1f60acae53023df86e88ef2ad23dd48589f7e34b7aa40d7d06bc68cc32e010000000765535253ac536589aa1aef04b95c120000000000046563516a124065040000000007636365656a5151ee6bab04000000000400536a65420b670400000000026a000bbfd60300", "6aac5265006a0065", 0, 459894884, 0, "ecfb7eddeea271cb64397132a796693a81e29247c109a6830407e341b620fd06"],
+	["ce69ef2f01c1727bd8435e1f9274c69b78fe81560419d989e897c1ab285ac4411acdce1abe010000000400536a533af2f93e01abc2c201000000000852005152536a65530000000000", "52535253536a6a", 0, 364613786, 733220448, "40318236df5199d930e070998687d1d64458c7956efc6f0634bc6d427fc2420a"],
+	["65a4150901b0a6fee2e102e475485c2748a80f6bb8d1781578283d28a9c01ec2de528a25c30300000008535163ac53536a00ffffffff01ae6f580400000000090052520065656552516358413b00", "656a65535251", 0, 1159732613, 3925833126, "d75f6b66877a47053d0169da836f727afae2be0917923c3582a90cbb36c4dde9"],
+	["a8ae6122014cbea3263ab459969d52892d3f76bfcc10007fd7c445a251843bbba73c447da40200000002ac6affffffff044eb246040000000006526565006a52a3e97f01000000000853005151acac00634e18be02000000000663635265ac51231555050000000000246fc1c200", "ac6a6aac6a00", 0, 903626732, 0, "5ecb2c8e40efd717c95af729cf02eef3910ddbd797044aa7a5de307ebd2fdd4f"],
+	["0400008085202f89011a7c5c8421f85197302ae093cf2103a457c56d071d2021d91b3b2837816c3d900100000000e3a90549026dd48105000000000863525100655100ac17922b050000000003535263000000000000000010f4380500000000029b04714b04bc72bcc36f20e52c31083173d58b3c0422dbbc421c13e9723f8b99241c55ae3ba8cfa0025ce3be117acb32be0e66863e361a6fff69edae3f74756666fedcb9cb0e9f9941a7aa58826f9b1a4dd4f4812aee6f467a0c96f0fece7901a2a98cf2733c6e9714f0c6cc74056f52a8caea2925b78aac7c833cf3baf76759eb037dfa3ead6bd2633e5bbc37ef5a05491260afc0317c79b60c6a45d7084ec6ed96779356a01c469665dce3c1b3f5bde9032c86c824548bb5046637fced7361a595469c335185920331ea471118fbc167f515bf863f7b72502f897dee5ae22443bc05d1e41adfc603d4ee3c1f4834451b81d888f7851218f568ea7766e2593154b11210d8d052ba18e386a4614be66079573800d6dd11bf529542b921d21b170b42581e16c019073646c75d702f9b69694afaedcdd17c5dd0c0e0bf04b06a416fd412052ca8320c65fea385f23bd1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000007cbfe1626b4cbe0cc0c4b29bb3d78ada41ef70376d2ff7ae7909ab6038646093f8202015af2b097b5433c606e250dad5bac2ab3d8847de8b400e6a629a6ed31809d3d2e8ef94d71fa28f03f30f40b6db5e96381d3cbcbdb4ca26bdfab7331a76b5ec2de0afc008f6c34918e32b59fdb7811523127c4bb873801ae449409de4d7e4ec854e3c1616ada7f821301900a1c3d806dabfd6a2f9880505dc0b0ba986c46d42a268767b6af32939703bedb6ea8d5dc14a797bbf7df4c50139f7e65cc56780f1f207177ca1e4714f62531891a9c74a7137f4ff3fe58dc0bf6ff08cab73c0187f30ae9bf570a522b6c310be15ee3d94d65202736872a8d2e164c955950529cf99a843ff91b17e57f26225b19f0570a065b0d2d91ce159541dac392b4188b14fc6a9cad6a0aeee5ed85dd3d460428dda021bfa58d379bfb64d3e9f95f051dd6fd412052ca8320c65fea385f23bd1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000193aa2c8a94be6f2e8dd03142fe064096ddf1f645a3e954d9840dad5a1a150aa9c98bea379ccef11560e203772545dc11495d8c4815b79a4ea84166d33afc7345f534a5d5a36e99aee453c5777f3802da01b8d41973a4cee1e63ef8456f15cf6a4ec730d602a0d89f5822eb7d66713cf3ff434661e635d0f876e9a93e7b4f7ffc67e09eaf7a1c87e92e7aef84c3f3e9c3f4bbb9e61a52168df65956a1b4aa0c65f0bd671bab9ccdc0f41fe71c1b620072d2861a6eb19274246c119ee1ad3bac7cf7efbe6da0902ca10a53285e6b44f93816d32343efd046d4a243008ec34901a6a7511e1dad55cdcdd76eed46984db13a4039f5b429b183dad6e447ece107a92c30e64a40bf9e6eee70e2b5881784e191ac16dcacd2d3a875a6d4ff05befdf552379f32e192335f78e625e9462694bed7e2ce829f921db8006e6d72f9bb7061d942910b9a70266cf0cd9fb8ab30df314e18521a1ca1a8b89a01af6f15a9339290f56dc04d925989248acdb51cba899b5c48ebc7b5afac672426e03c824bbb88ad478e85da800c01f3170c2e595e6bc561866c8c2084d8f8fae72e4d2a664b6823727596e2e4a367adc660db6f2738dfcdc8f6dff5f6a88a53accd4e3379b9834943de2c2b04dd9b1cd8a8c7f06f3dda7d3e021675fc69e5c9805cc5c79bf92681234284d9a44ae81bf8138775f137fee78ab1d9032ce72a9d1bec8cc74e73d0e56257bb9aafc9387985f8634088f5b71cbd6f6200d7227bff1313484e3d0e282bcf7a8ad3188837396a5696d6188c941ade0c48728703eb8aff313348086c640065387c008f84a486f353d10d7e080b7e5fd478e874c302abf1e40cdd3c5aa3b5641e107b9e5aa12ee0ebaef118f995565d4374e0c8d1df063fc46306019810b3b230668e0edc26a4b2dc092ad61b05667d3f3c9f204d6beeba70c44cd1719492694b44370ef9d662b789f74782a75f789d60561bd692862d6a5320f485c16c49f260aef9be91cd9e30161357265b48f5de5bb880c57503a56fa68b7fbce6121f9fd47a1e1de0644ab3cfa610ab36e489cc0e4f965fe0c37b1b219a75bb5c0d794642e4b3a0fbb5a40a63fc190eb69ea10809b1192543c05f1be5c7ae7368f81d3e238fa4d7fc0123d44861f1c9c67b772db0fc17e49e39ac8ac5e08bd08eae5ec8d29f19cee91df7fa8b48ec006b42a6e2bc91ce6f16f09ce0cf551cbd87144b511094398d6b21f792e9e78bfd8c80b558b44b587f892a52e4a778a26c1c5241d93774f1a62116af92e3fc730fb944ea55154da2dfa7eedc6c37fc42f429ea2b4b6966fae2d0d36da17e8f22058bf5d86bf1ecae01dcdacb0500000000000000000000000066c9a45b4e5e52cd6a07bbbc30595c146f8db0a3420081013d457a73dbe0b6144375cae3cfebe5760f6aa5d9ada72ce787959de05b16eb7463415f167bfa40c79d328230dde8cd8cda7bf39a028f32c9261b1eef8ccbe85e3f5f82f4a8b67f3500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000f1f3f86a3a52ea0f233c1f837936027e5271cf7fcee5db6521edda4ddb0f6b4d5b79fe7591526f70caea2ed50b162a8dfe9debdc60dd6e1f612a2e701724136afcc48687c1f1de7fb0f67cf53644455f98887543aa2a3835d440ca4b3321bd22c39b76c065b9011c0f57427e8fec121fa38433b6049e120258d9ff4f8b8d9dcda5d12ebca05cb73f8ac6f588513fcedbf00507d9fd93ea75456c1d6e3a243f81810d265cb0e524e566769064291305cb5cad5c136b219b0ea7b00a219b044abc75b4d5bc9a4e3134be8c08304e15cf764ae355aaaabe935f0b25fcae927ff591f553d8ecea717eae7305d2b6c862e9eab2490a49d3d9a8bff2b738ac0485975a65c7555b1554ccde641fe9d8c13afb32f1e5b9730741fa0ccfee9ca8f4b2e14f4492ff10defda22ab2dca7872500e6f368de0d4b79764615ac18ae15333e344c1710c151bc53a54eae68ce61755009f0f69be70ae37695ac5fb7c8f3c69caa0cf1c06a75d867fa83a8aa35e3782cbecdfc4495e7c27c41321d96c8fcf28a83b0bd31b37959acde955f344abe2fada75e6676db47243e6a829bd48ecf75c754fe945de066a2ed898429924b3e9c44ff44f2dd7ef028b062f543d734ee8baf9e315a0a92b23d5025328190aab4e8a2e79699dbf1b2394d2cb95e4be74554e80bada260ff1e7f400d23a3425a03b43584fb88a0573c02025641a5f9a196513766c93a6db563fe54d5b73b4333871bf9a407da0d8bae0d3006141ed7e95e68ddc51c38f1ce6404dadf66bf7e0af180a1f30080ec4ea4be1339633f3a50516f9e5d2fdaf9a51dec6ba191053f2ffa52048255fe1e95070b5730ae03e51db3c4ba57d04783d14d219b18b968758572da5778783d770175bd3b7664f1bc4d04ad4644c06d66bf48c1633f51c9e76849d7ef9f38867180b08f1d690445d92a3c6111b2ad2b5270def7caedffde9ceb4a7b5b2dde255a2ea2a49a9b15c155850e1045ae909f0a6a6b683306025591dac69d3d159ee53563c589f0ddc447b08cc22541806b9498e55d9b9311f1626362373b69b6a374a06d598d07834bb23ea26f27204d267e1acc76b261bf5bf45b6888fd0b1da4e7d01863e5f8ab4898a3b976d29930044bcd24dd089bc841ed2abeb6d9dcb8b8babf60de8e9355d164a69707df67a8f7401c516c6f3d2400f8de840c5bae22ce79fef330daa6ddf0790c91215e62762052af9cb94847968d78dc6716e0b15a771e6b632c3867d29025998c2a907e2b1d9577218ea553b4248991614a3063c696e2d42837eb085189f57376087a4d8240f328f99ed3b8e633bc55e4a42bda795d74ac57bc168dc61a677395d6224e18887ffe078a309a06064287983e4f61fd8472a8d83f154c0674b7780c143e5bee89edeba158fe84b0674f38396e4d2b9795f0f086f311b8d5f976ffa37279cbfeee1614ff764a19710498b5ac9b9aae48710dd24c34ad76bc517641d8f124acc23f43e5146a2dcfcf24b0c8a8c56060369f71672b448dd8241b77db57c33dfb2ba7891577dc45d2185853fad452d961049680f631292dc50275b9d2f58e883b520b7ea768fcc5a1afd1300f21243a4bc47bdaa14881d80d3f01d25ddab56c8202e990394c2f7b4c0f5c65a65dbb5c7b83b759d7567f69604e97056792502ffb0a6a0809e81402daaefcfbdb0b22f59b99a22f6180bb1f44f172aa8c0ba910a64d972216351c7e610c7cefd03ff74a10b281d9084415b22102048d24de5e04bcff26806331468bea43c72de7409af551c7188aa8262812414ed68187a5d96f10573c033ee38882daaf4f101e4aa8703fd110344f389e32ec2579ee3849cd367fc2bddffcdacf00a1d183dd4ed292c576957fca08fa2baba82c6b640277d6725e6c7dc77fd5bd064ed065ecaa5869c492bd9618f7b7f705b4e6d70350a740a7858b79e5aef896574d5490d172ffd6d410c44af13b8da40d24386c658fbc0bbc25694fbe3bc82830631da513edf277cd050b93287f177634eb577a29255be0584a7482f0fe7315eab40269a4d999e0ecc012b0bc2aebee6fb255bf972fcc496279b9a7dc53caaacc15e99d3299258bbc8f4ba9b1c2b1a453701f5965defae7d5ff40cacd595470510a6fd48194a2b49aa3054218fa6ec9b0784ec8e9cc89757155f83009e37adcf3d26279a3bf6055c845c88e798e8a4dae2b0e3f1cd0f8a588f6b7a6e04323c9103576d3ba63faa31014f5e77d01f367cc0131e3aa1dd7bc210468fdd2d77d3b3903c932f9dcdfbbf00a2b8c5e0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "", 0, 1878853757, 4122551051, "7942c7468f652d614d44798a08cee76e4e81eac421f837b75fd4f20d0952e644"],
+	["88bd297f043efd6d77155dcbc43ac6cd55481e6675274c01d8afa08e0a03e50514a8cacd01000000000563005365632afc0e602daaa8d82bf2ace825b64ba1b835cd1f285a8302164093aa7a49a27257b4553e0000000006ac0051516aacffffffff85b6741ffad53adbb903e7c3340d05e4f696cf0a5f2c8802e4157b2b53225b320100000000ffffffff02a8fd83893662e3fe0dc41cca0bac42cd2dd1d1611c615d0b2a4a18ff6537600000000007536553525151531d0f8e81032d87220200000000076353656a52ac529b5ece040000000004515365533e54bb0000000000090053000052006365650000000000", "52ac65", 3, 1188691749, 1537743641, "85da8024a253e56ead5ab018f7d2a9a7d80a5adcfc6a7df97cfafa0e4edfbeca"],
+	["ba9faf4803c673e661c2291212dcae64909065a62ed7c1abf17fdf82a678742caa1bd941e500000000075252ac00516551ffffffff3f8fb7f6def95718337f1582478d8453c30f146e287651bb2ca7ebad73510231020000000453630000d697751bfc13ff1533bcbb881f6efc87dec6989630cb08c72b725923b4fd1a73798c2e290000000000ffffffff03d68d84040000000006006a52acac6afaf82c020000000009006353526a6a5163acd1da2d05000000000163a48241c100", "ac0051635163", 2, -2000999153, 733220448, "ac9bd030a81e83907b2d412b91d3c4bdfc785ef303c5ef182a84a708f516b325"],
+	["030000807082c40302a10e423a9c5f6036cd4a5a6e22e67b4be9eac0bfff1d4c98427e04e890906907000000000465ac650091c4e298f7099af4379ddc5b101d24df42020607432c8fb60268d61fdb1de0e2ce23bc73020000000263539539aea70377a3a3040000000008635151525263ac00be547b04000000000163bc20550200000000065253535253532bc96af240f41d0c00", "53ac656a00", 0, -1329135362, 4122551051, "44abe45f69a0f17c9d9f96cc3d662112449d88ba54f924df37879485b770fee9"],
+	["030000807082c40303a7752519b1266150860bfd27e1a6e764da341f9723332775bdac3d04881b1b89000000000165ffffffff809e5704797e296abbd0451409144abe339e84179be6986e9936a76626cb0c7b0000000009ac636a5253ac656553f037c734263a9c5f717ec80031b0f46aea376c6b0d6b3735980b6dbb6f65f9fe36f4bf7a0100000003ac6a65c05bde2004266b29000000000007536a5253630000018f18020000000008000051acac5365ac313c6f0300000000036a636a0e048a0500000000026351000000009e61f01500", "6a5351ac6553", 0, 2122220536, 4179206552, "17f309f32cba37a2d6e050a35727d306f1c4b2c0aff02c407481025fd059badd"],
+	["0a7f991b03d7914560a970461bc7214c4a63c0ad78842b8ea002c97c789944a656ae2880ab0000000001527c078ce259ff030d29d45f2fba0239f09dcd6804a86c9f8d527fa5ee6a28be99c24a87920000000000ffffffff8faefe3b1237cb83435e181cedc72849390b0392e489cce78e9a7681afe76be5000000000952656aacac5263006583be5fda043c6c8b040000000005516a650063c3a8fe010000000002636acf101904000000000763516a53530063e5ac05040000000003636a657f8f113400", "00516553", 2, -852386693, 4122551051, "cb8357c1e6d2c4f7714adc753bdca9890638f15ea4fee214963bf17760b3de2d"],
+	["444d89190209954cbad7e0be2be73ca32c5b8720f64d10b3a9255a082cf46f3a53f2cee13c0300000009526a53656a520063524ba043ad9edb455f6afb1564b87cf2b64dd0c00057be5cfc970bb51aa4035d4e5cb662c2020000000163ffffffff0186daec0000000000050000536563ee22c0f900", "0051ac", 1, 1222492527, 1953719636, "6ff66d3b93c034e475d3fca9175c1c40a7bf01dfff5603b66a7863bd828508f7"],
+	["0400008085202f8904bbe03bf2e3be8c3b930dec41353c19dc0a928b6665e4beb43947d4f0f7c62ff90000000002636affffffff7efbf413ed0d966d3bf841c4f3656a8adb61bfd1f952b5aea454c6d84289c98b030000000100c5b8cf89e2e87e130425105963df331f233dfdb3f939f62cf29750222d2ba8ae845732d10000000004516351acffffffff4f816e35624977b0aeb83104979ab2cf9fb48b190d198b5c56c9320f2a727991000000000763ac6300acac6affffffff021007bc02000000000251512dd1d802000000000465ac635300000000000000001608280300000000031a67134b07e2a7a6a2ec04f595bff0be118233eb03f7067697f633ee930ce68bdca837dc86e3c6341eaa793fa4127f5862a1477cf7d32197616bde8cd618c2689292d7e0c9688ea20d97067d2fb4329bac749bc66bc14336682c1e1ec01bd04aeb4f07d8bbbf066e117438f5b959d6ff254a4c01b594abae4af911de5a757ca734ab0cd9b2947ca8921287dc5d4beeabefddb94c3fe78abac520f55bad0ace374c854d0fbc0df8c0079171ced858983343630790097892eccd7c25917ea3892153939f797d208b53e3950fc695640e2734026f898c66df194372de61f62d9fd37dd5511781ab7aa0e04d2303bdfc330242b11cfe20c68bfb0c9144b57efabf2dca540ffa4a7cf807d10bd6a480edd59df404596b41615cb535881097d20558364d7fd5e41cf0c578a8486ac71bc01913401553ea648dae77ad8f86c41d5b00d97d3b3903c932f9dcdfbbf00a2b8c5e00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d425d2e5def82c215f1f9c3116d2b5679cc6dc2119647fc58e5a1db745b59772bafbf39a592d0b4d851beb8c685eda6bed19a20e7ff1affe1c3d07e82837dc103df032de4ef2b0956491b6097e105d8c6f34ccd4500a087ad5587becc6cf3c0efb17a23596dd969f0f68a790140432ff7223021d746995a2d736ffe44d98cd2c68a33b4b871e43c9b56538737609b765e0c97d0ec0dc20e453e8219b5c55c1bf1b63c858135a81f3459276f05dc132c7986add0367b2ec8c86950d585a7d7b1a2c5c8f62b588917cbb29b5592c7767333b82c5eb94818b2b7c282cbd445ed69fbca7ed4529147b3ab0bedfac7b5a1cd5a9ffade9700f7c8796738807a87019217ae25dd15f0bdf9e6a8d9a45d6b5499e6d086cb70475d3cc1d7cf08c797b46dbb9bd54c68f25201d3341cbdcca0f86d832c97a87341b3a1ff2fd9c8a56ce5ba57d3b3903c932f9dcdfbbf00a2b8c5e00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d1d7cddb569609c74517b24c87c4e9e3bceed4a10aaca8f7aa64aee3cf2799435705d96fe670c67b9915d91648e2508e94aeb1e923944891e9d25549585cc94be47f2d6bdc6a5d643397cb74785baace6e44864e70ae44dba834a7cafaabf020cddcf8c8e0b3501a8375803107e8f98405672c4bc0a499241f41d63dfddf154a09cd4a5e53b0f70d86646eab58d456888a490ea75104d4fb432cc128e1d3bb3366a2a15763c73735462a60b37d1e7e4ba10ce94b029f2c6d6f873762594cfcde238179c64da444382e904d96eb532111bd27e6dcaabd09cb5740baae89b52764765a343ecad58f70b65bc397ec89a38142e6fdd8535299f9242580dc5ebaab35ac34b60274ab682661c6057c842e91d9b373d89588471dff0db41fee4c360b74c0dc591f381691053028409f7eb12d731300865704415f4f1ba12730f0b2b9537d3b3903c932f9dcdfbbf00a2b8c5e0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003f8bf40f8c47ea838429df1315adaa9d658a9463014cc78f92218c294e1745b4e97f3f615f549b3ef81b5d3a1aeb1a8b53a5277a7808dea4431d3f2df33fa886c1a365b356df6537b34b54f7c02ab066f5f368c5e336ca5588a2621146b92dd5774f17a8a77d7e97d1854ab56fe783103b0261e285f68ae6a341abb79b8138f92ca283cd848da0cf3a22dc8f36477d08384703f68dbcc5adb360214f9c7c1dbc441ff0377548a5aebf26189c6ab29744e499663aa3eac955240fa154a52470e24829af8f54ef7670eaf528952d348228382134e7003e8bc41145605fe4caa62b68c463dc2e19ff8ef8b56f8c3be368b73588a42f979d0414ba3d3994eaf4c97841ff35e6510e912af258b704f06ac16b6295953dc692f78f9486ac27079e42c25d0be31eb80b8ceaec51460e2e45b099e1d15209ca29ba254e652fb41f02b4cf2a65db585540f05700dab21c76b086b0886bf36461de12385dd03268fbd2f7c848dcd7694477f4603c89a5abd0c7ff2730ae2fbdc9aac363c2df31cb5906c5eaf4bf01530cc30cd5f3eb8cc61e07d1d401b7471c83461a710c2d6cef7b95b6f982e7361522f73b409c74214355bcbb86c5ec32984f06596d1788325896f63cdb99f44fddd61b0f48b59ba02ab169b6292d0bab0848e42144b9335c232df1c0c02d09393e824c03e5226701da856aa9d23533a5291161029586fcbc77c2095f3ddb23af385078828e8fb9ed7fffbc1ce1d6b84384b38215e1ff8d64ef5d77c163af697d9b0287ac19362127a779460babe46a02a567b38f609d57360a9cb13642b2163b995c4c9341132bddfa36f680cc2939af5a28c9cfdbee436d7578eae85158c5bad1f1777b681d16210d80caad92709cb7ccd0ed6cd53d601f2e3e084fe384fc1c0c56ae6f6f6bd2b927fbd410d97efb8952520aab0986bfd68dbf08bbfd415c8496a0ee8f4d742df40f55342f9b4c8e9d0a4430ea40d509d439da423180d6c081ee37ca2fe160b6d6870a516c91742f193a864bab8154d81148de7005aa8bdf71d553e51364129fce9c6155fbecca8229f2f608392dd83d813751aff4b06f6ebdbe235ef8ae2cb80dcd7fd7c5dd5d91cc8a6ba5975f49ea4bfdb664f99aa4688db48aedf5e496ca98ea2e7c1a0556220dd03eff82952a56ae20fac233cdeaa849a044b7b74fedb5d86d0851b70c7d744b332c16767d663eb3b109c4deacd452e8e76966d7d1719abe2a427c8fe3cd2855bdb39edd89402390f017ea5903b3bda63bd6f368ac1d292ba7d6440e093962057521ee0103859687cb0aceff6aa6195de522f54decc24b5ec9a57b36eaf46d8b2ef36201163c98d54a7ae536d04a6c8d3d583c301d73d886b86d721fb2ba25fa201f9cb3a7acacc3ad4917eb1118b06884907c933f5929d009a1e4276a80a53bf668613529d7b3a5f0651fae7146cd94e5270ce86fb37f23a71b385a1102c9d1423e6e550521121e05cfcf2766fcce80e76deb2bfff6a584fd1fc01171ca18cd01e3cce039d182463b63e8a45b4d994d64de6e9505e5307771c527025f4e91673e6e73bf13689cbfcdaa3ea3cff03b80eeadb9d174817e936e4d5aa0162f24b1c98b57973242ac7e9bdff7f03b2ff453a17dd6bc45e75bea250f2d03b1776a2178ccdef3d0ccfdf7f06b61041596c9fe5436023a154958fafbbbef1d961fa7a0ac3e9cf110ded1b79370d5225dd1ca44533df4e53355e2ab98a82efedc9be59f61c3da01f0734913a4b5b11932e1d0316f3c1c1888f347eaa488be68d3970bbf48ff209323a1a7449e8d097194afb724ce43cb8c5dd4cf842aa0cbbaf41b16b443335d8c0a0bd6c088c4116420adf9b0f961e0fac7b24e5740a5ae32a5c6494ab8cba8b31e8076cb6387b0810d1d7ed83040a63b45156e1358562fc230023431454852a6b82981a6382bf4b7f59d87e4ceb7428770a1857bba24de225f1012b4caa35f237b255579008b70cbe1a9d2dbcb463cb106a27d75e8b3bde0ee3334c8e5d22b8c8586840164e0b07c67928dbce7b0ccb9e8c01714fc7a1c1ec4fbb1a6f9e10f82979aaee9e649fdfb8299cce930da04256fb65c006cf9bc00c412cab18a6e07bcfc64a952527f2ab1f7ad7519748e2a1ef96c7cb1007fa548be6a092ba20c65a7947163be8086836c62c36d8377d13b32d63a271ab99419ad7f86aaf9c49875c0db3f89a24f580d601b0636fcb85b7f943ca0d04050729fb0be2a8d44f0952c4a10e9d145f455bad838e80ec5c980794040793f98425cbe3b47ab49e9ec873cfd4f2ef50f549e42944a039cdd1008e93fa8a57bbcb007921dd94c47546c8774ebcd50cabd78642a13bb91d6157b2ffe4511044d4b4fa0dfeeaaa9f545985669ddaac78abf0e3cb7956f4fdc97d64b63c120ba689869449c55e081f6b9fdc1906c029669fe7c804f3bb2486f760a77811ca8af0ad31f3af1cdfd8f25db427a59e15f577fc732dfa9f8eb1b4d360b60260f857d050ef0d19313c4a6d8a65bf984857be54af7ea5fd7ea31f23836e12d74e858b27f674ab0b415b5408ca7e93e433288d0e5b7a72dfb7bbb66d0e436009d08dad71e795a427696b5ce2cdf6cfbc8d5223b9962195f756f99a2b5eacae9dff7407beb9b794de63c320d827ea51bc931a7c456e9880dcf82abad3355116273b90282ea68457c8c86c72723e2eea4df2c7ad8457309ae63c750a968e55a5789e20ca42b578344e71818f8586c04ef1f160f2eb52f5962302a8a6bfe385524c4e685f2d57efaadbeb6f4b45d9a70f9d59fc6685d7bb5bb7fbbb111c9831a6a0a4876b7c08e389bfca3c82d18eea387028ceeb830a93fa29cb42506883c9646741130986419d66a5b40484b1d0b42bcb5e0418b5e1bd690f7ef6a9f0020076745b0fbd8529c026aa40b74512a97af4c63ffb1f18d3c52b85ed12bdc82a0fd393fe15ca7175b7e4a45fc59d16cebec7aed78ac793c91add7b0df333e7182bf435b14de76416243404f3f3ff74426e9bf7c8d624ce4b5a9a3451ddded117331c181e68bd3ddc58f0322534be5d286da1d76ac399efa52d5b9d5d7d99fedae94edd2177000abd6d19360a34eb4ab40f9583fdb4c9040c2ce7254d8610772846c09d6b41cf4a5c542ee9a651fc0817f3053e1ebba23f6e59e51851e748915558e3bd1b49a6d119092271cefd6e51f4a06a0d20a26ad1e78d2f941a3858b882d62461deea1e8800829cb5ba394f6cc847b9d25480e2e0cc8c35357187279227127bc1a78756b3d4fc193af6a648b847735b41765d3a1020da2ee8914026f73ca22a1a78b3fa0fad5c00f2ac5cdb9ff2c77d91f029c9acd637d460170edacffda4f6c7440df4ba2cd91db66f73de92eeecab5feb5dc3ebde0839e06582022225e5c6a1e349d3d3368f27af6929b17f77c967d3ea942479453352cf0f0e6777e80dadec118872379bf0c0ca69f16820dbb8a9521135a52697dfc553eec056aaaa63ece03a1d07e78250723ee2b7da4877d3bf5ac0621a29a42a1d0fd9e79544275c1a0f5a9208d9e9868f2f7073fe4a43e6a14950dafcd0685dcfb1d86a6ffa5c0abdd6610f472d6a69744c001513ff49b5a0d9b3ba5a61adff1e9a7d2dacd4d6d8d63913277e56e68fd2fad2c86a95338993257098efd390a20a92e1fae56129ce17f6ea66b79bae23613e12ce0b0c507207789e90df11bdf6f54c9fd41b9bc5ecc71a4bed595a787c8d2d93a088b4c25e54d5db67a813e103a4ee16e1e4c89790500dd5d02be8aac324629360cbd413bf546415069e0b4db68bba6efbe41a7d7d12aff94a28cf656fc2a53c7207aaa4d8a6825c4163a03fcac5c80808adec202b4825dae0489065c0a6c5cd98ffbed73861babf8e5771ae002eeb28d0420ec44d00246c1afcbfa352a2aa6bc782eee38e9b63e86543b543491e26845d44d029a1f0a937f65e54149c5c6320504ca9b4aa096c25adb144011fc8f022ef9e3913dbdb0cc71fcdcc2ebd4792d19fbd7b77c55edc08e3960a57f7eb01facf7a05000000000000000000000000a1656a55a3ec4d4a1c9f6f38e19f26b5f7e1d5dea7e96dccc3afd69d90808f7b2080ceb5a95bbe4a15124f3b0ab5c3924516822ab69df7a2e1190eebf7478977db45f64c309778fed9a52621a81fe9951add3e3e729e32a78cc179c151020ab9000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000007efa251b6f9b7c93a02835ae7145293e8237698ca3b835ca0533ef54c1c9f78abf84b0c7bf016ab8c59f7202656da80d92dbd085ed26eff759747a84170b4f5463fedab57552dee2954a840781646f4805664722774cbf379516866004d8aaa5e1d4ab2e92ea80f1d8c7d4cf02195658c4a03b1d5a47d81c32d1c764e4f4309acd21dbc1ab2a302b656597bfaecda426bdf1e547af868ea7dddc1e58a43a1dd318d669ff8289299b839fbb6deda0fb2d28cea8918acad8ab78025cadec765f155b7d5b6860553494a1e3b6e132061c2ae7da8f123e34b7b8d54c94752fd0eeea04b79af84b148fa76f957b5de5951afbabf8e29e77dee81dd77351b8ca34c4d2df8bdcc48426e28b1554a6344a738e02bf6201536a340919ffe5ac54b33f6f8952f6eccbd82d1d49b7f97070e674ec6c55ce4d98359c6cd6112fd2bbb13c696d9da516c17b434b3e0473da3c49c7fe5bc34a5f75233bd26524fdf44bc5827a27a103e26fc46d87e47cac938c2766661f0f0171106c03a44a15663c1d8262c12d447d01e8cc0ab9f1ed30873203f649bc15615c5724a803f3ef28842362a8968a40793ea85fe2fdec060061df6b5b46d1aecdd88736099df86bf944c911700bb3a6db627474f989f6ecad9a103ce2b1f99464c96ffaa4b9a3dc1630f1eebb18d2c7eec55ce1ff027ebf297caa1b42b4f6e9d7ee5e69dc6381e4f5c796c556c2c12be7f61513ca945bb1bf5b07ef72d9bc2fc0a73395c79b6f15d9bb80628ada4815ea4f90a5ea9064911f5e5a495db7d41b13a7872d230a6ab2af54bacebd562ec1a45644829deb0ded945e75fd372f8bbe6a474672463b1aca56a258b6c3d4e9a6cb589b489fcdbb839cf182a9e21f0d6878ee75ad25b26cad085abcdbea6066189e08f773ccf9e9614e79821055f8bcb31bd98102f41f57527941882c82e64db4bd5c74cbff96efd289ac4bb6e869a73046e1de73d87ea5a8aa44c21436df95b91459e848ac9f29033baaacafb01c22da13be02b6fc7cec361e0efc857642aaa6714a06b054f56d5fbf952a64506e9b374f39eb48cbcfab3d3b195c393bd116a434311580c0cf12cf7c7a71712ed27808525faf4703463c536dc1381b3ad796da86abdc9e0cd853aa6bec68d2354f9faa0af3cdea7d7f9512a97062951ffd80f7a199d417bb57851a2860420cc41ab1844f1e5654e0cd68338262487b3abdbde424a33207d5e96338ed4996632b986b8ddfbf0b155de4abd21ce2044c36bfbbd6c93232233036ff764e06c9bae7a49949314cba357dcfd57b84adaec34e22d4fa888f86d850c293a57988ffd4e23f3f079e6160942d5dc4aead5efe6055758d673873696584a42ce7dc996b7aafddc81d73782a5dc8e9f9606d20782872953aa6b1ebf27cdd477c704a6d909fecf741eb2bb956540a7fd1575967ecd75d62ed30c7b5d2fbb14e97afe718633be2334c626ee2eeab8c55d58fafb0f06ef14772034e01f519ee266ca16bbfcdf7c7d6dadad282f063e24e78cffce772b6b5e495c059f2de287faeed69db6280410f50ee25e3c98e4a98a8480d77b3eb5a776cce0f191263e1c25a79a3a1446591644c294b189be453943dfa205680135290a9592774f98a160d101bdafe425692ffaed0fd38f7e159b96d8ca8d92056346abb90ae4e66dbafa1404be495927dea89338fa5549ca19f7f6926b26453e3689979704b82abfad06ce9aeddd6f3f57826fc2e507cc15c69637c71eac3be4369ef9c260451053ac573357fe067c0164ed33c5f6c39544dc524d6104c72dcdbbd1a9f9dabd86e2c40fce5340b6e69de84516f6fe29c8d9cfe796a7fbbba130d2e6e1ed95423dbd2dd130be6ea27578f6cbfc96c45f141b073754f3b053ded741037e3d7f232338fcd44e8d91692116d1b9278df84a0ec76752b55d2671a6f310039aedacdc34b9593082c2ef759977649812725fa4f203df6bbb6d7162be854bbe8776fc3e02fd591f18ecfe6c64dffffc83541a17e819994f287c583edd06eb2b1bbec3789838fe3969d9fec39d5895bb0357ec5a99fc888f9205b4ca7befa608d292fe7e8b6ae1b8c13a246d124b520f72f2d963694157ea6351ebe645cf51d37c997202aa840b29bf4f86c802dbc91d134ac64c219a3923322dcc6d91d5a47df27f6351c17dc429cc49379a842b88c6c5118d5ad739ff9c7806f414fd28dc5e1dd0f6f43d2bda5130f1318a66781b5b603bf77109a041b920611b10bee358fddfca0ebf123c37c9797d0b2b3ab757e8e8bb4c80500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "ac", 3, -873317492, 1953719636, "fec274404b8f5cee994a7f30581fa53e912f2265a6627c9695f299c1d8a21090"],
+	["030000807082c403012a731a63ce905d5aeae5c99c112be7217fa0cf3fcbc18533e3996e0568a7641f000000000965ac516aac65536565ffffffff03582c540000000000035265511817250000000000096a655265ac5351530095e3af020000000009ac635351ac0063ac524af847aa85aa9f1000", "6a6a6553535353", 0, -1678519578, 4122551051, "c60dfecfe43fb1b8b87770ff65c7fd14e37d026bb069d1ac13ebb68453908663"],
+	["0400008085202f89018cef764fc7c6190e15ab9205762ed5ef0f1d1c6615f87e037276f93d176c04280000000000ffffffff0152e3c4020000000006ac6a00acac52cf40c5ec00000000274636010000000004e2fac221640b72988d17c029fb6891069fd06795624fd534020122d92681ed861a9836227956a3adc924779c5220779475339093b7277414c5d192b880ae0b4014d4f47f7d1325688f189a6b3dc6952bc05f6f51ead1d8561e11abb6f7094b57621983cc52e9c3a7c47db4777805525f4dc1f35d2a540ae775c79b6e6b5bd1d287d781e08b264c808037b77463561087b200a388d21084407f5974212ed0d705ab6ca427facadfa1aa72c421cb919a019c28c8eb93230a4278eba5dff325c786703d425d242b8a172108e9a9f376212467899f23565e57dc8a8955c8da3578cbfd6e7ca669e90d959b67f83b6951b692366ed2568bdb62dbd0bcb7df8b4ef1f0aba34ef163b210b8d9854453e3c222314fed1780866206a68f3e4a0fdd36c5ac73e449d234a20d0d977916ca67b9ae46aa79ef43a65e3afd0feae5d88442a5ef23c37c9797d0b2b3ab757e8e8bb4c805000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000e7d6593c9ab9004a3d8e788c8d2eed1351ce039c0226cf4f063eb811184401057b148fcad9c109d05f0b6a0584e50c1287fda221dc188722a7bfc86a7be5121bbdd3933effc19413408c990f6e5754e2babd63a3d3c6422f8ccd487847839305441bc27d168686af25a2efd52bded663abf284d652768353a78f3950866a4e3be6376fc74f08d2805a878cb198ad811eaa01df0306aee009b90855f35693c31eb9907091fe5bf89161afb71ce4262b58fd3acbccc7c6e492fd5f89a18abe105defb518611a7770c0dd1b734eb9c00b911eeb6b0198c1dc0cfc838b4132a3e8399c2168cc500acfc9e964799aa702b468860a58a3a0757da1a19f39d99c99aecb0efb0921cbc3dcb1903c253ed540b88d06b9e6e87371f65670cf1c5a610ff578224a8f35bfcf588da1c41584dc5c9307e8c15680b8422a2f5976446ca3bc79aa23c37c9797d0b2b3ab757e8e8bb4c8050000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002156fbc0b4096c847f6401b6e92c2c27c8a01baff66a477956312bade5e5fdeed77bc5cc7502524f0d5735e62a13cff41debbe8acf1a44bfe6f7503b8cfb883380e22a35ffa67acd572265e8c71730687cda87a0d74a8b9f35ca59a7860aa3f97510e9cd9cb80cc1625236ec19686a65108af6423e81a1e52675b6fa3eafc8417f363b79bb9b0d1259048297553570ebbe4d7eddefefbd7999e5854a96af27c4b4ec21d0028e1b12d081131192874c8fe5bd592414958b261338c5c8432b7166950f044ac479f0b3df30c169d4aff2e188224f1fa90a2a4c0765c0576edd76a1077c38b29a05f770bdac8ed077df9247a62177d74bee4161992b91118adc5cc47c088450d52a7fe06d644462ece259656805a46f01a205045e2549b1badddabca5555da92dbf96afab5c6b290fcec431abf676a9c96181e0d4c202fcc48e67fe23c37c9797d0b2b3ab757e8e8bb4c805000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d2395fcc2c56cd1c756632623152dcbffa1f633bbaa6c42986644d5c6d4a871e0699843564242aa1810ed8e810327a134f705771dad8d802f18b67999aac831fc29658a25cfc927d061129f0d98f7b95fd94a7ea29440806746376f6c4528ddefda8bd947425d1adc198c871e9d1853de225257fac20d3984ccad22a0ba4dc4509cff1a29ab878fb19a73dbaca2afadbd3bb918a153ec6f0f0423881ef961fbd41a10d933a0cd7d7272d6253e9eaa1b3e4acc7f1cfd6ffee4269ecd0c58ad3a16e895ceb4006292374bbd06bf7e50833d4413a47e49a1c322e3a87c1f52f905af002ada59c5b7139a32b65cf5e23418c64868005820dd864ee0cc20ab04e1eb5482bb316dd4b13e77cef373dbd5e9e68530c7d939ba620b055b075d99fe1569b1b40dd62dbffaaa7db331dd87dcb70bec189a8c1de9221a7909687e59e10aaa823c37c9797d0b2b3ab757e8e8bb4c805000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000044e266fcab5ea01dacb85a779409b1c020eb67347f448be1aeea4949e531a0bebe3b6de776cfef28a153bbb450568c151aad8c4a963baa7b2562b9babd9e1f950cdf9603dd75b023d3c64cd56af7e0d54d587980a2b79ebd80ac0461ba66d5dd8aa026acc238e4a250c1fe2a1cc3c0c0ed9e2f048cdfaa7c4822b807e4c1ac12d1fe7a308ed94c64e847f7a790b3b6e10d4c7e364f6a32bff14ed02162b455e5b403afde64cac1dee5b1fcd84a358593e56ae42ce38cbdff23186c313e55425cbd7896bd47fb4766a9e236e6c605ca948d54559d98cd5cd6f86c56ae7054f2af8de3e52814fd8c4630e65e133291d30943aca2416ef2d557bede1dc249a3bfe6070bbf5bc1d319368dd4e9c40626c41147ad8c853ee1af91cbf61cc87e0f380fb99480ca441adc8a8b73e742ae91a592f871afd4f2689a559927eeda7f70db49e0b76bd57428cc998d464dbf2cd8f15a71495fc3e3ccc1da341f7445b6dddb06280ebb42941e6e4c87fd49e54d42cf4c6f24f8ff3a8b8b5032cd1f1b96a3ac899aec2cb7eab3057d1c764968bb795b90cf09c1c1ad87dd7d93d87cb31ddfc1b13edfddf77d3d75de25a041a27889898db8ff57cfcb3c89cc0a08c83d4b6f1ce573f82fb14fa4c6f2434881b5efe66015a6ee0227867e71ecf551e6d7a77952bd8079cfbfb8e96801d6796fc85d765f11adca64011f30df0483dc93bca52c784198512fe8c9adc0bcd141897a59936846963e517be52b1ecec30a718a543a4c09d7f176f945939174f927f6d9f8bda749ec25bb503d21ec724d2ca9593bc89ff6eb4f58e7ec1b4e873e5e64e847811b650fdb767704db086aa5c6e7e5f6420c1f8698d92befcfdb192400b51402bd74d0eca8d20456bf38780571c127087f64154ee4fd00ec489380e5705088aee4f39ea02a092f0c96976fe363892c1125dbe9e79ac95f1683ae6156c0cec5a4cbae44f3445943c438359970cf7d6dbcaf590b39f36a1a8910f5141b80d227988ca549688f971439f3284b45cfcb8457155caa8e754a434183cfe25c501e204422c1621e262a153dee5eaeeddc7e87019cc2626326e32198094803cdd1b81b8ada1bc59ef8f8d693cecdc4bf2acfec06fc232ec952f5a17df03e52f13a83b4c9f5fd459b2c4f27892dde68aede2d09551ba9863578494fc083ca48f8113e472c6015742d6abefe2ed7fdfd7479ab5728b01f30f4fe5aadcb2947a5bccec064eb3fb69f0901829ca7ccd84a14e67a77b47828388c891f2f3358415a147afe1c83537b6b0565df8b8ea5674f5d75b8bcdceff95b232fb8bfe9150757a3ab711c3e107822c08a95f8669ee3ce38eb66b6b234a2692e165d6a3ad586ce81a985b73e8f38c87488b7963ca4191c781cf06f3cb3f7890d8e1b4a7fd691b924aaec8a69f21eb95b711fa6c50f36ca2a8207e91f45c84f506b285f1b59dc804d3229f4e27efcdc3405f6e51652bb5f5f2bd9a47107277c52b81ce6cb8e67ec486b679966b40fe40d5ae6d8c024784760d13a8b5995e760d12f6bb156cf2c843ed4da5d0ceab3f078fface5e36157bb5efccb46681e37735fd23795f087de8a44e156e6ff7bbb7e11ed6436526787e77cc34160997d455cbb8ca00a68d66905403e3ed826bae33dcaba30682c39812b8c00b8befb06e3f890be352b640440a9742a8c5a4a38976c3270b692050a53cd331e53cbbcf7ecb15c9ae149d87eeadfaf4040538131a75e8fc8efbbd008d8e12866887473690d59c3869dad49adf7c722410000535f19768351216602d60c9e6b9996bb7a1849465fa22953285016a251206e974a68ef671b76af45eba2756325c1a88b493db4a0d624cde1e11a11188083755badfe645e62a45572fa7322a8b918dab19dcc80997d18058f950ff08e9320f78dde61a4d81e18bcfa3ef561d938a4633cb29dfe6bf6b4fd733fa345f1f579a40f8284c46dd98b6ed1e83218f6a063f2eb0596effbc5c962f45dee516704e8bd10351462d9c633be3b24415dfee10037e18a3ed7bae496edb60513d39bff122523e9d38a8a7b5faa9062c80ac71d391bb1a87449cc0c48d2b9bbb4ed260d83d8bbb89d3d1596b85ee0138ae9c58746e0c39f15a4f0de81a2cc6d94cc93f566e3a70e5881a8f94bdf74590e8ca7fe8dfab349c1ada3f815c38c9093232008023ffd1f743a2f5de0979686a0bec0c6d0c4119e4d7864f9e9690f8339d1685768e398f4d427b9dfb62359d2fc7e9be6dca6347d2741245a7bc0ab7c957f45ed4e6804092597d1441cabb798fc57ee6661cdf0ce751558574883408d7764a436e833ed328d7b910a0c640a75aef67e284e431a24146b79c92aa65a2e3a0a58d01841036d41385368c7ee9d5c4f1028da70b34298ffb99ed009b61c5741a6a4b2d7937351916374c2f76bd8b5a22f5eaf02cc47e6f2d2fe8b8cc9337c6c5d24716f4336883db12c206a00f3ce7ffbf9811fe9cb0a468672e421ba6b6d6bbed55e713a57351295506651f661b28ceeab18cc8eeae9a7b674b7b182ff78fc12ede7753a4533a48846bbead231e66dff69ba3ab60f4cc9888033e8ecfdcd424b957a2c382028e34348cee54569dd4318ce981320507c7c45ee817fc5bbf7f985f0e83c3694467d97b7159aaaef53bc2bf38f2f1da60d37a01882df8fe88752a850a0143687d1bea7c7b40c24bebc85425f6427ea2b83b44fa53850caf9b3f4ee51e6c4ebf6716a6ac3635ba810bae128fe5ce5b0555e18109f58a0af5be9a87985c806d50f1dca28e3ab1eae72dccea65d6f458755a0ca32735f4095b23752b00f073f8dc7e4e28e46f7dc472dadf94e9bf41177fe5b73539d71284bc8a7fbded72fe0511d6b30790e5882b023176b430554f06455b2e457ae17f2fe02b25ba2cadfc5a0d88887b4a0da344d172e6f8f1eaafa336132234b23765fa3ff611c6e271f4212e67fcb004ffd23bf9497bbfda452813cc4a818cd6d28cf85b37fccac4f1252929d0179f9247ca5bcd5830e83479d44f4cb1707bd2a7c641819cf95ded11ae7752d563314078ef49dbfe78b3adfe8a39af4af7956ceab65155bc256f6ec40da0609b4b648128619a9dd6bafc51f247df58e5981a7462f8b09a9fe40ae0c097938e2f59ac81660fce14c6c24c43e386cfabb5ec4505954128f3bdf3ab38f33d7e738148b5a58af61ec230ef561acbe1ce414dcc4e848b635bd6d135edf6e81b84e4e07e2095c98e2f41a8d58a50a97593a5f60e65710f21ba3d3f31b56a73254d42b3095f9b75de760ccad3de911920ec92dfe66875cc100834b97a3981b631b34ef1259ed3a78ccf0b6302fbb5ec84dba40006bc94569552fb78133fddd1e9ba3399ad69a7d543b7f361fc95022b1a843af76540f3b17c8dc8c11f608973240c124688f566d16fa6a581cba67c4fe147fa3d12ec435f597e2e1669edbd7d2ef6bc8b0c6a712f6f8d394fd08bda0a12adbb14f6ca7a4b05476339c34ffd4ef8e05f7467ef5368eb55570305bfc5145efb3e7747a3a23026e41d3325c28be7972b442056a4b4a4b067e105c549086cda3dccffe78beedfd4e56b9a183b6f22c9237879ffc87cd8e57bcc0a159a77ddaf6fc8d7c76f4eccacc88e80eab82c8b68907a97d2f484fed07b8284b8f87ea467832b77c9e38d3f6bea8d698671228fcdaab64448175f1c26c164d79857c346c072be55f4a2268a615306f24c5b04de8f859e1dbd22e6ef6ee1ff818f95143a28c1bda2a7b540714ec6f4ad857a27c54572fa52144c87bc908bed5774f7548a90e25ae51180138c843b9b06d4be5786212c20ce675013a4eeb7e525383c89e865ab993fb6f920d1660270bf1cb4e48e3f4ac94dd5904dbe70f6558480497f6898e548110aab94533fc5849811aac48931f650a25f3bb0989d24e18cd67a82c56ef0c4484f77ed45483840ade2a6732e91425556d379754da5f7f0219f697da08f57a50d51507ce431011c75bdbda89527179798fe0d82a4413fc60b8cd730273c26c3af8bf7b977926f9e78fbd79911a757bd468d1fe625dd7a8a2d0c9ac55f80a8c99050a41a8234d0d6c86b00997c86528e5b834c0a0a34d69e01d0e654b36772ab14da82aa7d918daf38248710827c710bade262391ec71d4bce45f25f7413b1abde96c770acd5b108c1e9fbc93ffa3660c157e810dce34e40c232914f6e25e61f7fb03781470ac18cc27e78d8f320b9c823d6634e9978d22236ec32210e1db4e13d254044a92a21aa96db99984a53524e703959dc97b4c0daeb0a056e092e1ef22d432aa616113e526f0417dc3aa15531e5fadf9eb784a592ef649089f1c873c243c6d11303b05be0a48a011fe3342cb2ab4e1dce196d0c25992bdaf22dbadc2f90b2ead70984fbe5b799eb6ac719efe226b79e527b19c95b809963939b867b105767f75e2cfd6694ca57ad72d13f82727c6ac196ae067852278ca44b9f36de4f06adf8452ada97b74f31030e12f6bc03ca2a1045d9ec4dbc17ddc680f68920e06804d3bd1cce9b96aa33545a0eaf4014f234564dd5ef65ddbb63e0b84ce774e367f1df190307057eeb28766b7f074e49ec5fcc2f3e77c176b2d96c6bb6601d90c2ce8f259dc2ff5eeb36abd21a97dcb56bbc9ededef931ef5039ac4c9df1c35eddf06d4d1929f9baf33451530b1ad3d87cc379d6d14b2e15c54d4833db921f6b376994bfad4afc9467c304bbe301be0d8967a4da1c783768aa84c30247421a4913ecf5fcf371c13b5b03b1a62fa4adb079dce8a5e4c25d5c89be176868054e598115e94b110b0f63fe174479f98fe5435a8822eb78175aa7b4b7d62fa88014a0a45e862b312bba66b3cdb681baf38c916b4307db6bc1806288b18008ce03e6a09a96e6c5a00810012f7de4137b01086cee5848338561e2d5e56731d697cb628bbae1449dfcdf50b44fe7de4a4fee4633af2705abaa9109f2b091a838e6adaa5eb4fba1708cde13429668ddf6cc0c1909c1edb9e062ae5dc22ca5dcee47172c1d654042918eb3a23174c4a0dc74f63662ed8c21c0f1441cc07eb83a33359426e9ecf42c6038c7a138a03168d9969213323a83c16da21dba2e95966fc87db84535e7aa7213a4d8fc105939eb69f9a9a0a066b1eb6642229727ba1af899463a06c3083143d5d0d2d3224d53718bed0a59f32771afffb4f493c8bb71fb9f0125aac7f71e468c53312ca2ebdc1226bb87a417b9128cbb24c7e5b353f3136a49781cf0a556839e12daef767aa945a6b3992f51a5fff3fd483abd07f4f1844889c89416ac416c28a7608f9c655e7547464d75e081a00cb5ebf682960f9e7257bafc429049b8be757cbeb4349a7b1c6a60411c9bb78fddffcd0100000000000000009a560705000000000d36878810f18a8edaaa3447e0a3737567ed8c77ff1fc9b91e5bdeb4660ebf60a72a31ae839265ee2ac8f00d92f284f3e1e9d175e4e41e88534d5e732dbcd1bd8428cb28d6d3cfbf004309ef512679a356d55d6d4372f4d10c98d2acac82ed8900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000cdc3683fbf23046931b1a23e4c9663b2927b3e6ed78bf4c7eb96bec6031ecb6196fea31dcf7f33ce9889339a804ab410bfdffcf87edb5cb6901d1d443632d4e7946d8c128a10656302b1adfdaee2686be570ac75978829f1c0958fa2d60051ac9ff5a347ccc94538766eb2819fb2815f61e9243b267afeb24ea4b8696510c3b4e41d954e46cd62d085703fd019d3d578e6e6b5012917ad240479631d30ed5537f7cdbe72efeaf1c0e523e7b6f595878985452708d49ba8d74112dc90fcb97cfec7e9d7595312ca20ee57447e94949d2244d459fb0119c40eddb134099f100b29f9f0a9bc5ac11adea863221df1e4d7e91bc3b66b737a3565e64931a4737a03e8f5e118e08178db7a05a0e50e8afdf1f7c00ac096f29e072c56fa463e3f5446d30e7c5f1523c5bad93c43d2847af8ae6f15c42c535910d4720c7c1b0831ace91aca618cb26255f15ee8fc1f4baf75d2ed7a5e798834d2a0bd2458856a2ac5819e579ec6e7bdbc09641dcbe6fb55dd165f5ab600734b95a4a163f83205bd03055192eaf3bc9bfa6815188b4120834612c4928e784629ca70764d3655af0e117c7c94f33b128e6e646aa2c1f2194409198362844ad724789a045248d7f9809840b79f67fbb0296f84e314c7c428e68f3b613559aff85c6340c0561b7808cee4c7099e401fb5fc5d9c9d4531b180affdcc8ed1546c9b1359800d6c807cd0770b040368664328bb08ee62d54296359a585ddd650a078572ff87067c00cf7bfe1233ae852cff879d39558e5ea6cb329a6dc33d142849930f44f01d1ab52c0d084f1645bc9dc5f82637025bf036bd87fa8684e3696045f877047a505fbc0853e34de902dc3921dede975791d660e04259297e1566ec9104f193c572824ae19a773d8cb6088540cf1a325adb1f950007f6ae1899c03e86d5f749483167c1fd21a3a4060c926676e05e90e11d985ebbb3f9e391ecf9ca12bc94cc96129dd97df8e198ce2ea141307150f0b5f480edecbb58e91235e204f7b007edc983824cf6b5e2e86fb25e12f656115d646267e23c7113ed2b25e623a096b5a148cb052676fee6fd8c3e70a9a269790dc8224a50b55a2899cdb00da1fc702958e347b7c9a1f6fb4c0d8129fee64005547bbe88f91ca1d30ac7383b96dd05e771a7aad550f1fc10801f1f2fa6fca82998fd1637197d2c74fd68d15c403c31cb3c404bbd336b7b2ad6d72fdd14372a8fa6e3459fda54757014a61e996dc6e22320aee984d4269766b7a6fa1106974b45b56e7af8f47f8e224423dd83e61b1a6fa747c2e6fe2d72d2edb6f4548da9b4fbc4328ea43ec7716d92151a0043fa0ab97db8c9b3d4ac59bded84cd67c75d4cb7216414b0aee47db477acb516eec76a1bb1822f13de5839fde821c66af17f5cb94dc1a6f9b29b89ebdf3ee4ad480bfed9ced680205c342cb1bb282c740b7feeefc1d60a5e7c36d330c631c17e12b4c8065b7c0a02dbba8388f970f723e0cb94df84d25fc17bd3b36855384bda888e0d01b323c807bba39bec6159fb2338b0c5a5b6ff54e0eb05109c4efda3ca8b25309ed15505ae5080a756dc5ed2e2da7df2fe7c13e0cfb51837ab16c42f5260f32216cff1d18f1893d3f8cb1de02868cbddb23e287c929abc32b282398efebde5567ac133b76b1e618d82503c72b6d0f5680d493288b281e9c8b49ea4ac0df781c1fa3671c5253f1c8c6b78db8826f29bc6f856af4f7bfc6a9c4f8fc20e038fda601ea0c2813b470216f663d009ea4d7d06b8eaa382ba918ae51fcf2130eed7ac61cf645d467388ebbbb409f554a94f0f21a2cadd6043eac3dd961d9d777a08f004664f507e21ac3ba2207190b8b8ec94c44d0c96b8f517fcc406a76e480bf4f6bec847acebaffd0ef7226bb88e112ad4b6dea05780e0bf62109e2afa4c64dea940610802a7bd16bf3e8faa1b76525cd52bad271c84e983bcac2b8105cf3b523a0c8147560f25f4ef9cb5cb8a6c0a7a36744ea948823d4ba722b359ab39d5a71d14a627cf4cef710574ae07f8b40b345c9a3af2617c476e2226649d41bbc5d9ae3346675ae4f0f212cb0153ae0a0e2957d1e56ed2220e2a853c9f7c69726fda56f94a65c280ce5a208008e8f57b757a060f68540f80ede0c661935655185e4f5bbd06e6311056a4d85b5cdd59c161dc15e3d0c21a68e9b22633dce3e4b9e669cd47e016e0ffc33eaa619d3feb855ca57ac14a1a8a46afa4e21a52b64f605124cb961220686fd85f17af9ad250b1441e6e3619c7d722124240a1316d1e2a240b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "", 0, -135836605, 1991772603, "94a0f653f0a57358738c4f465ab89087357f308231ab537beea148ff5cc01111"],
+	["5476c75a021fd128cf747a55693a7149e84c28b23ea1f267e8d9a5aadabd846be1075f23a80000000000ffffffffcca665fd246b9e1050dc5b71521682a806613b850506688f4b12c83c3db4a5ac0100000009ac00636365acac6a5312a15fb801d553aa05000000000963005100510052ac525883085e00", "ac51", 1, 399135511, 4179206552, "36aedbee1d3a3d87983b0a261ed68b48d33c64d0f96a5f3ffc9c839e4a1f46a1"],
+	["46ff9b14036653176b7efae3ad1582019c319add951fa2901d8a6ad54fd40eb9484e6f04600300000000ffffffff61493fc50f13624569a28f3c6cf30465219be1dd0e0a56d22ed37661da214c4c0300000000ffffffff50d61d6463bfcdd51ead98040bf16ae396836df48f398630db87a6cca441378500000000025100ffffffff034416ce03000000000765006a65ac5152c0a886030000000000628b1a000000000004656363637566d5e100", "65636a00", 0, -345542066, 1953719636, "a603144824697f1064975846ed3e35d990b872e86e58a05f9ac6f1bbda7ecfca"],
+	["0400008085202f89036e91db9949ea486fab4c49dd6b97f4b92837cffb0cf206713c41ffe017c996ff0200000005536a535253ffffffffebf1dfc815f10e04d9c2d7ebeec2424488c992b6b408f0db3bdea91ecf41c5880100000007ac52ac6aac52acffffffffe5e5734c7bd5dde970e8b22ca10cd2473e4224888e0735e1efa4859a16d7a88f0000000003526552ffffffff015c36ee03000000000100c2aa410e97d5530112ca68040000000004435ccfed7e7a429667a7b9cca1a4b912c3f83ed24959aeccc657079de9393fd25220d1703924215389b695c787840b77bf36cae74e9bbc3535145a1ff48a3465152cd7075303c98bf5e259c463331aa4dbd876938260240dbe9927321a5fd57ad53d2f9ef3e522cee13da6aa45d6f68a97baa51df10f25eb4bace8969c15701433248f2190b6f8e197c7ee3ef4149b2ca362b4ba35502efc46e42a59e4c25239484b8d7803b7f4eddfcca808cb694d22216b239d383f46aefd1a365f1a1e63743d8eeceebeaf2bbeef6ea2b333c32ec8e2cae62182c3a00f339fee2cd89ebb663d03474f6ce85d1389859f38973f9ef991914fbecb0e1b95c551230f6cc03923f883ad0f239202f7bed4bc9c7069b2109ead389b486e641c44186680befe70e546b61ac8d22a1b19f37ff1ba8f66d828f647e393e0d73990d96ea2214206d6f36e3619c7d722124240a1316d1e2a240b0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000007f331b3df3cf1145178ee8f48e37114066b1a60ae5ae609c0eac164edf9ec492f9ea74bd89befbf763b9ebca24dd49e9718097aefa7afcfccae02470849bd819e8ca6cba02e5c3beed99d8663202753ba4319ed9b756183dfce3c5e4ff65e14490ae4d4057289940a0643412270241060345d41239400e6c93f66fdb4def701bb5f8e6d354b26034a612191571c735b54d17910d1ebedd621c7bb78be0b022bf2b36e01bc8f27a13f1ec81dffaaedfa8302b7e91732de79e39bace76cc70044554354f22f7c15d8702fc6a555a761d79eab04279b6ca632ba7ad8056406749f533cb3758fbd81c0f2a3ff8139d9c282f1f5d8e93504d2ea33bb6833d75dd7989e175d91be806c81f5cca44f292a05b0cfcd85f982f4a578781ddcc3911d2548c2409f96bbde56ab946280afeaa3e3e728d72b0c4033998e98c1ad4b0ed89c75f6e3619c7d722124240a1316d1e2a240b000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000bee02a3f28f8bc66708f03f8473ab8f7bcd31aea65f8aebf3c79689df95449dcc2bd47c5d82f38074992b38098ff733d585f7edad8fabea02e90eedf98dd1123385a5bf2bece5533f108ae4f43a1e4f1eb7222159d0306078fe090b8cbdaf08bdc74cbd845d56c4f58173c03f96a452acfa21d6d76ee39ee2665598d0a8c7c6d9c075f4c83045463bb7c0b55dcffcf98b6662b68465b5c28de2d67591576db213dfbab5b17b9b7bc54f6ae00a7edfc1867ee35bd1cb075c7b4f3c5c1c1e04fe320d29e1667a068fb1fca89988bd2da6de174d38db926c9caab2fe603035c7827b451c7c9d18f2267b0d347a08d91197c86c29f62b2824abdacbd7ceb115cfb6519089d43318161119178b0c7d83c4fb9f544088363b70e184408cf513238c071e8716af3e3cb62f9874e79803e5f2207f7e4acefd5204cf6d1ccb85be036e4826e3619c7d722124240a1316d1e2a240b000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000b1ad9f8444c86140fb9bb19c9337ef9f51b0a5bec60d98626d772c0ed4fd0c80c764444719e02ef75b1a8c7f8a266cb6df5acd2e6903027adda2548171dc631e4e7b7e70e0e713594e087fdc39696ce07a1f40a5cdb45e4057f3293cf4b867444f65ef1b18a14eb175018bb5ba3eb2cee0987d8ae4851388e829f541d10b95de91e2048a2ab6252ff16ea0b98184bfb4e936c9fe77ea8fe39bc82708a528c7650f955bacd0996dc69fa509ea0867a1755af1d175b65ffa4aff8990e8727f81b4357bd435dbc11bf6ca5380c07bffd1b2bef74ef50df485b6f980cb9552ee0df7254679217b9cb3d30085166a62382a174838e608818533880b6338f5382325bc1c2a3d9107f8862eb79538ba523ec1906eec355991b767672f5cc607964470516a5e585b462c5330516ff11c283656e38ab1c387ca2b39d6882f74a56d089d206e3619c7d722124240a1316d1e2a240b0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000191f0d89c9ac2aa3ae6d7a51cc986f2a70a1fb9595f37482c9b0db5e359c7c588b0221a71d972a4ff5b97ba15e0dfe8a4290d9dec71ff6b1640f4bd07d156f238c539d30a09c5e51f2947bd9bfd8de4222dca753b9924aff1eebfa9c48c4e72623effa3428ff2358a5337b6efe0dce69fb84f3d71bd3e7a5d90f0c8070e053882e14e88d813564c2859042fa91822557170ae9151b07285812e122c14a7a1c872bb6395effaffa539169b5194ac6b04d12b77873f81f8044f361c69c65d0dabb1a4abbbe5a6674c2d466aeb0421168170c17b9754078b8efb03e9f29bfc0a36d597a4a781b416866cd8609424534db949d88e6a2cda2f85bdf41c71d7f0eec960b826e6f4fa056935cfaac95ca38d9cd5b3f88a2eac965530a16d0c46163ad2d351df4069980c6dc545376a616717f353095d930f34e4ee16656f7d37ad44f21ff7868bfb80e223ee722f15ddc7b45e20b11de54f0fd4921c2c234316f4dad596f091a1af43bd74011a9e85c1319bcbed37c9c0a222170574cdbe5d6db6a8670843c0191c54cfcefcc5da1f3612230f8b3d6d4ef2fefdbfd01ef869e654f48fe1accd37f7015f27a55435c8878e5c0c8bab222c17f3a40abc44750f28521dad80b4fa9a5593c969ae1d907655ebb8d9e612efd23925519b36ba833c225f5bfb581ffc21126fa5d635cb0006f5b1552edc47678c265991d76475498034495d4776b05c5b2bf52ebc0628fc80ba0e13c8f77d5c523645c16e78120689c21ebda946f9506faf2d1e13b428179d9265dad29d888ace1bb6320f5e7d6d68001e1f12354f3c5dc3ea4a41e5bd9bff7964eca10016c70e54cd8ba70f53ddd096de0343aadbd361b8fd36a0e20d8c1d02e9226c2657eaf1939bdb9c87831b3f1643199ed958e2aea8106abe0f8fb554f4839818bb25c7fd0ce125831029b076cd501ccf43b52f0225a20e70b417601091e90cdf28f59958fdd2209f8285d4fa6566dc9f44ebf07746b9b884560b1f6591456999662d1838d4d28aa79db2c299bedbc96050092c4526422d73ae62261a57f44b689b00c825377f81332759f385c1ff8d5396bd1e959af575ef781a8ba63749c349f43c084409a80398d290cf487153d01dacd43de650a003ce4d4ac38f431fa5af903f21e89e9fc2c636d39536b979e5268c093a51742354240b6d7eddfd94c2726ccacaf7fe3f472eff5c7c85082b3d551145e73ba55b5d6e5a3613ba931b2d26c7950fdeffb296dfa84c69939cab34a0b00dbc7ab477200848fe0fd1ca5d169d63d4fe40c23dc727f4f0737215c9c86c92e552702147ce1116895fb4e8636ee684167360ea0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "525163635351", 1, 185417982, 3925833126, "2bedd00c716730884a7fdeb5274d7a5879e6777b215510d0bab5d69e22eb3c38"],
+	["030000807082c40304c244c1cb689201f7f1c34bf4404f3540f3049fd5945ffdf6da19375708244196030000000951520051ac515151acffffffff754dd22e28289644578163ac3cf982dc12281c8ec49e69aaecc96da60163d330020000000853005353526552634c750d427c70c01e5a8d6a0169f97f29d01d42d08ff53ee0546535805f2e765bb312dea7020000000553ac53ac6570e02e73b4c7260ee55f8af36cd844d94db8e9ab1a26c86caa3d161de81b615dd372fe510300000001521010659c03c79d5a0400000000003f130301000000000363ac657ee2e0000000000008535165516a5251510000000045e4a60700", "6a510000", 0, 992503191, 4179206552, "52f2a16217847835aed13c7228e507af6eaa0d54c84a69d5885f4cda8d239b76"],
+	["030000807082c4030405c744f983fa2a16eebdf7af3ecb2d3c9a9918e18836e4e82b6d0be70da2ec9f020000000152ffffffff95165e4eba500d15c8de149e268d7eeb5515855a47e5b7013da62559e0a325ea0200000000ffffffffa7a6998ed2defa395493f4976d99548eb8c721aed9f81a78e33a0f49303651ea0200000008656565636a00516affffffff09264f15d1fc2187dec8642149fbb0de621c393bb82dd6151f12049b41298aa10200000003525265143ed8fa012f88d405000000000851635253006a526a5169a4a10000000000", "65516365", 1, -301323895, 733220448, "e70d8238f2027f2e09ebdf46323c4faa299d7db8a24a6a0968311e4a6fc45c0e"],
+	["030000807082c40302b85d6ed09d719dc85b6a5cac641ef415d6005d907ad3987e3a79844edd3e00e600000000026351ffffffff1885a2cabc667269854c7e95bb92fa038dfa7db73251f0e934328941e18051150100000008520052acac636353ffffffff010744e00200000000055200005353000000003a28d61800", "6a5163", 1, -848525428, 1953719636, "852fdfcb91f476c2939fa43f6589d11f442a12b9fe6ea91a8d8003990cb3adfc"],
+	["dc08b648046bddb9822c1a455e89c83f1b9fd01089344a3c2dbd6fccd9d7b80480a8e0ee4601000000020000ffffffffc5f6937626dac9e9c0777683671e683cab0a1deb2b475a2af5b0b5e5efd12e84000000000465526365ffffffffb3436a4bdad97b950e5b74efec8b022c019e7480329dafbe7d58d61e8c35da6102000000009121d57b11c8060219338c40da734be92f40392a2ec231a3380eb8e58cffcb8a964049060200000002516affffffff0365d35001000000000653526a526552e3553903000000000751526a516552652b2ad900000000000652ac00516a51045156bd00", "526500", 2, 1503659613, 1991772603, "a7b2cf32abb2c9af4d7390c2299d8e341e8d6ae6986e2a30f99a2612e3afa0e2"],
+	["0400008085202f89023a9b3083896d4b27cf2ec2f0a9ea3a3d158f04cb584af0b57b0401760a70c5d80300000004636aac6afffffffff1768df73ceec6b3139d256ca5516ed99b64cc852ae2dfa8dc3e7374309da59b0300000009525200006a53650052ffffffff02487fda000000000004656a00ac5f7eb50000000000003f06501dfa6f4f06e144450000000000034db257ecf832f95027476a4a270a17eaa0200417fba011df6712dabcea12ce4b11fc1a7536277405deab191f427693cb5dca0c4d379060c61a4260440bb3f82080eccf003e45ae68e9f5438ef4fce82636af431ac1ea252803d14a784b99c7a45cbf543c520bf95e8551c0ff82f09c3c12708896639dd1ae8b08aab313e46e4057eb05e021e6c90c226913f62dfa4a5702fd8d3ae5025a3742b8134a031a1bbe2936cbe0a22afaa6654e94b1b6331f2a8f1ba0df5ab7b0bd143d782750f16133b2a48eb1b173ad870f9f9a442070c3446de7b8c42594a4b78078c98fffd4eba4eea01c1b5f7ad23cae391e20108f86f7fd3d31bf7f3ce49c81937a506a35d2fdad0888363e0a2efa7a3ef6e8db08fdd5590a334d3b6519d5772341987337b65074d150d1f8cd7efac2e33efb8cf8a9bc0e7b67dcaa904b6991a0a7af6f2a95f180fc6dcfeb6fe48145050dad207ff704000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000310597e2b32fb1205c9a0c54071bdf8910b80eb943ababff186ca62ade651bb09cd2d5051927e7b4e4ee9ec492e7a5bcc19e5980b8dc871a31a6d035fe46f741af8f29e14438acad2f5a2b2bf59c13e42401df8917a46fd99bc398d2d315b340ff6e06fcbb5998af7c8a4fa7fd31c9cb088fabcdd42a11221c3c7119f392cc912eaf6666b6a0c7841805b5502479355a8f233f8799b0613e62d5aa63b7e8224f74088c8dd55eaf979b81e725f82e120af2e7fc48eb804e0d2f9adc2fe3bf060b67abb6b145ce6825723dbdfb3b62611511d086ad5265ba877235ed4acae9b287417dbaca07aaa65de9b1af44e56c870ca4375be70b9e72a3b47cea67b9fdcc0977d83ca26cee86ba3dc5fa0ae3e4a98f2f01811effab5ac6c7eb5e8b8d914aba5b5844bbb64a53f7a47e68a91cf5a4a6a434a3b3d14f435bd3d7202280dc396780fc6dcfeb6fe48145050dad207ff70400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000059e00768f3ea6214370f5bd4f38e4c1d9c9053c70ba564cd35b4aacd9dde4c2b42866cbbc391285d595b3df18dac8013eab23af4227a4910d69bf12d335dcf2d217b10b503b68e365232a8face049761b1f2403a89e02eb9927cdc0520bc7ea1eab5eab92526abc74af4d0042b087b7208f537aa20210d9322785b27dacf56a35c2d582119c874ca9ed8a0441ee8a146ca0e1aa3a999d661e7020b19ce0e8201e219bbcb7efcfe786f96cc97da2dd49a88287f3452148271febac3d6b91e6de440561c49b02ea5896362ea5eff672702874f5766aac054e93777d8748fd7003ef25cca0d458b08883e9b2fb85e0334781b6fc733db1c470c69d863ba8d5a112649d375fc7d7c3e00eb47a76c66d92cf0570522c5e33b26e2743c2f62b8367df863a352be87a62e2a83e900397abbb0a72217d6a2c29d2bdbaa48ad59ee86fb0480fc6dcfeb6fe48145050dad207ff70400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001c4af5e7553040776d3500664c61c19057ade0104ee346b2d571778ab3736f555343f8f04755fe5b44d2072ac973eee9488c33701cc97ffbd53fea3fcbc81064023edab2d7d14273c68676cbb90db17e0c7262dc2e63c1d0fe5ab7c7289e3e499abe911e672ddcf8001196fbafa5db362a8e1e99d62e1afe82b5974fec2721dc86496c6b2bc1abe80ce75b11ed20b93cf36d3b639fdbccc3986f3c2b2df3c64a35b99c4557f2a7e03e2ade02c14f37a45e4e3c1d8de7d4d37a9457bd06527a5ce228580301d8a9b49ddb0d5ee167ff1beff00c0a1890f4011a42b80578eab16b4ad7c93b694ea9c76511a72b73222c553f770d462e627917338d37022bb0ea2011c722fc014561929d93b5e33152a66801213787072d0eafa7f295dc37b6d9e35e91e6eb93b6879b0c98f77af41e1b19300a4041f917fb2f5d19dc297a8b78e524cc4f8aaa4ea49f12c00c988f666c06ace07ed52ac776e9f73e6fb697624c11fda364c8cbd38db31fac2ed605ea0de9db9cf8eb89e22b872aa01800728d6e72cf9567acd4fd8f9cafddb71d545c460b236a666bebd00989d00c4183e4165858451bbf2ea308cdfcc6488b3f51929bbbfa45604ad0511e7723ac469169ede622371e4f10cc2ce0e8304fe72ed7dd105088208151d2aadd57a3a1f9b8fc8e1a3acf8c362b5199a4ccd1bbcd2b1d2e3f75ae6d11727efa338e8e80f999a7adcf4a2611c34268b352d674edaeeeb43d167406468f37d8cb67de9692b0d6039e7eac310cfd92a970ba76fe1bc524c29cbb999d066687d854138c4bc4d4514ce307e12a45293504b16afffab6ba4f00fa9d78a01c2f9cf172a988cc237b6eeeda491d4f480149fa26bee9969ceca42bc60c2c1e340b6a76a8d2566ad50dec20d21797feefb1853e9c786b80cb27db7ef5ae4bc3aba0ec8e2087ebbe9b8bf0680e4045974e95ed472261e3e4c23dd348f38f5f1b497a1c04280421edbc1a438dab2b545462a7a89c9f0edf9fa01dbe9630c252f25b45a85b17e612bce99d24b2b409e0cc0727c2e9beaa9ed0237b7d717ea8619ea56b861f068b3e968ab13bebe47c8303e57e25664c9aeb79b3e1aef6ad5f3805180bf900af790d52345006602a98bbefd95b2d32269a8875f5aa276b961333b8fac40f50b36045ead1ddd1c50b351d3e335c7d0dd052d1664a5edb4e4fd3625363a2966212c0e6224faa35a6e67fe95231b302c56131e79102e9601ddae0afc6a8cdcaf0a2d63f2d5a44dc179399d1a88171d4d783e5f1fdce9d5e00192fb85639fe474f9e95716c97254c3470d766e6f129a59b8fe24ac4075d4cae327fddb963be3e4010000000000000000d928d70300000000fc742445b4385276af6ec24918fe4b2804d367d15bd8445f2e6236e9dee5e9961381f43a55dfef5ad70bff23f648de8453c6c35cf2ef165a99ad0ea021378da91c9e2262cbb39f880ca015b0b976f6920f2805a873318bfbe316602bbfbe410f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000c7d66da1328ef0e7c6a2ac9547ea789b81e2c2ab08e3ac8dd619c42ec0823ba097186c94bc462033aa0ef028e99f3ce3410399b67cd154b7c092c605ff4fff76fd88508a7377c6f271886cde71294fcca79550d662a83c60f889f90fa0a2721072eadeaac0639ef9583831d2a8bd42bfdffda2c7f29f6cc7482d34316df1f050f9550f34c28b0e0a1882d8f3e3a3658803da595cc5560e834debc025d1f6aa9bdaa14e170c484556455a927066f9e208c800809edc04dc0297b7132a82bd83fd972ea9365becd4f1dfa7da1cdac052d80a4566198e25e9e7e3d547c37522b936f1b596c487ac568b3a7a5989dbea475279da9c7ce4f88c02e64d74cd59e2f826ce07fc4fd7b1a3a83becbbe94096a8bf1f93423adb1e81c6b69d129efe0d8c0b79606fe875cc77950fffeb52b1fd7b4aaa42229f7a9cbab6853d6e53349f960a39480b47078a1bf39aa768aeda39745e84d4859f72263c61bc554bb932e6c0b4bec76c3b2edd78d2521be5ee371d5e3a34f26f995cb0da693b4b2e51ab98a7133ddfcffd27f3322d16572e04820b60484635784778c775c52986eeb35a76e776c1dc425db9dcd23a7a97117c0bc7f3f5418c53256d4a1bbec78469fecbeab525c1737a4460adbe6b057f407b21aa30511826c434bd2a7f0f0f175e6138bff8a8f2db6a21897543a9e0747a500ffd3400fe36367cf5098c2f9f1ecd79aff8034b77ea257c422b6d3dde90baa8d6001ac3dd3d783308d23e5bb367e1e8ea17c1d910b734a1315db32fca37f64907fe68a409b7a64984d0c9d0ce03745eea592c8a7e57c987d1cb2facffd175141a52454f77c7d5b3c373bfd3111cbb92977a4d810903a84d63a28f34f301819afa370536eec06b92c4f8408507d5ebd288e4a1b6a931cc350576b69a2ea23553693606535765f37d620d2afc7635ca4924bb297c58c6e7c92c701dfb94854f7278f1d761c36272dd3ba12357347755850e8bc4f4d78ccaeeccd3fa173f5acab4b43c900403fded2ef70f49287d2c3eb0b22849c6bb3806211b4359d7c982655c08f658aa3b37529569f2ae9f1065cfc17b0202b9b6321f55eef72fe5d467077a7fa5f6eec1712dc51074d13d4d90c2a10cf85b58f6ccbc181ba63c0ff1ccf429964fb794e806da010e8a2d1af3d3d2883299934aebb3a5fb1b7ccaae2548e705675bbded8d37444a2984accb610987f916b7d4b5ec12e001cc7d4bae41e1ff97d2b3f59873dc45c99292f440a3052a6bb75d7808795ccf1df54cddf09eefc5d972b579bf8f4957af0d2dfed01a996dfffdb3c409e1ea3c509c7a5d3abef90c69140f62d63a946bc7f1e02bbe282f74f66e48c61d101ef69d35bc8b1570bb694b899d91d8b4e4a731236795a2d027ed921becfd8cbed225ffc546e96bf1f4d49384d289ad0cbdfacdd0626718ae7be0797eb8ba0fb8c133b2e531ff5eb5963328d5ceffa75b12872595edc40978b349d9daa4b028946795f40fdb6c42cc39592a226c889247d1e0a4524d078d38123c82f995a7ac80cc3f17e18777ae55ef6de345d0b2eaa7009956426926f5f857c325b7da88457cfc035b79687e984cec10ba162d6c93d7c20b3231dc6af70248246d869f10f6ae2d8766f7773e4b0aa796f7a448b67bf194c1c96e8ce6837fff56f32fbd0acbeeac4b4068bb99b7453bec0f7a78d09d879eb0d94b60f7dee97b042876ecfd93b8a601d56fc317004ea7eedd1d3b9bc5194043356f099b0b52e98d5b046aa38ef822a6fa902effd46c4015e7e91bbbe0b7b4b028bb27e5d9f27b0d104dff414f08260931fd51994fb1f7fa6d2e64acaefc6000954a7a0bfc8d9db1b4c53b379cf8e89c19ef8611b5b70699b4ea2f6eaca860b1ea367d0b7929591f4e072246eee2858e9cf888a91f0b5ef231127eea60e2536397f5c741e1a57b0e22849f1c3efc3f07aa3e8161902e0a3eddaff89d56c47b62a9c15341e9dc3e0b81b6b8cd46e6a9ff1326404681a45c4b2ae19555c7fab6054f390ab761730ff832b2d43f4b8597f281193d06832be56e0dac6f5c4068ac6bb8e92a0fe27d480ed391846f7b53cc48b47471aa2931b375ccd367da37c409b3556850393b9415a6d3ac6b89a5b3fbbf76c22c589e220f8f6187c522e594a18c9ca352d9e40b8ada4d390962ab6250682485b95bcc5cd56f52e6f9dfe67f9aae72707d24d4a34609f8d5a5263e3d4c84b63e089b72d4dc7b854f338b45acf175890ae7b81a383ad0164f207d76d4b54d463da760824ff1f05ac42366502f0400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "0065", 0, 278747600, 4122551051, "bce10d4fd73ac0ca0602225a5f3532c6ad85908fb520fb76b09b3c2b297fd6ee"],
+	["46bc217b017c9c74512baa5cd6e0fbb3563c3b3132b4d01627a2cb5d79653a764caa2573de00000000016586a1cfed04fcc7c301000000000253514ba70b00000000000200ac9ea402000000000005526365006371f2a4010000000004656563510000000000", "6a6a5352005363", 0, 540248985, 4179206552, "d2ee8204531bb0a2a9c45b931100f546476998950ede673633a53c7224ad68dc"],
+	["030000807082c403023118d82a1f41ab966b69760c3595745bf55615502b565295c46d2b76405b7ee3010000000465636563ffffffff72822773d79a45d30aadd11467d0b0b5aa8c68bc9ead9b95c2cd6e015f2263860000000000ffffffff0143722d04000000000653515353515100000000432f711a00", "53006a515252006a", 0, 1154690953, 1953719636, "d0bd4ad1e52d1de974189d2aa8726ea8ddc32b12107fe1a3eba20c522d5310d8"],
+	["b74b5c5001b4a352fe14f6d010c1f3046d295f3ae5f0d440fe92f56d5732627cafe694393703000000056365ac536a42137d6f047e6fab05000000000463655100347acc05000000000011dc12020000000005ac00acac5369dc6b0400000000000000000000", "6a0063", 0, 310564478, 4179206552, "3416980c8ec53824144dfd606ac2ad9276675ef9df0ca66f2155c28f2e04a730"],
+	["79ac6c2602d12e0b4c88f73751e537957138d11e8fcf346d6335e432add5466ce0c1af4d1803000000066a53630053acffffffffe8f3ae85c8098a5251000183441e364b2a32b845d31189a0a04e8c914fe8d0850100000000ffffffff02a873e6030000000008530051ac52630063a7b15801000000000252650000000000", "526aac65acacac63", 1, -180866128, 4122551051, "8f6497b9bcf28f85f8f2f03a1028032465b79a95f3bd7ad91ea84b8e35bfb333"],
+	["9cf1e52803e00eca27d4c4f3cb9bab6c9518bf656893df3517ac936ccad177a299e6c558210300000009ac6553635165650065c1b5764973045ac3e8f7205ea77f1f6428b41584e797ff1c78ad6fcb41eedfbce16261bc0000000007536300655365acd1615b8010512dbe1599d71ea71f8ff4b58c1f62a359195a371153b10f94725b04745c0200000000086352ac5263536553ffffffff028ed3140200000000096a53ac51656553526345f76d020000000005656a6a51ac0000000000", "51", 0, 1964631472, 3925833126, "7ed49cac349b893d30fab5bd32b6cc74342d77d699c86e61a1c9363dfd272bc4"],
+	["0400008085202f890414d4b1d3e776479ddbef09b04e060f25ea4bcbedbd0adaf53c97ee775fc757e00200000003530051fffffffffb5a765c16fc5eeabc01424fc30dc088297b01c2a34dc51bed4ff70d44916a9e010000000852ac53ac52535152ffffffff637afda29c8c64cdc857a2632ec6a4facbc01ab7dea69269d3737f65e5bc5ac2030000000263ac853ec5f5706103f2548df8088265f4733dcae7aa9394a0a044dc835cbd39be19d26a8e340300000009650063526a516aac6a3b4a242f0238157c030000000008536a6552530052537976b1040000000009630000526500516a65492d0ec200000000924a7c0200000000015b6f56a24ddc40c5c88ed3fdbca4ef15a072f55c1ac9a51929ed43e5e35f16b62f8116c56e67709bb6ab2e7aac646dbbca0f79493a9c6e5da1c852c92a62502aa05f8881c66693f1477c4cf7637a9e25f85436292778ddd7a5050d4ee170dff90caccf6f2f24b2dce715aaf3852425c10df014f175834cc78cb54c8c8a6f839a917693400c862218af1e33cb73930289a32d2bc06be43d04f735fe4d04fcd04bdfd35886f6048611403388e5fe614d494fb7f18726fd212ac3850d1296fcdb5a8b86b9e077954680e32a236a42f380398ee082cff9de97426bf3e93890a05d77e53d153bcbbe9c7f5561819944bdf78c7d523ed597b19c2f216c94d90382bfba73ec108718e72f86673a9a0270f8ec7ef5c37a36ccffc0c23925e8f9815c9298f750d6208e2b1c1931ae61e221c7d6cdd6c7d013bc247879fa1642a9bc75cb494d463da760824ff1f05ac42366502f040000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000388a556cac627faf93858576caf06eed69be6c27a30cecd7298fcc0211ac66bb01fd5d893f3a037ce23be10ae9f73b536ef46c9618c7386917e9ab30edfcdcb076c1c2c74e8f4be90e9cd89ebd13f35ae25d1ec4aa23cac02f1959aa156525c27de0c1223144a4879671c1ac3f3338989e18a457889d1ce5e523f3c498031faa9c405d5d12722bf90fb90a15bc4773300294f8ba65fda41742214e46b72f87c850f6509adcb81a5a3a805547b4b92fd8cdb846e2d25edc92f9f4c72e99bdf6244123ef60e01d16daa8c35a4ab6ed19a4d5d6d4c242a3a28dea51d4ae35401d6b23bfb84febbe37e79a1afea1d8d152062459bb1df1e191e198dad35d3849de1ac9587b2989d32988d7fbc804d44ca91b2d3638ae95432603a8c2fac2cbd5370ac5fee7333e11d4ec653b784ceff221ce3c0bafd96b06418ae8bca5157de4a96b2c438fd9a2936737d46ce96df24b31c9e98e68ff1a07aeef6681e0c5f1e1b331e9a67c767a0aced0cb98a6fa090b9c44a948ec389210f8e52e8bbc58b1a2e13f065008454c6859f7ca1db5d145ecd6386d6da118f8a945464a7eddcc4080b01b463f2b44306d5831038548789dfd7f8dce21a052f28b32db44d5bb8c70e666f73e13bb8917f2da8bc3659e6c16172bc2c1d1c1a4da9781544118de5b939d44b94fb463ad75506aba13e23766afb5c8ef78ace1565e548393f7a3236b068dead460cc036a6c5a1ffa183eef3b8003f0cdb60d36d374dfa04a2adcf6c4a01d2d38846ee9029044a7d2cb687c3f9e98a9ad190dcfd5148c09c5c4e1431a3b256d8b0589cb7d5590c21af375e56a5eb5e190d22b3a70eb48e497fbb95d1eee67d95a0c34cfbdac9010a1929b73ac383ac65058365291610bd56c9985a27586d1759b722da8cfb658fbb43cab93f8e2f291e03d539c5d8b877c4320d03bef2b00010e5bcaeb7821c487773b0b760338ab4eecd59cb5147baf8230261656b1e0da88c27b26b62462f5bf216a1f378e15902d442781a3e840b3cbb6cb554fd1b37dc6f8ff22358e0ac7e81678ab40cff72da762b51a62a6d52ffda29e102d5b0e406239ab84871e1e4d2402a2c81f3568db5c0badf5a03721ea94ecec7d2e2ffb82a9ee7ab058bbf910b0c5b6f52feff7a45b69a269f592b4ab355bab1619bd4b78d76148144ee5dc272952803c9c7842f7bd27cc2c50f25b35fe682864752abbdc85e23ba78bd665cb7d678babc25895918e643cdeb2fe88175fca079eb8e4771f3ff62103c4e8e6f92bb6e33cb57891b8a710b0a2cade28b7cb56ac8caba937e7203975c064af65c0e261548a317211cfc11ac4a615813e2f72339d46367159e8fddd2f3a5dd2759f82d3bcd4fe412fa54170ce70d366a3de82fc946deb3bf50b79891b02b49da2e1accfbc4eaefa5ce050f8312a2264e5ab3bf10eecf0f50020b987001b88112cba1dba33b57d8d2ade643fdf25194a64f040dc19bce9c947eabd6868a66727bd9c308ae95b822ceabf145ba52cf55b20319ee97e8e9c8db388550d6a74e705dce01ee5ec54218e9ad9cf7773e232e39b59f9af148dbd94e207928667d8c257d0d3e615b1e2cc1087c98bd20384890e353a2f49ccb25ef808f7a0f7fc624cc0d01c5922b5695e1d67aea7623397301295ca5f73ffda6b3a687882a7c2faa6f7b166312218b30c0d040aaf656bf3d6698845532a5f04d63a2e8e4bb999beaee43ba2aeda547428ad1f076fc3e6d014a40db8be2067ad4c11cc6dd2ddae301cffba3b305539b6869a5638773837de7fa912a2f83c4ba3c88a40aa85910e2423dbbde20301db3b6d2891dc7a122d228b212629e156143eb3be29b8d68010b980856fc823265fa52759a91edaa1dc32d44ba6f0b9bea74a379de1ffca72777dacaa79fae3a203ca61524a6f94eb07d5da88400ad2c89d0bf46b3af6f925799f963ae8d95db246cde196371d6695a68a42f67009d0429a4d3ddddf3c9cb786b84f53679942eb79130655cff96c579a988105d4ea425ca80ce1e10adfd8d212bfad0b95508260545583f8ee271c05ca17436a64d04962ba66333e60dddb26dfb7b03567105483d9562ac28da02e5845dff4e98c4502f898f6245cf9f2c8a2be492ba9f5884ff486edbf1247c86a02019719fc13a3ca01fdbf752eea0e5289fa0ad8247c0b01f5bcc5f2807d2edce12aa8c3041d2005091e115536f7eb7b4507302b45fc2bc43740863f95d0bb92b7229679f546f07adbad0a9989ede9c5f36f3b292dec973159b8941fca8b78b1be980817cb2ce5a29d90e8f75b13e6ba860bb9c0482e255000263bbe136b8685f0a0e1c786873a7e02e752c4b811d93496e87ecf83cc0bcbdeb75aef13a900c24608b04abb34bf4abb8d08d9fc7fc0c43434cf5a04c419490a243947568c097261e79b476caedc8b85f5de0fbaeb8d5d7b82d9ecd166b80c655046e42229cf65e9b6d799f8f942ca5c1fb45f2cbb8b347fcf463f2252a78293f2df203e31b3f477ef771272437b04fbd760ee8974644a80dc7f4315fd52fd03f68b8e5f5f9c4bf1da712d75967287da85d3e7690aa14849eebca8cddd07630788fefa9adcd92f1fb9501bfa207b5d8d004e9c7e6dd328d5233f4571e9dcf32274a26fcaad69b20f34dceb6659a859307db2ea42f4b16e8e5d75e0b713e96c523cc4465f81eb6b273122e71aba98eaa01bb99fba7e9e3582ad7b06475548f02b1d60638ef88aa36df307008d064fa5fc76ee7b5326ba60e00d75a987d6cfa0a6974bb552d88091c7c8fda1828c4cf229e0c7b124f8e18bebbbdee55bee48a375b300fee28c51f000d977bf123383a462ae2a6616170284ef501b1b967ef850bad82abad104e19d8d5857f1570fea0533e0db59d2566e75e1b0b05e3c88a37ff6a5fb5405963c5f239ba570f59f23d8b56eaab57163d255530cb29143a4dd35be4301bf874b023df3ae2962793891e9fc4da6ab0c4d13afee250f1f3c189c562c4728e7099b0cb9f1896ba5e076ab73d90b6010b7783d09b4eb4f9a9cd0f6b8033abd768da27c974263b4df123dc2f8bb8d951975b05ef9b13578611b0f526589f2c0fedbaa9293fe52da97c3652eeb477536448f24538ad5ec951359c74f21dd2f4e8ee61bf03f2333d50b05cdc6215e58c3c43102e40bf34f6e8b19b347f3416fca86283fafa10aa35997a42bfdb6a9cacecd1159d6b9265d64d29e534d71197c10b56df19518f50c17e8441ff4d3647c2ffdf892665fff394e4292404be5108587d37c0a052b156fef588919906fe85ee7305b7725b509d0eb7e5a452550f77e2a0a41e8429a6580498523909861816eaf64b5399ca064eb13211908b7202e505d3e60d7792ef51bc06eb5a458bcc6221d5a25092a2ba66358389ddf7bb9b5440b927f2ac679b3290cd9b7feba8e9419a8e6fc10a50f8bb3c40c475606ee19e2cb675f1039f126b876c084fb2021db41469ab5932d451f8fb70ecaa516d5bbdafd053eb5942d25e750c3dbb4ef7e468f9527d6322f89665ffd1d29d7272fe55f923e96b9fa303a7ae05ff1027d366db934fe57b58036424ab6876668debe060078a9797f7054dc94c50c381e2123c45a102761f642e522a02035a9029375b6218bfeabfb108b3ebc9b5862dbbc7048056ab87a8b9f848cda3d148a01bf95e90ed809f1dd69d32721c33364b6abd6f6c0b254499a5f08111c642a94f6569d38cc82fff4d35d9bff703a24b08d6238312ec781871e4c8583998ec7581550a363de00aeab098c06656ea71a28489e0219410de4282d8cdbe2e7c7089805ca1d02bafbe61eb39cca276cf6d951d4ce779beeb3109e5f3929b4f40d65841caef9eddc9c38e6a7469a5bf53ab30573ca8db1434fcf1fac629abe68cc7ebefa6fc5c5943347a21edc9a876fc8964acd0beb65857c9e573092492177c11a75f9f6687a14fe58c5e2e27ebaf5500fa733425b0819471bdde134403f32994823b695547149d58ff0cb520eaa5399ece4042074b21f514ea200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "6a6a53635151516351", 0, -800437618, 1991772603, "d1ac6b03ad0805e192b216dc96347c37e07a807c0e949c5e229cdbde4291f7e2"],
+	["0400008085202f890173fcaf5e783b1f33c9bec396a8ea8cd39fe99ccde04d313a6aebb416fdab592c0000000000ffffffff01e02aa704000000000363ac6300000000000000008469a2020000000003ece6b096384664bbe4b8a2810600dbfb3aea4ab16d20532dc3db801f187bdc50c079baa027a98d939aae71ecd67b0ac8c8d02ab6eaf698cab9cd11c5d6d95a0ea4ef6b0fd84e2e85cc882e3a868c6efc0282b60673d317b8bf08f5fb1e065ed51cfc969ae01d6ef2891c271e4fce7ce8d05a25f35e320471920826b1500afc4bd9f9947c3ffa8920c7597321808cf52c8fa9cef647d868565380f393a1ff16dad11449e40f0e3e0745d28accb1c54be24f38420267a0aa2269e7644007b81af3b8f5bea351c2115a4425114aca76bfb0db1ecf1374b8dbb13421bc5221ba3fcfb8d0c89989a00ce0fc28156e0ac918add11f46d46e1be6a6ea27331a7a5fae8c267377d96c46ac0fa626c272898abf72517f4f05882c23a236b9740b6f16bac7980e52ccae8ac5315f725026fb7848f7b9d0388dd1f181146e40b890a91a4ab39393575cd663b02b421a829754cd2509000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000291db7b64df760e7a00f4289f076a65d8b47a8c5d256e6b3683b59915673a74e3e334e90cb92fe8f6f846241a01544dec0deaba084c78e372c495cac9a20631b460f7c2105172057bc171c64707b42bc9f62d9d54c35f40a82e08eb06ad7e7d0a8e624deeae5ba3e4c701f3e351770193930662325d28435b15f7f1d622cd60df9235106ddf8371fa25023b5d61c254f4f39497cbd9c6d30e76bac885dd73931c17178102715deedb7006e8cd243db4e22353fce9e849a36b9f13830ebcabfe84628b2a0b56158a7443e76390c8ba18f3e3aefc049fe4422978209959fb5f3edce1c9cfbfb776c25beed742b454ea2a99dcae53153b2c18b5f550aa32fdf7cafc2b16afa730560b5236ce8de5fd90a71b964dddcb68e6c4e03fb59b2b4fb64b51e0086985e6f3f9e9e4bebd2d263bb925c24bda71689f41ffc32859d5adc8ba49393575cd663b02b421a829754cd250900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000052d5cbd1b670ffcae4d0f1ee043b0dc7867b0aea655037e20ad91862389a9250b4d2aaefdb63bd3648ba525718ffbf70bad4c7b16b423274259d7c5999e17d28c9901404382f721ea9a68da70a6e527ac93ce5046607664f6d8cbae456702ab6cbeffa48fb2ea53c8c3caab5f95522550159c87577a1a2226e098041c73ce3676f7aed553f239f3905d4fc0f2b4bbdb6db58f3d5ac2d6b7e0389e0a56f634fff4704f213b9ac8c1ac7d8c3c013aacc3b10fe8d8d38b06ee1fb9b0805d5a9ff3150b6464046dc77fa16ee2143ab773e27fe349665afe5cd7a08a224dd3e70a721633f6def228b81d59c72515fc289b63d5e3d3f1e5c6d3bd0918e0cf360e452aa03dd6fb1352d4b55affbf96098668d32f8b79904832a5dd9e1a89a73d1d661050020238030f8ed53b7af93807289884071dcb7f5d9bce7797db87b4585b2b5309393575cd663b02b421a829754cd250900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001206072ef52b71868673e9f76d9e1388d0f67d7685319fdbc3b3488555639551cc3e71d16d355838625b8442cf82c24b2b75469e6bc7d3a4d2be7831e85551c48fda098cc6a854206ad57e0c02a5517a0f4f8ea7857a60ddcba0e76083bd7c1c98c878ce384f0d5c19d1b0177601b01905e347bc3a8a4081ff29887b246bfc0c28b2ef767dbd44ef3abe5c0da1332e6df5e4b6be47b4df9dace5a482c7e07502b3d63540b43438a2e6c64064374cf648d92473272335e69bf9f1d26e497010a0ad86a1a031f059c46786537fa06b4e6372aeb513a8370d3a9eda80844ce0897d120af19265ecac36abf9e3d9ebc2e3a399ee1249c15ea0a636452560ef0513bfbeb5c0ec3bb60230617d27c85fb41eeda503fa7c84058cad79e7d03d140d64306e6fa85b33524770c5d2b103df2928c12bdfdebf75480bd6badf33742afab175ce8201b2d7bb6a0ae2579165783236b78479b4adc576164cd9191622b341605a45ec0b392d5b7b21220d5849350fdaa8b229db5a3b3bce5439d8a7e81cba511d28dba0f8e6e630b538b439b0853a0f3d6713c2d4d790d6cb0b8da687f33c56f011e1f519c26b0c209fd4d9975876b5b65bd957b0bfdf1b4693ed9eb715818ea200bd8842e3944b0ccd59e89a8b24aba32ea69f96ad9488c7f8607823e1551cff642b009f78230a7a7c66d8ca7e7a7eddc2ecc397ff99f5d80935d578c4f86a8f7cceb3933552c879b9181327a952e424d75582e0edda0f94edb1061c01bd54b761761fefb4bccd71f915f84de2b0aa200bd4c60f9be16c0f621b224de8ce10a3ad6a5001d27a6ce58079da33170b19619b27c5599ff135fa8904c14117781641319eaa6c576d24d140cfe775fe21738b28abe6abe1a6a170bc93fa2ef79edf18b287376266b18c8f0d2cea78ed665f91e79c6d14f4320722fafd61e799fcd4791ef783e41142bc11d1a784bb8bf47399b3c6c4631cf7f91b942c5d520ef98344bbfcc08c029c3a289a927e8e0b9f084f7b24ea222fe2e5a877c3d2c3925f20179b0f59fb334cc08e7ff9c2e917b57d7e3b4affd30db0ea5cacd9d34ea6b735ab253cdeeb6876004775e713b460c371766a19df48661c6c95f274bd04c6ae89a5b9e17310cbb32102753e90037fe118177800eac84d42289db3a2b11393159e426d618444e9a02727522c0569f922ea12de5787caecc36cec7def6a99dabca8c4d769f37386cbb630f083052b9a02790b75f644308a255662cbf8573df9ed36211e40e719663a125ab9961b23df4aaf817fa148d352dad9b3b2aae35b4a6ef6c7e2653c88a3909199df34a9f3422e6d959d57f90e3020000000000000000116e0d0200000000f0e457cfc33c984e26e808053ee47cc1699e2026e9d528e26b53891dd16fb9e6efb7d8a62e65151ee0c08806785317517de85bea208379d52bdd7ff96b68bc2cbe812f4277af63ccf95d2e2e7dcd05058b3c5c51f67bf302d75f72c17238880d00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000424886d5e6fa03c31644a83d0b3804a92ef64a5b0b823ef4fb6f3fac0f370acb047abc9a747e807a4dcb0e21a2e95ffa0ed79da95eaf80befee1454135fd6e569726193cc89ee35738f631f745c02cf18613c9c725031e51446b6f1aafce9068125f83c5816d16f58d4df1c149341c9590126f20a329785f70c8612eb286325b39c388dced74144d78779deb6f5f668abd9f636ec7548837f58c4510a240a73d787b7d7344af0f5116fdcc2c40ee31a482cd16cec7207533187ceabd11ab7941c27e283cdf58a6fbf00bb2109b9fa8412335c0ba3d8bd5a962803ccd870a36139d9ccf57bc3bba9a70f4e90a3fa77ecc68e27519da8e5d1ea314fadf478f58285beedec71fd54ccfda2c70dd7382f97abe05af7c67bbc31261a1eca929ccc254a4738c0a8b92585761ffde4cf63c1f809119b25795b321bc789765dd27643f4f82727dd9eafdfb08ace64d16de959ee09894db9adec2edadeaf19d56532ad6fd705541a3b10350963972643e3e7d1c6b1e9147d914d0c00d399eba29ecb41088bb1c8e68ad4a052d42b7b1ca668995b654ec5e78489eddb0a6993fb43c0ca0135e49bc1b5b765b9f38f38c391a2d5bd6beb6326a100ae85964e309bbb66c76b353b8eb23aa4593ad765f53d4c55e6c579b19379dc3e46462ecdbc21e02a19f915cba13129a61f04ab8932e78a8ac4fc9e5a877c8b34905116ec909dfb29e67a9aa049299e1d95a30a5f658b2eef4365ace930c4cd2c3350ff4a74c8206ff3e36367ccfdd66f3104a94c5d7d68e3005df8d2ee77b6f669ae7f1b7e3a2b8064561ebcbbea867da37c1253c95815755bffb8cba8f86a3eec609f2a482dfb49b61e560f873483a4afdcac11723471b6403ac6f9b329be19777904bd063124f20d0bfbac8615ee7a81bd5ef074e7542d0bc0c365c67d4e00cd2699caa4f42e0f84f044cf4b92b6329196e45759851f05a44117c31c8cd065bad0adc81321e5af207db484d5ccb88104b0cb1f3fcbf1b7c6f67fa29dedf1fe913366618e92b58a9c350d9f1668fe90f84cddeaf602f9c802cf0e95b532c48b693e05742360822d7b414578fb0d9eed330fd202f3483ad72252942ee55c4fade5f740ec671a12821507171afdd780320576badc6b9c8c5174f2eab57d2c60bb4fbffc540f9a68a14a98728d3374a0727584396c3d5ce03889b5dcedabdc5630538fc226c0718107a39b1bb885d600fd10ba9e84dc9ca1b5f45e69c3d778f57db3f64686db6d39f6303c8066b1426b1ea8f8ebc8bde5ed4d4c2875660e4e803eb356ccf591f14a61402525c69fc0ac89ab83ebad5ad174fafc9de6bb5782d986e12bdefb7693f728bab53fb2873747963fa47a1df5c9c9888ee1b430b154f2af7d23c0cd2ad30d0d6780db1a0994151d58a07896088f52e49418ec5e2d3dce68dfae40b09a8b78e760ec2881c287ed45d4e6a18ba346e69779298411e2ef3c7a4169388629d1da1e37a863ef3cdd814c0a4b98379e1dcf1d03ca110bce9ab7829ea3fd623397ea6e3224f3e1a04a3b443272e97956cd1391bedf3c507fd455d450ece6c8116f91b996d5c3776c9cac8c194f0c78ac8eecd84292b83cc3de6ee68723b3553591513931237d950ff5528997bbf1545b022e7da6e3d511036df946e612ce2d3103d41cfb1510499428543d62f16dcb7daebf55e4c1c0fdae091b3816900f0529bb6326ad05a100e039984bd2aef503fee77f80587ba5825979e8933214118e200c01a76b5474c9dc0e831d1d87e71b84e91ed6118affbd412bdc7ce370b23aa756fb259d75e1c96de0cca25f5ae5cac45c0d16fb361cdee0f777cf3e57b25782d5f7651bfdd7df3ab080eade5378fd7b4dcc26b4e917acb13b644f4d3dfcb06771a83f0f1e302d7420230d80f4636baf08d5a04810b18716efd6a7027936b5e95d4ab274b3377ad10de35052c92c0cb9328bd2cf115ca45ab4c70afe14bc1054105f0c73cff658d9d683be826c72a459b804085696b4dc16b48cfbf3132add54fdd89d5923ace3a2116155fae75a24249b0693aa921436344956cf5d9eb279bec6bf04658de4e2575229588464679a53d083fe8f0cdc0b0a7541ece621cd193ab14bd4def9ca8d7b61b2606df2480371faf492df15c6ac500000000000000003404940300000000a3808bd563af225d61d219a5e8cb34cf7dc3e8cf207b7b509042a13d8f0d27d8b3a1c7bb0971af75db0026addf43a3ff7ce5f74e957b4d1538bac5a3e6b992f6fe0ae833b1b549b93807262944c9dc9c31d6256c7b8e90c2d4869be4b4378e80000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000007e3a60d754821d564f1612564e79cdd13dbb6304c3c23a8332ea431624df3f75ec8fb031e844f855c3261ae7b78a61987a997af69a9fd72e28159fba6daa3eb1a043a746db7796fc5972ec6861a4bd775a1baf39a2229d400cf97798c6bdf03a28cf248ed8bb40cb4f26bbc9a3c617f757f43954111df512792173589de2016fb6da95e5ca4804600ccfc3ead68e4c60a330b9561b864abcb6e8f9df32b1a0689442dc0c9a68c13f6ad93bd13732bfdc298df871d09faa3ba70c6e1e093bcf2bb57ff54d41ad43f8fc1cd0d130c93dc9bcd61814e3ba28d256e3dfa7eb9faaf6537392fed62e1e682e548f6c6aee014a46eca312f74ae68751d0418d28bf57e994e179d83ccdac8ae153c43023ad1adb30cdd06283c7e652df015f2206f1b734d0aa1738149de51c10df01837a046f28e52a1b583d9244f727f63a0330775568947e8c2515f6a236fcb39591d8a0cfdb839885bd60f08e03da72fde77a6b8a5a4dc4c79ffb724b55e03fe58fec0ec1539f4b4a3a596f62d26c1db84e4e0ad915137346f815bd28d191f67ab7e470bcfedeca64df166da82891ef1f0fa88a38e8588338f90a9079b9586b77252e8b2414fa0b393b5f9dcf2bf6e6f08d211f553a6b5534f9904f8e28e4ad04ca3f00df1aee00ecd3e0218574b1a1e2a98c0d9edb11b8a65515b67e07e93dbbe47e6e053c53beed12325d7ede9708554fcdc61c3e95b9d3ac9a843be652248f328011773f761c0927452f7244839c69380883527574a878829c21b40dfd78d3345d571d869409aeee2a0dba7d8e7319094f301ccb8c92d3ba365beb2fc8a0946f3cc2bebea006b287a055029222b5bf978f379fa6201ff1d81194dabae4880056dab0985a71bcc3f49f85afdf069f35a910f59e7915ea1f0a8be5872cf20f686a9357842cd61e9e4deeb07599bcae591bfe7d0bc4d798ab49f2804e31bb75354e06c69f54d626a9d326076792ec57982e7349cd251d1b609d0b9cbe08b26250fa41bcb0d42c0efee9411d0e64a75804a122118ceeb399418b686994c08818bdee4e837cad35e1ca270efbffcb7852e54f8690ac376c8e2502e02342aa4d9d05256f66b6af7a9d0240388352d19418691d9046cf41c77ab22b7cddd4512cf9f22d76af33f7fa8ec3e8975fb751c7ae5f0b1b5f0568932b7a9bc1872de3a7ea875c724ece21a32f90ec183fb60cb788fefa3f401aee7cb1ff1b49a40534687b1346678dd08f22126282027e53b05349665efaeade6b8f5928696ae4133cd6d2fb5acfe1ef258f53bc3193c6e812be3cd928217bdb4f0a3d1918fdc953524049217da4af7829dca843990cafb47e70f466cb2e142dcafd65c20f0dd6f8bb4175b8ca7e2a3b2362507200e977e00d601882482209479a8e057dd602d7f9687471b896b59c840d203b9d44418b1cd6dc305f4e297a197eea70b66935d707fac3ed06abde93cc4e179b5876f1f0cec9f2b7ae3ea026163d6044fe3fb030a6de84e26e3cb62b4bc277b9fa0b52b1f5e59725cc26eabb71dd941f2e6a11586b9128d3a03c00e8eaafa662acaec7b6cde766a5b1bdefe109fd26f48ad3ec6c8ad90dc6c0246967b7bba11ab1c372d838f81ef972d885bf02c6115e2b0c1af3287882bb9a9099b24db2c347374b2e7e577e09c970deb08dcc2d744a1f68463115e346c21671d3969f5ab9c6fd8c44da23789ce6f6471533352e0907e24cdedda29e484853231afff433b427a4faa2d62408c9e0eca9f5cbecaa02824c9cadf2d71590233ac58c3778b95f9c812f682e9c910425c916fe2e67f0b0005febc54e10059cedf65379b5a0539d974d24a97bfabf4593977e2fb44aeda21d9bb058f7e89e7c44e79edeefc2bd7b622d195244b4b503b0db3de13d3b21cfba054142d10e0def0bcf3787f13d62622f0c2acc691f34d0b719a04d7c4906c48e89a1d7e9f264366b41949f95611b8baa4997e151c7833ac916203f5d07a586421564081d379f4acec58cf79133aa9da0ec60f34b883acf097f49822df2946355f778f3c97379e033a88ffd58b6d94993b066a18716711bbf4ce4fa8b95656b2ad8cf4a2495a18c5cfb5dca81642c260e5e917fb4cf96289e26b14b317d26d134b64dca612d418eea9fd9db122e0303195a11c07330e59221c9c3dd7df6c45d0412021ee52db4df7e6b012f7abf8f3da70abe51db666e53abdeee42a73a07649a6d6575841e5deac33787d7826ff3b3742b49af94373b2ab5473840d72a29f900153550f5fabded88e60a1dbe980b9b0b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "65", 0, -636896666, 3925833126, "db4d91f9b674c70aa3116203ecb30d5c12fdaf4f92115c8d7caa830d4f414345"],
+	["030000807082c40301d33c63efc99bb5a082b2213d8beed62100234eeccd2552476623d01a918515090300000009630063516a51535253716b119f01ab44740500000000066563656a5163000000000000000000", "6a53ac5263536351ac", 0, -345500632, 4179206552, "719cb5579bb7f7fb5fa0375b5bc123bc12feb0e76e51fe97152fe9dee4a20ce6"],
+	["0400008085202f890259b91539eee1bd176b8f130896923cf260afcbd8c7c3bc55f3a7b39586c986ba02000000046aac53008d54bdd2ede7012f67d87784234a0693d89593dde2a5f77fc7b5c1bd4f02f4485870350a03000000065300536a0051ffffffff01e5c94f0100000000055251006aac550fed5e00000000cde90d040000000003ec5094a368828d5838cdab4d01b9144b1daf9b82a149ecd438f1260dbbea0a063f3d2adb29817427896f062a8ca4add7505a4a0646e1a7ca5cf99d824c2d0e38c34fd914103822cc3ac0a77d6886534495ab7fcf0cd2282fdcf568e1bf2204cfd7bece0132f73027cc532993c93ad4c22ff0ac821bee3cf21715d3ac118830165e9cb35528fc9ec05cb368f1724c2910cb172fcfbd1ccb9a45095334b7cd51d1a1fd342527926540e18006b9f9f93e68ea78592859189121603682c49abc613c354b0f72cca55f04bc48080b17b5ff57b6ee1e75524581e38bf0a6557011cfdc70af1ebe01105d6f4bea8100708e96542241922926df1e9b477d8f0c21aa10432526775e340af6cffe567f02c2ecbe5130b3571f5fbccc1c21ca98ebdf7687b21f6ec20a9a6c7ece20fcb46ef3749fd1ad362021a7a394ece09c976b8b89ca0f153550f5fabded88e60a1dbe980b9b0b0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000007d3063b7d32119760ae7adadd400a61baedff18d7a13d9373f0b4b2dbe235ff389638d3ee0a47b0233b81024c3a531456ed1e73ccd2259383692c5377a47a20ce2a9ad48dad09a3246a5f54585495d930a8037591d70f68d42e7a18cd9e8c6e1af80c6b6f675a0c2cf4d512ff8485dce0f96ecd29a1a31a78e071de85ce541317c4c4939ecbb592e8d88353a2e0d9271a422f25e9fd168732434982290902862651d754f1fca8b152b78d6667f482a77c1601c90387ef8147d2f9f750d695474fc058241db5025aad5e68164868a71751d70999c7e955c9d3c790de750877bc3e1b2c6ff859b21da2e45f129974733841f087fb0ad75053e6beb864bb853b4957db52061a0558c74b8f369a37f5983558ee98c25c47a0d3c580b40b3f1e4572e8847278235fd9542084e09668c8430ca3700d5bcca6e5f9582f4d257db0bd10d153550f5fabded88e60a1dbe980b9b0b000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ba8c177a71b402121da663f72cff034751e586b13383374f7771870c6ab26ec2865118805701331c2759d562549277f08470fe7160fd5cccba57b925c2063b01508cde890e97e03433850af0d42b551ee47798db5340cebc8373b695dffbec3bba2da506855b965c329ed7c85b0739c0076c2a27a3024e06bfc6267baa075f34816e75f7b9e16994d614af823482a0bce3d0375c7c29ac75f08c901aa8237d3213f4769464dc4a5d53a925afc68f851d3eb80428a90772657a2c4749ddcf5607072f27ca56acb2f2600cd9fc7a8dd9b465eb0a63cb03fd392cf61905ba2b547bb2909dfda034f0488841a873d8b2836d1894ad23e964e28ad2f3449c40bbb5cdb5b1e2c43712aaa73b780af9f7ca9023a25c7ad20fbbda873042261f36771efd54a75839711c785d44cd50a0034b163d0bd894e8b90d648fb7bd81698e69f460153550f5fabded88e60a1dbe980b9b0b000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000041223f5774cdd324a5882547c9a895941838ee623348e0f069fd6c983d8224e372e21046441ca6154e640753fd2061f790396581f9adbefcabab1cd79dc3e5e2ee1230a242c50a2e80dd47d1400ad3ed9db8cd3bbd5eef472fceff100d0b3d1a5c2f99b91e07e1b0bd68e7e49b2a889da89ad6df2425a0859891dc302b46d067685bea463b77b088c3b6a9f717c469fb098a931f2a08800918cda12523e8e4a6ed29c19914547c2ba152ac50b1ce1f99493b77c6f780336359480e05802f533c8fd06f0853cb67180c57acefbcba62ec15a65a4bd113d274e7352b35d8f3adea2bb85013dfc3f070e19abecab15a2033718791db16b248236ca81f8408205bf4b426ccdf7018d85616c54b6f8ed8a8afe10ccd2881606339d27226180b44228069ac858e390d5c8af0b4dc0c175040e3cc9063b429efb818f35bcddc72b82207800b4908ab2034e37a45db0211861eaa25e7602bdfe4313481f9cec345a15a5f6a3fd31b0a84e3aaa9a0b17381e30034fe5be6e687beeb1a8eb10ac924f58fdcc47af2bcd4a35512467cdf1d7ede9ea4e23d73acd6da0cb4bd310cfcc13586307f76670210ef70fa1179b5150958e6bde943fdd28830bbbd8072eebcd7c3f0d0e4d2fc9ef3c31d181f1f677ae10864e1ffa9a6f652f8a920f333f84524351860f2ff4480553ba5485b94c9bd68ae7f1eb5b7bf8488498268479132fba2c423d4dc0e8fd78150e0929eb0288745a267bdf818acfe48ee48d145dd716abe6d403402c951a452b873db249ee05ab999ea35c6924fc722e4b9c493b6c42e6e41da6df9d888879ba0350aed83fd936fcdab8b786873466a5f071e5cae4355889bd42a3959473f4da2b2c47624e73208d9ac597f0ffa1396349b964758038adc5a6c2244969645965e1d3c6d5a9f1e5df7daab2a819453cfe74c1074a171027d2ca5f16101a1dd4b6213541416917c20fb996e520004603688736be482f56344cf1ddec7015ebd29e178518117d8bc4d49946ea2660454fa555a0e3884c585267d026b040e806456fdfbf64d46aacd1d38ee96bf2f386d53caecdaf0e7bf16e775b04579df04b4dca82f825c5a30f6458310e822c4f06e8992950933ff523a888adf622ee768424eccc385b9b8e3780da4ac1c9d4f91fb80f2acfcde082a40132cfddea3876476ceff4d77412ae67e1bc590df3895037990b00768f55a4ea192e79975f783b9305999ebf299b88296b8a563708a1f32e2f89248b89f2393bad26a2f3386926bd7603ebd7905748ae48da22b979ef216a8c4bf00e0fa68099dc3fbe69aaab22dc36a45fe4e55106cc95f554307c7fba9ccc36db4a535af3cd56533a649f3df9a0ed49c14b92c3c430bd3ee03895c9b82112d705fd67d708c36529fb5012919557534111020497a8a102041aeaeeadf3593834e82994e832201dd43b4a641c8e54f1cfd6515125cec13c3bbfa5b66619fd6a846e7dd4603eda74e5a7fd2a3795280c5ecc398d1c2b02176501cfeb72d9f9541709d01db5177ca64555ed84858ec37a0a67d93cc00e2eeb52acd4a5d4826356dd3aed019f65cfa81e8b5427bd8c705570470356b5a843f68a08ddcf0263c2477380b64565ec1314687ccec4fc51e4fb688554bcddc1a92eb957e0bd8c9df3dc1236babae361ee588a068915e0507ab9c82a96b926f446de594c25ab1b527e2691059fbda9f1027be3b5de7ef3f836adb56c3d4a6edf52e6609bf0e6a35cce5c67314c6088600dfdd0ae138b49281b2abe847ffd65d5ea5100fbc6e18f95eeff3b64fcae72a635b9cee654b1c02cc21142054247e97f67c5ac8d8f2717b3c24fc77d27c9c9aadbd7206b46496e029bf19ba0d5c45c42e71ff5ccbcbfec27bbc8f9273c48e4ac2a5083e91ca9cebaf9e0f17aeca732d0c95c96d750112ac4514b3d7e963fd069cc50cf9f64dff006357a1d3b53821f9dd59d3d58e8e2d1c09bc1800a07a67a561050a9c8781c38f15b8dd93e44811c44090bc9511557e04b939d3f93a2bddbc5158bf346b7a8963cd8c5d278d35891823c2bc85f1a453a66337c2e74b134b6aeb56b1d09153fef702892d549fe5e2b8de16b2fcab7a68430542e1320382b1c89e3cd92117e9eb72ed838de625bb46935140530b5a73d19d2df3f316cdfa542b63938747cff10f2a068e17092ef2d53264bc12cdb8b5488ae19a493c5ab4f4bd11d6c2a908439e039c11a122bb040b0eb5b2e4c249dd3a41893bf2371226d7f0462b70f6ff0e82513f80292f3d6fc456b6b44ee050733fc4e3b8465419ec0cc605f684431568533e83527eef42f1534c5e4d3368147d94cbcf1b90dbd79d27abfe8b85a49ee187bfc82e134164c6b969fa2dedc1086be25362d722f2901ddb5e25878277099f055ae2fc107a0b20fa810cda1c1cfdc2a8397cd2c0ecd18856554564f54504701669aecffa6dbcfc6800ff8ffd0f855726025d7289ccef637730ea9361ebf59ef4ac79de89269e6bcdc27b4ab15828625d355a92024046e4646413cd389557ca40fc3d8b59c14af6592b6b754ecb6914883cca27008af5ab84e82cd8d1dad0db4e4d2eff4816797743df10719ab2d813f33748a6fc719b7c3f2fbc1b93e58162e36ad931d8c962f03e06be3d4ec93e2c52aa1082172979c36dc95242129e5486c75ee50bcf5344339c55976c7a0b5b5a2143e6297898be6122e177b2fa298f1851eb0e7333dec61c74e9d2cd6bdd65fad8d4084320d6d1c8472d620b8e8c344c11d046c2b5245fe4a4f45286fcc577afd15c141a10cadd81f355745beb8721f26dc15a4751f6b67bf30d214d40d011ace8be68707c35574b00aa563e1380278852a5016764b58a2f145bf640b7b0d5f064e37dc4b2893128b6db0586692f832f146c25a73769d9a3ae1ce25cdf36711560e806fe0013812cc4b11eced1121a042a96cb814aa157170d777b5d231e560343fcf4739108b90c29b024f9c533113beb4fa540a620edfa8afc14ec5c0aeb89eed661bfd6b9f166133263cb76e496bfc5209032e76b4b27081a123664d7336d02d4a82709b1d38d3eb672ab841c56c7895c06260583f316ee8880aa52a4ee33bca237555d7bffb0cd776a224a756bbea024428e1ecb94db737c639b318c3a3c4d67962fc60ba23817727ddd02e599ac80141e43ea83bd2e28cd6cf2b666853dc52c29c4d2dda230a8eeea23a0a3aafb5f4d0a700f476c89546408d47f814d548a7c071f4f5f22d2583d2f6d94b5a1c7e7dd5bdfe3316b253d705252454fc242ccdeae8b5579446800e959eff2e96b53e662bfaa51a536b59b2bd308858f904398a0df12b91826e8a95f034030935139021711a6818da99eba7456670665e016d8274e4b8c4329f8b095b2284eef69cc1f8eb7f0e357ecc5af3e89d8bbd69654edd579ddd1eb24512d5bb9efd30d29897c1de0f36a524811679038bfc216f3da082a1cf44f9835d374a624c7d52188d572550ad6cc153d838d73144c9bc7195a54438fb2240d7496f63f267cac9d60cb20a49799a4893dbdc8dd6939ca00fbb494777b0abaa26da61ac18d306acf9bec32da2bab66009abd65d9933adeaea223c244bd341c0b6e6e8add5e85bb957f547ea9d0f5080376491229adddfbec0934cc40d312b28089bf635911540fe2f5f20a4278c68dbeb10c8c96a2b0d6bb50a6c5145859c26f7e680131fccc9c181cb106a674730c949ba76acf59777bb510ca7ad7851391466c6b37c1189ddcb2a5934ff0b55aa152ffe1eabc4c4b5aa2c5790f17212e2325cf645be1f8d51e6bbd9a7ee1b877b74abba235b54002c9569df53eed43f4edeac69e62bd9b5bdf28628e79b625d6fbbd17f7f203e217e4317d7d83787853b5fa7f5bd8390f507f82dfb992fa87f0c4d149ce8fb8fb45304d840fb999c7c9128712b3f7c3d20fb4c7fc231e4fe179813dec953a9c7af7daba42ff794deff834657f234a5d2a4b327be06d201eae0b5fc049caaf968a0c51f35c4a7ea7b40eef946854dec2503fbc734ee3059d3c81693144f3447d8b9907dd1aa6aec72b5d250e0f4904abc305cb1927908ab3d1e16519968d19471e32d8464e9f770a2c2999ec11a07a61c64112b6b8991c002e316c15bd793bc87e6120dfeceb481c42561168a311b1c73e6e3c4986f2dc91f807815de6e4066f18695ae8330a2ea4006015fd2c09b9aed2d34c59e592b442a7edade8e0c726a20fa75404b9ec4dc826acac3d9a4701bff6b18d6b5980a6c507a777e9526fae7f376532cfa18af22205dce10e03c4da43a68680286bd25b9612463f6d1097ab49b1446ee53af7f5bb1d2ee2252a0a11a2726ce34477e34864ab3d4306c49764d516c7df54c095c633647d25d61ff2fa821118715f91abac2954390a231653de3cc1fa273a7eb7968b4f3838d9c49001195cc92b94f5228007b0d1dd45ad01ccc81d211c4a2ce3c92ade569c6b1e2fa4ba09ce64ba49e3dd6032cc5ce1803f633e46cb3e153369047c777184a1fb4ee322663409c5d748da56d4568149b277592f53f1905719cb272025c2cb4adbd42680555135fa81df55c89e7ea3b7ac7472dbdd3aa289a9d4963964b4a1f3e66c067b066d8fd631b7062e069bb206a3cff7fba033dcb655b9e5eee66e65ebdf14cf452fd9d0435aa1150db0a34b9d437973ce3599f06c1a90384868861922cb819983a994be9e6f5e91813f628a3e4185c64f5da19efeea92a5ca84988b80ca43ee3261ec63629410d0c224201ca687950e8b401a770a598c27ba457083db0ab899cf2852e4601893fc40833896f05a3cbf51d8e43ae0de722dfb20bb2514775bf755706ee271564eaf257801ad541029a249b93db5103f06e67b91ce614fa663c4173ea51ed6b66862de74e78a9433c4861ee9bf82832be9c88f9f6654065c51be3e82f651a7a1aa30131b2153897e4246ea0f01e71830782ce07ab7063ac7a4b87519d22443b59a5e4ea11b2fffa0235560f05d7bf2076c41baac1703d58030c029a7fc5fd7bd7db3b769dfc7c7acfab2d00cb8cc8f743753ab4d8aa45f607d9b90b047b5232b8d637f1f82f784777e5474a8ecb3411a103a1f6be8b666da2ffd42d1dcc119a274879139e0d880f19225c1c5d8b94b762252af650b6be122380104c0b9b4d061bbe58b7cd4bdb449361fc5317bbbf5e215bc1b88cb077746f318000e487ed094dd7e768b13bacf8312c19a7b204ecba73350f239b782ed6bc16a5ddcd8c387632ae86b4e33474ddc37cf59ce1f47919984dcfc0282f3b94b9c500cbe889f81f9bd745300858872568622dfd8a5674c72ab2ec651efc0f7a822d252db45febc647ceb8a2facc1a1df99075264db46359943d0100000000000000000d14b7010000000018edfce8315a8df148ce037ea737e0f6e15d07889d08f640ee7f546113051af5cc4bd68ce2dccf4861d7a27bbd1a7ec4a0c317786774be1fda20f3f4b177973f60d6f930e2edc0f35b8c26ff26666763ac25f66674fb01428598963386bfaf280000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000018e7f271aecadf93ab477d71377ce9c2fd063809d9daf4319cdffaec2cc2b332d78b1ff51e52b372290ccbcc76e6d987583b8ea579358182e742a941efc5df210b857cbaf49aa06160cd74df984b2a4a21d972f05d5796c41c628e4e752436f306569cb2ca34f8a879729469d5c5207c7339aa0fd08c6823f99ce8da9d50d2843734218b1ba05a3174ee71eeadba70d9261accd9ed0283dc7adf7d9f057dfba1bca44e49ee8cd1310d9243d6b066a0177d175725904f14ce081fc8552c731d5a164e8cb887f355119e6c945275b6936cde12cf41b98bd8808ffadf34aec601754d370e495e80bf0cc3e0a10c2bfd5065c4679746cf8ec3440d43a53ec2b564eea99e431a82428637ddde65c149bc98737401ee60d32c0bb2725ab69bd1e392efbed10dd525fea8724a9a5f76230968b8ff0faef29440825df2fd388cfda3215dcaefefdcd997131d9ba99df19d8e19670aa4494838a7c2329545845e6d22c6b990fc7007759324f49f951d61f6a0ff2c743e0ed79b97773f49cd2ac1896fc4c989fd3f9b324b99a7b5bb1543529996fe8de4dbdec019c22adb07bddda7b70792905a01c3c699a55334827772e5162b068d4370a13333cdb25b7a53ed4f2392aa201a41e735665fc9dff0754efae16881d722f59da3b6f8b6ec16822714d0bb748956acc0e0651ac5eb3e0011b3fa92d002cedf32e085752e5e7816d4bcc1d481385daf0845b782401a18118ba95cf749d2746e2b4209dc3d6ec42be9366759145e73ea56725d3e266491848e39e23a867f7c1a0eb86615973aed028cdd3702443b3f4235009c5c5e8f60f82959ac3dccf2db8b9b3aeaf919a27594ba01ba6801d1334d86842163ffa5cb46bd07aa55e1ddcb4b83f5e32abe9157004ced24e5fb932c6a47d06f088f0315f3f7052c58ed56cf1bce20a5bb3b037912cabf02cbb48541ba39209d7f0e857f910671c66a4c659d31877c65af36cbbedc574e400d2cb49ddfd88e64212ea7620062f822d875da4599c77bd803c44e2a5f7cf3d9869e8f50ad3e4639bd949a86614ed50da8d719f45ed4814b418fec3718b7c25901fd64b9ffc59b3aaa51726828d6832ca46b352b61b5e45f5dc454dc6dde20e1a2f9bc74d767cd73b42dfcde522fa3f3f7936a215227d88484fc3ecab09490c67c0394bbfee2d66e797384bab6e6ef6a537e95af145ca14ad2c9139e2319ac1ad96d55f1209836a962a9ec3573394152e9c6cb58ca48f275e8cb4e1a02e258d804e01324e164a4e41a4c627dfe94113191e8731b5c851b2673768aea2f034e040131f42f83e33cee28b2b972916886450f80055d731fea6ad00bb4e3b83bcdf6cd1987e424e5f9e55ff7ae66fbf5c894a599a610ca555f64957f3618865e1b3203227111e762c2f043e9049f8c19712e6c33db8af279eaa3a6dd461d351be0cacfc4b7940a1bd6aab4a11cb7d8c8c2a73dff8926d1daf9e2e0562b1aff2de9ecdd955efbfd3574028a403b277b9fe01b485ed22c627d29c75652a0b7b7b5af28fea39fec34e3ffcb6931c2c291abaf4a12561bcd0c2b041c5403c960ac5d24a09ff61fd0cfbf03367f7477e4edc1939d08063be7944bf58b97ef41bffad456f4913c153b2091aaa39d081cae18409f1433bacf15f3d722b1192b1938ff788fd2afa5172306e080f621855193823d7b2eb44e2f43d206d862e3a89a1be74a1f83d13689868b996a198d7e095f19d25ee19e3c1dc4b39eb06475933433efa859928136b007d6082688f5f163d095a9423df51fc43c2e0d20b60fa966f9d0ae6d77ff4cd8285decef1c923be6ba4e565fbe9acc6ca56a25a0c00d2d0871a353113a394ea0946eaae3c255217319d7b6acac4d0d703be4234182b889ba50a1c5c0cfe9856db68b2fbccfe209c8c27266b0e3c71b23c3bdd0c7a16edbc75d91790fbb8cfe05afc6c9e633dad45cb471ec22a68c16359f4e2512a6c484f585e15abd38b25dab3fd37c6b26aedb905a6894fc1ed1d2dfdd9776fd6b7206dd107e53150e0846977e8adf625693d0fc07a1a1280847efe7de0756c302982d84018c025952e2be4b95b390413961de5c537c88e8f2f455a9ab8150b6ce749da64731818b12c499c722ee09ad6cfbb00584e5dc28b7d4c39f7de8c93ace5c5e4dab43a1da8375e66411ddaa4dadd25938f962dc4bf15bed4a69963fa54b7dd21a11a2d0a6b2a292fcd8facd126ef55dcb04458e122ef66bbfdf3e7e1491b57d699a554e489d66a5eb61c007e05016a2c447168cd1c0e87fe10800000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "ac53", 0, 189027564, 4122551051, "19e10d26de7be88d177840630808d8f463c68c928d73af3a60d275122d75137d"],
+	["030000807082c40302b8ae9d4ecd670b96001d35a66426fab90bd5ff1237abd306b8e3896ab3dd40c20300000009520065516551006aacffffffff8dfb1cf2b3de2f5ee8c5f84f04c74b0fbc896595320834e711f9da2c0d89b8f50100000007636300535300acc0b36a8e0256809e0100000000075100ac53526a634bc6840400000000086352535100ac00ac000000000000000000", "0000006a0065526553", 1, -1041339632, 4179206552, "59f8830b3575b1935310b0709a001a573bd1e681dd9ef43227f9874f2800bd0c"],
+	["3baf02180207283df40e01e6f67f86c362672ee799a420cb9a77b151d79d31009fe973c5df020000000551ac650000ffffffff6e5a28ea5fddae6c1af785a6c2100bda8468b1a37d0b23adbff0134698ef794002000000095300515163536aacacffffffff015c837b040000000008ac63636a535363650000000000", "ac6a6551526a000053", 1, -288013820, 3925833126, "f5ea4c43f208e45367297e9a5f63e11aefa2f40225fa274369255eb6a4e46f85"],
+	["030000807082c40304ed6d05736a057c7917469277b220864ddd230585253ab064cc49c27b19d3a444030000000753535252656553ffffffff5d8585037fb370e318ec38aea2283f73f1d6e5d3ce1b6154c4fb7b567e8be622010000000765ac6a63525351ffffffff09f635acfeab77b93acc9aa03c9d2a32168ad49cb3f9eb4cfebe40f2125da97003000000016576fa0e580515a51a9b47164bd0c087d8400a4dc67712ec69ba9baa22b93f39345329a74202000000096aac006553526a5251f72241e601d8e87f05000000000000000000fd098b1000", "63515263655300", 0, -1225521294, 0, "1bd56649bd66b58ee77de38fa3650f136ae01c880ec5166b04fc5d8a9ae9200e"],
+	["030000807082c40302ccadaea61f0bb6521062ace308d4d2d8c3710a615616b22ae0b8c3266f3867dd010000000163ffffffffceea97635d5f64dbcbd7fab8a0821e42cb9bbc1c56c24cf9c8cd8398373a7fed000000000251511143467001d93e0d04000000000851656a006551ac5123961d170000000000", "00656353", 1, 494578502, 1537743641, "1552acf9c430d8324e09deab88b58c61b3e1a0c1e31fb164e57dde13390c64b6"],
+	["0400008085202f89034b460e6586a423ec04bbb921793cd38403b8ebf7d358f08be45578605c83855e0100000006ac63656a510069bbb4fdf386a3c7e8d78ac91955635db32e7bda3a15781bccc118e8748aa151ebc8cb250100000004526a5252ffffffff3755c2c7306b72d591840bc07a1ee7442d58a804abae67a28b84488dd03b77970200000003006a636258ad4d0181622e02000000000565ac63525200000000000000008a4fd0030000000001be3a8584754de84133ebcb520ea460de856030c2d89355c98e5475d6da0b49f1c169801185c37b78fd39a6f11679576c50f70ea32c42e65da5df8afb08f28934e4250a7bf0b7cdfed77596425b51376553782d979fe662ba0cc8d0a353639b4c43f8df989d3222dfb8c3d4abab269651f8fc4c0154337b8be2f57508bd8878ad8eb9d21eb0ee77784e6cd41c6fb31ecbf4bc66107040b5298018d629b43ba58207a3a09ff50ad3a02c03382ffd8a4a2b17b4e13317b6b427de6e62b6d3e0394a79e7d0d9213c3a8e298e48a061ffbcc87d7c9aabff19ec523628b83d6e240694fc3ceb4e0aa98279683afff645ffeade9f7f01b34971d0c505c9de73a4f5c9fb33d8242eb409dd863708f6156a1355d81ff8a4def5f56554f05e97369f4841e2496f167a80051b527f3464c8f85dc934f0cda7913d3efd0a18f0ead1f0b858a4c007e05016a2c447168cd1c0e87fe10800000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002f9bad9b52d28afef6794d8f7760514317840fdd5e7d3726e3b8d6001eb6ff5bac3ca4ee199334d853acd032d5f4ec6515e2b1260fcf1c68c6b13df33bd5e8071ca6ab9040c0fcdbb682d5f4f010fb4218140e58fcc65094a3e417cb0b90f6b0cf0c12788d8e303ae2710bdf7631e86701b0708064e3d650640994dead07b8fe2b10e17cd1d6d6239a1b394cc8d7c0bd7d3c2b88705fbb52bcde1774f064c84783550864a361f8f6db057bd80880ca9b6a86a00e55c724708cfa8e177fbca78e527cbba8d7c491c4931331e143f24e1e531c631e930bf64b95c26a04b91c708311be6b7a0863ec08a7d25cb09cad4a3cd1b4639fd49c5b13927c21bb36d01f02a47d0edb0f6f907e322a0f28f8454b0aef4135b1861be2edb6c05c2ef8740e9eae5ca2b1483c784ae6ffdbcae8ad348ecaa3f23a58eb20173b51d94a8fd282a6d15e2c971f5b06b11ea8e124ce2e9c7a1493faf67f70d79f58ab4a9130f53d566cb007c80f189ce3d9f19c2d3a8b272ad54c80f5b90910bcd3c35c37f2628b2ffef579ce62dbfd936781537938c30c02d88f38e19a347450c4ce23d00006ee0a50ef38d1bae647245864ab3bd5376fb6afdc8b7aae40951aa9529733d73ff710c11a55e6254d37ab1e9e1ac73705336f5307a56decfd6b377ea3402ec4d0a76053e37aa12c75163ef0a63c4d93cd595f4d8540c81c8d83c5837e247d2cd7867d20949a357a0baa8c6837cf65c201e06405fd18038cf79b7fb2eb1e28a035fae008eec4873e76b25ed5fbf5ac3da76433a2591a143feb6430a940b9679b90f2080de5a193f1dd40cf341db0055cdee629f9348721c9010fadd278999a346930a3cb69e52725a0c4fbd7f14f1f0828d4a735ca115e1057bd1be0ac108d7df6c36cfa4888439fa30b6ad14546ee0aab3a3843c490d065bc97b7c1e2923afcbbaf0ca7f9c1181e8d492e1c65c1f1f8727fab1b179cefe8c5327787f4de8b56105264f2e8b6c11b41a53522e6d25fff87b7dc9b053f91c4279055d28ae25efb9e1d9b7e5316616eb95397be25271d8db46b03defe0e63c429ce8772a8fa00d0f5b2e68653e49c85f224b7ec05391c6470b519f49f0ec7ed92be4466c20f5b2dbadc7e15a4aaf1d9e1f8f334e333652cf8444b8bc7d8322f27ba1d7ab1e8adb332646418301e5c2fde25f07388158a5152f5a45c264d1cddacee4a95543a719b63c74d020185908693ddfb94b44643d01361e3f1adcc2817c88670aebb8fb4aba25c0eda1501ad6830906a5321342a1893e9902664328d177d81af576b2e823e29f75f294cfe1546bc86acdc153290fe9ed9fd57528394ab7026da7704be3cf3190a0d951c1559dcce0c2fa3ed75162da01bc311b73a4e2673a3422711a2162c5f76d4f3179c14b8b4c2b6ddcb03ecab2bbed1721deef4d77e7cf65783c242580fe5a5f7a1b9d5444ed0ca845f119b582e4029db227c7b012c50e061d1e010fa0127a87504d09771107a10bc283119e46262821dc54322ed582470e0c04984e0887fd854abee1390eab75772fedf06397fac08878ed9057736f39a349443680f6d3fa98628b306e865a9b42ce375e0d5639b40fe69141ff23314066b0de4010e774b72cd920c6c7845f5b9c8717b1c28d113f56908845231bddfc63b14867d272df765966a48a0f2504f7a89ad6ce25c1f9c9068e2e0aae7f2ac61285ddeebf1293409a2d91a12b4c54b669a076bb42e5bc798486a7d048de3ef7a4c927872538d8774814f36e98b87fc4d1bc2bd9aa7762477ffad7437f5776c050f1457675a94af27a6a033c116871e3038351b81b06b51af699b8ca2cda27ebf959d62c011c7ef4403124f17a3e204318a2c738623c5bcc8a392a9f68178179da1f3e48e31fd6a17a358ec0279ad4e32f582e87b7d08a9083f9fffd34c2f37b1dfef095a05dbe4fb3e660d70eacbf39d7a15d4e0be4ecab1f93b887ca41f5b3783d60e47b06308d1a2e2f5a727f1e7e81a25c998abb6f84b933707f4bb61f80fbe5e49a0e524d2f0879dc768b8eb6fd66f2ac7befda8a2e4f709aba66ade889e4c26ae97f93306e98dcda8956b417041a3b7f4135a2b481ea1487167599c68da9046ab88f2c98e9214d3d93032e762b2ba95d42b3f98dc08d45d19d0e7746915ac3d256af93e8e24735519afdb0497e43aece17b90566d134950eeb7d5e04c59ced932b3cfbedf14a2d4f0eaf18684136b9199de22267e7672d63207a928a972ccd66265bf3b48c1e4a5d3f603008bfbb87f862cc86851c91eca6a2af06effef4a26f4318fc56a9350a4dc9c7aef9857840d4f90efbbcfecd420ad0724780e2bb00413b84313d9f9e2a057c425d7f99e5abe07f44aec800f34c8e91f2bf0e63c0eeba21b84e48cde33429e4f5248535598b51ab144000a4250af6c69ad00903334b2a848c35f05e1fb99a3e44ff04e8dcfac994eecdefffbf549f5faf9e73533cc9674d314f7502a4a6f31c08fc65752e8a36f6a79a4b1ed02cdfc0382d24170d6317e06c4c1ffe218f10cd589833fbac811ee24eac3e065c41e43af9261a0ef43f505259fdae6417171bbe0f0fdaf2404449b267f86ad51ec38793e573709d7164db40611bb9db2003c10fdb3a8b4214c269d3346ebd56751dcb341bcc3eaad8a62ab84777bf2ba691ada807c384cce203190e9a04000000000000000000000000f5500d8345fb7926213a910fe393b8de143ea12aef3d12ebf3b117c82ff48929e769ee7d4b8c59bf08cfc5d96cab872959445a808d8ab7bee24b5a8f83cc3aa7570c907a0fe30478eb28631372cccd9f5dc6895ed2a4cdd08b27244f04cb836800000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000e0bb8bb1fef19c0883b3ef03c0e4fbf7c14279a0c1bd3499065f6c0c4b597a33417a04759b28967cbe20d2105b3159cc910e27b84ed09136ad1c3a7cea2c389f731170e0b5c8d6416a3f139de26b55c99a5245b42906cf6479396a02fe9a1e315328ed789d363e8c6cfc791f897075945e32774282cd83f7371be7683bf40fd332e42777103f723716283f8b28b25b67185bf1ec486fd8cf3d3454e6873f41988bab2a061d81b61b436da7b73fe059735af7d98b9dba3ccac7b3f61165f5af665e1b6f96c7e8b1aa89a2e05612d712fa76daa7bd11bf5ee09b2512b98613e81d6b37041c8bd47aa8ba21e8d3301c12f9890c04a3771271e6aef97f1b4342e0ddcd27e932985a39a6b68621886b3a2b1a87eb1155ed2b824b4b560d7a28631d66f7236ddd12aa1dce1ff66f2502e8b3d89c43b2b62b9a6d6dcd591ed62032fd30cc0650ab82abf32b3afa6dde3eca8aa583919b77d1332973a3b039cf5ddbefb7e05cab7a9dbe06b94255f777474008bed1831b9cb1bc9aab6e529847c3a611a77ba27776369078096b91cbf2b6a4bf694347418fab87129a9bad178308782bf6839c5745206eb5833bfc28b8c1901793cf6befe8500395bafe16e9f284aaf177ad2cd65db61da8d39be7ffe973374da5c5496fbabc8d5927ce22b821f90e32080564469a02884f9d04a5aa1ff2ed022603d4e5bb4306a235fe3f84294ae1d210d62ac99ae6762d2ced8ee147840a230904d5ee77408a7593be4c13016ec974cc08919b0b382713fab7bb631d851407ce8d55f7f9532179c6fffed6c4d790a8f69cb5a44e30cdc5d7187d77c99a81f4ad44479ce1e6476c90f274e13e48ac55c1cec839948f21abf70f02c9e4bdf49e6f494bd75b0a7f5964c81da83e308fa5fca88a7fb9ad0a493270dd201eb9c9b03837059f6b5fc042cb1a806d4f604bb92debae104e2034040e40ce2f3a9b10725fc06affcdbc2792a6759df12edbf03258dcc27e401e3ca5a6323af1dd716d6381829987bfc75a55e1b9a3c7f2ee7ec3c9656299f4c2b8653d63ff04871f64d9fe5717bebe62861c4dda938d78fd20cb9130a8959be0a303e76725899f1bb12c835717bf21f572e0f14d1f73e7c9851e4c886499f121b97328bbd8a5691d91597cc0bfb40a07a00d4598d4e258ae13de22094294f9e6b8a703a527abd5217fadfe4b97a263cae54205d6b4244f0ac535f0b8f3cbaa293640321799d1ab0c003d123b75cbfa5ce59500362de8cd82d200ec1943206780b442cf745b0a9f9f2e2c39c909c85578c2617caf66d712e35a690354a83605303e2ea9c0351d41d2b160493982829553bd85798020c9928f77d0403ff2926c533736bfdb612e806f8a990c50d736c043ed3c5a14c94c59445dc3e4fc94e2737ce3e96c4af2b42c22b5e18dd7def7d39d3e57eb4bbbc6998acb2dcc719cc03b8bbd7a0689b737aeb4453a718de18a19ce5053a1b6f0e24c6d56f7b4ddba6b58850b85f0d2cdefb245ff09cea406839940f9c43a7824c8174c6b59d1bc98a177d82d440a7026f7e5d5e0a6a68cfab2d1a2948f0df6a19edad9a6943a49d4a52acbe1fc482bcaaf3564ccc579247fc5cef4563be255f269d1bd8eda797794f7e47f70cb4db5d9124f4593eeadefe1cb5df9dd21285ac392827a80c5d3da80ddd6ce837208de0017de663b0dc7fffdccdc1af3bed9dfaa87ddfb6dc0acb200c9c00affa19ffad61c1eaaa0b366db035f7fe3bc1b73a3e7a389ac1ef95e732b3b126aca31a488647e2d203e3cf1e4c6538c83d83860645311dbc658473ecaac1b8b3866ea324697a5cbfbe4c175a293f435d41390a6f82d502a9b93bbc01cc28e661c6e2549ff0332801a78f09b04230a562e38e1cc51b68677e887f13db6ebbc46a84fd9d2d832fc309171496750259418add2eab191bfc7d30a429b847e0fd74c07543b900b1939daa0c3800a741e639e4ff88013b0439a67630c3a5abbad99b76c9e72ccb3fb909a4a1409411ca0336681c8e442948ca27d3921bdb98d5c2411c906786b0e29b5b28d3b6fa846211e269e74a8d7a3ad4ff04b6a386c85530910b8e77aa87c6d2d12783f615b6484759a43ac99f15781479a98f397cf91e0b63632307b789bea65ff6a638e2e79a43e01de03000000000000000000000000d1c0b4b8f34f593fc68e17757b1ee51be780ad962fb874c0db5b7cad794c2d8347b6d4f913b40f433bd631004afc230c5c98a1b100a72062dd12a9682ec3fa10c38352fc85f56624a8bc463f18773d6cb2d948f8dd3224c32cee2da03d9e77db000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009f38f7585a1451ef32617451f95c9de0d266446bfad0041bde0f0b819eaa26401a822bfde9871dca8c2826532128638abe227a724d8d008ca8fb546f1c8a22cdcacd733f3444c10d2d4d2656c597ee97d058a2437be8f532e0dc6ed55ae293520f87a3eb3283292a135859d5fd9bda05d499af478994642c6b20acab075db3586f716b0792d5a7da3c589b3ceb7d992ac6f980fc4b976dcdc99d99552b9eaf178a4c0e7c9a6ce78a125cdf02e537bdd419d3e6c149d258be4650ecaacbc496dda9982f8387eaad7d443012b56281546e0d702b24441c1e458b3f969b51c1837dfcb6d8f82a9fe933a3203de3509b591ad50fbdad739606a3f83d70b3cfd37e95b989f0a3e3399f770711b09b54244189cb03b3f71abaf69ef7606e5fc34107a63757f0221609ba65f6fb5024c45bfc35ddbe51e0244d411447fe3e78af7ed0fc42cf7ad71270e74a3ccc604e3c1d200adf1c3516c2955091c7a8f50c9f664f9fbbc63eb389a10db1e31ca2fa5d9f28f8bc9d71eb15382045b17c1c0f661b9d4eedca999d527239c042caee2d480bde2f8cec4fcf84f6d8b9121ce094971fb87a137bb031bf7bc2a9bfe79a46424b51906d7f7f87380b8f84ce97869511bb2e1d2c4d1c9161f0c0ca60f1852fec3f49d3162c0b6b45a20bddd8feee35194bfbd9c5d04bd674c9e15936ddbbed3234f3377f518b2dc346d19f28517d2b67edded86a183e18325d80a603d5e9ce4db1b37461ff223b6440cae97e7cad0c78c01785550ce9fb2877aa5d2a21087bcb37039252b3138b2623c152fb7a31a77bee390b9ddcd59848d049f880055900e95b65aa78b5b485d9d2ef0a26d0079e8d0d3b71ec0d5c03d8bfd34e8d354ef01e03bc89acff2bf78944b301dd3404cb47c0f03a54c2b5d2a2e073fe0257490158ccd3142f4519ce5ebcd3546d6df7413052754c6b93c4d8a9a0a1f2d8c9340e37913152e11d2bf4b2fcbc8dfb4cd491eb1eca33223a723e6b895c614fa510c1e4cd4ae39f705485cea54ecbe9440c44f7baf95eb0753465794b1cb7cc8a1cb1ee3b755ac4e82ee02764a4dd837459df65f57ee7a371fdc3ab7e7f3289c08b7e18e760cbf5055795cddcfbb8813e341be6f7fa88a45288ec59f9ef5651efea89e5f7143945e945a810e3414b25117b8d149e21615927f714c7d9b7bc4c986220a52b101ce6c11ec94b51ea1e89773d0ae0bf1a554b881468fa66c70e757d2b726dfc809d954cf9557a458b512322ff9028a1876055d6f27d3627d19a4f75a71bbbfccf2666b8826ee1624e53d94f79712ad03e2d5c340abeb3226935e99902fbe497f64dc277ec16979bb83787bf9dbc5cb6bb73d1c42c43113b956617de010f169ab13374398b4eca723ad5f128b16faf4925ac4ad207f8490d4366c7ec517e7ed3b116510120e327c01f3d00c7176d755d0acceff3dd31a69f176396210d955104b822d26c23cad80668489c463546cd87fbc7003499b4ed3168242a259cc7e47045535ba73a8caf5590bb848b03e3e90fd846d7e40d883ff0fa907583b21cd9a89fa89e76597562ebe454c28fa61442de13d5a20a08268a55e0f8f08cb1cea9fc20cca61beaf5807170bdb1c2bcb5f9097ae595dd762bac8bfd00e3472a664a49857cd793499c4ebfc8408cb84dbf88caa4f560b579ed5614acd5dce1f4439a4b4183908c73a8c65640151fdc28e822f9ee4a97a36974ade95177440222e440698b89dc4ed17b5fe58d76e0572fd63c29069e9120b66d6c7078098379a4557403e2725309ef0d96b4c1d3341fd6cb0e33596c9b22aa2953cb270253ec49aa1b9c8575a520c6471c5c81b40be7bd476caf63b55be8f4cab4a2b6412aeea560a04151c08f67d73bfc1ebff3aea2d71149e09f51565a4d8f00bf63be3dc806a952a6d6987ed4da9554225294d378195bd6e8b45bc32392110251cdcd30ac66c5a565c97b402295b6e4a73a0a5cd41c7c270805cd250f95087a2fc0270ac1e6176b31ae2749c59ee22422fdb07ed96b71cfbdd9b47cfdd140ff5bad43050cd52889f541a5f84501b47f6dd12af49835bc27b52f04a7cb117c0d82d26434912891dc87c1445b4092afd25976e359f1461aa0fdaafbc7d7c6105a24953de7715735df4e12395d5d0000000000000000f9048c030000000096698e47e1c37222ba1d7c3b68167de72a69cec9c588ba111c06765318f93641e807bcbf2e9208a2e481bf36d148f3fe104db23e1cd17d0e7c749cae082f4bbd4d7ed9023741594a80d448bbbe330bd9bcb73ca7869fec73068d8b550a9cedc4000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003a6fa42b3e5bdc93506e95e665ce1f1e0e3162aa447abf0947f9f29d32b65019ebb450093d0e61597669d4ab1ee1dcba1faa5ba1ae585e09d99170a6846e18bbcffebbe42a673eca7af866104cb0ff45a93aacbdc4f13750c9924065d5033d8dd45f7e7a3a10e9da04ab4d10e045fcad642255acbfe1f2a495fc9f2dad39ed82290ef8f24833f56440784a2f7b970eb2abd7f28d3e642540263eeb81104661f50eb772daaab820f141526cfb4d95609f4aefed37239451982d2b05d821f4e7f13e1fdb9e2a117530efb43ffd35c63c7dc70d30e3fc11ad94d67afd5359918f1dbf6a70b51760e93c32252eaf60033ccf77178b2c9e9b92c541186e83d5d2b6f9b068ab3fa3e308b148864d3dda2221a2c5cea90bf450c171d73fb4895fa07b6ac2af1971d45635e9aeb5c0464b6cae647fb412bd1ad8292b154eef3821739b644e4e6c8ea94bfbdddc67f7aebe8c35f2e69ed16b40b7c7f8930b2884ed3d59fbe874e1af429308040ce5c099fbf41e878465d62cb9980bfbecf4e08046218bb61f8d74d0e1961164348589f246a76906f44f98f579614506c55d28ee8c23d13006055460dc7b10c043aa8068d3ed9b9cb7f80bedb7a6cefba94bc8fc750d00467cff3a01729480fb64581ae8a07b97f991d3f573ebba134fab8e2faa65a8b0f1051e73777fd40b8bc64b0aa2fe63e18e18623b223caf9550fac2dd5fe4c0d3baa14484394d345f262bc6ea0a65c03d96c4f229f41278fcdb1a7fbd35d5780cfb0f9635e223f36dcdd7c5a7d6b5b359f1dee70f3bb85e732c32c0a20104f924a718a6486c89a429c088afa8a88c18dd12a30851559ecc3e59d23a7c78e8b05466f4df362e890e993016ac4c54d831b07401945718907be04045b3de3d9e7034156d591a1477ab03fefe17ac3d34d77999206ba0a41c97fce3ed87229b8ecfec871c6bb6526f4ff4240ec2bde62f8a520f41ba3b608a6d72dd7ec4384c1cceb0ebe2794640cab682ad9ebf222f4309aee41d35e36d17c79de2df7b168702f06a9a2ec57ddf8923b8c6fbda623c79704976bd9198027626cf2006c7d29e09044a4967891992f3c46c241e57c2ad822914a103c9d95849c730fbb42fca040ddefe4b103337061ace3e91b322a3e98d4d74e34b538266d93eb13abbc653bf8b0bb4d33ac3c31154f9c74b690e91f5da004646f14d17cc0a8180e0f52af1c27e4def42c8bd5bf915fd741ee5bccb62805e3146dbbd647a55bd997042f23b3ce5348b56156ce3c321456e5de16d083d036b5f458a5a421afc44b60c06ed35d03fceaab65bb095b5da9b9a919d6ef38d3018c34b4977101c9d7c913a20d894858b92b1a417cdba381fa4c8d9c06d24adf9094027c98d150440b67834c285b9502b84809e7d6e7ee86e51a7b49e5a3f53daa5484a81a7c0abae0ce6e5eb9daae73fa5f0b055aea75272db439ed22be70c574e551a264b62b3527efc88f2eeb1b7c89d9d2edf99cbc93592fb41e4877687eb3f8b0127eee32ef8d81fb0692b10b32cccdf6f73404ba9f0de87576c692f267f07d72f868291717e9000a16228bf0b26665e27ac197e994dcae0b72edd5fb240b56a516c8315f371e1b6cf14c81a20cb2be449088234cea3b39d51deefe901a880a6a47613ba081a9b9d25729c19e5972cd9a8360854c52b47b896b3f293663d1a185fdd87d298f50ec35fde0a55b11a9f7dd4c6214037f8a9c44ada2c664c4e720c616f062c3d7cd13f4d84761e0f5f6800c14463d8f983355d3b6b2f2dd8a6bda5c70fc436089329905430135a6ae921e31521732708b1e4ea129410fbe16ea7b903cf891dbab7a294184141b4776bc2e3cb913a1ed7aff3df28fb80462ab4f0a6612cc5b3b8a8f43d4670513fc9390e9038a5225f0fbd58215f664eae3e940ebbce536ed920ec92dbd69e41fd0e7b4e44ad38e9aa8d414dab0a970779fa52be3db59a5e7415354ebcb08ed39084742b0ffb1a65c9d5f9e24385fba33db3986bf857caed96f159df16cf5590fd7949512b38239d839da7c082666fa3d1662084a7edbe8e6e24aafe99dc536afd2ff5c5adb794f32e45c32e0b37838afe330b2feca94d90320432741bed2a3c8f611fd0708263ae31f81e4e8368082f88830a11d4047dc9d38600914d0912d4f406071b05c0ff283a8fd32076f7624cd4680ad860ddce48c13959cd34767b5ba6a3a4932362e86b11d9fddc867dfc13a9c373d8ffaaed5dabc67b7d6f0df74029decf466c73cb2c69505f139a329b40cad66fedca30730e00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "", 2, 639133346, 0, "a24fafeff14776b8aadf7e14a20212503d18ffcb6d179dc48ceff48f7386ae4d"],
+	["030000807082c40303f9053c0392de040e8540e5041e56552896cd686a53c10647a63f9c4127a30e670300000009ac63656552ac636353ffffffffc55387b46cb86f98a43deead91473e7578823a475ad3cc60b0c305985eb075f4000000000453ac0063ffffffff2de8696623d6b7ba0189b9cf52a6d0cbf7ba4cea0c7224bc0af0b9246aedbc39030000000100ffffffff0159017304000000000100000000000000000000", "536a00516a53", 2, -1758097596, 733220448, "36a9bb95f462cd0509deedbf3882f4a0a4ef0c80acc55ae35dcf47c8ebd4a464"],
+	["0400008085202f89039089e17ed2aca5ea6ddb31ce2493bff3d51573c127b030d20b471ecba31f22fa020000000252ac44604bc29db13b6bda89d7b0b24af05ffc7c50fff9aa8dac3a8217d97b956a983af07ba803000000080053ac6551006363ffffffff8e4ec0bf50394471b3afdf91cabc930967945edfe843d84efeb35a8ea710830e0300000004655200ac349ed08c04a0bbd8040000000006515353ac536a8ae3c600000000000751ac51656552acad99ab01000000000800516a53510053535a8e5704000000000963525100510053515371eaa14e00000000b5d463020000000002738720a444b77fa58ef3d42a7e0eb8b27e24369c00bd8b2ebeb085ad44a4c700d46b85ade400d8e5180adc8c76a719c415583ca00d6a9b5b9e1ae17e270f833e5e51aaa4174d641ae6afc4565eab9985498db7b079296f6661c6b0e03edb2d9a4540182de7fa932f0f65e715b887bd0931d071a253e0d246cbb966896feda63e67ccd4c674525667fa2834fc60ad0f675eee99d136b26ed4cd41f88a27c47999e3e975539d8d3c5b5b8548da6e4c7ba4e6341cd41ae0568f336cb566bdfd8d12e95d63b9be3743d00c2fa0c84e89bcccb575bc87e9f396548d886b6f1229db1bb9246a044782b7759d26464707eeb70baac854e2e1b1b4098cbe69fcbf6f7be2a81d42768c548d3425e79db1bb3bcdebb289b07b829c3b9c1407c0d2d8a8c019f00e1602765ac640049b936fb9b73591c1361d3afbb57b42ca796e06f1da00cd69505f139a329b40cad66fedca30730e00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000075ab9de44c98645c7f3e0ee4cebf718662ccf0161d0ec08bfcfdcc7216d8dbbc990e4e3de0fba62f067e0a7fdf3382f4de6d9fe1cdc7c37dfb84357f505516312fb8b619fb29c71368fb222b486cc99dbb9f7c570ab11f51dc3c7265df20ea4b3b236967707cdc45e453d13988fc7c9d9ed92d487b37dec5835dfc3fa8fe2336cd357af42cc13dd6c3f1692e1273d48d3f1d62a90b0abf8bc8df2b8c7ca50c62bcfe45f7c84b92f16068db81c27111c0c5b0c712ec133de01d03ae5ef593a136425fb1087fa07dba085049fd50a1628d45bad26f764c9d00e22402b0705074c8a35b04169136bfea8baa48c12386e4e16d9ae6ff8f14ccb394aedba02e48a6b6ce573803d13a6fce61073edc7aea4e524f0d44fff26e7a110c3e763272fd8dfc7946a95b585dff585690297a06404ebaa0c191fd3344f683e7c92aba495af42e69505f139a329b40cad66fedca30730e00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001fdf9ce35da44b9ff361ab006e232dc10387b06c178bc488a9cc6e9762b3e18efe40a22143b2f2e0ff0050ff20dab83599016fb28813045cb5ea92eb699a7172196a8cf3d32304c316e67bcb42b580bb6b4d85b7001e3b7dde263d8aa5772a548b3cceb990e6693eb93f503d74ccc197db8466b8ae5a09fda675b5fb9e164632625c65032cb0515e60211d806ef6df7a0631800114476226d42500681a331e6c0af5ac1175b2bec3b777e94b0feca4f3e9078f5552439bec5a2eedb2a498fa58e8b71a8389c59783baf40273d186b6c85aadbcdab273f3b22a2acf90cbe8b78d711a0935b5b59458ca69780b08390201e8b70fc625855129cc4afe0c3492d024f673adcd7889766ba527b93456a86a41cfd3e24ddcbc76ed6ccfad5cff6fbc6807bfd235c13d5425ba175435223499c27419ae3979b8d2b99a1240251f09b70c697eff0e30cfa49be1db299fd51ee49bb84be47973ecc709e929b7a9c9473ad3767e5f6f88b252fbc26d1a4dfb5b3c2f2df5ba41598d0e9ab358f252b8459f5b787929309d7328422b2ce4e80c5d76263c7261645e6acf8a977e560ec7aea0db09b2fd78e85ab535a201a3aa7b279e9a5b69c0d86648f7c2882bec770f3cb533ee20abc8f53f2710b2001c5650814ac3003fe150bf31f0331aa9029d3868787d40e924fe453612edb429e232120f86c7de66be99808ec8ebcdb6ea8052425753df628f836f085dcfa620955366604380ff5100302a41fa39e22cd6f0e91ac2e50d8a8bd6ace6180e006ca2bc8e9810ea55d41dbc295b6595168cef4605fc286194c4538385006725bdd25b1cc3b312e24169b5a65c64cbc09ff2b6081f33ee5e73f38ccc27244dc6500cb6329ee1d442b9ae4d2633fcd7cdfca0f3edf76bc658b718baeaeb1fecb9a97d3a9e7da3f1c78af1b6b33afe3a786db532f5499865f1b9525ae0dee33d05f810ef1545242e35ec1f9c3293830992251ab9bb288d6d1c416e3dced48e1268a49bc045615fe0d5bd1e1dba244cb9dcc6add82b992852541bca6aca4d5a49cfcba7d4f407f2817678f4db069aa321045caad5ec4ab9cea72191f734c084157419349ef74b4f4a2754706f2f74633f65a09ba065c995c493d5714cc2811045c1f53084d0bfc65826bf3f0c5732e70f1a027ebd2ef4d22f22179bc2be3b4780ea578c1b0e60e8cc7474754964e4053625e03c54afd3f54e99efe14cbf9dc3b648b60e441f5e78b7576ada0ac22b183b06639bb0e47126d9b78bed7376f4e7a8c96034122ef80a7c064daa8e64dc0db5ee5e99371a726e11163d00b7d74db53ef35f8e6ccd289339b99b05176e80389105304000000000000000000000000a9dee3bc6d6217a679de38d5d8c945dfdc430ac2bd98ab5654af9410e7dba3a201d61111a0280830f9ff05dfc99dd74b4e369c19a7a6a85f01805b4a8224a687dc8ab7f19ba938d2cce123abc4077537e39dc70339859e3e7f392fbb3912c20a00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000c66f328997228d08229e01f4b3c7d36101d797f7577a27d786a4ec839d4cf649e42b5f391525f35dfff0c8d770b5b9eaf4b3fc51b325581c5ef5d2fba0541807e90a9a098696f2602be58e0aed07675b99314ad5d10e63f32b58fd45ea69fd0f95648ac4a9dbd8ffaaf461581d8d800ff12e242568a04bb1780c0d756809564023ab8ec7b9136e97eb6a30c62d230ab7dba56599b5c9cd984f10c0d1384e5a9dc960d28fbcd9a2714977d301ca9906869a6ecdd078ae7b0d71337126d01ec0d49f3a21393cfc77f4baab9de0d1442cc5e784082a21c82fd0b6b7ddfb29167c03db0c92fcdb43e6ccb543a7e988592818da31f309bdb7c8505e5a5b1c045f67ed0b0933404e2349aa58e01a29f7424d0d10b142f0014e48dd2680dea4c6f317f34baf9fc7aaa4aa5a6ea10f25dbccb43c1b7925d8d620316a77ceaf643264882312ed227f9ed0c59a8976138d453ef62c264d76b954e260acde13e8012452a08dbd4b7e3ea345d62528e112a5516e7ac3e27bdc236bf8d6cd0a1da100a2ee0b26b79038828bb5a91042f165d7a48ceefafb14aa493014649330b9541b66bae20897ecb44451138be90b4e6f7c040ec90050d084acbe371ec233aa30ac54059fe3f37875db815d161d48e15a3b8db19968461c1fa976e7eefde603e4864e57d98b6de448e4ca6803c1ec416f769b4fa7f1f742a15b64fd2ed8f55d63cc731c28ecbce4dfd8b0a5d9c616b2d038d63beecb654601e9609fff3a40cd73489ecd8698e1beb9f6e9078fb2bacd315f2215516caaf25a4026c873816de8816d1a87eec0a1af4af7e1decdde089af0a7b3f3b731289ddbe7027b3ea4b6760b0c5f68554170c4c7fef520c492e748a1fe4604e4b20e687a6c69de306db966d36f525f42b191e641e31737f45e80bf2359fa860b20cb3c9b50e836f64269bd75edda6c94ccedca0e6a11a7b6438df7fc3d32a18b1ea0fb7298d85ead44559c32818362d495c5d2e6857b3f30f7ee56a163890586bbd64cbe9d59370cd32e215259572b81c5ff69230b71c85792cd685218fb672cdcff386db01f44febd239576db2cb9e7867a92a8d91061e3827895786abfde6f9d66522325ff9eeda29c09011ea71ec9dcd583d4831778bf797cd1794e78d44a9d24eca4df8de0ee88de62f1c761e9b7f321c71f33c3e9ed245ae81ce9c801733dda50dc16ae726df0754562159787e91f8108aefb263968ec2b672fde09a5e474932a0030df14c81f0474641894572b22f96584b4a387722d7ff7c5eabb54e5832ae871e32a153282dce913a7bc267bc822b792c77b6169c094e71e068cdb51884b9566d5827be7f40cc7249afaf58bedce1cd8e10c57a44b3e9bad3b4377b919865f9eb3dda01686ebf2df6eade477960dbea163bbd2f8884f411e132ab267568707787bfe84b53b09e06bcbc1143f83bcb8725a02bd7a2419a107e7b0d441e54d5b679ebd31cbc6c2f5647d63ab88895465d29a87088b9801e82f76723ce9d444d9691a6aea64375e25805ec39e00545c4298bada1a188ac992315ed475706fed7f9dee8fa67e505fa4e969aa58d1a836f59dc68f14fc7c12c686c75a3f0e05f437ac3643017b3b724460360e521dc9738e50829a7d5a41e104ae76f04cd2ab4fee623ac92a07fb222f311a893fd95cf3a470d6569f16b8d07971a266b89a45066bc6793024b940f9d41cf0e83424f4e86866117fc324e7a672c58543df2affc8477e72a0efc4faeb765858734ebc9e592839b704c9c98e71fed9e512d8c4c269f4dc5e01ba060255c5809b841ad6e71799f978ec3c9d6c7e3967dccd476149b4b31a60fe613725c30bca44ae01ceb0714a0dbd370aab23a9dd4897e4afe2ccb8038cbf72df75dd641b48c81f66ffbfe3293f228013844c6f03e6816cc4baf84db35aa3a3d51f43c0e7b2f33af3682959807859d5c0bc49a4007c6c36d6faa868e25f179889234ceb178509d3caa85666342698f158df3c56c355aab678814d9eb5fa64c5904dcddff696ecf10576e298804a7d2767c76c6abb7d3eeb0f2f486a16e823a51c145bebddd6361a18e2799b1cce75af53c8d4f104c38d988f9fb4a61da193cc0ab85362d0d8b6572dafe4509ac668edd8edb74a625c49b86ff05470e50000000000000000ccf51b01000000001e32f721790ddfc2c7bc04fb8a170e03f7b5ca8c3fe63389172a44ef76180bdb4792c9024b1451003cd201aae3cfffa3921fca58e3d0f0d7e0e787bd5ac1825fa322c386bae77cff49594d718a86f9bf272b45a0ec1f4622b14d2b01a218dee70000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000071d96e9118d14af70ccb93f6f91840358267f526d8e9abb011c3dabf96f88372c4805ea387e38716d999fcb6044a9204a2ec771e9b489cbd125ed69dcb526af699a4f2956012df1350f0945c8cce0a520bed04b5cdb19dab53c440e45a76ed263af5e65b37bfdd3d48253597447f2964e25fae4a024de229c53b63ae8856a8ee3b20e74900d8d8c61285a16d1ca183ab4f601975483950db112b8aa3bd75dedfb8dd9fc0b36179995772111d09aa780342df0e2b01ae6bf607f1019972941cf0f661421c0ad40105316ee1c364c8a323dabb89cd68816773ffc5e6a1620d40a1e0226327116e09d7c09dac6bd49bcf486f567912d81e3f3337f524f53143791c6d6f50a274d099857135cad4411e5e4eb0d8bee92219f433c70c2e0a610fcb54114dabe0fb2f19c8a0367da84a12fe1fdaa9fe1ee40e98e8f9e233b53838745ba4cbd8b48bd7f2e5fb60bbb5fa7fe267825b6247c61b8af5a5408ec5f226d4cb290707fb7930ddb6c9c72862fd6185c87b0068549fee94c1df2597b1b19c609db18e4ed6eae1e596246364824137d76af6747bcc1714365960bf61151205ce57e0230c355be8feb8224ccaef7558ca5b252b713c4d1883b711c47e18f46f7236e36156305d9196bd010f8bb3e3d60f824183715e4a25bf5b10ff239fc893aefdf99858d7519cda9342758d68daadbeb298b9ddebaa1baf55f40ebea2b565a4d16ce42b294337c27d77a8c45e31bd352d3635fab781b2b98704aef0ef1ee5c391f55919e3f71e2c729996e5654b743f86ab53a7a3260432feb60031e720b8147df6d427c0749eed838016f733bbcbc87f9f6f24ca3a109a4ff717ca0e06a9c55807ae60744344b6f525226f9077d384df75c6d060b422eeddeca7b05ad656553b03983cdbf78e4803b643146a84e273858ee8552f30375aafec1eef300c14a836a0f75f3ee02dafa7006898002e804c782f64b99e71e735087bf2e87ffa0169ff3fa554559e7ca31197a225fc9aeb3e5a7067f50cdf4f3dc390272fe95273d4c4842f0c71e3b062ea34b66fae55791aa868b7148c32594c31ad738bbb2acef6483b7eb6a212805867ce5b899bd48ea1621610a502939a622bfb95d601b194e7c209ab471c78430e8a7ab9fbe68a1b0e747d8df5d67015bf5f9ff5a303fe3cc414499caf23e401f9064878dcddc07d8d3f5aec586a1f980eb2f88b9b113239205d6f2de9d5279bd1104d0db6940f1564ccc98fa9a9b643a0da652b64b705f4fdde97c261ca70c6df23c71f6c625585e69ef703cf74cf4cd7010a293b2ef621f0c6c3326e5e291fa6bda9addcef2fd8cd27f3ac4ee09d215254581d5f5c4b13576c123b264ae62cef44d9072c9e333f1b60ecdf4e23be84a8aa3f926c2ba6a604a23cd9a11dcf1c733d4505c14d0da27fa492cedef06c2d00d146dfcc43ca4d460170c06023edf153a943d4dfff37746d782cb3333e1d03cfbc86b4d6352907e840968c9b36a174320c23bad6088bfab5dc363234b95a0754af1b13f9915556554f060061cdfbdec8b6e6a0206d42f2a02db162fcb5559fa4478c6193a604ef6b2b39c5b4ee8b50801e176193b45db67689d1ef136b507bd71282e7ac1a83e24e9900f153d12856ac08b0c711592cf357dad77427e9852048b099437402d77acd6e169049e68a4f3c1ea9bf41f1961a8a437633339923bd0dada55d68c401e458a749827c4b7ff167dd702cd67ea3156789ed81e92710b317831a15c65474b746b640b5ac1eec23055a103c4ca04cf8f85f627802097ff05de94d1fca2911160cd8b6584025eac2e0c6778ba82c497656865fd83588a007830e284687e3da47d25de219d087319b77cb2357be06a9377871b83e888eb1b501b4c7205036cef7c619f878da880577fa38a08978ca5f897547009f7a71313eddb2f521d9aab945a795535a0a87a370abf88f7cf96ea424001648cf53fca54e49a01f08004bf1f5640a125b10359f773efe449fb116c481ccb866189242709e21dbe5111cf337871566d4d9589858fd0d730d80a659831c19564987ea557e8226c043c861d6654c5dabbf0dcf95dd411b363f875a70daf9869754d02519f1ff3fa24db2796ce583c67f99e23ffe04e544b52ecaf2ab68e128a307ca00000000000000006e876c0200000000d4ff46b9227f1a9b0c02af83933f728299f8f8c7095f8b54e5ac995636fd9df4152f1a1ef99c0b2eb96baeec22713895096d1347f2e5b78976d34971c6749ba42b972216d9488aeac829c81c5d004e82e6866e6302e1224fd3b55949f04ab4c900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000b789dcf6aa1b2ee80b2f2357f763390da61ad2b15f965f33772aaab1797f280e82cbb47bdf6ffe28a609c8712bcbc557022dc6793d44f48f19f4f0aa1492d804b094b65686aad6564c0a61f66f5cca4a5543ef8856376ace3e88693f2100c042de12ad96b4ac81acfdedf23d462b61cd70acaccf9566a33ee20529fc215d47116e49fe68f1fb4f6e37fc42e9ad8db9a3b5fa9050bb3dd0099be2001970c1c53b91a551361c67445b29db1410969d4202ea5070ed704bde254d07d51231649515b566c6328f3bded6e2d8210c0813d00d126eecb06e34a501604b4248e4f3ab800bcce892fcf1ca83c535eb41e57ac23313829eb26d5c695f79ab78725ee1d860f06be7f827977647f187d2a87b3b83acea71d7fac440fca9636badca19e7a5f2d104a11b18d4bfa1d9fc6b39c88cfce76d9ed289acdd5b695856a7fbb7f26cf3264206f2e3b50e4f684b8a433db5a6ec54cce93638cde8945d5d36a74190f9e822bd1a2610765ed8e6a7fafe6c31eb3b0c3547979959e38f695fc1833c5cd8321458e0a5fed97b9010009401f1d4ca32251233b11d608dcca266c7498fbb55a7ac2e5bb0371906c6cfc48d37ad67547aab1cac5e8f610683d71619cbd78371654eb7956924cf927f1c07c1d16c7c38487733a382de0d22f5585940718a3a17fe5e9a401285b5c57f3b169f779e2396757df68b255713fa6637056f73359e1330e6274b6733dfa3463516acadafe7b0cbe1f4324a57b9d0ab63922ae30084caca1e06399b8ceec7b303cb485c097b179d025786050fa245a26dfef5c6b212beeee8a3295db263b1087939f09764b0cbcce589ac5b540735a04f6ce85ed03f1176dd6187661ae8211edb851e34ea3f3232ef55877a18f4601d72a1e7c70b4c87459b0a2505343eff3e80851a958a25c9f325ed8ded44f9150a0dbd6be07dd68c8814885b304fe6ab814dd12e1a50402528d76e317f52ea2d5b9cf09c6044173f1817c56be0fe442a21bcd881b1c8df7ab609d1e6df4202f54f261e1ef45bea677305739facfb42a7b7f7da0d5b48251b3810c7f1000da6e73c0a4745af2a9ab2dbf49bf2af905bc58bb6726d3650314d099fa3b716613080ae8ad5acdd014bf74bb7e3fd7430b3106f3a8d20ec5eae365d60269e3df81391ce18c11188e22bfb07cec87dcaae2bda020814cc83c26fb2dcee6527614ddedd9e7ef289a33ed55a41f5cc32911a24ae47276ad15871d012d0942f2c56c6e0a8e071954534e18633de9b59b169dd54df8366c92aa0d558a244f43b23e4050f01255080078c73a9d75ad5c86499d359640bd6fdd344d7620bd305a4024d433bd75dc2085cf8c1bd94e3951fd9b4774d9547ade312b9a69e8918697cd9c6db0fc39f378c21bee78e8992225ac27c1e922f34e7092c96611ab276b7ecabdc42c6ea4dc3f4ba63c75bb11dc4a57120f8dcd468ee0150d0fa62abff46884d26175420d9334eac83ef06d9be3df319eb07c58b4b1df32254c42a2bea4e54fec8a7139e6465f53131a7165a845f23bc43880a1a21843aef14bd762aaa80e619f54013dcc9f9326ac059fd6eda720dae1f2b8554eb34ca664bf974858567a7f4f09a00d1f5a74b9ecfe84d2cddaef975712e0659b80ef2af1ad9ec297174392dbf3e9a1df55ec6d5395a332c30305f0fd4ad1c6e7a9b5927758217d894c9bd2b97823b7b47d5cb14251301537c179cd7d47d3709c22acf49a675509f8066ae53323233e6a3844902ab91111241afeb3e14b30cae70c879cf1bb1c684545071559bf24728238f2778fceb06d7257375afd53a0deaabd53ecf4e5b1c944bf5f31ed383eed4116f86b7e97f1f57ebeaf15248b4791cade30b2bc9dd09eaea92861f84343a82c9f753d566d2f5f8c00ea180a288fe694a1a13b6985f92ca2dc052675e0a6dfc2cd415c98fea962142f298f0787c6a132b531b82e9fdddce036eb7f4145a09ed8df1df6bad78775f39323d38768d6d4106c25168e8738da4feae23a65f0da2ad6aefa4a4613ec4de8af5405264ed864db8ef1f32f94ceed42f9279c0d0f9d6c2b2ac3926cc47d8ecbaeba96e76ae102861be888d3beb4ff7a8eec86e03b4b43f898c773455188b6ad00f0af6d78951898e1f4d46d9022e2c075d937b44477a31d13ed2ced30386b304d996efe4d1f01f5eccca4ff081cd3ee9a6214d48eb1986c3c8043e5fd0c333b9226906cb5e6bc343fc4ba1333aa64d5923ace97a9a80be0020ca6eccef107765a3f2f8ea7fba7b8c6a809ca082f702d5760f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "", 0, -1941191547, 1537743641, "65bb06e39e64dcdf5fb556b53d5dae2e82f7fa9160b48bcdbf66228c128d7838"],
+	["0400008085202f89045838a7276d1feea8394f8130484b55595fb22ad0df2e6f2fb4d451f38434213e02000000086a52635100635100ffffffff8b214c426d7a77cdc0b531ef2b8a15388be7a87a1963e618fedf99f2fe077fd60100000008636a635151525363ffffffffc19e07c428c2385d6164eaef30bd39da0a52f0b8b5d462e8d1e71fe0afb4e3890000000009535151526363000052120fa3900aa89ea01c8077868f60cfd671c418ffe8c0cf6fc4ca95c701709bdc628eafce01000000055352ac53528a13c576042772e50100000000015308219b050000000008ac0052ac5265536a49e8a0020000000009525263006a63526a65d76d63040000000002636a2c3539145c18a502021695020000000001d366f6548d121838214973b63d7d60b8bf4f23bf3abb9ecabd7d8ee975ad7c89b268b77faab9d7e993b2dfb3f30784e753aa810b3a2d5467e5db9c9c179f7b2814cdb73beee2c9eeb833a7af79c56e137832b00a8066242fa4370a13522b908c77bba83b9cb08e86857a4e93c836410608368d082b42998c10eb2280ca08a9be60bac785b95d63a7c3b4625c8751be8574af2dd2d6996056f08bfffb84f4dd276c37d67009a34af2af0d176eccf6dff1b506bfc5a21176eb49fbadfe1f750743110d3d4c3b566b79b66e86e2b735e49df084c5ed4e79a89d048135394b352da192a3c68488cfad16e16a196f01bffb6990ffa1003e6cd6b2ec98f471673e67532f090030f1f6c329bf28fdb382e24b3532217a61a9533d7624260e6e4975d7e1e155070939303eb11be041633d75b7cbdc4fbc20c9429acd0d006a3663ca9b3ff8ea7fba7b8c6a809ca082f702d5760f000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000036c62774bdaafc4fb1abb0941ef7ac8a7eab81713e1bd990b0c487dcdc34071ed5ff88744f0d1d3d4720429b8271f78bff00fca4bb004204d0865bbf0ad89a9328cfcd6f4169f49bac9889217970fbf84b71625059b6c7383c99abf1865b58d2138e0d624ae169aef342603580909ef25e270cf5999f8195f1f2fad1adf076b24422a2abace544c038593fbdc6b04143d697fb901f03ffba9cc02cf628d8a276b095fb601fd76fb8fee9ec371778e2afc72302129e11560f196a56392cb9b3f0c32259b21221b3388e5ca8217971ec018ac96428be97d0cdd55fea7d774e58f8cb94c5da09a573e3f00a942129887aaa642ce4de0000b04e9edc3dbfb7c30a2bd3f950b012393ce7dcfd75d0a1137cece7d4037bbe4e74d3840afe9027e212aa0e04ae94cf167d4635ea24e105819308ff5aa621cbeb96db58cfdfbfad5d9fc72fcee09eae485ed60633f3305736e0d25b01fe0cd3c1094ea09c2178e70c86910f2b7601fc6a038951ad0b68b9cfdd4d669433abe81b808d4530ebffb73ba81f22ae853f8d50ef1cdbefeb6d956a0a99d39ca6fb9a71265f1129b7b5d332ff1e8fc27cbae4ea6fedc00ee9c1ea9f3ebcfa705905fda49083529d05efbeed75ae1ab68175f92e06e48e3321f032e2c642236a7818a5e8af03dd407d887d800232bdadd0005cb3809908495571b234fd4d3a4ccd0adfb83191eca3058e97a106b089c7018e551964fe3842088edd3a4b8785ef2953ae9c38aeeff30233665d2d45e789447439620587ed6f4513353bf2020fd4d805fa4d74683ae8af4ee52574007c29035142f4b538420b04944d8eaa25a5fd998a3ae013fa261e76b88b7a7ba8f2d92072e290a413cd7a52dad11bd21c7924d85befbd9e0dda768abf858b9f40f7602983218ac9de01580ca797c9a2836b828b61f55c2e99541c70cab1b2d392cd75e6141a04b8aa41a231a0f0a2d1fdd7c969685a09e90a1ad8a883fd2ba930a2bab8a9f4fe81bae231773b0040d8a1ad7d9c8c378d9a2dc3cb0ac5159330e8bc733d53fef7c512770dd493fb5697668f995b18ba723321a96a284778716d19d046f9b28738f35131b0837cd0fc1944d51ecc625e00e4f13d4b7baf487f826d56cccf19b0c86421d0437378c71f1d47d08bbaa784bf604a51d563ee50ac8b8d0104e550e5dda5cb8b6aa59cab01730030eee8664615d4b57e52cec36662e02e62438f40f090dbb556f1f3120f59330b13ba860163db14b2ba2404f8b7ea617a478de3ce44651cde00851aaf2eea0077593fe2f48d002cbf38532827db312f1129821cb0e6716c7854709d9f5cf136b53381e22bdd23db99d7ea60ffbf510a50dd5eea615479342701f3616e3a3c03c7ace6e50ab32e1cfdb17e14bf6cf0052aebb74b83a6781326a6e6f48e04cbff73a9c86935e34410c21b2a6c05f6e84e378232a72e28382d669cb67f55215abe4fbfde7bc945063cc9a4fb8bdca88288480298d133fd394b0ab62bb789374c9bf8065e7106c6764b9f8150a6df69414c06e77bd3c04c9b703c65e945b0fb2b45f21ec3c426d4ee73b0a409e8ac16fa3ff355d06eaaaa04d6720d2f7356adfb777ba489558bc5db728b5a51dac261ccffa0b1fa20d1149bb47d59d0b7471be4f07c7f19bd218664027bb20fc071c6281069770b71d7177f61bd553678cd2bde31e7337f05a151e27bdc9dd5a99b6f9f50a812390c14105d8ef0086fa5ee89f84eb1e3e5dc3d84f834335b0714daea28a3fc62819ee8362540aa7290813afd7a0c0d179a01d1fdd4bdbf29bac9028207b24313b76f8f9ec56272bae1eaba80a57c35bb4493300b18e5e15de224fb06c8667ff53ac14b906c4e53f410fbac85839a91ddca460898411e85be1a2adb7ad278f88bc997aaf5137b55fc7e89f9dc7cd330e63079839d40397993c22a0b5f8dbdb5f6a95227108da79f287b0049cc6a448eee4916f1df318a752b0a77b015cfddcb3e435dcdc60d0379c1fddf88a8dfc9c0bc9fd0dd9a4781d74275a3ee9cf7660e2a6598a646d7aae61cab7cc8c9545336164f301ab65af1f2e963a3c9c76f73fad623807fae936cb23e6f49dc9f740f0bf0d4527839b09b2ef37de919562d0734b553c0338836e83a759fe807578952660a210cd32dd851b92f08aee7424c6bd7e0662f886b42429bb8789e805a929e4b69ddc04c378d2a42bfd27f33529b9c0defb68f2620590c9093c0293651a320b5d4acb7c99d3af3ea32cb2f92a1fcd19447c375f1118c3f66be7c7f2d827ea1213c755490cbccdecac8e9473e0cdee238b07d97faa451d7319e6a1cbeaaa4ab7f04060e86d7a2bb0efc7d74b3f0f7284e4b48fcc591e0b9144011f200d164e0c30e0a4781685a3f393f4b3361bd61b39a160719a6eb14c9e2da8733d827ffcd37d6cd57c077b24320f84be229b6c6ab8f45a9e8c8f0612a0c59aafca73f3f1d44585a9f6a2960e5bdfbddc97ea87d1007030d4c98078d08eb69c4feadd28a7b5ad6f1c44ee90780ed37d1f88e7e687d7ce8d458067bfab1d7223c1ecb776b2a9cd9f73290bfd281aeebd3014a2cd52bbf12ed00ee1bc9cb5a308b68880f5d6687b8396e7c76e914b6cc9bc306c859fd5dde567019dc44bfddae1ca48c09a653e34d10657655944d22e6e9f2fc7a457b17cf5b98f8765e0d570d1f2c78270d512bed5b4419864cb9ca4d5ad02b684cd3424a20829f1e8d3ab30bd4f30ca5a3278978a9c8fb6795d9aa6a4f6e23adaf2dcf3afac3b8acf95d82452495ef6fae9a1a7317f3df963375be139289d5cadd5ea821ba843d478a14b667dbe9049ce07a433fb9df03cce5ae7677b29210551dd6b0c4ba6fddf31f0920d026d5bd298cfb2c287bb33fc5753536c85bf7d49f5c4fed1605c1b80513e07ad2dba5719ccb2c1382b24c47221a0f48093ee988c2404a3e9e8aabd573ff8bdf3f9980bfbe6f7c8d5e6ce4b1264017937db9fc1eec38d391121ad623418bdaf66adb9201c0ed92af0370d8637938923820d68363e3d41ccffd563e112c4593d4450dc1bb6482f14667e8e837f573f66f24137cd1606e7121afc6d212fcce66a861ab7deefbc70671b0a96e76782139670d6bd831b040abe9831137e3e47ebb7e2f1cc94564bdb186d8febb18a88680fb63c8dfbcfc2be0c5241507388b01826c180786bc3acb0e7e38dea9678ad596f5b82a82c4e1dfdde03b0bd94819520016b988790988755b4397a2352b7224305b2a5dc4c368207260f321ab589b3acbf0d329310a099f672e8b016e4c43563f832c075366b3c58f60ea3b099af3fd2fcb64c212c25e28b5a2ce70856aae50e03d438703bc1b7c1434be8aab06e72a65221a0242b04fbb298563d7416a4174b72ba10aae584d734e3ae12362f013f53fdd54b86b57811ebc8d6f093ab2834aedffae05f001d154fc16254b44fb3b5e0cc5dd22c09983a0769f065cb68c80d72fe27f6ab3a26979ce9afd94155419e1d9388f246b7155f40a368e4ba509c40675abdace664d2f0027a2e0a4d14b3b59603231e4f0172dd7fc2e30593830f172313efdb82713eded4b28c05eb4e2ca9b2ed8e829ace3529de79e990fc0c943b59a2720c6e198ee9cb10430a181ee4fc114ddf1e14fb07eabf6d8934fcccc1ff05efe4f13138dc6fb334f17063697034d766d6758cedf929231127260315af65dcced89df99e4cfc1b105c8d82f8edc16d0cc93434d54236f084cf66f3ab390f29c2fcbf644c0b6ddfb74d46730ce6aea6eb4e2a7e26982f2549160e78ee5b2fc75ac38470a9b8ec85acd9964ecfc1c619c8ae73cf92a4341329e6dd78c834d9d255a048eb1ef98725eb0d6e1202276dcb4084d8539766e41444cb66969fcd4abef6f0fff93f602b25d56088d0d4bb1be9d061536e5dd240583d171af95a3d8473f250b1ec863a960947e661bd053bc7e5564b08ae515a50b40ee7ce45ea44cab1a84f72bf61fb4ebfdde2e80f5f94821a3c9508886efc3141afe33e4e3cc76a6173383baf7b5d030000000000000000e6b18a0300000000af3fd44c5033fbd77064baaaee39f8dab9ac9531e332d513ce8ab092b4c4940b74e4659b8f1b7e43d7c12ecaecf0ef9634e0f6cff8940f6328516dc53e172d6599e26196de3393307fc06c1ea6b0bdbf2657a5b0cbf78b3a3f58412b87f2781a00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000f73e50bed28813340cb9ab2d1af739f1a98a5486e4e1e398afb5d7376b32e20f6a2e174cdb274cfca7c9737e407d7715a0124a05d3398c23611e5045800bfb690f11992e736325dffd0388f0ff518a6d9b19781a480e61f66c2175d27321a82731fd7e9a7627754d8775e70e28172c97d4d869c65e64567d39a7d4e66c2c6fa32c86012c6cefce9ce22528141f60f91bb86de060287da69e97c7cb4aa793019d44dcf1504ecddd4d63212667640e23c1d779d691c5333d31634c53718e44b98d76dc47f00d29519646cd0cea03359ba2dd8e57d96ff1dac2e34f5ab2cdbbde149f192b1894952a23757a954465f7ff3e038cc146c3e14adca082f3164e9510b9080dd48d4e3d68352efe02b6e4a0fa157eb7320fe6f60d570e89665ba67d963160803fbc53c377921dd13e742758f0f9ff2fa940d450a7bf8ec9c55316ba59bcd1c40e71d9434275376edd5d8ee1d9f7efe3de9f3c2dc3e0847ef3973ff66af56214a678b4b7b4150dc53c76d314bc54e8995efa768f9321e2adf5f46c4d3b0ef68fde62eef0ca97ee00684e596af8ada093c08998c11aa01db8871465b75ac997ad1aea78f1e5015048785e223a2d1301e3b923bb3dd0b9a5a1fccbd64a690bbba4e5a5f356c6b89da1f6493374ca7d69a0d2bccfd1fe007ffc520bc45097a1d6cbf60a68804c3c355fd75e1ca6c64f3ca5e669bdddec168e4e16561aab1fd005ea1a1f13e21c722b3cf3d4ee3443dcaa423a831c910dd0b296383d774a703cfbc556d260ac2f196b57b6e06aad19117dbc55f665ffb3c03e02aca78715f66c011e8920ed8881536006f80a61019da8a37ff3505d5a0ef8b49a9b169bfc901a39c0b67f99eb9984749ea510a5c41818ff41ce771c712b1a363caffbf7afa2b7816c4a80bd62cabc0fbc15a2c29eca1c3ea548dcafe2ddbe5fe8ca4b284c26bf87ffea053297464a7b4608f150162ab8ccbbfa609a12164697a75316e68c4d2409cae421a7af6691f03bb7fbcc5dff7a376735eaa6adfb6997bd6c129cf12ba0b765a280a1c69dbdbae4f77ca4b5c4806c693904ac30eb445bd602bd523596b0ca44e95f5f5ca56b1e5be552c3b2ff4a7659345028948cdd96b466b09e61031206fbf70201a7cb4ac635f2c975d5b9446ee66a222d1ad5b2dd4c66c5817b2babd2e1f2369934c4924e932efd61b60f32e31811fad07ef57ac236b0c3eca24731ec8044205d23d5cf6106c282beb3839fc0ec5ba9e27761f8730357ff164a5b65f16797f0b0aa34f1d37f26f8cfbae3e302d61febe01a7f1b06770c9005064ee444c354c3cfe1f90a0d84cd50ba42ed65058ee9bdbabdbb57cdc687af21981a2c0cec1126e1c53aaefad81354f1975495d0f7a912d1f7fecdb4d5788d0a2cb333cb946fd6436aa4d690b2efa441c46c6fea5027089c3c8f0db50d64427a42be16b431e077b95b17492a919e07c52b97524be570562da605caa1d215a2c66b336aaff95bd9b8f95eaaa0426d83a6492765fdb317978c90034bf5378947ea9c51cd9dc93c74538be4de8a6001fd66fe2e7ce97f838fb7c69eae5c5458ae3b8ae6dc92d2d9dfd2cb74cfd13768025fced2ac7f089bd3b5f01fc3d1978e64f951fbe81a09ae301d379c111986e6fe4fc09df076471dc5db7198af4505a3fbef8ae57e22cf5c172b7d18d2b501b07451c36bbc2d39fd7fb774c62564777b9e42e68de34fb61def525765d54421ab38dd459d199ec7c7ef1a8350dc36be42813341a911a28616fb458cb59245bb44bbb975e0ee9ae2b0f9269e96b598b77f79b5de0954fc1ce407e72a834ada0a9aecb1da0b45a02d1eb1b38f6fec6c312316de07d34cee076fad2002a2d13da4f79e305027ae27d13a5fd04a31a51c5cad0abd17880b9ecee8f4df634d9fd3138cf1e71f07518f22c296e4b200cb696daae900f1203fea8df1ecce276fef1c68caa1056e1f5b13c99f43e58dd554077033619a8125e3c7eebba9c31303511a613938e45b12efa62296513154f565e47f40e424a0a3c1773ffe54995b036fee25ec7e6fa6aee208db514686279b5db7b57c96500cc5deee37d698e3e939cf9af1044ffaf1f605b5a2c0d3b50116fb1df0e0c64f147380bf474072ef16888b1bcaab21019df936afae4f8a03050000000000000000000000008245588bee84f2c37d08ba3551e512a8fa0dbadfb4d3e719e92dc37fbdf02bb33ec1e1b5b269a19d6ec4d4a130fb4fee1fdf1dcfba3199b89a3a858ea6eaf63c94445b8d1292dca6eb4c6917e48666dfc620af3f0c3586b083b4e93e62b14e9000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000a55f64807f1a15dc63e41a3b36ecb5e99f1ae43fc165eb5f982bd57bdb62421e5489867dabf6acaa30b6366107c0489deed5a8152d103311c442afc9ef5f40f9e72584a0d85111dae63ec557f32d49db82d8c15da21419b750ab3a0880769d9e7130a22cd76c6c1777271fb0b2fbb04c5f011ffc4ac4b99619861dc4c08096c01675687a836e6c29c40bab12bc2be1fcbeff78aa6a8033c85c53163161a73b9b0b6a37c059a0d9695cfbc0f36129f34fe272d0b005dfec158def82a70e2ae330a7e0fdc10cb82be995428c6b87b9542847cfaee842f32b75cabace4fb489a682eabc3141e30b1bde968dff342ac6d75509a39ee8eba1f0c874ba988a61f37491740eb79e666d641852ca84681460987529deacb5b90fca32d8e366b262f942565d8fd3d4d2db3bc0e82119b1b9a15d5168613923cc782087eb699baacb47abb9da9160a1885cabfeb3e17e82f1c1a102814303bf5d45c1b2b84925da3ec92a58f91bc82897fd42533e67ba61b8ba521809fef38bb141bca42154fa7e5925c4aef6e8f6819040a9a9d277bf2f7b657bc65d565e855d84a8f3bbd1abf73cb1d05d860f6e810b519e7b081a15b93689675a4e8e411fa09592fdb63e8643167bce63a285fde682a2b5a9dd49ffeb0e205f346e75e005d695fc45f2c21960dcb9ebf5257103133fdf17bc73365c45c7cbdfd19d351007b4be4eea355bc4a9d6d59f3c3bb1504b2f50555ebcebdce7eb20ccf59dc6d173333086dcd19376f6b9dc066f588115f060ba3274fab9ab58a02949c166e1f8c7b9f22d1e7e7c6c84b12e58fa06db69c3e08bf55bcdcbc051441ef2c1a3ccaf51a006b8b414872978a8c297c47beba6555612a76a5382fa7347a68dcd685d36403daf8c62954f73ba35de70695603ed4fed47691a17b6134da6710e2cc5db92a40aefe0ab0660f7d71469283f9a7edca80c0bb17e29c66b82c8585b002dfc46b98938ea8c7ad3ffb73da744a1edb476262c5923e450a6827c8c61534477380a04b20a0f6e1e62ea850a5ad6168b1f53f771ea3af37178bbc7a4fb2a91653d87628a61e22877796ebcd7c0e642a4d588cc4b1df0c85049f89f99b6af0802d688729e2fa9d88823b2a5b27544dca5c7d2e7181bebd6160e6b2e7cce77ad8adc827d3b062f60ff7b22f81fea82c1c2d25ba6f5bfaef27bcd17e250118b428e91c7d5a72be8ab05e7bb5d8d9a2dd5728b617c3454c1abc0b95b3b22068b1fe391f8c1ede31074e29a7c9e365af71cf279a0f00fe1e51c3a8a6607c386e8d9df3e232e87dab38775076ab3df5a5b278773dab1d0b65c624fdf6535ea122e71c86764b7cd59dfdf25a77f40e344056d8549fe16a6e261c000d07e1a283570b557d11f34b623260877ebaa9124c961510e6419286f0bfe49d31fb69db33ff36b589b2cfa619bcd7171bf9d00d7f35e08639e432bc1355e8e7b73f1440228df2d0643dbbdb13dec9125a59988b8d0a6dfb3ff647440d0a440f1eb856bffd1473d40f25f120b684d02369983744bb3ac9c00d33dab9cf42d71bfc2b41aa729739565ce17eced5824cbf3445c529c397ef7de309426fa966fa3070bd986a386c0bc056d4f63f7adc3cff9cf652e5299708ac19060b81ed67f81624e433c3905f703f7d1f9f8395633c773019b79742b46d095bdc7894c5810f58c6b78d0476fb453efd1af3ce21e4240d007d99ef4c50c1153ad33d493349397673c5a657b4b40a43e4ec54d8493aa2117574b3f485bee6548f0c46ac34a635222615c026985128b6011436a5d6bec7033a76f792081d8b7775fab1b20bcd277709d2293499832a7843dfa3887495562d99a3ab4a86740085851c6f2b2a2cb7cb4c9bb1a55e457d0c804c666db8d071d449a62e30e0d3cead6ce0aff125e3475a7fc974a7cdf5eacaadb2948a222036f3a861be4bdd196b8e7c2d01ba68cd96ae975758e8ca3e947dcf89902529ea6b93021ea43dc86a89d49e3d958b03963855575b3b4b1fe48b42d6ae55154d665b9eefbaf19498fad51859d5ed7c1cad5c1cd340749cf5b2ade55198502c749c7b4310e071ab1ed97265d4ee5aec9084786a4a14e500604a165bf6167b0a27aaf6e2f0f1e6535aed918659eb9441de877f75b3d285d6f25f827687c352c4c010000000000000000000000001cc6daafde1b61afa9b0de1ed4e1c802945095caca3acf9f13dd9f5ab60ce8a7ec858807f138ced97f95a3e10d32432fe02993911a257be177f90a99d057d5c75e4ce89de60e53140e3fd4a09d76c270b093c13f33289b755af5485e0767408e00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000be0b1b6900ac7a98df760eae4f01fa1292c8a38d1abe483e28fda7f80d91635ae20cc9061e9b53521cd33002507a3277c23f7c4e904c66ffaa512487217d2866e9219b8d337124033bd606f9b39910a753a95f7595b02750dea055eaffc9fb15fb8042ead89919a02acc6d7131a4a1666dbec734cb38890effbfd05c4d5b987ba7e8c4885e28c7189cd0644173584e289f9bff7b8749ffafe69aa041563b449ddecadbd08ec48ef47d6fb60847e28e08d575b28b96bee5075043795436039e98c644d08f7e226405f117f56e852063a58c76598009ba7f5b8763107055aa2030d74ab3ede0d3f6c4a1966adef7e7912ae119dbedccffcef019a1d3ba3d54101bb4c029c89d1fc4f828d621f06c2bce5171bd8d916e4931361ac9dc273c7cf5be551962e04115d382d7d9f84e415e577af1533be2762b2e4151d6d132626a0a05bfbcbefbc5e781958a942f2341a2bd021a8c610b192ec4b9339eb405ea7ac622007aab7d0f4560cbee00705cf042a06ba10f9abadf5860a5c0f73a1123463d8fff6fcc5c1096a3ac9c1254e2870ca4ee77cfdcf5933ee8ce85c1ceaab20b9f718038abed8414650c2a80c89f0e3a87d078bf5267bd2365e765cdb5842ea451f6955cbb608f1f7edcac9fab2e3a795f0215e97b99d07c60a870bfa97e2d6f5dd3fd8e707e1160e3d8768b40ae315f73ba26109478256bb72dba9dc2e6a7a7b165b1e6612bcbc84d6d027514bd3e60b104fb81ac498bc52295fa1b3e45ef149bd4e1923dd6b28303f1fed708f0c2e8d7c1573ac8cedf404466f24ec2de1a5b74ce5e908c73291f19a75b52903008256bc0bb51772d719b8e9a68dea777cc884da56f9f025c25a4cefe13888b9230bec1e9f0396bf148f1ab11073088971ba129a951f642d2c665b82add60fcf9c4875984f07e53457d714f1e72210ea78dd401d03f2f5ebddded1e59084eb31cbf0ce1f932686613ba34e5465a7deffbc19395cd2d92793dc78c6c56f568f1d260a82cb22d8efac4093f4c15260657fea61285fe011fe59c830bf06d431cb8c855fa2e981a95f1e7bbd161eada2207d77c643b414bd8a2dca858ef691219db0187e2bce5ba85cf33aadf46057d3b6d549df8715cea95e6ae9376bda8f36ec236bf4ed516cd9536c9f520f969063785859c4f6ca9adaa796bf65c95e72d40cd89933eb0cebcf60974b34f12ae7ea4fa05262f79cea90534b538f132347f2aab25984155886d0e91fe4d9484a3ef1bab417cbd1ad6266ebd17124db697b1dd7744bf2bb259cc552b68ca0c24b01e4c987ac5dc2de879e26f0f2668f13864a1218bcfdc24b2d203db857e170d44f79d11de8fa5d641ba3f0c0e0211872eab5d11696c15a8af944da08298982d2db69ad2a084d3e68eb8262d2a0576974c0f29d16029cceaf22d8703810ea8c7985cb725b11b109241e394b57534ade778f8f874476e0633e28c6a8583b54ca2e1dee69e9ea1e7aacff995f384d7cfc9aefbbec9093ee409972112759c83d8f1089f176f21d05018505b04e57b20e93a464c2bac28b0baf97b27fd025927f59125c4be1917ae5cd4b2c91a194f6f0307ced5d7aa8c2fd37ad3ed1538e3fb978a3dcff7fd2efbe9821a185744c7f5b56796be9e826a7c072511c8c787da28cc386928283e8d3159be1cb32f59e3f2f3a5263c6212289b5226dfd6d4c08c6f166f0d348de23e14c63f92b1b6602a38fda55c7ebfe4edbb0fe1fa13f654fd7e84f079fbc66f8dbf3d2c1fa4636fcfa2592ca4b93bde7575c0435461c4b3ee820661a58b4041486c932455056cfb360dbe4ddaf470410c6d2b1b2f85af8e00452eda05f5ef8c58ae6577a4b846227e2a20884c470fa95e469a00a94e35cbb4f09ecabfb2658952ec5378d090b49aaa635b7a8d8c22f6b660662b94e17ee80960fc29ead51b390208aaf77963195341439badd9b2a6265f25bb1f640916611812c545538f88134b6b4eb09cce47052dc18395af121a6b29215da9679988d14327e4fed3049a9df2506efe447607d736b029060b5eae50f4d4c5638e0e635e6daf85cfe31bcff91a5473e2c55e936e502e9fef0089d71e50b37a7f47c3c8e0590e3584be7d0a54e42ca4f335800dde14c776c0c482fce3bac108fbacb2335b3cf4c7982ac83b4c81e0b51009d379819364b14013f6f4f661446874469a41d78d98bab8d812f6497b6a0df91380a757b5e3a7131c455621fe7739aedfd080c24a6a7875864e61878764aa72d31188ecb5fab31f7fe33f494f33513e1ee60400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "ac000052ac53", 3, 1867406827, 4122551051, "ae24a0fa4c013f2a5e1783c2b764affeeec25e7bd2803f5fc2075f40e8447fa4"],
+	["45163f44029ff161cb035b752b257b8c7fdfe88c4b71015d8956757448a19afcc091d1d64f0000000009656552515352525352ffffffff194019741104ffaa73a02a0a6225cd57245566551756b9b494f8424c01489599020000000663526a00000057ce4d90016c4eb0050000000001accaef5ac600", "", 0, 1417796793, 733220448, "cba3131aa95935df626931fbb40c257879f8696a9a75162909e5fe609a091964"],
+	["0400008085202f8903ee201867cbd6ed1d648b4ee36a8d53fb48b8ee260027b9e8fccc098b03cbb9720100000000ffffffff4983c7c77cfb2f8d4237ccf72c71d1a859c2e8b71f4aceb4afce8505eb5ec0b60300000000a487efe205a65ca64b4fb5baa65c534723597424eadf83a5d93ed2dcc2750e2af4868e820200000001636fe1b28e032e8186050000000009635363ac656aac6a5376515c05000000000700655365650052702e45010000000003acac63687a2cee5d28580e0fe92c0300000000028756e5b2590e48b9d5295342e72db7ffe9fdb0ffafd8f3f9c61da854a9ddb983e5db68e1218a667d662724dcac1a0897043601c237492181495dcd4052fd155570ff6eb4b756341a1fbe0a5518e142df011502e86dc31025fbdcba6c29b4fa62cd70eeb39cc625a2df40e974919ca1cd623780e73b7501fd7d4a62c5f54c0cd317147d2d4915735814424f79e425350d3dc1213acec7186b86e48c159628858778834c86d74aa9b8538b87533a027f9cf03f3fd34de9326833b4422f5478de54503eb6d39df97c9749870dcec852fa354baf502941c26922b0f6ffeec975bc443b55f68a19e58fcb92f7fd6f1d6466ef79e0ca1e8e4e2beb8b4f41ad1f9ca5402aa0576a1663cc1fa5b1b42a8e38ac22316a48131003e78fad67ac23c1948a84cb07ee82b495ddd463c3911198898d866dd5555d5728b74967c88cf7b8d9ec78ecb5fab31f7fe33f494f33513e1ee60400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019f7a13c4daa62545d38453306006ba125b80bc9def1ca83d6e75b1cc1c00eaace6017e48c363d208c67a79ced6d716668bad2ee56b50bf48ed0aa4287bd72625697f903e95b5db2cbb1ee66cb5404e4bfce4e87469a2339183b0967220c7141b7641f0fcce88bf7356addb92eea53cc037bc79a320d7f1b98037fe8a2df06ccdac289c786d050d634467ff08a9c5c1922058ab0e31d71d223224e6cc93f921c8abb5170a08b854747ea8003419c2cfee90dabca91967352e9478515eedf750a7031ff942eaa563d5811d651bd0391ed3b8dd306e1dbe55e96041234c9fd674cf5f8584ada557639a292952bc65ca535ff462fc6b53fbaf9d3ca9e9d25620997a1cf90275218224b2942f3a09ae852cf5adfb9421913af5180704bfbd413503e9998a738043ffa1ed87cf71d1dec4fcc149ecba88914b71cca39f12c4ca6d6cdecb5fab31f7fe33f494f33513e1ee604000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000028fd07fa26e98c81eb349db245099cf659c089cd8b90f382dc06fff51e07fbedfb5571f547dc212aad40d611c670bb0da4638ebcf5752e54ef59109659c33bf3f0418a8c4b4ece50506b3a0cd3001e282dafaf01060084884c6883258d57ca52c9fbc45fcd975e28280d5e48fcea508afbd428ddda6d304622223c2930a938b67086b6cc41beae23d16986b4f2843717b290dd1c347de920b967d10e8798b2e0813e15d343e96bda691b996b3928352debc6c9117acb5db4d5072c3f3c7ef28f2e4ab496eade1fd63fc00b3f99744ead34d7e505d911a22ec686d2231c7a9d98ab76739a76153c9cdca059bca2d62c69fc93ce2d659e42c9283ac66a3191caab9d381efdd725119b588011f71d05eeff6df9ae0e1d607d709d9c4aad13092b3c927ee80d80c07ff51aedbb5b33d83800a17e41ec08dd9939612052fd1d663f4843dd7d1c4263184c4c0dfd912b7a3111925f1caaee2357ee49606172bb5e16814392fecb7952aa64a22e80c1bfd5551ae9bb6558a3aacdd36b20d5bc746f41b4127732ef3bd2850bb999f49e0a91e8340c03c4890dcf997a77de05ac7a38679f1540e32fcf97216fd7b517b6cf1227ff0c1bd9bd3589721365acb4fd42081ece627b68836003fc696a2246eb0cd043f228fb71e38108b4e98ead599a410bf2609e8652a422aa869fad87de56829412416b6c2432f2d979d752adf8ccf28fbc84db29f26b3336770538ae74798a2d9561a7c1aab714231c5aafb0be824ed88dc93a6cbe36971f2cb6fa99f93cf8bf3e49eba3d3da599879f3a33e3c418818775b40319ef16e21cb107e7be818698573e8eb2d87298cce2f1c851687d802e2e86454369082e89eab15b41e8a4cae523c5c3c5b8acab91728f0bb776465bccfec4b5b46e70c5d2317440282b1aba1a38669e84cf6e1bcd6014255daf2c3b786e0320518a83af5ece2b6950c9e64a237324a2c531eaef0a9b930f57f84cba310b0c7b28b3f0564963e016c051da6109b4c49183f8ea5964bb56c2d2c5140be5647171f246fdf5a0f1dfd817ba0e0c50c55f9d1ef3376b87ced9c4cb36b5c29869155718985aa0c87084008a244493db6e575d51c9ee99820f9cdf66829d59c0a972921f0ace865e75bddb7ad2fbd992c6aade77a0c57689eddfb5ba95f33e21fd94913f041efc67bad98077f0bba42e3dc5e0d6c4e566527fe292a59b60c4cd6fdc3fc462193a3b133915503d1dd588b734fbd842120e71727677ec46e098b0b371b786b4c465d7b409e1c139c4f534cc18cee8cad6855d3829a246bb832b0cc8d8cdb85c9778bd03cf878f36c52029d47695c56b21759dfc09783f5bbbbd0953fb25db88cf6826ca8ed32257bd202a57b4c870afd406926300359fee6735459afe2292a64ba7e9701957f06faa2518eeb734f7d24d0add232687ea6c0c57977d4dc51e14dbe9f7a1cc5961959dabc9289111232c08b90f502a2ed7fa364c3d71575330e8360572e811ebf091cd84dfe162c3720c0b294365c91f656e04c9174d1be281461b34b56eab14d8f2f8a26fe616fdec5b1d00ba32e0baa4684adb2b9b1d95ee6097e2225fb77d73c99dd4e75978e0f5ed601e05cd94e68bb5d42b72a29f9cedfac4a87fe99d52288059ecea464eb9c55c2f11434502df8fc3888a1bd70800d9538d1ae022a8896f160181f7cb4751e7571df930dabeea953ab43bc482d2e51da5a95770e5181a0f508de9a1ccfc45bc7421d0f5db1cb3fa20f2549e472086cf7cda14c391199a9f9694ec711fdb9843b0796be031f2e600c03c72c5ad9449e8931605b47c88ab72be3afcc5a1f74870ff542d80de6b3f8a6c2d4c349cd783eb791eb28f9ec4b94b3c795a57e447e3935f50623df793081c4358db03b3cc1625d83ed3aae0d9c0513c9ce129d494196514ceca9ed38c318731f462941d3d24b4607f1f9a869e34e1944e92fcf9439ac77b5e06449da36b9568517a8734f92a3375cdaa361d73d4dbb3a3cb7b2dc57a7d05cd98596f2e9406d09d051fd9063703f6b187ac0518137c42c9c0d330f2c1ed84f50ef7e035397ce40f2ff05e2da60b36ede4778a836da73f5b364c7091ceb8f5976c7027fa8738f2d172d7deee0d94f2f1b56ead00368c2370fbc9b9a8d98242437527471d3b3929858f47c0e60eec6e6a7eb39cb8b925bcda84d0730e29cb34cf94d42c2c4399f331fee372f3335985bd8689dcbe88efcba333a7cd91810bdc31b3c3a6bf354b041075a590d117a551fd87fcd4d20b901cfe7196971282f8b677d16768f2345dc80f52223809536f4a6b538118c93772d60f86ecc82c4714b0a6d9cb9c4b1fb32fc3bdef9828b619a2950bb6ef2912f0a199c40a87f634aaf5b5c56a2f324ed321f77d66366c5cdf25ba7a9005b7359ab5b12f8d398b4f82ddeb26e67cc723a78d7d9f7e4a20f9549c97c1525c44b194b2e73b399901ded013eeb3b4cb24377aa1dce6df1f31326e3e48202c8da82e07713b3da3f35dba87cdb2b7c98cc8b31d622f52f6d96e87ccd4075c7591b945b55c1097ff770961dc3efa557eab46aa77c832eb822cb819b0fc5724f4e6adc4c3d4c56d3e31dfd4c3523326b4f7bfdf117d22897cc5bce2846329eff1ffbf490ed4f35825120f93dbea10fb411f074533ef2a67ea2eacc4af43242e75593e700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "6a53526a525365", 1, 1694521251, 4122551051, "0623a2368d3f504bb88c87496facc66a8d3bcb8a987e13994896cba04262d0f4"],
+	["3173dc780142424a867bc2be7b1c8641ce581a96a8c69a74b5648846489c6f1e2f63feed050200000000e234c54501032c7f0500000000000000000000", "656a5152", 0, 1578467322, 1537743641, "aa3ad0995982a0e51a2d9b0b6b10162f736355a5d07eabd83db20878cf89983a"],
+	["030000807082c40304fd88e4763036e464648eb02b855d6821b7b13f27628d69cb9fee45b7c546301f000000000251510828aee494bc15f43af1c92cbd08f7bca483ceb5c1e5c5219db6b9f8e7af0fdb7289b4830200000000ffffffff1183ed06086d7801264fa60495ab4ef8c73a454d14a594ad01499767ef8dd29b0000000000ffffffff1eb109fb00a215e61afde30086cb778a949a05a199a2c41c351ac477cac852dd010000000552acac5100e7613183047146520400000000005652410200000000065352516a51656d327d00000000000352535289ff98030000000006536500ac530089f1071bda95221000", "51636a6a65", 1, -899369390, 733220448, "65eda38e469956c37523272d87c84f97c7401553cdb4fd36264f4126a6096b08"],
+	["030000807082c4030469adadd96ca5c0f8dc58c410f45330e5e24256e4c00c2674d509e71b8772a77901000000076a53ac5153656affffffff0fa69715f83adf01fda20674cf49d63b855024f608b3101208fb29be61f4b02b0100000003ac65acffffffff6ce615eebf85211acc521b644ea84598ef190d58ba9cfe56e02267547bc171a80000000009006a6aac6a6a656500d0979cf10cd21b29ab31811e273d6b49900fd1880ce75f4e429d7da0b7721bc5a335be67010000000252ace0f286170468a0f6020000000001008778a2020000000004526352000bffb2050000000004656a00acb01f8c050000000006ac5163636a53000000000000000000", "00", 2, 255398674, 733220448, "1da43a090e2c263a79807f93355e36116c933ce906c01ed103354518800bb622"],
+	["0400008085202f890359de0deedba92d9abf925f05ea71a8b55612ad89fe3c77ed430278c05ef76cb4010000000651630052000061c3cadaa0f5f7d0e13a0147096a95d2ef381f226931798110f2651466bcfd28ec7bee270300000007ac51535253ac00ffffffff7fc0507631907d7a7ee7f336c5bed774d8305aafaaf07301f547de213f25c1a60000000008ac00530051ac52ac6062320f0213b02b01000000000900acac515353656a6adddd370200000000075363ac6a65536ac5f2f91a00000000511db50100000000042393602dbe479d8801517dd48f838f9045d49f49b990e3f148316042f22addc5ddf6d35fb905d43d6b6758396a0acffb84fa07f4eeee3f668d921b1b65123f396a687298a2f083cda7c54815a5b5be05d99d8773d5b552cebb3804e42a49045b7a5709b0a2258ecce11d30a41146c10aac3c8be9cf79488ae027f6312ff321dfd405e3e139e63c6a627a71f83f7ed490985bdfe14dab4bb7765709c6d6d7079104ba04a3097a307ade0141d4f978c62e018df6c2462554192f618f079c41230ca9bbc8273878be14ca4dfc59d0fac6e36845701105e69850b56c10df43c795445bbf567ac167e2f398d7ca78242d4244142a4d3b13974a24df0d103f6cb6b21fd8f5669592716bfe92bc33795819dc96b9d0dc401b80b92c228acd8b6fce8de32c808c36c7f56ee54bb62d8e98943dc36eed751967caec0747a9dd6d1067d8d8f817acf426b4160094fb1a3bfaefc20b000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000449f073f4cd65ad9de1685d6d2a13e0aa11f1dc3e15d975cc8bae726e8f1673fa5c87a724b0e6d3446f5e5b8247aa9db9c215abfc180db4630dd6a4c45d6ee50926b5175f493a4fa7ef985f9ecbdd1c4660c8a76d435a94bacdf5b11bea21d38472a989ed4ea11fdd56004d44a5fcf7804f8fd092b5ac628b6f2e1a24893eeed8eddd7d618575df1b0b53635c1107d43992f4a36ca71f9ad9a521f0206318dc822db583d5f85e77c274ff54fa5bda6a718a3b175ea5d22471b433773b1e7f35400c3adf841df62c7939363b28eda368b148f62a5548b0350dae2524e9a5fee418811cd65bb6ec90d8a4c14bbed97f26f585c95f007e74b19d464e7afbc12e608eb639f85e7108917a39d1b37ee46c84e423015f62b4342a7c3c4e7c0640d3aaf7b0f929b2b8b7a9a0cf3b928bbe775e05561a3d70912ed693e2d8a007bb92a1df817acf426b4160094fb1a3bfaefc20b0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001af12bb58dc6edf57fff64482b158f2461ea554013f1adc64852c53412ca21e819e5b4c34378a40d7d2744c98c1cf9161c5aa90ea391b166c35ea3c492855e0296a952aff73c968a9b7d2ec5cf179e2448bf4f9f70e66bff564e44ca58bde3bfd255142c9ffbf47437651d839a2d69beed3954c3976a58947e9b3e24d01eef067487580d6119271bad85f36e0e4fac1112750a40124c7a62827c1eecce5c387498fce130b8da3555de8c62b58bbf2bc9892f834927ce81019188285442c5b0c7ad5527a868440948ca8de7b8546841b2f5de9961ae85d56cf67db54e165f7dcb8491d9c688f00ca2372b1dbce5e7f407d26789f9f289128d6a309bcc912e3a6c5b9c82d3aae96bcc1b23023e088e30f96ec336c7755cefd51df05d458ce0ee2fadc6681341be11df600c47572c1d2580b1603d6223efbf10bc18728388a91d05f817acf426b4160094fb1a3bfaefc20b000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000318dae31cc9c12e1bc8d8aaf72e228d87fc1e4805d08e5087b70a9592988cc41dec3428a5b505df7142560ef3c144a7415afae3273f7473608a03085c06ad034fc505e3a22efd197144d2b3214ec7baa9f04e76f010a0222b5b9e8c731cfe24b216fd39c95ee046c728f7ca3f931f89d3861cf5a39987d1d42b618e29ad14f315dac11247a62c147660610f7d61bca1a69cbacb9f1628887149a7d1a66114c8fe89c88e67043b422fa5c2a804ee166dc410f1eed0754c113b7f692c87a5ee21e29347ced570843cc276623f1eb91d1db5669ba8be23a394c66f9e66c086c5779c0949b7a5fcbd932ce262ef2c261c7bbffec3f24fb0d976a1f129015b84858f5da6a01d01278dd15257d5cec82fb226bdf12a9cdf9d7fafac5422f71c4795f928b655775b7a447ad88159442d46f432c3a52da951a45f7937ac62005fd13be23f817acf426b4160094fb1a3bfaefc20b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004a909890505e1bcaa8b9a5af5a49bd66603e5ad855f146559efeaaddb55ed6e97956d1d63b37e2c9bc50578004c239e5c40a633f5caa8a14179660059d2cfb116c603ffcbe212032c3298c08626894ea0d8313d35835334744b4e0be811368fa90d1262fdc014f16ae41ac730af8cc7ff5f6032a124bb36b8485f84aa024c06ffa5136be4a11c188a62083ae39fe04f7fc8187833da4ad86e4f46ebfa884e331f5e56dff55fbaa3d1054a2a480e245e42b5d656b3d408601921248e476cba8d1dd18b2c160d4082fb5e02ee924d945d62a766e22ef9144cb30a498959d5fa108d983e033ce199dd5ef44d16cb63acbe350557af23441228425a4b4474e2eecdbaf0665b0b1ca567ec45748a0bfd917d23048f83c22ea3c7cbe73677168f44c5a99855354df0f4035f2421c2be2722c9e817b0d5db2783fd586a9e504e9f3dcd984ccac9618ce0c90398128c988a466b583eafc661f446828eb596b340e28360a78f306f3bdffeccc0769365fc094a34132466373f1a99f85e41c4cd6b932cd4a9c63a8c90fff3a04a260c59d5ee1c424a9021f9f691ffedab79ec57ebfc94706000a65f79a99ce949e4c0f82f0027898f19a6998463e0134f85f781ab48b3e3f2e89b5bcfd6993e56827cad188f64bdacc50d6bb41b6bb0b5993126c9298686bf709e137d81a98ffda71cd163df937a2602ff72baaa9a28219216a4bb088a691f2e900a3885c27670653ad142ebae9e647909a8df12b582cc7c6713d4709556e375a08d2a2df770b2b2424baf6b435b8bef86f3a5d84d4ae233574eb883a89070260067cfc020f2d30ac9c6a4efb6cd4e6b074dd7eacfcfc73e565e4ffb3d2cc28d50a1c56ce7f1cdea44c05ae9393d394279200d1c8616552434a87dee168f4211aea8d0ed874e7287adec973d1f7f1682a38044326a642647d0b4aa34cce2f77c1d20d9fe8168450c6123dc09e0a202ecab330e5b72267fe1852a5c31a9bd51a3a4c26a01a5b41cd15752c34b9703a7436d0b3bbb992a4ccbe9991c8488acb5326ac957fe17b02b101baa36d18a8028212535c06374a529381fd41c4693fe5e9896619da06ec9b38f7a9dd0aa461c768995a164fdd276836f3bef8823789710f9234d3a310f76a0f41f3f74e646c18c52b921f5761e6e2d40fabe778ae7758eb06a45da59649e44973e0c339fdc4acc30a361b6ecdaaaed498b029a929ea88dd9bef9d69279cd681c198ac976b996f36d8e6bc42613f5b86d7cb7e305021dd542987d9d5238cfb37fab2666994bcc3ad84d3fea3c66ae4c3e2d5c2b1715d1ff7d1c6c478bf4c2627915dcf826609139e2fe6fa307cb21d11d78a1beba74ff2669799e3363b40de4fd676523026c1bf831ac5c24dc0921931d0e265e30257e0f9bc585eda4fff3bba3066b3a10fc064075c7d106b642c0a7de10398d3cd5dcb89eae3d53397b3480b476d7749a476369f2679f91e8328e19d0ea805348500b04f05930d4cf4d8f6b32b96453fba49566d3be632287e6fc78482cacef8b564d4733548bbee01eae1ef03f0a18cc594efd6df22c9d5a0826a25ee75eed40203885e500ec49c1d9be0b1b31d1c4216885fb4632fcf515dcbbb8a7db3b15726f48f8f440f61e0bbb8bb72883cdbfc111e3301c7ab268221462414c0a36983c003cc0e6599c5d96f3eddb1b15624119cd246f5ea94a7ed39fe646bec9fa1764c3792e4ab79cebd865ece6f87541e191a62d4b5d24ef9569effcf62be867c8899332a72e2c985acc2aaa93c4b3f47c019dd81c6189e8002060b05a792df1005e1c1e9e775eeb54cc5e34c96b7caf426c1538cd3701ba50549bdf0028e1e4af1666e6e8baa36f39053927d676abedb99b008f48d146a08769b1189013ac1f939c6779baeab48e32d6851d432b815b58e123ad4b19fa91802dba489b3c2d4db21a7682f6f8786f3ab609bfa565db5b13bef64fbd105f701e792f8fa7b305ed2a8e383295a054b1782409de844fd214544c9781787829bf519237614f60cd4c950250180b26aa66e320afe018db74f77990db248cc30b6c02bbaed377b2c57d22a3cebb61be0125e7808c0804660daaf345e6cc3c4a8fc6466e97aff2aa1162f21ed655d3d1f5e6d9fa11fc84ed741179350c1082bd7990aa0b6aef9c134c768d46105885778e5b0f8db0f8f9ac0fbcb3aa1599fe0d639f6e329271c85db04a719c3d312d7adbf31788576d74486b035769117cd965f5791f668917cfdb5073b0ad83aea75323e5aa7dc97fcfc8f3c618a72bbaf20f1d9495d237c4d99c3be9d0e759acfb18f2c54e1ab6591d231216c70a354d4cb2883a923a47d90bfb670daab6ddc6bc72e937948d16e3bed9a6b869fc361531734bbbb19969c247fd94750cf64a8bfa9d8cfaa0954a8b0cf088209b5c69e0cefc695403fe469d6431488e58b257bbada40630a390dd5159ba852854e58cf9ad4e1c11a63785951462fe00d785533e2981593de9fb5a510e5ff2c3c378b5e6bbb5484c245a01a1de4c4ed2d4794286321e87c43fff6d70bd0ddaf64d8c6adb78e43246e6105fb954e53e3e2172858c328a38f1a8899c5f1383849b10878f39c6dd4db4db8c09df2fe304c6a44f55d770ba1fdd8987163ea7d87cea9a22e3e1c1dd9dd83359d84dc37971d54a4d120e3d7046a156711bf2edeeeed725e8c39bbb185af80cfd1d540f3a161716bd8dc99efd4665cd6141e5b5b2803077d4f93f9d3c19ca4334a5ed393b44c239b090995a61a187f4b66cf16b64d595dafddba94bc4d5aaa1a903c032ab1c3292628f39f70feed5d38a316368013113005c552f60e6cf9068c29f69eafb44bed00b768c28b125929cd562dae7e825a2ecc7b1a81a5efcc1646c2d825e7960990e505a201ba85946c0578c04b1ef50a85b50b1f216cbe5846eb5fe28c1177d7102feaba6f3ad16dc002da3d97bc0733eacd0c202565ec1c69e225be2ad9133f75b3356c02940deaa3443827fdd7047c8be915f5864ca6e4de5919dbecb16101472c974dd1e867c977d67f4866fa636e4cd5cc808fffcc4456338720b5309b5be6e55ad28ff5bdd9c923431f2100e1e1dfe9feabe2e1ff040bd8c0717807f4197f608867f04f4c8d1e3904aed38404494b2cbcf79fce60f0e047e98e2b369b8cff2caa3a0b36b073227b3b244ffe4f0260e10c5ce77f565437291e8b273fe68d2bf8e42237a17350586c40e807dc334d3008fdb56cdc0c03d4c4359f826d6b3661f93f90d9551e3706d25404f394bc830c80ea7ca91bfcce448da990e29266af49dd06127edf389ea62f71f795ea5c3521d51dabcf2d1d46bc10ebf6fcba62e015fc17b49b91055549bebf31623e6bfa908b18c7e8f71bfecba2928b637c6841cb7737b7edec1de694fd52593deba1024677c82744ed4ac8ef499a6ff1aa8103c358e6d702a52c15fcd8c1b1dc6509c6560f09a0f3a62a2be0ad514d7cf296febddfd8dda3b5ce1a9f2437786a61abf7830a7c9cb752c4b9a93aa1337e70d68f4e769d158546a475b94ff5519562b12e119aa170feb324b85be10b3821e3c0090f3cc2c5890ba43a4e7438f124c1a973e25c9b674b3698c8b8957acc741b054b169611f1897159aa3ce744ebfdfaa77957a1324e27372d921aee8eefe57377302edc14ce6265db71ae8a35060ca9b14393d230c4b786f72f44fa7a0c034ace83ac0f539ac0343d09f8a5b57927d3c09889d5eb71f3e0fb8f09da53519933707b9692291e8e87f26db0ade3d53e7ba05b9d0e888b301b9f5c294ed7dc406de58f0cea8ff6ed8cb0540b3fc1009190c82366809e7c15a361478a6def59739b53f4094ec0221a26351f7a54b42da803e65d6209e93673a30203bca36d2d354bd1c71491b3ecdb37bc804ac25653f3fe742e283e4c705f88db585aa867fef12fa7b00d707f3d3137c5e617df1bcad6d6ba7aed95786ad364ca89987aec6657a7d693899b7411da47ce341daafc40c05f1101c02192ccd34670607b3324b8ea830a8cb810e8c3195b7e0b2a89441d7513411ac996c7b2f3d4ad1c791ef868e9007309e4e5630267900b264042509cce7909da1090c77b8ddd51b105f47766c550eafde52356242d645a798b71e967aadb95fe2125a76f9d0ae18241c07cf751834413f1e6c17f7decd4b9bea9922b2b65541f0de207f047e235cca88653e21923db6ec8f7dc820719e7719e0098fe61ec65457820800ffc497b8e9a0dc3bd116c0bb9ba7210185d0145d5d2d41e71d1cd476fca57d419c7b5bf925c959cf5e2cba2a859cf2e166a26cafc46e00c867af27a30b1aa98afc1ff40d7a76feaa4d4ebf57aace6c343c7cbd993c3c6a4b41e09361435ff22e7c4d278cae0400db009eecd20f42de4ce773ad607e6f1ea54101ddcd76cd893d5bbda7d52130dc95c62b959d9479e6e860967da63dd607d7f5c78d3902d2f1801067d3a55fd3cb5eb511c6b46af03190e31e7ac8b9c90152aa3e2da0a141e7a37d0b0f0428f045b59a1c4ad2f07113d7ab07f54ff3d18ad8d09b2922e11692373613d9fc56d28748e98198c28d182bc11b3864b1b60c6f94395e7f0a20bc25cefbe382f46e8d9684d1a161b15ba7ad11ed1e22ca9956fde88a74eadf29da7f1197b67392a600ef6955630a0a34633bb9a801d37ddaf9532d4f9d014e993de577d5c115699ec70237be628c9e1facc6e073ac8404e573fccbbb43a9363b9a9a95f75b27de4ea38a4745ad7804c960dfa8cdc7c801c67bdd035a1e767b0062ff758fc479a41794065c9f8f1e8dec455ae4b22cd6a42955b46e055f12ff7178583bdd03f005ce2f18f2b6e137b573bb8cb81c28d349322fbc140e3602787770b2a189fa1f3d7f71b988a2473cbd069516645d1649f66165a72e970a99de3491d29dd9d3145f126350fae1a2769c8bd9175f99ee305c358fab0d87241253481393101c4bae67c63ebecd5e328f1db40665a26ade5d222c953f9149d93fbb642ed1f553b70520e3151855dc062f38c38d2ceee268a20d40a463d1825ee40ad6c0ad2addd5dca227837726a97bb2305583774e416998de0f1d2d9d9908c5a5c41663b40cc377e17a5d07d1ca1413192074e71b925d6b5087a588c31031c53f13212234c962110160b70ef110c69ef03456f461928c13091b527f5d89f362a5b011204eb6d6f05fdd4473699aad5c1b763fba9b06a94ef706e0159617d13dbfe98b426999304177e8b909fe1719333a1eb22419b961461b9ba5e4d56860e220f0e4c4463d36bec9b2b7dfd03d8795bdddb1f6b2b4ad9361546df43f26796486746f6f7df4eeb186cb3c4886f6fc991fe07f1786c28014e18319ed95266d4491b7f17eddfba5031beebe02000000000000000000000000b7cd97456d229e3c7bf6bdc51b348ca50b6537f6579254e8a0eb2f2a11e559e3d41b3c7f68f6ec86bb31583b6f533fe02080a1e70015cc990d9286a1ef3bb0faf13a40d4bd4130b2f3b8d2d0dd68bf7653ccca4a1616bcb52fc27efa6ffc07f600000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000fadfdcc06cbe5bdbc029a14033d9f6727dbe171a33777585569058d783f9a3429ef45a8433b662faa99d2917d3613d77e3f15be6c38640c12f702a549e468815ba9152c7eaff71e69eb50958801ff438a4280f79b6d41c6067d95fa42fd23f0719ac27f7b501d649756b98eb405dd97dc3eb62e7558feb5d5e1b88832fc200a4602923c8c420ea126f54c1d3c321a6c6f53d62e019009f9c795fa99c81b031b4a64cd8df4786c0271a3c27011ecc9f1a84c676a9636509ad69628bf6babe71138735aa1a91eb6d53264d7037cd84e1677cf85d0dcde11036dc318541207a638532f115591ba7ae6735dee09d3064c00ec6c542bcc379ff9d3cae552a20501abf509fd5ec9deccfd5031c48ee63c2cf6e08862b254c98dde51a3d5a18b2a15860445b5df3929eef827fbf0737947ca732ec7d6bcbdb6b86b5e5542c17c30727c70f94f5aafad357848726da4b769fc370e5fc6c02c760a90fc14a74849fd7358b1fe6ff778673dd0369c892119233319eff9f526e749d8a9129c5feed7bf233209b33b3e37aac1d56f8f54d6f167ae3300b98ecb0dd12d69f0a9bc60b2b54edac79b5d625b6cc551c4ed7eb5d7fa646ca95af8334871c924679d78b1ef888950ebebe25c7648a29aff1255ececfe389c9fe67dbd74301b2680d0aa0b1d52ffb9004cabe1051171607bc51ddd8ea9987bf83178f10bab780b8ae78c3838e38b9a5b65b596980e486eafb4da81238f25d96c61a1ef9067ae16663ee2401a702d9f272bf3547349bcfe7f6280caddf26c6212e5eecc240c92bc986a48de6bf8c9d08ce522ab28d318576110045e43b61e22b6a4c834e961da1dfeace466e785621ced91b82770f482244e07df0b51684c68231e8d979ceacb51078c8cbb7b873f9bab94906836c0e6e6acdb155cbe2dbbf217790e25c105fd00cbb37505cce535ce58ad3801a5d8d645cf37ddf667b52b2d97f02db6cd87fab96f9527ab4d8f42c58126af3c0ededd9e66c083f59bc340a8ce5ab4958df17376b828f0d3d447f27f7df0a7745e75201d3310fa3e0487a826baedc994af227c4c627a9d3ac4db0f816d447f08e3390aec7ff87dffc7feffdfffd91c8fa4d65cd2c47f4cef6cc2f29b53698f4f7c0f656540431b404ab510b6be5196b7007d1a32665e3f6a9452cc6aed865d6debf3dc1f97b344061a511171fac5039328735cfecd67f8dfb77c32721c6e2e6dc48b2df2ec96c405bc8a99cc20235b98b1299f3c231ddec3e3c4d82e3be9b5301ecb036d6b310f4d9617b7f1ec2eac72525f267c0c033dd0c1053b64374581de12b43eca937adeda35d80692bc5b218dc4a25fd9ce1432d923c76936fa98865f2e003b57c2ecb934baee0815435fd123880c137e668f73633677c0143f74a81cc4db1418b061c964cf0be9acb0f92f31e1934eb28706f844c91a8fe8942de21a610e04c55c15e88dc660773662f42dd632fa092746ea651ef0c347a713c6141327873a82cf3ba2a8f028156fb882165dd91c77aa3563f85883674d4f45985c1ec7610676a93593abf4771b394ed74e033e5cb61876f7da8ef25b0bdb49767f1253d2af404e37c5ac301252edfa1e6f9190fc0f0a6a8d301cdc8dedfaf6a5d552a2bdf827121cd1607ef90676d44472979efc7134cdd1d8f2dcfe2b676465841aec7656ee461872461da8bb194a67de0a0262f418c47f0b1f6625acede761bf2d626dffbd69537c0b1cda0b96a3147a922a17bea4cee9bd580a2c67cd9efc76306a37803ce5a7e28d8106a794926e3004006f7ce3d1126da45f460f82978a4f1b8a661e0f85cfa4c57dd085a4575b51f0037667469678315a39d12cc108c021da996126c46041042c74d2ed8b466c5e21de1471892725c525cf29908452a50cb56a51827b3af23384ccb3e7b444da3a22acd1e8e4b4d6254fb1a325413d23c5b205ede802b7ca543e61075527f2024a37ff965bb1101f3c1f1c5230c1625936bd2d53f06b72503cebf5c476a2fc75fe2af10a63cb05057b9187a7f5cb41fea13095480275417b823087a2130484a9773745d4f6036b64bb47a9522189340bf52faaf6c3418a5a90f546c01db16d9c2ea3e81ea4a5eb472be8d77a911ffd4000a5faf42ce5cf0710aa5bb9231f95b2600000000000000002a1e800500000000c8365da38d73515b399c4c8ecf175d721826b54ec97459850c32370fd8c964a00f48ffd266e4dc42c82e6e8a7321f2187217bdd804344c4a99deb32f89a6e011569ea300d1d36369ccddfd75da3cdb70d27b6e8b41e59b7cbaa269fe787983bf00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ee0114b2a8820475c992321c64fd4ff1a41530ef915cffc94deba52804702e4da8e28b38430f0ab28ea12327bb4987117685e18e721471ce9e4eb4689538fd54ccc2a895770c48d0ed914bbc4dc39fcfb9aa44fa7f5f3c397879bd58b59f2be3e7de3dcad2f7dbc7129895a3fed6723ed8a4ae1828c9abb0fb0d28d7f060fff9f1a77327dbadfcb2970aaf755f008fe99251a72632764d8101e727ab5a9ef6b08a505c71096c29eaafc9077816b642a7099de17372f99bb7d9c8f02bd0a0965724dbdf2f6c01fce2a36291ec6a21c7fe6cc64a612d2db14d1dc25879ce8879064c31e962c9e7b3664740b1222e1f9545ed2ee94b5c3c196c6cfc4a8eeac4998c0141f62865239f5edeb86eef889cc456f9b838e458b1c464f28302f7928a379d9132d87d843fb54cc7d5717fb255a7684458c458108a7b29d30a92a7e8d4eb64476f6c627ca13b1f261762100f9ad9f6e62b8840d63c3566f00a6ccb59444592e05fc8dfab27c6b154a78e1f50d4f6d106e47667a6229696cac1dc023ec502ed6725beef0b30f1ab145913e3f32dfad1cd9dd747ebbf2b295f7fa32a91e512a4bf768218a687fbe6e603d00b382da63f906c66c58526318467dea856c69f7ba28cacb0c382e915576852f851aa8cf6fbc950a78ad3b2bb5d8348fbecba9a5aa778432918399ac0ae118d0ba2bfce22d9ec874c69c0acb6de98dcde32528f6b28856ecbf11dc45ea332aa6cec067f58ab499c00b821239b7796dfab0d061a217db9763cc475eb289c0b00d65326832879d3c2d36b2a26c2060fe05cdc2eea351eb5683bf04cd2d350a8c6f20dc40138e0bc25465a7376503cf5225d7e76d9f390b139403105eb2185ce1d5d36969de4ddb58aa4385dbc6adcf8b179dd54abc3018cf17cdc3cdda25c95ac9c1154523d61a422516593bf51753611c6f1a31d391b50450f7a6ed1bc392f941b8926af6c82b4f88baf83047c758eed15de6bbfe346ddd83bcffa7f7b21daea1e971ec61bfba7b4f528f9ab20d77510529ec6906dde11ba00c1123595666185ac4ea6acfe7ba436ba2da1935fedcb46da3647dd65254071550b659d65511099cf59868089a86be482aae5ae3e21f67f6d07ff7680549fb5fe23db9e152b04c9bfd17c4b16497a45891153591bea6bc6f5dc9dcce5c88220e33beaf43f2a00014d3b02a6ec53b13d053ff3f03efdfe264321a76c4e17cb409a11a0e3915aa84868c775e71e9d0e5b2c942a853236cbc181d7246de9a142aaae043dddc12bab44fccc1842ea1783e5c092f5a4f5414d2627fa5b089b9a95ba334eb75cde1b74a093f876e5379ec7282742dce61fb61cdbfbae37385ea7a10e6a90dfc3b3efac2df0008dde6f1c07a45fd1229fb71da096c5f5accc9613b249cbb7a5a52c6996efaa3eca54175c480b722ee542d07c177582543f636f08db89ae799cc294eff46171b320fd62f9741246512ad93506aab3405c650f4d2a38d52bedf1ff328bf91c84796e33572ce5f65114acc3bb11208cc0e025bf0dd3acb31e6fdf9fe26af66f918adfe9241584976f66656e638a633a8b10352dd6c291e4ad98b596abaca988669998cd69259c0b07ae79b2cb9f840f9324d0457c52ab938975dbdcdfcffdba2ca087f667bfd9ae6ee47fce86b256f92f1892c343d841891a27cf1a0350ada3aa238f60c28a41a7806d5c794a350c3f920fd6bb50ac82ed36979bd333ea27cb9a0833e3dd1810e9f9a5bc9c6e0bfd909bf6074a4fa0dbae97b36e9a2e79d1c69620260431979b2d58719c60859aa31d32ded63926b066251f28abcc5a6b5ad821aab4bcca5a7d37f56ceb7dd1703b90b08e2f4fc48e798ed2c065f2a69a74983ac30256cec92159051f6baa919e5e3aed29e5e0a7846a6f29ac62b107e2f81f2f53fc61eff5c8779f1dbde1bb6d4152f5261058b932859edfb981557103d5c1a29c850f86e425b491453991f755f8e74e559eaa3713bfbf49698a2d71d5ef2e9a756d38ab5ca9e946218577812a0a15c0b2f726b1c979aefa405aa250edfff223526d016d48de7087aa09cebb5df1cf5a87d6e88800d279c0024e1b854581ce9df5f2c4e75969240d4923c6c75bcb9980d5fcc0d39e07abf96962265f1ba5e9447ad49dc1436210de7ce1020000000000000000000000000a6c119e069786e3b477f148983db65cd3c7e8abe5971eecb160bca21bf36920b06d03bfcb2a7b77bf909fdf2b7a76d12fd872758f7305cf9d4b19fdfd92cc8ddac3096e50785a43d212e17e3d628a3fe90ee52a521eeac8919232ff56806db400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000bbbbb71dfd89277223649cebed5daea9963b149c16eababc7a12c08332827efdd54ecd4fd00041151da2b41f119191bf90f5b85278882628a682325528d2376cdd0b11c2a9791b61983019fe21d1ec600f8e43cde8bb5469a98e96134d92ecbea4860c0aaae9b3567e27055e0cb3a76d9a935d086f0b8a2d44fb4a69326a383dd48df51c68d7ce41de9482ad7ad80349fb0ecf10e15095e22cc641cd82ee2bdc9695966cf8994aaa873d5ed41ff519cf0283da447ae2f0a85ff3a20e45e86078a9cdeaf21fa4f70006f718ee16e68b6e2ebb0e5ccab7363a4110d8749596370623352d40f284842896c1ad59d269d00538c73e7321f2970de6934fcc56f6e0a200802af977fd0866efe97fba47977ba688437918e95deadb2663091e59a449fd31524ddb5444efb14d1d5bcd74dac381563eea473c83cd4507c58848e372cf4d8582f5a2a3b2f7836c8be2d5539d5a6b2561acc8cf30b88f30ce8e5de02accd2b7f7f9b21a0598d8c06f05316a5717dc3c3a0a623e0764ae2ac8ad6f1bd466184836c7a9651c2697c986da2030bfc4e76c917cc9660a8bbc2b30000aa02e2b66e3bd20efc4578df51d6b0df760e3a4dd19645edbdcf5e6accd9947d4f91115fb844adb30fca21ce9bfcdae1fd0d98e01a700ab8bff1b58e0aaab77dedccca95a89976dbfb88426bf38459c772789810002dcd3ee261b2ecd17672723166ba2119e3e5c2595dbd2fa49a8f5bc278cccd20e9b5e2bdfc35fc9179b09c549ce03189bef0939d8eda18288460eb18123362eddcb90411afed9541ed5c347b65e2887545b893407dbe14fbdfa71ade8abcd9746aa2f250a8e2a29c1479510150dd97b1f422826c362df0ce1f3847871fbe90afb480eef635fbd3bed14649324993eb37799cdf8acdbb64cf35ec4370df7fe0a317af026b31f0ec58fd169b403a8090d65d31052c90083e1d15e7dacc4f8555a0059b2ebaa668dc7243cf6aaf704c1197e0881b4faff5a5751ce7006bbeb26b4611dfb0976bb8ebaa9159ee2bf1c9320ee22d3e096f6fa59671e12147bbbd1a97bc8c4eae5077aa5e5460a18b863a2ea4dbf054bc7ec7e0ce90a6f3f4304dd27fbb8b1373572664eb774224202c813e2cdea9a811622f5bbe05488950b806b8205831700e8b1f56a629540e82369a7e058186b3dec4c8dd19a774a01ec8788f9b120128bd53db6aeb31fc681d50a9b30b065a7ecc70dd98ecd6663fa785a539657ee5ef792e357e6b50bcf0502b7cc89752d6d5eabaf6da6c8a3fa15b67bc118290afab62aa27abb936eb6d17a759ad99ef2c8c167078f20cd96ad345c83305aaae25745c00982847873273742751b28e1d938ad9e0c7e47217f2a82c7be3a371e172416c1a99a52df63418e08738ed28784bedece67b36c08892aeedc0bd2110a1e07175d4bfbf9289479a460ac38967534d791a03b00761487a5b8fde2956352231f35bf895fdf259e0913db579d81ef836cc387ced2c04a964fcf1dfd8b5e8993ded63df9716df6490914a76e73fb89f08a5f51caf5aa25e2fe7a6936b6571d9304438df48945264ffb4be974cfbeeecf721a36adc5a9577e201eeddec28fd97cfec306304f0688d923029001a7da70fea0bac8502d8afe5c88b78dbec571e215d5122e769e3457b5f05726825db3dbbd33de0a048882a0e833e6c388d9b74f7cc6948901f5a85e17edb4a8980521d7b435350faa2ba5df7d91741fff37218801834c40e303e08659dce9dedbec3272c1334e09f798b04e3d9b4486e0346de619cd891b5847a5db2c9d37f6746bf98afa883d03bfa7e670d33ffc61a105df0876e67c1f922c429313a9cfce8cfeb7edbd44af47da4722c95970c246138990592c3ddeaf06e19e70be51d1ba09046c881dad5c5671ec27eb0c6b437ed59b1ed5c006af578cdbb7bb63ec49760cd48979cafbcd68c14e7ea03e24b5f9b7ccfcdf78dff652c2e43ca06b713c288ed97fb2b59000867b99edbc8968fe552ee7bfa6d30fc48fa18db5729720fe56b31d1a448780d41aecfc8e455f0aaa5c70cf7f05947438cf9f19410a2e516240116b254db1091b1909d4683d670cb663ce024d72bfb60c485d6e822f18ecf68338805e4014c045dbdecccb2b70c1134d89e3e47d181f75a5729b208e3f4c9572e7ca327f686965a28c9a1d9837e691dc2e6418c40875cf23ccabfb62870fd70e52d2e2b531924ad37faafd5f81fb608b722e2614e1421ad42f991fcef5e69a223b3a24e42758b06be7c738a0ef9805cb964aee640e00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "ac52ac", 2, -169364821, 1991772603, "a1cab14efdb22c2ba96dd4b5d271906fcdde00d188af3eb98e9c4d013b844d1d"],
+	["70dbcc2201e4603e57d8cc947586eea874fb1518daf955f8804c8c12d1a8d143a0854d286c0100000003656a6a765836c20410c54002000000000251632e26d6040000000008ac00630000656365d64a4904000000000963ac65ac6351ac635118ad3e0100000000076a5265ac53526a0000000000", "acac63ac65", 0, -1624764651, 733220448, "5aa19eda30824f7e736d340be8de91435576e206474b1ef054b398081d84cb55"],
+	["95a9184701066bd4235a88cdb0276d704643dee98a13bbfc4df078516c6952969de4fdb911020000000363656a1de6aceb021d1c6204000000000765ac0053ac63650c7235040000000006515165ac52000000000000", "6553ac65acac520052", 0, 1469338349, 4122551051, "9594dd4c291f4920c4a66b0d7cc08a56caad36fbb0911f3c585580615fcb2685"],
+	["030000807082c403041f870a175dc604c94061723113677c823f771b97522c2fd2a00e51fa27743983030000000753516a536563acfffffffff0f620b469d8a00838f459ae5217fcf6ca33ed8304498934f23ecb905e9d2ebc03000000020000ffffffff6f7c8e6c2f77b8433ac58916156c0d1d1386d2a8023febd40afa4b712369a571000000000151ffffffff9ecd809d28809b000c3597d462aee96ee61acb7c4baca81b2041f1194fad05ec01000000096a0065526a65515300138c100c0201aaee03000000000300ac52cede740100000000086300ac51515152ac00000000c2fc0f1900", "", 2, 1712710493, 733220448, "2622c46ad91c03d025f4931617e81c4c666a44473de436b5eb7bf2ffb0fe74ae"],
+	["7cdc197f0384034f1221d99c7d4844dc1a445b1b09e95455e9fa69852b8763723254458f0302000000066a005300ac52ffffffff52997a4161d5ab83f98b32f9a0a95757f49cca94ff87f1a535d47077e5d673180000000000ffffffffe30ad888f7b149e5f4337e77bdf0a59b8e41af46ac14d3d413c23693a05bf1d403000000056563515353ffffffff02e7689f0300000000056aac53516ac864a5050000000001ac0000000000", "6353005351", 1, -760776894, 3925833126, "6b0de7c39a1f9253f9bbda0abf9f772aabd66e06fcf152bfbdc9b42c99d1f343"],
+	["0400008085202f8903450812ce5c17282da35e451f79374313278888b02ac969ebf02df45f278f9ab00000000003650000ffffffff5e9b7d759fdc6747ca354172cb71ca694739d447a936cc53896943721ae54b1c0000000008ac516aac535263acffffffff5ba7a71bfa1489be63dd563f536a49a49fa94e203c4dea9d1d99c659c473bcac0200000000ffffffff0153c6d60100000000015100000000268b6d02e56dbc0000000000031c32009b9067982c920f125595e14a9570497215abb7995c1ba4b8da1f34e20afa18a5d9b43430a4db2b020a9f0c1ab38f545c6217b914604828922c8ba3cd27db03392fe9a046b20651a8012816ba1965b8c68130544d4ed29e55800df4cc1815a3388bae03c53b1a4e282f4851a56e58507f86bf0535d39d888fe6bcea0a2dd45e9db80b2d70d889e39ae1df02b64648d95f95450060b6db56f71fca8981119cfd495b5e0aed341e74b837b99d5c9f96b30f075219ffe5b34fc185c7e1ea3e3fa6632ff538df8b0500a5a1d24a884117d3ff55777b4e9a66f5bb5819c375ca0a0fa487c581b3f69103198e876bc654f22ebae81d5bf6bed98259e319e584640fa7ff0741b93646152e151b55bc8165ab9224f753757130a54ce19613b504d3cf0d0580c485bd06990806fca136c2d96423bfa8cbd5266975be1f512dad5c1858b06be7c738a0ef9805cb964aee640e0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009c98f601d69387dfb861e754a388086f8843e1ebdaedab20cd082a3e08c329afe0796dd69d9f2ca4ce3ae4ce214d4455e06bbd4e3684b3c8574b9f421518d96a393532f378b116785f1396c842101800422eaed1ace6bcd61f4b37e676a9d2ab15c7990731fa2911b354a9464b2180104de4c5ec586b7f38bf7797ae3b79a1141884f6eff2afe4ab96728281c0fdad604d30b9e676e3edc6f3ea0312a2abd0df2cef634c5f6c35ea5d16227c5637148756586839847ffe9f66999e5b44a6dd42b1af0e1da61af7c81cb12cab597468f1632010827f65b1c574c65f1d71c154c76c7722c59340be6e51d7ba1e945c25cdb9ed8d451dd28a088587eb889ad0bb4d97c1a155fbff9ecc63c913a08b0bc3c5cfabaceb0b61bb331a226e6c73f5c874fa0000867c52b57970cff046fdf55955cf74dbbbb542f1f082143c08b4d710b258b06be7c738a0ef9805cb964aee640e000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000087d53b2d3da8a4a1e9867cafc766e5aca03db4308212406db326082f11bb3e1982e390691713f42b51784ff2fe7010a40224e7c9275e3f5ae266ba1c0a05c3f1ca61b0699d5f3d54c0e27dd3e9807208655ff52939de3bd0b3e1935101f43c7e4f00910f70055be793ec5212884ae993438d1b3329e515de6a912c7bd0f8ad65cfb7806af87f9e8145161ab0325c79f88e8d461b81ee3b30903ec82b4ff2f3bf7905e9d6aefa2999d4d19512f1687f75ef2216a7fe4ae93b471036021c70398d5ad71782882061faaa3b5f7c85287f547a8deb33a5069cde2c18161b88c23f5b4afb31884e582141ed3d7307877efe4653a173379208968750298fe00dcbeb39b618b5b37dcb377f5ffe4f81fd0a1e2e0f84a05da044f8d80ed772c9dafd3b3ea92aba660a6c6703cf9590f97a741a20e3af22ac26dc1b1380e8e9fc96d08e258b06be7c738a0ef9805cb964aee640e000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000023330537fb8fbfea89bdff2670b0a30d6cd888414dd8e6b5f4a74e82fa2c48f1765854ff38d1e61ba445bd908c74f8980dfcd2cb4c2873202e24180d0aec46c5b9632d0fa72bacab463e71917e859257c5b6dc6d74d93efc7ad2b1ab9225fdea0b406f088ceb42f0c73cd4a7ccc32b065c4f918798a0f3fc99f790339c2b857a55ec0772e98570fbd9c4684167313986f80c0c3f23877275278d06be33bd4bd2f4962bfd16b784e2d754a99de713c3a45c0fe280819d6d35266bc9f6ceb13fa98542cca6150db0fbd4706d5c182e4ef59a3a3af88208dea5238200f142bf7a533fccb17a02c0b10bfc461cb22fdd28e7ae9f3f91293f17969c33e9b392d17ee3dce4620e442e2a1847493ac92e4220b05be0908923233eaf1caa5ec49757e1f58e2aa727bed369b3f43d91313c3c06deda2fe84d6141aa7c103a9e57eb8fb60e0e4465b9d42a72584f4dae7137ac9a02487f5e8d9bd5466aaf7c5b3cbfbb060f5d5e5178b8e7618e400d32442214dfeab441035789ea63c8612920130c299a9401482734d24af2e171a6a6af6888e5f16d1c4e2c8d0c6c44bee69afc503bd7bb18da883655a77f7923dee8ebe161df4a70e06fa77259840ba60a800ef903d63658f3ee19276ed88b27f1c459509d44016ee78e17b7bd598c165a6fcd0d717248ce6f8311aa37cae3fb06b08b879d9aa3f1e0b656bdd970fa63989b9efd7e991ea3e5fff8eae8f49c6a46305c62aa92bbd742866213df75307f5c07cb775fda66419a86c07bef9f267263f72bdd97d68a9068968e76074624cd2a9cb2d5f8bd56e846e39b43ef70dfdf210f008164eac204b0fd3ec7253f7b322655df6752041a766c3c94335b0610217939fe8bb195f8232f0236cd0355b124280922dfc2a8067e3e76675da3ecc398527ba64caec1d081f0ef4184ad827d68a913ca3fdefe40b0e84eff7412426c70489fa5092011ae56e49d78ca89eb324575b57a2900163e0c9821ae0c05e78a23ec459c67589f2c51f040559b533d05854ef40cff4c64d12b569daa29de326a1f42bdde78108f3e07f9cb750725c8b0df436e5e03f8ae78ade2f194168ddf15355d9b5d68a5faae48b5d6d5e82c4d6980aef4255185a9ff6bc6385ff3b4c2adaaa2390987f2e951d937b7276cba8dceb6009b86f87152e489c93a55e16fe0a436f9cf959a807d4bd8c7edfe28d318cd566c8d3d21025af6906a8a7ccfc7eb094d80f64938b2308a9277dad62512bff50895b2ac2919929367a73b916a205959a2cc6883cdfa7aa8ce6b6317a1b361d9de45b5739fbaf5651ad64e51c7a7b6aee26a54cf0410b4efbbf6ac99a73667257fee9c045927895417cf6af5c448d610822f01cbaf78b75f5c0d18458c2bc7faae44e46dc89d644f8d565fb1455cfc610d36276470112d1eea6cae728511137b4763e464db4e4efce574cc95a146b27fd55e010b77e4ccb01ee16baae61481bf18f94a05225771b39b91a94e47f552eef66aff635ca54dd926843408819cdd4fa72c44967a6b86af9ea7fbcc81c820816075ac16989281b91bbbf9a13202c17043030fe92b9c6c07924cf131b3056ddcaaaa9db78824bc68e739c47adfe414bd704050a60bbb74626a7e5eb52179ec0ea0e353480ff8c23c975bd0d9d7056e0127465e9e86f7f42b87832239280527d0319794d62df153bdbbf51d6567aab06949be5624f80ad66c9f157eb8362934db955c973a4662e6345148cba9b59af5e011dc89b48c971d389844b862d5f58817db856564c676a9e5cff08dd6ec7cd01a28802406aaa05b3bceba7775d015ba75ce39c226c2f1dd33ecb5f2fc3b65bc2508a1da85a129a101300e03ebc927b6d9bd2d2da4c25e62cfb0c836c020886f4ddad8105a79131f8ef0eb24b5017f758e2466a95ea5ef4fc993a392ee3f03d53ba9f726e3d8b263b4e874f684739561edab00da460a5c63f397ab0679ac2e9d7cfed054472952425555709948f12054376f126c28d0cd51733af2cbdb48c5276932c64977fb04aa33907e3151c1ef711d4f9c20a18f50df7feb2aa22cc181a775ba5898309a36d081fc6c218ed00bba3b52d75e4405f98e48d8bec1a424b0a42ced9348e88efe3060b73a883bf4e051fe188cb3cab6995f9e590ffef6355ee810884fb839a0966b8cd742a8dba49634e07279f7a4458866e9271f816b609b8af172527a0f08997c41506baca1e2d62e4a2f56b259ea6f6b14ee3de41b66938ed5463f72a0f36460cf68b694b35e1fa6df1a8282982b084e2d2c3293dbc4c6a24e461551701332f669004e806010f8611773b09e553ec1b95e0d8de2da7fed6f7bf2b1a4330d637604d51bad5c3da127c46b52ea6aaa764fdac0db2c3e86e11c24cd180bd29a90bbd2ec33708d422e0a635b4c8c959ee0c4e8ee8a49e372d2f0e97ff595e9169f541215143453c0360c9d31d8a0afd5583d9685379fb7d8d7679ea4d49a0c0cc3503ae7a2ff63a90b31352a01c08db0df1ab33e8222af940c63d21de279710139241f7446e11534050d43d6b4bce2c0d6ff4074c42c84f6dbd256c2836ca22340ca1c3bb0eecb375743398418542bd33f3715dfb6bd96218bc07ac39d7cb28925e33e5df696322a844cda73215a98fa5e274d12ddc2efb19b52900e44c89d34aa79a417320be5a75354c880000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "65ac655163536a00", 0, 609010502, 4122551051, "27118b78e2532e95d7338f7119f86278567ed429d12d08cb2d2032fc117bb53f"],
+	["bda9ee1a014bc8447aec0d786e50c3e50928e8735238c0953c166709c809dfbcd1e4ff58a002000000056365656352c8494e24038fd21204000000000352ac6a8f3ec80400000000026a6562cfa10000000000076a53515151ac510000000000", "6353636a6352", 0, 320708490, 733220448, "8066eeb4d8d587d4de642a2d6ecda7fe5bc533f24ae6fdb8be892bcfddf95a7f"],
+	["0400008085202f890365e913ecb4aa1a1374689c9f2ed91d6373d3a5e7ee83a2456b7d7b2365b3f0970200000008656300acac515200ffffffffa7708b7ef37d49d8867d9800b151c59b1643bf2fe0a9cb7574e4d4d441fcf83b000000000351acac1d20254e172647c31cf797da725e37fa8b3515bc5746e59951541ce2bf485f308ec6c2990200000007acac635165ac52ffffffff017eb10f030000000001520000000000000000f78494020000000004a4bf1c16ec18debb5dace517107c08c35803b05b69cb2bb1e99d3b91b99df309128468d0d96631e74a3dbacdf4b9f82b1c90731805f69fb0359a6cc497595620b9fd0c868e88063958967a74664751b6afd9374609afb414cc22ea721570a7e5f7ff6c6b82657296a3ca8cb5481801e20646285aadf3b294b8447fb4179e63e82d88b8c738e29189b7b8b67cee0e5a6ad0b27b1e6571da3639ef2b586492a45e1378fc1ad3a35aaf02dbffb117a97dfb194cc92fa2f80d95c11c462a10dad4526c6ee3579cbc5ff229832d18070c5fb64970ad44a46889aa086adf129949911c919aab78a86d4761dc5caf6b9c5b9d3fa5432d7c2635ee33d5014d9eea9740ce9e3e777f29126c86595b537f44116ae7f9e47d1dc19635c4ec9c92f683828c62029984233f858082c7a30e33f017fa1ee84835115c6eb66062f8beabd3f3db4c16298c06f52adbb03ac9d82e4a95f60a000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000e2c8ff490398cd0747d5f02cb7b01febefb752795e5785e63a6fdb8aae91ea9c17d04105f1cee66984274c9abf165c96a5c6919546bb96ad7ddc3634ce11e671b19a628815552e7bfbc6beff602ee69409ab65fd6675934d5f0751dcc6b37021bca31dad7a1cd35514df04083f01882e0637df734548df3d3265a43484a716ef92aee9f04b6108a1ef31a49c095f1ddf6a86005ae2b920ca3996e9761609aa8d78d5fb87169cd31b9f337bc137807ddba67d6517d2835769d4a755f466cf1adc12b2107f038464633c12fbf49afdc42fda581798ec2076ad044ccbb496bd9f70004594071c6f07ae995cff9622735b3a63428d6f4d275ea392a1a88dddca5e31972cb75d8f82461f87338d9cd897471964e534adee3baaddcd508c8d490463c40f3dad2ed01e4dd5afca9aa767e3fd61fbdecc8297e216be0f03a704597254ef16298c06f52adbb03ac9d82e4a95f60a000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000c9ab047ee8625f62184a0ab3d76d0975c3c87a7e958e804b4903fae7e66e7918b2d2626b7de1f8aed51bb70ceee87698a9689318b40bea0942a41d43c31aca71cbfa16d0ea2bdec4302c4ac5c891a63f2903bd38a165638d41e4f888ee542951e5d7223e5ec173c7957696929f6a2e1653d9ac59ab3d26aee6829b1e81a3972c586ed881a49f65053785ede2803c0562a02d50835c7103ef6971ea4c9145de7fa0592a8862eb1d92cd4ed221fac2712a725a57aba683dd3a05ebe9f1444863d8da842a352ddab64606bdbe003da2fdd5eeca990c8df043f24d5776a6c9d23d0bb46b3781bd51e02518471d58eee9b8c59e924108cec3ea7c2b9ac342e5a28dd28a28d16eba7c0464341a8b352b3c7e101426ea28a5522f26ddb5ebfc0c0a4a992d015d60e2d3c3453b0756619ffa3ced4903d67bcb46ecabaab7aa9be2c1ed0b16298c06f52adbb03ac9d82e4a95f60a000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000486bbb560062fa3e2a1be701e783839ce89d13c3c040fd2334f8718407f9c0c306fda090f8d4a75e13c20dad2ecadaefc794283c521ff289dbb884d623439f5aaf241e51ff888e0c7a79aaff270b314517dd4a493d294083ba3760b9921216b0b1f48636793f7e5a13dd94a5e98708e54f9fea68f322b26cb305eb1fc9e91b9cbced11757fd5b03765fdf50e729c18fbc38a4906aa8e377cd4a7ebc5eb1025cf39a3976b0f9e3f292e00f27b7259845607ab0e13f6a3c6ba61d98e9287c4aa2b72c5f5eb4d3c93ef8716b8d1edd9691bb3cbaa5b329ee9966f23d1caaeb95a36ac3339cd27b834b6dbb6a9c7c647cf39baea19a1e4c687394b680df56b92aa7aec959e819c39edff0f227c2e4a596900cab493cb6cd48f54a5ded573c5dab745274baf67a6d0ab466070b63951ea6eb4ce78702baa6c551d6ee98f3284ceaef616298c06f52adbb03ac9d82e4a95f60a00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004cc0261a1639475225c9477136af1090cbdeb027074f4357a1f3074333c01fb3f0d085b02c70b78d1ef537efb3bd791e0ad2eecb2d48646055f0d00b1b2173a038088b5865fe9d5f43be4ff79369d4fdf03c746f554ef4a6d7edfa42338498237de6923a9609400d36c1c0d1aeacf276c6a4d49327149bba74a9dcc3b5195ebdcd23062fe990c3c72cee3a593e8d02dfffaf491dd00c62c8c4d05a85aa51db6a122891455e75304f516a78b782fe3ca264041cdba4395abe7666c1c4e0b6f313f0f16ead62fede78d23fa30d73f73ccbdcb9761e701d50d9b60938dd9ee1ac80e6b04afd9cfca930198007163c3647c0d90c05320602c268826029f48dbaf2d48a47a542fd131a877b29b1a3333736e26ac229b29f825cae5cc9751985d0d5713e9688915b73d33d8754cc294ea149f8516135534da9624495d7aa645cd069c3e7e27c0d9ca3a61aa6fdaa3d5bc2e0b7d3776f3f7bee5f4941076ff371d7f168201c298fa6dc1dbd5034e7bb15e23e585f90a8122311d1b04b782e22ed13e4cdc3dd8d1e54912dc68648efbb85f467cc571a4c6382786b05a9a9666d8d760149a75380de235f819acc52cc781bea96a1e3bf0f67bfd3fe4f5ac990538ec599c368cfbe1d870923ed923b072c482a2535e810a83b59bec4a32ded04120d7338e92bddbc986dc46ab4edd6b354b3ad59ce9f6899cd2dc3e191365ca13fa0ec098b2dba2fe51d090b84ff9c7d358a8207efd45e369dd518d380e7c10a5fdca2f5ea80811b6e6d2bacb161bef8a0d243d89081bb1cebc9a8732fefc36a3bef609fc0b63c8a862bcbaa9d30fdd23f35c128fd06c4c3181c62ceb5a60b38222adb645d9e789c18bf1fb3ab3e313116ef5ba4091e5374746580fa5af48d62cd587a003957a53f339a15088079e938909084ee49eab4ffcb0a63e7ef45e7fef3003f3e301f9b65dd028fc96c0382f4e829780a7ced3ca37ac3c8816e3170ad3b516ea36efec4b1cd67ff72cae8e1bf0b7588ca49438f2efc64398742ff1338f13174b5d25e16c7c92f98db5dddea4fcdca836bf9ec4e218c31e7a5fd963b647baf40a2f94dc6d3e4fa81c004a0d0ab649f05b70594aa26348b7c4ddb0c1e383b8757b57b7169d5e87ff4935fb5548a3d502afe9fdce8319f90f92af52717817cd3e6089b6ae6502d845dc51ab557b662f77b636b07ade1b55ae9b58d0a9d3887a670de3159009d8c0ffed85d1dc164ccb54ea03652f248e63bc23c1a42aa25dd70c00249ced28ccaee4f8c58606f0c02e2a0f136f8f7a3b1d7c693d0264fa11bf25a155f9737a03f2dbfb928c39095ab49bb498a13f7c72bbabdb39fe53fe89d59f4ba40af896f41c9f972887ccbbe27b117b93cdff61e45e12e93087262766316b0d0b4cd29c241feb250d5b5c98d16769fd1c1dc2d5f314f7e756963cd75705446d3f5f5de16727583da9aa17287f8e9592efbc5a959f889440ea946e935fff3679cf738f76fe7244ec56cd6b44a8a8d23dbd0d689d98fcd82311b049f4b905726c397a01a55b709db29fa49b5b9b364771f26d5466bf4b62384c64d12e55533c6cb606a6dceb0b95b25dd1baa71206055540687fe8ae85459ea266bb171f0be806e55b3efa4cecb914ab50ba008c4fd23adae6c87541adc1aa9773501593495830f54c66ce0391b3f357078040fbb91ba25d1a60719cdee60962576bcb9641462a40208bce2822620eba844e9bdde597695694af7f2f4528918fded76abcab1d380267259c2a8dc29277e235df68d4f56abec63524737c3ab605c385e636e020d39a9493be60d2215d2aa3e8e2b544e2f72dadecb593ada21110f6c3f127317d1af549e790307447892edf20f21f9783391c887877a0b96c26f74454ffc30095587b660673447a6538cf64480fe9a7dd1264aabf7b80bb6bc2402fa777f37d1f14e596ce2cf4c431c9f603ef179b3328cb33b31410bcf3c195c65826a33781f604d05ff2698079dbc2cde71486082b53c64e8aea8d3f3c4740a892bf1f9c17c2ddc71d42220c48352dade08f448e39cae7b7e25559ffdef17bdca3a70f78e6d2e42db1fd74a63f1d5eef70ce090531fbf4f9cdac89bddd47e204bd52c99fb56e89f29c1f806031274f1b9fce1ec6bb6bcb506126c5d56a2eb8ac9c22dae47ecf158740316e0ba0d92eda6f604ccb8ad85fccf179677ccf84a5cd6d43bc9a4a9d68cbae686a0188da3067a486d39c51ffc8eaf77ec1219f704eb2626dc876403d94056d6b39ad8161b2641d184f633fe0d3530928c057a1e27f653a2e0a1760cd6280420cfa9406543af48df8e294a566640ee1543aaf4e1ee42fdf09f5f79e39f6437ea6d505d43bc4769a19bd0e36f5abf4ae855e8f6e3f66644c4aa4af8d49602b2833521ab49d3eb907358de05997a8b2a632a07729acad272c5d7a7dba49ec6a81e060ccac650746ede703331ee4f302c1637434394b3a21f7bf956b7c82e35a304647bc5aded861caed76d85a6a1add37e924d4154955d538cd2f50f2a100dcb851f04c5ff92d58bfff33806cddd0287ab5da2f9760082d0eaaf0bd390bdbb454563ed1447d46c8f351962ea5696bbcf59a0512c25cc97e5667ecae32dfd4d69348e2ef9766f196ef820ffc130a891cb2631e696fbf4c36c7bf4d3bbaba0d0e8d898c852e71b1bfb675a0c30742e2484387bc421592ef202f5f057b20fec06351b394ba81b43e943cf38377404cbfa2d45be8685a2fe377b6701a964cb965959cee74fabb3a60380f0f5e5c62749d7c99c930b1b587a8b189566d7fbad855687e9f70a9a4a4184bee6239d4d66dd9a888fd457d267f3996ac4ab89dea4fd85a14034860a4581b3f7febb32007d0054cf3a4f459752d83f93208d47382463edfad0fc0e0d80b9e8aa95143d231aaa9517128dee94abdb62883a9c073c286337f360e0d6e1cd303551e180b24704890bbf85e03aa0b52a80d0a1d64bacc5d1f8b42848c8ae39009e52ed14ce27890d73790c1073cb9d615122362a0eb156e45e3e4ed619f1b50ed414f0f2da44bf8d0a46a34ec23f964672d84f06de137c058db7759198adb8989effe37d9a436e101823beabf7ee683940037142c7e54fe33601431afdb5f71c5f9936399ab27fc2bd17df6165e9ad24c4dca1f3aab77c05d7665c108d9cbb75218d7d62381b4f01af334a6d74f56e1782e48e0578607084ef745596f28595ceb158e00616f05bcc467de6847adfc1ded700872baf9f32dcc194c2ea6e8c71959cdb2b3e95330bc074b046796fdec85d94f93ba06588f2fe3c425edca3c21b3b86b703caca55570ac663f4927b9ec5281beb88554d65dcf392f6cae8e91742de01a131ac222842c9f30d8fc605a0bfdcb3c7e12e7db256fbfd6ba11218041359fa95b0eaf48477679a53f433b00c4096293d960215c543bbc633cefef8d88ff11c694667d9438a4a1bac3ed0d23ad1b4451187d8120f18fbf1757b4e2b35d4f656a435ea9d605c9037521b8a4cf11cacf4431f642066d23aeb9706fdd473798344c416369f025a2b0b39e643b4e9f8e8eb3c013af3deef94d0467bd88cec26f53830cc08807c798edb6baafc4c8c67a99488aa2d8e2df14f142c89c13589828ff1ceb3e0228fb11351f1c5a16155a9fc1c5d47e2568f6cdd081c18fb5c0a0dd1ab1971fb6b59a669f892943af007b7fc50a82962594b3c1a3598e35b76c7f5a19f16d94bea5a2c6975d7cce480a42854a62b2ce3f1171539633f693d9f5f037d97fdd837706389b8ca7a73a1b87d8572f8edcfb8cdf676e8ee9fa39cd2a7672c970c323f308ce8e66307fcb4e80c45dec5dafb916149f0bfebe353ba12563fcedbc03d9bd2ef711866342f7bd45412c31c38e7061e2c59072c8003b1fcf8630a2f2360712c123e0b6ff5e8d1bcece969140599407671255d0ceb363645604b46779686cd0ab80e3ae0c29facfdd00d811bab899ba9b469f3bdb31b5178c09942d1a8267850c7dae7bb55734791a00a96ec3ab4f354fac9b019812adbae9dabd59afea2a92ef7a7ecf8f8963c4f491690b50f6a9ddfd4a32dddc63b22b8683861a1bb6b104ac62444c25e03008e7e0abef5148fd27965e3cdb3cf914938a9a2ad18618882a6c0add754684b8123ec70a0a194d6c07652db011dd6439ee96380ac5c62455c144631b1472e5b93f5cb21e7994896a705632b3a8653965251a50da86d0715010ad12859819a08c0fd67c091393fe383ee579c5cce9e288b2a983decfd3c21046a2b43b4eff84d8a61dea60aebab4a07082f11276fc8f4a7101750109e0513a755d7170d6f30eb2a84db46c8c1d67c5241ad4bd54b73d6442ff3df7ed18d1093c0d36dc41aceea212487f80970c993dbebbef25e92e05365e8974f552d22a03e556ea01b4335c175f18395f780974ee58356dd34a4088665c1c5492e8b40ce41a7c3f1c8f9866304f64d9331fd6d067036b1855a224817d5ff768eb4291f53adf18d13f73bec7acae3171a1dcffda6efa67a3b1c2b2f84eb9480c15d7651dd9ebf08b6355e59f4bb44841f801e5fa32b4bf74217d1b9467b5ebe45d01ddd881735ea524f990f716d745a9a12cff05cae3de3dcfddf23c4063917b0151ec429c83baf44e9eae6281dc868fe0e1fc8cfb435d2a1013a80b5ddb078136a971e068951fc962b8e4f7e09ae6291c1a0a914710116f777b35af0cf5b7d9622d9d2de6d4c649613e5cbf276bffe6cf7af24207132bae23d6d88567255841516a1abcd2a15ad2c38f2fa8f5acc363ee2844f51519e797b93372bb24738fc5155c7c757e563283cc47fb39a759e4173873674034f51e88ae34efaf02329d75201a8910b37af2562d4ea18466ea76aed4e99365d58e56bf0e72606ae8b0a1373fa271985a79e3e9744f407793c302716daa68e31747fe9b03be713242dd3cd8ee6f4564794e24ab31318ddd635663c4efad8920d7a65f391507bcc54c1ee5904d09220de8cc891258e3828fd6098108f967e188a61bf343ec757ecde4b4f4c5f6586b84f32650eab2cb6787e6aec2a6a064466251fefebd043ea10e34852267a0a5f1eb4e1d6e9a741dad1963077d6fd7fba3d481e24b659c5d9429f2b6a15bdbe58fc431fa2d32cab18bdc7664ad9979f7d67ee5b2424cdebcd76c230c7deeaec0d132c4db27b3a5684d5ab1844ac1e687181511fd577282d95142136d13d11100b2fe3b55b0175866e367abed179a8a99ff6eb44e78e843e76b5d6b8a7c945435df3944617042fb041072ef666ca15703e24317e29adaba2c015203b566e36603d1e57d9b3992399ed0a21e275212b4680f417c5d4a3535d0208eaf73b7fe1a6315e308ed4f0aeb42c6fe030000000000000000dd80ca0400000000aa3858659b540107fb9e6494b2ea259b2313b49e89c85d77dc8c310b485c6d4f1d628038bdcb8222a80508e2cce18db80a5d93a9973f8fe73f51938ef648d00b3bec165905734529907e46a7d06fbb6c1469494c63721823050627a6d36c3cf200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000df36e5c864bf64178915e70fa089106083101b04275ef072e3cb42ddced1862877ad4bcbc95bc99b1cb267d298e31ecd3a239e224848a6c41295f319742bd5227c0f0923c15a08db007abc4bff9bf384ef063c7622a722e19a3ad56094abaa87bdcd0431e8749d3c115f757800b4b54026786f00d13ac6f1b050222f7cc3deb4230b14834624d098c34ff79f3e4d31f40ff14e6f9c4bb7c129d64dd8a1d448b11eff1d56d07f880033efe2396a50e1c7ce54cadff22933b0216346cf4188cafd03925713b77f2ed0d6e8e21fd3ef7308bc33657bc6918252fd286916eaeb80ac4379f3a874af22d875dbda353e875aa13511fe99bbc22719f77b940fb6ebc3716b340baa62c81cc9f46bab5a051fc238886b98428e46f63aa4bb0e29097b5995720a12019843045dbb4d8fb2dba9946b06dd4b8da6b562d9a1fbfba5c90117f7b1645c5fac8e0a5dcf8e3442a82fe2916251bac24510560ef3f56aa23c9d3ba1e68bd8f779c848db72f5fd3ec472c227e8e7ddaf05122628a5e181e8f339d190132c3590df36d8e94a862eb50e342028b0d4f9b99937ef6f87eba257766da8660a92bccf1d9a3360f08714a5c313a3f4fc967b60f422a7cd03e2462ba976750a30e30b9a1c9be5e65952e6633f25e8ef7f3edf1b3189fa2bdedce15cf9980f665d83e817b9f922ea27aa9df8eb7bb8dadedce0f5cb7f12bd55b3945561cabc17209496ebfd3d9a95d4fd5e0f987ee65522229cfbe49891196e0091365c9f2d1d97b0bf43b8c0fe939018ef165a1c291afa37325816b24595a04802eedd5ee36ad60a90a1fef8951d8f2f1c5410f3cb75aa28e1331717ea41c6d8c8ea8493a4522dcfc26a371516f8331e861872b754c7fe5d17f39523ec76a2d553508217503c2cf3264ff2f37603edf8a82e906dc806247f6f8bffeaa1d7636ecde185872cf57ff63246606f57fdd9b74e80defa396dbb266fed139ed3baa037dfbc0bb04c0b339158158dc362035f607c4325b221695a88f61295654638b3b3a9c7d6f56884fcf93454e4a5e0606c0429d48d14bfa29d1a9c93b406330e5edf27fb382349849b572adba5e7a91b29f5dae87b812718974dbee54f17dd1aa79e832ec6d47df3c027677d6b2cfe3f972d757478f3c0f17338c25e900000f997f932ce9ca9eeaf3ffdef145dd1939ba15a7d12b363b4c482c64fce9cb95f2cbc0d1f96960426c0c34b9fb9560b132aeb26d922c12f591cbbec39ef54c0f6f85abc2db4be1cd807ea92ac16f7b707d6ec304ae708153bca871559d5392e840c28610e12698371eeaec25a27cf5fa87fe33fb983c977e83d972361317e4b83156bdbc03cc41a4937ff8b283627f463b9733158034fb2a89fc7d2319f65d17279309c58d7e4f43fad31210610647fd5d536e4fd19a9df9e6816b876bda45337f231bff946e7d6be4718e0186f1446058ae937e1200fdcc54fc441d3a620d869702153950bc8db4d4ae1e20be30165ba4eda062fbccda3d3d945f8e0c8e792084a359e783a16c4bff6bac647a6ba4df555358263b4ea072bf3c4139e487b677aa3ddc27eb3a655200a9acd85b738e1cc08eb3c0ae9e96563770ad1c718a0d3ce7083516e558904d23caf048ae21a3fe0afb135dc48e2f20a310838d28033c8ddfd1acfede5c14d5d8245090a8d387bebf2ca18c439eb3b38d6ef53d1e5c0af469d3917b365b61b94bc40d502642b56f90413145b1b62088d481e8f5a56327067b02c3e71e635a842f69a6604f330ea9c982adaa9a0b27d801c90c980093ac06f6f222eac3e52ef797b16d82aff47d548b97a063d6760dcfc34db9253fceae77c7eb4b715b12caae2cdb2109a8cc00432239f618156c0b8e9c9c92a9fdffe9367d98c3d740905c40aa3754effc1d65dfc7728a0e8c83e1ca10f64ad0c0e39451c36a77ddde57e9cb64be4fe4a5cbd49ae1d6530a44d40c07cc80ce5cebf1c6b82a4dfb7882a8ac1b7b93de6182178aeadce39b5efa696e32f3056236e1275f93683afa6af32f3596dde51f513b860ab24b21a45991320c1752b1b38c83e65595458ef716f58553ffc014ecd51ca5a654940b664b5a8433f4410a1af4cbac4cfb9ee98a000c6e02e06e73643c2ac7e668bd345c896d623f087beadad000000000000000053cb640100000000ab0455021113f4b4a93ff2fb104d244758897cf5be7330c6bfd8fb1e9b6bbbf9675ceff59c857f7f3ee234d610693638de58760a2b913bd90a94e5bf470926a1f49bb9febe801d8afdee16ae7cfde02d6ffc2d48ed22759698a70745563f7fb4000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000005250b8912ec7e2f864a99c9516443f1f7a693f9e0724dae13cea1f42712637cbc25bdaceede74f7a23ff0667d9c4caffe1eee6ce04ac39ecb62a5edbdc58d8d836853001a801126fb6c9a60ac6169612729ae7673212d9745b27613220ac2ef3e8c6f2e08dfdfd5e4cb12c7da384d9ed794ef8a4785514f2a1bd23559f100b61b5cb7ce1a7e28b1e1644e1df07359361e5c2e922b2f4fff453c2ebe4628b8005204d4d4e8bd56b07d09ede383b3bf65f3b9881562c946971ad1e5fca4b96dbb8b294ca7ce39c36c25112e85833750f5ce91e4107a58b4412a1abf24006c42c778793c1b2944c797ab7f862c37ecf85cf0ab161952b6de18ce956184ab813dc3add5a357d4b1d104af17a7fa512a643779515a3d97ed5bfd3a5f6343525ccc64cfb707e1cb1f0cce63ff73b1c2992bb1ea48bc197b8a72fba048462dfe4e6f28fa5596efff86d7711cce9fa9b700430c74c139dbda795fe3aa70084a37a169e32d3c8c01b9fb8775c29075d8c09ff87ddee1c3bacabc93e929e81699b51748354053993ef455e662751303aaab3950d7432767dce2145c753ec7fd9282ce87d173cdad91f7068e478a8a65562f7acf61579608b01990f656b47c0a36b781e866e5c5507b7d3f63523cf6c7e64a9d533b96eb1abf57bad1171da1f9027ef889fe18f8151d2770645594e8982579147dabdd407ff0367bcb46192eb71142194b7f47c8218f3ae812c795c9199eb19e768eba4df13628fd795798096f0ece95c454ad509b388236e465af10fa4ee7b0d7378ca2fc34ae3263addef7bd9e9786756a858851f966e77416f1ec280dc2a1876d01127b3e140303ba6451433423f025eb74bd8483c6dba06d04671190d28ed0e129f1118f37f1e9dae38c576311d00c36ccfa6edc3449bb42a0029a4cf769a28fcd2674f05829a6a3c998bd9b1ce3ca7bb37a60fbd1b7565086992029f63344a41d69e9bc885644ac2ca3466df63c8843a258587e02473ee89f239f88c5eb9fc3d09e988c50a53c0b88b315e3e98f46cf91f6aac396b2a7e84b8dad24bb187c709f8d4c12f4cfa6388f52833a4f0a49d3feb50a49338784b837f30f7efc2fddc71afff9caad621545a7e93e1fd981a19ab745c2e455e36338230a7b830f322a5411f72962fc9b9a4f85babdb2bcc581bbdbdee991930883303bd0f34e2e1e931144f6f1f3d94e08f813f437ebd511adeb6709934af6dc79edbe596df91d98d5833706ba1a5d2822d15868500846a5d1fdf3afc09e721f5f2d40666773970b525e6b7b099f2709922d7a87f078857dea071d448e59050a7b96744d1ae91c78ddb1b1f48d0e8e665eb0124f7f0036b9d5d821c6d8f8f238673a31433fbc421c5e894982081f170ebc9c2e98c3c98b6ccf34ecd57d57ee2fd0a50d165005db29b1202f9734a5e6d3fd28918bb02c5ef23e47293b06a87680978d391ff55f260f771a3d3248c77ebd70a7d1515e854b8c4a2a3a252a09a1498b25871c8e9d3a01486cbe58c84bb278dc363e2a817b08bf151dbecbb1644fabdade86c34c64b9baaca38b696471bcb4eed1e2bcfb0597cba8173794dfecdf0a1e6b358044fd9d19eca79844b941574116e20d6485ef36a9704f54768a77adf31add95726fb59c27de9828256d8a476dffa4b573daf1246bf693a6fdb8cedadc2fc4c5865d1b98f32caee1d78018d2a3649433cd207d5177830d196a7821d4f5e699fa3e62f986b8e983cf13fc80f9eb30d8e7dd754b639f88e70d655d499ff0daf6f40cea7779b0f684e606cf294a551f790cf0f465e9aa3b026a60ee07d6736c83b928dc353310d4a9ba4f54c8a1b11dca81cbfb4f1e9fa2b43c526c31820c7c7b78a663ecf493595072a85c5d8fb4ceb7c08bc1e112e107c47181486efcebe840de674629c64c130330a7f7588276b255371b5df25d284a527e1d585a4b65d5d2660702b4d91aec60d103d4217b351e96a82ce31a7a07d2919f21b4bbba22f685e9d195d1c6a06aa034d72510503d06e50e8c0cee427aacd155e5eaa2fca77f898ba61ef178b1da0fed94cd2f3f81e9fb8f003caed93c660c4a6d952bf6db9c4c8e3e1745d0382df8886574ab2e467467f1c70776340966c19532cb9a1b76f06b106fb8b1e11d2849228a18aa92d0100000000000000000000000045656eabc004dc4e74c3c3101e7857968fe026457c23a74eb8fb15db48fb81eb1606e08cda89b6ea40830ca3f39217146cf2db3c8cc5c6b99f4c131fdd0b38ad9818bf97048382274297655e1d2464864bb8b9939eeaf27dc14c068c274efc9400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ad72ddb7ba6825ac48de06b43bf88188cecf931689ef39c630e947439dfb06704202dc993488d18c614705a35942f858f16a42900105ee3c0e29b3c901f8b1e46153eae4017ab7de5dc6678985ae73b926c8b58e9f1d7e94283893965562691c82c3d5c4d8609bd1f4796ce50fd7e6e7c8442f0d0e50f761524dadeced28a48278c938942f14518e7e26f301782335f3d1d8b0362a499b8586231f2905cab561525244a8c7ce632287523f60cb79ed251c6672c42efeaabc2e24a92f9b7caa38276e7c648a8d820ac22981b19afe6952801dc66826859ccf7c7c4028e8afe27d9cb5108503f8594a9989e9e8b9344e5bdc462f7ee9cbd86e8611dc8bfd9ca04ea6bbb72fca161e44796a4dde34b03d4d1d7fad21e92a3b1e1efbd2faa5250bd26cc49906bf0cd37f3febe9e27d8b35ad1de9b35b1d76e6c19d69778b8862818bf2863169738a77e73c10d555ed1432efdf261881c82ed8d7312b7026c4bafdbc84520be0d0eb2c2691020e9cdc46925c23c0c40c95e54c1ab42ec96dd55f506660ebc69595b3cbfacd7d63147df45ecd17f78fd9833b9773373daf33144c1245760f9f895d426b844feba6027ed46a9577facca3829466ecf530ed6f279de3317abde4117724ae5b04bce46174a55ab3fe2b2956c0e9912154a27faec7d170bc0228b9dd499aa3fac50bebbcf4ff1d7398da2682caa75fcc7d8f2381a97781f49aee72e3699d9ec9ef8e57cd14fe600ebd7dabf44dbc6dc84cf45cedf88741c33bef2668e80c294f3e954efe659b93ebe72a58f3cfba707afa597d257598c5134ab64d85ede59388d2dcb1b162fea9499ae1247e734b062b40b7cc770c83c65e1729de2bf5fa3cfd6807bb0c20b72f1c2cb99bbc16ce548ce1c179d2a1d12d1ba7054b0f69c8b434a07420f05d0235dd9f9ea67f53fa406c8b032a7e3a7f887584a1002c564c946d54213818871b438aa99dfbc2d7141988d1738ec9b7061556085050c31b11febecaab75f112724df52ee97c7f7d2a40fd30d2e7b5708eb59e984e32dfb16146041dffd10edc7b48e8e6845088fc3766db1436d6f35c866a3c6bfd4b70e96eee6c57f7e210c41c1ef75077403827313ecd79963d2a053e92e91a54a5ea4d6d472ce7ea900f74525ad54e8fada524eb5ffd480cf2d594b22d4d326d4ee9ee22560692f8b78550144c657a120e86609f7353228dd0f025ff197b3fbe658c81c1a42b66fa396fc5f0a0bb98bcc69d955c1146e32be8c9505ea29be988587992ba97c030a316e3806cda6c57092bae5a8c389f0f6474c5a49259333664e4518bf5fa5b18193c7e8e0389c40fd25bbf57cb175f9bad264455088d80e7d1f446909064593f18c9cf93864a99a57bf0cc59188f3e4d2201438220cd7666d491d16269fef76f579d0ff59e1ac13aa0608efe2356a77e75ca4c2ae6a4f735f1349a490841a76a001694bda423b3bd5613837ac2ba3a904a54b189f77b89b7da2a35de8576eba0f58d93d11d7b87053af6f06d81e3c08fac52be056e4c639aa4727e1f6202e9803126cd7799e4c86f2afa4e9b3b3c088d87d898b911a4f767358f5718a12868049c2705b9e3d7cdf57b52ab066b739795ee5b22d8b529ba98ff575200a48481bfed7c1675c3d9ac7f359fce3fb3cce77cfc4ac44ac93754cdd585d2f35af1136a45e59eb9daff4b9eab17aa763b0ba384798d18644ece985f71e75171d9288c6115af7aa9c8dbe5e40f4ea52e2a20e2a6795db724925e8847594ab9f77842f970988fba85a5f31db4a12f22ddbbabfe79b2876a82d02d8bcb17c20f8d4a3fc8be1759c4ab7d8b03ca6f65f9ba66503d3dd9a837b9f7b9727a26054e1a9e49774140e222dd84f07901210640618d16d952a5f302b3c9aa98bad87909fc88814743418529a0b29d185c0fd2f6b954efa318a416ff4f68e7f52ec8769abb535707a8bc943794c59e9b8c108c96e19d10923fbd1978e775e89b46864483f70df310e034515bfc206a9042ede4b789b91a3343884af4a5c78a81035a4aa054c60885afa4e214ef74d85c4f7b08a4c1057a272f0874457ab392cd756411df712aec5e4ec6e124adaba528cc0fe0e12614d5b02881640da84bcbefed8a5ffc5a85e3407453ce68642da298cc2281494be0f3e23b668623ef150916801ce398fa3bc5b6ddc8837aa26a15c7504a310760b07f0ce5a3c7a7f47003af281381514dd6425ec44169d3f596f28de07c9d243d4ffdae789f9b3df6101fe79b814beef1dc6bb2e682ba46de56831a330300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "52acac6a656365", 0, 770351664, 733220448, "ce17e59fa6f7ac3c676a858532e490d3aa2affb2744dcf7d49cdf0a1cbc9551e"],
+	["030000807082c40301bc9781412da7b9becafaca6f4c6f132c3c762e1f4757031078ee89949e7093cb01000000036300637b710c8b01325bfb000000000006ac656351ac529b39501d0a58520d00", "51650051", 0, 373445104, 4179206552, "3d1ddab0d6047cb1a335832068ee579c75ce3179951e4289c3be8e04234b4e9d"],
+	["030000807082c403041c988de66ca5e82e0b7547a9ca3ffa9df0abf0e65b3d2d8c519ac2ac8ecc2d9201000000026500ffffffff1aad43e3ad1427ba03062924679899ad080b9a69b061fdb69e14ed452f321be80300000008ac53006365535300c2cabb130701b7796d305d450f75ddae7a6b0bc02502f505d316d0308b148e090288579a0300000004656a656abbb545e715719b734c269a2b212be5bd153ea2013def5fb13a1a2fccc0eda9376ab0e942010000000851516563ac536500ffffffff01b348ca0100000000016300000000c6a6100d00", "", 3, 1972446314, 4179206552, "15ff0d2e62a2f0f8d46e89500d1590220d08aa3ddbe9a9ac97f197d1ef094be3"],
+	["030000807082c40303dcc7bdc0d0adbf5420181b91fd19bf5efafc3b9742177d2231e911ceb96285920000000001653cde1bb4547618ed45013019efcf36337640fdd24cd479c74e5a04bd3f47f2acc83a0c1d0300000009656565515353656a651585f08c0664bcfe95975a16e11e9f5870c721f58112b784b7ac37a6e56a3d399547e0090100000003535253fa90320e0263aee00400000000076a00635165ac63fec3ff0200000000025252c8023fbae673591400", "53", 2, 1029679975, 733220448, "f11b6a0b4d24176f3f4c779ef1f64fb076108884a6c6976b2fed607cefec6cec"],
+	["9b523e5c04de2ef4eb7f9ab6ceffebdff3c7587cdb72fa023c1715e52fd3bd47bc1948769501000000026a65b9ae23763c79313ddc1a8140d929a317585109e2557a787163b859022398f3c5e9155ccf03000000045252ac6a14eadbcd4a09f9f4897c507641554f81b05eb05de7af0ea3ab9c258f8b2af480ad4b19f7010000000600005165ac65ffffffff39ca1015626d731949b2509d07321d1dccc8d235c56744c7da206c7bb7ec10eb00000000016aab2072cc0268f4a604000000000553656a53634fb0c000000000000565636553654880a61200", "", 0, 746363852, 0, "916a90e95d38d3c95d29ab739b4956e43f3de74fd73743bc1fed4fb98738cd4f"],
+	["1b2e4c01036df521236501ebafb6bbaffc5057ff0986553d20aa62db29125c496c4f874c0003000000036a6a51e1cbc0ac41cffe88bf6db8fbb397de514b65666300eeed9facd879e76acc11256f03bd4e030000000965acac5263acac63527472a1f42b364b10f60cd469c4567f14bb239c8f78a36794f284359054666c661de304d900000000065151635363005a835b7b02cd59fd000000000000593dd003000000000465ac635228eea55b00", "ac00", 1, -857306004, 1953719636, "181a31693890ad35c5970af1b4eafaa22ae42f51e1819b0b2ce4511137f141e7"],
+	["a5abbc1404e236a875ae7742f93072239bc60651b372efa216e7b744a595bfb2a5d408633c010000000463516552fffffffffbc3c551cb0c8de4bfac3723789f1c0f1eba7a0d298b298a83cc58b897bf75d60000000009006aac516300ac006a3ae2ca79f02c2dadbb811e37e38be66ba6c359a3f5d64e17ae91304e009e85515d57c9750000000003ac0052ffffffffcda72d2f98ed03b0bc1f9b8e8c048735b260e7e2c6c88a2fe6333f29d338cb820300000003525100ffffffff037630fa0000000000050063515153879dd900000000000752656a5252525182239d0200000000025153a36ffef500", "ac53", 0, 1714741913, 1537743641, "76e9d0ebf89023828c3a9ef888a881528d7e7fdb4ecf029a951c10bb42b149e1"],
+	["030000807082c40301c03dddd6196a4c4a70d106c89564fac15d1f7fb3b8e63da65be37c123125f2680200000003655352ffffffff0401005703000000000865005363ac65ac00cf7be001000000000453ac00659c397a050000000001520f5aed01000000000165ff35bedb0000000000", "656a65520052ac52", 0, -106132560, 0, "d5d87fcc8b0d5298765ca6430f4f9088eb00cafdff3ff808e59f7a00d0462db3"],
+	["030000807082c40302fe66103c5d97c967687fbccdefcb3a9459e1930802304e7858f8fdff0e04307300000000045153ac63ffffffffeaa1a4d909bb673381ba3bf3c2c6e034dded10792405f7353fc3492dd61ad900020000000452005253ffffffff021c40b6050000000002006a3c0212040000000005ac0065525100000000db18d01900", "6a52", 1, 1390170073, 1953719636, "5362ffc17caeb407a7ae8194e28bde53b69f481212b968bb8b69fe12adfe6767"],
+	["bfb5694c031c997ecf0b2a7ee693423c0d822477b7567cd54d43518ca657092e3acedd2343010000000563ac515265ffffffff17d43eed4b45ab45925b00a4aa8e358fa0896ab906201819991897ce428af22d020000000400636300ffffffffa8c9d48f2be6522592deba9df148a88c5e26203304f119a000ad6eeb11e485d3000000000553ac650063ffffffff025aeceb04000000000851ac5151536a0053b3f2430000000000076352ac635151630000000000", "6a51ac636a655153", 2, -1471152494, 3925833126, "f8344c61f9431644b866049768bf7b88bf3cdee5c67d8ef8207e7d7aad54f786"],
+	["0400008085202f890172809cffc25a519987081ab09c90c2432399944bd034cd84529d137c6fdd051f02000000096a526365ac52ac0063fea219b602a70fb40000000000035163006f094d0300000000095252656a516a5352ac803c95ab00000000831a16030000000004b9f08d0b891ac54878125572e2d497edd56c74442ea1e398fe4891e030645a916fcd64f399c580bc8b25a27116ba8688b9e01563e66c53b008f9b432f365db6c7485e300104414561b9483456e8256be58959799b79bcae65e0a82c32bf88c4cfa677e5a88b6de7b592fd7d4acc95f466eb0f89515569bb6fb549720f40c1bc4c0cad5cd5163cfb8693983de0e83add2c9473f901f8ae3256a37005f3450223dd31cf587c5069588fd21cdcd33cf958ef9362c66d94fb3d2929e9c3b0a3b8e9c27ffefc2dbf7809b8361967d4f48f5100afbae97627b9b1acfea5c2455de17a4d17b0b85b75429d963315dbd7f639791d133ea81c7ed4eb8563fd7b1cf490be0f7728592ca92c543229eafda628c35a3d2953a13c55d090eccdec3983d99ecb725d9a54e6d889efa8219b0338138e5721261da63afc2242dd373b7866b7af9074beef1dc6bb2e682ba46de56831a330300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000086206e24a34bf51a4a2e334e02a11cdb6ac645461f59b4c4e28ffca48076999dc13117c109369ba484a3de58a8e7c4bcb1f100ab60eb966e8436d5c98f220f3a9183b04f9619fd81825a7acfc5e8d3bcb70b4ccb3cc378798e83c86bbb4355f8ab808b0d46348ea059848b726238e0e64e229e664acf5772adaa8908735d4c404a37a2aa8a196508e44604ef515efad7a066dd7dadefff1fbbcee665afb5a6d10a0ab3e7cd84b0777d26a919419b5c4db9232597460287de025e9ffb2d3c9489fe4dd4d9d6d3ae869be6252426fc6b7d51680917f5a0685e41d75840621c738c2f983f33159abf9e2141ff59a5abff443b23842deadf0445009f959cf33ee67fbb186173261c96e258e0ad3a97bdc9a2afe50f35cbed5b383bfa37fac137dde42520a47d312a46ad42bea6108d2de8266b63f406ffb1d1ac78c270e0ed9dbca14beef1dc6bb2e682ba46de56831a3303000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000e49730119b7c0d09142a467490b784a49917593733cbf08b4a8a7f519483e5d2bdc3d0a49d66a1539dbfdaa326bfbaf115792c29da77b34c59327bee593cee6babbe5743d8b0a1e2f50a159dfe179b47b6d96834d99354f8e921b5d3b7885b8e812ae90de384576afaa1f6677c401e0adb810e89ff677a9128b6d5ab50ca7932c3deb6a3feadecd3f415cf0a9098ff780c158651aff46924b2b652ab59bd6256e9cee1a5c6d28116c884e9a6bf146d7ffe699635d5b479a10a40b607e58885996ce612a99cdc7bf60997df237bdb4ebf4e3b69782662e251fa602afe73fe80ee9720af0f05a9f0a41c199904f744e0db6a7f7db3b10da3d57735e83c5f1aa5d4b9b6d4db850a5a36bd578ba1ed997968f33c20f695b255c5949847bb72ebf9d3c6959e98bdbe162a35ee24cf332a8fd7ff8a061fb93b11dd1476a007a02609614beef1dc6bb2e682ba46de56831a330300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004ff3df7777abdec926995b24b176f6f91421b1ef4783c5942e8b31cb3c11b899241251345f7773cb010c3715109efdf59df98cb35040e044d21f87ae85a2d713950c90235d5ff19da9540c52cd9cabb3254a5aa4577b79275d2fcf2cade87ca8798c7af47837d648dc879de02c257122505405ce8d715ed84d9f4db0af31f4ce495fcad483e86ea3b709e8110e4c8f1f31c0155a990c67495704d1a977e7df622fc485f28942d99a32e511d4a71e6aae6797c5d7ffc1b0398f561355faf17675c46cb27c9349616eee1c646964c6be9681cae0c025d818bce69340f32b4adbd15241308f3df2c841db8d33e294c2fcea93d53f8ee380b24d9ed7e6fa7a5012338782efe4c94e99a45f349f8ba34dacb0888d3400e364eb4af297c78b9c34f7108663cb5c51432226a2076fd5802ba39ee4d72c7fdc6c6cc8bc231ff5c60f6f54beef1dc6bb2e682ba46de56831a3303000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000027daae5d656d3dfd49af6bca02ce19041c30b7aee958101e40d1e0b26aaf959ee56481564cf4a3b07b278566d706f68aae2ae63225f2b7ba633d4d09f5c86151a02542ae6e4bb0543922bc656a3141e3da17e8a059846676ce35c96af1d3ceb6f931a9cc9f46237c92581a38d0db9cabdea9aa2d41296d7f6b6c0efca8b4d669e0edbf66274157411ae609281039e9c8a3e02730bfdbcbbb3f370652d421cf58aa4531c8aba2fd6bac547f51ebcb2604279aac4080931885560b5fa7bec5056e01e0d696cc38c221d59b942fed1a5119a3c882106a3852b21b096033466f87984cd13d65f0e1b044ea144423d8a5c10c46e88531aa3901b83e9b6e837602ce9d00d7f2977f0d85d56b00664fb20c4d80f83cd556e8f827ac0f567d77dd443bbcac28ffeed97679f959b3cd54e43511618fe3a8693b369a0f6b77d80a0bff829c77e7bec8ffd2fc1759cfe5a2c42e052c3260ccc2895b94c54a029ca60f7985ca6306312823ef315afb57535c8ea7116dfafa4f920b0884892195dbd08676ea0f6efd9cd4eff9528ab312320b795df0e2c0442fb580405fbe133872dd44742fc3e27cc3775ee5d79e86eb1a238dc47fa1571c26c9bb2fd4c52393d34f1250666ffe9267caf471b8058f11e07523bf8f596dc8bb7959e61fde5fe1a30662c2d64b5e38dcf130060727036b10292d36087e4a4aaffa4c75c8e2f4baa94f2a0e2c1c3d1ed67d923856ea43adc2fe7fb18054a4e94e0529f1ab85b8bdcaf5e0d52148b4dae34969ed912d4ae7ec1bf15ac49cdc59fb9800424482b6b29891f74f8fa2655a24e005fb71792b268a7a1eb76e91b3647ec5542788848286b66ea27307bc2acf38ab9593e7031bb92e64a98999e39ce39dadb840b376f3aa2fe384b89f60736dd9573f552c6219b33aa05762d47b9b75517fcf6222bee5777480a64f0c1830e18f5b640b90b218106efcdf39aef63746038635acc83166ab0cf28f3af98d348a368accfe3713eb522293b17e8a66fee4c1fe1ef3e0fa99e09821461a47bd29decce487b28e03882cbeb75fd4230404bed6d0f0197a94bd728d8d0a22184bd13fe437a52cf5d0bf8f8d2d72617a1eab1afacce62e5fe92658dced7938572a1573f073b070499252e9b478d736b6ad71a8b98bd06612c147c324bc253865403ed481c318f3dd0adc3782b32f4b0226b07495356de559152dc50c2d27ee66881ffa9d2da3027f3c9cd2b47d7f0c23ac0d1a40921c008508f5955cd46d535c689ddd1bd670d35e2705d4ead0a65dacef0cd9db7a84e38ab6611f718ccfb84fd178e2e603a57b495b6cec74fe64ee2dfb14bde3b05e5742fb0e46164f8d7c3df8a0a0c17a8bc6bf80267448178723ca7cc4dc27cc50062ac8d7d3944121798a7fb4a1a27e83abf0b950204f184f2d6b9669dd5bc40ddb01eac1fa8b64a051573ff2919b03ebcb4581ec32a53ab3dcf44f15c8180ad79201317fd231f41468503595db3a8357dfbb5ef5702bd64f1651b0c92d671476042d081d04a5b79ac671f8a227555d38315c2d4d8f8a4e1a9bbd074f8ec16c5d6ab8a96c26f6d7817fce856407b1d72a83b1f1efa3da6ea49a57b8436962e56751e9279c7f92aef9d21ab229856fc57e9e4ef29a9753220a52a62b849029aea4b8dbddfc35f22af47ec676a1cf39d8b6e22ad5c15156a1ba0260548822c2514719d8f48712251c0629d74a8cd10038b53f157d6a995135524917081167d9cfc5041affa1599e00078e00fce76f7e187b908bbf41583634b926a7d105e4214f50d8f79dfdc059a7cd2919ae019edb5ed544842164916a21adb2ef14cedaf7cd604d4924438ad19999e443f1ec3dbcc956e323fccebfb879cb2caf0eba15f2daac72ca484972a55a9f9382bb673ae04cd62a08d6bd1c42978191614fb3ef0b26f990ce3f4cf268806e9d1ea63e3eeb69519cb40e71bdbcd5c652112be75d2724d01329526cbdbc2f96dcaba4433261777b0a92253838198eff82d06efa9e939a646dfa6046ea3de76f6a57c309fa1908d3262cb97b3a34c712b09a8cb05c37adbc6b16d63d5f5a607003dc6ce74be122a170d1f8844ad3746a01ef0eb551c8ae9dbf41f4aa4bedcd117c44a9a4eae8f01b8b2832278cba4b80346b15ce2715712481c9becb05446617c5305c6c7f5f6ac6d9b2291db0b3177b98ffd4178a71387a4d488331afec313df4cebe12633b020ef6ce2067e19359dc56a40041e177b6b1fa4960d92927ab4a92501c2ac664346261f52aa8f77d0706a39f7ea6ff7c3a74a5761320fbaac02391baddef2f9e0adf690e58dddd03c57ece839cae5d80dbecd8595837117c55f81d641f003deaabc37075212a36253e48ab4ac28546a1f7b4286f6c71532599e30f3c42858516ae45ffb8508fdb1ebbc29a8e3685075d6c10b48c16966b4cb1b319f7db9fa170444db719da6f341c429d5e46d0382bf041e587bcb919006781df5a4e46e3fb9f1be3f7ed63f01f8243b7f5e9a2dddea6b02a799f04a8aabe4c126ca87d1b6fbde975648937838c78485e5053b68cae4aec71168f0e2eb52b83f8abfe540c7ab05b3fe5c8025c894b8c94ad7224bd7e2f4c3f5aad9fc31e3c11498deb86ca4515405105ea82b1d4e776cf6b93d53419d72028e2f9677879729d98fc25873a279f35ec9d4e1c60100000000000000000c4b610400000000a9f3ed3905bbf9f697fd0920e7787b95dfeb06ede8f1d00ba1b63d0de15b90460f0973af832922a05bd5428065a72c5f9d5541a902ef3b657f2e763fd353dd8c199831fa5c8b329cc837d23a715230f94ff80b2754933b66089233c96f5d63230000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000093166f6ecb9627ea8ebc479a9374b111a273217ea99ffe56c2eada607e7aa8e7c8e0a81efdbd7550850f7614e94fddc4a9a272a273316241bb4c5760506a6deaf990ffbe35f7ca35cc1a932fab7cb38ebfa3a8ecd645528ff6df42273776353d67b7c30bf3d7e632c19f8dd770278bd0076907b38a6fc30c980ad83aa4ed45ca6c631191830d3ab9ec9a4069768e28c15933c7f58edd756d5f85ee5ba9a7bb640a576a04effbca632d5ebe5743ffe3e4f2d5d91c49c2bd2b8b849ecd5686882f1030c8f69290d85e3850335f53c25f925d5cc6ce6626116e4a823e840a6433be1f9a9ad1fa8404898da28bd4f68e547988d9e89d1f7b20480c7f94cb3a6c3435674a9865eef3eb1aefcc3516a39ae9945aedf10d3481f4b4cef42ecc86b6d8a0a66cd0fda52c56cc1add1daff919d2a0c0e2f6187feb190a93590c0344d06b7ef112cfc900c5471fb0bca46b555b1f54e30889be18c7fa8eeece75e1070c8d066a63d5ca754172e52af29873dec89b97c0059c28925981f4f6e4baeae0903bce2ae123509c982d54f2ebb6e25e757835d0aaa510f765ed2db3138c12937c20d48aeee0e919b530331d37e2313c48dbe1754bd55da82c98a408289e194ad76967e2610d17f54ce9d12d13bccb2d5ace9f80949d8fea483c6d39252baa4d2d5b919795615a5e9bd08fc1acf49e8676c3b13e799f724eb6221f3cc0f2d74e8cc07f758903cd6d99588fb4439973aa430ee410425761aea0ec6b5622bfe9fb8af795057ddf8788226028c803c5c37b032b99ebcc8c18748227a9f33bc137b465c48f0122db491b05281085930daedcd327e1577e8053fb2edc3ec3c0a9b04933db24a513ef055e5b361f32f7e42ec821f55d3be5c82a9f17e3bd4546dd3a5045b8ede1f6a50c289fcf4230b3481cbceeba4615e860da71445e5a365bbe44e8cd1b07e3954b417d8a66b3e009f516fb87272c0169f69334ae2e1dd1cd84737ee89b501d337ccd62bacd6ffa18591d8a9dd8461f67e23eb1fa1d6d82002e8576f9ad9ab32e377c6265e929d0a41007b4fd908118c88bbdf76ffa74f78923fa03db6b75f419c14709ad986e67a82011e18c6d066b117095f13d371b3d9d08fd9a6f4f1025637a7e60d4d1e4414120808b98e56b34a4abf6498c37764067bfc25e40fffa0043e4130576def762bf9aa14c17d9f832368216198d37cea27c9095d0dc8b79de0bed4195d6670db227f2eb107d08b079841995ee3aeb09a933f4da0f8b3f8c6665f8c5896e06e8d5244f4564e42d4a9a1268329feeda69c6a52f647dde66e853919210f41a36be2b3299473d29531759661c8b59f703847b537cebef1ad0179b506a038d7bb46c78ffb465878d5b0975954c120f352307cc19fcbed3803bed8f9feefac0032ddc5fbfcea6554711993e0a4448df55f3bec660f6a56f1fd2eff8ab9038fec5f1280d33ebbd5abc08539f6e575fe99f77dd555879cfba5ff8f918711dc6502bb7c381d2fa24aa6a3f793b4d4abec7717f3b2a7824e183e0cbb5bc467862567f7c9893894b38d8ed0a7382d6bd9b01ebf890c8c25336606acb68c662987fe2eee5986152976cc27d50765119fd146cdc19dad0fc87860bc8f7e07e7e8423dfaa3773251ab54a44992535188b76f43deda9c6a0e9dc316f178cca8973dfd2b759578de58903d958ec9cfc0179ebeeab7d170273941a4c75b25ecfccfa9239320a5449dd0803445be6ded2878a5489a58b05e888b589b8c72c2a4c27dc290ffe128d559084a0eac6a8209938be668dad9d924f3f813fb5a6da52b5e128601f86dfb5250c4f28ce5d79728fc712af30d44ef994bcacd04f9bb97f813b6b565bb5e744eb3868a902f91223453caf5b9f90b265de8425cf7bb105752a68f7d57150ccf6b8d4aae69003e361798a04011a21e2d4c6006098a6cf5d8d042afe1dfb1f6c6103a256f2404c0b1b5316e252ed3c4066a8bff5ba5437c7fbc2fbe4d829a591918b587386b94dbe2a1fcdb034f80eed250959652586e63acd7e12a54e662053f4a19737e6b96b41c4660805a52eebd5e4191ba3414659831757f342739606257162d66e0071a4dea4b065725f7196460e0de088c032cef3216865f747ef4c85fc7ba1058883ca2f3a5ad24f55baa3f5489fab02103f7c65c2d5b479f0b53f0e85a0436a677ebc990a2b85368163ad7a2b9195cf8c14775cb5dc50a5d454184d01749c0331620b18da66013981483c787f3ce73e4f13f36c9dce508c2f85612177bf5de3f408a9ffb416190300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "53", 0, 653592034, 3925833126, "dc3d65b9d8bc3900f5b37d469ee34db7cd10b155bf496afd0146ec82cefc6aba"],
+	["030000807082c40302305bc7b487615932e39dec8ae867944a3e17df33a9ab170fea2b005381b95d27010000000163c273b17a0c61098b29d2d103b0b3d8e36c804249d5062e7300c66fc72b1ce6df32146e7300000000066352655152acffffffff02ce02d602000000000652636a656a650955b1010000000000284ade950000000000", "6352526a53ac6352", 1, -2108732349, 1537743641, "13d5c659f1f9913c3c6cea89f9bfba57396accc4fc47236cbde727f66b8fcdcc"],
+	["2f3d194e0401f07bc1c7f23f4a8661927c442dea5090339b73513ac8ad9053b4e9bfec1ea103000000025100203ed4395222d8145001bad4b5f596e243c32e17d03ea2ee9fae105d97f60f729f31e9af030000000753ac516aac6365b1ee3f5c7434f1fa0a61c99c22ba1756f3c1538c2fe446c653a32625339a616a5d8d9daa03000000036a510065be7f09eb5b79ba368c3f0a18879886beac199c46869044c1bfe881d83d779fdeef5bdc030000000353526affffffff028d07e30100000000015107fc1103000000000963656a6a0051ac65530000000000", "0065656a656300", 0, -267468147, 0, "1b6fcae74d84abd54b0ddd8fccaa6fd4ee67c60ec0b4e3bef347975b493a4574"],
+	["030000807082c40301903613b7204138d575142172fedf45ed6b29f251c4b0e37809ed3bc7640588a30200000007525152636551ac24bbc33502bdc4040000000000020000d0bb3c020000000007650000510053ac000000000000000000", "655151", 0, 232655634, 1991772603, "18bed309e2144c09a0a9d850b24ccd7603ed74530347c7c1962ea95b6a7dcba0"],
+	["030000807082c4030250735069887b09cd614fd68cd78a6eff6657a3dfe0c36bb38604f390ffbe9a340100000003005251ffffffffb541d87f0313514d4612184563cd4d5166d0a0fee2d9bd7b263b3cd9fcf271af0300000000ffffffff03a01a1a0500000000046363ac6380f56c040000000007ac6300ac536a00612a6a0300000000010000000000b136d21c00", "", 0, -142506018, 4122551051, "779ce1c392feb03341596af02b56db138003bddabeb65934e0dbb01cd6a1e153"],
+	["cb566a4e036200876e470f53d27a908057c0b9b9e08f8a5f87e2555dc72d6482c5571b000403000000035265ac11cea90897003cb08298e75db1cefa13ec6ba0f05116658810d519d073c56ac38e395a7b0300000003536351ffffffff27b781a0b13ef5db537a214714bdd36c4066c390c653c826f2697f53034df58e000000000563ac65636affffffff024a0eb4020000000005525251636a701f2e0200000000046a00ac530000000000", "65ac6352", 1, 1507145413, 0, "746e68d14f77819021af516985e037c561b6fa839ce64856fbcca39f528a3a15"],
+	["fa0d2200039ccf95d4818358e0cad1b21a281998114239529b210e987fcfc30b8e74e90e7e0200000005516a6a6551ffffffff9360368336b048c5dbf51fed853bee8efb89c3b4dcda79a8c4fcf4bd61cb746c03000000055153acac6a3ceba3717e97ac87be8fb931a1ab72a29c92c6cf745029b5cd747fc8c7f4914e11abebe30300000001acffffffff016bd8b501000000000900526553526353ac539a09cc9d00", "5153525352ac530053", 1, 544863493, 1537743641, "25457ede5ed4d6d63a9c743449e825220d594f934e7a8a3edd258d424f33c3c7"],
+	["5883ee6601af73e2657d4fdeef288f1be21e6add16812741fad65ce3b189d79819058d5c73020000000165ffffffff039cefda00000000000463526a51e028ca04000000000151d46f49040000000004ac53ac650000000000", "52655352ac53ac0065", 0, 1313205964, 733220448, "5b1efa4d8116c75d5151de1ccfb954cbac106ea1ca7a99bd4b24966fcbe4f469"],
+	["bf8bf87102637a00289892e9493f1d1aadcd8fa7d2c537f5d8e4b350a67fff6bb851f9aab50000000006005100535163ffffffffb93d0d328b195cba2640c17c4ff8f4a66c57e4ff53118cc2a630ee945bf58c1b010000000753ac656a6a5265639911bb0310e79704000000000100746f35020000000002635260e0160100000000075200ac52526a532793635400", "5163ac6a", 0, 1725717165, 1953719636, "df65ca2757d6e45037e1959d4df505e61afe8ee1ea4f031d57b587f7b216ffd9"],
+	["63bebe4604c1851532a1339715ad8a3aae747ad2df656edbcf498be762247dea46b3086e0c0100000006ac63515251ac43465d6c9f2da270011432d9617156976fd02cc500546f336471223c1d8642847b7584d10300000008acacac65536353000971446f3b0a9f1ba54d74a6148cee68ebf56bbe817a5cc5fc4887739a3190fcf52af7d70000000003ac656affffffff7bcecfbb48376701334116462c6ab4ab65a031bb0a7c80014859e2a7294d1e180000000003006353ffffffff047f53d50100000000016acb5d2a000000000003635151ffafce010000000009006553ac5153636552384834040000000003ac650009540bec00", "ac6a6aac5353635352", 3, 709176207, 0, "1b4e93b8ec8ca9045b1d1920ad341170825033e5a80b86543d6974c6e49cb304"],
+	["ee70770d01ea9bbcdb5f727c800eb10a71f86c0b1af8b54f9e6cbbde43512139607a79646300000000085251526a6aac0065ffffffff02aa41d402000000000365000017b08905000000000452636565fa2d4d3a00", "6551ac", 0, 832099693, 4122551051, "f241e18c6e235b62ac1286e3ad2af755a45b21a730ad6d7f47e15bee60f277d5"],
+	["0400008085202f8904b02777e2194cfb6178e7efdeabafacf1e20e1717aec7fc1fec0014f4dd1d7fb40100000000f5677e6a358ad875bdb755d21bb485b58b97083a881f90d6f875a27d953059dba7f6ebe502000000065365650065519f93c42b78647b344750ce63c9317eb790b90a319118336ec32bfa4511cf8b77321a7f4a00000000050051ac65005f8a1d2b6c453f60bcd90d92690e83cf33fff765e88fe384742e2956bf192c580c65c04c0300000002ac6affffffff01b71cff00000000000163fbe944d200000000623b2e030000000001ff0217af3aa9830b3263a9a00a15d31e7b79c201ce4b411bfe0106b5b8f553dc1f54b411e82869636463c16dbba34911b2ee033945d9907dba2ce779c2bdba26a4d3c8bd2b7784dfd7f667752c6bba9541d6640171471858d39404cce3ad88829f9b9bde3b311bd5f318fb1954666904f21784346d2812e7008ed16155c3181a7b481b5685a939f8dcebad2547199e5f1b5d384372667a8715e2afdbe0358c1f3be37497c7ca66de7f43138f03e3b981863eeeefebf82224d36f96471338e4159270279b352ddac2f75ae3c21728521f15578f5aba1b09015c1c486f870f0f2ba4d3a660112d78c8613ff42417da0791ca5a8f1dd04a85f36271697818de03ca2845b88ce5590e9f7c132972c2b05e7fbc55d265c756cec9201724c7bcf6ffdb519a3885f65714827a9fee82fc274d9a8a8f0d5581cd8ade9389e8e482380e9d2f85612177bf5de3f408a9ffb416190300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001dbf83af5e33fe27c71f609214343c501ae5cc2588d345107a33ae2e1195deb3ad77c0a33583d9aa11c9351776b205ed0c27e53caf295902911e6e0995777af20c70e05f32cb9187d15a958b29810724129218a839875c8a1a0c67139792ec61429c79235ef4d472c3726a4759e75590a7d0829682431fc946c682daeecd559c307bf20774e2ddee143315b5b6830c9add1a9e00e7b0952831de24ce74cd03b1950d923b14876faf70ef1fc25553aa15332ccef4260364ebb33c39b90a6fc1d6d4e507c0dabbc8ee22b87cf71582e6275728bcce91d0dd50bfa7b6b9661b97634a5c7df34354b964b6d9b3bf2d39e139d04f406072805b6b25df2e0d0803d501fc2c5b0ca39767c856f732a2c3dc124f1a3333cb379a3db2b43a684d3dc0482814269e21c1bb1f3fc980dd19865e201454addd065d90c76f2a3a92fea32a77c8251c89504a5293443c5192745c92434f82b458dffb330c33ba510cf85d45811c49a9b3e27823a801579b1ac4c36fb402fe80387bb5ce8876481422abc0de65a48e9a9606dc76cc653a75d02a6edea1bab3fa1cea6dc4cd705a24977a48e2240fc92ab57a426214e29e7c4a9e021282b401983ee3d5efbe36b5f36fdfb576b3d6176b07f9dcd26ef3517cf31829611bfbb6e56f3ae8de2c4bc40b196752fc7f208f7725fb4dca0afd76bf3c91283c3f47f0eb05719331ef689bfa02dac79dd3dcac703c950e082be1d1e3fbb04f2ecb2ce96908683d477ecd32bd6f8c8535920ba023ecf3356c8d0d68f840e74c903d64b8c1b1feb7d16176eaa92372ceda00591b984a130f54ccb0809fb122dbab1b46bfb5c5988392d0ee9ebf406fc2f0637ab2ee86ac05aaf0182127ced57ea06f0e3bc5d4e7fd3bacd52dd504d8fa6700f3c95e7f6897e63e1a008ab45649e2e0f28b2c150722e2dec521385c623b154fc7f87ff8bf5daf7bd1645d66b9493bf8993e38b61757faff88a11c97744adca43ca9f03c4b57b5e28f133e9d0c76905c2d99d95f49d95c9217d1b5ba527da1cadcc52a08d07a5a6328e6d5473ee57ba553397e4f588def72ecaf0008362f5f2aecbb1f5ae2b472f8dbb2d443232343b23a92a097cbeeedef374bb0628773513b70bee5719de1fb1559b23db7e9ab1c346ccd4c95202967ef0c9d0899bd482ab9bed6e987ddcbc82bf45d3a8ba44c53a71fd91c12c44b7a8986e4b58bb85b700b336fe623d715087f0504d18a80250a36359054f0b549122e02df95d4b173fc17502626b6a9793ae9be13eaf9b96cc7e46333389e46fb0b9f67e06cd6a3bf426761712a10f5b62d80fff83efd238d20230a61def34ca01f3cf100100000000000000000000000031fe8a1811d1ee97749cdaa5b89d205f50f3fc2e2d2c0f8b8acb588756e0282b5a546accbcab78d761342938e8b13dd08c8067986442670c5e7c61f199460331b1555dcb26398cb7ecae2b6cc9fdbb0018df79741795c030ba8fe0636b5de61100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d98d2c3da0ebddf729ed78b42bc7ca7ceba3ef52fb4a801ff01e7e85dbb44d1678496b67d311f6c25ade3ddbc56efe79f646e836a8d5374ecd5adc3ece693f16638e7c3ba25270fbcccc36d5efeb104a19565e1d52d2f3309c21846093cc8cc3126606d1c1fb504b95f52ff2850c8c4e76e929981ccdece14546f3cd82a12f0cf7838b56b842aa4c391c7449563da3d425c912881e72a050537271c7439ef4411a736c571eb168b69dbc17238d70a68b34618aa6c84688230151b504c27b6c5be4be7241db1ea6028a1cb6cb634abe4b7ca74b195789e038c5cd7587e83d0849235932ca6be7426dca34f2e158120fcc4ddec52a9905f1ed245ecad3f2678bec0e34d8bc43ebea5b4988ded07ee62326c5254530b0fb7da5e60d2d53e6cae5fe6e2a2802a8a52aa18d4e95007b2553ec6758457795288be0cced78a3c940565efb5ae55e599e6bd47d2c77bdb486e4d6e6b30ef6b0d08efc74769c2085b218048e6f6b2b049461301f1428bc3e3dc8c8cfec9b3f722d88160e43d735e1c68380da95277153f0820c79e2b3b8abc4b8be69a7f7ad787295116709ab30d80fd1b12f76b12eab06929f0cdd7929f71fa7f07fb872af74857a6c925d26773db989f6364f3fcc652c12c34ffbeded266dfe55f3cbc35ec9b8d3e889ed143c2330ed192fbefb99aad97e3a2eb576611800715e9390bca289670341a83cf21b765c5f6770131cd31aab9722ba691c56658068761406091117bbe9c1a7accb54174e5a5da4a895542059c11d34057ebe9d504e984b485e7fa4bd51e2a982822aed69f838621845702c6ba20c36d5c27d34655c8d53f371e649dddcc57203bca77417003576a75883faca3aef9d6956b4a80f6e23a5aeb5e8ef5e48eeb776fc8214f234bc9dcf591b7d3dcf7477390386dbd2fc40ff90c41c0acf5c9a7fb869aa02e76dd8ecd6d29e907aa063d82d8e7d846891808e4bf98465a6740a5d9e90338684dbc92c63598ed131d3af32ec5df69f5e5d167cbcc77b2c81be724e2c8dcd7fdbcd46d7237624d8cbac741eeb46a09905df758fcfb2bb9fe6311e1c8358cbc110ac59971346f14bb3b307c5031dc08aef46f1400bfafdfb866043c7997b144fe127bc61eb6eb4c1620cd4399abefb35bbc824c7612bd44e60429694819debef630af7baac7b06d983dd6077a96cf594d55ccae0465bceb0daf4e474de72120cb712cdf9ebb7ef33d3501e2d87d146724f60518b4e505977cf3dda1d301554af7ae8184e439416498bf27a8542e07b7398a8ee3106a2b7ccceb9de4457fc9f2ef0baed6722f90874d65c64f187b765fde54d70849eed3196bcde290e885462aaa868d0f853f87dfb36c6823da1f81aa786c880b25d2214cd7a6856356fc410b6d61b69ae407b761f62be209121ae992ddcaa9ac6d46066eedca7031ba698c968c689df1e9d28fbf5d7faa580e38d678dd1b83b0338d3ffbe71f116cc4eb8d03ab3fec86ecbd5b0bd552ce22a8a2be427afec465b5ac06e4c8752633535a983f1f8d68d85ef74e56338083258f65375ba51244a1513026f222d3187a0449795a3671a5c1ebc03e0c59a882b3c3d821c6267f50a24dc69767b1f8158addb59905e9db041666ad15436d740329d1ab5382ee15a494df0d0ccfe769c4449424f3ee60a886a8ece32a65d928359dc13268ece15b9068cf888943cde3142d120f04cb66d7c49907385d5a48c532195b87d6e92961c85906b34ce95106f96781a9a96d4e49297b663ff4586fdffe0b0f999c340713840a273441ce00b2976bc9db6c25eca8c86c48ccb3ce63a93f53a7b90d5602fa4e5e2a944ed8649565aeadec7e2681f85d0f0d6c3c82c451d6f4716b8c4a3ece1e11b3c1c6d8ccdd7ac089b2caa7014eaa885273e172fe036c7236cfdf6334e4d007e396b78649b2a31389b508f832bd8bbf9b58042c109f4871d126b5560bf9f8233c61945fa16a0c8ea052108e9e41791ae85203cade33e694d7d1cd1e2a5e0c4505516eb987fa994ad870c967801b1eb11f8cea09781e7d4bad812e61c5f42e24a059d9b6aa64e3d519ab0f69f127442f392d375d1bfde9a5f6d719068a261d317a09366ff4bf8f2dc426b48a358d922d72a93cb49f1bf71df0bd621b0c4ffa2b1e163d70a864d99d0165f5e5eea7176e45f1ad7003e9fceed000725c66d029ee1c40694c9c918c43679c72e17ef331dcdfbd59afe442b04110bd7dce488eaa489ce44585b3cf21f65c6424ebf3e85932ee9614d595a87062b99997113fe975fd10100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "525153516353", 2, -1811856229, 4122551051, "fa724861b854bf5d6480bcb8d6edb7506f9ed44050fed4f71633eaefa7da8f3d"],
+	["030000807082c40301d1ab761a76daac08aba262c241be61880a7237205b41df6ef53fd4cce7d90cd800000000025165ffffffff03af940a0400000000016a8ea0ff020000000002acac1aa9e90400000000020051000000000000000000", "6552656a51656365", 0, 2090021681, 0, "1b4065bc51cb3a6bc0d686b63be984f971d7b629aa6637e7495fd5bac262d947"],
+	["030000807082c40304c87cf8dbd0bb62510704c7f6844c6de71e7f697328c03f8a01c166670b9cf08e01000000076363ac5351ac6a8be033de5c273ec899d9de96c87e1bbf7c70212d5a2429c81134878674668e2c5126d34b0200000002006affffffff9d89a35335395fb487b0d725870a1456dbfac14e5f7fca0ed42a7430bce7148d03000000086a536a00636a6a63ffffffffaeb30f8a955fd1bbac78fb8380ca78bff51b21f0d9a530396de29ab2cfbbade30300000006ac5353656a00ff0e2ece040eb82903000000000165f12bb2030000000005ac6352ac636d37f402000000000452005351768ce901000000000465656a53000000000000000000", "51006a00656a5200", 0, -631018811, 4179206552, "2a6b920849f762ec5e0f7689fec0a33d5c61f9c29c8585a06312289ec0f39d06"],
+	["030000807082c40303e1ea3f6e88304f49c1e09b442b06e1390d1748ca7d66b14c97343a68b935ee7901000000025153ffffffff1a4d327b9e1e932f7791c1b551114ef0e0aab57d930150e7d535b2edc51f8c79030000000563ac65ac6597cd15f905733e00d7e95cb2e94797e9879a4084f0fdef030cfb7a40e5b2ea2125deede7000000000365ac6affffffff03e3036802000000000451636a6a68ee50000000000001512dffab010000000009655365516552535100df01d6639e4fec0a00", "63", 1, 1846942571, 1953719636, "9c93ddf0386c0453e0e45fa9805bfbd0feffba97d076d5d58f9dd316184e63de"],
+	["030000807082c4030186e0b43d976c1e7ccd596a3243498a9d7b91dd86ca690d02c8a1e840d2cf20d703000000025153ffffffff01ab08a30500000000096a00acac6a536a656300000000834fc70800", "656565", 0, 6681699, 1953719636, "e1f80a1fe3889ab9027c5aaa32128680883e5d4859a6c1a15e28524c264fcc93"],
+	["030000807082c40304354102e3dfaed866c45ebde37b13c45d8cc62e17267322cc6455941eda90d25903000000016503d7da4f681e96f69338e536389a7f929ab908181cb47ea8573647f76e18fc6cbe97dc800000000000ffffffff97f8bc950be4d5719237426fceea86f600f873d13cf6f6ac71b9cee6ea40a3f200000000085152655163536365ffffffff84fa954004db881e6b0f6893b5bbc9d60d29d51669292e3ecfcc5f3c820cba41000000000263acc3fbfa3a045f081005000000000651ac63526a6a6e00a90400000000086551526a6a6a516a8aa9fa0200000000065151006a636587c00c05000000000452ac6352000000006ce96f1c00", "006a52005252", 2, 2038747445, 3925833126, "a54070ef47c37b4d0e44e2c29606f9cb421c73be8dee2c4c7d2542b725f37d1d"],
+	["030000807082c403046ef30885806b6b3478db1192771f187ed785e387299d90fdd2677def9d4f61460300000003005351cd3591e45043656e8d10953013c8d4f8135ea50eb1c0ddc9f917c4cd07381143c84765f801000000075163ac515200525a0607c6e96737b716f9e85130130dc46e8aace34ded9a98c4c4d00e808a11808b73d65d00000000076a516552635153aadfe7f4ae6316a86f780fcbf72fe26afb655182deb32c3dae2a19452c4395547447c440020000000353536332ab1cf903cdd7ab030000000001634a590c02000000000041bfb902000000000452526553b44d9ea60000000000", "6563516551526a5200", 0, -34781256, 1537743641, "4b23222c6179a8b54c395ed9ee345f5f5c5123dd988eeb40e9111e2517d8fffb"],
+	["c520ac5504cba6d19628c8fcfaf0b6e9d9782c6330ee67381cac276010c2596812c3379c2e0000000009005300516a516a5253bcf23c66b30b2f47cac87cc3c7a7a16a298e582bc6366c8f83bdddfb2c28fe509344c337030000000653006a535263ffffffffb0f437c2be2005b67f74a3c2af4ef89f52b3cb60d6029735237d3220a9f87c000300000004635300acffffffff99964fce46f1df6a148574427451e860dfb10320bfcdfde806c7487ea802f2910100000006005363526a53ffffffff02e3ffc30200000000026a653712af0500000000030053512c6fe02400", "535263ac520053ac51", 3, 938778603, 3925833126, "9216038e6f584a7e1539477c3ed985b0c2d7636bae26058e6640d81b5bdaf3ca"],
+	["bcca932f02872042f4871d95a0bf51f5fec4da5071f3a59e77a217a117b2c5edf7e0d4a187030000000152fffffffff74a8bc3c16cd8447404ab38ac71524eb2c530170880758ae7fd5de0faf3ab150300000001008c56aba8020b939e0200000000095300516353ac00ac51ac412b04000000000900ac636a0052ac00651de1ad2700", "516a51ac536365", 0, 1043251364, 4179206552, "9e14924f899d7f2812914dd2e79777f45c9908a3deac8a6e3321ecfc6cc9f950"],
+	["c578de7a02e3b55db1a417c935b278b14b30e25d7e40449ae1a72527ab3a3e1f249606ae3800000000095352656a51ac636300ffffffff64ab77fe4799381c02f3f987f79244fd8d20d73fc242843da38db3f0fddcaac60200000007ac655100ac6552e0e4647b031f9501010000000004636565511eb39902000000000865510063515363523f10650400000000075165ac525365510000000000", "6a65ac005165520000", 1, 904834854, 1953719636, "3280c481d375b63d6a19d9472459fea9a67298ff9084b17601af20bd5033a311"],
+	["7a66db7903916878e03efb089427eb96c9bfe6feda4b43298ec6ea0062526718e5f0e2ed0d0300000003515353ffffffff43fe3a9a634c3bc6ed4484545d5ff686c3a12f57de56edf962b9c25c424a0abf0100000008ac0065656a525151ffffffff0c9ba658d3639b7335e36e1d43c0073105de37e4ca40598a2cd847a048b96234020000000652630053006aaed4f805031a22ac04000000000551ac52636a77f81501000000000200511f423d0200000000046a65ac000000000000", "51006a", 0, -1911086379, 4122551051, "0372f81d04512641c57b5385f15a11b7952989985cde06982292bb42449ccd59"],
+	["277ad06e0223a7733524b913f2deedd6392b86465ce979996b33ed384640e28c6c5e3af2c30200000000ffffffff69168d70b982ee7e2de2a3c6874f605ce848251904d00764329eead313ad31960200000003005363ffffffff04a5587405000000000500ac65655234f98101000000000900ac65ac6a00536aacded24d050000000006526365ac65532026ca040000000006ac63515163630000000000", "51525100ac", 0, 485460865, 4179206552, "8cdcb98a3226b2cf446ec7eb8219f89f2fe39b36cf0795ad683489dbeba85386"],
+	["0400008085202f8903552ea9b232f2ffa0b113479acd931bf4a90ebc99851bbf8f1243ce904ee9acc400000000001a28baa22c4697a39455c5f8a88de37e67f11e0c7c0c7ca26932e589827685a208e9ccd903000000040052ac00ffffffffaea70ccdce9dff0fd6dec0cd2049700d0877c222de08328c295ac8ffd1d466740000000006636a65526a65ffffffff0249e70d05000000000765630052ac5353372e6a00000000000165b047175d59433807efc4e20000000000042ee91fe6470169f7a9942ebf93fdd6d43742355ac2f6061bef98bd4790054e28b5c206c3888bfd700396cf1810414cea0849243a47a98d6b416195022a737208db2b0cf9bb6fbbda61b49e1f7906aab97c363be94f4bbb92882c521dee845c96639efe2ed6d9f1c58580a66b1bea63b7eecd8872f20b95cde0a8e74e3a32a939f478276d9a4a0ad052ec0f742618d1ffc9cb98b75318c35996dbf97f46197a42f848a4f86644cbb01b77cbef010b8aa9d5ca6d6622c786bcd17d2b153f16640d5ed4662d09ac470dca9c923dd686518bfdafee2a11a3f18b05d6e4612938e19e24491ce5f413b984e4cc6cc32d97c1465100013fcd30490c7aa951faeab541ff008b65e10ec6d8ce37cbd488c4b4582e4eaf6b2bd59eef96a116631d6e37d8c1150d8564bf4964ad5e05164d220554f659a6c7228879bb59e28ecfbb82f0e3cf614d595a87062b99997113fe975fd101000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d03acb0e68beb544b207a10fc9fd2c20459cc55b3d094ec799a962485dedf58014ce4773123c2491f84e0504c2f77a69e2a6f0ba13d95b81b9f57077db27650d64bbd5e2273be22cfe431c99916fdf7a1d03f9309017621f39b39b2c8de79179eb2c75211649e501f6cf967203dd8677ff9472051b39544e38daf92c1865ff57ddc4648cae8f57180fbb665acd5281053b77e1a8f7da0c4da0b177cfc2ebaa968339c1d23791a6620afdd9f19244a55d61ec684e3ca00fac65272a6d06d0ac768ec01fee3a0fce943127bcbb23749ed8d055da9ee555b98dcd467f7d5e9483169981d99098a5e70bfd3a31a1ca61867323ad60dc604a06ac97b84373302b366af7864f432be7c075571b5c8933cb59a0a81f09e14e335fc29cf8398ec8c94bc482a4b9148fb94b9b8aef798e1c8e53742b1c7e5acf768f1ea4a3c30091584d44614d595a87062b99997113fe975fd101000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000c56cd584cec98415d6025d05f842746273d5149347aef585b107baad37e577ed4c143d883890791c9507b14a4cfe4bd71b14819e392dcab4c9e7532d3d3cd84635befa11598e08149e9b792b26507b3c8413742f8f3232405aa784a0f8d95e30feede9dd631f1ec26f4039bd211b959f6a02fb4d6e6f09b82fa46b7da4e859bfd4da901a595c2ba24690d0e9e25a1ed9bea06f9fe97e48da414ceba168a0175a35f271ebd8349e4415111a66d901c0b6602dd64db97275cdfaf30cfca346cfbb0bbd59726f1f357d7a4f7d8d852213f49cf6a0c0f9ba2000e170fc08738e45ec758c1cafb3afb2f20c40f01ebaa5cbfbcf8a2a4aef3dc4561b0e5dbac51e8d5fccad8f894f1f676e32f42d299f68b4dbafb010cffdacc89cb7c1b5c6ca6f05c1149519590e3d80b9f5aaf1b7d8e352fad31c31b9b777f7c5ad9358de8904e627614d595a87062b99997113fe975fd1010000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000005166bf91b6f568abf419681827f18791ff158390241020a7ddf1531dba9eab9f6825e58629523ed0190522d8ed303afa4fd101786cefff380daa70268eed9105b8f756135100f6df961be557e63abd7a291bdac3cc5104f3c313527a2ce4b977f1b7441877db63972b3613c7828b3cd162d07be245a029a2efffa5376b6b38a264247c0f551a0c5ac5128421148023b2a5e449d07a20fc4805a934da8e70f46f7eed17bfd78c3f73df779f7dc49ef086ca121547373496d5f7fb8f21654035071e59fda4aff63a9701a6a5bab0da7a5634cfc580315cc3cc649183cd27df28bfdcf5e0089acfee300239b6198747f7dd3ee0aa09df680a494995ae73c955795434257e8f59d2ce60ed0e9f2a43a65774191ca50b96486c18d6585868040e8e68f6ae31733f4033380c3cee2f0b753bf58448eb88f4944e583c8eb04b2e1560be614d595a87062b99997113fe975fd10100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004996babf5b87557f7f27548c0d3433c2fabd894aef0aa0fce05f7a858c786fd99c3f0324becbf74e847b8d96db2d5b13dbe690e29816e4123b1759262cf1fa46f015e52be1e661a47428f334905b730b82fe66e647030de5a402e2326eba9c71d416f8ab053d987063183a69f5b8b0e4c8f039bfeca65b94d00b297be48cc380196ce3a853ea3a9a52035e370c120058fcc7489611f53bbb84b38fe073b2e93ba4e348d4d5706fc4c9493b0a199fff9fb963023fe4d5127b4b3555cbe10af04bf50cb915f2da65cb7b58d243355bc6a661d53e841e3eb62cae107a8ae7dafd76a0ee47fe58a8f77a3a7511f4bbdacd03d073179b10a0f9a5c84a80c83ea6d73a36da31e285b0539630f625b52f110daee6b0d7ea677b9ab5db4b2d4d4a274c8b1ceec44ddb1366da796322df76a1a36946502fef2f0e03edbbc13e6bd6aabcb72546d563af187443a0bc2a2a2eaad4f578ca0104f362465440f643e796e8116eda96c54aad19309c7011c040d9f7d0a3cd073bfdd62f17a57b27ebb599becaa7e63960037bff76a0d0e22d5be73ebf8cd9497896f1fb503eccbaf43e3f683a06463ee0a84a8f900477f3ced7fa0d9b46140cc7b720eaf358e12a1d14f34aba2737da38b3c81305ef2c58e35cc007209625fe277d49ccadad389f96eff70fd4967458df2ae9e56a248eee943c0e475b2de6f9d41b019e8295b54c3df91e78aacb261ca710dc8004beafe2791507cafedbb8ac871241f8a13db61b18f8a2a39ffffbdfd48df19c2379a80b340810b8d606b5df7be236a5f41b2da942312cfb5c1aadc30415af9686f11bcd74c668a3d155c06f4d01dbf4a5cacf932a15c7fefd7191358e5fa395b2db5275854622eccc6d65038a010e19b2f3c191cc2637903a8e22450c7fa22a4fc3e3c35929ee55392bf467700f3cb525b20eaf160b552bca2acca1107dd6c80397c773b7c7d4994bd672f4d69b3b0d20ad6d9a8a6aa7ed74d01f2079fd285ce26916ebe4319561833b2db794da8c6862a0394dea04ca0527349d440506d87e73ce0a4b60c3452ea61c26c0b9a48bd9ac0a5d43176333f4cf46f732373e9dbc568f534afd28b9a59d26c4303ce46772768f25721a083f66b77135666bd9f45ccdda977ee4dea2e04e9c2b6248daaaa36e299c8c865798d0e8bbf717c88db70d9d93f83359528cb820652fc43aa6bb97f2309ac1e5596bc9aac4e59c8be952f93d25bd5665cdfa7a1ba63fcb4bd8e207e50d7c876567ea206e4c02dda37e537769bb42d51f2ede818eede255f7743254a211e68e6f373c048bd1bfdcdcff7d3f84ab0e1d6db01349de4a048dd31f6fd0a36e5a39f5590a1dd12e422b745e8daf1f78a75ae13444f596f50c630cc2c1cb534c07a19575f99a701187362cd4d0f739069e30916cc38a5cfe5ac06e76fdfd16e3f3e6e9f4e2193907bf5730ae66df5a68a30f95f8444a563119d2325576cfb1e90c72a9db459c60372372de8559620a33ece65f8db41c0fa0bb07b54977f5f98bd1ff36be6c37b13c4f020cc9e06eb7d158d38b09976f4c85898fcceda2b1ddaefc88c9f5cc0a39d3051da56e1a3e159885d294db8c7aaec98463e81fe3a18ea58025a55ba29e560966cd43b3890e9a8bba6d9cb53102eabeb179870d0bc85907f65dad54ef3133d55b0330c3af21a49fdc4e1b8429d8dc4c96140204270e725c2d1dbac98e31b6dbf44e910d257bfdc6d31c30304367ad4bbfc67a9564ab9881d4242b1fccf7ab4222a3c9a7b8ef0d2b77dcb5b24994f8e204f90ff14b569434a44442d9c820a0b11dd6086487ef307fe8e877da10ff3f24d617724c0c3f365830722253acf2f93169b8d134b1ff08c72657faa93f2d640f4c0f71c9a9fa3ddb4f848bdce381f54ca1bee67e6d1084a0d95087fba857eb8a35d7ea1f1837f1591e21b52f7a4ef629ba38a1c6af803d9c315abcd28442f7cb1005e16782740211ac6cd0be946a2e44bed5bde3be177e76bc9a78b13b02009d025bd068022105ef1c40bdb7d29fb9ba79b76a8f743336b4f09b494c78239fb609c5f62670b2cc10b5e9d445106956215771e0abefa858f21f9e5e0d3802da24b4f1fc4c8fc93a91fdbeaa56062a4960c9f1c3fa3d707eee07c9a4b5e70138ba28aa5e4264c62d52688a79eb0f56802aa6618c65b29bf3267b4f30b1d111c8797d8ecc4d621a311878d2b3b97c002ca5e3645dafb39ac84ca2d3bef516f4e9249d7ceae51ee7d5bdaff2add3c4450c0479a217931bc73bf46abc4effa9b6d1927a58ebf1dc4a3d097597d246d100512f8d16903821e0b0366a10a8670e119f738d7e9204768b2c1ffe5e8a9cd2411e2dc82af704659374178241980e38b2c9a39acc9207097940e636d566558dfbac403779d7764d1dd3cec29fbb91c66b7d6316eef2cd3ce3fd9d44b54b05d6415f313161fbdf2207ffdaec485b7a0ccf926f7e705564cedc7c33a8c6cc56d96e5ee2f9a6b2d4c3b4705c4f778e3c9fe101b7fc1893f838daf53d00d0ec2da7d8124914dd786c7f70c0388dde6d0eb0bd67d957ddc6198970528734b33f266473bd8f7854781d126f41df88cd69e1af04c696826e037fc16f4a3d2ec830fe5e1c0f8b1130f79bcd1d3bddac0e0c6416124a1342481d1f23b1207b71816e96c6fc45be97a7c872cb6a8418b3128da7354a448a667c84f16e535b6e0986cffeaa36f6a7130ac573b071b9e0720f656acfc644be9c3f82135af1cb2aec2b30ac11c2428afbcb13c49d2149d42e24f30299c674b498b00710726c3f1df85cef58aa58b25c02a1fdf8d0df7a89b2bdd683e19674ea795b7a0a90bb91c00f5f48c1e6b289bf78dae76eea2b104f6479c8ce8dfdc88e5fe600587f0d0be044eb92cea51ad87df27a8ae7bdc706fb27872035b3e04788c0fc5db029c42a53f3c496d1faa1b0c89e59e80559b98382ab93625bba1bcf9c965a4b10b8be72ecdc3499d3e3b0b63147c4c70ff79fa7982b54b4367fd6688ca309a55860540f1fc9bb97abfb1d6671073b03febd9f3dbdaff6a766b18eb578ed1472e1e29c9e0bf385931873ae5b97291b8ec26251afd1ba72e21a222b090fdd3319d0000d714f00ad9775afc0155fd39dc9ff040086e3d723dbb7ef2e7b0a4a4ef59ecaef004b83a03a7609f762fd5eaeccf6930fda0552c23899b70b7d3481c50e86ffb00d421cbc18a165a3b2c4f9a1cc376d222916a20b0ca8b9a1a6e8a83d55bc908537e8b9ad020325a2e30d43fb7028fa6d6ee14daa6a10b8afd9dd2e904ef456c262cd8a95167dfbb2e5a608cd7a1cb94408cfb091b0c2140078e8ceafac05c16a344cc1b08f8bdd74615049d440f996796ec6a8d9d4c1ba82b4c5c3969caf77410a7fe929e2b1bbb7f7c2aa49c7a7edda623520400aba7ad7d9785a3a4bcfb33503e003caae48c122298e239a6b39192af448a0a37841f93ed82e3985b5cdf0fbc78bfcfa363867e036ba035a375606e79d4590ca7a136d0c9d0dafa9b75c2e99fd0ec47e332c09c30ba16f7052ed4293d563c6d679f5b045c235a80142f6fe1fe7472db5f2c76618e0cfac0d179fff1664c12ef9c910b7575666b6a5cd75f9b0587b4ab82e73ccdf12d82432147f72790920f7cca8fcd8d0218f52017bdbeca2fce7ef240d34483b27a86f9ba79ce75c806ccc8993f0a71366ef0f4fe29abc4b4d87ce279b56d2d59c7bb34b148cb8f178e9a33d1d8c6c1cb519e1a68fbd33ce8cf9b09094a8102c8652cafb41780ff115a6f8b127e3595702385be4a53bf49d517b4edac5638bd35dd78d76881463097c82a881e701868c6c8c8338b6f45effc3207ee17a56e0d5500a64b0752c1126ca7a87bc7ea0528eb70797939c63db65dc858447e7c8a4aa94e01d3c73f4d94afe9328f333d8099f48862d3be6d9ce1010ca4e719a223321b753c044fbf41146284586e396c84adeb510930323dd58d46fd041c84329f4a3dea2e5cd4fbf693d5ec90d6c85442604d961aa944902b1c5fe3b66906036a6a21884bfd510fe3dce6d92ff7ec84529245f5ed9f90e03026c8b07e67c50d1ae64c8de3f3fb91a0962aff9598fddbd7e5e394d68611f79ff40ace76e991e170e07e9767b6883683795ba42c806dbd7964742b1e0cbb220dc261a32741e99f1f37da231c00540f09046716294d21e20d6ce2b850ac120ff7f31a8d140451427abe8d40f8229a0db0ed1e152e498eae283060bdfa3aab71995fef5367945ec91e1880bb155a9e463aa929b51ed85880668b24a79d167feb61f4dc019c45b08de0711fc2acf22c1152969eebd3547845b7d13733bffe95da4ee4c8985acde3af55e9cd19d885015a1b19a8b2e28bb58cbd224dcecc2752d5c65a78080dda5b9d76c43505ce40a9f09dff652928a56952cbf9032d28e7c52efb9167c6072c835adbdb6d9a1ef9b91a2851419b580b24774740b1b827688f0d39c447e0964395b5fdcc01ab8e29e8976d04d14b17468a9ece8e6ea02b29a21d4cdaf2e5fa76d2e81bdb1921df44573a48051019c1099f7b401abd693cdf825323d8e0eb41f05929a7cf20b5ef19e65d69ac53e1204ff04adb6d1ad09e1b2aa119316f40d5edffe644e3b2dd88d890337155ed9755842008f46f6fc3456fd14e2f4f178e5943cec21d2dd69789297249889400157321b81a60d6f8020f7fcc662a87a1b0717394ffd996c48afcd40bd4b22a0b991459b4f7b9fa3e785613f607fd5ed6f4c142dec0c61086deb618004c8eebaeac2e8956f043340e52e235e00be58d167d1f23d2c8137ce1f35002ce4a104385daa65db01fe935c07d0023af55ff4c940de21670b7807c59a70c06bdad73a1d5362db4beae5f0d290f890f035abcc1b907f587def48d1e4a16d6ba3a3f6d2bd2c664ad21b80250b027bc41883bfc7105f0451994e6232f8eeeb66367b8364da9ca4831b760b91650e54b0178459a403e733876a996b9f748049a9b9eab59f5e238af3ecbdcfa3f1d8099db06e6acf5b9b5aa0178cac603be3c5b1b8a2e8683841fe42f30df585f95f24442e1206b1d8271b76f916648bf43b950e00d1cf734016e8166a0de11c01086c6cdde58f97cbbbbe61f83d5aa3a8feec288ccac34ec1f5d6372f74c95610d67fad69d446953625adb1fefd1120be9f4602fce7bc63b6434ad4b3b291feb75de18484b7dde1b8ddacc4c574303fc4ccce4de984e6c3f7fb747c143688fe07af7e4b719d63bcde702bf099d8cfea59bd9a8bf06e2ecad29be5af7100eddc96d7c027d947928640194f4c7b979a97669af3f61587e5ba22895bc17a44af79f6c6aa4bcd2d4becf67325e143a2b96ba40c8f202eb945b903be762604ca3567dddd9ca0200000000000000002b67ad05000000004bbe3f29457449cdeddf065dafa058f08e9a5ac346029150ec71f6ea994dc1fed7e90683acba6610e4fd795e9d40c22f51a2c12f002eab877a420c98a4530e682e747e322d6bdbc278a2fd546d803e12bbe5d56e92bd0ee397228468a35973ef0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000042c8f6798b0d686b5a91c61613aab6282661201137b5b86e5fb356c186214bf3d5d038264cabffc035eb5fa4688996a3eda0a7d8b89be9dc75075557ddf9b14da5dfe97883fb82c0f2e37a8df7087b1383647319e94be2989ea8b905da37f5a86899180eb74f47853caa5d9d5083ed08225ce99ee37c03e6d877ae9b78061a5a276d88fa4d9fcf481a2c5ab37fcbebca63d51103bf5b711625786042455cc35ae7815b0c46393ba20dac81f976c173ccc31dc1fd04103c31bc4ea7443719ea28b4655dd87a34bba89b6afb59dc640902ee41ed662d88e71166c1115d951d20d5b7dc84cc56abd4ebbd7dffc5aea1cbdcff675ad599ba7dd81ad6abfb2364465667ad14945482f67a45075ce8a64fa0896bd00724a821425e8a5416b0d99edb0e605be4869b2924aba271e0a6294e385380cfdcdcefdca3cf036256a22a12b20e2df112337d51d7e126d6ad2db3de4632723fa9f4cc1708197a862d0244e129f506d6da25cc6332dc1f9d20250cc290e505f07037ecc81d31b3ae0f55bcfe918a0f5d259a513502081ff009cecbab89c251c6390dc11a2189a0eb8905a3c5a4879b61b53d4e81103155c8aadbd729760edfe8bc4a433dd25e35bb10e8d1de17686706ac36c8c670ad407625ea6a570ae22ffdf467d9adba7f7356cb67d44ce7f4a191acd59c0c636175c1dccc0ca81aab5235f611cf51394849dca8de9c3b9b4d02222d868d15e232e85a3f41ab82de29aefb093e344ef5bf96717f824e4851df54d3db395493a818e0286abda10a15821341dc878d0d99d9685c11741cfa222e8fb0fba265531f1767e6a35f3d9952c99297574f24420bc7dfe03feb05380815b41c437ad49bc79a0b5f08270be130e2aff53691c740f4b0083c7243817ae67152b06f52c6fc5b409188571b1805b47d8103405fb3fe941fc9358e557f57f233e9512477efb1c8b9e49a4e09f87498bb9649dfec60d92c62b8fbc79d2b79857f756c00e32b5bb7cdc464efbe62276457526deb7d7bfa1e8bc5d2b6ca408ac47c0701e8a4681e308d6b0ce59665df43587d6a07ea5292152d542985842b4209ce37f3d3349ee4ff64ed306e40cbdc9b5714af7d491cd447cd78f4a23a6ddb5e86e1750f4e01114ef89230eca9b4e6ca5d410ff2e2405016b405582a54fcb9b3dd172ea56116e8d8d3cb8a6f3b2f4bcd26e22cdd41ab89e74ad6768d732e8fabc937e1994779b2f8db288d3ee0db66ac2c83c1c7088e4d5936062d4b587e93102d00c5297c05282c4ab76c651549a03dbba1dd8c137f63e451d697acaafb2850a1bdaffd620341986b211dbbe827bb2c8009bf4204f52671c7156c5feb8cdbce977c047e183e91156db2b11322e9172576741eab1b3cd5abad414b63707339c83fe853ced0e3b76040d7faf5cd6e211b19a2a4928ef7a92e94dd70e818c797f88e23ec81229d3230a2762ec135b325b8f5c93a6d0535a9c912a9b12b753d922ddbbe49bdd7577d726eb080742018f49aaa63adb084cba6362e286c933ba9039f2751f34b5bebc2a0bed450d63c1dd772a5a7fb71c25851fd7196f72670ab82854e28679015600aaff680e73253be5c8ee16936dc781b262ffe66dbce78f5e70771ccbc44e7b45b75af57700c7a52f39da007c7d48c9363c0a00a02ededf62b18a98c59eb91e1cb0b74dd1aac1e1fca94b9e34cbc1fd7b060276cca7ad3e14ae99f82a434358b67af8ac3e38ec2a006cc2fdde663b7cb0ec06a30dcbc9f5b227d12f29ae096a1b78401e95b4a5ff84b6595ce0f516ae668b6a77fefab3fb535a01d5966277b208588cd2c320735d1ed740e692cd31a938f6ac22ef6d8e94016da7ebcd259a16fd5001eb936e09dec8df3e749829eeeff2378e345b52a3e320bfab6589adfa50dabfcd89fa5ab9619b65e1e1f49c93b3e3958b4fd7617413f27ea0ea5d121c404b8899a42b2e46c7eafd4d3c93a022defb2764b703ebfcc016357e0f2f8bd6ceeb276d806a34a572058e23b6194725d5dea30ddd5971b9df74c4f30a761133357c4a254cf2389aba16fcca77dd7927fb53e884a55d622ac0ebe349052ccbe1b9f8e67d9fb0796f481bc211e9f2657a4b9d6cfe4e139bcb178d7134267284a2f8ff384989af0307adc8e68631588c1b1e10400000000000000000000000024ff4c6ff6041bbe7673edc323f1fd0508bf2ab6424fbd12782f944471f002ac1d5c929ee6070cf466acbae0a0fecda5dec870f29b545da9415be32f659dcee62d3795e1f014646ecfda62175508b98195356a08515a6b7b553487ace11274ae000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d362c99eeae4056a70688b3494b0d911db6872d4ef6f34a1c3d65533a6ab6855b571330a6e4bb97bde73c14f27e7070e0df0b230a6a5b777c9c342a92b51b52ce612c1586549f7a1f2dd0e25a2ad18d4af92cb350ac2f96713069c951408c2c1565869a54b326f93af4fc9955f577f48671a0334744a123fbb915f1c6dae2701457bb1c7117b30791747c5a5a2f8e41c2cbdfaa233c7d8d5761908b1841ea4ab454b4db465e573581c597e8db81a4b88621fbc1de27da52e98014b5a4127c2f3c5debdfb40a92f55cce0bb3681912a33521196736da25452a683bb8b8ac6b39d5d2d0ebb346ccb457775d1555d979333f4cc838138ba57fff8428c06f73dc0a821d57659acc2b8a3119bd8ba0f208b29d71c7b33b304089acc6264ddb2f422b3eacf3acb68faa20663cee43e57e2f69a41ae6af54e98d09bfe6eb1e58be0732912798bf4f25978929d8364e4382048eea563dbe40692b3b722679a838bea7103b81818db847b9f651a1269d502b52f0d00ca1241fef51ae9787dfbe618a0a8ecaf1766a268a73dbb08af2f3eafe6aae0583c576cbf8248f74cbfa1f1d012f675d7075a60ec05409e55fcc7e896a3cce183ecfbf76940cd40d97507e2110354452da584a2fd6b994ed5e399bfbe69cc0011180e9b17a30218d4f4803392d519367f8f705a2dd4d470e30f0e79936259a581ef6df6aaf6846b6d2c73de37f5d2c45dc4f13bca8b215364400ea5a68293628f24af15077d9b20a6f7547321095a261382df534973766e4e5c9d77756ed52301ae9cc10b812a15ddcc1065a522aa65d6cea5e775407c10e65a0b45b70b55cf2b612847780ca65cd6eebe219c79dc58e36a98a6cfb28460f23f2fd9a5e57a61183ea2db43d0b019eec311f5eb0a53164250b9f242d516a1f494de105d8aa91c1bc5e5fcc29add4522ca7509bfb16275117cfcbf34fd8be53bd329a17cac8ac08d72b48335ca90f1eb98fdaf8dd0b40c38a1a5f0333070176b14bd117a342b3176db05c969b3b64a8353ab4426f61f350e8318b9bc7d312af6e2bee60dcfebf2a0033a7cac34dfb6fc5df3bf2d3a8bd5b4ff7b2d6fbf6a5a1979f5b220384c37d1c8e464164444fdd78777702a3e2a921c05a191cd08aece3e1e8adc413dc6eed46f8b60892f5184214e0ae2ae7a523f779f4b81f244b1cf5fbac2c44e72fc3f73a0014fb7dc8fe0952c943115a22ecb764a2336f81c395fec6a2f480e297cfe9f3f5bd8eb9a9c3063117f0b8439787175b669de2ae02a31b7a1981a2be8949e45bc4124549ccd36c1985439610707159459ef934ce300d50af975098cd70041e40b6fd8c0c55017157f467626577fa424a0a37662294767d605104c282d498d5b9897cfa6a9622ee3d0e9782fa8cd424f37a3b65ebb5e03d014e75f55ebf3c2acc64de250c56dafd66f2acbecd6b3ce25aaed5a076cdfa675a262783162bb953c2989777649556f1e95fb38d011b24da90836381e21bda76eec592f1ec6bcb7683743a6b34d40570b84afd48089f06ae4a9ce973b74a242455e03a8a42df9358082a338e5463f77d50f4f657d64938c4e726422f83178fb345b199c43331649bcfba8e7a632706da34d48cc1d8c185fe7bf39dfc62dc93b481bc8c9f6b6a831dc8e55dc9f8ef3b622b2e3953e0f56eaaaf585d68d9938257fa2067f68c2109fc82231317d762c9babfd783b96f722239cee4ce0b9762d758bf66d329db7c59f2a386c84508249f1d3021fadcb1270dac9025b9a2fb429b70f7ae11446d5db63c98c2ca8fae39ec7bd9650e8219b8c5fd708ce8b1301ab4a467334ba4b597ad74dafe8392f993ecfb007ca2fbf1854dab2babcaae217ddaefd9acd1a9decc2f9b73732c7d3771ea6594a93a38442b8a33d8f9cf283bfa532e07c079319f37d3fcf4a14808d6f44b2d4bc640b406bd4bf30fc1a06b526b655c11887bdbe592618646e26e8aea67bebf239a5ed9283926f8f9c57f44cab3abcb59803c428b2e49aaac705fb81e19d1c114fb71fefce54d3a0c3a57274a93efa1494d49ea165d2f636bb94437f61fa586f3c8246bb7ac39124b56311190d624378f7601f4ab2cfdb78562b26e3ab1870762f1d5a50e839c63b46f00eaec9aad5ba712817120f9ed870a4f11a6b3fafc722ca4b8542d7b3b945beb9e0751b600533e6c9479845d41c30d222a10caedbae942a86b1306f3cb1c95aea07a7cfa50afb9e40cb092a8c1248d937aa82f70984d3ba7a8a9576df1e0db7a26d1714bad603597e01cbc53e47a0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "516a516551", 2, -1943505203, 4122551051, "43b1d8cbfffb6cedd4cc0520d5f09e054d1ecf731ee963db66f62ef4e0ba68b5"],
+	["030000807082c40301761c43771a54e23e4f332c545a5d1f75a205e81b2ab66c812927ad2e43cf44160000000005005253ac51c6e039db03f9ad26050000000003635163b42f51000000000006ac5251516563f3c3ba0100000000066a00516a636a9d153c71ab8cec0300", "5365516565", 0, -1151546538, 1953719636, "eddc3821596ae2048cc69969afccce8fb2cea7415836bc23c6a5fa23331c2ab3"],
+	["e80bcd7c020e5258f5f4cca89fb8286fec6c27141eb94235babb37e12ebc62bf93a7337b410000000001ac2b3050455763ed33fc7ce55b8b6c6c5cee2b5be0d0833da5b61b1bf028a467655e4293e501000000025351ffffffff013f579905000000000500656a526a1f9869f900", "535265650052ac63", 1, 83213798, 1537743641, "fd9e4f36966c9a768f562b0a454708cd72e12d865c516e2895514367f535b8ac"],
+	["0400008085202f890112fb38ce3c95304ef4b1d207430dd2a97cb82439bcb632b07523a76a9523d13401000000026a6a4b748aa002ef7de503000000000753525253656551bd7390010000000003acac535f8186250000000018776b050000000003e81e1d227d93b070e224d8804653b1611b079317c81e5413bf8bb8af3ec24dd4df65ae390053ce489250660b38a5918432bb5f61933fc80d7d17e042c1630a0ca194f8428c8c8e460f74535b44ceadeafe27853607f89cc8551e0510b0697b5c98bb09b67ac3637c11cfa5f9ab1fd247320ced15348788c0e94ea1bad65b5a3cf8dfd3f068222b7dbb6c2c529881cc878b0b2289a6723adf25c6836942adb5188c7a094652a605f95e2d699ba795ba5b044e8b7647332aa15e4a0d62f32f5be99c460bb9da2b3bcc3a362e46faef385650a7f22a76661b195e983b77268caca175893de683b5d6d46828c5aebd561250fef057e871fdb642261c7ddbf8e4519af6b85c4256b33e62793d5ce5564dc9dc0d0deb1def38c42c4e3842fc683edb5a4877612d0af4d8605502576452aa2e3377d7b6dc765f9048867d7472ce09c2497a26d1714bad603597e01cbc53e47a00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ab5efb669f083921fa2f14b39766157ea7d6df2503b7032dd3bf940068eaf641522842811b63e228a1a5f0d485709f84215a61b34200f301dd58f950b6b4c628bdc75e6959fa83bc8f2e62a229247444888a9593d4556039f0cad31a2004b158a5addcfce2ab22a563c68e475edf670f9477eb8afbef10c71cfa8fd0efed1ec2ebc7d493f7c6380c60458c166e9591685daec56780355288b79f24e690f6afda72415641f88e85ff85f4bd030703c385c39acc036f38d262a8d0ff7722fee3cbf75b882f7155795d0c3fd2ae5803c6022670e530f32450e8cdc9f226ff6d488786bd3553441193c557d78446235eaebbc04ea4b3d096635d8a8434fbd1bec447f32aa66544efb75d1cb0be88516c58650f43455a93d291648826874b7557ddd3338a4ce3a662d3032d07b0c20985bd13848238117631024a110150fa165490177a26d1714bad603597e01cbc53e47a0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000011f2e822f9026d765a5e97cc2c3d7297feb31b729c7be39658c213e7d92b17c9741a52ee47275f7d1d5f6545a2375bd2859873b62e574eb5a48cca4e472c1656e4a7922dcb3b2c1b0ccdf5a84a191b277a33636a0cfb8664c9e1f5acc5c8ef6073e21ee17960b6f07627567ab6ecc5c9aa3b84954afa4d8032c58f8df894c08cd83ca1f76c63a803ac5cdf6e425e9065e9cf10379c312cc8508273c800c250b823c40351ecf60c5a282a541b4f0e026d943b8f1b0a650c08c686801d76e67ffb7b02cb64b7255a922d1356eb9a30b9ff1f4d1a37eb54c3955a80cc5bd8da7566bcdbfe73f1a005c224e1663aaa7e682a9337ca2ae8c57ac28a462b5c1c10a7dc39a4eb1cf75855124e8fa85f6fe9d2e6f4888fc7aa5dba3a3fc1a80a427bfeef9512493f945a25735d73905720f04c5f9a08128ecc56efba55cc488e26a5f7ca7a26d1714bad603597e01cbc53e47a0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001579f03df8b8522ba6f88654d33db34b32f379a53ceb5b4b832c6d7c3f11579315945c261c8ba029ab32ecafa0c055ee2b909c1e95633be53904b41b50bc7162156e28ee18148648af4e763c49659f0e5ff78e6c22ca04c1c0ccb95fd4f0bf7477e523a1963a68a65870ab2f8a60d38df982390dc1bb16849d557cf25c14a5bdd8bae9571d3a9f773783ae39bad286dac699e3d46781ed133422c18455b12c6cf8b6b37eb7ee6eb3b766439ed51136126ea86feda50d92095ecb879b044b91aacf1b2465b6c2af856da230c8a1796981a6d25fdb157e86f8de80e04cd175588a060cb43e20bdadb5fb40ae0bf7bc39daf85925c821aa6f9215c89b65b6fd843c6212edb24d3fc6d7711dd24d70e4edd1dd4dd8bc4fd270634d1171cb7eed78acff40320cf6f8a1a82ca89de54b0348572a102a203af56054a3423367b55bddbb05aa077961fc775ee1f17d8b71cec71aa0a7cb7bc02fd3f40d2b1ae7aa6f28b94bffd5362e8e80e84d28b1abb760bf61961037db1f8f0085ce08e074854f71c998e5efc97b05ef4bc2299f8641812dd21d73c769a7e3e25eb2a31b3c49dcfaff0fc57bf771983d8538d5db3f6892f05d5daee72cd24286b57565c7cf6cfcf8bb7074fde7dc029248ef6bafcab1ba3419a709329a0749d99a7db5ccadae277f2d35a996e9cbe545d7c27491faf08ee70694bfd81e481f3a2be2d701ab47b0535f6cb4206919e426c4c01158c733ac865362520c11b0b59cd1c9ca7edf8e70d1905c9f58097742c3d6a702661b62897dc9223f8ef89a0cc9001734c8ede0a80cc71ee688087c649671df6a93c0aff09969fbc3be840361e1603e60e83de97adce0d0af4c7f186596b7b78a71a34e44a145d84d041617b0ec98a2e66991910f9bdd0aedc04930e4eb41d266d744d150802c3e06b1a710b87b7e5f021d513e4ea0450476219b6f82e3fb6e18173aaf5b58aae4732f3768912856d00994d75b92a8041a9149cf272f9f1441d48c827af3ab87e57c0dda023a554882059f649647aaba1a83462219902758d5aadc1cf32baae0244ce41f65655cff3ac927c782988350cdfdb6f2f5da34f9473ed52a64b1e288102338d6156ed0b8ad061a79d9f2e9fc41e3c0bb4088e08c688531263d5b953ad819407683d4a9b98d3ec4f25356d0bc8662f2e35200ee416999f7964e7fad73f784ea5dfb1864d64c3a588f72abb0076e9c93907e229e9aa4bdb096e13bd2cec7b0c8a0adf86f3d7710dab9356c521b54556f943b2ce31438fa835e637a99bb1be4c09005938ff32cf496ec553d708da239c73ae70757bc1d8419dcc8d5e6a40a542fa63021cf86705000000000000000000000000cdb46324bcdcdd690b34c01534f2ce284a4307c47ab5065c5b6d49bd4c6e0a59b6444b337107d85c54b963bdbf17cf0cb6339ee8d45f92402f1fe7ab81e9c4a80e9fd541b5ff69c6b3a0c4bbb0cd1054cc6ac21995970b48822f24bd0aeb5fe20000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000042453091c3e1042ab4fb6a06a184f1485db42b9c0f56800954f2f0328b22ba2bc5ef22eb3bbf9bf94252a1bb3ddd75bd31b782969e7e4c5f9356ec57deaa316f007bcc4f7539a0e5f916c46b4ebcc7b53dd108fc7140474414f397443202a82e1995b136c5bbb72afb7e3c288c758f38fcb9a3f9cd035b0a72f680cc4cf03282220a3292c5cb3e452f5ddfcd1d1f701028f863308a2e3d381f1adb1c66e5d2f89428b993ec88961e07615beec891e6947a1ee41c031bcaa2340905379af47a76ba9a09e2804f054c0cc6097ab81702b9399762d93ad35d2254b4f1d951d4dd05e973793d0fd9285900f6bd1d53babd7aff6ba88bdac92e312fe3e7821593e7256c61515ae79b38d85d629f8fcf08a596e313c5a9093a9ab265e6fa7e192c6add64be8c880790b5494d4f40f330929a63557b00fef41c4b1ab0ecfe6eff94097039249168aafc64a9a0584ed4c3aaf4b8e721e04205a09b7d5bec8951e811590e3a06e7eb1092e5bb122dd706a14f28dc061056922e01b4d54ca5cc8f2d5e78a05e8bad231cd508b0d7a0c0956fd9902e08bcb336cd151a10218deaf7e327df87243cf2df1c05e8808aaac4f709ab9a729d7f287df4a708bb6587d2fe45760409a406c2633e17859cc6ca943a82ec47007d3ea0c62aee027b64b8b7c9baa8e3f7cd01e6e716f64c36d81abe387685cc316b77badf09e6887a1b86d9aa124055af9cae10a4078652019dc14381658837a74a1855a3642d37099e6f8ed052f06f7c9d8fa34455fa3eebb9dff2933bb2c20e5a2a43098bb6b137ffd45f951fa51f1e0e4bb2b0638d68153e33e14c3811bc1051ea674042bdcc7e98114b8be314deb9585a60fe086846a30b265a16d2d013a19b1d0c0eb461fd794aae74cf182a25b060cd5105f7a2bdef53a381f1721b859a80fea58bfa65b3374ba406d268c35428e5edc30babf3eeace8a5532b8d399ce27b52a9b35bc9941b4e839ea208dc8facb7e427c2aa9e032c4884a1a1c256f3dc32f03eefb1938e38f70e75d82087a72490de078b04b3d0f3122eaacbbde7bb4d83603ab397b1a9fd159aff7f2e5de1e4cb891923473430501307d1a8f4a16f782253a211be3a71d6f86db650364a9b9c68294f12064fa4db0e6b396480b2986a3d43fa6d3258c00463ecfdf857280399ffb344ecabc79f84f7546d3b2a36bbd6d1dfc995af95fb9403620d0d8db3007f424aea4ddfe6cc2ac2d528e71154822cea708be6dd1a77a3fd7e9ce1f2f46500ef7aa6ca923ae30a5b2c9cfcfe97753dd01fc95407e99ec9f635a8fdab7da49406db3f6908e2f9dade8f15c710266c1aa86ada6ec0fe3a3ce022f68accef37662474d232d1f7ca4905c8b7e5700c07caf923be3ea14d9c30f2462f252c2c0a69d341c72c48287c48c6baa9daec5cffe465f7ab4c583626946485f64f4e45a68a89907252296b7e3b0d634dbf4e4bc0256f2069ce89a6b09cfb412bfa6ea4da271ff674c6c9b0bf609a19b2f510b28ad22924f1f221586d0fd4a77ac103271570839819a929acec4a4320b64377d34752912bb03f02c1f6afe9158ba2fd4144b573485ed1e3b7152382d4a986c51ca427571408855b6338672fc99c48acdd7823a3d979043b3489067ce0d4854fa1225b9a91527a22440933ff25df57fdcfe2b8cc34f5245700e6f55d2b728e49348c2a77bd71e27eb9e9c491e78d0abcc38deee24696b15ea6529b19f3200d3a9d2b1c0d85a88485bb5fe2f278d5e57fd1b946169f542c4d8205103314a2f9a65121e7fa09a3e9a9d3800135721496d0f03522c623eb18e6d24e177620f67caacee36630185de0e1910dfba63e4e222b2586f60d3cca81130c2e2c5d608b86ac8ee203bedc80ee8a6b5af1552f6016d1a24807cc30428d00830c420d30101eaa79d7ddd8a7af682ed2c81e0f1fcbec52a7bad69bb0186ec9dbcc972cfc26acf243aa3f40bfcba9a73e331195bb942ccda62aa01c8b134963641b3990416ce1822278b51bea6262427d804e9eb963345ebcef82255410adef87d41a113a6fc102c6e1174124d8f5f5efcd4c308ba95e397be87ab57529a39c13bc033a75fc91ba990d37904590e11c2e126969a42fd65a8f010abbe1359d2ac00e043d25bc9d8c621f5561a7000000000000000044c67601000000008548ffd3c4d93703dd0b765d16974c1b32176ebed4beddddb804cc9b509c30238deaa0618ffd0316a968db74eae0c3814103542755911db72df18b8711cd09cfa4b61331f017f874d4c9e4b58998a7138f086a6403f1c42e5bb43eea6d9c1d5800000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ff0b85debc63142fabb0b11ec715df9a778df458ab4725c57d547d44341b0c0358acb8a2e65256810071ee29aae17597de1735129971a81ddc1976bfdd6fdfdcecb70919b338df23adcceed12e61258676f07fc6655ea4fc3d4e34eb1a8b60ec5183a18f2e5287f7d0b6e3fa1e68b9e66c3fd4643a6f39372f0ec53f0c14c8dc203a1b2d416e88e7cdcaf8c963365dd0bc98a0b1dcdc0cdcdc8b11851e5cd9aeef4a0c849a2114be8f5559f8de87e1f2730debb49ae5b46ee36d2d07c6c90eea7a791bf77f9872b27a81787d28f65c481979b6a4c73746cb788923f967a722253d4d50cd40a31c40a604f37853f83fe875e2c40737039257cc53ee69af1a33fd1245aa204ccb9dacd0f6173d9d3a4d9d2f81cc9f587a1316ba963b4c13d8365ddcfd3ec1827755adbfa269db21be981358134f4869160f7a12d5e4c8347b7670880022925549184e8a515192d319ef00dac1cb704d64c57bf1756b890a3eae6787f77c14f39077dd0242af240d482c6ce0ff50296d689eb094918757c7843d772f680b6ce2be6e612d76920954e4d885182f7ab53f9c6d88bd586bcc80cbb4c6f02564ab59ada5e113af66721f5f97d5798e78f91713e5e087cb3a41dfe2caeb91545f236ee5a8c986d9b5fa6493dba2d0c21ef58be16b504095de2b3bc2497a4330b2308902a8f26bbabf7e8977a2551228f148ee41d4ed20039dfe513bcc8f04128a38d03ee2b4845253eef848bdf30a03de37321dfe543b9d8a3897f85869ee044bd391acb648c114e9234a33f4a915a349e3eb2a7d1be66cc3d29ae9faecc6f6407ddd68f5289bf739ecdc0d45305897dcc6319508f54b65a38c20f07396d56f5940c0087b32dcfe8f77fc18d9a05bd818ad1868b8db6b3f87eb7f957c589d771aa28eb7b081fecbc66395b1f7a72946f53ce5ed6371797933e3582540a524199e5d518a8982fe5a050a80e83c0d674c4fd8da0e452f9f52f9e8e89a5a55f0bfd6ebd6b95d6c5bcf70cd3765286f1e0dfe824c0804363a9e9f11d47765ce6f02d3c11c51edb5ba6045d1abb48becdccf72aeb8d3a993093c30f3256ba80d94e95587ab8040778f83f7aeeeea02c06dc50e9e681e4cd34096b2df9e6e2ddaec8699b9bead4929ab7be0b4d098f737076527900bc568b6f654568ff27b24a4a8b68db21bb81a9aa7d5178eb4aee928785604522bfcbb875e000562a62d6f47b9e7b3a9cfbdcc3dbc210ffe22177d792a63b3c5022d292286f6fe7e5752f7c6138875b8c855b15747aeaa8727fec560d871e983776a3ed7a8063bb3414509d9482870039abf316d3a556c171a0a7d03da294aa294332b387359954dfe5b02e88db9257c3a5c6c14f6d24a130d45617d4fc9708cc20cd3af4e69c21e7133d9f100b2c4c1d78bcc0f982eb2beb2ec00e17d5ca3257fdbb3dfa8277972b2e9479a50feec39958436b8290877b51ec0950d7f60d1e82d9e23585da3ba9b3e0a37b0a1924ef42d7e1368366040a992f156ff7c49af4e87060fe80dd97cdf3a5f2128a5f1ccbdbcf4e8e478defa4477f7f729a33c09bdcf9a63e48422934bd90290cf99068171ac4c0e4d8f28cd218dd5636f1e2b710301c413394b7fcd2b17d8b9211e564a67a7f17056717952928e076b05790e15449c060851dc49baf784cba1e8059ac15e23c260cd2abd7889d86d9ea10ccd12fd8a626590e39ca8abca54149a2336b1ecab770f456f3510249f704081c9caefa4110b267e40d38e665b35b77d6c1e0719a50b6e55226448f84899fb216045f971c00e8750de41bfc868996824681195051d175b86dc6481ed065731381de596f06f2beda3cfb9cc4fd1d3f6ff972e9c572284cfb40c4bf94983b73cad9a89843de1360fe133985e8141920b89861ebe4f9e0d337a31ea5ea57e20da9a13c628c979707d4c093038f26eebe775e383ec9eb53bcbf9f8fe274f8187b3ce768fef6ab2d705a928ef0cd374366878211dc818f7f5fef6a4feb9871f0b0e6bbde443018cca8a7f57a272efa27458cba342d48d2c07aba54ae6e2c995770cb2251d0910d4bfb4672b193adbee8d6898a2ccb914199ba2070349fd63841ebc584edf21af76f962b5001198d204ab56fae5293ff2462b8629a02536d3575ecd8cae4227a7f92b3a6cd1892c09e81c66613affb0a5cf4111d4fe51f2915b3a3ef12165dbae1bfc473912e42b330c357598b734ae8b9b22d58e802b0f7b53a3944be79ab25f6e41aef2ead367f7e05eed64530ba65781fce4ea2680e36cd1ed75b6ea0500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "ac63525265", 0, 747929140, 1953719636, "8411b7fe7413f5a33f90ccf200a966c2a7f6afc7ff074f972aaedbaf092d9183"],
+	["499e865201bb88a8ef02dc19d25f0457ae871b8cd3de6d0320249480baf908144d6740e9c201000000026300f5ffbb1303946b9005000000000900516353ac636500520b964903000000000500005251528a0f040300000000020000438d719e00", "ac53ac005265ac6a", 0, 1222764124, 1537743641, "26fe841a4cf34fa51990a2eb7848c17f5554ecaa2044ef6f81371b122ce04a39"],
+	["5eb9040404a53699c856420f728a4ec468c347c4e960479e408f5535e8029fdb25a73eb3de0300000009515200635165526365fffffffffce4d7d893adb56a315793cc69d16811ebfa2ae36185c2a3bd8fdfe6b5fc6276010000000853006565656a6351ffffffffcfbc5c0b5ae17b2758ec2c4d3a530aaf70695a2525e3b7c21edef282216874cd0000000006636563636553e6d21bc41faf3f2a14fbabd05c962c694083601f6aeb62819005f3752925afea86ad1390010000000100ffffffff035666da010000000004636551516fb6cf0300000000070052526aac52527521c20400000000046a6352510000000000", "ac00", 2, 569556278, 0, "c70444510b8db4d382bc1c00548d98b221c0c721651b57f49d422320c328b3dd"],
+	["49cd713902fe7553b82516c367f972f09ce75e1d8f9fff9073fc37e94d17602b048897a95b000000000451516a6328e145c0ba173b068c5f78e7b19b392ad5a9700bda53520622f455b1d78693b0c3859de60100000006ac5263636aacffffffff04834100050000000004ac52526329d900040000000003006a6a22d3ea00000000000952536500520065ac53219e3102000000000663516551656391d2594100", "63ac52", 1, 626800990, 0, "824f040f2c69218ae0f68d7b82a0a26e07865fd0a05d83ddf359493aab12dc61"],
+	["10877c430182d835545cbb56f2a68834f08d4aabc4196de94005f3ab79a8a2a483ce83243c000000000600ac6a005153ffffffff0494a2040500000000004a0a3205000000000765ac53516aac521d7e33010000000007ac6a6a00ac5151b50948030000000007650052ac52636afb944f4600", "5351", 0, 2134757024, 4122551051, "9644e5b7b29e5a5d0b7a30b03345fb65e22710defe32b7dafb7a77c8cd95ff52"],
+	["0400008085202f89029dfb1c852d2aa54c685a59ef3183548128590d03d181dc5899b3dfcdaf0855ee0200000004ac63516affffffffa36d941be08e7b4518f1da734afc12e4c47d53ff98b35eb929753ada065813ab0200000009656553636553655152740cfe71014fa8bd010000000009636a63516a636563ac00000000599e61150c0551040000000003c5010a2fde291bfed9b1e2be5ff156b920b3dc8510e3fbcd7ba5491389266bd56c1a34cdae36181f56c27e7cdecc7294680cfc7d3bc500fa5734e9b9e0f42205617714414d6a42914750f0cf5943a96b3866ace70b559bc2307cddb0298780f8045684fb653e7b0987a7948fc51f3a3c056991feb8e83f6b2cba0db2c95dfd2d4162a1315ae0bd0a3c8dccdac4edf6fd1d833a0b2855e7ffd4068eb8c3a76a132a3963157aa421f8f673bf5fadcfc2474c715384c131ded9e43cf33b4a10be888630dfd2a09d15525d6c90895b2c78d2dcb46272c71d467c8af6e6161685cd4766e7d19afdbdcd1e9a523724548c34acb0583d377a3b2aa0cf3932cf00fadd2d68b0fa4da12b119b86c6998c3dc262b1880e8b78607f7157515f47e56aa64730948225f57cfbb0cd4409241ae12a4d0c7ac14aad0be6a642d13b08c2b89c92cca65781fce4ea2680e36cd1ed75b6ea05000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000b5729d6cb6bcdb4832412cae010b91606bede9e897a266e604d62cbe28789285c7ebc13c0d1257bd0d2a8f7135a7cf167bfd72c53cfd9eadee9e7c8c4b44370e50c9a682cfbd6bee3eadc6a05d804d01c84ce15430ee3fa1d134c84932c65d52dbe671a397961787427775b22436da531ee0c30f667b80d4d3212339f9c347ce57f78828f98e8f21baa16bf14cb09c9f426956714eff740a5e5b279d07691da9723cd1890dc15af2e61753dd32aa3b0229cf6355f91a312bd1b798fb494dbe02197fef1bb2c994cb05b11e6dedb37468d3e0700b453469fef659c0cc5a8ac15e5d45019b0ffbdb1ce60c931bdf3754c49a379bc0b77f10616e9f1e34996f85888b79a20d7af4cc9d68a8160ccd7dfa70ceb12dc261ef6357fc7e0d0d9b2724771964004ece894423453ffae00a473f8ec60bb7af1e6ad22c3a5a536b4133085ea65781fce4ea2680e36cd1ed75b6ea050000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000914d2372624f675e6c5e0ca17fdc24cdf163b70622474722b0144587d62cabf882539fdab4e228e2963ccc77aee3fcd26b3847760bb0e2a99ec8a1cda53ec508ceb54c94a8d978ac8001eeb7217fc79d4b1401c9740d5212dfe540b2973915c54616705f32fbe37f7737ad7b8d2c5e7d54342cb01c0473b3002f3afe4eb709a553901214aeaf9cd5323fea826f440490e19d86c94a0c581746fe699138f2226634820888a0e637a5f6e7235a689e8fc75515817bd7b929daebab11bb2a5cd5b1ad9ac9fd48d28aadc249e5da2f04f3911e5c810831a2dcf7accbe0064c7e49da9a4d730217addb454c1f2471087d559940875ed54c7233f10aed0687964db80b99c8acd0e174c31492f8658d7c8a5c353d61e6824ed88f9508b1fa718d8565c61e31c77ee1198d2ff20aafaf399cd813e0eee44b5809d4166c3476bc4ee1d47a65781fce4ea2680e36cd1ed75b6ea0500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001bba4364e264d4382e25b1fe7bac492b273b859ce6c27a0d1d9f746f1da09b78888e0343fad478f7b65298fc197fc5879572c6061204d95fd76718f30960ed92ee864127af3357bd7759eb475c1bb9d57200078fdcca12ac4be34de2c3f40052f288c78008ccc96c07149bbb187abcb80e23ce0bebcfc73f08b1c38c714c74ec0bd3276d724322e8a643943251e6676eb01d52c2fc59eddf89434828041e785d11b762c36b10321ac05450580bf467d6adaa42fd0daf7ac365bef90ea9665893eb3948327481a92687310a4d180f9128ecaff599659dfbd402b43834fb65ed34ac768aa6cf9d68e9eb4cbbc5038ff35c9bac8660b05a3965414d28967ae322256ae768ead63da184efd8ae2442e51b0d256560b53d90ff9b966f7ce91c47a588d0ea787f8d99a9981a689b380de9bc961ee7b182f074a5e3990441eac090d3cbb2aa65855970a9e9c2fde9a1f8606da4a454d333ebbc5ded47ff9d1060c5285fd9ee926bb877b541638cd0bf2d76e11659e890767dd704e7f6712d1575f10076b2d2b563e10df3e2fbad844976be4eb9292f1bd3c03068263df6db8fde0088efb23df3cf268b4c5ab624ae8c7b0daa5c9da94a95d967de7d99db7785940b5bb3534db68c6c539227d553f058d7cb143d748ed373b9fe700980d4768a91e43ac002a3babe75c57b0b624f1bf33c778a0de6841c225fa88260eccb1daa1de94d409c4ad82a6c1aaa09ead2c55261d10bb7e40346e4c56796786aff258eeacf3ecc69a518e0ae3b41dfac04caeb6214007b58feca274a83afc57c9a3acdeb253e8b5dd1991a17407be05d6aaa6c4926c566a847bc5dbb4d0956eb0f9f2ee2043d5b164704dd7ce92760a5541fd20ec76265cbdfaf7213e02c9eca03ec4ea92f7edfdf5639ce6da160694faad7daf031da642742105b51f7919ed6faee387933966ef95c5679b00f100a7a21b98e3f49aaba6df56b26b3f89373594057254d549b05129a7dc14e2dc048e3669914bca95315ff5188543851cbdd94926e17a077c0eac1d51d78f6f1486df50e226bb902e6cc7a47ea3a96b2f46a9bbdffc8450ef15593db990a971d4003d0e7802f4014c6c18e9b8cfd10036265222e73bf4b31e1b249fc6d38f896e42d39c2cb4e44599c8dcea0eb5225a5a230cf60ca360a6fdde8d464d179ec2245850cec5a33777b349907791ea15b9b6e5bff64413645c3c2968cd36dd23bb2a0b636cfd16c1c6304844790de03d3291a7ba6d9f0afd334ba38e12738bbed32e623ea3dd049a8ab0a1f0c053d02aef926f59c2b29e0157b5733d9e8dd0c9f9afad323af5f5dce14635ef371fa7ed0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "535265ac", 0, 352410233, 1991772603, "7159e2732fc6832546f4fb754fa1349e9f8912f115cab3b590e9e77bcb82a64f"],
+	["0400008085202f89030d79e0d537bd52b57a085eecbe36f1df27f20b63ecc27c6550304e6dafb957000000000006636aac650000ffffffff5336528842d63a5beecdfe12e9994b87c9c867ad3ca22d2afc11cfe7fa3c14db0100000008516553630051515199b3fa2b81fee81386a9bc4afbf98e95354ab3c670653b98de24b005caf28423f96aef8b000000000652536a526a6a4e31f22901d2181302000000000165000000000000000012c3cc050000000004e5d7a1a63f7425a574522236d2c557fd77d69cf098582d2c1d0a92a8fbe0f6c5b83422231603c777ec444404f6731e3ee4ad7d4d6326169cff6c49dbcd0f5426b722d7ede88258e263bc3d4d58fda44709afadb3b6a08f707b031805ae9a69cdccaa5fd496a16330e7b97316d78c19c1048142bf05c12f8ba4360cb8bbda46d4e8770540c277e8ad5f31518aef69ffe88eff73f668427060debafad5c2f7ac2b233a9c04f962dd177697e99af24fb4c9bc1bc018ae662567dfc793482fdcf421f0c13bbd6e46c5fa1463bc21a1a54357f6212f2ee3c6be9f93ef8848395ccbd0b6f511a45b5bec43a36a0d5c622d0c7cb16d72793f023c78ea994b95c6859ca598590a6510e34523a739100037057c328521232251d387ea6b2c9f9a9b68330956ee1dae3cb79e305a9621343c4dba89111b954b89241b4e802007e5f62b1d75137f37f0dd45ae1611e5ec663223ad030000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002f0c92b40f8ea9ebcbf06ce44a0ffa62d8bc7b606569bce1fb868b4d4d54aa027beb0dba5e3fe0ab79f3294385e10e2a45766a87647fc5378b13b6a339d3f400e5873daed9888d00961d1bda216f71d21bb835b30df7cc68d7aed9e7582627eea57a6fb04970cf578622782c9a517abe4b4fd46761eeaae3d23d5c64ac28563d91e20ea4fee0eef43445313509576fe70682c9804c55836eaa1315b500db327d7f7fe8675b42ad352ca54c785478f29f88c2e291f7dee2dc70f1fff51c885cffa85aea782c48114a257dbb507cb6c74bd9537678752562aad110bfb5043e50fb19bf1d226dd1447e20d37c01d6921530f9d68274aada316cb2a1a7995d99aee7d8a58bf3b62343421541a8095155b511fa9845c8e21fffc2be475bb9d450d4a30e5818bcfb532b6d9865eb803715afbc7136076a3976fc2f78bd5d0947dadfeb137f37f0dd45ae1611e5ec663223ad03000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000875e70aeb5dd1fb559f4c690446728b98c488853b48f68f9990cc69214ba03b4d12866634c9928ef6442c150124deac9df096a2b520aed833ad8bcc27acbb944ad34c87ec6b47846a5b7b68f794e4d980463cae9f229e5127b9482fa6eb7a8be278f8cad08b223c1220bd662c7175606a6f1c7c7e251a5f87c534f59a677085e8a060ae103c4266792b19124e992b4d59d9349dd8255af6408cb834e566cfdbf942bd66128ff311e9c003be5bd8a7fe3d14233c8191640b59f45517f74dddfb69ac29a866ee3ef994aa2048b542ecbbf2ba00af8f08c7fa2a4cb25d002232ad782c2e55e2bce0b27162a0dd2fceb8f18678dea2c3744d11c69abdecc0d398084855c1b138cfe3056504f17ce7cc4408c0acb2a1e2db3b08e9bcd9d42800df3b309a85489d53d3d87d57958d400cf19cb3dcce985cfef633643cc40fd3df4fdd5137f37f0dd45ae1611e5ec663223ad03000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000e76a5dd761e977c9cf6ab80f3217ebda52e6e6791c36084af1846551487fb6ca2cf97b4b3d0c107fe7a3d8b1161b78b360249496d598f693d04ddce1691604109213b6a20024a7bed901ce8fe7f03761d7cfcf1d492d693ec3346382c73ce62bd8cd7ea87e6db78f6058a8e9540e559c096e0083aa68ae87a682c4c7242898b312fc1e20ba191c2cd301a9ce0b3c88c752a91fb0ce665ea64cf30fb6073707d211ef8b541c1c695e86e3faca812aee4aae4d2f070763c75492a6c3b5f0976a0ea661ce77cbea41ac750d552ff9b5163c7e36efa744132db481013b343058e5f94c0e6ff09ae4b0fd6c620574d081432e77f182e9a9f972a9476aad678f56d0d0464d5bce6da6d8ba6a2f6b018456dceaa8a7698f377378bdd06a3eaf9cc19597875051ff84627e9e9f9812788b6f1736b3107da81ed2d9d1dd3c9183a1d2b413137f37f0dd45ae1611e5ec663223ad03000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000023070d7e151aadf94247d8e7e934624646ce8e05a7942728f9bb687ea619f655ff4ff21b9103b52ec87aeb7670ab801dc004bcf4955f3c141e84e657b224de203b26259b48d1791c7bb1595eb116e0393d8d49fd3bfd6b0f4f5fa8d216ccf5e0dcd5b3a09626733a02398514f85e23d6cc27bd3c7113795f1862fed168608284ce6733e546ecb7887a80c9b8470c7c04a8f304a757b7cd65526d2685b6b1699f85fb811130ab9f9d5dcad267c77c34071e34dd408489d7f19dbcfb29a74117bd81fd9df3d5754b4e6fc4495cde006694643b95c9dc4ee8040d994ba6d0cd4aa1f70c2a9c915d89b93e91fdb32a8d9d1a82800cc474bf9e63de92fda4d902f662757d18924c100c896e9fb0e1e8e9f47746ce5fb7ae0ec0823c0f367e151c7e21c5ff0bb34e73fd3530412247ef8462f697cf26b6dca20ec0b1c8e5e511b90737d830d687ae3f722b5affd20691ddc618500366db08b1a0dab85ee84d41137f03bd10c7a85b446795715c91965de73e62b7b6eb4446bf6b3cb1b0b4bcd9e7048d86a951229f78beffa6a9f2f29ffe6bca953d72db0db9808e0ab85b208f02a714d206ba8180e3174c5e196867634b10f9517b4fc1a1ecbe91cb4d984dd5125cb86ecd54af63202965771e78957933449d6d99200d6469e78cb51430913ba31ab3de25ca8b55b29e82c830b8fd87ca5cb9560c76dc6ad7a21bf739765510bd562700e3f24d899ac991f6c704f69a4281e34ff60cfc2b9beab7cff006b24b0543f6e23dc7140213e744a13a061ff0cf941a1fc2ebf50ac67a3a200e91d5086782e080ffdaf9efc418ca8fee91e7a2ef5115aa4b88b6671d8ae0bbdb166565aee4a2d5d56b9e87a76274332b43f96a4447a18c87c197c4b677a236a2f76918aa370e5c8eedc916e873b47842c300ef2d2e4eec17fd7e0b53840f43a0be3773f90e0bbbec7fa0d0b93e7ecd31f28cc8fcac0bad71247a2d7fcf06eb7b8afef0099d4e4b46e42e3cd119a8b0e61f0bd16a21e566af2b2e60d6ab578786ed41a10fdf6fa5324b831ec16550cf2634397cac55faca758975f9beb5072f4730f102c6100c47e9e1a82262abcfc03adeeab4d5fa101c34d36457c385499c221c8faf3e88ff0f01febb68c042913b987b40ca704a785282dfec2ebc7b679dbe668358c8085bb8cdf08906aded9147c20629ce14e3e6f90f2dd40f182f8abc04572046cf98e61adf113defd105f2b922f0cf9751a7977268a567e8fcca33714f2d0afe55457b6e3f1448f5ddfe106cda070bcc67cbde6a554a765fe04dcf0ca8ab3d9279d9faf20d453e4badd2213c04a486b0df462985ad6184e632b62d19d28b795dcd6c07a5dfcd30ebe6507a73fbd9574e222f94dd23a4e5a8e9242742a97bb95320ed91e68fb929f161dc58523603e9647ff2624d97ca21513f95da877222ad8a8945ce1479d571698226df8f1a43249708e6a9e336685c9b19b5fcff768e88cb7da9ee8dccbcf6ae5138108291dd5c42d35e25729eaa9fbd1b1e8f8c8cfbaee71cea0464a651e3e2a37c7bfb55f24a2fb3427df88da80f55d3ca11423410629d9c3e594e25213d47571787a9071d40d42809aa0fc79bd58c354b3ac77c6068796113c15b69aa88cde2352f91a6bfcc60fa2e836c88f1226872d4ad95d759f75936e15b006fffdd96e8ebc4d376842faf8dec5f49fa4e120b1902e21cece0b943c2752e6001ee9274a7ba4bf2f0f82f3465cd0e2b78641780e7785fcfa4fb5f440463698950304d5e33636cdd1cd03edaeea0dcee92c37756e88d326c7b7b132aa26fde5ec960d8a14fa703fa3a378927470aae618b59c62229688725950ae4cafff084ad331252246bfe62c2c1326e1b7134dec27d6eeb40067bc23a286e4bef28cbeef50a2c8121a206e4fc8565b05f1e5b10d5fc0ee5945cfb76db55c0c0fcfe1c261b37d2bf95f704e3a5cdba30110ff446b97d81d2b527545e67f0574ed24c25b1d7a2738253dce4117b4d0c5cfef3fc5a8f5f8e86ddffe954921cbf06f0918719bc41b5d92524e61dfbcfc8c0de99d3ac5b86220cab51cee2a2258790d357ec0b68ca093ef82dc0067aec0193b21639c92479f8066f54146ef9fe4dc0b229fe412b2b273e35af81aa28971b359bedc4ea0a4ac3c3a9d23e51d789873147b5814da2c80816c18de8989d2662c658f16f779624a24e0a9f23e3ff4a9394fdc4b468585df30a7eec0b36bca4fbd392481eeb465e311d190cf1b42b402d5ae57af49491eb845926efd90f058c30367f66c724a793a9521c5767ccb9415041642d88728b7ca50cb5938f29141bd5ee08f3d924965380c157c53737ad1bf7f86156b7dd8083153fe7ca5df53766c97c94b28dad54912350145a529090b3834598c0c1e216c644a74893befe1b826a1f8dceff5c8d867a99f4830a0f22a2cdcd11d7ac2e262925101a56e6fd058139d46fdcac2ea819fdf558b7c59cdfa927a803fd00ccbb0104d7eba9cba36baaa6f2c2dda6d538129c4a93a30aedbdb7096d3015853cd14101b96718f3cb7b7707b27a18e0c152fdcbea88934d3dbb11a6c04cbb0b6e21a09b4d0eafb55175b9cbe390ddf310546f1b524e5bd8285f261e298b5217128163754d7381493eff35e2f98a5b6c416aa72cf01fcbd484a259d54fcabc2fbc9c29febd531a23668020000000000000000c35c5b0500000000ed06ba6c4ab6aea69e2d74990ba5abed8311af1c10e4d4baf2d3e823aa5f86fb8fba4e410a811475a83c4b5f648e14eccd5e8f487e30a50e3348561738a1a6fcff7b6914bb07e8579b083fb21ea8b2fb34b6d42605bb093bc8d2e9f781fc127e000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009e1f0736d0b95c0de153702c564d27055c1960a860ac081ed115478d285ae5dc1fe000fcd37de16949f8e815bb4b946fbcafb357c10bfc77d87d2bdfc9dd86c15e75098bb363976c4436acac61f915ac05cf829446b275b8684bc9da0a8a1c01c08a25d80d66a3066e7383de89bf05c69a0b99b6cea4031e02ae116af667c2a6ba9d0e467a142628f3b19d3f7361d3b2ceab4c6d5aa8862579a60ef3c5cb27d88e20d088c3e38ff78983d31116ad09fbee22c79a2153fb209749faa2bc68fd4a3dfe3ceae288cc65acb05259e40d5b3beb9c7b242bb1496ce923acd89d3fa370f4a834000c4bfb4c8bfdd8ab6fbe323c4f484096c24a644275d81d25652bc141cfb8d7dd56191c45d8ec44834685154d130a1b48207429b541889a90d4c538299722b1f0232af782b4de311c1f3042c4243681c496b1d3e7d17ebbfd41b9adbb68fa1ae9677f012f556f7478ca03079ce5958e858ee0d7b71115007aa783a9584ff711927afc0083cd3e7d0f9fa64cc5f2726e7e9a35602d4157118383534d8fb502b8457ae6fdc76226a47f4f5dce046c9d910f4b0b6ace069b9349fb7efc1d6ba554a180a064e89ea4656982fe46aece5b14173260c862a2f6c8396ab6fcb1ef0af481697d9ad0047a5812d01183ba45b075794fde1a55b4aef8a088a156788fd0a04958639c2d7f8c4b8ae7cd80a4d0c0befe666e97ed3329852665d4d03ab37b571de90eb964fd7e79b6589f435f62f784c57e0dc5990b8767c9a624c144e100aa927a924731714bd468169df2267ac811d7d66ffe7f07043d64efb3fe303ca8619643cb2b38bcc9482f7739ec308e3beb816d8d4e392e760681d75a47969eff583324a1c3beb90a5fa6524bb5df2631ad38f66c30bf1c4af966e22c0b014626ef641f65cf52baf9dc3f15b39c9d1c5eaae1f15d154ebdc57a8c157f6becce5ee161dd675ef39f6d9e80e7b8eaa7f7b7b844c7c7a12ac889c1192c2a90895e04fbc0b4585c599f5014e6c83ef915a04dc6c57e41bc11f34f9838fdc8d8fb473599fa3d2fe61b6710a8b65cc8b983af6a0b167d19cdbc6398fb0d9dfe057818be749e895258c28a43ad45a97cf584df4ac8ad1443c434d06685b326e6b03ab819645a44b1e9f5577d0112da5d1f191d2c0f6b1bb8d993638d58c84ee319f5bdaa3d6bcfc2b15c1932040667cfc22e080725f8aa29ac20c934e2650af34361759f521651b9cd53742774ae661e05e7ac88f87812eb61f61b958ce203d9275226f0928b97c135e87b99f6004752a5120860b15079f9d245e572840307903a4bff3652cac7eb47b1da769458ce65e3a07d5bd9e99d04141a8e2f0165df24526c138ddaaed2f902c4ad4f963b4c5ea4889f5de2830548ac342694403e9dc2dc6b3699edc2821417a9c8dfa446baddcc2d3ed0ffc882f8a352ef3295604723f7340e8dc43d93661367b8bf73dc78cf5bcd453fa0b25691f50260496cb696c1ad2852ec85b5b5648ee9c311cac7ac88a738bf76eb52fca3a022b9cccfaba7b42eba08e9da5c20635abf1310228d72b7cb562bdb79dd456fc69515c4fa837f65b4a64ffc9c07044d5825e2a8202bc1d2615482b79dd7524ed281a21413336944ffa2d170dd68a7bf3a0463db58da20ff007e8440ead72d4d501026391f23ece8a0c85339fd7fdd112f2043da7d5a2842a44c6969b6db4ede367e00d0f0becea88a7a1575602132a240e9d44ed9f3aaafe0c9e46735bfba8ec751ce874eb3193c14cb4931c2a430f6996e17f178173cbd4c540ffe2ac00ba668e1907b1375191caa0095476bba14f0fc6e25594bbd1f00fa52913b28e8c1f9968b2b2d6c298a4888f48d7303d32ebb6f4e7d67ef080c04f630af0c64dbd7cf97a77ca63b38d977d8546d9d46f9a3bf387e00994ee73bc223b00a0ccbe435a9b9ceb9b8a2502914badf0b6a260093cc8afcea7d1974e56d0941407646cdb68e07f37794eab65ff87ef35d8f0156387bb09038105e0f4f9e0694118dbded382b4d9369ab0454f2477dd07d4dd880aea5ee33d13124e655239521830e482d658d304896060f358cd005c1a60a0291f78a40340fe78f8218920c949bbbfc7f68bc27d25ee7a1d29b3dee0c808cda51f9aa3e0c553029701138f7c09e89e96c640100000000000000000000000089c8af805e5f573ce9b1e8593d6f9d45d75ab3e77ca00d68b2b608df79137c2cd222b2abd5fe0cd43db22d5c77ff87ee57c969e06e4a45e0277e895082ea8e22a4659bdd7197948eb4ece9d08b531dbc2f60d8cefb376ba578b4d0a2120209ce000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000005df70623a491d09eed5c9c6f166da60952169ac4e7ce35d53ec5943dc747827d42a94631459741cdcfdce6926ec24bb323245ea6f289128bb95508cbbd355d95925d76f66ca6b36911053eb25efda35930bd8fce54e06fe176541ff513113e9bad04b24ec70532f2fd2a8cd17a9e12ac702813ca345c5be3f09acc88489750ea737181010b1970f163ae7ac1e4800042a427e5a400bcf6a1918d88242f5ff14b44dd22b58e5ae605c5b852e488c28ac74cf9b36b8c15ede5dcbf17cbd63542a8df8e94bf4826fa02f95f44f8346304c6c7f3c7ab62ec0e4d0696b026667b7893ca251cc5210e031cd187668f7e3df09d7fae774a43ab7b34a1185b3ab587ff676b50b800de42458c24c5b2050dae50a55b2d9511615ca86da0ec06d837d24c538991238d8ba7ec96d413e0946a9e81172c7c044bc07323084ddc2fb1f9efef93fa1ee4e14dc7a3e149bacbea0f5302b26ca5f372f63ac73195d9eec0f2e7c89009bf5ff9d5c4c68ffb40d219cc4207c895c44cc21e06769e7541f91b68b6c0a5a280810ba0d7b5fa680c1c3297074d7405b43d7ca706c43af4110907872cf167af27275b711f862822fe424944c0379b7be6fc1028cb3b5b842135ea44665cfa69cd5dc9639f43b81376d4dc7e6e8d3382cfaffd2a2a5e024763862b10ac54617e92f14a302fa45e00348d9fbc4b4d04a8eab3ad61ba7b88edf91d199b48425120981fd1b8a7e074a23928ea1295d0574cd06171415b711855c5d610a589ff53d4c5ff81101c2c3226e116f25bfd126cacf2b3745d1cb98ae94bd4b823fdc55dde05df0b3f6a07f21612549faa895807b5c309cdc25b3e5cf2284ca887968d2ea06c9b0c7aab0416ddaaa9589f8923c027649f9a95e320090410ad333b2a184696ebb1bbfe2544d597d5873b480e580983b0cb2b8066cd6d0b29a5ae73947db9c07c9f95caefd8221234a272f477ec0b3bc216f36607b3248a117a6efb22a0d69396aec0bc40469b023e0a50d768788ab4d0819a8c7bf0c844abc04d1f4dd13dc2afd4197a5c33eb34d225064666fe42d2bdc90b50b0e215d0cf71d51acb4f0582148f4de8949a432d4e9245498c1c9fdcb9d65e931cc74f079b8d1c5cdde86aa86bff8c3f5f335124361b10ddbc9374c8c8c5e13a9707b8e71a34cf043e6f86081413b98bb42bd34c86558940cb52c039d6c2edc35d6e618ab3a312030e88c4e17f81605dd15f4fa6e4b368f6afdddb1c38607a9fe6adfa1c96b85953b52e6f3fafa8bdd99667e0b8ac815be7f25207948327ad833f31cc7123f0767ccce14c9ab13b7158244367d42929b746bd4439ef0314840aa365294df2bb45c7aee3899378297cf9185cecbaf974247d8ee5f7331cf2463dbf5e417888bda61bb736196901fa1a4c1382abe50472d491027d2225eb01abddd36b40af88fcbbad0b16e96bdbfe81997d5393e3958433b4629ba294c2b19daa2040d8c2cac8f61d42c63b9a621b7d0ef22fce2c7410d8e896ab34a3f8acc7525183c317054cd766e3057059ff182bcfad31461bb4fae98e8b4f0e3bd67138335002be45d6dcf974f6944fad51978231feede09529d4770f8ca445c1c1dfff4ead3ed4282503ea0f8eb1fac486485b974f6e1dafc020f6e52048b4ba7dfaf03a768dff9a4c95b198a54526127a487f3da6e9da51f94f4e27efd2d0d2aadc341a6eeb9248770e82ee56812f9ffbb9aca031e35ff3952134bcfd40900548b4cd86c7e021b285b4498178e5c20fc0a8b43b046208826899034b936b2cb062707322f0fe0c52f84ce967a01cfebf2c58579f76230b148b93c05e6c65d0216a199622919b13033c853fc5c6d1f7f27acc6dc09e01aa5756bbd54f8e30078c755f6a9cac8d135107582ea930b3053ecbc52c4cf09f60c333658143f38c3d50659c31eea5263b9ea70b2c49fafa3083da3ebe5a4c1524aaabf3ab584962af03466f651fb9e7dad73392a35d80a2d12e26daa99c898172920195af98f01adc9adeb0038e8c939d05ddab2696472214e6930f635d51f646149ccd7ed70ab82a273ec15134ec6347b3e292296add0834e8184c67b28e531ec14f92e926b0c91d2ad7df5ddffa87c24c6ad50c0df0af890f263245d5934c36b481ae65f8c28a834c670f6ccfd7b0688355294e5e530821fd3023f44ca85c82f953a53f6ab05c487cb6abf0330c78315698396af07531f3fb8957491b3936e25a21ada6fe805b463ff3bf662492d0e72e6cb9943b435afd315090032427f250681a6237b5fff824c10100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "5165", 1, 1908671584, 1537743641, "bffef0626de464e44245a2a713507086823d333b0e7ae46de463a9310d0c7121"],
+	["501a6f7604cba8da74f0bd7836f7491ee0063a286c7a282ed65560e0da9e356c5b19cacbed0300000002536a4e5094200018b41cd2cdf6fbae3af883e1d728e4f3ab2c4ec11549cfb2f266a6bd9b432b02000000076a515163636565ffffffff472b7497c12e22e0b27ae66c02fc5753b9945ccfbb3fb85cb05f596b2d2de6b70200000006acac52ac6365742634a1d10a2c6078b4acf22f33137239e4f37bc9ca8670c7faa74814ce3d9aa4a298ff000000000965006a656a65516351c8d22c4404dbdec0030000000007ac5165516351656599dd020000000009636553656a6a0000522576f90300000000026363f3616d0300000000075200005352006a432bcf4b00", "5263005163526363", 0, 403159415, 0, "6f8f8ef4fe7b9f3fe6353016ff66a630145e9fdd06f6c02f029aea0fc0c0c71c"],
+	["030000807082c403034c3506881776e917d9526938a7c24df42948d83753ae1b7e3fbc3a6f4427dcaa0200000000b4c5398e1d78c490a4e817b8e55624d66b3fc2b00c504c16ed8a101d1cdca9d92331a06800000000066a0063ac5100ffffffffa57f23dfc53bb38290fc765c4e5500ee4fe0b9c00ba9994cd09d353fd2e37339010000000163bfd746450424c05c010000000005525365525121cad705000000000089e2aa000000000005ac52ac63530dd6120400000000046a655163000000000000000000", "", 2, 1079775978, 4179206552, "9efcb885ab26aeb7bd04d6ce74e2739d35bb051a09756d873078a056d77d370e"],
+	["9e5e9a400322ebc5f8b11a9ac8a844260329eccb97064a3420b7492ffb4a7dc8999d85be5b010000000700526a6a5351acffffffffe0f8fb658de1a3212b627591a918e3dac7bcc126dd3ce76dfbbaca4d63fbe03e0100000000a18807657f02b2160acf5e58f07f4c62ed92de558d278e18b9c980f5b53eb20e0b953da801000000076a63acac52ac65ffffffff0215884a00000000000252537977240000000000000000000000", "6553536a65", 0, 1498891274, 1953719636, "e4b4d8b41aa89fbfc83f64d2c5414ed339a53434585f0d79e2a645e672857d22"],
+	["0400008085202f89040a698807ed0092b700db0d206cb9924ea48e09b5f589a848b8ca461141c9d4b602000000036a6500f16eab0cfcd1e1df62d15d90dd9825698ad68b9b6108e36d3e69444408295b11b8a618af02000000075300516a535251ffffffff8ea743ecea2a0ccf723f5c0e75c062e922fc7a089d1d134881565d32277626ff0000000006655363006a533b0b0592d8b3ef6b85f5a80f99e604348c27944b6184554cd50c20a2ce38b64fc1afa0b90000000008516a0051acac51653c4036d101797a210300000000046a00515200000000b1f0d415026944000000000004620199a5949e630a5aa7b20d6bde7bb1cb9ebc495c2c19bc6ac58ca20f5cd602d7fd129ac94b8e42056f8ec0116c70db9101634c0f87198e087bc3552c69bb0462dd2a405e2dc21270ad144c8b6a2b1fae33b76615362d05249b6d1d8c63ac08d4337779c60ca4f2cd5a7126b99f6f553ae7781935470681dcbd382048065d928248b1f1031af09736ac1ab1a2a42fc5f023f3896bc3ab157bdc4190ddfa1a999b892323f72b8cdbcdb53bde2da5166e1c5d2a576a732a109cea9edc28b375755ccfbd489db62ffcc5f4da2d241da3e09afde44f18dfa04dba25586407159ed42541cc7854d87da01b600faf464f0fa47575497d18d139ae2419d4bd8d7b728de88b0085d0f8922b4ad7d79eebc14d4fbd4b07b8a23458804c60b52ebf602f177a3c5b6dbf8f312bab4f75b51bf86350b64eba2a98f7e1a0c6a28625569af72f90032427f250681a6237b5fff824c101000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000f64ca59f190e509f8e1a707713318b5b96b947d9904fa2f74c68f0f424f29c1173d1d1cd3476f6373bd8c5bb3c468e92519c8385d31a42e35a75290da97f08095b263e4cbe063bdf6ab54bf00afc88f28cf476070709c3b55ea67c8cd09b4c99794c1dc0b1dc3218bc56d39b717f5b38449eaf3882688dac54078150c5b113e803d1ddd2c45f942a5a0547d18805efa08fecd0c734dc17eebbcf5805da28181bee71348c8aad7e30cc75d2808289343c24b6ec74b90e348e94e27eca95bb724b24049404880156e5439cb848ce2db44453537e88338fd199e71ae42702b6a443fc5b889e8c395f70c040f5e0d592e1ef1c1fab9707f734a0a3f80ae62907082c9eb48352a246ee2c5a7ac5190b8b16280e1eaf365640f525d45464f0584746a43c81eeb932abbd7f42fe2ee6dc285ba8277be73c4144cc83541e5009c6cb8dfe90032427f250681a6237b5fff824c1010000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000006a384631286a475abc6e9b6a4aed508290551be9dd02d63a3c7a4d710e4c939e299412bff1ea60661f149b58e9b0857177fc0b7a7dff92a8c3e7e932afe2c76ccd1d8a242947da548f873aec12425c46ee6576b8335761606f3fe8b8145804fbbc782bb73877c65e0a1dfb47dda554526efd41025916a72e53ff6641719a4dd5991d2d0d4f1841c06e971d88614922b481b9e859992f6e3ee647bfe250f460128c5b789fbb314f07db9835a355cc78ee5c5185572c0db6a41dffc61da316e943242a6ac19fb465aa300987ef092ea1e0ebfa8fc865e4e66f3e1ee870a35da8357655b61a99ea50eb9ac4c9c1f6c0c1b2ee4109cb8760e1c8b173e79909f2a002c950cf1983f378b2611bb4213ad17ea91650b8ad04bdf69cbc24a09867da7ca5ba47cfdf8a2671224a0034f03c58e7b5552f1065813030d013fbb0fda7d982c090032427f250681a6237b5fff824c1010000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002f456e5d82f01de68b8737f139181dc47b38a12b1a6321611319d9d35d4e68e7a67d7534802d037658d4b359003215ce88870abf401de03806d64457bafd2358a835abadcb3161df893ef453eb68b7ab5f88c2a9db96bf6444c58a8d305a58953e452d0bb95fbbb558fc5db3313f25c89bbb14d2eeebf68fbf4c2772ccfca758cc5d608bc17a35c4d10b921a02df9fe9820b234836c2ea74703a72fe7cb45abc967ffb20ff4e5dae36976827d8303ad168045c668badfcb35fe580fd44fdabf6c7cd7b4c9e7ebf822f5a6830c607ed0a30f766e8fde132a927db5172d01a69c65c35cc991faaf39f500b90a9ac739fa46d730e94113b75d0be515109e859bf5963fedcbd566c76becbc59d8c328087221d807c3c46cceff65a858f644b8910422e4aed70a874a6ae4af2e83e7ea49f4cb78cdf40d5de9b24f42d0ba8e5142fe790032427f250681a6237b5fff824c101000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000046e34b35b219896363fe333beeb0fccf9f7387d3b62ba9c8c9af2eafe6493b49695fde1cc00bca610c10c006d9395d73acc94bb3dd572fb8daed772fe36f9b823242f9527764925f10197a8710d3cbf6a1be766fa2a21a42e8d955eb5d3d6d34422bd995f9d545672546a541f3970e56fbbf18584e634344d9b3d065f5caba98819af7393a35a2d313e9788cdcf2af18d683f027de3838fb40077f82f4e3bac404d6d332370e0503cd564ff813d276045af1a0936de45f7c13da00d5a84c9fcdcc779fcc184c83f42158ac1ed1929642b0624374bf3ea1237bbd3682d26144e4fdb46e5001b1b7d381eba21e5c60599b319dbbc2d4454c0e969b8720b2eb57f62c3b3f24809efef4ee8df4167090fb56ecd43ef1ab431fc9d0ad8ee35ffb166e89ed92d2f2ba34a32af31ac4860b2817497fee69a670c8a74cb76b0cd9193adf09a48e2090ae8fce5b01eeff801aecbc148c70af1dfd4179969867f2e386184c4cddc519b54ad7250005ada9bed6e278987689bd9894408a8971739aab85723366d6e023effc159caa3512b4e9f138e474c1bffb72deb3596d683114b546c3385b8f9b7bd587e2ec77f95e55dd9781dfbca5d3aa760cdcc3f79a666d61c9fdc3decafa28e59b5e33cd973cf0d556ae58fb4e4100937fcb08c4949a60b1ee84e6f5e0d1180a8dbe7801303c1d63f691eaaaea6a1de63d4ca04105108d0e35de418a7270906d65f602bca75b191c106e6571538943ad9750198e31880d1f7d9aacd4aafd7f873626982c6faa284342813cac23cf51508be4e73bf63c202605624b01918ff4401500e3f1f17c32a8c7ec71acb04f1b08c15ddf121c30ceaddc8416635dfda16a68e84ac2e6ed2305e1c699f83442468789b3e3e3aaefb93f2394da2f3c49584b3dfc7d1a2cc7bd4db7c14734b236d2364e20d141d06ede7632f95f70d13f753766c9af690314d9b608de2c1f43c0729b5995f99946cab99d901dfa4e5d3a049cabdd0a0f0282a9ab6944600bdbc413d6fb0b39847c5432ece609b4136c201725efe70beff6ae133901561a197999062d4b6004020904ad6af95e803d915b8b449296a7229c06f33fc35c40117327401b91b9a40fabb70bc00928b003587c1ce5faae1a3215cd12dae1f515c5c8c7c119a1e9382977affb07fd4f3631b06709ba60ebfc40d508ce5c41b0889f81784f7ff67a4365408adb244bc49797f29643c278e5729d1774318757da149602fe509ed44902aa2dc2631b61e6c8cb7125c898e8565f3e6150678ff7868506bfa830d5f88ca3edd106805628a2c85b2a740292952b2a6d3ee9d1bf27bf67e62b8de433283cc83e7ee5b0b454baca59a46aef5508c8d8d69b059fa340c255b568862c01b0aa436f32add31801acd09fa921761e8b2374c27130babfe71f830249f4260ba04ad71f099e3221331ea9f86b823a61b960d309fa1fd3f2efb12d9b214905db94caed6dbe0cdbd2d2c567fc516800445b808a4f13ad88e0bd8b1d58f682162f6de8a679c843e0bf8b4eafba40527027f9c55dd12b5b5f58878f0346ab75ee4b8ff7634b9e83fa4f20792184cb9d8d8158cc4b14b71b54d988cf7bca0be8363f81f598fc241b31cd01479270f1b38c645dfa07f3b2f47616246f80a3738609453a32e099024f8bb88a3cf7394b3a60f5ebb3a2da10f1d520251e6147dba7240d0f638650f3ab4efe432eba90616df2f6110b544b0fc776df3e2627742f4f6ded2bdfc3a85ba8df10cbe1ede3079d7ea878efdd6bfc6f23b985e6bb746352b8c0d5a98880628a8a150146d45032964b6d1203da82b85661512883986d7e1af04c5ed42961a39e64a07cf3db71fdae04a7036c97ae9c69ef45794a7a185aee1e3cf609e61d1a847fcbca98896f63073a9ae7b370fe2e186ba13d2eef6d0b7853e9a84f7683022c699f25742508b87fd0fb1192350da1005bf2f2d00644c89838b5066a702a333be616527f041a85bd2148e4334c2d54fedca9da624ed4e9c4aee7007dc1105d46bfe899662998d3da5248fda7dd3b9ae5504cef3b01d50dc85a51c2023db55c47bc62e5d1eef607a7d8d5abcb4d6a25dd93fbb71fc9a2894535b54434e3c4884c86a8d1fed03c73cd6677f80a3d1602ea95f25dd5c2c1ea7fa24f77289b32b8e61d217bd08c627d895ebab33b61684c49f6aadc86212f44daffbf09020f149ea278ab40717874d9eebd7b3689dede54936e7c1f1576229e32538f065ebf93dfc9f8d7ca7ac7a248d7378eb3ccbc23153e18c690d5f202ae05435b9cea6a2f1a6b5349eaed03b89e3da74ef0677020350398c197769e7f74e24366ad2b630406c758522c74cb0e9ba66933e6daf2e65b20ba6b6ea1054246e5cb5b122361937a91d9f24a83fd9f9c093dcf55ba34f36cf97e4c176ac5498765bd759da873868c2f74ea80f10d047b92eb33e3969c6c2f7bc2189fbf3897adb25234215d38e605b625c2a484d2250635fab1ef970755714aec9933644760b6f7a0ae4381d766021c79c431ac6ebf1db343d30929837335b3dc75e7b4f27449d5c578ef952fa9a1a64f36e2c0dec127e5397bed31575e6ed1fdd276a0f923c9ef57d61f8018037a4e59bc3825d49ac2c4bec7d8bc26ec011bd425a242819cea014a83bfd96fb6b63b0ddcc11120b417a5f5da88288abb6810bbeefbf172eb00b2bd620e7d3146ddb1a6dc17625862de59a0c0794ca409f821e45d6c0b746d8dd04b1cef0bc9c797297f50562b2782443e813124a9626051585743b91c93199e7b36d0e9554698c3f3d0018bf764469efd342e18ffa0300746edf4864ad46220e90a88e770380fac59cbdf9ce108957ea7d656c745641b6e0b29172eaf46ca38e2889b08f10dae06c5278870712f4e693054bd1d00e2ee6a522902e78d1b6b565eb07fc200682c50439c10578103415e1051ce98cb09780fb6388aa264af0917edcd184877d5f2ce5800a6370917233a6f58af91fe8e5a2a7c95cc97a71778a9b68815b093d3e0a53ae2a4f4d7b3dd886e621b7f7db240115ee0882cbea6a4249062568876dcff7fd4540c3e0599cd65e9cafee5339c0627f21c422888906aa14703bbe6770ba3a4dcc3ffd4d33cd654a386e5b40e4d5fb777d7fb1c71c5bcc1b9a4048e850a9533dfa9bfcb6d9d50a219520bc2f33b0c27ca2c7ea2238218d23752236ae7132c4decf2d934102d991dfa3bafd8975333e670c90c6d6ead4129be3a2397d84cde35c08262b566842c5a3037d22538119fa731ff203dd8e69f16658de25efad19945529f83cf8feeda44fc74133fda2d8c8c26f427bdfce6e2ad3a720741c0510392be398eec1f793d4126b4964fdba5bbda00ce0a9ccfa9158e00ed515c7b6a8664138bbbe386984c6d0f2783aac9c1bc8b0fec0bbf4670f860f20eb8bf8fcf49eb91ccdbabca1ce3494919ad4c40514322632badc45172aa7a76bccf779c4e248d7ee456455b7a00b05dad54eaa58b45f9f33d2280920d7cbd34943a1a734dd44a1edca60d959bb78b761e3a6fd337aab4881d33bfe8b64763e63f9f7397cc5cf864168be51f524c0ac0fee3c5e449357ca23adfdbbe01ffc207d40a0614b0f0454778a0a7d960b14c70cb9bca971aa85c9d1b8a7b3d34434881b5484d7f4f18e444bb569874a07e284616116191f57bae49ef492eb4b287589d23c5e1dbc76d5f8e96639aa749a9fc08424a5b32365d85b6417cc5a4019adf26697c511cba2b403c3585a082d15d7229fa40e84b4ac61a92dc5538038de09c240274a31ff55e8a0009f281bff16da4b2815a887f19f0301d543eecdec8db499b1445718efb9105d44bb73a8b9bc92cc6315fe5d5ba8f3eaa20f1eac29ea58a7d46eff193ed2a91e3e4e19c5d81a7ea245428267ff04598dccb726f1fc9114c27a2fcb2e5e002403981c41da76dbd0e4174ae563bb793ca90e12246d0c6e94bd0ab329b69a1ac85c8fe2074797d6381ce9ecf4313eb4d9ae4b1c0d05c9be434474cf5da407a4152c80b943c0910213e9639d4a9b041b8aaf269f7d200fa88e5487f44981f561f0a30d121813304c3b4b2e98e9b937f0f193d01614eebcd62014eb73f00fa409ed1a72160be4f7127dde840c994d2d4c758fb4b8748f39c6b5bfbc67744accd5c18886e2cdbc2e50fe7acdf037307d90adb9383c5f143841f81676665cd80f9ea14aefa55e6d5ee191b593197fd3c3e38fb3183bf5f39751c999191ff7386559c3373c1a89a19dc74bb3a5a1f096754a2d590eb319e7c32462c4140be3ff877a8c3a5cb23fabfcfa9b5cb1345dedb469cac0b267859367ff8a07567f85232df045c3b32f7f50afd4f20de8601efbb0e5bc1dba20318a43910b8817f0e79179e7ea978fe7ff0c69747b44e8d7ff71302af07586151df6ee3ef184adaf2e8a326a43d0ac388da64bd0c7b16e1256785018d8df04f3f8d9fb687a805b9024a871b6eaa377e27e8ce3e343cafe4fc43873bb7bac43dd39d3ab38b94c490c3f913a9b58d04310859e93db16d5f998d62a0618f7be0642baae660318f3c01c25c26a24b863bcfa13d9f33fa3df9a4fe4575505f5e90f8d12d7813c748ca18005023e438637c4b6eef6601aa96ef2a00d504cae910408d3152e2e2ad6e0ea6753c91347b5c7026a5f1fe71ccad41a4b0ec5c3080ca980c0c905ce13c91b15bf6edd15142ea2b3e7fbe4d411cc2c1f29aff39c36d7abdb0198ce68dc0b9aafca9b91c6523d509ceb1056accd448a5b1db1a4d875cbfe272daeb163292fe991d6cd56f55be91aa263b8b07edf4a599b13444b6fc6bd763cd07906d8744e93c1216f9dbdf8411304c258615e8a9c72da99728653829e9568772c48af0035231fc358256f09b4a77593542461863a25361c6307cede4e11a72a254697b40090deb1ca04a003336154a4b6bbd4abe91111ab4ec732b2ecd9857e49b7cc88d096f8688291c43f7319551535564845d1ac94e5c8161d02198b98baf4d31640d8994f15e60f782d0528d56dce56a0c5d3584cfb9af32efc7b1a171d0a00b32c37d32625d46a675372d159e8bf28a9e5abd1496a4f7b1ba60e9efe4651c8df8fcbf225b1aa86585ec0c6923f9f39afcb733139b645cc37eb0906d4f6918327b5bf1faf9174821c916431c9b8ddb98591fe434cffc3215a2eb4eb2df132c4650cef557f6f44d6b6423d17db208e585807715be73567b230890c0e730c6324cc1331701c24351b0d535db63172b0bb64cf869b346a0b0d048727f73f32c51a33ae3906286b87413fce6a523d8aabc3c575c25106002723bd67678c70ef9470a79fbecd07d62c24e6569f6a0bcb05e03b84bd22f688ce33ca4effa7c2630d4eadc70000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "00655153656a", 1, -489166006, 1991772603, "53a0e453651599e748dacad48b4e3f4be234d7644d96935d94c1196c9b754cc7"],
+	["0400008085202f8904a00322c224e8cd625b1e8ad3a6fafd6625762603ec8f91d891ed2fee142ac8b703000000036552acffffffff9ea15cc56e34c624dcde9d633d6b391952c35765283f20656a505dbe73d74c14010000000900525165655351516affffffff0f2aa24dd72c44b447ae5a3e019146208ead23b97783e070b53334f31803256e030000000651656aac53acffffffff2be5fc7a3deeb657dda9b6ffd4e0ea902adeae1d177d2e0426cf4a8cd7cc02260100000008acac6a65656a5153ffffffff02ece3ca05000000000751006a656a63538b56da0100000000026a52ec700a3525bc16116950be01000000000184db37977e1f3b545a4d51fab3932ff2d1d88e159cd1df36d38799f1e15dfb1a8fd8b01229a6c5ed99df2ede656647ca9ac88bb97d4b9d2607095d23cec6c82b805ac47858b0137ed7b7e1527988b526bd70dad579009483235869c843c884074b2ead51505fa9aa60d295f16c8c4d6c89c8bb9117c071b3aecbdcb0aded3c9f29b3376863a738aa292e21bfd14ca711ec157cf6fad2e14178b89f76d739a803f8a32d6dbfa9d2336ad75a5a372db9b65f7d753492a5c9c586b34e93c9c1e1f10a59de7d0a12cc42a28d6e540c054158c6a1ffd9f8bcf6a98a9eab13bc72c84bfccc7880cee9d95e06e5549cad81201b1fb294a1d662e233998187023c2577be202c6727efb9ef3e7ae1bcf1bdec4c7df74a2a2383e98431699fdb668469e6704e0850514553afed606e36a8bb7fe9240539c454347d291340f8f85c35f433853b3281ac7863b93a94bb0da71455420a0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000475a1c5af44c09bce0ccb183193233defd46e8335b432b41d97ca07718f23c9208d3b12decf7a86c1db318690909a7fe1374d82ad6113bcb66dea1d2e33f8610edbb9207966d1709a46af037078315badb2be3faad2ed8a22956dc91ed1937f1718efe1bfb084acbe27cb94c2c8814b65a7ce01afbe4260525abee1e9af3d775d49f55da491b8d452239d337b2fb69818bfbb23803e42ab1ab445047d884f866cae6e825aa8dcde4072ca7ff0ef213814e046e62adc48c9caed01788448bcc9840f65c4895d1e895ac6e01aa57d03c99c2e583211b5b814fe429b8d864619bd01fa5f873608d0e9879eccae8cd2dbf8ef9a0b53cb61636acdc1cbff51b27a921b01768e829740b1272c301fea7b85d099b456753766d21b608f85f6bebbf32a743ab0451c4c6d5c54a8302e246a0aa0e302836b2e70ccf2150066ab4d5638af84704c98ecd14fc9c216cb350bf37dfc70bb2ca17bcfc20def16361b16e0547b2711f98f476b531b8422ca73ac1aaf6c1db055fcb4ba32f96e0cda2eab257e93415920789235112e218141e56da04b62a6d87946e601d05693a8bd9ba55ac908bd7e6de14617da9fd9307e394249fbccdfa8f250a347754ab8a304b317ad3fe14f7bcce8a562ac90513df0b5e9b2a9b2e3d840909cfc2819b85c50b498148ab92d520137486d2a795e42515aa60a91e12dbc0de57543d0d72961a8b8bbc1ac21353b3034f16d08e0c016da6493a2b0642f603dea78e2d35780d4eb6f4fc873f349cce61cb522f6d9cc5df82d6bf92c4bd75908b1f26e00f57da8027ffbc9c9b414c2bd520427d4e9a1e3c64f7b2514ba12a6105eece2c54af8f1c05250e0a50a8aa4aca3156389b5b064b2095ac8572c2d36a9fabdc88b9c04825c2ac1431fb592833b2e1e09efb68390985d61c82eb8bdbc91f4ab9b908580dd08b89be98440dd36c82c948c61f7191e2117a79983bc95a23671bd9cbcca84bde3abf5b9b440d4c4aedf493a5caf0b48c0d4830e4e8827158bc0a78cc76b7bf73e92a94af02e8815e1a3790393ee759cd7cd506fbade3295bdbebb87ac91b11c67e546b1b1fbe6bd5eecbb9d90987f5375bfd1bf32faf540c6333c2a4245ae91f54862e5faa0c8ac825cc0d2628892a0ed42c7e8db2dad9eeb19fceb9c33fc25aa650aa83fa8fbbdb1f7c70d1c2c92203b923bdd72f442dccc0e6b5a8514d8417b1f7509697a3bc2ad713d0a560dd3cafce09b9c4185620495d353c392bbb0ddcf7c51f822f5797cc2578edb836b6ff8b6d51614c5e6ab32d265596d33c661783adb737fe9a91b37a15d75798a31afcdf7dde8f873e99942b831a2cbda7798d52597479e46c7a87c9f631fdd3e433ccaf672eac8309269b97496b81916e84c74126c6bcbd795f07bf5e9dd657c5a6c62155242e8a286861a7a046f9fa8c0fe9a6d35509728b47e3b649f9437d34b549d0eaf6713d308d464347b0aca7d8849d22e1b44013a4bb87bfbaaec279380ab442963d68f11717ef054dc2da24ef9a4c4c8908570398aa47ce23ec325457dda61eb053b4dab4533e5f523abae42485024afbdb6708f450ab79e9a8187b3acfbed71b62b8489af60929c5cd0d0af5a053fe8c5c834f32053480ee095e2e31473a0a017ac29d8242b505278885c31033cd62c46e519d226ceb6d561df5e553e95553a8bf150dbde2ccb7d0fba9b4663a3149cf7d4fa6124e9a0540427426900a8ac7c5c2302ea12e4b33a9d98aeb2ce14e565790e494a49d0152403df4975c6b008dd67ec67e386673bc9105e133caaec97213f6761a0272e6cb862c91e3db53d5498b8a73f16ebd5a7b8e6ab4a688d1341ef8fa7880cfd6b4816ed2cfe4425686c74b0f9bef6d14579a037e6f8db65d1d9aa4d2d54ff4047555af1a6c1131c8a4f694f7141bb1379958d69e0f72f941f31016cc1406c38bad5fd7e7069db72b7799829f1c3d054583253c1bf23df8b260ad4219d9f61e0fdf177302e8d369088e6724d30e3fbe4a72e5c4f9abcc689e11cabb7c6169f8a5c05362248f677964d145533762c92aaa3d2d98940b5469a53334e314b37da89fc7f00964050087e6a1b432957137712428443cba5d2a1a7a47ae16fc0e9f600992b0bd50f993abcc510660004b12ed28cbf574b240aa87d5aa26eeb87fd1bd6e4a82054fd37fe768aa7850936a839a1eb188742a4122179eed03fd516d325a173ad59301e2d4c949a9038ee029dca0776a0e0fa502dea4ab67a38652e0f3d43b24d0f008d69f911748bdd0422712cb0a1859c09fb1822f6918ee888a61d920b852cbde784ad1032c5d533033b85afd51afcb7ae2eae7aa222b8e2a959145aaae13e5298a40cebfbdd38ba6365f60f3a3a73aff2b43e445e8b1324f9915b3d70bffe8264d50ca840eb7c42aa06d1e3cb75b9e659648bca429d79e9dc2673bdb2d25562f80b613f8517c961ae1a3af590faccbecb48cb006790d1908554843c05ed88fca72c2b875cba275afa06ec2d2b603b6407b042ffb11e955cf6d145ca68dc497891fe168a3083da70d687de1085ef1e40c2b27327aff9f1756f5416197882fe1d25fe4b0498297f399ab139017776bc2c8ef77c07c7740bb2bcf48d33455681d0185ef8ac3c76e4dd35d0f4f2001389475c67b57150e915c3445f65a61b540fcb9557f02ee49d2deb4236ffdd020b69bfecf9f7d8614048c0ac1db27afee0a1c2cdf9828dd204ad944f51e4e1ababe042ef0a0733fc0eb203ebc8b66fb08840d0fe5bda2f257040a9eacfcdc31e5c7f4408a340969dbe088a53fc25e412565d1b8b019db51f1caf75c81ebcb6ec357cd576055d3e4ea6350e5da02bb1cdad7181b7b11ea2b89fe39a347343f8550b141b89fdc212d6c8b618b8cd07c686afcbf784a4b681cd2c5834a8f05e6018852806551463c2dac3b8f9b8ea7a121ce1f0f667052adb7d6df9a13acf0d1aff478f3c6f760c45221bae421d2aaa7e727b3c9a7ad7c965903fbc8d3a6b6864b2a2daa51f8e8f8337264b81f3393a1d3f2370efb4076dfa5f5421d3861861793e89e1d11d4e72f16a6fc4a8e13d134e8a45a4d948bc7117d37b9d23d8bea3cd638a1296c4362caf5679e6544176cadc7311c84b76f34a696e5e0db5f084023b4222c5b40bb99d1b2f1e7afaa7a5fda4e1ca203b7e8c2d159a81ed390f4c197a6a5f65d8fe7eb40a6e03d3f20125bd5ff1946d269cf2f7d285ffa6ed00682c1ba4fa3591c8703a73278ac321198e4eb539ea8236ff2bf4d323de5ad53318dd8c0519d22bc9b4b75deefd27ed225a1def81cf51b9046b2fcca28adac0f0f4a6a40cb1d5e41c6a09b10b32dc84e75caf30d9eabdb800afdbd2e41cd27b32c7879635ccd894feca85563ae26c87bc5aa09d8c9cc8cd26d198aa0c601e82c44bfecdad07adfeb696deae9c94a36cf19bbf975d4138a2a2644877d009c0be6c89a98068744748b9207c01521548bb4dbe5369a66f7793f89c08686df07110ee3c3616c573b80a0cf2e70d9c0ccf99ec98e858044755dc89bc4f7e3256b1122c3d9eb81949428c31d915e56904a1dd90df6e3071e606caa1d2f53f4496fc0ad9aa2a5698252a1f4306abb0eba9ace561e6990c69b09b0ea651b6ed230ccfda57620b22a8f89c768a5e336cc57c34be49262cf1b928fa9d5a5ceb3d7259b12c9f71cf1e99df5fd778523732f995b594a8ef33b4c5ec6b6587a59ddf6935ec7e34b59767406ec877bfa2351779e38ae9a8f2c239d4ae21d4edca89e43eeedeb4ffb5d57ebcdecb0a2a8ed1fbcb9c91ea8e69f2e32ad89d325792e7f2b188454425fc453b6684f8f22e997db9caa196791ab5b836d6fdb5793bab934239e93008bc28f0f146aa8c204328af92b3ca458c079336371c6e144ba8782cb4ac1f4ffd8879e5f5644a6d13bf8b2f242615533aad00c301310e1cea1979dd4a80a049302bd6d0050dfbd7de1697b564462167809af7d8577ddf5b3c5e453eeb8d77031fe8f72bdaf4ef1a2da345fc791fd695f1b886ddd01228139f26465876489deac23ed0e770159daa9b41a44846a05a3d1487111d6e369cd2fb061d840784b0310d63bf304e03624035eeb5342706f0174c88517c61d61d2b66d541b4d7eca8ddb3ee4204c6657d08a2f20305c7f7fc93daaf457703bbcd9c7fc22fd36b605266da6efd25e72048e81175f9fe8f6957fddc65570a8a400eae8645c931a0fad21fd4654225a3ce07aae702fb2a6250ecb7229e47fa6f9fd4c2b91dd0c61600be241b7b0a44d4e0c313e7a974fae67c72eeeb76f4d117ff202ee120a0779ddf7b57e35b818c8f748b1ce8395bde4b5d3b50ff774aee8e61728240fc67fdd066fb53f4e6657aeeacf43a0fedd02914e82d303f209196e52aef2273ec7f2f5da42f61d990e946aeaea24f025c3e5ad23c936e74a7f04c68252a3b544954e686308df6c04d75847f113b6705e4d33a018dc7aeafba2f5a23ceb408123ac238aca88f3bc37e4e37ba94d8dd3995d73a5657b53f0d7d956eddbc92188f9007a35cd19b0705e8a88d3b63443e9611610c1b67075337b32b3947e9f02c26acfae8d094b98e899429a65c8afed583827c5ba505628f85f053f690d3548312a5939b43c7aa1fc390f2164d4be3c99441431c25abf856bc5e13598e14ce3c401563ffe905343374c77f2c45bb2675101758ef7a9099283b3da351b7f4413c3a41b69997f4e158fada9cf90585ef3cb8e5fd56eebbf4af22b2a82a350cb090a7b3ab937aa7251c1e0ebd132990d251cb2fbe4ff9ca78aabb5076ed8f5abeab4c0bfa787a747a0cf376e8d953060eec5be6a8ba8cf1745d66b0e7c49da3d1b13f6ff5be22eb17e51adff554c2845adf618b59c6020d96583094846874c8616dc0ca3dad82d48d8f0fcf7e31d9966826b6b0f60af1d4ace31f9b50d0a2f246fb7a2a64ee8435f4274ae996161e82a2404dfc603d8b8b88d1c38388f3a0991d8607e9f01ac74a41b8eedfd83f06c9978da5567745e9d0aa7e4d07ff6210109bcf139fb5c7f5d8e9c24688659cb9686a06ddd68fb7f708321313a8bb5a6065b84920edb79329b3ab2953ace0579c8e0fe183c8f330f370308f684247193aec09e5034b15d8d5d74e1659b0e446e5daa9dca8afd6ee86066eb3c9b33f5deb1432b04c9fe20a0c0fe13e33d014c0924a126ce00ef1db59fe4b232bc1294e9cd3b2118e42ab9bc7ff51aa6056e83e30021ec481dba8eca139722085ddeeaa77981ae97be7a59d35232e937de00f34ace1d3501a43b331f87292fa46d916348391b1db33a227ae60322bd34a7acf3f8bec6da02df3f6fb865201813f1780554d4b3a1f239a22a9ccda8b9f2965d75de5dbf401d4d2e402000000000000000000000000d3d1f64aebec3e1a2c19bc4de14be82fab1f820995dd3ba7eb17354da7f755f58702ea9cdf8053a8f60b8a42485ef2861f29bd20d8a8eb23a920301af05e91cb7640446b0a39b447b1423c4e8f67a65993446ef0e62609b520495dba25ee3a43000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001bbbe6c2953c788c852906767797122256f2f5e5b5542e34a818494e4d04c37a7954a7c9e8ea4d82a785a66be082b306ceaf390353757fe4fe0f10d645fc9e24e04f54117330d01740be090efdb332dd9156f840905af557d1ae1871c06431cf6b415e87e624fe5a219d76fec541241748b2fd3b3898f8c9a74010b29e9d303d2aa70ddcc6c0d891aeed431fff3b8bea525fad45f7dfb2f6e850ee29a1ae6575b9a0be1108fbf4e065273634cbe2239a2f12a0e1ec4382865b7f067ff3fbce516ac2c9cbf415918f6f8fbfc99a46900f3f29a09766ce5b4e3ca5a6724fb32e735be9a156b4a17033cc89f7f72995022c36ee211d9a6a9aa9b30c84881952901c6f54e2e03f2e30f7ee9b3b6279caececdea91b22d6747595ec7e1534acbd0d2299799207a1be28b7cc2147f3ec11854ce93bdc7d35f8e4873d73087ef761ac7aac529016e6e965ada8c460b06af5e5c2515a415c41ebf468790ac1a74e43c74540aa7181928275ecbaa78517275425fa36199d2b53b61ddfdf19c283e63aba06d34bc240c4cfad5f907d47a273d5168093c737dda32de531b37207b9114975f8ef6012537c4df68427780dfeb7dd10f5a4f328f7c6b784970890bc5c47407bb7a31e89d33ed2ad89173f97f287ad11c4c9d25a6323044a6f1327a6135c47f24837b2e066b6b6761a57bf700230e768fe9b0169b4c3c8a5a16098ed9632785d825d73034a72df79cb2c9bd09e7d8bab404ea8c4e5b1f87a1c46d5eecb1d8f9dd652863f92dde340d9c04b98b07b0cc3766ea080e0918976348360c33875e22345e7c19737919451e3d43e92c13228bef3179f89f99172bcf0e77cb9966c8ec505f4b60e4756458ac928a4e72137397454869400b874704edc963f81b1ddf94685fd99d1c9b299ac7ecbc5efac9070a429341b4eb1b2b9956ebc857e93dbb8a90f91c661bec166055a8139ca4fa66ab6170663f2fa909c259072429c0007b490069b0c09d14a1be7d3f4b58e999c73e397eeab7e995f26636f3299744eafe541f30358315e646e8063a07dd31f74d8c5494dac30fa69934ba5796d11323bd0dfa455178ec4ed83df225535134e4b3ed9cda671fb71dbe071851aa59562531987f7c54beaa078d7acbb7c69d6879148ce3ede12a45abd9c2f0c93cac889029323b8c4bcac95cf72b25b543b662056f5ed1d7eb0e94ec67c8cc786d27ce9e9446e0f4600a2c35b7605c3a9f2df9a4da12304a98f5921acff8bc9da5c659eb3fdb88cbdf0682e873fe90be7b4b58cd6142fdd14f18e6ea82e518dd0fbc3552e73644e58aa079e06b3f970828416177c9a02f4bdad6ae7fc10fc111045bc38bce604de742ae78c53c31a0b7dd067e1e2fa222ad78659602c4a5d4180d070d6c518884a56a5d821f8d7748f201231198f1122a91c2ab0ff3302001c48ba3ec8cc59cec70fb67b045d622d75693f07620a30b7af186e096b626042f5e3567bb67474bafb5caaf4dbbd376357688d5bb06a11c7f4e94a6a9a436ca94fe27e483c7111976e8d70e4066174efa3c5a436f976781c90d74d2050d857358f6fea2469bce199e75b66a03caa59a0ae492ac869a42c633c30297165d1c9d206fb7c2a70a3fc9c7a05cce424116a1a9b2eef799e2873d6a90941eb4aa6fa46264aa9e36295d559712898adbc504ea60e5febf77acbb7bc50e7c0a175d48b6074eb1e30dc8ed24dd29e353bf0848f1e4019063aaaadc944485f2a246aa67dd098e9e9d1098010e4827365f2a8c5f7561816348591b545d59035cc460274675b28d1d50489797db993dec227609895a99aaad3551c2ff4cb290c5d5c9c00b71156b76f9aa7bd0c0597ba4834ef54d0ebf68521af3d6bc488a42a7e5c94f738d69f9b0ed90895ba3c2d6b2caec5b0716afe5aad069af0358fa76e130cf2b62d5b0e61f7f95d681ab0fed3b6023cfa0a73d809121f599d061ff1a84dd827ed1f1c9fb47e6261749b75abe605d3b639cfd9a2fdbff6bc0ac3ed4b2f09d8cc7f8155857757d904ed2d44d7c788b76984b810b059dbe9aa3ab3ac74b6b5f43ebfd6d0a534044164fd74850bf839c26cca31eecb549f34442d58af7c5e364ee11b825d3a013f552c01af8e5ac7dfd90cabd5d844ced7bcd207b7b9918b5e6fb8f0eafbeef742597f39a1589ba9ef39c6a50b8b45108e487737f71ebf833f78152dad9db926859741c1fa07ee80bb66fe528b4b5219b53431d53800e886f4f25e444fb6615ab5a4835ca82a4bb9f50c04be7e63d0886e7f9ba7a2f87d250c00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "", 2, 1219097570, 3925833126, "e76c29378237730e48ad04efcf0bbe45b024dde9e53f2eb4ea705269e9f44c15"],
+	["0400008085202f8901cabac113026fd2becb78a9978ec9f54c36e9346ba8e5294c2a24afcbf820fcff000000000951535263ac6a51516356090e5101c5034d0200000000096553ac526a6a6553520000000000000000f671ee04000000000323c272be3f3f33d4962feb9d3054de6d07ccd4f75d6ad6f9c564edf2c4206397e93e46e8186733c0186c4c4bfc95ea10d469c1416fbd3c7865a8f1e9ae2230406119dca3462fb115e188100acdc97729821ff9ef8504baab4d65f11367d06732ca8dcdb5a0a95c19acde7a6add6a43082181356b8aa7239d0a9150350bee442a6943ec18f3b960eaded6b6a85deda2496f09a5614b33abf063c618c1325951cf897b938dc3146ee5c0aad94fb0376632f769d1d86b2f38c78b19bcbe5dfb43c7cfa157365243af223d8067bed8b0418474c289a2d112d5ad1d9668c9923e750c992fc50b21b948aca770db2943e50258a892dbefd9ab2f00049da08752c31d32498699b08ca993a3a75967d8579628b2498caf3d1300fa45da39e917855312b8dbeca0962f25585661fdb983dbfcdc7d37a2e82ba490a6a38b26dc8546e952be0c04be7e63d0886e7f9ba7a2f87d250c00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019014e5b34c78e92c4cfa64eae37a4689951ab8f2d81ce20434da57100508a6f754acad68f2ab1088aa4053544321eaf1f8c1cb766b63f27aa5637b432404a200c82f0ddcb542154aa45461bd5d74b8d123db11d095d883d155a429d25658d04bc5738044b1acf158284d8540342b953cef446b0c43ac3d25e6c56a88e18c1b7f1de55d58121e94ea29a4318628b661e03a108c6b5d2d3002d5d061dabcf29662562bd1ce438cb841c1663e4b8d045452279105c87378c6b80c95771cde20ff6635a06f6e79a3c4ae872b9cc723e0092a31bac67eb099511d195a58cabf0da3be9b7dc4e7d61943c67ef0f65f9e763f16ccc2af974d59f152570e47a16249f45ff8421ec05a6e61e58db6a775a0871c4034ab95fcd86080333facba5e8453e14fe885b4b23742810b282db4ce5a404b2aaa62a7f45e8694194daf26dc3b5410d0c04be7e63d0886e7f9ba7a2f87d250c00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000018c99b0f296dcda1bd355a088a1fa6999456cb6c0b396c46e687723f5304035c375476330b1ac2fcd088fd35a65772f8c695064d32f09d6d01e5610fe360ae0a8a9d89da678e88bdef9476ea6b289db41467f13136658ab32481dc7f3cc5187c89ca29a5eb6f3919795ca1781860adae99a754c51fd2cea8c3010303d8bb0dd11770582d27a4cdf0b8bb7de0b97256323edf0ec713f13c3ac4463ee88965811d76813bac15613106eaad67f55fec6cf6eda293012c234129bba88ef5e4985868f1ffb83c45f268441e9de3d31d712e6caedbad2d124b0507e55a69d16dd5172347ef1682240185caafacd36206ba87a1e8451274ef7ea5a35ed639785b424a24a7ef59ed8b36cc7de5bbc7b0c0202b3614444461eaa7e7f39669cbf6c88847a81673f24f4ab2a14e4468bc6dd2c7f848dca24a78838aa6e9675b016e2705dbf00c04be7e63d0886e7f9ba7a2f87d250c00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001591a81a1a3e4489f208f19ef031fe34804661434259d7d12b035d2f80016d3c7e7a90a6c3f8246950b4512ff82dabd6a2bbeb41aef5f274d8386c93e82df4b267ddfcd78089dd1311449d96d0be18841d9a339a40b58ef23d8ea90f27c1121487fde4c8f59b23b6e802bf2e7177a5e355d8f1ee752d1e3b174d99e034b07b2d37f4f484a1294ed44ecc1f6a25fabcc9e3b0afacabc49c98ec2376152bec4d3271f6384bef0946a303d1cc7c29945de4fcf18f7cedbedcfce2721609b0e8ef815a4307ec11e63ad0f36508deb4ded36d5aea76c2f0ad8783531506bb614216940785647818e82b55405512bb8a0e32bead28f7a478571aa1b566285ae4e5bebbf1dc1487aa609526c8dd91935b50172f0595d6934554d5e047aa220dd1798e0d71a99913de5a48e9e3ad2a38cd869b66514853a5c536adff8aabb3f3d705d4749962b4050222553673633ab896bf08ff8b8731d05ce36dac32fb2d43daf5e6b24820240221557628eae91494d1df1adc4dd323ddda11ca70943f9b52599e520b61e9e5a1a9149018506c3a7a821d7066997cbf27d5a56ef8f05d188b471574584bb97e4440a563887e4e77fcc9dd47c74e6df90606ca3ccb2bb566ace63bc179ed77501ddc860a06e27d869eefa5b00e6e9c78988ec058993bc9920af27cbf99eaa0157bc5f978e751c4f45f7009b6eabbdf1c59bfa9578b1bbe6fe8886134db4fdf9019a4db38b78d9e76b71c9e8a6420104a026d6c01920b16861a8b237883065158495ab29e06a3ff68574509c5637995edecc33773ab1976ef6707e55847a882d27ce3f144d69d4889156da2196db197bb0bcc5063da09c72de07c2038a3ad7455cfadfc2fee389fc48314721933b74c97f4fa89dff755d80c54855b25509f4ca7093a6441af660dcd3e2127d81478eb4b4634816d60ec4855adf9f52b62e5978ce25bb0999c94553ebbe644712dd02f7777dd143728f3a5cee185d57d615157d2dd837acbe0ccaa4755ac02ae2bed30da98d6eaa20d7510e88b9d37ba5c760cbffa600e87dc26b72b0aca7d8b2406f4db667865041d606d9754f4a8da6fe24c9d24a8fd1c671e6159047b0b296bcdffcabe09110e43ae6e24f9d59396ec70762fa58bd29defea9f918dbb3cf270639cdf7ec432bdbc4ff0bdd1ea1815135340f443a6028abd5eb82dafd58e732eafe5cac0649f4ae913e3a54eb34781f9ad89035e4b1c80a31c048dd3f7927760a7d2b6ab340f37b3631c44a885a66c1c07e83d8048d55dc95490496e6feae473d2eda7cbc2264d1231695efbc322d019f40f9d8d2036eaf20cad88edd8e10f17f6e0e94830145824c0500000000000000000000000064dc1779db8ee3bf18493c6e1701d3883d913862c85e4bdccff98e870ba060b55c5bdfffc3a2efbde6cc0777d7d80d4a342bdd7b944ea85cb6fe4bb05089ea896a3092be7b971731a7eefe3065c2346bb15ccf5a87ad549872b8abe45ed88d1700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000eda82bd4aef185441489dd64f0af12e8d0019460a04c7811d30af377f9d1193647e02e188ec6cb6ba99a88736dbf907fd196f4c4480ff2aacd6ba08e1096c3cb92af1e23a13741d9025a8c9f9c184663e95abe0ba4bcb40f3791956cbdd6ffc2adc1ae9cdec07db356d52368d379fad49104642d8eecd4e4c265667d7033a569d7da0fcf2f8ef32683ab4280972c92742e14b7ddebeb2a67075c3b4e48712ccb2a0261f48fa716697b7aba8a05dcb2e460aa17bbcb8a34dc6ecd35b1343e83d783a4213d6ddb37866feacd87bce834882de3f9997e66f251a31caf77e27014e484ea9815e0cd61beddccdc33eddde5e70332360af7b198043fa01269d03c6ef2eaf8c1d3eaf9bcb7f3625fe21cf83f759e9aa03d42c9215046a98ce6cace0d8220e4f45ccf3071eee31e32c4c3a7066c9d758d01403988a6b9eb6337a2558b6fddf8360c17d6fde8d06774034b7249f55642e7ba63d09d2db315f51c6088a8fdf3531cf37a83bd6d9019b5afa0b219d310a3f524b047cc03730da58e8cee401b2dc7cf20f85780c56d19820bf77355b11649f737b79af2324f74a88e11bb28b56f134423072108292401e84f4651ec1968a8441249323b4d06fa18586cad60fda46cc258b13fd00aadbd1b0ed49017da7d77da1b81bc3be7fd8d081bb06c96f375506bec202dce5e7f2580d35865ad9af6a06aaa7be6ed1cc539212a743be0bd0b660c1f4ab80f795b311b5df006930595440b91f622b7f7fc962ae466a9002f30edc64fa9f2fc052b5dcdd4f57e9d325f7db6d19ec35e7b986a30b2a468ca4530af2600c01532abdfedd8181b6d494ea2242eba3bdbf91f3c4a5135926756d2df5da3a994a9057cbee00908c32cc7efc375cd9118d416a7c520bea1851749cd8d4902e69d19ca0eabee4323f8d575d1106351f525233d5789afb94206111742a1c0cd73eebfa58183a8571b5ded4c4d252e68531e684c2771d44aa8ec96114586fdb10f0265fce9ced8dc5d129599393cfa60901f311fa76533233962210f3fff724d492a0a2e0144ffa24db83207cabd772269e1d76d38468e249d5e49cbae29854ae9cd2607a0deb691238f1b6e8a89a7df4f2dd9451a1c225ed74a3dae383b0c3ba3668d6f268bbd48c0352bfa5b19de230ffbfa58f0625e77b91903b34d31c18295d7e1bc85ea6e3d59ad4e19342650ffcd4fceb8d246e85a4298496d308ead73673c67c78a011a4220415cce6546e73b1aeb5e6d21809da5503ce393bae8096fe5fbe09d0db5345ecde78bcdd2b8aae506092ede942f0b12c471dff266889f0ab4d7f45f7d37120ee801db64469a213216d105e70bc56d440e7f0b76ca97a153cf8521f0922d571d076c3b94455f978bd410b1c5fe5651d93322335ac3328c64bb729fa5a0da2deeaf89a59fa1fe178586c2185ec8cc254cd1e6f296923dd037c88021e99fd1bb4461fc3d2ea6015c1f763f75331256e14d7774a34a3075a1e0eeb272daf556a5ca5b983a55cef34e9c0b1346603f30c237fce9b0f4f56f0ca68251b678760c804bbe5373cc5ed5caaa12f5ee53b3d153ab27e541d0bcba46d18803ec28123f130993de61bc452f48d9b7d7a36ccf687bf15fea85779c559fddf8f630950b972c9660c196a8cd57aadc50f7e3f846c73bcf7497c8212cbc9f44f9aba954713add066f78f6955493c0ca542709b597a8d417ac987e1068e17b4ed264bd58d4f0cd91af5fbce1340affdc7c9662bd42db6e5401a4eebee8267902cd91d9b9e161d85542626c7f3584b907c68f182a53f1752385f42d1735e7b576687953df23ff14eea3bff3c8e45ff9b7f83a68fd7412e604b5d0d20b5e9de14d7a6197be4388e03d100e07bde70603bf940610c9319e073882fa215f389e370abc2f9322735d743f98d0e93f202bf3e48c07a5952bcc74229c3eccf10e9ce8be6296b9f6a25e77f9e12460f81ad700721116a3a4efefdc7aabf4ac4663d900b205be390dd2ff2170c9ac6d41d421d2663ae2c6fc984419a50e2354ef3a94acc3ecfeceb7266312d0623800e0991bea467eb8c4a95d5cbc2c386a05f6bae66c83b094dcc89b5a2131c945af2276cd1abad17c8fdcace236acdf35c0dfcaa676dd3de1d8f68a658f666938c86de52ef2453e6b8b61494368996ac4b6dcd53cf6385f7e411bc33087d6d7d40d3a38d2359464928865c375e310a734d815bf3a073023cfbb3c3ea08182dc97d196dce34d7510dfbd0427a7286a5327c1d659c67d063eece0230e00a4dd047814be97a80f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "6352656563530065", 0, -427722781, 1991772603, "b24f18d37718351dd9543bafaa4571bb883335c39135e757dc0a5a9a4c051267"],
+	["0400008085202f8901a878cf19db0cb76275990893bf3ff4fe43c6bfcac272f080b39c78e71fc9585502000000016affffffff030178c30100000000036a6a53f7a665040000000004516a6351cd78510400000000010000000000fdb61002bf3466040000000002938f61159cebb060e3876753d1a31984a53695f51f5de9872b8f595d5f2637d51a96518c8ad003f1e4532b67b98476c893c4ec5c7063525b74723417f5a2085566daf8fb7238ecca368fed2663aae49220904e76476534f494cb116bdf02fc48b08d66580c99c4c0053873fa3002778d883686d4e4ea077499a419ab85cf38cbfb48e3675be51578de7b5b3b96421b48bd2c683a14474b5cf93bd2160237b002a4e5234ed079da351fd357a867ccf15536f97dec33d0155074223474199210c890f7c41bd2f9a4d9d85e36f81124ccb869a06bacaabd845a014b67e31c9d4650778bbea1834dfc2d1e2c603bb907d37da09116211ee00934d769d6ae092a4789305f7822d87b0cea5f6e4a0e608527a0bb9818a8be09e3092ccea3eba958891dc105572885374dd74b673b29dfe8c142ba70f5545f0d331551fc4e4d8046d39d063eece0230e00a4dd047814be97a80f000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000c394a7bc8b5b88a9b08aa993fe3c91070042fd28a33ca50a721f39d2818fe2175a4d630dbb3f2b9474e6482c6cb83bd574369441ce646ee2687d8a416d7135306b58d330293852087879c9040ec60766fbe418f910569fd9ca9aeafc5df4d3001fafd3b8739cd6ebc530801e8e60198557d333956886e236d5a144fa41acb185cb01576ca8e3ffb2865c2d3e810ee980449d13c766b02666f65a49739fd845222d4609357f2c1307319fb8975eaa60f6dfe32db5d9b5f6a45967cc2f91dfef7503c538e7628de90fcb717303ffcf1cd176f1f7ed116bd67192259590875677cdb78d84fa7a30b4124a52f1e97e41e64c1a4352008f2bb502ebb52e4030fc47d372a92bed758b4f3f9b69bbb1b8453fd83beb3d8b19a458407a27e3a30898561bbad3ca461d2c6b5f2705b433457a366ade714cdeb227251e80122aedb30ca0d7063eece0230e00a4dd047814be97a80f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002c3d4c3272716f3fe49c0da92de141b31011c52c5ff442e26d46d3a7c3628c4da569fe9217969d9db81007d6ce04eb2bb81591a751d5880539e7a5f1af3c5626061627543b62ba943dc4c24827627647716790558f3080464f4731dc9595bee91ddddb78e6b153a7d5be6cfe2dc6c03f35caf37cc7de4dd4146c7cd5f3f6e7da216d6c63c368709bacd191182c4fe0c4dd505578cb3cbc8f76a6d57bcaf074e9ec7f1e2f46f066c162ab5828d2197274e3181026cd41e1505769669544c70c520e9eae6371386b489c932f36879437782fd455087a00fe33e1b6914d3d0c02c140c18957dabd6536278126e9cdc419d4e958db5d6709eced010e1fcaa6d8145ff58086b173b6d7988289ba89f53315094d36414146c812010a5ab13ccb0fbdb3f43688c2040254472e1e8fc96ff2c90f5b1e5eb117c9bff35ebb0544c97014bd98b87e431eb768f3cfecc78b2bf08ca82d94b7401b0a99c132991ff884263bbc7cffc9763a53881819be5422a53f65ad428397df19b6d76c9fca5a61039ec029cebc5fe791eb8d957d1fe3af112929da9a0c862dd811c2e7c63e5c94ea80e9aa4069283a197921b02ae52d8993764a147e91e24596c49487caac1228a9f02e76fa7045d0907816a3c963851afdf051413ff7b2af45e97dfddfaaabae6e7d024c43acc86873cdb3d0f2dfad525d013812ea2fc553ebe3d9dad3a897d71792d60d41e39cf12af46b896b58f698f3a834a1122bbc60cd02d0192ba27282ce9ee930cb5fad64e1944c65edef5cd952ffc93a317bfd96b57371531753c4c91c72e91b2f53ce4ca0d4b9bf5c720764fef22c105275fc5b9074c067b9555150b9f9e2ab009aee754f8a84c6ca3651e1815f4204c15074a2b4eb52632459c98517df37806833b5c5aa8c12618ab98ace762645af229918678eb32b1860011463463ea00e666dfdbe4eb2467db895c77445e9b161256455d1d02480ce1341bf7f51b56230733f4c87586bae420ad4b11c811b7b8eef426fc52fd90e4a8a92e639f6ecb328178f46d9504c7cb0b6a9fbbf4f85aaa0d2b7baf8e02f47c9ee9b5dbd48f8425befe48592a16720976627182d2054a812601ec75bba48f83a66ac975a1ea3012ad94da4bf4d8712caf21534db6c96486a9e51d3863cc71fb0350faf856376d7ed3132d1bb305057bf884f42534029500a9bd6b8d60f2e606673a8c5f2df6489aec4a51cb9fcfc97a046f1c38537a45ab7dd206740014fb5065dcf588b09a519906ad6c00099c384f2581f3224b58f52b15f6acac190b719533c6770e806fb9ef5adcd1bd7b6419a031d353648759eecde5878379777d27a46373909d194e91da540daf16e5746cd5a9201ae456a1dfe2b44577bde1e913934e618c3b7c22a1fd3da0b1565d82c02c81cce9f967f78f28cc712f034aeaee41310a79844a5ebaa4da4170a013e1dd9bbba4cc226a798a14151280bbb9e5402c59843acdeeff57fb0553d6b5743099d5518a5f23e0481914cb5956d34715571816d318483f86a6242b9d828be46d70edc90c0fa43f144235034b9fa5fd0beaba632c260c3eb3a7465619c5ca99a5ec6e91858567e5a69ba7b4a9edae981de9c24e65378af314ddf7207c6c157d628b820786078aff8184b0e2a5b83fd08cc1cdc9a91fb439ae126c95e4d6dc287cf51ba2fc30256bac7b9968c8b4d7e480d8ed79f69aa747a3b83aae95f59127f6ac1244ee230b2ce944d29d17d221c598085fa0b106ad83bd37a485d54ef01e18872686adc1242eb18021395066abc60b02487837e9f6b4e19f1985ad6679b8273c9a2858fcdc58618f46ccc062558a25dd6aa8e87fc39b4c02bc9cba882d035e4f66c4d6aaee70d49d242862e77c85ca6d0a4d686ca178e4c4a6513cd3ae2b3ab7ecfa50635b4e63f71094adcefb76d66d46da29879fab50f1144e1b5c85f0b87b4b97025b75b7b656ac6ec8ca0064f80220b2c132eef3ffbad88af39c9bdb263fb55996f1858edcb94db9db541738e21817b2a97b7eec8a74879c15d49c04d9eba3401a411c6be0d09dca6d28ddd960d5fb4dac035441b5c297aca314a44af8ed235bae7cef31283e03c61851db7bd71b05b8de45bf8fce16c7a6fa811ab3a1561b3563f632488e94f2c83cabe03c63cb1efea1d2b39b1209c530bffad4d98c0eb527370f143b77422fdacdb0663bb5ac2ab860f804505dffb045c8a815eda129696e5a053dad6c7769cfa5c45abe8c4ee93fc15945ece4c7089b557e94a56710c9eb7987b6d80967160cf362548f65d2f14aca5bd13db6c208852764f31bb6a786cccd3f8fa490fb4f77f0b9a145161b3b7cb103c4da81fc8e5ca262a79c71264c9d508d4c04b659df9c1d2379c8446d9eb4c3f8882d4a8b3c9ac8b0eb72f4b4815695fccd40db56ae208f5f8c2b745e98f8a545caf8944c2ddd76adb9a2be27174005534e9c3847f4bac2a0f9aa9e8651aef2c11819446c1bd0c7bb1c687b74b47b76c51a8f83c2e4e4f3159322c37b3b0976b17d137b6374bd73bd3910c9f8bc5264e2fc43f8c0d54f582800efb711fdd2b3274899376239c0556e088ff14af84d6ad4222903485271dee1f4a0c3de765925671ca3bf96e3585e3cac0b226b6c15016ef2591b0e720f42c19b2b96c585375b6fd1fb5875134e570c11c29d698c6902000000000000000043ef4800000000004d76ea08fbb306f80d81f12234c31dd25e8ebaef324d404b0b0599a6d56b011a8f537226cd2c6160287c9a97d0b2ddca0801cf0cce6ee99f6776097a9b890f46f0b2851eb120615de7434668d4d93a2aa55d31ee33fe84b0a96ad37ea92ebd0f0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000079f4295972e460665fdacbcfe5bb553803af900d7cba898dc6cff0d2d03467898eb7651429fc6715c5b7b2651d7016b9a0423c2411d7474b51fe8e3b7007da504f69d6b192956ffc04fcc4ed474da8557a5baee19c03119f5597a523c0281697f1cd7518ce1bec82a9fea08361208b823d0d85b0e7fe7a0fd168df476ce04cfb61a4fb7769794936fd90efdfb20e1e435d4916c28b117bb286d2d1cbe57cc784c97a976199930a2a63cc1e1dfbd001bfafad9ffc4ae432215daa85067dbd219abd52c116aba3920cd735d0e0876160811f8bd43ba7e56c0acf769e91314ceb80d976af55876c31c1e6d61d210f2129f660661d3b9b6ea3a8fb790a7b47614aeb555ef5fd080f726b2cde5fd7b94f24f3d18dd74eb82f99cba9d90573c5c653ec0a2fc1468ec4b384f0ff0c8a11395d58db3956f7ae868778055326138dd479716b6c4e96c2b52eb3534b9d782e5878c5a8f73b7ab664d5ab2785eecf392c96758a9583633756c431c85ba1a7ac863aa5ba6513ad66736d419a7f1d7f3fa919f0ac28e485ced03d7c4a98078211b2097b13f7a87b1b54c2833582a1dc86793136c105dedc7f70fa4dbca1fe288fbf8b8b291250a635a8fb09a9125f9e904bfde3d815abbc777dd649cf768ffd6d6bffad954a0cb097a70c16edae0a09946db2efe97d65906f9178599c6b9f455b1a7fbf4f5634b73e047703eee15a9a4757049331211beace077e77a7b09bd2a1dbae2eef70c9e2449fd99ab1a7cb0b89f1871a168dda6eb2593d52f12002b44530a9ffc86e903fc4fb72e0ce0f6f7cf070e74b0818a411a54fb6477c206aa7fbc2e42264489614f47a24e3e149103c04fd981f8d0178efa86a38f99d4811713575e928268ee51991587495cfe9e7bd0e25ed45e5b07887501ca8657564e12f02a3aa133238b19990f2a7a6037457c57d6839902c282e41d43967b458fa1eb439e0a3f2fd7b9eb184a39700501f8807d0b486518581465c78a8ee7aecc3e611ad3bb03f72f42fbb4e7f6210d46ffd6c39d97970269dec80e64e5331ba4aaf90353d25f4c2cc32daa15bd4788ccdbf3647d6013b9d926fb819f99e2ecc1298ebb10464cd82d37fc4669416b1e75b157745bd47aa4f9476554e4b0c51ea23f5654ffc2b7d382abae792586b83700ea0e4b046a86a622a7ff56f37356f4c0f2575c6c683f25796189c474648f0d8e3415c7e57c3f46fcfb6cceb46fca4c5b50d4d3880b9c2954f573ffaf171b4048594ad4b6ff8edc128139dab5d3369792301c855549931a6f822d2c19d3a1bfca7593af0fc3408c4d503ad65090c5a66c2eac606cf1138a0553258f1001541d87be0541011f9a511dfa9681a6bd34766caf7f5fc15c52cb035da8f64494b650310eb3e580e3451ce9c176ba1f7a00043972bde6ce68af4cee40430fecd95914ada30d5a40d24aedf9f54d615f7e32f17cef3d09483567e2a4186e83798255c63eb5f82998f79f177ffe3cd3e2696d0efd59c65e13c2623ab56782a28f62d9e5500840a9a2d73a10afbfb4dfa89561fc281aaacff4831b22b7c9bce730fe8f680d7d4d00735baee1cdb584179d2437c706826cd3bd167a82c092dfe1dc5565f9a855b6461426f5ddcc9b810a3b95bf10e42d03214c33202f6b6ba8d1673051598bdfb6a7452921481fbe9453569845e5fa21d737fdd76cf475cfdfe5db28a99f1eee9753d3642f72bd26ac0e08237a2840db976b6887c4b2bffaafacfdb658860a808d75656233fce8956f01f726a4cdb6d6c3d11d2a750f70a50a60298f96b9295bccf07de4f67dcb095592022633d31295b54bb23d2d3f6b39bc403415d168ef7503058e5e1e7aea7132fc6f20d175fb87a654bd9ee95f13807a30d8bb6adf48d5356cd653a0cbccd6c8462b1e7d16184bdf9c26281db48fd5d36340ec8836fef233e63471af9670b435a0b58341bb1e602a4671300ea158eb6f4e312396cca86c7c86c56c2e04f2eaba64bfd3578702cedfd03390fc710adeb0cc53458c534299a293d42253cf11b25be288648497d7690bada7924cb416d492f68760b599b4bad4feb03689853d80e804e68a2c0c3ddcec9f41bf547cb1bba21054bac48fd9b08cec5a07fcd20b5cf416a8ee1d8d90f04e0022924a681200000000000000000da73e50000000000598aeafe1f640f80438fc10ae740f637eacfd2d6ad95df26448daa45945bd208aa09c6c4985f192bc19679c52bd48c39daf7b9a93fb1076c239b42659f10b713abec879927e3f5b1ddceea0b53d3aa726d24566b4a33e48b5d2beec5e4fc080300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000c5e8678c983cd0d3b1363f22fd8020481bee065fb76f47f183eaeea213fd8b3cef5384893c631dc1d423aef2817ac186180a44a19a3088b899890107ac4a92e48662460e15235162a4a229a874ce8b516eff19c5c25765bc4968f438e1c3b00906d721b5d8f5736f8cf2018b6da0365bca55cbd7f3baefbf8d18ebc618a4236fb2bb1b3149fdea0aa9d4969d0c8d60b19b51ae8a5d029b805debfffd59411d239acc27e59678a6093c7d7367aae6a8d4383f2f11d3246088e31a214e6fa168668011867bf2832422ec725976f33cd6855f700a1ed1d0d202a303c6720820bc3ef1e6475c6bd48409fbe0f38953ccb2c3d02c64821b5ef0b6a3f057dfede0e0a25ff5f36287a4117c5b3b957c881d237088077c083ced0c2b0e51452a364456616ce042095bc10cae9f3b9cb8f426de651f0bd18f2c31204af2ed63c6297910e2ffd2577862eca6c026eb7279441a191614aea66a015f5a13c0eb2162a5b5b4a8ed7768171c1bcc8ceee801f2c8a174fd1262a7941d7bef06c049148e00e83294adff878835af6d57d8351241e46d3aac341e96d07740b18f7dfaf0d717bc06523e00b0bd4a9d579e01e6aa7f5d60ac39220e5568dff37eb7ab97ed810b054d7c7072a20b827dad25312fdd9c3efd3c1c224da54418601504c031fc4b66ff157c73c8537d6b3fc878243cf256a4e736578477c1999f8deb5b850d788cd70fdd6290ef50c7f91f4ae761202cf1b5d80e98d4522d94aa72b17dcf4f9d72080767affd827b88223eedebd4022d6e2162af13d2792bb9c160d4ee10a2ddc689ba6ecb39b42b1a40b9b958e2f3e79f9befdaf889c70ecd9f3cb6a3dd6253023455635238bb787a2550b60371afec987ad224dbf4d34594263537d2040b4c3133e0a8c10df02fb28660686e2bfdf4289b4430405772c09da382c395d69fc5291c995703a5c0a9b18fed2d0db8275becf6b9ac26eda921fca089a004f08c1208d7ca7e2fd664da9820cca2e0aa62317cd4b5bec00f727223d9d64d4eaf1acbe5be99ba5d2547eac32c1f203f1b16f2eb7dac660ce720af99a23c3a111df67f42f935dcd8ef1f9ca1d98084f08a686df0099fd0df747da53c26abe662564521dcfc6487cba929730c73b023ae3090ddd32aefb3d08eb7a4220d0cb9db5d4e5748bf0aa3fb5564cc69046714cf7491b84b331159e8fd3056d09779d2ca419074171ea5816b565c9f5482b20863aba29302ae5f91e047f4bfd5ec24d8d68d226773832561c31d59e65ddd99f1ee3f3e7589fe7065e35cb43053c819174cde1ce150bac1bf22817d2af0167f165a6a5721f6561751487daef3ee9292a451c39a8867eb416b1b4e0135e844f39f9488859da1ec104151f61bf13d24ed05369759fc440e4b49204c6c7cc1c70ac1d6ea23f5f6b6c64ee12523d895945f250ee2a93bc1698f97227242fa93912fdc7a37d081fc357f2dfda891ac54cd9a807202f84c2352272cb852b3abc720bd3a4d39862f7f3a38b50cbd4122d56e2d1440936c4f3fd7f7526daf4020183517acc57e798451705a7d9b958222850ba04cd502539f58d2701704903589366d0c0af38fa06c55ed6b56059243677443d878d01d90c3eedede4e1eb58389d7a1af8453b31a76957f895c149bf36f23482418e6f36d69cf3ec5c5628a0f56b2a1757e27c5361f6aa50302d415baa643e0af6f138f9bfd9a4e26a6a521ca59bdbc210c6a90dc04e01950c3244650472036f4d39f6042fa071b81d59c165e8f6cde9782a27e61c721d6d524876085ea0a779ea8be4b0a2291d8149407e7ab936465224fe84c9fafae29f1bb7c0bb07dc5a48ac3a2e4878cde52d4b51e7dbf48b46998cbe6d002ccabc8f7fe450c6152d7ba02ebff4741f90ff128dbe1ddcb6ed5fd1020686fbb08fc873f42f5c4f721bb510414d0d448ae73f18f9d52394ef5e956809475d2df3ee319b7f1673182656580360ed5bce75f3718bdec77a4275d3bd179190996fbb84ec64954f7d6a97122bd233eda2cce683191bbd493efb905ae7c099a5766015f02c4d5fc045231cc5e409e86ff70ff178ae482f64120dd189961b7dd259109074e53c17f139160664f082baa0dccebdffc2c2e7db3ec36122453c95776483958ddff9b2114b832f6d572d9e98204a77fb8c3685c94e651d35b9fe978889985f80d43d0a08f8d403fc07b982eca30821983d925d10dd0588307e46e6f3d2d63163c0142d063798f0bce72824ac6a294d246153d389774f9672884320dc1922fef5d9a3a2d21d70400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "655365", 0, 1403923525, 4179206552, "06890bd008bfed72c942490189e42bcb4f6a9a4afb58e31d8587918a50afbbd0"],
+	["9daed602042216f908ce5cb132f52553e3c6cb60741d73be121fb63a11f466aea83c3883b00200000009636365655352516a65ffffffff180b81ff8b98ed23a74e23321c9395e0624dcb9f69d9fda22831cc0e7966df83020000000463636553ffffffff0cec635900685a7ebc7a12ae288fbad4519356b9af0800c5412ff0c8e0781a5900000000056a00005363ffffffff8e981f5528ed59f0c75785898991ae4ff551e97e5a892384e7b02651f954d36a000000000952ac53006a5253526affffffff01e79bf3010000000004656a51510000000000", "", 3, -1452350978, 1953719636, "3ca25abd093bde2a64dc943521261568323b112cf0bfe027125fef7b3b412313"],
+	["26e20e2c016af43d981c61090878121d77db341e0ea36f19725dab4d8a8fcd6735ad17b24e0100000003526300ffffffff027ee2e4000000000003ac6300f3f1c505000000000951656a0063515165630000000000", "6a5100536353", 0, 1663868486, 1537743641, "760e596ba9983cda1f45a84f5cf8ca82579fc8bf1e51d45bc25860f0cf9b681e"],
+	["030000807082c403012f5413023ae2a4828ec0997085c1a0d75764a4a2ec0d3da871f067009f664884020000000963006352ac6a51536300ddfe980295c9e2000000000007ac6551ac636353a5f5b40400000000025352000000000000000000", "650053", 0, -467308038, 3925833126, "89478621f520ce1d4ac2a94487db4c589d628a40dbb077025c83ae1252ad8923"],
+	["030000807082c40301b8b2be6d44f6f65955f829449748c850810153247277ca897fec466ea08a2f4f00000000016361b8126f0195b5a60300000000096552ac00ac6a535100000000000000000000", "6500", 0, 88740780, 1991772603, "d674e8e4b455373c1724c322a52447399d7d523eaa67362bdf6c811fe5cc7e07"],
+	["0400008085202f890338b66d1d352b77c8d2e69e86e4db96b27b152a1db37f83e0edbb158079be632d010000000365656affffffff8678eee05136a1ce1df9cfa71fbda5c5c317cf4b05a8ca41286474cab08154c9000000000851516a6a0053acac2adf26d7bace2e451b21246b21dfeec1e85c91b154b6e0dce21e05328381c9679599458f0000000008636a63535100ac52ffffffff01f406350500000000036a5253ee4bf4aa94048a15f5228b01000000000305d6bb1d582968c0e25aaab4ddbbf3df23349af811821c6f83b38c6f4cf01e5137cbcc66e34b45767f29dda952bbb93961cf97bf1cd97a5853bd27e396efa924a031f8bd64624f95247629f43c350f7828ef9755ddfc7b319d31f978028f37aa79af9dcf4b4d7a3e39a7385991c9c06834a2b95ad04d83da4442ff294d76172c7f4de1224e498c34b9148913b3befaa4f68ab31096f086b1f7836ab5fbf0c85ca09564956d36d4a4dbb7925c728d7025cbe79d04ad13c3786342f23005583184f9c74e4b29764167a33df514d7f2ace81a214067a540197557ef76787959f92aff5952e0cc2e4b2c1d1a671cdc500f458b5e1a690c27f2e182d5a04590df176ed21f92344afdcfbb33953f3081daa7dbc5d99c6968c2592dad794e57ce48be56473a1ca3fed17fc13dfa39505649d67ed21b7c045afadc35d031d5837a28a61a672884320dc1922fef5d9a3a2d21d70400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000073ca6b65a1e59dd876d33d3c7108cd071c5bb35e22179d275fc9234bd432f105234b8d140505ff3b81cc227784e20c8a46873a803afb1ae3725fa419274e6725d767736fc29fb4fac13e194bc992fae9b1803ce0cb6ccbce31347ac9ab1117623da2ec71201fff5320e57b87663325dbd448e64067deec60ee7bb91176b7880a07e6276acf550f39df115aa7435ebb0880543791d332a4f4feb88fbc9de12d35d6e06e7d7e005063838f7359d2a5b3082551504ce6e65fee8e03324def797b65045b519b6624e3121f70e89d557804a380164ac9963db945becf9617552ceef28ce36b5944492ff597e077540747186a9302b20f3ecceb2440389304d20de9faadf56f618212ea513cb28726fc917db37b951954887247aea29a4c8f00eba240bcbc201502afca72927cbf152eb7a2dc78fd73c416f87a4e995139f84c1986df672884320dc1922fef5d9a3a2d21d704000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ff3a817fee4ae7435bbb8c7cf00f33ec4f333ccde7e006ea8527c6f93a4a3308a08ec9943e2a45a95b6600af5da0df35152917e686fcd7c56aa4732305b15168a2094317b18a8a79145a5a885d6094e065699145ba381f1afff46383632442a9a148f1511a90458a00ce3bec85861b1d0f3bfe67869116e2a0ac350fa7abd2b449daac1f1ed9084707bcf8ea2bc85d11d1a80368de3ef5e6139efb5c000e49ce399865d6ecb96a484117f8eeca05f55c6f8e867b0ffb6c2f1ca6e6775ce612f68a439667994e36ae6fbe64817f3dc086ff4546e689a252b8114303a97b445ecb84b00b69c510f37277f7950d42a30aaf057f5a75c0c5d0a025871912eae705b9dc07ec7185f0eb0366ae102c2549be9f23517062870b03a1d2127a3a5be81b64f12f5da5f8ce9146d34e0d55d0ac2173179784d2010e3a0324cb61c8abb4f1c3672884320dc1922fef5d9a3a2d21d70400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001b5bedc55e63e00e42f866e3aefaa0e4f7d482c213ff913cf0b12c44424ebe9afa9d5873511b9ae08a9fd62480c9e4cbc9e72f092c362d16a3af885fdcb23f92c66b2e90c6d10459265eabab4f2caa5960a34d8d3734bd32d068b34ac11bdfd9073bb6f47c2aecf52674f737d25030883fd9fd712361a4f1dfdf6eb7e684e510e8cac774a57514c00fa680ba466174e35bc3ead4586bc8ec856beaa22f157570b442c39bb2c3dd777f9de83479dbe834763af031b44263cc490ea6011c042d158c96004e3f46631bed8e8cc5ec2bd11765e54575dbc56f0a372ae784ed40902762cd34e3a0d2404b0dfb9b37c2e909564bdcf557390542d21c58994eb9ae81734b38c08228674b5902fd81f916950e5cbb8d53f1ff7476149a7cd005efbae5e675104804502b680c8fdda6051384d62b96f9b7404d02edf97daf6beaf2492108bebe48f7919ac3038ab933b42f16daa66ec5d69e11793d8cff81a4e0874c870badf7240bdb183f362285026f678f258b121e71ffa1688cb3eab31bae7cf9f61bb1f310c3190d7b5668a411a82cf9601b17f28af1c7c1355579c04a1f22ef7e606101c96360884d3932df428cb29ec623ecbfb36f84b6ef0a053c53241c17dc20e3bf03ce46cc1b0be34cd4360fb1d0c1ecc96902a2a6ce9a6b001b7d93475c53743d170706cc07ddf314a1d8ff2f2b25b0225e014094f1957278b0c179a3e8b0dd2a3649abf45f01d390bd28d59c68cb407174b66a4df5d8692faad792800d2906ccd455fd81864430b35433a89c9bb4f87937eeddb49070f49f3c02d43bf41baffea640559938678150a96876895fb9b66fa88c1341e68f867154f5fdd1e2422561f0ed2a52826c037e89d9ef1f159e2f2f4aeedaba8bf90ae2b0b6b22c9af3170b428250bad86d5f2d08896acab36d6d9fb97f3c294660f636e792c82d24cec541febcd872cc965a92bb52403382cecbaa8f9a08052ffa0eca8a6496edea1c1c9a4288b8e4be99afd99c95b336731b45ea71d603227d0504caf3fb37b2255344ef631bd8daa4b9506aeae514687d0cbc9e5148a33c2d3c7999cd9e7db7d57a75964d925e876b6e6feeb3e9b5e2fb8da4cc4e93bce5823be030425e03d9c3312c96bd41534e7bb5bd2325afc1ce2e925ac8376c814d194984d06c9e34dcc94cb2f5179b0911a3ca1817fb814af3d33aae21b21561bb2390e9446638f78fae9ca0b237e043c1581752f1a9cf18f12368a1828507fa9790b83ada052f5d873eedc6e7e5f24d0d0d5beda527613e5230cdad57718ffc25bbca07b616803f826caa71a0626ccc73ad130f6c24b444548e4630c7561f30000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "", 2, -1640809497, 4122551051, "be10391db34d2fc0242c02c67680c454b3001d21761dc615904f58b5d20adf6c"],
+	["ad01a9570274c0f32f14b5d8f347fa2d0e1bd63d521f01289d725142eaa3be00fd51a16b2e020000000853ac006a63005252eeeb236064d4b5aee70a2233e813e7d285122467e277f358c86c9a3f19b7e612d38fefa90100000007635353ac005265dcc1180b0251f60c00000000000553515351526db47502000000000200ac0000000000", "", 0, 1367496857, 1537743641, "95b40d62ff9afadb08f8b445737fd1f10f24ca096bc3ddfbf2004b997f98dc05"],
+	["a9ca300a035ea6ca1c53d3a2f846c636a7f3ea13a1fe386a7b809ef5438833489ce457cca302000000005ec78b67900257f2d3bb62fb7fbd0238d273b0cef0cce63c73acfcc5df1d027c8fc79b3501000000035353517ea41ed76dfaf4cd634d17aa6e1d6d6e05f57d62bb233dbb26127f6aaacfc8107c73c91a0300000006536365536563d62026f303d9ca0c010000000005536a006563e0b2d500000000000851ac65515163515382bd7c010000000009ac00510063525251520000000000", "516551535151526300", 1, -93720465, 1953719636, "33e46cf8e91655b505a96ff54a273b1d9997e9aadcc81e75fccaf79650add0da"],
+	["030000807082c40301dcb85113de171b9c8d6e1d77944b59ad286dc0fa82a681165958e8028b17545b0000000001ac495e9df60326449c040000000008635163acac0053517d4cb80200000000085252636a5100006a9bad92020000000006516a516552ac000000000000000000", "650051ac6365006300", 0, 1905459249, 1537743641, "6a2b439b328c9f29ac8e693dc9bd4b272133878054d9894b843238d8992bbbbc"],
+	["151fc15b034f7d9ba84ba9897e70559a9c325b106df9f5b4b5d6d6095c97b8617cf8fc49200100000001ac2741f9eab3d8f47f85c5ad3e64fe894b8cb9e9a665ec37f7cac598b53aa98161b10f9240030000000253acffffffffa674ce7da2b3277570e2b174627493725fee76a6503c19be2eb80dd42773d8cb000000000153860c8d3c02e9b1200000000000056aacac5265bbb62d0500000000030065000000000000", "5363", 1, -2132517937, 1537743641, "2302e7cb917ebd61f1952123f99c27f1600340bb70e0d8b7788bb92a08a8fb00"],
+	["eca6be7a01afb257820cfffe941af5cc451bacbd888f60d29752e21edfda960b9db650fc300100000004ac526563ea748522011064670100000000055251ac6a000000000000", "", 0, -815846958, 4122551051, "b49f5e194eb828940b9030cd9f307273cc413d1847be852ba6bfcdd93382757c"],
+	["09307b5702074612b9c05735f3914010b8bdbabae1c9acc5d4a46073d7e5c5767eacc10b4102000000096300536a515252006534b0ac1abf8cc772b0d30889af98fd38263ef16ec5617d61edd09ee4764b93e2de2eaa5103000000025200a94b9b3102d158d40200000000016a854234040000000007516552635151530000000000", "6352636aacacac63", 0, -1442765089, 1953719636, "69db7e2b166cbcf11b236632f453734c5018b4e9efac713227a50a76ef0aa81e"],
+	["030000807082c40302e971afc747bfba0984ab062264ce9e8b2d04516ec43993ed0b48bb2bef877d400300000006656563525265ffffffff955a0b374daebad7ef307717dab01afb0a5f6dad3a4c1c00a68164e486e6287f0200000004636a526adb4736df01ab607e01000000000751006a5153ac636e8483f0cfc01c1000", "515153655151005300", 0, 1607722834, 4122551051, "b604f610a5918e1471c6260bcb6f61f168890ae3260bf2bc319e6fa195780da0"],
+	["b48fcf6a04d06fe3a0dad800c0a216287d92abc232af39c2a9b4a2e7ed1a75c6cdad8add99030000000451515151e44e1f6c7c1ded612050a7f737e5eac8ecddef0cfac11a5c1609c3cd8b501cebf815705201000000016369bb88b4e6183ab83eae849efe6304f555b7b13eb539a9829eb72ea6f868f1162ba1cd0901000000076aac63525152acaca275201dbe82ef6c1aef77ccbf907ce5f3529f40f83838ed9892c8ce1f280f1dad6d870200000000ffffffff0301012c030000000004ac006363924a750500000000036aac529858e90300000000066a636a6a0051894a4d3400", "", 2, 1474609781, 1953719636, "9bbb3cc659b1d883d59b68954971d88dfce5e740862a22ad5e8d8c69c1fa27f2"],
+	["030000807082c4030490ceb7b0515137abf377751bfe399ad0657255a166cdada936f1b45264b8b6e4020000000463000065ffffffff4dd723e81a206a3fc218f6ec8b91a571941dd23da61c1e856514f2a88c2cc3290100000002525255af7489cf2dc79824e895999860998acd2858636c440223da343d100eed2fbe8287b1940200000008526a6a0065ac5252ac46b081194890e7c20e0a698fdb2d8b3254f01d9013dc3393097990653047de0962cf110000000003ac636334c8340001c7ac390100000000076a656a636aac5200000000498aaf1d00", "6300ac", 1, -199110080, 1991772603, "91d6fcccea1909393da19e028498572977c0744e2b1499d76860840b7d8a9ca5"],
+	["0400008085202f8902f55ff09eee93cf73833d52bffc5d8900c74d6a7e86b141c98be7cb61797888e1020000000753636352ac6a537f10eea1c1c437c4e550c482565a31f82e54c52163820319e33f56c929841ce0e6896a670000000002ac51db61bd7d0463e052040000000009516552526a53535265fecd9c0200000000086a656a5253516a53fb1a360400000000096363ac52516563ac5136a41403000000000300515263a2d73400000000a52a49020000000001f34f7c7a7e5bae9579341c28fc1461b7b817f3a19fd9f535aef1861ec19530d80e5b00f3edb917f25fb460ab8788761cacd99c7523c80c97153329bf5cb0a2496b2536fd081551590a117b23630d05dd6949bf556fd4be818a2b26d0d6f28004cfd11eea1be640e7af9daa9f00bf2bc01a33e7eb947307eb61ce1f255a15ea25b0b12c6eff949609b18cd74654588f6e8cb376157903e86734d7c489db426e6366df4fed9b1c2622565ccfc1be8fef79b29d2b5d2117cc6d99d0148bf89fe1dc66c972386c8ebea6265e33803feecfb02df3a56baa28959c65cb34a2b6aad971cfefffb60907b5626d2d8671ebc80795a097686151f9b604a23ce0a76f7de9a27305b00006890badb2a3cc4e1a1ca4cdaa07e53c6655eaa0f2af6f3e73b7cdf8b18117a801f75c95e247c3ab2abf7736a1b56c88f5b5f2b1fc6a45ec9ed391b2db68390a924710855c787873d8452107000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000015e04975b0cd9f2a7a2bf140ae3583aae4d0fcf832241ad6557227b4ca2539cef314c4e81410e7bef3d63beafadb1427d0dbf3ef98616b1cf8b9a6a2485c1b611b7dff4255af1e853a4e2669be36da661ce83cf1bd4c4bd8c72ea5545b5d81acbc7285d499287220ac1cf071781fcbb05f136dc50881cb0c41990c09db311a69df5407757c271783692145eb57fcd4cf8ea2847d712ca64426e4a2a97a319eac0e8abcdd44d59d05d12dfa3f3536394e9de3f0ed68c4bee4b54ea788a9837238dc19897097b1f715299ddfe7599a881e20fcaf77eb625e98d2fb4798a5ce81a57965c50b241fd2d21d8ec090edb31b72cd833a7e2ec34f6c1055c8b434b81f21fadf95a7fb13ac15bd4af4e74b6fecaf04323ada5e47c74ef2394e6ee1400b452783edb3ab80c32412407cd4a44600d9f6485974414051e4da29ba01f575dbc02c7dcda4936aded29af0bf5369fbfa1463b66fc7b5b22dba58f1526b3d1578d04e4c5528193599d91f47e207d3042ff6cd1cf88809a5d94a9a30e9633e3ce105a252b125f988338d8eaf30410aa6b5fd9293c10be66745e1cd1c2680cef0169fb3e1cfa59281bf3ddf8f1fb5014fd83cb7fdca6bf3a7956bb3128cc055f7a90c8a7bd233aff439aaeeb7331c16317da7833fcab10dbe87b52dd48ba09415b420a598e6896172e564fa31216dcf8acbef211f27daed98cb1d4a51d2a1e22545e5217d97891635f205aba6ecc53e2981c58304582893b587000d70193af508e7311130f7c9efbbcbd54c8a05223c381b8df16ad06808b7befa7d79ed715d98d0210acb5c390175121ac75d87989faed0c2f98347a3f029607ce073948466266ed16b0542d2ecc3ba1ab2d33663759db030d4f2169e4fdc68cca820fb71f58fdce806841f66c1c3c4ba81596e254558e2a2084465c3b947fc6cd4bce2b5759997885b95a0069285eee6b78e21941a9140af04c0f0afbff985ed42210868842b6e6031a9de542891a54dd99726b7a3e8ed945f58ccb5435af3f5e9b5c99ac01097cc865972f049c619a366dc9f6b7657c2eb022aa950f1d081b30a00caf609197f43d783764fc4ee5ee57453b0624d37daa8c98de9af4b1822c38396e8380a94ed9129bea940aa3b373d6cf497e2ed655029eb457f87a53517af8fb95e6c08aacb1d9358dc72df7f31e3752dc4734587c685938f885abac52bfba79e547cbc2dc6ac52a619960286888fa2613f65e464a176f930bfc9b7fd46d5e3ae8ce51bf7c8487e0f2878e5b7878cef04140c5712ff3e24a2808af57cad4c6d652e71d76ea95c3932f86e2a8dbb04ad84c8cba9107cb41bece166f0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "5351ac006551635300", 0, 1733699724, 1991772603, "b465b5f40e5c2d41d566e0c0bc83cc63dff8dc5d3bd6a79506c7ec71dcbbf12e"],
+	["030000807082c4030249c71dd5f9e1d5e1c3e06df139c0967587fca61a2e2fa8235a16e48577bddab2010000000353655393d0a26dd56e5b02786401e0a1f9fdc817eb50370e721d334c8c7e0fc12b2cd281a4d52d03000000045165656affffffff0243dec2050000000009526a536a5351005153b3a27d04000000000763655353510065000000000000000000", "65ac656a635252", 1, -1837879500, 0, "273289374563206ce2dba4b918ade3a8a00ccf6c1cc5c6738cae9e731d460a49"],
+	["ea69b92d01970bf0f37574e01078674b958f6a86d4008641fd1b432fd9e7183ec09d86b41601000000036a5253ffffffff037a0dd9020000000007516a63006a6aacc776cc03000000000400650065141f0702000000000865656a53ac6a6aacc163caf400", "6aac5365636a6365ac", 0, 256475499, 0, "18b1d02caa15546108a5201c752eccb42882190ba863607a64f54725d759f225"],
+	["aea77e5d02dce4f440660cf55ee4c5a8bcd24c8685557f0c3fe2f323a7324f292367b75bae02000000085252000051ac536affffffff3ec77c307acab01b3ee83943725b2096c36d1d3706f2ceb85b53f69ecb99c981000000000251658bb6baa301dc146e0300000000096a000053526353515196bdc9f100", "5165", 0, 693655536, 1953719636, "117c2897b03268ef1c35ec2bc9155d5cb9292ab9ec55345e58e3fbdf154f96ab"],
+	["789a244201e6b80fdfbdce6f722aaa7429eae21e387b7249b392137b822f9ca3147ae7260002000000096a00ac6aac53516365d7f03fa9039796330200000000076352656353ac00b48412040000000009ac51656a636a6553530316d001000000000553000063ac0000000000", "5152656a", 0, -2089137720, 4179206552, "12423c9c118479f5db02a16cbe8e72768ad0f0bcb2844d43c11828ab35daba04"],
+	["1d12cc1801d6baf119b081965f3c1fbaba0d0a2cc68034ca84041ca02b988b0f32c32d01720300000007530051536aacacfba8a5d104a9052e030000000007526a655153526a2f9a0905000000000853636565ac65acacd4907c000000000003515152fcffad040000000009526a63ac53005151630000000000", "00526aac536a", 0, 1233819241, 1991772603, "14b9dac27ffd6f5d5c4a9f6250c95eab08f7a4364d1052fcd345b6ae8b1c9b1a"],
+	["fc063165037b6e96c85f1e76338af33cfe722a0c4560ab68688b6afcddc0e02ef33e7bb7f401000000026a634c2d500cb328031cc51393b2b1028a3ea1f4b240d7afdcbe5403542a864af95a40f09caf01000000096565516aac52526a65b91c5a7c2ff433fdfa6b73fe78f6885f52b28efb137470d07ff4973cc2f1ea648999abb603000000010001cc384902ff07e6040000000008ac5300516a526a6a9ff0510300000000096a5153ac52ac5252630000000000", "6a53", 2, -1470829742, 1537743641, "df7f1fc5965edfd04c88f411f58d7a10c2c50344e1915095413e3fab7dad13b4"],
+	["081ad824037cebcb15e11c6869f4b4f984de1053361fd15e0691b8b472d9c3bc1b49227c7a03000000016affffffff1cc6d260e1e941acd1ea2a287f138b56fbce57498a506107a2cfffec237b73800300000002536ad012f2a2b46e8919c3200619f4f95191bf0d1966d15dd60d5a06a6ffa88b0c2150cc1b8f0100000003ac5351083f68fe04d5c0bd04000000000300655232f49a050000000009650063535352536a008a4c37020000000007005300636a5263bc293b0500000000086aac00635165ac510000000000", "ac6a00516a536a6a", 1, -1587209033, 1991772603, "6bbae809f4a5919a4720d43c39d70038ddc4c0307e8946d9d79f52c90f5132f7"],
+	["0400008085202f89020052972150b8f8c64de07dc391a60fd918b9016f6dd47c4a7f277708ce23d61b010000000400acac528d1719576b7eaad30dfc39dcc3942054671b3f518b99fdc0caae1749345de38aca8a27b302000000015251f522ce0440a2ed01000000000551516a650054553e0300000000016503bb7f02000000000152357c4c020000000000000000001fecd81a309973010000000002498f9c5f808f09320d17fac5e2607a193f0649bc784befe956d5d0d9410ddfc13d26cf158acb644e21d57eee02fc44fe502a288170e87ca80bb2e78a56340a2d2133b22dd0f9f18a38296b0551690976f18f9b8891f1b0a41822ec566c9cdf9f2e5d355b130c4bc9f9d1631c4424ce5dc8d62a8073b77d56fbe6e24f0bd80dd545fa297ae4981862ce01c1c4dba78e4fb796932c6fb9c4d8843ca811091b1d8a277023a7697a22b610ffba1485b0dda2175f95f056018a996187c33aaf5db2aa2ff27c362ed2f4a599a74c255087e244d145f779f888dbcb5cf7a475c81531458f09fffad7e604f306c2ac2df0be4076569142b8982611480a4c39fbfe8e79ea12acedd154e0a00b28a8718bd81dab77ec12ad174534abd24e736a979b0bca6d04ab40dd3269374f0c68c987ac655a8cebe57b4d66b40fe667fe6e0c2e5823e8c90e62e0926b59931e5a9fe1972cd30d000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000efade8b8567e81642a9784c89b5dc4c7a9c137ff4d005920190c934067d0404e5d98f07d85015c2e89ae63533599249aa37cc22913a8cf858bee230d7aace471ad3b1a974b4a5b3938312a7c4baf187581981d6658d6597e2a92dcc714b6f1fb3cbf011f7727d026e3e09f1e92b0522468f5335e7eda3f1521e8ebe7e4b4a46d9fbfc7ab3f42f3ca56005df3cf9dfa2178ae4d6d830b043b364f4dc556c9edc681dd578e6df85bc4efc1fa45e0f7ba806550b57351437967a70e0654fa7c468fb575f5cfcf92510dcca137af4fde1ee4780c297d25de45536779104cb6f89ec0cca8b03f5260acb1f9042b6d6eed441af21e8bedefe9d4e809514f2fa6b36765a4af759e4d44bdad527b9f97b8c60d3dcd4f47f88cd2221962a5b516ce10020e1172862838a402be408ce1303a059398d4329d889a7a616b3278e311852dea4fc90e62e0926b59931e5a9fe1972cd30d00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004da52b907982a44f1d34b11086960931988dd4d9446d2ac5637061d83bef09e3f12ec1371d2c541cab5ac8aa56d19c9241e9f6ee05ea5a000355eceeb9443f25e50636c7a86e19560e4b0ea467bfc9e37a169d7495fce25763ebc9261e435fd82934d0c573a28228b5301251deefbead9e8d8f6e7046a75d5f69fb077f47dfeaa16c4668f8db579be5b7a901d9e04ce3f80c159273da038fc1ead3f2c8f02d8bb707db62e6c0729e74ba2cf33e10fcd2aa555bbff6c12f9b44b5d418b95dc392b4e9421a1ff94c51e27ff429e0489ee802bee190c41e9166729d87b05246d8e43d0c8d0b65e37d2d62246d24ac3dd96a96d9564436d1f932973203ca474641aa088350f8ab884f70d2639aee9b974fd7e24a1d91c92204a974fa61afae24c7dbd2caa252a83c62b58df88994b308f52077f35dd2c09738c37b35ce44693df051d1f34b5f6d4ac81cb9eb7f27746c0e7cc28c8f3b3f694b9738451b5c1784597fd723ee668c8ae6e59c6e7fc2c6c582356b02820aa8d17c8c4cd0692605d8406d0dd0ef69ff4e3032cf5a9fdb1922e36ff9aef0140ba094a426bdfa6ed0bd91c011cb694da538d0d2bfbb2ce13bb3ff097f12429e30df30762743d89f92d223fc422a4aefab12e62dbd3ec32573e63f58a6efb99ffc634fe14b8f2c125e965f8a419b1a588583b528a2d4d7574c270deccd23684a25cce0ddf74b2441d082928c28a83867e84dcec78e18c4b970f330b260901ff51212ece4ace83ef8c1e9096d74b1607578b8e5d4007deeaeefbca478ccb5985c6b7206c3c7d961486615874f90799a631baf8e80b039079a71980b34bb7968f5d46bcd0d41d03aef97fd6c407cbab8286c251aaac6bbbd7f9ee3adb04710d1e623b3c2264afcb98dc1d99d5d0be9bdf347f4d300c4d979ef1c7f60c662ef88e00c594a358e10f89d49feb5aedcd83ed5f9afc9422f05514dcb8a20b4c2a8ac563e56a66d292214cf3fe4134b1a2712893eab8a1b134f1cd9d1b224ca31efbbb050a33010806f83d78e467598e50107d11b31febb82424a193e79ce02fed8153381b87d23f660ff7de998eb3283a271961d729974b94ad7ed84be275d1d6f9ee09db64a3b302e6c7dfb05ac32df1182ff7d7a7558cb5e0c9d0976c10701df0838320ff418df26a298ba41c3d717aa90c512fd34f15d28a491e6d273fd34df6628ba3d3be6afaf0fa8d0202051c8ebb836e0b0e5197161f138eb1559759e201b2a4d201188ff894a7326229cb016347aee5802689022cd087f2e2256553a23e8438a43ee7d4a2cf82d9d625b8b28252ba4c2a8e4be2ca2f18c8114333ace3f71edda1f459d683150213867e4da3a9f9b1cb5197379e3d32be664a46515682bf7193ac0d42c3a4acc5792b560448ebbab172147fb931693598206e208af064d17756b2b0a9da2def6874a6a7e0ba816e4eb4c34cb8651dd2d3b525f0fdd82d41b3e3cebf536a345e39cc27d9faf813fcea3a59e67fa2477e3827add40b5755003df0594da6d5fbfeabce9790de72a8b399eaced347bf2cad8dd709ce1b121a4f6e58ad51da0f96f7047320b1baefa58163263b2b2e183dd0aafa347f68ab611c5bfa25cacb05de1f46f5167709af16a78f78404f5bd09033ba811dbb45fdfb3b0ef2eccf8a40e1b38a3a6a06756ae3a6c1ec4c564b27d40b81cec1b9ce6793cc8805e5378dfe0291af6016045b2ac2a0daa5bfacb7aae48c73f681a0aa8e86ca06316af8dd748311909ec6b1e1f5f8d528c1420cec9c0fd6124889f87e6f70e3bf28a22e83f3873f706810dba658fc63c1b2f93a5ec88823ab5c2ed7a654f71b328e1de6f64aed7b09f6ddc1340efea0d23f2c37a6074734b1f78f7afa17b2565ad6e8398440f7da9920e2fd6b9f6bebcbbeeccf2b8eb1940075869d0eb587a12b95269af0546bc3dd47fd996e87caa6cded5a9a484049b2ffded9928fa3728b4458d93668373758756ebd45af79c7b73d2f69a83e130e7c49dbd928875e56318e56a2758cfc2624f1203b4696208a4e86ba41c2e9cb3326ac6da67519c2c19f62bdd1840dbfc14692c1762b7fa68a081b0ad65ea289e54ebc1a03777cd3bd54a1ce18c799bd66b0add924161cdeb5b66efb3dede4462df283110f65dcdbec22c9e455af928de753a964058c6907c16e75caa188d5dcae7455ea79aebce74423366dc794a93f26d5ebef736f00513f302fda7732757d3e6529a133f3f49e6a7a28e336ce337bb7c2ff5a7f80800a786090366eec76e4fadddddca52ecd3512c31c2dcaf45d1456ffbc32562f1126d507f23e29ea837285b3ab15d0b953576f753fac3431bc7138af7ae8650b36ccbf5361a57e0f55976c73493a91480e851a4c0445d0197d052e764f06921a04fbe3aed989372a1b029c2a2f270d42e02026b30c98b02f0e9dba1ccd5241bac0997ab314cfb9ede180879275c723833de4fc877fc13c2e02e88cea4a26112e2bf3b00883a452e7487698583c57fb08ec7fe4f4c681e610aeae35c5645f57dd11130547d8cc8265793df366f47f1c9d8c13c645d22fae55a312c57ff3078837a3ef8f3bddfa7d6fb3cf08fc5b0a6d3e7d3f3c8e27d76e5ef476c579768e7f7928507ca7da9bac1e6d6af34d3faa32515cac115c644b23d07eb0c19c8fd2f774a6870e046db10ae300b438eec8687b646761ed958e86c8714425489b11b61cc5c9c931b731d8b085b966e75181f7c530ce9f9795c0e89ef61865d30be79f053706f718bc77be36dd16304f51d3f6f86dbd886500cccfb49b8cececd7759fd7d25de94f93884dccc7794509f38dbb5a233f05d9d99c4e8e8a113cca71416dc1966486296c651c0d6f1e1c9b122480511ed713f5dbf3d9870151d7e73d9421d324a48460ba20b3b3b842d0f92c1fca490dd641c1d5bdb684f7297b4b2bfccf204a99b85fe6d3a5aa249bd82f658c0be79891ab1664d0598786f49fbb8db3b727a1ecb9937502e110980f5f10c59f1796c84b5aa2e4a43d404670a2778b18efd476d89c31f98e7051c7ca9b7ceb9c4018a374e63117dcf0d82413fc50cb041a363a5a0d96cb3a2b618ad3d91e0da5c5ddfc8c5cf6deaa62d081b69c00081313a09aa9701c946aced4a882b465e07e17cbd7e07d2c4c047fdd0304fa2b1ee54c1be475884367eefad9265cb368afb3e38e6dc785ab50da8ae2244a6a61decd0f70286330563812fb011886a9705306bf243dac437f02defdfa78a9db16c4f0fa59c8943b004dbd9cb65e7b1806641945a6253a3a689ee2e59718bf96b14b2480d4895dfdddb238f0291559401c7995f46e8ef836db95d704e38c49518aa3d4af8b70a9a6fc93e00b6f6fd5cfe2c8d35b1499b5c8b14c632c516ab15611dc5af3ca1649a64d80991b0fa533a98862af327194482ea6fa0f29a6dd4df1b7103971f4522fc5ece3a903a2ffb1b6f65c0484904be21d4d30caf7811d4bbfaaa70daf223c23cafc60b03ef334095fd2de41d7a52d199d172763640a5a0a595a5a40ab8de5fae90503662f13da722f371d37eb39887e40819c66166752192286b66b0d0700252925e51a67e8f25df7301803e6b3942e45ab2604c896d1affbae261a1d16165639e6cfaccfa9705127df68fca733cf52f561963ced227eb345fdad48a60e735ce53fd4063a3cc08363937949abf7e27bd8224f4feca872aaad0ccb427c8fc085e45ac21a444d1208496ee7067ec502fa89d1f621471cbb9a3d4b0d600b0a0a8477a17ff0635ede038d7a74aa3db11d8bca28356273a861841935194ed9b8dce146f57b2a222b0ba43c5e2caf86f4fa0a989e68905f07976b30016dd6c51425fd2bab74a7765df4e5ea43ed80201da0c7fc2760cc16e6c4f84a03bbc4f27496775a68376310e6891cd6c31acdd9a5f04b9886db5ba9d9a9c382d58e7475c87643446c1bf9b7e662f8c97333081d707464841faf8903b7e8b03cedf7c81dc75baf179905ff59b7b1c0912bc239222915ecc3adee2b45b553de2092be8e253d16ca8ed510255bb695e45975b5c624bf8278120611e53e90c709c05d36299a602a04db89d60c05366229df976600676788fb878671ddc4551128bb72782652ac8dcbc651a107e068b398fffef9f67f210cd1a71ed8926275c04dd8fd76ce1816420259a537b2e70c083dd6af3ec5028ad9b81978dfb9cfa41430b092cbe0d36a9db92e473a77b5a71b82cd7d5f9a5b080ff133b0ea5a2399b155c21ab0c19b922d33f02835a5079fa127c33666e3a095c897736f0cd78f2f66310777d10f53ae6388e6f1030fecd2d663b50e5df7f454df27639e667240a13cb5afe0108b54417b845c05732bf4506f6a344f03b498577389edb5f0ae4673f42eb8badef30d489a9fa2e555a30668478424d7059dcc116ee5b5113d6a4e424c830d0c35a38dd025ec5e53396cdd60f8116eec9a7f2afa1c4ae0f747777e866a83dd3bcbd95a9a85254955ba4add98ac72bb5e8c786d72cfb67c097dccc5b1342a1302bc1168347921ba9cb93bdade4e6459c9fbf6aeef403dd105cc62c758fd525add4da80cf364a784d7205235a66e923a8e9da3328700a0abe72a66d9b54dd2345b19af14d51eda35f70f43bb1067e0356aedefb69c42318cfd8eebb37d49780f2507a51240d427d1153c7b98efd8fbf9b184e19566bf520d229fce906ac3c1c3d8546d293cca8b7e03a6005cc197615b2876ce4702ee142201c723192fcc69e511fc910ab44b7a54f5349c3a4ab218eca174ad6c624be0d8ebbd1963822c3137235c489901352a07461c4e256b738eab3afea9fd640236dfe354298e94826a54a75963fd579f2a0bd03667a24b351985b8421ce239c06df5636ff7dbd6425befedda42589745427f9d5ba91151faf53f2e8b1114546d0e046baf61813a8493872352abb3731a4d6394f081753fe250b79c7ad893c685cdf5371e551e805e16af53d09b097ec43288cf4dd177223245f0fbd01a537cf0d8920a7e28365f4a6ac1fd25222305c58e55bab72bf6f94ab0f4d6558c49eeaf0cc005c11db7a68d8e1fd9bdb9f3841e93ad14e9287a61cae980c26c81fafde2ee2021a577566ee4e212c1810643d046308d7c09cd9d3d4edbfb36331be08c70b6daaef8eef01989be7146d4a2ccfa6d8072e7d07f655b787fc647beb987bd2221490f39d83526922bee1c93df5c3a44c9d2d113ea7d585435b0bdd137d93bb0a56b7aed0aac0930c023f77ea650b3425c9c8697ad95af42f7a8aab5140f6cd22e69eefbbcf3a5079de0b65ec6965005bcaf4f610c3ef0632a18117e035eb4d1974033ab25242703068135a81ca4a11d9944baf6f6d5a64b6a2a96934087385ec27d0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "", 0, -1504527550, 4122551051, "cc9acfb2e53981bfdbea32d4ecee7c3ce611fdc3ae132463c1a5ee9f4a4b5385"],
+	["0400008085202f8901e2a6e09b34058446f374e9711eb444836db0550305d3450bc64ba126010b525a010000000565ac52ac65ffffffff01faed89040000000009535352ac5353655251a81edf9b59e35204895b040100000000049ad358d1cb0ea32333fb27fb986c4d0640999e8aac673f30462c6dfbf256aeafe23fab01fe6fdbea5c0d0adeee378ed31b3f8cfa9ead44aae03fc765f0b2a211dd783121898a1667a144ca315bacaa2856fcc8ba1fbe42263b01ccfe76e777bc7faea1878104221741d3be0bcced98e036245988e347f3d8ee1652150b43511a90fefba25bad871e07697a58eeb4fcc791f2b77e3e13be9daeea7826d5bb280fcf1cd66afa97f7abe1c2ed5a4d864f066d5e2451aaaee26ea65ffd93230eaf925958e20e8af030c174cce1513be8199c02fbedc180b9d2761dc7d2cb5f436c27cb97cc13b9ebf2652503c649e2bd054d36d9519ad11428b4a049d1d2f4436c116e5c75ae6bcb7584568fdaafacebaf2d69f584b7816ee76a858b12bf91c183fe799dd313053f44fff9bfce7372209852665105bcb95af221f1c648bdada0ff61f0b4dc163aab42b7c9e32e1bd3eab104000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000353cc5d9277c51e46c0fb90aa31b0f72ef03e5b4642699fe90cdf901701fb42395ebcc745e9b8d3da3c9a07e0f15c97d804358b4aa88f9d38f1a0a6ff1239636793c671022906d60f8b59037ac34b374c5ea9b858bfdc9f9b6593563b28bd28629a3f215c7202505c334f8bf7b78e77a53714ecd96c889787dd9e22b098d3de819be27bf831beac6f3b3c6455244d942f7922ef516161bd75ac9fc9d18befce05ff8341f0bcb11305a963cee9baba04f200a501fbde86d22e434ab868f9599799a8e536239bf9b71b94d09f18e90dc43cd096b33a32d4614746cc50ee059bbf2be011b3fbf2e04765685dbb9ba28730c2520f5a8b56651fe0580c1412fed156462f4b7434ec7015f9afea500db941f2cc7e9455091263da2fd2f8c02b3ae6c55a2575a0b0f73b662faeb79c4edffbe000e479ca1c6e9db397ce9aa49f96ee129f0b4dc163aab42b7c9e32e1bd3eab104000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d8597844d246d53e58b5c00315a0e764000e91c56fba18e2a1ce99d8896f164b42d418ecb2d88a8c0d0eb9413e05d409f71d9a589b57e9a2d897780233f3410ce4f5c59d881b0954d81d3a7572aa2cb028742c0ec373a82810e4d78e1610aac82ffa8c0f388042c59b7d2429267bac40acc4ccefd8b1adb6895d0e615d812ddad68c753ed2ebc1b2bcf036aa36de899a9d4f28ff5b6f08a0c47b0041394ee85c1d5c8ae69c119a0f7a7624a8a430eca04acf04d418dc0f3733a8bb373c579124429d90f04b73adf6f80744ee735ce619827b2967b513f6a1d7ac52992dfce8f2368bd0936c15de5fc859b0bea3ff4a4e15809b0833f8293456a59875e64c137aad426c92a6bc35013c7633049ca0c427b89a3d09d62e9ea9b071c59e3fa4c13c7a5414fa0ea52d88057928c256973d961c49c518d3fbecabdf24518d9d11f5a3f0b4dc163aab42b7c9e32e1bd3eab104000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000eb95c3cce96d5eca18d74975488fbd1ebb6df2afaea772865386b1acfe4fca63105d06c03b0550a1f6ede272bc55f00979d26da1fe9101e01db73139979f7f07c1d76dce241ee9b5171b023a888b21641aad5efe0bac04be12ca725c706a80eee91416008d464ab879d6cd5aa8f65fafbe00300056501920ca720fd29ef21a6a3c2ab8ad145fa911cdad9b7eb58cab5ae1c115fbd3cdba29d05d5387b1d9b9c2ab24a5e4f5f3c6542b51d5069dcd5afa411821e3bd6de4432d0428eed31672da12d8e8d8f275c4d6284193f7c139f61b8a72cbb9f5574a856b92a6b7f03adef6814e0e5c64550bea12687f7c6f2ada7ac8c351bf2cbcd24f21c53d2cd9fee03ebffe770b3781ee6435dcd6da11061e18f3132e287ab656f216be6a410fef1e011b27f9948b279566ecd4e86491994de494c419d8d4338c84ab7a30f364be2510f0b4dc163aab42b7c9e32e1bd3eab10400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003faf4225d2f919e5dcee166b83abcdf01dc46abb3122ef0c28c80b69c704b0fe4a93f7309c10b8cf46dc81396713283d1fe6b5b6431aee9e0fefa196145d61560b3ad6adfa42d84de941cd8ad1f4ed7775b8e3f65ce8f526c0866be4ccdac8c9d33237af8a1460b3a4c7a320e2423d81cdee2188cb5ecc569f918daf3bc7b560523bf545f74d15379d42098bae6d69447d5faf28435f9b2d9abf022db4f157e79833274db81c8dea02425df0c0c5f91e3b4f5f28499e32a79e13c87279ccb9d83213a441f1d64b4185bb0d8e0f593c44c90ae6c9285f2bfaa8c938c99c812bca57ef0cdd01b051beae1d3b144b9dcfdc79f0b022f866b8a7a512030eb4e82d12fa6b45e7fc4c28a5290cdd5477a0d0f5f6047d9132cdec85935359e0d81469668491cfef64de6aede3eaa0b2aa134ff807cc2c85a34688c90ee5c612e7a4cdd22eff850604eac7db1c972efd4eadacd0d8427115066c9533520496c5bdf8712f8cf1ed8d08e476e8db5e9b8a2daf5901ee51dc0db84785d37067296aad2083a36184d13071eae00aaa0d73dc8d9758a36654239e4e4ea624073dc06949d822e236579de18f889271e7c3ffff8d8ca57570f023f0fc44877a618e39206b99d0dbb221702d0cab97ebd478e29e89c5a5f9ee2e089e2b0858a7636c81f5457965a3c698e70eff673f38515444eb3e54205990451c8b7d7d5895bdcf266599bf0b808c525c41b268b7b442ec5cac4efb30db0df81fdcfe6b5f73f2b9acfe307cace563989644879af19f952b33147d3d304608de59ba8aac19027cf33d89906213551bd1f45b79afa025645e2e7dc689bd7f92f55286aad7e844b48fe8fe427ad61e4ae8dd805c47e73206f8bfbac87aa476a55ff449eaf91853144b78bc39bdfeab78b3ff03b6741047d575d455c056e0ca4eb5b872b95fcbe2a9a3c6f1d01888f479ce279d53b15071dd07c7adcea628f258b84a1482a3b3cc3b37ac4a149f5bcdd7875bed51018777942caa93a9f92a994b8ca97aa2cd5f13aff2d0212cf610781cd18e6ad998bb916e23ea99c62f213fed5522182b9e418caf4dc7ddf034f0f3c4877492be055aa8de03b2d32fb2d1b17da775e2e4e8b73e400f0a19088c1df39e60e2fb9a2e9de38e701bb62555569801b25bdfebd7813368fb28ad9350d1099b50ec331f4e16c925c0ee7599a3ff30413aca92039e34aae0bb9a3cbe8666b2c26b1dad3caf737188f60f3c1cecce553278058bdf754c12e164c11c3935410868bf104e58821ca48ba60d48bc0f149209b8e9faca34c10ca5e00d41cda2ecc24e62deb00516c63c29c60f9c8a527735c4c44af5037894e074dd0b8ced433dd80fa769fc26ccbc9b20dd3f76dc38ac52f40d5b367615f37d9a5dc782876773dddb4594720971ae6b5376e05e242fceb0c763e1418d2f236c69b659f497d72b79ad0dac45bf51102b060315074e7a4001ab424a682dc79ea8e660215d16b54ae480aa0056eb2f9bc6769a170a391a836d8515a0dd5f2b987238625e853b1a923dd886e818ab88a056419b47b8e6ae1f057ee54dac433698776f41a5ebb08bc1dffa38b43da128b1549ee5dfa30e99c39d698fcc146c68902d4106049dc785564da78bf3dd99ecb8cbe8dcec848b730b8411d296a9efcf083217e37dabe76e37209380f5891494db09846608eed2c13abd3435e8d584bd848ffe33eaea9f11f53ec056f1761d58ac592fb88b230340620745a5e3a77c813ab703a7e381c0d1d44721ea94f59b576a090983b10f23ae4f0a693d9509f9541b5b05f4c66c7fcef5e9eb4023a86eeaabfb782c937f0270581b19c96f372f9d2dab85fa1b96d50603136499cda4d801c713db74486339c34f66e387244e0423929b88cadf531f219f6f4da2af8a9fac12e16f3a636713b09da3b3fad03759efc3a29c40d465661ee76635419e17afe314f837b99f0417566f283d2a0f19957adde19fbf0c3c4505593da2672527fa011a9a2c9d01ebbed3c1b241866f674c2597898ba4b7216daabdf0cc5c073a1716e87f2c8e1f56a2ca2d76dcf78c22ddf8aeef4fba695b46906ccd96bdf69cee38b51e52e711898a8fe3f6799eca5fc7f09b26cf0eccf07a7f9d3408e8594c5f9dbabc0bd8025728f3f5217499a58886a9afd116cf8b0788cd47ca2a4300312e2c5fb2f374808936484f6ac06edcd7cf50fc38f0242e09722393a5c9d68fde9de8775c89da40e41435263a0eb79b7c6f85aeb743a4b252b60e1593b823354c37c8a85ca7b15d1453385a19a2b5588ba9a760324189088e497f63e4a5d08a0cc6d98e028f315e7a9d191ba63960399adb59e058e9342320335931cd672c0d6eb0fdf522ca3328f1463ab6a28c2811b9e5fdbb24c3412928fcb038aae5b29f40d362457d38462746d73e28587642db5652b59b37c62a2b525976f2c1087f459634158dafb7f088a4be44e99321d19586f16c7fa9f30a0a513d2f5483275daf30dd548d6b274819e07ef3d8d70a20266783d1f8cb640e798b0b81e34a2b245a51ef241cc7103039bce056fb06dacdcf919cd0726b9d40c115228259db85faac967ac9b4476d9174a7f10593b32b7d0a0b3595eacd814623a2fda96b9ca486c8ee1ef4f591d0b6feacbeb7718348a985312fe059838ca51a96c2fc8f99c135d3ef9ec2fda1e83b2c6f9cfe5f6b19d68fb9e7663f4c7b28228c7c2ff473def8c07338761a499519938fe5c816daf1adc3c1b248c7e066707e3041d98b9142d2e15be438d054f5b61209711c621b87f7310756f3654288b6c6987e3edf2ef42d29331675ac2e96e6cb45078c997d830d2d1d7035f31b364f3e64ac24f18dc3ee83988c5b7e3c06d314b37fb3d6b18f150d7b1cd57f6d1c4fdb6a9ba72ae296940fd1303f09b83347296e8d1005382880b4a82a9a140492742d20dbee8aeac27773fd49094bcd78405bd8beee06c93f10179f52e26eb4a615f18977013c73b098c5f5965c9ad2bdc2b9e074f8ce43d26be8b4ba8050a5e39a8456aefba13c8c19619bcfc8b43bbd5f6ff3fad6c4554f6966ca117a8b52cbc6808463f48b4a922850cf0334c2cd182660b66c5a47d4a226e96f964e386cc4cb8b3351c58cf9b1a29947771bf478ebef050db1e0356660c6f213a5911a5d5346b2d88f512d739cd01447d072f3d6d1ae60afcb02496bf4ab83772e13dda12f0a51ab513decbf894272de489a06220321b14243f55848b785afe01c10e58aa5c5f2baf0fa886caa3e0145c89cc47bf4904fe537cc759ff88bb4209c97259dc75eac990d1fed9402ff4c3d911b8907d7f286642ad5d6dc4afe6e16bf987e6b3106ccc9f82e3682ffa314b976c58f8f61cfa67afed4ebd61642fa635b3dea6ff5ac9834f0f1c7c571b6b420882fc013ac7d2c1c6010326ea86fc55e45081e7da306c611dd47f223cbcc65d3b4c05d8183cd397b29fcf7809f76b064cc3263343ccfc266df7bbeb56c023d44cf6154ef8486fb30c2be4de79a231524a6e0efa2e6507b0c13d25bb382a99a00164ce2561482f4e4cdccb79f9d9cd41a000a9b2a39b3ca9ac80de48566bb37776a1d00df0bd393caa815acfc64c0079b9478fdcf93625ca8995cbc9e752df12c4c6dd255c3f9235b7f96028ee8fd909a17cff965fe83ccf775cbe3811c4c33e65d857ddf35bf04b49cada4cffe5d53040532a33bbe9111c456e24f80e316c31b3458329079a993c72791c3c2dc6702d3c4e92c6fbc3942f75042a2f887e34a6177f81188428c3fd3292261b2c107611fe1f5c04a31a3a1922f400b83fde88ea288cee73bbe88a587892d7e3f5a2bad47ca79e13a614f09a74bd05d6b49cc0d591e6337afaca7e7342a25919fb106a5aa8b611e37b55daf8c4719d9b801b4493bc1e2212d5a3184d30d44b50d88667eabc85b7cbc09897d39a1b2f77b88fce6b59f9f57b8887cf0943caf198b620d2c63f834409efdfec28a85d657ad109911c7c11e2c295434d88b4c17e29dedd89554c89bd89d5806b66ae020000000000000000f8c0c9030000000076929297d321bdf000de956e07a02321ff8acf0078d9f88960f114cb26109601c70e736a5e6fbaf61155f766e6d82847695d4f5e737ef413709a64d20770a0df3bafa0024c8fad2d2bf2a76ff32ffb8cf4a9cebe8a015a1a707f64e2e2b7163c00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000bc1a95a285e721130cf57434775b16c3937ea74ea4435731bd6a654bc661f5d4be7eb5eb6918bb57d6ca645df3e4f5306bc85952ba67fa558b734074f0600596ca2a35a88e2235f556103d2dc7d88b387a74c4b85ec9ae126c87f3610ec2c6bf63431e3ad96bba5ceb52856dae740d3b1379651f187aa15e3cd973436e5027495920f0ef001aceb7a5daa1bc4939a65569e9e6e355061049d2244ec4f60b980e654b481d745aaa073b6c7ef50b4f2a03ee49efc8c9613238c553fcc6bf34b3ffdbece79ab953e0f326accea1f8b6bae74b6480d5af0475bcc528c8ecfd813c21d1c70afba3f844eb956ce99f458a71b476123f593cd3bb2b0bba3b299ae964025d7d5b03fda4ac729ee7daee2dd9c987717d3a43816719383ddfee4afb8b0a1022493ecbe90d02ac7261bf6ee198b42dda0d49df17af368b77fe116fc1482aa492e345cd16ee2c687c8175b3222af83662425214eb5e6caa8944ababfb8ef5fbe982047a72460bebbec950dd8971e37d321d8eaa02c8c6e07583599ff9ca85f0eaddad3c02fecc73211a333d97d22c6bd2786595e63b9ae097867c26f71fe6286b3f8779e19f04514ff35825b11c5258483199704c550f34874fb98b41b57730d394aabbd4a0b23b3fa51728cfcb558609615a75d230a600ee92175125dd589430e885e3b10ffdf6163c9df3376b8061fc5184c8b3441ec6373c4e0cf94b3eaac1e24c373eb19d4f1a5468d6c9c84426926b92215f825ba690980066e0bd419fc02c2b09acbbb3250137ec750cf8381feed8a40e836a2c6d050b36a0a04424f74088bd1491e7828c9d329bff7a73cb499d1606b1335796613567bf2939a279683506c7bdb7202e8abae0d06a411e01037ea97d79b458c5b958dedb01f453862e4b59006d615438fc1e3e8fea2afb4cdfba07d09276b5750c71210234219dda52a48ebd436dca0a7552b066b20906d2160a9d40ac412d6a252d5d3f6b169c8dbd6797c4566b321ab937a5fbd9d46d4dd625b5b542ef5061395d029dc67250e04cb81dee1f8d1d441f8a0080346cb6cc5891fe22f14f54cd0b5c81510290d556bc8fe5d2e91f3740857ae45c6365462724c0b756941e2b7cf0f20a90c3391904523ef6f6591ad1193d29861828e736e9c0b57491caa62fad468fe4d9c0da228744b233cc513efd80251d81c561d93bf582d1d73368f655f23432cf6da99d77dedece219dfc1c8a75907ae004026b2e03220ed22ba87cb817d92c4f8069ae8830ca19e100f84e19ab80f65ab73b3bc806a1bd43cd1eedbce0f14d4591685cdfde414629df63eb804573c8726afd87b1a257fc2f555ec8a50839fe72484e0660b3bee84b379b25d3c36abb01d46172cdea9084a0662b805bb8cf0834165874dfdc1d93748fec8545fdc30b0e3f80554a8080dff6b0130af28dd2ee8fa01861239031455f2880405ccd36557e44be480de4f4ae81dcc7951d410200ac41b29df747ab2417aa7c4732f8e0544ddb95b0a540417ff47f0ac64fce8f8b1dc8d2f52a49b0f697c54cb5a898b228a1876392033ae42b44ed486d1fbb10cc7e1418f20e4bb24b64818cddefcfa7ec3814067687c2cd1865fa154d29b199db1f88828242c5895a85c410ab485db675d73d62f68cedbf9e611f599aef4c2a4947b9db781eecd008308e86d9d8e913e3f6d70ff9cbd3c781c0d47e6ac0a735011890c900f05528cd0ddd8fd1615836ef19c9605339dc0fc58f31bb42f6f52946d4363a70c3e44314e4b6546264ecaa2077fe91e3ee5f1c62b8891f94d0963a18a430f1c17f4cdaa469fc72e1df831f2b003ef5912fbad19899482356efc277dbdcee6602b43f76aa80014c8438c95ab0be819abef389060d4f548bdd54694ef79bb9265460b70a682ceb327c94019558415157ea614ac135c5c3226ea7287d2d44ecd60ad93734024618ec10231e04d837d3a7ac9fda3c4e55fbbb797686705bd8aeb52a8135d9966b7dd508be2d6463a7902de7f4b28dbf7b519baa5dab0b0a0e58305c58d18a10a02e94f64ba76718aab8de6c1e3e2b8c4b44ef55ecdfabd513cf315cf1dfc16bab4a67293ad9db706b2239951b62d1cd93e3138b7462aeebdd8bab26a5fcf1e6fc67f7c74e1c7ddc2a3e7e820f4921ff4af405b701000000000000000000000000bb353976da120ae964b16096ccaee49a22f5b6447b0c36c0e68890282aa5fdce7c9c398b4a429a3411daac5bb9c5f462e1a249f6cc885ed3ec9e7fe4f079a56d705e015688ee6411a4714ed4b3796570e93690286618f66085b919202d7cfa8e000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001aea5809c0f9493a8a366151f4931140688c0cf5857131ab910a51081d225b45a585fe4d9bb37293052cbfa01acb94c67cc885a8c6c21979a5772e1f284450e089d9cc8fed02c98469cb198d6a26cc9e2991f873e93cdfdfda5384f8edd11938ef02d279ea1ac809efd46aeffa59541fc786e6190b8d6034d1166f3652c330f17612a0b91b80ccc1aa3046cebc164024f27fe6a513d988d2da4fb3d15cb38fec2ff63acdfab2c92c4caefa40f14a35fa7e82f7196d124b77c50f30cb512425c367929bab27e1bf64340d5d33b4c202013177797ef9d8bdbd4a6d47be2b5ba44555acb995562608c2f470bf3ef0c23d72204882e6317257576ae6e2013ff700d3498bb929acbc67a957d045c993d45142820e4e29c647602db7f895d2e10af51591160b5c2e1207e53e5e1aecab3fd9dbc9ab1c4dbd7db3d7846091eede45f11160c4910d635df7c7447fc43210a319fd113420587511fbc47454c12f8925db594dc9363d4ca0a08a062b4c4ac7b2f79d1b010edd16c9b4bda99f8107bd3cf0bad1a09aef4c7f1075c358c5968e6427b95de2aa1196d8c564caef45c144b2cae07e0b89262035d1e7db07781a45955515ffe183e3e8d004f1b37436b2d687f030f5b09e999ca2200cb7f6616abedede977ea2c7d7dea84cac61eb97599784a4c5c82ead73a3b13d5f24330d93573917606cdc114430df36ca9da747e412f8edab28601a32de4a1e5915c750eb33b67c2f6a5eb3e6fcd185ffba2a93bd5a776bd7b9252b5353b349212e8e29e84f6216c160bce2bc77f4eed31024c4bee8661e9a4d0c8f921b4cc5a04801d5cd3367d3fe62a997d1ef3ecd556ef6e4fd0235920b21465cc41699cec631131e0b4c12697108774d0a3861cf0e2b14bf97dc611acf5ab90d5b4af2c2af205fc5ad65bcf76c84afc5fa816132b49f3d81676aa1d4e62114e6d92899f3b372c560c31bc41b39df65ec74ab06cba10a628ee1f39c9bc89caefa66394705bb4448ac5acd7189d63f6311e4baa1b93ea134a2e6822fdc50bcd948f934bb5920d5a38409ae811d1c9fee84dd0ff5166bde846f6588a323e3eb22b875710f54a9347205c3729c156838a939c65d0d268c6cfd44d490fadc24586c6d367608b07d88d302ea858bc470e2efe8f2482a2410cc0b7d34837b78f524f634ed1e9322c0bbeb7cb45a583925e2356390c5684ba1c896b90c93ef9044621d2ca4db228e6723840cb80b11572e09d106c906e636c585ffeb5ae8b83861b57f1f641391476269e591d1354ec6c65acdb3dee98afa91652092223b4f75c929bde8846b182eab45e367f0fb0cde581ef8bdc913455fca5ec6c1e76779c659428e9fbaac5c8fd1a05ca2c497436d0b3525db3f306405d02b608f7a4dd20a5f5e6242ffed7016cc36297de69c61d5f6e4e553a98fd86cb60d4be3cbb234f36e0860bd2d8314204ecfd0bfe1f32abe906a3b0cd6c55eeb0bab120fcef63f5c4037b4eb3376a09a3a9e5a94869f0ef606524783ba3bfe085b0686296692e0426e3dfe6bbd224605ffcdf4bd87c3585285ba94d8a9da72fc8346203d7390795c7ce2e1e933371b5553fc92547a8f8b93918c6cdfdf9beb4a0976aa39f558b7e41dc9f95e63c7976e510a2ce3f6698d75d41db931f1fc9d61de734431180e6b7b959b437aedf36dd3c3a21e696bce3fce9701242f7891f80a7263ef231bd117cc9a93a2e04d97be255190254f80ebbe04463cfae05c568effe952a4961fd022d4a628cfd421dbf1e76f2c1d489376ef513046136e7e51e3d1a07a4fc71cdaa36abbde47a68447800b233c1b5070b3d70e3148f0bcce0888db0d2e76888ab28ef5b7e6c1c612cd05335e930fec95cbf10cfc77a3d17eab74d57643e9de95e0e5fb1cf194f08bce3af811ff853a999c6a5bc0bfce706c6ca7e360d990af8fb2d4377e8fbe2ca174c73e64b30a2dedcf318f79938d8d951f8fb27a319db26caa078d7c453bc16cad7135018c6726704dc3fcb487e22f65beaca5fbde4c808f5e73d5007500cc001b140c4a8f95a3ecc662416e6dbc1c94a5067113e40737f37532781cc8ab8189c8592f608684c39adff02ae5ae3749da78a2481084521db323dbffae8bd233be5443689f61978a966820daa12aa778462da5f68282bc938d478919d0b6fb9b57194c36af131d8a2a6e1eb15413a98003c684b12374ddf6ea968551f64eb75db8177b78fec36673064eafcef2164ae5f53d8dabd4ea20343207ac2be066cb5ec12d825392204c781768804228900200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "00516aac5152ac6351", 0, -734533773, 0, "670a878b563037036e44988d2106a27e9579563b6669aa0df9724ea1ee0e277c"],
+	["808c5a70021d606d44fbe05de23b022c896edad1ca33e13927668960edd6c16b40723736b40000000007636a655163006aa8d5a368c9fd6f424a777341c4b3e9c2f3236bfc867ba3a98a47ad6dbcd072d5a6631d2c01000000008d3b943601daee410500000000026553cb6255c300", "51526a6a65", 0, 534261450, 4179206552, "856659825703e20c4d1e416fb55eb665d4c46291e58f321c12d23ad12ec5ffac"],
+	["030000807082c403033c82480a432bd5696b61cc18d42a9dd14e0eace028477ae5094bbba592cf106b00000000025100c4a3b7f774fbfc2d826bd93b88b78b79a88956c3c12ad8d7e0f5f72f66bc026b45ffc40d00000000060063acac006affffffffee4a42b47f3094001ea1a8f2f2f42d16e7d1bb74aff1113a8e9946e9e55fdb2e0000000003535352ffffffff02ffd73605000000000163fcc38c0100000000055252535163fada58598c634a1900", "", 0, 1809781160, 733220448, "5a3b6b576eba9149248ae301c4bdb48b8b732e73970397ffeaf2755651eb674c"],
+	["030000807082c403040e769ba6bc1694cff8ac955f1bf6148b8344788fc99d7e6182a5c03c9be3da0100000000096351636a635251005127a97bcdc94b4cbdd6e8c944d2665416be4f4f3153bbce5b41370601dd79eca4003530aa030000000353ac6a0ecc6ef8db54db570a72934be7863a70eb9978fa8b2f3a5af12aaedabc6590ca98b658360100000001ac2f01449a7492ac9822b14854cf295d8da68a782f58234cb8319d92112382cbb6f48c6feb030000000563515265529ba63845041e77b7050000000001636dd78e00000000000965516aac6a5363006afeca23020000000007ac655163526a6533cb7e030000000001519439e7160f398a1a00", "ac5153525265", 3, -2114828054, 0, "55a6e42018dd80ed64f99cc84e06e41fc03e796aadde4f5298f3911143726a33"],
+	["eebead1e04d2fc2a776343cc28fd43d6216fedea35e34b8c57cbaeafe8edf62b82b2d50e000000000006656351656563ffffffffc6d9f49bc7202419d44d08976ee4493412938014856385be0a8b109349412d660200000004520063633d9895bf580914a60c815b66fd5bbb7899ed138e72a44d77cb1207098243b94c0c757ac902000000066a51536300acffffffffe78280b21d9ae5f5622978575a7e6bbb05e90802d4bd22501c7fa21b1480494a0300000004656a516affffffff02646163020000000000cc3e0700000000000551515151002ba7c24900", "52", 3, 1854531829, 1991772603, "2eabb685a5da5dce4f99257a9a8ddb6e0d85a73cdb65ac61078bf73bc2b62c44"],
+	["b9b1a4290142a8ff1912bb5e1e0611bcee5a915eb2f01d75b9eaa7a54d9f02b03276d03c62010000000252538de61ce704b75c23020000000001002ddbd4030000000009630065ac6a5363525278fa36040000000009630065656a65ac6553609447030000000008515252acac65536a0000000000", "525351636aac6351ac", 0, -1673024565, 4179206552, "f99bc87e8d25784579f46b2f219de15ea0dbed6976e843c4b9825774ad403116"],
+	["bcfcc56904ea47b0149f0f83e79c6aa9ef9a284bd61288e7385fd93be250ecc6fc8d7693ff0000000003635251ffffffffdda8d7451131bdc2704c7e19df93bfe18fc5071a43387eec1f07bed77c76048800000000095353636a6a006a0052ffffffffae39ad7ac8a0c8669ebef0df993d5c997830c196cf74c2062ccac4c9bd084ad1030000000500510053657806374888f2322f0cf0d7116827d5aee199f4dbd11122ebac9099d86472bbcfec3266fd0200000003ac6365ffffffff01ff90ba0400000000056500636a000000000000", "63", 1, 1099593524, 1991772603, "4f5b212b26e85e44947513f943ab0dd12c2694fabf625d57e4c1ddcc4e5914cf"],
+	["71ac132a0459dfba52aa71810423104107ffbf78d34239b7031d6eef60d27609aadbc8cee100000000085153536352655263ffffffff2686fa52dc245d119369dddc2edd1f6ee06cf2f13cdb04911d0608f65794f4e903000000086552636aac655300ffffffff3461951c10590cd0ab627aab9eca315fd58e220e3e8c06b7c64c324fd56baeeb0100000002006a688a78818438bf61dd4553c51c9eb38471aeeaeff75c3cc64e1ba195bb657e635448b8ef010000000032f8dfa504d5160c05000000000265acb096620000000000036352521c6b5900000000000200003d56eb0300000000035352510000000000", "6a53ac516a530053", 0, 9743878, 3925833126, "2da77883a2cb8e8da5705d429a03237d6bc3f9261cfa8b51273c9093d28019c1"],
+	["2ffb6a760160a433ba504da9275a4d810670a02bc682df4609fae04a249f7cc8ff4c0544a80000000000ffffffff03920ca9020000000009655265516353ac5351c9464c050000000002536347ec33000000000000d5ad57bf00", "515353", 0, -1139534501, 1991772603, "befc1d671821768d34818cac20fe21ee4151353f04772ee36882255866df6143"],
+	["75862f0002eb76cad172c3c2d221dd7ac7c4890d351b2da473ac168c69df509ee271a41a830200000009516a5200516a655365a5622676ea480a055bfce8b3b06e9f1f9fec2c7c6022e011e22f9f69da686f7c7cdb33f70000000008636a00ac6a005165ffffffff04010dc40300000000065152005263ac9b2a880400000000016a044fcd05000000000800525253006a0051b66ef401000000000465ac5251a2e7c2da00", "535200516aac", 0, -2042533922, 3925833126, "3be2ccf22560cc86b142047ea818c26e72ff7729e8d42fa9a2a6d0e293435142"],
+	["030000807082c40301d47f95a2d522feecab6c6cd244de49d8192fe7fbccba2bf606af0b5f8590106a0300000004ac635351ffffffff027249fa0100000000045351535327491303000000000151062046efc7f6571500", "516565525253515200", 0, -946583904, 3925833126, "3b18440049a8dda3087a5291be48dd5736d3be6c636ac9aa5b2a93da4039cac7"],
+	["5c816d5d015783f736d1c2ba5b6d1fd09d2676ac705292d2f30ad6a0b228cd288a3479d43402000000026a65f330f08202a3a5de03000000000953ac51ac00516a656ae08729020000000002006aa97c869100", "00", 0, 2008462887, 4179206552, "5cccdad1bcf08f29b343279c2ef4851123385e9cfcb46c32937fb717b8246f18"],
+	["030000807082c40301e1adb67ef4c98a6ea393d2b180c3fbeb48e40ca493b0decb0cbc2f6dedd116ed000000000700515363635352ffffffff031eb94d0500000000065100525353538eead903000000000800635265006a6351a523ac03000000000200631414ff800000000000", "ac53ac5365635365", 0, -758753612, 1537743641, "ed8557596b390476fdb577086a3a4c497501cf71b55a4bbf271fdb0c1082685d"],
+	["7a31630304f5abadb91d3cda2eecc22c11f1ca49cafbec8526de656e12dacbdb0b743679dd0000000000ffffffffc4783c6cd5ee808cb8cbb1fb3438023a59369fa5d6d41d2a006a34c68c72141b02000000070052acacacac653fa36588132a7a1fe7c23f57bf62b74c1f16da294d128a4a100a0961d580aec80f566ff2000000000064c8571650e754e8a5fcfc899235125c16dffa8e69988b538f7ad20aa5ea1fdb5537f94e0300000003536563ffffffff0465736f010000000002636a442fe20200000000066565ac6a0063a38ea502000000000952525251515151536a3554ba00000000000851ac525251656aac0000000000", "6500", 3, 1520320940, 3925833126, "905df5495c5a9d8227442495689d4e59129925b6f2b4b0f4ab944df4e95e8072"],
+	["0400008085202f89036b6bd6000190b45135a0f9bb5c4b8d751f87254943b9e16c06421677016fcfa40300000003006a00ffffffffefd7c6af2bba7faa83f11dbed1c85ab8dd8de27e21a2b77fd94195b036a7772c030000000400635151c0ba6df03dbab699e8273be3e57db28bd5512dad05dd5d2a5e150dd4db0dd816b7d7acfb030000000452515363ffffffff03c3fa3a000000000009535353636363acac656b169003000000000024e7bf030000000002ac63dbb0c36a00000000aba2e0000000000002ccfbe9772d673e80d3e85f1cd3bf983c43d0dfaa1759011bc11141d470984b9ced31e00eb5662d471a83420d01da07fd304d2785cbf8b70e74ff6405dcbd9646d6b8744802c950f496d6bb4be9e72e168d4890337574069dddba5fdff29decd5c85324582f91f7e6292b3ecc37184dee3307e49827b98baa9188e765793b79ae661cb7ede88b664700711b3b0ad997d12b35e576b758d1cd993e48e293f3d1bca62a3900afc63b5e319221de5691091e49eeaae366d7c4b72b96d9dbe2b4e94363ce1ce87db2b0c54e64ace460de52357923c8547e281ac340b0775a23b5fad8e9a689965c3e7c7f6890cdc1e436cf73d59faacd0c1837919a259cec95b2010b30b4e00b97ba7dec9da1a903637aae68fcc225fb04878863b09fd9d09bd0f14c619978de0e5b5ac0397c02ece638753bdd998b2c854a53bdc3a9cbc1d31933ce5ec12d825392204c7817688042289002000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ba7779d5f414107da886199484a8c5c76a5609ead792e8f9271702bf320c1465083b9731cf5c1d7dc985c9ee702de62464d0251b2b7221668b11f12ead9ead516332beda683ec732e97c7332965346889f50ab889bf6582629bf2a57a113a55d9033ddc277a7fd896a83b6337ec64e2168ada98be33a3b0f85918d4eed06a48460652c321a924288c871529b0cfc2048ee82687614feae829f4603b49833fa10d22b7d49f1f3dbf4be05a6f24620bb1c5d4fde46d8b09d90d9504e6e082d8e980afea1cf9ff7075d16899685d45335aed6d89a08fce9271fc9bbb42e7f7e416975384e0878c44b1e496e16480b4ac98f98631d56d57053dc8c2df3171e1043a940f72a13e478a7d9626c2895cdda38a12dc55fe85f4f8a5b3a30fa39e274bf952fec0f16e40a5c064f28841f842a9d3b3d6387d16b3f313f1f76903d2ab36f095ec12d825392204c78176880422890020000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000307c1081a4072f3a79e03dd4ad963d6170bf3a930895f55bc86a1863a5553aea3d200605797a22290be51bd5a4fee63478f2fb17096ecbc437683f9f73bc4c13de7f33c62965067154a7804bcec6583b6dfc757f043ea614667515e597ced326e1914b5cfbaf9f32528c7a32d32f608d986f76294d34121bd02738d57c30471ed5680a1099196516588cd0320b68d817e5b291d515a37c9a686bea58b3c560c9d348bb28ca483954beea52c9abf1b292a4d6776474a3314da609ea41597281d36bc61facfc7b83acfcda1b88d819370f443202baa1210207a140a05fa0002008cda258250067eb98f3f70ac327eed7d9655ab7abb3b8fd7b526e98cf5e04b844caec27b0289f0aeeb862f7753aa399b20485ed1fde3497a4b726a60ea1b9a6d031044df2aecb88ecb37f7190f85ac120c75b93c4dc5d3baa73e4de8db2a001c99bf1e79fe3f707e9ac49a9e1fe4958c2a7d15968b26db3b49b04f8c5920ac642ded58dbafbe2716f9c251ff4bef22b5c6a11e9f3fe935f012d01dc4cf01271280ef958b3c35dde1010b593fa5b70b88c7980418946f70c0032563d2c473dcc946fc5d0ad6ff94e5eafefadb345c2b17b98afe42b616ec2cb1cc466bd531ed290705bf03974dadf87e4824394c65504cc80687142c18173aca95a2b598481bcfdd02db634581c76b8c3368363b972b92dc9d197d222a02f9af659f11b96d73a01e8fe7da657a1b29b917a77b9062b577193336d80bd232e634a7ccf2e64f95512dcc175bee52f09723ec40c143d5166209f58e2492c03bd55c22651f1aa0fc0496f261c9595ceac3fad744f9c106d13f645ec89d920b6bf561812eaf6da12069648b4abe343f465b80896f16e1a97de4fe65507bc586d971dba28662f4b54b24dcd3f2089ce25627375e09b832c6736b9eff8f6bfdb1a37dbe0b86d5b6c323f03041c5e5b9b20884b4156932842880bdd408a1b9930d1d42a32edca6d355592685f7aa305463edab619ed0f606244b763e9adbecaf96df1672d1eda9c9eba7d111eb3543deb735adda48193864bd68b329f84a02235b94c78c10b190d96a02e8116ee69757b96b9843ac0ba1175b04a8cc5b5cc269e8f7e55c75a607cbfd8a10cb1fbfedbf58bc5581d0dfcd9b0548b940c5868913a76d69e88d03789b798f42ed1373ce706847b008f9ff43223189946c9f8ee944c19ed9a4de13bd174e1d9213bac9204abc5cbd423f31cec5b9c5598ace533baed9145ad048d843e96fb55870521f2a95eeed5e721bbb7db063f1188d1af91464e63d76a8a2c0b695bbed5b3a23966286972765f063b00ad3d5a19de38a40e5f8dd35175fa43c16e4341874ae12f956e0e83524512e538b101b22177e581fd8bde9e9b530b2220ca79df09bbbedbe1895aa6658f8983c9523f8701661fa04d26b5172bdf99ee274bebdd0759686d11ed0b07dc0428bf167fb4041c690946e5eee173f0630d20cd1236fcbe6507a649f6b71326f5f8703ec1a4fd49f51060062905a0ad60089dd327f04162631673b04dc1f7000e83777b9dc6bece31214991622bf3e0d0f2652cfab9d80d9d2e7066df521de7a813c94f1fb330cca9344aa2d9c47bd82cdff60414c713f29210571fe71c148a2acc42832cb7a3f348a0189b465c1b14cd4faadf9670f0708c1915757e5d9464f12f85d9a5aae86aade4fa6635c21267224ef9459a86933776d9f12a548abe30cf19f29b250a81787da7cbfe629160ab2593f1fd3f97ddbcf7168ea3d638aa05406f14ca8de39f2076f919a137d1fb3a84a115d663aad671ad5aa445ecc7e83c2295d001926b04799a52682cc7a4b140b9184ef6445da8aae457e33c46ff08cd65a852ae861a1821a21c5f929ad54f8b5170f98c65137bf477adab0a88236728981c327c35cd716ea11b7406ea98aa03575e26b2108d465857224ad2a1fe21fcb41b1912bfc1358087a68dcc955baaa18f19b0aff925dd083860c5679bb5dff6457962152960b34c338eb9e7a616da5723a1a470aa64b9371b7962be4e64decb5ccd9ef2531d1cc0ff8d998560675a50732e44a347cf2b58e3d00b6acef1467965b1a500a4a5d57618607a3da9bdf2b7b8f0850233cc63cf1c23a6eb9555bf2fc9c0e7dfd0e11a82ffb14e8443ddafacfbd38fa45a4f3c22a72064cc8133054d04d8f38a2d8607a12cc7114d27678f9e1623b8120a011ced8d52940893f4cbfa3e3f2a2c26230c80a58d487aa28dcc4ca89b7f101a46c7ad2130fd2bb8ab73dcc07a66ca300d0aad5b9b74d4126bb1a83b329ceae617f491fec74b19bdee86596ce6fb199fd3318bfa2e6d2afdd4e3a724d0ecc87a6e7cdd9cce5cbec267e86f55cdadd43f30b3a5cb5260c535c4cf6596674b699bf447d51c476c1a4907e27afd82bfb39e2be350c0c072b13797667141f16421b3b56415a668819a59f0629ac5cfecf203f3e72649b974f916ac6b6bcae835a94c99d83d07b379ca92d0ec94ae617e84f3c5c201500c2c90e5b9072e2da2ba23c851cbe5b1928ba657b221e92a4a2acde10ef4dc169aa5d98ca58e5a29f32bfba5348298ac2f7a65c1d34aa833ab30938c57a4f34c3cdb77af6e3a7bb2c25f92dbb4598918ea9a8c547940cb7470088c8c1b6b74a092d17059c7afadc439e05cd33d32e39c8fdfaf278876c7eb4ac110bb0e35843d6f9e551efe29fde1e3dc04cfd6ed4ceb8f94f939e281f08ae7a0f721d259364db34d55d251a54a49be573de3cf635268bd5648cf9c9816f5eae5e8fa2e80ec2fb09978e175542e0de86bf47fb435ec42a779a7597bdc860ebbad0ff4cb9f9d8070a3db373d401c5583f605884defc7edac8059b3617c9a97eaca28a5f839bd3da52371ea2432b48bc1d75fc6936d7b9e177e5730e1c94c7a93bfe04b7503a95aa6d98d601cc2c1716a42226469407fc3d22184c51021384f8d24330fe950447be3b3e1f5f221b3c6270e16f2453bb9d0cb33720589369f35467c59a8f4da7b3c28c78e1b44352135c1b7a41bd4654b668b9e4b0adfecc1286a8de57030dd50e5f6915114656e4c944acbc79d4f9b3547c5caea4ec226b4b579e7689a6f97566950940171e03d8bd68eacad3d369c68346f8a1fcc230104c6dcaa0481a21c1582af56e2cba4b9e5b2748058e95b47821734b17bc3a8ec070e1771bbef5c9d41c15fe0c8beb5def5550fce9aa1bf1f58160c8d7ca6449a73fb6bc879d16f7a4d4c83d1f6154e8ca8a6bcc98d8663a2a1ec486c52d3e60f5f230146ae99b1af42b410c8ad50569a353696ec07701cabf876bad3eaf9c25f7e605753229a6b205aac04c6fa0edfe4898b77d5b50129b490852f9a37b896796e8fe93072f22aa85daee7f020974c7e17c88e37fc0e7d8f41f11e57d551f4a7839f074dda06582207b18a5411463418bc0d51d96b5b5e971a97a94d90abf46e3aa0ed6a3b6f0c97f3e24a59de58fd0c747cdbc1c3531fc8e4cfb0534f17b5104fd41647b46b0af6e334daef22ce1fa359a92124834dfc9ca0174c62dd011a60cad739b909c23fc3ad616a1e68d866da9aebca2e48e7d0b0a8c77617fe8a21e3f0cdac54cdc193fc25cbc1f37e9267876aa40640e456c72770a80179fd1930c7462568129e61bca533e9fd6934842757c5d9e6aaf2eb64f9d0a4f0d01ec188d9c2ec662ba1800ecb205fc04296a33574d85dd1ac43988d8251b06fdb89c777bf80693416975dec9f56081f94a9c10568a6b2c9cb67b2d5fc0031b40073ed3b83ba059f09e78650366570429c178943cafedbb7e0595fe35efcc4dd1f845571875cd6156f42c646decb63241f7e455e3f3f5d9bf74a44f966267fdb3b4dc052c7ca92376551cc1910394d5099b5007bab1ae3d4b5255d4bceff97b7f4428416a46aec88ab61d61a4c6ac19e1ae8f9e0f7564660d67b99347f6d93aac23fc9dbb86d7acc4837d858f4748a6037e6fd0aae8223228ae31efca3c2888de25ee9ac5f3f4ce86269473cb296946da7241677650561875303efe0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "ac5165", 1, 882280634, 733220448, "c44ce2a2ead592f81dd1e25cc10cc24de8772ca73f9f4fc52934466895ca19bb"],
+	["877e691103d005b48d5ceecc30bfe661caabf70dc2913a8147279e0717ab9dcaeb9a9e1a0d0100000002526affffffffd6e8f4a7726a149215ef577bbdb56270e9b791faf9d85e7acc038c116084ba1c02000000016affffffffdc801c6a93913c2ac75c79effdf376e7233418d8eb61ec33d5da2a98786b41f9000000000565006a52651a55143a036b5f7a050000000006000052ac6363b340730000000000046aac5265cd9c10020000000003536a5320ac20e100", "53535353636353", 0, 497728427, 1537743641, "ca441a8280f775957802f7bbe2340ad18bc33d864adb50212e4282abf0e424fe"],
+	["48205e0004b1e722b1554d9629fa6a6759742a81abb9c97e694015bd4054de40d02b6fefe70300000009525353005353ac5100d9831a0f26d1212c3835ae5b6eb3eeb991b9caf184888d62c9d2eeb2d28dbc04551549c00000000001acffffffff7de506f31810e87842a0508d075b8ada9c30698f5e55df0f071540de0d43a3960000000003536553072b080d4c840fc3afe5c54c09e07f698d9da8f23f29d1c5d813c41962c3b7043547880f020000000163ffffffff022f035f0400000000002d4fac03000000000018b0eb4f00", "ac535252516a", 2, -1143557926, 1537743641, "6c60476b6d4dc44e1d2e834af15cd6d4dae9ed9359f406fd426016003ef8eb25"],
+	["10738d3a0368b9547a82551cd467ef73ff4ca9bb4c52d5431394e766b32e30b54249397e3f00000000096a535151536a656563c421f73a5f0a2aa57fcd07feeb53f2a79fc5b1b637545dcac705d8dacc462a4589f2a8a00100000009516a5163515353636aaa1132d1f61fe807cd247f9c59e6efa2ad1503409de7e5095467a5554b3be5dfb5e68e350200000003655263ffffffff01e7f7e70000000000075363536a6a00acca69fd7f00", "ac006365006a", 0, 709519156, 4122551051, "1ad44624c85f2e0d97630e66dd70e66058283066dd58aff05da8945a51d17b3a"],
+	["178ba16801ea161baf809e8aafa8dc9a7b573d8434bcc04dac3b613b29e8234c64f175d51e00000000056a5152ac52c807c8c90275ceb0020000000008ac006565655265656b4ad10500000000035251ac0000000000", "635152655252", 0, 101840957, 1537743641, "9f8ccd911d5e56f6769d670181aff76f07f0e5f9634f4a70809ca727ecd01cef"],
+	["92134f580276d216a2cef94bd6f0eb471e5f72f73682214563178cea07f5c90dd2998ccb2e0100000003515200cdbe784ed02b5db2946d002de36d47e329b138bfd1fe63151a820c24a610e886fb71456103000000026500ffffffff02a4f6e80500000000035352ac41d6e2000000000002526a0400190c00", "53", 1, -1513446309, 1537743641, "c3bb42148ecb3b124f604ec08c3ce79134161daf8a95344b9cffb46533818d63"],
+	["0400008085202f8901afc773b73b04897fdd9d0caa5b46252edc763b97a8fecb3dfc3428ac2a5420c703000000002e3a66c501af26af050000000002535200000000564acb0e4a7015030000000001d5dc6aa7e2cb5c51c4bba9f7e44d38a699ec4b72c218fce157e99a2fe7dbecc5462c6e30512b8e4592329d36dc4680da23dd979f3d464c82967b49f0e9d9264d1fb254db9aec3cd0cb8332482ae1e6a33846558b54f3407cf15a75d6cb7b0a517651536766e000351976fccdf062e7c0df32a81e704925fcda82dd548967d45412c114082d8e774b49403420f1993647dd8d025285ad98fe7bbcdc10941d47b8817e0cc8e3e8bd208ef0069161a0583177d56dc8e1a52898b17006431be5cd7fb31821987104ff50dbf085b88d028df89e9fefa9f03a6006eef0c0740ed97647efce1c879d76b41695d6e0cbe286ed8b2b81a1bc6a62689e6f494ba8f1f9ea6ca392d713917cd9ccfb77ad560e89bf8119f6811cd411579a0e586678951b6f6656910c3a4f2395d2ed5d76b052623c339add241afe92b9ee5c10926d609bf42ca55490ddbe50eed69f2ddf0d1ba7bf0600000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004aaf6e077dde2c9d89fcfb1fce338c83116669590ec48e78f094752bb66ea1c1248c1afb75cc1f4e2972dfafb3bf1349d3eccb137e14f75424ac502dacb6cd52051cc14a88b2a7259a3950d131622f92fbf4b680b99c1c7b01aca472055a4f904effa794c911736dafc29764c110be90008bf5f35dab91a823973c02d5dfa1987825827abdedcf2d95e1d07377e47fc7c01763fa6890d4a186521d1b11835c0e946bcfb3f4946f6bfed5925a78cef18a1944b65251f1480e08973ddfd384c3f8062e0c5fb785dd704076b1e93c9a4e35a993716bac4c0a972ee95eb908e23a8825b71ebcd4b179b9cf36491230cd624fda51d78ceb2168bc01185cbde40206e4c7dd77943114e0d5440905cdc0a508a44e2070379013eb9290ec81994dadb08bc7f43f126929bd9ee2d4657b1fe6476098455f109df856413cea0c7139efa780a76ee316693baced692598aa68eead904394466e8d8bb204a17d1b4b543ac090053080a02ab43c4631c5b6715073bdef341094be3a55b5ee2336f255c46bdeba7615c4a10740cda957404c7a016dafa2a36e132e5924a6e64b4943377b56dce7ba1fcb9b228b309284441bf74a5624afaf2f56e5eab7783582d9ef66e93b026069259ec6ab8514c6933cfa2a726b956dac6b6d9d2099eae424edcc42e16bf5bcb86ece320f0f87a8086e93dd886fef5a84946b4db59f43b00674aea00d9affd70ae73354bfb6319d0cfa54c164c05eaaea162f3438d84b860a8ff5094cf185ff660a02deac1c9d9723bdaa8ca6cb0f535bf33a3c0938f95f3c52283bd2ea4585353326d87437e07c0886efd8efadd4d5461f317690def7db5f26ee1da50f70d86e362cd5d20edb35d9caff31a65d17026eae9d45338c68123f6fe986869292473fe460c7250fa1b12ca4c7d2dd362365200c64c15e8b7a677d8018f03dc9d9b87b5c0e499b745751b5eef6f432f6f93a023acfd5ee06562bcefe9363c8287bd9c1c10db4263765009c9dbbb2b8aa815c34ab70f37bd254c1567adff298a4e6efcb786c117581531c884199bfa9654df5c4093614f5119a19f5c677f3fa9b4bf4051559dcdcb0a3d06b3f655d6493fe9e7896b5ecfdacf6dc8a1227c5ddbd7b60d494f164e54432093d8192416ce4ae86b2ee0af01d8de35ebead8a01f913b8bbc09bd9c9b3c66fef72e9d2aa98b1bbe7315a100a4b2ab87d311c894e2c3a0edd6e466ad1448a7048d72425b5daad2a8a74475eef5ed2f2223d777e270f545d48ef33408ac3eab9021155e977b85376e043b55bdaf684e666ae983da838f6d7604197b86c305ad65fe0119004925a5e58ef2fde21852fa4773a41206904d03af1798ef77242c9dfef122b1410148ef53aaefb09f9d68a69787606b41e6ecc73e7df1e724c0cf9315b19bbffd2768ab28282287f0392484f8923c1dc4ba89907d61a198bee4a09b024f806e68a2a022036a217aa11e68f6fac7a6d1e37c933f8bdc772a45f74848b82dc3cd63fb562e2c52611ee16d5908e538626c3139b1176947fdc84831c017eee33caf3569c2fbfb6f3fcaba68b6512c33065cd88bbf0dc2e2736384cc9cc07b1d66f69860de5b54a160693a3e95de845cd5492768d1ac49fcbb5256a9ceb01f2e8c4497be017506e25fec434cf5009426248acaad1b0de5f855b647cf76cd7393f0664283d9321601ff53e93b0cb07ad740bd25e89eff12c49a6a4ecf18e0a9c1543f093d448d25e5181a954d9731561f58de8648cb5118999b597c173d0823d095b5dd96d18ee8e13326c8b8e865a26fdb77c63f78b98cedda9ca103efdec7468cc5c1386c73f09ff48035421298fcaa8eb31d8a957720da036031b132fa5b8136db6d3452569926f65329b3aeb3e5aa1e950effd0a848e2f65c90f527fd4109ca32fbf514469912607bd8acdc755f885e256431d2d7a207d9d055f5f4d88a7898fb9c289a994b9ff8b282accc0ec598251a2c09c7912ee2af3cc792a1fd12b3b03bae9ba0692560da41cee84d873b5ba517a8a92cd62ad3afbb1174300db22269c931a85f5504048ccfb63b8971b007bd1a5cbc13ebc5e4e0d7637e7fcd2ba20bf0aad460b0bcd88f703013f5f5479482aebb4f8a4de6a78aa1bcf5bca83a35a36a029f1659489e330e6424887126d677f14b1ce5e415d90ad73da7c966aaef0aa1761b66bcc022b3992f479b97f2bb62a38addaea238f230fb1c778bb4fe0cdd7920f9ea22cabfafe2a489b9db80b558d92d0407de6e92d5ffa43e762892035d37d5af33fdc38a2db891e615d31e1fd025c4d9295da5c8b9600bc85c7c22bfe93504db979168f2db5e0f63b3f0b8427b367ed1743dab9a311327740e52c91b991ff129e0fdef2fa6548f034bfa04523288e8efbb50017d5e6eb910ad57387176214843bab5c9867223aed39978974ca69ffc780e991d6b6a1312a22bde624a22fc74a4f1a499e68ebfc1ce332c442eb52d6f54eb9ba73b5ef92d9abea2ad209e51604f0a8deaccda59209ffdc905dee97f5ce04be067df047f3bd4c199b339e1b63643f9222db7df32a8801ae6f4280513d0d6cde7864acc77a18688a403933a36be7ee7d7290a49824db725bbbaf79619df1b937aac613e3a00592f2f03719b6674ec70dfa27b304665919252a6c5e057bbc9956c461ffad8ac20ad9564cf5fa7ccb99173d57e262c28f7c1bc31a842637267cc0d4773ea5f53f2bb679cbfe9a8a0a15182e32c2a1b3266a815be7021f75ac8451503c78800a1b7e9aa11702008bdcf678209c43182f8c0a7f2f9f0a7f2431fd548f53e2b2d0b872eb8f65cbaf98f4254edb143143ab76a81e3c7a16d52b01641a75b8bd9dc32642445b970b4b72b0490c91db664e2742b721ebd0dbd9e98ade6ae213004c6bb5410a339e8524248287dac6aa97915a9771721c31ffa762b0698c833e98c47bcdece6fa384292e918c3afee3526b78b0b2d45977084a7186fb474ff8cdd8f4c2f996fb48586edbb8f7b1f2bbc01a477951e1f62c88e51d81b70140e8ad9838d0fac3d0a0736d3112f8ad1e21f9ebf186f1e0f1bbc524f62f7fcc34850d8e1c87992a25aab1d8ffff26dc3135cd38d7a950cf6686026a59b43b1f77f0ef218b29187b2ee9818c8ce33502f126e3bd2b1da61d86dda5c80087b17ed4c32dec41b26df9956a5c9d2a2a5ee09fcd48d44fc20cd9aaee79ba12e511ab0955ed6f53edbfb641117c1043ffecc66eeccbd21ce8d2b6990bf336d72aaa1753d1a9954b1d251570feaef4b3eb613b96df5463dce102b35775e40d4fdae86bf1d09b629bf53eb66a6d573b26c81ab31ffdf5a20fb53040c0761fbb91bec981b5cb47b445f45a7a03422d8cfe22d755e3de96e14d53896ff5b1acbc40c77190cac3288881a0fcff9000378fcc61f9403044e08d68b31b5e6bd1adda6ee2407ea29a685f658f480d03c0e6cd9c71c2a1c1c27876f75c8f0054015b90f76e23a6ce2611dd9a1cecf9cff47d408f1e149c79e2b4af5a3019b8b290dcd851f6cf58ec9741376d839944dbac50ea74c3a02275884b1c7af8359871240e1b188595120287aa911644a4858ed4fecb9e27b26b7f68d1eae73d99d1c2b3a218e6d75f9e26f9451170beb962a5e9048037cf40dd1fb8917e81c6640825a1b9e68a05285d4be01d0c7b095194d4666878145f33fa907b5a5c511781d1dc27bb2122bdff7c071d1c1d0fb0b4923597161b302615c8da0aa859fdfa35517334b52ebbd70b845acd0153191be38cdeafc25cf994229c8e05f8cf7b9ce5f0a2874628e32204750bdd40afc3e934b029d7d176ea9ee979cde1177bb484eba149493e21847f039918c2f615eb3b4829533750db56c645ca39cb0a1d81b6a221ae5d507f751dc1a1001b822d20a8c17ffe86255b9791ba4a101a2870ff423c56ffd74938377605105c89784dce3788484961c3985f8d8113cf0ada2cbb9f86e7539a2272d7c3b83edd877506aa1eec08f20f6ab448cb0d6a5f5cd51e5d6c6aab3ac264ea05209d5c75482cb96310ed176f3a88c73de6867756450d76ade53af724afc89cb8aeabc410ea79f256f2644bee741b6b571383ce4832b8266477f00a6df831ae6b3b1d8392eaeefe563138aaced00277aa48025a1ea9f9b9340bb6519803f0036bf2f172382d598f0f672fc484f4fbfa21392982de42ce94629c44a53c788cc1c5b186b2e9dd5ff4e6f9b7f986bc7f0c72998c6ef68be03a7bf01c257801cbb921873c951a3898f84dc2d8dacb6d1c3e4114065f5e224f637bf060bd274acfc055182c267ff229170959d9f552714f55d595c196c2909e31190d888542e9787f266a666eea7384a0dfaa641ea11ab5cff1f0cdeb475e3ab75b9c20d2b36055cc13df2ec31e368e6a74644fcf8dc9ec661644eb6e37602e93bf2b5adeae636b7561e14529ca8faa7a7f0bca310bb7d8658015258c4a3f6f5b420ff1bd4f4f0813029689870aa5781ec0f10ee6f8a0365e07802421bc742135f195782bec3d292e6046de37c0e012657699a61830991e037c2a0a09abd19db5ec77babccb9286b696cf11d58f575a8773c0ce19d3e9710ba6b6925f07c358104f2800f3904ea3d318799e5e39460a8ae23e3b68b24e7d47334413e900656be793b5b8d46aae21c92f936bf7c5bb1293d49555d4c93ca1d1cc76f3a0a57dea57978386568c505dab3dad557cb8fbce68bf2cb4a17cfba5c353cd6561f563f14635c8d2b397b0d5a6d5f221538d7fff9db01c34b7ad4a0610275b4c2cee428ef0aec3c86654c34e9785684eba48739e696a7cb7222fd31ce7e32cda2fcb24b7afd496682265c0728b44bdac2c176afa31725981fea3f07c7af9b483c00e3d3120aec6b68e054049f22ae0dc6d73545d1bdb4d60d1e684d98d408c4804b632663a3bc1db0eb63750add3439820bc2c027357a22ffb4e88a9a7500f8ecfffed4302ed0dd67b5edbc3e90c7b010b5f530f796ceabd3282f27f75d1a8e58af136d0c4cdc2dbbb52f7ebd12bc26c468cbcfdc16dd43eb4932b53ca033c8f71184332da3fc5627ae9518035330341bdfca49ddddf1fd318e053f985455c083778904060ec555cab004d40a1eb5fe8b895b8fbeb347c7948a8a05ed2234c8a050500aca499206b8950b3e71201c106ef6ac900361d13819028dc1bc675c0f7c6b3d6d41ad299d43012d59fc643f24f2765f437d25fec26f2061eb91eab5bd44fbf9f74c2482d8f4f4e65f15009f0b46d979e9a5cb60dd0f9d213de8939c0c8ad3d6f894af5ae8f04680723edd6d4ab7885832b654973533c64db05c1875ddb50c7f0cb1fe27f4124cc98ba84d07b691809a5d6031abaec8b607f8fd9644401093d3cd80300000000000000008275e6000000000021cc881d043c1b2852ce5e668a6174187afcbc4a4b07ca06dcc8eb402698dd1192db47d5cea20860b16694432e2b26575ea4a7071713e8deb8595c6f1c5778980f0e3c1be092987245501cdf2f02fc28304d44a17882bf43522290275d76f30600000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000512ca2838f36edf2f6a0985166e54eb5e8d9fc626d3c63cc1ee75ffe32780073bc92e3baf6a1e2917f65e41c09ca9670f56e9056546f790f0a7a545b8e5f831a7d262bfc3f95e2eed17bd28942457fcc6cfd4c727e8e949b0abfdd4fb94b061b59dd467bb5462ed548f242757777e6775e50ef1b62680067fe4b974de0c4b77f43f879e080b18005115c48b928dd96912c8b970734ea8f88cf03a983261e04bd3b140b908a2331fd22702269ff9194676aa27ca6cefc0d114d49377223a23b7f07f9655a64d9bd62d778391409fc91b42373284eb43e5f3e8f9c52f2c22f7dd9b8e80af7e0b431720f24ec87783e89dd0456278e8316153f6274b784ce362faf9f1279274eeef076991435e0691f4a22f00ed718c09d55d6498aacd9dbec221bc4faf56b18cc11d301f9db3e7c54e16c8efe1eadef38f642e04b54f26c39af4a1a4735725b6f81b8824bfd4e58fb76ddbe47c875acb988a5f9a698ec9e6394b0e33c5e3bbe6f5198166e44e690ff28bbba14cc8866b09063c30a4c8767776bbacbfd8331a9fc4afdfaff4ce7f1b044091b51658ed207f9dc63e9916e567ca1ae09e78ea457f383144d5710d70401351576b591b028b946d49ca22a907b428aae3e15a231d9a59bb9003d528067f31ea6188c172cc47dfbab43ca8d6e2600ea2de0c2af6e1a6352b3632a6225e2b73e166b2885f849f8bbf93449a2ad8a51281e7acf6b36ad394e72e288d6847a4d091c85e6bf6727c54100e4c5ac5de72af463d7fa5c7750e8b4e9f7f563d2b5507ccff6efe94d650099d3e04fb1aeb5d8ff371ae072905e40d1c115d7c6ad72737766e6bf1e9a643b4b6b04a5b276eccec237a5a272ab86beb16014521fe084e6df2f415c928e225a0f2869cf752da0ef88ee060521569d69b9312c8046af5f6e0a8fdd4535d2903f544b074b21ad14122e5fbd6ed9c0698e21e552fe76f3ff8fec1af41efe4b339368df76cee463fe2561a03b80d64568916d725fd8eb27ea3446d5b799604a50e5c995c6570f429777facc2c8b0d7219473c759b229fed4f1f2f750b807a9e8d2fdcd7d325a2f05b34b2f94a8abbeda5878004bff0945a30665653fa2d41152d82af2b085a52b72ee74ce8b5b4fc6597d6fdd987ab32cfa049ba5d72e09b54d48b25fe63447167d1b2533c1d258e05f986c8b4900472f41cf28f6a37f617093fd8d9d51ed1495bbe0308f06b25145a9603b6f1efd4acef7285658e6be8251c51be383ff44184b91e8cce85567f269d9dbbb34a76f441a4a5e8cf9d1d82a14b527f416a6d94dacba443533415463dc81093aee2f716edebacd66fb57ad7df67771dae5661ac9759cb4f329aacfaf7b23a720dfd6d30b894f7a5fd544c6af7d4de12f71ed2a7ac287ddf7341437dee58e359978e1c09f6a00238a9fcf7397e460c39b50e1ecc25710f08b924c8cae91de4f88c4c77e89913f9be4263ee85f4d53e0d481d62969efd77f195c5d63dad6fc89e54b94b876edbb2ab05476765285ca83485dc6a725e8e4b6cf79d77dad80539d7d9cac2d0e66f682d50b6d6a7b7814e3aebce2b4e5b5396fbe062e8502063dca6c16b212399d7a59f7e6581e2810525f132002dc5ae0f46d9e454f5d0eb2d569aacd9fea70d80ca85b25aa52a375d384f611b2c81fe7f100f20be5e6da2839415dff9a2a1e8f860d2d20de78632d4aaf38568948d9c34823f42fc59cd51c0436889d90ba896c36220fbc5854d9504a35852e9438089b9b9e983ba622c3d2d7bfbe551f7dfd25c0d658b1fcd402aa221a9d9f3bffb54933a28c7dfe5f0bd4ba73ebbbd12bc29c73422dbd46187c236c927b19aa36e2dc4cd06aabad2b64e51e232643717b1783bf45f05c8b6d0828a61baecdbecc6d4b4569bae5870ca090a7af5d672b7b9557a73b277926c6a5413987e071b5c9e4788688dbffaf96457579b37297e1d0fd7382ea8385349b34a40103257816e90c28f23b1f2d18f1fa47192eac51790b51e5fc0738b28760b1a3f7e3c1383332c628c6eca094f80851ef605075b41aca91256b76d57b638cbf3a200b8d04efc0bbc7f9bac5480c28816f0f5b15514297647c9be7375ff393d10c4a5b570820c8cc8115d51ab21d844cc1e968d4b300fa10e6dba18f69d3a1a4b02710200000000000000000000000040eb1e9a1bf0e9bdf316dd41ecab3888f136f9d2d35d6c4ff17d9cc14bc8d6e50f48a99d139139f7c6d9abdc9078aaa474365cd6f293bd853332414e22185c0084a2a5965bd01055d554657df77eaee7210f1b736947b1225579d0bfc17a919300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000de88e64d9390b158ae252cd9bebda08158b21904d7b8f55bcb17d8211641ea1384da47b7892106694d2b72b80df88bbd03ba18cfcb563bfc8c5938e060263c125469de7e38e5a590da9466863b0a3e00ebea54d101c40145795a25adb0f62950464297a708fb69855d58f4b909b32664a18403a5759266ba22f9f7079ec77f6da98ebac7979a61f03320fab39c1e534b084c1cf0165153d5c982e8fdff2e197ff93b4b012ba1a2548da5a1646157cfebcd82cc701e8bae238ba4bf005703eef440de115ebf8d7c83d721925df03029ba4e2ca981d66f0992f72f54a8205c70bce4361aaa42596954b5fe94f8c8b31083728f015a0632d6ab53d32a0c662e0485ea2073d402f12efabf6e4464e2894081014adbffd4284161db88cd640ea104f2edb81aedf2f56827d7b4030fb3de242a540504f7d5c3f0f27905d6685ddd396c030c6b8faa325d4d53532aa712c7f3abfac16fd7fabe0e4fee9d834e7ab83e85431a095be9fdd8aad2e69ef4bb8c96a09552a2931ea3a317a57cba196990c33ed4e5018e7f039be4eaa4ae59abe46d6e3e0f541d32be47d3babe031907cd7e42d591a14f4735b5d50dd0661aa43985b3745795f4f72904590c6cd41bf284a7d19b20baaebb4e3dc37295abb7035d354aaa21cad61de5be3ad9328cf7dfd7c637d57a03d36f49a2ce51ee3d37bc835ebfc07cd97d39669ddc57ab7cb92d98ca84b3cb11c9ddc8bd17e38035fd1e3b950ac5407fefc81c0165b9af2854d8d6021316b79df45314039daea4a7d7fdd92eca13e8e44353c0f90c7b84dba1db5176796d18fe8c5f8a6dd925906a87c29c77c9896cd83a8c27a1a12693dea39c4891e82dae75c73189a4c385576dd075eb7bbde4b2872940a2540ef0da23b28397a8a51880ba333bea331db3d8264fe330f9d66d6c62050ca6294354251f897844d4cfc8debf903dfcbf478842fafcaf8a4dc83969015922751723d4ebf3e34a955e0aa402f40642d2c5a7578b13ab439bb9cdd73f6d19e67ff82d796e06f6dd54289b42ebe53d7522bd9526be39b4f2914953536e91bfa69c68bb9fbd27e4edd281dba50721545311b13e2da36dc0adebd1b5ea89299d5bc9176732b17772512dd28028d36f13517abbc35fa8a43348a3ee2ff567e1cd49360511f8d3f952783f4c3e14759b8f36f9abfb3d2f16ed09838ee5ce02fbbe2215b52a8767da034620c61c020d880d1ab035fe6e5ef702c5e606de20ba9f374129661d8c5a3d722b6b3406eec341ce0be9f481fb460fa40083de024032ade8c0dac3fc4ac3ddc217f71c3617a6c29fa6d2bbff4dc986fa3f36d52412a0864fe01a2f89abca040e277cebab41dad1d052b25ea03bf1432e3239634cac6119a4f0c1b814d80c209af1683d5b5c08870263570e080b029a9c49ccacd41ecca9729bbaf98bb446d638ed9b307b1155c7df4a115802a5fade6762e9d6d62906743de62290808ae0fdf7a07c432b07c7f47ac5f5cf7b4ffeeefb3241709e13e3c26492ae36a8297ba9147c59be055eeeba80a2ae211f7e748a763158c7c920660a1fd8e27c72f0d980b6db2dba5d414b46bf69e61c77680e2b825df066850a26df5d2f4ace5fdbdf28869180570ec39ba1be381e0d72e79c9e902b472fe8452972f962a7fb2130940b9841fb833cd4a160857c5da11f48269d20ca63af54e3fd4abef33955c9d8d5ded81614223146574e82588daded0f441ad84f3ba853270fc106df00849f1624f96390a5e529e72ffe7a9f672fafbc94b9ac02f67d85cdfd652ca5d50c8719f7e6af1755390dc2f6e7588010c10b806482ccda79fe57bfd8063b981a609eede078cfabee738c2b40da4f18689ebbd34b5922c521cb66db1f3ec7d0e0e116a46222bd5fcb0827e2fbbdd2b3aa7a41b62c6da33fecf0764de894c5bf9d5e575aff6322c641c5c2bde1cc06a2dc9e04e24766d567146bb8f9f799758294ca57a296f64343816824983bb78f9ed468102bdc66d5c5105cdf415e4c4b8bb0e9be1f97009b4bb05ca0d52c03018aa8d5ae6c21a2d125d5df9697b6933c7864a37dcbd374267634aff7be42bf63efcaf5c207d10e1d4b9f9fbdfde409914e5a1c9e3cee691178b104cd143356dda63c41afecbc6a0c423d3d44d0ec6f1b8603000000000000000000000000749780ef1c08820b20bf6d85ed83e4e7bf2f6d4d5f7dec103cc1d729ca14910d0edca5562c10d761f9d7b0b8bc99083158d2f24e6076b73cf6fcf3ba1cbb8f5544f4e6a1bba0a5dee27c75e3c97142cb7461eb4b128d97ebb6fea1b196ef0a7c00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000fa49e1dcefd710fbf9dd2704d45990a8f98f754e9c3e60cda5740e1a019e2eac17d1bae934c3ceb84797b445d81375e1b444b1865015f1a063c90ba9a4e1de451ddbfea96e741000bc5f3a564f8b5004aee6c17f848ac0a47d7cedaa3a06a4239e24a164e97c7528f0e4ff2d0c0ba254f1bcb85a766b2327dc7c426e30fe4ca387d2891398c1eeb5ecb121c34fce218d2b3249a1c8de7f2946952fa97ad460e049436d23306dfbe2df1db6b79b8be3e490a487552aec318c0df234c4e80678c00bac81a3812b7a39c9e885267f67189b85852bfe1f534fc35de44b647e57a76429209fe2df759480e418e4b996773885f8aa0ff0983940ab48383a1ac6843434e4cdaa9659c2092ec7deb15d495a47c88000338d19a9def3bb1739047f0514284d17f7d3bf494fb4683f7236a271fa06532e19adea090161687edeab1bfc9ccf3bb37cb42fd9578a9a5e9c86673620f18047fef5c2a30d9c1c917886c801f813c1f0fc87801df5aa2b9ce7686b11636bedf07f7b7d9af8762293b2fe5f5d1d86ed30ed12d4cc6a61ca541c3402c17028507cb66ae9a69c8f918028b1a49328551daa6ded328f4ea627dd3b1ce0090d40b4b6a461b011380e12a4a00ff7e25255b0647c1bef378f327f52d986e4dcdb1f1d82eaa365b96bd9af03dc7cb915879461aa4e940362dc5d59fb91a8ac5fd4639eacae9ecaa8df32dc1a7123ad5395da2d3caaee8f89c9907bc381ed8a40d8f1a40a6c0a5b0b70c5d15fc9ca1f14fc9bba8e89a77cc25609dbf8d8f09458b093e13ff609f1f0b1b56eb07c03a0343eca37a20025459fa7a4985b82fb2680c001d8314ddc6237ce01ee41cf688026feab920f52f61d8e2471d9bdd15e80b6e7a1e06c9e12014b5441b8877feb22f0c1e62cc35d382cd919f6ae858846f4adf16f8193418a3fe4d1348adc3115c4f651b1a25fe18aef2abf858473080aa24e0a8af3406e8d25bff3dbaa0c235c4b0772c1c7cc5141eb08c36e339a5075fe690fb1a7becfeab46fd363fea1f55c41e7e8298e73bead6f1d0707c796851f7da1ebb3e14a81d936d28ce0be3119462cea358563fdef078e47ca7a53a72e0431dfb173cfd02713994f6bd8b5c5da23bf634cebfd101dbb5459ff081024e2256f90a2b40effd6fa886b0c1db5cfafa96a4a348b0cbd0a96bfa9dd903cecc3df9ccb8f484551393ef895f7544cac6f6dc68994a3013213cf0e6fd3f3c01914fc2ed80a0eb4ad25182dcc613ce42731d0b07029c41c24d052b1d2b0f968f4ea71708a9cf39176213bc6e0d3268231a55eb359c69cbb2e138125ccc14e3bccc3cf2bbe2fa3181f34960ba15a3ac4fc868ace9a0a78dd4c89b4a784df87c9002408a85e58fd962cd610971d73f646437c2df4c7998ed5ca8fa701ca6a1813fb3950badf7bb3c969331d8a682e0115835294a8af049adb42d5f1b72d032bc99938558a3a3740e4a165c7dc2133b5df0fcbc397daf96e80fc2a2e922485e59bf2051e0ac1729c555e2733e2b1981b969c3d76f92e717824f1faa0b112ec722fe50726e6a94dce92082efcbb8c358d702306ccc0f971d1904458abc690a09c5e162bb8f1b086497ff1d2c7a703dafc5c650315dae9e639eaf3e0f1fe09666d1e9d14c541d5b090af834c9c222804611b3cf172210208974ce0b0647dd0bc78c646f6e5ed3215558285260c2edea9dc51e8311822572d56e996bc0a9ffa5e2d9e5b4d943624e627f910e2ebe5836cc24cddd1011f3d25d722c48f7e17e673fda50dbe4d6aa5ff3b9676160880543a2d3037e9c5cd02e8cf25457990b59b236a3cf2fdcfdf26a52233de8451e817236896c40a0aea0ab648b64a4ea4219cea99812ae4240af668cd2252585bd8ebb831fdefac009ccd4ee1d9867c409218c4a9038fc6d402ab85a5f2938b20e7672532c194dbf3661247fa48c46cb0761e8afc1f168b49870e01a9c323b0739e227615ab29727501e67271c7fa7615f454d401b8efc613958d45b4526b54a0aa4e6980f95d5a47d60a105cdb6a834f1c6042438424689790fe1c7860eb8f17199854a2f4c4512bdc34bdbb0fb14bd3a61d3df7886046ff3b2d543a801f08505f60705d130a1c0b98d7a7e62d34d244d54d8b776458a7d3c7a0806f30d66c6dc823418c4fde9f3c8cea6b65b1b3b6546f711b32337ee102dba34f5f91dae5cfcb029ea675bffc0c826cb5e7ae84dd71e6018de7dffa32008274ae2ca32a14676c341df544bc950d2859b12aec8c896713ed0f9aee8a7d24f8fb498d2e0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "656a5100", 0, 2069181902, 4122551051, "73a494242ea9afcd56678d955704ebf73133bd25feecad3e7c1fa4c9d4ce4bf9"],
+	["0400008085202f890356c7db032ebe64a8f377c1245856c0b57add509f461c055b793dc059767623cc01000000046aac5253ffffffff582b859980dd113465866437c2ddffb83e04c3318a414c9c0891bf0946d39c1203000000096a0051536363655151a57c136041bd55ab39adb183b221c966404a9d62a7dae324bb53c5150140328288b433e80200000003526a00ffffffff01d586560300000000075352526a6a630000000000f092b016a6bd8503000000000284313322fd2dd93e2187d9fd940e622da0ac1aa956c995a1c307bc8fc2e2a75cd50c546d59b4f7d299de81ad20f0e47b22a651da332419c7044ce07a5234dd3c0b17355fa2e6300102648d15bf185f71ab97ecba50aa2be52f2a654b757a741af2b1876afcbef2ad707761224fb3920e71c6253f145636b915edaf94b1b09da0ff1e03025aade0efe284f7252b3dab96d8613821546f580bd19d723d428a0c6d7dc7a89045bf1c696a3059791b9fff1f7edef88db120a81550d9015d701747a667af1b814faf60717b760e8c2b546a3f64c8dc8848702a1f8b592e412e1ea91100de246a537c01eed8d63ab0366a2e190a151c48c4451dfdfb8b63e11fcaae3c3d271c6ef786ea093014441b6607f18a12a3225d398d3844465ce6ec4082b9b7e003ed7e60d875e29cabdbdcf2e8dafed5a976681cd1458b084885970fa758c3896713ed0f9aee8a7d24f8fb498d2e00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000a31abac4625fec69c1684152a9b172c52e11be66344ad423c723e20a0db5a3434fdadcde6b1ba8012f6698097b9c76e856faeb6aef9a2375bd85ec5d6e2da04239f018503a72e9ef152cbe927f27c8fb651f945bd0a7f449db3e4848b91c51cc65070a55b348c3a6a13f6f8512121099c212fd03ad5271dfde2c843dd20d593d0dae8e5ac11d11f1c1ce7eb89c4a1b8696a141d912b7cdc8d4fb9d69ea49071c5a9e6801c65c365eb88cd0d017988dff2b163f89b4809ad2a40628cdb2da3c6636d43351a8c37833a2c4e45283c61bc3cc26fae64a2a3064f2087d1f610ed71b52a9adc7f143afa2279698bd510fcbf1ca327fd0c94a93a563386d4a04e3e5d99266113bb26430d99d71c103eeb5b1cae602c1b846a7a1ec2734e8c0ed5835ac97e32931837a96e293ac3e6bc08fe346fd929b0d01e3c53eb80e79bd5e304ee5896713ed0f9aee8a7d24f8fb498d2e0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003a2093ce1cfbde310487fcf1bb14a469657d21bf3cf90fbd60ced13cafb18b30b56d90006f0a9328da793599081af90230f11b16c31895a93efce60591569fa29abdf0976ce3850a34247da1662bd7e2d823515f9cdec97098ef7119d3bf63ce70616a33127f0aa3f6c3250734c2c1c1892257fc735ae6e357adc0cc7fc0e1d55cf28b621173d49902d3ddbbc10e9e066c242c3d1cae1876bcda1cc00032cb37980226773c84a1d3b4b8f9b20391a2c68dc0cad2c139b4b875f0dc69dfb4f65e89765acaa891dba6755808010e65f64c6057129aefb120ddd7f4918b103859372b5c67486dae269be1780c86f1b2545543a78444717781d7a7738acd4d176cd4e34fc2f713a774b2a2072d269136eaf2e946435f2fa9b81b967c48ef142761fd7ace1b6fcdb0f6fc855ad5d4651f4e31b187a19896fbe691cce180bb23dc5b74d046431ee5ca131095edc22f4f6245a7352961247cb10905c7ee0549851720c0fed3e655ad1cc5423354ceb93a6c53452a9d1fd31a7201984a0b36e9e650a3cedd8aeb07f143b54a2a9831ff9d86db92484638d962bdc835bfa25ac4d63605a05e8790044bfc586bca11f7e835685cf248fe63a8767645efe0b44aedd561faa897681965770b62f577f13476c5a519c2aabe3897eaf5c07c10f450be91b5d7824e33762d0941e67ee9cc877d76f13a991ce456563fbdf811c01e6f4e4e1bebc2404a7d3e2d645c73ad4d3b4eaa86985ed0d5c1ca17cc1b7eb45c2ab204640f74a3e506a9fb61ece233fd72f4c402f1859951b79338c4bf0ce1932608007b54c18f8a490a7a52fa56813e852a824b37f37ec7996d714a542fa6e1e89791a7f36faaa7c44e507e2c7b583f452476e019920b5637ded34180bed45c9859fc0ced1fc8bb699bda5c9e46ccd4328d71c833238ecc35b9e964baa8abbd713440705157f2e02921564d266cce492867b3cd2deb853d6dd438d355d8e0bf3d0217d79b287d9c1ecce8a273b0fa103796f414f59faeb58b8d45cd51e26e4350e26a78f124bc5e1c2fba51a9bbad332e8754c390e77a36deb793bf5d1e322f98a7b2cb77b1e05faa928d9b39a259f09abd074684d861a97f94552135765624743e8d0c360ecc2cc5128980ac120317a81a68dcecc31eca9d8884c28e6ff4d5819c28eb672d723ee129952fdfcd2679fb1cb2ba7d7e563e79783f201c5ab5bf09be82d0f688ff1c1188a910bf1d7adff96bc5f0f385d6daebe3077d99e3df8b2e06f46ad8364d115e8ff0430f4ac79237e1114c17eaf9d8e3bf24df446204aaf7ac2ef1063046a9d010f6e426041071057057dbd07e33eefbb6c09c21865b0286267742f9d2a1c8b1b97492998ea34cfc408f30d3ea6a1d1ee8c2fe6e13fa781c2cecc063db72ffae64ca95dacb8d67e572b12f18cfd65ed4562c096401b9ad02e240d39852110f56f6defebf4e04b800bd8e019439958effd380453b0eb8663ef17c4100f3ea871d8659e0ab976b16d6c77c5331e06a5e49df2c073072565a40ef80a460cf095da8d6b0bfa37c06a6aff53f02317ae95b1ec16d69847d14254b8e0095721914c81c9f955aae903d0b3b65d2dacd6aaf3a6f691b40bf427358b02c1537a276ca7b8a76d52079e678a729d205ae0b31303f623bd2504db9c6f5c2dc132dcef0c50052cd7e2c5e4f666ad87e270e5f1e1cd3d52dfe21de6e35091d1d43f431e0296afb5a14822d6de4fc1e8aeb8e75e5a1975ee9070d403376a972c21c4202172217233f5257b0ce51659ec82be24cf99bed089e41507b96ebc7bcb851be9c549815efc858735ea3aea247d5b3c01e4779f471a9c6776700675a877f742ea7686a62b577dfc6b60c2d6c7f9ca7c2e9df9b9239fe618ee4a33e02265ad3987e88bebf8fbb7003384d39b399f01658f7a20b2c495c677657796a287fb80469c9880d730419b99875bf6e5b30dc4b30dfcb0bf9bee9be2f703b265bad5f2db31a36cb3f5839de8dc47c7fe54696a77a6428b2533e8938b20898999db5b445c0b20319f83f813916093222c464892000c919d1d2332fc10a7d6242f4048258113e3de202daf2fc0566b9a21ee2d254cc20b7521283abea3c404cfdc0d8b88793e5c2dfaeb295e127659db798d9aa174952996a30d60839de551ebc12daa2889b290eb5c3377f0a1807d72aeda01c897c42fe64b534de2fe0642e167355d40fd58794a895d5ed603dc2a12c2ff261d404b73021bba27dc37852a72f9cbc83d317b73c4ade70acc0e8fec469f08b609f6b515722c7c073b8735b0c244be1d50f2cdf99eb7e54e77e33d5b7c3e6b95dcd01d9149feca7f01f5a93ef36ec7763601b82a56c43457597ca9a6ca53a75231a0d7ba1e66b282d0c2ceefbdc5b7c0ec0473f71c361aae7f882cafa51afdf898e4a122db58af0dde0f06443197d51a5a3302f804be1cbaa5914b10cc9b2e2b0a7d97b4db43d5dda94693be70a559b66bb6c64d5ae6bebf72e56e99fcdace73c1e1b112947d0526a17c3af17cca3c175e2afd7510d42599d7784938ea1b43cfc03447aefbaa7c7dd18e44e83bfa5c04077330b55f49fa46dca94f814a2dd0bb024db06ac70f22f283ff25974a6de51d19ccfc5fd4a4b49b733835b3849f7238da38d77516c4d62176a5daad50c71f4729043e353acb80f84090296909eed1e17a34aa0d21a87609eb9491779be1468f2fd039c5f723f45f17aa2827ec75a2071e006ab8868be051c0d1c70a95ec9449bb71c16347ef2ed28799ba6a356a7ed1746cc96516aee891d360d0fbbceba228fa6896539bc59d68b30100c03ff134b53c84a408d364763dfbb4f63edcf66419bf835992162852a42abd4ec0adaaf3ec2ab95431a9a04ad7a02b15efd90e6d775235b748412ea0ab1ccaa412c947a6bcecf49cf9b599cf60101af6b665849ec3164fa3e398c8f733eb173650d0bb48baf72429bd0f8860e62082a31c24dffc4ea5126ffc357cb96bb66c177ddf614e4f0f013bed34224a5e45ef56a165cb818ec41948ee736a4b57f2125758af9b93e4214153c434346b02811c7bf1f20e9b19fc7bc1242e94ccdfed374be563b01e5726cd0f5a5c8649db14b025f90acb8ad3356187d1ee9b94a3688e9d657a1d05dddaa977cb74601651766aec040ccdffc1e6e0b6de113f70d1e67bffd124404c1fc48e20eec70875feacdc419349cfc0567138b97477496443ecb2c67701db147fb6ec279442d04c96bc054bee553f5340e21b21d1670ca32237d31295587fc6cac9907133fd07337280398121acbaa0d789d14e66010f7266850c1a54847ef08c6bd08c8794d8dc7266868c27dc60cd8d0ac14c0d61f417ec9cc9ba49cf59650eea9d0dc2d33878fd91e2601bd4170d771f5d3c709f7e502e1bcf280d22edec583c0daed679de52ba6f716f2fc8b815b6327ede0388833bb31858a14e733e128db7b0de831ff6a868863797598a0741751f1d45fca93c7179bf49978816fdfdef04fb2f47e517c91dab5a14983c1b033d063fcedb263644924cef0ce41a7bb3d9027ef841197017a939809bf63411aa564b4a802f8836981375fd95c0712a49ac44083bcccfc8da177b40bd6d5c4364c11dfb5f95a3c2b4fd531345400e03a5ead8f0e1a08c82192b59d14d92a0c81f595f48d256e98acae82235e3753248acc65197bb6ad64527f12cd0de05a2b982d63ccdc98dd1987c6316e9015ebe9ec51f6f90f762629cdc66965662c92000fec33098bfb927f65e9cff7e57fac4aa5f15356b6772c1308a8a2c1ed59e7a3a5baa1bf92d390561cb88d3c0397a694deb31b0513b460b8d328f761b74af7514be79f014ac25c2d8c2e7219d1e6930725a280d2ea231c2f807c515a417d8cf0adcc407361bbe9888f75ec6bd714aff0bdaed4abd8f55e7262e1d5da2049d6369c5a2327a515de7fb8373a35f577afac4d400bb464be0584697cd30832f848aa20d0d7e09f0feff6198fee5c1304680a66b83f6609f34791b1e7d737e74bf0fbd75589a0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "", 0, -804231310, 3925833126, "7192f9bd0cf7654ea4933f078ad1e8165fd7b850c5b76c036a5e551ecc5e7841"],
+	["6643f84004021725e89a459f098ac1e3841f32af554feacd7fe2736a3bf76342b8a23910fa00000000040051526affffffffe346409432318dd712ab53d4489e91dcdf7645828c8130593b4c39d7746a0246030000000563656a6a53b342f683ac99a80ac3400cc35fe5bcc266a0f925648bab2d26526717c8246811edc49a080000000004536363656775b334c8e0bf257d040ef1e6676d22fecf094ccf114546b72f40bb35588c530d1ec53c0300000007516a6300655153ffffffff034ba3f6010000000006525300535363738719030000000002005157c5f9020000000006636365ac63650000000000", "5200", 2, 1125458988, 3925833126, "2d4fb7447c6aee12e4f36d0639ff1c8ca20538d073944fb50b2e63de05cf2841"],
+	["0400008085202f8901b3c34d808d85162f5ad6637512de0cf2be93a070fcebab4c4ba329e7462172fd0000000005ac656551000bfd7713045729b1030000000009526a63530051000051b2be7305000000000651006a515200a2fad90500000000066aac535165630a66080300000000096a6a53ac6363526aac000000000000000005f4ec03000000000240d9b93e87557a10cece5fbea42e03a8b3b38d89023926ee82f53b07733ce7dfc9e865f19381875c6719fe509b4924e80194bb5763e1da6b25bde2fc25978334cf1412f130d130918fa0679b951cf0eb2d97d6abdfa4b5658255a244324358cf8cf0b8af5e282a1233e51bc55b64dfcc40b9b3513e74c0f0ae71187ae8f487872e00cb768d76cd95c2677b973f83859749fe7a0ddb5b956c30a59f54dc0b449746edeecbcd918a2b0569bb28ea3aa61272854f7822db3bd428be90fa094e936903336831ee1daecaa43a083cce7a42e7574bc6608e217568fb8edd22d57a253593f7224e0f1a9942135a72871b62f34081b5a20a6de239a31481d328025d9b7d417f65ef3fd6b95ad4b1bf4abf1ef79c374535e1a4b43566722f8a3618d06d1e7cbcfc7cf85fc0fc1556dde5e9439872b2ae178e2d3be6f1b91e2380ecc43c7502034e2cecfeff85160d91067ea6b30500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000046e06d54fff21489a6e7a0bd4a985009d6a082a58426cacb2950db6b6c0b7438319f89f200d379c9f9d19025793e25b6cfc2d1a04167ad5ee7b289c2efd4fe3cdbe75c59dfb656da96db01c8bc75b526822a3db4cad267024f4a6b52b1ee1988a9a982d965f5a38aa28353eb84142af9f1fe731f3058237fd9cddfa31295f04c26c79ca26b0d913d04c9458388b577730b53e892e8b9feca581aced3a572c4730a32eb33d95689ecf49ebe53f9ec5938aeb558f304f2033f1b9b91d15ec41f6432592414de6712d7cc2319a3e1d659926a8b6a940f59c3b5cbae831b894aa74304ab453f2f7427096c6ba8511329b730903a683c82be17abecf973d22f865b59e994db9368353eb5e2b7e9e9740c3006ba0d0fe3d161ba2f887c33724661a66e53932a6d9dbbd91144775805064ab5e648224e432f7d50798cfc7d9797858afd02034e2cecfeff85160d91067ea6b30500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002e5d288eddb99ccdc8069ad80097dacbb96a804c7da64dc0ed970131dc60611f19004cd6d480ada6a1070c719026dc1dd498a6533cb330c4a9a121f103e42734cb103ef91b19ef0f31b0ddcb45d614e94e6ce26fbad6202253e33c62e1dc421526f091b69863b6458eef8c8a415cb8cf1a4e6884947ac34d787f287d4c2b04a56c17273061f5bce8efbdea00e413174f3127f55e6a17ec1eef65f12f467a81bb25403df81f0350d4fd8c9396aa5d790a1666ed2336e187db1081f0f6b9fe71d74f2419f144bc4bc5872e2803462c50fed22286ce0222537176cdbef267a300f1d86d6a0783d651a22999124a49fe6f16e4113af316f04d8f93c050c3654641380d5776fa8693ea7b06b2b0fb21432184f48f0059c37c93ac4d2607dff43163de5c6ce5d31adceedc4ad8c314e0e854d3ce5c52e65d119fab57d24cd45c0943dad4d6ec466d55e325d19e990b8c2dfc97ecbcab1e51eb45a2f19d151e3aa4fac1aded1ac54965ccbf5bade0b7a7195892fd42834af7515db2a39c65817becfa0efdec319397e06612a02c228b47e9999a646e9d7a522ac6270cfa456a9d2bec12d4a71f0dc12618624b125ab05bae724aa4968ac4befc888f379c3b15dd1b1692644d99600d72975cdbc7b801fc6f968189f84b75489aaf643b584a5b01a981b4b22adbf7e4d76a5ce0f472879ab0e436a8f4c1c3f08a460f2ef0a793fd538b951da23d3f437ac79f39692bbfa22123389cdeb33443b20660aebe944496caeb9a49ac94b98181c18a42fb7bcae59c3c0a5ecfd12ecd321f8d8a540ceb7de1304dfead7e26f882f0a65113ea88291eda57beeea4cf33602cf8c6e4c0997ef3c79e969c1885c5aec1fafa478097a99f96b686338467c12e0b72f1bb283ba75c070592653057ea191084f22e279ff781b4b937fbcf169defdab9cf548d1ff33c7878fc24a924bf019b13ea41d75406b8e49aeb56df82e2f3e323c8cdf51ca970204030ebd0c4c95a71e89736115ceb8ca8a5f395da216e57f6003ecb481b82d74b5adb2195b40e5fe61f50315a9a238587278b4f6ea712f2f44385036cc20547269c0ffcffd65b5f8152440dfb924dff21b1582d733abd3ab2a51d5cf259bef0a44a88553a6e2f5916cccbb6392063e53d074e5ce1a274c62c33f4d29b483dbbff218796a0cfbede57dd3ab1f91dc187d077b499e0c23caee3acc667476b4f17f4afa994530c0a4bd604d8ddd39d040d6e7ee376c46aa90cebebafb0d87d36f00e5e324f98502805edb669b07e88e7a9cd7c8c57578b5115fe984cd6ced41f03b7665def845dfee381516ff0dfb6457d0b731af5939dd57089e79ec365926a0afcdec320280f13209da5046020275d5e8e30ddbe36747f2e298a8db3d5ebbc3c31246c11770eb590d61bbe23041476741e34c7dbf8d4e853ba21bc16e4fba5652714eef9341c5d8d61d6fd1c65383ce418c5dd1cca89fcd308800cfc307c35b1c1235922330fc5eda01d035d921e88ff87db264e95f52c4d746257dc0c1cc77762bccc5513dd2529769f32714893b4328fbf0e5dd99db8a0e928e8fb674a9db413e5199b117828b007a9ca957997b625c239ae0a573274399ec1ca46ba467a6b9bee9253bf87cf3b344e92b5419afc250b9b835a2983ec1a96bac74328251471e47527e76b81953404c93dac3492a33d3fe2fd874ce9092efe726d8d83e72d80d13a53263bec24fc21b48b7cddef363d82ce2c1b47eec8317a0b4b065b8329cb431c7a31b64b65c7cc29b5377cd57e03ca657f1537ed04b47bb4a4fcf5e1160319124c112efcb7ad9d1f0eecc5fced383a4c6d829dd7de9b54dda83791edb172abb802179e0d6abb3fce3edf76ebda4265bb2a578fc328acd18aed1a147cc84bc789c2e68197facb597f5baf5da1d1eaf2997b8f520714dfb8c41783169003dbf0731f74d199461d359ec950bf98fc8ee54a025095d63f88c5391e3d6399d8f232cf599adac5c1c090c60202a92c609566f0f03c30dd570905bd7bc7f3b2f5e3fb8c6f7ff2f8065a3bf4c0caaa9b8894008c69ac7943c9db6aac10ee7143b58d52ee7c88a80097f19ea18c5301f5e59f0e0d4339910b0d7826324680de580915e8acd494fc88c62b9548bd80351ce6fab311e446ba7e645b2e7e01e5e0fd7b6e6779e4823ce1cce4a20921ad9bcf64ec81c5a533447f09862ee7593b7de55c76a853e037ff073a3a283d4860ff72a2e13ff7a785b84fe5d5e76a04a15566978417bdef6493ca6f4c89d7c3bd0d02ead89b9e37d07a40b2f7176d8f49cf7d68a2659a270955933b7cc8a7089829cfd061938c5fd8ff807537a98d4916de48ed21c4faee247b178083340c1eeee0c88a3dc7dc693e56cc71c296d0d8818440e09a89ca15af7e8652e57fea36c3c087f24998f3c3613e502a35f3f79d7bc9e8352e30d65e922ea225b89bce6ba623be6b21a8853d2fb48aebc51d0027e4cd281d41ebda2fd3ad38c1c178e064fa03a691f3bb7f3df0e269a6e15ee8ce518e9f706098d8197a1d46c1b3810e95e816d20c2ad9e37ceacf349d94d6ca32f843719967d9066d9d9cf09588fc274b7987d7abb936b886927bb3914fa861d3cc62d332b597bd308de7aa11140bca671dfcda73ee8d8f090f0e9149e1dd91b5df5d1d959b8dee9769b24ecd8c19ae4020000000000000000a9a0db0000000000ad538dc34eb54b10e12792fcdfcafbd97e4f79b8c7c2279decc0134b6e954deb1ba9c86039cdc9daa0f94c6d2b49ddab57986567f106186f73e575fd6ab1617f4b5d34cc490d440f587de7bacb119e35e7605d9a2e92b3da392504ea2d3bf5aa000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002b87a4769900104360020e06f43db629b61d6cb2c78afe68518a413bd8ab23c6b6b40201a6e8908b8be43f3ec8d2bfd701e7a75855adab451f9821801eadf46611ed374e516cdc23bd583138dc130ad1d5ef47eb4809eb24cbccb7d9194b84c2b571aa6d4f2e183dc0f53a2b4381749a8d96eea7ba36cbc7075bc424f2a6dd7a439e1e554de6fa403110bba90902e2ae381efee6f44ca8846820d25ff6d39b6986285467207e50fc1c3e2982426be5e802217706531c316b6b8e08ef2dd592be36674eae502bf977d541ea0db5c6c4c61b05eb0caa03ebf18609839e6528c5f226e6fa3792e623834dd9c2162622c2d8ca86b1a468a67a56778c5fdfb9ee670fb09aca0ce1ce90a864130fdd2ed5c34a60ad9d954d43bcc543f58bf15b96b2392c2364c69c0c4131d9e993faf8e6ce45a2153e01317d704e1b02d4c08653ac3508b898fcc6c2729a1c3c8db9b50adba1534e018597d15be99ff12c89084607d88bbc21db7c7eb608ef961026bf0aa4ec2a1c15c8f2edf2e3cc2e9d65fce525bb1ea6887f6e70202001cba017f16497e6ac15a0bc96062a5d9fa7c0cb3858b5c8e36aec8bd79d9679bfc78c1127439e0fe1342d9cb2b1601de7f451f3f5ea94d2a190ae4e69ac8e4c856eb259e2e875eab4ad3d715c6a337f7260dacc5bc718a88b405c70fbc79a43fadbe9479e1c3600e9cf19a288c7748c397ca670fbd9f54eededbce62d9748f80f7eb1d0f30872b732d93ce6c1ca07e4bb6fa25d66f53e80fb1c08f8c4848b68492b40e082bf976cf3aff39d7c15bfeb280a49b30e15c906e2bfe8c4573fd23bfc42bbd7e9ac085425542dfb58a827f5d00a1dca892968ff194c34af08a7bf3f284d5379e92f9b8993c439395e7dc084dfd213a1fe16c19916a54b437a141e56e279b912598e4e2dcda655de5b0fc05f92a9bb973ef342f06ea87123560f57da3522e3250ef1110a7af4fdb1d600f9cc7bdf96c99b97efaa22e882a85a0e79a665d7a5147dd460733d980cec919fe2b500cff29dc863ba3d45ba52d670831bf80a4edcba5dd9ff4a9a9542b043fdf2a46286523bc5d852916dfcb54217e9af38fb8d34aff15909b6e349240492c798ba62ee531d4b37bb53edb1b121359a85bcc13d05b7f4749a67907fee856742c42e1c3e98a34bc21428e8ebadf280e6ead477ff28738e8739bd3dc3382e75f3f545e57b94cc37e64d134595b70e23c964e83df1d74a22aeb58f37afcca3b7f8afca2bd60a3d303487b13bab16f89d0c2e1b7b6422888b52abea4b56c3254d6e5950c12ca94dad5609a46e336077c3feaa94ad6da31669b8ec7653be0d7994728868ced8c9696e81c4c67bca5f4da1b27f686c82c648d3967ae1f99962c2f6c16f9f7f2366c3cc82e28a88c2923f9b9adfbf2648e048862895b8b1e294de72990cd5a0977a729f327fde30b9c427f42e58966f35e8835e30ab37fb5e08a1c1db28987786daf1bb23b7715c16c0bb0f4f2b1a6fd244e125283eb072cf3272a6a797259ac30e2384543bccbc497035ec8149e1115c2845545ff9592a8a85458dde7f27be355aaa74e9df90f6a3c2ec8eca66fa494d1e84c7536e91983724d89d39400cd65ff2e37b271167caabba2a9b73eddb61a81d8994356556f81d0ea541dd5aae8f586aa958b701f9b4987e1406d991f72b68cf49fc08dfa7a0b6d40889839e85e507ac9b0b3849cde5610037f7acfc2c30a3889c12625ce0da3c78ce992f112beeb2b1d9f243d0f58313e0843a5fc18e78b66362abd9dc10f2d3319d96c803823abdc535d7b1950c6a5d7b4bc7874d44693b50da5e4650b6ce937624593fa43f7ae7148d8dd302874952b755df9405a2126dc6c866a33063f7d050efe99710cd26b09d3cd97aac62b8917e109196079b5c9d7ddffd2e658f53d68dbe324f358d4c02777189a36a2ac7b5759ff886fedfae5d93c8901e89a5199f2b8b570e17ec74dff4d2557b2f603fceead883d23e053ceed612d097657cfd06fbbdbd70e074580cd4718d02b8ed6112f8a5efeee93881a185295f4572428e208a818d16fdc03df84b5b23f5825499b68af515ee621c1dfc4e56157500c43ccc329a52810a610135bc959f55fb7385e3f3d94ed76224234cffd634310f42d9ca000000000000000021b3a803000000008baf41c3900eafea7a4aeca7e61d30cb3645d1359286c6a28e1e1f35a889d07c67c85ca8f70267e4c19ba1c79cad6735f6f9b2b8cb9929c2c5a7ed1710dbd08e192d8bdfbb7ff755bae550962772efe8f7ec1032829d4ee2eac111f9224c2fdf000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003bc17ca8392f601eaef8a594ac45bae28afcaa4bda89444b8560cc0d9280eda76f3dc836e2565debe5160183a463bf22da276b0ab0459587ef7eca3aa5bb9ddf9e76dffd907e6d3b08d17bfe9406afa175d7a9b49e5982d809f4383fe14f81e0038c50fb8588c78fd2862e1015ea1a5ce691db39478ff93634ae2cba81b71190b12429dfc8c611ce489588557323f098fd38093ef0c06b5e4d916a862e3a3794c93bcd687430a86e9aa415b6142d621e19ef17ef9f023a117071ad080b340217b0656f0af03032b473a50d90819795bef4dfacaa78e5d15e5b51a9b8ebb55517d1412652ce061c0e392837fe0cd3fa67a88daff010c47ce47ff243f831d97b8f2ad97d50595591fa7b80bb2771e07c99058f513928298bbeaab6653b4bd592697a63fb75c76ab6abaf8bf333354ad0733328d5ad1ff1c94acfc1bb509a9a37a3f3bf076746dd84cccd77ad9cc60430833c39c097995d140cbe4ec73c2b37e53d4cc155a81fb6aacd613ea47b803ef065b708180d90b5b549af91a91a37d06c75f17bbf419f6f7baca07ab869df1a2426699f06df5bf9b1fa4e3a604916e4447fa189582f6e4e94bdac95ed8df2b8f9b8d04fcc7cf5a6c4b2d78a8ed6d1b5efe8bb7aff1c3b0e437435a602cdeb426b426d6b8023cbaa197e09401bd9f18607951b1d80ed09df7146fa4606e11aa42c9924838d34ae8545c8e8cb692545b8366665fed9f1d1bab4ffa35c1a2f40761c06043c7899a73378570021981cbae81cac241cc616f21b0ac2a2b4284a6c0d314fe25350e548d4626d20c282c5ca9e3164338d454da02b949fc031ed6d28778486533296b79a7e8e450d03f7679b4e821c69d00bdce2a79e18914f2825d8e91e2582981f55180f58a66e5d1c4cf6a5f5f701a293d5109426ea32bbc265669dfdc21d2c6f22b6e9d31bef9521061c432a02d04e5f2f417a307c67dd2a68645c55fcf35b4e5d34c3b2ff89030b993225aa5d089132e12fbd22b876ae60e82b72f67df2e3a97e7c306cdbd0624f8ccd14581e2036ee13efc2e93d0e3323a7c02f2b043864aa1c48371be1ae8216cb06bd4996aa7760918349fabd3b382abfe9e333394f2a4e91422174a43f4087cacbf907c4e42387c6df1ffee51dd35298b9ae7abbdc85b1ed40412b5931388cb7ea0c9ba1cccc3c620945a3a8211e065969eb440f52f2f5f8352e5350380ef72f1ce16ea947a9f19371058efe331c93b4e4340d16a86480a4f497b61a07bf92d8ceb240aa33f75e44023727074443ee4d5ed4b5096fa07831ec399d7c0fc696921c83b020ea2b0c7b04d204d215626324db469cf887cc2a9158b38e55cba6c630881b595c1ba7975f0a2eec7393a6c701bdfb73787edae434ba7bd608e37e6a793982b6d4b49c9e436d9769ee223a43df9eb1fcf3c024581b821de8c596df851e989a155ca488dc3302e5f8bae5687c06409fb0ebae6753d503c484def674aae247d54fca0664bf7736441ae652884acae7a70e9722ba7900a80558d4d3cb5e56121b4e5cb54a3978d13da2ce60e8a3da0a8dbb0ffbaf2f842d1063322b7055eafa8944bbdb42c65f89572e56edc25789c4cbdc6896e4845ea5b6be798ea5cce5e061d66728aaff371315634996f432dcf693bc63c157c517d14bcdfc6d5962980b5e032c423f39264e90302cc008d1eea31a1aeae2c66ff2030df9dc2fb03e56a922f4bc99ad66e6129e9f467da8144ac76f799c4b53d86010c2294c54da817aa23394b21135bda1943e37cd9a1cc46b5dc3b3f7b4e865c962783b2d208fad94c80c492e9c77e6d31f9037b8139e3961d53e014b59bb9a1e3db41348182b33e96d3b55e766f102e0cf7c9f21c89cc76a3eff08cc2745a67db8ebe1583473b4a610ccbe26e76a0df4aea224de9c652f37c241346e4a04e7a1ee7cc3bdd877dfc5b0a365b46a678dddb7ca087489db6a5f26511117408e7eff5e36b17bc896fd4a6a68107dd0c6c648acf626a202261958c3ebe69a5628c225870efc9082c7a245fda5ae848a2fa2f4e6a204cb6e6b8b6cc66ef753e273b8c8def1dd7bad865abe38e24abbe9a2309c78df2aaa0e20d4e036aef59bc261c4b2d532376fb606714417554305519a3e260e70471fa16f9737f25a590826c6a72174b52632814fa0d9a2e7f81836798b0b5a05f8f2e26d03cd148d20827ec433f7d0cb0da3f44b9fb5906b3aa8630da3d3007d50ea2e5cac13fe86728ff04ecd03342e9b57549fb151f696fe153e05b7e5f11dbd5acaf1b3920e743b9c950a00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "52", 0, 1079034703, 4179206552, "7a6719a090150d0a3122c985ac34b7bf4c6af5128d9e57da8c4d1af0796cdd71"],
+	["03d448770452b6e5f2d8a0e6c0bd52341d66b07e259a6cf1ed7617c29c9b9c59d35027584002000000046aac006ae587ff308ccdd340eb3e0969b1c871ca877905224254ec5cc089962c8198ff255cfa3b6900000000036a5100ffffffff3ff971861be8b34eabd0e470ab048d532678ef2710dce6e807b3e3dbf1d41dca0300000004526a51aca7bed58c82802e2b00d7246caf526a299f07e53f3b9ceace4e44ce0bb4049fe482c81729000000000600536552ac65eaa6b60d01bb19c900000000000251510000000000", "", 0, -823776030, 0, "204e7ee029cd6d716285528621f46dca289654943a36eb48dba19e9ba7f2e366"],
+	["030000807082c40303e2d768f0bee5e355cb3faee3718181c3fbc109b5f2e015553f48baefe66a7d62000000000451ac006a2b8c8d95f5583683a5446719141c775a9fc75b3f438808c58084e8d9b3d2a4968d7fb6b803000000036a636affffffffba7d4e54d9814af31b13bd94e6cb111fa6ffb6624c77c7fbd08377c513638c680100000000ab8e9ac202be3833010000000004536365538aefe4040000000007ac635151ac656ace5030b410b5340600", "", 1, -135570197, 4179206552, "0dc091bd1b9b26af09ac4eeade88ce0ab6fbdcbe5b82481c0daac3e053ccb9a6"],
+	["8e667f2703a28ca651767dcb602360bc142841feb42d7faabbaf082e3dd3083628467dc3830200000003005152ffffffffca7aaa152961f51778ca0dfe6cafd64e7e3d466be8f86d64f3b082810918182d02000000096552636552525353acffffffffcb32b42db62ddc4927eaadae337a06ad380cbeb764e6f271c401cf51d1753c9c0200000003ac5200ffffffff03b19a4001000000000200acc404470300000000056a636a5351d3689c020000000006ac63005252acfc18fe2600", "", 2, -498665884, 3925833126, "7754a60107a470233c2370be5ef398747209e5f8d2a43866c7fbde8f5aeb9ba6"],
+	["20085e48042dc46bec60e13c83e4017fcfb2f17598bc0b9abef540ab74b7da98c2cd14d132030000000200acffffffffafa03705c343ace5cdf6480e12264fb5c542c3d0243920a175fcbf478b25ebb90200000003ac0000ffffffffc50fb2a4f98e6a537cfb0cc623c73f3766ab1d84e305a3a61e48c1003de519600100000003ac5263ffffffff6bddfb9f715ad52ae7b1789334956a79d1f108eaa74a8d53357145b26f63bdcd03000000096a6a0051536a655353ffffffff021cd8cb0400000000010019f4c805000000000953656a5151acac65530bb1da0b00", "006aac5353", 2, -656624419, 4122551051, "42360fdf8b28bf62087ddd2e051259bec64453d151f38ddea07dd1ba8970a98f"],
+	["0400008085202f89027fb9e3a7dbb4dca28bd760f2c047174058357e76f39710290c18b933bda608d50000000008acac52526363ac652fca5dadfb282eb43e6b85ffa11aa16b17cb0981ca90863aff5a5cf43d8cbbf0ce528f9f0200000004526552ac59829a4f04033ba00400000000086353ac63005253ac6a160b0400000000036a5265132a9f0500000000086a516a515351ac008123dc050000000006525263ac636a000000004ec73e19f6c930000000000004bfe45e63ed8b76f3a753b5a262a7628259c26a723628cb6265e650271dc2bf882cd9bc0bec70ed9ce5a1dd379db0e83f82c41a2e96f4147cf39e570f3b7abf0d4660510ce90a7c04dfa50829c517a72095b9bfb42e7576b0b94e18ae90112ca4faae8b213fcf2660aa0a8fbc47ca6f5eb880ae120550440ae2cef69c936523f3b8c8ad20320f9e0923990302fab9c7e90815edcb1275e56a49b363fbaea58c4c904586ffbdb54a8c687d83b877fcb6c2ac458743df60350e5f0f556802df53062efbf175cbabaa4654fa6838f447112d4400e30b308a29b637f7b34194d3b2d47c8c4d81a1e33594d1d6bb093542da1ab203a452236f5385ade26c2fbedef50d36f872e645631fa43936b8db1a75ee20b12b9f4bf20cf8a6be004d615ebbb663f5bed693bb4271c58348516049d2ae5c623347087d5d319bae63e6406f2bac12b7e5f11dbd5acaf1b3920e743b9c950a000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000eaf0bb2eddcd52684c7beaff5c2ef2d0c9bd3a16a7e2e2e5ba047730e947afc0560df4d0f5eeda8bbb9b912ba50942b18f2c34badce273f8e494808cce838d16ed3daeaa366bb80b9c635b1c54f66f18ca5d36eb21f00ff85b5faabf14acd9fb68d273d6b2d1be677a1fb52e732b0a00d7a5cbff697d59e982eaaa673ad4d532019f7119c989a5af81cfaaa6fb78bcb661baa25892b4ddf90a5707b4d8f8b8bed5b898fd946ed73c7dc0fb923bfad46c4b553331ec87d29ec8cb4d842e044236bbecd24d87cee861b04bb3e52ef4b949cdeaa383810c502a4a0b3473bf73ac95ffc26a075c06975261f2865b483ed2a8cbf725c2b590f5a29d3b26303ae7bb9dd317dd23316a7deb06fe340dbabd92c5c71e9f95dc70cae5697f743b9ae313616afbeb504e3414b746eddcc9d80e0b20ec84c4df5617c1efece0307eb23bb29bb7e5f11dbd5acaf1b3920e743b9c950a0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000f7cfb8c7327b6a19c472f91e35cc79b1e942190b2fc556b6b346417d0e5a7d84bc4f9ad49765fb943b727b88c078fe0853e24f9817717cdbdb825b1f3a3323337904f659443c993a840e6ee22e8909d41c6f5ac952da78b0093b3c106ea45f0481622ee2476f1d8e9347fe4db6f0bc870809275db9f5ea445520ba93ce842dcc0dbb2f7d79a6679510ef33fcb0d3d97b60531329f68a1f660fa8d9cdf8264c161596e752739fc7f360a942903ae4d0a31b161dde6c1a790bbfb6b707f18bf75decd3d0a19260869304ac0136d988df50d4976757ce874d8f93ff9a338c82fec8549866112732faa2c3cb5c10d5589c2795d361c8ab7e6847a9687baa20d94105b907a1db8011e573c5488a7ca87904bd6221bbe9823e38c51049334c0062d16b303f4f916cbe86aaf4c182609f0fd735ffb167f924f670eb4add7ec442e48e4b7e5f11dbd5acaf1b3920e743b9c950a000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000365cd9c828e195193b46253f8c42aa5e3b04851a4717db9e91624171af50ae3793a2149870479e9ac0fcd72c85169d1b423deb4c38430d025d82db50301a80176fda27e8f237dc591e57888b33c46e3aa483e789279d7667192d46fe2908ddbcfaf0fa8f12d02f770a8c6de895b7b5b24bb942a4d311cc67c663c074fbebea31b6b56fac8aa15fe37258e048b68623356ba9642123af4b1969a69ce7a12c7650e9e682af439789a3e97344a538e1c6e640fbcbf2be6ab55cbce7ed1607fb94505fc09ff5d01670cb5e9d480a1a161b51e1063b08aa4b48862ff64bad4ea7045d31bb705898614a480d3239c30e663e46548703d733f8cd2dc6599c5a43813be9dad6286a7f6b3a25ed0fd90199eb78c24d3cd83f77d0ac09cb695982fdbaba2dcfb1dd75776d49c3807c3d08c4d3525ae472369e8b9c7f9458ca51bf6d56fd33b7e5f11dbd5acaf1b3920e743b9c950a000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000030fa0ad76d748e07a88b3803b5b2bee5dce050b9b638638d6b3a247145cc06d4736c0a4e9028469e34307b7cbf0a981f60894171e7f16832bf77f9f6d512a404c5127e83f00b46d88e9e315d29a33d63cf03cbcb7fe1ee164cff1f02540d97d2b714701cff32e96b4c6bbc82bcd702658d4d1bda6392be0545e709a7a6dedd56eb6196d895f2f4ed832ab61cced592a3088f50a563ca45e4ac5542d6d49c6aa4556c4a0ceeabd752f09140435501d76a9db99d7732b785aeaf27172f2ab30781d0f2b93dc94c9d7ace4f2f0b3c53da1671ac081cbad786f8049bda7e90baf11ef22364aac74d8323bbefe4b3fa927f83b5636f81f801328d263027b13bbc22002c841795b86971341c4aab7f7c11b59755da054481c4c34a96ba1105c35e2d3c25b14900eff08a0a953c493f74cd7dcd681b1ca2f07dad1cfcc61cc34abbb2765ae319c01991ba532e7d652cc558c765bed45cb508765c821faaad547ded0060738d2f33b5ea714addf709bc58799ba199e5da9f7523c7251528778a34ef5a3a5a2fcb98dd20fbff9a1391407fbf703858eadf68f0f66dca36b1bcde4b6ff01dcd9c8371765fe3226ac0145582c69de30eb899a612a29e647a81137c3a9c358d450921368ba242276524f35c66df642d3ede274023156aa4c5ef4e65f53db33088ef6c39cf909c37e1b63c63e046b93d79f7f367fc80d2f624d8daabafa9d6d9c7ec46949ad741cf7d0e86e479201c83f5fd27e17c6f2112288bbe7b583fe18e052a10c8ca03def43f76609219c9c2151279c9eff998a4b856ce15435b124b156f0f197819274c555a9fe5776d2e948d71f09e2cd831068e50534b4c20a46706455cd7a7eea81219864c477d0e45e891366e54e627b337c311dbdcb8c9e2c9ad22ab7202b02b7ee6f15923c6a205a3a2a2e4ff2330260bb444e5ad537ba1be140341c45d5fcb4775702f3e64f2280142a1360f284974a5462b959565c0797edde383a6e21f2b538e98e2c5d470f0c639f683798eaba7c87117d47dd3cf9d0421a5f080eb673307edd877d2dc8835573cb73cef9028e96fd70ecee2940c7107e1192b6df8b243a47379bc5eccd8f861c2bfe01e076dc0350921fd21e7c59d73dc96b8f5581d4659ad5e282b5400c31ad811baa470050d7773897c6180350c4a677be477ab73f70b12b8e6d0144ad7aa915cf06acfc48ec2da74c350fe083b96c24c91c71708073da6086500416d01a5dcd6756ab2929be2fb579f5e353664467c8b0fb4ed34308d143894f207acf024ebf903233a1f6089366345a083669886929886e14c2a77d38a59e19f74cfa9ddcc9f1c5ea7d14cc39322e86257916cd83a87a24330ee7fce9aa307108afb3eabf4b1a103f6a8ebda24c9ea89e50f086422a59b14ea605a5ccca8ae0e7bf2c470e805cd2845fc39d9886b8c6e690c6d77b7bccdc853e7bf70ed5def3459ab71d5d215ca8f9c6a144dc7033ec86e7b50397b705ebf89f758f39ab0155f6421aeb12a2fdca4a5806ba491007e3edbfd5ecb56b4a83cfb1f042a8ec559a379d79bcb2d29ff81bc6de2bb117dae714fd7f7bed7dbb3139d4a1ec7951beb372edfab7ed5e2d4ef5d4d50cd27e55df32b541692d8a5fcaf764acecbe5c7d73780013484f754b2b21a6299c9cf29dec3a39d6fb845c8815a37a9e4c737565bc5148f2eedfb8bed9e85a4e01f607d1260f7da95ffee37e5cb86fe46bc1384b5b8208bda88b072e639d5680ded0deaad9b1fc8082adb81f095667e14aa3a0b82396b9eb8417bf69f08a23b7459b46b52c8d93dea32fb4bd8e21f7d1a2357dd7c1081d38eb04b1d1da5545f48fa6ac3a9a6824d6411a3203d44ce72e7253783e31744ebd62b380654511c8c2808a365fa5172d91f26596f2502158d240125e9e0e877b0a8de30fd063e1a666d20f3b445b5ced67bcfc662bfb5dfa4e24ea70e59d0c465c367c32524c80ad8d18fa710b1890d0a7216129daa25a5845ea0798b87349ca2267dcb0c3b887e67f126cd6affdd0a542006db07ee2a7cb3c768fb764f69661741abc914f6b9d1ce3b2cae627e619c4356c5daf53678ec8552dded06686f331dfb1228f089ce3a39576f0cf92850232fca1dd3d9b0ecc76051c19ae72327eed69be61e2394436455b5dd4ad9c8d747c222870ed101331f41148d5f196d7b4cbd5bf3707cbecab81db5a1597378ece567690d3e2f2fbba01f7f2901cfc32c608273bb82053a4282e595b6555e1dffaf3ced060c32affa3c778271555b36bf22f086c34365f5ed0a921013bb2718f18d157f6774c91422943381717ec4ac1bdf376af2f10704f6aed7b632443cab03164800187624e14488a79adf5c982e80850396d5dabe9ffb84d82852aaabe6cc0a836e0fdce4ddb3bbe146e804b0157c2236ab74cef4a8af963ec6fced51152f24786fc24e111c8a96142ef6dea618d83b5a4bc0bf518abe61d0e707cbbefaa101046fc58c8d519d3046138f20c1c2c1256fac2c63753ff0726b715ab5c31af94aaf466ec54df82ec59c4a86d3004eaf1759c3beb0687b934e46171acaa80de0547ef8154b5c0b923ba231475c02d255d3e7879bf402924a36f9cfb5810f56e1b5619ceb82b9b36f72be2611ed9954149a24053482b932bdcc82db6324c33f9981dbdcc0c4c962878708e97484451be3ebad115d63c2f38d38c1ca4cc46af2ebafac42d504a81e2ec1005d87c811ff6dda9fc3f47e7f37438f38964db46f9a3a29c37a16ad12d43a1b6acf4da053ea512e7b092d2048541bae645af81fa055e3339bbcbf5efa7c82dc6f357f1e5815e8cf6cb65dcb3a97004d06a0936aee36de1125b1493b8e198dcdaed01843e9e540e4b1b3c27beb754c3dc36c629d35cb39b928b28284ee3060f7371490ba2fda8af34bb4b27b8a11dadf237f8a86b6169cebff689da4e8710fd1ca286548f1f98989d8e7aa8c690de262ce96e9b2100d365ff1dad497c9c27e434179f34926fb34d729db82b359b03a8a32d96dc06d751e9c4066f5339ae92348489c65762eedeff08410ee7181b95f79825fe39d8821c2330d8e60c1de758611c3687ab84303fc72eb9114e4c1c67b8920497c8cbacc597127928fc3af272b8c072fcdf36c8fbf4f9953f5d742e25bf1868e0136b4f562d07f2242386abf898c981e003eab5ca4193bb0c307ff80dde4a32689b43901e4a2db57d5b797c06cb3f738246ac1ff5ebf12f9a02acda538cebf332978c63801412412cde0c6541a9a7ea7ac28cca78662d2e1966ebf8059501c822b2a0405894394a8a8a4f47ac25a54e417e3a1d5a9b0d6d974402f46c997387dc1f608a9979e66d7d503800eb9ea7ca2994eb2d367ba54b097077f2cdd6624ee7ee50b52ae5f00d2d13c4a4caeb0dc549432b92fe65212ead963081201c7ee72c8698339e86fbd48094e61fddc705bc46b70e7befc9a096081b7e605c6ba9321fe4d6911b54f90c731b4cab0abdf2e70bb0c2e64968199247b40f3f093a2a4e513f5802f252490cb6c76e1952c338ba5a8dcdc3d6d02e4d85ed9190758b389b6e45c2322f57eb43f3c2a833884ce78231baddae4d2218f9a3783a05ea0cf6a86e20888d13326347252e6c62b5e422e0a898b0fd705a115a2c81c2dbfaae2dc8138d786c84bfdba04af3a0f21a4d06cc6b1423c9547b1bffc883402bf1ed647bce9396f9aaf49630ac4839f997583fad41c8953b4cf0b422487de1cd84f48ad5fd4c0813e479e32eb93c0821714a2b4e7bf757447210af37ee44ea66075b077cc051018832be8035ac7e0bf5334aca71fac26894c435a8bf8b45bc846ca43d44ef59e3f560a07ec190f8be3ca30c1df9959fed8d9a47cd61a76c0c74572974a35f131e5000d157960b0044abbd4812cb00115b3f7e721dace2abd85026430765d2620d1c04ba2d1883197d1c324c73e681515a86da177dd3a36c5fd0d36b998657f7f0b73bba89c2ca024e6a5d764e4314e7ddec233b035fcd91d6910dab62494e0dc68b052d4f010000000000000000f622ba0100000000426ac8cce02dc482e9b6d6b096d4d4051fbf473dff22efa5f92183642cb60d5daa8858ccdd73448c4b26fc88cde319331cc7e3d7b9388ecfc900e444f56a9cb6289a6e973255a87610bb43a3afa24d7b35a5bacd1ebbfc5e5dc87dd13614141e000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000006197af6d1adbd344d5d6e4d35b39ce20d19ed9eacf618c473a5138267267488c85b0f6fb076a811aafa58c3daeadc23585e779ca824e57fa99ce26068d199b2cb1510ef71af2450c6ab10ee4f7a2fe98f0efdf75b0c5e96cd2f1d127cbbde2dce58d19e54176fc6b50cdfff9277b439e73cce8ba4f0436f8c7be4b9043b7579aaae9dabaace01bd647614f23101094f549370d64e47bc5f9c6ceaf39cfea417e617caad77ef42212160e2009ec6d294e87777038d5548ed85c697e65ca43fde24098b4894199a9765af7fcf1bef94a3b939d2db56b4220180598947d2c60ff663ccd383eda6e01dab30bb1d2caccfe619e1aaf2ee3a0933adc268da854e4aa92813e18b01f4c17bd805583f6928607f9c3a6893df80af9838bd87e1a852ac0a2b9d05a3f31b33d11d1519fd481beff7af1bf08218189f212c0861089277c404140a081c5debaae687ccab4251e5ff70e7c61cdd671ec8a036606aade76ce5cc05227a6f3b1cca6af80f03f82293d3663a0770aaf234d5574a6f80e7f2a8504e40e08c12587b7573274e612ebfa26af3ccc45177ade970ac97232d3bdb3205cf2a39fce4b65e67bd0909a1c2ab1fa8ead62b19cf0f48ea51d5cdf42a071752c4cc25349704d3bc6f4e1becd1ac7cc0c74caf24c3c3cff9da25f3f4f8391dfc4e76d9b08189d1d7598fcf286af3d9db2f048551f4e8c8f05e912833b6272606a999a16fa6291527f4dd2315d628cb416d04981ba33e440bada8fee58e8253962f689fdc83cba451459ccdcd2c1dbb30d858bc3d8292113a53810c8723346253bdcce50497461c3642cbcd130dd735a0d51628b2e53b7c06c7c64d321fdc6b1082b74a92c20c5f2d9c0d941306e6cd0ea2ce7cb52e04e0e13af4de83c53b7d98cfcbb0a8cbc1549da5c5b4f60cd1cf47eb9e71568f2defa8cbdf7d76f58dfc37c74d52d324cf9ea4cf0131ff61d99f63db342cbacb2668f236365ba00936aca961e228b3a6dcf3fe409dc8b98715f52e9006d9a08882723f3d119485604b74b0d6cf68b40a9ca8f09f03783c6ebc207e628cc93a36ddfd8dd674dfa9902017ca9ac30b92077e8087104f09b221330cc91bce0ce773c68562ac01e2dd911508aa3b909c837b325da683ecbed518ea858c214139b0fcd483f20406e8ee3fa70203e6a8dcccd074a9fe1e9066987ab34c1258fa89def1879c39065645d9e75fa155527bb8d142563b860324ebdbd4d811964f52c21142982bc8b6e47e25359c90d7db6415e7460f749e661a87d5396c53f5b09d104676fe0cad5ea6bb55f95e6f43fc0a9d07a3e826e1426946e31301866c76c3a21ef8acb8f496e7f97a3fbccb7dffbc799397a9cb7bc756800fb213257942a01ca89d95f0c5a93a1b780f6f4959437b42cfa006c4b78c8b75b7766060bb1aedf7cbf14ce87c888333d82dc4b9c7602493359905f93b916a8284ae51a8add5e99191e1f0a508fac204f4e5d4cf3294cd3010de336e44c1f05959e802c482e2bb8cd5a27e29526e6fb22b7026c71477d00362391c31bff9af0d8efb69c96f07ae43eaff960a6d83ca03cd0e6ba258e48e60165e2dd0159bcf4675ab24f1f71e2d637628dc52ce1f92487467ada2be02a454e8456ad61ad15bf88c45a67c8fa46f61895eb1f2f5763091548ffd77b446d6456195a47068dc490b1480f07156127b813d778953bfd948ef9432d6298038b8a3e846816371de43973c92392522ff5d0f45b965e9e9b1b6b97572442bab068e280202ace8e74047df041bf0eede18fef4d8027b4ee3d96bbce802d5652ec6f4e15031c9da217defcd8523e14a3b04f4cebf3d7e7fe2563006b54d9002acefbb1babe8304dd508dfcff2797d1c4cef8f3cf69413e9c235b9f66aeedbb0cb604b9c97e51c720a238ebec74aa136667f8ae872cf4ee2fc8a2e1221ec407aba52f4d6f318bf9d4ce4140fd372e7b3034bb82ad2ae883434d22208cffc72ef161701c018c9e1f815894d0360dd17e936214400c7786c77de186dd4b337c4e60faa8afde37d18a73413ac8ea28bbf808fb05d571c5d4b3d769c35b4cd8760a17bdfca66f4b332adf8800168d5d6647fc5d842744f5e57d6a550f01b39609c1a87f7b14c968baffda661d2977c08a598c419d7e43638058f52dc17d124869e9606dd003e3c2a5c8dba203fce511858ac0248d6997e082098426ad9c0f6f271a78ec5fd3b8558b515f8c09bdc7aadca25bea50e8aac4db31c97a1a29c4253865a506f70f81800f85181d4b694f8c64ff2161182f0800000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "52ac53", 1, 1029212170, 4179206552, "c0c1754cfe58b6695537dbbff0343a05678f6ee56e5305cc0b020c13cfc57dfa"],
+	["8756fc4204d77ddef86401d87152583d4c6c5d4677c6286a7decbb4155a3766b60fdf873b801000000065265006aac00ffffffffd98929a358554abd392c9e2e5b3402a123c7687bc430dcdec6d051009ab794520300000001acccde89ef807921778c7806aed94a0284f96b1cc4c82a8ed2ec63b1cbfdde1433cb743def01000000075153ac6a6a6a53ffffffff7cd4fe8ec717a3a26b1741d5ecc38dbf45b0bf0fcbe1a26cbbd28b373ac7b87200000000026563ffffffff03a6cfc50300000000015325244404000000000553ac536a0012d8e90100000000036a636ac76ed9a900", "6a516365536a", 1, -808952067, 4179206552, "efb7cbf31076fc9144e0450f147ea6c3b42f9cc5c238db73dd6f72166c140f3b"],
+	["030000807082c4030446aee4fe1309756fd8b7a5e47cc585636472edd1ba8a0c9abd0781a8ebffeb440200000009006551630053515253ffffffff89d45c9d339d2b11d3c6477e0a24dd6404d73716e4bc26c5389afcbc352068380100000000ffffffffd55be9a85f4223b7125ebb5c61eedc70322c5a267ca3150e64637f7d72b209ae03000000056a63650052c7511b03b6f8a7a7658c87de77dbebc6f7680ecf18c752754454ecfa23d2ea51858ebc650200000003005151ffffffff0155a05b0100000000086351635263656353a767353b17e9d81500", "0063ac525165", 3, -440866163, 733220448, "89d783d8cc23943cb0532df282f0edc14fa4dc16c186eee766dda8c2526fbf4c"],
+	["a78bc07f035b723995ba4df0b406977d0d505e04d42abc16548cf2cc52b0bb690bf3c0fcec020000000451655163692c3f2c6ade5bb3d422a85ecb96f319a108457b0d67cfd6453bd6215ae931783c3e29a301000000015196e117ff43a239bca5b1bdcf04952cc4e3c91326cfddd9b71afbcc227663aa6bb3c75b3a0200000005acac636300ffffffff019a03d40100000000035351ac2b41496a00", "63", 0, -1619260694, 1537743641, "7598193ec58f681f148becbe6fde07bb9284a1ae935181c00bec66a789192231"],
+	["030000807082c403011aacca321ca1d32d15cf2e9c3cc9e63dfa480ca9a59f391d2fb67408c82748770000000005ac006a526a7a02266a045a49fb030000000005ac535265510379d201000000000953ac53ac655200526a969f580000000000056351526a6acaa56f05000000000365536a5f2a77830000000000", "51525365535151", 0, -1635485362, 4122551051, "5feaee88f43915d94c8bd687750e81a11343b57b7fcf9097817b1d6850d9c150"],
+	["0400008085202f8901f2b4f37f952acb69820914559541edbcf07c9b955f8efa1b020ba2d8655ff6a80300000007650063636a5253279443820146cdd005000000000453ac65510000000056f77b0af2400c010000000004a40e942319b4d385d9458423d33ff3f494b50a04951d095c0b8fccdc3f88f5b2903f330ebabb4ec0c411d292e623ea19e1debae68758475a28a344fd2e28a53bd7acd06d7236693a1063fedc395e5db4ac743a2f76347aab7e5fd633fbf8da6a5d10a315eecf12ec6c5183d46730d7f15bfbca9cb086ca84a643af2bbc14090e5e53948bd01ce8cf3c9cebeb744cd174092343f6e81a7d1e0fdb7fb1e98ec357fde52bbbdb116a543908f2e353dbbe912e3098bcc3ea570dc83b72b0fff48defa3ed6419e58f6637540000b9988098d9d8bb9ef82bedf1fce6005efec950534bd34a3c2bafca681866e7ebaec205b6ea541187b7021baf696e01cad6b671903bcc2460da32f94673e83f044931f7df7092b8bb33c6e8ba7cff35fdb10c74bad44f498c5428145ee16eeac7ab91b14125b2e73abce35e0d6f71041c0eeb34e859800f85181d4b694f8c64ff2161182f0800000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000082c5229550b610aa740ade60f38321bcb4853e9f42f2330e1d4da4ce09ebaa00255d60ebbbf789813eabe18c18da872e363788a6361e4b8ba2d80346701b773249d949b4b23115ae310c4906b124cb92510587f7f105180998bf0290e1fabeec2a1344998f3e6b3f0631b2745f1160c8ad118dd53253c070df88516dc9d9df5e4174609ce0de24a63e140047dc16ae1b7b3e3c74b570c5eeef2ab1510e102a4d62319f9bd163d861ed4a00cdfff23b81531d2e793c97dbd160b8e73bdf743962bdf64316aca539672f293f2ac20e15a516ddff915c6f8d95bf39a8cc1a9353fac8587849e52e4f4e66c22e21b41cef9150f209346094f97e7e05916a0f5ab8fbbda0ed9d05e63dbbfe5aa1e2094b88008515680a43fcb7c243842479918444ff4b1da5322c48c71239d4c0f63e51054a417e7a3834b4cdc2f538989a5a7eb609800f85181d4b694f8c64ff2161182f08000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000f89ab8e4a2c7655ae94b0fd61f48bc22d746176803584ef64adfe460c2ea472988b517989fb984b08392322d8c4785551bd199b44374e5039667b171c1277e01a1117e8c401e8632b9d65dda6f12975d5552ad506452af2562f6aa6dc4076921a422fafa1345d041cfaefc4f1c300c9806e10a89b6440a0124b4a3ce487922d51d0014085da9442e9c397124e5f05d0f89595dc950b4558de528e155cea2fff69762c456d292f3fc84c4b47dd75b03e1f2c53be44af5abade72909f58bafdf34b5cbbc715c55d919f1deb424c213bacbbcdd2f6a351dd9a41a81ae8e5164ab3424b9175110972b0c6c03941dc84d74447be432b042c9333f122f33e4385589275eb32d03721b79734077f05e37d0cad5fd2922471dfa12ce50a34a12c6f4ed8b8ebdf226e936653353d2a3a802c77c85b1da4dba73ff80a4d5a17dd7278cd6bd800f85181d4b694f8c64ff2161182f080000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003b84658da670f12b6d96494f2bdd851a9dadb5820b06480503217fb0e34b013b2e7815631e76a01591895289bd64d18a7a9dbe1b39dbea22dbff709db5f6356e98131132e57690b6579824a75783a6509f3e16c17a81e0babae881e0b649eeabdd61afa8636a07dec90d24bf3f98595b4e58d74e499c2abed74bea561126eb64617cb44ed850a724304c6045778f54b11a98a7153851002f021f4516144fc3d45fbf416777cc04e94eca703475c24f121da23ac0ddbf283a1cad9e57313698b1d1d40bbdfb23c7b6f49b1be70496c9ec715ae8610421e213c9e3705314063251eb2d80e3d609d96231a4d8c8888a3c9b938f3552691e8719a0d46547dfb9a7705c58ddf099d731e526155bf27e7a151d747dcb44dec496ffe78a00d4eef5c0b5dffa22fa2ffb5629e9395d7a88b60f3d8c6ce61c3cd45e49395b4f0a84dc7c60800f85181d4b694f8c64ff2161182f08000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000046d363ff60640a7c08ec3c3acfe1950e160baee330e4ed7cd34524c3a04d5bab89e9063df5ebb77a1b480af116b977b308e5f07bb37f1a6a1217a35ae5ab84f4d9c1bec3b5a76a879a8a2a40188299b5bcd906788ea79d353a5276c45a891cc59d94d7818d480bf982551d809d27bb892b1b8ab2c3dc21029e24a26f0c4723f7ab8af8448e311748d2f970f2cdb76f8399ab87269eb2d325bc763df679a43c5e1fab2f9b48c90f1133a3ca333e8724972e3e3e01c8b86dfed62aa7e844bd8287042db116aed601eea026f4cbb35f95a2b50d9427a789b35f4ec4422355d8527c01e04dddc695d5e744c7ba07d018ff707eff6cfac42b9b008f6b73a6eb92d969b6787cb062381b8b668cd3fb8bcc14aafe98d37c4d3e2cbb2902a84b50f28f7d1185271f4d3f6579cf1f7aa9bd1b02c9e6fa540ce8c4f6bc6c697985897e12ce2404abfbffe73484ec836c876a8c2c1595c954c1a65b61e144c50a00047b29ef3c5787b8ef2077f6e3b8649ab671983dbfcb8b9cf089e306fd5a7d9729b2107014c83a862f47637ed1c90f9f723a5e2cb6142d04e9bd107906d0374e4291618baa821477ddb946e892cf3292979f7968ecf2152cf9629350420292870dd3be10c50907e5193b2d06d6810d47eae5398d19eeddc2a3c0bd6f7892f32d97c523cf59518c93d18ad0e6ba38e05d9af7ac911f0382f6a65d2ec641f5a91e6bcc53aef4ffb4e010b25bc2942d5184d3ef7a8c3e38012877c0a4db54bb8576f961722c82f4a325bd2f560ad81ba780c85cd394e8b022addb3d26c23c6172931e8117725fa7d5b9d2816d63d11f1746bf380bebf177ec54056b28f4109683c6899c748067d3570ee33d1fd2a4ce58481e415e40782a6fabeea59f5e804963c5db005fd4cf9ad19818a29ece686e82952b2252e322bc4faedfd1d5159872b7a58d7b7b16fac9d8bfa83967a122f207953d22a7d913dd1fd6f3045b0aae2d1318dd30ee1e1a235faaafc40b2e3736fa03e55fc30c346befa1bc99e1c1786e4278786c65976425ba72c063609a26514346ce1a116dae4325b92b125da8fb794141f23fc590306a56cb7761a7af0a86135b81af47a4f78c7102798167a734db09fc5e6e4ce93026425b44c829cb2f0223041146f61a78d21979220f8d0ec380220130b5f7bd766aec3513c0196f457f1980aad1c424ca1feac6a84867353ad2e131e97f25c715b1cd4fc97bad4bac624daf3fd95aeb3566c3417af1cbcd8a6f685e9e36f654a085c18314d9dc90e188790e624eedf522ad89c3b47249041dac2b7ca8ee945bdfedb8e3e818f0001083c95637435c1c84bce2d121b315e13edcd35422c284d6c49f2182e927539331e78e382746b1e7a529427c477336db6c4b9a00fc1fe285187e6738889911be24d68c286b3da347f41067e42425458964d3a38dd237db2474f4002d0be0cf617045301da1c5674bd5f5c35b82712e72e8b462ec4569a3a8f7d6f22e1bc111f8ff18e2a50f8675680e22b51250ea5b620f4b8eff4a1428c65d21060348d88785d79b660eb51d4fddac13f3d97816ae887ee286d7d7e38bb3040d03a1ec210cc7aa18050f8a8a609c0d9262438b67fa233c2a897050b44316d8e3e72f7d4d0e6916ca9baea1eb215a7738d02d38073f789b64af87de1ead12eeec511587ebe5c5371bc2f6cc6db593cf2e61c947842fb48d4709328ff47d04c8a2634875c095b07cd23ff98dc12cff91c8e137c649f54117958c9b2e40aab0671841587d38562fa1f4109e5fb123c2cb8f68ebccea4a12fdd0720ed2d606dce03f4b30e8f384ce3d15986f912fe32acc0b937855d46a38929f36c15163716acaede399af61a8e58ee5f47edd6d43b3b7f9cead610efe696b5834b232c59bfafa89aa579c2a37620a0ccc1750d8e581b3d8113e863eb5927496a134ca85e33e055f041f75b3ec69a80c3b79ab29c3b15ac2d9556e5a9a6ea2c64325f8b1ed91ea1d904c7f52a5c1a84cea32737412d0736937b9a0164494e337aaec8e358acf0e7aa7cb9fc8743a8ca368e0beb55d5f8f7bb5bdca41111b83beb38af93131c48c16ebbd67ccc08c26196030170e5285db16e3778f35e52f620efb4c0cab2e5589e88f59a6c2aff01be693a458a0dfa9bb3ed3fe5f6514f54327f017f3d65a63237c5699d52f329ec9fa931f97842c0be2c4f25cec514dca36a76ace59bea3142c45ea84b4f9522368d61f467c7d1ef07fdcb6ed64feea10a33fb6a3f48e26f123e31e3a0aa2f4b596f2b02f32dab4257115af9780184dc0c452c0dc993c6f175095bbaf3a9a2ff3010153ecbb09f053b588d37ebcb8ac8e6e9a1791950792a443ca435bab2503926dd4b51b2b3f9e82460225d3a64e6d00675d0f5966e138b9068ca0bbffa180f5559bc862cbab919206f92728b6e44dd9f9b75710c2fc21da12379d31742fd1b7e1e27d0d47c2925c942b5757741669c8bda6eb0156d7e35e2ee408d2b1b8f780b3d771871224372b461774708577c4648783510d0c00d25bbc044584d340a40eea8347ae30d729a86cd66fd9858822813639938c4b487a829ad3e6f761e587b468c2dfa38de65a03e437179b00eb540e7ffcd816294a58b09827c5e446233d7ee4103fd200f5b33407e0948497908b02c8dad2651cf16857d14de67aa6d78f5ce3be8ec6b2e6e9f7c148a4ff2ef04e4c218d87743ee6d4e444ce67521191e7947eaaab1e43325f6b1784d09c9c2f848cdf1eebe8febf6d1bc0e2832ac446f6f3e6243044f4fc0dcab03b4bc423ee67b7d5feebaeac586ba7aeba00f244369632008101d1fb7460cef62deb4a501ae531c5be85aea01f8b61c8cb0207c0a3babe20cec508cb942469511628e68d2a84aa95328e361cd573a78bd070a3217f7d426e0a489af9929cd198a349346bfd200059832d06115ce998ec7ddad6ec86c38c2cb034bc3326670bc9ae261b64225df9f6096a750e1c0ce4c7defa71a106fb716c5c3dba3ba61053b14868e9481dc277d1d479af59a061765eb7f1c4a1bcfddffc2668afddf67babec776c53d35c3f0439c2254a99fbfc46bf996a3c7676f7bc51ebbe9014a160e04d31433753f214dd4d38c15dcb1e88d6f663673ebb1eccbda169784fcc580fdaf561a61203d8fdf6743b84323f7dfd1f3e600456464d3c5ab3b66d2a576513970b4b8aa55c0dec904c7332509666fb0556fe99c2d04388f2e46a906e154a64f244724643a1a0d05d8661895fd296202aed914447d5f349f806ca0e367cab44c47195129017ff418eae3e396a872219fd0bd93dc1b856f71441bf063a3e0e3ab0b7273db9a5d211aa59ee55b08a697e6dc964fba1fdf544e129e91652a8d87fa85a37a0e9d48892b7f55b494859d11bbf3ccba4a979f7dc009c291e57e885bdf88b90e8f6f31dccb26c17122e7273db92c47b5f176f8cce4981153252dd2d10dd83251e8eae887256355544637007e3e2ac0928c9e5129477c064544fb8a65bb13f17138b43d3afb56728740533b475f263a967577388cf8e533e21db69aeae2636743c7f60ed72706c9ad346d72341ddf35322c983f184c9153ea9d1675dce9605939740ab17a005dede0268fe4cccb0445b27a221a5d6ebbad52071bd0cd3fe4765f3810b370345cb79bcb2c2254e3f5ae25a5316692fbe58901f0a049758e27542ba0aafe6e3fddf72601c2885c0e0df511a1c49eeb41c98c57a852f2f03cdf089bd082b9d04d07bf2d969bed2c02659f0bce1adc8a1d8801be5b204c7969d906cfd6753c9a3d017f71383bc3e883caf0c9351a444c4d1fb9b03b955035eb75cf967804c63782431fccf392fd17ea5e6534a9fe45fe7f553792b6ce33c20989d2af40adfd5ca66b4055272293cd8f9f1d55643f56896644b3eb9b31805fca3f6acc2bb2bd7bdb79d5bbd6623c7493db9b604688927b44b6162dea6a42756a9df69ebe24f5d147e43f7e58920075a00056bd7dcec15fc8e75dd9312da8a6a8a637921c61c47511045a7e546747ead9386e5413df140f5ced97cdd05f2a560c5502dd5e66d24d3dceab9a7fe2c4a08b4f3a82a3214e6f06e6a0051a2b2e55211ef896219e6368b44ddb28d772b1fb62cefd20930e16cc1d8cf640cc973ee26c043366eeb163aeee38d31b411415e0184a715e150adb25e6e5aca8f8ec7c7c381288b1ace299eae7bdd472249380f4892ea1bdbe6bfa124ccd18a3fcd9e423229b00a32c6076b95091ba499347d4b8967ee7340c8f346478acbdc4fae8947f8ac115cfef193496bc261bcf57ec88bb5fa3a19a989711a942c9d9b9191f53f2e38a121af401b0e389569767521ee787d77d68253420098b5b177d59679673c9467b6dab389d23986493f849671c92123c0390dee00e3a02891d66346e91ecd9d60b5e8121c442ab6c7f76081671266b29bfa905bc9abacd1f11d751bed2ecb32c1869432b90a39a95639877b007611d6243e26910a4a7e58bf7966028cde5f8642b21864d386afc9ac9ad2c8ea87d247556265c5cca8fac60894ba2063e7e6905fd72c236d181f541fcc9209866f808c49d4a3803182abd0ae1dd5512495c7696524fe9ff377e2faa8145b04ef4b4e527d90d75f84eaa043a5b5e3fd6b7af4f2cd0b4bec8e84630418a5ce4fd6176cffbf73c4f009e5e0bb43571e47ceaadc0f6e16c12bb5c67cb46833d79e22409b8049cb0a8a5048c14d0e8cc5232bac3deb8e9b5dda97ef49d86fabeab53a76fd370ab71e85b2d30de43af8450d966a0dbae3d7778122008ccca3d69938808366101578dbeb3c495c3dddd5275bd134d2078fc45e23f0e78ba86dd0e641a753ba376bccf29573649b7dbafa905cdcea310c627284aca68430de0769cefbc7cf4748d5ff604b2c2bde15170229117ef49be15b19b696abbbb06f609558c06fe16753250f1b547b3c279437528f35fd5ebc7a08fb9d4e55c33adc9116042a1c590d9b828925eb1119bfa72ea2741c507cc115247008a0736d6fc76a1f11c7096729bbbb77f0a6b837dee848d6ecac3b4ac04e4bb5febad1bc7b42d43f73854a5498625883628a18acecaf35badc984578fb6daa1bba8ded307e583f8d7fd02e5eca9b75ff97bfb050c9f786b5b4eeda42d2a6b99b9d1863f9e27b37c58d0bde3f5023a23a545731cbc60262b39e473ad6c659343e0f4e7afdce92e4e312abee38c37aeeb8da89522cab6f65e3b8442670455c4541ae09611d6a6c53acc4a161073095aa536a403d17e5ca02fc06586e8cfa9a12b8af4dcf3e9e649d6050b8b3ae6f86614f54e5623b70e572563c21bd5e12ddf182252e0c6d8609d8321032e92f7f67a5897d6f100f6a42f96e656e7fb1859d28a0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "00", 0, -933246669, 1537743641, "83b8e23cdea01d758cef888a0911cb98fe6fffb16721c4867b5a960d04d97c72"],
+	["0400008085202f89038480b92d863f8dd2acdaf62cd8a034f72a91477b2d982b3b55692bd6de800e4401000000056a0051006affffffffa4a6ea0c1f25278fb434bdcb350e9a8b7e881a6a7007c270de9c0d075ce7547a03000000036a0051fb3a04f87e644b17ea2fcd862e47ac64539c1c86654df06a26fd4f00e0d83a1bf402a3970100000007005152525152528716dc200381fb71020000000004ac0000527bfd0c0500000000055153acac00ea74cb030000000006515263515363756fff502738bc1a9d3a3d0400000000034f4990a0df50fafd0cda8679938975d3da578a91f3e3aa9b18971440b000325bd6b3f6ecd31336ca2b7680fee0d13dfa7945648b95c2de0bc0e8abedc05492563cac76e54a951ea17cac35a5b801c9340354a238dfcc1a9b36fddd72fe96f190531339515fc2ce9dd60da15e55e086dc6a894530fbd6406d9b2620424389b3d2671577349480cfa1246646b3ff22c05d30bcf6bb95a21f29f855d045d056e3e95a898cf92fad25352e15353644d678d71c8da3fb4d369fb40f7ef8104b7fd4b62c3c869776275f447f700df5bbaeda6c0bc71b8b71b2b9f238b8b2552c60ef7c2c1c286ddc0bd6517eab9b87ede766782fe3a607f28462dab339644cac7ef19616c1d777b8064c2b3b0ffbba6f33a0ce2ac2d83dd6947ce0ebc1f0b26b8c7d8a42225a4251e5f62286e146d14c4380b769fdef370e7c21791822d3061b56e76579af5157e80fe4953d9fbf6916d2a205000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d68eadc97fedbdc7844dc62b298cb2ef85c3baf66bbafba9a01dfbe3a95c1238a5f4115a8d67de89d99edd01652b371c90196080b0d9a86bf98879dae5e65f5ae2a914e5735f9658600eb4f61eb15ed8b5a32c9adfa5c568867c527187c7ee4011922b7009a026774979ad665d12b41dba3e38dbfe51dbe17f1d558fba55e037e563b85a9a850daec321708757a8839af227a35153f74548f72ff8c11cc1d61d4bf3a1c6a4a7bfc05710dc6475f71f5c896cd564ee29b94423398888de92d22868cc90f7a69916bcc5cb7e1d505e3072f30dcc03327237a0ced408f27caa760087d27b379108b150ad43c94517380155c44b5d8cb8c49f9e4469534654f889a0af85147c1c6c0f55f911a125c0673ef7bb4c736701eab0af1626a800fc912120a654d911807b2f5bf8c78516c817743c7466291c7fe277394106213f95cc4ea479af5157e80fe4953d9fbf6916d2a20500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000088ff40b85ad6723b0c13e4c3dc9d0fc60896864e159c327b6f691599f739e8b16fc2cac7c5309bd9a72213626d2b9c8bea74fc3d65ffdf10106cec7ebe61c0354fa81901b8915941b29d815c4dbce6ade1baf2d861932adc9643e7311c9ce46458ffc82a2b89778133c1d8dc402b89fef132afc850c674d150472e6818fa3a214f6475c0ad5c2613be335859fa3a344cdca2ecd5399205819c4ddd59c0f37180fe6227884bfd955dc6857bc9ace57817b895eb9ffd4f6021c019d85f47eabe3c0f8d40757c83a31d94b4e1e5108e0449ea83c54459d356947135b20354a610c27430ba49d718b8e545257e05ad553ed30b25d7967763a560dd556e0bb14096f01b396a52cf419eeccd7b6601d7ddf004c0b8ae6f4705001a34cb91d29d53f271bc0980f5e493c33ae56782d82465eb505520f389a2e1ccd7ef7bc76c2707ceca79af5157e80fe4953d9fbf6916d2a2050000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000433fb84472f5766fcd95bc8532eecf008e58c07e95e166df5a11ab53ffee6e5cc9a094f408ca4acfead3838257d09f9dfce7db1a009995392a33885a3d99c3812a58d38dca0119e60487453f7bb414736efdaf6e3f7e75f03e438e2bac39b970a3a933e4e7891a313f3fea589142f442d04428496bf8747f3f78f07f8f5dee4e6e1abadbe69cdb47e48ad62e5b29b0d93d10b1af6d3cc5fb075d918467993126655f3e9bfe4ca2a27722ee8094ee20ec57fc08bde632a93f2e9bba9244ad71929e5a86a07d8bb1b4a4ea14248bccecff4d5d0823ae368a64748879927525c722b1611f5e0d96f5c99173eda31c4a654d3dbb61e676fddacb8e9cb139ce2547cc615f7a4eae5f7ea69744b519f6f258618802817777bf47931e97396f30c66a544083c5aaf14e745eab637e3636da7914148b33600909783e76d8edd41f7264bd4dab43305444f5ec527ecc9ad872cbeac81cb2c3e8b6e208ccf28c31c87fe970d0c6ce365a6a257a9a395bef0e4c483cea494db941e67a9e24bf15d69a0c53fe7fc0c681c8125bd65d3aeb9d08ee99fd3a196616dcc60ef9819ed35a31fd6e07c063f69fe9d70fca9cbf104f5bf25e85f149cbf7b87d8602dbb91981bbac8f472e9c5c58e0cd0302be7993cb352fec3c47f62f5294dbb8bd1b4a25da3d4eec7a8e3c44ab718ea79d1ede91ab3a11bf8f6ad8b55d8eba09f5f8298a1bff7acc8e2ea0ea7a55ec0b35910643a5d9841e96433915fa4e30ab7bc815c873fd1ac0bb7a0986ebf12e3d6c2cd8719d342d1600425a12303cb1e81315d9e7ec322a3d62081862b912062034b4e6e0cc9d956b9e1f99eb51748245d222f951308dbbf5fe7b3baa910e556b6587dac69a1c1a09ab7903de5c690bf86b4751f221d243928efbda481b1bcd9b4a083f988b2c299393270ba8fd5e7d0925f457bdc2ce8327cf9e5f2aece48184c046509b1bcd0ae2a6d34a4ecd70586bd265f75193c3ce473258b3f8f7de3c9c8b9251d0cdf9e786719f4350a1c0ead21d95f6eda8787035a5f62b0bfc3a850465f6b149a7e9d02d63f3107c18ff067cfd21ef8557bbbffffb6dd5c1279b8ad578a00688c72a42427d07c63a91c9d90a02789d406b19399cdd13ea1865a8df4c3840b28b696ac62eea0bf938ed0bb90bbed45683430cff685b26df2d7f145727f84ebca0085aa97c8174cd2106e3a7b805d548c5b3bd249039e4c9bcff25bb36f3fc5dcf8adb0a0d9653964251d448bf3cb0698d268f54ac9ea54317c3d076af8287974621991c8b1f51ae40ed6909e8ca38a679c9a201b5d9f54c6c2827d2941de76cee94c8f4486b37d0c70bf5616edb64906f6bc3bb6a0214a3a7c30c80598a39221513dcd0505a89536b70183c1351d564b0df5e6a630db2cdef03c9963853854a0ef48926726a1f82f2f2f94429ad29b659bc832bb255f9d1a1f368c57c90c34c31e05a2569bed37cf5a25cf54f93f631dfd273eb8b57ba3a3c1003ecad10d32718bf39f82ab19943e6cc32b2ca57534524d3adbaf086aad0d6cfb9c32c488e7fc75084dc63ccd824cff74d79a2a6fc8c88b735c37f43fedc6f6823c7d8b9bcdeb1e5b26d425e002c0c2430d4b3780af768c9a01f9f22cadd0b36c89cec81802b2482921ac2df9cb178c9bffd92cd8900bacada0cd0692b21f0ea19c6f84888454d637136f84e20cd6f6cdd4b7a86b7a4d22d5d4f145e7a2e932b8b32f253be95d971d1ab9868c592386100d8e7fa077b75a757af699913e2d8854f445341c6c2a0e6f79b19c27cb90cb5d75bb07886286ab8fdd3eaa72ca4647d75f717641fe72b287841357388380f42de86becca17cd8f5e2bf2a769e3ad645d4d8d0b3a0ace55d0b33451ab6976a2b9791aa9663aea99df4db20a5baba3f5fcc3325eb2ebf692d60d6f5b886e0a54a2defd9b74a2bac0151b89dac86d02db5fdc8250726ecdf5d81609da9e7c385be77a2e1ed5737a92835974a2376c3df2622c78357da0beaebcb3a5cb1a31aacccb88563d281bea09f57a312e9bece572c497476a3033aa6bc35b08b9deca59051a8eefffed3e01760690bce1791da3813fc393f09fb35367ba28e5c9414d0fcd3bd43858bb880d967e59bc65c1756a89ddd5f161e3e76f1c0d33200afd11c39b7181ddc2b499ca1b7eca1190c3af113b1ce4c9acd3874d398ff7493c2f8bdd74f4f5d84d457f677d59f4dd4302a38bab3d6bc1d60b28127813e5a0c98e7f39ba1862da147330cb51cb849f0f3230a5dbe56e9389399e8157c241bc388df93585d9e8e4cb9fb017894a9942831ebdce983e1f7ead1bb7a0826e06a67a36f9c10ef1e10131d9877f6f2c0c42f29e1795c8c9055e78e4de4cb4d150d6240a95b586a070cf0156b297f7d159cb165c0a4d52d837b806ea3620aafffb6e3f950b0e864706cb3811ad157f6647778ed8cdc82c0a58582e5b1c366be55d25a44a2fea4f0e47d009582568f77e16d09c2d7093164c226e4744916c4583cc8c9b8d67f72679514d9c190fc2f9cddf8ff1c8bff0e747fb3710029e86c3b03210ef34c5d7eedcec62bafabb2f70168ad7a43f5e6f7c606922057bc8c2a169ee4499474f3ca692f7b5fa5777b7bb5868b16beece62217f4e111952b10c5f9c5a4cf4e2e5ff9ff95236800e809129696fede33b444a7ff8631c2368782ef37d23f456e704cac98e05977c3a23209cc21d005ae1c30120a80d43dcc06854276ba1f27db475b87584df2df875325092d8fd749d27254d4d4bc09a1b2cb2fe425d3dfa34b5306b6f9fb1cd5a66a8b83888845f1f1732583da2b6ca42216abbf530374556172a6f12872cd19f386892df006f9825a81bf72a24ce1aaf83edd8ac45cd85edbb76280b6f03a0e41d07abeb2cfbf0cdf50a478de539720986777d1e42d99feab47999eba7029c70563f39af31774a0fb75bbd32bebfb34299de9877a62cdf7330a2ba5c2a34e12f8ecafaa35b64140eb623e8608986a82c6ae01fbb109d416fa893becb47e4518d02915d95be02d683e7fbad81123e907cae1297e5b3d3bb5b7caa8448106fe03f2bad8ad08f9bee13931f1bd2df2db84ef3e01da3f5c235b7e825df421933ac903f8a51bf2359ade837283431c272f54d94946de574f79f87878af46b026ae6c01fe9dc61c78a9e166ffe1262ddff52490c403a946e9590ba9e7b857a23c892e31b585a3d0cbc11db2339fcc6a6bc9f7ca3bef526a03466e1bd111e14a839a217b29be64aea7a5ada3fd63b40a081f13dc1154414968762080bb2341e2b80c5fd09d0e4d501f974581e74fd441fa756de41a6d7f2417e8347cfa8ac856ee83319413a82d60b82bb600961ef083bcf954979b7e1e3f5aae03eaa475eebe3b591dc1384ee610c557fbca017982b6c2ebd944169ec1577d6b8fee3ab8174621e5caaafcac5a001491f7acaaf4d5d21a9a26bcd0afbb23e067f4c566296646ff95d4f3cdde8d8d5351038fa82527dc9351a94f83c91099aa12f4c3b49e59bbbc2526647d69e59b5e26d88a1e5d3becb73a97bfc4a56e19c44afc732b5ed2a5caccfeb7953cf89d964baba671ca6d20bd264dcde4e03f0afaf9e8d2f12184a3382bfb6c38f7a668d2663a457dfbf67a6b06774a73b028133b42ba59553fd17b29d4301ddf8afc8d00fc962a03c41c51007eb630d6d7ecb7e6f9666534ebe8bda79fe6fb2872a3b17d2b7ef17069b4bb666b3dcc62c4f3f234a01c42b73e548557419d5fcff3016170bc5404bdba72ad4d5fa95313a6cbf20bbbacf7b8c135e1aa65a89535d1ff31d022d5794775ae32e171e441decc3559cffbf7fc3135b8eca4173ff8913e4cbef973ce0d990d3224e578435db6abbdd2374ec35481106231e5ba8ac613530daf9a9ce48fafda746cbd945bd63754e95bbae29196de553ec8804858f45738b32471280b103463964fc3c70a4b7526b0d4c95f88514ba99c662ad517345e87896707ac4ff05ef8c71c9da569a5044830eca0918171fe52a236ea6e35eb79630664e27bbba7746c6e9081963bd4ddfe7281a813e3ba66e02d4e6eb8023e53dbc15e910f741076e75603b74731e2ee02627c30ca3ee5b937571faf74485d1c8987f0aa11d202081c46109f4e52f328ba5e332033d23f656d09d6613bb193df623ef67ce1c62e544111f59f60e2e4a14706c5279975393f4a51f745f6bd1c7ffa80ed14ab2cc3f6aa2f0f9c17f1457ebe42b62ecd28cc605e7b86affde1edf8a741b6d95f9b5f6ec8cb7035fd8ab3145319ef70ad54bbf381617d2e339a5752a22bae0409c198f1c3b243d1078a74f557dfc14b55b2f2e89cdf66dc7a8be55ce2e2d958bb92a0c475bf0f98039944fc3cb4f782d6eb60a5c649cb41e0970e2215ac341be025d04682a7081e06850e099318b547c483fa5460a60ab0bca23e5d5e1d6d8f723e7a02be05fea5ecf76cd6acd870ea259edb14e9acdd847725ab7195f0e50c21a8c82846ffcaceb6da9b49f56b3f7678537dc0b0bcd489938bd3e4cfe05775c9c6be2c3c8bbb59693230f4ad5c9b86fefd00df0e710db6d3ff6647b29a31e1f7ec775c1424587f262d79e287c76eab57e2d68e38aa39e3992e05816bfd02fbacd129dc7db78fc72117c16eb6fab18f90214959c500164edb7b9d47cf3aec5964a08ceecccc58e47c5057f3fd6357cd3809f87d07ce25ea41b56de429dfbd39779585b5884f5c710efb446483755ca5c4704ffa19a4e53f266be4f2fd2f6e1a167761dfcf20a1778c415c204147989efdf42cfafc8749bad37848ecc3c959c3007cafcb6245b195c3a82b93c4a9347684288f4f83f2b2c9a576cce6f75064db735e1dd910422e0ec36898f05da3aca509a35631e54ec2275a1f7478341a083ae97ac015c88d3b82a38eeb85987bcc65c4c6e3f78993631f59e35d571647b495f6475d8050b4fa958ecd451639c2df0bbaa76af80ebbd351d9a44897c143a6c49f7b5bfb6b00a81c703fbc7221cfee34d00c7ab322e19d919aa730b5a2fd07a2801cb6366aac1d2bbbd2156b1ec5964a2998cb70a5cc927c91263a129aecce7ba0f1d874f0e6a6f9374effc7b060c9314d6ece1b57a5943e162c25be8492ea8c28ac2f82217dff4c6ee59696534942baa6f32c510ac7aaa572bd255547cf7dc0cc13a872294f703a8a9604262f5f73714fd5994ec29f60311657038ffc5cbfdf8faf2ff79ce6f322643aed704dbae8df232d22c80367dc863ed76a8ad40e85dd56760f9abc825343f693667b5d3c70801e273be3eae9a5a8badb2a3d4c4d96cfab9bb4e18eb61299b0c35e0a3b2600ab9a7d553a808de84ddd4fff6d44d657e2acd6234cb87f6301934f58d19859e636c340b6603cbd0cf05000000000000000000000000aad2b1832a775dd0db895a1090f188fac9de788e97dc4d96d753a8077d6b7b50cb1ff2f55be18a031b8055409ddf0b8a10379770a60f5e135f7ef806c2973a95359e76cfae45fe376a7085798a5b31ccba9046c8c67f09d2e3aff3765d344e3c0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000051ffadd33dcc31e8dd7fd7af6eabdfa98f6863ba580d39980fe2b59eb78ab450293577823f4cdd6b26f0a10e8b1118926be6474d372a4b68b5828a7770c377d995c1d30b43e3b97acf1848738779a6b3393833034a3069ed52ef66b26e6d0cd3b1521e8aec419aff049dc27ff6bf50542f9b013089d55e5e204a7965c357c505766500d95d0b9266eb58d82d3401165c466adfb556f27a3ac593d7589e94d6068b75fe4488c4daa9e301f6b320ab3a5b13e5224a1ea77de110a259af1f3107bedfab3dedc69d1cb637d1c97cafef6d06f544c7f01f6a2374825a97890d06a15c8f174e6b45a86119d9ce4ad95f39eb1d23d13368d91fb33ad6452e9e0b1863ba1d3f1d173fb0325f4eca87b04fae0914329333e4e8d3d522aa3f557c0d921e6bfb61a79a0e102e04a39cb193bfae35bd93be829df541bb2ee19a403b52c128a339324ae7b9732b6081a560981d39ce57d3c45d02c996839e9a93307382cd7f22b9fe40db716b34314e12f9548a65bd11fa2d6ea6b7dcf61da38091fc0ef8bd89d90436d23ee310281d90ada3e0ca2429428c443ce2af61382cb5738af60612e8aa7891b4c0e977c4700f34fdeab200e37d543e2c06ea50e0d55283e29a52b0fa29ca681d326692583d2a73ca74258e28e27b64736bc4c437b1e8297116122c04aba37c81e7a902682d23b2601759d0c606202caff50eaf0fd0c9f978752ab0821660e9e53722fc237e6b6d7cb956a19c7f89dae126a8a8efdf2c6249308b0306fa40793132473b857d50fccf63383f17a9da7f4079aacb311da1c54783d032bf5caa5be3768df659ef40c8946691c48cba09616147c457c77ae1d37a66fb047986f09877638cd2733588d7b3c94fa0b1a3982688310d3eade8e7f02ad96a051eefe6b1542cc1d3265dd0769bd77519eb3c6925873c6c681870aa0acd3320449f724e16baf62c38e50836cf542e701af6b05bc281eba5995e6463645e0f4ea7df4886d5d5c0a0f00af938c04adc76b2a3a58caba1d2df1f3e620cc8087380e854febe8cf96c9156a84217500b01533035236f705f451c0cf68246c21f0e6e8d725c39271c85c1e44ac074c57963752247e57e2528aabbb04556bdfbb9bc9eb3fdf551d88966ae2b904a67aafe370af575b0c42ae84d2b35d3d8c19d0facdcb544f9873add81783c029c31e2aa7e7e4a71a2a1a81008b263febbcb7900fe3aebf8d9f948e8da5103824fe1164b655dc0e0b1dec10c89a3111bb370d93b96b43092f6bac91f685a025b22a03dc3fb11d9acb20267ecbaf8eff3c566bf40651803e199c3af6544dad3e7602e88588f560569a01c13b3b625c26c845f35a293251a38d69fc5f4deb6196f626532cfdb2732d494f19b079876671a2ee6b934de8c66fc9fc29b8727a27fda1e5fc322ed670ddab8a558aa67260ecc71574dfdd1aa57fb5c986ccd1b6c98f8115e8e81d01275ccd9bd0bf7d29d8d0c8b4fbf0fabe6b6453a4c1899178a4f8b93e0ba31c7d9b34db41632775a89f8f708d565910b43c8c4ad5561336bdf025579e29573775366288f31580e594b03652a51358a7b07997e6eec960742b155f271cb14299831423992283281811e1fe952537f792c7766c4f243d4ff90057f55c6de3eac722b9ba97151db190e266aed8d407317ef680a2de46b4e96a50e5842d7b9bb018fa2aa50c819e8f2e9d5beb461ef4526d50bcc0d47295fa6c825000c04172b6fed46bfd909016464e27989549dd3dcf304290ab58e1788434e83d48e936f534a7786554a5b511525c165563ca6e4a8bc8ed98bb2f5b51546b9ee54705b04b15699715a7a69394831a10fcc973e60f2858f306312e037dd2b8e0bdf6b8b2189e56067aaba3a225d655925aa0fbce2d8fccf591482e7d1da4ccc266196e29801b18f054cef403a73de103fc148b5aaa07612e1e008669ac1833844682d6a0938f52a643942fa788fbd18dbb207bab44a2581c29af3acc389a8fe11971295d5ba6519e17ee26ee7f6d954eea1858776dac1e834984d89972dbfa396daeadb52dc2eb035c90ca967578fff938ef7640f891892c925fc66752b2e2562b654fc676c713569aa462ffa986fd51f0918b394ecd719be671a2303adaabe27e7a527ad467345f9bc6260c30000000000000000ebc72b0200000000bd1967cd5aba73994187c04448bcfe59d00550b7ab9c0eae605660799d6e3373688ee11048ca4fd7e005a93c0fca01ce22596c89d2ec89e4182ba617d73e055f37b3440f152f4ce2995f4de2e56ca8a0f6d0bf3240f9a90964cc7c381e25383b000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004bce2a111e316d953393d5aa8b256d29b53b525910c4c9b610113a7829b17973756acbf932ecd4ce435ad82884e851b6285c8f9b750a822a110ccbb66a99ee4b163fbe096c9f6f22d16204f4967b21c481ccf8e0942642a235f7aa6158fa15d55f1e0f4ffe00fd1aef3aba804b2a83f26d687cfc36799030544d4d4f0f53d0303899fbaaf2f2af11322addedd02a27e03e6bd8862ad8abd55ac6040f8db8f2e8d3ea6d2f1ca0166a5798368ebb9fc9d21cde1d034e3f151b78f7eefcb05a69bd87fa53b61b62d32816b94d7c99fb9a0392e0cf6ecbec3dd3c79c14c6e1cb5bfe5388ca71f3e1e755d4c5b1612bf93b22d39fcc24ad13f8dc9f90decc3dcd093965051f79556224e3abeebb0f8f1b66edc155e2c5194e1518687987ba7430dfa77d68fdf73f53ede80c2f8796016fbf17ca61c1cab4100e2838a8780bdba757bd854ed3362daac0f7461cab723a6f1b984781c4796a590d53832c61ff1070fe210a25d4ea2786d19478f0026f2050d2046283fad2e4a4c77af384987e7b379ab888654d293fd26feccd169130c91d275e78251ef35991bd5dc4357454b0b8e140f88cf6142f50a2a2528a7d8ce6875a196baa9c95ba052f155f960cf007dec8b9ff0141af19a4138da2b28b5884646a7fd06f58dbc450b8ccdece46874667e75f430eca04ebb6d03bb043db5ca26c180a28415a63a7663c5d0cf63a912b91663972d306a0f756c48e57db28d4fd497a26d802a021b479e2923a4e887cd1d5bf2512b6c6269defd48946f25e6bb8b36d9533bfa08283e3cd773bd1c79cdad5d4afe03c40366b3ec0d134fe905fbcc93a9b17c149b7a75312ac975be2b99fb1c301259a56274c368850276f4fd8f98469912274be87ca8a187ba8d730b1b7204b42a9fa4d5de206d28cd839968d222cbae83337b4b23707bb8c3cb41929b3990c38cb70684a9a14e3361e038be9d8a19fcbd91127840ee0c57e5244e55ffbb4ade476236361a09a5f1388331d7129d96ed0a9561674bfbcfae5ee503c5c7d3a3a453735e00df917557294ab02fd1d53c2d8c3de22cc60de5463dfc8c475d24c7f435c3fe30c885fb5bebb378b67a31d14d9c814ca13cebf4120c15d54086899f94d47d2338c018a08a3c8db510b217afcc5d0ae4250ad8e52dcd9b1d9ea3860b3dc997de84b0fca6f3d6e41f3addbaa97e7685278a476eceb188eaba796aeb8279999f45faaf75e72dc2e55673660331e956457da6d894e34aa2f9f2cc97aa62e05250715c160dddef993d0d3503d923a799c4c5e83219c1b41f6c0ab4a8a56a59e92cf2ff308bce37408e9e65a78a735fe859900179a1eab28de479a4f58a1e8c0bc2326848c39820e1177d2bbc26404491dd7e3cca03057a3fb8b0c795202f1e72139b77ed6d2ebbb1c82a8582cb507ee25da4988f5499b8388ac1d3225b807b713430d06ed9adacb01a5da24718bec2b939f4846d432d4706c0e677d57e3a4c27f439cad82ffae71a44cdef00508e5ff136b0688fbb895dad5428a1a121c0597a2fa480d35b307f91fe1d8e6e208400f9388b3055a3c5c7147d82e2ca79110e7d2e606044aa59838ee3894f1d9cfb998c887161d1ddff2c021eea8e011b250fd6766ab110ff5b1729ade26a91a40689439b4618d188e455d92b536caef888d1f2fda7d649c4e80977af37f2e5b1fdd5864eb827f77d4b4b77644a53c6541bcfa391b6c7ae9cbf8747b1653b0c08e898f83dfa411a84cba93994f9610ed5f82a6aeea6bf139076a8ce139d339d0341aa2e55112964d29d2ffcd02966b3c0838f09b6c3ffcd77463b1274e92d1eb228f98f6e39674d6bd9e17e78561aee28c6ab5e3ae05568d4ad2fdfb403c7eac5e74b21176d487ebb912b4ed7d07c93014fccf3b8e6795493588b76fd83c39454d8267474a73745eb0bc1e644bf450f0426c6df8488476e9bb75b0b0da439f72217846e21e0cdda187eb596a998c3b8228449d64c928dd04ff23a2c3e610ab45610de7c66f4c2124ec3765e681f0ba7e034fb3458768f6a6ee6ff9aa90441c2781ab300ac18b98c5f04142cbf520a5add1424216d6de47c7286ddb1b3bf7ad6d24cce41294ca3c50165da02834d23aa973f3eefd6db8ba362bda3c44c8485b28723a0f9e5700000000000000002b96a101000000008bcd74ba952cd546e6e3de2b0f8849d461ec14b7c641c06fa43e38c11a96aacf0a2e42f9b112524b7b906da99223662a8cf921e35f388c07f933980f21178d05bd899bb1966c7f8c18a09e455e8232b4bdb77211ba0db5c615bd3673f19477100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000033ce6be099d6bd6212a1708e1b41c945766564ffa84a5efce1a9455a1621bef496a9874fd06e69b294964c2aab1af5c7ce213977851464d71a12496788d3461cd4a1105b3a4c72f4586e9493522ea7433aeaee2e8060cf11715833a3130df2fc7cb425551a2a42988a9362cf3f77aeb0c58500eaf5e8947b5b2bdb29566279f6b4493f9b2c48a38381b13e02dd73ef96cb2b1dc42af9de68da37b0ba8b5ca851f99703b92766a5f9a3302f6854834f158d104a4ffd1768685630f3c2448fc70740aa95777693713d1b61f0d83d80b1f3f758a60e1cd99ec524d4a1901b5f528eca7cbb341090db004472fc82c31583ec04345331879682571aec551f472bdfa524a0868b646fe7fc9a005a8b964cc371ea471734a91d03e7dd7461b0a54532c289ec4a9aff1872aafa4877ec5fcaf5859026d67d5cc341cfd1437cadbe441ef6b5a8554df2aecda0b21e714f7f4d3a5ebe113fe2b5ee00ad996a4afaef0f4f01e3d78e9cfc1a7f0964f906440bfb5d20d69c5acb32a555c0e43802a3ac9e88875116b8a5dd34f57f9f85e8e41e2234340ebc5ccbb0a5d6f0ffdab61b159cf9faf94d80a1d3d5829087b50958f016c9a78a8a454e657759b57c2cfdf5a26310b8e719d0be0b1cba5404fa5b052d0921ab74c3e7a602dbbc9de0cd78234ba0feb17afb2d78ba11cec1210be0a73f124ff59eeabfdb2c97188cb28093631b057c25f46a48d45e75a4a0aee8975dee812a1e3e38a704a37cbe84f16bf17ef831b5890863641bacc564c568fc6e07202cccd3121cadb4da0467a84ce4223171f4aba3aa4b2204e19c2dfc14c8fc17ba1f929a877ae8e8ebc24a66fe80e1817aa33ba80b62baa2ff9e6c51fbf4d6e5a4266a1da4573a43898951c576f8a2b65c13423f4d9d0146bce5538b926b6638fe707ddc56ee9d79f158dc94ba9746f845a3566c705cb9fd60d02e3910895e1a7bec0c67dd3a1cef263e9579c3a549e19d699a61f9bfe5a32acc7594b255043b04a94a046c8beee089a9c7bc6aa684dca3140d8eb95988039f08b9964a30dba539c89952c89599d3bef13b5affafce786dfb45c8301308238c4f7e9b2de256fbf3cc308514acc4b7c5fd4d831c0110e9745f63149fff87db23b00354d668611fb72ee00fef32ecb2a9bdfc624daaf4b2f4c7afca84b24fec5e58e943b16ffcff3c63b9b56e55816974a758bbb9ab0deb1c27a13ca9f7b7cde3eb948d20c38eb880656e7fe84b4faba91ef64968094601c75fe93a47677429f4fe46e22973d8e9ff394bcd995027f8686e4673a38a365dafca3e948269085c312af0ba9c51d50d1282348e43b5deb1521a4b02b1e2ebc5087226fad701b651b3ece429b70bb48af5920ed2bf4b2dfd0b37e405ee2ccf0cd62da233653a574601115b5d0fb9624a7a4a2d27a31eb5bc8d1e659defa416dc5c2e644770fe41e63846785d0a17a523b559727e6065c389e84be336368475e4e8b5dca6abf277c7accfc8cbd2ee4d0314ebb63d6e8bcc7c6b7cc5d561529a10e10b893f0fd6eb83096dff63f8cdffea1b7e6e4a6cb514074738f8e14a9651cd8becbaf33a5a758b3d685009d6051fe67b7aff1b3107ec7a817916ea66613bc17fd8a071fbc40ef868bd7d1b4add476ea25ae5a559e23b5c4a84b4ab61aaf61a514ac2bea0e0f306aa40334ccb26143a3e346e11561c11960392bac8e818ec7a05e50459db852d7524f2c61a6f6d5ac8f3a5e0f24a3d772629816d6c10f4dfdeb49c524d545b97a5546f6445fc6030cfae02f5dca7c9affd4ffa5608b7809f0b3c1eea275c31e427c1f1b9f0a83b85da97e376c4394f80f2de592dc7480c732f4c991930047f3482327d4c4d7870c4e1da812e0c7f01cb31189db08edd73fb343cedd078af5560fd7bc8973f0222777627650fc0629b5e13b3de27bf40c9852f7992e3d6beca96a4ed2ef43d9ae4417ad1bf3315d94e189e7ea613ccc8d87b4b4a611a97ca75c9f710c25901fcf06ed8b5cd76c805f921d55194fa66ffcf637e8404059e3d816e811d30b8617bc8a0591047e126c654f0ecdd29553c8186cb14494049803f5a9c0c6d5dd84d3965906a821dfc0dcc5f1b05f95af15c1fbefca45fc89f330fd2fd321d7a8c1545966bae59b94ad46b841da81def1ffa4381df02be3c37ac7e1711abd8b91a936b657a6fa90c85445186b71072f981406fd1b246546c579e90470728c50a6741b92789ae5847441a7e0d647424ef1bebac538dabf1b5006c69125fe2a061060f5f41d92206cd87a82e0700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "53", 2, 84373510, 4179206552, "cb4d1069ca17877576cef2d6d4c3501bead1cf5b7ad8ac8d3d7d730f3f376bad"],
+	["5c61da5e038d0db55f7420aa822f8568f071ceeec36b83c798142cfa1398762cf4a3b2debd03000000065153acac52acffffffff18375fc1b0142b264d449b34ce6992d96c7658e6b3d4a0c3959ae73841ac758303000000076a6551520051512484a6b16c06be15f6439117f524eef52d37d22e59bebec73e3e20d0dc1147b1907aa473020000000552516a6a655f4f920b045b454a01000000000263005217d900000000000151482c0b010000000000f412ed05000000000765ac656a65ac520000000000", "636553526a6a51ac", 1, 1755009826, 4179206552, "340a908f2c8e4d805f4879a7f275eaddfc14f82c3d3fbed709f7f36e9452bbad"],
+	["1690a21c039a9ac62d154e17980a86d4c2c133ff0d8c1df5b0638181c7d982d04f8883ed8f02000000065251515351001464b68ef03266c038382401ab5d5bdc69ed20e726c0e593f6545380c2c71849582e95a90200000000ffffffffa761c7cf47bf1a0385ff920b81d007f0c5c69312fba4cd5416e0f6850b917d8901000000025351cb932dd50204d49c0400000000026a5142dfd8000000000002ac000000000000", "6a52650053", 1, 816815301, 1953719636, "cadcd1c51ccd85b91a7fb143bae7471086e5e290ddcd1f051236ca48a06c00bc"],
+	["f7be236c04759eed539088cfd0f0aa8228d70590ed117d5a56c7458182f3618a650c8db76b020000000152f660589da420f843df8ffb55664bb9309608ee026bbd39d8c905d89db67697aa3891a1c80100000000c593a2f5d308f7e2c264d3591f0dff84dc9a49808c2c96472de2e95691749b360222affb0300000005ac52006553a40f663f4a1bac7ba16455450e638d8d7821100dc427fa3d5d605b19c59cbd53e74eef4a000000000152ffffffff01143bca010000000007000053635251520000000000", "526552", 2, 1232360618, 1991772603, "e7466a8aca49c48536eb233844ac6baa1e0f838793f0afcca07f7d6783c486e7"],
+	["030000807082c40302ee7ce8017b545062f26e4bc79afdb1353643d2d7f57a52d24ea2a6280d6f24090000000003510065ffffffffa35c53651322384b9561194720cf7a0f396aa79a9bd81895c2ee4931682069230000000001acffffffff041abf14020000000009656365650063526552d4ba1d0200000000096a65ac656a65656351032009050000000007005265ac630063f8e89f050000000001630000000070ef5c0a00", "ac52", 0, 1543291966, 1537743641, "1a2605fb8151fa9d3da767d9ded8a9897937022da6797e7c0e060b646906e9d0"],
+	["9882ed7c01340d408e2cb86dc9a04fcd45446e7b056c9219f858cace697ccd5e438494b603010000000451006563f7aef61503c306210100000000095253ac6a526a516aac186ba600000000000463635363e0f9e5000000000008ac655153516351650000000000", "530052ac6a0063", 0, -60139974, 4122551051, "01e14cb9d86a14f2007b5ea1e1a35203c472e12f7f8148f587601a323da47d75"],
+	["030000807082c40301a4d3ed65547cda6728e1dff842be5cb924fbb491eafe4f26dc6e1d23c0ff032202000000070063006a5300acffffffff0116b9b4000000000004ac000051a2a786a80000000000", "00", 0, 904159793, 0, "7a04fe5837367fabe5de3554207e2194354a425e7612fcde9dde605d894f99d2"],
+	["0400008085202f8902fd56b687d45b81d496484eb67295e0776d9e8dd9527364b0c0ad5965a85739f9010000000752006aac655200ffffffff7f9dca2e58f644e34afd310718d0d2e78b91ae582d383b3b8f7da4dd4bfb34bc0300000000e339781103e34e2f03000000000365516519cfc2000000000009636a535251526aac00beeb11010000000008515263516aac00650000000063b60c1b0b4ed90000000000027dad187c0d462077aec284f5ea181e7bb1f1622fee6d9af0f5a0d5ed65fbd10f1c8a3faadaf300bdc3eff5ef8d15c9f112ffdfd7b7306fef222be4f24df46a59ce213c9908a1bd65e14cdaf5339338fb23113463f915dd69f557aedc97ee2153db3bb12662d2561570061afe8b76b9067be1b1b355837f4aa2f450bb6beae4115119376e25dc1efa9d7467c9ec7ffd215090a407849dc496328fb39cebecd767e270b30693509b74478782bdeddba879dd8908a94bb755515ee9bcb2ddf62d2379a3e06333706e6adb201b54daf3d43d432bf0c0856c4b87a7ab3cd521e98cb5870a21aa0c23002872991577e71cc62db1fa1ada67eb5f26d7f1de1debb78d24a59d01098cae808c4f276d874ad75a05524fd0b19e0f9bc64330e290060fd1798377cd4faddcbfe0c0c2bbea8645af5a036cca971f2f8af468a837f5056b4be15fe2a061060f5f41d92206cd87a82e0700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000073dc14dd974db7d3e44613c4f85278a5fb6045fa16f89c70ec35fef6aaf781e27b4c511efdf26d06c290c81ef6e837576994755d61da16ea1898d71bbc4ddf3353880f810cb4967be344c09e7019c8cc6ce1ffa2d6d83c443904e1fb0711fe546c414bf1aa8ca0cce955386dde87843e6da28cbd15dc52884ff76c96b9152c2df4d65d0cbd6f40629fefcb2f21e81b2d144c852db98c9957499c17489a2fff3e98577f4c5a87017bc74069e3c9f810653678360f9315b2010ad2492fc97ca60929863ad28f22414c5bf0d2fce3b5cd84571108322e7ea00e0738380e460ab54915dbea71fd6ce1e6bd18b90aaf090a21922439732e7309f8537fa67cceed70818567c5f1c4b1a5dad173ffc366bae550c842c1dd8e70c846ccd353b483e151006e6e17c078b62d1d277e15a1452263b1cec059d95d0d2664029c73969ca922035fe2a061060f5f41d92206cd87a82e07000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000042229cc78702288570aa6a02e1392bf0f6b8a051828a524093cda0d7a3ac11f9881a9229608d41fd2710450f43f76ed7099dd38806e41afdffa0e8eed86031f3205fe8d1554f1ee3d959595643865caf16db5a315844b85534bb39b7cd5d9213dea0258e78c2a97b650826250e6ea568c0ccf9e01ec04b760ccd43d7ad3c07828c0af34a38b46fa0d019c49dedb67fc9176333ea7a98f1f70601756c478fe487c216aeb312bdb20c80366ab85d136436e86788e412adaff2ce19a1f9b61437351ed7228aad03f485656ca8c35830ef2fa8ce701b9e8240ec5ac21be17eb3e75be438e5c64cbe69b2a8a5dcefdf57c770d9d5ffdf34bba0f569192351e71b6e1137f2823992f7988c4b4289bdd4a238aa3a7bc71753ea0f27b9f17a2caa9fa0aaf7928c8b9f51da3b329e2b68373c46e770a4dd18f439e842dd09168067cc5cbb7beaa2ad4debc73a21639bca29b4dc96df754a978dea4afe72bc960f811c5ff7b59df2b093ce2e10112bcc7ed34971f4e555aac9586126801007916387d650e2b3ac9d070e57139a2c0d75bdf9432482c3d45322f6791f437aa60749e3c90db99f07a46bd2e5938506a7f102246a72ee9ab2d73d5c7ddc41ef32f8d17900aa308b742f31e063452af86b2d0459231cf3b11ecdb407ea42cc9cd0b3eec827f08141cc4434320f167d81820d94e55145375588bec4d32567cc1473ec68f571f9ea6c52b6ebc772df843eb13a9c3add2622c59fa374cbae66d757070a616410696db841f5cfad07b8f8e299b052bc8ffe878c6acd8166699d448e3c2836e28217ff6127ed36aad7678aefb0d6e98ba59077abe58e8398e1d7206eea3d06bad997c9740f4b3d8227d01c942c8cb14568c6fd69f1c8873c3b4c1fdca31f820fabf032fc627e74343aeb6aa4b725d03e037b62fc012b092600328db76d277ed8fb57c0ab0d89a5f08096f0edc7e6ed17f53e1dd0492215ecef25a0bcb90474fde8f1185ffdb1d2e41447811b51123b8dd0bf35c4ff22223875e8086671f546e127b9982a6cf4083ef80dccc61d8c565dc031b3a3ca1e5b91e5609842705ec12a443f60d1e49715280ec357b585e10b503a791e71ecf7868cb96fbfbc79c7c90117e4feb5096cf7032bf6899dffb038b3d009b6bfb1f6b3168991757e6ba0e759e5112c514db45dd4f404bb490406bdcf8d322cea2731e67e3dcd26bd15cc2ae7cc2c4cbc6ba2e93e89d5d8d3bde9349e6fb1dcdebc3cc37f0f23a19fccb3b2bd468a0e0b493a9e16848cd88dc7c9dd973a4889043a4a0209b65104852a6a8303880026823d2e5b917ccd1fef8818ba942a5048c92fa807e6ee828f1639445ce84f28a30a7b5747618807c56f2e0fd353c09d3acc9a3dbd56dbfbd57c89e3450492313d9df7581742584d216342ff45af77e6b9b15d29966d8bd93722916f2fad16c026fe1ee72a7cc54b0234269c705c19d87b3c40a0bd439d90eec7cf32d091eaeaebeb8ed94bf989a9db886fd8e0c4d3dd27c12bcbfc3ead0ee62d82ff408c75815f74d1b0698f3fcdcef9794f8d9a52ce02aafc90749208122d290c4811fff48b3a34a912d00eb165af289338ccd0ee97d23061d2778c00b4d61dceeb0db1f9b39f4808d35b651c3d39e595ff0ee5c7c07ba6df69709cc7908236058a9f979e7411397af92df697041317168974bbfe5b3247ebbfcc0dded51a1ee067f9176bb892a664fa91245734c0cfa195cba71abce77f4e5ce7f8d31e7550122a0bea41ec2e87fa0999a50d8871a90c20f76ba9960d539b2a192261a6bba06a67485f719e5d4d9236c3ae0d184d6be2a51c4a0a67a253d0677f1df0db3366f8ffa2084b54bef5062a6015f6d9956df21dd4d7c0d08b523d4244c54260c9631b508fa6ee23736bce2e0779067f44ded12a49c0b714ef0e2ecf9c6ae00c027f49e03bfd54a5c765ccb6cf6a45a38400558204e87fa55afcef644f37d9bb415ccb4497490ad2ac8e4e4e3f7e373dba5081755fd5e658dc690795986db5ce3b91039af76590bdbd4a258298a562952d98db060625e946d8141afc176003e810441734ba9535bf1fdb6d22cd165d132f2233fbf5f34c46b2ffec6b31354279f0564be02aa36ff0559109d24e5cad41ba4872497dbbb1a6aef2c965831f450aaada2d7d2176c39478bde49bbd1b180f92a84674b372c9d42d3c738537cfa5486cd758b98b0fb0f9d9d9ecf2366f92dc261b896cbfef8977161a2004c8427a4593590d0aed3428bd5e299aa5e923f4ae411a3ec810ab82689e30a13686fc98810fbf2c474f29312049ec2cd5f3be29aa0df355f3c225d9255c71f195262fbebfd6feccc5948f14819b735a2be957ec86ef145ae2bad8d468b263d35dc9d2d2a48a14798fdc2c2fbfb3e8b09e91a6d3c77e1becb71f9320306db7f48d59f111d257ab6ac00f6f7cfcc27c7f8a40b3be721f1061762a24d2c4f1ed01242a76460633c7753e9d8f240d278cdf0e8cdb66a5a9a28eb5571aa0f13ed007da3da27bbf475434251cf41b8ca2c644f4c01886d05262b1d5cadf4277f5dad51ad9e71cbd5213deecb8b694286b01eafaef591076f52a7464600ce60184517c83d536de8f7952e3463f180441c8113631d80467f444cad498e96482083f2d98b6b8e4740ed841e11f45b0ff809bce000e0d5faae2541840ec9341a83e810bd28669f197c3313663e3b1dfb1aaca215642f4affabc5d610aebb7b70cb2660a47936ddf4be84636fcba75e585177bca177036aa1315964c3c47d78a9ed0fdf9b08bbb2d4eeccb633f013cabd2f168f4fc4f926ff7691b5180a54d7707a1669aa099d0ab5587e46582db548dde76b9b3757880c84088a669c05b411aed5095eeaa4c1010dd6645f8f82c96723cf3bee1017d5940e2a3b222d48fd8bf62077a787a9766db8c3f438dafa10ff5c9454a85bf814b5806531813b77bcddfbed59d70d5d46d864de8b89d574e37d580fab7a394be0cea5acec1214d9bd24f83a61e880ef15b06e9c4b8b2c339f8d735490ed57c0f3c142d29509740c9ded8aee2cbdcb5520d44a2798df30d6bf535db490974c83ab5a84fcccdd889f0b83fc41d959662b3267a0a6917ae1b4fc0b5a7e8caebb24f2bcf1457017a08bd017751c874f74a18810aa62896f275a730463ce9684ee865ad020d3bf23126641a6f4a845577ec44ee586180bbd6ad1a0ad14b1c35faf23d333149f3a94cf7a680645b24c98074fc1264570fd5e43916f53daab9d8c3bc3ae06f79cea5d51721d21d2c5089683f7ab0a3b819d253eae0170b659d4ce3c01d02143d9266a8840eedfd17122b8f62a66ee238dc5b3729f663139142910f27866894136a8393102a4ebd40060090a0d15d50e120718500359d2eb0b690e52f147471b0c8db7db9723f35d4893c3bd9f100ed57317d022bb2bfc60bfd69c88ee311dcde3c1c8021de1aebd34b1e3d3f87223b6a6e1228d28dcc48b6a060133c7178e80012712a83811c000bc3a6d0a28b7f6b83000c7bc0d44cafd3afd3a519a299d9eeb514eea1440fbd91516aec0c40303ca93deea705df00692f3d366f314dc3812c4c663e6917f3dc6039a98991091883e6c6ec0e16dbf6767238f10fcefa23a1c9246fe880d080686bf6bdd97305d86b5f31213adc4ec81e0b996017d326030c1f8aa7d312dc6ffc3efbe988d1c03a80792d168a675a6cf0bb861410eafeb7d608d9fd9cf342e3d05c39d2bfb523b732433426062dc06bf9ea2255c359982bfb544adee42698788e70a285b15b68d1b739fc29d7e345103a5643b914445b6e0f20096d3ed4cdf3d3e0fd579322975ab6c2447221486be9c6d97751b2d8598f609365ac70f9baf159e86908f30a12f31b0bb56f81fada9783e23b4ffa390aafeea5af785ade5e5975b51ade30254a05803f71b5b55118871e30fc61c5154ab0eb1be2124a85b6beb009e9cb354b128762026f447739dd3c1886b8ab5103a2a9608f44c6b5bf766a4a66d4646fac23d6883b9d3b409a321800ff0b12b6dc0900b07248000093de1515d222c77d2f36397748567ebe3852e360cb9f6d6c89d1414b23e921b1c3b9159406467a5fbdbbd7c819da825bc3c382726dd35bb44612360114c58d6eb6e99ab0b9851fd794a0b99dfe0e5fa2886d333ebe400269b9f9cecc02ddd1721070486255fe4408b9f24fc56c165241b86820ae2c3bd29c7b7fe7abfe57157cb7a15c2697ece1942fb1b4a2cabb4db019160c76328b787714eccccbdb3dcbe084c6e688ad8815e02a66727e67571d9e0f55163eafac94ff7eea952a211817e1f8e8359d8f382f2d754b2efd4fa2f545c233d8bd3bf3620ff9953fff1aec4ba41b1c206bb35837b6136c1d2a5d5e1eb37bf2cc7f2d2cdd2f69e8e8e10155142db0712c14ef4d28cc39100f5d214a073707b19241e592134954e8bb1b48c4dc03c48cc9bdb64085b2bfc79acbc4119c8d1a48007a935aff9f084b718cafd3ce434ff191ef0475be54d875e6100db78866a7dd4cba5509abb665c788d1618827fbf943c2c2f0f3836bba550fef7e6d7b5f9abec2078cb14e9a02f11b8e0b2f436ebeadc1b9f9d27bca4c0b74008596f22316a58d0f328804333c1f9d709e34d49b0ef89f63c0f1d2d8acf620e876ba5c461968715b96a7c4de64bbd6183789b2e4697dcf7d6eb3c5013bcb234d94da7667c8305f2c5f15489889ee6b361085a1c27cca5b86fff3ff5c1fd45249886f72e7bb17af25ccdca61e14ceaa62c720d3e629f1d4893d85aa7ee604ad3e5ce0adac0416838bbcc1e1f6aff60c4884ccfb3358918e832bcdec2e9f4b9713c49cbe5be3a96719cc00b061916c2d648ee05ef6f31855a4eef3888688570ce0898199a716a07c056d9f507fb7e0fbe8e8322aa8235a76becc0d62034bb4fb6c3a7be88d5ba69ec3a27e36a4f6fa91c0ab3416fa965890be97985c8caf4796461d9a614de0d0aea0a80644d9c6d55614deb7242fb4f13de2b6df0ffec16378750576f0bf922e066c76ed57af1b8598c3bfdb913f55ee2f8a27769b6f07eadf2bddf953ab78297b5a0b7827a9e7c167783546e40445396ce509b40854c18e7e022ee2b12d4cbbc79899a8ad576b0d9c0c1ecc5d449e21384846f49f6ac889f294c615b21099208813a0d150d9a1800395b400d6446f156d4e6dbd6d5aab72dc1c4e13fccf10fedab4327e6a2316d3b357ae31ce5986807d67283e6ff430a635ad6cad00325d2ed079e8e046c9898312d8b7bd90c3ebdc5e0140c1f1a9277de7d6d09f7c85585710a8d41c59aba70281efb78c513969205b6603e0153c896c45db6f1c981fe6b0f1fda34c9eb69e0a7f2e0aad3bcedb923fe91abf29903a0adac050000000000000000000000006a09a08cb87bc6b1164abc9440cf1da12ff20dd106516af025f5334fba3c5d936793105d1c35213c3dc09fe9d80cb497c84cfeca56b926c26b8e4d9c1a446ed9c7f5fe0abab1676a4a8f3d4a8bfbd8152cf044329ad247f2027929a996defe610000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000086e03a27a347bef482fc9b38f9d24a2ef040d0cb96a0c970f7114ac58244ab517de86879c5141df1361c9c51c98f4e27adb78282e0c5abba38299843f2153c59a29794049481be00eef12a40e515f2b170b854558dcd17f62fe05155f877cf5156b44b50e49779a2064283c5e61d87263bd899383ee3c6643d29380fabd282d4c5bd4206137fefe53503ce7910f4ec2d5c9c71f028f50b9130fc882c3683d889c3c9e8177580c95e7dc2e1c42a67c2f264369b8fc15c953d1571518af461bbfb28eab3f04437335c8f6b890ed5d15c3d9bc915e24f6ab3c07da51b8252db8fa2a8cbb1c9989bb337be38cf6facb3aabd6f1a58d08f1d7d8b3c8a6354eb8de8dd58e649b5cc09898278f203d6cfb4789f7ba3f2a5bbc0b3e2f5006c75c218843ab5220f1c58d324d403dec83c572f9d65b476d47341288985f668e8d583b1b8556f20f75d2e1c029cd2a5e57e7a4b7d65d026d1dfc63ef1ea9e1838c244823cf80a7ad02cff4c024bb37a1bc247bb6fb79cf4591694ec9b7fc20d5cef49e47928829492390d44c429ddd7f89d5e133f7ba4e96203d14e34bf6cc4e679cc13564250831e8dd35dc1eb28efba7f6eca7232f1735d70327540d491e98b7be1a68a5de44be898cfc63c839546e675ec4e9acbe40a559e04075b63756392294dc8497a0145e3ed537e7037a0931a1506fd58b18b8410341531e109f70b08ec90334173655624eed7eba5c9f4c6fbb87edf9a9640cbde0433ee1ca29087a2dea440883b19451d78f3416b4c72d384f8f93ceaaaaaa617f7c9636193effd28e3daa392e87fdb1558a572db99b1f55b0e281bb8f8fe4ac59256ef7151633fdaf933a402928e7385995be115576a50ffccda1d013de46a2eceaa6fbb44cc2e79c29b48cb0204f38b48e6e7873301214308b475aecef3d1083a4e625881e013f638f40cf9d821ebd838e23ab1d93256c8fd41ece1446f2d3847877d9e2978085ca90e4d44e2aa3a8dd8605685c3a66fb1f41bca0fdaba72bec16fa85fde8f9c7839bdcb04857d4bdbca7a6af582961bbba229b823b78ad1897fa46cc406a6019f75bb2a95756f5db20b3db5f3992a28074de68014bd807dbfecefce9f855f50622df074d3ab9888940003d42fb4f2ba4d0ada1280def38de8266a209b38fc485ee7687e3082d4965b7e81986662817dc681154b2a45a39b222a29d2b788f1d522d13123823ebe95ac0cc4298130bd9502ba45d077ae5249c0833022492a283aa01a747dcf4fbf3f48946654df67c3c61af028db8034972d82ad25be0611dc7e5b28928e047367b07d0b99ae6ac05ed1a1bd90abcf67ffec1d8bcda1e71aebff341ba2690f7f3491b2925fae1e301228623d32d82afbf2c8f7ec5da44db449c9c4dca5665422b14388008ad1f049f223cd1c0363efda7aec5b965b8aae1c79bd5022fa36b8e525742381cfebe09ae3cf50b3ba3d419382ac9fabea1d90696cb5e02effc1ebfc775df2bb249fada4621b190634d0fdd9c26dccdcc836c651b2f3c57e4175f6a8f44e0d60f3e8d54361e0f465096d45c5633fd11ec6c989d952e899edd8f47dc6aacdbf451fb2cfe4f19c0272b9695ef943cc025fed639e3a668c6f9f9c315f484aabe9e75d442282f6a7dbdf27a0706607cab98595e3be36ee548df986f2775a8330b7e26965256ad4d5a6e8ed2b71f2fd32792c59b3186e9c22764c52cc01052c898166e5513e85b7c1387d45c94b4bb99891d1d8f8bd9b39a47002dae1b6e6ce683c34d62624976a59b5a573ac965911771c01705e856fe4748204dd70a30a2f2264a68903564ec7edd19ba06d4bf1413d1e5c5fbba7d1a42517eff4b479722060554dc8e6ad3b2e7d270b973fe50e7e4c8c723a7e7af593129c7650c62e183667e65927ab2385e035ca0806091806919d28eee506cc942728312db02942030af6a306a79f35aac10efe1b65ddbecf743e41976d12f30abfa24e03ccdc20635c2803d01e834d7572521727eb967381589a5656ac7ccaa7b7c61db29857c0c0830a57f4f1e57f5f93e78835b930ad55544117a174cd2640b7adddc3bf24c801e07c566e414aad6b5a4363355bba097394770d36e967e2cc5869e05633d883cfa90fad56e051af212dc0c4391724e85c453900000000000000003d82ee0300000000e995da1431ab18d20d005b4f9f4d447054a3f4fe1e1353a82c1a29916e825273b37ab9662c78185fa7b5790e076d01ca4b11f04ce80a17023040951a0708b7ac83203c54b0a51d06d7a900d4a03585971cbb5c8619bfca196251d19ea47a2bbc00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000e279fd5d51dd5a254cfab2fdd6d5bc2b272c948e97819ace53c6f189bd731699a302e6348de3efb79d9b6cc294376dc7c65659b46c01257490f2689368765e42702e73799cabbfb240a3053d58ad46430c1d2a72b6d61902a37a2ec5aef9f1dbfd327d9154957094e8484ab82d4394416ceee165ea6c1510b26502fb7315b9a46d1f8bb0e09e418662bb6179196396b30c774434b9a91e3ae071f5a25f92320086e6d4058ce495e2393bb753204172beadb08276b7c286d37eaba44bca944ec7fbc9ee610e2097896a225046bcfc57253dc843cb713802015f0718cdb30cc44addf1479be267ca79458b946ebc759bf5187e7742f2d6873d17fbb417282acd8dd33d3a63d9f56663a7eb97c6517e443d65366b376fd8d422f14e17c47759706a752276b01af27ed79fcb54887767a02ce776eb36b8ad7e186656ca738bd52027b38ca2e8a5e308193620bd6c5d29cfce5e3d504885957a1b5149e00a44ec11fcd954fe707e048c344f1fbb948562d3a83e401aeb2ddbfcbd99d7ee9a7de03707a1ab37da5d608bb562d1dc7ac8e52d8d761d9292488b7fe1bbb9e8e20b70875dad917045c6a39d4a8c39787d3190a5fc0a397d3c82bdd4dd84e2d173bfc69bce2f0265065f58fea1d0120d29cc74dcc38bf26d428c929e99112d36655c21de48a50e90045b7b9509079479349a0a8e4a085406180143304eae9c29870a7008fd07e09c92db3c5d6a1947697b8e5d12935d2b8fd1f2807a1633caa2e6979bebfd4997d7262605bc68c6624c8bcdbe2ba86b1c7ba41fc58832078a46758b311bfd6f081cb4a11ad0284c0428ebf53ba11a798bc40152bfb0898baea524a98c4a2fef5658b87726bb802da2b7e9bb4672f324ac5fbaf9367e3cc3b09b6e9ef5cf251c0b83a97ecc5a6603591fbedfddd87d52065e627c40434d03875383fcc7488bdd3dfbb466602213c74b874abefa9e08c113ec9902ba0d30cede745512937a45927697bcb83db450c69c1c8ad08098e280d41270cddcc546ee05b0a9faba50678875c7817287d6468597a60510523abe708cb7e8d4973f4dfd2dbaf781adcad156b751140affb3677c5f4dfea3f1e247cc55231faa439fa9c505f672cca90a978861db77e3a402c1f70a8b345f076fc69f07c2d805ddb4934b7bae2ac7cd2d5248ed16954b1eee69c9d4d075269aee2d13571f2cba1386e4c1d10e2564eb258f9139d8bef055777d23c862dbd196480c0b1986a859507d4e34c12514b31ffacd1ccd5838e09b4211c87d15cf60105239d43ae377b2ca1ad52c16ee0f3117dcb0b4741d0f3667b924a11a03976f8215441d33e38f449133449e29da029de9225579e224b0ea15a0998aff86a32eb6021d5f477749729e1c34c25d933764bd564dae16798c49d7f4670ecac81ee1083db9cec79ab0b66bcde7d0893dd7a46b54aca33de26b22b58c7dfb3a8c7b4c83ce147e47907ebf0d5d058f712a86de77f606e38f09c57363c14351480de8fcdc6fa020e100fd163a83b15cd60e312e3d0750ad8c826799fcceda99d35cf9ee6c27c6643a144f23a19ebaa0c614c809610e46fbc2f9e03cef8689b3cfb89582d8211149d6a77a8970cc2c41be68cc267f2bf4f9d5dc7922aff168926e929ebad8511a57721b811bf04fc2889fd0ee88a048215531118d44fe00fb2a85a254817c458f3385fbbf7b35c7141b29e4ab7abb3c004d97eb062c08b462133d875ce4f3afe8ce377c76431008c3aad0d8c38c7552650083197c3ed855095f990664edcb4928e3e5645039eb5f993151110f2530478c95d0199fb2d96c1fe2c98f7431149668909205f6cc325e1db46bff7e7c954050a96065cb65b25cb9b6d1493342fa1421e562c4f6b3eefcc7eec33f7943fcf366afd7a1829beb26a94f352358a353a3ead50eb1f581d30718d176c16ba12cbb96a994ed8375bd7c6bbdb276d06d8c18ca6af0818a469d7910770bab720f44f3159b43b8f012826c1db0f60ebf4bc41e6a92c5706ea9a660341ceee1cbf565c7e85953104bbaac087c0964e6ea452fb21072273913fac69cb87c20fa813a61e37d1f2b6dd03eaa8855c8bb0047e855c5c54a1e3a62c075ec5dbcf3f85741944e5ffb6ee53f866ec1f40ca1ee4e5d6ad614ae7800000000000000003e6e4e0300000000708c3ce438aa6e9d3ddf00929749650015caa140efc48f7377761923a341d3d23e1e1e9088b6afc890741c3ccc84e418e2589059e7929e3750831522df9fd85adf5a5829af7527458b824304e2236c94370559f17321943242048835799113120000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000068ce5d00d11fb4d539827161fe7774c5fbc3fb5b4816d91d9f8cea8caaa6e2e76c9464a207bb38b82edceb305feddabcfd468e4f9e0bf0a7620fd7399411eec095dc6cb16c67a5747c8dd6e4d87554e197fc707ed71f215f3ce8466a3c5680d3e69a7c624b021b9c719e2236fcb87d453482b7031620c07a0ee09893479694f617bfd62d22029ede6840a851fb15a96a97eb8d75a6fd66299bcd3c7e5551e5022510ece6a3df6f7d2ee6a3c1c82796bc792fbe416fa3b2ce97972d8d1fc4daff6bebb2e69e99188ea8df95c4feac6b5438b3a84644098a0bd5c673bf0f52c24472e580c42eb760596a2b1a54ecb383b8ddf4f94e9229641ecb3323937aba4c46b7aa67e2cf08ce23d63faf5cc2ec2f124db0c60ca0937304e006873105841d10790b4af42b70bcb0471d4ef9a5a4918e54ab0f427cc34963f8e6e4a38ce2e63565cf77fec0cce0859949fde1506c4903b5d46a9a11fa447341c1f4b86de127f98b6102f82a1edad05522f4546089da4f5ab33ab0a9629776460aaec67ba40b7e0eeeb890d72cbd77fc0679dd7187e61f7ec895075928fe96e208669fab4b2a7e4428e24cace1ea2d59e3f9965884da7c7002e9a6fc1db142f5f44c80bf4ccced7cf96b952b5c62d2463320fdaed0e6f476e018b3dc4002961151d28572069853a69398d4cd5fe366b194091c4e051ce436e8b39a87e03635d314214e599aa45b0d09ac5acce7f09bfce7d968790dc55d377322eb5be0280a55c695bc491ec0bedf653398943f6732486ac6abd7ffcb7c5ed377004b118f2c866e8719884ee1f827c32f294dadcb7b9eb9fbb48111a9894f424f785d72d2978542a50bfd8cbad76420b787cc80768ae5d4de90b10b25159c78c4e39b75e632fab573d0308061f4d5109be72d8110f3adff4098bdc0602143372ea518f9d91a1be62265c53b51bc684512e04aecebce112e3097a273b77e2c29fe74c4f2a4371cee01443e0049ada42139c4bafd987c7c52ecd2c06ba59d05cec9004d5012268a5ef9a4922f7cd2c11b65ca0c5ac03dfe2afc25a294fc60381b2f57cc75380f93ae127bc08ba540c0faf14bcd790416dad4c2c09309260149b974c350b008b62dd43a49bf416ebd9f6ef3d552e040d50b46a3a24b9374e0257f023bdfbfd1fed46e0e5cd050019f2ac0a90b98ccb0df46e959f1b4429152d92e6d28b61bf7784487e6f8e4c8abaa6304d5634a0e211622f9ad8e9fec61578240649c7773408cd8cbf5b759708fae7fcfa07d0e593c25373cf968fc62d5c880953108dff54631d2e6aa0e56708144765fca5cae0d64803887e9137538a6caee413b7d3e7963361f56e7e90509aa37bd188afc4e7ab5c1e37cff34b58a31c864f6c643f81957986398041b0002ec11c050ec00ab1c0289a215d0606ed2b6b3e027c98f1a784e195a7edfd64b66708438dac2898acd0a8b6c31e8a5f28d5bb494f23064a42970ffcd7ac986f13c826ebdfd4fd87e10c1415c3ca6cfd55e02a3bdaec50293021476c7b43f5140408f9688839136cf312a67559c7f6c55dc50b192b85fb6425e4ac04aa960d053df1a8ffe6148fe0e4c17220e1fb85e02a25626e6a35b9f5aa7bd6e9a53564976b2bcf901f7f8aa25c1136caa409288cf7d12759c54ba8a613cc77ed03b586203aeca4c9f00c1b44e6cc23ce44f88baa17053cf3c85437317dec945b1d1f6ffa3cd8cb52aeb67910484a3570419f10964c4170d41eb0f20a219015dedf1df8fc8ac8b2e98a5db9751533515b6fac2155a783220858a4180767b3c0cdab7a948125fde761cfb99438ca48ec0a77aa34201608256a26fd8ee3b91210247d34ac26eda635d0d854e933faeff717e8c25f1a82df275e588806a6b06b2e620297e350ccca16924a101595d2d1adb9dbbb9f1717f1e8f1529913caf80676a38d1c7ccb06936e9a8dd8f864d9f4e83f6e7aa002176952f4761698e47bff035940732a5f07fc3671a28bb52a3b3b2b23d0aaae88042cf32bd26291688922f1ad4b163b23705de4a45daf73bbe0da67e5ae5f55345295bce526276302ee43d863d66e642d15659af9a4b7b7127c2065e8d5a251a0d67f0c05730c4e610b98edf5df58417ab53fc990fff873c218aa11d9f1f45794ea0778edab83f777e0a429d3ef48b50a04b74bb36f31eef5e2b4e5677e967598257ba61cb929f8e6e5424b3a5e05de7d15ea073a154b15f7b94b0098dc0ec80c363787242f355a364869193a67e84eb531c0144e38137a0641c4386f14a6a10b535dff82d0100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "", 0, 36576813, 4179206552, "c9fe8a1201773a1f4dda6b42d4366fb8bcf22c1ec1dd0671b4a09cb5d5ad3d9f"],
+	["030000807082c40302edd3efa8ae770cfeff2c5e2253f60641f27bfec9fc7d5242cafe9fc2a4cdc2a600000000055300635163ffffffffcefb96b8e7ddddb85474e253e3ba6982cdf1f6724ec9cfb1115c2ca1374c47fe0300000003000051774d37bf04120479000000000008ac51acac5200536aa7420e030000000005006a515351ee58fa0200000000055263ac6365d0d57a03000000000363536387b322277223501c00", "ac52", 0, -498827346, 1537743641, "4f17d57a57d43f8d7bf6474a07021457aab440080723f6d3ebcba05da4f1e535"],
+	["ee78e80a049d8cefc068bf630bcddedcaa29c1fd8b784b8d3661e00fc3aa215afc3b2487970100000007ac52536352656315c1a8f75ac23ce086fec8d5fb29c782ffeed23a1d7c1db327d237116393d2cc424a44b10100000002536a146e3175d1549ee28b606bd954280e0499d5117d778208ec186d66b2da2d3f3bf872ab060100000000ffffffffcfcb97e6dab3827ec72618f48ede60b2a2202047e2f16c7de02167ebd7ae11a5010000000863525300ac5252ac9939e51201ab0a60010000000004006a65ac0000000000", "6a", 0, -1533717646, 0, "d4dfdf88224e27477e6f1ab21320fee3bccd9056794014e0ed511eb58f93a459"],
+	["0400008085202f89017d73fea8a992100e3c177d6112a2e87b375359e05974b968c659693fc68a7d6001000000026a6affffffff0169d1d20500000000016a00000000ce781f0bfe651d000000000001157a974cebe6dd26a6a1aafe36608de47cc2511f4867b53d2d2f90ba4c4840461c4c78b5b5f40cc1714172796443f88ced6f915e697ad3d17e679923e28cb50d52119b6edd01763c8471a328b5781f04ad0c5de71e6ea523e154b561e6d4a559e68b5dba074df474571c977067457becff4f7181809a993e80b973d516898fcd1820c6ba95a47e536402b5540748395332333be7d8ba339e31ebbbce725625199bada501abd3a8354f11d291e1b8665befdaf51f9aab01d61ae046ea6b74142067521b90f011bfd8731ce2f4c787d4432f54ff264abd9dcedd10c7f7e9a5f6c24ae2b3430101aee820d54e4b8d17220779f0e572cc12cb4865f4c0f792d8f0e76bb6cc43979b04493ea4ab2c3dc90f56c64bad1615cd171b16ef12b4de8a042ccb07aba181c65af42062fe09cb8c30f06aadfbd6bb34a64327cd2e69ce1eefea37a0641c4386f14a6a10b535dff82d010000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000143aceec56f01c8bfdd9ae0d44628e85a0bb2fc287efc9f46a9b4fe748e7db0d9c7b2660f5610ee650b4a3cc2c9e4c9f565ceca8afb1baa03de4a15b24496e54442c3313bb9ecb5ded64ae63c15ecda5815839cce24391f63dfb49844bab3068140ea61ca4cf7827a31e169b7e0846fc87245445c51ec06efe9f58ae03dc904f4798672cc2bee7a99e1ec0e5e72d864d70625f81f2bfb28499614b9eaeefaf310d629d5c24924b1c82b82f16d10d9c4a2753606e6ab91fc640ec4040baa832ec462435ced98cc1232da9ae32e7afb656f887f74574ecda0805f3e0b2f276f8f7d1b27e09f933359483338ad2a68c898b22e5f7a89b3fd13fe47cfaad8061d3bbc506bd9d1cda2b306128e6df61272044b1d11a5282952c0acc77cce2afaf2691fa75bd0f4d0ab04019b891379727dcb0ff90455b71ab83025b8d6624e8224107c178c52b94a16b1f9495cd8218fa6cd06ed69be120c5897488597e808e542cf5b89ab300078c5c5d46f3b6369b53f3bd17ebe97bffdbc95e606b0ddb4d428ee425cce315ed32093c3b9a90ce3ae5ee9dac8396534b0bfeea9859bbff14d3e8a340f1893684a1d992e58e57d34eeb0aa9934ad691d619868ae2f00729275ce80e714fcc7e5e94899e366e0d9eb5adf851d45b422dfd24ae0bde862291fc449903ea5de37ab555cd524d9256e14f3d7b812e997984e0981c0dd361b541f70c44111cff8dd7a821bc1267c23f9482f81b29d22512341a40e2c5d763f1b9075ec8dd9b1d6881b272d6dd1277f893ec4d990730f2cf0e9b63fc59281e4d874c456b2e43da7d31aa5869eec8894468c5de4b70fff56afc34c34dc030e9fc80988343342feedad20ee5f94fbfb98786225a341cbaa07f2383f993455627a4eb291510e4eab4a503258b2d751ae9828c24cd0e55c7a83d42dff5dc974e6df11550a30d5e1a8f23d039484c497bfbf76c2ce929eca6ccae8e9423858dd5fedfff808c2ed4f9198157aee643796196318fef3a237ce2e47f1322a7af196b723ec3e286f23d14f24fe1ef617c32a5da1243092111654d354ca38e0b6fd300bb0102cbe5305744c1abd82323fcc3f5f3f867184a38b1d1c744b9de233373f9995cc80a404399de1e0a9684fc8b103d2999a74d00453764ebed546b48956492e810d0b6a08cd64413a784021c7825c3f42ff64a1eb2f6d94e679b540321b8af7ce0e0360ec2f31ec2fcd06278717155d49dc304c458ef712451a0d16f5b994f242f4dc65c17381ed24863805c7223a7f870874817f9c230c2270a34f63d65a8ac7d3e624cd97555b3dc5fd194b936b59767210b4762975424aebf20200000000000000009dfa260400000000308457ca1313972982e9dffe8f298270887b982fa4407d841fbe6f519feb41878752c8affac6e0361122cd876eebab41ac106c34178a9f18221b4749d6cc0ab907c7a111ae2c58a3a859f14cc5ec4568d6ad0afc59ad8c2cf34e36f1f8224aad00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000f571ef1ce8a515f7f16733e40eeb652c8e0f3e7c921a5d8d29d063553c9937e2afaec50c3e2ddfe62af972794713e9e6c904810bebc4a37055afc67b9e8cf35eec7954d754641606ac8f54b5ee7d3c367369dcfb0d3dff52ecfea4dd8b6391a09481a2fae691e4b4e1e014176ffe0570ba4746de3048ddf1e45bf394863264c41b9bcf149641afe2f82f34bb134ae180252506b1e79b352df8e521b1727a57d18b54978f72d302fd162ed50882f479efd6ce3b351bdc22e7828b1657d6f74160766434da0884a12a86f215e6a548c3d743723990a040f333609548b3bfed2a1ec43a26df6167dcc08a3463440bf3c42a1e625a306f174de589e4b67b7980b58c080544602bcd0fc43c488a4fadd246648209f6ff0ad8ba5b31a9004b515324144de8a2be9b14a80d81a357d36c1c776b970a3bb0f8e94d651289f5b32e6d252e075fee86feda71f4abc083853d62208e98fc1b1a95bf956b8f6767ecb99898f1c6269284f0d76a1c23b606f6c88c7f2ae52950c41b481e8ae562223f006563802290a3c4f54877d2af635defd60632f6e3bbe5de53e81e1c2d7903b320a91edf8607bcd43ba46b47dd8015eb482187cb7b931d0573a715d7ba4b8016f3111034ae7fbf3ed73d94e1de59e879d14838474734f159be41b6b79e384dd1f08e03142676fde1e36a2aeaec0337f62f0e096009fd3a16aef69c9406ead2d47cf1bd4aca452a6785ac2848c0544f9515d5875da00a47e9351ed6a5b711c2cf25d079f1abf7d1e15df69c59b312c25d16e552f6c8d6845365bdaf3fdda5615824db26f7a51fc9027d73cc649c062fee54e52847a355dd422fa9c7c99e2202b5e3e389ca5519a4d4b31e7d9bf1607fc478770d2f0b1b21eaa4d1aec5762c0197d18ac81f2d74c6548c66297cd47042c3c609451da868fb9e7fb76f56cbecc6ab6bfc86768fcf487558968ca9693fab64f20bc1b9281484192496b5ff57d19b470bb116b9048ac1558268507e3fc046c833940b90e76d5ef213efb35c80c245e4b898848e334213ed83837141697dc9d49f2ba366612dcbe62e67d0ba3de9a13f5a7a2245aa1f00064cea6886ec28097ef1feff7b495a706840560d76e6f80d1b4c28e86d8620fde6f2007064c7cb2321887f47b1bedb7ea30de52a7a2939fa1d44efaf5d758ed4689c904d48832f556c1194756ecad1b89b2092fc5f854929ea9f53f5066a7562bc2fac69e652a24e0117d70c53e1c7aa22831ae3f830a514487f7f9e7abd2a5c858f0fd4982ae91f373c5d010521cf3fc845340161bd638ebfcf1f0872e65b723e3b2223e7a732fd933ce3c3939c8c13a87930f774ede5493562b13f8e0f17dbc4eecfdd781a80c1833df031ca081c874253ea267ad10a008275c636f683460c7b3be2287e8612b57a46004ee3c38b7c423f4f55367deab8e3aa18bca2b1991576c70ec18771d46ca7bb50b3ade33ee9263ccfe9d55d8e014429bf8cea13cbe20904a87deb000ccdbcd8cd61462121c1420d7670424e6c3041c38ef769b68200266065870f68ba277137fb37c758d10c522adb3989818aceca81e836c5af0cdbefac836060b887b7264bb884048f455dd47b833616f38bcad7be8f7d3317dc1bf57c8f84f9e5eaec81a5dc130a24f31cbe568cc8db6d2333388ccaa17954c09f68bcc68ef2b0b2a5a5b3506f447e6e77a440687427eddae7fe602223ccba1fde7b84ce4af29f90f714a621ab54bc332768b6f187ed6bd0a94f9fc190923cdc378c960f07a0f260e1869926c3567cb3d48bc5acaab1ba3239b56df0cb50f39605d6808d682eaa8eb6aa7337a0bf0290f504898e9c9307cad213e8c7ae5c3587eb089cedc996d3d3c2286fa4357dd702ab9f6fab38fe6e3ca7a48e035fc35db44628937c0526bbbd344d8f0951e5425481f63718db852a2837f30daa3e3b073808fccf313e57d3d575d8d48a476f1808ee381cf3e9adb1336f135529fdfadd070dd8249709b11d9b727e86b5e2048f0e907fefa57d1217feef685f35d333f6a02305185cf17a3e724c44a0aa29a8ce94830b59308d24804eb40c2cbe520296bbc99cbf2568f5cc64ba6934e1f5e1d55be64abd657bc537edd768a1c3181838da41b78b7a506dc926b6ea5f7d3b19bb61000000000000000042cc3502000000002ef53df3fd5ee0d0edbf7a24b0a6882421491781cfdaca681bfac061277dd955a29f0dffe2c3c62f6fbed931852d8b9c98437152843d5a03857465c1b67bcf811bdcd4aec0b12f562dd437951e1de3cc03fc4d8b0a71c455e2a105e2803a7aee0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000099fd4b940d0ae84e8e44dfc0db1df11883c2f2e8fac67e648f5585afefd14fafc59c0722aba7fc8c9ed790880fb4f930646a295b92738c332bd9a8f2892ea3ee06b0d68c1a70fbb0cfeccac15d97156bf62ac83cb63bfd04d559efba15a6d11ce14ba67711e3348a527da896a3ca0735cceaa61b44f6d53b92ef40ab52c0d8c4cf98329d5a0ab39aa49549ff637895d2b45e659dca53d1012c9a761718743131fe6acefffbdbecba61045a994b2a7e3357baeab852e07efa4c6f27edd2c77381421b27599aeffc7e99700b661045728686ece54fe7ed8f9846a49abffaafc67aa3e145d3cd7259434fc72e6786b01c38fbaeff4ef2f91f653831b618e99141f22164524201217b5b51d8ebca78f87042ce6babad3c285533bb9888370af0515484d00946019f78c8e69e7e7ee96c2516895c4c55c1b7b190b98db37dbc04f305af5ad0267dd61b5d1c58f2b0117b31e48a72ed17d8fb02720ac0def8123743a910f96e245455f6c07a395f70e6284926b40010ca95741731a72fbd854870c9ad81ece60e3bb321f8f06a14eb95f2185f7c2f26d49e87e11870462fc903cb75fb38d90f01e868e405c886e58e97ccdfb0d5db09a1c6d571f93e4ff2945f78983133b8012a889efd3058b46c520ba76f84c3a26e1c6a53f3a2e88e1cfe23cf18c5ec03d45953d31ee0a611968c2b6a980d7d9706082b58061124c6c740ae0052796bcf4c2c0375440d87351007d0ec0ae39a12bc64d977df9b490a0070de38afe6768c531fae5fb402f6aedc9a576be452cd7a9e26f717e337c13ebf41e2f690b566cb1bbfad3ba360c372f5ccd854d52163558da4da7bf16e400086d72cc2b0e38d71b528ad7a4d9d775842b8508b878e1eb9d9a35594c0acc6d91cc97220ec616738f0e80f14d4fd390fabb2c41b8451654c0f723c77fc161986c2a4c0cfeaebf1a2fd687855b7bd59b4e4929fc9b96b1ac4c7593f8d1d3162a5222788632254d6dc941d592e940f4536a4d40290fa5a1456492e3b92f979798927865a83461c8e1a4589e591e18cb8b5811060d010abd5ce89fe177324ffb4e3d652452d09851558af6a2f8d55055ed3ff9777e730d7968c559247cacab0ff17b07107a48d754f129f19e55edcf8ce13c46767fcba86de3bb428ca70e38cd1e28014c6ecc69bb48314e6393b54b3a2c2a92ddfac4f0eef05340405c8ff724ec69945e68c141918261a4747b86c1120a95c78cf5bf4f565e435afb191801a9bb81afb16c2a29fb7e73ea6fad382524152612b8ed1c3c79574fc3eda9a2fd777cbe992c3b076aeb9c85866bed0f6d6fab0dd0bbf47db12ee0358b1edd484a47764f7414f610b4e84ac6cada3364eece62306c87a90f505c5bf9bd3299f7f826925238912c62468e738660ee5c70d998e577662651d28eeadcfd7fe27f59dd51bfca8e5a81d20089f64831d14fd3ccca8305c55014a19dd11c9a4fff9c2cd2a5b45edc1daeaf906d26c8e4ddb8d8dff50ffc6ed51025ab42ffd2d1b6cd790149e9435ebda0220d3fa918ed9a6fe6da779a0b8f4efea61170e80b992987cab26f543d9668a692c14a9834bb7a8b2b66df41b3043f7348165b31df1918953c6d6f6eb6c24612abb289a3f499d9fc11fe85f5c9ecab2d50e9494e026a931108d684372dcbcbbbf659b8b73e6c90101ea098611d400278738885cc7c6aefe388a17776f78049fbf603f1ad1eaaf2ce2b459e63ec8079b46e754b4499964513d0723fad098c5a8434613b13fe7e1ebd89749f8948c4f7099952a41b91a1c7f2820bdd41efafa1dcb3f3ac39817b1281e7cfc15d791576ccd20fe490a0a9852a65c5c20cb99ca1e716ab07bb9061aca5a92fd88a9e1576ed9aa8375ea11dc31d95cda808beb8df0f99611e51116e15819998f504d1511837d27444535baaa82fd1ef4f86a5a7e77226a80473994f1f964f9ee64a5d56f54391cc405ab449cbf5f02129bffef49630d835b3961cffe1358e618c0575359a2ac809e62d2d5ad3c909b450419a8f8111effa3edd654c1a981c095fb92d394a8614dd6b2230575f87f7f969c103e49b9582a72eddbd82eb2a45f594ed06b869aa0d2f0614b067f20491ac4dc67f056bd0f1b2abdd76d57fad2036075fedd71719bb285eeca09bf6969cb66e22a5db50102471c9693cf85c68d8282cb51e5bc7f27a0418a76396327f3e4f02c01fb8011802d124e559e03f26a37f88a5530dfa9107e95934af47418fa5a5ea6779acd12336883694f1a0b7e71c8de5c3c00a7453d5a0b940b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "63656a", 0, 1641603375, 0, "9dc864a454df0802f2da2374e56848e947bb1c3718062a253a0c0260de1772d8"],
+	["240b834d023e929e0a6c9560499a350f7ffabfaf8b54eeb37fd34ec30392b8fd461f813ffa000000000152ffffffffbb02608be61f5cc6a8afac925aa93c72670f3a506800b33d4a7351f821725b710200000006515163ac5253ffffffff0370e1cc000000000009ac526a65006352acace3fac60000000000036a52523fba3d0200000000026551f4e5890c00", "6363", 1, 372808170, 4122551051, "bab9883db1e89575bf8c1a022f403f03fcd26fd2e6769ffe25e5ccff485857f2"],
+	["cf959f690188fe5193710951d023f5deb1f24979a472a9ce7b1463575501be1cef5690cafe030000000600535163526512bef21f03dc40e2010000000005635153516588548a0200000000096a65acac51ac53ac00f000a302000000000765656a5365ac6a9c8115a000", "52526aac6300526552", 0, 353676886, 1991772603, "3a1bccabe52c681816e98e1f0adf16e0756809f01371c7aede21c769e9de41dc"],
+	["122bdb63017c48d6eaa4452e326a13534253c5898db7ff86e7fc7302b529688113f1c4a55c0300000000ffffffff030594e604000000000004263104000000000763526351006a5259339004000000000853536500635251520000000000", "6a6352ac00656a00", 0, -1085553216, 1953719636, "aa4b3ea5fad0d6a7bc47be740bde96b3e930a9fd21117771e80bb3e1ec97b1fe"],
+	["ebfab12d03a255786bba2a4905fdf0611d52a4b4056ead9d1328cb21517ca241184175a2ae000000000965516563ac6300ac51ffffffff1a5f220b653bbf5db46288d2ea224847c728b26517404e39c51cfad949900e7c03000000076a0065ac53536affffffff69a291604b9a644ce7db5ff7c0509e34f37bede47a2239503b0ef9b4ef02545402000000086551006aac5351526e2acb59046b591e0400000000016aca6a8f020000000004536500534cc0dc0000000000026aacd0ac9f01000000000253630000000000", "51536a6a65510053", 2, 2133438351, 1537743641, "4901b886fa2ccf0646300488d98a57f676a8909a2d58640c577f36dacf3e7c5d"],
+	["030000807082c40301ac893d309b1939423e61ab0eddaf608279ed636fd43d4e260f3404acc73d62dd0300000000ffffffff0428919603000000000563ac53ac5166c738040000000007636a6a53525152c47c3802000000000453655251de71f4040000000004656353ac0000000010a3b21700", "00656563005253acac", 0, 552336196, 1991772603, "8b87aa4d49732571ad34c61b3a5e51b8ce11c184cebcb7356fe7b6b304ddbfd1"],
+	["0c3e773204304479c4364988b80f4114759b22fa036c2a01c624a84417de2234d2c2fd8d11010000000952535152526363acac2f7229805634d3410322704d660cce7db5ceb8d18b4f3f98fa004dbfe72885f93082dc03000000000400510065ffffffffc427586c6460c03e5694e4f1fa63be85e9ebeb04092087450a32da5729157533030000000863516a516565656affffffffcbe4dfb485395f0ae7a4069707c237b94ccbdc249903d79dded40855b31b9fb3000000000700530063536a65dde79c5c034af2e30400000000096a51516a5151acac00f128bf0000000000025351ab62380000000000016a0000000000", "65", 3, 914995605, 733220448, "ab9e6aa016d56c1a64d21d2ace3be4a1b3d1afa94e196dd3bf94eeca37ef70b4"],
+	["0400008085202f8903ffee042dfdda4c8fa02a34003f4dd477add243b5d68b213e60e679aad11e22420000000004635151655af16226514420c1b3f1f957869c3ae7c1901855a3f50e87896dd7ff85f8da25795a3296020000000700526552535252ffffffff7be6ae2eaf4ced67bb3414f07f7dfd72c2ad567af94d4c082d5eb70fa04520f2020000000253acffffffff011895270400000000066351516a0063000000007192c7142200470100000000029cd66cb25d25040ea557e2382e10b5790b74107751304f17f0bf6ccdd14c768ea44052f1fd5a6a81aec1b9b702fa1fa38c6116db0c61050c4aa21e6bdc2d291c6f5eaf378e2f5e2363866af85d0d12277bc473c71e532af5e2c1515600dc64d26d36a149eb1f5093c5f72582937428724ca1cec5e0a6a2a275da5215c891bab72ccf7c7be0a0d249272e495ad2de78203afab492ae2b2df50021cb88b1e404535904166d0d880eb1d8e0dae9503b965b1095fcba5e6e1cf3401b80c997ac1a70cfba259a278dc1a87436c82f8b1f120dbde86e189ec00e975e03634a4e3a9b4d2d7f52382cda58a9b12fd9c4e3412a34494c04828a3be7e8866d760fcf695c4dcd38c96f24c12e0139bf922fde6e3260bbc864b61fb8000ea23acd67b2a0653175d2b619e4b5b4af59288227679c4c9293f359af8a69d9f2265644f5eecea6a01a0b7e71c8de5c3c00a7453d5a0b940b000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000e40536dac6db138ac2b148b89be148d4e085e66285120d99246b56e1f6dc9618737491e30636f2961b1bc93aa7c944ef0cc5c1f723ebffcda293147d3acb196f007dec5ebef46345b7f9c6923526f39c8356b88b0269842415fbd36beea24dee30d3c3e07bc771e32a03fab1ebea0d410e89d4bbcfbb59e28135d1eadb5497a856798690296ac57b1eb6876c6a680cf1042f36dcdfd084bf4067e074d026862fdf737d9b99c6613a0f00bdd50df6150b6126105d04d588ad25512f4a89a7bb97a96e670622aeffbd6862fbf14383a75aeffadacb60ddc12e906980587c40cd7a3a02674a8678e5ec29f674e4be3b5e7fc926432e35f84511aad25001b56c48edc18eb000a637dff30fb754bc175a68c7d6bb897672837fe965a38a63580b377dc3b6b000021afb23ce5f3ed805990fdc99f3ada6f300b2242311311787ec17d21a0b7e71c8de5c3c00a7453d5a0b940b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001cb4569fa29387d4c59e3f38757ed93afb1909598b7bfa4ee7fc4de4e62debc6b82f759cf962f2fccd1fef9065ff591d90610e34064e5425430ef3aa79f36ac21d7f3d7fe29d27c57dc2a166c3ac5092030c76f02c58e716bff35540f311e790c539b90ccd6a2f8d4273ef6990207ddd81d398b0c6083a947b61ec5179addd235004a8356cb79e375d3b96ad1561db4d9a21a0863037b0c98e9f4310fc5b69f214b459fa3ac49b3f783a3576bb47ff8491f73bca8f9a8f6d57e2961700ae0d3258d835264b50bb48b71ae84b705c9b6e2d9927ee9b52f057cccd8c2c0e8ee5041d966b9db8e66ef8860ac82d29df4dc938cd2b22f3f4047243e819f44d4ccda5efd6de8ad88dea32834fa702fcf41a31a9830b44285f152602b31fd756da7a795d4e06323fb4900ac8992912673599e1341e6de8d2de437a68ac0dc539a04ea070a571f3bc56b29d80bedd536478e9caef7c07a2b627462df67adeffd5c7a88b9a2db05181a5eef4ee59f33d60946feb061a16d14257f212cf409f9a56beece7b9f52ada12fbb80f5d02b60777063367a2df5eb58090985b1437ce29b8ea1a5fc416652b6675e745faabc3b45db23d66739e86d62fbf856bf526be5c72cb65175552af3253f09780c95df4ef1eb1039bd157d8cded6b512c3366c734c0815f90928462e02dd20477857ef4b74df1178d1d0cd4f2de90aa35d3e14770caf7fa16159c3fba4fb26420a831286d5dd0ecaecaa4f5e8c50eb1a892da05cf480e43ec2e546818d2e2704722a111125da247348af0289135b704f505914328b6c474d7d2efb1cce09bac89b4decd2ef46b1753f91f759850b80f406d3d4025af602d1d2dd5c9b5ddbe536d78626537868749f2e5bd0f137424ebb7db83e363dc32bfebbb85e29f369cbf5cdeff6b67e721f44fd73461b5c6452276c490326210326e28719449d1f05c14591878d2b0a20cc83e0ba87b2c8585b01a9b4f078d9fb466f222b5638482739b6af7b4beeded6f05073fd5ac25c692edeb09d979ef5191f6d3c66a2d9e36d9d6d4b7039fcf25afc1db3e3c6ec92cc19860a75fd0b390b25253611dcac96ca5553943734fdc34e1fe5f2d5a1464e95e2c0b5c703e9b78be6d580ed33f8a676694a2e5364420ff0a34e4c9c2dc94f98c168cd047cad7f5dc4b63f4b4b52b1f2b03e06d9823ab939bf0ad4559dd06f7fede2d8abea4caba1348e05287e4e6b1487bc5969e90fc55e294b18da108f54b776d78283aafaf164dd662a392d880c6a7e55d9b497015e580c1e924cdf3e27100acc671e9f619df080ce0be367833730a7d6c36b075931dea6b43284d0a92103824ee50000000000000000000000000097a1962200f9993d3de277bf3f7015bb2698946bd80df21f951be4a5a00e866accf39607eb1ab8f35c6ed03442a33542fb532b0c091b2ab21d587398f9fec5d76200b0b53a349363b51ca6f3444aa18671b1389c27178bd7962420a44ec69dcf000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001c59bf9f31a4ec2ae5a04012686c6e10c9115d9a91043f093f7eb692118d8265e36c0166d2d3d0d6236416ab17fa5f0dcfddfe0402e15bab2d4dc3c446fcb8a594e0e03a432b15c55addd69fe776f73670e9e704ea12ebef25804c81de49fbebfbd816a9e8305e6b6b9e3f9bde31136bbc715ca441bcfc207343adbf2d62b0c71c0084cf79f45d16de73bdee97afd18e1b4c089d7263895e23135015cf59c91956931f58cf66607d30b383ed9b9eefd6b3608e995a6630a8c98f3582ff876dd9d52770772a6704e5ffff38bb8debb030fe12d4222cf635027b37b0ec205225243fb03e41c10e6074cd382c00b97bc2e99585a61350d668f7f896cf3a747932d50baefaab94100af55911f247b575cf50f479225d0bdc3915c5d836b253813236d439abd248ee05e4cde13901872382104d93386701fb39ec1e341d0bd2838397281f5b635691625360a1f330e98e1c80fe852e7dde67396ebda12287ad187491082c36d1ee90a1434e5131177e61de6fd602b411f7c2853af7319151d44f34acb7a9611a250c8272b4d420f688ba8b2714ce55e8eed9a0f903d76537e3f969c4dfe72a2a13f7a0c5df434a3fd9612c16041048e2354258e4d88c943fb2d113a7f9ed981cb281329f284e60e5226addb1d8cba4f21a8539f69ffe05e92d0940db6ceded019f93b436c77966a6a5cd5bb208985ea2555b4dc414414e422da3226dd84742950569e84d0d3bbdcdc7035e72ca7266424787064198d27ce3c08436bb8cea3735c5dcd4d2f152f88d05ac8de7689ad837248925c3650f050e5126febffc37340324411bd7903ace901785ea067672e701b0a39390ac4a079a3f48925558f265a8ccf44460586af36cb58b940fb7aa16cfc3ff1d3e3916d710ffef8b4eaa9af16c9c18eccd23e092f9773445d806df0a1c4c684e87595c7950e106cba1f864011818eb04b058c455de3591a55dad2a9344508dfb2530adae9da245cb2d14c56467e3f3ccfd3fcd81d0162ec86505ba873ff17ac99dabd55080d35b8572b1d11f72013c066c9976e984d49baa0ea21d2eab6a740d7d0d85cfbd16bd619ab026865bf9099aae293fe999843f2e369479c69447ec2e638a24361449f4dbf6016a8605671edfde5948ba0d40d9f276682b5895387ff4583c1a0a7931cdf165b8ba74d8a79b53a358cacfb3077f8d6177a21a3f635194aa6d585f62b8dd1b89086455411001641caef5d27282bb17b622cbd54bb9ccb9b711d695b86d7cd5af5a54828ec42e3c709e8fb0e1dd85ead32eea2fbb45a56bf9bde3450e149b950bb4617cb43dfd7937844ccd05c7664931f83baec8b2d9f6b15918d1be175243475bde976b724d8a2281f0badc2f37027f8b7e83874505970157f8463b56ab011bb63cc33fc6c29f224db9554f0e153aeec69443bd303b1a06ea7737137f4af176c4c739a3230ff0224c47bd0e3b95002ac8a7fddb44efb490a5a4cd4820bb4e51edaae62230332d90d8c200d881c83b4ab5e940983ad71c81006aa761946d962921cdbdb1bc98a43b328d2994a5d724440d1276604b4838ff4f3705df3b7e0aca10a5c2b3043c8d1e9670b661c616c8869fe4b59c6a346dc1b192feeaebfe1193dbf3d9435d0eae1f844c64f9267a6bd21dbfe3faa59186ddc666830843961ef0a8922bbded8f4a465a10bf8704b3fef76b3cce49682785dd6f4b2f9746b7d6a3c3528d35df07b988c9d9c4995ab6c439a1425c30461c72b7d21848cd5f76f6984512b4d391c7639278ae26f3e205676f5805aaa0f8de342e7f2b5aacb16a31195fcc3ddd306f8b531e358157f7335fc93ece757127ffa28bdd667f808e7ee3e0965100bb1d59a0c98f5bdfda6b58985448502a7376dfba5f593a82c08e46c84208f69e96d489ddd9b34e985609817d8745d42548899d9075595bf95ea511173df06cf0085490ea2388fab525723fe2eb5d78e484d21fd203d3bc732a4ebf12aba6e745e56844a5154fd19437add0531459daf1779a554276316c58a5a4329aaafd2010279f4c8a7bf7ffb4bc5b8fa626ec3b1dfb429a161b32dc89f9fe5f9831c0b9f33ed91e90f8d74642c99f28a6beef68d1d32a511ec851c0234aef610c99c6fdcc16dc5d2a667e3d800aab5c2863bbaa95385a0400000000000000000000000039785beb54aa532e09a519190fc7b41dadda490b7e04b7c27b8ac77535cfb3c3fb4d9c392d20103b82a0c05c472d7a09f625b2e3df93afb95a5660425e3db389550be0eed6bc34a36b5c276293267628bd22a3b30364d2eb55f8ea175ebd998b0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000067ec4ee615b98bf2e879dae97085a431c6e8916ccfd867aa714fe4e53de00933ae7d23121fd9cb193a3f3685f79a9e27fef42b0c24168caa902f2692e7e2af2346a6f05b3cd8478be9cf5435f8dd959f9438e88c9682aac3a30ff69b9bc148a45db983e536bda53664dba5a1d5dec417680feecdadab3943eea695dc18b20ea8f3c8b4afdce39136141278c6dfacf78f7304cdeeb72c23b641fab6002cc98f982499af9602bfb7e833438d343a5641683a44f9e43d8c762365ee18a59e243b081097ae0dcd8b05505c828943a6c03f831f8916e20a5aff49226bcec18502364cd75781db8fec8f00f54befad6f1d90fc425fb351623a2abbae76a822f05ff51ec1f7b137f88cdf60ac94912fae2becbfb978a5e73c071a78c94bc88c3df1e1aadc233c8c2bc699dca22e4a934e2243906e9cbce5e6080dce8e145538eeb44ad6f315c2a6f6d672441eba9da6451303d881825ec4851669e42e801a8aa65b837a7f69e2607469e9427b53b50298b41e2871d221bd9067d01d0f3397a6f1f82366191753f5336dad97987fe8b0f9c2b2462c933cdb3c74d0c510def659e6f93d1a2827c655dd11df6ae48ef6d6435359295343d6e95036a85a55486fdaf613123202691d6fb72f2dce9c4281cf16e93f8c35b002200e79d522ebf10a1afb0bc7126e66d791359f86164f4ee26a07fa9bb46656772c6df495a4a8e3360ad813c7546a5684c1c4bd5f7c6315acd36a39627e7082686889b1e5100af84d52326316fc2ced7ec855388cf59b9a24f473090b386e54af87ad879cc38d5d5f93334f4db6e1e1427400d9ba0d9ec35be0e55f81afe5648e427286206072d0f2d0b0971790dce4860ac8b0cf0cc9bbeca31e09ea42a603dd5bf1c940c9c9bd7ac0ffe493ba1bea909c34fd842c36c1f79ada05c6bce661a16eaa61cc360bb2ef33c391630ca07ca5c4906fa2effcb0ac5c43353b58a0448a443f301fde80ff21ea96ed4ec9e36b4de44fccfe0f02bd78ffa58ab3697b0be29df837ec9323691bf1f93f5c497b637b4b8281bd8eaafc290118f47a064cfb04757e6913636c8807829b337fdd3dfa8157a167c8c84b9ea6449f0da54a4cf60119c84485c962a2cbc0ad1b345790e729a93ae8d0ded57472bf4bfbb15e3de73aaa3af59a9b2ebd0703f945be5a4cf4b068acc9815690d3cb1036a7678036218b6e70585d80e3668798d90f5bee8cde434a31aab2de229f4c8364d84e69075b287469e586311a5dabf69c3cb7129cd6011a6f027c5f1378a8f81c2660ab915f05bd0ea9775bc85431413faf029cbd26ec2176559eef652f770a7286808266a91747289d21f9650e4e89acdae325a581e4093fe43b40e48dcb74d53ff442b10111a0fa7b1f7f57c058f8b25a7c6fb78a983e90e48d9a410ce44ba1075112109c22b34d0947bf54b668a40a3035a7bd77e9e2c39c6e8d258360889fe57ee5aec5b43a5cf49541fbd7de42b1f5c4d741b7fe85ef0be3045601cfb435621e1f446f640d3db90073ab45048c4e2a044421be045b0ef9b2b8913f6263bbfedcc0de18fef9f7f955a959e91b1dfee1010f517e83c53a1b78d980df9ca2229a2ed10c8490064845feebb6fd6346cddaed63600c30e1f6b0bc55d625f1ed29e1a516ec5fc5640578202d28d19b399c6870abcf6e08a32bdb8e59a99a2fac703e2fcba26fe09ad274221efafa1a2cf045067f050d3a96957cb70f577e9088bdf18e655d571c7d50c14e5ef71f0f753164361a9326d518e8177cf08bf8bdea498b60ce87acc2412999c0abf6402731a446c5177a0d6beaaf884f985cc1ff6c4af561d3cf00da93fefdb1f79b38fb88fbf9066db12b0991352fc2dda043697c121d7801c1b21bf9ffe38dffa629ffa7491d8c28daf1e25a3cd511f8daa245b98e2f6a385e648c6351d4d5270edb4c81d2205583f369f1cacd60aea767eaae7073239716cfe914102f00ca426fde2e324e39cfc928f589f78c6c7ff5114178c1b9a6666561abfcb4431885313ee98a81c3f97e9d437e28c7651b888a76de6358295afda8e6da091415f3412b3125f73606da7aef3de787861bd2ab183aaf1cdeec1dd3c47fbb04a174c672dbd097794d7ae68174678a7ab69a926b31ca0e31341e76e21439ceff2d0e01000000000000000000000000163ea1270ab7d2edc83a116782411b36d253a0d08939c273f365e952e19625d37831fcfbf5144a26473610fa34585d7e261b359fa25bd312f4b3908aab2bf7515433c74b0c2a2ad17fa7ca40a5a17679b0699e25c60082eb7065dd18ea1864d1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000e19314e391fa03e3c0d812c09bfa1bfdaade941ea586ac80f4f888dce0f08e9f98a750caa085e9e1dec5fe1d1861a488f8d0437d374fc61a1cc4003fb3b78113792c3e5511c4dc8752cb12c4de5401b7f0e041631879b213c9cd1801831ae5b49dfcd23d1a25b4e8fe7397eebe10f9158f9cfee31987b815c0144387c64ea536ddbbe5d99eedc5d76041e174f8de4c9c8606152ee361e355ac68ca0406f59878ef7446a06bee38271ab26b8dfea5cbddcf8857b0a03ef6c024e0b9ebe67efb2ac13f193e1c266a11f217acd4cbfde60fff77eb457564b229ea697c954a7bdcd1951033c9ebe877ee7de0e257282df2f7e496fa58bd8af81bd597d04aaa5c068e22cc5d8bb8c8b2e5bf0341448738f3955baca465bd89b1c7d60b1d2ef472927d66a70aff8f772b0857fdba6c23b353432a091ada36c79da491aa5f439321cea47fb2d9945c9b212fe85249dd89fdb73ae97d49212667cd12c0bd1f7b2935ca9c12dbf0f4409968917f75b173c442f680def00fcb92f9b43356052c1bbb73d28e71653aafcaa07634dfe4976f55e1f43208f49aedde0ddea640ec32b6ce20b35e57d2f213e3bb4cc7f4364bb77c5516b4f3fb1148fd33ad21e841facdb8d03a029bc7062f150f97b01f5275b7253dcd5233dc2eab4b7e3ea53b30a58b7ce0fa48301c425f214c68a7ac93d7068f406df14f9fb74d577b239767f38876a42eae3b803934a19804e28c50e19d1ae2c11df0b67c60b1ef773c293d63a6f5934bacbd2afa1650c917cd2c13917aa3cf8d715610b6dd184e8dd719c0968f2f4f15d7744556e7b99b773ec656dfdfba06c7d02ce027c1bf4b2b1dd57a64ad907f874e19dd5d1296b153fe9ca5a0c42d740016122b309cd19e5a5819cfe09a0b4ffb2754ad5c23509ab7916bfa11a47d9c107b61894c88b438f104d360d481ee7956b53a02b60ff329fa43937bf06c3b68584c4eea81373629e6d6405e5b25f1496ec90c4900fa7d9fcb3563e6cded375567304f718893b673bdda3448da593f4e276955966bfea69786a4a635837114f34cceeb28fab9eb7a29596383166109e4b88ecfd0bb9ef1a7576d9e0e76f2bbcd230d827f33e17068aa60eff402538de4f96f66900804a9e0feab294c1f6ff04fa583bb4edeef295c3f30cf42e03b48a5f9360299e380102cc93378d75ab457df917e691b55e9fb9544433ad974d7adb7e53d4b7e9a48449b59b3e442b9ed67227d314f0dddbeff1700f583dfae94b17538810b79d0a8bc2b755f1b2c1c641e6f4d799a57406144c927a18f6a0c65417adc8b95ac63a67b5b8cc6a9964c5552d60d53ccd3c60b03e607774bb616668d3cc1135c13b66746411ecab167a2b4a103d0545a9d6c2e8f0784a155f2fbe23bb62a2e5e270c0f18f3b9ee358d76f6f24089fc557a31176f2ca2fe700236933a72d2a8ca8a1bcf37f14d7733bd1965df5f63f81a27d71ffc1e87ad3040a52437e6b903059303a2e306344c6551c7acd6f5b39afebf719030209867274c535d60b0ec2d6f2129d15c0432c486adc720b04cb6c2c23270b5da30b70a0fb0325de9359574c6e5e48109c7dbe637fe255e44a7cf273c8928a58c22e188cb5c7830f6125ac817813c5e44ff3eee1960157ee9a5ead842b51b02682b9bf4f5019ca04b1f8e9ea8d44628189ed795906195c2d870961654bf26e5f11cbbec3760ca20960c89f281b84138a342e3149b0b77e38bc42a50d73427447b7f1e9ecf5e376facf658dc5dda9f27ac169c13693d027262c86aeedb4953d17db81ff1ea8daa3b139fe01caa969348affd8d03017fe67d3b49d41ef7b8222def91e44d603f4c5de19a3ee4b66a0083b40655c1e41321bb10a4c6f7533b780b161c68083c4189de8737c09e96e051309758b7dd0cf4408b3fd316bde90b4182da1def669d47d1c42257fc8aac46d545b5d490e954dd789bcf78dd533b1e2018b1bbd8e59fe36ebce55a59c66d2ace788998c0ed38d2949f363b11dc381de387f76050f8a5c8d3968cfa20696f3742d0f7831a872e8e104d597eab31e18e3115bbc6dd1eb0679c96a00d2d2221162993ec8e64fd08f0c193f499c926aef4a19c8fbe669966a512f99c4d4b8fd78f038305a3af592722c76e12a761d9a24e362f57a376d66a1d2852cd36eb0ca12d6a75534ba1770c4179b733a743c95dc45a52892e9ff1c3d50f3b594895f40238f73f791a8d3ff267f1811b0d82a830d62c616cbd1c8c2bfda93c6b7d8d5a997e3354e57b51f8489d84e06ddef5034cb0600000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "", 0, -1394292936, 1953719636, "4d3e6066dbe71f08a92490c61ca1d93de8aa6788df26ebbc83d541a9a7ab2779"],
+	["f23a2a7501ca34fbc77ff6836d41cdaef5e922c6c2705a3f0ae93311b04ec32e6ac6a9116301000000055151005151ffffffff0277df560100000000016a41d85b0200000000045300636acbc8f1ac00", "", 0, 1906216792, 1537743641, "9b64e1d3d7870536329424436f71c0e224beced677994192714430106983b329"],
+	["030000807082c4030129a575049a56de87b029e763b59d9a75b3714f9476b7a2bb2dd1196e3c8fa9fb010000000163ffffffff047710090300000000055353525251399d38010000000007525165acac6300d82e38040000000003655151ed83c1020000000001ac000000000000000000", "52526aac526a", 0, 1295051529, 3925833126, "92da6f85304aa03532f2fe1a37109eab65a276e6186b47022b6372d0f3b7d45e"],
+	["0400008085202f890457467b7915f575831a42708dd8470b6f780365e9a6fe2cc5cb383165d579d0970100000008655253515152ac00ffffffffb617b6901e02d75aa2590c26ccd81faa87f7f672431f26e421980ef2456b6eab01000000076a536a51526352ffffffff6fc866a7d405bd274b5e2241139ad5ba9995bee959def4856d56118d7918d9fc00000000046a526551aaabec5b4e70ed54b9698df3f6b555cdc392b7b358e0026f88d625d1cd151836428dd152020000000151ffffffff03351cce010000000007acac006365515372e8d9040000000005ac6aacacac68bb730400000000003c0c7e7000000000ac540f010000000002caf3a13d48af56b9d2d3f611e442b8c320c89a4abb53fb48447622310aacf9507a85e986a0e97ef7021c83969222b1337037acdacb1882cf1a11597745ea6d3859bc3faada86565ad755a06f975eeecf00bb80df92fd22a0f25a8ce77e3cf48e86ca86ac3921b84e7bae0230bea75d6056b3c1bb64d04bbcd78cd375c9e1692c0a84cee15378cf6f568839d8898c9da11c99767f3eaa0d5a51a42ad239960f3ead62f4ab6bd89e8696979d4501a8d8c437bccbd64401080d396dc9d6f8c8c966c6bd26b021cf4435daefb3474880bf41f6a70e4e0b86e714c076c2f9af166bb998db6a52772f3583385dcc4a0744ddcea111bea90ba5ff11526a950734204907f3f350e87975e72d7aa7090768f96717dd233ca73fdc00c077063a18ec5bf4cd4f91c0b9836110bc86a3b88b60d7e47c2707507829d9fb5a80f26423c2f7e272354e57b51f8489d84e06ddef5034cb060000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000007df2f1b4d0d5fde87b35d9ee5173202d80c5bdf9ea26f504553954f4d545162b0070a2c96908d4fad88507949ce44584484e529effa7b6577a4a572fe62c2a1cab13a0143e5648aa86b608ea025e15d1bd7007bcb05e7f74ddf62b2754c5f0a58a185433333262a007b22d783146d60f1ace995ead73fd8a3efc549d2aa56692a83e4e8569defdb86602dcd078738fb51732eb5b816f38b456836e1e939c78a424293a29a0fb4ffed54e35d8305bd40d4f49e9858071533b42283e3d231be20be6063a48b814fdafef5cacc2737f0a2d4f86e21273afe04934055814eea6e65ac25c512ec3d12ae3554004969a76c2b3f7c5efe6eef31edc9a701081bdeddd0e2a106e74a600b8ff0cc15d085870a9fb8241a7ef9d2e2f37cc0c46405c27a7b51678319856f01470a3bcdafe78661c8ee11d9fa84b2005f6110c986d82d6de66354e57b51f8489d84e06ddef5034cb06000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000013a0f8f6e68b8ed98d852921e395c3da8c76524a7c5ec34709432c3bad29f7fc0f129ed5445ba57d90197ceacb6ad75d6cfefbf1e8a52333575e0bd64f44b7a6cc440f4f25697625039af78c0c2d2191d3c7efe880fafba58672492387ff7b83963497da09570b95fe53ed856904445a389b3824561ccc22e3def45eb2af743924f8801e858f3b328b825736ff995f6bddfafc703bf02424144abf1d6c01ce78c8938fe19225c428d73a7dbace04fb26393f607591ac131e94f8b7fdbc1bbb054c2a3138bc9f452b84cd91475a6dcf2811ed4068c5171d0afda30987ebbe99511f7aa7600f91ae6910e678e147c86c54e715d10b570ed8105904fab798256611b25f051cc814a8f717766c2e79a0e5dd13e8b032ab5f3906d878b897887a63cddde4925b63065ce8a83bfcbe6a9335ba82d2dd84cc8cc9f776c54f5947cdf993b12ca68e4d65da506f2dd80dd1a1287e40ddbf269398248ab3ebbe566aee96ddc06a72a0f55e117acbb19f850a96ecf1060211d7fdefed68d1470cc1f78fbee0fcdb39474be816eb09f16ec47866b09ffed504bffc78c43855cbe3b6e4901eda2c398fe20269b27d99e2a2449a6a9ad21373e8d0b0c94384b2acd64f3747c7dd9839f6163597f9e2b64d52172fe7ea8aa6bf4ab3b1d0249f524ff45f64bc14aa45f71809f700db39983e824a15fd059fc3fd8368f134d27d2166f9b11118ea981c428336c01558b76a8b5d9072d795b2e83bc1e119c7b6f096596356d2529637c42788c3d071ab758b86d454d3af61e0c050f194decdf6addf851b49d8c396a069a0325bebca9005ae2d20d4bbaf1fdce707d5d483d443f66f0debc163f84ff7634ec146a0de191ae5532620f57b76c28f3bee32a1546df05bbdb4be9fd146d0aac77548c95cc466cf6dbd36a9fe54758c003608d1f0c71f9b6530a9a47bdd86c6c8e79789a8210972add5410111b3b63203f44592a4c7eaa21d2dbcdd6cb297e6477afaf51e0187c117ea6294a0048e417ea05ab4b34f8cf667b2d2d6aa91592614ac5a88706b8fb0677b15527412ebe8d4c165393993d3f41b84feaa456694f98db36b8f3c9132f0179d155f5aa34f1c497ffe1781fded0be55ef81489ab8d8e237a69e09ae213fb599a4f1811de97433254d8bf22c53603fd9536a3709b72dd476039559e0cec61de732ff03c993be26ac8238481bad00ec9ee2d8878c8405df08b56d4e758e00b126a837e8030e549ce3f6bcbedcac51d53d9df2dfffe4c3eba8e370d4e94de2ea800ec38dabb2890ee8049c1f29484c39698462e6aea8cea54b13f13e0bc059742f803d25707842670a7d870156a33f0100000000000000000000000035143f1fab2986009867ef93aa5608c16283dbc8526d336d136bdf0fd4e37aa2f9a756838e91a59813ccaad57be5e4448b4d571024d461bfbd4b3e12537e9ea02d6e37748e26769c1b4f6eaf827a064400f3f1aae9f816173ad195f9fda020d9000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000007aa5701003b1ebdd247629c11d82a5253babe4f37e086d924038056ffc166a1eb65de8a83f969770912fb75d6905c72e359b2bf19f17ddc8c0c216de7c78cf81b5a7308ae36443b217d9d1e9b8299d7dd6f19073651d6745ad3e69b868779e1f2ae14cf78f3b0863d850059543da23d2b56e047af7e843d577f044e4d9fbe8cb28ff4763ebe5deba697b4b860c0cddbfaf9d5b70c68710d99383883cb1431a2765c4dfb3ed93543a95567f65974daa15914c51d892436bd35cdbd6488ad4a243b409d928b33ca7ebf243956a2a4d9640f49c0f7693ff4e229f6ae521583aae409d957efc018fc58c7aef9e82bb4c9732d84ec642ab66b407c1de33e2753f786d2e26077d7dbf00d2be6cc3410a1b8cac55cd06ab59b029be24b3ae0dc951518999008f6d74cd717e7ebbf2804280ba9cb03042ee33e16a5496e8fda3d9d2ffadb884fdb5473ccd103ee308cdef9dad05f22aace2d2e7d8d411638c555b790f40fc7c4bb584df1875949fb3869d8355acdafa310037c943b769d1e33684884e77eb8a7f8110abdc87ffe19e1f44e4308dd926871a8257a87e2e28c6621d37f79aa06b74f93cf7937173a2fbb375381b24e7391e664ba6a3696ef955f52cc2e8fe62cf6b2539ab22448ffe9037b88beed06e8033cc2daf943880a80cfeb49144baaca9e7a36e8e859714d04cdce55cf219c9dc273fdbd9716c2572a126ce7c96c5f2ec479f1fa421174ca1d9c1cfdb738658ebb2593ce47505fe0c551f184c50059f89846e757834f2c7613ce9eb570bcdb6dfaf225f06d94f785d864b36940dda248742cda6be60e0a18828ee08583bfb7e2d993e16bc69fa5b1a11e25c1cfacd6b34689e9053a8c3528317c25b119bf423518d0740c094cf6389f87f4b71b115dcd1f6eb5b75aaa32655a83549514c95fb4b63a5ee069adb1d2df8f8afbba4fa7bea93a0c43aa2acc63b2a386606bddb6c92260813826e911ca74212e013a30a01bf88979a1106832f1ddbba5b07d48c6607e1853fd2fe4d0cdc901c95d7a8e990977649b67b3fe0cc20ce893dd6a5a8d55bf2311038525b3538b8594f6f56dda62e4654f47c1477e7faae78ff48012c5a2314e865a93cfcdd0d49b68fb0e455d8df85815be4ad13991358c7af2b03c30a1497fd1a320c095dd1764a875c67b6fed685d1eccfdf8375e7469e4a40e34b6ca120085c4b3dfea3126171b05a44946b7daac539c04cf5dfd70955cd5a2ece4b95d37d1a01fb6d16168a8e5637913321be0d87ef1ef95180fc546f116a5a51b8c2c0949ee84268274fa178c2a63a350130f54fb792a80768ab6325d346e3619464a88717fa30b02d5876dbc67a987b9c9eb7db7d92539f6a6dfb742bf513c6acf2c3ad3071c05cc97bc4ee341a44a72bc275eddbebf241f190fcf7d9940d57283b2bf7b6d5b843a88f74951a509d5e715647e78c782f3b2d37de8c3cc8a29655c68e639319c74f84d36c56f7cc6f1bf5a7d1bcf746e3cd42cf535c9a3ff13925e8ca27e241fd3baf18f64a91aedc02d10dbb007cbb1e9d95a17e65c5be6ee7f92014ad228b0e847f197464402f75684e5e559e41728d2efb2c9285b01c94d32dddb720d3ffaaef5d94f7607c9c30e1f7e3540e1a20d4cb7dae55c8b741de4e108892de8ef4d1874051e6125eeeb7cee8eeac74e66f77aed2ba99b6a8ce4f119f4650bf4115c1060a4ccf871039540cf515442c2e186b8634de208861c30cd1b291b390c4f8542a480e102bdcfd430426b750b1114d058d7520c8ced4aef693afb2b75e0c90485cc83448f98c8a90332e6c9d5329a103720cfa5358631f368dd58a009db48b33a3cef482a0e310daf286dd8a5e065a5b621d7466e709d4f80b163ac1ddaa91c32a58a643f98eeab6b57da8f2ac8465ed608017545a64e72f7de44eb42556e29b6935b39cfc968b2e8fc7410ffecaae6f97f2eb7c526e6c73efe94b0c6779b2dea7db3257ec5834ebfb92cacfc2756a70e09ad9f7da28d9a3661410b87afd46534b82be6997b9aebeab9e54facfad86e46e16040bd9f4c7cae643e0eb5a1f0a49aa7a3f81c2f2cee3fdeba804c44db5defff1af8959f2f86511f7e74d031d6b2ee0e40692fef786f076a1af7d4c29828fd02b2dc3edf2582247c168f9b39ac67bc85b58061f4a753938878b24e8c3acfb4edd0ce0b696912a9b2c1d8d0c2aa615ef73c44a4058372cf51bf19de10f93f2e31acc990163182b56ae6f7e3c0087935bf14c07fe38f6181c9c8d42417c045ac769e54ddfcea61a35c30900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "ac63", 2, 1012771528, 733220448, "9d42400c9db45f7f69a77e73727857eff7b52659c744c26006761a57fcab0448"],
+	["0400008085202f8904c38deb6cddf66eaa5b747de4cc0c9c9af1fa800530f79bbcd6aaebd2e766b3690100000000ffffffff404a73bdfc452c82ea8f2b6d581499f2fddae22fcbe8e03ef970bdd408ac2ae100000000035300acffffffffbda28fd76d7a92fd0f1f6d8b00db50531d3622cbce3cd9a700eb193f9237951002000000065365006a0051fffffffff41732f29cb3c49ba62f239aa8ff6175b1b8e56e5d6a6a67ba5c8c311c571c6a0300000000ffffffff04c0c1ab0300000000076a536a006a6a5312600c00000000000665ac516a5200194b56040000000003535365ab69420400000000076a515253636552d1be43ed000000001ef64a0000000000014bcd8513980f593f4ae0217a1a3a0e07970a753fe9d563f79c63c9d7e5fbe494c68c7b6cd1e69cfa9dd4d37bca521bbda804f8d1beb85891741d47e8864b7e540f426ec612d82670f97c95cc06c74ba4071dd28a22ff7c0b7f4fca7cf2825a9f02d77107e2a8e7ee3166f2678abd1ace3c9fe76fdd8c3980f8ab61110ef2dd6c124aaa3c9dd1970b6bf2f0e0f7ae8e6c7c1f9efe91a0433448cfb27933fc91ca817a8158128967cd4f68689a58b393424957ebbfc95dbc71e112cbb8ad37d246641871017d6159db20493d7941e0761ce1a92a8ebcde743fdc7dcd963ee7b3c3bb34f00e363e82bf8d7f7b2c5a7dd28195f3f42d1dc7efb7237cd746b4d0a1fbab28f421e767e783d366c024765f9a5c81fcc22bc2aaaba32f12f90160c7489735305631b68980b7be7c4602fc6c3cdd3ec009abc41842309d66784c44ac9ae042417c045ac769e54ddfcea61a35c30900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004f71366f61092e9e263258cd38a242437109d25caea1903e48d419cdf0f5e16518d17866b99808b18c7d1d8f74d67d82ddc271c1726f96fea1dd7e933121b0b1600f8f539f335d4b66d7972f0f78b479aefbef5e28ed85373b19e7633e25eb2d7b5df197046ae8be67b5c425b78fdf6be3294fab1808f16f4b51e288cb8712bb9ef34e892bc1ef12147c1c276e21657c2c0c80be92586d3aff87ec406616dd2335202d5127ec7c42fb794d45b26c5833fd48bd42b2e46fc8620b73c409ab3141cdeec481c52af3396a200218e3ef9436b4dc04304cfa0a7a1cf391cc1b7a0249325bd7278b7b69429459e689e675ea2ef431ee8e4cf3616109a3864f54cba088e2ba7f27178d55a376ab488ef7ae814041ad4ed6eaad6dd2571acfc69c67d29d7bcc1b4f9382120ae2b722e01fff8ee4ba44c6e5a6d9e960b0219a309b523bbc0c7c15f82082c6e45531ca933a7c0efb96da05b46f2ff9bbf9d65b427aebfb0037d4891f926321746381aeb1d2ffeb0022e79ab7dbfd15b2138cce40db0bbfc9906a5d5b65bf10eb0dcc7d2712a2a0d61c00c066c26a44b34b63805239ea912f3aca53e2989229441db3a3060cbda2d125301b762d87a4097ae0d13e377a31cf7680123a443ebc429eaf288ef8942639ff95a381cccb9c16352d878fde13557eec36fe71483448352faccf3114dd69ea589c8d3e62045aa9e37443dabd868b2eb1c94b51bc30b6f7975756c567d5d53f12fb09dd0d0063c3c0a08d956fe7b16b875fabd5a7ac3c10a4e264624bd78b7f43256617317a57c14ccc2fd42bed98953b802a525b5daa0d6f2d5968b34f9ecc415c157b634920bdabcb047a8a4f579177576c46bc14b8de199b85a8ec3ebde393e9d27c386fa0409a0c6f24691b791ac85f5036040208cc262ca9963e68022c616cd519f272f13e522ac76acad76ee672b353ee9ea3f13d80d401ec6e1c17acc46f7e9549ab40a178449e9a30cb29d7b20ce72ada564d71b67e51b85a8313e8d448e551a6a92e0c8ed9889a6d64550d0bf3a3e10dc5d86d2ef066c2db97e33e794a1eb81139725a4846af2f2f4c2a02d5cc1dd1af30dab85f6681abbc29f83bcca439edf802b299c357aaa0dedde5bb3c99a67eb9ac084a0f0fd53037f104df6254b915d60110ff74ff7942dec85b7c40bc16a93f1dc4779f174d05d0c5f8dba349c9b0742715cc27cb008977e8a55084070b18f9400ba8b527b641734e4e1647d11829901ccfa603d35c6675239d70ff76a8ff8013ce82d28df8a3d1fa0cb52145648f11a3e4371180ded216cf28ea3926dd376adb5f3d062e08e2ab92adfe37d202fd5aba879be9566ad2876719ecdeea9467fd507d7ec93295457ee07007f0dcce88ad1ca4243069d6b502077cff29d9b6eeb0f54358e292abb57ad297da44039964a10388f09ae16a5c89dab262fee3494293e5992788009e4d92686f7cc9ed568d2225d55f6b9dcfc461153d491a673ff77a7575bfd2f64ed2af2fc3777ae1b6ca8ee5502e9c02fccc3403b12ec5e631f6d5dd19d5e4ede5f9fb6c2d2f096066c2af8003a9f2d13dc80b2488e7d010d62a129a59f36b47a8ed9ffd1430143d7894d6e29b93a9c2dc883572db706fbb6419585f894be3bb280289b5cfca04bcf24963d978955a2aa07d3c9c5568c02e32267e77b55f8fb2014ecbcd6b0e9ac7e9f9c28a791b73dfec901a2cbec8ef9a4d8b6b0a6b30b64d034cc9ed5b3ef7436a1ce2569b4e02a84b67d30b039c9a1c24c899343d5a2240b0659cd5f2871cfff8fb3c6e30587569c48547af0a8747bd52ac15758cb0746005f57cbb5538bb7a7ddaba6a031ad85af335a66004126671772aff8c837c718525702eb98e828519af847fd9b78281f5ff35aab1c740beac7c2a1f7df032e536a8af6e4b36cc05a83a0a2c21acd39ee5289231329ca60925715f31b91e05f45c0c185643079a8d24d1cca07281e9c6d2e9f5992dc5d6e63df6fc815bc0537f0685dc42b10dcf591f03a12cc0f48a2593aca2dd116ca394331a75b2ad249b67b52d15c4fa714e2acc697e4b1fa15ba36d4301f578c1ce5e45a5991b8e3ea5dc9d2c8dd82fcad2aabc0ae7e79e951604e6cb28e7af9dbca33f03a9e003b6b0dce4b21b46334c94c6fa02b61dc4284906ba19f467e51b7219ed7f37d39d5e771f20d16a10c6b94359370a6a96649f7d8767764a49a1c135fd39ac0dc728b25c45e31be64490b3d0ff7e5afc6d50ad28d290e946f55e02a2c07dfc78ee4ac885a91076707815856a1d354414c36e59e95a85e00271cf76a8ee41337851b73f0bcf21167937eed0fe0f380e5bfb8ed3622da4aca888113012f5132e592daf21c36ab0c3aa6ea887495aa58374f86eeaf46857f9f4b6726d7669c85e2ef55aa4a59827161ac28bb48825a4ff5970136e98004cb3f7bed4ce0c89a449e46e83974aa03f011c87cbb8dfa6adf1dbd9b339847fb6922350f4e8e0439f60e2ec2a636535f23ad49ff93cd2556c15055657761728a7a30db1d1df2e8b718e9c000506b5dff4c751e8092d58ec2b279673f9eecdab18de986a3f7ada633c5573a4f9b213a85ea9303a1844bba55b750c6e5385dd04a52699bfda3f1822a722585cd84d2b3365d14d38b661e01f4a4a640172f0a30aa0cab5c2002ed8e06665b4f20b3e3d0bb458d19c015756ad3cfe1c06c36713b4a8a3451b34870aeaac025e70f08b5585e2cbb7f8743f4409ea48f0c0b271b6f93ed4597ac3096f97c75c1ab052a542116cf5b1d474463d222c9de1df63b750010088c0349ddc535a53e2e65d24f3e850d01db39bbae197c54f2a74a2a42da30f43e88f531fcc51a988241d721f91095f8d2d9d99c09e5a7b0bbcef0c3a6ba2d1fd69052adccf44e6a43cf3725e871c182ad6b72799c6091fb125c1abf96d5f12bbfe034d977a6a3425f13e59a4923f87cd48c960309a45d7e6bc6f299eb8e4c6860a46bc206de8a99aca4b317a1357e5de293aba67a43278655f683cbb120eee1d038eaf28c2ea1765b8334b8d4e6b6454d3aeaeae8f776a540b90348df52184054e4ec9524a2555ed217838e4fdc1465e9c2ea2ed4b971de37302d8c26fbf72d7b78adc43771e2add562ff8fc49fee1c42e599be44f880c81905d57f99d81a4e0ef05de32509d174d88afe7f0bd2744b5769405d8beb39ee633acd9705ee89fde2181a5c025981971a8b3b82f7bddc822f2d90511cd0a684cf22f92aee7d693ac1c64e5444b4815d94b7bd33cb9081133c2843582f12b38fcf1032604730d5e8a3619afed1a36492673eac05d9acc8577371d1fc188f9e345aba5aa78257325a69446acf1f66802e9aec23146d5de5dff5958d0c3e8156cdd17e7beb581e0bd15f3c017d421b4c51f1a065e1b778c902c1dabec7e16873723e0c2b8f8759693218975c82f1685e9bd743b9e4582c6e303755b2c2e5e70900da5c0531d03899206ad09b6a34a9386d7e3bb29e5f7a586ec8f9ef508b80b7c646209a415d86951c0363806c917347ddb41120849d1b9524d2932fb846ee72d29edc3b67c772a37b072c329c4362a52519934101c28a822c9e39b098bbfcf9ae3e4526036a18639740493dcb0f473a1d3cb1dd148321ecfb2723440276bc02b37a2afe892ea321cda0550c361fccfe7b231c73795d8469f71587fc78f30340222555bf94debddfe75d1d3e65d40b21fef0f3268c3f9be91c6f7d35419088d161f7ebfeab8589e0323cd765804549fccae4270cccf6be07386dd1452b9fa26139dea6cd6597953f4adccaafe72e3a58ff713bfa6186bbcd0c5ea7d43230024e813aee737c1d1efb6c2d33af62bedc9ffe17bd9c5b8cf2b7234ce38a722231815976a754dd621e51a45257d42803e76ec62eb23f93ccc0115e916b0126b2d813e06866d9330860c93c9fa362ce940bf987733b4a70c855b536ee7ec953a7efdedc71a7098f656a71cfe1c7dcc0c76ba127e29709969d8df213302221b6fb5367b1fb8f08c69be443ff27503c4817604bb4bf15bf229ba77be84eaebd013bbe641b980c6333ac3e77fe459198b5b99ef83136213c38e240e6801c9beba673841ed3cbcd18c49484a24d016e1d4c7e696383e548e414960f12283ba991a0632bf66c7fd29a1915156ba0939eda57ee3587ac58e8e6201590fa35eed62d6e66aad234556214227138f489eae46814f3ee5a8b1779bac6effb737ff664a41acc71ff70c3b382e42a2598cb2d853e31c793e00c31f48145608537d49ddc523b46253ccd0f87f7caca11639e4d783aa3b5d177bdb77c470e293805b38ae23ed0271ad12a2fcd2575228e873998e7a1da6da9396f479ae01342ea0dca5094925357918fc6228a255d601b258c26335ecb6ab493d54c454a8dae8f9065c3718abc0b025bfd376f3a7f7b6439705dda4741c98e2027f88f4e64cca1c31068aae6bc8d1b9724689600f40dd316a0a5c7d1ef2430da476a990553a49633673317bc9342142e773b56411ea603390bb7e1dea4524e5eb5d2d7d6a204ee955fc059fffc034dcd0a028eade6d5748fd63832494afbd5b492184ad0582bdc59b1836bf01a686f6de71b46b4ba1c6e20bdd511de6bf7be66bf41d7db993ea985f93d80162669a44e4cefb2ef6d5d11951304d540b29c7ecb54502fa3024baf7182fd9c9a03e7324cfaf1cbbaebdf61e56b050f96a8f25504f8abb4e72c21fb05a24031ac7cd7686409ebbfb88cf1c2e1c7925b39d9e043d70bcdc80519aa456d904cd1492e57a66fd7bf396f35ff389591b279ac87829ae60581b7ca4bd283c2fa6eb383348849ce3dd68adea2eb4d36dd7322c02506e9da6754e567b10bfb9c84a1a0598cb6875949688126f1fc7334c13f01d43d0762c627b89f600499a65616a17056043c9b43d537b7f9cb39b6505b6c3a836034b9d3c9e6a4701560648773fdf7744eab69def4b6c38a3a24c5703781f4718c30ce80c0c3a8042458e5f2f3ac80868f94cbf1c3850169d64774f2624ba6096693055309706cefc347f6c8a78dfebb43d3fc4b69cfde9540b1b7218d00d5e8d9c6c37d0a45f4cde7fc0a4510016c1ca9444d0b828c574d429fbdc3cdefef858db3464b642d21241e573930bffcfa2079c7e3da346fbfc668d9551f1ac2a53d1bf10e15d3d057bd5233b0e4409ac227f8aa5a52b618690ffaf36dcdcaa06cd5fd8ac23907cca5a97a6ba49808dffb066d642462fee4824b996a300cb691569e6cf0e463e3e1e24252024cbb7d9273909ec26865b140bb6cbc87aa8758d86cce8a472c6a77382d59ae214ddd1b8cde7bc09cd71b99de13181d2ff465718819e643e22c0e643f8757829dec429edfc7006fe6863501f0e279040000000000000000000000001f72548b8c97429e18fceef75ded2e7c0b4f8f664adf9fd2bf23645b280f1e19fb537aaf0c63ffe0c03d30a1e306673795e3665b795287311138c9074734673c52abfcaf75f3598c92a0295db6b622d63c089e4c1c26f4b49c24d2b9009ba669000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000005549b499f7906d3f2f69f9314cdb126a8989ecc22ee72d45b0039785e13910e13c147e4285fe7aea01647074d4ae3ba41ec3b1d53f8c97dc99771ff81d5ee4455130ca1373b2690c758fc5d7ae003d739c25067cc6497438052e9355b0252ae4bce919a5243a0513b7a1229aa5eeb0c5064674deb82ece2c8fffd692474b7ea91e15d3bc58fc149f2a63ed50638b98742819f98b19d85fe89287f374c23c12c1c3ff4735eafba7eed250dda38b035e862beece67148e3f3e4c4556f76a927be2e0f472f973df9e5a0460583aa404186fe2c3820e6fb873791b3dfdfedc0b15f613d5a7ebf44bf7de74037cac5ce006688ccb685d51a76fc5f14c1112a473fa16f24199d2225766b4b8d777e18bf9fd51ca326a6a0ed4a2cd7caf8cbe8eae035b949695527bc5362d1be2335ec98e84d3b023fae187dd6940dc5437e9383666096e63038225ae1de1a3e04ce441c3d60af9866fd8eecf40b17999d5fdc0e7350e036c4400ae8f6b672d92763f54988cdb3b5d915deb614bd8bc42d103b0ee9b78548409b55a147db5a49f61a4fa228e859479f49a249d03d68350a4f612ae4634fb64b1c8843d127a463726d0f40ec30d253dff4b637934842955cf0199d90f5252a71c28920a274b5a199d4affc0a55dba604c90dbff24162d1a20ae1c52b7477871f780559366b5b40c3959450d203241d77cdfa7e8dad86a59994ccea3edf7e8c17fa7beebecdf8955da9dab21c1d798860081716ee51c37ef4c8d045964f96f757b4784e28f1478ef0cfc917749ac5635e82ff00fb83bd0fe8221fd8960ea367cccea18bdc4b48cc4dad59bb2e23b3b3f97030676a29374f3191b1babb36c30c0f394a12cbeaadb669c0524720188c9fc116d19d44e1834dad27cab9a2ee2be83c4180b24a0a4e02bdff0b9c94a24d130a02845e290f0548734f83afee8c32a2c1cbd706157db7a4761e78b59587c66077b2fd4fe8f1eef73f7721c884303f79b22b08ab1ffaa1de23a9bfa6780626db3eb89eda4d5d0e1a7d1d80605f497efdc1a860b7a50b4d40fc0c4c1601047afad4446f9c16aa594429adb695b845d781dbb4b9e2120c90f792d1840e61d958b6750226f6685c2039e4c3fc1b1eba3b60a321b74d51a0a3fa8605904c39ff9cb93f33b2769a3f84351a1797930a7b3b6fe2a748c88c4f1db080993d1a16945db0850a81d2b01a919bd40c050564db729d4f0760f194a2322322ca09d790d70d9e3020b765f114411775100e3b682fa55c041861c01ac80e0c3ece1b76dccb2d29a31d9c7e71f06c7ccf780c96580d835e936b945db508405f64e6f31d46c2a9656efdf958c73b514dc77bdb70337d201f1c1cef8a25a25e9d34ebfd821dff881e47cc4878a2a5b93bf9fdd3f6d2b2d84554f5f21a90c6748be709d7cfacec23687cda10d71cc207c8df5ddff3af2e8a82ef34ba295fa58c780fb80e5ececfcc50e4e1accdc056612dcdc507d18fc45e40a35053891cd806e9e87ed45a8bfdd7d612f27857c45f31462bb71fc6a833d8649a109a2c383843639eef3ffdb4923032f9bdec0f00817bde6181de3d0c9187e054f5998891dddd58aa9aa71cb9e427eb6721903e3f2a69762f43887ed9fd6d15e27c85d60772cd28bff6d6e8200031c584dc29b821b6360c250986b857c818f8be7a02aea2f509dad0b22a75371a957bc94ff30316994a4b3fa7eaa528b61227c69105397b0934120f098ba44077882d7cd70d61d09f6acf860eb9092f160c903e1c0ac1d0bdc54797b045a6d22a6c740101129f1a03db799f7f0ffb889ef092c82133bd2ddd5c21b5746ee0cc4ff0a21f6c06580c66083cbab0722c1899c2ff2ef53c99a5bffad0de2d7bc5f030fc184d6ab34bc919839924d3160637195df5fa500aaeac21cdb08b040a04c678fb37ed3c560c9254ddb70b40af2c1f663c8174e553e98e309f1c166a48fda110c3dad5a003f1d09851b419b15ca0859e910c404effe02ffabf94a18938ec442d54c9bdbc8c7fbe8345f040c174be599a5222d61de6e3b28cbd23e3ed18657912a9f9816dcd654d6c7f4bc3c9e9fb1a3e3bd191f3bc9b053c528267ec5380f3d904080756d175fc1ff35e95ecfd38863549a2201c9e2596ea1c113c6288f6ee06d2d72108fb15bfc3aef7c9a04854325b014a096e343b45e35593f728a5b6a55f3dc4f65ce34a74cc873ac38b08724ac345a4f91d639a296fbc0df3a467260492d55f1db45add04a752fc6922bf237ffb2021e14f53a327cc60ceae7b99cce227fff0600000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "656aac6a", 3, -1912849419, 1991772603, "41bbbd737beb6e1dd921073dba7ddb2d97bfa24a7f714990ec9f4aca0ed8eefe"],
+	["76ae0b57027be9d63de1939bfbfb8e9620e7b6e18daa427b1908ec1c8e96f8eba4648fd0020200000006516552525253ffffffff1c8af67e4d991e9b9a1680f22789b156e2c241e4d07e2e5a9402301c9519d7ff000000000151c504d48f040fcecc0300000000086a6a6353636553ac92b440000000000008ac51515153525353af0a760000000000070000656a51516ac11a8f040000000004ac65ac6a0000000000", "", 0, -1736577881, 1537743641, "0bf40da491e4630e6d482a7a4006279681985115f047a6918312c17b2fdb5acb"],
+	["d0fc9c4401a429bb161ae933b7e4be8f14679f6980d2081e2497adfb0056ee1aa956796ff60200000002005168dab9620317ce42040000000004ac5253529ebb9304000000000965ac0052526563006a3eeb21040000000008ac006a5352516363531da03500", "5351636a00536551", 0, -1398551587, 4122551051, "2e1357ed2503d73b437003d5c689634ca3cc1f9acbef5bbae22dfb8452d56392"],
+	["bacce876039fe76ffe24a8fced23c11754fb06fedfed661a6c50f57b6a04861ca3d9d5450900000000055363515351ffffffffbe16d8ababef87f3fef69e77f2ac194b83bb1364ab820b2c900875ab0dc10911010000000765006563536a52ffffffff66add79a4a9c0581e7332099facc23b1f24cf09fad35a1f888f98b129a787e2700000000095352ac53006551655294b1318a033f0b290100000000030063acc0d2540500000000046a65006af557af0100000000026a520000000000", "0051656563510000", 0, -274381026, 4179206552, "c8e1fb6d6f3dd0d5f500930d69b1031ab89c75c21378f2b67765f5bb6ce94006"],
+	["5e324a2c04dc2439ca0140e85d9e2b5c0df854c59175cdda3961120f073449cb8602a00078020000000153ffffffff4e8047c2d4eb4708ecc13f8d0af804e6a154d827b1d040b079cf1e6240ad14550100000007ac6a5352006a6348b5c84b6318071e585920d1f6f89ca4a90b10f285604e26e64f335f54e2e51110d8bc520000000000ffffffff9d377ffb3c2838ba0cb8e17c791ad21bae6a92ad259c716fe9e7aaef657c019900000000075265525300006affffffff039a572305000000000153e3bcc1030000000005ac0052ac511a8f460500000000040051630046ac3c1200", "ac655200", 0, 975650306, 733220448, "9d111ebd431bed4ce71426895c93927e34a2ed7014cb27e2ef696969de532f6d"],
+	["030000807082c403016f9bf7445fb375b0f705a6ff42bef27fc99fcf46960e5cc9918d3d6c7545bc7f02000000055251ac00acc6fed31901bfc065000000000008ac005253acac006aee6438fbbb5a370f00", "5353536a", 0, 406367515, 3925833126, "df9afd66cf233d890dd4951767d762e36982a4459cb1d2a9716d364c9a1e4e30"],
+	["eacd0513044dec26c731f81a2025db43c498489ce9c1cef52b8dd0d2c48dc439bdac3dc3150100000009526a00ac5263ac6aac28fb60aa6200b84eb203158dc81b074f4cb7b84fd5976bfae0189365950ce8793d9d5ffa0200000009536a6a5252ac005351250d94f596d1ccbc21849517b11394476d1c5d2e247a0d33ca229634d76b1bfd17e1313e030000000453655353d3cb8928ee9d33d5e895490fbfd2d13dd5ca68713e35892a776337411e26b0022157c8b902000000086a63ac6a5253ac5237e404a8037ba57c000000000002515194fa830100000000045300516379b3e90000000000076a636a6365ac633926086a00", "5163", 2, -1893968969, 1953719636, "c8155a9a6d9441f4f33f35ea83f450a271365315c3025353334ba8448c09351a"],
+	["4cabe43c014c7b8dc6fce6529d841c86bee1d4f045ffd179e409f50279fbd36cecbabae4b5030000000352ac65a1986e31037d04730300000000066aac53ac6a5395923f040000000004636353000b1cb20400000000066565006a6a6a0000000000", "6365", 0, 1637410665, 1537743641, "a50c287da4d1f8ae2b574700c834959dae6d3ae9f22a1f6bbdf021427cba61f6"],
+	["06498b7904ac9463fa8616842ed619ba295a8a40e2c905ae953071c064b4067617fcb43b29020000000062b0204d499e0539a86b3a217f67d8b06f538071a22a07d265af7cb9e6c279dbdb618ff001000000045200515293f0f568ddeb9328938808807ec435fc3045ac2cb363c94573c7cfc7fc91da47a609bf45000000000600530000acaca3815411000ed48839214a4432228dbe8db312bb79326dda366000a7788cdbc3d99bb137020000000451005165ffffffff0369cc7501000000000853635351526500530e5b450500000000080063536552655300ae8ad40400000000075163ac5252ac520000000000", "536a63ac6a", 1, 1476382369, 1537743641, "496ef109bf2e85ce44ea22ead77397f1445cfbea40c002cc150e9420e067941a"],
+	["030000807082c40301b73bcb75f278f38c8e19f17c1cb9651c86b26eb473f770d1a9fbdb4e6210b14c010000000014c199b5028dc62405000000000251acd0e732050000000009ac536a5252535263009bd126541e67a20300", "0053536a65", 0, 1820880261, 1537743641, "70a83d34fcd2c88f491c110564ecb6f95210c45c69d9d22ca95c4821d6e0bb26"],
+	["778d4c70042ac5c539e4c91c025b142b53524eb840cfbbae89c454a7e2f6170a06b8037b700100000000ffffffff32885ceb2f9037c7f3f2634b00be790e890e9f680e5c5fe2c876863c591c976d02000000025351ffffffff6b1c055bab7c258bb509c3e7f5f92fee5bbdc6d84630c0bfb31cd3cec252a26102000000026a52ffffffff24135510bdf7b276450271d017faf16e902a1ffaad50aacf50484574cf890cca0300000006510000526565d96f85af04e4d30105000000000963536a6a635165ac637982ac040000000007526aac0053ac6a7b1fe9000000000006530051ac5251dad16b030000000008ac6aacac5100ac6a0000000000", "65", 3, -39563718, 1537743641, "026769cd326cc3ea0ea7375e34061ead094be6a71930cb7da91da51f9f57ef86"],
+	["cb92747403649995bc2ca5963504de80bf5101f58e7caaadc4f55b36d2fe150d1800741b5601000000025252fffffffffd52952590bddd12b14f688172b3b6385305a8706b5d329a43bcaa158673de6d0000000001acffffffff96489489787d9d21e024e8a9f50deab8e4a3898766db44ce046d9548d05a583403000000086552ac6a52536553af7bccb2041c2bca01000000000952536a5200ac6aac6330a46f0000000000056a51656500acd5d302000000000765ac6353ac636a0291ef02000000000952006351ac515163536ef8a95c00", "5253ac00516365", 2, 1088457301, 1953719636, "3f7e269dbec129d3530b9c656e817e67eaa3b1a67469f4ac1cac9579a49c8e46"],
+	["a1dd2f4e02888b6cff5e22613b9078841be3542824f8188286ca14906ee5cbed83a2aec3d6000000000352635144db58cd984cbfb461d82b48ca08f9a4597688d8458f3f01cb2d12fbb1938cfe8ac42bb70100000008000051ac65ac516517f3e44f027a165401000000000800655363635151ac9a074501000000000653525151636a0000000000", "00acac5265536a", 1, 1813030224, 4179206552, "a6d69e6b05142c6ca958b6a736eafa23da79af7f3428ef2a1ce5888c857ae4bb"],
+	["0400008085202f8903ce3662ead4c08464bd039f5ddc5e7f399daa34452f506fbdcbd32f98effde15c03000000005fb821ca485845dba491ca2a264046bad43368197cf6b088f51abc944493c7116abb3ab702000000096553536553516552ac18b50ba372c2a1850cfd7a9aa6768b74a1c8efd4757a57a972a2b0ff236da21393456025020000000006dd165c03e62cfa000000000000e4e6f00500000000004c73f30100000000016a0000000025e7460e91e236050000000003af150c78d5f0234d0877c1b8c6d92c1086a811bd9f1c8049383a161054b349d4d9e2bbc17d408fb03c2d3544de9e61385b0586e36f1f742020a382de9643f1412414e862f7bd858d20685d8b3d861d2e5ef3098b037559d00680c037b5bbcc98ee77a2d1b948cfdae94bfcf3a1112e39d1d88c12bc448c504e82ef2450b55414f24ead49b03fe17606f7dff42acefaf253fb6e397dc25e95ffeeb2e8145a485535e05edde9e8aa9fed448aabc6f40ebeaa788be8f0ae2bca5a3bd7962ab2718e80cb97322169a8245cca7250aa93db268258ad4d77cc3eac04c03088e75071fa65cf835c95be1df10ec6d82ca103f541512ba8673e350e1473e5996621ff90f6458a007ea3d2cbfe115714bcc21e4c566dfbb84047a01e88c667758673177bab1b801671f07da4569b6f9243ce3df28e77a9a43d597ab1b505299f3204fb63a614f53a327cc60ceae7b99cce227fff06000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000e60be3fdd6b57d4f8067beb1132c5a8a5218a93578eef49feb2532835f5b205c646590223fa99e2077e8274d9d7d267ca729ae6b971eacc340acf1409e7d3c418866288d4aeab603370cde0f6301a44c6a53d01177992a74362f46bcfb6af6a83f983784a3c1f5b5c92baa26ed9e483ee4ad2aff7817fada470e6204d1017fad442878c35d116ed048f43560a483ff9e283015c9f1d876c6fbfcb7ecc2d5d3f439c036851b957ec4f7bedd894c8da9ad3999c7115e51c734cee462504d25a727d6e2663664d2c0b303b975c2bbd86bb773d4db72d3db1bf1af3c38624d38242a2fc949d2b3a20bed01cb4e42de987179530ee55cb19eeff79e87f1ddfb6ab4790f3e50ea79fa28d9c91f48b029349628434ae71eddf4ec9dbb4abe7bde11721c98a27f959705c664fd9998f4b94cbda32a3fcff116a3afc4e95e4313294731ff14f53a327cc60ceae7b99cce227fff06000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d2d6ac57159193bb865567197d4eef5529c88ab4ad483e1c883c3adae15d2bbe6cb434cd9d4be05646c40674263d0af6f6636e7b569f687d77aa933beecb673b1ce2b5aad05608c8ec4ab211328b210e901a6df751ade07bd08611a706bbaa56baa3d64b3bbd68c6a5c6694c905dcfe781c3c42607c473b2a2d10ff2b220892f8621b7e81b2ba8859a9b96ed353d4aecf6af23d46f562c2e00e290d5c2f873e40ec3bd46795c1b59162c2ac2333e5309ba7257c6f78ec9a8bad61e686a167dee30c594935a4781106a9be34163a72c6134ffc43c1c905c3355180ea5e7cf6ae033a94de984e8d1d908841f2810796563818aa8608469f146c267f4d29502cf56a5fe01c57845313fdf9942b46ebf3fc62da010938062381f4e82c0a8802aa8f6c1a5d6779cc56db9066b511e2551e96f53954ac41c654f10e949685cada8ac0014f53a327cc60ceae7b99cce227fff06000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000049ba4c90ea2d948d08cb923b75c21beb77a81c2f43c6348dd87343deee550fb480d132e2c485ca35130bd503529e2962275ac5a349333742e2b4f020c4be0331f48265f04b9c7fd2b6f5451c05b1210103da3333230c44a53e66eb8ce0a06822624d03dee5cb0a127603db943fe9bfd287e1610f88f6d9551efa649e30b25abae2334aa210827035ed816199fd3d5a80855271bb2cbe6a880cb0adf4c39d3d9709be10301f5f9b2f4cf1e1b0b077c55fea4263e6cf2c011328809eceaadd5cc833a8a6216b209535767eebcc3aad5790d5ac255570ea7accfed10f2fb2d5dbbe2f413e0d8d7705e9986f0e363e27de7d64808e1901b5a36c9a4a9170ee4f6c92c2e749ccb5a04e6b32643862650c4ee1b3c73bce960f7a2cdc4497431e1bd589e251bed6eb45bd952421e6beabff87faeb8451ad33f8b7c0dd9ab4dc8bbee4ae39768831fd4f1ddfdfae026c2e6f94244acf8521b41527ff88d1ee938bd7c21aad2ac25507706ab591d2fa2f8e1980c276c696614397932218f9682fd16bd9856fa81ef3b8fe24d961255c469f66cebf4325de71f96a2dedcaeb08ab56ccf40ad4e8b3a07d6280098b2a292089eb6b285455db9206031f31751ee4c97ccc5926a0b936adb2fea82ef12a6df63de8415621d767f7d7ac31a50f8061b46fc850fba646714631e7d02f8b10c91177bda946a83bcd6f2bdf2921af211897599b515514e6d32a4adf7874fc70dd4aaff44a709be65aaa1c887ac76d60cfb44cd308dac0116f85c5e4dc16736dc7cb4b85233e92258e50d478c163ba636edf8d36cfcf1b88a3b518c8718371da973727ed7a20a3703b48255ea1eec32470f67f46714bf839e3e154ba0e4ccab554dbd9c9e76625cedf96a86c90fae5a4cea3ec036f24799061e040a63ecb49372d654880fe3a218cf62a114132a85c98b5a49b1f13728b2c9c861bb0fc227c60a29343f56c22f2d1796d08ba2d6582d4a4071dcf0323d39b8e04f1aef339f24ce7e886e100b34014aa8f211303171a54da72f157348f7145d4d2c985ff5973ae805753b245683454114f1ec10e7d06eedd8bfbfd8f265847acadcb3e66626f0c22fea828991a8695a2843b6c315b903e5b2e59fe9af7fb55f88133cda6fdf19d987b744a9e9b51c85a2a9db14db4bd3a26dff43083ffda5f45e40645093c96abafa1baa5a1e7b7dc29ee88991990720eafd463a2055418450dab50c305a9810274533fc38c10b8a87c012a156b7483fca3b67dc4fcc95a18a2493ea177628580b69a099b706ef0c2ac7dfdc9a345d47770f4800f155d7962389d829339fa43aa524f41e5b9e2bd006660916b7b8fb4ce2bcf552662c749b70e8bb8bbc959d2e28d18fe5f7f77cd84200360fbebfd15143e20e1a34cba14b653b3060fba9aa0fe8704eccd161bc87faca1b1d303d6c222c289dc631662104c9f1192c13686cc1dd3664109c787f7651f795989a5e840faa1c2ecfcbad786530f1f6577c9c98d557a7e1b020c4aab285589cfa214556f9d432175b300d5020413a2e16d9b53a635b30175cd9a3d1bf3a82285289661a41fdb013def8086d4a1a0ae1c80f8fa757189d8c8ef95bbe5e7ccde7eb030f96b49679e1193a7f8ff5c93011f2095cfda6b8933874250d2733310a04d8c30eb940054772ee251465c61fa1ae11c9a0b5d53f2e19e43122e911fb8b34c9aa7ffe422cc2496cefebbdaf2c8a0b60bf5db7daafcf12dd5b81a6dd20480c3a2887851324b87c25ccf91381494b8bb087a6ffa2e7ba70d1c06820ff2cfea0edc81b24f316b65467630ea42f5e075fcbe5a383ebed67401a46f0287d28b1bb76977914efbaa6891f1dace16fc05e567c63ff70c75fa712af289033179707d5748a11699baae4e4ff82b89798c890438d7a3ad232507c6cbe2ada39c3f801c28d9040d43de0fd50dde2f81b9e1fddb325dc759b1159999ab9e197dc113e575d8142c6af606ff0ef5cf4416e1cc7e307f0ae2283c224c5d14e7482079e60f0c6be42143324891fb053540ad73ecb01c537f0c22d30cc3298207b6cf545bcce0a3039bf755c23665fa542591729ebe81e00b98c2ecb22a3f48d86198c8e8cd19bbe8253afeaae9ead58b5e165000ef12be80798b5acb90d9ea17f38a030316e024987fa6f5ddfde491ee643fadadc198bb84c217b6f3376f65c3a51828ec9cd1f33432ad6dbd049290fd98bd42f859aaf43debb5ee886a536a9c9ad53e801c2944568a38b433cdd43ed3d744baaa3a56e9ae455b2e75ebee085a3f7dc2065d3e590dec79cda40663ab59fb1cd186cb8ba0339fc1d67d72dc07d1a7a7060625facf6f5f5763b0173d9a14f10d1117a1096a74013782f4801979ad4afb3825dff97145cb561bcc595ab1840b6d2e242ee3e930f2ca70c3f5d6bf2e0623b2a158975f865fad59017fe805d09158b53c411f142f17ef2d5d90715f210879d35b1095d1249c800f18442ad7d16953d6e4287c89e1810a91be2facf8b900494f5060e432278a574216e22605ca5b90553ba7ab7068d81bff35ebaf8fdc0beedfcfd1afd9180f6038122f072763d4345514b1613cec48a963b4962ea6dbf838ab8e7a8b9c129b15ea593a49ebde02c079d81438d8984c3bfc157d3750949179d44caa58f886a0e805405df4dcbc33fcf57c8296cacb7800ee8e5e9010d2d7003efde7860e712d5ab56a03a6861e9efb845e2099d38c291aa7024201617d548157a6495660b03120483ae64f0bf46eeba8a173c9e1b293561c2e626f87a094bfc92e6bfed338c3dc4222318745e92eb596f20dc54efcf2bd7fc641f92c9e1bfdcbcf7c99bbfc605f230bdf407b73dce7cb9b84c77bace45c135d5ee8b98b889a2a5870f3d553f604ca4ee44379fb3204ed537d012c99f3cb33043029706547f36f1bb847654d2701b0d01294016c65eeddf45c4fa83b0a0d070ac8e086845f2cf76e165fe64ceb2379137bb315c2dbaf8a2f731f8df3d67f49069804497180460282b421838b8c33ee203f00a4e968073a2e0f7843788d3be15404fe56266e714c4b0d1dfca46619991fca2b9d4c2da3dc837470665606b48e8207213092a0a77e512b7e3f5714d52225e47e16f6af633146d211bafa0c20872918cdaaf98f43749726bfaed74bff3a770b51718c1474a0e7e0725676ea61899170c622de460bc9911a0ea5b66ee204f3b608be97cc2c07129ce8bc78ed7a6359be27c174fb2679101dddcf6eceaf3a69937bd256e73385bb994c1d577bb995f17b4b545b0d51dec0a6c9e385f694fe52f02c4bb3cfe24d21092ef1a42975a160b77057ba5a70e397841052107f769f72de9361c59b3445f04ff80ea3d83d8492d9a650c0d24c29ed36b5fa0bd26c688a92bd74bc4c1d2fe120c66ace67aaa6648e11c61a4765aa6e94cea1a9c244b0044f6e9d420698da746a1ae95077f111f7ec79dec24dfee9e4275c34bdfb14bd8174fe78d85edd795093f943bbdbb9f1bed978576ec6cea1ec40088e8f6a8573502f913b8845b149f7fbb087ee7f2836e6789ed345bc1d1e7cf7d1f0ee81f9a05114985a63aa5c8dcba82a7e3281017f925d46c3cbe54d3efc1d65322e84da64bb05a32928cdec105c04cf47e88ff5a90aacc20fd87493cca108751fc0b1393c9029cbe1e80f6e1cb84eaca692ddfe65d689de1a18d11471f4ba3183faeb7a3d44435aef5b0c83e75b6aadd88c06eeba0bf1220c929d4828802e6ac8855983c7d1afa05036d4c4ac98400afc1e4c3796b5d36d939bdeb64baee642340ea1b06a9ec459154cd6146dc0943236d31830e0191213c24e684907da341fc9e9ebd3388f937ed29aac5161f024bbaa8ee6d79701c6ad255c23337fad83911c2874eab16797ad5f204f5cb2cb2a0efeb9ce5890b9453710a9e465bfb8dba1d7d1471249f1b9f55fd5d15bbbdc9e2394776e9d59e820612db7a14b1dbcd178837bfeb8b2c4e2af46299d7ee29917c10aed752194f61cb12c455bb0f0f8d037228b899b17ab2963857fe3521bc17d4e50aac885ba0e637c64193024efd89e1e4b377bdd44a3331989d74b74806fae1c767656da00763d2050ecb1f0b09b6597c098944df81f7a0728af8b24acc92ee7df83358c3f46400c20d84e4460d632997370ce2a2120aa7ae83437f0a8cd446fa2c1542c737557134816a43707150162a61ea54345f8b5c988b6d38fb11675c0ea91597aaeca4f85ff3e1dc3e0bbda354252e5f9767a9661532fb2b780aaaa70310506cb17fa3be3945a8f5a0e1dac50641ad9751822fcb2890950847b66c7ffd161f5046715f9dac97d472e6a4852abadfa7ac43e92cfbb34ccb2dfe2d50625d881f0c5ab18285a2f7679d20db222a0d8bc25a9d4ff8bb4a5b4ac368a9ab089dd2f5365a60f25412b885bb7f71afd3a6c2e6461ab5523188895373090851b28e8f4a4cd29d41ecdb4a3f3d400397292e68742ae0dbf9b1d740a1721ce75905f4400587695a116032e564c96a9ad566be109020e2634b76bf9a5bc57afe8c502b3695d1a9e606526d90bb241db9c8fc260774b53e5fcb0a45f340c5c6e87f9ea35bba83dbd4732d6a3a9475f28bae64ed453edd8f7de20ae3359b1ed4e703218c20c47a19a4b0d816ab8064056acfc5267d7404fccd0114bae08b193578218733901a67c5d4f0ae60caa801f7129959016c80f6f10dacd5a028e5f64ad7bc498ced999f792ba171843b4f4c4311642792a975e77a4c83d73bdde4483ba4d7baaebfb2ccb6e7c4f1f0dbdb1fff3d71dfc2edf8d08598fb715f4ae82f7ac82de92b6a0bf9b68a6c8201becdb647709835c36986a7eb0c10ba2be1e5718cdc3f055f290cbc82ce4f7352305b0609783ed8b7f188181e42879e252dcbcea3e9f58d415779c438b18f9917e57336753d8191cf21d56727893fcdf939530a51d067ab83ce366c19323ecbf7de579b49e75f53cd20261a34b20b7cd73c4e61edb8aa5d639bb6a2f1c3320342daad9377dd520116110041964d9cf883707bf0d45ea97d04d45802e2b24b73c90e2f5faf826d4f486affaf19f89ba02ed5ca1a6270709d25471fb7f6665faf807f5848ae22c4e0a18ef5a89c294b9755332bd6a1261a2a09d64bba6518dcc065dccbacd325256df7718aab712195f7409f4e0cda2e15adf0921b05776114d9123419ad986c8f339c725622cb980cc521b46ee83a098f8378648b1393b2f26824e6e84ed7d008e90f5bee2fcfedf6d84982fd130ced5c1f4278dc9e8e51b1a0571f179a70c90f11d8914789928036c3d27f912eccaac59715f94baae37e2495c32c780eb69f6bcae8f0c93d4190479976686d8b8c7ee29d47c8ed9e26784c5e662e19d4020300000000000000001cf69900000000007f87e5fb2285e6c6c456a95a452344349e8f559a55df18bba3eba45b156cf5a8f7c80342b9c6eb551374718e697efaed0d8871f036f409aeb36d80f3da7533c2f01ed8d1f65bd6294a4d1a349a8df5d4e0870c960d86e080f3acd655670d9d7300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000b10d50bdc290479119dd81f7ed4a91b024a85c0a78590951a892ae2448a8acf7d090decdf7782ae268a6e79b3c2edb2e8b1ad97b9eb0aa87154bc048ee068f5cb56a4d60e06dd4c528afafff9a716e958c8f27af0245bb5d0baffac80d1a81b337328c30cb8d96c545cbcbb5968e197888d44582fa9107fbb673f57f0134e481e2844ebda1dccb14b2de11e1e74324eabe7cf51c2f5bb3fcafaf5437bd4d4e44549f86a402322308cabb2d3569d357a3c8389066fa44fddb5320002977a3774c2dc9fb0f5794a8fd9217752bdb454e00cd296eb5d4540a7074ee942ff36fce0d8be374be283a83a9bbb3803159c04731ad28d8df8edcbcc38807248f49ff0bfe46e90b603677af52d904af269f9340788ab6488217bf51d4b2ca97f5390d5d5eeedb4854b379bd7094d7c0c8e4f4c73cb8f0eccd2d128913e63dc06e43e97c0197918ff6a72d8ab4182fbbff70e6762f11b2e0ecbda4d3299f1e069e7ee0e562c42b02db82bdd7ca943645e340e35b0c5a829ce12efee90d0685b27d0680aa8198ebd4d73077e55ca0f7c1dea376214f3069fc4768fbabb09eb5fd946da02ed312b19deedd0577755bbeec01f5e70c1122a1748ae8cbe5b50ae847953a6021c59aa04fa5a80f95a80dfc18422d77fdc77c980cdee7607102f99aa6d8e8ec5c9f19239ff7c73950e45bd0aecc78093f11b54c879904c4c05308e08e5ff48d7c69d079b65040a67a2f33a645b86266f2ead4247e6609ef7b617505ae8b6a34e62762b3937799a5a195459b0e857ad87d8a3d601432295d48464f3705c496fdddf493a5f3fef1a74c558bc3d89999952b21eeba9e87ad882674f44687be9feb0b9150f0d586e8b7e9f27c77335c169b41f7233b384e710188f0004b38728494b69f0bb9a5c45d6e704f2db7caaafdfda9eb9444b754be3b20f1ada53a896d8987ca21d5a09f3247064911ba3131113701ad8b405cc867cd0d74c0e02cfb62a3274b153d8d1a1415330f6718d4d21c2e782d1f74a46af81584215d0b452f199324ae0efaf7929544a8bd42f92025667962b6e8cffc35b794509e4a708af4d39abbf03e3aea27a29f80756ce976b8fe562872b177031875b9c77d0ab745fb2f3f003c2b4e7f8b4d740b9ab6102e7ec6f33a6eef0f3202683dab9324e86055d7fb64101967066d4bff7fc6d721e92f7c0e6d75305344e5e5f803fe2476c941b7e8200c1ac1f23b252bbe9df816be33417bd7346b6f766edd310e341d22253932be64980067b856148cce52c4b8e6e353a4b06e5cc590f39d1bacb7182468e5d6ec2ee5e0858c3094e9bd2b10b3c3cd30f79f3e11ed2ac301b097b94b7849f21a508711dfa7e56e1df60f81644aac6ff772b8faedb8f8cc2867e0b70efa383224f389d6da46965eaae7b4197c953b8b30af580a26381a92dbf0602d69a2ccb6a6745a5683d834378d63db58ad450a1204cf5d561144906d029c42330b2fb9150025c71ca95c74089def9f306275f21f2459819713b4901aa3c3fb4e1a216115fbd9d90ecabc02d8c3aa358ef88afc8afbcd881e56faf03d81bd442a14a22c872e126a59bef9213bc5324ebc08ad2bf5d2b8338210acbe5999fcd6e2d6f465c41eac45cc002943cf371cc4887acc7a4ee3d76fc7eff81ec86f60e5e6cf8e1692ad9b043f70122c35effe9d51aa5edb6b190a956185558ccba162c1af66e45369fadf2c197d05fdacc6c9008b3d9f2c1c3c78dabb14e7fe7507084c6bc418e59244c56ecf9a8c798dc67af57627edd82286802ca7c2d3588d7db189afc20ab36eee9dc6556e5bcf7af0dd00e2590a11246b337b7697a05397af5a91fc1d8b80815f829a1ec0f89519f6d5950df2928422ca0dc116dbe9f7efbb466bc087f936b037c72dd1c752517a6cd1d3bc16d30d0b53fb54a55564f09d9420e5b863a75001d47df813e388815a2381169fa13cbd59cc751fe230fb8a035e620c90cbd3ca8096ab164addeb5ecb460a23ba48a629102568d68bc5d9f7ff55839c16981b0918f268a180c1e1dea5cebb1a78609a9839bf485d5064628679b2c7446a489bf62520f7aefebcd92feb4041e4aa699937429749fa8fa27d756664640f3d7aa2eb354abfcc25e1624386d60a016903195d33c341ccb42c660000000000000000ca177a01000000007e5997487d0a3d10c82419ac64e5dad08e956c1b5eb15e0e243218bdd6fd25281e9d0ce8e3298c892a2814377522014a25829b8d2b11b51f6146a1c3ec4e353969c92854ac9f5a0f245c3236a39864cb0c25d34a65815392d3511c412ab0009400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000fe8b7e64c3521098153870a371b32c3013853abd5c03e89ddaca80feefb06fc7e539704b3669d3628ee32aea4a4d7056fa4454f2ee96352a0e918caf8281c77f28d61cb2bb157ea48a4c6fc988ffdc03acb05838a459d8dd5edb1af09d293dd8edfba624e8e715619b26bf333afcff379919b284282b4a1bcfc12d50f0113dcc4be196b569cf54c802cdb9d06ea0bc43299b1578366d00e79dcaddfb90a15f9e4768b15d34e28ee3bc98364a86befb1af2d5f0e1abdb448501ea96ec565c67dfe8b7ca8b121a3118eb91a0191452d24ef8499e11d98489febfde3750252b922e52581d24d00971ea8deddf2e89f7c571fa75352caf552bc85bc3281da6200d2f75a18c8d6058e6a10e4e5f55b9415b6896d740947ff01f4050bf992826b8afbf058df17a13852e09829985928418b413da92d25e324c2e805897ed99304cb1616fcbb9d56f53cd2b3abc76cee6d1d0eafe809c51c3158afe7ff1fe5a0a38b1de382e34f5d96dfdb6e2b3d4a315b0a7d3286e863c27f918f4d2af75fb0d23f27d94ad8abd09b8e3aadf8b9fe43d642cad630e7717b419ef37671d1cc1eb4f03848aeec260b652f804e73900d009e5ecde0cfd95f4c8138549885f9098a22eaa0b9f357bcb8eb935f94a9a4ca9222ef1a609bf6b8952da0068bb0c0e180ca5601daa2ee0af0988fa1b001fe4699906be2979eb636d40f67fbff83c6cbdb6d3bbf5ac61a871a31a4426a1c40ff29d9f2f0a555e5a534578fc549e27d727bd0ca106c0fdc4ead030614400813f93a24ce136c3e5fc6892a0b0706b775f3951d2bde20ff594510ab2524063aee6fa1ecb7a137db8b30ee616632729210a5a830a0dba98ab25b9c6fc23c337f68831ffeb4da482d7c5eaa5b8de49049d6efd897745b872c114c15b6b3aabddb7a1d41b4397bb2c97b71b4ffb30842e8824fa5b9273d143a6ea332cddc3bf85ede4324fa4fa69a5329fd5d79ab5c8d4f0cf56d0bf43af41bc86c8b71bdaa46bf55fcbd221799065d8725dd077ad66c7eae74586b292a2c98ac7873b8160d704713ef3a53df7c9701a4e170e3025405d32f4eb14a8531e04f630452f9bec2e248c0dc6295580a70a0415141e8e2ccd9d5a98f6d289692fbdf85879edb8238e93d6587b0a91cc7779cb3a50d2f26dc04c14be6c0c2c15b3e1e923bb683d89e47f1a9e08dbeb2979257c5d905d48d8440e96ae0ce083a79d9566e126ce2347bfd2ad1b72694d93e1c86dc5c719c51b134c888f821ebd315d3cfed91cd80b867fac3f8a41cdbfd1c5268dd126b2d19d11aabebbeeb7dc765946e856d8a83f8daabd5d92d84975fe1b84e6b151a9ad1116e1d4151e7c72f458be48633c69d7dd8eb1885a24ffff66e89b23589c21cf3ea84e9633ac6b619ca6b4ab19e0b31ad5d8e09a2225cac988c2cd2faf76991acbd74b846386cbea3207128495020df7d2b6bfa529616c2d23091a04a95e265f85c6885f1ce0875de2f84c15589f4d529623c7057ff18c49f34c0899359997d168aff16fd147e94f38173b5f965e3f4bb4a4fcdd47d2e5dd4bc70248ae9fd79c69886c4cdfc322c0ba9217a4da4afdf6edb2caf32c120960ce5604bf5f735e7906aed6076b1c7e5ab7783a0f005b4f3240080d287ac7421bcde37e150b2f8ff5d0dee6d85a8993d6c3a862fa550975dd38c9b5227c42c11f11f43fc8ba8ee3a3fcbf6f719681bb75e60c6c8bf511a28df9c95661b2661e2dd0266b3d8e1c399ae27db69ad168b541e5d01904d8eef69909181b03f52ba14364402fe5f7e1dade25642f32d30e627890ad949ea6004a4b571512ae3f034fc48240e41ebd5d6abcb5820dccfb9c581717819ed811ac2e9f1f46bc8797311cdbb51c531669146c174a665bf84436f5e8c4596f5b4d07897c0c98051fdabdd55cf70bca8a0427d006f8056f3ee31454cbe602282762052201233bf59c42df56de08865a28b6b4a26bbfaedb15c081e95d16d448e58b0607b85a8781b0add4a2bb566b96446e49ac6d33b699be023c2301151b53ac99ad1ca9d80ceb58311434b84a9f5c25b633b65a803e159af91f21504cc4e07e9ae6d0ee0fca3cb3d4bec675dfa4c74fa6912476ddc96eee2c674a3cd58ef1d0fe27f85e33f27199a3b26231bac7f7fb00000000000000005acd520200000000309b77a9f102e4da0b3827d52a6dfafe47773e50c12e64eb6874b4c4156b19952c1c7ab856ce6c6bd275dba2d9a37d890f5574ff76d58263707b62b08b5c22d507d3fe99811b0a5c5888d3370e26dec05f94e4a5a1735881f82006655f549540000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002fbc70d3b22b1757ed9687bf045d48f424efab4ca099aab6d8d2cd412828426d6455efd1922967e39ea8b9ec2a2039d2a9169f07db19f01f33ed47770e8992036192a55d44b92047f3821cbb3f07a5d0fedb2e23bb27a19fb2cb2ed7ca6efaee3dbdfa70257c53a96099bcb8a0310a7d38af016a424e6ae3bb66387cef9b5357aa452258a9e41a8758003489cd569a2bef4968c555dcb6a298272a204d19fc726ac7825745d0b85461ce72fa703f6f1dd1790ca55cdba3d083b4be59bdff54f5c02f9dad962570077d00b65269b2677da11f9fb3a7f0b9dc66c9b6d30e0c1555d62008a184adfd1ae3629c9662291034f53caa38a25cffdd1bf31d94e446810c68f3cfc104aae15907b5c65ad58401a0f3c641c0cb48156a2283b3be517b3adbafad6a85074a6d15a27747b3f64176e1e1fed5b969f69cd0765e2a1cc44a33250dd1034f190d498a16c203e06c5242f4d3d94beada467a41ad91bcd764cec2cd947199cbd7e858f53393de9143fa51dccf6385209ea7ac083d94de7ad377be4f3b1de6f2fb1ea546bb2c23182ce71ed10bfc49986acf369c542e2a4a8e629bb1a8347210c390ac65e867a6117097755f83ac9d4a151f4b96bd75fceb29fe640f33c9d7b5d002d4b63fe8ea3632919642a4cea5b5524c4420fa2e8da1a44b5fc7c2e6dc1d59126827570843fe7821a3de1c7ca15668fb7f5bc1dcd8dcd0927e014c0e9f67dccc142d6c224486d87f38f4cba11102bdb0f5bdfb29155929c4d423de61b61a6bedb9c39a2d25027a4d904f79793a5fda0d9f3ce65392e9f1873e3daf3b33a3366226df7e96e9936df602b999981d1baf0720de2dffb1237beef0d1316b1e763e4c31f1cbabaec3f2145e3bd84015afbbd8e9130fd7eeaeb0c19970487a92c925c843d562c4a94aa9ebae11e136c83babf87a8d1d034ccecf5bbfea411a26fe4c16bf4ae7d1315f588d510cb60af501dfd54b5b9a2361cc736d3aefcfae999b37ee1145bad333b07250530f96a36ac6196384df4fe424481b613aa10b0f0a4053e5afc190dd3b87dccd43952f69bb1277e9f51acd453c319c536e73933c628091475c30626881dd7c749af552a2b29424503d75d066dac158267d69a36e9d1583c6b2c28f99a340f5c4baa28046ca3ee7165add443b09ff6f5c0d393b6df96737c566de25e6a179957299fb9f98b13663ce127363af361342653b9dc983c3dcfeadeeb453c034ab4c5defbd644265c4e91e2c1aa086884563f903d49cbc41a7274319ca1a7b074db7f8dd2700c646c94eb95e0794d18ba7efbd0e7d667d777e77ebe43bf07f69f7e2c6c1ff78ab8496e81a8c706d6555cc11834ce93603f9803487208969a70d6c66c3520e0f5df6316dbc7d8ee944132126ee307f552ce6a5ea1ace4ab4b7dde08959266d7c79525c7623a089431827218c373102fb93c2fbde8a360c884ba9fb8f9328c8e6f8ea25a09ae7e48dbf3af5d2fc716607191ba1038b1217b0cdfc09175d9974ab73f78d0636443ca7ef2b8830ae4ecefc986292d547e0ddc2f14f8e0bd0dae254f0e54bff5412d9d66744d6db3aaf7326203a052536df304379f71d476a1492a6d2a9ca26e141f1092eccc92efa4899e4c878313af493a5ab885d4df39ed93db2aae816d18dbca63cbb9620ec2da697533373c05f62d80abb1e59ba5daa394ae854638f6a3bef92947ea6d8837c5fc63892499e214ebf73ef0209f5b2d30eb0c2478962f1bb109ad284dab1da609fff815b1be615326a07ed3d5e413f43dd064c64a0add95f6a60325e18761d960fec20bd83f5a37b3077b91104885995f20ef4516d75a826d2ddc49415056e9a1a32798433b0c17a069499e4e7e23c299a9b1686f378a80d41cb168482917c2d9b0fa14ff77da4e044d41d23d1c85aa92bf6e108d29d4bf9a5edfedf69a13f7cf2724d18b98e6cd86404471623cbabaa2362e18c42d4a429242bcfbc56add5992a946cf1860c0a10443b8c55d70ca7fbea90ad5a3f61395267c169e811f0ffe5a26b138d54d08990a3ea634c89be6983b8f0b1acf8e97804dc1595a4a2b2556e1334fac6bf1ddab912abb22e09432c26188c6b90d92d61418be0e0dafaab130077265f984178d971f220043f921e39fb469268d5f5dfc9927ec188649f5010cea1c3483bcab605ccded5188b678d5b4bfd41c1f52e921f68556dd3576e2b7b8cbca701236ea27cb5c08139ddfe6a9f13820ce0c47506867f7b6838d0b4ce203ec2ee14452f34084a4c2bf78d69867423eb53a60700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "ac525353526aac5153", 2, 757713570, 1953719636, "cb77f1ec8155b17ba682f2cb88ff803a3f86d453bec0b6f873973358651c0f64"],
+	["1b039d0702eb6a93ddff85d1d63303d5a5577641f7b07da2eafa034ef928753091a6bc0888010000000852ac52526352630033c163d6d8321274751d6d5061b10105d4cb457efea6b29c287db552c2be67395e8df8700200000007ac526a51535165ffffffff01408a180100000000000000000000", "65636a63516551", 1, 142266770, 1991772603, "1da73b4e9342f4f8484d4f89204bc60b51119b63daf6636e2bc3a50b79cd409a"],
+	["030000807082c40304bee6a07d1f02301e4d419c907e04bbd8bd5db71d9b7cc025fe5015c3531009c6010000000363635249c1795fb9e2d0f0adf3ba4e2151cf9ef7c65d191c1c0808ae604a319d12967bf49b6f0e0200000009006a5200006a000051fed17d0f4664b6561cfc771b4d39dda0760384bfdac37f5f37c65f9f13fb3b2c0e4c12c30200000007636353636a6a6a52f65c7b1ee07ea298cde734ae5198303b6f7db07e7f86d5c3c30b3a1507e1327d8fd43d01000000055351ac0051731e94d20457fbc20300000000076352656a5265650ea0460200000000025352567ad50000000000036552ac81f20201000000000451526300e2cfd8070000000000", "6300acac52", 0, 729894016, 1991772603, "dc1bc2a3b2b94cc8195c6006f12063bcbe65df602b1193f59841b1302e393c32"],
+	["030000807082c40303d9f549bcdc0b87604c85219e006b98fc0ccbb26796df7a1db0f732115d27ced1020000000651655352006a8a12f8de042613b20e5f42b99e7b0fda17ec58afcb292e18c406038ee82d4e597d63a60603000000004a7a4c83d06afaeac3e9986fc222d733a6132ee04e814b83fdfd6f7b39253b6e3cada6a70200000004ac5152acffffffff011db5e300000000000665ac52636500243824a50000000000", "516500", 1, -1169197391, 0, "302e26b3a0a7f135b051d093be3f8f518091c2a9152a339e0549f78a29261031"],
+	["030000807082c403045e19081e5a6c2650c5f21577beda7b6da85cb8a4b14cc066ca65aac1c28044b5020000000752006a53530052ffffffff1fef185ba118bc7c326415b15366fe51614ef4f0092cb3cdbb1633d565cd4e1c02000000016affffffff5d7cfadc840ed26cc77999b7446811db6dafd20354da9ebd7c87fb8896f3eb81000000000863ac536a00525163ffffffff7faba96daa27a42161613a78aa2c45707d9416bebc19dc3437885b45b4cf869b0100000009656a5100536a636300ffffffff04033b3f000000000007ac6353655251ac95d7bc040000000000d1295f020000000009006a006551536a5153ac13b505000000000452acac00000000000000000000", "5151", 0, 1332345318, 4179206552, "ede0d9bb91972420e395e4349ee27698c76dbf19ae4868832ad3835d14b4897d"],
+	["4050414901a27cb8b7d895b637383d5591d69863a4025a22ced44232ff8135fe27f7cbd01d0100000003acac65d3c1187501a43668050000000000c963fbe000", "6a51636aac", 0, 268655119, 0, "898e3527c524855471216c4d201c34f055d433b73596e15f0943073bda3807c1"],
+	["0400008085202f89014e31ab2ba26915f555e97fdc33b3365f676a3f9712b7d3dee7faa94a565690b50300000003ac6500ffffffff03467269010000000009ac635153656a516365e055d804000000000353ac63c8fd5d00000000000465516a53dea73b28000000009ba432000000000002c9a5defb8f13233197beed52db34dfab83395eb3aad722d35a2881fc83009232ccd98d9b5ddebf73eb7418d49d82647f9870a1551c50e4232bb9e953ba5015720871c89a5c78cd2b2ad1064cba14e5b29ad9e4e68ba08bbdc7cf2c16f3517d74c78deea240249af9d2ac440e3e63865365cec18567766124c673354a760920e4ee9a3c62ace7783d622e75653dbbaa3dd7f2dc238f1cc2350ef72c4a58af96e48241acae9259881e415b611f9103a5256e649d008ecd82ba5d221d477c07dae58709884aac86420520bc8761f9a9e92e05292fbbe94f6abaf222e56e086fb545c4a34343d42fbdc4d9881411862c3bc75b574629fdcf49a6734aacacb3c5bffeca23c71194acb2d6969c029a483cbc4f980bcda0fee623774342bbd829327864842673615a0184d7b81815d515c67d2ef695a35d9324d9289e6d316d94cd43f82f34084a4c2bf78d69867423eb53a607000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000c352a153c3c090c2ebefbd4ee462601dd799eec4c27a754e6be70b06d1b890538e8d72897be87f22f7bdab3841fdc3a13042ead7f1c0408d6fed2b6e7f9eb844b602af4baba330f71f46f2288e70f6ec25c1df4cd1dce7867cc52e74e166b76be946d084a476f2b05d755dbf40f65b1022e9166a1013cada5d6bde8b65dc7cce99a8ad7736eb30571c6eff96e4d2d8e620a4254ccfe78d31c851152b9d8cc61820026c15f14a9adcb697588f1268eaf46506d19dc1cc9097120788e0b489b7d25cb44cb01a2b566e1843ba373582f3d97e04d4a98f82a424165842dfc30220f1bacfc7ebed1a971e422a4305da85c8423f97ae56950b4fee7a09a30ffb78a73fa5707bdfafd7902616ea42ec5e51c574ca48938e695d8242e93615ae3a1bce25285527d3da02c0298f135987b91f1d117707b2312717344fea23f547031c89682f34084a4c2bf78d69867423eb53a607000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000048281f8fa89314896b1cd2a5aa93e68b9d11284ee07aad998ff619a46845701377d35ce16a2572f87dd2e1bfc4bf9e7d03e53295f7b389aaf129b6696fddc8159786994a32027af109e5c21f34a31923018a8c65ab8c18312746864cc7442f623269f90b8c3459f6c62b72ecc8c97c5639928e4582a322fc745c22e9ca9afeae8e292309cafea91327843a667b8e5e6de39d507267746449b71139eea617d73319fe2b5a7800dc4ee42c81bb6cc506a3571548f0d6338cbd895759ccd874c656e5fa9bffa05d996772f1368b99a386c7b8fbeace4f9f93f6cbe05b3a90e4dbe95c72cf523b55e73cff0c8297ee729d8de08e06598515e98a442b8c4cabc24e8e4f5cc429195dcd4baabafd392fb235936817f260dbf1ba44e14ef9c4778fcea5988d8ed121e7d5551641a1ef293bdd6e11f0be6217f9025df91e25f9374d172e99c4f00cc5a2bd54691e4b876357cf0b03995ad779a7f88f78009591f73c7f37c23cf3ca71cd4dfadbce980daecb74ba1a58bb9a1bfab3847ea5919f58039ac2d6792cee679e421f72924fd6c1c12954c9eec79dfa47bfba924748973b285ffe7a8ff36513c8142046d9435a2d7da17313f1031334b4710d1f0746cf07e1fa3782a8a6cd1598b5ce1e9b7e1b46c0c11d7daab3d9185e938f5a6a3258d595b95ff06dcc16a54227b72af0d4f4b9cdad7b38b954acd51b9072df71c0be105f604c531533a5e13e81305a02f25620ca575b744c893e065015991f5405490962c48a16b9e893292e5cf0b791518ab175451214bbf5b1df7fa65176b019bed8d23e9d43e40945201fdedaab86865a5edb3641b074b042eb4c22513400ce0b8ca1b928cf7953b2b8486418f9db052a6789cff14f07fecde451b7da000df33f3b573e25a2dc4105e477e95a0574d24e6e0ba867a770e2b84fff5da45b9cbac6c6468b5e904e45528615fb5dea77606da8a8b9a25d9a591131ca1a1227fc7bf346f43db79fa802f6064f2c045ea39a721e27b482125b6ac3193b912e071821e2d4fadd22c91d1f2cbdcc07749a0f69a402faf7c3576bd858c44ed1919ae83431a933fc5609ab6b93eab560aba5d9b60bf2d6ea6efd67dfda9955ec21c3faab9718f71ce4010d7de759b256b490bf17699fac1ec54db2fb226202ab809d80c023295cd8c3c25d220c774dfed169260a8c25edc72e6de6ca5a0a3358be8c82a9d540948ffed6b55f596da4728025dab46ea6037a935d67e70df28464fc0d24cfabf9449c8c743d670c961852cc6735a1e08cbc831794dad09a156def8edb302093fe299ed071895be9669a0b305fe3f05a71ccb9680c5a9899412fab72f7fa338a063baeda086546fff3e1c7fa13317d3ad05c43480aa6059b814e323c9e52836b02ec14db06b6b384a8ee7ea7316300ddaff42720e0168ae1d6bc9d106c51026d88bc5cd62bd0d594c9874c43aa7cd08c6dc583a5cdeb18ec8b6361752daf9e02ca8e1d0156c14011546d0fb20263e9009726b91d075ace67c908adee54454adf30d07f7130ab78195a366d7f3458b5c3c3bf19dd35e2b1dacbb22dfa34d3db689780a27ad0e6a0faae2bdd13505a35161255f8a9c1e2cea6f25485679cb227a1390016eac531ec47a5e448cebcafaa2d75fa7ceff7055d61350749f748f5264ceca6c2f86f426b4ca67e5061c69a527d4167b32fcb19208ad4b9b2fec1d61f0250873ccfa70dbc6c85bbe5bfbca8c809d76c1ad780af82bfe61e091ddd18048156ac56acaeadd157eeea87b29f2be63ae7b470b6dec05a80ed5e23a9ee955ff2216b166f358f685c9ffbca28debce3bcb3a37b439e5b41dbc95506415532077ac57907d0743f198af812bc148bd0258c36ffa1e180c100da94c7481e3396dfc98e2dba135fc2b9c2fdf2ba2638c0abb301cc34b828ec5950c8336d6b279479d4b558a585d0c3b5ad56e98dd7cd7328a70121a68c2b2a7de6c17a9222f07ff4a14b340249e96c931cbacf08853820965c823389f9c5d1989611dd69e714f217bbfd6d3851a654bdc6b5cb24a4a0bd870f891358efd7f650a8861c73536522f630e7bd4295e02ba057a092913859fbb155f01e4e9bcf6a10df573a65730df07e54a972686faacaa9e5969ba277b2ed954ab86b7b81f01d9473c0e7db48380d4acb63626532ac6b3a688706d05e20d2290db18ef45ac88203103bc8dbad99bfe807a5bc186b002ef7b5ef251d4a4b826d1f3b183cffcbfbdbbfbf35cbf413dce014be46c757a5c86d4c6b26e50d6faddef431659c82c80fa48f6811239eae53a53d46004f4291bd524f7d93db9326a85428aa5ae762ecb82320548864f19d92f74136294eb7c4f35ce936dc4cdb35c903c743460966a86559a64d91c1e014af46f840f3ba2aef45e5fe84551c950302323946c569e043fafa345326355d960d5700e032d54cf4483372ccab132229ddac923e8b1059e78867a307f349a7c79a055670179a4c7583238fcfdfd6b86775d92ef7a2b173f9cd75995533e9cc6e301c655220ff67e9e75f6cc04cb9d35a9cd06982eee90a4c60dc23ca79189564c5803f09df0657b005923bc0e466b950fac8014420f9e0493ffd0a9b37ef92c93bce5752783101bdfebee19676360863d1fcc883414a804b33ef122a3211e925f66b610a6b6ebc9bcd7c894cc560ff114569d19e050a24463e3d2932372cdb33370ebd7d4a89c656c1e13e667b4c354d02b50a6fb74173ec219e2aa4d88d24302661d89aa941993cfe6b8184e472c20939a49b1815b6efed5bf94ad3143bea20d7a848b83cc5e2047b83d08562690b1616899729593d74535434056382ac591a040d8f8d89e6868696c750821144751d89f83c01d168ab95751efa6123359e3318a9d908772a1f961924b0d1dd337748c6deea7cf7c8f0048286cc3e333d3af29cac08a6196480b11e31a46f84258bbda8dcc6bc864ba8a4c0e9c99bf55d9938b5d6749440610e2f83e1da6efc0c0b0e2c6dc603261c4c5de4f8bd36fb42ae92685a247d2122fa05fd462047348ce51d1644bb7170629113f0243f527bc292b44061085e7ef457fea9a8a024f1c684eaa0dca8578ad6ff0cef5e10b7e27033b1a761337459d700d405b3bcc77e5b8ff51f5fba5282f92d74c040f3c3a2416a560b0fcc71c9e1dc7f8219c4817182d416ebd41cf03637d49c2418d68846021ac9be37eaea53a4a5546f674d9cc0c1cb5aa4a6b1783ba7b879f794e7b719a314fe8285179c17d4fdeae828e56899fd52371b01b85e3133c0aa701b1c7b9c0463ef327168afa12b8cc1ce52de033b2f088d56e2df527f24006dee24d4210ee58555f97d19dc3b7544a7910b27d6e908ffc47b636d8cb301a0fbc14e9faaf637117b7d05841e132a97f65acc6a66efd0f1e5dc34da9ec3521a4994b1c51dd704382eba6c5ca090cd42b335283d6aef5d6c2ab24bd9bf0f85703ef0b5dcbbc9b85d7afc9d915af2c28d6674e66e780ec70788793d168808768ff6c15879cbb43826153460c378a5185af0cc5633c9f8638979a60e79629fa2712585f48a1d721168c0d530f129df646f9848ab1ea01de5f57e3543e2cbb429289bdb818e5c15f42b3fadb43ab35536093493b5d2680a6e6d51798b48e61ab3ce112aa79864e2f757aee7a2b053c63e5fc28949cca24d850a579d22699f8bf1ba0ef757e401d3f2bee07a35fde2585ecb5f930e9b429fe2ad0f3012271047175ded56cd41bb0f9b43e93e23419d3c7899baa07422f06f76624de051f4d028caa3b3e6a89c9467335e9d3ee5e7450dc436a7ee4cff9b5a30ee8d6dc0c081f9247cc3ad19d96898d54f58542fba4095f73f861236710a4aab282749ba223983392b91c0daa8e8d681cfb5f313f97e53fb1576e802a392059c5735a8307b74b6a94bdbcc1f19106cf2292f18d6697bdb6fdd99a5a284bca33189ba0a2cba8679d4a2b5eec1bf7c68221cd242e8cd9334e838be38d30e9eb0adfd435ba412073f04cc282f909fd43cbdc0dcfa17ca9659d59bea0712ba862f78f726ba31d1a6a7b2724e72b173c44e7060dc947b3ca57ec6a27a965e1e049d2996cef20279a4e3f3effd2211965b46e774e362b8f0b819056ecb07a2bd0c76b472930803fbc86e14b92f51bc2055ea610e61edeccb565a4d2310b9df1ca3eff67a2b011a88debf8b12f687f2a864aed38b2ce108ac2a020c9cf7f87c77dba46eabd86e4275592ef6a993bd17c97393dcca8613e74bce7468a9886006781955eda875bd126686ddeaaae566f629a357375a78fae7dd5156b1067096f974146eba440225f5bdbdbae6739eeede4210d7826067edb7abaa83a1d659fccf70cdafda10995921632b9c3d832ca93e1f200679f87401cc35d65091c2a0c3ae1dad0ef5cdd980c8488e3922a3e318199ddd71f58e9090b6aa74751f156963021b7dd6466818e434d2910910d2e2c5c3475eddde44b239a0997152c98785210a07801b41bcc0a403a21ffc57cb709c4d09c4350212c024b2886ae85769313c9e1cceeda16d7f2029c6d85ee6d8bf45bd5808780df4d5347ee132f115c2907d0840f5e6f70db943d07d8995533645023a38910e8fef070dbdf0019c8683265c0de26f1ceb29a3cb8445b8f95b07c6ea5c1a7fc5afef493538fa3740b0ac5eff303d096babd485a156106c76e75d2ed899e9e68709f4a26dc432c6eea429477ec6ffd77dc46b085b09915f2d77866a7337c138b182ab633319533fd595f082796847038254c723f8a395d7e36f4089ededdbc776847b86f22862c20239a0a7dc90c85771a8d3cefbf309623a9327f851a159bf20b6ccdd34e7f340f183f90153d3c5a54f91c0ecd8974ccf9819314e875c829e716312689b9a2576fa5b8d172b5c5e2172aa327f44a052339c8be68a43529cb88b8726f97ba62e958b101940ba080c29db8889d56fe46aedb6e93c19f76e9e52fde50156ff101b350b3ff167b2cc352143b9c526fbfa5a988bded9f9c8e4f2e1c36a62f7903b6126813e449ad5c99bdbb7cbfc96bf533cfe75b7758ab6bd29b3bdbc91e790b943d60a70ec6ebd0dfa57c4c6ea1932291e17650dd85f1c1b0db9a7a1744c11064d32da2c09346ea5373fd8973dc6c8beca1f7eaf820605a16f62ef1d9e042362d5cfbdd09dfb48d065e68f20143d9a0410809213760ff9ce48c52dea71179aff7923ed16fbafef950dede18c4783abd027c9319fdd34d177bbc7429ee7c7b86136389aa4be3fe48a5fef8d029a9ccf23fbda15bbf0be3beb6c8efe91df14523a864ff340f6dcea2a1297ff9fd555a65258489eca2e1a4239ff8c613566d65458b2b821d96fc382a63d1db69317826bf6a76b501869e0100000000000000004c4a9d0400000000f33bfa201805a085e88544ec6708b25d188c9aa5252f161ea735366754545b12471a7723e4266171866eeae0a3ecacec446cb6e4f2c8e3006d500ff46b80c7cd6f3bfe7a2ed13c218b50eedfec9288a7f1955e29d82c7dad9789dacaa4f6c48f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000f417deea0cb34c2718c38f65cdd067a1aa1bf1bb738ac83211f3d05704e258fdcbbfccd175427353c2eefb654e269113b168df83d1193a5ff6baeb5ccdcbdb8d520135ac1dfc9e47ae480dbf4ee52b42dcb8ea522e96496f8a3f175a7176d425c8d04adadd8827ead4f9577ad858a940a663142fe015725a444c075b8bd4efc32b0e800cd7bf90a36a4222b3f2f80bc1c0f7de9959065fd7b533a01e5293aa470f608c68f78cbfabcb6e366b8ceaffd8018fe9b4834ed78eae797836e8647bf0ed51eafcc147810f93577580fe3d7b561d8a6a9e8bc4188deb9197205a58de7a251f952e3fd2e7752243708393cb405b0dfff228fc64cc4a1eb1b2e88d74709262d957bcb35263e1c6024597bc3a97938bb2dcfeffdaee45b1c30819b723d272df9350bc52c16b110f036299b7e2abbf584b4012037d55d8fa1aee16159c23ed2570dcb24690236e22b0f569fe0d3973828fa919c9059a1b639325410d2ff0ae25c9928b411bcff8356bc40d230beccc2c01c5c4e4e95afd072c0187cae8f237d390f8904638854d85eec4e3f80ccd9396b549c057c8d38d550d2672e584419265500f0dc7b2fb1136da90cbe23d8bc2086a551b7af6b4e5ffe8c88823d72a726dbab22dd75bb910dd9fb551030d99b67c7e95a4731eec80699025e5d77af49c0eca43106d4846938aea529c907fc8d41163ebb0f212a28a16ff19642e49b5d13cc68b107acba54b5d6c0f8f56f577d49dcd6baaa5d115fee84fab83b7bff9c67677135e9d25c661c9539bd0e5d9b50ee0bd465cb10a9a9e6f180f952ba2014a67f4f4fb14ce34e619499c3d3c034d6bbb93bf12855e0aeaf37d7650598b405df9bf2afdc55dd3f2aaba3c8998a205362935832c68d3cd4a64239672659685b2bbb0ad48f51275e71b7165a70d3aad18ad90a6205e0a0140f94aad00dfd686c666fdeced6ce5e601bd1352b3a4b529af23cfefb0ee53cdeb8ca99b23dd464bdf1d657c221d51891cd1b1eee41597af7ef5824b68a8b55a793a56f535c36934bd3b62862fa1d806026dcb6f8935e1a79c2bbabe8108e747cbb326bb75b72a1d0d051e17b5d70d38842e042a42282746abe8963896d13c6b2820b3de93a27855926a75cc5016907e58bf57b1218662c8841ebe52ef267a5377eba37e0dac5cf246f9df539fdb77f211e61b862692a2c7118389658732cf11948eb1c7acfce69eb191d3a9b37527d131eedf9b31cceb921a7c3b47cc869d31013034042e052036adc3251eab48acc44e769c7ddbe546a15869a84db1b5692e54e5d73503884401300008d1a1def22dc2c60f118ee383544df6c7fbc96161d4096f07323c187c09b5d4b7738b1e17665769a497656f8794bf17bac8dab37211c689136b4058c8435bfea9c126a235fb44015bd74b1eacaf828c34c371c08d005a40bec65538d5a1ec4370c95d5819f819ef283c81ff37f5e8528a3513f00ed6b317d30d10c905ce08add736942d461ada277aa6fe3af2dda44e0d9128a23c366016c613021ae37ea90b81f63c709ef8c5e7f4854bedda685a45e9ea841797c3da215b6a8f620a07102e0fa230c8b4be4286fb14fb932664404af7fbf0b72ca126a9dfd9738d22b794123ffef59c5c83a821d3d683342c491974f35f047b59b23e21525940e3a4bed1b6968a8cccccee6802ce6e981779186e509abf8ed746e91d2b1dfc1c14901d5ff5ba17195ea7a70c5629190e06c12c17bd3ca008e8fb05b144cc90910be2e3f6ddc0946151f3c84906db9fd60cd8a523f58039bd6f0bd1f9f4630a07268dce5dfabddb072ba882fa04aa681046d51502524ef4fb1934f5a82c166c1b32dd1f2b04b9d296576d1aca176044ec905ac9377b7ffe161cdab8eefa12a9ef2202af3eb44b9e34581d06caab43340921e03f99b554b4f64e17460a1fa77f038062b299e8c7a3e0d9614163d138d8056d3e82fc6f6156ae87708ed1de1de56d981eedf5e31f93c3618419ec45992ea784573520db4a01fa788d54a66bb04a963b40002923cf615c52c6a19a4a2697c1e922e6f3b338ff13f3c087d67c3133cf8d337d1c69fb753b555e6ebb6b8b4334826ff0fab5261a5deb5b461d81055c1615d859ae2ed4286c66f916276abeeb4ba0807ace4cfc7aa7fcccff2ab167a0fdfa50e27ef249004f217b166efc07aa1239e7efa3a556793b00279258c0088f3791954617dbee06a4ca42ff895443986f0831cce363383b53ef07ba1629c505b094e48b67ee134018c0eb62b44a535c7286e87583d40000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "51", 0, -1270683531, 4122551051, "430f2299ddba691d37e3c0488ab5268b36a04008b2becbf4401e0f7982a66c5c"],
+	["9da71b090482d40513a13c566a949fe42d1953eb33e2fe5738bedc83c05235c1255a98625103000000096a516a6553636a5352ffffffff8b3b350b914fec9ac96f966cd3a9853a876e07167da919342375d58fc8c1b205000000000665ac5200ac6ac6eca82f0120597038b946eac8f84af15527d385ddbbd7dcc46fc70fbb60e0ed40a724950000000001acffffffff2c9cc211315d01af1cf7d5bf0fec12a27798fc243d1490a167fe3a8c35f7e3bd0000000004515363ac42af37ea0439f142010000000002656582aac1010000000006005152656a65b913010000000000075263ac53ac6363498560040000000009656a5152515265acac0000000000", "", 1, -1370607453, 0, "99251775ef2ddad5417edd517a18b74f9657f5e0f88bf8591a414acbf5bc353a"],
+	["47bee03603753cf9ab969cc8e97673dd348e5f235c0dcf8a360ad66ccd3a310763bead5f74030000000163ffffffff183e63a0f6168e0fe521bda7a34c8b0d5b991bfce749f34f09b1dfb3db7ef1c40000000004656a5351ffffffff8fb19c8f8583103d8c73824d69920d90fa0923950d2ce0f36a1b480002f71128000000000700656a63535251ffffffff04a3911c0000000000096363525200526a5152c3296c010000000007ac6a5153635352ab42d6010000000000e17a57040000000009656351525365510063ee976d4f00", "656551", 1, 1463229743, 1953719636, "e500affc078ef792384172b4bbd7d6d48eb5f5a4d31333294b86b0f8b425ac6b"],
+	["030000807082c403047e469eeecdbd33dd95eeb8e279a1ff42b40f296c60a738d4bb9d9f0ca5575e3802000000056a525351528e9f114ac2f77aeb7b9bf14a4a1441d0d918f54095774d6da49ce1d2a2fe150953b2269b0100000001acffffffff53b0c461fcfd9c924cf3b130bdf1163be07dd1590cad6d81e07857295acbf4590300000005acac516552ffffffff55d9a9fbba6f85c5c384cffd04b661c23ea555b80edf820281561b63f24a188e0200000003536a00726092d402b6a5890400000000066aac5252655349ce95040000000000000000000000000000", "6a5353ac6a", 0, -810705206, 1953719636, "458269dc3d855afdaa22e56e1cc2e6fe7791ecc5c0f4c12234d39defc9e79bad"],
+	["e456ce2e01949a760c4628808425ec2dfb053cada84e0971e9f27650d262cc17a51ee8534e000000000952535163655151536affffffff04bd64d50200000000015224e9dd0000000000036365518f85d3020000000002526aea46b9050000000007535100516a516aa0ee817e00", "655163ac005352", 0, 482811376, 4179206552, "8edb30250dfe7ad926d8ff61a6ba5aac43dff1d74b95b9476f1d7a281ea6fba4"],
+	["25abbc7e04486e135a37c49a289404b72866d6496dd5a5c1669d89035b2cef48db2682c98e00000000076a52656353516a160215458757928c2bb04e7bda500fe773c749fb968753721f16f2003cc2b2fc0222ed0902000000046363ac53ffffffffc9c9cd40d81c45e60135bed102ab4dea4d4e36e99a8c81fd3f106218fb967ff202000000060051ac535363ffffffff0c563ce3798f71e36f7ab577d68278e2f6945e6e219f98713fcff9599772873303000000055165636a51ffffffff031835ed050000000009536a00516a536351ac9131ad00000000000553ac6a656acd15e30100000000046551510072ff81f800", "ac635152", 0, 2054874647, 733220448, "2f630cdb4ec423eedc02f1ef3b5a98c2308d2ca420f9bb58b9cfa73e53cef970"],
+	["62ff593a01c522587b82103585b852ef8a74f9a4c900f71f7f266668d9ebc4dc5bfa8b989a0000000007005165006353ac981e38f70121255e010000000004630063530000000000", "", 0, 817545269, 4179206552, "244d5d2dbb687b98bd6aa8b59ec21e8db571a9c195883a2ca959172407336723"],
+	["030000807082c40304d238269fbfc402f4703a643a0599c94abe935642635011f6a0b28851bdccefef010000000565650065acd422c454aff3f8d19e90ccf556848890e5e3f2f1dcdca49082b747e5cdc35f93c82e61590300000000ffffffff5e1a6c570cf8f5401defe56f8dfefea706814aa3b60673cecb185c3ab162dd7002000000095163acac5252535265ffffffffad37430d59553010f20947842973258f90cc837474e9cd25ba0f6b224dc8299f0300000002ac513a792af10435c55805000000000552ac636500fbd25903000000000253659e64ce04000000000951636565ac00535100635ee8040000000002656a000000000000000000", "51510053", 3, 1826151333, 3925833126, "cc6fcef97c59464b5c9d0a8ee5e7c1cd1138b9eb6431df92e24708e1c9d3171c"],
+	["030000807082c403011a1c83771698fb5fa734ed68d38afdda111bedc952d7067cf5751b751e1d935e01000000080051656a63536a524ca6b6ca04b4ad9f00000000000800ac6a636551526af8fa97020000000006006363516365f774a10100000000004694eb040000000000000000000000000000", "006a516a63516353", 0, -1916977229, 3925833126, "441cdc67407edd804fff3ba90be01096413b806cd662d1a039270fac662fcd24"],
+	["0400008085202f8901389421515675ebd73dad3d99d7ad0d42f7977389f210b0108e37ffce824bf9f4030000000765655265636353ffffffff04c5280b0000000000026552fef9e3020000000004ac630052ea309e0500000000001be07e0500000000070053636a6a65000000000000000000866ed80100000000020517ff02a15e2a205fcebf547e7dde1b2992fa4eae0ff521edb4144935a10d488f2eba76f4bb284c4f645be6ff353aef3801db763e6f32de76452a0837415b55523c9954d8054126d3bccd545ee994ea5fb10cb20a388bab40839ef886a5d1d1ecc670e540966750130fe3e96b2a2682fe922ac76279e7bb3ca7cc29973ad1d7035133ae4587b2d66cd1e9c994f1afbd1413b0d5d110ba1d8a1e97c1d733586bb5cfc86537a6e03bd4f304eddd688e7a8e2079e0dc22ce655c7db6191d9394527ba600c8421246029d61e5d4154378553e66a11de710e2c1a862eb5cb7a09576af8487e15b3c35c82474ddba2ad44c41fb9469f6d1b6ae2f7d57da370da452b1d3d22586043ed2e896f7559ee9743e66d620511c8341cc0c6800c62bad08912c27f6c56c132c1d1c1ed64cdbd3b12bcf8dfe87a9a8a8a94acb7a7d10b013c0b04018c0eb62b44a535c7286e87583d40000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000015e4867fff3912ce6b92d079215ff97603323c20fd039e513d1668b51fd51306d90c55c9ee3831ae16d98eeaa4cecf13e28b2fb30d9067373b25c2cd0c2d3619b96cf626a22e6efb16a1f52549b5730feef662885415e64e1b29e0644fa9f9b5e2367d1a3733b771b4539fb0bac20c83221ad389182a0e430e3cfc478f4fb63a1c5ba087a65ff1da66fb18af16d8ace17ca1a9fe16748b3f78f2c45356cb4d6d22111e7f675c7f5d3201509e6b6b1c64a48eaf7c048bdfd44081603b090e9bc5ccdb419a13d71253d8c3fe53ac5348bb115e8cbf3db7457b8cdeba4facfe359c1792122613ca75cfb5db3edec389537f56b2859b1d142d272aa346ae546488435c0c3bae7a10f698ef3f2705b90356b1be75f5250b72938cb14df40cd1afb4d97eeed601bb331ef5b6ae81b321f7953ca51797d246bebab4166011ad11e9ff174018c0eb62b44a535c7286e87583d4000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000399a95626c4adc7b2ccb15e5040c95dcfe7a49ee86ebedd5ca29157849ad43a9c1027604932e1b466fcea37ca5569c6325c683e12c70f4cb78b41d74220aa6843ff17ce74c6e1188f615cfd1ee07326fd733ce14affb88a3d660981654b50dc16dbbba2d1edcfd1e73f6f974c8fd293215b07f69364edb67067e3221b7ad7573c1d900b8577e03fb4b47f3f926801a996b9f2b47dc6cc878327156553fdbe0eb28a95c62dba7d0f2fe6d4be64a2bc8fedfe0085a2d2fe8134be040e3c71451789caef633a0071be16061a266d1efba6f96e7deff45f43f3912ae9ac9e2446bdd2dc2dd1aeb891fdf1449498f80aaf30b65fb0189ee93d77c87ea16ef918d7f72e99b1ef034afab4dcdc5bfdf7d1aebb7516639811da86f03d8a9a5c03b72349fba55bdd4ba32857e8fc396fd080826180b9aa7a7ac6c0cad3be4540e7410b44f16d455124396313ad73ecafc975245dbda1d05737c72083a3e7c506646c63af5593706fbb5ad6e1e5edd245cb52f96c782b37c7babdc2c84dc48bb8ebfd023833f1126b4de09e7229bf4fe3daed170f75944a1c7974aad4e2727501ed6e08b62b5f4530ba62872d49695967f7e8f59373349946ab3f6b1f8a371404d7ce80d18c95d55d93fdcc441dc412c22625e965d18ad3215065c787bfb8cf2099ca503b616d235f99c4263f69d78904f5e3422d8c67b7fb1fb6920da40312b24fc4056dd8acdee5075e23c39b6a9c4d18937b1da60876870ff7dbf5afd7e019aeae8dec1e8a803d10686bcd3bf301acbcb4becffad95cb35efde127319bba103ae0bd4d92b61ac4b93849550c67ca1bca730a56a50f951edc49854e452aba11a381a1b10da30372011470d25dd0fcfa0eb70b1a62f25958b5694d7cb8542d448d2b3fad1639b026ffa84f317deb990227fc0f42b1db9fb11b1d627eaa3fc25bafeaeb794a45de1bef07e79c949d784a97a3d7733e39fd523d0bdde80b6a2997c0c4c0f142bc7f4c94a6ec4facfaaad58f7a4816d26c237d0f33bafd678fcbe9726ae025fee698e4b7298dc8be719c4b6ef9a00ea616c8615e59e48e2ba98bb82f17f5665bb441a0d99c085fbe2fae55c9eb2ca3000dc2a759907ad4017ff38acfaf177acd0aeb491187f7e8b2b06cc94505b47b7ff575d7b1b6223850bab934f85cf537cd58d8bf14a66aad47cce76f65bff60ed4b36dcc1e624743523b678c0121367c90037934c68ba5a8de15ab3c0ada5f328bb51c345a978f36cb429702b010b11328bfce7cdeeca74bedeb60904e62a822b4430b85e21ccd01036409dd218b2b75851c62f205f8201b0f4b152bc051ca1cd51c861e0b224e67ee81e12646cbc39aa50192e6b5b4d4e582a6fc75edb3048f1801f12e49159a7571f46f94ba01d6caf0a590679c6b47808ca338289e396fdb977d7c46146b99d0db0cd2dec13301bd56ba4c94c264a5b661f9b3879c5f9bdb27e88372a0896d2ce4bfe13e7bfae690c783a2ef87d55102f00524c347c3cd10cf1942a7f3736a23f13ca965d6261de6f86610bcd5901ec437d5030775c68a3d5effa8da6a65d44f5db3b7d9f52cb85982762e90a9244b66dda051b465ae8b20c45985379a781cfefade67268ef5d628f9cfa8ae6d37912f38dd47b0b319704997547038d23c96b8a9db8d6cb9d4c9bc5c54e33a1a82905902961db1f18a8f28dbcc2467e423c35e3d4edd9b951fbf91ecb456f6410d7bde9ecdef4ec0f546e30a9ab7d42f2ac74dde04fff3df0742bf70e18fc468851aa091fa98f6f76602bec4fae946b37692130f2255c1c47df5afacedc7c396f4fa8f17dbeaf7d2070d62070ba1b9841657c4925c46ce87fe4e81ed757a08801e038200e203cb95c071fd19be115482e42cdb79fab718feaf17420de49974e6102d3e3ebfcf65fe6c8040a29d31009217929cc1c8ad34bc214f92916dcaf9a903f19c53fb153db1279622452caa988ce538d139cb332a2bfee4cccec19ad169211c274af4773e2f62483012b262596ec0ef977734e91f4714ada4117b4e7b94cdc45a82f61dd7c821fd9972d8b88aaa1c2ac14c38d7e21a9efda131b7bfa056a99c3e4c713cf0d3c58c0e9a967bfe7f002545763447e36edce8da2b4dab51a133792a966825a0f76d8f8f60357f1ae726b86f9f942fbf78fdcd07b6654060fc41faafddd4d972add66337724e4de4f97ecddbe2c459e1c2f6730ad90e4ecb5ecb63a3cb39be6476b0164ca05e43d331f5dfe85d067dc0e03e59bfa81b2946b69620dce328d6b73aa2f6f8b2859bc35540f614c8f171f267cdf359da1144a2d7d95a2ddca7dab3b9ad9fe7e1395af3656543353c0d759880e7b6eeca874daf5c4665f97fcf37aa7abf187c8b132e26a5f28a226b67dd8fabfd389c72a60781272dd06f8b6965f571382956776a6af023a2ca6439a22de1d61689764867325fafee07099711fe9d0af410148ad915734f18b9f4956295334cd633eaa004a73971bc3a578ebea9aabeaba9d49205f44d507f537ff2168a625bc593973cbde9fd7e70b6425eee7270a731dbcb1a0b457b1b032b9a9d7277f75d44400cab4b56d5c8365e4a2086e5fc3cffd0acc80c06b1a8dd654aa903d6ae0f639d2a7dab8a6786b3f0287b7f4cf2529a02747f5651726564fad848d1e167d609178d813054cd6bc354c3b076cff27ea8b50ea32bafdf0208af67fbc8c34d2b395d218e4174356a1e8e7c19c3c730d0ec37f652758d0ff1876edd3082ab1ba4670fcc789a661ba15d526d2d0bb65ddec01bc510d8b73ffdfcbbb0ce57556ebb7d2f373290f9466967d1120bf17c047026dab5b853db2026fa133c793ec65b191dc77b60179d28e5a9d032d604d9a3c25e897cef1a148f68dc50bd523667123277b191f1dd447639c542b4aff2a5ac33504039425ae597076bfac615951c5f7ec1420c3c9252c20d5e86c47798065022932da8049f01f1bc6aac3122949a9592263dfbf47b9a5f3a3aead940f830299183aeca40c14727e7a6ddca75dfca0703503ac60f62877b0028a07a685c0dcba6fccfaed3e7862983224aec8d7eafc198eb6f911ac1eab29977408ae378f64168c8b1be1d83d58214331debc3fd7604860e4713b3251c8f27f7f17a5d29a570a12f4c5d02e8d0730aea41b89d7cd31c19fd3c3c36ad6caa9241cb3eff4a37456cdc0e1dfb6ae40c666414a05425395c52e19fe21fe508ad4c689a33dcfa8c22a32743e27f3accf599ca3cca3b1595279f31d5adea7ea1ed33941a32c31cf0ce12da546f6c470cf276845eb968f56c01e855299f65cd7776264871fec959f600ef0cfd937786c2d04ce448fde180df3069d88f8af68933f8fc9a758734eb10be191f7b6bbcd896bfa66ef61215c3c2bbdc2863e6a97b81c555504b0879de35a80609a6a76b5880ec4d5b23f6813539e129035c5cc1862d3885de79b2ee79dc675ea5e17ecaab57d6593fd84345a88ae803fba000170df42668fed0fbee87a84e6d9b911901d3219cd203536121e1dfb57f41c09d19acf4d373fbfd20eb2f810c0ddf4a92aa078513ddecf758ab013447a11783691ffcc21c68e1c1e5dbd2a90e062d688f380fe7894f184c2f206a3c2e4cd1f9807ecd1142d7f85cab6dd55e6444b2134afe19a6ff3ebe0b57657fc9a5a856375cee407cc7a758ae85fb3ab14103a396ac1048a1f89a84189b7a345cb3614adf7ec70d6941f120028900b1eea6eac1bb4a0c8c0f8b612965f8d59d7f68c1d1fae430486341655bbc97ccdeb5a7231f6d688f7f69b442e2f4f305d9901ea870edba0a596075dc1d5bfadabd1a3cbbdd2e9f41a50fd6209b70668e47ccf3ec62bf87ba83443c4e8c017cd560b6a72cdee7f37012a0e0829ee654d0bd1ecf622ad0079fb0c619f03f4faf0f630e26431f79ddfed90a22eb5d9b10bd2abe1ef24fb94aabbfeb8149259a4403b11330833899e3deb4eec3e612835b49e9a74b5d307477b79ae2143d35d04957d2e8b7b59d09485a9ce6b227a57f93b60c1c18530154a8f801000000000000000000000000e484adb2dd201ce4014594883731ff2a3fc61c06b9cb6a92ae9e88b9b97bd6f92fc254b865adaedcb4fc7c68c61a8f0a03265f09fbcd076e0881a9bb5f7353e6a032c206fbb576dc465096a50adb932e85279f5264616f01210a329c9cdc35a7000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000006cb765e3b86d91d927b4a94549344e364d1e089ec417b525286042f081cc6b58884e920f43a69ce9f676b674410e066203967c9b28ca5f04bcebd10c976b26ccaedd89016647fb2bbb5d04d6136b60749ea95cfc5efbfa1bd1f238c899e0cb6633b9295939371ef63f99444658ad0764e41f7dd68aafc50547d2aa3cc3bd62b9ef6251ee9c56fd4078810fe3aa6173a894ec63916dc2b197cf1a0c2aef9492a0ec384616d6e4997c858a8f6f6686c218cefdb6f3494a58db0aa00f8536d1ebbcdbfbbb22292c955e5f636aacbe4a55ef30b9f448286869c22ba23511d510b94f3eef4bc46966867e191d82fc83ff53a77210b2d82752a2b5325fb0542aa4dfc87117703ef010a2fd5004e0b4f1c04607f5f8b3d5db17b916b91b65616e72b6c7d800b48426b4717336ba4133ad32142073607acf859cffa4dd103e244bc6bab097e625e006fcaa18b0fe16a3c72b2989ed17ea543435604de40a9827446ad63403f14c8480c48f7ed36a46f061299e2a10ecc5375c37ffb5d3393b241f91a03c46330d4b2ba3a460f8ad79b801d97d59f29ef7e64c54d7cbc7fe1286102fe896c2076389af5304a3f66b4839b15eff29e28de9da1362b9af53c122aede95e263c118660e8c9f9411f4723e39024eb644e2e545ff4586d2c7788158f34eac896490ca54d6f1cd62c8bc8d1b78561348c487c560a943e8f92432246dfe3f81b8c7f975f24af401fcb38b78fae4d4ca6fede430ed9f61ae0ffd179152284ec2b54216c779393c76df3473b3680292911e39a7755fe1bcae37e2b34c5df24fcbdbb1548ef20a984d687e8f3998c621aa160d6db44fa09fef60e571a6b07275560e550a279429b2f1ec6c27d6335d9a35202908dac114728e6c73f12b2fb39a78b8668545eddd4ce8d472a97ea14dd99c87522fd0ce4159b70628ba187f63ee980b60899e516cfac8e54f1ab02db19f78ff1147a7d7fd63d400057a03649c2102988a0b611ef5e74d9a46fee2cc4d1d1458489a2fa330ec2877ee4eb625503f9c3e61060a2834acd8aa251de3092fda789760c4e472759a98caccd95a464813bbed8bedd5817e10a7a3defc07951c68f761701730e37ad7886bfcb52dd483c2706fbbe2a85e28b1858845b55006e6aec848721e8e626318b70022f0788eb07c703bbc7f0c6b76b6dd1c0cb341667121bc66f94f19dba9a7eb3d9bf6743229c2fadd78070d6aa4d8495d921e50b0b7adc042abbd34844dbb5139229989301751c8a52123048001220aaa7a2fe1a20ed781799ae8149817171e3a5004dc4ea26c31cef749ff0c3a3291963d6a7310dc38defdd6254fc95da669cf65f4a8ed921abf7b8102611002e58c212019fcae03d6c426306e111ffa834675c69894505fcb151c763d96c3548b5080baa9db17e44ddacface9aeccd5cc61202b9fa9cbb0466dd6fd50367165350e0e26caf0c8ba2cda00a144b530343c524a08ccc847f8e13cc604b4326a0d7734f3f75390b0c67741efe0d1e4568bba793011ca4e555821a0192fdaaf74f9ead25add727a8ca6028608bfa6d2a09d5bcf1733261fa4a90312dba67a8e8274678611e853b04765f512435b01681c82fb0b50ef03faae2bea229744404cae79effccd1e655cb0495194a14264433594c739371d8f51f90392846eed7d11fa415f4be5f3a69570389a55caae2a1abd72fe2429a6c5ccbbc548bbc1d3af61b7ca2316ff1a3be52cadd56865bb8613aebc5b50fdf8821d410389d29600b153c9b57f1c926c52c421e4364692a85181bd258273793cd59cf64dd9e2cebea3fe03898772fa05cb7f03fc3833d0d42ea0665daeee531a805cff0c6bceced41ad2da33b4b904b7d563bb0c4f8c2195feaeefd936c7a79f27d0e53717f173e8b86af7e5dbd56ebd502bc331a6323a3f9ce8df64df68290eddebe6b326091db52e8e629d01f6528b456ffbd0a3d6483b6df8d7b5ef6adbfaae53dca07504ecb37683c96e7c133982c742965820b4f91c2091d484ae9499225b0970b6c25747d7d8d15b015e1fac3bd86f3e962ed0b7808b0ea2a3fa0ab24196ea7eb4336387a02af3cd136341d65e2415b871196d2beb660dad7f738b33324094706edd5b7c38de66784318be01ae043776803fd63b1af998637b0e61cb9379d9df9f32452b89cdc79b1eaee5a30efb04b9e2aeb7e90dbcc5532045cfa19f1256e7f31698064314219f2fb07b307c8c660e8f3d5da5d1c2921db2ed3b84ba6a320f5ea64f79d3626abc09a1522da859288176cbfa304fdf0d00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "65", 0, 351114592, 1953719636, "7d595ad3a5aebdcfa0e7c47909ae05155107006a027b393e4a3aa70276de9317"],
+	["581e850502a74ca85d30a260b551c9cd93c7ea70aa10c2927e2b34f17ef2c19750ed260bf70300000008ac65530052515165fffffffffd74b727bbe0ad2ca11899a10d11dfd9ab033bb9a676318be6531275c4cddf4b00000000007a627d430239576f040000000004ac535351426e1f050000000000406d327f00", "6352006a6552", 0, -738612477, 4179206552, "96a6b2177bc68b600a8c537faea9795265e48a68794ae3a57356c9cfa3c47955"],
+	["0400008085202f890182f1cf32b10f0073d7a48ef5ed9f68a960917a47e90986f1ba0149dbb0383e610100000009ac5251006353ac636ac471ccbe037f08d7010000000003ac6a6385e00105000000000863516a526a515300d5e59b050000000002ac6a000000001999fe0a73abe40000000000019b1217218eedf62cfed350233991033d03d7cf90b0f45f5f8931edde70af66dcbd014897615566555040ccd3a6360c0b844ab121a17a0ae7ce77da8643e9787229f2322727d4be4f971d40867d39d0bbcfd2991afad3d90690efb7361bf48686efd181dfcbb06aab5fe0feac6c281cd2236e42e30b78b1ee06dfb387c008de8ac4e2632553fb8971873c2e48649d87c03f7179529ea2b90639c2425498e4fee03b5707ed2c2e346d31d4b676a081dde3174bfbeafdcfe7a68065327d6c845380fbbd99ea066afec4aa8213c49b4996381005f7d6da227a07eca181a95e6dfbeef4b9019af1217e9ddaba6a40ec8b51240eca23ea92a9323bdffbc6d0bc8df0e5d8019f61aa286103df0b9f855fa023d8f5b292199bfef737f7c4f8cc0f16f889fa49c4e9b3b3aaf5060585cf9fca2ce4f93306ddabd2f0e8ae8c88fcaad38800bc09a1522da859288176cbfa304fdf0d00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001f2e253a4ed1cdbde175805c2a51a7c4d7ad64b88e368c7aa4c249c7c011f3b97b35a4453547052f7d3740c3ed7247c1cd6fe7d8dc3970be9db47d54a4429292b9218ba367b0ed9b78c730a643fc55a9e82889f9834533833de7a78cc94dae11e6fdfe1fb1c52d7c03db379f7ceb76d84dd79cddac01982033f7366555465fb0cc525c2a7433da3d52e2f56795fd30ffe6bdd4897751073b232d1cbf241c70e72a4613ffe6c1411a1322fcfdf98a80872457db26e6c53e138ccfa8c18a40439e72cac033387c9397ae33b974b49e2d227b56750393e7dd13a14eed69fbe4d46ba4d3c2f3062ec549fcd19ff7b09eafc3ec90f7ef8a7c262ded58621aef36e44dbf348be74565e642d62ef64adfb4da7af3b2ff6046f75ce9ef34a45755b8f52701c29ff03cf367a91c9cbdedc2c4e059f4fb72902559b3cce863a43d638c73ca183c51e209ba04622993e9080b4bbe96c75fb470f850e9c7dc71bb2b43d478f148d07234de0d779e08570ce9f355b2ed69d4fcc86fc90b9757150c04f2d5680e1777298e32cdb2ab4e35a75e86ae666b2cc0179410e2bf0b17eb33385253512287ae1c2adbc5cff4a496bbd803712af600bcc0c63a10f10de0cf08e8d22daddd22ed0191762deb5e07051bebb0a56f393a5dea9a0cd070bc68b1dcd376d5ed508024bf1b28aef96149170452fe3cd320e93a6f353bcfbf894606d1d15a45e03e82879475136433c2e99982be184a197121c326ee140ead141018c6dce1ee15f9c780afd977fb442ff453abd796f0678505245dd97a7f218ccaa95dc318669d4b25fb92ab0899a1a24104f5d0b97e2dea771d6bfa5c832cdf899a6a884083fcca49a2e0d712e7b250f8cbbc5f077c7ff63720545991f2c801d79c068261a294660a68cc2061f1c382fcc56651f350932192ccf1f9b327871a9e682ec6876a13767d338b2aad12edcd0759d3e2a9c46af2e14cdb3dbdee5febe397dd122091ec02cc132727d3ace69b5fc25a33ac768d5b965af28bab5b8ee46dbaff9cd6976b8246d70cff8122a5f55c2a42dc9abc8ecce234a755758a9c5efeb919799b56d135dd938c579db523e5325866287f8542362750feec068b53dbd89e77a0993a267ae9e16e056ef9fc8f0107a791bf8e86bfa37bf212bfb049e0452de37e20eb640120c9284a7adc57abb8c692fa96ebc59b34fc7c5809469adeb93a9e989be014b94e281c67d47622bff7477513310237019fd84fb634af8d752cf0f714279185c07ee81715c089844f6e0d65d6f5a5e1c9bc4786515c15f5f17c3e10559f4a53d2d9c081a9da9b695ade3c686e27ba32e92f7adde320000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "656a52005253ac5100", 0, -479856663, 4179206552, "4526e487ef22fa0dec5d3d7f174c1dcff640715165e2f46bf997e3c89c87a280"],
+	["0400008085202f890416995849df0ebf1136d1567ced0521989eb20cf9beb7a4125136aee496ad158402000000026563ffffffff848183dd792f9eb107ee678ddf80c9ccff3c72621c647cb7d9bda206b1aaafab0300000000ffffffff31e0a969343495ceebc22174920e73bb668ae82acabb86d2e69de23950b7acac00000000086a6a5252ac65636affffffff827b52d07419273523fe3f23b0227da9d167b002cf939f32397926b7327810870200000008ac63525153635265ffffffff04821d4c02000000000152a501200400000000086552510053535265cee44a04000000000363acacf8ef1e05000000000851516353520000ac0000000000000000b5871500000000000366bb211d8470e6bd4a77fea9dbe5b7b8db8b44217ab2c0157d23ed86850518cfd8fa6828d2abba8b08b25f7d6a3887bc86746744b51f465bc3353196d47db958ba3b4de3bcdcf3a65eb960d881576bf4477e476c25a189df0adab0d110f0bcae3d611a014b8d27d5594259c993f29cef6ef07abd6ba7eaa58c8469b3ceda16dbd240734ed04bd77bc9dc9ba8b066c3e01cdb4d144bfcc7f3fd57acd6b7aa4420667437e0b07a0c62f4223f5df0904bd770972a8a48fa2181748aab21ba4418ce008d957f77fbf762f24cb9dc33922892452fae07daf3edaf5d012389d18b6d72e09a5cb1bf7c139b245f66f2b0f68ad3fc9bad34a6649fea63d99e652a440075c3e44c9b5feaefb9daa6842ffaeec580aaadd6332f95a8563bf3a553c47f625bb39261116e2732fc73d5356dc167c647d8fabfc14f4684e847f00808a160e95ac3281694a281bc07746d2dc01339ba0c0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000008b805ce8514c1fc59262d58aa63d8f541b34761edfa8f8b53ab0b6e59a9b07a06707096b09c41b822b69c254850ba2a7d46dea28a799eeb88d72291d4e8e9537432cff6f718fe9338ead332008ba39c52581162d1b75980b055c161fcf3aeea3b04b124a8df31464ccf75c107bc0ac128701b093dbd08c05669d43d758fd6a9898fd48acd5dda3a1b965b9abde2ee68f60c292f8729e90d5f5f7f767a349eca17c8ca9d83e4bff0d4767769c5fe1ae342a6cb736131100cf2eae7ccdedbc2c81cd71998b6e34884d1939031f4f0b62da80ae4edb59caaaab28d3abc112f1241ccf8555b8f570e5c36512fdc2495998baa761eb5183df9798a8e824c42cf4634fabcd9cb7339c860f9a024c98aa225a8d9261472f280d6ebcd456f7b1d1c7e315a2622c6ea09a518d9f4dda127b52aa2c253ce141f3a6d447dcbe7feff6494e1fc3281694a281bc07746d2dc01339ba0c000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000bf1d2758ead2512772aa5e3810d0847a70607444b2d9e71d8091ef99bc5bbc12873eec94a3e44a732c021990e3fe23f897aae829c0dbda185b2ffc64127b56039bb7443024034000a34cea30afbc9ee5740ac379895a8fbaea5b8edead2302490c1fa548780b1fd5ec2cf7e19421b2fa58328d4241991e781fc8f2fefbb449b12cd48966f7745ace649458bff3804fb4f6b2a608b3995a9fe47f1abe90a7948115cd6d9cab597ef4668720c762dd0ea6619069ed157d15611b194632622d0c4ff636165d26d7a74d17168b39fe58e7a5535636d5a278cc52bb6c2e33befcfc928d7cc4c2ed63f41f9071ead42896af086cf3e721a7e2bae8f1f6b4277de67d6747302f28d303e2be1b12e0ffa2d3a7978b2ff464406ee1375cda3ef8bdcad621b6e63c87b646baf9bf67f4e604fa36cc8177d4ade646787db7f13043deac4efec3281694a281bc07746d2dc01339ba0c00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002ea9e9a55566840082281caabe51dac46eb9d6d0632f95025fb6beef8da8a8d9bc3c9664471ad6ba9f5e6e90d38f28723064231db2057eaa861bb283dd836a9696c2a2a94116c09a92821e615f4b66ecca38bfb448a8b4d0ef17f3225787a62a9281776ac6a79b7a5fc07009a2254d1b50f98832a13699d737acc4013d550a448e4928d59f0989c9090dd5d8ceaa980b8e38ed935e4200523d5b068658db4d103dcfd38a8ee64fb4a3e7860f0d1c278862ddff2c3b38cd439e58f9284b768b71cb22b7181554f392c16597dba704d5ba167f55ee2e498e1e36975c37de0041a73eb6edfaad6b2017df4b5293cdcf7cf1999e3e194ed830260ef816643b245dde5688dc596d762326821576e9e381ca442089611fed0ffc6e634bbeb4a69a4923f35feffb7212971aa03d641c9a5cbd875639db57be4e9d222b870593fe7bba2cdb76b84e9ba20e103812649dbd32dd8f806e59a0160be4c99897269140844e7901d7f5a68810bccc5d176ae18970f54af8b917a7fb845526a23086a3a5e096f22cf4cab45aeb44910b2c88f270467b23a2a15cedc294f22da516ff761252775e6b8301776c812ffca0ba6afdcfda6db12a73d89c877eff3c4b92e420bb589cf6e519e4c9374d24ceae319847b4ef432b9107c511ddf1f82ccbd02514216d4ed1edfd2c40b319b1e99a48b3d389fbcbd69c624bac458e6b62979ef564934d10b5ffda7e155d1c53ed6a3e31e260d97983ffcd52f6c0a461f3ae7f191b5e252efbe8598a472f9d69b02614c3d5977496e413306da5da4474a09ce411861f1067e3746dde88d94dfcf10e024c376122f68f44a3be05ea42c3f73bc8b6dc6eeb5633fd0b123e7642b693f12bfac3e0e0554389d47b73d10abb5b7c8d18b49191975bfa0635ef20f0f820f4ef0ce56c2202e5e0133c9b9debb4d9386ea5b5980e611849ff8bd1a358834da9325716c8c619dae2802b6d4c9fcf7a32716ee605df7c95b1c8266a6c931ef774b216328dc31bd956d25b6fbf4863a332695dfe382e22ba2d07dad3980dc4d06f9e7fa815fe0b69250da09d668faf267e548cf9841be489348f8f1de49652cbfb1f23377ec50408983f29ed2fcc4b8ca4b9bb4f798c46f82c80656a47d04ca1520f35f3536c1d0f893ffc2717161bfc2143d3ce5e373fea28624168c882c664bba89df606c8956ef7623188f7db463120c3b56923b18f5007984b40ed9137168e584ad86f4076142ac6d34439c620e4c8ce3ed8f9eacc6ddb403ff8c725f5d851abf247dea9050c7f6ea189d8b21c742b7c66274f379a3efd8e202cb0040f9db932a638e322583b0a9c19b2285c8d7451da322a7ecb31f477eab88f2f16addbdf992338df11346819c634da9c437db636e9230cc905864d6cf801b0b36101d9843fc15567be1ae2082335635a496afc8496e9012442a7726c558a0b27b0e4d3dda16f6e7984da40d1a1ddb73f9862918cc82a1c669e5733398c0db82eacd9958a479f6867b3e0d939082905835bb32af4db09255180941416cfbd267f1c0dc322acca142b64cb33e13901095dfca103a3f876a349e599ad3813e9c97b31f1c41ff36f2546a01d07eeb21b828f4f3934023c2ea2b38ab4e80433a103ff0ae775b43a5d14d6225602402889bb43457a131eea22521b68ceedb90db37def3d129cce508968a43a9fc7b7fb48f772890ab38e177cfbe691e985cb941f852606fe8be09cb54b0c8750163e50af934a82254b0eed0c801f8ad49cd5c0421cd39f1d4111429e704b3be91ce812c79fe2d975173e4c07462f238be2d1d1112fe52a1f9a591c4373cf87601080759c2d6eaf9f2dccb5c531e10261983c44c715eb5c4768ddd138b0b59282d954411943cc7668357449b22cde419eaf08b9f31a52b5b28a9c4bf3bc8cfc1d6e4786fa74c94eefe6561c1afd04d8f76905c447a6ea0413cd475d43488d4234b579db4e576d583d559871a0adb80b9f55890d73462a65aa79420606eb8bfc71c63c58202c7a9264d1f93c7c8dec0688342fcf2833c60f96a0bf5a467de60d0bef8830cf43193ab615b7a75f31ec5c600db3cfeb58203c2b9fb39633aca520adb6f11632a92e069d14c4985b34abdc4a7570c552f035d2db24215fe2f9d47bfcc4dcfd36655d557bec915b31902f209f7faecc10e7074e8f7dce94ed22855c7b32e116736a2a776c0a85cf4e21e2a556897f6cc8b9868e10c403fb0b52746825844070e448393407d518f692a26296812cb43db091bc1607ac7f39914eae070c79acc40a2d2d6f59eb32f2562ff3e22953e8cfcfc66d4908e579a298048834e715c0af8141d4c9f9a633ad8517bbba7da355365ad264203095bdd1c368db55a363b291c4a73951495824fd34293ba3eeb287055d4a7fe2a0fde99bd0dc158403d44dc38e9a4c27856b20e5f3f193bc151483a4e7222b8e924127fac39bd9118ba80e2fbbc41a04b9d33ced1e47dbc7df6a737749efc2123a32f7b16fdd6f5545205f093360c8e1fe7afb10fdc22db8de33c2826f9081e1d91243aeb7df9783c0e1774bec0537a0eb43c8584b604c1dc2fe5bdd36ba2b6291196c71c02fcae6f237958136b3dec8e469f5fbb5394f4d137261112a42f943acff98e3a6b3cd25edfed9f5c7526d3986a21f771d3ca25a4f0589b529f30f294fd06025eda2c020000000000000000000000009e87c0f1cd63613b1b0042d46593ccc45389fb3d0bfdce1cb8b2ef5b1b8afe86dac813a47825df45ac2ab1b6cf98d3d364e7910d536e8755e7293400cb4459343309d199755c9f9700992da862e66b1f4ea318330e1e947e7f1b86e7e3f583be0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000031a35f62650529618c914ba51fd08094167450b5163f538224986d9569b53eb3234d9d73bb2d7ef63ac62a770055a0e96fdaa8fcfec86d5773cf88ad1d02369ed8e220642a9fddb6b2fcd27c7345aefea04fbd4c6df330c69c678588be2a10b3c36fdd72a3fad7f924e7bfedfbdf7f210dda7737cf3edffee24011ea0dfcff7849d891c0caec259f7e47e02fa60a2c34199f6cb5ad26e9323acb55c233834b2ef0adda89f5a95ef2d2d82868379d52d4433426ba1357e1c460be53bb34b7a1fb56ce83d0e915cb13bd7072bc5976cba601a83b01be4b00d63adb68954ac575d987c8d10aff1835094235247361f5bbc70cf00e417c039a960f44e2994a71c7782d9dc56ad9c95dbdd99fec2c658c30c4e73505fd6e88c90c0ba2de05f1e57dbf382bde96960ffe9cbc20cad3ff77059b601e4f21602a82d419e84b5dfab380d4a03a8f220f38661286b8c325215a25007eaad16a20c59e2b557e75340fd5613d96a8744918585f9fc4715471d80b46229da23a9e51be0df5cde0091ac0ac4f92470e9f458ec8572a06ff9cff8bb7165cc0fb3a95bc8cc89a345bad18a34569e07ddafc3cd0ec83cfeffdd77d34c3b5dc5a21545797cbba13786f6ca8b05e185fc314643b6e09aca3b0febe4e523fccd85a22637a4f2fcd638586ce3ec9f33b76d58c41c608e9c5282636010b4ccd36247afc95de55f1a3f13bdfd3ab25198e6a4a82d1fc0979701e0781c1c243dde30cb0d0767024adebd1495f957e8c648c2994c8eb4cd28ab3bc9eb20ddd80996eb8b82df2cfeb4caa31961544b25c6f22545aaaf4ec49fbb7bb1963ae81da6c1583ede782bbe729c6960205740f6e51c00d00a78bed056a9a8879f3a56787330cb2166ec782434c2c4e663f705f2136ba0dbce7913ec314ef2234766598532e5d774dad572e07c79e506249b6b0cc3aa736d898ad5379751b2f5ab2675b082d5efbd78af09e487881a795b071ee48cc11e5428468c1278d58b04ab0dd1e22eddb5e8c05dbf53e8cd8f21762b31a27a9cb2ea9d0d7756ee68ac9e461040468d0ddcc59acbee7dc947c24286f66a4331abdae6d1fd9b871283e926e361ac8995ccec74695dc713d5a784c8ea1804ec243bf7c95bc3c13e7c1b2fb60ec8e86c0cca541235df6188d74437176cc5dd8f43305e19d63342fb5aa8197d284aa04a56ea6ff309b859d70049e9030bd72236f41aab25eb11c1e2aee9ac3afbcb6818485ecdcd26f46e50d4e8e2d0d928b83184d6644078eb77c5d3569b9a150b8d8b02c1f72179c11a0c609e2c0292034dcf81f8d5338849138b8fb27b79baf59959fa33d48398a9355450bbf3ff66cd6359f3fc7bb441a6452ac4adb208a86ef8c627cecd9819619838a15372692d8b029b8588d4694fb7af61b8f42020b6118b62db009d7c76cdef6b7fe34e260b34e5aa9f28b2bea9e4d95d765c64f3dc40609ea9b62117188d21c7786c016e02939e62b4f86fec8c1025310757cbd49ee8cb5c13783aab32cb8d804fd032eb43ba3f2e2cfbabc124bd4a7896419e6f346af06108ea8a46152c0bf7ee421f69ea573d610c2fbb85430bd1b7ec72140e4d9254270443c5ac34b7d27fc978394edef997fa0fcefc640699ebfcd83af7e705d29f732024a9c799c6da34e7ed186c58273eb64baa4c6c27fa56950317338896cb6be935f0267353e5628bc3085b5b85eb0dd0fa21210064edbf9fc8eae479f5c5a1fbb55f8c838779246bb6783ec5c5809482110402787b784ff6d835f7b753d9169e8b0b02bbe914fdce8a640bbc4ced8346f159d6d58b9e34471ae6d5a6c13810d7d5f0c2b452a9735d89c81e8788508b1de9ea8bbdb523e55e4bbcc3383bbb3dd0868f2aa5bb4d9b07092d36fee0e3836cb0dbfc9884577783c9aec5d0cc5e2a7bcf9be3407ab1ee223d82c6bd90ff6b05a3b9254bd5db1ba923caf7b08bdea151de9de925c157d365afd4a82be3156e97aa463c8ef7de4b0cbcda746473bcb5c52c6897767231e00737e5da4aa2a8cf0ccbcbebdc3296d96bf05252aa21bfdb13a1f7515fa654a5784346e615d56a8cdcef414047aeabdf42193ec26149ef82c03caca3db9b73ea2ff614cb24addaecffd3c50b6b244f12c70f89b36a938df9dd5c8a16265000000000000000000a9b16d0100000000b5f24eab650cde9545050a9199eed70f3746961f00b0e24d8223ac382648915cb77757bf90f9b1493577ae5b046f3ebddc206320db9c470b426ccb33de88f73f5640acb93a6e7ee470f4b33d8870af7245bca9bdb22d0e4ab93c9a7e775e93af00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d97adb2c72a39dcfe140a0163a26895590292c0cf49614ffd465cff1f74741330c2a88e3b2720b28ced65892f10eb6da674b23c69ea30ab7f277e8ff833932da13687d5a6def0167c5ef97db2e58f818a52710eb4392c3c03421154594fa2fb725960fbf3d3c0d2f7e9b3b87d0db3d556e2ed7c688203106680cf4c7afc0cefb73991971fa6536fb230263a924b43bc61e837edd8c6b5442865b044a642ef4b25643fb612756c249c384191a490788939a0b5e4e983eb56b51b9bf076a183a6f54e9a5c34f8bffa1b47061108bf47549a5d7a4018847240c45c9f4dcb15d5201ca15fa2fa5438f8f8d672ee8eee2039f701e8a073f300b0f09dcb76625e063798c7dcac4e014a296fa6e38462d688254f3945498ccbe2840dabf3837c88d38e31a7e9865a4c3aca0790a01ba0955afbc4a0f77ce693d4a8c90cccb7ef06521e28fcdb5f49964c5a014faa8f2555ce7cb1613553acf4a7d3c5a02813efa982a667ba0dc88d1ecca373e7512a6bccede4adbffc506036729b0ea35310134b15ee0f05fd5765e3c7d3df67e3e2439e0bc3953cbab2d863c6f9b452f787aa643f1441eee24c5055e1d689be017a521c053d434e61945c51e9bebefb07097a8a87c7053f53133f8fe9667f62966826e1482cfcfa1a6bf88e42dc88b4a88e8e4fc91c7f2e3ba33c524c53b185c7a40bf02ba400a110e1a058ed10c5fc212e6cc982234bcd62f3c568f9045ed67b83dfa44f433c42c5b767fce1fb92caa3b53aee9aaa4bcfa73057fcf7f575fc1f520ee92d8e53669ae5b0c456de7aa4bc1efaf071b7bbd568923bdb6c136256621c4978745c3516ca3d41ddaf00ec532d03a8f89155d01fcb8dfbd313d3ba81ef6715e625a8596b964cab1034c14848385126d9c74245e63d5b252f6abe65b0dd71c33c1cd2b75a41af33b81de22b8bc4c7264a7cfb497cedfabb1bc63422fb7e154f0703b4698bbdf69de371324d16b232c754083e572774b5b7946df22960b15a751ba6d512834529b17b35103d95f49d2b2b32884d7e634d842fba429042b75c8f83c8cdd647df6f3f5810e677aa80935e69fe964895c97868df431bfe2adfd435d5099c02c90254f92a8a3802fb9e3b2ee4d972e2094618ec93fad6ce561337c4debdef4fe827cf4e22a0952dc1005330b2929f38e73964d80d7f17d8e36d7e82f4e38776a3d6fb957cafeadd1aa9080360431469b08c924312741c91db14447ef40e35627ab26f259ab6f47309bdcce58c2c0b5b4ff3eff38cf3d53f8564a3b9ba09267b81402f07b163c8001a3d8c74f52694f566c03ab754790560cc4063c4c50680559b7f09b8783da2d885e2526ec2811276138013a7cb2c4f079e9f6bdbdd1055f83b2b699b1f70a1274524280da610a3b6756bde80ac14ea3d11882cbf9ec312625918eedf9b6da376fbccb2a47ae5942e13cbfb6f8331498ddf03fc209ff53c25496abd45982fd2989339f6880789cad7905e0411868e1493fc36d84d1fb376814ae60cad57aaf0e7c8e59f21cedf2fb4e90e6f980bec45792f5a82d41187eb2cdd2a59a032617946892476f5556c20c24dbd60269bc86efcf86f021f47a2186d89c002e6f58171515a7539ddedd902144ac30e63616e566536e590b4cc3c7a7e8d313380ec23d880ecbd8f25265ee9ff34cdc10f1f8e45a5d11f700053eedafde32d42ef2fe80d95717c609e0714c6381a34afd73f53dd272d74f600672eebba231204c0e667fbc05b55afe6b5bad29e949b1ab801dd5300fdfdd4a5c460b5c35f37dcbf88c7bce32cdd16843bd18004216a57c827163cdee3958c82fe67be4e5a828d5897661ca80b95c98ac36040affecbfbcd358b9c96c40a151173805991343bb221532fba2e24e392a6007aea5e758fa15a28b7b988ca8806471e09859fa620ebb0dcee3aeba3b3c8e319e9f1f7c87d563e444bb2be6202432330052f9af12ca68edd7cbf8a81cb1d951fcdb23644874bdc0606ff29cb824889dcc6b19c11a72c34c07d9bd2e9f1cd47f9cd447b4afb9876b7a17d99f4e1ab236efbf77df38d936672c95f26e1be028291611dfd3ffe1a2b752e7d22168cac91129dd1c50c2408e8e21e58223f587d479ff9bb5cba2649dcf79ef82eb75efd7cb7a729b9d59e5c4c148aaa73f0984fefaff9b545d81aa920e05932ec6997874cddeb060c0ea4c60194bf93538032ec06ea34b464ee624e07523cf2cf63dafc1cb74552e792d5934569ec1df5e50f98d0a54d22c9e01be927fb668f4c7c837a7fdd375adae0900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "6363635151", 2, -532907741, 733220448, "fced22cfa3838f74c72cf65df946d49bb6987f294f4a6b92038d5536406820ac"],
+	["030000807082c40303ac6cb6144d31e85520f0470eedc7a998dabd120769125e966ea49b9f868eee9b00000000035363520d460a0e54ad60b6c24027ab40d0a8be8a70c020711ec5e94678d547dee2e35cee6f61ac0000000004526a0053ccbde503f0fefbe608e232b2955cab28f3e3bb2da3062032432101bafb42a7dbe788f3d203000000026a6ac9136966049c314503000000000028177f000000000000554c9804000000000265637015ff02000000000463530052000000000000000000", "", 2, 652732998, 1537743641, "95c13650804e91e75469c9eca8d856e774ff2c24170e83154a1a4e469c1a9edc"],
+	["f9fab35703f6fc64aec4fe32cdb40d5be1214009b2103cf6d771f66d50cd764bafdeb681f001000000096a63acacac536a636ae9ccdb05f7b28c69af64608f9814acf448e1ddc6e87c12175ebdcd67d5860d730c4b4bff0100000002636318fc5eb048e3a3a17cb70e87cdaaad15db7f3cabbad119506ab0d4bfd38db2c413685ca90000000000c826446702090fd20400000000016a0166900500000000035352524b04d80700", "52006a525265", 1, -683426245, 4179206552, "16cb441ab2fbbf825189d5c76b7bfe0f9021c5ae4788c737cdb3f417bd0cde25"],
+	["ff651827019813ce4a62ec87e6d4247fda6560029f579dab36be4ade02eff3ffef0c0550fb0000000000ffffffff01d16acc04000000000865510063ac6a52003b5b677400", "63", 0, 322818524, 1991772603, "3429a17d3f630fcc44e06d61817a6355be6eb7e8e08d438b652a31457b44539b"],
+	["030000807082c40301ca1e63f7c0b1bf5459d5a145eca0c5e8673b10e092fe2d93bc20b7ca81329c8b0300000003636a6a626d5c5e01761b65020000000000000000000000000000", "520052630063ac", 0, 814768377, 1991772603, "d041e6cad6d02f15f5b8d53e80bb3d3f4b9d7ef2947746c7b7869dc7be819cd6"],
+	["2c144b3604ac2d83a15c4ff3403dec601978504bfbbae5785dc43e43cfcbbc4bc5c9628375020000000400536353505b41868fb4f9955b0a3fe1e543c2dad28210fa481c8b27fe106d26ef6491f43a0baf3502000000096a5353ac00ac00515373ac09aecbc4ea1c48dd62497033ff3026defdae76f939387cbd9bcc68880b079beabbea020000000453ac0065ffffffff14729fffd5d9b38463d64eb4a9eec739cd3d4aca04e71c5b2cf0e99c8639eddd000000000965ac536563656aac0096828fc703001e76030000000007526a6a6a635365d7592204000000000020313e0400000000036a635327f4e97000", "0065516353", 3, 224019128, 3925833126, "ae420639e5481525c70c45c768dab008546268187ac6022e1b4d549a59b182a1"],
+	["030000807082c40304e5d2bc9e3227cac1e8746a0faff92bbfac3dec14bfaef58192398fcd7b5626a103000000026553ffffffff9402dcaf6f73598229c7927fbb8cd76ea8879c7707e14382fd903f6de9d3e8f4000000000663515165515191e435812a9f9817f82cef724e8fb2d8b0f37239fe892f5654a6769cfde7c578175361240000000004655153538adbed545b13f356723eba579fb3b504495ea5b94e433371061e3422e1fd7e1a5178d252020000000751ac536a6a5153ffffffff014898b9020000000000000000002b5a890100", "63006a525252525252", 3, -85109760, 1953719636, "5ea72773cca0d7bb83ad8cff15ad23563861258490333958d3fe99ba722de978"],
+	["0400008085202f890487f44a209adab3c27003342d6c0761687e7063821b8cddd40ccabddd3547f20900000000065200ac51006529fdba49a47100a3f6caf53f19135ee0953089245ac7f28a217be515fa073a283ee052220000000001acffffffff3c4d20d27d70230b342f3928020477eefab6fed5cfdf420f03483c4c8cb88fdc010000000163a388969a06eedc31f636262f133f37af27204683ac157be62528ab5961162f8cd23abe47010000000552ac52636affffffff03dd6b2704000000000500635253ac920b2e050000000007ac5300535265525a6c8c0400000000045352ac63b56a9f8931de83061ffa8f010000000003f6def2628cde9282adf8ab1f7592444cf6d1f264a70fab06005cbc50a9e172477b3a880fcd875727497735d3f85554d659b3206e2df6fe039b8c26685965172f9f828989078e7d850a985012401dd0175a1533adbc0bf78c3bcbff418eb6da43f5432b2a87c741be494f745e132a13b700ec6bc71128090f6b5d14483ea7231adab117a6e5bd6540adbf9560858cd9e1d0f1b4bdeb1da215af1d73b93843aa1a4e8d9d4faee5ddb7afac2811a098b98bce884dc60046cae5f208eb62ac3d6b1f3fc8516bc840400322d4cb7ee8c8b3e576d185b0dac4986c3b375a52539f8ac81c4f2e7425db5d1ece078c91a5764fcb2258ba44429c21e8eacde342752ff66621e35553e1d52a35b657ad6f90e6886e1e9f2c12e9676d7eb298ca5402481cb0063a59e871e70560b7fabbf7b5008abe478ba653e549782cf03ddb44ab50e06dbe927fb668f4c7c837a7fdd375adae09000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000e3b9ddc0e4e34db5b6fd6c3a23fdc3fe0daad7825925664c68063bb53cc4e3caf1fbbbb9f172c09ce716293646efa9cf639c1c69f991d52903c31f478824c372efb7e2c5e8f22237913b00011af0e8812fe64d14f742d860980c680144c58da918f689934475f78895d1b3ddb69bf8807a10aebd03a36b755d9d36a6f787c7c28f870276860a578cd4f23b9f3d9f0cfdfd12fa115ceddb17a32fccb6c90b04dbf3b7031e295e6e02305b307b13e9daaf40542fd2dc3804f456fe52f90e76416cc66a6f99d9fcc58c99688531b48b929b63b397412523e17a3438cc9da396cf3f4511e6a2f58db953139fcd87f1bcc2d954e120a3d811bac54eb8a428c7130659c35fd2793e34cb3ef731cb8707dfa2b9deb2e7167061c8a5c8347a72e32efc6201343d5879b34a590c15810c73bf72ad24113475a885621d56ba1b07780d29a6be927fb668f4c7c837a7fdd375adae09000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000aaf9d73c0932ea4d417f9ab3c106fec15fdc545a07d917dbf0ca2e3a16e0ea3c679e8b5cf54f441a75c81755657bc369c517e597eb9f4937406be36d6bbfe02805dd34a6058917a0fd52b27261e0a3e27f0ca10cbb554aeef90f3151a94f1a138f5ba58b20736038daca8e6049260ee577800fa0e86551ecfde0a86bec0ee4203c0ad1cd992ad77a1c8a96a6a6226c3298f4c15fc9ed46bba82f5a6a4892094e7c675b4870dc8e6d38d6d4a5d53241453f1fe14fdf5c2f5d2692e4b3b4931a53e3fa70b05ec02d4f6d287b8111f430ff2c05a1f64eddbdc7180a3290e76d23d8abba831089d6dfc0740141c10a142612d746fc97e83db06d41dcbd275c2958d11b415872b7352b9a5d8fd19b86c3adde410b8bb826d500fa9ec03ce4f739542c8244bd2050f247aff2146b3784a08b7a9a4ed10ff2f847c06240893307aef967be927fb668f4c7c837a7fdd375adae090000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000382956f5ba4c5c5a4f86b13aee10306109bf8524a2c80209967b2b94180c5f9d319896b0757ca456f345de46140a1fbb99a2da5910949ede64eb13646ad52960bbdc7665201267346ce6c6e1b07808429bf8403217c4b51d501c3971371615e111ffa7e47db9820db819db68cee1ca44fb95a91e974bb6b3c76c370fc0cc7aa8d7cd230c27dac6f9df3845aae244cb6a6e08ecc766024cba2b34c0693b4b13025e79f6e9aaccf995f87f2f3d14c7f7de1a2911e4f4291d8131eddb41360fcfbc9b8ad1314fb3ba7ce06ac274a800b33c30bd814e95891f83005288e0fdcd0b166fad59b496d291cdb1a207104bb0bfc98ef09f32cc7153c6ffcde779585e0474b2682f59f2706c091a5ee4d0b4d1f387913b687c3e35416408d54497b544320069daa05633a87beb9b207adf68ec368a6008b4d6468c76dfaf0ed1d0a8535d839c7e889fa9b424ea306c3a665edff06148974dedb623b78a0f65d53bc04f2fa292940a77cc6ca5c618b90897138451400f29f926e3a7edebeb7e6beab04d16588c9d25894623f10e6266f7b80e27f06dfe0f10d0473787fefd57085d278c53f7678412cb029ea3c0283f62027fff3943d7eb1f88c03be90c21bd18ef4b1a1b35902b41d07ecdccf99d99c6589babdcab4ac3e07add1d2a63a837d567c7cbafeee14d5507d9b68377bad77ed65a5f0ca15218608251b66004facb34596ee5938d9c2c5f89d0a24dfc165b381db4673271a1fe95ebdb62ea093409ccaf8643d2a0e6f72af00d1b6fdf4d5630530e3d35287e4fcb217e67a483f19640f5a59b591cff44f803d763d03da64c0319449da4015eb830ce67a8458d11b6150b1109876be4d53c85f9cf41c14ccfdfab3ad507828285b113de13e74df82ebbd089097a74ea495b8fd243e3e1dcd00487c33aca475593bb3ca06e02eaeb6792ef2e73c371514d40131249df08972ddd870fe5cb12e7d3b6143cba0faa58cef4c228ee11916d1c210cb0c7c3fed18b9864ce9cbddaf79ee5a34743dc268d93bc21aa8ff057e48431ff22cfbbb1aac780c90999b1b710c08369848a1f8ddeff8c690b1910218c04a3c2a1f274060696f7992c33b45f79d758a5bc7d6bd6c3ff1819484344b14bfb9ebc87b9bad59e33419720e4542fbcb78775dac84db1598ce4c8e8eab823fdd50e1053257ce7c861a2222bc0486f500295c11a9fda2fabb681cee8f3302d198a15a154d3df7f3701f2abe45e84faa74624e8ae014f4e346caad2af3781fc9c2cd50e300df9c7ee9d1f1a591d192e0f38ed9267829e797bc6b654a61ea768fdeef38a39ee8dcee641a3ec4c7445dbe0acee01097fc5efab3df75f160aafe036cc60a63613a0c3ed037c24be93eeaea8484ccb709f62c16a32f848e7344971fada5ff2f44b07be7871203f80fa4d3b569fca94cdff6bc1d1f9b58177a3ed0d0e4147f90cdbf87af9e45fdbea0526408fd61ed142ba50c1b70247b91795563c2388945d60b8da73248060a3263a298e528e0d858e1d8c92f2c5c559b476678f01012d950c67cbf808b4fc2a003575377a34e5f2990551ef17f6c261bcf822271981784498b30d2a657f4a63a29c393d7263724b7fa607e13acdde9e744b66f1d715abb248b8aed49c5d89f039b272f411504d3a37888bc99440656fd0b0163305c74d6a95dbb732696d4801467072649e4688f68a75c2a5724fa58a621a7e0124752ef37c83340b48d7a99c4aeb21fce4dd85c58aca724a66220a52d0232f8e71a40bf1b2deda62e3f5cb04c75ae5dedd41b0a830e718abc6e60a5b6202f77e3b97de40a496ec97371f6d272e1f0ba9ca890281aa26069e83f12095015d0b1b9b57b7b519cbcb9347e7e776320fcf5c99f873c93343dfe8883abed71e776e300004ea9c18a107055edf12033d9884b32733884249ac58fcccd635ec518a82fb9a14e9e7a3ea7a6b3ec46eaf77158e9b9da72de704938f3608772764e8acb21ae04864ac78b2aaea2dcbaaa5133e7d52fe1ca60b1d5467e025ea87db535de8db1d610ba05f6913fe6f0639481691b785e7729e85e8180d28ba8c866004f702f295664d7d2c7eab713639654f343d14e0a9813f19846b3688af8e4057ba62efe47805f53af64ad064b862777e54a24a9fc6b3818e0ba57ea23b58960ca67b0320db622d84b5ff5d5cb2308c1f586569f148b8204195202a42400f57bc1c269309cf0a716868c6e40911756e9ced601be3fa60e9bbaca79f45b82a2c61e5370d10d139bccc080f7540c5cd86795aeea62e2f1b02a5918d7d663f524e0d0648278130b97d09ae6dc7cb41301ac59a5f4d1c0dc13343d6ee4d852f598a02aa5f125ea397556e7d21c69615739cbe5c3e3731674a5ebe4f7d29692f517c627ca353f2d6da21da914eb840cb87b8088aed88635d5e87f089706481f5c172eed3e406765b9ee54601cf8ccf6daf4861396d77d9da4e547d02818e6987b069f3d53930bde62457128f6dec482d60ae3e42e186cad26af14dd7dbba877eb8bf6b4e49bbd0082cdcd7d481b06580777eaf65d787bb0fb86d49a05e722a9ca22aef6947dd52384bfa91fc20c8b55a84347f1744a9fe329ceedd926154dff7ad3724082eb6b8075098b51349c13dd6377ec990151efee9e41ff8a5671d73a2dd28ab5a55014fd244c7819e36f28bf62903475b1c599493926b26e87984b37ce39390fc82c4aacbacdc02ca9c3c696e4a81bf609a58a9a5ea5eaed7ac44855899be41c8bcf5edfc5878843fd3b8d2e36fa30e9b1a2dd66d1bc49b45242f74f403af262f6016e01173990f4413b17009f4df82e558bd9f217681b9be2bf876ba35bb65853bb0a947fe73ec255ab74d9d980fb377e9f60cf0c5dc89d01f19114bee7f8b2e22e8f85776504e17ba4a00984ad3f6d68b32ee944b975a638b5076357eb6b82ed7cec59e80b74bb73cbf442441c24528920fd4a464ec6b29c467760fd86e6a3cf23b71cad618236936e8803edb7dd2e8f364b06d0315389fc18a93a7ffcc98df3604cde76603ffeaec2f039ba7c05bd6d2576b085ea123b94f0d874de62ac56b4040cfee2cc13c1174667c3826a6c23bd4a8aadcd7252d85a15dc064ea0b4d31d5f79333a5810bf34c5ad9bdc402bcf9901803b75388c1addbda26e531f7d6b07968db3a1101d762e00a45f6a8d9ff54cc17555bb621864e05868d43a4204db0f5e16757e87766402ed5d2240f1e882a1d0e7b5489a487d22a2e3d96e59ca5711ca56463014ba4da0dea659853a625081a6352086a896364892048082c159eb22c90e8f69b8240e20daa8b92ce840c46ed2f340e0d9cebd53f89f6f07bd57624233d5af8839604337b36b4907f35ecabd91d4c6f3970920df8cf81d6323e56850c88afab438cc051652a5c881c2ff98331bd1e7852d83d71c18620f3562b202effb06b643e9b2900b91e3690f2e2ac47c01661e347fa2f6f068b60a9526ac34aa203cf84fec86a22b2a8a71d0a021f82fe1aed31140ab7193579ec0d326dd52778841850f4280263d8a04698d5e739dc5d66d378447858b31dd7cff42c4bb1eef949849edd5432fe7572108622a8cab4cd348032dd25d76cb73e72b05e59b1212a3ce2c70a41f48b52f9bfe9f8b5ab7ce9a7c50260bb7155e986da3e79a016e6e67a1bef0215c560dbfb691c4cfb8c6ecb949892e077af000531d67d556e83441d4dd994b1885a508a53881830ddd10cfb4c869e9ca3a4ac729d612c263ef374c8eeac5cb1f084480efc42d6afe1c90c9b77fe19834d00f6a71853a42b17aacb19086264b40bf872435088095f550fd2ba9db73c9d72e17f9a0734536dce58994e4b420a77f276b6370a5427e85325ecac9d8087be7813a887bc59e331936bf9449b1509cee0b46f9eca4f6279a3f2df00ad97dee286d84308b524f1362fa9638f57edd7817913b7ac1ce6fea4fb2b57df851588a18631c582ac34f117968b0449198d2596ed0360e6666bbab70a0c760567b05097b941794062cd4393cff3002f922090300000000000000000000000095a18085bdaffe0319e306a2a8dfb119f86dc5bdd362c4aeeb7351c8508083b170fee15f9b01e85405771be32bb3935c2b9ac8b1bdfe1108003744abcf8186f7b755e8e7a50317ffeb06112fdc8daeb722260284ceccfb65d001693dd4fd988200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000c7f4dde4a220a3a0ee7b62c4ea28a0c606eb8e85e9f4d3908aed9abc436f8246bfa3005ae0ffc1bd44562f06c82ef854945ade1e3911890159d37a92bebbaa226f2d25d0a71f402070b88159decd47a219cebb92f4e73d70836c1c1b7172f05d1966abc2464afb98a622c293eb461c51a2ef5233bc25710ea823855c91c7648b77e9038f1c96a0f7611eb49818d4f9dee2d1fa289f994bd4cce85c7d0b6949b82fcb7347b2cf8ed3c22d84f4096066a5484d20b704cf0d579575bc185e2eb3a1dc68ac25249e3dc57c9b032d1e29e16afd314718f9022f06c0ef1d93afcd5373cb66418c0f4aeb684ea740373beda29f6b7dc0b4536be9b3a092a8af866ea48c5199e740d9bf3ea7afa51f404f183f2674da1c7b358bced13f63dc450d2b9b1d55313fe6acdc572cede5c098d1635e5c313dfe7f2939cedbc910eb6a24b1b279eac25b20e354b81ed906b561fce19c63f6a13a8f02f267813eadd512a66a49fe12b65813a719f6d9929578c615d78e33a4d8a1739ce391c9533bb9677e16a6734edb8102ac4ae1f16cd75a818346f4fab49f83e24ab8be5b6a743f2d1e45bf7c78b22c2cf5cb2d5182dc4ebfe800471c927c63dff89b44a369661a3071eebf4699c683f984e133eb499061526b8a064d3dfd99cc5097f90d811dcc645307abb962097c6c36d40f08e4a6341bb6d2918078260796ed534b04d4d2c8a1097fdbf1b62457e6c0fe4c5ec6af75d9576f956e944018be260dfd90b8cfc5e7d837bc65ec19f9bdf48cba151d1e267579a901c0f3f36c50ff5bef28a8fc6be00e4fa718383ba50120eac596ea0983166ca49acdf5af815569854946d2d032ee22c08fdb9fbbba2bc7b61bc36f94cd2f87cd1d2c9c5027df7252be549d54a8304a7c7f63a1a222e0385e96d67815e2abb9c05501d871da90d54d2d684a17a2e87a069fe9f675e5b795305705913fedbfa780b088ee607aad302cebf640a7717b738cc359ff75003d43151e022019abb09c924fdd32392a1591cd3d3a34f1eaf70f9a6731bbc6c7126d64af358eefea847f36408d00126ff3f338d00f606f835f4588b6522be0eca50ecfb67d6f749ef3fe28f4a1a31ab475ab00c57f9318ac922e0c52e014a9497229c9a260eaf25a73771e451cf2bdebca0c4665e5a877b1e1f06167b4c1bc981f5aaf77846e398a0d84a133c309524174b51ff0768c74ac82102009834c34cabbf51b9563b59af85022f68dd3daee4b5d3fc40570625d95fbcb6fb237063b166404419e885201ebc0b92f18b4cfd75df7e0b175098014173dee324787fc63c717347899e5a20bcf97587ae11a72dd94f79d293ca7bedf67621cc012920cb48a700200415063bfd942256fe639331a96b13339656039ed8b4658a5cf6f866943c27ac45e4f53ae76a197799896af838fef44199d4641b078824e049e0d8f9723cac142394d10935c990c1f26af68759b7c8fa473d421e0d8ed2606c684d051c028f5aca2dcd85fd4b542304e726b4b6b557128c66421e11b82c82a6a893179d23d2a81b5c1d23f3616f457883536729e3288467d8425cae963e31fcc5e9c0f71a84c00f05cd5a90814a6083426b5753c06f180f7993e296ace337a526d9985cc09f21a872c16414a559cf1edc1c127e281085f396457d1ff06b7f3a0e52b1cd60b0c8258a698f88e38de420bfd2e1299feeb973cf6f3535c3944eda975da2b0ad808c5db25f2df1d7e2ad2b201966c688add04615c841746fb653a3f010d29bc17f35934fbadbed7871a6ca339855bdbbbf29048f2c705b956fad6beb730ad6d2129593698091ed1745139010154059e20c2492c839e90855e7939d816ac469cff3933c511bdd27493e7bc444510604986ef53d1fbf61c34e076928589d0ae253f2ddfeb2b1aee9375e9cc19fdf0b9a2efcb163e7fb0f6dbc0f26938426a400e9b266314dc1bd66e52f427386c4590aeacbf01ac1071ff42bce5f9045fe74eebcb2c492452eac5e8ef97008f9a131acb67693186c786c687f0e1d128d27f2a86de0f9831cf08ede239067f6a36b6691ff0a1b59de3e89a66df8459b7b4fc87a84739a08fedadc9e3a8eed45d7eadeb865b11994436ba9c8a987246a24223ae2a8afc2fc32f0c7e52850ebd54f6986700000000000000007bdb18020000000054dbb6d851343d593ff300e5cb75877e264d82aebb0839c68a4e42466f4e20f93377b267af3cbb333d04c7c47873dc22031241b69611edbc460130a1af0477c1d4acc286f5157256eb509a1e58a37dfc234534a6a15a8f1936ba0a1b274f8da90000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000032011b1b633b5a161a66d8aa04cf4ddbb6aacc3d97f779bfa21eb4fc33af20d113384b36fdaa2c80a4a9baa84c3bda3a5edbd05aa50c3310e1abe51f6de487969087f924626d3d12073939a160d593f22b5b0a411ffdca70179355a01174369efe2c0e8127802b3e0db73119f70aa93df7f391d2d7ec06b8f313c9e1ea60fdb0141af250a9745879b898e1bbd22702582dcc1408d5311c9ad274caa07bcecf6b2c969340fda0f62144e9688d4d1125e6f1d071c580503865da857be26029de03e24fb79506b56b13af1e54459b965ae7a17e5f14dc770de87c418c257a8512ef0ba47509b1162afa7b3910ede0a9cae7dfd28597db5dbef3994b9a67841e2ad9fd9ac7c9de01c04a456ceaa3d1e0e18634afaf2c3b8e641c0787df5122768c53e5dbf992f47a522884087f8d3a9f395ddc1a9e50b636d5ab44c08a2af120ba7780d2d9b2e13a599e0bed751f41b520adfb6431dc1b491eebca091df0006876c2b0261af0f186a0b9bb705bf96a88650e83728d63e6b5a4d1282a8cafde7f0158907446d8c19fbf4b62fb7fcea0569207e73e53fd81969103a322ca0ba0b5114424f07b1cf3b8e3d131a08ca6d4bfb3d16d43c3350697070237550889b2d141bd3ddd8bee2186c9822261e5c3e2b24abe8127abfbd63d66a39a3cadfca9d67f8b1ce2ca08b59ce1b6cb9fd41af1c1b70ba86b7c4aa215981533081ac9638b58c4dc6cc222efaa4a3244fb9e8a34792e1fddca5f25b0bb2e81f460a0be42eef79c62b8b29a099f6b9807b5b115675d54d4b162773fe4a5245a7b8ec6715514b9cb36e020ae31fe86760ac0a30bca0845be33fa33a1a4a3b192b08b41f6867d06c4d489e11c5487d024f196f463d953d0f41990aa5c20dfcd3dd5f2dba903e644abd0fc32fc74a341ee872b1f40b66f40de2cd871538c03b92ca8456c2be409e9daa1f182fe03a2ec3f91a3de99b861066d43850dc35f5ea22f8b07b4e0145a713290c2e3d6d6bb01a6698aee396124406db7831552a20fce5ae57136517c53eb2abab8182d7001c9b8f4ffa7fb92936fcb57e21298810a7ecae6de17c40906591abbdf098824cd721fffdb379424f4336cc578af4bc3d3ae9aedc5ae17133c3e58bb5d99ca6a063968b5f09dc291cf566d839b3d40ad0805cb85d6463f2a976b92937c9a8078d602fad825871f2f1e17eaa6318dfe4a249886047eb4ca5a89f535e76ca176d1b2dad61832810b8a61206cc29268e4dc1fab032c3ade0ae1e5fcc9b59bc4454a73eeb8455a6dbcaaa844d02427d42a65c293a7e50f32d3f99f01d9847f65b19fab81a76c8baeedbeb8bef572f025e0a40b9af83f5a833812796e42dfe0ff30796a141593a2b847d8d8e187ca0634f7e0862e517f18c3e4395cf803b316eea41dfdb5cfaf80d6f1285628b26ca3a4206cf7aa028dafc93a0b62392c2a02bba958a5639db2b18e1b1015fffb6e4e43382f05267ac4b1c274287f6b18c225ded351944a7337a445ab44844d1cd09534dca1c4a2b6255245480a41d94f0d1acc9454ad92f513ffea7e5513093fa7d6489ca7b8eec4fbc26dbea493d3426fb6329c3ee4abcdaba788900389d731a5b4518cd302b801f14a5c598439d4ce6163106ce6c9d49c9724516e0cf7d2fc74c0f7855f1e44a45991cfee127bf42e5472ad17fafacb02dd247b336d7552d2502f6dedb1ee4dc55d6de9394eead1b16b15a734169bbfec6e8cdd9361e7b5bc80bb9a1386381ff6806a187e9fd1a5dbee8792623445f66ef9722fb926646f3426f8f1fe4d833d532e230da3772e8d5f53ae6e9fac1f4e57b2afa8f5762ca45b703d272abfcc05085f4c398f6a554e3024cb3153d1d3edc1b4d294bae345b32ff88f5ea56f58e14d040e71b4eb44bf4569a9900168fefc7b6eb64105e3b1ea2d8c74a9496084561275a930a837bba243f0a020f0cef806f3c769933bd5f2a5f9940ac6270bbbd0b880abf1bedcf8a60101d03606dc003c5be0ba6676a9c293d6d358976d49c5d56990a9da94e530669101b92b33e57d83f1f02c51385673d73ef26efcc4c493518483eee5d89b77ce9aae2ac231546d1449a27a84144d730bf239c86763d38cabe7d2988da43f10618da9f31924ef7cae177907f07f3dd332095f7abee0bc3b31f49d0d9e2e4e366de53a45c7559a88f2f3e607f4a454f779b2e4844dda7c98e8f7ffacefa5b8a5af486fee81e9ef3a29258405093e956e4ba33d37ef9c583f2c06d73cb50fe1e7987bb94aab3cc672ff328258e723452f9bf2ba0700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "525200", 3, -624438409, 1537743641, "a36c59333138c7eef749fcd460130f073f27c1fe2185f3b5011ca2185a890c2c"],
+	["8013210504bda39eb8433e81d243bf3c38aac88997eeb7f4ed2e19dcf8452f1a172a7c743b0200000002006affffffff432587d40b4a4b32575fac0c0cf35d84f14cad4160b67120f38731f44691838302000000046a52ac51ffffffff18747fa51d450e7015f7ff50ce710de2636600daac11b56f914a0fbbb175cf430000000000630a9108e7d44c1f7a9db631ee48fbf4d40cacec88eb13d1337c0722bc5fdc9ce20cc6c2010000000900516a6a650000006a14b71cd102649dce020000000006ac65006a53518b516f01000000000252630000000000", "00", 0, 1535276253, 4122551051, "542b56615dcfa0b2f00bbe66b738af43700ad98f7136fbb8e72b745ade2cf41c"],
+	["8132c75501b4ef39145bda8c8738fa752e3711db9dc69a8d5721f2c27e5f82b384e7bfaae601000000046a63516505a5a20d0107d4ff020000000001650a75773b00", "52ac", 0, -174166231, 733220448, "14349c27ec3af503f63fde890e20af3fddccb9b22a4d787ce4a41e26ce754eef"],
+	["bc804f0b02959a14d53e2f14ba629b1c2e3e7b78f73f2878b403d1b0a372bbace0de4480010300000005655163636a935d83eda28b739702922376fc25e98b3b5f53d2f7c3f04d7ad855b62b805c9309bb311801000000036563635d9a8d1b0229fda005000000000700655352656a6a73187f0100000000035151accd4f397900", "516a", 0, -1149855470, 1537743641, "111b2b3febeda97da7883c45881cd33eab6355fba210ff96b94bbaf46d76537e"],
+	["0400008085202f8902d23da20fb140aa19c7ff069989d1002cff006b502660d5cd82e0827149fe5eb503000000025300c96cee6169cb99ccb7265afe375eeb12a173f86c545b26f67469591226a37c2636e2bb4b020000000663ac51530051ffffffff046ad9aa05000000000765006365005252ce74630300000000036a526ace69aa02000000000753526551636565ac688300000000000000000000035fc90dab6301050000000001289183594cbeaecfd64ac11faf7a331c1401d374fe0ae7cfa3c33adeeacd653df0d56ac3af72b4449e34ee6ad46687c2eb9ce01eb4e2b598df7fa7ed3165c6521c18f7fa39ab4943296d20cd52df09d6bddb3d4adf808828beaeaeeff481b10c3ccaca3e799b692edaf1e0d24c2cb2b7e460457dfcf8b1c2e7eb50a2f3a0dd541c5dc66389fc0d7e11e81510e147bc6bf20eece4c447970a4300e3fd61ff5cee733af943e5a72211822eeeb90aa23b17c3ea8aca8b2eec8ab689f78dd12d1e81989eb9a546890f229728b9b1747ef528c6575b065486e6eb43d6b65306e977a6273a9af3782f9470ac8639caa15bc6e379db2a7b0cdc2143c7ea47e501819105fe644e624c8200a623286481de42a0fd19a6109139acaf52682d5841f69516788ddd2db0304045e282a22155df1a5be6aac5b5886597039c082cd35e90dc90e3ab3cc672ff328258e723452f9bf2ba0700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001701912e2096a0f994b7acd699e75b01796fa90a485b2b3e422a565a328e19be3d6c636c2e61c7bbaf974225e4646487d00f6d011d5d06c1f0e16ab7ebc89e707bb6689b1ba80ca11389b137e16aadf7e61ea5634bdbaaf4555ca4a07263843c59c946a5ad521ebcb1cd3575daac8d5fd629816210a8855070f93061414307990be8576e7712f527f75ab66743b3a21d0eba0827500d2795078f91b889bf864585096a70840e6ec45f7720983055d3ba95acfdc7381a924a927027b392ce0cf49abe6a63040bbe55607d0ceb15923b9df4458de4c60121e4c7b0c5ec2e3905b1f2bd3a908c127d900f5216e07ea73e7bfb27f52364666e40e87fdabcf7f45fa119a58b966bd4da20015e055f91df11be2a0317ed63b0fcf68280ead5fdc234e3e273bfae529a7db12841aa507807e5093fee24b8a1dbe6f151e6f5d3558f373c9fe1888590623fe62939516898168997fb95882bcc3fabf5c96c7372ba700e844da9dfd05171d40602b43a5d506dca6e9ed775b6927bffc0e27bd4323da2e8a7cc9bac88168181ace3cc64dbf26819b1a57c1f883a03c2390c9f5e3120d4c4cd6e6657e6a12ee59d33c24507e4b4965d4629ac361a6b9c8b407f027dd146de5aaab78828762b1b2aeb748cfd15b602115fbd4e0d9fba3ae39acbaa89ba751587d491904c2498eea6db56bcedf2395a6007b977b5ba27b5565c094114167921c39012032102847777fdc8cfd92a85c358d872e4740c7db2e9c946d105b46df191b84f36ee96cc11a4fde5320b7996d9a6b7cac6416dd07dd939625c0c97f95defb3d5bdf1d03f2d26db3189bcf6261b3556599d2defd44c72251b2efb9294862af820599027f3c25921f59ae9128c41daee72fc3c3dd026c409d6405628b4e4454a008df2b950ab3ab33febd2ed0843855109eee434a40d9702019edec6797dc46568cf11a821c87938776b7de60574d758f02cc77cef1c80348cd96c9f0e749c1f1d475c1aeeb142f230bfe168e631537c64a068c64122ebb1c4bd647386abfa29ed5c3798a190ecd7bab577a8f9cd3cb9ad7fee18080189a6cb0c90df50107135096b0273714a01b5307a0faf49e6ca05ef45986cb7b26d067332300cde751a2ee79b18c7271500088ac9e5ef94ea4169b8d66366081f202a0dbaa2832feef57ddea029d585a0569488aa86929220b3ddc519e6c544788e34065a9f3b5142f144c675c37184a2af13e67c3c82d5a4bae3907fe5d24ce6a5f5ad2b93ee5fb07ce9ff675dbf772adb4c5157bc959cb2c2defdda102f26e773fd478d50818ce96cf8db1fd5bafd69d60c9d3b526a2637cf361dc17300100000000000000001160ef04000000004c1a60810a21c3a3a8eb54c064e2c1072226e01b8b4a7e0024128e8488ceb28bb02d8cbeb32c41e912d36889420fd80c39b8bed5b0059a7ce83269c3d301d6ca044263b9b2a7aa84c82eb8f08eccf2b32c738415f437ae36dfb6d7a992b3170e00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000e3a16769c91f74c230270e9f4dfb78e6981511a38a9c10f1c61be43a197106c1cc1a13af1400dce61a95ff34ca5ef35bb3bcc57c51db6829eae9a5e80fb31a4ed4eb121b702904db33e26f62c232d1c8ad9d2278396fd6fdf54b73b81bda4c4a7a44e7bca6f5e4fd35c77d809e90299973f0ad7e9220e3ba55d7683150ac298a6d835c44c71008a1a8081a870bd4df19f8ccce683554bc1b8319fd4b272049bd67ba0b94e4fbbe263d09590e7e19e4b9917a1b3f6a914fd7bc7b1ae7be4650d84b48c262658fcc3b631ef496bf25c39286f843cb91587a622c75e35bd9987b12497a0ba95235e9e6808ccad212bec4ee307556db410125e85357477b5a6678c697fa07588158eb790ae842445c160acba3cbbccc355ddbf175ba020afc30929743af0358f8d43a4d981e88a5f2ff17ad69331d7af894080a4f3fff13409a4045edfedb3f1d9b3cc949067fb470eb371b07bae7e4c6d7acafc2a2dec10aa5946dffca61ee93ea0a3ad172cfa08eba7895871096421a76a9f15bce0938ee3571fb6cb96bb6bbea16d09f4381cc01b14b401e0ad0f3b19c6e933b849c99f9b27ce420c4657c51f374e0c3db941695c2e580c7294a0e4fb76c9d3b31489b0cc0d877da922015102ac9af0b1874c578618f354b0ccc7d18ab5de1bc64796310bef40316e86999c92f2d6fc214a13dc57c67fde427842bf48eeb85ab6a457d2e95c1b7e5d713850c8953d2cce5dd3b5e705a0e72e0bb7a03868851cd095eb67f64abab0c853f80c4d8a1dbfc771515fadca001201e9e258e614a436fc5ca38b59c92363fa8b923a8ca0549929d64ead3478fd88cf61de6bf09ace289dfefba16d1b9e9bda8c969bc1665421486edfaa1333fcad48ff7e507bb159f299496db047492e6ae3088dac5fcfebc1bb5feb623cf121f1e9a9bded20e0fcb23132c672801e4187f7f1c0a4163d1157e0d1c657775f7d405cabcdeb22c42f59444d0f968d7f82b7ef07e44e5e3b30ac6a3747212bee66d84f3a46246dbd4518adb8978c13f51d4cb849b58c6ffb81a98fe32bfac3cad87046875c7ec385899fddc77813eac8095b4ebf6e89d7d0bf559a569e14d4cf1b32071bfa242a60eb308991d10ffde1f6c09da6961cf2442df5724926f7744d1c23f9806c7b0696df53630a5f1220e56f0522ed5c293f97cf8a7a91fc6061285e7efffd1af5d0d885027ca203194a1b00461dfcd131a667ad514bb9e339f12f889cee4e07709c6d093b0151639a740c341433f82857e458fa7fe4a04318bf12e0b1b93e22d9f9e417684105b7b3dbb7ddb2531d92de3aad9c6ee3dc9b9f67ac44d1f1e7d131f40b8c1b7b2e8e83fb3017e53c3a6e6016c8768371ad15f833e42b2ac40e5db4cc06066dd7f4d2f3577cac2ecee0b9685cf12d2ff7c5ecae9af7d8a8d187f6eb9a6c15a397629fadb179c37fc3d0424bf886b2e568db0cdd32626aa748f58f0332f7e52e6b306ee10de19e597ab2dc6c3e48532068a36e7520db4a97d04a9265f562ca1d4f7b72cabee53a8e84e5a1bcceffd3280f9ae8f4952706f66cb5ff95d53d98f5522ec84f69c5ea56e9c7a1ebfa42a713a9e2559530d6b2ffa87586c8f35308e828e6f32269ae8956f26c5fcf28d6d6e180bf38cb5f67d5259571fdfeafe401d15831299c992a65daf8b2abfddc13ac209d38dc940d2f9544467b07669a96ee01d41e745a38f16423061dc83a80548b71a3ef1da78de8d3c5aeb15a75d633789c601ec0ba5b52f1b65c960a5dc0c27fee998b1e4a16417c8088d96ce1ec06ac5eb3f894c1281775027d21c9012bbc6f5f3fa030641c881108de56b3bd29d9b3abccb08593ca08570cbc40c4eab62d4ca65a367fb5494256c833b01d6834ccee16fd6b3c935770e8826d936769c9df863b234969267446410c07116ad9983f977800c5b737c2f210bf6e6bce2b2a961a774a9aa9bf97902aad65b9e22baffba5f243d38bbc82f74cd57da0289c7762946ab7223a2c166fc4bda1bb541fc72f010d49ad6d3600226f0b97018d99acd264d1c9b549033bf37eb8e4d619632f43e1b29729e6d197453265dd7f13a23276811a2bd104156471f4d074fdb12a4d436e35ffd118e273c030f0fe83a246a47ad4925c3641d330d696460531f8952a966583e038028bb55b73688adc72dd7356f83e97d17c83df5d8cceca7f0634fb65f0d3c595a7dbd086165628ae8195b438e4f19cf6b6754609d52d88cdc5febdae41584511b22f2d95d065742276a9ac6472dfc29b6ef5192f6c7ac0900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "6a65ac", 1, 1390030872, 3925833126, "f7589275862e646d77c70792738b1712357653e7941e891a7170fc23e7e5e621"],
+	["aba8051f0304f60f0a54746165ced01820bb6e223bcf71598682183445a1540213255c2d910200000005ac6a655351ffffffff41b3eb8c4549947d8595c4f7ab26f9fd14c7d111b26788487aef4e6af8f7b71203000000026a53ffffffffa42c39a89ec7a1f7ec813141f29ee2f32fcff84976f060b2b2491819bc585b790100000008656553630063516affffffff015356ff0300000000035351650000000000", "52515265ac0065", 1, 824968081, 3925833126, "3b5094d138caee8be806266c88213c3c21dcdb32af6c7681fca70171def71b61"],
+	["030000807082c40304325dc583539650f9184fb3129a6ce66ce5565fc46b78d84190a5be3d077b7ada0300000005636a006a52ffffffff9909b2d3a21b78d9144a9ec14413c4c78ef3cb1135d988c4b27f11b8d0403ea7030000000353515101a095a7e67b63c5d25547880cb31df29f84e663aea149d7aaf07ea2770d2e90c58d52cf0200000003ac6553ffffffff44a3f334728de6ea2e02ac33ceafe69ffffe5abbac6e4c6638a1c9ec9fae9a4c0200000007656a5251530065ffffffff0217184000000000000365006a47fb820000000000035365ac000000000000000000", "6a53ac525252ac", 2, 1701200909, 1953719636, "bf5e2e872d7da52c3103c760149ea29062122cff448c3eb815bca744b56c5557"],
+	["030000807082c40302f80f41f6e547b2d41d81ce123c0051576bfdaae70b9ce92e92bbdb8ca04ebc9f02000000025163123bc36e5c3ee14a7fbe3f9843493e827fa5bf0ddb2740b6ca68a83c983e1d888219cff503000000056563536563ffffffff02184c030000000000096565ac65636a526a6585f06d0000000000096352635253ac6551510a3eaa080000000000", "53", 0, 517923702, 1537743641, "9c3951fb26cd090266228b81f31e91292c5c92cafcbebab853947bc3aae74b4f"],
+	["44abcf2704f39969ab65fe5fcd60f5effa3b5798c6f90fc5de2339a4b7a1532ca9161e8233030000000563ac636553ffffffffa9c90f91867dd5f2c25740ce923e07deb1d32598d1ec7104c53ac1adc25b02e5030000000253ac85c43cef37ae8d15f7279e9e2cf15b2de024e5d5f572efda23d27c8b7454ef6b28ac047701000000046352006affffffff28c94b01dcff7c78379316396f96a93fe3093b64d9c98bb4f766de14378ac54d0000000008636aac51ac536565ffffffff0113d8320500000000065352ac6552000000000000", "0000006353ac515163", 1, -1263998360, 1537743641, "22cc91e897727ab95ef6e6e9c9410a3538e055e930b5c342aa78935a27f859e6"],
+	["030000807082c40301ee36cfb538c68b73df395034c478eb638683cbe98abcc73fee3e185464b2b4560200000003525300b1977d220471d7d9050000000003536a51afe17d040000000005006a6a515278538d0300000000045351536a1099f60300000000096a52ac5163ac515200d8d8ff4b0000000000", "", 0, -1859381026, 0, "1c7cd6e4f1b0bae7b4d7fe99154477e2f5f7424fb34ba865160d2552632018a7"],
+	["a08ed6270199980c3d76dfcec3c0552f873cf309de55775d315bc9894c44c0c68fae37ebee0200000009526a65636a65520065d2fc87d6028c97b50500000000075351635365636527bf230500000000000000000000", "", 0, -1012580547, 4179206552, "7882d6d8e035471617ba369912ff0036c7051890f51f635caad8e9f721d0d26e"],
+	["0400008085202f8903b7f2534575dc8e29b8420651d722dcb272143ecaea8354d2d85d1aa02bb5e53e02000000036a65630dc5f4cf696cccca1749e40c480dd0ae9534c548aa409113c9890191ef20f1474131f6630100000003ac5300ffffffff872ced79c2c3a01703abdd79fcfa7a75e94ba0c87c73a2baef80f2990874cccc00000000056552ac00acffffffff0244a5be01000000000565ac53656a5380ab040000000004656a5300b2f94bd82f972f0b2cacf703000000000488c2949eacdba54e7574b47e499bb82fb83c2c8fc4dd2f6b6584b4516579845b7bf2047e8e742c67b476b5f3575d70077d5c2771dc076a04fa9250c15ffb2c383c782181c3693551c5cbbc37600bb7c827a2d0f918e7436c9d2b827f1361964b258707ce8655043f407d676f1b842a0141eb80eae422c36605c203500a665acb94e520e168d250718f14de36ded74132d347ecf700c530214704d398a2b9458e26c843f8baa1a35a195a9933481e474fd468c5eb1f9280ee5e0e3b184bde4b320e1d50c89c1e990a74eeb6a6058381113a2ac87b9a12f70583d76b21c796f8b01d2222b3635492f802a221fbdfc9a32f26d10185b179d7b852300d4c53f0270fc6ed3e1f9fe27891c1ac28fc189da2dc49390310439c7e54f1acc3eed6abaea3994767d98c8ad28451537d83222c1e48cc2d56330a05204697a22d3567feb778276a9ac6472dfc29b6ef5192f6c7ac09000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d6752679f0864d4302560bf3566282ffab432144a43e9997f265f4e5a87a61d351286872091c82711295cb0f9af4b72509eb8d45bef78579e7f396fe70d95462bc3be0321476ceec3d23afb5c91056fdf087fe424dea23defbfcc51708ec546c70595f21986ccce17af2ba17a9d138e2d69565f8eadea409eed037984241bb017269c7766ec1349e7559e9335391c7639385fee61b190f1b65dc33ad572b402cfb6b0ab249b108a2d11d9d7351c0d20a27635babb0f03d5f3f9ebf84fb7c8b2232e7d469f93e266395f1f632d4213a1e2f04c5b14dab233fdaa38ce417956854c0b396e985544684a5ac5e02e41ce22397f25505b781d36be4fc418fbcedbf4ce76976b3133ffa6bda3f79a49e075f3b76f3488fde1a968569eb430ef39316982985ec76a48cf81e19721a5139a258256a6a03deaa30c39c67a5388f4f93644f276a9ac6472dfc29b6ef5192f6c7ac0900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002e774cec13822238b819068edcaa91a9f343169ed0ea7342cb323a70e4f7c5f2f667510aa996b3dcabdf118cf7eda227888b3710e0ae7d91ac7230cdad684027ae74a940ba6c13a88e78d6f3db845b15c09b8c0930824f6a1e79ab995b93c5ac9f068893e7972f519cd10f8702b61bc02b9625b8b1b45921fff2b5fb60f0cc70942daa0b544a40c4028473f7b49a245abe14c980cb476841012cc914fa4df760a7deee8611b5ceb7bc8e2f834069346dc731dcf5ff4f3fecb98f99cbac048744d6204f4d11e1c87ab282873518223a645f182fe1960cc66d834f5c39a2e50e1a3d86e9bcfc782822e495929932923b81663f749d952d2ced8958901917ca5e4ea1c2fdf0e9be8dbe082ebee07be4c4ddb64d56e5aeb773ee537d629a07d6b1bc3cc7d0aaa7175917ae924cdd8256074a06dd468add811c53efc6a02c13cb0df276a9ac6472dfc29b6ef5192f6c7ac090000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000c22d6ffd74347e7766ce91ebfc0c8631a6141e96f7444ddaf968473f51a3d40182bb161a58cc39da16ae819519da5fc78421fb07f88ddce942b82fee237cc0b2fbc9c0e9bf434d11902b1492d0c962c526bf429e884f81e3de66747ad9d3ca39c785ae1a480ddee38e0d5a92a51494b08a6e3079a42e9e91f04539120ba753c037aa0975de07c7b426f7214ab2b86e072ffa95e94938523f241884c2f4d66e9e32f927838e7406f5c7f525638dd3bd3961eae3aadf48082c4c3de37bd1507be7948fc5440c2942e63c583bc5ddafba0dca570b44cde24f8a2b3a34548d5cc6c974a72daf76b53c9d19d459bf9c91fc9e1cd73f03cb58a9976cb010eec94e522e0c6ffdab8f8c330e8bda0efb5631dc46856cc1b2150bdce36905036e51361cc11cfacde1f5ddeb4c3e6c18bff808f670d6909715f575707a078a0a766d2a7d0276a9ac6472dfc29b6ef5192f6c7ac090000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000279e4e4c4ea2a8abc764b8eac6d8655186df2eae309b9f063335d0ff6b8f92a8ac8e7278f84d60f599e814dd5fb90fdd34d1d906afc7f31df2d73a0355bac4d246e55353584cb7a9bc95433586142f80dea5775bdfa9ea5d6266f8f591344e3e2fafb42fe0dfc1e5364c3d277e8378c767945e1bc005a8427166a1fa59e795eedaa11ab269b7651fe691bef575f5a215ed488278f13e6b8e702c1bd0c0ab330d74ba8ada9d4e67a3f0f12d868e5b7da5b7b34dc9dfe5143af339a196f949921e99b8cec331135d8db47bc02efe97e618c115d0cfa9a44bc0347f6d7130a8b0f507231197c758cb70907473cf91955f1b067b7867c0d6ba3f0654f30f579aae1d8c1b484ec7fd484e5a8cb6dd3b4e85b3da72e23a7dd617c537a8d82214c51bae56830e5c7a67dc832a811f7594dbee4c156e0b20ef0a6fb842196051753aa92368be572b141bb4112919bba7da0f469c7155cce0ecbea7cc619c3966a2abf2f264664fc71c2b294e028e0bc08e9b83a36a322409fe12f62491652ecc834428abffcce4427e0cecad31658075745d59a330d65aa79b52b21c69d70be543838145c4673913278ba474ca9dcd376934a67a5dea8d2bbb188416a7d4cbaf9222527510ea0cbac58c9079ef9c256e0e7a94ba8336e7c11902943f587419056ce48ef74180fa054c991f9fc48e5f1aa8ed1528e1391f10f1b1df048564bd1c0a92f73c0bdf15d659668b5fbf90703831987d592513668dcfe79f1934c35e8a1973f9abd54ae5f3141043d4d7668131a0b5e8ed37667043d3c121c04c3d7188524660faa3dc275d51cb35f00ab9febe86adf006f2e8d7b68b323e122707cb945401d3e1d6966cead283893e763397e75699b15924fc9c0cd53faeaddf18e60b4462bfe25825c644de19b743a2b1134cff73ca81377473334e91332603a9261d21a23a769e058a61094a12883dc9a73d880bf47a363a5f5cc16b4506f54b0e1ae6b6c1b5bb870041671e1f7f7984b9d5021dc0974848ebcf7333b838f4e0e22a39f2f8f1766d7a9b086fd2b8299e20533e0302f63807c0b6421c82b70ec5f1c3e7cdf94e5c6b1f935848cb32efc62f5164e526f0842fb7c36753a8a5e87c42eb47c5e3b1ea92ee5cee8c6d050066251ccc2fbaba6beda9bd3660fe6f617baa31285736247dfd0415a0d8cc1ea4e506f00115b4f90642cffbaa9600fb9239080545e8ccd3f67d45bf7397ce1df522a971783935a91d87a8c0118d7f185a78774e85983b148b91b610a8a5b865617ab63c65e8b01c2cc516b0bdce780a85f217c570c09f08a837063e28ed67ec5fff82c71b22c9086a7b3fc279e985610b1d0d7004ad65fea6610fc859a522ed5121173f1c5458b15861b85c35b4c63cad17f38a85232377339bfa2c8e77797111ee6a06ca409f3cca28f236ba28983b2d5584475de18e939606bac3f9271b2e48564eaa7d058551fe7c814e3d40ae66e04eba97a5372a77174b50d5906a25bb1c2bd2cd8c778333cd041f69875c26f203482b88360f40fc9fb5bd1aea6f478d824e330c5fe25bc314e51961f2bd26120ce6b00f3852e781558d7e5cab8da75755850ffd04e1bb3e171b3eabc71060284d9d13c71c1296a1a93d578b868f5852c01423f0dd24161c0fb8674de93ff38509a1542a04d82598068c075470c9a18fb3a784945dc3cefeaed33e4af5d1e0196f1ecef359a1984e3b284fea30758c53cf1d4df3363b5a2d4d8131e58b143bce7a0a9bf3b36b84d69191282e9bc3be08c3380160f5a00a97fdb26cc6d021a66e57ac755e17512e91ccfd50f4353c7a2cbafd5c3436868d5a8bcc221b4ea1502ac44533abad478b9121c6a8dc26b42af31eac136bb83ae053c7b2c7fadfce60fbf96f577aaa9b943ccfd06f470828ae5d29541bf446f76ded5b1fd945f99118472e545d869e8dc2d6ec58a3b2a9304d1c87746b151c56ea0db4157a76c2448c1cb418c6179208b5791456b3d61d6ca3489ce9b2dee04491ea7402fd88f4807c9dfaa5180094ed424b5624aac06397036fd2aed884ab02cd9fbb02c74a2185d3d50fc55b2fdefaa0b832ebdd38852e6a05079948b7ab0ee23d62eb8e01c93c407e35175fd72701e60e0b826723703b66397ca52d0b3a456901502ce34639985f09621859ac6c3c3a528490d6c2b2bd62c0f8297b0116b84f02be51197b096e7c6e79e10e3964e6d17a91f20b07320dc5098e12bb95045f71eb095c09039db554459341b11d12124d2e69f11ac1d980b95322b562a2f41bd6772de9981f38d4798226997dadfad9178b4e59888f0b543bcf1f6726d9172e1e4a11fa1ee479466b3fecb2cceb0f2a6d7570af8e8abb452e10404a8e806dc486ce2b458cb4c1a3043971481bcd7ca0ae091a49c2064b7b1e931fd4cd069f0b5128ad337b97b8ed0fb4708114e608fb7864f05b14c73e7ff7bf61f9dd0c4b9218d19ed58f4a7233f0394cb405ad64a58ed441e6fa44b188fe1895cedc81b2f47d1a14e06316c74f11f19e488677b4b06d07e39b88a163e4f24090f789d6e734feab55513a0218d7fbaeb74a8b01ec05052fc53c7c1cab0f8c1cada54e85861e5e919534169d43e08031d839fbb9cc97fbeafee48d01aeea4db75ae845463afd49401caabb973b125a7e5904bd0d0a0c04d6e8649bf5d177e34f002d8612e04000000000000000000000000347f121ab326a21fafc678c29b1ddcdc200e6ff286072513d2abfeab2807d122a16aa7ec1ea3cf235e7f733929929220171ad26b79d78fb091e0a1a8cb739ce39546d4b5e84caafc971cc0d5930876cc62c87a9db7a39d32e50fc65ce0adeb77000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000007958feef0c5e0c70f5ef72ac55b190d715539baabf60ed86a193f619ea71a5925eac30b6c16537539ecf59f77e901beeb7be9703b0b70c793aba97759989962a46fc970f3b8e6091217c6a90ac668cc673d046f99c3cd745a0a5d4af751b73352d745a9c362260229415d98b273488d088abed4039378f95ed23ec3c79c4122f91348cf6d0fd95c0421802a98e34a70cf57f9a6eaf1fdce0ec56437b706f4c9fda5b96916b6de347d6cbb447e9a6b86c8ebbe8b083c0f7e29e5979b2328a4f6b02f231cd9ecb09a278f5a8b491ef2abcb9d85cd21731b7bc0a8c4b7a7f3eb7dd34fc1aacac250363839884d014e032b47af2bb9f99293814f47bc5a41eb365927e3038ab920ec468cb80cf63d83b9481ddb53109d5f9bdf0cb9c7ab8550acc031a1a4a99c9d764d50d7cced9a1da53bfe3e0c6dfd513724bf7504e69d323d3463cbd4ae88d9aca91805e4bbad9b7a6cf1ca863a088d2c7a4a797fdbb0cc3d7402b4446ada2b9d366ce0b589b70e900b1ea9d70fe22b6b399903f07db016cf594999f7dad27e70a170e1ce71606382424253245d1d86d114c8b09962040a970f998bdef0e80ced9fbc75b07ab894ae5c6f3e4f6f332fcfe5c3af184ea6a8bc8184a7fc4847174ee5b20326a54b2873ceb5d6b5ffcecb8757c045926c0fbd09e6b723371f99442bd7a7bd969a217a14097d53c8fc9599be09e4c36a12e9c416093e67b11d26e42d21efc4c270217eac1ebd00a12021b8b185ab6cfd8719d36c1190665d4d5dd4d8a6173bac7429d844c1ef33bc39cc07b1c8d8fa7a454b785c0b3b655a682570e2fbc1c7700b3c3480bb8c69efaaa3acb3389d038580e1613b941b4adf84e7c9996ed8304a349d204fcf87293386104ac9ee72cb8a6163a65fa513165f56c0c5218ac3dd7abc199fa4a2a2b5f0e176cf0808bcb8dc8d04ce7aec4d8cca81db56da0d2e00004cd2f45ae3dab5d4328155165af0c78989f22ac80b20b4e98d566f7726bea374158d16da7e724349fe3501fb35d64ae0a10e7913340e4ee31a3d2031a0344dafa56201da5048ee3aef77e7b6fb7a111f9949cf3f2438b514ce02a971912c31d1c086ffad4ef2b87928ee0c9a4d2e675ebbc8ed79d1ccefd982b9d1b27287cfa06f46289ab212352ab461a37ae29492c8a162cef1c526fc04ae1ba2044bf467f10261b94a9ff39ffd7a5f1db9a3dac342021e51cd9d28491d5ac5d89174624cb6df62fb49c9e78220baca28b070d5271dc166a109855b36a7f397dba64c04d840ad0d8a09471aa41c359959fca99d926235c73df7a36a970df1c0819f05de19eb61a9ba7df8718228de9d981eda502d5879ca539110f3b7acd62977411fb50fc048118ed8a502a1f28c860cde47e7c6b59742945bf37d15d2459ba952fbdb928ccc83d9b6c42f3042fd177981a02dacd33f2bedfc858c2e47e726b188a49024d40685262238a17a171db6c0b343f80a594a99ab22183cceb44c518316e6dff1da16d791d77170906aae004eadeed055f175dad783758e65a17c6a3cff3a9bb61506e5690a4125e0ac1e6dd31cc8be0c6ceb15922d29ac7663810c92c8f6cbcd3b4d2e76194ebc586095642531b15096b1ae495565c4d0fba8a38cae07a658e9a7e0299e9d0c05e294aba552b35bcb8698e1749ca6f8e808bab47ec4f2d0dcf52ffe2113e57f6772689f6c5ec4a3d1544dee6577ef1147faa0184302015871b09bc0e66192936ef2eadbd63e2919c4b6d5c6c2fd11a6d96b23b7dbebc55ba8b7eb942629a09736f11387dc879ef15f1c2fd06e4aa8ea3e96df9338a604415e2eeb73c083b8146ce8b898918a0a6188caeb2c8fb2d6920f3490baf2d95eba535e41de0540474eda114ca64908b79eb1296957384db21410696b32760d26bccdd7065634cad2d2f7ff0d9bb2f1af26d0b12fb6dd06aaf3fa6a7728a458bcafc1741c053c40cc6261b0c9b8bca54266e1e26ab520fa976851a43d4715e5ccb32de8a6e485a5cf33fee8e23d60625ac6506ce42185310ab684168123023fd4004680048c0ec9f99ca576f567b4c0874ef9ab33f8aa7f5e30f67805013d115cec536835b8e90a8d8082012f7baaa29e93e010a3a07034f375d02c875308e9c59d35a6f03c0609172237b320000000000000000ca7ee90300000000126e1d66f9c5b44670a833cc192126d57bb37dea7cc3a5ad75302e721056c288b740995c93deb19b5befd1d5280fc17eb7e5053a6d97ea505e64d7d35451f231b6acfd7d58ac126acb1f8bc26b6dfb4dcb3089875af70f9fbbf7487617efeea50000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000048e77d029d3b3d1ce30eb5d7de80be37adc5fde3de21666c9e15eab28edeb51f6d6ea77c9dabbec4f5c5744d27540684b0fcbdd008576447fa676e1178f89e31b767bcd51bbe6ade3e877a5ff76c30a77005477060bf0f336c679eb27d85a7b5a31d605d3069f7969b7ffdd7a04874f7bfddd790783ee1a14ae50c49fa0f0bd113dfd5f49dcedc95fc61dc4907dca34bcb1ff885584ff9e7c090760b1b151dc627a9edb2d0e090135e6e4fe8e5e1fee59938d924ce91ea61cad17049253aed8ec1835bf1b10973341d4e6d1574f02635dba628c4fafc2caa930c31190b4bcc99f2b9b315a5c10ab4cc42f12e37d6ed9cfba4ec4087239c4ef3f9de074dd27b9fababb86e4388e3b2af21e68bfd8b3dff00e1c68a4390406de304d4705fd9c05c96a097be7490ff7883f6f7b9595e5a90c18314a40882051d0154828ca71af88dcec5400d9970e08259f7699b78ec4da20ed5df7f6eaddb7b325ea22df51cf20214e48f69b4e1a8e56e50ee0ef3ed2103ff0c421851aae59afdd6a25ebbe8b04baf961e9ea31284873aa2510b7fefdc8a07cd7fba2aefb5e649b08574bd2a9a3b624b25d762a690a19856303a25a8535f61f57f53de4dc53ef07e19b062e8ad8696c088cf36f8eaf24521a78931637f373edb12a49439eb89feed9b072f7db09a72fe0bf4623bb9c68cd485cd31105e07bbcc846dbb3095f9f134340f95eb90cf9d8d86208076f4615e041586170406db4dd8a923e097111be691215412c387aceeb064a5bdd8763d54cef8c29df7c39f39646f2fc21ac1c6320d78253e224f3e619e0a523846907a0e1898d8644a129392ef361ab4231b6079bc6a6119456f32a1aff6708c2e8134e1e1de8c55418f808b92d7f5056fed86054a5d608e848fad94ec160ae23132b6ec937995167fd67b8649901987e8feda30dd53d9bdfde26a54d7128bd34a9c41d0cb7a408fd97196ff58e3d6bebff0ac06f91942c33399844623fda5df0258085cb081b5d089af5608af8259b4707c1f30127b4b12fc00538f009f1a3cea8ee17d9a0b9b58c79a2c460ca52cd1d330712912d9b5c6a257d4ffe51d5a4eab2ee714bb95b2e6174c404de786079f7d2e5f7605c0e697bdf067a901d47a22e1f601b7942c6625800439923aff5011d8c362b032a2941882d78471b7bfcb2b3a77c9b3d10c544601e6eb6fa2199a8eb3605b7d8514af7f08ec2919daaf45181e5b1c5b92944e7de8eb1b47e1952d79f72a24ee98d86cbda6819486800a6d6f3777be7a10f7c6f2cbd204af6019f2c5cdd9694ffec9ec212c4e1f3c7d8fbde48035d3463a090b71237b04e50da5ee8f3b585e40208b0a95306c9f394a15d00141bba515e9730701404f494e396bac66db996d033c52815918365f41feb9f2131c68d485c7650b9ec5463009debe874d2cd252874ed8b69bad2ec18cb589d5c7daa0cac15c67d6c1c95138b2b838bf1cdeaab5078d77ffd553d0356c2f0ef62d9a21df487cd88ac5210cdf987bff5137b2eb4435025468e9a74ccc4bea89e47be79789f6cd46dd95afdb8487016ff3d97fb187fcb2829f9adc10cbc9d587a28426e37379815ba1c9c75c6185c4bb9d0e2f2c5dde659a7f49f02e01e0a39866a7aae0aac8dfde4f7049f8ec3948ae5ed7aa3ba70a92447f5e71cda928c70e6409df99226ee99aa951159e599b86f85c27223a085d64e7a0ea2cdb89f5cd7ba9170129d1fa4bfce28a7bf27991ea93a225693cea1dd713b44904ca15e165517e6fb34579db7bc088aff1b923540383c172a34b11df2a7a82638e6acdff0c895650b1295a1503d098adfedfbb6f927e124bb81106a545c007354f8004035b5ca6126590ffa7c4015bd62c42e9a0732dd9f04fa49db63dbd4d5d039b8ff3cc021fd3fdbaa7511dc4a254ed3f857baf89c8561bca0f252b53854011fb978770239d90264ff90120a078479901e2095f40a30a8537b5a7509330961b095bdf6e5fe24b74f8808aa79d70fce1ceeadab4d0d31cd670d5a6e26084ddf25b89979712f6855730722cc74391234d30d07418f7a310980600b1f4896779bfaab80333f377f65a69b6a76749066909c9306926c2ce1e1749d403286ca81228d59388c684ab58e16de4f47ad258428ac52f812fc4bedb5d8cc32f37d035033574a6430ad6fa32034f1b81c3b6c2f158e1eba9a21dc33d20f7332e0e01230d401480726c2f6c8c64343ddad40fa1b4d10b1cf8f6ff4227591fdf75469a1ce8a4ff732af9207fc12b22bffed6c2b0c1fb006e150f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "00ac526351", 0, 1615289869, 1953719636, "f4711208850def95df5c749bc0adbbce9e3d60277858d4ec3650194ceb964473"],
+	["21a45a4e020a7ba04ccefeff020e23fb61779d5f1547ffe92b06dc60e0fca764d29df95e240100000000d5cc6230539d1f7bcd0580a4ceb2643a0a5ab88e74849252c03288e287f982fa87ee5ebb02000000010010b8cfbb01f5c45301000000000265ac0000000000", "ac5153", 0, -560346945, 4122551051, "ade30aa74026f8bbf808e8dd11a58a73288a4932eb4247439cb8ae7e730770b6"],
+	["4ac41d37013cc43b55547ec8db9b09c2aa27682d0311d8bdb65afc29274dc54bf7078791ec03000000006a603a65019f0c6d020000000005656aac51510000000000", "ac6aac63", 0, 1105088189, 0, "b1097a7a544e2924c563b49fc90d85884ef74acb9e2bf61afc2b67975bce674f"],
+	["0400008085202f8904de2070cc7c3826ed15733c0c80b41b6780518b182f6b168989f2fdf1fccfdef203000000056363635263ffffffffbb29afbeb9b10e85bdb997d540a9c559700b5b63e232616203851094676bd8bd02000000016affffffff40aa61499fdc2990ce0a3f90d54bec7a26400558784d6a963fc2203e924767a803000000020000ffffffff101fe01d02423e5c580654ef1be24a437dc8657a9ecc08d2582699ee4a79a8f801000000009aac680c04b1db6a000000000000c218d903000000000651526a51530068a5c2040000000005635163515178f43b000000000003ac0052daa3a647000000004ab58a0300000000045273ee4b9fb2749aa0d0d6acdd04cce9ca48b5376fac58d9d023f0ed0c371a64573c45fb37a845c4974b7179884906367da31861ae80f490a887dbd34c8ded4ab38086147148aa5a6b0ed2bf889a87d843c9503832fac10a9384fc6a64bc2e304e7dc1683a783ae607943dd2ac1201208b445fb29a941059b67526e7f4d4ac0cbbaccd8aff826df5671ad4fd1ea5e13665ecbfcb28e686765e1c806246cdf495e42dac2fe0b7e813ae9fe92eb57b5771ce47dfb3ab3da7d3e28a47fbc43a6a0556da233b7701fa5af8c0f6e128cc137f29acb7b63fccec3d8624bc06e1098fdd5a3aeaa9559cd2704522f38dd8b213cb2ecd688f5ce76e44bfa9f8d33fad6930cdfb737691c04e2895ec05e70d8cb36dac9c1e69c46bff23caafc11c6e9bfb3172745d24301151c9231942de2f75baddf1f2d838be54d12efaa7fc5f5b28ebd6207fc12b22bffed6c2b0c1fb006e150f0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003f04bb841712dd9c8bf41804a54f515d62fd4b2c9d4d314a43275a09ae7ad69db0ce535ea85e773be039aaa00b2f6e1230a005f4b5769d588538da8ad095ab6bf3437c10640dfc48185c62ab75ac987b0d053f3ce8634c7df983072142729c4d4b4f83e162bb384bcdcce3435690071b971d2b40bbe301d660f9ea37878d01c86897b973f7362e27f823fc873ce8800bb610c0f2a7d3ca6048c1195b4549fc8f0a937541413fb911c85ff3e981d885917a8d859d577dbce37cdcab667765ce34653dea91cd1e93fdcd6241a7db52c14b85c2a8f0207efc0e98feb38fa9e1e708962d06536b68660202ab37bbd70a3493c78693e1d36294d340159b7e78d2b6e8a76c9c4d21c069636e0b639c998de0784d7c8f1453ea52787e7cd33a237342396378da46f89f75ae79d58dcd04ca03008bbb1f203c7902e67e1fea05f15b3124207fc12b22bffed6c2b0c1fb006e150f0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001e2eb037873790d7cba55152d99bc205d5d4ede79a0a6c113700bbeec3f4d29721a700c015a3f3980fde0dfb960e419de9c6aba82e632fcb7813c5a8abd44710f77b91c390b14cdebd8cd432acaf5d5e89a94848aed104eaff67a47e1c6b0147f81a11a53f50a134d92fa34441fcc13fc23732292c5dd9327a428792c3b06332fcda0ad87f778663bc1c0a6380e2b2d326b5a9cf20c1d8e29420a34b5f60dda212c7256dd4b69ca92147a7efdb392c11a28912d97b446a0d6a611b4d0a271622c4f0c0c4353df12f77300306ae4c7b966efc334e6763ea26e55760615554c3717c478f56354875ce5dbd7406ef7e45b38c108134ee17b0706f516b213cfae30a5f48c5a385bc82d6c379c4dfb041156fde9278bd155ef47397c6b5cf4564e23494a9cf55ba9c785068f510107553c1cc595c6550cc235ede847af79c5e86ae5e207fc12b22bffed6c2b0c1fb006e150f0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001ccba9c693b78f934a371edc68c9f71d8975ab1b460960c6d388b0c666b48ea183cdd42a21bd76a5ffd1c4cb2c44d5658991bae74631ee0625035fba05e8081daa6337ca1af9f15268ec7967f9c8e9f1f0f2e4547a040ae59e2b82cbc7a1b51af9c10e237ad2eeb0edc5d67e739bdcf7ab2180fff43cd7500a7cae73946db1f21a5a718fb090ac725ee4784dd0f4bc712c010e4f7563424b1ed95da7d848044af8fbf09408b868fb666526ab5c9e4bc9353f9fb857031f9d9489395092d2bfc655938065f5e1cbc8718cc2c14a9d251dee49abd9cf64f9493f64ffa53c9e16aa811c4da7036f96eed9c1b0a8808ab95fe343a7aded7a3072b15c9b6f4b44f65a307b4343ea1507a514ba3d5dabec208470723889f35a22d1021135a6d1df4e7f5893955ce890adb5b5ac3b56cfff5c17efd298e17903d2d699a3647aa2ceee22207fc12b22bffed6c2b0c1fb006e150f000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000037f572177e48ad9fc7f58effc62e951914f9e9edb17b6f3fb3cd0cd9595b8c95237e5997f7ce0db1acd6e36a742b1224dfcea3d7e608ce597b6eeb4af0d8e026865dd0cfc71b4a80a20f12344ddf2f6a7a870eb0490a37fba40152172020cdb9b01855934d91d0d61078c4977144dd353283c07d4922c7e45d8fa4c2941bfb3d00fa56fc90edde1ea40f2d0b68e0c1bd30b61fb7995e8b60e0a7de9fc4833351d386061734b48db92eaa13c12a4a8b1702c7f3f07c604015754d31f8a78af77347be01d7ad2f7c9fdc6b119fff3feb7a340d53a9da1870d2eb675db14c315a03d55a6e5c32c7559c7494876624d848d3a4ea5ca60297a65f440eda3e66a28b54ae60e294a8226492325082ae63187cf2114b514f6e05ba2e5d085433b6a36deba1daff02f49b84a2b2725cb54a7e30ab6f54ddef2983a93ba2c2b2a4975392dd0657a67422ecaec542d94dd1fd5b2c94c3f055ae2b83a0106b567d2f76408b728373845d868191f5dcb70e059b3c57909a338d3426c02ee4a95b7b81b2fc5e34f06696f09b199b2c375087f7886f79d2c9b310f3ae5dd2a79153ff9479f8ce8289f3b2a4df8d73177c0c1d1b4351b42d702af6aa41d465ee1757ddbecd85bc22a38c7c790796b1436290d02d7972bd12a0a0c13a39dfcf303be9e3d52b2b3720adbd00bef4d076842b16f6850078b5241d004ce313e2dee0e951f527ccf325265b23d2e20e3e53fbdb8cb1327e09bb18c94c3ad1ff803d5bcb179d33a995f7132f564fb9c3013ca19e12e7cd877080016771ce148b29b96ba568cfb9a934378a19137e139319e47f727351ad75d2d99020a2c45c6e79572c2b70caa187774e3bf57b9a54a8b06b4078f6164073af888358072850727771a1970582b93e9ab80cc9c89c77affca69fda5972a08f0797bd9603dde82c43ae9a24717e96c2a5d486ebe3582ded9de4dc2381c9b08035dfbc0765650f0cf5a9926c668c30452f6d22d7917dca180e67484910b437d977e83ef659af89dd64b6fa22d795aa859c3a806b6872e149840e83aff9739402edc6dc855a339e75a9b3475ad62e59d53f2154fec82029447d927b7117f108d1806fe78d4ac7a1e7b618dbabf01c6e922b339719fddf900eaed38ec2cee715f7ec1668b7b8c3ce6e49b0d45d911540d44840ab161a4d15eae3c76e386a5940aeb51877a293e0597804d12ca2324602d0d2ea55044a6d2cea31ac9dae3879cbd361859f95b1e178689664fa7585c27326460e922761771158bb158c596f70ba39b96d98ae1dc7be017847a242f0ec7a36f5ca0e09312674d687a12e14ddd4b68fc14a0440e0b4a432cc64abac4bc04689e734ab52393bfbf6bdea53a708b2746585efed1cf0f7b9601aea887a6cd624a5b4aaf34ecb82a81d48a0f3f24ff29cbd88657cac15994071bdcbcfe96ac1283856a6fe0122372da59526d5c1b4383eac455e35277e52c5292a397563605e4d02f4a28b071e9e48573f70f269ab1999aedc10d74bf217acbe725d50525f114da031b6dc7e4418686ffeb407a4011a5be8183c71b4acdbd0ac7d6928234fe3b03c841500791d62570e33f03cb62e00ffc78888d99dd2550098f6cb9c3db675974d0d629df2e5d190b55f85baa2d37d5c0919271d45d2bfc0911d3907aee583f46d318528a26321ff362ed707fabd8d432376b463ae04cac9acdce7738e0c6566b82c1a8a4941748690682fd84e84fe85996d0d2f13b2ee388d1e48be7a13667f4a067e85af993d844f192c4a946e69fa39c82c7acb9c64f2b3977a54976b42a296acbdcccdebfa1c67a48fdcf15b127c12f32ffd2ae06589f6f19de9a7da47e04b28fa0fd6e479d00390dd5dba22bc3dc2c50b7fe0d728d6751964a399812f071367a076763baa55584cc3dc5c079c178b300ebce9157315512d06538a9d17f74d909c61a7b6d5d3d9be6e6750ac9a337f4f431b911a5b2eeb1dd9da3ed03671170027b08df61e04e0389748960414225b2dfc3bd6498cbe1746800d2b174256a1a9badb827b844f5354eab5f954ac5f09e93fa4b07ff4ae0b636a2592e6ca1253f115aa9e3f066da48e744463799e4deae5cde14ca4255008a65b3c81fc8c2e09cb8de7218e5d07ab1c3567d9dbf42d9f04b8d079886c9041fee9b882f89bde65c719dddc0c075277601c5259452d8e9744559b4c7c14a94e9906d2e27d7273e9898196ed1833d5f3be4d23bad0b826a998652ae0cdf1656474ae052f3bfc6a623dc3d0ed1ab8f84f57376da306b805bf4bc3c1afc4d9d1ada20e52282ac9bb4be155d3ba70ca64b35bb95f7de1c8f9248d75c1dcffceb57a820268844235fbf54dddbdc12af9dbfbea92cdee3e3d2bf811cc39fe80d6dbbba0a6e3ff6f8ae148764b12a96ef9a3d1d37bc90fba2f6fc705c6e43e33a1fccbf15efb6cf40514dfe920f5e08a1036f211a2e28039205cfb8322fda203743c51b764ce30de4940f310f38c07707aaf91a2960e50d79b5e272b6bd9cdffe77a0ca2e357034909b87ab19e9a15c354f80788e23b554a276c5c8a2b4acfd10af3b7211147a95d8b0027d0b3a71417e033a9a76c9baa3cc8355510a1d4bea3f397a9279c046b3a04dae36cd59d98590ad39a756f6eb72e340e13917b48c5463fd3869faa55f474ece739793f187b6ec8d0b78dca3a510b34c7443f3a32cbdc60609c179a8092e21b0cf1ade02ddc4d09dee689d9eba4bb6b494e597415e20f0f70e2749e918c759376fec0a12b1b6f4117b880747410d910347d00bc11ad5fe89f89bba881349e97c34cdb40f85b467f26faca47971e8ad0948ed9257d7fe49290067201958a017fde02b8d13ba9ba08c07c2ab4944938a435e337ae5e5d68673fcde054483cbb6275dd63bfded4312e3919020e84f2797e2429cfee9f95c0ab314663ebfd35bb2e404046064acc46550c2e0b1add9f0db1524acf95e09c758e3738a7ecff9e4778dd69d3bc8735d5f7ea81bc9cd9ab258c2e98b6593dc07f3e2709ba126d8a2537ea6329f3bb8db6edcc15527fe108d6a3098ab18374dfc14f123a38ee797fe8b5eb25b1b737fe416d7ef9f730d5ada15b04f85547fc7a6f8bf807e4f8242c716e89a5ae3e11b231d9ac5def04286e8bdf6bb256464a25ce8991fe86c2ba9220c1090a46814208dc7b5d81481b0ac540e0e02e1e8ee09b3c6218bccde08716846aadcdd30f7a2b92e45adf27d85e9dda83ece90cf6a201dee70117a0d9cca389ec083eb014046b1e43e533b80d5d4a7aa1bdb441021cd7abb56f5c4ff12fda994dff63f75c34995a8a5292ee79b613c1b7beeeca6f7f033dd57154a920a929fa005e310ab2b008749f564b05d178b420f6d15c71918a2aaab14c5de203fe3b5462ee12e431fb927771c8f7d8cb33395651b79c4f4063f88b94d71ca5db23eb0851d22f98169da3b0a2f00407d325ff5eba30c4e14d9ca8de083d68b1d5af7d8a49c4d32639f93e7fc87ec474627fb1c21d89c70f719fdc9b033c84c3f8603c558b783608cb52affa4030b57232a3f162de9b304d7cc3e437a25b36441a7181d4399c86f5f27657104f04286ed2ec21d4aabc556bb4b30572d42d3bedb4775ebbafa7d876123a4fe4cca140d8217109751c7f8c00062ce782adaac52f4cc1855c8cbec1619971f2a614e0bb817fe5a4ed29144fd5ace68ad756e42f7875df33f5d0e7a18df38b983529629665dd2b6185e538f0fb253b3347df6e0ab17160fa198295a204a456c11e835764612354d066a02cd5eafab39f44a3792cd2f4b7c90638043756c4bc4f257ac9357db5cadc0e650ca2219a61d2bb524f58e6ec153b2c24a9fb135d144e98a93990736c461f5ad720505650b446a0d03ad3dbc62f6133088486510280e047ea226a7d0c3121c72cc26e5066c640b54380a7242724adee22b27b9be7f10af88e9b80ddd2297efc3b066b713bacceeeb863f5eef211577e6db69d1d29573bf787c685bf2cc6f5e1be5209083f80adf42447f359addba7486df7a020000000000000000dabf03040000000006e2d587c76399a6b321627bf5ef6b61049f28dc6960c2f9d5c4f9531b050f260d465c5010ce38e151ab488fc7da99d8109126124d7c4e75fc74d90c13de5eb843f6a264eba1efe6f19d716fbc5dd18dd11ad4d0f3f8ace649a4c1300ef36523000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004c276e1e54f29d5009f4f5ef016938939040eb4e67cd6167b129022fa39862a6fef007cc7a808fd165e366e702c401ec6f5e1782fcdd570c500e62fb491dc5e9354322781c1a9527cd251c2c8472c842e9a0cce9a76625b14217bf40635b33ce0452fe2ddb162af3417202e7bd1a5eae388f96fc2c01a87e03dbb8658da16b34cfcff7ed677cb8bbebeae1f41c2543a89d42491a7d298ff7e27057b328ab2e87d155622e4b94d93b40ac3c1a55da390d00df77fbf454f2f4e8feb489f7f7ef35f7d80541274b67366e32ed3277c999afadfb98907130c10c7de7b5eeda3d61524fc9e921dd429c442b8ffd14ff9a1710b58bd6ca095252f2fcceb83ee72050542e5bd1d5b024f40ba8b2267dac93216f81e197d8a4332f20c3414bca55b2c016f614d41ecd3dba17cff4f5433ee9e6025be6d38ccc720c8a20250cfc1dd434db64b898bc3626a640d7fbed6756ba83636e7b18f9548189013022517f5f946f8c99b05a7aa7fab6af2220bc4a4f9d009d235798a9f3b7759e98959d4efdbffd391f63760725fa8638114c9ac679b3c75ade6de6cda607973c6c1f7ba127bf62526a4bc249ca1fe4eb13440e544cdaaaeb52a025dbcbd1cab67ba88510e607fb939e4688137d59728f0d82c85cde54c0b335613a1caba891e7fb977f04a10e67b69db0c825099de5c3c3c7b8796fc6e8db49757609cc2cf72ab17a212a27212cea701843cdabd055e15d3aad72147fb3841e12fc3774b10f41e52b03f3534a967c6eef8271ca6e47702740f0dac59daa0bd6cebe73aa88b99820c46abb62420852d8e2de6409474fb89f5af68df4982881862fe22db0ef97c89ae5b62f00ab349a8a6e344d8de67360518cc08f7ba3c58b330d5afebe7cd4d9007bd56583b747d4882de7492206558fde3f23d05e06df0b777e6c413b7e4952884b088b5e3c4f0f839fa9efbc6e7d04604f6b2d6c54e6891b45ddd91a82d115fd97019a763614bcfa1c58a045aa3fff8408fd492621f8f3dd7f14fd4eb49b08ead1d6107e139580008ecd27530f1f04dcfa195c49fe131ee30139e78c641ee1f27cbd57afa8e928cd0b7a0f720bdfdbcace6043bb707aa83f6d36d3e0afafa0779236d32ae29ee147031345ee687109dec0e8ee0d96cd3eba20be7c86f5ae4109c9c36ebd5495bc110a2e258d4b59ce5cff89f0c2d0387ddbbf0a8babc216b53383ba412a77c5fd3a060c9451213764e5ca75739652ea492dc2103804631460621476a2212514c4204f1f2318a6f08daf622b0da40527ff3a2b7de667e6f9e9e3bb71b99ef32820ad4d7fff7adf24682d2e578fbcd7f3bbb54cecfef8d52bf7dc97febe250c98b53b2c9b651c523e6a1928b38ec026afd7d692dcb96509526da35fdc67594b264aa80d85e3b059ae34b7373e3f18cfee7c527709fa47a7817681b8d07a06a0c37841e077eb03642b77acac938f8022012d0c9d0d57bc2641903650a3a9a8dcd70a64eb19dbdf0cac0148511d8cad1fda5a4a12080a4de6b56d18cacf940068dac4b9dd8fb612489511c0d9fc1d8973f5de8e6b42b0c96f7d01eadc303bd7e29d2de3c377e24fa115daca79382d96d2caade77a0b2e567d42713bfd50f2b7ae0ae64b92dcbbf45a0697325174bebaef2aa9fa2dcd3f63f2ff3d658038e2e7325747a4bfcc99aab269de5b0bd4e6fa220f9e221937518c166103ccc72016ff5b6b46390d29bbda55cce67abcab6a997325fc2710ef4bf49ba78c6e434494c16bb2d6fb0cc5fbe6575b5e0abdb6b9bac5a58e9621dfffbf4f54b9e556cf846be856730d7f58c01a6a78d122ecfcbf8447c2b02d738fb47dc1019c81b17674dc9037a569c4e3f73ff6d6aed44bd32f19ce0e21878df4f9704f454e6d028ee8a2ecf07c2d27da5b35b8113e47ddca005df6947aa1d433cde8ea3ca755dd3ef7cbe0aa9513f4f747b7a43330634722d9683493acb08c806cbb409ff803ba38ea76cea1b0c27adf7a234f5cdeac1766bcf41eed26555307868e3474ab9c58a27bb5cd522a24a64fedb508ce241d171d88172ac9b99923149aec4f0bedc05b7f841bf9963d3d3b5ad5214f64cd0465bd7113ab3d3085bd7d6f90c59e95bfb12a899ae374fd105bdde35d1a2937e9cce6e3c62d0fff5f5a168787010000000000000000000000003b3356790892f7213cba7ce6ce6629454bd407c453843a791f6e0928f07b0e5873e4d2740210b268a338c324279c0db8160b16f89f323a3203f494352bf46aabbc6f41cbc03fd0f968873c2262036af1b9eddce234ca317ae16913e5959620f300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ea85770bd5734b263b6c9e37dff76204d22590d12079f6bbf384de770291ab706a374313d241b0119308a159ebf9b8feb82cdb90a6a2dc12160db1b712aef956c9ea37ceb822cd9d594a3e4ceb39fa4f77d082ad167aa57ea20bda141058eb94c174b9d908cb4efd769366c82988a16eb8bb70caeda19b003930205e430fe3e44db2e21afb0818af43e457bc4be25407c3257d5f1a6d8b183054e3e233b0781fbbb2abdc5b899abe01456791badb0ddf2009663ba568c0bcf75aede1f451ab20575581a818cc645973ef80c75c2f3e441e086d4f2d1198d600908a5fd09146be3e6dd5bb08a1f254fbcf9428022d58ab1e8352815d25d6c87841d1ea60ec976ae44b644c11ee7b3c798a2d3d1f08c731cb817e09720937cc62f781cd5266397da2c13a146cff3d40e9f5792dc6717247cd789620a42476343bf3e04107d9e4a8da2602ab8ae77794e5a44aca0264aba783fc22b49d4e3e67fa00352cfb8209688a41378e25e4833b4ee49df742f6a8b0de310da7632d3490765d20236d505f154b9a081c508e9983f4e906f0e25f9404856eff8d9d25ebb86d81c6a8a80f0d1951dedeff1ba0cb5c221402097771ee35fcafafeca494b0e928ad3a97bc88c1db747f8f2413bcdbdc035102a65a7a0a6e279917ff6ab0ba3cf92a66575b1babc2f6b6123ef80ee1ade9eb5cd7f7837fdf7ca29512abec50de9cc331f7356fc83fb77add2c3ceb45753f9ac94d15e6da04a6e67b09d3621b35ac8245d12dc8c6571bcfb542ec08cef591ca338b1af4e305ec6ac2af5e788febc2df209fff4eabee2b0c5622c39f9ab50289f335a7e7cd58f5b4880aa699217cc7dbb0a0c713f4e07911f18d757d243b5897eb3db0cd76143fd7387f76de1b03a8575aca95ad60f808558dbdbb0cf03d0d9c81fa9862c2d18c2c937e9f921d1c1b5a1e677135698818a7168cfd3d0be7202e605fc66d982e4c8df5617b5a84a4f544997cbf8dd61131de8db0e6988d1e0a7e9bb37cf92c1991c556a2abb9627ca5cf3f9c05a6fa1a594c9ce082af86c9ba9d1305946df248ecd3931baa732e6c2cd92277d55e841d7c81b68711f12006bcd8c87cfc063d94288d58ee000cbf163d81bc109fe0687a9f770c85cb4e37bfdef3cea90658eba9cf8d1457f4555f4e355fd9cccd431856bb066ca803fdeaf8a542fe9b4e6b548fb2e730c0f79b5f2c4603d3b97faaea12b14209958103c488139d0b0a72fc6e668126358345190a0cc178b0474bba3d752a1e61671b28679d4e44bdfd217128277c15c9ccd82ad7db5450589dffd72d6812d5d9b7c27e2e03ef9f29f47a810080f496aa3c4aa01912d350e0a86099d6e4f7a828364d30c3db00ee13e95498ba33ffb81e3b18a2ead8cb09558c32ff0adf8be509b01d21bff873dd110107b55e7487f3dd527b8a9116d9c32801c1879b5e6d2df77be7282e9523db28c6de520a1856e2439d25d6dd00178825bc79927d6bc82b3d8d53a42a0729facf91d704fc3d1f94e5dd6c8c625a5948d7a66436e82e4456289b1bd995f687e1ed5c1159ebd6e6b54cce6763bbabd59935a2bf61c7bb29ef967fce307fdd949096cae0b3b6d8a36a480553ce811e2245d5bbe81dcef1e72f2ca7a8560c3bc9eb070269367c631ede7b9edaaf3814577ca8d1d28792031fc1e4c801ce2081b86b495e20a3be1c76a810d58b6a0d4df159c2a340385bd1c16054eaa9029a3c15fe778179c2be92ebf683926d2732ca839eab332f73048215f8082238c9f1875f24153fbc85bd499188f3c5b756185521a1994354d39864995b960e97bb7afee46a99c6e658037b1fb61825731310e4effe0d1b59ecd2c32a2a68ee2aa4689d1ac7fac9e50079d49294bc3421df1fff16bde35d27ecb173488e63e45b432be87d980db29b18a1be11728117bcbfff726d4f868f5cbf2015d97426eea277623a797633fed7282a515cdf02b8ba849b7cc0f1ef5b40e5bfe82ecd01f5045620c1223f92633e66590e71338c895ba791b1aa873ea84f6abb1116253a62d6d8d0637192d364b901fa6d077ba2b2cba95c2e37023e20f8539e2f6924368781b72b08748cd7046f6951f0c89c64351e41130c266d0e34dabd8c57539df3a986b7baef61dddc1e929210e69b9aff25763a0074f5f072bbd8db4b1a40b6aa589e1f4613d61baec59fe797f5b3fc8cb483b47d6ecc732233ab2b8bc6fad25bc6a2a21e40f036662e872b9328e0b2577dc3efa05b0bcf571ada4a1ae9af624a507659a38523ff6e72944c1751e90000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "51636a6a", 2, -1034503543, 1953719636, "0e5e7d316f54ede7bcc371615944cec52eb6c17c6f10fbbfcd9612b15d9844ab"],
+	["213ab90302eeac2b7dfc5985a439ada6fa1aebba7749ac78a3f6a3c8a0f411edf550ee99a8010000000752536363535251ffffffffebde976dd457624f9f0c054297ad4aeaea501ada122d792dac15d4491b3e80aa030000000153ee4e4c51024be9d0030000000009535252535252516365ec966c020000000001ac7cb9a6c200", "65", 1, 592644132, 733220448, "1d3ae9c7d327f4ea5b8e1caa8efac71ac3540bdc6be4b594a42ccdfa6005c58c"],
+	["7d6dc346026d2ba079bbbdccc3d9e83ac3ab6b8798ea63b0a0bfa2736d8b013327e02d3a8f0100000001acffffffff40a467fb50237f3cd72855f477aa959f944096a6df0ad7f99bbdf571ee8e30a500000000015165918e66023606de0300000000000049860200000000075351656a510052133d8edb00", "5353", 0, 1642707568, 1991772603, "85512808f49eadda6fd0a6292b71ee9b493b4dd6c03323dac5dfcc1498c73461"],
+	["af40fc610102800c1dc5307f24e41af4608d0fa32ccf0a74c2d0626f52d2abe663cee86ad702000000085351535152ac00acffffffff0322690a020000000002ac510fb60303000000000300636afed68d050000000006656a655163ac0000000000", "52516aac5265", 0, -2077838563, 1953719636, "980b68f03b13086074b11dcdfa982cbd31c053ba3b8ac0977aaa428978091d18"],
+	["030000807082c40301e4eb656d205fb433fdb81195f47b4afc9c91016b6ed36382dac58118e4cd973f030000000453516a6adf11c6ed0372d2cc000000000001656aec270100000000085100525100516300bc247e0300000000076365635353ac53000000000000000000", "536aac00655352", 0, 1493710078, 1991772603, "e72113f484b9935c05f8cc94239739e9ea7d82a02982c6de802586eb8bd8214b"],
+	["0400008085202f8901a5d540b477f09f9ba297b17b94a2956b3d49fc1b6e494f2ec85542918da8ab210300000003655253ffffffff0479ee3b0500000000096a53ac650000005252eb46410100000000036352002f9c16020000000006635300636aac84555700000000000553650053ac000000000000000022014001000000000335f5432553f4ba81f60ae972e062bc691d8cf345b6d27b94de646772a99f402a3c38faa1c1cf4296fdf7bce43ce33f8d5cff0ed243e92db857cb7f230241f660191548945691b281b78755b53c22dd4b44dd51007f504766b80f9122d6b3b3a1d7ecdfd70c5a065977c95548f549d8c31437ad354cab9a26fef0d1bd081184e442a9af3d04b51eb1f1cf496dc71cced43974b915d527644c9c7281eac97707223d8f06ca660e827b5a1c0d84ec4c859d0ede6b4c47a3e19f9dbb6c07cec75d400e4fab2054a9ed0940deaa4fa88e2790730dfb68eda5dcd2723fd6f4c2fee1aa51351d81d418107e1c02ffcc5ab7dbbc7d78832ca0b39e885e1202143af9d4390dc45840f07e7fe6f6f37016ba657a02e0b41c308781464da884e9352b13b59745dcbbb5063abab730e1e3c94ee053ba4e7434af3e4ea596395794f0f1ff81224a507659a38523ff6e72944c1751e900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000befcaceaab47be2d69fe4499e327957afa9322ce5e1c011b79dacb949ac4e40368d9f70578ee186ccc21a2b4eabf3e95b6725a69d1bb883bb6e70adcc512f95a1ee6a1dc57b92cafcf8ac2653921ddd329ce1f6e5cab8540d1b01eac124da82fd6bc694ed75a85fe467eeba0a87d85c0790eb85ed062cd6930c5663641c1fab1e6cbc283e69210fa74db4cbd2bd83bb917db077db39711046af9b31df62f32b48024977e20d762c48b8b7a1d2548a4d0ac3c83f3bac1e613d37172ddd6e667d833ae5036a57571f36adfe55b89b84564db6cd722b9b457d544b2f0b0c4c99d2bb05a84d131f04fc66426d21e991afd92461cd658b8770deb5bd2cb270b69e184c966a8fc84e32690f7db3f1f3c9687d90245835d4139b127fd1c910d72c0fda99fcc59895a05b2f2348ab5e5ff0c02428ae4b80cd6963a416194865fcb72f1eb4a507659a38523ff6e72944c1751e900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000204a210bbec81aabe695b83cfdf239cc70b67c66845347ce1d8f7741249241310ece043c85216829c418321bea2a0e48fff78cd05ce130bb9f46d52389c5b32594d5da5ab6a1bdaf055cf41d1e282f770e5f6e82eeb2b2c674327bbeef70b6f5f75bdb42c68985a681202fd13bad9fb3a3b98c12e38694fcdedc64835a44fee1eec7d63e7820ba4eced71d6ff47bf7fc4f0c9f5c8de16cf662cd5499edacfaee2e69d6dc999d25f8ef61fd8ca17fff54b724fff54119ef572f5451dd2cbc2344f953461148ac8e2ddbcdd8ec00f42f52b8124db2f0302233b2089111b3bb5c7d57d895f15c8c5daeee864dfcbb7e53e77a9e960b23e0cf5f3d63286247a5a1dab73d94fb3b877626ad5ab4ee5d66c94966ceb8a6c08d19b07296970668b8ec5d8d522df344bc1d68955bdb83671a6604a0fa8a4a97196f1778dbda4d224788714a507659a38523ff6e72944c1751e900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000021efffcec7a2838891f4009308dc6db9f686fa6dc54c886ed62b14c67e34a1c807fec484804e44c894ac22bdb8a054a70bc8cb63bda47e598dad7463a33d9c26fd1a3368dba812066cf6cf25816c0838997e57197407ba9c4ffb833ab48164a0c16b814c2039a58d389f244ead24e61311f2db62fdd29e4d432879cd7464f42d3b3289f98b88423d0e56d439f25cfb543a22a2a62389aea0a68e7eb66e95b87915ca011416dae78d2acb0006c289df0cf41a7fa1f854e305cfc89d994d959bb720bb289428b9afc23a67d2c71ef6b635ec64bbbe9501b9d5bc69cf91cbddf3ed537ba757714dd10f1c72221cb235b3322b0c0a5e5d39b2006f3e58bac6e47186443afbbbd6ff162a7506564ae0989b37c40386dd7304e7186a6270b6cc8f733a9a8ca9af13046e9e25140c753fdb959166fcbce998afb69161ab47e34a17f91e4c272c704abd5b1ce3be6e8beb3532f376336f83660fe543054f56be1b958a9e22f75b7e87f5048b7906bc4bb2acaa97b8e05f6f9f167f59765dc15151608b7836cf1c341a828154a5562620934aa59cb5307da5e6ba683e539e08bc72c26aab53e367f309cb2d9e975608022c9c14f9a0692e1f22eee3171b6e6633a56a159c47adc9fc34dbea724bcf6600ae08264f3fe512281ad0832ffaf5883212c252f9ec6c61678c2f6250e8a2e0916cd09be77c5148585dd838db4596a78002c336864a9906283dcdb2d6796e45410d406d923c8a2453bed4a7c8d057cbbed4ef0976cd541677ed410c14c171b4c91c4cbe9c5c87fa44ad4c7e7a7b6445d689778c49a52ccd24878647659f6f289dd16b84c524b948358457cdb00be9fe0a1fde51522837e246058e5cce592fd163196559ea88a95a268cff8ef58097f73f0c61bb30ac659dc35e9fa5f91c6db1e3ff46c788078dee07a68118e2aeedd5c456a497f6764f776f22ae830cea1694418ffcc35b078f87b4842406aeceffea855669ec72d05dd7ac9c0a8f78ac7d256b5f2daf5ebb344abd43ccb1d3277c36288a59adc49f2ce25222e8fd2ca229d70d787ed2ad15478b94ccd8f8b56d92f0d5bb82e784c130e9edb7e3513882a5a2314a9ab061574a2a195749ca6859565b6bffd4e329c2242b5f3d107a108becf19ebdae81e2f9999f76b5ac8e14e16d486a4325e3320fedeedb9ba2db7126787e8ba19402b0f2708dcd723c76d27bc2ebb06d7236b5e9ef465ff8e0092a95a7e5c19a0a8edc64c11b443a962391990bf6a7a00f61f4767e4fefc7e92844540431bd9415d2a5a5b18593a65639babb272ee92e428dca023ee05a1412bfa952b674ecedef6380e1a1b5df8d8483cc2dceabea3493addb193bef6e566cab20e4a311cc2959cadc56555af0cd47162f943f3e2f84592dbffca706c9ba134fee1eeb14ed17f349e8738fce849f5f6d9076e66662b97e1e87a498a16c4daea7deb3654d09e513bae90b7e0098fea6cba8ae9f6acbcf19c3bddbc838d0b9831044fda41207cc00a2de3ccbbf361bd73ebc92df37797a50b2e5a2327249f3e62dae5865c5c95894d8083fbc48bd41684234d5948ce95c9e69d3643e658ebbc5f94f9154b03185c273444718c0f5581decde563ef519a5320029859782dffbb470ff8ac2d09fc2f4e7d4eba8028a1a280a4b19db7a4d7765925ad529e1c7db40c3a580d720ec69bccc9c2cec4c550c760362a0aad24ca296e8f54bef25e417f0ff17c771472ef639c7990f3adfcc8178585907e18af82b89467af66eb3c61f2590b95b2a7e899e2115811c31f0fae58651e6f0f1de03cfcf5bbc3d945559d0b6d7ae7a7297743e64efdeffe0082c32819fb790457f982e6f0ded83a0aaffc21a69125fabffbd3ff55460e6beb24fbdd8029ee3db39d4c31f75ff086ac02c6f7731e5bbcab0f47c12e6dd43879dbfe1871b1140b1f7fc76c96eae2a9b5bfee14434971f900ba7a9ddf5f693804d96fdc06424fda6f949bd0126ff879c0349b8615780a97a95577210e6c7da3b47a4ae35e219e8c9c7f4b652d39542848767ddc1cecb2e40f123e9eafe251030406528fc443ac516953b6b0bcd54f9cd074f567db8709f84cc6cd957d85d5f92f79375fa76f1cd54c84044364d199a7f0a2694e19310f8232de786d6b4fbac7c4c8cc0cef9f6f0424b92f38e42d17dc82e161cccc6555e7b146da82eeed0368b51dc8deac9e37f895a3220ab160b91aa97319bf085770ab0e97b7b6d9503a614c658735bd3751e0ee5781847ee53dc0b7012b5f45452e76c8e749dfabb46717d375b7859f1ea9984b71b1137235278b1851cf42cb12dd3779dde081bb433101dbf9027bcd93c0ab7568729e68d36235b3e5f2bc2be902c6edcc313e062ccb997334fb593bb1bf5fff38a59885d39765b82a152bdaff13ce4f258106cb52fd8a557bed7c04bc51fcf023324ad9f13729838fd6a223398dd51ffe84658e5b186f94228f1ec337888c00e24e0eb9eaaeb4192859054a28092cf3c65093aaca8684760e3e2f3b9713511356df5465624d53fc59ac4e89391b7f91d1d6796a19095d1a6c5e1ce0a960bec312789e2840bf372d2d34a0d1a5a73073ccf7922e54360efbe271314e34e60e7a31d0f3e13e4f67dbe024a22e76edeb9da9916aff2368727fa6697461cb81718b8e39089555128403acb82c68537b010000000000000000492fcd0000000000ed1862dd7971262471770c172d0db9b4172703a958c0c286ff62fcd6d136bd7e79bae152bc2ad0c2e9c986750b14409101630836eeea937f37891c2b60bc7e851060e8e835b9e7ff73f01594242cc03c9274df1c8b51bc62d62bae9430a2a260000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004657a622bf9515639d13e6ab9e23598f744f202c4a61ba65d6d2cd9cb9694b60f6c8d446b325f98a30e92db8609db8134ce96a309f8682d0989bcc0e24a245cbabd67efd3848e18bc2e068748865ac3836485144bbdd93959a5348b62d88d589d90f5ebc28b7032c22195d2fbd4a44e3897a8725895e4bf804a3fb4122e0d37a1078d8e6fc518e1715dee6a5333763159b6dbfbf75f5a60e13161bd3b3bff1e330d614d6f05f7e80fd91575e9a5c86812ab50771675413b22590429a8832d391c869833d0b3af04f961260d4d0c4e74f6d81910bcef7657e7b9afb590c08ad956f03777f33d2665693224bdf96405fc4d8fa3562a3fa7047970e02e599a9f253fc5951ed3344ed06feec463cb4763bc5bc4c6e281ba4706ab168c64e43741346db88d3e21ebb7e1d72676257cf45a387546d9f1e6a0f3b0dd525ed257e37e4eb0bac81511a19cb8f92fc7d8cf6516aa112a9266736871249589b17d617907166f4a63d0bfe3ee608f35475a6a7777a101ae17fd7398cd54a8128599ba18acb6b77f96617d3edddcaca6f912266b7bd305075160a5c5664d764c426f9674b51937b91c33245c2d397d2fb8cc2fad719746bcd44e8f3b6b2c44651bb7d8339cd49adfb1f684a19911c1c7fbfa55489b6dd1d3caf1cdc3798151bc732625cfc7714612f9aa35594d39d360a8ffb3be31062e5e651db0a52067762ec558c6bc188554be4a4c4e46d928902850c525758195cdf0b57dea5e08a930a08b85399291bc5650c0879505957d34f4ea8caf181623dae0161243d9dcffbb69aa7d4b3292efabe652cef3ba730af03119be8d460cbd998d3e57331526e797c8600a199758bd9b5ff7ee479a2fb153b7ea4a9bb20fac02b9347671b3fa855f47636a62533d2dab768c68aa345d937c814398d8db5f58b162ce5249bf22d59b86cde5dfcd8f6708606e843d15076e29bd9abf82ef316db689b41fb3d79ff0bd6039b47cdd80a33c7e2575bb31ab29728898211095359a3dbc6098a50ce9550d7f479e7c0679cbc6cf1598bc3a38aef1d293ab74e8d539280b1d2d36e136d2836392e0225ab2a91424d8e91d89a069aac6d6146e2c6192d185e450d6c720c6b9ae04e96a5c342e2d418388443fa4d5845e49be141e2b3aed86dca17bd9bf7e92881aa1385404a94e0d4bd3e876b8e1cc31efedcbda24ae6338ea285035522c5cd4f0c6fba2d7deee545afaf533a5967a71fb365c4cc3e413a933e04d804f04a768b588c4eb7d6b681ba87fa8e3ecd34d134c8790e63d51a3b7253ef7d37f9493a480b75037f9d16e09581a6e949bb5dc5c41730312d6fa910d48bb6af74ace1708413060f9eed9495b9448d3002068471a76576e143eac847f931848f8300575d20dc9f911ebe3827cefe7e9bb84772345678b91e84c71cb00fa82a0a54a72671784c99eeabd6a19a55398822bd1b2f660eea93ad10d40742d1988f1e8d830c75f4777d34dddf392f6d9de3a7c2dd770aad0158cf8fb0ecff885bafb9c594ca3b8deed4f71c8d361d657d1cb792301228c3598c6e4e1d40bc3dc31899b4c2de0db7a20d2852c86c408a0a2dfbb1b152b03d4d0450dfab2f4c9e5ea4a872bd5de8272c4f5f8d8472e70692c4bc0f20cd523043446d6418b0fb37cda1763eb5a0d2c6a25059175c3ffc4f125b0f80cef8cd2718c3bb1d63d70b0cd799b0874e0a7815e8890f4b19b27657c20263fa56971b145534ad5b477061a05a2b2fce98385457bcc2b063fc110a1f34450787bdb615e97dfbfdf8ad679ad7311a49c99827178ff1ea941e26a6a4f1c215d2336561dba3b3e1a148730b857c1e830eb48df8c9259321cde3ba4a5056ccf670fd389ff0e4f1e7068965305289a929888e79dd95f0ba5ae72783c08636004dfb6d94973f712a4803e2c9feacfee3e9fae8ba8b66b49577036209f3eb47363503c81da74bb6db376f03877d9491617051c8e039b0e561a669270ba602289c62f918fde23772641b028d77455947165297a62b2250db7c8142e3302d37c2b1614e6a9c683e1b4c9404ce00d761e802fc5936644e9a3bd5ec9d508c2b352b6170bf6a66442651e17f14307c1d714509782941dbbe7bb9d3445114704bcd8ba048c74b2a66fa4b2ed7ecea603c1ff80975e0941e716e47519b097191414684faa17bc173a5178184564a37b4265eb45e37e6fb4831c2ba9610c3c7f59d5d763cc53d99d931280b5d9cb27dd6af106405c5f9f5d0e8bd66812ee279f09371e64a54bee03d63e4f17e430a4ccbc6ec0400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "", 0, -523793164, 4179206552, "89cdd24372e832fd64cad75b30e74ee07c7673e98c978b976a5a03f264a6aac5"],
+	["53bd865904482e7acb59723691cc3ff0b5a95b826dad657ea2b182ae3ec4a86cca3c44221a01000000026a632a50774f0427a62c6e43be85860a762b202fc7b185ba7b40577e86c88f014eb56584315f01000000056aacac6a65ffffffff01aa47f2a8b338d1908f36b3e9801017064c6c6fddad4b832848ca4f839274be0200000003ac6500be472f95e4edcfc4c6de87263bb91026031324a145888aa8c05ed31b7852e714ac4c7faa0300000005ac6365636affffffff042002d60400000000026aacbf1363000000000000ebde4e040000000003636a517760270200000000086a52ac655251536a0000000000", "", 0, 1196202689, 1953719636, "e0ae2392484c19ed610b8db22b28b308132ee59f1a03bd4a4614a6fc81029a2f"],
+	["030000807082c4030152e46683449cd8f230bddbda5e53440436c523f4ad4dbd68920125d63f85f6040100000007510052ac516a6acd21ff5201790357020000000008ac5363ac53526a5110bfcb054b102d0700", "6a65656aac51", 0, 1339718771, 4179206552, "9cafc21f722e587075571d5b76cc9b787ee557a5377d7014a27b42ff2f6c23e8"],
+	["a30bf82003b286fb66f0679f381a3f61091ee4ee7fb02c7485e7760978d72fd035474573e90200000009536500ac6551510065ffffffff5bd9b9c0cc961931084bbfe160d8621b318ebb59ecf11d8db605ee19cdf6ddb2030000000351526afffffffffe217b870f6bcd93bc7cbf37d863cfae646bdaef06e011a3a60f6a700e8ba0e80300000005006500ac00b363c66602e58c140400000000056a51006a00404aea02000000000351006392221cf500", "ac5100636500", 0, -2023057784, 0, "12714dc0dbade71fbc43e37ad93738ab1f827b2af01ff50f0dc9c3867d45d71d"],
+	["ab0e781003cc62924e7f5ca7aeb833d135ca9cbd489187dbe50d44fe3c68b6d75dc3d6a6d7030000000165ffffffff87688e83ffc807f1e51ba04e8783f2d5eabf0bcc44812dedaa53f1e13ef5485e0300000000b8098751fca2beea44abd7d989bfb67930a55e45817f1faf26246d52cde249b574c948ed0300000008636a00516a536363ffffffff018a40dc01000000000952ac636a6353ac526a0000000000", "53655163535151", 0, 1143582754, 0, "bff01c730e23e00677a5a8ac17bbda7194a56e89548efa34daba1346515cfa97"],
+	["483cc85d0117442729907e05e967cfec9f1ed07da71b347e01688c31ca3b4e1880eae896590300000003536a65ffffffff0135189d000000000000b22ae6b000", "5163525252536551", 0, -1332735893, 4179206552, "4f2dbd4f9803ff46c33888dd03ebe19580d8b099ed4c0943586f0e929d637c1b"],
+	["030000807082c40303a950a3420c0a0241028d2505c735584bdef8d9e53ac4a2d4881bdef9e93a2c340200000004ac516a65de7e0be699c9925dea270b40acf152dff4a0f6d6ce74ce6d43560d7d5d0ba3074533d26603000000056a63516363ffffffff542f844e130f67195abace661582708dfae1b489d0e8800161b02561ae8132710100000005526565635373b589de02e7f9f000000000000852650053525100638b32120500000000016a00000000bcf4691800", "516352ac", 1, 879292551, 4179206552, "4a92d1ea3770d966497e4e870e8300fb62b17e80ef013d2f3a678534d7b62fb8"],
+	["bcaa3927010f13a3bb6b90033643f93ca68c81a5e29f49006006c7c9aefafa43d112e285710100000000ffffffff049993440500000000065253656aac63d33f5a040000000003635152626c600300000000036500655b586e0200000000046351636ab8b60acd00", "", 0, 449042955, 1991772603, "077a2025f91863a2d11e126176f28054dc8e65bde99b56db47246a9b0edd5220"],
+	["030000807082c4030109427f3ab8dd56e776741de6cb33ef505e9924b142437ecef339923d4cccf4ab030000000500ac6300657f6da38201bd999c0300000000085151510051655252000000000000000000", "656a00", 0, -1144214699, 1991772603, "f6b8491fb104601d895706c4956d14eb1757d9211c10c64e58517e046716df21"],
+	["0400008085202f89045f2a82849b5178f79a975242694779c651479a9b11fe151c45d1f7506348697d020000000752525200526a53ffffffff8175b51efb541a6409f210b13793a64c1fe5682a3ee52b5925d11c1d56e3a44b000000000152ffffffff26a8bdc03f0d29b936c9b63a3a57d7a08785108d0d8734d2702972aa1fd50ecc000000000800536aac516a6a6affffffffc719f94c0bbb53055a1a1827e398343d212b8585102670ecf683b6f7a105378401000000076a6a6a0052536affffffff02750f6603000000000951acac5200516300520234330100000000055152636a51d9a865d8000000002c3e210000000000018d22b1e5970b865cd91113759837f6c1fb89c4720806939abfc4c39d1a160582f67c681c2256438fa68f4da8c064a85b1cdd7ce44629296dc52554a88e87b845481ce84c5b76a6575d2e91adf24ab4a84be059add1fc08629c79b9cdc39f67995bbd03161e46cbb6c0ba84ef93a02a3c61573c8b5424e9c55927b73725d1f145552affbe6f1f7e92582d10466c5b96481cbef7baa7da35fcd28598e384426cfc124f3674458c3a1f4f650877f7af9263eb0f42f66338344e6f276fa91556f86c2b26e66778c8b4b39a84ba2e628cb9040c2e1bde68079b2283d2f2981d2d94a9d3b39352d1d167c7db0d8d3844bad7132d91cf9af7d375242f38a000aeff3b0a574f3f1d167b9151fc169203627371d3dc87ff40c2e3b13295befbc10665698b6dac7bba59f109c127ac67b3e3ed7fda059454c219764e7b5590d5e468e45de64a54bee03d63e4f17e430a4ccbc6ec040000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000367b3b400ae9525fe669ca5a2aea2c4f8bcf34452ad900f80a149c99f9423695af95cb4119d60d513555ae80b81eccbea5ed33b66df199bd6637379bc337211654ea8c3a2a3bfb72604ce417d3c70b06423a09df04e53c49c41f7f70c174612716ace1164b925508292c936aa983b738f02ad77bc78a36d06bfeba23ac841adc82208fb681fe2b8f480e9672eba3d8c73c3b284924b543a6e7828633bb7e15c0139a44c3cfc9eb3f18c2223581ed10eb61b844af12cfe2a4cda6b3ca396251cd55e09275fcd293d727b21241b120c2dac792d392584b50077736eeb8c30f0a02a07e8315492f75dac26c44febaa56d9f6b728089ba994c3f48e2cc4243e693683452b2709df8c183e2e77f57db9a9556aef078d97937affc2e273810d86474fb142661e3a8f919de8cae73c9bc2fb24411b732db839415509b7cc83188ac9657af3a30e0ead9338dd733644dcdf45491b0a8c6a868be13c45caa0b37d68ee821db4982eadb7cf18785c41cfae6bfba2349d6b133c289fb73d5407773398932fb95e493ca7debfdb35a5132620e61ffcec9b970c54b27864e664ab4695ae0c3d54e42ed426de72b36e4172b5f6f80e04cfa2effa963c44b72b87bf93cb0674090d2cb3c972ff9cf0e747d5b9f6767b2b2aaad88e09e1565886831aa5b6821c4437dd375d6220866a53fd7c158cbefe905af91c63108784d95fb2b0ac549e2d2310d68486ffe44bcccb96b3210a66431ded65f46da5a80798501da0bca34b58f094ebbbbd220820b6904e811767c2f9233a13c03e181a1e13a3d89ba2c53ba51bfee3ea6ff5b6fc6cd757fa740c55d673d2e0a36f4bc14c0a43780728a3bc321280ada09190eac4168998cf1c0968d4a55e9c256c056c1089c790a172a073eedd7fbd91b930d011234cebc3dc8f8a6528d15dea198324bf6104e19c47938de628345efa7e55a226837c3c0fcd3ea85ac512e8b666f404699de45e3f9d911a4abfa7bad2fe5be3bafbfbde8d5aca055f2f3e130b5ab1e6c1b6f902db4e789e7a20ecf74b915540b87027f2897b04550e9cacf977e2bfc48dabee59bcb20def9c525556e4d0fc4d6a31939b84230a9b5cad578bff871828e85024438be74535dbefa95d413b9f888809103ecffe65422163465e26129246b5a17364294d266e854421aaf7a68dfa19d0f7f475868e170f7e194c354423d8bcb5627134251b552c1535af36150a02b50eadb5f4f55062ed46dd2fbcb9ad6768a2b5eb91167780a937a746e684f6904c5f5887a2322767f50deb36ba1c849a4426c8e4e4c21158b60885b62daa885154a173e3f13dc55fa9d52f43ab86c37e35bea636e39fd89e3fb5414027c998a5e9672e24e1c71ff9f0eac26a8b27c25ef483359e6105739b3eaf70d7dec104e40ae87354eb9bd9bfc568e03cd47d4c16285be451889b0c453c39a031c02fb610ef7edccbe1a0e7195f3e3410209b1bda4c815999083bd1395caf866def75402461131df5e5c1a412b2d5d9f9784c28f7f70e16a091f92ac182cb0859a8af9139688a5ad826552cd7a5608e167ad6092b79594d5381cc6f465ef02882128d62035a874272e7179ed2a9eefa1a836615db57adc6de7a052b8d84ca963a764575e0985a48fa800b9f9c24f909808c864fa7a5c1837edc77efef2d0ae0abb1cfe5c354fc0de72a373a2d83c86948512ac3c52069d03904eefc830fc0492a844dd05f685abd73dd31975ebf99509e7b0062d7d95be30df93ee5df82587d561ecbf5fa2e2faedccf102de47269be6629de5ebc15c5bfd5e97c5028198cb674071f6ca8c73637e2da7c051a7b475669cbffd36856b14f5a23a4e6d63252a195d6433e4052e87eceab6c274732c651cba0a9aadf4244997372210aa25865f3fece81d2283239df366b1c9166b64471082c8a20870bf2dc40816a7d44f8b6fcdb049b5448b18276f2cdb8dfd00b801a27614b7fc699b116744ff8d4170302fc507bf52b71208c1e60366a4f8d720effaa315b2ed6705f20bc6aa3a593862552233e1070e70cd6aaf3ccd429140c8bac0f7cf8b3a62eb8b551a4f9ee42da84daed4fbb6347d88ee77a3ca864a07d39e5151b372d1e29f76108d566a48ecff822090b017621c96e72448cb3c39d3fe452dfd51a17f6cbd244b60c16f225ce9d1504c884e492ed0623e991817e5888469c0a4996d2a3684c3e8c3b0bd5d6ecd391ba05e84e7fed4ef9c01c57c562b0bbc3cf523e8f4e6de489298766e17bd77174f3b21a2d27e224b65e516f6ec7acb8c6aa603797f059062f621c8ecdd2ca6ccd2e5edfdd61edea781c2ecc2ce1c5135d0778bc33aac71c5b621ab8c7ae762e63543c8abd259279d0eb001383b816d5a7ab02aa42f30879af72c295e1ef541e94903c862d6e3f02a895a3de8b95d349c60539685610da1c0dadc6314e06de43bbee75dc04e377e4bdeed10df48e04dc0934d488093f2bc6538ee242302f6771015f4e66d39556a185d6e146f201b80e5d2901e27fec08f61bfa29daa757aaee307a8e3b836a6fea5eecce26c024864ff629386300fdbd23e29768b554f9d7c2ff1e8675173cab7e9644513c5f32beb23f495511b517ffa2ca3d2409a0c2fd374f20166d1033a5a480695c1e492026b2f338348899480236aeaf12749468461ceb5b002a5dab29f16b8df734459608154358dc9ada45f757c50a49f91e6e70b4ae45207f568b570f0f2c2ed7179be56697c35dcf9663fe777ae2bb87130865e0a364208bb5042af6372e2cadae93434e144fa89d64d9ae4db0cc78c6e04565d3575186203fe18d194bcd8b60252f2f78ff3ed1308ee57c59604dce4131718ce5cead306fc2b655514846d230ff0cd31b19f896c9f8741f7d59f175cd16ee347837cc37beda57b29cec904eeb96714ddfd69b02fd8fd3f1db7e169173411b7810905ebd6bb18706eb1ae80613f532327af40c0f9cc1150859df341ce6df55761c66a2b368b83bc4cca42e37e4984c1c906a6d9a56935aac3b73c83d6190b5c3f11dd96b6caccb337c997232a7ab8fbe46bd0d6710598dd762e1b6e480f5405fe4fa6ef9b00258b702969b265c5edff8d376a98aa7e6354b800ebe4c0b226c4dcb425470c782f538f0d4130fb48e693704e4bf81d04b5fe75cf17d0a61c28d1caba0651c004c84abce83f9decff8b3a8c1f74088f621fe42e438a1835a1626ab330a6338ebe7bca70cb292b7e5f72c8f4f8493a7629bddb3179fdf5946f3d1b50a9325435a4ce2f179362e2ccd07180f0cd524853798622484da7ebbc6cd7ee3a3d248c7ca861d411fe06c719d305a11acb85bbb073f86521d6413ff690fd1e419b4ff67e2c10e810fe526a5eb6bccb50e3efcff0fa61fdba915691d8784741e765b4e55b61bca5e63816b8f7cd013589e399495fa6fbc354d2601aec4b6659217526c50281fd38c3b14e82d84f9c09a881940c5fd4b972f256f52ba2f6dba9a27ae039578b4e4e9546093334a7fb797f579402aa4bc9c5dd39688f433cf948097b0d009a3be05eb4b67d119fbe0721000d8893bf9a691913ae5af6db7a71760d5d377b93c1eec5630f1b0eae0c6f16b0f1f8840668b5bbe6c842899d7d4ecdca5f1ad2ea329fedb8898592eb87688ebdf36bd75f7a6ba264da2f910001fe346e499f90df1f466135ddb00fa72c1dbcad24e1617622504eaba9b6e88ee34bb2ce4d7dc65b8218e70d17b709f1379a7545698f9af2d5d434a7e37a67c57f005e0c9dd55de0ca48ed28bcca09c6a1a3902f4d2d504298efcf78c4b956dfad887f9b320449392045c2c98c5cb32b32a29d1ffb8f27ab4776d3d4a8f3bceae753663ac126d97753f4044161cb03ee16f4bf187329711d45f637dd473b0666e3451ba37b0fb861b703db30d8ad8b632b226d92930c5c72c70398661739b6a200c7f43ae1b87d7c9ff655c69ce41e4bbfa8ed4420c507d8b8b74bd4bb3d5d9f902fecf42e76511ae1f863db6679ebb2c5504b400825522d35814735d5dd9a633ae0100000000000000004e50bc0500000000ed0f09db3f9b158822d25accadb3f341d5a3087150cb43274ff0eeb06d75a23c96db5028ca8a395572624b30ba2757ecee62c2cbab91335243a4b9c45895ef962a62d956778f4d93593ef29ac634d3871d107b0704a7bbec9fd0213a65f7fd9c00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000230d2031068bae7dee3e2758e98041bada3aa522304e442c8cdca5d4cf47049d3e08842f43fc71571f0221fc8c8b79351afb2096447acea4a7ccb256fb367318337144571c06935d313b5af403e140fa3fe49d1db0b65eadacd096eb0095b323982a9d3367ab1b88e43991b92d97a5379c8586945f566047e2ecf514569832669e35a2a514b3f4008925f07ecbcca243e9712c145f7a7b977dde779e42d814e0e7afd8b823875eaf5d089c0ae50ccc13c58b070243f24bbc8b03ead22fa3180f985cf240dd3370c35ad3d3adb00151bb24b4f0615127a6c8b26ac327585e4e45a65e0885cd2220ea006da09396017540bc6f2969b6a3b185dc7fa4d16c8e35bd2040d4f50277645b60177440beb72241b475eba1b5ca1bdf7c1d0e4b92a5d4edceaa6b2e512058ae52a8e1396cab365889cf43b4a41720fa2d4fbe55f147816904e4344907f82afabf215d3829f445f65f06cb1f1f60f54294657c4ed881c276953474582a0304cffb2f040bb0f06e5ddc23161856d2ad98c58eb92d6e038d7493145e3256e0772d8c9f650f064c1d34381af699864f3fefcd73ef6c03f5378db255be24e7e25f69bd13a07d41b1aff540eaad9224945343ecb4a8b088bc90c1c24034008a043f04453e8e78a8b3c4521cd7a421ff8dcd32ba695ec88f2dd2c80edf5665f766965b8de46fee5741e5be89c02e52b18ef14172b7aff797b61170c905f19e431c466d4543a8062fe1195c80a73fb543c0e2912923b4d7b58b01d9f31386b011a3b169e91334c4be895c222af68c59b0d714849427e11ca007cd8e28e39752d9607c00f3793ddd47b7eae0b7c4de8c59411fce517e67d805d7e1f3b37d3e79ef6c04c6daa540a7d6e78b46c29e292ba64c1a15f303850ef66a35c09fa9491cfb91456fa6509dd5842ab9796c6ae50ad8c07630c7190091b169ec4f21739d92f96a1110c51fac6d20dc7d5b5b1ec30b67571519007d8aa023f565fba4167b34fca07917addc2022444b74d9071ec634994da69011e1f75bfb3f198df19868990605c5f1188639c23356409d9db681d9c3556b3fad31dc499ab950fc51fa3275db2db133a1c41697fb2a1a73251014466b3190d4848d2af348b08589b0685b13f1403800c5f0dd2eb141b59af98908bc75b631d4fd2103a363d6cc84c159322cf6fdfc029c1a9a4aff6a4eea3a575a291387beb43d4c62d6281b7d404dc2bc577e3c02227e60d63bae3ff3a944d74cbac0aadea07a8ea8c6dfef836ec1fd5bc8c328ca47aaf492bb1bd757ae1cef26ff66de9891bbf72a7eb822698e0c665f8b77b0aeb9e4857285277fb8f1b3c012ae6d248033b50e34e4e63fa70f0bbad923c336083b7ac12448fa788cb5ebc5e0f1fa81487be34e3ab95e6638076610ffe321443c8c14c788fe485d327dac94a173392d883af1a0ce4c129a28c7a9bfbe12ad95387fd6e0d88ad77f7fe70200be1b16a68c0570c87c469d2c35daaad0899d7d16162590d6449455aba94dba81415428ad25fa5d9b76c1aedf0fb85b1d59e39eb3ce69ade0acd1da69cd01544fe64cc8b9398721a06b8ebbc9395f01faebf34096d0a19223aa2eebf4d4d6dbac4fa878f2e784b7ca2026ce58d2a10e84f78cddc217b76260f0b7727f6f87788d57dc20780db2604578455e4f68497c0ce69d67a7d2e1060064f18c903a6815c82ee694041513ae4b29eeb91aee9457cb9063052f29fdb3d29c90c5e7a25aabf90767b87c10d61f80a59ac70ce2ad7cf7325cdbbfba4a9e4fa9e2650c68a2e1ee2b122daa2741c62a2db41e49862109cf9c712adf6e6769239beba3b5d63cf7b0c5e39a6b240aebffa12bfd76ca753fea741ce241e8eb9d1e23781910639858751520e728161edcf2c899d185b9deb599c1c1e243c2e715a7371d032207fa960cf2257a4be07fbec8be6122669b9720c4e54768c83403a943a7fbb65f88f54eb26af79e561716d1ef010e2b86a05849c81718b98154f21c5c7c32f06ca7f213464a1bb0d0d5123bea5c4dfdf0dc30049973306a655abd8b7bfff5aea5a2ed7a886bb41a1f072ab90445c75e976d3d8a35f9f29811ad707195996262efa9de10a1cb229bd9deb48cd296c6a6aafec4766fa37e9a6599a103525a48030acdff857d7bf776b195cc173475976bfbc06dfd6709f31f8ee7045a78746ceadb896cfeffab95fff71dea0c2cbfb72f40508848579860f98b21bbdd5075f4ea8bff27eab03a23d3b19658b82d6f2ec790f614a98d09928632a9ca1e383c1a2536dc089e0700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "52ac5151630053", 0, -1246689442, 3925833126, "bd4e963411cb4d50d4672f04488577150057b655ab4da8fe8d1d72627d2d2247"],
+	["0400008085202f89046a2f851866980111c4f58bf4cda561cc0d93b36f6c00e62b33bbda281d8e54c5010000000952ac6553526a525351ffffffff82e6aafcfda302115221b3f0bd1b6fa8d87ebd6268dbf0b80462307d48b0342b0000000000df9fdfe0daaf3f1cf45c3173d40aa9d28647824791eeb550e3b02ced55d7f9a61dc8d1f50200000000ffffffffff8c9020fe4b37cd48d6daf6b69affd5ec2c1a90bc775637b90ecc5c9709dba9030000000151d1580dd103b978550200000000025353d1ce14010000000008006a53006a65ac5293354d000000000009510053656a6a5351530000000070d6040b42cc79030000000001aad513d15197fcb9fb5f606fa2ff51fc795a7dd4659eea20c8201b172961ad5f0dd86562ec2ef26446a279b492a962e53f408642e4d29586eea9cd04e2d25163b978de05b660bc6f2f5a191eac632de7fde424584c12654ef13127c785a3133f9ba59cbde18cd6b662aff2899f5742ee342f95b1a764024010c03ea22dc95253c757f3bfd8680ca74a6b81294e9fe827bbe173730d62d6799d7cb329542a5b6fa215fd7ae5962999f3ad9fdcd653b9693829fc4f80045f33c15bbf98770b04ebce10e92b187f60ba58886a42764aef8f9556b479009bd607b74f1cceb46a492ec435232d23b2de388c412852d435bcb4708677dcb1a540f92e31560edf57953efc2f9cf62a760e36680d08eb0cd78a9b7de43c03c951ce7ccc3227e6bf5f77cdd82e36a8e324ad2f92f5e23edc3101642048e6e893b294f85543df30072caf8b09928632a9ca1e383c1a2536dc089e0700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001fa74390c03c77bdd9ba61648a52cd6b9bb75894e112675cf305f1ebed70e98ba0478f6031dfdd515c99f6c58782169631b7928170eabd0c60c8879295d203346b9fbc588b143f16879e05fac36d78470521cbca1a3ec931d7d130cf76eb4c16c05d290254f80b04caab90cc7a71f44100bb03aa96b3a744071bbcd8a51802d5262115acf7527ee15c748b7b7739224886f1d1da56125410c04e4cb3b5200ab9f1d256878b0c9e3f04a3332d5aa08cabf40d61ea1bd7b4bc4f6cc97a0dd801a87175425730c464b7e8e378cd3188abc7670324cc42e7f6c1554d86e3b29f057fbbadabe4d67797849a19817271e55813bfa9c3c7be62a794ffe7df2c84b44e1974159a732a5f37df6747eca3b2c2b1e6e343a621a1e0663034b055952d4c1300706adb464cd67e03f3d80dcd34b95e3b140dd3c70d4b5fc06f2846a47225bc0f85739a1dd3e2084754aa5d9b8f37794865482deceb28bf867b5dc780ffda19c2c5602185861aee87fa69086111034f7b1233a682f34ee664029deb8b5a3796941c95e8e6633de24544bef0def6a38863a4a97adf62464ca2133bf53279f9f5673ef56fac5f90c4be714d29f3f34c06f72438ad88100fd6a63507b195ca318ef92af3a401c0030b9fe2ad0beac718b66292658b3e7c573ad12442d469f8654da576f1220f70b336814ad92b8928fac605229d2fa2bae46ca0495ecd2259bc175d218ac9ee12f2bc572ad651a2125da787929c2b3a7ef9ad537917ada8110020a3ecdfb040e9c80b8b14d070f73950a65b4954a56c1c5e02c263fc6de76aefddb67b9ab7673d072a97521c229cdbfde558d3b3486828ba0d5305cb406258edc9ad21e904171954a81e89c3c262eb1da8b648a9837b737c87156e30254148c319381b83113088125e3d980e5b290685222059a2c498fb2cc6a0ba5b30ecde16ea9a1404a8ee9a63f28170a1af426ba64692ed8f0f7d74966e266f50c934a76386531e16c5a0b55362b8325f397578a253946440bec0e4b7b31152ebab69835a3bdafc90f0e38e21b36c14301a79dfcaba05f9fbec5289a9a8c584483c78fa3f1a61b6101a8e720392d97ffe9826575cd4cfa16a7b6905cb3d62d3ca78b9268487effc5dc841acda10873a1937026b2928043b7f07e5619c4c3ba2435929eb8b8a8c64d1956051af10f4c3fbdf1369c6e0fedda79a12ff14b637dd308dbe5f837c30ab8a0113083fc4543889fb2a464a1e6924200afa873e3806bb231e8dd4099c5e7c9f315f4fc96578a355c95841e44f558b5bc7593b989ae842cba3c3755e3e2a54de4eb2d26cfd4d01551db05602f1219b9ffadfc021a9889030000000000000000000000007ac47d18271c2993e3a7694523f03927ce8d80078056dac0a8b719bade95559e904b4ac6813a46fffeb19be6aaedb937c24232f8a097abc4977899fbde9258e5a5a95d8259958e64b1be9cc3750f2aaafaad45193924ff4d8917f6625bfe415e000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000005ac095373dba624555d28ca87b5ab17ea07a2ea2f0a97b64473eb26b60941d9488dc1b7b7dfbcc99c5b389a302177a87c221b7d86ee71c8f476ef31666afdd960b0b2fceff2ccbcf93f0edd157899fda573132a0124dc2cd65e8b67ae23cf49486968665bfe8bf7aeb10ae9f08bc3234b12088efb97ee4cf8881c132a4723b7a497e3b1d260c1a69ed3a66b06c14115bd1e0b5870ae46c0167746b3dad85e43a9b66bf48ba1d8b1a825fc94a4f0e60a0a5743342569c976ef4579105c9e198dfd778e737abab831fec31f32eeccb09ddb46883b0f4300258ac8fb8a7584a4e0954ca6ac67e9c58c36f8cd60943ba7911c2408c53fa8336bcc1cd94fba898a8678da36d75cc8d83c9ad2f09b54db92d232e7cbe759e9ca4807a481662b5ba2073a7a363bfbcb80bedea09217c48da2e87c3dc4d64c0cc712fb9d632c87f324aaaccb3bd36a4d0f92e54a501c376bf9ab645e030e4174134cd2c95a9b505f479ee436067e7385d752e4ede4c6c7fb9b2faf9b3937fd0fc1ec6daae6b6e70e82c66915d840467e48d36596a9ac63b859c355029dfd9e1df0013b1028989a28b4f8c6b988a2ac31c2c4cc53298089c29f1c1cc6e198c83ad688ed136fc8e87235713d5a45330cd98bd51f6598d64d265476211dc745910653d4ca9bad07c9e85624f74e53c3982c686bfde61df5e3afca43c723265ae5c55d14fefd0221bc3aa7c76c343d18801d46321886d96542cef3c867e9573633aca1899edaeaf7800331e8388725ff3981e0d5d884276b36fa548003d136fffee165090a93bc6cbf6eb9b207c5a3775eeb044592212cd681ca190d7d688ca8c227d17cb3750ca90162e1a847a2c37285a3f5714acf91eb5833e7d5ad686a6a3aa0dcfdcee232964a873869a72ce9bb216248a58d8bbd65409e006ac24386a3e432a894c53a4779ae0a404bf51ac0459e279bb8dd42ceb60434b866ebd699cdffc6ed44ec4df250e0f6223c15f59f2b8952a204aa2a8714055d452788c436fad40d37c2e14d8fdf1fe68efa2f493e22280baab74927720aa9cc2354a7ac3d420b7a0550f4e45d8a34a73fa0e863b404f76e44ff7bd385a811cc6e5e8bf39103c7d75aab94cc383608d0906c8de2339c8850ce1dcebfc5a41f9e416e4d53a43f51cc2231e090b6921264db69c425942185d9675a333584b05db9b3f130620ce3cf067e6dd1600e55034aadefde1a9e6d936853dfd926f8c9e81994eeedb981c1cbe80bf3033fff0a8d687689c633980616ddfd92912c76020368420d6f1e497d6d94c24759587d0c9519798dac6875d7e108cdc8101f7f494afbb72d72bcc05bb9b34d81e52876ac619d88755c0497bf7cf89644dde7c74ae9634297a2bfec234c4f5a8bf698dcd748cceb8ecc3185ae17b05e8f8992c8854c3491478be91bfdb4058722a812ed19ff688bc7a776200b9db7da299d401b2c8e3b41d020014592a16174d7161f84a2ec258821b609f48759bfd88ffd94ac116728093dc1968b7da0d4700cb6129b601a994c9405bf86f6b0de0518b6b5d1958fc99b007c8a3c426fe943640933928c155339bf5e7a83cc0883d6d354c24e40e356c5153c0aaaa3781035433af4a43172f1806a9f975d79695f4b25b107adb6c48e4cfbbecfc236b74164f73d4e21cafc9d3fe6fc78986697ea0c592f56b3cf095ba238b2ecdbcdb649736344540fa00638d8601546df9bccea800773bf41b130be110fa8e67cc9262df2c5696b3c9a724631d7753a53300aa57f237e1917ba08fd937a7a0510ab72f9127e3d54d6d501c4c6b2d3c7f2e47ee006198ca42235ed7758d3d545780eb4ff32ab0dcabcdb1232ee63663eb248eb37f20bca3d8d836218e536b31d00e25c2d3144da91a2db86b69bcaf83a67ef69ebddba5e8c5758c42ebae50521ec2e99f3b419adae92214ef8e62189938cb4fe747837d11c3c36ee3b6c6715fc699d5cd3999cb8b82ec8bda50612a943e6b8e83923ac27e70286c0a02939857520e36024c49dae2ab87a5af0814ecf82be45bb6b110a4f8bab4b7be29ffd88c2a0bf45e0a93b11bc2b8a8cf3aca54fdf3d91bfd78e370394f452905a67c7c6c1a1b8c6caff930cd1624ce63abdbd60883ae0283931d9765d7f91c176c722cf54a000000000000000001ee6e05000000000bf0561b488d245c78b6679672e9a698573163bb9271342bf6d3435b671d5d7b0610cc9f2ecf5c936178744cb53dbb5594fb5526a2896a93c2ee752599b9529d46d0d05ef3d88d4098c1877ee813fb39daa3bbe0334d5ad5b5eeea5bc482ece40000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000093a41bb8af5de6d421d2930bad0429652155ce6bed2768d3cf2421778483755e6ffddd79ae9cc6e72dee7e7219ca6bf2c05db1cd4a0860c2fd7c24ac82670125e30abf852fe942ecb58c076eb7b702f167642cd1ec1f6675fdb40eef6bfe371c3244bd052ea9669396d9a0197c016e1c28633ad5fee8edc01726a74a32f1eb909baeb67b13ddad2122906ebe79b320699b0c5d10b9d452f70c9878671a5ef451a9dd88bf1c29726f00415c74ac7f4802317ecba06f1e8cc637ce3872d855ef8dd481a792c98f3ed08c32a7fac82e5f1eb71176151f6c99207562233c62249721cd01ea08a4ee139bc76c29404a35d9fc0c98551ffa599a5a4f1ce21393ef6cff1959634b4be4b4098f6c1bed2730905799ed6c215a5c637a992eebd5cb79cfcb939060772ebaacd115d5276f6f005c5b43198ffa340a71a19682e5d6bdb2ca4d2736538881fec9c330567776cc569667c6a55ee82a8bd4da6beb9a2e2e3e8d779c2a78d1a860037c1d49c52dc9799667eeead3b7bd096b7a977bbba52efe046586217ed992742da1d741191301a3203bf21a9f13dc007b5b62c5a1532fbadc8edc313483e00aa3fa8d93c461d63efb286e526b389ba128c0310456f741c3d9a831b605ebdc68f3e72d6781b8d95b9a1e61ef1cfd275b7046d125a4ba5952d8807d82731f4060b5b316b2cd7291d8821ae560775b5f02466aad9222b6d4a3bf49927b4b168149fa1edb3530b27f7c94089c4e8d83376c313620278090d96f652fa8263a3ad10ae1623cd39f10c9d21efd77142a552f1157d04995e1525535a1243e2d3454e37fe4b36dd47e533ff8d7f02d77531a05667f9a2334481c1cb1f20d3f39f7454a9d1f91fdd546eb8004cf7ad46ab88cd240a2936777ba88dfe6da315709535faa2e6763898d2a98c0ff9b1986267da3d809a0a73476dea05caafb1e8f514ce073816ff3bb7ae0518c5a37a84d6c31f26a00eea8bbcbcd7cfe17d6aaffd2c5613280ab7541c13e6734975293e4af7d7129108b7691ee5b5bb9240c9582b83a80c1f2b2c937e722fef301c6bddefe2432230372c3a8dae094efaab1c368d9b8cc033006f23fa342427766de39ca7d70fb99965ed2c13eb38d256afc3ae873e16931a796291714ed4777db4ecc6a09d4053a8abcbd58612139e65f52c1cdd3198121afeabda5a3bbab901fef2d330b605016fea547aa6b715a42c536837d0c6501e74c575709a48869ad4e8dd41357ae125814b3b2d285aedabe47302d75770d40fc5107b04877629316d4b885d31a67156c568eeafcb9259e29f0b2971e484ba0c3ebb01715d2425208cc99958ef37b22fb5233d53ab5a42d787baf3dbb8cf9fee76759d8522a732b7bd46baff4936a7ebac6a781ea9e60774ed2f774bcea97492dfaf7135c83c236cea3f849873cf09db464024d881605d8cb619eda74021c17c04caab0f27ce79d1fc045c1025545e38228e316e9c2ae82f6bbea29d0719766d6c51a26339dcff33af65a735a2cf859192e1b46ae898f20f43d5ddd28fb594fb619225bc87873c5c79bc7b4237ebe5488b1ab8dc3b749657f28e86d1423b503f6ee5cb392231c4963a5a683a24d4b9186d8fd56e4f43cd5b266acf1bce0c71c76f3d63e44139cd55e26fbbd08f42840313177b8ff0e79feafbbae7b814145146460d7fde795d6b55333bd7a36d1db7eae538537b8a7b3567a537d882e55ca78d86895081c7d8841c94e23b55182d6303cb5f37b395e650c6fac25c4b72f9c2fd9210af8672bf659fe699aa4936e82830451dcddc04725a021f4170ddeff9802fad5e23144f552bedc28fdb39cd74c69893d04f1b61fe3b73f7cce3354d34667101c81cb2c50bdc0df2c41dcd109308834799da614e69b9eddeec221135c58bbc14f9ec96ae1fd8517b4ae2d034274e2e1d560ff60e83ac19869a467306bb7d159175b80ac1f74e2b72e78ab813882a930a41c27753c7ab894417092272de85e66f422cda384715af293173d33669741d9916cea69a2ade98d98367d252f433a0e5eeb24181bcb174c556f6be0918d4f0f823b8eb0d793c3d394170b95df1dd9db3f65ecdf66c8903f08b9a0df00e7310a0d08f3cc8f68d14a3e3e0ac497bcc04221b90657fd06f5dd7e1f097709b5e2dcebee7a703cd505976483b16b25e45b00a3def97dabd4b68d972dcd4b23f6a9f6b67ce9949405daa667606a3552e8277586a506d07f3647a74334f0b40e7c7cc58fb2fea17965e0a740d3b5cffaf6b3539927336f1147b80deb469ba30200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "516553acac", 2, 1411565295, 1953719636, "56bf0b1db323dc99301b828d5be45e8cb52899c280b67d24ec6130566a358baf"],
+	["0dc59a5802ccdc94a9cb393e92ac0c35de0bb3ada7a1d48bd9f60e835d29035da1dea1bc070000000005acacac6a529ff0c5464c4a3acc6e6d74ea93d3b85f8b8ab0787865bae95428d1e110060a6b1d17366f030000000265acffffffff03d0f06201000000000035ca8a02000000000453ac525319b67505000000000453536a630000000000", "6a6a00ac6a", 1, -2045023767, 4122551051, "bc90cba8728fe02aebd006095cf7b881b7490e935218584d63ab7a8a2e4f4475"],
+	["eb2f54170309f2fd6d100e9dd17401cd409370140398370aa40edffb756d4c34335d3134b502000000075300ac516aac65ed5f48f33122daef54722ede60488f65c2841949d2b8a16467799ab09ccd0aed73c483c900000000096353005100ac005152ffffffffd082acdf1deeb675abfe7bf36c4e340743e08d42727df36460f9bb47d007dbe801000000025200ffffffff038442f202000000000465636551056061030000000009acac65acac656a0051069913040000000009526a516a6565516500f79a7b0500", "53ac63", 0, -480222400, 1991772603, "01b6aaf507664e7b523a9df74860d61a920533348f4add629514b90ffc1e6c9a"],
+	["0400008085202f890108748b9eb9f804087e906a44517eb13f31e0884936036043d656f21691a6d31801000000070063006a535100c79c48c5042a8b670100000000026363463d0302000000000751656551006a65aa9399030000000003ac52510d60320000000000016300000000000000000c927b020000000004beda3fc6c44dac6c98a0f38ba1c648a0a66d3521cc4560cabddc596b7b79a99eaa4baa0d101de410c4aa3bc3827af5e540d8375520b561c15f6c1ffa6f3ca929b5a0d00d1e02f6d46650cf5cb66dd47b49d42af2b99997c252f973d086fe07ac9aba0c6bc49d50d5ec2d080b9d4f3c674c78344376434f0d871d95bf0347fab6d645aa77608feef2b6d478e48a3d65e6de1371a186b6cbe4d87de6142628599b2484728af191e860aa19e4b2be6b5bfe7cf58f7d734885e567702720f4e6cbe81eda22ebe8bb8c800dd7d3aa60d4252bdaee3556d184b15233461a41f0a970d60dfd7d0b2013988ae53815f12ec0371e0abf20a1fee7a3d616b47dc7049b13bf975dbb0a12a9f451fe5a6768e026c8b1144d7ba4dc9a1d800841ad345329988656a1e01fcacf94e65b0933e7d04a549f1ad34b94f2f6f18b944a36a298f816fff6b3539927336f1147b80deb469ba302000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000cab7c041663bb04de4a6986b34ce9bf8b9e5a1f4dc90de1e6d0fb2f9544479d83f31942fb3e8f706de21009024d3e4921dd467df1592b2b4df219eaeda51c6072edefc5b6122b1ce7cac68a9183332311e5e86cd2acffcbbbb63ccc66b5d82736798e027130892e8368f9ac236b909e58ca8c7f77ec668b3546c231e4248d53316bd6ef2e6e2e0bbf24b34c48832c2a03dec323ee9d50a7027313b6f94b8f6fde6dfbdd1891db805a3ba7d171bb05707b5a1e898c508d7710de2ac574347e9ec11fdbee41c9af396bc92d5e57a14eac687df161b731f17f7e5726dfd9ff2d054146fe69983f39993a2d810a6f9f127a37d87b4b74ba2e481b403e11687d1953fdc64ede60b348208692e044e0e43bb9715376f288b3cf5dea2923b22c17f8751a6944d23829ed88c02e72d400ba569721d03b610ef5de681cb03489a72637ab9f6b3539927336f1147b80deb469ba302000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d5a874308c071e99d4732e7c63688afa8f52c94a31d69a8baaba6e1db313a25ab1bf1627c6bedf73bc9fced791684f4a62dc41d54ad24d7574e02b5a732305527d84410b7ead57fb7a7c317f4dfed528637853d8957ecc6546d2f747cdaf7c4184b0c604c312f62f3856e68d339b0c904b3712f23a31a051e61407fa88bb19c3f11d520fd980aa653cf86f39fafc18f54534fd59f4ed736aaf1256435faeddf50c140d7c91e309b154c34baf5eb1d31b0210c8432b0a6f9663d4880cbe7b6cd87d2e2b369ed384313e5835dbb187393eead5774f45747ac14fb91ab85cf218eab7673d26ee3ed89c5fb0d126a6542010412e1dbc9672833c6ac003c3c4c7e499685396471a96d19aa94a388cc20d732769eaf886129248a55494f0c627b7b4898ec09017b1da5e988e72399c75f1619f1cdd2db12417aa9dee2f09c66d6239edf6b3539927336f1147b80deb469ba3020000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002b2feae1ed4566df5ea65986396a7a6445863ed8ede88abe73b4dd8ee13008666175b1fd28fe5dfa9c89ee10cd63a19c0e8a8b973ec4ef0e0210ffeae2933e4fd348b0b4dd31c86768d001c70ae702587c5b636a98367d9f3bb94cd95420b2501b3244e6a8e7bac5958e33cbb8ace1b3baac4201d89b61fb8757b65d397d99d32073bcfb826278f51fc1873d16e52594ea9131ebe49a6f7e31ade6ce6abc59591613ca9c5d33530db0e4e77b4db598f5682e20f08731b08de87fd5d1e51aa75c1835572f84802a371ede990e5b76d6826e293e28ea7e79f4b8faa8a741434d54928619fa901309f563aeed2bc5d9e937b3842b4041ab7d990074340def732ddc06944f751cba3fa3fc9cd1d8cbc5169f4a1c22d30f3714bcbf35978b5869b565ffb9b1084566d2e160adccd3ded4a3d5fe558410cea955d09e7a4255bdc6e30bf6b3539927336f1147b80deb469ba3020000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000487e34b5d74890341937fc88ef677e223e49866eb0d6eb47b316d97942e78c4506867c526125371fcf311afb588949b23da66b4ade8d8469ff14169faf55ecd4cf2422c013b379906f81902def3927e94fd2b7911ef3e6e9a791c5204b1d4f95580302f5da18ef748a4b85d9f3b261aa67d7baaaa75d5ff3dbd39e504b6987a821b1dfe84612def7eb704744e5e55fcd96df76d2297da9515d94b77e933c2bcc9c9e130cc5ceb69e2ec66be62d4074a47d39becc76374d881f38d96a851552cac1bed0a4bce672cdb890e05c2d4f24100c0c420a281535b320338c2017a50431fb423e7d863cd90c40f838bc6408e0d7e80179b6cbc20fad4e14ae079d4784b155fce4b7013f4b140dcb3348f44e5795ed25511975527e2e3b833646d418315367557d2557b9b6809f1d6f5e39ac0e12096cb34619232e67864045971e29cb53c7c3d86f6e06ee05002b37547403ab92147a169b20f43aa2e43ccdc58f5c720bc5b38baa621716bccb39ea92ce968a5c5c8154caf09fbbb2b033bb8404f680587e92c794d82ee4f388e587e17c97749b1b6f5d8bc30904fea3ab90580f2428ec314d4a683ee45e55e019f97ae20d92d825b0d522d13291a04e19e0589f8d9c65a305b0c44d87585ba5859ae4d828b4da174ae96c30461aef132df66a2d9d1ded55937fa21774c38850086746f59e7f86f0b5e6ddc6cc030172bdcf23e84f3fedf7cf8220f32abd03ab7554bc1be4f6bdfdbd9503ea620bf425c8a8d31f1fd0c7710f31425ae519b2a4db7fb7311615485f12ad8d1b0fa57f83ca440fe86533032bafcb7c142ea423c275fe0adafea3a9c63395ee06dde8815700e211822d563e7ce610f29565f6ae555a3b3c1f02181307f507c36f7396b72205f79ea43fa1eaf744dd5a2384ff4c3b47da2da8e9634ca33963974eccdb732622149118a0fff4187c753c3be0030a601d85eecd10cc14d01d0f386c67141e1271ffb4425f1936089639a03f96495f6b90c841c968a5572a302e1faecab3a3e0e5a5c002a00115ca6fc20de426c63dab3726783852f346cc5e37b821602f6697e413419ff3bb82263d8d1de3747da4c54b36241e6d24407e0ad831f68bdd0e458ae0067cd999b00fad1bdf46d4e8365fdff42e6d92942007c57e61c09a5c99a3bc860c7763afa6d167b495b1e0e5ac337427eeb636137bf4b15aeb6e66631ee2d686a6c98f27e31a3c002738cd7b9b026c2af7a179759cee1add84ff1732e6c5f720234df55fa47a8fecbb76054cc09e4000fdd265bc5dd5dc10346f1b4ff552efbf157bd02f026cb934a66f813a679bd0f6be0cd9e632c655bbee7aa13f5e44cfa53b4d6ab712f668a6012fd7bb7675aeb9ad9f9b7a3149d2a31e2a6c85dbc9698fcbf10552992d7c3fa0d5c3c776dab13f8f4a92896602dfc3543be4b0aabbbc47b5aaccff9687a92d86d9c479133c3e5e845b46699b049f4f930274d6462021cddf3ca3bb80676535d95415330b878cc3ca760d63686f38f94a5649dd95fbfa8111d2f7587bf47e5024aa08a1bf54f09b8bf5785413e29f4633f6b397a907c0b6a99fe2ecc6872326280ce05f1e1edd176ba4bb2e1ecc802d863ac12389cbaee75802f98394fff2870e518681f69f91a09f554c45ded254b4dcb689455089a28b568507830a5622c0813279e11bc7571ad6dbf3af47cfaf7339ab1460e0e1e86338278189f598db41d0b947dd4fd1e1b52d09f62d3b569f3ad6d12746ee9d317936402ea147764988fb9aca9fd15df5c640f6c4d61eb948589cafa9c118ec1ed07b792c8fc2ae21e7b50c126cfcdea511be52dcfea35e738081963bd5de0b158776ff91fb686667d391e7a461b7f6364e447119a3ce1cd612dacbb844b342f3961072807821f12edb25ada6da2f03039f1e8de179ecf366a1ed12a7758210d4df7d6ab7e46a84eb49f2b07f24115f98c8f3edd07cf75c6e74a71b0794a6e50fd30ca8de0e386c682a7919932f2aacfa09d2be86866f4d5a6b35668efafb0833cc89da3e5fba8610f055a07edf679355bf920ce6f5e681774da488e1506e2f04a4172df6dd2fb04f5da1ea56abbf2f03de288177ea987fd6b72fb3b8fa45dca48f441debb73ebd489c5aac4e4b2d8a4da3c7c5f5965d38b6f49cba807f3f14e5728d52d55c8e7f376bad283b3d5d3579e928815fdc900517351c48f43cca7251e54f750d7307abf2fb6a7b1239345e1b81d3aeb1b51be43086310ce803e99a3eeab639c99c5a083fd9fa65060a0e07f830049341ad12b6c600689a7462f9c08fc32b1cacec2225c82e32b87035d2cc75f7177a2e141540eba8214957ab54013fabccbcb792fe19013ef965c16614d2053495630d442fc967a03a1d72ad154c458295297e698d6a1a76e16f2ec0b96aefe6aca00502ed8810b95f898fe7142949a6d97d0bd798e424809813e2e3547e38d02227de168eebfefb6ab71fa2ed612efc1db6beead989b47fb6536bac659c663a514f165dd5e80d6104321efee9704673ac93d02d7902b6805c889734ab5e3f6f4e6b2895038a82472670bffeef12e25a726776a33737ea675fcb11b7ebe01ee8517f5c7cbefde6f661920bb3be593f6e60d927359669a059d4340504d48b4c23beb8733617fe72859326b0e420edafe0ce6a612cbe31b91ba74bb727cc799663c636eb5b004f325074ea5ff54116ae6f36b619666b379a43b7c8350bdc86ee1b9df9af25179bd09b745aea4f1735d51e5f1b31dc709cab2b7ad01c33a621f72f8e9a57bca8c96461e077d7f75eca8bfb9c8a3c7ccd15c803e8373c40e355064978bd293d014eb24237da22ccfd2ccd280b605b6ef34e87b714c7c2b3557009278ea15209c6adfc08badf2ac4108a42f50cf6abbc22e0207199d9f6c28abada6e6445d26d16f71e7eaf3b03fc5a700541f69fddc5b787d58ac9564c08fd24be44594f3c693fe8f9d7172806c16fca656b0c6bc369238fb6049db511c04701ac3595f18aa5b3f478a317ecd8407cd7de064fba055043be99307eda1f5417f536e4c1489d55a47f9b684f7d7702a1361153e4426348dcd96b79bcd3bee7a58b048de0fff6afba780e11bfdf7a5284185e7310c05f8c8594b9cf20dddfc05f5f6e12ef94ae4934948fa0f18617341443a24693a3e85a07666f67f1cc12338262f97d1cc912165c30932349c012a162fe6c33124888e61c891ef68b6e7bdb21e84745809d9433fdf12e8139752169ebf2929fbb70a5fc807e7810a52d57abe7353ccd628f0564c0d8e9ac0bb1641656ebeb1d35752f812daf037ee72920de75d8810c2eeb90a578c26308e62c58014e7e838f8fc4afc4a0f3ed64677c99ffde2d516cacbd0abf7b23571c97b6a2bf48809169d49b5b1ccf41b5503e9c422017f8fbd8f0c041e188691981bec72ba91c9d0561af5101815038ff633bf3a912d107d47b1e9aac10cb919b9d306407ae54a3e42df67ef2718b03a590ccc36f2aa972264bdfc24ca0774eab12891d83cf8b7346c552c4f79c7e2296a71366cac869629fc8f8870c4a17d3ce1cc940c76ef30975c8fcfcc03dcdd155cab032be56085d0ac978b9c2fda7079bf0582d95a7a444ecaf33036af388d0fbc3c7661cf2d1e968d9f4ee5e03af51b6b18680e25d15c11fdbb21d1ed10e0240c1d42acb6a33472f22f10ad7f8bf8f8a1d2fbf3cc71ee71b5ba09c3fce0d6b50d832b277cc62407a846b0f7753b023c7382d46b2767e6ce3ffa97ef55148f35441f369ca43d7ab3542ef5161b205c8f73b73b450b0cd71ce6fb4c9282a269209cc307768cceb5d37c0144027274689b9276606ad854d86efdad4c5216b70f7b91b3551539b50bd5417692a5f0e1bddd6b01169ecdfb0432e4ec2f08c3c417a9d61d5352a9d4c4dcfa38b087fcf9537936f5fa952f9b001d275a51b75ce38361b750942aa7d37926205db9b4ecb0981396c157dc4cad9f45a63e91bf718767be08647bf2eebef92e5bec5d8f0aae090a37f644aaa19638a176bb97e021027991ff6d65ba58656fadc3e98fa3ffa9c45d539bb8c3e4db8409635f5c5cb313ad234b564a8ee410b7b1323c6d826743fdb4c58024175cf477d579ee380a9c06bb19113b5bf4b932f3ba1b5ccfb7c5b34bfa229382ddb9b17229df4f7137f63acf8a088b1a4f223aa35ca5ef701e309b33ae7bc6d2d2b9419706d5654a03f7d4e12c065a99f69e53db5e2c61e2da0e966970c940ee282b0e578787664eebdfb805aeddab4448bb99afdd3a79987542ac546976eee3161d37a7571723ea89109dcea317c404e0022640f4091a1fd497630c356315ca19569121399c6b74f7a74cbfdcc06f5cae467ce09575f3c9b802e0b4d1a11679abfad876139a0bc2f6a8d0a3ac26579eedb67b3b9d37afa14e93cb11a4a960d69854a7c04d615d14a461c279fb4aaa1f1fb0b346a034570468dbd999e900a3b3c42c57ad05ce0533eb1fac8d8d65a8333a5cd4b2fbee7b7e7ccc356b8f5bb5b1bc7bc69530f048357e5d176e2c67b1866b99ebb649cb202c7d1f97839718b92a724699fe65f2edb18236f55381d402873068c09ad5c0491c982a194e48c205e712c0eda67a528c66dd1b1c2202ed5004738710a84ab4dabcbeb34de0fdafab3f577aa7690731f9c36c9aa3454faed95c76d215f24cd8d99b6aa8529c840cb50f940553384fae48caa15c71d1802dc976ae318e140a9f7e5027df41846f45c06c40adfd0cbe45b74cc68d7a46cdb4d6473e334f2859c639ab8af442d8bbcf0590d89979a3441996dc3ce5b0b06466b50ee04e3f1d3b808b39b399c3dbcd18457d22b350404bf18348079e52608c26b7ad5eb1b3482756123addd98f8ea3938120811e3a59866b12bcb3e41c9d51af230f3a45d97d831c07d2ff3bfc2d232c9dc5de83485f70157a3ecd667c0605233218197ac494421808e397429940d0b6b3fa107f7b58e14979360d9a1312bbbbe97bd13f6bbf1930ec614d8733a26c533b582a2186383d3205de87cefebf8195fc02c59ff78f59f36b37dfec40be89e9ca5f0b8d407e41f4d4ef698c114bcd3fe5f4da3843cd7d71c1f87553c78d005af23d4d7df0e4f39b7dfb7c3356d1648630b0e1fdf7e933b6f46389b86a7b53ed5f39ba7caab798aaa8fdc29a45319ab04b5f6d6f2a4266fc9b247297292e1bc30b09f9aee00ea616dcc8c9075e1e93fbf9dbc8ab0061f991edf53deea2a27ef7c9b13525109805a9ab4796528db97e0fef6880a72f13388554563a49361293897541e80cfa32a6fefcc0438e3ceed9fcb0851d725d4f34a9d0b69d393c691c5733ba3965ab7f1991a43b8245b0b90eaf0058cae1c8e332af4fee85f91e2e0307c50004000000000000000000000000d18b9637fa740163e82a8a004aa8a3687e3f64428a4ab73710e6e44aac9d026150602f9b7fe28efd41b0979f5966648afddb4ab0cf85f990391f50b132cdadc33deb81fc4afe6710d5cd972c3255e488f6edfc24cc8ecfe83c4a8d1afc9e20ce00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000418e9146bc8acca723c8676a5241a88291af7e491b5805969140621c484c1cce8c788b3a70946be027c933ee67ed68155689e9cf120846e742b2b2deb77095e038d90507732b6cf32831e5e389b792555a0f870394ed5c773da7715473686d30eb70e2360315684f7894e890a8e1ee5e4eb380cc1d6ed4714eaf2145ae07e5377a2bd3dfed64125e6e91cf2566bc884c0a2ded7655b6b1d3299ae6ee1eebf27dc8b6ed37920cbe495d58b005b7f46ae1659528753c4d63739df4fbaf0d5d676fe14df5d18f8bd5bd5383355002b6b09bc988462a041c593428e7e813ff6d29260b82d5a7aeec3bf48ec77d289008a02399c7aff9cbb917a1a0652ea433796932d40cc104c701c61d3fe880237404f932d2d7c7c89367d8ab2ef18326e91f6fbf537292a97fa60e1049625dffacbde7df2167710e816c452e9e9aae4f0e4b39d23dc3aef83cc57545d793c2bf24dbace2cdf5eae52e2bf02fa55cbc8c8641bc7cdb9bd039786279865c296b0133b43a2df7400f1d4baf279965f0fba49f0fd3892f7642d28ea3ef7acaedcb28bd522c34690de966bd56f0fdd5aee336ec6451b5f825ea7f49dda834d2b4c4c948fbc927585db7d1884bf2fd2d65090059e38114b2a9e18d621ee6ef8c05ad98ac98aaeb7c09694bd1ceb169c5e917aa3a26f6680403392fbfe8b5d28edbaca19d6764bd73ed81e811ea40ef15e41e8d7e6a5dc56babbb0864f4d1a68c329a1ea7f831bc4e56a25a10fb416c0d9caa7963f1bb42db54b46bfb94aa6adaf9b2169c8a538e9fb4c5dcfa3c3ca74493e7ceefb3cb732cbd372e447bb631e78fe1759810daa3f5db9fcf00ada9157d6be3b127ac4ca21a8134e360ef29da9a2ab26faad83720fa7bc3e22254b12c122e9f5a0928e7c20ecf39f38cc5d4c50c1a511ef8830680b88483f411bf68a51475bf7074a8d82189d8a1c47b4afc82dadb6096951eb8b2e5a14308f980c688a0670f2bbb36f13b122d40b6d82ac4e3f7defc5b54005c88ab0ce0bd18af2d9e15dafebe90cbda87771b21706679197848301c56d1d14f943c7c6fee76e042bdb7177352c06f65b2686d3e3eeccad8dcce09dc2c60cd081903aadae0abf2950024b8c4ccd28129214e81dfbac4d5816473ea9e50f1d2351699dc5d1ff7651aac9a99e18400e1b69a27c68f3b06bba5a6fcd19285acfeaa2b9930decf17f5c0268df27c5cba4f2468472073d8f1f61012658d7115fb824ca494a0db9dc8b1dc9b6729eb6cf13031fe6ae6b1613b1f7a4084526e81431588219177f7abc28bdf1dd24bdb399dec16b338ad61f4c8438581826a162a6f011a4c081560c8205269877adb0860c81c25aaa9c9ce5538c60b5170f2ffb81c6970f42626130f3118d2bab1e0e6a650506f2097ea0da4c61e852ab7c38a538a7b2475f8e2607e2580fab66a7f48d7c41c8b00753cbca989d78e35868d67a2304478e1d08b362ec5e1ab5d86781f878ad6bcd8b4d6649d5388fd007c18de254524bd87d87eaf76a8cce4a660887880f6ec663b0da9a198772a1e3301902f5f0ea726118e6875c168e5f850c260e2e24f59cc4ab4206d6012be93783e7bf8f8b4094783c937dd9ff9246a5d47313d48120f443522e22c753203b028db2086dc0a80d26959a1b30867514727db62269d2143261e5d6bd1d25a4dc959eafea6ad63478894da67acf2bfb1ceaf86aec2bea06142b6907822910a4efc7cb82664370e2948c9df6efcebd092abb9f9507ba045a66bafd8de9653f82115268fb635c9aa8778f234679a61f13110647b3f151eb30d554f47fc77f044c7d5e0d9bf0941ff070b416730c60e07b92a0f7f1f48f263ec9112ecfd388546386e0b2855b67827ba1c7de21c0f8ffe969b5038c7ca16ae3fdc9e74746c0727a47899fd1f65c95cc2d0dda67b2e46f2a2f679dafdcca5366acd3c1ac9b320ae3fe524d9b6d6aa3d2b21cd3b00cd076e6d9a670ca3db534f0e37b96b7997841bf2f948483e845a89d626046a2d8d69ec432ee0951b8ffee9f23f9917439b9f81de4ffa67c27aa8c88bda174752c0d6fd67558c5baa804282dfbca67a86257bbb1d51bfc84218b89a30f5b9db72b8c4aebc0e14a4d8b6022173042da1a7930c874fad7d879100b834bd8fac9e7a0000000000000000da9da2030000000060699b67f887eb67270e8bb00bae5869ced5f66783a2ac98805bdc74b3a1fd8a3e0d8e7442dfce6f5021baa23b5f603c0f90c7149289a804424ff0b29b8f9436a8fd5aa3e1604f27e676d25fd5e09138c6b03b2066c75774e67d32abd40fbfcc000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000281c0fed0e858fbcc77a3b91a22436ea5e62437ce0a8ddd4dc05dba984c522bda24d1f1cb9f4faeb01444218784c43b373cbf5d3f520d078db66338882a5c982a436d08ab59ccfa79edddcf325b449e175cb09aef6fc5a4f19a2379c763aaaf3e9fe7fdf3d1f93aa7204c523a1c8de7e94e3226eba39d85f24b9110de7eedbe42efc39131f846b58876c4dab1b2065127667de950504191eb6284eefaef3be0dce849ba872d20dbe1d9d1d2eaeef4f903a81c82afcc4113a63d48cc224afc3b73d6b8925446eee87ba0d9f5ea136e609fa3186d4ef145a119876a25d00811f17581a3e1c93bedf4c35468055ee3fdabe3e56b8093947f57707d239d51dd5c00308cabf7771a956a21280e1a7d864b7ccd6eee6c5c66f71bf82929dc399f3b09ae0e3fa62ce0704edf14c113fb1a2d41ba2d6d14f366463b40fc8430b4adb93423afac9c9536b8b06a14a909d7ff9a3d420aafd8e540c94196d06c9358ad9c28c234696a457671c136b07d59c2355ada8183e509f155aa1e970224eba55d34a653e66d9737468384ed3cef71e1f615ca5564109d7b710862ddd5a464b8e929bb433575444f53780ec0495139400f22cc16fdc368721fe3982b856958382068a23536289f2890bec4770cc308ea6601f899f478d3abd3abf7c0220778432d38e3fdc7a0a64b1e33c2e0acf53e778f0e14f026760cccbbef96a21fb637a0c4e5455fe829a9e5128b2df80cc564ee3a24ec8ca63698fc364d85a0c2cf60341147d2bd34dc9769b87e750ae651c672d36f027e313cac4ad6541a664d1fd145787824352b55e2b368509c847f04a0e3dcababfbb306c9c01ce5dae44e81ab3c9f5df87bc9098cc2208168f3f2542a777b95c770fe814ce3c4ff8fe65247d2823e9415c0bcd54b7e123bada16f32d0074cc7f4f33504b5b8b3971db87cfab056d3ded887b3d30cca13ee22578f6c0ec64b29a8a6855450822a4dd59914b439b5ee6635f4e0070191d81eca139f7b73cbb955091452035c45af9a41d799cb776232370ed00daa32bdf356e54cdd8ab724b5f962539c52753357550a245c0f7f414313e8b31365e598c7323e11fc60422ecd904e69123a53e79d8f4234ee5448a23e576eb73604a6d5e621d72e1a6821f9097147b57f1ef7f22a6afe716403b6f354087043a41725e063f64a6cce68741a0582ac5340b5cc1d3d07c5451ca99b91f8869583ad3075d43f67a75691837f43f85437b9b42e3af4ca2f63e648107c5a12819c49ec9ff5edf04feefd2f526c07984ecf5c910efc7d66d5132f714dae7e79014739e40855e540aa9d0570b314a45a9a45a3e1c3a3199892c19163aefba99394053ecaed7d413b34df5767900c0e4b7a0ca50f0521457cff637c87b9c8702bc2829f7e436a0cd6bf6258bd6769ec639963ccd99301cf44c74be50ab3fb7097faed260fcf2ae3e78967da55f2ae44d1b2e304c29b74bd6a328d9fc6424e71abe1762e782c59cd53a9179ab60580216628e844256c9efaa5b2e10fce45b416c094e2f1d0225be5037654c49c1d908afad177373f25d0f88ef385416c127d2bb3fc4894242d9509dc2e40ce4f76641527e485f02cc1a18c68f934ffe02cb1c2ba3b7001fb4d6ca815865d0f4f5e9fda99a9dac0a5dce067b45a3c7a3693b304454a81ddba2a3997d8af1b7caa2c45b5d1c6f8ac2d096b856b56bb604c9a0b484581e1f8a7d0c286e4b7ee7d06d677054a50507fb8febb675072f631dd009a6797d900d6aa6cbc5a691aa54241f2e903a1936ee5871d5d405b54a681a38afaff067d6b3da3e688131e17753ba47e78b236ea0ffaf5756d26e8ed99281d83c8c869a0fc360bfd91830c237b76031e56756dc6798b07c968425927d2940352c51cb40ad2e158f70df4d3d259f26e38fc12ee3e7333f0898811e1e9828f5d6bd43e9f3c04103168e896917d0c69e681fd3534d9af73544e8ba9298c5ec769ddeabdf56b3f19c7f84f6f0c1c994eafafcd5476e981a74b1cfb1f0ce7ac4ac124312318900fe055aadde4842406565a43ad1aef3d9055dc0647538a449bc84c3e49329634ec0cf622a1508c354f5d37b73ca2c2a530efc3f36a349a63103195b9ad73686dda8529d7a9dd9f0b1e0cb3bae5b0327973c1e0619d55050000000000000000000000002b29b178a48bac7fa9af5017bfbedd2a16b0dff673c5ec06823628eaa151cb13d6db89949f4c1457f6d98e447ddd2a9f7650010e3489afed5cff67ed37c6faf930b418fe10b9fd0ac9ae5e145a95df824a2130426eb0139ed7ea7a89f5c6819100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ba1dba0a6eced60fd4796602ce0206b67dcf45ce3b514392185b168a0d612d3367c9550612abe69fee24a9a27188a834bd9542f6c88203734a7b170055f89303738ac8f788844e934ea5c38b8e85639e85f67f6968f5ea3f36d0b4c302489ef78f223b6079e220233c95df613644228ad831304aaccb0fe646c703a6638c1fb9db260995977f44fca9e5370eabf7e1e94cf44d56953735f4a82309cdab923c8edd8ec78c4be0723ade70802f3fcec02a4d4b310b972b7869e75a912cbf392b4aa9306b923acc7aea6596aff9b6f81faa1721d7e890dc0b3ca6f16bee32adc2bbc65317c884146cfd3abe46b234301db4e98c276fd48a76158f4983b648ee66e0957074b64d4774782651dd488e058a65bf642d5681767837e85bac8f86e0afc8f43186c6cdc662ead56cf40fe33bee649dea0f60792224937a442076430ad9c762a6d1d1703d0923ea705550600a1ef52cba9a8e18053725060f0efac4eadb839f8b9477b0abcf634303f779445380da2d39bc6e6ce79c56d78b016ae7630390ea7546183440fe6fbbb562462d4f363e25973cacee26842070057c06ba2dad70a6e046844c5de4733ed4ad3ae1e17faaa9364fb1e6f94a1787fd21433cd433605e0aa8fe8ee080cfa0d28fe02fa8082e0c58341d71b0183863e6b674a923dcafdc72569086c5992c3efa59ba7564c5d8aee1b7b4e05ce6e439d7dd9e93cf3b076c20172be65b3ec811d1acd280e9cb453981f525e69037c1acb9d9bca53a18d0a5f04468299ac99313d83089e26a97984ad26e3c2cd91617c5138ad7e54ba2be2437ad291169a617dc03b106a53cffb73ba1b46e93f64cb284e2de85abb49e2930d638af18084f5146077eb36e5a4ddc608d23e6e3db85478b8c2d5532293893173d09843821d7c837fe3ee76eb6efd068a04041bdd7f4d3d8ce660ee75725ec7a804d211efcee0508d6df5f0df871141507e92c6d3771eaca2d85cb01cf9e505fbe86af7603733fec6911edc14f7c348f7f84662242de3d54f78053b5783e28b030fdc28325eda8a94f4b5d7c1bdb4da14842e87c6b3bafa1cccf603340714fa99519a5ad505cc1a4fd3f388f15044cc2bfe72e5a2890266aab038260373be3af085eac3cc690204d96301bb2c2531acb65a8809dab969e5fc1187dca3d1a509add243a56cbc1f6357fff0685e38cff3a3abce62d17c32dc9b71095fede7f961c079b627a76d8bbab7e904ec3b370c024e481548cfd1191f5325af92e891336c4bff74c48eb5af93178570730b9374e26f4f0c775b8668617cf7fbe40f458614938453e0bbe5d2ded39e219c5a8ba6c2939369d9a7f11e8c91301096d236967c091b0c95bbf43c1946876f276498f4d9c2d764b053f4084190b9a1a41634adaa37d5171e0c7d7b03ecb338dfb13572b0d5d9f475a487ce195d8bc9e29bf811807a79ecb3b4c0f255b3814b76f48020549bd7906167107fa75868c481406127ad45bf9b382664107e28d25ef16e4718bf1d56ef546c60c1ef449dfdb925cc4aec5ddc4fd2cc1e071879023e6298b76fc715dbb792e88bb19cabf1458a7a972b4681236360c82c87ab301534fb7bd87b7b7368b92fe597cc4f5a5a74176aba7d30679d78b8083ae1973b936b341d5fcbed57e85a7c6cce71765718ba0550b9d81077f5e45dd88752eb42ef942028bab891a559698c2b38144946f607afe73569e2aea7f06dbef9fecd6fbae1d8c1fb28a1d3d4be6326455f408bcbaff4b7a91d651c65c3c9ea8af5df45686cdaac57b9ff0ba8f003f0e2c1da77659e7c1b336f2dcc1bd024ec0c28d8c3376cb6fff395d5517b4dbda6edf6ca88add2ca48b2c7d62eb6d0d74566a9e505502a21ec042a066f6d72ca7e9454b8d1ae050e307b7c271d1a85cce86577595a56b2e677d8f0ea59630eca5b96c9ad86177c6c4c72b6ba130b1acdbae7cc247fda92a9ae94787d820d44424e529db32f3ee399efdc9e3b3c1b8e9bfa2b10fc52924ca401614fb2d589761ca5425985d4c1dee54a6baea973ded5f8d257f143654fc22938fc7cb95162571c4cecf24e3947ed86ad6763ee06d789ae00899ae97a146c93a63a357cd3014c14f8bbe4ef9b96bf9c8b88e9a94db9da0bd0496265dfe7d37b50cafc011d1cb85be3d3d7b17cea0dc4bd40b41ea90f996d934f0f1b76ad89cb7147b11cc36c7087be452fa9dd4c50b5c472bd2b428b0e897740d81623625afd98a74969952b33873ac0014f04390ba56891dc8a6f5bdc304ab6228b58c5a21281419d66b0b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "6563ac6351636a5263", 0, 1844394143, 4179206552, "4c1dc50aa627e41e8ca74c5774b512a4747a05e28a27473f7a98a3af417766c1"],
+	["e772e612020b9dfd2359c4687dbb233d1992266a48bd68f233c15da9b3ff89668e3e8dcc4f000000000663526a515163ffffffff04ef2f1fc05fab507b1599a337a84e0c46665fb23162d7a604fc515821fccd8b03000000025363ffffffff04797c07000000000003000051a334a601000000000963ac636565655265533e90d20000000000009ea0be050000000004ac00536a9fb308cd00", "ac6a516a51", 0, 1595220328, 3925833126, "77a759058bb56e80d305770ee118d3d8a589763a5cd2d7f7c6130ba308f80afa"],
+	["bed23557017985a88faa7d9f9071c524890b792c69f2606734095e2ce5254db4c61dbbd8330200000009536a5152ac0000656a557ccda602849154040000000004ac005251ef86ff0000000000025353850d46b500", "acac63536a", 0, -228766770, 4179206552, "44ee33317ee89857058c52f513de503e720251c944b58a7c579f98188ef289c6"],
+	["0400008085202f89034d809e2dfb0550ed63bfc7a9b953be71edfd2a6aa5907bb2be9843a9367380dd000000000153f95ab8366d310eb1b74d59817a04f39e32c90e7144ace56455bea436528632e40d9d314f03000000090053536a51656a5151ffffffff0abf38fd55376ce830bb1c0174705e279ef941de0d858dd1fe69d85bf6840f8400000000046a526a53ffffffff04bb77ea000000000009630063630063006a515eb1c10400000000045353520024240a010000000004ac515151208edf0300000000020052000000000000000091df5702000000000194134213d6973a61cef85561b122afdd6a582661c7bf9b9632ddf442b965f6b8d7061c3fb45e588d2289a91fcc8afce9a81cce728c6299f39d955177c505b86d7f93f8c6f8c73387bfbcc79e9854efe6d63a8067f1541f90c643f232cb295ec3312b2a5d9392f3c1f18492469e6d864874184b141082e743383ea3f7f26895393ee1735d285b9232385e6268327d67c4dd6afe4d2be4a08eef15bff65bd39a0b6b498568b6c7c7cbdd48989a075a8bfd5792d3f881a66dbf5af7f1d7a7dcace6703496a1698e1f19aeaa8cfd95ddf25275ff8e0e9d2219a2d46bbb71257428e5aaab609d3f5764df62d71d125c5a817e3d4b27b277d888fb7a5ec8f025b542384d08e6191bbe4d5accb32f1997f06300654e60330a836f6079f3d93f8632b8b530042deeba30cd0af01eb24905c59e7a3e707674309a96d8fe5559f26e6dc2d7bdc304ab6228b58c5a21281419d66b0b000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000022fc5247d10ba8eeb128d9ae9e3c15b4e509986b15fcf0ecd6385d0bb7a4e8aaadc11dd19525903038e1db585fdd92f07fd2e4e3e55248e8124455c70c1e2ed72151055f5f8151038d3f4eef9ff03bfba9c20601de4028309509d0deb8ffc195ec2b38428e97ed428ca33a3fee3e240815e04b3db626b161b54b12d93525418f3f9746c484cf2d110b1c3a4f1e6050f910a68cf546f7f76adc4269d69dfb7b489c2c4388d6ca4014b5eee3540128f3c36b423f76664ac34d20a5e56ffa3d2b0eeb9c1c5628b26f25c1d2b39e5ce8eaa47c55893c797cb3a1063cc8dbf1e86f87669772e69f63af97f9117bf60d6f7fedb0bf15303325d4d4ba4c1c9bdfa5e6db06ab4a336b04b7e7982346a7bd7d0b1e35d5ac8a9e401f5af2adc88e83666bd06c5a28c26bd218a5dfabac0f12b60bce8233ab26c0d7061cc125c8541b8a99fa9ff60b2ff67f6232af9675657629b5f5d0f9334adc6caae33d545381998b490b37ed8127c07a3038e3596f801dfa6c94cab637758d8dce8be86f16d0fd15b08575ed501d5e5ca916d30d5130c78ef83a4b538871ba6741b9be2c65951be4bb4dfc0d7d4f4ca971e83168803e529edb15729ab86283d4040db3ed40d8aa18817b3d091f527771e18325f1f343af9c59dd2391c4c49b3125e241c26fcab56d8c73509fbe303a564a9f9d25ca38a5bb240c8767f8ae391775a6dda077cc7473fcfde3883f9becd0441a4d353ebef19e13089c984c91a5fd0faf2e79cd76c20f18f995069a39b8b42c65f92612795bc97b083744c710d5740d3de56dc3216d5240126f62f299265539a83ac0dc3bf2047db62f0309ea22704f2cb33426fa79d97e6a42e7b849c19d0ea435ff0f37a9e5d7ab8993d456442cf53c020692f3c4589c88cfc217b3373bb2d4326253975489e101625564691c7f1f7d707fc353d10e8f6ca96ced474074156231552255139f56e94bc1343208687a5b940a3b05b1ac4acd6fd5ec9be75814067ce2d54beb2fcc3ba0fd8d1a1e7ca59ed46467a61c03dbc47dcf222531439aaf7421fd93179cfc0466457d129b51a6d07303c6f2b6488c7ca9f346fb8e1c52f1f303c73eabbc6d59f0ad7ca864070b51b8db11476a6b8b36664e4b4eb0788f28d0bf5b2959f7d54a03c17ad89500771cc599d7203194d524bfdf0f892eb5e5b702f4792129e6b04ff69f2af15eb4d30c6539534edb0d8408f231b2b59da84d11384acaf251db71f10cd45d88e94cc0be191525f2d66be213e70cf31d99e760c1f8c81432fc3c5ae7f87df4dae77616cf89a919b5a8c722b49ec21025e256b83c6e9cff7dcfb5f913ac2645aec32902a6b669990960311bf87b0340f243b0489d7c1f9c52d4598d0c58bc17302783157b5a4e49ad7515fa4220258063eb60664710ed00dab23f0bce2f78372331aadde698e9ae2c931ee1f7329c9e85e6568c788e70b07d566a5b09feec6c605acae073008540aa97443501a765a70a0d501cade9b0452e04a549b5edebb3cd9048692d60749584fd1070e22ff97cd66709777b00a424ff08146618e3a652bd1ff7cd184d0279ddc474cdfec7d7bd628ab12e8524609dbac3c77a252ae2f57a31ff0b377d12e4d0f6b3d25d66385d399716be93f29e9ba18296adbb2562fdec470b53dd19cfcd7f7f1d71dc177100d14520bba28c922ae0be5c37a9c12d487edd2fc045c969e031e8aca953abe558826e9e2de39f6e181f406dda56111da451033ee3118e7b75e1c82988d2f26393b1f2c73d939c432985e0d690239ccb95a88b7c036b03a0ef1878ee4dc472a4cd47e40e0181a0886721405cdb831720463eadfbf87dc94753ef4f8ada847b1baacc62e3955c67739a616b50bce431b64cbe4b10c491170bedc637340c9635d15c036612a689949fa659637a0bc0ed46d7bdadfabebcef397eb356bba3ff04b4b11327dc628687c44888a7b8f94fc423625eb55bc622a22b5199e078fca4710974a5cffd025a8bd3350aa9fe7d411d66f6e279483dd9587e3aae88ac0c95b29f2e7b12e8c3a880d7ba91a5738a67963ab492bdaea603afa50d73a38ba920aca35eec9835d925c3eea69e20909763ac92d0595097d44c415736e580edb69f47b57052d746fa17c86dd84fee9c9139f12f8dd397416496ec2a357b45fa1ac026cbe6df65f9846774e40c64982d40da2216ec7b5ad9d59f67d88578c42a06048cc89451f5177e638c99fee12c51e1e4e039c76316832494dfc0ba04b0f181c0ea3f4e882ee5505034d62f299f57476008d8ed019ca8d9370db5c377dac4088a23c642b844a09871fc92ff8d1ff7302f010c45ee6be51880ff9eb5a3a046b4911553f8f9a6c9eb70d80dfe21a906385ff2d5ab242429c60e78adaf42c7a88e47348f0e58a8fd94348adae9115900d8622176bc42fcf1348e530c39c25016e6ec3dfdd687247fa02302944a178e390ceb700a7fe231f8dcb4afc4969aaa34174fd493b1baed355b33bf0fc3fae5c5d33ce9c8848119fe9b9f184fb716591e918e34d411264c7cf91f2e1761a16f3aee0abce52a73572da836e5504e0c8dbd79d98de3585a1ee3ea962150ae6d01b531d2dbf3b1700910f80621213334005c261e41a21943ca81fd5319c6910e62f0ae9bfbaa0abb8550c695f4a6964c558bea640a8ff8d4c7875d71e0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "63006a5300", 0, 1272519623, 4179206552, "f237954188ff30a77538add8203adaabe830d04916422b9596f93162cb02ebff"],
+	["0400008085202f8903d9d62889a4b57b1d77a3b0262f11150787044f4f21a1d23923e0b9d039eba9b50100000009656aac5365ac5253ac6ced299bf402b75f8a9ed834e465020881abff3734c61f9087007620ebbb12132fc3379603000000075151526a52536afffffffff440b534f744f049251562362f84063d20636a1e6fccc952eaeceed6bf7123d60000000004ac536365ae3c922b034e6b9605000000000452656500a6ca3c03000000000253ace0c9a0050000000007516aacac51ac00bfdd869c1efc9b11190a05050000000001a3927b2e04549de34f597745726181782c0593f5ed552f926633dea72203759c8ee2eba4bb65f4f542d130375d8e5613e5f7e00e405c16698a4e161578e07a3d77fc171e409924a91668d1e91ea4767cfd095c26c9dea4a6a756f5c5755829bdf1d24ccae57e87e3c680a992ab7500b837bff422e2ed5fe1df3fc657df6ff66e2a1fb42a619a7fe620c3c4ca921537b707de108f149820092dac955668741f50d27e50733cab4b20272c2b19a4a820876bda654ad92b79c96e5974ee4e892889d7b2c2b36257653929583eadda7477364fee1303e0105ff80e6aa20c1bb851427adbd9a9e2ebca91257875a7038d06b53e49bce925ef1560c00416342f52601d745f97bb5a8d899173050acb214c8721c397208931942d518339ebd41d3c5062e4e62dd65e2bf03803941a46924a1bce9fa39a2a6c679cab9aee905d7096ba646d2a83002e3ebb41ad9f29dd0459f30d00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003a71550254434fefe6dacd2bc3ff91a40040d59259939591f0831d01565a8961b77011e5b8dbc1565d752433531f631e05183093c7d933c1a27603643e055a4070c0aab62a971e43b0e5f4b3ddf618b904cc81151ba96d290ecfc0ba350d2b3169bb2cfb6c501f0563a5fe55e14cc7be04adf1c4bffcf73d240171ca73a6d3639e91b057180fd252a4c59cfc1d25f18e5cfcb916aec8c94b3d10185fa3e093df0f8642c74353b53b2bbfc77c69a5be618e93a566682285a228ef030a3777773aa8ded89258bbda697eff2f0f4031df522e8a79650b62f1ef1b1137dabdb3eb22dc0e74d5add46cbfbc1b10b6a7238767c2b9199a674247688ec5607f1801f1557d9858e565db42fa7b0df96b61cf1b6654a48c4b5e46e614827743e3852ec0de62c118b83586799aa95475b139526741f19426386ebf23d282bccfea20fd1cee425143d5afdb5059e778b5aaaaf8fc5e7e64cd027d06c19927175f9bc67b30f7df29f97939ced617dc01880987b6fe4fc69ee86bf1690dbb27038040dd987dece05c554fc2b9b8f717728dcf8938f1e2d111a1f5877847d4bed1cd7dfdee96869f1aeedebb22c6e56e0bcf2b446b27d8c1dde2bb209da58c612ae804bcc16743d0733910d73da572f56ef1c68ac4638c63a7900624187f1ff97a094ee4a188cf9438cb900116a14dd1734db7b332ee26cf9e4592bf3224b04480b10b805df8b79f3527889401b8487ca7059ebfc3dd9a238c809315bd1e369f0a57dfb16cd458e2fa6c7b9bd874ff1784da7801c38949402894d0bef7c3edb5e4d2aeae335c655e6c9c1503e13c56bc365d7820c49181a5f07e87a87f333173e6de78fac9bc2ae5fc6364fd56c4203fb9b9f042ca29c22289a57c6b1d7aa613b693d1b222d3c79a6c1b07b4674659b21f3af6c00238a99ab1ee7ce838628298585f8452016c29e75516c4e45bace80441da736876507ee6df77e1ed9a81387838f7d4b0615071742bcdef3881b4609a6832d9b309aa3b7932abc076cc260b4a7b6bcf166fcc247e41927597926f8d70e9e6cc6d1e142b3ccd8635e37c5133ea5d2552bd6c231197bceb0eaa41aa34437cd03ed23b35ac506b16cfb74c9ea4eed0107169b5971e42fb29feddf8254a91e2104b7ab4ec765b54ae01fcb66d31eeaa61c28ae8442c29e7e69a9638b004d627b77ead4122db5102f6361a954afa4f2e207d6dcb3364119f9fcf357da54fc8e0d8938da5d8cfcceba894d7246bcde0ac8cd78b44f4dc5872e0734670af502ef54263e2480da58002f1aed7b7e7d77db5addcb7693ae3a0a5a432a79d981a0748686831daac8033e3e3f437fe61454cf682e79b75dd77c9b68df69e18d56ad4b88d0df73763857576611e1bf64fe26b33d0714c8e29c84cf856fc76f2be61014bfc56f7e6047b3255fda728bd2be5323749e7ad926685e462f4750fa36134900624d9250cf4aad980f5fd3f6326b5fa28d6a20a3eb889f2cf5e43c091a0e5b1fdbffdbc632c2c2b3f0b7ad9b0e49d88d5f30c377fb6443b0f0a3517f12c6c30c663b4aa4956516c6cbd1b1bdc2480a6b835faa3b5b3666a1cb54f5dfee8bdc1f336495600d4038da4f5397d296b49fa701000df172f6ad8a988512a69d3f91cf5f4d2fbce5f96b13431bbc4013bf0e1e4269dbc2cb14f7b01da27c42e2d7f978bae46658c487639c23b476228b87ab767fd457b7fe6a6314faebab08443d4281c412d4357c353eb8d374649584bda97aa96d71206d4ed139994e4b07573ba1dce630bb452138cf8025781ca1f2074799bb09f71a5423bd3af3246a97adaf1835c51ce5685b3d76569878a8329a89a86184bb4e54b9aabe54983d6307c1835724a2c3dadba3978b78b24505381f8c167a185461c74e61037184c936a786fc09828cfab02001a321ccd06cb88f0d4ba0b135f032d72d46f0d9da672208008dbfa1017396071d2633cbd0d1db5c91a5159fe77dd58e11f72c5eeb0dd734428c02061acc40f0948b269b9a827ee298f23ec30fc42e5f460f1a13b3cfbf1ca03b4a560a8148828a8642d56909b463d1703b63afbf721254cd4ba6547e5e03bfb956902b9197ba8c3aa33ac439541c2cca3bcaabeb9db8c4034bcbea6c28b8cf3d8fbaecb6e1e89bc6643b036ceb1aa55190c8f80567272c2d903ffa3453d15ad39af60b45bc8a268fe978fc6da1226d8d053e90f9f07f4f74e954ef2d504aa7a3fa4be0d9ef99030aac81034f553d0fbf4f78d66135e1977442b36595fd6cba07a378dfa58d77bbc75789822077e3fad6a7b2f557bbce34beb236f7a323e763cccbd9d783cf20004371dfb96490d0317f460536bef691afd318ffdde2163eb0964c9f9b58bb544c89f7bd88d4280b7311358d486fdb4d5ec6a69275615b34bc23e6426f6ddf5856dae14a9d37e5f5c5b385c3db3521320a714a519b73e41932f8ebb90c10c361b4f45f782235b26e07f4d10fd627880b37ba1fda1f5b603dd2a487a439387d12ae8446df8354c24d1e9c1c388f5de466613c16893884cc1d33c2c790feb795ed81e63d7115ca564f365475786888204aaa08c7b93e4ba48ca011c6ceccd6da120aa12ccd4f9804bfa3a0476a7217edc8efdcd522c47d67014e855cf68621dc4aaead6041b6a97c3830d8491f02f2a3cf3d86073ebc5d0383fecdab6c26e5fdee3838e5c2346b508e453a3a6dac01fec3f4b744f8c0453d4ac41428c02a16cf73561dbc39679129f752ee0afe4a793b955aef48ee86966ade4dcc4fff7ad2e5f46ca0b81329239af103e6a1e7be66570dc8de1ffc6e32936e36db3720d0a6e8e8a9aa0d03dbbb419a687e606a012d73f1eb11c7e73869a79146c6939fc8c01ba9e71c0702c33d97044574d8e017680287e7872c03a907ec852d9cf8ec1761db5600e82efc0820718f3dddc62b56747233b1f42b890b0307ddf204342a3741dd2da11b9ad329f46b5c631794e12aa1d67edc0451f734685fed72ed91bf289a54aef77fcfecbe5cdafc113a52af865b3e4d4e84f65b0ed4397d4b6c6a129ef42dcd6364432808931fbca7adf827536e2cc7f521f6d0dafa2f4596e37c044e59aa71283ea1f4ec5ac1b0877c70444f6c13a7e643897d6eb61c11524c3ffc35344deb29bf11ad2b6b43272913146818e286e36d83ec10e0220576b3034d03ef83795d0535548601894ebe3f7984b400a9ecc5bd42498d6c169780c5b217c37f63938deb54989d28a05f41cd22d9df1a34e96c65e8ca933c4959625f6bcfb239e1673a20e4b30208856591ef6140c20b5f1cb65bbc5b3afc67c34429838508db05e0afb13aa8481bc0241eccda659ea51ee28cfe5846979f65d225b6b92f67c186e01740b9a73dd7d4658ab12f178c75ed869a6ecea09825dc34d09b80fb5ac1806ae6710347139774cddabbcd555c57b45e785c6faa0b2c1bea1d71d488700f7eb7562ca800fa27dd7fac40470388bee33e1471125f5098f5e8756d139fe1529c4be7288b645621a7da4a3b55b436fce0dd435e07cbaee572e4f079aa6afff7193e2e546ad2644b81e39eb296c220670abb3e543bdafe8182a8634e06b73cc658dca3f71c2970ef5014f971c01d85b0ed09bd8224c835d9b1f4ffcd3987159587c322ba2c991008a00ae3bc76aa6d4e202bed8e0be068201d651cefa2f4a830c37893081161ebd60facf413c8a7d1c9df7bb3a05bf2b975ccc59d9c3501b5f5164370a7f9423a0eaccb7ff2fd186cb470ffa547f856c945cf17a75307bd32c4690acf2eb1de8ec3f793daffbc7a90fceb19ae541dfa98f749b9655b0cbc7f015b72da3dc87ac6c3785beda0ac173877ccda88e6241bd9557312536744e55194ed228d6275713ad114cca3506e72d10e7bfa4b34284a1c1b362ed54be65e6ec6e640a6b32450336a33b6a527e0aa439e665ba311caf60d1975759c320338b92bd9a38152e3af173cf3b9dba53ccf17ef4f01fb0dbffee9a2c096e5cd7aaf6482c3aa8dbfe6dd5a0e15cb08d918f8e67d3a4c03876e7c020000000000000000000000007d261895c5e2eca1fd3ebb0ef4d766c67b5210b98e390ccf9688a211ef5010e5cb0b58288765bb2d7a14c3c4e3f2fc17f6bf8c70c2339f94bc08d2dd65511d86683ee322234d61f3fe5fdccd31e332254125a987972ac16c6bd85489af378dc30000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000030ef7b927285e916e671cd6e63a07cb514716e4233418e04c105e2ebe3521c0db16658d843f054aa666da1513d94059a0e2b8eadde40adf846664b459933a4fc78f40e52fcf31b8ad3872c3cfac7d1faff2ba9409ce3b6f0eec5547779403af737d0075337db8f8fec4ff5c21a9110a20e9df0518031bb98db947635181cf631f922d322e6e828b9a87a1c4dbc7d49f89204a208c822f600d2422ac8e17ea31fddae5254c1276802d91785e3a8786d2fd684cc6c447c495219c408f0096e1f606457e53fd37e0d54dcbd012f23b0e73a3b36508d2ab60690a1a220607acb6edac58b54f9b8030cc35305ecef66a9757c797ddc505e05300a04f432e6641f2dc3623961ba09684dbee09f6b71f155fdb611a157bf50215aab2e8b1158fed59b6953f5a881bb31113f9da9784abd3b13bcfbfbdbc294b481b83adfa2cc557215abb9a91ce85b85a9f00f7e26b1b38fb841b4c477dae9284aa9cd32f3a2ee3d4c084431909f50b8051c4e982ee6bd7eb5f4e6b663e483aa9da4b5329d19a219dc14308c6b14c6bbd003c14d7aab5e4570f474c4fe642eab5bc54cedc26992e96bed4ca8164f7b0704a2c162cad0d2fc1001e3a95c6e1981f0206a42d8bc199e70414127fba20d76f34a260179a4fc60a1489ffb4fcd02ab1472ca9792ef61314e9d087cfb9eeaddefa0cd47eb7ad3cf66236299de8351c38d784668f7cd8f991cd913857f68381f2af841d504202aea4d90c6626175ae41ff1e3c1ec6483d85ef16bbda521c7ac49a65acfd2434f103caa67fe3922c11d5b7e418a4158762e1868ccafb4addffae4256d6ad87c45ca07c000be975bc5d8e792cf8b21ae5c05aea8585291a969b81a6058793e599279eb17490d6044d29c1da43c21f2adefef420a9dc01779ba12f16476469b7c019b6073f8e13a78c7667930d5225a124422bb2032a87574263ecd1d9a665ff6537cc8828556b79ed725220b14e658aa051377190385d0b99f4f30c1eaf6cd282aa7b9fdb31c192f585d7b8f8274b52d8950792e695e11d458ba0a499a349fd12b9a14183573165bb6cdba9ae176e27f6e39936098268537bcd11817192779dcc4a42156cadd1104e9fccbac214f96e742d66a755687eeeb25cde1f84cd31f3ac3382a97b03b20b8ec8c2d1e340754401702752322b8656d49db9af9cdac7fc8bdc270c09d645684e1bd4e52158ffbb995bcfa044a4235c43c2c3b672c455f10aa9a73710568e8abfbcfc58c57886d5080f03121f3228cadb5e4731ea23c5b93770d768cd64921f8f896ae2b05124a0084d62485d0c2ad73cae20ecac9d66cfc160a437af552010b001efe95cce34ec5da4de2483c216bf85da003cb517f9cb6538eb7b832313a64ceaa438c715d77470630ee87f0cb72f48cd92efaff7a99a782217de8cb5b890351940674fdcd7ebc0cc6757588bb638b443b0bbaa45bd9b04d74c1116576c56669b1339b651f626d382532c381f8c6f4d41abcae9c94a8d5ebdcdcb642a3830354125d8e6ab7ab80bd9822aa1a459d09d277c56e7633ffe4134a48bf47ac4f01d041b501e8350a386d4f4261c9cdfbaae910bdd737e8884580e45f2206b06a1a7d5c197758b7690288b8dd520d11b703050b6b22a5c2313646ce84f14ed4eea9c039f2701d187c276779f7b57a425d833882c13cd43160d80da0138ad015eb10c3bbc64d038acc19e301132543562fa87824b429cc2eb5fb37fae29321a6f9d7aaa4780dfa7ede7b069d05623033c50f96c8917779d35aecdfe68bc6030c337a58cea91b1d23a5d2b7fcf160c59eb52735e51430dc7d3ce83176bf406756586624a2f63f3cfc271b22e1262bb38e3ac7ddbea5e3a3fc7195dccb8eb208c05bf9bba15ba81fd51f405aefae05d6c4e17ccfeb782f61b7eb1046c121e150375c8c3069ad00b3fa75878839dd9209fcc8e001ed30ac6ca40caa70ae2eade39708712cbe99cabd46d1d38b9ed9040e58b3ceadabd1fea328f9a0b55adab1b76a0863c57e422ed1a1e044794e504032032c3579199f2fae8ac6eee516679e229afcee1de24cf98d146a3e57483014c2b5eecd8069e230dc4b4badf652c9e4db679b90531b48a9af355aa3d67e4bf5b3d5cf65bde0c661b9f3600986602f6dbca9a63b9e604000000000000000000000000e3b037492be5d7ea7fd556d1aa406ced379b8af62cfcb0010e0dd910debe114f9e2cf916f3e3fcd6bf7026fb1426763a4b8b6d61ea099cfc6506ceba3dcdf245def5aa6d23234a87d6d1344320536a5717d0f08220b0c6a9e708371e42932a0f000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000008ea1b0aee99bb72a35a066b8ea20c15742f4358f9871da78ae6745c11d7bdabf3ee9a15af1e8c4b66e825f85893fd415a974bc70eed2f96460d865503438cdca34ef6d7d7117347ab01b558a80e2d55e59db1813b30495abbdc86d9ac9009c9a72c427ed99dac415ce78ee6b38410993edd040740a552c428feaec1b74ab82d0fafe4f06a20fae9811e492934abfa3ecee83315af24d44aeb084f9ef9232b7da5b526dc0f072119d98597d5eba7d8eeeea4446d4bfc71de8703c370c36ed67f6a05d03228b3e6c91cf65f2a732aa1cc34da3331062b1808fea2ef689985328aac0507df44ad34303cfb090fe7289423ba53713d2d731201e824420ad77dc0712ab1d6efc236e9842d5f60637639e5c04244e40529808db637bc23e971e9e15bf8ac2d547783583681516950091c67d4c845f290f3eb27a899084b6483754307bc96edabcecb2506c5a23aa8664fc9ea6ab727d61b60c60b0ed23cb09008abfa4c838eed034dda5d6d699b897456801784add36118859046f6f0194fd5d183f642c85c81d53e066a4a8844b729084e51e462e05c57f75fa58417064325c0c55f5a225a3c551b294659b3df87c263824f88c3f13943f8fde11085347f836973dad4424303509f454301dc23b070c2375dcaa7399e8486eae6d0d08bbd4e131e38891b9d7684911ff80863379847a6e9c3de74c025584fe4ebaca478131274090b067e609d543cf8bf78cf763c82379dd92090be00b9ef6be5fd691b15b7f0b58ffe4cb9056641824de1da9554eb6d47e6132b2180b3e10da0bd74294f70039606b0d7eb8346ca30f9b9291c7ff97747a05d73f91a62d7608e0a21958b537beecc2a001938dafd50dab2867a088f13e1d18577041395baacdc7f21b47dbf39536244869769daaf60a097797bbaac240b73e6c283c3b66f583a934801d904bd27f4c2708db917583db6e37940709b2153ce26b0588bd2ddda84368df873eca44041a12cc54c966492781aa151d84e75599fe5363d6492449e4a3f0afc6342083ade98ed6455b9013405f2556a2923b70a011f78b50519670fde2952770e556e9dceb7e6fc6a0c0ea7e6e945592b0ba6763e01e7a935de84bb423140acdd94e30a38f905bd200030f3e3a2457e0f029560b607606430a0e40a92ca1baab82eae725e77c58fa15dd0e53f4a1b90bd7f11107e7ab1e52de57a4f17ce7004ad950810bb32bda8992bf9ca4df30447face4d540f23251459bd5ae042e41be0546d8e11c0a906b9057b3401c9936f511e8d1d8a1263f77e18f7295493bc3343024e6e6f65a79b0a033d30fe6c05884ba316a2047b74e0bce80667bf8510c995c6500290fc088431939d9bbf6510190bfa7f8702c6baecea2b401aeeed7e0634d751570cdc305528793e05e6136816eff9127cf488b64b05f962071772135a255086713997d75f1a27d77706b60f913213351f30a6e91cdfb3d4f6a76883f02fdecdfbd7c3f196f7c77675257222cace318c33a899b451b999a4c451090cd072cb49fd93686211fa8ffa95d0c7c6d3a6560bb29f0294e771e7c1395ba053fdc0a2e9d02f8ac1c14d92eabf171fa4c8f5f580497a11438263ac9f160f97d75dbdf116bd862e1dd93e7311c24b4d4ae70fb3a1eaf2571e0073ff736dba6107cc60365b975dd6f49b786846c5bdace43fa674bc35996603a20cb6d7a040090bca6457b7e3c988269c45fac74fa4f1a7ab91623325ff456b6225e3c6f48c5d3417063604a7e480aef5fd1ebef58c13afaec92135db0791f2cc510cc71b2d2619cbaf4b737a780f64596380ff67e83b7c54e9007980e97d1d274ea04ac3651a4ed3b58ca27141a0f30bc6b3e66c23928f4de645e01c98fb332bb5da850b61b4d087fcf9fce40c64803043b686da7ccabee15d328777c093311d38a9eab8696bef4f02fd3fc1d579267106af00a7ea254497d6085bdbb4a4d3d53d66a312087768bc0895a9f9e18c7320e50cb113652fb3b4d7d1a7f33e4638d2742a50c915b9ed13c3ba4d00bac5dda8186bd59b5860ba39b5bed9e7a5697402f730eba1afc6ba8a8b1a193105ab4e0c6bd2fe565cc9f82ad8471d022ff21ffea5559acfde11c0a74334c55881ea6beb3f7262eb923673888b95d361d86b6f02400000000000000008025880200000000324a87d6008a4caea2b942df4802b57cecb77351f54f1f6df5e559cdfa6388de68e3728880634abbc4ed9d68e1314d955952cc6fa6523445572cbf1f7e5e5f3a0b9e357b21030ff817e5111cb8c82bd3594de93f0dde004bedee76f91a96b7d40000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000010ac1d00ec8d89c32d6f7498eb9690f6d0c477149dbd4209ea4a5f51bffe3a3eb8aa69c2672bb10f770bc1dcf6d89f5f7f3b8102a9e34b24736d9b2f3bb60c4f22e96aef947c60e8f3938c18297fe12bc26c4a4df9982e7aeed2702cf52d18aff8b42abf19bd3a7e437a555b1b67861b51de57b71ac0eae61a14b6dd74d53c1adb4cd2c7d725b47b0fc647f7f0cf3ad9b95b87162ca808e562c7baee5c80f90a07adcb20ce9593fa4321461e8bc026974eb27aa8d5894a371eef865a91f7263433274e19a9330dd568e4406bde94f45a6d7065b3effc06011c9696835df5860e43b6a24f29a0748be2078e47ae930f2f98974b943a8540deec46b6ba3a2721475808142a450816df94c3e3f4c170db374741dbb7ec09e058966855c3fdb19dc7a2cc6fa409afc5a61a738ce7bd5a113aa78321ab2ea192f05e629b04ffa923350fbee1fa7640a363fe3d5c444d97c3c173234bc4990659762321637469a2b89178272f2e7030febc9dca6e00150c837d3c29c8ed74ba291b8a841510b320d30e919728b056381eb269e3628df40cba873e18baec0a3ea6486574432858ac72708001d9c544fd7d8d19f6a5c9bef87195b184115ef2925f414bf17493b3945c47aa5a2054ffa3ec41b483f1cc120741a46fb88e4acd7df0a8446aeddd054706c330bf678c219e5e230d01ca2f53904a0d6eaabf523adc357abf881623dd87de69c1e6cf65078dea144d5e251e88736bed4a4bfc9a27f730b5df4622ff55ae5fac4ad7dff9c5fab251480186dcdf833dbe73792f56776c1e8bc20dc3540d826040059a4f2a3a0f7c2a9f0c7c68c6b3b13bf5bba6a05df7fd309658615a9ad9a87494f9c50c3c15d162aa1d6d96e716d87940300a67f2b3d26f066c30ee94406aaa0622b282a73d0c9aaa70ac60af1213dc3e9c67dc0e511a6b1618f4c5eb432986c92d6a41caec771691ba5d6c3a29282bdbe6d7ead73d24f303a862c75a3be4d34384699dea286e6e5707ebdb8112caabfe714c50c73046cfcaf973d81e3d5bfe31f909c8e5dd8d6f00ce8604ecd270b979abc6b4a67d1725dc5b807e9c95f1ffb9374c8a79e329bb8c1c0be94c8c5e245a9c67809ebb8c62a41bafc99ef597261d695ed798d0981f52fed2040f456b86834afac4c2a1b5221416e4a0985d9f8321fbb8c7ed7ef340fd8986eaa403911e2959ea78c4e903b43deb9e32b6d6e5444a9eee7c268850ed2eb3440846cd4760d54d7e37642a693541ae0d42cad23458820fd9e50e7bc7993dce151f5dc751d22e1e3b84c961da60b0fe323ad63c11b1fc0ba4714d4b108246b375f082a9637e87f7fc9c5322f9dd6aa81505a21aee56a15d06a4f57b7d6d134c958f5587d14b39bcf3804594874eeee6f2677752418b9bf3ca59a066569fd80fdafd14ff4ed7d25d6fa362147accfdd472278d5f19b1f1c054a0dd5ed3744fc719fbbb043aa239719d82f744eb7479be39ae7d54aa21ec85f270199797ad69d21e62045938a229d1c94f371012da3f5b98cab01c1c852d0b22a22e8ec6e71662653e6e6ed5776f4e62da479acf48d2f857c605bb3d81550fb9ef4778eede1794567ed4b1031fa452d0a485f67cc84a7519fa55353c2c249cec63d821c6ed24af1b0892d2f3f3201d434f530429fe66a3e297c1568074eaf974e72867fdc9bf5e3250069a72d5121a0e0a93dba5861190e045e3ecd1a7d721b1abf51b9ffd8f7e130921c01512b20375eab6ea3193c75cdd7b4627c21814bd5edaacf32debdc63317277acdfd9d82b12d180b95aa9994588d30796a43ea784894b7db6c574f8cd863f4cfb5ccb6bd0046a3feda4fc3cec77305a462397cca63cce561fd0dc9d9e961dea57cd662f51d3496d2ac24b03107fd8d84341dc8bbb58809c4871eb0e4a8101866ab629bb34346257ec910ddb8afa80fa720a8ac3bd94a00e710472ca7d3beee005942b5bd4efffd67fc9f26c3db63217c5d7970d61cb9c7a315f2c60ffd6262ab75b19c718dc315aa83aa9d5b52fda20bb2ed57d80f9d406c317d5d549fb0eb2b1fc2ff103458dd3e98f625e0714150498574ee4f3817de823b554d146b4df5006f4b035702f919775fee4e51d98f1e3b37c44f7bb53416855f4de996473ed8bd1112829701b4efa6fafe0fdf3edd3506d26bd468a5253b2c525f77e62eaf30718b3f769f638696d1a3e56859a1cf62bc77c1db9a67741af8e26a8ca24934adbf4a5006ee08f52b1d607bfa3520248d54f4b58ffc25dfe33dfe36ddaab49854283a04da10700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "6a00526353", 1, -1921562407, 1953719636, "0b528f9e6eb295dbdd29233ee63a1d1ea89a48f30a1acffa7d09df6f78f9d0e4"],
+	["0400008085202f89032d867d20b6698cf4fc437837b63ce79f3031a1e33c2aeb7315cf0b8605ea0ee60200000004636351527efb8008b765e49fea0b705af0dd260e84e858954bbb3dac00a0ebb00eacb69f43be1569010000000251ac75b557bd189f8849f20a0c6fe0f3dea14af1615a31f97d9f1186bc7d11127eded50e07440300000005656aac6a654916bc00032fb86d010000000008516565ac0051ac6337137603000000000951536a53655163ac637a9a26010000000007ac5153ac656a5252fabde500000000bd4aae0100000000044b6600dde727da9679155c4ca92d37689a35d2052fb43f7492e79392c00cbd84944bbf8f5928d9ba23bb6f88f7ca105cecf467b3e2005791bcc06a1ba8a35b733c2d849575d00fb636140286f1b47fec00e5017b29b1b35f59a0647d823f119b4254a1f8e4dc7622f6e42efbc85b8de0ac8c3740b2a514804a695c949ccda3384dbce0100c85ab0d3e92f577f00a3ba45579349b0d124a42dae1a67b974f221fd3e7490ef16aca99c571702404a9d2d722a5515841eb40a0bd8b5c4098225c0c24278ba27816eab4e94fbeeed481c212725d75ef43e735eb1d2e52b6f9e6ea43c497a069b3444797187dbf4c09d4e68278824314ec6e5d643f9bb0bf12f6e84b7a7a356c5dd6df5fd14d9ab9fd2d1489e80799c3fdb33136aacc1080baed216fb11f95676f764dc4d0168b198d891692fd201657a9c6d42011dcda02be00056d5dfe33dfe36ddaab49854283a04da107000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000f8ef412dde79fd48d7877613d1344555e152a56be3783c86d146f4e9328910dbd245a8c7170e1891d9342d8a85eec94d00703af47926cc29637081fd1988dd4bee7de8435252f9e2b074ac2f81321847fc14c09e5125c9c2fe5eda170ca9b544d78c11a640329eb53d42809b8de4162eb35bc8c29b37d0cc62dfec5facaaf92010f98452d2b261a66980af0243c180c980e3747dd321f87db2a8ceaa6c24c41b279e85f20aad7645801ede55bf1ce5e99091219b9afedb26f44b55dd049af4e49ac2bbd699e1297f617caf55b9e5fe5cb2e8c39d258812e3c16837be4ed041b23a12f532a4e945f2ef7db80a7ed25da47c29d096d7f36c0e8a2b44b226fdfd30fe168e1409839c5d0a144d52206f82000cb2590c7978cf53cd8ee441dc8626e7833be5f5527dc3647739405232d9f8d1b8e5ba11d5b985668996e569619802ad5dfe33dfe36ddaab49854283a04da1070000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004837eabe50fd354cb2849f34b16e7b208ee8ae2d9db09a4d6ec85c831d50b1a3ce0295b8d70ff5a4a1d872853bff215749e7230370c5beb03e5680c274bb0107ddcf3d51467784dfed13c87389f5ab700076fbdaa4d80e5f4edd6a6bb9fcc371143b021cfe1f6be76cbaa413a2f33225fb5b4ab798c948a3bb885346cb27288888197a1f68a228eb60e0a87968ca1598b4c65d1bd7d2e8bd9d815e821a3d02505cc497ce324941299a5103b27f5b1cb72802b3714b1f0a17aa5e892f422a440ee73ff2df402029fe497c0b3dbaba4508ac7e90e51d5a9d48e63c30622abdbb535d99dba821054d9823eee28a3f2a67e2b257a58c11843157fa113216d11fedd01eed6fc9726606ce9ff46d23a6e709ed6845375880e5470cd420aea4016936d871c464d9e19b163b655c82c141504e7c2f969ce41b3cbbb317bc058542f790db5dfe33dfe36ddaab49854283a04da107000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d6f8eadb1ea2e274fa4ff02982b87ed3e21683889ef0fda267db896a6d46af0ffaa8193eaa082d7e86aa3eb441673bb043c0968a41788ce62b477bd42e99381706fb79ace0bd137a6a9711c4a758361d3100573d6c9fadc12a0c0527113d3b16891768b401be08d95b630257631c16e59d3669d40ab2199c8a899c1d0d3e43cf4c0a78025f9806edb9135a84f328f3fef2dd29c3dfe4b4ee71bf8467e06eda53bba000256348885af64f5f93486503ccab13ecb356002994ef7cc26ebda2c0036f4c0c851cfce7e1e06c9df9708f18902231d94ee4595a3c2903227db23c21c4a98c9c63a59125c39d3cbfb5db626f700476254bad207a8c03b9a4eaca2cb354c5d0079def80221b5b625c208e2772aca9c65b60f369bac4f2f1d24377057e94f8bb624958fd759723347fe3217f1e1e026dac73f99b00a0306a85d4539ce6935dfe33dfe36ddaab49854283a04da107000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000018bb01a162ded4f72bf517e90379cd2e36754bba36872d857e30a9391e19715ce2dfb4145cc29f61da3ff476a0d142c8128ee7dc0e311e4edeb1cb61186e2e04c80ebaea1d515d287e7e2c8bbd93bb395a25c9f8a2c96f4650bac42cd8f505853a0a3ee57913a32db146201e75b1927351d7d70efa05f993e292cca074fb36bbabd6f3c272658774e351270d8b14344d2ff2e1e35e2ce65a6d008fac4069eb27fead8b7e66033857d7c21ee9f17be91da2ccac2f8bcc2cf35ae60b7aabfaf7b9e234a60a361e0b31b82401d26dd104b71887e63e0705d4a5ccfffa780077611daa79e29b915df1c21c868294c26c413fdc6c198e89b3c1d901522d8fd259bf4a33f10c6e95f010b22a69af18b4c49498fee1fc7bcddbcaa842d3310f9dffba455a782c090e0bdfca0085ba08964f4b5403e17dcd8f97710d9acc9b785340579a6e7fd86e42f1320e8519e1cf45d4499159a811e72bbbcbd7692f9cac69d1fac6fe57252c0365abebf617fec0067775e1ffbbe0fc8151e87efeb213cd99cd9e87d234c1e0ed9f9a298137d78335d389f5bcd1f746029263727a6f16be320771fb1323825cd653f534282198174260128181cac8687515b178df5fe7b87bd965360ab4a396dbf3068d8bc66d418e934c319ad715912a6b28a78c5ee6444daa49dcfb91e5991f02f0232efe388a191d87f75e0c65e013662cf15fcd1dd4ba545db26aac4f06bb6c05a2aedf88ebbe40cc18cedde82be59efab7ad3ec144a1147f600706af3cd790b879068154eb1f833c9e29e079c3f4e30f2fce3e1a62e27577cf5988e4fb06c9ddd27a66cb1da0391d734595fb743dccf135725a142cb6405f6d479be3e2d3fe2c28f971cf3d5b7629987330f8ea52da9ae71c112f61be1e0717c8f1b2739e2108e4196cdc8cd522a013da615502997509038bc7be434fd33a5a4756b2cde2d3e1ecfff6c53f1ecff02088ea118afe0af8097628d8059e8b7bb9ba0524e86040c63b9bbfe6fd206f2d6f89982a333be2781f79d3f1bf5a6d97a7c5cf335b48cd75fb2304a787ce6deb7c80768a0fb1f4e66b5e3eb2270496ac9ac38bec6095faad6c9ee75a427ab234131451d97d9c677663a54261b542e11c8425de060bd3d73c91ef72550356aa2096cc36cc77e4a848cc7c70f60c5f6656492d94117d888fbab72a88b1fb621807f12c341525447381c60935a20b9976015f2215724a189291f7cf3781b8433f3694486dcff67b593b0788c0d56d27de2ff868f06e9bbffdcd7f77c025b29e9f544ed699f1ba177ff97015499e6e019c161fcd9ed0fcc716b281f06882bda826a5cb70d2299930000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "6a5363006a635200", 1, 886887952, 1953719636, "36b2b49c15494be480178659c0d3dd50259edfffdeb253ffd3c3bf2450585bb6"],
+	["030000807082c403030e25e07ad2db1453ba6594f7e0b896053a3047076254983e0543113f7404c9aa0300000009536a53655163516352254b323273540e9dda1954c04f3b942aba45f19cb0f23c3d6c2ac621d20a2d31331a943d000000000753005165656500acb43534100cafe57dd68bdc956be00be50ab163fea9fc4dd8f924062f3f17706fc99c860100000009516a0065ac526353ac917b25aa012458ad0500000000015100000000a9316d1200", "536565ac516352", 1, -1765750965, 1953719636, "3e91f638c65fac26db96138aaf32620b1e3d69f8bfce9e36f2bc0e3af6ffe403"],
+	["0400008085202f890124a67e40a038a7737248c9ae6e7a0f441e05d8930086981ff9a87777347ab5ef01000000003e7374f403627ddd020000000009636a5265006500006a28b323020000000002656a310b260300000000065163006500ac9d9510fd351a9908516978030000000002f5d689001f6e85594e8812cade157cbb3b96f2ab88cf23b5b1994c9934860fd660ddf30966eea5293160e9f2bb540cee99ac7c55cf22794bf013cda1522839081542b154f815cb93c33c8247393f768d84158e8b07c2aa32963f3b40647976c787e8757cce13e9e766d09a32a2c81f18b86f117232f71cfe0455bbdaacce2a343b4feafcb85f5227b507567ad53a710176c3fbaa049dc56d9e11966a84f7fee6c98aefe1bf9f6cf1ab8f80d300878e2bfd6b021b8a05b2f03908c9b2e87f3ce8fb05908132db7849c3711c407cbd6e013676ffae49bbe32deaf8aaabc630a4309d98f119cec86ce52214908e9aeb77c3aeb8465c82036ed2d397dea213d54b1a94c6340e057a0762c94b487b504ef9050af89bdd112f9479c9b63bdd0d58067bfa1f299efbe459d5006de3464dc36af00679f0f2ab66b3788b5c77c9742b5e9dab9e72facecebe9a81fd11fcecc828050000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002459ee1d52858a68da9ba3753260e91a19f874ad9081e2af72d11773e95d403dbcdbea60bc2a52a2852da5712420bf96c709746fd2fa2cf2f7815060870d2a100f4e3ca9af121f5ef5fad611e28359d1add4214b335629613bfa60067235279d108dd22a49a328c770fe239a34438e17848537e71bfe1c7581a461bd661e34d9c5ab146f4b2a4989a2e30fcb4db8c5034a1b3365cc485420035ed8e689ccca62576fff4dd1224ca9bb76cbe972313bce6097656e02a50fe786314b085cbf381c250b67a4bbabed2ea68688290c8e80e60b5a3ef736343c6689c54eb481a13f2e65ffbc81ec4942c39a433622ced706f11d716fbb6ba47c5cb970ecbc4071bc0991560b60f91778c951e78b573a86981f588ec1544df31b294d1d610999f485f116fb594c4e21bbbaae945c944992b91ea468f135b5bc997182f056b0f4f7791fab9e72facecebe9a81fd11fcecc828050000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000453893218a1a83de8f7078a72da85bc4c886a0b8296fd93c09a0a0fd01850b15ac968652e6ab930f77eddb12b185946764564d9effc5d2de3bb25f6c3f4fea42ef323791f644a435a3136a90004ce7c1c4a6df3239745ec74350df6b7e3ca908ca03556ac7a196aa515a1ba2ff0e872538675472b4945b960896da47476af1edadc065c05ed5c0d07ed4b63bb814f99b4ef52bb5097b893ef9a2e688c90f3718c2d8c590e5afda9a5b44009ab185d4012dce694f3ec0f288c8862214df9db81628fc6ea664966b8823313cc06b31e642258f948f815b7a49a49f0fc2f62dcddf25f824aaeada6834513fb1a972fde0bb992a179337d6eb0363205d37d95d41dcc30c4903914b6c692a8dbd41bfda714451f38a96864277380cd548d3529f7f815fd6eb55ce66fa0c4cfae407e6247325048de115a2612264171dd0c43b2d43a67bb13691354084cdf837875d6ccf80f2f45314ea64b1c248bd014d5fb2dc3016d26a49ee09520aecae1b45de94226e86532df0d2b53e75973b94d0814ced272d810b1dde92752ee105d26189b0614c8110b2aca880190b4926c3e165383ed26b54e268070ff8925478d35708b6c08cb998d33ea9d3601d1c950082087660f4b19dc4191b235b48362024df646c422ae6fc73a1d666d1d3cf1d8c4d89f535609f688f3384c01055779f2920178c4055af564faa3695680690579b95091db023ff1eb6837f505281443a0d7d4dcd0187a2195bbf91de92c0e8ed5571eadc6ef579e8158df5d43b60c3600ccf6f083990bf6e9a0d9f76c4ba22104b2f3782f909bcf16e76b538d41b96be408da1f0c6246f05b9879b86aba4865f58e05268765e589c018d16350d903680c6ff6b28c396d38267c9475b009aca960837178ee0b64c4d68ef74e845a63a3e465a5d24a0bcc541b32e615314831e9e0804eccd551e07e58d71a0f63340a3afee3fc28afe9f043807d3e85be331916dc4b4ac464d0cf8996c6885c3e2ae22a2393e4a7c8cdae6d0a57578f78dedf61d170271a0868cd1f795b6d418309211a5e493f25a6b3e19627575e696b0e1b5ce568ac8cf3e76cf894c843c2caf2d02441dc20cb3a224ad69b71e32b6e4cfba373520bf153b55aa689f22e4f30ff17a019be8223b7f97b933717965525e22f671e208a682ad5ea2b23856ccb7a9134169b142babbf2aa59aa29be029626b257807063f3d9faa89197312fac01bd437776d362b6ad591096ffa0a317934ac795227d3cfb353f5bd650455df4e91f031aaa6cc38717ebb6b04cf3bc20cb073e3ffb37957d951190fed0c5f6e56cee58c81ed0afced53fc3f8fe0f5859a1e0b7e3173505143d14b7a5e4724f544d61e18ccaba54f6ad39b682181cbc0cac83cbf1a8d68eea1a014256acd42029bfb4d513b02a754c3710fa2488e508d301f627e84cec9a61b9b93401946d84fc40e69232f7783f71d4699df10251d0be570eff587bbdcebb25b41c83f959fb6dce0c569320a964e664e25fea79f81ce2e4071f3b95801893af60a3152bbeca61702324968f458e9ef9e6696998e5b571684064c3697cb2d190f08a456f3207e857ffbeb3f428528dc51842610cfe0802a32fd750857cbae3969cc3d745bec285b0295f543a35c3ff4956b6dd7a10369031959a6a97cda832904206ebfe148117446e528912059cb14cb0e005885a998d918d4575740f47183a030a41c8eddba50b508c8cbe1f404dcdfc383ffce0ab817164ae1dd7837f4a23c5ba4a81cae4fd76695069b899d92a9302460678ec12245dc43c93236c67906ddc6e4d93dfc6bac4c0b6cef079ec65c6a5a75b40427442983d263ca46eaf5a4b68e82a9a13f992bf8d88953266097667b2cce97a5fdb42caf494816f20ae961fb8dc62b54f903dd814a7980c0e57fd0f231e4aa137faa04bb32c8b44d380eea920c3d141fbe66cff5cde668c6b2ae56798178c502b0d7e9f517e87de792d79df7306e0ada0806dc4735254138e0cec78b846113de09132329ad50c63fae197aacd76bf29cadd776103a2acd701352d263287b759c8d6f15c8b50acdce899f3d336b5543b03e5718688257b02db7966024639b6ccaf6ce3abd4c9bad3c2f2f682747361e256bf800f65c948380ed48748c18feacd9f329d25ff56b3513ce79932807664c9d10851567b2a9477c86103c77c668978e17e1183955c05dad49e2784622aacbe0956d5a49b345e4f513f541367079c753348a2f000831bcadbfcd19ce9f180498670b43626593a0be338f989eebb52d996c2d94506c9af74c9dc5dd8753dab1d36ec5c4546e5516527e7ac76d0d4b6c983a2d969c8d8bec95148bf45d1b6305925d43b2c82aa4387f5a5814ce38be5faf3c832ad4817907d5abb09cc1decb0f02a35ebf3bc00f6cc2e0d217538fd3d6af400bb6281714d12d16f24e1adef477b291a530bdb2997526111a063685e1162208a3ebfae3372bf291ec34b4868aa64b104e71796a6a508545c8e4afa76c457343c818788fef836cd6e9ba46b39b816437aabb021fc7503b7c2e8469914f588e91fa798674b60943c29cb7dc7b698e9851ef12a10f484f3b61bcd0e7aa28a3685b491b8b74cfaa105f0145cbd88a523f48bb88ee10c68543897bb9a7d0f8bae1f953b16561edc2594f89f2edbb2a7a1f4f24200fe515bee38c0fa3ec47226d7a13e0b4acee5e6814190b3034a61fb10470b1caf342736e61f2edc48e93f7bd7c9e2def21344da3e3f93a6deef001fcaeadec278c6aa95f508eff36871ecb1fbc5b28314f2b2400b0b3efb989c135bf5e4f70150b6e5e030a50db76a29522f083bbd6b305d595c768efc3678d618333e0895e57f6e1aa9b07bc152ac0edbac636335df3e0b1db89fb7e98406d9bb4ae8ce4752231e9024d5bc595d1d64a85ef1815812cdfe87caceb3eda216478fd2fe4663b62afc39880cc60e2e9a56d1239c90a71f2efa4f0f7ed0b8580a8dfb418faefa780fe2d87c3471f6adcbb3c300afddda1fc7d6e288183cd2f8fd694def738f2b9a7747aff08de8323ed68568759b781052bdf06d2b7f5797de6a834ee8319ae8a8d52c73aaf67741450990a014854d9e7e9d14c49691b75ce4095fb92356a96df25e1b305a6971a05f688b8219b048ee4efaf94cf8f5267c7f8884bb65eaa494e2a4619df63b390dcc26d70a814469d137d5b1590484911a494f2c14f29ce1bfc1ca5f0b1d16769ff7de0cac502c237bcd8fc5c64c063a2ac7dd55d3894c2713786af77ff7e93b5b1e23439b78b8f701cd1f228d9ca950859bf3d86f9a8f68e39519db45d330dc23ceccd94196d4ad1c75075f493b8bfe436bb193d555d48d69cb0eebc0ec31b2e511f8715f580224847626375890d038db35da997637fcd06b361ec8d86001a74aac9f2fd7b22f8fe1b7cc440c144be0743faa36cbcbc8981472c042cc657b2232be95e521dd8eb7aa8e85ef1965afcaec993c87d7bc6801109279b4c987b92353f5616b55b4a3f3ea51d6da3ab585e5f9d28d62663a6abc6a129f9ff0a8a36e066eab03951ae613deae53bc5c7a6da1925009d8d8927c2300d38456f176e0bc22d74ab5ac2c3d38dd8a5474b3a6b6dddb190f859f842ee06cc9cd4839725bc8a0d7657eddf6f7fb796a8eab95516322ddead916e907235e3221942d9b62d9686b71a9562782c9f35fb7de2c82a276a395e67d8353d289cd4160f8fd90f39bd29556baed3bc7a6ec54ecce0a4351386f69aeb403d010aa94c09d91629e9c88b658e7e1360f32f25fd77365a68c9867401c4d003fa2ea0bff1689e1bf85e8226b298bdcb54f3af4788a8b93be09d324ffdb499efa4f004d574c244b8366598d851a0244a3b438dbc624280881d6a9f1c0525d5e49779be75f06df3b40e1b5d535d488564ea63dc548b055c780eb2493ec0d35d76aa2f81f012cb733ade5776d18e09c127d2bfade05a46053859650eaa273f69ccd3fa5bf25de76b65c237c7d2e5195d4bedabe0a273e7d50bbbedc22904613605a3ea901649fb28978c81894d5130eb110e34e5032cde4aa1f029d70e484b51227c9cfd3172a18095f529b690e2fa8f8eccba32aa0ee19dbc5fb9581f9aa513f31f1e212cb34011e42efb9d69ff58e56f968a3cf7b6db472576304f94a872f21360082b40c45a249e14d18eea811fb95944e99d8556c9a426697167c7978e938a5b711d902e287a7c5052d8f5a02341eed5ea86965f85db70c916758083c052c01547e1040e754f2112d2a581093624be69cd0a29d7bc98f8398123af628e55373924e676289f1353315ef190df4fc78445b09e64316277e50ac35fd92a03cfbbb2ee92cae0e8f04a681fcf795a8ab9f5869d64590b8cb28c55ae426102f5846590ef181ad014890c0c67b64b92e73cf9074d610bc00fa1f9ae56aa6b090f7100a6841b83f7329d9604c11fa0e601f9fa79734fa35ad547f09790c492fdaba1c14f44b576ca8abe577b47651c1aab7f621a55d24cbc8967efcf00135fecf00a5a12f0787ee903a876d9f1c1811717f6d96388db4d4847d6758d43b44dc19915ae4aec8ceaf2e5f2d507f58dca769ee38ab75704dc2c12ea631ec06cb4ed2850d49e33ea334a8f74694aa477bc1f6359945f6902cf6a02520d41c54b6706e79afaba8f29940fa5b3f15f92d31fa9fb67fcb64807c873f340d6399366701a4c68eb237866d5e15ddc70321117985eadd77c67c27e1aa6174d8f30394899b8224b2a71566a032158b7e6d1c4b831801115ddd1e6da26ffb739c37fe3ac82a89af8791678ef9c46d1e72fdb7fbef6b9a6212ac9cfef15d018baa6042bc91b3a4a5727bd2f6bda4e40209c5f85ae1bc0418a1861d806b6b01b85983bb12d3931d713c0bbc35cf0e68d10a0e36f217ebac538fe0638f7ccc37ce1c6ab5400e69e198163c599e3ad0df754defe4b1695fc24521feabec9e5c186669edb4a9f563b437ea77a9d5c4b5bed0c2db600ea95edcf9621715a812bc9a7f49cd0f41c8bbb8e22ae610db43057fd60b2ed0019e94c4a63b834307d805f013cf1ec2411338752e37aae19d644441e4622fbf9ed5b64d673b7f2d1d3cbf79e8179883f67d466621a537db599c20b7bd98c00621197d355ecc7da12b4d960b9f316eb605b1d12cf99305a2c4a3cc2102b6d4a6ab7a7bd80920be1ce5964959a425d5504d0d704414804e558ebdcab4b89357d5fc2a26924e7651f4e482d5bf84807847c77f1e54a946d403b699a5ba3373de65b6fb432f5b318af0912d422a7346f96b3c5972e9470c58c7b868a3bc1fada9a27a7d596398dff33145155f9219d2cce01920d3e3498dcaf276715e96ffad3812f7e6f3ac2d6b5e2869603db4ea301000000000000000000000000b0b7839d382036e9bdc57f80aec5285e0e97c18aaff33f7191e1b03d1a911a4481be95c6739b09f66b7593776309f33f9407be58ef4384307f929ed5e3cf82a2f6dc75791c6a0f86f3924d230f8eb9df02a2632698820c7d7b992354631ab5d10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000028f928febc0b9c8318d356686a77ac2d2db960240a310fa36a29a142c90b69114883f7a82d6eed3c942091bf24977c6cfc741652addf27e0b1f9459e23717c62798ff667798cb85455a790d9d3ef83c32eaa3090fe618dbab5edeb9da21dbed47bae8a89edbdb69a1853beff0c5fd7c19b16c0343aefdc34ad63fdcae10a8e5363600388b25188ecc3a53d298bdf4c93126060ed69e4256119af3b49c2e8a9257d25420aa21d4a93e7c2d3853cabb27f0237e10018f91f7aaa081be27cec9780816a4c4b689286e3c7cc18108f88fb290dda13577bec4e6e76e3186b7ce37a80e35be6337d45729516376763bc1d0e7939140bb094a4bae8c0b1f4c6d18f78bd7f3afaeef530a6bff07f8491ff93b3e4730962b1f509402314cc56cadf08634fea6bffbd53cb1078e6c22a3e356bb853bfa4c3b8276406785bd90e009bc062c8d1ad0d93e1d4c3fbbf94c6f2ab49fe1d8794dc7b4c23e3cc05f04c0544bee8e8d02d2b321139169515bdc8e69cf0a172664e47fd0967decce692575cb6cff82dd04e603ba871a7f836b2142211f4df93b4fdc9205e32e7943a5586e63a430dc9deb8038c16d1e5094c985258df76811b40d700e9649730376d84550df115ab18ab3322010c1c76ac663f0cb38767a57a145e180aa2a6d7de67880ea8bf56cf8ef90213adc97958c9f9cecbd8bf6ce528575be6c847115abed5af25231fbc9d9ed6b4e0223b86964eeed52e58b1f71599b8a0a3e2b762d3d06bfe357494204936697ea592a42fe55c399fe1de2528642016ca343ff35d652e9d9c3b48b164d5ade4b060e115d41faccecc4cb7e9d8b1c1d4dbb0c780790d95cf604314b267cae47ba0388d18d1ef2aac69a2089aef92982d4d6b15330b5ca139c72d43eee2f339ca8af82978492e4d6c667ab09e5e7a02ca954259a52d7e211e2aafeb094de86c1a573f22358bf1c5885b12507f1f38d70ec9dcec6090b0b4b581ef994526cdf682e9c5a4be75c692c34351206f135d246b7aab6029734fec56c3aea22033a95192170d33b2eb92044a122d968bac1543d5a80029a5a26b3c022b3e2217e1ba72b51738864806667fa0bf0b5c1b7f639782a305dad9efc18ae7c89022078cf9bd43210a4ce1a9a07daab9a700898c90c388821d5c6b31b731952ff67d9166c52b843b4cecafff31c0ae600928bf8819319801f73d949783a69fc7aa9185e8938298310a00e886790d42fa44b69252db8853630500172903690b0ed93cab59f45eb4c087b2c791f259ffd55a046a77d21f86c01df4788dd7beeb31975f354535904d2378979748109b8a7afaa903ac0b278679689b669a86f287e586127cf68a9c17bfaa3c1711722287456480eed64eeb4c6ec2645390d81b788104251f133d7304dced44a04c8b2c2dd237bf71f3cf10d612124cad0ecf4f154e078dae48e04916b076bfa44dd12f171dc6fac3cc9825d2b3fb2acfa91795b1c4b4757fbee1bd9f17d45abc8976052971b275c7a884021db0ea958776daad857177d0d1c6f28d3877a5f10006e1d8aaad1b5c8ce083a0f47bedcc0eb257297eea69e0831c015209bda81f690f47ecd85b26513611ae301aace5a3aef8320e0c2c2e831eb15fd1066a1f936a4eae3723d740f2647cc7e73aac252cdddf7a42c4ee78092e24762d8ce0db6cb087300bf543ef497245e3fc2619d010c1f5614cfc00f97b0bae5bd147b6d735979b875a0a1f35206752baf6f27a054831474ff8c6c78615ca9fbe5601375390a3662db12c59c43ee62b4714161aab07d9367e72bb337d71aee5adca67bd65e39f2f4d76208e39120700c406be62a86cd90656f6a248584a8541050b5c1d012fc7e3eca8955d7ad0069c31dedc86188d70174c6f449be2614ee4129d294edd4466c0784174edab74c4be131111702b96a0373b5e2442618c7b8f1832d917fda688382c48b1c5a92fe577460ed4c9cea71e162740425a613c6939c88c0841df54a7793c33226b0ea2b0febf32014c3c5efe19dfd72a6e48a2bd872f087b869e4a9b175e01f1ff984881da1a8b8c4b33a7ee1e19d88f73c8c9b3fe1760ff1f7bdd30cef6b4468834da00d934a1c95a312bb372f9348b34cf5c52f66e61b8ce914ceb54ac8c6406d4cb644049dbe4c42100b1010000000000000000000000002a96337a58f3ff0194fea4bf4febdbe6ae4cfcb62502a48decb4ae1d0c404149c227550589bb000e14b3991de6555eda724b62c6f255a06ca48661602e1249f5df9b345e905ddf16b2cfac0dcb7c797d332cc80b4ec1e0b4d0b68ea4714a7c3600000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000bf8bd2730a400e19d639b26484e1a65fe3619c19907631361a3b0063bbb8db2490e5c0d3b2bc9d38a6b9b63d4e6d4a350c8920524c03203d361641bbb2853f9ea74bd4d099f8b738357d31ad1c63bf658ec7424c23bb0bd09adcfc8840edb5d183e6fe7a23f673204df87125b43101da50f3247539e546ce9ad920e5a64b92c02b64e4c0722065eddba74e843afd727ea54ebb7fe09cddc3170d76772887901e0f1732afc29fc5a3c4c59445229d6254bc52155f09ea8862994a0cf04089bb50390212874c50ab17b77cc0c2c2750ea0ed974a09c8666fc426ed32e31c2b9b0a6506f4f82bc489e3c7c49b0f2c310183ba9cd21b825c6ff8635e7ad1f385f2532121bb27ce69f8531e042e6a92822d60f4d97c149e669ae79e92ca73c0b8dcd57f05c65feac8f706fc37a626a8d58ba09257287bf6121d9895f3a10faf31a80bfa9adc03053bf944296bf7d63da6ba35f95f245967b49c6a79d6e33d4d8a00f974d5ebbc9cfee2fb76b47a7824a61a527163cb5c27f23f06b6eb543aa01bec8000182b50e7694cc71ad9bec8a1bb206e74d83982d28545c8d8d9c930a47e7506720080fbf4a3ff695699c4a135e04bea0c78cf10e6f2dd72ea7b8e2bbceb5db0fdcfd51cfd647b7903af0cfdf0a578bab7cd408bb0cb593bff8213a691eb055b8001a881cffbc498460b09a15977481885a805cdcb978325ec4c6dd6518004c5482e3fdf62baa7f0189d42633845e485ff8be5b54f5eefa2832a80a9dd0c0be1781855c258bd4dd44d669dcd43686ab2725a1009c3c4de8b90760f363707b359428f3b0bbe4add5d97af5f5e6379aa1bfbdb7ebc7306cb4cdb87cd45aea509b2674bb3242c1947e6d2276530544e6b7f3ed39ed43dd9cc276bc5cf28ad969382115944e14712645ad149b2a4ee81c4991f57656b1488c2b40d3b9409afc326d58d717fe32577f149c292ea2e5686841f795e5f043289eb54930899f988ac1de57b0493646d67e32939303ec4588c73e5b3ede263bcf4fcbaae77f1afc939b7455474b6c217566c1d02ab521c062c8c1157e1bbb38981739a4d99928cfd5163f589fbb4b62fe35c97b29c862339a3851e9e55490536ba19e6fe48fa274ee2c76459b0bb8dda62502b5e15cef6818eb440eb909d38f3834717880aeeafaeb4e639d489dee48272a1c21084a0f22ce6e6a2d19a86a5996fd3aa87a29d844c99a0c0da246346f450dfd2a268d76342215e21774694a59772882f00c891f4e4090b0121caed372bae0f012d233e25246352374ad3e34dddbfa83d34b2e62066681895a901dd45fef871195bb21d23683d47c1445752ff25ba85b72e16ff4aa4ef5fa67e0f0ce00a08af2bd0d1141744f953ac034d6257289bfbae6fc1ea5332a1893122e2b63851abe3b8c82a76a98beb145ed64ca2b2fe0cdc01cdf436402996aa065590147099781defe102e0636ee6eaabc0e4d964c6efa2d3aee463a39faf3f6160315e6b9bda628593b64a5eea1067749980c178e479919df2d5f53214eeb36521d1fc5de9f62a8f648e28294a63cd3d1b524e5df820e7361a6323963cb274e073ab7947fd8dc25e42e7d66b8fbf946791a4a752817055cee8c4bfbc872734fb7b6d68a962a9369da1b36cb557159bbd2f2ee7bb9ee985522602f7c6e8735b1cd3ad15e610e211f539fca3b917d89926f3aa8fea1ab00eb5a99fde42d1c42885c291938f2652622f763bff7db855a95290f1ac19f776e8d72ced061246a44ab92232c86fd6834de8b0a506e9391c4318a5b4f8ddd4aaf8e27bc87b2938ae0cb3e422fcfa29236e9a550bbda50a3d3d22c8a196694aafda5c82d9e8d8ec2d1a2910c6021431c100ff7c52ae3fa9a1e1349f00088c7f2f083a71c6366227f49ee8c352335bf63ba45b039d05fc2e3549b2ee8107a065bea8ef10ffd8f0dc78eb58c59b673063e176a5f13acd2cf3db8862e7372fcc60fa0b30ae0f213195ea801d8f236091c8ddf6541ed075a7c6e347a4f355928e32f43890f614bd345033e0c50be7140944adaedb65d8765166e32c0496b527a93d46676046cdd02ef9b72dd6f32e91d403823275be11d32df89db0be6e9b75106088c9451f56adc436e4d5e3bbee9f89b0b1f3e1deb98637efdbf585ed580000000000000000830ff402000000000b77edcd0fc12ab8c65013932c66cef664ce095a7073cac2bafda0a30b48ab3a16b1239edbd3bae660ab8b1186dc5836adfed2e4eeb8ffeb461f116dcba0ab1b4950477523805124a4c3aa9f9b1768bb93cd81e362bcbe33b8c5b34a4105b3b3000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000006b9419654cdea1b470d0ab8a15526d2de6afab52508abfdf380aeb23c27c7208404da8291e92a9774ed74a9ee4ec8ce30ba269f8f958bcefc0408723ba990fdccf28a80e6536766470c8f86fee88b29a3e56aa9493dd443f29b5941aeec2ab58ba6c256576beb021387a6448988acf3255a3922f7daa01ebf8f3e3261b5ae0132403ebc656da0610087fe4fe20df0275c583975c415966fe1d5a56706fb9e993316c0bcbae77889dabd09ccef81918fbb2f1ec4b8dbd00a6ea7d91a4baba7cc4aa53f21cba58ede6a74cba7aac182cd272d5d67b2619a397896f737e2a971b365a526ffddcd78ad585faf3e5ba608a74d4f39b7a7fe02e6323277b2d1b9cf6d6708edd3889bc01ef0e07a4410072afcae1548e53175fd64362843d37d472985857c3982d91eb0cef63d802232078de696c0d107b30df426a24ad1ead6ecc3e93bbaa26278824205466e8f0df86831c4dec83020b39255619bf63e85190bd24492f769bcca17289772c29f2ef3758be99e2a6aa70ed7ff680f2bb8f70ab728ee07f5e52f246f4c2ce07c96255bafe5f4ab590fa4d9389b2df3483f9ea5f2605c5698b0db7fb524fc356a7a610d609a04c4110b4b76e0f70c52e7088b6ebcf892fbca0457e87730dde8e4003ad754828beb20b8e6e8a6bce42d0e00ee0be7f80b373bf6b0ae19ef2b91b3ead4c867ece6c2c7881eda244647fdf285e10214d65b28dc21d5de9fb9d777610cdccc24dae086343ec15c16edfdb98f14331ccfc6f210934bcda3faf88cd855b75a07ff12e41d65ee374e6e2676714269cbb0f92eed1a47cecf4482bdc649395978faccdc3e4e1cbd93d6c2f35f8b82d9f6218097c2b55e7b685f0f7117011011e77014c37505596da6b31f66bbf79a9f12d320a20701af6ffd80988de75b49a4420321751eb931fa15bb8316001173670b8c830d16f9d3f7565cf25b9e29d45b7f962c132d9b2508b35321cad8ed9a65f0a760526c93b297ad6a950540f9d18f87c869a9948df176795d80d39c8bca420c4bbc25e6800b61392d0d0cc13b6f192ab16e4dbff3055099452e0c25780088a889396ead090029ec735555fdbac16f2fab8cacbb9ee25f9e177dae8c6fec2474cad958dd4fdde14b153ebd1310119a63df8c95d9793ed73c3ef4ab4555d28958b4a742b7c5c8642ad436306b0584f9bfb6ad4ffe6001f20aaa50e6758fa7cf7f5a604d8e00b0676f7871c0b04739f3b19a0f3f13e57370f75ba583dc2c6f1a5ed6c9d8f0a02e80b3c3783f6c1b24ac640a37c98bac20b69501dc81c55dcc155220c88a49761e7d46140d7291f5753296c5e8933a64e872eb867087b4692e3690669a7f41063725b60f257c289a8defe652a9c5c7754e42909b6fbc008b9d8858a8ae4082db58d2c36dbe9db64d8361229dcdd6f3b76b9cee48f65d009cac0e2cf431c2592e9725d7a3ce8b1b0d3fbfa98867a530dc66dc57bbb271c704967f4fad96f8b860a210b1eb37c0d37ed5bc1db1f7fdd38c95334105a103032885fcb422d3516b936c4fefa92eb9f879e0d912b568b7796311f8bfb820ca3d6ce63cb62f099188a7eb3b42a547db04a9103cbfa88c86d7d5262efdbd5131215ba50ab95f3eb5ee3487d2a07010843d14cab3136009be9231e2236150ff4c291e103f0189bcc95952e5dc6d9190af00ade139731cf91c8de26e74f568e6e8193b8df55b8d8c2b996b2030af5a52eb386b77f38bfdaa1b824be6501fa3fb062e09c455aac6d62582845406ed5f816f68df85503ebe638712d239ea85a56e9f07e2a3cbae70e493964148ee606bae0811d40b555f2ae98363b12a2c0a81bb6887824c4da8d55d1a5c97775fd91ce3dd02fce222f01e337c3959875b1fafa933b691f6fa14e09ab9f1c41a0187f3cc888c5e68272d8f60e8af1f502d5a0a0ade898eaf19af72fc8cba55dbcd4949df9a4a9b036bd9a808e738af9cbb1cdd0a55f5d9b2248a2dfaca67749b99ce3da342c3e04892e3a4227ed000a98130b7087df059fefac47b02168b8a81fc9b210ca693d58bf07562eb60367fe6aa4f3936958573402e852cdcca70fa0e0d601d4535b732fc4ed2aee52b210bdb343d42a01ce2ad760c69fa42e404873f2d6e464d20f7cd2909a7dc0ef13f1a13a87ad290e3571b618a98b6e7278821c488699cbdf90fae36f60684b5fc67cc5573463d9c9b84c55949b2fad6cdb6d2d33ae0283c960cd4883c1d374954de1c43c88fddd1ceb352a07b82c4f69fbe075eabdc5dbd64f86090326a7b6a27102240100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "63", 0, -820106290, 4179206552, "a03593158303b2603c498d292da621120873c5e2cac2a4f8c804ae001b4fbd8b"],
+	["0400008085202f8902fdb8cadde334e3e3f8aac211f2e8613da4590038a5e55beccc293f8f31d0ec71020000000863ac526a536563acffffffffb7137443bf09d4a559319c1958b9312f7cc7cdc96115ab73a59a1a7c8c38342f03000000096a635152635200526a7a79414d0335a4e102000000000452525265ca6db5010000000001517e95de04000000000863656a0053526a528ae507d000000000c4f2900300000000024f64b12243ff90ee24f6981a88d8608f7f7ba3c3c4610534a1cbd3b83230866a33c803855440e703470c278dc7ca023f646d1772fa97db1d20a901cd3389504233298e5eec676082c656c63c017cf7b773782a74db3fafea9270f676368b9bb9e99bb1a0a214e3e819f29260eed9c686b717d9d30d6b0c7dd11d0db830717bd57a3409cb441d2d8dd922b8ac8e3f320a172530fe40ca61f9fbd088b34326d8193d2ea1b4d7ce1eda6d6ad910b7f12330c2879fd858fbf4d77050ab55fe79af19fc74f4e6ae01ef1b37538e56b0087ab7c21b41313394effaa50e2d49b02710325263e8ed380b04257dd45bb09131ec0e1d019556196a35a32d2460a74dbb10ef4c5350284b91e89545bf41aa60d465f0a84dbced0d826d40c5301d085428925fd510732a372bb3e17f30d978b4daeee17fa9b8e786f5d43bea4ed49c3b7f4c37bdc5dbd64f86090326a7b6a2710224010000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004c1d39a28126935a73fe6e4d3d9131cb1f07f2fe0b6a5abb6b365ebd087e489c591649a13a48826487c2f703acc3eeae22e6655e3449a66ea036f1cdc6fd4f052e0a33d077a70f5241dec019ea8223b86303b79ce1ad51f4dafbaeccda31f8b0fadb403312b12e89cf246d63b5ec4eba9b87936b86b8220bcbcd297ca515105d0cd009e755d2998a41cb55fcc6ad537e585dd7194f996751838d9710ffd5c568dd6d99872e41c333b57ee6ae8cbb377b0a533da68febb9bc67dc6af167fd8468468440a70c88688214698bf1de82ae05f8d3c89d14603df0b34c335c09bbca5a1cb593e508d559540338c687977c8e9cd3bb4e02a60afcb34a4b00acc27493c000928d9bfb35825fc04df98e189c914bb9d3ed146ee1102926e6c4b5de20b150b78837749bdb603667fdeeaaf7cb00c93c7ed6c698113362a33b297eb0967dabbdc5dbd64f86090326a7b6a271022401000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000034501591e1306205dffa5f02baafa516038a2543e1f65d8aa0954648f3f03321a5683ed2678f0fa83b6507608fbbf3e698c36e25e83e90e6c2ad1c557cf30d94107e383651378c85091e077f3bafa5d0c3183b6eae25085bdb305a4f592646c66ff660d352a159bb6ea8fd12a83a7a32eb837665a17b195265cbf3ec57d824eea1c840a2734e52da705bf90704a6816d4656c1d30200703faa01a05fc4c8ea1a9e72d181a7bc87366693ed5bce6b09d5a2472b4dc0110992f5a412f7e9ebf4edbdad1145cb787ddc1070686f01d34379e71831ccda6d25e14c8d5c45075cd0dac4b165cb80f1128c6aa463dcaa57c99040c8bf3b9ce9d98b1ecd4958a792552068285e88b37918f1a9466e1fd742cb3761c2de589ac6d1b94933cf6e91f9d95f96bd54f71f8f0fd0be17c8bc257f0d2e18e51e2d81e9aa89279bce0817ef192034f57e503c8bb8241bd4ef3f5fe875d661245037ca3356defe41a6957982adf5f206c32e571e013ea9215b1d7ed0b3cab878b17efc0e7815c0ab64eaf0e03688c7bda66562d401cc771e7f91ab4537e92c68869f1eef3cd5717239535ba351a3592c45a4cfe9eeeb0e75ecb06cbcb8184f14b2f280179a78d66c7174cfe28b706d5a6f7405ac4ae987ebc32ef187c073339b6fb5cd5878fc12e04b17e48626c3f402622f8a80a531b694eb9f3c8754b86c5df8991a89f2619060c9052212db8e3cb6063344c240e1d2e18ce7fe5783760ce57ad9f46fb7697b8c222039c2000ceeafb85d6db7c52747bda4cff8d10a02ee02913ce7a385d17af95337d9551f15c2329ebbe418f110b5cd938d997860446f0117ae54f4d591f5d602b36c91c1da12181b4122acece3a405515f943bbf911d97f1e2ddd027de67ef29d5b9f5da2a7408f5919f67ea2b1b6994baf7534fc6a41a34dd385d5d5ce95f4a55d2150edf67414d7da747dee1df11a2b9cb8e5eac603835f54a7e5c336ab414aed62ad49541989939d53f2b2ed10df88c4833bd68034a70f5f905e9862a540df62a2f54eb2774bb8e36462156993f1b5ca47ec446534859abba65d1675684cc6447c6ecea620f06de9ffbe3668cc487ccde41ce3d998abefb752cf70d61b2f95901d0bdc5603702042f32b0be7cc0d98cb179a42881dd88cd3b6acfa4ba8297cddbb04dc9cf96a952471a963b2318def080ef0e13fbebab8bb2eeb1f3a275db4f774ac2c868623f5ac3dd046332db7c9141a57db7d7442cb22e79d804222b6b7fb3586017c4babbdd19a19f2a91000435cae08bb95156caacdb5665e9ea1ae0f78e506ca7538a29318161fe06a4698a2d2cc5b5d1983c57716c778b8837b751fc393090139d96d1ceb13da7441af5c2f97615af81a58e1b719104ea18bc21a75b3a34e21bb17dd589c3c8787f8559718fa2c2a7c0da729830de49a204f06dc47cece5ea69e032455793ab4dbf6cbefb27ad1dfffc798e28fa69fcb2e85ba0c2bf91b73f5db0d295c87949be1a10fba45da1b16fc89d85c31c829ab395d0cc215489e85182e9e9a011b46ad4b3c6b3832d0869ee4109cb6e70b96b0bff4740bda3c7912ddfb5c582abe97da0c7dc26159dffb2384e146bfdb546e376d13c49d5d1b2906f7cebfe4a8b560b1a89a9d5a38067c78bdd375527bf56efd6925f1dd40a3f605c0f19c2c76822132a9856d773f5ac9bfcd821238684ea4c2c54df61a4ef8f98bcff3b1736231558801dc78183565f187b11f22a1b1ccd6f24ca8a7a95898f82b59fcd802f81d5f783f35249d59d83739ba1211e874daef24cd7674c76f85f574e11ee49bb7fb34cbbf369122918fcc33a5d30cfcf11d8499127d82273b05224faa771238c87a203c4226268716f1fac8e813cb52c8a436425254c487203d4473833dd67504231a22e01463c634243a0706bf4a0d6e6017b15e315c8e450ddf945fe3fe95b92c03aba9be7e63da504f9fd4f123902ec7e249d7a036f985c887d76d97088ef90221341f6e54c2b94b874dda829e9548f607d24502f1f68fa7c0d3cc64dfa003db469f2faaa90a27a395d4650869b0ed2c304f3b20695e58416a8b50245bebbad9523eb65bf379ce92f3223eb3981dd26c278093a9edf20785cba3de9b3aa30d6f6a73b12e90016c2d65f74760aceb47369e51bb492c4985d66e987c2d01f8af8a5a68721ad2723e8cea06d2ed9579d69d8106d3f0bfaddc1e610898ebe6f59aa479439eca6184852c72e1129180e6a1a9e68a4dd1a6fa28049825087880f747c65ed84034ec999fecb538213ebbe13ccda2a2388445870b530d3f637ad60363038aa74aeec5da7395bdca86b97206e01d83ea7a99b2eac023eeef3aa27c07173a5498376aadb246943774480cd18badcac5994f586655f484371b6bb0944d27a3bcd68bda14b4b49222d268eeb9efba3ab60a41e05c7f5077e38b741519123355e7e9f7c3ab7c95aef863db0c08c8dacfc135e7ae9420bee31ff4d1f2dcd2a36cf676cee0fb57757ddde311bb6625c891e3669fa3e45e3e044000fdff77d7c19cd327c88903741ccafd762f44eb43003b698d9771e11b49f14cc74f8b4c6e07cbe46fdccf7888fef3842cba1c6e6cfe835345953d397b1d5d1195fb46afc90056c10292cde5c90149f049ac8936454487a79f62ed615f8db6a4164f181ee75fa0e13897a04fa94ef1a85ff890ddd6ab66cda4a8a611e2ff795706a2b3781dbd9c766a95bc98b0897183f2f7405c24bcda6be5809d81b991460b1ac5eab0330cbfc52c355e3efee7859d5fd05bd764e8afd2ab4d775ad28a7fec105d245a820d3e02db7ac758c8bf62d3619a1b6da76107e09738e101599261343299b4759dc8acf56bc2e6e129fda7fc29efe8014fd5d589e5361d66c15538211ce4a700e3593d70b0eb2a368273b4fa795dc516452ee59d61b0eaf0230a0c1b2092b5f305eaf746270fad429f150717c43028c54ef49cfd0bc45ba5d6cf4ce273609a3c07ccc84cf6f1c62a6b2a8b6037736958ab4c4311d11568e84098ff6f7ac6cba401357d082de15dbb50b181b3bbaba24dccb3a7930b9e10d48b9ab2c402471e65ab17065d6d8b0ffe0fa73b42a60a104137793eb1a5c45378ec2230177ca79c336868ed69a73b8994c7e30e2781b54df854ff829d39563177a153a653c83489c5230ed719b155cbcda666f6a375321c280573bbd6e804274ad04844f2045285c85143b043b734685d8907a2522ccd277d168624870a2627bcf4fcc1986246e46431a868fe461c43af8c9851205475d26437a08a1b2c900bf558b1a9b681dd2ec2abf49d511f190ad4e04b42aebc37eba9b5e81fc9372eaf258d7ddc4a091bfdbaec560e3d19c27f53751c222da627250eb04a4b0a948d7c9ce1206476e61d775194b0bcaa1d02fc1a6fe5270fc08ad5cec8ed213c4b6d0b9cd799152a051d1470e4efdfeffe9d357aa48645d83aef5e30f2b399c8b105762c55863c2aff049229ebb609d001f2b31302100a7d34bda2ba181ad50fbc937d7b283922af6a7087ea95637d73dff56567793493932d6b6abc7b363f00d27899c1c4f24b7a04b9ab425616f57670ee507c0ddc486c204a7a176151628da69f5751ec1654f2d41e16ed0d0e8bce1672f457e05a33513fa403e986d794d231016842ea0a2cfbb582d4b45095cdcee8520d4060a384f1283b82b33f98dfbd1a59b6937a457593431f7f76cc7624fe708bc48525d7104a5d3419858fcc6c216bf1b511c16859c783bbe0706ce82814afb52b49c129639baa0be93b11f53209c1d0d8b0f4a99d2e48612bb29d89d6a7d53bb9899bb2dcf036f27d2ec8dbe8d9f774fb18065575dd62e24b81993741ce5107b72ac7c9c46d37be6bd0387d88a3a54fedd6f8d3bc0766897aaa35b45f256c3f86fb00216dfcf1880ab96ec713edb0f763368caacc731e4c4f4fa4eeff4b4937b5c5f132e13da9e02015b50007cd98d843bff1420a5aea2a6aca32d442a62c841ce4a694f9e90ec5faee9fdd1ea9e9d55d284e90b10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "6500656a00", 0, 914452598, 1537743641, "00d4c0a82fede02a823aa5d60c3345bc869838cbb6873121f80822206631030b"],
+	["b0d8331903f97cb9abbac1cb824f1837523067494399ab95a1b6d742f14e473197379ad62b03000000066aac65656a653c6f99f587f28e9e11a2f47990282871dc0ea564651e65ca12f898a13475f5b2767761cb03000000056551526365e5c1f2267f8f2b85c9f66674a7a5a37551775c1032049c200e7213413992f1ab5ff1f1ff020000000152ffffffff02f37c2e00000000000031d33f040000000007525153005300000000000000", "006a6a6a", 1, 1979575336, 1537743641, "8a0ae78b2685da20de2ea9769030288c37e18126722f2e646b2f33e030e10a58"],
+	["030000807082c40304c5a58bd19b1f655476b716acb195fe7d4b25686b7d03e944e8034a331203b35801000000026a52cfa467b09a6bc8cf673ae575793fcc2de03df7e75f6c9ee9fd9a9a4c6b425e53b7cd1e61030000000253512e0c02769541490d5f898aa52482faa59840db3f61385ce751f00ef96713077c0079a0fe030000000251ac3f2d1b1df3b2a93947cd5fe6eacbbbd4055f50eadfd0a6869d317a0383a50fdf32c8b968010000000151e74211a701299cd20500000000016aa4c12a7d0000000000", "636a00006a6a", 2, -1551285711, 1537743641, "a344771203f0c45fa79e483cd86901b0a61d2e9c2d28a822bb18e0ab6502dcc1"],
+	["532a9b2402d69f3a1f7e22565fff7f94d9f093052c1bddc7e9a483c8e4c93d7cbc6c3bfbfe0200000000ffffffff5d1bcd6ce98d8e32d00283c99d0d2e66ab4dba776dd7780b2046a92df03dfe3701000000046a63515374bf2eb802199115000000000009006553656a525300510d94b200000000000100cbace1bd00", "006a53", 1, 68840018, 1953719636, "9a5c679ba2e7f1a97dad6abfac0fb139e7ea64e4494aa858b6279281f3e562db"],
+	["06cfcf39022eb4bd6a27ce426c45c48986020df88cc938233d460cc9995b81798b170b552e02000000095153ac52515363ac53ffffffff70c8bd214fe08c1385cad5552caafd2639dc15bd406c2e334cb15768898770350300000005ac006a52522e487abf04b2951903000000000365ac53f13ec203000000000400ac636ac7b22b010000000001631dfe4a0100000000040000ac5362541c6100", "", 1, -1888468665, 1953719636, "d83481edc9842fd71d25898610bff084ce56bf743154a3c5fc6259923d84e0cc"],
+	["7e1ebf42030da7916c29d9725fa881d8e786047f71f9167193c40d5828afc24d8e37bd99830000000009536a53ac63516553653df65f5514ea7f860b0b34373292f1f63bd79aed28f52623b3c73fcda6774bd796ce8da40300000002ac6a95bc859bc52a084951f0f96fdf21cc022db4e52fe930c41bf6547c3327b9cfc303c2cce00200000004ac6a6a65ffffffff018fc723010000000001000000000000", "525365ac00650065", 0, -1492359363, 733220448, "89060bacfdc4334bdea6aa8717a3499cd78e5f05d36e7839a6eef5155ba2ea9d"],
+	["f92ac72203008603156419454171294ce4c87216a2bc5cd5bd5ae723722aae28464f7fd98501000000035163001ba67a75e60f83cd8001c0a3075bbe45766c7c7b810490f9596f993ba220be28ee461009030000000300516a616892b2de6afed77bfd53e62cb94f3244c0b9be5e8473416d9e4e1810aacf61fc685b9d020000000251ac93f075a902746aea000000000005636a0053ac1cd30f020000000003526a53c093aabc00", "52530052ac52", 2, 751306187, 733220448, "631461be82615b3b8d40a49fc4d60363c8ef3f50c73a65346447397f55ee83ca"],
+	["0400008085202f89029df20f8101d1e3bc11d758eca3609d30adba709c503a71152a696645c71d05f80000000003535100ffffffff8d5e44ea0d310621572b7dd1a464de9900b97796379713077b7458e2b57caf8f0000000000ffffffff022a7ecb030000000004516300520f1e2101000000000800636500526365000000000027425c032b63ef010000000003613dc88c0bb93a470406921774eb8fa3bc13fe76023ba8f84326fb39647021c171e3ab7ca9f38325e74c8d5519ef3270f5b74e80628c9fa88105f54387652201d81e43d05674ff9b916f91b0f3066c9e487cfa1f76be3c4a1bcfaf600c664ba26776937afc96d53b4c721fffe88e322732f9232a4b7efd3fa46cf465fe5f1918b4007d6490a75b5d43c3d251899d5750f2015a175787ef97fcae3f3ca97137dff26b8128791d3bab03a3aadb311a62a1cdf00535e983c79d2123d825362c28e7f7ca794ec43a9404b9d3fa6f0287c96891b7f789d3fb36b887ef758a19ea6804cf0c259de5fefd2dbfc67ca9d18104ad028bd89ac106fa5345e66c7fbf8992210bfe02bae77e2b5b850814811114d6923601b9e83c8e150cf935ed76f5e0359e08e8e2108e3fe4056c87de141f578c9cebf49a72c5942795883bf4f29f5d4fb369b49c41ffe00a7692af0a1a484bf602000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000cce94bf16f51b3803d027e8cfee477cb77b86a4d46a7521d4f230ea6fee027612d583531a50f97a41e6ad3bd9c8160e448d8f39348e4290b0ac40e493ae88c5344927fdbdd357f83fb38af2e33e9c586d8bd4680f9b7912a4d044255c685e4343355e799ac9ddb93c83078fbf47e9ce2330861a3b628ee09c692ccfc4ae4bb55a614139736a0960f4e04d253e90e1863972f8d42d0ba65c542d18a319fc269c0daf7bc50f5329e55c9a874c2f12516d3a1d7ba55319ccb9dec0ed92c3ddd999fdd9475361c4e0f269468045ab4bd75dedf9bb2871ac648212ef72900ea4472a30f18f114d8aa417b0d16623d5b039aa0ccc4e763ebc038887896b350fc288b474e3c8b4c3b4c919e301c63d98690badb75dd3e282d4ac97ca18192bb23d2a021e8bda860c04d2c2814a245f01272da9bc15c29f2f4d30923ddc0b59031bf185269b49c41ffe00a7692af0a1a484bf602000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000e60352918155122c9095783d3567b7c22e003f8394580b0b1c731bde017fd682c0b7711310e78c2ff4c37e8dbb348129d09584560a597f4c966a3734c4dcb23b75b137363a8b75474c766d650d16683f73eb836e4c59e89a10b923f66fb30a53c30565cb1394d75722937eeb97c5fa711f06b9889d8860426311455d2b658dc0da4ba89945fa758ee104a3485859213072ea8bf2175178fd97f132b9b080d90ec0e5aeb3c98f80ca2dcef24c6c531bcbfe47bb46d20fbf646fec3ad1986be4092979d500b88ce728d9015830d2f20ab658159cd058c95bfb04205eba36732bef674d065c17aa53d4f3a50f6a04fac781c501ec38e74bc22baf6eb17d74a58381333f7f38b9812d8399eb90aeb85169663397830b05670e7c77e050337283c905958577ede81801f0b2d972f88f84cc399845f7fdc0f07c122176f24bae0bfefd69b49c41ffe00a7692af0a1a484bf602000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000026bfbb255c2767b61cb94e552968230355f038bc8f27499453795cbb6a9b1d5417d11ac06d37acf24ab9b0866d99d9bd38beecbfb6260ae5f818aad0b9fe8000ada705833d9985c0c1e831acde93453d4cb02ed49f4e256ed20c38cdee6c6dabc6b3f9cf339c81098968319ed070e7872319d5a848904c5e88c59e6bff91a326f151ce6eb2aaa7d920bf15398f96c850562a57b74840a6b011d8facd77307f1268dec44566ad62a4118758a86bea18bb4eba7ad23b7482d819e9456c3b21c94262670656b1576fe6602de5a10d6eb5949148b658d3bf4d137a57f5c3a7c38b5029fe242693bcdd314984d09d7b556e150e33ebc47659f2ae0630cf61a078c9dac7fadfea81f501f040b3f6922073594be657abc847f9782f65a2a6d45639cf89be26abbf40ce75655a945afe9777fdafee08343b919c4b06c09b5d9957ddf0224bdb084bb2aebbbf5a2bcce172f5d53108bcac36cb5d8d5d4f557c67a33b4d40b3d6703fd758193c8db179fe7f94c64ad3ca6ec36c795553713ddd0fed6bfbb7a71ecb8ba2a427dbdc82f3ba71cd14cf65acf302710ab27b1e45d04350bdfcf0a9f7c0e9f7ca3dce4edc3d845f0b26cfe26cfb15b0c3d627681b3a359098c740ffadb4d0b4bd1aefad5c074b0fc323e1aa37a0d477ceef0515151a84fd81bac34743aa1bebce2df3df7ce77d49b333689be4d79cda3e0ff6c5d56f0f5bc2131d8d5892451c35f40f677064e67b5904e075f0ad40e2c502dadd8dd6172d2929f688696c535cc3404981cda82d709b8b67b0f7e12f6cf6f3c4dec850d283546bdcd0f326cd6bb0dcda63952cdff6e656b8df90f97eb1736373007eaf703b595d3bbd89423a0b513ae42fb4e7e6a331aa88e6d562d206a280818512932eb639d589993589f1a314692eae37f17388767eb27086e6c0060dd586d6a7f87f650aa2064c8fcc738b9955085947f98d81d4e9999bef378fc59c0cc9063ebcfd0ec35499a3e850f3641b4599057076b38630d5c41b65ad1af25cf1536e53d5c6629e7b3f5aff35619174051fd141d7cd2a20d401bf2c9d06a26ce77575bc5996b538fc921b2c5b8f7f9d7f56d3bf803329d24a6db7935016f7c30073882b044372a5ab2d5822001150c74982274f40be42e8c31271bafe6bbd57c266328ecdef76c9b768006a29a4f3f7db5fc8b13e371148e6fba22e64fc27a2571212637fae540af228a81cdd56434208923430d6dbd02e5750143ff46d9928e4be8d62628abb794694d11536c99d16a912bd66e0960b23526b55f41bd2cc43a37804811c2f7db80d93a4b75a82a4c02433914b5ff20e870ecdd1bda3f08be93f7410546e041f76333769d8340d16aa5d9ca5013a5a8d9eec4a68dd881f11681ec8484f7c8293d4564bb4cdd300d8a2af91523b6eab9a59592275b7ef12defd5e0c54ccd9206429a9847c29d05699dffa2bfd9715aaab4eb0b91e3462f8e808581ad9afb055288083a5bf7f1da4aab465e2026ced3d8e9697727922a3f07106f93accd0c804cb044bc603ceefe82e57fd90244680e0fed34c51ecc2fdb69790b8716b8c2107c6e7b51f6e4b2ae0adec59041293ce3b9db839281471cd3cb558cb816161e8da277529550e0f9a4e3e6df3c718dbbc49a1744396d0c422e2a817db8c84e2658a5d25e7cc56bfbc80fe2c9a1505d81dcaa56668842cc515e2b528f1e694da81bbbff90e67aa04208aa901be2d56db669c9ed561fa20818aabeeaded2293106dc60566bf208ca2256f802a6c2fb3259a824f7a5a80d5b926db38ced00764dec072cb9859c53b40cf3cd71a7b9a7bdee48c0762afff5faa42cc7327c4b2db26cb79ba259ea6eb077fdf6ec61533aae31eab2300a46e841b76527d407368048e3e9aaf138f5223e7e473f53fe4f51b9ac0b2a8dabab1d9f983537a118cd97817c82e99c9cc0e0341f850f67bdf739a5d00a6c01f698dd1859a7bee56e37e6ae2afb9034661bdf9c0c13af446d8dd6653de55ed1fa0eb17179fc0bf24c07908653369dc7175682d3fa5f7eb80edad18fa8d772be35419b84e83b1692d4615e8d8e1a1d716f5f7bba5c6afe2ba545b0832a2390b8609a534d13e906232b7a6a4752a6e4ef117df2703359ba4c3f65e3aeb943f176ef0c434c54eebc1315c0684723f2771711164b297c16cc7eaa38e666633a761c663ca3a1e408ef5e7c56121338f176099d670715130c7e2c280b209d115344bca9425f7f32fd044887fef11878a6e0b7ee24dea15d2bf9b10c8790a36481fd68fd835938baccb1103c4361485ea3ba8db4cd97e6174be2a175df19089769052b490ce14174602aeba6699c321219f75f61fa90f1703e11a7c7642d9003e8925dbd8c18e8f3c8c7f0a6c4fe80bff365a6c02537be250b0f7cbfb044042423ac5df4da50ec92469f0d03cd31cd6e913646ab9d8c0a918af82ef16aea893a8025740c2d42fbdcf002a7d9783636c9925501b70fc74698419ba740619878251a988a0f56f4b1ac414af87e5f1cfaa66bc5c79f404547c4385667b87a975dfcb71aa3100ac69f37b53aab5a1f54d62752335d0572773696c0f046017728fca1b6b26cfd6001d9b122bdf1f0da351a62c1842b1161f74f13566333ae956fed19117e2193d2457f3f7eb54f714ac248779e6fae95c3792f8c98edbf4615d00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "5153", 1, -1706293433, 3925833126, "e3cdaa71f86c4fefa107a60d8f5e30f80095fe3774a9eaf16aa602ae8fd8f33e"],
+	["0400008085202f8901688b61f77163d121760ef9676a839d33b6a2f67ddb042460662b8f9fd1ef8179000000000265acffffffff01d6e1350100000000096300636363635263520000000040db550463be8303000000000168c2c7320d51aafae9f605ddfa6f333c8bf88b2d513074c9a7d4d16b86c7b783b12c5c1d6f55044a87e0c3943d2256980e48c07ac9e0fd9a3ff696aaa7367c207cb08fb1a431bc25962bb4dffaacf440d5eef6cd052d88f4721fe2f32452a5c6d2dd426c2e3e1bae57456cdcde750f6334d1b9d9a9368988f4a6c21e7aae964800598460f9664188a0aeab0b6a22ea779578038c3ff5216c29d584e28c07cf187dd17dcea7c0351f59281dde3c32d4c118451230a77ea021ba5e746788734294b9f3c8ac5f924541f4bed3ee977f5b1597684d4335e5ec87e8db70fb90107b2d9fe5dfe80ad4b768fb4ed265723952c528e9b48e6aef04c04b31dfb1f5df0764a62829f720b5e39dcad66229736f96810164c87d83536c1c6a0a79fde2481878c93118224a5944ff51573bc6066c9e8d95e7cb1b1b6be19f1521fdf1daff5d339fbc7dcbdac836f89665470699037d0400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001dae333a2afb614fb656193d6030f1addc646b564ecc31f06ed72a232701db8396414b9451d81eb9ee856b3ba3f387b0fadee9a83946bdf27c99eaefec0232e6bbc38b01e84fd23509a52a910ca4d7d60619c5a1da548bfe5d7925c7932627eb70412fe20a1387fa985b66de0e94bf4e7ab0c71007dd35a9f525e7247f2e7abd60bcb3952aa899eea0343c5d1cc4dc4a9060a6fe2d57bbc2d8e64abc8eab401de64227d92e47b461caf686dd1be48492b8963a12883600fe40e235e8ab18f4f3586503b33d00b07f473354df98b6792e069d9a3d068e6e1c9b42cc5ccffb16fb6f69c2f7079fa2a5fcfe064d87cc7d4fc46ab4e622da2992f7197076b937a7a296a1e54b1785bf365cdbb22c0916cc606b310d8eb3045dc1d901fbf7ecbc04fe309f75611a8c258c4a0b3794d148a29bb5037bd6b10a694492aca2a68d0c14579a1fba36ba900edb59297915faba0a259733ead09acd6009efaf6c65ee2f96e0e4137d955f3329c908b4344565d8ce3fbc8aec681a95a6e3f577aae7b10986548d73561754ed0dda6265eec2b12968debb15a5fa5b7ad631e1c9bc2b8d51a594be85a8992ead09b7c00dff694bcd63dd61d42c9ce86bb21453fb957d1a7b82a9f7ceff5242879875380de6ebb1004656f8a8f617ece75437f26b8abfc4576f78930f52e4a82ad56076f612c51aa2f3fe68aec2d8eaf47c3bdef28a18c043a684a51940af28d03e9ad22dd7c82f30d585353b49e80cb478d9e545fc75a6b25979de110a85214de880e2405835dd79bd38a29f1ad6f3d7ec0914596fdcdbc8de8ff5fdd6fbdafc527ea6e9a7772fcc22e06e961ed39fda6c78114a30c6007e5840f7b81d5f67dfeaba03f97ed530034ccb32df0fa07e5bdd5fb6c52269dd620d3159e59bddf1122c067416f6d607b17d62b2d657d3e4c0a66dc08daf82db3852ae31543145e528eb6a6db508cc1c0b632d1d7668a4d8a7bb8d9ae8fec99eac839da6bfbcf708ee2734826f3a0ebbbab1189e8d7c3487a21bd1da3b98d7a02b1d9e78037cecb11adf720b4457ce68b0cb664caa0e822f91118179a942aac76fa2f34287ae47b7119307af8dc28506e7999949d37ce792ecdff1623b67dc549a4038cc66e21df9afd2f16734c29de4fb24dc0ffaf2ead75296bdd499d35060df9ede2d6e5532a7a1b053bc6609eaba6fd1777d83e56e373ac3ef24ab09b084bac6fd4f0d72bb02f33df7408847b8430f957629c942405316935b42d1099dca6c8d0451672b7c2deeccbec36fe7e27e6dfa318d640843fc8f5fa0da9d0d39ca4b944b56daa2ae0251df0a3a6cfc6d07ba8ded8fa1e19e60000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "ac", 0, -1520760546, 733220448, "de327aa76eac22384cd6795a982590bd590f71c66cd49d987870cc6184bc32af"],
+	["4b48aa7601c65c48ab23942c5b0e8dd4a94f28c0b0c667d79c92c9cba62cda0498a88dc60e000000000365656a21f8ec2d049d05b3030000000008636aac635353636a3a913804000000000763ac5165ac63acc51bdc000000000008535152515353536a90ae4a000000000005ac005151ac0000000000", "5353", 0, 1710529377, 4179206552, "6f61e9775c75b444c3eb811ce33fdc928bea7f2415cd250ebc8d00b4f94033d1"],
+	["0400008085202f89040c4a47d42c47b7be656c8be2789147d94e9907a1b53a5a1eb287abc1233e9cbb03000000056a00636563ffffffffe587c2dfc77deaf18c8c52fdb4cd8ff124e0b662cf5c76861368f853b844031d020000000252acffffffff6b1184358f2e6df859e98bee5df48bc2d362e1e896b2fd1e2d110186deee4862030000000763ac635351acacc8c2852019df8650be2e1c293eea6cad7efa51fe2e1d03f328a9a24d4afbac912ebcd246030000000044c265e402af81f6020000000006535365ac6a539a7a49000000000007516300ac535265000000008be1cd0faa0ae0050000000003cc697cfbebda771bad873c8b7c32b07a0fc78865253762de1d004efae1b6099a8f8f0e40f8b929c265c9676e676821bcc8c48d938d80b0b7c613ed9f5a05b4404e6f2b16701bd98736f0c7d53ceed683b5872d8ded6cfb1ecfd9ab7cf771894f5bf87a5ae06af06f4425ebf1c56707eb6a41904257882fa52ffc5b5cc17a126ffe0c653efe00b18da426279870bec22d6f059faf78662cc35d39e91dc5f7c1380e278fc84fa9b79b30201666d33857aba7d60e08f4989d3461b284494bcad02af8d480440ba48eff3806d02a6af50e7c6b1e79332b8d0048d529334717ebd3c14a89a5f943f22457fcd9016c82fa8c5a6952e6f0c96710ff0be022c370f1cca4eb19c1e9d1b936011654b0b358f670daa193217535ad046c1a88dc2429aed6565ab8da0c47bd72dd76497ef0633ae396410eefe888e078de61dfb92dfffc0f88a142c54d7bcdab1f45bb255ee41556060000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001cf773d4f63ed77440e722cb8e8d7399e5c5ab93f258eb89c7d47591d6ad7ba9cc042a4ca225a514814035e67ef1d13037532f31553d7cff26dc490f356d0c47fb6d8d2ed66a9b897be6971146a7a676865e8c38115f796a8ae72377a6e75a8fc1efce4d0a0aac7aeed565021566502f1018dc0040b3f43c03aa2bd6377d44922016ec62e05347b17d7d73e0c403df4178cb64a504875987151f55b752c1bb48ead767584e9e9cfdd7a33ce0b448511338c79d037d3d70fbd54bd4886246d5aac2dbd9b0dd0354c4d6e93059bd2bdc7092ef2b9aa28194998741df327e1c236c03889f841ba16ff31ba49f0c2c11f897316c9ca3b8cbf0e7dbd49c06aff6612dd7f0fa110d0c9bc4f7379700261dc0ce97fd1dfb1e7153de1114d4aaf2ac6dd530b4f90ee92da342d511b5f9f23f4806ce49cef76db3e99456e89940277d1d40a142c54d7bcdab1f45bb255ee415560600000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000029f4e7bb0270f7268d8d788ae0611f32809790b2a0e045ceb7af303252b0db50425a7d48c0bd0cc3eb8d2b885430fe64a350f708344d70a8d7107035e9b4b138eaf484001067c502c1c49ddf0db818feec4ad53abe12b56afa961b0e56918a782d31eb4bbdb3fb666df53d3ffe66e893f8d59926277a4d61b12d830f92c99f6b9f076da3e14d40cc2c6a7a23e83fd8248aa8a27773ad90722622ac8ee4fac9fb0f5a1f7179fbd14b2ad42432355a649261c9916bcc79daf9b16cc32e7b7cd27aaacc55e4329d06021d53108b2bc5f3da1170bc9957951ca88b15db167dc8ac74a9548bab4808d8414d1c9819c56883545e27b8b8feac7eaf5dd2ae7fcc1026e28fc5980ad9b4082291cb5cf5c2670bf4f1b9f6fa88768409acda3f2ecdc2bf453287c4b73553412f57d622d49f5db48791e683024137be6b977982b494a4434ea142c54d7bcdab1f45bb255ee4155606000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000020a6eb1e2fc784666122631eb1887308f646683a345f8fa1c974d90802233a00723ff352b77533794339794ed7973aba06ba4bfc126a898afd499243f5bfb0e5668df5f6802c4c928ea3597569cc903b236b014f67f6d5d073c534f384d7e8a1d150f0279e11ed31779d930a048142ac8e9dafb4ef9cd4843d18367406e6b2866e4b0ada676ff3f376dd582ad2ea9bde27c0400e9ef4df6b68435a17f240a4e44485c27460a1cc50104b87a62b7a32d4372c9361c94531641013f0745c2f731dcb8d8359347d17c9468219b98983617dfb428522c255052dc014926a9ab44a2ab537559c6cd89d5ca3e43fb4b0d7d4e98fafcf931410942c406d0e05a13e5138b329d286b3d42d6a65fa43b351d9dc08d6def31f393cc9333c23bce4438838da291576bfb6c1b4fcb93e327821e978ed96827e5ea781ac5647cd530263975c560b5bcf9423e2edcc0df1eef1c09503a85e1a6285abb5af3e8456e5e8c9c396436a331e30f778df4de67dd3dfc3bef326bf4025f3e1ece76196b8e69bf6b4e9e00dc0f3dce9ad19f4ebeb447a32e1b03d0af2227006d712d0ce0894028e9a0473c6d3dee73b046b346803d1473f350d42f69ee46be08f9caf445058d76042349dc30341ad13eac8299562a59b6d16f63a7a6fbf7bef3f50a806ffc81b3fdd6f6d4fab010023de954eac0dbecf05216cd35479e6286628eb8bc56388dc87babdc302c787dcafc12e7e3c0e5436db4da9654e8723468810c99b2db6f384630d06adf4757639c4a41e8a315e33940f1f328099e8aa0849245899e3370d99cae43ef2b7021a651e26232bd89ee5c56c8f29d6202c4ee701bf6f4af9e719e43c14e590922bc5b5ab1cc4824e5ad743269b3a04a684bea4e16bd85ccf4024b99fe15e4b13fa3de7368cf48f4b82b8a482a579f077d17b4b0bafeadec457e118151b31768b417b96e381a511ce8e58b5a70f7f1037a27f7363d0e2ca04a44c53165d09608b709153c08be3452a5d273c9ba21bda90247e5f553d81c1238d73b20d8b5a8c46aed3c1e297804020503310d2f379424e5ca6002e994e4b415949de3781970fd9bf0b29710ee4562087f03533370e592eb44ec6099c03989f55c0d34bff42c8461009a325b5ebcd30742ea0fd161071bbd96af9c46cf2989efc8a0a56258863c4fb872a35439385bed02883ab631a67e15924bae465e987ce911859ec6af3ecb19eaead403019c02959ece018e946a607d8e15548c070481046954baddd4473accf210a46080cb27b52bf98bde737c29387e833d1503a5765bb31b6e515ad8b87a619b2c9a6bab463e52f0fe16e06387907ccf1e01b31ca5bd9096a18afa3cbf4780d1c42bfcda63e2b0589b02ea24fa041ac1b703db0fca453731a02e88d84877b975474d620f3494a3ef29110f51440bfeaf4b96670afa2875750050b57ffc299f0afa1cb73992410bcb3315755d795ea7ea4ae535d77b48422779d3dcb7c7d50173f7ba8d223308fe4172aa6b67f834235a22db1350c73c3a44623a4565b631df92843c5a7b100afbcde37e8b5e74a19c7ec3fe8b213467e43653932a6a42f8a21a17d747f527a80692a40f07131b5b3b7a8f82c7c433803554b0889b5d974aea6f0f9eadecd7e74945ddc210a074549ba0f5cd39e531fa3793dc700d653f48eab7a79f0634bd4482a004c6b79ddfbd0a9c30aa75a682a2c843b37316febb0f7d360913d1a266aae6600c51aaaf5ca29ccb5060ebe0daf0a1165d7ed6dc37e68b06a525565684007c627be43d867a162f1cb290eb54b67bc2a691e15352fa7873becee58bffcfdb32468839aa5be240b2b2b006c502fde3ad8d4a49fab5664ca544f04c45d964b9ce2820185b8d5543bb113e49ca4dcdf59d00be3c799fedfda94bdd664cd9038d4be4728dbfa25bd0e08730c4f3671337a9637a3cb30472015f15f95f37b5952f330142d027d751249e8b2a10c3599682b22f01ef34545b1ba129e4a87f5b97e6425d75f53ac2d23e233a77c6c4d48ac9b04b791850f884c12ec1c29c9793fd761bfa1933fbe2f24b695cbae9ce9b3f5274e1396755dc162eb65c4d3c57de4c7b7cf517ef68389668efdfe07e8ff4c3ae9395aa38129809013429d0eac4c147551ae3283e8d83a070252002cc5a8291cb5616b84a032735184dcabe08268aa9761110f57285db60ead12aac2c68f2c3f30b496513da921c70fedf8aeced5b25e9420399e9e0216debca9afa70322fa88a4b50bae140a94acd320ffadf564a035e6d51142bbbc55f0bb8aeb46641bc536ec4defe1e8dfb6617ed730fcc3f3b91769c38d295ef329c34d24ff32ba64f3cec0667497d13c7a2b7a9dbeea46217c0389823a097d3f96944817c503738fceeb7b325f5ce70ab52002845dea09df4e3c2f6862053cda37049d0967bcde96d0642c38c6fb095dd15cce39d1b0cf8291fb32cff806897157fd67b10b2c3b959f485840e658144e66304ec827530cc9c2f69d50c4060d30f2cedfc27cb3dd50e3480bbccc9d97a3965c681030f20ee9000850db62ec03ecad3a3a6b3adad144efcd75e48ab02ee1f9f02d8d58f764d79901c2c2f6ee002a80362544e61c0f8c585a80f3ea9c05e9d456412c36805d45d871439d008a6762d9d694c631635b9bfeb3a8e53ae488b7e8aac7ac379f3692168038e589905000000000000000000000000e167777b77aca60cf9b3271d1d188df1146e3d52c42cb8dd32033ab1a6aaee188af81e5ce7977da0e7724dfe5e1b5f679410f14f123ee492b5dd4c8f4c18fbff3d4edc991ad1a58e7038c433f75d5b74992c54ec0eeb93865092d150a4c9307e00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000bac38deee336a592499d9c8bf3aa56f258b93457071cb3e186fd65eac1f1281279263a19080a444d4fad241d7045686b52ef5729d1d49283dc03d8304b6baf59ad2241159bffcf4a54a9615eaf656bf4783a19b648a6fdc4ecd696d17652d936d0b57c3ff9fff5891dd1cad76fdb085222710f56a1480ce9b5d5b029aa9149d0d78ac2d90694bff07185f181a8d8d81415e2ffd28a93ebb7469ffb2b79240fc8ee76dc0792dd6dcd3fe98d80ef5f7942219af3815c162a943f8276a9dfa3b24b9e26a05c55b860c577dc1996ecca1ecccffbf4b6ee5b98aa98c00e15001ab9c241686fb844fe3c6174c0fc48c85ddde4e4b55350eaee5600850c275177d4451b4f27fc5e69e4252ae135bd69d287523f215376c93b1ef0c0594c57fe31a9948661aaec1442f83741f2c50acc9e8826fb3b2a5db75750e5c93140e8c49be80d130827a8358135a752fdb0a53d61fc375dab86597253f8b2647582d9d9a8ab00610521d2cdd52ea761ebb931edf0943da5afcf4752ee47c4ee20de6b449e417f6435e91db850b67b96f819ce7cf2e982351a617a13477c15948008d7c1faa84c06c0b413800470d5b50fb6bc9d462041703cff91987f24181be12a6d07b34885bbbbc28127a5eb7319e9530d516d90db2f6106a2dc5b153e662c780b2894309d5425135ed4fc71b6929ae81c1330a8b51c72ee9d772b39dde678664b7cf216cdf7447a4cb5c7d69ce0719e712069552b04b1965478a6ca29768ccd1eb7ad8f52ccf237b5b0c4613a2c0548434f9b214602b44c91ccf263cdb280e21df1a26e2c7f6706330ccdde9911e31da79d160f44d9abbdec3f9290454046166f56c443fc1f59a580a6124e400ddb405dfb2a11f2b36b7d9cc2c151cc373e51f9e826de86a0bbab227f4c4d17084daa6ab5da8a0e6d854b03dc0dd4ed1e286884806ce0addae37c5fab0d1601c5f1ac0be25f71352d2bd58ddbf156d1622d0564d86c565fb340fa20d6045894aff1adb024b43c6462256f4380c31540bd47922e9fc11749f9569ded138bf7387690a771a6b4debffe88ff3819b8216dacd2e38354f4bf80a59625b0159e0fd9374d4fed0cffc34caf43c2b4475f32c1f2d612ac3428bca892ac5b0474525818f86107202e19cc7dd04d1ca098c70c94e983fb60d499abd624cae1a1fcdd0368301ad7687dc98ea2e0ec4df3dd4c8815bdccaf653a0780bdcadfcb8f35d8cad8c48332935247c8d1ddfd60eb138f1ca56822a34dd47b7cdfbf553c8516563953550e36faa93d6e25c5051ebb7d23c186a43b328c0a57ea47094d561b5f3fc5142b8800dc974369eae11bfab275b1d5ef020dea6e3776af4e7007653defb12626bcc5b709f4beca0975fc05bd74fbb442d2ccf78161b5c847e857193ea7f34d1699884493d78d9ace2e2eac984cf253bdea4e989a6990254761e8189149d1b0ff5de823c60c6faeb0d1379620de32ef484c96ff56a67ae91f8bd376da7daa1aec24b7d4bd2376d0b7ece393e47412b54f770858f837e53e11d1874878444a67e2f712415d6cfdb04acebc0560f6c9853cc49859a6ff2b08249e84513c87f5bedd075836a2e27189a1eb87253319835059b9fe6530a17599d2a8bcf320701d5d31f26465eb48941c85a6dd777458ed3fa1b45d073df6c517029f59477e2b560b760da436fad9dee48e914cc237090be70c16a669625c7818eab3a9b1ae6ad8ebc12d92be71df53e49307584957d0332766dec17c3d01759702876cf426e9c2efdd6bef2a82523f5f04b4e59900edebb6b20405de61fa4f319ba6224febae4cdb6b2869170fe201679fe40b213ecf82bcb6225e1b6120c0b9685095d624bc9815be5d8a3b7a1664b1f15093968547540de2a5c1562b524ee648ddd0ac318f8696384e708678eaa29ec53fe6e7d0fd6fc82ddd40a4689b68f70a84d25774073d9c84d72ca7d3d3c0ef490577488009805f07e278554aa2f456e5e5f6875691feb90674931532c114cddf5eae1697b7e5d5b0f7756558cd13362152cb350f516957800e1038a40b15829ad6347f1d54d70f07f32243c0f9a7e0192a9bde20bf24babd7d0178f402d66060e111db79f2db2af4e366d72787b08a88eb102808423935fdd8db9fe34c507329245d8d00000000000000005b06a30300000000e8b204edf13be0adf0f421ec2fedc5d9daaea0443eb73f37c390ea71c818e4864084661d3a54ade279c6bcec970fee37d6f5225424b6f74cdb2daa7a42b60f7f0fba6997c77edee1b9d7a1cb0ca0eca6d150b0d0f7fc41e67b4d6c43d1baa9f3000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004bf7fa2370a3b6f6541e4fc6f7fb5dada0337e10b21964eb3dcbc2b01111f4ec8bfd768640ced83a72909c216fb557c405158af25c5223c4250fa3e780f82521865f468dcb5b32b8025ba371e2c2128ab331defb09e499c7e1a5252a3e99f2f1c38b852d06f9a5f09d8d2368fb91c414255d89f348cae236c1c09e4f5aaaa6722919c0c3adf35e11c0e12c96c843804480ef6995f998d84e751fd19816b3a3b2b05f40bff5321f60fa19382b910b486f21322c7d6608d291238764d55560b9e21c90c214b92879f89c93a3a66e9e7d192fe60743065480c4d733288d02c495c19641a6044528bf93a7e825076f80fdf30e86c68a9596e0fdd5b44e3dae6c6df0f6d48c6d523b47362303a5c052725b12b0016b34f2be474bc9f733999de8425f5ef34678bcbdad2d5820a16a5e266b9811b7e9cede4865f3260fe7158b5cbcda2ce4538b98b7e69199bfb7e557408697362fc0e933047d765c5194c2b8e7cba9a055ee017d8d7ace616b71b3567d38d5fb9930bfbc7e465708b4b4eb605fd99473f66fb344db8c125d82ce99d113c88fae07bfdccffd75a206eb967a718a188ffefc363069aeb0e591c01e1d7d85fb6b0992ca7f987bf3dddd98335a7d72037ee85894651906b3710c6a155cfae71ffc0b271730a76c91cd75ac49756f8c71c7d84a916864a5bd14a28a1c9c142a3ff3017d4d17b6c91b6a3b628d69c33a84924d8608b7a19a31dda6a8440b4bcf86666939a532fa559bc7e9b3f740e1a2d0706b224a5703b833efa4a66d9ffddd0143ec2f519090081a2019e30d0a9c31ffab06ca367dbbb4a86e2596c9b8504e6ebd315dcdddc9872ec188030731ee4f46751d2fc05efe90d567698d4a98b19fba6e44efd3bc386a03d54f37fda4b027423c235a955ea72fabfe2ab89930bfa3f3e5e86e56232339d40096a4b36da2c4a83256027d9e7570962196311ba1800abb19e2778098b1bbad88f4917bbcedce31c9405f343b643a158a44190b37b55660a82913ab350d8204475b778028bac8426261755c4984503a3c180d57a6abc0c22c2b2acc53bb95a31835323cffe6f67adca41f62d3b0ff9d34b8c3364413bacb2b3d111aa00c01df5b677eabed17761aeacbda0df52165fba5276b5db062d4b765fbdf2316360253d5c16b761f31fa62edf6b6c9408599e7e2d2c872d9cdede6b5dbf71f6ecd3d9eedb6478053197ccae420b6f385845e8c3a9446adfa49b05270f7f384be9c1fdacda611f63b0b26e12059eb0241fe8434289f981dee18e1cb8eab6dd6aee871d106ba465daaa6e18a8f9de0d0dff2a66d99ddde1b7ed9ccdaa395b6303496c590ab182f8fa70eb70ae5a4b23619cb9b5341ba2ad42c2e9fa09cdde594105400117e0c1b6cf888ac5c15d0916b41088fa73b32316d5afee7fa2001b323e97c672e509d97f330b90705cde6de738e058062c95673229bcb746befc0c41caa428300c2e80f23703b364b275364b5eae8d99031a4b239c97a5c5b1dc072ca46762b9a11ebc7f3c37ed1c7686ec9f43dd383c9c739a0c8bf855b29082a18647185a35f1cefeb00910125706c37555b5d46fe64dce5515a182a6426cd79435315ffa51dd85f42d21c0bbb10086c3e728fa9d1a0e740305d0cdee39fb52f3f80448dc0294ff28e292032e451bef54ae91e869a55b8a48821db43d90031ecd07fafcc71663f142c0546cda169618db040553c6b7fbaa1e70e04f59e2d37a50482cccd693fa8f8d9772898c862126961f7de88a0951f1d52dcbbdd91b1bdb1c940c546950df270cc8c599facc55f5f85642bfbe7aa7b3a08d35c134567ea97efda104823d45163a5b9a5c89719c557d05c02c6719a05e025ca7c43b262478570d46bbf654cce3f783e3d0441ee8a8cf5cd1a6c49c47089e51caea6924857ed7862fd80f8b7375a3fa6696e6a924e4d98425b16430f3c5486442de9c93bf3961a3da460d62b205d69b0e9d631b8ad238b6967701eb3d83960fb3d4fc25d1d0f5b7984d43954f9132a50caada854ddb04a5c280e1b4b2115b9642c4261828fe7b1340325096a5193c88755f0ffca7652278ad34a672f8553d580c3e515bd30c4ccee7cc45241ac39cd4ba84dbcc209ff45a0874ab1421266aa11256d1591226fa00000000000000000ae807502000000000b097a8b3f20a8727548b4c78c069452895238f60540beaa7b0cadb4c19f9bdddbb6ad8390e28edd5142e85c4f030665902e37fcb9b64b21f2f8d83dae836c047ea58a138962c145b38e7d78cff6e858ba3e0da1a5328da5f8ab8b8d9216bc450000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000052a845e0e42c121b9ab8cb489acb09f57f792e2e6a8367800645d0b77f7acf2fee8b81947e3c07a4c6690ad7f226cb8f5d7b1aff5c4d4e6ee2605fad0e58ed4b9af376708bb5723a9d1310156682f7203b5aed378d17dbc476497f2f540c94d67cd41a09bc25ba3b93b8133378e885a399e25de314b404125a1ab8c8dea59357983c50701c4ccbb7ca41fd6751488e79bd18e87557f7f36d6ed5baad1f8814eb3c0b26af5a9f95ec9f0cdce9bd0747566b364c71259589d13dffd8329226a1a74d662488906996a2bc7852d895cd6847af493bd8afd6f747d53ef4cb96d792678f710fb471985176b7af736a838dae557b4a5cdbdb50e15eab01bc10b5c184aa0ece684358e0cf32229a9c8255a82bd41d58dab08cc2e19cf4ab14c7b013a5c4bdf2f5103db1fc08631208ced6d918f2225fc948d45fac1a1880f799783bf2c020c51bcb41e124f9d156d8d2552e1bc98784e15debd176fe415bf67b139d142ccaec7e4fa687d20070df6dab570f292d8300a3040771cd0d36d693f8e2239c4acdb408e21709b1110e52af92e4f8dea1710027e49185681bb6492d5c8dfdf035c613039c8d919ab46a9e5e626714d2d3a6b6f1aa628e02cca786ea4611e8be8e2c4102bd77bf765df08c8bca02aa121c08879c79353a2f4d03cccc79eb8c9593e42785147c2c0a190011d02e6626c730dcde68f3883bbce82197942b5ae5d2d1b617290afd5cee85aaeb31ed7ec958007f2c305b817e5fda8555fab7a7b60035b49d29d0a6e6e8dabf606117db52210391089d870c2a34c1e07316c68d7738cbe53d3cebdf58b0412e38e4f6fb7b1fa791041f4db4292eab9e4394191403c7e1b2072d7c09267fa9f167bf56ed3f8e6625a4b5b6b1e8eb31055c511faed494ce2688c93f7ddfa3f71e9371418377b0fb7842382879143c42955eebbdcca5ff30f9ea010e78a70384a225d922a5dd3547264b3b4b23d9696e17d8c9cb2596095288defc4493983167e745ff5135e69b7035343b3040bbeaceec3a59b01b2861ccb8b331921a2b2a21fd8227c3f10fbd74338e2fe8f59f27fa77414bd756e884b24ddcd4fa0418168243d5e55cbd1be7c370f7f74c4926f06d1cd1b92bc6afba6b2d10a824d9788faab55cbd3b55f378275e15ad045b873ae53c051c52dc53acc0cc3d633cd31d8e4643055852dfa11f974ebd053f13680890f9bd376e8e21e5fe6692347c8af2b4c6ed076c55d2f503f3863179493fc76f924455861c9f96e10dc06b4353e2adb4d0c7cdf4ae819dbd54ba9a395433577b644e1f6271554bf09f30035336584adb983b64ce82d751a4f0478179cd3895247df1b860e7870fd8a534c9a4c0066acc6037e90e7f8476f8aa294872a19a13b5e487d7a1e1492c133bc36baf21c98bd3451fcf5ec6389b1079c5706c4e6e21c90f27e103eca19ae641e4351af6e9b18dbc5542b85e99960f043a2914c6c362de9f643d66c374b4e56fcc7d09283916aa25a343e06220d30fe27b3309b9cf4b42c749d837a68f54ddde8c4157b8d5b9472e047f3c63f7a4e88af17f0d69c249a82002bdfe6ed9441d998c9ef1fb10de638babf2415faa12a85480862e896a73d2123978d66e80c4323325eb1cbf3988c5c38ad377a9a8a389b33c0de2f6fe149c1ffd076e22cf2ef2f7ede17af37508017cc9c231ba53423d0d6fc25c6774c49b8de078e98a5c6ab6eb5f9bb81223d54c623a381d1ff885553fb2f23826f9cb894cd6576f8620c9366ce81f31c5f0e913a5ec9a9336306ab0e02c42eaef6f59333e2c218a87a25372d5c15870454673604f9908865e45eadcbf09f9c595385146e061853ae1fa718ea9c9175622911ee425b6d157901c93d868721bf2961ecd0f164876550b5d0cf0e282550ab47c23a1b7bf4a495d7b4bb6180f3700fc0796e1e4d73390318dd010fff5f0279232b7f87c6061f5d522a83b86ddb344a2e77be2d68184b63e95e2fde51252ee0e90e08e62c549f6356cc8887fc78e862206672db2a10d587baa0aab5bc177f1ad11d0be4258568a2eff26582315d867611e57ff7a3c0b52d6a0c6fc8bf1f1261bfd79745805c29c11ba6b7c65b08a1d0c8113c6525a94ff430d1e3dffb5d0bdb68e3ce1067a11946d65a69478a8f25bda0f9e00a631eccc8d21fa2cef13782be278479096c9f48a04809f4b8a36d906176b09f31f62ca1d44f8033ac1b8cf8cade74373120e80403b860183c958d14b264a2afc8e44d6592ffd8b85eea1ab0624ae81a6c15226d838e3dabe6cc40e00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "53516a53526500", 2, -1757463026, 733220448, "22129c133ee914a82a8207a8d046593a31fcc9a14eefa65dab613fbfa630a88a"],
+	["9bf7b81b02c11634b128d9bce681440f4587b21c5cb0693d829e2c655ef455a03d82a21f31000000000551516a6a51ffffffffbdeca4a24ce9207e7cac6bf38831f4aef9487d994fd80372c6a7685efd319ea203000000085163ac00ac63ac00b9bdb4400221716504000000000553526a6551e0cd39000000000008530052516a516a51e510dde900", "00515365ac63", 0, -1858102918, 1537743641, "61718a4bbd09d0b885447eb92711e86c7b1fa10f751fd2dd3353d9bf7e97ae92"],
+	["ce367e5a0139d0673c0b1859e2347da80c09073b595bd64272deaea13ef09865df2a2aacf10100000001ac8de8b87e026be0db0100000000026aacb8f2dd0000000000003febc6b500", "51", 0, 923521042, 1991772603, "7c580663ac3ff2688e060d7a4b11fa7cfa6996e3cef7684b16955eaff543c5d4"],
+	["0400008085202f89015b21e7b491012ff9e7492982f5af241c14839cf4bc107744d52b614bf771e3da000000000763ac65656a00acb59271e00154d93d0300000000020000000000000cb72208052115020000000001d821294aa74822d0c01c08b9845183ea768e2ab60eeeb43887d0d08e1df4a79842bfcae977b343d8ece33c44cf90f15379d9afd4431a10f77fbfc11985ca516e440cdf53194e2f1beeb1c878fb6e63f6b5431dd9bf17650e29de835062eb594d14e33a37686ff6cffb182f6fc27d6a75572e5997077d4ea38c09b9021cf84ab4b52b123a18d521407c0db69195fa8aa1e162021b65884d08f0e853550b99074435ad47a5ac5c9c51f5de1f135a5696b47c81ce015f296db0a8525d0e71a29ae77d19a17fd06998b1e2b67949c52a3ea687256ca64a6f088551f153c992e768b6cbc8ef1a5c2f2b3e1f47caec18e2947181ce1ec30c712789c1c023eddca8db7aa2c53a9229e973f138ad5d583e5a5184dfd8dfb1e826c0dea837e5a82cac6422042297542a9d44e1541e2c95a46f07fad5742cbcf736206b7fbc33a49dfb450c0624ae81a6c15226d838e3dabe6cc40e00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001948ad60591199cc3c7419bf37385631ac2f4ec52f5b006ffe94d2ce4ca5de127d5a2ae8bf64316b1bba97ab339146f939f9baeea9f6e79d104b2393fbe00353978c2e5500b8dcbe4e152cfece445f256acf61b85ad0567bebe50c7225e978d962b072acd5be9e19aaf2befb6430e3e89879839f1dec3fe48b32145ccaaff2940a673aaf64267ec7be7831f45aa8e40e4f6dd916350cf6ff464e62819beef3f0aed1f5a068a71cb41dc5eddb858601a453c9c3d9be8b58db6c836c22e425cfaafd2fab836137a2959a1274fe7022369468442412c1a2c9602494f71523cd3afc36d337703f1a8e2d762b0aee2a3a58338f91aec8106648d12344ea7766312bd11b9bfc820a0f340278cda95806bd9262a461ec73f066424d075918a8a9210d70c23550aef2a90c9560baef5f38c3975820f4361905a49b5fb645d59975d108529d7652f15ee0bc32da5d5838df84fd453eb8db90ece2e81b18094674b5f04cef2fd513a8e2c798457e9f9dd728de749aafec564e9320592708ac75e2c0c0d893b6cedfd483802397252ae40c2f46d1e3521e31b293f60022dc8ff134aafe2e9a1e2f543a0f98a2f5e68c2a1f18f9ab57c53a1ba2101c742e6828f69908164135d55811ff8d0480e5d6ba07ce87c51dee66a50eca9db548a7c2c5908c55a845b3e2e96a90e83425b364abdd8d7175e0b96f9507bd667a203a1c75468c273640be651694bac902e20cb0368b6a09f670d7d47ba284f8cc501923d9fd8a9e9c8398d297fe45738139469e59a3a71ad9ff3e8631ff213f8fe58b1f33ee702f6dea96c6f646a68747fb3fcc2dd933bf0c09abd92c0f0559c8700e60a628d86c050736299e7aea4e2587998e86e204f8957e10b9365316bb2d12329f29335094ab7a13680f39bda91ba78352a5929f5b3dccafda25668056d26f9fa1992e9596a62d9e432e7c5eb1d17bece90ae9faf62ff8faec8c57405590daee5b1044a1fa0ac8357e1fbbfdfa339609402de70593f90b6da82b6722817c1be08809c785c061601197177324119364cc5f1f5092c58a8a3850de44f97b7e10bcf3165e7fa3250b2f3dc583ccf2d3bc9b742ffae9e17f8f097aaf3dca09e4c42fd1fb488a7d5c0f38cdd26cbbc19a5d53d4f4c445efdf9dd337d3f0edb3db44a3403bc3d232f6a23b80d11dc130715036f977bd875b94966b7e600c062dbd164785f3f54bef8acb1400c3e57ea5832f19830253dbd5b934c00e9bcb78735af86d12e8c4e3a0876a234dafd7516cd060b4d052fa5b5ea9251ab0c0a97e986df5e888cb914deed9a09c3ef0fc430b5e95d76db4a9e9d127ee02bc81baef10300000000000000003b560803000000002ebd7ce686fafa6bc31e161e5973deb6e6d6e3eec37cbbaf5453a6280b4ff47b0f68b0eadf546e650784ed9af0d33c8d0af09ab9be2a92f2c32402e6af0252eff0e80be07f7db0eb33812d9e542cd7d0ff64de8326b86f6242094c8dec8d2cd500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ec083f3bc2b45ad1d3d142ea411d007f126925c1abaf0050ca471f84806edce8b914d54859b262c3b9b664d725b51ab23706f34acdfed5c05d3e686e56696f35e97a8077513e1cb0ac9fb776e0f72df98e05c8b011f7e06ca6cb203bf54e1aefa5c8e9c49ca3dad1d666a9f9b9c490c892c4d3bc166857391bce61312706eb9d4881eb2efb6e9ec4dc52c3a8753625abbfe6c3b905df277f2517b0631838bfa619c0c5537a1bd4156cfbb3cb3cabc871d32c874cb58aa5a4c1276cbf5df73403b6efe3fb86dc4c46f51cd1c3ba4bd2943ce801407e1eddce92faf1c635c189764eda25419a2a7d28b684562435d672bc53681dd8ebec6b95157f1d9295b2df34ee5f6f6b7337ffc2c98d5f6530bc7c5bfe6790b29b3a6e46217ef3b509abe0915941eb1a428573c164c2416c1b6d11e684879fb04c9d45d1e8df2cdb4f7401c7a5df16a2c4a1491868f040a48190cb235fb78cd41d0eb7cbcb568bbed9b1643b13cf39e51581f9bbdc8bd6a9e70faada06d892baced54e07703ca99a7e1f1f6b7ad319170a27908041aeccf1536090e5b7a3d8f971120193968f5ef49aafe63fb204e6ec8037c39f13783a303e386c9bd9aca8de6b05b18da3d3f2914a28cac294dd0ab4971dadcb46d83aa66b0b8e7fd225ddb8634b332834ee2eef4387d7615cb7b638a9f1af721cdbc6ff9b8896d4ccd27b840166694fd7abb44e306a8b5598ff8b055ba0524018e63b70c28e0b89a37c3883a2175395159047f761cc23f0fb59aff779ca3ad53f84a00e9a89eea9099cfcda697373c5ce7fa497d80f686659ef9a4675b4861ff1ad23d60255863990e1dbd790583b6ea2fafb3e9d4e6c9afdbd943da881d6d82fcf3cd267e71c80df56d9c2b8994ff298e005ef69d4ad0fd5bab6f76e675944fa4fac3685bbb869b4e84091a4d2f53ede05aa897d5d6fabc0d83c9595c583f227c5dabc6ea569834df761d67b53aa9dbe4bbd28ac1302754b10e5ff7997a011a9fa89ef35e99eaacd0d51cdf14107a49b97651332baf73e92f08058d1892fd01270cf70b738b3f6784b6cb0eaa183f773b0312b6020cfa23abc0f500e55ab39f54dece1c488e6b0fb8b3bd3ee8876f8356a9b2ce6c501c15e999ae28a86c3f32e3e515e223a06adaa02f3ac3696856f1726480fca696ce19a0eeb25cb0b5feb0147e729086c1819c12b004969d00321cc910243610517c5e8d968001184daf953d987317b4c5dd6a3bcd939b53d2b463e1d363df91362d89b3eeee4ff772c23bbfe9ce7adb6be0cfb1e72d077126923e856dc22ac7583b1b04dbfa8d4d7b7fbadb63fdbe1ef28e4254c8ab68945113cdba801c715921a45958c9d0e03c08e1e785edd9348f0edef21b7981ca7e7db748f0f426e8112e7fc4b804470a81b94ad5bf524a8b155ced539e111e313ee0ba2d28008620fef8a0253fe99e3f57536c9bf74b27a92bb6a79082f375b57dc8d4cf0b48f70824669b98ad96ff48a173470a7413623c1cd1975835900c99003f2e67fe200404cd0f4d94352508cc2d5d5d433cb6417a22fbb0a48bb308801efa044e0fff42cc427cee196228ea441be36cb5388968af1290d2f4b33c1fedae19689311e983157c5c20f0fa8ee1d37db39c2c1315c67aee8bf5664c15b0e37190a5afbd5a5bed6b4d752b1dcea419800815b49708cb7dfb98b2c5483553acc15749f93d061c8d32b18e69419db97f4566d6c148c91fe0bc4e7d6f43406cadd3878ecc7b722b26b64439a900bf8cd39d0ca4668aa84e19c30fa078b2aff41c2d5b720a9d54caf5c37aeb0dea4c15aa5f0dc947776f2ac0fb17df5b88fbe339f9a19599b447a138aa0e34e5552ec608a21b11da1dbd6c424a45fbe7ef57c5dc2a60735d42f0b206505b9f5954e41c51a1dc2c20fbaf4e9990087dcb375c7ff9e27093d604b679d9d4ba053c9f9de12512334a895c0856bbeb94537363a244fefdb69cfe4e723380241088c2e6748b1c8c8c4648bfa43f9aed2ed900079d1cab68980387dcfe464006999ed9c5d390be7732f458529538e2e6847768683bc9394449eef45e9919c96ae5d873634d5bcf30b47311495e3fb82955967cf04e6d31c319c0514b52da5c8968c56a88b285826104d902108963587fcfc0f02f500000000000000008446c70000000000e730a4ac7710fc8688e000431e8742ec35fb4992132dae7532a6e6e3920cfbd5090e6151da27c25ebdf8c00a85935aa1b90487544d334e63207c3efc5fdaf845b2f425845c31fdd15c7c25626b6e05e5c162cf055dda709e927394ce1060a12100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ff591f28478e32748722d4e9f7eb5c6f0d76f9ae6ca0b7a32e3d4574c70096a9268128314d2cfa0d59cca49a0fa6b08445810328669b9bee12bce0693f4c10fd1cd70a39453c49f4d5a87f5b9b923ea657afa10ab36274733b5ce9ef3867b4deda45507db7f8f44b34d0e2d70305608f5000caab580d3077e85fded99cf530fe71dfef0059223e07e7963d73d7a169e9826c6ee585fdcab5524161d6bddec0ba1ab3814d98a81e1a7013752f311b73754ab66a40489d023082a83afdad500e95bfb6754d24c32570b5d1e4f2d6b3b7aeb5bbe9b33f464118acbfde7acf0ee5ab669bd0c0d3baf17dd176e9f36c7cbce09841fff927484cafe15a6f4dbd98e98054b2fd7ab8d17cc2d18d942840b9a1a26514f39f010e282b799eaa4006e4bee470b63d412a508606d555a621dafc7aad533c67ba71f21d05e655f3c8972f9aacbce4170eae7059d7acd22f6be0109aec5fdcf350beccc769629741886375aee0311f9a2bec7fe31bfb47b77d233aef02c87af3f211791f12a9a9dfbd241e46d2871692f98f4d70df2961ced606bddf854a9d8708ed090bdc448b67cfb5191001f73f08260a67a938be723b86842e967aed7be863055916afb777961fc72e58c4c95cc949414aba496d357bcb754c7753219e85b3bf79ebdc2a5c90365ef15eb59d98e89fdd5986d01434625c5070fa8bcd150ebf14931fd544cd53d4dbe73449bd7785cff98ae6796b00a28386bb57f9a431b91e99ca9721fcf25e7aae644151428dbc8aabdd6539095f053f16b20fbbb010f0a8f0f890f7cd6ef9e37c8ed571e397d4f1eab0b3ed7c0608dc0a9c356b48d01712fb13ecf5a0db983d937c554862d2e295acfdb1eaf60fba2402f509308c2389a1151b10c99f58f6840d2f0b7da6fc4d44bc1457ed6c8cfbbdefc051ba90bfaca9243fe70001db7215e4b5a112c2aacb194c6aa65a22559b04ee32b41068837e7e737ae78dde2176ca6c515c1dbbe87719d266f190431956a5674486bdba22461b493811c82b0ff7244eda1a17b5893513a7ac8577239b62a97ff36062b569a0ae64a449e8df0932a49fe734790a06910da76cda90165f6a82661b74b3037c529150f35545c0eda98b482b772144d9e82e7e33c8bb695969bd4d6d05521a9d74f2a91ff58ddd5156ca12ee9ea9e97872925e7e87975d1347d7feb58b3d64380aaf20913a129dc502cd7b43e52e366b131a52b79886f3017e40a157aade10593bb7d99ab61f841fd1877c1bb6b973628e2be96d4661892695f42ae0dc047e86d0cfc82120b0076b01556ca1e048039c6cbd53d17e78e11b06882f327c0095b16ad0d47a52bdcb8f9f640abd01c0ba17b197b44d8556ddcd039e536eea6c6c647e5b18ac813f8876759649c7776c55d7f6fb5efc67cfe197032579f618251225334efa8f625daf1a34e172c3132806b24393f04f2ba228c60d87f2cdc3f61ec9dde9303950959ee52aaefdbab3e8794ba6a16556ecb4629399346431f3c30401ec741b250295e44f6142e66c3a8eaaa9092f634f61f7692bd50b566c67c8afe3d59b06d217d00d006d99ea509f3faa905aa4d8a1b2a8c8e518f7ab6d6ee6ee8558f518e9fc39025cd53f17d4466aca9f27f6a60cf314bc4f56cd824c80b577206d03aa65bb5889c222c6114baa7cf4d0566e048ce75c3fcad6c59e430404d70efc4b4ae15587acc589a062f7fdea5c7047d8ed38925945521b7cda1ecb97e9a725c51ccf3fb44506ecf4c0c86984567db429b490d776eebf825a443ceb5a6ed435453ff47ff57d8de0483487b81c7a74ee4898c9acb7b9ff7056380dc20079e350b6d6618ae8f5ef7f67ef928ffc1707752c6704fd86f548eb8040c02a794a24ba69207eda9d38c89808089b4c86fb83c68b59f43f54992a9d3ee08d7e572dedf0786577fac125ba9dbf1e3c2a065b2bff36e58cf2f2d04ba0297b69ce26fd810f3ee4c3b181f5e8c77580678dfe332e35d742ffa3b0b2d48a7a5162695a261684c7b1a9736f4033aeeda1cb13b9374d17d1b355e6826c96420e63cc2dd6fe437066e76872d901cecba87875ee759e8175412ffa7ec29fb835965fb93cb55282ce755263475101e162dfc40f46de73744ee901f9bf141936baf5b9907207d9df00000000000000005c2f73000000000088cda772b365ce8b17cb1ff307d77c0811ee93dd3541b4cdad341c3dee569fcf1a61e00fd5c95a73f30b6ff262894138e7bed791900c25d6340b4e25e1314d82037b6850d336575d4fa97d7aa921c95126f89d3ec73f718ceeea03b5a930339e00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000affc254b90e64ad95caf0372ce501fa9ab75f268cc49d88293781520a03a44638bb01eea6365269932e84e7ae5cd5a4c7c4c0e49c2f044d34e02d818e3c29ccb03421288227408ce014cffed08822262f046bad401a452869c6a9dc1ebac998c87c261b9e8bb717e93f39a72fed97838d8fd0ddab7be5e91186fed595108bb29ef0db19ffb9ca5892d134d8c9fcacc65b2b7af16b7ab833900c360cf8a0512eb7ba5e7f5f0e970d560f1171430fb509ab51eb4b92e1a6a0ae98b13895fdb2e6198aa38caa5989d3a5c3160351747826b0bf1745d7226226b5303af2b416cb3472a898033737f51251b3a913e8e711207f99d5db254eff2890ef44f9f1c9a944d971bd017da51fba5aeee91d5be150559071b623ed3bbe2d8a6c4bb53a7309c640634339145b907768e2c19cb8c5b3861832dc1e69ad99a281daff1367ffd82277de9e1723ef2a398b8e8d59a97accbcd80aad920f64f9185f242512cb65435f222dc19d0c3520ee8ab10475ba3eb5970bff6e3de4dd872e3d45752bef728b626a9ac936c55fb898ca3cc3da2ec4e57711cd516566599a94ab132ec568e4abaa852f4c8b14ac91b77854348b01d38d6c8fa16ecd05dac8142815a5cddddd114a28e3ab2a27f3df8ac3798cd2d5969198e3bc5da4c46bfcd6147a1934a0fe95abc4816645117d8e168c5e93c8bb88fa9f459c58f90cb8f571f97bf41bea7e86e9872e35466a260baf20cd02de3a224c53f53eaeed4dd627533541ff0d76627e96e2b2110ae9f78205a32d41e6f4b6f7ef2cecadd1d9b1babe9ef6b69cd43bb9d4b7feaacb2f83520cbeaefa4f316584178c08a240a336415bcd6f3f9b6eb98c5ffc06f2b4e90a3998e9822091bae3abde9c1f56a03a436b0de120d6656aa0a6afd3743dc15bc88381b882eff0f5ea80c0f378ebdd66b1b7fb05ac0764daad97b908c87b7d2b2915a43a7c5e5e8ec1ceeef8fe6317e5066fc28613e49dacf1206ce65f48a7ce3b6645e8592118df534d85fdefde5bc84180b416a701a66c6284d022571895fee445591385065df2ca227dff6db8099ea91d06ba7f5adc481f0977cb1b0a95e85c572648910a197853e43fbce25a0379ceeeb6edfb686fb77e0a94b061a6862570a99b5ec3d064ca24251ec8c17e59de89e5a977ad4c9c44c210641f9b20e5ce87578b108f8511d435b3abf5844be3c8c5a19518b7fbce1c2d51dcb85fe4280f0d3663714c01992e8746153922f36c2e9c211d5bbe5019e122d675738bb94be79d9fc4659aaeff2544c72bea5462c1601bd8f912c2f9e13e04ddff736e316ba1cfc72de6b520a99d7fec11b4cb7ef5ce145b355c537cc09db199a37148b601fa15a31681c2b6df21276d069f2e68f4d83b66bdd27bb2ae821ddcdf6a3d23fcd93d3175520515962f9d80665a1eb782199dcaf62e9985d16330a6927b126a804bb497a6107d18e5899b19e23d6071a0dedaa15eabdcb97a17ae8785e449c08af8c34346e2fa72fefef1801cbe9e4edd90b54897793382eff95018ad5b3403d837c7facb118759454d6daf0e502549948c831e318c59b9ac52568b3c3608787dea9c1d6e6c75add7b4a732d236414e131cd41f7f7d6581a7b2559d0f99ba8f571d3fea5460ca4f7d6887b6cf9dd0705547aaae11a4fd7a4179cde3f6fbf1424084056801b5339628bcef679b598ad83d2e4d41bc0700e5432e20aece33be071cf5c744923f43ea8b48b88942174e1099c8b4bb4241890dfdd2b394a167a6ea7de212216723530a3a27430f26ac96860c026ef2d90d092a84e95b80fb375d3a7a55d24f7542385666c815223b31931e4d17de7472018ccc678c623ea03e73ea3e28a949444d59b93cbf7ba69262e5d799fd71a76a14e592739ad412d6d7c64e97aa6ed8fcb94795ebb79fd299f78ce946b84a2d47890ffccd5591104858a15b8a76d2bf2b651b921b5003cfa3e7c456351ec7969d5f88a329027baaf08d7f9f4cfe42b962b4fcdaaf67413d6846f073f46a1a448e7b4a0fde4e2a458e11f2df19ef8bd1fb548eae61dda6f1c2f28d1883ab3511876f3f521a46eeab1efcc68730d06003e30c3373354326128290b1c4900d695a897825398739f9809f33b28bbdab58bf030d740291b294f72fcae7d0b35dc8c095bafd918e97bcbe8e6d3e974860a5dce2dced45943a05146f5857d1fe35061a0824c7dbaef8255bc89a81dc24175c9c40bed3d694e2721778920c45e585e517a33faef138bba6cdf91c014b5973d91820388723458883037e82f0e00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "00656a", 0, -511427724, 4179206552, "6ededc5248b3eff9cee2fe2d36855308661f39e80fc67a6200470d5c0b72a4f5"],
+	["0400008085202f89016baa2b0f94d109241475c32b4bb3598c981dcc67dcc131f6e181ebbbb1f903380200000006516a006a00ac3307a88c0180f82105000000000952656551636aac5263666064e0000000000db0030200000000034d4e763f06e789b0be975c21e244630d9210d20f19d7c24411453184c301cd70c4e044760c9dc4d5e26fc711eb0dff4006833eb43a851599cdc4471e5d43122cccdfed3162df54deaa6a7c41fd5ddda445cd2b52e23168d2463a7ef5326a6c60a16d9d35570eb0b9afbead65f59bc471cb03cb62adbc25ed91fa14fa6b035c2d5b0826fd2dfb460e7a82d0d90a67309e01dff497858290c3e7079057d57f96bb07b3522095c5266d9ad6d5329fd3673332daa7479cdbd76a6fb8ff8d6ccf8d26a21a6688e5415e7b47beba6ad2c8eb1b619dc4952ac98d374fea320bc239932b72203de4e7664cb17a08aaab1f331f932b91a9af61aafd634e77e2d59b8030358085354ffeb98b9f06673326861da0af5eb354e9d65747f251010c3ff99f33c88637505f18d6177ede34c66bcbe815a9f1f44559d78b5f622523f2d310971508b5973d91820388723458883037e82f0e00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000041f4e7b90c087a1c544714320689fb37ba9169b575968929a95f5beff8d6b5ec1f27c74a5d1f4f41140bf420fafde6ceb28b08b67b62039cdc3610165778a2052a631e3d554f76507203579afd272b5c3e12f523a07db0947d35e3a454835c91f1864874d70fb0d216dec0f9ced216a1db729adc6dd9b72ef3842b639cf99c8a32db487547cec4ba2f93863c7cd9d1f9d8abfbed2572524a93b1dbd15be0883d39a4e02698ae536ae6813949606f5a7c0fd2f9285a6306338c4e614dca29929d38171cbe0da45365f3f0093dfbada8d89ed7ca9d19322c50dd5935a1d8bd4bf3f01d1c8b41485a75a979ef18413c597019c7c3cb339b1a98bca9fe796dcab51c43c159b01a0c8d89181bea700ac9748d812a0d48d6dfb3baa76ccb27bf7888d2502e924f9d81cd8d01cba7283130ad691e39e4ad700decee274b49bd14856189b5973d91820388723458883037e82f0e000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ae40524c225317e7466507c9688a3ab95c131dba2722a940b3bd76614a0e8dde1c564bf1907f4bbe139ffaf49818b844082d1a7e7075d63e7d35db212744c64c6127df195a13e6a1780e1ce0d0c6b69febe0eaba8a6028c382e26837ae9583b53c5eea949c33b49bda438b9cee9a9d31d8ed7e7ab94456ddc750d872f3f3a4f1e2d7c1e735191de51edc2c946b7c3a7d043b526a1e67301c2d24ee8d1b6831df4e7a87afd200003bce7ff3e636a21e0397239fa3e1f1da4d61c4f33382a9aaacb78cbf2457fcec3829502a34e13bac6d2b8d3e5b194e0bae1a894d50a2b6e64f44f525672f12ded228325bb4b2c87607deb39f73c3de1a74d0df9ba6a346baa340cf5e75d45af80686a39323abd5fac930069d40b2ae38326d54fc519b92f29c7953ec55810f18075bd967c8f382f7ab5d520205d5b45a3e9e019fd0e6eed451b5973d91820388723458883037e82f0e000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000031f3b44d16eebe38fcc8b68faa0dfd07d1b7b1be717ded935947294a0a7127193c513f26dd8ffc86018fb23e41e8e8dab035f7cc4ef58620dc6547064fd7e6f69ea5064d2000ca8241a9c571749d3c23b7e1d130bab9764a29d8a1c02e211890da29b21d1be8e02dac6c5e6bd7b243be44eeb75bd4f0496b3e7d9b11cd560cee25aecac0092cd8d213410f620f0840cdd74c81fa03494cc788b0e509d2d61f3cde0be059a7b85390ddee989b3db69adf50bff7b2231229516918f84d02a2f90ad7d61f8dbd49265d870483a44ed01a967978fd939914b3b8815b3414305c9bf864c13b9b7961124c4c8eb2dfa1929c4eba51c3df23bb6bf54ba6e2ba5933ee420f7260ff56b0886806445d2e0ba075cbc8aa0d8f1ee57196fe82363f25c1dd3078ed6f0c2f844246787ec40e235ddb80cc85d361cf95d0ce6e410472b451e5fde7c7ee7e1a6bbace3ad1a0202e446c76dc85d8d28146909b0e3a5ece1256d9668a98bba32f04c135c0c03093682996aef828acecb76d449855c897a8b80c2c62255b6e8c24139196e7653e28a18428069be5cea30509c242496d01a745779fd957529d7b0e6f863a20133874c1d2ed621ab7b8bc406e9770eaf0c75e4513e9aa1ac9e122ea85ac2c639017f3bad79c875fd85d77857e91d27ce28c96544e5c4baec6e171aa8f096829c336b66f6da69b431519ba0c60c8ad8072329e98403f410a21b1870d76f394e6527b7a3a29da8d5bc4ee17aaed620ac8ae9e04b57b4603f01cf8c5a041ca62353bb1be9971a92553983faaecd2ea39c0c24ba6bae176a6c028aef42b6f8daed4353bea81fce945186b05af5187e4d5ac361e4a3f74257aa4903d8dd3b591fc7c95e58de2d72e6b1c3a4c4c5fe566ca75724f6eed29d17b9ffec326cb90c12949fb405ba13fe260573b0d73eca6c1e318ce71be324e4d33d33b7fa813bb25bff6b34887e04fd3ce7b68447ac3bbc2b64031fc8bd07fd65d07eb6c64f99c4e15d7f9505500e1cb0377c82c27da1b78ef8100bd386638c1507c6755fcbf43c5c66696371b15ae4700ab7c4a8a77119674b32859812778308869d9b2e10a9e10bb0367d9a88c3894480caccb630a626b361be6e68306c9c77ae5226a5242e44d2f159deb5c535649f167ec70fa4d1bbf916feac1b497f3c10dd5cbf439f29343dbe84712b8f216a05b0dbc9dd2fe376f22bccebe2b625322d8866a5ce0158b61e6159d8167829a32425162ee0f3e0d82cd6e03b18055afa9170af148c978eadee2f16d8dda11ac5d2588e0c7c4433805e5121181133980216678615d16c5463ed6c5a4be88de5476998b9191612e670c3ca099706d8a33a81ea079e96f5402d51900f10987f0d236a6d96e3e96efb0a26322ef5d98cc7bd93b12e6ef0b7bf4aa5d2367a284ec305f2b5fbb35c1749972c01945d033b657d555fdc7319bab1c74e4b52cb81fe5d6629746b60d081a05176b7ed826a8734554a0a4dfc156618a35cecb811829e615631ae580dc42d1846530186fd4f7c83c8a2f0d6694c41d31511d773c755a969a55115546312a7e2361ff0fbea10f5eb0023761c9c33bfca05ccdef240cb265ed961e3e9fb0d774c4951b643221697bde58a2ea54f6e0326c919dffa585b87f4c9ac88d5ff6e4f9fbc9353f9c9961424ca10ab0104231cc4e97a5a36287f79fff06686bd5ba3e5d2e54610240f3f923cfc6c4e6536a426de7c9f5716a370d29e235df39c2e237065e0354052a8e04a76d71b1b7b20339ed42f3160a76b41c241dea8b20bd51763c20151004f99370d93999e3cb99ec9495a434bf18e585d430ddb04f7207fb9e518bd68a606f6cebc66eaeb41dbce9989d0a61fe17b5b30a96c87cb5247a480817b580606058406074c9cc8cafbc78ded72b31edfda9fce66d71b0ebaee01490f218dc158b326a42f84d81c7bf54b9ef6143bb005b288af8d1616cdf354592fbbc4eff21ea8089ca8db2999eaa3576dd1ee98fc81d2d9e3efdac726d36dba991ff0edff1538df3d3913e2aed6c93c1e5cc22c3d1a8ed7ae166b93dff10b2721a629ce1af2e3a242c4608831459753e6f205436804313d7f749c1961af694d778e38e134dd8dd7199db98f8f9aa70e5ab833f077b542c4f31d011ba7fd5c10e9511313e05be0eac60e20519a8f9639b2ef176b4a4b9583adf3716d663a6747e86ea01fa4e84872f229b8230368b982d281d1ef66b69487eaa80cc275c78d8778ba003e975d5c81fb559e72c1ea9d56cd2bb1408b36e9ef202a8c3bcc3d36219118e719fe203e55cef24978d88ae99b9b71473730aaad3b61e47a19d769ea8d5a4e407d8822039534c4bca7186a871bc685896c623602a4af5b3699d9a20007c78d0da42dc26db6f05e67eb85ea8c315871598cee243269ea6fa6517cef0b080d5a8674a9410d6c0a936f9d336e8447eaee5313508c8ae6ef207a17948107a88051b9496201b60b90d60dda1ec1b327ee7a5c10e9a1527e495630ccc119ee401be74d76a44648fe83bc605b887bcfbbf3cd70dbeb9a7da3e12d6e28c3f026bc434b6f49c8bd4cc608b77c456bed522d510fb0904a5bcd015634166749d8e6a12fb58bb57746d63316fcf15826d8a497fb42523a732a1392be9835428f8cf5e523ccd3cdb2bba241a49748ebdfff473ddf9ec4abf50775490d68cbfe008352ac97740b6a925d95813376802061e73600d6dd94559a87a8de75e95bb66b11a5cc83afbfe36a4b8fab5e2b803457c66c766e20fa20fa091dd614f9470b7026e0547741fe97c540a54f50a22f5e6aff87c72b24185121504a2b7ef5ac421dbdfdc1b2b5ccde26f88d534c5e4a064acc80f4366a4822689c1fb41608b88b70b454bc509a5707f40a8d92b67f5290c75f72af2c5489ca8148ead696a6076a568284558d52e9b9bcc6d8bdf35e3fb2337c8dbe99714e8245400638205f6219aad2c766a29a248419acd2be89fd99118668e31b4ce89568bfc56decce52a16370c5257f5bc602be7c108c3a47a508a957d90c338659d031cbbd8177cc18300a573f6b862c5c902f24921a99f3b7323a1be8d0d4a6877f6317301f50d73b48fab49f6a9dec16fc909e3548866405aae35ad63e4f1cd6812966c1b3d30d6c8cd8f19288376b0562a4de1f3331ed2654e0cdb6c082ca735484710e1606aea6a6e97023324c17e207e49adfe51ce15c1f3731d2b33fe815893ca821aa085739de1509332240c13dcd16e49bdc17a3b228107e6e91faeed88c5790c6a5e8d5eabc24bccb579d9fa20c32b1c1ef5777e4518c74b4cbb7cd23a1f0690268a84c3fe7526cb97280098ed6868df18393144ef336cac761dd4347f2001a3b0151f7dbef1b445d1843c5c99a55363b966305bd9a45c413d59986ed33d2f834da83c7256547fddfe75513306a1b226d2e3acb19f25dc57b1f7a12b94603820b9aac22233a6ed3301bbc865c2d6255bddfec9b9671304fce5c82395787cee7f82201b3c9272c19cca4714c8c3eafc4af26f5e96cbe3337246b4a5c196c2d1cb5e7022ec88b02c0dabeb1226b3719fe3b9e5882faa62eb75e6e9a61c4ccb4084ae7546c49dbbef898c418bb6b632dc3a94c5247248a4b05dbc45ce6b03c72239587e7bc1f7d43836c46a9beadcfefefa28ed7ef059d06832bfc0f5c229cb98d682c6f65642be04519bc81dca272039bad04a4620f72ddd893211d9f601673cad6bf336bc246e9f5f5d4b0ab248c5994087d22eb31e07ed0624e6ed0fc37df77f26fafff9e050e5cf981a7992a395dcf36eb3f2b9f2a577f22dde8ea0226b4b256a83ed42861fb971439ef5249f571cb4061041f0aa3a2d6f77ef22a199eb1dc3e4cc144c4ff91f9355ffaa20ca2541d9ff0ee35341e08e5782a7bdbac8d2a673e77767d1c62d8b194fb8fa382fe585030059439a37ccb7ad34240df7a672f2d3779b21577888f214654a813866593065807aa54494a8f3355e82b0dabd078e283163c166d7d6284e100aa64bc736d6f09c0775f7b0177287c01000000000000000000000000e7f6f4ff4d0a4bcad1cfbf5c4041b71e9ad781937d02608951c08abc9228848d2f9d4764622262eda1725c970c5d233bea42594517d8621fa0d81fc8de3d28f44cd32385719fc7f822e861a0ec70d1440425fe209919b1927b5e4f70527a0f9f000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009ae5364276f0bd6c6fb7458c1fb41c46d706142289bca92a56b628ce3f6f1bca81c257c0752827cff7c933e3bc037b129a2115fda2d3f8a0747dfd1f61af3c97d2c633ecef5954e57a87fc657e368e477963a9a937230dcc927cf8e58072688fc74dd4f32e1af5712de01b30800c31363f96b62236988bac6a68072619ffce365511609dbd06fd5e842a30de4287b171cf06efbd82cfcb69bfa6b347ac7c68d5c07c23bfa8b9fd10b649cb15844561b56695405f7112af37a2c03ff8d77287305cdbe7e4b5bb75ce08bb9abbcb9616c1d02d4531dac5bd1b02b084a380b56a015378c5fd8b0ad5544a6100f59906a47794b09870565644f57508389a4b141f4882fadd2a553a3914bc9675100981c332307b5ac2957245ea4366f7adadd28fd3a42f2ddf6dfea45e1599f74cb71af3ec38f1fdd3c25d8eb19db98115059728872503d0984ee6ba0a79c92623f0425e2b0e5c2826fff7bde6eefb7e16e34564475450ab5d554f2cc23f8bea7cab2b3c49f4c064f9cf7e079d0bb4ee97dec715616fc8e5dd3f839f01f7ee9fe79394f96f1109690efea3cbecba3e80d3bdf0a6fa83caf3bf2a0a8f2fb8e68af98e58091d799af65f29f2dda4de0b7361aa43e05a6883b3c6928f6179afc24d7813d9b7525faa0b993778f41e7601210037285c32482d8c4b0b2e92bdbf0ffceb3ef20c67ebb0b69f65c28cf88993facec381dd5a5fea66d2a9e3c16a0bf78641804b5939de60559c57a2ce7c03cbd445a39bbd429f5431041a732447e58a869ffe3a86386f84efbeacacee41ded3e498e3bf27b5eb63a8b9ed6e4d12d3d33ed40c8d8b6decb3c139a6238d2f44c28525599889d0f2f446d7e2067f9874d48d261a0b4c59541826caff6445f8471741bccf576fa91a1bdf28dc19298443883c8863fb02ec88a9a5b94d3a534ab123fdaf1aad20f08634eb70df4bfaadbf83ff31f21c8a4e525dd849b060722d868470522d968acf643a07cd80fa5e077186d987791a347babc359026a2bf203019b32e0b60a9c2638737b9c9f24550822854e333f34fada91752be3330f993ab749196d02cb9676be193c9027ab4c5fe9a9805c81cd6f4dd8005a684beeaa6f19d11ac6965c8d6434cfb357b94f3f449cd715d9e094dbb9627aa276e1b4d1cab2f3ccd4d49e923454cc703b7e6bf3e06e6f922b14562c4bfc09082e61c0662186e186f357f0e134ce8e8513fa3ac90d7cf67d315619092300a59de34155098a1956e0fdb61b47429f9b70f7c553f0c3aa9c2c81c126950547c346879608c973732e33bcf2d69b5325991f8b94f448f9393a424000fc29bb4544a475fdadceda1eaeeb40282b70682c01b5353244c39267f1b85b44d2a0955342adf6004cbcf700b297277ab645ec92ea785bb2388a0804d6a3d3b242b71ae6e1710cee581d854d252d144c3e9a10dc1cddd8d4df83a143e66eb75e85c481e0b86012ba55990bfe14bf3c6087e7a2d1d4e3d2e18fcc7ddadd6f980c7cc8b1653c7eed3ed7680c2b7edb1d1d95f9cc30d7ba617fe7c2e22287ceea3108755b9c336ddb471e9add5fa4ad8077c1aebd23b2ae24ff1afbaf143509c1aeb1bfb932bf29e070b56e751e80ba443c1b153068bc0de35ac3728ed71aaf6074c55dec4a4b63223beafe8677baab36a3c50a6ab418ea1c0f12e5fdf82276b1d3bd90e25d8f68bae23b63c6636973bd55c934d968314881cd8b2ebf8c56954d95eb25d23e4d045f94a1210984ef3ed20f82be764cd65f08c59175ec20c7be19fff783d28827b3e6b9a37c60a58b308f7a9d87ab4a001bbdbfc1d90e83bf1abf7aeccf2ccfc6c7f6157aa6dae0a7f0a798ddb9632f8599bf9617b0ded0df2b61d3801f5ea8570ae77e4f203a2029235eaec5dae1ee947a3d71feb71436b89268d5909ad118c2b7eac1681a068bbb11cfa3163ee8ea2149aa0247191e922fa45ae1eb80ca6334bf7249db2ad855eb03c21e55a86dcac29afa343c09dba7eaaa45f28aa04492f0757302b70bbb1cc113546e714c7646e2b1f4e4c3a7bf402f70b976c728f47d3eff5f914687e5d8320d2ac8343ea9b9b264e3ba22f081e5c8d44417de27cac89d640469306f35144a7fd10df739b83982353f653b3d7a731c7c47e276e9272ef636a400e3c1fb73f168751b99cb53d0a1d0e5d742486c72ebfbf0157c3fffabf9a08ff8d319aa045873f9a60cd18c7fe4b858692032e5e070d5549eee1a320f92c0e4d079df6e81437849f84dde8d662ae13d37795facbb56bef6199bd8a8750700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "006aac5363636a5253", 0, -1914373389, 4179206552, "5e677d3f25d46f633e49d85d3cd6d903a09680ce76104bd5a761fac8a3bc6c93"],
+	["7459dd0501da68e76f6d6453a216426eff4452b5beb6c37243550d09d5bcde4cb48025653a0300000004636a656a3a637b2004956e3901000000000100cf6bd40500000000000f1d4b02000000000365515320d5bc0400000000066a52536563630000000000", "53", 0, -1437875016, 1537743641, "11f637aa45a80ccac215f72d6bb3af9a83697b1645e08a9d613f3a7a1ab22bf4"],
+	["030000807082c40303666ba0748b799cdc3cd4801d6d8caf1f93002c6ec6a182d904490b0403836fde0100000009ac65ac53ac6a63ac00a2360490a000fc78b73330e050d7c1e171ecd72739336d455ea79db144680d334181d258010000000800526552516a526aea0a1df25fa825e78a46783b9906023fec49135c18bd05ce1c7e69dd07bfab1c23251cbe000000000263ac374add2e0356e9c30300000000001fe4c80200000000036aac00dfdea9010000000006acac51650063ae3b9bd7785bda1700", "516a63636a6a53ac63", 2, 202972811, 1991772603, "f8200f71320176fc158ca73ea520b2f0defcd022994b7ce421f49826688c90be"],
+	["f7e4f17402b22a21942dd2a1357c27d84d7613d99bf54f91e5c21c0de3c7dd521547a168560000000009ac65656aac525363004547d990791bffa0f6bb075470771dbddf7f49949a0b8795b1400af0480923ab173633b20200000006535352515100ffffffff01284ea304000000000800635163535352ac180bccff00", "00536563", 0, -470535674, 1991772603, "2f80743f03b0b39d3802c1b1fa12f0a2ef37f7773e4bd2d9e6aaa348e32658cb"],
+	["0400008085202f890453ad77b32ff83a10705717d3ac0479ee8b662bb3cf99946b456bbb566cd6d775030000000452635165ffffffff43a3a183add802b10fd2de25cd378a928c9f1102743b23b756caf6da2e2c7c1403000000035163acffffffffc9a4623ad702818732ab0265a116506efd4d03dc3e5e0d770fd615623856437801000000096a6a53535152656a00ffffffff75567e696ee4b6979e585a0e8f1b2dcae01b2d946aceffb070ad7de43d3fe670020000000652005253635148bbfb5002656f75030000000009635151006300acac5194d42200000000000100cd793cd0fc37a217e5ee98030000000004787e237383e4814282449afaea544fd8c098a0d1a250f5e46c938ecf9b88ed2567732bfa7049974b07b293a6b2e3f4a6eaaa3b5b41c1f2d6dea16162ecef184c438f9920da8cdac95e679b8b2fb60b1a16be46a22722d75c10825af20d7c52f9dfea4773f6c88041faec0668c6b5f17dcd6591111a68452cea6e2234c7da279c3500bbbb35af74a8079d92526dd1f18f4145032fae3cfde0209bba699d9c179edd8b44702cc0a77440f997333770bfa85ecd86d0d0a3bd812d4855f02ad14642e3e0da2dc3770788a6afd9c4795dec40c0f1c8332b4bf1d6875656993fa096bf4531a79eb706099dd4dd040a0bb0482a04675057be89e8d6da5f21639d28e459aba998864052a36f9229ee5023bcd06c0c57ee65960391063a009b4f1eee157547de89cddb0ff8634b01d48010c20e6fd0ad93a94e40dc815d578a9deb6480aae13d37795facbb56bef6199bd8a8750700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000011cbaa8a906ddf5ee820a72b27bb887277edbdec8206613e8f7ab8ca3793c4d71a754ca32b65dc1936a9e823875e406d105c06745e77f4b764ebc5587efe28287fccbc465719796587515178c7269e34ebbbd0847bfed2a6328161577fc5cc9caf5b3bc99a4797a3093b4b4678621861ae3fa0cb08a03bd2a1821bccbda064ae54d7dce08ea95baccef502f7c44cb5f020cd20836a8007468357e65934a67e50eb51e3f513e436623c9ebafffd8a2e4f6ed742a5bee2efa88451a8b2b33de45982b8fbba8bfae08cb98c570f0568fb5e95cc7b294f893d263834938296ef1967e781a9fc681c47526043fc98edf65583debeb2f8ebd9c8768f4cee7c477506a6b55b60d461df755e2976d7612fa3065bb9ffd5f6c2b6a193a823fd7e9bc69b4c83033e98958cc3e1420fd19e9510d7d49a0e3cdf92b91f9c0b2c6d49418370dee13d37795facbb56bef6199bd8a87507000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ee8a48fed1a04bfd60d8dc6546851eef93330abdf4e96a46f6c7ff0fa22db8e793d36e66b4ee1e8c15901e84cc5fa221ce6ac40438995002befb8b44edd6633ccd9b87afabaecbafa3e5e3308baad1ce39367cdb9d34b1e636b4f9ff858b66c984a99ac53da71e6f0136b5d4a0f75f73416aa7f7cf9f2f80f100d06aaf2d244dc4e3a23fb9af2852fd916b5a81e068cb70732bbbb37d0d00d38c261dd474c3a60327f185329ca12e82cb02fbfab0e5d5eea7682b9c0d341538eeccb0094af0bb40e640aaf96ee7ac75c30b4fb05c1f59fb2a55e855e209208880938eec3f3154122c0cd501e407d02f46d4e2b530fbb1dc08f2059e1192e20707c5ed98d4fa876016d3885e8bddb9cd6ba26df229dad77ac8ea9a555e5443062be13988001b37fcdc869685c569a005bba3f787115173f2098e2787a4c58cf20a8e0902c97faae13d37795facbb56bef6199bd8a875070000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001d00745dee300f8e1a361dca6df5c2aebe2d316352df3932887b16a29d2f6b166c3dabfecdb4124fb6b8a7075094297278bf738ea4912498cf8c2a8dd87b6c1eb910cf9be92c0109e67cf9bfb21985431738ad9628d3963fd050409303d2fe67f08aca092b9427cb1f1a0876a0512512943b3b52998d03634a91344b30060625ec351435cb755edb2632c2b0de61eda3dcda79f11bd9c84b9e34c5954c96440cae10906e1484dc3bccfe7e86e0a5232e286a0ac21e261890bfa9883efbfbef1db3d2b1f17a71a4a5cde323f1b5e821f5b22f3ef89c6fb53f538520014dfff5e8e55013e4a61083eda079b763a558e29d72cfae0b1b077562f118b8894d72ba1a9a6ee823428f7dab1cc0b46ff617eaa0d65025e597ea03b4c8a7ea5929f21073102a7f4c66b145284d5b2e0ef4e1f6b4884344c86286f71a9d3731b3a4a378f7e13d37795facbb56bef6199bd8a8750700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002ab52a57c8a7672342a2a489501708a5572dd39c48f2db7376dd7a78bbe8b3e1ee39db2662bbbc0a03ab218968c9ae43b14aa6ed4d6ffd9d27c8a85bb9d8b341cb64a9407eb8b8bf5a3e6ad6baba2d627964b237f51c341196f036d33ccbff2a1a97381a67f607cde6db6f9b09f21ed14e25e06c7634622ffd8c9c9c2baa6aec309b924ed1d7cb917798f53a842ec6082fcf352ff4c6e173b2bcac7fbc4e01be27ab75cf519f1200848d6b0587fd302ddac2923e6485437db1fdcf7b3fcf99699e796d1d50e789d6b804fd0893a4449e300cd59cd306f7d2192b10f814522dcb82f63e1d005c8450ab878bb3227ad11b882da06818d7513da6f3525a6ed61594e660780b70e56c8327a849e7af9b80ed83bd58d18107c290b4fd24b368edf9b81213dc375c20ad5244f606073631ce63b8c4458b1e3be4706bf2d07db915c7c436b22a47f6b549a884d9172264690cfd32e7d9e54c8f680e51e1df55107e77c601fe739f991d8f4daa0214ba0cac682f7b778f009a1991944ea1700b7749334fb305ea1c5fed0ffec90f43e50490c3791ede05840d932a0e83994f32617f84104a36c8311f5d3fb18c2c429b0b5ea764f94e70ac35c08d6fb1c5295dcbb2c43ec5b1e357f1e714f69ebcf9c77a3ab326a6a08eb3572f49956cf29464b050604e4033fd1ad722c0443efe158d89e2bdd1e072a85455428452d9cbb36183b81f5d1ff1bd95d40de61b898988d045cc7ffba19fb007856d590ca1b744869fe5f26a308ed669bb504957d08ca746c78a989ebc337a5147a7158a6d6acc0d8958194615143153c190354c39c5297e3db47b065a547af7c2cae9ffc3d920f30acfeba8d63bf2cb4fad4e44419a88800c749b79ab075c3a9789763bb00c7fe7f010d8941feb80b35ca37ee7215dd2bc8c47f285696e18d446598ac283340a729b0f6dc4a637d84dfd676c7d78273354cbea1ba5fbd2fc5d39d86fe54f57bc19309256a44aaf071756e912f4a0d9195475793a601cc67fb015c1f81279eef59d90ef7742b012e06c09531e5a2657d7efc3769111837b8ea32b70af1a7722fee3d44bb4cf67ea707c9b0c15959d5a052d8ffd7514e0ffb189cb8df81d15fd6ade893eb84368647d3517ff8fbc26dc968233c7aee62d08003c81412d9318279aeb417ae85a21935667eea125adb62fc76b23ccd59cba768b9083ea2c652a69d4d281a8732bc5f50eded07b5c1db36473431f90194eb88e7c192a7686efb44609a5fac2ca901264e9ad309edec61606e690ad4f279c94b372b527b66dbd11178f63494d1380418a7bf1f88a54be25aef7a9484c018d062fa591c9443505797d1f5e0434ff8499f29480efd88d3205e8630963bae2acc7783812d81b9cf4b5c838b28b02612fa60d25dd7b0651f0d8c69a415ec22de6375115e3ac3a9cb88b442ebc347d093fc286a3eeac616b43730b24ed3f61c26a16e7ff7f131242ed713a5dda404dca3c4f1421d355873d4499ea802c7ad177042686aa9194e1d5aad9dedfbb4731003f341e1280a84379dc1e784bd0da99d2f9d7e972c15b245f35d01fb779af65c6ae9c59cc7a0227ef1e67bce210b1ca3f12da87897e516c9276fba0002aec8c176132bc7533c82f1363d937f0dafa6181de098b80d7e3f116141e74b74d58a4fb58596ce8e6340193b49cf2b2fe19e7ea37490ff8c53c2fe4140148fdb830d9123617b585afb3804de843c60bc229af1d2a090c7a09083458ff28074abbddde435cba9c9174b7b822cc31a48f5e42d7d4569a4361aaa59074ff275d51eaf95f418f4233d7f531663581cd76258399bef7ef5d8752f566dab3c31d19ad675f287240e8cdeaf1a3dc245ed5d9308aeda6bd705f6eb7da90e86486bbbf9219771c54aa6a77dcd5b2fc174eb093517f985729fcfcc67c9a5330c13505279ada3c1a94de85fd12be6441c40c333de026ba5de35904eb789b428ff0b0d655a20e46f7647a7559651275144c6f79c6c0ccb985dd0eef07cb15eda4b16de30ff37e476562cbe94ac30620c7160e976b363305356478156b0afc11b459892ee1533533fdc1d9ca8603cf77aca19338cfa4048d4d740af32758c07ca693ed2a40686344bf583390c9f4b7f03d894002645e3a13417cd84dd2219529ab8091b9ea7d4f05635f451c269c275645a95e2903a67d3266f98138de8daa7aac1055ddbcb60c611d1ff9abb4fc94e3ef0a3b33ab107c051896d2adc4009dcd97f1a19f21ebc025d0620bb7e3fff07402a617a2296db27ecdc3fd302254e27d479a789de0af98843a26c645ed08e10df253d354e4b351c314f7f7e25c940d7e26970ce0fc8e510ef707986000b0910aee90ccdcdacb2d0d6e1aa692c7649bb2209eaaf813ebebc44eca79cfbaf2dbbc885355a9ca90d74f219ddd888067c0d3db8b3816df82d570472ad07388ac4f9e1068d5d72be4ef94af44431d7ccdbe3b374b0cd38ec654c6a8303c1676f2f7d3a0a609271f3f87be4339f34b697bc0ebddcf0988f8daf738affae85828391f85e59a4f6fa2640613f2a2d27277b32912098bba4a5ed26cac01f30378109f9fbe37281d7dd3c3b21dc94026fb949098c12cf5eccb570fb45e3c950adf14a3009b437c347599baa1456ecdfb496d40f3b89b9c6e6cb3e8e5434d12b3b6c0fa8aa563c5939020000000000000000d6652c020000000090c8b496d4c87363b6ed4b8dfab726d425d4744da5cc13d8301b0866ac8434bce0cd67086f7cc8efcd9b9fe3884cb00282e2c71bfa63acc586316553d26e1581fc2be8aa4c897ee078a98756ac9b5769fea56d167eddd5382d3cff1f5033424c0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000011fc972aedd487c2fd82676982a6fb2fa4630ad89aac8ad6d88ffd409102034f34baca53325b2a22742a97607ffe52cadb945358b0ad222f4f779e6c63224984c9922d982e1e888716f67bab963714ca9dc4d64de1635739917c150093dedd4797c2647368ad0c208866650604c5ff2365f4e5f0123f0634b3a811d9e90e2bc14733479f13fed50c140b8f6b144a2ef7474f7bf3cb25dd12e8c07a389a6145e34d54c656f18a5e2dfb355b9f6d870f60df1a0ea3fbb4a94d2c229136c783a49590e137c86494446f54c825516c1c321dc1d11cb8d7f9ffb157286e46422508ab63b29c8fdf2051e6bd86f6ef56f1a8440a7e351fee9842ff087f40faa5660da9ddc3e4b929aaba0b64c679ac18d7910d11f76a5a9518d57da1900f5e43e21ac138ad258819721a34df459ffb8182ab4550bfc59e2e895e212493a1505d0648be1db0c78057f4ebddfba3894e4b47e5ec2bd2e8981dce95b12ddfc5ccc5a8b10a46e5ecb965cfa6bd4917c3f4f522876d4b463912de85faf5d16058a4f1f9b902cfce47b8a006f6611379ae52828fc4f23f102a6b725fa76e920d355c0e1a614a54f2433cf16c68c0543076fb57622403f4252d319ca55fee6d5694fd89392c1e550ccff09362d99f1adf5fbb152c9e03786aa35f8d99ebca15202e42c2c03d084aba3c5c7ddcc670159ba03075d0f244f3718a4d3b6282c6c1f91359405e8a2ca0efb722bf9377395e4f447e8112692e35162c3fa2ea42b8e4d74b718c8a2f58876d62d248f4f9c34f87bf381968df2c9b6e790bc96d73112ec9f7ea1a3074cbde56ae009270b340fbdc67ed6b39a8315e81970bf429ce39fd38db603d2ae06ec46c85f4d9425e19c5850378077abc31847d26655add26209cd80aa539e14f38b59b92ba6279f912f462c6cf43e8c3c3cdbee74c0e58c433c51d8647b763e7add35e4c92dbc97c67e218d0252ce076a83d051f1f2897e5322b365b5976011d691b739be9601f3e258c4365a664cf7d59a21983f450569e8ab87fa441d27d41b97d6dfd69014539e7fe0c0555ff3753822932ddc286dfd5cc3be3ee1a3757b0f113193be14702615e4d8aa8d26bd7e9bc83ea4f0ebba61619961720a130dadde0f031d04ce8734065a6ca15d15b830e8cbdbda22c9db09d22188b59776a4eb1717e1b4d4c86b8574340235ba14a40f28e1f3ec7f91f12ebe9de13cf3745b16a1cf132ba13d08b8f990885d4622bd745c0acf96e5988abcb62e3676c3a70f0a225ff1b4a790cec651bb84dc1e2f8ce3361b0387d914b36a388613426edf6d280e67a625a098e84b05c2e37b6953ee79b7cc877146955d37a0fe1aa65f1e3fd778c54c36a9a9a52ecc9b205ddf7bb6de30f1a725cf92f2dbd7352ae1b93eb1a8e3c87d50860cda29c07a1fc0ea3d9fa5172506393a668c116af1edc7a5ea63d0708bde8e7c10291679612e1a8ae5df343d951b1e503802d6b37aa51629c013e6072cb5359881f5abe77561a03603e30a991b4e18c4c71bca93a4a845b77f7e6cce728f62195e586729afe13a01189600f599920a57b3bdbb7baf7e2a04a2ee39e036c459c5d8ea64517c72ed44811c655f6408b768152afcec0a48e8fe1943ddee9e95a83be1ef02e6dc2d97077afa2b44af35d768413b9599dd21ec27dbbd0d95a032fef512cbbca7a5e50c6a60f2154ff17a25085d3363abce55828607e84e1211bac77b14e48e79f4e823b5ba7f9ee109fa4b2870c4dde2b5e2225415d213bb4f05c3ce38ce944f793596b2abcd911c80fb837e5b0ff6b0d6a8e63a43cb53d8534f9cfb449b912011588c2fdf77f1e9ba0878f7c3e998fe52149973d12c2230c5d86406afed31594272d1496dc1fdd9f23d3685a25b388d833e55ac556049aacfa11ca9b96b1314405fe37c0cb4055401453496fff6dbb73f48ca96e0b6012a4088ddc777bdcca399bc80af3ecf1daec1c3ddb402050c92d542ca28e4b3db2df5094825414fbbd647e6659fe1b09ea468658e1c42f7e3d303956da8664016271c4d5ab9916b29f3d17fb928fbc047e7d9816cd8eb4676a5eca559a34093fd076e783fa522a8e32b18e8c2610bc7e1c46157373e96f142f25f8202e87a09e019419b2ea92e159db2358e264bd4b6f409bcae700000000000000008fff4e040000000038b04372bbe96a7e80c1b75d1e03c7d59b7a29cba7c331851d1bb6e9061c4fed0b668bafb64179bf5f0eed61c06cd86285fde6fdb29296ad22ab320fcdffb7b55b26a5cd3c76ba82087630deeb90eaf12acec81fa9b51d1064041dbf90a1d65300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000a35157d0a41259d2d5f5b12372ded33e81fc1beacb15b119e03e1e0a46977bcb18db09cb3974881eb2bb66a454038c96b5755e71bf3d576278830d9ce7089b5f039a262dff740ef31ae93faa2d848bd75260a6113846a063f90c700c47a12a6a94d2124091ae3c8d27cfc08d5afe28d3fa5825f8d2323f35cff5c25d33e968fcdde3916c56c52d7d2fb91fa27fdfef5c75897c5d05ea86a3aa420ae5c2a804753f9f4714d98003ec0a0b37d757ee7f1724e26849e73ee8f418bd376d5385d5ce7239610ce89fca8e192a440f242d45749ee6481efd1a68508712b2e8b3a97b8ed8267984d08de1f50842f2393825b48b5079c25f932b7c13299cce8fe89e19da8238b6fc846428c6475ebe27d725b13fa87a2115ed55b3cbab3f608653ae5b0582a0c8330976c497b7ca9d7341163af30b6c4490a0707dc942f0ca30f580470d82108d01158f6bd1a8cfea0e7a9739266cbd498e6f060a6428708094e5311850166f4f363f5901dc787e118a2fe54ce55e3c9cfe68d274f312d37b229db696a5de09996efacbc2b9febd3d9149e9ced6c57ca3adbeb0ecf9252474ec650ce016a082d2e8904d8535e817142e664ab408abad656f56d95740b9c311cf7fb1fdd5656dda2a86dc97d0944dbb1f6209ceafd23858b76809b05acb533fb3188492f65c492d0f681dd51f472cf7a6b62c163996860130ca41623aa9bf2ffae0f51d04fbcef7c9011e454e5bc455c5319936e6e021b2eeecca4cf71f623cfc87e7a087beeec6c3efc0ef5e5aeb116e56e0175f8e6418360a8f7383d5a7d2321d8401138880b543f4489085a2d294c548bd04a819eccb5c5d34d83aa29414cb67819fd933405d88f47f50b5f8f592039e4d9d874226a280e95f25b8252f9eb5054210c60b93f6061f0cc2eb4148040058619f29beb40d31c13e19487c26c49a5501f0aff4bd2a877cbde5dd3bc5a8054a2eac8d588a553ff900884d32587fbe8151dfae34217b7d340fcce41336b8ee11ccc732b63fe1edf65e24a62a45a3faf222d8effd8ec98f84e1bc08c401ef27482bbdb9f9afbc4d43397dd6cd705d0cc9147ff53103f2ab25087ea8ef091f9431a441f41af300d2d8756e3ebadb23f8f89761c930d8a852883793c3e7ad23499ef76f7d1029afc39c73446ab0e0462edb84df3b2838b35461fba033153ea22abb9a1b8e6c3dfede3717b0d266922703f8b0afd5cdceb6c829dc7694e0b0f24df0cdf6b07c829acb503e8adf58541dc895fce21ef97bcd8e057569af96c168663c2e1ab340026bacb47cf9d21466ac03b54c932a24e0778782549389e006cee2e335466286ee109d73e2aef2b836a484ac6877c5fe4f0e2795dead2d740b6c1d3e1dbe5059dbc52a94c9a81ee8c7584bbec5b32ce0841cb4af1ef177a379d5440297919bdea3d9af44f86a83d50283aa01faaff4db56a4e1c6aa441148a9a203661560ed74bbad745469fc50044abadd8c66da6e5b6774fba38978f1f9e6d7034c3d66a8ac77e53595d8320c550d9f1b20f1092edf1dcfca91760fbd0b036b846fa7e1153f2cc713a7ac18e15ea2be9803a1a4cad3846c88a2987531691091c04b86d7e8fe101d04431e0f75a4b338901e843458a03e0eb398a5ce5ac8ce4dd001f5dc54a75e7fe774d4c5d443ecbba17200050d3c1acd1997cc269de25547fb2433db083c6f3d7f430b03c91687fb775124331be5d98cb65f0359770b851131524984def836637104051e6ac5d45559b0605df49f6e2d96734ae91bb33e287218eb9992d988b348c27e874a0a7df445a903f8dea8e3b9feb9b1322ee56af56c9533c73e16572d2c20879b859a5c68cac684d4f90bc1c8f3b804a0f93c01dcb8029a0c2d9d69e912a4aa24c64a5f6c0fe1face4bc8e53e98d7dc3aa92d8ffb1e3ccf9e0ace9e2e554f8957dd1165cd2e26a5fbf5f09e87ea35a2e63fcafdb4bd113a91492447225bb773c1d4574332fea25d5635b510b7f2d336ea952c699f23f4bc0bf6db84985867771494f83b4e55129971ed4575390af56eb93cf01c2ef247184a4ea3ac507070ec35bcbc0463cef0e270fd3431f78fc8e4a87a9c3580a49127ad5bf0ea77181cbaf459d3b4f67abb8839c6076d799ffb61047fdb52e91fba9b0d8fcf722a0bf4aef97ae9fcb8239a7f003ed254406ab47836edf0501ea3849b55dbfbab9b63ba4ef5001f74023a4b8222af7949a174ef326b406725a7f62250884a449f2ee159757c3d32935fabb72d89393a85ed2a1f28a7f94871c8b6dd3c8e74400200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "656563", 0, 561001500, 1953719636, "92172e3f2941b2de668a937bbee432664cf7a03ebacac9b943311dc6ba4f882c"],
+	["0400008085202f89043d45b4277ffc7a4d09d2d32abbb63f04528b79b48aebe06d06f87089331d414c030000000100ffffffff44903767a0a38dce737479e7f99eacd27b4ff1889ce602ae6579df8f92384e5e02000000016ad8d5efb6559a57edd6e1ac58d698656f5479234e617c7dd4dcc1892c3202f74db413bab0000000000165ffffffff42f2a69814644fc7721be90b7b36e834dc19b881fa0352e1ac8f1fd65b0c9618010000000653516565526a9ff7a028028724eb000000000005636500516a4fabea0100000000036553000000000000000000de3b50050000000003ee9ab2b7184353abf5d41bd8d3670a57fad6d49f8712a8ec5e903b4762dcb342df89fceb9337fa768c2353941f5a94333c88ce1b5e4a146a2681ca0c4f19ea2d8c5c530bc03cbe44be44095c8ae34b30b27c54737f791f7d5ac138c34a341da30763ce2b88fcb4e8c27d61c8581be2849c4d87707f12f225b80fd2d7b95d722e048bd50a8e4009cdc522fa8d1073fd5120fdbe66c7db81af62ef164d3299420772db08762cd0c1a04f6d26eb49601188770707b551404f7af56697ce59d65631a16b11b8dcc8e911b136a239d08d0ab76ed403a88f087efd47fa4e11c6d8bd9ac0c340f7bc47b9c8d61da93f28289dec2d7351608f05e52ec18fc3a4e96262061dc368384899f27c47046681082c1b1f6d1c8fbc09ecf77bd4f4a714bcfd66381afe17d58972a6c8328ef855328f4b0fd1f11d86641f68ff4165d2f7a4a5c042ed2a1f28a7f94871c8b6dd3c8e744002000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000c98769d7738e4766d99b41e1c34ce239bec726d42258d404b8f5f9746a0e2b8a7680016faae166da826acf9668c72fd8617833a77a7261943a684db104cfed5fc1408c63bfa40f5d828fe15f7068be9ff9a8c282520094e632e2b24870bb7bd80fb6efd9bb116e7980849a17e406a0032d6231479fc99898a175938980d9b3d70068fe3f70be8639b4e41ea5961749075184b64987635f8a0ed106c03ace619c922378ec51f2c0cd2f37278b63892dd26d7af3270a1fbeb780499fc1c925fd865ae494d18824728607156cf48eb69a82593871dfc3756f8f3087db33857d90efd194eae061b30483c1b0c253e94a364d9e59d9467ffea93014663220f8c30c2c446d87b563de6eed46275a3cdf995fafde0c794703f487f2029809c5965d18726a3ecb06c549a0b0b16989bd034badea20bc77ac618c1680f927a3ffbc7f9159ed2a1f28a7f94871c8b6dd3c8e7440020000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000007b1c55178852bf01607a4d93d242af0946326a974177422e8beeab4d1145b43a46a2e721c8cac8a576ac0c66b0cadfb9a5e271743537aa5197ef33683ca2404f0c639c52c7b4ec4102c26cc317e476540a909678444f30198aaa0cda9924f53f0941e5d8830018a865edc076b3e38b1a353d8d20b6892046989e8b88091899a43a9f2cc247aac3931d1c268e69fa3d28f8893fa8dacb3fec28e707accd2c525127f4166c3cbf812f32eee4592955c863786d112bbfa92b9acca91cd4f2e13a342d3d13d12d54879f5703a1b95d76f5249724ddf208ab7a51af0e125ce843b49d9c2c4c9a1287cc61ef8b909940550ac86825fc854b10cfeae88026d9e02062642022dfaaff21d5c26daf266657b9ed91db3273f82f2fce95f9da5f21fac35117ce431fc7bd68a28c45439881478307f64678e61354ea7701678fea4e18373faded2a1f28a7f94871c8b6dd3c8e744002000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000019b237dd794c346c1c280e13262128bdf8b8aef4af50bf7ebc973455ea81a426711eb6d39bb6ac411495332632d05bb76ce4c56f189934f0faba69b79cb09c5212221dfcde6305b3a081966607d5e964070e5da5e9e5205c51985dfbaebdc3ff3f8f0ce396d979399ac6b49cfa569676b594f7525be45d2cb1b9134e903b49d9c9eac41bcc3bb2a4c5e49c58e45263ba9b3e8cf264f8c12a230a06dcecf497aeffcd9144a7072e72b1e0a6731e4b08d0ed27b652ec78645650521dfddb5157b82fd90e5e33fd7645f94f07b50d5a8b0285cae7a5ad065b62b42ef633c0d409563f0df980afd6372d25d09d3582955a359a0892f82af8c0d3056ded8b3b9632f5cf677772cb8ea08d8f906c2fcab8727a9ac3ca33895f8d4c2d76a144377176b5ea1a47d862d5b1cc4e0ba6082b7828734fefbcd9b4d0f4a25371f13970a94053b937ebd49679c5226451fc102b9448bbbc722ca76b68b827487f12b439ccf1d7631ca6f41d2ab9d572d8b2cf71bd378b6d4662a17e34e62e1db08b0f3c40ca23d9e29632fefa16c9df6c4777730b03fe09a2716fe12438ded9d376436790a2a062c313cdba901f2bdae0e4ce6c28611df2da655f0efd554468e275ce48f00c05fe8252836417039450dfc58533b4194d263fc85ef7bc40c9a570234ccae6f24793d03844b7052f55c01cf256a969b3415c5095c2f40defcbf1ec30d8632ad43e2931cbb6a5bfc904d5bf4b6389b7c408d73a7cdf4fc34bbdd5c557780581adc83e86616dc549ab920de5b3f56c270aee5cf494b79bf4b0bb22caf9418d996bbd75012f0d2b4693b9855df2fe4cf0e5b1fc76c91bbfd19a214ad7798920722a99990d1c508987b36df2fca9f4e26f9163ebd5133c838ceab932f88819fb44b09690a35fd84b80331940b7ccff6b124de715a13502ec16f441ce4b42820f9b60097cf60816d7d8be56214cc3568861a1f06322b1521037649fb89ef8fc94f07b839bfd37398f5d877e93a400c84398ff13eaf6e45432eb1827bea4a1ee002beb2b658ad77a8217931b97616ea31855c99b1f2c6cc93b761e629d2d1c6c0957a385ca4a26282a68e365c0c666b23a5ea35ca89b0024e7aaec5528907526a307082e253a195b58078f5fdc65c6bcab0162bf4b3a1ce5a906f2ea5897052f79f669831b8e0351f5656cbefce41fb05f7543a6651b05e493f2b7e50bd569db691b11d5d999dc82b6c51817148682140bce17ee8a93d4c045c7250ef1e8080cd358e8e5d43d85118476da3ad38afe368bfd0d94cac6c18144323191a488f1792d3e2348cf80b84d3a0736f718f8dd599385778aaa5e700430100000000000000005372de01000000003781658624aeb89e86cd57cad9a38a91325a681f30a8e1dc854b91dc182695088cd4f83956496556d4351b6a6305d72fd4a0098446cb27fd6c9078e73fe6cdb83a853ef9c395baec72db586693ec1664297241879faae9258a4ddec1fd3e67d0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004da8f710143a991d6bbde317e62c2f99f2cb155bd54d927fbc700af842739aa9ed77b0c9f7e352835b134d82f5d8cb4293547f4e611692fab892eb40ab70cd8707ce1c9bfbb41c28f9e1513ad258b1b8b2f7e89b0b269dbd08dd21da69504d555110be4f190410bb9c46c32a4280aa0ba94720cf7acdb54beca9e283a1851d28e9e66c2dba2682830cc8962ecbe863b2011fe68f9b35cad15aab69e8d9f3eefeeb29cff0c66a56589534d32c4cbb2863fdfdff3de3cdc7278306ebf2a503f867b7dab6803b24b6777fc4086db67b23708d3c9408fe6b59db090f5aabb3f5903781334c7acbbe519620462feb5a9807401eb107014327db4e5700c5449f4aaf57810dbbcf2df43042541702e1b3a9dc1d1e623c5f275ee05ec20708d7d550119192486ce5306f680af2b44c25a449a5612a2fe8ecb6898c46dbb1c9ba427bcb968e01a8fb644ba3832570d748bcf5ef74839d7b45fcf0ba86a540e6c566d3380e39fb305160978b2b1bb724e41afab347778306515453a6129fb92f120a14af1d561ae0440d519b2e9af01530fc7eeb61cca1a92ff0c8b07293f256a60c2d289249e8b6c01daae563950a1d5ca6bc7360c8f310d6255b840ec05df2a716dbdf7ba9c1da371d3ad94b44eb4115980950e742681c531e272bc3da20ea71d5db229deb6699eba17c0eb95c014bc6a3fb84c824e9c4052afe6b96402072a92eea4ac583f79ad7f870e1b834427fb863c3fa66ca72c6750efbe72caf34dd9dc66766fec2e8cea0de5adb731c9c0bfca74f150a43b193534ccd9dc9cd9cdb1ac586c18968af1bf37396c36bfa7fcfc93d367adda8333d39fb6670db723cf103f10829daff59dcf992ef86e78df02a8b62fc74bc73393a4a3156218811dd909fbc37de6b7cfd516ac5988d2f16daf4de13730afcaa1134a6be75ec5928599415f1a23c02eab69b1c7f04ab45bdd0d25e6083f388d5dfa47a86f68d5a0a9dd82b209d4d24d19c65b3072ee5a527c8c9c37b3e6a97e575462ab3b85637fbe88c89767ecf1a6fdaf95a12cf43d9416d4b34326640faf4a22a025100d35416a04aae73413e68b3086021486e1ef42101f42963d04caff9e5b3981e9123293b86edee381de841a1f8e0afd77bf2647ec697d9687e4b8b3fb8067cc8c2d8b3e0b2a94de080ae4537e3712a9385dbc39ce9abf8071473df651640238703b7117f201a51ccf7b76599d4f493c3b139dcd7d4fd1c900250db29f264269574e4d3040e2e6126dddeb2ce11bd5e6a2291fa7db005a9627e018eccf911b9815a95842fee7f28b82bb73aba01c7cab54dbb556b5566670548d96cd00d37f5849432e8ba701757dfc6ebe058537edf312641e4c09c278c2e0fc21f09000f0c3e27acf13c060be52b76760525d07b2b3d5aa47fe9a98b4f1c501e741c62278b353db94e41859c29647e0e74ff84c74ca41c1820fc631b6134ae779bb04dd5433ebd60a71ee3a2782d86ce8ab8472501cb67dabef16dd74d6754768497196550eeedf487e3209bc795c801e2230c5f1db7756c495c4062880fb6e5d5ba0081626e8ead716f9c7a55ed4f921bc01cce940596ad2c18e57ea37440e75648988a04f40ed448e1ba35c1c91377a9ecf074fb559841b2715fb64fc460426291658d4d3c09e511060ea508d3f639b7d399c8e4ea5d1a1444276301c5fcfc986044bce7c3296b7ca70a57ed97d8fa4cdc99994639a407b6b98bfebb8f25af0e2545cb5696911a75a287d5483f6b8b0557d07e7e57feba72738c44d6e6350bfb42e45cb2e7583da45c365ad1af59e7e5807066dceff3d48e377e96c8b16d1cb37f68514541480d92f56d652b89bdb24bb4187d241595bbe01ba08a4ab561b8a207b4a3d7c3a4468ce3eba674c28ace5bd70d6c2740d6cd3dc2cf0308251c6a422dd20d62a323bbbb87689d670d850cf96cb174391b1885a890c48c6b3abbdb2290867c96b6235d1ce6deb750fce113425e34cf68d19f27497ac023d45fbe7216ba57ef33d0637ee5007ba10520a4078b060dafcf5c71e26ea40b7f1f71af74a957e3cc5fccb837aa9bc86fb79eb8cebe524bde30d04b58eb0d62304200f05d0a0a102bcf373e0eda6356e54a435e06d4d66cbf16aa82182b3daa1adce6c6f7bc851b602c0aa501c8f96c656810a87327ac54a051c1260f6cbe2419b5543b1cf6ab30bc0ab6998939926e93fe9cb86f3bd26400342b34e7a9429560d5c092f4b3d0c6df0303e5918ca794e6d3378f4bb403cc59d155fd937ac1f68af5ac2c3467f10100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "6a6500005363", 1, -854521478, 3925833126, "5d58e2c1cf5cfb567a8044889655a61195892d1f47380d113384ae94e87c1b55"],
+	["0400008085202f890179aa52ac471fcaaacab645b2c2826c919d66050dbbe915fcc7ed68e1d4362af9020000000753635353ac6a63ffffffff03a5d2fa020000000000c6650301000000000863636352536a0063ae1d960000000000085100005352636565736a61680000000084ee870200000000011acad59dd1c8858ceb1151be6377da3be2659e27a520e621d4a263e8d95d798fa9adcb4c4cc156010578c507ec5d41dd1937f7df968a5a33ab718bc310107b37653ee7749a0caa5cff715e9c0c055daf2dc7e00b2f27c376e675e65c1fbc5bb5b9a43bd30c57f097102c23046153ddfab241a2ee2b8cec17d0c88e6b14ed7da5a9f04f85aef4a22d81aa8e99aeaec2392637cea7adf9f30fe0b05e65f87cc904122ad6e85b5dc897f9a848b23a59a0e6bd4027eb27417b0604d239bc35811b3c91ad22d41059061052c53485f092fa6358e8371c908174d8af0e3a5ffb03d71973ed6a761e7169b29078fbc7307fa049a3aad56a6bdbc93ec3fc17eef760b6c8dfd1cfd125cd5c567bef039a6d5db54756a99e9b7b799ef817e008485d22dbb4c2cb15c9dbb0676ebf3619c8e0e7ba3b833dc37ad2917c7170d818d777df195e59d155fd937ac1f68af5ac2c3467f10100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004d1c9d5a02a343514a39d077a83c081926a214b6684adf8451bd24093eff944a2f6e6b7d355ae8afa2c41cbc6484b63441fea1d8dfd9da9d99f1dc27e55c731082f8dfa580625b2ea78f3a5f61a51656632220b535d6192ae7dfd848aa9c1d9185b1ac8adab2ea4b2952325f511e98980a87d0fc27cd7438d0dd482f23db8eb5f7556aefcf4081a66742ed7e5819df1c31622b7740b754ed5e3eaa2b61de8498555f7153d23c33285518e6171cd42301766aad6d19e02cfaeba5d613509cf2d6b90cd7e0014fd064bd556dce78d1c29cd5ce5f150d66af29de51b17373b06663c1209169cc4ec4ab7b87f967e3e4a83bd45c500d9c965937074f3f969606de79f6f7f95dd1744ce55869e1f839b0908956330ee6e622d527cffcc75175e70ea41c703de9e1ed9eda2b1d6c508868770f8dd62aa78860628540da9b609a197a4c5beb3c3225ab5ee7191f341952d8a95910a102dd74d31a4e5ec9a52edb2e2e619ff1e4dacef1f4388cf9ecc2707eef06731e7ba90bff6614655be5b55fa5ed242fb4a3338ee078df682fd7a4ebaf64a33df39689110f7827c0aa91281912ae1a3cb063f55bbc74d7fdeb4d6db2fb6a96b58325c26976ec09c4889f95c61c8054b5a86605ab028fcc59dc8a6126ecd56a382fb0bf510309151acf9a06525ca1e21dda8a71e95fd8d9087b03c8d53ca19a06620bcc5f85a4b60c67f388702eb07a28f7c350efbc35705587b84df939f567fbea78df7e6b09f695b0a4a95f27762fb983960fe500680f444d311ca853ec7e65a6f420525996a7004e511ce4a0ac47f3e4a9874fb095b0b0845bbe2d6cfbbba63a56830f013db6e5782023dd58efefc63f8f7d3efe1cd21d8c36b8d930463b07e14aae5bf4e96b38460ef71f367b7f66155c6a50e162c65667b50c11cb5460d36cb34f6358a9e9c83d8d921c4a98ab9f370fa922be1ecb4d7a0bd78fe59f0171ed1985cdbaccb51766de736662e9d5ab976cfd26f89502599842e875728bdc41676ff992e3c866b4732bdae28571d4f29c5013a46691815d82886de28666f41cc8aa6016c51c05619c24608ceb59f1ef69b3a2815aef48c1b888f34b7604a42c3dbc6f7658bd3603f9a35b455581d9481d4b6f77d083b6cef8ca574066c4ba914edd9f655dd449e78e3e5639fe36c82ac57e25fb6f9c2b444760e29f14e8e33eeade4627840b11a935f85cac1a6ea86ea339654ce32897a8c35e428d16c15e4b79074e7bb05c0abcee5d044b6647477bb9e1e97812ca3a3202e0991d78fc3ade6a03a007ff5cb2f0bb060b83c68f63290eb9a424a87e346a37ac9f652f0976b37a31ac97200e3d134c9d97b2882fdf120f0d52008574c90f45ad2d9d62d3bb807beed16ff2449afb45e99cd35b81e6f6776e9ad5f6b410ee5dac0924b5a846f6c470473638032365cf0315b60efeffdb324213b8333d24609c0bbd2cc8a98aaf6c8f18254c86d68cdd9eae13ad0e4e33a32c48a0e193f64287e9277afbccffcc31aaad2d7dcf093154cefcb1e91dafc818827ba025a42ed37d957f7ce6060a9b8ed5c0ca04169c7ddcc54db124bd8ea2a9f9c42e26cf04dd99a074665024a82794ba403fa4411a1cae6ec83aa461c6011abbb2f1fd07669f3bcdd8562b1310f6bdab42462e5d1419844c28254804f4d49514671eb8ac4ff17193b52239e0419d169b291179afb22b3e2bd8bf5ba95a48aa69af89ad792d3af30acd45a41bed9a4c9cfb7782adcbe25de0d1833d3b855421fb3569ab6885326c8214bdc08d39a30597a12c0209944b198a26640d8596e114788de02a396ce765f5a7b144110bf556c62b12ad7111c9c20363ab4333928240c4898b47da460da8a68ddedda4e306719cfbe2dbe97f92929ce26583962b23bab240c15080c705b5cc52949d180d876c825a9e30f33c2215af877e0ef5050d167a41fbbe474d550396cc1b9105bb5a08bab7e846fa02aabdb13c9476637be0e2bcf59eb0ff2259090123498a46db0631946af90efab06d6bc026848918cb0be8e366852c04dd8256b98444f93dfa99732810d88defdc57069ddac8e3531ac5f9be48a3257c9edba60f4672d73a47a8e6ddb9c1815efff037a9d57a94f4122a161d3e21649c5eadeece43337ad59716fb08b7f5301e1e228de6489cc5fa30cc2804a368b4c33096cdf7be1b485be109f7c57d8e2cbf58f8438280952e6d32305b8d0ccb799095bf73ca2c95c1b9ad4f88a3da1b6510aedd73cfed6d2ac08fb267a0f2321fd83f07ac93af2d1f25980f398389a182658e83983da65df1eb30ecd220d17d15a448caaf134d1541f4e67f43709bc482bdf99a362659183e2a3e8b75390659bb4e6e871cf11c3bd6daa620b8ff364d53c31dc3ed8b3217df3e8139e55f4aa26419a345f86c1c6fad9b3ca38f781659d2ff248f1408d50394da0303cf23730a71155fab40b6ea738f64f0bc089fd0590ac2e5a9658aeebc10d7acf6e67672d9bcb0881602b52c8c5a1b7950dbb7bf2604b019b1d8a2c2eabef5067aecdd4d5f3331a73413459be910bd25adfe765f3112fafe825b5c2312897852637558e1aa351115c9d8cd3235ee33a5084e2781f8e0b8fd8b85e7ad3fcfb4854facedab9ee0507de5cd593e43985bab3febbdfa33d91e8a935b9e8ea015b8a37cb74912cd81b2c588b7e31f448f8ebce4ee34d272da242caa7632906112753ff419244eb81f2fb9e389ceb59c00558250012d1b7eae839e045d40dc9f7ba611f8b1cf8b1a79c8332714fe19cf2c8a46e76726d2c2fb635a5760eba915ca37e9ac015b97484bd47d956a58d0efb5f5e6372370624d8826ed606bc14e7fd00017e3cc97555c0011b5d2704d40e9acab6ee3d35c54a874f7d6958eba4e351f28878b6f430320309b56ebabb5dd9a795c55eac75a5b52ab9aad4d1c61715ed32a7ff72f5e23d93da80101c723ca6ea55f5acdb573ffea3eaa658ccb60a16972b447b05de18cf765a3d086a94efb3547fb774275dcda72c2b4978044efa5ebc0bc909327a330d69734b222aadd41daaea27a262166a8dfa4fcdeb782d054517bba2dd7c857f637b5a2141752bc57ac3d7056f4d94db894d777550923e1847ab56547280089087304849cdc6600547d19c4780281e2a734db35e8d135acbc3305bd8b2085a558cf1b449a906eb0d8c0a1db5ca04e31abf44a31f0373b1ec04f09c8a76a254a51492b705a7b9fe73c1537b5d144969bd384bf10ce5d85265229d60868f06600ef0614fa082c5e6e0a2e57e49f09b673452d4cfd0d1f835196bc2ec8e6ac1748b64e3d67fd01d12cc5b1d99104c65db26d7f692caec444d6ec9255d63035c30696680fa9f311fd77b91f3df522a8b3320343ed4ee105800c3a4193378dbd34d27c0427ebd9072933d2c2702066a977710748566cf7255f696ac7cc64f550bc0a74cd491989f4c63136734825783b1e4b5073dd98138bc6a9070b13a14ac23082e9e028842bca29626e7f8b3b4e60ad5f595c1e177142f450c9c0cba279ec13cb31151468de072578bc1ccd13dbe0b2b0169d8836be77756ac1438d7f06c1d5ea54dc4acb0e11cd0d1d2556fda4703fb971ae4e177bd5bceaddba102abde879b26cbf76abd139885e7168ec9ec1590208669a1742a86341adc52ce77c1dfe28066770a08c26d7d69b827b099c58369e48c09e4d055b532f43814acfb40c75ac2e2cbb77d59dff4548ee8385bbe994546c88473c067f58303e4597cfeb4573c91b100782ea8d1e72d2dfb9c32c2b379a1a0ed6eaf6dcff085be10e396e4c4c505c00c27877fba92c445629b8be9dfba00bf6ca7f0b7aced8fc07a608bfce6c0d7d0883d073bdac703ae3e5f640d106e9930fb6b54e0660125c7e10c2359c445656dc03b1acef91838c03f9db5cb48e579afb03b5e98015c06a81ad91e34cf4a4ac227c1adf1b9581bd6916e539cd84251dcc25eb1bbe7be5281fc52e554df17e1b3e9c105469a79b7185421a3add856f671adf0bac23e11e7caf17e977671df484c3e7521583d3d1aeb04dfe58c67043b1425a94a83e130d8ee430d774b9a385f1b3fd41424178c8697a05ec5d99299a0d68fad1fe4fea6a15420c3fea43f74cb9ee39421874a40a1c1168065e26bc67ec7d9e753820c92ac6db7a9231db4ff252bd9c669e72be391ece041971beb9a3f12e2f784cc809e23606fae57ea660deaa7829dff3ba56b946311f0bf73272890464b4897fcb4f73eae76b95b1b55e08e944fc3a4fa2c4234bf05d444a460756585c084ce3a25f781bb5e98890ef91117466c8e6f845c395ea6009064046d649cc98252a854df1d7515b56d2cc8aafc20fee5c202c1db53513ff25bff51fc0afbf127c0776935ccdb498ed17fc99e0d78b3439bc9dd453709ce7f0e9fd7811c40ca9d9e906f28f6d22ce6a55a95a0c7596bfdc717ebb454e29e0a553500775b9dbcd46951418049995920d3ac16bc761b63facf9437433b895df99fb74496dbf57cd9717353db76ab7d473409d5dda2ca3beddb7c99a72acb711cbd0d67cba22e1f53ca7fa024905d24e138a0556018472dca2d4c6d7d64476e3ee64559ea2bc606712e9d55ee700cb258ca4a5a7e50b38b6ccb19f069f2ee425853af558fd46f11df7ed125014d42a1c03de9a7aeeb63a172d1a02afb28439e2dbc750329bb65efae79f92d905eb4571fb9041b3a4e7202f694498f5d2b74db754a5ba764319ddf652349bdabffc7bece17028c1bf9551f6a864534ceaa957c4f637467c1f10b4f2e31ddf031e2c644d058937983fea6ecea28f9320bc49bef501b92b06811748e7e6df04ab4cd36424198f35d0f90588980d9d0dd8686e20635a569806ae683d85740f628b9f6cbd62fe39194655646133904ef37c8ff680ca9db8502e9be9f8f08f8a9460d22e1001a1835a560d7c7d4a0530787e308be0062aae53524d7c52de7738bd6737ecffe733845cfb47bb98b4b9fb81f3edb7e8e5e69b3bed11a0f5aa205b506e6f6d21dde8ae5c46a391a9502a7c7e3431e933df2f3795dd23b789e538304262ea1fd4eab0aaaf472c1cac8257bdbe84421a3883d949559d251a9d545139bd86584dc5b944eb5e4a4830c3656b89b78d73a846a5860eb9abdf9bb570fd837400b7b14d09af3a86e8a0326783137f45a2f2012713210f818052dd379aa253341c46b3ef7919cacd2422644674ee6f001f198150c74fe970da7a8dd827d6164926920d41f8fc8cfab0550fee561f31898f7ede0ac8c87284033af5a590d2daec64ab8f9e6a3116ee0c36722149e6987c8f304667c8dd9b6dfcd9b51986c4e7edd68ad9e1ac7c891862065e63c9e38e7b1b31837bdd65c3540850000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "636a5151ac526a52", 0, 1460321845, 3925833126, "86b92e2424063a7de5f4b43ec4fce8d01db48bd680ed18b22a5143a7edf7bf70"],
+	["030000807082c403045e142c763244cac101797372b08ba5f3dcb7c97ff46be6709348af9f4951848d02000000056a5252516a88857e1f0c622bd8452611b7b29202f789696ddb4555e46650daab56168d34e607e6cc7002000000016a1b51c8d27e7ad1638cb18f73f751197e591c57e2c1593221b1c94d07111fba33f807c6f203000000085365515351630051ffffffff535515b6a3d4b4d6e57114d0bc078d6a21060206b99f98922c6d8c1ddcc51e790000000002636affffffff01affa05050000000008636353ac6a5251ac19c2c907c78d9d1800", "00", 0, -313475452, 1953719636, "767d23ec8eabfa90c653d3cc98990f8f6c48c038819c901369b48d7c7440674d"],
+	["8dd00c20048930b05685f8faa10a2132e58cb9235d5afbf5f2f1a25e75ede59fe71d5cec090200000005ac52516a52ffffffff10c09cf5941402e5e0a56c739aca2a819c4901611acfd1cdbd1569d130eef169020000000951ac53ac6551526300fffffffff050a4997dadd678d89cd8074047a73d9e4b4991d0f3ba571c6d4208157e229603000000025153f90c6df9a1ab61bb66aaecc76c249f3eca20bf554fa542f25a62d3053dd5d8a3b6a6a2310200000007006500516aac51ffffffff0394e95605000000000753656a536a6a5230416104000000000800ac5153526a6352d5ed84040000000009526a516a63006a53ac4199baff00", "", 2, -1785775386, 4122551051, "d9893d10596667bb98cdeed5637f9ad3365dcf20e23b78812d944cea75d11eb6"],
+	["94aa77230106c5974174c48c3f6b6d0e88bb754bfa3a8c16e89bc542e768b892d188e1115c01000000086a6aac5353525363ffffffff0393f677010000000003516a6a5d9e0000000000000083407e050000000001ac0000000000", "63ac6a636a63006a", 0, 1308668016, 1991772603, "a62d96140f8d5fe236656a96916c848748d4e5e233f4d778c931be31c43e6707"],
+	["5bef4850043f6e52e60907ce0b77902d8096593685c3104f3b4a596f5ebdd926bb9cab09c5030000000900515253000000ac51ffffffff4131140b999aca42c84cabbf042e0419195e64d3761acb7cfdfb375cc97b914603000000056a5153ac63ffffffff61bc2e07cbd3674a464e7aa4079c245b086d838a51727c5ac46dcd59a0a8b4e2000000000765ac5252526563ad3982b8559502a4ee7c18576c27e8c3a6a67f63f3365d08e37da7da766400d3abfeff690300000000ffffffff01c69fe505000000000253530000000000", "63", 0, -1201626842, 3925833126, "27fe552aea30e6ef190002893f11b9c23454f386b520fccd13373d27727d284f"],
+	["0400008085202f89024485296310ef53f325a7a5f22e2cfa887019dbc11e5b78a131487c4a707405e002000000075351acac526500ffffffffdd12a72c406bc9739e9bc04a0a71c64d9933a4f94966d04799a0b19c87312f510000000008526500000063ac53ffffffff0114518b010000000002ac63000000009c135b05b35fb50500000000010c2b9c6af1bb6693feef7961e8def59542cec8af1b0bd84f5d52e669312438bdb2b611ea725cc504a42159859353c817bc7e48c67470693f7e26a2b356f0c059f5368f6e6d1dfc000fafc47b1cb5f763056f80dd19f9a72fbd601e7bb1ff339442896d198b3321ff8ad62c2a737d73280bf991509ddf579b45c5b4789edf8b9dbfb21da1af7709b383f426d2963631f4c07326a2670deed3e62e40435138637ab1b69d5619b7bb9a7afb41f891404aeec4205ca4d531d25cb3989e805ee518e86a8437e163a01d3f05f734401827b9ff16e8a21319c313357acf69d5039af3e137db293793dcaddb9c974f288214ba0fc110db2fc35f7190d59883fddbaf4738282073caa8c2f9b1fa3020dcdeb4fbf5d48ef42a48e211c3560a6e125fa115eb3539fe4845851b393f9d570c6902c993cf4de2d6e918ae7abe6dc1a30a9da8f4b103a385c5d376d0cd9c6e6140ca3d0100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004d1db90fc7f1586174142c4c0c5348aaf425da616e2ba897e041775dd4d856ae4814ec78655897dd2398ba108677dd76410ff6a6939d6e1ca638834775f911918eaa6f5d29e92eb2d2b93b9014691f563ec8143dd06bcf1a9195b95b6cf73b025ac661e6ca2035d7847ca13e3b79b5a0a5b5f4044b38e40d792dec822b1de760f4717fb02c0170b62ce085499bfff24df8ae195bd8cc662af5e8ebd0b396f743241915ac1e7eb16245409d8ec6d76b9e999272cc4bbb1c5c491d594164001ce2730c2db8356a4d39508bc1bd184158ad35ceb8a5ab04cccf87b5c64ade6f1eff1d4e821bba7042d35668e3873ae34fe523dd6cf3d957ec77fa8d6e9630b94f8accc67200ea2d92015ec15c5d46f700aa559998bae26e928821196241bc476cc8ac4d69ad3df62a811dcf4f768b3a10194cd48dec0f45796aa70e714cdc0f4a3fde0edbf4f7f27fbdd9915754425a475104711124c8bbc18a94df4f8074e8915b2183a6d4ab874d32b2dd145ff1026890b3d8e23b0b4c313e3e6df02957c92148108d9276cee181b884a7f625f6b95bf26c8a1379fad1e0b852603bcdfc3aa0483cdf55e44bf27d000b6fd1484310229547c4231e7010426942986aa75f980e2c7ba6f721cc461e01c3bc314ff161cfcb63fcec285ac5ff7d450ebb14924f460961a51d16f9616b52d59da450b7bac2408bc084ceb973a1cd31bd30bd8b3f729333170bf4818c5dc22ae8feda0f7f79c44a6cc725df5261a46c39b29b31eb29f72fc5cdf5b1262361b2be59405aaba36618078e7f09cd9809f0072f4d7c65125d78e5f87e64739ad399ad54dc4314889135baba2fa2e7c5ac89404e588f58c5f8eafccfb8327bde78280b19d68ddbd72ecce4e41728b74e93355e05379d267a4107a80aa79ba869a4881b1f6fea9fd4c4bd311b866830a8c79eaab625060986746e6ef761b232c0f050de441a945637827c5415408f61340f5e2ce067f06324b10afe0b031aab35144e62ffaa437947904c0bd2c44e40ca484eed6524ad0cdf0638c9d638540c88f43085931e8911522b825fcf8bd3abf989561ec6d627b3c2c2bd48882672be38510cd2f92db18d0c5ce87dc237c76d45ff3f8f2ff3e70cd24e84bc8317962edf7426edda983cd8e1a96f066bd5767bfb0a6ad1d6b2bccadca94b997fca00d13493fd5a102711457255b0cf5a91acadad33cad8e36c35e586cd4755e77c196a61bd2922e2baeff2d456b5e2481c75193069c102707044204356f18a45831d129b20e95e79e9da6eea2658b82eb97214f1411497099541654d6d106e7be406eb42814ff78dac79f3578f37c0665256a9298d35f647dca4151141c9980e753a54a09cddc5d22a26593727ffd3b52caf5cf0c7cf8c0471659f90f041c3df6abe0c096619aca7d740d908480755ba402ae595b015b95ef0b17bf23927bba3d30b34e4c17527d6137a2197105457bbcdcf2fb157007f0692b96d17c70652bf62ee837f8d3c60d6c6faff9b1a1cd6eb4fb782a4ffed894f80fe4baa8957a27b8441dd405bc4fb4a0e4344dd1ffb3caecc9dcd2dba8e91e4bb7f100f3a168980db32f9edb016b7aef1d10bbca0aedaa228cf0f1fed22328811c9e8be9b5c4f6f630f9c854c08e701781411a3b63109eeb9d72e621c3a6a9ec99fd008e30f182528f3c77558aafd6d66cf589ce1e9a3ef54305666ac5cc8ca678c33ca3ac504c15e9557be57c221accdf2eef1f3280dd08e791ad88efad2e289e2a898e28517f06897adc51c9d6ed05f93a417999f0bfad3d02ca2afb6ca052cff8c759d6cd8c1c3a0a6b8d96f4bb3fde7ae71b6244e5f42b4a4dbd6670b6390db49bc99202ee574732077b86cf10f564bff15731ebace0374d7bc4b0b51689131b98ed6049065837aa3ce54a75e7a185e26c56568c719a8ba5aeb4266d41c79ecc680274e03d419df4c3753bc2fd40cd68e1da343f756e5a86624998fb12718ef926edadc55151b65dbb6cae8f5fd8c23eafd85a82c65f1a65bc7dd5aad398f3531989c8444d33aa42352af888c8d8065ddd812fe82d97fdddbd295c09b19d1edb8d48a91f0b471ae7ab7a67bd7946f6cf607280426463613a7b8dde26e8ab76c437572e48b9c0ae79fe25d0a9bc13614a55596573b926fcf580dec273f65664135c8f0dfcd2c14e667e9fb5b2dce90f18e978ebb40c3b7a8a62a55aa412f50c332a2422643d579aab6fe14bb8a3a3b53eab68913b08cc9d31aadfe5b8295553e434839376c47a3b151f82f07ab79735a38763920fd03cc61829bc77fc0be2bf0f06895df91f0eabff0620fe7e1aeb65a7fa4a38f13418bb98d86d27491aa6e02983d4be9da3da0451aa1c2fc248b3881725ffb8a2e71e97cbc737a1b22ed415cccfdac11522f139aa706b16edbf419a084d9583f510e12e7dfb2d53e3f78cad12b985fd9de29e55a7f0a81c286f22b31f06f47b864785bb2fbba0da72519660baf12b6bed6f6353124ffd2c04aff4aa9524ca3dbeb34b43cede5dd79ebb39926985fe744386546d2950adae2a465c2bb798042fbfc45cfbd4559b43c2109c2e1b6b389468e68862e1b59b8593ce7ed8476ec02c1dc955e70e47d290e1e4672610d645ee3c736e4330e8e5d36d7c7e67f6e3ccd272104c426ad83eedd9f3b40dbba9c420e13a58d4537d56577af71dc55950b0a0abac2a13c371cc79a58551f0737cfb20e693324e01cf4772f1c401124d6b9532f6f6c91d21d85abcb532266a8bb11a7862a60b329998e4021430d8791fb8c51dcde068ab2b5a8dbb23197a8efa59a08d5acb975fab04fa60d92a10494b925d6e87695dfc551876a618a43737743f67aadfd88d3ae8e03af4f34210c6fcd9dcd8c2ea03ed35e8f8976681566138b94966d5f617ca89b98f40ec4849d8f10749659304d2cf441958da5e66f50b226c52267a602bc6d9a4b93f12880406e80d2fdfa316c4393fef23634d4c975aa1ab7c752234e210f63d99010d7948fef1c6781886824c5b3363b8349588245a4c0f17bc988e6c1a9ce2ef5d0ff7e29814777569200026890cb7d853e043cb2373d6ca95320a50adfdbae854abd3d12405aab6287493c5dc6d61b923314b3f2d4ee056967cd0c90f6c9dd187406165cb899c78b0d19dbdf5dea8fc6a7010b32a377dde97bbe249a46fc54ba29f31253247e7a6aee6fd652a9b87f3a86e397a30ec9b66e9d4b26e6999f0de891ba5300550499e2d326d0689bcc001b52ee334eca8aa36fcf87fb8580726dd28b097b9fbd76e7c5bac0f67985ceace76ac46987f13420e19cfe89f747a0e1255ed5c86b8779a2b5f057b0d481841c124214f49ae054db59376b67303c947ac89d873267c1c97ee3938fc3a347b180083dcdf85bdeaba5f8fa970bfb5f82119e696210c5637501190502b0ced1b5bc0bdc2c340a7bb9c1e0d9d899658158fcdb8ffccefb3ddb5d7ada6425c48f7346088c24b93f8dd8ccf42a41b252acf5a53cc06f8468f8a0c2d1eaf8710de41e643731691b2d1ded880ee6c87125c5cc8df62b9caac44d246b1253e27113de6b3a0073271e8d64aeb506a1e6dbdd1c0c880d2b080ec349edf7a6d0c1e7fd63ab7d07c50546800f0b95c78de1f55dfbf6625e315f742c4be3ef22c5dd339cf1ba2a33ce6496f6aa2f2fe29a254902d75e49c078556e27416adbdbcfa485e7ccfa31490b0f4bd5ec8974629da533d8729cea4af9a7f94089c2e91d9eaceb2e3d6c12238437834d8ce534defdbd5288fe9aed8942177012c8c5f5d9cace0ff697134bce92031148823775068eea18abcdfef8b0a02c0a1af12fc44d5828d5ba1a5afd6b8008d2fd10eaaebcf90fc6c946dff8942932271b30a810886e4260cf7c4d2f6f3f22109bf9f37561977379caaf53f3d81250046cf0f38b92d1c982c2e16875cbe2dbe28e5846ce70294075af3d8603ce1f210e3dc77f4ad0000785602d35e95dde3d3f8736d62a5336011246b3c395c3d8133a04a057c5f20c1933b236d3afaf2bbec6627c8c22d168f4abae72f3df4c77a11d5c2ec74dbe8be4c842bc85cd7e89bb49905aaa2aa6d4d589965db8907b1986f279b653df557d8ab78b53076fac2a0ca4f446305c242f0c81577a9e4e67c48421537d3d82e7dee00e1d7d515a8d62cc835c6eb9908c2e3afc7951352d88a82fd4648281170acfe4b8f72737c37d402353008cae09a60eb5b7ad78e751ce29b9df8db412e32f5afff6511c8572adaddc4d47e2c4edf619377aa83f2a64e1fa073efad933caaedd258239b1473d5555b5e03494834591f7ef8127a845cc0bcfacacaf6469f068d32ac21d0cb288250c04e3b46b174d1ed6dc6a2627c9d4d1cad9ba5254fdad8e1496b60b4632786bbfdb64dfd0ebe14208c940f750a01b19c76929f4cd2e757716a43163921642dc5d03fae0c51119c93e75dee12a0ead5d55464f7c5b1fb63dcae53cd673f92e1a35b83f8dd54bd3d59e433dfabdf48dfbd722304908619415212aff2c6f61c7afb9a5c32d3f97fdf4517786f02a8a9e5a8960569877cadc5214623becff35ed53e13dccf0ec897fef3432555e5f5eb8b12ea4e4e01c29985e4a793ff6fadb285c1a81e7a63916c71cf4ff84f48836680c56cf16aa3d53fbe7a9bf787ff7fe23f1f437d24c8e950989c867c2a9aac82b97f857a6e44807d6fa7598c4f83f008db8efd5c80bf95395a9622d20921504a532dc437b1123faa0db4ad52cd109e8f0848d2b05a833177832c3c9ca2524c4a9f6e33443a3e322ca17a81f07b17972127781bd37588a7612f1e233f46bf4b748ae49cd2787e9edd0632fcd81f68672c8e592f1074d26f48189843dd240f2732eca1813a98356e0ca241cd3e6aa7a380132237000bc2b5c382847b13a2261f647b4454d9b6c4b629637ea84091f12276b25811a8b1f91ae6ebe6ecc78cfda26f73b1b861fdbfed288fcfecf74d00aabc7e4f8c5c768fa3614225b81dd288c448b40ef61a56d60acf39793447288dc55f35d779d9406fc21070442e674a512d6cafcd55a58bfe0e7d5711b2e34283acb00f60df69bf81bcebcab7e4a4251529bcfc57d958e11adb0fbf2da7413d298fd1f73a36a5fc59314b476704b1a3e7fa2d3514e97f1b5567be0d69a8a66a612d274a9f811cbf198027d849352beebed14b08644e0f90339314e7979bc4be35126afb9c0c3369799a61ed57361ecb163bf1a3ef30aa44c89cfdf4e08475eae90b00ea46896751edff8a177407b62f44b72aedd5cd32453281a4b4b4d6ff9a7e4d7f56ac224460e30ef8766317ceac384b20ba5e81b21fc74f1bd2a860ee66363050cacb0b2cf91f6f05722be95b401dc9f315a32b5d2dff9cc03d6f0100000000000000001e5458000000000074b672dc1e1c9e50926e957013dcc7049ae440bc06cdf8f3aa9c768ab0041ceeb605962f6cc7b8c26c3b168bf041479f7dbd5ea77311632ca5d6e96c3dfb4b074996a11b5b11137ecdf0ec02d60d12c610be638565d7f3c7bad7e7fc055990780000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000086f2b06a1cf278353d9c3349a2c1bc454504adfb119e9a078532c4aed84bc4d59cc5b4f0ad759e0cc96cfa68b922de1319bcdf53e7eaadd7e7ea9041490d7dceea13c200de5886bcec8b2b3731173bd438247bc9f958a03f52616e5435dc0954b2cdb63e283b3831a0e5588b6d412e5a1dc4b9556db9cd7fe0e71347490533c487c29907e9c15ae670045b2bea98ec84b05536b24daf2ff9fd37521262e03fc22e7cfd5d82e7411eb23469338b733bc20f4d17fa99186eeb3811bc675dc90d774212f0cadd488e480f3c1e8f8932c42a92c349cb14ddb2c692aa44768052e35061d04a18d70e3b21bdb568c733547d05e6c322454e858a91b8eb3ebf481cb0795f6bc98b10f8d3f0ad077417518d1f1223f902b6bf3d6ba5e508b531a2a91fd61522f90275c3bc2905240041c88b8181feb35a24ce07612077f2a5c997c31061879114af2f0c553cf20822f59863ef1affdf7f44702a90a1b5b5c2d1760da27c4d1df887aecb21c756c43c44423f0a40d2a015fad4800f342159312d47d167985fc958d3c85ca4164fdf311121613255093ea7b6f5e58f25653327a85ac8b1e97e2ba0880aade729ec052e7481762b320afb36aa49ff71ea5ff578eee033452f818e6d722ffcf2ae1a0a764ac6b13d3e2bc326134c4533c2e38526277e01cdc0ef3c0f1db84d5b76721d6cfb8fb332217a17f3cf3242500c0aa4137633e9b8e20a1c9577b0db9c6beea354e3283d7e07bd0af185bdec243d9c2306791c1a9de474db0789077e5abc4012e0b0944aa8748320068cf3233895ef651159e364b47bc39a570c150736c794372f644b23a0fca0a44b5d7093794c9d2ea6d8ecc5d4e3f0375c279f359e2979467973a41f8bb559ec0007e3133b74dc23ca3cad55724ba7e97d15d7a3fbc46d5f29096f3f70fc4a1561d4c96f9872c0bb04ea50d81747d96fb80318f2dc4bf09ff59b9c51e4b8a408ea77894fec4631194e5e43b00cbd366ecd643a33b8b64811618a2092ace8c98ef31f845dbf8ef061986fcd65665177524ec9992f2f2f445dde1199c2d0f2d3d16bd4c0067d184fa0b205302a43c7d7035e74a59e47155968f4561394bf56a582c31f3664ac6328c51db0ef646d5ecb5aa58f4fc9f6c6ab25821d2fd15469471eb325d9483f58c228c256fd076662a567dca1f8115cfbec648317415873882d05e2411710e572cdc848026be34851238db87b4476ac813de63eef73d2ce078570fa3bc415c9db5088192c213723b20304df802b973587d7174a8f51dbcc22db8ba4fe15cdad740057859003df89b3e361afa1c275d50b2141dc4c200581df7cec13232d19bbcbded7f8ed50ad8633725e15ff4ee875e7fad34bfca7c193a4678694357b7c931d7ea1e2cf997d81071be3e74daf4bc9b55c5451f87df2aec366a0cd45824d9068eb629517cae83e305e42fff81a7464c7b90b2d567346262c19646a309835a015cc265dc0c3a7e58589c5b5172d02183a5bf0fde81ade62a3507495b4bea8c1b3c9283312a92b91bdf550d065d7e583e8b75f04b67ad8a58a44ef1315eb9ed2f4a1b345fe9c09e2d9591e8fa2492d963c49ce6026b321810f1d82530ebce48e30f29f80839b3dbc5b98f2dbc72e1c5c0fe15195310570a859a191bc8fa153db80a351bb571466330182a691cd54e8c2f3c65c9107ad1d4a36057f1c6d61191c62557d008bd78132b472b5e775c0375292066fc56fe78e0b172d398db4dddc08f4936c25bc2b2e43335b900d2079c9bed7c8c1836bbce67493127b5b63c3345c9e2eadd523f5aaa4dfd34a929b0b3022e0b527c450c093acf44b638e4eb9e0b118bef1dc5cfaa3f16727fb64176a98b78c194f5b013587d34363af3f57886c4396b1afc70919ba7c41ea5077acfb32d470f18cb064846a7da45fd61280913e29f9ff28da5071bfef30cb68346b25a24d495ee18dd64fe08a2d46a91101550b5d4fdd162084e12f739f51cac94979dd3391b602374a301f5ae7afe3281784f197245c5e352986f4dbd6669a0cf4ad8d56ff8420fcf5c9bec550834b64b813ec858641e51c8af05a5d00976aae3b88088034d202732cd0029982d6bb7c15236acb9c25dd5da7c3deabb2ec0091149a23d34c3fc4cb08c13f5b16e3b625987211feaf84aaf41a2faecd81d56a395583fbaed450f3ea6cab0476b55b069938c48e4bfac437d44da389a5cf7c82b7643da612e24e8815612ec3be3a334291d318f67b9ca44d83c2eaaf95a7a40a1d7b8f98fba1c2a2abef6e7f3808130f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "6a655100526a", 1, -510930508, 0, "5871de628b676d8e61979db9e669472a03997eca9a1a590640ac8fa5a4a09c12"],
+	["d1f6386b02468f27e0714c5d1c93c7d812e8d1980997ab6dace6bbec3ef573064cedccb84b02000000095351650063006a5353850274e658b1c2a564abc2ed3a68c6c64d88226306682e02421188056c2eb619f9ebe3d000000000096aac5263ac5152006affffffff01c3304a04000000000200650000000000", "006563", 0, -1301829140, 1953719636, "3000a5470df4569dc449e96345b1a5d8fa17d6a21fef77377c2450e7711c1ee3"],
+	["030000807082c40302265e34b307988dd76593b0cdac4cc5e4bda1ebd35dc21fba8fcb4d8177c40fdb020000000765656a6551636550c915b924eaff3223e95b4eb452d2beb03a8b8c028562762e3b23149b208c3b2798a630030000000352630020cfc78e02ddc28a010000000007006553525153acfc232e01000000000453636351000000000000000000", "00", 1, 1752634652, 4122551051, "75924ec110c69b5a2f32018393efd48bdcea34f6dafd78c36f8e7128f5ef6390"],
+	["0400008085202f890241e1e599a51c59daf3009e61c541b95add5e636106e0d99624ad7dbe25a5e0bd010000000465516a51ff01588f861848d1e83a3633d3f515dfd22ca2f0a79d8cc956f323b6b9dbd1a7ed69f6a60200000003ac53637d718cdb022791c5020000000005525100ac001a36b50300000000065252635100ac00000000000000002cc41d02000000000146e019550584bd27c0e86de69cf3ea6c54296db67dd4e435da7894b2a50fa6d41cd02a90389e75d44bdcb857e8513064ae47bab2e432d267d607ee795b2959037e028457f186fec2601252c215262972536d6b4bf03054c21c4ffb55615686a7f71606be70b94c9ca6bfce0db4a8dbf8c176743e2462c41dfbbc09b3ad6686b2445cfd8488b7db1d19ecdcc7ce5ba3975a5dfc66d4cca703fb641a7bd74bf2806a8b7967f8e6d9aa2860858d663afb4cfd163655c78c943f2230c3c9ab6bbf6963884501803c0141abfdc7a9eff942be13ca322a1c704164e6bfcaa89d0b343cd46b475c047603b4382e8af90b8d0d92d31d3db4e07d3e44a4ae6779f6ddf273f941261fe73931248885155120a10d0e262365ae219bbcf163a9046a597f39b71cf2d1dec523a027e3d20d16eaab5fb8508dc4d8730141fda26b4ae7444eb9fa1d7b8f98fba1c2a2abef6e7f3808130f000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000042bfc12fb4b8c154b3bed90beb39f8df0518d155189479684b464a7d69b67ae2b8d1e4a8ff22a4cc0d3025156384e9f2e6d571bc9afb1a9ee275aecbce3f4db33e8044dee208605391bac8fdaec12076fc4817c16ac8eb0e42549840c3c424cf3bd9055844cc5e1959a1e7914848cb7c13a54aef13f40e9545ef435541798e04adbff00f847dd3c3d371cb62d14fd7acb0213a95ed030379d9bc6bd35f2f6b23d457e9022a81632efcf8d952eb9aed9b1dd8e8ca2fbf7ed98b5074e95af8f96aa9f849b402ad5d6a911f337842e06d5f3fc025b8f232b8f7bb8b9a2615204aaf3b0bc3170230fa463157eef66877269f4a398bd5461d3e9ac6e6240d88972af570840a6bde3903c99a75c98309a7c5d150e4ea788ee2d4933fa6759360f588b009cbb9429b2a63b0d443a2b87821109b8e36ead5379f6addbad900f9a68ee1c3920ec281d4d4673f21a3b28f87f09e1fa873b5a7206aab556c0b7f5c1b8e61620ec82061006c2899b1c1c7d794ee17a9f41bc97bd8e2d2b7a47bf8086c42874aedd3bab386bebcf5ea1237f2caf9f9d3f92ffcedaafd29b3bdd8060b8330f2f3d693eeb69ee608c129787d422046aef086cb842d957455fa99a3dd2f7dccfa3b627d4532d778db98d8f9ed84b6e475a884d1f7f4c3d4d95f96db2b95d5fc9ec3cb6f5644c86b96aba2fa3057f302a053a2392f9e878d6afbbb0e3795fe81989d4bee3c6e0ffc8b6d8343e3fce6aebdb3bf2b069659df687a65fd8d9257fce7033f4f0aea8281af834f5705f78938785f1347a2d8633643e865d3138d86cb9048c3f9637d3aaa972d71d3458cb75ac88d4f82a35e6fff49aca482c58d8a9be3874adb7892ae403b5443227c696db0650cae6ee4a287cab0b635e3c147c0625052035d83e0308ac64dea39a3f2685aba59c799ed99c51328f26cfbf8d376ff50ae06afdbde4e9e94cd6dc4236b0a4ec55255c6707dc7bca049ce8d742c08215022462b0dc1ef5337db9cc2c2e6890f3bd37a5cfc24c1ac78eedbcd5a1850ab3918deac475bdf54c70bd81230e9aad109c878f4c0ca555a072d363a967954ba7019874df6f4781b7bbafc7e2871c1e16e830c74ef2dc2834d92c4dbc02c841df938d32f654313d3969ade4d65fa71297b4dd90c79c22cf53824af0424b0d45bbfda9ee2cf1b2aea3587783b005e61a9fda99be703c9ca6c3847358ef516d5f8c238ce6b7e4a916fe304ce72a220ad0d9b81d19e405df2bd92c549266b19457ec15f02532f7b154243f485ef0ad85874e4811ec6b4290d000bef17b739d8265d5e5d398198ea92f8dce0e9ca2343c6484a678925d94141b2234b6ebb4201daf69f854da3b9709e432a6c2fe6bd0de2364cc9d81052b0028b5d4ae19ddfa9161cfc219193cb1f0e91b57b71155111ca76b4954f89be2408e593ee99ffdf8bfd6fff95eec893e5573e32c47efc3b610e96f03e0b30e2ee687780c2281b8d6266e27d6592fbb898d6537ce2cd57b56d1e3a59a625aa436d67013c11af1aad20c9e0c27e1f5333dbea2635d4b3b7b34fc5459f74a63cf044827abeb9aa4f1b355d0801e2c01e333eac43d0258fc2ca4260a25af0db5e2cdf1a9ec2410145f72df60c29a598b014edeceb191321445d5ee3fb1f637562356d73993432dd39444dbec38ed007b56acf11c7f2e4461be69abb5493969cd6b7afdfaa3d7a791810f3c8b4c4be857f250514f5fe7bd66784b2d7eed239874443d1efcc7236149e53fe9f1a89127a4e7640a51f666981678ca7ec971463eb97364fb51ed175cd25a31dfecb0b810d32725c1919d8f8ae97f0cdf6033ee20587e537baceefd640240cdb85ce733d0af79fefd97a06ba483b8da628b829acd44b47bd50140b485959151659c40dfa6195bad6cd92a04687e6d095e47384c68d693bc258fda9cce3e7f55f897666bfbfe2170a09ac977b175929e0bf9c17a101f41f8926ed9ef80e8100136b95d1c44786d8288346609c9c9d08cb663f818a2f449c541bf865149ea72f3f2a5c64a1088da226ea21ca4b87d7acf5d6941c0746dbda55bb6395ef1c908d8faa7277c5a0124931772e29034067eeded94b09a9b32bfff6b15f0374459203c22f41a3d680e6b7b558523325a2ee37121adc9e28c35f543350142ac27d943c6e7a3a92b0096b0dbe05d9d89c553c3e3082f07bc35600d7e9d941d9cea02b277e237cb9ca7ab55795f2ed0235726694330790f5bf612502c02dc34dc5a1ce4d80c5f282b0617b847366a515cc27bcc359315ec697d13f541fbb6f6343ff2cae6f5aa786707683200868afa5b5504fbd09316c0e7b308f8eba77b5df23cf4f605d9b8d4e0d46e05a7d28fc1c66191fd7bb9e116f40284fd3eee5bb745d1a99528ca818ce278e016166ae5d86e2798e52cd760b3dcd8de5c676c07d6f4a72c84b829aeef93f8adc442aad884cc69695de7768e8e9645bf94aeea79fcdc3baab4eb6f9735179b86fe86f9728585b12074419df0410a7c11d81430ea95b62ff296f227d5cef7461e8ace1fe3c987b36f38c9b182ca0c5e969cc36180a67c34adb271fed59f314d398ed50ca5cddcb216a9b98a326291e2c5f3cd5c4bd117a049ac6358c33d105223f621b2be4a882c3248a7731de86ed817eba019be19a93d87e7c85278a3b9cd5f2aedf68769aacf865a517a77b3f0fb48e52aafe2e82f91871cfc951e68f6907fd03e78a19ed48c7c6627045a9caec13de19daf53942293c0c13f01d3b99151355be087adcf4e47428924e27ef6c2cf09a9fead5f7cc11a76eb66dc545ef434992678ba720e2f422b984e40a17cc02f9dfc1772c67fc708c215c6917ba28bf49e0a6a27e68f2f74d00c25871df6f4f9b195a2cb6ef52bbd944507a4f393fb0fa740b7dc1fc762aea8dd32e2b15d201653b7407b71fd4dbd87f5be2fa7742b5b5ea44face9a724e7673778aafbd81006b6715254275a095b11ded0a5b7457cff927e88a01cfb79762f70bad9af146506824cbb5ad604940ebc9a76474f7539c4268dfd374d26543a07da197c8095602e7801b2d05079ffa85a5b241b1f41692eea1453d0c34236becdc97ebf8604638b6cfe9c1ca996658ea52528cdf4ec12a4fc43583f52154741274715b8f4543f32c8ab1383eeef87fd2ecda6870d5873e399e28232634e732f4a5dc864a46d69e7a9204746794786fe32b853e3a4524c064384e57d932845cde0e389a3c513db4d94a5a3b4000c300afba93f5de193f78bca86f16273ac4cedb4497df1d92847f7cb4675a210460d881cffaf1dd1e7754f9200b5456c773ee0b91f2b9777909a9ed3c35063ba0d6df8cbf4502bb50d99545b8f2918939f8950b56331c520bdf31bcb523e1fd52fbe6da88778aa96729a4e882d0a6b6a51033c01770d45d4afe3b0a2e4c57c1ce4758396f1199725c7c7672bdee11a9fadd6072415b791f4f9d0ec58c1d1ca4cc7f9bcf08a6f119ed5c5913f0265bb58169f8360f69ca1da7136634654c45d1950102f0d7870a6ec2c88c5e9ea5349280f9409fd47e174fb7583b5b0034ab7cb51ebb44ee99515e9d3912e642a17cf52e731ade90b2c4b6687ca6e7938ee1027dab057ef130c527dc1c91d4e4ed9febd3dbb824b20876bd6e9757188bd1e617293ae8e8997d31d58695c990b50c5c94e246438a69745070b58dd00ee31adad839e8d8cd97c47333ae6503af085de6516392beeee0ce89244aae480184dc7c7802f64a5474ecf235721add9ad0bfb12f0eef653c345103648cf4115ea8e18dc758b07b4ab5e24690282944bec6189776c6539b5770bae4046f9f001e8fb724ac75f54ff8492035451e3ebe2b60ae56a10fffe75b3637ecfdf789d1215f0b786889b43ca9f329bafe75f25aadf604b45e8d1f92f52e906e9a04a7ff13a093d55856ecff3e3168f5a634d9770b1233d3735a32583c6b17dd245ea32a62a84aa8998345785e2acb4cde840c55ccf4994545db25292f943ddea07e2766dc0bf869fdaa58760828ff27b5f661a70a780244c7700452b471c10b7a34713b98454e3177c39f2a1b65328a715c697ec641821da003d06781a416c35666c98b2e48695a0795272b8f8658b47a8174d40e4fdfd704f71520318e15eabbd9241c9fbf658333b634f208666ff0994c8bf6f8ad11d96f6d1b119631048bbaa0bf482d5459d104c718db62e4e4de14a7f7db07c8e7d4520ec24dfc754b00aec4b6b526fdcdb36753ab96664b4531760a1130a9a0ff2010b1f771924720d0a5c90c828e6126f0e08b8f0ee3791b9f365b4ef92433dad1e3ebd4aac933dd27fe8611d6e5c973366301dc9b60bfd01b833bf8d7721eaaf989f84c201b48b963134dfa677d2e871323bcf94543bc4f8f9e011078a120729f7b9126b38840172196a01acecf633f8b6066d7fb64451715bd7d2c2c32e789acb10b76a01c01ddc0a88a46f11167594c3245ae01793798b7b9ee8381ae18c2de28ff2a0ddf9dcdd3113aea5a402a0158565f388d71ff456cd17ca1bca992b33f09d43e26a500cac733fc2fb8d1c47e655398d593824867b2e74d2410ac2275bf785f187640156925906cb419d76e56985ff24e797b96fc293a0eb34a50eb1e68c261f025e9bbc7bedd31727872a5dbeea0f1962ed1aab3a5992f2e4f1071c05199ff32727333b9564a8b57c61d5305aa474dc52824a5501b0119b6de875f17fd6b9b75031dd5c2c7b19ae6a4dd1ff7b231bc1c0c30f837457063c658b2d54f3f5f4570bafa2e7273c856cb240b0016b9b9d18759a18de18081ed6c004c4acac5b03cc740ec707599e51d99e1c1f31ee509d095754e8c604e9e5af9b8c4298c6470c54dea96b3ccb39e914c88819cb8a164b868e95b915c25e42c93cdbf81bcf5306c4f4382aa85ef548f69c3b1ad34eb85e5b6196596ea50811bf850c74d1709e89103231c8e39fd0ceb476d9e88e22b11b853e3975ce481c7b30cc7b45530b680a0b494e51a86fa0b279e85be5b4cf59cc14654230ed0f47ed4d8066a76ca777d6f784e47ff9625f771d09a74132917380732cbe864f2599a8dbb4cea3933b4186618b9e6a81f15c30de8dc3129b259aa12567a49e7901905aa13e84e6b6c9e9e731233b267507ba880041256454975c2a02cf08dd1b089917ae3ae2c5a8fbe7161d84e43094e2dec2f5aeb46ae1d0cc3487d62fca5d43f3efe47c49fc9f4bfcdb6cb7f5dcb4a064fbf3138aeafa1b66e7b23ba1450747c3823a7756616dadb01cc3f5c1e50f9038b1823cb42aa1a18253ab29692bbe67bb11e23f28ebb8579013c6dac98a39b8b346815d92e8815a2b9773b07820ccb90cab11bc018dfd735d54c98d8cb81ef33b76b486c10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "6a53", 0, 318748078, 0, "561ad0cf8f844421e71f1642689ff86a4c3d37ef17c9b8dcaff8439e928db0ee"],
+	["b6c5083d0483966cf9ca47e8b62b5853d1778ac4de1fdf4dea8e785fe6a5008adbe42b3b9c030000000900526a6aac526500539ca316ef2ca36fbb792a5791d660d7fa17ce06b10f62962e6c4325055c3f994a1d99bdd90200000001530aea8cefd4c5abb71c1dcd65526a1dcb954b6ef51c74b04c32dddc6757f783efcdc4292d0300000003635253ffffffff6a73e8d7c3419dd5022875e3d77194eaedf32f089a14c3ab1b7bcefc870dedc700000000096a63acac53006a6365ffffffff045b58c10200000000046365630020e9a600000000000351ac65cd677603000000000365ac0081fe48000000000007525252ac51ac52db30a92900", "5365525365", 3, 412415076, 1537743641, "99d25c18df7ba3f449d694a4dada4dcee068f3921d0b0a98c6eebcf5439d7135"],
+	["030000807082c403017be3e5c7551e07cc973de0248c2f70133e0cc41f856cd00a99771e5ba8271141010000000651516a655253ffffffff0278ddb80200000000096551655300ac636563bf879f0000000000066300006a6353000000003155350100", "", 0, 1770863925, 733220448, "8aad036cdd1ae98730ed7c3d60dde10d8ccd068f4fcd4ce6c5b48f2bd735fbbc"],
+	["030000807082c40304840bc22d1371ea27f919e294e5c5f1aaf88217002652888c59c307cd21d9f4cf01000000036a6363ffffffffa85940ec9618fe5ae5aa45734b9cee1fde01c6a2d0621584be047a64d512e7820200000007ac52525163ac63ffffffffde9172367f7bbd3d69e118dd5e4292615cfc42497a76c03e22253408646ca570010000000865630053535365acffffffff060d91880240d35e23baac92c6979ebc704d1aed073c9d1c0e744f28368460e203000000090052ac636aac536a6ac91590670237df88000000000008516a51005353006553e98f000000000003ac6aac00000000e3aef10c00", "", 1, -864775866, 1537743641, "ce5ceab8849559842fbf0407b584abc3f224afee0112a65cae05747ffe9ed330"],
+	["2600096002d64f9cc6bde9cc3a884ab45dcde0bf3a5e1074a1ee9f92f5efccbce18c975bb7020000000100ffffffff9784ea23381c580008f2c2f16ac5974c00e4f15ec162133054fabd920b8d46b90300000003536353ffffffff041d47400000000000025151584e42020000000006636a526a6351f94080030000000002636303301504000000000263510000000000", "516552", 0, -1147989798, 733220448, "af35a18258961af0228736892b43fe167dbdbaabadd651953342fe68ec8f5fab"],
+	["030000807082c40302af602af760e009be08c160726307b34a311f79e29746c79a857a0c97033ba6cf01000000090052526a6a0052516a56498a29a721df1ea20e343f805bcb947bbbc10b32db4868884aa917ce70f34ebb983d2d0200000009000053525163006552c1344e56046a02cc01000000000751536351ac52639a41d00200000000025353712f470200000000036a656a77744b030000000005ac53ac6a65254dfd8c0000000000", "52535353", 0, -84406029, 733220448, "4f7e42d9016325e036f0d19de2a27cb93f4e7e328d71cc1c5274725695bfe1c0"],
+	["ec196e5803f9b97b4aa2417f5941a0bd2f64e296bd58ed70bc47ffd88cfe784bb07c7236040100000003ac6353afc6257340f106785b8c717834dedbde381a18a33d1cd992491f22dc0eb70f0ed2f27a0903000000036351638ba6c917fb183731b1dfeaedca2ecbd83dd6ba7b092794952d3539fef7d0c1abfa2a781803000000065252525351acffffffff02b91f5901000000000100462a27050000000005ac5153636aec8e3ab800", "52656a52ac51", 0, 1041439470, 4122551051, "38510f6068e5d7533d9224880d1f2eedc37836f3c778af710b216c05402c73a0"],
+	["0400008085202f8904f8e94b9392222fc457b813b64392c2d4a6f4c82729f695be593f0aad1b4fc806030000000452ac5151ffffffff01f705a8e0180513d3cdc024ad28ee556ce5924a807d65dacb8a1d94740cd5920100000007acac516a6a51acd599fcb6c4089319ee3b5fbadd0a63b324894753a60dc73feca153ce0137c19b6cd8d1560000000000ffffffff1b93052f01806f6a1da19d43b458f7cef5b64984065198b238122c793164bdcc00000000025163ffffffff02dfb4fc00000000000152227bd70000000000096553ac525353636552000000000000000097a48000000000000425c8a1d4d1f437b11feecbb9666084a3ab8ca4f41c885fc18f0e2cb3ebcc4911c49193f09068a969b97b6b2e8a6ac436ef9b0a58ae9e48ea7a5b06fcdf6fbb51465ae4168272c2fda7e8e75e721ce3b8cc4c280efa827292d26ceea03b532abec1e5472eb7ccd0a4fe9204a90ad6e7000ca4da412c7d33d7669f061a1131732982a80bb6d889a4f39d21025a93778b0edb017722cb9c2636480f97c665980ede1ae9e53495dc205bbb04704a07379acdc0483f3cd8070b85fa7133516362f52ce5be391bd0b1a2ea93e89aa58f5e0175e3914321d89549c1f31400387b9221ecdaec9a50c71c74ec1beafa10f2b95a5fb170f70afc8e8ac78670771b847df7d49384693bf5269837b7a841d949e5c0895af3247fc153c3356d1e7dd6a42700774255f9eb9d8a26070d6c00fd753be5e0f9b2663289c7af97f96103a5972063e28ee90191dbdf354636b5b8c3e99ff706000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000a40f1ecc506e4464f4332efaa823ee4569d59b5401bff58ef9c01e9cd7cbffcc4b9c294eb58124d43e6f9d9fb435351d0fe3784095cedc172e44ca5d68cbbf0fabc48530e83d9ed2d4093c2238ed9c0e70b0e910727e001816a5fd1f2479ee334aac16b69a01baa23983de4e48e22fe933c91703813c61c2edecbd3643ba85535adfe9074229535de0be711f000af4406d59953206a0b0da542f01b23a4f77590c5cbdf7ca57f54ae715cf882f4fe97e7d5339ee7e65bfac2ea9c4fbc5d112c71440ff1ff40a0034b877fd381e857093062ab47c0a7825fe37b1e73d2f735dd54e7eba4a12a1a7f8e1722a1cee464870b3e6c5ba3eba2a902b1a56484c79569e8b5137bf75d4267cef67561b09b0d15ef7929dfd704619c147504859594d1a6e0dc240fb96991b8cd2f2ad22785216094481b162178a3229914e2c1c580c8d658ee90191dbdf354636b5b8c3e99ff70600000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000077487ee69c5b4d03d6fb89cf8061075510691b0a75e92f56f364fe4c2b371c23df4ec19c7f333c8a7e5dd1c7f3b262ee37ad000c8aa5dededf725c1d4d9aa44611b1515f3abd30ffd063b2d4323f16fd66dab35857e0c20842b2afa9f8074e39f78e1502038401a0601124123b39a0a8d20f6679ee87a85c224d89160fcb9fcced7fbc9ba05cba3388bc4698015d9123dba585fb7d466954d85450560a1a5c2c235172ac2cdedbab7fdef39db35627a253c4fcd9f797e218ce57533aeae3cd57a96db4284a438682e01e7d0866498fc7aa2d55d4086a0b2db58e6b2a4d8293b7e138b539e9a4c8d80d10b48ca721589ea51b4061d834d8863605cf61ddf8213294df731ad4ef7bb1749d237ba88b16522e247c93016f5a7a24c477c65741ad4f2433523e6dc0a6e703dedc9bd8fb60e1b3223540066afc624fcbf2843a61ee398ee90191dbdf354636b5b8c3e99ff706000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000c5dc37ad1034edd35b5798b0d843e626ceadfa1a26f3b57a549e162689aa814f35f10ae46cf4f73388b9cc4f7d6b4f2a5bd84b0859592a3e47e997883be27051e768f5a64d3bf96d7df2fb87278b59fd58282084cf35e41f960ef57eda06cc567b649f78e3e77db82f985b4b75404eb01b5ae54fb014c471cc45fe1ef576952b26efcd1418aac20f2846699a18dd95513dcd845896b6583a13b5b2bd070ad692b02a6d1d6529d159acc6fbdfe814a7807b0778f6dfb1ef4d13b850df8de3f9556cf263253b4905dff90549ca42e025c29227deba0807ccac20fdd5e9399c8ba2875839d355dae6d404cfdf2edd071be94d2a362ee5fb9d01e50973ce002d2fb7180cad3f7631c781ad4972c10ba9f881a35ddf2c322f95f2d586f4136133ce0f425a51ac4f1a6c7c6c9b43acd341b671de247a1b3d9fb00a1cee1a5ee8a02bff8ee90191dbdf354636b5b8c3e99ff70600000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001a8001ec16ea07d0847f45d93972d3559f1abcfbb30d334ac120fd3fd31126d02c606ebf786bc6552028bf3488f19303756226c0676bf674fa00a5f09d074172000a7b92d59493f7f532b3c9704edd495b1515ba21db048b647a3a93471f4d71e920432fdf388d2f5fada22c4cbc7c066fe15d4678f9209982d389c591d36a48a0e831defab16242ddc7deee61d3f7e19fb66136c4dcfe8f768dde4344cf45e8c36be7d23c8ed447a7a69193ca8bf26c2b4b1ade242ad7044f2739e955ae3ff4d2e76d19334df4f2e82409e72393150b3e35ce82e5d8788999c633ba6c05246f6b1f3e89b39371cf00a789a4a69695a2bbc27bb671ab0187852005d04e7daed9c36d62a4f4b6b67b6e18cbdaa5b2364849394a799cf630756cd6670d2c1634fea2905bf024b76d81677ac146f4bcda78e47f12641096593698c61bbe70bf11e756377725c25498ecb4354ac524dbf54e4e93dc7f3b20dbff033f2e9fa341048b41d2da34d5d47ead9e61e87edaac17e1220ff8e0a7af69b2b6c24095e47be81ebd2405d1dc9b83652723cc1c8d8984090173bfae7909b5ed3abcf5dc84e4ff9d3c2f744540574ce85165f20dfef9e44deded804a0bfa62bbdf6b65e73bf8770bb740bc1c35d7bab7fb1bfd88e276e776b52966091c4488849530908eb0b6faa58616cf388f87faae2a94d922917db44652f42acf16f5f544351433353f0e3786c692a348caa3a833d21d325555db791a6ea9c23dc35f1cc75889d4696a8e5ca869b9641cc6184620254d18db91434f674f90abe397d83fdeff3e2282f594d42d62f98c6d7992c865c6d6c8c67da9996d2339be66a7c7e5f19b06496dcf0d17e4eaf960129f19b9afa7ae6100ee12989afbbaa5226b375d95c4de63ec889aed5137d790f6724102394c4c6b6792ff42cf97f50ff0fe4abf730a4383279efefad413b91f6c6ae1ee4df23611355eb745977febb9c2d1dfb6ed68b6e7223995b44f0c85720036c67982160c270779f9b8d96946e5c4e23ea327f93f6d0ab2d74ca6921f67c3db3d3ba10e43aa041ac911e30e414d63ff202c7f8f3e2d3d189dc896398cb56716a087bf94582d698daefe0cd560ff62c9d410a3a89f725a2753eebb9a1aaae2f3c59de4b60e6dd06a8ab1e29b5970c26875da180f5f3c54ad74d1bf253bf4570da729bd6728fe335f525bd7d57983df9f169f8c68edca5651c878707c40958af0ddffc60ea358fd45603d7715729cada197f3495ec2858f3f7e4322715fd628c13a4235d9d4ab1cf73b3e079826b4def30288abc2e86e3e6451668f9fb4ecfba55b188bae588e00870626d5e43b8295303c033b10100000000000000000000000068dab5344212173d1fb517ca4f14bd50f81283143df096b970b17bf78c16d57afd1b7a1f6484de521e20445245ed77e7f0f9bb0ae09013dba951b52cd32182c11498438d35ca173c1e1a3dedf2ed306c0bf6c48b688a45921ac5326e700390aa0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000012ee5d8266c01bab3ec29af92e467c50d9e964b22393b512dda4a0b0c3da253746b988be3e6b5fe88474d85b9643cec7853a05b0e021e2a6d4e84211f769c2f00a702d6b3c12a7d4a76bb818ae9b12f1dea3ec0268ecf1d0552c7a384416e47f0c6362f4044535773e325481565a655ead2ab6a741cec063bbfabbe098f35be82ac4f3f78a4a611cbdce4a781e82924c00d86efbf88ad62e4255d5d1b03adc07e88a876554eba4f346c067051f69b1e930f5e92ae9d410de175283343e1240c63adc5b1919b275a9db9c9a31f94d543854036fe1a6be4c1e4fa452ab076c4b4f7fadb8e819effdc353e6241504f8b3705d8d1239c946eb8f5c7357c1bfb2728b4966078bf2add0e02d9814bc9c628a8d805a8c6c6e844914a5af87cdd3e6ff7cae5322ca22d306a05a261ec29ee0e181cd29334bb5f6c8f2ef70bb579294833438cd39796f3dffc08e6f9d75b41df3c52dfb09372d77bb40c7fb64c1ff3db59695ac5c8037785115bacbd4266345a5c4294fec0523f25531d4edaec2220eacab5bf694dffed7a5599453f35bc760b210b53bce31731db5050f3f0f14ae76734590d98b98c672509aa28384f46e09682a04565354f0a9c65f7e3e0c9a79b35d114a9fe5c8bf366811753942019526502080b94b7950b6a3fecf3c46b5ad8256c2aaa8c764dc6ff0e96425de7ffacd92755709683d40d023bedad5f2d9dc27535110015cbbbd2d476f90308dd19f751229371c8eeecc63dbc21cc6e4379e07946e69d37a6489a9a28158623398b84e745b98ae5a4130c676d5333455c0f270f89f6d8a89eade90613354255efea14548eedfef4b929302e5320568b8de7bf4aac09219dd48e95d30cb948a3af1e116a04863b7fb9fff441cdc3839dff780367e015651115389c9246a73304e083d7090d9f625d999b7ff30c22a0bb7e8d543e530c91bb19898425b49c5982c1dd6c1d8d96abf6adf8acb0a2298fb9636a57da0ed502304b20516365b3d56277975ccadb0059508daf831913dcadd1bb93dcd03a2d730eba4f6fc7fa3d036a995dc5cce38d2b0e5a4ab51a2ec03b018ad2343f148688b607391c2c10261dda12855e28f9375f0a8e859adb394b97f22aee3f3d41ea4235e57b4ef896b0105be0879cbabc54462bd5abad7974dfcb7a45e117d3585022994cd14065c17e0dbd8c7a165d4a0e2a841fb4a44fcacd33ef44943d237e33c4d3aa7356173e4bb4fbb228db05cd9bc1d6aa0212129ba7074f5a08f87092e9d0047294b9ed3c1b9391de82ce741e88e1ed75daf86e7eed4725c06e17f027b5a6b2841965439bf6b046aaa5053e0080ada4ba5fa3d7004da06f2bb1e0eeec4ce3234bb62669f92bb0f2491a61d38893699bbd39c0dc5df01980ed7e39c99744eb7a819b68c931059da0bae056e7cfaee40d8fab33a264da992d659946b046c7caf54350955d6ee187635206ae70f55650718847c29c97c49fa881d397838fc9b391deb4031720b17d49943ce2c7c328bcb2e99f4133426a95b4c6b407ec76c4c3dc1433ae8b2ddc39407b0df4046b45d451d272c5f41b8978436caf9e20cdfd670845822aaf75b8dd0db881dc58865a2f39e2457a280e05addda16cbb8737c810721df68912058b2a1194234c7c32b6f06c3c0168f500a40d6da7fb939cf39017995c315b581ce3f0102fa4645d11995c8a89d86cbd253c4d0b86cbee240d54cbc0be7462d1476ecd1bd3477e53889171e959380a06a9a3d5aebd9a055600e62ae776e619d56962d0fee2fd32bd0b5f3ffeb96e8ae4fda033bfaa7681d81adae490d661847a8e7de01e66ab404834b70fd3ea37c7aae4f614058c3bfa7f7879df42f902850a14adf57191d3edc08799dfc39f9d6a9715975b65f5ad47452102a98afbf9e6a80f5ec714d48a23b7fa3fd44ff19133ed2643657c1356f876764db24c2d31461310e6ce862bd7b9db9895f70c24ffa5ca9fe8da87fc9ae78521b72482228b572142d88bd9334a35be46baf41f8f53e6f0d65f3594c47083d8eb809937ec9ad6d2e84eeb0fef68c0b1f7fa2c91531597499622e92b9c13da698e525a987b8ec1606aef689eda6a829762b85181972ae0bcedefd845976ea060ef67d45f11b1107995b7f743aa22ba025e729ef4ba11e000000000000000000000000007aae91e5bf0caf0c031a3e9550997df3828b0ebd941cbe2e7019d4800ddeb443e33952cbb1c1789bd83884bedf7251df7c64485bc412b460036eb932e519d2fa503ec342751b4ebd0feecb118591393370a0f4bae5757071e47a5a7bf8062484000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000005c83f719d7fcf8bead1fda5ab81dc045e83b37f61c2ab444722fc0d4122f68596c7d5fb686dcbe3f7be992144d81f18c271d4e658d7e258b2f56c6de6e0d29cab8f645be5302a7713ad3b1ce853a908cce62843da54f1f08430ff7589b7be188439216b31f69a324bf1da9711e6d682445b45bccac304d1b17f818aac7feb98fa425737a9f187a42344796ab9fee95d21e3ea60021b6ae13bbeea2fd23cd5f3fb9b9aab852a4eb82f6d2e76d27f46be12e61f4f6fe27ea05b4b25f24520c2c53776fa3b50ebd0f0a039ccc4bb095fdbfa45983b7317027983b64143a5fdd60c2a98b1c435ec4eea6d3916bae792536c695c620929e34480d93e50b12bb37c9fdbb42cd18e0228f2438f880fb143ef662e161404f094eb151c9ffce9feba4474bb328f04981b22dc108944beef07179f04b10d80b7776a242634f3f172d612652dd3103ef7128d1564ef5cd78b3f9c63f1e96229ed3c7aec225edeef69cff276dd0e36c3694351d43c65e1fe1ffa0f8870b2f75b33dcd5cc89536bdd46be2ac2e3f2f7f11ab8aed7b5b0a98df2e1f23f8bf4b0f974624528c26be32cddf1b405cbb63efd8350060b7733911cae60980d36f536abea85049d6c9b98686b1ad6113f652588115675db82e13fe3c0ba029d53577f122b2c60ebcdd8e1dcb4c174e4b2f0478e9a035f6598d8746debc8613161d64f7467ecf1d8812b95519574aabf0cc35b4df2e2f645274ddecfc9692a7d99656ba8e1e73f558d6ec50bd9b1b350a80d08cf84edff3bc2530bbce190c55d67f7680f237288b4889d8d9a6558ae8d18b4c3ec56aea2c507d073c63bafdcbd6a476ce2fb2a4bc0db4655d1ce06d8b075884157a7b20804774990716e970ddd620e2b1288e76ecb9ee40655c2a763e379a32707d6e0458d3ca73614f2109dd6873f8bf177162ee4a03f71c8f340e884135908cd156075c1811dafb49a2b0c2b991a92f137462b13ac931196271656ac146f3633cffaba86017124e44e2a7223de0fe2d03c85baf666354f996632b5dbad58ff45c38ab1a5dddbecc1eb87728c6c3acda2381f3c3ab4a3c3f02759e8c0b4b427d681a7af03299d8887a382342f5b846898543f861ce53275192d239557bc66823593a11595b390c678dc98fe696d7894f3c9639770585bf0dd2a9601b578531ec361f48f5c3153c8c369aa007e32eb528a9358117919545a6e94d694b6cf295f03cc1965d787404dcff091e1ade9c35a8aa7633d94447523355a98dcbd0a09a170a1540eeead41ff36d08f36ef1b3c2bf28c00d3650f5af081fb8f67db09faeede0fed330b095504a96e45d26ba6fd625e9fa44311c28265c5329a1babe0312e68de24e99f3521624316d38f79d16a11e7b6a984be19345acc261608e6796114b345d8d655b4447c1974bda3a7faf962d69899dc3e75c854412b61130a028d76e7ba88c1d6c79a3b587fc95a5f50ece4342999f34755931b6dc82f342686053f9b2bc19c6f7cd13d613edeaf0cb01fe0502a9c302cd4d85dbfcf9e3dfba6a22ff5ecfd056cf79c7051b0afde974ee23f679970010cc97892d6254b6b9626da5df5c8277af74dd6c07be598d4dc5aadaf389f8aa33f0075f9311f18dc98a1c24673bf7bc86a28d7eff82a0b8db1ed6b05a1beb5857b19bf644f20184093483f1dbfe9bf6d1369afe8da2a01809785dc74ddd6c6f4fe4cf6f375fb6d4da30df4007ded7f89540f8a63d2828e91b11bdb82379fc76d3a9e5cb06c3508f9b377a77eedc057bd5078f146ab635cd44eb7da51abe8272d0a1134ca8f0b9f9834582fb9da64337e37a4a0df6a4f78cf0a56ff3b57dd2980a3938fb249be8090c26f730da78028fbe144230528473bb73af1ff2af63b9747ab8c4acb6853deb463eacf88c6958832be6edd781aec0f8f4cbc5562a4dcd015798f5275f43622f912f0fa439a3438cda65769ca7329959b25f188ece6d4e8b4a41808728d8c78e83775e98a6f94422cfedc62f493fe3fe89d60b1829212b94c12e78911ca32ba75bc104109db51130e92263abcf7f9a3227ea50e93a304cc8e981cc9e5225c4468b4f15d62be84b7afe3a90456eb0d91e82dc0e7a460504800d9e2ec4af72ac3e5550995f3a1f031280bad64cbc3a37680ececcf90000000000000000df48f300000000004c114e0933fad8dc10cefa5dabceba921c6da649c39d0b9f5761b6817bc97326c5e8c774b6cdd5dd688ebd70012b6b1dd79e004401e21c619633d1711cec9a4b63b31ae293f4a42eb638f15cae5bcea9cd31c82ab180fed0c86daed868e310b50000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000063c2b1d31e04f16e943e5d7f10c0b008a49da5121ffcc04e317432d0eb70c200d9ab53451bcb355d6ec0b996ce7cad0f6ead701c2bec607fb33db9bd89567ee62a196ece5517e861a7a4d523dd927c735a4aacb8a36e3c4fcd621f8dc0d796973c5de1c88d512faa5919137c9e816985f6f365c31f6114cd34a72602c044b43684e3aeb72453f338a79106c1ad4c23ab51cc138fa7f566da39506046cce6ee6bed44f3952de4b312d54b211b5383424bae34e5f9a4f8c4f5a88b8e07d55a355b520f10ccef25970d1d10f09838c454a00ea57aab151504da93ca822ec8128731d68c6383c0778f11790c65c233cc465c922d6eda9613297ac076c74978f706ba22c8bf84c9838ac6f82759bb5063b2e81ec3f667322b56c30749cb72e22d50102e5b4e5932be8778794e588144df1f614db292eba7cc0d99e97d3478e0517a06cd930e7ac586a260dcf80426e85feb111bdc5ab8b04cb2d4af224c2f055535f4cb11276b7f0584ed0e3408bb13061829683b1b996d3552f93bedf0e95a4c95ba5739f6fa40e4233738178cf69ed430ce7f51a41364883a6b2d1d6f3a5798469a70d6144203c003fe349b7643f995aa2e96342f69e76d0398e34e37eadc111d7eeec331722ef0a882755fdaef2477478690c0db2c2792dfce128aa01ea61791f08d1d897314be4004b40d9c6372bd0dfac36fc09187849ced65c1383c37e17c983eca8b33fdd6b6e7a78133d228696e6003bb6c17672eedba70ca03608e9c3f268db21dfba453e6b918f69287d84864d35cd3ce96dcbf1eff5657635a44a7707a2bdf931067a539e9aee7234780be88b8b70cddf29c6f0ed4e24f70fc00151d542805ade56f331df26e4a3fd2c4c79613893f94bc75686bde1f9d8063875f991f1dc4f87e3d93a422dacf7d3c8ab4991889db83eb429a09fa28599a981c09d4130dd208c369b847fd070a46b2ac44412c418730d5685dd92e008f37c630900208f63dea00823c5971c8cc578bfaaed1f79d1965331acdec66bf4616910a8b15d4d940469b53cb31879bb88dc4d8fe4dfd5ec64a43717eb667de7a7ac8a3e0ee5585fe1b56ed8f9e5002971335bcee540e33f2bc4397086a1e0f211db43a1b0b7e85d1a3834d6daa92a8f54066ba54eec7a474fbb7831d0bc21b8585214db6e5e7aa782fc991c86fc293208ee899d4fc41b5167d7c4ba92ef1999fe25d52869e8fc84ca2f72c5a4ccaa713026bd462f4c1ceff38d47a384d4fc0753f3dce4f41592876217535f49455a865d3875ef43257ffc2fdf29af567936441a0d58b6ccc0bf43dd3a7952612d62af82b62b46768e773649b647d185541cd21e23d83b920d8bd47dc569dff404c92e7d6618f5d81c846b5ac12119b9a7d76b6796b127acfda75e3ecc5a93c9b78fc2cf41c5c9c30761c8b544c1bd8cc84b385b6370ae2da7a5c412f8eeaeeef30c81fe637a2e347819e304a36e5e35e47f4f343f0d5eda66466707183aa94c1ca6890fe44ea5806f2605b4d67e1566c0e95d6263bec9abf30aec58d1c937c42b29926365bf178064f556af0d3e0db37a0aabe763434bdc5b9ae83f3af1c43d5eee5742d7c7a3e281d1587c4420a1ffe57cc8d9170949d20c635bd5e8f94b8bdc419191d1eeafb737e92c98bffad24530c615d2e000440c707af2fab879b9fc379da7d4156d4513bda2b54d7a6bf4fb5aa5415dd7f02e72122270f4d97a36d92c996746a812e71e1d0e81ac1536f2bb012b868e79bb85f5a336764f7f68bc35a5d2f981af87bc1ce39b70d9869adb873e62958642ae04070911feef1815c5a5ae0c0f88e73232c87d6c201b2bc916a5b3b6704eed29a96f17706378f4af863ea6e6bc79cce69b06cb5587248e6482e1e29e1b8e835a279415791f2d75469fdacbb64018a595b9d7eac776e46042391343c9b3d35af202055a8cc3332a0404ec7ca9f9486efc834a513598a24a0ac3fcbe4234ddd21e4c3af5330e42f07c1d78210e81654edd7ba0c4385f14ba5eb3dd3b7726f01980d0cbe1fa117565568f1059e97bd257e347dcd2da9cf9d30893ae1b09215b41c687dcbd50edc1a7cf612cdf88be3e46febf6760880526cccf39fd32f0c0f5fd3cba0f8581c0627b1d5c4616997a56bc091e9f04eca43e48324bd4abac450ee851637efd635f9efb16a9d190f791f0e1f200ef7e3c0af25f68ca40e4a20af41460d8c55d03388d48b7d8fd1dd5ad79f4882317203e268f6fe16aa1686f4f6c4f05ba9211511dba305c616f04e824710c53ac64671cd0200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "6553525353", 2, -506329446, 1991772603, "deaee0f5660ca34122ab9b1991a6a4ba8e0c512dab5c0e9d0c11edd331453d26"],
+	["cd47f70f04b88754b557b57f436afbfb081ec2ee65580e27e891b6beab022e1d4c7d4bf493020000000652525353526399e734d2f6a43146aad576764895412a3d965fe994d5afd3e54328ce2649859fd8719f77030000000365ac52ffffffff80a346b5907ea927759edd8ce8f183bd4b62b693267f66eaa8c280879e0234f1000000000151ffffffff6a492e6f2fee7aeeb6161d00de4f64319fbeb799cc0a7ea6749aface2a8b5cf4020000000551515152525f30dfe904b72cfe040000000009006a65516a6a525151cd871c010000000001ac55371b03000000000352ac6a46ccdf020000000001520000000000", "65", 2, -2019719069, 733220448, "a7f2d02eeb72106c7f6faee6f376afdee55bbde80d8c2101668e257ef7788285"],
+	["0400008085202f8903738a9cbafecd9a630313bd06143147cf00d153cd24e25f0ee4d49ea18d52f7ee01000000046a5263521e5d5d90c5dd0760c7532e4e1240c257f45bbf7e1eade8ebf372956582b3c4ac30df8ba601000000016311d27a002413bb00c2d096ff84966c195e400b20773b385cac9edb47f0e9df00a13fe1570000000001512d6957fa037fbbc205000000000552ac5265acf4dcfc0100000000076300ac00005151da28af05000000000952526a53ac636a6a6500000000000000009f4367040000000004b69df2a92f849fb0a03330ce8ae6f74abc057983f5ebbf7bc8d8b685c762e641205dfb562b994885e1eb6bdf3298270d2da1c7499a60716760b6431ab765494a86533691701c03124c8c2c304d81a1da1884bf0f2e1e7233817d5010b10c9d8fb7d80f52961c1b640b80cb4e8d1b0d0a566d5425926fef0309a8c13287dabb295bec1d23a3ae66cf324c21fa2fd2c49964f156075c8b07b202a07f12171ef5f1412a1beae3a31cd280535fa636fb7cbd847ca0bffb18a5eae5c7c948fcee210028bad1b823248449d0910eca7b30c7e51e2553f9b8d2a3f5368da30d53e32f7db3e54afd6b606f87a826e9c326d494afc10cb911f83c6b91beb9aa5cd35d65ed1178081310d03ca0848ae76d1a6fe2d4521ce7bf660976850ec32e7e1a05fe5cbc18f1b129926713bf77fbc87d467e9ab90dcdbf8a44b90a2791bcfa54a5207ea305c616f04e824710c53ac64671cd02000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000f0200b3ca28442588f1c4b4e0907df3f2795626371b00eadeb592abadf52e8cbfe09cef77ae382c0b73964261178edfdfd2d8c9ac828972d809b482b5e523a65bd7a0f547b54a1723e640a42d42c18474e9f10de3313d4c692276870063c52b580bf2f4088d4676c125ab90cf0dd8278fc101bff12743ad8435666c054b4f5c5bec04e2d69ebee50543fcfa467661de1f0474d34be2681eb0b10f3a7a3ff9f013fbc9c552c6eef478a1b4e80f6ee1900af02a69b1ac24e3645c8b6558e3d0cf3785b3a2ea04e825553cdec3ed8fd514408c0e06ba83b04daf70d44ab3d997578a8a1e280d368712eb7e6e2d8d96f4593e68480e7fe2a3a7c6153389c745c3b78840d86d4f2e0a6a57b415708b2e4ccbf508397ee1004c90d706233bdd66aadb28d7ff62f2a24b1360f3484d44e34068c0c2ca559bb600c6cf16fafb76f0809b8a305c616f04e824710c53ac64671cd02000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000b0bb308bb8236b8db3106efbb7a69d9df752ae131eacd522a4013c84724c2b55fdce819f2201f69955d2a4922426109e920768459b18298dc9228c609d35a2084a34d9e3328d535a8be8f3b96e8e2d342631b5112b03f03b9e8e1fa06613074af919505bee646411b2ced66f341356b1cf9048e8ce555c0d6c774ffe19c3a4aa993a81b690bc429efa4ef69bdb4ca1b6d3acb7bb5af7af0f7b18e3e5ce9bfb66d4f76b95070b25fa762046932a13bf79562830f8d4671a310712b40182d78963af1141bd5c63129db04432c5f1996fb4b5674d09737465ebdaa174e1901bde25265cc59583cd56f911c33161a7cc12f504216134cb57bb9f0001c7429f4a8fb6ce7ea6080213ccc542f864cf500c85bdda6a4b5ba83c74b8e3f2bb0cd7c1f142ae9325762508cd48e4d16cab53d137ea433548c53e5c5b61fe997a7a1c6e75afa305c616f04e824710c53ac64671cd020000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004ec185480aba0f45184b291be0a8870d0af454def1a6ab26505a4c8d7875300f02fa253aead2a2c939d0b61c9a2bb8f54ccd56d165813f94eb159224c4c9870eded90124220587230ff1a93896e58e209c09e55ecf66af8ce65dab95512d91bff03c6bb7841719cca6160d55f9501c1ee6eb6959169df00b093a539234aea9882a1ca3ab0ea56ce501b971e6851c0992d06bb7adc2a132d058b1ea435848b0bb593dbeac89f0287d4b41a54e0f2554be3db65dd4b74bd5c785abe028c2b56b0c37d7d154a657470676dfd03e0c217a65c47605d33b993468e120bf523e4c70f61aa0f14694a4480b93628f6e0380e5cdb483d0ed1dfe64d1678a26f589828dad4493582a980ea909a93246aeaab8454ef029fd266a0ca28a2a7769c12e789578e6e74b7ea17387db2c61c0326cb58e177f3d5325615a0484b54f373a6c7c6dd8a305c616f04e824710c53ac64671cd02000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000042381a5d3226136bc9308bbf1d2db9ae834b3def6414212fdb5680e79e6cbe518047ab3662fee1ab7bcd45658eac037d3338d786aee0acb943d29e6d61e0b190b5b2675cf35e92bb1790d0597ff454787e578ddf882f551c59a2de800c53c97722187e6267fadc53b128ae19667e90ab0850a2848f68e76b1047b0a846a35c0721b33e334fedb298f52a1959a90689761656276eab1823fd5fbac526d79dd241f3cbc2e3d5557d778f57e547aefd4e2aab65876a7bc6045b0db89bf5504dbf96f1a30dfa16224f37b8beb3562a57022e21b712ad080473a468d1165aa1508d9c9e9f21ece452ee5fcad9485b112523a7593f9ece97ae12c44181a9c626db1259b28438a46bf65c60c6f15803ea438f551ca1294d69533b3749d12479ee9b28687d8145c8da359800d6255dbff9735191c55518f9fdbd7e9d97739e97aa4c6c2b93ada61a3b7c4255970b3eb7cccc4707f26e4917d8d60a1af323ce77e5aa5974b5e2c9ef2880a613daef226bd2a05d8610c905360b52b037fbbda157893bff3e929a9b1d9b56c2f073c13c9a740b6551968cf3c62c4bce4526de0e21113830aaac9f594196da8fb0c72622f13aea84efe762702d40f9d47ae991dceae4340e357c98bbd1a2093936661d24c007ba1d4d020b5032b70ace49f4d9d029927e21055b7bda010353bfe98f89565721f1c3012d7f2e21a5803f64bb3eac862ddc6fdf9d7602ec15e5c854698e848289ff35a3be530078fc269c72db21bcef803ae27e7742b68542fc96351f3577fced844152fb617db9729da32d77a956dd399122f993c1da1598dc0d95e93a8a10221884af0e7072021ed04c15ee050535dad3a871d45cb3ce76cf06bf96efaa10552595b80d338f9b5569bcf87db24b1de1358c2abbaa416360b56e45ae9eab434ed29b9259f8f16d44cb2c0024556da857efa29a06bb59ad1fc17ab2d4b8ed9df8b835c764b135d92e9865f0f46061bf423a84a287b22602e1510b673816ce1d3c63070e988f21352530e484682bc3642ec41cb1182212c034f9785d23bbb81ec2aced9e1893473faec75f4885125694aadde4e017b1f77fc96ba109e31d1767a58682f97ef29c8f04aecaa576c500029ab8c00064105a3264e5297165d0e4bcc6af97f243eb2ec0230bea49cd498962885f510bcda1aeb4f595d490b7c3adb9f2df1d9e99372a6715a973de8764f09fb5386ca203197d6515c1b9e116eeb05778b64b20703b874e64f18951719ce74dcea975e9c07ba45bcd30e35a53214268bbf12c4eb685fd7e21ded7d6e3de45a2c4ef88ceb8568e2e6f4294df4ab3282f0f178d1681a8e3dadceb55b5574d839a964efca9b2efc7c4f35288064b4db3c9a6e84d7ff6584d91562c5d5e92fdfa1eb5a74b2532290b94cb32515a1aa08a3320087aa6d7d680e3f66e5feb490858cb9798460695566fcaebbfe7a06da16122a57aab2cc88d5556e83b13a966ee78f5b0054f9c90c1cfd12926560df94732c144d350153111c2cf81a980d36bcef55437730607c5c27f891c4f3bfa4e79c97d8bcfafa44e1c238cdf45e2f3e02d665f79dd28a26ebc3a5b70083272acd278ae94ecb07989056c6a39ae1d96804a9d757920bff827bfbaff2b78a9b06f828f94530cff8ee496b08c5350fb8bba50761389012a05d0aa72402c26b70e670e57fefe5a8dfbaf3fd21be20c580653d1959d42650cb659ad990f8d0980e02edde0dd0669c80d409becd9ff752afdbeb82564d49667692236f5de7e97ad17a42a5dd2a72f7c58896bd627a0c8f4629718f9823aa687c296818cc27e85c54bb62b41339ce1aa76ae8b4baf72e5139534d9438516966549de47ac19150bc8f6f85bfd8b0fd5e34b46d936faf6d4a695a3f49903ec6c9d3017c924d9c04343d1ff0fe77ae5869566fe5eb94ead6dc7d09d1aaff81076cfa1f5bb1bcd4fec8c975a90697d0ebbcdea16b12e462b8b78dad47beb98717a2579072130f89b8ff6d1a2573e7eba36d81efdf51f6107a5ea3b89489821f41a955ba726967209737b7fc4400cc30347810df724d97472c5a33ed58d1e5a405cb4a792bf883404d23f3abb9687bb5846efcb3f1d0f687c754b071a45e09c694db5871f032e43de24bb0305002d1437d2ebf016da6c31aaf8bf539b5f53ab2741cbb5a9d095626166af839e5346b78572eb08eae3157f8cec3c559d48ef1af04c279a8337a2c04bcd71b7c5531991e99cc7e451d7d3f3e3b6f486f69184ae1479287654fa3becad4cddd99ee9058cf8dc05301a4215e5ebfeeb6a5696c197f0be78eca6308b72884b6275f5dc634dbc7f003af8ee607dd017db65125f334787007ce8f3544bde7c808020a454b53308b01ecb3db3eaca27ca0821f23381e799321386c90eaab72f1aa8f552567008098359d09f7a8ec629868a2619323fd22d41d16a3c83c650eb36d5586df88ad62e946004fc95a7473fdca722d4ad27f0b2c947bc1486c1f4de2d7ca538f8023acd95b25d4882372bbec0f8915e9f65c8eb20931d4084dd0b3b2269ffb5dbf7fd625f5509a638228368b575fff5ce29abc498b9d2e391c6eca2702de3b01b78adea211dc378a9bc9d132f521fa0db39d23857ec4b656cbf2cf1ce89970e3a4055a58c99fd9fbbd98321a7f3e403a4be6ea7d779c05f7bd308b80507962634eeeb81f34030362de602797cd48fabd22ad85689ff39c88ea8ea4dc45d8986ec3a04ab856836fa9f3ca021c398d2141f23c6e0490a13aec8949a6359236248e8623a3fefff4bbd177ec2a66475ad77c645c72ce86701ceb2734826666aa0cb6e7f4601d3b824884a9d51a69634c534bba06f7913f5c8bc934390c8c3c65f5dc189e40b2438c42f32b0017de565bece0b4a19f3120ab054c1672b798eaf112502548c5b602028233fc232995c40cae243deb8f886a6a0c662334b68850f5a75bdd1236e44a18512b69bf839cecd25ce5f425cf294fcf13c989035dd040273da99e2a4a887f7d13ac1c50ae4c55deddd86de2c5f304ef6dccfe5c11226178ca7570105579a0e713acbd1b9e703b9918e6ad9c38618abbb3f05f5b4ab69831994daa6352655b993827197efb07f98afe84f29c362aa2f38d8007974d9c13c5c892fe918440c84804f414de17ba2f9a4294fc54bbd89ce97bbead8f18e473ef99a86edb4f97224cd3aac76694e38314ebb5cb0b5f51f739eb16c811cdd3b53f968ee08aab04a08a331747c933b5a5f0440ad0aacf2491027d8b0d06b4e3db043dfa58bbabf0ae9e3ba7550906940c849a7b30137937c20b84d61e1bfd5f33674a951cd226d64d319e505689e11ba14bb199e6dece755ff52f4e44170a127cf0b3a29a77be385ab7788b82d331f90c7c1f1ea0611e1c38a93981a9f8c1d0c6657bdeee4399adb6d3186783505703f36e7279f4f3c391c0bcda68cf1f23ea104cbc7a6c272b5a1e7267760df903ad1da5991876467ff0408d2bf1a5150a216946d21ddb326ed83b39027cf7837ab98a801ede97107335fc6377d063788c9b1d104dac813aa1a68348292fa5ea6647e31adec803f395005a1af9759843fe5f876cfe8e4ff898befab39d951f839ff59c0038dfd14cc79e04fd05d83700dc7d451fef2369cee6269fbb7af6e6b48b990804df1a3538dc769a340808edaff217439140bb757cbc7841d3fa2b05e711e83be1bd2024e1831f38d689c3d707f62a14d8cd24c24616559d15d1c0449791e6507de312eccd85b18b221b520c6546f290f3fef3da5ce0233dfd4219f763fafb5b9307b869aeabcf997760f099f690a7a90df1280741b5db85c1587500e56b31ed86ab2433227416cbf88d93f7fdcbeb34bae0207b68e27ed4b1c19bf42b57535350ca1953847e3e18739a9cb13d2f188556ce78a5f884eb2765fab7c6b88230a32c2282e3c0d88967943248ed55f5df450c30b88faf40b84bf2609dd0d59b0eea90c4620fb771e1a016eefa0a022347f1c61b5a5816776983becfd0c576ad201edd8279dd25fac22b5785609f4d08a56e1c436fb7c9232f68cf25c000b009790329121e9d329f6f740f0b26d23383d0aae4321f24276fb33e016686e976390a3b051210e2a33b69919f2dcda31564ba7f7a164f3d03a2e645aadf304144f3fd381d71ddf6d4c1ff7437635680558bee1dd135c3784d87c5e0ae70e27175e212f7d5ba568bc506b9955051f66e3f4ef3080c98589c5f6e6d4ff750cff0f88f137eec8895e96dc5723618233f2c47ac0baaa9c381b45e8945968e5127c1f96fbf50fdbfa0ff2f95b8a5a295d62cdae036d2a1ea2e1a105350d15ce55aa0c088b74d9921b08c5a262174ea1f3ca91c44f3f6e7ffc7c56866853cb08ab682c58d8c2819a24aa2d5be439676750628d8b16cdefe8c99e2baa75c0531133f6f64ddd0b6e315adb80a3e58da75e7eb361e32d935affcf714d163eed37274dd0e39ff868a758a03095cafb17f4da446cf51862cec252983a74528e138b77f960d329bcd4ce26c675e04f8002297c4d2427119b90fa3e81b70fbed47af3dbcfa1be4e5a4a1e9f6e70f666faa8a5bbeaa390c7ea4b7348fa03edfc6e0757592aa16820f149c7c1d9f39106c539d61dd15ee3737cf0cda88d2e01845589d2d5cf1c8016dcd63b655f6464475e2de470a340bcca43b0a6ce8f509cfb753053c5f02ea29328510cc3a87887b78d1331658dabad2c1cb943ab1d462dc172a10e49155863336accba43ae1a59c9c5dc331db72ae069065d99878e2c57c4bc2467e50230326e66bac7e5f188a0ff08eb2ca08af1052c30d31d75e8f53552b103a58c86e54741a978ebb53f83c86a62edf90ed5dcc9b2941ea91d897142cae6803545ace22aeb7d34b013ffa260625929f4cff8c0320f1e7fd8781b02dae2ae13ac9775c577549c308c7d32f229466f2abf7557d1a4017454d59b149491943e0b1b1d9511d824c3ef890f3d13aabbcddab098b125ac14cfc7512b1db6323501a3571d6d9e125491fdf658dc3802762f0c553dbbb2c4ac0ad8f0e0bdbed00ab1969eecda1674615f4f9f8adfdc17f53966cc03325aed171c6b4c4709ad5037720c5ed366d17359698d9699d8487fec7e9ebc0eacf6b9049abd05410f02b12e8ee0cfdc66fc28547cd218ca05f3bf08cc81cdfa7da3fd177e837965014e2ed19cfc020cf0bf3a3364301a2605a6e292d214289a2caac04ae1ca3f46b13b7ad8c8ae98407b0a1ba56a26753cd44c2bc58bfeb541cb427ad7769a063e4bcf91f489054bd8d6d21b1a27b1ab575852e7919c28f5cf772346642fd9121e239b1a39d8e3a4794b710487874869c1625dd6a609bf6a667945d1c750ce9d4c13f241c723d2f3ec10000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "5153ac51ac636551ac", 2, -513775575, 0, "fb7131877679ad90f0c430b5fe9752d7a53e100845a0427c98c37384edcc9806"],
+	["0400008085202f89034d9507d67c44e2c70e4907126d8589fb1246b83b2c351dd523082a214b1052d5010000000965636a535100635152ffffffff25af83a307f7aa8c4e173c6f78bcf5acc0caf289034435e18fd15c79141b0e380200000000ffffffffe7e834fe0fa5f17356a2922ee39438fa3acb3ce9c068ad3222ab4d5baae1408f030000000652536a5100657963ddaf018018b50000000000026a5100000000b3d5a80559d3cf01000000000457dc115602ef821baa52129b3af82a0ec5eafa2d09be1ab963b619a20c2a18c5ed11cd0d4f2190bcf8cf2e5bb665d352b3cd9e25fd13a390ece4f2e91612f646605e104c108e3b6660bd7c605d890470de92838d9aac27c85fc1e69dd9790c34bc6cfd4bd408d3edd795bab64c885eba5d11d795af279b931f7adcb1bd460eb3d984c25cdb1d07e3ddf819c3878a8f42cbd4ded82d9d1c909ab3d38b8063cd2f9769d6b915c16622c377f308cb6bc054f9e8ad6cc6d732d5ac790e38496b42996fdf2caaffef1913e844228d6a4d7e8a0fe511fb5b14d0ebc4c0fbd262bda50f80ef9797dc25f27f3a678abe910ffda1495778aef786caa6d3a2cd1034924a3a14daffbf5d3075570684623e51a0fe5a8512e500ebe31db2e3949a1abf4eb6acbee867557b4da5055212d2169f494133c8c1afd245d6016ebc2bc7e5a6867a9f9369015a90755c019276877de55dff0b000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d8c4a1204908c0949dc2b7e92818fa6476ce1dadaaa18bf485c7023dc5ea04f263bafdef474fc6f452b29d631c97eaab64cc513d47211d6d3e7a4e55bd225d0c5a123ed3783bfd66388ecd6181830f6a810a7cd949d9841069d525cc486919674134edbade2ce350ba47e726370cdccb6fafbb0c04483fa38eabbe70e722eec28477c92d3da5ecaf7ef5d74df7aba3d14ea97f2b606a228b3298fda18c4a3e9a23394845819d1baf50c3e632f9668113f910c2037f340a9d2240420d244c8f0e49076a4caf88a39faeb832745e3b949e88bb09d4f0ef63ce993a39c545a5986866bce687a40b6675e1fe2dbb8b78d5d92d0c3e3f4299ee2ea847969fa15068b4ad5605274631b883ae61d8e788c7d4ca975b1a3e684f8f1790849f82e38ebc717dfac4e348a783ad441a622d3904d82197b640bbb498976e0fc29e752e14ef8c9369015a90755c019276877de55dff0b0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000005e9eab1aca05727486c8a12973828a1d044c8c00fb05c3d0b0b5e1fc7b3b243ce254777ee13d733e3f4bd5bdb438388d791cae11ea254c07b12b6123b2a60c661ffb5fadd15fa499338dd4c1f9576ccb4b1e8b6fd020970d8e6ac76136a0ac926dedf1884c06f04d0dd03ce1aeb04a29cca52b7e85d260526bbcaf7c4248d6cace4e9c0238f06740d1910b72fc19219ec7fd06524ed0cc16642199d8659d12470d5df3d89c2ede287ef3cbe1477f6024f0149c843cc4149aa69b549a6c3ec687d27e9efd9cd164869e34e68524b0065c8f0da95459f0221bd6f02017af98c65f7fe98bf225f7e482c07474f9a84d499d322ad4c5d2442ab8975b9d3eb87db23b423c5b2e6eb1d629fccd1ce3fa00355d515cffb3b8cb6cb73be32ffc862d01f71d456ba5c7f13b233d07e3bd63fec5d8b3af2b27063958701f8808467887488c9369015a90755c019276877de55dff0b000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000bea67f6a926bcbc4ba50340bbcec0fcf21862a03e06e94b2cecd6f5314d7d659d4c72b18a902cbe867f969568e912a91cc897a24d1d46a12401600b405e5e76d4d6bfdc6c860f238f74cbbea3f4e735e42d9b7fc3c4a78dfcde090eef06f2419b26f3108af92085fae2de52f782904090e6fc4c244cda3d8b6e4353b232ff2a4edfffe3b49024585d1e338930ece72f81424e2278776467ecbd50dd9d63929ca65d79dea04ed96a6965646f274f53bd1111521bf858a274e549371fa234bb70f21e1c6640889f0ef021fc1c8a992937c452c2549d5f2cceb38523f33cd59c8e1bba02cbfdf72d8fa663c38d5178bc7cb6aa5bdcaad25fe3d001d2e4982077c4787577c34fd7b83d939dc5125ce9f199353db21103896fce1f704dcee84591d6098f82d19ef7d8c76af4cd387a0d32f9df2007d1ec58c456ca2ffe94604d1fdd59369015a90755c019276877de55dff0b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004a8e5ba75a54b387790775878b645a18c0914bd31c1c97f705786ce620d0314e429f59566db3b6435c3b8b28dbfc745a937ee19376fb6470b5d0a55aa83d4f25946c009a30f32a7465dca658265dd702596b5f14d66964170fb235972c871613c534058a8c58d049415ed759482f31701655fc9588d5013885033e10089b2def6796da8f720c0574004a54e635e5270200c5dca8500e92b2bd086f2ee669025a1fa191f1bbbddccf5ddc4fa62c8c20d4a6b692bb1d13f3716a65946c5993caf882323329847d35526c044218025dc6e36179d9045b9c6db28267967f5d135edf2edde31d4f6701bd21661f6a03e9c006b91454a499845c8eca83c48507ac5e0e59b967c38ccf7c1b3a2708e3562cd620c41d068281440e9690fb738db0d397ffcd6a85024bae5d9fd21d01c16d7695d11e1b51ed1541b660ac9407a696d075fa0e6bec5404bc274afefae92aa5e2425e0c1546b36b100ebf3aadec610c9e8dbb0f2f951d72f4e8edc32ecad1b0cb545721a095130facff54aeee6d0f94dd70cf49db370c5ae9f7ed29ddd09fea5b3f3c9ee62959a769910d0fd34bc2120a7584ce546e2b2679afac263e5e81d61058b3385a4735420704f694e6061c02580b3fc737062e5efce747de9113203d47d5d23d619aec102a0904af8882354ae3ce7201965fd5b4992ba2c4ba20745f00024e39958a22c399ebbc1f6ce8073c35123637d127c49c2b7ddc1b9110bd81d94e7ddd837a5de7fdad23e74886cc9a8b69fa4e2f8a82f01331b7db6ef54b69cb989809755e89bab88a62bf56f54d13023366dd35e6e88ee655c3a0674350a47b44b9d4ce25b3eb6eefe4d4675f440d083b19991df17b2291fc950a52118d2e74464eef36b571af0c374284b28d47033463ce1310bda2517f1cb8993c6b0d63a992947d3ce80386ab332ed5cfef81cb0198d426848800533f4ed35a55ba95f78245e90199eee46a8e4a10b9ac3410e6b2575439937f5de69464bd259fb3aa54bda97c35e394574f6955abbfc3be5e0ada33a383310c3a70b56cb44cd454b611465ed08825987fe92cbbd9d733a0c1039354953b4860ce376e8dc081467f5f81156b2e4670568220a101f5dcc57a87a69a71ce1cd989a08f733cb16791b42dbcd97cc616e99416c20c5ab9430ec4a32f003c50971f8e8f4644cb8e4166e85eaf3df70b50d67cea92e72254d8cc8a51afdf172623666a0ceefcf0c00a8c43147bcb0ca0d0310eb80c9bf0e7ccf80586fbe1b0f7e26f7fcdd4147ac27486b80123f27e62fe18e144e6088337514be1f00e0a96001e0986474607de674a7c45ae9ac5abf6a0d994ae0f02bc36c5288b615ab9b8f140a006e8b8a5be232a01e23b7336242b831e8f2d71ef0cd597f2f9c99f0338c923f4a9aca4506d0599386b073e7b2a7723f09cb59299a3b2f74e20333bc6e026e114dd70c417fbdf4f9471e3ef1c3d500068e75c51087b34cf6b6b077129086996bb2d2f0e0559e65e92ce23bf6cccc5ce97636117da70eb17a6a074020221116d3b3356559441c47fe5e8e301a081d024e6b2aff193d16003587f32826e987e509978eb310ecc3614f216539ca1cb31541d49ac8a5223dde9c999bd59f92353539b843f026989a806613177e7079d1bd7153038724ded53342c451e65f7f4a0dd1d325c5ac5dc97bda355b211f76707ecbf787025dbb430be9e09343e5f0ee6ac52269ab41488f73fc8fed656d1780f80031f6b5319532c75df8fbc4dada60dc5d34ec3afaa9681d891dbda5707ace8d24054079a21fc4f57ce50a5858e43ae07f86ddb7842d2d09adeb8375c2a9de8656775cb5c7d11232cf71792b311b4ebf173eaf0d3da8fcf8111e6994fe702267120a5fa48aec62502913b62abd608e891c242f9e35cacb0e72b46f929e2717d0ef2c6b6b3eddce9a7eed5c52a9b81759edaaa586c4381a19da12b2c95178414d8bf2c2ae74d734ce825495b80d3e6183d5481e8b915d8a5c7ee3c897b34a0861fd3cb44364b820b2dfb9fd595f8f5ac3a946ea0af2ac10a9dfb6af6e306917ee2972588f2374be2ececac3d6c73a1cecf92f012812783725a259647b1c3eb044c4225e5cde761e3efb89384dd4657c362277a2b7126a09f9603fef187120ebf31f33dca8997c9ee1589e472b05bd86fe786f2ff8d5fcd391907c4a9e93951895b318df365d71875a810c16c7bfb885184358f7c194d7ca2739bfa9523180e260117ce27def98e368bf7b5bc5ed86057a11c6c83d6d48e8f0fbc61809667f64671abddb19b5864926a06a603b7437b7594e488c34669d4c7729ba24b0ed71706987b1b0f3d9d85109b41f2b59b71b910e1703757cc3da4bd7852ef732523baa93d6a325b4062102456b8f65e1afe832b40584652e49c2244ecd672999cc135c01edd5841df370f17267137935004d8ffb628717722e13b88be8448776d97b6d7266d5f47ffa2ce6ef49119c053b0de3fea0ba6cf7d677a6aacb5c670d1076492909bca2bb1b058db58d44ae13255033c07ecc57b3646df7247d49ab3427f570fa793d8e3b23890513480b62e7dd2fe08791e266409b53cf38607219aa3ff9a92a9c8c3bd93d9945e976cd0ce507c2a7c6b01b18165db73e5c2b1365d1c6ccfd9848ee05d105db3417733329a1b37b754e13c8c7ed86d35736becaedcdd78b1de7628c82fc45e2d2483ffd4f521f588367471ed1fe46191f24e477f0ad395dc7d4606823f3d68ce6adff6877774843816a9f010f6a77d3504de13ecdd1994664a5fd51c18a140385327f5bc0eb174a0599c25f57680920e1a4494d96e10c1254efb32e05c17dd3c90c662e4d3118981969bdd221e4807649921255f5e519aa707e912391851eb707ecdd12ffc9d3ad31c6085bbf70b755a19b4410ab6542eaac4967ee58b7671f1fb29d5f10a8f9046c08a48be0f877cabadb5eef6dddd3eab4961b84c143a67fd44ae82c8fbdcf4e799e77d413a6f2123cbf2819c65a5f6f4e09ebed2be11c3c668ed5287ccb2234376d989a4f53ae87c1b738bb194f8fb2c5f7e8ef486da0b4e363f8b1f4c0d52cca6afa1ee771c2e526c26e5a93d1bde13c60d13e2968d0bce2c80faf175f188974529d4bd292253f25db300bd298a3ba9f5e2c8661046184e2bc3b3fe60d3e7a17adad280f352046bd60b297f4bbd71d1f8e1e71c549f9b2145cf17576c94082c7a3850accf8c6fc139c6ae35518a5ba1de3702041b5a118f9965fd298c0fc53584656ce6d96f338eb1857a65e2bcb84665e43806408bceefb7de7d9de14bfd02bd586026e05da7ae8ad5bef73dbace33025269587bc5b52894ab6c27f7711e438e1fe67dc9097967e6e370f04fa0e10a85c0841be57d9db092e23b4bc95664c6037b2cd97da502d09e1f3737779326e8a8fdfaa52a34a648f37d7ecb07b06262ac7ab07e0248fe87c4c6390b5c715b6c1ff80b69aa9ed2b090c0070d258814ad5700f53c1104e9010024cd60ea6a501b83ac0fa73c32f2a100dc81c9e8735641d9b02fd56fbfbd4c65eb3a26ddaf367995f3ccbeec34e908e5623a155bcfd06073a52f57bb4a072e909499e33242679b916b86a139e8f632d0fc2dcfb5a74c3ea57cec52c823b23110f813b3e480395930289626609db8b5a7cc2056763a829b737c353e830674a148108b8239ea9813e467602716d0ca0c1bb8a8566a7c4faedfe3cabe643e7c3a41a427707e7026e7d309805b4da7295dd6cf73c87c87567b49b7d693d8a0b696c327907f34db5869d08ea179ad233c6adaff487baa6ba2f1ecc59121b51df78ee09290d09cafbc39f3a9e9fe2a6674d0506b9161b979995093cb708fa8c5cef0c05974ddc0103fc01a06535a0326d0bbba7e7d3f72e7d091f2337a2b1a4b800b0870fe1b3d6860ec870639a26b540f33eee897a9bac6342382d92694057d60d105d510deac9d634ea6934aff1fe9b7452fc26c50bb3b37a480ca619cb176194359aeebb3326c7f124396b2a4c5e660accc29263163dc21d7696a21ce93811d1777b2f0b41e852303dbf9e1e334e6ee6842ed1cf93115cf366b2c79df1b61db1b9cb839bd4128c8d65e0e0c99b983fe994ab13724869a5685f27ee70effe5de236d7dae63df971d07f776f43c3aefb5cf3796309fc140a9fae2acfab81afa24e3df7c0e27643ed149651cf2730e2d092fb6361f84b6d2414dd5c26f977d2f7bee503c2e9fe37c6add202b5e1c7597f8736b3ee16b20e6543ddbea1a9fd1f845c2f804c6100588e92ff9d925e8bdfe6ce03847b55129f5dd4aed245805143a0967184631769094a2860f999fe5ecf1b46820e8792bc029c6942693e4e490c53d4854767b81804f5d2fa1f51eec158693ce4370eacacd70028d8b95cdd4b74b9cc3ab18413f3974adf15ce53bf3833afc6375578daf0f0c8ee183c691ef78c391eb6c9b3d23811aa1e2c201f3ead586c7e033f475b4f0c80a89c975f9ad6b7741dc6d095fed44ffdb5f84ae647ac0c49da8af5b027cb2a8bdc94197ef362e38ce9f490f512d35ccda00a417ff8d65699e0f07063bb3773278ee1f076f9d27c2135e0f90021daa860f06e5f137fec521b1e81489d11e4ce0809ac50da974aac54e931fd6dec5df9d3cc07960301e62774ad82ab60bc737860e3eb06f7d29132a7a2d5708c3ef130f556281c18b686b149673e505b59ff91dcdb6bd2fc7165e02530ca21733e0a37e62e57effef9fbc5ddffaed0a2ce47deb3191d960dc7128b22d3d01f37922e01239846695e0a631cc72db36d7a403998184385fed8276324c1b7190dbc95f52c3fe2d31ce7b4c8e5b22f521d22e1f8db465a68fddad8fb508d38789841aa38c2c0b897c3aa24a21aa49162ce8b1c6b9d752cef03b5976287ad6efcbbc12acc8d05dc2550f808610756f4e8770af4de91d7ee157404df0fdd6b77fd98f0133db5524ce2002612cdcee98af4bb9bb841f279f0e57a2436097466f79339530243f5cc96b17d700211adf18a43ec9abc3802aa14892c5babdf56946c8afe67b0739a90964ebcd708f21986a4b0dfc6d72ee688f20b1c0d0b186e18d650543979ee06c42a62886fff4e9cd3d4f36c0fe3a91d7b9d8f96fbd9055dbba130b9a62df20b005ec8df2a59ee0a8f4ba05e88156bee5a5b7288bffe7918da43df31458427c5a8a54d4bf5dfb0352ec147753a36bea90d9d8d1db4ea7b95445611c9f53382c0ead6f2f6950ee74d9dac04131cafe016594d91564b01b1fb0efc25d5a24b39e1127e8b834f8f4bbc9d9bfcfebc388304054285933e81d35c48102b8248ae3db6b681161e8b1e45c41f6fbc0c50bd4ea6ae2cd3fe6dd554ff32667507dbfafda906ef53ec0100000000000000008327750400000000478bb942bd275bf083d0daf10c10007fee90f2b123397d52243cba847fc8f0bba649affe12ada03ac9d8628e263f956f5222052cd9dcf1d5ee936bdffb2c4cdc9887d1cb80e3ab3f86d6dfd47374ea79c119821f9df1ef6ffb0a21cb6c4e565d000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009630ab73188802c1a44e8aa4173aa627602b050b625689d5d07934025011371c60e2a29a00de862126fa0b686704f450b6ab1057e83ed7d3d13f9a1b1312bb0dcfb7c674ebb271c86d49d309a282d1ff49bbe8c792d7668cfdd705a7389ff8d3f98490bf3a900da8e8542334615674cf60bd57f06ed2d7a6e5d1f996e0864c47c2f7ec5266228501877a87bd93cd788476a7d0aa1c938f37d0d4e522923d747a7668e35bba4e54e9abdc5f2bf7e28412518b9ab6a9dea2d931b5f20fef472f08a61d7bf09b224c2c42de7cfa20c701bbbe904739619c3e966299b5a1d00f855fade764e618e80e6316112e8f6348982fb263bfcc8cce1e24ffbd5fcc2aa4d309940729f271e6737c128b0ee85a5dfe1e1e0f8506593664279d76adbc00b95c7b04a2ec4681c981981f7cc60eef33900c47f715050321688f2e473d0d59512168b6edf051e83cee08bd28b85365e2530cdee20d6b845ac576ad205d227a3a9cb2491ec49f3cabf1f351bdcbd0d85ab55afdd02f76442e53fdbfc8ad8fae0d730c9777e46216b7115710bd00a9bfef4fbcb2ed6275edc587386c114e253a390acadd248db2fe94ab6456b6b27f98e8ac4f7206d4063645750ac41b44d478f7bcb7d78c1f3406da23093296f0019915d5d81f521f7a4d285fdd7349affaaeabba5f8955715f9a9a22892585bc796d8966b87b8ab73b7ed50fed6e0593a5023a516e11179e4e665fa763018ba39ac16260ad05471a046dddaad21cee51cc4b9152f9d17be6631e10952e72330e737b348ca52b95336e5efabe1f251b428568e1245ce3b7ece7e77484447ab3edd3edb4ff5969f711f2cdfc2d77388cc0985e528cd12c7337be6c4ee01fefed57101d7110b75ea44ad8b1df2a8e34646e207df24c99f3573ef75d4fac0385937d4e172b783bb7712245248b67801566b4b11b900c20d7a2f079edfab409cfccc3a50af29146d86a7aa4ef0531d7eee993b112028c46b89efb53b431003e1163baa961160706bacd24ca3485ec5f066f0207482ef48517057f6f381b799c0b9f472a70e13f4e65b7a64578bab64ecd6ea9b85bbc9a2b39dc0d29e20c7027b8328f18548d42238862e4c8422f314834470081aa2ba01961294f2bcf97630d7a57ae20618efad18caab4cd6179c18f81329560b9bfb938a3ed43a7825cd320847affa3071cbfdfb14a2207b3eeb00938227f2a591141ede1b48ef756c1032876a3406327e5bcf7361aa724ef21774cb886dedf1545d1165f9f376e7751a41d1e69c735f462393ccea486519edae6e3bd9955c8de3f3b2d9612f2dcfebaddd0ad2c65fde68226bbaa1ec696c862f26d0974fad1d8e2e50879747cf1c1565f75736ca806b76e2bdc2e6b3fc48719e767deca81037761f7254718c83885a8e26ef8db324adc8d684476ad45f77945f58d17d8be1296525e73d8c17a43c23eb0987979450311fa22d91adc9f9e97f69c4dda254b27b1b0d081addee002255eaad5f368454767ec83b3d1d2849d4a854f11131131feba3c952bdf0d6a34b29de88848fbb6d538333c869c20f309ead1ea8a391810f464453c9eb84e5289c2fae29dd149fad733aeb8fba40ad32d2836b10b79676d16ec4207aa4020de3d2b34f917978c8bdfac4819f748afa9efed35a006d24e405df5f3fdd7535a17c1a0502f63664ef72d3cbc5b0c547d64fa89fa9318365766449190e9248a3a6978002ff18caf50324a0e470cb77ee814aaed26b7b7fb67649da959940e197e2ce73eda375fe442d5c081f7111129960119567ccdcf509fc6e9945f8ae356dca6efbee20342045c524899345044fce10bd98d9c0b555be0aff3343baf7659298c53e5b892146ee537758e80ac6efc083097168e6500d81237726a1f830ffb7e8623f3dffcb864709d2554b39e3ffb49a4b32de211b9b84dfdcda36392de238525cb586fadbbf3f65cd8a63f95aa3f0208fbb1b870b3106dedc7a7a8de531139c2824a1cf08c03c7fbe26626e0d6bd2286c2e1cff5597b99588367e9cd9047b2c33258f3699b8b681850f7b3b84e7ee0e704da0ae99dd324dd6dbc1929d23d20f526021068ce3e63382b5be5f1fe2a4161863e5a94d93b4a3b8121112290da95a7c1e070ffa7f3a649012705b324c99aa6ecd348558c081b43500b204daa6ec590ca802842e2a8122af2cea42b3fac29ae2a2ebf47116d080351e0d417a8ec1cf481ee977f3805f5019bf7da168ee6eeb19171570ac4fb165dc8c0d60181cbf9484cc4003c4b89959274edd1cf63160400000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "ac6a53", 0, -1126996005, 4179206552, "313dd7d1268c5847022052c745651fd13f871f88175718218d5dbe6d3fcfa861"],
+	["030000807082c40303bc00a09783a342f37d1afab144684a60e251efc4e798db14a630476fc2a029b20100000003526a52ffffffff6e8cd354dcde2ca05b9e9910d7d76e16540ee673719c92289e490c46e65613dd0200000006655163636a65ffffffff2c07774aff9d7ba82e54aed286689cfd0f0334447467a1aa533ad68e961881800300000009535352ac5152520053ada10fff0499951f00000000000265532c105e03000000000800006a6a5151ac539f0b7d030000000002636a1b2cd30000000000010004d7b8850000000000", "6353516500", 2, 86743319, 1537743641, "6d82ef15e5c5b1f6915a915751cdc02c6a971c8f65d05baa492157224a1e12d1"],
+	["3d47bb490105a64acd8c8f07c9c0d50c46d3a93f9ede33d19821a6d92baea5f1c4556c5c690300000006ac6a6a52636a91e4426f0185aff90000000000000000000000", "6a6a51", 0, 403376701, 4122551051, "fdd4310d099394013e2fe71355a08f90abf96db766407aa95b0e680cc6d20d37"],
+	["2680bf240215c4d52d7c8e9948859b25d31312ab7463441ae2730385203c89f66b36799d630200000004516a6aac72737b1b44b523af7d7447e3acb6dc1e570ec8afa10006a7dc286f56b9fc2393794a871f0200000007515100636351acffffffff034ceaf70300000000066363656aacac3bf3380300000000015185f060010000000000c281471b00", "", 1, -1241333736, 1991772603, "be720c5724b7553ec5aca7f6bff51d75f47dd4a2d87176ac70239d45971ebdaf"],
+	["030000807082c403031a96d703bdb11e301883ec44e5955a78f57b71e9aa0fe05da1ae0e76eb0a1e720300000008536a636a520053ac121af3aa478defaad93fe7614f21a46fe301ffb04b4bcef4be576015663a446b03de67b1020000000365536331d78680d4fc056179fe51e5e24ec730b4b7f5451fc5ecf928b2d820ed6c211816a92bd003000000095151520053ac53ac6affffffff018a7a22010000000001acbfaaddc00000000000", "51ac65ac6a0000", 0, -242571533, 4179206552, "70a0d5d6f1d7a09f86d0d5fb52da6584dd130a349b0de28030f17432ff5e9dd1"],
+	["76edec2401cb4633c5bf84dc35a06bf25aa27bede9b14fdadc9312ac5640d2ef226e599c7e02000000026a632a2edbbc012843fc0200000000000000000000", "5253535353", 0, -188622143, 1991772603, "7de01ad009fa1058f01ff0023dd9ad0db882603cebbe02a4924baba96fc669a5"],
+	["d09ad30904ab9d10f79f12269c034332dcfcd9c5a731dc2efb19184f73a120379ca390c4e0020000000653ac5251516affffffff0c5c099452574705c632c6930ce38057675eed7555e4187c6bb39bf55507f1a4000000000951515152536a5163526ab016f684d4a5a7d35f0fc548a83e9f6cc2333c6c9bf18c8c90e33309d7124127e2381500000000065100005353652389188bb6af8c959c39ce0613f3ddddcd0cc2dfc098567e53fb955c9f78941b39914b8b0300000000ffffffff01637fcf04000000000352ac51c06b7c0700", "6a00", 0, 455947212, 1991772603, "a9746bf3b7f5f725fb446744b882900c1b044338190b66095ad225d52d7a33fb"],
+	["8cedcb3503e216abbe882255cf1c9a004ce9237623cce3cd08f9dc80690c1f5d23f719bef200000000086a655300536563acffffffff6f13c57eacbbddd73c20829dd44ed28c9b82f98c2ff3d97b99e1bdfa7142bc51000000000265ac8e16e2171ccdfa0e00ccbb883242b25a0873c55ffefe9ba9b55e073d2cee84a3e051fc6c020000000563535263acce38142c01614dc0030000000008630000ac6563ac650000000000", "536a", 0, 390751701, 733220448, "17a802c7e5986cfa7d91cda076a36e7c4c52eeb77c7f84604c33fd7d7e48359a"],
+	["0400008085202f89025a391989bca7a920e22ce8bea86c8268bd18142afbb3da99a3e8efed6d5ed9d3020000000851ac6aac526a6a51ffffffffb071788af0316d07f3950390abefddabf377a87a80deacd879a512a6458c789f000000000753006a0052ac63eb03f31202f2ffec0300000000066a6a636a5363128d47040000000008636365526352525100000000ef620a07aec0e004000000000171271ee6f1fcfc87984b0e5988c229bf1af81e3a3d07e889bd75dfbbf550d99169014b9a84b7f59c02b62e5807709506c22e0c11333b58ce24ce063d9e8a7b2e9493ca98e14d9b80d6c0f12d29c78e1d0982a3f8522385a63fa30b0cba70e0c6961f3192345b19a1e05c5bfd0beafab0321926f0c2ff17f09c0741235355e70b9645a826ea687485b59fa01fd9d15502e03ac2a84cefaf5a0c9b39d23b90f17b75d316e12afb2a5761ad02e38e0f2d7cc165f30c9e8094be56fb8ac4f093e71a6493e32a6774c84e3e081ad49d7aa51fbe709676e23b63dceb59e575ab8cfd53cb77ceaa3ad67d09091e4674ce062400e78313199e958050163a6d8a853e2dc730d42211ed3e281a6acb112fb0c2a451c6cb542828d380cfcb0705198e7dab1ed7f834ba7b03281251577503d0434516326b5f2184993d87a55f25335cb50413484cc4003c4b89959274edd1cf631604000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000045b665a7a7d7db59c994b507fdbc543c2ebb816b89f9eac1496ba3c1d13e0cd9d8cbd0d578ec09171065e41256ea4e5dc5647a915074af71cd3cb6638f9f05735e425b737bbf624d602986393b0ffd42c86b7251a64919c30cd8e4682e1ba18715ba2257fb2812e4006ff71888817f262f1698cd5fba419c1d1024b462257e20ddd2c20a36a17e0924aba5a5617baffa8fee195d7502cb91e78f3bebede84ea7e983d57c794b9cac25caf436760d709254a483963dfc686ba88285c8f25a399be5149ac5ed9131f5d0b5cb1cd68a32d24c8943cbeb171e8072800100ccb96e6ae6b2067c03bb7bbb33d38a0602f373fcaecb127ae3590dd73616167160ad7c6291014ce4fe547ea6b1b8a87029f742eb5c0d5f6c7213414a58943f72f4edec86a1a6e760f91f22b5d09e286079ff7cc2b2161fd1c8a7b8e64598dfce273271460559f445a371242ade3acb49aa86d4781b9bbf9b3fec4996d24b62c605906ac1a807a31fba5a1acd5c9c96fd6e5350b7e2b0e99cbe801599bb0bb0266708fb432ac5f880e341e99117eb45e201a6177c3030de613a3aa30399630124464f6ba1494a463964ac3959667134ad1680c1ccc4ef29a64c3d8814a04d228dbcbac617b2a237f9afd4b08df8ac45ac7175d8d202a50668e750ee186b41ec5693a480ba3107d2a72446719b98332d7d491848377f68c60af090ca60795aeb11ff7be5549b5f3aec399187661f3b63a6fc3db8e8130af2139969b5c46e946f832182d3bf887f193b73ca15f4c0210f1784604306734f981bbf4aa4ffed8bdf61bc28fa6d5ab2cac5a6e6bcae7049f46679ec5e0c2778ab456fd022ce00b85e2792773642dd95f3414220dd459a18f1ef40f6bcff4a4f53242b0e0318f6d87bae5443967ba91bb5a6d5fb26ea9108969e918a0d8361e95bf117e85ffa393aa020cd4656626cd43a28b99f4dcd028141ee2d7e81a5d31159f2c587ca0c0cc1edb04febafcdc7f3f58d70f5899be98ad0d5070d3d8079f1b189a56a19ecba6e2a0c9cc9d039ec416535362b81208099e657c5d6e5afb1e9141b80dc7db24e9f61453128ada9200a8dd3eb2f09d433543974db217ff25f7ebc8a2e606f27fe6f9cf5693504ee7dd03d69c60d67c72aefe39ec54091592cfc99fd42fa1c9dbaaedc0f275311e83bb42895ed1f478824634b97ec38a12fae4d4c4997eb05bb30dab69b4b705f9b841bf979bc13cfdd2062e349f824f12a94cfe6aad16076e6ae5a605a3994e9cecd6f96cf35f392234d0ccba14ff886a4dc19c9b0d8b872d9ce2937839948a763fef21cd99652173c70720e87198e0c4145050abd114df22ef3b39182a2315da15163c4960c43278efa97b738d9801e4cb3d3db068f825dc6fe19b3b3057aba64b9bca77ae643f5fc3f0644da199685c7d3f90f161fb9bfa16b47ceab9ed7ad5e3418c9456fdb9d71b8c07824badcb0b023d2bb7520e4b1752adb6f86b85d467e8133de708284f9e83920a0e8293c6aa0c9209d4842b88c15b3374c4d742e5c69ff53aa37ff8ef6a25c9e54c93daea1d11cd53f1650faab1c6a6661c93a05c4e7b2daf3c109e83ada5b9881867f4d0ea60dd8d57c1c91197f0dd85680dbc8420e2692dee3d3dc3c3d3d60fdd6bac614c474bdeacdea0a0f20ef8b7338e772512ae8841f87823ab6c1fc9344c1b8db3c83ee46a242576ed6aa913f7f84d03f7a8819d3d832d99568ed6a2f3c5aa72a556c89f22cd635a6e161f53be4f7ff64a399b0e7be95847a3ba72df025df1b4c490385c71b1a89662921a87ddac82c0f74eb6e821e139c216cf7e1e167b446dbaa156fde0124328fd8c07ee623487b01d260e6daeca5d21d8b620eb1287f5d92d8296da500e98d5284f10bac009741f71234712bde086e7567e47a13b16db4b0a5123bd2c1f81732ad8eb54977719d56e8f253aa67d957532d4d6820ffdf1be9fe92a0bde1fedd6bbf1586c47ae0816d18cde8f71f2f49ab02394f5fde8a4341ff1d7162c69dc10bc69520768ddae69a3d1ba2203c5e4ed54cb6e970cb6b31e84b004c7ae27c5bd7fa21464e569d812535395a0d7edc97104385b05a58e64928eb63cddddef1c2027d34d62bcafb3b9471ba8441dbb4ee52724e50143caebee58ab32a63beef714411f9743a2c0a7ffadd85c505b38f92474677cd8ce2ad50b63b50f2be2595e85abaa31785c3510581a5270868ca6fde3ff4e4f767f81304074d83171d8f5422071c5ee9225b64b9ecb62a4030e1aac795e148aa89f713f32bfa76a700e978c149bfbac348ac0613da47a13ca1c7a3f1327154b7b72c7f885cf6e59dcc318a9136d28f821016aea6a3d2a1fee7e2455d166d977b8fe9365d7a682c45e0bf249ba5e83ec1df5bea6ef8df08e1e739b811fabaa44318210753115845130c574edee20366681dfa9c6084ca38fe2bf6f717ea35c4d9f09a6b1a7583fa5684a857ebb9bef7d1a66149e6af920b2273300200c819074084246e39742a28f3a3d8b54ffb1b5226f3a07255068f4d8d2dd4e7b4f2fd7764560bf4145637542dd7656d1b7b434f4d67afe07e6593cc0558a92bec868573bdafc74dea7ccc084ed506e9a84cd724406e864a78a58cdb2b5489019a0390fd519dbe4054e6189811fd2a898eb7d6c7c0f0ca0b83890801aad5903e187230cb1736fc1de45c437214c657233f6f89cb611fb4a7d522e4431aaa4f2264fb5e38e0479733a0cd0a37d82125ba80e736cdade3f21275110f0a40dcc14bbb2920323d7330b9474d5ca9eb9ffd3566dd56e7ea5e9cef0e6a32aa44ae50886564acbaee6005a370366763368255f275228311f10a5ee4f615e36412a80b2525d4f208f63db857f11b34c8c043685823c421214ce0c9273aa39e51c607b71042091a416f0008d8053f1edd1718f0d28a1fb2273fe69bd5cee3c930b83555c64183d21e1804aaff1defeaebdc2e7e757c731ce944395a7500f5674bff4ec035f8cd9f4f023f4122bc174591d0152389e34eea83c8938143c9040e3e264425bdef6bbf2557232608c9e136ab2652c833b0a25ce60741d3ec7991bef5a39914d97f21f13b32d649c6a295e14778367003ab7cd0f20c32f60644e32e74407523ba8b0154d2298684aa017e00f392f76c7e44677a05c10bae17d8cf45e270c713a1eb5674a18b9fe7793378321215e283948b283cfe1d32510a67769a154887d3df482858d5e412a0c3aef9bf570bef60aa37e0319fc96d4e664a5a22973435ac08aac329a2f9712926157f99421bdb0552b4638bea22eeb53c930c6c538778993bd694628f9b4a74cd438612eed0bb116ceffa8f17765c15b47de336c03b0aa041e8ee893b047f3012fcc9b5cf42d48d3644e9585545a34e45c4741917f677a596d3995f5da9d8bc60f9388a2cd139359d049e5eda24c4c54aea4bfa14d8d335ef66500fc4accd41325660234e0089f48578d108c5e8a2d0013d17f93e6474b33ad2ef6d0730bc8b3ef09856244f53e2e577e9f2f3dc7fc515dab16f460d68eb818856ca4c859ecaac09470b06a7bc5b14d3809ee300f0adec6239371954f258b387014093aacc02cc658775f68c097ef9e188130d4d2ae3b338dd84c4727b68d6c83e7c332fe07b599d95b38863eba11313a0d635db21fd9caaf6796b8a3e075c5828bafe9a18cd67484a55c228a8ae04f0b3592e418d0baf8fbbb148d0fcad085646825be9c53cdeaea4fb775831d200392cc8d43cd7c315340cf65ba11a86603330f030b897ff48399aa9c20ffe72dcfeb8643bd54667e89db54489a13e2994b5be8fe3c55f607fb6be4547fe126b9e5cceaacee4bc5b0960baacb586a6e1036a23a60a93340c5b15a0ad691f42e8ee8a789751f795b8c887b2a741926598966159d11bff53f3e0b1211c0acd5faf36bd90ba06f6b1feb1b7e4c8eed0d1fa730009de9d3d58be09897ae566cf623c6457e2c2e8b5edaf040075dacc478135b4e979b9f2d2b0070048a3e75b36d7711caf9cfa913d45e53f8c54e08f2ef3ef6a24b6a64faa9d506305f5ed039adf9e86232de9047c9d03eeffbef9c6b5690651a0034df183ed7fe79f399b3806dc5fa4f2331175f494e3648439b8b160f4567ff9afcadc42895d031316bd32c936020a7feb1c9dd8da53ce64d1c5d3eb48b36d99ddc19f036a64da12846cd7c45c6c7af7e4bd3ce6a5ba0d8c88749413ff7201a11fd99f4cf4028fbb700108ab1ceac44943355307e2b76e06908c9c559e5555a09f24ab050986db2c2f1ce47c16107f7df7b2a28111c8aed18046c14e9b5100e868a997f841bd8a2397e8c7797b4d2632521504186680ac3f291662ceb87a92e0e30ea598968f931b68d380973ecec5685287d95372000fedb098d82c649671c58eadabd6a3dd253452d8209d9ddfd7d11f954d9da084d4ba70e90697092256f42133857a464926812699795487db754f3f309eccce04cf60923e64a25afd11b638e805d7d4ec7b9e6c9306c22dfbbca330559a80ec5c97c4271e9ec482afe8ab5f60ca9540fc281ab92102c17427da7e1b9f78d18db63758c06946cb5305cd45e5e0f1f281eb5672cefda1aa9d8d533d001690190917b4701d595757438eb6a1903d98cf728e7992abed78d1988657395fa824a9aa7e6461f12fa01c2e5a9c9ea422ff86c00fe8b6ae570bbf0dfc5c190969500da53fd22956aca893cca9061e3ae18375cbbdee6b5f931b32f0c58a4977c5413f4c27c81483f89cdc656d0a3723844dc01a8a24810deff7afd4008d85a10dc4cfac562803cf1f9435ef794d52404af56d4a537541dcf565ac2f58c89975ea46a045bb62f38957de24ffd775b43d175d63fc45b0cad18741a6b099d73013ca61787dd600cb211b6ce7a2aa8a050a01edae3312d519878d99af29354f1cd1396018ad3101cdfee6fdf4f8b29daca4e523d2b686e8c5b2262cd58d6819fc1b838e5d8fbfc6a981c4432ea50ae547990c818d078df9ed28c9e7b1aff576de1eda450ff21f8a92485094700988cc884519c2a185dfdf4d45e1686fbf8fbd1b1c9d7d922ffcaaaafe48412c60a44c67e4dc0a1a8f07465e94650a7f15534d346432fd2748f092506bf4555f1db044e957edebdf78ad5f7bb96cebc19d173c3c2d7037c1f01628b26488ad25414f84f58e24e9de0a5f813a98579ff0f8e2c4b20e37ca913f701d831a6a33ff0b6078566eb02a0d545aab19e06782c04ace99256696a8727c359534edcd9d001b3983cb76347ed3ae1f89b0706e5a3ebe8fbebdd68da304e499ade8792fb41f6bf1c3733d55b0022dc9e73ab3a6f8249ede46cecdeba9bda6cba1f9541b6476c6318725f748d1ea3170e2f3c191547017f63d505000000000000000000000000920c4980c63ef72e45c4ccf81f4870629772a280593ed3cb2aa4c55b767479b710dba1ac46a7988ffbcc9fd2e7428152a00f9608616441d9c96df130ee1f7c640c1eb7f4b5f703bd01c046ff92cd180ad761d385458aeb0d3d89d53dbf54df8c000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000007151eafd914a0ea1857ee2c70d8f8932c48bda2a1a5dbc37bb3c4f384b708b16fda4ee826766febde8700bcd8540e8adfbf4713e28008deb27a0f8a129d15678a1effdb39e1368e31fb9be7efe0e939fa0a38d8b40f835748a4a2ab2a78291d26132f0d3367b59a091eeb58c46cfe669e58dc69db61e2c8119c52bdda898e76bf7ac0e0253107409700429bd8921ec98d62a013ecb70a85b0e0b0e17c6a89fe1da795d5420b66523bf518dfb96265112a810987fdab8011ccc7a71c0d8899b93298421e23b0bfc3faab483b28a9ea1a403b49650bfaf7edee9ca3e572cb4bb49ba7bc872d7c968e88c2604acda31277520eb993e088bc2bedb366bd6bcbdb94e2368dc4cae685d43f44a15a2b208988500c6c443cff94da70d9293ef2acf897513cbe6385be0e163ebbd4ac0b0c0228642d0158bd84efdfc3a52b55a2119dd30c07c9ae8fce551462679f39272509edc992687bd0cd458a8e06c3210217907b3bbae6b5106766c9f087ab83f1381ac84d3b74b9643eb83b5cf9653226de8fd6ad6a732d8bbf6020b9232991e6bfdf64282da47dce9f524b48f3a8077a66821d07e3952fdab687721eac3688cd86cc1ac87d3a232af8585719abc2bd12cea63d51812412bf10634a548f2a02de428d65970e7ea59899e53518b379061ebc7d1acfc0e6c085cf2f11d22bbe4059a516f0a37fb9c7883ac6d79f3200bf9fb3d77c585b5ff6b718c8674f121e70190b7cd564b37efed174f94b1c0af01958953ecad61364f1305e3eacfa0efd4398a1e072ff576bbeb1e847f68250e058ac7da04173c1ca10a3a626593924ce6467a1b631808f326d2a5c460fb3c4f19b70a0b250cb99ad98ab2070961641598e174518d4a081a617f8a43255058a827b7f16e5e01708d6132b3f8f1611f33e7e206d4fde0dbdc7c78191faae344baeb8c575c054c9494de1ace1169d58279ffeed6b7f41e69b1d06f50a2cb04781e07d535f078c6f1bb56c7a031140209f2bc45e358aabb5a9448eb47272012018c406501545785481d57126ed629a78f4e60a952bfa3b4177610cde398ebf99def300ee39a3155f4a23b24bb405de6cf58863121647da52fcbc4ec2c71e73f0752d057623513b60857f2c3d416831896cf2a37ab6269d5c2eaec6bc4c4bb7808cd4042b6f29d5c459709aa272757d0e1c35baaef5c6c0e68184854692f2c5e8c6e30f53ca60222c54c517ff1c6610731f121e55048878a1474101f6271742dfdb965056b671002588fa412b50c76452c045618d06be599046c5b1e38ebebcc322c8cf5100883a580dd4018670880ac0806cfe45560924987a97d96f490c6ffd43ab3229dd506de60e9c0882bb6e852f0c4547d6a41f309cee36a3881ddd5995a629cc5c78ec894a663c3dfc3a31b42c6f1a9fa7d04ff930f07457479747e37c37f29dfb856c54af29cb708782978c6fa83d7277fb583891f603ba85b4a15a1b1ed15c2d1e2b21a6cf25fd8f47d2ed398e3e364d4dfcc321fe1e1d3efe0e2775f864f43a0b76f3b55c3707a72538fe24eed8c9e9dbd56ea5afd6150ab8273fec0f3ebd7ca02d1ebd6c028161556d46b41d6bb6e4b98d10ba20d65274520a55f9c37ea7958443f0bc0dff817b0f4fb1645b28829c8d95cef9d4002e76974c68a1aa0b3ccf3ab760ee62a6e50b819835892b63dd4adc173d59a21d5e29148a9de039efdc19e1fc5597a46401415065ec73c067561f0551cf20515b113ef4f53fb90b51300547b366d91efe3283cbfbc83ff1029e88b6278f6f0435b7e0b5f5f1afca5a62d2930f95f30cad1c174460837eaf7d49415ff8ace8290364f035df5e291e9dba9c0f5decd721f3005e21ef96ec6ea9ff4eae6e8dcac17d2a342d4a983a6f5d32ad8baffe8deffecf6b9fdb51425af3ec110259281e5624cabdef2aee3c9840426d8f8154f3147d07a2cea6b73163879ebb6de0a357fd55ef74f9846d9cf57b9a14e4f6fc9ab205ffce1bf5c2b725755cdf812c9e3432f29c9d6a445df7e8bf2a665e4e1101c57a70b187fd4dea2a48a8b0fbc89f7be8096e191d35a01f02fdf7d12d186c5420b6800c8838187c0bb406a052b3a4ff597844750aca75b7a63fad198eed8306bd4e86a7c8665f89788ccab9fa4805aede38b3173dfcf2b1b1b18c45e447437b54c8f1f9435139d1fb47773be103e0bc8fc8ae4cbd24bac9f9cff887c612d4c02ee2999cd30820a49ce7da5726fc7476f1dcc592adb92d2e1385aca8f2219b72590eb0c3901753fc9776710078daf8a360500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "65516553ac655351", 1, 2100217127, 4122551051, "4e822392bf517e2d432df9682730886ceb93cac47f25b2c303253f1ed44072f7"],
+	["243e3754049d4b93b4081486599f9f775f7b6578d5e96713bc3d4734fa44757f28c5801fd3030000000563636300acdff877ce87185ff086e782908fb44aae57753d40d52b4c2bb0aec4060cff6d876b1fc5ed0200000008656363535365ac51ffffffff6c812e98bca58431f3c2d437f89d326d130973cd22043e4373ecac3da165bc28030000000153ffffffff4b0ca658f0da5b9266be5cad51a1131b670117b7868405b023f78cfbed1ec1b902000000026a00ffffffff02ac46bc030000000004516551512a340802000000000752acacac525251237cdaf700", "ac0053ac6a65", 3, 875887629, 1537743641, "3127880086805d0f10311817384ff1f2bec7e4ce5308787e6ffeb43003f85744"],
+	["0400008085202f8902db6bdbc22ed9a8844a3b7db79ad74460e21468b4f89d0ab36bd427ed947bcce3010000000553526a6365c7f0481cbb8cc915858810d51e007dce86e3404748148c6171c727eafc43103030b46df6010000000200acffffffff03b4193a0200000000065153acac63ac281bad0100000000015178ab0804000000000651516351650000000000000000004ba8e7050000000004385ad5c91b146f0fa5afdfc2a729babade3ba4cb25075f45a53882eb1416ece9482c015e67bf833924bdb1883bf51085220a90485a8203d720efb56bea495836e2cc9ac30a9c87ec5ef122f8896044778640b45646476007adce40cf29a9c75fc7d6f046a230a9cef53acce36f63b8a0551bc20b4283e4974f67876a2a2cc2c5e3f5054794bb71f9a8d1af218c32ef4337a48fe02458c3ca5a96d708ee6513caf0ad68974031ebe5f490948ed010fbd2464bac7c15fa4006c3d51309808cb0c4ff14ea548b499d4be51610522cc743ba6793b77fd60dfd3ccbdd44d267d72ccf793d6f10739e98de656f0d75f39f2d05c5020e12900fbe08bfdeeda46ad28f9449b47dac84428eb8153b8908cf27d8955505f0dcc6a5ddf4abe24a09aa2c361fe903d1eae2c38f3ea622a09da2943a3797b94bfe2b283bceeed15a671e26e8b2eb0c3901753fc9776710078daf8a36050000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000005a45a3d1e5065c78a3af51b604e208a524a61394c7024eea2f32fd1a492786daf93a69ee751a59108d243d0a365e84fcc5a4d34310080fd4eff0e0969555221fdbc0f77f78b1bd67cddbcbabe8057515562bc2d214620813a66a2187b15f60ebb941167334c8aa131588cbf015d6c05a8d8f35e2cb0c3780989941211ec5ffc5e37f86e299081f8f30c81727f79ce3c9a4825a86eefc51d162da663bf9115c3815de26561e98492a6da55e6e43cf38e143c58ce9533cbd9020aa51feaaa1771a78322355a451febf065ec1161dcecb33fd10830a0d7910789b0c6cbd4eac2afc1ae106cedfff3633eb51add7772b4fc3c856ec2917de8dca15fe8b774a919255b9fd4850444675c8b4c5f4c92e42c706d2af4490dd2ce3d15cc4fe5131fcfdb025ad1bfaf11b2c4fbca369d2ca014762219eee5067ce26023c800b2858993bb9eb0c3901753fc9776710078daf8a3605000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000f4dc075426c68a6f155fff14cf385abee6c72a921e57939967273cabfffbea3e65c50d5d9d5f6b9700c6d0e42b98bb9238cb8e3fcf39b08eaf6563703c815e4b55b7bdda9be9f7878a2c4a78cc444dcf15c32b9f98c8f363ae5196a435c4aa367ef01c509b7c32d8190d3f39574ce2726b03f739c9893ae1c28f77020986359e731ae8a095f6a414fc00b92f7e6c1508b7003ec91aabe19faa7cd7c2854080d1db5196811676dd4bdc363f10a434f79a0f1e66b2dba9b6443eeb14336593df7450370ce20c05ca84849572f81ffc7a7257582a40a91c6c6583c821c0568d8400b87982b97d00d89bee5cace11c24572992a9460bd37ca3c6d0508d0cbc0d6fd1bc59a8ca6f2b6f721bba6141e79f6e7d67880bb206fc0e986e291f912a4d65068183b660df7f0fc76cd780f9ffdc5c9974e80b34cf64049381b9e68e75486342eb0c3901753fc9776710078daf8a3605000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000293757e32d72591424277fdb97b8fc93a79ea6c2f0ce7ec084ec453e36d31288e8da9347d70dcf202f67e2946309f5bf82b74524e9edee33aaba30937e41e64afb6dfb297fa105a230d6b83813040ae05de9cb9ec3325533624ed7065481b37e58e6dda24257e28edc01a280477d7a80d75aabfbcd7fed18be0b5ec70bf638d491849f030e3ccbd3131741ed6352b2e4f0b4711252e988f5bed06c98e7fa684b2d23de156deca1269d202e1aacf887ce8b07b4fcf9cc38936e51304014f014513735afd26db82928ec2ebd9740cd445be08c4a44afa6ffdeadc33b621f9076ae94143806d362c43638ec58f0deca0618fdf9b0964a2cea3677fac3df0688e2cdbf5b3a69396df2665420f27e8acd477083fe9bb18c01482e1c5ef90cd99d1e8c76ba5af5b5f2fdbef850bb230ba3d7e2424562c69c292c55a4cd23ac06b0cae3eb0c3901753fc9776710078daf8a3605000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000046c2830d8e29f484b17959a28d1f3a2a6a61b973e66b0a01b8a30341159c59f193f460c1fa01f438798fb0bf2d1f17a6530e49aa27f4cff210649b22e28709a69e0597833744530e0483cf00f9c53603e2040d9782dff33fdf62bcd724a368db20e7cde834ab690977037efb3514ed0e6b761a987f0ea58186af72361bd7de14d59e5500c140d65ab948a8d6ca7a8028522c9e9a09278357afe8a88da0a7b7d70d9c242b532118793f45d064e38f008432d990dc6e62cc526f371433f5a2028927deab720450d1a07ee7df28e2884d7f368ced929597c9d5e92af854e6b537563748272b6239fe166e3ed4ffdfefabca23424c7d7c33644be819620f4728036ab68610c1ba29983d76adfbe8b8135fac02f294355f5cd8e0ffe470f5143d580646cab3ae34186d0a7dbb6b3d3169e0670187b98efec077e6f88b66c6ddd0bfb4264b756e5611cdfac4463cda097812361edec8dac5363cf5338242a88fc9a62e6375ae9d2ddc1e3fbc59effd761f92d14a063a454ebf825aa6eeae01fecf3c3648811921d82619da126866c6e0b4621a13aad6dc62632c12afd5ee8d2191edb908ffa7306167435a09ff3d1a8d8f9e4d0f7227cf7d163bc5d2be07cb143038af88d0573d1c30e955a78c09ee0867c543b1ae9b20181afb21e153b078c1a0a098a524bc02e8fd13387262c2e2a33dc84d44212da34d5a8e4394a31a3d5c40597837b09303f7e2eadf1481d33f93ade309e538d27c906c4a165394df9f94c0f1107d77139db42d1eac51539d7a7f6ad4a58aba0d4d2a211c988f9439ec89a6289734a9f2729db74425f9a4d0bc97fdf9fe5b23c77fc4f17443d8a945150e2667f10aa2d2d1d99dd0fa9371845c1de95de5bbb89f8f36193cfaae57769c4c3d44c36d7074ef484f2cf5c9a2e65e75b7fb6cb9c7baaf6c638f1cb7194329e3ec64028425abf812b88921fe672cc6fd45520500e02246969624c995b53961f9bdca20a3344dc278cc73c648d8a10be17d8c7236d16206386e6c15e4785e497f54955cc8250f2f74ff35bae50bcea206195f57b6e5010dbc6e1fe987805387751a859b6d214bc6bdb5370586a6c1bc9b3c9b08ccbd2bbcbd8e703a5fe9ded2c09d51ac87d980f7ab56c1a0e76efa30fea9e323d7478e74d087f7aad8bacce1a01e5fd4a682a53de9e1beba6977168601b7d4ebd6481cd84771cdf41176cf3327e1ca078616bbeeefda4386d5f15ea61343d505d5d53db67f2df06a519235864c6d47ab9b99295e69ca432c285381fd79364f11167ef95f1754ff637a5a94e0202fb7715c181926f75bcae77cd37683d513562389145f7ccf997b874f6f234753b3146fa786e00449ab38eaa07dc9e479cf314ab2b56f2163077cf2c5bbe5807b7c3f519e939cfa9fc7fa627ee18ac5ebd6d9ff634dc1f4dea8323e8a5ee7f170fe98728789a0406443f789a587d8d4265520def6932a429cf3951f8496dee5799d44a807c5c9d218dc8616a046a9c2615845923615559b925ca84328e2990822fc69907363d41956f3b35bc277741570d0e4d698a578a1f712cae017fd2659257a33985199150c20605eefad7b98287446055c021df561c623dd803220c181343b5f244b72726f304cf3b877986574a7a1d0cb9c6b6bf1f61c56052de07862a2d3df7bd6a515b062c62e5cac9cc10e97d1da232f088a827336390b3bbd369fcc72b4b5c916a3c73c0073e1ff71eaba215684512afb339ad0356dd2bda12fbbcf88c425b6228001a6fc99a4345d56ebf87c56b1b88a1818fcec0d33a3a8b0f2b6e009b78ebdb25a5bd73c779edb1b6892094416a060864c824734e67c5b23c29a06aaf5dc72700cb42e1353e515e0a6a8ec72c277ab573612fc433dc5552a590c6a098c3721403c3c4a5c6eba366aaddbc18639f3674970a5e19f47c41c4d844d4303e7a5c0f7a05aa8f3f910560b9a30f9704a1cb5465b162a3aae1328756c2ef9110ab9887e1f8f25d26e8a6956fdbc9f8a46ab8d021ef70b4197f1006497115d0f03d91feb84f6135121ab31b777bab97240ba531eef06cbc102f2aca56d7976ce7824c507515a88e3ef4accf13c1dcd61517ffe24ee8c6731007767fcb077a5f8d3cc20c60cade7c1f2e72f43b47661d066a97bf901e0419fc3907579992b2205a19f8d6f02b41cad4ebe12cbdaaf26bc61c673be4f5191ff8dbf77ad9be0c0fc40f8743acfde908d4511e1fc7e1cd0ef72857f7cb8c44cf944ff3f825e502194aedab273058026d6e3a0fe2ae3314476fb47b5b2507b60fd57f56e7ef548c14ebcf240493d3c322612a4e764d94e58570fa30d6a7bf8efaedce22d617cbcb759b5dfdd96c518c1afd8423bc2272a4218b842e07c70bb520c688f269c5c57e4f7f5f3525a83faad2cd4e7659eb8e036b78c633caf6c89778a38492b262b0c06ad18a561d4822f43707d14ebd37a8a040993c6d31953d04aaf45f01c53fe20b6fd98eb1eecd2e02532dedb745b45e6f6328bff556134111489c60057a18c2c61a1320e362026bcf2cf885acde840523207bd3a97b205086764a6e2e692b4048f13bf4c4c2a3e837cd122724c4c7035125e28d2b169d4753827e71c02d1eb1b0f0fa6d55b394c1679a4e9b68eeae6094ccb88277c2514ee64602b3caa8ed0d5ced9d00b317e0d0293263a776d653cbcec7d5513d6bc15a4b65cd9f64c1b87c3dcb5d941023782ef5a0023acae2d7f899b0fe471b5b29ef01035e910f27de0f27d01203ae79d717f649674cf3a55707090c8f5afcf453a2f04bec4ac64cf0aeca16d9df375c751708a40b5c7574abeb50f75e9b1e659679e29e68bf202857105f6e9430595d108d2542a1488f3ea098ea5106c72434329c74678b758eb07f6a7bfc65f37e33c06da9262c6a7815f0143495d0b7c4f40faf882f73f79078e81794da2d082c118dcfb9d28fc6ca7523f04a54a02db1a4e741248929dd4974e340d76f6f8f709592de5e1200d8848b73dbf90a7f61a4a3ee26ca757d03cc97da621a98f45295d8578de2454e8790ff49929de1288e014e5a5276dc2b8fdbcf8786fa7e5cb10107a21c46676b735937a10bbce45fca78a82963635a2ffd2899c30c0e7af128425851e2561f77ad98e424f3157766a3735b4b3b38f87e100cd2df5bd622b87679e94e008004d073b1a1d286da7ba2bf0824d27e2bfa6b38dca6e7d85dd28cb4921a39040afdedc29e8f6cbd0c256de98ce105173a9d202df7f75a97e64221f1547bf078fe33edafb2330857bdb7608b72e9373f5af6eaca70f9825b88852a7727cb8daf5b9c005350f36e621cfd92b3f3fc74908a7303748243568872ec7070c0bba26dfd30d437eb5131672cbc3848057b8abc1318af949754d4138fcc45c24bb86d5259f2cb1655b468663846a300846b890d2ffe97da08625d2efc1333ae8cad789efab69b05bffacfbdbd72bf938f0b9d87658937ed50b840445e637c2660174de28a6e986ad430de30957507986bfbe956bfc5785053f3a26fbabcd24e44508d4acb6cf845af8bbf0f90bcd362c6b2c92cc2cf20c3d5ea09211bbb7278b6eedfa6b7f1ce45a556fe27768ddd21df381b07d0daf8cce07ab879f3f050f67244bdf0b85a092c9e3364523f53e89c56368d791af996767a08927d776cf301d851d0fd3b547dabbf4c2412039eb297a254173cfc31cc589bfce9060c4893dcb319b737ed0c335df354a76f06062cdf35156191079da8f830237471c63fd9fecec0c8bad7cbef62d0289788ee64113fc53dc15f4fd6e13b37c064daf1fb0a9863fe6484fd6ea67619392d97b4c1acabf381287db1fd768d2dc89853c377b6662514e706c85b69d6926145d50c693302c27a13c1afa92982d98514c2082a724c68c55648e1f42e8194040ae7b21e373d6274bc159ec91eb9613456007da369b5139577299140b1641c1ba0d05347c72dd6eec791b3f148a1827a1de592500ffa3a6a0f1dffee7490ff08ff8de4dbf34d5b177e98f18ec4bf60e1cf103ce2a2900900529b1a1a4e1bf4be73885c369868821fdbdb0f3be22faee1e15d6f3154cbbd20d200b11b1911d9886136243a14125e93158efb6fd73e7881d504d393903b6dce628910d833904ad82142b46483c37d9edda781065dec3b2327a48583dec424f0a17e126febb384c14ae8accb18798c3aa068ec731df2ba1a285fdb56708bda4fc8043ca24fce1bddedef1146f848404d72c8f1e1de3202def3a6430bdc6d0e4725532773ee9068b564a73a25df1b4c9dbb64ce5f7eca7575c8d23a65d445d1cc23678ae7e2a208e66700e3a1b2f2d8dc9efd7077bd62e2868c0d46ffc59900d0a198a3cd164fcf9df1dc23e5d6765f52ddff6c19da3a32ebb9f91d6072010823f8f0aaee63366b5f006bec26cf274d10558d2450e76f9d34989c1a187dace83968c0dc5a34c137f368f4331f4f40a7f024af499143d1590cc1df380114d7b851c94748e97d0dd8e38ef62513289c6b1943c8a05c5001c3757f11ef4a823cbcdbffc78f1bc3afc8cba20fa47f5cf1786e002a0fe973601b5bd600a1ba7a8af84f459ecfc9eeef5d702947172de9e599154e18bad45d66025a5ded1d553edfc1f9cbf17c2bc70670366a904487dd836b820252aeac45724c9ccae25e3002cded95bee8c6a86450848d698394d2153cde9a36c7bb0440099c96b6e4516c9691c45d92f56e91adf0b80b9e530a5b20ccaf273fb3f95701afffdb71ef79692762a10cbaac9eab4c8cf925814c223a0e041254cb3ebbcf353f841930f72a03e3c775a738919c770264d42ff24e58863d9a313460e58c9341c992225382e80777b9af125d99e69ca6053bfe41a15a5f8fa2980199d27506360ce2bfa2df47c7d87e2b80512d75fb50c25c6c2f4cb902254cda5f63a1c7eca99deed551a8d21d8fcad2145f93d2054a988e25a72b144cf10549ea33498b6e17f0a9f5a5a08f88ccf69010357378543681a4e566722456db0270a2df4e67174e686f3d0d49388c5b9debd259ff18f7e1d9a20a426c6656b961628a5bf5742438d98ec6cd9e0f35b0c188533e1ec2f6abb6cbf7f43958a2c112b395e3d6f934e3adebaebc3feec66d7947c255df283f441b7cd6486f76c4173badbbc8ac0db17a2b6c949444ac061cf2284ec0f7f5a31e743990e1ea8bfe47918cd6bbeafbdf46e46845f6563d49d9efe1105cdc674154761814c36574022f72c719b339b9e31414547e2c6159c92d0b85c3957a4ea7f69f041a4b31fd7f78e9db7b1050bb6a1aeb5993c6a7729cd6bfea4f19891302e83bea9aeecfaefb613dd61cf19f8f2e38bbaea9d51efdf3ec349945afd187a0e4c45cd28e0e0e6b17ad0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "516a63ac6a515153", 0, 814905445, 3925833126, "b2ecdd12b361c5fd04adb692a4dc9c566c85549ed5ddbc18072aaac8c10c9fc6"],
+	["b54a661b04e434e37aaa22d86f0100dcaf32c012b7687bf029a2a08f60242d82758f21ddd80300000009655300006aac655351ffffffffb353666c0cb61e288f75a9b7e0a6e7b09ceae443fda6f3e1ff796fe05ce789ee0200000003ac63acffffffffcc55d859b23602b2b333591140f379d838e254e410c117a431b336855087283603000000035300005ee8549fadfee073bd1fa8eaadd2e07cc63689a22c6e4094ecd91acab45be34bab1b2e4f0200000002630010847ce50222e71601000000000452635351c99eac040000000001630000000000", "52006551", 2, -1679020333, 4122551051, "92a423e72ca390952e535bea50649f55bdc0e6211d9a30a52f8ff476edad645c"],
+	["9a64d9350179a3d093a4813cd16e6f0288f5bbbdf81b1ffc177240c3ae3d680fff250aa88d020000000163ffffffff013602160200000000086a520052510000518756ff6e00", "65526565536300", 0, 109877429, 4179206552, "87f860ace6a1e6bdff12c14e16b144ac3b43a55a9a7db005bff98bf18e847595"],
+	["030000807082c40302ee6a217571cbae6d10b3e1fa4c4da7f36da8d709ebcb8ebb5983668420d67d6e0300000005ac51636553fffffffff8c38aa44e88284372222a690f7b5156dcb43984bcd4622ac4ad10d59936023b00000000075152515253ac52ba991eff0237be07050000000003510063e0bb9101000000000465525252eab6097bed6ce01200", "", 1, 21961091, 4122551051, "73a12970cbdf90aed91cea519bca6f2f6a2995eb0934fa6eea6382f4e47e2af5"],
+	["ecafa24c0239a1ce31a459ac1ff74a94d042bf02a484c18d3984b44b1fd30f0328a578546f0300000000fffffffffc24fe8c54c20553f2d60ddd8ee25c612bcfa12eb464ab89012e3f46d5589bb90200000000688cd03c02447e7705000000000663acac6a515369bd7e0200000000075351acac5200521396faae00", "6aac00525352635100", 1, -1839693565, 0, "cebb30aed5df2ec26f7245b2535fbbae0a24f224d18da4681df7d66e19e59022"],
+	["0400008085202f8904f9caae70aaf0a89752715a669b0ea0054a53f8e388b74ba2016d2cc9f82a54af0200000004516a6a00de37af6c03c51f2fcb87da86916b052bb08e6b89498fafae98202b0e8a6aff5930bebc810000000000ffffffff3f86ee93ad8194c02955d9ce5a0fd9ccfc034a8d54348efa4f411beabf0da450020000000152ffffffff443e441a4787556996b1ec510227c37430a784e81320390370356d66587f1c4200000000026a53730ca07703f81140050000000005ac520053630f2c53050000000009530065650051006552cc062301000000000087601e62000000004e2e7f030000000001182887d79d0574491c3585ca8bd7755cba3c65a6b913f09c84db759a1686cee829310ee7d1a69cb912f38f36cdd3682583d003490e3be714a9b7cc9dc8e2923392850ff2be77b211e6d261988fd4523c19419e17bd1c69d2207087366c8430336cb539b2fec262322804b7ab0ab827386fec6bd9d0dceeed24d41b1dc4e6751c2af12d4c82ca23c2ce13ef6c1cf456e5289177fffa54012273ba81935e6765a85b2353c6d12a245b3408e025f584277cf08f4bcda093d781cd8fb535bdc68d50a54b0641c8e57927dae935ca5733d43d7c71c0a0521b4713b773b21f42371ec7877ef5df7eea6f9fb7aeca558f2baf6c631d7eb8163800ac38d5cccd2ec47e21fec04bb48c81fb91e777fb4e3c3bcb28a814829a7357ebb877a844979d44e052779f8e6fb467f87a7cede9354762f439d1905f84a73859d9b25896286a9cae6ce7d36172aed5b802823ad2102a769100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000038356035553deb4bbc079047eede3b69ca9c804ac52be988e43247941a39eefe62c6fb0022489ea258d7bcba68350bb81375b4703663ea79b8dea24940d50126dc6871e1f173e9100a3aff2d9ccf68fb62f37156f0db32877c7dac20ce45ba2cf5ea579067b639178078388d6804c26c6026d14d35e2716d74ef9473bd1e73ae1d09f9301f55500d6cfa90a82130213de84ec29d83821de63eff4ec61f6f2d3a98b74b4f8c63c4e9d4f71e0655045a77bedc64b2be3af39c9f272bc627b1492cde6843c47d6f0f1b90af3e2e7a3d613d3b571d0c54c46478bd6ba11c6c07744f8b31bc5066d58b43fb7371b30158e55c3b4c0303c45736f1397c1f886f8ec93d1eb8d98b2807374ca2b4ba1face86eaa55edf88b3fbc96baf55afaf2705b62af0ffcb1abb139b77f27e3eb15c3cea245cef13889f8c211bd2315e1ff1ca95c2cde54dc36da28ed331cfbb1e1050d49d626db4bfe379a6346b5b4a954c45180285c354748245eed61f1da7580943e3ea4aebbf98b7d86d673b938decca2cefcf13b82dd8f28a3cd626ac3402620337d67c626c1582e4f92ce8853f13892b8591352803a5c6bfd36ec6da55cc0f092054519013380f4f11c817c6d6d6b4786d232dea611d7568d87a0b5764f2f22754188a7a042cf2b90a7f9fe1e75490e22730cca6884a7735ead2ae498ca8d90c360abe1b422da56114732e9e78c771e60004f0a1effd2ccd45502f0fa7ec958c16eaeabac4e40aa89b149d206858cc86ce95af8382a50700bfda6e1c5859ce9a8d488fb99177d699b900d6e99809c9f92cfad9ceea2b050cbd35766d12ec5d3842bf64249251da7609b2990139ca0f4667fdc13fbcd66359727b69c8ec41ae7da94f80eebf28af560eb944636aed086c3196193a594d2a062286a1ba7eb3df0b87d1989e57d2081af37aa93a69006e130a91b181763df11218ca30d78209f9a1dd2a84edad66981097a3be489f5b15ce7507746fc5ee6cc3f77109d9ea09fb16974bd5be164ce4ecca45d45ff12cdebc00c83a66c7544bda18c245228e511f5a08002a88ba52d936d8ff760a681ba03bcabd76150b079dd59833597db3fe79555d24a738a0b6944ea9e2e960a539b2478ea68b271d08d0002b7bfd83ef833007a6b23258d20c388825472790982b1f54510c6e672736fb982783ab097dfdf9bd21c580f1a51a6f09e515928773297ed6fd93cd05aac8bb517cfcfef4ddb6b6ae03eafe2e3443dd243b20b36c42ff16b6f7efea917b4b3c474e202b9d974dc6e999c62f02c00db0c52b2347f8e57f9a9bce5ef5217d56577bd7e4657ef1faa50303a336a69c6b08454c6a1a9c696ed5e5478025e0146ce66c5e0a0e713948d020a8023628f50b3cd9bbb6eef2caa1dc1824eddd316d68f72a9c1db3bfc651af24d9f62ac0ea8e4f923868e93f3a5be11840509de1bd3dd690e89b9df2e2a7397d43f54513ec5a1f1a37808663ebc78685ad065d76da67f77e7186327730ac4e3cac7b81af223b0730d08454a1d1651d49b17ebc0bc23fdda62366ea83b1c3cb0edde59053ac7708dbf20bb539018e74b717c04b9acf9a5f7ef3b9e9143dacdd7757df1886ddc55dedc4b4e80bf47ff3a57e1315663eca52b1caf698450858bd5a7d7d5124eb04d8cff6fe5357fe6af60ec69425755131494bfe5268e56b5233b01646735123a808ce43d9b7b484ebb0bee869022408df14229b166abf86e81f22b0b7d2bd0a28bd99e3bc3603fee95f3879f50ab38fd85e3bd68f996e1759b674be67f371a9c6de4d19a3897acdddb28245cadbf1dbce06ab4ef96ba5402ed8b23ac7c4d76960b38695687df08b9238e1288e28a07687f64bac35d092256231df1ac887da322f8d7125fbf3faa38efaeda15aaff9406b9346d74c22f6f8d118a533f3d8a009e5461edf0a47cc0fb0375ea6630e68741dcffaa02463308fc62698ac0a2bd934abeb0fa2cb3d2fd48c6124afd4540b4cbd4d08926149ffb60577fdea98e67b6c5f114372869486de3df0dc337e3b062b478dacf57a17e6768ff935e6785312a7c593522fc73815428adda5078144b155c40bbbe217b7d398dca62a28ea603da7e41d1baba4111e698026df4a78b4eadb73056b4cfe8c413945e7d338fec0575fc37e6ced8fb16974300bbf0f3d815856c59256fa5d8a9a6e3fc4f12e12873e4b85fc0f6da2465bf3ff1db7a2783fefde1e936ab4db5786955bc1e4fcbcbb979ee8b20b492aed38d368419ef9ca26a9e030eb197699f662b40956177756a1846c496a2557a4ebff091d77e67e84f21a9607b08b2dfeb2a4894717555f316c63ae07ed629ee2298cca1809a1f919c7d095bcffd7858c425a61d93dfb8927f2b002b6c2e003d6489279451bb7cf4b98ce17b2cf4b20641e9733d397c89467f5a30ddf657fb8cdb02fe62a5faaa2307b91977bc57bd558b9992b1646acdccd62e74c82e5e9c666fb0eb4d1cc9df33384b995395b86fde2c835f7636857e0d7412eeefc37936e2b4d47e06101bc2a1528bf8564add6cdbe9190778154e2674d20ce0f4000c8145cf70fea6dec1f99060884cbaf53bddee7fc27b1b4e0d8f3272fb33e8850f5ef231ae4b9ba9c20e479c6ca7fc1ee188fd5805014ae9e10d693a836b8be5a9451ac8085a5e85a2defe1ac36e246f9fefb9abc36efa45d8474adf18b0539da6eca987632dafb798062adc399f7e837ab59978fab21b5d9e4f5d449446e4a76bb42a604ff13d38c0dc4ea53b9d89b1055800227dcc432c3bcbb37913528817bd69d120287536f32e5c45e4b28ac6e4f4ba0f747387e5544104a0e42aedf36995fcb61202caadb3ce9f46104b247c31528e23745bee7f7e6309bfe9333bf7364c80a9ca2e383d17de0f3689337cca4408cb25a0fd4e21a485e6ec76a0537e5d5410c40450dcf3adf59cc122d51f3e1227356f3d6269f3569049cbd4413ff96983232636dad7c9007d9dbd4b3faf448e00ccb3952387051e14184d89aed8dcf8aa1cfacf8795cb1b1d08ac8d45954974878e6e9cbdd843e62d406c8c67b45e19bdf2043a8b216f770779d108cb6328cfc247a9a67a822b341390bd93f987a6bf26e8c0626549385d9d365732977a24e82873e9599a702a88b96f581ad897e84d500555ab023de46062629f17c1e48a3d74ac864a66bd617b6656d2c1eaa40e31396d7d42845b1ad8618e04679fcf1c63a1467f76ef200ba5ee3a900fc35feff8cb59d5177bc0e59b97e8a7ee66f587798f61cb5f61717a24c609c1f7f649294c09be6ba587b847b3844b32b06660614e5d37593c547a8b9fa18a5d2963e7ae28f1f7857e6e3ad502931f8319fc6a5073fe1fa58017d13aace754eef1bb721cc940ddd5f74ee4dc74b9e33e4f4d8dc4b87705b293159d22a772322bf9a5ee6df409f49138180c90f61b5cbe59bc02585cc2f89d985fb52038862d468e6fc0dd98839cf11328ae87843a68042b64caa15ec4dd5b45bfaec894cf90114d8855e3e6373747eb502c4ccfdac9c2312da316add5a3a51ef91adfe916bb06495507b55fa6027e1146831957825f204d1cf87649121381ea359b5cc966d2d7995050ecc1d8a436ed7d80de61bd4662fbce24a5660ea20d39736802c2d4c85a0817cd4c165931cdd6a2a64eba4ae4a9f4209438a2dd897b0fb0fc7a22053fd7fb2c045f4c952bad61d5a899c552e2d6b55e1e3f8012fe39790f251e5431ca6550c4f83b2cc66329b1bdc4c08718a3d7427ec5ffe62b41b4a5cf855525a404a8a035c479f35de09fcaee867dbaa0238563917e50e78a4ce69f8a5a0ded316bb9066bc75e2da4418462d930584db581f8cf8ea95b845796c94624ffc693734592f594aea76c37e6c5094405ea017371e9ed57d585496697bfa5a65282a6fe9f83db8c1e9d4bcfc1645066019edf41a0296799a458bd9ba312acf0f1739a9ad9fec703a6a9e4258babb27a569f4b889605f0e392e261af6f1c13e5fb2d9258216507cf0e21102aa4ac2636e22bb2b02cb063300000000000000000000000000c6cf930409b7e134937ed2968c9e825bf9a7c75c911c9e1bd61f45d9d3cfaaa99263996cdc7149f9443c0978c44bbc1f1fafe69c109a129463380424fc8b0e3f27b732abf7c01aa8770dd1c185f00a7c9014d941751a4959516d0a4108e2d0c500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000bcf71b2e50763afa96c458e0885eb3be1b4444bf05d8c26cc6612934e12de999a43dfee4035839c9b418f199274dae2beab7b3a174a9ee942ccf634ab580e3159050933e2bfede527276472ff084ce455018349770cd52afe1842f1b6b12d9da95f26646057c9581c89078a693a4a60cffd2a11ee465e71a7e94a807333dfe42250ccd157a5bd0f3823532ccd8227ea3a353cbdd6760ba27cc583de9b11f64da1c04e6481fbcd830b5292372b877e29c7d8e4e4f0312730826e50639aa021772222679b28f11051018897942eed06616c4a6c63f2efd53d5999aa57a7c0304875840b4652df4cf51ff27f45f8204105d26459788f1c0b0c46ef45f1e31d73fd03d270dda12cf7deb9c1b42a648828c2f61c533076534a1315ae22c2749bffa790eb6030dd2ade5545c46c5eccb760340c52c9ffa72e72187104d61abe9d4b96e272f302f8a97524e1135d904fe3d8e317e86a28ede5cd6d57e7108ee1730951bebd725800569643c0ac80500da247f49553a2331f80a4e19e8b33fbca8dfa0a5f524108b79e986493e0309fe748de000e04c2d546c34856df6169a8df33f8047fa795fe0204f2f1522f78aa35f7c782f95133acc4d3050f71b45837191065c383251eeaa5fb74ea374a0c3616d5360e66e6003c354697f86603029ca74eb6f19ceb8151758e018cfc0e2d7cce3456b1b1005adb11576655ef4da7001285c958a8ea180028cf29751a5648d041ad59278288a6bc34e665cbd2681e0e7e10ed78312c49f997c17d91fb4b6cc3788cf9c93abb152b35cc00d2fb8b1db13ff465dc7e1f057841ce493aee8bf4ce41a707731437be69546168d09e992e5a1f85accac02e1b4dfd08d24bf0f359495785d2a67db4b3b431bb54cd5c8e6d7eb4d46d4c8955a876a36d57ebb732b03bdf0ac30f48b0714be6eeefd6b952218999f059f4ccc60ce4fb206f4deffafa505e6bd6500e81da86465519ab817b9c993e6ea6e8d578e85038c021191932eb29c68c99656ef328772236fd21a6b943de3c2f5217bacd549d64e764029c495b619371386a362530a9a7166a1e11da05cf0e0abdf30600013f3ccca19dc3d41dc5496d5a8627854a3dd87cc7947d338116f5b9260250ab43daa2a4d37d4d9bb6443e05d4db25cf8ce26105bd934b503d6a6b2df883ae2d227c1445c3228dcb9c4d803efc9f6613507b76d306724ce01bcd27eeb03ce30a9578bcb40d576d8fa966f31eb765489ca36173d516a14b3f2c4191b3fe60eda89d855e7b67f076ee21f584b574ffa4102a2cff48bc06cafa687e9a61e0a3cd7ecc46bb54662ee148cbf5fa7a5090ef5e5146420e3420eba748e0fba569cba904c16e41cc7fc5affff828ac556c36bdfc287254e942e417c309132c3f1c72f44dd98b3883abcc4f3bc7e3c2a985e1b449d68e516b29acee94e354662136267994b79b96b3effdac8a2bedf429bf82637dc721190d380fc892ed42ac873dc01cca11b25db61154ed47429b0b82c211520b5f944894a5e55556ae3835e7437ec45af7ad46cb0b450b01da28e10c00fceff769e614c194c6c44657457aa248e7f88f4b6e91ccc04f2970383ccd50047c53b167b703fcae8e8b6c6cc88c2fe7bedcf7194dea0dd36ebecdda94aa02ac9e0b44112bfd3788814fcc66a8de1a3059fb4b5fe2f2d1a4089aa6cff326711daead92e3b83d3c045cf63161eed25fa1420b83c09fed00a4082f5c3a8c58e0798e29f28daa55996ef2fdb3d866768d39415dd1cb0cd940b808e6a994533657081fa345465a8ba787bc948bef56b66289b63ce43fb6157c0ac16a4a2f0b5053f10309b5664a2f15e0cf30bf8a64188efd27f83b072cd7e1f6fff36ac353e78c91cabe74d37adb8cdd139a18f86dfe4aa3b557655db8f21cbfe54001c34fa22cf8d8c81cb93a6f1830cce7c55d813cb24a63f3d92af046895d1684bbe7c15aa1031677b974d64f376708f45c69a6b786839fd0ff51574a73bff287b72331a81ae7ff2dc70903d646aaf0e98d42498d6d2038d15f75f9a8c1f09837ce5b2480018dea76eac7abbe09229bf8173342ca3f32e3ff0bb6f22f535c57dbe35cba64765ad1a30b3582037e7ec6354dbf483b28e1638a6c8b89c18d802bf554241d02f622cf4591c000000000000000032d6430400000000833dcc31941ceef0800f33957925ab3758b2d2daa1150decf6cace07125b564a0b2d5f88d6bce0e89d32366c7caf4b92415a76d130472c13b874c0586d310f192bb06ec2d1c08e809174dbb9a7b82e0841734b0dcfb614ae47f67b198428ac9f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000c9a15d3dd0809b258e1cba0bcdc2c9b5cc98c7083afb446020ae10dfb8ad0d2ece1fa75e92d283bae6b939e6a4b0c4864856897cd92db4cb53863c294ca2abe14bfc5979e42991397adcaee749fc0d551cf69d0e228c6da95dc9a0cc0dd431f718964e5bfae19b4376bbfa58d62b14fdce913604f491426dacf00d8079f41a59413237fc7a401b85e25e6e44c8730e16ef7c0fec8adf96d1613c2d68b747146c539858f97c8c61ef7324b0d616ff3b59e1d98ffc0316df3b37b3f03e6361c4761228cd38e236d3a4406950c876688392a0f31b89d75b44dd128eebfa9d06010c61a930af56d6265d1024ca744d542b141cd086e7beafd82173165432d46fe1fe91a8f96a54668bed94b838cdb7f6f0b3ea855e1dce2708b3d4a8da0c3e2aa41de4169cc2ceedfdc30f9cba695023fcb0fbb4851c868b651b90dae966105d7d22b1fc1af503ece59dcaa8bb39eb5cb93ad9bdda801b156a90c0c61647c13aa818a470fcb532460e56673a5eef9c5bd37c06adfdba62e8ceff049503d2fbe4eb30364074e46112e6324780c1296eeb9cee5a714e1761c7e370758ee53ec71e5b3d660bf5506e010a0b78edabdf4cfb9e5bd30acf1f811b33e54bb6cacb4def23f85f8ab6d1e17ed42df13a2317652f8f57effe109abfdaedc1336bb11592673d9e3397f6924180f8557a90878f7d42ffbfa0a476050abc0140c5cf41a6a9c8bba242cf58f2651e20fa228d1b2fc6e0f7eb4b0fc241b70f202ee5fa0fbb8f2673a44d576836316b92df9893b9f5dbf9aa6c80c3c8dc1fe9a7ea95b2ec755eb5961f4836f1b0ac7aeebf2c7f7ff024df421a53c73de89165960f63a67a560a42fdde254b3a46ea406ca4f40a9332d7d264988f3a6b54ec5e8937ece08a30f52a1b23fec2780f0ed4e80ea72d0a7fb552d3713391bbc4f270564b94614f150a4e25598f4a0164ca256c6877997d63c62220ad349611d514ad1ecb9e571938686168b5f1e625f1e5b0811b121af5b4fa6201f1993bc204a2619506d7de8b6310625057214bc55c996f82460fbd2fe71d9abe0c72544b5855af5e4ca4722234aa648284153e24d566422aad5b9b6b0680cb6aa688b2ee5cea04f17db89225345978b27f4751243f6c083b49273514c6defc5e6f1f3af3ba711bc5858da72cd73cf0ea0d64369efa4b1b9485782525e730aec537e570d7641d8268691e3c7d14a1158f595a68e0c4f0239e5d1043d0dec704e0788dba538f27eb70faa2bb0a3fdbeb117b20fedb3fcef24927fb59984337c5a63bba3b37f5181f94e696be68132298c130fc78f43d09e12b66d812139d2293caefe643f637d5f1bbe6352cb5dbec10d901b5f777d74bad6850af65ad54aa587d8c7249df18bd03c366aaa139c00042834db0abb4ca292cc37e749e19118d3accd82da32cd8e453b3c90ba191797ec8187769bfe4cedb92c7c5e4b73570a06f8bc5b49d4f1d5252572c3eb6648bdac9d85b08ee5832f52a6b6263ff918ec106e14e57493d12c6af8abb05348d8cc1d5b7dd2295165472caa763ad9c72ee95dee2a6eacf7ae31371a92e2f3acd05a5c4b66bcbf738b216b0c126d056aea8236f9d3f18f9c568164b3afdcb4d4dccb047360cda6949217a2bbf8c60fa1ad5af88fe4f04420257e3ddd5e91ce74ce19e5c49903d4747dda7a64c1b5f2fc6273c5f98748c83acc08da81576673865533733448291eed957ab18927eed2d33d1f88ed3744669dcc2175cbbbf2ea0e2bc3a0c0d464ea9b238dbf711cc33f34a7ffba267ce0aee0acf5cecb4490ae38877d6d2c9f18bd1dc8031a6c7c48e653ce32bd84bc8ae8bc665e28650ad437a0533b75f5d325bd630f007a6faf2787e6c1af87bafbeb40268e5c6ef73aae3135ac992f17a4e800775d0ac3afc00a8f96c9337cf3655310e142673a32b3cac50acebeeecb7294defb4a38e76312007e71b0f30a5d2131c27b4f6ef300b342dc9dbb2e5c4f4ea3d64c3874c5bee37fb327448c5f7ec08dca39c0e885570c3fe6c1110176c2ead28aa1fd9b7fbf7c09714edbba82214cf440cccab67a36717fb77606d26d478ef7d18fc2c4b143d5af674b16e5b6f6da22da4bb318b9eade3ecb6c67a04be5408667fbf96d88e863952c0d83cba3bb0d5b5f090427568937df7eddf1219d00c818208a4ddc2991928be9d8e54507b68be57067853108ffbd11b612e7941139ff85b6971ea2da67784386563fc4e263c9d2bec7d6910747ab2ad6788bb12b4f461008f9a8a3939db82477bf2e86e57c340f60c00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "", 3, -1629940953, 733220448, "6d6f21828fad3ff4cc80b452de8202116a4e24ec2956924a78574c35bfe0b4ba"],
+	["8ad30d1d048c920a23e59364b1030c890e01fc623e5293f4d7f914b47705772b0e23c2ff4802000000025351ffffffff669846d4bfa3f90c8a8a87341f40525844de67626fbd1316ff1861d75e9370720300000000b250f6d133ccc750ae7c9a093631cbdb9d2509455f6123ff01b43ee444ed403e6aa2915500000000086551ac516a005100ffffffff3dda2299b244abcf6f11d6987caa5b670fd905b068149ea3acace70e529ee0b20300000006535165636563ffffffff0256ad5200000000000400ac526545e801010000000009516a63636a0053005361d7d69300", "ac51526a", 3, -558166746, 1953719636, "fe52028f450bdd0edd9a450af2890e4e8ef37a86eb3692a34583647e3fea9feb"],
+	["0400008085202f8904f622ce658457aa8658718c3f1fe64d4f2d93972226c39cb7460d64fa89088d41000000000663ac51526351ffffffffa465aa62c4c06c32baef301421e009866a1ac2f727cdfc9a6a4b6fadcbf641db0200000003ac63537f314d886db70d1cecf87a2f3d2dbde269e7191ed6db432eee63ba5a492a743e828f38ea03000000066a51ac636aacffffffffa6e1c34dd0b45265cf219c99b5c421ce95bda516881032a14659ea587928f2620200000003655251ffffffff03603b2b0000000000046552516abef2d40000000000056a005265527d49dd010000000008656551006a65636a0000000000000000b31aef010000000003096d1af0f45c5a586b90b1bfa5f5c4fd3fdb081bf52e68fc9131c42ae9d5614d2452ce90631dfc4a6c52c5ba99abdfbdd035cd30a533a2408a3c39fe2805006a141d492f83aec45fd3f827d97bcc7254a0625f9518c5d897f9d5ba4835da1be1b7d13d955004419a8d2795bb6aa60277a286d82c887deeca00ddf17fced0472219ab775765511bfdeabefc3cf5dddab56b8c207bee5db8f05fe3221588eddb01e6065cc979f15266e164cefb1e2fa69c0e9c1220e7584f51f6a88a3e1431a7d6de058b75fc7874ab81c0cc197f184e94f65984269b156f76d27afec35abf877bba5f38a7b8f0193655bad7ea54dbbfc47edffef174e681814e32d29d217a20254a2c77adc03d85d34f0002fb34a9d8820eac036298cb7ad3580df6fae48fc229d1767cd8f60fa824513dcb97104a9786ca44a592e26dfb7952403a8df748c4939a8a3939db82477bf2e86e57c340f60c0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000007b03852160469ad2bbc7b0a391edabaabb1c09835263397f571b8424ff5cd33e12d1d4247b6016533b965960abf9a487e398d0987b7185fac13bc1157e8f7d606c6376e5d5b9f4a20741e767c86bdb323c9ba7b73e5d53b5626c010741bf3765451c265e58115ddbfcac392fc0f53908b4400ba6fe98e499e6e38d62c1da2639c69b71066526d73d0bb5aedc90cc1a43b838d31d36284aa409f6a8b7a54458c0854759a8c43992bbacbbbb6d24d8c1451a8816bcf46580c20fab3b692d94c70013dd1be8be28d6c1ce889aacc7ac6021ccdb092c3078f4f41bbe3e19c9bf94eef55f0c7d98077abc9a722913765cad4e47c2dedc7fc868ed224055ff8532f5e8e9eaee594127c1c4244a30020afef4ebe8473ed890f2c06c8201404eff3de6fd53e31830b636bf27ed220c16c18b1a07d436f1618adc083223a29015b5be13a79a8a3939db82477bf2e86e57c340f60c0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002a8e457b29873d75348fcb29107b928cb8b1b0c63c0fa89aa9bcbf9c167ae31cfa851c9d1422a04ef3e6b2fafd568d544e665b09e99b1287d8bb314204606e6d79394ccb74e7434493a3f3cde0ac3206fabeadc50a1bf2d074cd988b535ca4d9624fa489795c86b85824b3fbd6f30292bde17f21a9fb8e8c3df4bf47935c794502da755b21a9a38c5a002eddd1429d2f23a4f4e08fd158e5e90fda62330af731e6450587ea829e0d3472f1a48812661aad4b7aae28b73c055e0daafc67d6918d2f9e21b85a210e4ef8011e41e41f75ae6980c6540525f02b53bf4f76d82364d79b6a678a1380fed04e849897c0d699445d37ae3fbbb58259b780f32e358a0ca098a2ac03e5edaf1b8a8d55da79993bf5106f1b26724981b2074c1eca5edc019cdda024151ec599d628652db18e4ffb178df9af1c0dd04ac9391a90c50ccba5359a8a3939db82477bf2e86e57c340f60c00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001f56d0bde797689909a6c238ad97f252f36ce7511e899d1353d7624bcc69a4e5380a3f38285e29cdf5a9af746c784805cccf79119cc9337f8e0eab521174e2c080956fb8ff9ca8b31f4c4ef1c5a7169cbacbe1c3481c7f0c0c2801a49b7a81fa4c0593ae3bc5fe65006ee5d088bb9b484912294b85d4690926f2cc2b704902d4447ff89816e40aceb1610d7dba2b351479dcb85b5a4012232dd296915b79f2b4d7d98b11cbd0d590aefac363922c36d20dfe485c4c068f978fbc20a2bc46d3a55bbae72d38ca425253bfb75995ecaa746b18ce37700988dcee66cc3e99c2bd7a3cfd622ad52885f0f5027c6b5b8f4d55f3c3bb5bb1cb97227f418a041af7a33c6ff9cb01fc262a3b3a23e78d2a30f8b3a2e6a62c73abb3b37046f70e97a37648ccbe0ea5c45c039f2eea2c4085aaad3833734f8ea698b4c8f4600232453059c3fafb5d48a1a6a6d74411c64aeb3f5742d8d87a4a66007e7868bbf0e07948f4d1f569d9bfaf15eb6b7c9eccb3f9289cf649794cae05aad287326db352c0f1c47dafebcc9ac046c6c1f4452fcc2fad5c8e612cf312eb1a0a80583cd42d9d0f2956254d4a0bf6d7ac79a9939af052e3063ac143e197ff906774fb5d6d9bf51142d56f88ff02a61e79926108ac057cd37f4ad606ac67b24f4decbd4597222d0cecc614fbc79e2afde3fb6885ae3667eca8226d4e182a8fa81feef94c51f0699944b65c65a2fce163d94edb0a412b0529a332e9898450c07202e46fd11ec855d5ec940484d229d13b6252158373a7af5d8eb81686ff3006d8a8b1088927e617a2ef804d71932d1f2536b2bce441b490e8666b1047cda3446727e23a403dd8f06f716821379edb35d5a187ea50700373fc2a0481c2968e487e894d8119b1d7dbb4c17d8825e7621e78be2b3d7adbf77851e9ea7661bbedfc00587f5cb18eb79aa732da0cdc2b62c53669d291eaea57f59afc335739b4719c51748fbe3c0eab3c271792ada4beaa2410e8ec98f11b685b77c90e9d8922d17dc15c020a72846d49c8966119b70fb6dfc12af64ed57246b107066d67955263b98001b565e4999a292d2e766c96b768be1edc239df2df64a1a64f140225fca40d0af6eb730360f38ce34278783eff57a537a977348273db91606c79efe3bc9549d34f6c81237514abeb9673c8efa885208ec6a94d16519c095a104c028eeb0d72864b5326ceaff5d60430ca688169322dc73a40b61cd57527ccd9b88f0e50d5636ac4d1f10eb58ec2bc91b95adef15923a321186a81d60d34ade8024e424e762ac2527af79d3bfbdb8657a784fa89da360fd786239f9f2ebb3cfc4242f9afb720302b67e00000000000000000000000000558abd3928adba177b693ff76329052006d74cab24c6829ef3b9764739b1071253983e8182ab1666416a57044362e19edeb1bc36470a0f4a45364043bed089b0dc33b2a6ddaf69f99612dd0f46067c81d6d80795b3bf140b66a6c90139b202870000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000035fe9e89c47d36793b560dedb571e493fd2479df4b39f582a14a02aa05aa4fd8902bdc8370b0afe20a4e5b9369d88b98b1b9148456a2c676146e1862b893fbe43efd9c97e1b8b202e6b4a2d50b371429861e429c849c48c21101256541f9c1ebc7db6197badcda1d53b4c8bb80754c69df226244f2e2a5ca3ab2522cfd9566e76f7a8381cacbbd8fd84b3f0bba2c2831b1a1d42446896c5d0a3727c4fb88d77d533650168a1dcf76ad39af29bcbce67de84f90b58248c34f55d55d4a54bb98861d849b39c169a8405b93edb1f190b6fbd84c380eaef153035df3f947da7033d0014662bdfe9f5f43de61952df8181624b0c7763399bf51c908999f35232868eab638c95e70edd6859cdfeda876cf28f632bbc51f6cfe766fb44920c47c79d9d56c85015eb09d4a7348498b553b0e6fc5c1cf79cbd419b9f8c59ddbf3f640532d14675bd04838ea7d010f45c7a2cf8f01a58074cf3d2ee78d5b8b7c61b56637c52851d083fa35722b2de507c18218e08b451d50f20059d996509c996b2435b97b63f8ad4f50310df89e8ab663022384ac88ca197302de27a7f82fca24f0db28cdf0afde2c56c6e95fbc42b0af00f394217a992c72b6b47e2740fc2f93383d099754dfd3b597aa27701a75ee68b9bd1d35fb033a6e5b723c0c9195207d4c6a00f63aff8182c64292f0fbd7580602ec0edadf887fccb5b908b8ae6301c210a347e9fe411011e3dd77a3bb6bd0798d424fdb23d8ab20552f409463b6bd4cdf1cd8f093acabe3918f63f1f87ddf87047736090b66142d419804693cd2c1872212adf5abac593757944a8d3e9e88b058f8005fcfb3cd084ef5f1f71211d2204d58874d865ff8511ec1fb7a423f7016b0756391e048875b04d97648159ebd717e6b27cad26460ad4566e9e7378922f1454612750ebab501c28116cd7000193c01b90e20f79eaa6922619ac1728ee5adf8b36e9d2eef98a4488a80fd97d9cfd5b0197328524ef8d75f3e778893c680189bb47b4de0fa34e6ddc0ca51845ba8d666ece158c9b13debcbd5855e8481241d5c6964c585cb00e8fd7b8a6d0765e50c30bba1e97f875c90f20da195f8e415263d295f1ebf9438bbe449667ecba0c6868a30dbccc567625a5a9c343fcecdff734984117ea46aea746f20d0f0823f9eeb4e1e809c7eba31ab8d60b44668858471fcb3fa044ed13894b343a0690cdeabe6c64c30fc4d69bf64e1c1d6f7749e7b8ea1b3aecf66818fa4ad7cd94c400cc1020beaf0fba0862929c541b9b8b90f3fbe01d395be2c2aea344debc408f51d8969b782712e86093300afd6f9a7c3791b426a3cd976e5314799883e98f98a93d8714df8e693bf2a3a53b3ab2353bc17608ae6ede53bb8429115ea20d1ebf3b8b40435a42c61e3a0175ae09e7e325c238023c9158da0f206b88f4fbf90fe3eaee685ba3b648f22dba6634beda3803645c93a22cc0a7359e61bc4550b9fc5008a31925d2d550036483e37d11daf67a18697d56995400bdec09c56344072b2676cfcf988b1ac2af1f97a96047167bde03791753163e6102dc991f4d3c0df7ce0e15dd322637a9724f9ff5b46347ce6ccd9bbfba4cb97522323218a4337ee12e674625864545c8f7bd51ca7cd1f2bcae396d86759f9b278a22168fb36ea328d62dd4ab4b1f7958738108b6a27e1cfe2a6ae56e3b3041010c9e79fcb612d0b6093117307c90bbb210110046e70e1172d6dcb406fbdfb6467d46bed5428910f353d29bd288a00c55e8e7776c78c8fc65881bbbf14725c4231db6257bd7ba6b90486d3105cbbd1346f52a23650ff93e8806ec59bcd8eb6da50c677beedfb8091891e5173aa5973b2b7be88cb7896fabf901ddf55ef46c22ea7f9653a090cbb51999d6c03908b94a624206659be37a9766b7ecf65ef8b8c8d7041a81549ba2710018e7b4b4aa7656cc984d742bd41dbfee85b4588e7ede80d4c02f606004fffaf75d01b476948cbd82776aae2c6fb889ad8c9e7d0c413238250eaa5f2ef26091e95ef2bd765e0acfd50d95a1cf263ff8a0fc232c814691528fd7047a89a4e8b4e9b212e01c38a087024d6e77747f9128004fc0cceff778eaac70f40c72b1ee32bab50b25ee3b484986299cd17483b29cf93bfd60a5ccb128500167900000000000000003842950300000000dc3a853e2f13afca62bfe8d7ab5a7d80d4119425dde7e9d6574791437f15327ac765a9eb27b3121aa8aa846bcd202807aaa3047ce060243a4577d4f8af201355ec5f37262ea2022590256ae1e41a112326270a212bd3fb89af1d851d7dfb6b3100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000c523e6d0cecd81c10607daeb112f858cd7f451b16f5701d5ead1c93e1816916c04d276b4519dd98c199c8501ff0906c0e81d06bed9c170101e1d7b89c787bb71440d0dfc5891274aae8d94bf88bf11c67c144c5755b08cbd80c754b1149c704a0e40e5167b7b77025252b3a11dba2ee3be5ee1bd0d983049daeada062541cd04012fc784f2b852800fdbecc97d64bc1e38d63a9713ee22d4c22f3aa3376fdd1bb8de176de53dd6520665ec4b26c84bff47ea7b26fe8fa4e8e680c7e5ffa490f74455dd75bf7e97e7a203c548f4810ae9bf73bd8a1c644b476ae23251c45160687a0e041917b815d55b7b9781412985a706211d9266fd9ad6c3e267ee1baa00e72d8dd0762b785333d6492a9d62199480ab39f5b8d8aa145e42ba2187e58fe61127c40ef6bd3924e2b82e50323ef7fe0392837342c986e32115e18af976912962fe8527ae083da9403f1a33d2498cbb1656a3e3290d7e5505b1c3200bb5bd335dd9d42964ba4138becc73f1fc99e4e4c2a20c71044632a2f93394635c43839fcb627f409ca363a35238de08f89e5805c5ae299861c8d7a3461cce0ec0e552a6082b67801253aceb934e7183d54db2e5a31f39b46d4f64f1ce52dccdb1eaecc5a3c41feffdbf880fcd084d3c26c83aaf3a4cf83191530a843c23bd4792cd58bc04c8a4a4d67b3f3c8be3288ecbca73ea1265fa467262c9741b62274b807f0c7b4efb6196f37a8536bfaabc682b7ca2a4549e75f6a652f265203329497ff6e3185548cf68a00b1e113d886b9652d613491d689590b50022f06bf43f9e81742583de88eb48e96e604a1db8b8a744bdda664909db1d6cf7d66dc0f39e906c66461b3bc70e7b3b6a237bd5ad1d88053471b8044db799699f1ce18f0ff40c034b11ac1c3a4c66e44964d5fa5c48199fdb6dc9574a13209875f7385dfa4b0899e3a47820ccdf3caffc90f5bdb8cc7805e8fe683b83477c11b5bb3b223240c0236e53b8da48e92f0e3a80d80285d95d90a815abcfc6fe0fb950feb8e563597973876c7468be4f30a03bfa797c14a05dc77852240484fc6a12495ff8f3e70c4b9d95c08cf821ef06913b603dfae6c79f873b0b9b3d70df1e890e1d1e47340f72022e90e9f25f4aa0aee9e726169465e9cc7aaaab694e1c97e0641155fe347d6bf5a89cd2a6e6b5a9b47dd21022a49376fbdd5459aebd0645ab38f19e1e4f1786931f4ae66199064ac74ae778c562b8a778ae8332b5c99f129ed982a9f58959bcb17a47be5bf601f4ee981c874e89a952844bf86c03674ce895c8c304e0e840a198ae21583c2627886d964ca0db05e4018902a03b6597c8a1c1d2a26002c42c53e66c6298cccc017b1279a936de2d6204252c08e2b5784a24116c7c9e0fb8606c27c20c94cb1ba26c7420b93961fd41d5a743e76e28c7fd235754521ed94628e4e30b3ae6e769c9bac91391f3f268bc5a339b32f743d72c5fda706521a93df229927d2d4fdac5f2d0b699f8bd2d4ae9d5b72a25c82e1d5606bd20ec76bac2525d03afeeb8c776c44e1f83b51945ba0a8283b1d39866368659fc647f10f098eded0654e61c9c0b1e2ecc575dc62ad6d54a8659d022727c57cb67a8994fd1f8f0ccf86e26bc77161d017ec062c24553e1eb724daf03c656bbd7f469f5aadb9585aabd9d6e89891e147874a48ddd8ebf9d8425243cbaf16df50c1d6236349dfdfc50a785a6b469eb66f90ecba3ae09c15014329684e27f36b35f8bf4396a340bbcd06216933d3c9a541ca6eda6aed0d761c68c324d997b3f3c6793715edb059bafad1f86e81c528f940e55ef3db10b064dd55315515bf1ccdc954efef681f10249261445162fc1b33109799218fd7f1e20157ce6e8518eea8d3497113d1199ee937fc64214f57a46bcbbfca4cc464f426ad07beb5e5ad5abbbd5f7f9db5fdedee47aeeec81387613df3a0b3c999490146949df6178643d8969c90a3c6e11ee37f911d154c187fc04b87b72adc19ed908a844b138962d4df940412d9de175eeec34d63564a51d7c3d96ac04e8db95b6713fef41ad8f38aa2ecad383101b88d2af853d1c492030e0a055f7a0b889c01fb6e0fe816ef687a9fa08f9fa77d3a806b1177df0ed80f2c1ae54c39e1a54f3e64b1963e61fc16cc3e68a00000000000000001272990200000000e0dc4d9d56db2b90adb71a97a9fc7af6172ad6ca3783247b8ae2b07007bc960c1e621cd7919c992b5a15f085fb2bd3c7c0e83401064d2a82cc269125ddb9ba875da8ff21dcdecd3c0fac99f36d8be82a7cdcd2d06afbcec319314b500909016300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d9cd48cdab6f1c56d821cced4035ea533b16a65cb8fc09cb93684139fef2db6bd4a38d23820ad67f538443ceec2fe142f914137495b1245fa68c53d0f7257b5a4959bc64d603e74007f33c705afaf58a422dc0380176619d1274ab854a4886ad72fa70ca7739a6f959378cb078feef37e2190cee8472a928b6db35cfe9197487e8caefaffe0cf4726770f4f3714ee58834e586917d2438da672f3db0af1559274fed218b263062b73b2f1d7fb64295ebdd02b56818509a496406c8c0daa1ecdceebcb537a7f1ea6271b2c0e2de40a6add74a9f7861de6d4076424a333618ccd195ca14d079a829988a52c558a938b4bd28ca1f81d75fe4c23383c8ec441511da6e95f260113ecc107d0ceafe81446140c4b5576e5d543a2137ecdbf56a396e3194086be030c07a88508a5cf155f7b25d342329689ec3d9f034b8c53683a22dcef5d891635fa8285f33f82af3bd32ac75e0bacd2c5e68b5fc9e0263377371cd8d2f738ca460306ccb4d0dab99c85c11ed4b3d5c277af16142959a4fb103b01973fadbd0b64c094ace4c8b42e168bba12f1726e5ecfdf22308f3dd824cb3f51705172d0a786feb6f5e29f65a5f23780e224a38ba5f8885023d4173bcbb27daae5d856b092a47093fa3d7dc557a8227c4a41207d0d90147d5f2f99ddeed3bfc055a36aad9278c87b5dd33c66c4a4841de125ce6f1689ff8bd298d3e39dd1b2e82cd7832f3d1cf0984aaef041bf3983e632f6d3713e1a67c9a167225bc3d3da587fe6b8bce488626c7ef79998c8ac721ac1175d64294485ca4182e201b69969026e228f8bb3d9413157dba129d45b41b452211e3972a52d0136ee41f7a9c62cce2f156180357882944fb82bef3289145f19412aba17c2c49dde844de4aefda2c0ed748fef6b878b2a30a827d9ddd1d84b865eab593d3b85182c5451725a15ac4ce6982301fa703c11c3ea323a6f58461a8083e56369396da74dc2b430b8d1239e266c71377a9934e8fcdbe2797948e220d29ec698ab25c88ce487150b06e88f31f40b30b0c27d296b9ca6136325722d33f950839bfeff7b3c5263d84404a91b14da2abc5232d068cbe2d8d732e8287783d36ad71c43dd607134f031d58a6646b739da123dcdc18c69d07fca45b6e023cd734f500465dd703753df6c3777581ad8f721e1a85616273fef63351f08d69aad8aec449072b8ce3dfd7b9461e1b776f255dbfe6f1e6a07151b252a64e46fbb6665159fe395df1a379a4c9a92ddf48bc51d3502111a6fcfff419db02abee0042c231a4a2e49d50da04046d1fefb71fd03e7089fcdf3e29043e60938d8dfea22fca88db55af4e9aebbcef41d33c316719179e4f83b7e1e84cded3ed87fbdc0640d436f6ba5b846be10c4bd15bfe4ad821fdc27695a0976a3e534f9028eee60e717e6f16c0eab7eb8626f1041a220a9f0279476c9d1d15c4feb85f84ccc5afb4025b6b87019b36188077c98b57e6b05ec76d805fa4cd562ce0632688b9ecee29c105f75aff0b92e47856d551675da0cefa7782d8b7718202e857acf26f8659fda98126bbd871a23f431c06ca3ac0477fa6e39c2216bf2d62908b31767ba01321bd61ec79d615c3825bc2c7d9642b4caf889126a1ef239d8c7e5fb5b478f20955da1cd04a65ead9a08cb04739a7c908e70fbfc9bc83b799de9335e218c83d53130b448946231e2978dd8f28471f5a5508363d55a372e36bed2b613c59d48cf35a64fe11d762fb5190e4f4489ed8fcd71b198b4ee87f839cb8ebc91e8b66392169d2370c3b75bd3a7a90ef9a1f4b2e45d1fada236e2251109f844f7453054536b1be653026e08d4855a29d9eb7a38c6967ec0ec88aabf91e3489095da5f5ebefe102d81427e8ea1907b8a6687f6110833f0024b7670c80f7298fef468122a622a9fff0e16c4213da6a7327344175440d84629a358f9154a313a0754976ec52f045695a9e39d16f5b368281223eb8bfc359eda7819ffc421f64039f78d79dc8b58c8116c2edf4b9a2b2da50cba0ff6e25013c659f47dc18ca186177c2a0263840be45be8e9bc4c3da44f2d0ef815807ab5890232a251565e182e54791aeffb03ce0706d44cd7c95a858f48471da198b4527b7f28e671953fc25bf532c05ff9b21dd618ba174bf5eb9ba40a7a7f05a78777c21190e634706610be5416b221b5246bd71ea47a7e5dad919830da60710c7fc81e5b117c022a28b709419fe933df2baa534c966159115c890c0d2268d0d199824abb89b56f97413665122a827f4fe888035ac3e3e0f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "6365", 0, 1549782633, 1953719636, "97fd81e366dc55d08ff1904fb6f62a02e1b3467598da7c73da3902b3f87926d8"],
+	["0400008085202f8904ca327d2ff83960c2dd474fc5209215cac7b2e5441b63836740cfe22fa652b20a0100000001003dc4fbb466ab1736026ae590fe16560b1c1562c88578780a2faa7668637adf629366447d030000000700636a516352acffffffffa3772e989fa0847753276292d284f91403047edf1f5863f5a1583ab4809801e701000000025153ffffffffae41d32b6644b25d3d4e11992756c78dc7b38bfaa80f6e81d1da260ad4c757a001000000016ae6d914150486b84005000000000653ac65ac63003546ab040000000004ac535263558be1000000000007655151ac52515217a3be020000000008ac6a53656a5151522d94741e4761390cb3bcba000000000003642bb40236e39f1125a83225c711a9a8dba0540ace357c78732dd30aa539f7d4f7b84f90d973152377ff3341cb29e76f5c35b81162aff73e2fb9573469b31f51326e89eb5b9d774c4fd8f6acfa5e4fea8bd4908c86a5e76ca62deec437d4c0603158cecac808524595dcc02454ff26c312bd3b4a4f66e04f9166dd6ff2081355f8bb38d98bbb6e74483c5030d8920cb1fea7faff6457c8ab2a7c1d85543324b11a5e425cae57d238864f233d515d844de750832dbfeeddbc08d09859742b412ce0b50139f68b3436c2603f4842a0f5e95c00cd6e8246bcf03ba25b06088eb4007f02f6c502efb3faa2638916ef1d1777877ed582e7f27e77c1f837f462f3740955400eacd0daf5c1c2772c6cb2118f8dc7850f72f2d044fbe061cb7248a3d14ee7d3bba842b14ce4ee0bb7c28edf1b501e461af706c5de806505499c42986a057413665122a827f4fe888035ac3e3e0f0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000008b205fda056b35b0348b35818e35ccda5782d28394fdfc795f37fdaa7b16a128d543a939160b0e065d58573add275b91c95d555a3806f1cb9cfb8ad13bdbe50b28993e40e28488819b4bbb4d05b0a2e6618472119d39e1079c311f7eddffbbf510b9c36ef342aebbd48f160c31a40c416578813ed6e8c2d1a939e58815f2380a1dd7f1ec15fbe0a3ed2579f708832480e8de25f75564be85ba3f33c2edb9503440a82b94eff94fb1f54ad140243aeb6ae8d46a7d51badf3935abec6d378727c07624f155c0f2a7a673102e0ae6b7e5c81d4653b1ff839f38d45c440d2a5a49801d7bbf9e39e0059c962f6e1622316010c549aba57c3e365af7c8a0f2589a4d6c005447d037b3ab6c33227621d29419b3defee5fdd2400e3a7fe2d644a9f1ed114d699d2595da5b3413231f5416696239835a1dd9afe96300122cb349f059cef87413665122a827f4fe888035ac3e3e0f000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000aad59d1df0260c5935c410f365ee746a3ae779b41f1951c54dc2b0b80759f7a96a1d920024345bec391bfcb4db9b7bb99de77a0146b69ebea649fafba0b0e216fa37220d9202d2671d3554eab1de83a2f40fb542a7d3434ca9520372c4e4bd4351110477f7028e87bc2307ae3124a76467029c0c5edc367e06321a97c7e48eac67110a05cca5b74e79cb16d35285974fd5b638b6f002f305369bca1830a07adbf67df8826f511759793aac43a96398613ec6ba2b62fcd1f26810501a068b51f3748244487cc1df92e2498da28d347de8e7321a7c3c8929499ae884a9254e30a5821ff0a116ca95006f3a050d5f2c82414be84e4e0064136e2a9b2edac0f903eae936e0b1d8e93749c6c71fd585002dcb5e83fd3e4ee008ad6e56f10b52641c0faae8f535ee6a4f8f11c4ead6f705afec59a97ee9b448727709ed78055051d8157413665122a827f4fe888035ac3e3e0f0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000486a3ca60579c328a38d69a85a00842eba78ffb4304cd39f780c31a3d2c43de70fd2233ec5abf8e1110f162d59c120546f570a3e8f7a77f5d9b6bfdde4d20ee45be0f5ac4ea1543ae292b77d64f624332cbf0b8607b706b7a03b7b84ab224b0b3b95fefc0ff4cad94d106ae4e103f70ea59b4e54ce7c0953fcd67e11e19f54e0402f4e2052a600c4c7b31284adf9bdcb9db028edfde7c20e74d7421c425c6a71a869477b013281fe20f63d35085b566150f8e15ad1464c93c4bf020abbcec51a83a97109b3d71c56b8441ad9cff10ddad0dadf2f6f2a63b4a6eebfb1fe1f6abb487df875421f9e8b22aa5f461f8fdee0fab25b47741e81b030f2b7089936ade13f9754dfa4bcd77cf76268301c71a69b1652f8be41d430695e2b4e5271dd4586c36e91d7357176a304b8dc51eb4a7eae0e25487f9abdf27cafb7dff68657aa0e6abad7fc32382780685e22f88266774ed3342734142868350615bfbaacf9d249939c02c74f87876e17dba0de33fae5f75af0b9ebc075e4ae5c5415cd19a96ffeaf479ea435d5d6b4253bb7dfd05d657e01e82bc651317c7c53438bd506d565416497733e184a7098dc282328a585a6dd2c3eb8540d86227e1cfcfce28447a01c71881a44f52968f0ab9298eee57bae71c1d9e9bdcd0be8b7b964bd965c7ca9050a7922d8e7c9ed90a7c994178f9b1acd264973bec1417c14927cb26dedcf3f2e683f81801120558802aa884ae2e13cca3f84e92859b2d2f53a2eab41babce6ab2e9ae0ddbe84f56cc1bab2882c339e6d744fc6da021d29fbffc5c47d315ca46e11a0a34e6afc4dd9eea23749cfb54a8f706d942221effbc3aefc5b06de577d0b3a7bfafe5d7ca53a34cfb0ba8c7d2eafe1b2291928295231fbd191a8fb15d798362ab777a0969242d39277b577eca02154c76ca56f6dd5dbf0545d53b7a1aa58298c74d7105a1357aea44aaed6c1c20ab05f419c83b5278f2358053e931214c549b69574ee6477b50579082e971d6b54a6ee351c1bb6c0c86cbebbe023f7340151b753cf012a3b183899f610ef11141717b5c07ca43b57758a17b9c99585de035de7844b4ca9822649b2ccd358b4853018c1c9ed3bc8ba1c68591e5ded2ed2c1a8c04c9d8a041ecdbf218bb3914974031d9c9891f32c541fde0a0ca2308ade922d7015f27da4e2acfcf4d0b565dcaeea7d422c10e20e5252e4d768e49c245a0d5a063ddc774803d2e32ec098d1adfb964c73ee7e140bffee5f1ed63baf3b0a9ca652923f143d9c1b541998cfe5e37c55f49a361a70fdb3848e533bc6c28af3900cd410d007af3b8e8f5d6e9d093385627789a1b1dd72ad469e9a56b134935e24511d435c46553a1c7565bd7d055f2273f1eaefda5cf9d03afa3ca78a8760bd23a9ff9734557126985b5827f9087d141652a18051bdbb1ea72c4bd03e1f816dce41986383f321cdec4a51d08732464ce1693bf2b1696fa2e8ef420f35e89518f394a042352d4f5c5c89fda054ebcb129e899fd3a8dc322b445e90164422209f337758b17572eabac549a9e2cd50964c4a69adc419d57b98667ceb176a7fa183b10be3df4eb63b94360575f05b863edca8c0a1b216257690058682a2022f6fbb8eb89578fef2658e758f7c61ce3a261e0e10fdab0376cb1cb6d3d0c1babe10ec15e3d05e35a653c68a5ba7d1c0ff0eb3bcd843809b9c2235fe9576ed9da49c4f4b61c406b4ce91a52fb943f443900ffb7781fc16ee61515cc1db499081e7eee99b6e63d06da3777e4e329d6acec034e3215e1206b06d5017589d3bcdc69fd2a90061fec87e15d0ed9e55f4eded218466c28536981cfd3438ec7d17e9a63ffb6dfd3a8de236342e7910409a43122521274dde02c39d44691cb5115589f649ce92edd9b5ca3823446a84959aed858bd5d7be77ae11574b1fd804b706e142ccba5a75f2d3ad6c62913ae6f1089eb50b7d0c796be59bcb0f902d808f609af1f2c42dbd4f4e6294383c843b89a6e82f434b001334914e63325568c1f68ec864d654b62b182466f98f52ff73f069c815cec29a706e629896cc2c645b55e44de9371e6b17bef67ff6536c1816eb596c1464a8e9c524088e036fec41cb577a8cad8b02f17fe91a5c7f6d2b0e4efcb60394a72cba33650438176acfdbbaf5b0ff3a9349931043e92fbc99c30a8f8fc6c0e3c8b99065a55bc981e641e790164abb9ea008a86c3590cf63661c66d0f454464c3ff1ac75fbb826db2d6e5ad8e18793bdefdaee5cb980855d56cdc643a0ab5a332b92e232b3512123cd6cfb4ee2440bf7b2fc155a5db6528960006ae4ee66ad5b7d62aa0c5bdb97e9612c66792c53b78fa8f063a98800aad3eae6fa7700b5d7a66b4da130348d56bd6c220f556a77d74c48e6a9185e8c80e5565d961dd929f68d8951aee92831c8bfc6b0ceac95a502047553a741a7f6c3115885f747ce75cf198aa21933ba2701960d9303a673425dbee850e9358e9e9bc9d17868ff75bd541adab2fe03d189db9422be2b6b1c4da496a813ef06ebfce0a9b0fa91d26ac90819cfd71d1a54444a7476d91a16a616557d2bd38b012bb9cc4c81105fba32d5dd6233cf91e39b2946ac4a1e153ffd5f372742daf94dddf36306919ae3368aebff54681f33954db560edcb391876e8e2374cdc0b5c8643c4e3b8aa4b1fcdd4e1d465e668a5b97834811e88378725205614b5273807a7b1d15f896a5a679d128d9cf72505ac9e9f4b075b69f0d67ca418b6d1bfc963f273ccc5aa8a086de4273b6a5a1baf67f415e3b71cfd25b84f84d9f27fae85d9e44c2c4bcee4c55fb1a0632aa552fad6551f94c0bb93ace36ac2ebb9118e66098ee65327116f718dd46793680ed3d981e15d91ce1d8190b1f8e303509af2db2cd0452bdb7d5b435918c7b0a4f08ca060eb82ee2616e8eed17f796402da5137ec3c1fe962847b534e369dd09d2bcb2025b462b1fe95e038bfe59656258e9282bfc8ce11b14064f165e1d0dbddf43cd3870fb5ae555f8af41c298eb2e3d45aa177216a84e1b9f5b7363b45d369c7506055ad7c084674fedac53ac1dec483c8e49206b8d13fe6150995157b4f1044cc415a166cf897281b34fa3b0ec12eccb6eff4d40b152523786f86490c3d296f52de3fbb29b08950c4a9b488324128ae4fb5a6b8ea46f25d3095ade797bd66c891e4d04ac261e6582384a192f391f3bd1044ececf412ab260e0509954e6e2a691e6b362795ca243e5afa69aa1565b321ae37d01caa315d2021345ad8c2a21f59069b31696d3b513b1ede8385c155ef375ca9560237a26203b1d0e098e3f6931ac9b8f11adb2a388de9624fb8d4a5ae97afcb07d447990a907dc9e1f7e2cf672db44ff557fe5e9171f00bb7e08ee3607b09187d4229c232d701d6cab6f82c6f433daf38f097dd54cb57d65e36a76d6801e8af4e77eabd29b659d3b7cf3a5a875d62c98f4d2c20146a9f91825469d9eb3c415246568700792e87e475cfa7599dece2f75edb914d2cd91de2c8e0427e63cc803925cb90a98fe41ac8467241f77481f66edda5e7148a297fc7310607b71dea396297106c67c2bec92c1068d9970de456fd2cb0bd37f485f936a0a2530a5d56097f9e70bfbed4599d99beb88b0a81317ba5f632c5bfd4277ab782b5f3065df23537bffe56696acf0318b5eefa18cd382be5561e8fe01f663eb77436b13c7432b7a3516d2b24e298793260b7db04f5bab4bb1ca54419fecfa81678284fa5064535aafd04ec309c6d7de5629ede0229c6a7efde0f6410d05b029a704beff8ac1777b307bac4c28e30c5c236b47cd5a531514476e75144dac64702ea0c8a1121ac3b15768795380f2bec9a88a0d0cef7ce9666387ce51ecbe2207c3a2718a290132f0d078bd5c079934fc3a0f8919c5fd54c4afa66733116188625dc7648aed233f24656e9d67d2ba822b40ae8559b1450755707febc883f9b6f5e6674dc56c9b37f3bd4349bd3d3fea0cb28e5bb0d80813afc8e07c0bdbaaaa8af5959440b0dac51aa30a30dd46efb09760ec40ca86221750666def52c34b86dac0bd10cf6db681854be6bd908d0648dae6be153d694e02c84b9fa5554ff66b46adcaa33c2c70571ca7ae90686e379b2083636df8336ff9e31a3b70e6f5c187e35abf5217e7ab03c599b4feef661158624eaf9d6ec7c962f40930c993758d2aeab845389fdc45d3db6266425ab6496c21d8d630265fc407c6720b4513d7f2bdc975e3f21c473ec04acfc456e296cf67b9f4a823c5b317d721139d8573d080aab08d04270aa829a071de98121caf621eb3d1adca96b763ba4f4c6f63caba0f2816297dcaefdcab2abca94db5c5a41097aa4cb3a6a2731ff1573452e6d81dfc0ca89ce46d57265682a03d4906b5536f1032817acebd3a8c122dee091454e83e607bc792e0e76f6661bac7c16d26f7521b374eaae5cac91455195e3a816dd404463e2edcd3b78b0443b8f0d88be3f509f56f80465d16760cc495cb294078c9321ef7a1001254c99c0a9c4887d58ab4e0da8d957efecbdd3db533bcd3d600a32b7cf348f9a30bbf97cc52d4227aa3b913455d515907eb7b703cbdbf5266f1f438c950e510883ea6f3128d247df41e263136d34e1f6fb9c44eaaf6ae6fd81434621aac6acf114351149ef7fb2e05e5b32999187a1f8f50ad8aef8ea194b1ae78eb2c984c410101a90d2fce01e99e3d0e7c729ad46a7dc39e2bcad508453f1224e3255f87cc235259f10b36b65b89e93212f426ea1676bca2854866eb76f8928216e5680d51a39f7a3fc6aef0ee33e954b8e42d4ce925b788eba6424895902f457d8453d3e1e1ac5c0b6b4c982bc7227d5cf830f5c9e0382a5002c2c02ae29553a3dbf756a93bf47688d91c7e922ef0cc2b129191c610262710325c95be2a384bd9a8151b228ba642470c4e79a05ba13dab9aba01f2b21d9352889b81154991beb8f088d8c9642db3012b30b68e278ca8939e151a4c50c428b40b95423d1f9621e23f3c4ad7bf343c5dc18ca99b103f776b0e1b9420c63fe844629a6712ff298e108dfc2ffd6a69da6ada58fee21aaaed2cf12a5e657af1dd04aabe7861ef3c7a20859d9a776317893afd69587d1fd829d77da5506de067bfb115c3889b65117ae006d29ac68565d003edc0a37b21c779142c8ffe0f146c9d611824f44dbe84322905146d2593e0bc5ba93ebd14673ae77e1ede54cd8e5aa8a68302f910db08ed63a7b6c93dbcbadee7bdc20bf5c72228c265fe389e726b28fd095a572fde518735c301c720d6063416e70a4ec2a14f3d56222e34995d280d4fe1dd9d51a7eebf4cfb492499c41c700aa2687ad80b917dc974af20531baedc59cf5e346753020000000000000000331898050000000077b9691497a17347d129d27c3db3b1234864a33bcbb4768986467178ee3226a5cf9b83a6ec6fdfc60da50357828a19a1ba9d7ce9c65c6dea257d1592f0336a34fc93358864efddb73ce3193f83258a926dae5c2ce974b79f52fb13442dfcad1500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000a3529707cd021925a4930b668401e573c27157f1234e0bc8314994e26855b707aa296ee6bef476c0a2cff80be7c93693996db9b51feb20b4aa9862849e1056392c9dbc1c5d7bcbaaf53b1eb91978cbbc2efb3b0b25983899243c1570bde52f199205e783a3d6f8ce0550c37bb05f18570b7d20dfa4e5624cca073a70a14727595e348b9437d0eb829ac92d61641a89b029b5983d6e8d4be83a60e100c5fb8677cbb08da0f50009bd386ac7cf39a2fb8d69b25a82f7bca3e8c68de2b6b282f6d068718709e22716c182f89720d0ee354aac0a9d47dbe0a7e9a03a557a684a28cb53c447e89ab8f66cee9ca0678bbceb9936be5f8935b5c7f66cb7a288b3e8f5162210c37f8034b9cd7607adc4f6611cedd345a7a7f4c1634b6fa839d954475c907992eb0c817fa3e55ecad7e35891776049430dfdda50482f90b4406e0d0ff6ab0c08020758072babab2c2056959d62d5025f7392cdf29a18d69fc4a58bb3b5aefc2a1f14ea76497bc304dcbf659e8d88733d62060fc272b5271d751bcabb854bb95cff9e93b986c0c4af62866e35f86648d7d75dd00242227a2f5be2ea21cb90103adcbc35dd5a0530461c872362c7d09893b089ff5d039e19eb304db72f90b5b97eba35bc2e9d0ad49849ecd23da191caf416dd72989d1305a92b78e2337840a9419bfc91af2928bf32192c26fcbf1381c9d461387957c8959c942a18fb0c99d5c9779f7485a034e565c42b167a8a38d6f08bb6b2d60b6e4f0ba66eb324569fbe8eb79a573a6d01ac85b47357cfe11084c7020406a444a90ca5ad1d911edf7ff35cd4ceb383ce8bb521aaf1f3031f566ada090f4704792994b15acd043f553354a96f16c8366fae13fd22bafae1f3249ca1107ce587b7db337d06422baceaf91836b5c03c3f6315d6cd6e6e027ed9b57801cdb3e6b5051517bebd99ca63cacfb10b721023ea240534fe2cb65fb2f802c1dd76e2b84c4da614230a3fa8c57f39ca54041801abdcf3cd4eb3c70736866dfd93d99b81289790e33c0406f94e943dd284d19e45c708f44555b7abd9401fd2ef9228f070290e592737178e4ddad5dbcd751fb3e2ff67b87f29ef9dd25449545463ae5c33e84f009f14fcf24754d90f796082de97fdbcb246736e29c13bbe40d005488a870b0e0ec19099a9a35319c0167cf4a08c927492f13675d2877fc28825111ea70adeb3810f2927cd09853ca45c9e9b4967bae6e0c324131284e99e97cc8b06cebf29cfbdcb52b392098f63c91c08ed1caa5c58335dfb5e12382fc6b02397df449375284a6420968d3586d7d7c4ade33a3289c307972197cd5742ea8e7cc51e10b85494860b85301228c41b920b0e38d0be624287cf67ed1ea6b353204e17d1aa3c127ca46ede5653f002e25b7b7f2e8a4e5ba2034f2d8e4633264b76035295da8c6dce6f422e4cf2334d570749fa78f326453c5183f2368549ba39409a9d9b4410c8f34e414288ebcdaf31ae7a815b94bc910e9b8266487dc13e5c2379d8ac411c7b4cfe651e9924d2f8017981b6c4abf7be1f572864a673112d0acddd30c602895c26640cf1023abf05c6c9869b706e8dd23a262949f55cd6305019eb3b2bed995fe01fb57de0b5aed716c405afa9e9c1ba5b924dfd8db2022b393b2d47c99980c634f219c0d951d146168e4002d65d2c948b6495261081fdeba9c341acf5496eb2644da02a48fc2d1bc87ef2118e07b831ae4ad481ee04c78ff63d29391defe647459e4d9613692a52c6de22f3524d2157e837f455e4537c8e4cedfe0030f396e518c99998fe0c7863e3059c8972906c0d9d37cdabb415c75e156e7fe29735e4ec9c72a83419d83fedcd39a8e50b86cc813db0cbdec30290faf5cd1bc4ea94dc414e4bbac9afa32ecdee2332990105f8e0bd5c6991bc6048e0c286acaf4315c70c8fad7ec71fce7ff874fa1df52918116219f3c2e8e8b8085d3522080abc5560085af2bb1c1e37eb0841b87b16e3be032d0b68f8e5e6ce5d21a2da3244e201c3b4f881c91041c2b9676f1f47e8d6a4214bf8dc61f53f49680a391f66d33117573d7a1762811e0bb1a708aff189d7036fa6330e7c4da2636b8593d1d27ec236a302a53dcc2c0134776cad88b0694955d325918ca65207c78526f4043562b7857b0400000000000000000000000024388d67ca18f153adbc10124369d791547c94762512e61c0cb2bfdab320fd5442c6d486dbbdaa9e68ae5b68f1acbf32ac2407d859d6d0739297fc55e63c930ed259035e3935a885927762c8daaaf0342ca28443cd8356d751546e2ca83fa15a00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000fd0850588cebf67c7c1eb5a1ea6d79d754eb264b3e29e59581f29d327bcefaf26bc4ed3d7fb4731cc0680bf7abd6c9c280170c66431ad621795fbb2d40acf162c1964b676fba8f700ef715572677d5aa1d156de9e688e80512cffc13402a99b3944623cfda03f629d64cc5cd74770423d1d8a081ddca6d9cd4b5897d959edc6d89967ed77b3562604ae841b5b65e50a3305d984daa51a6169b78621cd016ed9a703364ef4bdc5eeee9092608025efb31344f9505e97d01d4fa42c9a406284310d6fb5ba2e204aca2f9c273f806ad1791a642897a8e38576f8a55ed355092599467354a0cdce9a075b70ebd71c436234554596e7342b716d4b2ff9fca7add983de45cda589e0e1e4ca310f0029832ad421526e0a70d24f264d5f0064f11ca0fe8de4b5dc9f4423731930798982e9e7ed3956a962f870fd07dfcf7b29fe467b9be82283c9d48aeb05b5308c8e7f61dd0634dcbb3c3a835ccc851e7969f78ee6c9c1dcf539ca564628a50062b2607106486130997987bc3679ba88f3c806def811781e6c93595d21c09880e8d200dd60c2db72021da6fe7b17f154254b19323c8a7716949382fd796d63ad1024fb657ebe01a448ee50420330f5b9d81dc3102160840b6a9e8d74ebdf976616bb47a08370a0e7ae3bce0f5a55436b44d456e0138439b0b2a7780873b8b4fb18d1e4d48ccf0fed3648817210a837b22aa03de02d97291f4fc5a583997afae071bc63baa379652372ae547fc834ae04f4fe2084c8e57a09934444cf0b6833d534b61ab7955c3f047c8fe9036060449028344c29f83c7c647e9ddaa7abe8952546efe681eac1a5f8c45bdd4c9cd1e5799e5a81db0087c471f7566e0664fd9b78786896510d2bc96a3784ad1432eacde7bd2132a8d3328892f169adcdba58f0d7841c482346d33403552ef9f7cbae5fed85683d985a4f53ea7bf010c1a469ab854b23f0d0e269910522674c2dd8bf65fba67ad7e8fb100f97fb7782c5bac9a4f87bce3cc0ce09268be0151a53f390af3d7cf73e8a8c14aaaaea586399fb02eb748f68ffe385e42d17c7b9e981a249268aec079d714f18945eac91da36f64ec0ff2658066827082057b98e64a210bcbff0bd8b35980b4fc3d9a18dea4f9fd833ee46ba387eb473508aeb382ee8d78c04ace2e2e9c1080f5bc6336767e3df1529d17e412cf953152c15b14de0c9f84465aa61667db8b6c3a5763233477f7138e40bcc733a5c355f5b3a46a94b60e4d814c8f06a3c8fa6da5e9e20e8a6dc3687f9cb9c95fa57d4802e082b82f1f98ab01c9733e92000f92ce0051beb510e1c829e6d7edcb172e78a53394430b0261411ed345d8d35ebc41ff90a647de351c328b9eef6861bbbbf1fb4517625a814d379233c85e9a995fe0390276352b40051b8a403f4557f8a689882ecacab4ec02ae55fb4f812b43459271f4aec921cc367c3ed4ab25f9038c5153f153a37dedb7f07fea3ab76621aa8ddd4f1b30f8f097bdccc2d7a72f91eb323b5dff9a651a632f1b0b9e4d2c9d0d24a52f582c226c52f600c2db3ed90ae4c45efe3315aba0b6650ceed198baf7ff3f75e04e4992fbaaca5b2477aabd1aff43eb8cfdbdfc00830c5495e3c8d3de8df1a718df9d96679441723c43798af62fae7ce5f24d9e0493fc9cb1c2a5e722528cdcab04fb5ec4da059b3a2a1482237aa65954d689934c7814884402199b1d70dfc102a25087e26f63328bf61b34c25fc39f18b3a75d8bccee6f5c556635b66b41888422bb4977f474ad1ff61debd96da44329520ce85c20db5a04ebd2ec6752f870aca46f8a90b017106e49b85ff685ee4b065ba755ba6c21025ee70bcabc284b6571677e0b3ecc490c39d415ea5010703f9c36ca74bffb11f15322761e9b8e6a7abaa5f11dfa1f1374904f29b1e9176e4b456613ae7a3a0c60fbe89ce4ee9829d11a0bc67686cc0f826b6f241dfd0d773ddb0195039b82e6ca8f9e60f9457c41cc8f317c803c9025427743a4e097fee5cc8a73c60d6ae073519e86c62a6d2a5f1dd78fc17e26732088c37cef73576e2d9a79d82c39236d025895e077a743fb0c91d0e16225b17f6bdcd6a1da68a8f7539537486920b9b50b8bd7d7c03460582332ea8eed3f9cf1104323dbf4e19f3a9950a3f91df8980bc8352f31776722942c09a84fd295f03b3f0bb69d793306304f27de1ea68a22c1350202951bc90bf1d61145f72c5c2bdcd0eca12148c66356287b5de1d1e7e8680c30ae71f47e96617d0e26b0d31ea917786c14a27a9bf5b59828410300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "63ac516a", 1, 1486318088, 4122551051, "a5414a66c55b6085c31df135b839413e025e541d080cc321635acb3f56cad7b5"],
+	["030000807082c4030364487df43b7be7de32b0bb5942f3b1907ffb75131e0a5013544492d71f3124520200000003ac525302a2cb0867753978265ca20ba752e24da104d73ea20b589bde3bee1d536469c050803111010000000751525300536551ffffffff38823a5fc3a081b7fbf39f43ff52cca963ac9a2e70d3b2189fe97a7373fbecb302000000055363635251ffffffff048ede850300000000076363636a63ac52c9abac05000000000265517fdb54000000000003ac535223fd5000000000000665636aac6552e24af9ad0000000000", "515353ac6a525351ac", 2, -2023637127, 4122551051, "07e303fe243ad340cbcd6305ca6c4d87cdc8719bdd9de20818642bfbe2133fe7"],
+	["2236c3120465bedaff0efd3c8caa10aeb237c412aba64791f80840e7bc5a66085515b09102000000000252acffffffff89d07edb34cfd2963a85af22cdacd7b51bcb54bc28047f6ea758fb4b84da9bc4000000000165ffffffff3476eca4b829bea69fbea8133f47da697bc2bfa1541ea930d810a2bebcb934c90100000006525300636351a3383aa30703b60b65640395b1a22897d8f689396fea496198d419cadf4cd3cd913e5c970200000003ac6353819fb0e302b5b31c000000000005ac00ac006aee9867050000000004536a53530000000000", "5251", 3, -807871300, 0, "8ac6c3241fcd9261ba5f2241915c881684eaa736a8421ea7d5a4650263a2ca29"],
+	["030000807082c40304ebe54d081d02512204df909123ff4a02b32a481379a135a332cf659bf819e83103000000025165ffffffff9dcc0e10c3e1486144149f7da2ddeb8c96777391ba3a9195deb56649d6bceb83030000000263522e50fa34e95ea3f09bd5665fe4df9bb9cdf6d8adf95b44a92709dfffb40a944d37657f820200000009ac6a6a536a6aac6a65ffffffff170215a280128295ed227984e585329330ccf03fc4346c400f2581f0e44af2200300000002636affffffff04687503030000000006535253656553306d8e04000000000951636a535263006a6531e3f00500000000020053e7d198000000000007526a0053ac6351595c5a200000000000", "ac5352635265510063", 2, 974812735, 1953719636, "caa2440b4d61cc3553645be59cdceec45b363085f889686876eda0f85dd4509e"],
+	["030000807082c4030126763823228a185296a3c1336df6b7d6f292b9b587091aed286f7f68c2f5802a00000000086300ac53630052535f17e0cb01e2d2a9020000000003acac65000000000000000000", "51", 0, 2038906792, 1953719636, "026e3a205a430b7d01799be99d56443a7d269511391ac1a3197ef87aee177fdb"],
+	["0400008085202f89038705011721cd2b32ca3168f0dd8fdab2319af8e947ba0637b171b084361e1aa6000000000100ffffffff5a3e92944d282cd3465e834dde257270f77ab1c7ea1b7163905c7f71cb9445d90200000005520065536394f39ee22b010dfd4bf8e904a1d272e70ddae388d554eb3cecf4046521646dbb08586370020000000451635200eecccdf802f66ee8050000000003526a51c6f66d050000000004656a526aa7d4c81400000000168042000000000004ad18dfecffd88e562b9c378e9c6061e51938d93c60ea162750aff014b0fd6e9460c57599de832b82d47e81520c047124e9535614bc1b6b4231bd1082a6e56551bd6052f3020a65051317522f75182f715901d33c0298a1a2ce50dc3a233673a404cc66f34e361664db2d38285a3701c0bdee7ef93fbdde82d2ebc3d846a26f2742d06503d618c8fefa26858dbe48cc9d2baf0413bbb09226246ff27198a6e894763656b59ad15ebbe059ddaa7396a746c23b43ed2d540081be9de95f14f74d1dac3e017975710ac34b9259a69efc8dfc22b570dccbba47ff38582eefe51fddb434e28721e5b37c53f55e4044423503b9a41c25a86b2fcd431f276c09eb79951dcbfb8347e4a37848d961c3d90a0d33870e057b798be048263b6b68ae7000919583482dcb9e42417e45327c0a887faf2416f43c58e8bc101664e4c74b1de6d8ccd31ea917786c14a27a9bf5b598284103000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ac3273cd3885c560c10180b106f7f9f1d74e63d9e3f72e7d7b00b0a3ba6d74d89f9d672e111aa834a3d2958958e26a69626ed871d8fd702ac681315832f1fc10269bdd0a851d0a23816292b3f6c65418b96b5a97b2a108262a8c0f7c47574a4ff4a6feb070d374f635e631c4864460f98df997068acf71595e488f3f011ede3d05a5dfbe6b59b12f05874704e8687981689dfffbb11d996fc10f8574722af5b6b2b55ad4e0a6bf4615c62d925e9063a477165b64758a86c4df30ec75eb2856ecf416909cb029ebeee491fc886146c2c54d9cc57c63ba559c18451cee4d7f2fb14f428eb54a0d849792e5bc0402d98b7b1919e6e9a5a42e293098ff9db9f7ac08df31200543a42ffe2ddc1252ac0ccb1d38089b3a2436786b2d58764a12a3b3f4072aa984cfe1bc6a42da88b21fff9f37c23ce03726d493bd8e0b3327fc4b785ad31ea917786c14a27a9bf5b598284103000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000a3bb2f11bcc258b6472f3a1a0d53cbdd9751c70356f885c72a24da4a59bd6af0bc4aafb98e170952c82d310c45735d7591d68e2960d080a47791f9535843ab21f5092e797763536f43ff0546c5c7d64d3a3c6f7f2ead66a8a9da72070222a577894f623e7f4aac45e1ff229c09c9927f5283c3f7563fe0d621c28dbf9988542b0408594331c16677574487ae99078be88f63fbcd8c45ae915a153ea5e2ab8f02d15eb51205a541f906ab1caa4245d4ba92848a43bc83328ca21ccaf283ee12c183dad987932cc47965a28dec67d2afaa5d5b2bb1a47dc3cd4af47c2a37b9cd64b3f4b0b1330633d1da992fa78ab2725ade8a5f1f079a3f4d965beeb41ce42d97cbbee6fb250020a16b457baecdccf0fe36eba7863b1b3ce9703f69123c106bb7824fb63000d5429771e8ac0c4c8fc3b8af2010e985cb2e74bb1e4da8d21bae34d31ea917786c14a27a9bf5b598284103000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000e5d58e35936a79a0067c69a1680e339e78c654dda3afdccfc5902c86f113436f07b101b8e956ce1a537f9a057e3b9d372239d9920362b6d8b990fbbb32393524edcc2d42cd5fdbb9f59c74a88a6ba18d28d37fb52a4dd598a23265f3f7f0efc28f6b307da2971629364a2889b233c4e4e8edd79dde3ba5f14cdcbd7c08a18d97bad6523a589ae79653f90e4f4ee6488333ed3a4594386ee742274f43ab476196778b0883cc6c1c4b4bfbe9fa454655772734e11196105b9939adf39a20dd6aacf14165508dee8a8d9192af2ad13e33df5fac640d407b89e4b3f8e94059559ee3cd48ec22c08f87826506cb00e02c2a3471d50afd640135186dfb5b101f592375a91ebede7ce214c141a250131b06836a83919cb1a35eac346ea3fd926a42eeb38bd677a96e57df0ad834014b5c092c3d30cdc88adc7ae8e3ff7addf7e749ede8d31ea917786c14a27a9bf5b5982841030000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000476639b0b781dc5958867bb5bf481130fb620cb5de79517e14d2e65c679f08082ef35d4744a443b2c48a434b72610aa9102581448710963c48aa90dc28049cf31b6cbbcd9289061eb4a98605399179215365ea68d15449297671a4b310a35bcb5caeabe52a4b81d9ebf09b44c8e2136a6eccec366752c9266595f371abcbd54cf60f7ddc6e9ccc0829fdad2fcbe6a504252b31f3e6b80d43e27a93f11b2f600f06e31136c085078ffe80e318160020492a3c96151ad286d210de4b5fe4ace44b1f16db18554082d68946ebd749af2d767b800d7b46605b180ba56ae0dc0b49ec4912588dc1d777fadf57bcb455b9585585b249ada998640eb772c885019b3cb4f9695a0884072502d4c59bb7bb1ff4f5f05378ec6c7f7b8753ae37edca8d262d640503e24efad04167fabaa08f5f59ac3b5ab84c66727f7b2f7607c6f7e579a5c9a4f04469009086947d76531eaf53243db3236e4e514e57ba1d27dfd314d75cf7dddc6165bff84817733d0a2893fc38439d86679ab7aa5eb61459d971bbbbdecde6e37c2b337db8082fcf910a0a69a27f9308ec24b66efd6df931a601f179c6c0c447c020bb49c3b97094e6f5e5c5861333f2c391ac83cf95b67eac79dcb98ff0e5057252c6bd1fbc182e1143f3654250528fc9907ab1d333351355fa114c6ba5bd2cca56700c2197867b37685eb8010b28e7d74245464bf38caed5ea881086909f7b2ed8eafbc407a7a30c147850825c9143f21f0653c1dac4d04631ae69ce7993564ec87079d43892c469510bdf5d7e2a15fe7ab9ca7a53bf369063d02714cae05eafd2d4f01ce976eb4d04b55e2fd0f8fd596fe511e97eedc8d35d30faf552ee12f57486987ff250f1d5ec6f97b019c1329ed567a6df6d21df14bc1b7705a63e28b871e3f47905c4c691bfb5df760f9a166d99904a6db7a997693772570dfc51dd55aff37fc2bb515f7ff88c20139ba44c3166d2b954c857c5b8f989225d101d24ebd5ee6b113165e0efcc1adf189b4adc78722653fdc2fa07969e6b675c41d280e999a100a169f61e5af8aaf2f3aec0b56da228e19a8d5a4cb7fdef1d631168c44086396243aca076f716828616efef5b5af8d3f39fdde8906108e310e81c665136251a39c3f83772f14a11746947e82b8cbb077578a4d285455a44d0772f0e7df6b2f4c75cfab5f330243f7a599281ab7802f389193e385b93d5b29ebe8ab17f09a623eb9bbe1738ae3f781f7e66f53f8d9b6f03fc8ab03f547613a241c0c2c4b14ec732b6e89e01f6cec3700d10b6ffb4a931d56b274f22aae32c40bb7393d749b810f7c914dd692d25c9e64f38e0361ba21527c8c080d4057d061683922333c04f27af2eb9155b0c2ab66a6eefdbcd70e79d21fcceb94252509b30db63cd1d9951a6f89fe9285bd1ab056dc6792db0309952c56d2f955c6cec31f942289ec795cccc9d3b99ac3f32435a4554fe94a8d3e1f3403f04d8a08f41b474577356118a81272bb6ace45af6bcc938bed6f4a84bf8d6018412a939ef47169fd5d29656aa1bb86fa5c7a9d0344f9c921cbf59c5ff3e85fde3b8d44b78ede697b577eaef9a5424718db571bf9b3af39156e75ef2d9cb4d80ad35de6f00486d4d4e36fe359d0cc0c3c47c64a8ad16acd3d3ccd43fcf0feefb7eb9c49e90c507c462eeb149f7db9af7460a385715b3d4c4f77f528be70cda473dc57276b221370548178502f011da81142bcd509b94f175bc5f758d96d2b3ee298f060669b700c585ef89a374482b8d089786d5a2f7e8d7e89a9f6bc0fa5b80834af9eb60c579338f56c87a7053e67c162cdbef4e731f490c10d121f9383de039151192ccdf5c547d75239d0bb757f44c6cbbc7f155dbb4a10884a5e93a7806da6fbdc052774af5e39bcc42c8f771ffaf5d6da098b7b0be64fb5e6263cdb1e329a54792a43c5dfec494e6b32fb8c5fcc28ea37fdd6804190765d941e738e5dd3020d08b64b1931a173661843a436b4edbc3a01ea516ae97e7e8a242b8cfb1f6d1ba97b0cc61c28f43dec5ea8e775cc8903ac56c9fabc9df171b53f06486304baacc4c31592beb4caabe4a5b35c3e5ff59432845392441c1b6001e47aa2f573371f645847a45971a6537f22f8886793d17a6d90d2b46d241f298a7e82d818929f39fcdfc7e25c285c3d6d95e86390c481640f5173382b878a18915316d3cd98da07e21369c488c28db8a5dd2f18331807fb6a24335d4c67162e83fff46ac16aa16a0868e5c4f9652fb72b4c3c940eca01cf77ef23e1348b217ef352c9128b178555312971fa066f8d7d2c8ec6a4600de0d4f2eb2ead7e05c9187a2f2cdcfcbe468136800edd8414ec620700f013f6edf544953eac836c907480d664353e457daa8090e11c9590020f73e9f5ebdb1a09da21057642b13fc75fa0cddf634a5dbdea4e8801a2b967cfcddd4af38d2f4eadb62609a716d0ff9b6203fd1d786c25f9f244154f156564ec44902095f66a2b8b400c96dae7ad566b070dffe8781bd852e7e910159e4472bfcdf89191b5713b83a660972cade11cb9c87b105ae20804a0ec4e4d7df7791a3f52eb197e11cc26cecde95ecc83e0298bcfdf404ef1938913e4716d74f9eac59e9b2415ba293f064275a1c01845c54fb526b3c27ce395a82fb487a6b49f206dbfabb9eec42de8a85dfaefd956947ded74d50f00eb37b8363e0cff4df929f155e44d0d37dd3c273aa0b4267bb66cc620e3114660f686a4a57bfd355b5be4a59828ef06aa8abbf3c179842e51ea1ea514ea89d1936ee51ce7ad7190e9be741487819f5e98e81b8319fbc9ce44b6ba94f6d7c57b63f61bea707efb82842e330a26b980944bb6083c86877c33c537b5c1ba69264481b9d445da650481064c7783dc7b475d973d07c1bf7b859a16843709b9b5874c68310d466c05a7d307feb0f67102907f2b3bb55279d2491b807d87e33db47ac9fba34a4faea461d65a10c7ec6b2b7791044ae4934fd0b1788232f2db9f2fc4c88e4d2365e60cbd54007373741d8d6d1d3e4a6897c2e9b5c90313c342dbd607a123750e1a88403b10aa41a2497930490d7cc3d73647f047fbdf7c60c73f8474a10cb699a97e711c3358accc50fcfcfea6d0969b54ebd267ed277493bf5aff39055038c32e429d93c9636e6ca43a3cc7745d812409c532960e598a6ac4afeda2c42d355fddc16aaa8066918aae81ba8fe88e911426dc5d235d28976d5f2da850a56b007dd528a076474a78ab1c46090f28ec6c56e36ebc03bef0affc3429f2de3d2ea66b992a1811a20c80792910955d9193cbc55e3f79153977ee9468ca00c129cc959414a3095532888dc26a4f842c31eab6f6bac2bd7b7bc1b019cf87007ac0330ee5f72d018913137ec3c33ed275ed36a5eb2dda8146b09bc49cd113d3f5ce67e158b4e6607047e8e35c1c21cbea9bf7596283e34587ad5be737fac2eaa6425e1b26b2a4ced16a6ee0a30e35c9860275769f8dbcd230a55bfd9f038db5d9e7cd952648445f286313398b2ae1aeb9b6da1b8ee8e4b571c7c668c6c84f36809f2534dcdcdc5104b6a0c25bfdad2ee81aeac561af4da9b3422a5965a81a1744093a690fbc8cbd8ec126c3a57d7c708eb1b583bf2c73d16fa09d103ae33ddd1bc6214e918e5a42bbec64f02d78d61c2b6d55a0daaf12f2dd9876a054f1fa3f1cdb0ec2d552dad7c9c41f9d9c49872b73ed0ee517a9314fd8d8cd0f9d6d5aa8f433ab4693de1e55e0eb5706272571be942f61add2e1c02d8e26f1ef8e1debfd7c4970dbe608cb8e24b0da735f86b7566e0cd3135b92f79292eda492473017a004229df1a64a5635b17c9d9375eb894cb46698994144fd2f8d3e50b34016de1fa1c511024949dcd0e5b7c9b1f02be6ea0bedbfc89ec4d1cb5ccd0b91d580e17faf884f45308c380822a70dcfc3cd571caccfd610231930fafc38ed1e4cf1da173f4902f430be68baf8221105605f0f8e903ae472b536db1a14163d5866232e65cf9693527511adb41456694211d91afffa398d42a816966ff2cb6a7265ffa8a404d6339784b7dac68c2f5d1fc4b74b86d924a7e04dddc3b6cb77becbcb79082abc073d241f97fdf6d10974f74f59a55a142e6e284394153a2500aafb7dd5045ae79136a541811bb33293e80c8065ceaa548c3e3fa02296e144dce2c338448f4788e2f7fe969dbf94612a575577bab2d9dcf1e021eaaa7b2c060934973ff1652edae57dd4bc7d91f09ef3e2ddcc5a9a33b56e150d6763850275e58fef2893d868bfe5372acb332f08008d49fabf4b8e2b89379057411854a96904f334ef51264d894ecdcb04bfa6f2f1dfbb52add6e0048685ca4887088d162633a26342dc26479a443da51418cf9b3f4b20c577ef73787a386c9adfff7e8f3b67a452f51ee9a3754aaceb71c638188815414cadbfe91d530f954609668e7466a18fa1d0cfa93ecb7bddce96286d6f50d039092156fdcc78f2c8896c1764a57656a650977d557ec60f8323a3e241bab586011a822914a594e51d3c40fd31e0739a75a3dfbc4b0982cd0d6c179bfd9a923aba13b5d01c04c55eb6e1b812320d3378d04284150150c37e8f5d751c194289156a35c5c94e562024db079fb342dc56405e04d1dcc3647194429f3d1562023a5bb3ab1641a584f1b83343eddba33d422f05ca5e8098392494fce77ced74f270647612fbfb7a2c960750b9e8dca12a98bfc1b2ce609b2db32cf7010725f035c88b108ff27bee1fc6177398e6c91beb039bec77df008c15a733a91182c48f5a27a52e68c9e493894134ce8cbb166406d5baaefd42a3a70ce3c500f54432eaeb8d76520732eb64375002142b73c7197497d0ba25455e4e9686d4c7534ad59b8f2322f24060efb2b97b836229cf928d3e25ac7167c9863c52591dbca3f996f7f6856eb86677e00f6271e5ac4bb495e6597fc95befcbf26b1d695ecd1d98c11d69f1fe0982dd31df67fa1df9427af6910736bd1e0cbcc1ad5751071577c8ba0b1120ef1bb2e1f8f30f5ee9900b52153f852a7a08f9d8f1aa10aeee1427b974464822d8820e0bfb7392bf756bc684e4d5f5a978c141fc6a259e105dc6e505a2f27e74eaf5d158708f2eab9883e9bc7f51f8a2ba6ef5700f9f54ada3052ff7878d86c52d27a18f5f16463e970ae8302711a343be7df6c845eb7536fde4250c54d4b83c6cd7e428b104cbf3edd483c7ae024011dd049821c94e8adb4a2afe0964283c1e9a459f7d9b2573810e325b132903a478d7135e5f7ccdcee3a10993d52a0564d56988e23d86b0d1f91f5d6938806fdb766d0335f4cb5e45154091ae496a033465249fa89efec71bdcb652f987bd441d03a3ae10308273331ff701162bb902000000000000000000000000cb75f9e7897e79fa104ad4a361e6f29074a5efbc5a0bb6e27602bbd5afb0b00443a02f695485804c728058e7324effc01bdf778a0db19f31ff129e8a7d6bd46789d8b6aacb50a8fe2699037591d7b10f73c5e0e9b3a3d4a87c0b52c33aeb3c3d000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002fb03161b2d4c7739cee05dac09381134fe0419d86a6b6f274dde5acc053835cb216a446ef28234765e36312c2e43f556b4ff4d674a9a418e937bfa81fb45e113b11436f4a5d666155f600e3296b4482ce9c7c35fd5b4c1af5c4e0b9a3045887f91b309c9e50b8f6273733495966de0b96499a78c51fa280c31d4f08ff04a92dd7794dba657ff62f35915ebc013fbf137421334083746ec7b832ca0d906c6bad1f6ad9e3ba83c4c56e2c1763317280f77c2032ad14a6f5f6a3158d5de6e915fd4b1e868df3d6e7ab6bd5de3c1adf7a496f59651d678aec3534fe561a7b96c27a6c848726f8436c0275d7b17c014fc560e28916d285d520aaa2004151a196217de91d88aeb607b7e556b95aba8c77e2679f5980605fb65ff3dae40a5309214c9572cfec47159ae56739c22ff72e5cf4d6ef8394852755065915d48e5a176585fa74b87805bc603924650293e239c43918459d8382af13a1c663a9f3d68a5841a91320c8969f14582eb3f4c3a798c351eef7a5e2f01c021bf153414b5581ff98a629d722e26cbfc45187ef452b8000b80a90d435ba7df65bca7794316e33b05628fe84ea275621f14a1cf42d4ca1f2f5e5a679eee4a557688b31168383fa5682cb0af1cd20fe778206975f3b571c54cf3315a652c52edc1871484be24f83bccf46a211ca452f6e6ed51cad2e173734688d8ee31f188af88a698ca6adc551223703e153f6a554d377ba7f0c4ae7dd5a7869568ce3059264ab04d303dac5d2b6bedbd9e0887d7a59979f4f74a21354745e9f5e6c2d68c8bf4eff2325472e7f4bb2bc233dc1bd95d3d356c2916331ced3710cd7322a54ccbc0ab47dd6313e30927acc18a39d5a5efec11bffc744c759c22a1200d9e027351dba88b0af8df5d12e82c29b29e99cf2e68b0c90d8882f2204d96727ac3dc535d3c108eb846d7c55c103fa397f8cb6910fb1f02f54e3d29045cc6075b230968821528480bb964478033987413a36d3f7261b3219d3155a789100ad420277437dddce24ca709863ae898245f8cf6b06d6657dbe3a9b40402f2407ad2d040deadb3874c59f96467cb5fb02bcc675478b9901987d158cfcea74636412b6ff92911a27a13f13a52e997f518d0fbd39225c524ed059a0f6035ebb95d16f9c2014e2c6eafb99049410aedc7352a1f352b6ac76a5b2d44e97250d5d17f9c25eb4cfa2596d28a7e53c17a5749ef517bf2dd9797cc5c968bbceb542e712a1f016657312ff9d1c12d2a227c0b8e428eab31f3fca4795d6f21969674463d0a4f6189615a1d1b1f99247251228d4bd4825b843d3ab94d14970f4b6f459e08a6a0f5f09dc741b5ee94f115cf45abdef7f6455dea086613c94e373cce5820030d4b4a04de49753015846297b731177e2a582cf1efd4e7623ffe789cbaa4eb69f8e8d3400e1969e4f36415c077c606cde0035e0833eeec3053b0d1c38418f097f02574b5e8b4d29656578b6ee95710374c6b798b1d602a3090c1bc8918e202c036a52f8a09a11cdc59d910bb82f4f3b50ce87aa9b51b5a6a0959e1d7fff66397948194259c8c1af71b20cdec7b1f7096c267335e68ea5cd5d58779be24cf81db5a5f4a12fb1ab7959d41b597657f45a8356b668a5a1d6cd5b53daa9541cb12696693a53b18ce21bb8781d344d30be46353b273f4ee87c3376b49d97387cda7afcefbc2db6193ea9b682019426f9e77e453e5100cf7fa567449b5dc538be43c77d026d3a7560fc94b86fe4c994a3f53b8f4ba75d0cf29318b49a1f2451ab3fb16462ba1dd675b66d9bf99f76d787cc4e4bbfbd805be9f8997b275c288ddd5d6b22613a835875a6e08efc2413acf7ebd1026238f2a3754ed669d79f6238a601efa2cb8ab0159566aea294946c5e4ba86d5acbc6772eb8ab1eb137f45357b9ec96f3e202f9f0fb7a224cab437b9ca48274bc6a18c81edbe00ef71a141c94db23b0c3725a80958a49e5845129c5cc316122eca87cc4d938f151b5b7c04205987ab6023b872f4c8fd09abd1d000512c2aacc5e301820b1a8b7566fa01c1dfd709deb64b1a487f3496afc02157e30c24e3acf468cfd3cff413cf1c00deb8564e6e55145f16725a09a154c46e8c0251912df09171a69951a7bc6bb1cd6af0f9f79f1e37bd5313e1f65ddd844807c8831611a4c696844a593a59101a4a7c43450c881816d74142f912d3b6b77ba8997264c86209b0f00a6d8c5a1618436269f81cf79ef8b06154abe524db0e6e5f1b42403f4d82ce0f2d9b56ebaaecd6bb8e893492de3c744ffde0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "63", 2, -891841993, 4122551051, "c399a68821cac0edd5216db5c7f111e597adea97a92f4583d7e56c2eee7d1f40"],
+	["fb506f2d03dc96d4eea1e2a43c9735a15653b25614048452dd54dfb05f7fdd6068a8a9f94a0000000008ac6a655151536aacaa52a579ea89eae371ec3892235e5f2f37d7072cac9246f26e0a651edb653b47a933b08e00000000055351536352ffffffff0bce6c63b3e290153148258e8073e2823e106215acd7759a59f3bb39efd24246030000000665656a525165ffffffff02305e46050000000004636a65531963d20000000000035251630000000000", "6500", 1, -1861687912, 1991772603, "ed9174eb2c47c338762fc2d4b32c8af72e92e7bdf1734c7fbfb5c564e89ffb26"],
+	["030000807082c40304c78f49b55ba7bb775573d61e3e5fd2ba09554f4d9d711db3fad0887a6d48310e01000000066553520000acffffffff7f692f177d76a5c53edbf4f80fd08cd3ce9a10a4a7a8b16a501200d49204ecab03000000026a51ffffffff796dae917625688957edb383aa21a0d91c8d53cfdc853bdb3fa57c45d8a02fd90200000003516553ffffffff6c03107812e9537cd4b6358868895386803dd5cf7b10204003b387d4a4c8059d0000000004ac52656a5a1cf9f403e10b75010000000001ac640cc6020000000008636a5265ac6300ac5fac3502000000000853526a6553ac0051000000000000000000", "ac6a", 3, 701756537, 1953719636, "3378b749685bed5b360aca87a16a8fab3a303579651d269c8c68b4abfc278c32"],
+	["7866b43e021959eb227363fb119008303dd17d4484d6fcaa9b6253b426a2599520c4b2edaa03000000009867da419dc327ef45a6b4b4654b06a4fb782e95b454848fec276f3a4a4bb21cd7f9fea802000000046551ac534824cd180489aaf3050000000002ac525fbae8020000000000da8186050000000003ac6aac595d060100000000086500ac63ac6a00000000000000", "", 0, 1200360327, 733220448, "9ecf4f6ce3be267a6d6cd331de96fffda84437202a068a7fe35f7fddc818279f"],
+	["030000807082c403046264629dc49e5b03e657d85b2a0b083fe36eedbee360aeb2a0dc97abaf276f3a020000000952ac005363656a63635f0a0d6fa2dafb305bba9f37735f4add9376859bb13652e0d5444e2020f7157cec68ccfa0300000009ac6a63655253515100ffffffffaaa74240f5a01b85698437d8c5f6ef3e1d4be94a6d721ffed07fb7ac30fbaaa60200000006ac51ac005252fffffffff3b1ad9394bc466031ea6fe653428b07bb095525860e228223ad19440346918b0200000000ffffffff049330db02000000000200000dfeba000000000009535252516a51526552a6229505000000000163d8827c030000000003536a63000000006c0d1a0900", "51acacacac", 2, 1493973170, 1991772603, "c4a5546ca31630cae439e8cd78ae295ab196ebeb870eadf9ba177eb5219f87d0"],
+	["030000807082c403048015e58add2f010fc7e9edc717f3fa46bd2077cc638397f92d30768260b4e5be0300000009ac6500acac00535151f4c1ac5425fee7f3b438d1491ed67611b03407d6942663900e183d11eacbdd9b720635700100000001ac54af4580ddae020d85d6e832c5f2f3e8ab46af78887300fda8d6033f85348a95d03eac1e00000000004ed686e46b27d0dd2bda08554d208fe1faf2ee3babffd04c1b5c41f0ebe99093795a1bad01000000056365525151f43502b002a0a7040500000000035165510df2c702000000000751650000536351000000009ed13a0100", "635153ac63", 2, 870507751, 1537743641, "3069bd0959910234646404397c74ea063744d077c224ba424bc4295f630a4854"],
+	["30545318044b28e0c27e6a4281e99b35493dd1e3086a85271585d3ec1e9b93b8d2419338b80100000003636a52fa2e6ae8066c0efef1e3e2ca8dd08bc01e02b9e82571855654bd6ea53de60083e493dcdb01000000055252656300ffffffff1f27950252cb476fb72dd497b8a11db7cab625cdc18277d2e6175d9e278d0815020000000463526300ea3c93ef8e56857dbfe3e15e31eef87f536070cca14c6c515d3e33fbfca3e2357347d2150200000006630063525365d2b62a10025e28be0400000000046a6a63538da5d10500000000020053c61c98f000", "0051", 1, 1243027801, 4179206552, "531dcfda3c66bdb9b6020def3cd3a0eec4676a45c56d9152bfaba72352393116"],
+	["0400008085202f890372c20fb2ccb2628a7dce0f09926e04e7776cf99b046b87353f2b9548d2b9baea00000000036a53638820a51c907d7f65f2d4df8c6d1761dcaa4e7e38e00c796da99ce9cce825f2d3f37d0b71030000000200ace1be8ac1efc485d0e439f058f3045be60e65628838d39bff2088f06a9047774fae802df20200000007536363ac53ac6abc9b7bc6041521470000000000086a536a006365ac51db3d81040000000009ac51636553005253acc4aa1c0200000000090000526a006553005155f97303000000000653005363ac001116da1326772b187aa5f401000000000418b783d58a39b2bc51ba5153567dd300e2c6a27c194361754504ce52b64c7f3228065b2ea15def78fcae458ecad20cd25625813ed8c6fc5c6ad5d5893aa78f0992861e8cd7b44ff75e5dfe86e0cdf162eb48cdcf05a6e858bf4b98e1d5b214d3be95bccc0dfa4463764bf61399d1324958ec92f297220b5b368cb44abae2c9229fee88303961e6f8fa5dbeb1a5456fec431c5c2ee36a651260496f551423c75763452a96d94a1ff57e8bfa09cc46339c1adbb76111e2de304e331ed030782954eab98f8842569e5c82044385a7525a03ae7bfa2199c7c70228c988cb835c6ed699d7c3483a84fa2ec02e670f8816b086fce615112d9c41298d0b307f6b830ace11514bf723f9007c223ad2fed6d7169091ce3e43a03ae8e95854cb9eba12dc7e1f2c1d9eda816b317612060f66d0166917696ddfd423d77221e77fa92ecb07156ebaaecd6bb8e893492de3c744ffde00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000fb2eb8ba92d5e586c2ee338b647db945d6f636fab93a2a28625907c2c96c1baa9fc7c26d09aa5fcf7a3d6705b971c0088ff3ff1fa8404587b8754b8345c6c567b4f68632c255389069b06bc2d8416011f3e9837775e229923001963aff243e2e5e00b131400caa3817d32ff0894fdc39080c9b5872e083e877f2b61cb1fb37e3ac6add0701a384640f80aee018162b5d7d9963bdc70d894ba1727df614e04e675ec1319b5de551496636d6b5bae7b42842dae856354a99715588baa85af250a8263531f46d8f2c68c77c0009df3fd45bd762f85c1af81f97deaf018a086a2e5f99e38576416decf674d11c5217e5255af11bb37435dd2f469974ff96ea906960f303d6a617a0eacf28e49be5c3318f159e58585ef437c4af6666bc44b87a711853dd602b551ea8877c3689680e3eb072bf9aa9942d8653a51404f7718a6dcd9d6ebaaecd6bb8e893492de3c744ffde000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000005be9995c827224fb1935fee577e8d01a2add89b5b2f088d205d04f5012f90c5616cc96dda0547a8b7f4e87cc06309634d58e670d5cfb508333b763d15d721f3404af1a014c58ed60c2f594794c19b930df871d46183822e86e71becf4e8dcfd3a2f5f7edb02fc6bd756ea0d056ed62609ddfd66f2bb92114fdac6d7d28091ec75aa722f2771c6b2c9fc6957abf57c83d6e17e0e03a72e8b14892651eb0c42aec2029c6ca0c000459a5d8a9323f4f4c2b5f6adf037a481e0c592c28101dee5ed9c1b65ec3e8e533096a1cd99e9a1c982d1d8c5dceed34193acbd8c22d2305a4a394c8aa2f64a360cf59a220ec8c0f58a642409d09cd9926adffadd1912e63904f3dc33a52e70842175c4f54e8a7ae7496485ae8a285ba62a0d5bccdda69af08592a4835486a559adc08514a94bd883fa830f356a1ef5321de8a472459bea220f56ebaaecd6bb8e893492de3c744ffde00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000645ab45ab18693e5cec7c2a23fc0519aef3cba245a184cbef45ddca758fd9f1c3597de1c9ff2f392e65c6f74c631c3557ff0e1a15109b82172ba8486b501624751320928f563f16c51e6143e10f82eaaf20f48b90ce8ee00d66f1a562f30ba47a6ba2f3e87b19d503f1b065b7721d66a55b05af162d615f35b208a08ddc0d496b712e5a974f2b012802b7c35b3201b3e4e6003a07f5ad60fb5da1d20ed2e473af1623e7d9f782c9bf8817e62c5c77f71d45f00f6aea39be520facca283974fff75c260bb71653ee25a42c858ef8f7dc80e49d7908447053fa5bf40b169c61027a6edb9442ea64c9905a9d265ee9dfb03f4ac73a4c450df1566369e88a62af1ce3bf7ac2bb8df9fc9064e15f64893302c841447d82634743de864866fcde765fcdc24cc9f5a61f7558eaeea3fb441e45f75517aa9880af333e857eb4b5526bb946ebaaecd6bb8e893492de3c744ffde000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000404d155f74e795f5c461c815e9f17db802a828ab7c318820cf28623196385005686e78c8888b0fc3f4b19d65cbee8a0de0c618bf20ad4441df4bf412e03e0bc3d0d150e9475cbe92b487d6fc3da97cbbb265de3da6d8ebf11ceba24812eb2682285c79c00e5af7661a8f98acdaf063ebecab3f7f0191ff2c46aff2e03d3becd6e8253810bd903b86c79ce58588c13caee24efb18bc59458a5115451f7e7f294efeb495788db730f94ddae720ca800f5c0cf4b2e4171d0000c3503dbb873eb9dd0855ce1d0717bfc75b89f92eb52fa1b66d5cbb4d2331b14e74eadec4acf3e7edf8c57477546d605dfff073a93a7e6871b3e1594094a46a505d6a5789b3ca07dc99bb237e1c2feee1d42e1516d59fede85c6fa43ed83fbf6ea619dd86a995ffb41c960dcaaaf490397a6cff030dbdfa5c67c7b47bfe9d134b0e2ef4b74f7e63ebafdf95e7e68f293daf2878956d0dccefa8c64e15a235d3b367ac50b7e16f939b150cea78266432ad6f731984eabfb4aeb0a50a062c00ce88bb26f0c1d0f5a954404cbe51f9b59f6f005136f7c88b6de4d1607621d96d77e86d3a4c29ad89132da52c61a35e94b5a950aa5f7fcb5ea858bc0b4654d69327e0ceaee8eecaa0e75b450f1b4642c77a13fc64c29881c43111bc70449628e4661471353caf0af0a65a016fdf15fe26df5cf90ed575e61837a92a1028477c17e8abda71d4811ab5b2deaea05a76b21c4486f0f2a26e23448cab3f69620ef203d39faaaeb62cd9819276cfea1e417b20c6f1c5cf4656e96d852976f14b7782f61445893978b45d9bec2f40a2437c9108d4dd8eea3e9acf99ed6720547769ea0f11736a71237d2c97131ca73fa8d3594edc63e2e0405b07711bba65359efe20f5f9fa375b280d1bb4aea81be0dc41be464692c7d2f8d4a549136610e1a28ba3ee02cdc3fb9ee4d841aa81b10faadfa269a70cb7790ec300f90561d0f2dc495df204323a865e0a984f5a88b89e6b0a0b59353a975e06b7906cdd0705e472a1eae02ec72773c0c5cb41c2f1abad3e112f5f7de9975b0d152b10b4b01e7a2fab21fd4db34bb8eaec5036f2ace3ec474771d627f673c7329a6bdc85539c1a0e3eef729f631dca18fe6ae1c797bc05fb8cfceaafc54003b253654687cc0f48b5bf671616e2db6024dceafed43b540a9e5d294c13c878dc95c020689f5046a2cf2ce4ee95a0e42bcc6b400e194ab99f84f68379a7ce7016c0ae7e01c9fe6ba9030941e2df4a84c96db49bbf5722b1e4ca79aed6d071c3bdc8a65024d20a5f348a6ecc35bf2c2a8c171e7319f9ba5cd5946a0805f94ab1d29350152a777aa2836b9d5f56e553bcecbf0d36f0616819617aed4bb45e21c4805f158611af6965b3895367f4fd8a5b03aa487c1e99ebf1c6ea2a71bb90df8de89490402cd249056cd8b0e5ed925cda4eeab96901ed5f45008525c8a5a67544335939d9746e5c971770ea17682ccfb52c58cabf4d84aa8bdb5b4856c4ef0aae64f2115bbc0f0b65fb7f6a28a4cbc6582b766aabeda96521a5a450978fa9c2cb536ddff2ddc4eb02dbf9baaccff8e7e24aafb91a3db4bc83db0f714be8c463c2cbc726297ae5c152e24984ad5622de85af202ccac953f1becae6ec12a75c6509c40869b4491bda3d12af699006553431664199f232bd3f9b3de83ef24d6136399a45fe11925df91dc11762a0200fdf4238e53275228de893a8df67c52f314fe65ebacbc11f1613d58d7bb866939aca05d68ec6cefd24bd3b0641ea29d034e38329ad12f053712f031ab6b5084e91ff98249801d2d5ff767af84746bc3f8b3f2c81414ce42a209b83bcd4ad718ff5337dc590dfc21172e5883fc993f489394a77b73dfc04ab0d187ef0dd0f12299efb2729d519289496ee57b3e0d128a87d4ea549c8767966f044e648649810efd8983e2c6d12b5d6a4a8c81d43ecb917d666ce87f1f48590c5ed397ce43276f0907f5d235be2b7b3f5d2aded5cd9d69ad346f1267e830dad53bba7c32cd09ae7e7cab855d9729aa3877b4a68662bac61abe5b9aa90fc088478d81e8b801dee334f89875f100e43ea9d50e1e5c6e3431f0fd254cf95ece8b625d75d20d8a039705f1bed4381d519d0ab6e494aa797f637a042acb6cf1d4d35bfd7f724cb517127364df85e35fcc386f667876a166ef52442cace4a13e64bb41d820a7e6be2f901dee79230fbb581d34ba093d4bd2dd136cf17c42a9d689c4582adef982e1047bf91cb9ede95f8268e805fa63458bfa5999948ac2f365ad9eb009dfbe22947edd211ec97677755f2561fcceacaffa89580d3f3106a9030e9ca67454ad20b8db59136ba63360e1e9936b95182ef6f424e1068e5419e9a87254eddbce2bdd5f98e3b8db3b56f656e4a797538eace6231b0853d29b7e5459066a91f6f3ff3b93b7ff7068ed2c21a8f12b3702f732ddafde90d3f51152696b444921a74620e20bce436ccd9bf31b75c633ba5edd50bca9d15d2f63aff13ff4e03ee4dc6296ee0abadd816b824daf92b7a53940cc2b173abf4cae62844ca3651f86aa577c7b96d9bfc6b1ca1d5eb57f4eae2ee4f2abc409984c2f20b6a893526b63bdabfc286f6edc8b5dd159f4aa4aacaa4458ea29d523526a3e43ff6995e0d93eafc8551c2304354e1f40135095ad91dd156a700328272e336a160501275505e84e44f916c9b034b6c60350c12e7e2f0399bfb8a176f452f3b6d857bba60544c515ca75967db4f4508e763302492f36a1ba389a097d669b602b3f3372856405a6a71ec4f8609c4b158f24b0379f4b9bb63cb64b61278c30519436a1b2e45327869f7529aa7fd469c930261dd0ba1f1f4b7bac178d8399974982e3729089eac4ba59ce3770b5b1c4ddff3a9c673f74a40862e4738e854ab5d78e44b7dc04e052986f803a8997de62b90cd40977e4baf4567176c7d5ceef68186c0848a0bae7eedfa3283dfe5b481b1a7b806cf58abc053dbc22bc675c967395d31c74e4dacacc883ad63cb7793511fcc1656dd36092040b3ea40c63c5a9e8d8109d94e16a12b38f694e0b0a1f104d44513bad6acd2ca0c9305045057b846249faebe7bc1d214088afde9345d4c465c3d241d525ca4d80839a56b65b487913f3822caf908ff636b406b18f7d7feb7ae4c6a38d09a07ffd8cb56145c808da9fcc7317dfac54e2b5187ffba43f065c0dd88bc8e2e46330b50d845fbe7b2d598fe90c945ccbedf36ce26b81266eb6df64e1b1c480f370b514036581905c06e662b357dd580d1b5b5916267b80cf40d918cda1761630c3e7a43fda8d6824171eba407d799e8ff79d5b8040ea7cc6066df7b1b969281628b8c1ed67607cc75c6cb6af5da2ae9e448c683d40b17a9f32a2f5f3d1151cff1aa89494ca0fe0b487ee521dd142f337fad81c44790f26c85e7fd7177af0857cba30a3c26e0df374d11005b800486f366514daae30d99c6621558e8cfa0cf548bbd2510ee80637420de1e4793923cb933c537875cc67c68d7ca9a6f28c470d018e8eab0dd81cabe9263dd2acea0e92b73263ec3688b31ee9ce3c3dda669bd32bb233a1202d39acc17c9a1a5f4a6cbe9cc25f357eb1a4e2376b12c582e2f0a2f88089f8d63b21cb50587e6f59447092593cf5b785b21f2aa86716868ffb96a0ca663ca1c3f263da69b3e4f30896af276dc2a4f83ca8f0e486b9e36451fd7c193873aab5d0a74fdb695a3df8d34333a4e9db1485056b5369ebcfa9a2ba0be09fa99614c49d6f7627d0dbc88c82dd6fc51a554977a3b45a1dc47335c7dd2d18c17bbfba4d0720ac07ca753c05d14edd52d79985436ebcfa16a1e690dad79e234b99ac61750c1bb2d6a5b866cf9a2be1a687f0ef319c6e79c8589147a5e86841682f1c3e6c07c587500a99e527071596a1fc70222fdd417f333df2c93f5a9c5c4d4d7bf7b9da4731d64bf8e8d28fed1846d3a801736b380c8bdc44429dd0ac90f8d6b45902b4920e58c900bf7c701932fc05c10244e996049c937cf75317043f5a0fac02fd4c0d382a664c3b580583a6e8770b7042b9a1bb2334514b7ee1da901a4fba2fc1dbb0c597b32a58dd5d10f51dcb30aa54c464688fb743215cacfe08fef87f474750ec8644f942dae24fea425ced56696ef35f659ff3bc1e4ccbee353e48a789dc7d3ddd1b22ccc2d5d7ed3965567b8d3814a525d78ecaf8b0ff859393afde89c70623d6e68910eaeb7b8e41dcc36eb9b1f5365e47d4dfaa7c0cb6da8d823978cd2e1ee045ab5c75d3cc109c7e79f01c0b1515f39382d1264b4770e6e8a03a740caa8fbb692b38c5ac19fe94aa5eaded031e695e474b8a0bd2b4b662a3fe1f46b196f39ff358e211419742cff0ff7e3a53392b90f90dd8732b2ad8c9b33728f31c5ba92e039b4ef5ebb1d094c2d9c8c4859c2df71df430ad314bd42e393aac5b52262cabae6ee69d1c3425117e81892d9b8f64d1ce291f0e6ad7b95f89a4a136319dd4e81175d1a7d1934f8cbcb44e43b810dbf5412734c10d184d629e8dd9d58c789b386d847d7f19cfc627613586ebbc7ace22e231ea12a916b1d6d03f4a8d0b59ad0967618a575fbd8913211c67a3f160763aca6887d366acb05020a3fd6aacdd578be55d678515cd823b83334e7bd4906c85823a84d32e95eab0d1f56bd370c4d83bf55982259b6b4634246eec3c415a005351e0d272d25ac21131776f06061565288624d9329a5b34798e005c6b72b27b12cbc0320aa05f5f05365a9000e8bc051f9c588adbc5bea01812c1d0d7b0328fd82bab5a8a992d319f82fc0a3c6c65c4a81bdc49f41d86d48c38ad92b181f22fc669859762ac429837fbcf28010342083a96ca91908a3c061807493074a5c0df18698096f9fda3fb5f59384dfca8b97f6604bb3f93723db7e70a2bf8689c6d9c02653b06c93d6673887673777be4025506e07ab1d55185e2ae0009535b248dbbfe00c480ba8f9edf4b031c6cab18819ac2238a40de0264d42b8bf00eb94c48e30de01c999712c3c2de222bfb60ee9447530e98edf33c2452805862910f00853a244d9d52f1876f930afb058b434bac611ed4ffd2100f1bcbeb01c1e894ff8531426a6d6eea12a179c6c30ea25627ff62bdafc4a528f2c3dda7cbeb202aabe9992422193d20a1afb65d0ff90df59b596628936ed674fd0f8a84a5b5e87f86342ce22d4948e63b0e5a888fc925b46d2115f8eec7ba445c922e288a18fcc40c4c7fe0ee6c579fc6753434f8a85fe11549167ea5aec703b0ceaf28bd7b5142e5c89d33b8c2144be4e5a9ee277cbd54e722af1ffb131e1c05b2fba6c85485217bc5d3f86546c315aaef8ab0477d71f3187e9886584b827017ddc21fc78c052591cdbf36bf018eb25900000000000000000000000000252cce7e750a8faa4f136157e9e10f39398070558db4cef0e6b38a62a582f1e9e32b8fe63cdb14756991ef1e29d3054eec42e16d01e960d0d11f9d3a98d19784054e2a1fdfeb1e173bc4a855282fc09d69474f1396cdbad28f63099eaed87f7f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000f3b061680287a406f55351293e717b3623195f9f73147e1cae77f2a6e025e16b2602fc3c924c0809fb18fb327b1f59a02a7e13f3abcae44e26d516f4b532a37021a65395bb093dd2de60733d3c7f89277c7c8bad7275aec29a41544603aacb9a60fc553e7a2f9fbcee0533c0d1010373b59b25f2e32667d401e1143b9d627354b449b06ea0fbd631e6dd156eba01a32d901b4de919983ff21156915ccd025a5e36223e08e778d63a73b6cd71c60897fd8baa82a351402b5103463ed3e83da2dbf7aed13d01bab8704e9628964dd7422cf5c30e5a633372f84d42d12e40aa3346b89984d765b54b4b0f3f09293da0abff2ecc470c651aec1768632e8ff52b62fed3a7d132c87ea2a91dc0baffe231adf5398d07730950fbd8c042f09e9feb956797b726c33be4011f78216ad26f0b568cebe66a6f096c6759001ce7fc6246ce7ea534b084ecbb7afba6ba0055cc64c157d1680eff2ecfeaa4f82f1b3dcc8b56c0cda2ee7e682dfc42436434293f97e7092e766c6d10fd3ce7534dbc69bf64052f01fcf98f71d33a6caa38576abb7ab93c09c4362b427473ebb799676376c8bf4495e61e2a4e645b2ddabc2230e7fc463f4294b615eed17cf81700fd8065256461d1214c7dd456666a0eff77477a0833c6b77648c085ccb2aad0cfb9109b8abf5b1f17493080665953c0ae98a10c1113c427be7b2345f980386a071e8518782a6a248d61a9c5dbb7354913daa3269e8b6d290cfa5629f1999db910980a534270e22b09452ac13d9436204664264f0a1e656e8111cd4a12683424df5ffee8b7e66eab49d38e9ffe8a928d71c64731a1d14733c8c4b52770686df83c93ce334e12f43503f36facbbaef77ef73576ab397321a02947b1a88ef900ee5d7caf03e414d8d1a94a544670e4f557139f9bc6135abb0b24290880260ab5024b0d85714f8270107f659e241e9dc0f68b935a6e4ccc4725adfe8e8d4f000fc0a7ce61159549baa427fb55df2a022ae7673357410198644174848dcf723e7072eb76e8491ef99399a0305eaa23deec3039132bf91720906dc5c34db5b7817e33d82d9df1f4dfdeca809a44b5f4cbe79722ef6143b65d3a70c6ca4b84a645b01fdb6309eaf36255bbc2c6bcc4e5e8ac88cf5ab8a77f6c0d6563fa3614fa2758733eec255ba2df35bfa4cbc9dde43af3747827acb44f480f28f8068bd91c8754b4773a68df9baa3f00bc2b22d4d422572b97b9444491b7cd52fba655861644b02820e8f19a5d3e22aac4849617e31eec994e814e715563e430a712f2e15fd1bb9f798a8b88e2e3fe56e68b3f24730eb0a62d0410021761ee5d38eee1f6e9f924e9793b178084a05b7268fa68807a6f22b3952006196491ef5e226b808bed623f04a4f861d0b08352d340356823c7b35ad42e771ddd59ef7fb614c9a42be5271202a02b82b94084acfcf5a597dcc7027d8a3476395fa17c9ba00f8eb7cc507fe41e111ada0836cd7d060ebc06681dab5541a3aa73b3d00e3dcfa0327dc3058429be3e8c1f77b0215879334998f97785c04f254cd05024afe6b0f3c03193a4ccb38ab158ec882625b0061f9260afab1af0db99ff889985e2b806645a29c15c221c8602b6d54dcc0c11d1d80ad6efa85c8e714d5870db67bacc5bf21e4fff691f4db027f7aebc48605d515897097a9cb4708df6b29a76aa9ceb2d85fd594b24cf3067e62c905fdb10748113d89ac435dff92a4dc8b3d0fc933015bd265e2ec15042fe418f36e956d447977e4f1846ecf45b4cce3a567a36f0a6fd8cc6813342a9bc8d30684191751485db05e72c0c820b37eb5b4077218b9870386c033bd76e860cd93c19cefe9cceae150249cb61990888b19870e6604211361cc493f0dd9bb5db1c68f3b0b7694454a4bf61cbdf0969bf0ca983364cdb87221df9bd5fe5c4a52cf9a84a1e30aafa34b56e4fb776cb369c86bdc45532045d2b0b484be514cc20aca2cb7788f99cc5af1633f1a69628e9f8db178df5ccdcdcbf9dc9621fc48b1450d991ff28d8005dd2a9d13e28d1d2052349b26b3e25a3bb398fdd71751ed70520b642e8264699d3dda9d2493f271ed07e9cdfc61f4723eb363531c41ad73e9e334fba8744e5e8f92451a7f71d5fb299d482b037ab785d3681db3e3fdaad7c0f7f37c9a0115d460c75fa2d9c39b9a50bead6f7b7c5a128a3c345df7167e74af576314c7b4c70c57f3dfff7bdf5e147fb2640443712744bc2a7e04d52105038c15aa829079f97b49db97997f22fa4c1cd235deaa74a320fdd787a0700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "0053635253", 2, -1059409739, 4179206552, "1c5955b62b16301e3e2dae687f199ea2098b64a3535ee1adf2e492b7a876b483"],
+	["0400008085202f89037413942bdb26d798abb1d0f92bef7937c8d9ec15f29b3aabf11d02ddb2c038b7010000000763656a00ac6a00ffffffff692bde216c6962e569f1a03bb738ca1e09b37b2eacf60bd0aee5fe75afbd1479020000000952526351526a63ac63495fbf2ad6b23eedbfb7d2b08f8b5216f711e30f1efaa4c6193f3304f1d59482c50c5f650300000006655352656a53cda5a3fb0466b55d0000000000056a636565515051e20500000000086a65536351ac5365ac668f0300000000036a526a2a9e2d00000000000753520063ac526a92af7a9f13fe191a50abe9040000000001c10ca901931c02d944fa3097751f290d81226fea6e911284596238d2f886dcbf8c99cd1e799b4e93ac3b795e7abcfe922736b4eb39b5533da2f2777207266007ff2fe9cad52d96164e874de890059c6337ac74bfdb70bb8c8505919d7df2b746b6948eb169af5cf9dfd276f18a2fe285789c12e3bb2bc10076ff9a40bf9a47719be17281ff81d6355fe2b5fcee76032cfd02a2fd54c6e5254f01252bfa9eb9bff7b080a2f11bdfe598b109a614ce7760ef7a89228c4b69e6de35c181e7e7012bd68250b6fedb00c325cbff28351f08f346ed934aee98eaf5100a3f547f10a1c1a997e275f8da7715f1c631bccd1374baca7d6e23c6936e50fadb77ca0ccd36ae0fe31b4a6e6809307583472df8379d856774cf5d9399f9894188a05f7080c2c917fd59209a04e03bb80b8aaebc448581856804ddcc2b028e5d07c61580668abff22fa4c1cd235deaa74a320fdd787a070000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000331e87f13b2ea651d9554def3e0fb2d68c60aef4eccfeca27cf582f28509a7a46e155454daf88ddc2e22e976b9daccf5a8f61a603e95d7de39b6cf1eccb3ecb4f3ca0109ca1604cc7a022deb39a139bcf9fd072609b0afc4f2423d16328b5c8711b447a1c2c89b90445949bab6b6b3ca3535f4a694d983a85686690da34660f92da6d36239e3f49c515b46ade68079e2506c718284f9ceffd5df02abc167cfd9c719ffdca1c9f9d7644fe19f2c041e631afd9436c63f6df47cc412a777a8a16d8a0711da6720c7fb40c622323bd32a5edc9bc31b8799456d065140c63406f5a6c009463c9ee293ee8b8c0688a28506870c156bd83b9a8f96cb34097d2c57cc6ce94f35dacb6fe23b1587f38ee65b159b40f68dae892c4492b09b883a747daa4d638ff659e1dbdcbc62b09db4e2d13c5b878d967d2e2dab8ee153463e94ec16143d1bf7f9e601189cf57a67129d8e9638d820ff7903079d3f6db9686b670847965f5804f6297d03718a1899858670c061833f876888aab1e8a8a4b9142b5ffedf4ff136a7a7da0f41776803093464fc88425e33757cb33770461815db4318b968c1d9fba9ebc6fc76f020d1b81c03099d1603ef4f0983467ca791bbce0e86db470329836bcf352d60fa7ba56f8a0c791a6db685e7e2a00aa3d923b870cedf9316f278c29461537075e216129a070b18f25cb58bcabf449c65fc3748ce1d416a0fe690ce55935012dd3c96520d1cb38b8535fa7032052254e578875569245e389e1f1f627161bac974c811c9e5e385c5eaa6b46426453bed2889e4587a825b4a59109f2b8e5a275c96fb4942dbe2b435df564afdb906e15354a05541bffe51b874036711a9797b04ae4ddebf6a000aade773df3a0d6eec3e5d4e27677b57d2f7a32e59f92a4181ce0bf41c17b4f75d20ab82347decfa41facfaaf10c9f40ff20fc10a185423749645992b405691164af8ae17ae4a3c49955eaab7dd24a5ac2d832b33bbaaad86930bcf79f2b59ce804077563dc3911602596bf68567532ff9a51b9694be885142f9b348fc8a34d3473ac82c288bc60c708591235c1873a0b80a9aed6a31148ab1414ac21a722c022377dceefb8d33b7a3419882b72ee1648ea47b964ddf3a074de36c68810f4f7eb143061229d9de410dedb553580218aefce4a4ab50d93d5a0a2c50a49a63e013ab57490cf069e7272b8161fee0b6f43f6a8d676772240f36c41488c605ee366d18c0d3d9c17779cc1e81e133ae37a906523ca8ba2e2cb10d4d7598f0665ba53b73ca7091259b7c4b3cd262e560cb94616c69c1e8520639790fafc8a3a8e3469832d7e01e0d873396304222f8508490fce336b4035bc73accbc8c6515700751568a35393d6160568978623cff80aac51f686d42484ea6c1db9d9cdaa7f67d20e8c8e90d3a70a3545ba3c7ee2765111bad8438781e4a461f1f4b392d48e6fbe40915784116f0b160ace96ffb37e31119e5b6bd1ffe5474b1484aba8d316b94d2d3a00908be9233c132634ccebb2840ba3fbea5a1c1fb8ecf085a02df3de2f09a4416193d6854dd0789987d26737f68dc792f0a840f34ea8f57fff998483b10a254235ca4f81d982ffd0646eda079d1d852ad1ca91b4d2f977664e14f16585f93c083fbbeff7bc97a5c0c3def14c0b7147497de05551e6d17282879f6fb2aef506da4d97aa5438d8f582a2ff89446638475fe9a3cf54e2874b34e6ce75ee073870e15483d259e2c8fafcf69c307bc26714d9c9b65273f23059201fc2fa25ee3b5e50f86a3b98a06e1ca278cf2c93c2fb9669263d2927c92085c5fc2f71318c536eb3abac148fbcfc90686cd1ad6de4ede5fda113a6312d963dec90587f186f8b43110893608c2cff69b4be8f23b570d799e459a5cc62b013aed7de3a8f6a4d1245c064a58bb45934ad6978915920b70f1ecadc837dd0ea68fd2b60e8ca3d90a45224cb1cc26125647663c279f92de49932862113bb384ab6f6b6af00264c23d4794a24aafb09c4f6544df528e5c2e5bc08397834b4c3dfcbd0cad58f6f9d36845b01cd62b489b6d7c41c5cae5500eba8fefbddb66cd17f55527c1c8a4672dd365e78cdad7c58d782a94b9f3a7c728ef68ddb532f0f9e5341aeaf9884e056a119108e6fbc2f9be9bd866433e6df38e7184419c21caab67ac7c002ef8c76b8f95f4f9c2271e2670426f23f442245a0acee988cc59523e27f79e373350965476e702ad82525594080928193b6e4fae6680b46e55df09e45e897548a2a36651aa927afb6bdf72ebdd94b3d91b376c46dfd9c93e53cbf218d98d2b7ce0e5dc81dfc52d47be0c6ca9533ba2525f6697a5a5a4086ce63e4eaf57e7015d3e8f8cc8acb0f715656a4fc997a13e193b8a136ad8d9a5e2e682af8211462afc855576d0f1ee0f763de6ea91d1d6693a41a8d54fb68acfb221b06df1fbb784c16cc2bafc453a7b2e25692d44a5bb3c22fc92c1b76c579e789966d16eff0758ddefdaacd34edecde1fdbf3ef600d2618d49cfa9fde35631790f929a2f7ddb0046f7b3660be2b551a0ea84d88863a2ac4d8a3f694014d3d41ad59c7ee7cfe29b6007033aeddb310aa8bb3aba3839da1c36922dea9d25885c543b27222e08369c50d36ebcebece80315c47c9b0f916d3515d83e42d0caf2cce8fc46a909b0698cbcf55eea7a130d5750dcfa06d66947e65153033916f582f356ef419e1e30854829158bc3a7086a61c0375f15c304931639f08344cb9ff267fbb1db27e1af7a12e8a176f6380d5f7110f41b401f4c459364a726253e0740900baea141e2a9901c9071ca5b85d039bd80e4cd8a78fa6567e3942a0717adc3eef220f2340804999ac89e51a17d3540f6569f50c64079fd389b112314426134a039146b102e1c0d9a98f355ba3c94ad50968e396a99c61b80ea719ed255bc072884be5258c3139fa0028040e9d2c1a39512e97befbb0e1d1a334965f5c1ea28a379abe2b5a0abce9ffbb419ec8066a5aedf3b578a1c26896c4cf742c7a6c3314ecff9882a2a88df1d32de005b9aebeae85a6e990c4d99b1d13d246b5b444b8d44112665605b6e880d00e4bfd039b366753f945cfcdaf9aea6baa1219e9f47abc8ca5620f2b14d0e242bb4f3204f6627e1bd5305c4a1436c150dc705c40df005d6fad8667352e43ddc7bad0931e9b12c4123a5624ee4b4da29504110a4013c4fc973394b7bd87ca1ba0aa9f3f84b6a30d6bec0a140e1116f25ac55528eb9c53a5ca33c6972f2905e443114a035f9caed1dbb83490f446c03d11fd26ed4d94bcde4e391aad42b689c2721063ed0efb2d1b4042c975fd8e85e5209e7d84de9d5b2755a4c424af401c54cfc6f68bef0205dbfa1039c3c9702a65688694e9acb123c9f8e13211d256255f08df873e15d4a09e5188a7c6828b3a3a9feedf39d40adf61ba41984d3b9b8494a5f779467a602d6eef391481d052094bc5b0b5a2a87ebe0a9537cfa922e998ae4ced3f6fcea715ab4a33248a913607e3034c32d98b470cfe3ab1c4f0d909674689f74c8dfd9c9c165d6d94cd6353ff49ed5c1a6388184c12b117212bede2b3fa768bff22a116222c8930b79c501ab888466d001fc2502da2b6f6862787b943a00eb1a2fada5c51ff41eb34aaf2841c49a4eda473350842fc48719c511b952f6ce960c86cae51a5d657b1c6117dee5f81e19289779bc0ee71cc59dc061921cb7c7fde247de3b9eb58710dae0bd48875f06c6366b876427c9847d49e91036df748e666c2c82ceab844cd5959e780cdf0880e98d925cb812e45d666417627a557de6cfa127459299220eb1f49443dae43d120b946dbc7a6da1b78a22bb43e4a378cf70d94109c88ff7c5a78b8105c3c19f2cea7cf5a95a7b5c1ed56042fe290609fc1b2ef676d335bb142179340c0a72654f6bfd2fcc2eea8ce19167a0594313fbc1adc8da335362c96bf6d49ee39afcd116d873fbb94e4c21b461b9d2707b8889dc6e657be5740d4d5ab093d3e17b024a551990ee5e6950328ee020000000000000000a7899f0300000000dcc4bb29bae0575e25e4bf4c1ef8c7dffe099f39b75d40ac4eea0cace4f89a5ba38d7e13084601e02989f6c6d47d4190146871b6b19349f277980756824c5e8fbfc9034e30a93c456bab8b1f189fc52a3e780f95777136a4ec022e88c1c06ae000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000cbef689245d0fe3a1ec34d900fff7124a086982623c8f821435c38d691c4894b2f5b9b5289147fb09c6be176505793631a91a40b9757c92d7e45d32fab62eb6d86d13db5554fa66f2e446072ead1aadfda57e399631ad4e2b9af0edde9fec51a22fd96e8ec52f3cc8ff8b4d7825072300bbbe034a4d42ab061b186aa7d890913e8ad176aac746cf7e523571e65c36a9993eb45ea9427105e187fbe8f93c8b330100b5d6c8cd8ec4f96c0384e7147c875afe11fc2200a188d856e74a56f7dac6927c876d9bf0bb7e98bd468f4bac04fab01fa6a55078ef2821ac46df06a12171a09595a4c3d6319a70a420614eec07ded3d984e68a8d2dd85d5b08fb314d52dbf1c0be241420943a0f75de955f7fde51cff66c2722a524379cd17afb0da5e16b8d8ad5d40f1f68675b111fb47842529afe9caeb16295dbdc1b15375aeb1828404bd15c6a7ac0aabac3887518b967269c7efc53424ad5b9ae3e296725e9787f8d598dcccad903d01ff923d07293c2d9cea3fd7b40c67d6a092dea419e06ec25122fbab4ab77a34224dc570f62eb179b364d4e4d58d27eabbb2d4867f5b23cfbef4feda5fcc961c936ef69967260e3b3740ed1cda5d4ad193cb33d3579c3930e8d5153465baf2bfd3fac1eee2bd8a7e1309c47fe0db7c1f07405455341fcd817780d2cc3bdea49777b6b9d6966373384f19d3699b69749dd193f6a63d3dac46bcb960c2c9729e27e45d0f6a256a4c4d252be439c14e5a71a6a2b94fd7416e5b411ec3e54c92849bdfeddbac30bdacbdd2baeb95b3b849649b155dc5b9b2303ea5f8226cdd63b9881aebd850fc15495346e6e284a35f7369b4650743f18426060fb32a158f5cd99f4cbd3143c27344e16558ef9965a4df7e465d21550d283a89074a76ec76cc4ff1cf49649c7f8d42566deb925e3bfdc7ab8416ed83ed54a9f8a8c7a559bed0873cb912623f471ba10d20dc716d5dab50704551658895b33d3948c533a4d21a58dce9bc079d37b1425958e596526f6d88bcdf5195be386c88950166892f67120848bc5baacdff6404a5f84880ae04ebf2b7584edd8771a826515dbc9c6092af6a7c85f9648168132084a0699c5f8dc23b71049e32abe7e4d29b8f7b1a1dc79e8a8bcd0adac7f354beff9ccde4884a73a40288ac43eeee1b4a91654f65cb2f6978e9f1e9bfe894d13034f21693a7ce7991126338e9f7d0e49956762022604145a0fb862bafe572ccc1f3519ec6b30c8f6561826146848e6b92001f2ff065f8f1e1541254bb28ccc3d8c272337b89d2fab367cc47b1e0956cc1758e3be20b2faaa63b06561e3a98bb1d71fe4b3e7bb4803218e603e800b7e707c2e45520cbbad710e907db10f901a312a85d693f96a68b37e51acc7c0b47d026bfdaff74bd511c4e1aac67b5e7a7b9f6226e2fd2e10e7e9eef25ea7d1824c7836985572ca3c934e966d84d6734ba62471a2136f4d4f4cb646969d56b1095c7aaf738a01de6199f2d85651b740bc4d4687a1b628de46a345e4f94161babbefb938bee33c86341346988b868ce64b59fcb46056a7c56e4f4a5993ef8b30dcbc64563d039be8e62e9ffd54cce1af463dafbdbc12446e1764f2c58a3a3aba38c4f352c044a5258c6f50da60cd6169c308df1867581508f561913019866ac9fda5b6428e42cd094cb996f904e7ada682569f36454cab815c900bf038aa3f8988d795553623f6c78d652c5cf99197ce597105fb9364d605746a1d249ea4da769644a35adbd0a4898f69c25dc8de18ead6e896a66fd152b0a7a332c427eda5258139a55758d2ca368d768f320008ca6fe6cca77b4d3bcc92799637796ac2163197a48cc7138032bc6af531094a99208f122ed05f924da40fc8fa6e4612704bf7f786bb52851f57837d92aa9a3fbb9262c7ba2ff14a615dc9321bc594e8e8de6577d17bffa9865b77e06a1257c0eb432fd49ca1d062b8da9318ca8d05a7955a425380eadad51edff236bbd04d3c0ada3ee334610fa284424095ac3449f911863ca84810c1a0b8cd410497f6f3190d68a7c4636e14f9b7fc4b09b283d2d0a30ea12ec9d78317c2bf28d08a188b13a466d885bc5aa75cb65ee9ca6119aca119145ce71db7e91d9fcf071b15bc8d5e25749533bd1901d4f75cad48830ee04000000000000000000000000c757e7b6d9acb97514c10e9b028c0d794862b6165b739cccf71168edec4bcafd1c1b2efd7546b3afba99dea16af6d8e3e3673f4d8b4e8bd83211a5505637d9c5d06d6c2b48950f3bd5e5eb68eaa82e46f56ed8a6c24f80d00276e3d53aa9fb5e00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000e4e323cc5546aeeb2b545cfd262815e47cd2dbe45c6852f9a16fc237caf4706a8ade9f02f351ec6784931bbfcfff79236106d8311001f9a009b6030594b0081bb9ce078316ccc2271c7d75aec28c302db6643f1eabfc2dc1e3b59d724382281824203176209ceeef80c32e86c7a3966fa7280dbae0f6b79d96e8a019b9c73aaae8d5c3e7ad0490451a0e10f8dc8ff9eaa3cf623286cb704de9198ee5233d6ebc0aa85b0ce942eb2cfc866fde4ebb8116a04789d6a460521f534736ad849d482d506a2ff7b14671962421ba1a401ef27a06d11677c7573f78dff05145be7f3a64cbe3b97a52e4e7d3eb635600c14e3f2f34ae7053c36d9ac89689486628e8970829d707fcb1d7f1bdc8dd182e355d4a8bc799d7163a8e33856a65abb324eaab182d3b3f31f1faa6fad61d88455cfc36a2072135d73ccb72ad09eb56b3012f587b9064f8cd9a63f9a4ebae09935cfede34b1c79ac2c212fbddea4754cb7e393f816c03c23d3bfa82bfb109eaf90d98524334a251df523328fa3824d91b106a1ea973ef4ed8726acb3312133b4ce9775fc0e8f816d173e9bceedfb351a922d8f063d1609932c48da4524945a2df58fedd54d97e10e59b062efcbc5f9c5ceaafaa298bcfcead5cb3f78a5644a0bfa076b4faa2912ae07d59e8846d1831d236cf72f00ccc6df7e50f9eb2c0434068c561e21d683ea2f45453337d49a79186adfa1fcb6413c2f11758ca7ed34020e50ee69b7e8a44a12e83fb6a094fa0f67685c97292d2de6e37d23c14c1b07b553794b3702f23a5f17a781397bdc51c5969bf034b5ec4678fbfdb840dfb79ee8d599370066cc24adbda12afca72e1471add48efc4232b217d6069196dc3a851e1a07798e059274caf4862d2ceb883a4896c10208c0d5248a86e4fa50316e469f884a9aaa03289098200ea16f546b26f50df79f95d2308d8327fc8a7bad8e0182e9ee3183447e526fb23efe98fda0a0768fd329feac7d42c26b7cc42021437887066dc2e100fc6f36c88785c032e63987ba991a92ab85518f861b7bf4b7b5043ffef07c712d86bda373aebee647aaf0ffc4a42a31576ac1a2fde6456f293159d447775657f0ead679d4f8e993b6b8d0328538259a97fde16155b4d285291f98169d77310c010d764aa372bfc5733453f747233b250c65ffef5571c767b35b47a061b0cd7a2a44939fc733a7ba3ff07cf254596557f7b8ccf0301e83d4cdf7877df65048323c62b3f68398dd1a06f04adff1cbacdf89bb87d4dfa0255bca325ea0c14da1eca2ba4bf1e43a993144a1fbf8344bd1e69cfda2482a4c350601613bcc11a6acec419030d41b45c3eaf8f4709f039929aa30f63eeb4bbcbeaf7d59abfbcc4b07ad0d090308d2c777fbc6a05cbfac2cfa92fdefef7790137f172ccb1a9e8e69047ec923b551a1761bbed3af08a5dc52a176a6542480eb79c6cb2b74d3a76a4c8b378bed854a7b374ee0b3fa25421a8ecdb9a59983a058e773091bb94882ed312d734a70a70a9a893052994d02a0d409c911e75b6d08e5b1c70c45b546713c5001dc160bc203d9b2ef0c06302eaf6b6fe7c79cd1f270e88ac1280b01bf4c790bdfd7fafc5a7f7c354bc5327bafe6065ff8b383ba1ea5cf205d2a28e32d37509c85ac86f8bd8241c32ed949242f715a046ac61e8ddcff218ad5a8bd474bf0364f67ab04b6dc5f52514b3a96aa21bc5870119d21d5be9a78f118a98bcf124c546176cf367793abba57176bc4e6879f58d73c4c83a43727160b9f200d2db21f2e9b8ed032952ae3059afc0b400db71163e179fb9eca5e9a6d4cea9c774d243ff517a34d3edf9b3f988cad11434f368a28f1b66ac268a93c165d12597abe68d8b74eab902aef8c157ff11b53258eb05a5086ee7ab4265ae186be20eddb4477df0a899876c0831404204b9d1e92c64f32f134bc58e7038c8709e1fd33a340b09b7a324215f4a08cca2385ed8d68cd0258210146bad3d0f3cb36e73f6da946525dc7bc1b74b8cb03da3576375b502d1ca9d59a4b9248c7027665ab947b6d70723aa5a7cefaa837f4b34f0945a0f8c2cc900b5327a5dbe9ff8746338eda2f58986dbde994bc4dcf9a1cb05b0adf6a375a67238aba3175ff50b749266b32fc9d49b452b9d00a4b40cda267d2cbd0882904186ad88b152b550968f9fc0bbf77c1e971542c60baab9a206b0eaacfb7fed6fab398a5d662ace83a24c9a57be9d8807cae4f4b83fc83c14d6b4971808179963a3fec2983fa530d155c052802d4971cc428dc97cf1fed06e0f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "6aac636a", 1, -1126402649, 4179206552, "122d94670b31d432949d8b66eab0dbbd385b16fc5ed3ca0b3a80dc70edfc1c42"],
+	["0400008085202f8902e2c9b8820d3ee061a809f36c3d888bfdc084bc5bb2bea841d871826b5ff853d60300000008ac53ac63005153acffffffff63699bddabb1e0a8cc86e405a7aa5201a57debc7a356904bade3b3ce5bb6f59e0200000000ffffffff048c1582040000000001528349c5020000000001654a1076010000000007ac52ac51535363a3b8b6020000000007536553650052510000000000000000406bfb020000000001d6a975ac2364c3ee8a8d83cdfca62542554f0d8dc6e6257820e671396123153b07e2dd7bc9a96f42c675db72e0c4618cafd48cc3b9aff9c54b52e7fff11b3b2e3b34b7a710e5eb70d6f5923e06666f1350da590a8b674295bfa3682a933a90ec557517669e13e5783c4a16b84340402b97c4ec063e7145cbae44566e2de910b2378e47d29785287832a70051577389ff7722efd8c8bb2404c78d4ffc0119e0eeb3d831f73f0fae734e4a82b1ebc06929c768c33a0e1df4ea93fb494d90411084dd85e1d8a7acefb01cb3ca9f66d9eceb6b6d324bc1db027f43cc543660093341a33bc7b6b85561136d879e852e5df869ad1cd0180a1e1378511f6fc76b246bcce728fd7d5e55124b409996fb1bde952bb842da94b6364216e453282a57b722753f4ba0bd126dde4f3d87621c3182ee90a96b06cb83195a54bbb91a7ca83112dec052802d4971cc428dc97cf1fed06e0f000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000039a5d83d1d60e88b33f4625cc76c9990e330d241f4c98341922224b8c3503935a5793e7a369e78cd1ef8777ffd5eb3a375361014f0520cca67cc25224e49bf04b653dc5fbe343b5b7b9b1f5e8b70b65c0fc3dda142a502df7c868473d3f7ea6e94ce73158351bc5e1e41e28720811946814a87a7391b7cd855364660cc27fabb487a1cb9a6ac90ea32b4ff907fa902c51c0a4da3f62bcef6981da4dadb982b66d42ad8327aed392ce6574220eed970d9984316bb91f821f6e7665af01431a8c3dad87d55c322697241bf5890fd95372559eed2f98cc1848c29fe834a819f09b948d0564d39b9b8696963fa205ec55373905a6510313a4f9532de16e61e354977743e086b9b8c7b32a05e3a53a01934b4aa261a554afa1b825c32e8dc4bd324a539053fa4fa83106583389731c964987c012c7fc2c0b6c1db71ddb0b6905bfa009cf61cd9c37b5bba2f2fbf7b75daa6f89807338b2e9e25b673359a656ea51f09b41408afc0cc9865e4ce03ecebf25e14a27f13f4cecbd82396ea5369e1105a99c235568210132d6a560d1eeca4b234ea5ef7b614a43e4b361056f6dd348ea186340567571d1083c4ccc6cce65785448343ebd6abc64318d11aefeb60475720ec82f1142e78be3e5689843fe98c68975ce1094b54b6cf6c7495b8b990d593443192c328dd28cc594c410dac61ad8141a431843b07dfd71b26809cd3ede6c67b7ef90b8db47705d76547d434f0d44648e0950019baee8da6d545301072ed9feada77fac4bbc27d48a21d31533b59136dfb4059d12fc044a362a4f79e7271bbd2bdb6264de43883d7c1abd009e7389c63186f488c59a8d5296e0ab20505b11d10ed10cbd064908093ebf5dac7925ad392f29f373a0a0ac1d1adbe9218eb5fe75c3cb4a48fdea7dba6107cf8c250eb357e1e09d8150585642c27600aef169ddd1b2ffcb78cd3b9196e577c27f189dd879a9785a5cde57e1fa84cd28be6ac16edd739805c1488c2949bb7189d7962f54d9c6edb098f8e4af8a84e6e94f75ec8789c2ee0aeb7ad150ffeaa653038f520b2e98dad39b6d05f9cfa8086f2cd93dcb3abbba52ad49dd315036588c49657b0295a735e0632dc1b9b4cbd64d8d6757aa89f63cec4fe8e93240066ab165472f7670fdbfb5ffca04bcd1c93ecaade7a90909f64cf9f8bc9680c8cdd74e3240d2ee52379875335b53ea05ea2c66195ab55a25270daf05b9c221a676e77b8b81c726ba28e64dd0cfb9d09d2e2a3febf03a5c21e57a8ed9523c1fa87c515406d659a145ba7c0c13ca8d83f1cb75b4498b75d38c76aac9ab01bc0afe41ed62dc1007a5bb3c783347d4a78c899b19b3575165ba1195ad211087e791771e4b92eb45ffdf8c608a2ecbf1632c9ce2f20f6e55aecf0844f605421e5e00af2f2e3295884aebc421ad7b375c41dcd691bec2b0799a41eab8f60c8419d920ca98a39e2107ea778ec75838f866717081e23ea5d938b0233b9f3fef9340339f5a5365b117dbe1092b9dd17007e1edccc989b597ed3baab4351a04a31a30ac63cbb2ca4dbb19ed415e82f91983e7074777cb806c5a5c2ebc93ec4389fadc12b4fe0633c30dd8627210c4b1b783774a05c8fe7df03f01876c3fc64869e62e6577af873467c5b591cffe4961f7f98979003106f4c0546a84a98978f353c362b7f6f3faf31ec0d4016e5f583c0ab5983bd1bfe920852e97e0bc3e04877128113c8b7b43f4bfdc38006c5e61cfabc75b44ecb31518ead30c2cc867c0c025558488fab0a2c03fb70242183f20d8a6c9dab6d56c68f44db9d64d644fa80154de4e40effff375574a6b113f78eace26f38d2420914a7be7eb409f89a740e8e4cb472c18c46d22208694f78aa18dc3727ed5824e2aa4e6e23ddfc544189be6f7d26a01fe983e0da0faa764a307e66e32d401977d82d9d73d46973f1da53e7390632ba10118fb4baa0434d49d37df2d6c90b48b35818a26612373b9d21e357780f7799c0f3a2ce0cab5b5f3d5a999e809650bf5d02f5c97fa88dc4b280ac5ce835a2f762f6a7850d7c339286a76090addbfe5eb9d9f4c9d2837fe63727b2d9e17633303941c16e0d2d82f1967bfbfc61e87e2a5e1d5b7f5d5de366c14d3c4140dc86dc32c569f2a49ea7ea871edd7c853cd4e874ea173b527c34780ef0268ace97bfa0b457580e6aace288459af14375a7627229f06315481e0440be1dfedc9ecff957d3cd23250028f551e2f1b257aaa9ad856a09c3dc630c857e149e58b187882563c823bcee3b83006ffd9a87d6c159b14914ceaeb112b14a47162e15e39c6aa33f8b052b61f659889c742d0f306b401912822609f2976ec7bad99dbd8c9c9d91324df4b2796eb2aafe5a748631e43cbc5dab907a238288087bad6580966f3b834af3d933a39e3d71969f0d4c229a7eb4215953c625f5a8bd396baa86b404473d6085d4d48e1a58394188adbb0f1585d1c4228fdf5b8d66ff8321b7a2f4282a6c79b2307033405fcc1aa982e5f40f38b5e5188675dfc6c4333c663afb1a7ecb23ca4693c9efc0231ddc42e640219a21983804c5a3587209714cb24aa7a320fe95a94b677cd6235e7a62449c76c57749407b6f3199b35a372bc25fa6254e521d399f447d948266a5c420a2b4bbaf2c1c19eb93214b13717b0240ea3bb7ba248df33bd6a57152a31c3d284becd795808882a69c246d02574ddde6dd393731787123e8eba89c92f941aa182950337d3c4ef822602aaaa1b0a6b894481eb071b197d14dd4c60d372dbd10dc2fe9c9fa8276d97973db9869947148f65704f0a92f69810b042d253b5172aa1f55c52fc148dbbda348845e82665a08bcbdf83a62e3d89220a3a33022fa87bca8fd789ee74d985136d362e1b6460ed6474e013dd79e0ecb6a49fe7ff1d5ad0153f00aa5bc71de65303a0eb8cb7cd541123b32df6ce08d5f1683df7f771ddb6f2c049ce54276f4420d4e03c74babd4107f16f4323111d22661113561807adcc7a2e9c6297816358788637a3646a223047ab83116c3f50f97abb9702b91e63c03e719363509b7d673bf59f902eae4f32285633b69a740e4e2fa3a3773eeeae1edccc85189df86ee1c1e6915ecfc6d5c43e3ccaf37a85f00e73a083c8e2dc08c46a025eec3d646b91198dfba333100ff6e92a3d328b96798bfda1424b723b2ea9feb4e63b7098171412e662c10c2b8cd12f6116793b6ccb259ffb761336eeb4b65496883cf6f9a8800306cab76b4a60ad7e636e535b1e6b27fecbace987dcf5cd541489376ee033f0b0df7011f4da391428c171ababe9a889bbcfa0baac999338e234eb1378264473118836ba719cf71d7968d5e8f12bc96c411812eb21ed0f8992ced2251ae75e649aa0a13d792cd4f3cf12c0e76e7e122add85e7b53d9d8f865529b539991275e308ef9db4f332c43e96d628f635489b6bb63a9a1a8002526af3059ea9eb72edbcaaa07a50b922c1026d3d33a7f8ec3a0b36a131acb48e168cb6ba1770961f4406a5c53ae5a7021ebbe731bd477fd2c6c332de2c57977c85fa6c4d2692744247f7d01cd87650ffe356c7eb61814af67f99f829e44fc08d33a13196d9bc95ad4d6dc6dd57ed8720312d7510f506ad989a4ec453fa7a5dc6174ff2eca4d8cab25f926ea6e8894c762744c970f9608a36aebf8445ba803af0fcde80d8c2106a75ad8d34a9653c1d93d831454330be016927d4e3ea4df1d6441de871188d0e16665a16a147d0509a207079df0f977856902e12aab56c9aa49f63cdc5067bab6a8eb5180ae552f681770ad4975d309bfd186bf1eb8028850f5ca58abd65bfb8c263c312753ce230a94e9262d3ca58629f59614f5dc465c1b1b39edb0b435913d3c9d711b0cf6a048e759cff2d21d6bfb4c6b6d3d2368000b621f575006dbf834761b36b64085835abd820914acd16f2e3a3cfe7378d2209ac8befd24ea83bba0fd7a50378a089b74dc266a7979c0e5359869a8c43b1b265086e759a6bd58f928a0ec9a8b23dbbdf896ddf41af750100000000000000007f7e2f000000000059a26a2fa55e70a865bc8b17e6daec0c15f00eb4deb74eb7b8f6cd6391ca0eb7539a3b8f8cc453e0010e9edbd643becc2e08400dc9073d48fe52f587f243e0d6dc112ae7be625497afe04fb47047b6d809ae558e38ee956527001f0c3076a95200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000ef33e9470f1d30d124dc47d7d684f22b6d75c8ddf5435e1294bad789a3b95280c67a89ea8949e03cdcaac226baa995e94c5209e629f9b623a1d25a6a4e4ac1433273722b96fd06bf55e6848cb827e8817b99dc98397bc24c147ed107a12f1ef803ed4752874e4d009fe94db8f55a548111adb333c0980e3463fa9b81dc00124294e747606c7dee3666c6fce335c80b6ae8dc5e8b8b00116712ea1468209048a29648173268e34440711fefce55076b35270fa76b7f40df0733861a02371b8577f5500475b42456b26a005482f70937b67d18e12df6e4fc02d2112c393d928a3cc424ae4ea14b2ebbc2c4620225e07c6399b6bd34a82f01711f89db34b7c0e25da7e83625c6b530c5e09b4ba177e7c307322408a3ad6e35aeea38ddbb77c16e5f5af26f4cdabc0c85343533be4b229d2e78bc18628f6cebf4c31aa4266a0743b2a1eb1c50a9b62970d8571fa6994899e5e892247088798b083abb042253337a601c5cf21da3a1bb476082bbee87a8a0f919315b2fcd65f18df11fbedeaae389cca8bdfd5a23494d49e75638354f395d971e2126a775cee2903bb557bd6dd62bc8c8d5c915f0321c62781dfc8390db83882226010aee0f8bbbc805ecf5275c58650574c11e993c958b49d976c5952c9c68c90d629ec394c29f57cd1458dfdd0c0f988c0351d091d738a3336337ac420355edd33db201118454111937d8ed648781be307c339fcf85e3803973f72a7146b110af342cd3d0d82aa3da988de42b20089a8c5a5d52c13d79cbfbfe1872faca729e23bc303be8cbfe7fdce87ff45577b9516a87c16a747aab149b8369d74c281bf9c7e8f4e7c8a86c693e631258ab215d2cf1f3571ba37f20b4d2349e2accea5329a962d6edd5f96c3fd3930c2cc4d7538705dd71d25d6c7abbaabd82aec600f4301888ebfa608a7351c9f048e6d081ca4541a3a4e03e09edb91a1b626c4157329aa30fb3d0b721103c2311a6a04e0cefce37f4eb50cd107ba0df22e6867fedf3d736bf9178702b36606c5e66e1d316f06049965eb14ab26a69051517ec338b0acf974d311849ab5915fde85cab9630c7455ad8010fbe2cbbdc3e3fbc850ca08239e6c706fb8f298f74e4a90a25f8614fb0115407c9832c351d3a363ace036c59dfc7ca5e3bcd6c237f62e72063c2bbb36005bfcf5ff6bba47a3ffa31097b336522ed95834d1facfe7399661dfd98e7876da1ece75b891f2ed40ee0af9a25a1241f55feb34c13a642b16585a2eac8738e5caf32ea1db43100aaafbbf40fadf954723a78548a4d50b50d0fa69b4718d790172f8e70a3f58e81489f0af5b20e537622891037cef06dcd09c01f74e03c18c4a93380fca2f58acbafc7fab8f558c43d0678b196d403be64f87ace685912a0355df185fc99ec4232e2f95827a93ee4537c3d07e1cb3af266e1a917c7937cc73cbafbb85b1bc0f7586e58c9136149c9960f307cde8237e1d066e48d31985ed3857a81ed14431167298cfd9bc8014914628d5379d8680aad3595eba9766ba51aebc4d35a46109dfd7f0407d3dd02204b88f907b11ef4df27c777c5e23f7a171a8c5e71fd8581447256d6181d25cbfe32823d4eced026e6b7a10c182df05b04a3ca47e007b6cc04ec10e5613ded3a3286ee80a617b4c041dde8174039babbb36b376405a45c3c7703dd4f0ada4f1d89ddce439e8c9a85dca5ba8d481f38f88e66f368ae5583806615bf800160f5698b3565abe1bb2b6a359ad553fae39f20ceb6089d41f86116300e685fcff0acabd21637e2255000cb149c1d3f61c0924ebb4e8dd9a3ecf1062a387cf32d96331c980f37c47d8a46571d38783400b29bf5d91594d763bdbf687f525df2e832aed734977f130612f9cf3615aa2f7d3921f910d93bf1dc5e763d9c351608222d442d3c83afc7ebb5daaeb42d4690303a7ec6dc8e8ecbd0b905af4a3ce35157db5268499bd28de5b375d15f1fc79861877227726054b9fdc82fb0924ba06bf34e859b4713c728d0bd62ae94186d3be8b4173a10e8ef930798b3856b9c940873f4f0f9b5dff2603a17eb1f7c57993d27cddc2b30c2bd83e1719d0be60b2241226d3fcee1136db682e478e527b3857554f3a9633348a0865fab80ed6a3ce365e31e65b0766b73f14c143f4365ce86c68a8e7e84db0b25000acd90461efbae040e1a6405664857a0f93ba8e04fabb7079618c4b836fa64943762dfc863d677ca9a0cd0848f37d5bb9c1039df9cec7edf9141f52eb07332af90b82f2a3e384d38c99c649bbb2c354a0d00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "536a6a00", 0, 1461801500, 733220448, "8e2ae8c4ddbe41d7573a185a4f6b0b7028066f6f3af39d410f51f46b18c01173"],
+	["2206425d04af56c11670abcd11838c7c3fec845a990790dedd32c15f7ec17bafc9664503790200000007635365ac515153ffffffffc140261c1ac5a1e9dbf12b1f857aad7ce2cbf35d7b4f0fab9d26cd76bb5c4eeb0200000005655353acac98b6dd2235f07444f549cc48638d3bcfec82d10186985d5c4782c76e345f979059025e7000000000025253b23e7093a89d7854ba2d9ad711eb43ef0768bffbf819d9770bba4c565391c77b723ec7d60100000000ffffffff02e78897030000000006ac6a6a006563a3ad400000000000016a553b300f00", "526500", 3, -113968382, 733220448, "99f0ee26e061b6e31766c6839eb34adfabb938b58b263b20d25a3a2984a578bc"],
+	["e1c2c01f03032c34d93ee65f634776acc5ab1e54d89bec8fbc9b8adc5b289765232503843602000000050000535263ffffffff4137cbf780a8dfbf6d50feed1a293ac737276105b30d4399c7021d78562467e403000000055365526a63ffffffff64530ce9b846426faade48fd7543967822850a8388fa83fc7caff41ad1b3023f0300000008536553ac00535353ffffffff03ba712004000000000165f9e93305000000000031143d0200000000000000000000", "52ac515153ac63", 2, 927510644, 3925833126, "55d7eb4739e8826b92ac0c9a2d41860536fc48c81ad28214006460774f3f5bf2"],
+	["6aab02740384dd35954262498e616f996314d4cce0645efbcc8fec18706f5eb83f69c6c7f900000000026a52ffffffff19eefbeb032a2d5ff726d0bdde580259fd0c60786745c6dd3b8b80605be70c860200000002006a5d758a126867a35c1af42f4871ffa3ac114feef7832444200c5a722031d7c0f94c715db20200000000ffffffff02d56fcf050000000006636a65526a517823200200000000000000000000", "6552526551536563", 2, -1438005921, 4179206552, "d462877a77238bdc7f99b1224568f336885e014f6ac9b003ee5b4c72e9405249"],
+	["22188210012cda2bd562c3ad0d9c055769f3b725eee215571760d787bbd9322fc6a4e4a7d1010000000700005252516a006f4967ad01056bec00000000000865515100ac65516a0000000000", "ac6a5152006552006a", 0, 188806762, 1953719636, "78cad42d45acc35eece12e9aa1d3e4460bfb835f58be11da3b429a8029441ada"],
+	["c6b0134502a46623ce8cc9375c7568f0543c5edd88e1b2839689ec8f25be06d7a2480f137f000000000551000063acffffffffdf9de7fb61cae6630fdb7723f4abe4ea081fc6ed3270de81898f7856ea9fb2fd0300000006005153ac5263ffffffff0331901c050000000005ac6a65ac00fd348f04000000000565655100632b517301000000000953ac636563655100519299499800", "ac51", 0, -1534901314, 4179206552, "219fc3338d5b9d2409c3a9afe0d50448546b15357addd03d1d7e27edb7b685e5"],
+	["0400008085202f890403602b4c5d9f224322089917b4bac4441d1570a7a65846df109b59798f58859e02000000056a52656563ffffffffd40ef2c30e374e7b256971e68897eb5d93af913b7b633a908485f599c8874d4b010000000752ac63ac515252ffffffff5ca12db16904fe2e7f534f8bc687274005f3a31b07848595554e1052e8727ba703000000056300ac5353ffffffffd06a925859d64740967b7b7238b726ac45e8f8554c50198fdcacf7964d976d7f0100000002636affffffff037d33c1020000000005ac63516552142724010000000004005151515c5a1c050000000002535103f3f8c0a5e64d09579a8b01000000000473314b51816219c999029bc3b7eac667aaf359b3847cf18fd87bcc9f870a8c83f5a5893d4cc336ed75fb2c2296733e5c9ad8b039b3af25c53899e6eb1f979512e8a31604474bbf09f474cc3ae01ddcf319456c1d0a1134154233138e5820f0fa39afac12671f1f5209f010a7b30c31ce91347454706c0a400352ab3b377eb7578c34ddb5af1034a5f149c596df93c5c1129a000ea7ca16f20cd65e70ae41a28c90b696e17201130f8083c177a11d3b0b8fd79e5efcfb382124b10a2e346c2a09a3cd983d7247ea67e5c03bc588990e7950ec4aa81954f4e073a86c4ac372ac956107a5bd9767674d33cc8d2eb0710ab2206b5d22e11721230408302be30ce12ef7df50286d3477b7c618f75356ac446f30c96768a0c620782651210aca4ab363484765c6612ef111f9def71bd8c11943a4fe2b72d2ca2e2be6fb81628b398aa7b82f2a3e384d38c99c649bbb2c354a0d000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000b68e713989686e963e5bd247d363a48f00c13fb4e591e26b2ad0a784ba8f7a45c8d6d2c5df2fc4c4268ff4b2eab04e056b8c15cb090d027abd48c1cc7fba212a70f1e883c6241d8aed5cb91de3618f7c5e0a9b947cebda47aace3de280a41afac53fdeb00117365cfc21107e6516237cb10f702b05ba55eb0c51930cdf64b62ac294b5a1ba5a6325e0c8842ca35865d93d98eb257ac8bcdbfd434c9770e3bb8a15e9b595b8d1a0321ec98e2ab78ca044769b9be6e7983c82651d2832e6ad4a2612b582252e384a00a51ea67972cbf8f562022c98e2b8e7ba066ade5061d9eecd889a207db405aacc3986c1f1330909591b44fd28e846461c27dc4001eb67c8863f2a7f18b6144fb3b5255ca2682b0a41f34af0c34b5978bdb33741f2edba745f2602386a264e4f87bee01d65e59fabc93f9b09162fe3a0012a138e0e0ccec08db82f2a3e384d38c99c649bbb2c354a0d0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003a9094ca4eaaf566960c6f1d8ec0b828c6a61c3c2294f51592723505b34eb6c03ad5163e9165941fca61c182a36cb80bf1f28810b988edc5261b0f990452fa09438e520fa97f4df2dc58113b57ec40160f861c1d212aaeb48669fdd411c3e824cf79d06d954d4713ae020841fbf96943aa53fd511b362dceb1b3d166652e3a91e7d8becf9bbae4b953bb38109eecf45884578024a289aa10702f72d8e8d9b3ac8a193904b613d0a76ba4bd4919c351fafad723a31e8dcbe8485cde77ce1fce285e330d53979e15494977f85dea71d21e1e50966880944a1f3f4c9862feb891d9206dd0ee92c522e50ce791f8e4e45c5ff286ca7c7581e924f985c550e4501366aff5af07299b5465b0d54a8f489c8e1cfb16b6abe4295045314f582fa5ae50b8b96db472a7201adafc9f89e14d84820dac58b2a9c802b6df9067cffc14305b61b82f2a3e384d38c99c649bbb2c354a0d0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d8bef3b3a73ee75625f9d4eea90cf945eac50539962a2cc4e6f46cfc3e70886225ea49d2279e3b695153934c2644694b56d652a66916d291686ac8ee97ce601bd815f0c20e89e539174a585b216481279ec841f8e4c9e2c3761bbc13ef0078df453ef246466407f360aff5a7cb2ae51f5b87e7f0121df92cab88c49dc498dabcf984dd6aeb08275600cfaf05548fdfb8f45d61b398e7508f0198aeb947a7cd076d8cf134d44619b7141ac587291a92fb0e8665a618cf8978efa534a30ed84d709ee421a4dabdc82c3a13e8d6ac30fe134f5b40504df0082d599b81a416c083a41b1389be4234ac850d49c11f56203cdd5d6650f7647aec0f8add984e76a9be0e4f1bb23f84404431a112b62a967647847be5bc4d46d54760ac3dd5fcdb9768c8e155208e4c19d3dd092a3fd0498ff898b83ca5bfc399e5f7194ebec3885fa4ab82f2a3e384d38c99c649bbb2c354a0d000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000027beb7d166257f618ad3fa7137059f6b3be05b03d963f9a1ddb4eaae8ffec65b5c0d370fd9d8050e14d5e1cb5ece58bad789a0a221f4a26798c00120bbe3bcb34dab60bd801a023791f5cc1b00d0eb11e0d9ce7f94ebb64026822150affc94ae4a150d492d6146996615df20436b7c2cb693b5ae0929446aa2044da7d19c375c9d7be008a7bdc2f7a22a146046447990dba220155cad858ebb7c3f71cade5e333bc892472d6dc26e4fc1b8f252959e792eabfec05cc59eceee13a0e68bd798e3ee805c2e65c050e5a65c36321755301d70238f36271bf025f44845629ae78dac65e3c971579743dc0a39edd0819f7d716153e7fa2792c16b4ffc97a1e14a2f7355764f6da7236b2c484c4744ef89cad43b50d9a5763673cc8431cb564b3ce633aeacb0c569942db40879c76ef77ba6a5a4c4cdea5f1ca0a2c0b4f1dffbb331f1cc6a8f9742998a22d00fad7e6d42b7f57ef5c3af487817a846dc18ec05953115e0ef5837f5f83939b0a3ef1599accdae8f77ace937bfb0ececeb6d9a7696f088fc6cf1c1781a142ec2931653cbfd82ed5df23e33c464e980aaafe5f0c9c109d1cbc9adc01530b0808d21262b97044bac11a1dbfba89e9e5c1ae5c4bbe74889ea16859e7026f3f852d73ed7dad79382ac0499585cb851036bac2a186084b103005cd41c9776f32ee24aecbba0ecea1ccaca6058b1b87779e01a1bcdeb0c09527d38e20d6f894d82a32025584a9ccdfea6b409a6c1d384c2ab070466e2cce391626720e4937c0f83ed5c4c68532fa3a1e77ef8bfa162d949d3425e11ef4dae599ad7c4c967f333492b0868da0eaa923e44546beffe781911726fe4f4313f5f9346647ac2f28952ceef0b2d079950a3d29fa1c89547cef49e4b3150ad9a0dc9e41892a1d23e894d73a8a4ad3e8967fe4f821943db1e630fbe9cef4ec50cd14ba582b6e0564a8271e8d0ff29018ecde68170c9510186424ab494ecd53a328b489a0735d3033c31a79fc5c6dc12fa5aeeaab26936fb6470cb1d4d4b3dd389ac3b0c8e06313631f8e86f5e908e7c798d10830d8c2449117e2fbaa2ff370bb4811d316a56e01ce47afb895692b0684afd09041eef089b47c4c9a9ca4cb20784df9be6b589adaae71983c82a142e64bbbc5bca6aaeda1aa1e1e60b75eeba9ced53a671ebf0d054966774ddd4cc3302636265fd9a5d1261bf422b61ee83a38c158861356b964fece48fc559e4129219b105091a6b0da4899d56ec6b87202766243307e5fd8f1ee990a4648c763088428a9ee344a99578da4ab64604191b4b9f6a67cb22681e1712160db640d24048b13268b12289fc61393ae4018bbb544995041bc0230e264a0a1a664fb4cf4bb79b3ca028e43275424c1ce38551179499222fb10836b374a6b9ba5ca7e2c208059a9337bfc6164bff8fc389054743e0467122c771345c03e71be03a351f932055e565daec75f4ad70afc29f2cc3dc3ab499cd2c0bdcfb9fa94299505442daad7ef5c94cb181405efa0694277669032cf5075e3230a70440cf9e3ba140f51c8c9d2026e30bb5a87f5e892096b93526f28b488c05c2a4dcc540d3e1b954a1673af034b8a79f6cc035a9facfe6fcb214b1fdcc22381b150727de863fdb56d91aa8de22a0f2efdd9b233a82c49d6a81915877b3160be38394a38c829afb00f8b68b2839ae99b390e37be2fbfef1dcc1441223a83bd7a04812ebcc78fa39dd1a5ac22447e4c38f212fdb6f652921a850c1e36ebd9a6a7bb5f32981661429fa8c199486f454296c39cc79f16b9c90db9789dacbd07fd7cc7929764050f7edc10b58d6290c334a6b11401c5dcb9c527e13aeaa9d1bc68f9fd917a8780eccaa037cb64afecb096bc3152178023e9a00175ddf51eb563c90db5ca546a47cf7fd2c57b2c0bcc472f14d73fb5c8dfc90088f1eedf7a5c199c10abf0dafcd406c3ff17729889a8483ffe5eb8796865113075c90523deab772dd9b0e8c413929f27f07f3b78e1dce7e08e282f7c5cd9eb82f97d3b49fd6cd11092a56a13a90ab2b8fd9516c4fcaff2885e5e620f217e8be25ab74727ee2ca5b6bf4a95b84cbcdcd51c813feede948c5b0565893ba3d8cf88669d1f044875b265cd92fd3ace850cae1048a283fcd875cc16ba84760c5b9d1cbf3c6dabd3aa5a96dbd9d6af40be1ff00342278065d4a7a3b432619a2cb1669a1a31411ca23c7495e9ee29e4f2714e55fbc4176c5d04d3025782190f4fe05769d2979ab8a0cfba3219c8860bb5f4401196e43218aceb505445bb319b1da08b9be9fc689e5cb75d271f8570f9d7d517881095903ef97ebe7c18a1b2aa5bd5c5d301959a2e6d05339c76ac60485b4af33359e269a25366bcce8e7cbef4914a8c51896faa7bd1b2106344304fc09b76bf55131ae04d771b34e857ff7e4f9fd5397478dd4b1d46da6b38c34450c46342294aae782341d83f340cff1233bbeef39b0e2fe6592e48810be3141dc87d8c3043d83c15e27d2cb79ed35931937f532620d27beb8ebe2d14924250779eb54f1c537dc304b7087e828f5d6fa97f982b9aa40be70b1fbe6c0bc7494d27b3f53ea884f13f838ae0655553e3ce33d201a474bd6a78f3fd83738c5612909ff19b088fbf5e495463c4c1a63b5b5777a01861d1dbeec1227db944f48472d6c7b1dcef21f8a67aab65720000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "ac6a00635252006a", 1, -438242498, 4122551051, "04a6770adcb9298347b70e2ae0ce5b32f5a9283ca20e9a4e58b097bc435ace48"],
+	["030000807082c4030153631585b5e4534a2c95176ec3f96f83f3fc842e86fc08d06ebc3109347c081102000000076a5300536a6565ffffffff021336e80500000000066363ac53636aac50230100000000025200000000000000000000", "51526a6a5263", 0, -1208696705, 3925833126, "0766d53700c3671f4493c1f291cd462c07516ef9ad30d3e3d630a4ed0f9311b5"],
+	["651cdd76049e74a554d92afa38ca848029f369dd090a1c5a50136c0d882ca156c2501b9ecd01000000036a6a63ffffffff538873e8f8541b6c3ae255f1c49f4bc3b48faedbc0460245ed473d0d0ada75e2010000000263acffffffffdce93e57c0aadf7b1753f29a3431df99f291340d5224fea526b15911fc24438d02000000036a530050ed977a4ecff96d1031c981c5db9521ea8a875bbdbc2e4962bbe90ece98303e193079a402000000056a51ac5152fcefa8a604860adc010000000001ac216985050000000008526a656a6365acac6396360500000000016a3c675401000000000951636a6a00006a6a000000000000", "6a6563", 3, 1022587212, 1953719636, "921da63f04784c95723d03098dfd10db387d8ee2c7f667d99de84eff89f0e5a5"],
+	["030000807082c40302d27371fa7f3289b7029f3bb20ac91cec666632a5d31598a04d52c36d1469139001000000096a0063525363636a52402112b8b30a023a30cc5ca0ff5990e1c6b7370a95379938a4d75b292381e08ef39976fe000000000200000ad7fa21030262bb0300000000056552635263d5ec87030000000007525200006a6551ff2b7b00000000000000000000fedf630900", "6563525263", 1, -67807847, 1991772603, "a7b2e2a37c4de02cec4e41e4f11e79c93f0f015304261cfdfd2cd7dc01ea1ff8"],
+	["0400008085202f89021eac65393915d4f4abcd58f865f348a2046c1f6e4f503a5967e65f804eb5c2000300000007516300536351000acee438c2450b45363d4476fd3fc60eb2dd23332fcf1ed7f924cfd0c649ebb489a3f5a50200000005636a6552acffffffff04c001620300000000075251525100655238b1af020000000002006583384b0400000000035165ac20b5ba020000000008655163630053acac000000002ae5000e3e00d903000000000215beae23f811c5e3755e4cce3d670bf02f310291c3b6f00cc6b6ce4897570bdaa4b9905bef5cc5d8220b1e8e6339dffb38f6911633a8c5aba32dcb4ebb28c051d87ffce3a4da7b86e7200621a06ff1e46061e770513deef7cb9d5295852314a4c4cb916543b6ff03a8178242cb8e85d3700b7fc584be030c328ba2eec4a0a91f770803bb615b8aa6531ea6d4884437ad3402af1c84eef19499a44201b50a8604fc5464c8bdc18155ebf757506ceb9223e88f76cc087d6e1575dd07bc4b949be21ce02bc0a745c7d2b2ab0c5e382105edd1845c9837c417276ea7bd87b29506851af06ca3293941658c87d17f3e20878acb0adb14564d05031ee5a10dd0427da395b588559230641d625b370eeab1c51dfe0788873d02de01b5670e3478dab5a8c44f321b0b7c10f3df69b980b2661faa37683f902f7249ac02891c08327646c59bbaea1835212cdc7f4ce412fa6b4a0200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000084de8fa436c943ef47e2ca4e36776e08ac4b36c8a55856b071c823f32de1593a725991067547720962307cf4e0edfa17e48b068e925a2298ebe24401862e3866a3de6849c28db5db19d6bd9cdaddb697ce37c39b5da940d76338658f353a00a8a3df84181a9a555aa96ec0629908bd7922af55a2238aea7b4ad688805d632dc13b2d8940b2c87efaf1844bb6470aa9ee19808b77bbea1311c86a2b763b11fa1c3f3af8c6ee7f7a16a78a42695efee79c675019dfb3edd3c071f2d4497e8dc46b95bc2ce02b52c1de693a330c678531cb3fb7c6ab00c3f90b6c4f98e2990701edbd5b8559403adb4ccbee05dfaa4509a55fd8e1f41ff83f09631a0c2f379b172b7905f0ee806ff3f83b211376c143121e72ea3d1bad847eef30fe67149eac348e8706af3d37da0cc01891e2b5c352d2c073cb6cd183f20d18fad5b128aab692699bbaea1835212cdc7f4ce412fa6b4a0200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002b29d5fa8f416b433c57e79e388a3da64766deec115f5bbc960392633b9e4c7db6208670eaf2a5d9aca5fc50036bdae565c88f86127b273c24c2c0ecf691a040313f450aace13564df140dca06ed7a0f0562263d0b6d6f554435473fb0f3a4843422a4987e99c2786dc3d7e7b43507a346fe4f7a20ad4a726427e5d48ca654b3bf53ee2e6cbf3094e093b1c69ef6692480bd5416f17ac2e705d8a85cfad74a612ff6d9fa9e1041dec727d0e18f6d5bf17f4fae47ad9b8320a443dcefc43f5fcc6222e0659f29074a97e82bde072f27b0729c66b1b97616fa935ba834253b9911b3f171d05d131d960f74e85427ec0d023695c51cea02e99d75c7d6423182152dd7607f8e9c5f5f0844a3e7d7a5e58bd141848eae0d11d616543d25a6c90f61bea559bacacfdf63062bb2d6067b5d9fd89e2b139a5a96c6390a058f8b866ec3dcd07fa7113ae72204ec935c503b86a66d39d134266cf59ed95fe630ccd52ef78ee5a92314a405cc95c0ce848afc38a0d5287fb7540e7ee22008f13006ec9c678bd29c72b2d82eaee1e9678105d0f02a83095484a245e265754877dd67e00f8f6a47102531d398e2a2d0477779f4fae33ea8633ac1e87add1ce33ae183d95ec686ea87e5d64a0f71914d3beb62653e0fb3bb70670ab9cec1d1f600a14a455d1b5138214335fb0ece840a566580494707e5dab8992b5ee22ffb1bbfb2593b1ce72735adcaed4ecfca063a75d5d115701189456d6ae66c7c0e3e7b6a4e306c57c56409ff1a1384f18a5fd71200044452e3f70f4ffea744d8a9ec39700d318735729f6b628a422bba67fe5ae027c2333871c0640e02fa705451bb31c61d534307b1de00bef92bbbf49ca4334373038a432e074245fee5c55c6702bb80f53f0846c201d709a0a23ab6eba4aaec92e37e571670ea618e2b9b41a28a284a0f53c52989763dacc54a3e6184b4119fab376e75915c7f57613f9d0a111e8f4543ba23c7628b48020ad22354f33cae21b8e2ac518ab9d5a2c2f69f82ebe3d4f913e7507944f329baae727b863e35ca2fae663c565353a9aca51b769c4aa4d78a9c6a5143fea2c619c189f507dce9fc535c8d46f4bf1b97ca97efc2af3d76ba4dc89b13a6c86c861bd0fecc65d6e06bf5b0ce7e17005d1cf578a4582457236a45149be0328f7bb5f409b62625a683ca21be886ac3991e518f4dd20da229f9b3eb277020102da4b332d70feda8e9180cd5ea6cce3c570f376721655cdcb71d74274ace89bac4f336edd5751fd1fed7e397812baeda5c80e304f512e3f238c058a234448d323f5655a30f498e68816ab0ca4d24da7a1a38c04953ded882d18f736c185794f2a0075452fc53acf71a61962e33ee1ec0699db2b020fa4df6b76f2a5b627286ef391cf5bc75fc50703e3c27f17fcb725912296ffa9d42636d05b60b01df3e2fb5def49063758714edf8ebe8bffa63ab421366effdc4d703664bc7c76f113b2a63e219c83a5c41abf315f129fe95909eaaf75cb8242610e8805d4c6e9f07ce50c5f518dde98ee835691622ffc9d981261f391f42431104a48330bd45dcf4ed20fb685ff699726327cd42af80474316f59ddbdd5ee4a528ef196c6c73e82205e10f1626c70d5714ad60ab28ee16b8534275172629e7da02eb41d9b79a12244875ea0d6cbf6777d888d478f29a3df18de1debe02c4e32642bcee7bb476e6e53b3b454c11e7ca0611bc800712d86f47ce4cf9c1e05191ac764d93b007a10db4a3c9f5b7fc16f29d307c70892457d25d99703737ad13ba9a9db42c2ed5663ff751346d79df6cc417a31683dc00f6074d9fb990d118e6942e6d261c6307628cbe6ea18f460b1b425ba53923dbd2eb29c9bd315d3c83092474b3675a8bf3adbb9cea3019657020b8b9bdf88d7192cdc618c5c5d959a70d5c6983050ed051a393c8a8a80f228658b48ce0bdf12fe7de5f64a0a4469282b158578f43a2891f9159e6ec633f70fb27ad54eccba8c3d96a997baef9a163a2e028a9e01b644210aaf83fb4e0f87b1363a9331ff8cffab132793ea89b5e471a9be3d70a74044a572f787790ba2da5583420d87ade2bcdc0e967322e0b9a7962323e2be22a6a11e45d91a91488d9c8ce122faeac2d72c6b79e1d855040cfb083ffceaed82a218fcaff82529dc2d3fe809bde7358d14822dbc532a1f7270c2652a48027276ea4f20b7b72975582a9d0b6f53084cafa1b2d21656167be76a23114da8911ec095a6fcd5c4f1ed1e956cef92f7b01594d3d1251548cc17df7a19899fac26f9e28bb8a56fd349195df737c3bba29d9acf7bcaf9c710393f5820e05ce51dd2cc361678454b33ddaaea41455100b3fde6e3e772a4bf3098581c12709f7ec3fe05c32f8f9650b4473e62c3c734958563c8e1525c9a4868307af89b8b9aeb9aab6d77748691ca61160766038da4bba7d67cce30e06d1065a49745a619efd194c8bde4fc88608838a081b4ed8f14834b085fb63ff57a0fecf9f3a03355ee27155c6918febe66147722643f2b4c011adf20211241346cb65757ac99af836d7f04b8ce9bcbc1bb19195720d150b8ed1bf81f3909cc3d60fba282c19f1e318944221948cfdb8809a1a137d7e4a4130bd78ae7147a460ca3fcb66cdde404bdb7a6d5b37e4d560d701976520b1e8e86a77b8329ea3af595a6ff0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "63535352", 1, 469562552, 733220448, "0b026a8e4c89e35dc6ec7828808aa00881b5f9c420643c13bffb7a3664df1f87"],
+	["3f58892703d9b80a4dd8c3095d47212210196ae4cf85e8b937ba9e037a4e0151205b57802803000000055253ac5151ffffffffb20c0d1c31a9234f77758005dc7702cd7bde4f32e3e5eb5c36af2ad4a76e82300000000003510063ffffffff4829548750a3e88aa9d9c44fdf8b0de60ead891db593e79d171a1571b12727430300000008636a6a656aac536ad7e0c4ae0313c86d000000000006ac53526a5351d6b1140000000000065151636351514d76c0000000000009ac6a636a6552006a530000000000", "63526a52516365", 2, -1539288224, 1991772603, "2423000cb9f159689f97e3e4ccce0281101791310b31984760b149af5081c780"],
+	["0400008085202f8902db021aeb5250ce5793b1748586e560785412a5f1fc013856d47e790e147397ed030000000253ac0857ebc748afbe26343f0281f615a072a3d9b1bdf623d887c61c900bab8796a422ec929a0200000003635253ffffffff03d8936c0200000000001ac7510500000000096a000000656a535351bd7e9b020000000008635100006a63536a000000000a025a02fc2e090000000000014bbfed09bd8ca83299117701320585420a420ed1f8dba983d848d08b0529a8c8e214065f6f68a5dbe37311651199189a66ef6861f2138ee7e4c36b1fc3b19c2fa4015f5e820d17d7371821fd346d41506d9f6267ccde2dc58a923cc0c575afc4b726d631a0d8a736e8e082577ea1492b3aa53d31b20e920fd5632cc6a558dbc910f506d724eff5c9f0ff34fb1c38ec08431f198986d1db577420d9ec5ae4de89d81c9d6082b364f898d46196f7abece8169e0b863053250e0be2c36c2b70d21f7efb6c9f980c939f24294aeb200b962aecf4aa3a583c55c9ed7580c3a82cee199bbd65cfa74decb29edfe19adabbbd99c3a69abeef6307682ddadabd3b7b180d2d766492c61bc149fb2c4ecce5fe0f306358c540d6077896c5a9e50cf8e620cb183bb1673bfeb832a0ec26f1d69d800fd5501c9861930edf7d6406026638b33d620ac706ba9ac3fd02f21d1aee6c850100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001d3f851c572313a3c77be0d1cbb6b21e34d35e4632e52f8f49e2552ce9a7ea4a4297fab7800932723c684e74e3d0a58415a0034d49086d9c513a8183b1a4cc96e4f8c8edc0178bf992ab4d98193c028e22c4e1936467ac9f49a961cd2ca0fbd442eb7f3297fd903091204eafd02dd0189777ef032a470a4d4cae35ccf286449e2269e6e3a2a6822b80b2b760f51d6d9b6b985192153bf5eb364fe05a9a0229b95a217d5cc9b03dbc7a5d6f33d88279a8416fa40dce180ee0d6d1ad1468f0ad976608a63229c29a012e9787db09ae237ef26f0deb58f76055ce471e8fc7b29d13016ba43405f187b6b95a9d7ec1344bafe5d5a979d67fbcbe66ede15838cdc357ada7b52bcbc81ac4e3a8022b15f31e89e56c8297719c21c6dfe8ae5d99df3fa028ce9f084ab608d9d1e4b05f34542962d91a3f0dd33cfd8422046318cc7fb33c8df7695b4003d3bee266641df3a6d52930d26da9568d20028b24bbb8d5edbdc1ac82940e8e23732a0b4c4e19727ae1c1100af7d64ea2fc9753d64cb3b79c05dbab7e16a28bb71cdb723e4e02b69a5edc2d911827ec8268fb7cbf85f3e2f856713ad0ff75b3bc08228278acdd3ac2db8ae5497ba037769b31d873653c106a5bd1e13c6ac6340067fd4ec9d5bba56a80d412709ca6dd10b8a68b1fa1d659644864554a25ccab223065f365cf4ffd5f1e3d4197bed255cd31d420e1190b1f9e6514f788203eb3d85dd3e3d4d3c66ca1905c430e5944d776a901cc9b7a7503dfa600a236a8aa27e8fafec8a692319813cb9e199fa41c4e05c74e530d31717e07e1fd266b8012b3a879967f1a36ac44066a3d10d92472454e7f1066365e67af40de82dd0c8b95a88d1e895727fee40750284a45eecd75c2f2041feecd91c7779447e597e82dd3aafffe381dceab4cf8f7c7c9a335ace0acd7e097dedf4acfd6d8b88036ecbb5e40e115a372e80e41bad91844533283adcb753c3a3c9b8c8489f490b2a9765f11106c389429614c8d53c0b1c98ae15f11d8403ed2d18b06fd75ab428c2144938f8931fdf2f63dec575f21191d712022587c579f368f22a3f25eb9bca5cddb05ac278b044c55e88030f97f9f56b13eeca4f2f39171873ff160a8c606cca38c725bd3662287ed5476877f6b5d6f12026237ecf4abd14313c71daac421a8edfeb9d337c42b1efcb31df1261ad315ae09346828404c70a2dd9db84545dd0ad0dbbae878843e1ee54f0530b5913d381fec414a1744ab7991170164d46b1c53dfbe24f2cdb320e11840b78cff8c6aeb7ea1640ccc3c219657f03c087737623936fd93e13c0a214b1d305cb53776aa077d3c2048d012b63d2020000000000000000000000000c5648d82911c8ae219fb4acb7e30485a08cb5e50df5be03cdf44a66e1056bb9c5e2f6ed9169946968af04bba986c96b56f5ad2c940c94ce7bb2fcdba2b85a3f504a0d7c5748845f8fe6a9776705535158d5d943df85b5bc5ce3333f195fcb5500000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000a3c85bd243ec8be7f15cadb45a4235ff796bbba582e661518f52f1f61c4123c5925527dcd533da6ff570d5461ec0152327078bb442d100f2a852758cbcb32f15f1c799e14acf2c4754559759fc822f2eecc2d1fcae90c3301d9c9fcbe1ce014417dd63ed96b991b9dfbf21d194111f7bf2ab7802fdcdc70bc7905fae4a95522403af2bddea886a0179736954b19e068f9d9e0198dd79e79dc097d75f53cd84bf1ff2cf988e136cd8765f40730ffb65e7d68df45270e02c1a73365aeab8564520910ce0c51aba4d514c53ea3efa3a5a91b97489917552df24a2df8fde37bdf418b50b3ea6eeacea8e5c5c8d58f27d6059edc763bdaab0701898c257c5c6358e0f9861fae1b7b173502c9a51f4c3d2f825c1e2ec196227d7e8d095d1ae3957a3dd5b29a0c36b8f41e8c614ea6ce6d8d14a33e4546fae65b66293af418c3c359368a4ff89bc8b4419eec58c54cf62032c8f66fd543e31c8be49c502b15f307cf18cb0e6e62701597e43bb8288f9102f9f9c88c0e6cbade0dedf0e39ceb7e9651e3c3354883792f7298c2c8f9f972d99c4f42feb1090d6d5dfb418980b6e19a00df8ac1a881493ad6d8b8367fe68e14c6a4c8be582668ac4d1d2d5259059d6d786751c16c9f63ae2360ece46e89b976d68c7ebbcf0524a8fbad661863eecd659f3769767c89afbc3e34d5c15b4c325a0332c2601d8a1449b9d737976e6c3913a667fd9f88af3bd9cdfa410c8a72883ff36e2df4a1b1b49ef3e4858853da329bc3e7743dd93f5a46d2687a0ff445bca9fc410930b8120729e1c68a21372596e44e38683a0ef821527a887935a48bb5c746f3721fc9a200098456af70f8a5842de9ccb2695215530304e46e3d276e06ca111036bc603864e2fb15afc0fb565105520e2f3a9730d95cc526bd8d5523e53261681cb466a82c9e5de996a318aaf92b2bcae97bf6fb01ab23f0cbab473fa3cfc6c85266547b71ddd23aaf1f93f89de08c4c8946bfbc310974d276be868aadfb9e0f1e1b169a8b739918e0a1b083fdc1a16bbe13c00933574e0bd62fc9c13263dff7b29ce681220a0dcae3a9db5fbde38aef67bef45398d63fbd2599ee030860eaed46ec874e133a41989b4c129cfd44208d03d5cc2ee58beac23bdcc233fda203555f7789718194c23803ff52ded29d720419677b6beb795c8193d57ab34bf48ea9b2cbb5e4f2815a429191845f0f6d499dc50417d450a67b48dde1cd95ff9e8e2095ef6126e5c9efc04ce996a60f0b9ec32c36889e8de16509d3b39dac629aa9ac0bd6401959795f8eb96180c515f1a114c7b4146769a333fcdf40e698875e1f22f04dc3de90f62bcb40ae02c341f91088fad21ce0f42c48dc472b5af1ef9add5fb621c839d95bf7a3ada35d7fef7acf2658a5f4bc0973d7c44ba19a95c8b5444c92f8bbc9fee7f85774185aa30a33c4c29566ad857764b125bf4b82def4dcc8844c44007e2100d77015b87400f117a02e0bd9e118810621c7a2c9edd500b90d2471cf587ed0d4d1f8b99251ac12d3e180653f01b8a3837050816f5073aac744584e02f14da20aab7ba9b72b967bda64be8c06ca39ce6f613d1d30e5ce52cae008f4088a6928e56dbac1a8fce5c80cb4bd7ed00bac71b4b12eb2f6c967043add42a49c05a7e351c01fd11e65b5fb828c1a05e83560b82e1121ef182f2b68881cb7532a20bb9570dc1fea6f4f83d228dd52acc5f0d9224230c4b9ad91aa10661443edd8fa7078f5a2f5afb207a9e293a06823b2a0199f173cbd6ef83d9f2daf05e6c82285f1c4b6d97e66d5f558e807dd2ff3f68604eb373f1240dfdebcac89b7ac1ab9e61c78601ffdf336e18694cb7bd19e19ef5a1a1bb50ce6a94e05ece4ed6df691d99a9132e361acca523a8a520c52442a92edfb4259b00263f7bda50b0f84bc38bc80c5f1b6aa6c5a0974f843ddee6e8a69db2b5ac8b167755b0b281baec8cd22002f12cad5d3621fd11bcc5a9746c8880de82d6c0906de13e218263ff4e81874bb74e2e2193c7ced5559b538f440a59f7e65d994782c7875d60ee7d12534f344656f77780c8a21317fe547c47559308ba14a00444b32105900c95dc737cd0160aba33860cc529faba86c744f2f4b9a78649b95d4662798cf43fcfb7a5377d3b6809767250e8498f78dfa263a67279cd137b47e1319ed2d89dad1e43c079eac02220db004c1ed78c1bcab5576c4ed6dc9427ba1cab32f433c3f69157d0dc06fbc5c6b096ce26503e1137fe0b635435a7e0019ed511e0e469c49390a0a795cb4d0300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "6aac5152535253", 0, 44520681, 3925833126, "488300d029529bb515bafe9e483b4ee611519430da4d80e9fae5ec9254c9a4e8"],
+	["030000807082c40304fde9b3a8f7f2b8a256abd6cf3128192bed2ee8aa8d813d01b172c8e870bb9c4c0100000006005252515163ffffffffcf213263bbf594d87129fa92258a386a9f1b93ffc514ec837339266511753747010000000253ace593b457da581ee48aaba2190242fcde242238e7e8d05a06f88182cf84b374fd4de684f70100000004536a5353ffffffff29fc0498516ec76b26e94195af3ae91d1a8c5a5505d5fd1dafc993f1d44f60cf030000000300acac8a2c619e01f1ff54020000000000000000008201dd0800", "63636aac52655252", 0, -1222110063, 3925833126, "b2ef7e9eb1b01710e7965fb455a94cbd30fcb5136c65449fbfe999d365e91b37"],
+	["85c2170f017c81fddeee4f97ea22dcf7f40c45a1be959f58d7fd1d013faf15688f179071c4000000000163ffffffff03f2b23903000000000865655153526552007549d60100000000046a5165ac45207d050000000004ac5300510000000000", "6a51", 0, -1787312461, 4122551051, "cda56e0b11dc7036f4493cbb2e2498a92e954b341c3ce0529c99ebee0c99cdc0"],
+	["030000807082c4030346585c2db5759c8015adbd87bcfe5617952f15dd9504fbdd63ab9d2431125bd601000000016affffffff7f92ea44972d973218622149c7c466cb16a4f7d3967008204b9683f20f909974010000000665635265ac52ffffffff8266daa45ecac561dc19eb424430a5bc9f52f0955cdc697ac6e1fbc2470582b4020000000652ac63005263ffffffff02ec211e0500000000055100650053aab2240300000000086a525100515265520000000094131c1100", "ac63630051", 0, 1744295583, 1953719636, "07b991d7c012cfbea32bff824a8a2be46a371a05851b111552d355fbd93a6be9"],
+	["418e415301724d6312537ff23d47d7f801c93e97c1500ae01be3a6553d8323978efc64248500000000075365635100ac51ffffffff04df872f000000000001632ac9c204000000000200531162fd01000000000753ac6552515163989e9b040000000009516a656353ac63655103587a8f00", "526a6a536363", 0, 1444141877, 0, "126d913deda3a05e3a94850fc35992356570ac79f63983c07ef28b474199dae5"],
+	["0400008085202f890229768e5ca92332004c7c1453af958815318d03bfa14229f5981be2e1817e82e900000000095352636a6352636552ffffffffb0f2f92405260f983ed35af6a2657afa8a5f9aa892b04804c228067dbd8ae48901000000016abce8e81002ad3cf00500000000056300acac5134c29e030000000005000053525100000000a9b7a118914df9020000000004c3d201f5cf5f3e9f4a3ab354dc45bb4b17eb7eb79a156bcd3efa564be70ab2d10f6595d9fd2cd6cba813ac0a58d4745441c19bbebc1de9859ff28b59ffbba649bda69bb6515016341bec935bb338a47a6f3f7f00643e28b2e651cc412688e60b1e2d4bdc77c20e64301f2da465ef94adf1840c7fcaa5d3cdf23d6da5c188b300c106640951549b351318455b233e3dff3ac07c08fe1e6e48300cee2ec85867018c5ecbad5f379e494e8a6cfed56f2fb85e6ab1056392a970b9ab3e9565beff67e3cd1ffa765118ce238b898b2a5946f4d5081ceb04e5e62a15b7d83005051e94290325053a4994abe25c74cf69e80380b50e23e9fc960a712044c1be1782435fc913504229ad888822fc8c7b4c2298fe05f953206882ae5d322fba549893c18fff03a4d997272dda4143d7e6bd763795864f280087d51ce02003a98bfc629ed2019ed511e0e469c49390a0a795cb4d030000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000c05a9c5944abc0f78ac8a1958b8465dab82bcc1aae7301cc44b1e129d2b89d115edd585c5e7b56d28dab759d0f71ce1200fc05cfb5e3a489ea9e69fb1f8ef5e7d9afcb03b7ed2cd6f1103d5eb3f7523d643bd51f910d17bb7992ee3a6cf719a50764be1e9249b7fda25948c75c4510728e6877a141b1a79b8eafb2019c9a724b2166d8bdeb14e5cefdfce5e2eb01bd74a5713bc961b1a4af2c4373bfa7ec8cfab3d98ad9a5e90567799faef2d73d081dd667aee30dd2f6f050b9e7e43712ccc17cd546b866590157411e71eeac07e97244812f7117959bb5da18e026dc6f7c59b17e10a798b0eecc8bb64c4c0e9013995dcec7d0c8731f83a690e3b0e6491273981a4ea4d90c3c1bea5dc678dbc687fe6a38f9053bd7842bcf507da7570423e4f54f8bc841bb12a8b233b00829752972646ac8da13f369225991071d8e6cb55019ed511e0e469c49390a0a795cb4d030000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000008c621b0e1f6162e77b72d8c217a89032c626b40eec36022c5824c16f4717c72792e3599fbca54c430dbae00eeb0fa822f9892b3a433392183eeb76f7beb7f943693674e9b922f10425005bdedce36e5293b76829469a7290761aacf540057561a35227feafe957e9bc9f1de8bbedaa784241a68e30b2fded0b8e65dc38c2523bed7e2e9f299fd3cc7851829fc0b5659bedaa7da9d1f79e5b536aef3a4c67b46e162d1317f91638b2976351daf94ef517ce88114ce7c3b95a2c8bfd32f7656cb593fb9848407054484498666a9c479e7399b6e3c342c01ed6935c7da0b307cc2c9547dac8c6a1800fd037b83bed4528042332c8bdceb091db415da0b892cdb21b173c925d22daec71e1508605dba9a6c19aa993aa359f652cab97ba7d6603a820e2641f981baf9a417b5b26bea0b60e5c55d9e638d1575295ec4ffc81a1e2f4e3019ed511e0e469c49390a0a795cb4d03000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000e4ac4a7e523bd213aff2ce5e6bfb49a8c70e4130a3e4b4a60a43b9e9348c799d7b1581cdae6e0ac3e95209140b5453b1dad93a8ebdf1f7218bf77b50d1384402d09f7e75620eff814dbb295cad1f921d50d8c3d35ca4c462d66023fc5d95a461327df221f9cbf601ccb89519b92bca642d6cbfc74393130abebb6f25878b7713b95d2480784b7b2faac70b2821c714952c7908a629c63ac2bb3d261e91b215bb246b5e3b5ecdcc7f7172edc1539aafd7c8fe0fd2a91b5242e2609821fbd1665d543ada607549e103fbba1477ff88b1b4be89834e379f624ebed3f50c1d78324d3017b0912834688293e5b52ed1c5035b6d439ee02d4a2d3496a70ad2144fd5d0da60f430490816e7e2db10218d73fa0111f494c3d5559c206ad0b7b46c0d8554e294ec09237be97c6bf8bacc2785d0e048c9a5116beff3b335655589e934d122019ed511e0e469c49390a0a795cb4d030000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000256ec55466089e3d1dc0910aa6b3812e5482a37cccd8ba9d2f4e0142704a162c2cbf9206a70f97f83aec14b0283b696b02a210ad7c9b36dc2d3abcc1b4fa2175b7b2e37e45148a6e41bf660962bf369406152284cea2a444bc0e3e5fe1bcf1f6f2b5bb3a4f693cb8754e75b110da16ea8aedfc19711725e76d7e73aaab79d6de3c09a8cce7bf0c8267e94abbd647bcdc2732f386a5a791b82c5fd37ba09f691cb6845318a6ef6c4f5c21dfe24befe9ce67ef3c6507214f6e8e8b29817294ce8d3a7acd5c724511c490028f1c5f437057fc8b70a878797ce582a09b128231efce026148331e46e784405a2b0adb71693d6c55c85ccdbb93f8cdf1f314310cd75cc24ff3676d12bce7ba1c37c9b56dc2a8d08fbac20e68e22100eae3ded3e6250e48aaaf55ff5a08bbb9a65a2101db729a249eeb4c04ebcd171b8e9da37b261b2b41ce53d516854603b3ab1f7f78a9cd792031d49fd7e216a24129fbd5d9bd846e665acb7a3fe747b8add87910f2a90a3c04af1ee3359799bf48f6ab359ebb2ce02f6e9deab4dd79cc011eae194b3c63a9652abb4382763ddfd430d13ce13a7bd232f17fec068a60f7ec2313c0e5d009354117e2e3ac920fa893cd2b0dc28b7408f6fa1b597139b5a9ae635cc39f0bd111c05818b8a661c5eda2ae49c4da25f099abc35a2c965154e70e337639b2a40909bd536e818a2938edf42c46ec82bca9eaa292a1ca2bc0dce087e07506b6398f6060dcb529ce89620e320ec95214b574d588365b9c6e4b07bd68e1c97a06eba6be2aab0a9e43b77572a87c45687bdb6fbf03d3e6911c098708489746cb245aaa82ea6190deb6fa3b643fd8908f270ccb890c6630717183988231ff95d0b0baea9fa283ad061a8ada2916b9f437b02b14d330383db2f4967584b5770795eede69c5c30774118afca171c8372fa97e62e0ce971d47b4607e0d8e23da8c59df73a2167bc810ea02c013d77e02b33ae9f75e4fe1eb9567a7c6862ac2f2a68404d5a14ff442a43bd910fb6005d3edcd61078a32758f063d831aacb86eee6fb9653212aeaa5f5e095656156f5b2b74632b8080e7b5a7ec8377746547f165c0520d93c1ed8ed065540514cccf9d84108a75b6bf9e9737c6b68bb3f78631ee7d5e239426bf04f4a44071939ed8d10e424a6a6f64a356c1ccd8cd731aaceaf1aaeacbde529a4fb2ec8bd18ffbff7402a5739d1becd4439681cda6d845abb811ad96f4f4fe97c6dd63c39325ce150a04e1b83fbfc8b25de395e2cc617f9f62dcae6995d8b617087ff0cc88c2941fff5d98e9689460f627b0d230c4f74757e12c774754d934c3ee6984da412b88c9be1176fc6aaca3aed42ac44101bb1e72ceefe1363b5f66734eb2c816d0dbf222c1d82b493c20d20272b516c157e4b9536ba4abb30a17d859c288ba9532971d9c685a2301edeb65d75a752cb9167b59ac9e21a6efdeab605892ef132e0d9c67739e4043b5332c3e042501ac46152970a9e2ff34722437912b6b43666f1342332fe60ffd01f664bfd25710419e928144378757b818fd9ee2f5d61d1aaf9afd1bf3f11e9a10df361c0ebabf31b69d70c1f820460318596aba5aca1aa6f5a644d4ec97b2d0415b235c01f79dd59041fb73bcf58cf16d3e5a0f91ce3b3ddf63e2efa329f01e24afa3b289da48563bf57ec8e12d1606d873b89be63d9876d51cd3f6cf8e0fe7033ec576850a6343b2eb1c7efd9e8835565cf0315ba8569c5b10a97b26d4b0d223b009832b559dc7ad83bc2575f66a273b59962ea37be8c5c6cc3ea9cd19af33938f7bf6f60517e42eee410a41fd7087cfd51e7aa356e15a30fa577312132efc4fa7bbd6024fe9d26e4adef905366f9d029ac5e00930a6409ab6634d607437172841c79de96f7d68d54dd6aaaa0f855a125bd30959347163c007749c98b8638c44df1d2537c2215fcd9b2dc383b8d1e31e0c0161f28c7ba0c0f1d94fad8071488186a7681735fa6367c4fe872626f7168d30bfcbe35989e8399fefb0975c263cff975185d2a2030e49475824170769104b71e2830c2c903257e0d01cdfde2bf8e8a02dad92790e14279eb5a02419962af46186b76b100a402a27b2d424561be7ae9608aa16be134648102f5335450f1093fe977356b588927051d528b8ac1a3139e334ebd027877612fb655af4ef317226651dffd214ceb22a5ff2e23dd9d335cf8eff094c9c1dd8cf6bde36a4576483e834ef60b392bae56b120fedaab29df6caec1937f27be807cdeb33117123831790e5f3b6eccb44d87a8a9f9393cd516048aa478652272cf8e7fa2c35dc7906fa7dcf88e3b1c7fd13a7fb20fba3677f284883c29af3fa4c2cd325bd485b8c458ab2f38e92dcfb5fa4813b875ab9c08b334cc38b58769625b9c09dcecf95e8de621232ee1ee7869b88fe3a6dad99981fc15566f8ee1b2a179dce2ba2dc94e594a578d0453bde4d50c4695c19a58f6443f5ba3d2a01c6faa18a0814b4f501c463fa00ba3c4052a4be27f6671e53943fa96c01863e044dd9c09aa5e5a927e39341f049697f5c449f573c6e514bce948a1a3831096ba66d1d013d12b37a928b7ac872598c99882578de7618d1cfeacce884fc2a17b47e5bdd1df9926d30c15b3f9068b522b75056e1494cb0a60246a2e341950f4e9b5f4e56170cbe19c5cfcda023f361401000000000000000000000000daa1c71ebb57b1d998c5a4d5619e063a7935d0b811f0b9839d86adb3a6285584a84a6b7ea0de780ac9b098c6e1bb6c6271a40dd2b1da530e1999df5a13c321824c35d8278c8df5281b6329f5a6d630e68db2d59f0875de478e4a344872fe098000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000bdf11c6d951c6676335b8e1e4925ae39da89a67b6f96e604ce0ee7bc507d05bbd40caa0268e552c72b1b947f85f8d0eddcb5414dadbef104e35b3cf5a0dfbb9e696c5bbe3f6bce5ccc5596f24e78f355db65d3cb7df5cd8ba0ebbdad0214a26b7c0822ccd332480f0692ab90243c96efd34249453a09eae305625fbddc4c2c48078ece73b0efca11e81327af726a0a49e7120e2b89b61937a08a9494813af637dc28512dcdd696502d60f10915b9d077d06f0e502b8ab118d4ae07f137949aa8f3f012e4ec5c30137b1ef67fe9f26efcb3d37e978ec61d40c630792ca372bf139eb8c2bf381d4304b90c115751556e98e73283134592cfa033be56575b17acdd858788b0c6087944c0ec5d5475c6de5d62958acbd9953e331073109b4ef91b1d7aa0ba3740c3ec19d6f3c69852cc4a9c5ed99ac6af8da8a349a3e022e9a9181fb97cda02de1c4d37f026139072e29c11bacb3fb7b0bebb733967f2c3931ce51bbda36dfc0577415e9d52d5aab400e7764cfca490a848c7aef521888fc6b33e624fced58970ba9fbc956364c022eaa6a79995720e2fd669287fa2d7dd5f08079a20be14763840bc211c768eb6fd106118519f826632cdbdb4c6194abfc42119b6fcfd1103266d3ac98f0e6936d5d2eca6a9280790135aac136e21e31e6f3963e7f8cf586f133dd5c58e6e0576bdf190e39f725508a7d4b4bdce682afa5553e6dac4f57e4a4272230469a62c31d591eeec073ecab6d340326b703e95bcbd45a34e261d7cd4ee7fec01f8372ae90a4a26fbb9773dd7b0353ca8b25b503b062b48b32e0a5ea3c8fc735a9961af5b0ac6d22ce419c7933e9a81f4b85f66beeb3caa1ec5c86d18261dd528cd8e27b7ea8208a7b6dae904241560562fbb43e3323d53af1fd57f785a30babc741316128b74b2ec5cb55e241daa882b40e82f2732e1ec2b4e8dd94944639cfe62629be8f9cae673c501b21c3a37eb87d023192616d1f0d69b52f443982aa4a5b9a85e8722d74b5cc3f29c6fe0d1d5c62ea169c4f715a2cff03ececf61c26aeb09596fc4aca23ba30acee9df503f2b4a981daab983663f9d8cd008ce42359bd550a5f50bc8f69b26cfae742956a17d1539bf375e3af13056e647646bd770295c4f56964b80fb8b5fbd6fd9b1c5837a32a2a8865ba7ceba1a44728211af2d572e0cd04d8f730c645fa7ce3898fc0026e358aa9251657d5e9656c3c39ae815aa3745f5e0b84edf7f144633abd6be6e027a53543d279b1666822a73f7310ff02148f09206723ad80c68f080024b308cdc7bc324efe6f6f75dfdf835e4dace3c917bb15f7cbc402ebd09486f3ef666283e295f7998e4697430c0b79b08560df76e18d153c2875e19fa16f843f8164691b7ebe098cb6788d76a4baca564441bdba57499076e66771bb61930075f2c9e216da8bc3cda2c06239d9774d4d28a1320bdbf53afd3e886c1911852a94b76e4c86736e7c1e3b2271693a82b5eeb9014dfe1d3ef3120d54edd2491476e05c57b8d0142183279d843c6d612c7733bb7da85226a3e37a4c1a0d263e29a26c22f1f511d8c4dfdebaa1640629b41455cdfbf0cfe2700389c704ab1b06e7ab508085436c4dd19e8a826c37188cf46868f6960df3e06d3574dece6503e402b6b0c08875b494da74e141c8edfec594791aec08b100a3b32b7c488df243322b46e3b0184f54913ec46056d9d58318a65004e440e2080045d5c22ee5862761c306570e2774695dedbb3fb331b9b294092c64a65fa3bab28275ff5ee051e74c5af538d83647650cb611ead599bc8eb3470e2e10dc41f9296dbdcb47a1a70f1fe0386148cdb072bf3510633627fcb182ba75a333069880de7e01e4a0f323e574293fd26407f56b8942efc64b9559928f3b703a8b2b07e2bebc09c8ba834539b1ac707d6465b6c0d64d7435f10a459b57daa58aebedf5e06d5ce6a97f7000155ced9c16c964a35a1ff6e180a3fd41050116eea4e82cafd791dcbb2318fb1256626f4aa034c0988f20fa6ef2f561294cfc893068c4a49e5e928e08d1500dcdbdcb12efdde769bdc9f42996585259af7b0d265ac0eaa4f226c201343e0f37435ae3a11e0b2bd4e3b0f614e7d3b62d8d6ad11dca9beb5266b0db78310e74eb237de08011d0000000000000000a1d6760000000000ac56bde8a66e1210ca1f993bac80d0a55a49785985423c694a962355314b16b19eb08f6a382414e87c822b0dca63ba1c2fa8ac0776dc525ba6b42386bd9f8d797f27ef5690b71d0fa678c2f45ecb8253fcb2da71dd26dc4cd22642dc6b8ca00700000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000fb4bb996963c4ad37a590335afe593456d972b6efe244de297564d382c7481bccec587a6358e2e31e961304fbf0d30fe37e030435f29c719ed7cda0fac954eccf3a33816fc26bfa8d1117ed25bc80ee1c62806f2a377f7f861333122dcd0d6a5bfc4faf542b0c2fa9eb248d94daaca89b7030bc5a3b26a8fc2d7acc1033c46b29402475db88bf0741d7a116aa171e7af53e5ac3f3fe02c622e7574b2539dabcc919c187c54202f987372918d2c214719b879f9f81aaafc457d0838141fc30aca7d3c4a26d98ec20a6a7328ec6f693606a9fdb54e5cafbde523f5509b0991f5bf846d24c46f1b36f3285135fb68669df18dba234ec15152bb7e5da534d249325db088769af6652339e25cb4cb20bd87a3c6cd2f3381391638b9356a09ff6316e5fc2dc04fe865f8570786f323e87fa10e8be44a3b28850739a7c59c732c591d1209bef5f1580dc4fb4cb267bbd5eeaf1aee51d88811b2ae46cf7e94001d7014eebac1543d2302798fd642e8f1191db033afcb55676ad09b37f30693014bbca7d7a7d434b1ce9c4d88f007d3d894a37f67e4c544501d64060b66ebe9d3b7243bbc49e9b10a652ae6d65a85f804989e8624b03c7263ddf5074d252e1b8610f004d0b83488d9c3654d5846789e9566f50144dc2d21d867cdedb966bd0a95a126a4a3ca5d6169294ba462d3347296b4a3e8902711857c9ed56e01d387eafdbbf4d8bcce7bec054a7573579d496310386e5761e2a2841a952f49d8c61990bfdbadc4769e8d25b7aa36e166e879d371eb0e396036e455a29254aff12478281776a3cac6fe03397305d9a8fb5f4e3c54094d5072c0294cb4321381e4fa32af0754bceca31a21dc0e56ffe644c5ca4976ef5282caa4f7ae212d73cf311aca24ff4894db95ca91e2a55f10f710e2f68c1974dc8684d9c4a3a91540bc26750825f0f27548331faea6b946546d805bf03670e0b50104ab08cc79f61b6f5353c4bb4779be1d9231fa04b31e58d934e6faafd19be44ff3188242a4669c6fb2a64cd9513307672a5840e3dd867caba2728fe6187fea564d4f4a9f868b497fcb0221eedb3b36f54c122ac52d65ffc6acdf70ba1e527e51a2e298660b4cb2a1b92fe0c37202877608f7640f370c442eabf8799fde84812cc964e4ac6f824aef17629ca064cebcc148c6dc1eb8782e20b7a62fdf19ce3b4021642291eac88045019e38fceaeb7010998aae66aaebd76a993835629edfe6a5d099b45c9b1471ddba6e1f6d22365b9d634d9dd84f01e6f261de38401953b624a3ec0d13d197b1cfb31dae69489f8b268efffbfcf2e5dbd9f3a2addeebd31e52e912c0b086e8dde2d86231f8a3b18769d8b2dbfcc0a40290a2810b15bcc4b2d980f6804b92ae83a4be0ddee13368af941ce6130876038395eab88b659f2e51c66065da44005d19acfee2dc36df4a413c1163ca40506a5fc29ef4f0d0afb633b425a1505c1151a76482a749c4f7fc92595371c6d3c68e7deffcca8224a573d2198e20715a9e1f5ff4475c6da4da3d4c43ff5bc507c7bd7e8e749be547a830724a4ea50e04f4aefa7807df76edb6bd6d065679f875c226c2b993b6a0d7536067f4fabcbe58dee8d69cce5f02f0265d2c0a95ba6b2c2527dae7a2b58bbb4132c4a970b6da93963e7917103ffa11e51e6196b009760fb12266357497a2407adae268b2ff77122a262d2e88efa706342839eb6a807cf4fe7aca2cf7b9b2860b22d3932057a8969b7d541ca0312f7d87bc792425820ba3e58ec0dd6944d0a99f0de95fd4a6e39a2f8423ca76fd61b40f13878245b3554e48c5b1a10b3040a90ab4af4722db339c0406abf18369a12bf1ce7e216c942a705e65546c3b871979b007d8d13f3f52fdf5f6e9eacf6f55db4335b988fa2ce2589187d5e3ec8192f9df16e80838727b317c0f3aafa2162896cd31c9fafa9d7e956616c9f4f596879c58a1170aea8a324fae19edb11bb8ad934bdd403bf413b278423da732ea40aaec78ef61f774fc8144e0099dd9af7e7e2cd834928eb523c2bb2bdb7624fefeabeb7b74574354b705bacb398592ad689d594da39f67592ed6d295d3e493eecd39fe8232d207def0edbfd6547dc4d1d86eed8a23d415b1628e0130c7b6cc1f7c744331708c5e253ec25a8fca3a9f551fb0c1e29536d174f4ec6ff7af1d52b20bd0f87cf100d1a9b2c094e9da2160d9ee6adcef603ea2d140be5bafd853d4ef44bc752fa35d77991fc8f84c6fb4a88a6d2855f175b272a8904f5cc039a0531f6f1b407c87a6ab5fed0f00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "63526a65", 1, 1898259414, 733220448, "1ad72932046c8170684047c1f0362396f4272e75fe5ac9aedde3ca3699146b8d"],
+	["d276b16804fa405052587dd0a7300898cbfa544269b7c0bc777dd74f3b330f46ce4ca7095f020000000652ac52635365b0a003f2e60f725f7c485f0d9fddb5de0801040c4ce7a586de612652ae3308fab94f439101000000065251515153007c6934878dcc248901de16f309b6a11485c4717a3d1901737b856932c8b15df633086f2d0000000000ffffffffa25325f097c8dc4767c06f60060027dfb1053909601e77c29dd3c597a479e6b60300000007656300635152acffffffff02043abe040000000000e5a29903000000000765ac6a516353527127100900", "ac5252656351", 3, -1787309988, 0, "23daaea43d99d6ac1388d1fbfcc5b68b7f858b1e00ae3abdbf03103f993ab630"],
+	["030000807082c40302486a5152794e731e5323c3b2015ee7756999b4f5ca02eab67875079bf4cc3f61020000000500650063008a068fde0941b917f60b1694a956aa00e574a4c53ecce2d36fd0c7e6018888b31076cacb0000000000ffffffff03d981fc0200000000002021bf02000000000200009711e70300000000055265ac6353000000000000000000", "0063515151", 0, 529989351, 4122551051, "cef0725dab27dbe70cae21655933a99ac0fe2e0bc7cf59c3afafd62e632f43ae"],
+	["1970361203876e7b5791374e4b8ae55022a1759264820e21fd2c955c296a698dab25e24c15020000000353ac65ffffffff88d5faec108824ba682b942ac040e05d16c44d5d8ef85e86431c3161bc2e72ea000000000152fffffffff0cfcfdbf599a2454492965c8e55bf817cb212aae99fe59aa1918f41cf788c3003000000036500632e623b0f04f3f200000000000008ac53536563655200e2185a04000000000058cbd901000000000551006a0051ede76a04000000000252aca1b899d500", "6a6a", 0, 460026932, 0, "cd957de9c66c519c68eb2e5212f0e0510a3d0de6f2bddcfff8214d9e461e4cb9"],
+	["0400008085202f8903b6f884bba505f791758df025cae3e4c577d74adad618fab3d7d9cf72932e760b010000000600536363ac00b2d6358bc8b3fab55540d9e5947e34adac33d609a87bdaab7517ba25842592cd18bde3e300000000036a536566d69144c44b06512185218b1d2e34945aeebd40072d6c2be4298bd62baf1006a81874af01000000025351ffffffff04a8e69e01000000000353636ae6a3f70000000000065163005151527d3a2705000000000651526a6a52accef2480500000000046a536a6ae2feda7a0860720c988ae8010000000001f6819dd12f094ff875f0aab67a7bf810aec89b860438331c6c0f8bfc5d96864f218713c0f782442072361d3ee52fc76752640c2e9fa8ad6a7b380065159ed92382398a062244f71f0cbd357d670f334f10cefd869f8eebd75ee2bafc5169dcafd872ab0daad2c5d2242dffaa97a78ef009ca3ba77a753aeaf54242c37e78f5aa649cefc4e71f902cfe4900ac6a1dae0aceefd136c6ab78291153fe17c8cd50e6e96b530fe0991336f138c3964e604d364b3fad0b0d143dc7593537a8b4671402cfa6888310b49e97703c2174cf0cc16a15abf0a55c866bdfe57456ab67755d2eaa5a559b137b9bd503f46ef0ac0ecbe4628bc2358bb69dc69740d22c71e0dc21f587a1c90b379b8c91d0f2bc0963b59856877ebf62e1ed8ab99cc627cf6f446d7185ecb024bcae203007fc4415ceec6a16d125fd588fe35577ca3589d3f05ab05cc039a0531f6f1b407c87a6ab5fed0f000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000027ed7fd8d698b0bb1b463b36a90786b1c78878f28553dec1a839d33453876ce3259bafd1b6937221a35a7dd99dbbef6eebb9fc1eaa76a9d7a420151577a586e0fabfc36ae5de6dd518f1d3072636fb1b3cf68b801266aa00e3f10c42b618bd20e65827c8f3cda963eb8fa22f9fa55524e17591b04a733e4e2f53acaa12d8b74d040a19a2ed9318bfbb2dca0c63edce5b3aae0a9a383f2c8369667b589410697a56c7d7aa31c80dc751be28f903963748b44b7418355510fb260b84552f54d3d3f4a88426bc21ffef821b67e7f3dc5961b1a59624dced06d59a85010ae06684bb90bac7c017f7d10c02195d3329bda69f64f2a61ea0e52a81d1d081672bd7f79923c6c86f1b6fc54a0acddb7d198a92490a45aa3b3ba73a974839f7c96e7b282260fe7ce6f9a915f3cf3d6a8c376774a6cbaad3fc7abcecc736328635fab5b2e25a4dedddf0818002c6c23c7cd8f498e6bcdd909f23f74271f54f584a0f13cc4bfa74f5c1e1dd1ba4d21ba660f637d7d6b7d4c63d08ed7b279ee70f1afaddae2a2e66ff75018fba6b14e2c1cec8d0c97952eb5aeaf9ccad2f109d6d3c4d1eb460c2825cfb13a88a0d673fb180868a247f6975ad55878625768f6efc0b75f47839fa7aab3fd3d48cae9aed1201d81a907d76743b8f7e3c41d892642184decc2f3cb3a7a2ab1fb9474de3ae896120b23ab42083a445ab95e321dd586742aa890710f0552fd61b0c0fc2cb3a7938ef7976154fcd390a6ce8b2800fdecccb2965f57fff6532f75daa516ce7dcf856221da3ffdcef2357d0c7911051545032e0a915e30c8a716b789effe1df34934d5c3d89ab8bd383ec44695e3530d5411ffd1fcef428bb8cf3ba84bcb7e7e7d08aa3ea544cd7014dc2688db396786ce0163812fad8855c59ffad42b002a1a2962ab099adfcb8df1a642372c6f76df4a0dcf306d4d5bf6f665f934820c459460961b7ca0d516d2a558ba3be1e447c2e7a80e6eff0b5a2b9902d1a2426fa356221b72920673d12cfd9e879853a67991877009cd26b7eb9d9c4114376fa11e3fef5c776a50401d548696aca8b08df3a9d7cea37fc3a0cf58613d291f1edbc210c24f137190d17971a8c5527a9153d2252b813c0065e01f4148ecbc4708e901924805dbd27ae2c568e9d7b2ec6e9a1493da4d46ba79a0c2bd52cc11b686768a564bdfafd3257c265face0cadc3e9bdf1bdea6779782f9bab50e82404433fb90555d717a2ab85372a24f0947d0a9b2d678ed0b6b297a4fa6e498256c0042928e00174555b96a76003dd60331db69eb8ca531e737249124f6c180fffd418ac4a76d0c1178b608006c82b1b319d9875b074c0a41152f8d632dec2344150b02a0d02e2a5e9183dfbf5ab593f9229bd100a5eae2898ac4d9c8301427f351f0d927be363c7982bf0f376e2e24bf03186bdcda35882b60d013baacad25265eca0625f7a36bc2aa30c17b7646e3815b1ee18d850540c85744a3903797b37b2afe07ac557f39d736cc7919cd69777981f226b621f2fedd57dd6f3954e78dbc32d87b0d6e27a6e3e48604fa9dc8e0433a3c2edf2e91635c3ed3c41ebd11c8792cfd1cfd4e04ab5d6aab20a81864d76846a3a57b90a5ba8e9a30b21b43768885ad11587006c6bd27ee03f40c289f74550130354f1b7d79aeaa940779f1d7ae9da607703db252ae94bb90c23ce2968618606be2d0f9db98e6eaad32e71f6b05a1b35d5cab003329b545d2cb32a8b12db35e94e667c28ad080bad68cbfcf99bbd60173e538648233c0d517aff141d5196b1f97611ce694671e29f8b1444841b75fdd5cf920a994605ab87c812c3e88874a4bb16b0102bfc7f01d1c82d6e97260c32da7bfafce39acafb91ab4f62b58c1a0dbdf10d186da081003a780498779bd49c4e1f3e68a1c745d6acb6c00214bdd27b579a6f098174c97dd9c2ad268c8c3bdf45c302df7be77ca3ec33fdc66dd5c18df87d6b543ceb2997b959233410703249b3d8e35941186f3519f3cc4179a220672276f8cccf4b0816aa3fee5096bc28f921a3e6b58b832e447c58ac5d1c2cf21121279ed91733ded6f312e4267592a91fc77a928efa2d0f037d4137d917a4ac865bb0001aab07a35ae3d26aa14d56bb74635c1f7184695e5ffd50cb909386fb38877808c55b300939108fd336e8306dd25f6d0dadfdc67e83150b0b548d408376d5c00dd893bb8402d91312fc35fe80cada3a939af8596353e7d89f548cb4cbf02007e7306a74b95643806a625a54631d57449aa7f43325978181e3a838ad39dee317e4d0ab7fa364d11f453cd610464674d1f37a57c5a4981a432e347a2672c964b7c8ee78111ef1ca8df64074b7f07c54e0acebb531cb2e942c2b8afa4c4d6c5107887d402a6dfe49ff094d25adea1f5c3b2e1d88e9ee984f6b0ad2157bfee87567753fe741d7da57a2abecab535439725681130e211ab02a37680f9e6ce80d6b02e78d814fa5b29deddbdc1ae69fd072aec4f0654613029932fb0c48fd36b137728cd10d9487f10092b2989780cbb0aede7865a0a04cb6f6b8ef2d35b4df518cda6cd7a9ae0a2722e01bc42cee8c3c4472c794e1b58c4be1e6a7a61a430292a6822395b881c20e7706bf8a0a98fb27a37cbc43d679b4aca3c36a0f021875d3efe2d2b5058298422f8b06f3df7a8de33779560ea0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "536aac6351", 2, 39456620, 4179206552, "6697ebf0b780809beeefdf5b8f4917af3fe6bd52a69955f93e004e73e00cec79"],
+	["030000807082c40301ba1876ec2905003e7a2fa9c744accbf7e148550aa02e1863270c6daa9203d8940200000003516552e4faf0580307e96201000000000265513b91f003000000000065d5ad0000000000016a00000000fd63c81100", "", 0, 270375116, 4179206552, "1b05ec757f5e2f37ad6b2204b73a2a91c08f3693ad3340bf48ac1b47c752d970"],
+	["0400008085202f8902b1bdeb32491b3a9714efbc75cd0dcdb91c020f5d0999459a140a9ca5b4cab6230100000000ffffffff34458819ed2c46512b6fd43bf05feb98464457d1bb0b2ba6a367d063b206b105000000000565ac6aac6affffffff010f4c01000000000007635153ac656a006cd2d500000000008729710200000000011465067da6d871ae2423d43b62601acfc07edd9aee78ccd5180c4de36052324f5fcc84d271a6f1883a1195f0276a825ac5effed47b38cd375ae4a77ce6d0236bcad7253d663e19e67cd6fb5549ab171d40eee07020dd40c1da5a715a1063f9ac5ebb8b6720729df7a55689e503497321d33cbde6b205202c82da2f517b94111aac21143e50197f2cb319bada838b444278c24a12c407faff01a474c74c09aab5eec7c3277a66ca0011745d13a1a32ec8debfb514de82fcaa416e7984f029b7792715d99ee075c4960009db237e6bce8c2aac5816794ef6f6c1ee6750fa71b23a38c0e49d9d24ab6ffe3b4a26a8348b84de57bbfaa22312f2c47a7eb856c57966f941f6f91c6551b780afc718a9e7e955155ce9d2ef91f28a10189b1236f4fc8fd2f913c891da487230d9002b0a6e34c4cfc13749705a66746b47b70f5192064fee10e466c8012afafe8a79daa11c150100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004b83add9d2483796c66a4e36fb632ef63fc10457dee0aa88aed8ca7553da2b408cc117680d2956b139471c5b8c7f6b66d7d95ce105210875daed5f4bf363f320f6d00d3f9f9407dcf1e83a935c7e676183df36efdd4052f673c4ca2542ee25a34d54172a8e837f640eb10baa91cf0ee57918c87e3cc854088683ea323a1d796edf10febec8cc6898cd0a5100b447f6fe49aeab17cc31daf772ea3f36b4e57f76d21e253581183fe23fe134eb8219b22351a5b80f4a7908da635093096adce63bfc939c1eb79ad95ee42cfdba9cfc3c0588efaf3f4f84b19b9b18c7bac3cb5d672cee9e34790c8cb60b25a828dbc9e8c2d5ba07d7305a82df656992f3040ff069041230f5f3c9b173bff9d0dd72ff4b6ea2f8ea28485f18e3fd99fd3c34e2904e802f47ba2ff70f9fdfb94e12dbe1525229c523c75f7e99dcfdbffbaeec20650a60906910dc4bce43b98486f85e3230a39941e9a428608856780325c46e51cfe4ae75b727df722be925a920a8b5bf4c811501bc6d9e1a799408f5a1bc85de4a8dc55959c9807786c760aee4c5896de83a93ed020834c3386190ed60257e3b31d5be103249bbe727eb3e66c27c34e07477cd277568f675224f9f21fcfcb1eb587de3e0e84d4fa66b1b436f0d8079407d89c31c505c8bd20e53eb5433a0c681de4c1f5ab5b2ba1b26b9e07d4758fa0ff216ede4ccfbcaf0f91471fe217925f48ae26e18738b76e5d845f132404af8dc8b348ba2dd7f61966f91794511a708898f629b542c6d5ef27616579589ed4d2e1051a3176ceb9bd417ae049b09515f78f5863b40dc6bc284f335bf5bc09ee6d32b1c5579ab0e6afc182bb1a069532966370a52292045554937135931bef7e389718e971d744893144dc42ef96c508cddbffcbbb0b5116d25e1caa7ec6a98ebb98e861f54052d241b2948caeed08571047780186eb9eb779799db388b5039332409377a0a6aaa28e599c085ec2377a7c4a5d1cd44c822732f0fa503f53ab0d1f12c64d6115e3bd684450b75d4482542fefc4a28aa4554b9945b58c4023be226c2b84078f668c1aa3b705823c510089f7d7eb21e346f40fa5709819a63e4fd42662d32b34e31aa46ba61e95d0fc58ff689cddf54e7af4fb163d6ae8731e8ac0e117b7c9c92e75348898986e75b2d0e0be77a3a01e32532c2799f2f79147d7beb5dce8896b4715cbf8f256822fe9c8fb589464916fa50b34a6d546dc4bb7d585b34b06190d26dd9fa3489fee86e1adf704ca8ce2766a9f64d4fe0130a285a1a2eee40f97a40af49da9a36b51b4bb1a009b10bf15bc0331af92bf355f0a61b3fc0009ab9acc766993d7c6972b3a0d11c6dd25b6ed4d435a3d2e7209b384fa9b6edb0fc0974b416866cb23b643fd11c503aec730067886fbe7a52c249f3eaf1b7722c0ebf233ca4b0b2e88434e7d4b272ad89e8e2aafc049c43766d28adb23520dbbc03c0ab606763b843a32e39f3dec2d17c12693ab8460ec8c94255a914bb401b44150bf1d515f19e4e9329502d91ce3103d6cf306eff9e0108259368075a92ac5c19332eac4c939276290b4920c83b96ec4487c63fc5175485503b15e9344aeb64e4ac280419bbc15fa4a1cb93046408e27daeebe4135fdf5ac0ec0684c6fc9b7d5978d445c18e149ec0c381133dde212ebe15481c3746f05f8d278d01920473ced6bd4f4ceaf8a74d5085378569ab10105fbd11411024f1b43d0ed7d38af6e9700d72a77483cec93f03dc7a7b89c0039d7080b3bd30d2225801dfeac771dfbb1f42fd4210aa73127bd5d899a1cfb9d248240792bb5fc0372f8aaa525bc7c16568cf09793cbcc9bc63b70f493029cdfa81b253c1b069a1a3996c0d61bfeb9ee0c28248f50b15fc50ee47e0cd4b65d538785077aea8fd39690923d00bb0252513503b5a85eb768c615512f097fec06a06b1f047a30d6ddbbaab334715963360666ec7297e194029c14e34c275d33be7422482e25f136257bceda7c669ec4decaa2e557887dabb088a542302c9dcb40db624e0bd0e733da5b4b74f032888603504df5346aedf409224cc4cccb3d72efa8bfb3d589597a16da94d670b7fdc3d1398dbc7e5df108fd0da3510f2f2657d4bdc71b01542626050db78d80bfae72142c37407a9585f0201e3a7bfd7fd29c26dbfb29649efdd11855479fe8bd1703af52289f9fd3d9a9b8b69fd9fc3bdfd5912d0f2036ce38c2856f66e2ef4e9b1f6c1b0ebe443bf72132246f7cd30ae8b978a476da49c3e827824627f141d1bac2d98919ff0860debecbe086c371e99f41a61020ed9b96d028d46ee8f4b3364de99a8b59c30ed0b93e380af4e241491a205f9f978c7eb650eebffead466bda90b0824b2d046ca9c101fb2842741d3b3d054cfaffbfa750c8df4d6c53ba41297b38da15efbd7c7d0e3de2fbaffcde7bb01bc842adadd555fa654b1aab327ec7990c7d38a42bfabdf0be59f7f5bb0893ac68d3ee684f4890d02f3c9953de9be9f4cb4e998a7b4d90ed4733de4515b657dde9bc1689f133fc17f6c75ecfe4e9e7080ccffb3c95d4b608a2a6efae0fd4805d08b29d4336a55ae68a9f9365fdf5017f931288552784e809caef64a06d537d7fbe70a6abe5e40008f71820e771654f865f10e2e97fa920b488e025e2e8a1fa6cebb3739ccc5405ffbed9d8c0eccdf5be8e316895dd87fd2ba747aa00842f2f7705fcee03c8f59df4f3310c121e111e7217e8128866f3ec5498e32a1ec444b7180fd7a2bcbb2a88820123997291742d8dfeed7d81615453df09a2bc1f68a4ca4b40b01e755e98c7300a9e8fa8e25fdb97cf6cd201827d6d8a576a28dea9a12cf3255833b610ad9f5b627efc4d960cf48908841bc2216b38524ed611af5d467ab0cbe7f8e43b0a18953993f3ffd8de5efd04fb9a2082a6473a36e72a8ef647e0f17b96742d894ba2fcf36b62fe7ef7bbc440356120c0a9842ad1b02771b1843c965fc2eae515a534c97fbfa4c91dcd08310cbc9d91b6ab3d73535a2182a08bf99aef68dad7bf8843b64ed09f35b5cc07b95e2427dee31a084135bb86dcf684aff1a6e42369d626f41e28bbba44260508fd641c853eafa9863854c64e03b0941d34e148f34ac5e8d0ac5b0664a26fa2901aca4fe264133aebf28e25885c768c13c2c958fd7dc10d11bd47f03c021388a02c90ed264e776269888bfb46df2e9b6ee737a34498d90b9a1ee9dfd715d4517849e8ccedebc5ed3442f2435304c2a099630fcb7f4e98c3940fc29392ee221dd31d336f0e3583d46d39598fe8f2231883ed2d893ef929fb2d31053c3270ce2d20a14046c4fd38513f0ca618ae78fa381cdf32d4130bd23749ccfed3db203732ec9efe77b4ea3f10b3cc4c09926795666f53046b23ff098eb4af6ce0ff0ec628b203a195a3b51dba1de70cfaddcc75751cdd323303599ad3e4038535bcb63ea1d22ddeac7b8b9b2031fb4cc1765e0b51720ab1abe7a5a27f90f434f4a5c807b41a94fe5800067105c5017ba6973293570f315c66dc77396fd8c02ac1adf4fb6e0e176ac8109224fd9c93cab2901c329418030c4c1e89cb26ab8823e12afe7c7b4570d4d25682104b007464476afccd155c6a9e8ee3389b82c432083d5272df5b18f90d9e8e6d12cdd6a4e648d71ff7a444487112a8d048cdd857639bd119afd9926d90e08af5d703691e3921fc615153160f50be597eb499dc4acf1bf72389c5f50db1aacfdec2fd20f060fe38b3bba33e909def67704ac1e801407d252f7bcda91cf6c9a89e4bd9ff1b1ee09a2bb869fdf132c3db689bbc7ee5ecab12c4cbaee38ad341f190cb8e12f1f3cc2278d2e2b84b5a1912aa85ad41ff93f286c6e92da9e5fc96657229893a6589e88abe7cac2ba84b20586cfc1c9a4211363f9795f3a4db8ddf44977e342ea4c8fb31ade504a0a3e5bac371a8d123460ac33ee88409e6c1ba63108a4cc92b32e968807ed48d3a4b90d2e630f42ca638df66d7f3b24a35495b5a057b182a850758ad1fd69e49eb4361710893618a51a83b7f0e980b50c1a8d0dacde62bd92860629c3ade00617252048ba47bf0434d841fd3ec00a30e640b856102a651df77ce8400f75952aea817eec53f37f3979817848eb9e59ab311846ba1566a28dc6c0f7660b4a6b83c61c158f7408b7fd7dd60c31fb55397b6aa7463a315abc2fe3cbad2dff70a8bce8f82921960cd1c78e53e4162a3fdf15eca348f002e1842d2f33a98345866e69cde181f8b3dbf15a8835a134175fde79cb556088681999f140fd19f37836673f76e33918d9b9b670c2b4b6bf7b0e0ef0880f1851cd75ca7787e418d58b6319d247021427df41bba37ae7c29ec4a9fffc9699aaf965b02a24149e21bc62d828ca1059710c01f8d3aa43c2c35cc49762d4c6bcb2cba10b4ca1d6c1c5055c271604a2c68e9daf77ffd65ccfabfa251ace4a860699985e57547535abc86db60cb1441db0206a19799947d402ef95398c252a8a43b29e17d6d245ac43d8533bde5d4a9be0f9ca695f4028e67d51c48d40d7ff91912c663d28ec21f4d438f5d51d9d46d9d9ba6d20b2c9370ae95ca05a48fabbe6aac47972309bdc80895a913d3680a4b2b0e54075d67b9ab52db89ea9211f0b3874220295eb8f31f7c2aec6dcd6ea0f15c2f95fc22704f26a40011a780ce5e8dd99e0efedb4e2911bfc6b83387e0a7bb45e13e712ff5d8c3da4c746d7346ca2e0e08735182d6ad18d68bea5c8ce04abd4a9899ab373b87a4fe3499f311d4dffbfdfee39cf7879007365d806514db25b454a47f618d6aa2bb1c4f53798775b48af250286fbd3df88a7268d0b5c293bec512856fbdac04847a1364ef8acd108c13de339f1a3fee1066fbcb9f75e0e874ca08801479620e8fd547e407defa37e69a891eda9f95d5cc3de367b974d3f3084bf6c59ff40265206dc48202151dc16c96392c6611d6fc7d8f54c52c7e8bfd294e789dbdbb31a8d96722ffa4bbdafcf79aaed83b82cc59aa865423276097af720620ec8bc9134b20eba9b0917e69056f6f180e091b4027506958aafaa8ba0b1c1c6de951bf7bf4a3d29ebe43d497aebb1f4d11927c1f80ead19d06d29e6002da8dd92b44f0139dfaa9cd5e4bbe8ae07b343838035969e628aa9d3db296b06e1d490d09f3846a8ad2556e18df80bd3940378437b506c0425ee0ebcb8ab648077aae93e2457a9f3040e0c2facab8ec0d04a2edb1cfbcf225a071a3ff057db13492cdb99011a65e2046a034f31c671edfef7d48212ceb3da363d149b34335ce06564b04f44beaf96fb2f8a2ddb657a28af34c37e72b213ac384c91979c0564407dd4798167fc02755e32b8f0b216089d61b4b2c94eb03888921be420000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "516a63", 1, 116652810, 733220448, "31b981925b6275ba8b52f33ec24c16d02bfa5158733c7998dad689fa02bd319a"],
+	["030000807082c4030384b4764d245ecbde540913fe1e46f59e1b4d63abf99914de18fdc7e574abd61500000000036a6aac6e2544256614a7dbb36769dbbd768ff4482558cfcc1fa62a6f65a148f88dba64ac6bbc7b0200000003516aacd9b5ac201b7fb07a83e38543b3ff6017b190b4ce41865d1ee3d342daccbd12fb0f6de5ee000000000653005351ac52b530360a024b286e0200000000056565ac5351807ced0400000000066352ac635151000000000000000000", "656a6a00", 2, -295757883, 4179206552, "ec1d336564d9fe2a8b8113fe1c8755b99c504849385330c26b1b9142db450a61"],
+	["030000807082c403027f796be96ede4da3fb6e5674f86c9eab61df0415193a7b80e428ca1b543e9f9d02000000055153ac52651fea18ae425c9de4ac2168ec3f2c63b602264e3d5edeae144c4b6bc1ab0272fe59cbec7f0100000004535365001ccf3aac045e101b04000000000753635151526352574ae9040000000005006a00ac5100ad63000000000003515252a1934c0500000000056a53526351000000000000000000", "00", 1, 1588999221, 4122551051, "b32e89731c27b84e8b1481305a207839d0b7c6afdf5ab0681922a7ac20e82798"],
+	["0400008085202f8903ffbc2d31a74b1a1ff991e1911f8c872f47c7d44137617a72aab7ee5e026c41fe03000000086a52005253005151ffffffffeae27f9bb5fb2b0ba71f805ad674a5b2473f34f4d97f1fd91e78687cb970bdd90100000008650053525300650018be04ecb15dbd38b84f8b0f72601c1418be11cd8357af7b8df1c5d981f0de55b63758bf02000000076a520000536a52ffffffff039fa98500000000000400ac6a53ee46fa0100000000075263526353516385944800000000000851656500516300ac000000005e674f04b57b0d00000000000148951efba0bd249c8a8ee332e404de2da95c337488bed715d825d9df3dc20354cf06f0b64941d207a97cd6396dc7f4f2265170427c5e72462f8a161d2b512a6240ed7408c3abb524a995742fbcef72ae5d5e819f7e2d542b905b6fa9828bd4de196129eab580de08cdbc3cf138fba7caf004c4973cce9b55af5b6ae79f0d7836df3560a0ec3545d7ba66944712266d70ce8d23fdd535326cef97714274987a0cd86a201370fe34536685df91c1b61b7cfcd6dccc66264f77c06fc904197c8c73d1ea1fa96381991627a72722e99934f813007ee10ec093bb7090dcf31b3035087658e9684fa22affe4b565129178ad40302bd1d181cd981afe3faa30e7d186504b22b2e09aa92adb8aeb9566a75d1010030e46f85a126a271ddacd23b8975d53e06e03c40b19415803dff7271abc0e26a4676c22f1967057e5c3aeba4f248355eef78fd095c326a796cb9c9993ae5e0e00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001ad756f133af38c0f28e51234d8d59cbac01b02abdd9ba93db576bb96f074460b22526ca06111dd3702782d5c2dbd2241d743d72cd3d8a0261adb756317465045d7a662d5392c778a3878cf51b02c7513694b0e21a4101ede40cb03b0fc34eeca9f7d1dc64312b25a85a4124586bc643f80d9b2242770aeff5ba70d39751bce945c1592128f585fb7b8d244c6f95e52ffee68f41899713f60c02ba5e39bf1ce5c026ead8d6bfc7ef59057c73e420bbb315659037d570362a2fe7ae98377420a72c53b95b92c59e21be84a2ae44c9586938cb163aaf0022fdb24a51b43977214f249dd489acaee4d8cf5a089b3129f8bdbab46cdb40ed42e72a15e3744058fb7c78610638796dee750fa865db1415de2c508b09c44e2bec3681065bec60a39a29bb7c49c84223373f09254c4eb4f7372d905adf7e7efbac528eeb08fb14d29be303e983777e2626b8adc01aabe8b7d0810bb0d48402dde2ca1d7f210d1643e18eab1ecf091db4ae2c7eefdfada833b173d4814e2b7452a30900e3a965cdb1bf3d22542bc51ff5454f44ca5698f0d49896fecfd92cf94e896e0da49b83d64d059a9274c2d954a0b0e61a112d5522b14592e330d652e315b26db0dc5ec0f05b181f6967497d1d34d9df6799fd592fad5690702a64a8d0bc788f21fb7156a18579ee52452876a38335efcc2a64ed5829ae65ec850fa6a830d413480805a0c33092997f75e7b8ba8d6b2a9af27809a9cd99a45110ba40988ce2503a248bb1176518655f5a62c64a5d6e4c4f77091b84d4e12f656957e727bb5d7c210f000e76976c1158e0f5a74ed27b115c2144af379fafbb196dd4a740063c806d2d626060cb24ef5ef52874797b60beee457a20cfc9e6c31b0f1259ebf92c40094b7b35ed004da34a798f24ac79d37e43c30d23cdecdd4d244735123f13eae061d2606b7a736a0418ae4fabaef2d869745afc3d044a226945386a63bb5da9604c240a8c4c69d390d91f3c3b00178008be09bbe0cb1efedcacc5fe03ae74303fa71bd59bd0e9e35ccca0bd4035692182948e34731c6225abb68715f7eb754fac5542ac84ffe2dcf560880fd3ca179d844ebc4061d4a315807c3a014c573f99fcef026acd549eba27baf4d6e300ced80768fdf66eba48bb4af391b076d70bcc22f99219ebbba83d3ac682269439c7483cc837a6ae16a86bb8e5d611a36974f305ce3b864f92fdbf32dc83de456e0ac023efb9fb102e4cf7aa8857343ae768ea9cac93a66c79f2120b810454e958610c0b3dd0846c11e5ef7c838ad69e0c9a5cab2451dcf97de035458a4afdf25eeb3bf65b5027a83620650ebb2b6461d0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "63530065ac6aac6a00", 1, 2101359907, 4179206552, "a6ca3352b19bdfca9460f726666d2a3acaaaaf1b630a7be18f49762ba7a147d3"],
+	["030000807082c40301e48e04779966394fd657985d2444e5b67afbf0209267ca58da05c2cb5affa5c90200000003656a51ffffffff022c290b020000000000ace4ae0100000000076a00526a6a6a52c576f7eb0000000000", "6353", 0, 677336713, 0, "c22d8455000167ab8c8f6ee9bc4b0595dea649128c30834052649c1870ba919d"],
+	["030000807082c40302a5291f3c996af969601a2382821c909da8bd643b924cf86f79d2d26814bb8a850300000003006300ffffffffdc6c11133b69cc87fc0627b75aabb1b2559f432cb3c805c8fb786ba0073260ad03000000026a63c9e0712f0356ca4f040000000006516352ac0000772ea50400000000055165536a633c67400300000000096553526a00656a006a89afddff0000000000", "6352", 1, -446962721, 4122551051, "8813dfbb74690e6d217d8bfed6475725e1eab6beda3e164e3d124492d1523725"],
+	["dcf62833015d750b9a4c87f01f2d5ea857e0f8fa16703d4a7bc1d5b99b43059df79448bb29030000000665525352ac53ffffffff04acb0e601000000000200511f3c160100000000056a6aacacacb2754603000000000452005151b3f3b40200000000000000000000", "005352", 0, 1950183613, 1991772603, "c9982246817f440afe414021e8cc31182d89e3bd2dd5e18d185b026de3ea8ec9"],
+	["0400008085202f89048fadbbee77789002b704cc24dcd902196c8726299695d2ccce5bda2cc502d20e0200000009516a655163ac5253ac196445b732ca67b2063983ceba038c6fc077bc79718050c86354311b223d82324e3670080100000006510000006a53ffffffff278fbaf58322edfdf90f13003814a4f40a947832542457073eda3eb65e34a9010000000005515263ac008a3aaecd4f81d99d0008e2ac94e91f74eb7329b96ed51324d80ffa35a3d5e0694474921101000000036363acffffffff0347345302000000000551516a656ac77494030000000005005151ac00e1b1310300000000066a5153656351000000005901311454e525040000000002fdcaa459b499ee3ddabdfeafc6698c52aeef6f2121a220ad023e8cf0cffdddcdd197d6dafd9c3120fedb3e993b405eae0f1c88924ea52c0fac9d5dab77a6a313a7452ab458bf7195bf3fd95167eb7fd82234d03b973e5ad084fbce1fa50a828a09fde9df8d6b9833e50faf3f865f8904550d0ad21a42fd096a0cd7e7555f8f1143e16174229e04ed82a125bc4183afed138e2e2a7beaf114a1b217c44a653c3445be73224e70d3ee433bcf76748067c3273bc2c703dc117ff6e258b7dc49438deb9d5ae965c3615ddd67d8b032a8efc2d0e77e514c47416b1456678f99cc87fdbac8e6de2c8dc8f48869ce4b33d957ed2295c09f0ef79422fe74bd42a7b4424382169540af9d2a95ff41f7da64c25ea93247224d0883c5e028bb31643ad4fd70187cafbfc709dfd69ef7d91e01b63239631da13693b41b64a45032f5f4e3bc29be4165af6ea9bf37967237460deda607000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000eb36c33c66eda4356777203d293b71569b0156259bfd75b1fa8adbb6620828ea8916f9e4ca64f5030612765c8820e6624110d9babeb27b8431b99c07e63a8719a72f86f90bbb4421e9e4ba3fef91596b4992dad41a41349490e1bad171a05183688a0c1e3385423f3a9f556dc33ef591df6af23a4f6bdbb129a5c701ce11969e3576469622e108a751cf6d1c4c68bcf57fd2e2116f5eb06cb8bf3f1e282fe1b9d8692a2289cc2c1c33fe0aece4e85bcee8f5a06117339b63163fb72943bcc564078df5653967c5eb1bf7f81deac569c82812916f2ba377d2b3230601bcef00917a00dfe1bfe0aa999662f0ae3750129f008bb153fa4eb624804ee00ecbf512f3b60488a3b308aee11ff90033fd16604c4792e910b9efd44daaacf495d5c443baf383d750a7c9cc1a955aa5854aeb54167a3731aca13a3e32ca47e8fb621cb353be4165af6ea9bf37967237460deda6070000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000129c6006e9b5a5ae0d21eeda1ca199c42b498274683d3a1ef6e204d644783b8c95ae2aa86c2ce756d3b186b230e85502b51833b78c8c89814d57da7d7b474c91d92373dab3aed2b7c13e52f3e1383f42e5169175afc125a201a3fc9e92ddaacc2b5c19a190422147d36051e409f90d768cefb15a9b005a7fd994dc4d26683630f046b8c1c2851ee4014b6398b0141aefc4124f122f8fd77c031ad82b15e74da41a40790d78f830fa03535d546e0275b5386b9fedb46d1f00203043a4e38b04d21a3319a96fc6b468c7a3f4966941986d0cce8efd45873497ec38fd08c9c66bb0b30c8d70b5c84de98b0cb052c1d95cadadbc86451347bb39d66e87afc5c63b71ed0bef373b3b6e621e40da86ce324302e9051e7022e1042c555cc26237a36d99fc83cdc942bcc354b4cccc439618d1d360d2c53e1a84a92f92607a28dcb79a1a20d3d3d0778c808eaf19061719d63682d3232375688d1db2aec8767c72594afca155b0f2a0bd8099a0fbc4de16b32d5c0b7c02e9cb432faa325aa59d056a2194fadd802773e16d15dafe5c567bccf2910c7d1a0294dc638076ebd96257931e380d0967cb419ead45b30533f395487f7f881cd2aee5271a42f93b41735495a49091fa9f7d6a96d2e4a05d07b4613538915e33aae5d8548c7fe304eb8e2b67dec334cf1774996ef8ad224470690a482fdfebda007845b772cf5df6ed3c92d7c678bfc2a0c71ebc59a7cf0c7290db04896224cfdce355c2631b4a5370a06dbc83d3e62a621d12c7fbff210544a6575a3964d6bd3af22502e1545616e369a0de5ade0ca0477d5ef5ccdd490b95d79579bdb773e4427ab9e3a2b89828015e5f24527f64ea6b91dc3affbc81e42c01367b6b5a1bb96662fe218977ff85ccd749948ac70653c7e72212c3225c9312bcf1e71eddf82a142d7e50bf12a698e17675e640530b538cdd75f22d4176bb3fa4c57454a9b51d351fd53e937a555ed9749517cc0d93b328188827fe8a80a686066e7ce0ccb8cc13f7b21f0f2a10272db3b96e82a31acdac882944d6d1c8ef454a47d820cec52a9fc63cf7de39fd2a41ac2dd782d1c50fda87de30f476730c209cf6adbd4c9dae1f24060b71c44f9a6dbe8780deaa4de1f6445524a899b8c010c92490212f2d92749647782566a1e30ac7ccdbae470ea2bb5e261f6dd865a6cf9a82dceff90124ae297ee2a53dc618f06cc3c83b8a96f8d23a92c12644c0223ba51a0b29c980ba588518a0305f61c587984383ba3003e31c904b2a6d960b7df051e03182db3086798defe28683055e3e2c12086b37bfa02bb284d4ddffb3d93b6c674461c4048990c80020000000000000000a96fde0300000000a2974232c87f9f8d2856965aedfdfe329e8ec181065291ec06bdd3be4c51b8f43dd004d3279598fc826cb3279fbdd108ff30388dcff8e7b4a52ea2897c0d2b4ae0cdd1dc8f407b0952ae40e4f94ba8dfdb5d32949d16832b14bc5a9c33a66af900000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000d982e5c8de5bbb159b8c3fefc8a04cc45077b954abbf0f0c1adaa10f3096af7e746b3aa7f95bf61165b6e55caf12d6631b1faf5eee85fc7493cfceece4e2f30f7f3f9653a94416caff9c51f8fa879dafcdb73e69472a4eccd20fa55a7ead69c5e2f0393a201d28b85b6c8900116030d322d7b111312d6f8c5606c8f9ca56b45519254e4f1f191bbccefcfe2e4dc9bc91215193e244e271faf28da4ee96f0eb169645e507c9dd1c15cc2d4eaa11862c24106e3a985eab854ca8ca35eead893ba6d4c0fd0ec430066de2efbdb5b5c7b0efb99498ac0ed80a5ce751f1cafb46301903664d8ee281003657868e99ea6dd69fdc30db74e1978663de6537fef69b70f9fc95aaaa74e5c48c108aab9778dcb2daa955f19b6e0d654af9a15812a0361704b22427593766f098d614032216e3f2471ba9ddf15694467c8f65e80be7cb2a0333336352c47ebdc15d2c12305d1200cc7a286ca111cd24f00bc6a60150eae63bf6f9b4ad653bf3203a6e17e378b9992720bbec377ad4533846181a77cd71690faed50dc8d5f4a4812671c0aba6f9f71fb70cf8c54fd984958266580ecfa6f3a9a67b3a21cfb60974b5f5be33ff176e9d6a205312af81e827350e89664244d6e6e4917e1f4531507ef9c66fa07463a8206e7c80f4a565ff93aca3c038a302272abc0c65eb08930750f9b160501f81cc2afd9fc184e560505835d458dbf94d25e335f93c33591896174d4fa3386a212278ebe51202c0c245fde2adc068712503e3662a9a47c75ec488c37595884682651fc29aed04648ac44305056805d20b850a989904aa338fe6d1ac6b18170f5f1922784b641b26037db7620a170e58e747cfaea73fcb4770fa49d619bec863d317a8024f0afb5e8705f0750938a38e648e1e9ceaf17407d24ff5388d120ca85d6bce38333d37f3342deefeab51c6351d137389510e314e79527fdc022058fba7b0964837ae7828eaa07902a53be422729fcb43f66c971a69dd783941d6e29898d5471b70e7f199149ab466d3b534c61edeed55715dbf860115988b12d0f29a8f7ba2cce76afe45bf1943e2e153b57c28d0025415849f06de672d6884eb85db934cfcd2c1a906524d1192933cc11c173c08681c1bd34f4959167268f17085aafc78563c6cdac1f67c5079a97b67a6dd70ac96ef5dfb984089b6265e9799e3c696abf2b5003fff623bce60fa6addee6707c8b31c5362e86f191bb05b03b7b3ac75a0ac2cc128d34fba5e7db803d8f9f9be5aa87729f8850268c9d9e6c428920b3c87aaf8914339d262e4bd5d2bb986234e46ac95bcedf7fe4e4f2774d010ce983632088acbccbbea5d5fbd7a81cced2afda951b70e5949d6f95cb937b86ce304cd57029e854ade5c1051e78711bc9402bf446278210ec63605582799a1482468c949fa124ed9a4c05cde9051eefb0ec1c1f65cc0693f224213a34b3c4ab3bf4dab1831fbf8b1f35dd337425d72f9ce533f58b1e7322037a928a72a4f65dfd1b60a6c4150d28b82d21ac8a2d4b2af5301d968823831eb3d1cd5695eeac29264a92e1ef621b156023d3d13b26d6e2399ceebe9bc106314430780db3ab5ddea3cdce2cab8c80f21e226404b3aa745a7d52ce06c33234268a51e5fddc87957f6e392c0571324a4fb8e51ddb994630c93835714ffd6287bbc35c6e07411add119f4d9e78a2d7566f717c24ee3d6bb367a9075e10e8641990b11fd99f05a848b06c45633c9bef1c491d058ba759e52230e912307ed6f68fd843b57b271ac0a51cce4d570175d526985446a1719cdea78a29cf6b9cea067f6c2c8aa9dc7d93ac0e9f069230b6f9897118769cf1cd3bd0aa0cadf6fbee45c3eaeec44a9ed262a232388536cf2c316ef9c5adff75270c254578a05d4db517783a646c037747beaca2e8a9d8bfe4134067d44e62e723325aa20e3d2601117fe55a8c7e3be99d4ae18a0d2ea90431fd77f254153e5a79cb1e3add6bfafa719b0904272509432b217d62017e7436740619c1efc062ca8cafd492e0c5b9ef5021b72acddfda8de8de87a767ebd78e288332dd578c7a28505b96f99e14597498b761e535629d68af91bc1b0a5753646361c18b7fd945ff7a74f23c6833e5fecd91994082a1b6b8b3fb39de5365d46d987b8dc000000000000000089ecc90000000000f8b916c0f191256f8c0932c541f4b9c7ee2d720925e5d31697b10d90cb7ea26dd67be6d3f814c0ef71e07ab8ec4b5336821a015de6eaa1af483f6963ac131a10d10ee77ecc42aea68dd7d2ba31979d12e8e5eaa7b6cca276923147270347edb7000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002625437f3209f34fdb976adbf5d587ccfb3a413ee9816b843cdbdfa6c75294f17a637d6c19e0ead920073b1b656b3efde9b864d65918f3c36b8cc5b530931533421332f6ae84c3b7aa3b4456e72ab7739a1a3fa48f7a4b8c65337c652eb27845a08ce1d7c8099bd6a913a9022cbd9a5771f829973f1f04b171266f5d88feeadcf09eee018747d4a9e15c2680ab3d314a017aa8731eec8fa527d2878fa5a661df013cb88119b3e98b87548c4c74ebecb05f77c4eabbfd29df8ae1a5d752721591a029db676435310591b3ab9a5e2f3bab3a2eaf9266ecb680618286f3c347ce2d27576c6945d3a6b4286b9fbb6af59d8136aaecb94922a08ec6a91ecf03b327f704000e06884a1e3ddebf7445d2cb7019d291743fd3285963b9c7547bb5e2a4d61f857c9f1595fbc2d53b8bcc6aebaee518c0df43a8efecbd8240bc8774c89b337686d859b3f7596a49beaa092538c33c008e431b59a7be0cf897c5fc832de885b64642d360fea5720d1ddf4692e5512f438f3bf6febee13ffe1868e05b862363b01c3e06c34edae71f08e3d94a4bda6f26f8992d09404b6febbba48047c6edb468ff57fd52dbc8d3017be1e949f476fa5e9c2ad3926f74288c50dee96f41e57c469eeed25d087d31a08d9116480ceee9ac23dcd5607f8e98e7145478c08e572c226148edec870d9862e4e8f2c7b59562a135459bdf820c5b86b66ee8c1f35c452a417b060fab211fb334dd4fee1fe789ef6cf0efd8d6053e7447030c7da3836c078fc9b99568cd4cde031cfc98166ab7c39cef2fbc9b3565a879c818132e964490d195555be2cd9772dfbd3e36002021df2a7410a4991ea4d82c75944cb3ef24849b94321ed074903eae448711d13a97a979be8b8ab525c7004354ad0d7a93fc1f9470899095376ca8b40d0cd25f367794095b27c4baf2e183dfca376efdb5fb478a9a57f47649416061f94299cd4ee0bf5e5d97224c3c2d9e2bb24cbb78989313d48326dedbe3d9ec43fc991fec54c18e3e602a94b87d1d0afc9e0d98af143188b489b14e52ab4ed26a7f7451656b5ece8ddbe84681ebea59c74a1e6e8030bf6c12d23b5fb86798e1909a7ca7583b3fbaac029e3c35190e32f3ddfa23fbcebcabf2bc23157dcede51142a5bcd2f6ed9f63195309faddcf0deae3e82399aaa4d3e02a090b831885bf321b7ceafecdcd62925815ee47fbd11afe47b7b6a11b44ec1f1eab04786a27de24e1b243f26bdd2098ea2a2a8b1a0330aff734ac768ffd2c96ffa86d92b7c2dd4ea8e1b5bb3b2b9af8bcf3eee0d39049cd2d8cb3a5f5b2051fe4797608ddb3dca28ac4c691371f76c15a20010e2df43420a2d6bcb19d01826711ffaa2bf8982226f6129d83effc7bcc41fcf3bd27bffe338ce69c86b57bde0f2e75db0fdc52d33f4c22b45343b56e800a57a59a0ea0bd3a1e923b433ad411dbebde10c5920d73f90e28bca5bf8d9e18ce0427b038c6d27266b265099e48d8f7aab6afa53f0ed2e6d30fd40c89c699f0d30f3eaa8a18d555977aa1f388ee4a89a35ea41115986f162986e7e8dc4868015e428ec25d1ca20136f3836d2433d3c3e6254748cf8cc688b39937093b5eaf87fbb0be2faa60859f4db39b56a5019c8a39e40d549e496628a90efb4c913d8e06fd6ba48d206d21ac50d6aded15075fd54634f05920f8096565572d557db83b9b79d3a9a9b4fb70be16a6e2ab8db686f226c7ba48c4a023f26188ecf1f98aa6089bc4716ffdcd87e89661d558136de2a17f0555f3d9cb0b60ac3cc62af770abe9a7c0a20a9005a91486376768c76d53def5cb71c65c808a8a9226db82c0038ffee212752e8a6b07624ba8e84ea0e7a94510ee29b49985d301e8570426f0caaa2833a5025f4e7e28f69f9625d4e176d8a1119b834dae2724be4867dcaa1fecd2163b02e5220644a98d0a7e3859467938d36a5f551759378fd9a49fda8d91288fdc08cafb674aa4ab8232e6b7ebf6e8230dad02e43dd088093cff061b7221be98bb4c88aa63cb8933465825184e42ace57724b9ea92931e7a0e9288042409704bb5bfde964533ef013ee26dcbf49a1c6871b0b90d41a0247cd3efbba21df1da8b76814eabe5d165b1c84e579521e6497650d35307460bb382ea5b8d431e803526e542e87cafeea8e804d3a42916ad9098a81614aefbde7e7038830fec171b71956f7c50ad17db806104c57530bf6b91cab192cb84a13a280c416aa0cc5d75f4467eb5e01d0ec39d7d30a976e049064640166eaa08f5800807d6ae82bb7d164dade0e00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "6551ac65", 1, -873330439, 4122551051, "458905e969a2d713fd118b84f3e3890880f39d20bdfb8bce4f8db7caf0a537f8"],
+	["030000807082c403027b48bbb92d144be07af392a6faca6143ece5fdf8b221d77acd72780e65414044010000000096454857fb25b040cdaa1a512884602279594e0d51bda52814f20f501508b6e17a535e3c0100000000ffffffff01abedcb03000000000352516a0000000007abf90900", "acac51ac51", 0, -1202902862, 1991772603, "df18ac64bba2d35d4e912779dcffb5d8cea77edd9879f26057287b146b62a4bf"],
+	["e479376b01544c44b432b7e53d2eecde49efaa291c9cf5ec08375592d19fb93ecf1b06e0c303000000065353655263acfedd7fa2032eb6620400000000016ae922db010000000003535163ba89f40400000000045253acac0000000000", "515300", 0, -1789503686, 3925833126, "e7243859fbb81054fbd0ba755a08f2d5cac728b8dcaf2305554788b82e403f8b"],
+	["0400008085202f890246da1bc1dda5b5c51db864c06f45346e215dfdaa7dfdf250f69e4b1fc4c26c2d0200000007525353ac63ac51510f237c2e01b943a7d38b1c2f49f028e5a1a7869cbeed45e55a231891ee00fecd63b3760300000004ac516a65ffffffff01136cdf0400000000035300ac5c3d717300000000859365050000000004c2fab1a9ecdfcdfcf8b74d5c2e559c2cde67d495da2c10abd1a0cdb2c60aec9dffdcdc0089a15d05ba78e52c6f58334698b8ae9a568ab244bb6e665e3c69b26480b9d89a1fb8256b892e4281f80ec9aec4de50c0983aeb2e671f0f3b56257d265f29717c23b42173add5734a9b8e9c3c31f4a0c21754fcd24e4278925d6ed13ad307e5bc6f3cdb87365f01af43c52e1e8e91517616b7540d066dabd0f75847096659e3c1177497456e19a1c84e96d96bb0ace6f3df1b9f6db164b22631cbc58a3a236e79455cfb4b4b397adab6b63bd2f6d03cf05a433b18c6078e3301efb9c5920c79907f4f38fc8eb29a2d11d6d0adea2c517037af995663057b029c74cfefe4ff736209ddf2623f54345348926cb6af86df290cc078bdd0abbee3b777ddf8fc425943a0f475f65c18d74a35fb226ba13325acb77110b65bd96b7dd737cbfeeaa08f5800807d6ae82bb7d164dade0e0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000003432977ff25ae2b88fcc3490c18a5409a0ca4ce02d6e72bc6c3ebca43ddb4212b0945c4efea0c7c89c7c71ca30f214a3e936cc191fc2d089dd21ca593f6923147f1a59aba12e07f435ef96ef29969345a318ec347a0301eeffe2dbd049f892838c98bdb48607ec5bdb16f0b6054c4e0fc85786451123454c508c1a9c93d091654d6bba36df284270080bc03d1f57a5aad33cca2daa675c77919eecd5f3d1c34ddee9060cc07c7c9400964ce76f3943e908cc3a571adb4ea0d25b1806701a88561bde42348726ff363411279fd3e0733b8436368c2fe4953673e5d75b4f8bbd16a39566166a5c48073f15e8a5041e559098b050b5c131d8ac83343523db28efb148f9b9768e7491ea05ac9e108910274340783276e26068fc58ad110ef635e201df896a4c022fd811973a303b8c21a246f8bb581fab894be3d7df26473b22f84beaa08f5800807d6ae82bb7d164dade0e000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000192bcb7eb0f998a62c49e5353bbe816242a482a1c350114434d1bef997b77dce9ee2d3b73f89e8b16704f16635252cdaec251c0ccbb7592167c2d8eece05ea112eb6dcf63d76e6de058e7f8976bbe0040519d53f89345624c64cecf6da0e09b6254ffa68cc5e8a371740134b0dca1c3b32bc10b3fb2103ef77e9f7e1c444f366d61f15849a15cecdd10bf71771a03ffed40a0e84c00f5afaaa71662029d9ec1e521c6df439fe319de5bfb5feebf5807d8fdf3b3742bee35b13e4aa354da75876ab2627f9a51605e023b41c06c64eb0fa340e68721963a70dd787a6484a3e4db822d555a02f5498e7c92efe0be4f6d31e3b32705021f19964c8917223d14fd6c485a9fc29d847034b116f754bd0dd3345c6f9a422a477708a658e95e41c2ad27258da9f39878273e22b09705ce3e12cfc45da9763198056e4fad7701b83dc1247eaa08f5800807d6ae82bb7d164dade0e00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000037a9e075f46f9b178b23aea66dea7b3bf0d7e14598a9f1edd05472c21edba54a7bf302aaa85fd3d7bd9c9c19bf1d82cedee227564e56848c2fcc5df57073356934d1d73590684ddc965eb88b61155db1fcdeef462e0cb8e349f0bbe7fc32b5290c62ffdbecc3e2ed32a5effb3ea9c34bb4b6ce99808461798d6c320b367a193ae131c50e320747edf3efa802dd8fe1369c0f41bea9329afcbd5a50417ca0bf8186a6f7cd06f12b40ddf04cd7b7c95febe888c99808eb95ba19fff10bf65d6a258a3cfba9c55d34ebf03eee62d864312da7ae6480aa5fc0411dfaf329f5259504b5e46fc5d1575a7f4fb728f485aa42a444865b5b71bcc267d9f3656313f56e7f087c56396f33c0140901dc40102e1f7dd4837518483fab0337ecb9bb1dab55a777566382bc397550157bea04cf0402cbb525530874249be1883fb8d06a743553eaa08f5800807d6ae82bb7d164dade0e0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000100b476761c92b829879cab03d865e769abdd4514f3d47a6c5e08e4dbc40b2a4506dd6a8c7fe6b90954b54313a45ca0fcd933cdc6dd798d524e76fa315af5c42fe45c4d293549e1e42a3c40025d0b2d84694b8a92053005d4b1c48b07a19d1e0de8f7e6ccbc592847c4ccc335958688eaddb2e9d9e5fd902fbd40114715033719614f3ec649a9bcc561cd35b0460ba287cef126bb17f06cc68d963c2eb442da8853e4230ea8421361aff43a4ffe12cd19c21543ad19208466f144facf584ba5810eed48799b3aa888bd291f4de33876f27cbdb6df2741666071962a5dfa7fb5ade61cd2ec8e97c4645f5272fe37e022da48e54d10c0cb873bc92f50a034fcdb416b3f955902fab542fbd6feb7669112dc50f61e3f1ef1482d2bf7341949e27ed7b3871ab068eae84ac2576c97d6b8681ef7cbb679b91c428f7de82a969815cf32ce7e0a3801f97a4b29913fe6ecdd8d1db1e017d157610cb5f8ab14e01378f33a0f973d101e792d06bf817a4cedbd91e4646aac7e8530a526df92015f191c7281d3c9abc67193a4a48778c865dcbeeaf645f2c024d61857a8ee78161114147f2083fe2285f4580941f8767db34a019151df79ddad0969f0f85db980d8f0d1daf084f450c20de7a5f122a86c8106cf2dfd3604a907db99d63c1498c44d821643da5e208dfa6d69bb70a2656c741efa5592045ffab77444b737c70794371cb0355bd4717c512dde893628c9366908b46501477f20d3932c4fa44494c38a31ec15955cb6f242194ae7ca58e11d34ea45d9bc7fc6da487b3437b874e71b6cd8841876fe394dc8e1a46268dc5a9b90d66058108c820ba8c385d148407d5d03b1afe13ad8dc9ed2bb6bb3572b075b0962eb5cc35ae3aed3e2881bebe89d145f1b6b824f92aa6087efbcebc2e8342f2feb1a011ee252deed336bb55483f2a7edc6d38ef8acebf1e3a4b1456ecfe0e8ae70c95610204a2ce3347fbacd86fe65481207e7e6259f90cb8815f5ac67f18242066129269dd74f1c9a52f0fe12886dba1f9ba3db407f0edd8d20b675c7e9ffcf87dd3bea8f4d2311ab2dce570a1721d53c1af8eaa7d9f4a40655f5a29647a0c7c76fe8d66506da70edf8feaeaedb3e652123fcca13fd7acdab91ef61c9bb6774b561bb843723ab0a8b63a5814db52200b6b90e686b833c40f7b472b829efd0a43c5a70d78bcacdb1c3e502655a1456ce073c46119ab1fbd9c81f4f3660cd5d024d9ed9f499b1588ab35ec10e25ba1af3d237aaa5c423e8b4633d17c303ab06cfd17a03992ee8a96c09399f6ca04e563a7724fcd12bf440db31ae70641ed7558ddf4ab0d382ea56bb0200000000000000008f980b050000000009276bf2e6a4cf4dbd0075801eeea3c222b4860264d238d39788559944a0ac196bcfdec7ae37c4e6537ddddaa856df06d10735835ed4b18c4138a510ea132802d3e06ed1238d70b2858df1ef4d51599eb37192e9e98d3f9bae640f9654ecaf4e000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000005b3ca48aa563fe6db52448fbe67acee3180526ecb89ae12b258e058ea2c8f021b594569a5b9d259ebe75fb3fe794b55ce4dec36c869b94fd8bccf2662f19c8bca2449d4c6fae3b0dc1a3829aaf0c877bbea560648d12da08dd20991fb557f9f7a5ed9255f9e61fe223fb08f2f8fc25fca145dff37e5485cab44f32ecee619a123beb7fc8e2a2b7cd6168ef5a34633b7ce2a8b3e980156743556ec29eef4ef9f4c4988650a2334985df05c1b1e195eed7858d3e4385d15a751d32824d368c25fcaab538f318c111c25ee64f20270fa4186ee49e8830d4e03e262b9b61622cc004a241d10a7cd20dd6be1789e269cb46f90e867b5031ba3213807cbc006b8e8cb403160bf754548d21efca85788f6daf5eaadc6b82c60fabebd31f1fb920337a30cff8c3826b5cae8d06063901f66260b0b9d746a464e03ef332172f1834bca2c181b72c1e8326f60fb6fc7908f1f2d763f3b604b1aee16fa7efb7d02509c3f0fcd74cc753304ecf24fb305b750a793a0df71dbb636db2efb875c19e280d42b0ede89af8383154166e6e5844c4dfc1f0f76d03e971b7d84b18bdfe049a7bab880c0bca53fffa8cf62c269780e0f16e8e16dbd7610394efc965435c45189fa0bfc836d61176567354887dd9f6c59af6e295c432b43367e9d3bfe7e6afba08ad96cb131017fd216db68126d9c442d31eefa0358ed0c7ffb7a7a548566b3e45cf52ec518c72daf1db498e39b31467fe5fda7e2942a36b3d13bcbb0a3f7a53294f5d2ed0ab9ff524497a2ce6c4f8afc00fd1199a51efa4fda7af6e99e2267129408110e83a314b09af65417bc8de067084171f3ec492506cc265c68c98992e5e2f6045aef405503bf859c591eeeb5dbc445898afa242897c3e05d9075967b9405ebb2c115285b9bcf2751a3272b633e744ecb8aa571e690e167463b919b57e7bb561109006b367d6797f40b138bc63f64c2b545524d020c49d60ddde3adbc09b35017641c6301c74ddf4797ba495e2b50484bd931bfce2418151e71183de03773bd93df313e06a353588c7cac982e7ea25604172eae4d667914586cc4c9e8c60b3cbb5eaa8b861bd2013f72259a1ecd15cedc6c3274e715adeb81b348c7bb8cd031fa477ef5c07a6227766d76458d24c2a7c6523b92736439ae5c44fbf90b50fdab22d6cfcd086367ffd43d2c3fe4a9b0cddcf8b246d6eeb5506cc78dcf5adfd4b001187fabc62f6461a027da24f053f103c9bbfce0e2294780ad0276166e72838bb9af66d64064c800b3cf79084d528063554d72a497bafa3cf52623d393ebea65f2f7a31026dccdf89431d4ff5a6e77aa79b2aa8019b5596067f41a85a5af3033010fcb4a8c370116926a7ab748fcb191f01e1d03fe857ac92686e0432c729e21ef0d090f3ddcc9af145d694c1819af84569ad5d46ded248e596a56144be58cb93274556bfd4e048b5dcba7ec3615ed6ccb19df3d7cf4791318a24fbaeab3e3d813d31d094cf2147967f4c5e4cc26740e347c31f473e120cfabb4393ba589474b3336a7e73a38927aed328b0f8fe8321999d4aabe9dc9505d7a7b321d82783221882059c96f816da39f10f3860f3b6d4132d6191b811d0548698b650ab699bcc8548186b0bbae9f677d4309e3aead75ee953fd43ffb695a58510cb7069f3b591e4b5dc749f438840d3407a203c9ba892aa71111b5fa1a1a7f0eb5d47d7b2cff37c23fd1257284cd3ca3f25076ccf1a6a7de9feff0efee226019901e6ed37aa22f6db1287e760070b500e497a089aeb554426f0e78ffa30417e73bc50b6bb5e54f9f8bce26aada7772e7984ac3f88790ed2a793d32e4eb9f24a28e978f64e6db8d48ba4258dd8a1766f2e5a0349a46f1daca8abff1acadab6973dcf7eda9630d58d8dd6dc95045bceb967b0f996132abff5cbf20c6b88c610b7285991f15894435e80b35a4bc75c8253a7cc8338da950066810735bb0d58e038e52a90c5aacecd6944dc1722d93b2d571e76c218e7a703ef43d253a4c38360d90226b343e4308edd5480f13e52fcd88a2955a73cbb35c2069d49b5267c06db07c8b98995aa1632edfbbad547cd54675ad1c8b492a4a06a187d8d3f5b455d9ddca336d6d217510ab1bf95a97913be770387ca256072b7f296fdbe5600000000000000001928680200000000fbf2a2c20f3b647bf70c816dd4825ee26009f0937ba6132ef240822380478a18e10cfdea28de6b9664db6797c6f9bd3323c85e0772dd2e8cc90fb14fe2c5ae65ddd93862325a9ed3717c9b77a31bf4c7cced7f622171145282eed4e3f9beff41000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002ff0fa1f1603f8213cf2ea874f47967a5ee9c0b537ef1efb84275d192763ba95937dcf53b7d5d16876f5cbda96966ecafee149958295310b5fabddd23588d0062d83c73b49f62435468ca32fc7832576cf450a08a9b3721ea29043679f105fe05df84c0998a15d7a8498e91eea66268f988d07eecc9879f675718c912db110d5ca43ef11d8eee621a006cca38124c7bc67127f94eb8f66778b9b66faabdb7ca66e511ba14b53fb50a1fffa3d1d8fadabd4ffd6a718681e4bf561d09b37cee37246a12621ee5d415034bc6685ddbcafca8e87ee87a91ea8a390c88c4f22e2e7168fcdb77088135aa48c11b80d65a0ed8dbe7f52639565740590e6c404304d9da875d2d40b7afa688aca4d9d53b07710e01362bbcda219a490e6001c8fddeb74379be156edef834c419381f475646e2645964c08f534c69d3601b37cd7eb802f30260d8e46f053505a78149f73f88d97692898e7e8d04ddc5cb17d844c679d9732b34423ba6d130a64174253dd885babea868f1d114572fc694f8a24c374ded92b595d32f60490d415c3c113f891ad7e353765a684cfaa7519f8960ad041ec07e66324b12827f105bb56718efcd021ffbb3d4b6be229b2a2bbdec232a7d1bd4ee554b4bb27b8f120acd98c2733e267e3afce629d69dd0aabe7ab36f01c4766b8f1c4bc4b19db6160b6159e3e960608b80392837f5cccc29b6d98324a775e3a11f499c0cf9ba2b57b7582760f10f37b6b7090f87605fa7c1dfc4c58abe29baa7a1c8870f36ba9332428ba4a81239370ee7bdc280c814b03bbd6cd3d3215d0e483f069ece2dcbf93b17299ebba9ad4e4559b8446284b8ed34af1df4ba717c43d214addcf00b671a397d6662a2279c4fc0c4d8a57a98a9910c56ea8b8388b7d318abdec1f89f60bdddb45b4c7bef14ab91927f7dd579a652e94f2c75918c51ef3b99c9af319659bde18deadb92ddd92d6be61d2e326bfa8c2b3e648a74a1d768a9354dc63d280f9fb884c2dda111f074797f19bbf070a09ac2e1b190e8d9c516015decb48a519a008e55bdea617f3ce47fa706077b652e03bac36d9798d00e66d3112006e6b70ad952478d97297aedca8f8dd1bb873717e97f5f77aa712871d9cc18a7626593ad3827812d66ae91b6e7f2b69a4915b647c274c6b697ca38ef58f8cf1e813be6025da6a5cf242fcdaba9e290a7988e5ca79c182ee035e2ca06891320f640da4f69b32dc6414523b0f9f78bbceab436d0aef8d5b53e057e425eebeb36eb55daf12da91028a62c1f50dc7b648e1bb3e697da837629e8426dac4a4418bd32a1cd2be40ec452b8a0abc9b009ea54d0a967f1dd15ff96e2d162cb6b830bd674b93529108fbc74838942fa60c66c4c8c402f2462161d6d491cf7479262dca7764f2523a030f0378aa3905d17a5b8b07d5e954288cbd9383c89d92bb34cdb91f59fb15569cb6075f09d57179b77ca49652f923e625df2164b4f2db8b0372cc7b9b5201b4a9f950b80596e9e95224462e383d2f4497f757397ba7c56d27dcad556734af41902036731936c2da7fae82b63f57d4360a3cfb0532f4036f31e6332bac72641cc08deb96e8dc6b76cb93ea2b7a0f35fdeeb4f48d6fe4ecc37104b820eacf066706109cb2626c3953c24a5773ebd8ff47c8ad03a8a28e0246058c078df76bba694ba116499bc603f063ecad3bb932d9290d20babc08bf7cf4e3444ba34e670148c137070a659409dcaa33e5f4c7d1d7acfbe73cc5e308eed1814189f35ce1ea5d666e6611a9922cd7d1abcb3fbd0a5404f6d78d3cc345fd6716e0b15057668aec50b5b6fc0c1166da28541e9e49dc84341429532a4b7769d091a90c7c3004575bb80e380eef56a7e77c454ef45d8bdabf4ed7f5a5aa6e2d7fc010fa33ec09b7e7ffa120c22ecf96aefad6d25cb2598c0e88485a6a5f1f1b3ba51550553f7f41d25eb99cbb7a28c36687720cf46a7a62bc767370d7fc7b1b09860a4ff39f728af1451f1b460ac37ff14afef5695fddd9b83a2d5e464d5244ead1a5e571edf583bfa79b094fd86680827bddffa9fcda6847a01f59c97763aa7d81fa71c47cc8705f552f1ca3918b08379c545b7de9b2378b8c5346c6b75a5518ddc9f2201b9f28251594330fd62fb13aca371186ab2e87e65ba042edf4d77e4a8d72fa80386cadfe5e1becdefa9f810afc8e3ace3ca4aca54caf58d4c5b04944b39c0651a234b22e46404ee2ebdbe11f3e58b077bd10bb2bdfe37a9213767e7e1dd21768bdd8ab5a9a3e22d046a7694b77578eb8d20b00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "536552", 1, -1322284667, 1991772603, "ffa6e44428621ce7cf6732d3f2f08f811d824d4b6133ba6187dc0be15fe7ae41"],
+	["030000807082c40303448142f3dd996802543baf0896b8ee430d8d6c5ecc0080e30632fa4639ff813d030000000651515252536affffffffd02257ba12745b1189bf366daa6dc3e92e132e06ccdbf8a45c81b9fd97d26c550200000007516a6352ac6365ffffffff05a584f8361f004c41a248332d7e06b4a8a6bb01477c0a4681d35d87367a7b6300000000036a6565ffffffff044be6b80300000000066500526a6a5105b2a503000000000451ac536a21311b010000000001539e6aa00000000000036a65aca6ee410cde42b40000", "5100ac", 1, 428791657, 4179206552, "0ec34f9f1a9d1857b637aff12660ce5b389f74c9126ccc20089c67f55e688e38"],
+	["0400008085202f890399d2615698cc638825a0a5f0da978deeba6b8d83b58ee52ef7aefbe75efda43703000000000fe9af75baa88d5f275a6d349ee831bc5f591fc4b1ce871bb5569322d5c78aadc1eecf650100000001acffffffff4b6cbb838f3d9b0c3e050a34f883134ec45a8ccdeabcdf5fd035f726093b77d20000000009535251655352650063ffffffff03090c5d0000000000055163525100588a5e00000000000852005353530053514763c20200000000000000000000000000a3281f010000000001844ddf60595503ef30e8f7313ef98b373954f8abc6a3b5b923ea03e1f3efda44ded388144ff0fbfbe19dee85f3e2cf8fad90c34f313cfaaa9b70d9f775eeee1dbf8408e042b6bbc392cce830a3e14d942584a85edead3ac4e8e225e12845c97be3591742d61d9d80711c7ff1566cac34ef43d930deef2b346938ca74674b323a064cfcaf82e91c255c87b1e8fe4f40d14dcfaddfe7472343a01db3366bb9ee07434a2e67c93e29a72c6dc780be32f960f8009374a5b1fa5fe8ddda38f9b4261354e570ce6fea721bf642e4b5889b47ae221a580e3b76386f046f2b4c514f391d9c3b0ac0189809f68eddc03c2a9a42f9493751c85bbd0a888428751c9bccbac6bba02b04afc4f3260e24e8e897203004a1e7bb738171d61d6dede197520a04d8ecf6dd723fab8aabea841a41c7ba99ae9fccf31c0fe2f58ae07249f0371f61d9ab5a9a3e22d046a7694b77578eb8d20b0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000274956ee8dc49e6da46558bd38e6eac7dea2af1d19bdd20d995030ed2cf6f92ac27cfff2d5c9a7da8a24603dbb2d43c3ee23ffe910472aca788ddab4f6b9380557a582f7535675143bce4063bbe75e2a888a6b1493713a7109c8cdd098ca55bea63f39ea12b48a1f9b62007857e75de5cfd60970af2cb53473aa8c027aa9bf73f084272fd4190a13130d4df69651fba49b0701eb1c752e86db9ef22a7d6cd4c0203c68cd446d278b753942b5a6882fcad892401e37ab8c955eb8b3a32957f0a5bcb3587a11a226300a649331b3324fb9479dca7dce433837b08378fd80c9d0445e4d79a0d30239d1b46cf62be85f1e3bce7779bcfe3c27037bdf43675a8d98cd9b78d95ec719534c416e3fcc0d7367070f097fbde86f187820d8940e3bb9829b6e253466dbcf1fad0baa5c1ed57674855aeef51c8be825b90af67288433da39e303bf5eef87718220238b12fc2c119f09eee985358015a9d6a4bcc956719bb570eefee39ae348f002cbd85f67bce2ee6d09fef2d823ebef8f739a7c1719453375f809abb952f8fe806f7a7f0caaf9a287d37dac2f6f1104171e657077d5de8c85d37b1b611674febc8444479a5ea8c07718663a1b3eb4c2fb3b5bdabd9de4689b3dc205d78b31574bfd5e604c9af7965e407a945dee6441b751e203c6a14fb81679318c66bad06c7ff5c4c3c787c3409b3c251ac458cb38fd59d3c28bf7162a7140bd1621eae58e6c325be09c1fcd12c39c384d16f0f3f067033a6a6f034431f9544601959d01c2abfcf654b8a091132ece4a7952d98e0b0b0e138753bec0b1ff63b2cacb2bf57539bc4f7198b243f3ae1d36eed85ffdd171cd059ee58726914ab28bf7a6fa155ad20e6ff1d179b226c101982760ecd33cfc66a0e65bb006cffb12249db68cddeb5cbe6ebd8aa85ce64da60bb13be8738fd8e04e36e426d152953ad98c1e6b4787a4756f7773e2213d4942cc40cc4551c4c1fe157a7b3050fabd6495e43b4e18c3eaad8f6190ac63681558f38d77c2fbb6722b3cba6ff76bace8fc379e9b40a4f1e78e40a03b43bdaa6bba841c41800cfe62c02e0e1dfc62f46cfbcaa9688d3b1f390bdbf3673db6e069216202be28bf757dcf481c66284ef8bac91c93072b3b18fd917c47d694d0be3aa550f4a638cd4191e806e5db94359e3a0bde82fcdd7c7ae91bc454a2c8d8d00ced5ccdb51950c9332e24a7026444c5fac8483437b9f5e18a15f6e145f900a6233a6c32007f2acac735e05f7b7b7cf01f692fe0c4065a05e8e9cd09bd86cb0bf7953ad0197bd2570a711ab8b17c0e57205b3883885efeecb388244c48ae4f7854286c7a19bbaba3350fdc43ccb58c75ea42bc489490170878af04d7a6ea9bf987fdba81d98a67235ba2a014b1cf54c3a85d55a0383cf051b4f1cf0afb41f63dd545582018cf60803f3ad4981ae059ac55510bc1a8017aaccd73f6e72d446fd56c07d369d185484ffe22acd5ce867e1ec2593c5d3d1fdad55d83ac94702ca4b78cedfec5b3b6092139b6b5898735ab17b4ad666bf789e66db48db177906c175f3264a34264b8a5edf10c3399b65dddb63f0ba11e5684b17fcfe2cfc8cb5bb28205324fe245c1df74d32fac140765bf946e43ef56be121a36fd0b87b5321b6ff386cc5a55456bed50ef9a82e0ce5ce4ebc3897f6662caa380d59e94bca5eb7f24aa7950e3c224389e784024442ca0783b479d80d727159ee7e6b6f851666872586a07a2867d2dbcda19f1f97869f112269fa4f4b942c072e4e215ee54d04dba964ca415c1b14cfc15f8955497179a3e8d1611ce1a0227a81063d774270fffd5ded68813b8f48de05da77059a7dbf8252500ec63e02ae9b59c60de7f547a72761a07318f4ff742cf6cbdf001c3f9b68f3539a7026358311b215f27f0bfa1596c0c7ef9bb28302716408bb3e4316fe7707711ecc4a1f41fb73cb9aad7b098863dd7a5820a4237a8f12b9ba40571b1eb60eeb57351971044a82a860b406c4ff9977dce3e408b28ea66a5c5a3b64ee54a890fe245d5c3b8c09816f68e8e5e13e30027710518c24f209804808734894f3f528a31fc6f37ee1467f68da8b8dc2a4d469bd588d1ddac91bddc6afa2c5628f04c2d0cfdf97d8f7a9e9d600bf12e6bfc1b4d13809777e5c9933d41903fe1bc2bfb5f089a1101e49795f3893994ea0ff574f1aedb666a53dd3b41d2123ed1172bb6417ed8e9a8dfe8ca8d437c7f83dc66b13e307e0c9dc7bceffb76204fea7f4ac94191843015b7655ece3ae9172dfe638681661f3f5b0ec122576be251b7581d595a8aae71063187b4e435b1ef5acde1944698eb14c5f8aed5fcf9edcc171f46cd6d86921f8af094466c04e54c3da488beb4d61624fad158a9c015d8184c50d23d0e206794121ece06e67ef930618f6bd140fb0f314156c2fca72d8060c315cd47811382d7768281d66e91f18fb9065e7b41e61a4cd9de6fa03ce7540535dfa14fb4076975acbd4b0682678c0273d95c905918d224e4eec51b341123120647f1a7f51b5dd92103d87ab5809240e709ea327d4c339dc936e57d157b9235c8332554ee4ceecb7603892b275d42b93086636ff1443662e64fc35d9bb99ab717c4b55e34a89db1b92f00a18868ab774d0f9a59be4c839de0943618382177722e4b1c85e44f912ff9d3e4d0cf6f0100000000000000001a48b504000000000ac21a8730ec000326970687c6b67320bd87b07315245d126d833637e05b4c3a2d60a57a617af2a11f7963715cf1d2c2c3572f53cc58f3a375dcc537c98d9319973f902d0463d6c3830cdf60165eb994e11b02862a78ecf17eb107dfb036c77d0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000007daedb4d46c96f3ca2edf971c259f4102726b41f5e88a1f8610fa62b15ac1ed27838b4e54f2865b3bab2345f26de33d6f9741dad539c52f3194e395ca18ccada23ff83592f924738f656bd89de215dbae5241e6d38be4536656b63782a03576469583bf7632f0f063103b8499d5806604e70da7d071e966741481f20757ba88963635f345dbb16bee51e4d6ea06b58ceb32cb5dc06eda1385447da53705ff60dc8f3a5a0fed2632eb7711cd99935bb5c37f0861e504a6566f081f7002bf04e2afc84022a4bc77e9f148268cccf168d36225a5e3d6d34f3b6c58f0500d6134bd557a05a6802b9f7e383f16bdb26666bc698fc983977ac46bb986f8264ebb918b5448283fc932a3d541689e46be0035b2e0ba56195efa48c77ef4ec2a5cc99fa6200619a52d240796eefc68d8ad4f0bbf728505aa685f2c65469936a056c811cf6931ca6c6eb33235221d63a640ac9e59b0b6966276f2a97197e36b3755de3a2c904fa0e95bdea24d9a6193e6ebe4828cb3c9d18fd26faf5a2bd2d462fd94cd927ad1ffcf940eb2979981fa1cde673549f614425e141eb61e034e3d3610cf089673af5c3bf9cf7dc36f18297af5adf3c00f5e5f195e817395992f668b763d4873ea030d4b4abdea0069eb728937c6068062383d59a55f992a94a15a0598887d65009d0f7a46fc3ede1d8eb3bcd3feede1ec86f12b32182ce05a60eb67324410c5fc6f02cf6cd53329a0d5175479c43f2013561f7a8a0d80d909ba71cc1f28eeabc4ab57f8c2b668735bd1476afc99a1b9a2997bd1da4ee86ccef626d835043a67082d26fc6512e4f9d8d36f2aaacaf09c918d0c78dd3a02ba9d7b4e33c0f6169070e7dc50b7ffe9e28b3dfa112c6843ae80a2dea8be2880cdd5077eeeb38c66948e4f6fbf694332d3c11c688384b2f74b4d088ba4d8f0cd7acac6f3d861949c80be77bdaeae837217bb9da5b6972e8a1eaa4dcff4f0c713d3a5dc2eec1cce427d838c41d317f440ede88a69d3a8a89fb6861a8e92b7ff9edf76411c70274d251937152a1b47ea54de129d16f1b2087136bafe07809a766c4d491b760fc086311694a4a24d8b0ecf809b183d450c799bfa3b68d22313a4d9f24ccaef0b879c3e916a3974b9e3835da91e8746d78c10ba2a69cff8f308b87ae30c530ef0177debbb2c910a784ee0ba5f47239fb03d7a883bdc94e9655c761b0adf981aa5e3fac94ab6ff3e51b2f286278da66607f380ee296127c3026ac442b03986902a77b5fbeb2e99d3d7017798945e61613436be480e51de3e5bd6b0cf93427c83d6fe46fe222fbf2f66a78c84e3cd198d766fe26a085df0c43ff93572eeeff351542db804b595b75fe216e8043a07ec77dd5143bea4e7686f60524f82aa99f4065031d3856aa802c01cad92b8f48fbeaad867f4a81a83bb34f4be0e44acdf16eafa22430ad107bd15d0474f802151cafe43ea2b4f15378c1317ac8b24c522f92c791fa2153972d18e06e32ac8c04561ac5e6d9e45c6766d846c5bccb67f5927fc41f4016cd2e68e0f886343cf42b0dd5a77f4b91194d265324f0ebb6fed85b9af20b4a6adcb1494df61ce409a91e6d6a8fc38a8ab020764697ac7df17b02a8298229f04e5f2f839b8791c17ba4fca107576b4a48ed6f24d5f0bfcac58f35e136ad3fae9d26974576b5e5969f7429c8b089a73fb78c8af4ec2f0f3df92fdbde224d7234b6356edcf93436c0906826d45cc56f81125157061b4cefdf2559edddedef5e4638ede5ddaab8f5a904cc91e1a89e1d3dca39452470d8c694f7e7ec77c4338732bc32a48a8077d79101648ed3d7f8c21d73e2a9700f8f3283c3515ab324ade3d748ab4f8c6aadc067b00af60b914a18fbffaccaccc64f8fb9ae3c2d7047e775f927dcae641bf5c7547b5e6aab57e097ee7f70b36f13e9aea90c4f158927f1e3c781c6cbf8c29b94f49b4a9a415f2dfede25459668a12821d4977aeb4ebf6349910817dae16bbabfdc9bcca9300d74ff079170ba0901e679631ddec6771ef11ff3dbf7dc2461206915439bc0d6f1cb0ff8dacd755e8bd206e13abf55ca46f4fc8e72c5c781250ae7d0b714929952fe474890371bb4bfd2b59d816fd73bd255917b17d15b89d0c5d966f9c1f6e1a066bc9e61d24cc34caa3a983818ff7c9e5e6bfa77c7fcddab95d8012948ef35ab201d9d9d493f1b78b951ff0872426ebee442b6c65c77ddfd764f3244f87833f91525c736787fe61d2201376ebe848292bd7a7da190dc8bf01effb52f14447c0e146ed67858b570c00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "515265", 1, -1555397373, 1953719636, "52f249ea4de55ec70b9edd47052e3bc584831fe653d2f6160d4fd9916f518df7"],
+	["fc9c8c6a0153dd13db6236573a2bfe61d929523d85f570246d96f5f5a9313fae53bf0305f101000000085251005263006a53ffffffff03d67c6b0500000000026363286028040000000006ac535163ac51a40430000000000001630000000000", "52", 0, -170510820, 3925833126, "b65221150be316f1a9164dc483a43697eb093574f9645717f61bd75fd2e4cb6a"],
+	["0400008085202f8902e70fe4e73ef87803613d4d0ca0f61a4c29ba0bf0f530ae75cf193a504fba2d3f0300000000fffffffff7f6682ccefbb0cc1c51b5295bbfa5d98a16c4fe7c1a72d5133dc1329cd83d90020000000863ac635263656565930914f001c94c1101000000000251536283da7300000000fbb0c0040000000001cc7b47b8d9f8b235cc345a48ae29505111b7f37ba600b1ebc98e7131a88457463e716b6a5cbedbe9f0274174936e1125ab76fb3b3b8d0dcfe17ca96405070b15a0fcc29bf629735228f9021deca5a6babe0fad848669279ab3ef4ddcb15170b694af1367cbe66d19170810af64ffbf44754c022f6ad82c0224a370d58007aaeff199b19ca1fe7806e36b2bb63a0b0eb5f59390fafa25bd699ec1c594f57081effd5fd95211d17fbab1773f0cc69bc9d197c913b0af7e6c84198a1bc924095e8c8f6cf742fb2d2f0e1bda0e543352b9c0fef10829a238c1b7724833ee1f3178c7ac2b0feaceddb95ff827cdb7de04c984aa6fe05ba440fbdc276d692dab876bb32e54c624129955a71d2d7c34a4e0a2e296ad2dde972fa7ed2f5421198b9275e92b8dbd59c6d4aaac251bf992f0451d245becd0d244fc9e27ad8777e4e6b863ba01effb52f14447c0e146ed67858b570c00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001d1199ba79dd4b38eaeafbd851c5d66d2a8867e747d8bd2d2d14c9331ef23ee13cb94eeaa3bea0aec49ac00dc2b868483976f12fdb9c64e4184d150b3bcc4e073ca4a7adafafc4c298c0de29e6096aff3fe8d146a30c21d1597d7c87a368bfd5041f4641e30d5c26e77f9061594363d47cdc20148821b7769a7ad7ffaa95c26519f5f8a312634225c73581f7dbc3113155638966d4efd6e5ca0b5b38155b85372b7eadcafddf8d0916d9b29b6050cfd8a7ffa3c66db5e39fda29ed04f72c7c096f6fbcd15ed806bba0a0fb4bb8164c1b30dc2d00c1b16d700310ef857012a97f18ec93fa22eef85d7e602a54a25a17c1b06eb9b9445f7ca627cfc57a72d51b73d861bfeac9337d51f81982f2aa4507e5872c3b23423e84a3557bb6db52d8e5d85a757dc21c68d1455d23f088f9989fbd3c46971445c5d2db2987f1830258afc51878cea480d7cf55126eee72841f1ba53fbffd2957a11f51aadfffedf29ec4faadc4dca1117d3cd35400047bb1f4ca9cca17c06540558b1165ea18ab4ed2be49aeee5cf78706adc31d2834a03c1c8431fe7b9dda287344351c045fc8915ea4f9136778360ec4b1ad48f5f109bb8a57b4ca1f81dbe2d303409d42c3c1a0fb938b2c41ca25cd1f2d93b6697f0ca4d43d00998e3b0b19ddce014b738422dcc5b5da2578f0ad82ea38d37aad98a640fa1cc1fb4162b62ab434c8a11ad786a4b9e71c247f2f1dfe22e9b51c33376268956c0a5304042047c9f655d2c8ffca4a04853f4b67180dbe440adafee76878e2b979534e4d46e699901f8e8f6b048eebdf4f1c09197e9edbc3b7c6794518f33f19f9cf9896a475cf4f6b1c9baead5b12c05b6e2a57abb0de2a90163dda34338d1d91af7a76c15d4cd14ccd4a066071ef21286d123ce6b37dcc22cdc47ba3bafd0e2fad790b4c125dd66f17cb75a8bb6dd1e69356e9cb3c0a6545eced2295d47a9f8ed97c9a2be63986dfce2c72987ae742b74680ad266a82a87f6a762b82959095ffe53fa39b6f75948433b8a5716d54e34a698f2ea14072e312cba55f5d31352531845b53eae476058659232ca3aa1994b42c0690dcc959999e90d7830f5a2ab0106427b37d83b117e0d143b7303fb749516f7ac3bb444c6f5b604461b7c145aaf27bd10aeab27a1b4fd20d41d29fc1c01ce062a674475730eb6e20116cd024101a8d43f0ed7b0ed5d2a8029731e729f403e52ab1a1940fff88a4d4652788d0593fde7a108bc8d81eb2aa60af5e34e0cee30c03be9fad8c7f4aa496706b9f7b2fe65b2a3bb26eb17270ebd0ad31a8d13ed7abbb4dad8c9a3fe97bdb43977b89f51e43d8db91197020000000000000000710c3e000000000073d7b485717ad880587f6fbc73afb52193c383fbb4253c92ad3dd080a33c789e01634a153eacf3388c84ba0455bd8cf3ded7744a500d22ce511caf1d53bb655a6af97a60e8b5f6c2762d99bdcc30c8e42b45eebf2c07db3b0995eb16f1d18bb90000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000080ba5d65b0d3b51e1934996af9125316d597a27caa304740fa50640ff5d82fce753cfe475d3b0d67ec7e813d7c3c1092c6f163e177be195e4c03e24ee3ae92efade56e6f308ad81b89cc108844023a5e325852b6a55f36ae3a1bbca78cc1dddf298bcaf4e16bf6c9a9bdfa8bac43edd5fdd9720949a4955fb69232a8811e2dd5875b1473e43f947afe8def870a4da92df24d354c213263b81d2bd938a07c9d6e65eb0b08f5398b97b63b3af5e8070a0a3607acbf8c638f415e2b52121460d2ae9494d60f65a024492790407c6bc12262e16056b820299cd4935b063a2ae16e5764fb25d4d421c6498454769c45d502eeba0b7563b5369600c6a4383d90cb687c316f7200e07eeef5e9ed65d3aed1fbcca8f7071ef96b71d30aae9ad46d9c836538aae518f8610398308f0e11ea504ace8ba6fe5b086aecde91646b1a308b22649cf066f5fc78180b7a1ba68dbcbdd5ea5763cbaa607b7e256f7ef65d964ba960faa0ac05bc82cdac159bd51a436a6fd1e70610c66864eab95ef81bbecfc351637f343b3f0ea057d4ad58041e84939bc01e4ebaf3478ea756958c1ad1831b3356925e85087d1622a25c88036872116756db571267004691b63adaac793767b9c444df1fe43e38dcef80f5dcd2f38653dd813056773524065086214793416270d42b66164f6023f79e56a2ba1b9afb3270c77ca7e647fbbeedd017b426d0ae21170aa8c2283e77f70a103b54eade6f52847fa46bf65d1ee6460ab314601e47d9aa7b2fa8461c7be4e69574199244f2d6d8541f2afd21fb068c20679a3b9f674e605c0da56ce40f5f17434a40b653dc700750f3b092316d32cb74862827f73c6de143e8cb41bbff2ac1d460519d38ffc9be3c53c06a6d32728a9c68477fdf42ba9a7bd4d4c43849ec007f159c7491414a65fd014cc09d399c0ce38518703eebb7a3c42eecb7657d8d9f891260e4370741d72d3e15ae811a0a6bd32d9015caa69671ce25f7867019198d528505442a0e855976762a60523d1e976f177d02fd1b2bd9a1e98e205ad6ca07e10e00c8a32a45e4ef65b7135695dfee6585e18ad9598230f13b83423b6946708430b1c23b06746335fd1e27340155906f8ae13b55fc664ab31233cae2f700ed22b160e6c4f6146ff3b86a9b5f9fd3815c2ed139eadb083372862921508def39b24e1dbeb9be49093c8fcfb4bdb8fd6b2f507fcdb9c3012a85b8dd28468ed13afafc10ad011bf591a22d7372793a0f8b436d466681dd8f3de8f336095c028713d36cb6d71c30285443d0e824d307c208f083a19cbdece320f109df8488acf71328abb23f4c804216605d4de017bb43d52f2383a982a237fcc820828e246748f5ecf87c60f994c0a0ff7cc5c738a668f2b987caa575a3efd07d41f7723ffb6e6cb76c1cdc6ad605060b60b42e965880c89f2d6233ae6324c9fefcdc114a771f04df591f0cf3f069688c6347088452d973d8df7d6d40645be93ecfd0c856f41e9fe9b4ed16c33434055d89f02e4f901b3c31a7883892a92c97317b78d8250387255149421612d5e293ff44b259cf09e8128adfa110d494b0a8ce6b404876c6948eac29bddeb0c165fdd89f1926892c759a2d8c4d7952a2b2b164d5f67ff2524f247a2c042a8573c6d67362ee10e32414adc45f0f68d0737d21b2aadcf71b7281f8f6f78df896e61a17a2392ffbe5a79959a0d73d5ddae4dfe17fbe42b8bde5b96cd478ea56f5d12214b3733f70cf9b73bcf9e3d49c55737af0cb51b2a84459cac34132b1ca579804e137d1eff77f11692c595781e0c6f74a70bcfcc362c9d2b8a98854db62fee6f779b8037991096583a500128e3514870b5ece1c6b354a91de998a78ae6661696a335c222f7300fc25540a67259650ee9b17256f989e73ad5cad7e84581ca6aae6c4c84190ed343dd6b5f8b50ed0e12a5267a71f5d4feafc45c32a2dba68a65bd342a8fe5b141021c1b89380a8f12d9127211badc1a9682a5d61a1d30d7fc9fbf70b1f91f876e6da7da954a1dd4939bdb7e9f13628a10788f832b5b6456da13f886bacf0d7b0833060f5be03d40eb99310623aa4208329e34d60fabd41088116832a42812ccf0b7849583f5f4ccad6ffc057aae6b2ed2679017d06c36ac061e180561ffd000000000000000015385305000000004c9cae0fd847132c3e7f05d23a52ffcc5060aa7bb3ecf7dd62c83d865a40a58cc0f2198a46f27ea39dc45ee3591365e1d4104398eb51fda051585b920c73e12e883f641675bd6043f39f0c5bbcb83c078230403755e1ce7959b11dca10a536110000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000075bce50a3ec49317681415e5ea2934c0ee556fd8f127abe2e1188be5aceab75ba6f1d9a777fcf3b487cddc686f652c5064481ec7cc89f303f6757ac7bace5549ed98cfa7e11e6009da3dfebbcc166a8d8e600ccf0f09f6d370502e422e96bba5aef502893cd2a84079b45db35079627b6588af9199d2edfe2655d03efd53adf871591dd483fcb9b4f2c5377c52a78708940ddf8012aa6fe20df1576c5ffc23b8ea8b53796c49a426f5d2330d09274d360f87086b352e58eb36d6bb75ec35a50caae5c783b77c521643d3a56651c96bff441be044cf6fbf13463bf561ab0fe971894f48c7666748dbae342534f2c3134560ff850af1b1d471312b4e66e77e90e85cb99e9ed3e430008c1ba77b2829fc34e10502b743afeabb47e3cd326f2f057967f2b7099187937e2033159d99fe4e8eb49fd03d988abfab5491fdea29773e58a854637e28f30a78aac0e07453a3529817777491c02dfd8e10b1e7d6dffd188093dfb3ca741a169fa37f5da6c3a63a59d67547fc07c0d578b08eeea195a5b0347815f51eab561ef0c6134115149b78f9a99d8ce68cda0730c8e4387ed1e43d2d897910b5d6ac8f11ba99c83e50360a673f2a73a2e6fdd8b11a781d750c0e9cfdd6ccbe81566a2883c0fb6664c110bf3e2b0ca9ef4296ab4850043a21fe55e7ffdbee1189958ef4d3ff4a472d4fa8ae123e8c27e776737e2d3608bf6fbcbd3fa94f1f72734438a759077dd0a377caed3e4a87605dd4255039c1b946e7df6d7c53b7b0e3f8bcba25fd58381d1a8e1a411a9f6410891cf8c83389966fa4aa1b961d30e3b0ab03ae80b26112b0dee10276b53d87407ceb7ffdd9cce2e1f30f7b6c5436b1601aae1ddfc741e1437169e13267cad526e7e316579bcd7c7f802d5a4657c57fdd2731b6fdf5ae3f1f1a248d238fd59ed7d33980535a5cf3204b182487ad16c8f7b0f080fa7117c5330fc7762ad305a1d2700dd501969f0f75cd748a250f477e1cf5b0c4d6dd136c789127cdb822b681225999cbb2739e4fa3409916a697945fa4aa94479f9e2aa8b8199ed93a0ee2eaef043a887f8c63d58138e676569b1f93b5e09e25f6dc9b0e8e11cf64a9250e3eb8b31b1c2b70db0c1ce4671e86773cbccfeec20e7f82c008e6d16376ee80289c770b01badba534950ebd30dba6ff619cb27a89aee76f43fa231e21b19759262be6d9aebb2d04a1374e9cd43ef81e479e616ae00482720231ad35ec1cda24b07f19c091d985f0b853fc502d46e0e285b3bdf73717c76cd2172397d037d43a2fba5dd3d2fa734871a506a3b6551970243d197c967b9faf41f6548f3a8f58ef9d767e8bef9c35285ae49c6c903080e1c1163c01c4f4215f46d3dc0a15d3db49cf329c4e022984c0e6cc442c15a4142d0267c11f6721b625658faa19d12c3d3b075aa04bd2c557012812d7e6894a318896f5ee47aa47048e797b726863d3c9187a13b9887d77bc402010785d559a96cb1bebcc4cc3ddbee2d6a305e47c380e8725a14e0781eddd15096ce23a26a25f94ff51dd82750235757124d422d26f13993d01378a62d65e750d2d843742c10f4d66a0a4b47f94cd043cab318817139e1ea805348e86aacf8f9ef7c79ee05999ce99c9e9ccbc2ce7e779a3304a496b0c379c3067706d186252315cff56447267fd3810b972a5a3250b248ed7a9311530c1517baa389fc9baed1ca73f117d4d4787b87f1963c1a3cb20a4d057f7504a6421bf6b0f9fad1189e82014bc294d6b01e45fd50810c738a2cb033940ff652c99cc38889e7a3f75be55f45e4f09c6fd5932f21d7fe099d7746dfb926cbf742290bd909ac03d67c6e3100b04fad48ee559c412aed4a1c01220ea2be135a142b4a79bc27ccc566a217e11babc4212e331b8e9b31dbbf3cdf7f414dabbd30079f9c35d65e16764a782bcf2ae385a3954b950fb78c673414c5ab62f9462c30005b21e3d18fb70a8b229ffa574187d921210ec323ffd1261bf5427efadf20c654b3a2b4229e1c99d7a3a5e58b5768b9830ba59a7d2e34df0fd14d39b025295e8e5be9406685b89ba2ab98336883729a03bb6915eae2d5b46cbbc656204d2fd97dced36a39c4de143555d81c3595e56cacbaddc041e4782def512670ae8ac4c966d4f33fd29b3cc9f1ea70093fb011c1a26548c545519778ae9d824b8b2cad864af524f83d54686fc3037a83aa904b4f687b054bb7de67b5b950359fa967e68b5ae9694d7969a00a7e614e1192e19678be7ad0f11af7d914cd0ee2dc9677e32832f1ed6144f0200000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "ac0000515100526351", 1, -743695038, 4122551051, "934b9a611e2e1dbfd73d67cc7d8365c80e4a67fa2a9b41cea8c47b9910885055"],
+	["0400008085202f89041cbdacb3f89e61004bb3c77ee86896d510bffd1fa57772cfae2c7a3e4d7e05060000000004516a5253ffffffff978480dc280e5de81c49760ae7ae075801e209c6487adbca48a02acdb9661c1d030000000551636a6a63ffffffff8abf527062de6f46787ca55b71509e77c6ad3df0bd9127521bf02d91c4f1c142010000000952635265516351536affffffff2599d602eaa298f073bce11d9e570125051dbecc591101c4372a55652f7bdd9b0100000007005363636aac00ffffffff02117215020000000002536398c4100200000000010000000000ceddae19c5e3b3030000000002c7d2acad91f00e188aff41cdb9ed32b74216a945bf0f8c90129c4d46fa3dafebe102352204ae1d02cb2b3518112592002bb9d17540d8021bf5088ddc0c7f6d61479f401a4c2e9b42150bd563712606d80147a04847b6268bb707a92101e980883188fa4c5650c8c1f2024ff6216c44d2c6fe4aed4ee7196f71b578794f10fc0f9d7eef69688dae655601e13712fe5b364d5a5ae743e4b36c534b57a734e3299519b1637be946d7787c4a01b835555c2dffe9e122be94cd86b49500b80332c1c0c2412db879855d39d5a1ef735650754a4a27c9fb9b59b0d7e24bc3eac6e713b229b2fcfc5f856756110699c1c94bf4a9732b2572b08390d7ff956aa072bb9e6979ab812c73b3be4ccc394b47400e99a424ee1e527b917a23977944e154b83513a5b7ca7effc9d4e1671229a54e975e32c12f0efbb6b1bb986ad7b1bf6b3064c2914cd0ee2dc9677e32832f1ed6144f02000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000aeadf08e35cd189c6bc59428f0b9feccf05bb6c570c28f90d6ee6261ab33a82ee32fc6bb419122857393bc0dc532f65633a7d141ccfdd652b1228c70f276e90ff31dcd87092f7d8a10782c93cc8d50050c2faba82fbccf733676eb48f4f5b64fb0fb3d32cf0181827ebf0062406022887e00eb43c0f949abd79ff279a3b8f157740d9bc5c343866c508631075b49610c9d01486c1bd9a41d1ef121067d1f11f39218d7bf18db5e5dd7f7fe684468e681acb00df1c0163a1f0631ba9544d2123df291c8a3638782b6aa65597d4d3964f2b4da4ec41323b008e664f0c92191193267da48e148d6b8e22aff0a0e8fd1fb09106e9ab301786d0761ff1846db8b02707b9c0ab52d6fb9e400fcf94b8fc5c5c329ec0f09923a6030bbac36bd888d2f553fc8a59a99ee262376ff464c97b3dfa4e9ffbb527359edee233420548f245334914cd0ee2dc9677e32832f1ed6144f02000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000025d5eb75455c6a9773564c676541d2bd5b3b84b8dd51dbba8d614f03c4b6da3e0e8978286110ee2c5f9b123d3bce14a920e46231fa18ee930076858447a1ef13433aed180cd7ee535098e6d9d6da64490615f3be849fd733ac7a5b6a1c1be2c3258787757e3fb824812e32a14169082f9be255faa9b6e3ab1e784a967c4480847c13cdcba2a91a5255360515bdb61f39c1f8e3f2132d4d8641322a5dbedb9efc2c6876efec50e193c357ffe3afe7a12d12be3771623a64089025c567c663ce05151c64048822006313985775e676b17ca23c10bd3b98b61c7e5576f8a5324c800d2f22a682c74ba47289ba77d8bb8cbf0aefc459e28a0fb3128c90651181746a7a4b76266a7749b64ec77b18aaf8fa78c697c41b74b056aae10bec6cd9ec95f9796f2c5d415b818410b867f247ac599b6047023ce1b6a861d80a7b37ea78d82f1f693532c4493e848883ecadf082440beda19ce32f6e0924c7fea3058ba13f355f84a21e65a19421ef4d52054ab4392dc05fbc2b3b17d70b16b22db1c76689c99a0b1c51a069c90e1b79e7641663c35cee9080b3a4900d57b17eea8bcd98fa5bdd9f554d386277bd43347d2debbaa9f3305a3ad4d41ae9d3582c2303d207bd30f4fd4a10d7f5354a6f208a88c4362d9f27846a5f98685cacc763e3c57e814eed2dd904df887a2b32bff369c54b988d6b30e7e9e4b6bef4b3c28f7b24b90458935f7b4503fac9cd38856433467f910bef6cfa1bf72308202f09be670768848eaacba705c0149251f1b23d62fa3458ec20797bda4460da09abd85a85dda94ae5d1e94f44399a56a068f2cf76d8b08ddd203a973d3cc1b6ca4ba9ea5538e6c29d2d308dcf54e731f12ac9a0b09bf49b90e57fcd030c9a75f3ed65e5376b38bdcabc86ffda66d545e1ce68e692fb0cbb8b0aded3771d54fd0bcc5a803062fcf4c7b9cd66a5f9bc79020fcacee67779b31b971482f3fe1d99a614575fa30ee960a9496aef033a591138701628ff3f80023452d2aebe38ec988dd4d92fad30bdb1af80b65bd88fc9590cadd137194ff0a21ae0a37d67d072ccaf1fda885c8bfa986b5270abd75e527d946b7b7fffb3cafbdb49d56236ad784983b535ed28ac56e89d3c8775af971a5ebb16582488d2425a671a54063468dfa0afa4c7081fcea514d883df10a29911b58eabb8287ecd7924576c6fc416c69af114e3b32be937529c4fa68e0f69572605e6762fd30edf5b3076762d5d17c9b74a389163f0d6d5c2db4509e962551a4f97bfdf35c3ffd08ed7789986b1e80efc0d87c1ffbad0380d097a6a82a75c2fddfb4783bbb71954466328d020bb05e6180569096829f6462837e37b2c8f7350e1568202d51636864fa5bb0256704a7e5c3ca6f1ab4f3256e73378edc2f6641687db67813badf3c1e808876bb0ef84b42244a7125999c7841b036f6eec6a3789432770a6a050f86fa24fea2cfc2c0055289bd71f31bc11dcdbce3190b732af6056969a1a6d0d2bbd4d9d2892ae5c84d9b4167ab9c2beb0d7c62f9f406aaee2648fd804cc08b58a315c5e96822f301dfe89f09a6e7c60144ec5a4bf27ef9972d047278b2982b01d493c6bbc6c58041214bca2ed65b601d9d712fae6260879287a9146ee588c71f623a59bed46bc97da4065cec3e4fb81e33cdf658d4845348ab8da8209a63bed240f34791fb79f883154232cdd54237248feb7ef4a02dad28e8d65c4d477cda3126e745f75660974c276d8ea747a4a92a4d535269987d425de4babe586753b778d6f5421c30d7bb3fc5b36fa87993f99c5f9592d306d93ad817241b56e2235cba385de6b06a9a5afede5739f822595c34a9004d547578edff8de1907c8cebd9f879e5ccb73c260dbc847745f9ddc393fe7c23f852f9e319572c3b8f4e2e6cbe9e17dc510c016039b4eb19b225d19e885c565d1926f21f27084015d004b8de69f243496f96668e1f6559c6ab1e421ef5df30755581614dab922a03cba8512f1e38c5dc5d4bdf99d223cec335ebb44c8394572ca9608fab4dc20995ed82d754fe3a414db3a9ad6ef0d12b9b0536a88e0faf22314541e9eb8b3dc3d84524b6fb16b4be6eafef30816f70b7c2e9345e4b328f498dfe1f559cb97584189f24f3489fdcea670e359994c13817727d12536443a9afc77b55ad013a780c4d805680b184fe8557bb4ed13b33b00506fc12c693e3176802d8fd5d9af73fcda15e90091c7efad4c3fbf5651730bddd804606f6a3e13434f8bb5a1c4d454d45aea44879e3a3d35c258af20eb1c7313d094a47efb48c789f1d98b200957fd86df934c2f9b320937a0f907117993c78ba8d3eb2b073510ebfe0a17cf645f7d3e542b1b3b3b165b1e29eee4fde9f28c53050870f40d1db30beaf0f28dfdee9d3e3523718a0724dfe35e45f49193675788456228a8ee3f858ecbfb932b045502840c2252a49cc709ed61da54f6ee67c9d069c1111e1a7c8eb065ec6d4b9b78b4ab308c70b953230344feb0201071b7ecca5d937e8e1131db27dccb9f93df504f89020554bad5e20dca09f7cc8b79167a4ad7912b1c6021069b83d1f8f6bc2775144f64aa6b4450c78ae470fe3b77466e06512b351d48345627d09698a9d9a5575e996d44d73000ec966c65ea33dd2092c04268db497b493bb6fb6a7876dcce73ed4f6763c1957020000000000000000fe19080300000000b865ec25e9d7fe88ed18dd3b75fc4c7a17a5105cc9e1814e489dfc3b6a377ff5ef572ad9d682a5ecc7e0f44c644f325dde62589ad2171dcded70866782acbb6bf65d4acacbfa15b617544ff17b877792220841374c3e7510a6696a789788014b0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000062540ee1dd0ad0752370fd3b1933f41fa904d4671570c8f950882e50d88fd31c6323d90bef0069fd8797419fe65884901bb8a90e114414453fdc92dec2de469a5316a125aaa2f1be923fd7d4aeb574fb4ae2cc5cc7344638c46f54d2ffd0514e133dbb38db136fd8f68a96cced45ba8d67b2f44ba0cf1ff4a19d78dc5e6135919fa94a587bff4809343743a407ae082ec5e13375be4f624c632682c2992db757cb0c2d4678cdbae7af24b48ceea00c096dde5be3aa21784698986a90c28b6decea6cd2f489f90949cfaa39b88877b8f68d9abc239eed3b2d021d37c1d5c1688a19ef373a61edddc3ef489a3938411651b03e4137de0e782dfc49e1b8b15129d942552962fcb4f233a67d3ba430b26cb4af225834561995ba388b9952062dafc68d8c4956f712d7384c6dda90952d6cc9cc2ff3fb795686c8a74e85771a4bbb1bcc1f999841c19714937b5954258f546953ee3d1dd63d78a29291d834c81f30a7b75b7cd097a51a2ede4b9ed51c20bc8df742a977a3f1fe912c4d100ff30ae730c1f810328940e9045a27afb3fd71cca89b1bf1e21e277bda44def43fa6dc422ed07bd36664472aa4c4c137f86b23380937c1823ab7ee09a6f28c535c390bb3edf226a734b76e3150eb6f8e27189ebac036ef12bcee239537037ebf1b6322c668312ccf097de19d4767a99a0eb69b50758e9a8e99099b340f1fc4622723fbd281f27fa7858d482b422da9516cd89e14665a9da20caf6e83d678a2181ae37b1d060728237923adb1d833b884b930ad9cc0299c04c09a3fa428543343101b1290139251b2a578c054c219b5006c7657288a136b17f28b6a7c08608393c86d33337b83ac2491e285b78b0d20919ed8db900f1e667bd09372dc816219490cca6745bb0436ed7c5bc1f7eae8a1d7961c489913451f44ba470cc76828d4d255fec2f85c2ce83255f9a6fc866e4fe75807da6e0fe570c6955cf37f3674b8eff0348a7581d4fd4eabbd0125c8ea38a053b51c2f41cc751fbd71ce250125750b65755758391c4e1a56a3e28a53fca0dee4859e8c94e11820e7116b4d4f17484b02bd158228623df5155bf59e3928e5add1638a47d963c775e1a9b7ecedb2785b767cbda2d5bd97d1172c3b9398c53b5cb389a356b4a5a4124324e89e3760c0e7331f772ab6a51084a7712b4b4c58b6ea3bcb0ece58534b373ea9e1e81d5447e230ce7a569185362eb57c748ab14838126778afe427f8627a063e39473e5ac87b9525cc98dae9ff76eff1a7753b76ad5609ccbf57dcae374c998d31fe5c34b8049f29bbf1c03fbe20d9dc44ebdaf787f4f9f93322d669b492e8dd45286b49054688189745f46130ce1ede1ba7d3e2c94fc385430fe4e9e9f4a9d22c089cb58b87d3dd68c04301fc3291dd41e12f0b5ee72cec31ca0c81faf78c517a17c4786ac44406323f11dbd36b13c664492dc94f5f5a8e2c2a3aea8fd9934def53ac667b5b0c4383ea16a3bfa3f3229f8c13e3e52696a6c30f86978ead11409a77ba88ed6f29d247b084215b93a927c316ba2985543b751c1637d6d2f5706c104dbdc235f71058dcc3f6eaa52e9de594111471062299622391250ec39096edd0888d5bdfa8a8cbc641e7bfc8ff2a673f250c74ca98a1c5d4b4060465f5ca58497e90e3307cefa93857b4c558de265e49111f0d246036d143445f4f6f60d35c57cb5330f9e71f94d4939b60fa7f133448b7023069324c958764fc581f6e7c7be5180cd28d7b6d4c4e95289329ceccd069ccecf0d530a46aa917e9c7681b7ed86704c8c7d66170453fb2f26ab92ab01861136b018cd204d8437173382df2583f04330d5353a6b7d0f1b7403d44489a0abb932d8bb2fdaa2b786c56573d0f6abb1826fe4456e689328de6305607d1b96e52500e34f91cef24b4bcd52595de33251eb5f7d7b06f0c5617f37bfb407125acbe1b8cc2a1d52c2a2c35139119b709955f1253b36a4da6acc09dbd19548273cf4dc0c106d5cea386dd4ee9e728844be7caae2925df3a0d64a0e69b76bb35e45db033318eaa2794194c6b4a7670a7253af6609d11eb54726a5d9df5cf76fca557ca3ed0d7e1826eb0fd95e480f509e1fa5f3eba3858930ad37999f20679000dbfdcf749182adc57063ad6b2a7f10000000000000000c6e50b040000000002b568bc312a13c8d5276a5311f9f52a40bcd563328dc86bd3746bd2886bda85526b06eefb0942c26cf93617c4c032b60e733d534d8190251f8a9b1e2907854f2f764960343a951762794541439416c11d034ab0c024d0452aff4be1893ae528000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000006d100a6d8abb5e9f76ec4fb1cd2ac611f475972ff8e6257ae1b6b352d1c4e70b622f8bc536e30f06c49e7012986b7b63669146d02cafdd7bbde9cb5f1f7977c57f2c915269442c17ca993bb2445cad3f0fd2d016a713fd4ed199a872c08259c308bf4ba9a23c667305d81e179bbdb0e981721e4aa2a739cce091c32456733d61e3c10afc7143c3dc8adc41c4eee8b7003800a6baa3740aa4dbb92efb7c8898117fd1238f34ba9b6a618f08258b0408ae5c504af872d967195d52dd99469d68476be629494c2948190f3f17a3629d26350944fc42235a1588f8ab5fb198fafa0f9bd7e960fc6209c20d414c1e374f3de70ace6c8968198a63fe6774586b7afb983acd09d284eec7acf9bd78ad0a323bb29ffb780a9dcd46f1ccb16f031caa6e359520eb8f052664de79cb9276bcbc5fdbc2f84d8845f2337bd45e781684a97bcd99a64bf18a1941d9f83837ed40eff9e06465c862c583e846f821795b21413f4bab4fc0a463b672706b2e9dc3b700f9a45fd9ca08bc109abcfda5a5c1355b5c4d6bd9ca6e8d4ecf1ee514577b3d7acd0f6530b6a2031842410c151ef9e2f520054b8209705246ec1173951b6fefeaf6861e777aaded976b03b7d45b389aca818054862356261d67657e1a938d5fbf5e8a5e9f7f05c9cc9b96de3604af8a13defb9b98dfc4169db3647e6fef91d8bd00c11c0ced205e4a9822db06a26d4072bb237f8b2d7c0cc64422006bd106ec439fdbdcb3f50bad212e426f5ef349c88d6459f613777d176095c9dd5e6d1c4c940c8834e55b0e9949a3c342fa1a65c9a5bbfc2669df5731798dce5a30707108573fb70f23d3bfcdf8b470e8b5304c2c01b067ee5e3c1ab0fd5b3945c19be49ebdbba1fec383ff4ae6f61fe76d431784a16b8fddc422051e6bd8b154347bc4009b59bdfcb9d0b693e65bb32f852dd660827039fbf2d9009150ac05f44e109177489d1fd88ac6a7ab035226e4f1aa82829742164d86cf59ae076ad20c4edcaa73d0b5881283a51c70268ee18a8c1e642460f5a82162ddc7e0a09b1d7cac2dcdffb203420eaf33ee2a97f8dd6c5ef2f2508142630839324394d23f7155e5657685b44798971397bebc83da187f54d83542c9b613cc6f0c206a7a012bc021521ed2f880b35cb2730223f1f45b0965b73ab5e75731e03733b970f83a2c96841af4c8fcbc1a7dce0beff10d13e4687265c6a9e92567c074d0ef8b3c85a01aa8f354e12066d82f967327dd0468bc417d3978e2f230b8614d8314af8f96d54e62da5532f6656d4b9ae7dad28fb192f334ac2a90948210819ab38739818ad0aa827cb6ef21b1aaeb8ca99a4ed2d9dbf896d66d3873b32366cfca8cfa02deb61eb4568f3f77dbeff5fd6a04360a677d8c48a386514f267ef2a3f46739f50513f59bc16701dbe5dc859909c543d5f3aa31dd8bc35371f6836fdbb03f9552a2518ea57fe17c81916e884221eec844030d06d9553563d00a095d42b71af236f0abde0fb03d78299e918074e0fde14e6638fc8c6bca23dc543d4eb2a95aba1e918f871ff3ed040ba1d5a231d659ed3548be688872ec1f15906b007bb1a648530d9cdcce6b8fdd56cb3b8ef073e7e78db8be440876312cdced662025e2081db49c01669c6e63ee32f6360b9e7a81f6065a9310145be176c0a96493798a61ef6d2beb0f1b1b5527d1dfbcf399b475c3bcfb44273c27972abeca80d3b070318e3f8ff08e04a80dc866eb8b4a308f09a595bd6c91dd92baca064be231208e5f491a27edc3a666ca52ac0358b5f0ca25fd47207ffc370d5982a7a8e16aacaa183bdc6b598ec9075c375d69b9e51efb8cd49034c77c3b27bfc7e45b1fabc9ea5c3cddce7d491b6a9a35e6b1e102cec1e5bb6463d91fa2e7de4e043e172d5c7965a38529847af6dfa13c14cbe9c07e9b9ff81c04d352296c942568d3fec96f539ab558ea597fe3326ba6664c4935679c0a78e510f70f2ed38cfb463fa6f63bc4face7ce68e3ea1d0d7550ab53f0a6dcfce8be2f2600c0034c6f665300b493ade4d1bc5fbaba3256985f524564a96be13a99e4b57e8e72cc14d9949cbe6bbfca4b7bda2909e9244ec301b11ca0dfe5c885008c871722e6a1f7cfb7ca431205ef1cf8ed400d1c1a5754dcc827bbcd78de61e7e19f9c39efbea03817a3a06e7f7c9fd8e70bd82ef12212f42e78fb6336193f4de815b2e360060227402de108060fb15deb100fa2ef2f4969b9a2d59be4d063c52ef08f8c3d58e27d089ae9e11765b3d532e8ea4eed3a25413d2a630650000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "0063ac", 3, -1764150046, 1953719636, "66f80138588cb96c376531b9e34341d37224347c782cbc8e0388d6fbe62192a0"],
+	["3a47e4640215cd4dbbced056b35f2afad3cefe0c8afbc1cee52b28fda990000e678a80580d020000000952005253536a6352acd44007715cbaf5a5b2088915aab4a9f15334aaec8d5fe4061c811e4942d304b378782c3f0100000009510051535252516353ffffffff0489859504000000000953526a535253515251b4dae50500000000056aac525152654e7901000000000951636a53acacacac655f675f0500000000036a5151de15bd3800", "", 0, -621638346, 1991772603, "d17ada9a1b0f7c32f352538a74b65d4ff6a41d5f9c5262f881acff81ca90b01d"],
+	["6d793d3301eabe91fc18eac713f7eb540ba9c784df48b84a4aed5c5f2bdf3a9c0e8f554f400300000002ac00b016fe700299e7d00300000000086a51526352516a65ccdc50010000000008ac00636553656a5119b490c800", "6aac53ac65", 0, -1655355370, 1991772603, "46ce850cc5e10a61072035c27c010a621e3ffcfa5a987aaa1abc000e57b8895f"],
+	["030000807082c40301e70ca6c31012dd0e2731ae900fb65f6d4472fcb4a80c7d5261f1d0fd680708a80300000004535163526cd9a42f0307251d030000000002655326880301000000000453516365ee2285040000000008536a5253516351518698defb0000000000", "5151ac6a52", 0, -445645464, 3925833126, "87c54a4c2fcd868f211ba606799077cd815c8a8ed1f717489522ddd9176b9052"],
+	["030000807082c40301d7c4df2692e15f80464710f65fd1cdd6af3e013cba9d10666ef87c779c66d49403000000075351ac53006553ffffffff0494f90d0200000000015136c0c20300000000076a5353006aac53537cf801000000000551ac526551e60702030000000007535352516a6aac00000000fd45e81200", "536a536a", 0, 1108546685, 4179206552, "3371633b585dd9d56d391ed5ecc2a8127f0bb83dcb74b9bdc361fdd64e6f05e0"],
+	["a9c8157304576791921fe1e08216e1373951a95047b5f5216ece95b9a042057c47d6d2632103000000025200ffffffffc140f5f392594ace0a08f063c5ea36ec4138506f6073adbfcc1732f9344773c902000000066565636a6365097982fb1af6930d406a6bc8fc86e7d31224b12ee58ba20b846add41ed6fccc516151e760100000005526a63636affffffffffeac05923874b96d9b0778cdb0ae082e2c526618a4a993b8b6f31ae09ed68040200000000ffffffff04bc1b9e050000000007005165535351527a83960100000000036363005a4af90400000000086352ac5265520000783a44010000000004536363630000000000", "63ac", 3, 602780423, 0, "0b5f48aa65c90e032db10bea7e0d6516b6b059a51551ada2afaad83c996aaf99"],
+	["d5bd731001322a7c9463647c634f8e1312792e6adb13e01c207400aaddb98cd2532586430301000000086a636a000063656affffffff0265a6c20500000000035265003a12fa010000000005005100acac0000000000", "526563", 0, -953697638, 4179206552, "fb47d45f95beef60cca013d03b5c1712076f494cba3da406012d8f6bb02978fe"],
+	["1e5ffa5002a2d6563cef1cc3a4236ca78b68d4f93138cee0e570235cc010933f66c1fbfd70010000000752526a5353655224cdc64c7d9f1c0fb9ecad4e9ee5aebc3b9bdf6a44bd4abd2cb42a88e25f35c170be34740100000005636552ac00f27d118402585e360100000000003535ee0300000000056552006a630000000000", "", 1, -677423101, 4179206552, "67e2a1a098614ca506eeef56bc0ddc2183dd327afbf3625abeb2308ea0a5129e"],
+	["33de1609023843518f50a55607257332ec7247e6bee289d0d809c373de280c300ede125f3d0100000004530052637381ee63972257c9e46f18a060c68a6969cd017b59fa5a7379a5323ee46d3df1589dd9c5020000000463510065ffffffff03fed64d0500000000055151acacac624921050000000001ac28d7fe010000000000d5f18d7900", "006352", 1, -1330762198, 0, "8c8496258e649ad6927ffd3f02500af9502f98760a56fd642c53c7b5b9ae7ca7"],
+	["483cd079030115dd2b537a6e8688412c3e6476a9c73806558234ae0ed97f53a16747367d3802000000075351516365656affffffffff57f142f015c15e376d55a44d61f55839c23fde78a3088bf52f3cf72a720aa6030000000752acac53630051a4f8db1d6cd1bf87bec4778939f1700540fa5f8c194819504369f6c96adf5a5cc727da60010000000553526a5265dfce320e0448818a030000000008ac6aac6a53ac5263d9892e0100000000045151ac5124e0230000000000046a516a6a815ee60000000000070065acac6a5165b25d32ab00", "536553515165", 0, 340508925, 1991772603, "ebd289344a6f45a7dd76d1a8324f06a545a84366d3751be480c935d02f2dba80"],
+	["0400008085202f890389dc37249c8e1c2dcd6d846800459bbb8d6aa028e3b91be4f5698530a5f2c5140200000001acc85c0a3a15da47c425585dcbc18f4259d21b7df5c2141d3830789ac190f683b6fd591d760100000003526a00ffffffffa6b47dd07744b4fe0490dca4a40c95abe3e20910bbdef7ba67f180a7b9dd1057010000000951006a00ac5263ac6acb65aa5b02b8987f030000000005526a6363518a7f1e040000000009636a636351ac526aac00000000000000009f53c804000000000337a61671257777cabd21f2bdb1e3b7082f031e0440383e3110d96156cbf388c9234210c7d088bc4b19cb137dbc555b36c95216e0a271b4128f00f345e801565f95d105697d52a6434ab0c0b3d688cf5bbaf5440da3cb9523da69034c716c652cae5208017832591c41d298daab409e44a0cfa4e02b639361dedf09108659f4b89e1ab763fff83fec54c04132fd5c043240b99e770206ab4a4b8f7e392b8830604913d92c7d8fd18412125df11c8a28543ac5c8c9fff784920766c7cb0232c25ba60e97a87cc56454a80b687d1edae73847081451d3f0c678c6c283e6041b15431ff7a768c8ea9a3bd304ad45ceed0adad33bb7ac2f45b91a6ec23885b9b312992522950536e441033acf89abdd0ca0cd6643c8425b923a33c9b61017321756dd3fb04e88445fa5418f1f950e9b42aff736e49d3808cd46e3594379ac4b276f585b3d532e8ea4eed3a25413d2a63065000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000007bbb75ec71c6a29a856931186c98b678a2344f8e6d19f9ce51fd19fe0b4f791e1454181c0c61126ec7b028e9c99fae8b228da6818725d355c3b06b576f47c768f49f676c8e0f0c32755b1a1b35e1c81f719a4dbf41f185763b552aefe393f55f67ece95c23a0d3dec84dc173b3e0cd620f951b62838ad84449e015263ac232b33f422f779de1e0924478c5e1f81fab811466bf0eedbebdef603fd42bcb6aa9d559ea9c989a18de7f5cef36a0866ce38a4624ca28892747aad326775a4200282ee1f1a8cebad69a47de5e1a5d7e990afeb6f9ffb212acb3c60a2b5beb656158edc708e1e21a948ae5cca9ea5dfb57440d88a1a677cdd8627d71780bf1a1d26b66e64ec6253f741107c6ed8d40997051915457eea6c5bd6d740bbb197b0ef21d73a4686c0852bef35e63f367d4321ad9e4ec864400e61258e531fe1460b868146b5b3d532e8ea4eed3a25413d2a630650000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000037c5c2f0406616ccde77c06e27bf9188c461561a5c3803a10240df32df89751f14f326b2cf31dbbb341611ca14a04c0b22233cb5b548636d9c0afdd965e49229379406ad4324bee5d40e9f07ed38df4f0c8827d54b06db784fb05eb25a5a6b4eb416ef9e9eed51ec34736c72c27062c15c96b4824ad0c9d6020a615e6372f1dd6fae7a3c39c42769df227381fa4e9723385ddc68c25bbf3f976e4a93c9666c66ab478a3922f0c2088b7d097de6b9209751e7c9ef56a9284793ce4faea1d99430a60144132ea713ebe46653b14b58f4a471c8cf349e2650b4078d54bb39c062023e18ce7f2e7db744c731ec7006d0d276b0aff6d4ef7a05650e30641f191304bacf38c1af98f1502cda5744bc4d8160e3329f9171b2d0d122152beddf52cd0b80d9c07b1a71ad58e8fa77d3624a882b323df7cd7fab478df895496373d06695345b3d532e8ea4eed3a25413d2a63065000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000496d540071d4e667733347542eb31c211a46e7775bb4cc7b07d2523516f5050cef814a46596f9d292642a6e9b528aaa851e92748197dce05aad79fcd0a641a46b4fbe518bf0d384d386070738c0ed7c9674974519d56d52097187373ebac68cd93ec354ec4ca0f054be35b42322be40e2b797ed699362e41c667b8c8aa2f1b7f7efae21a52ca8b9f9cb1d5cde1ae155a9106521ba0e7edfae1cf2d3e5756026330f122711d7f53cf56c028871f03191fb393413f7331d25533d600eb1a7b220567a3ccf17c3ef61367404b1796e91a7161a2c4b57ea933e5e79c0076994a9b5e7a668db5ae08cc619367d6869e55e9c93149d43b658de6a95e9117991fa27cecc0554a59b31adcb020d1d9766d7022e8a5d9ce28090a998a9d1773674f2da949cdd10857d56d8da58f7b6e5ad4171df29012aca230ca73166bcd882515efe2c13c7c29fb25528fe2cee62d0d4b4e2b124138163657dd465ac501711125bf639c1a0242b7539b6f2820cb36dbef635caff5cc3e5f5060fe6a8f5e2c828aa72ce25f04858c66a0e80bc67b7933c60cbf13a6af65bfdd4329fbf6164cf64b43efcfb3ebeaef050873111c1bf01bffc0159c1fad664fa2b49b242e9303bdc0bfce713abe8bfc4fefd5b44879fc5974f41c8446010822fec092b16faf20f12489fee4c0123e6115878ce00e7b61f953e8f8ea3fc804ef8d9272840dc500b29fbdc14ac750486db5b4468669d34db8497053c4ed686d1f60ab656edf517ee53b8ef64d0dfdc0d6633034c08cfff9761ab7e0aa9ee14dc71ff93ea7689aad3e0a879b461c5eed3299da5ddbe8a92b09da68f226b368cc93d672cc18fd976767c0843f83ff1cbaafddf903c0d16bdb24f1b4accf83925f93e452e347acd0ba0301e7ffbc063f7b0b157fc228c279bdce0f1005e4c7b9508b5aac02ecf49e40abef42028e55995bed6d1f09d9146c318098b396f19e118b58b7a4ca8e0c1e4865b9881c330280d971668ff4eaa3e168845c752261f27f24aac65bebd8e2249aab21bfbfd56e192d9038be2b0779499f76ac3847ebb051effa30fcd64bcf886bce64c29b521566695510027ff2d6b73ddf9f7384dfe4e853f7199643e6bfb757c09a465e77a07c7d7226053bd17c128790447e1c4d9741cfb61e5f4910dc93bb970793143a875e8be46e518dd24fc8f8fc4b815e792bf0679c8a5330d7cf3f5a197595b1695a1811df0e50472a46d8c33c5081298ad7bb7f85160402567beaee5ef60389b670e6bff70588401e5bb2fce7ecd4922b9048a9432b45cbd7984c24598d6c9fd7e11b585e35c08316ccb39148a8324644e464890515c940efa8c1997677116c5ecab0ff2f3e4ce60d715034698d04d6435b4cb7d8e152876b3cf7c20854a7617978aea5559f98272919ce0908dcbe463550d9b23266853b227f7db50cb0dfcaa9e5535917f5dd3b88e3edce16d44283007812dfcb841c64f0014adfb54082943016216f285cec837ee9d386cf06fb239a0a113eda8b1a8dc67faf616cc0d1ea1e3cceec88c8b9facc17b781a8324b6825bd57b433fdf76a949ec8045f9d18d73b2b3af159a602cd79222338aaf94a783f8d868ec66fa92688bcfa87f42ca796940c283e5cafe02e530e07d771439259fba7a64d80b3aba1f62b80e3fbe346a70d4102503b926bef9a073cd052effc6b1ad4069c4e223768857f305d1ac8f3a7cb54db72c162287e47f4b7a0e1b9b8710b1e302376a7aded9a3bdebfeefae325fa833526e35a82746ddcf506df58c14ae3d6cb67eb0b2c5ebf96042a15dadf31abf9f2e6b1764795ce44180e8e95778fb091c11a49fe9af95dcc76b2e01e66acc0ae922105fbb9ab2e756b62c0bf2cfaa488a403510f25a509f81efd4e5398966388220e57107b709b918ebb98e189801ae0a9a6f39cae8108b7d3027b829b6202c89d3f549eaeab3094a65289fc286b7c90d47e65785bb46fbed785e5bb8df790b4bd18cfd4c9d690f03f552de39349b39b91a6bf9bc6819f6cb446cffe1b4532d9adda892801a250cf41e4fa6ba6ad3778b6f9e2e623168867dd7dd64608ba44d51ecda810bb1de99bdb1a901a850ff1af9cdf667fc1344ca1f325be8db30e276a273c78b7789217f5a511f5d3d063f9caa0ccadb59bd141bee0548f3dc4d1954b035674eb059eb6429f31f3ff76a84bce39e5cddf50df861f8179be755b24068f8fe688c4276ef7dc87775b6a9c1206567fe9cfca4ac13d3a6f407a1527ec198b626507b88e83015177033efcea2faac340f8c6dd8a02775eaa6cc2338b937b67cfc44f2480f2ad62b5d044c2527b56510e2f67c0e4ebfc36e3e9331342b693707d5f6c04ed27c5062e6e90de5fba261c6e3d7a15f504d92ccfd7097de227f009fab311e68511ede168d37699028690031a06cd8ffd4cb3e3c9c43a3cf146bbe8884f1ee819df75af0202603a8f321eea17e690183883f7b764203ac935a861a5b264674c57590f3abb60b7e947c892d5c406dc80e0a620a3846eed4e09db02bb8369c864a9bde9ac6ae4d37af6c2a929cfc1541f07f335f045afe07303c5f1e14643a9a3ffbef0e2b5e25c7148925ff772203dbfa2c4bc5e34af89f4e627be55c9530d6a66e710e68dcfc60e6742a4abaa1bdd799a1a61bd4ce146d7782e68aba824dcf460f595bf92d56c3373774c6e97f78ace853e0d6e05b5d0bd42a172ae55b6c4dad74849808eec4e9a9ad82a69fc7b8fb3c9e95f0b793e38dbbadcf0dfb3794d0508b33548d2f7477ef94513145e4f78fa43185ade549c8facd515c121082fee26c23b1507117ecd4a1a4137a12e63a26cf33319e5261ffafc97bab0676e2805ca44b2016f3719bd8c625532ec3b241cbbd9e7fc8594ce280e70915c1bfddb2894b918ddd6659d1cfc62fa2f0a1728d93778ad4a52dea4bad0df28235c453b3e6a35ebff164cce27d8b6aaa2c171f6c13868347c3c540d106d9450a63e35e9c6876b0b6d21f277c65be0919edfbd093272f8a97fb72ffc467a0d8d95c1f45a446554c0ca0bca8ee98948fe4815a8dfa1915f2070df1b7fc8d6f96d20a154201537dc752a7c591b5c081d43ba477c72c7781692b99d0a49e2bba8a144824b51cd476e5225933abc9bee8631370aec17aeaa988827161be63244f353e73355483b6926fd9f1bc455e30910c7046c3fda7305fcb3ec4f3616cac81529c497ac6d65a2927804727277e4f37916cb7e187412ed2e197dc828328cff468728525ff4f4743684ec29172165ffafc6ee0dc0099b9312dc0a516c3768df5374fb5fd3efa77e793ebcbf42bd6ed68f472cbc50c834fb7be93ec194de60d21af997cb43e45f6c448fdc826c25a3312efe75d564b6324dbd171080166518d4cb340bd232d33a5aef983517d03969028b517fbf5625b260596d5692649675b4044ce51a13c7d5768ebb557eabde41919fbcca64eb2820a59de3ac8eec912987c862bad679cd60ab8d11b7fc3bd29f9f55bc95590c839ef47ddd04178f5d7dc7175e317830e0518d9d22075625012bb29fec76a0654367b13d109cc3cc5ec549e9d8089f9f2f57b94464eddbaa9ecbc8918cb5bbf0f834af8f1af4cb2a206854f3c8b0ed160b3f7270f4e199770099160620cf24eb74d0b2f29b65301a18be52e6c80069573131aa9e7317209cd041ac9d140a21e8aff0dd049ce61b53d94b02a09655a96379da744b75da04cbbef59b94799b2fd069fc6c38e59c43e23f12b3ba3bf421c40614d8895973069d0e2b9b2755cc541841c4d47cce844f9b6e6c00b0a86cf64ef10bed0eb412dc3037973bf49f6a91d3f5ab7da5c844a9575cb7a4062683396762fd1421dbeaa931a4f855018683920644ba8b44eb9dafe4755a68d99381004ad818263956f9debd8c4ff87f19cb1c8dc20a6ef8849cb0ca6c0a71b054fac6096bf3c93b0781c29621b2d94524fecae404b78572f04ca5b03ac17e6b7ccca57e075bfae5be4c127d412c7acee618c9b3438ab279263097c3638d85cdd3bcd6b160569d2b8316f332f7b6cdc49d28b679026ca9bd9d576956be426ebf424c4c6c243231a4a88c92a0d925c6b8df253f1e9263bc82904f9d00ebb39aaaf668d370528087603b224bad8eb0c955fa48e715e99d0b95491cbc54aa795ae26c9bd43c36fa00222c112f7350308bfef9d7328983cd3454c5574eb73c37d676b15c13090c050dd2ba816deca67171455a6f558895448a59ffda82fe6b9c6b8848a019dd6670599a81546de249156a75f5688ad8c004a00843fd14d3da79f4ff173c4a908e5260f92985dde575f9aa5e737b8b4c55cc773ca0175416054cdeb305633f16488464b51f8988c0ea937b41b6537d06c56c67715ce8e5f70c87f842a91786d6b185cca03d2f7cbd9df196a28aab8ef03ce1a545f846858bcc3c99cfa03442ec37f06d201caac3e21411d5b6353cca4f4954ee892cfd04637fcdce61ec86360896bbb71b8dc081268a2520aa4791a67ff2b346d49370793954e83e05c12d34d03afa59880f8a4d1dba55a177668f116ef459bfeccef7dab03b3a568775bfe7f22c7a9d1ca8a1539b5062a0f34065090213ff08c3b2900c32b6db4a8e2572e17e14f7fa085c9f6106845a26a46c3328262c52ce6dfe9f73b98db4f4cc6adcda2020c498d50478c0cb16dba66729550b894d941ed0e2d88ca008d0f3133f6022bbde59631607d1f16a26a8013b42623ba691dcac647ffdd472ca773aeece07e7398c119bf94908975c685e4c33f643d6589aa5c83a26e5d388fc82225d130093cbc6ed2157cce2ac650bd55c8f187d5d3290e0084c49d80ec7e87807eaf74f0f7756e3c9276f1353a8aa02f66642c39cda83bae07735585039bdc55f18aa7b82e16aa374e494c3d6984a3ca1b36838215f77833a8d0dfb4c2daef1f549a58136bfb6d6846014f74ddc3d65fd65b078093f2705ba999ae22cc7aba8d7d4799976efaebff1fbbbc8cfde25e0528f8fc9f89aab6175ba30070a5b3acbc63de8e5fbd2338472cf9b509b1190531c1bcc6c1b2b40a54b81ccf2b9687b9543b65c6aa6afa012766ed05c202149cf8d8d19e47cd03b58de91516768af3a7eb4c3c72019c92198036a6ca44c184bc53383e332afe01785f50c4eacf75169528f9af3ac4101b592d36a21ccd2a06e54ef3c884ffe2d8c2f39e879f6ef9065b33f65b6ea05faa84fef9363e63823c67b60d9d4aa5e0f03aa6a59266fe0dfc539ce4eed3149564ac6f50fd63c2924ca417475737baa11088285a4ecbd190f125306c3e598bcfc1d127f2ae79fa4d2693ef137e717e0b05aaffc1b65bde1bb02e33f1110833d0465b2126e793d9b216316c73e5b2c50200000000000000006dd8230300000000efc47cb68c4e2a5805dd869db03c7cc64f4c40415bfbd74d6964fa89495f3362993a7d3d31b24d6e8f63c132189b819d7f856aeb0a58cbb3a4dba3c89e6d21221d75e1296c0a86e8c436e6c6f4637e43e3ba6786b5fa062bd3c19dc291af94bd000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009491fdb5d13c88b85386400633c7e4784379b698741edaf9993765fe6abb599c96e970faa4e2f6bff2918c2302df64d73319605ce35476631913e49097e8e14a7bca0763cb7dbdc36858bfd8fca291367464c41df52cdae14483aa527e9153478568636f530e90c5394f83e0c3c24ac8d474b09276ce6fbd5966c2ccafb968624af52884370c5da2639d3882b52bde707f906adbe7f1d772fde9b5097d2bac4993ab35cbc34133903d9ab0a85fcc5c0d3bc5b760949a08eff258e6bbbfa30f1e500eb03aa33645e05b03ed336c1a293f866cf73d3bb4935d83f88f2b1c4e7089ee2777e7123e0d6d53f0d263f019dbfe6a164387ee1c09733e3a86449893a09ce2efd43830237f935af6b92d5c072beaab884f15f84f207b2676bceb3f37951bf2b61be1dac36b935da7a8ae9d8b3413df9fac6964872742eada0eff79b6b694c29b4409af5f8a96d1c8c3a037e1cff4a1f6600fd01edeff6c0a882056d1b06fd5ccfb301cac2841e5220c94399d9fb2942fd780d613fd62840e79cd83eadcab807dc8d1a86672d7f2f23a4e75376f0677834e972c68282c291e83c929e0d34e41cf1553c62b4311e97ebb0500e94259e06b6e490784007c1e25a35fc22d1121133b2d180f8b6d5fe34f8b95de7173b12e28cd352e09d631bdde44ae2090330ff2a58d7cc268f4e06dd797153ab21a5210d75f97b787cb1a0bfc3b8b9a5e41eed3c2d3f064d8a70c7a66918562835ba3cc0e1ec4e2572511859c753b982d820ca4aa0240add39218d44ae3e0d6bcee776fa7927554fecb0dc9e1e82b2cfb8fdd7280f2229665d25f4926ab4449e6e70651c4855d748f9581b9afa598cf5a5a7b29f95a595f1b66f90f2d3b9f848654c203930b08fce64d80761d51be3069ae0008ce26d5e1ee98df35da511d421856381adaf9d3d52ddde281840be9e995ed2dc6e8b340eeaf38e94dca58e5843f0d8ebbf81e2bad912807b19af8fc00c7c79776699f0d8a5029984a0c8b0e97153a8e7915e4f9d6164d79c39bc419d388e563845c0f0076ce647ccf212fe35a0f0ca40bfe8f31682af213cbf117a6267806132cb46707e1345927566cec4613d63ea0269c9d5e15a6c931e2757689b85e76e247ac333992dd26bd569aa4ed4b9160c5bf9abf0b669daae837c0a1a826e6f86d9a11089a97cb373d34ae9604a709055ee15cfd19c8fd62ee8999329415374359495224863bb8ea1ab1140cdd8c7a088b03bcefc7b0dcdde2d2642bce75c40a685b014a63192e0655b819ebb9c9b7df3952cca61b53a521dc160d98ca9d47e602e2307819f18b9086274980930c3ccb551641b95e3334052c5b8773ad9320adcb67bbaf63cbfa3eb77f1604147fefde2bd6b0ef921fd6189a7b17b1e9a1d4f875ce8a2e8ddf15dfbafa601ff2e5de0f6b70da02280c0f28f661af5d40f736313496c94df871a293886a1ff694dd2e0258bc3b4d017da80ca32779f0b26d2ca116173f1c5fbb4334906052dae858bef4073c728902750044eb0d236d0816670d99a77d0888b287179fb5b145337667938e726f546eaa79ec6d6f142cf78be206be25d5e8bada2dcf4b4634b27fb03298e4e2ece8a66f6e8ef9b1ff8a0fb3b6b7388163df7cea565974be247474aa453f8bceb56a3f3acb89dde115f3fc36cfb70910b8b91c83d7fc99909beea453e78d04dd6fea447c23d0e049bbaee14470673b3bee6a8317175ab30b155e15a3776cc41b435afc65586b4ad2f8a57ec09fc090ec6fa25c3012c9b8967fa3735abe234e90f0e16940a5dde778c4613b6d0e2a9e85786739c90c7a906530a98e9145d17a540656b44d969bdcc3611023d9c1b380c11da6293d1bf25819d9390cd7ad444b841c289f32d58eac967630c899897daec891533e5ad1762856e1153c8a62d520d6aceb985023c8d2ad5365aaca3aa89cd644d936a9e2eaab4f843cbd45a4a4f1da18d699510254dd58059e0f115bf71fce3b19e8feec81a4120e51eefd106e950d2f4f073d6d5efb099bd7f7830f677e75797aea7a931f373cd7accd9828afd2fa20a329bd138ef32b221b73fc47682aa9f62fe5c90c342a9da29e209fddf4ee8c0d40154e7c906f110a74141db2171c04038072abdbe17d056c5071dfadb81a4f9046ecf90000000000000000000000000070d571c685439c25a27d143f5751e5d7d184c3454352007f2f6746f06ac1376e57d8172654b7bc3c59328e46d975a5ac8af8e88fd1cc7f2cc0783df1956e2c71f5b938fc86657981473b0e721cc734317cfbd2824469fe753bb9d43f6b8d3e37000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000009e503491023165e22024cbc067ead2d76c44d7d9d9382abe3b00c930ca6c79c89a6467604cbe58193f254bc9eac6a27a080619c26a94ae294a1f04b2bbc592e0f4999e2c352dbd1da2b2992f805fcb3f42644a79e40d4fc9e5c2235a4f05c2ca8598e3d27fc155e082d3057e0b7114636a8020c31e5789f75d49fb539d8d79fc403ded2439d505632c13721c01d65e4cf08a2061cd9d857f891849085e31ec0d6e935d7f41a86c49db65955be980bf1f98298ffd586b59eb709c91d40db5e767e1a1028887dc3f228d1841566336bee56b41d090aa35bc03f4d193dbeeb29619a5998c3d54ddcd0f4d58052b522d27542f220720ecb5379bcb7a0133772d7e153cb0fac5d49ea145c074cbf64e491e60e2f7a08d990c31b155906c3def5e75d2fbe0e1971f8f23fe6bbc42f58ade4fc051f849f5d043c79a1d894edfba22da317c2f71faed64e5accc50a6a775253abc4ea98bc59abc8b08eced53f111eb381f606be7f3a09742a4a0423b688c4d598a49976b8b368a6e1d670010b596e6f59bc987229237fddc62d84c0b217467977484d72d70f91c97498a47236ff8de3e180556f2e4068d5cdbe3c2c9c8cb492ff3094f2f9feb4f059348431c69b40d8ddf25d96916338a507ee6b842bf04e0c563a51c69153c2cbd2223fc441825adb6bd41edd67c0da49918aee7c17ead6b357c8318169eaa13218befe4e9fcbc4319c4a792d09b6a9888a066872bd9c3b8724398bc3e549bb37d8bcfb017807cba7f150d2dfb9827feed04cf550da624337f7bd0e78f33244e15b879cb1c2740fc51ac65820cf1bbd730dae859aaca2942d22378a49ef8cc2da7c40cfcb1b00288c408cd5e4e356ffd8ab3d30b495047de74667cb888ee23c1caa7d9a0da1214c0f97080c9cf8f914a0b51aa4aea55922bd52a8d2f430b8da1816326d22aa2333e04723f3fb2c3b802c78976e4b58600ec4f9f9ad6fea6025040e37931dc01bfe07c0db37cf815219b94e75861522e850c5cc2ad82115ac11a8273dc3e66e42e816395a7de7d15da3aebbe4322ac82b99e8bb27e76992b24d4c2458609da830d31c45a9a94c68621e37a3b1620c0f7bbcdef9b3b4b562dbc7d24a56f2dcf21528e0b844e0c279f9e97edbb00f8e08d6654633afd9a68bc134c8a12ced630632e125f1a37ef1c7e72f75fc8664ec0c6706755c5e2a6dc4dbac1efd532043c20bf2c7aa90b27e8f5667a22005fad4e3f89579bef859b1fea6ad54db485670087aaf1bfe012ae2b70e28c06a46e268f6d411512dde55faec1c8643c7aee8de70d7a1a61818b1500706907fda3b2e0c4b5d85ea63a034ab7270637aaa3336b49ccb8924c3457bd04012be1a7fbeaa67595750cb71224dc4f03ea553b38f61adbca458a8b28e4d38f720eb5ab9608289b034c295a1ee38e80df3fd4785dc40b6a152e99ba8ca335858dab142016d6356acada8d5c3b36b93af6607f9a1b5dac0081b29b27576cfa06468e0d8ab0f2dfbb97c1281a10aaae7b17ba5c0343f89fe1fec970c03d2543b2f288e496fdbc7a66cbfceb77f73f7a4c39d1108114112a7b0c4d24ad08042eb94d2bca1c38b63501738beeee60d5942870fabf5adae031d10e3b700975b239c50a6fdb2274768361d92773442e9579fc5a34da178ea698c68007727295a04e3322c1f6e1860b32fdcbe79feb1d0a9e5dbdc11e5f7859a906393b409f134a37d40b2118cfb67f745183ab9edc3e2e2cd702f5c78d320ddc05d2f089d47c743e0eac8a13e23eaccccbd9f64ccdcb3424b90d3439601d9717d4434520778954cb836d8cb3b6bbafe6c040c6c38420ecf26d97a0435c16f7740531d1756bbd0de6c3fc79c71b65b8ddf3b9e87d44f63ac4b0269c35efebcf95e88eb457c3c95d38b55cc4268ac0442e1299a400359fb10175f950754ae32f5c3ab431a14e6d0d0dbb68ac43bc432b18d9e73406e80eb3b19261273fd517f0f4bd64dd32f44b98f657389b3989caedfed0204bb2f5c2b43e7be5c6c98c1cab6a8a9ae555b552edfdad75631beaf271a1610c675ece07dba10789ed2403f93e26602cfd54a1c24d899527b8041b600aa50521cf81b63237cfc71af559bce3966346b516d2d8a27ba3e345c689f91bf4f8f2e0334436882618640ec6e95929f335afba527dc1852c3308aea6b73867c3df1b780b5cf309021c6f2e3e85eb7c3948f266076f09f15bcbc3feb751397cc9369343417be3526ebbe044c29850ebbaa8ac43036a9d226e033eac22d7bedf5443983411120a53a30100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "53656351ac536553ac", 2, -652317578, 1991772603, "2e94abe2da58eb08028e93e700be8d9e92d568cafa53d8197130d9c6f2d1d54b"],
+	["030000807082c40301dcc99ba5aed2d8b200cc51b0626961abff1f56c24616bc28d0e850fbe1cd1d4101000000076a635353ac6a65d456b613033b3fdf05000000000453656300f79b4d050000000003655351db74aa000000000008ac515153635300002cc12f52ceccfa1800", "ac6aac516365525251", 0, -1417344575, 733220448, "79b27f168aeee9045dbd09751c8f745180ba4dbd9a732a201bf9d7b6280a9a39"],
+	["370a1a69024875d87a8b23166099c296804b4814de8664d1d9281640a2d8123140c1b82c64030000000163ffffffff98dc8136d0eeb8e90ca3ac47cc411135d6aad717840f4417a26455321c3e99e300000000086a00005363525363ffffffff021c9bbb0000000000007ed29501000000000553acac00510000000000", "5152536a52ac53", 1, 674212743, 1537743641, "c778c7c9cce909c7955ea7068de3f35e7e62a82462add1746767eeab28f2e0a3"],
+	["0400008085202f890495f42bc6bc49808a3d6c2d7ce5e711f5624af2b806efd7a362e33aaaea1aceeb0100000009655151515253655300ffffffffa27339cb22bd6a14c2f171fdc90763d67a43fe09b87c4249641a6807912d44b103000000005e6989365295a3ddc7c398ee7d5a76031a7b0181ff181af8aee94deced9238bed6dcff30020000000800ac63ac65525263ffffffff6676e99a5cd17b22286e467e5281dd31997a9eab68bf090bf083e492b58e5c3a03000000085252ac6500ac655310696cdd026e1087000000000006526a51656a002504470100000000016a00000000c4660009ab438c0300000000035131007793709d396bb1cc87a644f7506211c9fcd4b36987715efb061fcad696dcdc4e03b37ee3238ea3bc5a8c2a186987b11f048d73eed4d3a3d405c85eaa669b340ae10ec0aa232e12bfe30af4843341b98531feb09da24642469a72d2385290d1bb30867527e2c2aad18f4cc1ff45f947f211475a96f3281dfc5852b42187a0a8a9102f552adaa84ca13174df3a45c584417c0f37c1f4bf0ed8578ca516634d802888dc6a981f40570ab9696d27a56f3acfd500671664934c0941e43340919f21a16a244f2d1be9b5b052aabe22653ae3aecb1f31494980314b2aa81b5f5f60162fb7c41a26a4c208744213d6d0768a1db6a15a6061c9e06c30b6204d93933ee514990e447e4b8fe7311c7bcaf842a395192c62034e4441f6c974ae0488d0f1789ad60ef13d7a95f0c067f7368ebf3e9c3cfe85ed388fdc899c00b089396f3eac22d7bedf5443983411120a53a301000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000dfe6ac79b58e1dc5949a1664d274ee7c2cba38610292a9a513f6a34974d3c190d73c83ada3a6b482cb5606de6f76d9e1b43a8ec49bf644c3af9e2e3573d74565ef501a7fdf0ba824af7a79f94b882287b52837a244607a385c0a4b7851f523b7b200c91417dff7a61fb345f5c42bb9fccb471547d260724ff65475566db7fb90e60fb1152fc947ce678a5da842b02247fc3e9d1e1c7bd4e7785cd2e94cf4e5dab69d71e79dd20343f1b52e6b5fedea23d0ef7a4acbbc4b788f33046165979c83f547f1a98de2651f0e1835fc404f282d6bd96668a175a47ff59e545ea687c595eec7f6f1e50eac5cc6a10d850a671ca15a6f6e721099d41ed7acf12ef849e949da35cc48b63e607059bf59cff66af0ec82c09c40dfc37dffb9acece0813f0805ae42531560b3d5a724a31a321a87963a69c0edf53d55fc0850756e9fb5385c9a3eac22d7bedf5443983411120a53a301000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000400442465a213f4a053c0adcee41a4a62befdcc91bcf34655d326925bfba519e952a3984d9eb57184d67221716286059187975312eb170eded4366efee51245b46cfbe122c5d77a66788dded2de3f5348f3441a8955b11e92d2b121c5302899ba709f1f2597c1f5bd8b4945c460dd033b009af3fc1ce40f1f943da395e47e054aae3a11a63ee69411c1d7ad45b85a97e7bcdc5ec872c37aec429a1d98976f533ba5d97d73d38d55f9acaaf4f76677ceae658f4aa654222f153c884bbfb1255a4a5768e5b1700bc2413b7a58beef44630e409c25df3a8a6af176f45361530a5b62f7f131f4ef004f96c45b80f13e836fce56d0a261a046e61bdf1c0c426903584f0fac783950773bdf6cb4d00a5e79d6ccad7d397a7125cce2c9c9364393309d587549a1d98e81dfc62dbe50ec2f3c08713082a74aae82763dc684717b4d642803eac22d7bedf5443983411120a53a30100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002a3766bb65db5706b1a52b6be47e2137b10684211896548b098867ac2649751f045141d54a5cb8576d48780b8de624644453707d86ba666fa9bf00f670c0a8c3845a3cf39d8f98775b1ea82370cf2e5aa43d235e599853d5023a424242db9c6ac1859fe4557285012393c171aff4ceac29013607a40acac8095a0647bb8d33c9e25b871c38f1a93ff5a54c47e93293c5bc6657ac01f697540046d2edb405c2670a89d99d74c299063e9cf21e120a71cc8a7026bf935a00d03f43e94b9d6395f4783820113251be4618eb2d68396cda2ee31f640bd2d216f4e57e53e5bd6c32826686c9392a3447ececd2152b9428db300c8d8f90ab7d4410bc5ec4b7848c51622f45072066b1b0275406a4e33f1415affa2b58cd5a2f03a2c68b39cdccacbe9cb22b595c924bd7f1a579c3ddeb91096f9136a85cde6953befb5538bbfa4f5569535760b31e5751dbe9ebb974e1d7cb41495e8c5f29d327986ea61547772de487814352a4f2f60838c68fc11d9d5a40f1c09647937b46842b84ec8f241a5de8206cbe005011bce2373673c6250196cffeadf4cc277d520e84422ac2977f5af042cabf4be38fa116e5333ccacae061ab395499883e15a423f0fdf35ade74bae5a9c76ca188d4879790ddb482a3fc78d05e0dfa1222e579b0e74afbd527228ce73d8087f90898b129bb7c4e2c72a9969f86bf2592ea1c820940b36b2bc5f28022eaea5eff6e9af833c28228da9978bd82aa677b7a6a613e6bd7071cb0028e1bd4f70635f83433cc3376c0cd96e0b4f4381226da9fc9ce291955e03856274d3ab4a8b5b03e29e0799c8e9790fe3abd4b81247d3c8500c2a8867a6f88bfd8255fab4f0b2f674236526b2d727a00bf7a6bbe78c6a666289a54024f9c0dfb44a5213a22359c951c49eb6ed5371e55496c9f7371ad588ab1075c9c3b7ea85e651d8380f87bef07732d2d4c866244df82e0459347168406d9b203208dcc59dd574179a0d39c5464d583fc6f314438df9cb2f1fa39bed1a20d548f92a5419a5f4469f6d7e5a62f6e1191d643c09062bd261f33d3bd08d61cc02cc129f25e17dcb65c37611331abfb8b1fdd305a66dda59a6a3be64cf70266aea9f0dc86d9b0fb813c94f801d09d69b856cf307a0cd9ed0f43592428663d824ea7eb4db9a9e85f604275b95b01fafa89b9c90df292ed18c51b38e2e26787748d7feea5a3b6cf204b7bd975e595df26cf20936e125fcac0d2a88a40c247dfc92119f25f2628aaae12b190fbbd28a3a9a556c40482f572c64d568d8a39cbf4a2846f8f071888f2fbeb90075ba78af8db5bf761fe1171e4cacb57081e8e664da399faa1172beca856719dad337062296944fdea3b828a41325b0b1915797981cf44c3300f855f475246f252f9a0a31fb0b00e8f9eba8c1cfa3903846267ee10fee5d3ecae263080b154e4380e0c29df631c090db732ac5306e6c195dd1decb80755e1cbf7c316840bc5684f638d719bc04e7e98ce387e6a00c8821aa6003a49b0e72750daec4b36cce324176e5dc60cf664f1a2de81091df0bfbe22b5857c472c736633aa884727bb3f275c73eb1f083bdc9f6e3ff1c13687859b3164fbcba1b3b5b0dc7e6fb70b60d22c8871edeaff35f17754a1ab7fe1d3bb900d5b9baaa3f91ad0e5b60984186c88e4736780b46d14ee97889655da34b2db03e74f5742b638b3a34592f9f5ca9e9fe364c43fdb8200a58526df7ea86ce40b0a0d3b024c7271a00727891a4460811f733b2d99a3b0ee4a9aa7afb7665461f2d31b3decb437e5fe4362bdabb9c862a0337c04d94330dbec5f8a7f2335edefc0d800d99faf4b7483d2aab7607c9b4a0bd21a65daccbf14853ac4e7c2fd1b722c9d0a705aa63651738228f6ec5128e25399ef2641b7f1502e4adfc0a2f04544e050009324abfcaaf81191b745018f8404e16597bd434eb75b52082769181798f735d543b123a6d85f7f91a819eb752fa730217a6b85e645e83c0697c1e006ecb4304d390c0caffce07b6276d21ab339f633f049ab3a6cab57533877cc5653ca46dd151008e9e55b95281300667c6fadacfb37ec97bfbc22eccf2e33287bb5828ae7aa698c5bf49e93fe3aeb054a1e0137759b191a584d8817ac5dfb7140fcc768fbae19cbac468b892d3fc3aa12d77780d305217fa51a262e18a180fe83c5bfcbe7724e94bc56949d51d877956d17bd18eeca1d981eb3eb7ef793a49c4c320cb51c9626c3e80f78248433b3eb8bbd4ff7f8de3e07b7bf6668025db92fc9e3815708b6b44b8c31eaafb2da27d4de1753f67e6aa7296598724d92f72a0d44ce341bea5d715c800da4725625e1ad40300f834e50b66eff150d88f7d6fe9e907ad273b7e198ef889302e69585950df90dbc9b40721e5ce074da80dd3116009a257bce77027fa77d1353efb26b1235af80993b8baf9a453b415dbc22b31ec5e64394d2b10af3aac844c2656b3f0757179db2283ac27ccab2d934e6a1accc6440623530d3237ad47c101fd8de24a09a0a39a19f47038729f9a970ad8906b8b72c137a04387737a2efccc162834ca83713a938f44a5ba80a77ce74afa5015b11cba421adb782c56c1fd970895735666efdcc5c60363d895434f31244ce29d00bb16fade2371b7e0e74e31bc15f2acb92ce3ea7173854aa789be296b17fc89960c020000000000000000ef2aec0000000000c76fd777a43312897a49fb5d7bc933ed670be4efea7d470e0abeaafd3a4f6b7e1ddd77afd13223e7211bf4bd81a33a40e8f4f11b809cd87f883d7fd38bf75961c492e0988927ed7ff229407d0d7a92e019e61c03f130e7cdbebe14b583c460a300000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000198096c654cb942f1283da6cfe90a6aa17023444eb7e4575de51def21476057e4b58b30d2ad1a71e919493b421819dcb56dd464a9b80247f284640058039bc847cff8f811d1c76e81479518f230178e0d37f45890cfa8b3ec88b68b3f68c1bb916823b12fb34847072340ed35102ec2c94654349b0b38427c44cc701d8f2d681b582fb564f4b71710b48e0096b6eb3f55861058a80e2c6ad73b2fb163fadcb3a8790265eba5cd64c8abab9833dc66bc256a218786cdd21b3086cf35333b80f7e7a184c74d9adc3ebf664da186b056b09e40f42f75e4dc7f2b7a87cc6d53bf9970db1e9f288e44f5ab80a02d17b03a86c0c6307d1029c26de7c02c6693750644744f36f278bb3f5897dcc53ba1f9484e39dbb96fcb9627ff08212cdafcc383d3a6194e980bc7ee737b03f02a980beedc667884b844d87cd8f729661b3f2880a2d398eab342bfd0f30d9bda59e17f9e5bf7cf671e23184df74a91320681fa7a29330e1585d7eabcd18d44f3bcc9619aca22a5e8c97c80b72172a3c2209a4248711612648bcb9650c38b00eb455947be806bd6059476287a36faaad6ea45afb6219e651bc2620482d2becb1f6165cff71cc767b9eb4829c3d87d766c9c8bfef6b2989f37442598412f9240c215031735fa72e96ddedb40fd74e7fd04c5def73e5d2aa8d6e67e9cbe7c5e362cd76a01143069827d839bd819dcd4b3deee66f79b99f98052792a1f2a2a7dd87f1f9263decf72c42dcab6cf297bbaee2e8e22dc2df90a21f66f3962b49d64f92f392035621f7cb2558c38505539092a62e3c5e9c47168d461c7bc0521e67810712b120657061528417f188bc6de85bbed6a620d6f7676b6c51db1ae1a3fa64ee0bd16c01b518330e32aad18d54bf81bb0612509b94cc25eea58967ae02fefd18bf111cc6597a3a30f2e454df5677c106e098d85cb4b68f861927a44bda34b995e60f2169e54cffadb02877c709a5c70cf97ff27c648accf6b6ec484dff6bdfe440f34111d91a2bc18f972bf2ef9f106cd689b82670449273a0a8f08f9dff318121012ca84f4cfd83254610abe5fee49542de1097cddb36e8909b50f18bae714d5021f5748f39d7fbbad035592fdabd0d1f8bc286ff64c7460a473caa018497a9003f3288abc9c440a03e44bb1c27519102b099567f6de68bb1aacfc9937c781102bc485a8d17598230b75ed08be04c995f9fbc31f0a4f5ab805e0e5fe5c354842599b3531f1792b385ce29dee5ec8634ab4143907e7c61f732ea54a1105aaf08fba4b4b54245b38f525810711eb25c149109dd50789a74d7a0ac4763f61b2e6937ea7f77199b46617b0312bd3971277cb0c0ace435f263e09ce970c932e5460c41a9062059e24765b4c6ee222852e352f19ceb87e90ab9289c4754ea0584ddf5d61bd14e145dde43b7d617b14f2a12a872f2b0c5f286eecfb2c509300a3280935d07d2d79d69370b43be9adb02e79759329772087fa3e8a67f2ec07b024fbbf50aab00b1d582ccbc2b9f8acfa0b6b429f571b8950f19b2f2956169fecf1a56869ebc722ff52cfe4bc31993a0071822d01bfa109cb975e2c573d4b4cfad24b6e13af00a4b3047edb584e71e99f875dc09a18591974eba8388f21713c02ba98e24194c6d65715673a8ba7af4fbb42a156f08999f6fb918f51bc560a527943e8ad991a53a6b479e14a753c19d84e8609e03a977bb98bf7e7d6365986c6ec00e9bb2f31a295200791a2565d4639266438076da68e3d4e377cc04a9d32e1265a64fd9f4e2142d1ea4b6ffede204ea88bb58da6a9f5fd22f0f8560165421abe7906234006d76b67b199f7f2451c8ab628d48ed71cfe08268520aef0ed740819231370089496622b4c8b7ed872ab631f5c5f46006eccb8083a801905724952ac3d7846706bd199ec8220d070c9ad91327d4a36ccbdd119df2b11979d39a6bb79666eb3563e8c27c5208a16e504a85a44a4730a76aac682690f507424405c98f3f7a4b94833ea7b3e4c7c2aee8d4a968c6127aceaff835ba26b65a85f9554b13b6e2070d13e29adfcb1843467832b39f9c5b1eb14e50c18a5a9fb31191b53268e0956a63fcdf3ec202d66434f22219c364bc3841f94ac99247b2910cfc24971f662fcb17da7f0d790935f568a421e9010000000000000000000000004748290de3d0518ab28b426764e663b8b598a8450bf317523f0ccb23c1d89a6148c1cfcb519877d3526070b68127c4ee01afcfb104f6f5343258626c700c5a6b7ab63ae983afed89fcabe92dd2262846747dadeed866025b623f4036e0fc1239000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000004e285b86aaecab337fd3e99818eafaf4c53352a13142ac00a6b1f28c12f5cde2d87a4fda49b9718aa40a1dd966e5741a9c5e3793e3e761ce3caa3cb09e1e8511cd744bcba49546ad241bc6c9f003a85a0f279efa0554e367b2116f1c92ee54c200553fc70f0761da3b432c195a7ea03d9caa44734292f1f84fde4205821bb9928befeffd5c0c1e5f045b65f8cd71526c6f110f57cc2af42af216d64a1d14205ff3ed7d4aa3850c13a8ebec24b961382f5a419a3b757500158285a0689c6defa51ac7c2d5d02635aa5eadfc9fb84f1acc737b76934fdfb7784e86f4e416cb65089491e610b5d6c9594c9c4482d354925ca001563b30768d1de5b7d037357dfce5c61e997f4ca94c39201ff5c1021374bba7478fb780d76b2499f54efd7917b0ab591e3add8f92e4e6d5f30b6eb89f45bc08434cb0ba6064fee43f66a18e8c02420f11919c3cfa3ca5df7d0434930d4fc394eff3eb9ecc4b71d8c9252154c953aff96e9d0fd25127a6047d108eed6011f42dd4617355a70ac016d0232dea2d58dd73cedae6881fb3875b67d93fa380f4ff9730539971b6c0ed322651461ff127577b0b7071fbf054b3b13fc3644c56de652d8b9ba8554267a65f22f874f12c49a5c5ebafa5e0f879e49bc741d37019ea386d57ce02bbbae0267f2a86abeb6385168baf890a29bd62981f14051f25856ddfe36d6e19fd4c21593d096d8f39b036f750f3411a0a8028c44ee72fab4f291e61d6c08130e75da7cc2a3dfd1bf96047486b41afbebd73361011148959ad0f44d5bb690e9dfc967d2bc3a4437e6bc20d5964a3d31ec3bfdec19fed40b4487ccc7a0e33b12adc98178fb3755a86ef8e7d1e1c3fd5fad251832eea28de29bffafeeaaf94b186e5a510902f7ced314651a1cf358b470ec8be3a70206df0f56326f4b3c5e81eb0ea71f1d468889c283611d95b3e6008b61dd92f3c1066334acb1fe435cc00e677efa6b47458f62502b16b4baf9209991a462a38459c2a7b24bfe0d1d9c7e52215c8f947cc6d3eceaf286d050b1e7dae1053652b57238ba7bfd4b88519b995b36bc2229a15d77d53335f4fef56bb146e06e3a26cb83169efd7a0cd4f2b2b16dfdc688bc167254173e738f9bf4fd561356ada45723e58a15e66979c44a2719acfb1235523437d9c47ab36ee2f0d17e508850331f944f37ef207a3bea07619b3746e8f76e4e054ea41f15ddd68c816dd5b94740a84cce1ae375e945cfbde136b4fc884ea4be3dea7f018cfe2b9764050b853b1f40a8f51a0de519dea42fea6ebfca53f9329731877d4e2c4400db2a27f75b72d2ca36e28f891f79eec0dde5a2be3303f1239a22fa95f140ae95bf3ccc0767bd0bb840160859309d42fed1129ab00ae442509027545edfa30a5cbc0f19f5168492bd9c7463ff6b01cb10f62f3e304418275e3be55b0aac4993471e8ec1371213764cea703333411e8659d813fce2084a5431149a766e3799c1a546f8a313a62135af4d9c6bf05394305e7a28c1db5c668aaa1d97b89018fc04e981e70aeadf67c3edd1333bfcb0a46bff7144896f720a5ab0cd87d92785f0a351af0e656f4ee5733bc6205459f137bacfaaee3a82f59375d20391984be2107fed8e586d710397ff9e9a1943652521b726d94b40d72a1d0310703fbe84e3d8931c2acfa22d166adc682c22408e43fbba471950a91ecea4746ebee31a0427a850d62d799b1bc6c0f671145c068ccdd895fe0fbbee4de081aea943a2f7105af34ded695599e648ed647bb0e0a5287af73e3f703e707e96d1f7c5d066c81b78a24460c71b13d07f816ba9dd33c4ab9e16e2c908f04347107c824d66e358c3c049775e23f368f66f54ba3d9d3634ebe111b3b62a238046564eec9c17fbe4a1b03826baff6601682ca95c9873cea45f2ec5fd49a2ac98d9881912341bf53dd5fa22e6cf48e4e5202180c21ee63bbeca519a3338ab35dc2360b5e438756b023c7544140cfc015fe1dd0a81bb48c128efdcc6cc126fedd4c09443dce3d4d66a0456b85b6305fd07f4f25f20d8f4dc56f386e0af95211d747fd87d056501a6415f5c242e50d415c8ff44b093880388c085bb0326b002fbc09c39e9a9aa4997c47a066cc2488b59abcb7f3c4db7ea6b397d2f38b7a1fe97f33ff7e62793d681a9ce61906273b42eb2db6dabe6137146d64a9f890f885a7b771a45400ea555f5173a6718c9e94b75f26e7464315558aa39eb71b8de46d531c0f4748bb26e51fb8628bfcb45496c2996217231eb3a25cd1ea9cc122d63ee7310c00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "655252650065", 0, 1683365302, 0, "75bddae35e6ad8fd741e72f19743dbc8c30ad78665f0a6c73cc34a09472e2a74"],
+	["030000807082c40301f12b9cc23e9a370b978c9d3959957cf7633bc74fa706fca336c4b8e87cda2bc903000000096500526a5163535251f723f90a02f84e6900000000000013f2bd04000000000652636300656500000000a77ba61600", "ac0065", 0, -1678715162, 1991772603, "740463d6a75f3d234332a2775d411fbc59206f8659410ae31c77e35fe099f789"],
+	["bbe983330322da177016314a4c3b9726c7e64c3bf1ab8a0fa867cba8567b020c0b8cc2fbe7000000000352526affffffff5a77dc4240084ae557a6108f04f5bd8b8a91dfe4c4edf6d9c8825b573a39e0c30000000006006a65535300088edbc63c4d383912708d1b0a6db5e8d70cd95000bed54eeba3a77838f2a664edcb53d90200000005526aac5300ffffffff02ebaffd0000000000075251630065ac52d886b3020000000001520000000000", "", 1, 1472282316, 733220448, "e62cfa2f50f7d5a2bce06188d64d8ac0f4d96497dca95ced66d66f0fd27177b9"],
+	["3c97fa700402c35766750123833c02beb7ae945080328b5ae2b2d0536dd0bb7ddab024b82300000000096a656a525351ac53acffffffff3fe971ea6508a298999813b08cea1aebbb525eaa6c58c4278d427b32e22470ed0300000005006a635165ffffffff54c08624bf1ebc656a2135485db408d545362f655e3c0ea3fd5992a14d90b6230300000000ffffffff64469e589e002c8a9edd33ea0a801966dc0da5855ecbc5678bb529d676c4aa71020000000163f460b8070265a94204000000000365536519e15103000000000500536551520000000000", "63ac6551530053", 1, 683196241, 4122551051, "168bdf8806a8a2b9803322b74da888b40fdeebbb2d4c3a806c3a12d4dc216c49"],
+	["030000807082c40301d070441ef35995db1c9d5b5011ebff09fc938ca140f410a5a4025ca91356a819000000000753000000516300ffffffff01312e92020000000007635353ac63635300000000dcec840300", "51ac", 0, 261855184, 733220448, "deead0b02df4ad123bc35082d8a09b219ec069e815d6711f6ebd223e77cc9b4a"],
+	["638a691403eddeebdf99c7237dee02297cb7bb4217b5099609cbf0efba1464bd2c212ef10c01000000096a00006a6500ac636a7db4abe814dc57f737646c0d0a34a9ff7436559ae0e9ccfa07fc33ad81eaaa8f0ad7a6010300000002ac51ffffffff8d30806a9ad9932b53f06ac6c9b6e992c7fd8ee83ec7abc5fc47f8facd5d872801000000066a6352525353ffffffff0127320001000000000565ac515252b1ccd21b00", "515300636aac6a", 2, -590640270, 3925833126, "1d1d7e63a7f1bd91a550e4c31d89c123dac2622fd2f735c473eb61e1551c55b6"],
+	["030000807082c4030180050799abe28ce200dc924733992bb28315c11fbec360810525c8be0ffc8c04030000000253ac7ee56d9a01a3f5b3020000000007535253536a6552000000000000000000", "", 0, -1911673129, 1991772603, "3b2ad0bdd4c46bc8752c314e38a40cc320942eff32be64e203f7c2a47dfad92a"],
+	["309fed3d036505b139e5200db0ee2725a76b03aefa62e53fb2b09f81bdbd8c661e2e271d46020000000061cb220fa32d49e542df505db34fa85406981e3cda1eaefc7cf1bb765efc5b135259ac37010000000300536a97f4b9489cb08f208ef3934ca5abb45b1c6345c717cc04c0fd16386c4978126c89c93f150100000001acffffffff021f2d740500000000026a51e1aede030000000001530000000000", "ac6a0053516a63", 2, -494011247, 4179206552, "6bc3aa9b7e8e9ccfeafd64eab5d475b911d5613e829ed0f2fba1e209e035ec31"],
+	["030000807082c40301b53a64b9c73726c860f1f0c10ff47c9e36ba203bdaef3b9145636cb6ab1d6aa302000000055365656553ba5f4e9e03054fb1020000000000134a11050000000001655437750200000000020000000000000000000000", "52ac53", 0, 1002087745, 4122551051, "5227e8401e94db7a9162661354f7b3896ca89c5e3690cd1d60112db5e06a39b1"],
+	["75c71233038a154cc71691cb5f3064c2f6a0a704386178a483961972107c446dfcc8df35ea0000000003636a000d4bb239ab561b68ec02c507ba506d49b0ef25d2eb69f44d9ccfbb4101222b0bf3881a2e00000000026300520d6e85c1b65e4ce468e42678b1152598679449d704dfde8169599f54d6904ad925f3c80300000000ffffffff01257e90020000000001650000000000", "536a536300005265", 0, 323684885, 0, "d2e1c6efa91612698774df43f5ce652c0d053d193ffbfe20ea26658f8548f7cf"],
+	["030000807082c403013912b598608a5a8a2240650d80a52d5ca65d63aea2382ba549c5f83cc1ec2a3d02000000055363656363370d6673046436630300000000060000635151533c8cdc0100000000076a63525365655241298d03000000000100f1eae903000000000452525252000000000000000000", "6500516365", 0, 1456819343, 4179206552, "03c94c7681d43da72bfbaa756b816c6d85a53a1f8788b23a776f54fcf571b898"],
+	["030000807082c403040474f42481a123fc6a9670ffd47f272ba5f00620cf636f8321ae2b3f1439491b000000000263527a13a5159467e6be9be3c69ddcfd52942dd1d637ea0de70bdde45b16868b0caa406d5d28030000000152e30552d66ec2ddd69b007383962ebd9098661d28a797417d81ed2f9f234ee86f9bf3d6c4020000000463510052ffffffff10ca56fe6e70b21f27acfc21f317686c403269375be95d708e533eebfccfc70800000000096351ac6300515253ac4beafd7902e2ed1505000000000700515153005100bb881b0500000000075251630053000000000000367e0f0200", "", 2, -277027241, 3925833126, "4ca39cdfaa337492cd3623cdf521e5fc78c03784d45857700a55723830d64506"],
+	["030000807082c4030125383001ce99debaa46c579c0be4662195bdbee3b53c30de51e867ba27f0996f0000000008656300515165516affffffff04d62ed5030000000002006a6cdf950500000000096a006a656553ac63ac84a5580200000000056a650063525c97fc030000000008006363515252ac52000000000000000000", "6a6a6a656300", 0, -906286090, 4122551051, "66e0b2943496e2a2c1ed091afe2d73b4782661cc0f1eb3cb333979cd2df35a01"],
+	["b5cfee0c04ae9589ad5f0bcc376a3c0b602fe867cbf6daa756335a59a731a3a1632c08db2f01000000055165ac0065b2898eac7a6b321f930777b7793e2bed22e7225d7d21369a87316bac991c24cc585a40fd000000000100ffffffffcc73e6c6b36431d08566806234ec60be8f4748832192eca63215983af99653770000000003630053ffffffffca4c8481063d807faa167664bf523225414f460d6ad2ae1fe792d6ec2a57264e01000000055100656300d93d312c03e23d38020000000000a7eaad040000000000e7dc58040000000003ac006a0000000000", "6a636551636363", 0, -1730679573, 1953719636, "4632233c2780931fc08a8e6735c2424641c29bc57787b8810b197eeef977fb91"],
+	["99b2e03404127fd5e0e56733559783c0e1496901d4cafff8d3d6881e1f95cbbafab85119a202000000075351000051516a8d1babef16aeec1afda56c41c5a038605424dddc5bb3cac8b816a124c63c6895dbb0e90200000000026a510a8df2338ba012a225ea9419f672351fdf059e1a7481b9de17d6f117cfa6a3fce03fd0360200000002ac63ffffffff18735d7eba322ad22e71a7d44f8b024fe9ae9d3b47ba47a0e0dc9488a61fca2a00000000086553530052515153ea597d0301f468ad0300000000025252e55d5b5300", "", 3, 1837027644, 0, "6ddb7092ad456473668f39969cb3bd27eb9860010a46da87c6cd45cf38e18440"],
+	["0400008085202f8904e21e8b8052d6441bd0a9bbbbf4992b312e91a14ff66193b2a5ee52f9c11eb528020000000200ac437b9c33d5d4fe918c71f38995331c7f1dc883f4e30495d025b197bfcaa5ba063aedba860300000000ffffffff9835d33596c8050f00edc20f0752b6dee5aee6b4266babb3971c4e2df3fc3c320100000006ac0065ac636affffffff49f2677ab840a1669140c499b8c3e7da7da6825cc93fd0033741efd0cec73fe2020000000152ffffffff044505d502000000000452515151357dd40400000000085165636363ac53658a614b00000000000763655265536300e1c5a4000000000003ac5363d1dfca2000000000b71cb30400000000017991106fc52dc1364224b7dfb4a1240e28675848404d641e9c158010dd83bbd969b18bde3ead421c1c0877a897aceb70bee72681df4cea5e30921156e57efa68b00771b53a8e8a13570a6ad223616ba26f321c672c5260d36d8ce9faf2c56b92a36976688723e73b98a6403d97bc3275c9b60651ace6f44677b575e80d477540110719fa22842d3b140daa25de08ffae6ee83cf403186c899940d72f0a504efc9da04bb5f2d67319110d8eb8baf7e94d26b3545fdfa5f3290af1f79ff20d2a1c3564ac95bee2880b8a3f7a4836c7738ca5c4954a38cbd6f9cd9ca0471bb69488d6ae1ddfdf2624feb518baccc1ac8159f5a597791158f930f2a17dcd6a8cb250911a3c950297bb384a15ae3549db314fc1c0a75f66d21a15de8b5438eb340d78e0406bc51c2c088097e716bca260964b3d23013217f2163f5edba9331eff308117231eb3a25cd1ea9cc122d63ee7310c000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000041d428337688b85fe226d46600a5d10299d279405e410595b949f7176b6f1261631161b1b46427163aabeec56b723d7d584e22440c4c90ab6c8863c09699009408c95f10920e53d63f8ad5bde03c834e6abb24c2853711aee9ab292bd0785e94cf01df796f8442c95c071a218d7e0e8ed6352e14d5f5fd256bc05e87728a4d53cfc47958df4f74faa0caca4241f31443b8e77160e49c9e21fe2274bab29f65008079af1c34897cec5932961466b7999fa4a9a3a47fd1daa2b1ba695c3fd49f2dc6f7f884a3af50f1f1f2ccc7a9f46947afd33b2f5076547e0effde6feee3d0828e8157f68aed8991949d427e2d8cc742e713bc36bf6a7c87d44a381827294857b7fbb9c9c2906da2f2fa380f5ed7d92fa332f89131bed34e92a08491e2167f3c91deb7632f4b7bb64f123cffcf95171389618abb98ecf17075d6dc93a48d4137785e3411844278fefb308b593e36236868f738d2a0f7cc9a69550689e228f79f5d47a3f11279ca8a4273f8577af8d904f7ec0b6fe44c53d32a51167719e4addeaf50633c422317bf60a8df0e89910780357056b64173dd5e1139a6b7fd5edc96e5251f51cb99b55e37e4e916d3c2077744b0824a99be872cc847d5eb668383be103bb1a38da28bf21e0bfdc93e8d77814089625e8eadc4fb1ac73bf6f4b9519df8348efba47056c32eb26d85776de8cb75c4231e5a1e1a916ca6dcc480c4da0d5b83465eb67ae10d21591bf2453e68cf4ec1520530ec56013ada3fe9e1fe359267c86f942ece7f3733ad4f72ae51e7575b54ced8934b03029e308ee1a365726093bf73a9bc0ab1e56ac0665a5572d3a1a9808936462e5e9b829df7f517ca4a033be572eb4f22098faeac6d76e5a82a68319d192401c866aacf2af02e6a081df2b27a97b6b6574ea172e8af9cf9e74dd007087879efc32ca72ca8dd03132f06059f14883b1a5fe42393badf5438c725914ae62a92d1ddcf93e2fd6bf2b22caa4614d80715be267af275dfa991b610f8932669174b10b60cfd13f713c3d2eedbfaa0c41a82abbebff555c3f45d817599b59e199efdbbab85aa83644737a93581fd19d2687a863b09513ede79ff83b03ff83dae07994d9e27263b34b881bc2a2144b310d3e8dd856e4444b33b2057208f100c21ab39d25cf981bdfa2e2818ba4e4526c07d1b14250102839d972f4e66c09bf761bb7a0bcb1f482752c716f3766d2d00ba18c9d851c711b8d20cbad1dbb4e3f28bddbb45ec4bfccc41ac79832be09b9066f87a0c93084dc2284e3818dac38e3c0abde54ecadf327b5442228e8c8540cce167834cf735aba24b4f4180a36c68f53a361ff4a8ed0da1878b4140c026cc30e4b0987754e4d6bf78203c1329badc390960a416131a414a09f7de34d81e8cb20b1520e5a1f5dfbd38b337251eeabc171783a5291aa4d7079953a9bffe8a7ae6bbe48cae94c540a28b4a9a9526c62b8bfaeb854d5a98007b532ab3e746efff53fd441af4dfebea029251ec886e90cfe438753667cf393a8fdb9b4fae565896dd3e1dacfcc636113ea34b7ca1312572d45b7b04b1f571ce3a8a858128e3aa6da2e3c305b5d8834d77818d3fcd05b065cd37d3410f0ace2eb613bd191902ebe5d46c8521ab4a76d08c93c4ae6e9d13752cbd31bc931ae78b54ed15f92127539238d41db39c3611b2d2014dea21877be86d24263fab78feb16d80c1b8f47a6d9fdf538e4144cfe5ca2d5e4e8c0b5d0588ea36398ec138cc2a3c60557c561613a2dbe1079dcc2bce2ef857c9283295568ab6a2a95d26ca3d1b8ee7f697444c3e30c285a8aa8023e5059abc68d5f169e9966a7399205ff15ec5571111dc2bbe5abe665a000973db34bdab627fe42544f03f2e054afd92bdcd9d25440d6dd9ad8a2eb5f74ad919c5287f3077170405d4f6ee111028638170bde5ae4e09e11cdc4ddab5cd3bf05aff6f4fc9b3ea8e4de576ba73d01b6fb1905a1d8a92c3c7199a8dd5b894081553e4bdffc2f4c1772f22c7b389a6184968d113a3ddb0263f1bec2ac5e7559f8672047eb72bcaf38e494f81d5ec78903ac27e3d27047ef14bdc738312ca02bac53e2a70907f5ab3df5fe6a2ce74fcf7d1820feeae34236deadc3ff6af1a0b4a80f6d47db2d2379e46f43ed550238898059e3ee9260ba950cf5134f5b4d993be039987ff7ef50077adf6431f32934552981b698db671b196202c4d9b60c01b11d1a253a6f3ea2ab18ea8b1b2a761712db034580695c380c4815628a2d858d96628afa49b237aeaa07f7181ac8e0cd4ba302070afc92d51d8f2f5901cc5e20c666a38574855af71ada658d0393533e45318457e499427b771be129d1c00fe242c75e221217f44e5d580321889360f4f1f396a547c047b18d7c74efdd6635a48f5b45a12819724d96553d9d8b4ac6e2a70ff305d13b59a2280f06f740efe2c3c72eea19c70a70b0f05aaef254464cc3cc8a4d61ac22c8468ef5aea666274904fb2b7fedba7f3fa74fab6cd0e65d5312e8ce5f520934a05470f4795e5f53c4b5a78a3328ee53b7f1692e4bd240b2b2a1deb32391ba2be1375b34d865ba078e70e0681be3803578f541430325880cc00bfe39d0d029a30e0f1f31e371f80e7316bfd90ffa764b7af42fbc88d2880178a872519503d35e249e3994a156a5b19c6bcc98196ca67704b517436ede50f92d53e0e951b1b8d0a39d54b01987eca99acfd3b9e0d37e18e983332e2b735a8457e92a6a95a08084c7748dc58035186318b8bf1d06656f8e0e1233760b1ea78ddff98b7b683b2a7c21f1084832644a89e7805d1e7e1d80e75958bf00f903e399651385ec569ad72734dc0e3a92a8b1d469107103d6e260982a3036dc73bcf220183daea7db1c78621f567c7eb7cbfd156394d805bec1f8dd8458eeb1913b190a496c9896aa18b446b5d4df2f083a5327011f4b6dfaa1f21368ae19d20e8b6828e1304a457e872a5ecb974f84275c827906fc8a0f75d65e5a769c084a367cb2c51ea3d71772a1ee54c49cda6781dea4c2e8a3e2779df83bf8eb67281dee417bdbc6596e65c86833141e7bfff4d15c26671150271dc9b6fe8716385b7a92a446d12adbfaff4391a19b0d01f2ea9ff054f7c96b39d4e639ef3042f13eba03bb6447fb8782cb85078627c4cecc853d6d7738d6fc8150b7c10e805ba975abdbae7860dcd3fac8b9c3c4af2b87db478d8c61aa9548ffa7d9274fb8669bd32223284e139c2a2f40088e1b87f9f73d92f3d46671424f74e6f6b2380122bc1b7d1c242680d8cafcb1bffd3fb18d4afd14930506b22ee9b5e71a096743f06606b20915a09a30122119dedbc756b1b824baed84fd74b1bfbeac14abe89c387ecc22551f06714947853e5ae1ce77778dea01263533a239b0044818d4303d20847dd8e0384584ffd3bda5a31bb16a0bb699384858ab3d300f5c20c0365481a68509c661cfea2449a782d0c78b909bf31407a34bddc752568384cdf513a05a476b012d2c2cad56e5d62b591000354efb3883b9a755edce41bb1330bd9b9e255aac5095898f5f82024f026ac3b79cd209033c8dcb88ee27aaabc5bc689b42a437658365f90f991c6a624ba1cf843bdc97248b23e5cb1b3785df7c00e00592a745395e4fa27564f994e59402d1f24cb7f06e2315f0523a4fa4a6dc810b831d11eb5af29870752634cef18837c2e5a6b4160ea40b897bf95a43cab91c807a897869180bbe0c3fcd3147d5e38245b512c9bb115309f74f0cdbd0ecd953ddeae4d9731d59a9b5e4b68dafeea22f2003e59727f534e9b8d1f360aca87cb0f3d6672877517d0002df7d796c3f60b980a59bb6867e3b1392b5b2fa807066c68d8f4b14e8ff1d1f2bb4e798d954715960c44b2feb7d54b644b3cf5a54d90a0ebb87350b1d118ba3c25ef5493e510f9a2390463cae958c2d99ef9e8b185a12f828665329c4578bb810e70e4b50ee379a7ca5d9a801d032674d40cd6740c487574a56dc2074e2c39ce22f02be83e027f15c64412a212df6c11d42432287e77c51a203d74c08257c970e8cd2a51ec09b87f9904441f141a92b61df08575c4adbf85800db41bb319e716d90ddd70fe8befeb2e4414a51d2ac05021ac084df867d7d9074689f9efa3ee60e5ed3cad8a30f617f7283c7379f8f23a46e2350d64acfb6070405f8e663e07f74b22607fa09287e9443f54fc9d93e63185fd9e094633b935d5951eea1be6de8cd2e58686c6f97a45b67d3138c9e78c2459f9bee8905bc402e546845383c630ea49a06e21aa66839c0ee543f3a7fa71496c0399ef505daeee7be33c257d359c81f7bd4488080d8b638f5c67556a43c596c99769c094055cb8f3da5cc6f40cb17025f09380cea2c1b818c3e07914ebcbe6f731d67716f7da9b03b0e70985bbdd26ce9340c813ad4cfe1333ac4444db64e8da1199ab5e9ba8aa6b2daccf1c0747786895630c5b0f76f805871619f631fa5a9e500fefdd7c9604db8a64d11b1a8ea523b6f9dd4641e149ec3230a94b36f250c2104312af197384c9149672451aa23373f60289d9178c4b06367c04afa0d681790d1a5f33141f218143ec6fc82c04b207c219d62b22e0df0480216f18f43fe323199d044d1f3161b7d0e414b666e9ff6f564fdf8d8c686f9b20d8d01c336387d7d06b06665c5cfe91eb4bfda98628f912c2468146b6aaa297c6916d5735e6c499446f19dd1e69a0ccd36949b2f6f27a7f93e9f55cc8572ee2777574d338735ed0e86ab9c08f4a00d9fade855795011ace1d787f8bdd2de2111788b55dd4b24f6eebf770885e3862327b8483486f703a320156c4fd536cbf4275925550c87118b98e33b355a70692263c13a1c9fef7ea651d62e5aca68702e1024cec629796ffac012108072ddeaac86b7da4a5a94467f77da1369272bdddbe7aaf551cdbeb50dc99ccb6f7f752385d9a7cf376f1bded1cc82b6d6070d9d2b0652ba12ebd2529e2cbc37037b53876f93904a57504bf2d20ee9d912552a492e9db5eb79f1934b64a4d9576d41898c36c4cb03fd7b95dd277f31f709bb530073d5f504eefab4365272681053f5d9226d308d862c0b993be7592f92af2355d84a832d9bdedfba0f47ec378beac4df73c4757f154b6fd93a0ad6468e4a1f25c55f4f391045fc76e8a9fff4d34b5f98d19b370d383edb0f71a1c248b8844f1f71d74ea52e1669f3be47a2cbf34e6fdaa9e3a69966e4a95602d31c41e0408f183bbf28154443d044dcf1c5e7ff528d7db7c602928526e1dba644b92f9fed2fe996407e9a2408b862f99176266ea0f8024d1d00e4cf1df0aae9a368e98d5fe43a89954e6b2b8e9679e030baaf7fe8bd722a3d3dceea61703f3adbb5e50d370172e16900000000000000000000000000c954f58dd411af634f067925bd50868b7e90bae559a552af2b439950b895ae21ab7f2d2abb3e1a0be93e861da482193bcc1fb1a98b9699101915e15bd9d945c2300efb13c5bc0c0e6bb8592115f8eb0d4f957992030c692391c077e165b17169000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000001276d2084ac12270cab8159bf18e7fa6f198391fd1a80a49a6af2f2303fb41dbbb96e90d8019d72221f3bdf832f2d9bc7f32fa13f9f94611e33fad91eacf536b7cdfb61d665351c3901afb1426ffef0e0cc5f92378fc5621440d6a9f23995e2e81a86709d6079d1c20ebf719835efed98a96bf8d1fe77b7e7c695a8451b5948bd65d51b14ec5e22bac1efea337607adbc9f7b37bee37de658e50cecf30cad76012668ecbe92c336e56174e8482a8457b5817cb87cbbfdbf0e85e5b26f014de648a19909697af4766bc4d0672606b92c7b23d1d1f9c3c2f8714cb99f8c38d0ca13c11e01f630980a8be15a97811e712f35131eeaf18de87cc2dc4b4bbac4a1663019578e58ca88f73eb79e88c6e4b2f8033fa85c86fd566edece81b367eaa2f6815f8d14929e4c0244a9fd6c09ad28c1bbae837e6d1a9dc4c69fbca7abf69df9f97d923b4549046bbce22506761678ac2bdae5fddc26e4a843bba43addcde8c400843304fbe7c98ae8f917734f9f9f28b1ace9ed75ee73af9086377d764b0fb1403b438ebce2da8a7dd0ebc2a7063b2f41bd4f4ab03e9b42848b7cc9763c9d4a7c8ec956d381eae6d0bf24926f8fcc2ddb632dc692f690c56e599cd1952cb07af79c5b43d9b860c688257e58ca2490137e00ffee4c4d50719cec7d568785cc40d2a39f024caba2c924f923caac48df625f1c5ffafb5c4d52efdb9efdf20c4c064b5c8a94c4f098ec4267b0d2b542143f997e32dfb1cedf049264f540f77d7bffee4de3afba6c489254fbecc9ae0d16b64580409f009b42d20ec2aa966ae7a1ed0aeea418831e2b60d94ca9a17bcb79be2323f75a55e1299bfb8519aca1a44116eef699d08eacbbd51858e83cadf014eca6391c4d41412c8a9aeeae97e616386c8215472265d6b7b74b3e5eecaebe0266aa115c741206340e5ae22726fb637989a611ea00417c6f84d3b5b11ff833810b66bae660470d411ce0f23fd01278015993ea60abbecf70522b746ae262bb64e91319b5183b97242296ee4659afcdf32605883e456f527481de3b899261271433229d014666c627f947e776d4eb7284316b9aa068fda5619c144da0ee71d72d68d4d99b55955286fb21de284828c2cd7ca1c39c40a58f0339fe234e51511426cc1f7033c01d1754f83628442ace409e0eac6eb854e4ec8fae48d0797e66dfbf5c59715ea44e27b2d1ce31ad31f5bc9006296ac348e5917eb35a60e1895475d8c42e6f86a6aad59592f4054aa0fd3e2cbb5a0cfdd850b7c80f6cca7fd13331f8d0944969ce1a556dee372703138df53fcae535718fa068d0ae65844074899eceb7e43db398215c9211e4c476649ac20f4d214b5f7cd38007ba4d86fc9d02e19ea78a9b2cb9018e7185d53dfa728f50a231146ec22af48874aea429babd138096764d712ec37526f4a27828c9ded618741e99ace19ba4421bb4b0c1d43e1c9dae73b32c5521d7214c40c8db578764a0eb2aab359f24031407fe590f46ff13777d5041900fb49ac25ec6a9f840f2ef64abb3c924cd55168af8c6863c6fd49f1ea15cd2d155ec936bff5016a8fe03e54b20cc8743764f019f05649c348b79b3b32ec96832279f9387e6932d86593650a861be00601dabdf0f66e4a9e9277a68c6cfaf5aac417748996defcf23fb4a4595292e7b426e9d705bb5747b1792e7cdfcb51c64710fc2cc1ce8037f368606db30b17156a529fb64e5f596acbaf45b097ce212737d8380bd0ffe167843e047f8dfaf57b0718eff7c99d513ef685c5a1da7fabb8fa51794282897536166471dcf90e60318604fd7168314503ca8958301ff8959ced0a22fd69c1949f5127b740bd055912249eb89792c8bcd2feccffa264499d7e3b60d2f676172f402320958f5e97bbfbc16e20d059cfe3395e3908e8f5e6e8428b6f226dc3241b91dfd938f85929f4f57af78ce94fa0b6720239707c9cceaf517bccae79600e77169598aa8fcf6249f00bf2f82aa7bae973436eb902f1cb13c54f03afeef2a9ee7be54e6c0e77b28e9eeec4f189ede598a0d4dcfe7739025a1607d61a9a2b64c282989757a051f5d6438430cbb813a9101bbfa69aa1f34fab7621f82e5559e8ca994a71c8525f43acd93a391cb0350751e883c599ad93987533fe9166150ed5a38610bcbdfc76ac6456c22c2f73c105fa385c7322040704035d2f1e5f6b6fbc44cce57e362dc6e7ee5034bfe580c26e1f28daa79ecd13492172490cd65a7b6ecf4a6cd0465e3b212ddf774825f582d62d00d934f7b5da606db7990c00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000", "000065", 3, 1766928670, 1991772603, "87d8c670e83d86d9f5a2243fe673c859e97c86e520d2a4ab670fbb45d7494539"],
+	["030000807082c40304ac03c732f334b93fe7949bf2285844eaf6aadcaf8c7a5505f555db79af4876c503000000096a65ac526a6500ac52ffffffff0f3ca86227980610846e6649bd8a40ef011f1283027169deabd6443151c60c69010000000553ac636363ffffffff6cd43ef47a418cc5b9f11fd052b13c9a8edc96770edebdfd2954771592d4c80a0100000003ac6351ffffffffd0518accc36de1d0d46594d0ca67d19c4d797a041f20bb9072461f55eb640f1303000000085151520065520051e90e999301744d7c000000000009515251635263515200000000000000000000", "5300ac", 1, -1045325290, 733220448, "a11fadae0a3d6690e7d19515dad56d52420be322535dc6814ac83046b4252553"]
+]
diff --git a/depend/zcash/src/test/data/tt-delin1-out.hex b/depend/zcash/src/test/data/tt-delin1-out.hex
new file mode 100644
index 000000000..42ad840f4
--- /dev/null
+++ b/depend/zcash/src/test/data/tt-delin1-out.hex
@@ -0,0 +1 @@
+0100000014fd5c23522d31761c50175453daa6edaabe47a602a592d39ce933d8271a1a87274c0100006c493046022100b4251ecd63778a3dde0155abe4cd162947620ae9ee45a874353551092325b116022100db307baf4ff3781ec520bd18f387948cedd15dc27bafe17c894b0fe6ffffcafa012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffffc1b37ae964f605978022f94ce2f3f676d66a46d1aef7c2c17d6315b9697f2f75010000006a473044022079bd62ee09621a3be96b760c39e8ef78170101d46313923c6b07ae60a95c90670220238e51ea29fc70b04b65508450523caedbb11cb4dd5aa608c81487de798925ba0121027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34ffffffffedd005dc7790ef65c206abd1ab718e75252a40f4b1310e4102cd692eca9cacb0d10000006b48304502207722d6f9038673c86a1019b1c4de2d687ae246477cd4ca7002762be0299de385022100e594a11e3a313942595f7666dcf7078bcb14f1330f4206b95c917e7ec0e82fac012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffffdf28d6e26fb7a85a1e6a229b972c1bae0edc1c11cb9ca51e4caf5e59fbea35a1000000006b483045022100a63a4788027b79b65c6f9d9e054f68cf3b4eed19efd82a2d53f70dcbe64683390220526f243671425b2bd05745fcf2729361f985cfe84ea80c7cfc817b93d8134374012103a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52ffffffffae2a2320a1582faa24469eff3024a6b98bfe00eb4f554d8a0b1421ba53bfd6a5010000006c493046022100b200ac6db16842f76dab9abe807ce423c992805879bc50abd46ed8275a59d9cf022100c0d518e85dd345b3c29dd4dc47b9a420d3ce817b18720e94966d2fe23413a408012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffffb3cc5a12548aa1794b4d2bbf076838cfd7fbafb7716da51ee8221a4ff19c291b000000006b483045022100ededc441c3103a6f2bd6cab7639421af0f6ec5e60503bce1e603cf34f00aee1c02205cb75f3f519a13fb348783b21db3085cb5ec7552c59e394fdbc3e1feea43f967012103a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52ffffffff85145367313888d2cf2747274a32e20b2df074027bafd6f970003fcbcdf11d07150000006b483045022100d9eed5413d2a4b4b98625aa6e3169edc4fb4663e7862316d69224454e70cd8ca022061e506521d5ced51dd0ea36496e75904d756a4c4f9fb111568555075d5f68d9a012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff8292c11f6d35abab5bac3ebb627a4ff949e8ecd62d33ed137adf7aeb00e512b0090000006b48304502207e84b27139c4c19c828cb1e30c349bba88e4d9b59be97286960793b5ddc0a2af0221008cdc7a951e7f31c20953ed5635fbabf228e80b7047f32faaa0313e7693005177012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff883dcf9a86063db088ad064d0953258d4b0ff3425857402d2f3f839cee0f84581e0000006a4730440220426540dfed9c4ab5812e5f06df705b8bcf307dd7d20f7fa6512298b2a6314f420220064055096e3ca62f6c7352c66a5447767c53f946acdf35025ab3807ddb2fa404012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff6697dbb3ed98afe481b568459fa67e503f8a4254532465a670e54669d19c9fe6720000006a47304402200a5e673996f2fc88e21cc8613611f08a650bc0370338803591d85d0ec5663764022040b6664a0d1ec83a7f01975b8fde5232992b8ca58bf48af6725d2f92a936ab2e012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff023ffc2182517e1d3fa0896c5b0bd7b4d2ef8a1e42655abe2ced54f657125d59670000006c493046022100d93b30219c5735f673be5c3b4688366d96f545561c74cb62c6958c00f6960806022100ec8200adcb028f2184fa2a4f6faac7f8bb57cb4503bb7584ac11051fece31b3d012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffff16f8c77166b0df3d7cc8b5b2ce825afbea9309ad7acd8e2461a255958f81fc06010000006b483045022100a13934e68d3f5b22b130c4cb33f4da468cffc52323a47fbfbe06b64858162246022047081e0a70ff770e64a2e2d31e5d520d9102268b57a47009a72fe73ec766901801210234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cdffffffff197b96f3c87a3adfaa17f63fddc2a738a690ca665439f9431dbbd655816c41fb000000006c49304602210097f1f35d5bdc1a3a60390a1b015b8e7c4f916aa3847aafd969e04975e15bbe70022100a9052eb25517d481f1fda1b129eb1b534da50ea1a51f3ee012dca3601c11b86a0121027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34ffffffff20d9a261ee27aa1bd92e7db2fdca935909a40b648e974cd24a10d63b68b94039dd0000006b483045022012b3138c591bf7154b6fef457f2c4a3c7162225003788ac0024a99355865ff13022100b71b125ae1ffb2e1d1571f580cd3ebc8cd049a2d7a8a41f138ba94aeb982106f012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffff50f179d5d16cd872f9a63c26c448464ae9bd95cd9421c0476113b5d314571b71010000006b483045022100f834ccc8b22ee72712a3e5e6ef4acb8b2fb791b5385b70e2cd4332674d6667f4022024fbda0a997e0c253503f217501f508a4d56edce2c813ecdd9ad796dbeba907401210234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cdffffffff551b865d1568ac0a305e5f9c5dae6c540982334efbe789074318e0efc5b564631b0000006b48304502203b2fd1e39ae0e469d7a15768f262661b0de41470daf0fe8c4fd0c26542a0870002210081c57e331f9a2d214457d953e3542904727ee412c63028113635d7224da3dccc012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff57503e5a016189d407a721791459280875264f908ca2c5d4862c01386e7fb50b470400006b48304502206947a9c54f0664ece4430fd4ae999891dc50bb6126bc36b6a15a3189f29d25e9022100a86cfc4e2fdd9e39a20e305cfd1b76509c67b3e313e0f118229105caa0e823c9012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff3f16c1fb9d3e1a26d872933e955df85ee7f3f817711062b00b54a2144827349b250000006b483045022100c7128fe10b2d38744ae8177776054c29fc8ec13f07207723e70766ab7164847402201d2cf09009b9596de74c0183d1ab832e5edddb7a9965880bb400097e850850f8012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff4142a69d85b8498af214f0dd427b6ab29c240a0b8577e2944d37a7d8c05c6bb8140000006b48304502203b89a71628a28cc3703d170ca3be77786cff6b867e38a18b719705f8a326578f022100b2a9879e1acf621faa6466c207746a7f3eb4c8514c1482969aba3f2a957f1321012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff36e2feecc0a4bff7480015d42c12121932db389025ed0ac1d344ecee53230a3df20000006c493046022100ef794a8ef7fd6752d2a183c18866ff6e8dc0f5bd889a63e2c21cf303a6302461022100c1b09662d9e92988c3f9fcf17d1bcc79b5403647095d7212b9f8a1278a532d68012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffff0260f73608000000001976a9148fd139bb39ced713f231c58a4d07bf6954d1c20188ac41420f00000000001976a9146c772e9cf96371bba3da8cb733da70a2fcf2007888ac00000000
diff --git a/depend/zcash/src/test/data/tt-delin1-out.json b/depend/zcash/src/test/data/tt-delin1-out.json
new file mode 100644
index 000000000..c1ba54f80
--- /dev/null
+++ b/depend/zcash/src/test/data/tt-delin1-out.json
@@ -0,0 +1,216 @@
+{
+    "txid": "81b2035be1da1abe745c6141174a73d151009ec17b3d5ebffa2e177408c50dfd",
+    "version": 1,
+    "locktime": 0,
+    "vin": [
+        {
+            "txid": "27871a1a27d833e99cd392a502a647beaaeda6da535417501c76312d52235cfd",
+            "vout": 332,
+            "scriptSig": {
+                "asm": "3046022100b4251ecd63778a3dde0155abe4cd162947620ae9ee45a874353551092325b116022100db307baf4ff3781ec520bd18f387948cedd15dc27bafe17c894b0fe6ffffcafa[ALL] 03091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc",
+                "hex": "493046022100b4251ecd63778a3dde0155abe4cd162947620ae9ee45a874353551092325b116022100db307baf4ff3781ec520bd18f387948cedd15dc27bafe17c894b0fe6ffffcafa012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "752f7f69b915637dc1c2f7aed1466ad676f6f3e24cf922809705f664e97ab3c1",
+            "vout": 1,
+            "scriptSig": {
+                "asm": "3044022079bd62ee09621a3be96b760c39e8ef78170101d46313923c6b07ae60a95c90670220238e51ea29fc70b04b65508450523caedbb11cb4dd5aa608c81487de798925ba[ALL] 027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34",
+                "hex": "473044022079bd62ee09621a3be96b760c39e8ef78170101d46313923c6b07ae60a95c90670220238e51ea29fc70b04b65508450523caedbb11cb4dd5aa608c81487de798925ba0121027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "b0ac9cca2e69cd02410e31b1f4402a25758e71abd1ab06c265ef9077dc05d0ed",
+            "vout": 209,
+            "scriptSig": {
+                "asm": "304502207722d6f9038673c86a1019b1c4de2d687ae246477cd4ca7002762be0299de385022100e594a11e3a313942595f7666dcf7078bcb14f1330f4206b95c917e7ec0e82fac[ALL] 03091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc",
+                "hex": "48304502207722d6f9038673c86a1019b1c4de2d687ae246477cd4ca7002762be0299de385022100e594a11e3a313942595f7666dcf7078bcb14f1330f4206b95c917e7ec0e82fac012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "a135eafb595eaf4c1ea59ccb111cdc0eae1b2c979b226a1e5aa8b76fe2d628df",
+            "vout": 0,
+            "scriptSig": {
+                "asm": "3045022100a63a4788027b79b65c6f9d9e054f68cf3b4eed19efd82a2d53f70dcbe64683390220526f243671425b2bd05745fcf2729361f985cfe84ea80c7cfc817b93d8134374[ALL] 03a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52",
+                "hex": "483045022100a63a4788027b79b65c6f9d9e054f68cf3b4eed19efd82a2d53f70dcbe64683390220526f243671425b2bd05745fcf2729361f985cfe84ea80c7cfc817b93d8134374012103a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "a5d6bf53ba21140b8a4d554feb00fe8bb9a62430ff9e4624aa2f58a120232aae",
+            "vout": 1,
+            "scriptSig": {
+                "asm": "3046022100b200ac6db16842f76dab9abe807ce423c992805879bc50abd46ed8275a59d9cf022100c0d518e85dd345b3c29dd4dc47b9a420d3ce817b18720e94966d2fe23413a408[ALL] 03091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc",
+                "hex": "493046022100b200ac6db16842f76dab9abe807ce423c992805879bc50abd46ed8275a59d9cf022100c0d518e85dd345b3c29dd4dc47b9a420d3ce817b18720e94966d2fe23413a408012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "1b299cf14f1a22e81ea56d71b7affbd7cf386807bf2b4d4b79a18a54125accb3",
+            "vout": 0,
+            "scriptSig": {
+                "asm": "3045022100ededc441c3103a6f2bd6cab7639421af0f6ec5e60503bce1e603cf34f00aee1c02205cb75f3f519a13fb348783b21db3085cb5ec7552c59e394fdbc3e1feea43f967[ALL] 03a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52",
+                "hex": "483045022100ededc441c3103a6f2bd6cab7639421af0f6ec5e60503bce1e603cf34f00aee1c02205cb75f3f519a13fb348783b21db3085cb5ec7552c59e394fdbc3e1feea43f967012103a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "071df1cdcb3f0070f9d6af7b0274f02d0be2324a274727cfd288383167531485",
+            "vout": 21,
+            "scriptSig": {
+                "asm": "3045022100d9eed5413d2a4b4b98625aa6e3169edc4fb4663e7862316d69224454e70cd8ca022061e506521d5ced51dd0ea36496e75904d756a4c4f9fb111568555075d5f68d9a[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "483045022100d9eed5413d2a4b4b98625aa6e3169edc4fb4663e7862316d69224454e70cd8ca022061e506521d5ced51dd0ea36496e75904d756a4c4f9fb111568555075d5f68d9a012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "b012e500eb7adf7a13ed332dd6ece849f94f7a62bb3eac5babab356d1fc19282",
+            "vout": 9,
+            "scriptSig": {
+                "asm": "304502207e84b27139c4c19c828cb1e30c349bba88e4d9b59be97286960793b5ddc0a2af0221008cdc7a951e7f31c20953ed5635fbabf228e80b7047f32faaa0313e7693005177[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "48304502207e84b27139c4c19c828cb1e30c349bba88e4d9b59be97286960793b5ddc0a2af0221008cdc7a951e7f31c20953ed5635fbabf228e80b7047f32faaa0313e7693005177012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "58840fee9c833f2f2d40575842f30f4b8d2553094d06ad88b03d06869acf3d88",
+            "vout": 30,
+            "scriptSig": {
+                "asm": "30440220426540dfed9c4ab5812e5f06df705b8bcf307dd7d20f7fa6512298b2a6314f420220064055096e3ca62f6c7352c66a5447767c53f946acdf35025ab3807ddb2fa404[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "4730440220426540dfed9c4ab5812e5f06df705b8bcf307dd7d20f7fa6512298b2a6314f420220064055096e3ca62f6c7352c66a5447767c53f946acdf35025ab3807ddb2fa404012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "e69f9cd16946e570a665245354428a3f507ea69f4568b581e4af98edb3db9766",
+            "vout": 114,
+            "scriptSig": {
+                "asm": "304402200a5e673996f2fc88e21cc8613611f08a650bc0370338803591d85d0ec5663764022040b6664a0d1ec83a7f01975b8fde5232992b8ca58bf48af6725d2f92a936ab2e[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "47304402200a5e673996f2fc88e21cc8613611f08a650bc0370338803591d85d0ec5663764022040b6664a0d1ec83a7f01975b8fde5232992b8ca58bf48af6725d2f92a936ab2e012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "595d1257f654ed2cbe5a65421e8aefd2b4d70b5b6c89a03f1d7e518221fc3f02",
+            "vout": 103,
+            "scriptSig": {
+                "asm": "3046022100d93b30219c5735f673be5c3b4688366d96f545561c74cb62c6958c00f6960806022100ec8200adcb028f2184fa2a4f6faac7f8bb57cb4503bb7584ac11051fece31b3d[ALL] 03091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc",
+                "hex": "493046022100d93b30219c5735f673be5c3b4688366d96f545561c74cb62c6958c00f6960806022100ec8200adcb028f2184fa2a4f6faac7f8bb57cb4503bb7584ac11051fece31b3d012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "06fc818f9555a261248ecd7aad0993eafb5a82ceb2b5c87c3ddfb06671c7f816",
+            "vout": 1,
+            "scriptSig": {
+                "asm": "3045022100a13934e68d3f5b22b130c4cb33f4da468cffc52323a47fbfbe06b64858162246022047081e0a70ff770e64a2e2d31e5d520d9102268b57a47009a72fe73ec7669018[ALL] 0234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cd",
+                "hex": "483045022100a13934e68d3f5b22b130c4cb33f4da468cffc52323a47fbfbe06b64858162246022047081e0a70ff770e64a2e2d31e5d520d9102268b57a47009a72fe73ec766901801210234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cd"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "fb416c8155d6bb1d43f9395466ca90a638a7c2dd3ff617aadf3a7ac8f3967b19",
+            "vout": 0,
+            "scriptSig": {
+                "asm": "304602210097f1f35d5bdc1a3a60390a1b015b8e7c4f916aa3847aafd969e04975e15bbe70022100a9052eb25517d481f1fda1b129eb1b534da50ea1a51f3ee012dca3601c11b86a[ALL] 027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34",
+                "hex": "49304602210097f1f35d5bdc1a3a60390a1b015b8e7c4f916aa3847aafd969e04975e15bbe70022100a9052eb25517d481f1fda1b129eb1b534da50ea1a51f3ee012dca3601c11b86a0121027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "3940b9683bd6104ad24c978e640ba4095993cafdb27d2ed91baa27ee61a2d920",
+            "vout": 221,
+            "scriptSig": {
+                "asm": "3045022012b3138c591bf7154b6fef457f2c4a3c7162225003788ac0024a99355865ff13022100b71b125ae1ffb2e1d1571f580cd3ebc8cd049a2d7a8a41f138ba94aeb982106f[ALL] 03091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc",
+                "hex": "483045022012b3138c591bf7154b6fef457f2c4a3c7162225003788ac0024a99355865ff13022100b71b125ae1ffb2e1d1571f580cd3ebc8cd049a2d7a8a41f138ba94aeb982106f012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "711b5714d3b5136147c02194cd95bde94a4648c4263ca6f972d86cd1d579f150",
+            "vout": 1,
+            "scriptSig": {
+                "asm": "3045022100f834ccc8b22ee72712a3e5e6ef4acb8b2fb791b5385b70e2cd4332674d6667f4022024fbda0a997e0c253503f217501f508a4d56edce2c813ecdd9ad796dbeba9074[ALL] 0234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cd",
+                "hex": "483045022100f834ccc8b22ee72712a3e5e6ef4acb8b2fb791b5385b70e2cd4332674d6667f4022024fbda0a997e0c253503f217501f508a4d56edce2c813ecdd9ad796dbeba907401210234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cd"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "6364b5c5efe018430789e7fb4e338209546cae5d9c5f5e300aac68155d861b55",
+            "vout": 27,
+            "scriptSig": {
+                "asm": "304502203b2fd1e39ae0e469d7a15768f262661b0de41470daf0fe8c4fd0c26542a0870002210081c57e331f9a2d214457d953e3542904727ee412c63028113635d7224da3dccc[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "48304502203b2fd1e39ae0e469d7a15768f262661b0de41470daf0fe8c4fd0c26542a0870002210081c57e331f9a2d214457d953e3542904727ee412c63028113635d7224da3dccc012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "0bb57f6e38012c86d4c5a28c904f2675082859147921a707d48961015a3e5057",
+            "vout": 1095,
+            "scriptSig": {
+                "asm": "304502206947a9c54f0664ece4430fd4ae999891dc50bb6126bc36b6a15a3189f29d25e9022100a86cfc4e2fdd9e39a20e305cfd1b76509c67b3e313e0f118229105caa0e823c9[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "48304502206947a9c54f0664ece4430fd4ae999891dc50bb6126bc36b6a15a3189f29d25e9022100a86cfc4e2fdd9e39a20e305cfd1b76509c67b3e313e0f118229105caa0e823c9012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "9b34274814a2540bb062107117f8f3e75ef85d953e9372d8261a3e9dfbc1163f",
+            "vout": 37,
+            "scriptSig": {
+                "asm": "3045022100c7128fe10b2d38744ae8177776054c29fc8ec13f07207723e70766ab7164847402201d2cf09009b9596de74c0183d1ab832e5edddb7a9965880bb400097e850850f8[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "483045022100c7128fe10b2d38744ae8177776054c29fc8ec13f07207723e70766ab7164847402201d2cf09009b9596de74c0183d1ab832e5edddb7a9965880bb400097e850850f8012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "b86b5cc0d8a7374d94e277850b0a249cb26a7b42ddf014f28a49b8859da64241",
+            "vout": 20,
+            "scriptSig": {
+                "asm": "304502203b89a71628a28cc3703d170ca3be77786cff6b867e38a18b719705f8a326578f022100b2a9879e1acf621faa6466c207746a7f3eb4c8514c1482969aba3f2a957f1321[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "48304502203b89a71628a28cc3703d170ca3be77786cff6b867e38a18b719705f8a326578f022100b2a9879e1acf621faa6466c207746a7f3eb4c8514c1482969aba3f2a957f1321012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "3d0a2353eeec44d3c10aed259038db321912122cd4150048f7bfa4c0ecfee236",
+            "vout": 242,
+            "scriptSig": {
+                "asm": "3046022100ef794a8ef7fd6752d2a183c18866ff6e8dc0f5bd889a63e2c21cf303a6302461022100c1b09662d9e92988c3f9fcf17d1bcc79b5403647095d7212b9f8a1278a532d68[ALL] 03091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc",
+                "hex": "493046022100ef794a8ef7fd6752d2a183c18866ff6e8dc0f5bd889a63e2c21cf303a6302461022100c1b09662d9e92988c3f9fcf17d1bcc79b5403647095d7212b9f8a1278a532d68012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc"
+            },
+            "sequence": 4294967295
+        }
+    ],
+    "vout": [
+        {
+            "value": 1.3782,
+            "n": 0,
+            "scriptPubKey": {
+                "asm": "OP_DUP OP_HASH160 8fd139bb39ced713f231c58a4d07bf6954d1c201 OP_EQUALVERIFY OP_CHECKSIG",
+                "hex": "76a9148fd139bb39ced713f231c58a4d07bf6954d1c20188ac",
+                "reqSigs": 1,
+                "type": "pubkeyhash",
+                "addresses": [
+                    "t1Wz3H1ahDX4pP8cEqrJqernQ2d1SSipmiQ"
+                ]
+            }
+        },
+        {
+            "value": 0.01000001,
+            "n": 1,
+            "scriptPubKey": {
+                "asm": "OP_DUP OP_HASH160 6c772e9cf96371bba3da8cb733da70a2fcf20078 OP_EQUALVERIFY OP_CHECKSIG",
+                "hex": "76a9146c772e9cf96371bba3da8cb733da70a2fcf2007888ac",
+                "reqSigs": 1,
+                "type": "pubkeyhash",
+                "addresses": [
+                    "t1Tm7kyBojsXqT73zZU8g7ZQPqu1E8gaHQ9"
+                ]
+            }
+        }
+    ],
+    "hex": "0100000014fd5c23522d31761c50175453daa6edaabe47a602a592d39ce933d8271a1a87274c0100006c493046022100b4251ecd63778a3dde0155abe4cd162947620ae9ee45a874353551092325b116022100db307baf4ff3781ec520bd18f387948cedd15dc27bafe17c894b0fe6ffffcafa012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffffc1b37ae964f605978022f94ce2f3f676d66a46d1aef7c2c17d6315b9697f2f75010000006a473044022079bd62ee09621a3be96b760c39e8ef78170101d46313923c6b07ae60a95c90670220238e51ea29fc70b04b65508450523caedbb11cb4dd5aa608c81487de798925ba0121027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34ffffffffedd005dc7790ef65c206abd1ab718e75252a40f4b1310e4102cd692eca9cacb0d10000006b48304502207722d6f9038673c86a1019b1c4de2d687ae246477cd4ca7002762be0299de385022100e594a11e3a313942595f7666dcf7078bcb14f1330f4206b95c917e7ec0e82fac012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffffdf28d6e26fb7a85a1e6a229b972c1bae0edc1c11cb9ca51e4caf5e59fbea35a1000000006b483045022100a63a4788027b79b65c6f9d9e054f68cf3b4eed19efd82a2d53f70dcbe64683390220526f243671425b2bd05745fcf2729361f985cfe84ea80c7cfc817b93d8134374012103a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52ffffffffae2a2320a1582faa24469eff3024a6b98bfe00eb4f554d8a0b1421ba53bfd6a5010000006c493046022100b200ac6db16842f76dab9abe807ce423c992805879bc50abd46ed8275a59d9cf022100c0d518e85dd345b3c29dd4dc47b9a420d3ce817b18720e94966d2fe23413a408012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffffb3cc5a12548aa1794b4d2bbf076838cfd7fbafb7716da51ee8221a4ff19c291b000000006b483045022100ededc441c3103a6f2bd6cab7639421af0f6ec5e60503bce1e603cf34f00aee1c02205cb75f3f519a13fb348783b21db3085cb5ec7552c59e394fdbc3e1feea43f967012103a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52ffffffff85145367313888d2cf2747274a32e20b2df074027bafd6f970003fcbcdf11d07150000006b483045022100d9eed5413d2a4b4b98625aa6e3169edc4fb4663e7862316d69224454e70cd8ca022061e506521d5ced51dd0ea36496e75904d756a4c4f9fb111568555075d5f68d9a012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff8292c11f6d35abab5bac3ebb627a4ff949e8ecd62d33ed137adf7aeb00e512b0090000006b48304502207e84b27139c4c19c828cb1e30c349bba88e4d9b59be97286960793b5ddc0a2af0221008cdc7a951e7f31c20953ed5635fbabf228e80b7047f32faaa0313e7693005177012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff883dcf9a86063db088ad064d0953258d4b0ff3425857402d2f3f839cee0f84581e0000006a4730440220426540dfed9c4ab5812e5f06df705b8bcf307dd7d20f7fa6512298b2a6314f420220064055096e3ca62f6c7352c66a5447767c53f946acdf35025ab3807ddb2fa404012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff6697dbb3ed98afe481b568459fa67e503f8a4254532465a670e54669d19c9fe6720000006a47304402200a5e673996f2fc88e21cc8613611f08a650bc0370338803591d85d0ec5663764022040b6664a0d1ec83a7f01975b8fde5232992b8ca58bf48af6725d2f92a936ab2e012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff023ffc2182517e1d3fa0896c5b0bd7b4d2ef8a1e42655abe2ced54f657125d59670000006c493046022100d93b30219c5735f673be5c3b4688366d96f545561c74cb62c6958c00f6960806022100ec8200adcb028f2184fa2a4f6faac7f8bb57cb4503bb7584ac11051fece31b3d012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffff16f8c77166b0df3d7cc8b5b2ce825afbea9309ad7acd8e2461a255958f81fc06010000006b483045022100a13934e68d3f5b22b130c4cb33f4da468cffc52323a47fbfbe06b64858162246022047081e0a70ff770e64a2e2d31e5d520d9102268b57a47009a72fe73ec766901801210234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cdffffffff197b96f3c87a3adfaa17f63fddc2a738a690ca665439f9431dbbd655816c41fb000000006c49304602210097f1f35d5bdc1a3a60390a1b015b8e7c4f916aa3847aafd969e04975e15bbe70022100a9052eb25517d481f1fda1b129eb1b534da50ea1a51f3ee012dca3601c11b86a0121027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34ffffffff20d9a261ee27aa1bd92e7db2fdca935909a40b648e974cd24a10d63b68b94039dd0000006b483045022012b3138c591bf7154b6fef457f2c4a3c7162225003788ac0024a99355865ff13022100b71b125ae1ffb2e1d1571f580cd3ebc8cd049a2d7a8a41f138ba94aeb982106f012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffff50f179d5d16cd872f9a63c26c448464ae9bd95cd9421c0476113b5d314571b71010000006b483045022100f834ccc8b22ee72712a3e5e6ef4acb8b2fb791b5385b70e2cd4332674d6667f4022024fbda0a997e0c253503f217501f508a4d56edce2c813ecdd9ad796dbeba907401210234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cdffffffff551b865d1568ac0a305e5f9c5dae6c540982334efbe789074318e0efc5b564631b0000006b48304502203b2fd1e39ae0e469d7a15768f262661b0de41470daf0fe8c4fd0c26542a0870002210081c57e331f9a2d214457d953e3542904727ee412c63028113635d7224da3dccc012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff57503e5a016189d407a721791459280875264f908ca2c5d4862c01386e7fb50b470400006b48304502206947a9c54f0664ece4430fd4ae999891dc50bb6126bc36b6a15a3189f29d25e9022100a86cfc4e2fdd9e39a20e305cfd1b76509c67b3e313e0f118229105caa0e823c9012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff3f16c1fb9d3e1a26d872933e955df85ee7f3f817711062b00b54a2144827349b250000006b483045022100c7128fe10b2d38744ae8177776054c29fc8ec13f07207723e70766ab7164847402201d2cf09009b9596de74c0183d1ab832e5edddb7a9965880bb400097e850850f8012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff4142a69d85b8498af214f0dd427b6ab29c240a0b8577e2944d37a7d8c05c6bb8140000006b48304502203b89a71628a28cc3703d170ca3be77786cff6b867e38a18b719705f8a326578f022100b2a9879e1acf621faa6466c207746a7f3eb4c8514c1482969aba3f2a957f1321012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff36e2feecc0a4bff7480015d42c12121932db389025ed0ac1d344ecee53230a3df20000006c493046022100ef794a8ef7fd6752d2a183c18866ff6e8dc0f5bd889a63e2c21cf303a6302461022100c1b09662d9e92988c3f9fcf17d1bcc79b5403647095d7212b9f8a1278a532d68012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffff0260f73608000000001976a9148fd139bb39ced713f231c58a4d07bf6954d1c20188ac41420f00000000001976a9146c772e9cf96371bba3da8cb733da70a2fcf2007888ac00000000"
+}
diff --git a/depend/zcash/src/test/data/tt-delout1-out.hex b/depend/zcash/src/test/data/tt-delout1-out.hex
new file mode 100644
index 000000000..cc60c3fac
--- /dev/null
+++ b/depend/zcash/src/test/data/tt-delout1-out.hex
@@ -0,0 +1 @@
+0100000015fd5c23522d31761c50175453daa6edaabe47a602a592d39ce933d8271a1a87274c0100006c493046022100b4251ecd63778a3dde0155abe4cd162947620ae9ee45a874353551092325b116022100db307baf4ff3781ec520bd18f387948cedd15dc27bafe17c894b0fe6ffffcafa012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffffcb4ed1baba3a1eb2171e00ddec8e5b72b346dd8c07f9c2b0d122d0d06bc92ea7000000006c493046022100a9b617843b68c284715d3e02fd120479cd0d96a6c43bf01e697fb0a460a21a3a022100ba0a12fbe8b993d4e7911fa3467615765dbe421ddf5c51b57a9c1ee19dcc00ba012103e633b4fa4ceb705c2da712390767199be8ef2448b3095dc01652e11b2b751505ffffffffc1b37ae964f605978022f94ce2f3f676d66a46d1aef7c2c17d6315b9697f2f75010000006a473044022079bd62ee09621a3be96b760c39e8ef78170101d46313923c6b07ae60a95c90670220238e51ea29fc70b04b65508450523caedbb11cb4dd5aa608c81487de798925ba0121027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34ffffffffedd005dc7790ef65c206abd1ab718e75252a40f4b1310e4102cd692eca9cacb0d10000006b48304502207722d6f9038673c86a1019b1c4de2d687ae246477cd4ca7002762be0299de385022100e594a11e3a313942595f7666dcf7078bcb14f1330f4206b95c917e7ec0e82fac012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffffdf28d6e26fb7a85a1e6a229b972c1bae0edc1c11cb9ca51e4caf5e59fbea35a1000000006b483045022100a63a4788027b79b65c6f9d9e054f68cf3b4eed19efd82a2d53f70dcbe64683390220526f243671425b2bd05745fcf2729361f985cfe84ea80c7cfc817b93d8134374012103a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52ffffffffae2a2320a1582faa24469eff3024a6b98bfe00eb4f554d8a0b1421ba53bfd6a5010000006c493046022100b200ac6db16842f76dab9abe807ce423c992805879bc50abd46ed8275a59d9cf022100c0d518e85dd345b3c29dd4dc47b9a420d3ce817b18720e94966d2fe23413a408012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffffb3cc5a12548aa1794b4d2bbf076838cfd7fbafb7716da51ee8221a4ff19c291b000000006b483045022100ededc441c3103a6f2bd6cab7639421af0f6ec5e60503bce1e603cf34f00aee1c02205cb75f3f519a13fb348783b21db3085cb5ec7552c59e394fdbc3e1feea43f967012103a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52ffffffff85145367313888d2cf2747274a32e20b2df074027bafd6f970003fcbcdf11d07150000006b483045022100d9eed5413d2a4b4b98625aa6e3169edc4fb4663e7862316d69224454e70cd8ca022061e506521d5ced51dd0ea36496e75904d756a4c4f9fb111568555075d5f68d9a012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff8292c11f6d35abab5bac3ebb627a4ff949e8ecd62d33ed137adf7aeb00e512b0090000006b48304502207e84b27139c4c19c828cb1e30c349bba88e4d9b59be97286960793b5ddc0a2af0221008cdc7a951e7f31c20953ed5635fbabf228e80b7047f32faaa0313e7693005177012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff883dcf9a86063db088ad064d0953258d4b0ff3425857402d2f3f839cee0f84581e0000006a4730440220426540dfed9c4ab5812e5f06df705b8bcf307dd7d20f7fa6512298b2a6314f420220064055096e3ca62f6c7352c66a5447767c53f946acdf35025ab3807ddb2fa404012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff6697dbb3ed98afe481b568459fa67e503f8a4254532465a670e54669d19c9fe6720000006a47304402200a5e673996f2fc88e21cc8613611f08a650bc0370338803591d85d0ec5663764022040b6664a0d1ec83a7f01975b8fde5232992b8ca58bf48af6725d2f92a936ab2e012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff023ffc2182517e1d3fa0896c5b0bd7b4d2ef8a1e42655abe2ced54f657125d59670000006c493046022100d93b30219c5735f673be5c3b4688366d96f545561c74cb62c6958c00f6960806022100ec8200adcb028f2184fa2a4f6faac7f8bb57cb4503bb7584ac11051fece31b3d012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffff16f8c77166b0df3d7cc8b5b2ce825afbea9309ad7acd8e2461a255958f81fc06010000006b483045022100a13934e68d3f5b22b130c4cb33f4da468cffc52323a47fbfbe06b64858162246022047081e0a70ff770e64a2e2d31e5d520d9102268b57a47009a72fe73ec766901801210234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cdffffffff197b96f3c87a3adfaa17f63fddc2a738a690ca665439f9431dbbd655816c41fb000000006c49304602210097f1f35d5bdc1a3a60390a1b015b8e7c4f916aa3847aafd969e04975e15bbe70022100a9052eb25517d481f1fda1b129eb1b534da50ea1a51f3ee012dca3601c11b86a0121027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34ffffffff20d9a261ee27aa1bd92e7db2fdca935909a40b648e974cd24a10d63b68b94039dd0000006b483045022012b3138c591bf7154b6fef457f2c4a3c7162225003788ac0024a99355865ff13022100b71b125ae1ffb2e1d1571f580cd3ebc8cd049a2d7a8a41f138ba94aeb982106f012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffff50f179d5d16cd872f9a63c26c448464ae9bd95cd9421c0476113b5d314571b71010000006b483045022100f834ccc8b22ee72712a3e5e6ef4acb8b2fb791b5385b70e2cd4332674d6667f4022024fbda0a997e0c253503f217501f508a4d56edce2c813ecdd9ad796dbeba907401210234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cdffffffff551b865d1568ac0a305e5f9c5dae6c540982334efbe789074318e0efc5b564631b0000006b48304502203b2fd1e39ae0e469d7a15768f262661b0de41470daf0fe8c4fd0c26542a0870002210081c57e331f9a2d214457d953e3542904727ee412c63028113635d7224da3dccc012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff57503e5a016189d407a721791459280875264f908ca2c5d4862c01386e7fb50b470400006b48304502206947a9c54f0664ece4430fd4ae999891dc50bb6126bc36b6a15a3189f29d25e9022100a86cfc4e2fdd9e39a20e305cfd1b76509c67b3e313e0f118229105caa0e823c9012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff3f16c1fb9d3e1a26d872933e955df85ee7f3f817711062b00b54a2144827349b250000006b483045022100c7128fe10b2d38744ae8177776054c29fc8ec13f07207723e70766ab7164847402201d2cf09009b9596de74c0183d1ab832e5edddb7a9965880bb400097e850850f8012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff4142a69d85b8498af214f0dd427b6ab29c240a0b8577e2944d37a7d8c05c6bb8140000006b48304502203b89a71628a28cc3703d170ca3be77786cff6b867e38a18b719705f8a326578f022100b2a9879e1acf621faa6466c207746a7f3eb4c8514c1482969aba3f2a957f1321012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff36e2feecc0a4bff7480015d42c12121932db389025ed0ac1d344ecee53230a3df20000006c493046022100ef794a8ef7fd6752d2a183c18866ff6e8dc0f5bd889a63e2c21cf303a6302461022100c1b09662d9e92988c3f9fcf17d1bcc79b5403647095d7212b9f8a1278a532d68012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffff0160f73608000000001976a9148fd139bb39ced713f231c58a4d07bf6954d1c20188ac00000000
diff --git a/depend/zcash/src/test/data/tt-delout1-out.json b/depend/zcash/src/test/data/tt-delout1-out.json
new file mode 100644
index 000000000..8b7701fd9
--- /dev/null
+++ b/depend/zcash/src/test/data/tt-delout1-out.json
@@ -0,0 +1,212 @@
+{
+    "txid": "c46ccd75b5050e942b2e86a3648f843f525fe6fc000bf0534ba5973063354493",
+    "version": 1,
+    "locktime": 0,
+    "vin": [
+        {
+            "txid": "27871a1a27d833e99cd392a502a647beaaeda6da535417501c76312d52235cfd",
+            "vout": 332,
+            "scriptSig": {
+                "asm": "3046022100b4251ecd63778a3dde0155abe4cd162947620ae9ee45a874353551092325b116022100db307baf4ff3781ec520bd18f387948cedd15dc27bafe17c894b0fe6ffffcafa[ALL] 03091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc",
+                "hex": "493046022100b4251ecd63778a3dde0155abe4cd162947620ae9ee45a874353551092325b116022100db307baf4ff3781ec520bd18f387948cedd15dc27bafe17c894b0fe6ffffcafa012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "a72ec96bd0d022d1b0c2f9078cdd46b3725b8eecdd001e17b21e3ababad14ecb",
+            "vout": 0,
+            "scriptSig": {
+                "asm": "3046022100a9b617843b68c284715d3e02fd120479cd0d96a6c43bf01e697fb0a460a21a3a022100ba0a12fbe8b993d4e7911fa3467615765dbe421ddf5c51b57a9c1ee19dcc00ba[ALL] 03e633b4fa4ceb705c2da712390767199be8ef2448b3095dc01652e11b2b751505",
+                "hex": "493046022100a9b617843b68c284715d3e02fd120479cd0d96a6c43bf01e697fb0a460a21a3a022100ba0a12fbe8b993d4e7911fa3467615765dbe421ddf5c51b57a9c1ee19dcc00ba012103e633b4fa4ceb705c2da712390767199be8ef2448b3095dc01652e11b2b751505"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "752f7f69b915637dc1c2f7aed1466ad676f6f3e24cf922809705f664e97ab3c1",
+            "vout": 1,
+            "scriptSig": {
+                "asm": "3044022079bd62ee09621a3be96b760c39e8ef78170101d46313923c6b07ae60a95c90670220238e51ea29fc70b04b65508450523caedbb11cb4dd5aa608c81487de798925ba[ALL] 027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34",
+                "hex": "473044022079bd62ee09621a3be96b760c39e8ef78170101d46313923c6b07ae60a95c90670220238e51ea29fc70b04b65508450523caedbb11cb4dd5aa608c81487de798925ba0121027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "b0ac9cca2e69cd02410e31b1f4402a25758e71abd1ab06c265ef9077dc05d0ed",
+            "vout": 209,
+            "scriptSig": {
+                "asm": "304502207722d6f9038673c86a1019b1c4de2d687ae246477cd4ca7002762be0299de385022100e594a11e3a313942595f7666dcf7078bcb14f1330f4206b95c917e7ec0e82fac[ALL] 03091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc",
+                "hex": "48304502207722d6f9038673c86a1019b1c4de2d687ae246477cd4ca7002762be0299de385022100e594a11e3a313942595f7666dcf7078bcb14f1330f4206b95c917e7ec0e82fac012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "a135eafb595eaf4c1ea59ccb111cdc0eae1b2c979b226a1e5aa8b76fe2d628df",
+            "vout": 0,
+            "scriptSig": {
+                "asm": "3045022100a63a4788027b79b65c6f9d9e054f68cf3b4eed19efd82a2d53f70dcbe64683390220526f243671425b2bd05745fcf2729361f985cfe84ea80c7cfc817b93d8134374[ALL] 03a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52",
+                "hex": "483045022100a63a4788027b79b65c6f9d9e054f68cf3b4eed19efd82a2d53f70dcbe64683390220526f243671425b2bd05745fcf2729361f985cfe84ea80c7cfc817b93d8134374012103a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "a5d6bf53ba21140b8a4d554feb00fe8bb9a62430ff9e4624aa2f58a120232aae",
+            "vout": 1,
+            "scriptSig": {
+                "asm": "3046022100b200ac6db16842f76dab9abe807ce423c992805879bc50abd46ed8275a59d9cf022100c0d518e85dd345b3c29dd4dc47b9a420d3ce817b18720e94966d2fe23413a408[ALL] 03091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc",
+                "hex": "493046022100b200ac6db16842f76dab9abe807ce423c992805879bc50abd46ed8275a59d9cf022100c0d518e85dd345b3c29dd4dc47b9a420d3ce817b18720e94966d2fe23413a408012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "1b299cf14f1a22e81ea56d71b7affbd7cf386807bf2b4d4b79a18a54125accb3",
+            "vout": 0,
+            "scriptSig": {
+                "asm": "3045022100ededc441c3103a6f2bd6cab7639421af0f6ec5e60503bce1e603cf34f00aee1c02205cb75f3f519a13fb348783b21db3085cb5ec7552c59e394fdbc3e1feea43f967[ALL] 03a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52",
+                "hex": "483045022100ededc441c3103a6f2bd6cab7639421af0f6ec5e60503bce1e603cf34f00aee1c02205cb75f3f519a13fb348783b21db3085cb5ec7552c59e394fdbc3e1feea43f967012103a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "071df1cdcb3f0070f9d6af7b0274f02d0be2324a274727cfd288383167531485",
+            "vout": 21,
+            "scriptSig": {
+                "asm": "3045022100d9eed5413d2a4b4b98625aa6e3169edc4fb4663e7862316d69224454e70cd8ca022061e506521d5ced51dd0ea36496e75904d756a4c4f9fb111568555075d5f68d9a[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "483045022100d9eed5413d2a4b4b98625aa6e3169edc4fb4663e7862316d69224454e70cd8ca022061e506521d5ced51dd0ea36496e75904d756a4c4f9fb111568555075d5f68d9a012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "b012e500eb7adf7a13ed332dd6ece849f94f7a62bb3eac5babab356d1fc19282",
+            "vout": 9,
+            "scriptSig": {
+                "asm": "304502207e84b27139c4c19c828cb1e30c349bba88e4d9b59be97286960793b5ddc0a2af0221008cdc7a951e7f31c20953ed5635fbabf228e80b7047f32faaa0313e7693005177[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "48304502207e84b27139c4c19c828cb1e30c349bba88e4d9b59be97286960793b5ddc0a2af0221008cdc7a951e7f31c20953ed5635fbabf228e80b7047f32faaa0313e7693005177012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "58840fee9c833f2f2d40575842f30f4b8d2553094d06ad88b03d06869acf3d88",
+            "vout": 30,
+            "scriptSig": {
+                "asm": "30440220426540dfed9c4ab5812e5f06df705b8bcf307dd7d20f7fa6512298b2a6314f420220064055096e3ca62f6c7352c66a5447767c53f946acdf35025ab3807ddb2fa404[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "4730440220426540dfed9c4ab5812e5f06df705b8bcf307dd7d20f7fa6512298b2a6314f420220064055096e3ca62f6c7352c66a5447767c53f946acdf35025ab3807ddb2fa404012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "e69f9cd16946e570a665245354428a3f507ea69f4568b581e4af98edb3db9766",
+            "vout": 114,
+            "scriptSig": {
+                "asm": "304402200a5e673996f2fc88e21cc8613611f08a650bc0370338803591d85d0ec5663764022040b6664a0d1ec83a7f01975b8fde5232992b8ca58bf48af6725d2f92a936ab2e[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "47304402200a5e673996f2fc88e21cc8613611f08a650bc0370338803591d85d0ec5663764022040b6664a0d1ec83a7f01975b8fde5232992b8ca58bf48af6725d2f92a936ab2e012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "595d1257f654ed2cbe5a65421e8aefd2b4d70b5b6c89a03f1d7e518221fc3f02",
+            "vout": 103,
+            "scriptSig": {
+                "asm": "3046022100d93b30219c5735f673be5c3b4688366d96f545561c74cb62c6958c00f6960806022100ec8200adcb028f2184fa2a4f6faac7f8bb57cb4503bb7584ac11051fece31b3d[ALL] 03091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc",
+                "hex": "493046022100d93b30219c5735f673be5c3b4688366d96f545561c74cb62c6958c00f6960806022100ec8200adcb028f2184fa2a4f6faac7f8bb57cb4503bb7584ac11051fece31b3d012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "06fc818f9555a261248ecd7aad0993eafb5a82ceb2b5c87c3ddfb06671c7f816",
+            "vout": 1,
+            "scriptSig": {
+                "asm": "3045022100a13934e68d3f5b22b130c4cb33f4da468cffc52323a47fbfbe06b64858162246022047081e0a70ff770e64a2e2d31e5d520d9102268b57a47009a72fe73ec7669018[ALL] 0234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cd",
+                "hex": "483045022100a13934e68d3f5b22b130c4cb33f4da468cffc52323a47fbfbe06b64858162246022047081e0a70ff770e64a2e2d31e5d520d9102268b57a47009a72fe73ec766901801210234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cd"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "fb416c8155d6bb1d43f9395466ca90a638a7c2dd3ff617aadf3a7ac8f3967b19",
+            "vout": 0,
+            "scriptSig": {
+                "asm": "304602210097f1f35d5bdc1a3a60390a1b015b8e7c4f916aa3847aafd969e04975e15bbe70022100a9052eb25517d481f1fda1b129eb1b534da50ea1a51f3ee012dca3601c11b86a[ALL] 027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34",
+                "hex": "49304602210097f1f35d5bdc1a3a60390a1b015b8e7c4f916aa3847aafd969e04975e15bbe70022100a9052eb25517d481f1fda1b129eb1b534da50ea1a51f3ee012dca3601c11b86a0121027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "3940b9683bd6104ad24c978e640ba4095993cafdb27d2ed91baa27ee61a2d920",
+            "vout": 221,
+            "scriptSig": {
+                "asm": "3045022012b3138c591bf7154b6fef457f2c4a3c7162225003788ac0024a99355865ff13022100b71b125ae1ffb2e1d1571f580cd3ebc8cd049a2d7a8a41f138ba94aeb982106f[ALL] 03091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc",
+                "hex": "483045022012b3138c591bf7154b6fef457f2c4a3c7162225003788ac0024a99355865ff13022100b71b125ae1ffb2e1d1571f580cd3ebc8cd049a2d7a8a41f138ba94aeb982106f012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "711b5714d3b5136147c02194cd95bde94a4648c4263ca6f972d86cd1d579f150",
+            "vout": 1,
+            "scriptSig": {
+                "asm": "3045022100f834ccc8b22ee72712a3e5e6ef4acb8b2fb791b5385b70e2cd4332674d6667f4022024fbda0a997e0c253503f217501f508a4d56edce2c813ecdd9ad796dbeba9074[ALL] 0234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cd",
+                "hex": "483045022100f834ccc8b22ee72712a3e5e6ef4acb8b2fb791b5385b70e2cd4332674d6667f4022024fbda0a997e0c253503f217501f508a4d56edce2c813ecdd9ad796dbeba907401210234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cd"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "6364b5c5efe018430789e7fb4e338209546cae5d9c5f5e300aac68155d861b55",
+            "vout": 27,
+            "scriptSig": {
+                "asm": "304502203b2fd1e39ae0e469d7a15768f262661b0de41470daf0fe8c4fd0c26542a0870002210081c57e331f9a2d214457d953e3542904727ee412c63028113635d7224da3dccc[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "48304502203b2fd1e39ae0e469d7a15768f262661b0de41470daf0fe8c4fd0c26542a0870002210081c57e331f9a2d214457d953e3542904727ee412c63028113635d7224da3dccc012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "0bb57f6e38012c86d4c5a28c904f2675082859147921a707d48961015a3e5057",
+            "vout": 1095,
+            "scriptSig": {
+                "asm": "304502206947a9c54f0664ece4430fd4ae999891dc50bb6126bc36b6a15a3189f29d25e9022100a86cfc4e2fdd9e39a20e305cfd1b76509c67b3e313e0f118229105caa0e823c9[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "48304502206947a9c54f0664ece4430fd4ae999891dc50bb6126bc36b6a15a3189f29d25e9022100a86cfc4e2fdd9e39a20e305cfd1b76509c67b3e313e0f118229105caa0e823c9012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "9b34274814a2540bb062107117f8f3e75ef85d953e9372d8261a3e9dfbc1163f",
+            "vout": 37,
+            "scriptSig": {
+                "asm": "3045022100c7128fe10b2d38744ae8177776054c29fc8ec13f07207723e70766ab7164847402201d2cf09009b9596de74c0183d1ab832e5edddb7a9965880bb400097e850850f8[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "483045022100c7128fe10b2d38744ae8177776054c29fc8ec13f07207723e70766ab7164847402201d2cf09009b9596de74c0183d1ab832e5edddb7a9965880bb400097e850850f8012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "b86b5cc0d8a7374d94e277850b0a249cb26a7b42ddf014f28a49b8859da64241",
+            "vout": 20,
+            "scriptSig": {
+                "asm": "304502203b89a71628a28cc3703d170ca3be77786cff6b867e38a18b719705f8a326578f022100b2a9879e1acf621faa6466c207746a7f3eb4c8514c1482969aba3f2a957f1321[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "48304502203b89a71628a28cc3703d170ca3be77786cff6b867e38a18b719705f8a326578f022100b2a9879e1acf621faa6466c207746a7f3eb4c8514c1482969aba3f2a957f1321012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "3d0a2353eeec44d3c10aed259038db321912122cd4150048f7bfa4c0ecfee236",
+            "vout": 242,
+            "scriptSig": {
+                "asm": "3046022100ef794a8ef7fd6752d2a183c18866ff6e8dc0f5bd889a63e2c21cf303a6302461022100c1b09662d9e92988c3f9fcf17d1bcc79b5403647095d7212b9f8a1278a532d68[ALL] 03091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc",
+                "hex": "493046022100ef794a8ef7fd6752d2a183c18866ff6e8dc0f5bd889a63e2c21cf303a6302461022100c1b09662d9e92988c3f9fcf17d1bcc79b5403647095d7212b9f8a1278a532d68012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc"
+            },
+            "sequence": 4294967295
+        }
+    ],
+    "vout": [
+        {
+            "value": 1.3782,
+            "n": 0,
+            "scriptPubKey": {
+                "asm": "OP_DUP OP_HASH160 8fd139bb39ced713f231c58a4d07bf6954d1c201 OP_EQUALVERIFY OP_CHECKSIG",
+                "hex": "76a9148fd139bb39ced713f231c58a4d07bf6954d1c20188ac",
+                "reqSigs": 1,
+                "type": "pubkeyhash",
+                "addresses": [
+                    "t1Wz3H1ahDX4pP8cEqrJqernQ2d1SSipmiQ"
+                ]
+            }
+        }
+    ],
+    "hex": "0100000015fd5c23522d31761c50175453daa6edaabe47a602a592d39ce933d8271a1a87274c0100006c493046022100b4251ecd63778a3dde0155abe4cd162947620ae9ee45a874353551092325b116022100db307baf4ff3781ec520bd18f387948cedd15dc27bafe17c894b0fe6ffffcafa012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffffcb4ed1baba3a1eb2171e00ddec8e5b72b346dd8c07f9c2b0d122d0d06bc92ea7000000006c493046022100a9b617843b68c284715d3e02fd120479cd0d96a6c43bf01e697fb0a460a21a3a022100ba0a12fbe8b993d4e7911fa3467615765dbe421ddf5c51b57a9c1ee19dcc00ba012103e633b4fa4ceb705c2da712390767199be8ef2448b3095dc01652e11b2b751505ffffffffc1b37ae964f605978022f94ce2f3f676d66a46d1aef7c2c17d6315b9697f2f75010000006a473044022079bd62ee09621a3be96b760c39e8ef78170101d46313923c6b07ae60a95c90670220238e51ea29fc70b04b65508450523caedbb11cb4dd5aa608c81487de798925ba0121027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34ffffffffedd005dc7790ef65c206abd1ab718e75252a40f4b1310e4102cd692eca9cacb0d10000006b48304502207722d6f9038673c86a1019b1c4de2d687ae246477cd4ca7002762be0299de385022100e594a11e3a313942595f7666dcf7078bcb14f1330f4206b95c917e7ec0e82fac012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffffdf28d6e26fb7a85a1e6a229b972c1bae0edc1c11cb9ca51e4caf5e59fbea35a1000000006b483045022100a63a4788027b79b65c6f9d9e054f68cf3b4eed19efd82a2d53f70dcbe64683390220526f243671425b2bd05745fcf2729361f985cfe84ea80c7cfc817b93d8134374012103a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52ffffffffae2a2320a1582faa24469eff3024a6b98bfe00eb4f554d8a0b1421ba53bfd6a5010000006c493046022100b200ac6db16842f76dab9abe807ce423c992805879bc50abd46ed8275a59d9cf022100c0d518e85dd345b3c29dd4dc47b9a420d3ce817b18720e94966d2fe23413a408012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffffb3cc5a12548aa1794b4d2bbf076838cfd7fbafb7716da51ee8221a4ff19c291b000000006b483045022100ededc441c3103a6f2bd6cab7639421af0f6ec5e60503bce1e603cf34f00aee1c02205cb75f3f519a13fb348783b21db3085cb5ec7552c59e394fdbc3e1feea43f967012103a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52ffffffff85145367313888d2cf2747274a32e20b2df074027bafd6f970003fcbcdf11d07150000006b483045022100d9eed5413d2a4b4b98625aa6e3169edc4fb4663e7862316d69224454e70cd8ca022061e506521d5ced51dd0ea36496e75904d756a4c4f9fb111568555075d5f68d9a012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff8292c11f6d35abab5bac3ebb627a4ff949e8ecd62d33ed137adf7aeb00e512b0090000006b48304502207e84b27139c4c19c828cb1e30c349bba88e4d9b59be97286960793b5ddc0a2af0221008cdc7a951e7f31c20953ed5635fbabf228e80b7047f32faaa0313e7693005177012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff883dcf9a86063db088ad064d0953258d4b0ff3425857402d2f3f839cee0f84581e0000006a4730440220426540dfed9c4ab5812e5f06df705b8bcf307dd7d20f7fa6512298b2a6314f420220064055096e3ca62f6c7352c66a5447767c53f946acdf35025ab3807ddb2fa404012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff6697dbb3ed98afe481b568459fa67e503f8a4254532465a670e54669d19c9fe6720000006a47304402200a5e673996f2fc88e21cc8613611f08a650bc0370338803591d85d0ec5663764022040b6664a0d1ec83a7f01975b8fde5232992b8ca58bf48af6725d2f92a936ab2e012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff023ffc2182517e1d3fa0896c5b0bd7b4d2ef8a1e42655abe2ced54f657125d59670000006c493046022100d93b30219c5735f673be5c3b4688366d96f545561c74cb62c6958c00f6960806022100ec8200adcb028f2184fa2a4f6faac7f8bb57cb4503bb7584ac11051fece31b3d012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffff16f8c77166b0df3d7cc8b5b2ce825afbea9309ad7acd8e2461a255958f81fc06010000006b483045022100a13934e68d3f5b22b130c4cb33f4da468cffc52323a47fbfbe06b64858162246022047081e0a70ff770e64a2e2d31e5d520d9102268b57a47009a72fe73ec766901801210234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cdffffffff197b96f3c87a3adfaa17f63fddc2a738a690ca665439f9431dbbd655816c41fb000000006c49304602210097f1f35d5bdc1a3a60390a1b015b8e7c4f916aa3847aafd969e04975e15bbe70022100a9052eb25517d481f1fda1b129eb1b534da50ea1a51f3ee012dca3601c11b86a0121027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34ffffffff20d9a261ee27aa1bd92e7db2fdca935909a40b648e974cd24a10d63b68b94039dd0000006b483045022012b3138c591bf7154b6fef457f2c4a3c7162225003788ac0024a99355865ff13022100b71b125ae1ffb2e1d1571f580cd3ebc8cd049a2d7a8a41f138ba94aeb982106f012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffff50f179d5d16cd872f9a63c26c448464ae9bd95cd9421c0476113b5d314571b71010000006b483045022100f834ccc8b22ee72712a3e5e6ef4acb8b2fb791b5385b70e2cd4332674d6667f4022024fbda0a997e0c253503f217501f508a4d56edce2c813ecdd9ad796dbeba907401210234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cdffffffff551b865d1568ac0a305e5f9c5dae6c540982334efbe789074318e0efc5b564631b0000006b48304502203b2fd1e39ae0e469d7a15768f262661b0de41470daf0fe8c4fd0c26542a0870002210081c57e331f9a2d214457d953e3542904727ee412c63028113635d7224da3dccc012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff57503e5a016189d407a721791459280875264f908ca2c5d4862c01386e7fb50b470400006b48304502206947a9c54f0664ece4430fd4ae999891dc50bb6126bc36b6a15a3189f29d25e9022100a86cfc4e2fdd9e39a20e305cfd1b76509c67b3e313e0f118229105caa0e823c9012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff3f16c1fb9d3e1a26d872933e955df85ee7f3f817711062b00b54a2144827349b250000006b483045022100c7128fe10b2d38744ae8177776054c29fc8ec13f07207723e70766ab7164847402201d2cf09009b9596de74c0183d1ab832e5edddb7a9965880bb400097e850850f8012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff4142a69d85b8498af214f0dd427b6ab29c240a0b8577e2944d37a7d8c05c6bb8140000006b48304502203b89a71628a28cc3703d170ca3be77786cff6b867e38a18b719705f8a326578f022100b2a9879e1acf621faa6466c207746a7f3eb4c8514c1482969aba3f2a957f1321012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff36e2feecc0a4bff7480015d42c12121932db389025ed0ac1d344ecee53230a3df20000006c493046022100ef794a8ef7fd6752d2a183c18866ff6e8dc0f5bd889a63e2c21cf303a6302461022100c1b09662d9e92988c3f9fcf17d1bcc79b5403647095d7212b9f8a1278a532d68012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffff0160f73608000000001976a9148fd139bb39ced713f231c58a4d07bf6954d1c20188ac00000000"
+}
diff --git a/depend/zcash/src/test/data/tt-locktime317000-out.hex b/depend/zcash/src/test/data/tt-locktime317000-out.hex
new file mode 100644
index 000000000..287f420a4
--- /dev/null
+++ b/depend/zcash/src/test/data/tt-locktime317000-out.hex
@@ -0,0 +1 @@
+0100000015fd5c23522d31761c50175453daa6edaabe47a602a592d39ce933d8271a1a87274c0100006c493046022100b4251ecd63778a3dde0155abe4cd162947620ae9ee45a874353551092325b116022100db307baf4ff3781ec520bd18f387948cedd15dc27bafe17c894b0fe6ffffcafa012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffffcb4ed1baba3a1eb2171e00ddec8e5b72b346dd8c07f9c2b0d122d0d06bc92ea7000000006c493046022100a9b617843b68c284715d3e02fd120479cd0d96a6c43bf01e697fb0a460a21a3a022100ba0a12fbe8b993d4e7911fa3467615765dbe421ddf5c51b57a9c1ee19dcc00ba012103e633b4fa4ceb705c2da712390767199be8ef2448b3095dc01652e11b2b751505ffffffffc1b37ae964f605978022f94ce2f3f676d66a46d1aef7c2c17d6315b9697f2f75010000006a473044022079bd62ee09621a3be96b760c39e8ef78170101d46313923c6b07ae60a95c90670220238e51ea29fc70b04b65508450523caedbb11cb4dd5aa608c81487de798925ba0121027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34ffffffffedd005dc7790ef65c206abd1ab718e75252a40f4b1310e4102cd692eca9cacb0d10000006b48304502207722d6f9038673c86a1019b1c4de2d687ae246477cd4ca7002762be0299de385022100e594a11e3a313942595f7666dcf7078bcb14f1330f4206b95c917e7ec0e82fac012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffffdf28d6e26fb7a85a1e6a229b972c1bae0edc1c11cb9ca51e4caf5e59fbea35a1000000006b483045022100a63a4788027b79b65c6f9d9e054f68cf3b4eed19efd82a2d53f70dcbe64683390220526f243671425b2bd05745fcf2729361f985cfe84ea80c7cfc817b93d8134374012103a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52ffffffffae2a2320a1582faa24469eff3024a6b98bfe00eb4f554d8a0b1421ba53bfd6a5010000006c493046022100b200ac6db16842f76dab9abe807ce423c992805879bc50abd46ed8275a59d9cf022100c0d518e85dd345b3c29dd4dc47b9a420d3ce817b18720e94966d2fe23413a408012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffffb3cc5a12548aa1794b4d2bbf076838cfd7fbafb7716da51ee8221a4ff19c291b000000006b483045022100ededc441c3103a6f2bd6cab7639421af0f6ec5e60503bce1e603cf34f00aee1c02205cb75f3f519a13fb348783b21db3085cb5ec7552c59e394fdbc3e1feea43f967012103a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52ffffffff85145367313888d2cf2747274a32e20b2df074027bafd6f970003fcbcdf11d07150000006b483045022100d9eed5413d2a4b4b98625aa6e3169edc4fb4663e7862316d69224454e70cd8ca022061e506521d5ced51dd0ea36496e75904d756a4c4f9fb111568555075d5f68d9a012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff8292c11f6d35abab5bac3ebb627a4ff949e8ecd62d33ed137adf7aeb00e512b0090000006b48304502207e84b27139c4c19c828cb1e30c349bba88e4d9b59be97286960793b5ddc0a2af0221008cdc7a951e7f31c20953ed5635fbabf228e80b7047f32faaa0313e7693005177012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff883dcf9a86063db088ad064d0953258d4b0ff3425857402d2f3f839cee0f84581e0000006a4730440220426540dfed9c4ab5812e5f06df705b8bcf307dd7d20f7fa6512298b2a6314f420220064055096e3ca62f6c7352c66a5447767c53f946acdf35025ab3807ddb2fa404012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff6697dbb3ed98afe481b568459fa67e503f8a4254532465a670e54669d19c9fe6720000006a47304402200a5e673996f2fc88e21cc8613611f08a650bc0370338803591d85d0ec5663764022040b6664a0d1ec83a7f01975b8fde5232992b8ca58bf48af6725d2f92a936ab2e012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff023ffc2182517e1d3fa0896c5b0bd7b4d2ef8a1e42655abe2ced54f657125d59670000006c493046022100d93b30219c5735f673be5c3b4688366d96f545561c74cb62c6958c00f6960806022100ec8200adcb028f2184fa2a4f6faac7f8bb57cb4503bb7584ac11051fece31b3d012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffff16f8c77166b0df3d7cc8b5b2ce825afbea9309ad7acd8e2461a255958f81fc06010000006b483045022100a13934e68d3f5b22b130c4cb33f4da468cffc52323a47fbfbe06b64858162246022047081e0a70ff770e64a2e2d31e5d520d9102268b57a47009a72fe73ec766901801210234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cdffffffff197b96f3c87a3adfaa17f63fddc2a738a690ca665439f9431dbbd655816c41fb000000006c49304602210097f1f35d5bdc1a3a60390a1b015b8e7c4f916aa3847aafd969e04975e15bbe70022100a9052eb25517d481f1fda1b129eb1b534da50ea1a51f3ee012dca3601c11b86a0121027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34ffffffff20d9a261ee27aa1bd92e7db2fdca935909a40b648e974cd24a10d63b68b94039dd0000006b483045022012b3138c591bf7154b6fef457f2c4a3c7162225003788ac0024a99355865ff13022100b71b125ae1ffb2e1d1571f580cd3ebc8cd049a2d7a8a41f138ba94aeb982106f012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffff50f179d5d16cd872f9a63c26c448464ae9bd95cd9421c0476113b5d314571b71010000006b483045022100f834ccc8b22ee72712a3e5e6ef4acb8b2fb791b5385b70e2cd4332674d6667f4022024fbda0a997e0c253503f217501f508a4d56edce2c813ecdd9ad796dbeba907401210234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cdffffffff551b865d1568ac0a305e5f9c5dae6c540982334efbe789074318e0efc5b564631b0000006b48304502203b2fd1e39ae0e469d7a15768f262661b0de41470daf0fe8c4fd0c26542a0870002210081c57e331f9a2d214457d953e3542904727ee412c63028113635d7224da3dccc012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff57503e5a016189d407a721791459280875264f908ca2c5d4862c01386e7fb50b470400006b48304502206947a9c54f0664ece4430fd4ae999891dc50bb6126bc36b6a15a3189f29d25e9022100a86cfc4e2fdd9e39a20e305cfd1b76509c67b3e313e0f118229105caa0e823c9012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff3f16c1fb9d3e1a26d872933e955df85ee7f3f817711062b00b54a2144827349b250000006b483045022100c7128fe10b2d38744ae8177776054c29fc8ec13f07207723e70766ab7164847402201d2cf09009b9596de74c0183d1ab832e5edddb7a9965880bb400097e850850f8012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff4142a69d85b8498af214f0dd427b6ab29c240a0b8577e2944d37a7d8c05c6bb8140000006b48304502203b89a71628a28cc3703d170ca3be77786cff6b867e38a18b719705f8a326578f022100b2a9879e1acf621faa6466c207746a7f3eb4c8514c1482969aba3f2a957f1321012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff36e2feecc0a4bff7480015d42c12121932db389025ed0ac1d344ecee53230a3df20000006c493046022100ef794a8ef7fd6752d2a183c18866ff6e8dc0f5bd889a63e2c21cf303a6302461022100c1b09662d9e92988c3f9fcf17d1bcc79b5403647095d7212b9f8a1278a532d68012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffff0260f73608000000001976a9148fd139bb39ced713f231c58a4d07bf6954d1c20188ac41420f00000000001976a9146c772e9cf96371bba3da8cb733da70a2fcf2007888ac48d60400
diff --git a/depend/zcash/src/test/data/tt-locktime317000-out.json b/depend/zcash/src/test/data/tt-locktime317000-out.json
new file mode 100644
index 000000000..f09b09026
--- /dev/null
+++ b/depend/zcash/src/test/data/tt-locktime317000-out.json
@@ -0,0 +1,225 @@
+{
+    "txid": "aded538f642c17e15f4d3306b8be7e1a4d1ae0c4616d641ab51ea09ba65e5cb5",
+    "version": 1,
+    "locktime": 317000,
+    "vin": [
+        {
+            "txid": "27871a1a27d833e99cd392a502a647beaaeda6da535417501c76312d52235cfd",
+            "vout": 332,
+            "scriptSig": {
+                "asm": "3046022100b4251ecd63778a3dde0155abe4cd162947620ae9ee45a874353551092325b116022100db307baf4ff3781ec520bd18f387948cedd15dc27bafe17c894b0fe6ffffcafa[ALL] 03091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc",
+                "hex": "493046022100b4251ecd63778a3dde0155abe4cd162947620ae9ee45a874353551092325b116022100db307baf4ff3781ec520bd18f387948cedd15dc27bafe17c894b0fe6ffffcafa012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "a72ec96bd0d022d1b0c2f9078cdd46b3725b8eecdd001e17b21e3ababad14ecb",
+            "vout": 0,
+            "scriptSig": {
+                "asm": "3046022100a9b617843b68c284715d3e02fd120479cd0d96a6c43bf01e697fb0a460a21a3a022100ba0a12fbe8b993d4e7911fa3467615765dbe421ddf5c51b57a9c1ee19dcc00ba[ALL] 03e633b4fa4ceb705c2da712390767199be8ef2448b3095dc01652e11b2b751505",
+                "hex": "493046022100a9b617843b68c284715d3e02fd120479cd0d96a6c43bf01e697fb0a460a21a3a022100ba0a12fbe8b993d4e7911fa3467615765dbe421ddf5c51b57a9c1ee19dcc00ba012103e633b4fa4ceb705c2da712390767199be8ef2448b3095dc01652e11b2b751505"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "752f7f69b915637dc1c2f7aed1466ad676f6f3e24cf922809705f664e97ab3c1",
+            "vout": 1,
+            "scriptSig": {
+                "asm": "3044022079bd62ee09621a3be96b760c39e8ef78170101d46313923c6b07ae60a95c90670220238e51ea29fc70b04b65508450523caedbb11cb4dd5aa608c81487de798925ba[ALL] 027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34",
+                "hex": "473044022079bd62ee09621a3be96b760c39e8ef78170101d46313923c6b07ae60a95c90670220238e51ea29fc70b04b65508450523caedbb11cb4dd5aa608c81487de798925ba0121027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "b0ac9cca2e69cd02410e31b1f4402a25758e71abd1ab06c265ef9077dc05d0ed",
+            "vout": 209,
+            "scriptSig": {
+                "asm": "304502207722d6f9038673c86a1019b1c4de2d687ae246477cd4ca7002762be0299de385022100e594a11e3a313942595f7666dcf7078bcb14f1330f4206b95c917e7ec0e82fac[ALL] 03091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc",
+                "hex": "48304502207722d6f9038673c86a1019b1c4de2d687ae246477cd4ca7002762be0299de385022100e594a11e3a313942595f7666dcf7078bcb14f1330f4206b95c917e7ec0e82fac012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "a135eafb595eaf4c1ea59ccb111cdc0eae1b2c979b226a1e5aa8b76fe2d628df",
+            "vout": 0,
+            "scriptSig": {
+                "asm": "3045022100a63a4788027b79b65c6f9d9e054f68cf3b4eed19efd82a2d53f70dcbe64683390220526f243671425b2bd05745fcf2729361f985cfe84ea80c7cfc817b93d8134374[ALL] 03a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52",
+                "hex": "483045022100a63a4788027b79b65c6f9d9e054f68cf3b4eed19efd82a2d53f70dcbe64683390220526f243671425b2bd05745fcf2729361f985cfe84ea80c7cfc817b93d8134374012103a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "a5d6bf53ba21140b8a4d554feb00fe8bb9a62430ff9e4624aa2f58a120232aae",
+            "vout": 1,
+            "scriptSig": {
+                "asm": "3046022100b200ac6db16842f76dab9abe807ce423c992805879bc50abd46ed8275a59d9cf022100c0d518e85dd345b3c29dd4dc47b9a420d3ce817b18720e94966d2fe23413a408[ALL] 03091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc",
+                "hex": "493046022100b200ac6db16842f76dab9abe807ce423c992805879bc50abd46ed8275a59d9cf022100c0d518e85dd345b3c29dd4dc47b9a420d3ce817b18720e94966d2fe23413a408012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "1b299cf14f1a22e81ea56d71b7affbd7cf386807bf2b4d4b79a18a54125accb3",
+            "vout": 0,
+            "scriptSig": {
+                "asm": "3045022100ededc441c3103a6f2bd6cab7639421af0f6ec5e60503bce1e603cf34f00aee1c02205cb75f3f519a13fb348783b21db3085cb5ec7552c59e394fdbc3e1feea43f967[ALL] 03a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52",
+                "hex": "483045022100ededc441c3103a6f2bd6cab7639421af0f6ec5e60503bce1e603cf34f00aee1c02205cb75f3f519a13fb348783b21db3085cb5ec7552c59e394fdbc3e1feea43f967012103a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "071df1cdcb3f0070f9d6af7b0274f02d0be2324a274727cfd288383167531485",
+            "vout": 21,
+            "scriptSig": {
+                "asm": "3045022100d9eed5413d2a4b4b98625aa6e3169edc4fb4663e7862316d69224454e70cd8ca022061e506521d5ced51dd0ea36496e75904d756a4c4f9fb111568555075d5f68d9a[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "483045022100d9eed5413d2a4b4b98625aa6e3169edc4fb4663e7862316d69224454e70cd8ca022061e506521d5ced51dd0ea36496e75904d756a4c4f9fb111568555075d5f68d9a012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "b012e500eb7adf7a13ed332dd6ece849f94f7a62bb3eac5babab356d1fc19282",
+            "vout": 9,
+            "scriptSig": {
+                "asm": "304502207e84b27139c4c19c828cb1e30c349bba88e4d9b59be97286960793b5ddc0a2af0221008cdc7a951e7f31c20953ed5635fbabf228e80b7047f32faaa0313e7693005177[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "48304502207e84b27139c4c19c828cb1e30c349bba88e4d9b59be97286960793b5ddc0a2af0221008cdc7a951e7f31c20953ed5635fbabf228e80b7047f32faaa0313e7693005177012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "58840fee9c833f2f2d40575842f30f4b8d2553094d06ad88b03d06869acf3d88",
+            "vout": 30,
+            "scriptSig": {
+                "asm": "30440220426540dfed9c4ab5812e5f06df705b8bcf307dd7d20f7fa6512298b2a6314f420220064055096e3ca62f6c7352c66a5447767c53f946acdf35025ab3807ddb2fa404[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "4730440220426540dfed9c4ab5812e5f06df705b8bcf307dd7d20f7fa6512298b2a6314f420220064055096e3ca62f6c7352c66a5447767c53f946acdf35025ab3807ddb2fa404012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "e69f9cd16946e570a665245354428a3f507ea69f4568b581e4af98edb3db9766",
+            "vout": 114,
+            "scriptSig": {
+                "asm": "304402200a5e673996f2fc88e21cc8613611f08a650bc0370338803591d85d0ec5663764022040b6664a0d1ec83a7f01975b8fde5232992b8ca58bf48af6725d2f92a936ab2e[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "47304402200a5e673996f2fc88e21cc8613611f08a650bc0370338803591d85d0ec5663764022040b6664a0d1ec83a7f01975b8fde5232992b8ca58bf48af6725d2f92a936ab2e012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "595d1257f654ed2cbe5a65421e8aefd2b4d70b5b6c89a03f1d7e518221fc3f02",
+            "vout": 103,
+            "scriptSig": {
+                "asm": "3046022100d93b30219c5735f673be5c3b4688366d96f545561c74cb62c6958c00f6960806022100ec8200adcb028f2184fa2a4f6faac7f8bb57cb4503bb7584ac11051fece31b3d[ALL] 03091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc",
+                "hex": "493046022100d93b30219c5735f673be5c3b4688366d96f545561c74cb62c6958c00f6960806022100ec8200adcb028f2184fa2a4f6faac7f8bb57cb4503bb7584ac11051fece31b3d012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "06fc818f9555a261248ecd7aad0993eafb5a82ceb2b5c87c3ddfb06671c7f816",
+            "vout": 1,
+            "scriptSig": {
+                "asm": "3045022100a13934e68d3f5b22b130c4cb33f4da468cffc52323a47fbfbe06b64858162246022047081e0a70ff770e64a2e2d31e5d520d9102268b57a47009a72fe73ec7669018[ALL] 0234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cd",
+                "hex": "483045022100a13934e68d3f5b22b130c4cb33f4da468cffc52323a47fbfbe06b64858162246022047081e0a70ff770e64a2e2d31e5d520d9102268b57a47009a72fe73ec766901801210234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cd"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "fb416c8155d6bb1d43f9395466ca90a638a7c2dd3ff617aadf3a7ac8f3967b19",
+            "vout": 0,
+            "scriptSig": {
+                "asm": "304602210097f1f35d5bdc1a3a60390a1b015b8e7c4f916aa3847aafd969e04975e15bbe70022100a9052eb25517d481f1fda1b129eb1b534da50ea1a51f3ee012dca3601c11b86a[ALL] 027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34",
+                "hex": "49304602210097f1f35d5bdc1a3a60390a1b015b8e7c4f916aa3847aafd969e04975e15bbe70022100a9052eb25517d481f1fda1b129eb1b534da50ea1a51f3ee012dca3601c11b86a0121027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "3940b9683bd6104ad24c978e640ba4095993cafdb27d2ed91baa27ee61a2d920",
+            "vout": 221,
+            "scriptSig": {
+                "asm": "3045022012b3138c591bf7154b6fef457f2c4a3c7162225003788ac0024a99355865ff13022100b71b125ae1ffb2e1d1571f580cd3ebc8cd049a2d7a8a41f138ba94aeb982106f[ALL] 03091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc",
+                "hex": "483045022012b3138c591bf7154b6fef457f2c4a3c7162225003788ac0024a99355865ff13022100b71b125ae1ffb2e1d1571f580cd3ebc8cd049a2d7a8a41f138ba94aeb982106f012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "711b5714d3b5136147c02194cd95bde94a4648c4263ca6f972d86cd1d579f150",
+            "vout": 1,
+            "scriptSig": {
+                "asm": "3045022100f834ccc8b22ee72712a3e5e6ef4acb8b2fb791b5385b70e2cd4332674d6667f4022024fbda0a997e0c253503f217501f508a4d56edce2c813ecdd9ad796dbeba9074[ALL] 0234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cd",
+                "hex": "483045022100f834ccc8b22ee72712a3e5e6ef4acb8b2fb791b5385b70e2cd4332674d6667f4022024fbda0a997e0c253503f217501f508a4d56edce2c813ecdd9ad796dbeba907401210234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cd"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "6364b5c5efe018430789e7fb4e338209546cae5d9c5f5e300aac68155d861b55",
+            "vout": 27,
+            "scriptSig": {
+                "asm": "304502203b2fd1e39ae0e469d7a15768f262661b0de41470daf0fe8c4fd0c26542a0870002210081c57e331f9a2d214457d953e3542904727ee412c63028113635d7224da3dccc[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "48304502203b2fd1e39ae0e469d7a15768f262661b0de41470daf0fe8c4fd0c26542a0870002210081c57e331f9a2d214457d953e3542904727ee412c63028113635d7224da3dccc012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "0bb57f6e38012c86d4c5a28c904f2675082859147921a707d48961015a3e5057",
+            "vout": 1095,
+            "scriptSig": {
+                "asm": "304502206947a9c54f0664ece4430fd4ae999891dc50bb6126bc36b6a15a3189f29d25e9022100a86cfc4e2fdd9e39a20e305cfd1b76509c67b3e313e0f118229105caa0e823c9[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "48304502206947a9c54f0664ece4430fd4ae999891dc50bb6126bc36b6a15a3189f29d25e9022100a86cfc4e2fdd9e39a20e305cfd1b76509c67b3e313e0f118229105caa0e823c9012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "9b34274814a2540bb062107117f8f3e75ef85d953e9372d8261a3e9dfbc1163f",
+            "vout": 37,
+            "scriptSig": {
+                "asm": "3045022100c7128fe10b2d38744ae8177776054c29fc8ec13f07207723e70766ab7164847402201d2cf09009b9596de74c0183d1ab832e5edddb7a9965880bb400097e850850f8[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "483045022100c7128fe10b2d38744ae8177776054c29fc8ec13f07207723e70766ab7164847402201d2cf09009b9596de74c0183d1ab832e5edddb7a9965880bb400097e850850f8012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "b86b5cc0d8a7374d94e277850b0a249cb26a7b42ddf014f28a49b8859da64241",
+            "vout": 20,
+            "scriptSig": {
+                "asm": "304502203b89a71628a28cc3703d170ca3be77786cff6b867e38a18b719705f8a326578f022100b2a9879e1acf621faa6466c207746a7f3eb4c8514c1482969aba3f2a957f1321[ALL] 03f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c",
+                "hex": "48304502203b89a71628a28cc3703d170ca3be77786cff6b867e38a18b719705f8a326578f022100b2a9879e1acf621faa6466c207746a7f3eb4c8514c1482969aba3f2a957f1321012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64c"
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "3d0a2353eeec44d3c10aed259038db321912122cd4150048f7bfa4c0ecfee236",
+            "vout": 242,
+            "scriptSig": {
+                "asm": "3046022100ef794a8ef7fd6752d2a183c18866ff6e8dc0f5bd889a63e2c21cf303a6302461022100c1b09662d9e92988c3f9fcf17d1bcc79b5403647095d7212b9f8a1278a532d68[ALL] 03091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc",
+                "hex": "493046022100ef794a8ef7fd6752d2a183c18866ff6e8dc0f5bd889a63e2c21cf303a6302461022100c1b09662d9e92988c3f9fcf17d1bcc79b5403647095d7212b9f8a1278a532d68012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adc"
+            },
+            "sequence": 4294967295
+        }
+    ],
+    "vout": [
+        {
+            "value": 1.3782,
+            "n": 0,
+            "scriptPubKey": {
+                "asm": "OP_DUP OP_HASH160 8fd139bb39ced713f231c58a4d07bf6954d1c201 OP_EQUALVERIFY OP_CHECKSIG",
+                "hex": "76a9148fd139bb39ced713f231c58a4d07bf6954d1c20188ac",
+                "reqSigs": 1,
+                "type": "pubkeyhash",
+                "addresses": [
+                    "t1Wz3H1ahDX4pP8cEqrJqernQ2d1SSipmiQ"
+                ]
+            }
+        },
+        {
+            "value": 0.01000001,
+            "n": 1,
+            "scriptPubKey": {
+                "asm": "OP_DUP OP_HASH160 6c772e9cf96371bba3da8cb733da70a2fcf20078 OP_EQUALVERIFY OP_CHECKSIG",
+                "hex": "76a9146c772e9cf96371bba3da8cb733da70a2fcf2007888ac",
+                "reqSigs": 1,
+                "type": "pubkeyhash",
+                "addresses": [
+                    "t1Tm7kyBojsXqT73zZU8g7ZQPqu1E8gaHQ9"
+                ]
+            }
+        }
+    ],
+    "hex": "0100000015fd5c23522d31761c50175453daa6edaabe47a602a592d39ce933d8271a1a87274c0100006c493046022100b4251ecd63778a3dde0155abe4cd162947620ae9ee45a874353551092325b116022100db307baf4ff3781ec520bd18f387948cedd15dc27bafe17c894b0fe6ffffcafa012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffffcb4ed1baba3a1eb2171e00ddec8e5b72b346dd8c07f9c2b0d122d0d06bc92ea7000000006c493046022100a9b617843b68c284715d3e02fd120479cd0d96a6c43bf01e697fb0a460a21a3a022100ba0a12fbe8b993d4e7911fa3467615765dbe421ddf5c51b57a9c1ee19dcc00ba012103e633b4fa4ceb705c2da712390767199be8ef2448b3095dc01652e11b2b751505ffffffffc1b37ae964f605978022f94ce2f3f676d66a46d1aef7c2c17d6315b9697f2f75010000006a473044022079bd62ee09621a3be96b760c39e8ef78170101d46313923c6b07ae60a95c90670220238e51ea29fc70b04b65508450523caedbb11cb4dd5aa608c81487de798925ba0121027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34ffffffffedd005dc7790ef65c206abd1ab718e75252a40f4b1310e4102cd692eca9cacb0d10000006b48304502207722d6f9038673c86a1019b1c4de2d687ae246477cd4ca7002762be0299de385022100e594a11e3a313942595f7666dcf7078bcb14f1330f4206b95c917e7ec0e82fac012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffffdf28d6e26fb7a85a1e6a229b972c1bae0edc1c11cb9ca51e4caf5e59fbea35a1000000006b483045022100a63a4788027b79b65c6f9d9e054f68cf3b4eed19efd82a2d53f70dcbe64683390220526f243671425b2bd05745fcf2729361f985cfe84ea80c7cfc817b93d8134374012103a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52ffffffffae2a2320a1582faa24469eff3024a6b98bfe00eb4f554d8a0b1421ba53bfd6a5010000006c493046022100b200ac6db16842f76dab9abe807ce423c992805879bc50abd46ed8275a59d9cf022100c0d518e85dd345b3c29dd4dc47b9a420d3ce817b18720e94966d2fe23413a408012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffffb3cc5a12548aa1794b4d2bbf076838cfd7fbafb7716da51ee8221a4ff19c291b000000006b483045022100ededc441c3103a6f2bd6cab7639421af0f6ec5e60503bce1e603cf34f00aee1c02205cb75f3f519a13fb348783b21db3085cb5ec7552c59e394fdbc3e1feea43f967012103a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52ffffffff85145367313888d2cf2747274a32e20b2df074027bafd6f970003fcbcdf11d07150000006b483045022100d9eed5413d2a4b4b98625aa6e3169edc4fb4663e7862316d69224454e70cd8ca022061e506521d5ced51dd0ea36496e75904d756a4c4f9fb111568555075d5f68d9a012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff8292c11f6d35abab5bac3ebb627a4ff949e8ecd62d33ed137adf7aeb00e512b0090000006b48304502207e84b27139c4c19c828cb1e30c349bba88e4d9b59be97286960793b5ddc0a2af0221008cdc7a951e7f31c20953ed5635fbabf228e80b7047f32faaa0313e7693005177012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff883dcf9a86063db088ad064d0953258d4b0ff3425857402d2f3f839cee0f84581e0000006a4730440220426540dfed9c4ab5812e5f06df705b8bcf307dd7d20f7fa6512298b2a6314f420220064055096e3ca62f6c7352c66a5447767c53f946acdf35025ab3807ddb2fa404012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff6697dbb3ed98afe481b568459fa67e503f8a4254532465a670e54669d19c9fe6720000006a47304402200a5e673996f2fc88e21cc8613611f08a650bc0370338803591d85d0ec5663764022040b6664a0d1ec83a7f01975b8fde5232992b8ca58bf48af6725d2f92a936ab2e012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff023ffc2182517e1d3fa0896c5b0bd7b4d2ef8a1e42655abe2ced54f657125d59670000006c493046022100d93b30219c5735f673be5c3b4688366d96f545561c74cb62c6958c00f6960806022100ec8200adcb028f2184fa2a4f6faac7f8bb57cb4503bb7584ac11051fece31b3d012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffff16f8c77166b0df3d7cc8b5b2ce825afbea9309ad7acd8e2461a255958f81fc06010000006b483045022100a13934e68d3f5b22b130c4cb33f4da468cffc52323a47fbfbe06b64858162246022047081e0a70ff770e64a2e2d31e5d520d9102268b57a47009a72fe73ec766901801210234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cdffffffff197b96f3c87a3adfaa17f63fddc2a738a690ca665439f9431dbbd655816c41fb000000006c49304602210097f1f35d5bdc1a3a60390a1b015b8e7c4f916aa3847aafd969e04975e15bbe70022100a9052eb25517d481f1fda1b129eb1b534da50ea1a51f3ee012dca3601c11b86a0121027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34ffffffff20d9a261ee27aa1bd92e7db2fdca935909a40b648e974cd24a10d63b68b94039dd0000006b483045022012b3138c591bf7154b6fef457f2c4a3c7162225003788ac0024a99355865ff13022100b71b125ae1ffb2e1d1571f580cd3ebc8cd049a2d7a8a41f138ba94aeb982106f012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffff50f179d5d16cd872f9a63c26c448464ae9bd95cd9421c0476113b5d314571b71010000006b483045022100f834ccc8b22ee72712a3e5e6ef4acb8b2fb791b5385b70e2cd4332674d6667f4022024fbda0a997e0c253503f217501f508a4d56edce2c813ecdd9ad796dbeba907401210234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cdffffffff551b865d1568ac0a305e5f9c5dae6c540982334efbe789074318e0efc5b564631b0000006b48304502203b2fd1e39ae0e469d7a15768f262661b0de41470daf0fe8c4fd0c26542a0870002210081c57e331f9a2d214457d953e3542904727ee412c63028113635d7224da3dccc012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff57503e5a016189d407a721791459280875264f908ca2c5d4862c01386e7fb50b470400006b48304502206947a9c54f0664ece4430fd4ae999891dc50bb6126bc36b6a15a3189f29d25e9022100a86cfc4e2fdd9e39a20e305cfd1b76509c67b3e313e0f118229105caa0e823c9012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff3f16c1fb9d3e1a26d872933e955df85ee7f3f817711062b00b54a2144827349b250000006b483045022100c7128fe10b2d38744ae8177776054c29fc8ec13f07207723e70766ab7164847402201d2cf09009b9596de74c0183d1ab832e5edddb7a9965880bb400097e850850f8012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff4142a69d85b8498af214f0dd427b6ab29c240a0b8577e2944d37a7d8c05c6bb8140000006b48304502203b89a71628a28cc3703d170ca3be77786cff6b867e38a18b719705f8a326578f022100b2a9879e1acf621faa6466c207746a7f3eb4c8514c1482969aba3f2a957f1321012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff36e2feecc0a4bff7480015d42c12121932db389025ed0ac1d344ecee53230a3df20000006c493046022100ef794a8ef7fd6752d2a183c18866ff6e8dc0f5bd889a63e2c21cf303a6302461022100c1b09662d9e92988c3f9fcf17d1bcc79b5403647095d7212b9f8a1278a532d68012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffff0260f73608000000001976a9148fd139bb39ced713f231c58a4d07bf6954d1c20188ac41420f00000000001976a9146c772e9cf96371bba3da8cb733da70a2fcf2007888ac48d60400"
+}
diff --git a/depend/zcash/src/test/data/tx394b54bb.hex b/depend/zcash/src/test/data/tx394b54bb.hex
new file mode 100644
index 000000000..33f26cb4d
--- /dev/null
+++ b/depend/zcash/src/test/data/tx394b54bb.hex
@@ -0,0 +1 @@
+0100000015fd5c23522d31761c50175453daa6edaabe47a602a592d39ce933d8271a1a87274c0100006c493046022100b4251ecd63778a3dde0155abe4cd162947620ae9ee45a874353551092325b116022100db307baf4ff3781ec520bd18f387948cedd15dc27bafe17c894b0fe6ffffcafa012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffffcb4ed1baba3a1eb2171e00ddec8e5b72b346dd8c07f9c2b0d122d0d06bc92ea7000000006c493046022100a9b617843b68c284715d3e02fd120479cd0d96a6c43bf01e697fb0a460a21a3a022100ba0a12fbe8b993d4e7911fa3467615765dbe421ddf5c51b57a9c1ee19dcc00ba012103e633b4fa4ceb705c2da712390767199be8ef2448b3095dc01652e11b2b751505ffffffffc1b37ae964f605978022f94ce2f3f676d66a46d1aef7c2c17d6315b9697f2f75010000006a473044022079bd62ee09621a3be96b760c39e8ef78170101d46313923c6b07ae60a95c90670220238e51ea29fc70b04b65508450523caedbb11cb4dd5aa608c81487de798925ba0121027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34ffffffffedd005dc7790ef65c206abd1ab718e75252a40f4b1310e4102cd692eca9cacb0d10000006b48304502207722d6f9038673c86a1019b1c4de2d687ae246477cd4ca7002762be0299de385022100e594a11e3a313942595f7666dcf7078bcb14f1330f4206b95c917e7ec0e82fac012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffffdf28d6e26fb7a85a1e6a229b972c1bae0edc1c11cb9ca51e4caf5e59fbea35a1000000006b483045022100a63a4788027b79b65c6f9d9e054f68cf3b4eed19efd82a2d53f70dcbe64683390220526f243671425b2bd05745fcf2729361f985cfe84ea80c7cfc817b93d8134374012103a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52ffffffffae2a2320a1582faa24469eff3024a6b98bfe00eb4f554d8a0b1421ba53bfd6a5010000006c493046022100b200ac6db16842f76dab9abe807ce423c992805879bc50abd46ed8275a59d9cf022100c0d518e85dd345b3c29dd4dc47b9a420d3ce817b18720e94966d2fe23413a408012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffffb3cc5a12548aa1794b4d2bbf076838cfd7fbafb7716da51ee8221a4ff19c291b000000006b483045022100ededc441c3103a6f2bd6cab7639421af0f6ec5e60503bce1e603cf34f00aee1c02205cb75f3f519a13fb348783b21db3085cb5ec7552c59e394fdbc3e1feea43f967012103a621f08be22d1bbdcbe4e527ee4927006aa555fc65e2aafa767d4ea2fe9dfa52ffffffff85145367313888d2cf2747274a32e20b2df074027bafd6f970003fcbcdf11d07150000006b483045022100d9eed5413d2a4b4b98625aa6e3169edc4fb4663e7862316d69224454e70cd8ca022061e506521d5ced51dd0ea36496e75904d756a4c4f9fb111568555075d5f68d9a012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff8292c11f6d35abab5bac3ebb627a4ff949e8ecd62d33ed137adf7aeb00e512b0090000006b48304502207e84b27139c4c19c828cb1e30c349bba88e4d9b59be97286960793b5ddc0a2af0221008cdc7a951e7f31c20953ed5635fbabf228e80b7047f32faaa0313e7693005177012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff883dcf9a86063db088ad064d0953258d4b0ff3425857402d2f3f839cee0f84581e0000006a4730440220426540dfed9c4ab5812e5f06df705b8bcf307dd7d20f7fa6512298b2a6314f420220064055096e3ca62f6c7352c66a5447767c53f946acdf35025ab3807ddb2fa404012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff6697dbb3ed98afe481b568459fa67e503f8a4254532465a670e54669d19c9fe6720000006a47304402200a5e673996f2fc88e21cc8613611f08a650bc0370338803591d85d0ec5663764022040b6664a0d1ec83a7f01975b8fde5232992b8ca58bf48af6725d2f92a936ab2e012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff023ffc2182517e1d3fa0896c5b0bd7b4d2ef8a1e42655abe2ced54f657125d59670000006c493046022100d93b30219c5735f673be5c3b4688366d96f545561c74cb62c6958c00f6960806022100ec8200adcb028f2184fa2a4f6faac7f8bb57cb4503bb7584ac11051fece31b3d012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffff16f8c77166b0df3d7cc8b5b2ce825afbea9309ad7acd8e2461a255958f81fc06010000006b483045022100a13934e68d3f5b22b130c4cb33f4da468cffc52323a47fbfbe06b64858162246022047081e0a70ff770e64a2e2d31e5d520d9102268b57a47009a72fe73ec766901801210234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cdffffffff197b96f3c87a3adfaa17f63fddc2a738a690ca665439f9431dbbd655816c41fb000000006c49304602210097f1f35d5bdc1a3a60390a1b015b8e7c4f916aa3847aafd969e04975e15bbe70022100a9052eb25517d481f1fda1b129eb1b534da50ea1a51f3ee012dca3601c11b86a0121027a759be8df971a6a04fafcb4f6babf75dc811c5cdaa0734cddbe9b942ce75b34ffffffff20d9a261ee27aa1bd92e7db2fdca935909a40b648e974cd24a10d63b68b94039dd0000006b483045022012b3138c591bf7154b6fef457f2c4a3c7162225003788ac0024a99355865ff13022100b71b125ae1ffb2e1d1571f580cd3ebc8cd049a2d7a8a41f138ba94aeb982106f012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffff50f179d5d16cd872f9a63c26c448464ae9bd95cd9421c0476113b5d314571b71010000006b483045022100f834ccc8b22ee72712a3e5e6ef4acb8b2fb791b5385b70e2cd4332674d6667f4022024fbda0a997e0c253503f217501f508a4d56edce2c813ecdd9ad796dbeba907401210234b9d9413f247bb78cd3293b7b65a2c38018ba5621ea9ee737f3a6a3523fb4cdffffffff551b865d1568ac0a305e5f9c5dae6c540982334efbe789074318e0efc5b564631b0000006b48304502203b2fd1e39ae0e469d7a15768f262661b0de41470daf0fe8c4fd0c26542a0870002210081c57e331f9a2d214457d953e3542904727ee412c63028113635d7224da3dccc012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff57503e5a016189d407a721791459280875264f908ca2c5d4862c01386e7fb50b470400006b48304502206947a9c54f0664ece4430fd4ae999891dc50bb6126bc36b6a15a3189f29d25e9022100a86cfc4e2fdd9e39a20e305cfd1b76509c67b3e313e0f118229105caa0e823c9012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff3f16c1fb9d3e1a26d872933e955df85ee7f3f817711062b00b54a2144827349b250000006b483045022100c7128fe10b2d38744ae8177776054c29fc8ec13f07207723e70766ab7164847402201d2cf09009b9596de74c0183d1ab832e5edddb7a9965880bb400097e850850f8012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff4142a69d85b8498af214f0dd427b6ab29c240a0b8577e2944d37a7d8c05c6bb8140000006b48304502203b89a71628a28cc3703d170ca3be77786cff6b867e38a18b719705f8a326578f022100b2a9879e1acf621faa6466c207746a7f3eb4c8514c1482969aba3f2a957f1321012103f1575d6124ac78be398c25b31146d08313c6072d23a4d7df5ac6a9f87346c64cffffffff36e2feecc0a4bff7480015d42c12121932db389025ed0ac1d344ecee53230a3df20000006c493046022100ef794a8ef7fd6752d2a183c18866ff6e8dc0f5bd889a63e2c21cf303a6302461022100c1b09662d9e92988c3f9fcf17d1bcc79b5403647095d7212b9f8a1278a532d68012103091137f3ef23f4acfc19a5953a68b2074fae942ad3563ef28c33b0cac9a93adcffffffff0260f73608000000001976a9148fd139bb39ced713f231c58a4d07bf6954d1c20188ac41420f00000000001976a9146c772e9cf96371bba3da8cb733da70a2fcf2007888ac00000000
diff --git a/depend/zcash/src/test/data/tx_invalid.json b/depend/zcash/src/test/data/tx_invalid.json
new file mode 100644
index 000000000..9c6718f79
--- /dev/null
+++ b/depend/zcash/src/test/data/tx_invalid.json
@@ -0,0 +1,245 @@
+[
+["The following are deserialized transactions which are invalid."],
+["They are in the form"],
+["[[[prevout hash, prevout index, prevout scriptPubKey], [input 2], ...],"],
+["serializedTransaction, verifyFlags]"],
+["Objects that are only a single string (like this one) are ignored"],
+
+["0e1b5688cf179cd9f7cbda1fac0090f6e684bbf8cd946660120197c3f3681809 but with extra junk appended to the end of the scriptPubKey"],
+[[["6ca7ec7b1847f6bdbd737176050e6a08d66ccd55bb94ad24f4018024107a5827", 0, "0x41 0x043b640e983c9690a14c039a2037ecc3467b27a0dcd58f19d76c7bc118d09fec45adc5370a1c5bf8067ca9f5557a4cf885fdb0fe0dcc9c3a7137226106fbc779a5 CHECKSIG VERIFY 1"]],
+"010000000127587a10248001f424ad94bb55cd6cd6086a0e05767173bdbdf647187beca76c000000004948304502201b822ad10d6adc1a341ae8835be3f70a25201bbff31f59cbb9c5353a5f0eca18022100ea7b2f7074e9aa9cf70aa8d0ffee13e6b45dddabf1ab961bda378bcdb778fa4701ffffffff0100f2052a010000001976a914fc50c5907d86fed474ba5ce8b12a66e0a4c139d888ac00000000", "P2SH"],
+
+["A nearly-standard transaction with CHECKSIGVERIFY 1 instead of CHECKSIG,"],
+["but with the signature duplicated in the scriptPubKey with the proper pushdata prefix."],
+["Valid in Bitcoin because of FindAndDelete, but invalid for Zcash."],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "DUP HASH160 0x14 0x5b6462475454710f3c22f5fdf0b40704c92f25c3 EQUALVERIFY CHECKSIGVERIFY 1 0x47 0x3044022067288ea50aa799543a536ff9306f8e1cba05b9c6b10951175b924f96732555ed022026d7b5265f38d21541519e4a1e55044d5b9e17e15cdbaf29ae3792e99e883e7a01"]],
+"01000000010001000000000000000000000000000000000000000000000000000000000000000000006a473044022067288ea50aa799543a536ff9306f8e1cba05b9c6b10951175b924f96732555ed022026d7b5265f38d21541519e4a1e55044d5b9e17e15cdbaf29ae3792e99e883e7a012103ba8c8b86dea131c22ab967e6dd99bdae8eff7a1f75a2c35f1f944109e3fe5e22ffffffff010000000000000000015100000000", "P2SH"],
+
+["Same as above, but with the signature duplicated in the scriptPubKey with"],
+["a non-standard pushdata prefix. Invalid in both Bitcoin (FindAndDelete only"],
+["removes if it uses the same pushdata prefix as is standard) and Zcash (no"],
+["FindAndDelete)."],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "DUP HASH160 0x14 0x5b6462475454710f3c22f5fdf0b40704c92f25c3 EQUALVERIFY CHECKSIGVERIFY 1 0x4c 0x47 0x3044022067288ea50aa799543a536ff9306f8e1cba05b9c6b10951175b924f96732555ed022026d7b5265f38d21541519e4a1e55044d5b9e17e15cdbaf29ae3792e99e883e7a01"]],
+"01000000010001000000000000000000000000000000000000000000000000000000000000000000006a473044022067288ea50aa799543a536ff9306f8e1cba05b9c6b10951175b924f96732555ed022026d7b5265f38d21541519e4a1e55044d5b9e17e15cdbaf29ae3792e99e883e7a012103ba8c8b86dea131c22ab967e6dd99bdae8eff7a1f75a2c35f1f944109e3fe5e22ffffffff010000000000000000015100000000", "P2SH"],
+
+["Same as above, but with the sig in the scriptSig also pushed with the same non-standard OP_PUSHDATA"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "DUP HASH160 0x14 0x5b6462475454710f3c22f5fdf0b40704c92f25c3 EQUALVERIFY CHECKSIGVERIFY 1 0x4c 0x47 0x3044022067288ea50aa799543a536ff9306f8e1cba05b9c6b10951175b924f96732555ed022026d7b5265f38d21541519e4a1e55044d5b9e17e15cdbaf29ae3792e99e883e7a01"]],
+"01000000010001000000000000000000000000000000000000000000000000000000000000000000006b4c473044022067288ea50aa799543a536ff9306f8e1cba05b9c6b10951175b924f96732555ed022026d7b5265f38d21541519e4a1e55044d5b9e17e15cdbaf29ae3792e99e883e7a012103ba8c8b86dea131c22ab967e6dd99bdae8eff7a1f75a2c35f1f944109e3fe5e22ffffffff010000000000000000015100000000", "P2SH"],
+
+["This is the nearly-standard transaction with CHECKSIGVERIFY 1 instead of CHECKSIG,"],
+["but with the signature duplicated in the scriptPubKey with a different hashtype suffix"],
+["Invalid in both Bitcoin (FindAndDelete only removes if the signature, including the hash"],
+["type, matches) and Zcash (no FindAndDelete)."],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "DUP HASH160 0x14 0x5b6462475454710f3c22f5fdf0b40704c92f25c3 EQUALVERIFY CHECKSIGVERIFY 1 0x47 0x3044022067288ea50aa799543a536ff9306f8e1cba05b9c6b10951175b924f96732555ed022026d7b5265f38d21541519e4a1e55044d5b9e17e15cdbaf29ae3792e99e883e7a81"]],
+"01000000010001000000000000000000000000000000000000000000000000000000000000000000006a473044022067288ea50aa799543a536ff9306f8e1cba05b9c6b10951175b924f96732555ed022026d7b5265f38d21541519e4a1e55044d5b9e17e15cdbaf29ae3792e99e883e7a012103ba8c8b86dea131c22ab967e6dd99bdae8eff7a1f75a2c35f1f944109e3fe5e22ffffffff010000000000000000015100000000", "P2SH"],
+
+["An invalid P2SH Transaction"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "HASH160 0x14 0x7a052c840ba73af26755de42cf01cc9e0a49fef0 EQUAL"]],
+"010000000100010000000000000000000000000000000000000000000000000000000000000000000009085768617420697320ffffffff010000000000000000015100000000", "P2SH"],
+
+["Tests for CheckTransaction()"],
+["No inputs"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "HASH160 0x14 0x7a052c840ba73af26755de42cf01cc9e0a49fef0 EQUAL"]],
+"0100000000010000000000000000015100000000", "P2SH"],
+
+["No outputs"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "HASH160 0x14 0x05ab9e14d983742513f0f451e105ffb4198d1dd4 EQUAL"]],
+"01000000010001000000000000000000000000000000000000000000000000000000000000000000006d483045022100f16703104aab4e4088317c862daec83440242411b039d14280e03dd33b487ab802201318a7be236672c5c56083eb7a5a195bc57a40af7923ff8545016cd3b571e2a601232103c40e5d339df3f30bf753e7e04450ae4ef76c9e45587d1d993bdc4cd06f0651c7acffffffff0000000000", "P2SH"],
+
+["Negative output"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "HASH160 0x14 0xae609aca8061d77c5e111f6bb62501a6bbe2bfdb EQUAL"]],
+"01000000010001000000000000000000000000000000000000000000000000000000000000000000006d4830450220063222cbb128731fc09de0d7323746539166544d6c1df84d867ccea84bcc8903022100bf568e8552844de664cd41648a031554327aa8844af34b4f27397c65b92c04de0123210243ec37dee0e2e053a9c976f43147e79bc7d9dc606ea51010af1ac80db6b069e1acffffffff01ffffffffffffffff015100000000", "P2SH"],
+
+["MAX_MONEY + 1 output"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "HASH160 0x14 0x32afac281462b822adbec5094b8d4d337dd5bd6a EQUAL"]],
+"01000000010001000000000000000000000000000000000000000000000000000000000000000000006e493046022100e1eadba00d9296c743cb6ecc703fd9ddc9b3cd12906176a226ae4c18d6b00796022100a71aef7d2874deff681ba6080f1b278bac7bb99c61b08a85f4311970ffe7f63f012321030c0588dc44d92bdcbf8e72093466766fdc265ead8db64517b0c542275b70fffbacffffffff010140075af0750700015100000000", "P2SH"],
+
+["MAX_MONEY output + 1 output"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "HASH160 0x14 0xb558cbf4930954aa6a344363a15668d7477ae716 EQUAL"]],
+"01000000010001000000000000000000000000000000000000000000000000000000000000000000006d483045022027deccc14aa6668e78a8c9da3484fbcd4f9dcc9bb7d1b85146314b21b9ae4d86022100d0b43dece8cfb07348de0ca8bc5b86276fa88f7f2138381128b7c36ab2e42264012321029bb13463ddd5d2cc05da6e84e37536cb9525703cfd8f43afdb414988987a92f6acffffffff020040075af075070001510001000000000000015100000000", "P2SH"],
+
+["Duplicate inputs"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "HASH160 0x14 0x236d0639db62b0773fd8ac34dc85ae19e9aba80a EQUAL"]],
+"01000000020001000000000000000000000000000000000000000000000000000000000000000000006c47304402204bb1197053d0d7799bf1b30cd503c44b58d6240cccbdc85b6fe76d087980208f02204beeed78200178ffc6c74237bb74b3f276bbb4098b5605d814304fe128bf1431012321039e8815e15952a7c3fada1905f8cf55419837133bd7756c0ef14fc8dfe50c0deaacffffffff0001000000000000000000000000000000000000000000000000000000000000000000006c47304402202306489afef52a6f62e90bf750bbcdf40c06f5c6b138286e6b6b86176bb9341802200dba98486ea68380f47ebb19a7df173b99e6bc9c681d6ccf3bde31465d1f16b3012321039e8815e15952a7c3fada1905f8cf55419837133bd7756c0ef14fc8dfe50c0deaacffffffff010000000000000000015100000000", "P2SH"],
+
+["Coinbase of size 1"],
+["Note the input is just required to make the tester happy"],
+[[["0000000000000000000000000000000000000000000000000000000000000000", -1, "1"]],
+"01000000010000000000000000000000000000000000000000000000000000000000000000ffffffff0151ffffffff010000000000000000015100000000", "P2SH"],
+
+["Coinbase of size 101"],
+["Note the input is just required to make the tester happy"],
+[[["0000000000000000000000000000000000000000000000000000000000000000", -1, "1"]],
+"01000000010000000000000000000000000000000000000000000000000000000000000000ffffffff655151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151ffffffff010000000000000000015100000000", "P2SH"],
+
+["Null txin"],
+[[["0000000000000000000000000000000000000000000000000000000000000000", -1, "HASH160 0x14 0x02dae7dbbda56097959cba59b1989dd3e47937bf EQUAL"]],
+"01000000010000000000000000000000000000000000000000000000000000000000000000ffffffff6e49304602210086f39e028e46dafa8e1e3be63906465f4cf038fbe5ed6403dc3e74ae876e6431022100c4625c675cfc5c7e3a0e0d7eaec92ac24da20c73a88eb40d09253e51ac6def5201232103a183ddc41e84753aca47723c965d1b5c8b0e2b537963518355e6dd6cf8415e50acffffffff010000000000000000015100000000", "P2SH"],
+
+["Same as the transactions in valid with one input SIGHASH_ALL and one SIGHASH_ANYONECANPAY, but we set the _ANYONECANPAY sequence number, invalidating the SIGHASH_ALL signature"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "0x21 0x035e7f0d4d0841bcd56c39337ed086b1a633ee770c1ffdd94ac552a95ac2ce0efc CHECKSIG"],
+  ["0000000000000000000000000000000000000000000000000000000000000200", 0, "0x21 0x035e7f0d4d0841bcd56c39337ed086b1a633ee770c1ffdd94ac552a95ac2ce0efc CHECKSIG"]],
+ "01000000020001000000000000000000000000000000000000000000000000000000000000000000004948304502203a0f5f0e1f2bdbcd04db3061d18f3af70e07f4f467cbc1b8116f267025f5360b022100c792b6e215afc5afc721a351ec413e714305cb749aae3d7fee76621313418df10101000000000200000000000000000000000000000000000000000000000000000000000000000000484730440220201dc2d030e380e8f9cfb41b442d930fa5a685bb2c8db5906671f865507d0670022018d9e7a8d4c8d86a73c2a724ee38ef983ec249827e0e464841735955c707ece98101000000010100000000000000015100000000", "P2SH"],
+
+["CHECKMULTISIG with incorrect signature order"],
+["Note the input is just required to make the tester happy"],
+[[["b3da01dd4aae683c7aee4d5d8b52a540a508e1115f77cd7fa9a291243f501223", 0, "HASH160 0x14 0xb1ce99298d5f07364b57b1e5c9cc00be0b04a954 EQUAL"]],
+"01000000012312503f2491a2a97fcd775f11e108a540a5528b5d4dee7a3c68ae4add01dab300000000fdfe000048304502207aacee820e08b0b174e248abd8d7a34ed63b5da3abedb99934df9fddd65c05c4022100dfe87896ab5ee3df476c2655f9fbe5bd089dccbef3e4ea05b5d121169fe7f5f401483045022100f6649b0eddfdfd4ad55426663385090d51ee86c3481bdc6b0c18ea6c0ece2c0b0220561c315b07cffa6f7dd9df96dbae9200c2dee09bf93cc35ca05e6cdf613340aa014c695221031d11db38972b712a9fe1fc023577c7ae3ddb4a3004187d41c45121eecfdbb5b7210207ec36911b6ad2382860d32989c7b8728e9489d7bbc94a6b5509ef0029be128821024ea9fac06f666a4adc3fc1357b7bec1fd0bdece2b9d08579226a8ebde53058e453aeffffffff0180380100000000001976a914c9b99cddf847d10685a4fabaa0baf505f7c3dfab88ac00000000", "P2SH"],
+
+["The following is 23b397edccd3740a74adb603c9756370fafcde9bcc4483eb271ecad09a94dd63"],
+["It is of particular interest because it contains an invalidly-encoded signature which OpenSSL accepts"],
+["See http://r6.ca/blog/20111119T211504Z.html"],
+["It is also the first OP_CHECKMULTISIG transaction on the Bitcoin block chain in standard form"],
+[[["60a20bd93aa49ab4b28d514ec10b06e1829ce6818ec06cd3aabd013ebcdc4bb1", 0, "1 0x41 0x04cc71eb30d653c0c3163990c47b976f3fb3f37cccdcbedb169a1dfef58bbfbfaff7d8a473e7e2e6d317b87bafe8bde97e3cf8f065dec022b51d11fcdd0d348ac4 0x41 0x0461cbdcc5409fb4b4d42b51d33381354d80e550078cb532a34bfa2fcfdeb7d76519aecc62770f5b0e4ef8551946d8a540911abe3e7854a26f39f58b25c15342af 2 OP_CHECKMULTISIG"]],
+"0100000001b14bdcbc3e01bdaad36cc08e81e69c82e1060bc14e518db2b49aa43ad90ba26000000000490047304402203f16c6f40162ab686621ef3000b04e75418a0c0cb2d8aebeac894ae360ac1e780220ddc15ecdfc3507ac48e1681a33eb60996631bf6bf5bc0a0682c4db743ce7ca2b01ffffffff0140420f00000000001976a914660d4ef3a743e3e696ad990364e555c271ad504b88ac00000000", "P2SH"],
+
+["The following is a tweaked form of 23b397edccd3740a74adb603c9756370fafcde9bcc4483eb271ecad09a94dd63"],
+["It is an OP_CHECKMULTISIG with an arbitrary extra byte stuffed into the signature at pos length - 2"],
+["The dummy byte is fine however, so the NULLDUMMY flag should be happy"],
+[[["60a20bd93aa49ab4b28d514ec10b06e1829ce6818ec06cd3aabd013ebcdc4bb1", 0, "1 0x41 0x04cc71eb30d653c0c3163990c47b976f3fb3f37cccdcbedb169a1dfef58bbfbfaff7d8a473e7e2e6d317b87bafe8bde97e3cf8f065dec022b51d11fcdd0d348ac4 0x41 0x0461cbdcc5409fb4b4d42b51d33381354d80e550078cb532a34bfa2fcfdeb7d76519aecc62770f5b0e4ef8551946d8a540911abe3e7854a26f39f58b25c15342af 2 OP_CHECKMULTISIG"]],
+"0100000001b14bdcbc3e01bdaad36cc08e81e69c82e1060bc14e518db2b49aa43ad90ba260000000004a0048304402203f16c6f40162ab686621ef3000b04e75418a0c0cb2d8aebeac894ae360ac1e780220ddc15ecdfc3507ac48e1681a33eb60996631bf6bf5bc0a0682c4db743ce7ca2bab01ffffffff0140420f00000000001976a914660d4ef3a743e3e696ad990364e555c271ad504b88ac00000000", "P2SH,NULLDUMMY"],
+
+["The following is a tweaked form of 23b397edccd3740a74adb603c9756370fafcde9bcc4483eb271ecad09a94dd63"],
+["It is an OP_CHECKMULTISIG with the dummy value set to something other than an empty string"],
+[[["60a20bd93aa49ab4b28d514ec10b06e1829ce6818ec06cd3aabd013ebcdc4bb1", 0, "1 0x41 0x04cc71eb30d653c0c3163990c47b976f3fb3f37cccdcbedb169a1dfef58bbfbfaff7d8a473e7e2e6d317b87bafe8bde97e3cf8f065dec022b51d11fcdd0d348ac4 0x41 0x0461cbdcc5409fb4b4d42b51d33381354d80e550078cb532a34bfa2fcfdeb7d76519aecc62770f5b0e4ef8551946d8a540911abe3e7854a26f39f58b25c15342af 2 OP_CHECKMULTISIG"]],
+"0100000001b14bdcbc3e01bdaad36cc08e81e69c82e1060bc14e518db2b49aa43ad90ba260000000004a01ff47304402203f16c6f40162ab686621ef3000b04e75418a0c0cb2d8aebeac894ae360ac1e780220ddc15ecdfc3507ac48e1681a33eb60996631bf6bf5bc0a0682c4db743ce7ca2b01ffffffff0140420f00000000001976a914660d4ef3a743e3e696ad990364e555c271ad504b88ac00000000", "P2SH"],
+
+["As above, but using a OP_1"],
+[[["60a20bd93aa49ab4b28d514ec10b06e1829ce6818ec06cd3aabd013ebcdc4bb1", 0, "1 0x41 0x04cc71eb30d653c0c3163990c47b976f3fb3f37cccdcbedb169a1dfef58bbfbfaff7d8a473e7e2e6d317b87bafe8bde97e3cf8f065dec022b51d11fcdd0d348ac4 0x41 0x0461cbdcc5409fb4b4d42b51d33381354d80e550078cb532a34bfa2fcfdeb7d76519aecc62770f5b0e4ef8551946d8a540911abe3e7854a26f39f58b25c15342af 2 OP_CHECKMULTISIG"]],
+"0100000001b14bdcbc3e01bdaad36cc08e81e69c82e1060bc14e518db2b49aa43ad90ba26000000000495147304402203f16c6f40162ab686621ef3000b04e75418a0c0cb2d8aebeac894ae360ac1e780220ddc15ecdfc3507ac48e1681a33eb60996631bf6bf5bc0a0682c4db743ce7ca2b01ffffffff0140420f00000000001976a914660d4ef3a743e3e696ad990364e555c271ad504b88ac00000000", "P2SH"],
+
+["As above, but using a OP_1NEGATE"],
+[[["60a20bd93aa49ab4b28d514ec10b06e1829ce6818ec06cd3aabd013ebcdc4bb1", 0, "1 0x41 0x04cc71eb30d653c0c3163990c47b976f3fb3f37cccdcbedb169a1dfef58bbfbfaff7d8a473e7e2e6d317b87bafe8bde97e3cf8f065dec022b51d11fcdd0d348ac4 0x41 0x0461cbdcc5409fb4b4d42b51d33381354d80e550078cb532a34bfa2fcfdeb7d76519aecc62770f5b0e4ef8551946d8a540911abe3e7854a26f39f58b25c15342af 2 OP_CHECKMULTISIG"]],
+"0100000001b14bdcbc3e01bdaad36cc08e81e69c82e1060bc14e518db2b49aa43ad90ba26000000000494f47304402203f16c6f40162ab686621ef3000b04e75418a0c0cb2d8aebeac894ae360ac1e780220ddc15ecdfc3507ac48e1681a33eb60996631bf6bf5bc0a0682c4db743ce7ca2b01ffffffff0140420f00000000001976a914660d4ef3a743e3e696ad990364e555c271ad504b88ac00000000", "P2SH"],
+
+["The following is a tweaked form of 23b397edccd3740a74adb603c9756370fafcde9bcc4483eb271ecad09a94dd63"],
+["It is an OP_CHECKMULTISIG with the dummy value missing"],
+[[["60a20bd93aa49ab4b28d514ec10b06e1829ce6818ec06cd3aabd013ebcdc4bb1", 0, "1 0x41 0x04cc71eb30d653c0c3163990c47b976f3fb3f37cccdcbedb169a1dfef58bbfbfaff7d8a473e7e2e6d317b87bafe8bde97e3cf8f065dec022b51d11fcdd0d348ac4 0x41 0x0461cbdcc5409fb4b4d42b51d33381354d80e550078cb532a34bfa2fcfdeb7d76519aecc62770f5b0e4ef8551946d8a540911abe3e7854a26f39f58b25c15342af 2 OP_CHECKMULTISIG"]],
+"0100000001b14bdcbc3e01bdaad36cc08e81e69c82e1060bc14e518db2b49aa43ad90ba260000000004847304402203f16c6f40162ab686621ef3000b04e75418a0c0cb2d8aebeac894ae360ac1e780220ddc15ecdfc3507ac48e1681a33eb60996631bf6bf5bc0a0682c4db743ce7ca2b01ffffffff0140420f00000000001976a914660d4ef3a743e3e696ad990364e555c271ad504b88ac00000000", "P2SH"],
+
+["The following is f7fdd091fa6d8f5e7a8c2458f5c38faffff2d3f1406b6e4fe2c99dcc0d2d1cbb"],
+["It caught a bug in the workaround for 23b397edccd3740a74adb603c9756370fafcde9bcc4483eb271ecad09a94dd63 in an overly simple implementation"],
+[[["b464e85df2a238416f8bdae11d120add610380ea07f4ef19c5f9dfd472f96c3d", 0, "DUP HASH160 0x14 0xbef80ecf3a44500fda1bc92176e442891662aed2 EQUALVERIFY CHECKSIG"],
+["b7978cc96e59a8b13e0865d3f95657561a7f725be952438637475920bac9eb21", 1, "DUP HASH160 0x14 0xbef80ecf3a44500fda1bc92176e442891662aed2 EQUALVERIFY CHECKSIG"]],
+"01000000023d6cf972d4dff9c519eff407ea800361dd0a121de1da8b6f4138a2f25de864b4000000008a4730440220ffda47bfc776bcd269da4832626ac332adfca6dd835e8ecd83cd1ebe7d709b0e022049cffa1cdc102a0b56e0e04913606c70af702a1149dc3b305ab9439288fee090014104266abb36d66eb4218a6dd31f09bb92cf3cfa803c7ea72c1fc80a50f919273e613f895b855fb7465ccbc8919ad1bd4a306c783f22cd3227327694c4fa4c1c439affffffff21ebc9ba20594737864352e95b727f1a565756f9d365083eb1a8596ec98c97b7010000008a4730440220503ff10e9f1e0de731407a4a245531c9ff17676eda461f8ceeb8c06049fa2c810220c008ac34694510298fa60b3f000df01caa244f165b727d4896eb84f81e46bcc4014104266abb36d66eb4218a6dd31f09bb92cf3cfa803c7ea72c1fc80a50f919273e613f895b855fb7465ccbc8919ad1bd4a306c783f22cd3227327694c4fa4c1c439affffffff01f0da5200000000001976a914857ccd42dded6df32949d4646dfa10a92458cfaa88ac00000000", "P2SH"],
+
+
+["CHECKMULTISIG SCRIPT_VERIFY_NULLDUMMY tests:"],
+
+["The following is a tweaked form of 23b397edccd3740a74adb603c9756370fafcde9bcc4483eb271ecad09a94dd63"],
+["It is an OP_CHECKMULTISIG with the dummy value set to something other than an empty string"],
+[[["60a20bd93aa49ab4b28d514ec10b06e1829ce6818ec06cd3aabd013ebcdc4bb1", 0, "1 0x41 0x04cc71eb30d653c0c3163990c47b976f3fb3f37cccdcbedb169a1dfef58bbfbfaff7d8a473e7e2e6d317b87bafe8bde97e3cf8f065dec022b51d11fcdd0d348ac4 0x41 0x0461cbdcc5409fb4b4d42b51d33381354d80e550078cb532a34bfa2fcfdeb7d76519aecc62770f5b0e4ef8551946d8a540911abe3e7854a26f39f58b25c15342af 2 OP_CHECKMULTISIG"]],
+"0100000001b14bdcbc3e01bdaad36cc08e81e69c82e1060bc14e518db2b49aa43ad90ba260000000004a010047304402203f16c6f40162ab686621ef3000b04e75418a0c0cb2d8aebeac894ae360ac1e780220ddc15ecdfc3507ac48e1681a33eb60996631bf6bf5bc0a0682c4db743ce7ca2b01ffffffff0140420f00000000001976a914660d4ef3a743e3e696ad990364e555c271ad504b88ac00000000", "P2SH,NULLDUMMY"],
+
+["As above, but using a OP_1"],
+[[["60a20bd93aa49ab4b28d514ec10b06e1829ce6818ec06cd3aabd013ebcdc4bb1", 0, "1 0x41 0x04cc71eb30d653c0c3163990c47b976f3fb3f37cccdcbedb169a1dfef58bbfbfaff7d8a473e7e2e6d317b87bafe8bde97e3cf8f065dec022b51d11fcdd0d348ac4 0x41 0x0461cbdcc5409fb4b4d42b51d33381354d80e550078cb532a34bfa2fcfdeb7d76519aecc62770f5b0e4ef8551946d8a540911abe3e7854a26f39f58b25c15342af 2 OP_CHECKMULTISIG"]],
+"0100000001b14bdcbc3e01bdaad36cc08e81e69c82e1060bc14e518db2b49aa43ad90ba26000000000495147304402203f16c6f40162ab686621ef3000b04e75418a0c0cb2d8aebeac894ae360ac1e780220ddc15ecdfc3507ac48e1681a33eb60996631bf6bf5bc0a0682c4db743ce7ca2b01ffffffff0140420f00000000001976a914660d4ef3a743e3e696ad990364e555c271ad504b88ac00000000", "P2SH,NULLDUMMY"],
+
+["As above, but using a OP_1NEGATE"],
+[[["60a20bd93aa49ab4b28d514ec10b06e1829ce6818ec06cd3aabd013ebcdc4bb1", 0, "1 0x41 0x04cc71eb30d653c0c3163990c47b976f3fb3f37cccdcbedb169a1dfef58bbfbfaff7d8a473e7e2e6d317b87bafe8bde97e3cf8f065dec022b51d11fcdd0d348ac4 0x41 0x0461cbdcc5409fb4b4d42b51d33381354d80e550078cb532a34bfa2fcfdeb7d76519aecc62770f5b0e4ef8551946d8a540911abe3e7854a26f39f58b25c15342af 2 OP_CHECKMULTISIG"]],
+"0100000001b14bdcbc3e01bdaad36cc08e81e69c82e1060bc14e518db2b49aa43ad90ba26000000000494f47304402203f16c6f40162ab686621ef3000b04e75418a0c0cb2d8aebeac894ae360ac1e780220ddc15ecdfc3507ac48e1681a33eb60996631bf6bf5bc0a0682c4db743ce7ca2b01ffffffff0140420f00000000001976a914660d4ef3a743e3e696ad990364e555c271ad504b88ac00000000", "P2SH,NULLDUMMY"],
+
+["As above, but with the dummy byte missing"],
+[[["60a20bd93aa49ab4b28d514ec10b06e1829ce6818ec06cd3aabd013ebcdc4bb1", 0, "1 0x41 0x04cc71eb30d653c0c3163990c47b976f3fb3f37cccdcbedb169a1dfef58bbfbfaff7d8a473e7e2e6d317b87bafe8bde97e3cf8f065dec022b51d11fcdd0d348ac4 0x41 0x0461cbdcc5409fb4b4d42b51d33381354d80e550078cb532a34bfa2fcfdeb7d76519aecc62770f5b0e4ef8551946d8a540911abe3e7854a26f39f58b25c15342af 2 OP_CHECKMULTISIG"]],
+"0100000001b14bdcbc3e01bdaad36cc08e81e69c82e1060bc14e518db2b49aa43ad90ba260000000004847304402203f16c6f40162ab686621ef3000b04e75418a0c0cb2d8aebeac894ae360ac1e780220ddc15ecdfc3507ac48e1681a33eb60996631bf6bf5bc0a0682c4db743ce7ca2b01ffffffff0140420f00000000001976a914660d4ef3a743e3e696ad990364e555c271ad504b88ac00000000", "P2SH,NULLDUMMY"],
+
+
+["Empty stack when we try to run CHECKSIG"],
+[[["ad503f72c18df5801ee64d76090afe4c607fb2b822e9b7b63c5826c50e22fc3b", 0, "0x21 0x027c3a97665bf283a102a587a62a30a0c102d4d3b141015e2cae6f64e2543113e5 CHECKSIG NOT"]],
+"01000000013bfc220ec526583cb6b7e922b8b27f604cfe0a09764de61e80f58dc1723f50ad0000000000ffffffff0101000000000000002321027c3a97665bf283a102a587a62a30a0c102d4d3b141015e2cae6f64e2543113e5ac00000000", "P2SH"],
+
+
+
+["CHECKLOCKTIMEVERIFY tests"],
+
+["By-height locks, with argument just beyond tx nLockTime"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "1 NOP2 1"]],
+"010000000100010000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000", "P2SH,CHECKLOCKTIMEVERIFY"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "499999999 NOP2 1"]],
+"0100000001000100000000000000000000000000000000000000000000000000000000000000000000000000000001000000000000000000fe64cd1d", "P2SH,CHECKLOCKTIMEVERIFY"],
+
+["By-time locks, with argument just beyond tx nLockTime (but within numerical boundaries)"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "500000001 NOP2 1"]],
+"01000000010001000000000000000000000000000000000000000000000000000000000000000000000000000000010000000000000000000065cd1d", "P2SH,CHECKLOCKTIMEVERIFY"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "4294967295 NOP2 1"]],
+"0100000001000100000000000000000000000000000000000000000000000000000000000000000000000000000001000000000000000000feffffff", "P2SH,CHECKLOCKTIMEVERIFY"],
+
+["Argument missing"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "NOP2 1"]],
+"010000000100010000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000", "P2SH,CHECKLOCKTIMEVERIFY"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "1"]],
+"010000000100010000000000000000000000000000000000000000000000000000000000000000000001b1010000000100000000000000000000000000", "P2SH,CHECKLOCKTIMEVERIFY"],
+
+["Argument negative with by-blockheight nLockTime=0"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "-1 NOP2 1"]],
+"010000000100010000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000", "P2SH,CHECKLOCKTIMEVERIFY"],
+
+["Argument negative with by-blocktime nLockTime=500,000,000"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "-1 NOP2 1"]],
+"01000000010001000000000000000000000000000000000000000000000000000000000000000000000000000000010000000000000000000065cd1d", "P2SH,CHECKLOCKTIMEVERIFY"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "1"]],
+"010000000100010000000000000000000000000000000000000000000000000000000000000000000004005194b1010000000100000000000000000002000000", "P2SH,CHECKLOCKTIMEVERIFY"],
+
+["Input locked"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "0 NOP2 1"]],
+"010000000100010000000000000000000000000000000000000000000000000000000000000000000000ffffffff0100000000000000000000000000", "P2SH,CHECKLOCKTIMEVERIFY"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "0"]],
+"01000000010001000000000000000000000000000000000000000000000000000000000000000000000251b1ffffffff0100000000000000000002000000", "P2SH,CHECKLOCKTIMEVERIFY"],
+
+["Another input being unlocked isn't sufficient; the CHECKLOCKTIMEVERIFY-using input must be unlocked"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "0 NOP2 1"] ,
+  ["0000000000000000000000000000000000000000000000000000000000000200", 1, "1"]],
+"010000000200010000000000000000000000000000000000000000000000000000000000000000000000ffffffff00020000000000000000000000000000000000000000000000000000000000000100000000000000000100000000000000000000000000", "P2SH,CHECKLOCKTIMEVERIFY"],
+
+["Argument/tx height/time mismatch, both versions"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "0 NOP2 1"]],
+"01000000010001000000000000000000000000000000000000000000000000000000000000000000000000000000010000000000000000000065cd1d", "P2SH,CHECKLOCKTIMEVERIFY"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "0"]],
+"01000000010001000000000000000000000000000000000000000000000000000000000000000000000251b100000000010000000000000000000065cd1d", "P2SH,CHECKLOCKTIMEVERIFY"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "499999999 NOP2 1"]],
+"01000000010001000000000000000000000000000000000000000000000000000000000000000000000000000000010000000000000000000065cd1d", "P2SH,CHECKLOCKTIMEVERIFY"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "500000000 NOP2 1"]],
+"010000000100010000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000", "P2SH,CHECKLOCKTIMEVERIFY"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "500000000 NOP2 1"]],
+"0100000001000100000000000000000000000000000000000000000000000000000000000000000000000000000001000000000000000000ff64cd1d", "P2SH,CHECKLOCKTIMEVERIFY"],
+
+["Argument 2^32 with nLockTime=2^32-1"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "4294967296 NOP2 1"]],
+"0100000001000100000000000000000000000000000000000000000000000000000000000000000000000000000001000000000000000000ffffffff", "P2SH,CHECKLOCKTIMEVERIFY"],
+
+["Same, but with nLockTime=2^31-1"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "2147483648 NOP2 1"]],
+"0100000001000100000000000000000000000000000000000000000000000000000000000000000000000000000001000000000000000000ffffff7f", "P2SH,CHECKLOCKTIMEVERIFY"],
+
+["6 byte non-minimally-encoded arguments are invalid even in their contents are valid"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "0x06 0x000000000000 NOP2 1"]],
+"010000000100010000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000", "P2SH,CHECKLOCKTIMEVERIFY"],
+
+["Failure due to failing CHECKLOCKTIMEVERIFY in scriptSig"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "1"]],
+"01000000010001000000000000000000000000000000000000000000000000000000000000000000000251b1000000000100000000000000000000000000", "P2SH,CHECKLOCKTIMEVERIFY"],
+
+["Failure due to failing CHECKLOCKTIMEVERIFY in redeemScript"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "HASH160 0x14 0xc5b93064159b3b2d6ab506a41b1f50463771b988 EQUAL"]],
+"0100000001000100000000000000000000000000000000000000000000000000000000000000000000030251b1000000000100000000000000000000000000", "P2SH,CHECKLOCKTIMEVERIFY"],
+
+["MOVED after fixing SIGHASH_SINGLE bug. The following tests for the presence of a bug in the handling of SIGHASH_SINGLE"],
+["It results in signing the constant 1, instead of something generated based on the transaction,"],
+["when the input doing the signing has an index greater than the maximum output index"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "DUP HASH160 0x14 0xe52b482f2faa8ecbf0db344f93c84ac908557f33 EQUALVERIFY CHECKSIG"], ["0000000000000000000000000000000000000000000000000000000000000200", 0, "1"]],
+"01000000020002000000000000000000000000000000000000000000000000000000000000000000000151ffffffff0001000000000000000000000000000000000000000000000000000000000000000000006b483045022100c9cdd08798a28af9d1baf44a6c77bcc7e279f47dc487c8c899911bc48feaffcc0220503c5c50ae3998a733263c5c0f7061b483e2b56c4c41b456e7d2f5a78a74c077032102d5c25adb51b61339d2b05315791e21bbe80ea470a49db0135720983c905aace0ffffffff010000000000000000015100000000", "P2SH"],
+
+["MOVED the following two tests after fixing SIGHASH_SINGLE bug. Finally CHECKMULTISIG removes all signatures prior to hashing the script containing those signatures. In conjunction with the SIGHASH_SINGLE bug this lets us test whether or not FindAndDelete() is actually present in scriptPubKey/redeemScript evaluation by including a signature of the digest 0x01 We can compute in advance for our pubkey, embed it it in the scriptPubKey, and then also using a normal SIGHASH_ALL signature. If FindAndDelete() wasn't run, the 'bugged' signature would still be in the hashed script, and the normal signature would fail."],
+
+["Here's an example on mainnet within a P2SH redeemScript. Remarkably it's a standard transaction in <0.9"],
+[[["b5b598de91787439afd5938116654e0b16b7a0d0f82742ba37564219c5afcbf9", 0, "DUP HASH160 0x14 0xf6f365c40f0739b61de827a44751e5e99032ed8f EQUALVERIFY CHECKSIG"],
+  ["ab9805c6d57d7070d9a42c5176e47bb705023e6b67249fb6760880548298e742", 0, "HASH160 0x14 0xd8dacdadb7462ae15cd906f1878706d0da8660e6 EQUAL"]],
+"0100000002f9cbafc519425637ba4227f8d0a0b7160b4e65168193d5af39747891de98b5b5000000006b4830450221008dd619c563e527c47d9bd53534a770b102e40faa87f61433580e04e271ef2f960220029886434e18122b53d5decd25f1f4acb2480659fea20aabd856987ba3c3907e0121022b78b756e2258af13779c1a1f37ea6800259716ca4b7f0b87610e0bf3ab52a01ffffffff42e7988254800876b69f24676b3e0205b77be476512ca4d970707dd5c60598ab00000000fd260100483045022015bd0139bcccf990a6af6ec5c1c52ed8222e03a0d51c334df139968525d2fcd20221009f9efe325476eb64c3958e4713e9eefe49bf1d820ed58d2112721b134e2a1a53034930460221008431bdfa72bc67f9d41fe72e94c88fb8f359ffa30b33c72c121c5a877d922e1002210089ef5fc22dd8bfc6bf9ffdb01a9862d27687d424d1fefbab9e9c7176844a187a014c9052483045022015bd0139bcccf990a6af6ec5c1c52ed8222e03a0d51c334df139968525d2fcd20221009f9efe325476eb64c3958e4713e9eefe49bf1d820ed58d2112721b134e2a1a5303210378d430274f8c5ec1321338151e9f27f4c676a008bdf8638d07c0b6be9ab35c71210378d430274f8c5ec1321338151e9f27f4c676a008bdf8638d07c0b6be9ab35c7153aeffffffff01a08601000000000017a914d8dacdadb7462ae15cd906f1878706d0da8660e68700000000", "P2SH"],
+
+["Same idea, but with bare CHECKMULTISIG"],
+[[["ceafe58e0f6e7d67c0409fbbf673c84c166e3c5d3c24af58f7175b18df3bb3db", 0, "DUP HASH160 0x14 0xf6f365c40f0739b61de827a44751e5e99032ed8f EQUALVERIFY CHECKSIG"],
+  ["ceafe58e0f6e7d67c0409fbbf673c84c166e3c5d3c24af58f7175b18df3bb3db", 1, "2 0x48 0x3045022015bd0139bcccf990a6af6ec5c1c52ed8222e03a0d51c334df139968525d2fcd20221009f9efe325476eb64c3958e4713e9eefe49bf1d820ed58d2112721b134e2a1a5303 0x21 0x0378d430274f8c5ec1321338151e9f27f4c676a008bdf8638d07c0b6be9ab35c71 0x21 0x0378d430274f8c5ec1321338151e9f27f4c676a008bdf8638d07c0b6be9ab35c71 3 CHECKMULTISIG"]],
+"0100000002dbb33bdf185b17f758af243c5d3c6e164cc873f6bb9f40c0677d6e0f8ee5afce000000006b4830450221009627444320dc5ef8d7f68f35010b4c050a6ed0d96b67a84db99fda9c9de58b1e02203e4b4aaa019e012e65d69b487fdf8719df72f488fa91506a80c49a33929f1fd50121022b78b756e2258af13779c1a1f37ea6800259716ca4b7f0b87610e0bf3ab52a01ffffffffdbb33bdf185b17f758af243c5d3c6e164cc873f6bb9f40c0677d6e0f8ee5afce010000009300483045022015bd0139bcccf990a6af6ec5c1c52ed8222e03a0d51c334df139968525d2fcd20221009f9efe325476eb64c3958e4713e9eefe49bf1d820ed58d2112721b134e2a1a5303483045022015bd0139bcccf990a6af6ec5c1c52ed8222e03a0d51c334df139968525d2fcd20221009f9efe325476eb64c3958e4713e9eefe49bf1d820ed58d2112721b134e2a1a5303ffffffff01a0860100000000001976a9149bc0bbdd3024da4d0c38ed1aecf5c68dd1d3fa1288ac00000000", "P2SH"],
+
+["Make diffs cleaner by leaving a comment here without comma at the end"]
+]
diff --git a/depend/zcash/src/test/data/tx_valid.json b/depend/zcash/src/test/data/tx_valid.json
new file mode 100644
index 000000000..762e1449e
--- /dev/null
+++ b/depend/zcash/src/test/data/tx_valid.json
@@ -0,0 +1,138 @@
+[
+["The following are deserialized transactions which are valid."],
+["They are in the form"],
+["[[[prevout hash, prevout index, prevout scriptPubKey], [input 2], ...],"],
+["serializedTransaction, verifyFlags]"],
+["Objects that are only a single string (like this one) are ignored"],
+
+["The following is c99c49da4c38af669dea436d3e73780dfdb6c1ecf9958baa52960e8baee30e73"],
+["It is of interest because it contains a 0-sequence as well as a signature of SIGHASH type 0 (which is not a real type)"],
+[[["406b2b06bcd34d3c8733e6b79f7a394c8a431fbf4ff5ac705c93f4076bb77602", 0, "DUP HASH160 0x14 0xdc44b1164188067c3a32d4780f5996fa14a4f2d9 EQUALVERIFY CHECKSIG"]],
+"01000000010276b76b07f4935c70acf54fbf1f438a4c397a9fb7e633873c4dd3bc062b6b40000000008c493046022100d23459d03ed7e9511a47d13292d3430a04627de6235b6e51a40f9cd386f2abe3022100e7d25b080f0bb8d8d5f878bba7d54ad2fda650ea8d158a33ee3cbd11768191fd004104b0e2c879e4daf7b9ab68350228c159766676a14f5815084ba166432aab46198d4cca98fa3e9981d0a90b2effc514b76279476550ba3663fdcaff94c38420e9d5000000000100093d00000000001976a9149a7b0f3b80c6baaeedce0a0842553800f832ba1f88ac00000000", "P2SH"],
+
+["A nearly-standard transaction with CHECKSIGVERIFY 1 instead of CHECKSIG"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "DUP HASH160 0x14 0x5b6462475454710f3c22f5fdf0b40704c92f25c3 EQUALVERIFY CHECKSIGVERIFY 1"]],
+"01000000010001000000000000000000000000000000000000000000000000000000000000000000006a473044022067288ea50aa799543a536ff9306f8e1cba05b9c6b10951175b924f96732555ed022026d7b5265f38d21541519e4a1e55044d5b9e17e15cdbaf29ae3792e99e883e7a012103ba8c8b86dea131c22ab967e6dd99bdae8eff7a1f75a2c35f1f944109e3fe5e22ffffffff010000000000000000015100000000", "P2SH"],
+
+["An invalid P2SH Transaction"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "HASH160 0x14 0x7a052c840ba73af26755de42cf01cc9e0a49fef0 EQUAL"]],
+"010000000100010000000000000000000000000000000000000000000000000000000000000000000009085768617420697320ffffffff010000000000000000015100000000", "NONE"],
+
+["A valid P2SH Transaction using the standard transaction type put forth in BIP 16"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "HASH160 0x14 0x8febbed40483661de6958d957412f82deed8e2f7 EQUAL"]],
+"01000000010001000000000000000000000000000000000000000000000000000000000000000000006e493046022100c66c9cdf4c43609586d15424c54707156e316d88b0a1534c9e6b0d4f311406310221009c0fe51dbc9c4ab7cc25d3fdbeccf6679fe6827f08edf2b4a9f16ee3eb0e438a0123210338e8034509af564c62644c07691942e0c056752008a173c89f60ab2a88ac2ebfacffffffff010000000000000000015100000000", "P2SH"],
+
+["Tests for CheckTransaction()"],
+["MAX_MONEY output"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "HASH160 0x14 0x32afac281462b822adbec5094b8d4d337dd5bd6a EQUAL"]],
+"01000000010001000000000000000000000000000000000000000000000000000000000000000000006e493046022100e1eadba00d9296c743cb6ecc703fd9ddc9b3cd12906176a226ae4c18d6b00796022100a71aef7d2874deff681ba6080f1b278bac7bb99c61b08a85f4311970ffe7f63f012321030c0588dc44d92bdcbf8e72093466766fdc265ead8db64517b0c542275b70fffbacffffffff010040075af0750700015100000000", "P2SH"],
+
+["MAX_MONEY output + 0 output"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "HASH160 0x14 0xb558cbf4930954aa6a344363a15668d7477ae716 EQUAL"]],
+"01000000010001000000000000000000000000000000000000000000000000000000000000000000006d483045022027deccc14aa6668e78a8c9da3484fbcd4f9dcc9bb7d1b85146314b21b9ae4d86022100d0b43dece8cfb07348de0ca8bc5b86276fa88f7f2138381128b7c36ab2e42264012321029bb13463ddd5d2cc05da6e84e37536cb9525703cfd8f43afdb414988987a92f6acffffffff020040075af075070001510000000000000000015100000000", "P2SH"],
+
+["Coinbase of size 2"],
+["Note the input is just required to make the tester happy"],
+[[["0000000000000000000000000000000000000000000000000000000000000000", -1, "1"]],
+"01000000010000000000000000000000000000000000000000000000000000000000000000ffffffff025151ffffffff010000000000000000015100000000", "P2SH"],
+
+["Coinbase of size 100"],
+["Note the input is just required to make the tester happy"],
+[[["0000000000000000000000000000000000000000000000000000000000000000", -1, "1"]],
+"01000000010000000000000000000000000000000000000000000000000000000000000000ffffffff6451515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151515151ffffffff010000000000000000015100000000", "P2SH"],
+
+["Simple transaction with first input is signed with SIGHASH_ALL, second with SIGHASH_ANYONECANPAY"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "0x21 0x035e7f0d4d0841bcd56c39337ed086b1a633ee770c1ffdd94ac552a95ac2ce0efc CHECKSIG"],
+  ["0000000000000000000000000000000000000000000000000000000000000200", 0, "0x21 0x035e7f0d4d0841bcd56c39337ed086b1a633ee770c1ffdd94ac552a95ac2ce0efc CHECKSIG"]],
+ "010000000200010000000000000000000000000000000000000000000000000000000000000000000049483045022100d180fd2eb9140aeb4210c9204d3f358766eb53842b2a9473db687fa24b12a3cc022079781799cd4f038b85135bbe49ec2b57f306b2bb17101b17f71f000fcab2b6fb01ffffffff0002000000000000000000000000000000000000000000000000000000000000000000004847304402205f7530653eea9b38699e476320ab135b74771e1c48b81a5d041e2ca84b9be7a802200ac8d1f40fb026674fe5a5edd3dea715c27baa9baca51ed45ea750ac9dc0a55e81ffffffff010100000000000000015100000000", "P2SH"],
+
+["Same as above, but we change the sequence number of the first input to check that SIGHASH_ANYONECANPAY is being followed"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "0x21 0x035e7f0d4d0841bcd56c39337ed086b1a633ee770c1ffdd94ac552a95ac2ce0efc CHECKSIG"],
+  ["0000000000000000000000000000000000000000000000000000000000000200", 0, "0x21 0x035e7f0d4d0841bcd56c39337ed086b1a633ee770c1ffdd94ac552a95ac2ce0efc CHECKSIG"]],
+ "01000000020001000000000000000000000000000000000000000000000000000000000000000000004948304502203a0f5f0e1f2bdbcd04db3061d18f3af70e07f4f467cbc1b8116f267025f5360b022100c792b6e215afc5afc721a351ec413e714305cb749aae3d7fee76621313418df101010000000002000000000000000000000000000000000000000000000000000000000000000000004847304402205f7530653eea9b38699e476320ab135b74771e1c48b81a5d041e2ca84b9be7a802200ac8d1f40fb026674fe5a5edd3dea715c27baa9baca51ed45ea750ac9dc0a55e81ffffffff010100000000000000015100000000", "P2SH"],
+
+["afd9c17f8913577ec3509520bd6e5d63e9c0fd2a5f70c787993b097ba6ca9fae which has several SIGHASH_SINGLE signatures"],
+[[["63cfa5a09dc540bf63e53713b82d9ea3692ca97cd608c384f2aa88e51a0aac70", 0, "DUP HASH160 0x14 0xdcf72c4fd02f5a987cf9b02f2fabfcac3341a87d EQUALVERIFY CHECKSIG"],
+ ["04e8d0fcf3846c6734477b98f0f3d4badfb78f020ee097a0be5fe347645b817d", 1, "DUP HASH160 0x14 0xdcf72c4fd02f5a987cf9b02f2fabfcac3341a87d EQUALVERIFY CHECKSIG"],
+ ["ee1377aff5d0579909e11782e1d2f5f7b84d26537be7f5516dd4e43373091f3f", 1, "DUP HASH160 0x14 0xdcf72c4fd02f5a987cf9b02f2fabfcac3341a87d EQUALVERIFY CHECKSIG"]],
+ "010000000370ac0a1ae588aaf284c308d67ca92c69a39e2db81337e563bf40c59da0a5cf63000000006a4730440220360d20baff382059040ba9be98947fd678fb08aab2bb0c172efa996fd8ece9b702201b4fb0de67f015c90e7ac8a193aeab486a1f587e0f54d0fb9552ef7f5ce6caec032103579ca2e6d107522f012cd00b52b9a65fb46f0c57b9b8b6e377c48f526a44741affffffff7d815b6447e35fbea097e00e028fb7dfbad4f3f0987b4734676c84f3fcd0e804010000006b483045022100c714310be1e3a9ff1c5f7cacc65c2d8e781fc3a88ceb063c6153bf950650802102200b2d0979c76e12bb480da635f192cc8dc6f905380dd4ac1ff35a4f68f462fffd032103579ca2e6d107522f012cd00b52b9a65fb46f0c57b9b8b6e377c48f526a44741affffffff3f1f097333e4d46d51f5e77b53264db8f7f5d2e18217e1099957d0f5af7713ee010000006c493046022100b663499ef73273a3788dea342717c2640ac43c5a1cf862c9e09b206fcb3f6bb8022100b09972e75972d9148f2bdd462e5cb69b57c1214b88fc55ca638676c07cfc10d8032103579ca2e6d107522f012cd00b52b9a65fb46f0c57b9b8b6e377c48f526a44741affffffff0380841e00000000001976a914bfb282c70c4191f45b5a6665cad1682f2c9cfdfb88ac80841e00000000001976a9149857cc07bed33a5cf12b9c5e0500b675d500c81188ace0fd1c00000000001976a91443c52850606c872403c0601e69fa34b26f62db4a88ac00000000", "P2SH"],
+
+ ["ddc454a1c0c35c188c98976b17670f69e586d9c0f3593ea879928332f0a069e7, which spends an input that pushes using a PUSHDATA1 that is negative when read as signed"],
+ [[["c5510a5dd97a25f43175af1fe649b707b1df8e1a41489bac33a23087027a2f48", 0, "0x4c 0xae 0x606563686f2022553246736447566b58312b5a536e587574356542793066794778625456415675534a6c376a6a334878416945325364667657734f53474f36633338584d7439435c6e543249584967306a486956304f376e775236644546673d3d22203e20743b206f70656e73736c20656e63202d7061737320706173733a5b314a564d7751432d707269766b65792d6865785d202d64202d6165732d3235362d636263202d61202d696e207460 DROP DUP HASH160 0x14 0xbfd7436b6265aa9de506f8a994f881ff08cc2872 EQUALVERIFY CHECKSIG"]],
+ "0100000001482f7a028730a233ac9b48411a8edfb107b749e61faf7531f4257ad95d0a51c5000000008b483045022100bf0bbae9bde51ad2b222e87fbf67530fbafc25c903519a1e5dcc52a32ff5844e022028c4d9ad49b006dd59974372a54291d5764be541574bb0c4dc208ec51f80b7190141049dd4aad62741dc27d5f267f7b70682eee22e7e9c1923b9c0957bdae0b96374569b460eb8d5b40d972e8c7c0ad441de3d94c4a29864b212d56050acb980b72b2bffffffff0180969800000000001976a914e336d0017a9d28de99d16472f6ca6d5a3a8ebc9988ac00000000", "P2SH"],
+
+["Correct signature order"],
+["Note the input is just required to make the tester happy"],
+[[["b3da01dd4aae683c7aee4d5d8b52a540a508e1115f77cd7fa9a291243f501223", 0, "HASH160 0x14 0xb1ce99298d5f07364b57b1e5c9cc00be0b04a954 EQUAL"]],
+"01000000012312503f2491a2a97fcd775f11e108a540a5528b5d4dee7a3c68ae4add01dab300000000fdfe0000483045022100f6649b0eddfdfd4ad55426663385090d51ee86c3481bdc6b0c18ea6c0ece2c0b0220561c315b07cffa6f7dd9df96dbae9200c2dee09bf93cc35ca05e6cdf613340aa0148304502207aacee820e08b0b174e248abd8d7a34ed63b5da3abedb99934df9fddd65c05c4022100dfe87896ab5ee3df476c2655f9fbe5bd089dccbef3e4ea05b5d121169fe7f5f4014c695221031d11db38972b712a9fe1fc023577c7ae3ddb4a3004187d41c45121eecfdbb5b7210207ec36911b6ad2382860d32989c7b8728e9489d7bbc94a6b5509ef0029be128821024ea9fac06f666a4adc3fc1357b7bec1fd0bdece2b9d08579226a8ebde53058e453aeffffffff0180380100000000001976a914c9b99cddf847d10685a4fabaa0baf505f7c3dfab88ac00000000", "P2SH"],
+
+["cc60b1f899ec0a69b7c3f25ddf32c4524096a9c5b01cbd84c6d0312a0c478984, which is a fairly strange transaction which relies on OP_CHECKSIG returning 0 when checking a completely invalid sig of length 0"],
+[[["cbebc4da731e8995fe97f6fadcd731b36ad40e5ecb31e38e904f6e5982fa09f7", 0, "0x2102085c6600657566acc2d6382a47bc3f324008d2aa10940dd7705a48aa2a5a5e33ac7c2103f5d0fb955f95dd6be6115ce85661db412ec6a08abcbfce7da0ba8297c6cc0ec4ac7c5379a820d68df9e32a147cffa36193c6f7c43a1c8c69cda530e1c6db354bfabdcfefaf3c875379a820f531f3041d3136701ea09067c53e7159c8f9b2746a56c3d82966c54bbc553226879a5479827701200122a59a5379827701200122a59a6353798277537982778779679a68"]],
+"0100000001f709fa82596e4f908ee331cb5e0ed46ab331d7dcfaf697fe95891e73dac4ebcb000000008c20ca42095840735e89283fec298e62ac2ddea9b5f34a8cbb7097ad965b87568100201b1b01dc829177da4a14551d2fc96a9db00c6501edfa12f22cd9cefd335c227f483045022100a9df60536df5733dd0de6bc921fab0b3eee6426501b43a228afa2c90072eb5ca02201c78b74266fac7d1db5deff080d8a403743203f109fbcabf6d5a760bf87386d20100ffffffff01c075790000000000232103611f9a45c18f28f06f19076ad571c344c82ce8fcfe34464cf8085217a2d294a6ac00000000", "P2SH"],
+
+["Empty pubkey"],
+[[["229257c295e7f555421c1bfec8538dd30a4b5c37c1c8810bbe83cafa7811652c", 0, "0x00 CHECKSIG NOT"]],
+"01000000012c651178faca83be0b81c8c1375c4b0ad38d53c8fe1b1c4255f5e795c25792220000000049483045022100d6044562284ac76c985018fc4a90127847708c9edb280996c507b28babdc4b2a02203d74eca3f1a4d1eea7ff77b528fde6d5dc324ec2dbfdb964ba885f643b9704cd01ffffffff010100000000000000232102c2410f8891ae918cab4ffc4bb4a3b0881be67c7a1e7faa8b5acf9ab8932ec30cac00000000", "P2SH"],
+
+["Empty signature"],
+[[["9ca93cfd8e3806b9d9e2ba1cf64e3cc6946ee0119670b1796a09928d14ea25f7", 0, "0x21 0x028a1d66975dbdf97897e3a4aef450ebeb5b5293e4a0b4a6d3a2daaa0b2b110e02 CHECKSIG NOT"]],
+"0100000001f725ea148d92096a79b1709611e06e94c63c4ef61cbae2d9b906388efd3ca99c000000000100ffffffff0101000000000000002321028a1d66975dbdf97897e3a4aef450ebeb5b5293e4a0b4a6d3a2daaa0b2b110e02ac00000000", "P2SH"],
+
+[[["444e00ed7840d41f20ecd9c11d3f91982326c731a02f3c05748414a4fa9e59be", 0, "1 0x00 0x21 0x02136b04758b0b6e363e7a6fbe83aaf527a153db2b060d36cc29f7f8309ba6e458 2 CHECKMULTISIG"]],
+"0100000001be599efaa4148474053c2fa031c7262398913f1dc1d9ec201fd44078ed004e44000000004900473044022022b29706cb2ed9ef0cb3c97b72677ca2dfd7b4160f7b4beb3ba806aa856c401502202d1e52582412eba2ed474f1f437a427640306fd3838725fab173ade7fe4eae4a01ffffffff010100000000000000232103ac4bba7e7ca3e873eea49e08132ad30c7f03640b6539e9b59903cf14fd016bbbac00000000", "P2SH"],
+
+[[["e16abbe80bf30c080f63830c8dbf669deaef08957446e95940227d8c5e6db612", 0, "1 0x21 0x03905380c7013e36e6e19d305311c1b81fce6581f5ee1c86ef0627c68c9362fc9f 0x00 2 CHECKMULTISIG"]],
+"010000000112b66d5e8c7d224059e946749508efea9d66bf8d0c83630f080cf30be8bb6ae100000000490047304402206ffe3f14caf38ad5c1544428e99da76ffa5455675ec8d9780fac215ca17953520220779502985e194d84baa36b9bd40a0dbd981163fa191eb884ae83fc5bd1c86b1101ffffffff010100000000000000232103905380c7013e36e6e19d305311c1b81fce6581f5ee1c86ef0627c68c9362fc9fac00000000", "P2SH"],
+
+[[["ebbcf4bfce13292bd791d6a65a2a858d59adbf737e387e40370d4e64cc70efb0", 0, "2 0x21 0x033bcaa0a602f0d44cc9d5637c6e515b0471db514c020883830b7cefd73af04194 0x21 0x03a88b326f8767f4f192ce252afe33c94d25ab1d24f27f159b3cb3aa691ffe1423 2 CHECKMULTISIG NOT"]],
+"0100000001b0ef70cc644e0d37407e387e73bfad598d852a5aa6d691d72b2913cebff4bceb000000004a00473044022068cd4851fc7f9a892ab910df7a24e616f293bcb5c5fbdfbc304a194b26b60fba022078e6da13d8cb881a22939b952c24f88b97afd06b4c47a47d7f804c9a352a6d6d0100ffffffff0101000000000000002321033bcaa0a602f0d44cc9d5637c6e515b0471db514c020883830b7cefd73af04194ac00000000", "P2SH"],
+
+[[["ba4cd7ae2ad4d4d13ebfc8ab1d93a63e4a6563f25089a18bf0fc68f282aa88c1", 0, "2 0x21 0x037c615d761e71d38903609bf4f46847266edc2fb37532047d747ba47eaae5ffe1 0x21 0x02edc823cd634f2c4033d94f5755207cb6b60c4b1f1f056ad7471c47de5f2e4d50 2 CHECKMULTISIG NOT"]],
+"0100000001c188aa82f268fcf08ba18950f263654a3ea6931dabc8bf3ed1d4d42aaed74cba000000004b0000483045022100940378576e069aca261a6b26fb38344e4497ca6751bb10905c76bb689f4222b002204833806b014c26fd801727b792b1260003c55710f87c5adbd7a9cb57446dbc9801ffffffff0101000000000000002321037c615d761e71d38903609bf4f46847266edc2fb37532047d747ba47eaae5ffe1ac00000000", "P2SH"],
+
+
+
+["CHECKLOCKTIMEVERIFY tests"],
+
+["By-height locks, with argument == 0 and == tx nLockTime"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "0 NOP2 1"]],
+"010000000100010000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000", "P2SH,CHECKLOCKTIMEVERIFY"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "499999999 NOP2 1"]],
+"0100000001000100000000000000000000000000000000000000000000000000000000000000000000000000000001000000000000000000ff64cd1d", "P2SH,CHECKLOCKTIMEVERIFY"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "0 NOP2 1"]],
+"0100000001000100000000000000000000000000000000000000000000000000000000000000000000000000000001000000000000000000ff64cd1d", "P2SH,CHECKLOCKTIMEVERIFY"],
+
+["By-time locks, with argument just beyond tx nLockTime (but within numerical boundaries)"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "500000000 NOP2 1"]],
+"01000000010001000000000000000000000000000000000000000000000000000000000000000000000000000000010000000000000000000065cd1d", "P2SH,CHECKLOCKTIMEVERIFY"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "4294967295 NOP2 1"]],
+"0100000001000100000000000000000000000000000000000000000000000000000000000000000000000000000001000000000000000000ffffffff", "P2SH,CHECKLOCKTIMEVERIFY"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "500000000 NOP2 1"]],
+"0100000001000100000000000000000000000000000000000000000000000000000000000000000000000000000001000000000000000000ffffffff", "P2SH,CHECKLOCKTIMEVERIFY"],
+
+["Any non-maxint nSequence is fine"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "0 NOP2 1"]],
+"010000000100010000000000000000000000000000000000000000000000000000000000000000000000feffffff0100000000000000000000000000", "P2SH,CHECKLOCKTIMEVERIFY"],
+
+["The argument can be calculated rather than created directly by a PUSHDATA"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "499999999 1ADD NOP2 1"]],
+"01000000010001000000000000000000000000000000000000000000000000000000000000000000000000000000010000000000000000000065cd1d", "P2SH,CHECKLOCKTIMEVERIFY"],
+
+["Perhaps even by an ADD producing a 5-byte result that is out of bounds for other opcodes"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "2147483647 2147483647 ADD NOP2 1"]],
+"0100000001000100000000000000000000000000000000000000000000000000000000000000000000000000000001000000000000000000feffffff", "P2SH,CHECKLOCKTIMEVERIFY"],
+
+["5 byte non-minimally-encoded arguments are valid"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "0x05 0x0000000000 NOP2 1"]],
+"010000000100010000000000000000000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000", "P2SH,CHECKLOCKTIMEVERIFY"],
+
+["Valid CHECKLOCKTIMEVERIFY in scriptSig"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "1"]],
+"01000000010001000000000000000000000000000000000000000000000000000000000000000000000251b1000000000100000000000000000001000000", "P2SH,CHECKLOCKTIMEVERIFY"],
+
+["Valid CHECKLOCKTIMEVERIFY in redeemScript"],
+[[["0000000000000000000000000000000000000000000000000000000000000100", 0, "HASH160 0x14 0xc5b93064159b3b2d6ab506a41b1f50463771b988 EQUAL"]],
+"0100000001000100000000000000000000000000000000000000000000000000000000000000000000030251b1000000000100000000000000000001000000", "P2SH,CHECKLOCKTIMEVERIFY"],
+
+["Make diffs cleaner by leaving a comment here without comma at the end"]
+]
diff --git a/depend/zcash/src/test/data/txcreate1.hex b/depend/zcash/src/test/data/txcreate1.hex
new file mode 100644
index 000000000..e2981a51c
--- /dev/null
+++ b/depend/zcash/src/test/data/txcreate1.hex
@@ -0,0 +1 @@
+01000000031f5c38dfcf6f1a5f5a87c416076d392c87e6d41970d5ad5e477a02d66bde97580000000000ffffffff7cca453133921c50d5025878f7f738d1df891fd359763331935784cf6b9c82bf1200000000fffffffffccd319e04a996c96cfc0bf4c07539aa90bd0b1a700ef72fae535d6504f9a6220100000000ffffffff0280a81201000000001976a9141fc11f39be1729bf973a7ab6a615ca4729d6457488ac0084d717000000001976a914f2d4db28cad6502226ee484ae24505c2885cb12d88ac00000000
diff --git a/depend/zcash/src/test/data/txcreate1.json b/depend/zcash/src/test/data/txcreate1.json
new file mode 100644
index 000000000..31266cb5e
--- /dev/null
+++ b/depend/zcash/src/test/data/txcreate1.json
@@ -0,0 +1,63 @@
+{
+    "txid": "f70f0d6c71416ed538e37549f430ab3665fee2437a42f10238c1bd490e782231",
+    "version": 1,
+    "locktime": 0,
+    "vin": [
+        {
+            "txid": "5897de6bd6027a475eadd57019d4e6872c396d0716c4875a5f1a6fcfdf385c1f",
+            "vout": 0,
+            "scriptSig": {
+                "asm": "",
+                "hex": ""
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "bf829c6bcf84579331337659d31f89dfd138f7f7785802d5501c92333145ca7c",
+            "vout": 18,
+            "scriptSig": {
+                "asm": "",
+                "hex": ""
+            },
+            "sequence": 4294967295
+        },
+        {
+            "txid": "22a6f904655d53ae2ff70e701a0bbd90aa3975c0f40bfc6cc996a9049e31cdfc",
+            "vout": 1,
+            "scriptSig": {
+                "asm": "",
+                "hex": ""
+            },
+            "sequence": 4294967295
+        }
+    ],
+    "vout": [
+        {
+            "value": 0.18,
+            "n": 0,
+            "scriptPubKey": {
+                "asm": "OP_DUP OP_HASH160 1fc11f39be1729bf973a7ab6a615ca4729d64574 OP_EQUALVERIFY OP_CHECKSIG",
+                "hex": "76a9141fc11f39be1729bf973a7ab6a615ca4729d6457488ac",
+                "reqSigs": 1,
+                "type": "pubkeyhash",
+                "addresses": [
+                    "t1LmWJddYzkTmTQjZrX7ZkFjmuEu5XKpGKb"
+                ]
+            }
+        },
+        {
+            "value": 4.00,
+            "n": 1,
+            "scriptPubKey": {
+                "asm": "OP_DUP OP_HASH160 f2d4db28cad6502226ee484ae24505c2885cb12d OP_EQUALVERIFY OP_CHECKSIG",
+                "hex": "76a914f2d4db28cad6502226ee484ae24505c2885cb12d88ac",
+                "reqSigs": 1,
+                "type": "pubkeyhash",
+                "addresses": [
+                    "t1g1aXFye74HKJ24VviTxo3AW4BZbyCni5H"
+                ]
+            }
+        }
+    ],
+    "hex": "01000000031f5c38dfcf6f1a5f5a87c416076d392c87e6d41970d5ad5e477a02d66bde97580000000000ffffffff7cca453133921c50d5025878f7f738d1df891fd359763331935784cf6b9c82bf1200000000fffffffffccd319e04a996c96cfc0bf4c07539aa90bd0b1a700ef72fae535d6504f9a6220100000000ffffffff0280a81201000000001976a9141fc11f39be1729bf973a7ab6a615ca4729d6457488ac0084d717000000001976a914f2d4db28cad6502226ee484ae24505c2885cb12d88ac00000000"
+}
diff --git a/depend/zcash/src/test/data/txcreate2.hex b/depend/zcash/src/test/data/txcreate2.hex
new file mode 100644
index 000000000..5243c2d02
--- /dev/null
+++ b/depend/zcash/src/test/data/txcreate2.hex
@@ -0,0 +1 @@
+01000000000100000000000000000000000000
diff --git a/depend/zcash/src/test/data/txcreate2.json b/depend/zcash/src/test/data/txcreate2.json
new file mode 100644
index 000000000..c56293eaf
--- /dev/null
+++ b/depend/zcash/src/test/data/txcreate2.json
@@ -0,0 +1,19 @@
+{
+    "txid": "cf90229625e9eb10f6be8156bf6aa5ec2eca19a42b1e05c11f3029b560a32e13",
+    "version": 1,
+    "locktime": 0,
+    "vin": [
+    ],
+    "vout": [
+        {
+            "value": 0.00,
+            "n": 0,
+            "scriptPubKey": {
+                "asm": "",
+                "hex": "",
+                "type": "nonstandard"
+            }
+        }
+    ],
+    "hex": "01000000000100000000000000000000000000"
+}
diff --git a/depend/zcash/src/test/data/txcreatedata_seq0.hex b/depend/zcash/src/test/data/txcreatedata_seq0.hex
new file mode 100644
index 000000000..db02b5e4a
--- /dev/null
+++ b/depend/zcash/src/test/data/txcreatedata_seq0.hex
@@ -0,0 +1 @@
+01000000011f5c38dfcf6f1a5f5a87c416076d392c87e6d41970d5ad5e477a02d66bde97580000000000fdffffff0180a81201000000001976a9141fc11f39be1729bf973a7ab6a615ca4729d6457488ac00000000
diff --git a/depend/zcash/src/test/data/txcreatedata_seq0.json b/depend/zcash/src/test/data/txcreatedata_seq0.json
new file mode 100644
index 000000000..be13f56ea
--- /dev/null
+++ b/depend/zcash/src/test/data/txcreatedata_seq0.json
@@ -0,0 +1,32 @@
+{
+    "txid": "71603ccb1cd76d73d76eb6cfd5f0b9df6d65d90d76860ee52cb461c4be7032e8",
+    "version": 1,
+    "locktime": 0,
+    "vin": [
+        {
+            "txid": "5897de6bd6027a475eadd57019d4e6872c396d0716c4875a5f1a6fcfdf385c1f",
+            "vout": 0,
+            "scriptSig": {
+                "asm": "",
+                "hex": ""
+            },
+            "sequence": 4294967293
+        }
+    ],
+    "vout": [
+        {
+            "value": 0.18,
+            "n": 0,
+            "scriptPubKey": {
+                "asm": "OP_DUP OP_HASH160 1fc11f39be1729bf973a7ab6a615ca4729d64574 OP_EQUALVERIFY OP_CHECKSIG",
+                "hex": "76a9141fc11f39be1729bf973a7ab6a615ca4729d6457488ac",
+                "reqSigs": 1,
+                "type": "pubkeyhash",
+                "addresses": [
+                    "t1LmWJddYzkTmTQjZrX7ZkFjmuEu5XKpGKb"
+                ]
+            }
+        }
+    ],
+    "hex": "01000000011f5c38dfcf6f1a5f5a87c416076d392c87e6d41970d5ad5e477a02d66bde97580000000000fdffffff0180a81201000000001976a9141fc11f39be1729bf973a7ab6a615ca4729d6457488ac00000000"
+}
diff --git a/depend/zcash/src/test/data/txcreatedata_seq1.hex b/depend/zcash/src/test/data/txcreatedata_seq1.hex
new file mode 100644
index 000000000..4cedcd975
--- /dev/null
+++ b/depend/zcash/src/test/data/txcreatedata_seq1.hex
@@ -0,0 +1 @@
+01000000021f5c38dfcf6f1a5f5a87c416076d392c87e6d41970d5ad5e477a02d66bde97580000000000fdffffff1f5c38dfcf6f1a5f5a87c416076d392c87e6d41970d5ad5e477a02d66bde97580000000000010000000180a81201000000001976a9141fc11f39be1729bf973a7ab6a615ca4729d6457488ac00000000
diff --git a/depend/zcash/src/test/data/txcreatedata_seq1.json b/depend/zcash/src/test/data/txcreatedata_seq1.json
new file mode 100644
index 000000000..915762373
--- /dev/null
+++ b/depend/zcash/src/test/data/txcreatedata_seq1.json
@@ -0,0 +1,41 @@
+{
+    "txid": "c4dea671b0d7b48f8ab10bc46650e8329d3c5766931f548f513847a19f5ba75b",
+    "version": 1,
+    "locktime": 0,
+    "vin": [
+        {
+            "txid": "5897de6bd6027a475eadd57019d4e6872c396d0716c4875a5f1a6fcfdf385c1f",
+            "vout": 0,
+            "scriptSig": {
+                "asm": "",
+                "hex": ""
+            },
+            "sequence": 4294967293
+        },
+        {
+            "txid": "5897de6bd6027a475eadd57019d4e6872c396d0716c4875a5f1a6fcfdf385c1f",
+            "vout": 0,
+            "scriptSig": {
+                "asm": "",
+                "hex": ""
+            },
+            "sequence": 1
+        }
+    ],
+    "vout": [
+        {
+            "value": 0.18,
+            "n": 0,
+            "scriptPubKey": {
+                "asm": "OP_DUP OP_HASH160 1fc11f39be1729bf973a7ab6a615ca4729d64574 OP_EQUALVERIFY OP_CHECKSIG",
+                "hex": "76a9141fc11f39be1729bf973a7ab6a615ca4729d6457488ac",
+                "reqSigs": 1,
+                "type": "pubkeyhash",
+                "addresses": [
+                    "t1LmWJddYzkTmTQjZrX7ZkFjmuEu5XKpGKb"
+                ]
+            }
+        }
+    ],
+    "hex": "01000000021f5c38dfcf6f1a5f5a87c416076d392c87e6d41970d5ad5e477a02d66bde97580000000000fdffffff1f5c38dfcf6f1a5f5a87c416076d392c87e6d41970d5ad5e477a02d66bde97580000000000010000000180a81201000000001976a9141fc11f39be1729bf973a7ab6a615ca4729d6457488ac00000000"
+}
diff --git a/depend/zcash/src/test/data/txcreatesign.hex b/depend/zcash/src/test/data/txcreatesign.hex
new file mode 100644
index 000000000..a46fcc88c
--- /dev/null
+++ b/depend/zcash/src/test/data/txcreatesign.hex
@@ -0,0 +1 @@
+01000000018594c5bdcaec8f06b78b596f31cd292a294fd031e24eec716f43dac91ea7494d000000008b48304502210096a75056c9e2cc62b7214777b3d2a592cfda7092520126d4ebfcd6d590c99bd8022051bb746359cf98c0603f3004477eac68701132380db8facba19c89dc5ab5c5e201410479be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8ffffffff01a0860100000000001976a9145834479edbbe0539b31ffd3a8f8ebadc2165ed0188ac00000000
diff --git a/depend/zcash/src/test/data/txcreatesign.json b/depend/zcash/src/test/data/txcreatesign.json
new file mode 100644
index 000000000..71a0528b7
--- /dev/null
+++ b/depend/zcash/src/test/data/txcreatesign.json
@@ -0,0 +1,32 @@
+{
+    "txid": "977e7cd286cb72cd470d539ba6cb48400f8f387d97451d45cdb8819437a303af",
+    "version": 1,
+    "locktime": 0,
+    "vin": [
+        {
+            "txid": "4d49a71ec9da436f71ec4ee231d04f292a29cd316f598bb7068feccabdc59485",
+            "vout": 0,
+            "scriptSig": {
+                "asm": "304502210096a75056c9e2cc62b7214777b3d2a592cfda7092520126d4ebfcd6d590c99bd8022051bb746359cf98c0603f3004477eac68701132380db8facba19c89dc5ab5c5e2[ALL] 0479be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8",
+                "hex": "48304502210096a75056c9e2cc62b7214777b3d2a592cfda7092520126d4ebfcd6d590c99bd8022051bb746359cf98c0603f3004477eac68701132380db8facba19c89dc5ab5c5e201410479be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8"
+            },
+            "sequence": 4294967295
+        }
+    ],
+    "vout": [
+        {
+            "value": 0.001,
+            "n": 0,
+            "scriptPubKey": {
+                "asm": "OP_DUP OP_HASH160 5834479edbbe0539b31ffd3a8f8ebadc2165ed01 OP_EQUALVERIFY OP_CHECKSIG",
+                "hex": "76a9145834479edbbe0539b31ffd3a8f8ebadc2165ed0188ac",
+                "reqSigs": 1,
+                "type": "pubkeyhash",
+                "addresses": [
+                    "t1Ruz6gK4QPZoPPGpHaieupnnh62mktjQE7"
+                ]
+            }
+        }
+    ],
+    "hex": "01000000018594c5bdcaec8f06b78b596f31cd292a294fd031e24eec716f43dac91ea7494d000000008b48304502210096a75056c9e2cc62b7214777b3d2a592cfda7092520126d4ebfcd6d590c99bd8022051bb746359cf98c0603f3004477eac68701132380db8facba19c89dc5ab5c5e201410479be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8ffffffff01a0860100000000001976a9145834479edbbe0539b31ffd3a8f8ebadc2165ed0188ac00000000"
+}
diff --git a/depend/zcash/src/test/data/unified_addrs.json b/depend/zcash/src/test/data/unified_addrs.json
new file mode 100644
index 000000000..57be6b4dc
--- /dev/null
+++ b/depend/zcash/src/test/data/unified_addrs.json
@@ -0,0 +1,24 @@
+[
+    ["From https://github.com/zcash-hackworks/zcash-test-vectors/blob/master/unified_address.py"],
+    ["p2pkh_bytes, p2sh_bytes, sapling_raw_addr, orchard_raw_addr, unknown_typecode, unknown_bytes, unified_addr, root_seed, account, diversifier_index"],
+    ["e6cabf813929132d772d04b03ae85223d03b9be8", null, null, "d4714ee761d1ae823b6972152e20957fefa3f6e3129ea4dfb0a9e98703a63dab929589d6dc51c970f935b3", 65533, "f6ee6921481cdd86b3cc4318d9614fc820905d042bb1ef9ca3f24988c7b3534201cfb1cd8dbf69b8250c18ef41294ca97993db546c1fe0", "7531353966636630777639336c366464666d396c726434736a6177373272646a716b657779736367377038667166307563366b766479386b796a7133667263756376356e6a66767065756a676c71327433667a6763706e77613336356d6e616139346e78706634337373633575707433717970773363747235717930356d6c6b33376565777532396a37686b64", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 0, 0],
+    ["7bec9de217c04f7ce1a86f1fb458aa881c8f39e4", null, null, "d8e5ecb4e005c28718e61a5c336a4f369e771ccdb3363f4f7a04b02a966901a4c05da662d5fd75678f7fb4", 65530, null, "75317a35677538783364766b7677636d726a30716b3568727839706361646c3536683834663777647970366e7635337233643563636365646563686d77393835746765357733633272353639716137326c676775753578727178683739616a7a63376b716d65733230706b747a71726a6c707835367168676d716d3536686e39777432686379787064616d616b", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 1, 0],
+    ["aa6d43480fd9d91375ce6c4a020706361bd296de", null, "88533c398a49c2513dc85162bf220abaf47dc983f14e908ddaaa7322dba16531bc62efe750fe575c8d149b", null, 65530, null, "7531343367706a3772643934766d39356d7a73757537746a74716161677934706d6678386c6b77656d70786a7463777a33357a746361383530796e6c7a323932307477617a6171703270367168787878337a357178616b6e73716372676c7578716a337070757367776635757963686c61677938376b376874613768773965793336776d7930367065776c6470", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 2, 0],
+    [null, "a8d7551db5fd9313e8c7203d996af7d477083756", "52fd6aedefbf401633c2e4532515ebcf95bcc2b4b8e4d676dfad7e17925c6dfb8671e52544dc2ca075e261", null, 65534, null, "753178797970646a307a7978637466666b6878796d766a6e6b376e383371666c376e7365356c3071726b346e3266376465376c3733727a79787970347463727975356d6b7875617a6c646e633279306479747a7567797a79636739373034616a66786173376b63757761776d706877776e383839743938743735376579716667346a766566746b687672337167", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 3, 0],
+    [null, "f44ab023752cb5b406ed8985e18130ab33362697", null, "165082de84f2ad7204426ffafd6b6c7de9cab6d25c13846a1786715268c415948db788f4a5e0daa03d699e", 65533, null, "7531706a336c72656d6e7175737368393878667161336a66647077303872726b35377330346b6c32366865707a7133746a72736e78653574367371716567653976716d776c63366c786373746e6333306e3575357232776b6b7a687039367a3564306a797530716137746b686378366663386a35396b616b387a35636570363261716d61336d36343566683863", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 4, 0],
+    [null, null, null, "ea9df83fbee07d6f7895ebb2ea41ec7c4ba682b863e069b4a438e31c9571c83126c305d75456412aeaef1b", 65531, null, "753132787567643930666c726b646b6575336e6c6e6e337565736b793533707175356d323479366170786d38386d34387637333734636c7335367a7039336e61796c617864636866307161796678747267653034376d393533717a3376326772346c74737232736b3372", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 5, 0],
+    [null, null, null, "3c40246912b6efefab9a55244ac2c174e1a9f8c0bc0fd526933963c6ecb9b84ec8b0f6b40dc858fa23c72b", 65530, null, "75317370757467353667736a763233637435346d7277646c616e7a7665716337747a73356d78786e616135636465676d303368673778363661797079647336356d39327674397561786c3637327375687063367a3768747776657079686b727066757376617a71756539", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 6, 0],
+    [null, "defa3d5a57efc2e1e9b01a035587d5fb1a38e01d", null, "cc099cc214e56b1192c7b5b17e958c3413e27fefd553380700aca81b24b2918cac951a1a68017fac525a18", 65535, null, "75317667736b636d3939783567687561757668337978713777747037756e366130793663617964736e6e33357032647577707773356873367079676a6877703738326a716e65727a6c6878773370343971666d713237383339716a7472667976686b377964393877396e3064366a6e7336756834666333687364663736366b6e74716e6c6a646b64353667636e", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 7, 0],
+    [null, null, null, "5f09a9807a56323b263b05df368dc28391b21a64a0e1b40f9a6803b7e68f3905923f35cb01f119b223f493", 65530, null, "75316378636379656d6d3038747964776d743968703273356e6638776a766c757575366c32653861396a666c6c647861736e7a6b6438667665727170636a30786e767261637a71673235356377356e767936783977727566666d703975657a727a72376763783535396b", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 8, 0],
+    [null, "10acd20b183e31d49f25c9a138f49b1a537edcf0", "9b60ae3d302248b349d601567e3d7795bfb334ea1fd1a7e71402169ebbe14bd2ceaa244ccd6e5aa2245613", "e340636542ece1c81285ed4eab448adbb5a8c0f4d386eeff337e88e6915f6c3ec1b6ea835a88d56612d2bd", 65531, null, "75317a656b68686d686b353478356365356333367274376e63323735676570376e6176326e73783473683061666c6c75703976726835687338367a38736b6a746436646e736c7667736d6174743068386832343763676e666b73646c776c39786d617275797570666c743064716673637830647979656d3266616139776571653378616b397736656672353437636a3832397232746e7974613032687866647873646a6d76397a72356b746b70323066706378656164686672683032616b346136686e7876357336377267717272766670646a7435", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 9, 0],
+    [null, "af9db6990ed83dd64af3597c04323ea51b0052ad", null, "cdf7fed0d0822fd849cffb20a4d5ee701ad8141e66d81ddfabf87875117c05092240603c546b8dc187cd8c", 65532, null, "753165353471636e30746570796c33307a7a326672677a37713461366d736e326530326e7076326e6666736433683532336d747838643232616a7666767371757235736a7a3876666e6d77327973363730387170386b6139306a3561343330757938763833616c6a63306330357a6a7535347879356e7677336d66686b376e7737366b6b7964796c713466656c", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 10, 0],
+    [null, null, null, "24fd59f32b2d39dde66e46c39206a31bc04fa5c6847976ea6bbd3163ee14f58f584acc131479ea558d3f84", 65530, null, "75317a38777372686d66366d3967766136766c33737a636b303670393730783577686d36336a666a3266726d6d63396e39756d34796373387975746a37673833387672676832306c667879353279306832367474386e6776643267796370797176396b793032716b6373", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 11, 0],
+    [null, null, "78d85bd0db639043377987cdd814c6390016964b684016faf1ad4f166c5f72399a5e8d469ec6beb873d55d", null, 65535, null, "75317861686a333570376d7639756c6b3337327333766465687172663438753077646633786c3772787a7270653461307468753864306d396d7961617078376b35767836747a357074636a76637675346472667137753771777a6d667565336b74387376736333736535", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 12, 0],
+    ["33a6dd87b4d872a4895d345761e4ec423b77928d", null, null, "5178924f7067eac261044ca27ba3cf52f798486973af0795e61587aa1b1ecad333dc520497edc61df88980", 65533, "91e00c7a1d48af046827591e9733a97fa6b679f3dc601d008285edcbdae69ce8fc1be4aac00ff2711ebd931de518856878f73476f21a482ec9378365c8f7393c94e2885315eb4671098b79535e790fe53e29fef2b3766697ac32b4f473f468a008e72389fc03880d780cb07fcfaabe3f1a84b27db59a4a153d882d2b2103596555ed9494c6ac893c49723833ec8926c1", "75316439356e6a7630783035643671747a703779757976667765647438796734746a306e663063727038656a74666430653866637a3271617939346b3463667877376666363070636c747076776c3378326b646c646a65617335336e686e613567393578326c7533763370723233657430643063726e7a63396e636477636d7233766a306b6c73653474793538", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 13, 0],
+    ["a56c057ef71dab58aa90e47025695c5faaea5123", null, "a75a6de421d2ad1ee8f4b25e398adda9c0aaa6ab1f2518981a9ddb1de6a3957d77842332d6289dbe94e832", "b208c9235c8d40e49b76100b2d010f3783f12c66e7d3beb117b2c96321b7f6562adb4efc144e39d909e728", 65533, null, "7531646670723876647335683361756e79657a7a7877726d38756461353273743837733876726c676732746730357430713070783336686368783974676b786b6c77747370753332786a6135617271336b7470326e387a613470773779776a30676d68713372776539353072386b3973756e736a76773734743538716c3333347065673464766b616c6b746d6e676e716b7077723332353837653779747932376e6d673636747371377976723779343639776570366b7077346a3530786e6c6d78306a78786737766c6735796c6671387566657664", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 14, 0],
+    [null, null, null, "9e5445d6cd3cb9f98b0df1062bda47adffd5a66c0c2c483c8bf15c3176d755914a3576496b5c35fee28a88", 65531, null, "75316a676c686a326d617936646674777a39753271796e786a717a6e75743637343768617375306d646d6c63303266636173756178756764797a776a326c38346d6a3966677a6a3779306b396663706a373336736c6d6a38676b37377567386c6c61766367326c666d6d", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 15, 0],
+    ["b02aec10f6fa02a08667bf9b924c3d0574a1334f", null, null, "2598d84dffb34f5908b90732490f3881399150d4c694fce9bf30d1560b2c56f09829fe123b9add20e5d71c", 65534, null, "7531397163617a647761793438707566366a77616a78307732386d307871756d746d6e6435677974796c6c6e79676867396c76393978356d3872387439673566396a307a30786e34787a6d6e7866747a3772746633756164786b79367178706e6b7438666b66686c78386b63396d6e72646c6e7874733536786378656a7a6472776c65787a7637377876797634", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 16, 0],
+    [null, null, "d3a803803feee7a032a24adfaa8f6a94cecb9671c1333d0d5d1a3d79d82bc310727c665364d71022559c50", "7c98b8f613f9ff02746bea2a167cfd1bd3a1862af9631bf61d9d604e0824e2cb8467a1e549db87a76e7a8a", 65535, null, "75316136346c303971727378756c666a7a6e6d366b326735333575737968746166386564363076346a726a6d6b77766b757834743770647963336e6b7a7265666467746e77383432306c6a3873686d30356a6139667878676e68726139326e6873713536677838633270757a33666b6b676e726b7166357975716664746637743672616e343767646366357676646661637a7766337575793466797368336d7a7538686435746b6c30356d76726765396e38", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 17, 0],
+    ["26c061d67beb8bad48c6b4774a156551e30e4fe2", null, null, "a80405d5568ab8ab8f8546163d951ab297fd5e6f43e7fcebcb664feacfab5afd80aaf7f354c07a9901788c", 65535, null, "7531787a757764386163686667776d336577793976326d6a3537373268726b6e6d6578777a6339346d7a6133356d78363863656e767877727a3973396670306e39767a753872756a357a71666d6d376c65387775366c363275346c6d30376e75717865656d383733677838366a766e776c70787379636c397576366b786b72686d30726c677037307830357366", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 18, 0],
+    [null, null, "8660070e3757ff6507060791fd694f6a631b8495a2b74ffa39236cf653caea5575b86af3200b010e513bab", "63b7b706d991169986aee56133f0a50b2a0c8225fba6dae95176007b1f023a1e97c1aa366e99bf970fda82", 65534, null, "7531766736326d676a64646e6c763577366c646b793278653063387465746d633832747539766c7a7a6b75796e783439666e75716a76786a743564676e33636d3874356e38357a6371356c6a727467377a6d77686b3730683672646d636c6637736378786e67756b35666c76663261707037367875393037636d6a796c787673656e3235786539763776336b727378613975793076326a6a7133376b6834796d6c61666e3870657671616c716134646d3637", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 19, 5]
+]
diff --git a/depend/zcash/src/test/data/unified_full_viewing_keys.json b/depend/zcash/src/test/data/unified_full_viewing_keys.json
new file mode 100644
index 000000000..82bc19689
--- /dev/null
+++ b/depend/zcash/src/test/data/unified_full_viewing_keys.json
@@ -0,0 +1,25 @@
+[
+    ["From https://github.com/zcash-hackworks/zcash-test-vectors/blob/master/unified_full_viewing_keys.py"],
+    ["t_key_bytes, sapling_fvk_bytes, orchard_fvk_bytes, unknown_fvk_typecode, unknown_fvk_bytes, unified_fvk, root_seed, account"],
+    ["9ba0439c6a2d3d903883d4537c362288626da62c6299012e362d8fb6efebab4702ed638532c475f67400350fb1d6eda559cdc289a19b4319eb175140aa86893836", null, "7648764a4567b7165410bc313f922b72fa34153dcad112a3971620240ffbf30d7f19edb9f295cdf160be1863b41c96312daf7273ba01198f5066f28629b56f17e4ab726579eea0fb19ab5ae2b8889ce455c79c5959bfda796823ee805c794814", 65533, "f6ee6921481cdd86b3cc4318d9614fc820905d042bb1ef9ca3f24988c7b3534201cfb1cd8dbf69b8250c18ef41294ca97993db546c1fe0", "757669657731636772716e7279343738636b7670723066353830743666736168703061356d6a326539786c3768763264326a64346c647a793434396d77776b326c3979657574733835776a6c7336686a74676864737935766868766d6a6477336a786c3363786872673376733239366133637a617a7279637272356379776a6877633563337a7466796a64686d7a306578767a7a6579656a616d7970306372397a386639776a30393533667a6874306d346c656e6b3934743730727577676a786167327476703633776e3966747a68746b683230677972653377357332346636776c6771786e6a6834306764326c786537357366337a3868357932783061747078637966397433656d3468306576767366746c757275716e65367734736d303636737730716535793871673432336772706c6535666674787271797937786d716d617476376e7a643774636a6164753866376d717a346c38336a73797879347438706b61797974796b376e7270343637647338356b6e656b646b766e643768716b666572386d6e7164377076", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 0],
+    ["fa9291b353be21ac452f85cb96e4fc978d352e34c5c0259ac28d0beab1b8e29803fc399e613d010865d5a1fa8765b7109f9db1ed56218983f9bd54b8c712478829", null, "b5523cae2a454d3dbcd88b8cebf4c4336db6f906264af982ab4dd4a797dd6f051a139b42cd6e6378ba7c9c7ae0a52dc311fd0a92730e56834c0ab07a99cea50b1160f497b619794819d5f654c57a60ed9e5358fb55aea05bac7133ee381a4324", 65530, null, "757669657731363732323738776472756361637065756a6e7a743274756874646c6a35653665636a6c676c3732756c39727475643479636e6a616374766139636c6e65673271333973766136396b6478356672713066346837706b397934307a6c3370676a666666663964366e306678766a6870736b36367a7835673533333668663871727233713077686d397474356d35386a386773736e796b7473367273796c3065366877756c717237776e367a796a7435376438757330796471683732327863736738766e7230737373637a7264776b376d76356d656865716733723074727933647275776b38637965796b7a79383667756375326a6d747476767a78636574636c6d6b756c7133756c727070666e6435307a77706c6b76643565716c646d7377396333756a7773306676", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 1],
+    ["f6a704fc093882166a88eeb243e2658f0eb7b5b7943ce47c3924c67c96474cea029f1794895562430d5dc8be5e88cfeee3261d6be4e6eb5b238ecc9e7ebdeb1bf0", "0fec4a4553bde5638ff97ac262635ddce4fd10e9b9eedb3bf2b60a4cb01730e1971db5d0921a68a3e4d78379076f47fb26388a874a16c14dd21cacfc0f14475e4381ed27a5002ea7a9c87339d66ba14675e7f806d9580b2e71c4d166c15243a57b2ce29b1c441fb68534de0441e5d75c2da24667372d9ae6db6cf63693f44d86", null, 65530, null, "757669657731386a706634636a7974356e66613734377561347361777476396370706c3867353736613475746d74736c76656e7a6d32616a7965667a326679653277376c6a6a6d3633663672393033667568646d36666d766733646e706778773037746c6c66713768636564653871796c3266616e61617276736d38643074727a35636b63376b3437646e6537386d6677356c726b6763383833616b6b6177327674333763646d767936736e61707875667238353772357039766d66396a7833733030773733776536667a34773439797939776463337539326b7278307673303574336334723666617664746739756a327471733934736b6d3578646e39713476707767666d6b6367776c336338736a346570706838663639383339713870377074383678766435656a73376b3837646e33746c7766656e7a717a6c68616c6d3776777761717935366d6d647973646e71656d6d73657336733635336e36787134", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 2],
+    ["3ebe46d6204feeb43bd83511cd816134c2f03d8582c664318cc60063eca38a04020f8aed7690bc84e3fa6510c362bb9290904b6ff5b75e4e5ca6de821bf3389fae", "507cc7052c6a80b54f01eb8ffb6aed4e3d5ecc50f3447076612df3412d098256ac7767bd7c7b3e6705bc39c86a22800e76cd503258d9fa8fb8b28b719e98362bc697040a0f00c948ef2e110cb09bee90a4a7ebe424b058ec9d97272f9d4f9d687da2f89c201c6f5fa2ac7a7bf73ee32344d13d6f89e8960452613212fe98d0cc", null, 65534, null, "75766965773161716a726b3673777430663877323365763567756d6b7a33646e39393039376661326e653867706d747261377a306c7432787638717037767a76666766786d63647a79386a7470667464756a75766d37706c6c653932343736767773306d39357a6c66667970377272307632727a76366e7968727668363061743971717377746a38796c343476743967647775737a356c367032647a637a726d357a6d6c33757163756467396565616334726730763979656871757a683478346c3377726336376d71753275767177743034346a7376687637386875356768787464377265796366336c7775727867797235723837327373736a3868366d72346372776330396e306436386330796c737768787779366b303576726b307436336b3679646376353738763879347a6e61737478706e726777683070613268783767397072327a37646d7777777466676376336c7972617879743973336561673368", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 3],
+    ["934d5c7b67ecebc7fe717ffba06f30973ecdb4735dd8c8173528c357ec23311f039efddc9cc1bf9f4214a09a7f0188540789b26197cdededc993be5381587f79de", null, "0572a55aa8d307c5be909a8f4ae2d9307292b9f7ba7ba7657193fbfa3cba7104cab2e3d78fb6bcb1c824f0b61c08185c0efb62e502dea31ec88145d295be4214a0b79dd0caa56c5fb2a53b78597c1be7663c5191fe1542e72d903273e653d901", 65533, null, "75766965773139656d6d77686d3971797267336c33747765346c357830646d3475723671346e76733777366d6775726b6b35366e797a7172366a38366667366b776e7368306d61683971353467796e6d6b786661737365636b346b3870647667737838763275386a646e30386a386d7372736e7a7068726865763863713073636d61397a336b6b797065386d366a6d676a6179366e636574396a6a6c70736b7a76797a78637a66686874766a34377a7a65306374726b33706138396a36636e6d6e646e366e637276666d6d73346830733233347066367a6d7474366e6a7973766c716d356d343472763034673664303539676a3876337864723570326433726e706c6d37687a6d6c6a6a6e3874356b3839646a70796c387232336777737777796830336c7667366738753470616e", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 4],
+    [null, null, "dd7a56b35e69c4ad129df5aa0d3f087d4bcfc9090978b511c18cd39ce83a402c2fe1828d9d1f3a5f71e7ad056aa8e60e6f3fe4eabd258abe3c3316fb098d9115261c9a4499c984cd6a62e70c24967f1650d7c4354d60a8c4671a5c3a4d67380e", 65531, null, "757669657731386e71326765707073367470776c396361677a6c6a6e676b74333334703533616b71776b6465326e683534786770746633636364347479656833676c656b39706d766b366178786b7338796c396837357071756e746c6d3967396637617268667236336e36393037746e6661787337306e7734707538386678736e336e386177703239636a75377234683576767632356573706e6e6e793373646b743639686764677165686b616c78777a6567757238747a37306a7a6332777332726b", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 5],
+    [null, null, "48e057b53fc1c94392f04b631c1f4696fdefb74fb91ad813a91fd70290845e09a1d6cb1108385b9c20238733b3ca1b3586c5353ea6b323ad37413d001770c20b325f2e53aecdac5d36cb6585e402e96f9f079d3b888add2e6037f0a09ea8272f", 65530, null, "7576696577313864747037716e61346a636c396b383539356c7178796d346465687a6d707375656830323967633777716b726b653678646b32386479656a366d63673230716e336538687a6479766679336a756777327966376b7270666b74653666663861646e6a6b61397a783361676d636a707537663875767363373261346163737a686b6d6a67786d73763337766533757a307363326471767578666b323566706871636e67793435746575657679327776706778306a74387771736671673767", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 6],
+    ["694cc09dd242e4a7b74e3b3cd795fe6959fa577ba56fdeb5fcf4c1a4502dec750214158dc4631f2a3784bfb42b9ad44dcb779dcf0f26a1def9120f81c9836bf4b5", null, "0b264d58dfe23d503b5ef1493e0cd388193dd20fe0131209e28fdff27d494a0ba5e5d9e4e5daf7f3d471bbd7209440a6eb1a5677cd06c211546a025052e1a806630c2b4ddaa21db96eb31ac1d1bbb974305b2396d66b9bb802cf9f473ab14f25", 65535, null, "75766965773164303677676b7666737735336a6163793467336177326b67616b6675613833766a786476617a373732616d646a3464306a6b366364736d71707a727839347170306c37746e37716676797a357233717264727a6e357464737a6b7467616b66796d3430776b77637173676b353834333670686d78327934716a336a73306c3079366d707539703472377467713865647972387739786e756c7077646a6b7474733070717866646e6577786c61346d3670643370676c75376b6a726a773875396467356636616e6567356e7a6137396b6167306e6e356166656137766e6a687271727634367836357178676c306464393778306667306a7167716d79773432326d7938653573386c6e71796a683561377372327066786163303535363277616d6e63357a667377616b", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 7],
+    [null, null, "5a597f1414b10558f5c76406afb5a025a8abc02cf46738b7a15933663f9f1f1c1a4e6a217bafda3180c08eff58d76fd33a22cbbb485334b6e5d4b68e0119331e8fb43b7d91f9579249a95ef11c500b779baaa35cda27a146438f19bb48575e1b", 65530, null, "757669657731673230677072656b666336746c61377564776d716c35633470346e643237723066727876676b75737266306736306577663273356c30397338726730336e767974366d676b7365666a616e363030783936377663796163786674343572366a3578397a75736176776538636b6b776e3434663434647664333871376a36713538656a6373747837376e356e72646b6a3570737968366430716d616630367663336a613373396b68307277387a67706d7730737674666567386a77383968", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 8],
+    ["b60895766bdad050ed932d0099832255dc0966eab8f98a3b1577f450f226a9410295599fc048f2181156f9e453735d989eb61623f6eee8a060b8f3fa59666cdfe1", "65aeee89ce971199487ac959c2960cee07477bad7d07a4c71a363894d671edc7090213b1b25d74d9d07cbe5b5034248bad5bc5394972c8532ea24b3f3887f9e6d312ca8ed244af57ce0412209ba3d537bcac08bf7f64744100dafac55fb25629204f19a123bdbbba7159510e52376938fb893ebdadde04d5f0646a3ad0f4cbc6", "20f8c2edbe19901c0d1b5cc7ab185e67354511bfc5174fe6bc0e6362c5880b28fabbf237258f8d03b200ad7fe0f3fa7e80e628f2b745dc9983b038c3a81f8237b6654db322e68436a972c6d3bc56e5560fb8658055524a11d6ee62e5a7d7a516", 65531, null, "7576696577317174646a67686e6c30366e6834747579707665787472617a723975786573353268363477676837786b7770663561687675676b6165766473776e72796838336677657664777239303566396771676d37767837307137703867726c36636a39397a6d686a6d6e377068676535716d703937667930343534346b636579396d34387979726471616b6c3836617a7034346a6d7765796e397979373071686a703072647971306a3334756d686168657379367473753738737975327339326777636765786b6b3533716b74736b3463756b38356d61657a633078717278326b793737396d6778303437323036776e71397673346a76717566367a373976346438367830686e3267666a337065376e68757377356e34727971337534757273326b39643079346c6e68787a7264766873676578743576633236666774377a707236377667646e39726c676e76396d6b636e6e6a387063786537307a346b74766566376d667032333566727761767370343970663067637a3079786a68646777337466396c32657136706d337663683434787475336e73647772366e6675757337383837723268646672736e793430736a7837346363356b3530307830303971306776323232616635706c673761636e676e633936617079363936713366797233347a676b366c66657930393438746b726b6e376379723676356538", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 9],
+    ["948ae8172f75da36040a5c6b10d4c66fb5b04bb4bd9371cf1955e0e2fcace749030b478a94651e25797404b9563869829f43ae5bd41ecdd4e92ecf5489573fe451", null, "042790a274f603d5dcd5d28dab5c4e341feeb358618a886b9d1284b1095c633aff807d0499ae89b5b3401b22086e11961d287ab7de1ab534a0b336f959679e3dd0f09728e61eb9cbded2ebc76a36ca901d903ec2019ec04ccf6df46045e2241c", 65532, null, "757669657731393032706d7861756d6a376661683973613875686774657037636468326138337a67307a7935656766327567673763787a6a79677430686d756a706b61766a756e7261327177373433346877733471716a776e6d386b3238727a306e727872356c34307368716c39367576727779647438766834737170396c786a6a616765736e3478366537767477706e613878637865736c30736a797a6766656d74786135776c6e6e653466307767676a6d38757639656e7634336b70686e6e737961773577686a7435396b727a776678376636647534393563707174776c393237346a756a336b6c35343866703561746c6a7a716d6436347476646c3938656733307070396e6865686d7472737670737333343967357267336334347132327a6830676b68736161666d376c", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 10],
+    [null, null, "612611e4529f127a539c31b01241750616e6f5b3d7a1625cd301ee4b898dcf0e85f8b38eb5846c2ede2e394588723b8f583c3841d589e7d285ad218ee5a6ea299fb823267795a5e3c9a651af384289d6453972be95022aed8167a1ca660b2f0a", 65530, null, "7576696577316775367534306a7579786670716535616675367564716a34686b7a6671643778746b376872686b37796c6c71736d7a6466647267717136367839347270666768307a36656e38356a7161747030636c6132796c767571776c3735727433717371646c75666b33723635613372796e767a7077776e683035323975637a7735783572686534716d76653064397036716a796839796a6b616a307a776a78776b3376683338387a346566787935757368753675707068656a67397468687979", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 11],
+    [null, "82c3b3d788f6cc8714421d6b74c20b5bc58debd9a33e24b4be99a4c601959b34d8436534693bb2f793ad6e4b488d9c7e202771f11cae68405ec816c71b4a906401d4cb12115fbd978735bf537d8589154a8a84ca61d6c202b60477107a5e0cf8de349c22cd8bfab48e92e90834504d65a438ab76010e3bab7437153a79755d17", null, 65535, null, "7576696577316b726e766a6e396e6b397973797a617a716374727763743778706b703735687230397a75386c617a386165356b756a397467756a723575666d32666164786d797239636c327963736d6565646e68346a646579743774747a71376337726a68716e377733777135306c3278656338357374637a6a32777670376375367563326475367965303071303066673930766e667772777975776663746e667a776b367a6b3438397130617663346a756568746533326c6b74616e737a65753768387a757330787033636736736b386e737461686578303577617475773035653438337179686e66367232647876357179746533", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 12],
+    ["6f5ea3456800b2fcd67d451af033ac9e0978ceed3b4dc656c420fe6a313a040f03f9d51fdf9593ab447a1bc8a8ee8ee802ce85efbe7d2d0b3c2b9d15682a1d7ec0", null, "310e66c574051ac9d885f9fe9a4a7c0c76f32c60258e75a091b86117a733d024ae45b81a071cddb7e1095da271a20cd62a7e85e57167d10cc0aaf2e9fb081b3f47dbb1af9421a75be2ca3bac8b86a60ae8fe9af14f893c0c5714319b2a0b1f23", 65533, "91e00c7a1d48af046827591e9733a97fa6b679f3dc601d008285edcbdae69ce8fc1be4aac00ff2711ebd931de518856878f73476f21a482ec9378365c8f7393c94e2885315eb4671098b79535e790fe53e29fef2b3766697ac32b4f473f468a008e72389fc03880d780cb07fcfaabe3f1a84b27db59a4a153d882d2b2103596555ed9494c6ac893c49723833ec8926c1", "757669657731756e77777136726a74786877376e687170396772656c71686467647467307a73386e706132646c3932776d6b73706a7871353075736d6c68766a6b6a6c6e326d6e7265357464383275766a7a30333033396670706b306b6836386c356b726735763365306a706764617a303871686c72326e61643967393966363078796465686c3736673835687666306532617975653971767575326c74796d7135646d3032686479303668723339736a337065307066773367687672766c72663070736176387876327173687a72636d3732617a78646173777178677932777964327572393833766378776c6479666130686b71366a717a346c6436326d7675646d6870333763373365373868643063367a61663335796832676133386836716330736e36376334756838323365306a376b7a7933766c74336a34347239757a6d33616a796764723834636d396a67796c73376171717337786136667a767532393938666b6a67706d3270776772707a70727776703979683465797a633532337a65677270303071706676337765796e346c73737634736b77756e39703967686d757a303030347a746774337a65726639636c64666a727063786130677a6d70366661796d3638386471727535307a396672766d3877723361777877366a6536376673753939383364363264617272613664747776746363387675736533377a73686e6736326a6679647a736a3239346d616667747468343079", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 13],
+    ["b9cc7c2fb05f06458a0b87d0ac47270b52266cad661332b15455f989f6576538028185d9021ac4ccc6847e3def047aa6f4384e63fe497dd0b49b3364c3da15ebaa", "282b9f0424760d2126ccdd1c7e0fdd0d9ded2c5a294cbbc019ce8d35fd33b3bd2ed6a319400cd89bb329d79318173df4cd9af45e62d8719d9f2f66f9e81421ee4cc45e4690268df0040baba4955edf22951b3f5a2a2374eefa91dacf19c080aa0737d310920e67d83715ca4646d38d5ab5387e86db43751daa16684088872427", "8e880f8e62d87ef6c18b5882061dc512727e00a7e36862f506977ce96d761135e2616a1306955609ac674da547746112a27dbacc776b992f80e0762a79e5063df6e35f273df2ef59a14f11a4b465b9397c313682dcb878c23b5384e9459c142a", 65533, null, "7576696577316467756365746a7575646c336d737636746365636a306765746e787364706b356a36306837346e636b64747272717335703467766638613373336c666c7865646e7072373734737837747961716678773073386d6e6e6c376e6b3768346d356d337938786c376566676a7072617238736471366b336d6861396c39636c6e3577793373366b3467376d6130746337793330783578776c37657a78727a68766e7267643871397a7a68346c3038386d74613933326d6c37776c6c33397933733832716d73653538756c72377036726a35396c68397630673765766370676875336e746e68366a72326a7a6a327664633930346168686c6b7136736e306a647974336c3473306368366166376e766834656d6c737074333268676b357435396d67336e75786e6a7170767078323676776366767075686d38766d707930726179346d687768747a3964653867767767343233727077376c3839396676797530776d72356c70356c753436636b75666132677074396d736a70787861636835636e757761787068303065363574666d656c7879656437387435377434673766387639713966713033373867323379716c3274397470373867336d7030786c333071363233726d78676c686b6e6c373965376c74777572667670773777346b3537797a763937657871396830667630757267766666753664716d6b35", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 14],
+    [null, null, "0384454f17022a1482cfeba6905337fd310a7c2c3a0047abc7b1e7042550e80e237e5bbf5369af2e8b610fd4ecce60e4e88c35d11a30b546e9d14828f62d320c7ca2bda474d8a86c15c60ac120e79d4a99916e6ce1f92a56bcf8804d610f2107", 65531, null, "7576696577317274686a346c67716e6b74386473756673747366636563766d35666e61663868756e7333747337336a706c7575306e706e746a326e72386d6a75786b636837356e76706e7264666d71383768327975676c34326a74336d756667326e67396571723771703338736a33636e346c667a706b6136663963733737637677716471376d36723938713233397161327836326568776e6c65656e6e6e6b33393667766d706430346761656737386c6573377770366b7173727267757961756673", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 15],
+    ["7168544c05a8a120bb6b532589533fad6e19f38e65bdbde41b720afeae539657037460e104528508724a707d2e9a896742bfc7b73a0fd0416fe0d6229549089788", null, "982a22c3aa25c6dea0ec60cc9208b4dcc796f0d0ec6d8c76f6cdf54957cd36292e4917585d1f1967cfb5942c08589b78f10eb0a4faea9711841f446d048da13e1b6027c0fb0b440d06f472d8092216ef3b76d4e122f88897b1e97dd253a97d34", 65534, null, "7576696577316d74366332717a7975736570747a39327a35347674673864666c6e73796572756c7277713971797137667667357664766c3561753773676766707767346637776833646e78727077763368746e77736138646d7267666765713539733966737063767a6a3932777a786d65786565733664683632643478356a3233306d756e7972726873616a63636577766871666e786e67787065797166726a397978656e656c366a787066727139387968796e3279386e3964737232706734367367376c6e6b683736666b76756a75746776336a743567767770786d786c657272386c797a32356c73767830616d61756e386a75387a367a657034756d77636733356473736a7738346b7034713861753679713661716732326e3077776a77706a6d366c7239796a3539657466", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 16],
+    [null, "b7e107e0c3637526387c663dc51e2cb7f34416fa271e085246dea1015478a9b51f4f38acfee3e2d7ee3a1906c326d835948412f6647c218ed13b5d606f753d145ca102aa497e3f2190f50ca17873b6aca1a40612a540ca9eea6c4096f0db6dfa60e3822c1e69731a1e5013c7055a4348cf53e8bde2758f95b87a3a43c9e6ff6d", "2d3c2f7796db54f14a1753b5201e2499da0973016b978f9a4f49f515cd1c3c2670403dc59e67aed5dbf58c2fe4b3490caf854596436bc6f98dcb325ad7a6f22c8e3ae8448f413b2592363947088f9ae1c9908fe60313c10749f4a36281908724", 65535, null, "75766965773176653039326766677972636d77736b6c6665616d3377743670766d306e687037386361306e377673706b64773671346c38736b6e616163766637766778633478646a767063787266307a383532666e7a7370716b34683930353934616330307137656c73306d7671783977786d396b756775377977727639616361347164726d763277646c39357372366178393332703032373033787463327879777a706172787178676a3935326e676630397764796e63343536396d30686d6577786e7866666c77723534647832376c346a337972386a3863303032776c716b6b74637037373675306c376d70786b3961706470686a333634666373327464756a6361376563766e386379786d6b7166326d376c7839306d6c616d306676337677797830393979657179793032346d77366e6d373577796d347935367a687134746b756775653363793371706779766d367672656b797579796c6a6b336534756b3068396e6e3735616572666e667a7a6436336d63727a666b376b736c706e6570353666326432756734737378666e743667", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 17],
+    ["f90c60ebe5428502d2de8c9adfd003a1db5d161c73fe4ff1990794a6ed9733930231987bb4878e9e8078a9ea711f662bccc0d64f7e286d6872ddd9347d3b422cbc", null, "082ac71bb6882c48a63678a4207bd28d93ce949efc9f9963c7696ff6312dc62054e150736f5e3d26c87d5ab24a64508260ff60fa7e360e4daefcf04d10b96d1ccd8553ca2fa3d6ba62644bb8d72d6ee0159e469d6ed5eb2c512c78915be17922", 65535, null, "757669657731747a6a3675373077347463656639726d7177647a73376a7a6d3061656d6774756e66687a686c7a6b39726367653239746a78386a6a7a376d6a327479613978336e307767787337746b33786b773572687979756471723835377a30776d796a396c32383466647a3467336663366e746e656b75686d343770703835617076396a376a396867647a6c34396a6e7a726a6866677634683061727a7033386e6e7a79356a333739636a7267356735617367366a3274786c3278397475707963756b63717036677179736877706566676c75327667676173646e32337a63753879376577366532783563766636396773306766647965766830776a326177367771326639616a71687a7a366c7a6d396c72747374687272357a6839353935347579647739756c6c6761666d", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 18],
+    [null, "d9e0d580c264aa721420bff06666b991635989ec21813e9ef8989728a82835163564d29ae007573f0d48b12f2ca2a8135f8adedd27c0e1d04399773ce1aa29949485d60142c6896d6aaab7d5abb01ff34440c1b7d5ca239576d5a243ac37df2ffd3dc2815d5052e67991abf2ef9742d788e7c45264af01b6237558157596ed96", "77051a5802d4ef29655f7e149ddc1b1e94640f2d30d3e51856b7d10813da99165aee0e247964d23398b6ae89eb0167d9c48584e274ad212cc6dd7e65c1a60a23ab47eb191d1c16c28235ca654e7e637eab6da823ea090ccaf84a8ae13e432911", 65534, null, "757669657731777376373363796a6467387479716530366e6e6d71673432646d6376766438616838776d6b72646161746a7638336373663267373368643936326361797279646730746438327563636e33326e7a6c3768776b793232666e6a6173346372683236616a3367716a36687366617a7266663377767573767134306c61756832363771616d7174753234646837747a6d7a6839676d6d6134656d6d3966667a3736723771706b36773365716e36776d7039343235796e323774686a3774353661306d6c753637376a307472336830347476376868346d3933786d6434733238747030613739637437326a3275706e663736667164616c72343936726a647a6836326c613534616b78733968786d64397272777232797377617736687176677a743837723668723530716776657935713432786e346c717a703334396776346d7432736a3634737830717461726a637365746b726b77347a787133356e793266637463397a7137716639373971646477666834763661356d70713935306d36326d6434306e396d773771386c6d646174", "000102030405060708090a0b0c0d0e0f101112131415161718191a1b1c1d1e1f", 19]
+]
+
diff --git a/depend/zcash/src/test/data/zip0244.json b/depend/zcash/src/test/data/zip0244.json
new file mode 100644
index 000000000..7f1151969
--- /dev/null
+++ b/depend/zcash/src/test/data/zip0244.json
@@ -0,0 +1,14 @@
+[
+    ["From https://github.com/zcash-hackworks/zcash-test-vectors/blob/master/zip_0244.py"],
+    ["tx, txid, auth_digest, amounts, script_pubkeys, transparent_input, sighash_shielded, sighash_all, sighash_none, sighash_single, sighash_all_anyone, sighash_none_anyone, sighash_single_anyone"],
+    ["050000800a27a726b4d0d6c27a8f739a2d6f2c0201e152a8049e294c4d6e66b164939daffa2ef6ee6921481cdd86b3cc4318d9614fc820905d0453516aaca3f2498800019f33bf3a109bdd1b232b47b1646d91e1296634ebde5ccad57288b5b2228186e54b6968912a6381ce3dc166d56a1d62f5a8d7551db5fd9313e8c7203d996af7d41a38e01d94903d3c3e0ad3360c1d3710acd20b183e31d49f25c9a138f49b1a5301466b3da612149df5eda0f14f2efc5c6ac03884428a315dc91f8d7b492ebc57e475a4a6f26572504b192232ecb9f0c02411e52596bc5e90457e745939ffedbd121e37ec1e9dddc31b06dc9576a1738ef73e6ba71648913dbf75a779fdd488d83f857deecc40a98d5f2935395ee4762dd21afdbb5d47fa9a6dd984d567db2857b927b7fae2db587105415d4642789d38f50b8dbcc129cab3d17d19f3355bcf73cecb8cb8a5da01307152f13936a270572670dc82d39026c6cb4cd4b0f7f5aa2a4f5a5341ec5dd715406f2fdd2afa733f5f641c8c21862a1bafce2609d9eecfa158cfb5cd79f88008e315dc7d8388e76c1782fd2795d18a763624c25fa959cc97489ce75745824b77868c53239cfbdf73caec65604037314faaceb56218c6bd30f8374ac13386793f21a9fb80ad03bc0cda4a44946c00e1b1a1df0e5b87b5bece477a709649e950060591394812951e1fe3895b8cc3d14d2cf6556df6ed4b4ddd3d9a69f53357d7767f4f5ccbdbc596631277f8fecd08cb056b95e3025b9792fff7f244fc716269b926d62e9596fa825c6bf21aff9e68625a192440ea06828123d97884806f15fa08da52754a1095e3ff1abd5ce4fddfccfc3a6128aef784a64610a89d1a7099216d0814d3a2d452431c32d411ac1cce82ad0229407bbc48985675e3f874a4533f1d63a84dfa3e0f460fe2f57e34fbc75423c3737f5b2a0615f5722db041a3ef66fa483afd3c2e19e59444a64add6df1d963f5dd5b5010d3d025f0287c4cf19c75f33d51ddddba5d657b43ee8da645443814cc7329f3e9b4e54c236c29af3923101756d9fa4bd0f7d2ddaacb6b0f86a2658e0a07a05ac5b950051cd24c47a88d13d659ba2a46ca1830816d09cd7646f76f716abec5de07fe9b523410806ea6f288f8736c23357c85f45791e1708029d9824d90704607f387a03e49bf9836574431345a7877efaa8a08e73081ef8d62cb780ab6883a50a0d470190dfba10a857f82842d3825b3d6da0573d316eb160dc0b716c48fbd467f75b780149ae8808f4e68f50c0536acddf6f1aeab016b6bc1a51ed44cfab70000c7b3534201cfb1cd8dbf69b8250c18ef41294ca97993db546c1fe01f7e9c8e367edcf04be34a9851a7af9db6990ed83dd64af3597c04323ea51b0052ad8084a8b9da948d320dadd64f5431e61ddf658d24ae67c22c8d1309131fc00fe7f235734276d38d47f1e191e00c7a1d48af046827591e9733a97fa6b679f3dc601d008285edcbdae69ce8fc1be4aac00ff2711ebd931de518856878f73476f21a482ec9378365c8f7393c94e2885315eb4671098b79535e790fe53e29fef2b3766697ac32b4f473f468a008e72389fc03880d780cb07fcfaabe3f1a84b27db59a4a153d1070689f2ccf975b2b176e1c69dbe381340ef1f98fdc4b453abda3a2bfac3069ba7f1cc50a81c2520e412fab4e5d397ecf739f280d5b684533d5d29cfe7e7302ec144b4e553acfd670f77e755fc88e0677e31ba459b44e307768958fe3789d41c2b1ff434cb30e15914f01bc6bc2307b488d2556d7b7380ea4ffd712f6b02fe806b94569cd4059f396bf29b99d0a40e5e1711ca944f72d436a102fca4b97693da0b086fe9d2e7162470d02e0f05d4bec9512bfb3f38327296efaa74328b118c27402c70c3a90b49ad4bbc68e37c0aa7d9b3fe17799d73b841e751713a02943905aae0803fd69442eb7681ec2a05600054e92eed555028f21b6a155268a2dd664052528a5f8ed028f59af985ad1315c2e25aeb9d7f134e4bf478642ab96b15d3b3e13ce2387ac84dc0819e81260e11d392a5f06db8b5633de281a0e9c958c24060297f608af1dc51616562b1ffff6e2a28bab1f7772713a0a4b56fe47fb5a7b73aeee5345566ecf3e95e825f92eb469eb5d69164206a0ea1ce73bfb2a942e73703214d270d80534389b1a1e2bba67481eb3667d6d38254ac4b44559b4708cdd12898972a895bf0fb055cf1fb9b73029d6bfb27da2b5294f5cb354a894322848cc3d35b9554a5f62b44a7dcb25406e5ba07882cb6473714e77a051a7dcd29fea0a943785b325cdab95404fc7aed70525cddb41872cfcc214b13232edc78609753dbff930eb0dc156612b9cb434bc4b693392deb87c530435312edcedc6a961133338d786c4a3e103f60110a16b1337129704bf4754ff6ba9fbe65951e610620f71cda8fc877625f2c5bb04cbe1228b1e886f4050afd8fe94e97d2e9e85c6bb748c0042d3249abb1342bb0eebf62058bf3de080d94611a3750915b5dc6c0b3899d41222bace760ee9c8818ded599e34c56d7372af1eb86852f2a732104bdb750739de6c2c6e0f9eb7cb17f1942bfc9f4fd6ebb6b4cdd4da2bca26fac4578e9f543405acc7d86ff59158bd0cba3aef6f4a8472d144d99f8b8d1dedaa9077d4f01d4bb27bbe31d88fbefac3dcd4797563a26b1d61fcd9a464ab21ed550fe6fa09695ba0b2f10eea6468cc6e20a66f826e3d14c5006f0563887f5e1289be1b2004caca8d3f34d6e84bf59c1e04619a7c23a996941d889e4622a9b9b1d59d5e319094318cd405ba27b7e2c084762d31453ec4549a4d97729d033460fcf89d6494f2ffd789e98082ea5ce9534b3acd60fe49e37e4f666931677319ed89f85588741b3128901a93bd78e4be0225a9e2692c77c969ed0176bdf9555948cbd5a332d045de6ba6bf4490adfe7444cd467a09075417fcc0062e49f008c51ad4227439c1b4476ccd8e97862dab7be1e8d399c05ef27c6e22ee273e15786e394c8f1be31682a30147963ac8da8d41d804258426a3f70289b8ad19d8de13be4eebe3bd4c8a6f55d6e0c373d456851879f5fbc282db9e134806bff71e11bc33ab75dd6ca067fb73a043b646a7cf39cab4928386786d2f24141ee120fdc34d6764eafc66880ee0204f53cc1167ed20b43a52dea3ca7cff8ef35cd8e6d7c111a68ef44bcd0c1513ad47ca61c659cc5d325b440f6b9f59aff66879bb6688fdb462af43582b983f92b5698b87db46e4b02dd8e81eca555a44f2f1aef11d88a0bcee76af9ad3f9c46a67062e1a9ca7ea5c014384af07219c7c0ee7fc7bfc7933d174650f46b4cc000190c19b44c57ae891aa86646c10a177a8626be064409931c37d9e8bdc433b7d79e08a12f738a8f0dbddfef2f2657ef3e47d1b0fd11e6a13654db2854fcbff49aa0dadafec320b6ed2d4b279aee9060c1b221e2eb2f13b0691c4d842406d0ec4282c9526174a09878fe8fdde33a29604e5e5e7b2a025d6650b97dbb52befb59b1d30a57433b0a351474444099daa371046613260cf3354cfcdada663ece824ffd7e44393886a86165ddddf2b4c41773554c86995269408b11e6737a4c447586f69173446d8e48bf84cbc000a807899973eb93c5e819aad669413f8387933ad1584aa35e43f4ecd1e2d0407c0b1b89920ffdfdb9bea51ac95b557af71b89f903f5d9848f14fcbeb1837570f544d6359eb23faf38a0822da36ce426c4a2fbeffeb0a8a2e297a9d19ba15024590e3329d9fa9261f9938a4032dd34606c9cf9f3dd33e576f05cd1dd6811c6298757d77d9e810abdb226afcaa4346a6560f8932b3181fd355d5d391976183f8d99388839632d6354f666d09d3e5629ea19737388613d38a34fd0f6e50ee5a0cc9677177f50028c141378187bd2819403fc534f80076e9380cb4964d3b6b45819d3b8e9caf54f051852d671bf8c1ffde2d1510756418cb4810936aa57e6965d6fb656a760b7f19adf96c173488552193b147ee58858033dac7cd0eb204c06490bbdedf5f7571acb2ebe76acef3f2a01ee987486dfe6c3f0a5e234c127258f97a28fb5d164a8176be946b8097d0e317287f33bf9c16f9a545409ce29b1f4273725fc0df02a04ebae178b3414fb0a82d50deb09fcf4e6ee9d180ff4f56ff3bc1d3601fc2dc90d814c3256f4967d3a8d64c83fea339c51f5a8e5801fbb97835581b602465dee04b5922c2761b54245bec0c9eef2db97d22b2b3556cc969fbb13d06509765a52b3fac54b93f421bf08e18d52ddd52cc1c8ca8adfaccab7e5cc2f4573fbbf8239bb0b8aedbf8dad16282da5c9125dba1c059d0df8abf621078f02d6c4bc86d40845ac1d59710c45f07d585eb48b32fc0167ba256e73ca3b9311c62d1094903570519d4442f0200e6ad11f2452dc9ae85aec01fc56f8cbfda75a7727b75ebbd6bbffb43b63a3b1b871e40feb0db002974a3c3b1a788567231bf6399ff89236981149d423802d2341a3bedb9ddcbac1fe7b6435e1479c72e7089d029e7fbbaf3cf37e9b9a6b776791e4c5e6fda57e8d5f14c8c35a2d270846b9dbe005cda16af4408f3ab06a916eeeb9c9594b70424a4c1d171295b6763b22f47f80b53ccbb904bd68fd65fbd3fbdea1035e98c21a7dba5fe1089f7d1c032f24d36835aa8815266e897ff829403cfac3a715954b9b68958a0111a2c9265633ba2831a2e86b941e569d58d99c1383597fad81193c4c13151f40aedb487b5c04ae3b1ddfbafa26e720099f26d5a7535aee57306fd2c4f30673cd9b698fecf32faf88f62e21c90665859dd26833d21d9bc5452bd19515d3fa5c1e68bc209b9dc2a10ae6b630726a67b33603c691fafc281dd94dc9888a68c4f45155aa7897c045aafd9335be2e0ddcf5f586d7f6b4fe12dad9a17f5db7031", "d0854b7070bb168392e7cf3d3a558711b49c2c0ad8eca3a8a14b8333bd962c55", "57dcab20681fee70a3c653b66322fe3f6158f89ccba1b30f366785675f7e7612", [1800841178198868], ["650051"], 0, "ffb000107a8feedcd5936bb9f278d40f6de65beb21f7b16a29d8565bb964da88", "59e436c51d2cd27f10358e9506f97f76af7e34709946c20bad3842424dbf4e2d", "66b0758dd9bd290bc70923389c9c8d5b85780c3704ea0ba8a52c0064a5ca3e68", null, "79283ea27a3e39795f83217d5c934bf6a4a39f523979775da1edf415ee759e9c", "f43ae4176ceb81f2b9f3dcb6ebee407baaa2a6e4358d80c5412bfd960af0dfa7", null],
+    ["050000800a27a726b4d0d6c21fc998c31f4dd208010000000000000000000000000000000000000000000000000000000000000000ffffffff06041f4dd20800ffffffff015058e5754c2104000753ac51530051520001e5849f96bae6f2056f33ab1e6989d7d264adc97855a990103b4d1e6350d5c31a39c3caf69459e462f141be8b39037ffa255ce27e4ad7b566a29620a9f011ab08fb2ad3050652b3f65b8e34526a2a15fc2ddc5b5113e4882c7cca0dd5577be067ba7a175dae4bbe3ef4863d53708915090f47a068e227433f9e49d3aa09e356d8d66d0c0121e91a3c4aa3f27fa1b63396e2b41db908fdab8b18cc7304e94e970568f9421c0dbbbaf84598d972b0534f48a5e52670436aaa776ed2482ad703430201e53443c36dcfd34a0cb6637876105e79bf3bd58ec148cb64970e3223a91f71dfcfd5a04b667fbaf3d4b3b908b9828820dfecdd753750b5f9d2216e56c615272f854464c0ca4b1e85aedd038292c4e1a57744ebba010b9ebfbb011bd6f0b78805025d27f3c17746bae116c15d9f471f0f6288a150647b2afe9df7cccf01f5cde5f04680bbfed87f6cf429fb27ad6babe791766611cf5bc20e48bef119259b9b8a0e39c3df28cb9582ea338601cdc481b32fb82adeebb3dade25d1a3df20c37e712506b5d996c49a9f0f30ddcb91fe9004e1e83294a6c9203d94e8dc2cbb449de4155032604e47997016b304fd437d8235045e255a19b743a0a9f2e336b44cae307bb3987bd3e4e777fbb34c0ab8cc3d67466c0a88dd4ccad18a07a8d1068df5b629e5718d0f6df5c957cf71bb00a5178f175caca944e635c5159f738e2402a2d21aa081e10e456afb00b9f62416c8b9c0f7228f510729e0be3f305313d77f7379dc2af24869c6c74ee4471498861d192f0ff0f508285dab6b6a36ccf7d12256cc76b95503720ac672d08268d2cf7773b6ba2a5f664847bf707f2fc10c98f2f006ec22ccb5a8c8b7c40c7c2d49a6639b9f2ce33c25c04bc461e744dfa536b00d94baddf4f4d14044c695a33881477df124f0fcf206a9fb2e65e304cdbf0c4d2390170c130ab849c2f22b5cdd3921640c8cf1976ae1010b0dfd9cb2543e45f99749cc4d61f2e8aabfe98bd905fa39951b33ea769c45ab9531c57209862ad12fd76ba4807e65417b6cd12fa8ec916f013ebb8706a9a556c762f88500006effeda06c4be24b04846392e9d1e6930eae01fa21fbd700583fb598b92c8f4eb8a61aa6235db60f2841cf3a1c6ab54c67066844711d091eb931a1bd6281aedf2a0e8fab18817202a9be06402ed9cc720c16bfe881e4df4255e87afb7fc62f38116bbe03cd8a3cb11a27d568414782f47b1a44c97c680467694bc9709d32916c97e8006cbb07ba0e4180a3738038c374c4cce8f32959afb25f303f5815c4533124acf9d18940e77522ac5dc4b9570aae8f47b7f57fd8767bea1a24ae7bed65b409e1dd26b8dddd68858d6f5161f073d90636860a9aaee18629b06330a8ee30591debfcef56a026bb28c3b06ec2cfaf5b79ab72694d1d012a7594dd80ae7dfa0c00", "986ee4c4bdbd384c41f97aafecce586c082f4ac20918f6c2a4808da5d7adcba3", "6a8ae06b320f2ee955c4af74b09da17fa0f25f0b322d1ea43b8aa2d30e5864ad", [], [], null, "986ee4c4bdbd384c41f97aafecce586c082f4ac20918f6c2a4808da5d7adcba3", null, null, null, null, null, null],
+    ["050000800a27a726b4d0d6c2c2eb518f68984d02010000000000000000000000000000000000000000000000000000000000000000ffffffff060468984d0200ffffffff00000000", "6427874598e3877e9f28aad8e3c6634e4c7617841b1ab1507a6b8ad73c6cd128", "87d27002f0f4b3e814ae34cafcdc2153d20c01069ee4861e57a223ccb1552133", [], [], null, "6427874598e3877e9f28aad8e3c6634e4c7617841b1ab1507a6b8ad73c6cd128", null, null, null, null, null, null],
+    ["050000800a27a726b4d0d6c25e3dbaf7ae12670d010000000000000000000000000000000000000000000000000000000000000000ffffffff0604ae12670d00ffffffff01516cf4adec75070003656500000000", "da900554689a1b1aeed9a12fe1e46302db92f7a0605f4719729bf67ae7eff46b", "03f9779449d90f0ebb7283f652b10f3aa13958d5ea973701a4759914a6fc3b99", [], [], null, "da900554689a1b1aeed9a12fe1e46302db92f7a0605f4719729bf67ae7eff46b", null, null, null, null, null, null],
+    ["050000800a27a726b4d0d6c2ff6acc0ffc2e490d03146b9d49dd8c7835f43a37dca0787e3ec9f6605223d5ba7ae0ab9025b73bc03f7fac36c009636363635100635365bca7e54cc1a12d127b57c8138976e791013b015f06a624f521b6ee04ec980893c7e5e01a3362035904ac000053d7445fe2d09130f63511da54832de9136b39f4599f5aa5dfbb45da60cdceab7eefde89be63f3f7c00452006aace1405def0244fd7f99b67d040004630063ac12f6465073e1020009636a5351520065ac65000000", "5837a7f51b79a1bfb6f82d782aaab8718f3465583efbaa44655c1c58cae534bc", "5eeab6d72d8a05bb18615245cb7f2175385b3c03335d8e09e55648fc25bc366c", [1848924248978091, 447389782351145, 620151782842275], ["ac0000", "6565", ""], 0, "d3b58a516ae82b7a585a38b05371c0e747c06b5674c3ad4d1f33f4a5baf460a9", "cb4fbbb2ff5ca2761de646ee1b57ae55687baa4fc2201123d29a2dc55676608f", "85e7718dd3842433013e6dd8c9d76e2a24478bfe3743939d76c20d69048acffd", "1a86899715b15f1bf0c4f7678cd70fbe1f083f519f90403a447af37cbd8ea2b3", "45a5cfda0d711b549cf9a696f1cd173b41bae64a83957bab09afc5bb92daea62", "49bfe3ed32285f1d9265f54e47c8938861833518b0b91d30fec2b9031eebf0df", "5bf3a4774e9a6cb85fb2fb427d9402691b41444ed92622155c0ba488f107e61d"],
+    ["050000800a27a726b4d0d6c223e119f635ef1d05024b216b7023fadc2d25949c90037e71e3e550726d210a2c688342e52440635e9cc14afe100665515151ac53782e9e4a5fa87f0a956f5b85509960285c22627c59483a5a4c28cce4b156e551406a7ee8355656a20043e38ce103bd9a274e288d020000aafe033252c7030005516a63656338eb8b41ca5104000653516365acac000000", "3532b6cc2d1bf3658d114edbd1426ba66c1b0302bdd1c771338128b66c88d290", "a5f9a1facab35dbf4bc775d3df61e77ae79b9871f5673b8be2e98f78e632059c", [1561051182746413, 1535468271734483], ["656a516aac516a6552", "52"], 1, "0513c9c1c09ed0165e72e2e5cbbf142c612d8716fce380d5e71f697e011da924", "62f555860e6437fcba94484c9efcf85906b1b73ebdb03aa659fa77cf007cea2b", "3b877dff075ae0cdbdbc3778339cccf67d7040e68dd60eef98de7ddeea0336e6", "d94af9dc5bd75d19b076e990103538eeaebc3a302329a156b25fb5d78af9b2e4", "573c68fa07825a88ff2e39387b4f7057141f799d51283afb5c0d5f50d505c761", "d1cd339dd8580283cd2151c807f3556a8d17e1dd78ef272d68edb7b0bea95ef3", "a8df6110a38674a556f7385bc5f4b7373b5ecd908b47507bd8769876453fceae"],
+    ["050000800a27a726b4d0d6c24723622987d8d704000002aca3c4c6433b1da60595c2bafc722b38e7910f63616b22c9d677b17979566db2149b1d99341e4e6f9120f4d41e629185002c72c012c414d2382a6d47c7b3deab591efff360fe1199056c56e5feec61a7b8b9f699d6012c2849232f329fef95c7d181172c284ce8a4b322961ad781a5b9736d7f12e8643453c105a79a9f5ae009fa1ae6c25a9462ebcbb0fd5f14554bc97747c33e34da90c816d8d0d50bfe37618c5812891484fa259322c15092d4155d8696d6f12f24fd364496b3be0871ca3d02d2b6bcd59ead5e27e83ef2d4408754e9003161877669e1a4d850bf9fc1c231854d037e262f9a9f9bd8904467eaead83f0938e26e345f9cc695985f00a1255a0a4f95db9dadcdb7c240899aea2783c2d21c2d3279f886f7ab3d4e8af5381fa0b01848f1ab14ad334f2b68035808cdf1bb9e9d9a816baf728a955b960b7701fa626687dc3c9cba646337b53e29816e9482ddf5578a8768aae477fce410ac2d5de6095861c111d7feb3e6bb4fbb5a54955495972798350a253f05f66c2ecfcbc0ed43f5ec2e6d8dba15a51254d97b1821107c07dd9a16ef8406f943e282b95d4b362530c913d6ba421df6027de5af1e4745d5868106954be6c1962780a2941072e95131b1679df0637625042c37d48ffb152e5ebc185c8a2b7d4385f1c95af937df78dfd8757fab434968b0b57c66574468f160b447ac8221e5060676a842a1c6b7172dd3340f764070ab1fe091c5c74c95a5dc043390723a4c127da14cdde1dc2675a62340b3e6afd0522a31de26e7d1ec3a9c8a091ffdc75b7ecfdc7c12995a5e37ce3488bd29f8629d68f696492448dd526697476dc061346ebe3f677217ff9c60efce943af28dfd3f9e59692598a6047c23c4c01400f1ab5730eac0ae8d5843d5051c376240172af218d7a1ecfe65b4f75100638983c14de4974755dade8018c9b8f4543fb095961513e67c61dbc59c607f9b51f8d09bdcad28bcfb9e5d2744ea8848b2623ac07f8ef61a81a35910b8a1baf39a919a7b60bc604d63185f759221d847cc54a22765a4c33475b5791e9af3271fc8d9350667090d8184ec50522d804f23c4fb44ffa481bc92ae408d1b9f2b131904f9705c59e2f4bde7a3b2c085d93fd2abc5e14d163001a12f51938d021afa92239b873dc6c357eaa8af4ee6d00540657fe32914103b5d98f68bd3e2b5359f08ccd88d0c811e4c31fbb49f3a90bbd05dce62f344e7077593159ae35050b04c9e6b86bc432dc8b048c73c0018ca5b69411297732a4e1aa99a928c71e7a24fd277856aa42501e51b012aea9446a2104e93f815a0b3a29b458314f3d8be2b9823d3421505ff6d8890e904a24a7de951a2a1c64ed2e4f9e9a5165eba4799cefeb5d148005545f9b5fb0eec6503febbdd26a238514383734afec8a481cfb2fe1ff92f1ea78407b407c6b84a214ef607cc5904d9e8c73febffa01c2b1779dc420f089eade20b69d5d7c43ceb736b6831e8c110f16cfdb3a467e9414c00ecf13731500894555678c497faba9a95d01cc464390fc4a76bfa8b0e1c68a525d706d6604b2330b6b3485215f606f1883a751588c7efa506c3e8d0c60192e8476bd1175d9562087bdb818e66216286bafe47ff4dbcced51444480a9a5673ece7fac73a0ed41ab0051753a7caa89be3139afd9793b3e02f27f040046595acd47bf13fd0da27f09eda48036d3ee437f2ee8f8606ea97343c33584657f46dba99db5cfe6ca176fab7b0f3bfa0ab61e340c34eb9f17c7ec2be03b180f0bb6f434c2a6542e00e84373f4f4649cda32bf686666143f622aa480460b5afac518607cd9af8bcd6b58c30127316b25d5ea7bf6b0cab8542ff69d9b2f180be12ed75344a395aa10f852f083ad64ef40e9c0309e9bba54b8cb33c95498a69538d3ae5b25e247098306fa8c74a8ee5bca941531d61aac27aab3dc5617d5606c9577a2a8346e8d85b32b8505775108dc85e2ade2eac1e636e1af4054c8b6f57632df269c3723b320872e4c57b218358dc7e9905bb04edf92edf0df635f3bf361e57a13296e1447af5087872d636e27518a9876e15eb01f5e8ded81892511cc2851b00b832712a6d3ba5666517bcd3567621a7cf8445589653262020c33bf78031b8ee0707de072068c170570327e6d9f5c6ddc335402efc548862f5a07094fd428a7bbc15d7b38d05362c9ca985f58a76647d2be4c2cd6b3d17d6870971d7a098baf72c6f6f1214cf1faae488bd7de259d3415c2f0ddec7457004f35708d1eccccc0df65a04943ad5cbc13f295f000fe056c40b2d88f27dc34cfeb803be3483a9ebf9b5a9026057725d63ead2c0c0ff1fe26ac1e7bdfcd6fad875842d194f331750462c06b8d7982d67995ed5d3ae96a05ae0067f4eb1c7c93231bd39773cbe0a9d33a0a40b101d020077d97ce424013d64b4d0d272ec01946b7a5eedfab4d68cd6d1b2667d04b29d0caf370098ffe4918e0ca1df47f275867b739e0a514d3209325e217045927b479c1ce2e5d54f25488cad1513e3f44a21266cfd841633327dee6cf810fbf7393e317d9e53d1be1d5ae7839b66b943b9ed18f2c530e975422332c3439cce49a29f2a336a4851263c5e9bd13d731109e844b7f8c392a5c1dcaa2ae5f50ff63fab9765e016702c35a67cd7364d3fab552fb349e35c15c50250453fd18f7b855992632e2c76c0fbf1ef963ea80e3223de3277bc559251725829ec03f213ba8955cab282d9625348a614b59bde45885649bae36de34def8fcec85343475d976ae1e9b27829ce2ac5efd0b399a8b448be6504294ee6b3c1c6a5342d7c01ae9d8ad3070c2b1a91573af5e0c5e4cbbf4acdc6b54c9272200d9970250c17c1036f06085c41858ed3a0c48150bc697e4a695fef335f7ad07e1a46dc767ff822db70e6669080b9816b2232c81a4c66cc586abfe1eaa8ca6cf41fc3c3e6c7b886fb6dac9f4822b4fc6fff9d0513d61a21c80a377671d135a668a0ae2bb934c82c4142da69d12ca724756a379a69f83e70cee0c78cf313a777fab48ee203e14fed624162e9cf3865245cfb31ea07ee889e470fee46a06230f70051f11e798c720d37f227ca01b109a1cee92ad5f6b0201ae71eab446999cdcbc4a5fc3b1af13894ae93ddffe8ee1850136b30cda1d83d8d3bea7b131c06141cc2a85fa5b43d05ec954e11b6f37b03f46213e942a7e19a46e970b5c506708430317b1bb3b35df68ae33a4926a03e6bfeb5510416fcbb0524c9ca5074156cc5a5d6fe1c995edc60a2f550411aa41e3da3bdcf64bcf04a0510571b936d47e55cec0330ee8dfe73563404f047d7f3a8a3d7743bc554955210f1eb0d08599ea77d5f974d87176d37d98b9c0ad440407209ed6a9f08464d565593e1a63b938536b49244e97d880173b640f2ddb74d068ecb46cf289b7d891307bba37054cf91b31fc82f74d5fcc000942ede911825f53fe666b0c9aa8cff6a376e1f372eac6ac4e46cc0942245d4c2dcf02d7640ffcc5a6ac3a87f5c411551bcc2f26cb94961d53f95ddb19ae930c8d70f031b29a5df99ff36695e802cbcb6b58c1ba7ed5eacfa76414a41ad4a44f71f1b580d34c3a952920b254a145fea517f5b42b2f65ecd0f82595478d80ae5c8ceea12a161ccbb5eac09990fc619a46080436dbd08d74784af002d58e06faf7f3ceae7d3419b1fca265a5559cf9e2d3b60978d81a678b9ed8e4486b4d14609d6c127c0c2fbffe30a605198367017df5c2b2c020b405035feb4b2cdfe3a281bdbd968e0a90fa651361a42de272cb8c2f54e96f51df91ef119cc7ab7e136a3bdb818b4d78c8e986670030274392265433281c8a771171c2b70a07272d2fbaabf813bf2cc8c2b2bc256d49827ffa8f6b096b4c3a792c5de003f4c33b7216056d9edb7482fb98aa033b65e1199f5837e81ed2fe494a719ffc653fd2bb9ef91327ac210482a6ded0ab8e1c80988bb4585851dc93eccc62322924cd13b5dd4eed66ed8d9972d772629ea64742ee83c04112f09ae574827aa4beb0038f2555a8ba36a9bfba028d7c21ea3cd0bbaa9ae4811c6af06fe80a8c02ab7a00e18e4a6aa1ea1b76945d2615d43ac118b56c2f2960fe93a025f13ec91ffc6d2c353699abb092dedc065db8fa214dbc46466f897b88c58b30152133aa3831af37c74d99e9e36ff7011d3238305691508a2c3a43e755dc081b511d6482a7db65fa9699ea87ff47099ed3637dbb0a3d0ef79796a8ef1e4d94d42b4bc2b4a038ae6e46b24cfc84153d31eaf895063a5ca959be63f37f2ba0d432366736d8632fce072b6ae5b6f3fd59d3faff638275a992fefc87e60d44c2cadc2b5c494e3e72eb4597c96b40167799a9001a2ed3676a8b403ae25ffd772f7081e9a32bcc1c5e2edd4e2a6576b783cce3aae11fa432262548856183ee682d5dc31beb38f061cbdeca7021a444e2dd417df26dcd220f2b731772b439e96d614e1facb486c7a7d5171b1de359f6ad3a96f649c969102a1964fb4b4a1a4279c68e6c372e42187d754e804a61653092069fb9b6d25266890808b015df28c801065da6febdc1a56bfd002625acfaa5373fde149c1cfc3649b4869696d44ecb12479c5ebef995f10029f8b530eeb3fdc2e50e8757fc0bb9e263023db82f878d9ac7ffb0bd4391df1d879899a3ef57bfd0d1f7755648edd85bb052a6edf71cd2628c987429f36dc505ccc43f30e7a869c9e255e2af9fcf30c121796d190000960cb6fe2f1bf246118b498f3247f9d484c73cf09393039e45326b8ffffb3e7e6159c46699f100792d4672950348a90552e45943beeacf03f3216f94e274d63d637d9f190e8a266cdeef153530bee5cb8355260505c2c2e5d990fffdc34ec0ff7f1af81b24ced0efa6213da6c7c60c487f5f7b03f8160a057f46d05bf8218b3add9c06893bd02db9b61191dfb133bfabe4858e47a4cc32e416ec08b8ac7915a43733f4406e9d967c560f344d7e904a28045d91e50d79e42867c0ad0ffb55f68875e586420108a1b092576415dc13693a1212b0e7003084ef95a27a7d4284d276111d860142cb740c15b7b623cf48b3f7bfe3af08df8d1d3e11ff198214e673776f04f0c4e846c32a10c0d559e4968b4f8e1b96cdc1ea7ea31dd86d680e25985e1d5d02580d04274234af2a51b56bb68a29e03bab7b50f306ef5d9a4f8135d69614ab34158fba370f78763d4020081fe39cc231630e4c08915e631771550e9ce1fca2c63fe06b7989d584fa7d782a88c1e7d64b6fbf55e3596af9bcb7585f8c7d3aa5c2082b265249df05701dab031c4bac1ea267a2996a2028d1e6a0f80a3847c531dba96ee65a24189bd2712e40e959664981e58b2a4f951ef8f497dfff2f2f271eab89c628e18b5fcb43882537eaf6ad2a6b1754633caa86bf2c76f3993154fc73e6fbba2210c2743f530a427849a301e00e01129f03a4607f87cbe0762c0b1c65855deba8422ca4b88abeea6a4382cf16ccd6dc7c37c44e549c4534819acd8bb0a02a5fa7a1c1d3806fbc3407fd7da93fd0de6400d3ab8977485cddfbed5932f507b79947adb2fad37615aa717db5f298099f20f263b359a1151a6b75c01365eb154ae42140d6e10342f14f34dc33e07ff0e4d1a6be375b32f84b92e5d81ebb639c4f27e715aa42cc75707d4ebd1bbfbe8f90fc7c953e7a9715e65af8267373d3451674ff084efd92ccf3bcc7aca1467b6327e4f9522b2cc579a7a8fff7ca7cf145dfc13eafc34153b2c3e8afbe53444d0c73b3bd5bc870b01cd457911e356313fd1dafb4c8151634a01aff7cf116d433c3d2b3adda9cebe18f7d172443e5e7b5ac9abe8db2256d7ebe2ff28020939503870597b9a955892c7389650a2d42ec92be723fedf2f2ede5a472aa1e74f33ad41901544edbbe3ac464cf439196015f4f22ac2b8fc01496beab4d45907f479812a259431a2cbc93d4f3b84e4dd366020273a6752e501af6ff1b78ddc817e6ea351d6006becf8d2ffb03990f67774a81e05b7f4bbad8577fa27c9de64e1b11dcf384f5956443748755a9fc6f2a00b10c3657ebac03bfc0b587bef2f45ec8acdaa51c143b0cb25b9142c61bd790a80d7c23f90cc03495b51e4d2843e557f9e2545108c6c6fae359f645c276891c0dcab3faf187700c00310a4fef5631400009a2dbd0e138d2deae41caea5f186577a77d1b737fe21f0fa5a18ebb52755b526ef6130fb56944cfab87527c250d113b29bcac9aaa10c2e7de415edb0806c6da03020a134ca7ecdc8da1bd57a37f55a46940b45b241b1c16ee100927d1bd860d445a9de50d4c384d6e1d00108026c0ea5ebbf0b72fbf5c370bce18d3acbc46599099baae1d802f77333494a7ae130fe86e8f818f9261a2dadb4125229ba0ffc0e7090324430b521a90d224ab7a1024e1d893e7404fedb348e4d5e2235c59a7876a0fc60145c6a009687684460271ee133a437fe52fb6cfba97fcec161df515dde905a24da6d37bdc34044a955e682b47471ca1e8c78c51ed377cd4afa894bd9bd12e707156da0726f7cf5729fabe37216221507c5506ef59ece2a581c9d8b0b2074ab0e848ca6b7054d1841837e8791bd82715a28ab569a9a287a4f6490086b1c22169521cdc132212939c84a10896422170234cd82055a8c1c2e53a0e214938a97ed7cc8de0f4ed4b21b945b55e9eb0559ea858d43fc3113165ea18b7b893a5e326a5b0af475e27a54b207b41f92e33699060cb6704ab5690db57aa812cb9c24430644c3b3b2a44f2718a7df88abc4117b587deff78de9c73af28080b2fd05003e11d3e1b3299dc9521f8b513badb010", "4dfc4aedbedca830183d03ab9116849397919f338e53d9e270825d40aa9f1b3f", "f789d287aeef8dfed55e85d52cd892b028c0a6147c77346b7a807ceb9f050cc9", [], [], null, "4dfc4aedbedca830183d03ab9116849397919f338e53d9e270825d40aa9f1b3f", null, null, null, null, null, null],
+    ["050000800a27a726b4d0d6c21bfeb91b0b31691c03c2e825a597b8fb75bc562d654d62104640dd74e56cd14baaba565b84b845e163d1caef250153981637204f96a59c8e8024d9041b2029e94c15245f1a958840ba3f380a4d20f1184e77827de3ff8f0153459afe241f723c084823230e003d3d21e53501ec0499b083a7dad685c57127f4de64733a880c2db20752535163525263f664a35100000003f927b9469e18229d02c33dec3f117c5d2a8a85db9b5756dd52b8190db2596280fa21394377a4551c76d1f75ac03c262054dffd79a9ded05e888958199eea4501ccfa4152d445a6b308549efc1d9b2b97d39da90c6388be8052458325bfd2f5bf73741d5785837a6b844b474775718c29dd99084e9f88ef153a8329f532a690171c2d1e3074dfae3e23db3948a453c39481a9914dd0ac79e927360129be3a7f119544122000610bd2aacbd82325a59b95154ecd82c88d23abd1e20770ffb8aabf83fc0734964ccd411d1c935714e24aab566f4f08424014c4eca91b590f082b473f361c87415d37bd20d70fd0b52b6ddf1865f766702e32b05b3cf1630ee8597aae19633f3516a8555ac5be32c675be1817efbffd9369041a089c283f19649968c2498cde56f500434f280d77a9c62e43cbd3f136a4c6a00a43e6ed530cb2e8ae838860adc88aacc7bd6a00ae0c19ff4533a485efde082b5f4d1f7a8ebe7ed82b7b05a8cfe1e373459f1bdcbf9525747e8c9508a555facb798740e0bdf994d9739bbe5538a0ae0f076c582c0f5ba878b99b8249db1d7e95056c98af083d98cb0ed9e3f7436e1c7643766f966b83e999206ebd1393b9b2a7f414480fa017480069f85c7749c435ae2fba2ddc1038d547d84854817ef39635c29827aad86726c9ade3b265b9086c8b5b75ef56fe4bd8b4d62893895b3fd2734fdac464156d7e5ebc7ecf1d83b86f659637e3b142c164963b8cdcf4ba4f4035dffc5a789458847781918ac72fc18bbbf5110032e66d75b3171ef4b513290164a77b42b0a4cfb89639ab23845e1aa2a452f3731c8cb65082a622a7c2e0013ea47d0bdd42d6990466649a905c684c3251716d61f760d53de6e3f790fba7f5f1f4de267113bdfcd7422822330b32d58e6777765f22a4116344eeb65b2ec516393ab3751b5356d2b0c9500c0f3e469181035bc3660f0b8f9fbe6e40b5e89cb79b063714ca75e72e2e100a10d63bf784df0820ef25f8ef40fe5f05fb95683f9105ff3cb2d219ab76605a064f69219f1dc0d00b3b48642f970dc00cca4b8b43308be18286ec5a4288d600a3785cb622d468a4c6969b3792f2485027d0ad9aa4a9c2cc972f9ee5190a95b1eb058dddd8c08e7d753f5e011b2bcfee1d52c1c4f20aa3f712741fc093a1b36af555f74e30f85d5cc959307f7435f7ef04ca2c3125bcef2a990176ae339325d5a588da5796faae5bab7c82977c0ff797093e2c1f3a7782a6d39a61ee5528990d8d369e8edcfe38bb702dff02da3428545d9d6157a51e55ebca6a8506e3699a3d7085a4d9fed5094c68b375e984f68393300871e308fcf74e276b62266a8f4ee3945f094d17a7c07cfe0bfd4895a14fac971c92a195b442683c4956bbb195a4fa66dc9cd542c76b9150c84bf890789942f55c200b773ecdd7992cff3eca24de3e0984e10e68ae387534b96cde3792f135bf5f68787d370ca8c4c4074dc5d601ae90495437c3c2d48a3d966683ac05160b7a84eaa7aab74009e57a85f7bf68a2e482000f829c545073a15d5cd0fcc57439a4350eaf098dfb82a085ea8a4af6fa8381f0658819eab483f65b325d5aeda15232cfadec75ab1866e4c0155a9c74a7a57ccf34c483ac7da1588a1b6b9941f11040f94cf78fad89bf11fed69aa0d83105adacdd4e5f04a62424023c9b9e33c4fb7f12bdf21f07f265c537d51c6551f4617b915d21991839c3d0d36393d646e0a8a41509217d0e7d2ca1a0a0d677a3eaca23edeb07b74e652a0bc50c6c083a55d6c7306e74086f4768933aa24873681867a7893d77cb7f29b8c847c583f2d071a686616e206719f761ae39c110442e06163d2b84590360695d4e19849e634f24d9ad396c19ff83ce74f46e645f932e141a41195936c85d514414f112e60b1a2537c38d6dc6c4638305c9bd6c62e366bc63123e3e6dd36eedd3136fce8deeca2aa09a3298a39d83859efc9b2b69cf9a7dee08a98e4be558ac7912fdcb42209075420260f7cad0f2c01f2afe33073f26249d944f7a50dd84839bc3ea7fdee4ed71449cf07533d26e1e27a3efb032c3a3b34bd3092622d2062ae536ef5149c49b5bc9475eafab6e675761008b0daddeecaa604470bbe0fada255d290e92b190c2c2d8c2dee5455d1fa9a9f3db7779b584643464aa8014ba66994de25517f83980e66ee4f62314ae6dbef452d5d38b0a16f3991f36d8a8b39ddc0d5595eed98762878cdf3f4a2edc5cda77d5fe4faf63a15f568a540da57dd9beb6fb1a977ccb91b4d79cb39b28911a29e7bf028ac6103796dfb6b20967239ad373c3c51d3927f2380019fbdbdde59697322636a0aea1fd22c588575c0f89649e9f3ed393cccabba2e794b7c4b2daf8ddeb7f45270d3f95edba5b0de7a32819233b0c55350114ccbc481586fd0542c3a0afdd245228ac7474b3f549b103a0062df1bdae35be3f6a92dad6177cb848eee24c8520a330bdfb26d75fe7b4b365d094451222eae18b9849f5aa17e52ca5c71e844075cd44038e5c894ca2cd19765cf8f61b619af02456ae695962fe5e931a63b5c79052ecd333e18412db91e15f7cbc70b4cd7e8e3c951f358572e37767e7d52704a6721b30efc41017ae4d231558c5c82cc7dd7e3356c09dc24906f0438dfcc300856ac2ced8f77fa8015736c661e80248aeeb774874aa79d290b8f5027a0a509537fc7c689b7ad86116cfec2647ccaae1c74b416f3e6ae8f7cc60eaaf7b6a590d51544138e1732945603a53462c60e1f6cb0c9ca0390c488224c313269fcd59fcb611fb2d9b4c8fa601bb1cb8d07d797bf5de52bceeb02301c8962ac1fc0491dc81affd6c1ebf89a13d6f290eda5d5cef382215c5e951d71305ef33d9737126d0e662905f1250926f6a229990e38f69ad9a9192b302f26bdda465d90b94b12c57fa3fd6930083f184438d8a889d3f5ecea2c6d23d6736f2a0f18e26f4fa45d1be8f3dc4a707137e95d2ad594f6c03d24923067ae47fd6425efb9c1d504e6fd5575340945601fe806f5756acb562f13c0ca1d803a195c2ebb2ef02ac33e6a88dea075ba996d3c336648e8694d3a19d3dca531beb50d4327c5c0c23cb7cfdb08ca7cf2cac6bc139d0741473d376029cb4ab6bf054557ce294c728a4687d57ec8909ff51a4d02f9dcd11193d7d1c9fdae6a17396a1bf57a994934f5e7a59f045debeaff62ef326b947f2a8b49555e4d99b3bf5c81ff9fe314e047af152508f57015ca402c67d925c99acea3ee8cc4b008c5cb43966e714ef480fd05e07c7b2dda9aa3966113eaa293d3f622b309d64803ce1e6378b6aac4fab527c43cd45ed0a3c1a4b9fb18dcccfcdb6ac0c2421639cda0075a20dc5111b8d3d3199495bd9133dbab94541410e4fba92c7b606a5cb122f140cf1a3596f2788f3c8b92660f14cb65af5dd23dfdbac1371ecf4b33712fed2292c44f70834cf96c05d58827e69bfc2e696fa0874025e2c3d19b072020031513b1962ec540856cb189387cfbfcc0f7c68223cba47fb0c9b486e4d99171961f7675a8b46328a3bc109bf07c66d5ede771cc4c74ce80333829191eedc493508a644530a6144f22dcf97525a4cdca1ad71073b080b73ea4549f5401bff4318268e6ad637363157a19a53f123a0b0e16d0b77f02028da464100fde76d83dd0bb224ede28042290ab2bce854139bca36e5b2cbdfdd9106fc9f18b95553e4fe548b3e4a87daa7ef1ee38ee9b4e0dcd63e80ecbba7e74b3e3ba3d0e8a6392a062b8e065a54414c3c5bd9ce4e85ca6293e884d1456a4c31e1654ff23ef26e2e14e1298a49c072e22f9d98bb0f9b03bd5fd013fcef3ed6a49aeb98720254087ef728e319db964cea54d0eca76cfe56288b6f64f4a19df37ed17be812e82d7d40536f378a931c82cf7111d6e117809363809b6be378f8fd5a1ce22a8d3c4547abd959830aaaf013de2bf27a1fbae8b16f38d1349b6031ce02348a240579c0e535790458b4963b616933d1005c1d03d4c95180c8d17a55ef4bee465668b20ea4118ca5692e", "52611c9413df01e14a5640bb2d4913e2e0f6b24745446dca8da53072c5f96267", "14fdea928b575b89829b5c12af7a098ae4c702f781e3b63768b6964d10c53e1c", [787459282010655, 1685382316228727, 1715663111103469], ["656a", "650051526a", "526a5153005152516a"], 2, "1c58ae5ae1c88181e8e56fa181798be9578c348b886156d3c4874004ca72e2a7", "77e54f88127c3d1e87ec2358ecb5f59f29b1560bca76b67fe479faf481dd3eda", "3e9a1e9146bae8c7fbb82b28b5c64ede3f62899cd1c90351652dd061696ce8dd", null, "05c1c1a24aa231c78ec43bef5fc2dfc82077bb82c7c6ad17f694217bbb081541", "b0a30332951f96a8a59aa26208804b3e85ea6f66075f9c20cde67ebf253a25b4", null],
+    ["050000800a27a726b4d0d6c281836c3be99a081703a460e968aa7109870bbed17df5f888c8ca1467ae17dbbcde31c1105cb5bda88ac6c627000452ac52ac0ffe81ec58bf1e6d1bb7aaada41fba0bb588778a7f65202ad811ea73d26c74550395aff75325107c096a5251acac00650051a2e7424719a3d185b7e0a43a472e298ac0afdc5287d7ad124cd9405a62cd1ca08b282efef7f928df0852525251ac5353aceaa5ff1200000000", "a18e70a050335a432290412c2454557c2349856b73f95864203f567b59401d22", "0ab2a287e4f2183f67d3e548a2febe4b0bb7186646222ffe2053e82493e4756a", [1076763594431866, 316847576141144, 1780844721475339], ["006551ac65630053", "63520053", "acac00656a6351"], 2, "ab06772bae42fa5557a6f492df43cfc1f5f2eaaeaff2c279699c8357f68fa1b5", "4741085e9dbbc00084fcc4cb82ef4d4233ef298aac7d3cb0f5c55bce8a2c809d", "6871dab90f55dc66f59c439fd3e0ebf7831814f658662f5cb51f78574cb12dae", null, "381edefdeebc8ccabf11036f664e37d62fbab2c2536a98a24ab84e5a4b8311e7", "43b9a858c0f7fe8603ce256c0ce8cba4c1d6eedc155f7dae1734c7fd39083a5c", null],
+    ["050000800a27a726b4d0d6c257b85751235dbc100252e41e002931b45746198e5dd9571a56a7e0d423ff27989d3eb417ecd3c3093fb82c5658009624c53219a60cd0a8c4da367e29a71779a73032985a3d1fd03dd4d06e05566f3b84367cf0faee9b0963525200526a53acac5d82d0a602efabecef1bc70100020063977663550e760600016a00000309a89a5f40b37303e1816df13a9d7e20db159c9f42773a2fb023d95abb1e1cbe81c092edb230fa38ea13c5de7c0e5031a1e84daec3ebe62d5f6c4abe5ce90a3fcdc3a6500c011c8a0fc03db6cc0c56cfd6543aed33ac6b7c4db783dee6b329277f96c7e90bb9b47302465f375c1d3ca48e54facae0f9c2dd4d64d9046152b43634227fbe32f663bd1d90bbfa22f0e9c793477193ddcb40181a679eae7811323231f01f55c7ad04cfb63f7c4a3d0a2b0ffb0b05a6be055b8c94ca80bb0a1d13cd4cd69ab98304ae2515d5f7699d4abee5c20be609d873511012f234bd85a7eff5fb634cff2658ba6516048563095ecefb3015ee3f03ca52a177f261ecdc26bc089d34c6404846e9c647fcfe98cc6acdbb464f64278ad8ce9d1ae0d415bc0c05245fddaf4ebc8dc703a85cb270f796ad2d937e2ac0d5e0a34821758000aa59c9d4652485294ee0ab29696b21430fa54dcfbf2b9c49d142064209eeeed4d471ffc017d4e20a796b0927804c061b9f4a7091fe015ada68fd8442e01825c88dfe55cf5de38936f7ce25311b902ba97a3c12a95cfa1c3a591b818f60832709d9e4839e410fb36b84f3ac4f070fc35e161978259e5b8edc744d90919aa770bb36215128e582b59641e23852e958eb8fc3c0aa96152ba4f77f138d6a6712a3ae3226015883f81db23e583c869c4c71143a6fffd65e8dfdc50c99a2f1f314cdcc71359e235f1d7dc2b5f38ef7b970843163c03f9dd40a8015efdc8791956a3f3cedd9ea64f8efa7a0815a70381d71467817bd04ca529aede07ff60d176aed0f855a2eaea89eaeaca89358c081826a0812a5bca28be1373f086dbdba7e43e203212c9fed21474ba19a055ffcc179412e893a744832298c5fe24cc6b18667f49b34dfb12379267419a9cb9403d8167d8d1e91d2811a043b29243b069b37587847dc6fcddb1831bd1cc2567ca033ac40f74ab6955f683b12e4e8254e4ea760d38b3f46791c5c4cb12bc7ccb0ed1865f25d601c303f81fb1fa1db48533d3d6b288e4d9a4dff8ec21c96f578399710c825fe7e32f93a8c0743f9ebd54cc151c7610337aebf7e9b915720a54351d49ab8c22fa34998dcf583d4387361ef3ff86f50ec53f49249e4ad349603066fc9c661d69f911dfa7241c8d5792d78332e93db6593e593fd5d456abdac79a716fa6e3f3928a84d197086ecc27eac188ff2b71521762ad47bec08992d86850eb3ea13d5070807a2cb6680a249ea1c04203748daab9b0d3b3c2e9dcfe7760c79dda3c0259e7da9ccfa5fb647a5e20f3f3bc866da24eade36b683a2bd7197fb672726f42008b46ad7f8abdb18117f322c57dc017b0a371f4863135b4db5a1b6e0111e630e23459a748833991cff71a05c4ab19dd99771582d038104b7e039a376f7acbbeadb34f945beb9d7ca0e4e3d5c5e4eb1d8526ebd13dacb1ba35735c6d04a4555acf4bf117626500d77b38189dd4888041225acbe3874a4c0f607fe6745f9355b3fa188f1d65c09f389af1b9d6232aa79447919c550f6f31fec35481cb922de2db5b4da2f81948617028e321706a3a778c1938c443bb00e5b0ff06ad8ab9b1ab0c11477673f85df9561dbea45d5f9781ebe317a0710ae5461e34fe6f1b1aa9b4e67b14910984802c2a7e38193bc7bdc8ba3e4e3d1d933bfb580f5b3e87a2a06517051410fe1b4ff1ea0ade824f338515456a57c7a916a74388ee8f1281f9ade0ae2a2613a0612c469df792b8df4cae4fc25c1cadba95a807ce61e5a5303faaf9e14653996b5a8adc34fd475ef1499094babaf1f3f07da9a390b1d9fc9a08327987adfe9564863fbdfa8f6b46a8841583099afb7870118face76347e40b6fd8cd15582ae8e23be9a0219bc3e4e4546a30d3bbbbd1686086876be0e4c859be71fb58f4fab3d28c0b4f7e75ad1edb7f88946fb40cfa5786a0fcba1303c8347ecee93d46d140bb5f69531d666548b109ce764bead7c87bd4c876494de82db6e5073a6c94f7c099a40d7a31c4a04b69c9fccf3c7dd56f5544776c53b4df7953981d55a96a6dcff9904a90842e5bafec8840c2d255bf5ad61c460f98feb82a10fa1c099f62776798236c5ca7f1e46ebdb2b144d8713e56c772f2c3b860ea5b03a8854bc6e6590d63cc0ea54f10b73ba241bf74b635551a2aaca9687ac5269fd368b26d70a737f267685998a3f7d2637914909c746495d24c498635ef97ac66a400894c09f73488eb7cf33f6dad1666a05f91ad7757965c29936e7fa48d77e89ee0962f58c051d11d055fce204a562de68088a1b2648b8174cbcfc8b5b5cd077115afde1783f5cdb26f7bfdf87b21b1c70dc56bf1c82857a40ca2aa236ec566912d864937aa07ddffcd377395cba616d63c0b69c01fcc45391fd5b8763fb96d7ca333a127911b4ed95b00c24cb578ffab9f1116030048608cc990e74ebad5c348ad9a885e907e0be5a7883c88489cb41432dac862023d46789eb7d989af779e5b8d28305d7e2124d3b55770f8c050ab25e1a4602eb58cf1234eae15f33bbdece27a6b12db3e4dbfd3a2bfcc9ee6ed016c0f665be8133b7dc1d86044db0f9db40fb0e9f8bc2e4db5382a8b4f815b4e8434ad0dfbc51a5e9b145e1596cbf4670b7e05dfdafbb0cf3ddee28d76a82428e8aba4364e84bac379298df2932e69bb5d045516efc33ae6cc3947ceb09ed371667212a831b5485eafce8488188ea4e27d0cdf7ddd348abff777f4a13bbc716b6a5944ee727965690e209b49eb962c039975f939ed5c6e4c400d887759433d3ad716da0cb446113c7727a64b58c3f8a0f81189f98005233a81366aee73cec85228ebcfd5ee3c3fb44db76ba243f2842b7b5fc746ae51b0bc4bd4fc9fd833565ea852b92b224f6990318ad8c7d9437e20e2a1f20e818f9057c5abaaa2e5c15b94945cd424c28a5fa385dadfe4907b274d842707db3697a5ae6c8f542e5ecc07fe47350d1014670212efe81fb7c73e8450df814ef6232f7490f63ccf07480f884a66eaffc28fea448d7b401cdae10e7c0c7f9a7b15331969fc8cb36396773de191931c750f6ce5caaf29768ebb27dacc738056a8125b4772bf87ae10a8a309b9bd655043cfc3159494368c5ab8cadb7f671e9626bd263e31181a604b506a03b439a7ffe4355892477e2bdf338c62c3922f7d3c9a56c7103d911948a84b5ae2dbb16a3761add053a0f967e6b5bc94211b6547153267c6ee1cad0d974a71088583735e4f63d33156dadd54c2faf89114a127b97b94cc2a22ef303f459d04fc0b53ace5918d47ff33a558bd71a75f355fbd06bbccf4e02c3c0a4b63d0cc949801d63a64cb2d32373b2c7b274ab2db4682142c8b21d84c481f5ef21e4b5e3603451bf94774d0ef47f63fa6abb78d21c193cbe65b695fe67423c1e2d312e2776fa24ece84683e74876c55ea0369e4ea0e86494e00dde236a1689731f0a5d8203afde5c423640b81e4f631c981c03839f4b44c9e8030023f8b9d8178560daf975111955a2bca3423eeefc527be3a8543eb90a5ec02f35c7c64b7dd59a72da0074634e01d2abf3637add77c7350f12b011b294168ec75576e47d169e3938bf6ae2aa8ff7cfba7cacb1f92b6e4c2497bffa9f17cad242fa9c3179c1a3aa81f7361649572c715c25a1f6cd5ace82c00ab2342b9c3cb4fffdda160ca5ab9e9baf2139ef9afbe1b1f309462afce462a79bb9698e22c957c590a753a76b87e009121e06f6a1bf62a08bf435d92e2fffe86e2a9cbba9133a68e4aebf33c38436f2545fc2d52832d165af415b244adc5f57377deedf460aa3beb43419c6b082e835cee2f16f2f8767f03d9f42a84a76cb6867b2bc75baeeccafe61519cfceac5527961b324dce09335a5853a6b4da3e471fc1fb196f76d9b879c7200862ead18dea1f3ec9037f37b6ea289166510b475b20044d452e0f6ec3ab47161507d53a2dc60949f1e450c3eadaef886e6b827c5bb5ef11f4028a704fc5a9382c6b03e7d8081e07989286a0d9ce561faa1b6e9623d7ab71007fd277b986a048834602eaf8780f0675baae68415d3af01019b5ea480dce9362ec8d5df3e780ffa72eba8a8df73c540870a839bb03910a491770e1c84b223ee9165270c4ccf6fc7075c37e6fbb14381507fa18f13953336ab2bedc600c615bd49927e9d7f4884e6ed3fd5e4b7c38", "a0e72c5c73cfb3ff890b27e348163d8a2180d432b4824db72fac3080bf4eb45b", "a68ea6bf38497891ddb3e31eb9b543cecfebb760113c920072fa6a5a97efd8b3", [1399781968202734, 1999413718097392], ["005300", "535152526552005363"], 1, "a1cd8a34fb7cf52a01451fe406d36ef58020d9d26ef97564b5cd2181452319a8", "d5b4f35d036a621a1490da64b12dda6ab44eb12d38c9c170112d5548e92d750b", "87f6e51b26da2f78101ca27c68d7de802f116c5add6d464f3949ec6a6ff08aef", "76ccd15dba439ed72f7c5f21bf88e8dbd821c09148df1ca5fb79daf5f94fa59b", "6a66cd575a2dabf83dc8e97726daa4ba293833dc04d88d54965ad24e9a835422", "e20b1fde306f54e7b6859aaa44d8195eef08b49e3a17e1776e0f9bdf31bf9714", "bf24071a4ad945f36eaac3948083052ff5fd53ba6afc3607d42da191fdb5ac39"]
+]
diff --git a/depend/zcash/src/test/dbwrapper_tests.cpp b/depend/zcash/src/test/dbwrapper_tests.cpp
new file mode 100644
index 000000000..611311379
--- /dev/null
+++ b/depend/zcash/src/test/dbwrapper_tests.cpp
@@ -0,0 +1,234 @@
+// Copyright (c) 2018 The Zcash developers
+// Copyright (c) 2012-2017 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "dbwrapper.h"
+#include "uint256.h"
+#include "random.h"
+#include "test/test_bitcoin.h"
+
+#include <boost/assign/std/vector.hpp> // for 'operator+=()'
+#include <boost/assert.hpp>
+#include <boost/test/unit_test.hpp>
+                    
+using namespace std;
+using namespace boost::assign; // bring 'operator+=()' into scope
+using namespace fs;
+         
+// Test if a string consists entirely of null characters
+bool is_null_key(const vector<unsigned char>& key) {
+    bool isnull = true;
+
+    for (unsigned int i = 0; i < key.size(); i++)
+        isnull &= (key[i] == '\x00');
+
+    return isnull;
+}
+ 
+BOOST_FIXTURE_TEST_SUITE(dbwrapper_tests, BasicTestingSetup)
+                       
+BOOST_AUTO_TEST_CASE(dbwrapper)
+{
+    {
+        path ph = temp_directory_path() / unique_path();
+        CDBWrapper dbw(ph, (1 << 20), true, false);
+        char key = 'k';
+        uint256 in = GetRandHash();
+        uint256 res;
+
+        BOOST_CHECK(dbw.Write(key, in));
+        BOOST_CHECK(dbw.Read(key, res));
+        BOOST_CHECK_EQUAL(res.ToString(), in.ToString());
+    }
+}
+
+// Test batch operations
+BOOST_AUTO_TEST_CASE(dbwrapper_batch)
+{
+    {
+        path ph = temp_directory_path() / unique_path();
+        CDBWrapper dbw(ph, (1 << 20), true, false);
+
+        char key = 'i';
+        uint256 in = GetRandHash();
+        char key2 = 'j';
+        uint256 in2 = GetRandHash();
+        char key3 = 'k';
+        uint256 in3 = GetRandHash();
+
+        uint256 res;
+        CDBBatch batch(dbw);
+
+        batch.Write(key, in);
+        batch.Write(key2, in2);
+        batch.Write(key3, in3);
+
+        // Remove key3 before it's even been written
+        batch.Erase(key3);
+
+        dbw.WriteBatch(batch);
+
+        BOOST_CHECK(dbw.Read(key, res));
+        BOOST_CHECK_EQUAL(res.ToString(), in.ToString());
+        BOOST_CHECK(dbw.Read(key2, res));
+        BOOST_CHECK_EQUAL(res.ToString(), in2.ToString());
+
+        // key3 should've never been written
+        BOOST_CHECK(dbw.Read(key3, res) == false);
+    }
+}
+
+BOOST_AUTO_TEST_CASE(dbwrapper_iterator)
+{
+    {
+        path ph = temp_directory_path() / unique_path();
+        CDBWrapper dbw(ph, (1 << 20), true, false);
+
+        // The two keys are intentionally chosen for ordering
+        char key = 'j';
+        uint256 in = GetRandHash();
+        BOOST_CHECK(dbw.Write(key, in));
+        char key2 = 'k';
+        uint256 in2 = GetRandHash();
+        BOOST_CHECK(dbw.Write(key2, in2));
+
+        boost::scoped_ptr<CDBIterator> it(const_cast<CDBWrapper*>(&dbw)->NewIterator());
+
+        // Be sure to seek past any earlier key (if it exists)
+        it->Seek(key);
+
+        char key_res;
+        uint256 val_res;
+
+        it->GetKey(key_res);
+        it->GetValue(val_res);
+        BOOST_CHECK_EQUAL(key_res, key);
+        BOOST_CHECK_EQUAL(val_res.ToString(), in.ToString());
+
+        it->Next();
+
+        it->GetKey(key_res);
+        it->GetValue(val_res);
+        BOOST_CHECK_EQUAL(key_res, key2);
+        BOOST_CHECK_EQUAL(val_res.ToString(), in2.ToString());
+
+        it->Next();
+        BOOST_CHECK_EQUAL(it->Valid(), false);
+    }
+}
+
+BOOST_AUTO_TEST_CASE(iterator_ordering)
+{
+    path ph = temp_directory_path() / unique_path();
+    CDBWrapper dbw(ph, (1 << 20), true, false);
+    for (int x=0x00; x<256; ++x) {
+        uint8_t key = x;
+        uint32_t value = x*x;
+        BOOST_CHECK(dbw.Write(key, value));
+    }
+
+    boost::scoped_ptr<CDBIterator> it(const_cast<CDBWrapper*>(&dbw)->NewIterator());
+    for (int seek_start : {0x00, 0x80}) {
+        it->Seek((uint8_t)seek_start);
+        for (int x=seek_start; x<256; ++x) {
+            uint8_t key;
+            uint32_t value;
+            BOOST_CHECK(it->Valid());
+            if (!it->Valid()) // Avoid spurious errors about invalid iterator's key and value in case of failure
+                break;
+            BOOST_CHECK(it->GetKey(key));
+            BOOST_CHECK(it->GetValue(value));
+            BOOST_CHECK_EQUAL(key, x);
+            BOOST_CHECK_EQUAL(value, x*x);
+            it->Next();
+        }
+        BOOST_CHECK(!it->Valid());
+    }
+}
+
+struct StringContentsSerializer {
+    // Used to make two serialized objects the same while letting them have different lengths
+    // This is a terrible idea
+    string str;
+    StringContentsSerializer() {}
+    StringContentsSerializer(const string& inp) : str(inp) {}
+
+    StringContentsSerializer& operator+=(const string& s) {
+        str += s;
+        return *this;
+    }
+    StringContentsSerializer& operator+=(const StringContentsSerializer& s) { return *this += s.str; }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        if (ser_action.ForRead()) {
+            str.clear();
+            char c = 0;
+            while (true) {
+                try {
+                    READWRITE(c);
+                    str.push_back(c);
+                } catch (const std::ios_base::failure& e) {
+                    break;
+                }
+            }
+        } else {
+            for (size_t i = 0; i < str.size(); i++)
+                READWRITE(str[i]);
+        }
+    }
+};
+
+BOOST_AUTO_TEST_CASE(iterator_string_ordering)
+{
+    char buf[10];
+
+    path ph = temp_directory_path() / unique_path();
+    CDBWrapper dbw(ph, (1 << 20), true, false);
+    for (int x=0x00; x<10; ++x) {
+        for (int y = 0; y < 10; y++) {
+            int n = snprintf(buf, sizeof(buf), "%d", x);
+            assert(n > 0 && n < sizeof(buf));
+            StringContentsSerializer key(buf);
+            for (int z = 0; z < y; z++)
+                key += key;
+            uint32_t value = x*x;
+            BOOST_CHECK(dbw.Write(key, value));
+        }
+    }
+
+    boost::scoped_ptr<CDBIterator> it(const_cast<CDBWrapper*>(&dbw)->NewIterator());
+    for (int seek_start : {0, 5}) {
+        int n = snprintf(buf, sizeof(buf), "%d", seek_start);
+        assert(n > 0 && n < sizeof(buf));
+        StringContentsSerializer seek_key(buf);
+        it->Seek(seek_key);
+        for (int x=seek_start; x<10; ++x) {
+            for (int y = 0; y < 10; y++) {
+                int n = snprintf(buf, sizeof(buf), "%d", x);
+                assert(n > 0 && n < sizeof(buf));
+                string exp_key(buf);
+                for (int z = 0; z < y; z++)
+                    exp_key += exp_key;
+                StringContentsSerializer key;
+                uint32_t value;
+                BOOST_CHECK(it->Valid());
+                if (!it->Valid()) // Avoid spurious errors about invalid iterator's key and value in case of failure
+                    break;
+                BOOST_CHECK(it->GetKey(key));
+                BOOST_CHECK(it->GetValue(value));
+                BOOST_CHECK_EQUAL(key.str, exp_key);
+                BOOST_CHECK_EQUAL(value, x*x);
+                it->Next();
+            }
+        }
+        BOOST_CHECK(!it->Valid());
+    }
+}
+
+
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/equihash_tests.cpp b/depend/zcash/src/test/equihash_tests.cpp
new file mode 100644
index 000000000..c6899dfe0
--- /dev/null
+++ b/depend/zcash/src/test/equihash_tests.cpp
@@ -0,0 +1,235 @@
+// Copyright (c) 2016 Jack Grigg
+// Copyright (c) 2016 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#if defined(HAVE_CONFIG_H)
+#include "config/bitcoin-config.h"
+#endif
+
+#include "arith_uint256.h"
+#include "crypto/sha256.h"
+#include "crypto/equihash.h"
+#include "test/test_bitcoin.h"
+#include "uint256.h"
+
+#include "librustzcash.h"
+
+#include <sstream>
+#include <set>
+#include <vector>
+
+#include <boost/test/unit_test.hpp>
+
+BOOST_FIXTURE_TEST_SUITE(equihash_tests, BasicTestingSetup)
+
+void PrintSolution(std::stringstream &strm, std::vector<uint32_t> soln) {
+    strm << "  {";
+    const char* separator = "";
+    for (uint32_t index : soln) {
+        strm << separator << index;
+        separator = ", ";
+    }
+    strm << "}";
+}
+
+void PrintSolutions(std::stringstream &strm, std::set<std::vector<uint32_t>> solns) {
+    strm << "{";
+    const char* soln_separator = "";
+    for (std::vector<uint32_t> soln : solns) {
+        strm << soln_separator << "\n";
+        soln_separator = ",";
+        PrintSolution(strm, soln);
+    }
+    strm << "\n}";
+}
+
+#ifdef ENABLE_MINING
+void TestEquihashSolvers(unsigned int n, unsigned int k, const std::string &I, const arith_uint256 &nonce, const std::set<std::vector<uint32_t>> &solns) {
+    size_t cBitLen { n/(k+1) };
+    eh_HashState state;
+    EhInitialiseState(n, k, state);
+    uint256 V = ArithToUint256(nonce);
+    BOOST_TEST_MESSAGE("Running solver: n = " << n << ", k = " << k << ", I = " << I << ", V = " << V.GetHex());
+    state.Update((unsigned char*)&I[0], I.size());
+    state.Update(V.begin(), V.size());
+
+    // First test the basic solver
+    std::set<std::vector<uint32_t>> ret;
+    std::function<bool(std::vector<unsigned char>)> validBlock =
+            [&ret, cBitLen](std::vector<unsigned char> soln) {
+        ret.insert(GetIndicesFromMinimal(soln, cBitLen));
+        return false;
+    };
+    EhBasicSolveUncancellable(n, k, state, validBlock);
+    BOOST_TEST_MESSAGE("[Basic] Number of solutions: " << ret.size());
+    std::stringstream strm;
+    PrintSolutions(strm, ret);
+    BOOST_TEST_MESSAGE(strm.str());
+    BOOST_CHECK(ret == solns);
+
+    // The optimised solver should have the exact same result
+    std::set<std::vector<uint32_t>> retOpt;
+    std::function<bool(std::vector<unsigned char>)> validBlockOpt =
+            [&retOpt, cBitLen](std::vector<unsigned char> soln) {
+        retOpt.insert(GetIndicesFromMinimal(soln, cBitLen));
+        return false;
+    };
+    EhOptimisedSolveUncancellable(n, k, state, validBlockOpt);
+    BOOST_TEST_MESSAGE("[Optimised] Number of solutions: " << retOpt.size());
+    strm.str("");
+    PrintSolutions(strm, retOpt);
+    BOOST_TEST_MESSAGE(strm.str());
+    BOOST_CHECK(retOpt == solns);
+    BOOST_CHECK(retOpt == ret);
+}
+#endif
+
+void TestEquihashValidator(unsigned int n, unsigned int k, const std::string &I, const arith_uint256 &nonce, std::vector<uint32_t> soln, bool expected) {
+    size_t cBitLen { n/(k+1) };
+    auto minimal = GetMinimalFromIndices(soln, cBitLen);
+
+    uint256 V = ArithToUint256(nonce);
+    BOOST_TEST_MESSAGE("Running validator: n = " << n << ", k = " << k << ", I = " << I << ", V = " << V.GetHex() << ", expected = " << expected << ", soln =");
+    std::stringstream strm;
+    PrintSolution(strm, soln);
+    BOOST_TEST_MESSAGE(strm.str());
+
+    bool isValid = librustzcash_eh_isvalid(
+        n, k,
+        (unsigned char*)&I[0], I.size(),
+        V.begin(), V.size(),
+        minimal.data(), minimal.size());
+    BOOST_CHECK(isValid == expected);
+}
+
+#ifdef ENABLE_MINING
+BOOST_AUTO_TEST_CASE(solver_testvectors) {
+    TestEquihashSolvers(96, 5, "block header", 0, {
+  {976, 126621, 100174, 123328, 38477, 105390, 38834, 90500, 6411, 116489, 51107, 129167, 25557, 92292, 38525, 56514, 1110, 98024, 15426, 74455, 3185, 84007, 24328, 36473, 17427, 129451, 27556, 119967, 31704, 62448, 110460, 117894},
+  {1008, 18280, 34711, 57439, 3903, 104059, 81195, 95931, 58336, 118687, 67931, 123026, 64235, 95595, 84355, 122946, 8131, 88988, 45130, 58986, 59899, 78278, 94769, 118158, 25569, 106598, 44224, 96285, 54009, 67246, 85039, 127667},
+  {1278, 107636, 80519, 127719, 19716, 130440, 83752, 121810, 15337, 106305, 96940, 117036, 46903, 101115, 82294, 118709, 4915, 70826, 40826, 79883, 37902, 95324, 101092, 112254, 15536, 68760, 68493, 125640, 67620, 108562, 68035, 93430},
+  {3976, 108868, 80426, 109742, 33354, 55962, 68338, 80112, 26648, 28006, 64679, 130709, 41182, 126811, 56563, 129040, 4013, 80357, 38063, 91241, 30768, 72264, 97338, 124455, 5607, 36901, 67672, 87377, 17841, 66985, 77087, 85291},
+  {5970, 21862, 34861, 102517, 11849, 104563, 91620, 110653, 7619, 52100, 21162, 112513, 74964, 79553, 105558, 127256, 21905, 112672, 81803, 92086, 43695, 97911, 66587, 104119, 29017, 61613, 97690, 106345, 47428, 98460, 53655, 109002}
+                });
+    TestEquihashSolvers(96, 5, "block header", 1, {
+  {1911, 96020, 94086, 96830, 7895, 51522, 56142, 62444, 15441, 100732, 48983, 64776, 27781, 85932, 101138, 114362, 4497, 14199, 36249, 41817, 23995, 93888, 35798, 96337, 5530, 82377, 66438, 85247, 39332, 78978, 83015, 123505}
+                });
+    TestEquihashSolvers(96, 5, "block header", 2, {
+  {165, 27290, 87424, 123403, 5344, 35125, 49154, 108221, 8882, 90328, 77359, 92348, 54692, 81690, 115200, 121929, 18968, 122421, 32882, 128517, 56629, 88083, 88022, 102461, 35665, 62833, 95988, 114502, 39965, 119818, 45010, 94889}
+                });
+    TestEquihashSolvers(96, 5, "block header", 10, {
+  {1855, 37525, 81472, 112062, 11831, 38873, 45382, 82417, 11571, 47965, 71385, 119369, 13049, 64810, 26995, 34659, 6423, 67533, 88972, 105540, 30672, 80244, 39493, 94598, 17858, 78496, 35376, 118645, 50186, 51838, 70421, 103703},
+  {3671, 125813, 31502, 78587, 25500, 83138, 74685, 98796, 8873, 119842, 21142, 55332, 25571, 122204, 31433, 80719, 3955, 49477, 4225, 129562, 11837, 21530, 75841, 120644, 4653, 101217, 19230, 113175, 16322, 24384, 21271, 96965}
+                });
+    TestEquihashSolvers(96, 5, "block header", 11, {
+  {2570, 20946, 61727, 130667, 16426, 62291, 107177, 112384, 18464, 125099, 120313, 127545, 35035, 73082, 118591, 120800, 13800, 32837, 23607, 86516, 17339, 114578, 22053, 85510, 14913, 42826, 25168, 121262, 33673, 114773, 77592, 83471}
+                });
+
+    TestEquihashSolvers(96, 5, "Equihash is an asymmetric PoW based on the Generalised Birthday problem.", 0, {
+  {3130, 83179, 30454, 107686, 71240, 88412, 109700, 114639, 10024, 32706, 38019, 113013, 18399, 92942, 21094, 112263, 4146, 30807, 10631, 73192, 22216, 90216, 45581, 125042, 11256, 119455, 93603, 110112, 59851, 91545, 97403, 111102},
+  {3822, 35317, 47508, 119823, 37652, 117039, 69087, 72058, 13147, 111794, 65435, 124256, 22247, 66272, 30298, 108956, 13157, 109175, 37574, 50978, 31258, 91519, 52568, 107874, 14999, 103687, 27027, 109468, 36918, 109660, 42196, 100424}
+                });
+    TestEquihashSolvers(96, 5, "Equihash is an asymmetric PoW based on the Generalised Birthday problem.", 1, {
+  {2261, 15185, 36112, 104243, 23779, 118390, 118332, 130041, 32642, 69878, 76925, 80080, 45858, 116805, 92842, 111026, 15972, 115059, 85191, 90330, 68190, 122819, 81830, 91132, 23460, 49807, 52426, 80391, 69567, 114474, 104973, 122568},
+  {16700, 46276, 21232, 43153, 22398, 58511, 47922, 71816, 23370, 26222, 39248, 40137, 65375, 85794, 69749, 73259, 23599, 72821, 42250, 52383, 35267, 75893, 52152, 57181, 27137, 101117, 45804, 92838, 29548, 29574, 37737, 113624}
+                });
+    TestEquihashSolvers(96, 5, "Equihash is an asymmetric PoW based on the Generalised Birthday problem.", 2, {
+  {6005, 59843, 55560, 70361, 39140, 77856, 44238, 57702, 32125, 121969, 108032, 116542, 37925, 75404, 48671, 111682, 6937, 93582, 53272, 77545, 13715, 40867, 73187, 77853, 7348, 70313, 24935, 24978, 25967, 41062, 58694, 110036}
+                });
+    TestEquihashSolvers(96, 5, "Equihash is an asymmetric PoW based on the Generalised Birthday problem.", 10, {
+  {968, 90691, 70664, 112581, 17233, 79239, 66772, 92199, 27801, 44198, 58712, 122292, 28227, 126747, 70925, 118108, 2876, 76082, 39335, 113764, 26643, 60579, 50853, 70300, 19640, 31848, 28672, 87870, 33574, 50308, 40291, 61593},
+  {1181, 61261, 75793, 96302, 36209, 113590, 79236, 108781, 8275, 106510, 11877, 74550, 45593, 80595, 71247, 95783, 2991, 99117, 56413, 71287, 10235, 68286, 22016, 104685, 51588, 53344, 56822, 63386, 63527, 75772, 93100, 108542},
+  {2229, 30387, 14573, 115700, 20018, 124283, 84929, 91944, 26341, 64220, 69433, 82466, 29778, 101161, 59334, 79798, 2533, 104985, 50731, 111094, 10619, 80909, 15555, 119911, 29028, 42966, 51958, 86784, 34561, 97709, 77126, 127250},
+  {15465, 59017, 93851, 112478, 24940, 128791, 26154, 107289, 24050, 78626, 51948, 111573, 35117, 113754, 36317, 67606, 21508, 91486, 28293, 126983, 23989, 39722, 60567, 97243, 26720, 56243, 60444, 107530, 40329, 56467, 91943, 93737}
+                });
+    TestEquihashSolvers(96, 5, "Equihash is an asymmetric PoW based on the Generalised Birthday problem.", 11, {
+  {1120, 77433, 58243, 76860, 11411, 96068, 13150, 35878, 15049, 88928, 20101, 104706, 29215, 73328, 39498, 83529, 9233, 124174, 66731, 97423, 10823, 92444, 25647, 127742, 12207, 46292, 22018, 120758, 14411, 46485, 21828, 57591}
+                });
+
+    TestEquihashSolvers(96, 5, "Test case with 3+-way collision in the final round.", 0x07f0, {
+  {1162, 129543, 57488, 82745, 18311, 115612, 20603, 112899, 5635, 103373, 101651, 125986, 52160, 70847, 65152, 101720, 5810, 43165, 64589, 105333, 11347, 63836, 55495, 96392, 40767, 81019, 53976, 94184, 41650, 114374, 45109, 57038},
+  {2321, 121781, 36792, 51959, 21685, 67596, 27992, 59307, 13462, 118550, 37537, 55849, 48994, 58515, 78703, 100100, 11189, 98120, 45242, 116128, 33260, 47351, 61550, 116649, 11927, 20590, 35907, 107966, 28779, 57407, 54793, 104108},
+  {2321, 121781, 36792, 51959, 21685, 67596, 27992, 59307, 13462, 118550, 37537, 55849, 48994, 78703, 58515, 100100, 11189, 98120, 45242, 116128, 33260, 47351, 61550, 116649, 11927, 20590, 35907, 107966, 28779, 57407, 54793, 104108},
+  {2321, 121781, 36792, 51959, 21685, 67596, 27992, 59307, 13462, 118550, 37537, 55849, 48994, 100100, 58515, 78703, 11189, 98120, 45242, 116128, 33260, 47351, 61550, 116649, 11927, 20590, 35907, 107966, 28779, 57407, 54793, 104108},
+  {4488, 83544, 24912, 62564, 43206, 62790, 68462, 125162, 6805, 8886, 46937, 54588, 15509, 126232, 19426, 27845, 5959, 56839, 38806, 102580, 11255, 63258, 23442, 39750, 13022, 22271, 24110, 52077, 17422, 124996, 35725, 101509},
+  {8144, 33053, 33933, 77498, 21356, 110495, 42805, 116575, 27360, 48574, 100682, 102629, 50754, 64608, 96899, 120978, 11924, 74422, 49240, 106822, 12787, 68290, 44314, 50005, 38056, 49716, 83299, 95307, 41798, 82309, 94504, 96161}
+                });
+}
+#endif
+
+BOOST_AUTO_TEST_CASE(validator_testvectors) {
+    // Original valid solution
+    TestEquihashValidator(96, 5, "Equihash is an asymmetric PoW based on the Generalised Birthday problem.", 1,
+  {2261, 15185, 36112, 104243, 23779, 118390, 118332, 130041, 32642, 69878, 76925, 80080, 45858, 116805, 92842, 111026, 15972, 115059, 85191, 90330, 68190, 122819, 81830, 91132, 23460, 49807, 52426, 80391, 69567, 114474, 104973, 122568},
+                true);
+    // Change one index
+    TestEquihashValidator(96, 5, "Equihash is an asymmetric PoW based on the Generalised Birthday problem.", 1,
+  {2262, 15185, 36112, 104243, 23779, 118390, 118332, 130041, 32642, 69878, 76925, 80080, 45858, 116805, 92842, 111026, 15972, 115059, 85191, 90330, 68190, 122819, 81830, 91132, 23460, 49807, 52426, 80391, 69567, 114474, 104973, 122568},
+                false);
+    // Swap two arbitrary indices
+    TestEquihashValidator(96, 5, "Equihash is an asymmetric PoW based on the Generalised Birthday problem.", 1,
+  {45858, 15185, 36112, 104243, 23779, 118390, 118332, 130041, 32642, 69878, 76925, 80080, 2261, 116805, 92842, 111026, 15972, 115059, 85191, 90330, 68190, 122819, 81830, 91132, 23460, 49807, 52426, 80391, 69567, 114474, 104973, 122568},
+                false);
+    // Reverse the first pair of indices
+    TestEquihashValidator(96, 5, "Equihash is an asymmetric PoW based on the Generalised Birthday problem.", 1,
+  {15185, 2261, 36112, 104243, 23779, 118390, 118332, 130041, 32642, 69878, 76925, 80080, 45858, 116805, 92842, 111026, 15972, 115059, 85191, 90330, 68190, 122819, 81830, 91132, 23460, 49807, 52426, 80391, 69567, 114474, 104973, 122568},
+                false);
+    // Swap the first and second pairs of indices
+    TestEquihashValidator(96, 5, "Equihash is an asymmetric PoW based on the Generalised Birthday problem.", 1,
+  {36112, 104243, 2261, 15185, 23779, 118390, 118332, 130041, 32642, 69878, 76925, 80080, 45858, 116805, 92842, 111026, 15972, 115059, 85191, 90330, 68190, 122819, 81830, 91132, 23460, 49807, 52426, 80391, 69567, 114474, 104973, 122568},
+                false);
+    // Swap the second-to-last and last pairs of indices
+    TestEquihashValidator(96, 5, "Equihash is an asymmetric PoW based on the Generalised Birthday problem.", 1,
+  {2261, 15185, 36112, 104243, 23779, 118390, 118332, 130041, 32642, 69878, 76925, 80080, 45858, 116805, 92842, 111026, 15972, 115059, 85191, 90330, 68190, 122819, 81830, 91132, 23460, 49807, 52426, 80391, 104973, 122568, 69567, 114474},
+                false);
+    // Swap the first half and second half
+    TestEquihashValidator(96, 5, "Equihash is an asymmetric PoW based on the Generalised Birthday problem.", 1,
+  {15972, 115059, 85191, 90330, 68190, 122819, 81830, 91132, 23460, 49807, 52426, 80391, 69567, 114474, 104973, 122568, 2261, 15185, 36112, 104243, 23779, 118390, 118332, 130041, 32642, 69878, 76925, 80080, 45858, 116805, 92842, 111026},
+                false);
+    // Sort the indices
+    TestEquihashValidator(96, 5, "Equihash is an asymmetric PoW based on the Generalised Birthday problem.", 1,
+  {2261, 15185, 15972, 23460, 23779, 32642, 36112, 45858, 49807, 52426, 68190, 69567, 69878, 76925, 80080, 80391, 81830, 85191, 90330, 91132, 92842, 104243, 104973, 111026, 114474, 115059, 116805, 118332, 118390, 122568, 122819, 130041},
+                false);
+    // Duplicate indices
+    TestEquihashValidator(96, 5, "Equihash is an asymmetric PoW based on the Generalised Birthday problem.", 1,
+  {2261, 2261, 15185, 15185, 36112, 36112, 104243, 104243, 23779, 23779, 118390, 118390, 118332, 118332, 130041, 130041, 32642, 32642, 69878, 69878, 76925, 76925, 80080, 80080, 45858, 45858, 116805, 116805, 92842, 92842, 111026, 111026},
+                false);
+    // Duplicate first half
+    TestEquihashValidator(96, 5, "Equihash is an asymmetric PoW based on the Generalised Birthday problem.", 1,
+  {2261, 15185, 36112, 104243, 23779, 118390, 118332, 130041, 32642, 69878, 76925, 80080, 45858, 116805, 92842, 111026, 2261, 15185, 36112, 104243, 23779, 118390, 118332, 130041, 32642, 69878, 76925, 80080, 45858, 116805, 92842, 111026},
+                false);
+}
+
+BOOST_AUTO_TEST_CASE(validator_allbitsmatter) {
+    // Initialize the state according to one of the test vectors above.
+    unsigned int n = 96;
+    unsigned int k = 5;
+    uint256 V = ArithToUint256(1);
+    std::string I = "Equihash is an asymmetric PoW based on the Generalised Birthday problem.";
+
+    // Encode the correct solution.
+    std::vector<uint32_t> soln = {2261, 15185, 36112, 104243, 23779, 118390, 118332, 130041, 32642, 69878, 76925, 80080, 45858, 116805, 92842, 111026, 15972, 115059, 85191, 90330, 68190, 122819, 81830, 91132, 23460, 49807, 52426, 80391, 69567, 114474, 104973, 122568};
+    size_t cBitLen { n/(k+1) };
+    std::vector<unsigned char> sol_char = GetMinimalFromIndices(soln, cBitLen);
+
+    // Prove that the solution is valid.
+    BOOST_CHECK(librustzcash_eh_isvalid(
+        n, k,
+        (unsigned char*)&I[0], I.size(),
+        V.begin(), V.size(),
+        sol_char.data(), sol_char.size()));
+
+    // Changing any single bit of the encoded solution should make it invalid.
+    for (size_t i = 0; i < sol_char.size() * 8; i++) {
+        std::vector<unsigned char> mutated = sol_char;
+        mutated.at(i/8) ^= (1 << (i % 8));
+        BOOST_CHECK(!librustzcash_eh_isvalid(
+            n, k,
+            (unsigned char*)&I[0], I.size(),
+            V.begin(), V.size(),
+            mutated.data(), mutated.size()));
+    }
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/getarg_tests.cpp b/depend/zcash/src/test/getarg_tests.cpp
new file mode 100644
index 000000000..31c6803c1
--- /dev/null
+++ b/depend/zcash/src/test/getarg_tests.cpp
@@ -0,0 +1,161 @@
+// Copyright (c) 2012-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "util.h"
+#include "test/test_bitcoin.h"
+
+#include <string>
+#include <vector>
+
+#include <boost/algorithm/string.hpp>
+#include <boost/test/unit_test.hpp>
+
+BOOST_FIXTURE_TEST_SUITE(getarg_tests, BasicTestingSetup)
+
+static void ResetArgs(const std::string& strArg)
+{
+    std::vector<std::string> vecArg;
+    if (strArg.size())
+      boost::split(vecArg, strArg, boost::is_space(), boost::token_compress_on);
+
+    // Insert dummy executable name:
+    vecArg.insert(vecArg.begin(), "testbitcoin");
+
+    // Convert to char*:
+    std::vector<const char*> vecChar;
+    for (std::string& s : vecArg)
+        vecChar.push_back(s.c_str());
+
+    ParseParameters(vecChar.size(), &vecChar[0]);
+}
+
+BOOST_AUTO_TEST_CASE(boolarg)
+{
+    ResetArgs("-foo");
+    BOOST_CHECK(GetBoolArg("-foo", false));
+    BOOST_CHECK(GetBoolArg("-foo", true));
+
+    BOOST_CHECK(!GetBoolArg("-fo", false));
+    BOOST_CHECK(GetBoolArg("-fo", true));
+
+    BOOST_CHECK(!GetBoolArg("-fooo", false));
+    BOOST_CHECK(GetBoolArg("-fooo", true));
+
+    ResetArgs("-foo=0");
+    BOOST_CHECK(!GetBoolArg("-foo", false));
+    BOOST_CHECK(!GetBoolArg("-foo", true));
+
+    ResetArgs("-foo=1");
+    BOOST_CHECK(GetBoolArg("-foo", false));
+    BOOST_CHECK(GetBoolArg("-foo", true));
+
+    // New 0.6 feature: auto-map -nosomething to !-something:
+    ResetArgs("-nofoo");
+    BOOST_CHECK(!GetBoolArg("-foo", false));
+    BOOST_CHECK(!GetBoolArg("-foo", true));
+
+    ResetArgs("-nofoo=1");
+    BOOST_CHECK(!GetBoolArg("-foo", false));
+    BOOST_CHECK(!GetBoolArg("-foo", true));
+
+    ResetArgs("-foo -nofoo");  // -nofoo should win
+    BOOST_CHECK(!GetBoolArg("-foo", false));
+    BOOST_CHECK(!GetBoolArg("-foo", true));
+
+    ResetArgs("-foo=1 -nofoo=1");  // -nofoo should win
+    BOOST_CHECK(!GetBoolArg("-foo", false));
+    BOOST_CHECK(!GetBoolArg("-foo", true));
+
+    ResetArgs("-foo=0 -nofoo=0");  // -nofoo=0 should win
+    BOOST_CHECK(GetBoolArg("-foo", false));
+    BOOST_CHECK(GetBoolArg("-foo", true));
+
+    // New 0.6 feature: treat -- same as -:
+    ResetArgs("--foo=1");
+    BOOST_CHECK(GetBoolArg("-foo", false));
+    BOOST_CHECK(GetBoolArg("-foo", true));
+
+    ResetArgs("--nofoo=1");
+    BOOST_CHECK(!GetBoolArg("-foo", false));
+    BOOST_CHECK(!GetBoolArg("-foo", true));
+
+}
+
+BOOST_AUTO_TEST_CASE(stringarg)
+{
+    ResetArgs("");
+    BOOST_CHECK_EQUAL(GetArg("-foo", ""), "");
+    BOOST_CHECK_EQUAL(GetArg("-foo", "eleven"), "eleven");
+
+    ResetArgs("-foo -bar");
+    BOOST_CHECK_EQUAL(GetArg("-foo", ""), "");
+    BOOST_CHECK_EQUAL(GetArg("-foo", "eleven"), "");
+
+    ResetArgs("-foo=");
+    BOOST_CHECK_EQUAL(GetArg("-foo", ""), "");
+    BOOST_CHECK_EQUAL(GetArg("-foo", "eleven"), "");
+
+    ResetArgs("-foo=11");
+    BOOST_CHECK_EQUAL(GetArg("-foo", ""), "11");
+    BOOST_CHECK_EQUAL(GetArg("-foo", "eleven"), "11");
+
+    ResetArgs("-foo=eleven");
+    BOOST_CHECK_EQUAL(GetArg("-foo", ""), "eleven");
+    BOOST_CHECK_EQUAL(GetArg("-foo", "eleven"), "eleven");
+
+}
+
+BOOST_AUTO_TEST_CASE(intarg)
+{
+    ResetArgs("");
+    BOOST_CHECK_EQUAL(GetArg("-foo", 11), 11);
+    BOOST_CHECK_EQUAL(GetArg("-foo", 0), 0);
+
+    ResetArgs("-foo -bar");
+    BOOST_CHECK_EQUAL(GetArg("-foo", 11), 0);
+    BOOST_CHECK_EQUAL(GetArg("-bar", 11), 0);
+
+    ResetArgs("-foo=11 -bar=12");
+    BOOST_CHECK_EQUAL(GetArg("-foo", 0), 11);
+    BOOST_CHECK_EQUAL(GetArg("-bar", 11), 12);
+
+    ResetArgs("-foo=NaN -bar=NotANumber");
+    BOOST_CHECK_EQUAL(GetArg("-foo", 1), 0);
+    BOOST_CHECK_EQUAL(GetArg("-bar", 11), 0);
+}
+
+BOOST_AUTO_TEST_CASE(doubledash)
+{
+    ResetArgs("--foo");
+    BOOST_CHECK_EQUAL(GetBoolArg("-foo", false), true);
+
+    ResetArgs("--foo=verbose --bar=1");
+    BOOST_CHECK_EQUAL(GetArg("-foo", ""), "verbose");
+    BOOST_CHECK_EQUAL(GetArg("-bar", 0), 1);
+}
+
+BOOST_AUTO_TEST_CASE(boolargno)
+{
+    ResetArgs("-nofoo");
+    BOOST_CHECK(!GetBoolArg("-foo", true));
+    BOOST_CHECK(!GetBoolArg("-foo", false));
+
+    ResetArgs("-nofoo=1");
+    BOOST_CHECK(!GetBoolArg("-foo", true));
+    BOOST_CHECK(!GetBoolArg("-foo", false));
+
+    ResetArgs("-nofoo=0");
+    BOOST_CHECK(GetBoolArg("-foo", true));
+    BOOST_CHECK(GetBoolArg("-foo", false));
+
+    ResetArgs("-foo --nofoo"); // --nofoo should win
+    BOOST_CHECK(!GetBoolArg("-foo", true));
+    BOOST_CHECK(!GetBoolArg("-foo", false));
+
+    ResetArgs("-nofoo -foo"); // foo always wins:
+    BOOST_CHECK(GetBoolArg("-foo", true));
+    BOOST_CHECK(GetBoolArg("-foo", false));
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/hash_tests.cpp b/depend/zcash/src/test/hash_tests.cpp
new file mode 100644
index 000000000..1ebe68979
--- /dev/null
+++ b/depend/zcash/src/test/hash_tests.cpp
@@ -0,0 +1,127 @@
+// Copyright (c) 2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "hash.h"
+#include "utilstrencodings.h"
+#include "test/test_bitcoin.h"
+
+#include <vector>
+
+#include <boost/test/unit_test.hpp>
+
+using namespace std;
+
+BOOST_FIXTURE_TEST_SUITE(hash_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(murmurhash3)
+{
+
+#define T(expected, seed, data) BOOST_CHECK_EQUAL(MurmurHash3(seed, ParseHex(data)), expected)
+
+    // Test MurmurHash3 with various inputs. Of course this is retested in the
+    // bloom filter tests - they would fail if MurmurHash3() had any problems -
+    // but is useful for those trying to implement Bitcoin libraries as a
+    // source of test data for their MurmurHash3() primitive during
+    // development.
+    //
+    // The magic number 0xFBA4C795 comes from CBloomFilter::Hash()
+
+    T(0x00000000, 0x00000000, "");
+    T(0x6a396f08, 0xFBA4C795, "");
+    T(0x81f16f39, 0xffffffff, "");
+
+    T(0x514e28b7, 0x00000000, "00");
+    T(0xea3f0b17, 0xFBA4C795, "00");
+    T(0xfd6cf10d, 0x00000000, "ff");
+
+    T(0x16c6b7ab, 0x00000000, "0011");
+    T(0x8eb51c3d, 0x00000000, "001122");
+    T(0xb4471bf8, 0x00000000, "00112233");
+    T(0xe2301fa8, 0x00000000, "0011223344");
+    T(0xfc2e4a15, 0x00000000, "001122334455");
+    T(0xb074502c, 0x00000000, "00112233445566");
+    T(0x8034d2a0, 0x00000000, "0011223344556677");
+    T(0xb4698def, 0x00000000, "001122334455667788");
+
+#undef T
+}
+
+/*
+   SipHash-2-4 output with
+   k = 00 01 02 ...
+   and
+   in = (empty string)
+   in = 00 (1 byte)
+   in = 00 01 (2 bytes)
+   in = 00 01 02 (3 bytes)
+   ...
+   in = 00 01 02 ... 3e (63 bytes)
+
+   from: https://131002.net/siphash/siphash24.c
+*/
+uint64_t siphash_4_2_testvec[] = {
+    0x726fdb47dd0e0e31, 0x74f839c593dc67fd, 0x0d6c8009d9a94f5a, 0x85676696d7fb7e2d,
+    0xcf2794e0277187b7, 0x18765564cd99a68d, 0xcbc9466e58fee3ce, 0xab0200f58b01d137,
+    0x93f5f5799a932462, 0x9e0082df0ba9e4b0, 0x7a5dbbc594ddb9f3, 0xf4b32f46226bada7,
+    0x751e8fbc860ee5fb, 0x14ea5627c0843d90, 0xf723ca908e7af2ee, 0xa129ca6149be45e5,
+    0x3f2acc7f57c29bdb, 0x699ae9f52cbe4794, 0x4bc1b3f0968dd39c, 0xbb6dc91da77961bd,
+    0xbed65cf21aa2ee98, 0xd0f2cbb02e3b67c7, 0x93536795e3a33e88, 0xa80c038ccd5ccec8,
+    0xb8ad50c6f649af94, 0xbce192de8a85b8ea, 0x17d835b85bbb15f3, 0x2f2e6163076bcfad,
+    0xde4daaaca71dc9a5, 0xa6a2506687956571, 0xad87a3535c49ef28, 0x32d892fad841c342,
+    0x7127512f72f27cce, 0xa7f32346f95978e3, 0x12e0b01abb051238, 0x15e034d40fa197ae,
+    0x314dffbe0815a3b4, 0x027990f029623981, 0xcadcd4e59ef40c4d, 0x9abfd8766a33735c,
+    0x0e3ea96b5304a7d0, 0xad0c42d6fc585992, 0x187306c89bc215a9, 0xd4a60abcf3792b95,
+    0xf935451de4f21df2, 0xa9538f0419755787, 0xdb9acddff56ca510, 0xd06c98cd5c0975eb,
+    0xe612a3cb9ecba951, 0xc766e62cfcadaf96, 0xee64435a9752fe72, 0xa192d576b245165a,
+    0x0a8787bf8ecb74b2, 0x81b3e73d20b49b6f, 0x7fa8220ba3b2ecea, 0x245731c13ca42499,
+    0xb78dbfaf3a8d83bd, 0xea1ad565322a1a0b, 0x60e61c23a3795013, 0x6606d7e446282b93,
+    0x6ca4ecb15c5f91e1, 0x9f626da15c9625f3, 0xe51b38608ef25f57, 0x958a324ceb064572
+};
+
+BOOST_AUTO_TEST_CASE(siphash)
+{
+    CSipHasher hasher(0x0706050403020100ULL, 0x0F0E0D0C0B0A0908ULL);
+    BOOST_CHECK_EQUAL(hasher.Finalize(),  0x726fdb47dd0e0e31ull);
+    static const unsigned char t0[1] = {0};
+    hasher.Write(t0, 1);
+    BOOST_CHECK_EQUAL(hasher.Finalize(),  0x74f839c593dc67fdull);
+    static const unsigned char t1[7] = {1,2,3,4,5,6,7};
+    hasher.Write(t1, 7);
+    BOOST_CHECK_EQUAL(hasher.Finalize(),  0x93f5f5799a932462ull);
+    hasher.Write(0x0F0E0D0C0B0A0908ULL);
+    BOOST_CHECK_EQUAL(hasher.Finalize(),  0x3f2acc7f57c29bdbull);
+    static const unsigned char t2[2] = {16,17};
+    hasher.Write(t2, 2);
+    BOOST_CHECK_EQUAL(hasher.Finalize(),  0x4bc1b3f0968dd39cull);
+    static const unsigned char t3[9] = {18,19,20,21,22,23,24,25,26};
+    hasher.Write(t3, 9);
+    BOOST_CHECK_EQUAL(hasher.Finalize(),  0x2f2e6163076bcfadull);
+    static const unsigned char t4[5] = {27,28,29,30,31};
+    hasher.Write(t4, 5);
+    BOOST_CHECK_EQUAL(hasher.Finalize(),  0x7127512f72f27cceull);
+    hasher.Write(0x2726252423222120ULL);
+    BOOST_CHECK_EQUAL(hasher.Finalize(),  0x0e3ea96b5304a7d0ull);
+    hasher.Write(0x2F2E2D2C2B2A2928ULL);
+    BOOST_CHECK_EQUAL(hasher.Finalize(),  0xe612a3cb9ecba951ull);
+
+    BOOST_CHECK_EQUAL(SipHashUint256(0x0706050403020100ULL, 0x0F0E0D0C0B0A0908ULL, uint256S("1f1e1d1c1b1a191817161514131211100f0e0d0c0b0a09080706050403020100")), 0x7127512f72f27cceull);
+
+    // Check test vectors from spec, one byte at a time
+    CSipHasher hasher2(0x0706050403020100ULL, 0x0F0E0D0C0B0A0908ULL);
+    for (uint8_t x=0; x<ARRAYLEN(siphash_4_2_testvec); ++x)
+    {
+        BOOST_CHECK_EQUAL(hasher2.Finalize(), siphash_4_2_testvec[x]);
+        hasher2.Write(&x, 1);
+    }
+    // Check test vectors from spec, eight bytes at a time
+    CSipHasher hasher3(0x0706050403020100ULL, 0x0F0E0D0C0B0A0908ULL);
+    for (uint8_t x=0; x<ARRAYLEN(siphash_4_2_testvec); x+=8)
+    {
+        BOOST_CHECK_EQUAL(hasher3.Finalize(), siphash_4_2_testvec[x]);
+        hasher3.Write(uint64_t(x)|(uint64_t(x+1)<<8)|(uint64_t(x+2)<<16)|(uint64_t(x+3)<<24)|
+                     (uint64_t(x+4)<<32)|(uint64_t(x+5)<<40)|(uint64_t(x+6)<<48)|(uint64_t(x+7)<<56));
+    }
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/key_tests.cpp b/depend/zcash/src/test/key_tests.cpp
new file mode 100644
index 000000000..56bf05983
--- /dev/null
+++ b/depend/zcash/src/test/key_tests.cpp
@@ -0,0 +1,265 @@
+// Copyright (c) 2012-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "key.h"
+
+#include "chainparams.h"
+#include "key_io.h"
+#include "script/script.h"
+#include "uint256.h"
+#include "util.h"
+#include "utilstrencodings.h"
+#include "utiltest.h"
+#include "test/test_bitcoin.h"
+
+#include "zcash/Address.hpp"
+
+#include <string>
+#include <variant>
+#include <vector>
+
+#include <boost/test/unit_test.hpp>
+
+using namespace std;
+using namespace libzcash;
+
+static const std::string strSecret1 = "5HxWvvfubhXpYYpS3tJkw6fq9jE9j18THftkZjHHfmFiWtmAbrj";
+static const std::string strSecret2 = "5KC4ejrDjv152FGwP386VD1i2NYc5KkfSMyv1nGy1VGDxGHqVY3";
+static const std::string strSecret1C = "Kwr371tjA9u2rFSMZjTNun2PXXP3WPZu2afRHTcta6KxEUdm1vEw";
+static const std::string strSecret2C = "L3Hq7a8FEQwJkW1M2GNKDW28546Vp5miewcCzSqUD9kCAXrJdS3g";
+static const std::string addr1 = "t1h8SqgtM3QM5e2M8EzhhT1yL2PXXtA6oqe";
+static const std::string addr2 = "t1Xxa5ZVPKvs9bGMn7aWTiHjyHvR31XkUst";
+static const std::string addr1C = "t1ffus9J1vhxvFqLoExGBRPjE7BcJxiSCTC";
+static const std::string addr2C = "t1VJL2dPUyXK7avDRGqhqQA5bw2eEMdhyg6";
+
+static const std::string strAddressBad = "t1aMkLwU1LcMZYN7TgXUJAwzA1r44dbLkSp";
+
+
+#ifdef KEY_TESTS_DUMPINFO
+void dumpKeyInfo(uint256 privkey)
+{
+    CKey key;
+    key.resize(32);
+    memcpy(&secret[0], &privkey, 32);
+    vector<unsigned char> sec;
+    sec.resize(32);
+    memcpy(&sec[0], &secret[0], 32);
+    printf("  * secret (hex): %s\n", HexStr(sec).c_str());
+
+    KeyIO keyIO(Params());
+    for (int nCompressed=0; nCompressed<2; nCompressed++)
+    {
+        bool fCompressed = nCompressed == 1;
+        printf("  * %s:\n", fCompressed ? "compressed" : "uncompressed");
+        CBitcoinSecret bsecret;
+        bsecret.SetSecret(secret, fCompressed);
+        printf("    * secret (base58): %s\n", bsecret.ToString().c_str());
+        CKey key;
+        key.SetSecret(secret, fCompressed);
+        vector<unsigned char> vchPubKey = key.GetPubKey();
+        printf("    * pubkey (hex): %s\n", HexStr(vchPubKey).c_str());
+        printf("    * address (base58): %s\n", keyIO.EncodeDestination(vchPubKey).c_str());
+    }
+}
+#endif
+
+
+BOOST_FIXTURE_TEST_SUITE(key_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(key_test1)
+{
+    KeyIO keyIO(Params());
+    CKey key1  = keyIO.DecodeSecret(strSecret1);
+    BOOST_CHECK(key1.IsValid() && !key1.IsCompressed());
+    CKey key2  = keyIO.DecodeSecret(strSecret2);
+    BOOST_CHECK(key2.IsValid() && !key2.IsCompressed());
+    CKey key1C = keyIO.DecodeSecret(strSecret1C);
+    BOOST_CHECK(key1C.IsValid() && key1C.IsCompressed());
+    CKey key2C = keyIO.DecodeSecret(strSecret2C);
+    BOOST_CHECK(key2C.IsValid() && key2C.IsCompressed());
+    CKey bad_key = keyIO.DecodeSecret(strAddressBad);
+    BOOST_CHECK(!bad_key.IsValid());
+
+    CPubKey pubkey1  = key1. GetPubKey();
+    CPubKey pubkey2  = key2. GetPubKey();
+    CPubKey pubkey1C = key1C.GetPubKey();
+    CPubKey pubkey2C = key2C.GetPubKey();
+
+    BOOST_CHECK(key1.VerifyPubKey(pubkey1));
+    BOOST_CHECK(!key1.VerifyPubKey(pubkey1C));
+    BOOST_CHECK(!key1.VerifyPubKey(pubkey2));
+    BOOST_CHECK(!key1.VerifyPubKey(pubkey2C));
+
+    BOOST_CHECK(!key1C.VerifyPubKey(pubkey1));
+    BOOST_CHECK(key1C.VerifyPubKey(pubkey1C));
+    BOOST_CHECK(!key1C.VerifyPubKey(pubkey2));
+    BOOST_CHECK(!key1C.VerifyPubKey(pubkey2C));
+
+    BOOST_CHECK(!key2.VerifyPubKey(pubkey1));
+    BOOST_CHECK(!key2.VerifyPubKey(pubkey1C));
+    BOOST_CHECK(key2.VerifyPubKey(pubkey2));
+    BOOST_CHECK(!key2.VerifyPubKey(pubkey2C));
+
+    BOOST_CHECK(!key2C.VerifyPubKey(pubkey1));
+    BOOST_CHECK(!key2C.VerifyPubKey(pubkey1C));
+    BOOST_CHECK(!key2C.VerifyPubKey(pubkey2));
+    BOOST_CHECK(key2C.VerifyPubKey(pubkey2C));
+
+    BOOST_CHECK(keyIO.DecodeDestination(addr1)  == CTxDestination(pubkey1.GetID()));
+    BOOST_CHECK(keyIO.DecodeDestination(addr2)  == CTxDestination(pubkey2.GetID()));
+    BOOST_CHECK(keyIO.DecodeDestination(addr1C) == CTxDestination(pubkey1C.GetID()));
+    BOOST_CHECK(keyIO.DecodeDestination(addr2C) == CTxDestination(pubkey2C.GetID()));
+
+    for (int n=0; n<16; n++)
+    {
+        string strMsg = strprintf("Very secret message %i: 11", n);
+        uint256 hashMsg = Hash(strMsg.begin(), strMsg.end());
+
+        // normal signatures
+
+        vector<unsigned char> sign1, sign2, sign1C, sign2C;
+
+        BOOST_CHECK(key1.Sign (hashMsg, sign1));
+        BOOST_CHECK(key2.Sign (hashMsg, sign2));
+        BOOST_CHECK(key1C.Sign(hashMsg, sign1C));
+        BOOST_CHECK(key2C.Sign(hashMsg, sign2C));
+
+        BOOST_CHECK( pubkey1.Verify(hashMsg, sign1));
+        BOOST_CHECK(!pubkey1.Verify(hashMsg, sign2));
+        BOOST_CHECK( pubkey1.Verify(hashMsg, sign1C));
+        BOOST_CHECK(!pubkey1.Verify(hashMsg, sign2C));
+
+        BOOST_CHECK(!pubkey2.Verify(hashMsg, sign1));
+        BOOST_CHECK( pubkey2.Verify(hashMsg, sign2));
+        BOOST_CHECK(!pubkey2.Verify(hashMsg, sign1C));
+        BOOST_CHECK( pubkey2.Verify(hashMsg, sign2C));
+
+        BOOST_CHECK( pubkey1C.Verify(hashMsg, sign1));
+        BOOST_CHECK(!pubkey1C.Verify(hashMsg, sign2));
+        BOOST_CHECK( pubkey1C.Verify(hashMsg, sign1C));
+        BOOST_CHECK(!pubkey1C.Verify(hashMsg, sign2C));
+
+        BOOST_CHECK(!pubkey2C.Verify(hashMsg, sign1));
+        BOOST_CHECK( pubkey2C.Verify(hashMsg, sign2));
+        BOOST_CHECK(!pubkey2C.Verify(hashMsg, sign1C));
+        BOOST_CHECK( pubkey2C.Verify(hashMsg, sign2C));
+
+        // compact signatures (with key recovery)
+
+        vector<unsigned char> csign1, csign2, csign1C, csign2C;
+
+        BOOST_CHECK(key1.SignCompact (hashMsg, csign1));
+        BOOST_CHECK(key2.SignCompact (hashMsg, csign2));
+        BOOST_CHECK(key1C.SignCompact(hashMsg, csign1C));
+        BOOST_CHECK(key2C.SignCompact(hashMsg, csign2C));
+
+        CPubKey rkey1, rkey2, rkey1C, rkey2C;
+
+        BOOST_CHECK(rkey1.RecoverCompact (hashMsg, csign1));
+        BOOST_CHECK(rkey2.RecoverCompact (hashMsg, csign2));
+        BOOST_CHECK(rkey1C.RecoverCompact(hashMsg, csign1C));
+        BOOST_CHECK(rkey2C.RecoverCompact(hashMsg, csign2C));
+
+        BOOST_CHECK(rkey1  == pubkey1);
+        BOOST_CHECK(rkey2  == pubkey2);
+        BOOST_CHECK(rkey1C == pubkey1C);
+        BOOST_CHECK(rkey2C == pubkey2C);
+    }
+
+    // test deterministic signing
+
+    std::vector<unsigned char> detsig, detsigc;
+    string strMsg = "Very deterministic message";
+    uint256 hashMsg = Hash(strMsg.begin(), strMsg.end());
+    BOOST_CHECK(key1.Sign(hashMsg, detsig));
+    BOOST_CHECK(key1C.Sign(hashMsg, detsigc));
+    BOOST_CHECK(detsig == detsigc);
+    BOOST_CHECK(detsig == ParseHex("304402205dbbddda71772d95ce91cd2d14b592cfbc1dd0aabd6a394b6c2d377bbe59d31d022014ddda21494a4e221f0824f0b8b924c43fa43c0ad57dccdaa11f81a6bd4582f6"));
+    BOOST_CHECK(key2.Sign(hashMsg, detsig));
+    BOOST_CHECK(key2C.Sign(hashMsg, detsigc));
+    BOOST_CHECK(detsig == detsigc);
+    BOOST_CHECK(detsig == ParseHex("3044022052d8a32079c11e79db95af63bb9600c5b04f21a9ca33dc129c2bfa8ac9dc1cd5022061d8ae5e0f6c1a16bde3719c64c2fd70e404b6428ab9a69566962e8771b5944d"));
+    BOOST_CHECK(key1.SignCompact(hashMsg, detsig));
+    BOOST_CHECK(key1C.SignCompact(hashMsg, detsigc));
+    BOOST_CHECK(detsig == ParseHex("1c5dbbddda71772d95ce91cd2d14b592cfbc1dd0aabd6a394b6c2d377bbe59d31d14ddda21494a4e221f0824f0b8b924c43fa43c0ad57dccdaa11f81a6bd4582f6"));
+    BOOST_CHECK(detsigc == ParseHex("205dbbddda71772d95ce91cd2d14b592cfbc1dd0aabd6a394b6c2d377bbe59d31d14ddda21494a4e221f0824f0b8b924c43fa43c0ad57dccdaa11f81a6bd4582f6"));
+    BOOST_CHECK(key2.SignCompact(hashMsg, detsig));
+    BOOST_CHECK(key2C.SignCompact(hashMsg, detsigc));
+    BOOST_CHECK(detsig == ParseHex("1c52d8a32079c11e79db95af63bb9600c5b04f21a9ca33dc129c2bfa8ac9dc1cd561d8ae5e0f6c1a16bde3719c64c2fd70e404b6428ab9a69566962e8771b5944d"));
+    BOOST_CHECK(detsigc == ParseHex("2052d8a32079c11e79db95af63bb9600c5b04f21a9ca33dc129c2bfa8ac9dc1cd561d8ae5e0f6c1a16bde3719c64c2fd70e404b6428ab9a69566962e8771b5944d"));
+}
+
+BOOST_AUTO_TEST_CASE(zc_address_test)
+{
+    KeyIO keyIO(Params());
+    for (size_t i = 0; i < 1000; i++) {
+        auto sk = SproutSpendingKey::random();
+        {
+            string sk_string = keyIO.EncodeSpendingKey(sk);
+
+            BOOST_CHECK(sk_string[0] == 'S');
+            BOOST_CHECK(sk_string[1] == 'K');
+
+            auto spendingkey2 = keyIO.DecodeSpendingKey(sk_string);
+            BOOST_CHECK(spendingkey2.has_value());
+            BOOST_ASSERT(std::get_if<SproutSpendingKey>(&spendingkey2.value()) != nullptr);
+            auto sk2 = std::get<SproutSpendingKey>(spendingkey2.value());
+            BOOST_CHECK(sk.inner() == sk2.inner());
+        }
+        {
+            auto addr = sk.address();
+
+            std::string addr_string = keyIO.EncodePaymentAddress(addr);
+
+            BOOST_CHECK(addr_string[0] == 'z');
+            BOOST_CHECK(addr_string[1] == 'c');
+
+            auto paymentaddr2 = keyIO.DecodePaymentAddress(addr_string);
+            BOOST_ASSERT(paymentaddr2.has_value());
+
+            BOOST_ASSERT(std::get_if<SproutPaymentAddress>(&paymentaddr2.value()) != nullptr);
+            auto addr2 = std::get<SproutPaymentAddress>(paymentaddr2.value());
+            BOOST_CHECK(addr.a_pk == addr2.a_pk);
+            BOOST_CHECK(addr.pk_enc == addr2.pk_enc);
+        }
+    }
+}
+
+BOOST_AUTO_TEST_CASE(zs_address_test)
+{
+    SelectParams(CBaseChainParams::REGTEST);
+
+    auto m = GetTestMasterSaplingSpendingKey();
+
+    KeyIO keyIO(Params());
+    for (uint32_t i = 0; i < 1000; i++) {
+        auto sk = m.Derive(i);
+        {
+            std::string sk_string = keyIO.EncodeSpendingKey(sk);
+            BOOST_CHECK(sk_string.compare(0, 27, Params().Bech32HRP(CChainParams::SAPLING_EXTENDED_SPEND_KEY)) == 0);
+
+            auto spendingkey2 = keyIO.DecodeSpendingKey(sk_string);
+            BOOST_CHECK(spendingkey2.has_value());
+
+            BOOST_ASSERT(std::get_if<SaplingExtendedSpendingKey>(&spendingkey2.value()) != nullptr);
+            auto sk2 = std::get<SaplingExtendedSpendingKey>(spendingkey2.value());
+            BOOST_CHECK(sk == sk2);
+        }
+        {
+            auto addr = sk.ToXFVK().DefaultAddress();
+
+            std::string addr_string = keyIO.EncodePaymentAddress(addr);
+            BOOST_CHECK(addr_string.compare(0, 15, Params().Bech32HRP(CChainParams::SAPLING_PAYMENT_ADDRESS)) == 0);
+
+            auto paymentaddr2 = keyIO.DecodePaymentAddress(addr_string);
+            BOOST_CHECK(paymentaddr2.has_value());
+
+            BOOST_ASSERT(std::get_if<SaplingPaymentAddress>(&paymentaddr2.value()) != nullptr);
+            auto addr2 = std::get<SaplingPaymentAddress>(paymentaddr2.value());
+            BOOST_CHECK(addr == addr2);
+        }
+    }
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/limitedmap_tests.cpp b/depend/zcash/src/test/limitedmap_tests.cpp
new file mode 100644
index 000000000..e3531486a
--- /dev/null
+++ b/depend/zcash/src/test/limitedmap_tests.cpp
@@ -0,0 +1,101 @@
+// Copyright (c) 2012-2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or http://www.opensource.org/licenses/mit-license.php.
+
+#include "limitedmap.h"
+
+#include "test/test_bitcoin.h"
+
+#include <boost/test/unit_test.hpp>
+
+BOOST_FIXTURE_TEST_SUITE(limitedmap_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(limitedmap_test)
+{
+    // create a limitedmap capped at 10 items
+    limitedmap<int, int> map(10);
+
+    // check that the max size is 10
+    BOOST_CHECK(map.max_size() == 10);
+
+    // check that it's empty
+    BOOST_CHECK(map.size() == 0);
+
+    // insert (-1, -1)
+    map.insert(std::pair<int, int>(-1, -1));
+
+    // make sure that the size is updated
+    BOOST_CHECK(map.size() == 1);
+
+    // make sure that the new items is in the map
+    BOOST_CHECK(map.count(-1) == 1);
+
+    // insert 10 new items
+    for (int i = 0; i < 10; i++) {
+        map.insert(std::pair<int, int>(i, i + 1));
+    }
+
+    // make sure that the map now contains 10 items...
+    BOOST_CHECK(map.size() == 10);
+
+    // ...and that the first item has been discarded
+    BOOST_CHECK(map.count(-1) == 0);
+
+    // iterate over the map, both with an index and an iterator
+    limitedmap<int, int>::const_iterator it = map.begin();
+    for (int i = 0; i < 10; i++) {
+        // make sure the item is present
+        BOOST_CHECK(map.count(i) == 1);
+
+        // use the iterator to check for the expected key and value
+        BOOST_CHECK(it->first == i);
+        BOOST_CHECK(it->second == i + 1);
+        
+        // use find to check for the value
+        BOOST_CHECK(map.find(i)->second == i + 1);
+        
+        // update and recheck
+        map.update(it, i + 2);
+        BOOST_CHECK(map.find(i)->second == i + 2);
+
+        it++;
+    }
+
+    // check that we've exhausted the iterator
+    BOOST_CHECK(it == map.end());
+
+    // resize the map to 5 items
+    map.max_size(5);
+
+    // check that the max size and size are now 5
+    BOOST_CHECK(map.max_size() == 5);
+    BOOST_CHECK(map.size() == 5);
+
+    // check that items less than 5 have been discarded
+    // and items greater than 5 are retained
+    for (int i = 0; i < 10; i++) {
+        if (i < 5) {
+            BOOST_CHECK(map.count(i) == 0);
+        } else {
+            BOOST_CHECK(map.count(i) == 1);
+        }
+    }
+
+    // erase some items not in the map
+    for (int i = 100; i < 1000; i += 100) {
+        map.erase(i);
+    }
+
+    // check that the size is unaffected
+    BOOST_CHECK(map.size() == 5);
+
+    // erase the remaining elements
+    for (int i = 5; i < 10; i++) {
+        map.erase(i);
+    }
+
+    // check that the map is now empty
+    BOOST_CHECK(map.empty());
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/main_tests.cpp b/depend/zcash/src/test/main_tests.cpp
new file mode 100644
index 000000000..c490ce0eb
--- /dev/null
+++ b/depend/zcash/src/test/main_tests.cpp
@@ -0,0 +1,126 @@
+// Copyright (c) 2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "chainparams.h"
+#include "main.h"
+
+#include "test/test_bitcoin.h"
+
+#include <boost/signals2/signal.hpp>
+#include <boost/test/unit_test.hpp>
+
+
+BOOST_FIXTURE_TEST_SUITE(main_tests, TestingSetup)
+
+const CAmount INITIAL_SUBSIDY = 12.5 * COIN;
+
+static int GetTotalHalvings(const Consensus::Params& consensusParams) {
+    // This assumes that BLOSSOM_POW_TARGET_SPACING_RATIO == 2
+    // and treats blossom activation as a halving event
+    return consensusParams.vUpgrades[Consensus::UPGRADE_BLOSSOM].nActivationHeight == Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT ? 64 : 65;
+}
+
+static void TestBlockSubsidyHalvings(const Consensus::Params& consensusParams)
+{
+    bool blossomActive = false;
+    int blossomActivationHeight = consensusParams.vUpgrades[Consensus::UPGRADE_BLOSSOM].nActivationHeight;
+    int nHeight = consensusParams.nSubsidySlowStartInterval;
+    BOOST_CHECK_EQUAL(GetBlockSubsidy(nHeight, consensusParams), INITIAL_SUBSIDY);
+    CAmount nPreviousSubsidy = INITIAL_SUBSIDY;
+    for (int nHalvings = 1; nHalvings < GetTotalHalvings(consensusParams); nHalvings++) {
+        if (blossomActive) {
+            if (nHeight == blossomActivationHeight) {
+                int preBlossomHeight = (nHalvings - 1) * consensusParams.nPreBlossomSubsidyHalvingInterval + consensusParams.SubsidySlowStartShift();
+                nHeight += (preBlossomHeight - blossomActivationHeight) * Consensus::BLOSSOM_POW_TARGET_SPACING_RATIO;
+            } else {
+                nHeight += consensusParams.nPostBlossomSubsidyHalvingInterval;
+            }
+        } else {
+            nHeight = nHalvings * consensusParams.nPreBlossomSubsidyHalvingInterval + consensusParams.SubsidySlowStartShift();
+            if (consensusParams.NetworkUpgradeActive(nHeight, Consensus::UPGRADE_BLOSSOM)) {
+                nHeight = blossomActivationHeight;
+                blossomActive = true;
+            }
+        }
+        BOOST_CHECK_EQUAL(GetBlockSubsidy(nHeight - 1, consensusParams), nPreviousSubsidy);
+        CAmount nSubsidy = GetBlockSubsidy(nHeight, consensusParams);
+        BOOST_CHECK(nSubsidy <= INITIAL_SUBSIDY);
+        BOOST_CHECK_EQUAL(nSubsidy, nPreviousSubsidy / 2);
+        nPreviousSubsidy = nSubsidy;
+    }
+    BOOST_CHECK_EQUAL(GetBlockSubsidy(nHeight, consensusParams), 0);
+}
+
+static void TestBlockSubsidyHalvings(int nSubsidySlowStartInterval, int nPreBlossomSubsidyHalvingInterval, int blossomActivationHeight)
+{
+    Consensus::Params consensusParams;
+    consensusParams.nSubsidySlowStartInterval = nSubsidySlowStartInterval;
+    consensusParams.nPreBlossomSubsidyHalvingInterval = nPreBlossomSubsidyHalvingInterval;
+    consensusParams.nPostBlossomSubsidyHalvingInterval = nPreBlossomSubsidyHalvingInterval * Consensus::BLOSSOM_POW_TARGET_SPACING_RATIO;
+    consensusParams.vUpgrades[Consensus::UPGRADE_BLOSSOM].nActivationHeight = blossomActivationHeight;
+    TestBlockSubsidyHalvings(consensusParams);
+}
+
+BOOST_AUTO_TEST_CASE(block_subsidy_test)
+{
+    TestBlockSubsidyHalvings(Params(CBaseChainParams::MAIN).GetConsensus()); // As in main
+    TestBlockSubsidyHalvings(20000, Consensus::PRE_BLOSSOM_HALVING_INTERVAL, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT); // Pre-Blossom
+    TestBlockSubsidyHalvings(50, 150, 80); // As in regtest
+    TestBlockSubsidyHalvings(500, 1000, 900); // Just another interval
+    TestBlockSubsidyHalvings(500, 1000, 3000); // Multiple halvings before Blossom activation
+}
+
+BOOST_AUTO_TEST_CASE(subsidy_limit_test)
+{
+    const Consensus::Params& consensusParams = Params(CBaseChainParams::MAIN).GetConsensus();
+
+    CAmount nSum = 0;
+    int nHeight = 0;
+    // Mining slow start
+    for (; nHeight < consensusParams.nSubsidySlowStartInterval; nHeight++) {
+        CAmount nSubsidy = GetBlockSubsidy(nHeight, consensusParams);
+        BOOST_CHECK(nSubsidy <= INITIAL_SUBSIDY);
+        nSum += nSubsidy;
+        BOOST_CHECK(MoneyRange(nSum));
+    }
+    BOOST_CHECK_EQUAL(nSum, 12500000000000ULL);
+
+    // Regular mining
+    CAmount nSubsidy;
+    do {
+        nSubsidy = GetBlockSubsidy(nHeight, consensusParams);
+        BOOST_CHECK(nSubsidy <= INITIAL_SUBSIDY);
+        nSum += nSubsidy;
+        BOOST_ASSERT(MoneyRange(nSum));
+        ++nHeight;
+    } while (nSubsidy > 0);
+
+    // Changing the block interval from 10 to 2.5 minutes causes truncation
+    // effects to occur earlier (from the 9th halving interval instead of the
+    // 11th), decreasing the total monetary supply by 0.0693 ZEC.
+    // BOOST_CHECK_EQUAL(nSum, 2099999997690000ULL);
+    // Reducing the interval further to 1.25 minutes has a similar effect,
+    // decreasing the total monetary supply by another 0.09240 ZEC.
+    // BOOST_CHECK_EQUAL(nSum, 2099999990760000ULL);
+    BOOST_CHECK_EQUAL(nSum, 2099999981520000LL);
+}
+
+bool ReturnFalse() { return false; }
+bool ReturnTrue() { return true; }
+
+BOOST_AUTO_TEST_CASE(test_combiner_all)
+{
+    boost::signals2::signal<bool (), CombinerAll> Test;
+    BOOST_CHECK(Test());
+    Test.connect(&ReturnFalse);
+    BOOST_CHECK(!Test());
+    Test.connect(&ReturnTrue);
+    BOOST_CHECK(!Test());
+    Test.disconnect(&ReturnFalse);
+    BOOST_CHECK(Test());
+    Test.disconnect(&ReturnTrue);
+    BOOST_CHECK(Test());
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/mempool_tests.cpp b/depend/zcash/src/test/mempool_tests.cpp
new file mode 100644
index 000000000..500513b81
--- /dev/null
+++ b/depend/zcash/src/test/mempool_tests.cpp
@@ -0,0 +1,249 @@
+// Copyright (c) 2011-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "consensus/upgrades.h"
+#include "main.h"
+#include "txmempool.h"
+#include "util.h"
+
+#include "test/test_bitcoin.h"
+
+#include <boost/test/unit_test.hpp>
+#include <list>
+
+BOOST_FIXTURE_TEST_SUITE(mempool_tests, TestingSetup)
+
+BOOST_AUTO_TEST_CASE(MempoolRemoveTest)
+{
+    // Test CTxMemPool::remove functionality
+
+    TestMemPoolEntryHelper entry;
+    // Parent transaction with three children,
+    // and three grand-children:
+    CMutableTransaction txParent;
+    txParent.vin.resize(1);
+    txParent.vin[0].scriptSig = CScript() << OP_11;
+    txParent.vout.resize(3);
+    for (int i = 0; i < 3; i++)
+    {
+        txParent.vout[i].scriptPubKey = CScript() << OP_11 << OP_EQUAL;
+        txParent.vout[i].nValue = 33000LL;
+    }
+    CMutableTransaction txChild[3];
+    for (int i = 0; i < 3; i++)
+    {
+        txChild[i].vin.resize(1);
+        txChild[i].vin[0].scriptSig = CScript() << OP_11;
+        txChild[i].vin[0].prevout.hash = txParent.GetHash();
+        txChild[i].vin[0].prevout.n = i;
+        txChild[i].vout.resize(1);
+        txChild[i].vout[0].scriptPubKey = CScript() << OP_11 << OP_EQUAL;
+        txChild[i].vout[0].nValue = 11000LL;
+    }
+    CMutableTransaction txGrandChild[3];
+    for (int i = 0; i < 3; i++)
+    {
+        txGrandChild[i].vin.resize(1);
+        txGrandChild[i].vin[0].scriptSig = CScript() << OP_11;
+        txGrandChild[i].vin[0].prevout.hash = txChild[i].GetHash();
+        txGrandChild[i].vin[0].prevout.n = 0;
+        txGrandChild[i].vout.resize(1);
+        txGrandChild[i].vout[0].scriptPubKey = CScript() << OP_11 << OP_EQUAL;
+        txGrandChild[i].vout[0].nValue = 11000LL;
+    }
+
+
+    CTxMemPool testPool(CFeeRate(0));
+    std::list<CTransaction> removed;
+
+    // Nothing in pool, remove should do nothing:
+    testPool.remove(txParent, removed, true);
+    BOOST_CHECK_EQUAL(removed.size(), 0);
+
+    // Just the parent:
+    testPool.addUnchecked(txParent.GetHash(), entry.FromTx(txParent));
+    testPool.remove(txParent, removed, true);
+    BOOST_CHECK_EQUAL(removed.size(), 1);
+    removed.clear();
+    
+    // Parent, children, grandchildren:
+    testPool.addUnchecked(txParent.GetHash(), entry.FromTx(txParent));
+    for (int i = 0; i < 3; i++)
+    {
+        testPool.addUnchecked(txChild[i].GetHash(), entry.FromTx(txChild[i]));
+        testPool.addUnchecked(txGrandChild[i].GetHash(), entry.FromTx(txGrandChild[i]));
+    }
+    // Remove Child[0], GrandChild[0] should be removed:
+    testPool.remove(txChild[0], removed, true);
+    BOOST_CHECK_EQUAL(removed.size(), 2);
+    removed.clear();
+    // ... make sure grandchild and child are gone:
+    testPool.remove(txGrandChild[0], removed, true);
+    BOOST_CHECK_EQUAL(removed.size(), 0);
+    testPool.remove(txChild[0], removed, true);
+    BOOST_CHECK_EQUAL(removed.size(), 0);
+    // Remove parent, all children/grandchildren should go:
+    testPool.remove(txParent, removed, true);
+    BOOST_CHECK_EQUAL(removed.size(), 5);
+    BOOST_CHECK_EQUAL(testPool.size(), 0);
+    removed.clear();
+
+    // Add children and grandchildren, but NOT the parent (simulate the parent being in a block)
+    for (int i = 0; i < 3; i++)
+    {
+        testPool.addUnchecked(txChild[i].GetHash(), entry.FromTx(txChild[i]));
+        testPool.addUnchecked(txGrandChild[i].GetHash(), entry.FromTx(txGrandChild[i]));
+    }
+    // Now remove the parent, as might happen if a block-re-org occurs but the parent cannot be
+    // put into the mempool (maybe because it is non-standard):
+    testPool.remove(txParent, removed, true);
+    BOOST_CHECK_EQUAL(removed.size(), 6);
+    BOOST_CHECK_EQUAL(testPool.size(), 0);
+    removed.clear();
+}
+
+BOOST_AUTO_TEST_CASE(MempoolIndexingTest)
+{
+    CTxMemPool pool(CFeeRate(0));
+    TestMemPoolEntryHelper entry;
+    entry.hadNoDependencies = true;
+
+    /* 3rd highest fee */
+    CMutableTransaction tx1 = CMutableTransaction();
+    tx1.vout.resize(1);
+    tx1.vout[0].scriptPubKey = CScript() << OP_11 << OP_EQUAL;
+    tx1.vout[0].nValue = 10 * COIN;
+    pool.addUnchecked(tx1.GetHash(), entry.Fee(10000LL).Priority(10.0).FromTx(tx1));
+
+    /* highest fee */
+    CMutableTransaction tx2 = CMutableTransaction();
+    tx2.vout.resize(1);
+    tx2.vout[0].scriptPubKey = CScript() << OP_11 << OP_EQUAL;
+    tx2.vout[0].nValue = 2 * COIN;
+    pool.addUnchecked(tx2.GetHash(), entry.Fee(20000LL).Priority(9.0).FromTx(tx2));
+
+    /* lowest fee */
+    CMutableTransaction tx3 = CMutableTransaction();
+    tx3.vout.resize(1);
+    tx3.vout[0].scriptPubKey = CScript() << OP_11 << OP_EQUAL;
+    tx3.vout[0].nValue = 5 * COIN;
+    pool.addUnchecked(tx3.GetHash(), entry.Fee(0LL).Priority(100.0).FromTx(tx3));
+
+    /* 2nd highest fee */
+    CMutableTransaction tx4 = CMutableTransaction();
+    tx4.vout.resize(1);
+    tx4.vout[0].scriptPubKey = CScript() << OP_11 << OP_EQUAL;
+    tx4.vout[0].nValue = 6 * COIN;
+    pool.addUnchecked(tx4.GetHash(), entry.Fee(15000LL).Priority(1.0).FromTx(tx4));
+
+    /* equal fee rate to tx1, but newer */
+    CMutableTransaction tx5 = CMutableTransaction();
+    tx5.vout.resize(1);
+    tx5.vout[0].scriptPubKey = CScript() << OP_11 << OP_EQUAL;
+    tx5.vout[0].nValue = 11 * COIN;
+    entry.nTime = 1;
+    entry.dPriority = 10.0;
+    pool.addUnchecked(tx5.GetHash(), entry.Fee(10000LL).FromTx(tx5));
+    BOOST_CHECK_EQUAL(pool.size(), 5);
+
+    // Check the fee-rate index is in order, should be tx3, tx5, tx1, tx4, tx2
+    CTxMemPool::indexed_transaction_set::nth_index<1>::type::iterator it = pool.mapTx.get<1>().begin();
+    BOOST_CHECK_EQUAL(it++->GetTx().GetHash().ToString(), tx3.GetHash().ToString());
+    BOOST_CHECK_EQUAL(it++->GetTx().GetHash().ToString(), tx5.GetHash().ToString());
+    BOOST_CHECK_EQUAL(it++->GetTx().GetHash().ToString(), tx1.GetHash().ToString());
+    BOOST_CHECK_EQUAL(it++->GetTx().GetHash().ToString(), tx4.GetHash().ToString());
+    BOOST_CHECK_EQUAL(it++->GetTx().GetHash().ToString(), tx2.GetHash().ToString());
+    BOOST_CHECK(it == pool.mapTx.get<1>().end());
+
+    /* Now check the sort on the mining score index.
+     * Final order should be:
+     *
+     * tx2 (20k)
+     * tx4 (15000)
+     * tx1/tx5 (10000)
+     * tx3 (0)
+     * (Ties resolved by hash)
+     */
+    {
+        CTxMemPool::indexed_transaction_set::nth_index<2>::type::iterator it = pool.mapTx.get<2>().begin();
+        BOOST_CHECK_EQUAL(it++->GetTx().GetHash().ToString(), tx2.GetHash().ToString());
+        BOOST_CHECK_EQUAL(it++->GetTx().GetHash().ToString(), tx4.GetHash().ToString());
+        if (tx1.GetHash() < tx5.GetHash()) {
+            BOOST_CHECK_EQUAL(it++->GetTx().GetHash().ToString(), tx5.GetHash().ToString());
+            BOOST_CHECK_EQUAL(it++->GetTx().GetHash().ToString(), tx1.GetHash().ToString());
+        } else {
+            BOOST_CHECK_EQUAL(it++->GetTx().GetHash().ToString(), tx1.GetHash().ToString());
+            BOOST_CHECK_EQUAL(it++->GetTx().GetHash().ToString(), tx5.GetHash().ToString());
+        }
+        BOOST_CHECK_EQUAL(it++->GetTx().GetHash().ToString(), tx3.GetHash().ToString());
+        BOOST_CHECK(it == pool.mapTx.get<2>().end());
+    }
+}
+
+BOOST_AUTO_TEST_CASE(RemoveWithoutBranchId) {
+    CTxMemPool pool(CFeeRate(0));
+    TestMemPoolEntryHelper entry;
+    entry.nFee = 10000LL;
+    entry.hadNoDependencies = true;
+
+    // Add some Sprout transactions
+    for (auto i = 1; i < 11; i++) {
+        CMutableTransaction tx = CMutableTransaction();
+        tx.vout.resize(1);
+        tx.vout[0].scriptPubKey = CScript() << OP_11 << OP_EQUAL;
+        tx.vout[0].nValue = i * COIN;
+        pool.addUnchecked(tx.GetHash(), entry.BranchId(NetworkUpgradeInfo[Consensus::BASE_SPROUT].nBranchId).FromTx(tx));
+    }
+    BOOST_CHECK_EQUAL(pool.size(), 10);
+
+    // Check the pool only contains Sprout transactions
+    for (CTxMemPool::indexed_transaction_set::const_iterator it = pool.mapTx.begin(); it != pool.mapTx.end(); it++) {
+        BOOST_CHECK_EQUAL(it->GetValidatedBranchId(), NetworkUpgradeInfo[Consensus::BASE_SPROUT].nBranchId);
+    }
+
+    // Add some dummy transactions
+    for (auto i = 1; i < 11; i++) {
+        CMutableTransaction tx = CMutableTransaction();
+        tx.vout.resize(1);
+        tx.vout[0].scriptPubKey = CScript() << OP_11 << OP_EQUAL;
+        tx.vout[0].nValue = i * COIN + 100;
+        pool.addUnchecked(tx.GetHash(), entry.BranchId(NetworkUpgradeInfo[Consensus::UPGRADE_TESTDUMMY].nBranchId).FromTx(tx));
+    }
+    BOOST_CHECK_EQUAL(pool.size(), 20);
+
+    // Add some Overwinter transactions
+    for (auto i = 1; i < 11; i++) {
+        CMutableTransaction tx = CMutableTransaction();
+        tx.vout.resize(1);
+        tx.vout[0].scriptPubKey = CScript() << OP_11 << OP_EQUAL;
+        tx.vout[0].nValue = i * COIN + 200;
+        pool.addUnchecked(tx.GetHash(), entry.BranchId(NetworkUpgradeInfo[Consensus::UPGRADE_OVERWINTER].nBranchId).FromTx(tx));
+    }
+    BOOST_CHECK_EQUAL(pool.size(), 30);
+
+    // Remove transactions that are not for Overwinter
+    pool.removeWithoutBranchId(NetworkUpgradeInfo[Consensus::UPGRADE_OVERWINTER].nBranchId);
+    BOOST_CHECK_EQUAL(pool.size(), 10);
+
+    // Check the pool only contains Overwinter transactions
+    for (CTxMemPool::indexed_transaction_set::const_iterator it = pool.mapTx.begin(); it != pool.mapTx.end(); it++) {
+        BOOST_CHECK_EQUAL(it->GetValidatedBranchId(), NetworkUpgradeInfo[Consensus::UPGRADE_OVERWINTER].nBranchId);
+    }
+
+    // Roll back to Sprout
+    pool.removeWithoutBranchId(NetworkUpgradeInfo[Consensus::BASE_SPROUT].nBranchId);
+    BOOST_CHECK_EQUAL(pool.size(), 0);
+}
+
+// Test that nCheckFrequency is set correctly when calling setSanityCheck().
+// https://github.com/zcash/zcash/issues/3134
+BOOST_AUTO_TEST_CASE(SetSanityCheck) {
+    CTxMemPool pool(CFeeRate(0));
+    pool.setSanityCheck(1.0);
+    BOOST_CHECK_EQUAL(pool.GetCheckFrequency(), 4294967295);
+    pool.setSanityCheck(0);
+    BOOST_CHECK_EQUAL(pool.GetCheckFrequency(), 0);
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/miner_tests.cpp b/depend/zcash/src/test/miner_tests.cpp
new file mode 100644
index 000000000..a2c674b8d
--- /dev/null
+++ b/depend/zcash/src/test/miner_tests.cpp
@@ -0,0 +1,468 @@
+// Copyright (c) 2011-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "arith_uint256.h"
+#include "consensus/validation.h"
+#include "main.h"
+#include "miner.h"
+#include "pubkey.h"
+#include "uint256.h"
+#include "util.h"
+#include "crypto/equihash.h"
+//#include "pow/tromp/equi_miner.h"
+
+#include "test/test_bitcoin.h"
+
+#include <boost/test/unit_test.hpp>
+
+BOOST_FIXTURE_TEST_SUITE(miner_tests, TestingSetup)
+
+static
+struct {
+    const char *nonce_hex;
+    const char *solution_hex;
+} blockinfo[] = {
+    {"00000000000000000000000000000000000000000000000000000000000024b2", "0026ca22cec36c1937fcc1c7379c054dced412c3a11becd6e3cdd3090b1961a4f9db3c30b6ce55f77f32187ea5f868a23955853a54583ae4cfea025f159044407c6bff1a9bc6494a6ed52d697cc395c50cd879f30637d73f100409a6c428f42a0ddea12a71edd8cf3f0c1da21072091ef36e6ca2596c1e86be5b107536e420fee672cfa22417dfaad91d906ac41a7b8a76c0c2213482f207ef1c6ff95a8220e27bf2eef62019256203036f50bc90809ebcc1db0676e52d1b4f033ff903183b27d45f0f67ed53f683fd56b43a699dc9f091e117e6621e9af0b02be0992a733ffeddbac5fb7c49852ad10c2fa3b0b92fc0cda438c8be0e127621f6e4f90df4a9b703d1e74297f7a1c8b433a016006e1f769b155d6e6b01ebaed3adfb83027543da91799d8fa49219d7eba700c94d88b836f3a3a5517ca57f3d1120ce26d189a1074b6f5abf75d3100c3157b925e94a46ba042488e905d47bc18880e0a828ef9e81b832d0b61427686b2940ab3be198d307fc64498f8baf6f9f29fe193dbf9b9048a3424d8f22432ebabee2ef795ff8153e4717dea77004c3ac24a41d272ea9fa5dd1d9b8c605f7b3180a83bae378fb52a1b26deabcf0daa98f120c10d42762a6b72d695331878fba6165dad0734e3f08059f7a8dcf7c7cd3d440f009b4b4f58b6af1258e14c67593f89a2def471fb5b2e9b15e3df016f5132407126a431f4304488d3550a88822234242657a07311c198e10044c9c3d4692167a6df59e6a5ed7f51e970801b91e9c8ae26e82225168421fef16ddc579d1d32dd74d3b661beaf5a9ffb4d7c928db3e5937151abf0f29137e4bdb99f9ae96f34db7487236c0519e024223e1fcff065d50ff938d9581947aa36d7797d761311fe1a9ffe3cbdb7b3f43d6ba76c465f2544cf8f12f25c732c12d49a6a274be62efc64dc8f9ef24fb6a3b007b7d568c544469628b42c3e371db76e542be84311ebcf6c07ad7ec34ce2fe2debf3173971b92df9b150252818a1e0a4339661f46414fff41a201e211173627de34c75acdf3e35fc4b843d2efe7a7a3c8de46b600d1ea22f95e318d537f220d99a70c192cc1bc8c850d8a6f977a498c94673ce2a04532c1c30f36199e650519d318b2cfc205e09b64ec34b98e0d3c90da7f604a096e33e89e5e15f139c501ad60cb6df2e731449f008924270e05119342a3a2e24a37159db7d13092411b1d06728d4a07671089d3fd0c5e642df3da5c2a3c027426696f9aa0c38e43632745ed08de3c47569ec214922d44b8e6c077f602b3a84e4004a2475c1c24a201aa2d9dd3c8f6753d7c37eedeef7a22b3d81f6d531a7ebe59d36191d78c59551c9ebe501594447c947f0c308f1641cd72976f5b69dd2dd76aff033b5e91141f7d45593710cea54f65e41bd5bd4fe9c5240e8ac201b3cf649e01b10c83ef88771cf783fecf30383a7b593f76a758dd518925a9f883897ef44f4d523d46e70dbbc5570c1ac3618c3de53172592a9dc537d4e7d20f4df281c1919a5ae04ec2a2191b8ff8ecc8a78ff302555dedb24551e726ef62121de15ba173c0bd34ab1e350d749fc8f3135e05d205691ad2ccc8257a957b0803c20a3054b130cc2ab5e9ebdb57ce1e3e75815e0bc0e21fa5d2ceff943034a3c5b887bd61b33f647d01e9bd2c2e8dedfea5a8d489ffeb203b518d7fe2a829a29e4cf44d18615a0d865435457481cb69587d3019c334b55789a97bd1dd52bcf270b23d165aedfda01aab0afe6323332328c1b223cb4ab11278487b1fd303a53ad1090b4bcd4a17b152352e2761a0642e4a780f6875ed99cfede0d08e978d6cdf083ec748f68d41115800d56026bb0986e274f52a58049aaba31618fe2ffded45a0632711b138243499455971f3bbf5eacd"},
+    {"00000000000000000000000000000000000000000000000000000000000000cc", "00ef1327f8e5fd65553e60ef249d8c786f59d7bae20c9053dfc20643233a3ab273223f6b46308c12cbfe0baa7b3f716c28cff80516b49b79fceb38ec1b7dee31fcfacf8a8feb3daf0d036390e0a0073bccbc2af210838f54f38fd9907f96250c4ed258e5b950f393ff1138146d8eed4e4d7b95e12c2a982e29e9d998afd51895228fba8bbce4682605fd5c45da65f03e12fd2d4294a5afe696e430e88594791baac0e5365caeedc70291d9c6458ed294ecaf32b4915c217958ab6d27b3121818d41e056014c457c1333c97c1f55f3f98c35b09f6873bf70521fd6ed613bef8515a4b58c7fe8f4335f65b220c1ce6695250e50f7cc8eed22bd81e68e507f5677ab75adc81ccd0f55100b6e7a9e10b51dcf744a7ffbea6746e23bcc81466bf5da1070adf79f5ef10598175c6aa47abb1ada659136114faec87996c8927431acc98e890d1daf8c8f9e6e0cb8e50d67ec45f03305c716fc52a2429d061947af64c51d579b3c6430b2fe493ec5acc0fc104f276d1e7a20532e58e24a91076d722914e1751c2de5393584f1f61aa02b22d8524f3515e474d1ad8c98c134582d50c8a8fbe9da4150a2422195656b361155214b5bd79fa2975c87789fb13cf2ce2c0ca5bc0de8d53ae783b5bd9fa1af10be50f6887d48ede2e77b2fd34c5f65e6e0677c819dc8d113c9de81aca9b4323f2366c6de96efa11c294e1fa06efb894f84973b7623cf1ef59b957ca17d8fae0a90c1a0c6c010401f51e4482ff3257ffd628983b3f122a875f50ba1d0ec1aee0b2f931ee9274c4ee70cf333feb6cb08f21a4fb11edf84157c828b7727f3c729c0a0fa1f45f1d0110ff1e24528278956ec4a8da544c482b73ad873467dbb9fca69e3859512abb70772e72170f00d6ca6cfd419e2311e0c476ce5a1715fea60a198d5d1e3cdf9df3eda682fbb728b3b4e6993b4ba90118c4561182e9e0aa28b2e66a6ff0525a2b7fbeff3313669d36e44a014c0d2745477592c654a1f656fc0b75e06254f3cfe9b4f0814ad4315540956d1fc179370e25a73092c3c78872662e58f5f3b26143bc7e9f05dbd98cfa4b12590a0e34c00c5d048f9c95fe20ab089206acea458d06eb5ef1326aa09dbcef945f78920ea21e81f4e52e79e2517a726579c4c3d3af3fffad2f8f3a02e14c49506c1bb761d5ce5f8f6b147cccfd0317839dd354df430a5f7ad1f4fbe8db7e6e9c969f1137d98095527757559372e5fc479eaccc5d6baa5a0a06ef9608d5dccffb2d92719ae4f6730923fa4daa1b5884a4785d9f97a1d5e73e9fc90eb2910998424911274f10ecd1a860d35f7177118d9eca1625f42cfe2091e34e4b5b3e5572e6958bf0d1a9818b0dd0a8d413666fff245c37e3393a21a37da18d0110022b817e20bc4a3819cdd0a4b0fc4827c0e16a2f88209fc2e301e5275341a5cbd766b9b8a44479f8527f6c194f78070a63115a598cf9c14e7479c83f18f62177769c2a05fcf28b260f263cc06583903addcc52e322dfcf61287cb7897d9091ece987a2ddbe588a6a979977d9fb0fe23cb8e8f0c1658df903764a75b8a23d14bc4c743d785fe3b9695443f42444606723808b496afbe97e37770b3918a05be3ea1084b44bf4c2614ee2bd8ee144c8ad3d4bfd152dfcc5a80d8872d136ec46fe57ef07cbd0e1155ec8e560bce2330cd1443e00e5346ee7106a7c28d7d951c5359612985425a2f9be58f0462814a2dc4c1b14419cb3be0291cdd81ff61b3896c5c7230374a127143269e6d2f45e673f5199fff93940530902ab1806981382f7979361bbe0695e4662f39aa811fa176bc0d77259d963f367c9e7eb40f5333132c60e4cdad5903a1545e273667aa8ebd42216405e68d131844f1578ce591eda470aaf0cda3d1f2b141b1df4"},
+    {"000000000000000000000000000000000000000000000000000000000000138f", "005ccdc553532b92e89982161cf128fe755f1e25f30811e95b59086c3b30ba6396b8ac8e0d27446f749a325ffcfdc7300e199b5bb824d949883e39f2f4933132ccfe2280d1d24fc3f82357eaa9e132f1827f8f4d01ea432f314793715dfe35578567e33a93c0be85a217a79f4a730f3625ab93731c1fc01c6f86ee1dd1880acac4998461e32950b6373c35d8378e6afc3f10660fd5c6f1ece9c09fd1a632417c4841f1f18d794ed803e7449268428c6c26ed56110969837aa03a37b72a2290e640486e9d6d9b2b42cd7d67172e85ae3794be083e35a9b9482a89e27c19485afb2842c8c0f941792a24d5718451ae90d77d84cd5edc47edaf0b7b66b00aa607e59d48ccf08194f2c04b990110fd2457188f517017cfae2ae47ff83a3559bce297357371d28ff21d046a3a401504c5656a827a5cddf96e6852f4d70558c3571f7adefad5c52e162f57b9a79997757dfa3206574c4a81126796b7f5130610dcd38acfde57df1714b2bb19eba14bdfaa7e91a983bbea51b524ceadfa2f35cde5390c1fd59bb4f77e9fea37f63cd4324b9642176b68069fc849594254b571d8ead30254fbe879096a46bc2393cbb7a76e6670beb85d6dcd906f44860f16f9c350d9aed94c3b07aa42fcf7e26e4d96bcd00ca07b0cdf8f60898fc2e4230f6803c5e99e53a9dd1f54a1d502d3ad97161d82b5121974eb3b47fd6ff809284abe789746df0d4662852fa28191ebd5b80cda2811cece07f29d5fb2c05568526e3ca2b35f7b8ff91061093661a23b712df134da00d7e261aa2190e3016900fd4330a1e539c0cbe94e14cd0c8b87e71d59a00daeb08a900ed3410c5c820817456c7582bbb9365534b0f710020d7a454a7bf7f06742469b28dbdfbcd92c922587f4e4466394fff4f872e4e65e4c189fa8f23a3142ab17548621e07b05c3dff647526e78563c8300ec300cdf9365173928352d69e1c75d7e9c588e480fa294a26650f0d7ac0fd2893abb9332979f5daa9a1eae2e0ede1a51b4ecce926157725b5147f93f034731d356166eb60c77f091c3951baadbf9493e9a3f320d4f5510d16496e92b9ca1505a220d48c86a0c6e8444214f66291c9907e11b478eb3435032364ad829a34340bebd27558a75e65b34f87eb9a7cd7a25ba86a26b829ed3c32136afbbe357656b41e67f70695fb349027406ff0af14a25dfe56278a26a59ed20423f89c1035d6e53175aa0c9a16a9089e78ea05ccb6d68c38a08b56553e56f520be89910901206455397b45d882c44fe2eb7fe28674594cb75af6abb0931c389aed1e410fb3471892460d9c1e9b717547174ca0ff932ea0a4208e25ba763c291826a447cc5e32941cdbab4948c14c7335302cb4f0ab2e8f1ea79213498a790f9f8196555d7a3606e9b71e1e0c83c1ec9ea439dd33d8e0c02a08a72a896428b1ac8929f72fc0085a5f4df70510b24a8e9e3d42b84c76e65e94d2fb94f8b185fc7721bc49540b74fde3d3c38a2b33cba6ca25f18d4778b52a87f52956d1551ca88e59254af1a21a05a796cdb0a59f6fbf8545a13b52040aea237dad97be22e53ab2497da2e370a3c855d2e37a873bf478692d2da94c6159148d1dfdc4b99bbd444ade4f598116d45b8a8ab1df65f75e2c7c522820992f1cc47c676c16bf6bc3803d37767a5f60895b2ddf41d32563b82d0447988cf0c0ffa8a980e8331d595719d4bac8e2d22cdede8a4131b7c64585cba15416b2173d4e153946c92c405d12890c779192c395774411348bea8745ec7871c98d203efa07c3d7465bdbfed09aef6cd89133cbf9cda872c43cc46fadfc17b16c6c819277a36d67f28da34370f184aed92c7c062552bd3bed2c7f861a9dbd9c61c22dc4e2f28a6d7b144bfb9b99d5243e2ab33588d83"},
+    {"0000000000000000000000000000000000000000000000000000000000000b6c", "008876c9418cc0fabf51d07b658daa5a465cda0ddd05c3042d8daaf603ba9245a1c2afa7158f485c376e27232e770956972b85ec33db7df69901fffff136fc4c7c9ca7c3a230218694475fd2dbff8ee74d5f217b0509fa79f307b49a8f03d367f841564f4eb6bb18404ddc37538ddd0d17c2da3626cb675b6ea03e796f1f168ccb5f7cf7ab51c22752a8567e96d144084c13c335fbfbd654f86015d4da1401916b7b9988f49c5d3109cbde61aba236a9a914b21ee040ea1f836d3cddfe0d379541091debbbd03ac0ee8f6b9ecc508cde61b41f24c9d2d326626dadb82249a99df311a54f7e05e020f85e5174341ddde5fd56400e44115f56cb1e4afb0e12c66755613f2f5fce152d29b686154fe7b362f126d04ab0828a7b85dd7244e03344e34de59cd7b7bd1029a7bb868ef1233172f97b4cdb05674c733bd9162f28849eb310e276d71dc46148da21b93f894defb30251c6951d5b4e2d9397777f404fdd96debb59a30d30d1db51602f651df858940a576fef3585534cfaaa1b5875b2170d914c91fcc514f87ad4aedd879a9d3e243d8f7c0f0e4ce68acff6f0704f01062a3c971dd50996eaea3891ea1fe0cf216d8b70ccac8ea9e4d2f520b48cc0b79d900ffa96b3bbce9fc8992d248e83f91b5aed1b975d6f3eedfb1274c9fe5fe4a19477249b2995532d98ce7d9dc0d152ee05cb7254dc6e115c2f06304a6c68486d29b3956495fcf884cf4781de5cd10e60c99eb41921418588c7c81056c6ae0d5973ab322141f9bf5e8ed59f133934879859fa6627115c012e41bff31cff915fa15317b59f01edfea9981fb032270d8e749ea565035d47b6c23a959707e213f6bcfb2d13973b43b5068c8ef618aabfd65c0bcf47e97e15b11d641af00bde89b54c5e82137b3e39bde38493e35e31bdb5de184d58676374247d89d7317594feda81f2036d7bfdd387c4baaae400f187dd0f6d3df577a28a0a09fa9e81d9a9ed605396a8e661dd22f2eb9b6ebb09d8bb139c8c20d8e9c2a13b05c4f4954a709d463126bca3e545dc1125fa5483d1e9fc6a69444f8f4bf80b16a1728f9dc14372c326091655b8caea2c19cb4b2e7d83f4191f355b9e00e3a5f42984b7d5559f61e818d3be1d628a725ddb6692c9e3e1167ddab71ced541e8cacd17ca4ac654b0e33c2743c885194a911755b0cbbecf775a6030582fbd0e277c17308392a3526692b59edd6f8a4742330ae741a72d3abaf1b02992a341447871ab10c8108dcf2f67ec5ece479e55ed5036e241714670de5939382e4627d0398daaede6afabc71197db42093f3da9da0a093003a5c61f3a23f1fcff72aef5230630d098b367863cc31b81d96614b3f1e352fa0fc79dcd907934a8ad440dab9ea72e3d63e52fd32641317ddd1718cebbc97968bd5d7c9e663ef3c350623bddf64cb8c2f26d5091de0f2a9ca96ba1e97e01f6c29ad9a6aa5d9fc481605387622ddc1ee914cfc2745214407f0d529c1467458e5cd9c31adebae9f97334a7a37eb9e6a274802354dc56206e611c7dc84e409a61c4cf34ff43de3b8846afb75cefd6ef7ed382942bf62909f51167162d515a85f63f49f38231ea7070f8f95a543c434f24e3b44b78747df95b052fca2162bc50ab1c4a30c4f58ac25846c7e52d1b5a4f6cae209e152152b03f2a2334ae9e333ea41fb8693fcfa770e83ae46d1a56bf35a506641816f3a4a24281ec6a81829ef4f26a10fcdf40fc24bcdb649a73c2d1a772620957e5fc4e89b3d46cb66e3da4b0f7e4eba1c28fd0b2b56c4f65e0be6fbc641b0a15e6bfda334d4b7711f2d95a490cc3c92dc94a344584a4df32a3dbedfbe3f462624d7dfd41994d254f789fab49b89691e735f4e6d177e5a3858cdd72c5759c7dfb8067998ff1dc1"},
+    {"0000000000000000000000000000000000000000000000000000000000002b93", "008f0670a8d50c02c3e44514f265459da51df724924796ec653c398f0fdf88b5543862d68dbb489258d1201e423accd7222f99ab0276d6d36e8d31bff3ee744cb36f6a4a23f72badafe8f635706aaa86e1758acb07fb70ff8946e8b1a65376503fb6806ab443b80f37175470f41b160ba1a0ec42e606e8a77b9cfade53f60ee08c182f083a968c1589f3545e824a7d4f158e5820ccc67cf6a3b807d4c8e550086d9c130f17dbf283046347155550ba735afd350bad59793980d3991145148da12f01103e53977bd2469d2ada767d6a3c7d5c38ec7d1405b0dc25f7f473cdaedbb53399e09d01bc431f0e7c5ba1e75365e86483eb37da69bb6f7d40c90675b04aac0773ca6307135ce0dc1ee6a1bb3f068b250bb45a558a77b073f4b71bdfbe8919f5ec592f5212738a276c6f4d61b37522429220cc4d0f97d58e9760c0bc7ca76b3503bad15880005e654a2fee34796601d8e8d182c6e8ec895040c8f1ae7b5d040df90c9d0ebc4241335e1e676dfc846c4bb068a22ae459a7dc17fb294cfdeb26f79790c55b1d5233a99491bc765c368b9462738e9face214e720a771f383059f9ba86a0cfa3f48941126f6ba193271c8627b45babf75a41118c94b759f2ba41ddb51b9360c4a8232f41a387e8f24d76c07e121f8bf2c2bb7b8b7ca3592a0289f60e09b644ee7d3ea8e9b8261dc04817d798f09b57a394601f865c71598e459065f9081e087c7509e59ee66ef46aa7719c593324dab4106d1fb47c9522bb2d2464d28db9bd61aa0771d10e374d1e0e7024aa75ad7064a2ca29fd37f9ac7331e1635ce09bed232c599fa0d1b033a628de59bddb3640d15a6e6eb7f0ad3231fbd2b07b393c5d15c7929ecfb527ebb702d0a1ef6fdfe292d4d7be16a64390376069af8acde8902da74fb098c30e4171d6c518b86ed9a23e11ca50931149ceeef0b00d4bd1cc3c2de1d9ff643dbb52db94f74241e285b223c379b1bd56f71683f7272fb675794da3d5a36d70e2a2a97b9aabacfc535f50153b54701f0e39b1f6f1506246b4f93c8337b14c5e9ed7060661b5916ef150112bad677f0fb6dff40e0fd4c18714986ac7be8d514a8cb3806b83cebe9851273db56b4cc9e9b4c1c6a0a5f649454a6c4cd425eb11fb9c50999d77630eac61d4522e35e0e8c155bc4744c406876a554109338a600f5c7c7198ee143dadfa62be2629195902c5504fa15cc00d4a586226fc09be7338efb62c1d0e9ef4af01bc51c09b0c922ffd69ed751a25f2daeaee25880391cf76f00fedb801fe898c3b0896f9376120f1d52e102ed3c2cdc424b837ef852484ef31bd5648c51af413d9db503f39cdf51a1b24a7f3367a95b0abe79966e0528139e1009d3bcf99bc62279fc1c35e7c0100f4717ee03a4ae1ba031243b122e97474a59a6615214cb0b393b138a4c36b3f915556994e7348e60addbb0a1129dca295ecea19fd6ebd3a7f16e5c76f252b7b0331b1957be11670aefae3531f9ea7141c8d6378e25b51b1a3a71814b10bbf18763de6ea1e26e56fe9bb5991f2ffc39301b27a587fff20b6314393e1ab7124ece4c6d7e817357f6fef290d542d4f96dd5fe6fb1b3dc230ce416c69ec331fecd52710d3ac9bb6b605dcb082543b96b568ae12ba768e8af0c53ab1714dbdd2eb30b7b86e5fbd7b875bedf8357e079a9baa87915cd5f1b6f01240e2502c5e29f8349f9f8e2767cc2b58f2813d6734acb190191e865c2d5f37a0e675761de92ec2ffc7636b0cfe354c562f37b1752646dea7d3d78570b9a89e994c530586220a8ebdc5b78d23de1b79bf516fadeed20cca40b05ee75cfca57790ec66cb936882426acdd92738ec9c6b2f2b0d4dd30eaf1ed5cb6af2d58f98e8aa5018f8512b65dbff3bacf12dbdc9126"},
+    {"0000000000000000000000000000000000000000000000000000000000000399", "0105ce49bf09a646bf50f7b731f3bcf2721518c65a30f86eab949e7ebb83e73382adc20231341a9be93009a89d3f238e7faba90ce857bad9763e41b53b5832221459ea8d262d7b98a04733ccd908d1fb5a75195f0ceea9c95da010c5b04207d681684d1aa37ddb9cc754fb07234957be12f5ec968220e5b3c2adab9d2e8e17d3ec6f78a1b7dfdd219271ae958d34d7ef15dfff372a4af62156ecb2c86ee59fb248aa09fbf510cd72011d90c1d444e44de9f6c0eb0f7ab355f81053e4c82c4be498a15004a3fab4d40bcaf2f4a678e45644f5103b9ebad49fbf29c4bd51b5ac9446363270b48f62112a1a27cc62005394f90705a4ba8b35d6145128b40175991798527146fff705982761759a844b38deb323f8f61a25d0d3093c5f22d5a5bab957ac5bfe1cbf184d62ef5207caa8dd6203ec854b108a4191d3b4d22821bd0cb2bbc0e9f6e1d490cf547ee934511841af011f73d20caec2a7cf54935d16d5d9997dcffa58f10aa2520ec963ea8d71698364a2ea0830e9b4cd259f166d25003f99945153be36f1ecfce44a2f6955b12830b2b9ebb6180601491dc83c5d75fc963706f594910a5a2c7eb39602d5f29700ba37bbbf8441cfdd8b052396d5afc549bf2c9ed545fe7ee5495a325253acf60ce8a641cbf07c01fc74fa50cce8fcbb0dad9ba17b0d154a33cd62ab2fbdd006670061dd1ec65af656930768b896cb96c16b2caae40bdf4cf945b35158e34f10b513040c06510ebc0d3385e25aed1d36cd91dbf71872321a456f6c0f9159d571bc5eec7a870a3727353dcf4b5505a3636b4b9814096bc863d6b723789c870f17e74a5fdb2391dd38e3a37cb0b74d283e9d75f50fcf3e8b7917a4d8e1e4b18c7b2702a8aced2b74461be966a40d92847dfb4bc20d0b6b39b11f6b4a61f61c3a147065cabc9b1b5f43295a7e11d13f086e100c01b2d73861c65d978674d1a13363e48df4e9be0ec806770bc53d99b9a9326f81fcb632bfa9e7c5bc463e13c05b0a82871c443a4e717a9ae98861b4c814aa49500eec9fef9f95f3aed4c64f43e4352ec2dd16b082109c098c2a1e23b94b2ce26cee15ea250fd79d89042a9152f7ddcddf7f266a660200b58f323746b2e51313bf8b14b155e808d0c6c1b17f1aa6dac11539e26e3c947a905c1515757f8c463f26ded79a9be3bbed35146a556089f0aafdd2f6e1aa1d77f84d43cd0ca2cb2846e3658fe23d6b8fcf22aff7ad6b7535a3516dd217d56ea468715543926e8582a0fe55122a7d3e4f944c76a676d15727fcca0446a075454966dc763ed1ff1e2483876397c678bf4ef6d4264c27fae59e58c809283eb7d9ea9a4ced959dc6052abd75866db29fd07431a655763e6642f53ee79ca2f6ed603f7b9dbc1d36341a91aa3fba0231e6da8638a2cb8c35ff2eb1bcc7021e4ad37e535b49e64973a8646d514abe38b63c1406703a38620d8f38ac96fbaf8e6023539ced1fd1d01702dfc941a497c78f83d21726b4b1437056fba36c23cfc7546d8e48631e5774a9b235d72da806f3e055097e9b6b921f60013d816343cfc91aa0f446f661f912719aca431e4e278a18f3f4c55b79de776ddc38522bc7bbc361eec6a5ca9f939535a28f32cf8c7f19cc39f15ec03d16aacbca34d3a184a0d97f18ea1e0e210ae32e722a95a51b6341d12fcb1ba6f91e035ba958172b7fa6626ad2f77606e347b6cdc4550c8071cbb51c5aa30a6514d48de7b205c13e318ccedd3e3cd38e1cf2a49528164c92ef1ac3b58b4eb5e9bd43dac1d70be32f650508190fb83518ac40cc2e9270bd5f8733145f1edd520d81b55e8fb17f407b01ed0522f18e920c738b0e57ea1ba5acb3b1f9f6f3bce311e65da576437c12d8f7a853cb521a297f3e71292b6c035e73fb"},
+    {"00000000000000000000000000000000000000000000000000000000000010f1", "00148ce2afce7bafa649a72c2fc68d2b22f75c922909661c03f24b1355b7fa626f6a35cfc1584638a893054b3dfc080161906bd013d4fcd79cc101dc50bb2012cdbbbd21caab62fa53d2ecea544852c621bd0a65049c1854ed5b17e0eec0b0ed4074bb5a8946397b850fcb0bb7eb9aaaab5ea6925dd251fc25769631380d0d505764454d68c38f1d86debae409f70a4cfd7ead11fbc19cc8206ef171207474c5d7e28e33145cae8600ffb3e8af5d73c3ec0c72405bf4522364eb3c60cd0d765498eee3ca53b107b3cd96d4556e46f6571f490c2a61e7d0c61c504844a5571a57266e230eff1d9249696741702c4deb72c707502d4d10625ba19eb84c0ad5d5b9d891f1231b77071335e47b9a2e353fde3a3641afdffb734f99b7e6d8988368e56eb08d3b48632ba25f79d74d06755fc987b5cc516b2734095ef0c32cf881ebd517f0a33a62746565f05f75a6d65bb0ec0240e6e75e3087fbf56054126a4befc1f356fe69912cef93940453c387413c556fdaae35ea33f05d2fa1043528508a09db9fd9b4e1ebd2d3548909332eb56c31c56a4043155dafffe714165273963f92efde19da02e458fc2ec1d85248b463b274dca2e2f5f8db473c1a325392a6cf117f3f3fc41b53def655f40c9d34c0201a7749b0cb0d77cfbea2484212d32156883b8fe92f5b94504fad2ad5e3f416e53048f555bc05b1d7f2053218a37ec45d710a63208155a0ccd19fa2b227c544a3037d98f7fdf7e540e49759efe3cd71c40c5379058f3ad762a56087976e162d50b8008ea5cd36f8c063e91ca7ece15433927efa649c7d9aa774673f7fac0c942866b050de2ef53d94001ba774aa67c8b8e23b3dbc534b7b95014b1695d756b349b6e9da1ed4a9f30ec2d3d4fe747585b96ab2533ca298ba1577b848291cd873e122a263ff3acf953685b56f560d4091d3b6003a2d48410594b0ba345396c83e85159101599a7035be2e88b6d0eca4dbf5a914535e85426596d3c36a075c43351a4a54049c3081cd9e4a63e647041902071bd4bdbd0ca2a7594df7d34c514a83c7260b3b98030c86be0a290b13b59abc76973df4eeda518f9f006e384bb31a3ea295cb1d3cd75f5ed07871f460353b51136a6ef84217b0b58ccf24cfe3c18b2a88b6dc65df1af290df4dfa4069f462b56dd6461309e92b71a09302b5d38bb3530777a353f136d045942dffea9f337d25c376162daeac2592a844eeabdfce8a3611be50281a8c1b26f9a78133501e0603b947cfbdaa1836bb053d484eb1c9dcc5f50d46e9382776f0924f9c7635690a12518060695d79988c418185c92602eb953e12331b11c5e379150e53d585478bbe40578afaa4791d0727cfd20a450c1c9c7e2904c3436d50fa8def149c585a56043dc9f48791c74215f3bbcf751d800d1f136801ade205cec6593de3870564f44839931efc7f62da01c64291ca822a0f1064b668fd72dd5ad37b185227040e4a0188610487867f21b6f0e12e9b46407aed4205f68f93ffc68e6510ca525e327dc260db627d6d6504e42065168acbc3793e419f3b54cab9159f5138fa279504151eca62398968663d96f2115a8ebb9d86770cef6543cf13290d0bf235a089db40897a412d57a23c7adb616d172bf79c23848d1bcfb69d24c9cc748a0741a4b289e271b1ae3cc3ffc5e4c8e1346d75c7aa183b86323b0bbc20808e437267d19685399f17f6732911a968fd55a9f7914e72beee9fe18912aabd68122a4af59e4634a729d96433f38fe14e8a1ab018dbe70d8c1b3d7f9ba2910fd2f20010636da0f6be8c366a1c730589018dc0ebdc6b2556f036db81bc82ff31780d9c3990141f2f81d48652043e1a442a2396f628481c70c9084870f551f32be346a5d9b650d5abb8b2f6"},
+    {"00000000000000000000000000000000000000000000000000000000000008a6", "000bcfc59ad2b22723cf557da9ef5e465d7f133eff4d447dec3fd68ccb6a11d7fe67de526e665bb8b0fb456a0d16b6da51ccf3af245f00bf5dea05bcd98157630cac81e66817d780f2e70a3a6545d22ed07bf3c90ddf60d1b8039b51a8021230ea9ead269c26d7f12012e782afeeeb5d31aeb9b571eecddbae8c4cf5917a3259fd6201b149359798f3b67fb760511b88319d4532de545c4a189fd53287451cabc9a4d9e9c496f80a007d58131b887582e77a634b7c47820131dfaf3ebc09e758dd352e23d7f06f345242dd8205279ad678110a328661bd64f2eb73d6014117a35b576ffbde88bd191561bf48de6861c58347de95550a7f07e27c09d90ec336f87eac3f01c5ef3191e336d4c91dac36fe4e1d3d430dc70c7945c82dd3b957b25ebb19449b1756240e77f5db1fcbc5b3e6e91cf1fbde734d781d66899892d7af4da7a5bbfcd2ab79216cf94b209e59e79c044286933dc85ad3ec2fd167443e9c8e2e21790ccb3197befae817c941a37573d41e48b8690a2b0ff6e30fd89da1c9ca7e00bc40212aa09e4ac1bcdfb27a4320f946deae4e6a09600c325f7de146ba75b51a096d073b2cefa1865b22969f769370fc7eea88945f06044d34ff2550d6b9671e0f46efe6fc9e1621d51e889918959a92e7706105d1962244bcfeabe8d00a95dcaf212d0dd2e24b0a771be0c647a7fbf456b97675eee4076ed1f91844ea6eee5d5303d45aa701af709f8874961e3db8d1aebc13e07ca99c0d7d8f1f64ef5cded142874293f525a47792f4044239def3b5715679fb3342e2c50f4fa5ce81ef766a979169e272a92e5939a90ab42333b0ea4401ef78d3c92550d4d1837731d18420b12f23470835538793744f41cee9e724f5bf2d901cdc9914d10d7623aa7624cb122cdd6e0dccb51ea75708f5109d6d298fdabf05901673fe1592a37b4cc00691a42ebdc3b294a6946457794cbf496835f5d5f714ea228670a7a4a15a76943b51c8dfe996db74c7262533d43df717c3a3181c94e6b5fe500e193878f9903a17a4ae1b582483f9b2f438d5a57595fecf10c6ec0ed9ee3777ebf693ccddd69f34f72926d89297ee8e31c50d88f2515163075604c95f272357617bfcb263144e4b8aed1450b9a43ee3a4fdcd616a2d1357f2bd5c9fd34dfdea86abd73ac7fad3e0c24a87cb5a1df90baee4eeecd290c5f5eb7510c1fb33368e795e150e24a152a63e0aae59178db73b6d3c6f927327768c8f12269dea1fe2246d15879190f7b9cb40f0394fb0cd2651dbca84e3bbd3ee30e3ac48b679e183df93c9a913476cbbf99acccded3614181cf9f605529d9c18ba193341d0f8120f4898bd97d54dc5e849f7a57095d617c38417d5182628eca0a3d63d44c1e5e1ed10b5dd6b54779cfcac19f3c9cdc805aeecdc9b18e37a2bd40a4dee7351872af39efbb482ee635f49eff8582096177ee2e382379a8df57d121a9abf178a0d4f3d37b80b39f799c94af1a3b127a19d8f1d2c2ea5c69a83af3587a1bd88ed099d7dbcf51fb229c8757a9292db990ae646c9c4032bcc9bb77203f9512e04c43ac8ae6427eba478a24ad1b0d647b61944cf92562bde97278c24afcb7af3efb897920a73420d9f8e1b29609edc4c2a09dcaa38b3de19ca09a4a35e6ce0c1f6b637e4c90f16ef03694f067aaf10427b33738e8da5b12f506a3a8aeb9336d33d0bdab1160c83ba36b28778de4db21d1d5ea796e624b7eab9881283c7017ea07e36900c30d2928c0d94fac999ed46b60a77bbcf43749f900a22204f5a16981a9ff5e10379f922d449c74b7aa41d4614ed2e7ab34e93e57c25f790f1e6e2325ff45a952559be60f4b36389db149379823fb6c5e72675041c2bcf336f61588bb5bfaa14a4c7b8b409ce61d61ad0"},
+    {"000000000000000000000000000000000000000000000000000000000000086b", "0003c35591af1b17dbeff0d6e4e5ab65efdab06825099efdbd4414c5cb0429e596f0f4d553913abeb64805e1612e8fc86f53a17c22f2abf69939af6b313b2011947e39672be2e98037974683ca23f24eebf731371ac49eaa9714dcfb11f5539471aad3120f5274396d1c3911fcae63a71f8f4f42acb6d3a1a99bfc34efde2105054a0a2844d5792d72c49fb603260357572adb4ce79fe51b9a9a7fbe3ca7dd3ccf00be8d8cbac91603eb28522e24a0715a9e76368cfe5fa3151e3dca8f19e9576173928aabd25b72aa3771d0a98a5833941d0ed647ee0f6164d72b47d278efafadde22c296fc1547dd872f10db03f116619690b3df198dfd2c7d212b09ba87688a57a28d5d9a32cfd7cf498d60538d5e4b0f0119c800cb935fcac256e134d86535bd1e7a9f5e0d622c2fcd628e7b94609155fec477b1624fde2de21095ffadfcc504d7d3cbc2eeb1bd14bcc59c8af52600a79e405fc66a22ad7e981158f509025d8d33ed4c0d29f641991e6d639c3265defc352e6daece7c7c9c170f5232d8690615f7d26480c9481745abff5bba033de88e6b96d89f5f7a50d524b16d8871dcc3ff22980919c866e703dce4822e25014ec8a2a28ca0f7903b137cbfa2db56f440da02c5dbd1d955eee05f9a80c31ee2f3a691a848a77b03e23ca265c86e8526d51f002fda0ad50fdab1d97cd548a950dcc27321e4df6df50cef98ededddfb55f2dcf189b050cff09dbff1a09c11fdf6b91e9ab687ee16a8d31febe04e5f36d69e1f1df4549524cd73a8bb11f73acbdcb423dba81f92a432b89277cca371c33af8b6ee7344bd6b03345b9feb0e2d8fef4e674099ed15045cf1b4b309aa94df56a91cd7099fa3cbddfbffb7b42752f0a3f7a47e5f7ab1144d72f148736a97c88d3a2e2c6c4192c3dc5c9d4e2e17029a784ce88bf83d82ee3a630190e53e70e411004a9680f18260d70cc7705388c45a792b7bf7aecc116a858b10693bfd7584c219aac86bc1d208ef359113ffe1541c1e50558b6982bced6bc0571ef47e2c6e24d8f435af5ad6a0dd6ee2575f981e7589a78ed8b8013c283bbf6dca21e3a8f863e3e6933643a9db9b680b464b830a91d142dba1e50c203fbc761388f4a2fb0a618b673877940bd7f024b87fc38af60aa679aa7f1a983c5520a2375fd45e05e2e8b9553a9850393ed80951ff1812169ee74257e17285eacc257a63ae7be33bdd4d30b69b9ad3a6aa67793b511a3653415a25b414019e1a1a69ecbfc02bf1bf119487c28fe5376018143e64e835dd447960b691f26bcefd44e9907f16f6228607672dce6af6aa7ef391735e811d228f9f2eea33192c0334523d9b37ea1340447786ce4a28f7f7da387fce077ca8f213c6593612ee46487a64d53ff339533b54cb773488c3aa14a7b3bb76d95a607bb9455500d34f0a3537d93df00d623266a5ca18cf215854d41c094b3a159a82f7258846e0dc6baf52a56f98db2007b7122330617a5b98ac714c4f56d736670c7709d61ffc3509eab71955df7012574a7ddd561918b55cbb01951da1ee8e6317c9aa442270a64a82114fd77b73112bed9d5a270eef920762127b3945466d63582b9d0ab07529c2a3863d47856215d6caf880ad35d928f321098da6ec4ab057ad3fe52774e9e1fa589a3431f105a6a1ec955ae9bfe11283c7a75a197dd4793a8eea1930f47a5f151f435761b1f9737ea6ef1a25ff53ad23fac30bd60d45834bc7e6f521616a25c2a57298042a3d118e300b52dcd1e93b9d83e4508b236b3fe0971c59e5ea6c594519f2a4f3400bb7bf78eb59ea60ea6526e37d719bdcf35b1327ad08ed88def87e1b81cb20da4d17511c157130d7552c117383ae034739ef793481d50dd2d28fb98e0407604164cd51f953fd109a"},
+    {"0000000000000000000000000000000000000000000000000000000000000285", "002323f5168d9298971261aa304528ae13fb712a5d1d8ec7b757d4a1f18754935e17b67145015b3f58300babe567800f771b4ab14327562fba2613d2733c3c0f88a773e3a995d5c7c3e1b30a691f5ed97d3b905213d2427638ddc7331079d6978e38670723d7b9cef028da51a0bd385c3bdc0852c0d435c280e788f035042c27dbe964f3133bee9c130385c21b54dcc8aacfab3c9585be6c971127b6c713d3502eeaf1566595c2a003b6829d61b8193feddc511aa0ebe355905a59ca3e23fad13cb2cf2e53bc8933b1553abc77275c5e171e17172ec8668ca3d78a2ac380ddebcd852b8330eb911de095b84890a4d322e862e467c3971109033969401ec9a5dea70f011720e9b74195645a7adc0b597631379bdb53d89c1b7b780539218a66aaf29cfa39ccf627a05ab217535dacf90f341eb7370f2a8b6a5b1212301617aa97f59bfdb0e225f006347fd767819ffb30002e45b5d08240fbc81ff7c25673931f5a2adca8bd02a21a84734fb1f96f325591d8e271fa9e9a17fee5084e8722d548a6c862a8c50ba665ff6d62f7df308a599c76c7d62bf94d607e26c9834b9baadc3b3995e30ceab0907a6baa75aed3318fbe95cb44ec93ad6799123f2fe08d963419867cd1f790470561b57517b67f19cacfe9aa4e3f8152f8f65610d605ab76ec9d343b28675991100cb6bdce42e6b880c0dd5e06d41b8d6e032a04cbd581103842dd51b1b4cdde2541fb75230508995567f0567a9be11ea437f05afc39aeb0b53767204481e88499f3e17d5a46f3acf4fb6711687b8dc14d805656a762752bac8746dcfdc7202a60eb35ee570922315c5c6ccd7f88dbc204ff4d7acf51857f9482254572cb8a4bf311c7fdd63b044b74ee626096295b09821327465d3d9def3bd64c60b4ecaa7e737bf89a1e0c5431ad77e4dbe7c493f300483d7247dc1bcdbe00aeceb17b088bf5b2e3674367e8e56a120e9e9a8710b9e3bfca9eb5ab62c0a7df19f676062c3d7cf52d00db5d3f3f96b4e78aaf205af3ad5190fe5cb063bf010ab2e8c75f93c75ccae5ee10e4c61a68e11bd29a04cf07eff71cb8c98b90821c137cb94ce844ff2fcf14f9b5f1aeb3b765e1ad3682345a4f3a269e7a01181c1cd3f7f1ae9dd9dd84e6471d4ddba690775ada6f4da9ce9defdeeb93fbf376887a523a0a13c8ff1f6301ca93eb6e9bff47896381a1a194665abc29573ce709f6b230acc959eeed7e259234d060aa1f3b3b6b7a07c40fcae7985b8137a583f1accd0481132457d34a082edde78724adbf9087727652e49f714fd6cda4fb0236c4b4dbd1c35ddd25f68f283ab4aa61e77b466422333e07a0ad5c23e83fe85120e9f496fbbdbe96ef0df9171878a40d89298a231662c6fd1610adde76910f9823c5c20cdf7b7baed1446c4b6519c21dd3d3d700d1c8e55403fd298fa10380cf39dce36235bd2d16261c56a87a55f3c14e89b51c99588f32f9325dd98f0238a41a4898e265927e642e37417bc5c4b7f9a93a0e93775cd91ee1396c3d64955ef47d7179c27ab5dc00ddf0f8771c3ea1b44c34139d607cc587d7f6acd20b60bba0df65dff1e7a7b47b4bd56b122145172b690b1196099d8f4a697819a2b07ca2a061b5a95bf74917ac1b50899c97f1800391e6c66d0000ebbcf7d77901b0c0bbe85ec32d8ed3e72a23c679aea53ff9bb0f1b7eb1c3ecdc3719583cf2163354c1dcde51ba7b941b11555f9ddb4475bd880299f7f7bb3e159579cfcf2233fce372db0b9b53af75ae3de3a79dcb861399fb0c438a52ae1cbee13337f4b93e29ca2e27ea9ee53538cc4dbc238f28cea13203a1f5c00cad164af05b7f0d0b86b226c4b1f2761211ffc36c3fb117f5134a043227ce45606050cf1d25242d7be288b1de16ffa7bd"},
+    {"00000000000000000000000000000000000000000000000000000000000003ae", "00a6772f6e1018f0fefa448e6342bd05a60572a2692d6a736e4e1903d8d69b568e507dd1ee7340be47850b182fd40846cdf311b094226e39f199a2693ba5db3b31773e3f10a12b3a9cd4080bfc0981a4f8f49f7b00eeaa2b46d7540341a1753ac0f6b676f225daf5cc0a4ac2c05d9d137938dd235948415dd90069c8bb1619df0421de488a9cadfeb830ea59b4320f1e78651f1af70b5fdc74909bdb651410562b170678109dcb3100de0d857121a1d99086b23d399318c1229fd67ff9076713c847954a9b90417091af0f3aa2aaa8f5ce8231acc3ef621a3dc5c6ea39a963530a5294db392b345323d71778f78657f1b0c6e70ad5e355ee5e3567fa192f299be7d3a7fb7d42c9f394ed73b352cd7d31b53a74db519f1454e524db2cef6aea884f53707fc1aa236a378554a33937fae89680f964cebdcebbf6fb4847cd9bfb25e7633961d495a2176dec360c3a542f290115a7bb0dd9fc8ffe7e229e1c78b6975bb93cd9160380cdfc404bd5f4e529218463430c6624a935477b1db83f7ed5ea554d9d4ba57bb5eac66d76e378dd6d527376eff2ef6e4dc7d418f2617898d6eeb99ff1300ea65bc34d99bc2b94b9e7d89d6e162e0382f70f48367da2f0ac768e7fc5de7733a56ae26e28e6f488a22b7eada245efa373ffee153f424cc4de425ebe32644e4a145551f6a461d3810ab59e7332bf0a4b78bc6b01ca4865f0504e92eabdb0311f44b7e474ec3f74d205f0aed08a6ca401bf496119fee1a859f1b49ee2c80fe75ed2fa12b671d38a43c52aa457a9eb12d6d9a12365bef5f84afbdebe2f14b82dd9859af09e9ebab00260b5216493078fbdce2705e7bcc3e9c8547f56bc331782d2bebe991ffbb0446063a93f9b24a95c713c1520fa0457504049f7a40851a96a38a27b8916ee08326e0a22495733caeef8f5814bcd5092e7283e143803b41d446059acf167ce6359e54d84bd4b664caebe1f37aaa046e1fd33b3a95434197e0c62b255dd930116659c03328675ab0c11e1c8c39b633e7f80594efa313edee95be69375b89858c19eed99c6b3855a0eca10307365a2c527a0dbe412a12734e2398547ae99743db88f6869e0450798049455d950d60e2048b8d01a12085c55d59caa05c8019acf6377582369233d06a72725af377ea8ac97fd32a4edbd7167b55354ade67b03c0bb2105e682eb99dd128042dd1a0eeb697a7893402a9ba798e327efb7f1e7fe4542a8c66d063af2060c30336cacc97a97c5985464372ca20b21827d011b3ba094853f9df8e77214a695ea6383b5d3e85897c407180c2c7ac9e973ba8854ace74f34327fe93c580c16fbb612cca08565943882e841d07f1e5bb858d9be15f2b9e3bfd1fcbf17bcb39be0b522a67939b3cd9b43f31286f571643fc3b7949461bfd31304531d0bd003de20c53aee5c2fb859c20c25b50c950368dd47e32298b96c6d65bb8362cc63b4b0fc45a60a05d59a151c3fd5644214c38b3e21b327c5d55c27f5057fcf4642a45e2566b8b6dbd2fb458cc76474edb38c3785dd26d75d91af580d36d1385384c3dd8e4d0c0dd5177f3dc6248aad125a215ddb0465f942e9493cc13ec3f428f55e58acd41d5f24c982a93acca750e79d6cc2a435b06d16ff913972c7a164aae5f61ab218b99f1f7b0677ae9e680e26bf9b14819548e90189cf9c2fcc5907604fa038f9bc25f44b42415b6386c11253907e62118715e0a1300abdb02da5b4c8d239ee956ef5ebf43e80235d3d360031e40eb426a27c3d266444150cf510d0e89d5c45292c409bf3789e743e01cf6d6f7717412e2c8b012d2b5bc8b2548cd148fdf1658ddb2ee4339942f4c9361963b1c958a6565335daa13abe7ccf5e5edffbb9237b812598f76c0a43214ae1d0d83ab8"},
+    {"0000000000000000000000000000000000000000000000000000000000000276", "0030d24773a58caf67e24275edca3e562745b9356828f28788279f49b7604053e9b6febf95b500114bcc0153915d091de9d771a934a652a806fda19c703ba0117ec0be4b0f1f53aa96f1f0b463bb6d4621ebd800015e9c933702d7243927c429a8a502caf6b83fff980f1ddb119455981b31d64959806c307b4a42fc7c6208f8be5a63d50a171cedb36908e4c6a4e449f6cf9d880b2cdf7725d0937259695c68679a86be133759bb02a022d71f553f718d72606558fdd621e2823738ab0e2a9349180ab0c4f6c0a1fcb3fa80f8dfa8bf2c5d18e1fa6f2d8c65c377871206fc74407e2fb91c281e1ad07acd4e8cc5f8b6d0a41a0bb700d51d30377bbb0aa7655a094b2caad99e56eb44b7b452cbcf7fc6f2230ae492eeb79b31c0aec2f9c59c5c575999fee7d90d58a15418b04b3794096115ae2989c91380fae12017e1bc4d470c30e99d7ab6722bc6323648b2bcc48a03514c804fb75899f2c7c8b82dcce277643ade6e2f1b50adbff2d81443a7c84c2d62e637ef124e99783011129a6fd1bfa647fe622160c5c466009c5997709b16689c1fb30a26e1cc2052b8d0f05fcdc7ba3e995707897149551b0048ece314d6d93c4fa22489795a753bd02ad0a6908245025d070df8ee1bb2129c5422181165f392ef0e7b4ad0f822b5fb3640a66d093c62d81d1d1a5e8b9ae441bcfeb607a049e82da0cefe7128090cf621224ca482f78bc9f5c0fd672a87eb1e8aa415cddcb46b0dd292e3b322cd0722539554f8b413522cd384f10e923a4ac19c044b64f452fea6a9367059337f1a7dad4da1e3cbf4baf94de34aef5b547c9c1509cbc8b0bc443dc1c91e03a1c6d25830f37caee517419a766cb81be83f8b6288aacd4c60739fdbfd781028d2bebb570b8611497fb5e4ce3aa739d4ea3fb848401127cf9d571187cf7f25531be166aee9335fa6a101f0e2ee8b3ee321fdb07314309bd080f308dd99de13924df2db8aeb0fcb86b40bd44d3aba1ba7521b780a549ff49305c4f53a60c4ce5a72d07b149ebe8256110d735744876a27e10511e397d360e17f2cda548c08028a3bbe8e32ef8bd8ec04b36db4c325377d8db219a7d957a91b1b694926619ecc9373de5e20783c3410fe2ad5575ab60124f4d299c5cb0d46b708f832bf2cc7c9e8a0ec11bb8df292e4a22a802b56d9bcdeac0de5f0c88b6abc3de54f177e72c4b983377f5e61b4175ebfc9dfdba2ed1f704235de7d25d89c9431769b1f44698c8f91a809be55986bf7c5f0b249fdda8f2029e49fcdb6d9a7f7ed1b1a42f25e1272e5259e539022fdd4477c0b6bdd2a8da4381f2aa6913a82d7e3ae8972d62f1fec11f1bcdb591d10cb4d5271d0fa2b3436e784e5a4b07597cc425553cdbc8b61a8891149973bf33c3fec35953bed1204236a2ae1a5fa91f4da9f042d27e547f36ffffa5af4f6307e4aaf1a403a0b2924fd35e45f314bb5badc559d0a4e85b61e3dba877b13d2bc03dbf061d1c6afeb15d5f036fef793fb8cbc158fdba6f647e693b49b75e3e3e61c66f81839d8d90f19134da5d5a38b6796f2053f7eceecf46a5109971b19cf569570f9e7c69754d69839761a6dbeda09a317a474582d8fff46a1b5b36b5aa5f856a12bd65f9244b4d5e341d229a2b1a3192c0de477a76a45ff6ee706186e7a28c9807d9eb83232c5e7f8c49e49f9899107fedff9fb4f1a1d962db0b945439532a77b39de270e0879ccc150ba7ac16d616af29d466d79811ebdeb396133882ba1efeb9e92673268ef9e021e6bfa3fcd09eace20da4729234397e0e39f94174734b8df95ca3c2a7478445b8091bbfdb51f92c7b8b99a4defd0760eb33f1279d59c0cde4462673afe9998b47a52734419035fcc8a4bead91212e2ca612b4c9dc31351316e"},
+    {"000000000000000000000000000000000000000000000000000000000000031c", "001109e266da0ec6eaba92c04af5769a68cb783cab1e7baa98f667990f699b041b5b611fa9b89b1d5f8904e99c5cd7d127379ae583d96568a4ff32fb7a4d4f0d23c2fafb036dd75d00035c9636af55a113db452d072a5c74d6b2e73be25bf678925b194f244d1f3e7a1d0587aa8c6b0e9177e9224c25730f1cc32e910709205342b212d6026ddb3ad41a1c5e82154ec1fc5ad02d7fc420a35937afa95c8467c4fd971b1ee89f675c04385d09bf07da0988a31193884c89047eb1152705080a4fade16b917ddcfc6675a0f935cf33099ca51209fd116844340b4bd52ac346bdbe7b5aed4b3c99db437d424bc3bbf039f2d5558ee95ed0172194de2a51056b89c90433a6ebe869917a8534b981364333956f1a9823c64bba44c1de60d408e4680599cbe1fb7bb734a77ab47d12adfb1e9424c01fc7b17758cedc6fcf694526fd53b26267c72b46a5eeb9525dcb4b5eace2031e0849355b1db5e553643017e7a5b5ff8e3784b72e7cf7c76f974f53c39a180b59ddb3c24fe37d1c0d13da52344baf6031a4dbc4dfd0750706e8e0d9a8ff1438aed3bed193c172b156c2595cc4addae1fe3f03042ff42d95c4dd4ba95e63b20abb3d320d143e2d6104662ce64917e7436af500cd38081fde3f7832d3880f215ab570ce1d3e899452be99f8ab96b0b19898b8232a557ba5df13bb00c9f34c00f6f7f6588277023805e61d83eb4be450a366825e7e4ce5f15730b89d571c497e14875643110632365581d58c3b50825b66b2229d6c881024ef97ac9b3234ca47b0e4f71e379b122c894166c010573db9888345e65cfdd12e073db85c0bd3ffb2b267d6fbddfbe1258c2e7561ef40b3922624a07c4391f4472dc7e6a934c9f32686502e7a5d161917e24c35497e47e7dee45f24761525dd3435d6f42cdd674027e8c9fbbb4183622e47671f791b9e0eb0009be12526d26baedb5984a4302a919d5c5671c50a3e769733e86c744fb74af5643c592e92d1ff18695d176ce3a8419aa4cb84f6b896a5c4f0fa5b769a7481293a8a74fc20f6499b1282b0a698f6a514affdfbc2019b64451bb337a5bfaf41d7233f3244eb6f8b0a4c1418cff1d6d9749b5422a361e2ff7d2e94999cff9d128615b11b864c584ae685811747ebfb3c059ead513cd5db45b925d3597fff27ba5050094b1c41de3cb1103a6122f3d2ccaf96f1a196861605fe1be918c51d206a2cec2b70c2ede18cc9d96a6692ea8643da72aa1501d36c2ee795cfb9b5918dc0dc4d7206c63271111e70f7ef520cdc7d99d435fc42d0dfadbf419f89e1162a48daee093883f7be7494e9b1dbdd2d403ff21e1a8c6bb71bd5ea836d2309b0ec4f4be6efdb1fbfdb16954234d3077dee73d761de62e473391ae63925ab1ea0da380850fd8ddd16c6590b4d284aced277869e00d8aec284c87f5972df05bf7ce3c75e982d3ed66121cf471da2dc41cf19e782a0ddb7bc49943afe0ca404c82b8aada3fa03c13fa67f73d12e764c5af7e00e134af5aecd6e991bd590e42b457dabb66d41790a6d02c8cdff1616c1e3b0157785807d4431ebae31c1574010540c2ba89cf5f4532983a45f19e28b7bf9b0640a2f4efaf38878491d0a628a6dd2acf4d9fd3eece3504592f05b229061b206b52aeaae62999fe196d176092af49eb8900d7b6cbdd2ebe8256e9d5ad9b04b851a6ad5b8a20d23f38201a499462d1cf94081ed0b7815a48f97b8e69dcbbd15465363653f8b279ebf3813179464806f98e7f7e1dca2efb25f329df57272771f10c956ac0e26dd958cc464ba38afbe2badf17f559a43cfac0d1257a26109812a6d77675d72c3709e749851189e3ee1956c9f8002262610f4ee764c0dd9e05255d9a745305b94bfe3d8190b8165df6abc7dbe96fa"},
+    {"0000000000000000000000000000000000000000000000000000000000000329", "022e7f086a9b2dd6dbbf71736d8ff5c13af31713f42ae7664efb29ca8588c8c43b1d6f5ca1a073f181270a60d5e262973a07a58ea22830b5081fb9557e02d90b2af6027defc90b9f3b91f961a50f4a5d131b75e41045cffff8cdb6bb1ee8d71ce256687247661615e31e755cbac719e169e426c356cfed8b4db1c156d8bf220f1254fa8d00859a60a6ac07413f824a9dba945646cc8f476caa99c3e08064e5726c071e62d7fda8e802b227c58f4962dd1c0044211c2868deadfb38ad6922798a4576dfd6a1507b32e4b9e6a29d5fe3700fb30f1d658f685e55bf2452f87bcf47ee2ec0b1d72aad1da96cd23612eb15a962541e22c73a8d376f76ac4c0e44f9d8d44dfd31347aa51abbd733732ac35a57e10e7cddace8e74f93f4a5b1a701f3faae59cf548fdf2b652eb84a8faad3336a58080b7c9feef01a1fccee39e22214f990d6cae27a08eaeaf4374664acb4e1da0256f53a3193852b0e88763ac5719f722787d5ab0d03b1d2869696e5215ce621b04daf04e8769d7ad48704ee6931d1d595b6c835d070e3eb540937253bdf40235b417092afce9f946155b494d866d3adb6bd93ed05422b8d75e241d18c7ba401e47985fb875dbcdd301dfc91d5c4d756f5498222bd64b077022e9e396fe90dd865cf71aadd715ab5f6f918ffc48348a2fd760a1c351d285cce461d8e77e325c156c67217b8db318a05b640a5abdd1a379e7802379a2d3cc8c7787be2d0130272c5075b2e07759191b65b55b865c715ae88c709d57b04b1dee9cfd8bff10de85f01a24776f3ed8528c0978e85a5c9fd8e6ca5182be77411b4f45c5c30081937879ca0190904e562f6cc293f5dfb2ef03a060ce3e70b7f1917d6f217e423c4e41a0ab44a7c425c1fa9bb3dfab1e60bd06e2268e97e01f28983bfee772fa17612099aba71985d145f05c4ab2a3553bd674f027d6fc2189dac7b838041043a884388f275311877250d352767987d0bb119653e9c402e1d9f1d3f7d190e0642bbc69149cb93ea72a546158f7e22cb78748622cf9bb50a2539c15fa554a8bbec76f64110351a680a60f3d15e0c5948ee311482c1c0b161713a7322eb21648f81334c412f66e1476e613f1cf9f82d1cb75e3e2afd225b6e0537bf36c7c6e7dbbf9dfbc3d28f2842f826b2fea8d3d39815c457f2acd0053a890d3ba505199febdc0de53db63e311a647a5e344a96d8f14305bf4ce56d95fbb0d5b241d5e26c3b020aa2d433e7191ee1e16ac74ab738e995d6913b70a30cd599c2941f78f1f44023fa6f7c9222ff0b21d72a93911bfe4a09e79d1f8d042623d24d91bac6ad21a103179f8c9e316fa5226126643d7ea8535ad94d52e9b6acff707b0b76e13a1148e3234befd1b2d79761add0b79bcc61315555de5b1dea3777e6a3e95a2fdc4a2588542c4a06d0bf87d3177b099565e646ed3315f1a64b988b951352f53a404626c169b2e205ccd084c1b588fecff54350d73b7b2a44af9dc7d6e3ef6f8d36dcbefc9f67481b1351dfa2dbbdf3d11527babef4720dc1379f1709834adc5b876357f70d20f1e3e9e38274da3bf70417f0e4fad6df19513511c37f0fc6a3d1388909fe9b1ac3243f865964bda93325d3f7d8d3f9e5ffb4d6c92406df5212a12c67f1d3743f0be7e4d18b3a33e4d1071ed531286b05c1598f853a6d6ab5c6330cf51ea416c808c0619b26b1b26571e7fc76cfce0db53754550bce8a81bd88b65cc54d937726a6c095a51f2f20503c51c30a05643bcdfa812491ec35d52b6fa23c1b261b449e8a358b73230629b1e3105855808eecf3f10e38ecce180350607f28d34515544ced5269167e31651bbacc9f8bee2e81c4ffc201b6fe11b5aaecf4f4782e17d484e0bad7c1e8cdc9976af7a26f9416fe054f"},
+    {"00000000000000000000000000000000000000000000000000000000000006a2", "0013b4e457c83e54503011ee8e27088c8b70ffbb5b1583aa037970c7658833f3b8862f969600bf9e83751119938d731229ed9ff243e5dcf4f5b9b68e90a1b31a4d8187b6954189e204b2b3e45e511e269b32e0c406bababdfcb42657f4fd94e230339dbbb6421ffb430c5ebc6b1dcf6d58d7405383b53f090622751d350723f8cb38ed90ac01e84d227a25aca6311b1b5d755f2ca16202751c73251187350793628a69648911d3910803eaaa5a85b43b45d2972e8f63710b989d1d77550ba1d71f3e8559497e98b824ef47cbef3910bd0f202221ba2345e9cca5826ef6f5ac5e4466eaa41f451c36a9d3597bd522eaedf36660f6df1106a64938be5d0d470e87325b3df3ca674125c2a5c2fcbc7554c8cc2e3713fee71c388fef0c13e48e211da9cff21d830616f56b909ccfc990f64291c55ea321d6d932b8c51020a0b5b3da68d0edb036249dad5ae6c145676d4a4b01131580d7841d93883f58eecfdd9ac70e64be6d490bdf15fbe45b07294c2c84dc8ffac7356e54fce4670515513f3b781617c3bb61675df2e7f19a27cfb2450ae00cab77260743e84299b315e5fb37b35f7fa420086d4e102ad9cb50f2b9579708ee331e08edd7cfa30e063617dc0c1b2cfef974e227c3860f200b7c7d98119a279cbb4cbbcf5830f66002ee26da0e2e97a4dd1ac00561afe7c62d4d1a471bacefdd531b49fac2ab05293ba78be5dc1991441071880b962575ab1967ef28cbf7620be79e19f6d86550006042d27a14fc84871ea0df741f2761e542574418a4f53e2e4045998bd91ee8959bb226d7b9f95c4a37487c2efaa23f9dd4a6166f4fc2b0b3c499a4a273ff5e27aa9906ebffff14538144ea9aa5967f568449668275e95fadd6be1bca194e11d332a3fc173296136f77eade51271d1cdc8b2bd4ec5cdd1a79cb17ac35988f50dc11b190760ee100eb9447542643c76efc6012d386ee3943e1d57055138cd9296345f707497175b57ab4ceeb2c035ef4c402e34bbaeb07bf3d5ba6855ba575e1b21cad17b71d052251c4ee1d25bf53b4f2f26f3629a32e415f6deb111005104a045b678e44e45c3d6e2031d63739ad582a79abbec2d8b727158c34212265f3020fe27e1c331aacc512a3b2cac1f0a8c57b2ae889b1ef0ebf5dfd1f41975d80e15ddf80f1f21199619e259e163621b901a0b16b6aa60ecf324b148e5575d3013bb38c6dbc021d2e88fca175133fe6703a5474bc818a61f7003d10661947f7ba621fe9bd6584d6e7f7e9d29d9892aa12804b1c4ea72585ac50b3b4ba399f9f04e3f8b55a01cd1d471260e917565f85088562da09baeeb973bf05a4bdc83aa1bfbde04e444a052ada92de627d14070a1b018cbae32843b41241da16fcdeb1f4caf7da971bf0b290ba653981f06d02b29b7f97f597a176992f013af8dd53c34ac239e9d765d941c5ab37db9d122c0c6949654448df88de493223012f08f54b591afd2a0a2ba0f8946955d5e30bf4dcb73ab5aba51c3ecd7011dbd1936c0e59e35279e37859fdbaa634fbdf106e0350bdf2f0f29ce9e3948366474ad141a567757457199d6ac11007d84eaadfd2719a986e75336aecf5182e758cc17f610fc597c6f4cc4cc46d9719105d53a445f79a8823d475b95ec4b7d4fe6e8132beccfd70bd0169abf1c3990be1f164c3e26b2553fabf957d709f2121b407f916aae0d9412372d6a72dd21c26da73f807dad14db7e21df3418c824947baea25b28fbd96ee20b135dc96e8dc6fef72044e6d65c4aa130b5921800d221d724d4468d350b476aa5ff92555be13d7302132605ae9ce8e7b5d0d86c79dc8418bbe9ceb37084011bbe76ee6c9cf4ad72b24b42cad9a31c6f7cecb5e26db141da68e020080ef75aa98cd62c2847c3aad1c"},
+    {"00000000000000000000000000000000000000000000000000000000000023bc", "004110e7bb9afc4d10362018f22772502bae42d94223146ecc1015ee79918a25ae2bca73b2913556e98449eb8ac8845adf17ad03379fe1759a7a48a5fecadd529807471eab572594ec78cdc765185a6b7a1e0b6602a6bd3f936bf701cf1e427b499ed1e8d369ca0ad03ba17c8aa21732a35a0b643753c2c21b74a4dfaa24137f2435ed09adc8519d46a2cc7ce9c61f8e38ff041ab6646bf80cd380ab66e26c284200957ec99823bd005f4558ff5ef62b723c14103eb1b352cdd39ce38914c1dd79180d902f76cd62195b7d385181f0aefa780b8400da234da771fc5fd1c1634651888ad2c6e4d022eb1a3145387aa1e1bc73fd6c35d7fdfeb19a294209b74ea02ce21a8b462c93d1f65a56fd2ad7dca8540b62b175aa5e7a2ffdedb1a63aac666909f07d6d650a725765050aea56ceeac0d9a93963018bdeb24d951241b3fc0b4f392ababfc68a0f670c09bbf1ee5902007047897e8f5edd3913743592f93a6a0050d33c5834acc4af4b9ef4d7558b03a20fe4bdb15a59d73e21104cbfee0315ad61b5f6b58df546da35b949132f8936daef74ae8fec1b321a3630d3fcf1f1bd84f868c6117e9f045f4f560b0a7bd8c6e4638832f5cc7e0c872c956cef5c154487bb4fe3462c583bb9c113efd19e15f75d912689f182bf66b6ada33d1a864f099f92582f77cb6f81ee51fda17084b1d7f92f3aab423b34ec021c6fa2a6dc4fed599735ea19f2d2ddd6b1be25860bd398c1121a86e2fe1d1223d27b7e84f5ff28d4760470c96a3c064446f9a8696fa96ff18f5e6bdb909d40f26d38cda827f145d5a603037716d69ab9fff97f15c0f374dcc60554bd3ae27d8a1837a93968d00f481e4d21aa450d99c141df035f757299baaafdd9d71d1e89da1b121a0c7bae75d72c50ce819dde48b211b020cac4f1f63a3657d96c430339a9f6160855fc97aa0197c0db7ca81d11e5fd20f070a5151cccf05e34bf0bb6fb758683a10d0d6184a106df48ad9a8faf836907c1acb767890a6f5c75060a45fdedaad4da36d58611ca2d74fdb34173b70d85896ac7b24edc48d93c1505af4c9b8ca08fd99329234ae83027219dff56ba2b19d2045fefdbe269e59e76a4a2c2698682e9b97c7e19378f23c0124c97e641345a214e6ec53efadf72b8506053bfbd74dfc9c25396d1134f0afdb4935cf8b904dfeca598db8d8ce4be142d784a52de6e9d7d041e0f013c1c5129574bb6f641530a5a0856465cb2a8a00fcb036b4a6dcb4bded0a2c0ce671bd9bd5e3645552881863fa3d6a9e2db4502f16a3a0e691f26beb3771335312572162305c7be14e4245279cdf1628fe31f31da4e73026ad589f43493fdf15e1dd562c353e36d13ecde9aede3876b7f51d18e5943d92ae634b84b8b23a3269bf24d754f782ec417dfc86f6a2ba736113504b3fe4dfde7f3d7d9cf24a94144ce667033f92c6b28ad8560944ef92d12af84cedeba7936aed57707e316e05385d8a2cde3614c31ac6ad885962b2ff5154d1dccd5d4a0efd6ebb1e7b5288bc9276ac71ab6dd461b8c1126789090de89eb930ae3320d5992f4cf10e11cb65c1757d6b7cf6727830df6dc64ea709b76fb571e303cb5ea1844d1442114f2c2e49111ab0a307b0a2084dd0dc690e951412dd2c5b33938397ac2ec6c95065483d33cc5095f5276b3b9facf25d0fe6694ced60fb5097c6eafeae3db9981c87434946b11957a54b01cde156789abe5f5d593b22f854ec51d955ab7b9d64403ea464257aa8d607f4597dbe9497ee2e29dc2a20ddf188619f2bc57f6eb1328ebf101137d52bece05614537c879e4b615e1c029cbbad1df5f04a1bde8952637c578a0551a894c349398585dd3c2a638f6638a2ba59d25471598a9cc6e445fb26041534ce1ffb346"},
+    {"0000000000000000000000000000000000000000000000000000000000000132", "01119fda2950ed71ca98d36a1c59b252ddd2d75032053a2e35ac4b389df205b7b660bf7fe77dd8dfe9a801c12246c6e62ce9fe6313b3597bb6053f091d3fe1025af2d1858e1b947819d2dcea7783ed289f0b09400481508a804b8468eada531440995fd3bb74bebd03105b354b4a95f424f761a228b1749d149c7b6c1f321b533a5e9fd98f49425cba2ae6f05a9f8ab47e7d9627b0256273ee3b318e4193299e5971ed0d60a97242033e97df2755982ec6f521ff9ca725f1d6f3799f1e2269d78564cbe52abc1b77d6f3d530aac88eff8bad0f6ab2ef3827bc37a66b356f0e57e8c7de2adef1fb2288416209981ccb4a1dd3216ebe3ad17ec05187460fe8a77874d4d0b8e050290c65584826e335f8d6cb290415299253ed17325892e63bdd6c4f053abdda1f1dac5cde54c90c0b6b2264a3e4558df5ca31ff7dc223fbf72d9321bcb7a27d474110dda761d2eef382f2018c3e2bd3c84857d66a11627331ef61eafefe5d4e0df764fdbf04ce07e1ed94d545b8cdb6aaec1d19b50344c44df99a7cf71ae3d220ceae6a98a460d2607c0b46b86e0173720bf99fb728f352c68251bb74932c1a77e5096cc92cc3b5b75757eefed99e7c7979bb7626f4d2e9f3cb716cae3648ad16617c16a4e8d8c4f81ba15900c860f41b21c1a78b0c6c7a4e4041d2eedd3b597526f0131c79d1be843d18fca237c21ddef3f70525202dd514bc0370561613397a0b5f6a45bc24d315b974265f10147fc001bace2e60486abdb876040a0bb02f1787905ac0c3fdf153449ce4490e85f4471d0e62f0a8a663eaa3d456a2df1b4a6f80cc8c76e74a0e3515ba9b0f8a70ac771450ac60e1ad59f8cbaac80eaca50166a4811f6174b57a765b646e409c35c8be100e4e06d8eee4d3cd60f2cc292cad0321e1dcbfdf2a9a97060768a1b5a130e3ef60520bbb72fffbba4601601502f6094d39d907a6b1e76ecdae98435b11870d257704c6a7403bfeea617ef6e2c297221bbe013f06ab9b31f382bf80497726ca0dec94f245edd4ecc509946f381044728719cb90ef087083196df1fa7daf02a977fa5b74ac37f4eb8053a482ae786084043d5612e8e2e1538a407b8d3ee47b962aad496effef27be0f047c7ec9c8019148a8b2384ab11661f5aafcdd982c4c99b9265a20052c45b4476350314b18ee7b5c20017acd44f750391dfc4775da16c4401184dd5175c126607bc8b1e59505ea1e835acc4328da1805195eb1041a5ba7531f4d457633332824b672b26589fa0fbc390787d659d2c3033c771501e9bee0330d96dfa88b05cc67627cc24077d5eda333caa7e8aa9658b588f50e8494fc0b5a3ad76e1fc4b893c7f811ce2dd264f20fd44cf0d90ea085c150e7aceee4ddb26c7a1874bc1da4561ac658626cd0b688f47fdf359eb54698eaa6040a335d294f6123cb70016fe390b1c0747b8552c763d1cf7cfb22a90547571cdee6f0495360f35bae0a1155147cfc610f216e43740a442525819884ce58c0122637ac50a5e46ff0a8dbb8e7ffa793320b9b72ca08dc52cf10877d2fc601509fbbc00c460a157ee93e0ca5c5d93515752f11d922c2e1e2f9497d83eef10010ed2b4a6a3b30b3ead30aecaee3e166c94d9e876d2671299e6e0c1a395563b52f485339160818f3245c06dafd54e8520f03613d966e13f57b5e56d593d17b4c315ddf242190c583b855f986c7fbd6033c3ce4ae1bcb7dc22bce617ac3a474651ab6b2bd1ff0d820242ec563cdd65d312b69c2f31966a3de79727dd870310cfc2a6f2e8d708cfde003c17732fb015b0e2ca78b1c9ead803e8f0a51a29b61d30d40417a811218846a2e32bf0c4a5e1e5fff4a962018e4f411d3599bfdf149bd4aa5da284f3d62e7c500c73bd1f5faf29bae30"},
+    {"00000000000000000000000000000000000000000000000000000000000009c6", "0002c06fe29bbf7923cda38f12fa16fd84a0b08dd10132b1ad69a0402f54657106cdb92b6cae796b9f4200fc12fed958e15f95b3c0e05faf2d85d3e31edeae0b104e437f4fe0e8c56ab477f8ba9e2a5d77b4c40406b8f3ac1a4a9108f29fc63ffbf04455ab509937220f7738edc3dc17efe9a6d3ee35b9c8b6c856fc07e20c3ef48a30217309ed5ca38c7fe435098bb3d1af8912dc96e70ed89e9b30b6515db89579247db9e617e30c6e9a2d1908bf82d234b539e8cd6f2ec3927988cd31d74da009b183bfde4dd378583d7bb58721d1aae013a6a474cf5c9f29b49461fa9b9cb5e19ab7f9dbf14786fc16b2e3430d707a764202ed35a9bd8395200f23aec5de3a52bf79ab884307d7dcf79bb0929ef690302eaf7f23f12f1dae033604da35b5f6c6c4b8a1d63c49ff99a3e48fcdc9b4050c095277f5ec14b2ce6e414b64cf66d45368c51b5428f6b1ff12aac8bdfbe300eb33e5f2185ca124a45266b5b6cea96c7c4cfff90d3ddbdaf28c819dc6cda452372c709764a11f85bd04c2d2db4f46100d2097d181b1285b7ca4a45049a34b8e270245318733c34985b107432989e43efa78ed06aa1b230bcb0b5ace8f523df06aaffe89da35c37d08d393f1968747abe3e336246546518634073c7c8723e8fdc27ca7b647ebbf0296ffdfb620b152932f8b318fb3a3ddf076f7b0dd46342d7393e59f557828f10e96b9a9b60d4f5dff2a430cf4b0f323d13c9f12ba24a17fb8a72bba67bb9d73412db177eeaeab3910c90fedeeb90f16b83111a57665beb659ae4c4e5e472c430ccaa3de1a51fbe9c595c2c954c705b1d31422ad1d59248160e5b325947181dd4dc8ec0d25ff1dab2a22267b244809399cacaac345b2cf6a136cf9be2aa823bfa202eb4b633cc898144e1bbbed6b2235dc3575524a5cd978600b4b8857c673df35e86a19291dea6900199a824f8cbe13afffa3466c23d0a63b22bae8a906396332e84ffe952d00f4d567f3fb91b280549a7e0e1f3ba97866097544eb01bcb99f5e896aa4fe37d02f7da6330c8f6509c2472360163918c59689d7eac304e4054cb2f646d5bbe9f1571b45ed017d6a4d1236090a8f62ec18776af001d3f21f5ab7f97b6f2cdd4c23d68e516edd7e8dca2187cd6148163eb021df9f9c42236fdaedfb0c19f4ded9fb6c612c6b69f43d0464019139b46a2466419cb7b571ebf2fb2ec4145816e44297b38d6a9b036fe751558cf3419f258e2b8de0861ca246a03ec84d07eb4712c925a68290edd7f62b97502fb693f1d95587003519c84ff2410e97a176e08403b32351561cf16b403c460a70e3a9a29d26d5259942cc9410eda13e1fbfef85bd37f413ba06ec9b49040661cbc68cdfe2c19900766509c97f41c7741898700a6e68553798c8a980c4c26c097117793d1c3c663800e47f837c172cf95265b0e5d69bed72570d552b985b1e4668ab1d2ddd6414f82a4c526a9f2feb99c2ab02e10d2385565c29139654c4a5aa0e81e8dbf53f6c081a7c732c2c81fd751561ad3d5abcc0c6d0cf1d0d01b3f16fff5d12b748f061f7cee8c213b7deff868b302743cb4acfc2e7ef0617bb105458fab20fb833600d8eea28d0a737d348da6195552a2b19d4a4113fa939f015449bd13049a55095c13b4d865f76e3bd86ce0889df9815124089b96c63ddea452599aea8ee872909b696fc84e0d365b529d5406c6e2475c6929dd61a33fcea0dbfce878de63106f48679850a75c0b4147a55e075e54557f6fd78bd46361dff208a6bc396ec7209923a6e9be49d2fc5e0e20465282cea328dd1c4a50f14b9e5454bfbeb0de595092ef4ef95867459328214c51a566fcc4580c532b33de72c9206b2039bce69216d7c8651d8e64f65dc443b59b3e5c932cb5c0bce"},
+    {"00000000000000000000000000000000000000000000000000000000000001dd", "002a7c283f0819ae52acf1326c185b70968be97b910213dae37f0810ed8ff00929e5680b4a7fa1fbd1b40a853d7acf9821b958ef87d8c653c8bb09c29c021d2b4f050e914cee96dc954d400e6ac6776d531f2b1f17d32341b88d029366c623f68cbd6bf1abaf92ac831b0409063655d467769e84042236faf6a393d68d0324f81f3d87cc79e67ccb5332e29f4cde455d156a2025e6f20e04f002cf84db665be340b0335c00ddba5f04a2fb69189ac66926b2709758e407cf41a5bacafa04c9963b6e42c57d12b272628cbee998e2a68edd231fb04cda4c958937716642bbb3d23b6d93216def8d4070acf2d31c20811b7e85fa783f5cfdbcd2db2c8c08f0d52296c97a12562e33f9bc785bb19cd9134e4650601e79de1f98cdab73e524e92a951d52f11fb9a51209dc381ce4a7997262737edbbd36c2c73cf6573920bbec99519d8ae9f053a2f0e6ecbf291f082ede2c02499431adc620750bfee03bd6b68a783a3476232d1330c8de18ea35b9cdc727c5a150348b1feff92d600b90a260ffe27803fb66a19b95729312ae8b3d6ac11fd70c66c5173ea555c46371d92c55d1c60c0f8a2904b45a50a846a1f24041154b0fbfc89ea4f83c265508ea574a16424479dc3df2c51f7f587df69c3ab65f12308b1ad5c8ce19f9d2248e93398e7d2e0c5b248313bf1f9b2cd0e085830644d92c7c241d3c8d0db1a30b5bbaf611dc70dbab3c8327dccc602955ccfdb04f0c47cec8ddab0df9f21a5437b65c3b7524a919b94d0b99630e3d55693eafd001d1149b84a91a67cb70e20c1135bc3fd76330e88c98de05481e22aae6596bc40c1b17b0bc98180deb79916a1cf3d48314fc9f395717e3ed97fa91664f2b6173f3c5470b1138b95b666f1e97fee0f9d820c2f0d72375eec25378f94517e8a729f2a30987f6e7edd69f233f13613396115e1604e3010bd72e8f011e5efa8a83893579cb662bb2ddfa4b061dc16b65b0bd01fb3a628f22dfeb970a629da7fa1988d5fb2f1e2e67aeb6a2a012d0f8892e7d9254aa303637cd4e74d9cbb4f0274d5dbba39aa65b1b65e00563aa16599842d71baa823e86c49a34f62f1151a52562c66d8199de2959a6e2fe219eaa550a0df310c912d30eb25acfe5fcc8e405e9c7b0dfb61f0393e5f92c346b78e6dfb0b3e77752e562b216ed2ebc341ebb05896774501d23f100eb31b8764a3b75df5d36e20871855467de5dfe09831758d81c6b90123831774b290c1b1cb57e88326defc91257cdd8d6bef79c9889941526eb7f12c7fdf30a7c559eb76073a1ee5dfbb21f10e7339256469fa651fea48db7ec8db1a5323f6740136b1ab4aa645d5d55b6e172c1ba994963131bedbb2171c95acf2048b5893d323e3fea4cc93d3333181a57dd32d4846b5c6765ec66dc404d29fe7644d90cc0028120190ed8255b91c09281962887e350f05db61e151a1aaddfd2e583a0b466607943eb45a27ad1cc56057fcc147670c3f7cf976078bbe63e083151cda990463b64855bdb57df4f18178bcde68c8ea17fdc8cb0071591037768d4aba0285147c730cb81d0f3fc2690513f92e9ab2cf9ef772b7a5d337482f2a6e23f38151165cfb84fab4d43ba8411679ad3558d2b155ec9991256b7a7de60f7511bae87f74c7da003262fdc6c2b07b9887d6e4c1dfabfb52cdf736da41b53c69f6a54447b27e05511f84b8f98b45b3ae330114956396cc123355a5e774f9e06d86653dcbdd7c0a5003b1e2c8e391f9415d5692ed58b457413acceb9fab33d77c90c0c44d9ef60619e693b43b72ba73df2ce39d1750ead1a4c92d88687ed5ddfd735a9b061b96f4d321ace5c1698f5b7078fc01f61ae934129c57da2863a7850616138b74e02db343166bfb8505048d97efc2d9ed520"},
+    {"0000000000000000000000000000000000000000000000000000000000000634", "0193aef5ece2b7abaddc406076ff97dd4145f66f5901965a3ef8601209855f0239f9132e5132f535810003b3428af716f68fde4c31860264be34d381f726481eaf1e9321ea83539de4c2c9a7507e857c7e582ea622e2ad51edd08a51f582962d14b961ddeb99f7bfd72a38f5aea839e77ffa7f32b89e474dbb2cb219d77d28c5a5688de75addfd927314dec35da6fea6d8fa1b357649c141a471633a606592994371aaa317be964809fcd8b2eadd2a4bff602541d950ca6de236d18a0c1456c0a58311746d14ab61b1b52d69babf0b1d28020ea2245434e96f7fde784223681d7b5ce39bea5c6650e0fa8ca16ccff369e7d7c5b86323a23a78d4589d0deeb68e64a9bc39621fc1bd0239b54eeb4418271c5670b4ad8ee385978d9af623f7c4410b9332fd490e0f98475b4b8d3588ab8c43b4957b38e682ddb947c81ddfd27bda4f23ee8f10133488a5ca2e15b591fb080351e35e1babc4756e5b915229b721d8939448fcd4682e378be39d63abc6bc369477563281f3633cc494157924683fa6e2d759d9258bbb7d96a9aa736eb6462d74e3e8010e268915c3638fc5c4237cf45cbd8c48081fd8e7087139d3bbfb91ab052adc248957546f0b0fea0d6ffbcecdd969c7a44781252992a5e3f8e4fa0ec29db341c3c09b5d8414a4f8bce545c45a5fe28950686cf7616120adb42f29db2e750a2681aed564de0721a256454be190cc70b14f807ea5c49caeb5788808943f52b41c9885c567d31307e66452f35058af5d0aa78abf2f981c4ac44a733815a36a41044f9196160b93affc7604a6edd48a87b3d3d8bddee8dd7ce7990746efa4d153e383c03e5176ed3db530dd8b7c9e8e20282ac7b68d7f20926747c91a566c9b7afb3bdb2c0aa02590ac844fe5b73a65b7d9d33ffe5015dd7f880dcd6dc86caf6151dc0c132bf3b1ed960adad1c774024d624a30473f7ac2d699115e6b6352f1cdd8931b1a43574d2fe11a55d68a344bfadbe6894712bcfe380377b952d8743c7dce0e355986b68a5e32e237d9043fb2d7e6e9951ac8b333d50d26743a258736ee49ac076ae0f662550b43f046d95d3a5c866b79029ffd2a37f4cc33ead464b749d845bedc7ceefe6ecbf4731e26044a92235a597fe492d69b6ded2daebd4d1b570d27c8b13f5eeb759d86f662977c5c79f9336acf6b0f05b820e62ea3af7b24a4a1f89eb3e4592d8d168c4228a5d738bd146205b911a304f2577cae22a1d1512811cbb721e6a48a2bea4045ecb73b252e677ff782034981ac9dfa34f0a7dd1a380d1765e3f219989eb486072ebcc31783d16ea7fbd0b042bbfee5979a0e33f64005fd27f2e358d91b77f41fb44fbbb376fa1f8cf92df5326ed49af75ae5c405c82844cc3df7097e8fc233fda4edf5e9184db90024afa2e197c1a51b9fbcf5066759732a690e0fc1ff4774976886c63e87fc89751708acc4d692e9d0dc93a5af4643b311dbdfd4f70e0859bff5cff583e5ef8ca5a228658c39761b9342c98d604f2d042a233fba18ab6df7f67652f4dcf80b800d2270702b0c7fa79b70b0ed08ac91b936f812f70b2861bd03825e6571635f678333e40f0a0bf8d3068b35e535637df81f75ed9b182e5afc93aa67cd39ea263ea6ce0cb61612e79806c6450ae94aa62b13d977050a9a55f00794deafed5ef32cdbe849ff224ddc09b920d71e26bf5ee6dfecfa33a693a3f6ea13af55f7890b89bc2eb66bbe09a9c503c48e4b97f73216dbd7af126dfbc6ed228a9193fcf48bedbed0f5dcbdfd6899149ae17910cd678165c5764459c2d0ee2ae4584a2a244c56c1e6a9a6bf9fc8b5849ad91525e7d5d21682215bc1e999d59915cb14047c2ed03c3d5f2b1ec59c2f672ebd3cb020afdbf215f6ba3935b245e7f820bf"},
+    {"0000000000000000000000000000000000000000000000000000000000001fe4", "0034d0d7ea85cb9ebadb02f966bd4f9979c65c359d1d065768e9dedb4fe25dca595adb5f2f2862fc9b6b2175ca9045140ce0f38ba3459e7b0255a5cefe3440280f23c18c8be782e5eb0635bf50c5b2d2ee1e45a11eaa3f4dea8f3f18a03de87d57e90a2e20b4546e93496a83814ffc2023ebcfb95c0b5853aac46d5f897f2036c98666cf3c04b75b59ef2f5cdaca8066f6d22f35f43334142e0acf86c9e45ab1a9df11c56d128dbb00c7c049a55cacdfd99af3c851cb0fba0295177d6b0a49560fc682968aeb40c0f3eca3ddd537e0fdd44701e46b1e174ce175dce4b6df83c02f134d7e9f6fa004f4ff5731217d3def62822b605413b29821fc95df0de4e8f1151e00156d28b1da703cb4b12ce1f312c83080c3864c6d183dd9e46a8cf9fde8cf03603b37271b9bb30b8c5ecfeb62429266a46b2d871599dde9dd251dfd71a60f6d9727d5759f2b4e8a020eadf6ed580815fa0dcaec087b72b7308ceac3600d2b5379eb420d5aef338da3fb0961e565915b2d90d78e959dee4917a8affe4b690df5b52929a8a3f30a77d894ff67812fb5ece0c0f3ea81dc2ed4385a5cf24a6a6ebbebf10ab4c9d53656df732869c26994213976cbcaf792c52ff4d55df0233a919770531cd7d4a236abd05978ed0d2026f259daba55c57c013e6fa830285159956afa17e824a74ae62e533a0f82d90b4fce29982d374ac20a03ac177e93bdf8e51893e683c662bf3cd33dfa6c0b8c6649efc9e946f2abd25484538c822c5b3952dd1266633b98591ac3c505f34c8b1c77e5bfdd9d6d873953dfd27f6116fbdd203545cc431bbf4fb01cccaf1580bd90330713d0fbbf1231b6dc2561bd207a162b3ca544ea9dd94ae51af433e120f068f908acd1246c2b2075dde71c60e3cfbc246d2fe868b5d1aa36cd994d165e56129d2d88fcdcf59b69672bb1e665580d5500c34291235ecaa792fd8570f6e6b4d17e47ce61b0147c33c0f9c842b0f34331a9b5951eaa59961a93e51104774705a0f595c20b71f55479b1d4e36875d58912c507da512bfb6d854cc91dcdfe2b66b8143614fc0436ecf89fc317e0a852b1305179c621c0357f706720071678f1745b25cec9f53ce55d17a183e4b70db70e0cecc42b148e48e5a371ff97da554558b358096c1a6e978b2cf09a899f4b2810e56ad6f30b4519ce6004a4698a20068d698aed91b63a7e25baf1eef9efe62174451fd74e9ae7a51da31f50e0b1551dce4efd060eac0f6eee55560d9e71733073fe5e2de9c47e8add32337422c85179c8f7cba6841c43eb5a369cbef07d0718d84b2ab839f9e1a3d5493969bcd6f8bf3fe783124c2b6cdc4b915dff90467f49720f0dc0605733dd113992bea19a77d91a9651a1e792af18def9698a0d72eecc9f8e301c5dede86744bacc100218ee9d4f8d0243fd8cd5198b233799e33ed2f34e2970b17b332024d59ecd6cea5e6bf79b530bf95158bb5c84ff91440bdca15963cf8916b0ec0384782e9ae9e8f03031a40cc67c1bbd4ffce51912a1791d20fb5d80b7dc6077042e7d829c5ea0e78e195812aa60b28a92c07ec25634ad5b6d0b3204a1f5fa6453e66cd376cd411fc3280bdbb1d0055c61b9c02fa4861278fb816719deac5618114ba17f542b4fdc90959953e95f6e72665acf1e02f4361117540971ab5fa0e7c10900b0ccda3508b70c376b57fcd41f77d6149367df3b34250e551d8c860bb5eafa6a4e892b256410c46ff67630799d06c45745c96fb9632978ada096774e9ac45c8ea0edd9bd530b641e2aebc74c52fea7e255d061095a8aeb3be901250439bb706ac49bd38e28ec43d5005a3c743dbec431185784cce36dfb86d2869593bf1eeda74f181c313fdbcc9b472fac1ffef50b60086b3af340d33ef54a"},
+    {"00000000000000000000000000000000000000000000000000000000000026fe", "0076543e7f0921bb345aa4f261fc16b5dc8a13ac6f73df25b51db48c61d38e3bc7b57ee9eef3945ae7ca229d4d4d0454dfd8c94176269846c862827ef486b57efee6aa3264c1f7c60ef9acd872ee32ca0b9f49c908d53d3c31dd9645f37391dea0b230e26cf27ace8c51263dfade982e35a01bc5c7e3393cef20441a6b9c10620b5b97cefe60c3beb338fc7a006914957384dc1d70fea28a8e2ddef4e14312b73035c51bdddbc2fd00b2d234d99740adf366436de05483e5919cd78b5310990f980514e7e55051e34509f7255b2483ba18ea2a42eba3c5786b63d26ac91344526c5f5549fdfe5f4e9c3cd8a31dbf06f23dc53ef76e5bba37d57ee207016c8ac05ead2991e54b7234682dfc0d24bf98882506a57ff3e1cd45b928ff76623efa7eda7484b97b1512e5816f65d598fff6714539174746da3e19df4e8e4187e4115afa9da1f20c94234168744e425f5ffe9600a26cc76dd0505550e4c050327ff24e649a93f3820e530e5f816a8d51a14f81ddd677fbadb4f25324bc02571de3444b82b0afd97421edb1dbc945a19a81802bef6382f18c91196155969dd2ca4e39fc6df5ccfb0343119f356cbf796acf839de5d20c76182ddc8e0c2e1e326867e82f534fe364f02a6a217d7a3a18aa7812f82772a276825fc39cb2ecd1a91f6151c4daffab1606be448109db4cc88374895db49d8316ff5b4cf60f6a716bbd87bbc83fa9141817539e361e4c3ea19a400044971752b7a98d2247a292efadcfb4f97e16c7155be91d0a5060b8d42a9460ce551f3145b2bc531316ed65258a6cf111adec677005ffd5ae56efdc4b53142baa166587e03962d522575c43f64a13bb332af32b919517a66038f564b77385982ab1d1cc83f946f31bb516826460bf5930f182e438eda5da36c85373be54da04780ab375c3cfcda5ae15cfcf2634ff38012e035f09896fe9e373b20a80e4dac8fda848638ad36805474b4692d7eb8af1fef908fa6ab94f1be2d98bad108f96a5d029c91fb4fbb25b96fa725221405f5b1520bf67559f5846f9f56d4322799a098d95e8cf72751e2d5c9b5f9e7d73f0d01af116713c4ecccabc50771eba1e16ffaf1ca9f975a3e7add075113b119a3f2b33efe791355a3829128d0697d3e4f58aa868bf76ea3c8b74d2bca39e855fdee6fbb0fb37269aea962d6705303b9bfc5813d1ff99a0c2069388a520379f944e0ac598b544d886ade38bc5154f5165fac91e96571c07f849b4118a8898aecd70d903529f62f57b58a5510aa4589325a1e25d7d20921a41d1e9d9e3a1b1aa5b054b714fea049a16a6cf4067b44477fe33481fce8e06a662f7b91032ddeda4309c99b0b68258a4dfe290099e6f740390ecbaa4a354eeb9b35f1dd345fe59742184d4330e32ed41d86d73d2df796691f1069be93b07137a8545029cce34eff3566ee3f70d368f5d999110d8d661c68c55348eebb3bfe2cccd233e703e567110939a6cc48b8dd74f01f292b467225154a033164d3e162f8914db6923fdaf364c2f42a17ad3989cb9910901cad94543902d00ed5381dc3bc5c9d23794b0cd248119be05e83839690f2d3ce77625af60b05fbd220d3169e8369736e1180683eebf49e11d6798fdea8116e9320cef6a42659af786a468f9a32e3f0b1269380811e92c031934554aa9598646d71d8af10f9baa9d0d6284596520e1ffab3908154ac44c6e1737db2eb22b3fbdb58d8d4cb09a0f160aefb783b66c1b3d645d45951a2df4d3f4c3870e65675939a13a6ee89f5f170cb76e623e5fb05b429a76882a557082720a7efa7f2f05fe397b90ab81ff482772c34c01331b7e7dcd7c13403eb9b016aff0d1f4b709506399da40f89440c8152aec2a2ad4a3d7b3ebc91a366aee5b4dd2ddf9fb"},
+    {"0000000000000000000000000000000000000000000000000000000000000cfc", "0053689b781f1e8fffb6a0767f5a9fee99d7f5db640eae25fbfd84a9410548732b02771bef4722fce6750408cb61be5101d77575888ca0f6ad36dfc53aee880b5c031a04d84d89470de1f04e25ecca4d43b7c451007a37a7e111a0b6e1df635b74a55718e30af326981b7ef4a227c8925cca36f2874aee43d516d6ec23f22bd3eb3a4e8fc52154d09553edf3bcbf4ce0fd7f5449cb475258b7c3b5ca8d275e17d1870f1a9819eaf300b503c1124ab934788fa407125084b59723ce5ffc0b232e91841423e382e281e09aed7782b9c4fecea00621d64f4582ef28594d25ff7f5007f64c8bd6f5e05fbbae0414d8d81bf53b98974add34ce6f64dc16580602f7d084b360f5c8a944fad5ea17e160141520f51bb18f2ec01625b106d102083b94f4e8db418c66fa075e7fb1dd0882608f91f52a2be78e5ecbfdd6a73f71a7cce13762ab4fc19ff7620dcb95eb562b1e769d08c6c935b009cc0d0e57f100b329e9d1da79f69036169e2cbc6956482513e7937823bceda16217eca0891ef6d2556a1e6707482cfc18ba7071272ef31a0bde2a5d93b29cad09e5be08a4f8c1391666c01e7834690a2a693452b07bc1bbf100d0f08d85a93115b74f4e10bb2b3996e4dfad594de2295b600d352ae7549440171cf8bf2fe3c41d5cf2d271e9ffc0152e5491892d264ec60847907bfb68591498cdcbfc2ae41db8f7c70d84147e779f58b3d764365297eb1d1deb599fe23b397a76658cea9eb9720a3837f9d3984e8c9275e9af1d5eab974ef90607e11d2c9b1e715be33a65fd9de1226a9944b0d9c4392aeed379493b178b5018ff3a2010b820d533148e66f91b25f29fd51509f4697ea604236e12c3e7d72635ece7a2f87e43bb70cf863be68e3303a48243dca5d537a173c39b58f551092ef0a284456a364c8f9bd28f2b3b097d85d9181f265cdff2d3014ee7c641df0e49426e155806e16161711b93332a06e6a9af819cbe2b077e820358b99c7ac954f89d47046404a465d6ecb1e6b9e25482cc4cd580f83e405535ba759cc4a4e9798a1e2588cfd26fc969675e063a0612aa1c5e15279b199381d3249b8bec8cf4eeda122d303a654b957690cfb655b4ede8d3c5df2fd4171611a75d3d05d0d330cfb6d20ec4e47a3d2e795aff0e2640abe0950b0ddd4fc0836ff4eb1a3e73e31f0e99049808296b9826a18369b7f20dcf31e70f38fa16542c2cd334c2d23eae9f0a268691ef71f5fc91385fe60fdb2329c95bef4148a2724687782f5261877e372c1395cb582b335911b6f54456a0c43fad1748fec0da167e444b6c2e9703c75921f4ed51bc149df95919c22054ef98eb1cdd416542624888ac4a58db834d48272b4e8f2d1ceaa1119fe4c8be6871bb43352d7c6251304ebd80f14ed030af37e674e4e43e4a59e43a0aad0268a6fed7c2298b2fd1109032c22c91012b6fa2320f0c27634d639d6df747023b5dab0bb70143faaf75085695f4b5904185926ab480d93c48628cf05bd9fa09edcd3811984a7ad45d29f4e7ffaeb6f72d1f87cf047cfc5c6aa697cfa96102d552ef1ab5a7cbd4e86f3f98c41ec990ecb1973fe9784c7a152a6bedfb1d2c1c15836e96d024f1ff2fa1d13fcddda1cd2778cd271c2df14b4b135823cf73d3db7cb03b3e2bbbb73fea02f47512b84272206c34c43ec5325bcf10ba3df5890f050f746047bc7547495117a749dcf1b50dda85380abd4114b1ca6b8bc8aad3a0866b3bbaf9ff7e4f491a925904e195a36711a047a6eb3e7c6edb083972791d6893886ab4aa6fb8ce721f8a1f28dc8bff52ab6e2c3ca216faa7b775e8df3746ffd0b25a4ccb3317bb22d535d71a1f5655288d235d699b0f4907f29202724181139d5b5429c8dac6a505a5f6aec980373482a8"},
+    {"0000000000000000000000000000000000000000000000000000000000000836", "00747b2490a195794b752231ab22941d124b097253087d2f12c4a56d3fbc3d74f5952d605a780bfd44bb14c7beeb58a2a1614a2581b18742e900eaa02de062170b5b274e0bbd57e95a441bcda6185b11bf3fac4a0242cc19996039b34fd492e5983955891d834e8fa910263329c8c9735eec249842eed3c8febed8bf07101126c3dfa807a6c8ddcb912af6c31f5757d83d58b2118a9cbc9ed6179979a0f50537e89a257d6ef026270773b69261488692a523b35926a2c20da76e0f27e316f3e2029b18934b4682f2c211705386f2f59c7795172f7b09f28eeff4fcdaa1bb68d805e99493bc6e78438dbd858f29ea05ad49066b14c5978637c7984cf91807c69f7ec99f06e5b3836a15ab52f9735e51a1db1dddca1551196885f82f02a2d3fee29cd85a8c63772d623fb17333815da127640f63ad41d5a51d9840f53436ce9d43b3ee67b84b841a24576bcdb78430f34a00b42be43afbe283f7d631a0e1b4bbc1bd8f38e6ca239b463bb74a2b237bd233b5117f44dea09935697012ad23cf6352e38fa280945dcfbb73e726c07e3fe52a115c7374b8704bd302230c31ec3918d9e44dc8750b35ae07bb086bb1a7bc817b64702e89fc12dbc6103ba947f9004fd9dfdc97448be6caf485a5e1dacaa6126cc8d42f67296f687311ba62d807d15a74fc02ff22636468329fc9af4d65a31508fbbf32f79699e19102aa6cbe0f54d34d750ee322eca2652158bf4b265904852656dfa2ffffda3910c3f22c0d5d308d0f9bef119ff67ad68d8cd4dd7f81eb6e3b61c6d063d9e2e92637832a77ea16abdb45935b07e6a48d549dec5dce07b75eac59609dab8c92a220261ef3488a877dead3134da0ace8295f298cdaa71836ecf33ebb90dd64fe1a91d7bf11634cd7f6c6d28f854a67f3b4099f7abc7c801ffe5375e17fc44947f218d99282e4b63eee7e013936322c12c420a0e731db5bf1e448ed4d9bc57e13fbd62d249ed93b7b0b15861b6b3a675cc85dd5520989108eda0a93b4a0f8d70742c524726dde96c1001cbbb6516e5d421b1afa8a75cd7d6966ca5dd9e281054965b89f0ce9f1afaf64297b582dba65e47a78231d2ab95d76d2c2850f94e4ab34c2dbf5403950e4dc1559429e3c0805588b4891bbaafafab5558f3de40b2c7a7db305921cff13940620b37d0726eb92de69f317b77cedf1e13c55bed3d2f7b3e3b52d43755c16723bb87bf9e31656f19f14796a0a682adac4aa1c884f1a4bbf322595d811c3ef73a76d1d9d1e66b6564d1b4eb7abd30465108dc2b60705d159d02aaa8999eca824628ccf0d4a81cdeb6742fff9d29993723bbe72843b84a27a1c62b11d30c94571865489c7988adf2b4428fc29ba4b1805674e28b751ecfb043b06ccfc5cbd5910d507751bfa69c01b56573d7a8f76aa46b5e74e03c238f6d2533f14efeb353ef13808f1950d52e38803fbf217e9014411996668e1c24cba16457cf4cb400577b454c9979ab19c4684e83de06b2dafce7034be26cfbaa28c1e2b5987d38293769c59d1de105523b306f20b6eaddeb7e3145cf4b80e3b59a5738652f03f1eb77a71ad8ac526a1cb033ff0f266b52ef050d2941fc6e5f3723a623be07ac226becf8c34cef770ccb025f6ac6741141c913013d3d7ea46a82d5ffb3cf21105bc6874f4461783f494c963515d9aae6ade78634e144795bc1dea1e73b25df4c6d8dbd70b3b54fc950b0efa86d56408c8370aab51f5194f1241d5ecbe663610cd55cf84b6d931dff951f4d9c98500f2787de8720d9a5ceb08ceae3399215666bfb631075e9e5e8b4318bddfa5e40b279f14bc766ce3bda91f25dc5a1aac1ecf5d57d5888b29698fc55caac478d9bac5ee8ea1207a3b4969987e9dfff5e2b20520fe353b7dad6c42"},
+    {"000000000000000000000000000000000000000000000000000000000000381a", "00031d3459d877ccdc94c47f5d3bf6d5a5c51204136475cd28eb276957ed86b78818440c422c4c5a569604759ec2d4c4bed2995df3d39a78af39901a0fc551686f8edbcda0a753ca48870edb7cfd9e09725a2b300b610e19624b63610b2c34d04efb970a8b7f39dd0410fe7dd340187b49732e8366e07f1d71bc307e54742ab3a59c0fcef57736143770c7ce80ff89847e808f67573efd70ebf101b8b30cad0e6633afd8715edae0067302ca7da030f1398454e4edd987fd5f18faa2d41813036bd5edf6b1a47761fec53af3d8d75d5b6b873b807408a8e6e33988c994f268d7d77541fb94a32d4533f72e70d17c74abe675d9774308068de15784c60ef60e1477f90eebf9b29309eff7c0d32769dffbf21392e3a18811a28f1df6c29faf1cdba8b1b9f256eb212d27e1a45443a19bde3599ca433b217a70d6fd392e2a3af2bf9148ab333d8422bf63fc656d36d9f1310278169d3111b40db0fa94eb45375005b9b9bc847a154229e47c5b0d5101f67833d97555fa79da1b102d19566b7cdb534e1b98e0941ee46fce0d432536cc6830c5a27586e0ab9d3850e5114cf33a42d351fc523027b03be4fa726309ea3ad6bd42c3477ed1117bf9907f54165171b0e809ba26585f916adbf65d7adf812e357989e65e62d7d563ce448d25fc5ad9370dcd9ce543783b2a4e6ef0f399ff36548ad46cef1b235e2fd7039e3fcf198b323f213db676163f784f53283a9b8424b82660d18c7269e26bc357bfde4bcb68321d442b06f816d09b0ef1dd07f6b3d9b3e24e29d9955e5bc50f071275eca982db742252d4a79f221a0ebc14ae0b0615e250ad570a52f942b5ddd3deb45b2d2fdb6af83dfdc67e0477e9d9c24a36ef02e1ff62b460f73832216ebe874e5079a11346e9be697af9d6f8429eb7ff693625368aaa532354e9b7bb0aeeeac6a91edb7ea80038877c584bce32737be215d8cc8c3e267792ba0a07065d4a0959bc14fb1bb39810233df73447dc6577027057e232125489f0a8707fc84f82b4c5f3f913a31a1c4e73d1ab9eaff751b473885cb5bdd16ad9ac91085180fe21972595ad543090bad2f46893dd79073b90cda659f66cbe29f5e10a89b8d6561700e6398e941fb85b28270afd7fce7564f2f73807aa6d47d774a0514a9f9d0e5afb03f70d55939d38d44da3474e5f9302843e3fc682628dda6c21014fb0475add71dafca80e5616825899d6c75fa8022940f78fb220501e0c19131c0de8ba5b0da6e5fc373f62feeeedf9167f63d932f703c59995be74d9e395c39f3dbce770215e2bfa0285bed0ec3274d1f514514ea81b7a74becb34b5212ae9ce81abcd32550b077870d7640eced31e1f8bd204a6b975f1925639a6d54369b49b5ef573646cc8b83416a3a42a9da2cd9019752a94fe5e715082fa446602cfe57b804651c6439ab31adb3ecbcf1223f94897051496285c144655729fd578144819927568fae6b50fb8eaf34c6b4da5f329871645748f12116f15f9fe46809cd9cb713797d7fdec04e5fbea0b1e82fe4036038b004dc2e236679ffde054ed8e18547e2bd5e7782da3cc8463cd8524d65da2f68c4784112c6773eeb70722ae3ea982a13090db11cfed10715e67b3d99aa5156db5005cda71e5575883b373abd2cdd50b7519bc032d601d25dcfe28f83e529827b9bc2f0ecefdadb1331a7c97f70ce5527ca263a7f1f68bbac4d67e1a0923471dc7cf4b5bc7ae0b28059a4bdc56aaa455b08232cb449cdf134de9114d458603dfaee6a1973e56f910e9bc74641623ed12e992bdf32c4b1985459a0e0520b957af1448d9dade2c23cbce2c0121edd45adf4623c014696149c76387220b1aff5e946f273e7d2d78298625429d90e1e3eefb638d68ef59c5c23eb83302"},
+    {"0000000000000000000000000000000000000000000000000000000000000270", "00857b99c44b09aa8286005e75073e386a62b7f59c165cbefe6c301f09f41b917cb11400fe4133d9053c33ef39ac16146d213400e9f03bfdc102bdc09755825d0ec69fe6ed8875e2b06702a47ccbbe88d3d7c799065570f99605a4a7f9bdc079e0a1fc303ff65ee0ca144196f10894c060cc71f6817dd53b9ddbe491c8a424e1a982b5a320ab7e28b33acdaceace1742b1d7962699c1fb8dafd4e1e9082398a2ef55af82adfd687601fd63524a80a3b75d0cc68d37421f8e416e581c9a1e2e5917b551f1cba6cd071037cd06161b92d8ba72128c4cca478be1f1d1df83b46e541e791d1bb96cd41741cccc4461033928c8d18be3a241d2dbf53b99fc1d1caa091ab5b34ffcf582d58f4c15c1e4c21502662faa99fab04d1ef34a9775772ddbe7aa78225fe36d41f6d51bdfd17464cad776f628d38d39fecf7ed05a5f2a8f87adf0dd15d2ca2643db3da1f608753a79c5018dfd22aa04bd5240ea20a9ec7a810a454ad9466c163ce472c60f1842f3b1e19d69972c0c9d0fa6508333a8d3882170c6f5eea5f373062dcd214f9e8eb88536b86f6a23d31428b3be2676eb59a4623ce718006709f282d693a2e543d007f2106af79ef55d9098d6b93bc7b413225d906358a27790cbefaf02eff279a3a11419b78c191a584f1ffe93743eb82031f85478510018bde1555eaab79d8e19a73073ffa0b221835a77f9019e63aaaae043530266a4a445a796b5f904d155b423bc8b84c375d321ef1f95c86b5d5eb28e69d72ab40b831d0f62d1b81bcf4391a3616e7fcd31d30a2665106c65eca15a9eb3d3e854e0f3ec52a53913d23110037a7bac5c0559e27b0465b5b160a4eec290b7479e241e79556c9bc18190533780ca5b7a86b2ef17c3b3189a7ceca20dc70169f5e9cfcffb04f71b5bbdf01586afa5883428807fc808888a82e1e24e466b3f6eea011da3d6c184d2877a81311e6e7429b3accb7eb9f708e1642821c6300fa7be00923750525d4d4eb2d95201fa4bb6c8c8e638d72df7b08d40ab7e2b5c148c2065d894c38ff31a9dcdab26dd62470c49baad11e83f25979f3753db5fa1609a167d285400fecb2d5b91725a267ce6f4d71347c613d785cac3c7429db5de88d642331d3d3014194320f785b86ebe58099f17777d347c716ca383df6ea78c07b8729a507f0e2dfd9dcd7f017c6ba2751dc1c91e5098d6994c4686b8d1f7ef7e28615572217097fdb3f1329fd7aaea2dc42d742b9804f9c8e92e90a5e1c969b5c2717ca6e6a11e16c71e2487d1753889c5b36c4663488ba0d210f5d1d19eba075dc8677c50d334d73f370441f9275fa4b8de7f4413fd575af510041feb78e41353afec8587e19371511164ea9002d97a64e82de283895e7ed155be18a31535af43a1b5159a2368a225555fd3d4ae514fdb279801a8d33a978e556af97de25ed81f15b0a0b1b94e551d4edca48b199fd1afbc02aea7e77e9a6144b7312a05cd9965eb94e375d8cf55cc54cdceca1d379873640f9144be33f1053fe938b1afbadbfa8e5173b6032405dbc10148d277a4b2fca1880af30c1cbb075678861f93b410a4d63ba74375932b7d5385baf1a95930500e19d593e3d2c834d860e277793dde28c621b890052d3a4e7b5f9efb7b1757f2dd207ffa7590841dc62f01f88b65f6228d4715a57056053576749c6a3dd4d11191c3c1e5c6f41f080aa2773e4369faa37f3979c02aa4a603730c9a92db76c41698f529b2da461d8f303a8ab4472b61b963b406b68429d62b561ef83ed8d417865c76681223f6be6259311a5b2e4ad481782bb41e8545b7e1d1f709c9d7b62915ef554db6b350037b3314fbe3cb2f6a03dc6ec3c75dee54b9afaf73a27844bf0345979179812425e5221e57f176f9fc9d93c1"},
+    {"00000000000000000000000000000000000000000000000000000000000008a5", "0003703e1f2a9869c342406284c7d828357c1a5cff49a05fa17d1276b7b80084fbd2d831338b055e56e411b4eee5d0dc950f0c33117e85e2d5e46fc9ccda883a5f67beaa91b7b0da00d79a15e21ff2fac3da0d060305a55397c579943cbf69df1a69da32c5f31df15a0c3e4611c5a7fbadf8c6d2d7715d5b7916a65cb8950ed98e1d2ed5545ef46b64aa7dd8d30a415d7389c41801ba308814b7397535579322c7e6be2ff0f5a4a802a68bc49fb54ea5de3d73786ccae32e1e043bd7df0c0452747a0a5e41354d01918bf8b4c0aab27f6f4c12f24ef77908215bde23516afed90175f69759db1319d12415b8c81ff150cde4b15032e021d050aeb3be151e35c939892cd529c8918cd0a39fa90f27ce58812d161cd96ca68c87a667b807e3d9b91ea2b89d025e22abbc345e5fd7fd5060a44436d69856e7c01a2a02278d9e9962cf437197d1c510466a45f777445d99fb027d13bc6b0ec90c79b6620c655ce7e587e4d003601db354f6d3d6222578bc221a17b7f229381c8bbb260cff2e111ba3a62b4780658c927de1aa4af2b6b8481c0af9d032e4eeb5b530c1e4e3fb2cfd34630aec2606fc489c34c8b48725bd5555df2f09edf44d9ac73f0b1bd3607704f1659395114fe451fe5f38b03e9a680fce33a44d952e418edbd4adbbe957761228fd19da2d43ded32c93644bdea5e4b4ad58e465fdc259454f069c7a1bf48c8c1f91f3a45568f5eab66494da0cc62d49860f5a9092d8a4aef3230244271a77aa355358088ed8d9ae08df4ea113c3822a370e01de34aef50815eb7e3a1a58a224f5df743831b6c272f47cfdc00a14e8f756a118c444e829e54c877dfea957015c038f1fe22eb8ba2489c16c801300a4ffeba59f7dddabbb1eef29f075ce3e8f7dc865c49e32630591de74d2412312076a6d1d797dc2c1c6d78df31021d2b772b72102a697b863d107d5abb7627545998ee52681ce488814a291cdb3c859f3ae4f06cc436a5ca23b82bc3a9c0773259a288c9ce9f4e27a5984e706f32029bb88f61ac35707a2ced552b5158516a86bce99ded4dd6e0d2319beb6be1540650a97a410026a96712eaa6b9120232db16402d33fc6acf0a75e4dcd231e11a8542986588f777f0cab1fcde08b0a2f0cd2ce36bbfa97dc5069289dd1051bf506f17f1726ab65df45d414baac8504fe052f2699f330ea42b13b3c9af520f8af558a5d34dea4ff68964f26f4a2f35076dfd759e3a6afaebd0f549932fc0590dec9ea3505d16daffeb940f8e4a64507f25a2ee792a57097846b29524e6d8618f7165f0c276eeaaee776ab69fe217f66cf05fd8afa5fb45d212fbc2ab10a4ba7d49072874ff4dd522229dd31a9184721323019aaf96551129e94171811d1dcfa331f5f3686ab7ba581a3a98606e35bc5555dbfd9db4d7c03414d7d8ee0eac3103df036bdba40a8a03437cce7244e1f490e1e6c275a6c059673fd6f3985c8d8d5640bbee197ee4a2e832baf6231a447ec79598c7cd4723227ff5f2da2a23155c8e607a9b8da6dc22395f28f07bcb399248adb0ea77440e2b24abf5d849971ebba0f232e09bc68e7f1968763e4ddfbc25eb2fefa5d2f165a42fb67d606cfc3ef723ebce570856b56fb5b4e2a73fb4270d8ddcee3dad7ea03f8ccda177f752e1e07b23ba68d686c43dfdbb2504bf13b8e08e75b129d0df00241679f72efeeeac389a9a964bced07dff2af08af67710a939f0da566d1ff1813b4e0ab4e7f381e78a527a688a50a33df79bb7af4f9da8f414f3a88770979bda57b05cd2ccc26d520a5bc708bb4859f15074058ce3bd71beb8f94a618b6ab5088e6fa3abb8e5f0ea9619b455005bfc19bc3ececeb41f103e1e97ab632692763b4a3ecf3e8cfa3e287673c21e6b30fa293"},
+    {"00000000000000000000000000000000000000000000000000000000000000a5", "007363032a9d0cd1045df0c6a8f541d440291263e345ab659bba2e83efbca3964ad6f3112f866d7ebe6909ae4ceac14a4ae28b92d6f2c53e77372127fd2e3f3dcbe1f656917a9b4fcb7ad26478a56ee3b5da4b730eab2628d1547d80cda19122c5ab06905981b270d232cebdb17e4ee6d72a50637da7a53846530b9f5e26308323114c7c4e4bfea463a16bc23af637941aee148c8cc6dec67e70cdf389298729e4db5f1eb119e5dc05ca0bc1beeb5651611d90a370caef967cecfb2dd91ca8d4bf570886f5ec21552ba13757c37405de0f360832e61222de1b3da3c4b0efa2ab080e58cbb629b32f9e31f5585134c9d405347aeb4477be0613d8724a07b55c581a50e380cbfba468e8d35c1e05f57789a10ad7748fb9e61711513091a09d1b9e6ce725cb2b7c0b12e9e545db2d9fbac3560c5dc8dd35f3ec9b88c5105c4fff7d5cd5a9f5771134c954a59d30af2d444d008088b3a72c8cc1a90340562be178e1f531fab56e075075010d05ac0b05aed195da19b7311b97fbfc14136369e33e18f696d18a11a07f461fe23ef29a48407cdee5ad2efaf827e0cb88eea0793b266ce79bd1410096ea2fa7727381a45ac1dd59f538f15e8f333a000aa46b42220c21d666dda1b4e6f807177eddfcad7014c7fd885cf0bd5df7a1f48eea4ce435ba0a35a91b3cd8e786c7194235c458f578a2d5646ad2b77ed153033feda056d03961b39aa45ff641858d5092d65b9e097dae4d80cc3964dac4d18328a41594ca2dd0ae6d6159ae53b5b0cd8de443b80ea0e776c789953c8e507a6ffe998d26f227ff7e6c74416a10076d97bdcf980d66ee329e7565d1d639b3fc285795911fbd11a67f20a20c8201d557fd744524a07df8ebb5e92b348eb22cfe3b854917532d364442e6de35a3c1df9fd694204ccf44a170df99e50408052349ec1d0e95b33fc1ff01ace97e3886532a7db043b4467531edde95f532661acff3f5f8973b8b5d3fd39edb756595b02f1c40320cd8d25f38033bea8b83fa350efb4a9bb7b69e06a912b414df85d6d1b77d4cc34ceae6dae8df29f17bc204ddf9f2bcc4e4fe6394b362946b716ecd6f7fdd9c2c5193c94adeae85de2d983d75e04b46d9187fde1c1ba32b3488d9eaefa37411d22762034e8832bd62eb276db7d4641fa9315a1f936f9a2e8c21cde95c9af103dd48418bc2d2e0fa388902f6f62cdae2c07e79810b477cd7a9d528cad45d1d707a77c95762ad9fa0dd1bf3592bcb920201a6d6443b4ec25f21c38b346d5061ad73472d1c3471265df8293e4f21124e1795e7bc0758a9bc840b4df4d5bc849ce6fa89dd605334ef650c78775a8dccb27fabb993246d458365a62f5a60961265fb2087a5a94da47443e8d3ffab5994eab3b42e35cbf9edc7dc2eacea8654a0d2db7af5dcedd5689801c33561980b00010fd5151dc0fb3405d4f318f58009b50e6cfb4e55d0970cb8a3c9fe88f2beda9c798308ad87c6601b492dd35d26c87bf6cd71fafc3b22151b1d1d147df86977defbc386a6424ab66cec37c41f054399c49bdb1711c90a285cf57fedea1c6bdaa679237b4c199038c07dd4bda3aed87cc7864f597ea5bc05e7861d81ed37ab99159467274640a93fab79d8f808023faddf28a1cf9edd0507fec56705f14c520ede02cd2bb7bd0438c4c55902b857ea2d06a9ea971afd2260a588e7d9542ff0d522a98a3f372ea5375fc6a70adc25f5228c468935e7e67f44c11021c16638f795133d0798a032c60ba959f8d864626ad6a7c61b94ff0436b1c9b20111f48207d2fa6618c0d1959a7a5ba10cc2af268792acc4f697d1b20e8e34ea8e399d39151f17b926cc13b8d5053a12ddd5238f336a1f3c21002a759bf4fc5398e584f4e38517f1fc113efa34cadf"},
+    {"0000000000000000000000000000000000000000000000000000000000000556", "003d75ea1757f9575803925110772a5a19c5bfc0d6097944e897871a13dac8f28e009f42657b13ae49480346774a6fe17d29d9d790c2f1793445e1253019f925598194932dad71e326e38c13f53909f812b0f663044f099edf42d597c57102f8369a2579fb5bfd54b90513b7457ddbda2b06e17338e4c24b0512885a0b9605f245ebcd072145b5fd96109a6e424336499fb2c325361a2b4c0d3b5eabfe8336fd497de6781dfb16130177dc49a096ce4b67cf31089341e5611e4fcb728e14ed6c193e321abbe068c1db6577c2549379f97ffe0a184e8bdfaca6bfde85b56751acfa9ab81199812430ced3db08a1cccb5d0ee3c031a6dadac9aa96564604261ebc3ecc82b2f7a7c1a882ef3c7a0dda35967426001135e51a2b5d6712836d9d780dcdd3b11cf78b1125834f45ce22c5f30bb17cfdec20fd82325199762984bf6fe15cc459a740e50006e1a76f1558fe87780111777de880ea5e170d708346888a3064f6524ea4064efd3ce54f889b0ab57887a265dafefe183c0d9a0aec8943821e842b5fffc631b0386885c6d21dd64f48c555bd8728b82daef26a49bd7156069729bbe12908dc03c7811fb3c7e94f5299996db0662d26fad60f19fdd4fc075d994b2c2c11e8d4aadc2dac50f31f700fa5bb4cb049cf6bb80ea5c4dd77810653663d40fd21baebba9d139818b0b2a6e249f55075bcae5eec97071f88f814cf85453e5b78b7894b5a0e4f953386b927ea3e5c708b494b736003de3fb7df2560a85547bf0ec2167578f1653bf5e175e7897226f6b2dc1da27240e85da0e8a2f5f9eac4ebb2b871076afd967fd2cf23cf6c35aecd7c2eb2a8f33b0da55424d2cff8dcd84766952249da7be8df5ef47e8cd547e152161e9c48289759c91acbd4d8f8fe4472cce3e6baf71279c4603ddf52f0e8e634fba79ee5704e78fa9572cdba53f20096448c7e44a98ad58545cb21be058677eb97d4262e66b63d7233345dab752ad96fe5ecf30faaf9fedd350e37b2c6d55b61f94666235dd0fe8b29a47f2ff35c1596ce9a9df163a423a5c984e97e7a3b351e026b036ccc3183a7bcef8c7861801df027736b8fdd38973005ede5798d37ffa39e5479444d5f6b7b427dab7e1468376746255fa16dc65238cdd30d8268ce7cdfad32d69d8786df101fcc6ae5d615ddd89ecd6c5e10290504ef975a1b5ee6e55ed19faa7ca2cdeb2a5f157b22b17d25710967dedf6174033f655eb90a4a70feca2d50c42efa90061fd434183012631caa4fd55fb5d730592a50f8e35ce1c42f26d617ca463a0e8bd8e844065f2ddaf16322cb73875526cfd6add22f7bb4d00e68ff4c2520245ae92e065a0033eb183eaa7c565ce210734c1a5f1d3ef94698732802cc2ea305f17e978b1e5d816ba692093090ec727a9b1e5edd265f7970c701de2c086ab0fc21dfc5252944c6697e60aa1d45ba0713c9331a2d49f3f861e3810770247a45c479954011d84196fe616939d4bc87e3dc4058af504b1b71a91236a179be47e774d4cd160816654921f52938f52d03eb8b82098b0ad9dd6b013446a071394b8bb2fd2354f5cc85f61c579d1ecd7895297ce2de46faf40f7c1269efae41ed7201c6f1559eaeafda2360ae1b17d82ee474229d912a0f6094a3bd804d9e2629c755060002ebc7ce290ef75fb56781f81c6c16ed367b2c06c77a845ccd74e1442d725c298cd9f6915747607d34a80ac9059b0e4603cf97e752a1f5ac1adcccacb561de0f707f18de4a7ac7b4dc9631053d031ac0fd381a6203930bb65ecc0b36e1b1d262cfb95f7a585f95795d4334fce09bec601fe7d3b505ef3b5cf54565b185a40d04621d5c4ea85c8c36415498c59e29353f4d994f2656d2f82692dad593f3d49f684cbceecc80ffa29d"},
+    {"00000000000000000000000000000000000000000000000000000000000007d1", "00aeb44d7e06121526c0422e41f0069e1a2b9f4a020afd1e6ac00384b84d3d53d97c7e9bdd80cd1d9567021ec9c3704b9f28cc6f725724aeacd59b3a5234c024b5e287a6a86653c0ae156c4cdddffd628c32732409e94772ecc9476b9e8ca34bb3a6c434db5b301af035612f583f0f02d7efad53edafdc1a314a991bcedd1265a58749e5c443b0d891e12c61c1b16cbe50d9e617c5ad1b0ba737f1fa3921b7b968aa75da167e96fc02c6c74864d76fd78c9218d5aa6fa3e27a8f3e87160fc9557b8c0d1bd3ad37219a355e85cd7b2c17cdd60727c673606d595bcadaf1855b34dcd0f9cdbb745c3ce3eb235130dc7bf1230522553cec4e8cca155c3702e4c4dd2524fc47dbd7b16a2ea90b815c2311dfb5178fa138d65277e5e125018266d534b1e997afc21003ef6cdcdda029936ecb40dc63518a7a8a61b5b4900463a49c160291cbb03e725d116d3a4157f4dcbaf50351c8918302df255800611d5ed842d8b9cc660ce704200bdc664656536bb16939a5f3e092aef657cdc30c1ff956e0ebc8bda4c4760c7c5e22cde9935db2cd1182a427a25721477bf7f48a2b790bbd5e982cae960408558035c50793c39283f0b7c649398faa3e55d834114cea6bd72617d809ea2c4276ec6aa274bee2a9144357325d49afd9cb13717eebf89fa50b92aab01e1d2d2f6dc4569b7b0af4762d41bd4f11b4badd2433074284266ea281e13c1c45b70ced9d6e5ff09358c32345d7deafe7f4519557c7f33863c6a299f0b834783e21a7f3f8735bc1f95264327c5f5e098940de415854d6252e0adf7641c35376baf343beb1d7b57320e316b1e34cfd8a219b273e28da17ca39766eae154fc61c98ab96e22665a534f3562056e118ba623c7a87872909ed07ebd481afc6fe47d711d7129a8fdbdd56ce2c0c8afbaabd1e11eb163311ddb0a88594f537d3c80271b853dac925b99fa9114287ebfb11b873bb96030994f9c9758b5a96965c339ae7ef97c2c11d7865fe0fea5a31c5e2a2b1cb4d45fd2af0081eb10cda581f703b3d483e653cbb6363a9a31d7ca7dae0665ce81805021f432395627b50f852aaaf43a8cd432c1a1a463a793bef4bef1015df442474d1719df2a769f73eee22f341e14fe2db5525ed86df3cbff329ca33f228e8253073053ed8488f445b32848ab4751e4cc11963bb041fa557ae8c4db7e27100bac59e8c1c64c9b777a416c5dc88ec6a1bc1f13a4392009fb6ee565eda6aab0b1a831a9035d49bb10497dca74daa3efe9c3ff7a253ce7d2572a894997df188d855ce02e3acefdf5bd80fc217cfc56ee3e5eda231d291c815b130b12c281d101712f18a9afb8b9d2339b2294e262a76367e84da25982c6ae81b5b75892b7264802860952e98d5754e400c5a776ddc15b9c16d57ceb173a49b693e5f52fb0344e626dcc6353d06059b8ee8796c2389607fbf680a2d3f6b53875c38fbe1a672643b754deeeab7fc370525f76889503188f707c331eccd47b8df4e2f884028454ba10a92fd2b9845a329aab8d2f769c89d8abf053d897826cbfe94faa326b7535fb5a5eabcb07fb74033fc84e955271ba73ac8d2cb6999e68cf5df730f08d020b34b2ad6fbb91ee0b5241ca47d294131ca7a1724e35b36cdd007f8009173236af0963554fbdeb806f12f5a03d82339590ab666db5ff546b3469b7e38117d3c5856b276dfe50325f930f886a58ab7d897dc21851173e6cd72e98445e628a44fcc6dec0b18cd434321eded229c66970ce1f75950dbcea1ff27d829d6219b4c8f3425a883ef609520f56f8141ddbffb08f33ebacb078ba27aa3652c145996c00d1d1d973d83053a81960955aa4809fd7f3bbb9afc95d72f1d3bad543ba9baef3214cd26e048d3c31f3af18512183c30b9"},
+    {"0000000000000000000000000000000000000000000000000000000000000ad8", "00366b8f109695c55333509096f3c8c1e29418145a32ab8a66bce2b3a7615757976eef5f5fb7e6be4a290fd5d18f73c84557b91053e8b6d5eb69acf37818333e693218e851acf4a5340a7ee063ff9321b8fed39f003c363bd6a8c363e1202359ebf3d9a514999600901003177a4ae17d9bd9a052c0685e9b6aabb4376e5605040b4e8901b78b6cbc165338585b4ad398dd6aee2e679bb04d8da856736194e1bb68d435ef15501ca2017a6256b1824e3905a510a34e592ceca8a37b579c3db3a208662faba7be4c642e7f39f16da2edffd7ea33fd766fcde5b2ddfe13364f1dde862a554776ddb4540e845bb3d9684ffff73a04c0d2a43bb41b7feea110d8f272c5a1ae0d545ea8c0b8ee8c9e440cb69a7d50c3dd78ca6a765b763b66ee9bbd6e6379f69e62cb117b4b5b7025cc5d36b4b2aba33c738e8919b606251821dfd423060f698c2a03b636f20cfd1d8bfc27ae01940ef3b2202271db504932f9d49a6f625fbd5eba0978a91681cd2a070fa9b151da2ffa617c08df98f5263f4f7f1e5535853ab626955ce86f75edc05f2bce2b8e132f3de37b47427ad6c8917bad9efd8d3eab9203ebfcbfe1e81e99481b713e5f9fb8d53670ec12f72b070b4bdbfc25adfef1c4456d61f57d3002b454f6228c0f25804a94a3bdc2d7bc1f7cd762471c76fa922429a7eaddf1c055a518544c66d1bdce7ee3d888b00507b5ef79d5c4e9002023c30c263f5a90d3b565301abbc4af2d2004afc73a998562d8a08b22f11fdc1012d1b1bba10547e4ff0d4452046cbef985439c115c2b2e03be55ec55d9b0f2e6e532e90eb34ccd1ec780060818b6e883ad709dbda122ab7c52d6ab29f64ffc2704d41e55e71f2fa0bfc2f481cbef5556df72e4ca0723f14c880444e49e9d88260151a66f1bc41a8d3c12a0c2fdf972fd75f367f179db1bd00964a47ca1b602b5f1be2ad6290fa322e0cf8c8bf77c3ab36adf4116b766a5140acae7f89c4282e23d1d2996d0f7e63e16eb59e1d5dda73f9d2b5464efb4e9b7a1cb9d95d157f1b4644a9a5d90f17d85f918ba50aeaefb96200502bca8cd738816429e6a34885aadf99ad856b8d38e03cf48943242771f2acae068c7e4cc9c2c919d96c60a5f778509230439852b13a15442dbd217ef9864360efc888e8adc754f3d3752e3fb5f65ecc298cb9cb302c7a36df502cddc846674789bb76d8e2d49bedd99196bce65c41c5beb5a9b64a3aaf3863e26d7b55af10e4221a1ff4437b47f2c1560123dca21d85ed61e261e6809b1c06a3e73ba52d36afbdca3f96c135a427908ea6b3f6049671fbcb3e1412c9ab879bb2797f3fb44033cd8dbdc6bbefb0309de6be914f6c8121ec36b0dfab72feed696dd1425037b933eef48eaae55331233d7caba161e44d8f49336f078c33f21be44b354da042259012a6575b13f712180ebf534f20a80930f0b33beb530b0584647bdfc344f21c64d5eadf7dd0af61889fbc6f2c76cebaac4f5026bd0015f4d1a5fa0d9233bc21535902a8e8cb912f322e73f08d96c1a69110e58cf6b80202183b70a4167a41fd291698b19ce98106f84d167ccb69b733eb5fa2db8941a4b959a14cf12669f1832263fe1b213c29e4839f919a925145e9d229a9d5412f406fdcd68f42b07b0e68e04bf93fb2604b4dbcc20ce4684e7fa11e1d7fc49d16787db629a439156c1aeaa28fbab019b55d9647df30be81f9f28076cc12741356cf5b992a2a3319b3621450d1ff3ab13d632d121547df9454a44b769b29f62fdcbdfbbaf0bd75f18621e43b7c8d6c4d04f30bf933a7e7c5e2c171225d83556e0314e6972607fe65e1ca2b0511b8222bc9c1ceae5d7b79340a3b9071e8fd530158c164a2e5aee5741d3acdd2ac163bc716438a9d10ccedd91"},
+    {"00000000000000000000000000000000000000000000000000000000000003b3", "00b8c0bba0c9c897e3f42236a72d3d159d817f61472defb97ea1ec43e5e256b7c551e39dee023677c18812c290a23c1b15830ca511e8ec7f4a3535a8fabdaa30d2173d89a8026dbe43a5000e42e14ec17c3aa3b6015eac61ca18561928f11333a03226f5b33f1433f92f151ae50dda780ffa131636dcd2705e4dce98c8f103a4210c6bc8911124c914d6b131ca7a28b03e39e6182fd4a9a69b083b07af87190c433d03dff75fafc90884f760ba1538b3b36473fb2cee9b4f80a2ddce673bb67dde1f279b7de4fa791d88de2d7f70ab7d74811512f2f400196ce1cafad2e451c6757e9dc5d7dacf32f35cd6dd560874d1124491676487f5312aeb508f08e125dc06525ab0e77064d0a7da2f93d0541eb23c168dee7fc687a8d85dfef641547b0baab2cbbba6a809436479fccf8651f957630a8f4178d4e4ba8b4b51395b92d37c5cbcaf5bca35f1143b3aae6fba1d07be0176550fdc44f5af09a0031bb0d3067fcca35ff9e00d291733931f349b7f39c41bc7f28d7f89477d052802318b9c799bbd5dedea26f2efc3f7ba4a4435d66606e884787d157b0cfa3c69548adf8e92b46eb6738b02190223d551449145f91684aaea3566276d9696e43ab267deb5d873eb985645721fda0966bab09ccc5f06b0c7303301ad85570d833a4d9ab4c12bfdf2f293343e99bfcd212a2b9dbeb439e2e89a09b8b41a8d3504b7d752389a401b06cdf48bde2aaebd80915a85b82c1dbc7a6e4ecd356f2032f053f9fd4e21ac57818d0f7f9e2233c56f223fa98585a75e0a0de4a07f3a551a1eed947c8b077b0d1a787ceac6b46e30c033e58013e055c4660e19e1bc31caaa7f5df1f7542a5e59dc3e5687346b142b81b122e8858d526b6ea67a9f7d942d654d9bb0ae82778e9d878fbbc964fa094cd302e94bc6ff70c37c36bfff3ad52bd6bc79098c52af9c1700cfe6b1d38a0a4e879e73bb7f22cee26263547ecd5a8ec5ded919ec0191d126e5917d3bcada24380f08074e64e98af89413f11490f704ffb3a074d851ee580d77e32ff6d1e29fbd11274c0575ee1614a5b67cf2027e1a04bd6fcd1de14ba40945e610922b6a3a73ad0340383168ccbb4b4069f13264fda7bcd9a4cad0001e570c8b58cae235a8d275bfae438049c50e8f1bf123f8d76ce5703f3bb2d9e5a50a517ef74b6d1f5da600e9b471d30e85177ebc1a5ac57c554720b7dabe64055132c80e391efdffd6110ae17e5d9dab22ddd13906c5007c2ff0d45bcd7e042e495edad9d6555a58162712f56102ec7f3f6ff1c72f74f12336a24837cd320fb62ebdf68b5e43719603a1d868efe55c5f9140dd36124462f093af3da445b6a2194dadafb4b2de9cdb1ddbac4371484707069e0468e7f28c961f7c7142741fb6492b19dceabbfdd013220f7920b28a76355ece01bf461ed5027bced2e2c1a279c1caf57fa5920e0b4bb093a8105bd88bb8bde721a4c5ff8e8e3a95e741029be844db55fbe5a77bc4ce02ba5171eb3f0ff5490344e74842cda6454b35f04fc227d444a80a6e02d105a9247a30c2253c4bc6e0c258776c9846a89d301f57df0ce2ff163419dd1127bcae65621ec8689e6d410f940d85e4c86a60f1c731e21bacfe1e6c9c7d6e3f2a3869b45d8e4c7308f43316dbe8d1c743fe3c00af031799f39d5a92e9dff4b6cc9368358675b916b09b0ad092473e2118f71c6f59fde852cb739ca15e024c1d5524bb9c20754fea0a428d8556a2d311fdb8bfa5274e3cd39ad036515763628adf1a2a8d2a1dea896a06f2498143211ecb4db7829c043891b1abadefa532216133c76198fc590178a36099b02854ff731185db07b0c7ba4f0334f998fc20c081c95b28ee83b36694365fd7e13d1855f75ff3146bd4a8003941ac513c76"},
+    {"0000000000000000000000000000000000000000000000000000000000000728", "028a9e3025d1b4412a3914f6ddfa9551a2ec7b53402350cb9a1c5843b326846964844f9cd2761ab8190d0ac01aa816d0424f63925148e7f55b4a10feba0dec1630d2c39fdcc99dac4a71f151a33d4e8711b948450caedea304b76565bdda31af8035a8d10c452a943e1c1fb69cfd89789f1da5a3506e6ffbecf894517b9615aa935ff31e9027745f4184e03eb614a3d076b5c124e9f37c841bb14d369a746fd0320bf541adaed4ac02c566fb0fe10c315acc112b211720aadc59d872552dc6bb749cd9c9c51b860763305c857203c19ba4721c28bc764b9aa81dcaf5024c0d17bc09af2213c9be66011baf495bcd13750e5934f6d4398aa0c81ae5761ac314e5b28fdba379d6c1e7c49460158d4635405a52879b47e09fa363245b0c23ea6485e314339e8e801fbccc7414f67777c6b1c456995ca71b7de71d4e85515ba5b4d5f2faa79df40abfaad9be4f758c3d2cd50295f018256191e369b10262951e2ac0a6054cb96e06f0cd69f144c1304527657fb9e68c55eb9050ecec1c6704b48d9ea9e920cf237c38dfe7454db83db4832fbdfe7496207ec3261d74cfa6b3b7727984dff21c10170bffc2cb6cf1924523e01575ffcd6dfeaf3e0710ae5cc224513fc4c74ca71c17eed741fb4f3b6429235d6e627cf587fbc3b1a30f8a59504500543d323a4836aedf0e52c7a777de150017ea3c622255727a80055ff22351c15b2bc72f673a4f4a913a0e9cbfd503087af234b3f2b027fd3d535f5fdb6efd89fdbe2a0c0e3dd48e17df4877732e3173553ae450f690170f2937579c17018fa21574b2b7efdbca81631a80bd08f105c4677171d82ee32373591df156f902fa25ff6b601abf3b1f4ba37009f34132147a388f5e487199e7720ae3fa61fb5ca69af75241cdbf37da191b7c0f3c1689557648beb38e91e893692f5f69a966617bbe9da50330fda891c6323c6d3cf0dbfde90e8881c308c67c17fe7fc6260c5339d3ef72279fd18de931b85e56e303664d014297b6db0dd331fdbbbeda21b6e494afed08f4f20fd21496fd643df18e91697dad9e6c9a464609969d8acf2e7b4d8f93711a83f89f38f9b0e86e9e17f5f10e5e9bf948fff5943679e6f179480a1c10610e585e5e2fc75f22a8a47380633b7128f4afb073f128b6cda6ac0aa67b366605deceb98e79ba1e969fce06d2ace7166f834989091180332068696a6f91e3644c72aec9c95e6629cd06a6ff8b6d28d6bb4d9bc0111e760793f88dbb30e6c3335d40bcb01d49088eb3132b206e67784b2f5e9ae2055ae9eac63e97af9c8ed2195a44b44b4a62ff9818f4aa43736955b1a371f7e37063dfc0fae29edf4c153b5866690f9b5cbe9c97a82ec6056943dba4ff45ee26e330dc224ee7f15aeb9341d11cdf20d1834695487510715df87209743d8ba903dd732a2fc60c4879b601b74758aa4d17b2f22dc4151cfaf94f8802150ccfc390e62286c5e28e9fd7890967596503f506cfef88f1c16f1577c1314a6dbf4f1386292195e5972d3576d27b82b7fc0b46c45a5b8d043e041ca3d6978f579cd215807f185cafbaaa06e03d49c44900e109cb130cd564e8e357fff364dff51443891dda0f519d10fc70874f13d44693130f59203b45d59b88bc6c20c7744cd49884ffb301959e8ee6c7053bd926260493ed6379859af5ffcf119fc1763bcb0c845f3ab1385625d9f4468251ffca2ebe0afcdb66368b15417898ec3dcfd6d3a2d949d56e3037f5cb6378576deca7e856e1749e4a0d747d2c4e9f5f968f5c0ba4e1fb25ca3753746d07803d5993f60b55bed9c5599525c1f8618c0ba411b9d174f2448f4ded5e205d0ebe747551c680fe775ce1442dff1c2d6c6b9791232c3a2eae57101a29006be97321f162b6ad74df656b"},
+    {"00000000000000000000000000000000000000000000000000000000000022cc", "00685ddb1f521327b6abf189a5158a4575b72cde210d4a59245edd28715d3e753dd544b81dda6b9b67f2019c5dc24251eed9c903319b3356b430806d55b16808d35ffeb0e56fa531b0f15b1314ae84cedf39d1c902adb2058a894a8102021203dc44c0f29e1838b5602672269b56de2d16f85562684c4aebccdaea4b5acd0c3e7ff98abc931bf9ed74032042b7aa8ff319b86e39ee863b1e58cf1affa814f65d63444d829fbf07c7019bfba89a184f5aea9e97f88c407b0b010578d9af498c1ef3033b997be91745d60f74bade12c6787098070c32aba8098a7148ba91381fe5602498f62e20e64ca29317fc5cbf89b58dd585da6ecf45b8ed572d1102a2a0978d6779279af2807310be50a514eb1abaf91fb15445d84a75ae791ec2c79ed5c3568ba79d9f2c0cd48c7a3304e188cfd9f41fbbaee95d9e3996702f1303f5faa4d3ce42f28106a9086317ddd225b0b471008400e81f5b912dda2b352869e6399563428c063e144be4a22be1c50ff98523affb5b0f9501b25659f20c2639d1e54b0b9bad96e30a3a7952c4f53a9c56c32a3ffcf2238aa3bcf57b0835ad59200a5cb5fd95d5016493cfc00f0ac1c3a3a086397ce3c4e1598efaac02f9b7d979c1ede65797b260437136bb47907a577a0ebdb14d751534e9bd0637304944ee8fc839df44703d6cafd14eb00c83b0ec94dcdfe60929711ad39509064a09cbbfcdf35d6a57d63025c91a2293ae9d5bb41afa970e11eed59bc93c97a84041af56cda01c4b0108a94d99e14fdaa71fc03161bb4f59f0c4dc18caa215274961d3528e39cde0bc2a167ad29f27fabdb55b077761879f316a41db7ea2039e3ec7b94679edce833b70aec21253fdbf4bedb55b7354be798c18f077b313a600d0bf4f7a13d5a5a266ca35b698bc7d767fa154beffd4ce29ee399cca06ddf5bb40b6be641d044c00e42b7dba4a0f265afc2043ef05e7b07dc747b4fb08655d3ea29e46e7de4202497c67ebbd89d4f7a82715ae722a669038969420120537c032918d8ff49e37843d1f2ba73343b9a1a70e23c6fc9b5f8a6d3d86f003e869cc69506e8f51a7f0add4db277daa08b459301f80ac7d106e93c1ca07225f6e77c2e92fad52caff0556fe7b8483470105dec5a549da7a3ac398f670290bb0b97280edf13f8c5be284ce2c9d5ee682fb4e99034ba38ca9a2aca19415f1dfedc0e5907b5fb770010981c214628d09f9626f149d6b30893145bece1bb90fc462db8151f02da36f21989d621cedbb99ce23b32247596928168a4f72318738d27b329641cc7398050bc2d33ffa31b9bbd00462c4bfef52d1c18ef3b6e6634d6c72cc5ee54bc3d7d7a4895ce22e651394271f1159d6855c0c2de9ffdc870ffddcc722063438de9620df89b1f59966eeff04991ae8538c7278a1b62363016be01ae9d2e9a9fa97812f522ae8417a2a7667f02d7f54f82327f74d7e5f48d148505d9240409644d708cc757719e1d6852e4d718fb199b6f0d02aeab5750a3720fc826c5803da0ef2823dfefad8e24eea4eda06b0519aedd81e47745744a6a8af19e559e5ef6db73a323333128f2a578227a4c8eada4b6217ee9449f315c610bd3d6288bb5668e74e3ebae55208541150001eec95c25cda16abb08262fa9a7e0afadeb35b185301af6b3b93f14243e4e647b383da13760eefd6822d2439199b39cfd7c1020ff4214ff0c02b2c58bfd5b90d178dc60f8b640d6f637208d92f96391b830d989318f7e63b3436b647f80f9416bf6832d117f49bd4310ff4b14d126853775e3db251da9cffca1df09f88cb18bb47646297e461fcafc4f556bd257a68a814e7a832c10f80792cc797cf6114e819561063328d7da7583b2bb761c512edfcbcf1f6b81b47a0da14e79ed433"},
+    {"0000000000000000000000000000000000000000000000000000000000000547", "00150450ad5048eaa719525e4920f869308a77de840a748122a990c028f42484a6b3aa51b6757e3eb7ad02a810a7c7dbf48eec9f91962ae40f29dd413efef16e95cc950a38b9c5c7510b8bdf654f9f03617eb0141b0588fa7e4be58744ce3595c0eaf1033d0abe64d31d4376a93d52650d9c0b56a2dd47fb61cb44112c4a1c3b9a73232d7689ddee841857e068ed4052cfde4a23ec0c3f73de7fb5238c37904b44612b2faabe36930074a25a5957d1f9caa6c10adbec46b65cc918321c1783827320061b70dc76a49c556adcd53052ea1026078f2b6bd0176e53ce11a1183fc573d0b20e95132d4fcc4ecb45f1b8abf4a08751baee3de5f33c3b7150092b450ab5c6d9c34a1488a68848ca968f021c06d64edf7f39d31bc08d27d579b117eed596ae9c37006b25d009d2369d71651d80a27a64eb497195cd144e1f27d18a7c16e2c2499c4d33ac91b07481a086328f63005d3905d806d47f039c702969cb3918798fd41b1e5a29c79a37e3a1abeaf91b1390e039cb1c3d9fd79d1549b655b2d0eb75fe6f6176d1fc08e96464b791221bbe5e4d1349e6d7d3f14800967aea1b4d0efd46b405dcf4c2b8dba259a57672380d7b0e8dfa91d9b7ed0d9acce599cf8f710b4431c4aa8f4dee4f46d3610b0fe54aa91425597b6e7fd57055af22a1af1abe940878c57c28582b96a78675db41e1636d6356955cb75c01eaeac08ce8f619be0a183574789b2ef3917a73b023b39d06c62256af43f9059093d39746b2a1de4c31023b3953bf4f399f7eee91b74b94e958d0259c715539c2f6c265cf83b39074663d776f304e62ea1783fd01ff0d1a03e553fdd4da030b262b22850672b460790593f120da87523157d950b3ad85c4ad9c0e189c5203222d72b0f6429db5b6d7d59ac2d3b29a5155171e4b0955004eaa5c1bfa0769dbb8d7403aa28b168959004340986067a57fae43a27ed0c49c0a0dcab32bb202b17cc908f81d1bf191c45fb56717812c8cd68f9c0329caeddac78cf3b45462f26158e17664c334f8bf50b6671f4f6e88b7831d2527e14794ce66e1568a7b0e4e95a0d24f2e98ccfaf8b205f64422d53219fcee21902571549863f36e5c12d40841c66fc1c0ffaa2b101b53f182baa2c3e406c7d092632cda2388152e39118a2aa04dc8bf18e73ef1b4d3e12f45585057b1c30748c5b7478baa54b6d3f1618836f37906fefd6152119bc963aa44d9afd6fc4242c494fedda33c93216e08ba38770c550474bc8a322d92445d38f24ab9930a15780b6fa7ec0f95f4c988000841e3fa72255461a40cc991760ca169fda4cfa3b24fa2ea55e85834970914b3a90e725b7b116b72026699ad011d0d89d4df5511ab11f0f5216da3e13bd571f334c09163e7d76c1a2229a9adce8a549d08e592d2b37b1181433c10721101fd841ec5079cfbe086c0b37f090349262550d8d6104841abf1c434273370429d953bea8112395f626f0252f7380ce0bb37342e7921f4e6a272f2539eb67b2ac1fb75711d00e55370e68cb3c031fa7d9a9696430ab811d84343f51dd12771cf3d72d290c63d7a62f419b4f7d2fb753057beccc1f083372a60b66df279c50ef691c3ec5cd6b93256a1a53eaa3c1cbed0cb4b8237db5af97393c94d9636e5074ec5661ad4803809ca0772cff53fa333495a86653c1377ae4f1dedbe835d0aee8ac8c169abcfa17d554d16dfab2a4153dae1740a8b6bec8442cff357a170fe89c6bb2dd851bd0d39219c2b88b9ed1bf58cd2868e7cceb1579797de22a910209370db957b2f4351f33017bae7dd1c668d968a387b0d1ef89f1b0baeeac616503b715a00ba30a3823120a6faaadbf0457898938ce373239defab589c0049520476d8aa8bebbe4fd72c5ae4589e061b546874"},
+    {"0000000000000000000000000000000000000000000000000000000000000483", "0094a2bccd4dd6b9718d843db64f86fdce01f65ba317b7a27f63dabd953c2ca19a6cb9328e1d73b769260978805111d3e135fc34a1f8cbc42b957b161babea254d87450d993dd9c53b042743c98f352af27149fb13ed7dd32c596b8db803541307cb1252a03fb58fa81b83fca9d214b63be31df1e7d0965061f0927de83e1792edf669d05515ca6fe7b88ce001f29720f6a0fc1f45bd2b1e08dd34655dec06f672b2db39ff1c6a8f01b8df7401857891c971306436de3a3a5d773f82901071b556025c95e9a640e3b80ee4efa10930311f060c79e8be35b5c395efb8823e63491710d6b932e9551898063614b803b5f6f832efe71c6acdd1a9749c0e041c9afd599250efec533060f62edb5cbd2a5dbd5816f8ace96e5d5cbfca3eb44b7c4d2d9ac7e5785bf6100be51d61e00a29867f3a3944e98f4788225e41f22a380fc61a19415f88e365a2e66193323b169910d001ebc096215c846ba64194b87445d455b5722f1c050a09bb70925f7a55ce76a3822fb80d1a22e7bc9cea13bdb6019ad9551ae3c21325bc3781d1cc2d33da0720819312687c1ce3fb9e43a395ee77f205acd6911706258ca258d543af2a3a049ad75db632d0f797bee62fd53de03ca8c2256761a65d6dfb505206fa9c690806f452ea4817caf4c34fe1ca4dec9dbc8e073f916e1964e5688d150c7cc0db0374b12db6f9bb3afb5e2e059217e568966b22e2b1819df98e0270f6e0da8bca3b2f9fa282966b8f2d7d27e9f157972ec8e33989de0bdc999e698d3b7fe4e6d11f66be84c8cda0763b6329b9f9d1fae7cd27a864080a21c6a40ab3f0f7ff880f7c443b04f879dbf3c5a2daab9d1d150a5574bba60fa162f61a0524e30c9490ff88c7ccd8dc32d1f36d13b45414cb0e6f60e05662ed54de8552fae2fd9f4038dffe69e3d204baa2d7439489f1ac461e345c5e8f046378922049f423a5c084a7fdc4c0b23b22dd5dd6148cb627a18605f19cbf748122a656a55d439ecdcd295db303c797e1d99bc174441dca8c2355a5fd3a1538cb3371d51685fb8ce2e7567c790fda592756f95514b0b557532423cfe50c8bbe3ffe77ab398d5eb7a057600af630a3c827f6fb55d24f32fe8aeb36bb2b0c1bf8918046133305c7e59521df4150f7bbea1f308f4f3dcc2c10ddc141d295766188e3c349ddbfde44f1061f70856e8713b923d8cbc56e7371b3ef2f7f9d2f4a81f56401a56595ca046ba26b7fc16335d87a6fff2977dbc43cdf53fd074c029a72c7270d9522d1f7da6a931792faadde6dcc12f99d58eb82f66d3959ae150e6c4593488411de336938d099f6bc6b66247cefbb2d544c42fa9f876bde085771a5f5f7f33fbc3aa8061285e31d7716dbc0b9cb2188ca43ac4a6ba4392319427125488d3306419d86172059d2fd4e3dfc92c3e705bc81dc8e46ea27d671d508a17c26f62776d3595b28c397fd9ad1ec72bef54342ab7708623d9a75fca311f65a8e711a0307f5dcc23be44b215e3ba51377fc19f25950fc65b3677917b36bdaf0e4b2624e14980a07c753d7da886e9d1a8c81d26e6055c0d680ac932349945c77756273afcefd680fd5679c52c858198c0c1d3c55540e5ebaa9b1ffa1db0711bfef16495edebb25289ec88a59bff79a788415352bc0a228ab16e89f0e97930a30df0113d5c811b99a3735dccdfc6ec44a240c0f04094d73c9b909232973c57d79d506fffbd2321011ecd35356db7f156759b36fa6da3b9b3eed4c7bcce5dcd3a2b74335e187c7decd494e642c7c694212c3e614869012199a07a68a2cbd465e0c72525c51361b7c363e904293e6ca48ae97cd99ba3a4bb6be6621d15cece7d7629dff2f14addb5d7aefe1427f79be291534c511210687373f057541352cae2357d89ec9"},
+    {"0000000000000000000000000000000000000000000000000000000000000523", "004168265f6724295a44579ca27b6c528e3a98af860998cb3367d28ebfee57a3367eccf8d5fa8c53a3c6015674e373d14515fe0df45a0656f9f98b539a64105729aae40ea242c17775257ba1ffb4fa7553796efc07b72edef6587bf3af64618f0b96536e37cbf4eb4c0b9913ba758aa3ba6422354af459f1fda3fb77c8a02ba7fe152b0ea337263eb3b89f37439e088874c2244c80bc754a1daa8d6639376052e52b7de6081b552c023163975b6c2515dd1b918556b17ae06f5adf229c4c40e28071167c8587236693eef6ad11a5d16e84ea0d43ea06d9085693301070d6f97229e51d5d79716b126ee2b3fb178eebf00f3307cd5483853ebedd47a309a973e2a5c9a5d2a06ef52045dc881e9f311a76a02dc62e2e5e98aa58cc7ae31899e95a9b66059d82af0a60db6b59cefcd2dc608155052fb1028cb07e519e0e0ee7fb7a17598143ddc14a284819d063f02c0c73004a26915121512fa7b521e7ce6e5ae0e2bcecf9b014bb612e86865810418f827ba7cd37696de574d81e181e8c7e4b496c1afa00044d41585d36f8577c0c782949ab8337600bd5adb206df334c37abdbd3df6afe033d78523fc54f4cc0d3f6d73e71bb89e0e93eceea3db5038ede9b0f19fb54d5b9c57a13b222c39fc332035216dea869342186a3210366f544fae32cb7d692322abbd0f61f4c05f7dd756633ece61e609096d81302cbed3212d45309433ad383d538e879e3b84fe5181085b1232dcfd131e36c2367475c3b6cdf415aca2623f2d51a359b49ff8626649e0bee716f07b4fb43b838cf1e701a240d93ca51b390c672d7b531f2500c3b0ff19ba1da58103ddfdbc48e93bf9a3573683154602309f4efa99af5b50b5413eb71feb8fdd9b5f7a86115cf3ae28b0d3a1acce2445e98290e73eb803fe7ae25091fd8188fd94eefc7972fc3f2b6efd1943f998b01dc789c2d8bb47ded7b6602f24f0932df443c82bc59c1fb7fc858893505f6275b35bb08ce46cedc80231b76653c6b12133dd05312c626abeebd3933d8a66d31fdaec9bdaa5a91d8a2593189ef0aab5ad77c64440a29ddc91513119f71a3c4dce2d80c91ec735567470d22b3abef0574031e375205d5d20f5985bc9056900d4c7ae608cd227331b8c1f98fafa56d2a2efc267c16e9e2ac43adcd0bdd29467458615dbe18dfb7f1310876ae1ccd920dd0a39af49e0ecd9ad987703e68f76557eb5386e3cd612172f83d29502422b07e7e34aa0a7e5185772908b1991fe34b5b3391ddd6fed1c598147728e2284abb67ce9843d3eaa7973d02cdcf9479171f25976cad1127bafa6300412ffef955cfb4c666196f9dd2d8adc0edcab4a2e8fac618f4ccf79269d920171d4b4927ff9b8ebad2a13d17393261b27dbf462e98fac5bcec4a2fe7f9e9265cd33bce666b5cf904057ae50c6010d868d04afa2de3d2bbf6b7c9578e7c1bf7f533f7c78785ca75e636ed7cfd6df4e43070ad06d306fac607f26be51aa1a7d6ee01a5803fb993560b0e59e662dc3703c572474db1d2f35a0008d58231077e174e8a43331e56ab8392474450debf40fd2f482cda4b8bc02139670e5ad36b68c01b1548f6b2ef761ba5c17e0d6fbc33a78e21c812d7d43aea1c58524229d07d432ff6a175f0e3942d8cd767b14884f8483106f73b0355957b8f17da083600c8b2e2bb601762093df302150191b001ce37a47e87dca8faed9017ecc4101d210e30d338ccefd29102e0699e16148dbd4da828ff65882b67628949945602c3ba365a04345df1620e4ef19cc4a4a9474cf31135f2246f958cd3582bf064bb65b3f75c18719643f877d0cb050692157807e01bb7c69f72989ffb784016bdb4e134d2246bf5aef823e977a7e7586be1348316cae7fa96931e4fdb8917"},
+    {"0000000000000000000000000000000000000000000000000000000000000edf", "00488b0b4f619277300cb0166cc02f908c9b55623f27b94bf9a7d3858dc6f108d6e154fc9e7fe35a0c6418d78747511d324962d6c88686e6ff57a9729da7f92bf0ccbee86c7b959ee3a2fd629f1a454ecd6a972b06634ca69406ebefa6e5f2d66ed06de903b43ba6de336d99b7d6f19531ac58e6ce713fe421b4c9f8813f077dca472b696191dc19b3c914b7fb411185d379c73c812caf33b4a215da7cc64186792d064fe7fe3ff300f1e10c05407a2f4f8d31556a0ee5b9ca00bfc1cf0265c8ad4a0eee3bdc11f1871ee266574d42ddbdcb36a1735877681333830e0591cad79e63505b9d44075a4cac4831b9e78bd5e9c941f2d5179706c2defd9804ea694f6dca8bff7aedf3a66636e35f63c29e798920abfe43cc97bff2ec831356007689d0d8ff1c0273139f4c5ccce52d35e2d6e47798da9b0a036fb411fb17133e2ee01e2243acd043a541c45ab8f3e6d5a68d016cb925830e974d845021cdc44fabf65e73d814a8064d0cac336066fbeb10c33527597e8165408c14b401d63a56bf44dae4ef9041b01b5362b657a27fe0c60f3ce7a9edc83be8ba73c64711e38e4e9413f56f110abe62eff5d71c73d43ab24ff7fddb4e6566d6f22011b3f50c43d37e66dc71e2a63af67bf55e74bb9f2719cd4efc724aea43cfd5c478eb506a993bf5f07dc9248ba9e1c195b4f8b31bf4436c3e3ef1a31c7389ba06dd6cbddc8f275c7e8aa890e25e62562517f9259a25390accdd6ee4779852067c64d85ace462ede0c2311ed00fe9bcc0860633e646f7fd4af0b55cfbaca74313f3611665b078f3ac7e60982b989b5d9059ff87f06ee0868b6d729031ddf8818dc478632cbac9fb5782a0184198693255311d81458bc35f6c27006fddfd40cb01939d8841c195c65a10d933746047e40af22100f808a2919d87be72d79e8ea225c78c6eb455a28c1007f9bc76397b8e6dfe0f23294746c3e868ffb6c1f05520b89d3c9e3f2c93919d57671e1f6987a959f6c18db53a1ef8c299795050301be4be6c99e2e7f278b33ce16eea8e11a73d85e359e206f22e56fb47b8d740d7f7af44a4593a3a407115e4dc772e590645cfd5219fb3ed68ca53d8db817864fbbe768dda7491f0a7b162e9a9bc2376171d79a61a0dead62b55540abfd2e2395219dbc4cbc1673a832a1c6e2043134ce3bd3e80342b347d60d834bc29d508e23e3d2ca9e4e362ef110c8d2eb89cfae83175752a64a78f28adaef5ff0aa0968ab5b3a291e0f535e7231739534c5536fb12004355817b95c52555d6e18a974205d6c2f1b93fd3f2507cadc11740877e54adb56251fee367a73c6195074106fa68374d501036abdd34d6031f4a57db72d4e8208453323152eec59f506332e46f8e8d54b5fbc720a0c3ed353e30e4933f3ef685480652b668013d8cb4a05238b2335ec1e11627722050ff2e671815e336e52146413b053e71d19588462bc4e97e6f5f44fd6420607a2823e336ef909da59d22d27f79c36a38df7ce0545d5a73ad1947d390a97b5576f6070561753b3e2df0aa1dcb574c55e2b8ed3e0e0e4ec3e79a77cfc91f82efaaccafb4d146be56984d38d67a209868d30cf120b24cf04c555c7479605b7f6d5eb1cab346b3b3b0c40a472320b97d3392647e59cc4de3612cd63983b22095a57049a629443254c71207e53fc09653f31b8f40e635cef17cfb64b37b0d22c4441ea7593d615a465142592e6344bef7b1186a1ebe6373ec1a0819986eb18cfb49533e1bf3fda4f247f8eb153d7cfbd1ee98610315eaa2d054b4ebea05350e2fe6b7541429a45b432c10e07b86e117b86f4e3f7251fed4204d71073b135725e0f4f917103ddcaf463e9ca0f3d1eec999f3d62f9e4d0ee5e5b0763ed070cdf66b62ab787bfb9b4"},
+    {"0000000000000000000000000000000000000000000000000000000000000277", "001009413583c088bcaa3416517245a52315ba878e06f0ac9f23209e3d6c6114de7167a0fd558e2b2fc30d1f9974936cd4a79611549ef47263aab79e79efbd114108f2480e2f49271e314b8318c3e8c531c8ca8d037fc79e8e192fcf4868b188056b556cee8d1a89e81ef76610ddd23670b53822f2662cef67a92e1dc428069273e57f255d1faba2e34aa7fef325932815e5b208998339bbc7eabdd46be6fe9ed3b686837078779b0064079cffcec933ce24a0504f5ebc386c1f4f79430a6b2eca04ca56e6b268a4104e625c57e177bf25020dd82f6099ed6295955a551930ab8283d83ddf15761b3221ee9bff35affbf7c91dffccc1070ee53d8b83055d015549d3f3bd5571218399cdad014b85522c360774ab93b4465012a67391afe23026cebde5d798e7059edbf1fa052111a147a4eb2a2e3519505db73a4735d66730b71a5237e5a647e1d8d65923ae8d1d9db500f9c3025e976a41d09bd063e4a7e6f2d9289ddfb20e53f76ec3636963e62d02130eb4cbe0cdedfad47c057c6628c70a497c6374e3d10ee9da7681475ff77c0b0b70711f0c34fd56bdf151c115599cc83ab7c0b619300542305ae2cb854113370f30883348e71acad34ce31fcddc5c4e87a139594303ce1d5ac4273956d01b300184661c34bb073ab1bb75a94f6cea7c12a2081f920730495a204b98df3356b9cf35cd119675700d0b22d88bf2231fa1fb8102bffe78a7e1a9e173662e2a9d8a3985d9ac7373b4d58795c6dd6e89c69d95361286a716d16362d1e66b247c7f727785a40bd31a6528afb58236e33acfd926e4bb29346aaa0b2dbbc39a0f7732e5fdaea8fd8823558674d1e105994177c9cd17d6cad34388a8e54b7c72aca8681ea91ad5f2bd2d17507522c85205acc62fa6d420eea247d70c1f526148e3b254d8d893c0e8fca7d2def9b6c2b23a595ebd005869313db0bef7d2de64f7907c2bd229889c4bf82058fb8fd70cd22360f78495767d021294b17ed71004b74ce8b2569b2f7dea90ffe32d78c6f2359de773248791d6dc11f0ab74dea8de254e4dca567c586432046cb52c5adbe161bdfca5a54361fe7225485a501b04a96d44060c622689b6245ddec72bc928efb9fd7a07e17ec9fd449c8dc1dcf1ed47bb29ace90ecbd674196b5c604a08f9eadbebb1dce3f0ef2f53f81bee0b04f905b870ddee750fb5b1555aeec5d96f647e075164345b3425dc3fb71bd87848876cd112de03f8695f366dc9def11c397d757de4d4af4bc72dd5bd5b7dd13fe35eb024117dc2f45de4f7a0dc3d56035ada057a08081c0ddc0fddc7a3a0b1fbdbb19010a0863821950dbb45aabd484d0d296db26684ee83bdf8505ab9601fee65f2a8d0a48ab9e4f22617253bc641171a75af71223ebd4b35739bad07678173c5056e216efd230c072eceecf248425b009d4612e0b243be092237aeb8626693212d26df2d9e760d1e4f7d430b5f645cdbe30b93c5bacb1033189ac6417616e7b22c6607722dbd31bd22190621aa0f5182137887ab06654a292bf62807aa49eb90c401b724fa83d37c73080d7170d704731391b7723aca3b1ff6fe85229547b15d58caac6b2b29aa03fb3110891b4235c52c6fc4dc23047d7f73e5392293d41d5b8a7d452c986400fff66afbfd5d691907e5c42176139faae70cc7cee748348b12c39bdb234fe10f6b2eaed9eff6224765b3ddec2a9a6db74a4a0c1b0aab73c34f6358c77906fc5137b37fb47cf232257553c4a9fd2bf3f3fc54159e72e7e14abfd29b800a8ba97f615a8757eb5ab8c155fe765b2e493c8d44624c94cb5befd2bfed4ab80e94d6a3f261ce15fb722fd51308e76f3151981c867a35fc979efd461ab0a93135c5d6d4a4abc78d3ce662dc3c49d29d92f8ce7b"},
+    {"000000000000000000000000000000000000000000000000000000000000005f", "0033d78f74a4f55bc463d88cbc522f1a448397fbb2076e970b36e21c179d0803777d6378722197560aeb161b24bb8a5bfb23d220d2d32cea32d8f831dd5afc369ef6121eaaf19187e57551e846ef1753e6bb450e01713ac33a173f039dd6b27d1f2152dd54cf31c4c02393f554cc0cc2c9a40fb28d8972b893e8cd5f9c9b1d5d269e272450a36ebc25b6375c61460bdcb30300622975ea93d88eff6b4187322cca4d2dfb8737fa060277bbe5da53a6938252a031f8c9a688cdb234527e160acc1df38d62e12321a58cf9fdad1366db9c2ec20a81fa7338d2a049397591f15eab8f5ab1673e6c5613b41cb4af235857eeecb7020cc549ce667a99e8060c223497ea987dafcf2518894fe9fb1e70723a32e41c1a8546365adfc7038b724acfa3360ea6fb7be82e12c1cd23d9d23e991094a1569f4b18fca7ab3738242097a3f1cd5609d9ba4805b33f3e142a2bb2735547008d821b7361c7ab1ca36065dddf998222f51cfc8a32f1a9a3e712c814ec42e51501dae7d1cbd332592501f9e74481d90c09cc82f5644faca52f67eede10be04cf570081676281d144610935d900365613d3c0dc037529deb384de07e05f046e163db462be87df18242f3c72791ceff7efb74d355bcdd9ce2ddd9978a31508f2db0a227662b3db55f959044d3c7fd9d37f30122aed87b3f1530505572c0437665c710a4cf17419cd019bc7e486a549c7494950683d473da302621afb110a87885f4fc707d17466218379fce88cab577c826b11d30d7e4e2e168df484e38bd4e160c4f4ecd648b03e3dfda8d9704c9fc46164c8d1c48e369f1079d5480cf9a6f5a9c9967a95692295686bc7d75040fdc9e21d6da5861e8e18098038222fa048aaad8bc038604a105d4fd091688b63d5d14815c74ba45e86ebb8bd21402c02ea84a260672d3b25f17fd245b61a76d27e7d0109e6a31583ebb07c7de4185458a31290c7549d090ad63bf30447b98f06140188867ef7aa6d907e8c691207463d84a0abeb0a4d66595c5712bded921a935723aef5ec97544ccca41364dba24f86d1981239f5620c73506f841fea636046888f28f4c8ee588cf7733c1f972a75c15451efda62237e516790e54210bcb5ec170151f129d474232229c28d29637b1e2ae6b4f9c63548e399f0d160ef05bb63b0646b1c31c1c41592570197111d7685a019438b44aef7e74cc5a71bd497a51568ddf9ebc860518364a20697c20a8cb92ccf65c61a6a0a64ea2b3f03c967821fb338828f90c15cdd0b256a69f65d1791a1b33544ee6ac1812d9c17709e06111794ae81061732d10ed562a4d9f55b5e7cfc79182b59ade138cc273149d809f057f5960b50e11f64121334f97ee1536a65fb2a0828e05be03eba8ed5daa53dc5ee9e8d29c655fcbfc61cae4b233a0f2e12a1f2024380490b645fa59ee390532244e745ce27fde712145c78a34957208d5923d78f464ae04e12d973833a22cdeb9aa14d1cdaf1ec84c75ff89a214bab7d7b4e423fefc16c31165fe7291695e2b5188f08379e9d4f036d638d975c4de3df4ba1b3b68f7a22dae477b7f151688fda6a663525b55428eb07c8b93e507c14bdcc03f7a861d9e06935387430f93d0a5fcdd1b7758d0f0c6db4d0f9106e2dc3fc526f704cc1dd2d5fdf19ab06e9dc980718f423a3879169c2a127fc840314a3db10ebb27567b45cc5c3eff71c555bcf96137d1979851634028b07faa467fdaa037c672e2152ad41fecabf2f0d1e0a9ad74ea724077689aff65c6f1c0a5bd9261021f3514ba21901e1412296149b5d68e6dbf059c01cc712aac5b3fa4daabd62be2a5304ccf03eea9985128f6b92abdbbecf264aa1b5e966de66fe929e850b254ada6f24906bcff882b2e062ef4f960df2dbb972"},
+    {"0000000000000000000000000000000000000000000000000000000000000812", "00461f6d26517c89507da33b4d5233f4e64cf24abd0bf549b88ae7d1f1a24e23fd4ffdce425e699d700e10c4d14adc10dd0aa9c8f6f1736e82a62fc79a6f7314405130ca09c99b6dd0715aec486eaceddada5d51035e0515cc98d02b5facec879669d58b39e8bff7043b7917b481aa9313687316225a435bf59d9df137e40b409c811a5ee3af1b6ca1bc768e810eb6ea7e065b0c2dd69c3e9e5af1cde05729a0dc926610c7bffba9058c5080dc41e3a96d332458a7df9692d1373fc39e22e9493c56d802e0cc53435df47f72c1d88e1dea6e0f5e7b47a78a836d6c8030fca4ff37453557d5e6585236ff446de08f55d261f5dd1dca4bd74baddd658210ecbe570f0620de63842800d6df1f024155bb8ca81c0ef651c4e0039562ab22a8184cf05bb5a19e679b13a03fd888338433b305d3424fee2831fa1d925cb124692dab735d60a386e04511425e66ea54a39a650602ce093d660c0fbc6359e145b17f5d09713fba6f5c1c4b01639a5eb84139ae98637e4379e667c4d43817058dbd75774ae2ec5ee411cc4bf89df5727b79f3221df0d28c51944521dd68a38e245b5e6e76799f29df03950e741758cd99185711c31d1c8ea08a59e7c39c214044ac45f80ab9f9483224539d4aeab8697c5baf07b389e70048755a7ff0239da15df5970cbbfb80041c6f0931348d74bb60b4743f4c6eda86841e35c3a903e03e858d8a5dad9854d06deefef218abc058fe6e871ca6474564baf13563e9f22afcfb234e1d1b54a835bc9c61faab63f9c9b52579cb49f27e5bc9f41cc8376ebb1704cf2ac7611aa6edac55b2c9fe2e352d3606af7328154e52958a05b08a847135709df80fdcfe092814269696290983e12413da29ff264bfad2a5b30efafdbadd474511ca17548d032e26baa0a1bb42e53f5a6d06b4eb8a616ed3b5fb12f56605b83ed8ac8000f43a62790668d4b88599c5587878d6c9853b394a06d04d7c4c93764b24b784fe79feb8f1c1c40e8cfd0eec8571f0281e73c7842385a14d0645e64cf299e5112ec27a5d52eaa6dc0f9209d62830688f1afa7b180ab30b2189d3171f52c280fd1dc6322d6c7a936a9021cfc79ab90b8dbdba611410ef3b6d62f6b3dfb0c61a25ac3dadd70ac110df231a4bda28f685bf9940e549c1fb22a9df0047c6c4a841e866bf5add5ebf845e01caa70da561fa0d90925072596f578c83b0bd03e61c5b834020b039a9f7afb4b0195181653a78af718b0d1b59321d0a881270c267a321e16fde9c93fc7c01357b92c0cc5651e53d0f84566c4cc279f8367b2fb504958ee48baa1f497455540a747d5b258025b727791de93f6eece7b7573f9f8555d5478bbdb1436db2af055ce467e9d30037923960c79547acac3a4aba750c0e56830442d9081b1948e2d1b32dc74dc36a91c0b802fdd60b49c7f9af5c8112d92ef8902a9370180fe74d9fde4369e6badf89a095710d3daa622266b49843062c6068799d772f13e9a0f9b11cd9295ad654f09e1eee7a2f8ce9b75fa11af2e002e037e27c2f7e7ce0048242893c4d5f8d571ba67f253d62723d853ab63b0e505f103adde1076e403387f4abb52e2c92f87edb13daa1201988e8bcb0c441cbfcc7b4cdee87911f631d5e4c2c264b00dceeebd7cca1d965f2e6c17ec8e71528929bb30de3d942ec39542de423a283853f5a8b18add1fa4e0d2fe1b697b8aa20663f0f32a3dc45be1d3fa3a2228e1017178285df87616e060a69da20882ee4ad8c309d57951f35844b7ee6169940780f3f5f26fab710dc1b14030c9462ca2fd63791dd18dc1dbb4ef26b746416fb9dd8661845dcd0282e214b53fa7542f7b578f4762db1d16904d8dc7233617d4fabedca793a5fbefa1e52592a6d0c9c2deb7d3b73c7fd4316"},
+    {"0000000000000000000000000000000000000000000000000000000000001b3b", "0047b17bb0414d1b5deb37f1d7c162fb0a44bf642e1eebfe8f9447d513a49197c13c4b35b2a1b3ded96f0565b735a308200fbedb20f16bfc3b72327754255a1880e4b70806aecdac9bb23da53d357a3612fc5ed32b609bdbc8552d64fd768468053be91ef5751ae19057873ac0469eaa6d729e459cd2c72a41d5f7dcb285373dddce26de92d1624a3467ccf5ee12c6ab1e94859e211feaf42b1be3c5e929f5edddf8773062df2ec306f9ee51936cfac7a07bb15d006a9fb1b78a7872ba632eed756426bc8bdb423779bbd4e53efb871840bd249a4d2580a463c9c9d9b39f68c236d655157409b4331b74e8ff1f559503131388456995e51221fd90c91f1706888c087b3f0aeee583ddb88d22c5f8bcffc61fe5053ee94f721769a318878c7e9efe256555908129fd53afa325ce9def2172ab1073b0c5a27cb91c6c34451522dd95069ba04fc8237e57109e63bdf715b7019834156af0a303a6dce23e2be6814d49d877344e1ecf34878caf2ce3999354b783e5a506e2d65dbf3a0542b5c33268de85ed71e08fa0ee9e316741da64184a7bc7e9ebb32bb7c26c2b3bd5ef266ad104d79abd0448e450ef8703588eb770a3af1722cc98b651aaa828cf57e52b551beb727453cfdd2b0fdddd4233d22918be4faa53471c79aa21d1ca893eccbf487e9e67bb5b3715d90febfd6b8596892f627dc84f5e4d1d86820348445fa59f61bbb55cc415d13bc8f9f259f005b6037d62b6eeb09e01aac4f25fd5c2380a174b1fff08258acc90660b4fbaea7815d193433521e5207df95e2d23797b5a10c5774ae5834ac9f0a2153dcd6e8af605d715586302c42d4e2d03c08664c73540ac8dd6ce31d7ea8b22d8267b7b96079621f940a63eddfe44f5330977e55b51db4e9acc64fbc6b78cb7072d1db0794b91e2b4abdebff38ea60900bbd7a65795ecbed13d047516b81914d649c7d1b545c5fe7195d9a6f84c4e53c62fc44b3b056be8b7867df9538a21e6ae1576381930db774f763fefe27725e68238960196bf70c98165399e8b692b802bdd75279f12d3533b3dd43cb0b50f530175e32635b7c114e5950163036e1dad1dfe871a52b3a740d2cdd5b09f356eb4defd9ae4c218f94126eb25e4b1519f654581f4bc75fb704991e55d796438c71697d9e6aadd7ded4964ba6bbdcf6f1d7ee46b0b559beaca914b71501cc502617258eef0eb7cb99e49362612dc9a5853d12b549ad0d39a953c9638485115cdb1e42f1f908f16d6751af9518b21aa9814a15b16eb2d77cf998972eefbd46e187bfae67da95646080c7b02c32443e44a8f662610d0ee839265e557ce0017646bf075485bbcc43c61f7260fcd3f39d61cdceb2496d5b3399726faf72063f6a767f5e5cfc43f366826003cf34f73ba939e48d40c56479431c2fb9289f806d9aa83ba42df6a7c54a5b1cdeb2b166d6c5eb66a19064351a3edc0c98d8a5449c5c8162d9d6af470db18ad6923010e03ada185733d0c37fb3d0f72f2f4b440b5df33356948eda247ca88bd7cb372aeb7febe5e115c6dffee1adedeecf4344c98c726bd5dfe6c603135a27c0f1ce1d197cf3f637ef3258ac0ff434f0b25203b4aeb879c3d4bf7a053deaee3d414f7fbf4c5804ee82bf20ba4fbdfe5d5f521c7e17819ef057dd90a09ad6bc93151687dd5bba87cc9f39c4ed323bc9941144b8e7ebdd058435f8c41cdcc772f08e4ab0b76aa1c87f412ab4f90c5f7f142e4cd77a4713b217accbb2936633bba682a9949b464f58cd531e693d5bd4cc90d05494744ee8e9f90ee376c9ad6e865de6dbbd0a315b7862d594c956d6b2302137ea90226d098179644303aa742e52ee233883da52260cfca3ab38519480f3af93f220016ff91fbdaa544d0fa037b0362de3d28"},
+    {"0000000000000000000000000000000000000000000000000000000000002324", "01aff257a2dc9edd0a0d746c6a6cef718c99b8369c06a3bec78c4214f38b4180bc582d01c337605b00581b1985dcfc5b9937405c6254504cc7b931c7de64d42139418b928b87c47c1cd6f4ba4eb3f7529f3d065c105694b36a865841ead3214063678b82dd3c9965f02c72757a10d55e32ea0c356ceb3daf660eb7f3af4d162c9df4ec78ac63c64d81b4e576120b7dadffa6c31dce3592f6edb9fbe1b2d340aba9532cd4cf66b6b0030b20bd12417aac6c0bd1442f1192a8f439d7ad2043afefc125e9f5dda794290145fff626f55d5942262417aee79f22d0fbd911a2cfde7f462108ea90cd6844a3f497cfd40f48a85e7493037ed0c9bb962f2f510389f68a139fb52165eb21e780290235c9dbbbb74e15c13639eb0bb488d8e39a637c63c1eec6d55db60503cac2ed44e15945cf85636027ac1b665162b853dd06810f95ba4fc34bab6a613027d9e505496978245502d59463be442ce3602ba4e1a2ebe2f1c06bbe82a51b2789a259077f0042d694cf66dd92c9e78bb60a5c033889716d09a1871be142c3f1b8d6824696740a12107bc55959d97ce171b243d4885e65a77c63dc95e90a6a150a77dd9f3fe04020e07db6b5f1ce78bdb4e3122d71095cd127ff9c18a2a0497990d153316ad26a1e4a7d2075cc8dbb57d1159103d4fa62642e37c65e200c5f2d2763d601fa00023b4153a4874e21fad80302e0523050aea40d9a396102f2f5726aa6bcf9f02a0ac599579f48552dbeaa00e01607bf0e4f7cd7341617cb8d857346c35051abca6703f4010eb4685b47d01949a2256c597e22ebefb2c6db7f0ecd98e31c1ed00cd93a3ede88e102af36a0e18f10d17913085f848d554a6ca5a798bf3b2a1256ae6d5accae8a16b9260e150d9c5b2d2e35efaeb74773aaf1f81a81275cd9c01a13cc7c888af68edf9e54a0e74ff67d4b29d29c5702277fe6605ab4c306f35a76485c1ed2b85c3fd3bb08d31271ed550d49bf2bc21414e11a790cd0b886c909fef20a016b3f53d29b549e852c4f91fb57584e1a0d1051fc1a3694dff82510df42c024acea9650123f033e2d23d380f525116f55d945e22f19e56c3773b953b6fdc0f19cd86bdfcd47990b4ac7ea01bbb4124c2144aa39a95f4b6b19cca33752fad7aa08465ae3732845bf911e2954335503928c539a70f112e779967b02794a8bd19378e6f7a327556e76badedfdeb7e4212016fe5c08287a3fd89ad75117e3eb6df4f9b158c01b8f1f710ec6e8b7e93477a3b17515fa93dc9f450c1fbcea3e71da4908d4b5b5a5bf50b3465a78f971a11a987e5ddf92bce776742ce77b7deb9f60d97eb455566b9efc95ec580bfb7286c80b57c6ee956c78ddaf209f03c82f141a23361fe3ea8467652607fbbf435b46e4eef200a60e8b5224f60a485f4266ed16fe9e3e02daf37beca9eb476615b111237491fc56b17d9b5e0fb7992184ccfea8c04114c47cd66161c9a32ec850031e3a0bd084a81edd9fb22bcd23b8e165235cc43608ddad66978f4d19224ca6576957e596ed4d3f1f900915f9c276cec19eebdcf0cc7d42a0dcca2aa77c5829a9e7519bcfe1fef935a7ae6651ecda22a99e28621494cc4c70e5304d5a43c69c8a726f5e177db89690289196c6c3972fdb7320133b61dc6c3e24d05b4dfc0ba5132cc845ce03e93c42d4b49eace225d93464be0dd4e6536ed960f0d51a22a1bf7411b1d596385ef1580b574ff85c8a03aff086b11c4dfe2b327e3c6c355a4432e984e04229a74259d762fd908e82d197c1ae0fdf6166091bc2daf975d2a06bd9b8b92796db62954dfabde727d6bea1dea6187f3252b776d6f6fc113c265d61e0c359c0f3e1a45674c2fca8be9788b99a2335c6ce28aa956ddd1ff65d8ee6f036e78cc59e08f9"},
+    {"0000000000000000000000000000000000000000000000000000000000000c80", "0124356ce1406f4b224e830c4b225b4539d479a139184889247b32ae75cb822872cfe75c93b51b1e3e28025357091b4b5f3f967fd3817cdb21a28185bcc0a60ad084ccc7af8eb39287a3efd248449ed5fe5d18b5040918ccf912fd29686511aeb5312af1bd90b18ff30f0eac4cecf23c77b299e0f64b28bf34dfb51158a609d15576c2d7a334cca305f665f942ce05afbf3f504ac0432c265d8671cd07f66ae251b5370f177977f604217ca683120afbfd6432ef19c40abce094133eb11bee6a3a67da754b7bd5a71635cd63b78ec19e2c0b059c2dc65709dabbaee5363b96fe4975a8e959ddb5111ba130ad37e4a9ce1f1699356a88fe8861ddaf04061a5603d9a16d233a8a551f1fbd368626a51cb09219035d0f5d133c1f9adc872220f8779dfe0376979315b6df1e608daf13a996943f8d730495158ed1d35a33a4425d8825fe9ff416e57cbab4f8e1631bb7a0080171bac7006a3799ca54828124e826dea07dfb40561d29fbb56eef47a9b7ad21d2c8f98331767038f6e5114d61a872db9d8b97ba2245a820ede98e1d16e4eb17e2fe1c9f0b553102f6e28cd24cb4291ec1d463d60917d2afa80f530d589a090ec36e004eca319aaece4dee27917e6ae8d983e145708de41481ca3073f0ca0f85e50b56ce9ed5068df200c27aeba2219593ef3f2915228b97e0a3eb279063479a56796af15cfd40d504f755add18b94cef8bb85040532a06d8dafafb71722685cf728615c0f2c0d46e60fe0bb05e3def7b5402a826fce02a40e9123de063870b4fc1377749d762e58cb1d77d95d617bc62b18980afe00de4353394b5c05b816754e062467a8b988bf8365dda63c87d4f07015787b407d4d3ca16d04e194b399ae019c78b635f826ca4466f6d3333afe6bd43d7233f87e6b4f5adcfa399855c02b91230e908303ca974c7c3fc38bbf645f0142f682af1f1a85c86e532dfd4b2fc4f3281b5512567103e96d9c79a0ff65b8df8b4bc7d29db95a97840819d4c94470d1dbc23f4c16e17a3c7b7404ff1ffa140f5a70dc097100b364d4365974528e7786ff63ff0afb65ec9a4f861284bcaa1adcf28c170c1e1bd924197afd20646b778583cbd2e132e96cd5cf00dd77da11ab33bd9f0736d9533474dd54d4c445605653b4db15e284228d9d2cc7b163653363e5a4057649f0f4f90c24ed10f1577cafc5c461ee4b114e25747976547424f3b9de811b3b77e6a392dc47647eb28218f5d20b0e103a0406dec78beb99f1b31d3d968e6766fe0510664886ea465e9d315f6b56c643cec672269a747db80c6368c28b134571399210f7d6de1069e23030a6e71149fbfd7cad846bb3ebd59979c9c39ed93fba839d1fac33fbdc4cb158c43b2853656e532a27469ef8fe41b27d66ce12adba9790d6b99fd0aa99fd61f3b5f80208f1a416f97cadd0a131074c5302146e57da0b350ab876b23df447fbaa38e4133ab29ca353935e871d083c1d1374237a65ee442165fb7575a16b687933c122a2738eef60d6bb7af8a3517b74288cf6c231b517038dad7c4d1072a6851f1398e0e9f12911493c67cf193359d6339f2ebb1b41b84e9fdd848a6170d8577a0b34db7ae5891e9103e790daa3d38acd0d80567e481245d892dfc51911acea791218e76bea7ad3bd5fd5058e60564c56e5ab44fcf4936ac0b37dc8412fcd3d21ac5a7d5d6374894193731e77a8219e9fae1f73370b5c07deb9c4234a7bf57549437cf3a1b0bd11c93516b1a39901505dbcab1beb9d7bede18bb6489dd9b90713d9bf66eeffbfe858a564555c194a0fdfdea8501dd95368a61e9a5f0efcc5347a58867e572dde64650e306446696b7b5df91a045adfd0d6167ed719576264c5be90f22714394bb997a316d0217b110c5b8077"},
+    {"0000000000000000000000000000000000000000000000000000000000000625", "0027c7641442df2e7fa446c786bbf9e9eebcf5bda1342fb6c134955cb79f96035a0b45f7959e318ea0ea0721698467e53db73d4c50f25f643cd8595d37f7e20aca2776b6af0d5fcefca4815ff5e6dd3c4bcf765d00f0b220c2ee0047a43933e37dc8f6e677de5d251533d9feac5fce4eb3f261635b4c4a2425448870c30811766eb6b84684aaa86c845b32e824d1976a1a6cc4117cdec323e74ae9bd7867899273f2ef280a1cf81000fa80bda0e412f3bfefb25628a39c716ff7f12f61017bb7b9151e71839d6ae131c3e0feb9a1425f22fa19c71f06e996ae9f29ee033308c0b4c98a14303a8f2a4ce1872b9bcf3bee3d747390e4b64b1817fd45730e6fd151d74f2da3d992a59b0f34978ed435faff7e0fcc20d9a0681acda9f861e7c9947e58b6245ee2ac1affe932e8d5d4031d7ac8b78bd8ae1261239b382424e889c62dea95ed9bde99f5eff834dea5145e42b20201553a2097343b0559a6d920d3ea422e1c3b4fc11860a23ab5939c0183456261e6589bfaf47b5e312404047db844c96dcc4dd483844dedfa86536ed348880e9f8969f09e1bb1468124c22941d429dcaa95708e1ae54635c05b9fd0f6d3a218c8e28320ee481bbb161bfc1e81da29ca9f5adae67567d7042a548edbb82b22031a2ee809dfbabc8d14b36ade83460475bae7434a1ffd8bef15ac08ea35050245e5b5e64257f961e907d3d3aeb326882bad22314915f8bb7cf63829a06c0e6de8fb5f46287117909241554413aab686ff0f87125ebb91db0678d684f4e4b722e41ae1cdddbd197128940eb940d7a9a2e3af04d373cf0f01416dada9440d0a29ead657d0af21fb9588702f39c19febaeaec30d65abf1f21bc159adb762c8253803534d53bf4a1a21a8867158a061c5f6f206aab6c1a511ef055d43b7266f6b316fdbc105836414ba3a56dc0174a05716d20057f15ee3907c494db1c2304327b6589760aa9e8d735b259d86dd8b81999677ce947c5ede727dd9374a00921f76d87bdcd3fff578a02fde6a9fa02d3e081a054143229904a815d5a546f8c856b665dfb059372908c5c71f11301653a660b4218d35a18de4ca1ea1b612d46eeb819be50fcafc948a19aa52eaaee0dab7940fa240c350d99665d5a4a8402ed30e4a2687f512ff65755f8c1ca56c3b8b443a7cf1e7b1ffad671e1e170da5d455afdb4bfbf7b73375867074af081c7da6802d0cf1f1bce335536ce15641c44fbd5d96a30ff5fe1a0c76f7afed3e2db25c35953a553426ef62b7a0359e611db334f3b6efb8eb6b1e26f5832708ff5f6c901612926202d1af5ac95a3340d3a2fbaf30179b9fd121000787318e9b6df5c055db8f7028c1ac308f20731aee7b4943186cbec5d6d5e0e3710f1da076fbda753a0bf22c336741a170ccf3f7594d05117c603a91330173f143bf0123851aff70aa6cc297f9cb96da4e230c7f4c71d1d21507e671959672ed5bd322b5bfe5a50be58c96f294654d7c78e5ac3c7ae122877d5688cd0d364085faab9c7f608d41c5c1fe5c64f9167aaaf303cfa7f30d1d1897cd1a6147adb5afd13e33b472f21d472346110f601db3cc52229a668f8664229fec2e1bd922407d504baac86121d5311aecc7943b5d11f3281fbaae71686197fb0f968443c994e72556dbf09603c1ea203d7841cde7616798f776ea4e51b599aeee08e721d97106f1566ea879072ccbcc4668c735c6c20a57ef45063a8c6be8d3d16653164939157eda32e220bd3f787027f6a19ed886b252d1e23a752bbaadb60d83474f445bad9d1659f640cb324b4f24cf3fd24f164c62c4fea830ddedce5226952a75e0e9b7ec68ef31e6eaa96da7db817d5edcef11e8cfa756e67e44954dae5aaf837992c1dd6856dcb7c25152454074dbf2"},
+    {"0000000000000000000000000000000000000000000000000000000000000217", "00497e2f54186131f9d932ca36aa90e171bc1f26bf3ac1db282010a527cb71c72fc3f5dd5e443bbc5c19136ffbd63b90f468bd55838c70bf98e2fa747ae92e1ab1a6f3cc89827ee1621c6671fa49972e257b05920cd22ebf4bc7579f49a4531ec77b73a16401f19fa819eb5fd8f3d32bf2de86a4266523f92dda26bb608620ca4f050a13602f6c3bd3275cc3530f56b31e14f32d4224b8e350f89310c71546c9b53519f540b3bf60056df6b33922e083a81213ba2c5121b51a5d3169a61edae13d48a1d33368366474b2aa58bd1e695e8f27064a326854d543ded2cc748a86fdbb02aa7e1e2a0c1d4a4382cf0afe129bae62d87ee6118e3a57b3f32a13bb7ab4f5d594c1c57061c13b0f6d8109e42f3d293c9f4f2d24fc512de33de8f1774a4832df29dabd3424b89f8f790ad5b6955912b3df3cfa398fd8eff5532c7cbba27ce3dc97bc62557ccb3887b60789f08da50832472d745651ad1ad768725e568082621f16664a1f48c3aa2ed0f2611787543d72a7f1258874ff35790a82f0d726628ac370f172992fe437aaf6ab78d430131879a8fd23ebb79b249257a86750fd6875b69783107a5335a017ae30c09b728bf4414f08fe6739cfca1e5b6f4373d5cac7ac077210814bed69c5e1b307b3443ec44e38939dab773278a283d066e69ba5fbbb255a28237735aa6e05792da6917d70b595abdf1243e60e863580ac1092b9f2b67341f4d4d0d79cf67d3b142dad3d974dd48471c481a5feebb570f2cf82bbea541006cfb5c34de3d7fbcb6229a7ed57153985de4e961cba255ec252aaeca6b383c2f9ba83022421d70e6017f456197e149910d07aea14bce14426a78cd7baa220b1b1c6ef60e5bb34e7a2ed82dc6968cbc2d824e91803dd5e89e40a87c2b4b94c71d7665385b0becafb21dcf36b060921dbad1fa274ee4b0a0fc2857ff813011e436e3f42f7ea6d1c52cf1eb778fef4837b7a433ffb4e738bb75f2bec3b7902e454251b70729be589167148f4cddd390f91c7c1e0d41de2c2ecc4f9e6052e79bc584b68632b5d46c318e2ebc495c9b9b30364033cdd204026fdbd5173f1fd3f12eec97f235a615f3e21e49b89e31abd1f2725582866aea19ae593fd0e1a98bb195d3b2f5bf0a3a860cde541db0a603f02301cafa7f79f4b7e2342a30244b1bdcf0a14945c44930268568e59ef41eda9d0e3d938d8bc81c164dcc3b00ba3438c9f845737127a661825f7debd9103f45b530ca5f61c701b3dcf5c76d281485fc71163f5ed5da81e2819f2b29297a7f69f5747f74c6efe0d53909294031deeeef18c0ed3c2d9c3fab7570332e90437d53c176983f51293ba994b5a73014c2485bddafd33b0f81307ca9c04c4f372db05720337dc23f5c428bf370a3a4f5dc6e2e8adbf7617c58464d038a9fb0bf7868b01dd1e947d429892c5a7c2ec585ddb04bcce4c11502b5ddc1f4a9c00af8163d4c4fe72288d6522d7e6cf161aa4e0ff4c76f75997638c4ab7687d67955ddbf14d9beb7e896e700beb5ef53d1f6e2ead8c717a60ff0847de075f0c3826a7383b149d6a3692cc365ed0e22e23a4150ad5305cc4aa56e080fe54e5dcdbffd2e51c9ffc56c89e18492b2a98f2f058bb723f1c52c78229a974f84c6534334508d895e2eb95468016bb5d060b56587df3efd927edd0072c8667f95afdadbc29b214888e73db9494a5733ea2672740861d72d1b681f611593ff28c851a13d6ffb1fff1ae4ab98d679d2e5e1ba80c0d5d5b2d0b2d9166ae9cdba0feb7ce5c2dca1079f8a1b79fcd89e31a12e2607763891552bf771d2f789a37cc52401d5cd4345314b8aeba499b5b16ea19865783c98e65a98840e57d3dbef8c5e15a5b17ec205acd22b153a4a3d0cbd3bacca73f767afb55a254"},
+    {"0000000000000000000000000000000000000000000000000000000000000642", "0009f24f53dadd7efd36306647234aaef8de5f56700a07e381b985953a9c15d2888de9bd59acc9bd723805a58657dd5318caea8cb389d272ee2137303bd79214a3ba1db8d4e1b3943fd3ea324e3214fbc18bf9f510c8498f341437f36969d3fc60f2d48e615edb7aad181771fca6aabc4162b252c391e2368eed2bdfecd23e591a679920539b6f13842d7ca45c31733c16e3c047cc932458b54f3fe88428ff19cad172dbb7fef64e05e9006e68519fd5b2d6c923cfcdce86f9aa9d4c7910c0ac80a29884550732e45ca6abf2b2c84f9b2c520a64fb281c5903a107ad02d200fcd266c066f9885635355bc1ca3031ad912144a702253e9971a6de405409c241df3084ec5e87e013add16659957783715fd9269eaee8d9cb3e7ea67ed2e1774fc9fad4ed7c61e31cc135253596378b38fb7973db67b7974acd3f3af4455a04a169a9fa657fb9b49913ee539e39cdd96d0a001efebd9e0b53795880912b44d99b1a129192c4aa0bea4f3138e885b3b5bfb0e6806211acb97818260506b4faf4eee691f96e3b54132dda18daad947d17fc17812ef193880d136c4941ae995001f95e3a3d98e80aa2bab339432bbca59831ebf9b42a6ec8b53a9f0710006fa9a41a48093353d4de1fc8675be0299f3eac1eb7c9cdbc59ba538fc34360ac3f61f302149d6dae6127ddfef1df07bfe32636733f45bb95a0da756a9c057afdfaa0eb071db1ebb07a0534b84cb399c5bc101f25ab1fcf4b90a9bc50524a7c52861218af1c4194161b61d8516660f3790ec1f8a05271913077b6b4572e9893fd6c0d1c7d65d294fec5ab2375f61531fc130d64a22147244447fb54b1e424ddeabe8d0977d05f243e5d1376996d33f1b3b5641e733a7722abbd8a721b255e253ae246cf7e3fe9a9a95ba75e9456d51acd1d1a1ebac4e58da3f9e582206639b19a0ca9769257020e21bbb8c92a88e66bc09ed6b5195c2bee63feab0f337acbcc7b297ff23e74ecd6edaeb5c406568dca13d436bd52d0cdf4c0c3f49ee3bb5c77109b9baee34212cd5e835999c765f4857906f63cda7d7dfdad78023554ef672142e1bc4eb6e23d74d789eb3e1dbfe50c664458b58ce06bd55eb4af0bf67d5d2f40f848a202d8a84c2af14ce9bec0a0c62ad902d5be3cd825791c727f0f8a8d0121555832e35d583b44f4944abc11025bb59817a8688bc5fbd26c14acd9d4ed573bee8d32554e15d1505272fd73677971d0f22e1a8a141db6064f9bbf9898fae935d9f23b0eb9fccae499fb1c1a09d50f6be5cdb2aea62ee174bc737f12291491acb0043598581aa78d8bf16410afd5f0332c56531083f32ce9399250598b6f17b179a446fafff2cefd77304904dd841693959c51381d9317a2dc5e862cbcb556de2c2f6b5246a1d27bb8844707f96f0cb6d75b9b8c3a02821cf857f45e6ba9f301e4d52d72b0bed0f4a42e07b9e58a129baa9fdc078952137c16df0f2abe6d6a160e52ea337297b1dd37025c31cb564a021d74bb621a9abb6b614b08cec410c44308d223a519d98a57d108c62eccd1c4f93c9d58f3b8fd22da82234af27ed21a926f1ff8b4323df3d882e88165e1994b2e3669490a2a314920d1e0a31883c478234a39f9f7ae39b74037fe9c5133145997515ba661336ca7bb8984bfff450434c03e9c6854fd8e5fa19ecbd9a8a6849cbb6515254f4df50cd20b9fab9cb39d24fbe44562374dfe1b1e5d1adf10b37b2fbfffb5681130cfa62f033889793b9edc0d0c668bc99384e51b11d149a1795f1c6fc90e81c5b9dda9c069b7277163f7184add1968f825b01dcd1b0eac090bd3796fe38c15ff1895a410fcf8f61ad6fc295aa44021b83d84dcf047d2f64816773e0621ea4bbfdeb04f97c986d56be2ff5bd315a5ff6358"},
+    {"0000000000000000000000000000000000000000000000000000000000000cbc", "002f39326974fc51d9ff50c71cd16570baf0ac5338199689bd654d577e96f4f6435c7b7c6b7b6b7d95a810e29437dcd0f66dcfbdd1148392eb95a839983803116b22d1ca8a7de7e0e335e0ace64fad927712ccea05667b86439a6a6f1648bb23a37bac837a9bff23b5290865c0749b2d60ed70b33e865e3bfa0a6570615d11e2d54bf78b90e900a551b329f2d12d8d2e1a927e3efefa451bab9153aac3a6fd2dc384e9ec9f3057c907cdd311d494ebacb005531cea193511a0e41859d60cc4166c95555b0177f157c620cbbfe5ffb7f48aa20e4f7afb7a6f45a1dea9d1b47b692e1ebb69dd4d4582f1a68531741cc1f2b159e3c56f437eb5863cedce10d8427073a6a3f5ef23e5db8c75dfa981e2d745471899ebbe8daa47c5be12459451d590068f6fd4d90f11b5f6b412884e5bc80d06a7ee68bdbb112c5dcdbd1582acbeb94b7f8fc15923ffd45917b61b9135f0d00185ba99e3b0fa89b16045536fb76bc1cdd313434e33f576ccf952a53de022048be9791ac55f5cb4b0c4169c1d0733da9ef1eebac5de197dfa0ba78b3dd7403d9d6d610ae5cd9769d1d5ff8bea94a5bc6d159eaf0a85a7226fe4c3cfcef09424bd4f02ae54789ecfae0feb047c96135ff7f17304a46e4c2b6e7b1a16d19b0fe347c6df1b97cde7c936a1d2cbba2b17a01eb2972389cd1665a49b8b8c0ec23fc1cc326d2d3a307d1006b1d0d20bb29f5da4eed3b5424f711754097d6fe308245b8c1923eb6de14c34203abf118938c9f3b4b50f1b695f7783d9a8fe9ac51b134aae1dc6433ca18c106964aced8792effb23186995546ae313fd7f6f39126cb2f02948a3967838e7756348b4422bc87a371c4b63a2f132d79f754d1de569a5e67c022a3d3a1d2d1400fedfc646a633b00a019d44a08a69ca31df87a316c018d17447d1da8e2e22d7d1d39b962ff89b6cd50252e667cb425de124a7c7e04373dd3a2961923bd30ee279150e57ddb1d162e5991e316c556ce0ef52d00da3ac2c50922ab1b88211827c6e4dfd4af1cf690a277dfedc7e5d32078665955f3ee7cdcdf0501355c40920385c2a5f63a98072e5f52cb3a862c8cddb202f35938e1dcb9dca119893aaaf0375b59fe4ab9f456d124c3626e74ca5f76b3d37b1e8c56b8291225d8252211014fd790d62e5e77cd2320365f772194538a24a05951e0cbf8eb54b93c7119b1a7330749b3adfe2b52323ce97aa14714bfb36f5112dd1c2758f248ed5260fa01f1ca6c9c705ffc73be1c77f5f9b1c233fcde01b63b9bc222285d51a30a613713c4786a9975b4a760ca2c88a8e6db4cdfbebe67c4e3fa7bf54f7fec4685747d48258a72b41b0bd75a05be43b85bd0f3f16b9290b0bada9bd11f9ebdc16ab22c6525ec41a3a4f19308b5a2e3114445b0534460d9043f7c676d2186e330441fb7c81274f39fe2fe36439cead729a1b7a62280f3d6921d4202c951c7b5589defc4b5e613cba90db09001f8ee0a576655670d211eac445a12248925eab395fdf84fd95dd9fc8d1f3c7814c68964ab4d29dcd0dda98cb67da517fb9ee8955007e8d3fab37fe8873431e9a90af3114938ca5f6b3064fe66ea27ed9048820a3da412496e51f2c44784f96e8665e525d1dcbd431cd422d3695ffaecd3514bd47ac543e6e1f3e5e7e0506228b1dd74d39bb5210937f6cf5e35a6c1d9d562b458443f118616aef7fb2c08e3bf5b7112f1f6f7b06278dcc470280882a7081e653b71a9714ae5c138e0d4bc79a9f6bcf0785b0d12d58e9b569b01f581b210522fd7f3147c874a6b7a4781c641936971cb8c2661748995f81108b5969e414401a300519efb8f9891e0b25c104ce8ce9dac543c24871db8c4e2db8b460b13fe69ef6be5f5387323664c4e64e4fcd48ddf4aae3"},
+    {"0000000000000000000000000000000000000000000000000000000000002ca1", "00300bc198c86c744e2d0370e3e8d0352e382e24e80726bf4bb9084f6ca6a690b0da6e83c4cb805619d604a99ea32cd4b6ef82ad912c8eeee599ca5e6f371818a2cccea0196ea3a74663ec6e6a12019bc8d641db0263c7d6b91634d3e5edb0645673d4a0f87fbf0c950d0a7245e4868bfb323e545ed94724ca3dc236c3dd0bbb6b54dbd4fb1953fb11555d2e057a4ec7193cc2259ddbaa610e7af526dfc63bb9ca5d8756485bebc3089d4e8dbd16b0bcd9c4638b27eb28a11e812d8d6d31b32de0c69af329f227599ce3701c62c7faf769c108d93d54bbb23f03ec10a485b8bb0e77276e5a259920e4bcac5be6e4c36d5524a9a431fbee7c2e98dc280f9864ef5f888d0ee0de1330e99bf6ca8dddb7563832bbf530649abf10e09c1a208574ac7aa2699e06471e258759e7f74915c442e31d12b36405261b33409e2b18fa6a40a100059fe0b2b92dea646af8747b3f7c02c105fca211f76120c9a622997fc9da5229b94f7d07df869c032b2209f00260e327d3b496eaca59f6f612c9cdc432ec450b798651ec0f954120a4ea142d2f3e873b2954d0556b81774787214c2f930dd69c1747082f5a8cbb9510a9fbc602936feb4a8dc181749d321d1286d111ce3dcd28ebd78a67d37c925c711b35f20f175fd9ccd1e871a0c653d2da7995697b69f76251260a7c934f9fa12178bfb87148d7b8ded717777b030375dbc0a720471707dc5429907466c7096e5f60b5084eae315ed4179f5e3e946aa45fd65dbf9252d44b10d1e0c86e564be1a6dd71884cb0d86da424fa0bbf28cf4969ec0cddb765c773c7def8cdd65ec47ff87b1716c717dacf04df404a68fc5b4a7b1f23db7a881f1f3821b04cceea8de37d64fac6c6e55da86777922e265fc40161931f4aff68d7e0e140f55e65d4faa0cb2aa945f9e39462e17cd07708e8f839df0c3cb8e91b038b467faf30db51fddb24a838745f75ee25af970a06179f30468afe55780b61dba8cc82a53b4d09f23a1821adba10679e655aac72f7b1591a597135f73c451d37549a7edb5937f83671f4b55c8e0e1b6bd7f4bb095765cdfc973a6771cb02c4717e0dae79919782360c26b8ee13142a7decad40fbb539603c7c98d72872228d05b4cc98580be239775c50544365db4bbe6d0d785b7fd4ff33fe75ce622a665b57692b34409c365c0664af995197b7bdb6ae11c3564689916e2ddd86a71a7e8a4e771a95dfa37061d93cb84ffae50e9f3578223e6cf29834a3abd345c444c66982993a94f112fd34523455ee1ed819ecee642593dff6758f0c9d299e09f096b18753f572b27ab5406ef77765a8129973ca3857d6f81ed178c4901544a4f7fff2a600497bde8b21087db8ab8cf109c00c7328a42993cf530d7c3c8245a7f7722599f3bf53cf0ba5e263485b42e4bbb06c0421fab1389435214d866447ec67b2eef826fea6c32b4433a97fdcbe37383b6668abcef5dde9c719f7f22211749d8112df5d5d3993ac46a0b44129fc59bce52d8c9dbcc154807922f965738cd0b216b665fc5968062fbfdf6e5ea815e68ff613a33fb1f60b94dd9b7d255e8c80e81535b91f5f2ad0726d0bcabe803a5e3107166fb7e644eaeb86c942314a6de8e1f5801a012908571e03d7d548db16654125529f81d504e175062807410bd0b220833f778f41485e66b79ccec4bae7d526eabcc431195c97bb7dc296d6b154f65872d5506132df59cb525302d930eb633b5ab9d1560b3d5cd74f338dcc90242f01358f2d158731d89335fc1752b019096c72f88351d786ba8f86d2e551d85a21607adb662a436658e05c6dc7b69d83f444c4623f06dc3ca4910d9aef92380dae68f6f1044440f2ea399b1d78018b4e5352ab1598105582d30580c7ef85458bf273438d"},
+    {"0000000000000000000000000000000000000000000000000000000000000601", "00a52925b268311fa6fbb0ff7c58061566097f05f4134f28ce5e8fea109cbed1fdc974da78a14fcbda7308cad94d90d184c3f0a621c8dfc6cf4ddaa793e5c30e1b28840fb8af27e770b2077cf2773e796af6d9df0fe82c8d5f316f37ad71b1294dddc1104f5596a87d1ae13fedcc10b174d9b5c66c653fbe4e4ab63e75841b5f7cfe06e60d8133af15bbda5b0eadbb5d707df71f71fb852c571ddbf6e9f618f6dc956dadb2ff76bd1022e5bd6d87f7d9169ed17fcfbcc30fe7fd9ff69d1be329f6410f72d9efad9b3d0cda839772f69ca3de1e5149b96e8cbac8f62c6334ec6f54ca1d62daae23273bef8b6dcdecd1bb1e25a193f1353eb4157ce7be1944ca3a842ccb45eeafa673203e66ea700f3b3ff821cc3d4c19f14f13e60612c86d6405635619dacc4b4c19bf94bbd494978555995d8b763f06a020fdb7475ad9af06c8f1e291e8148753fec5ea2656385a9c1d00f5309046c5ac15b70021c5311e1b3c9653f5cd9c0f67139ef4e1153b61914232301ed511aa17b340bc0417afea4d0df0d6cac405065937b5960c8a5aec8109c3f417958de737122162d321f95c7a44cdbbe23702cd543f10cd7c29da3506b717ec28779f551ddc94109c2fae409966f51fbdf12607de70b1e5c8afda891237da9bcf0d0bd14e1ed3284cb23d42d68f3f8cc81aeea2cbe690044328f5e24ce1416fb5dcf8f239ef016190574b349ae5fab6517571ff13e1009df52456197322d6411dd0b3770063e4c43b052561c6901f5e12d3f39cbd108e2511f235991b3a37d3062bf8a23744b38cc7271764f304a105de557ab0ae3d58932b9f04f58f9c1084c8637cda2869cde213d71d013bb01f0d8d91cea2a97bffa0b201fc6e14b7bf78829d40d50d3656bb849b9d7f620c058375c2a9aa35a973cfc639bb86b1d52976e96939f74d6ad6ae7e4c03d2ed800195da5b98c28a2cefdb21533bbef954e9b4b4e5560ebc097e8492d3c53dbad20ba56aa24db81c6fcab106dc3618bc873976dee2258d593a97b9a1f85fbbbf15656b780a0f1c2732b762033bf604a956a05ef4701121faaf9b86b70fd1ebb60cccfa580b1e9ebe4042161ab46ecc52b1a2cb6c01e3cd1a25b6ee17b79a7e1a56673affda3694f608028fe19da8bf1d0b59fbc62488f303e88f0f5df66e640364bf73beebafbfc60e05752c38aa43a8eb20a5e7037641ac8e430c7adbaf0b040f27846bfc6b803ef48049d756c139931da18a0b2395f7dec5ae1bd1b091508a2cadfc787231065a69dab68f8429e337922187171ed66dfa9904f9fd8f08e66aa1b321a2a138cde1dc1b3dea60c6931f1446509ce3ee8ad44ca1c159b867f86ffb6f103d5cea173012d56a940fbb658f54c5dd73421eae2a46f91e8037f3bbfcd05449a37d54772a19de807603e3bfe10104264a6cbf50f819c23d113b7057b679a1c0ae55a716e615225946bf484fe592b1006fa379fcdd500709133b095cea4862d94579721b3cc3dd09963bf16abf26e7c2dd366edb27bd55f3bf525c4cc5d697fcaa210633732f750448f5a36b922f65be40cd7bced73ac24f426591ee9468e6afb497b4d7ffca3abdd0ff179e0945ea42044354a73c2a416c2e9671310dab3f6649422f124c9ff052d1a8d8257619b69186d1d038b86c04716c5470cb9910e956f17d0d4a03a61ae77e45461bf4ef94301d5242ed66a3ffc0f920d205fdb070fd04a1da09129e9d93d0cfa18ce922faf13171b9d8dd0f66ba48cb07d3519c6123fd8a45107a3bde7885520d0d4d4da9cb115be9f2f686663d220dc7dc14ab06340314f14e11dd4f4d3f47474dcaa3fe6363bda3181055cbb05d9eb91d6bd86509c8507b7e72085c5939247ccfb0e549a10e69da348d255ed0b256291c1b60"},
+    {"0000000000000000000000000000000000000000000000000000000000000385", "01664300c29c6af1b90f80a55969bf308f5b19c14f13b60d7e9e4fba01a614d4ba332bad5561e27fb807058f452c049995bd20e4749e492733cb3dcf9e78e111fa5d47f4ae4149d13f61d43fe989777813de776903f1f7c429ead11dc43dc3593ff246fe684576a4771579d7d9feed8179d50fc431d5c4f1756d9d0e79cb087e657974a4ec3182e227dbfebf48567196de552d17ce89ddb9e8401370525269e4a0120b0addb8ec5802d9a2b47cd1dac93ce3e70cc7be74decd5a7945c9148db917c545e83494a16749e3e0315e620519b0740a0f89a8e319570dc1de2122051c77b59e051a40f842eae3b897a655fb396b94989f32803166588fe6a507f867e759c7f8cde11431dee7acb0f770aa7c0f833f7d251d4aa0bb29dbe3b8d9bfd9a8db61a79b892e266bd7fd61d3c3d96f55b3b075ecec7dfdb3f53a7d405732e8adb1a0bbc704e5e6c632b28736b0bf18d201a62a95d7021f9b266a40d5a0d4796aac769915761183ac79e805ba14f51c12f3cfc668b66dad795fc513f14ad4eb19998f060af72f1147d4af9f371ee05a5f20931e64282a2de4b195f3f73fa00b1d2ebc7ae801ec63b74dc6fc4adebf38e6d36af7a6dcd77c4103157177958a5d04e4fe4f139c8a511b2953aad0c4fc102728a9691b689918dd99f799fcd833b11abe1a132165748f7dcdb06e8c1f832f46331de71a1ff9d8f3027fd81c1f12c24af2a4f39e3030ec71d7c3b7980c09dec7da9612afd4db31b22c6c67d71d455fcad6a31feb8c449e88bbdb5f3b78ab29e691ba961b1c1ca245bb2623a7606b03a47e3784a054122eca0af881020433e292dcce083d8e3992bb1f982481833b905c9e0eab776b8293aa4bff8d443a2ac0e1c5273e0df2a21e88457b054fc3fce190134932f86e310954f17677220bb3b3ea5a1ae71daadd793374c1eb733fdbbec9017b798f180b1d770c86c29c2f2db5795294ecc0370d8a014d8a8660dcd8ab245b4f4edf3531816f33f9298305cc1d9a7b9af1dd9336af5996995c9d3522e0361d763b69d5b1acee7b753cf9fce41360643d6b8601a8a256edc1f661761891d816ee96f124ff55a8c66ac505ce6b2ec6ebd54a79639270c84a71f71549010f99f7428759b815b36c25504cad4449e44b1eaf4739aeada9c9563057c6e4c5731a45ddb9800b73a9a3028e5de01f59440f0be0557d0d76858d7fe5ae1f1563b507b1c39a4d253524b9804ce863226cfe945ec527aee5cbae4bd2cd0454f38c90a2b65b573d1b7e622a84f15c1ff84a1ffa3273f433417e2284667fb9d5117e119be18a428c71e4525078313bd0b50034a6312583c1d98a101ec1d45f2463e460e5a55d3e0f6a201d16fc44a6106133af34c3c6ba4a964af8c6dcd67d21d3af23820f41514bddf30fae1f66ae6e229e6d630204f8a74dcbb35066f7543604a1b51aae09778d2b046ca48df654f616f1c143cb89a4a79577737505f822790206e70ff6e7e63d02f1874716f5a7577859c3259a2ac42fca3f8f5719a318159a17f53f976a411a04f82e7dadd58bf17b0348bb5eedae8ec99fdbea0d0c48739112106fe9752ec419a07ae5aa5b48b9c1b310714e09e1c71b6586c718ab756be95e80e71524bc225d69c0454e419eafb6d8c9a4eb2a8245e51a9a570247743aea18ccf6fff3b7d03dbfc5a6ce4178289839381f271eb804b5cfd2d3cda5bef1669c1c78a9c70710fc72d5ef29098bfd810d7cac4d2a25fd1d3c4454800c8556261947f3a8f9db13f030bf505e5b868108d0a287bd6052ff865310d5346d7ba83f9788a85a335977bee4a564c7a6822767e1cffd0f35197f98f110d3aac13155d03b0a3c43a4abc3d7d9bb22963fe111c16e112e0fd0915c84e6b8cc413142d16a3e1e24"},
+    {"00000000000000000000000000000000000000000000000000000000000017be", "0056dbe2d1558381705130ea16a2e8291c0eeab8340a730e985dc5bb3b4c5770afef4da1e434e91de16f175d7122bf2286cda03291a2edb80d04c2945091b117e37a9ed655d0abd856f6a6b65ce7b1b7b63a489100951d6bf580b7a4f8dbe2306d9b58521de27895d302933432751a62efc0e604dd447cea35d6798ecf650fd391646e4a454f68d6415469d8788ec1a6590fc110c1175aafc4e1869408442466b616c1739b0bbd41041beb7e7ec639a3faf913576ad9113799faff70881b49395ed1a5a305b8abd6f645ef31523001f586bc1098fd142fdc83dd1685d60689dd80a6b64655eadc3a3f6316d79aea0b697206060b334e618db9f39fd8081f8feaf2df948167ff6115b77cd50a61e934e9c70b37b4264c47ee62b8de925cddc86a7d1ed6302e1727d053888e66478bc71764485bcdb541dcb45d947128ed6f3e2e5db80f996193c7ce53d17ebd20babbf502f77b665bd796a103c3220d2ceffe3d213135888b123c940f8b732f1ffa78913feb287884fc69fdf18223f9e9f2c7517d6bee5e434c05cb7f694bad0df62d3e7addadf35387398168e653be797a29ae9b9fda9405a9fd62d6d99effa8e140d4b26653284ce1f3f9760a8266c1a005aa9194a6362a40d249623340195ef609f0eab59ec79f6a696f245619709f3aa0d617a2ce0bed160722b2510db4f53132e96d292cd52d754686059ca6b9d60ce75e7d96406e71191c14b79dbaaf3816ff15dff1d83afcf982319cb0a566ea673fd44f241263a7319a5cd30eeb84a648e4e538cb1e8f9dc22450109db91f1a80d4fbe2085080dbc53e3e765439a111da67fac1b8663de5e953dcf0f307c69e563a1eed137f75dc8d974a234d89525cb4a78268e8cc1c2dc319d017d3b953406b6f45ca94c57a43d6a6b35a5e895834a66002292329b84d6bf948fa5e6f6f775d6afc009a6d95d28d99b39f5d11ff0b5bbf3d42300b98db0280a87ac55eb4d7da2a9385b4c17ea6861ff5ce2506853e601687710782d2a1b6b8aeef8327317bd3e41e29c376481d7a50f8b3a2ea56de0589e69b94b78605bc56aeb110f3e4ba27538124674af13c4bebe0f77ae35f16c560b09b662ce8f79f59f3766b9e5754a408784131f2d159adb2f60339471e4a18e11750bd4a24327a5e5bde53bd50d2c353c0cdc35dce39fa62ff03a631db1f4deaa33ddf31bf6d5893f93a48742efa2487ca742bff7b4dff42547e30db8cf5a3d17fb00a0645a270236038af2a21f727efe575025589b4da3c1cd5e47afd5f18bd6176a4860bba34212b88782bf91597021631cd5e29a79af1a72d4bcc612b7a3f957f18cf6388271cd871361f483fda456b322fa497e3031f61f731beaaee1bc18f26a76ee83d1e395e9e916f27355f26241f6ca33c30b3514376650d664b9525f101cbf1204318b6f3767ad3cab36d384e7dc7d4195e2cda2d5b5b15295f62f6a43736de37a13f9fdb382d0ce1af8c612d7915930d921c55b82ea19ca27318c80fd0b0ab0c93da291efde27a5adb1cda275597e2250609aec909ee372d9080b45293b329f303a93c4c54490d669010d696dd036f762868cd3355b1cdfc8cb523354d96cd4af67865f5351f3e5f27cdca605deedb251823e06d9c77f999dd8324b97dba76d9d798bfd302ee0b1aff04d5bd9db231c2746108d95e630b340e04dbbaa1180ca534797050679bdbb83127756a92ec170b9c08fcd0a17c881b35f249d995965735d66e1d2846a9dd18bb88e9eb3d63cd47d3d82d5f6f3ca2a112dc3af41208b1ccd4c2aaaccedcb8431843fbad4136a167f09c5f0b9b35e2d4556da71b4b2f291ed54f168a2c3cb66eda81aa8f27a7f075b9db1a1e1b196b1aeebc348bd13921fea0c6d73e7f5abe6cd5db085a"},
+    {"000000000000000000000000000000000000000000000000000000000000088e", "006a43da6c7b9ffff09a81d276d11e2cebcfc993ed03e2e0a08044e792faf1a25cb14ae09619b0b42693029e72182700db8f314a311b868e8289184479bb306da514732963047130e0d9b8caedd856922498121f0ea14c5844e97cf9de6d8460ab25696e0af9bea25e3220caaedb90b23389beb613cec41cbb2ad15b70c5149f8b44cb60799d3f0df6617f54113f6fc7fe040c188aa0e3ec301aa3a2f555323936f2162d4f59510405a96b5a4f1c3bf140dd03a3dccddd956083ebd4441a596b48e1160f6da87d93897fa514d59282be8a80144dbc5c134cd3ed589e747d1f367c2f19ca19d5501968e10c00dea10b9266f8e64c4a5fea5b8b1941ef0c491d7f8924f0b1b285831c302bed5910b59db03e13231921b96023531942c95ec8d932cf5a6a7b819e0eaa595dc26cdc33819ac138d315abcd3bb3350851101ba8c06bd23e2f582ce5701cec58d6b6cddc267e06131b30849908dfbe0f2740c64da4aa938ab6b19d2ac977ec8e4fb813b52bd2ed3fbf5e9aa20c3c3cc51d1c9e9d6d876c0c782b5553f5397b562c5e16a64439c747641450fd94b45fe409d6f37fba182ab5d5150830d68bfee9e57ff0c0e4e2535830521ca05739a5101ae4b6ff4497133490b6a8d8eeb8c283ac38de921c3f0b921f6fcc9dd850894353f049d3407bdc3b5a398f27d66d70a031d4fc357e0665f90306447b12f00991e49a58ef4b3793c722199125a4b151bb7b2faf1f788e010adc87e57b6291fd1845dd552675592a93416917268929b593c94887f817705b167eb7fb3e5f8de57fa0f9699cd3c4e239e8767f640ad5ed7af76810bb7b99fc6101037362b50cebe3877207a7be6eca584b33d533dbb94ee4effa4e57e75a470347bde38b1281393e2f9f62b54c6ce3ed8c513df569be97c2493cf0372a5f61ce919d1f24160a4c850ee7e078c1c2047cd4017cc8afe7334f4323a9506ff92230393de007d7377756f7a88dfbb831fe96f44c39aedc7d4d2e0e05aed31407338dcf5730ffe2687955264ad1cf46543be5964f2b2cd39dba377818ecd1b63f767c6c8611453906a4a51cd15b5c7319c0bb84f21c3f3cc889175ba20487ec7809ba5cd801c5d181ce3bcadcc6213074318b72171d6cd593b3d8493b18e97c20f3e7f674964f1fb29d7697d05a99056cd9eb164ce0bab07609b999cdb39a0198ef74924f3f422cd6f78bfb365e3064656b0b223603eaadd3b9daae10b9c145f2c38c24d8cb3185384ce5ccb5f3952c9d12053385fa4ef22cccf54f2fa0810d31ade8dd1ff2607750903e792210077ecb3b11a88fb766587a6545704e828d3a9f0010739ffa3f95baad7a87a17b38bc993478c3ca7f001a9522fca20de10dad08a28f181f97950e87b396fa2ea8da2fdb6a04efa274d4779a64396788e1bd0a0f05adc1a99f650d8f474a8412cf228ab5bc9278f206123ff17fe60ee90b353731ebe3131054fa5aba5a5d29a1d4219279bc3bd27515e66733e0c6a1d1ba0ae82f031420602789bfdc8eb57e1378d2ed9bae4d8cb212936c0b0fce04af6df5eb5edf5b14bf09fb9e032c2eb229b15f309971b77233ccc1358e5a0cc1b164c8183a08e19fdeab40f6a921e6cddd84f20d2dba2bae3f4c63f9e290acc9b4fd048e7fff42f52ef975ed5210ab5729569149c346059d5aa073501bc36a1f14b91c6bbe64190ec1b2f56942e278ab6a374c6efcc756186e05b8555c49fb81d9d57f67347d167c0a1ab9d0269059a571a0ed39831dc91cf4d1632aacf7bc7df21a9f550806983a58c5faea14e96092e7b096ffb00e445274fdcc52e711cccfa7a979ca531dfee1373bee3b6d11fe4253b483d9bba50a8a46882e819e57ad0d81e2460dddab264b9e06283b37c6a6c6adb59b995e"},
+    {"000000000000000000000000000000000000000000000000000000000000014d", "0096e1752a899332cae450367b2d6d7db1c25c36080800cf3bdba0efb50f8652ae7ceef6c4daddffc6e910085c886959aa3d001e7254e99f20352cf2bdc14024764bd9754c5d7f5643e3cd22f8e9b65b9f139ac503ae7d05d090b0e9ee809404b147d865f151ffce510d86373bc824b9612650f65c877382131e64fd59f61a83070673afaead918d730134527f5b2e3a9b2d5d2189c94e9b4cda25be2385f878d11ad628b53f2753009dac0588de2a5f6331b20ba5a8f8a894e85335e610d10ba447d35ba5c2aba36c35dfb9c9b9d2f3cba102198306e9f1c6a5f275419b80740df5d48b521b4c1dca1d93bd506c1b5933c44cdc406aded7b699e313240d83e1390979a11b5e0453dc5c90b95c4a1ec7ae2828f9fb005442cbcb1778a810d87e9f26f8be6b12240ec5f79dd3acffe5d6d8059be06242e5a7d9d2f4271c04ff890af8ed20a734cf3a3ce191376c4a8cb10118b471a688dbef3f6f01a0f6d5f8e973699b9df61a72c51ecd649613c6cfb2e0ecbfbc052d0e2d3ade08745505159bb1e19ec0e17d39ef5ed8f10d4a93a613e6919b1099190f49b6b24683128f0d4fc10dde770380b7a4bd05282b1e7473d235694c4ed0c83d599a0d29eaa2788f4c12ba0b017b1d690a657bf74f769d20b76bbbeaef0889cb8bb7f346e7c0f728765d7d6b23bb2749560e6b1702cf3369efa1cb710fb77b98e002bd053e79957b14f09ab1111c9ae521ab9833518d3357926618cd9a6512e8aa2de0e36b4791295c9fa8039576026e48347db4e6b377de9ff259534fdaa4984837439c2018e46f226c16d838d14756d012dd6d4a0acb577f0ea0e441980515f995d79f83356f9a738a204c9dfcb528457ba452d53ad64afffe6a89f9dde73962b56b029b2925e44fc5642ab029a1b8a49bb64a3b7044c1b7cf16ea8d1e5407f5b73f7bc5fdbfb36700db6ce17e46b8bedfe0124115cf0ebadfd47ea9ea2839d59af4db301d01c1f37b2e74479dfb12d861ae052ec4dfdb9752039fd1a4e129f6277a70af5d60b12772219d135944f94b5a855f0a5cfeddfc1a1bed540ce01650a151cce1ecf250e377e3c4bc78b4cce33a132462469a184de7449952c9397b4811ba139b490b20a6da7d8ca7abef458039759b5a132ec6011e76a92ed94b286b1747f97bd627d62565951e7f16d9e21308dd4f51d2c5ef638aedd54e0daf500588af9d4cdb62f89c9542a639d77119a942386bb256840e7eb71d1d1baf98a0db1f45801b16482b646821dbfdef4548461fadbb4128163d5beb647a1ab9321d363b0af0f30d61e75b2fcd4f61f6a36681647f688a5a0c58aa501cb4763a65a0a8f90612b2fa061bed65a91055856e36c3a66331f375d19e77547165575fdf26829af2974c504cbc19d79d64c11439d48bfde562f5a0fea2fa04d5e346ec08d18771c3814ddf712aecc20d1677315a51cd967bd87fe7a8da88b36f5803167e1a94b1c931d6a792ba8f7562e177970ce3dd37e6c0f4dc886134759ca07d59bbcce629d3fea7d7214115b42f87b30d0c8f70b346d4af728d6744bb401b05e67c7aa0640f704b158a69f3a3bd08131333c3ca05780b9c0d3f133e23433ec653cccfe0642843780bb62b327d61381cea345d700ce57d775ad35d70e0c22d52135e82d90885b67305c3c7692870b11ee4c1ad68c3d3bfca342e8363e55b9ec35f4552c8f4167b76db4635babdce0cef3cce355812f187c3d5f7ddc6e78df354becf871ab8d71a330c52489c41752e092f125daab95ee5fa0ae7fb9c53353dc7c9cdb1e7065e934d1e5b9125ba1560a429ebc7c6d6c1eb7203bdd9a708c7aa57ea5f2a5c7e5a46a56a59d8f7583f1b7ecd02c5069a1d9048387439bee951bd6a78c515dd3cc3196182ffc726"},
+    {"0000000000000000000000000000000000000000000000000000000000000429", "0060e3d23bd52aa8bfe2335c5520fb0d70445fb60300790f2dea4511ba30b4b1eb7895b11e0de67b15011b6346bfa3d0d7d71dacc72d33fd6c423d303b3a391e1dd9055da1d1971fcdf4111249dae6b8197b40690eff645e6270221385e7b2ad83f41228ffe09a8f0f1936dd2a940b0dcc98f943b24539387320b53955222823a7b7c75af55522d7b4f5b8357e6e258b581e0828702bdc96cc0458ef5bc8536eff7b0f655e1dc3920494b8fff4c4bd1cdcee25a7b9ff2fdac1abd8b46f169ff2517f550f42c3d851e78ac1c88c953c3587150a539a2553917d734c1ee35af6ebc7dd6ba7ffc96f10fe3b574748d80477093443e250ccf7894a1fcc5409aa763a38cc6a03e799a1843579dbe7616d9cb3cc241fa96c5ace96dd6bcca4ad3a628e72ad37d780c71896cd7d9d903c4d6222d405205438217daccf2327485076a6fbed7349b59ee926b37cc67afa5cde9d0702f369299d5fed8d7086d0dccf3714df41a5bf43ae0a7e05b87195243736ece310d36aa626930075c1890ec64a4b45861021659983ed8c50b47d58fc7b05ba4e54ec290e24f0916b75c687045efddf2088bfd5c10e0021fd0dab63e1610f01a38421ce346d8126cba01b35da12f5cc4d92fc0078acb65844124e36bff2a7244994cb34d14035b73423e1d1b5f78ed4e31cadc533ea8d27c3180dc54c68c3daf32eb60dc1623cc50303e6de169584a34b0c1149a2f977f7576388fb48ed0bad2296aa49b823b26c06b08ce2e186bfa6dcd0a90afe377e2ba4aa7f6adc621b3fa4bdbd5743992b034dcb1283ab274d01930985e2a5bfe60f1f06bb5f3b0640153166de55f3ae1e235af9a2224cdfd30ac5b8133880b1c88b615aaf78d28aabd1374ed67d9efada122034653c4ccaaef88bb50f6dc3310261e57796fe15f253bb170d6c0f9bc9591bbdd3365a4c0bf45808008c027cbdc3832e93dbc591c8c76be99ac435aa1b050d2d0b4b833694b3281a484856f09f43af7b7bd72063fa262a48d9ecce02829696b5ce15d4b09b7d5342bd5f1cec16bc453c1b753cb862606157bf31043c0662c71466c68cf1eb03258c865ba462e2577f18e91b0876d25bf24895d142e5740562b02388f0bcbed1091147071dcaedeac7070610466c8371a6cf7eba2214fc90cf51519ad156f7f4e80d6edbcdbf453baa99077c0e493d88fb18eb5c87a7116e0f6f8846dcb5322158551ea1df5c3dee9852c2eea4e1cde3183d7f43230621ba0c5e38e5346926b62637111214473e9a4433180be3c7d4cb97451165798dfb129610c49c2c730af2fba5ff4d85b6b7c762183af310fc897b15088a38f2c3b1a3358125d53f99e5cf5f405725dafcdc521d3a96f864cda83e9308b97ed667c7bf199f3cbc6c250d56150751df9b860b430ea936fea22d1cfeea61021fe2acdac59a4ccaffe339a7f16a9adfba5ae4d0190a0e49a30fcb1d2d11d56dae49c1724e0eb51c0e0fa30fbbe54730512434f49e864c097e206f9a6816165544d14adbedaf384613160f6dd544ffbbef957d11fc28eda871ddedf48ff714417e61125ed95f9fbc349ffbc7e13a6e2defc8548914b0c6aa83d49531a5220585de42229ca97205c4bf3765993249f35c21973f5fc4e33595d66bf9a15551114f7aad95e738878302226836dfe1dc2566f1d1f079dcff37213ebffe86039adfd74d959bd1a6cd62d68020ace23b92b844061a6db673649464a9fefd224a252e28820a90544ed52dfbf78480cd6dd0aa88e390e3a032fd0f6d2d8c2b0baa11065b12dbe8b58f2380a0d7aa2975e47e8a273445eb6179daa2832a96f40cc0600785be6a7b945315a1b42e5650f896e439e63d9ffdc465de16ff63ca1b343d82fe53c49ad75c3546f7555705bbebf618af"},
+    {"0000000000000000000000000000000000000000000000000000000000001274", "0000fea5fed6c72f6bf731cc279d5202341213079200b1c0a6869e1bdda1042210aac25e20e1b69c518a0afdf132be5630b0d30d82db52777462b560bace964d7535a3712fedf99ce787c69750bb0a6a46dca344090551b028e14aabc63a010aeb464e547820d874614234d665019840dcf2bbe8105eff4ca2a7f97b08a0097d4d83c9b60a23f3b2734d5f716ed31343b9a8b51c2c6d0ebe64f687afca442997299fdb59cadf141400fe55d700ddf767cb0098c566e5411ecf9b9d03912d1615dcec14e5c13d31c49ca2c02d6542c7d007bc0b1315bb9e98d2038c0f1807f85621f6c6657be879168ab6490cc5ff8ce607c3e531554ad31af79fdaf307eb04a880a143bdc609d104f567ee86347435e8d00dffb460f5580f154628a449cbb1186669fabecce211724f28ec7c6c75ffc5d5065968ffbe1fef9b6363618eb345a8b05f6d8fc2a760545b3ce2a18f7b343d00f1f22442982094fd1220648f6f1dd19f7a1cf0480bf259ba82d117f5608382395494e3ad44280cb1e50d116d4b078d524a9ee421e88f10767da2f17b4f3d2279c5a48b9ab0dfbd80b4e7dc5018ae966adad2b402b2029565d3dc0103e206d7eddbb089e7a41912ee0b5435e8500b66688c7e239ea7cf347a002e1c5cab1929dc4ce1e849e3bb3681a20a9b2c189490ea3e2b23e442b602e57fb1851463cb87b4aa860c3e5f046d04f34a15b7c2fcfbe57a25697dd3bc02efd83ccdc321b1e7a9fc92ed29fb4782fa83ca59b925c09c7bb40910ba9728c44535242622efb7253405a3e05ee7bc2eb782d959f2508b9d51a3cd854d4de9ba899309bb0b156eea797243d1dc1a71c8d27719bd98bc5436801da4dcec6cc856a7698233ea7e5a748b9def1f94df2d7baeb604d9c9a3c643d7c21370650249891a30275c26f449b89713d31f73d9688c66ceb3e147ffac070084a9662c855f510d90c0e22aa57e266f7f13e89b0093fc810697c4a0ddb8409ba34d153969ab357be204578a72dd1b1f3b733a21366f1c31251ec2dfabe7242f16e978ccb178a7d004a6f852617afc24d9f5de02888e4a181bf41b6698b4d6c252f549c974755baa38f1a2b001a2c0b99db2c6b269fc030283d8999db315dd7c328f5c92bb05dca1c3bafaa4dcfa887766901d0cd15acd0897dbb75ad6dd4d5d2b7e1208d8431704abe3ca1d0798f7a9e5b0c14064522cae85494cd62a8802db6d5e4717711bb453c8395207a6a15df25c236e22b5764bbf76e842d57ac2f8b6f262a133a522325099fd50114c9af0c6fc4397fe38871a6a3e94750f0fc482d40d133993ef532c6b9ba0ca4c53ba6369124f55256d0730377b65661020ba3edd9ad435a63612306c3cfc8de7c2cfa643fddd66d3ad3161ad31da304cf998bfecee8d67ce24698a40c131d964369ddf014660ad302c16dfa2d301041cb6cd3d6ddc7e059f04eb95ebb2d7a323cd8911ad58e07a137df9be150b19ce55fc5f8fadfdfa7d55e077baf39acbc57719f82022fb3816a4a0dfbac878a09affdd06cf25fc2af402fea3fbdc0a809f0765972176c2caa6520938fde81fb0720e805dc1710e7df3323e21f891877653b7601b156922f4e7cc4bc174d60ddc66c3c19e0e1659194e77939e2ce801b7c08046efea613ad9d42d1135b90210a37ac50fab71686bccc7d4e7456f692edda9960c41c170dbed4109f34ad7d16471e64a728fdba29a224f5ac74fde7667ecb3a92c5456422b41d11ea3ff54c937c5225ddb89b8c67d082a7258c7bf49df93de13155ef70f598cfbe9b1c410d0a790767d8f3fb5d51a116e6ec3d626b57e14a7dca9eb0ad6e2a91a1f5c16964dbad29081fc97b8439a3e728b3f11715e4799409a7e1cfe181feccd2099aef5db70eea12abde6e1"},
+    {"0000000000000000000000000000000000000000000000000000000000001332", "007185e1818c8290cfe2c282e0964b24e4c0f615070d5ade4dd6ca5cf581cdd24ab6db2772ec4e1a5dca1a0a43d6cd711ad9d2cb674369437032a3b65b921f26788a127c9e6671ca356650cdf63aedad7c71df1811ead21f9f15a99cd7dce34722f9d2b1ceae9648e21e7099b50914601b3154b2c9cafc981e48ff5843eb2596a34547b7148fd3af33547c7eaf99bd770fc3073129ae98b3a8d1f37d0373ee9be1893e9b967e77e901427500d58c23a8a19364ccf96c5de66d57dbaca31d25c1baa3b3b2ffc03bf40098d57525751854c24127db24279c50af98d452c3a9caf4d36a949e5542b13a76e9e5fc9feb75ddd4358bab6111467b0297d5ca0216a07d77594d12f8b685f9455eb7ce13c4721616364c8e0be5621725a93a94ece36ea0d26e999a301c07ea87c92b43053122b09248ebbf72ae5b5bff3d1c3c71721c44afaa07e7cd19fc4af72656f69738f37f07cf67436e9453b6b87a81498ac0959c8d8bfd416b2d5c5e6d46df1d9d063ec934f77dc6aedfa53c0ecc189cf4610c86cbfec6c703381d9fa9132a5f1f816c4b56d2a28d972e99975708477469e48ea685b92332218584c4b7a4177139f07346cb4a66cdb6493de3c531075d7158a32f9b7e5bc504d258748d8d887b5ed92f86466f3b0c2a4f4c7053ec00e5e6b612df52eecc311e55c12c603b1d9ad0f562ffb4f1623ac5d2493f096d8fa3936dae99f756d1f4aeb6eb45d05eb3ae863e6ebe0a2510f85b32f533f254e195cb159cdfcf0129408de9000fb62b5dee364d7234dede1098772be32f473db0629901c1e6e6971440e4ca4b2e1cfae9411454eb1f82ac518b6687e42e1a73bb8ddd7358c2703149ffea1cf311fbc6e823bdcee584296696ed3e651b45768572cbcfe7eef4a29d53bb33463d4cf3f9171f9f054f0ca0e5e9bd59492d25ff2d9fb2d6be4aee036e335e5e52d77bfd4ec834886fa6164283f84cdd098a64fbe048827ab50a51d74812ca79177fd1974e177bfc2de45e203b5b667448e5229bf22f13f23fae389785c8a5b4d005c45326635c44ed7a55de3f79e7076f0b53cd0ee7d99c0c1558c963ccda1de8985f03197d6133a80b72ee868af21ef327a47ff333dfacd109612d4b4026748fd36da5a19853cb1615dd9714830e4b9f024866ecc76b918205ca3fa1f16cd90dc331052bbb516b9cf6173a5034c12c65883d93c9b3b6070b675ed847966d00b5119300e95a9454efdaf0c74b140ef749ffe7748bc3dba29a1dd8bec2c6557d18ff315e19a847a333bd55b1634c25daaa059bf9d147951589f4ef2289176340f4e7375efd8316fad93f8fdf1df699f60a6c654bcaf4c2b9d1eae8f1bab8bdf83015e7dc3bdd9298dab681656f147d3a9724347d79a3505b26346f9f564396239638d73cc4ce3bf955015506225d37d8a278e3dbc57063b14dadecfb92090567099d138d988e86d76b0c147488f266b97eaebd6b9e1be641bd75377b0fc07c2283b71d2d09143e2a3bd848df6ba93621609bf012659e3d74a4bf5abbfc78bf08e7d0b21648e9f4c7acf0bce34c45a1c035d030d811ac01035347c72eb5c1c23da2bf21c15b039763350c0fe787d6f0b8e7d4e84190a3bb5e197097953a651a10523bde57177d5ffb11dd75630269a231900b73089c884c3bcd842f9c09a213eb2784956c2b90ed462086f5f764200929574492a739b7b0b5b5177f176b08a17cb83149ae5ec96632104ede614d4e8f0c37bd13918204dc1e5a5115b144d7a22fe8432cb77f7f0d098feb14fa95b13aeca0891633591fd25248f8e448288b0b35a626740fd65fe6e19c48c04b21aeded8421f3755df945d0769590b5237f4b773e60fb912f34c56364bfb476cd9e184c1678d1a612f8a3dd65b9867"},
+    {"0000000000000000000000000000000000000000000000000000000000000044", "00773b47fb113669fc24767d65d5008a5e9b1afc2017283d75319d04d3e51e84d5bdbfece9a03b77217b0b4f31f449e02565b62640bb52df516cf933f0148c1686a0e072661ad7a04aa6beb954af11e6d2f2cebd07cf48a41d70ecfbc868016550c7f2b4de887adaa8143c9685898b15948ce6e21669a19bbcc5b48d2a181ee6eb95ab21239dccd3a4b3e538c1d702fa590320294e23ed656f47cdc9a552bf22da30a5082b19ebf105153946446ed721c6ae619d64d2d51a9201f6604220a98ad3270c58ad5dde373e5ec58191d16211b4d60e9b9f1e16690405ee42e313542ac8ab057c3a8daf187f3dd776cf9b9d1b91b4de19709f49eddbd9bdea05edf73464a76c097d50a161d09524150f66b5b37108df7c531585d102ed57b114048f63ec69692e4416205126981d888be1f18805060ef10abd778e35469041493ea7e259e63f6043c4803768f0531821ba9f540108e6a0c21e347149e19023ef961f359bffd280521d4673c5b20fd0f6b7c902a7b196f0dcae48cf8a9a0db4cd4c7116d99ecfe313e56ff1742f356ebdb9ba3c227b43216894e3f48ab7099555a49e60e47793800614ac5a0b1bb2e1bc23a277985617d986f7ff3acd0e873181543d7885f1e9f131d7be10f9bc3f92d19a30ba13617daa1b65fb4f433847474d45fb4a9c9d75935f67c0d2b21b9393a1fb061f6e4787a1493dadb4024ffbc8834a7dfe7f5812cbdfa7168e9e4e9daa2f0d87c44a2b4f7991e01474a34966aa061235b6db1808cff4c379b812fdf0cff3559ef390e6e625fd845911d0e52a4f560f4d2558087ae57fefca5b46794b1e2363fa374c77c06be73b6259101a9ab2770cbe3f4741a017156979e6c7f3c305e1f6de3bf6d3315774d926df2d16385cfd12ef1d52bf6dbcda4a1ab773c6e64de7f336cceaf52d8639d7e62a7c5eae3727f2af79027f0e9be38512c8767242fc3439b28d3245d8598b1721a795d3d7f9b8cf453c0caaf1887b2ff8fb7da60362734a3bd6e299e5c1c4501b3f143d453ed340c426c3336127a98ec5cf1145b9bf52f90dd2810ffb06156506476e0d239d89bc07884e59fbf26f59b82ecb49984d4423e11ded798255527567d13ae7971f552730ca5b1ab42ed9bfff15e42eccb80c212c084dad7636a912d2f751a361799f44d4f1781e45eb20bda99904ba1832eb030ce3f303a05593ff8c169aedbad9895243d451fdd4b05580877845176f44fe7273f4f0c1193b4747c4d7552d4c47b46cd8b27ce6d257d920fe5fbf4476c1deb9550d03c700d5e942aab8ab1d2939053574f5cc208223dc9ce45816fce2897e7cdf6be7164b90ce13cc4167a5483321db5969dd7fe4b71984355bb1f4a6a146d5da1be62723da6aa6561537f0bd72b6e61249b156e5a973a90830d996430fc6bf2426037750e05db5f949fe8c174d355a286e32377cdf46584825e4165fde157d59a766457d477ac247f6557d14d0bc3218dab1f90fdc71dc40974a54944d51351f2a4f7da360965d879ab06611453db585c4df79137b03cbab6565242e77a311c260cb483a612a85781e104a49ec7326a7d133bd7b057c8c584a7e2b07fa067f32257ae8a1538a8d5a7f74b286fb07664ce1949a8a3370758bf2e25725799e7530c75b73b25ddf152b050396992a2ccc824defe3244065346441d0a8d6f89a0a2e6760ebc6b526ab6f14472cb4f88b55095c324a34d0efdb39ce22b92dc3073cce4485ceb89a5bda3f478b5b7fa695ead0c96498d85f6a0a5a595553d5aa09b2528a5745d947bdff22909955d55d6548d5542e3cf16fe1edad9d7db27fa71b69bfbd92706c7ee47c21dafd6ca7ec494b7f9c328219e73f26654b3f5f4b2509cc7ea0b4751db98b16854f547efe5c53130584"},
+    {"00000000000000000000000000000000000000000000000000000000000004f1", "013de39a9540c2646bde41b816df2d89756bdd12fb1519bfa650deee25cbca4277adb58ace40dffc42a608438ea1119ca633e646e631b03936b9ece51732bf2587917048e4aff7846f769794d07b420ee6f52fb905b273ca0989c07bf81780ffdac8aac65e70d93e3846b73662fd535b015b08b67484f6130afb6b3f7d55154167e3de246cab7994c223ba113d09cc723108d918bc7ac36bcc679efa71a2115dcd197b42f7fa7bf401f1a12316127bc19a81442e48b7726d3177924d7f2bd83d32b059d91faa0012de7ffad2918d25d4db461826c786f0cdaf7cc6b0120164bbeaecfd349dc29024a976d76a18bd39e51e84ce8f7d7811f3efb4173103beca35bc76816bf43622bd26ca657133497f88ad4f39fcfbf3aa7edf86c98564414291f5e5e6dfab1d1c7bf5e30ecd784b9548a46bd446b4f534e73088df2d1c951d558cd550a9e4882f89c975ae87635ff501054814a1299fcdd5fca311975dd7dec1583f33c2460e41cd286f5e0b0bc601311b16f51b85370151249c077cea1c064ad9b32c64b53e63dd247b5d7fdc11466e3e1e2ca9f1af7dae9f5a30ef739456b3803aaa410d24591e5e5d0ba3d4cb93023a7e0e0dd2cf52cef6638beef88e5b6887193278889febe82e8850d56d7c2e5a4442ba10ec43bc6e4459775c5342822217ff79380bee68b11043ff0f52979e81770cf2c407b7770707d4d33ff613ed4b02a921150c4eb1f1ba1dbbde0244b6beb6b65561fccace36401a39ed89a344ae28661c57b2737dd1ffeee15234e177f32f970ecffacd6327afec43a84c9a44913296c3a5f55526f37a1aed340ddb79726214ee2784d0f653284fecbea5727865af54f6ad631967f8b78c8d9924d74cecf3378cfeb6ae105e2d80fa464fc3482118fc747f6cf76f74bc8d9f13a87badff596a55a63003deadc214ddf1c0b0b5db013ed70d1e4f7cbd8958234ec5b4016d0d3ab2d3ff1e63dc0e959adcf9903514fbd4726f86c52ebf643610034a52a26c7dc982e9d15ced1163c57f436c1a99195206f353699bf7f26fa3a721e78cbf3c67fe849d0fe0f78a094bd32d2b7041dc547d7f29cc81954e6319969d2c2b0da3919ab4726e53735e2cc468ec92c6163e9697b19ab3e3a33a2455a2cb3ba5a1f35e0c2b174ff6f88a22796dd8c6d236531aa7415b17d0fe40070f1c78f89544f0d849612f87483a11bfd0be8c0028e11418868f7c98fe3f9332adac616d8c743bdb5e10b7d0e0dec7895b661271617e3f2d01e7291c3bdd282283fd88d2e760b5d6d62bbcdb35c5ce5b17261f10bf5707732f8801e6c7814e397ab60f3394be9b933d6ddb6fac591a19394a19365150c0675f5c7ff951122153c0f4a6e44db6c7914e313a7ff5ba7993e22544581e4e4577d847c48e74d4885348795045164b0d04e266031ee2bf41fd7100a3ac724590cafdbe0b5b09d0e331d2363923c02af3d8f3661ad9aeb054f7e30602f4d88173b23fe4024328eb6759bd8813563b8b0b1872ac365333fd4bccf22b29d05255092f9db3b808531050c6249055347a940b65abf39da93afe3e9c0fa53a3fd98bda05f06cb3bdf5a7fff53aab73a3761d716f6059938e4d924fa282e69b3a7614a512c88239bf8f5ffeecd52beda493f570ecce168a99dbcba50af269f326068f774d496684b45688a5ec9c158eed1063a576ef09293128c02aef62db085fb7827f9b5d166d8d8533ce69a13f84c1cd3cefbe610756fc249877482dbddb5e98854221f8929fd11862d7db1d80b60d81f38c150e293ccb9103693da97c3ea2781decd2370653ceb6d11988982f1861ca6b3e96cf0477f0d51e356d9f832f32dba90a06b4935c4691ba74b420f43d2f3bcc20185b17858529f0ccfd110e8494b97cb5"},
+    {"00000000000000000000000000000000000000000000000000000000000000d0", "00943c4eeac4ad0d2385d22d71b81ebe437852c94525b1ed45229dfa76fb38d3c5e3736381c00512db880d79a493af91f15b5d0e724b3b18c537401a1df07a399b94f38ca54e1b4e0c57c24dee681ea8f2d7023d00a40a3f340895f5ad8b9097ee0f9f60457f37828f4c5ddef2f4971f630523189312f512da43e732a4dc0a598e11680804927ac5111afc0db6dda838dd0aae11453e94f71714cd2d35931143a8b54ea1c6bab5610441db62264b442ac009b1417810cba534f24be7bb3f77a78f9b2085cf5acdf580e8db4b7b1a651d2eb8154ba6ff6fd6716980a2d15e4634a786f97458202b25a56627139d6ec14af3c6cd28b7fd2a1f8c1856ef055b58c0e8b59411d64592ab1315f20d4f3092b9c60f6fdb00d82a70957be28921ccea88869114de233d06443cdfaba549439af93128c0c1d2bcf5149f4e1f07d2b190bee2073b8edec31711c86c958c68be359b04510438ae27dde3b76e66a6bbbdd4ebbbe7bed65f77d8e5bdcb212db54a69a7af7e55342dee691eeb1a30f795018d93a048d6731368c99c59ba0ace59ad726f5d4da1c39e31fdc590e8b369fe369300ac98a0e90470d67b80d4cd010528742624c02a12c72496d03d05566248b30f7a92b38e817aa8ddb8449bf16507ea0c557ffb0263a39d6184241119e2619217569c89d43c8bb656e0d6cd790148b44781b2dce32fd65a03ad0d1d693d019cebf96dace0ead12ee5ee12395d3d5c1a7a17307c74f2e7ff1e86f461dfa295f2e9d738f71e895c22078e4d1195885821cb5cd89267631a2c8027f1a7f120255d634c8846bef37197e9dfe1feb34c0d717d2e02c7df7194ac73892b5034099dddde1ef130c697c9ffa00893187a33c962c42f81cf909bde472072d3516b8d7e1533db54e363c255897ebc8c44194db3bdc3bfe7cfd3ba84f6b7216146bdf6683d8edb015604c2f584fa43b43c618ca1936456d8f5deb9b712d09f8fefa3d29f655fa255ec17ff2ff47b7fd6cd0670340a82308ae3e7a481a3795376759adcfdbf5e4e46e52e53d9ebdde37a86659f6676e7c56bbf0c7e05822e03850e916ff6e7526035be5150b59b85d795458dc63dbe95a28fb10f086d5ff0b3137f755dae2a0fdeceeffdcc4213498b53035f721129a7714fbab81848696a6927aa81efaa8497f3bd60126e725a08d204657be4138155103456907750507e2e417f751151226674a099e9a391f7117260e737651d54c7d8c14808d43fec8803f8cccd7841b856c8bcc4920d48e5bc15bbfd8b2291fdf6fbd075dd89525c11aa7eef978e0b009d3660c2c77be674f71ec0479e6fbd269f59660cc084f6d14aa6e5065514d18135bf0955a2cfcefb0d7273565309d401d10523016266a5d3576e5ee2f81092f97f17d12c3152ebb1e7526a80615b2c3c06ae038fe7763c196881f523d1be7b901e06d2e7ff2f321b0b32a1771aa7ad36db32a825af1f624febd78cd91b0cc2f2c312fd9b439ef4c2e35e70d972b8743d3c302591fb1b1d79310bdd838260b98106c406585e51075abb9173520757b19f32aa94ef28f16b167ef10f12313a82e160a8eb31dc11371e5d4ee483deee4e861576d1092e688563930c37d8b66202264e361545f91a5c23ee6610b7f5e01813e07ccade756d7e9a0a87069c0b401717380dcb6d28370e6352ab44ef5ee46d495175b71d56660563318a4025715056fec21cc2c41c5955d8bc94b213606b646f994b726995ff953b611e71831e4f53d5f37f8713f6482786998126dd5b9e0b3642322f0bf056e71489e72d63928f56071be79137bb5d817d60285f4376cb1b84ebdb8709ee9e1823137f671b4047a8ed1f0812ff4d4ac6f12a0fb7b42e1b8418e197531640f68796f0bfddf059d4bb167244"},
+    {"0000000000000000000000000000000000000000000000000000000000000ad5", "002f9b1e475e6f6321db87753b7399725380ffd1d030922fd167ed9a59f9517484e2fc88a27073f44d0f2145e6dc4d628cc387f3834f4f50cc7ce72b3c6c362f5c14858f1abfb5361026937df29502ad6536a6eb0099007c6b47e28a553665a0e750d00dfe2c7d1f0814288a5d699ec0ab654af1b5d59370775b65bfb0350242ea4a9fd588fac645e087b75cfc11e9e8b91471309c3c2b6450cd61f80c87dfafe51dd2f0c1be4db007c635ff650d21812f3b92df2638e5790cd68b8e8f2cf743684025ff05640993fd08781ff987096ea32d280647dbb8cff692e5eb884df7c6f7cace34f6b9e33daed25d1b68485de0c56492afc009cd3d7f0b0ffa07e94447af869087f903327482b1fa127a323a7ebf0ef75a4190e06a7365ea9238b0b5a5f8ad933243b907fa309638b9388fdce880ef5cdfcbd5de2b11f086135df6e539c8b8e87328230d38f89b957a55ebe88901eb232e221003f72960246fa87b01a148366bb293096e2edbeec527624d2350fc7cd6f7b50d2c4c26961effd55e49abc557ef3945ed494658922bb198b6ef20bd3ffe20748567cd466650d5bcb09a0d81d293e81663c513171613dbf54e228ba6c400d4e28f35b23e52891fbdc136391dc1d1c77fe4e7298e180951a8b31ee4c93428ea1add61a2c454a44c36359529d224ae6ea993aa47a2b5ed57212a75f06fd9b6a1edf9bca50424497104a0b1e1ed98a4e8cd3c2da749ce5bb45f359f9fab8a4db0aedb16281ad5ee3e1edad35d0261089696463e67e68fc8fa52803affb13d734650949733dc369449e7f03d6ad3c402f5760509592a3c0b920b120a05666b4b6f70d60571a8dfd375f559f927f22b35efc6ae5ea5fdd7a7c5852b398c16fcb099f94f0b69cdfce1e1212f862a628b4a25f025fc8438b6c1318f0ff25a6baca9622dc3198f1fec0932f1d8a930006d1db00d89fd452312f22bc250278e2f809a835b11c63c1ed1574880f0fb94508e323776d52c7c7951044d1be9578be013d7e7948846f53a2d42e4dca573065f1582866f89ddedcbb1b3eaaee070e8fd572394009432d8b74ab166a7b1e788dbe51772862f7a7dfc02ea8c87c68b06653e2373518e2763f278ecb5a844114abcfb22959d66bbd262561e18282560016ee1fa16e93be3fe1d26378e93945bfbe1118a13f21be2df04ec472d202f59b7d65bc350cf63f832b4cbddbe070f61fdaffe0ecbcaf708d276c9ca8ae79dcf3fa234154fd8f863a3b9bf5406a8e85cf0e4c66ff51536f637c4d46daa604fc39f8de4e39830b427d2d23eea021ce41ca58454fd6352f873b4037f861d523c2a9d0d4c1dc67120aa71edb956059f1de1a4861de118359b210a66868fe3020d67e9c339dbc1c61a73fb94110f23471e2c47cc99c135cb328ec0be55e12751f41ef700b20277d841532c79596e55b973de639cb9bf8af38196e4da61f73075bce6c8f9466caa96b7d4f8ccf61787915947ec86a77a71c387fc41e60a7b42dcb88f2cfaad144b12a8cba8da6449d83aaec1b5e8b399c2026d7668edab3d19d5112229ed54945a07fbb55f9a13388280dcd42e80dd1884da2bfc60871dc8ff45cb1bb06658d2e707f9ea7c64b15e67315a9966f746d44a47a3415264e57f3cfaa9ddf7d2686b68189b48bc0d409fc727cd66ddca78d3a50c3ec8924ad37f993926470e0c995f0fedc6ad25913d30818d80238d80531090562c15d27a3999dde1d58c95a26610a738ee4d167592f4d9a0ad3f5bb4a3d4999fc15dfc6ef46a14152982ecc90c4dee642cc2ec8f1a98f93342eef6e6561b435df8b08bc3c847256dd2d689a98ab25890783f8abf3e7d60b0a3e585168091e6deea06597724a65d193f01ab2f26a1d009e90469e3fc971eb3de729d"},
+    {"0000000000000000000000000000000000000000000000000000000000001506", "005b0ceeeb6de013dab7318c122a19e234c493601e29c2dbcf6f4bd4d4868fe2e951e703a26ec576aa410cb721477fc940bbc704a57ed153630324139d9a621f324dc8114a5325c909a508fbf7541b18a75d657e1043378899e9e481514203baa4ffb806bf30570ee217e9e75e2d6b583f845853b721d74c4e86febb31f51223dfd95bd032817a4b91299c5d3d06dc72d914cf247271a6ae1047056f17b5d1cfbda5739c37de634401e03270b406865555c192d975564291646d9d5fa813e2370f7c72364bd11a96dba4f7c339fdee3d85a80e9a443ee14885598995b848e5597b9b88e83d57dd19627f5b481c2b6af858c41b02eb7a4a3862d3241802493cc3f7d199ab271c83e6342b4a24fad1ad1bc60d621fba25c814bb94e3610887e5046b0805bba111029fa2f47feb6ac7e881d15b4f2979ef9a04dd20b608f67f1bf1427b1545cca7321cff912b04f59f60fa03683b0af025abb161b021436916912e24b8574ffc91a3b6e5af31b577dd7b1c107c7cba4335de7e9d1e2290a5232a1ebb87d26c0afede785b8b1f0f1c148f436592584e9a769b9e91eabe2565965eeb85dec14c045c1b16011b4c379467085a2d7fc12b40d57d0e1004e79bfdec73a5afaa0f51bab6fe51e1946570f22c0620d83bbb0e364f1ee811137c4c0af33f9ffef98c0daca46fa9883cd1f546852fb0744a7a15ef7d342e06b4b5fde7565ff99ae7756671408ab55daef35878419e2e2313d5fed342bb043daa3f41e30b047e18710c6534fba79a12bbed3b820b6c3801549bb31a744a105e1d93fa5d1001219a5a1fb75ddd6acdc93f78de0ab97d6a6e4345a8b58f524157cceb3ced0199e69b23cd9cb797d5ea01da3aa7ce33689376b5ce57f68a10899b132b3bc72de7a3a8f7805b0892f2df599f7926a01b0227534ac1ba5362f1189c49aec2575bbeb2013880d204c82c38eb495174d43a2f15c8d1dc34e638c4eb9564559c476e29a414e2eda161f86f93dada0150ebf60d2252edfbbce0bf22d2fdfe2ac3d912a41007f95e4c9be0df7895720e6372360161b63ffc7508a3c5ff2a92e4756a9af2aff166f151a430df695f361184c7a98f0f15da9324cea3db906e97565ca1530b0c69bb4a9576a367e970b672deea16648156ecde17ad62ea1a470423dbbfa22535ed1ff09fc0384c99031fd2825cb1279198db125629ec3ff5f7a55845356533f5cd19b4e6c3f12927d744d167fe5726bfef7d117c16f05d61d9816572e2e8d4ae90f98243add2ac4ebc3b9a975534571fe5f5a6ede5ea8a1b713df7ab181c324c6b1b2f531c8c92fe192226b5bc95b0e7091d6d7e6fa3a3cf79b7baf2c4bdfbbb498a7ef875f32478fbc4892dadf3f1bf4909494cd7272b227c72fd653e2768cd1af301205b0731505f3ebe13431ac82207374727bbad295fe3986560af4684ce4e0b3c29a80bc02f8f635eca771576f55d5dac779dad0f5bd0521671c497cfeba1b36e80d1ea19dbc321d6f79c4a0a1811ec618ea977f35a9c2424ba4224eac9be1aeea809c0549624d447f90a3f40b96ad67bd09d3b320cd50f3fb219f36968977d87771b9d4fc98a928fb588c1105dde2e31d4af25bb18c3fc0436f5a661cd3a3b2c852c658398a5393bb7f568e33c71cba2f7231a31fa0ba510b7add98acb9dc7a13034f522adf9e1baf5ac3a7ece90314ed7e7493548498c42ab1645717ace7512ddd1b8b83695a5c1c0b17694224a766945ba5c0e41998dc21ab0cc1bb44a37e6477c03eaab0a9fd5d416bb5b921f0d5c8e9994437e827278911f087e0dc46621d7938d62ab4bd3db388fb6646bf2f81c7df38b2b747fe2d5f22c43aa3cc4544df641e934747256562ddd83b30ae40007b08a2365531d012ae8fbbddaec"},
+    {"0000000000000000000000000000000000000000000000000000000000000064", "018d219242e7ff85dbe5c36843f9de75ff65516f0c27477d768f234c337ff1abfe1ae30fa30f3ed9ae102b2c237f56535bc1aebf46a20d3b3b05c5007518883a2574fe29942c1edd78972829fe44360db67bd0c702e20707e7063d25555283ab8b30b065454afec5451734e9734311dca8e993c5cb784ff0398bb4ad0d8d1adc72efc93467a5ed4552e2de471775c493534b1e1cbc4ad3d852df779c47c7faafe5553f411e7fdb800422e6539e5d979903322608ac6afe41d9013d4fd813a82b970148fb36ac5532d2572ae2ddacc391e57b0ccd22362a18652d47a1b34024e84aca10db5ac2461203293a87873386accae16a08dadf2080121e84a70a2b015f8d1fca4d7e3b61e090cf7f2cbd207549f2152711c6cbcdd7a8b13fe9c6646e4b12726759eacf17f4933a140bc60ffc69c3a5d451694552831f7ed41997ff8dceca138caa1de347143370ca3778920b0f03b36e2b3c0ad9c78b98a295a5787a557310902bd9274404219a97c60f22b495745cd6594dad4b58ec40156edefdde572b596bff8344953231e544a7bbf92721a9ab28b2e5463de747a284aa3460d8bc541121c804bf6f0bc71b99d93b2c02d68ffa7bcf99fd1f9a501e6cb402ac4fab39fdfbbc86a26bc65f56c89b264c095581bb52a540cbbebda1267de6d2907bc736dd281bb78f0b0ea3fa47ddf498f65b4877ee7010f38cd30650afc449b2900ffaf282656f26246cab5ae87d2610cf6bbe48982ab9771d93bba6bd307e788a5c169c07332ccc92ed0ead9ca1c539a565ead6575c32c4095bf9a491d3aaa509c456f5c953e9fd7e35859c9cc20ce7b6ce3fab2149707631e8e3956fa8a29dc57d533930148f431b9a45ddea87341556fd0a9f221834c925fd93370b2324932da723cb1a3e4cee1f607a8c2e3febdad32667b6634c8e3b2af56935bb2b21ff2302018d332ab59acf657e16220f7ac7fceab9fbfdf91e06b0a7a9ce4847c8fe22f0fd0b3d7d8954b1ab8e131889a6f37d8aaaeb8d9083f554fc41056da7179119564cb73c10d881096cb5a6de633d059dceed95fbfd0ae66250aecf9f6ac06f64e4ce2d152555238ff8100cf6ba6be32d4841faff4922f07dec1e5dc61dd48312ef3184421c8d854458a64f11d3a02277f61e04d7294c356b661ec9cf857a541a2524ffa9ca331794f703acb2b58ad25fcaa28eb1702572ec3635427b993a1a4daabcdad88969efa951e7d9be532f18fe19b79e0e4905674a909323eaa2a1f6232b9f4d86c7d9057b1f04852c782ac3d9eb0b33cc6566f4997f4cfb784a060710bc186860d5a00134e2207997fba2851f23c01de03ff31ece77e09660a35718fe9ac189105898b510a65f422f09f84b9274662b81b4a3d1b8ef7699b2533e7f119f6a43596806279cb14c4756cca577af3c03a72e7ba86915c9fb84f140c2fa2b7dee8ff4f5eb47099f80645b3470fe9d95172b3c7116e9ca5f59e809134f04e3613d5b3ec5e39033a73932bdc879838b40e0436c40f040c5c06cc43ce62386893363fa91160ba6826233cfd332b8598889b9526ba63c575431ab4b020cc2a25339414ed674bfccdebdd5e245fb43810fb1f69c17a8b6c1bbf4b1ce116c915d8cd71c536414a0a1b8840c9239249e54a321d7642593b67b48da0c89728cdb49691b8dbfb1cdca4cfaad76477650a42ab81b0ea197109ae44e33a415c3809e84c9b51e9f1047a5fc0be03c15201185898f55a3072c34bc01c92270698a124924ac632413e07ba2e6fa0aaf15db1019c317c138e89c1bc2ea46c59eed16b22c6fd9a1215560f50f4621593544a057d50de7afaa7165d3d37e51986b2afb22046b4c6656a7f0c0ab93ac9cff877259327fc860997f95fc6d98d38a6fce270d0e1f886e"},
+    {"0000000000000000000000000000000000000000000000000000000000000f1d", "01062ede308a524f99e010cca87a186c810ccdb6de3a45a7e84ba5223f544005d93265e8e711ff3c691a0f280dff2d4e28509021c258ecb5ea0cb37baea0cc11ff1278daa52fc57e796226f7fdba715f8a3c6fdb02c5c6d08f4ebaa317c9e8fe8fef9646cf63382934454d5dd36356c19b245e07fbf34d39ae523ab69c6505702dae820e3b2358b4b4346fbb36a202e61d54e936a05714fe8e147f2549d5254a7a912e0d127f254a06fb78421c6291854ab9a0882ed6c86075e4f1006547a5ef87066bcc81d457c6f78df49d8a99ce96f67e2206ec2ae7e581374118d41f11efbb4afc16bdbfeb3aff2e67cf1ef7edb7b0c589883d8beee27539b985071d2e7f6e24b5a9e20412e888d40a00c08c19a37e31289e1b1d5537eddcd6b35b4c9b295b67f43ee0c41395ccff466c02e7781f11c7d64942d542195f630a2c5e02ed6fa4f4d19223f592fbb73402033e1fe7700274e4de8cde7287cabc80a88633ddf059d1f72ebd14e54b19798e668f60f4e428c4b4ccf2649d142a800526c251f11622c93f02b422dcb39f1d7678b4218014b7e6624d552f23896412f992c08e7605fdd7f498059450da4414896d452111bc2b3b6fa08769bb1d9b075f1d3bfbc24a24cd67a5f6f9db41a5e1cbb597e60eca9795ec4a896192e03d1663f17b637589fc3f6c17b5ac925bde5077f9739433875937f22b6452a76303c6cfaa981212614b6862838ad27b9f1d239abb34255301a8a1639c455e0a62cbc9dbfd1948308cae8f08f53a7cf602c4e5698877618c697112f9181bbcd81e81d9b10559eb91d247c35331724b5f29659ec4b312f1951a41d0c6577c1f64a71c779b55bd743056f85d733cdc155b08fb51a2aaef4372cfd2fa8d9e3f6d27237f55c956fce5486d7511fbe9f05edcdf9920894d60d5087a150f5dce5f84f43a2be68a5af59be27f01460a5f234408f3533461f404be17a18d90cc816450bb234c3c27ac3da24667b521c1dd576cdcfc395005a3bbdce78c4b13c5dd60d7c1e0e52d1316ce849259fe4d8cbdd71ed512449726d94d2641fbb3be3c550b41bf00ffe43ca34756622e4d9389c50a9bd075ba15eac9e83d46f354c9e672e0656c10be01685480bd2d8815c3e822a8c58c26ca539ae13d52e9857d00a07e98b5eff170736bcd7c3a4649d611e70feedeb7090179633f1ec1a512cf64a0a78dc973dad26ffa0f7c115325e3b0d172dbecd416fd4868004a23e7f884ca05542751e92d8227d5a6f3d9766798357e0d57138b186f71023da9d48dd8b90456d2e16241ae482dc52907c9eabbf2b2a6c9a4b74217e3beb8819390f8eb0e0ff6b9802964161fc3df235a03cacabab48affb18e1f52ea2c2cd8455959b8527dc3d01150b446da4e6a3b675a5feb6e4c45db2d2561c1e13dc1a92734c59f014cf2d6df88c8ef01a158081b74559efea75ca36b0443d48f8677a111c56b428f95dfc0ef1c377c428c06005d919f8f1ae73e9333f00a5d78c0fd1bd21d551ba9f8edca1c65ecf4db42016a46a76aeae5589169067934f8e6ddcd5743ae511812a587eb787ddd4e990e4878c172d915e14d3e00ea2b6b0f84875325b59c0ce250d2228acbaf98aaf0f28d1e766d1db10d22d7524dd483ef9ecb56ffbdb5ac37d29a1a5f3c9bea7901790819ac081b75af635344de53bfa9ac2ad8b11f086e4dc55ce2acb7e77132a0b37b6368c6345fa4cb05eba750cc979445848bd1ce341e70099f72d547f2299129eb20214cd50c94448a90b5d781a08a1d95c3074903823cd2889b6d02918d8a7eaa4e38157ae5232a0945b4731676dd7071164f22d5785eee03be1f7e17a4fa7db5d7313ba95b76b31cf237d2f9285d53301fb509213c0bac2f689842be6e56467ddde63e6913"},
+    {"0000000000000000000000000000000000000000000000000000000000000553", "01df4850a61bb8118ce085d5b460c325bd235ce61a03205a69df444078db903655dad5f426947a9eef4704f53ad89bd182c507fde233904fb87962a50c9c753bdfe4debc1a59db9b8f143b3fa25f9dc905509a6f04267f02aa480acb2707ec28bde70cc3178c19731a27cca7a1a3cc59837b33d86e9175268a76fdf9e6891697b1d6fbc8f857ce381286ae24f447871c1dfc2220c091757468a695518fc5894871de917b0e7333640688c585039afaaadebc26d9ba702239cedd18db3f07b14e94d0a85d4d8995236ecc1eee0ed8ed9b64b20cbaad4399317b9db5b485feda571715881eb865cf358923e0480feb7f38e34ceefeffcd2770f0fea9e9099a63104a8e4b3dfcf3d793aa4a4986412333f8f90c36a3e13984d4fe702b26efcdee68e26544dafe5720334e0afaa2602db3fca47aa3c5c67e70ce36308622434a827915ae5abdaef765c87f6bee220013c87d084b28435bd22e7d8a5094175bc66651beda7c4e743707630a86ff03c7fb0e33839548d89101b3d03fb12dad82002896c2e8e44ac7c01d7ef616afe15aada83bbae27c42a26d51d0f9172011e293d5f3ce3532d41e183a0f7d5a2a4fe4e4235313b73be6d2a637be1120417a2280e8031df8eae6f0304b3693d22abf727928f83d935ecfd926c197b86cb8ff092eb5d576ccb731f08fe4b9ac93cfc671b45d94f57ae143d21bb6bb0dcb82d38717d82ff98728ce6a52cb8ee5d45d7b994ac70a64819fd9c343f2b6e69376d48211d6d2e81b1a9a2e5f935b655f2d653596ecd33c55d1e699222f3c173cc08fdede79b2a875b63e6126aab50b1d91eb11b7173dce4ba5f7212ce968eff9fad74516de15f02f2abaf9d32324d5e86219a2bff571b67b8693f77f1ffb62e626d1f62f7b0a66ccb2d33f21f6b5b0b93c4320d725bf72faaf98c44447b74041858cc599b09f03f7a798f447663d185954a27e5c5499f8589d5b4b16394427718d01091564b50aee559f2a1cb2def32a0d005b9a6903953530367cdc1aea11ef4b055b7f6b0f52f0db0e1e8ba56f8303258f221da2e91efca73e15368ac0e3c640bf28e2127374b3dd915a00ccd1431634b24ccf09be8a905874c1b94c9532f04cd7e9e12b91d1f0f20dcab5b23bd7694bc6b7f1ff363a4c6f4384543b2ea776c3bda2553816d520223de9da76040c8dee8d87e75d4bcbae929545ef08ccc16ef060050cae0b4f85affa6fc3e4a1e5bcb776949f979f3e0f1caaf6d35d91b139b1025991fc66dd32bfe69d60cc4ed8bb7ae815b64cbfc5557643499691ca489c7d28132a4a3470095ee1d026b19571eef439104febd0612005762a0eed1f19e34af2c07627c391f8a53ff8f51726a35be3073353935239beb6665b32952d55097a369244edeeaf266f9b5535da626f315e3d9b92547104ae62c7f18fc2d50606e15cbc724ae63724df884606a525e47e994bd4f0cf322cbbb28d3df17ef2455e0ec70fca599c040af378c44e8453be2203e39877c3165e330575071f299a2d527c762b1a1de5745f97cd08bd0320891f6995b516d1f6237a9d1e59a017c78f1dde51d8e08f3edccee925f2693a86aee7ce7d280d157d32965c226bf7efe8b2c75a4413366e5ab6be012bd17f9a52d3fd936671a5774eb6011170443d3a4e050e76457b464e1d94a0153d606fa75a2d51bb582023b905fca71183ed58165769d66101de24f13d5028191788e9711129a9a0b04bc991f9ba1f25249e252126d4c16df69313eed9c303a9ab7b62222ff6f71e940b4121fcbf61bd5d907ed49afd444095cdd65f6a1912ce39125404cab37c3774814532b986fc319dce710ead0d78df2706e572c6436617fb1e2d9051b676bf11b057e725148b47194b9798555faba733c7bfab71"},
+    {"000000000000000000000000000000000000000000000000000000000000249a", "0033d4cfdad02b8deebc69050a4ffe064312de17e5058daf47655dc89b76ab74c028ab9ddd51299627270161875e140129f01f5cb32966f08521686f6fe56f4012135bee9358b12c1b26f0d2e5194ad52f5e488f0207724bb68a5bdc745983b7d7f55c4a0f9fdfd245104a1a315e5f23bb8bf595e0386b76f24db5fbd8f907f107b518c50debdb02f1add2b53f09346b96999509cfb0db8663d18d9b18d1717529ba20df65cd4c5d015a1c18d89d81391c515506c7440219fda458bb4108c580b11f2636a79f5163f87e512cb6eb8f17e47104048c72bf227bcf66f831523873d752042bd4178e19e6abd7bdcee2e9bd3a524640a9ed589221792764038d7be55d86eeaf7412038a51e05120fab79d97341522b72a4eafb83197129a089c5aaa12ba9ddb2def28cca24803bbc3edf45f46548bd03a2dc343ce83ec2cb8bf2008910095c26be6cfaffe3beadc3d5b542d00c4c8f77884a03d3acdc185ae207ced056f3689e903edbe62d20461c518da420cfbd1d07d72c8b907a00506f2ca668e2b6510b4514f1552ef809bcccdb3c23af494ce5a1bfc5596456421f87549aa785c3843db09dd443fdd94c1a566b32235fc684fca8fadf5d94e12f0c15fc09415aae29953ef3b722405bb3d5f96a541c8829623a5eed72f8ef4d0edb21acdbee6519c7145e1c41e455a0dceef693a1c1ee36ee6ec365e6c69059ecd8f9852aa7b757a50b55128ee60b4de7758093338844cad0d41bd36285468a4e0d233005a5c4b980889cb92dc9ff87b72796223da148c88a1f8edd89634f87fcad726f0e7ec6e16927efd9f8b53bd5d3f0a09cff7358307045862d231dc6e8f183668a0139dee1b10d77706a4522fc514f41c0d36b4cdb0316da922189a8192faf856abfb47b22d5c2f015689ba9d34416439cc0c339da37bd9f96d04f7f06993af471f3e0f01e0e8c9770b0658940f028eb7c48d7108b47edced177f6b8692ec422b6e1e0581432e7439f1f7394b26138a5c0e145fbe55f233d343de358e51ec6516de68250721db4acd1108da4a5464fd37f6bd57876bcb6d09003e5f10182b0f63fea20949a95756fd3ff83c6b2105570709c98b8a501e283fe8daa61eb6ff39f727106686fc5a05445e9b1a92976a216744fc8911d57f3cd655764fcf3b7a919c2a04cc7e0b7f72f27cb9e30292766f752039234f3132755f4543aa67c0d7bce429120a0b82def9cd7f71d4316a36877e7e53b4697c0375587238d8976926d7834c0d7ad81dfe5890626e09f0827ef4888eb45c86320e6b5a0c7e708e7e6288101ddb18f51ae51f4d25447806ee981ab1555a55c25d5fbee802adf249bc6f1723414a709a60c517ff411729b2034208ec3877be651534c19de163cc6e1a662326c536cd8a06dee8a984b1b76e3e8643d1fd8cda05f4b0d681eae78b977e55d77fedc2d18b52f5ec06165967e5204d9ab50f29c6a86a5bfe5ef5ae1c5ee30fc1e4dc174b604b59b5a22eee502fa1dd9c3e012763eb3f7fa5f1bde5e35ef8ef2ec80132bb659bf70e12ccc611ab1ac4aeea8485d20e7a09bb52aa3ea7e22e5a097c7e6f366fff5393c8ef2298d5965af45efb35f1d2be61626175a4a8c3f84c6f50b6044adbe3533e31c79baed3e515743844996fad41493f0dfefd94081bb55805e433e7e27be5a03fe8934df457fcf7b71c434f052a4890f395fe12dc10f857bba8cb1e3c5e1d52aec63ad06541f9f1b200b1f862a0b7a6fd144f374ea6b92a1d3d99bd7f06ed5bbd44b7afc69f614709c15b2a57615cbd35bad1ff96a0a8c96db812f28317b64cc4f198e19f8140c2ccc36150c0d2ee18392a29b0b37ea4cb0b26d60bc38b18ce32a8e6cb9e5db635c6ad903b4e4e5328e7c36c174672d14392ff00c2"},
+    {"00000000000000000000000000000000000000000000000000000000000007de", "0006952d60d34eede8cf8204bb4d33364d3bda07650e399f130333af2fcf116389c01e1f0a8ded759e2b16a38fac874a04667ede58ba457b19dee41cdffbf4200f33d76b08c43d55dd972e5639f8ca61f35470ef0b6bdcd62e02f63bec3591b92afd00e9721ed3ff2a636aeb697a34762df48cf6c73254a032d4b51d83f126faae7f96e56ee1a00c976eaec5a69ee43c5df38d3774863bd9d6aa79d89373cc2020c9222c4b9218e70299307cc86ba995d2f8923da09ef2309bde2fcb1219ee64534c8ffe594a3432dd857cd890ea6adbdc50168603571f1a0e075be01306349c9bf19ea53ea0872450476bdad53c6be816f5d200e37d06082a715c840954656984a49567c34d4293a0156ec0c9b2f6dc5f1c6d87ba359ffba56f86b33a15a82e29459df4499b2d9719a163940cd7433535d85cbeecd5af6797a46836b322f511673dc19718a6f87bf96fb668c9346dc7016ad61ea54f237b627a0045e48d41a32390bc3ef10d9a2e29a1cddd0cc15e33695c509fbce0fc9116cc23052a373f0b6de384e4570d6b7b5812d188f82cec4394f27a84dbc09d5401575eaa7ad1aaa210becc24059107ef05d84ef3e074826749454ee2654e1ce73d1f96a7dde9b65b8bda1076b0805e74df55b1fe8a6a063e5a3ef99f9ea93e1e85b32cb5bd9aaa4357178546cdcb87fdaab0539820b7deaae845227009dba6e606160ce58fd45b755895d0dfa3f564a9f893bc15064d2c0d53fd9e0b4d9d5cc6ee3f7345e35185ff69d207b404ea2c61f2ed2c94e533c15b3aa1ddb3bcb4840d22e0fd1d26d91f3d2813b6cbc4d261dab6fcd59923a24d93b2768917cd4a34b601e40dbd47423581a8608aefeedc5877a961df86cebc705fa272c63672a92e210aa5fa639151e20a452b685792724b5f349e643d8e7447b35720550479c42a3fe1d1ba174a7c8277012efcacbb95e79ef606559786530bae7fde5ca9cc058d02de074851465c18719b2e4f6224e24d492a1f13db533cf58c7768e3d801422e9250de968e9fa09733930c53026ffe35a987e94a2edbcba6a5241bead20c48db6edbcc93bb7579b61ddbb14a0a6ef8fdbc8f19f068e6d4e0a93f76bbe76643660355e1e1d97d0d128baad86f32685d9f339271b06f4fb8ac8c9637c9148cfd168f60ee89754bb4568b4b80121878db39e8091baa5e62913147eb161327c765cefdb269bbf7b30a6871826c8dc686db94f377c9f5ae355aa777508115a894cad507ce7edb9672ca0f33196142eb6ee87967551667265db8a55a2ee7a1f170b2520831976ff71450852254c72e99ef92d14a78386e119e7b5d891c25132acd8ccc21d31a55b3d248a938a209af9eafa31c8a5d7bd397d3d5b7bc32744f5c1b58d270dc524d257216c34e19b36996681b81b65e2fdfb75a5f581602470dc97b82599574ee40e8116e9959fc1036cb281f2491bff754b8f17cf2d37a0fd0ffe3ee3cdff18902eb047fe91183e9459b83d181cb8479b9f29caecc2f860f2d60e67165e37c2623f4eedbcace8e16752a0c7fd8f5b70a78e466bb65fedd67325e2305be96f434ba8b969f508d40c073b82b64e03ca219e39903c211c834f3fd123c15f9cd5667f3dfdb8a9fd65e131c2875b1e8aadee5dd580bc2b584b5ba35c3461004bf0365f06b626e9e17b0fa022781eb4676c673fc582d1a034f65999589b591f2386993cc3d2e2888d1bff1108576fd6271a59fe54c220eeb77389d116379b8e2157878ef5a5e618f697fc6353d41e96aac4d1e45ad12264f4d10a67ad3c06bf23840761dd498228764261941679f28493d619bd671b6ffe20a0d85c3db39ab40b57a7df6a7ff71ea96d5b4f4d826730c4c3ce2084a5b1ed07ed2b4495d01466706fcb2a6406472523b"},
+    {"000000000000000000000000000000000000000000000000000000000000095c", "01369a38b74c4ce5fbfee0c4ec36b800a484f9d1a20f00c52f568aea7a7d0622a58b4c30ea70257de7fc0f924d8cde1a770578bfe54839c2d56e8efddf1fb42023d9fcbf94a743b478133a4459c29248963294610aee346c13a4c0e9e96ce0fd524aedd8ec233c131f1a5a89b4288ef4ef92a986c76164c809bca21c3ffb12e55290210f037d2b58e4b08f5a752ec5c0df0cbd1e3e6984920d4e71175271ed8fb3e76d079b8b8bd5024bcdc6f9d2e33f6f27073ddb4dce8fb1757eeb1644827441e7dd6941b1a7fc10c1ecdce742c77f5ea30c26ccd227469b0f2a7a5567ddbde51f2342fbf12686a6f7b1cde21f433a27fa8f4c7ada9ac2d6393e880a0f079eae83af9732c9c5000f7adf05725313ad4523ca72650967a2b5cf36b31614cda5ca0f487e3fdb0b422fbd3fcad185d683d220d9e2f22f6d331d320e10babc0ba6e389dd34bd546378cf0f59f9759702e6018876855d2c4d79f3f8615064b5dc753ce2d3e91712bd7426d18adc01777676b64bd287ff20f91ba0f90ce3bb5d84d4cc0add0531f250f78214a0f8f29a1018bb1c74c3485f27c5a244bc7130b925a883744f530e65e963bcc9b44aa9ea8249456cf1b6c9dbb8c62d13db12b4a60566177299235483f52dd1da1bb69b0814754639000fa14116fda6801abce09da67cb875ae1bcff504aa1efb65c12b15f646619cc655c99649d503f68426361abd1d645f73b278b11642062d19fcdd1e2a8e6a103b218fe88dc23e7e70e751a88cde78ee27ddce4588583ccb1f66828bc29ace3d8f98d6f5e83a17f57b5ae81e45fc2937f7fff414cbb1aa7dcbfa06389e4cef98d4aee59a32e1e8fd2299d37cbc6a52089e5684b8cf1d118c6d65cf513fa1bbc2153eaa0b0d3842297e12d027968724884d448ecde73b7f74e65ef8efe0ebdd410b2542b692e5ca07bef4cd1f6a170292cd704c145c4123e240bf14f1751b817d3d299c13a19c4ff00d0c99ad4102283afc0468d3e88983c912c746b86650ecedba45aa1ea5e50ac2a18a9f397336e1361dfeec95c5a72d65ed7afbb2aa3b86b5f79b058a8fb20e4919085cf4e3d5ceb10f328c507600c452060b350960a3c33fefe6d627e36de2af7bb77dac24b20955a45413fbe5b654f96b79241ee4683ba5c03a268c429ee3d373fa8453f974b270790dda35bf070301d7db36c24e45e1f5d1198b532e130676f8b5b70c125df2336e207dc97c63ad0c3a76fe63c27828ec0b03ac952eb1e5d390e734fe6ecdf9fa99ce1e06630db1694af1237c472e97c3e3575aef84fa2598857b0afe7a997aad4adba8fc04460f239c5253a398d5951811cbde2254e3f6d98f371469d2f9833a5e1f4a110b6e3d16a0073cbfd86ff1d160ca9ed170e2dd71c629b51460f35e0509c405985715d9eaf71b4719d0ed03e4b5e0334881ea929097836ed1ccd66dc1dc1d264367a281391dd5699ecd47fe1dcaae2248713813db145cbe7e0dd26da3da3c52554fa3033901d6af089a29f03ef5f469271d4f4c562a75748bc9f04fdf04390e3edf8f7862982bcfd31b0b02590786c816b7928a377737511ca16ef361f1fa0c14628c675082dd67ab1ef2011f4f6abbf399df640c237fdf92a097fef2a825e93f7aca5491d6fe7be3547f1e3a6a63c21c1058041422894fb49089b5a634c5eef8075229cb71e9220a4b9c4adc8fc559e1142c43a77ddfd3c6e99ee7d637b762e9a2d7ca09cee578d5b8e74bfe42c53f3ed13c2f9ac1e51c9ab516edc4c236bb8f2adbbafc12a709df1295e98c72bf09fa12452a215f3d31ebf7608a2944cf585f536037f735d805c3c2979676b55f975e135a7c163d8b9c73b79dc23703ef178d87a4b1915815c50599327ce019fd6eb732f7bcbea632725574e3"},
+    {"000000000000000000000000000000000000000000000000000000000000029c", "007c7cd7d3abd28fdc79b08d46b42a88b91c3ba9bd01243a458c0e28ef96b4ce0a47fe597fdf155f50910d02d469ab1179d5afb732627ed317f69616fd23710efb551a0386f627f5a8117e3ec617909dc59019bd068e37a4a99a1a692feac7b60abe1c42127f5cf3616d9a6ba2b0df6b0dfabae8ee58efa8cec682feca8415b87dc98f9df0c7a89fe54e30b617097726cf1ead1c62c35112cceb597fb317942e41db46f038dbfcf10fe7d7fe394b0f71cea7173d8f7d025a08ed37566b22270439aaf634f5e974a280cff8bfeecca8bdb2c013d08325e8469b5e4dcde36eb6eae36673dc93c13b1c5b0a4e061b9781b98e8689e739ba2dddd7b17f1e11b8c14c9923f01b342e735ad5b09349c31a7d261b3e9c656fec35dcdbf79e0423315d457e3c8eb9630f17840198244992b3de8d975e9e5f386ef44a99b0ac204f354b60aa30b56c53f2840595ac0ede571735c900f5ebce1303b686b4bf10cb1f7c70bc60b67654f507244c0b544bb263e38fc1ecf23ad3fe8763fcc72519e6f922019145a154c051ef90b0dbb0a106bc3f676590a3c9c1e0182f5a7806ae65bc91be36043391b4056a6a689ae01e91cccd5545b7c6393deb3fff0a0706502a0a7282c57b213e20cdc408765d755aba9ca60d678a01ae26c3c99e62f2ea2ab2e892406379c74b1e38b37316e0fefb85c4c3ce71ab6222761adbf2c20132cd561519200d56beb54292d92407b3b81e0a9c0a49e33cbd6701338497032fd12b878a3810971a45047f2b6ef7d47646c4f0a9d216564caf69ef1dc91c3b7cf778006b8d9fb0b4b79480d21b66d23a5c491a153336008adaaa79d7b7121362c1e4150032bb38ce15eb4274538e4eb4a716535fe0f862cd38219611e417d41a7db40c62aa95552236cc3695510fc248e6821d6a5cf056f3a149b1ed33e43152546d5ebb3810f2008bdd28d49dda4b05de709120ad0b0c37b50b4b764a033fdb745a2b496c017d60e5eeb3736cebbf3d710620e48f51aaad7fbda4509610949c38f6c29a494a2737a7a6af31d0e1bb78aa0213ed1c0ab2d7f762a50a3a34a83196de351ac5f6059d717ecb3eab3f94971c433b6f8ad6a52b5eb8588710d831a3a2bebd355b186435235b9b00897356a211984582ae590a93556e3af88283b59fedd5a2e005e35de087d2e68ebb8f2a038050cc61a11cefe1a194b49d25b52f33bd5acb8525940d1f905b435951336b672c71afb319e4bfd38a0d03ab4a261387fbd54bf431c2b4061d1893b460bd16fe9661ea0fe0d8b0e56285ae413370ac3dd0578c0aa35c845e095f94f97c24390f389b358fbefb01102d5e89a8811e999b0a77d7edb976d3ee8f3a5d0bca265ecba10d903ba38746d466beb0d3228e8d94e9fd2c30b6964f780f53f2837612885aa5a9fbe09b674d01bc610d9c0424ccf0df1617caf23c69bf9c3350a802fbe3d21fc1d5a93178d3b9fc2f7fedac795003d522a8a4a99cd7c81f229f849d6769b8de77cfd988476188ce72f62c1057a952d68d724874ca550b3b9bb10e790da6d3065445e98252dbcc5ab32cf5702e09681354c0b76068c9db8b18131127b58530d13156a4af4d7d2f7c4029aa69f6514767687d5e9e430d5d7a624e833781bb9819752277f529314f26499f38918baf054b34810637ad8dfe7831c0673d70458aa85e759b2d4f855cbd5a5041d3dbe56a88e085559b95bbc49e0656d8a56e9a2211e2d7227875759b8ea93abab5161144221edfd425dd5361d33044479fce4bbcd5f4130617e8ac53c9d9af4f02c27be9e8643207b2508844445b9aea41942111ddad85330c6940b598bbfa1061084ea74e60c27e74aa3451c626be7f87072d1b7be809882c5b684a50ceba58e1c2a03321bf26697f833f"},
+    {"0000000000000000000000000000000000000000000000000000000000001357", "000617afffd9dce5be88e024370bab7ece4e5dbb9628ed3a3297d060afbf57737e3d61d52e3f321401a402991d8b79839e882d70403994a933b5960352d8df078ec9d2e111b776ecc374c68bd32871f9b1b0f10000c883e027c2dd28bea3945d894099c559fc37524634349d1c21a8114ba800643f19b50cbf6da0bd8b3218bd845b21fa442dec5dc32cf124d45203ab7d6b751a478536505582e976824450e025d4794684386d810a256ee7828553b93d38a55701cca4ae79f395c18327251ab984169001b70d333600741bb2997abfefbb3c37849daf9fc32bbab769c7a8d672828d75d7289c45a5867537195c6f230f968d4cb4857287e4761a900a346e0ca0a27927c60fa383de67af08efed4eee302025c543df9f98c1da90562addddc4d24d063736bc2f2f86ea30746b1bb808a3c469f229b569f811f1b5401b8de74b704bafbce494711758a68d4d4a9a629d02670a19e03a6c8df96760c6ed2ba94c7a193cd971217f75ccfb4a59468aefc4cd4be071913d214ca72c035ee4b8ba92f4d2b51762b9986364c60f379d03850aa7769e68c43f04fb54628c653f922654ed7cf1f50593c5d7f8022cf779ba317f6afff3155792536de929572d25ea5b7a29b462d414a1a88e7599704faa4915c107434d8813df0203c6f8c45420064a3a7e3e59227c5ee0750a5db155ee528afd9fd46cfa8378d20803791d9e3f8c8c727cbfd03d4703e044126b761d7e156f5a0fd1d4ff83c2db6256774084ab204db9dbb2417e86efda117b2978067440d24a07b1a94f51f35857255499002219f36de248d894e641cb31fc5ecf820a3dbc76845ed8d9c8bda15bcd588b2a235d985e568444cefe662cf93bf99f98c58c5646b6cdd07f27d723b419a1e95327b9695453b06a323b1105e9b5cba949288de4d361c19b40e856d2eabcee75f012bebd99004eb40314575b536ab2e2d6a55f86a4ee267ac88738d88d86fcd7464cf367e4741cb55a42e7775f9b5803f110924ea3e72f222db7cfe8d0719646035739df2fa442a3fad86d41e7c5699c7ff1c352c6ea5caf5504ecf67462e2dd5752a46a2ab4586daeda799d920c0e90747622d005474d4156f2a1456aa6181f1c3bef0677ae3cc31a43c7bbaa30b86d2f853938cd1626b51b994ec5c322fc7dab4774d9bcc29555f1fed4d50a0a613eaa8384bc10b88cc59fef6683b708a4be863a4ee7c5d9d6ac251bb8c4f590f9b32979f35c989e382a6fada31fe97bc38e2be67347daacbeee67ff62b13e6c5e44a6527293f1b5f54c34b42932d924d7a9620dfaffca500eccfb2c7dc0f4b31c7d1cddc012d48c2f23fdd90ed656ef607f14d815385bed65214e79b20f87c26abeddf0abcc0513d3de2bcdf2a6ee7c653f125bdd6f0b5d61b1ebf7e272afdf55c65d599394db01ef25b6adb939f5ee6f547e6825b1251fc390f95b1d3c237d1716f488b83936416c6687a632ecf970832a5f4362e71ec1234e06d5055873bd9a6cefbd171c7325e51ade2d4891f0370a19f256b7baaabefb6fb605903b783acd4361073d92c325340395bf2b54ebf13854a33f3d52de2b1592d72babfc359a55d613c6bf0e54f79d40d9114eda6164bbf4f114553cdc322bb410b0a307fc1306559c33656689cdae4fa13efe988402bba6cd6b83b15a697501fa82367baf10f2d936dd34dec6766b52cc6504131862c1ee7a46c25759f72a055dbaa66ba363fbe848c365eabcb151eb41173316678a2d8a516a08ad702559165764637e7783d51bbe19d04ad9e31caf3349e785753d751a755db299633b4372c7f2e891213cfb52f7a3ecd9ea4a45f6d5a2531c35d4aff1547169310851f81931bd1ac106774bc226c411756bb0cbf5916cc2f24be14cdd74a88baefd"},
+    {"0000000000000000000000000000000000000000000000000000000000000ed4", "00b210d686183ba3e140f22b31aeef34b74b5b7aa630351e5c844c7e776de14458867cce9b1cfcdefd0c047ca29390f14d19c6c6e12d358d195486c3455fca0825b1631ddada4d6e8e33ad1b4aa02187e9d8e6eb018e63f18e1300cab8ae512ac85fea652e4e6a2e60545b83aa6a19cb37295de7071b66b44df64c73d3d7030be0fb628856756569168620eb1a35d82036456b188deeaf8ab419a9e8c102a37075cf39ac9c57c01c043c352e263377adba73a3d73d2ccf79e3a7dfb8b917dc3d10af15f915dfd5b233f62e760a7cf1582f4117654f5a2b9439ebd092051136ef9b05b92270e6901923297181c8d209d1cb72ce216ce80d290a8ecbfa0add0bd4f79e91891c4ba1d391b504d0d385711fa915eaad436ea9e8cd54ba13e8804e757b1d81bcaa4925576dffcd6477f1cb8f137a0278c901bd2f0e1b4b5a3322e3ba1fe21b1e1b16da51ea07eafc0ab8962303dd63595f44c8b3b3d4310ab30b6b4554827e3bb0401e64aebc151ed5d591852df5d1d6619a8152c3730cb6ef26dea1e60158f201689ad4de4dc0004eabf911c8fc8874132375c2eca1e99a6c022212c7de88b70d4cb080da666abfaa5f5481decf9059a9d475d47313c25e965316aaa3684771c5e653b4dd67204e40081765a399200fb0f8f03e24ad3e7ea1796f3f1b1cdb1fe93eee08e0f489dd47c41cecd6e49dc978d21b530f0293f08d53957767a637af8b3e4346627af737e1168b8451b05960f53690a322d9fa46a9ef9a5bf475219c326ce15fb8a18f0c92ae792bd96d4e0632f2433c4df66e1df30c45c6cd044566d1ade598e7f98fb9105d69a8b2c9d5b9470ec4922dde7ec27c55bb40174395ab24bb5810c9a8dc345378b0ddd925a5cc9eb816adcbf7f311adc7fa8078b90446275e6afb1ab598335efc08a5956f37083416df393a45ede948d978c100f5e1922e02a9686dd9018b04a4b55213fd1b824d1a5bcc7cda1d79c19ca6031b4faa60d9739f18b1cf0a1a0a76995a2513611709fa9fd1f6571d34be1ef84d4b04d07ce2a7ab638fb651a03c2005c9e9f54fa6110718c4e158f300de0f53f4cc792bcd227bef0d79237d3a38f91eea7387564487b6b5e2e1d4201a2a801651ca2c4da34bdff3db1334e5546209708b54e23f358404739f6d1517784569fc3f53b8bab698b86d610539143c43c6522473fc730bc560435572bcf48f8f37c4b6250fa95d5d9af9f79a53f097c6d073bad86714b31d242f9cafd79afcb3e3f5594775ee7eb9ba80153ad5ec43cd7bd1f474627aeaca44e50978d21e640659313d741048cceedfc0ca0d24e6ccdd05ae248344017406efea9ca9ba350445c36b03a677fb3a38700a0ea30f65748efbfc99fa5300d48bff673adf6c771fac02d796e8ce23d8c9987c56de2502306f351d820888761c275e13196a78937a4eac3ef17ed46db0d0244875ce54cbf5474f11124cd71b84fda8bef3457e20929c883d9ae7acfda464c8604a3726e46398f67626a68feb47ca79dcb6e243e340210bd1994f0dd04f176f997d930af38f9f68e2d042e980c5da0d9969082f1399d01d6a1799c4fe235a013eea8ce1caabca7819d81bd0e564c0dd5481d43b1b694aa524da9fb9cd22b766b9d8252c939c871919fcdc71d2e258fa6c690db15e3a011349bb0ec2f6d180c657cefed5fd37cf1b1acc7200238daf5d07d24f87a3d449602878db420f730b45a3d06be7f68ae13442e5642b185f5e3b7c60ffec96bb5a3cdb231ae714e1e0e68293b0fcb56615b81119a7da075d0fa2e4d28e66ae8d4da24f426b184b969a3423307fbce042666cd0f6555949307d9819011edfcccb71ac83d43402a8af8c7e02ea763bd01a63cf95d89c3ce1e218e4a038df776e9b535abd64"},
+    {"0000000000000000000000000000000000000000000000000000000000003718", "00e2267ee3831153d2829094ad437a4cb96bb4dec017efefee40d496f5f67db7627178efaef6cebbf46d012c816701d892313e8da63e60f71ac9e784f217991416ce0117b367d7e60403d3403739b93e706a75510647d8590f4b0c4180e431f205efb901c96dbf44b32a50b6053955e679cc937347c99c9f72263ed75bbd092b372579def19b20926262845808158db32ef5021c95dc371e4e2ad89ad24b26d6f88012d4517c4fcc0253da36318d10a1c005816ffd9ed1693ae4d8285e25c9ac4ba174c971bfadc39aa956e48aaf27f5d39415072b92189d698b677c25e071f5b0b5995b78bc3426780cd31672debfbfeb32718a14296dd399ff68ea0d34be35fadefad3a98679326df84cf2a351fa613213f18688f51e5a2187311188bbf7197cd37353552a0f6e462aaf66cd3d4873b4738874c38b73053c3f61112af99bffde1ccd6ed3920176910cb38a995f596804acee4d6dced2d5fdd9c0ac60cd80daf0a7ff79c00e2a5311d3d195a1f337aa45b8d6eef2fe7f7d5c41104e2115da206be37082d6049038111dfbbc59ac7e13cc2c62dc9b2380fae1a1837bae437343119f44f604f22fab90d240d98cea8281a1a8f7236b519d4c194da4fe803fbd722fede8c66b65387a3ddabed3cc6713bcd44142896445597f58b908e38bf72183fce16819e92754ca0e675ef28ee62c174b25eaf26a79eb0008cb78f2704319971e5be14d52f8e88c6468f7842e36f74793539ec8d16113f720c85dfce6692db7e16a2248bdb74b5229d5479f15c3ffe321622462db17a6274935f2938ddf3f6d03352b1c605a9724e6fb32420a52d206e6f96a19f2fd411eeca0e3b09bc671646a236103f6301301975685226e92bb3118a2a8b981c8115c0f16d4d4626d3aedd3ad782898e11d645ce4652dcdde51f6a17463cd9f552f222ce3ee38c2b6a96e011269f0f71c851fb00050f5551bad6e37b39fafa1272dabf2eb25dc518fd349e32c5f84a7adaefd738c1399441106cf0a8ed01f364fe9d67f1a4aa5df7ea131d4b681a5e6346b711af7125be4d1120ae490ad4b05beeda0692193d7ac68a467b6e4397538293cbfe41d5fafc1178c5ac56dbc25c82c7638461eee9ca794105c9949518bfb98e09051f38cebffb71b26d8f5d220808c08024dae92a2d64423f6f3c9fa5dc83b863c101c88a1ca2c77997ad6e174613f85437710bca74e3bc9fc29e3f89ab1f30dc5a18e482bc5c6d8b3b8901d41cdf5355eec6138c912368648274cd6170a78a57083449734690d93923b37a5bb6a8079f01e77a28314ed1740ee6ac3fdf18bf3835e29e7f97d1a354cf2196b8fe12c22d02bfa31d2d9413dbb1ce9c3b08eb517e11a3552cdca9fff7691a2d29a75c07ce6f2717e1cd8db1627efebcdac256b281a63f02f8bfebfa0530157bfe4e2738887c90280410baa959469ca2f2f9210467a80ecd0f92b181552099f58b7dd5ebebe97760178003643c50aaf0cd21680595c64eaa9a5b75f500f97afc01528194dcf3ef397dcc6928e8d84d4ac641447090a34980f95f3cbd6c58ecee4beb4e41fb2722222f5497d5011e5b5ef443b4c5a4ebd59539bc9d429a6c2b09f24da31d21728e0b17e9c0707ed185f8e2f1196aec867744fe2cde85cad59915e99f0f62f800248d5f8bed239f3b1eb754d014993ae9f6bdbf4c60a516233fdcd1001b5d3521edaf50082add2fffb3f04722c135e9d1fc9a22a760afb7d992e44f07b30172d4729dcc293a3d9279b2411e7a84efb0b70dbae430c410b61fb50bbc5ca1b771079ce1159f8b7fb2d3c1648dffa7d1949a12ee236e4bc7b8a774ee7be26ce15f6164c692a93ebe3ca81c0a04c6b817c40ada83b328e62dedbdd08636a53a974aa6d2f6b119b7c2cd3"},
+    {"0000000000000000000000000000000000000000000000000000000000003d9d", "0013f9595ddb1757dbc7715fc9af27689f17061cf81107350bc6d54d1ee82497599851cbeb009e7b5ca2058467ff82d0cffaf605008c60796de20184b26fda0fcc01d3e1cb0ad38e8f8453b8361b6dac55dd23dc1b381fd5fd17bc9da1bbc24c03f23345bbea961c8a231bcb3d979eae5360494515a4d87a2752e8feef931cd01a3f4a9eb3eb5c52b3e65128fac11576d7971727aacada34db7f3f4f0e53909ca320caeb495c4513049a7fe9a5901a5994774296c34ac1556eb094201318b22f6ccc9ca405009e655737c73e016d80b513020dda2f90c8dc5e3b717e42e318eff05127f1526c4a53c7feb951f2562be1698aab8ed7f1cb320ddc2740098a3f17f20e3c71cbb4b5f0613580ca1a89f9c08b639c4d6425f5446baadb99ed2758e4668374dd140d12dcf1da791d95632eece3a048f4ef34fa8be85a0639d8f72dd8a46ba1f88684a071621a813e701f05e200fdb9b363515a12b6ca6693a25b103a423b5b20a102f1cfa62c4f4d5f9135c24a2b365981900458908503626bc229578ea6ec91f42fb4f2718def18de879203669c2f61de1e9976cb53501d3b0799cca216bfaa01cadbf00480dafe819cb65da139ff2dc5a11df73524e10b62274b416b19e1348da64afb99d38df90e831b9c251db7d0ebc8fce81384af3e6b3d360d5913b42d0f560c49ee47c5d83ac2e0917ed6b5c4e7155259027ed3b2d0e8115f778f52cd5475b1c52ee437ed4b208b6b3153a052f7240682db933d99f5032cd8991b23c5869e6171609faa8de38dadeaebf213017f9d34534e8d63552fc03dfeba7739e6ecb28e48dcd496e0099c45ca3d690be7ffcc920f0a402edd7b2498de461acb83af2f20b5a72bf2c2e3732cdea0bd61d704f80a213ffc1183b5df9ff7e47bb0aba08fa6289d61550ac7834b4c4ebdef82a481886514b328c7949788f4014e1fee5d0129eac988d03549c2f3b4df006e7a7e0a01192161148055668cf52f83bc25818fbd4e70fb1afcfaf6fec9c596522c52116c7f4ca2041051add82b0b8c6ef769dc93bd8165550a5bcd59869e333e3103eb46c2a7838b6cc537d8f631d3ca06ffb2583cbb06f0eef51ca711e15dc2f54ca0550b05c41c3ea10c1223c89bd65591b4decd11ee2e3fb11d1e4c9ee2641fdb1acdca932e7746e0c27d162facb5406118b1d801dcb0514454fe7139b021a50e22801133005dc4760e4a8ed20db4e5f1ba5e342bafb4ca35208a7466081162c9a4012c692db60ae17185d9f9bd19e30e16493ed695595de4c16bdae7c426e3ddb90b2a55fdacb5059f806d891acc3d4e76d08e1ceff9e4f6fe52cdc70a452e5cea92198d672a30ae41edb6a945feeb6c76175fd9371fe11985920db41059c5759650f777522718f447546491cf613b3db54795f97d13ab06ff5af201fd965696dc9a4985f0e1421b3d97dd47acb0bfe30dbd76fc6c4466087add510cfafec11a242674d7f611c03717890a8852b154014de75d582d9dbc93def33c95b24b86508c14c87ca40ccf57d0ddf28ad8d41205976d3e9272b04ff6f043db35b8d2de98f79d500f1bbbeb144f33497d9ed292ef2127b69ce793bf863132cae57bb4ce739b4588d4a00c717031933bb3889f3ec4e2de3ede4649d4b6c56f8a5d96f76df4fcfbae09607dbec68b2781fba6d390165d8c59508132d90e1f3282c24b0afbbecd3472752efc1cb9e3d73a8e691aad5402655852858714c87fd85a4d6ee20edc490c2e47ac4c9fe559c7ef8aa5fcf8eadfa2a70e7f24551fff61cb1e9c8459870bc497ec7b3a55fc12f57e9c234a74a5d212e54924ffe46fd14c093d5f44da59bf23a3c17358d41d1f00a4d833ea432ec670b1d9df3b5f1dbbe2d41985cf4eaf28d91ee5713edc82b83495"},
+    {"00000000000000000000000000000000000000000000000000000000000000a4", "00a0f3484914f2c3215661ee32b01b622e9e9273cb08e8d315319131b0b7bdc270cf2c98a15085b2f36010634ac03b4d4f45f46ac22bc93187019160d0702f25af860e77ce33a492459923eadc06cadf6fdd9242090abf00a25a560958b7b3dba24519691abd1aebd71d56842ec307c307ad5b43727a7e97714d171efd110a6ca95806325c9992f1726032379506d9541f261211ea26b26fc6aa259332428d821ae5db69cc5bf29c05c49f5004e753d76ea191de2e0f3e2dbc70511b2a2a719c02ffdc7ffd6ecd471073c63de60e4a1a8fa22831a77127536eb6b8012423736da7f5406577fd0440723ec3e23d8983f949c81485d59846b211385bf710cf93eefe968a772b8171e1a71cff757c6afb6b8217befce6d4ca207ecdc207c938fa95eeee0b9eac092153f74f611b0f4f9715fa0b2f597dd718affdb776245083c840d83c7359cd932b35b0bfbd0782344f5300e33d7143856ae12a6003d6b8e0007992698ee7245e3c13969731c07fbd2fd7d99ff3896e73fcff42680636c5bc007429a5d0a652e8bde3ec2304c219d08c1e34270b945b7955653996fba3d1e3fe9de13ac2f702e0e697cba54ef9d18b639fd32dea627ced966f9a1062b9545094746fc886c28f2a9f89d15e2d5c5dc81f0aa3f4e5de72570b2883daef766b555a0bdbcd3c9f712793d5b4c7c5de281a6c87e3f0c724effba7e006a09f8b6e15b387517773ea3fd894e9bc030f18934ceba2c0a7d3b6f5602aa8aba5487882fc3fd9bfc2156b92526f8705bff18c127da69eb9e5314a8f05dc2596aa55a3143486bd0476cdde5bf1a608ef750746105bf489891d0fd36785db3aacf479fb82e33f033550683aa8d0fcbf15f34376d36adfe4cee17d7c756b1745e20f6a9bbf4f1851474d3461aa92b23b38fce62048e6e4822c5e49753314c1e3f9617d66a47a59a900bfcd6b89f7407ff163e889c96599caae081989db1644b3583348b17c6487a3b9ac6fa005c48beed5d71419d1d335093640ce37648d73f4bb4a2119b68ec1263c2ddb6a5eafe5d39d78d035e7b51f07925972990b6618d942e5fba93fffa20cf2d3caf677c1377aac22fadc9505ca6882c076e370789e8ff6309817392412ac32f388a28dc19f99119b3b2f7745ec969297bc1b3f6eb347d843af6d09d4f7d6c8b8d9d04a506901078ce3c9f7e19521db45c14f758e60058ede1a7fed0a0f54d5d70cc37acb02b11795b91139eeb55afa6a0f1a0dc415c5c52dd4100298e1b609255ba6fc399057174f5de6f6b64fea73959901f15836a0e83a44e4117fa9957a4e4188e29d434833f6a0f6b7c59880c815dc7fce56f18a9bcdaaea4eb6711f03799fbf1e3d16175965d851af7bc7e703e832e7cf5586e558fe9328f6d3cf584be41790bfe71c72ce7b85fee7179f7b016f5dd587dafadfb2fa804423527cb0c679145053049f40a27c1299b7800443c0874e94ccf09ad49ade1ef65f69131b042de023128ca3419e2946139dfe7b2cea06d66d9ed0e9e026238d3af4ee51c7522ef18e05e307c2dd236781826f71dbfb106ba58563f260e11d334e689589beb3111263377afec3fd4e763bbc8644b5fc858e1fe63f024136d202635722f4797bd61c487d45a38b95b66fade7350b81ec3ff6a7ca7daea20351051711cf19a2fcfa04f34d3dc72950bbd255ee05a03f2614471c86c209154d72615459b418d7acdc31a33f3141d401eabd1d8793a74684ba575f9c01284d4d4e1b4ee83f414f8c569963528b330d5b39ad740ddd96d7e06ac64186ac41f0d5745aa198b4d248eb61dd15ba961d201f017459bcc67583ff66b05ee858136cddf43188d8318b233158ef5b0b38744969d0312d38a58ca30c074f7fab973857c4b5b7b2269dc051"},
+    {"0000000000000000000000000000000000000000000000000000000000002d03", "001b01791c29861fac40658af2c22511a9cf3f5d21061acc6d1b57d59d5ff08257903f5a3973e658a0fb09d1aa56405edb6ba6e5e3a853b7e2fb19eb7c6ae932b4ded5895bc432ebb9a4b6003f639e3787bf6c1100ce7ddd5f428bc7fa7f861b1ffd1cf2ed9d9f4d4146c57375f35748b914e018202c4a7452664c948d540ce80ab222a7c8ab40f182dd8840ce9d783378050741b8938ad89a85852ec284a20fea77e9cc2c921a3e0582585965c9a9efcfcbb587f05a1d5a27d0b51f281ebd6fabf4d5e09b814416e823c9980aa1475abe3211d667ca464718c32d4e613a2aaed98d11c8d18a3850c822a96655f9d589c79599bf36382e41a6d3b19107f39dae678a1a6fb8dd12f71d6be9f1c77c6f82b141d68a75aed8d979708145b8f2ca14e9dde559a18611453716d1eb3c9db45043ea637ff2b14a7baaac851a4abcdf2791f60b32f2339b92c6385f40991e9def003c533e0d076f21be15a2c0bacaa81e28e015d7bb069ac1052849f0f33911b3079c9a1c44eeaaf8bd7b0124de1faacd374b92add4de04c794a9a748113f233c169235615ecb2b97f9c67e9152d41bbe947f8c840211567aff550f97d11f241c1ac8d5e9847ef4725319dd88fc19d11b71ec19e85f82ccddd63c96d5d66406a5cbbb26d3ed05787540c9617e83b56bb6923aa61133df8a6716beb369a351c258a19864b87626beb40b6431694a25b563ce1aa0ce2f7729650f66f4e26e1a85ccd2b7ab247f84bbb372a5eb801924d52b6d11172c643a23ca447b713db7a3e53dccea4a243fd2381a2c0555b9d79c85e667f28f54f9689792147f0c1e1a53adc8e526a6c79daa82f21cc4e6c5eec910c2961ec08415bd53b5b5e890e6402275dc46b92399c5153c57f63c361261f37515a7b77a5e90230bea7db9ed431f4ce7841200cd54b1447afdac752740bf5aa78b003866fd56c248bffa3402a17fc8bab5221e3fee32013bd6ae2b274a2da2a162a40b564625ccf1f45dfb02a4f3e84894608dc5b53286e9e9fc98b799dd015515d95ae0bf6363e1e62694d7fdebe9aad41479ea90055831124d82dfced368d42cb2e523daba1dfb651a3b252578fe275ddb71b9944d27c20f5a27e11ec186138b6bf02e8a25a0672e643c9f58c2f1c5827e6ca11559c69ebf14cbe9e63e119801a9dde8f72fdf234400cd3c9de515df634cfc706de99114fd230a513f760cc51347d1581576c12d25149c416875e7fa1ef65d11b94fdc85049611a2703369b0fbdf393a54127ace12b6c57a35e6bb27e9b2859a1273e0ee0e3c3f7672064a912020c7bce9ee26142746d8018a4dc4d954313048f23380520b0192c3c70a7be26a3322605b81820d5b0278c9d9ccffcd1d66ad6b7831ca1d8695bcdd275e5b3a1a9013b35e8e92c9b5373b59bc3bf2fe32007dad87d603ece90737f7b8bcd0e3a2991db7b0240873860b58923190edfbfab8a5673e0373825ff7ae023fbb90bf825b30870c80e4a9a31539ba5cefa708034a64024815065d932f53593bc5ac9ea6887aeced0f886d904471fbdff00c5155c4fcae399ffbf55dad3231679372e97d73d65fbaaa36da64aef236385ba9118bdec5377046c3a163841b81fa4cc326c2fdb9ae23fc2238d5530d097e58e26ab79fdfed2389f8641d053ebc07352c9febaca0e1ba2c2af14d0e7a1b374822b05c9e929fb38b7cdd93efc3fd54594174f94eef0abd8369a287de09e4e8b1015b730011ba51b178a00c198dffbcccae9ae70d93b24fd6a68dd7e1dc7c8408c01f4d669456f731f1b667c4fe75fa08443057d00ae009f5c95eeba1e7b1e29fe628951a971679bbae1c30d0ffdc074c775679033c797720ba16a8327dd32b76618ecc1591b1e593d9c5556469177355bf6869"},
+    {"0000000000000000000000000000000000000000000000000000000000000ba5", "0084253538de5f112ab556c7543e759a170039e61b248352d419a55a4bce3ce68030d28af21e0d9fd9c31a71ef908d499222d34b360d23f0e13203699a60e9358e0a856752d0f19732fb60b26c38cb2ce73e410e08795745ae6f3a89da3c50989689db5f27fb9cb92d36dee44351ec1307d7fb86129b3372cf8495fc2a830c032f0e210f1f9dab9741103832d1d9c7a793756b143222e709140b69b99d83b908d261c331c25a88c601d2ac48d9c8d4dc8717803aa7c336974d4f5ebf1b076fcf47a5eb2779f93cf1b1ed4da09d2d858b16102642295761dc41e3568f34b9b2c0b7562d9c93aa729915d7444f6a660b57dc6a055d5f8eff087a987d3621baf2d5350e57db98010981f84ff976899cde7ec6328801a045d191eef8cac4ab8978f41dfc039c2ffa3e279ddd769c37c951c534b00ce3ec6640087697b76b35a75f2adf32dbd026bc790c73677753a53b0f6e013b28b36e5b6875b3785363fc7a0a054ea17668c41de19362ac9f9dfb3ced4448a842484aba7edef981149073118a646b79e3ae11939b1c910da9f13f63af1650853cd56b96697dabc1b1c8f1f3326faf53ae9508937078b007d116620088169effc0aea3005c723220ceae62706bb1879d31a243162a9ab562381d83b20a7ba37de827922bce04f2cc43a8482df2e9fbdf9226de9bde981f13c1bfbad42174fd8911d959fc13f40163b28ae192ffff999b901e3aa0c7b82d4ce4fcec10d4db119ddcf3d5d49613d0c7c55db7932c3f916d09a550de21a98e7fe729213aafcae03577e08d17e022648f68d4917e9b343a63319ce03b29e4697934db083790cf9e0f49c5f0dfe1cb01c09192d77dddf35e4c960784d9db3b0357b457f8c25c520e36a138627508d545b52d978f81b59db63028c38e0a40d933e80929d8fc01b4693a7dc6a5530648c32e7647ccfd62a40372924e36dfa77fa3acd20e2a42d574a20615cb7819d061137394350dc0b4451db8b9681f6fe27efd7c0868a397dc49d1e566a1522670fdb3598b8835b2fd4457c23e9df120a3edc1d76cbceaba7afd03f83eaf1a7a39c0fd3927bfda4a13beda27958d2cd36e391859f353c91a259ddd61e9bb04fdfbdaa2d6673d9f6c3209ff79481e3e638ea973e0d7d77d6960cd19b31d37862edbabf8793dd4c3e62b6c6717a1a108796c210459e92e700fc8278feef34fb1ef053746023ecd8d0d41107fba1ba921888dd1388ea193e2f156db092d166f8bad940a4f5489f8e60875e949e99f811d9714311fdfa49b13f185438e99c1e6792a07a5d83eed8a130c1db5d7d57c10fdc8f2e62645ed28fc27f64b15195964632152c955656c32a283616e013883e9def526dccaa8fa54e415cdc7368f38dc423e2b1ff297d953190d45eea4aab5adc0f93fb4e2eaee5908fc7f5a0605bbb5485cf0e3ea58536d3474c5f5ee57f86c684a8c16d4d5234d23ac5936f54cf8e44a09145b831425933fe28620998db520e8c027fed3627118d57fa82e4e83b5d30cc85be5b868b133d2e2f29d1c18baea198df7d4e86f2445e237c1bbc98e73b8c60ca87f7743acb3e6b472a269ab8c251ce0e322cb5b10bf75601ef896e951e17cf9256758d06665d04eaa1e9847c12338abae401ae539ac35e2ab9cffd6c986823c2b630884ed28cd8378c62b8835c23cdd99b9a26fd2c4731cda744270e5ff95dc97755a566d25f5a391b6f07d222acd9bffd572ccd8cf0535a27da96d92a3b2235825df6a7b09d96a99e99128f1af72f9436c945d1fdb08c4e638081069b7e1d396a4bdb65a8a9f965ae37c2accb7df552ed5cbdbd9c4a4edbc32ad41f5f2665309d8b97e4623ac9f6c6a40dfa864a0c90b6f5fc41c238e273179676f41c94c750eeb4695624ddfb967a8"},
+    {"00000000000000000000000000000000000000000000000000000000000008ab", "0078683e3e9e738dabf610672e7e03f8280ac7c5c9401285ccbde1481bc7dc3c9bf3feacbf65057b9c2a3238f3b50d6e9eed9fb38736a1c58db6b3b83f2a8560c94c497ae517355661070eb34c129a4db03274d6035d44c6c4de8957c919a7b8ce78daeaff6c9f0e7f2b075ba0dd4d7727473cc2efcd51eb9f4a8e1e5ec305fcd31d7ec184dde8afb132d9632ef92ac2164ce90799c109d8058f3d61de961799d7d0dac6207fb782008ed49df8852faadbf9d58f0232b45ea8c41ddfab10b506559bd3becf5299b338307f016d926b394ba2069337c2c9666659f7cf02b4f4411379ae5171049127597a686f923ee1c55965f003de99028b13d9ac2a04711e4e1ee6895b42fe03f4e439d5ab2a111ee08c0ebf7b86261554bdc8f7f4372ecc16b94c8d13f7ed0d3987febbc5c1bb6e510576bac92c4315bcfd9a761be512cdab1b1ddbdc96532ddb43b011a1adda09cc0136dbf6da6235fb335767a85e6ce0930b78bf002908250c824b8cf472874dd1ec9fdefbb9fefe54bd8e0342d2dcfd11b900bb1a827c6545e11cd985d3aefd0dc5c1234c8989754d6f08fe1fe8e4ca993b1b378102493e8462f01609d20530c73d492fc92851db0db559e08f9b59a590c78edcb637c4e81a3e4905f4fabd0c054d7d7118abbbce02e1f09392936d40bfffad0529a1daec115053318f33d51085df49aeadcf15ca26083676137c0568c2520eb346502772fdd8b55ab3d3376ec2f7d6a39f6dfc5e9492bee7930e0ac8b3c91609fd62c20b84fdc2366fe16544f0df0859f73d35b0172cae239bdf42b31cd362865b45177e8e5a9fab9309bb99a19fc898630f04327c4f5899925f9c157c224e87cf5c12ee84edfa7105de185e9a65f2679cac972236e670f3d8df257e431b1329702bbef5927f1b0932422d2b9a28b579ad6583dfe7344ea92bf27530d60313868ced554588b001f15deb9251ecce4e7cf7322043316ee04c3dc13e0ee2eef44f909a84e73c365911c9510d7776021fcb1d25f03e69c462c0c69bfc061d5e56337f0f4463750d03f520be195a346b3a166d0d0713d248962ef9a01673537dc1f318f8c7c930413e6653ad899e459d22d6f71da9ce2c2dd961151f112acb45d97f2175c180bb081ee768243f73481e929b65823b8b8faf34097fb448753961bc766baa1ceacf09750d4ba5e1ab9f4c5a338595352f014ce9fbfe2f0aaf86ac4be52f69cf33315313bfcfc257f434e89f0eb680a776124d6d0b65a186f738fe0482e729742013a4751d6f07150af8c632736a9b174b547a3fefdf15f68b8e345c5c1d429761c66e37f5cdd945544af73c60ef3a7ddb7535af07a4e0725dc336260bde72c71c37f473e18e92d7d53fe58d0e5d968aa14c96034b1ce0e49bfe9e48317728bb340a7b3e5ef4e437dcec04c66bdc5aad383bdb7c1050759b32b8c21cd4374b39b8631712366c0bc83ba623286b2331ed2bbc8ac216b5727c3a550f58efc1035f5ba9759cf112d70bca4a3c5f682ad63277024284d8f4eecfb9cb537ba85404c9b6c61107b84d82213571c23f505d9c894fb2510e3dfc600ed2ead99054a173ff98c888b55ed44a0b085798a50f4e0249c64961a0ba21e4cdc46ef8092779e2cca722721571ae77e842cc62535a7e72f42b3008275931b77835f1c59e1bd144effb3b8f5cfdd4f7088964c7db54e7f1e3b272b6d0ff7d88b6a7e9221d3a20c26dc4d09561ce26344eb6755803408b5aa3b075d34fe6cfb1385de1802a67cffb8aa38e713e18760cbadab3bd1c2f9954a9715d9fa2b76a7393fe65f61f6ae5ac9d20883d268f49fd98d50d3b118f9fbfa84c03aa8c05a1f18de3a3a648696184ad98305ecb0759684bf6be1b6951bc3d98c07b6258eaf9849e27af"},
+    {"0000000000000000000000000000000000000000000000000000000000000b98", "0191ccfa9d67dde9e6e144d8e045df95bc5df8f8d913bc09a21b9da2e7996901c781b48dc3273dbbe41b0c7a3c6cf188610173c0a1b50e3b353d302b4ef2b32962af06a5a710d7ab6036d3fe68ed7362c61e6444038e0793479b9def96e7570e3b69c83a99ae1a41dd0e22c55a8659b68daf2dc10b71f7a63998fa9782270ca7254128d23a729693e49f50aed3abb8047f392f1b244d486bce7bf1ab0e02877e6393bce78209ef4f0645e4cdaf5c775d24be0201a5d4acd5df0034baff36e31a7eb74f0914df2463798fc2cb96c99dbb22241f2b9ad90d8d7a553aff234a8f23d9ace9baf040c11f4bc4a91ba10485932aa66f3cd67adab569d994630b5f4b094aacdea57913d2ea656a3e1a98825829a03e793e841b588ea6e954b422ee573d2a6c27d4fea41bba7ee6384c4ee7cc1332eaa4de877b3af49f18671c372116e48b72995b8bd25eb2381ae5ab202dadf20338bbf8c491c6eb024c624d73bf6e6ec106bd898c12dda4da6064466d8408623eb1624be0d32cf44ed31589856fc7c85babbc8eb3288544554eb570db155444d4f2717962a87519f2761dff70d1fa5a089a2829052c7f048a8324a4901f74c1ccc878fa3e42f75fb70b6d78df8bb93227e7240ac446fa299f0e1758b8190d905952b92078d3bd6c3479cd75edc1c6444fc4a81544d559460558f1715bb18dcf254f15892e1bb6c70ce376e7fd930ae0a519023f674238c25ddfd376e71533117c2d4a9a71ddb44406f32f030d5521fa8a2827109231845a8dc70c05e4ee77d253e1fe6a9e191136b16513f91ed5a75d7bf3e19633fa3df54c3d9a91123db977e8d98fe78e94e48bba740e7e2dd0fd45ae171c5663c2cda71a85adea095aea6fd3f6075fda9b144940cefdb3eeabe3d0533133cb9c2b1e6fff0b881de876dd5b258373b3a3e4723feb5349ac04b1bc11028132dee0e2f7014ff502282c11d21a8a82566fc122d87be6a9d0c1913732c2f70b3f55bdaedc16e8f006236fe315d53e11bed1845d14c5e57a0df474679341d7cda1357b33ebe6ae9c5b9d6ec98b8d8a5edf9b03b48069a2b3d7cbbe5080eaafa53892a444b962d905d332f54a81f37270f0d448f739ba36214d1da52f21280520e5dbb497003536f0e4da089b65aefc3e8230319443135e57c766225cd6d668f5db61161ea5b206d9245c89e3de639a17e65ea671aff63b63fe169f115082690a0504c518fc21b3363e4d648f4e47918707d8ab013303e9883e4e6280b0ee2ec0fbc978b2dd198aae8f71d7e223dbf643cb7bb97a72155f5f277e07f2290d48cd759d2fba7a1c7663d37af447fa35a73797eb4843eaf309a1b6159957ba8bff75049bb0230c8f5760df859c6e52a122ebb4508909b15d558b821dae776b65505d291492354de9b6872d84cfd4f9d406701e47d58b116965cf92374eca417902827a5b801b3917c9098e3635785b8261ddf79c50f2e45d23ad11d16a5cc8567e8376a4d1b3c7f5a82c9a8bb80c7a60e7e453392632d9f4737622df74475dd9ad33b36407156880ec14d3ffb60882e7942a7cea9cd89a3cbb3aad351e26d18d22d7e9043d98d14f3ab90bf69b612794a22faacb5534a987138acab9e9e92b955f9c503a975ec71da87717a1ab74d4a3607b7d77fa4ca1be08562f188fe0938f6279213afcb98598817ccea7675e9cfea57e57daffab430753c6432aeeb2347e792e1e5a6a42b7e0d9715e5432e2a74295116220f86cb42b413770cb5f3cf756cc84c9a3d6ffc6ac61f69f4411bec7f0725583f5171e634818ce2099753cb4a7b2230ec40d21df63d3d15ba33aeed945bab5d3d6948c211c2b132d6254e52879565890e33012fb67bd23f4296da6eb660b70011c6775b096422fdeb006b7b8ef"},
+    {"0000000000000000000000000000000000000000000000000000000000001f85", "0006523a496062e91bf9c3e6e07878b525bfa9e4582ea8fe2e7c10432bcabd97c3b25d35db64da7cb3280ca4a499eecba8e969e4358547458d9623ef7ee7191504ef48a3a4af3143a851faf39e4361763baec4c700ce15b79d8c93711e8900f1b64e111c7605168fbd0a65e48a19cb30f52a8db377fc73700a2a2379e5bc1a6b9977a91a12412e427563a3b45ed373f79d933c2193465cf11d22f19a1346347d62e2a26cfadf9cc3000ac97e74829767fa9a108a049fbe1d8e69382f120b6d290b5453b301def0f5bbd0f640f1882874f7e519d4915e3f8ea1767618d4e43076294e5c713495055939ffa71218b77d279ac7b1d25a02ce887818eccc03e07625c9d7ef34d8f85460cbedc5ad48b9af804845d9bf7fae9d9a1b4bb61599d4bf58b9fc9f5c124406078424491f413bd171e12d35ec39ff2715ffdf2267495bf584f4fe8dc22a67a01d41d049e98dfd635a0103bf056e61b187b08b2515e14aff6a21fc7e67aa1d176bc6704ff9f1f4b79433e642a54938807db0af0d7ece76e98d6629054e664dba4cdb49f376563f102bed02941c69cb357c22a6f52a6bbe4fe7d61ff1580985ec2cc6c8f0b99a4a819c961d6cdc81ab7aa41a0e4c017bf8bb5db5eb66256e2bd012b18245b7a3a50b611c7d2ed32497d8e142e03060a12d6e51f14afc0baa57da69cfff8b804c01b3bffabf4784ffdd2eed0ab72cbf2bd5eab4c8c5c4e40f30d1916bbf8d9f4927b19af49ecb842d4f288308582bd03226d2dd69751eefff2b772dff1b9390a25eb5acad59c8050f5ca21fe4fa1444e8e2d19de6238a7232394de96b55d1250b6cea8546052d6f96e91281715a4456297b79ddcf16139e87c411832d292914012b3a19d679e8bfe66f1f89f1920967c91b4270e2234e7774ae034974be40355f1efbbc12435afe9073d1c3b693610e90af1902000a1b493eea05455c71315fc4722256d96c5fb8d0085dc8aa58a70e45fa78c5db94b347366fbd3c999907f62b500d058df3dc9d61b6ef45b81e322d3485000dba3f4e92966042f4891176f56061f4619731773008346eb37ddad6170b08f40fe5755df384b0bdb4f614be5b8b0b52fff69eea733621401ec4daf63b68d014e58775b0cea898ad5751f3b47c9cb5cf4c4ed9386cdd4b891f671fadc671785462634beac6fef7cf0f0609022e47a3466bf793b8ccf860f1de6be17917f50ee817715504db079230d49b3cdf7236d79e5b00b50920112add9a391159ee43c1592de2f315e09be36e21c15c1d2bb07d9be64f3a865be0163b820d3e5c1b0970fc212205755c3cff1168051e2d70890a8c5bb85ca5667d859936992eb017786ff491d70c665a52ea1bc4f9f4198f23968011f3cad7b6f8a1455390c0ac25ad3d43a1de749927288ae72af0a48ad0fc9929c2032e49ab81472457aff7f2fbd29ef6d5cd4895932c17d85a741f87b486db2c95394f74c4ca6df4b373b11326bf048aa2d7537c34c58e4b70177e596b99387a1e2421a40f69c975ad9643cd81213a85b3eb3dae22067885f530ab72d9b982027bd7a85eb604f9d684f54c6993b31a6e125fc8bf262ab765bdc362761bdfbd1fe70caa430fbf77793802cc279ced84c85768fea932c0ce3a53cf6beda01624524f5ff6ffadd2de7dcd03b7b2c0c11fe07dad9b0420b250a85efd09bfe39d0c5cf8a2da87bbaded97011c1479117ca964f4196e044f0eea548339c1efbd71e98758b82db0241ca96c4110d5d988254d19f4a4748126efc90a0762bf193214389b77eee560ef58b1622a20cab630af8e6f027b2c8c6fe6cd58bcf1caabd8e8ee708b9a9dacd8100f1b7773db08a6713fc9dc01febf7a8948b83b5ca74c32d57f12a9b5ee77d808f4e455537bf9d8d69731ab"},
+    {"0000000000000000000000000000000000000000000000000000000000000a65", "002a908ea8a042d1102da06927d821d44b39cf3a862da4da0e999a805ef49148dce3d077ef0dbffd176608450a6f8c4ce488847e08420a6e6ac7384e7d49dc2294d9c29349bf89a52f45cc7f667805e167dd9f7c0e39c0a1d691000cfeb5325a2dc6a2532a89b9a3c714ddf8dcc1a934b175a9f83a9861335f33b17b31db1ab49269cfb32629a659849c905395f31352de58124ee68e1c1269be71cb0de5fe063a9fbe68efd6e69a0103202d9904f258323ea8b79e4ddb9e75197f43fc0d4b05f2e8a642815ec53630cde9b126d3e9fb77b70beeff8001c7c2070ecd7300e3f8eb99004cf352201766e69cbb2289af90583786aff70d8a4d5d7bb39502c63a9c3a2c64e98eba50752ebbcc1c8c49fb4cb3079b8a2eda648399ee49e86636634a36d9399e70780664ed810809fd8166357277067b9421ca611fdd4b0742565fc4315c4dd0f8d37450bf4fa9caba18d71a005f197e176362b589a32277dd32917525eefd93d5203a252cd44c024dc8c22413c1ca6eae3441f5315b00f52d37eb01197c4bc1617ac064e661a1be7dc29e2162fb001965d1b135bcf7a55a7f23860dde17e4980a1fef24502f7103885d416ee9933c6d92787bb4d0323992f452950106acf074f1fef5c4121ea6bbf5eb20da24b1d19e78198594545286d67eee81863e95522d603dff9b27053ff7cfb7bd116061ab841eff9a3d06dce5f711132559a65ec4b9bab2f611436cd084261f376301ddcc21f5632df20b2d4624bcf1c3a9db221aca541f5ee747179b6565d784c92b3a73eb9b9ab3253d2241220c7fb4aeb6a43101271b49888b53ec0312864cea91a25ba576fda2146720bcaaa5f917944c448cbf6689a07e89828a55db6d39f6075353dd6fb42cfb3f6677cb6ed9841c33f01b582c1f2fb7fddd9d30da36b8b1165068ebc214ad76a82aa308149c1590004b9f6b114a03dae0bff2616c276e2ccb0d5bd884239f5e0da69f448be12fc26f10595aeefc82bb19c901afb7d2864f157ea19b408c803c1ca60ab2f2a8d1107a7a944825bc1f525ee240125664ab4cc3fcab5301204be6114e73368c80221cb154b26b85ecfe4e442b14c556a19b58f50fdcc7b427c926c67ad7950c310f983b8509a9cc1183e7833402fc5e6d603b707716525f5e5efee3271bad28b54c2b648d7f809a9d06f501c099fc3781e5fe4c95d1ad6b2c171c7b027a5cce1fa91eae8a5925f5b90e72ea6b659f3d2f1277c7cd023500ffb520fa5b7a66b4755771379e45df3fd1d64cc7a570b3e821c34fec14e9ef57987e96d5dda1c810db2e37d785894b0678675a00e8bebe6f6fb70dbd1cc1cf5eb1de297912a99560e5f2cbd7c9669fb75b1502aabecd7324d3e4485406ae5c31656bcaf8c0e44366d289c79f1527100be5d7ab379ffa0e0439661904f0764a860d8994fd8479e9d7d97eeeb725de3ceb1ae338e413a1b341ca47a36d595384897e9e78b0e018835b7ae2c6cab83f222389dcef596936cd19ce47573adea1d7eac72bc71ea5b569d0ae99f23d3753b00c6be5fd61acb463c68e5364a02eda916c7c543b75176de7157f1d82fefd62923ec4795f720aa213a4ce10cade890f1333549f65a426c53bf1c5f8fe995c4b3a1c97e58fda648312ffe7cef4edb92a5eecb6ee6309c027411f8ea0fe866693029ca68462fc48bca50217189c947f5f3d93532432beaba80020e1c14f22f820e75b2a78cdec10f4816694d5d41d3e9a7c7c672b3f76c47144a7a279685ac792fdf24322903e9bc8eb162dc1fbe954c90cfa4164ef9273ac6af79c782ae560089781f8f39f7bb48bd8fdf7d0d327c1a0dfa4c2177c83f2ebd042a3aef6e336dec062cdaf36f6cacb1c59dd1487a3e11364d442d3613468b8ce537393be"},
+    {"00000000000000000000000000000000000000000000000000000000000001e0", "0019884ee8a0fc475b35817b1e9f98a12961fd1783238a62f800d7b82739f8c71642ded05e0519bf941f246983199d157574ef2d124ef7be1f7960850b13893e079fd3a0eb2ec782c56500c3f84caf987b9e150302e25bd9eb47e9ee5c4362e34ec2b50a45179ff67e059e4130334bb88dd76041188e5e4069865a56068e03fca6c8a0e083fdecc012d4f06422559ec7fa5d5507bc5a190a93222710f41284fa5096960c709e0cb1118b870ea1d4be53e059f3782656a621822f5b8033222c1749bb64e337477694baf6489ed3019c3c08b514888250fa4dcc3f4772588c0773db2a715d7be4c33fe75c4dd49d9cdf345b69494979ab7f1734df9f71123b09c916d08fc7b5dab1289d125e0481cde8c0e827a64c268255ddd50c5164a336e84ff66ef7feb1ff19c86d91fdd408bdb5dd03389a616fa1a278198a491c1bc1877b1b68ff6f7ff2544823b1918f483db6ae043ca8c91b92b9d5f50dd19671f70b89129d1cb94b05d2ead1ad054caba0df0460a1c1ec02e8f71b1116266ba1ab6d8b8007ccdf42b34eea361b4e04ddaec42bb29edbcfe4bd7137851339d79be7f74014fac5e609eced7c008f5b09d5dcc2dc2dd0f9aebe395808c038d53285c41ce11d317a14c425d3a7f2bf1a9a8b2f2d3826f8661d9a12ed87f2e39eadaa24fcf2d7ed5438088bdd9c24960dfe41d8c649cb554b36411a9bd20533971cd46b7f0be1a1016516f50a83a00b9d06e36f7b86d5d97143ddd389cc8c95e58c0f656d3e68930d44e3ad7391ffeca345326bff2f122615549f31ef37bd734b19325463c8cd94fc75dcb1ddbe209934ee101df2fbfeae0a1f9e944211a21f41e8b4ebb266b74cbb4493eb9d8a21cc0fe8b0f0eae82274585936e41362a3dd116f6733f28521aaaee40740bc370e1ffc258739794ea196dbd51245dd5c4111edc0843818d5002fe2df9d178c33c458424f111625b131bdf8cbd300316fa7b19e2a2f6d02a1bc1c1beedee5cf9af596060c6adc8e5e47a32c20c1bd0d18cfe5f0afda6feb097d2ef7a6cad5931ea560d7d7beb82a137478ad8b0670d8f424188973e0e1c5497bfd18d674e71516d62be6c9795a6cd9879ac666a0c2c56686093e7201c9123fd5126d3ddb49fd8082bd1fbdbc52c38eda38a73cc37a01f814eb95619a6415e6b33a4277061adae703bd4483d1dc0de7edf3346e7ee4553768363dc18b1a3d216aea599a992a82c844e4649ed6da8e7d454609dbeec6b8d412231dd8416e756062c171ab7a65a2239f2c31fc5c87dd5a5ee5de6d542acd8ef3178a200437f2cfbf0f4fb76872b11e79b8e1b4c69a93c8d3093caf4c1d71e9eba08963627cb63685176e5faa8c0bd0395e3c97e612fba0a14d5def6d9d74f98e08d029c84d9e9a35f037ff8bc2fd45eb3961c5f05a444100f0cddc0dd62c86f002647dc6baa869ce5efa72b12494a6c71329769f923a232971700b1dc867908bcf11246e496c9e95fb1c7783a7d93189556d5e136d0f2a2e6fbd3ff59dcfc3db22ed69c873d51f7aedf7dc0768ace4391460c11afe1148f8e2db70a3e333231217abe29303de9ab5dc48c17eecd6f5973f315d61b50b06a0fa544471e49ffac22dd56bfcaf1daf9b895a0edb03f6e0654187f05901eccd95589221a6b6c989069174f8460bfacd3617e322ca1aeb1d10bd68a1210c4b7c6bb49452ab84b6443e7e41f2d21b649a67d70ca34ceefbb7c7cff361f26d46956932cb2b1ee8993ddd442e6b12d45eb8d50453532534fd4f0a58e57c17a1bb5371dd86f98c5a048f2b6dbad14a3a745c1e1afdcbc17a10dbf5c91c522cff6d0cfa20deba878318092d1eb4f79d97bd3233888aaaad433c949d9e7b1a0d5f12e8676377cc8cd1a97c32cdfdd6dc9067b1"},
+    {"0000000000000000000000000000000000000000000000000000000000000a2a", "002098293c21b2afafe052ad2ac3280d2fd75ea6300800ec336c981c77002cf200b3cddb6706597c5bb51f9379a383c8ea628b3893642153ca19ebe45eea4f4b315dad3ad5cfefc2f1668f9d717345aa681370e612d09c884f2c0f11c3ba249bb7c47dbb7caffcb29725b315921b2ff11f8675c459787c1c7efb33b9b6841345811784a1b21dbd133207daf652b117a18ca1253a2d953c7d19506917b0e77f16f0c61efa5318eeb8012a03db979aafa9aca568db25e3927a6eed3bd16901547fc7822f8aedc57623bd97adbe396e3b99ec7324662595f3cbc941673e26c49e528a069bec9f939e39ae97ce9cf02a01ca20d5dcc05ddf8fa36eddc9400882a424fb9981f3bdba3382efbab49d042a0ec5950e363c3a0c16c911b06c72a706cbd9f115fd7a4d0d2b017c9a04a290652f0d237e386a5b09bb5e58eb4e376a4d3149a106935ab01920c37949ba868b591045027244c960423012c9c630c6d3f13399b0975a1b503b5dd52190e25b7b3332a707133d17567507fea39403d945722e063f6ac21e10956554084a1a90d816404b994c9c6be197af8578157e23b283bdd7037c9946142b6f0d519bbf73f05e018f2b4f36192f70b9477219627c9e7d479c037c01f19bc132f98472b34d02e01c875a21dedd5af1423e11eefb2d67a1a704bb2ecc8ff65dd326ae4fc5ae748bca536f1d67795d9eac8c03fc18d34474ec07abc82185a48c8478df33d1b0bb28e35bf180cd36388d2f95ee7fc6a672589b56cd970dbb4e2f558d87e5a086d4229273030ddf8eb6067127e057cc12746869ee8095959450541efcf79ed1e104b45b4662c168b9685993938527b73e72fa988e7e10720180b525d77fd14281c80c67378cb83ad0cc380b60d983a708704bcc0302d954746c418169b1769b42de5c449ae123fb2023a4cd33f3397f1990da25610170d591b2993e679ded84388f40e9b5cbed178cf31a6abc88a655c8f374ef239ab3757a498b2e1a1ffb089f82c48bae0b659699221407a8e0a4cd30f6fa642c58cc164f0d0a3eaca112daef7ee3ccc675088796113d6e9ce38b655ef57964bff5c2105ba08f7f807733e747b51e97c7799960441d793468726cc2788b211806bda7a4e03c837c7d3594c841b069d8955b5a2f35a71b9cf1ce1770d26616e895f65b626917dfcaf2033da7e7c2d47c78e926e0f0d84a97ad5cecb986672442d9b2d8a94d3578a7d2ee56bceaecbf66bef3fe0c6ab878a0f0ca89d1ebb19eff1079cd48a33a2d680ef0de49181472578ade64fda5c4dfb70b455ac6cb11f3cfc67ed87d45308e31429e5113292d36785210299101ad215190029cd192a1c4e92cf0e0532bdd7e174dcc9a29d1f7c739cd33ca7e6d4b52430dbff50d1bfe41a22421ef9d7ae4747cb934962dee2d112b950678d6cfd28947868b84027681e2eb86baf35b5126070483adb8ce6ae32f8ec301cc7977a25feef877b406dc2dc7bfb9b907fda405fdaacf6bc6b5643b9e4d1d44ffb75a750847d2f2b433b2ee00f6faa63bddbf06a14ed775c581a2ff5a494685697f92d12ad92fd21a699ecec1c9c3a3acbb7555cb75617d5cb77b7d4919d0c24c5a5d1ed93f48e58770ae9d5624fdfcbdfb2146c42ef9777be1f83c08f6997a795b60065babe0069d1cdd3a556dc3fa7f30dbfd67ff206e00d61b7421395ab72669863dac5b6391594aaffdcc849f5fb413e4f8c38b0b77e77050c41105571b520dbad9e3201f3afd20940d0f34d64da3f78f3b010923a372f4160be63f296aee560185d6f2de56c5bcc1baefbcfae0128bee7d182ddd85d05612523076d7551f4c774637134a618c6ce621ab644ac33c6dc7996d373ddaee7a4bb6ad2c91a4f2a1c6640515af335cade400f6e8f1"},
+    {"0000000000000000000000000000000000000000000000000000000000001b0b", "003242e09e94e78b29be96cc5b67ed0775373efa15482e2d90706d5d63c0cb853344b3c6a190de5395e200bdc6f56270ccfdb36873a95871941987f50d6dda18153d3b31567efcfaf1657ab2e8b62b2d99b9f5d7065f099334f31133ad06e22d1c17c601144aef204f0bd36f151288de93b0c7c56e8ffc9b9961e26ec6230c7f1eff814bf2abee2074988d267baa7985dc59a010905ff367903782f286e58d922fe199e8c83fb1190304a87687ca4e75d6dc2811604b6c9647ad766a503919afe7ce62ed57485b060f00df1076eb3f5c1b520519039f7210f6d782d1f3a9feb5a9f18e2c1f6013354f0b7a03de2301152583804f76a8a0f37e489dc5046fcacaf5a88fdb7dbd93635d2cb73288bb786c9708bb7a59f2a274fb9c15878a3565423e83a63d26150e259ddbd1f26ed1e178542c05fc6445b094fdb665178a7992dfb06829dffa96a6c270cbaa43f8b9904a012417a7bc1777e55fc2a060552e53adc8c49553aa02b5fe718fc4905944fba8596be4cc66efd0ba6e39125b092b3704ed5e8d7ec3b0d4c4d4667d8d59328f2cd38256da721525d91ec2d67d5374d97b309978e50221f98290728e219e5ce1c42fbf0b896cfd1258573bbf454a91cfe8338e7ec80480ef7462562956a5b202c9f6dd0c45d2269908952db4c6f48685b8fea3c62890594bb6924d19a3c3f7a414dbdddaf8f298a58403e7ed273622fc6b28cbf0eaec39c796781f795755125243d6886f706bd23181919861c81d72ba73e5dc09866166df1f9819056294e88cad9d560bbb75e2b874e9d450b53320d1bee6f8ace55c305a7b6ddb0e2b0fc9132b3b4c99e6c796c1bee31a9ebe95171e28ec36df9d3df3718d6bbd0fd406cfbffca1a1ea36193e2589cda3e3f025c9849403a72fa261e102054eac4642dadca69ca67a5beab9d59de7cb4902d8a79a0500012c19d097522321d0a1e3f210b9e5f55a2a8d38e01bf973d409140706db1161d72f75e33230ce1a5b452831f18892de588b3185c61a0fd4aa5a780b79bf9437b5439c6e530a5ab18a93dd05ccaeb553dbb76a2b02582e9af08a2bcfba8050cc6475981a53aeb7d4010b3b78c6cb8f69a79b5e030ad7d5ac49f3459642fe035bd50e1ac4504a468271c8ecbfc8fd1a86996fff464d62b98f173dc6be05775f9cf365eebc221b7a19014323718cd473a1cec5202163aa6e8c321e1288d12b02e165ef508a5df29968a91179cfc66c14ff278314fb97da0d547974b574b33536d6b379eb0a718c5034e393dfffe245f1d4c0098a12634e82e6657c3c0b06707856339d5c8359fe6152e9441178795cfcae9b2749429b4514e1efdeb7e36dceb8f47a3d55f47d4806767643ef231f7f3aeb2186878f96958f8518401a45800e45db53cdadd4ba0841fb6546f774b4bc571e033e12fb2684aeb7989282d4084460a2da71bb60c76033032302a8eb0bb3969658ce5ad9c213b957bc011d925d3c964ec456a9b8d8e8a1ced1cf530cbc845f28769a98a4ca90a4b91f74e18738b28f0daedfd3e6056740dfe2615e854f4ba05a68ead1b90242318ef7242da4d0af097d61dbd477c133f0fb3ea3cc37f64509235453241ee0e11d28e4657ae9408a26d0dcd5229d64becd9eb029d9d0726c749172073f804f5c1bd9073983da8fa48f63492de1658f1b3b8536317c010908f8b9c388935c1701b8314ff28accea9535fa14f90b0fb8731f8f232586093237c9e1af969f139bc6762132acc285c94954ddc632588eed3d48fc0b3aad801649fd5609c86972f32434400eb03259339b70bfe62f6911a4b36293f5bdb08436b3e6c0ca04f07814a11e1bbacc488a7c0dd367d5230dd22ce2c7251d019a84bd757f6f2ba849d7340a0bed713136a738f56bca"},
+    {"0000000000000000000000000000000000000000000000000000000000000f8c", "003d0b5f1617c405285421306b2ae86a2d399c33a81e39c4502b59da9d13ac125ca547006da24d9a618901a158a9d3d6d8575dec7c1deafee59f41b0baeb190600272ddddb80ed090e20cee918c0245dfb0aaf44053edc86f958c2ed01a780d9088ea520a3eec533417da16c72f2efc48993461a0c0bd4c3b2cb55597b6205ec3b227fc219e156f5e08e18ac9d00a0810bec7c0cbee93aa29962bcf807d170d52d62da63f677e452051ef18472cc031ca8a732e403fa950975657008050b55bac826588ab8fb83c20d46e662f24afc364ea50cf9f4be8a55cfc0d46814cd75e70c0a6e3fff7f7013a77195bc15b42ce219020f31679f423e7b53ba420ecda6ef21862bc53a56a51f065dcba6879cf62ce6223f2c3779d752cce9ea447c616f85f16a7f197a05170a4bdc93a6e415a71e04b9e3cc5a015140ef7f382d2af23ceb1f94fbe2a4732ae2fa91e9acb5ae4a03027aa9072fda25250b32d1543422e8a5beddae017607c38bd34217331ff2c0f15ac97b55e73685de4a5f05e8578797e810f79e38d83e64c76fe2eec33fe516085cd23c2489375da7b225e781760146b536d9bec5070347988ece6f589edef376b59cd77e30a07de8b52192a4869594148757cf94eb9749b63eaa29fbeb941ea10acd359a19f1f7eb63be1235bca9d08f7da998250e91750c94b6e9e67af8de6f6ccb4e5d95d4cfde02a7bdbb414748c1080be0977b79c15ca44a6d90630ed9bb29380cae8c8d81e332736c732ec5bcdae4c009aa9e8ab65eaac5151fc1c4eefbf379231a113d2935740a1c5c60d5c7afb0b3b5dcc2eac2db62f7816b0324ba6b7eaaaadbb007a351f1df1c316e9a35f7ab0e355b45406526c3f70ef2862dc592d59ac16d02261d40aa5f8214193d9c4e54ab6f73fbfdc88c2ecd471d525af1b718193cfa0612c283aa2d4ce427996737003f1e8ba274669fb69f12f99f1d6ab589de93720803f20b2f0dd99d0f739720b9e055289847c3c997b92ccbd563078f5916a1aa55f9267fac233e359d0198440f0b2b961cfc15796684fda25ef9218539b9c9d405400a51aec15c704c6768829a4d15129e7c96dceb060889d81272e111a27954946ad564ea70b61fbf030dcfa4331e1e254bdc78d37fbf720d699a131f389f1829eec79c1e9d9b23c853da54c215b295ba17432705fbf1e9a2184688df6ae21c89294d154e3aee1b09071c02fa040fc131b806c0d946a3fa8c844e3a695815775e4383ec5a19b98366e013fc248f1835ff054a2891afdfd69f404171e392e268bc5ea923bbb9f55e0dd4e2b38eb13461d854521e40b6ec90eab71a0fa21f4b44c2d96f63bb99b2f362c3ce47ae0643bd74ff1a54e7f0d24e31472ebcc3b9cc7d3621cc137a2a71212c55b84c7b203df333742076ca81b571aeccee8000a47a791b823fa52a7b403c3e73e07a58641b537609b7ba9e0249a0bd0ad7b1d4d9b4145ca91853b8b42934a3d82522a7239b6f346cd1da18de7ed4ba8a0f2b5a3c1da04b6fb4721dd6ab37e53c1a47acfd7362101cff9cd096ef3fd77b83bb45b2d46a25b7517f1b20475ac7cdedaaf18f063506c86573fa69e217da1820f7fea1e55c5ddcea86442a15490963d20b9f63535695be809a66af2d5f2d46688eec17dae4665cebaa01fd8ba7c35637db73942232a79bdd3d25c18f8d911f4c3f72435fc07be7d5a286eced159f928e3eb55c1a53d74905dbfe21a7a2289d7bee229a59dfda234e1abc691f2150bb0b02ec064f4c5744de27c7d83d0f09a9d294cfc691fa98d291dd1ddde5fe8813f5bbdc18e6d2ce6c30ae6bd512d25e1e7c4769ae3e1b9f4d26c32943ab5079ff35c2163e70cb9225c381bf67e84bf9546b08b9deafd6b2660aeb65558dadd8f4b692"},
+    {"0000000000000000000000000000000000000000000000000000000000000ad2", "0012c8aecc0d9278a5af2943d7f8dfd258a25feab011e66922091387cf5f40e1484a18b55ac3e23c5d480ca2f27c9e84e0fcc3a507c99dc008834ba37d4609148d9184108f2e45e8c023d14930c68cf84fb7c2f800c5a153230958c1d3f662037e7ca9ef6a96fff22c3fa8db088dd4618d56b58574774402f6374bf8171410083a8b14840dfbcb4d666a6e4966ff13563c9d2e8c49bd66ed2da24f8a3e89de7cd2b68295e758422f056fa7e8df8a330e9a9694dfb4755a42d21b1cae8d07341f5caa53e7acf53ac1bc9de268f47d356530bc17557543bb1395c779e6852ad8b69ef55c6eeaf16826147a44cae8842f563fe3351f58eda593308d17b10b1a5870c814f2a305b4118a3c7566719c34ee8c1623392b309dcf6947e842e3d0f1eac84d5c9b70b31f10ceefab6c0a4fce65fc52029d7c4fdd27ea0cc63d393e6dbc341f5379410cd8d0f7647ceae0535e50f70405f0e8b50768e599b234c2dac691459dd7550ddd226c4fa68e495e5fdd24b3eba1c9a262840036d4d70f62a4d9718d3bcfcbd9c4e18a3dab16b02afc1a3e1103a4c50a08effd0d2267b623c157e1f253be0b67085bddab048f049b9bf9838a274e4bce8e693b9f3b30de952726d550919f8a458974d3fda1817918b50d0bbfd5fa572246fd6644d0c2be411d11e573d0bba22015cc8433e420d1f06342ba3de72ee174656c664807039a5ed00869c858bf8859dd7186c65fb9dce1d31fef91b8008b5c39e21e546c834a78be7d2a7f5f7619f64ad0a4ac7803969e64ad6bde5772f2029963e61f537ef61914dd95988b52af7ed01c313dc7159c160d6037d3522027a9c45a6212479ac67a8989b5ebfc28150f5097739ad5b751254b9fc5a45dec8adc710b0e117bb100d3613b0f46516e91ed351a17ff3c0167482f1dd5669c08c137b8955d2ac7d5157bb919450a003b887343e633cd806005beb042c1aeb6833686bc3d33fbc0551e0843fb1f966392e551f9b8375441e10495edadb58131b5c85c03a2a7416a4562762e6e7a0e8ceb87b31cb534fcf9b5597f52de3318a43d055c054a224740e334cda4c325f9416d8f21a56ef380ed1a4113895a5c14ab9347b5fbeb62b0e5848f7901b207e97b3fb6c33538bdc650a8afc2a482a85df7f8f452f894d53228168773045668044407d59f78fb0c830185d8f7610ba9e5261aa0499521d161d1c66f074d0950af2baa6474dffd9eb15a9bae5a0c71e74542d4023e558c69dcaabb1b88048794605c4668f5fa14a91e242ec33a4fbccde155c458d44368ed66af8dbe8709541e740cd6750b45af7835b4c6422e2dbddfb5f534eece9b1b6c228dc1bb13590b5066be3165f42fa20b1226c12567ade97b12965e97516a3998f46ef4b23ec78b206ce8a8c9aa72954b2648b5656c1a0efd43011c261dc81fb6c3fa87d102c190f24630d73432e012635c68dd619a2ffbe2b22e13be13fa6524d975d002017837bd0f6994c3ef52e317c963bd5903daf66c349aa79e3519ef710bacea27e0d7e6ab12b9dae1e908f097a877c3971d22a121d91b2af3c9db695cc0ea0d16d0ecc6619027e8b7f173e0f795b62d6856e3fc09847629adde84bdc84fb140b3971ac11004d032f5324641fc4e5805cfd69f944ec1fda9735158ffe4c708a5158110079928a4e561c0325492469109dfaa9011cbddaac04b106f7af371a8c129575269fadad8f90c43a16ffa8c5da2aede71d7ff9a16458aec966d260e4caa59a2238433b0c25798db632757d6185eb210090e91e2d458228dfc6169280ee49f6252bd983315355542cedf652c4d975f67ac08bf3f632e3d3d06d90d792aa1dd46d1cc90d121321cd83bc4aa004f7eb8203527c622cbde50cff5c5dc5ce41a3a6d93bc1c41"},
+    {"0000000000000000000000000000000000000000000000000000000000000f5a", "0081dd9be2e0ab034c9a00848a7fc8e51d33b0f13937b7825e5c549d05d3a4d3d6bd6e3ffdc9c59485e50d15ea06f2211fe70ac755e96fb20fb9ece71297d230ef019faccf3423aca8e439b4ff1476401b5dcda20213c05d22d0455537425a9980f116c2ae8f56458b42af122624a8a465878bd6f2ecf2ce51e82bfcb4f32a203d6076afff25b787c626cf5714c27321fe82263824d7814619ba7714dc48caabd54c2e8ed5bb1fae02ebe90a72e6adc171b424245cc84b5b346a7acca85a45fc786c96e73f3cec7886176f090263ba94371221a2eac4a1af596de0ce2ae2e4687a1ece961a31dc28567a085395d0a5b04ad394b31cf305d7e1b4f5ec049914fa1d0b3f493842d6a666df128699dcfd909136c0b32e0f6ef62dfa82348ec9f45edbabbc3e875c08c511c29fdfb6a94f96a1023ac5beca2b6b92344830ddb76cd2947827afde346c82ebf7056f05ad1c4601e68571c00ce1046fd0e1a319ee7215899e302cf20ac5e36dd5a025e796a5f28530c84200d16a4d83e911baf0de205726bd734852da04bb9c3ed73b98743523792d7dad9b7441df791632b5cd2d35cfad6ef03208143c5f3ecf474aab456240eded187f72711ec20e0df2e882e61cb1ab02ae46f0be7f5b4a1bdfbebe1632b69e12e2a4ec5d3387c3878c5915b9c6bdd1129f46ec0e1dfe6edf69c2c3b8b76cce6b66b20ffb44e1086feec161ddc387a85af2bb1be9067eabaf3c42d81a692f8e1b46d1356496041a1633d7993a4a7f894a2512844dff28074dea48b27b19a9454d5d60d83bb77c9b8654ed6d780571dd199c4ced0dc315371aa9e30e094258f0decb4dd921923732a51b0de3839360de2d2635db4264e00ba2d934f5113a5f8b12e59fbcc1130daf306a8cf72f2bdb33e77c51b6ceb650be0d9c26db2cb150abe415641a32bf0827256bade1ddee5f031eda0ca5c28829d130a08be2dbaa7848ef74f15915bfa6a0c865b755fc580358de3525c1e32d1adf730375531f2d653391875592782bd1dfd20dc41899d51a607e1d1fdc6edeeefe441c3dd00f7e16add63dd6048c9dc47b837414eeaba1132509d4df7adb5e44e50896d2a9955781f2d194b1e82efd69f981cd53874805da25d75dff76d3fbcb41d6677c9f78bd0e9d04a75d4fe3c6435f6e3fa64f5a1ec45af2168a6c9d27d4040f894a160eefe5eb452781467ba1c24d48bbf5481af0b28ae0aefe37b7c9e4516a53a8c12156a925b809839bb9978728368f3031b7f72df312558ad3bcb70b4a186752ca1bcbf027d3ccb43ba10519fed169460f2185baa7149d637cbfd2c0a14a871f1bfb9c2a7e1cb2dc48f79f026b4792f7825073f8c75252de3c7d3816cb1e1edd565796a7568356e5e85ebc8d5dcd734e29bba9a0e75f6d63ebf78fc2690067a67f7dc50c052cb9ddf548fb56e612431a4eb0bea8df9771e2d41602c533a7d30c5f47d0a5f3213254adcd24da906747bd37df137116cff45cc61876e4be4b02c33a4f61595636bfd2687bb34cff36b570508a1747779e44770e2bb13568a8c40fea61a2362df2cd08ccb0345e7021bf1f01e05d71def10cc7dadc763b966260f660d3139f1179f9af3d0b9d660791a5cba4165e53db3e3715e1514be20d199ccce436347d4a306e0b7090649b05cb5cd9b65b1ecf781ff782b2f358ea16dff27b2a074e441fe0301a7fb4b95232ea275d5216eadd28a309634f251285f30bc60e1494deb686da4407f321643e1387c662ebfa8d78253480395f3515ba83f5bad412b935b285f29a5da37732db394bf6652fdb362f4a1714412aee0ba9c471551604c8baf6119a231b859f17464421d888756ef8b7c5de8860b476164f1e85395b806510cd34b47fd140095a065a931a6ed2d8f5cd"},
+    {"0000000000000000000000000000000000000000000000000000000000001ca7", "018bbb465b2c7d279b5c006c91f192d26bbedb0b5f0fc5ff3c9b5f5e0d854427dec85c3362136b980f5a0ac03a46b645bc87a963b1eab32dcee5ba5337948f13926e35cbe1c579a9d5c1e64160a0a8a1d335583e0388f86c9edb595165b483ab2c7354fea1a0b8ff8f0464b3371ec419e150f471a805d785b0f1341781cb055ca0783408ae4bd11d509dc586fe04d1edcbdd4008481ab564a2c379c9d541598b2a508e24addd9389025404aaca0bdd3fa71c58c32ad8bcd232f85d449d0d1635d048d2a17396c52702eb38c4ca013a76978c262822065c58368cd69ef2cfc66e89b6c1c9d9102a28a9423bfa51fa31b617b464c86f38ed86d67371ab031099c50b723e0dbe46e0db92e3439a257d3f0a7129b189a5ded6ded1b90693a621b584b984d5f3dbbc13720262a6922a119bc112c44fdc3e4d25973587791714293a30d714b1fb402508a27924a1bdee1c2aba06e68e64141d98e9fc62715efdbc9d25bea73133850804dffef7205e97c45a3207e52d7dc991f65c4a684c5536456198c7615f46a84ea9522b925352f31a9e577feb965ba116496d440681545857fa7a9d5e90a5094b91ed7e1079dd8f74e09a6e96d88add89d9ec8f365aa642b59cf685b61893fc634f820d6e8cdd65db14458d7b1714a4dfdd10e66e8b4e5e8eccd0d98f112a15060c85cc3f0b2e8a44daeded2521822090de5b0adf3ccb3e8b6732f0a504994eb1cab6357e7b929d1cb5b1a94eb71237d4ca1204b023eb3498267d233e0e583904ff4744888aad663bff64766a4259b4fe361926d67db397fffccab056426cf567f5f198f785300b081bfbd9d602b2e87ea12f9f269725b8e57839374f537fe6f6de3abba272658e405f18d5bfe3905ce81657e5544799da65686f2586084d54929ff83951982f2485c56d4d6cd6a092032e29b19ce9047a39e6c301cfae9b98cce93114694175c954810e6cae1f883c065bc1c4e45c19f389069424f0360e86cf6afd5e02048365346411a1e4cbfe0410e7f1ff122c1ab4857f169d211520d02433c7abc37705b8ac854611928c310888a456f616cebf3f77f79187ffc5dae6c95991c015bbaa622a4e9c95b9e883c588cfd3cbc8505ef01c1e471d4071e3d093ad6ae4888ca9632989341bbcba3a519652016ff17d91bb168c6de72b29f50554edd0081b549499e77025621ed0b5521358ed1d6993faa923a16d3d7c13f31375cc13ad2b4cc6758b565ecd7c19443a447f93fe573fd7f23c10313616074e1a2d572bdcfe71d1d252faab664544e653638f01793c71dc094476efe24788cc89e9432fda4b60e52381dd2c1e3faf67a9a39a11e52bf6a70b4b74ddea2a87dd321c0ceec5695e040afd0fc4e2b164e73531b4533ddd5b43f3a2bbe0715085a2bbe58e50e6b489c570f8360f0238fff1f2c91c5d670cf1c367cbd130cf87197025250fa3f5bbca3ff5c65f63cc1834aff629a73d5b8f125832fa3221241f6c59493f93ee8e62a4ebdae2911b8edce4ba109fccab6c635182cf91e92c5ddcf43502fe06d0b5890838d431a0cf91d3f3fac2359a4f4013248111d15716c753da540358a75399ea22bda000038514e1e58f9b5d04233122575201d165e1de156f11e2b44d19192abb4c93c7181cf13626c454dc8deb025320e7e113225cbccca02566e13ef4f3d2dc83c703c973e5bb4743faecd0a629a44495a7c8f01e69501062a247fbc98ff33471a107e17ad17578926cbc811b2436d6671d469331e463116f98ffa54caf4ba6180a65d92f4233931fe06fa84edfc9a58280f47a713b1abaac49d28c5834e760e506b3c1aa3bc3aa3ec408130a5daa0f52af39996115648b52c2fb3dd37d11f04d465d7dca21f76b6abbfa8dc76087aef78258f27b"},
+    {"0000000000000000000000000000000000000000000000000000000000000bc1", "004450e8399792037fed35c905efa3c21e38d52c6b1a9e1b7f36c9078cd3168225bf4a17ba006a1c33c105ac22792314370dbdda79509dde862661105dd0bc1734ad9f12df287bc4e251893becc8d9a7a0b5a8b202a1b7af30a845d1eec9741ae35dc7ef76a75fca9a0ec65dcb909e1435111711ec74fed6bafaefba5d270d786fb0cb60ca87a597b21c7dbbdcb515bb158d6d525f1fccef9ae98fe891d5392df1b3668547dcafad00ac04cb81655fa9546532a56adc1485330f51eba6398e2ecafaa3af693566e7dfa46a01c7296aba34550cbd71a81810deedaf1d66f2bb61cc86b89d3e602e29509ea7455a9b5efc58e44f7532763a219991ad6904ee19a63a61c4d1afc1943eff55ed4ed59579b4da0c02414b38863837ae0014ea4061373ee69f7bd6fe1f4a2445a3dda331d4fae383a5b7a10d118211cf4a27be2e0764df3bb96234d4f270a868c26d94774415023370acf062d8df19e9d7af3b65fd1ea6e53b9209296b434df2d7e69dd42e46b02964107e79a83a193402ab263fe89b9c1f5940e26678f667d933e4fba3741a05bf62ffbe4543f829592ff5697b330a30d8df2609d23bc50150404a8742316ad3b8b00d1a850d0d451ddd8bf5be989c03731db39d09dbfb0e6096fb9e580e883695be8cc12535dc0155a3ed4206208d154a9b1b7b4190f135a6bbed2e82a070e2fc7d2a976b68aa06d04f38d85b93adcde182bdd0d2d8fd565378a11d50fc27b26d5c2d73e7f668a1ea5702668900fb067712d2a7e0a4c7c60b68fa02affbfa2aaab58e1f13702fa397ac1adb4849d174c3990342619d869e9f8eb40e902975cd075e796a2a3add92f799af086a5fc14a2623ba6ed063f95db88106cf46c6a529cfe38f2f4816075c3000652327de28734c84fcb355b92bf0f5662bbdcdec0cd39d311ee4331545cbf685ea12ba057a00c9b9744f721c01d7ade055ef7566cf443b7b6cfb22524f88ac256bef59d7430efd312c38df0aebf20b29808d72609075c5ef231dbac4f8ddab7818dd915834aa7307c32e829d9f99c4447e591856cf2638447201c3aaa04c80fd7264ef10af5037226b8b7d9de7d84c24d44ea5939d79b72025514d5ebbc6f5d17f07a22ed6fa88b85dac7fcf6b9503fcc08a8a750f798d7c378f2f294bbd927fedb2643ad7e3864b14e89ba467014145e3b224f46d37c862e0d9ccb89aca68f81b7644d04c03c3a427efe9b507aa1b3ed58e43a29c569e0a45e2cbdfc6a3b47bee33bf265dedea7fb5dea2b8139020a22b1c7873a89b556e8be7043d95fbbdc5e60428dad7014baec5c505c521ef479091b60890713d1c71293659d7b8e0f91f03985db97a758edc799a801977768cdba3c5f12a17e1b7226a8862e17e5ed7172fbe0279ae6f994bd85bc499563f5617471e1a49750621a11e464620fd1f2af10a849fb0a066486426b11766899f7ef0cf979f3074da42b7df8d6671d5f7ec1b63737f6cd4418906acc2e3aab3892cf5572a59a425c8b7c6ea0eace8a597b60df034eab5b15714c01c0ca5264020f3638bc743e2124d9fa82497780cb70f2a44f7e8d8cc99c1066002d42c56e72eec8cd837f311df8f6a174fa83ae245e2397cf7f4a8ee84cfda8a21d2071f4e5cb0c132b94c5b46ffa593bd817f62590687d979422367c9c057c895d64dfac2d957375d2c16f186588f928fcfd50a3283e3aa6aae7ca7783a7507606a3fe715dfaf71c028e0455ca1866e365e7dce08600ea80adf7aa5664481befea20a994b705db96e0693d7a2e85bdfadaddfd16322f05621dd8fd740bf1abb792df20f3d24e3e3e309596550cf0716ddb2ec159c219a71d22d53ecca729c0d62fd34b2519a7d081767873ac5e5a5b9e7b3524dbf39a810ab4df4d044"},
+    {"0000000000000000000000000000000000000000000000000000000000002463", "011fe9bc62c35e571b70d8e6156662d3977edd9c6908d716a2f024c50f3a17416e5352b6b647827951db087e2c820307836c956e53e44e6c5ebe07a7f97c9b57ed4fefa85ace10d918c58db34a9039979d8fc68402399beca0aacb415cebe67c7cc1e45ac26bf63bc60837dc6c6fb132df9c5214b2d6d8038a13197e5fb90e16b5f2c99e364d026e243a42c45406a8115846e438294fa86f18db2fc2cd3bd3db65e00f1ecbdf23f3056e7094fd53bd63064799d24df66702ba03db5a90400a5ed7c81273b5cd7d8a39196a5167270bbb70e016888a83ea2329714d92a2a0f7192605ba24f3ddfd1aa8dc830967d769da99943e4bb3cab1700bedd9530cb1a88ecb4b99bdc01cb4e53d75a3ae2f8bd40dfe1823cdf4f1466e8dc95c44d35672fd49e4e0fc47cb0ccc007931c4828786264464ffe85877dd9f7f88a011be5754d79a027747c847258071cb024e9a566a79016b58ea58047a2f507c2274f034debd7d19cfc107175661aa6d871655b95574b3c0baf1aada84fb88a301b0a4a69655ac035f682920566486deba5b5f9d221771b0d2ca6fae19e8f1a40a57aabd1a0925d9af410818a516a2a4aec1c40744a78a2d2865efb8fa40673f49ea91f3319f79a47f44f78a6416930fc59c074840bcbdf6b8e0d4cf72c028b3dce4b9aea782ba2a6442842d16791bd0fedeab249c0f6519e3583bfb6e2f063c77bde9c4d4c4bc81c157113f95f6bc917e1faa11538e09391cd92f54703307b9f461c4f63a5c94773bb3376fe02a52affa58470da36d34ade11dde697149b574ea4b94128b1d1725340d3cc4617af47e61bd08162e78fd30fe29cd64639cceb0f521322bb0349b14d53add6b47b161fd3cb2f2d0fece01b71c90247f0dd91da60b879521094a362ce0daccae3fed16277f1c5962b1a5136eaceb7ee2131039c3d70561bb430001b724ea96932162f54920770aa0982109a111cbe13a478694199a3f1ffe746e3eb176b1e7b5bc7edb1507b99a57fd07b1727af34376945187dd6fd85584e41a8f830e2a75ea29ff53a49b46684c6e2d945901a60708a5971b846871c8bef0ce37f41ddc583a6e57cc25e2374c989b42fda99cea23d1e5c83f17b17c401415439540d9857694712a94e47734a4dd8028bc09fa2410dd7ea111eabaee6ce6d6a6f641428e341fb9fc09ab158aef08e2584d9235fd14d855fb39d93b1dc5171128cfffd11b4fbb460386ff4b9071cb926ef733209933a8dc50497eb26c328e947ce4ee2974bfa2ca3e5cfbc6cc263a5f7844d58376e952fb30d49d92b209f1cba737c4516abcb468684d7845ce4aa9b96459137f7dd1df2a8a3581f56b2972e33b3afb01b97d6b1133c4a6031df831e65c15f35f41864e9e66fe3d173c3f36b21fd292d8ef82845943cda1c2d8f2fe489b02a7516d88d4e139843f07e9bcdad45e8b75d5bd280d7511c690d681f5125f9455cc6aa2564a6c7fd62210d391f99be88ca58b6ef772aee490a2d39fd8fcb31ba7a1df74347d79c64241e493bf1fb21bd158ff2f02c71463efd424dd8b7503841bcd23a20fda5c4032037ff93329bc5511e8c5ad0369fb02e34e28bd04e9121dd774a41b91a594c0c3c773f2dc35fd28df5591554c137795e248cfd368e588167b91039fa35fdd9a05ab0f64e249c7479a8935e09d791936afd858271c303a7a00289c2e96fb19d351576aed59370e8cdd2606b820fa88936a87b132e10a232419d1d91c706a32222c06670891d3d15246c300694216aa6da7dcab8210ee67a1ba218d17245e112825899236e6957981e9262a86f1dbd6ffdfbc3dcad992dd1b8314269ddcab1a2555ecef9d73f16c8a6665735f9421c9853ede1c2228f26c5e4905a0a6285230581ae4d8bf0a31d3bb"},
+    {"0000000000000000000000000000000000000000000000000000000000001247", "00d9f8926165d90d59f842aa762eec20afe572224d40aae70f81eac8fff933997516d05a167286fcfa571c77cffd5a16286f1ab3574698c89eae18f45d96c242a325860ba39713ac73e549a6bc1e23a8141ffcc9043bc596d385f7f28296b05b656d73c44736b707610fb61fd6ebd52feb755801c141d7736db5695a9dff095b92f2897074fbce157484c2d4f3f1346111c3ce45f9de9fcab1370f8ec0462348de6f89f461103a8009dca2efe3ddc5ebb27921ec6f7786453dbc89ee4d1ff011da43c89d092405558aa070cf02b62ade8b32280554734e1d203fb568c3552c626b59142fdcec592e64a6f09c573855b3230577f451103b5c833bcf2e11540d2f472918579534a33297fc60bb5f70be0f6717707b0bd6b9031bf34022f7397484ce47cddc11ad126c546fdd05b0183fea23d22afdc5f108784db20b1aa424f89657fcfde64ce27007391e10b4ebb31bb70206faa8b709221b8674272ec2ff05bb494d9f0546190ef3d682942591a02972b52f1646d3c77dfe97e817d61358f0176c1995c8c3100b2f0a8df04872883e7c7a2fa0b16393f755d9c956d84fc756ed8a5d091e02f5474c2e72c165d4025315cfb2ca4a72b87a660a11e0bf47ef9f4697f12bb13da664cafc9b07f4b5c035a5aaad6ded6a3bab4ef44e814d69929a033ce14b4a19ab9ee993bb23b9a0c5e0c8747b6f83545dd606031b3a11e61e6227e6e6e65a8ab663d2c9617e2f1823568c58648ebf0be2d652a85428bfe5070caf6b8812a54bb9b51d014b9ee9a3e29254f5c9243f9bf022343b81c401a17cf35ba529e5e86eb7db968a5f043c08850e32bb5bc8b1a5744639d8fac8f9bb95b684610898b13f4b5594d0e857b3d98dc915ad1b06b4595b126f4b2ced1af4df4fa721b2a00f5b3090c9eff0c92f48e5ddc95c09a34b59c53fcfb5e7b19cf1efcf8601e58121fc18cc19260eb880cd6306ae482bb6402d04d4724a5ffe27b9f7b131e6fee5d2c915564a28632996637e3263656bbdeaf823bceb8eb33f6a5cbcb638b60b2d86a3073537e957a77f72e92f2678dcf6aa0db2793e583586fff2b858376174642640c6b49adc17635c6dd44f87cfde15f3f1adca9f2a3ed85fcd813865a3d3a655f5a7ed84a5e0fadc1e76c727bab2f372704e3b96fc2b43f100a8722ccb051a3cb6f2640e0364b0bd46db9e393eeef07c58dc7fe1c07ed669381cadcefc2ad88158fad653951d6de38d2bb6b4be5303650dce6d862973f927b413bf5ebf2d91a132c15e2a7a5f64fbd3a645114773baa7cd26967f77992a68037d9c03700cb668cea553f86aba392b2597baee9832814a89cdf6de65edc10480b5f2e69d3b88f2a2910c6eb8b474565ca8dfb6c27db948240a9982f9593124661d3539e3f5edca34c2e35244cd0762badcf356021d657e8356b82b3cf973483052afcf3fcdbb072e03b46f8c48cfab14dfe1d512d1de438daa2b36acfe029ea5e6c29be7494bcfa23ff728d47204019297860e996d869891ede19390c66932eab4d23cbdfe2c93048458423c4547538c044171ac2a9738f913346dac1337e48d7550c8b55c8377d71962b6664dcfb9b2f20c42fcd4cf03fa30295911e33cdff7ce0666d6bc023d60674ebd8f60891eb5aad46a5d7b8f509bbe7f870309d1be8a168e0755e7c4bf11a64881538b53099e25ebe4d801ac5cefd3c1d2d444a9e73a5018540a440d8df44dbc3171edbff99284eb55c43caa1dd00e1f22cfd1f3b114024edd18d50dc1316fba04fa32f680059358debd94e2f7005d92ecb33319aaced43e2ea50a5c8f820e94095cbe51e19d44d58fc56658ac11000f2af5b1a0d895112f2a619903f91c64d9d1f85f3b110186f3bb06a0b34c824677bcd53a87af555ed997"},
+    {"00000000000000000000000000000000000000000000000000000000000005bb", "001ac390930ab7f47acf242ec04f4911472a1e5560077ab1761ccf16e38e7c02e8e41ecad5434f54fa1c16df6d2f4d6b7e536226a4176d3c9b99c00fdd6cbe3c556bff6f980688fb7a985dda5766d2887a5dab3d0103cae41f102a8ca6949476ef713009f184511c7926717f6fcb58f8e1feefe3c4eef94f49ae89b9b7740e7ff0c9479df179a1067144ba11620cc53b482cb44b82248a041e2fa1336398f037cde886703b9b9b940400a5298b5c62e3fb96d522f5d6340e3eddfcc9374272969090d7b315be45664ee8c03f69f20896f18b105b22b414b37aebad77515f13b3dc950784915228117007617c91a377b3bfa55d3bd0738ecfa297f1d009e1061269cbc195c27b30dd7b401d6f26301bd8a42dd83a790294f539141b149e84659ad9594ad4c70010707ff5019a867735e8b14782b0bcbb334a1ff6bb21d422c1a4a5a5a75fd6a2b16be2f538e569a7545300807ca1b61a328fe527879aaffb3f6a6c98fd0a462e70128ffc26600150cee5d2fa5489b6f7f05f7a831c742749770f34df529313209ac4ddd1f2865a114c45b026c780d28cafd7dba619785105cb0166dd7f3f0eb90cdfae5204319e5ca7b664cf128a809e793b6a19c29d4ef5d74440c9e46b6a37ebdec6e320bb48a21650abe506252c3f9fc9544144f398d912374df3544dcf6bce18593862dbf236f546bc2b22e1c51ef6dd04b5b2ad1890cbeabc1a4129f432abecc1c887ae6f08a693ef72465a1dcc913172f8bc04e943abda415e1890392806200a7f67d5550e7871b7ce0fc170f8a619a922a013efdc93cd5ce56f446c9859926dd2edc206304e98060fe1796945f093341b01907ab5fd396d500794cc14e1cc01734ffa9bb2f65503665c9b9ae924d4223fb6d08745670bd86afa5917fe8b03f4f9ff4d4a6306b49a93997cf9a5f574d643170cd8fcc6de00f0523292edfa2dd78e813662465a61ffdefdf337142396c6f5d33da5dcc6154859b808433cf69e9025079c8b96266d2073bffdd12685f48cf9842a11c2e21df9f61b43e65143faa7aa593b62f75326acbe469403120ab2c90843e0471243a1077c84637e8b1c2fbb50aab37af398791d2d8605a33566921f22c87e5cb6157fb290daf2669bed6815b2cc7f0eb9e130ff21ce3062aee1d2e642af55aec81c2b5fb36a638bd9b75114137f2bb3d64c6bc36cea53a17b749748137f256d1f34aaf248ccdbe4731733329fd5ad0254fefa25091db48dad448bace3ba4e75b991e745afaf7ebf3af230182b83bc9f579fb4677393e94a3859ee3cd13e9720ee95ba2874db2fb3a4b22ce81b09ca7ed03fb43a238843eb990bb75b0ab9237ad2cebfd8ea1cb26682273eeb546e0e3503ae10941d8d513c31310acd33982fdbad57b7f3cc55aa35fc758479fb63b63b7f3fb00256badef4ccdbead01871048c2728215465afc370174cbab55a8f6a6d454a33e5cfbdf09211b5dca3850739bfc202b4373fcdfd91d244202bfd3731d2a67a08f3f467381c7f3ee95fd61114db1f41ab3432bdba03f5ba1833ef6007ed8e411808a7c7b512e65c4b9607cfec18ea243bcf7de8f3cf0ffb152d21773948592b141180c662388d4f72643f6f6f541aa71cb9bb8441e0a4fe0b53c6b9bf2a0496d2acac6952c3f451f2054ac5639542948944c312db53a92dccd7b15b80f6338dfbe85d617b5b2add87d7df7fd0b69d787d24d6126d79d533accb3beef8e6787741dedb7fdefe24e82d38ec8b394fb1bdf66c476649f54f05e39f1c0a970acc9fc2ff6330bd8028710b90bb430df6f49bc02a35775d27ade703c76a95e61f1db4045dd6c53f79ef13848eb20ab0fc3fcc9f33588528c05afa2abf59cb69ef1c7c3f5bae9eeba017823edd6959f63fbfef1c"},
+    {"0000000000000000000000000000000000000000000000000000000000000ebb", "00acc80df3df6ab75aaca389d1c9804cf85cd3d09b01c202bb8551b1ddd46f6268b3f5475df3a311ec8c12c293e5061f4755c047ca3803f0a87ec82a98cf824122bc15952e0227e32965bd614b7f0191499fbf44046c9e9f558b849b90e7b7033bf9c84b106afbd32412873a5da595f92128b296f5d1eae88dea0b58612b26c05d8915976758c01a061a28bf1c81e3615489352707c26895699a0551d437c0ecfc819e4840fb522c04ce95a0390c1639f24431e4cdf949af9bd61dea182773a2d01414404985beb65f363d38cf22d45c4d5110ac5d0e3a94933dc354b2985ffc4da26ad475f6203031dc234ba62bfd46c9f3dbb9b95292b914d7a9220666d9e53c053358f45792dd884efd6e6a7a9831c547347c7099b314b3fce194bcaa66aec755237e78d72604044c7ee0cdd7f5e17371b1d1e1e8dfcb2e61c581a105eaf069e61d9d7fc8a00ee96f2787d9dc97b603ec0c3482891d9910dd72c26542fba4f6413c7e520855739b42e912eb7d74bbb0c97883ab555c1f7c4d082284b22446185ed92f52c26a722f6efd4558cc39240da45f0562b40bf2b034ff34ca770af5d89ab819053e886adc0acb2a572cc56079e92151cd1efdc8d0155917cf1a7931dff4a0946fa7d9f9331ddc5fefe410e7a6cbc58b3472e703ec79676d632f3fedfd141614a510af84ab79ef9d2a81cd53ad0eb950db908c1e0b7d964e6b5ffb8badaa23dd29ea4aa220bc3ad4b7103eba597576327bf24f3514d9c2b30188086e31bd12726c6f085462ace282e3faf0f47c6b622ebef4b2300f529a77d47401d699748b3fe4a03a3f8133f5f015956c65f1d587d5bf2361d523b512e8cf7333dcc01aa85190906f391db37d71e7451c4be2d0d916f7343909d348d4a15cf7be5b34b1445a5925ae30b01d683fa644849674b2c1d78ce7bed3f699f36a251f3d4f00f9822690169c8f088a4059409f5130784005b5d51a780647ba0ee4ecf1ef057c2dde7f5e260db9386c1d5679ce211fec33dcd2d37118b304c54a98b875ed38a65d5a7970b10bc994156fe555de1de1c7b2573b0699e60a82f1232990a9b1dd3ace2f0de8bfd85738506184892cd9fcc94774281eafd50ddf80a7dc4715075f734e0bdd8aeb513ed29decb9ad0b3c089a161807da806aa14e1c2aac8422fbdc37ce8900db1131eb042e34a6f192b7b53184b152a929c328b946f9925c2f051b2e959451fdf5e699e4665e9102a37e9f4b4c0c5f547bf9d9cabff3059262c1a023f61a9af36e3b1f6121d2bacc199e648e6662533c171a05baf37f690b353b435959763535d9c4efc971935b373edd80af640c9e03c3a00f815368a6d09a5c8dfa2841bea9281d54ba85ac498a5daf524594d57b144a06285960531e562a5da61630497cb704afc6f778dd59590bb9f903fcc38623c23310ddd506f22f71dd69f3b1972df123fdf2da6ed74f251263a5860450bf0de37cd601f90861d3c02eaf4f7fc13021de0628b834ac9b2723ca177e993c5636ada9e5518382c3387bb549bcd8d8460ec1bc835fd80e2acac0ba2392e41f42ef645c45cc31bc63b7886e9a13a83beaafa3dfa746c1fc19bedd2577bbd05ccf246f3e4356b2943ded55c5f25279ac4945aeb350aed435af3ba8547552c68670defb59100af8cd1e2be32dcf8ae3c821924cc09f5b93bcb0304ee7a2c1bad8fae2cccbf5c947d3ed4578bffd80121464e33fdacee2a97c5f58511aff67a2654cf9829d14ea5ace1685e4f6968ed32cdf28eb7a08a39936610c9b8bcef04e8180ede30149fb3e6a8180fb1501f06c29667ec22c68b3d5d279c9d6fe8b0f6a1cdf2b7c110d388c98c56f5ac449e23e0e3013f68044389d2512da8557b907f294f47a3326b1625e524040be6960"},
+    {"000000000000000000000000000000000000000000000000000000000000159f", "004c6cb4d71465ccb24f4228ef9c0914b3efd2e2972635f932406cc7f5c558c7c832f30aca7ac5f5b76b1a8f63c3ccd640f1c2c6e3051328b9d5ab4e30b5a033f183bb080d1943136179754c52fe8b42077ee18d052cd3d3b9d537b5cfeed3f3c069e966991016c3b8201f09e81815ac91e557c60d3be1538e3477b56beb1636ad0b5c4643d0cbd438e92571182771063d6d5120e5c4689e0ecaf753aa527bac202ab1880699d14a0068cb730310ffb3c8d2e2bae94f9f0943d416495f1100199b535ffa750a8f6191b0e368bddbc5d1368908c07069b8848f9cead9b72cc0c213b1d0ed5827f773181d6b585cece5a33748925761c4ee7ddf78979110bb1b88d758661331e3e428c621e8198c79d2992a2836df40e6d31068e7c644924aa6e7fd50a0dacadc236ba79171d9f821c9f444edaf483485ec55b2473444526fb00d7c22ebf8dc048478397dfdfaea91c6e102e8d8ba8c64b58d7b2e3046d4ec2a3a45f2fa00d2429944de031d9b9d26f535270ad35131afc631fbbc03d06638b34b7d533e98c9cce355b7b6b51f390d8a1405fbf53547911dbae625146667af8a9bb258ae56041a36b0d50eab75debbc60265bc7953053c7a07ae0b2b2140760ec2497c7b45eedf662d558a755d3b1d05a2691829138564a4f71645c855713663d79613ff2d5e82d6cf53002b54c683e660aa706b92d99edced04e72670b8d449f73399d1b529db3ca1786efb14461f4bdb8b599e90bd5f9f42f43a49762583b79763f71a9c72a45b0ffcd084087207d84e8e24a6d64cf9ef2069ee5e18b3eb57dc4c7926585437373e8e5c2f9e0a9d3c69e548ffe28110e2e319ef91ad65c45361550aefc27f23b80df5f0ee13f3acc31c1ed68b58766327568ee0dbaaccd9639df3280f6ab232ac18be416d391d0f1f039bbc2931eed4db246aefddb27a3eff3d006690e49fc57eb076a9d3768eff3ae5b38c51625119b20199ee59162aceb5a1c758624b94e5a9bc711504cc4ad940440136958ae2ddf73bf03da892db2bd235e065f30fe58599de23e9b41fe7fb72be0eff78f00290ea95008d1ddd2babf4489c588621c9263727bb1eb4ab5055c8ed198bab72dcd4fda463506f1db4862e156da711a0c7a128909308d6a3e79dbe29168eea32c0e9a6700d581d032069f60b6abecb63373d8ac0012a43ec654fbda7e4a4c0251983b644840aabb64f0c9e0604dc5949ad2435f4a4455d4b7d35709cef650e8e79ab9e5450cd3b97e26d55efeca219ef731ec415cb6e1853ef625baa4462682359173175aad247c6041111accc534a3f9aa010a96e2728319719af6e732e2fb350a9115f530a4ae89a4bef504b492b7e13060464f557e790dfbacc99f46c6bac28b9d250906466065c11e37f183b52eaef314e20b633c16fa7b76afa01d2ce9379d054e16e4a21a7666923c5a191f7a23622bc19c7c4f65681ba55d35e547fad4583a614327c070400a2eca6dc038c59219873616574f13e3c188125e53cfded90d9756f3c03c0f6d4bb952e93f34170056bd2f2dfe9cc6ba41cb2a7535994a11326160b152048e9e3dd12cee3dc2e7961aa5aa65f0d093c1bdd0d0c064784d9a8f1332a59215061727ea27aff230647473d6044d5d3e6ed40969c94e7794660119ab0ea01ef9d0d5786e8db6603516a6aaa786a8b439a24a30ec11bc28247cfefccce234384780c0a0efa14b04f1027b97c23eece6bb51ae40499ad25c9552c2dc050107d857ae4647409e8e051c8b661bc1e260551f1580ce0d7187dc6cd968f9411fc55148f160c2351757e0d979597ce6a29475b8186dd16d1c2979227fd1f0013c4f4f5fba24ef33429d9756ae82d8f605a1f299e5efebe8de562aca1487db648ed7371d5e42e9d27b0"},
+    {"0000000000000000000000000000000000000000000000000000000000000158", "001c93009f8bea13690e44cd634301914c568c720504cb4dd2940e05df7c715387076700d8e4ccdb88080ae0f27f0a6402532264320c597ce6c377e47cf15b0e79774c53cc9cc52ecae16cce3da43ef444fb6eae04506dc0741700573deab0c367c3e3e935b175fbbb1857e3803a24e005714821a342189b6d97ee7fe2821061cae7fd509681c8e8a6d6d3bb04af3079bfd3973539ac992216caf7809ca5478866649221d012a4fe010841dcacd822154ebb77f948ca7d4e45623b790522fd4ca4b90f9f41e814d2e00920a9368e899c4acd0c5aa6201acc973b444be2abee44d968fff81440642dfc7523bf9ae8a57b48e64110c890d5dec53ad2940d28690eb3f01975829015cf55f7f501de4f3488584d92da6cb0b19ddfab35f611e06481418c92db545b36566780ce9cd3e5e9eaa98d5ed00c668c2e7e51e96d7097c40de598713db776ec4cbecf7e9898fb08da0479a2e96152f29be672426345ca756d64af13477f29aac6d8204ca3590c3883e8fd5d60022063b74c6f06fef7b1b388ecbe7acfa576f43880bd6694b41e9a1545639003170985842318ce6bed782b5dae5e654e06a1e03dbdd7b1e1dca904d8182778b22d9dd9d3dc089c85edfec96683bec572a080e3c6e5904577dfa00e559ce9a0cc85b4e26921745f98fd6ce5f08c792a23416a8829dd14751ae6266eac67ed5f45413b65fb0671719128db3a1f1cbcb0fecd7dc3813dde6b29ce162d9c6f994ea679830c230e54ccf58f6674db43dd0b7b6b30505ca4eb4427767885e6590a316efaf16b2ed172a7085b16c74013d4e8b2d2321200de76fb6d11346f30266b84c190b681325a5f97e4736cc4afd81cfd1b1f999b9355c122c448e033adca410496901e161f2346c9c7704b5efe11dd1c53c16243e8bdcfee2285493160ef085facbd2349516f947226153dd52b00b7a4aa8f0983df184884deb9510639d0b23bc55f5a29d372ee98bad2e574e5edd34f27f6643974b467011029f151d850dd4ce6f1cd714f7b799dcfd4af982eae873c579794275762831698a945e57ae6dfd5370101cab4eee3662b5c64b028d4fbdb46b3f3ba3c1d61c9c769e99f8fbb4bd03675ff43a06a854d1f516314b412fb38f253a7a95c167b10d08f7e19d53a1c473de7a2cd246fc899cd6f345987f25945424affd7ac0c04f761d9915fde9754739edff6e71678f21c433d25498f5195b5218de3dd23e370b7a4fd64221fe85720af59a5e725144ba8ff05735b7f47c57538af672b422eeff0ba719367a2931ac36f62cebb58655d38d01cab24af0a1b257aed0ba60b886cf6ee30d05dfd492f29ccff5020ef79636a76b4ccdad03f1cf4db811b4290122163a0723dbccfd51086f39fae3143798295459bcd2977946d3de0210622cebca52e36943a9c28029490e07199b614d00673a6f9fdc36aa35ef9b73a0970d4fafacea3f48893c677e4d90f6638715d839d2c918dc0f89353fb6be2f7fa39bfe19a66bdbeb3b549fae6b2a29932712265984bfdf882b63438d4aa0f05f947c984eb9a47ee4d25fc214fcfc3211ebdb7e111a4ee4dde1e052b5c9d6621abe0b866dbe0385bed079fa914a0eee831ce2522d026b606851f8aeffef827e0b7aca6141b60c75f666c43d8b28e4f7d94a835039717d5c04af924d5f2d29471a91c9d23476c25e02c13599773298a71b617a2c56db97151334e8a06224979cd8ab3a60ac1479ac5a5a5f37e4d76f65b73165b22cfd6149766134e06aad6236eedfaf43f785b26242e8e8b661bcf8d00ae045e0f3af569e2acb4c4aa3c242bab53b8ac39fa0596df8574fe828892572ef8273e8f90474e1b6108a0e42185d04522120ad8517f31dbcf2485da1f211a232371389cb45f272b7eaba5"},
+    {"0000000000000000000000000000000000000000000000000000000000000606", "0038adfe05454b9b32bde2b987b84eaa2b67f404a929cdceaba42338316a7053890c41637962dff6779a092d487520885f9484eec256caaef9e0d9c1fcba58511e8e79831970ef3b86469b6e728516f825988c3d0373fcf4360bfe86dc3345240cdc51138ca67fe6b60810e8c5664d09991d86a0f7962672610a25c93c8b1b16655e138ff9dcd621c52f7cead36279ccde199f2814afd8b98a30d98e8f79b0eacec1eb255afe49fc026a87d136936811ea0e7203135c2b85292a09b7730940b4a1252a0685b6143500352bcaa6f9ae78f77618aeb5f2e6a31055b7fcf3c0acec42d25a011d168f50397ac8a7df1141bf52f6bf3bd52a79f5987593640c3325a9f4d4a0db584e146a4e44da3945305b3eaa373253b53fe19cdd66a64902a0f961171dc75aa34b2e5aa5dfaf26a1b1844fd327a299b2a2f2c858ca1a31eba5613113b6f7f6a24409df3d8efa2bdaff945b00be977a889c3a9f748fd09e7b33ad80ffdbb61ffa107186e5bf09b33882ecc46e9f56a1ce0d5e78610604cad340b0d16af112b4019afafa4219192a7cf418219016e52695799dd49fb68cc1e6e799eebb502a66049d4ff3e20f5261a45cc7411f7b54ba7139b68ca30d85c5e822de11cb02d2a1b4cd37de192ace990fe70d8064123b9f3281fa53374f9265d55a612436b86c1f994f272f7418f5e5151256bac234eea6c1ba1e7f0c073cfafb3400b5a2be12b39362d010d8e9cad26727c3825a4d8a4beae68df31ae242c3d99003f7de923415e7885d1ab0a550f8e6de4dc76ad75696be78ba552e431bf6a1c2ad46e635f6a9cf3515a27ace66400f75fba5235c9b6351b04152048e37fcc6fb6a5a4640d3c5cfdad4ad6ba55014a5b9c62b19eab493e12c0f84c5b086610e47987f16b583422e3e1c803649b91593ba53626a0b3be8e677697553cba5f0d5dd774500c4f323b2939853b05f323269c8e1bd942bda22e60ae08e9e85b12407c2b63508173d59df5c145e79fd1f46752b94d7db60e05da3d0465946a6fc087d19ea328976de1bf562bdeb9af6b58539d451d2b971209305706b28d2092f40afb180e427d248ba31c036bd770729239580c9bf6747e120e126a3e315709e6d54670b99945127c822809e611178a49760ad941f74ca775312bbe91f585baf075238d32b4758aa83423671c201fb7f623e4c2c06e65cc5897dd53a8a786f58dd66060f293743aec6ad8d3f0229a7f20c3a7070593ec20327c7db38a61bc1d84f709dddb6cda82c100cf713415f7a5863e27d355d8c590555d0c8e2548dd3346308ac55091f4a58f75166633973642faa23bedc03ac1427f8b0fec9c7852659d35e3ae9957f9615fcb2f90bffb754c4eed927f642311602a0896c91fda519170d9af22e569b630b19bc039cbcb0ac55203677a4bc02df3e4e37d936e5cc6941ce49e2f83aac733f423d175a4584544ca8bce2ef74c5cde453755da4d4a64f257c9dd1379a5e5faab26724676a5bbe5e6afaec345b66558a6be02527678546c60143e5d64296193231094a096e011b6597993c60d439c8f6eb3d825b8ee8176dc625580a633b0db133e870cb35769625b6d85636806bb60c2231451cd656988167152e745693c30460b97d6d1fdfd5b149eaa6abce72d74e947476d68b04928069930f83e8a3bd418e9c39a4e8d6b607eb280ae89b759f71712bfa7915ad6fb8f899f77139b8f80c02bb301d0cd314a563b0fb11dcd359120ba9aa1142a8433f1853debeb1802a6eca725a27aa4e5ff21707ba93310c06dc02c552634d5d75ee69b37f3a7cc2180a64ec9e53da45a30b65963966ac32e645bdfe970928535ca4c93636bc59b0b6bdd6eb28869fda48282620aed0ea12a6d0be0c77a57ed2f1fa250f5c42a5"},
+    {"00000000000000000000000000000000000000000000000000000000000004dd", "000229b5f56c140d9cce93f203ab56da28d85b8416067fcf6142a0acb1f38170c834bb4b763ae336393208b69c3faed40baf9ea951a6fae2ea82449ef8d8700d9c0c59825e2933e884811bb5ea95064355564f5a002bbd40f5ca75733d9a00ed8f594ae4c1ecfa245606ae7d04275e30698030c242e135c7a4cf3a885d0e0ad829b9b6960ad7af42a183ad61987f5d879b5bca2a30060b4ccfe85b7167753442c8618ddc821a9056001632bba8573f0fc5ad3475cf34bf4adef97c521112ac0b351489335d2ffdc2c009742520d75b594e651117240c1f571ca2e220c8c330d2635ad037f9653d2e4cf979dc684c4f98e899d0f2e3450ae2473eff4a006581abf591ef832fa4009e3f513809073752a97d022837d3c8085a26d9bc91b96119b030fcbbbe3e65084394dd498d29b56d6570ee44e5417873a25f8d2709eb169e8de22277b05490a437ca78e5bc6b79eb2101c7a6e13d1ac067ab6436c82f4423ae5cc75e1caf12a2c9da4f1a1aa11e20e3fdaf7d3e455115aaa3a709446e85c9ca86590dec9317a6b93fe0cdf9704fa219e41a0a65e6a9b9aaa9d2c8293e2a4a13b35716e00bd60b354e09f0f7d3aad140181c5c0b20747ae94716a45e11505cc1092f38922aa4e6a5dc9af8e742882e77b232be91a3353c2b65177d3c4d017c6e9a87fe3d7e735debd1d224a19ca61c1a5d5d77184219e63b02454b552dc0a2fd074b82c15ab141dcd5831c896b0fb122feafc787d6d89d3124631639722d611de99c02f48cae7e427b795851169f5159e496e160581d011b7ce5136bc7fbfef9651c58917739ab8ad75fcaa002738576fb27c01b5971e0681db816908c7e70ba003d20bdc541d08bc385ec0577b47d3f1a788ab5ef5510ae48d0aa2eba37b61d414c8af60b346f415c09524802b4eb3968384bce6b65423143776a8d94bac18a0040b94f62c1a1ccbc89b20336bcf08d9bc43826a8264dc6b8bb14b84f6fa633674460b356deacbe8ed1033e8b4a504f74ebfc101297a140b198edc92a5d17059cf3a5d1c62a30a02041b96093b4bce7deea7a130edc6a1e8f15f7e34863b2884351c404b5748bbed21109e515dad10ff99b26f5513058f2423573f5427e1456a1c2f207fb5563d1b36ed4d91fd4df73a88d615bd74ec51bb14c53a6cc8785c2bdeb62e06b1a8e4600d2dc349a968a31ced24053592f1c804e806eb3ba28b2accb725d252965edd9aaaf695256cc9cbf11b00a6470ef130f23b4adb530dd1d55445c55c23c66f70f9830960304c17b8c7ed3b018344c81693df1d46a0cefac4bc0074198f2aaa630863d6515ac471645dd2bff1a4b0633333da8065614cffd48558d710fac000e9f3ecb021f8c1bd944b3720e4244598fa1b5ed341c87c5b8fdd676c5c672a5633fcea06981758ff8f50048f7a18e4226dce5feb09ad6dc1310cdcb0c2564028c490c204b546c6a17d6671260870a4d469b91dd076adb89c19e56351903b2a8ce2d61aa0798f469b9149c6d5f99e5455bef79b680bd5b3f5fb069be3f3d0237a5f77406b6f3e1a1b24eb0e4c1ff6872fff7f51f2ee2c6860cf15b9482fb94ec6e462706beb9d65d147916ae6ddd38bf67f017bf97f98afb67c4dd3063202c3e42d55745278d48140fe9d7dc2ed7a8df5d3a0a4d6166e19e415593c5c538677d2ff5df54d3984010dbad82a2cd1eab5b9521555fc4ec4693ef17dd011b8ed7571f9ad777902ae34cbe68ff2323621eacd43f6a1cb52fe2dd8ffb6827e4127443cf20e05c32de11cf3b52b1856f3c7d66e12dd5665a9ab8193c731415a6f8fbb891bd0b354eb513563a125def22594c4e35c47215f7b70b3ffe34f8951e51607270b19b471038cae7f8ae4ff5ec803da7a08854cd7b4954dbbe88"},
+    {"0000000000000000000000000000000000000000000000000000000000001190", "008e0a8d28735fb9cf5f448996d2ba76d7823f434f10d6a2cd14600b1d5deb743bfa24557210157f719505dbab16bb47fadbfbe4b20dc3cfc9ffa298fdccfb096b2ecf484fd30adeb3b6939d4cd4f33dbe7c65ee039aa58e7061e91b9643c16c0ea8eadf1119fedb1f0cc59fd6701f40dd04ad68a934e64d9a3b53f4aa3f2f4edaf01311c2c4ea5084278b472c9dbcb03e217e34dcf28f195c7b6d952595b81dc7a87fb7a13e15bb0406ea3744d5804fb73f280011dde222bd86d94b5e12ded672a5cbd51307c2e307b5d4b9e21ffbda2f4b0893da708f4c64c4997c526d34a6586e29837d843a1699441552d524efee90e8279763f72b027e59a87a15fd01adfae31d87b13ba75def47c8a6c2ae764d2f1a820146de0d779bf0433304bfaa66656165ba62ee2216ce7fae3c698bff1704391af5a42d51f39906254d2b2f26611e72ebac3bd5f2cdf85d53414ddec2cd037bc91dfe8ff0572ac7e8a5b4ffb7fe4311dec88d07e997b01c1feda17d67f08bd57ad8b08b66ae88b203f3e9579189d20ec1bf5124ee7caabdd9ccd6bd56141539b2b5087ebd08c8a3c1dd7a27bd583c6dae900777fd64f4b8e9ade68c05bce7c6221ba0b85ddc9e2b660da1e75869d580a3f336a56eeb77c5c19fc26b0c73dccf9218c7f55831d1e2a94cc7f9922331d22e1978bcba34d06b91d356a5c60734d89de3cc9e48380b4f299f0493e1d52240d801e67b4ad61e9c966d6c46a6b38ef4ab6115ce7db5023a339e457c816d32e12b8e03d2fad1b88b41fad7810245162ee6c4fc6ccf45ee6f880c954af7d357280f29c1c912c0a99d4fa410a66c7be31fc81530fbe5c35ad9f276c6e9170d8137976e73f3a1c885ea7d7466efd47cb19decb9181d1468cbae0432d915a5a7e7327f4ca16b0d335fd7f11a2e256c59d487679040d5b6843a416590e9583d2202c5b61c3588b4f2e68dc49bc6c80df678b41c80926f793e42225d156d81e22902e777596a67eb38aed60308f7791d21d02d4670e4afdce1ac3d38c5f6056e188cb10003dbd4a949aef1adb5e0549d79c3faf719143cef9a99972df9394e73aa91c3ca9993a0f4fc571cf04bcbd2cc3bb6cf5ee4d0c3c8936d496e5aca6c28503eaef65c16d1d8f8e2f0837f9928e2e45ec3663a54e451338f5d3beb9f7506b3b04e6588dd1ad7660458bf3cd7d69fb0ce1cd26bb85bacde9c1137bf510b6bf0bbc2caeff8acf9f3d38f61d74aae619af9450af04aae0873fff9b0b7519855cc9591d0d518f70a19a6594d478e60d5178494e547d034c7904abef270055792242dcaef3a7acbd1a9d76ba2c3a40e9f9a740fb4bf9de6c402d7bcfeb202e37c5809dc8b1a0cdb0959ca22c88b9329bf7dc2e435c0d1cdc3fab01b9211f088d01cd5bb91cb06217ba995ad3d0e03793c1903e64b43df12c4337148c067749636554428cbdd0b203a5f0fcf38aae1d83f562c8bf37e99e1500f18860974aa731d54f952f35f52716248b7b9c8ddf02ef51d8da60aaa78e4fbd64512d752c20489d7e93bbdf10ca5adbe825efd1f1e60356ed3ee16464ccc9df6951eb12720144831c9713f45c530f805557d873ca94612e6e99c161d2ef31221e1524d414f7b06e89acbf5216bee10e70c715f740b85ed8bdf15b6181236af6e0e9a7dcf33974ee922fe5682e0c87ef2b06df73095320c82364e28fa53c67bc6cbc9573fe6347bdb230310a221d648dd717fbe88026a52561f77032e9cc73b271c1ddc75e626155116c2c01ea4e1ed232c5e5a451056d10cfc13c4454efeb6fdd141162e19d7f274782c45fdc70e16e7bb3a784390e3f71052ab291aa5d2112501db51250917891e58e283d78bff3fbbbc7c4112b29e8ec9fe3ee3fbb091f456711d5192bcd9cea5"},
+    {"000000000000000000000000000000000000000000000000000000000000130b", "017acafe3934c0f3b2595a9f9e71c84eeda3dbc2851f9fa4f3f91b641940d8d2522723f90642b93f56481fb42edb33d63983b630d21f04a33c1102be9b7b8829c32739f8d6ee22d1afa394fc414321746cb7b58d0b419c7d33a02db75efbf54eca5f7a33307d5a7b570eb455a34ab3a901e11f21ec8f9db329a1b29e7d370e56fbdb418dba8363ccc10dea501a2ed0825a4b8854fe55cf8499d1f8de6aaba0a4fffc335b43dd981e02af1c719e0e01bf236e52704f5db678d24fb8c17628abfa82bc1249b4d4401409a1decb3ac891dc9ba539d9776a5392b7b7eb10387b786921f2534b3ca2fd3db8f2ac07d4f77974d165c6dbf59379b9b039628c0376b0b42e6e4f41f2cdd3084cc0d3f5f85bf2191f0a4337386326cf9bda72d1c800ffc3c649447727621a30ed8796e085af0de481ccc2ca6bfcd7c9f44cbf287655763ecf5ff3b1e835f77beb4ff19a319a1acc020fe9ef526da61de2efb0df7a3e392cf440ed3d080b1e6cdd9a8cc3ab02ff94d684bd725e4c3298af4c1829e76017c84f3bc9ba659226d82b25688472098e2b69eb1c6ab0bfabc53e66490c521d76298c7f8baa0be26e87214db5090b19d43867e3de7eefee7b24d62165c966448ffb937d0093acd43ddb018196f415fc10b31d930e8a1dad2dd2a17e0eff383c95cb298ff32481a5b734f3309fd520b27ba1d3604e5f5f1dcefa04fdc4c2f34f1354873c5059441b809347cd3e233538b43fa96867a7ab8423962662d4ea1a24033b109810f60f33b51fd85dce52f36cb93af296f51a3f51bd32465fe792e320a34729e5c504e64c15d86373552f08ef1a4cfccaacbb3aaf31e92efd971ec3933d56a3093ce8c719a7b619bf53f32a94b04c12f8cb1be5ca0df68faeca370e21f8d302bfb2eaab56239059f7a51734e92d609bc3f926d644a65bb18749e4ddb97e0c0235f514a029a45dc54fe2c54e192ae54fd419574e55401b6b1f1c3e474a66459e3dad6d21847b9489f9044dae6767d94ea3f06b524caf484628c8360b0ca63a3cd205e81164ddfd9c66ee77d055eaa4a616edd2084e16ca86830de419b79415aa7d4745b75e91017409f16d1f5a893c45170b1336f8ad16cb340659a1f310ec4b76b34fce27f284b9d6dd6880eed38459600117071fd95d11992152b4221483e077ad7b70ad2c4602c01fbce1dc1697d70df210bdaa23c4a9103da8bc236c2e1918dcb4dfea88f6b282e5a753395e7fe4f8196bfd30520ad953f932021833985439273f1d0b6a19a4dc7d2f8ac9e9f20cf55c72c5eccdf5d4109cf81420eb9c1acf8d7e9bb79736535bdf4a65acf9c7f924a1057c3f20c14f2b5d8844fc48ca2e9028fe936d283b9adc006e6b5b7a8697afd47ed29b0c111d7d5e438cbd7b5220dccf7a2b36d5325eb2bebf0cbfe70d0516ce827089c3614f5e907a3bd016853dd77a687a34593360215a04ef502e19ccf4e0307e7588bc639d0c8e4bc01be77e8751f002a91de6ce357030130e9622949cf56764fd85bccd8a17cc7ed3ea975b976524153a3d6007a9e01de09801a43b5235518d873857ba24811c29429819ad5b7dd5066f57fa5fe10f7f3b6e1976074c1fa26e6de2c5942352dec3e5d9f29a048240e8ede2f87b8b4dfa1894c1cff217a59f03360894060a0e44e88bbabdece032f511c39425610696d2622921bcce6d3427b9ee35cabb535afc96d2601ddb360e35c660eb4e966576eff240edfebb910f4d1107b820cc1f675cd1b7c8bb2472b0b9beef43797d9c6fe30ab33a2c31979d01302b03db864c66b163ba3a369826f331d65f74a71dc66539aa76fe765a889096264a1b82278d78d76df7a9b21359cae5744d28d3eae7fc5e86acb7e3daaf4bf62a196abdf7f80a9d8319d242"},
+    {"0000000000000000000000000000000000000000000000000000000000000154", "00a5d3d4fee34b1fd4fdd07abe65572e81e878262f06de2c3cc845e4074455648fa6b462a658ea18cf15075fa926d4dccce18f9bc12ba64e55dc9521f279b121fcf3a89dd72c3f6b03626f92a8b6ee0cd938b06103f3183339029f12317da6e277b95b27be997e5c1e11a1a8c273a86251c3324292d96beb8a54b69ebebc1546578c32aa0cbd7b70c63023ca035991d04f24df26ee278573dc1b7ef736945cdd7d6366ceb43a7ee512979207180be214c0bc8246bc695934e42ac9aa921aecad62106ec14bdc6af4aeb14a7589a280745f5a31ebae70422c8cbfb16f0336c625d3b2d7765f55045bef7d12a9dbfc15aa1b67037a720a961e621f78cf140d6e9f791a7e4dd95eb598acb370c63ac21dd5796257de205e3b0f11fcdfe6ee72b9d8bdd07f554e5e158a4bba9aa2af078988152d11d8ac7dfa06d957ce7c6badf323b3c275dde88a955f6959a7aa701fcd9000e43e4b27d850f7a2ad1547df42c14f808dbcb2eb256af40a3a1d348af684b491a9296e2a4720f79da316fdae084c124235ccaef3e84a478d8efabe9ae3615b9623976c3b1d47fbd9194f875fa75e6d723b5e9a0ef05fb7340b49cebea8b27da369aa8947fa56a5ed4b58b619ec2b6e7b7b68180cfbe28ff2edbe7e4aca16385a5122520ef544a2760722c3bdca8347dedd043e6646bce22147bfec2015fc19d3aaeadc5c5d012916ceefe7000d1e99e6448247a542fb994fcc2f089844fa957e5a958f736836d76b74e3a16a15b872d66120f56a2ca7661d2d5baf82e2d2b86e40c6bf4978002c7ba417dee26ee9abdca32aa56e46e5c6a26e980e1ca9e9b623cca30fbe8ba57a7b36850e4ff25ba8911d61da4e58cb7a5bf97052663fe93054c3114dee5221a3818d27238e69978e928a62ca51e4a9ab927eb12ec8c544615968b5dee90512ed61f76ec9e5bd0c1601c4f95b0221f55f345a722e68249a8c9ae33cc5290e6add805dd8632fd3f6f11d20df3622fdc33fe12619bbd9b2e6cbfb349503d4721d61f7556e9598850b1f6a22fb98c84da6f1cdc7c474cd4fa29a87bd6a5d0895f9a350c68161ac25b25a4a308b8d74e99b8d28150e77b06f526ff35acf91ded8944fd4b00d8c2fbf2166a2ec5cea7491c7a783ba7e728cede2e29660a424da32631e25faf3f0ed130451ed404ab8dc19030002fdb7cb4f2159b32913cae7265e9f92e3db5f57303f8e564e36d48d3f9032eaf137fb547b4da61e97b31e7455bb1ed22620bd6f355ff93ff312d584fb8cbd6966ee6b1e66fba378d1c6f651df4c1b44771d38840925a185af89961b4576825bc53c927ac2173f765b1e914ddb1e9ec2f1b708a36826bf8351bd26dd7a312978f2da5fdbbfc323bb64fcc0abe7a547795cdda1359205a0c9eb9637696583e1c46b2e2adead79442e03650780c74b8be92ed32767b97a82af38d4dd3cbe03cd9f669aa0c6918dc3833c96739b95e704defccc0392dcdedb687e2b7eaf848600fe891b713dbcc881139e0ace7708fc173bfffade3974006ed85a7e4432074b3c1626c8ee2e6924c1812b49f2e69aaadc139d35c3f225c86ba517a709c3de093d6e5b6c5edf3082153acdf0c828465f73b7c5644c59632db350572bbe6eeeadab9aa64d47c3c9d8588cf1836668ee56e6c305909ff879e6a24d4e7b74967331fe4a6e8e15479507089c835171f32df51218d0cac890727e5a1409d909085542a3d5c4a94c3ef6a4a5e0c629ce86f2f438284fe98899569490bbd36356dddfc08e955a7fe25009d1aac858779ae9d18260d5167a241e3e1f9f9c3012370bc4764cb5c87d1f928b309a469a73dd5fd4281cd37df42ad67df94b2b64ce2abd1fc568e15f3067561af7cd63e3bb39d4a0e6a2826db49236aa1b1925"},
+    {"0000000000000000000000000000000000000000000000000000000000000bf6", "00282ba93bcb748b9fe6c7aeb755207f59377f360909990ac08116e389e69be15ecf7c37cce244bf07f10d031b17ccce0054841041acadfcd43262237f4a1a1661bb5a4e953b64b133eba14de1454723d6fd0615059d44488a0a3dff454506b0df4cbfbdb52a5d31700a4815198a461164efcb02de304ac5791c663676250a0e88623eb044af889e8653b963e22edfb05959550cfc12e11a57f880c66b714c2ea0d9d90506f3d7ac0129671ddd06950d1d59d273a53716da86d23c678627b0f647cf916c39813d96c6a5d020ae019616297718390a2e8651535fb415f3f1bfb69bef56025b60f11a49a0fca3314367c971b3741e304df69f16f66ac6051c203f7710369731b940a6fbe39e572b569e0cba112510c6dfd2df13d07c712279a5cb18ccf72acbcf0870276273ca2810d23861751b8ea43d805a6f9f540b36c0ef5a776fc1e3252259f7476c3eab107f78fa016bd2cd6059a333472c12de5619a53532bd0b244c2884fce94058873dbf052565013bdad9f4ed3755101a5c2dfc485cafe7a93a02ddaf66d5bcc7e934271825a6d4610228d65faf9c33bd4abc47ed0c158d3118044ddcd7bbda0c8da8445547dbec49d5ba69b04c633c45ba2daa9c165ae6a19590ea371d1185c1f6b71d1bf9bce2e612fae9803771f5f866e97d29e339f6cd20cbb4e11b5948ab52242346badb1dc29e8cdff7a30cb7f36e98cc955d8547f21e53b2a3412493ae9e231eb39cf1b5d0c37734280707d7ce057610d3f5b19c0cb9fc2cca0b9c7b8223b6ff8abf2ef1f939f7119f0e650ad1ae19a2f59fb5f3a3adc1b405b45f2f098a0ed1e42bd989715f2be63802daf66e06b795588cb41342e9c1208f0133d10f7942b74a23ffa6f15e4330193ef7aecc465e8d5ffa43aed367d1878f6d9db22d4d2544f779a93f977171d656bbc297321fc51ce13d010072361ec47cf7a00da0146f4e12d2f1f317e8fe229fce879a710d0dddbf6302e95ba70a8bbe36c9e60436007615ee5447af6322c3c97336c1bcb53722cb06822cdee647451097c0343acfdf52122622f76330022f52da86c6db1ec59b00848dcc168c687274080d03fe55484049e8009f6102ffeaa30f1e61117dcc0125327635bc25a55f59d2a4eeb7a93c69f5179e027e62d3c7a1e9f5b5c5e62888b6ac6c0c9ac75cbeb80d0e78538a86f5754bbd348465f44ca69e4a0237345d1d1b3acdd80e5cc16aec3a5ed3e7e79ed392799dc31076a6cecb8714bf3db1214722f8c731c15318de02170e5dc8fdf20bc197eb54108f3eb1e909f6108a580ff95c46400fb99b7ea0bdf381fa13a7bb757ef276320536a1e932e9bbd00dbc60ac6da1932050bf8aed1aab952a1b48c69aaf8082cae078dbe0ead6b267062763ac5297619cd59b7ad28a736d13a63082130b7e02bda966daecc28faf7a116331943400e7d4ef98e2153f99303dd2360944bb625dd997e1116f381f4c5e156eb7e9ede55b51f72f533568daab153eae30a72d1f923a3f0b181ccd77f2b313fae04a2e8cb65f1c13078bf500c90f660dcf0e232015bb577d837c33b42f0d8c5588de54aacecfa6e293e8f5059d48b8d8cce6081bf68686ad56c7ea9580ecb6f911c9fc1911dfe11eeb1729cf0bf5c5297378c0145c653b98ff9fe7a6038b1c01442f6937c7eb239f6fb55cc501c77b3b122a5e5e316a4b656f80f418078149378ab8c8386d6c2e07a1a02d4cc5bc6fc455ade53a8e1e017bf5e62635934396d7aa6487afb186800c368166093839f1a203fe37e276016b8c504863fd36b12abd1982374d053e3252710aac3e6596853a5b706b489ec3cadefff817681b3687a601c17916540e2dc47b2278891dac77188bd713f2cfa189a5ac819acd21a32738095d4005"},
+    {"0000000000000000000000000000000000000000000000000000000000000904", "00d3689dcc540c42a60c1955cb611252b16afb7b770a0c061f9f943b16df69b808226189168d9eddee4c20db4c67daa9fb4d750c139d823804418e5f305dc0253293ccfd8a8026728235c937d0fb7a71cd1b874a064eb4d9255120f9d1daa37d595d109e8422db2c083039dc737de08c6f8ab0858d577cfb921af57fd6e11d6034cd9172f7e1ee6733fd76e76f1a449335c79d33b4f36208a183e1715903fb73e103bdd1fadc2252018eed1ada9a05bcf79ef79dc5e348c717d91dea9e3dae536e0813785d7c420504706e8f8a245218a69224e5d2b931e838b9cbcd23bc6c494e8e0b06f131414e9c8b2abf25529d8dff37ed8cf5b6be7833d53b3308a1dd148b93ec6bdb81d26b524f5ded8a3a7b0963099ea8f1b2893bf5bc1fd462a26d2f5b64a33c77951c5276eaf2f7737bebdbe4da87b34f028f86f7a388241d679fc65fb01fa8cee70001c405a293d0dadbaf02c65578c82a734b68cd83cf6a61591552d0bbad2a054c9bc71103dda2f491c3bd9ca532eb4797fbc8410e3fbdcb80a650eff265047199ab1a663cd873187932002d569511fdabda89e4ece0c8779d85d3b0d7f504984ea2431ed291ec944103fec85e78c9802be56006795135cce27499d912417df752d07e8141de3934091d6ed71e674ce79092e357424d2bae89a4df4ded1f64d9f3299b390b9869b24cb07d3e3a77cfdca58c03f008fb96cc6c3a78a5c281fde00d615e53558312142fd1207aec9e437792b57f66f965016739dc34e20934d4df4312742ba90b53b73ac71b77a7099f7f76250bf17ae499f863c800f73f0f5ed1cb57fbfd5ad7064288d9aec3c43c60a754e22d72013dde889a7a770a2dc7076e223e7df64a8373dbd75ed15ad012e2e327f7f716a9920a31c37522b602d30c4500e9fa81f63a13872dfd6c4713d21d67218474606e21157726aa00f3ec523f09d997cc5672ed83be986d3a430ad42e07452773904510fa39013bf6cee0f16beaa7df990b027d8b3ffe11cdc4aaa08331ffa14b2a8e33d7c1b018b20b6703d773b7f7769a92c95b3cdf58603f8b7105658e528d10ea212621a316a0d7db0e5e5d5c0c5108588419d664f2818f2837877d7d4592260134d46e20aaf1a276273fdd83a057a93f7739eb61a2fe875081928c146f70c567d07afab8056027137d3cff9bfc08c1e66717963b0d81b3b4a5a56d5c1d6fe8992fba10d179371c0ecd5fff9236b566fcfbf6faf19b999e0b8cecb0b3c86d63251bb23c13fc7ebd1aa132dd534d9ad56b0e7115e39cba898f3e639b628a869fd4a10d2bd19e9a6ad93ba011754537e1c0c20c46b90fe61ed75d45e31802a1d9f5432b5e7fd03e22cb976fcf125839f51aabd9fb729d55547dd2ba52179bb1566c42d6d61b4752878d2cbc76b42dfa56c24ff2bd538a032eef10474f7dc9a9ec8155c17abdbc9c16d942c935de1286caa3ea6f3bd686a3e77d9bef8ad51c9cb9264c656379b8e1c5dc5aa7421ae4c85e87577e5ef42f8eec68621066d9851454e0f9bd232dbe53f1546d099280e0ab853164df3e909d579329a5503d1be23750287e87276b9979b65936fce3414c9e1875b75a9610d58609bac54e9e98bf733ddbcd3c211c88af9ead39cd3d79c5564041ac7557554df2fe56b3c4374d630c1a056d955bf0256a4d7105b0b1dbf1d8bf9ebd8d1ec3914b339f44acfa72a78e5e7b17b2074319e09117ebd7cbb5788b47dade776d5dd6a01a1b9d57c4842d50cc64d9ad86c7ba543460d45b3bca6e9adec09e0c2b5b8679cddf19265ef13f8a7d9e1aa66456204a44c1d551b5dbcecffb0664bafbd5aef18bdfd8245814713a5cfed1d7e508fc4184c7e912e15df0f1f22e20d90515fe0ae7699a04b77d03bc399217f8f13453"},
+    {"0000000000000000000000000000000000000000000000000000000000000869", "000a133e004e8576d8a950506bbf02c532919e76d30d102bd973ac33e17a11924dc35d0d00a239af04c80305f426deeac771c1b0a77a71c616da7f8556c18211b60af3949c3cf59f41c1d6ebd5bbc8911793ce0a015ce8d90ec5759c7be7119fcf1b0b08cbd1feb72407aaeedc0256f7b93c38b494bb6ef8f63571b25b2e13270c46e349ba50ac6bc2352a274520f7c3570a9519fec71b4bce532d6b9d943f8ecb6a698566f5953c0d8324db8fc786f30bd923f64172e83e5afe1f120450e4b6b984592a05cf10c88e057638863657bb164c11604a27af048ba55881f162612327bf0717bb0e6b31e1ec87ced10ca4bcc2a5c969f72eeed6439845cc1116a66606c58e88f8629562176d37a9bea10df69f19b0044fc3dec2e9f823f48a5e4c0746c1369e779a16201c405dd78b5f7501796f8f528f02e0653c61bf3801f2fd8b15e0d0b99398a72470e9d672929c21ee01623e0caf809c5d507eca8698fa8ba2ed40d9adb20beb65902c04a3c9684801c58e43c3f4cb235da033094a6735b9a6a85df77260e97339e3f90fbe546e83211c19fd256a7b4993490867537b10ab25585b845f07fea658644a00617ca25ac34fed58d6eb615a402d1bf431987b4d4eb09b76e2a1e2a93b50c891ad377e13f87d68c6a4b4e77dd324bdcd7b890dc0fa3b741d393cfbfeecd55b692f28aacd80da987edb685f33e50b8384b1fc69183348e295d8d3ed6a49c2139807fd399b9ff2319cb86902de5831e27bd32b1b0d1d82601abe4bf7e9af272daa1e82abfc71d111c0d2d7aa493073f58acb193f7b688434fce9cf07da92f53f3f3e0d275cda0e5d39978333213dbe235124931f2e262c1db1e6690e675595b9d7023d1c52d017a4725d3b4d34cca34c1ace4c61081a23c51671d565af4313d0204b245e833f625dd58b8b689a535c5b1730601db9c1000bf025d7dbbce5bdc612ec5aa69526057dfae4ec1b031c67362473f1edc5832d2dda48ace1d8073f0405611a4dfb8ea2f9048701914a6da6486b1a1198e72e1624b15714798ef272ba3c6a7cc02f065fbfeb2407481c06459f67a1040b80b0b527feb98cf47ba0846ac99367a9e235cb4bc86bd99ee087ff3f573de103079daeb9dc4f1d89ecd5632570f99815004a6e9a4b081dc60c2351b26503c753e58ed7f96ddae0f52d570543bdc5c8c1a6b7cad543caafaa0288f6bf35a5591ea349b6b158fb3f67670205a6f2d586ed76dd7d890a258d6c72a21bef6cec0196a2599ca521b2d4cdc133fb3b06deda3609da34473f665968ab73b6fc50cc0a5436ece951ac49fa81e8c58f75c20e629397b0ed17d0f61b499404cb6f15d1fb8c44f95d9f68168da20be3e48d8d56df832abc2104c84a35bc95d091fb4917e962a68a9480318bb3333bf1406214fe8792ab18031fda9e42267669ea92457855fd5cf5973914d947070751755850dd0da33a24843bc06159eca8b1f2044f927c702c67ea375c02b7dd4169b1f291a0dacfe0504fc75f70d88b77179d78bcd169a7dbc7e03ea3c311c5e0e440dfb737b89fa5eaa6c4469af88a996c692ef2aa6d73f1eeb9cc8817794bed7a2622487a9bd926aa49b1a1cf93a3412273b53a68c4e4fbb6b789d380f7f4419921d1ab19d63a4cdcd6537f40237e020304c5d270d75fb6bb1386c7ed34e47e330a7ddc5729077a864746915ce8f995a2f0bbbd53e1a3d813ffbd04ccd6f952919c934731d43d396370b9c7e051b5e7052ea3c794c2a84f43310346c45b05acd42b78173605615f6f2bd9b9e7b596e2311f9604b94730b9a7ba1450878a90d6d80743a1f2011c95035971af9ab344073bf4f7ec65aca969b565336272059db9b3dbbbcb2729f74f74379327f986d45162bfd1c557dc2ebe79"},
+    {"00000000000000000000000000000000000000000000000000000000000015b8", "00e32ae2030b9cd4f0f3d7b26b711d260f14f4013b0489ad07dea76647ea6b6203b8f7cddeb68557f31e025d939699a83153a3dcb38e7ba92d19d35db29844250db9d5924b779af274d4d16370ced59f862d10960aad7919aeaef325ccb127ea7d60e84a40b577a1ad160d75fd1607bea35813a3b6cee4c999106c5726c41caa34dde44c9ea8ffa512e4ab35da2ccfb06c76ae601bac4ee8b42eb7e01ab62dcd771ec5cc41f0778c04eab882b3966abfcb22c08a832d5d172be3fb5b7b3680be82569c9ce734edc9cdc0650502f2f5387c2c0d92ffe7138c3f04f1ab916b1e37dd111e3e9947ae149571d9aa455e349f7c47711f7b952abc3c1897970b0b9f55af84dc84712333123453e01d228ade0e7f33c38673670dbf81326898937e4982f705e75984f811e4020bd5dd973193ca052b8c344077524cdf56dd2bbf1397951bd379187a63ee7762173202c33bd97801d8b6dcaa9fb753b730e24e8d522c462f725fd81e3817b529f5535a2d6ba074849afeea75678df9ea5019e9fca0021b29ead99b45b0325970c5ec71f44ba03207b6d48c5db78902e5068cdaf72d89b2fd9086390c415b1e26551f0f55f359731bd392a2ff1cdc113f32bd62fa8271896bc98af65694480145b130fa7c4c23b95281ade2e2893cadc31134f6e380ce8b08960626d7553a57940977cd83941c0c774a128d3bbc27210959147240c88d26dffaa2d7ecae87ad8bac2cf4a659448f117b9d63d5cc7fe76016d8e5da5ffa9390130be7f42a6199ad2f2b8631741427f4e93c7d7a517113fc63505d54ff0de4401693e96d7f226584b8e99525f93774e312c6dfdc147402316cb11561c4fd8a2d4edc1ae535dbcf3f8fabd7dd03fb00470f739fc1973cd3a72a3f167345a67ce6d5e1d0545a4a225d70af453f0d501b5f991b6f00552aef6634d23877d2485f011362966be5411d2e65b44c40b36615ce7c17bf0c43a3fda585d54ecb86939657ea528a56b5ab19f0ba0f8502d3a6f384a9b875d0fc96cd10657d0018d566293956c918136fb0cb9e799aabed7abab66bdcd24b0be6ed045630e13ff20a6c4600f9912fcd7d7e7b5842420c0a71e522394d7f8536604105ef15df9af8793579437920d3ca20ad23176f3053c51bacfc9d70d14c2b447d0fdc8d8becb115440148fadd65b6bd3b0203d34628da5381f0da4077397e417e4e2e5218af8f16674b9cc3a61373f7d821a3af41b28879add5cd4511337c6fa71546deba5d882fc35450ca8095bf7be3154cfb8da0dbdca95c05f34f87ce200e2c42f5ebd2081fe95054967b10fe6213baf35d29c4fe164857ac54dd6e292f97aa2590dd9765784e51c6c3171be4b20b0ef2ef0acb2b11b0b3b2c7eccc0d950750daa3af1ae23e3236c7a18bf902455453f707bdef10dafe5503e276ae6550cd81aaf7f1b67bb544c2192b3870f608f0eac944d50221bd1246d820d4dfba0480197cd8159885fadce642994520d44ae03a9e5a024873e9ff2e6b2a02ea6aa771f55ed3021169a7aea864bf94ca0f21342f38956a2105a37672263460da2049fcf3c43368b73844b380d39e7a142f11335175b274cfe36c11c23dae1c109bd8a61e32fa2cfd221a09bf3a88981937cc1c1a3100818a17d33562ab6960f19bf6757516ce36ab56c87c52f2bf524864a0e4bca8e7534eac1a54eab38493b0cd64db467c91d2e8cec6169e438a29b5b41a58e6a4b15f17f5725c4b3d95925270217e35aba7e3d95adc8adab0d52d05bf2c49922f33cec318dd85bbbcaaf6abec70630e7da1802e042698e5ff21cc34e5df15901dec9db35b1ee41575a01675b8ed26e06ac51dd815bece91e52580b7cbedf7e4f0615147a78c197bd2b6e516fe3510eaeb87819819de7b49"},
+    {"00000000000000000000000000000000000000000000000000000000000010cb", "001c706aaf1d2d270809e6a7d2f0c2e6d14fdeb0fb45a06a7826a9bf5dd9d5351ca95cee56311238e38e265ab1e87b96e535a50b9274a52b7f050e1fdb2a613c8c34e4faeba1f1ab2ff9491d6a3ac2bab6de17f4034e289b81e2f115d98352582f39eabf0ee4b8a63609b1a731b294c00cb7d6050d91af99b5d0c59224bd1cde9904ee54d7c7e069b2548f463389d66fd94f513456a794ce7f6c25ffd2642312db55f952b23adf5e022d01bdc0095ec69602c86404fc877647665a0fbe052b212a8ec9af0e63fa91be31d7aa68f047fbe4f10849c857d496eb0ecb5e516fd336e9ea8ef9bce5e30c712538749a2fd33cbe29a7ba67f63ad4b41cfb8503db6a54cf09d339a6b840961a85daf8cde10e0e7f0530ca61d79d6e71c276a05da5d0fc28658271511a2c66ef1b089ad6ced7897863f35eb94a1f8d7e112340bbbc184fa328cd2480d5eb656ccb3a58f53ffce1018a6b65f742de3599b2e4f0e471a0ce0f4635feae6347b451c0aa6223c319c7559c42a6f621695b15e5026c9eee6324785743a9d1d43eb387fee23dbac6a92be0872fe6f14007e668c2dc4936656d8db61caff901b5c55eb763273f27ee701d04f975c1c7f13b27c40b3e7d442e20f995c8e860c81acf5d9944ae761c7f0774cecfac4f61954822734e27f59de61dfb5df1231e782cb80aa7306163f3c2c96d545a4e7d5cfc7941057dcc28d54fdbebd72f7223bff7e1ef3b993e731f44bae280d9d635c5926e45176255a9f16e1def3472091f7c03bb4d3195d89735d98b4c2841bdc696bd601b3d8d56f4d9f28b4c1dd3882750a9c962e419dac40aec8adc7778b479deedb1105a12a4533c0a3bcbee0d382def81ccc43535c3230cbf24d3c92deabf8ad3122d6509b010c152e0cf6331216de222dce3fa51f712b86777d4cab0f46946a42ecc7cbdc5a52799248c00a39cbb306a08c3f0c592aa08c6140a10bb59daaf1ffb1c3d0612ec912b7dd38cdb744a11109651cd301b33adc52337b3adede8b87cb9704107cb415e83835e2ab4116d9ba7ecfc83c6f49eea3a468cc23ce4c611025ed04229d7cdd9cef38f7dad66517b5d1a9310817a679dfa27f741c62ef98d4771523ada699db7152e806454200f205f27d435311a6d993200a892de3f47a34f10dfa283f92e4ff609a439dd8e5c85b9cef60376ccb769db5c8bda96128e9c55f352d93e39a5cf2d12c6c95aa141355fa1b5e670c90339aa335eff310cd0b53a3e5b391ef35ff3aaf1753eb542dcf689860e57616933f11347891342603b611e7965efd2148309c42bec5b58540d2b5353a9f742111d384009f33116cd0fb759612c0dded96217c01af53564426e3b3f0d7687e1ac911ee2cf3312a1dc60c524f380fd426215b2bfcf3145ec92aa2627bb12647b2ef1ca5e748908ebe5c036433f6749f3d377204a0580f690f50a972565a7288e542a6f6c5c762ed0e8fcd1cf8d9d6c3208ef9f7d6cc4f7b0e701e100ec524258961cb4601725880ba53c9f1f834bd495c42ae382da22705154402a68c9bfda353873f1ebb46396e10daab13e1b14da466184a4af77bce7e0b945b5e8e13f6a578b348b2b37cd3710a197733da82697069a4b39126f9af635bc6d609d5175206a3335f808c820df5b864912f59f55093e3602bc07fad2cc6250c345c3a0d8c7e16a98ef196aebd5a759410dbf9c56468664c211a06d1b699518505f83caccc905db5981d3bb38d7ac89e48549742e7b44e30326ec9b49cec38a614b046ec3f39ab607100ca0d19e94200f4dbd926d77f8fda50ae071e83d13473b3b255b4cf11e2c7252872da68c94d0df9e5626748f2b20af7ba3cf2fb2d64c6160cd984a35151d3963476e8f6c7103fd94370f55edca9a6c15b7699b"},
+    {"0000000000000000000000000000000000000000000000000000000000001652", "000a779571c2b44d7fda937d5fe3bb9e115998225c27b127878d952eb93618234f049d80fdf74af479bc0e06a4ee7c3bf1f1f790a3fb656b9b6e102fd4bf1d37bc3d0c342841d58d6bb8077cc872f75dc09ed87b04f649f7b94de4c79ec550c893a5ce09fcca9c2ec41e996e951bcba813bae46a3ae564d7e2b74216ec1837769d422f628791a33469caccf222ff1cb09c0dc644a863e76ba8ad03b418277a4fc8d1a2294079054105f317a155c9e50b10bd6135d568d9bca73ebe0bfc09d6e360b6e5f6e734d355b727b1ad5e1a5cf6f8f2139e437b24ce679b154ce7934e47e5b38b08dea856305c12403b68b803c334b3a1dbb428b5d9719b4d8406198dae290c1a60d8df246f90d17736a7d5d9bb5a2b23b1a24e13b7873bd5f4c8ace717a5922d6d568e09dc3e4ebf46f037a15721cad1c89748c8e9fcdbc452dae3f63d260103fb3305b9bbc47db57d227f9eda01855c386233d5c5b206c0e98c0c571a145574ed8b01c41de3ce955a87961300a4e8e49df529279d792e02212d5f3145587d6f9bf0e275e0033d049d2984ee03a63cf8270aaa9968a7022d9cc7c8118fcdbd8fa9095f60901160ac5966268b05a3f78d5f27819c10a5121741864fc51b4abf4e52c3dd6b7e9692463ca933204b8f4174a9d2bf521f42253339225e0cb1d9788f25ab39d05a0cc696e3d33567c3ba73e78a0a3d42330249a879614ebc8d783eb2fe55ef9e812ec12ce9070dc8068eab914542a27551bd022dc6493c2a5eda760b506784f7ae16ad9cf601b6b9d6d5a0a9a8ff55bd49a9faedfc21ffa5c864fbfd4aea7a73032cd9b0aa10f9ce5e1d6e898ff162463d28792045ed503010e729cd33e68c9375739c87d3b316ac09699e79b22943276286057ecea191fa6353f119c0fc55560db0ab163c6f320637e3d99be0b8454e3c369f3ac24c5ece8f004a3d5a88cc21f292c6e0f1b4568a006b9ccf3c6d0fecc50d8cdc3d7eef5393a96bb16f399e860f377b0668190b2a05a01463d25a8f3570dfb2d4ee1ab83e09bbbdd6a68f20d5fd64414591438ddcd65e0fb14f0f38e8fa732c82cfdfaeb3bdc8c9f43f0d15de0ef9270afcc9395769c74a4863de8df68ba303ee38a39527bfaa4be42d797591ed74720c6cbede28589e6f12404eb2acfbdd50453ea0d44fefae3e1ee6819c409c0f21f70cc903f3eea75415ca5a74236978a80cd3771566da06fc513d0d8a9ee29f65d527f9a165175aa725808bf060ce3e93545ec355301f7671953179194e75b405acc35fa7f56e271ae8cfde2f3f3f94bf18c80fb6a0cf2a072b578791519cf875c9d86c7251ef470fc008c1ba440527f7df41bbfab4b7e5f7995d0f67185d0127afc6ceaebf375415aaec9d93615fbe1e7b3cb78b3ebf9022034719e860395f02425a28b3326800c06bff8570bf9fc7a090724ace349aa35d38831110204bca839e86f91c433102d21f36b1ad5097b42007b665d46b5daf0dffbc41ef49cd90397d0b1e083112709c889af0db7d9c4421831b651f71ade89676a30b889ab706a6d839586cd3e05ee4001112db88e2d12c71c540a2cb40fe79d4d3a5a355ac1345ad7b4b500e63cf4ccfd694df53b44300add9bc60e2c8bb3c5c24e50f9f30df7a196ea8d37300e934656cec2c3f6301707d660176f9edd674304c29fcca1d6d7c9c6352181344ce010873005edaac7f16e597c7258c5b6e8f2646d2d2a45acdd334e5a3ac041da8ba532ddb6e2b2e9ac20670ce59bcdb13b38e193e7ca33fd4faa93e24f02a49186692d1f022e27579fcb5c4b99c0b88ae26667f70b5d8b387b755969eb7711216996aff8cdc401f833dd0a6ef57b9c9270253e70a4dcc455de0e15c546644401f4a99e6a1f6cf366a94ab9b9a9da237"},
+    {"00000000000000000000000000000000000000000000000000000000000008a3", "00bd559ad249caded7163150acabdd099a9b71d9ef0164c5d5474368d8e29427fad66f52da483cb24dc9099541a094c501522a12d13abc168d9597124cda1b09e8ccd1940fb1079f9bd523095d4a4222091f71d507a6f46ae61a5e4edbd368ac9755ceeaa96bb5559c2e4a76b261af004ffcfc341e305bab61c33a314a2708136892c6a1907dc94b611adbb024919f8fbab1333e0f7550f67b9399f9d806224251fce1fe581eb48d022f32780d1d0f479a0b90e56a445b40daf958ea08459284091c96cb78c3d1981c6359404b5ddbdfb15910c881a317e1bd338d0703eab164458f006b5850d328ac448b1591940bbe06646c1c3dbdd68a7f5d1d9e035de483af172f1dfea3442f487aa3fa6ad9de25180f771303ba48be41ae02b4517b38db6691c59ca7ce0efa114766102c9da3fe9354cad16525cf1c169af65032e2c9a4b5bc8dc5cea89327f3d65a6f491cf7b9016615bf0ddad08b90fcd33ea6673c1127ea92a5ad39533b84ede54811c7cb33ad216e1748fe98bea0010454b56d5e1540a8fdd57bd47c7d8573d9d75f86902be46a7925e3dc43b88e660e39b18c8e2eb439a4611ef1de111193cc7d2ab1358db7f3e05dd4d1dd1ccf2b166968fdcb5c18cca632f4d4998d4cfa37974a202265e71fbfcbd89729b9760dd036b2d594297f62b25b9f87360f6d6ab39372a5d0c5cf78aaedda7f090d055397152aa3943d374585e8bbbd9c06dc99df8d8b0eeb272c96d535997537317fd3587ee2f154fcb4a1061da9cbe782fa16acb2c2ed771849fd9414ceb99e2e94cc8a489e474fe11fd62fd65c5d55a36eb41bc90600b5e4b0dc3529705a7343f1ed08e52f683588f0153897538b32f38de09372603337e8722146db84700811669028a07ffbcee8408956ce92947cbdcd06cd347b1f3c7f1f23911593352178cd56a998e798dc06018981989865229f597f2042a7335f7441e59308362b91e7a2a1a159c9d27195273b31c36188fa9d64ad067578aa0cb55069aefb837c7de2babdbc56aedca62d51874d6e5929c901ed592cf56347c26f7976a0b90785793c7e42792d272956ae8d38d26e1d91d7b5042668be86fd21bac73d6f0422a6c49ffbb4b95fcadc0a0779e0bf13afe5afd9c1f0afd0f829477b79b7951bc1ec704c5ae185bee863e21b23f935842d53a2a70429dfdaa54f20435069461524c474f9e6c33ceaf717334af18008a3ec8f02d24b7174028570ca3d197713d70bdf671f6dcb6cb2552bbdd1c0c73e06febc042530bf7594d49253596db2ece2c6bba5d362787edc086dec83461bfd2b1af5c285235eddbdd0c8fb95011393ecc91d4b82c9a53b4823e756bc3ed9c97762f51758ef4643d760df66d5220ef2a8f16d0d584aa13b47f9ce5e3c95bfc8b527c4af0840547a96e1bab11c026da16b29b571b3c779b405b64c55fb25921d240815a7c92389e4ce0b400d0394244d275a2883fc9cad184a76bc4b67dafb9dd5f296c1fafdd0d52795c90b2359216bd8a3e7b130d2c6883f4b22c61a7edb043b04f1216b98b229bdee9de584f9c3cf51a18452ec346101275e18e9546dd7b1897ff0e56d27052dbc96e1089edee91097a616bd683320a61c3fcd99131be1ce1b1ad10379500751ea1907c550f3c1df249c5c1edb032aa0be98954b435de075e9daff4c3df0f41282e0196d679fa990cb85ea1946e6d0e212ea1f437cce8b1001b5f53545fcc2d862b11bdfdfc23532bd76650d737e7fb49224b7e56b92d79ac74e5b61ea9b3ccc4b0604c6988324320374bd5269f1739f30c4c1e736150b07a9158b152e45588b66ce13d7f33614dc55d18211ad8ba63caad39fee4c15548ef3d40162d6f5b3cd3aa9afeda0a2e20ba02f83c414e9c5e92a863c0eee"},
+    {"000000000000000000000000000000000000000000000000000000000000060a", "01d2f32340427431391d16fabe7b216613d15d80681b62e9583e17017fdb641cb65170856f7448fc274902aeec53d897351cdd2f63ef74a588eac7df5d7bdb1eed33294d8cdf9d8bfcb28b5ee0534a07ec5cc10c03509defdcfe91c7f712d062511b03d228005d65f2173b5f718c4d2dad222fab662bf8f8b2f6d2de109f19b03f9ba70fcebfe3e257de5b5ba2ae85951e382c216f326211cbacdbfe8cc4024be6e39715ec3e368a029e2ddca4e2ca21891592041f956b9b415c5fba8a1915379a8e697b09b7f71302d4d426850ad5352d3e0ffa048387841826e7c6857a38db171572b2f7b6bc158033ee7499e27925c642d403bcd01512425287d303c43f35efc70112da7b91fb6c5506b4acdf0d7f2b0650346a801b280df734410f67d424a583d4efa53f0c8054496d59d613e16950ce9c2ed5fb41625aa25d1f10aea44d57a310e3bd165b333fcd05ff4cfa1a6004062daf12158bbbbae81178efd228997e7cfcd1ba04fc199894475cbdbc55330c482acd6a3b3afbad680d3ef334cc9354919c5af0e977e6d6797ad519e5512d62c72cd398d54ce381652cec4e999da727d3002406c17f4810cd21b7846e64d948d12a5f5a945e4c0408cd0fcf78f00d7f8523d25812fe7034cb1253f3c1098aa4d1c75ff18b110522270bac8e99bcdb365115126f4c0251abfca9d82913a83b2e6eda40503bf007053be4754a85a8f5fbb461fc43d1da45458c6de66f14bd8c1c6645d5b9342d079ddd58ee22189993dff62c94c9e5c56559cbddb7053489ae3f1a55c47340092f616db5fe5349eb3ed6da061bf8f016a02d95291d127b16475487d2bd7ed1d4422428a686bff8f7a9c73872cfdd604f3a92e0efab4f217d6a6339131f6c981515124083e57eb1e1213765564da43eb7b59f0c181dad1ad7954e285fe69c845f9aade7c9199e6a894a0201f8b90a1375ebeda6e68c233f8b163274d512751b65b3919309ba08f986c274de519e5d1c4cbc3a4d06535660c79deefb1810a2da09bac6f911ec1cd37145e3f2cf43d4a6eb9e81e5f904537fbe3dc01c90320b69bcfb5dc3dc1a970225107a416cd9ed0b51a1bc2394aecfbdccd5d9a2c6773b9bd8d241eea492157911464e093a0a77e76ac5746195e606bd58c2bb66d4260c133035d6490d905a842fa95f9f8a1c705a80cd0568245aa790bb0fea59b14fe210a37c5ff175b207448f961807231bf3568a668e5ab8242e71945a891707a696f660922bbeaf1b60bb640732dccecdc8eb3d1a5979e6935540213418c9ea545181c33ea91ec7f70a5c49801547285cf80e91f64ca2fea9ef607faf4365e49ff8a3a8552b7913b847ba52feba644af94b6c21e19ee9250a7927efb755aa243c2a92c9afbd649131a2d4f8bf702107f28fd3d56234bfda6d3eb7e52403e43c54411e0aabe1d111fb845a102b1f96fb5611250eac40028bece3911575d2e34076ad8e272db28405b3bf0dc686fb631251758bd2c9e33a4ef275876626c93d9a2deeeea1e1c785211b63fabf56b3de34dc0d4e7f4f7db40b23aed6f1710d408f407269777a071e737cffdf8f56b78f0fd33f17b0576d45301c82d20ff961fd4459071d4d81e12dca37b5ce2eaf7ad6915f3572ff28d946b6cfbc58766b4b6d7a33feb884e707e5cd61efe796ed9ea021e54f45dfeca3b8954bba3116cf9a92ff2a7fffa2767d9773ae3e7cc8ffe2a60d063ee9ae0c9fbb934d55d6cd4d2ab33d387d9a181769e9215d9892ef4109d2a5a524b3f54ae8ff77561983b9f1291c37d8fdc5b53636de572185001d59c11b242e16e4ac29d37a1f13e74a3bd5062ae31e8f4f1b8568ddf528ebb5d375d368b1e9d535ba2e3aeac93563bf40e3995f3f710cf8895369f17a5a5d14bb6a"},
+    {"0000000000000000000000000000000000000000000000000000000000000e67", "006104bfc0d7d12fed0162241b28c22d415cb1cfce0298bccfdba64f6dd1ea60337cc2e4d07a2a2608811c6349d7c3fa24f5de5a3741e4673a334a157bc7fa446497645065ba7bf319e6084ab828ca589bf6e27505865af28b79e631d46d08bc72f7dee29844d9c4012ee92dbb696f5d137d70b668bff7a3b6a0021cbcf10a915468d66e6b379f96321d2d7e5d4a3e9457c03e0ed89d84b09ee9e9902e31d885a573c961d61ca35004f87f677c1c0bc5f488d05331602f80d9b57d42e906ab11d9be0fdc48b8f1968a87ebea39d083394e481675f2a85e35a76fdd1de94005578d7f693a1fd931472a4cda98ea6f19c532d61a6ecba7a5b7377b48ac08c9c485b7d187e37809d46f80d0f9d17b21fc57782e7716962acf2b6d67f246bfcfdf0aae04efd86fb019cd9e44c9133548ef9251a62eb596009bfeff55e01fa46402d88b00789d0173d96c73fed1aaf737ddbc00b9d2a4b0c56406c5c7371a98ef1fe39ba07d0f511c3457dfa65c99893954b45c89c76d493dbc106dfe1ee42ce1dd9f15c79636c50bfe76a99f1b909993451f39549b5e885c95e7ed75e570377be338d25bf783010541dc774b2b7baac350cc925bc2885f926dc6293e9dba3d86d3a8a1ff5a76c75d60892aedc1bd07e907fb5c3eec0af4e501bac201fa4364355e1daf0bef135d45bc07518f3b92dbe4abed79bb7de16eff7ffd05cd3cbbb283b05220f970d1cda05ea280dc3b684f0def76a6f31c62f39e6e340d2f7a74ca45621f32f41c791c8d5a13bce4a12dc77d7f40d502613454282b2a7b7c717ce58ad96444e327f1be4fd68e2915f30f069fa966b8629621a0ea11abd773a0589476ddefbc15d35bb95e6929f3af87317065100c4ce68327c09910467371ee469069fbfd773223ebd0c2a8a2b7c2c11893dc9cd8d091f0e476b4bd443021595daa9cd40b0283a1da707171afc89bf90a414d19b7a116fecac676aad68670af80f5b539eacbb3e14656edab7aed7910e572e131dba74ded3f34256be26e79ab133620c543cd346925515c433c4586b0e65d98df20607c8fc1104d709b7e9c8125e925a574aeae31b271245e4f6c7d311d9cdc318609960e595d15fd9eb75e357d03be1440d9d42f4994094dd387b02d458e56cd8c3eadf638360a1e2d53321d268eab48c07814ab4acf7dbfee02d774daf574feb9c0bce41c63cfe532eb4c7ece86657034e580bb9b47ebf6d9c528e5e0268ef3553bfc25283d6c9916cddf7129f341006f412f50759cea1f3d4bc67d8d5ba8a2e69f863f5add092a5cecbcc6d60bd61b8980affb1f99cbc145b0c19c98a79d8c7fc45cc9aef7dd2ce9bfba74d8dd6dccf18f26409e883317291cc6e7eae04fa97341f1cd640dedef071e10671e32746226230cd132f7a5f612634529c75b7b938d0566f3f07305d276f2e859100851c42ae052fefb4725d679933bb2e36baa6aa3cc7d1f6626c88f19cf7d13b49d05f686b8f37b82b44cb5bd315e0cb4fbb4bb18ecb40e0a0a8993ceaf329fd72e6ff9339cd77f870728a418d00340d554d7015a1022dbe49bd567b4473305afd1d0ac781199a7e58f2041bd9f1184fb60480d34924e1a793625d7ca514fea1f015a391e5dda8017155b7c80a94b9ba6863523682d2873bbc09e6cb0056ec4d7370db33ed7366511fead2d3b2a825990e922c1cd3180eba683eead129e264a09d92845edb40a2bb5db26a624b12f84e4d60d3ad954c1daefb622ab2d61ab41644e36bffc14a497a8d99bc14fc77072250b0d81157f95aeb0d52c133bf7a87fca50c138f61e37eecc99dcd121bc98b1d843624f90778e7a9ed64c18ca1a88450e5c76a82751948a291caeb301585e78263ddfed46da579fa16574a37776c8ad31d6dc2a66"},
+    {"0000000000000000000000000000000000000000000000000000000000001a1e", "02c15514adacf021e7dc629d773d4eb9b9d4fb7e2f0bd2407da31e4923d48236140e69808da546b6e5ed0cc7515e51102a70df67f67cdc3721130fe67db65e300bcae2168cad7ecd25447c0949243d3eca0aec9b079344297cc4dcef96a1f1dc14e7a4059990f4e583092ad5c6d947c1c09a582435065637e1296eec816d12102b2758094c0665a0b469d176335e4639b368d420611dbf82d13dd5e1b1624b7868c5060459d8cdf80619f75625f4561df9a3e7765dc388a2503bbcf3e01d962c8042f9de6bd39a6538ece99fe6dc399bfa390e8c8d9cce6452ebe7ba1945b0756ee39e4f1e636f5605cea4f4f2ba91f0a2f748827ad725d5177bfb5127b53c7827d385a12d4432a0a8a244bd62d8ee88d028009364b3d94fcd17e6f3f112b15c757a6d9e627937afffbeca1284d3f891a703cd57907289853bd917494d324df71a6e3b2518473233b998e232fab930850783928ff2946959551d8174fbc01ef357c05acdd40a564fe99b4b87fd79a0f247b0bffd1da7a635bb6720f9947f9b26866da04a96fa00b956d6255056d01627cbd41f88d7636b757e72e530c1f4855720d7b6370f2e89749bc85394b74ef46d446aae767aa298e0304c989eea99608f3f8802666778bbbf0f403edf9b8c1ddff3b0abdb2f914b4ff3157ebb9244c83910d2ff26e3f7bd2b4a41278da2e35914f3339eb60eb673d3094e114395921ec7f999b37e1132719b6bec3c4c20364b2635f8d68160f2b9c462482c7d569303df78c80b9c0bd14049a15985ea3aa5a6578a3b5c6b9f73b214f48ad797171f492bad5211b164a5561fdbdf0d8211dc5722a48b4de16de122ffc1f0fa5657489889862c63a3b82b4c7af7f30097eeaffd955659eefa7d2e1447b37fbf659367815b92dd28aa31cd569810dd7f429f2a486ddae7d5c131a667b2c5fca7bd757fa6a802dc0a288dc3a7d92391f496186a32132bc879c0c4042f87432b1cdbe569da105d325097d821c193e3b106bea48a55164bd7d2de0c08bf7d3f2772961cf3b31c5f07a61de7c1d3738cb3eab256992e568cbaa24103d892044f61f23dd296c23936c873c51e383d1b82144dc3e97e8b9f3b916f916590b29c93c9bcde6db01a557312778f562d5dd16877d1f6355a30b29c0ec52cd2ae11171e93db29f57896b6567d6ab74d7ceea804dfd8a0910a5ee2df875427853c2da123307bb0dd59181dfedd9783e4e85a86365b58260a9fb67d644b08dad713428f6306a0ed4973c9f9b9b6658d1fd4693b5da341dd5194d5942ea677b93be4d9c73c548e38092341a411ce321f986e553ff6745dc2464816b8422c935c0f40633a5771d7b3edddc1648e2b453308200d79af05b952d17aa994a1d1d8fbbdf68ded95051324de11b9ff90bd2e9af81625a8d1cd5285bd1e6f0e039a5d2e5b43aa49197ea123b3481c60fa99d43185098683ee4620e871fd1b9118c6998eb4bb9d1dea490b8222218f5792fce4f516a849c15a6ed5c5bc564d122f34c37c22439b4d450223a340729b42c7fe162a08fc2af542dbe8f3492330c8b2f107de7d2ddf172a0deb5df3a94a081968b5b5a321f3a3a5ac94d46dcb12e6f7b889a7dcf96f1e48562be67dca745f5f1d8f2c36fca37ee8cea56414933c655e91a595e3940cee08215963559728f4dbbd32900d1fc23a62fa75dfff13db343b85c73a6aba40d7d3ecc9a44e434d179bfa2636a7cb3b8adfdca3f76a96d3f3baaaf1aaba183c3deec644305f6f7d1fdcc798e36fb2d675aa376a4f12c6aa342214dc1bb979698e71e9a6b67a709e34822f6454c866dcfa7b60f91833346643c2dd12bf0b0f1575133e6905a5e0b28773c9697a47cea5c7d7c1e62bf283b4f6243523e887b566e56a1372f297bb3e33"},
+    {"00000000000000000000000000000000000000000000000000000000000022de", "007f388bed6b91756ea3e0866716ef6e9485fae6160195c7cda5c1e43f96ee359e105bcf4e8c293690420939124f04a0196363910421187811575929db40500b0bfdd1e8964aa334b801e3339a336d585a30852f1dc294a2d3d36f9ecc747458f3d41b4572415496df2a9fb1f882156cdabf9f65e681f38019865d6d47482277e24c9b8973eb34a41254faae4c5e2caa9dde5925ec118f3d8fa767ae00f434645957154367afe72000c59c79182c8faddd24424b9ebbb09ccd651b00540c96b9c7eec648a28a1d72c2e575d0f2250078511a011598db8e0788edf0ddc15ae24b62f63d6f93f71a2743a3c43ece55471a9802a76f31561a6f365c3647029bfa736395883afc0632bc25d4a8661b25d5aa0310f3c3fd3a183e75d359d6de3e5910b5dfbb74b7660af906917dc42b12e3e484aae1dbd20eaee037ef301572b7fc24d85b4aff9c82b27dcd421cee1639230d0188fec59f0dd4c0ced69c1ad07abd23692b1bd30735af942df597dcf6f403a36371bc416cf3e29a58570f586b05c357dc49515689788ad9581b8887dd913a41dc35e1ac9c9f9f4ea534eb6b36cc8af0299b6d3905750425da0366bdc59a7824477d7946b6f35c4ec90b8e61790fa74a4fa92396ea856661027828d40abb11dbe36bba516fe8ec8913106677285a4790d8034d1d1bf9fd87990889ddffc369b954a3d1c172be7e1812226c2b100cbe82c42bf4423456b6cb2bac3b4828135cb54f7a933a01f7f4a2057ad92136ba8e19fec313b412d43c089a71f06fd1625329b78d49ac92c59e4080932ddb1645910fd874dfb1f358e214231f62041acc41fd2c4e7b7127b3042459e1457f6b307fce9825aa4d2b942277f52665f2a77dd107b4f16cb3280f20c7551ff6cd855f97a6144131f69bab5648fb4b81261eefbf629094e8bcc4e36077f46d51a647da51fc01dca9a9ac12e2f7e2e2b1c9229dae099e95370177143d3b38ab661f19758494a01b32f0c27155b45a872a867dc50f9d76473695e9e2c4f9357f5ba6bb6c455d985f4e2c21486fde6576c6a8ceda6e010a7dc2b504130f429ac33376781ee4af5bbe8d768005bc4cb5092b15c4f296a8bd8c54a298eecd790a5161755a8605cc46bf890b8ff93d508501842b78c7261e5deeb1096891c528a300e57bf2f0aa9e8af2623cdf16bba20427704120484b6af8be26e4983d2685c783ce85d0174f84598719c6beefcc3603a94d4aa62750725df50671d7f9903ec255f779643ebd2fd8122fae3319e61928dcdaa44880d6a483140de63d2d7d7dc9dd449e0ee00d908e0f2164fc054198641e8fb0d74279c9b4117884b9335028a9f50c7223d3c03675ecf73329e52603f77f20cffba99356e51a365b75825f7db56d77542784f3c2663c493a2e564d73f753e9d6ebb0c2f2027a2330a7117c67a20507474fc47282a02cb572de17bbc7a335959316f74a05e3687cfb5227bc5b1b7f084f50902760e77740d420df9a495521c09b911e5f199a8343918b8386fc74f22552a76524a22c8c70ff06084e7fefe9b3ab98e004fadf35eb5f60483f287851712d90ebdd6b512877170d3b7fb34f16813917ae3b5ed54ede6081bdd7cc646fb336658121fd8fbafc52959b48d13375dfa4ce8616c157533a05ee1dc1120f215c348b54357d68adb4da7f5f48d55c005b3e7a23d05746e44d968f7601d4dbdff702861030d6e3a4140e6e1a29978be541f713f8e2cc9aa1ac32fecc941ee4aa4c41bc7f91ea5328ff87cbf35a8de17d1d3d1ad6d4384b0df52d10b3984d62e1678e86dd150ee425490bc727ee7107fda0f5d2433ab1c5d407be9d123fad5c201355601d926d3923787be86a4aa5be0b8d5750171ad658f8e97798b5dcaed46345a9af70c441"},
+};
+
+// Copied from src/miner.cpp
+class MinerAddressScript : public CReserveScript
+{
+    // CReserveScript requires implementing this function, so that if an
+    // internal (not-visible) wallet address is used, the wallet can mark it as
+    // important when a block is mined (so it then appears to the user).
+    // If -mineraddress is set, the user already knows about and is managing the
+    // address, so we don't need to do anything here.
+    void KeepScript() {}
+};
+
+// NOTE: These tests rely on CreateNewBlock doing its own self-validation!
+BOOST_AUTO_TEST_CASE(CreateNewBlock_validity)
+{
+    const CChainParams& chainparams = Params(CBaseChainParams::MAIN);
+    boost::shared_ptr<MinerAddressScript> scriptPubKey(new MinerAddressScript());
+    scriptPubKey->reserveScript = CScript() << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f") << OP_CHECKSIG;
+    CBlockTemplate *pblocktemplate;
+    CMutableTransaction tx,tx2;
+    CScript script;
+    uint256 hash;
+    TestMemPoolEntryHelper entry;
+    entry.nFee = 11;
+    entry.dPriority = 111.0;
+    entry.nHeight = 11;
+
+    LOCK(cs_main);
+    fCheckpointsEnabled = false;
+    fCoinbaseEnforcedShieldingEnabled = false;
+
+    // We can't make transactions until we have inputs
+    // Therefore, load 100 blocks :)
+    std::vector<CTransaction*>txFirst;
+    for (unsigned int i = 0; i < sizeof(blockinfo)/sizeof(*blockinfo); ++i)
+    {
+        // Simple block creation, nothing special yet:
+        BOOST_CHECK(pblocktemplate = CreateNewBlock(chainparams, scriptPubKey));
+
+        CBlock *pblock = &pblocktemplate->block; // pointer for convenience
+        pblock->nVersion = 4;
+        // Fake the blocks taking at least nPowTargetSpacing to be mined.
+        // GetMedianTimePast() returns the median of 11 blocks, so the timestamp
+        // of the next block must be six spacings ahead of that to be at least
+        // one spacing ahead of the tip. Within 11 blocks of genesis, the median
+        // will be closer to the tip, and blocks will appear slower.
+        pblock->nTime = chainActive.Tip()->GetMedianTimePast()+6*Params().GetConsensus().PoWTargetSpacing(i);
+        CMutableTransaction txCoinbase(pblock->vtx[0]);
+        txCoinbase.nVersion = 1;
+        txCoinbase.vin[0].scriptSig = CScript() << (chainActive.Height()+1) << OP_0;
+        txCoinbase.vout[0].scriptPubKey = CScript();
+        pblock->vtx[0] = CTransaction(txCoinbase);
+        if (txFirst.size() < 2)
+            txFirst.push_back(new CTransaction(pblock->vtx[0]));
+        pblock->hashMerkleRoot = pblock->BuildMerkleTree();
+        pblock->nNonce = uint256S(blockinfo[i].nonce_hex);
+        pblock->nSolution = ParseHex(blockinfo[i].solution_hex);
+
+/*
+        {
+        arith_uint256 try_nonce(0);
+        unsigned int n = Params().GetConsensus().nEquihashN;
+        unsigned int k = Params().GetConsensus().nEquihashK;
+
+        // Hash state
+        eh_HashState eh_state;
+        EhInitialiseState(n, k, eh_state);
+
+        // I = the block header minus nonce and solution.
+        CEquihashInput I{*pblock};
+        CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+        ss << I;
+
+        // H(I||...
+        eh_state.Update((unsigned char*)&ss[0], ss.size());
+
+        while (true) {
+            pblock->nNonce = ArithToUint256(try_nonce);
+
+            // H(I||V||...
+            eh_HashState curr_state(eh_state);
+            curr_state.Update(pblock->nNonce.begin(), pblock->nNonce.size());
+
+            // Create solver and initialize it.
+            equi eq(1);
+            eq.setstate(curr_state.state);
+
+            // Initialization done, start algo driver.
+            eq.digit0(0);
+            eq.xfull = eq.bfull = eq.hfull = 0;
+            eq.showbsizes(0);
+            for (u32 r = 1; r < WK; r++) {
+                (r&1) ? eq.digitodd(r, 0) : eq.digiteven(r, 0);
+                eq.xfull = eq.bfull = eq.hfull = 0;
+                eq.showbsizes(r);
+            }
+            eq.digitK(0);
+
+            // Convert solution indices to byte array (decompress) and pass it to validBlock method.
+            std::set<std::vector<unsigned char>> solns;
+            for (size_t s = 0; s < eq.nsols; s++) {
+                LogPrint("pow", "Checking solution %d\n", s+1);
+                std::vector<eh_index> index_vector(PROOFSIZE);
+                for (size_t i = 0; i < PROOFSIZE; i++) {
+                    index_vector[i] = eq.sols[s][i];
+                }
+                std::vector<unsigned char> sol_char = GetMinimalFromIndices(index_vector, DIGITBITS);
+                solns.insert(sol_char);
+            }
+
+            for (auto soln : solns) {
+                if (!librustzcash_eh_isvalid(
+                    n, k,
+                    (unsigned char*)&ss[0], ss.size(),
+                    pblock->nNonce.begin(), pblock->nNonce.size(),
+                    soln.data(), soln.size())) continue;
+                pblock->nSolution = soln;
+
+                CValidationState state;
+                
+                if (ProcessNewBlock(state, NULL, pblock, true, NULL) && state.IsValid()) {
+                    goto foundit;
+                }
+
+                //std::cout << state.GetRejectReason() << std::endl;
+            }
+
+            try_nonce += 1;
+        }
+        foundit:
+
+            std::cout << "    {\"" << pblock->nNonce.GetHex() << "\", \"";
+            std::cout << HexStr(pblock->nSolution.begin(), pblock->nSolution.end());
+            std::cout << "\"}," << std::endl;
+
+        }
+*/
+
+        // These tests assume null hashBlockCommitments (before Sapling)
+        pblock->hashBlockCommitments = uint256();
+
+        CValidationState state;
+        BOOST_CHECK(ProcessNewBlock(state, chainparams, NULL, pblock, true, NULL));
+        BOOST_CHECK_MESSAGE(state.IsValid(), state.GetRejectReason());
+        pblock->hashPrevBlock = pblock->GetHash();
+
+        // Need to recreate the template each round because of mining slow start
+        delete pblocktemplate;
+    }
+
+    // Just to make sure we can still make simple blocks
+    BOOST_CHECK(pblocktemplate = CreateNewBlock(chainparams, scriptPubKey));
+    delete pblocktemplate;
+
+    // block sigops > limit: 1000 CHECKMULTISIG + 1
+    tx.vin.resize(1);
+    // NOTE: OP_NOP is used to force 20 SigOps for the CHECKMULTISIG
+    tx.vin[0].scriptSig = CScript() << OP_0 << OP_0 << OP_0 << OP_NOP << OP_CHECKMULTISIG << OP_1;
+    tx.vin[0].prevout.hash = txFirst[0]->GetHash();
+    tx.vin[0].prevout.n = 0;
+    tx.vout.resize(1);
+    tx.vout[0].nValue = 50000LL;
+    for (unsigned int i = 0; i < 1001; ++i)
+    {
+        tx.vout[0].nValue -= 10;
+        hash = tx.GetHash();
+        bool spendsCoinbase = (i == 0) ? true : false; // only first tx spends coinbase
+        mempool.addUnchecked(hash, entry.Time(GetTime()).SpendsCoinbase(spendsCoinbase).FromTx(tx));
+        tx.vin[0].prevout.hash = hash;
+    }
+    BOOST_CHECK(pblocktemplate = CreateNewBlock(chainparams, scriptPubKey));
+    delete pblocktemplate;
+    mempool.clear();
+
+    // block size > limit
+    tx.vin[0].scriptSig = CScript();
+    // 18 * (520char + DROP) + OP_1 = 9433 bytes
+    std::vector<unsigned char> vchData(520);
+    for (unsigned int i = 0; i < 18; ++i)
+        tx.vin[0].scriptSig << vchData << OP_DROP;
+    tx.vin[0].scriptSig << OP_1;
+    tx.vin[0].prevout.hash = txFirst[0]->GetHash();
+    tx.vout[0].nValue = 50000LL;
+    for (unsigned int i = 0; i < 128; ++i)
+    {
+        tx.vout[0].nValue -= 350;
+        hash = tx.GetHash();
+        bool spendsCoinbase = (i == 0) ? true : false; // only first tx spends coinbase
+        mempool.addUnchecked(hash, entry.Time(GetTime()).SpendsCoinbase(spendsCoinbase).FromTx(tx));
+        tx.vin[0].prevout.hash = hash;
+    }
+    BOOST_CHECK(pblocktemplate = CreateNewBlock(chainparams, scriptPubKey));
+    delete pblocktemplate;
+    mempool.clear();
+
+    // orphan in mempool
+    hash = tx.GetHash();
+    mempool.addUnchecked(hash, entry.Time(GetTime()).FromTx(tx));
+    BOOST_CHECK(pblocktemplate = CreateNewBlock(chainparams, scriptPubKey));
+    delete pblocktemplate;
+    mempool.clear();
+
+    // child with higher priority than parent
+    tx.vin[0].scriptSig = CScript() << OP_1;
+    tx.vin[0].prevout.hash = txFirst[1]->GetHash();
+    tx.vout[0].nValue = 39000LL;
+    hash = tx.GetHash();
+    mempool.addUnchecked(hash, entry.Time(GetTime()).SpendsCoinbase(true).FromTx(tx));
+    tx.vin[0].prevout.hash = hash;
+    tx.vin.resize(2);
+    tx.vin[1].scriptSig = CScript() << OP_1;
+    tx.vin[1].prevout.hash = txFirst[0]->GetHash();
+    tx.vin[1].prevout.n = 0;
+    tx.vout[0].nValue = 49000LL;
+    hash = tx.GetHash();
+    mempool.addUnchecked(hash, entry.Time(GetTime()).SpendsCoinbase(true).FromTx(tx));
+    BOOST_CHECK(pblocktemplate = CreateNewBlock(chainparams, scriptPubKey));
+    delete pblocktemplate;
+    mempool.clear();
+
+    // coinbase in mempool
+    tx.vin.resize(1);
+    tx.vin[0].prevout.SetNull();
+    tx.vin[0].scriptSig = CScript() << OP_0 << OP_1;
+    tx.vout[0].nValue = 0;
+    hash = tx.GetHash();
+    mempool.addUnchecked(hash, entry.Time(GetTime()).SpendsCoinbase(false).FromTx(tx));
+    BOOST_CHECK(pblocktemplate = CreateNewBlock(chainparams, scriptPubKey));
+    delete pblocktemplate;
+    mempool.clear();
+
+    // invalid (pre-p2sh) txn in mempool
+    tx.vin[0].prevout.hash = txFirst[0]->GetHash();
+    tx.vin[0].prevout.n = 0;
+    tx.vin[0].scriptSig = CScript() << OP_1;
+    tx.vout[0].nValue = 49000LL;
+    script = CScript() << OP_0;
+    tx.vout[0].scriptPubKey = GetScriptForDestination(CScriptID(script));
+    hash = tx.GetHash();
+    mempool.addUnchecked(hash, entry.Time(GetTime()).SpendsCoinbase(true).FromTx(tx));
+    tx.vin[0].prevout.hash = hash;
+    tx.vin[0].scriptSig = CScript() << std::vector<unsigned char>(script.begin(), script.end());
+    tx.vout[0].nValue -= 10000;
+    hash = tx.GetHash();
+    mempool.addUnchecked(hash, entry.Time(GetTime()).SpendsCoinbase(false).FromTx(tx));
+    BOOST_CHECK(pblocktemplate = CreateNewBlock(chainparams, scriptPubKey));
+    delete pblocktemplate;
+    mempool.clear();
+
+    // double spend txn pair in mempool
+    tx.vin[0].prevout.hash = txFirst[0]->GetHash();
+    tx.vin[0].scriptSig = CScript() << OP_1;
+    tx.vout[0].nValue = 49000LL;
+    tx.vout[0].scriptPubKey = CScript() << OP_1;
+    hash = tx.GetHash();
+    mempool.addUnchecked(hash, entry.Time(GetTime()).SpendsCoinbase(true).FromTx(tx));
+    tx.vout[0].scriptPubKey = CScript() << OP_2;
+    hash = tx.GetHash();
+    mempool.addUnchecked(hash, entry.Time(GetTime()).SpendsCoinbase(true).FromTx(tx));
+    BOOST_CHECK(pblocktemplate = CreateNewBlock(chainparams, scriptPubKey));
+    delete pblocktemplate;
+    mempool.clear();
+
+    // subsidy changing
+    int nHeight = chainActive.Height();
+    chainActive.Tip()->nHeight = 209999;
+    BOOST_CHECK(pblocktemplate = CreateNewBlock(chainparams, scriptPubKey));
+    delete pblocktemplate;
+    chainActive.Tip()->nHeight = 210000;
+    BOOST_CHECK(pblocktemplate = CreateNewBlock(chainparams, scriptPubKey));
+    delete pblocktemplate;
+    chainActive.Tip()->nHeight = nHeight;
+
+    // non-final txs in mempool
+    SetMockTime(chainActive.Tip()->GetMedianTimePast()+1);
+
+    // height locked
+    tx.vin[0].prevout.hash = txFirst[0]->GetHash();
+    tx.vin[0].scriptSig = CScript() << OP_1;
+    tx.vin[0].nSequence = 0;
+    tx.vout[0].nValue = 49000LL;
+    tx.vout[0].scriptPubKey = CScript() << OP_1;
+    tx.nLockTime = chainActive.Tip()->nHeight+1;
+    hash = tx.GetHash();
+    mempool.addUnchecked(hash, entry.Time(GetTime()).SpendsCoinbase(true).FromTx(tx));
+    BOOST_CHECK(!CheckFinalTx(tx, LOCKTIME_MEDIAN_TIME_PAST));
+
+    // time locked
+    tx2.vin.resize(1);
+    tx2.vin[0].prevout.hash = txFirst[1]->GetHash();
+    tx2.vin[0].prevout.n = 0;
+    tx2.vin[0].scriptSig = CScript() << OP_1;
+    tx2.vin[0].nSequence = 0;
+    tx2.vout.resize(1);
+    tx2.vout[0].nValue = 79000LL;
+    tx2.vout[0].scriptPubKey = CScript() << OP_1;
+    tx2.nLockTime = chainActive.Tip()->GetMedianTimePast()+1;
+    hash = tx2.GetHash();
+    mempool.addUnchecked(hash, entry.Time(GetTime()).SpendsCoinbase(true).FromTx(tx2));
+    BOOST_CHECK(!CheckFinalTx(tx2, LOCKTIME_MEDIAN_TIME_PAST));
+
+    BOOST_CHECK(pblocktemplate = CreateNewBlock(chainparams, scriptPubKey));
+
+    // Neither tx should have made it into the template.
+    BOOST_CHECK_EQUAL(pblocktemplate->block.vtx.size(), 1);
+    delete pblocktemplate;
+
+    // However if we advance height and time by one, both will.
+    chainActive.Tip()->nHeight++;
+    SetMockTime(chainActive.Tip()->GetMedianTimePast()+2);
+
+    // FIXME: we should *actually* create a new block so the following test
+    //        works; CheckFinalTx() isn't fooled by monkey-patching nHeight.
+    //BOOST_CHECK(CheckFinalTx(tx));
+    //BOOST_CHECK(CheckFinalTx(tx2));
+
+    BOOST_CHECK(pblocktemplate = CreateNewBlock(chainparams, scriptPubKey));
+    BOOST_CHECK_EQUAL(pblocktemplate->block.vtx.size(), 2);
+    delete pblocktemplate;
+
+    chainActive.Tip()->nHeight--;
+    SetMockTime(0);
+    mempool.clear();
+
+    for (CTransaction *tx : txFirst)
+        delete tx;
+
+    fCheckpointsEnabled = true;
+    fCoinbaseEnforcedShieldingEnabled = true;
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/multisig_tests.cpp b/depend/zcash/src/test/multisig_tests.cpp
new file mode 100644
index 000000000..4ad1c8b98
--- /dev/null
+++ b/depend/zcash/src/test/multisig_tests.cpp
@@ -0,0 +1,238 @@
+// Copyright (c) 2011-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "consensus/upgrades.h"
+#include "key.h"
+#include "keystore.h"
+#include "policy/policy.h"
+#include "script/script.h"
+#include "script/script_error.h"
+#include "script/interpreter.h"
+#include "script/sign.h"
+#include "script/ismine.h"
+#include "uint256.h"
+#include "test/test_bitcoin.h"
+
+
+#include <boost/test/unit_test.hpp>
+#include <boost/test/data/test_case.hpp>
+
+using namespace std;
+
+BOOST_FIXTURE_TEST_SUITE(multisig_tests, BasicTestingSetup)
+
+CScript
+sign_multisig(CScript scriptPubKey, vector<CKey> keys, CTransaction transaction, const PrecomputedTransactionData& txdata, int whichIn, uint32_t consensusBranchId)
+{
+    uint256 hash = SignatureHash(scriptPubKey, transaction, whichIn, SIGHASH_ALL, 0, consensusBranchId, txdata);
+
+    CScript result;
+    result << OP_0; // CHECKMULTISIG bug workaround
+    for (const CKey &key : keys)
+    {
+        vector<unsigned char> vchSig;
+        BOOST_CHECK(key.Sign(hash, vchSig));
+        vchSig.push_back((unsigned char)SIGHASH_ALL);
+        result << vchSig;
+    }
+    return result;
+}
+
+// Parameterized testing over consensus branch ids
+BOOST_DATA_TEST_CASE(multisig_verify, boost::unit_test::data::xrange(static_cast<int>(Consensus::MAX_NETWORK_UPGRADES)))
+{
+    uint32_t consensusBranchId = NetworkUpgradeInfo[sample].nBranchId;
+    unsigned int flags = SCRIPT_VERIFY_P2SH | SCRIPT_VERIFY_STRICTENC;
+
+    ScriptError err;
+    CKey key[4];
+    CAmount amount = 0;
+    for (int i = 0; i < 4; i++)
+        key[i] = CKey::TestOnlyRandomKey(true);
+
+    CScript a_and_b;
+    a_and_b << OP_2 << ToByteVector(key[0].GetPubKey()) << ToByteVector(key[1].GetPubKey()) << OP_2 << OP_CHECKMULTISIG;
+
+    CScript a_or_b;
+    a_or_b << OP_1 << ToByteVector(key[0].GetPubKey()) << ToByteVector(key[1].GetPubKey()) << OP_2 << OP_CHECKMULTISIG;
+
+    CScript escrow;
+    escrow << OP_2 << ToByteVector(key[0].GetPubKey()) << ToByteVector(key[1].GetPubKey()) << ToByteVector(key[2].GetPubKey()) << OP_3 << OP_CHECKMULTISIG;
+
+    CMutableTransaction txFrom;  // Funding transaction
+    txFrom.vout.resize(3);
+    txFrom.vout[0].scriptPubKey = a_and_b;
+    txFrom.vout[1].scriptPubKey = a_or_b;
+    txFrom.vout[2].scriptPubKey = escrow;
+    // Meaningless values, but we need them for the Rust code to parse this.
+    txFrom.vout[0].nValue = 10;
+    txFrom.vout[1].nValue = 10;
+    txFrom.vout[2].nValue = 10;
+
+    CMutableTransaction txTo[3]; // Spending transaction
+    std::vector<PrecomputedTransactionData> txdata;
+    for (int i = 0; i < 3; i++)
+    {
+        txTo[i].vin.resize(1);
+        txTo[i].vout.resize(1);
+        txTo[i].vin[0].prevout.n = i;
+        txTo[i].vin[0].prevout.hash = txFrom.GetHash();
+        txTo[i].vout[0].nValue = 1;
+        txdata.push_back(PrecomputedTransactionData(txTo[i], {txFrom.vout[i]}));
+    }
+
+    vector<CKey> keys;
+    CScript s;
+
+    // Test a AND b:
+    keys.assign(1,key[0]);
+    keys.push_back(key[1]);
+    s = sign_multisig(a_and_b, keys, txTo[0], txdata[0], 0, consensusBranchId);
+    BOOST_CHECK(VerifyScript(s, a_and_b, flags, MutableTransactionSignatureChecker(&txTo[0], txdata[0], 0, amount), consensusBranchId, &err));
+    BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_OK, ScriptErrorString(err));
+
+    for (int i = 0; i < 4; i++)
+    {
+        keys.assign(1,key[i]);
+        s = sign_multisig(a_and_b, keys, txTo[0], txdata[0], 0, consensusBranchId);
+        BOOST_CHECK_MESSAGE(!VerifyScript(s, a_and_b, flags, MutableTransactionSignatureChecker(&txTo[0], txdata[0], 0, amount), consensusBranchId, &err), strprintf("a&b 1: %d", i));
+        BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_INVALID_STACK_OPERATION, ScriptErrorString(err));
+
+        keys.assign(1,key[1]);
+        keys.push_back(key[i]);
+        s = sign_multisig(a_and_b, keys, txTo[0], txdata[0], 0, consensusBranchId);
+        BOOST_CHECK_MESSAGE(!VerifyScript(s, a_and_b, flags, MutableTransactionSignatureChecker(&txTo[0], txdata[0], 0, amount), consensusBranchId, &err), strprintf("a&b 2: %d", i));
+        BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_EVAL_FALSE, ScriptErrorString(err));
+    }
+
+    // Test a OR b:
+    for (int i = 0; i < 4; i++)
+    {
+        keys.assign(1,key[i]);
+        s = sign_multisig(a_or_b, keys, txTo[1], txdata[1], 0, consensusBranchId);
+        if (i == 0 || i == 1)
+        {
+            BOOST_CHECK_MESSAGE(VerifyScript(s, a_or_b, flags, MutableTransactionSignatureChecker(&txTo[1], txdata[1], 0, amount), consensusBranchId, &err), strprintf("a|b: %d", i));
+            BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_OK, ScriptErrorString(err));
+        }
+        else
+        {
+            BOOST_CHECK_MESSAGE(!VerifyScript(s, a_or_b, flags, MutableTransactionSignatureChecker(&txTo[1], txdata[1], 0, amount), consensusBranchId, &err), strprintf("a|b: %d", i));
+            BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_EVAL_FALSE, ScriptErrorString(err));
+        }
+    }
+    s.clear();
+    s << OP_0 << OP_1;
+    BOOST_CHECK(!VerifyScript(s, a_or_b, flags, MutableTransactionSignatureChecker(&txTo[1], txdata[1], 0, amount), consensusBranchId, &err));
+    BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_SIG_DER, ScriptErrorString(err));
+
+
+    for (int i = 0; i < 4; i++)
+        for (int j = 0; j < 4; j++)
+        {
+            keys.assign(1,key[i]);
+            keys.push_back(key[j]);
+            s = sign_multisig(escrow, keys, txTo[2], txdata[2], 0, consensusBranchId);
+            if (i < j && i < 3 && j < 3)
+            {
+                BOOST_CHECK_MESSAGE(VerifyScript(s, escrow, flags, MutableTransactionSignatureChecker(&txTo[2], txdata[2], 0, amount), consensusBranchId, &err), strprintf("escrow 1: %d %d", i, j));
+                BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_OK, ScriptErrorString(err));
+            }
+            else
+            {
+                BOOST_CHECK_MESSAGE(!VerifyScript(s, escrow, flags, MutableTransactionSignatureChecker(&txTo[2], txdata[2], 0, amount), consensusBranchId, &err), strprintf("escrow 2: %d %d", i, j));
+                BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_EVAL_FALSE, ScriptErrorString(err));
+            }
+        }
+}
+
+BOOST_AUTO_TEST_CASE(multisig_IsStandard)
+{
+    CKey key[4];
+    for (int i = 0; i < 4; i++)
+        key[i] = CKey::TestOnlyRandomKey(true);
+
+    txnouttype whichType;
+
+    CScript a_and_b;
+    a_and_b << OP_2 << ToByteVector(key[0].GetPubKey()) << ToByteVector(key[1].GetPubKey()) << OP_2 << OP_CHECKMULTISIG;
+    BOOST_CHECK(::IsStandard(a_and_b, whichType));
+
+    CScript a_or_b;
+    a_or_b  << OP_1 << ToByteVector(key[0].GetPubKey()) << ToByteVector(key[1].GetPubKey()) << OP_2 << OP_CHECKMULTISIG;
+    BOOST_CHECK(::IsStandard(a_or_b, whichType));
+
+    CScript escrow;
+    escrow << OP_2 << ToByteVector(key[0].GetPubKey()) << ToByteVector(key[1].GetPubKey()) << ToByteVector(key[2].GetPubKey()) << OP_3 << OP_CHECKMULTISIG;
+    BOOST_CHECK(::IsStandard(escrow, whichType));
+
+    CScript one_of_four;
+    one_of_four << OP_1 << ToByteVector(key[0].GetPubKey()) << ToByteVector(key[1].GetPubKey()) << ToByteVector(key[2].GetPubKey()) << ToByteVector(key[3].GetPubKey()) << OP_4 << OP_CHECKMULTISIG;
+    BOOST_CHECK(!::IsStandard(one_of_four, whichType));
+
+    CScript malformed[6];
+    malformed[0] << OP_3 << ToByteVector(key[0].GetPubKey()) << ToByteVector(key[1].GetPubKey()) << OP_2 << OP_CHECKMULTISIG;
+    malformed[1] << OP_2 << ToByteVector(key[0].GetPubKey()) << ToByteVector(key[1].GetPubKey()) << OP_3 << OP_CHECKMULTISIG;
+    malformed[2] << OP_0 << ToByteVector(key[0].GetPubKey()) << ToByteVector(key[1].GetPubKey()) << OP_2 << OP_CHECKMULTISIG;
+    malformed[3] << OP_1 << ToByteVector(key[0].GetPubKey()) << ToByteVector(key[1].GetPubKey()) << OP_0 << OP_CHECKMULTISIG;
+    malformed[4] << OP_1 << ToByteVector(key[0].GetPubKey()) << ToByteVector(key[1].GetPubKey()) << OP_CHECKMULTISIG;
+    malformed[5] << OP_1 << ToByteVector(key[0].GetPubKey()) << ToByteVector(key[1].GetPubKey());
+
+    for (int i = 0; i < 6; i++)
+        BOOST_CHECK(!::IsStandard(malformed[i], whichType));
+}
+
+// Parameterized testing over consensus branch ids
+BOOST_DATA_TEST_CASE(multisig_Sign, boost::unit_test::data::xrange(static_cast<int>(Consensus::MAX_NETWORK_UPGRADES)))
+{
+    uint32_t consensusBranchId = NetworkUpgradeInfo[sample].nBranchId;
+
+    // Test SignSignature() (and therefore the version of Solver() that signs transactions)
+    CBasicKeyStore keystore;
+    CKey key[4];
+    for (int i = 0; i < 4; i++)
+    {
+        key[i] = CKey::TestOnlyRandomKey(true);
+        keystore.AddKey(key[i]);
+    }
+
+    CScript a_and_b;
+    a_and_b << OP_2 << ToByteVector(key[0].GetPubKey()) << ToByteVector(key[1].GetPubKey()) << OP_2 << OP_CHECKMULTISIG;
+
+    CScript a_or_b;
+    a_or_b  << OP_1 << ToByteVector(key[0].GetPubKey()) << ToByteVector(key[1].GetPubKey()) << OP_2 << OP_CHECKMULTISIG;
+
+    CScript escrow;
+    escrow << OP_2 << ToByteVector(key[0].GetPubKey()) << ToByteVector(key[1].GetPubKey()) << ToByteVector(key[2].GetPubKey()) << OP_3 << OP_CHECKMULTISIG;
+
+    CMutableTransaction txFrom;  // Funding transaction
+    txFrom.vout.resize(3);
+    txFrom.vout[0].scriptPubKey = a_and_b;
+    txFrom.vout[1].scriptPubKey = a_or_b;
+    txFrom.vout[2].scriptPubKey = escrow;
+    // Meaningless values, but we need them for the Rust code to parse this.
+    txFrom.vout[0].nValue = 10;
+    txFrom.vout[1].nValue = 10;
+    txFrom.vout[2].nValue = 10;
+
+    CMutableTransaction txTo[3]; // Spending transaction
+    std::vector<PrecomputedTransactionData> txdata;
+    for (int i = 0; i < 3; i++)
+    {
+        txTo[i].vin.resize(1);
+        txTo[i].vout.resize(1);
+        txTo[i].vin[0].prevout.n = i;
+        txTo[i].vin[0].prevout.hash = txFrom.GetHash();
+        txTo[i].vout[0].nValue = 1;
+        txdata.push_back(PrecomputedTransactionData(txTo[i], {txFrom.vout[i]}));
+    }
+
+    for (int i = 0; i < 3; i++)
+    {
+        BOOST_CHECK_MESSAGE(SignSignature(keystore, txFrom, txTo[i], txdata[i], 0, SIGHASH_ALL, consensusBranchId), strprintf("SignSignature %d", i));
+    }
+}
+
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/net_tests.cpp b/depend/zcash/src/test/net_tests.cpp
new file mode 100644
index 000000000..d09dac637
--- /dev/null
+++ b/depend/zcash/src/test/net_tests.cpp
@@ -0,0 +1,145 @@
+// Copyright (c) 2012-2016 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or http://www.opensource.org/licenses/mit-license.php.
+#include "addrman.h"
+#include "test/test_bitcoin.h"
+#include <string>
+#include <boost/test/unit_test.hpp>
+#include "hash.h"
+#include "serialize.h"
+#include "streams.h"
+#include "net.h"
+#include "chainparams.h"
+
+using namespace std;
+
+class CAddrManSerializationMock : public CAddrMan
+{
+public:
+    virtual void Serialize(CBaseDataStream<CSerializeData>& s) const = 0;
+
+    //! Ensure that bucket placement is always the same for testing purposes.
+    void MakeDeterministic()
+    {
+        nKey.SetNull();
+        insecure_rand = FastRandomContext(true);
+    }
+};
+
+class CAddrManUncorrupted : public CAddrManSerializationMock
+{
+public:
+    void Serialize(CBaseDataStream<CSerializeData>& s) const
+    {
+        CAddrMan::Serialize(s);
+    }
+};
+
+class CAddrManCorrupted : public CAddrManSerializationMock
+{
+public:
+    void Serialize(CBaseDataStream<CSerializeData>& s) const
+    {
+        // Produces corrupt output that claims addrman has 20 addrs when it only has one addr.
+        unsigned char nVersion = 1;
+        s << nVersion;
+        s << ((unsigned char)32);
+        s << nKey;
+        s << 10; // nNew
+        s << 10; // nTried
+
+        int nUBuckets = ADDRMAN_NEW_BUCKET_COUNT ^ (1 << 30);
+        s << nUBuckets;
+
+        CAddress addr = CAddress(CService("252.1.1.1", 7777));
+        CAddrInfo info = CAddrInfo(addr, CNetAddr("252.2.2.2"));
+        s << info;
+    }
+};
+
+CDataStream AddrmanToStream(CAddrManSerializationMock& _addrman)
+{
+    CDataStream ssPeersIn(SER_DISK, CLIENT_VERSION);
+    ssPeersIn << FLATDATA(Params().MessageStart());
+    ssPeersIn << _addrman;
+    std::string str = ssPeersIn.str();
+    vector<unsigned char> vchData(str.begin(), str.end());
+    return CDataStream(vchData, SER_DISK, CLIENT_VERSION);
+}
+
+BOOST_FIXTURE_TEST_SUITE(net_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(caddrdb_read)
+{
+    CAddrManUncorrupted addrmanUncorrupted;
+    addrmanUncorrupted.MakeDeterministic();
+
+    CService addr1 = CService("250.7.1.1", 8333);
+    CService addr2 = CService("250.7.2.2", 9999);
+    CService addr3 = CService("250.7.3.3", 9999);
+
+    // Add three addresses to new table.
+    addrmanUncorrupted.Add(CAddress(addr1), CService("252.5.1.1", 8333));
+    addrmanUncorrupted.Add(CAddress(addr2), CService("252.5.1.1", 8333));
+    addrmanUncorrupted.Add(CAddress(addr3), CService("252.5.1.1", 8333));
+
+    // Test that the de-serialization does not throw an exception.
+    CDataStream ssPeers1 = AddrmanToStream(addrmanUncorrupted);
+    bool exceptionThrown = false;
+    CAddrMan addrman1;
+
+    BOOST_CHECK(addrman1.size() == 0);
+    try {
+        unsigned char pchMsgTmp[4];
+        ssPeers1 >> FLATDATA(pchMsgTmp);
+        ssPeers1 >> addrman1;
+    } catch (const std::exception& e) {
+        exceptionThrown = true;
+    }
+
+    BOOST_CHECK(addrman1.size() == 3);
+    BOOST_CHECK(exceptionThrown == false);
+
+    // Test that CAddrDB::Read creates an addrman with the correct number of addrs.
+    CDataStream ssPeers2 = AddrmanToStream(addrmanUncorrupted);
+
+    CAddrMan addrman2;
+    CAddrDB adb;
+    BOOST_CHECK(addrman2.size() == 0);
+    adb.Read(addrman2, ssPeers2);
+    BOOST_CHECK(addrman2.size() == 3);
+}
+
+
+BOOST_AUTO_TEST_CASE(caddrdb_read_corrupted)
+{
+    CAddrManCorrupted addrmanCorrupted;
+    addrmanCorrupted.MakeDeterministic();
+
+    // Test that the de-serialization of corrupted addrman throws an exception.
+    CDataStream ssPeers1 = AddrmanToStream(addrmanCorrupted);
+    bool exceptionThrown = false;
+    CAddrMan addrman1;
+    BOOST_CHECK(addrman1.size() == 0);
+    try {
+        unsigned char pchMsgTmp[4];
+        ssPeers1 >> FLATDATA(pchMsgTmp);
+        ssPeers1 >> addrman1;
+    } catch (const std::exception& e) {
+        exceptionThrown = true;
+    }
+    // Even through de-serialization failed addrman is not left in a clean state.
+    BOOST_CHECK(addrman1.size() == 1);
+    BOOST_CHECK(exceptionThrown);
+
+    // Test that CAddrDB::Read leaves addrman in a clean state if de-serialization fails.
+    CDataStream ssPeers2 = AddrmanToStream(addrmanCorrupted);
+
+    CAddrMan addrman2;
+    CAddrDB adb;
+    BOOST_CHECK(addrman2.size() == 0);
+    adb.Read(addrman2, ssPeers2);
+    BOOST_CHECK(addrman2.size() == 0);
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/netbase_tests.cpp b/depend/zcash/src/test/netbase_tests.cpp
new file mode 100644
index 000000000..e10f95382
--- /dev/null
+++ b/depend/zcash/src/test/netbase_tests.cpp
@@ -0,0 +1,254 @@
+// Copyright (c) 2012-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "netbase.h"
+#include "test/test_bitcoin.h"
+
+#include <string>
+
+#include <boost/assign/list_of.hpp>
+#include <boost/test/unit_test.hpp>
+
+using namespace std;
+
+BOOST_FIXTURE_TEST_SUITE(netbase_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(netbase_networks)
+{
+    BOOST_CHECK(CNetAddr("127.0.0.1").GetNetwork()                              == NET_UNROUTABLE);
+    BOOST_CHECK(CNetAddr("::1").GetNetwork()                                    == NET_UNROUTABLE);
+    BOOST_CHECK(CNetAddr("8.8.8.8").GetNetwork()                                == NET_IPV4);
+    BOOST_CHECK(CNetAddr("2001::8888").GetNetwork()                             == NET_IPV6);
+    BOOST_CHECK(CNetAddr("FD87:D87E:EB43:edb1:8e4:3588:e546:35ca").GetNetwork() == NET_TOR);
+}
+
+BOOST_AUTO_TEST_CASE(netbase_properties)
+{
+    BOOST_CHECK(CNetAddr("127.0.0.1").IsIPv4());
+    BOOST_CHECK(CNetAddr("::FFFF:192.168.1.1").IsIPv4());
+    BOOST_CHECK(CNetAddr("::1").IsIPv6());
+    BOOST_CHECK(CNetAddr("10.0.0.1").IsRFC1918());
+    BOOST_CHECK(CNetAddr("192.168.1.1").IsRFC1918());
+    BOOST_CHECK(CNetAddr("172.31.255.255").IsRFC1918());
+    BOOST_CHECK(CNetAddr("2001:0DB8::").IsRFC3849());
+    BOOST_CHECK(CNetAddr("169.254.1.1").IsRFC3927());
+    BOOST_CHECK(CNetAddr("2002::1").IsRFC3964());
+    BOOST_CHECK(CNetAddr("FC00::").IsRFC4193());
+    BOOST_CHECK(CNetAddr("2001::2").IsRFC4380());
+    BOOST_CHECK(CNetAddr("2001:10::").IsRFC4843());
+    BOOST_CHECK(CNetAddr("FE80::").IsRFC4862());
+    BOOST_CHECK(CNetAddr("64:FF9B::").IsRFC6052());
+    BOOST_CHECK(CNetAddr("FD87:D87E:EB43:edb1:8e4:3588:e546:35ca").IsTor());
+    BOOST_CHECK(CNetAddr("127.0.0.1").IsLocal());
+    BOOST_CHECK(CNetAddr("::1").IsLocal());
+    BOOST_CHECK(CNetAddr("8.8.8.8").IsRoutable());
+    BOOST_CHECK(CNetAddr("2001::1").IsRoutable());
+    BOOST_CHECK(CNetAddr("127.0.0.1").IsValid());
+}
+
+bool static TestSplitHost(string test, string host, int port)
+{
+    string hostOut;
+    int portOut = -1;
+    SplitHostPort(test, portOut, hostOut);
+    return hostOut == host && port == portOut;
+}
+
+BOOST_AUTO_TEST_CASE(netbase_splithost)
+{
+    BOOST_CHECK(TestSplitHost("www.bitcoin.org", "www.bitcoin.org", -1));
+    BOOST_CHECK(TestSplitHost("[www.bitcoin.org]", "www.bitcoin.org", -1));
+    BOOST_CHECK(TestSplitHost("www.bitcoin.org:80", "www.bitcoin.org", 80));
+    BOOST_CHECK(TestSplitHost("[www.bitcoin.org]:80", "www.bitcoin.org", 80));
+    BOOST_CHECK(TestSplitHost("127.0.0.1", "127.0.0.1", -1));
+    BOOST_CHECK(TestSplitHost("127.0.0.1:8333", "127.0.0.1", 8333));
+    BOOST_CHECK(TestSplitHost("[127.0.0.1]", "127.0.0.1", -1));
+    BOOST_CHECK(TestSplitHost("[127.0.0.1]:8333", "127.0.0.1", 8333));
+    BOOST_CHECK(TestSplitHost("::ffff:127.0.0.1", "::ffff:127.0.0.1", -1));
+    BOOST_CHECK(TestSplitHost("[::ffff:127.0.0.1]:8333", "::ffff:127.0.0.1", 8333));
+    BOOST_CHECK(TestSplitHost("[::]:8333", "::", 8333));
+    BOOST_CHECK(TestSplitHost("::8333", "::8333", -1));
+    BOOST_CHECK(TestSplitHost(":8333", "", 8333));
+    BOOST_CHECK(TestSplitHost("[]:8333", "", 8333));
+    BOOST_CHECK(TestSplitHost("", "", -1));
+}
+
+bool static TestParse(string src, string canon)
+{
+    CService addr;
+    if (!LookupNumeric(src.c_str(), addr, 65535))
+        return canon == "";
+    return canon == addr.ToString();
+}
+
+BOOST_AUTO_TEST_CASE(netbase_lookupnumeric)
+{
+    BOOST_CHECK(TestParse("127.0.0.1", "127.0.0.1:65535"));
+    BOOST_CHECK(TestParse("127.0.0.1:8333", "127.0.0.1:8333"));
+    BOOST_CHECK(TestParse("::ffff:127.0.0.1", "127.0.0.1:65535"));
+    BOOST_CHECK(TestParse("::", "[::]:65535"));
+    BOOST_CHECK(TestParse("[::]:8333", "[::]:8333"));
+    BOOST_CHECK(TestParse("[127.0.0.1]", "127.0.0.1:65535"));
+    BOOST_CHECK(TestParse(":::", ""));
+}
+
+BOOST_AUTO_TEST_CASE(onioncat_test)
+{
+    // values from https://web.archive.org/web/20121122003543/http://www.cypherpunk.at/onioncat/wiki/OnionCat
+    CNetAddr addr1("5wyqrzbvrdsumnok.onion");
+    CNetAddr addr2("FD87:D87E:EB43:edb1:8e4:3588:e546:35ca");
+    BOOST_CHECK(addr1 == addr2);
+    BOOST_CHECK(addr1.IsTor());
+    BOOST_CHECK(addr1.ToStringIP() == "5wyqrzbvrdsumnok.onion");
+    BOOST_CHECK(addr1.IsRoutable());
+}
+
+BOOST_AUTO_TEST_CASE(subnet_test)
+{
+    BOOST_CHECK(CSubNet("1.2.3.0/24") == CSubNet("1.2.3.0/255.255.255.0"));
+    BOOST_CHECK(CSubNet("1.2.3.0/24") != CSubNet("1.2.4.0/255.255.255.0"));
+    BOOST_CHECK(CSubNet("1.2.3.0/24").Match(CNetAddr("1.2.3.4")));
+    BOOST_CHECK(!CSubNet("1.2.2.0/24").Match(CNetAddr("1.2.3.4")));
+    BOOST_CHECK(CSubNet("1.2.3.4").Match(CNetAddr("1.2.3.4")));
+    BOOST_CHECK(CSubNet("1.2.3.4/32").Match(CNetAddr("1.2.3.4")));
+    BOOST_CHECK(!CSubNet("1.2.3.4").Match(CNetAddr("5.6.7.8")));
+    BOOST_CHECK(!CSubNet("1.2.3.4/32").Match(CNetAddr("5.6.7.8")));
+    BOOST_CHECK(CSubNet("::ffff:127.0.0.1").Match(CNetAddr("127.0.0.1")));
+    BOOST_CHECK(CSubNet("1:2:3:4:5:6:7:8").Match(CNetAddr("1:2:3:4:5:6:7:8")));
+    BOOST_CHECK(!CSubNet("1:2:3:4:5:6:7:8").Match(CNetAddr("1:2:3:4:5:6:7:9")));
+    BOOST_CHECK(CSubNet("1:2:3:4:5:6:7:0/112").Match(CNetAddr("1:2:3:4:5:6:7:1234")));
+    BOOST_CHECK(CSubNet("192.168.0.1/24").Match(CNetAddr("192.168.0.2")));
+    BOOST_CHECK(CSubNet("192.168.0.20/29").Match(CNetAddr("192.168.0.18")));
+    BOOST_CHECK(CSubNet("1.2.2.1/24").Match(CNetAddr("1.2.2.4")));
+    BOOST_CHECK(CSubNet("1.2.2.110/31").Match(CNetAddr("1.2.2.111")));
+    BOOST_CHECK(CSubNet("1.2.2.20/26").Match(CNetAddr("1.2.2.63")));
+    // All-Matching IPv6 Matches arbitrary IPv4 and IPv6
+    BOOST_CHECK(CSubNet("::/0").Match(CNetAddr("1:2:3:4:5:6:7:1234")));
+    BOOST_CHECK(CSubNet("::/0").Match(CNetAddr("1.2.3.4")));
+    // All-Matching IPv4 does not Match IPv6
+    BOOST_CHECK(!CSubNet("0.0.0.0/0").Match(CNetAddr("1:2:3:4:5:6:7:1234")));
+    // Invalid subnets Match nothing (not even invalid addresses)
+    BOOST_CHECK(!CSubNet().Match(CNetAddr("1.2.3.4")));
+    BOOST_CHECK(!CSubNet("").Match(CNetAddr("4.5.6.7")));
+    BOOST_CHECK(!CSubNet("bloop").Match(CNetAddr("0.0.0.0")));
+    BOOST_CHECK(!CSubNet("bloop").Match(CNetAddr("hab")));
+    // Check valid/invalid
+    BOOST_CHECK(CSubNet("1.2.3.0/0").IsValid());
+    BOOST_CHECK(!CSubNet("1.2.3.0/-1").IsValid());
+    BOOST_CHECK(CSubNet("1.2.3.0/32").IsValid());
+    BOOST_CHECK(!CSubNet("1.2.3.0/33").IsValid());
+    BOOST_CHECK(CSubNet("1:2:3:4:5:6:7:8/0").IsValid());
+    BOOST_CHECK(CSubNet("1:2:3:4:5:6:7:8/33").IsValid());
+    BOOST_CHECK(!CSubNet("1:2:3:4:5:6:7:8/-1").IsValid());
+    BOOST_CHECK(CSubNet("1:2:3:4:5:6:7:8/128").IsValid());
+    BOOST_CHECK(!CSubNet("1:2:3:4:5:6:7:8/129").IsValid());
+    BOOST_CHECK(!CSubNet("fuzzy").IsValid());
+
+    //CNetAddr constructor test
+    BOOST_CHECK(CSubNet(CNetAddr("127.0.0.1")).IsValid());
+    BOOST_CHECK(CSubNet(CNetAddr("127.0.0.1")).Match(CNetAddr("127.0.0.1")));
+    BOOST_CHECK(!CSubNet(CNetAddr("127.0.0.1")).Match(CNetAddr("127.0.0.2")));
+    BOOST_CHECK(CSubNet(CNetAddr("127.0.0.1")).ToString() == "127.0.0.1/32");
+
+    BOOST_CHECK(CSubNet(CNetAddr("1:2:3:4:5:6:7:8")).IsValid());
+    BOOST_CHECK(CSubNet(CNetAddr("1:2:3:4:5:6:7:8")).Match(CNetAddr("1:2:3:4:5:6:7:8")));
+    BOOST_CHECK(!CSubNet(CNetAddr("1:2:3:4:5:6:7:8")).Match(CNetAddr("1:2:3:4:5:6:7:9")));
+    BOOST_CHECK(CSubNet(CNetAddr("1:2:3:4:5:6:7:8")).ToString() == "1:2:3:4:5:6:7:8/128");
+
+    CSubNet subnet = CSubNet("1.2.3.4/255.255.255.255");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.2.3.4/32");
+    subnet = CSubNet("1.2.3.4/255.255.255.254");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.2.3.4/31");
+    subnet = CSubNet("1.2.3.4/255.255.255.252");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.2.3.4/30");
+    subnet = CSubNet("1.2.3.4/255.255.255.248");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.2.3.0/29");
+    subnet = CSubNet("1.2.3.4/255.255.255.240");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.2.3.0/28");
+    subnet = CSubNet("1.2.3.4/255.255.255.224");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.2.3.0/27");
+    subnet = CSubNet("1.2.3.4/255.255.255.192");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.2.3.0/26");
+    subnet = CSubNet("1.2.3.4/255.255.255.128");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.2.3.0/25");
+    subnet = CSubNet("1.2.3.4/255.255.255.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.2.3.0/24");
+    subnet = CSubNet("1.2.3.4/255.255.254.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.2.2.0/23");
+    subnet = CSubNet("1.2.3.4/255.255.252.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.2.0.0/22");
+    subnet = CSubNet("1.2.3.4/255.255.248.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.2.0.0/21");
+    subnet = CSubNet("1.2.3.4/255.255.240.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.2.0.0/20");
+    subnet = CSubNet("1.2.3.4/255.255.224.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.2.0.0/19");
+    subnet = CSubNet("1.2.3.4/255.255.192.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.2.0.0/18");
+    subnet = CSubNet("1.2.3.4/255.255.128.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.2.0.0/17");
+    subnet = CSubNet("1.2.3.4/255.255.0.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.2.0.0/16");
+    subnet = CSubNet("1.2.3.4/255.254.0.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.2.0.0/15");
+    subnet = CSubNet("1.2.3.4/255.252.0.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.0.0.0/14");
+    subnet = CSubNet("1.2.3.4/255.248.0.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.0.0.0/13");
+    subnet = CSubNet("1.2.3.4/255.240.0.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.0.0.0/12");
+    subnet = CSubNet("1.2.3.4/255.224.0.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.0.0.0/11");
+    subnet = CSubNet("1.2.3.4/255.192.0.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.0.0.0/10");
+    subnet = CSubNet("1.2.3.4/255.128.0.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.0.0.0/9");
+    subnet = CSubNet("1.2.3.4/255.0.0.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.0.0.0/8");
+    subnet = CSubNet("1.2.3.4/254.0.0.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "0.0.0.0/7");
+    subnet = CSubNet("1.2.3.4/252.0.0.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "0.0.0.0/6");
+    subnet = CSubNet("1.2.3.4/248.0.0.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "0.0.0.0/5");
+    subnet = CSubNet("1.2.3.4/240.0.0.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "0.0.0.0/4");
+    subnet = CSubNet("1.2.3.4/224.0.0.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "0.0.0.0/3");
+    subnet = CSubNet("1.2.3.4/192.0.0.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "0.0.0.0/2");
+    subnet = CSubNet("1.2.3.4/128.0.0.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "0.0.0.0/1");
+    subnet = CSubNet("1.2.3.4/0.0.0.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "0.0.0.0/0");
+
+    subnet = CSubNet("1:2:3:4:5:6:7:8/ffff:ffff:ffff:ffff:ffff:ffff:ffff:ffff");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1:2:3:4:5:6:7:8/128");
+    subnet = CSubNet("1:2:3:4:5:6:7:8/ffff:0000:0000:0000:0000:0000:0000:0000");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1::/16");
+    subnet = CSubNet("1:2:3:4:5:6:7:8/0000:0000:0000:0000:0000:0000:0000:0000");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "::/0");
+    subnet = CSubNet("1.2.3.4/255.255.232.0");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1.2.0.0/255.255.232.0");
+    subnet = CSubNet("1:2:3:4:5:6:7:8/ffff:ffff:ffff:fffe:ffff:ffff:ffff:ff0f");
+    BOOST_CHECK_EQUAL(subnet.ToString(), "1:2:3:4:5:6:7:8/ffff:ffff:ffff:fffe:ffff:ffff:ffff:ff0f");
+}
+
+BOOST_AUTO_TEST_CASE(netbase_getgroup)
+{
+    BOOST_CHECK(CNetAddr("127.0.0.1").GetGroup() == boost::assign::list_of(0)); // Local -> !Routable()
+    BOOST_CHECK(CNetAddr("257.0.0.1").GetGroup() == boost::assign::list_of(0)); // !Valid -> !Routable()
+    BOOST_CHECK(CNetAddr("10.0.0.1").GetGroup() == boost::assign::list_of(0)); // RFC1918 -> !Routable()
+    BOOST_CHECK(CNetAddr("169.254.1.1").GetGroup() == boost::assign::list_of(0)); // RFC3927 -> !Routable()
+    BOOST_CHECK(CNetAddr("1.2.3.4").GetGroup() == boost::assign::list_of((unsigned char)NET_IPV4)(1)(2)); // IPv4
+    BOOST_CHECK(CNetAddr("::FFFF:0:102:304").GetGroup() == boost::assign::list_of((unsigned char)NET_IPV4)(1)(2)); // RFC6145
+    BOOST_CHECK(CNetAddr("64:FF9B::102:304").GetGroup() == boost::assign::list_of((unsigned char)NET_IPV4)(1)(2)); // RFC6052
+    BOOST_CHECK(CNetAddr("2002:102:304:9999:9999:9999:9999:9999").GetGroup() == boost::assign::list_of((unsigned char)NET_IPV4)(1)(2)); // RFC3964
+    BOOST_CHECK(CNetAddr("2001:0:9999:9999:9999:9999:FEFD:FCFB").GetGroup() == boost::assign::list_of((unsigned char)NET_IPV4)(1)(2)); // RFC4380
+    BOOST_CHECK(CNetAddr("FD87:D87E:EB43:edb1:8e4:3588:e546:35ca").GetGroup() == boost::assign::list_of((unsigned char)NET_TOR)(239)); // Tor
+    BOOST_CHECK(CNetAddr("2001:470:abcd:9999:9999:9999:9999:9999").GetGroup() == boost::assign::list_of((unsigned char)NET_IPV6)(32)(1)(4)(112)(175)); //he.net
+    BOOST_CHECK(CNetAddr("2001:2001:9999:9999:9999:9999:9999:9999").GetGroup() == boost::assign::list_of((unsigned char)NET_IPV6)(32)(1)(32)(1)); //IPv6
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/pmt_tests.cpp b/depend/zcash/src/test/pmt_tests.cpp
new file mode 100644
index 000000000..8b921b729
--- /dev/null
+++ b/depend/zcash/src/test/pmt_tests.cpp
@@ -0,0 +1,126 @@
+// Copyright (c) 2012-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "merkleblock.h"
+#include "serialize.h"
+#include "streams.h"
+#include "uint256.h"
+#include "arith_uint256.h"
+#include "version.h"
+#include "test_random.h"
+#include "test/test_bitcoin.h"
+
+#include <vector>
+
+#include <boost/assign/list_of.hpp>
+#include <boost/test/unit_test.hpp>
+
+using namespace std;
+
+class CPartialMerkleTreeTester : public CPartialMerkleTree
+{
+public:
+    // flip one bit in one of the hashes - this should break the authentication
+    void Damage() {
+        unsigned int n = insecure_rand() % vHash.size();
+        int bit = insecure_rand() % 256;
+        *(vHash[n].begin() + (bit>>3)) ^= 1<<(bit&7);
+    }
+};
+
+BOOST_FIXTURE_TEST_SUITE(pmt_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(pmt_test1)
+{
+    seed_insecure_rand(false);
+    static const unsigned int nTxCounts[] = {1, 4, 7, 17, 56, 100, 127, 256, 312, 513, 1000, 4095};
+
+    for (int n = 0; n < 12; n++) {
+        unsigned int nTx = nTxCounts[n];
+
+        // build a block with some dummy transactions
+        CBlock block;
+        for (unsigned int j=0; j<nTx; j++) {
+            CMutableTransaction tx;
+            tx.nLockTime = j; // actual transaction data doesn't matter; just make the nLockTime's unique
+            block.vtx.push_back(CTransaction(tx));
+        }
+
+        // calculate actual merkle root and height
+        uint256 merkleRoot1 = block.BuildMerkleTree();
+        std::vector<uint256> vTxid(nTx, uint256());
+        for (unsigned int j=0; j<nTx; j++)
+            vTxid[j] = block.vtx[j].GetHash();
+        int nHeight = 1, nTx_ = nTx;
+        while (nTx_ > 1) {
+            nTx_ = (nTx_+1)/2;
+            nHeight++;
+        }
+
+        // check with random subsets with inclusion chances 1, 1/2, 1/4, ..., 1/128
+        for (int att = 1; att < 15; att++) {
+            // build random subset of txid's
+            std::vector<bool> vMatch(nTx, false);
+            std::vector<uint256> vMatchTxid1;
+            for (unsigned int j=0; j<nTx; j++) {
+                bool fInclude = (insecure_rand() & ((1 << (att/2)) - 1)) == 0;
+                vMatch[j] = fInclude;
+                if (fInclude)
+                    vMatchTxid1.push_back(vTxid[j]);
+            }
+
+            // build the partial merkle tree
+            CPartialMerkleTree pmt1(vTxid, vMatch);
+
+            // serialize
+            CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+            ss << pmt1;
+
+            // verify CPartialMerkleTree's size guarantees
+            unsigned int n = std::min<unsigned int>(nTx, 1 + vMatchTxid1.size()*nHeight);
+            BOOST_CHECK(ss.size() <= 10 + (258*n+7)/8);
+
+            // deserialize into a tester copy
+            CPartialMerkleTreeTester pmt2;
+            ss >> pmt2;
+
+            // extract merkle root and matched txids from copy
+            std::vector<uint256> vMatchTxid2;
+            uint256 merkleRoot2 = pmt2.ExtractMatches(vMatchTxid2);
+
+            // check that it has the same merkle root as the original, and a valid one
+            BOOST_CHECK(merkleRoot1 == merkleRoot2);
+            BOOST_CHECK(!merkleRoot2.IsNull());
+
+            // check that it contains the matched transactions (in the same order!)
+            BOOST_CHECK(vMatchTxid1 == vMatchTxid2);
+
+            // check that random bit flips break the authentication
+            for (int j=0; j<4; j++) {
+                CPartialMerkleTreeTester pmt3(pmt2);
+                pmt3.Damage();
+                std::vector<uint256> vMatchTxid3;
+                uint256 merkleRoot3 = pmt3.ExtractMatches(vMatchTxid3);
+                BOOST_CHECK(merkleRoot3 != merkleRoot1);
+            }
+        }
+    }
+}
+
+BOOST_AUTO_TEST_CASE(pmt_malleability)
+{
+    std::vector<uint256> vTxid = boost::assign::list_of
+        (ArithToUint256(1))(ArithToUint256(2))
+        (ArithToUint256(3))(ArithToUint256(4))
+        (ArithToUint256(5))(ArithToUint256(6))
+        (ArithToUint256(7))(ArithToUint256(8))
+        (ArithToUint256(9))(ArithToUint256(10))
+        (ArithToUint256(9))(ArithToUint256(10));
+    std::vector<bool> vMatch = boost::assign::list_of(false)(false)(false)(false)(false)(false)(false)(false)(false)(true)(true)(false);
+
+    CPartialMerkleTree tree(vTxid, vMatch);
+    BOOST_CHECK(tree.ExtractMatches(vTxid).IsNull());
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/policyestimator_tests.cpp b/depend/zcash/src/test/policyestimator_tests.cpp
new file mode 100644
index 000000000..a375dd8d4
--- /dev/null
+++ b/depend/zcash/src/test/policyestimator_tests.cpp
@@ -0,0 +1,208 @@
+// Copyright (c) 2011-2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "policy/fees.h"
+#include "txmempool.h"
+#include "uint256.h"
+#include "util.h"
+
+#include "test/test_bitcoin.h"
+
+#include <boost/test/unit_test.hpp>
+
+BOOST_FIXTURE_TEST_SUITE(policyestimator_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(BlockPolicyEstimates)
+{
+    CTxMemPool mpool(CFeeRate(1000));
+    TestMemPoolEntryHelper entry;
+    CAmount basefee(2000);
+    double basepri = 1e6;
+    CAmount deltaFee(100);
+    double deltaPri=5e5;
+    std::vector<CAmount> feeV[2];
+    std::vector<double> priV[2];
+
+    // Populate vectors of increasing fees or priorities
+    for (int j = 0; j < 10; j++) {
+        //V[0] is for fee transactions
+        feeV[0].push_back(basefee * (j+1));
+        priV[0].push_back(0);
+        //V[1] is for priority transactions
+        feeV[1].push_back(CAmount(0));
+        priV[1].push_back(basepri * pow(10, j+1));
+    }
+
+    // Store the hashes of transactions that have been
+    // added to the mempool by their associate fee/pri
+    // txHashes[j] is populated with transactions either of
+    // fee = basefee * (j+1)  OR  pri = 10^6 * 10^(j+1)
+    std::vector<uint256> txHashes[10];
+
+    // Create a transaction template
+    CScript garbage;
+    for (unsigned int i = 0; i < 128; i++)
+        garbage.push_back('X');
+    CMutableTransaction tx;
+    std::list<CTransaction> dummyConflicted;
+    tx.vin.resize(1);
+    tx.vin[0].scriptSig = garbage;
+    tx.vout.resize(1);
+    tx.vout[0].nValue=0LL;
+    CFeeRate baseRate(basefee, ::GetSerializeSize(tx, SER_NETWORK, PROTOCOL_VERSION));
+
+    // Create a fake block
+    std::vector<CTransaction> block;
+    int blocknum = 0;
+
+    // Loop through 200 blocks
+    // At a decay .998 and 4 fee transactions per block
+    // This makes the tx count about 1.33 per bucket, above the 1 threshold
+    while (blocknum < 200) {
+        for (int j = 0; j < 10; j++) { // For each fee/pri multiple
+            for (int k = 0; k < 5; k++) { // add 4 fee txs for every priority tx
+                tx.vin[0].prevout.n = 10000*blocknum+100*j+k; // make transaction unique
+                uint256 hash = tx.GetHash();
+                mpool.addUnchecked(hash, entry.Fee(feeV[k/4][j]).Time(GetTime()).Priority(priV[k/4][j]).Height(blocknum).FromTx(tx, &mpool));
+                txHashes[j].push_back(hash);
+            }
+        }
+        //Create blocks where higher fee/pri txs are included more often
+        for (int h = 0; h <= blocknum%10; h++) {
+            // 10/10 blocks add highest fee/pri transactions
+            // 9/10 blocks add 2nd highest and so on until ...
+            // 1/10 blocks add lowest fee/pri transactions
+            while (txHashes[9-h].size()) {
+                std::shared_ptr<const CTransaction> ptx = mpool.get(txHashes[9-h].back());
+                if (ptx)
+                    block.push_back(*ptx);
+                txHashes[9-h].pop_back();
+            }
+        }
+        mpool.removeForBlock(block, ++blocknum, dummyConflicted);
+        block.clear();
+        if (blocknum == 30) {
+            // At this point we should need to combine 5 buckets to get enough data points
+            // So estimateFee(1) should fail and estimateFee(2) should return somewhere around
+            // 8*baserate
+            BOOST_CHECK(mpool.estimateFee(1) == CFeeRate(0));
+            BOOST_CHECK(mpool.estimateFee(2).GetFeePerK() < 8*baseRate.GetFeePerK() + deltaFee);
+            BOOST_CHECK(mpool.estimateFee(2).GetFeePerK() > 8*baseRate.GetFeePerK() - deltaFee);
+        }
+    }
+
+    std::vector<CAmount> origFeeEst;
+    std::vector<double> origPriEst;
+    // Highest feerate is 10*baseRate and gets in all blocks,
+    // second highest feerate is 9*baseRate and gets in 9/10 blocks = 90%,
+    // third highest feerate is 8*base rate, and gets in 8/10 blocks = 80%,
+    // so estimateFee(1) should return 9*baseRate.
+    // Third highest feerate has 90% chance of being included by 2 blocks,
+    // so estimateFee(2) should return 8*baseRate etc...
+    for (int i = 1; i < 10;i++) {
+        origFeeEst.push_back(mpool.estimateFee(i).GetFeePerK());
+        origPriEst.push_back(mpool.estimatePriority(i));
+        if (i > 1) { // Fee estimates should be monotonically decreasing
+            BOOST_CHECK(origFeeEst[i-1] <= origFeeEst[i-2]);
+            BOOST_CHECK(origPriEst[i-1] <= origPriEst[i-2]);
+        }
+        BOOST_CHECK(origFeeEst[i-1] < (10-i)*baseRate.GetFeePerK() + deltaFee);
+        BOOST_CHECK(origFeeEst[i-1] > (10-i)*baseRate.GetFeePerK() - deltaFee);
+        BOOST_CHECK(origPriEst[i-1] < pow(10,10-i) * basepri + deltaPri);
+        BOOST_CHECK(origPriEst[i-1] > pow(10,10-i) * basepri - deltaPri);
+    }
+
+    // Mine 50 more blocks with no transactions happening, estimates shouldn't change
+    // We haven't decayed the moving average enough so we still have enough data points in every bucket
+    while (blocknum < 250)
+        mpool.removeForBlock(block, ++blocknum, dummyConflicted);
+
+    for (int i = 1; i < 10;i++) {
+        BOOST_CHECK(mpool.estimateFee(i).GetFeePerK() < origFeeEst[i-1] + deltaFee);
+        BOOST_CHECK(mpool.estimateFee(i).GetFeePerK() > origFeeEst[i-1] - deltaFee);
+        BOOST_CHECK(mpool.estimatePriority(i) < origPriEst[i-1] + deltaPri);
+        BOOST_CHECK(mpool.estimatePriority(i) > origPriEst[i-1] - deltaPri);
+    }
+
+
+    // Mine 15 more blocks with lots of transactions happening and not getting mined
+    // Estimates should go up
+    while (blocknum < 265) {
+        for (int j = 0; j < 10; j++) { // For each fee/pri multiple
+            for (int k = 0; k < 5; k++) { // add 4 fee txs for every priority tx
+                tx.vin[0].prevout.n = 10000*blocknum+100*j+k;
+                uint256 hash = tx.GetHash();
+                mpool.addUnchecked(hash, entry.Fee(feeV[k/4][j]).Time(GetTime()).Priority(priV[k/4][j]).Height(blocknum).FromTx(tx, &mpool));
+                txHashes[j].push_back(hash);
+            }
+        }
+        mpool.removeForBlock(block, ++blocknum, dummyConflicted);
+    }
+
+    for (int i = 1; i < 10;i++) {
+        BOOST_CHECK(mpool.estimateFee(i).GetFeePerK() > origFeeEst[i-1] - deltaFee);
+        BOOST_CHECK(mpool.estimatePriority(i) > origPriEst[i-1] - deltaPri);
+    }
+
+    // Mine all those transactions
+    // Estimates should still not be below original
+    for (int j = 0; j < 10; j++) {
+        while(txHashes[j].size()) {
+            std::shared_ptr<const CTransaction> ptx = mpool.get(txHashes[j].back());
+            if (ptx)
+                block.push_back(*ptx);
+            txHashes[j].pop_back();
+        }
+    }
+    mpool.removeForBlock(block, 265, dummyConflicted);
+    block.clear();
+    for (int i = 1; i < 10;i++) {
+        BOOST_CHECK(mpool.estimateFee(i).GetFeePerK() > origFeeEst[i-1] - deltaFee);
+        BOOST_CHECK(mpool.estimatePriority(i) > origPriEst[i-1] - deltaPri);
+    }
+
+    // Mine 100 more blocks where everything is mined every block
+    // Estimates should be below original estimates (not possible for last estimate)
+    while (blocknum < 365) {
+        for (int j = 0; j < 10; j++) { // For each fee/pri multiple
+            for (int k = 0; k < 5; k++) { // add 4 fee txs for every priority tx
+                tx.vin[0].prevout.n = 10000*blocknum+100*j+k;
+                uint256 hash = tx.GetHash();
+                mpool.addUnchecked(hash, entry.Fee(feeV[k/4][j]).Time(GetTime()).Priority(priV[k/4][j]).Height(blocknum).FromTx(tx, &mpool));
+                std::shared_ptr<const CTransaction> ptx = mpool.get(hash);
+                if (ptx)
+                    block.push_back(*ptx);
+            }
+        }
+        mpool.removeForBlock(block, ++blocknum, dummyConflicted);
+        block.clear();
+    }
+    for (int i = 1; i < 9; i++) {
+        BOOST_CHECK(mpool.estimateFee(i).GetFeePerK() < origFeeEst[i-1] - deltaFee);
+        BOOST_CHECK(mpool.estimatePriority(i) < origPriEst[i-1] - deltaPri);
+    }
+}
+
+
+BOOST_AUTO_TEST_CASE(TxConfirmStats_FindBucketIndex)
+{
+    std::vector<double> buckets {0.0, 3.5, 42.0};
+    TxConfirmStats txcs;
+
+    txcs.Initialize(buckets, MAX_BLOCK_CONFIRMS, DEFAULT_DECAY, "Test");
+
+    BOOST_CHECK_EQUAL(txcs.FindBucketIndex(-1.0), 0);
+    BOOST_CHECK_EQUAL(txcs.FindBucketIndex(0.0), 0);
+    BOOST_CHECK_EQUAL(txcs.FindBucketIndex(1.0), 1);
+    BOOST_CHECK_EQUAL(txcs.FindBucketIndex(3.5), 1);
+    BOOST_CHECK_EQUAL(txcs.FindBucketIndex(4.0), 2);
+    BOOST_CHECK_EQUAL(txcs.FindBucketIndex(43.0), 3);
+    BOOST_CHECK_EQUAL(txcs.FindBucketIndex(INF_FEERATE), 3);
+    BOOST_CHECK_EQUAL(txcs.FindBucketIndex(2.0*INF_FEERATE), 3);
+    BOOST_CHECK_EQUAL(txcs.FindBucketIndex(std::numeric_limits<double>::infinity()), 3);
+    BOOST_CHECK_EQUAL(txcs.FindBucketIndex(2.0*std::numeric_limits<double>::infinity()), 3);
+    BOOST_CHECK_EQUAL(txcs.FindBucketIndex(nan("")), 0);
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/pow_tests.cpp b/depend/zcash/src/test/pow_tests.cpp
new file mode 100644
index 000000000..33adb9426
--- /dev/null
+++ b/depend/zcash/src/test/pow_tests.cpp
@@ -0,0 +1,167 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "main.h"
+#include "pow.h"
+#include "util.h"
+#include "utiltest.h"
+#include "test/test_bitcoin.h"
+
+#include <boost/test/unit_test.hpp>
+
+using namespace std;
+
+BOOST_FIXTURE_TEST_SUITE(pow_tests, BasicTestingSetup)
+
+/* Test calculation of next difficulty target with no constraints applying */
+BOOST_AUTO_TEST_CASE(get_next_work)
+{
+    SelectParams(CBaseChainParams::MAIN);
+    const Consensus::Params& params = Params().GetConsensus();
+    BOOST_CHECK_EQUAL(150, params.PoWTargetSpacing(0));
+
+    int64_t nLastRetargetTime = 1000000000; // NOTE: Not an actual block time
+    int64_t nThisTime = 1000003570;
+    arith_uint256 bnAvg;
+    bnAvg.SetCompact(0x1d00ffff);
+    BOOST_CHECK_EQUAL(0x1d011998,
+                      CalculateNextWorkRequired(bnAvg, nThisTime, nLastRetargetTime, params, 0));
+}
+
+
+BOOST_AUTO_TEST_CASE(get_next_work_blossom)
+{
+    const Consensus::Params& params = RegtestActivateBlossom(true).GetConsensus();
+    BOOST_CHECK_EQUAL(75, params.PoWTargetSpacing(0));
+
+    int64_t nLastRetargetTime = 1000000000; // NOTE: Not an actual block time
+    int64_t nThisTime = 1000001445;
+    arith_uint256 bnAvg;
+    bnAvg.SetCompact(0x1d00ffff);
+    BOOST_CHECK_GT(0x1d011998,
+                   CalculateNextWorkRequired(bnAvg, nThisTime, nLastRetargetTime, params, 0));
+
+    RegtestDeactivateBlossom();
+}
+
+/* Test the constraint on the upper bound for next work */
+BOOST_AUTO_TEST_CASE(get_next_work_pow_limit)
+{
+    SelectParams(CBaseChainParams::MAIN);
+    const Consensus::Params& params = Params().GetConsensus();
+
+    int64_t nLastRetargetTime = 1231006505;
+    int64_t nThisTime = 1233061996;
+    arith_uint256 bnAvg;
+    bnAvg.SetCompact(0x1f07ffff);
+    BOOST_CHECK_EQUAL(0x1f07ffff,
+                      CalculateNextWorkRequired(bnAvg, nThisTime, nLastRetargetTime, params, 0));
+}
+
+BOOST_AUTO_TEST_CASE(get_next_work_pow_limit_blossom)
+{
+    const Consensus::Params& params = RegtestActivateBlossom(true).GetConsensus();
+
+    int64_t nLastRetargetTime = 1231006505;
+    int64_t nThisTime = 1233061996;
+    arith_uint256 bnAvg;
+    bnAvg.SetCompact(0x1f07ffff);
+    BOOST_CHECK_EQUAL(0x1f07ffff,
+                      CalculateNextWorkRequired(bnAvg, nThisTime, nLastRetargetTime, params, 0));
+
+    RegtestDeactivateBlossom();
+}
+
+/* Test the constraint on the lower bound for actual time taken */
+BOOST_AUTO_TEST_CASE(get_next_work_lower_limit_actual)
+{
+    SelectParams(CBaseChainParams::MAIN);
+    const Consensus::Params& params = Params().GetConsensus();
+
+    int64_t nLastRetargetTime = 1000000000; // NOTE: Not an actual block time
+    // 17*150*(1 - PoWMaxAdjustUp*PoWDampingFactor) = 918
+    // so we pick 917 to be outside of this window
+    int64_t nThisTime = 100000917;
+    arith_uint256 bnAvg;
+    bnAvg.SetCompact(0x1c05a3f4);
+    BOOST_CHECK_EQUAL(0x1c04bceb,
+                      CalculateNextWorkRequired(bnAvg, nThisTime, nLastRetargetTime, params, 0));
+}
+
+BOOST_AUTO_TEST_CASE(get_next_work_lower_limit_actual_blossom)
+{
+    const Consensus::Params& params = RegtestActivateBlossom(true).GetConsensus();
+
+    int64_t nLastRetargetTime = 1000000000; // NOTE: Not an actual block time
+    int64_t nThisTime = 1000000458;
+    arith_uint256 bnAvg;
+    bnAvg.SetCompact(0x1c05a3f4);
+    BOOST_CHECK_EQUAL(0x1c04bceb,
+                      CalculateNextWorkRequired(bnAvg, nThisTime, nLastRetargetTime, params, 0));
+
+    RegtestDeactivateBlossom();
+}
+
+/* Test the constraint on the upper bound for actual time taken */
+BOOST_AUTO_TEST_CASE(get_next_work_upper_limit_actual)
+{
+    SelectParams(CBaseChainParams::MAIN);
+    const Consensus::Params& params = Params().GetConsensus();
+
+    int64_t nLastRetargetTime = 1000000000; // NOTE: Not an actual block time
+    // 17*150*(1 + maxAdjustDown*PoWDampingFactor) = 5814
+    int64_t nThisTime = 1000005815;
+    arith_uint256 bnAvg;
+    bnAvg.SetCompact(0x1c387f6f);
+    BOOST_CHECK_EQUAL(0x1c4a93bb,
+                      CalculateNextWorkRequired(bnAvg, nThisTime, nLastRetargetTime, params, 0));
+}
+
+BOOST_AUTO_TEST_CASE(get_next_work_upper_limit_actual_blossom)
+{
+    const Consensus::Params& params = RegtestActivateBlossom(true).GetConsensus();
+
+    int64_t nLastRetargetTime = 1000000000; // NOTE: Not an actual block time
+    int64_t nThisTime = 1000002908;
+    arith_uint256 bnAvg;
+    bnAvg.SetCompact(0x1c387f6f);
+    BOOST_CHECK_EQUAL(0x1c4a93bb,
+                      CalculateNextWorkRequired(bnAvg, nThisTime, nLastRetargetTime, params, 0));
+
+    RegtestDeactivateBlossom();
+}
+
+void GetBlockProofEquivalentTimeImpl(const Consensus::Params& params) {
+    std::vector<CBlockIndex> blocks(10000);
+    for (int i = 0; i < 10000; i++) {
+        blocks[i].pprev = i ? &blocks[i - 1] : NULL;
+        blocks[i].nHeight = i;
+        blocks[i].nTime = i ? blocks[i - 1].nTime + params.PoWTargetSpacing(i) : 1269211443;
+        blocks[i].nBits = 0x207fffff; /* target 0x7fffff000... */
+        blocks[i].nChainWork = i ? blocks[i - 1].nChainWork + GetBlockProof(blocks[i - 1]) : arith_uint256(0);
+    }
+
+    for (int j = 0; j < 1000; j++) {
+        CBlockIndex *p1 = &blocks[GetRand(10000)];
+        CBlockIndex *p2 = &blocks[GetRand(10000)];
+        CBlockIndex *p3 = &blocks[GetRand(10000)];
+
+        int64_t tdiff = GetBlockProofEquivalentTime(*p1, *p2, *p3, params);
+        BOOST_CHECK_EQUAL(tdiff, p1->GetBlockTime() - p2->GetBlockTime());
+    }
+}
+
+BOOST_AUTO_TEST_CASE(GetBlockProofEquivalentTime_test)
+{
+    SelectParams(CBaseChainParams::MAIN);
+    GetBlockProofEquivalentTimeImpl(Params().GetConsensus());
+}
+
+BOOST_AUTO_TEST_CASE(GetBlockProofEquivalentTime_test_blossom)
+{
+    GetBlockProofEquivalentTimeImpl(RegtestActivateBlossom(true).GetConsensus());
+    RegtestDeactivateBlossom();
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/prevector_tests.cpp b/depend/zcash/src/test/prevector_tests.cpp
new file mode 100644
index 000000000..ff59bb08e
--- /dev/null
+++ b/depend/zcash/src/test/prevector_tests.cpp
@@ -0,0 +1,251 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include <vector>
+#include "prevector.h"
+#include "test_random.h"
+
+#include "reverse_iterator.h"
+#include "serialize.h"
+#include "streams.h"
+
+#include "test/test_bitcoin.h"
+
+#include <boost/test/unit_test.hpp>
+
+BOOST_FIXTURE_TEST_SUITE(PrevectorTests, TestingSetup)
+
+template<unsigned int N, typename T>
+class prevector_tester {
+    typedef std::vector<T> realtype;
+    realtype real_vector;
+    realtype real_vector_alt;
+
+    typedef prevector<N, T> pretype;
+    pretype pre_vector;
+    pretype pre_vector_alt;
+
+    typedef typename pretype::size_type Size;
+    bool passed = true;
+    FastRandomContext rand_cache;
+    uint256 rand_seed;
+
+    template <typename A, typename B>
+        void local_check_equal(A a, B b)
+        {
+            local_check(a == b);
+        }
+    void local_check(bool b)
+    {
+        passed &= b;
+    }
+    void test() {
+        const pretype& const_pre_vector = pre_vector;
+        local_check_equal(real_vector.size(), pre_vector.size());
+        local_check_equal(real_vector.empty(), pre_vector.empty());
+        for (Size s = 0; s < real_vector.size(); s++) {
+             local_check(real_vector[s] == pre_vector[s]);
+             local_check(&(pre_vector[s]) == &(pre_vector.begin()[s]));
+             local_check(&(pre_vector[s]) == &*(pre_vector.begin() + s));
+             local_check(&(pre_vector[s]) == &*((pre_vector.end() + s) - real_vector.size()));
+        }
+        // local_check(realtype(pre_vector) == real_vector);
+        local_check(pretype(real_vector.begin(), real_vector.end()) == pre_vector);
+        local_check(pretype(pre_vector.begin(), pre_vector.end()) == pre_vector);
+        size_t pos = 0;
+        for (const T& v : pre_vector) {
+             local_check(v == real_vector[pos++]);
+        }
+        for (const T& v : reverse_iterate(pre_vector)) {
+             local_check(v == real_vector[--pos]);
+        }
+        for (const T& v : const_pre_vector) {
+             local_check(v == real_vector[pos++]);
+        }
+        for (const T& v : reverse_iterate(const_pre_vector)) {
+             local_check(v == real_vector[--pos]);
+        }
+        CDataStream ss1(SER_DISK, 0);
+        CDataStream ss2(SER_DISK, 0);
+        ss1 << real_vector;
+        ss2 << pre_vector;
+        local_check_equal(ss1.size(), ss2.size());
+        for (Size s = 0; s < ss1.size(); s++) {
+            local_check_equal(ss1[s], ss2[s]);
+        }
+    }
+
+public:
+    void resize(Size s) {
+        real_vector.resize(s);
+        local_check_equal(real_vector.size(), s);
+        pre_vector.resize(s);
+        local_check_equal(pre_vector.size(), s);
+        test();
+    }
+
+    void reserve(Size s) {
+        real_vector.reserve(s);
+        local_check(real_vector.capacity() >= s);
+        pre_vector.reserve(s);
+        local_check(pre_vector.capacity() >= s);
+        test();
+    }
+
+    void insert(Size position, const T& value) {
+        real_vector.insert(real_vector.begin() + position, value);
+        pre_vector.insert(pre_vector.begin() + position, value);
+        test();
+    }
+
+    void insert(Size position, Size count, const T& value) {
+        real_vector.insert(real_vector.begin() + position, count, value);
+        pre_vector.insert(pre_vector.begin() + position, count, value);
+        test();
+    }
+
+    template<typename I>
+    void insert_range(Size position, I first, I last) {
+        real_vector.insert(real_vector.begin() + position, first, last);
+        pre_vector.insert(pre_vector.begin() + position, first, last);
+        test();
+    }
+
+    void erase(Size position) {
+        real_vector.erase(real_vector.begin() + position);
+        pre_vector.erase(pre_vector.begin() + position);
+        test();
+    }
+
+    void erase(Size first, Size last) {
+        real_vector.erase(real_vector.begin() + first, real_vector.begin() + last);
+        pre_vector.erase(pre_vector.begin() + first, pre_vector.begin() + last);
+        test();
+    }
+
+    void update(Size pos, const T& value) {
+        real_vector[pos] = value;
+        pre_vector[pos] = value;
+        test();
+    }
+
+    void push_back(const T& value) {
+        real_vector.push_back(value);
+        pre_vector.push_back(value);
+        test();
+    }
+
+    void pop_back() {
+        real_vector.pop_back();
+        pre_vector.pop_back();
+        test();
+    }
+
+    void clear() {
+        real_vector.clear();
+        pre_vector.clear();
+    }
+
+    void assign(Size n, const T& value) {
+        real_vector.assign(n, value);
+        pre_vector.assign(n, value);
+    }
+
+    Size size() {
+        return real_vector.size();
+    }
+
+    Size capacity() {
+        return pre_vector.capacity();
+    }
+
+    void shrink_to_fit() {
+        pre_vector.shrink_to_fit();
+        test();
+    }
+
+    void swap() {
+        real_vector.swap(real_vector_alt);
+        pre_vector.swap(pre_vector_alt);
+        test();
+    }
+
+    ~prevector_tester() {
+        BOOST_CHECK_MESSAGE(passed, "insecure_rand: " + rand_seed.ToString());
+    }
+
+    prevector_tester() {
+        seed_insecure_rand();
+        rand_seed = insecure_rand_seed;
+        rand_cache = insecure_rand_ctx;
+    }
+};
+
+BOOST_AUTO_TEST_CASE(PrevectorTestInt)
+{
+    for (int j = 0; j < 64; j++) {
+        prevector_tester<8, int> test;
+        for (int i = 0; i < 2048; i++) {
+            int r = insecure_rand();
+            if ((r % 4) == 0) {
+                test.insert(insecure_rand() % (test.size() + 1), insecure_rand());
+            }
+            if (test.size() > 0 && ((r >> 2) % 4) == 1) {
+                test.erase(insecure_rand() % test.size());
+            }
+            if (((r >> 4) % 8) == 2) {
+                int new_size = std::max<int>(0, std::min<int>(30, test.size() + (insecure_rand() % 5) - 2));
+                test.resize(new_size);
+            }
+            if (((r >> 7) % 8) == 3) {
+                test.insert(insecure_rand() % (test.size() + 1), 1 + (insecure_rand() % 2), insecure_rand());
+            }
+            if (((r >> 10) % 8) == 4) {
+                int del = std::min<int>(test.size(), 1 + (insecure_rand() % 2));
+                int beg = insecure_rand() % (test.size() + 1 - del);
+                test.erase(beg, beg + del);
+            }
+            if (((r >> 13) % 16) == 5) {
+                test.push_back(insecure_rand());
+            }
+            if (test.size() > 0 && ((r >> 17) % 16) == 6) {
+                test.pop_back();
+            }
+            if (((r >> 21) % 32) == 7) {
+                int values[4];
+                int num = 1 + (insecure_rand() % 4);
+                for (int i = 0; i < num; i++) {
+                    values[i] = insecure_rand();
+                }
+                test.insert_range(insecure_rand() % (test.size() + 1), values, values + num);
+            }
+            if (((r >> 26) % 32) == 8) {
+                int del = std::min<int>(test.size(), 1 + (insecure_rand() % 4));
+                int beg = insecure_rand() % (test.size() + 1 - del);
+                test.erase(beg, beg + del);
+            }
+            r = insecure_rand();
+            if (r % 32 == 9) {
+                test.reserve(insecure_rand() % 32);
+            }
+            if ((r >> 5) % 64 == 10) {
+                test.shrink_to_fit();
+            }
+            if (test.size() > 0) {
+                test.update(insecure_rand() % test.size(), insecure_rand());
+            }
+            if (((r >> 11) % 1024) == 11) {
+                test.clear();
+            }
+            if (((r >> 21) % 512) == 12) {
+                test.assign(insecure_rand() % 32, insecure_rand());
+            }
+            if (((r >> 15) % 64) == 3) {
+                test.swap();
+            }
+        }
+    }
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/raii_event_tests.cpp b/depend/zcash/src/test/raii_event_tests.cpp
new file mode 100644
index 000000000..fd4d92fd0
--- /dev/null
+++ b/depend/zcash/src/test/raii_event_tests.cpp
@@ -0,0 +1,94 @@
+// Copyright (c) 2016 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include <event2/event.h>
+
+#ifdef EVENT_SET_MEM_FUNCTIONS_IMPLEMENTED
+// It would probably be ideal to define dummy test(s) that report skipped, but boost::test doesn't seem to make that practical (at least not in versions available with common distros)
+
+#include <map>
+#include <stdlib.h>
+
+#include "support/events.h"
+
+#include "test/test_bitcoin.h"
+
+#include <vector>
+
+#include <boost/test/unit_test.hpp>
+
+static std::map<void*, short> tags;
+static std::map<void*, uint16_t> orders;
+static uint16_t tagSequence = 0;
+
+static void* tag_malloc(size_t sz) {
+    void* mem = malloc(sz);
+    if (!mem) return mem;
+    tags[mem]++;
+    orders[mem] = tagSequence++;
+    return mem;
+}
+
+static void tag_free(void* mem) {
+    tags[mem]--;
+    orders[mem] = tagSequence++;
+    free(mem);
+}
+
+BOOST_FIXTURE_TEST_SUITE(raii_event_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(raii_event_creation)
+{
+    event_set_mem_functions(tag_malloc, realloc, tag_free);
+    
+    void* base_ptr = NULL;
+    {
+        auto base = obtain_event_base();
+        base_ptr = (void*)base.get();
+        BOOST_CHECK(tags[base_ptr] == 1);
+    }
+    BOOST_CHECK(tags[base_ptr] == 0);
+    
+    void* event_ptr = NULL;
+    {
+        auto base = obtain_event_base();
+        auto event = obtain_event(base.get(), -1, 0, NULL, NULL);
+
+        base_ptr = (void*)base.get();
+        event_ptr = (void*)event.get();
+
+        BOOST_CHECK(tags[base_ptr] == 1);
+        BOOST_CHECK(tags[event_ptr] == 1);
+    }
+    BOOST_CHECK(tags[base_ptr] == 0);
+    BOOST_CHECK(tags[event_ptr] == 0);
+    
+    event_set_mem_functions(malloc, realloc, free);
+}
+
+BOOST_AUTO_TEST_CASE(raii_event_order)
+{
+    event_set_mem_functions(tag_malloc, realloc, tag_free);
+    
+    void* base_ptr = NULL;
+    void* event_ptr = NULL;
+    {
+        auto base = obtain_event_base();
+        auto event = obtain_event(base.get(), -1, 0, NULL, NULL);
+
+        base_ptr = (void*)base.get();
+        event_ptr = (void*)event.get();
+
+        // base should have allocated before event
+        BOOST_CHECK(orders[base_ptr] < orders[event_ptr]);
+    }
+    // base should be freed after event
+    BOOST_CHECK(orders[base_ptr] > orders[event_ptr]);
+
+    event_set_mem_functions(malloc, realloc, free);
+}
+
+BOOST_AUTO_TEST_SUITE_END()
+
+#endif  // EVENT_SET_MEM_FUNCTIONS_IMPLEMENTED
diff --git a/depend/zcash/src/test/random_tests.cpp b/depend/zcash/src/test/random_tests.cpp
new file mode 100644
index 000000000..88680cdef
--- /dev/null
+++ b/depend/zcash/src/test/random_tests.cpp
@@ -0,0 +1,48 @@
+// Copyright (c) 2017 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or http://www.opensource.org/licenses/mit-license.php.
+
+#include "random.h"
+
+#include "test/test_bitcoin.h"
+
+#include <boost/test/unit_test.hpp>
+
+BOOST_FIXTURE_TEST_SUITE(random_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(fastrandom_tests)
+{
+    // Check that deterministic FastRandomContexts are deterministic
+    FastRandomContext ctx1(true);
+    FastRandomContext ctx2(true);
+
+    BOOST_CHECK_EQUAL(ctx1.rand32(), ctx2.rand32());
+    BOOST_CHECK_EQUAL(ctx1.rand32(), ctx2.rand32());
+    BOOST_CHECK_EQUAL(ctx1.rand64(), ctx2.rand64());
+    BOOST_CHECK_EQUAL(ctx1.randbits(3), ctx2.randbits(3));
+    BOOST_CHECK_EQUAL(ctx1.randbits(7), ctx2.randbits(7));
+    BOOST_CHECK_EQUAL(ctx1.rand32(), ctx2.rand32());
+    BOOST_CHECK_EQUAL(ctx1.randbits(3), ctx2.randbits(3));
+
+    // Check that a nondeterministic ones are not
+    FastRandomContext ctx3;
+    FastRandomContext ctx4;
+    BOOST_CHECK(ctx3.rand64() != ctx4.rand64()); // extremely unlikely to be equal
+}
+
+BOOST_AUTO_TEST_CASE(fastrandom_randbits)
+{
+    FastRandomContext ctx1;
+    FastRandomContext ctx2;
+    for (int bits = 0; bits < 63; ++bits) {
+        for (int j = 0; j < 1000; ++j) {
+            uint64_t rangebits = ctx1.randbits(bits);
+            BOOST_CHECK_EQUAL(rangebits >> bits, 0);
+            uint64_t range = ((uint64_t)1) << bits | rangebits;
+            uint64_t rand = ctx2.randrange(range);
+            BOOST_CHECK(rand < range);
+        }
+    }
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/reverselock_tests.cpp b/depend/zcash/src/test/reverselock_tests.cpp
new file mode 100644
index 000000000..3aeba7af1
--- /dev/null
+++ b/depend/zcash/src/test/reverselock_tests.cpp
@@ -0,0 +1,60 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "reverselock.h"
+#include "test/test_bitcoin.h"
+
+#include <boost/test/unit_test.hpp>
+
+BOOST_FIXTURE_TEST_SUITE(reverselock_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(reverselock_basics)
+{
+    boost::mutex mutex;
+    boost::unique_lock<boost::mutex> lock(mutex);
+
+    BOOST_CHECK(lock.owns_lock());
+    {
+        reverse_lock<boost::unique_lock<boost::mutex> > rlock(lock);
+        BOOST_CHECK(!lock.owns_lock());
+    }
+    BOOST_CHECK(lock.owns_lock());
+}
+
+BOOST_AUTO_TEST_CASE(reverselock_errors)
+{
+    boost::mutex mutex;
+    boost::unique_lock<boost::mutex> lock(mutex);
+
+    // Make sure trying to reverse lock an unlocked lock fails
+    lock.unlock();
+
+    BOOST_CHECK(!lock.owns_lock());
+
+    bool failed = false;
+    try {
+        reverse_lock<boost::unique_lock<boost::mutex> > rlock(lock);
+    } catch(...) {
+        failed = true;
+    }
+
+    BOOST_CHECK(failed);
+    BOOST_CHECK(!lock.owns_lock());
+
+    // Locking the original lock after it has been taken by a reverse lock
+    // makes no sense. Ensure that the original lock no longer owns the lock
+    // after giving it to a reverse one.
+
+    lock.lock();
+    BOOST_CHECK(lock.owns_lock());
+    {
+        reverse_lock<boost::unique_lock<boost::mutex> > rlock(lock);
+        BOOST_CHECK(!lock.owns_lock());
+    }
+
+    BOOST_CHECK(failed);
+    BOOST_CHECK(lock.owns_lock());
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/rpc_tests.cpp b/depend/zcash/src/test/rpc_tests.cpp
new file mode 100644
index 000000000..363edeeb6
--- /dev/null
+++ b/depend/zcash/src/test/rpc_tests.cpp
@@ -0,0 +1,415 @@
+// Copyright (c) 2012-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "rpc/server.h"
+#include "rpc/client.h"
+
+#include "experimental_features.h"
+#include "key_io.h"
+#include "main.h"
+#include "netbase.h"
+#include "utilstrencodings.h"
+
+#include "test/test_bitcoin.h"
+#include "test/test_util.h"
+
+#include <boost/test/unit_test.hpp>
+
+#include <univalue.h>
+
+using namespace std;
+
+BOOST_FIXTURE_TEST_SUITE(rpc_tests, TestingSetup)
+
+BOOST_AUTO_TEST_CASE(rpc_rawparams)
+{
+    // Test raw transaction API argument handling
+    UniValue r;
+
+    BOOST_CHECK_THROW(CallRPC("getrawtransaction"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("getrawtransaction not_hex"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("getrawtransaction a3b807410df0b60fcb9736768df5823938b2f838694939ba45f3c0a1bff150ed not_int"), runtime_error);
+
+    BOOST_CHECK_THROW(CallRPC("createrawtransaction"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("createrawtransaction null null"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("createrawtransaction not_array"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("createrawtransaction [] []"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("createrawtransaction {} {}"), runtime_error);
+    BOOST_CHECK_NO_THROW(CallRPC("createrawtransaction [] {}"));
+    BOOST_CHECK_THROW(CallRPC("createrawtransaction [] {} extra"), runtime_error);
+    BOOST_CHECK_NO_THROW(CallRPC("createrawtransaction [] {} 0"));
+    BOOST_CHECK_THROW(CallRPC("createrawtransaction [] {} 0 0"), runtime_error); // Overwinter is not active
+
+    BOOST_CHECK_THROW(CallRPC("decoderawtransaction"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("decoderawtransaction null"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("decoderawtransaction DEADBEEF"), runtime_error);
+    string rawtx = "0100000001a15d57094aa7a21a28cb20b59aab8fc7d1149a3bdbcddba9c622e4f5f6a99ece010000006c493046022100f93bb0e7d8db7bd46e40132d1f8242026e045f03a0efe71bbb8e3f475e970d790221009337cd7f1f929f00cc6ff01f03729b069a7c21b59b1736ddfee5db5946c5da8c0121033b9b137ee87d5a812d6f506efdd37f0affa7ffc310711c06c7f3e097c9447c52ffffffff0100e1f505000000001976a9140389035a9225b3839e2bbf32d826a1e222031fd888ac00000000";
+    BOOST_CHECK_NO_THROW(r = CallRPC(string("decoderawtransaction ")+rawtx));
+    BOOST_CHECK_EQUAL(find_value(r.get_obj(), "size").get_int(), 193);
+    BOOST_CHECK_EQUAL(find_value(r.get_obj(), "version").get_int(), 1);
+    BOOST_CHECK_EQUAL(find_value(r.get_obj(), "locktime").get_int(), 0);
+    BOOST_CHECK_THROW(r = CallRPC(string("decoderawtransaction ")+rawtx+" extra"), runtime_error);
+
+    BOOST_CHECK_THROW(CallRPC("signrawtransaction"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("signrawtransaction null"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("signrawtransaction ff00"), runtime_error);
+    BOOST_CHECK_NO_THROW(CallRPC(string("signrawtransaction ")+rawtx));
+    BOOST_CHECK_NO_THROW(CallRPC(string("signrawtransaction ")+rawtx+" null null NONE|ANYONECANPAY"));
+    BOOST_CHECK_NO_THROW(CallRPC(string("signrawtransaction ")+rawtx+" [] [] NONE|ANYONECANPAY"));
+    BOOST_CHECK_THROW(CallRPC(string("signrawtransaction ")+rawtx+" null null badenum"), runtime_error);
+    BOOST_CHECK_NO_THROW(CallRPC(string("signrawtransaction ")+rawtx+" [] [] NONE|ANYONECANPAY 5ba81b19"));
+    BOOST_CHECK_THROW(CallRPC(string("signrawtransaction ")+rawtx+" [] [] ALL NONE|ANYONECANPAY 123abc"), runtime_error);
+
+    // Only check failure cases for sendrawtransaction, there's no network to send to...
+    BOOST_CHECK_THROW(CallRPC("sendrawtransaction"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("sendrawtransaction null"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("sendrawtransaction DEADBEEF"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC(string("sendrawtransaction ")+rawtx+" extra"), runtime_error);
+}
+
+BOOST_AUTO_TEST_CASE(rpc_rawsign)
+{
+    UniValue r;
+    // input is a 1-of-2 multisig (so is output):
+    string prevout =
+      "[{\"txid\":\"b4cc287e58f87cdae59417329f710f3ecd75a4ee1d2872b7248f50977c8493f3\","
+      "\"vout\":1,\"scriptPubKey\":\"a914b10c9df5f7edf436c697f02f1efdba4cf399615187\","
+      "\"redeemScript\":\"512103debedc17b3df2badbcdd86d5feb4562b86fe182e5998abd8bcd4f122c6155b1b21027e940bb73ab8732bfdf7f9216ecefca5b94d6df834e77e108f68e66f126044c052ae\"}]";
+    r = CallRPC(string("createrawtransaction ")+prevout+" "+
+      "{\"t3ahmeUm2LWXPUJPx9QMheGtqTEfdDdgr7p\":11}");
+    string notsigned = r.get_str();
+    string privkey1 = "\"KzsXybp9jX64P5ekX1KUxRQ79Jht9uzW7LorgwE65i5rWACL6LQe\"";
+    string privkey2 = "\"Kyhdf5LuKTRx4ge69ybABsiUAWjVRK4XGxAKk2FQLp2HjGMy87Z4\"";
+    r = CallRPC(string("signrawtransaction ")+notsigned+" "+prevout+" "+"[]");
+    BOOST_CHECK(find_value(r.get_obj(), "complete").get_bool() == false);
+    r = CallRPC(string("signrawtransaction ")+notsigned+" "+prevout+" "+"["+privkey1+","+privkey2+"]");
+    BOOST_CHECK(find_value(r.get_obj(), "complete").get_bool() == true);
+}
+
+BOOST_AUTO_TEST_CASE(rpc_format_monetary_values)
+{
+    BOOST_CHECK(ValueFromAmount(0LL).write() == "0.00000000");
+    BOOST_CHECK(ValueFromAmount(1LL).write() == "0.00000001");
+    BOOST_CHECK(ValueFromAmount(17622195LL).write() == "0.17622195");
+    BOOST_CHECK(ValueFromAmount(50000000LL).write() == "0.50000000");
+    BOOST_CHECK(ValueFromAmount(89898989LL).write() == "0.89898989");
+    BOOST_CHECK(ValueFromAmount(100000000LL).write() == "1.00000000");
+    BOOST_CHECK(ValueFromAmount(2099999999999990LL).write() == "20999999.99999990");
+    BOOST_CHECK(ValueFromAmount(2099999999999999LL).write() == "20999999.99999999");
+
+    BOOST_CHECK_EQUAL(ValueFromAmount(0).write(), "0.00000000");
+    BOOST_CHECK_EQUAL(ValueFromAmount((COIN/10000)*123456789).write(), "12345.67890000");
+    BOOST_CHECK_EQUAL(ValueFromAmount(-COIN).write(), "-1.00000000");
+    BOOST_CHECK_EQUAL(ValueFromAmount(-COIN/10).write(), "-0.10000000");
+
+    BOOST_CHECK_EQUAL(ValueFromAmount(COIN*100000000).write(), "100000000.00000000");
+    BOOST_CHECK_EQUAL(ValueFromAmount(COIN*10000000).write(), "10000000.00000000");
+    BOOST_CHECK_EQUAL(ValueFromAmount(COIN*1000000).write(), "1000000.00000000");
+    BOOST_CHECK_EQUAL(ValueFromAmount(COIN*100000).write(), "100000.00000000");
+    BOOST_CHECK_EQUAL(ValueFromAmount(COIN*10000).write(), "10000.00000000");
+    BOOST_CHECK_EQUAL(ValueFromAmount(COIN*1000).write(), "1000.00000000");
+    BOOST_CHECK_EQUAL(ValueFromAmount(COIN*100).write(), "100.00000000");
+    BOOST_CHECK_EQUAL(ValueFromAmount(COIN*10).write(), "10.00000000");
+    BOOST_CHECK_EQUAL(ValueFromAmount(COIN).write(), "1.00000000");
+    BOOST_CHECK_EQUAL(ValueFromAmount(COIN/10).write(), "0.10000000");
+    BOOST_CHECK_EQUAL(ValueFromAmount(COIN/100).write(), "0.01000000");
+    BOOST_CHECK_EQUAL(ValueFromAmount(COIN/1000).write(), "0.00100000");
+    BOOST_CHECK_EQUAL(ValueFromAmount(COIN/10000).write(), "0.00010000");
+    BOOST_CHECK_EQUAL(ValueFromAmount(COIN/100000).write(), "0.00001000");
+    BOOST_CHECK_EQUAL(ValueFromAmount(COIN/1000000).write(), "0.00000100");
+    BOOST_CHECK_EQUAL(ValueFromAmount(COIN/10000000).write(), "0.00000010");
+    BOOST_CHECK_EQUAL(ValueFromAmount(COIN/100000000).write(), "0.00000001");
+}
+
+static UniValue ValueFromString(const std::string &str)
+{
+    UniValue value;
+    BOOST_CHECK(value.setNumStr(str));
+    return value;
+}
+
+BOOST_AUTO_TEST_CASE(rpc_parse_monetary_values)
+{
+    BOOST_CHECK_THROW(AmountFromValue(ValueFromString("-0.00000001")), UniValue);
+    BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString("0")), 0LL);
+    BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString("0.00000000")), 0LL);
+    BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString("0.00000001")), 1LL);
+    BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString("0.17622195")), 17622195LL);
+    BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString("0.5")), 50000000LL);
+    BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString("0.50000000")), 50000000LL);
+    BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString("0.89898989")), 89898989LL);
+    BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString("1.00000000")), 100000000LL);
+    BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString("20999999.9999999")), 2099999999999990LL);
+    BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString("20999999.99999999")), 2099999999999999LL);
+
+    BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString("1e-8")), COIN/100000000);
+    BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString("0.1e-7")), COIN/100000000);
+    BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString("0.01e-6")), COIN/100000000);
+    BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString("0.0000000000000000000000000000000000000000000000000000000000000000000000000001e+68")), COIN/100000000);
+    BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString("10000000000000000000000000000000000000000000000000000000000000000e-64")), COIN);
+    BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString("0.000000000000000000000000000000000000000000000000000000000000000100000000000000000000000000000000000000000000000000000e64")), COIN);
+
+    BOOST_CHECK_THROW(AmountFromValue(ValueFromString("1e-9")), UniValue); //should fail
+    BOOST_CHECK_THROW(AmountFromValue(ValueFromString("0.000000019")), UniValue); //should fail
+    BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString("0.00000001000000")), 1LL); //should pass, cut trailing 0
+    BOOST_CHECK_THROW(AmountFromValue(ValueFromString("19e-9")), UniValue); //should fail
+    BOOST_CHECK_EQUAL(AmountFromValue(ValueFromString("0.19e-6")), 19); //should pass, leading 0 is present
+
+    BOOST_CHECK_THROW(AmountFromValue(ValueFromString("92233720368.54775808")), UniValue); //overflow error
+    BOOST_CHECK_THROW(AmountFromValue(ValueFromString("1e+11")), UniValue); //overflow error
+    BOOST_CHECK_THROW(AmountFromValue(ValueFromString("1e11")), UniValue); //overflow error signless
+    BOOST_CHECK_THROW(AmountFromValue(ValueFromString("93e+9")), UniValue); //overflow error
+}
+
+BOOST_AUTO_TEST_CASE(json_parse_errors)
+{
+    // Valid
+    BOOST_CHECK_EQUAL(ParseNonRFCJSONValue("1.0").get_real(), 1.0);
+    // Valid, with leading or trailing whitespace
+    BOOST_CHECK_EQUAL(ParseNonRFCJSONValue(" 1.0").get_real(), 1.0);
+    BOOST_CHECK_EQUAL(ParseNonRFCJSONValue("1.0 ").get_real(), 1.0);
+
+    BOOST_CHECK_THROW(AmountFromValue(ParseNonRFCJSONValue(".19e-6")), std::runtime_error); //should fail, missing leading 0, therefore invalid JSON
+    BOOST_CHECK_EQUAL(AmountFromValue(ParseNonRFCJSONValue("0.00000000000000000000000000000000000001e+30 ")), 1);
+    // Invalid, initial garbage
+    BOOST_CHECK_THROW(ParseNonRFCJSONValue("[1.0"), std::runtime_error);
+    BOOST_CHECK_THROW(ParseNonRFCJSONValue("a1.0"), std::runtime_error);
+    // Invalid, trailing garbage
+    BOOST_CHECK_THROW(ParseNonRFCJSONValue("1.0sds"), std::runtime_error);
+    BOOST_CHECK_THROW(ParseNonRFCJSONValue("1.0]"), std::runtime_error);
+    // BTC addresses should fail parsing
+    BOOST_CHECK_THROW(ParseNonRFCJSONValue("175tWpb8K1S7NmH4Zx6rewF9WQrcZv245W"), std::runtime_error);
+    BOOST_CHECK_THROW(ParseNonRFCJSONValue("3J98t1WpEZ73CNmQviecrnyiWrnqRhWNL"), std::runtime_error);
+}
+
+BOOST_AUTO_TEST_CASE(rpc_ban)
+{
+    BOOST_CHECK_NO_THROW(CallRPC(string("clearbanned")));
+    
+    UniValue r;
+    BOOST_CHECK_NO_THROW(r = CallRPC(string("setban 127.0.0.0 add")));
+    BOOST_CHECK_THROW(r = CallRPC(string("setban 127.0.0.0:8334")), runtime_error); //portnumber for setban not allowed
+    BOOST_CHECK_NO_THROW(r = CallRPC(string("listbanned")));
+    UniValue ar = r.get_array();
+    UniValue o1 = ar[0].get_obj();
+    UniValue adr = find_value(o1, "address");
+    BOOST_CHECK_EQUAL(adr.get_str(), "127.0.0.0/32");
+    BOOST_CHECK_NO_THROW(CallRPC(string("setban 127.0.0.0 remove")));;
+    BOOST_CHECK_NO_THROW(r = CallRPC(string("listbanned")));
+    ar = r.get_array();
+    BOOST_CHECK_EQUAL(ar.size(), 0);
+
+    BOOST_CHECK_NO_THROW(r = CallRPC(std::string("setban 127.0.0.0/24 add 9907731200 true")));
+    BOOST_CHECK_NO_THROW(r = CallRPC(std::string("listbanned")));
+    ar = r.get_array();
+    o1 = ar[0].get_obj();
+    adr = find_value(o1, "address");
+    UniValue banned_until = find_value(o1, "banned_until");
+    BOOST_CHECK_EQUAL(adr.get_str(), "127.0.0.0/24");
+    BOOST_CHECK_EQUAL(banned_until.get_int64(), 9907731200); // absolute time check
+
+    BOOST_CHECK_NO_THROW(CallRPC(string("clearbanned")));
+
+    BOOST_CHECK_NO_THROW(r = CallRPC(string("setban 127.0.0.0/24 add 200")));
+    BOOST_CHECK_NO_THROW(r = CallRPC(string("listbanned")));
+    ar = r.get_array();
+    o1 = ar[0].get_obj();
+    adr = find_value(o1, "address");
+    banned_until = find_value(o1, "banned_until");
+    BOOST_CHECK_EQUAL(adr.get_str(), "127.0.0.0/24");
+    int64_t now = GetTime();
+    BOOST_CHECK(banned_until.get_int64() > now);
+    BOOST_CHECK(banned_until.get_int64()-now <= 200);
+
+    // must throw an exception because 127.0.0.1 is in already banned subnet range
+    BOOST_CHECK_THROW(r = CallRPC(string("setban 127.0.0.1 add")), runtime_error);
+
+    BOOST_CHECK_NO_THROW(CallRPC(string("setban 127.0.0.0/24 remove")));;
+    BOOST_CHECK_NO_THROW(r = CallRPC(string("listbanned")));
+    ar = r.get_array();
+    BOOST_CHECK_EQUAL(ar.size(), 0);
+
+    BOOST_CHECK_NO_THROW(r = CallRPC(string("setban 127.0.0.0/255.255.0.0 add")));
+    BOOST_CHECK_THROW(r = CallRPC(string("setban 127.0.1.1 add")), runtime_error);
+
+    BOOST_CHECK_NO_THROW(CallRPC(string("clearbanned")));
+    BOOST_CHECK_NO_THROW(r = CallRPC(string("listbanned")));
+    ar = r.get_array();
+    BOOST_CHECK_EQUAL(ar.size(), 0);
+
+
+    BOOST_CHECK_THROW(r = CallRPC(string("setban test add")), runtime_error); //invalid IP
+
+    //IPv6 tests
+    BOOST_CHECK_NO_THROW(r = CallRPC(string("setban FE80:0000:0000:0000:0202:B3FF:FE1E:8329 add")));
+    BOOST_CHECK_NO_THROW(r = CallRPC(string("listbanned")));
+    ar = r.get_array();
+    o1 = ar[0].get_obj();
+    adr = find_value(o1, "address");
+    BOOST_CHECK_EQUAL(adr.get_str(), "fe80::202:b3ff:fe1e:8329/128");
+
+    BOOST_CHECK_NO_THROW(CallRPC(string("clearbanned")));
+    BOOST_CHECK_NO_THROW(r = CallRPC(string("setban 2001:db8::/ffff:fffc:0:0:0:0:0:0 add")));
+    BOOST_CHECK_NO_THROW(r = CallRPC(string("listbanned")));
+    ar = r.get_array();
+    o1 = ar[0].get_obj();
+    adr = find_value(o1, "address");
+    BOOST_CHECK_EQUAL(adr.get_str(), "2001:db8::/30");
+
+    BOOST_CHECK_NO_THROW(CallRPC(string("clearbanned")));
+    BOOST_CHECK_NO_THROW(r = CallRPC(string("setban 2001:4d48:ac57:400:cacf:e9ff:fe1d:9c63/128 add")));
+    BOOST_CHECK_NO_THROW(r = CallRPC(string("listbanned")));
+    ar = r.get_array();
+    o1 = ar[0].get_obj();
+    adr = find_value(o1, "address");
+    BOOST_CHECK_EQUAL(adr.get_str(), "2001:4d48:ac57:400:cacf:e9ff:fe1d:9c63/128");
+}
+
+
+BOOST_AUTO_TEST_CASE(rpc_raw_create_overwinter_v3)
+{
+    SelectParams(CBaseChainParams::REGTEST);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+
+    // Sample regtest address:
+    // public: tmHU5HLMu3yS8eoNvbrU1NWeJaGf6jxehru
+    // private: cW1G4SxEm5rui2RQtBcSUZrERTVYPtyZXKbSi5MCwBqzbn5kqwbN
+
+    UniValue r;
+    std::string prevout =
+      "[{\"txid\":\"b4cc287e58f87cdae59417329f710f3ecd75a4ee1d2872b7248f50977c8493f3\","
+      "\"vout\":1}]";
+    r = CallRPC(string("createrawtransaction ") + prevout + " " +
+      "{\"tmHU5HLMu3yS8eoNvbrU1NWeJaGf6jxehru\":11}");
+    std::string rawhex = r.get_str();
+    BOOST_CHECK_NO_THROW(r = CallRPC(string("decoderawtransaction ") + rawhex));
+    BOOST_CHECK_EQUAL(find_value(r.get_obj(), "overwintered").get_bool(), true);
+    BOOST_CHECK_EQUAL(find_value(r.get_obj(), "version").get_int(), 3);
+    BOOST_CHECK_EQUAL(find_value(r.get_obj(), "expiryheight").get_int(), 21);
+    BOOST_CHECK_EQUAL(
+        ParseHexToUInt32(find_value(r.get_obj(), "versiongroupid").get_str()),
+        OVERWINTER_VERSION_GROUP_ID);
+
+    // Sanity check we can deserialize the raw hex
+    // 030000807082c40301f393847c97508f24b772281deea475cd3e0f719f321794e5da7cf8587e28ccb40100000000ffffffff0100ab9041000000001976a914550dc92d3ff8d1f0cb6499fddf2fe43b745330cd88ac000000000000000000
+    CDataStream ss(ParseHex(rawhex), SER_DISK, PROTOCOL_VERSION);
+    CTransaction tx;
+    ss >> tx;
+    CDataStream ss2(ParseHex(rawhex), SER_DISK, PROTOCOL_VERSION);
+    CMutableTransaction mtx;
+    ss2 >> mtx;
+    BOOST_CHECK_EQUAL(tx.GetHash().GetHex(), CTransaction(mtx).GetHash().GetHex());
+
+    // Revert to default
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+}
+
+BOOST_AUTO_TEST_CASE(rpc_getnetworksolps)
+{
+    BOOST_CHECK_NO_THROW(CallRPC("getnetworksolps"));
+    BOOST_CHECK_NO_THROW(CallRPC("getnetworksolps 120"));
+    BOOST_CHECK_NO_THROW(CallRPC("getnetworksolps 120 -1"));
+}
+
+// Test parameter processing (not functionality).
+// These tests also ensure that src/rpc/client.cpp has the correct entries.
+BOOST_AUTO_TEST_CASE(rpc_insightexplorer)
+{
+    CheckRPCThrows("getaddressmempool \"a\"",
+        "Error: getaddressmempool is disabled. "
+        "Run './zcash-cli help getaddressmempool' for instructions on how to enable this feature.");
+    CheckRPCThrows("getaddressutxos \"a\"",
+        "Error: getaddressutxos is disabled. "
+        "Run './zcash-cli help getaddressutxos' for instructions on how to enable this feature.");
+    CheckRPCThrows("getaddressdeltas \"a\"",
+        "Error: getaddressdeltas is disabled. "
+        "Run './zcash-cli help getaddressdeltas' for instructions on how to enable this feature.");
+    CheckRPCThrows("getaddressbalance \"a\"",
+        "Error: getaddressbalance is disabled. "
+        "Run './zcash-cli help getaddressbalance' for instructions on how to enable this feature.");
+    CheckRPCThrows("getaddresstxids \"a\"",
+        "Error: getaddresstxids is disabled. "
+        "Run './zcash-cli help getaddresstxids' for instructions on how to enable this feature.");
+    CheckRPCThrows("getspentinfo {\"a\":1}",
+        "Error: getspentinfo is disabled. "
+        "Run './zcash-cli help getspentinfo' for instructions on how to enable this feature.");
+    CheckRPCThrows("getblockdeltas \"a\"",
+        "Error: getblockdeltas is disabled. "
+        "Run './zcash-cli help getblockdeltas' for instructions on how to enable this feature.");
+    CheckRPCThrows("getblockhashes 0 0",
+        "Error: getblockhashes is disabled. "
+        "Run './zcash-cli help getblockhashes' for instructions on how to enable this feature.");
+
+    fExperimentalInsightExplorer = true;
+    // During startup of the real system, fExperimentalInsightExplorer ("-insightexplorer")
+    // automatically enables the next four, but not here, must explicitly enable.
+    fAddressIndex = true;
+    fSpentIndex = true;
+    fTimestampIndex = true;
+
+    // must be a legal mainnet address
+    const string addr = "t1T3G72ToPuCDTiCEytrU1VUBRHsNupEBut";
+    BOOST_CHECK_NO_THROW(CallRPC("getaddressmempool \"" + addr + "\""));
+    BOOST_CHECK_NO_THROW(CallRPC("getaddressmempool {\"addresses\":[\"" + addr + "\"]}"));
+    BOOST_CHECK_NO_THROW(CallRPC("getaddressmempool {\"addresses\":[\"" + addr + "\",\"" + addr + "\"]}")); 
+
+    BOOST_CHECK_NO_THROW(CallRPC("getaddressutxos {\"addresses\":[],\"chainInfo\":true}"));
+    CheckRPCThrows("getaddressutxos {}",
+        "Addresses is expected to be an array");
+    CheckRPCThrows("getaddressutxos {\"addressesmisspell\":[]}",
+        "Addresses is expected to be an array");
+    CheckRPCThrows("getaddressutxos {\"addresses\":[],\"chainInfo\":1}",
+        "JSON value is not a boolean as expected");
+
+    BOOST_CHECK_NO_THROW(CallRPC("getaddressdeltas {\"addresses\":[]}"));
+    CheckRPCThrows("getaddressdeltas {\"addresses\":[],\"start\":0,\"end\":0,\"chainInfo\":true}",
+        "Start and end are expected to be greater than zero");
+    CheckRPCThrows("getaddressdeltas {\"addresses\":[],\"start\":3,\"end\":2,\"chainInfo\":true}",
+        "End value is expected to be greater than or equal to start");
+    // in this test environment, only the genesis block (0) exists
+    CheckRPCThrows("getaddressdeltas {\"addresses\":[],\"start\":2,\"end\":3,\"chainInfo\":true}",
+        "Start or end is outside chain range");
+
+    BOOST_CHECK_NO_THROW(CallRPC("getaddressbalance {\"addresses\":[]}"));
+
+    BOOST_CHECK_NO_THROW(CallRPC("getaddresstxids {\"addresses\":[]}"));
+    CheckRPCThrows("getaddresstxids {\"addresses\":[],\"start\":0,\"end\":0,\"chainInfo\":true}",
+        "Start and end are expected to be greater than zero");
+    CheckRPCThrows("getaddresstxids {\"addresses\":[],\"start\":3,\"end\":2,\"chainInfo\":true}",
+        "End value is expected to be greater than or equal to start");
+    // in this test environment, only the genesis block (0) exists
+    CheckRPCThrows("getaddresstxids {\"addresses\":[],\"start\":2,\"end\":3,\"chainInfo\":true}",
+        "Start or end is outside chain range");
+
+    // transaction does not exist:
+    CheckRPCThrows("getspentinfo {\"txid\":\"b4cc287e58f87cdae59417329f710f3ecd75a4ee1d2872b7248f50977c8493f3\",\"index\":0}",
+        "Unable to get spent info"); 
+    CheckRPCThrows("getspentinfo {\"txid\":\"b4cc287e58f87cdae59417329f710f3ecd75a4ee1d2872b7248f50977c8493f3\"}",
+        "Invalid index, must be an integer"); 
+    CheckRPCThrows("getspentinfo {\"txid\":\"hello\",\"index\":0}",
+        "txid must be hexadecimal string (not 'hello')");
+
+    // only the mainnet genesis block exists
+    BOOST_CHECK_NO_THROW(CallRPC("getblockdeltas \"00040fe8ec8471911baa1db1266ea15dd06b4a8a5c453883c000b031973dce08\""));
+    // damage the block hash (change last digit)
+    CheckRPCThrows("getblockdeltas \"00040fe8ec8471911baa1db1266ea15dd06b4a8a5c453883c000b031973dce09\"",
+        "Block not found");
+
+    BOOST_CHECK_NO_THROW(CallRPC("getblockhashes 1477641360 1477641360"));
+    BOOST_CHECK_NO_THROW(CallRPC("getblockhashes 1477641360 1477641360 {\"noOrphans\":true,\"logicalTimes\":true}"));
+    // Unfortunately, an unknown or mangled key is ignored
+    BOOST_CHECK_NO_THROW(CallRPC("getblockhashes 1477641360 1477641360 {\"AAAnoOrphans\":true,\"logicalTimes\":true}"));
+    CheckRPCThrows("getblockhashes 1477641360 1477641360 {\"noOrphans\":true,\"logicalTimes\":1}",
+        "JSON value is not a boolean as expected");
+    CheckRPCThrows("getblockhashes 1477641360 1477641360 {\"noOrphans\":True,\"logicalTimes\":false}",
+        "Error parsing JSON:{\"noOrphans\":True,\"logicalTimes\":false}");
+
+    // revert
+    fExperimentalInsightExplorer = false;
+    fAddressIndex = false;
+    fSpentIndex = false;
+    fTimestampIndex = false;
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/sanity_tests.cpp b/depend/zcash/src/test/sanity_tests.cpp
new file mode 100644
index 000000000..c7ce9af4c
--- /dev/null
+++ b/depend/zcash/src/test/sanity_tests.cpp
@@ -0,0 +1,20 @@
+// Copyright (c) 2012-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "compat/sanity.h"
+#include "key.h"
+#include "test/test_bitcoin.h"
+
+#include <boost/test/unit_test.hpp>
+
+BOOST_FIXTURE_TEST_SUITE(sanity_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(basic_sanity)
+{
+  BOOST_CHECK_MESSAGE(glibc_sanity_test() == true, "libc sanity test");
+  BOOST_CHECK_MESSAGE(glibcxx_sanity_test() == true, "stdlib sanity test");
+  BOOST_CHECK_MESSAGE(CKey::ECC_InitSanityCheck() == true, "ECC sanity test");
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/scheduler_tests.cpp b/depend/zcash/src/test/scheduler_tests.cpp
new file mode 100644
index 000000000..811003440
--- /dev/null
+++ b/depend/zcash/src/test/scheduler_tests.cpp
@@ -0,0 +1,110 @@
+// Copyright (c) 2012-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "random.h"
+#include "scheduler.h"
+
+#include "test/test_bitcoin.h"
+
+#include <boost/bind/bind.hpp>
+#include <boost/random/mersenne_twister.hpp>
+#include <boost/random/uniform_int_distribution.hpp>
+#include <boost/thread.hpp>
+#include <boost/test/unit_test.hpp>
+
+BOOST_AUTO_TEST_SUITE(scheduler_tests)
+
+static void microTask(CScheduler& s, boost::mutex& mutex, int& counter, int delta, boost::chrono::system_clock::time_point rescheduleTime)
+{
+    {
+        boost::unique_lock<boost::mutex> lock(mutex);
+        counter += delta;
+    }
+    boost::chrono::system_clock::time_point noTime = boost::chrono::system_clock::time_point::min();
+    if (rescheduleTime != noTime) {
+        CScheduler::Function f = boost::bind(&microTask, boost::ref(s), boost::ref(mutex), boost::ref(counter), -delta + 1, noTime);
+        s.schedule(f, rescheduleTime);
+    }
+}
+
+static void MicroSleep(uint64_t n)
+{
+    boost::this_thread::sleep_for(boost::chrono::microseconds(n));
+}
+
+BOOST_AUTO_TEST_CASE(manythreads)
+{
+    // Stress test: hundreds of microsecond-scheduled tasks,
+    // serviced by 10 threads.
+    //
+    // So... ten shared counters, which if all the tasks execute
+    // properly will sum to the number of tasks done.
+    // Each task adds or subtracts from one of the counters a
+    // random amount, and then schedules another task 0-1000
+    // microseconds in the future to subtract or add from
+    // the counter -random_amount+1, so in the end the shared
+    // counters should sum to the number of initial tasks performed.
+    CScheduler microTasks;
+
+    boost::mutex counterMutex[10];
+    int counter[10] = { 0 };
+    boost::random::mt19937 rng(42);
+    boost::random::uniform_int_distribution<> zeroToNine(0, 9);
+    boost::random::uniform_int_distribution<> randomMsec(-11, 1000);
+    boost::random::uniform_int_distribution<> randomDelta(-1000, 1000);
+
+    boost::chrono::system_clock::time_point start = boost::chrono::system_clock::now();
+    boost::chrono::system_clock::time_point now = start;
+    boost::chrono::system_clock::time_point first, last;
+    size_t nTasks = microTasks.getQueueInfo(first, last);
+    BOOST_CHECK(nTasks == 0);
+
+    for (int i = 0; i < 100; i++) {
+        boost::chrono::system_clock::time_point t = now + boost::chrono::microseconds(randomMsec(rng));
+        boost::chrono::system_clock::time_point tReschedule = now + boost::chrono::microseconds(500 + randomMsec(rng));
+        int whichCounter = zeroToNine(rng);
+        CScheduler::Function f = boost::bind(&microTask, boost::ref(microTasks),
+                                             boost::ref(counterMutex[whichCounter]), boost::ref(counter[whichCounter]),
+                                             randomDelta(rng), tReschedule);
+        microTasks.schedule(f, t);
+    }
+    nTasks = microTasks.getQueueInfo(first, last);
+    BOOST_CHECK(nTasks == 100);
+    BOOST_CHECK(first < last);
+    BOOST_CHECK(last > now);
+
+    // As soon as these are created they will start running and servicing the queue
+    boost::thread_group microThreads;
+    for (int i = 0; i < 5; i++)
+        microThreads.create_thread(boost::bind(&CScheduler::serviceQueue, &microTasks));
+
+    MicroSleep(600);
+    now = boost::chrono::system_clock::now();
+
+    // More threads and more tasks:
+    for (int i = 0; i < 5; i++)
+        microThreads.create_thread(boost::bind(&CScheduler::serviceQueue, &microTasks));
+    for (int i = 0; i < 100; i++) {
+        boost::chrono::system_clock::time_point t = now + boost::chrono::microseconds(randomMsec(rng));
+        boost::chrono::system_clock::time_point tReschedule = now + boost::chrono::microseconds(500 + randomMsec(rng));
+        int whichCounter = zeroToNine(rng);
+        CScheduler::Function f = boost::bind(&microTask, boost::ref(microTasks),
+                                             boost::ref(counterMutex[whichCounter]), boost::ref(counter[whichCounter]),
+                                             randomDelta(rng), tReschedule);
+        microTasks.schedule(f, t);
+    }
+
+    // Drain the task queue then exit threads
+    microTasks.stop(true);
+    microThreads.join_all(); // ... wait until all the threads are done
+
+    int counterSum = 0;
+    for (int i = 0; i < 10; i++) {
+        BOOST_CHECK(counter[i] != 0);
+        counterSum += counter[i];
+    }
+    BOOST_CHECK_EQUAL(counterSum, 200);
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/script_P2PKH_tests.cpp b/depend/zcash/src/test/script_P2PKH_tests.cpp
new file mode 100644
index 000000000..9418b0d02
--- /dev/null
+++ b/depend/zcash/src/test/script_P2PKH_tests.cpp
@@ -0,0 +1,59 @@
+// Copyright (c) 2012-2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "script/script.h"
+#include "test/test_bitcoin.h"
+
+#include <boost/test/unit_test.hpp>
+
+using namespace std;
+
+BOOST_FIXTURE_TEST_SUITE(script_P2PKH_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(IsPayToPublicKeyHash)
+{
+    // Test CScript::IsPayToPublicKeyHash()
+    uint160 dummy;
+    CScript p2pkh;
+    p2pkh << OP_DUP << OP_HASH160 << ToByteVector(dummy) << OP_EQUALVERIFY << OP_CHECKSIG;
+    BOOST_CHECK(p2pkh.IsPayToPublicKeyHash());
+
+    static const unsigned char direct[] = {
+        OP_DUP, OP_HASH160, 20, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, OP_EQUALVERIFY, OP_CHECKSIG
+    };
+    BOOST_CHECK(CScript(direct, direct+sizeof(direct)).IsPayToPublicKeyHash());
+
+    static const unsigned char notp2pkh1[] = {
+        OP_DUP, OP_HASH160, 20, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, OP_EQUALVERIFY, OP_CHECKSIG, OP_CHECKSIG
+    };
+    BOOST_CHECK(!CScript(notp2pkh1, notp2pkh1+sizeof(notp2pkh1)).IsPayToPublicKeyHash());
+
+    static const unsigned char p2sh[] = {
+        OP_HASH160, 20, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, OP_EQUAL
+    };
+    BOOST_CHECK(!CScript(p2sh, p2sh+sizeof(p2sh)).IsPayToPublicKeyHash());
+
+    static const unsigned char extra[] = {
+        OP_DUP, OP_HASH160, 20, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, OP_EQUALVERIFY, OP_CHECKSIG, OP_CHECKSIG
+    };
+    BOOST_CHECK(!CScript(extra, extra+sizeof(extra)).IsPayToPublicKeyHash());
+
+    static const unsigned char missing[] = {
+        OP_HASH160, 20, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, OP_EQUALVERIFY, OP_CHECKSIG, OP_RETURN
+    };
+    BOOST_CHECK(!CScript(missing, missing+sizeof(missing)).IsPayToPublicKeyHash());
+
+    static const unsigned char missing2[] = {
+        OP_DUP, OP_HASH160, 20, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
+    };
+    BOOST_CHECK(!CScript(missing2, missing2+sizeof(missing2)).IsPayToPublicKeyHash());
+
+    static const unsigned char tooshort[] = {
+        OP_DUP, OP_HASH160, 2, 0,0, OP_EQUALVERIFY, OP_CHECKSIG
+    };
+    BOOST_CHECK(!CScript(tooshort, tooshort+sizeof(tooshort)).IsPayToPublicKeyHash());
+
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/script_P2SH_tests.cpp b/depend/zcash/src/test/script_P2SH_tests.cpp
new file mode 100644
index 000000000..172aa4f81
--- /dev/null
+++ b/depend/zcash/src/test/script_P2SH_tests.cpp
@@ -0,0 +1,405 @@
+// Copyright (c) 2012-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "consensus/upgrades.h"
+#include "core_io.h"
+#include "key.h"
+#include "keystore.h"
+#include "main.h"
+#include "policy/policy.h"
+#include "script/script.h"
+#include "script/script_error.h"
+#include "script/sign.h"
+#include "script/ismine.h"
+#include "test/test_bitcoin.h"
+
+#include <vector>
+
+#include <boost/test/unit_test.hpp>
+#include <boost/test/data/test_case.hpp>
+
+using namespace std;
+
+// Helpers:
+static std::vector<unsigned char>
+Serialize(const CScript& s)
+{
+    std::vector<unsigned char> sSerialized(s.begin(), s.end());
+    return sSerialized;
+}
+
+static bool
+Verify(const CScript& scriptSig, const CScript& scriptPubKey, bool fStrict, ScriptError& err, uint32_t consensusBranchId)
+{
+    // Create dummy to/from transactions:
+    CMutableTransaction txFrom;
+    txFrom.vout.resize(1);
+    txFrom.vout[0].scriptPubKey = scriptPubKey;
+    // Meaningless value, but we need it for the Rust code to parse this.
+    txFrom.vout[0].nValue = 10;
+
+    CMutableTransaction txTo;
+    txTo.vin.resize(1);
+    txTo.vout.resize(1);
+    txTo.vin[0].prevout.n = 0;
+    txTo.vin[0].prevout.hash = txFrom.GetHash();
+    txTo.vin[0].scriptSig = scriptSig;
+    txTo.vout[0].nValue = 1;
+
+    const PrecomputedTransactionData txdata(txTo, txFrom.vout);
+    return VerifyScript(scriptSig, scriptPubKey, fStrict ? SCRIPT_VERIFY_P2SH : SCRIPT_VERIFY_NONE, MutableTransactionSignatureChecker(&txTo, txdata, 0, txFrom.vout[0].nValue), consensusBranchId, &err);
+}
+
+
+BOOST_FIXTURE_TEST_SUITE(script_P2SH_tests, BasicTestingSetup)
+
+// Parameterized testing over consensus branch ids
+BOOST_DATA_TEST_CASE(sign, boost::unit_test::data::xrange(static_cast<int>(Consensus::MAX_NETWORK_UPGRADES)))
+{
+    LOCK(cs_main);
+    uint32_t consensusBranchId = NetworkUpgradeInfo[sample].nBranchId;
+    // Pay-to-script-hash looks like this:
+    // scriptSig:    <sig> <sig...> <serialized_script>
+    // scriptPubKey: HASH160 <hash> EQUAL
+
+    // Test SignSignature() (and therefore the version of Solver() that signs transactions)
+    CBasicKeyStore keystore;
+    CKey key[4];
+    for (int i = 0; i < 4; i++)
+    {
+        key[i] = CKey::TestOnlyRandomKey(true);
+        keystore.AddKey(key[i]);
+    }
+
+    // 8 Scripts: checking all combinations of
+    // different keys, straight/P2SH, pubkey/pubkeyhash
+    CScript standardScripts[4];
+    standardScripts[0] << ToByteVector(key[0].GetPubKey()) << OP_CHECKSIG;
+    standardScripts[1] = GetScriptForDestination(key[1].GetPubKey().GetID());
+    standardScripts[2] << ToByteVector(key[1].GetPubKey()) << OP_CHECKSIG;
+    standardScripts[3] = GetScriptForDestination(key[2].GetPubKey().GetID());
+    CScript evalScripts[4];
+    for (int i = 0; i < 4; i++)
+    {
+        keystore.AddCScript(standardScripts[i]);
+        evalScripts[i] = GetScriptForDestination(CScriptID(standardScripts[i]));
+    }
+
+    CMutableTransaction txFrom;  // Funding transaction:
+    string reason;
+    txFrom.vout.resize(8);
+    for (int i = 0; i < 4; i++)
+    {
+        txFrom.vout[i].scriptPubKey = evalScripts[i];
+        txFrom.vout[i].nValue = COIN;
+        txFrom.vout[i+4].scriptPubKey = standardScripts[i];
+        txFrom.vout[i+4].nValue = COIN;
+    }
+    BOOST_CHECK(IsStandardTx(txFrom, reason, Params()));
+
+    CMutableTransaction txTo[8]; // Spending transactions
+    std::vector<PrecomputedTransactionData> txToData;
+    for (int i = 0; i < 8; i++)
+    {
+        txTo[i].vin.resize(1);
+        txTo[i].vout.resize(1);
+        txTo[i].vin[0].prevout.n = i;
+        txTo[i].vin[0].prevout.hash = txFrom.GetHash();
+        txTo[i].vout[0].nValue = 1;
+        BOOST_CHECK_MESSAGE(IsMine(keystore, txFrom.vout[i].scriptPubKey), strprintf("IsMine %d", i));
+        txToData.push_back(PrecomputedTransactionData(txTo[i], {txFrom.vout[i]}));
+    }
+    for (int i = 0; i < 8; i++)
+    {
+        BOOST_CHECK_MESSAGE(SignSignature(keystore, txFrom, txTo[i], txToData[i], 0, SIGHASH_ALL, consensusBranchId), strprintf("SignSignature %d", i));
+    }
+    // All of the above should be OK, and the txTos have valid signatures
+    // Check to make sure signature verification fails if we use the wrong ScriptSig:
+    for (int i = 0; i < 8; i++) {
+        PrecomputedTransactionData txdata(txTo[i], {txFrom.vout[i]});
+        for (int j = 0; j < 8; j++)
+        {
+            CScript sigSave = txTo[i].vin[0].scriptSig;
+            txTo[i].vin[0].scriptSig = txTo[j].vin[0].scriptSig;
+            bool sigOK = CScriptCheck(CCoins(txFrom, 0), txTo[i], 0, SCRIPT_VERIFY_P2SH | SCRIPT_VERIFY_STRICTENC, false, consensusBranchId, &txdata)();
+            if (i == j)
+                BOOST_CHECK_MESSAGE(sigOK, strprintf("VerifySignature %d %d", i, j));
+            else
+                BOOST_CHECK_MESSAGE(!sigOK, strprintf("VerifySignature %d %d", i, j));
+            txTo[i].vin[0].scriptSig = sigSave;
+        }
+    }
+}
+
+// Parameterized testing over consensus branch ids
+BOOST_DATA_TEST_CASE(norecurse, boost::unit_test::data::xrange(static_cast<int>(Consensus::MAX_NETWORK_UPGRADES)))
+{
+    uint32_t consensusBranchId = NetworkUpgradeInfo[sample].nBranchId;
+
+    ScriptError err;
+    // Make sure only the outer pay-to-script-hash does the
+    // extra-validation thing:
+    CScript invalidAsScript;
+    invalidAsScript << OP_INVALIDOPCODE << OP_INVALIDOPCODE;
+
+    CScript p2sh = GetScriptForDestination(CScriptID(invalidAsScript));
+
+    CScript scriptSig;
+    scriptSig << Serialize(invalidAsScript);
+
+    // Should not verify, because it will try to execute OP_INVALIDOPCODE
+    BOOST_CHECK(!Verify(scriptSig, p2sh, true, err, consensusBranchId));
+    BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_BAD_OPCODE, ScriptErrorString(err));
+
+    // Try to recur, and verification should succeed because
+    // the inner HASH160 <> EQUAL should only check the hash:
+    CScript p2sh2 = GetScriptForDestination(CScriptID(p2sh));
+    CScript scriptSig2;
+    scriptSig2 << Serialize(invalidAsScript) << Serialize(p2sh);
+
+    BOOST_CHECK(Verify(scriptSig2, p2sh2, true, err, consensusBranchId));
+    BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_OK, ScriptErrorString(err));
+}
+
+// Parameterized testing over consensus branch ids
+BOOST_DATA_TEST_CASE(set, boost::unit_test::data::xrange(static_cast<int>(Consensus::MAX_NETWORK_UPGRADES)))
+{
+    LOCK(cs_main);
+    uint32_t consensusBranchId = NetworkUpgradeInfo[sample].nBranchId;
+    // Test the CScript::Set* methods
+    CBasicKeyStore keystore;
+    CKey key[4];
+    std::vector<CPubKey> keys;
+    for (int i = 0; i < 4; i++)
+    {
+        key[i] = CKey::TestOnlyRandomKey(true);
+        keystore.AddKey(key[i]);
+        keys.push_back(key[i].GetPubKey());
+    }
+
+    CScript inner[4];
+    inner[0] = GetScriptForDestination(key[0].GetPubKey().GetID());
+    inner[1] = GetScriptForMultisig(2, std::vector<CPubKey>(keys.begin(), keys.begin()+2));
+    inner[2] = GetScriptForMultisig(1, std::vector<CPubKey>(keys.begin(), keys.begin()+2));
+    inner[3] = GetScriptForMultisig(2, std::vector<CPubKey>(keys.begin(), keys.begin()+3));
+
+    CScript outer[4];
+    for (int i = 0; i < 4; i++)
+    {
+        outer[i] = GetScriptForDestination(CScriptID(inner[i]));
+        keystore.AddCScript(inner[i]);
+    }
+
+    CMutableTransaction txFrom;  // Funding transaction:
+    string reason;
+    txFrom.vout.resize(4);
+    for (int i = 0; i < 4; i++)
+    {
+        txFrom.vout[i].scriptPubKey = outer[i];
+        txFrom.vout[i].nValue = CENT;
+    }
+    BOOST_CHECK(IsStandardTx(txFrom, reason, Params()));
+
+    CMutableTransaction txTo[4]; // Spending transactions
+    std::vector<PrecomputedTransactionData> txToData;
+    for (int i = 0; i < 4; i++)
+    {
+        txTo[i].vin.resize(1);
+        txTo[i].vout.resize(1);
+        txTo[i].vin[0].prevout.n = i;
+        txTo[i].vin[0].prevout.hash = txFrom.GetHash();
+        txTo[i].vout[0].nValue = 1*CENT;
+        txTo[i].vout[0].scriptPubKey = inner[i];
+        BOOST_CHECK_MESSAGE(IsMine(keystore, txFrom.vout[i].scriptPubKey), strprintf("IsMine %d", i));
+        txToData.push_back(PrecomputedTransactionData(txTo[i], {txFrom.vout[i]}));
+    }
+    for (int i = 0; i < 4; i++)
+    {
+        BOOST_CHECK_MESSAGE(SignSignature(keystore, txFrom, txTo[i], txToData[i], 0, SIGHASH_ALL, consensusBranchId), strprintf("SignSignature %d", i));
+        BOOST_CHECK_MESSAGE(IsStandardTx(txTo[i], reason, Params()), strprintf("txTo[%d].IsStandard", i));
+    }
+}
+
+BOOST_AUTO_TEST_CASE(is)
+{
+    // Test CScript::IsPayToScriptHash()
+    uint160 dummy;
+    CScript p2sh;
+    p2sh << OP_HASH160 << ToByteVector(dummy) << OP_EQUAL;
+    BOOST_CHECK(p2sh.IsPayToScriptHash());
+
+    // Not considered pay-to-script-hash if using one of the OP_PUSHDATA opcodes:
+    static const unsigned char direct[] =    { OP_HASH160, 20, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, OP_EQUAL };
+    BOOST_CHECK(CScript(direct, direct+sizeof(direct)).IsPayToScriptHash());
+    static const unsigned char pushdata1[] = { OP_HASH160, OP_PUSHDATA1, 20, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, OP_EQUAL };
+    BOOST_CHECK(!CScript(pushdata1, pushdata1+sizeof(pushdata1)).IsPayToScriptHash());
+    static const unsigned char pushdata2[] = { OP_HASH160, OP_PUSHDATA2, 20,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, OP_EQUAL };
+    BOOST_CHECK(!CScript(pushdata2, pushdata2+sizeof(pushdata2)).IsPayToScriptHash());
+    static const unsigned char pushdata4[] = { OP_HASH160, OP_PUSHDATA4, 20,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, OP_EQUAL };
+    BOOST_CHECK(!CScript(pushdata4, pushdata4+sizeof(pushdata4)).IsPayToScriptHash());
+
+    CScript not_p2sh;
+    BOOST_CHECK(!not_p2sh.IsPayToScriptHash());
+
+    not_p2sh.clear(); not_p2sh << OP_HASH160 << ToByteVector(dummy) << ToByteVector(dummy) << OP_EQUAL;
+    BOOST_CHECK(!not_p2sh.IsPayToScriptHash());
+
+    not_p2sh.clear(); not_p2sh << OP_NOP << ToByteVector(dummy) << OP_EQUAL;
+    BOOST_CHECK(!not_p2sh.IsPayToScriptHash());
+
+    not_p2sh.clear(); not_p2sh << OP_HASH160 << ToByteVector(dummy) << OP_CHECKSIG;
+    BOOST_CHECK(!not_p2sh.IsPayToScriptHash());
+}
+
+// Parameterized testing over consensus branch ids
+BOOST_DATA_TEST_CASE(switchover, boost::unit_test::data::xrange(static_cast<int>(Consensus::MAX_NETWORK_UPGRADES)))
+{
+    uint32_t consensusBranchId = NetworkUpgradeInfo[sample].nBranchId;
+
+    // Test switch over code
+    CScript notValid;
+    ScriptError err;
+    notValid << OP_11 << OP_12 << OP_EQUALVERIFY;
+    CScript scriptSig;
+    scriptSig << Serialize(notValid);
+
+    CScript fund = GetScriptForDestination(CScriptID(notValid));
+
+
+    // Validation should succeed under old rules (hash is correct):
+    BOOST_CHECK(Verify(scriptSig, fund, false, err, consensusBranchId));
+    BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_OK, ScriptErrorString(err));
+    // Fail under new:
+    BOOST_CHECK(!Verify(scriptSig, fund, true, err, consensusBranchId));
+    BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_EQUALVERIFY, ScriptErrorString(err));
+}
+
+// Parameterized testing over consensus branch ids
+BOOST_DATA_TEST_CASE(AreInputsStandard, boost::unit_test::data::xrange(static_cast<int>(Consensus::MAX_NETWORK_UPGRADES)))
+{
+    LOCK(cs_main);
+    uint32_t consensusBranchId = NetworkUpgradeInfo[sample].nBranchId;
+    CCoinsView coinsDummy;
+    CCoinsViewCache coins(&coinsDummy);
+    CBasicKeyStore keystore;
+    CKey key[6];
+    vector<CPubKey> keys;
+    for (int i = 0; i < 6; i++)
+    {
+        key[i] = CKey::TestOnlyRandomKey(true);
+        keystore.AddKey(key[i]);
+    }
+    for (int i = 0; i < 3; i++)
+        keys.push_back(key[i].GetPubKey());
+
+    CMutableTransaction txFrom;
+    txFrom.vout.resize(7);
+
+    // First three are standard:
+    CScript pay1 = GetScriptForDestination(key[0].GetPubKey().GetID());
+    keystore.AddCScript(pay1);
+    CScript pay1of3 = GetScriptForMultisig(1, keys);
+
+    txFrom.vout[0].scriptPubKey = GetScriptForDestination(CScriptID(pay1)); // P2SH (OP_CHECKSIG)
+    txFrom.vout[0].nValue = 1000;
+    txFrom.vout[1].scriptPubKey = pay1; // ordinary OP_CHECKSIG
+    txFrom.vout[1].nValue = 2000;
+    txFrom.vout[2].scriptPubKey = pay1of3; // ordinary OP_CHECKMULTISIG
+    txFrom.vout[2].nValue = 3000;
+
+    // vout[3] is complicated 1-of-3 AND 2-of-3
+    // ... that is OK if wrapped in P2SH:
+    CScript oneAndTwo;
+    oneAndTwo << OP_1 << ToByteVector(key[0].GetPubKey()) << ToByteVector(key[1].GetPubKey()) << ToByteVector(key[2].GetPubKey());
+    oneAndTwo << OP_3 << OP_CHECKMULTISIGVERIFY;
+    oneAndTwo << OP_2 << ToByteVector(key[3].GetPubKey()) << ToByteVector(key[4].GetPubKey()) << ToByteVector(key[5].GetPubKey());
+    oneAndTwo << OP_3 << OP_CHECKMULTISIG;
+    keystore.AddCScript(oneAndTwo);
+    txFrom.vout[3].scriptPubKey = GetScriptForDestination(CScriptID(oneAndTwo));
+    txFrom.vout[3].nValue = 4000;
+
+    // vout[4] is max sigops:
+    CScript fifteenSigops; fifteenSigops << OP_1;
+    for (unsigned i = 0; i < MAX_P2SH_SIGOPS; i++)
+        fifteenSigops << ToByteVector(key[i%3].GetPubKey());
+    fifteenSigops << OP_15 << OP_CHECKMULTISIG;
+    keystore.AddCScript(fifteenSigops);
+    txFrom.vout[4].scriptPubKey = GetScriptForDestination(CScriptID(fifteenSigops));
+    txFrom.vout[4].nValue = 5000;
+
+    // vout[5/6] are non-standard because they exceed MAX_P2SH_SIGOPS
+    CScript sixteenSigops; sixteenSigops << OP_16 << OP_CHECKMULTISIG;
+    keystore.AddCScript(sixteenSigops);
+    txFrom.vout[5].scriptPubKey = GetScriptForDestination(CScriptID(fifteenSigops));
+    txFrom.vout[5].nValue = 5000;
+    CScript twentySigops; twentySigops << OP_CHECKMULTISIG;
+    keystore.AddCScript(twentySigops);
+    txFrom.vout[6].scriptPubKey = GetScriptForDestination(CScriptID(twentySigops));
+    txFrom.vout[6].nValue = 6000;
+
+    coins.ModifyCoins(txFrom.GetHash())->FromTx(txFrom, 0);
+
+    CMutableTransaction txTo;
+    txTo.vout.resize(1);
+    txTo.vout[0].scriptPubKey = GetScriptForDestination(key[1].GetPubKey().GetID());
+    // Meaningless value, but we need it for the Rust code to parse this.
+    txTo.vout[0].nValue = 10;
+
+    txTo.vin.resize(5);
+    std::vector<CTxOut> allPrevOutputs;
+    for (int i = 0; i < 5; i++)
+    {
+        txTo.vin[i].prevout.n = i;
+        txTo.vin[i].prevout.hash = txFrom.GetHash();
+        allPrevOutputs.push_back(txFrom.vout[i]);
+    }
+    const PrecomputedTransactionData txToData(txTo, allPrevOutputs);
+    BOOST_CHECK(SignSignature(keystore, txFrom, txTo, txToData, 0, SIGHASH_ALL, consensusBranchId));
+    BOOST_CHECK(SignSignature(keystore, txFrom, txTo, txToData, 1, SIGHASH_ALL, consensusBranchId));
+    BOOST_CHECK(SignSignature(keystore, txFrom, txTo, txToData, 2, SIGHASH_ALL, consensusBranchId));
+    // SignSignature doesn't know how to sign these. We're
+    // not testing validating signatures, so just create
+    // dummy signatures that DO include the correct P2SH scripts:
+    txTo.vin[3].scriptSig << OP_11 << OP_11 << vector<unsigned char>(oneAndTwo.begin(), oneAndTwo.end());
+    txTo.vin[4].scriptSig << vector<unsigned char>(fifteenSigops.begin(), fifteenSigops.end());
+
+    BOOST_CHECK(::AreInputsStandard(txTo, coins, consensusBranchId));
+    // 22 P2SH sigops for all inputs (1 for vin[0], 6 for vin[3], 15 for vin[4]
+    BOOST_CHECK_EQUAL(GetP2SHSigOpCount(txTo, coins), 22U);
+
+    // Make sure adding crap to the scriptSigs makes them non-standard:
+    for (int i = 0; i < 3; i++)
+    {
+        CScript t = txTo.vin[i].scriptSig;
+        txTo.vin[i].scriptSig = (CScript() << 11) + t;
+        BOOST_CHECK(!::AreInputsStandard(txTo, coins, consensusBranchId));
+        txTo.vin[i].scriptSig = t;
+    }
+
+    CMutableTransaction txToNonStd1;
+    txToNonStd1.vout.resize(1);
+    txToNonStd1.vout[0].scriptPubKey = GetScriptForDestination(key[1].GetPubKey().GetID());
+    txToNonStd1.vout[0].nValue = 1000;
+    txToNonStd1.vin.resize(1);
+    txToNonStd1.vin[0].prevout.n = 5;
+    txToNonStd1.vin[0].prevout.hash = txFrom.GetHash();
+    txToNonStd1.vin[0].scriptSig << vector<unsigned char>(sixteenSigops.begin(), sixteenSigops.end());
+
+    BOOST_CHECK(!::AreInputsStandard(txToNonStd1, coins, consensusBranchId));
+    BOOST_CHECK_EQUAL(GetP2SHSigOpCount(txToNonStd1, coins), 16U);
+
+    CMutableTransaction txToNonStd2;
+    txToNonStd2.vout.resize(1);
+    txToNonStd2.vout[0].scriptPubKey = GetScriptForDestination(key[1].GetPubKey().GetID());
+    txToNonStd2.vout[0].nValue = 1000;
+    txToNonStd2.vin.resize(1);
+    txToNonStd2.vin[0].prevout.n = 6;
+    txToNonStd2.vin[0].prevout.hash = txFrom.GetHash();
+    txToNonStd2.vin[0].scriptSig << vector<unsigned char>(twentySigops.begin(), twentySigops.end());
+
+    BOOST_CHECK(!::AreInputsStandard(txToNonStd2, coins, consensusBranchId));
+    BOOST_CHECK_EQUAL(GetP2SHSigOpCount(txToNonStd2, coins), 20U);
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/script_standard_tests.cpp b/depend/zcash/src/test/script_standard_tests.cpp
new file mode 100644
index 000000000..2a4ee1443
--- /dev/null
+++ b/depend/zcash/src/test/script_standard_tests.cpp
@@ -0,0 +1,526 @@
+// Copyright (c) 2017 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or http://www.opensource.org/licenses/mit-license.php .
+
+#include "key.h"
+#include "keystore.h"
+#include "script/ismine.h"
+#include "script/script.h"
+#include "script/script_error.h"
+#include "script/standard.h"
+#include "test/test_bitcoin.h"
+
+#include <variant>
+
+#include <boost/test/unit_test.hpp>
+
+
+BOOST_FIXTURE_TEST_SUITE(script_standard_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(script_standard_Solver_success)
+{
+    CKey keys[3];
+    CPubKey pubkeys[3];
+    for (int i = 0; i < 3; i++) {
+        keys[i] = CKey::TestOnlyRandomKey(true);
+        pubkeys[i] = keys[i].GetPubKey();
+    }
+
+    CScript s;
+    txnouttype whichType;
+    std::vector<std::vector<unsigned char> > solutions;
+
+    // TX_PUBKEY
+    s.clear();
+    s << ToByteVector(pubkeys[0]) << OP_CHECKSIG;
+    BOOST_CHECK(Solver(s, whichType, solutions));
+    BOOST_CHECK_EQUAL(whichType, TX_PUBKEY);
+    BOOST_CHECK_EQUAL(solutions.size(), 1);
+    BOOST_CHECK(solutions[0] == ToByteVector(pubkeys[0]));
+
+    // TX_PUBKEYHASH
+    s.clear();
+    s << OP_DUP << OP_HASH160 << ToByteVector(pubkeys[0].GetID()) << OP_EQUALVERIFY << OP_CHECKSIG;
+    BOOST_CHECK(Solver(s, whichType, solutions));
+    BOOST_CHECK_EQUAL(whichType, TX_PUBKEYHASH);
+    BOOST_CHECK_EQUAL(solutions.size(), 1);
+    BOOST_CHECK(solutions[0] == ToByteVector(pubkeys[0].GetID()));
+
+    // TX_SCRIPTHASH
+    CScript redeemScript(s); // initialize with leftover P2PKH script
+    s.clear();
+    s << OP_HASH160 << ToByteVector(CScriptID(redeemScript)) << OP_EQUAL;
+    BOOST_CHECK(Solver(s, whichType, solutions));
+    BOOST_CHECK_EQUAL(whichType, TX_SCRIPTHASH);
+    BOOST_CHECK_EQUAL(solutions.size(), 1);
+    BOOST_CHECK(solutions[0] == ToByteVector(CScriptID(redeemScript)));
+
+    // TX_MULTISIG
+    s.clear();
+    s << OP_1 <<
+        ToByteVector(pubkeys[0]) <<
+        ToByteVector(pubkeys[1]) <<
+        OP_2 << OP_CHECKMULTISIG;
+    BOOST_CHECK(Solver(s, whichType, solutions));
+    BOOST_CHECK_EQUAL(whichType, TX_MULTISIG);
+    BOOST_CHECK_EQUAL(solutions.size(), 4);
+    BOOST_CHECK(solutions[0] == std::vector<unsigned char>({1}));
+    BOOST_CHECK(solutions[1] == ToByteVector(pubkeys[0]));
+    BOOST_CHECK(solutions[2] == ToByteVector(pubkeys[1]));
+    BOOST_CHECK(solutions[3] == std::vector<unsigned char>({2}));
+
+    s.clear();
+    s << OP_2 <<
+        ToByteVector(pubkeys[0]) <<
+        ToByteVector(pubkeys[1]) <<
+        ToByteVector(pubkeys[2]) <<
+        OP_3 << OP_CHECKMULTISIG;
+    BOOST_CHECK(Solver(s, whichType, solutions));
+    BOOST_CHECK_EQUAL(whichType, TX_MULTISIG);
+    BOOST_CHECK_EQUAL(solutions.size(), 5);
+    BOOST_CHECK(solutions[0] == std::vector<unsigned char>({2}));
+    BOOST_CHECK(solutions[1] == ToByteVector(pubkeys[0]));
+    BOOST_CHECK(solutions[2] == ToByteVector(pubkeys[1]));
+    BOOST_CHECK(solutions[3] == ToByteVector(pubkeys[2]));
+    BOOST_CHECK(solutions[4] == std::vector<unsigned char>({3}));
+
+    // TX_NULL_DATA
+    s.clear();
+    s << OP_RETURN <<
+        std::vector<unsigned char>({0}) <<
+        std::vector<unsigned char>({75}) <<
+        std::vector<unsigned char>({255});
+    BOOST_CHECK(Solver(s, whichType, solutions));
+    BOOST_CHECK_EQUAL(whichType, TX_NULL_DATA);
+    BOOST_CHECK_EQUAL(solutions.size(), 0);
+
+    // TX_NONSTANDARD
+    s.clear();
+    s << OP_9 << OP_ADD << OP_11 << OP_EQUAL;
+    BOOST_CHECK(!Solver(s, whichType, solutions));
+    BOOST_CHECK_EQUAL(whichType, TX_NONSTANDARD);
+}
+
+BOOST_AUTO_TEST_CASE(script_standard_Solver_failure)
+{
+    CKey key = CKey::TestOnlyRandomKey(true);
+    CPubKey pubkey;
+    pubkey = key.GetPubKey();
+
+    CScript s;
+    txnouttype whichType;
+    std::vector<std::vector<unsigned char> > solutions;
+
+    // TX_PUBKEY with incorrectly sized pubkey
+    s.clear();
+    s << std::vector<unsigned char>(30, 0x01) << OP_CHECKSIG;
+    BOOST_CHECK(!Solver(s, whichType, solutions));
+
+    // TX_PUBKEYHASH with incorrectly sized key hash
+    s.clear();
+    s << OP_DUP << OP_HASH160 << ToByteVector(pubkey) << OP_EQUALVERIFY << OP_CHECKSIG;
+    BOOST_CHECK(!Solver(s, whichType, solutions));
+
+    // TX_SCRIPTHASH with incorrectly sized script hash
+    s.clear();
+    s << OP_HASH160 << std::vector<unsigned char>(21, 0x01) << OP_EQUAL;
+    BOOST_CHECK(!Solver(s, whichType, solutions));
+
+    // TX_MULTISIG 0/2
+    s.clear();
+    s << OP_0 << ToByteVector(pubkey) << OP_1 << OP_CHECKMULTISIG;
+    BOOST_CHECK(!Solver(s, whichType, solutions));
+
+    // TX_MULTISIG 2/1
+    s.clear();
+    s << OP_2 << ToByteVector(pubkey) << OP_1 << OP_CHECKMULTISIG;
+    BOOST_CHECK(!Solver(s, whichType, solutions));
+
+    // TX_MULTISIG n = 2 with 1 pubkey
+    s.clear();
+    s << OP_1 << ToByteVector(pubkey) << OP_2 << OP_CHECKMULTISIG;
+    BOOST_CHECK(!Solver(s, whichType, solutions));
+
+    // TX_MULTISIG n = 1 with 0 pubkeys
+    s.clear();
+    s << OP_1 << OP_1 << OP_CHECKMULTISIG;
+    BOOST_CHECK(!Solver(s, whichType, solutions));
+
+    // TX_NULL_DATA with other opcodes
+    s.clear();
+    s << OP_RETURN << std::vector<unsigned char>({75}) << OP_ADD;
+    BOOST_CHECK(!Solver(s, whichType, solutions));
+
+    // TX_WITNESS with unknown version
+    s.clear();
+    s << OP_1 << ToByteVector(pubkey);
+    BOOST_CHECK(!Solver(s, whichType, solutions));
+
+    // TX_WITNESS with incorrect program size
+    s.clear();
+    s << OP_0 << std::vector<unsigned char>(19, 0x01);
+    BOOST_CHECK(!Solver(s, whichType, solutions));
+}
+
+BOOST_AUTO_TEST_CASE(script_standard_ExtractDestination)
+{
+    CKey key = CKey::TestOnlyRandomKey(true);
+    CPubKey pubkey;
+    pubkey = key.GetPubKey();
+
+    CScript s;
+    CTxDestination address;
+
+    // TX_PUBKEY
+    s.clear();
+    s << ToByteVector(pubkey) << OP_CHECKSIG;
+    BOOST_CHECK(ExtractDestination(s, address));
+    BOOST_CHECK(std::get_if<CKeyID>(&address) &&
+                std::get<CKeyID>(address) == pubkey.GetID());
+
+    // TX_PUBKEYHASH
+    s.clear();
+    s << OP_DUP << OP_HASH160 << ToByteVector(pubkey.GetID()) << OP_EQUALVERIFY << OP_CHECKSIG;
+    BOOST_CHECK(ExtractDestination(s, address));
+    BOOST_CHECK(std::get_if<CKeyID>(&address) &&
+                std::get<CKeyID>(address) == pubkey.GetID());
+
+    // TX_SCRIPTHASH
+    CScript redeemScript(s); // initialize with leftover P2PKH script
+    s.clear();
+    s << OP_HASH160 << ToByteVector(CScriptID(redeemScript)) << OP_EQUAL;
+    BOOST_CHECK(ExtractDestination(s, address));
+    BOOST_CHECK(std::get_if<CScriptID>(&address) &&
+                std::get<CScriptID>(address) == CScriptID(redeemScript));
+
+    // TX_MULTISIG
+    s.clear();
+    s << OP_1 << ToByteVector(pubkey) << OP_1 << OP_CHECKMULTISIG;
+    BOOST_CHECK(!ExtractDestination(s, address));
+
+    // TX_NULL_DATA
+    s.clear();
+    s << OP_RETURN << std::vector<unsigned char>({75});
+    BOOST_CHECK(!ExtractDestination(s, address));
+
+    // TX_WITNESS_V0_KEYHASH
+    s.clear();
+    s << OP_0 << ToByteVector(pubkey);
+    BOOST_CHECK(!ExtractDestination(s, address));
+
+    // TX_WITNESS_V0_SCRIPTHASH
+    s.clear();
+    s << OP_0 << ToByteVector(CScriptID(redeemScript));
+    BOOST_CHECK(!ExtractDestination(s, address));
+}
+
+BOOST_AUTO_TEST_CASE(script_standard_ExtractDestinations)
+{
+    CKey keys[3];
+    CPubKey pubkeys[3];
+    for (int i = 0; i < 3; i++) {
+        keys[i] = CKey::TestOnlyRandomKey(true);
+        pubkeys[i] = keys[i].GetPubKey();
+    }
+
+    CScript s;
+    txnouttype whichType;
+    std::vector<CTxDestination> addresses;
+    int nRequired;
+
+    // TX_PUBKEY
+    s.clear();
+    s << ToByteVector(pubkeys[0]) << OP_CHECKSIG;
+    BOOST_CHECK(ExtractDestinations(s, whichType, addresses, nRequired));
+    BOOST_CHECK_EQUAL(whichType, TX_PUBKEY);
+    BOOST_CHECK_EQUAL(addresses.size(), 1);
+    BOOST_CHECK_EQUAL(nRequired, 1);
+    BOOST_CHECK(std::get_if<CKeyID>(&addresses[0]) &&
+                std::get<CKeyID>(addresses[0]) == pubkeys[0].GetID());
+
+    // TX_PUBKEYHASH
+    s.clear();
+    s << OP_DUP << OP_HASH160 << ToByteVector(pubkeys[0].GetID()) << OP_EQUALVERIFY << OP_CHECKSIG;
+    BOOST_CHECK(ExtractDestinations(s, whichType, addresses, nRequired));
+    BOOST_CHECK_EQUAL(whichType, TX_PUBKEYHASH);
+    BOOST_CHECK_EQUAL(addresses.size(), 1);
+    BOOST_CHECK_EQUAL(nRequired, 1);
+    BOOST_CHECK(std::get_if<CKeyID>(&addresses[0]) &&
+                std::get<CKeyID>(addresses[0]) == pubkeys[0].GetID());
+
+    // TX_SCRIPTHASH
+    CScript redeemScript(s); // initialize with leftover P2PKH script
+    s.clear();
+    s << OP_HASH160 << ToByteVector(CScriptID(redeemScript)) << OP_EQUAL;
+    BOOST_CHECK(ExtractDestinations(s, whichType, addresses, nRequired));
+    BOOST_CHECK_EQUAL(whichType, TX_SCRIPTHASH);
+    BOOST_CHECK_EQUAL(addresses.size(), 1);
+    BOOST_CHECK_EQUAL(nRequired, 1);
+    BOOST_CHECK(std::get_if<CScriptID>(&addresses[0]) &&
+                std::get<CScriptID>(addresses[0]) == CScriptID(redeemScript));
+
+    // TX_MULTISIG
+    s.clear();
+    s << OP_2 <<
+        ToByteVector(pubkeys[0]) <<
+        ToByteVector(pubkeys[1]) <<
+        OP_2 << OP_CHECKMULTISIG;
+    BOOST_CHECK(ExtractDestinations(s, whichType, addresses, nRequired));
+    BOOST_CHECK_EQUAL(whichType, TX_MULTISIG);
+    BOOST_CHECK_EQUAL(addresses.size(), 2);
+    BOOST_CHECK_EQUAL(nRequired, 2);
+    BOOST_CHECK(std::get_if<CKeyID>(&addresses[0]) &&
+                std::get<CKeyID>(addresses[0]) == pubkeys[0].GetID());
+    BOOST_CHECK(std::get_if<CKeyID>(&addresses[1]) &&
+                std::get<CKeyID>(addresses[1]) == pubkeys[1].GetID());
+
+    // TX_NULL_DATA
+    s.clear();
+    s << OP_RETURN << std::vector<unsigned char>({75});
+    BOOST_CHECK(!ExtractDestinations(s, whichType, addresses, nRequired));
+
+    // TX_WITNESS_V0_KEYHASH
+    s.clear();
+    s << OP_0 << ToByteVector(pubkeys[0].GetID());
+    BOOST_CHECK(!ExtractDestinations(s, whichType, addresses, nRequired));
+
+    // TX_WITNESS_V0_SCRIPTHASH
+    s.clear();
+    s << OP_0 << ToByteVector(CScriptID(redeemScript));
+    BOOST_CHECK(!ExtractDestinations(s, whichType, addresses, nRequired));
+}
+
+BOOST_AUTO_TEST_CASE(script_standard_GetScriptFor_)
+{
+    CKey keys[3];
+    CPubKey pubkeys[3];
+    for (int i = 0; i < 3; i++) {
+        keys[i] = CKey::TestOnlyRandomKey(true);
+        pubkeys[i] = keys[i].GetPubKey();
+    }
+
+    CScript expected, result;
+
+    // CKeyID
+    expected.clear();
+    expected << OP_DUP << OP_HASH160 << ToByteVector(pubkeys[0].GetID()) << OP_EQUALVERIFY << OP_CHECKSIG;
+    result = GetScriptForDestination(pubkeys[0].GetID());
+    BOOST_CHECK(result == expected);
+
+    // CScriptID
+    CScript redeemScript(result);
+    expected.clear();
+    expected << OP_HASH160 << ToByteVector(CScriptID(redeemScript)) << OP_EQUAL;
+    result = GetScriptForDestination(CScriptID(redeemScript));
+    BOOST_CHECK(result == expected);
+
+    // CNoDestination
+    expected.clear();
+    result = GetScriptForDestination(CNoDestination());
+    BOOST_CHECK(result == expected);
+
+    // GetScriptForRawPubKey
+    expected.clear();
+    expected << ToByteVector(pubkeys[0]) << OP_CHECKSIG;
+    result = GetScriptForRawPubKey(pubkeys[0]);
+    BOOST_CHECK(result == expected);
+
+    // GetScriptForMultisig
+    expected.clear();
+    expected << OP_2 <<
+        ToByteVector(pubkeys[0]) <<
+        ToByteVector(pubkeys[1]) <<
+        ToByteVector(pubkeys[2]) <<
+        OP_3 << OP_CHECKMULTISIG;
+    result = GetScriptForMultisig(2, std::vector<CPubKey>(pubkeys, pubkeys + 3));
+    BOOST_CHECK(result == expected);
+}
+
+BOOST_AUTO_TEST_CASE(script_standard_IsMine)
+{
+    CKey keys[2];
+    CPubKey pubkeys[2];
+    for (int i = 0; i < 2; i++) {
+        keys[i] = CKey::TestOnlyRandomKey(true);
+        pubkeys[i] = keys[i].GetPubKey();
+    }
+
+    CKey uncompressedKey = CKey::TestOnlyRandomKey(false);
+    CPubKey uncompressedPubkey = uncompressedKey.GetPubKey();
+
+    CScript scriptPubKey;
+    isminetype result;
+
+    // P2PK compressed
+    {
+        CBasicKeyStore keystore;
+        scriptPubKey.clear();
+        scriptPubKey << ToByteVector(pubkeys[0]) << OP_CHECKSIG;
+
+        // Keystore does not have key
+        result = IsMine(keystore, scriptPubKey);
+        BOOST_CHECK_EQUAL(result, ISMINE_NO);
+
+        // Keystore has key
+        keystore.AddKey(keys[0]);
+        result = IsMine(keystore, scriptPubKey);
+        BOOST_CHECK_EQUAL(result, ISMINE_SPENDABLE);
+    }
+
+    // P2PK uncompressed
+    {
+        CBasicKeyStore keystore;
+        scriptPubKey.clear();
+        scriptPubKey << ToByteVector(uncompressedPubkey) << OP_CHECKSIG;
+
+        // Keystore does not have key
+        result = IsMine(keystore, scriptPubKey);
+        BOOST_CHECK_EQUAL(result, ISMINE_NO);
+
+        // Keystore has key
+        keystore.AddKey(uncompressedKey);
+        result = IsMine(keystore, scriptPubKey);
+        BOOST_CHECK_EQUAL(result, ISMINE_SPENDABLE);
+    }
+
+    // P2PKH compressed
+    {
+        CBasicKeyStore keystore;
+        scriptPubKey.clear();
+        scriptPubKey << OP_DUP << OP_HASH160 << ToByteVector(pubkeys[0].GetID()) << OP_EQUALVERIFY << OP_CHECKSIG;
+
+        // Keystore does not have key
+        result = IsMine(keystore, scriptPubKey);
+        BOOST_CHECK_EQUAL(result, ISMINE_NO);
+
+        // Keystore has key
+        keystore.AddKey(keys[0]);
+        result = IsMine(keystore, scriptPubKey);
+        BOOST_CHECK_EQUAL(result, ISMINE_SPENDABLE);
+    }
+
+    // P2PKH uncompressed
+    {
+        CBasicKeyStore keystore;
+        scriptPubKey.clear();
+        scriptPubKey << OP_DUP << OP_HASH160 << ToByteVector(uncompressedPubkey.GetID()) << OP_EQUALVERIFY << OP_CHECKSIG;
+
+        // Keystore does not have key
+        result = IsMine(keystore, scriptPubKey);
+        BOOST_CHECK_EQUAL(result, ISMINE_NO);
+
+        // Keystore has key
+        keystore.AddKey(uncompressedKey);
+        result = IsMine(keystore, scriptPubKey);
+        BOOST_CHECK_EQUAL(result, ISMINE_SPENDABLE);
+    }
+
+    // P2SH
+    {
+        CBasicKeyStore keystore;
+
+        CScript redeemScript;
+        redeemScript << OP_DUP << OP_HASH160 << ToByteVector(pubkeys[0].GetID()) << OP_EQUALVERIFY << OP_CHECKSIG;
+
+        scriptPubKey.clear();
+        scriptPubKey << OP_HASH160 << ToByteVector(CScriptID(redeemScript)) << OP_EQUAL;
+
+        // Keystore does not have redeemScript or key
+        result = IsMine(keystore, scriptPubKey);
+        BOOST_CHECK_EQUAL(result, ISMINE_NO);
+
+        // Keystore has redeemScript but no key
+        keystore.AddCScript(redeemScript);
+        result = IsMine(keystore, scriptPubKey);
+        BOOST_CHECK_EQUAL(result, ISMINE_NO);
+
+        // Keystore has redeemScript and key
+        keystore.AddKey(keys[0]);
+        result = IsMine(keystore, scriptPubKey);
+        BOOST_CHECK_EQUAL(result, ISMINE_SPENDABLE);
+    }
+
+    // scriptPubKey multisig
+    {
+        CBasicKeyStore keystore;
+
+        scriptPubKey.clear();
+        scriptPubKey << OP_2 <<
+            ToByteVector(uncompressedPubkey) <<
+            ToByteVector(pubkeys[1]) <<
+            OP_2 << OP_CHECKMULTISIG;
+
+        // Keystore does not have any keys
+        result = IsMine(keystore, scriptPubKey);
+        BOOST_CHECK_EQUAL(result, ISMINE_NO);
+
+        // Keystore has 1/2 keys
+        keystore.AddKey(uncompressedKey);
+
+        result = IsMine(keystore, scriptPubKey);
+        BOOST_CHECK_EQUAL(result, ISMINE_NO);
+
+        // Keystore has 2/2 keys
+        keystore.AddKey(keys[1]);
+
+        result = IsMine(keystore, scriptPubKey);
+        BOOST_CHECK_EQUAL(result, ISMINE_NO);
+
+        // Keystore has 2/2 keys and the script
+        keystore.AddCScript(scriptPubKey);
+
+        result = IsMine(keystore, scriptPubKey);
+        BOOST_CHECK_EQUAL(result, ISMINE_NO);
+    }
+
+    // P2SH multisig
+    {
+        CBasicKeyStore keystore;
+        keystore.AddKey(uncompressedKey);
+        keystore.AddKey(keys[1]);
+
+        CScript redeemScript;
+        redeemScript << OP_2 <<
+            ToByteVector(uncompressedPubkey) <<
+            ToByteVector(pubkeys[1]) <<
+            OP_2 << OP_CHECKMULTISIG;
+
+        scriptPubKey.clear();
+        scriptPubKey << OP_HASH160 << ToByteVector(CScriptID(redeemScript)) << OP_EQUAL;
+
+        // Keystore has no redeemScript
+        result = IsMine(keystore, scriptPubKey);
+        BOOST_CHECK_EQUAL(result, ISMINE_NO);
+
+        // Keystore has redeemScript
+        keystore.AddCScript(redeemScript);
+        result = IsMine(keystore, scriptPubKey);
+        BOOST_CHECK_EQUAL(result, ISMINE_SPENDABLE);
+    }
+
+    // OP_RETURN
+    {
+        CBasicKeyStore keystore;
+        keystore.AddKey(keys[0]);
+
+        scriptPubKey.clear();
+        scriptPubKey << OP_RETURN << ToByteVector(pubkeys[0]);
+
+        result = IsMine(keystore, scriptPubKey);
+        BOOST_CHECK_EQUAL(result, ISMINE_NO);
+    }
+
+    // Nonstandard
+    {
+        CBasicKeyStore keystore;
+        keystore.AddKey(keys[0]);
+
+        scriptPubKey.clear();
+        scriptPubKey << OP_9 << OP_ADD << OP_11 << OP_EQUAL;
+
+        result = IsMine(keystore, scriptPubKey);
+        BOOST_CHECK_EQUAL(result, ISMINE_NO);
+    }
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/script_tests.cpp b/depend/zcash/src/test/script_tests.cpp
new file mode 100644
index 000000000..333196de2
--- /dev/null
+++ b/depend/zcash/src/test/script_tests.cpp
@@ -0,0 +1,983 @@
+// Copyright (c) 2011-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "test/data/script_invalid.json.h"
+#include "test/data/script_valid.json.h"
+
+#include "consensus/upgrades.h"
+#include "core_io.h"
+#include "key.h"
+#include "keystore.h"
+#include "main.h"
+#include "script/script.h"
+#include "script/script_error.h"
+#include "script/sign.h"
+#include "util.h"
+#include "test/test_bitcoin.h"
+#include "test/test_util.h"
+
+#if defined(HAVE_SCRIPT_LIB)
+#include "script/zcash_script.h"
+#endif
+
+#include <fstream>
+#include <stdint.h>
+#include <string>
+#include <vector>
+
+#include <boost/test/unit_test.hpp>
+#include <boost/test/data/test_case.hpp>
+
+#include <univalue.h>
+
+using namespace std;
+
+// Uncomment if you want to output updated JSON tests.
+// #define UPDATE_JSON_TESTS
+
+static const unsigned int flags = SCRIPT_VERIFY_P2SH | SCRIPT_VERIFY_STRICTENC;
+
+BOOST_FIXTURE_TEST_SUITE(script_tests, BasicTestingSetup)
+
+CMutableTransaction BuildCreditingTransaction(const CScript& scriptPubKey)
+{
+    CMutableTransaction txCredit;
+    txCredit.nVersion = 1;
+    txCredit.nLockTime = 0;
+    txCredit.vin.resize(1);
+    txCredit.vout.resize(1);
+    txCredit.vin[0].prevout.SetNull();
+    txCredit.vin[0].scriptSig = CScript() << CScriptNum(0) << CScriptNum(0);
+    txCredit.vin[0].nSequence = std::numeric_limits<unsigned int>::max();
+    txCredit.vout[0].scriptPubKey = scriptPubKey;
+    txCredit.vout[0].nValue = 0;
+
+    return txCredit;
+}
+
+CMutableTransaction BuildSpendingTransaction(const CScript& scriptSig, const CMutableTransaction& txCredit)
+{
+    CMutableTransaction txSpend;
+    txSpend.nVersion = 1;
+    txSpend.nLockTime = 0;
+    txSpend.vin.resize(1);
+    txSpend.vout.resize(1);
+    txSpend.vin[0].prevout.hash = txCredit.GetHash();
+    txSpend.vin[0].prevout.n = 0;
+    txSpend.vin[0].scriptSig = scriptSig;
+    txSpend.vin[0].nSequence = std::numeric_limits<unsigned int>::max();
+    txSpend.vout[0].scriptPubKey = CScript();
+    txSpend.vout[0].nValue = 0;
+
+    return txSpend;
+}
+
+void DoTest(const CScript& scriptPubKey, const CScript& scriptSig, int flags, uint32_t consensusBranchId, bool expect, const std::string& message)
+{
+    ScriptError err;
+    CMutableTransaction txCredit = BuildCreditingTransaction(scriptPubKey);
+    CMutableTransaction tx = BuildSpendingTransaction(scriptSig, txCredit);
+    const PrecomputedTransactionData txdata(tx, txCredit.vout);
+    CMutableTransaction tx2 = tx;
+    BOOST_CHECK_MESSAGE(VerifyScript(scriptSig, scriptPubKey, flags, MutableTransactionSignatureChecker(&tx, txdata, 0, txCredit.vout[0].nValue), consensusBranchId, &err) == expect, message);
+    BOOST_CHECK_MESSAGE(expect == (err == SCRIPT_ERR_OK), std::string(ScriptErrorString(err)) + ": " + message);
+#if defined(HAVE_SCRIPT_LIB)
+    CDataStream stream(SER_NETWORK, PROTOCOL_VERSION);
+    stream << tx2;
+    BOOST_CHECK_MESSAGE(zcash_script_verify(
+        begin_ptr(scriptPubKey), scriptPubKey.size(),
+        txCredit.vout[0].nValue,
+        (const unsigned char*)&stream[0], stream.size(),
+        0, flags,
+        consensusBranchId,
+        NULL) == expect,message);
+#endif
+}
+
+void static NegateSignatureS(std::vector<unsigned char>& vchSig) {
+    // Parse the signature.
+    std::vector<unsigned char> r, s;
+    r = std::vector<unsigned char>(vchSig.begin() + 4, vchSig.begin() + 4 + vchSig[3]);
+    s = std::vector<unsigned char>(vchSig.begin() + 6 + vchSig[3], vchSig.begin() + 6 + vchSig[3] + vchSig[5 + vchSig[3]]);
+
+    // Really ugly to implement mod-n negation here, but it would be feature creep to expose such functionality from libsecp256k1.
+    static const unsigned char order[33] = {
+        0x00,
+        0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF,
+        0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFE,
+        0xBA, 0xAE, 0xDC, 0xE6, 0xAF, 0x48, 0xA0, 0x3B,
+        0xBF, 0xD2, 0x5E, 0x8C, 0xD0, 0x36, 0x41, 0x41
+    };
+    while (s.size() < 33) {
+        s.insert(s.begin(), 0x00);
+    }
+    int carry = 0;
+    for (int p = 32; p >= 1; p--) {
+        int n = (int)order[p] - s[p] - carry;
+        s[p] = (n + 256) & 0xFF;
+        carry = (n < 0);
+    }
+    assert(carry == 0);
+    if (s.size() > 1 && s[0] == 0 && s[1] < 0x80) {
+        s.erase(s.begin());
+    }
+
+    // Reconstruct the signature.
+    vchSig.clear();
+    vchSig.push_back(0x30);
+    vchSig.push_back(4 + r.size() + s.size());
+    vchSig.push_back(0x02);
+    vchSig.push_back(r.size());
+    vchSig.insert(vchSig.end(), r.begin(), r.end());
+    vchSig.push_back(0x02);
+    vchSig.push_back(s.size());
+    vchSig.insert(vchSig.end(), s.begin(), s.end());
+}
+
+namespace
+{
+const unsigned char vchKey0[32] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1};
+const unsigned char vchKey1[32] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0};
+const unsigned char vchKey2[32] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0};
+
+struct KeyData
+{
+    CKey key0, key0C, key1, key1C, key2, key2C;
+    CPubKey pubkey0, pubkey0C, pubkey0H;
+    CPubKey pubkey1, pubkey1C;
+    CPubKey pubkey2, pubkey2C;
+
+    KeyData()
+    {
+
+        key0.Set(vchKey0, vchKey0 + 32, false);
+        key0C.Set(vchKey0, vchKey0 + 32, true);
+        pubkey0 = key0.GetPubKey();
+        pubkey0H = key0.GetPubKey();
+        pubkey0C = key0C.GetPubKey();
+        *const_cast<unsigned char*>(&pubkey0H[0]) = 0x06 | (pubkey0H[64] & 1);
+
+        key1.Set(vchKey1, vchKey1 + 32, false);
+        key1C.Set(vchKey1, vchKey1 + 32, true);
+        pubkey1 = key1.GetPubKey();
+        pubkey1C = key1C.GetPubKey();
+
+        key2.Set(vchKey2, vchKey2 + 32, false);
+        key2C.Set(vchKey2, vchKey2 + 32, true);
+        pubkey2 = key2.GetPubKey();
+        pubkey2C = key2C.GetPubKey();
+    }
+};
+
+
+class TestBuilder
+{
+private:
+    CScript scriptPubKey;
+    CTransaction creditTx;
+    CMutableTransaction spendTx;
+    bool havePush;
+    std::vector<unsigned char> push;
+    std::string comment;
+    int flags;
+    uint32_t consensusBranchId;
+
+    void DoPush()
+    {
+        if (havePush) {
+            spendTx.vin[0].scriptSig << push;
+            havePush = false;
+        }
+    }
+
+    void DoPush(const std::vector<unsigned char>& data)
+    {
+         DoPush();
+         push = data;
+         havePush = true;
+    }
+
+public:
+    TestBuilder(const CScript& redeemScript, const std::string& comment_, int flags_, bool P2SH = false) : scriptPubKey(redeemScript), havePush(false), comment(comment_), flags(flags_), consensusBranchId(0)
+    {
+        if (P2SH) {
+            creditTx = BuildCreditingTransaction(CScript() << OP_HASH160 << ToByteVector(CScriptID(redeemScript)) << OP_EQUAL);
+        } else {
+            creditTx = BuildCreditingTransaction(redeemScript);
+        }
+        spendTx = BuildSpendingTransaction(CScript(), creditTx);
+    }
+
+    TestBuilder& Add(const CScript& _script)
+    {
+        DoPush();
+        spendTx.vin[0].scriptSig += _script;
+        return *this;
+    }
+
+    TestBuilder& Num(int num)
+    {
+        DoPush();
+        spendTx.vin[0].scriptSig << num;
+        return *this;
+    }
+
+    TestBuilder& Push(const std::string& hex)
+    {
+        DoPush(ParseHex(hex));
+        return *this;
+    }
+
+    TestBuilder& PushSig(const CKey& key, int nHashType = SIGHASH_ALL, unsigned int lenR = 32, unsigned int lenS = 32)
+    {
+        const PrecomputedTransactionData txdata(spendTx, creditTx.vout);
+        uint256 hash = SignatureHash(scriptPubKey, spendTx, 0, nHashType, 0, consensusBranchId, txdata);
+        std::vector<unsigned char> vchSig, r, s;
+        uint32_t iter = 0;
+        do {
+            key.Sign(hash, vchSig, iter++);
+            if ((lenS == 33) != (vchSig[5 + vchSig[3]] == 33)) {
+                NegateSignatureS(vchSig);
+            }
+            r = std::vector<unsigned char>(vchSig.begin() + 4, vchSig.begin() + 4 + vchSig[3]);
+            s = std::vector<unsigned char>(vchSig.begin() + 6 + vchSig[3], vchSig.begin() + 6 + vchSig[3] + vchSig[5 + vchSig[3]]);
+        } while (lenR != r.size() || lenS != s.size());
+        vchSig.push_back(static_cast<unsigned char>(nHashType));
+        DoPush(vchSig);
+        return *this;
+    }
+
+    TestBuilder& Push(const CPubKey& pubkey)
+    {
+        DoPush(std::vector<unsigned char>(pubkey.begin(), pubkey.end()));
+        return *this;
+    }
+
+    TestBuilder& PushRedeem()
+    {
+        DoPush(std::vector<unsigned char>(scriptPubKey.begin(), scriptPubKey.end()));
+        return *this;
+    }
+
+    TestBuilder& EditPush(unsigned int pos, const std::string& hexin, const std::string& hexout)
+    {
+        assert(havePush);
+        std::vector<unsigned char> datain = ParseHex(hexin);
+        std::vector<unsigned char> dataout = ParseHex(hexout);
+        assert(pos + datain.size() <= push.size());
+        BOOST_CHECK_MESSAGE(std::vector<unsigned char>(push.begin() + pos, push.begin() + pos + datain.size()) == datain, comment);
+        push.erase(push.begin() + pos, push.begin() + pos + datain.size());
+        push.insert(push.begin() + pos, dataout.begin(), dataout.end());
+        return *this;
+    }
+
+    TestBuilder& DamagePush(unsigned int pos)
+    {
+        assert(havePush);
+        assert(pos < push.size());
+        push[pos] ^= 1;
+        return *this;
+    }
+
+    TestBuilder& Test(bool expect)
+    {
+        TestBuilder copy = *this; // Make a copy so we can rollback the push.
+        DoPush();
+        DoTest(creditTx.vout[0].scriptPubKey, spendTx.vin[0].scriptSig, flags, consensusBranchId, expect, comment);
+        *this = copy;
+        return *this;
+    }
+
+    UniValue GetJSON()
+    {
+        DoPush();
+        UniValue array(UniValue::VARR);
+        array.push_back(FormatScript(spendTx.vin[0].scriptSig));
+        array.push_back(FormatScript(creditTx.vout[0].scriptPubKey));
+        array.push_back(FormatScriptFlags(flags));
+        array.push_back(comment);
+        return array;
+    }
+
+    std::string GetComment()
+    {
+        return comment;
+    }
+
+    const CScript& GetScriptPubKey()
+    {
+        return creditTx.vout[0].scriptPubKey;
+    }
+};
+}
+
+BOOST_AUTO_TEST_CASE(script_build)
+{
+    const KeyData keys;
+
+    std::vector<TestBuilder> good;
+    std::vector<TestBuilder> bad;
+
+    good.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey0) << OP_CHECKSIG,
+                               "P2PK", 0
+                              ).PushSig(keys.key0));
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey0) << OP_CHECKSIG,
+                              "P2PK, bad sig", 0
+                             ).PushSig(keys.key0).DamagePush(10));
+
+    good.push_back(TestBuilder(CScript() << OP_DUP << OP_HASH160 << ToByteVector(keys.pubkey1C.GetID()) << OP_EQUALVERIFY << OP_CHECKSIG,
+                               "P2PKH", 0
+                              ).PushSig(keys.key1).Push(keys.pubkey1C));
+    bad.push_back(TestBuilder(CScript() << OP_DUP << OP_HASH160 << ToByteVector(keys.pubkey2C.GetID()) << OP_EQUALVERIFY << OP_CHECKSIG,
+                              "P2PKH, bad pubkey", 0
+                             ).PushSig(keys.key2).Push(keys.pubkey2C).DamagePush(5));
+
+    good.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey1) << OP_CHECKSIG,
+                               "P2PK anyonecanpay", 0
+                              ).PushSig(keys.key1, SIGHASH_ALL | SIGHASH_ANYONECANPAY));
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey1) << OP_CHECKSIG,
+                              "P2PK anyonecanpay marked with normal hashtype", 0
+                             ).PushSig(keys.key1, SIGHASH_ALL | SIGHASH_ANYONECANPAY).EditPush(70, "81", "01"));
+
+    good.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey0C) << OP_CHECKSIG,
+                               "P2SH(P2PK)", SCRIPT_VERIFY_P2SH, true
+                              ).PushSig(keys.key0).PushRedeem());
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey0C) << OP_CHECKSIG,
+                              "P2SH(P2PK), bad redeemscript", SCRIPT_VERIFY_P2SH, true
+                             ).PushSig(keys.key0).PushRedeem().DamagePush(10));
+
+    good.push_back(TestBuilder(CScript() << OP_DUP << OP_HASH160 << ToByteVector(keys.pubkey1.GetID()) << OP_EQUALVERIFY << OP_CHECKSIG,
+                               "P2SH(P2PKH), bad sig but no VERIFY_P2SH", 0, true
+                              ).PushSig(keys.key0).DamagePush(10).PushRedeem());
+    bad.push_back(TestBuilder(CScript() << OP_DUP << OP_HASH160 << ToByteVector(keys.pubkey1.GetID()) << OP_EQUALVERIFY << OP_CHECKSIG,
+                              "P2SH(P2PKH), bad sig", SCRIPT_VERIFY_P2SH, true
+                             ).PushSig(keys.key0).DamagePush(10).PushRedeem());
+
+    good.push_back(TestBuilder(CScript() << OP_3 << ToByteVector(keys.pubkey0C) << ToByteVector(keys.pubkey1C) << ToByteVector(keys.pubkey2C) << OP_3 << OP_CHECKMULTISIG,
+                               "3-of-3", 0
+                              ).Num(0).PushSig(keys.key0).PushSig(keys.key1).PushSig(keys.key2));
+    bad.push_back(TestBuilder(CScript() << OP_3 << ToByteVector(keys.pubkey0C) << ToByteVector(keys.pubkey1C) << ToByteVector(keys.pubkey2C) << OP_3 << OP_CHECKMULTISIG,
+                              "3-of-3, 2 sigs", 0
+                             ).Num(0).PushSig(keys.key0).PushSig(keys.key1).Num(0));
+
+    good.push_back(TestBuilder(CScript() << OP_2 << ToByteVector(keys.pubkey0C) << ToByteVector(keys.pubkey1C) << ToByteVector(keys.pubkey2C) << OP_3 << OP_CHECKMULTISIG,
+                               "P2SH(2-of-3)", SCRIPT_VERIFY_P2SH, true
+                              ).Num(0).PushSig(keys.key1).PushSig(keys.key2).PushRedeem());
+    bad.push_back(TestBuilder(CScript() << OP_2 << ToByteVector(keys.pubkey0C) << ToByteVector(keys.pubkey1C) << ToByteVector(keys.pubkey2C) << OP_3 << OP_CHECKMULTISIG,
+                              "P2SH(2-of-3), 1 sig", SCRIPT_VERIFY_P2SH, true
+                             ).Num(0).PushSig(keys.key1).Num(0).PushRedeem());
+
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey1C) << OP_CHECKSIG,
+                              "P2PK with too much R padding", 0
+                             ).PushSig(keys.key1, SIGHASH_ALL, 31, 32).EditPush(1, "43021F", "44022000"));
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey1C) << OP_CHECKSIG,
+                              "P2PK with too much S padding", 0
+                             ).PushSig(keys.key1, SIGHASH_ALL).EditPush(1, "44", "45").EditPush(37, "20", "2100"));
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey1C) << OP_CHECKSIG,
+                              "P2PK with too little R padding", 0
+                             ).PushSig(keys.key1, SIGHASH_ALL, 33, 32).EditPush(1, "45022100", "440220"));
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey2C) << OP_CHECKSIG << OP_NOT,
+                              "P2PK NOT with bad sig with too much R padding", 0
+                             ).PushSig(keys.key2, SIGHASH_ALL, 31, 32).EditPush(1, "43021F", "44022000").DamagePush(10));
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey2C) << OP_CHECKSIG << OP_NOT,
+                              "P2PK NOT with too much R padding", 0
+                             ).PushSig(keys.key2, SIGHASH_ALL, 31, 32).EditPush(1, "43021F", "44022000"));
+
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey1C) << OP_CHECKSIG,
+                              "BIP66 example 1", 0
+                             ).PushSig(keys.key1, SIGHASH_ALL, 33, 32).EditPush(1, "45022100", "440220"));
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey1C) << OP_CHECKSIG << OP_NOT,
+                              "BIP66 example 2", 0
+                             ).PushSig(keys.key1, SIGHASH_ALL, 33, 32).EditPush(1, "45022100", "440220"));
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey1C) << OP_CHECKSIG,
+                              "BIP66 example 3", 0
+                             ).Num(0));
+    good.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey1C) << OP_CHECKSIG << OP_NOT,
+                               "BIP66 example 4", 0
+                              ).Num(0));
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey1C) << OP_CHECKSIG,
+                              "BIP66 example 5", 0
+                             ).Num(1));
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey1C) << OP_CHECKSIG << OP_NOT,
+                              "BIP66 example 6", 0
+                             ).Num(1));
+    bad.push_back(TestBuilder(CScript() << OP_2 << ToByteVector(keys.pubkey1C) << ToByteVector(keys.pubkey2C) << OP_2 << OP_CHECKMULTISIG,
+                              "BIP66 example 7", 0
+                             ).Num(0).PushSig(keys.key1, SIGHASH_ALL, 33, 32).EditPush(1, "45022100", "440220").PushSig(keys.key2));
+    bad.push_back(TestBuilder(CScript() << OP_2 << ToByteVector(keys.pubkey1C) << ToByteVector(keys.pubkey2C) << OP_2 << OP_CHECKMULTISIG << OP_NOT,
+                              "BIP66 example 8", 0
+                             ).Num(0).PushSig(keys.key1, SIGHASH_ALL, 33, 32).EditPush(1, "45022100", "440220").PushSig(keys.key2));
+    bad.push_back(TestBuilder(CScript() << OP_2 << ToByteVector(keys.pubkey1C) << ToByteVector(keys.pubkey2C) << OP_2 << OP_CHECKMULTISIG,
+                              "BIP66 example 9", 0
+                             ).Num(0).Num(0).PushSig(keys.key2, SIGHASH_ALL, 33, 32).EditPush(1, "45022100", "440220"));
+    bad.push_back(TestBuilder(CScript() << OP_2 << ToByteVector(keys.pubkey1C) << ToByteVector(keys.pubkey2C) << OP_2 << OP_CHECKMULTISIG << OP_NOT,
+                              "BIP66 example 10", 0
+                             ).Num(0).Num(0).PushSig(keys.key2, SIGHASH_ALL, 33, 32).EditPush(1, "45022100", "440220"));
+    bad.push_back(TestBuilder(CScript() << OP_2 << ToByteVector(keys.pubkey1C) << ToByteVector(keys.pubkey2C) << OP_2 << OP_CHECKMULTISIG,
+                              "BIP66 example 11", 0
+                             ).Num(0).PushSig(keys.key1, SIGHASH_ALL, 33, 32).EditPush(1, "45022100", "440220").Num(0));
+    good.push_back(TestBuilder(CScript() << OP_2 << ToByteVector(keys.pubkey1C) << ToByteVector(keys.pubkey2C) << OP_2 << OP_CHECKMULTISIG << OP_NOT,
+                               "BIP66 example 12", 0
+                              ).Num(0).PushSig(keys.key1, SIGHASH_ALL, 33, 32).EditPush(1, "45022100", "440220").Num(0));
+
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey2C) << OP_CHECKSIG,
+                               "P2PK with multi-byte hashtype", 0
+                              ).PushSig(keys.key2, SIGHASH_ALL).EditPush(70, "01", "0101"));
+
+    good.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey2C) << OP_CHECKSIG,
+                               "P2PK with high S but no LOW_S", 0
+                              ).PushSig(keys.key2, SIGHASH_ALL, 32, 33));
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey2C) << OP_CHECKSIG,
+                              "P2PK with high S", SCRIPT_VERIFY_LOW_S
+                             ).PushSig(keys.key2, SIGHASH_ALL, 32, 33));
+
+    good.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey0H) << OP_CHECKSIG,
+                               "P2PK with hybrid pubkey but no STRICTENC", 0
+                              ).PushSig(keys.key0, SIGHASH_ALL));
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey0H) << OP_CHECKSIG,
+                              "P2PK with hybrid pubkey", SCRIPT_VERIFY_STRICTENC
+                             ).PushSig(keys.key0, SIGHASH_ALL));
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey0H) << OP_CHECKSIG << OP_NOT,
+                              "P2PK NOT with hybrid pubkey but no STRICTENC", 0
+                             ).PushSig(keys.key0, SIGHASH_ALL));
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey0H) << OP_CHECKSIG << OP_NOT,
+                              "P2PK NOT with hybrid pubkey", SCRIPT_VERIFY_STRICTENC
+                             ).PushSig(keys.key0, SIGHASH_ALL));
+    good.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey0H) << OP_CHECKSIG << OP_NOT,
+                               "P2PK NOT with invalid hybrid pubkey but no STRICTENC", 0
+                              ).PushSig(keys.key0, SIGHASH_ALL).DamagePush(10));
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey0H) << OP_CHECKSIG << OP_NOT,
+                              "P2PK NOT with invalid hybrid pubkey", SCRIPT_VERIFY_STRICTENC
+                             ).PushSig(keys.key0, SIGHASH_ALL).DamagePush(10));
+    good.push_back(TestBuilder(CScript() << OP_1 << ToByteVector(keys.pubkey0H) << ToByteVector(keys.pubkey1C) << OP_2 << OP_CHECKMULTISIG,
+                               "1-of-2 with the second 1 hybrid pubkey and no STRICTENC", 0
+                              ).Num(0).PushSig(keys.key1, SIGHASH_ALL));
+    good.push_back(TestBuilder(CScript() << OP_1 << ToByteVector(keys.pubkey0H) << ToByteVector(keys.pubkey1C) << OP_2 << OP_CHECKMULTISIG,
+                               "1-of-2 with the second 1 hybrid pubkey", SCRIPT_VERIFY_STRICTENC
+                              ).Num(0).PushSig(keys.key1, SIGHASH_ALL));
+    bad.push_back(TestBuilder(CScript() << OP_1 << ToByteVector(keys.pubkey1C) << ToByteVector(keys.pubkey0H) << OP_2 << OP_CHECKMULTISIG,
+                              "1-of-2 with the first 1 hybrid pubkey", SCRIPT_VERIFY_STRICTENC
+                             ).Num(0).PushSig(keys.key1, SIGHASH_ALL));
+
+    good.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey1) << OP_CHECKSIG,
+                               "P2PK with undefined hashtype but no STRICTENC", 0
+                              ).PushSig(keys.key1, 5));
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey1) << OP_CHECKSIG,
+                              "P2PK with undefined hashtype", SCRIPT_VERIFY_STRICTENC
+                             ).PushSig(keys.key1, 5));
+    good.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey1) << OP_CHECKSIG << OP_NOT,
+                               "P2PK NOT with invalid sig and undefined hashtype but no STRICTENC", 0
+                              ).PushSig(keys.key1, 5).DamagePush(10));
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey1) << OP_CHECKSIG << OP_NOT,
+                              "P2PK NOT with invalid sig and undefined hashtype", SCRIPT_VERIFY_STRICTENC
+                             ).PushSig(keys.key1, 5).DamagePush(10));
+
+    good.push_back(TestBuilder(CScript() << OP_3 << ToByteVector(keys.pubkey0C) << ToByteVector(keys.pubkey1C) << ToByteVector(keys.pubkey2C) << OP_3 << OP_CHECKMULTISIG,
+                               "3-of-3 with nonzero dummy but no NULLDUMMY", 0
+                              ).Num(1).PushSig(keys.key0).PushSig(keys.key1).PushSig(keys.key2));
+    bad.push_back(TestBuilder(CScript() << OP_3 << ToByteVector(keys.pubkey0C) << ToByteVector(keys.pubkey1C) << ToByteVector(keys.pubkey2C) << OP_3 << OP_CHECKMULTISIG,
+                              "3-of-3 with nonzero dummy", SCRIPT_VERIFY_NULLDUMMY
+                             ).Num(1).PushSig(keys.key0).PushSig(keys.key1).PushSig(keys.key2));
+    good.push_back(TestBuilder(CScript() << OP_3 << ToByteVector(keys.pubkey0C) << ToByteVector(keys.pubkey1C) << ToByteVector(keys.pubkey2C) << OP_3 << OP_CHECKMULTISIG << OP_NOT,
+                               "3-of-3 NOT with invalid sig and nonzero dummy but no NULLDUMMY", 0
+                              ).Num(1).PushSig(keys.key0).PushSig(keys.key1).PushSig(keys.key2).DamagePush(10));
+    bad.push_back(TestBuilder(CScript() << OP_3 << ToByteVector(keys.pubkey0C) << ToByteVector(keys.pubkey1C) << ToByteVector(keys.pubkey2C) << OP_3 << OP_CHECKMULTISIG << OP_NOT,
+                              "3-of-3 NOT with invalid sig with nonzero dummy", SCRIPT_VERIFY_NULLDUMMY
+                             ).Num(1).PushSig(keys.key0).PushSig(keys.key1).PushSig(keys.key2).DamagePush(10));
+
+    good.push_back(TestBuilder(CScript() << OP_2 << ToByteVector(keys.pubkey1C) << ToByteVector(keys.pubkey1C) << OP_2 << OP_CHECKMULTISIG,
+                               "2-of-2 with two identical keys and sigs pushed using OP_DUP but no SIGPUSHONLY", 0
+                              ).Num(0).PushSig(keys.key1).Add(CScript() << OP_DUP));
+    bad.push_back(TestBuilder(CScript() << OP_2 << ToByteVector(keys.pubkey1C) << ToByteVector(keys.pubkey1C) << OP_2 << OP_CHECKMULTISIG,
+                              "2-of-2 with two identical keys and sigs pushed using OP_DUP", SCRIPT_VERIFY_SIGPUSHONLY
+                             ).Num(0).PushSig(keys.key1).Add(CScript() << OP_DUP));
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey2C) << OP_CHECKSIG,
+                              "P2SH(P2PK) with non-push scriptSig but no SIGPUSHONLY", 0
+                             ).PushSig(keys.key2).PushRedeem());
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey2C) << OP_CHECKSIG,
+                              "P2SH(P2PK) with non-push scriptSig", SCRIPT_VERIFY_SIGPUSHONLY
+                             ).PushSig(keys.key2).PushRedeem());
+    good.push_back(TestBuilder(CScript() << OP_2 << ToByteVector(keys.pubkey1C) << ToByteVector(keys.pubkey1C) << OP_2 << OP_CHECKMULTISIG,
+                               "2-of-2 with two identical keys and sigs pushed", SCRIPT_VERIFY_SIGPUSHONLY
+                              ).Num(0).PushSig(keys.key1).PushSig(keys.key1));
+
+    good.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey0) << OP_CHECKSIG,
+                               "P2PK with unnecessary input but no CLEANSTACK", SCRIPT_VERIFY_P2SH
+                              ).Num(11).PushSig(keys.key0));
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey0) << OP_CHECKSIG,
+                              "P2PK with unnecessary input", SCRIPT_VERIFY_CLEANSTACK | SCRIPT_VERIFY_P2SH
+                             ).Num(11).PushSig(keys.key0));
+    good.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey0) << OP_CHECKSIG,
+                               "P2SH with unnecessary input but no CLEANSTACK", SCRIPT_VERIFY_P2SH, true
+                              ).Num(11).PushSig(keys.key0).PushRedeem());
+    bad.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey0) << OP_CHECKSIG,
+                              "P2SH with unnecessary input", SCRIPT_VERIFY_CLEANSTACK | SCRIPT_VERIFY_P2SH, true
+                             ).Num(11).PushSig(keys.key0).PushRedeem());
+    good.push_back(TestBuilder(CScript() << ToByteVector(keys.pubkey0) << OP_CHECKSIG,
+                               "P2SH with CLEANSTACK", SCRIPT_VERIFY_CLEANSTACK | SCRIPT_VERIFY_P2SH, true
+                              ).PushSig(keys.key0).PushRedeem());
+
+
+    std::set<std::string> tests_good;
+    std::set<std::string> tests_bad;
+
+    {
+        UniValue json_good = read_json(std::string(json_tests::script_valid, json_tests::script_valid + sizeof(json_tests::script_valid)));
+        UniValue json_bad = read_json(std::string(json_tests::script_invalid, json_tests::script_invalid + sizeof(json_tests::script_invalid)));
+
+        for (size_t idx = 0; idx < json_good.size(); idx++) {
+            const UniValue& tv = json_good[idx];
+            tests_good.insert(tv.get_array().write());
+        }
+        for (size_t idx = 0; idx < json_bad.size(); idx++) {
+            const UniValue& tv = json_bad[idx];
+            tests_bad.insert(tv.get_array().write());
+        }
+    }
+
+    std::string strGood;
+    std::string strBad;
+
+    for (TestBuilder& test : good) {
+        test.Test(true);
+        std::string str = test.GetJSON().write();
+#ifndef UPDATE_JSON_TESTS
+        if (tests_good.count(str) == 0) {
+            BOOST_CHECK_MESSAGE(false, "Missing auto script_valid test: " + test.GetComment());
+        }
+#endif
+        strGood += str + ",\n";
+    }
+    for (TestBuilder& test : bad) {
+        test.Test(false);
+        std::string str = test.GetJSON().write();
+#ifndef UPDATE_JSON_TESTS
+        if (tests_bad.count(str) == 0) {
+            BOOST_CHECK_MESSAGE(false, "Missing auto script_invalid test: " + test.GetComment());
+        }
+#endif
+        strBad += str + ",\n";
+    }
+
+#ifdef UPDATE_JSON_TESTS
+    FILE* valid = fopen("script_valid.json.gen", "w");
+    fputs(strGood.c_str(), valid);
+    fclose(valid);
+    FILE* invalid = fopen("script_invalid.json.gen", "w");
+    fputs(strBad.c_str(), invalid);
+    fclose(invalid);
+#endif
+}
+
+// Parameterized testing over consensus branch ids
+// Note: In the future, we could have different test data files based on epoch.
+BOOST_DATA_TEST_CASE(script_valid, boost::unit_test::data::xrange(static_cast<int>(Consensus::MAX_NETWORK_UPGRADES)))
+{
+    uint32_t consensusBranchId = NetworkUpgradeInfo[sample].nBranchId;
+
+    // Read tests from test/data/script_valid.json
+    // Format is an array of arrays
+    // Inner arrays are [ "scriptSig", "scriptPubKey", "flags" ]
+    // ... where scriptSig and scriptPubKey are stringified
+    // scripts.
+    UniValue tests = read_json(std::string(json_tests::script_valid, json_tests::script_valid + sizeof(json_tests::script_valid)));
+
+    for (size_t idx = 0; idx < tests.size(); idx++) {
+        UniValue test = tests[idx];
+        string strTest = test.write();
+        if (test.size() < 3) // Allow size > 3; extra stuff ignored (useful for comments)
+        {
+            if (test.size() != 1) {
+                BOOST_ERROR("Bad test: " << strTest);
+            }
+            continue;
+        }
+        string scriptSigString = test[0].get_str();
+        CScript scriptSig = ParseScript(scriptSigString);
+        string scriptPubKeyString = test[1].get_str();
+        CScript scriptPubKey = ParseScript(scriptPubKeyString);
+        unsigned int scriptflags = ParseScriptFlags(test[2].get_str());
+
+        DoTest(scriptPubKey, scriptSig, scriptflags, consensusBranchId, true, strTest);
+    }
+}
+
+// Parameterized testing over consensus branch ids
+// Note: In the future, we could have different test data files based on epoch.
+BOOST_DATA_TEST_CASE(script_invalid, boost::unit_test::data::xrange(static_cast<int>(Consensus::MAX_NETWORK_UPGRADES)))
+{
+    uint32_t consensusBranchId = NetworkUpgradeInfo[sample].nBranchId;
+
+    // Scripts that should evaluate as invalid
+    UniValue tests = read_json(std::string(json_tests::script_invalid, json_tests::script_invalid + sizeof(json_tests::script_invalid)));
+
+    for (size_t idx = 0; idx < tests.size(); idx++) {
+        UniValue test = tests[idx];
+        string strTest = test.write();
+        if (test.size() < 3) // Allow size > 2; extra stuff ignored (useful for comments)
+        {
+            if (test.size() != 1) {
+                BOOST_ERROR("Bad test: " << strTest);
+            }
+            continue;
+        }
+        string scriptSigString = test[0].get_str();
+        CScript scriptSig = ParseScript(scriptSigString);
+        string scriptPubKeyString = test[1].get_str();
+        CScript scriptPubKey = ParseScript(scriptPubKeyString);
+        unsigned int scriptflags = ParseScriptFlags(test[2].get_str());
+
+        DoTest(scriptPubKey, scriptSig, scriptflags, consensusBranchId, false, strTest);
+    }
+}
+
+// Parameterized testing over consensus branch ids
+BOOST_DATA_TEST_CASE(script_PushData, boost::unit_test::data::xrange(static_cast<int>(Consensus::MAX_NETWORK_UPGRADES)))
+{
+    uint32_t consensusBranchId = NetworkUpgradeInfo[sample].nBranchId;
+
+    // Check that PUSHDATA1, PUSHDATA2, and PUSHDATA4 create the same value on
+    // the stack as the 1-75 opcodes do.
+    static const unsigned char direct[] = { 1, 0x5a };
+    static const unsigned char pushdata1[] = { OP_PUSHDATA1, 1, 0x5a };
+    static const unsigned char pushdata2[] = { OP_PUSHDATA2, 1, 0, 0x5a };
+    static const unsigned char pushdata4[] = { OP_PUSHDATA4, 1, 0, 0, 0, 0x5a };
+
+    ScriptError err;
+    vector<vector<unsigned char> > directStack;
+    BOOST_CHECK(EvalScript(directStack, CScript(&direct[0], &direct[sizeof(direct)]), SCRIPT_VERIFY_P2SH, BaseSignatureChecker(), consensusBranchId, &err));
+    BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_OK, ScriptErrorString(err));
+
+    vector<vector<unsigned char> > pushdata1Stack;
+    BOOST_CHECK(EvalScript(pushdata1Stack, CScript(&pushdata1[0], &pushdata1[sizeof(pushdata1)]), SCRIPT_VERIFY_P2SH, BaseSignatureChecker(), consensusBranchId, &err));
+    BOOST_CHECK(pushdata1Stack == directStack);
+    BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_OK, ScriptErrorString(err));
+
+    vector<vector<unsigned char> > pushdata2Stack;
+    BOOST_CHECK(EvalScript(pushdata2Stack, CScript(&pushdata2[0], &pushdata2[sizeof(pushdata2)]), SCRIPT_VERIFY_P2SH, BaseSignatureChecker(), consensusBranchId, &err));
+    BOOST_CHECK(pushdata2Stack == directStack);
+    BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_OK, ScriptErrorString(err));
+
+    vector<vector<unsigned char> > pushdata4Stack;
+    BOOST_CHECK(EvalScript(pushdata4Stack, CScript(&pushdata4[0], &pushdata4[sizeof(pushdata4)]), SCRIPT_VERIFY_P2SH, BaseSignatureChecker(), consensusBranchId, &err));
+    BOOST_CHECK(pushdata4Stack == directStack);
+    BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_OK, ScriptErrorString(err));
+}
+
+CScript
+sign_multisig(CScript scriptPubKey, std::vector<CKey> keys, CTransaction transaction, const PrecomputedTransactionData& txdata, uint32_t consensusBranchId)
+{
+    uint256 hash = SignatureHash(scriptPubKey, transaction, 0, SIGHASH_ALL, 0, consensusBranchId, txdata);
+
+    CScript result;
+    //
+    // NOTE: CHECKMULTISIG has an unfortunate bug; it requires
+    // one extra item on the stack, before the signatures.
+    // Putting OP_0 on the stack is the workaround;
+    // fixing the bug would mean splitting the block chain (old
+    // clients would not accept new CHECKMULTISIG transactions,
+    // and vice-versa)
+    //
+    result << OP_0;
+    for (const CKey &key : keys)
+    {
+        vector<unsigned char> vchSig;
+        BOOST_CHECK(key.Sign(hash, vchSig));
+        vchSig.push_back((unsigned char)SIGHASH_ALL);
+        result << vchSig;
+    }
+    return result;
+}
+CScript
+sign_multisig(CScript scriptPubKey, const CKey &key, CTransaction transaction, const PrecomputedTransactionData& txdata, uint32_t consensusBranchId)
+{
+    std::vector<CKey> keys;
+    keys.push_back(key);
+    return sign_multisig(scriptPubKey, keys, transaction, txdata, consensusBranchId);
+}
+
+// Parameterized testing over consensus branch ids
+BOOST_DATA_TEST_CASE(script_CHECKMULTISIG12, boost::unit_test::data::xrange(static_cast<int>(Consensus::MAX_NETWORK_UPGRADES)))
+{
+    uint32_t consensusBranchId = NetworkUpgradeInfo[sample].nBranchId;
+
+    ScriptError err;
+    CKey key1 = CKey::TestOnlyRandomKey(true);
+    CKey key2 = CKey::TestOnlyRandomKey(false);
+    CKey key3 = CKey::TestOnlyRandomKey(true);
+
+    CScript scriptPubKey12;
+    scriptPubKey12 << OP_1 << ToByteVector(key1.GetPubKey()) << ToByteVector(key2.GetPubKey()) << OP_2 << OP_CHECKMULTISIG;
+
+    CMutableTransaction txFrom12 = BuildCreditingTransaction(scriptPubKey12);
+    CMutableTransaction txTo12 = BuildSpendingTransaction(CScript(), txFrom12);
+    const PrecomputedTransactionData txdata12(txTo12, txFrom12.vout);
+
+    CScript goodsig1 = sign_multisig(scriptPubKey12, key1, txTo12, txdata12, consensusBranchId);
+    BOOST_CHECK(VerifyScript(goodsig1, scriptPubKey12, flags, MutableTransactionSignatureChecker(&txTo12, txdata12, 0, txFrom12.vout[0].nValue), consensusBranchId, &err));
+    BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_OK, ScriptErrorString(err));
+    txTo12.vout[0].nValue = 2;
+    BOOST_CHECK(!VerifyScript(goodsig1, scriptPubKey12, flags, MutableTransactionSignatureChecker(&txTo12, txdata12, 0, txFrom12.vout[0].nValue), consensusBranchId, &err));
+    BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_EVAL_FALSE, ScriptErrorString(err));
+
+    CScript goodsig2 = sign_multisig(scriptPubKey12, key2, txTo12, txdata12, consensusBranchId);
+    BOOST_CHECK(VerifyScript(goodsig2, scriptPubKey12, flags, MutableTransactionSignatureChecker(&txTo12, txdata12, 0, txFrom12.vout[0].nValue), consensusBranchId, &err));
+    BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_OK, ScriptErrorString(err));
+
+    CScript badsig1 = sign_multisig(scriptPubKey12, key3, txTo12, txdata12, consensusBranchId);
+    BOOST_CHECK(!VerifyScript(badsig1, scriptPubKey12, flags, MutableTransactionSignatureChecker(&txTo12, txdata12, 0, txFrom12.vout[0].nValue), consensusBranchId, &err));
+    BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_EVAL_FALSE, ScriptErrorString(err));
+}
+
+// Parameterized testing over consensus branch ids
+BOOST_DATA_TEST_CASE(script_CHECKMULTISIG23, boost::unit_test::data::xrange(static_cast<int>(Consensus::MAX_NETWORK_UPGRADES)))
+{
+    uint32_t consensusBranchId = NetworkUpgradeInfo[sample].nBranchId;
+
+    ScriptError err;
+    CKey key1 = CKey::TestOnlyRandomKey(true);
+    CKey key2 = CKey::TestOnlyRandomKey(false);
+    CKey key3 = CKey::TestOnlyRandomKey(true);
+    CKey key4 = CKey::TestOnlyRandomKey(false);
+
+    CScript scriptPubKey23;
+    scriptPubKey23 << OP_2 << ToByteVector(key1.GetPubKey()) << ToByteVector(key2.GetPubKey()) << ToByteVector(key3.GetPubKey()) << OP_3 << OP_CHECKMULTISIG;
+
+    CMutableTransaction txFrom23 = BuildCreditingTransaction(scriptPubKey23);
+    CMutableTransaction txTo23 = BuildSpendingTransaction(CScript(), txFrom23);
+    const PrecomputedTransactionData txdata23(txTo23, txFrom23.vout);
+
+    std::vector<CKey> keys;
+    keys.push_back(key1); keys.push_back(key2);
+    CScript goodsig1 = sign_multisig(scriptPubKey23, keys, txTo23, txdata23, consensusBranchId);
+    BOOST_CHECK(VerifyScript(goodsig1, scriptPubKey23, flags, MutableTransactionSignatureChecker(&txTo23, txdata23, 0, txFrom23.vout[0].nValue), consensusBranchId, &err));
+    BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_OK, ScriptErrorString(err));
+
+    keys.clear();
+    keys.push_back(key1); keys.push_back(key3);
+    CScript goodsig2 = sign_multisig(scriptPubKey23, keys, txTo23, txdata23, consensusBranchId);
+    BOOST_CHECK(VerifyScript(goodsig2, scriptPubKey23, flags, MutableTransactionSignatureChecker(&txTo23, txdata23, 0, txFrom23.vout[0].nValue), consensusBranchId, &err));
+    BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_OK, ScriptErrorString(err));
+
+    keys.clear();
+    keys.push_back(key2); keys.push_back(key3);
+    CScript goodsig3 = sign_multisig(scriptPubKey23, keys, txTo23, txdata23, consensusBranchId);
+    BOOST_CHECK(VerifyScript(goodsig3, scriptPubKey23, flags, MutableTransactionSignatureChecker(&txTo23, txdata23, 0, txFrom23.vout[0].nValue), consensusBranchId, &err));
+    BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_OK, ScriptErrorString(err));
+
+    keys.clear();
+    keys.push_back(key2); keys.push_back(key2); // Can't re-use sig
+    CScript badsig1 = sign_multisig(scriptPubKey23, keys, txTo23, txdata23, consensusBranchId);
+    BOOST_CHECK(!VerifyScript(badsig1, scriptPubKey23, flags, MutableTransactionSignatureChecker(&txTo23, txdata23, 0, txFrom23.vout[0].nValue), consensusBranchId, &err));
+    BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_EVAL_FALSE, ScriptErrorString(err));
+
+    keys.clear();
+    keys.push_back(key2); keys.push_back(key1); // sigs must be in correct order
+    CScript badsig2 = sign_multisig(scriptPubKey23, keys, txTo23, txdata23, consensusBranchId);
+    BOOST_CHECK(!VerifyScript(badsig2, scriptPubKey23, flags, MutableTransactionSignatureChecker(&txTo23, txdata23, 0, txFrom23.vout[0].nValue), consensusBranchId, &err));
+    BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_EVAL_FALSE, ScriptErrorString(err));
+
+    keys.clear();
+    keys.push_back(key3); keys.push_back(key2); // sigs must be in correct order
+    CScript badsig3 = sign_multisig(scriptPubKey23, keys, txTo23, txdata23, consensusBranchId);
+    BOOST_CHECK(!VerifyScript(badsig3, scriptPubKey23, flags, MutableTransactionSignatureChecker(&txTo23, txdata23, 0, txFrom23.vout[0].nValue), consensusBranchId, &err));
+    BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_EVAL_FALSE, ScriptErrorString(err));
+
+    keys.clear();
+    keys.push_back(key4); keys.push_back(key2); // sigs must match pubkeys
+    CScript badsig4 = sign_multisig(scriptPubKey23, keys, txTo23, txdata23, consensusBranchId);
+    BOOST_CHECK(!VerifyScript(badsig4, scriptPubKey23, flags, MutableTransactionSignatureChecker(&txTo23, txdata23, 0, txFrom23.vout[0].nValue), consensusBranchId, &err));
+    BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_EVAL_FALSE, ScriptErrorString(err));
+
+    keys.clear();
+    keys.push_back(key1); keys.push_back(key4); // sigs must match pubkeys
+    CScript badsig5 = sign_multisig(scriptPubKey23, keys, txTo23, txdata23, consensusBranchId);
+    BOOST_CHECK(!VerifyScript(badsig5, scriptPubKey23, flags, MutableTransactionSignatureChecker(&txTo23, txdata23, 0, txFrom23.vout[0].nValue), consensusBranchId, &err));
+    BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_EVAL_FALSE, ScriptErrorString(err));
+
+    keys.clear(); // Must have signatures
+    CScript badsig6 = sign_multisig(scriptPubKey23, keys, txTo23, txdata23, consensusBranchId);
+    BOOST_CHECK(!VerifyScript(badsig6, scriptPubKey23, flags, MutableTransactionSignatureChecker(&txTo23, txdata23, 0, txFrom23.vout[0].nValue), consensusBranchId, &err));
+    BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_INVALID_STACK_OPERATION, ScriptErrorString(err));
+}
+
+// Parameterized testing over consensus branch ids
+BOOST_DATA_TEST_CASE(script_combineSigs, boost::unit_test::data::xrange(static_cast<int>(Consensus::MAX_NETWORK_UPGRADES)))
+{
+    uint32_t consensusBranchId = NetworkUpgradeInfo[sample].nBranchId;
+
+    // Test the CombineSignatures function
+    CAmount amount = 0;
+    CBasicKeyStore keystore;
+    vector<CKey> keys;
+    vector<CPubKey> pubkeys;
+    for (int i = 0; i < 3; i++)
+    {
+        CKey key = CKey::TestOnlyRandomKey(i%2 == 1);
+        keys.push_back(key);
+        pubkeys.push_back(key.GetPubKey());
+        keystore.AddKey(key);
+    }
+
+    CMutableTransaction txFrom = BuildCreditingTransaction(GetScriptForDestination(keys[0].GetPubKey().GetID()));
+    CMutableTransaction txTo = BuildSpendingTransaction(CScript(), txFrom);
+    const PrecomputedTransactionData txToData(txTo, txFrom.vout);
+    CScript& scriptPubKey = txFrom.vout[0].scriptPubKey;
+    CScript& scriptSig = txTo.vin[0].scriptSig;
+
+    SignatureData empty;
+    SignatureData combined = CombineSignatures(scriptPubKey, MutableTransactionSignatureChecker(&txTo, txToData, 0, amount), empty, empty, consensusBranchId);
+    BOOST_CHECK(combined.scriptSig.empty());
+
+    // Single signature case:
+    SignSignature(keystore, txFrom, txTo, txToData, 0, SIGHASH_ALL, consensusBranchId); // changes scriptSig
+    combined = CombineSignatures(scriptPubKey, MutableTransactionSignatureChecker(&txTo, txToData, 0, amount), SignatureData(scriptSig), empty, consensusBranchId);
+    BOOST_CHECK(combined.scriptSig == scriptSig);
+    combined = CombineSignatures(scriptPubKey, MutableTransactionSignatureChecker(&txTo, txToData, 0, amount), empty, SignatureData(scriptSig), consensusBranchId);
+    BOOST_CHECK(combined.scriptSig == scriptSig);
+    CScript scriptSigCopy = scriptSig;
+    // Signing again will give a different, valid signature:
+    SignSignature(keystore, txFrom, txTo, txToData, 0, SIGHASH_ALL, consensusBranchId);
+    combined = CombineSignatures(scriptPubKey, MutableTransactionSignatureChecker(&txTo, txToData, 0, amount), SignatureData(scriptSigCopy), SignatureData(scriptSig), consensusBranchId);
+    BOOST_CHECK(combined.scriptSig == scriptSigCopy || combined.scriptSig == scriptSig);
+
+    // P2SH, single-signature case:
+    CScript pkSingle; pkSingle << ToByteVector(keys[0].GetPubKey()) << OP_CHECKSIG;
+    keystore.AddCScript(pkSingle);
+    scriptPubKey = GetScriptForDestination(CScriptID(pkSingle));
+    SignSignature(keystore, txFrom, txTo, txToData, 0, SIGHASH_ALL, consensusBranchId);
+    combined = CombineSignatures(scriptPubKey, MutableTransactionSignatureChecker(&txTo, txToData, 0, amount), SignatureData(scriptSig), empty, consensusBranchId);
+    BOOST_CHECK(combined.scriptSig == scriptSig);
+    combined = CombineSignatures(scriptPubKey, MutableTransactionSignatureChecker(&txTo, txToData, 0, amount), empty, SignatureData(scriptSig), consensusBranchId);
+    BOOST_CHECK(combined.scriptSig == scriptSig);
+    scriptSigCopy = scriptSig;
+    SignSignature(keystore, txFrom, txTo, txToData, 0, SIGHASH_ALL, consensusBranchId);
+    combined = CombineSignatures(scriptPubKey, MutableTransactionSignatureChecker(&txTo, txToData, 0, amount), SignatureData(scriptSigCopy), SignatureData(scriptSig), consensusBranchId);
+    BOOST_CHECK(combined.scriptSig == scriptSigCopy || combined.scriptSig == scriptSig);
+    // dummy scriptSigCopy with placeholder, should always choose non-placeholder:
+    scriptSigCopy = CScript() << OP_0 << vector<unsigned char>(pkSingle.begin(), pkSingle.end());
+    combined = CombineSignatures(scriptPubKey, MutableTransactionSignatureChecker(&txTo, txToData, 0, amount), SignatureData(scriptSigCopy), SignatureData(scriptSig), consensusBranchId);
+    BOOST_CHECK(combined.scriptSig == scriptSig);
+    combined = CombineSignatures(scriptPubKey, MutableTransactionSignatureChecker(&txTo, txToData, 0, amount), SignatureData(scriptSig), SignatureData(scriptSigCopy), consensusBranchId);
+    BOOST_CHECK(combined.scriptSig == scriptSig);
+
+    // Hardest case:  Multisig 2-of-3
+    scriptPubKey = GetScriptForMultisig(2, pubkeys);
+    keystore.AddCScript(scriptPubKey);
+    SignSignature(keystore, txFrom, txTo, txToData, 0, SIGHASH_ALL, consensusBranchId);
+    combined = CombineSignatures(scriptPubKey, MutableTransactionSignatureChecker(&txTo, txToData, 0, amount), SignatureData(scriptSig), empty, consensusBranchId);
+    BOOST_CHECK(combined.scriptSig == scriptSig);
+    combined = CombineSignatures(scriptPubKey, MutableTransactionSignatureChecker(&txTo, txToData, 0, amount), empty, SignatureData(scriptSig), consensusBranchId);
+    BOOST_CHECK(combined.scriptSig == scriptSig);
+
+    // A couple of partially-signed versions:
+    vector<unsigned char> sig1;
+    uint256 hash1 = SignatureHash(scriptPubKey, txTo, 0, SIGHASH_ALL, 0, consensusBranchId, txToData);
+    BOOST_CHECK(keys[0].Sign(hash1, sig1));
+    sig1.push_back(SIGHASH_ALL);
+    vector<unsigned char> sig2;
+    uint256 hash2 = SignatureHash(scriptPubKey, txTo, 0, SIGHASH_NONE, 0, consensusBranchId, txToData);
+    BOOST_CHECK(keys[1].Sign(hash2, sig2));
+    sig2.push_back(SIGHASH_NONE);
+    vector<unsigned char> sig3;
+    uint256 hash3 = SignatureHash(scriptPubKey, txTo, 0, SIGHASH_SINGLE, 0, consensusBranchId, txToData);
+    BOOST_CHECK(keys[2].Sign(hash3, sig3));
+    sig3.push_back(SIGHASH_SINGLE);
+
+    // Not fussy about order (or even existence) of placeholders or signatures:
+    CScript partial1a = CScript() << OP_0 << sig1 << OP_0;
+    CScript partial1b = CScript() << OP_0 << OP_0 << sig1;
+    CScript partial2a = CScript() << OP_0 << sig2;
+    CScript partial2b = CScript() << sig2 << OP_0;
+    CScript partial3a = CScript() << sig3;
+    CScript partial3b = CScript() << OP_0 << OP_0 << sig3;
+    CScript partial3c = CScript() << OP_0 << sig3 << OP_0;
+    CScript complete12 = CScript() << OP_0 << sig1 << sig2;
+    CScript complete13 = CScript() << OP_0 << sig1 << sig3;
+    CScript complete23 = CScript() << OP_0 << sig2 << sig3;
+
+    combined = CombineSignatures(scriptPubKey, MutableTransactionSignatureChecker(&txTo, txToData, 0, amount), SignatureData(partial1a), SignatureData(partial1b), consensusBranchId);
+    BOOST_CHECK(combined.scriptSig == partial1a);
+    combined = CombineSignatures(scriptPubKey, MutableTransactionSignatureChecker(&txTo, txToData, 0, amount), SignatureData(partial1a), SignatureData(partial2a), consensusBranchId);
+    BOOST_CHECK(combined.scriptSig == complete12);
+    combined = CombineSignatures(scriptPubKey, MutableTransactionSignatureChecker(&txTo, txToData, 0, amount), SignatureData(partial2a), SignatureData(partial1a), consensusBranchId);
+    BOOST_CHECK(combined.scriptSig == complete12);
+    combined = CombineSignatures(scriptPubKey, MutableTransactionSignatureChecker(&txTo, txToData, 0, amount), SignatureData(partial1b), SignatureData(partial2b), consensusBranchId);
+    BOOST_CHECK(combined.scriptSig == complete12);
+    combined = CombineSignatures(scriptPubKey, MutableTransactionSignatureChecker(&txTo, txToData, 0, amount), SignatureData(partial3b), SignatureData(partial1b), consensusBranchId);
+    BOOST_CHECK(combined.scriptSig == complete13);
+    combined = CombineSignatures(scriptPubKey, MutableTransactionSignatureChecker(&txTo, txToData, 0, amount), SignatureData(partial2a), SignatureData(partial3a), consensusBranchId);
+    BOOST_CHECK(combined.scriptSig == complete23);
+    combined = CombineSignatures(scriptPubKey, MutableTransactionSignatureChecker(&txTo, txToData, 0, amount), SignatureData(partial3b), SignatureData(partial2b), consensusBranchId);
+    BOOST_CHECK(combined.scriptSig == complete23);
+    combined = CombineSignatures(scriptPubKey, MutableTransactionSignatureChecker(&txTo, txToData, 0, amount), SignatureData(partial3b), SignatureData(partial3a), consensusBranchId);
+    BOOST_CHECK(combined.scriptSig == partial3c);
+}
+
+// Parameterized testing over consensus branch ids
+BOOST_DATA_TEST_CASE(script_standard_push, boost::unit_test::data::xrange(static_cast<int>(Consensus::MAX_NETWORK_UPGRADES)))
+{
+    uint32_t consensusBranchId = NetworkUpgradeInfo[sample].nBranchId;
+
+    ScriptError err;
+    for (int i=0; i<67000; i++) {
+        CScript script;
+        script << i;
+        BOOST_CHECK_MESSAGE(script.IsPushOnly(), "Number " << i << " is not pure push.");
+        BOOST_CHECK_MESSAGE(VerifyScript(script, CScript() << OP_1, SCRIPT_VERIFY_MINIMALDATA, BaseSignatureChecker(), consensusBranchId, &err), "Number " << i << " push is not minimal data.");
+        BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_OK, ScriptErrorString(err));
+    }
+
+    for (unsigned int i=0; i<=MAX_SCRIPT_ELEMENT_SIZE; i++) {
+        std::vector<unsigned char> data(i, '\111');
+        CScript script;
+        script << data;
+        BOOST_CHECK_MESSAGE(script.IsPushOnly(), "Length " << i << " is not pure push.");
+        BOOST_CHECK_MESSAGE(VerifyScript(script, CScript() << OP_1, SCRIPT_VERIFY_MINIMALDATA, BaseSignatureChecker(), consensusBranchId, &err), "Length " << i << " push is not minimal data.");
+        BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_OK, ScriptErrorString(err));
+    }
+}
+
+BOOST_AUTO_TEST_CASE(script_IsPushOnly_on_invalid_scripts)
+{
+    // IsPushOnly returns false when given a script containing only pushes that
+    // are invalid due to truncation. IsPushOnly() is consensus critical
+    // because P2SH evaluation uses it, although this specific behavior should
+    // not be consensus critical as the P2SH evaluation would fail first due to
+    // the invalid push. Still, it doesn't hurt to test it explicitly.
+    static const unsigned char direct[] = { 1 };
+    BOOST_CHECK(!CScript(direct, direct+sizeof(direct)).IsPushOnly());
+}
+
+BOOST_AUTO_TEST_CASE(script_GetScriptAsm)
+{
+    BOOST_CHECK_EQUAL("OP_NOP2", ScriptToAsmStr(CScript() << OP_NOP2, true));
+    BOOST_CHECK_EQUAL("OP_NOP2", ScriptToAsmStr(CScript() << OP_CHECKLOCKTIMEVERIFY, true));
+    BOOST_CHECK_EQUAL("OP_NOP2", ScriptToAsmStr(CScript() << OP_NOP2));
+    BOOST_CHECK_EQUAL("OP_NOP2", ScriptToAsmStr(CScript() << OP_CHECKLOCKTIMEVERIFY));
+
+    string derSig("304502207fa7a6d1e0ee81132a269ad84e68d695483745cde8b541e3bf630749894e342a022100c1f7ab20e13e22fb95281a870f3dcf38d782e53023ee313d741ad0cfbc0c5090");
+    string pubKey("03b0da749730dc9b4b1f4a14d6902877a92541f5368778853d9c4a0cb7802dcfb2");
+    vector<unsigned char> vchPubKey = ToByteVector(ParseHex(pubKey));
+
+    BOOST_CHECK_EQUAL(derSig + "00 " + pubKey, ScriptToAsmStr(CScript() << ToByteVector(ParseHex(derSig + "00")) << vchPubKey, true));
+    BOOST_CHECK_EQUAL(derSig + "80 " + pubKey, ScriptToAsmStr(CScript() << ToByteVector(ParseHex(derSig + "80")) << vchPubKey, true));
+    BOOST_CHECK_EQUAL(derSig + "[ALL] " + pubKey, ScriptToAsmStr(CScript() << ToByteVector(ParseHex(derSig + "01")) << vchPubKey, true));
+    BOOST_CHECK_EQUAL(derSig + "[NONE] " + pubKey, ScriptToAsmStr(CScript() << ToByteVector(ParseHex(derSig + "02")) << vchPubKey, true));
+    BOOST_CHECK_EQUAL(derSig + "[SINGLE] " + pubKey, ScriptToAsmStr(CScript() << ToByteVector(ParseHex(derSig + "03")) << vchPubKey, true));
+    BOOST_CHECK_EQUAL(derSig + "[ALL|ANYONECANPAY] " + pubKey, ScriptToAsmStr(CScript() << ToByteVector(ParseHex(derSig + "81")) << vchPubKey, true));
+    BOOST_CHECK_EQUAL(derSig + "[NONE|ANYONECANPAY] " + pubKey, ScriptToAsmStr(CScript() << ToByteVector(ParseHex(derSig + "82")) << vchPubKey, true));
+    BOOST_CHECK_EQUAL(derSig + "[SINGLE|ANYONECANPAY] " + pubKey, ScriptToAsmStr(CScript() << ToByteVector(ParseHex(derSig + "83")) << vchPubKey, true));
+
+    BOOST_CHECK_EQUAL(derSig + "00 " + pubKey, ScriptToAsmStr(CScript() << ToByteVector(ParseHex(derSig + "00")) << vchPubKey));
+    BOOST_CHECK_EQUAL(derSig + "80 " + pubKey, ScriptToAsmStr(CScript() << ToByteVector(ParseHex(derSig + "80")) << vchPubKey));
+    BOOST_CHECK_EQUAL(derSig + "01 " + pubKey, ScriptToAsmStr(CScript() << ToByteVector(ParseHex(derSig + "01")) << vchPubKey));
+    BOOST_CHECK_EQUAL(derSig + "02 " + pubKey, ScriptToAsmStr(CScript() << ToByteVector(ParseHex(derSig + "02")) << vchPubKey));
+    BOOST_CHECK_EQUAL(derSig + "03 " + pubKey, ScriptToAsmStr(CScript() << ToByteVector(ParseHex(derSig + "03")) << vchPubKey));
+    BOOST_CHECK_EQUAL(derSig + "81 " + pubKey, ScriptToAsmStr(CScript() << ToByteVector(ParseHex(derSig + "81")) << vchPubKey));
+    BOOST_CHECK_EQUAL(derSig + "82 " + pubKey, ScriptToAsmStr(CScript() << ToByteVector(ParseHex(derSig + "82")) << vchPubKey));
+    BOOST_CHECK_EQUAL(derSig + "83 " + pubKey, ScriptToAsmStr(CScript() << ToByteVector(ParseHex(derSig + "83")) << vchPubKey));
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/scriptnum10.h b/depend/zcash/src/test/scriptnum10.h
new file mode 100644
index 000000000..61131ec4c
--- /dev/null
+++ b/depend/zcash/src/test/scriptnum10.h
@@ -0,0 +1,209 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_TEST_SCRIPTNUM10_H
+#define BITCOIN_TEST_SCRIPTNUM10_H
+
+#include <algorithm>
+#include <limits>
+#include <stdexcept>
+#include <stdint.h>
+#include <string>
+#include <vector>
+#include "assert.h"
+
+class scriptnum10_error : public std::runtime_error
+{
+public:
+    explicit scriptnum10_error(const std::string& str) : std::runtime_error(str) {}
+};
+
+class CScriptNum10
+{
+/**
+ * The ScriptNum implementation from Bitcoin Core 0.10.0, for cross-comparison.
+ */
+public:
+
+    explicit CScriptNum10(const int64_t& n)
+    {
+        m_value = n;
+    }
+
+    static const size_t nDefaultMaxNumSize = 4;
+
+    explicit CScriptNum10(const std::vector<unsigned char>& vch, bool fRequireMinimal,
+                        const size_t nMaxNumSize = nDefaultMaxNumSize)
+    {
+        if (vch.size() > nMaxNumSize) {
+            throw scriptnum10_error("script number overflow");
+        }
+        if (fRequireMinimal && vch.size() > 0) {
+            // Check that the number is encoded with the minimum possible
+            // number of bytes.
+            //
+            // If the most-significant-byte - excluding the sign bit - is zero
+            // then we're not minimal. Note how this test also rejects the
+            // negative-zero encoding, 0x80.
+            if ((vch.back() & 0x7f) == 0) {
+                // One exception: if there's more than one byte and the most
+                // significant bit of the second-most-significant-byte is set
+                // it would conflict with the sign bit. An example of this case
+                // is +-255, which encode to 0xff00 and 0xff80 respectively.
+                // (big-endian).
+                if (vch.size() <= 1 || (vch[vch.size() - 2] & 0x80) == 0) {
+                    throw scriptnum10_error("non-minimally encoded script number");
+                }
+            }
+        }
+        m_value = set_vch(vch);
+    }
+
+    inline bool operator==(const int64_t& rhs)      const { return m_value == rhs; }
+    inline bool operator!=(const int64_t& rhs)      const { return m_value != rhs; }
+    inline bool operator<=(const int64_t& rhs)      const { return m_value <= rhs; }
+    inline bool operator< (const int64_t& rhs)      const { return m_value <  rhs; }
+    inline bool operator>=(const int64_t& rhs)      const { return m_value >= rhs; }
+    inline bool operator> (const int64_t& rhs)      const { return m_value >  rhs; }
+
+    inline bool operator==(const CScriptNum10& rhs) const { return operator==(rhs.m_value); }
+    inline bool operator!=(const CScriptNum10& rhs) const { return operator!=(rhs.m_value); }
+    inline bool operator<=(const CScriptNum10& rhs) const { return operator<=(rhs.m_value); }
+    inline bool operator< (const CScriptNum10& rhs) const { return operator< (rhs.m_value); }
+    inline bool operator>=(const CScriptNum10& rhs) const { return operator>=(rhs.m_value); }
+    inline bool operator> (const CScriptNum10& rhs) const { return operator> (rhs.m_value); }
+
+    inline CScriptNum10 operator+(   const int64_t& rhs)      const
+    {
+        assert(rhs == 0 || (rhs > 0 && m_value <= std::numeric_limits<int64_t>::max() - rhs) ||
+                           (rhs < 0 && m_value >= std::numeric_limits<int64_t>::min() - rhs));
+        return CScriptNum10(m_value + rhs);
+    }
+
+    inline CScriptNum10 operator-(   const int64_t& rhs)      const
+    {
+        assert(rhs == 0 || (rhs > 0 && m_value >= std::numeric_limits<int64_t>::min() + rhs) ||
+                           (rhs < 0 && m_value <= std::numeric_limits<int64_t>::max() + rhs));
+        return CScriptNum10(m_value - rhs);
+    }
+
+    inline CScriptNum10 operator+(   const CScriptNum10& rhs) const { return operator+(rhs.m_value);   }
+    inline CScriptNum10 operator-(   const CScriptNum10& rhs) const { return operator-(rhs.m_value);   }
+
+    inline CScriptNum10& operator+=( const CScriptNum10& rhs)       { return operator+=(rhs.m_value);  }
+    inline CScriptNum10& operator-=( const CScriptNum10& rhs)       { return operator-=(rhs.m_value);  }
+
+    inline CScriptNum10 operator-()                           const
+    {
+        assert(m_value != std::numeric_limits<int64_t>::min());
+        return CScriptNum10(-m_value);
+    }
+
+    inline CScriptNum10& operator=(  const int64_t& rhs)
+    {
+        m_value = rhs;
+        return *this;
+    }
+
+    inline CScriptNum10& operator+=( const int64_t& rhs)
+    {
+        assert(rhs == 0 || (rhs > 0 && m_value <= std::numeric_limits<int64_t>::max() - rhs) ||
+                           (rhs < 0 && m_value >= std::numeric_limits<int64_t>::min() - rhs));
+        m_value += rhs;
+        return *this;
+    }
+
+    inline CScriptNum10& operator-=( const int64_t& rhs)
+    {
+        assert(rhs == 0 || (rhs > 0 && m_value >= std::numeric_limits<int64_t>::min() + rhs) ||
+                           (rhs < 0 && m_value <= std::numeric_limits<int64_t>::max() + rhs));
+        m_value -= rhs;
+        return *this;
+    }
+
+    int getint() const
+    {
+        if (m_value > std::numeric_limits<int>::max())
+            return std::numeric_limits<int>::max();
+        else if (m_value < std::numeric_limits<int>::min())
+            return std::numeric_limits<int>::min();
+        return m_value;
+    }
+
+    std::vector<unsigned char> getvch() const
+    {
+        return serialize(m_value);
+    }
+
+    static std::vector<unsigned char> serialize(const int64_t& value)
+    {
+        if(value == 0)
+            return std::vector<unsigned char>();
+
+        // This could result in undefined behaviour in Bitcoin 0.10.0 and
+        // Zcash prior to https://github.com/zcash/zcash/pull/4454 .
+        // Since we only use this implementation for tests, we just assert
+        // that the tests are not triggering this case (which is tested
+        // separately for the real implementation).
+        assert(value != INT64_MIN);
+
+        std::vector<unsigned char> result;
+        const bool neg = value < 0;
+        uint64_t absvalue = neg ? -value : value;
+
+        while(absvalue)
+        {
+            result.push_back(absvalue & 0xff);
+            absvalue >>= 8;
+        }
+
+//    - If the most significant byte is >= 0x80 and the value is positive, push a
+//    new zero-byte to make the significant byte < 0x80 again.
+
+//    - If the most significant byte is >= 0x80 and the value is negative, push a
+//    new 0x80 byte that will be popped off when converting to an integral.
+
+//    - If the most significant byte is < 0x80 and the value is negative, add
+//    0x80 to it, since it will be subtracted and interpreted as a negative when
+//    converting to an integral.
+
+        if (result.back() & 0x80)
+            result.push_back(neg ? 0x80 : 0);
+        else if (neg)
+            result.back() |= 0x80;
+
+        return result;
+    }
+
+private:
+    static int64_t set_vch(const std::vector<unsigned char>& vch)
+    {
+      if (vch.empty())
+          return 0;
+
+      // This could result in undefined behaviour in Bitcoin 0.10.0 and
+      // Zcash prior to https://github.com/zcash/zcash/pull/4454 .
+      // Since we only use this implementation for tests, we just assert
+      // that the tests are not triggering this case (which is tested
+      // separately for the real implementation).
+      assert(vch.size() <= 8);
+
+      int64_t result = 0;
+      for (size_t i = 0; i != vch.size(); ++i)
+          result |= static_cast<int64_t>(vch[i]) << 8*i;
+
+      // If the input vector's most significant byte is 0x80, remove it from
+      // the result's msb and return a negative.
+      if (vch.back() & 0x80)
+          return -((int64_t)(result & ~(0x80ULL << (8 * (vch.size() - 1)))));
+
+      return result;
+    }
+
+    int64_t m_value;
+};
+
+
+#endif // BITCOIN_TEST_BIGNUM_H
diff --git a/depend/zcash/src/test/scriptnum_tests.cpp b/depend/zcash/src/test/scriptnum_tests.cpp
new file mode 100644
index 000000000..42ab48516
--- /dev/null
+++ b/depend/zcash/src/test/scriptnum_tests.cpp
@@ -0,0 +1,247 @@
+// Copyright (c) 2012-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "scriptnum10.h"
+#include "script/script.h"
+#include "test/test_bitcoin.h"
+
+#include <boost/test/unit_test.hpp>
+#include <limits.h>
+#include <stdint.h>
+
+BOOST_FIXTURE_TEST_SUITE(scriptnum_tests, BasicTestingSetup)
+
+static const int64_t values[] = \
+{ 0, 1, CHAR_MIN, CHAR_MAX, UCHAR_MAX, SHRT_MIN, USHRT_MAX, INT_MIN, INT_MAX, UINT_MAX, INT64_MIN, INT64_MAX };
+static const int64_t offsets[] = { 1, 0x79, 0x80, 0x81, 0xFF, 0x7FFF, 0x8000, 0xFFFF, 0x10000};
+
+
+static bool addition_in_range(int64_t a, int64_t b) {
+    // intentionally excludes cases where the result would be INT64_MIN
+    return b > 0 ? (a <= INT64_MAX - b) : (a > INT64_MIN - b);
+}
+
+static bool subtraction_in_range(int64_t a, int64_t b) {
+    // intentionally excludes cases where the result would be INT64_MIN
+    return b >= 0 ? (a > INT64_MIN + b) : (a <= INT64_MAX + b);
+}
+
+static bool value_in_range(int64_t a) {
+    return a != INT64_MIN;
+}
+
+static bool verify(const CScriptNum10& bignum, const CScriptNum& scriptnum)
+{
+    return bignum.getvch() == scriptnum.getvch() && bignum.getint() == scriptnum.getint();
+}
+
+static void CheckCreateVch(int64_t num)
+{
+    CScriptNum10 bignum(num);
+    CScriptNum scriptnum(num);
+    BOOST_CHECK(verify(bignum, scriptnum));
+
+    CScriptNum10 bignum2(bignum.getvch(), false);
+    std::vector<unsigned char> scriptnum_vch = scriptnum.getvch();
+    // The 9-byte case is exercised by the 'intmin' test.
+    BOOST_CHECK(scriptnum_vch.size() <= 8);
+    CScriptNum scriptnum2(scriptnum_vch, false);
+    BOOST_CHECK(verify(bignum2, scriptnum2));
+
+    CScriptNum10 bignum3(scriptnum2.getvch(), false);
+    CScriptNum scriptnum3(bignum2.getvch(), false);
+    BOOST_CHECK(verify(bignum3, scriptnum3));
+}
+
+static void CheckCreateInt(int64_t num)
+{
+    CScriptNum10 bignum(num);
+    CScriptNum scriptnum(num);
+    BOOST_CHECK(verify(bignum, scriptnum));
+    BOOST_CHECK(verify(CScriptNum10(bignum.getint()), CScriptNum(scriptnum.getint())));
+    BOOST_CHECK(verify(CScriptNum10(scriptnum.getint()), CScriptNum(bignum.getint())));
+    BOOST_CHECK(verify(CScriptNum10(CScriptNum10(scriptnum.getint()).getint()), CScriptNum(CScriptNum(bignum.getint()).getint())));
+}
+
+
+static void CheckAdd(int64_t num1, int64_t num2)
+{
+    const CScriptNum10 bignum1(num1);
+    const CScriptNum10 bignum2(num2);
+    const CScriptNum scriptnum1(num1);
+    const CScriptNum scriptnum2(num2);
+    CScriptNum10 bignum3(num1);
+    CScriptNum10 bignum4(num1);
+    CScriptNum scriptnum3(num1);
+    CScriptNum scriptnum4(num1);
+
+    if (addition_in_range(num1, num2))
+    {
+        BOOST_CHECK(verify(bignum1 + bignum2, scriptnum1 + scriptnum2));
+        BOOST_CHECK(verify(bignum1 + bignum2, scriptnum1 + num2));
+        BOOST_CHECK(verify(bignum1 + bignum2, scriptnum2 + num1));
+    }
+}
+
+static void CheckNegate(int64_t num)
+{
+    const CScriptNum10 bignum(num);
+    const CScriptNum scriptnum(num);
+
+    BOOST_CHECK(verify(-bignum, -scriptnum));
+}
+
+static void CheckSubtract(int64_t num1, int64_t num2)
+{
+    const CScriptNum10 bignum1(num1);
+    const CScriptNum10 bignum2(num2);
+    const CScriptNum scriptnum1(num1);
+    const CScriptNum scriptnum2(num2);
+    bool invalid = false;
+
+    if (subtraction_in_range(num1, num2))
+    {
+        BOOST_CHECK(verify(bignum1 - bignum2, scriptnum1 - scriptnum2));
+        BOOST_CHECK(verify(bignum1 - bignum2, scriptnum1 - num2));
+    }
+
+    if (subtraction_in_range(num2, num1))
+    {
+        BOOST_CHECK(verify(bignum2 - bignum1, scriptnum2 - scriptnum1));
+        BOOST_CHECK(verify(bignum2 - bignum1, scriptnum2 - num1));
+    }
+}
+
+static void CheckCompare(int64_t num1, int64_t num2)
+{
+    const CScriptNum10 bignum1(num1);
+    const CScriptNum10 bignum2(num2);
+    const CScriptNum scriptnum1(num1);
+    const CScriptNum scriptnum2(num2);
+
+    BOOST_CHECK((bignum1 == bignum1) == (scriptnum1 == scriptnum1));
+    BOOST_CHECK((bignum1 != bignum1) == (scriptnum1 != scriptnum1));
+    BOOST_CHECK((bignum1 <  bignum1) == (scriptnum1 <  scriptnum1));
+    BOOST_CHECK((bignum1 >  bignum1) == (scriptnum1 >  scriptnum1));
+    BOOST_CHECK((bignum1 >= bignum1) == (scriptnum1 >= scriptnum1));
+    BOOST_CHECK((bignum1 <= bignum1) == (scriptnum1 <= scriptnum1));
+
+    BOOST_CHECK((bignum1 == bignum1) == (scriptnum1 == num1));
+    BOOST_CHECK((bignum1 != bignum1) == (scriptnum1 != num1));
+    BOOST_CHECK((bignum1 <  bignum1) == (scriptnum1 <  num1));
+    BOOST_CHECK((bignum1 >  bignum1) == (scriptnum1 >  num1));
+    BOOST_CHECK((bignum1 >= bignum1) == (scriptnum1 >= num1));
+    BOOST_CHECK((bignum1 <= bignum1) == (scriptnum1 <= num1));
+
+    BOOST_CHECK((bignum1 == bignum2) == (scriptnum1 == scriptnum2));
+    BOOST_CHECK((bignum1 != bignum2) == (scriptnum1 != scriptnum2));
+    BOOST_CHECK((bignum1 <  bignum2) == (scriptnum1 <  scriptnum2));
+    BOOST_CHECK((bignum1 >  bignum2) == (scriptnum1 >  scriptnum2));
+    BOOST_CHECK((bignum1 >= bignum2) == (scriptnum1 >= scriptnum2));
+    BOOST_CHECK((bignum1 <= bignum2) == (scriptnum1 <= scriptnum2));
+
+    BOOST_CHECK((bignum1 == bignum2) == (scriptnum1 == num2));
+    BOOST_CHECK((bignum1 != bignum2) == (scriptnum1 != num2));
+    BOOST_CHECK((bignum1 < bignum2)  == (scriptnum1 < num2));
+    BOOST_CHECK((bignum1 > bignum2)  == (scriptnum1 > num2));
+    BOOST_CHECK((bignum1 >= bignum2) == (scriptnum1 >= num2));
+    BOOST_CHECK((bignum1 <= bignum2) == (scriptnum1 <= num2));
+}
+
+static void RunCreate(int64_t num)
+{
+    CheckCreateInt(num);
+    CScriptNum scriptnum(num);
+    if (scriptnum.getvch().size() <= CScriptNum::nDefaultMaxNumSize)
+    {
+        CheckCreateVch(num);
+    } else {
+        BOOST_CHECK_THROW(CheckCreateVch(num), scriptnum10_error);
+    }
+}
+
+static void RunOperators(int64_t num1, int64_t num2)
+{
+    CheckAdd(num1, num2);
+    CheckSubtract(num1, num2);
+    CheckNegate(num1);
+    CheckCompare(num1, num2);
+}
+
+BOOST_AUTO_TEST_CASE(creation)
+{
+    for (size_t i = 0; i < sizeof(values) / sizeof(values[0]); ++i)
+    {
+        for (size_t j = 0; j < sizeof(offsets) / sizeof(offsets[0]); ++j)
+        {
+            if (value_in_range(values[i])) {
+                RunCreate(values[i]);
+            }
+            if (addition_in_range(values[i], offsets[j])) {
+                RunCreate(values[i] + offsets[j]);
+            }
+            if (subtraction_in_range(values[i], offsets[j])) {
+                RunCreate(values[i] - offsets[j]);
+            }
+        }
+    }
+}
+
+BOOST_AUTO_TEST_CASE(operators)
+{
+    for (size_t i = 0; i < sizeof(values) / sizeof(values[0]); ++i)
+    {
+        for (size_t j = 0; j < sizeof(values) / sizeof(values[0]); ++j)
+        {
+            if (value_in_range(values[i]))
+            {
+                RunOperators(values[i], values[i]);
+                RunOperators(values[i], -values[i]);
+            }
+            if (value_in_range(values[i]) && value_in_range(values[j]))
+            {
+               RunOperators(values[i], values[j]);
+               RunOperators(values[i], -values[j]);
+            }
+            if (addition_in_range(values[i], values[j]) && value_in_range(values[j]))
+            {
+                RunOperators(values[i] + values[j], values[j]);
+                RunOperators(values[i] + values[j], -values[j]);
+                RunOperators(values[i] + values[j], values[i] + values[j]);
+            }
+            if (subtraction_in_range(values[i], values[j]) && value_in_range(values[j]))
+            {
+                RunOperators(values[i] - values[j], values[j]);
+                RunOperators(values[i] - values[j], -values[j]);
+                RunOperators(values[i] - values[j], values[i] - values[j]);
+            }
+            if (addition_in_range(values[i], values[j]) && subtraction_in_range(values[i], values[j]))
+            {
+                RunOperators(values[i] + values[j], values[i] - values[j]);
+                RunOperators(values[i] - values[j], values[i] + values[j]);
+            }
+        }
+    }
+}
+
+BOOST_AUTO_TEST_CASE(intmin)
+{
+    // INT64_MIN encodes to the buggy encoding.
+    const CScriptNum sn(INT64_MIN);
+    std::vector<unsigned char> buggy_int64_min_encoding = {0, 0, 0, 0, 0, 0, 0, 128, 128};
+    BOOST_CHECK(sn.getvch() == buggy_int64_min_encoding);
+
+    // The buggy INT64_MIN encoding decodes correctly.
+    const CScriptNum sn2(buggy_int64_min_encoding, true, 9);
+    BOOST_CHECK(sn2 == INT64_MIN);
+    BOOST_CHECK(sn2.getvch() == buggy_int64_min_encoding);
+    // getint() saturates at the min/max value of the int type
+    BOOST_CHECK((sn2.getint()) == std::numeric_limits<int>::min());
+
+    // Should throw for any other 9+ byte encoding.
+    std::vector<unsigned char> invalid_nine_bytes = {0, 0, 0, 0, 0, 0, 0, 0, 0};
+    BOOST_CHECK_THROW (CScriptNum sn3(invalid_nine_bytes, false, 9), scriptnum_error);
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/serialize_tests.cpp b/depend/zcash/src/test/serialize_tests.cpp
new file mode 100644
index 000000000..b00fa69a4
--- /dev/null
+++ b/depend/zcash/src/test/serialize_tests.cpp
@@ -0,0 +1,420 @@
+// Copyright (c) 2012-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "serialize.h"
+#include "streams.h"
+#include "hash.h"
+#include "test/test_bitcoin.h"
+#include "utilstrencodings.h"
+
+#include <array>
+#include <optional>
+#include <stdint.h>
+
+#include <boost/test/unit_test.hpp>
+
+using namespace std;
+
+
+template<typename T>
+void check_ser_rep(T thing, std::vector<unsigned char> expected)
+{
+    CDataStream ss(SER_DISK, 0);
+    ss << thing;
+
+    BOOST_CHECK(GetSerializeSize(thing, 0, 0) == ss.size());
+
+    std::vector<unsigned char> serialized_representation(ss.begin(), ss.end());
+
+    BOOST_CHECK(serialized_representation == expected);
+
+    T thing_deserialized;
+    ss >> thing_deserialized;
+
+    BOOST_CHECK(thing_deserialized == thing);
+}
+
+BOOST_FIXTURE_TEST_SUITE(serialize_tests, BasicTestingSetup)
+
+class CSerializeMethodsTestSingle
+{
+protected:
+    int intval;
+    bool boolval;
+    std::string stringval;
+    const char* charstrval;
+    CTransaction txval;
+public:
+    CSerializeMethodsTestSingle() = default;
+    CSerializeMethodsTestSingle(int intvalin, bool boolvalin, std::string stringvalin, const char* charstrvalin, CTransaction txvalin) : intval(intvalin), boolval(boolvalin), stringval(std::move(stringvalin)), charstrval(charstrvalin), txval(txvalin){}
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(intval);
+        READWRITE(boolval);
+        READWRITE(stringval);
+        READWRITE(FLATDATA(charstrval));
+        READWRITE(txval);
+    }
+
+    bool operator==(const CSerializeMethodsTestSingle& rhs)
+    {
+        return  intval == rhs.intval && \
+                boolval == rhs.boolval && \
+                stringval == rhs.stringval && \
+                strcmp(charstrval, rhs.charstrval) == 0 && \
+                txval == rhs.txval;
+    }
+};
+
+class CSerializeMethodsTestMany : public CSerializeMethodsTestSingle
+{
+public:
+    using CSerializeMethodsTestSingle::CSerializeMethodsTestSingle;
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITEMANY(intval, boolval, stringval, FLATDATA(charstrval), txval);
+    }
+};
+
+BOOST_AUTO_TEST_CASE(boost_optional)
+{
+    check_ser_rep<std::optional<unsigned char>>(0xff, {0x01, 0xff});
+    check_ser_rep<std::optional<unsigned char>>(std::nullopt, {0x00});
+    check_ser_rep<std::optional<std::string>>(std::string("Test"), {0x01, 0x04, 'T', 'e', 's', 't'});
+
+    {
+        // Ensure that canonical optional discriminant is used
+        CDataStream ss(SER_DISK, 0);
+        ss.write("\x02\x04Test", 6);
+        std::optional<std::string> into;
+
+        BOOST_CHECK_THROW(ss >> into, std::ios_base::failure);
+    }
+}
+
+BOOST_AUTO_TEST_CASE(arrays)
+{
+    std::array<std::string, 2> test_case = {string("zub"), string("baz")};
+    CDataStream ss(SER_DISK, 0);
+    ss << test_case;
+
+    auto hash = Hash(ss.begin(), ss.end());
+
+    BOOST_CHECK_MESSAGE("037a75620362617a" == HexStr(ss.begin(), ss.end()), HexStr(ss.begin(), ss.end()));
+    BOOST_CHECK_MESSAGE(hash == uint256S("13cb12b2dd098dced0064fe4897c97f907ba3ed36ae470c2e7fc2b1111eba35a"), "actually got: " << hash.ToString());
+
+    {
+        // note: boost array of size 2 should serialize to be the same as a tuple
+        std::pair<std::string, std::string> test_case_2 = {string("zub"), string("baz")};
+
+        CDataStream ss2(SER_DISK, 0);
+        ss2 << test_case_2;
+
+        auto hash2 = Hash(ss2.begin(), ss2.end());
+
+        BOOST_CHECK(hash == hash2);
+    }
+
+    std::array<std::string, 2> decoded_test_case;
+    ss >> decoded_test_case;
+
+    BOOST_CHECK(decoded_test_case == test_case);
+
+    std::array<int32_t, 2> test = {100, 200};
+
+    BOOST_CHECK_EQUAL(GetSerializeSize(test, 0, 0), 8);
+}
+
+BOOST_AUTO_TEST_CASE(sizes)
+{
+    BOOST_CHECK_EQUAL(sizeof(char), GetSerializeSize(char(0), 0));
+    BOOST_CHECK_EQUAL(sizeof(int8_t), GetSerializeSize(int8_t(0), 0));
+    BOOST_CHECK_EQUAL(sizeof(uint8_t), GetSerializeSize(uint8_t(0), 0));
+    BOOST_CHECK_EQUAL(sizeof(int16_t), GetSerializeSize(int16_t(0), 0));
+    BOOST_CHECK_EQUAL(sizeof(uint16_t), GetSerializeSize(uint16_t(0), 0));
+    BOOST_CHECK_EQUAL(sizeof(int32_t), GetSerializeSize(int32_t(0), 0));
+    BOOST_CHECK_EQUAL(sizeof(uint32_t), GetSerializeSize(uint32_t(0), 0));
+    BOOST_CHECK_EQUAL(sizeof(int64_t), GetSerializeSize(int64_t(0), 0));
+    BOOST_CHECK_EQUAL(sizeof(uint64_t), GetSerializeSize(uint64_t(0), 0));
+    BOOST_CHECK_EQUAL(sizeof(float), GetSerializeSize(float(0), 0));
+    BOOST_CHECK_EQUAL(sizeof(double), GetSerializeSize(double(0), 0));
+    // Bool is serialized as char
+    BOOST_CHECK_EQUAL(sizeof(char), GetSerializeSize(bool(0), 0));
+
+    // Sanity-check GetSerializeSize and c++ type matching
+    BOOST_CHECK_EQUAL(GetSerializeSize(char(0), 0), 1);
+    BOOST_CHECK_EQUAL(GetSerializeSize(int8_t(0), 0), 1);
+    BOOST_CHECK_EQUAL(GetSerializeSize(uint8_t(0), 0), 1);
+    BOOST_CHECK_EQUAL(GetSerializeSize(int16_t(0), 0), 2);
+    BOOST_CHECK_EQUAL(GetSerializeSize(uint16_t(0), 0), 2);
+    BOOST_CHECK_EQUAL(GetSerializeSize(int32_t(0), 0), 4);
+    BOOST_CHECK_EQUAL(GetSerializeSize(uint32_t(0), 0), 4);
+    BOOST_CHECK_EQUAL(GetSerializeSize(int64_t(0), 0), 8);
+    BOOST_CHECK_EQUAL(GetSerializeSize(uint64_t(0), 0), 8);
+    BOOST_CHECK_EQUAL(GetSerializeSize(float(0), 0), 4);
+    BOOST_CHECK_EQUAL(GetSerializeSize(double(0), 0), 8);
+    BOOST_CHECK_EQUAL(GetSerializeSize(bool(0), 0), 1);
+}
+
+BOOST_AUTO_TEST_CASE(floats_conversion)
+{
+    // Choose values that map unambigiously to binary floating point to avoid
+    // rounding issues at the compiler side.
+    BOOST_CHECK_EQUAL(ser_uint32_to_float(0x00000000), 0.0F);
+    BOOST_CHECK_EQUAL(ser_uint32_to_float(0x3f000000), 0.5F);
+    BOOST_CHECK_EQUAL(ser_uint32_to_float(0x3f800000), 1.0F);
+    BOOST_CHECK_EQUAL(ser_uint32_to_float(0x40000000), 2.0F);
+    BOOST_CHECK_EQUAL(ser_uint32_to_float(0x40800000), 4.0F);
+    BOOST_CHECK_EQUAL(ser_uint32_to_float(0x44444444), 785.066650390625F);
+
+    BOOST_CHECK_EQUAL(ser_float_to_uint32(0.0F), 0x00000000);
+    BOOST_CHECK_EQUAL(ser_float_to_uint32(0.5F), 0x3f000000);
+    BOOST_CHECK_EQUAL(ser_float_to_uint32(1.0F), 0x3f800000);
+    BOOST_CHECK_EQUAL(ser_float_to_uint32(2.0F), 0x40000000);
+    BOOST_CHECK_EQUAL(ser_float_to_uint32(4.0F), 0x40800000);
+    BOOST_CHECK_EQUAL(ser_float_to_uint32(785.066650390625F), 0x44444444);
+}
+
+BOOST_AUTO_TEST_CASE(doubles_conversion)
+{
+    // Choose values that map unambigiously to binary floating point to avoid
+    // rounding issues at the compiler side.
+    BOOST_CHECK_EQUAL(ser_uint64_to_double(0x0000000000000000ULL), 0.0);
+    BOOST_CHECK_EQUAL(ser_uint64_to_double(0x3fe0000000000000ULL), 0.5);
+    BOOST_CHECK_EQUAL(ser_uint64_to_double(0x3ff0000000000000ULL), 1.0);
+    BOOST_CHECK_EQUAL(ser_uint64_to_double(0x4000000000000000ULL), 2.0);
+    BOOST_CHECK_EQUAL(ser_uint64_to_double(0x4010000000000000ULL), 4.0);
+    BOOST_CHECK_EQUAL(ser_uint64_to_double(0x4088888880000000ULL), 785.066650390625);
+
+    BOOST_CHECK_EQUAL(ser_double_to_uint64(0.0), 0x0000000000000000ULL);
+    BOOST_CHECK_EQUAL(ser_double_to_uint64(0.5), 0x3fe0000000000000ULL);
+    BOOST_CHECK_EQUAL(ser_double_to_uint64(1.0), 0x3ff0000000000000ULL);
+    BOOST_CHECK_EQUAL(ser_double_to_uint64(2.0), 0x4000000000000000ULL);
+    BOOST_CHECK_EQUAL(ser_double_to_uint64(4.0), 0x4010000000000000ULL);
+    BOOST_CHECK_EQUAL(ser_double_to_uint64(785.066650390625), 0x4088888880000000ULL);
+}
+/*
+Python code to generate the below hashes:
+
+    def reversed_hex(x):
+        return binascii.hexlify(''.join(reversed(x)))
+    def dsha256(x):
+        return hashlib.sha256(hashlib.sha256(x).digest()).digest()
+
+    reversed_hex(dsha256(''.join(struct.pack('<f', x) for x in range(0,1000)))) == '8e8b4cf3e4df8b332057e3e23af42ebc663b61e0495d5e7e32d85099d7f3fe0c'
+    reversed_hex(dsha256(''.join(struct.pack('<d', x) for x in range(0,1000)))) == '43d0c82591953c4eafe114590d392676a01585d25b25d433557f0d7878b23f96'
+*/
+BOOST_AUTO_TEST_CASE(floats)
+{
+    CDataStream ss(SER_DISK, 0);
+    // encode
+    for (int i = 0; i < 1000; i++) {
+        ss << float(i);
+    }
+    BOOST_CHECK(Hash(ss.begin(), ss.end()) == uint256S("8e8b4cf3e4df8b332057e3e23af42ebc663b61e0495d5e7e32d85099d7f3fe0c"));
+
+    // decode
+    for (int i = 0; i < 1000; i++) {
+        float j;
+        ss >> j;
+        BOOST_CHECK_MESSAGE(i == j, "decoded:" << j << " expected:" << i);
+    }
+}
+
+BOOST_AUTO_TEST_CASE(doubles)
+{
+    CDataStream ss(SER_DISK, 0);
+    // encode
+    for (int i = 0; i < 1000; i++) {
+        ss << double(i);
+    }
+    BOOST_CHECK(Hash(ss.begin(), ss.end()) == uint256S("43d0c82591953c4eafe114590d392676a01585d25b25d433557f0d7878b23f96"));
+
+    // decode
+    for (int i = 0; i < 1000; i++) {
+        double j;
+        ss >> j;
+        BOOST_CHECK_MESSAGE(i == j, "decoded:" << j << " expected:" << i);
+    }
+}
+
+BOOST_AUTO_TEST_CASE(varints)
+{
+    // encode
+
+    CDataStream ss(SER_DISK, 0);
+    CDataStream::size_type size = 0;
+    for (int i = 0; i < 100000; i++) {
+        ss << VARINT(i);
+        size += ::GetSerializeSize(VARINT(i), 0, 0);
+        BOOST_CHECK(size == ss.size());
+    }
+
+    for (uint64_t i = 0;  i < 100000000000ULL; i += 999999937) {
+        ss << VARINT(i);
+        size += ::GetSerializeSize(VARINT(i), 0, 0);
+        BOOST_CHECK(size == ss.size());
+    }
+
+    // decode
+    for (int i = 0; i < 100000; i++) {
+        int j = -1;
+        ss >> VARINT(j);
+        BOOST_CHECK_MESSAGE(i == j, "decoded:" << j << " expected:" << i);
+    }
+
+    for (uint64_t i = 0;  i < 100000000000ULL; i += 999999937) {
+        uint64_t j = -1;
+        ss >> VARINT(j);
+        BOOST_CHECK_MESSAGE(i == j, "decoded:" << j << " expected:" << i);
+    }
+}
+
+BOOST_AUTO_TEST_CASE(compactsize)
+{
+    CDataStream ss(SER_DISK, 0);
+    vector<char>::size_type i, j;
+
+    for (i = 1; i <= MAX_SIZE; i *= 2)
+    {
+        WriteCompactSize(ss, i-1);
+        WriteCompactSize(ss, i);
+    }
+    for (i = 1; i <= MAX_SIZE; i *= 2)
+    {
+        j = ReadCompactSize(ss);
+        BOOST_CHECK_MESSAGE((i-1) == j, "decoded:" << j << " expected:" << (i-1));
+        j = ReadCompactSize(ss);
+        BOOST_CHECK_MESSAGE(i == j, "decoded:" << j << " expected:" << i);
+    }
+}
+
+static bool isCanonicalException(const std::ios_base::failure& ex)
+{
+    std::ios_base::failure expectedException("non-canonical ReadCompactSize()");
+
+    // The string returned by what() can be different for different platforms.
+    // Instead of directly comparing the ex.what() with an expected string,
+    // create an instance of exception to see if ex.what() matches 
+    // the expected explanatory string returned by the exception instance. 
+    return strcmp(expectedException.what(), ex.what()) == 0;
+}
+
+
+BOOST_AUTO_TEST_CASE(noncanonical)
+{
+    // Write some non-canonical CompactSize encodings, and
+    // make sure an exception is thrown when read back.
+    CDataStream ss(SER_DISK, 0);
+    vector<char>::size_type n;
+
+    // zero encoded with three bytes:
+    ss.write("\xfd\x00\x00", 3);
+    BOOST_CHECK_EXCEPTION(ReadCompactSize(ss), std::ios_base::failure, isCanonicalException);
+
+    // 0xfc encoded with three bytes:
+    ss.write("\xfd\xfc\x00", 3);
+    BOOST_CHECK_EXCEPTION(ReadCompactSize(ss), std::ios_base::failure, isCanonicalException);
+
+    // 0xfd encoded with three bytes is OK:
+    ss.write("\xfd\xfd\x00", 3);
+    n = ReadCompactSize(ss);
+    BOOST_CHECK(n == 0xfd);
+
+    // zero encoded with five bytes:
+    ss.write("\xfe\x00\x00\x00\x00", 5);
+    BOOST_CHECK_EXCEPTION(ReadCompactSize(ss), std::ios_base::failure, isCanonicalException);
+
+    // 0xffff encoded with five bytes:
+    ss.write("\xfe\xff\xff\x00\x00", 5);
+    BOOST_CHECK_EXCEPTION(ReadCompactSize(ss), std::ios_base::failure, isCanonicalException);
+
+    // zero encoded with nine bytes:
+    ss.write("\xff\x00\x00\x00\x00\x00\x00\x00\x00", 9);
+    BOOST_CHECK_EXCEPTION(ReadCompactSize(ss), std::ios_base::failure, isCanonicalException);
+
+    // 0x01ffffff encoded with nine bytes:
+    ss.write("\xff\xff\xff\xff\x01\x00\x00\x00\x00", 9);
+    BOOST_CHECK_EXCEPTION(ReadCompactSize(ss), std::ios_base::failure, isCanonicalException);
+}
+
+BOOST_AUTO_TEST_CASE(insert_delete)
+{
+    // Test inserting/deleting bytes.
+    CDataStream ss(SER_DISK, 0);
+    BOOST_CHECK_EQUAL(ss.size(), 0);
+
+    ss.write("\x00\x01\x02\xff", 4);
+    BOOST_CHECK_EQUAL(ss.size(), 4);
+
+    char c = (char)11;
+
+    // Inserting at beginning/end/middle:
+    ss.insert(ss.begin(), c);
+    BOOST_CHECK_EQUAL(ss.size(), 5);
+    BOOST_CHECK_EQUAL(ss[0], c);
+    BOOST_CHECK_EQUAL(ss[1], 0);
+
+    ss.insert(ss.end(), c);
+    BOOST_CHECK_EQUAL(ss.size(), 6);
+    BOOST_CHECK_EQUAL(ss[4], (char)0xff);
+    BOOST_CHECK_EQUAL(ss[5], c);
+
+    ss.insert(ss.begin()+2, c);
+    BOOST_CHECK_EQUAL(ss.size(), 7);
+    BOOST_CHECK_EQUAL(ss[2], c);
+
+    // Delete at beginning/end/middle
+    ss.erase(ss.begin());
+    BOOST_CHECK_EQUAL(ss.size(), 6);
+    BOOST_CHECK_EQUAL(ss[0], 0);
+
+    ss.erase(ss.begin()+ss.size()-1);
+    BOOST_CHECK_EQUAL(ss.size(), 5);
+    BOOST_CHECK_EQUAL(ss[4], (char)0xff);
+
+    ss.erase(ss.begin()+1);
+    BOOST_CHECK_EQUAL(ss.size(), 4);
+    BOOST_CHECK_EQUAL(ss[0], 0);
+    BOOST_CHECK_EQUAL(ss[1], 1);
+    BOOST_CHECK_EQUAL(ss[2], 2);
+    BOOST_CHECK_EQUAL(ss[3], (char)0xff);
+
+    // Make sure GetAndClear does the right thing:
+    CSerializeData d;
+    ss.GetAndClear(d);
+    BOOST_CHECK_EQUAL(ss.size(), 0);
+}
+
+BOOST_AUTO_TEST_CASE(class_methods)
+{
+    int intval(100);
+    bool boolval(true);
+    std::string stringval("testing");
+    const char* charstrval("testing charstr");
+    CMutableTransaction txval;
+    CSerializeMethodsTestSingle methodtest1(intval, boolval, stringval, charstrval, txval);
+    CSerializeMethodsTestMany methodtest2(intval, boolval, stringval, charstrval, txval);
+    CSerializeMethodsTestSingle methodtest3;
+    CSerializeMethodsTestMany methodtest4;
+    CDataStream ss(SER_DISK, PROTOCOL_VERSION);
+    BOOST_CHECK(methodtest1 == methodtest2);
+    ss << methodtest1;
+    ss >> methodtest4;
+    ss << methodtest2;
+    ss >> methodtest3;
+    BOOST_CHECK(methodtest1 == methodtest2);
+    BOOST_CHECK(methodtest2 == methodtest3);
+    BOOST_CHECK(methodtest3 == methodtest4);
+
+    CDataStream ss2(SER_DISK, PROTOCOL_VERSION, intval, boolval, stringval, FLATDATA(charstrval), txval);
+    ss2 >> methodtest3;
+    BOOST_CHECK(methodtest3 == methodtest4);
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/sha256compress_tests.cpp b/depend/zcash/src/test/sha256compress_tests.cpp
new file mode 100644
index 000000000..900d1a793
--- /dev/null
+++ b/depend/zcash/src/test/sha256compress_tests.cpp
@@ -0,0 +1,86 @@
+#include "test/test_bitcoin.h"
+#include "crypto/sha256.h"
+#include "uint256.h"
+
+#include <stdexcept>
+
+#include <boost/test/unit_test.hpp>
+
+BOOST_FIXTURE_TEST_SUITE(sha256compress_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(compression)
+{
+	{
+		unsigned char preimage[64] = {};
+		CSHA256 hasher;
+		hasher.Write(&preimage[0], 64);
+
+		uint256 digest;
+
+		hasher.FinalizeNoPadding(digest.begin());
+
+		BOOST_CHECK_MESSAGE(digest == uint256S("d8a93718eaf9feba4362d2c091d4e58ccabe9f779957336269b4b917be9856da"),
+			                digest.GetHex());
+	}
+
+	{
+		unsigned char preimage[63] = {};
+		CSHA256 hasher;
+		hasher.Write(&preimage[0], 63);
+		uint256 digest;
+		BOOST_CHECK_THROW(hasher.FinalizeNoPadding(digest.begin()), std::length_error);
+	}
+
+	{
+		unsigned char preimage[65] = {};
+		CSHA256 hasher;
+		hasher.Write(&preimage[0], 65);
+		uint256 digest;
+		BOOST_CHECK_THROW(hasher.FinalizeNoPadding(digest.begin()), std::length_error);
+	}
+
+	{
+		unsigned char n = 0x00;
+		CSHA256 hasher;
+		for (size_t i = 0; i < 64; i++) {
+			hasher.Write(&n, 1);
+		}
+		uint256 digest;
+
+		hasher.FinalizeNoPadding(digest.begin());
+
+		BOOST_CHECK_MESSAGE(digest == uint256S("d8a93718eaf9feba4362d2c091d4e58ccabe9f779957336269b4b917be9856da"),
+			                digest.GetHex());
+	}
+
+    {
+        unsigned char preimage[64] = { 'a', 'b', 'c', 'd',
+                                       'a', 'b', 'c', 'd',
+                                       'a', 'b', 'c', 'd',
+                                       'a', 'b', 'c', 'd',
+                                       'a', 'b', 'c', 'd',
+                                       'a', 'b', 'c', 'd',
+                                       'a', 'b', 'c', 'd',
+                                       'a', 'b', 'c', 'd',
+                                       'a', 'b', 'c', 'd',
+                                       'a', 'b', 'c', 'd',
+                                       'a', 'b', 'c', 'd',
+                                       'a', 'b', 'c', 'd',
+                                       'a', 'b', 'c', 'd',
+                                       'a', 'b', 'c', 'd',
+                                       'a', 'b', 'c', 'd',
+                                       'a', 'b', 'c', 'd'
+                                    };
+		CSHA256 hasher;
+        hasher.Write(&preimage[0], 64);
+
+        uint256 digest;
+
+        hasher.FinalizeNoPadding(digest.begin());
+
+        BOOST_CHECK_MESSAGE(digest == uint256S("da70ec41879e36b000281733d4deb27ddf41e8e343a38f2fabbd2d8611987d86"),
+            digest.GetHex());
+    }
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/sighash_tests.cpp b/depend/zcash/src/test/sighash_tests.cpp
new file mode 100644
index 000000000..d2d9ac4b5
--- /dev/null
+++ b/depend/zcash/src/test/sighash_tests.cpp
@@ -0,0 +1,346 @@
+// Copyright (c) 2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "consensus/upgrades.h"
+#include "consensus/validation.h"
+#include "test/data/sighash.json.h"
+#include "main.h"
+#include "test_random.h"
+#include "script/interpreter.h"
+#include "script/script.h"
+#include "serialize.h"
+#include "test/test_bitcoin.h"
+#include "test/test_util.h"
+#include "util.h"
+#include "version.h"
+
+#include <iostream>
+#include <random>
+
+#include <boost/test/unit_test.hpp>
+
+#include <rust/ed25519.h>
+#include <rust/test_harness.h>
+
+#include <univalue.h>
+
+// Old script.cpp SignatureHash function
+uint256 static SignatureHashOld(CScript scriptCode, const CTransaction& txTo, unsigned int nIn, int nHashType)
+{
+    static const uint256 one(uint256S("0000000000000000000000000000000000000000000000000000000000000001"));
+    if (nIn >= txTo.vin.size())
+    {
+        printf("ERROR: SignatureHash(): nIn=%d out of range\n", nIn);
+        return one;
+    }
+    CMutableTransaction txTmp(txTo);
+
+    // Blank out other inputs' signatures
+    for (unsigned int i = 0; i < txTmp.vin.size(); i++)
+        txTmp.vin[i].scriptSig = CScript();
+    txTmp.vin[nIn].scriptSig = scriptCode;
+
+    // Blank out some of the outputs
+    if ((nHashType & 0x1f) == SIGHASH_NONE)
+    {
+        // Wildcard payee
+        txTmp.vout.clear();
+
+        // Let the others update at will
+        for (unsigned int i = 0; i < txTmp.vin.size(); i++)
+            if (i != nIn)
+                txTmp.vin[i].nSequence = 0;
+    }
+    else if ((nHashType & 0x1f) == SIGHASH_SINGLE)
+    {
+        // Only lock-in the txout payee at same index as txin
+        unsigned int nOut = nIn;
+        if (nOut >= txTmp.vout.size())
+        {
+            printf("ERROR: SignatureHash(): nOut=%d out of range\n", nOut);
+            return one;
+        }
+        txTmp.vout.resize(nOut+1);
+        for (unsigned int i = 0; i < nOut; i++)
+            txTmp.vout[i].SetNull();
+
+        // Let the others update at will
+        for (unsigned int i = 0; i < txTmp.vin.size(); i++)
+            if (i != nIn)
+                txTmp.vin[i].nSequence = 0;
+    }
+
+    // Blank out other inputs completely, not recommended for open transactions
+    if (nHashType & SIGHASH_ANYONECANPAY)
+    {
+        txTmp.vin[0] = txTmp.vin[nIn];
+        txTmp.vin.resize(1);
+    }
+
+    // Blank out the joinsplit signature.
+    memset(&txTmp.joinSplitSig.bytes, 0, ED25519_SIGNATURE_LEN);
+
+    // Serialize and hash
+    CHashWriter ss(SER_GETHASH, 0);
+    ss << txTmp << nHashType;
+    return ss.GetHash();
+}
+
+void static RandomScript(CScript &script) {
+    static const opcodetype oplist[] = {OP_FALSE, OP_1, OP_2, OP_3, OP_CHECKSIG, OP_IF, OP_VERIF, OP_RETURN};
+    script = CScript();
+    int ops = (insecure_rand() % 10);
+    for (int i=0; i<ops; i++)
+        script << oplist[insecure_rand() % (sizeof(oplist)/sizeof(oplist[0]))];
+}
+
+// Overwinter tx version numbers are selected randomly from current version range.
+// https://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution
+// https://stackoverflow.com/a/19728404
+std::random_device rd;
+std::mt19937 rng(rd());
+std::uniform_int_distribution<int> overwinter_version_dist(
+    CTransaction::OVERWINTER_MIN_CURRENT_VERSION,
+    CTransaction::OVERWINTER_MAX_CURRENT_VERSION);
+std::uniform_int_distribution<int> sapling_version_dist(
+    CTransaction::SAPLING_MIN_CURRENT_VERSION,
+    CTransaction::SAPLING_MAX_CURRENT_VERSION);
+
+void static RandomTransaction(CMutableTransaction &tx, bool fSingle, uint32_t consensusBranchId) {
+    tx.fOverwintered = insecure_rand() % 2;
+    if (tx.fOverwintered) {
+        if (insecure_rand() % 2) {
+            tx.nVersionGroupId = SAPLING_VERSION_GROUP_ID;
+            tx.nVersion = sapling_version_dist(rng);
+        } else {
+            tx.nVersionGroupId = OVERWINTER_VERSION_GROUP_ID;
+            tx.nVersion = overwinter_version_dist(rng);
+        }
+        tx.nExpiryHeight = (insecure_rand() % 2) ? insecure_rand() % TX_EXPIRY_HEIGHT_THRESHOLD : 0;
+    } else {
+        tx.nVersion = insecure_rand() & 0x7FFFFFFF;
+    }
+    tx.vin.clear();
+    tx.vout.clear();
+    tx.vShieldedSpend.clear();
+    tx.vShieldedOutput.clear();
+    tx.vJoinSplit.clear();
+    tx.nLockTime = (insecure_rand() % 2) ? insecure_rand() : 0;
+    int ins = (insecure_rand() % 4) + 1;
+    int outs = fSingle ? ins : (insecure_rand() % 4) + 1;
+    int shielded_spends = (insecure_rand() % 4) + 1;
+    int shielded_outs = (insecure_rand() % 4) + 1;
+    int joinsplits = (insecure_rand() % 4);
+    for (int in = 0; in < ins; in++) {
+        tx.vin.push_back(CTxIn());
+        CTxIn &txin = tx.vin.back();
+        txin.prevout.hash = GetRandHash();
+        txin.prevout.n = insecure_rand() % 4;
+        RandomScript(txin.scriptSig);
+        txin.nSequence = (insecure_rand() % 2) ? insecure_rand() : (unsigned int)-1;
+    }
+    for (int out = 0; out < outs; out++) {
+        tx.vout.push_back(CTxOut());
+        CTxOut &txout = tx.vout.back();
+        txout.nValue = insecure_rand() % 100000000;
+        RandomScript(txout.scriptPubKey);
+    }
+    if (tx.nVersionGroupId == SAPLING_VERSION_GROUP_ID) {
+        tx.valueBalanceSapling = insecure_rand() % 100000000;
+        for (int spend = 0; spend < shielded_spends; spend++) {
+            SpendDescription sdesc;
+            zcash_test_harness_random_jubjub_point(sdesc.cv.begin());
+            zcash_test_harness_random_jubjub_base(sdesc.anchor.begin());
+            sdesc.nullifier = GetRandHash();
+            zcash_test_harness_random_jubjub_point(sdesc.rk.begin());
+            GetRandBytes(sdesc.zkproof.begin(), sdesc.zkproof.size());
+            tx.vShieldedSpend.push_back(sdesc);
+        }
+        for (int out = 0; out < shielded_outs; out++) {
+            OutputDescription odesc;
+            zcash_test_harness_random_jubjub_point(odesc.cv.begin());
+            zcash_test_harness_random_jubjub_base(odesc.cmu.begin());
+            zcash_test_harness_random_jubjub_point(odesc.ephemeralKey.begin());
+            GetRandBytes(odesc.encCiphertext.begin(), odesc.encCiphertext.size());
+            GetRandBytes(odesc.outCiphertext.begin(), odesc.outCiphertext.size());
+            GetRandBytes(odesc.zkproof.begin(), odesc.zkproof.size());
+            tx.vShieldedOutput.push_back(odesc);
+        }
+    }
+    // We have removed pre-Sapling Sprout support.
+    if (tx.fOverwintered && tx.nVersion >= SAPLING_TX_VERSION) {
+        for (int js = 0; js < joinsplits; js++) {
+            JSDescription jsdesc;
+            if (insecure_rand() % 2 == 0) {
+                jsdesc.vpub_old = insecure_rand() % 100000000;
+            } else {
+                jsdesc.vpub_new = insecure_rand() % 100000000;
+            }
+
+            jsdesc.anchor = GetRandHash();
+            jsdesc.nullifiers[0] = GetRandHash();
+            jsdesc.nullifiers[1] = GetRandHash();
+            jsdesc.ephemeralKey = GetRandHash();
+            jsdesc.randomSeed = GetRandHash();
+            GetRandBytes(jsdesc.ciphertexts[0].begin(), jsdesc.ciphertexts[0].size());
+            GetRandBytes(jsdesc.ciphertexts[1].begin(), jsdesc.ciphertexts[1].size());
+            {
+                libzcash::GrothProof zkproof;
+                GetRandBytes(zkproof.begin(), zkproof.size());
+                jsdesc.proof = zkproof;
+            }
+            jsdesc.macs[0] = GetRandHash();
+            jsdesc.macs[1] = GetRandHash();
+
+            tx.vJoinSplit.push_back(jsdesc);
+        }
+
+        Ed25519SigningKey joinSplitPrivKey;
+        ed25519_generate_keypair(&joinSplitPrivKey, &tx.joinSplitPubKey);
+
+        // Empty output script.
+        CScript scriptCode;
+        CTransaction signTx(tx);
+        PrecomputedTransactionData txdata(signTx, {});
+        uint256 dataToBeSigned = SignatureHash(scriptCode, signTx, NOT_AN_INPUT, SIGHASH_ALL, 0, consensusBranchId, txdata);
+
+        assert(ed25519_sign(
+            &joinSplitPrivKey,
+            dataToBeSigned.begin(), 32,
+            &tx.joinSplitSig));
+    }
+}
+
+BOOST_FIXTURE_TEST_SUITE(sighash_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(sighash_test)
+{
+    uint32_t overwinterBranchId = NetworkUpgradeInfo[Consensus::UPGRADE_OVERWINTER].nBranchId;
+    seed_insecure_rand(false);
+
+    #if defined(PRINT_SIGHASH_JSON)
+    std::cout << "[\n";
+    std::cout << "\t[\"raw_transaction, script, input_index, hashType, branchId, signature_hash (result)\"],\n";
+    #endif
+    int nRandomTests = 50000;
+
+    #if defined(PRINT_SIGHASH_JSON)
+    nRandomTests = 500;
+    #endif
+    for (int i=0; i<nRandomTests; i++) {
+        int nHashType = insecure_rand();
+        // Exclude ZFUTURE as its branch ID can't be represented as a JSON int32
+        uint32_t consensusBranchId = NetworkUpgradeInfo[insecure_rand() % (Consensus::MAX_NETWORK_UPGRADES - 1)].nBranchId;
+        CMutableTransaction txTo;
+        RandomTransaction(txTo, (nHashType & 0x1f) == SIGHASH_SINGLE, consensusBranchId);
+        CScript scriptCode;
+        RandomScript(scriptCode);
+        int nIn = insecure_rand() % txTo.vin.size();
+        // We don't generate v5 transactions here; we have separate ZIP 244 test vectors.
+        const PrecomputedTransactionData txdata(txTo, {});
+
+        uint256 sh, sho;
+        sho = SignatureHashOld(scriptCode, txTo, nIn, nHashType);
+        sh = SignatureHash(scriptCode, txTo, nIn, nHashType, 0, consensusBranchId, txdata);
+        #if defined(PRINT_SIGHASH_JSON)
+        CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+        ss << txTo;
+
+        std::cout << "\t[\"" ;
+        std::cout << HexStr(ss.begin(), ss.end()) << "\", \"";
+        std::cout << HexStr(scriptCode) << "\", ";
+        std::cout << nIn << ", ";
+        std::cout << nHashType << ", ";
+        std::cout << consensusBranchId << ", \"";
+        std::cout << (txTo.fOverwintered ? sh.GetHex() : sho.GetHex()) << "\"]";
+        if (i+1 != nRandomTests) {
+          std::cout << ",";
+        }
+        std::cout << "\n";
+        #endif
+        if (!txTo.fOverwintered) {
+            BOOST_CHECK(sh == sho);
+        }
+    }
+    #if defined(PRINT_SIGHASH_JSON)
+    std::cout << "]\n";
+    #endif
+}
+
+// Goal: check that SignatureHash generates correct hash
+BOOST_AUTO_TEST_CASE(sighash_from_data)
+{
+    UniValue tests = read_json(std::string(json_tests::sighash, json_tests::sighash + sizeof(json_tests::sighash)));
+
+    for (size_t idx = 0; idx < tests.size(); idx++) {
+        UniValue test = tests[idx];
+        std::string strTest = test.write();
+        if (test.size() < 1) // Allow for extra stuff (useful for comments)
+        {
+            BOOST_ERROR("Bad test: " << strTest);
+            continue;
+        }
+        if (test.size() == 1) continue; // comment
+
+        std::string raw_tx, raw_script, sigHashHex;
+        int nIn, nHashType;
+        uint32_t consensusBranchId;
+        uint256 sh;
+        CTransaction tx;
+        CScript scriptCode = CScript();
+
+        try {
+          // deserialize test data
+          raw_tx = test[0].get_str();
+          raw_script = test[1].get_str();
+          nIn = test[2].get_int();
+          nHashType = test[3].get_int();
+          // JSON integers are signed, so parse uint32 as int64
+          consensusBranchId = test[4].get_int64();
+          sigHashHex = test[5].get_str();
+
+          uint256 sh;
+          CDataStream stream(ParseHex(raw_tx), SER_NETWORK, PROTOCOL_VERSION);
+          stream >> tx;
+
+          CValidationState state;
+          if (tx.fOverwintered) {
+              // Note that OVERWINTER_MIN_CURRENT_VERSION and OVERWINTER_MAX_CURRENT_VERSION
+              // are checked in IsStandardTx(), not in CheckTransactionWithoutProofVerification()
+              if (tx.nVersion < OVERWINTER_MIN_TX_VERSION ||
+                  tx.nExpiryHeight >= TX_EXPIRY_HEIGHT_THRESHOLD)
+              {
+                  // Transaction must be invalid
+                  BOOST_CHECK_MESSAGE(!CheckTransactionWithoutProofVerification(tx, state), strTest);
+                  BOOST_CHECK(!state.IsValid());
+              } else {
+                  BOOST_CHECK_MESSAGE(CheckTransactionWithoutProofVerification(tx, state), strTest);
+                  BOOST_CHECK(state.IsValid());
+              }
+          } else if (tx.nVersion < SPROUT_MIN_TX_VERSION) {
+              // Transaction must be invalid
+              BOOST_CHECK_MESSAGE(!CheckTransactionWithoutProofVerification(tx, state), strTest);
+              BOOST_CHECK(!state.IsValid());
+          } else {
+              BOOST_CHECK_MESSAGE(CheckTransactionWithoutProofVerification(tx, state), strTest);
+              BOOST_CHECK(state.IsValid());
+          }
+
+          std::vector<unsigned char> raw = ParseHex(raw_script);
+          scriptCode.insert(scriptCode.end(), raw.begin(), raw.end());
+        } catch (const std::exception& ex) {
+          BOOST_ERROR("Bad test, couldn't deserialize data: " << strTest << ": " << ex.what());
+          continue;
+        } catch (...) {
+          BOOST_ERROR("Bad test, couldn't deserialize data: " << strTest);
+          continue;
+        }
+
+        // These test vectors do not include v5 transactions.
+        const PrecomputedTransactionData txdata(tx, {});
+        sh = SignatureHash(scriptCode, tx, nIn, nHashType, 0, consensusBranchId, txdata);
+        BOOST_CHECK_MESSAGE(sh.GetHex() == sigHashHex, strTest);
+    }
+}
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/sigopcount_tests.cpp b/depend/zcash/src/test/sigopcount_tests.cpp
new file mode 100644
index 000000000..58b88e686
--- /dev/null
+++ b/depend/zcash/src/test/sigopcount_tests.cpp
@@ -0,0 +1,65 @@
+// Copyright (c) 2012-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "pubkey.h"
+#include "key.h"
+#include "script/script.h"
+#include "script/standard.h"
+#include "uint256.h"
+#include "test/test_bitcoin.h"
+
+#include <vector>
+
+#include <boost/test/unit_test.hpp>
+
+using namespace std;
+
+// Helpers:
+static std::vector<unsigned char>
+Serialize(const CScript& s)
+{
+    std::vector<unsigned char> sSerialized(s.begin(), s.end());
+    return sSerialized;
+}
+
+BOOST_FIXTURE_TEST_SUITE(sigopcount_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(GetSigOpCount)
+{
+    // Test CScript::GetSigOpCount()
+    CScript s1;
+    BOOST_CHECK_EQUAL(s1.GetSigOpCount(false), 0U);
+    BOOST_CHECK_EQUAL(s1.GetSigOpCount(true), 0U);
+
+    uint160 dummy;
+    s1 << OP_1 << ToByteVector(dummy) << ToByteVector(dummy) << OP_2 << OP_CHECKMULTISIG;
+    BOOST_CHECK_EQUAL(s1.GetSigOpCount(true), 2U);
+    s1 << OP_IF << OP_CHECKSIG << OP_ENDIF;
+    BOOST_CHECK_EQUAL(s1.GetSigOpCount(true), 3U);
+    BOOST_CHECK_EQUAL(s1.GetSigOpCount(false), 21U);
+
+    CScript p2sh = GetScriptForDestination(CScriptID(s1));
+    CScript scriptSig;
+    scriptSig << OP_0 << Serialize(s1);
+    BOOST_CHECK_EQUAL(p2sh.GetSigOpCount(scriptSig), 3U);
+
+    std::vector<CPubKey> keys;
+    for (int i = 0; i < 3; i++)
+    {
+        CKey k = CKey::TestOnlyRandomKey(true);
+        keys.push_back(k.GetPubKey());
+    }
+    CScript s2 = GetScriptForMultisig(1, keys);
+    BOOST_CHECK_EQUAL(s2.GetSigOpCount(true), 3U);
+    BOOST_CHECK_EQUAL(s2.GetSigOpCount(false), 20U);
+
+    p2sh = GetScriptForDestination(CScriptID(s2));
+    BOOST_CHECK_EQUAL(p2sh.GetSigOpCount(true), 0U);
+    BOOST_CHECK_EQUAL(p2sh.GetSigOpCount(false), 0U);
+    CScript scriptSig2;
+    scriptSig2 << OP_1 << ToByteVector(dummy) << ToByteVector(dummy) << Serialize(s2);
+    BOOST_CHECK_EQUAL(p2sh.GetSigOpCount(scriptSig2), 3U);
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/skiplist_tests.cpp b/depend/zcash/src/test/skiplist_tests.cpp
new file mode 100644
index 000000000..c2a1e3bc8
--- /dev/null
+++ b/depend/zcash/src/test/skiplist_tests.cpp
@@ -0,0 +1,103 @@
+// Copyright (c) 2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "main.h"
+#include "test_random.h"
+#include "util.h"
+#include "test/test_bitcoin.h"
+
+#include <vector>
+
+#include <boost/test/unit_test.hpp>
+
+#define SKIPLIST_LENGTH 300000
+
+BOOST_FIXTURE_TEST_SUITE(skiplist_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(skiplist_test)
+{
+    std::vector<CBlockIndex> vIndex(SKIPLIST_LENGTH);
+
+    for (int i=0; i<SKIPLIST_LENGTH; i++) {
+        vIndex[i].nHeight = i;
+        vIndex[i].pprev = (i == 0) ? NULL : &vIndex[i - 1];
+        vIndex[i].BuildSkip();
+    }
+
+    for (int i=0; i<SKIPLIST_LENGTH; i++) {
+        if (i > 0) {
+            BOOST_CHECK(vIndex[i].pskip == &vIndex[vIndex[i].pskip->nHeight]);
+            BOOST_CHECK(vIndex[i].pskip->nHeight < i);
+        } else {
+            BOOST_CHECK(vIndex[i].pskip == NULL);
+        }
+    }
+
+    for (int i=0; i < 1000; i++) {
+        int from = insecure_rand() % (SKIPLIST_LENGTH - 1);
+        int to = insecure_rand() % (from + 1);
+
+        BOOST_CHECK(vIndex[SKIPLIST_LENGTH - 1].GetAncestor(from) == &vIndex[from]);
+        BOOST_CHECK(vIndex[from].GetAncestor(to) == &vIndex[to]);
+        BOOST_CHECK(vIndex[from].GetAncestor(0) == &vIndex[0]);
+    }
+}
+
+BOOST_AUTO_TEST_CASE(getlocator_test)
+{
+    // Build a main chain 100000 blocks long.
+    std::vector<uint256> vHashMain(100000);
+    std::vector<CBlockIndex> vBlocksMain(100000);
+    for (unsigned int i=0; i<vBlocksMain.size(); i++) {
+        vHashMain[i] = ArithToUint256(i); // Set the hash equal to the height, so we can quickly check the distances.
+        vBlocksMain[i].nHeight = i;
+        vBlocksMain[i].pprev = i ? &vBlocksMain[i - 1] : NULL;
+        vBlocksMain[i].phashBlock = &vHashMain[i];
+        vBlocksMain[i].BuildSkip();
+        BOOST_CHECK_EQUAL((int)UintToArith256(vBlocksMain[i].GetBlockHash()).GetLow64(), vBlocksMain[i].nHeight);
+        BOOST_CHECK(vBlocksMain[i].pprev == NULL || vBlocksMain[i].nHeight == vBlocksMain[i].pprev->nHeight + 1);
+    }
+
+    // Build a branch that splits off at block 49999, 50000 blocks long.
+    std::vector<uint256> vHashSide(50000);
+    std::vector<CBlockIndex> vBlocksSide(50000);
+    for (unsigned int i=0; i<vBlocksSide.size(); i++) {
+        vHashSide[i] = ArithToUint256(i + 50000 + (arith_uint256(1) << 128)); // Add 1<<128 to the hashes, so GetLow64() still returns the height.
+        vBlocksSide[i].nHeight = i + 50000;
+        vBlocksSide[i].pprev = i ? &vBlocksSide[i - 1] : &vBlocksMain[49999];
+        vBlocksSide[i].phashBlock = &vHashSide[i];
+        vBlocksSide[i].BuildSkip();
+        BOOST_CHECK_EQUAL((int)UintToArith256(vBlocksSide[i].GetBlockHash()).GetLow64(), vBlocksSide[i].nHeight);
+        BOOST_CHECK(vBlocksSide[i].pprev == NULL || vBlocksSide[i].nHeight == vBlocksSide[i].pprev->nHeight + 1);
+    }
+
+    // Build a CChain for the main branch.
+    CChain chain;
+    chain.SetTip(&vBlocksMain.back());
+
+    // Test 100 random starting points for locators.
+    for (int n=0; n<100; n++) {
+        int r = insecure_rand() % 150000;
+        CBlockIndex* tip = (r < 100000) ? &vBlocksMain[r] : &vBlocksSide[r - 100000];
+        CBlockLocator locator = chain.GetLocator(tip);
+
+        // The first result must be the block itself, the last one must be genesis.
+        BOOST_CHECK(locator.vHave.front() == tip->GetBlockHash());
+        BOOST_CHECK(locator.vHave.back() == vBlocksMain[0].GetBlockHash());
+
+        // Entries 1 through 11 (inclusive) go back one step each.
+        for (unsigned int i = 1; i < 12 && i < locator.vHave.size() - 1; i++) {
+            BOOST_CHECK_EQUAL(UintToArith256(locator.vHave[i]).GetLow64(), tip->nHeight - i);
+        }
+
+        // The further ones (excluding the last one) go back with exponential steps.
+        unsigned int dist = 2;
+        for (unsigned int i = 12; i < locator.vHave.size() - 1; i++) {
+            BOOST_CHECK_EQUAL(UintToArith256(locator.vHave[i - 1]).GetLow64() - UintToArith256(locator.vHave[i]).GetLow64(), dist);
+            dist *= 2;
+        }
+    }
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/streams_tests.cpp b/depend/zcash/src/test/streams_tests.cpp
new file mode 100644
index 000000000..99afd1fd0
--- /dev/null
+++ b/depend/zcash/src/test/streams_tests.cpp
@@ -0,0 +1,257 @@
+// Copyright (c) 2019 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php.
+
+#include "fs.h"
+#include "main.h"
+#include "test/test_bitcoin.h"
+#include "test/test_random.h"
+
+#include <boost/test/unit_test.hpp>
+
+BOOST_FIXTURE_TEST_SUITE(streams_tests, TestingSetup)
+
+BOOST_AUTO_TEST_CASE(streams_buffered_file)
+{
+    FILE* file = fopen("streams_test_tmp", "w+b");
+    // The value at each offset is the offset.
+    for (uint8_t j = 0; j < 40; ++j) {
+        fwrite(&j, 1, 1, file);
+    }
+    rewind(file);
+
+    // The buffer size (second arg) must be greater than the rewind
+    // amount (third arg).
+    try {
+        CBufferedFile bfbad(file, 25, 25, 222, 333);
+        BOOST_CHECK(false);
+    } catch (const std::exception& e) {
+        BOOST_CHECK(strstr(e.what(),
+                        "Rewind limit must be less than buffer size") != nullptr);
+    }
+
+    // The buffer is 25 bytes, allow rewinding 10 bytes.
+    CBufferedFile bf(file, 25, 10, 222, 333);
+    BOOST_CHECK(!bf.eof());
+
+    // These two members have no functional effect.
+    BOOST_CHECK_EQUAL(bf.GetType(), 222);
+    BOOST_CHECK_EQUAL(bf.GetVersion(), 333);
+
+    uint8_t i;
+    bf >> i;
+    BOOST_CHECK_EQUAL(i, 0);
+    bf >> i;
+    BOOST_CHECK_EQUAL(i, 1);
+
+    // After reading bytes 0 and 1, we're positioned at 2.
+    BOOST_CHECK_EQUAL(bf.GetPos(), 2);
+
+    // Rewind to offset 0, ok (within the 10 byte window).
+    BOOST_CHECK(bf.SetPos(0));
+    bf >> i;
+    BOOST_CHECK_EQUAL(i, 0);
+
+    // We can go forward to where we've been, but beyond may fail.
+    BOOST_CHECK(bf.SetPos(2));
+    bf >> i;
+    BOOST_CHECK_EQUAL(i, 2);
+
+    // If you know the maximum number of bytes that should be
+    // read to deserialize the variable, you can limit the read
+    // extent. The current file offset is 3, so the following
+    // SetLimit() allows zero bytes to be read.
+    BOOST_CHECK(bf.SetLimit(3));
+    try {
+        bf >> i;
+        BOOST_CHECK(false);
+    } catch (const std::exception& e) {
+        BOOST_CHECK(strstr(e.what(),
+                        "Read attempted past buffer limit") != nullptr);
+    }
+    // The default argument removes the limit completely.
+    BOOST_CHECK(bf.SetLimit());
+    // The read position should still be at 3 (no change).
+    BOOST_CHECK_EQUAL(bf.GetPos(), 3);
+
+    // Read from current offset, 3, forward until position 10.
+    for (uint8_t j = 3; j < 10; ++j) {
+        bf >> i;
+        BOOST_CHECK_EQUAL(i, j);
+    }
+    BOOST_CHECK_EQUAL(bf.GetPos(), 10);
+
+    // We're guaranteed (just barely) to be able to rewind to zero.
+    BOOST_CHECK(bf.SetPos(0));
+    BOOST_CHECK_EQUAL(bf.GetPos(), 0);
+    bf >> i;
+    BOOST_CHECK_EQUAL(i, 0);
+
+    // We can set the position forward again up to the farthest
+    // into the stream we've been, but no farther. (Attempting
+    // to go farther may succeed, but it's not guaranteed.)
+    BOOST_CHECK(bf.SetPos(10));
+    bf >> i;
+    BOOST_CHECK_EQUAL(i, 10);
+    BOOST_CHECK_EQUAL(bf.GetPos(), 11);
+
+    // Now it's only guaranteed that we can rewind to offset 1
+    // (current read position, 11, minus rewind amount, 10).
+    BOOST_CHECK(bf.SetPos(1));
+    BOOST_CHECK_EQUAL(bf.GetPos(), 1);
+    bf >> i;
+    BOOST_CHECK_EQUAL(i, 1);
+
+    // We can stream into large variables, even larger than
+    // the buffer size.
+    BOOST_CHECK(bf.SetPos(11));
+    {
+        uint8_t a[40 - 11];
+        bf >> FLATDATA(a);
+        for (uint8_t j = 0; j < sizeof(a); ++j) {
+            BOOST_CHECK_EQUAL(a[j], 11 + j);
+        }
+    }
+    BOOST_CHECK_EQUAL(bf.GetPos(), 40);
+
+    // We've read the entire file, the next read should throw.
+    try {
+        bf >> i;
+        BOOST_CHECK(false);
+    } catch (const std::exception& e) {
+        BOOST_CHECK(strstr(e.what(),
+                        "CBufferedFile::Fill: end of file") != nullptr);
+    }
+    // Attempting to read beyond the end sets the EOF indicator.
+    BOOST_CHECK(bf.eof());
+
+    // Still at offset 40, we can go back 10, to 30.
+    BOOST_CHECK_EQUAL(bf.GetPos(), 40);
+    BOOST_CHECK(bf.SetPos(30));
+    bf >> i;
+    BOOST_CHECK_EQUAL(i, 30);
+    BOOST_CHECK_EQUAL(bf.GetPos(), 31);
+
+    // We're too far to rewind to position zero.
+    BOOST_CHECK(!bf.SetPos(0));
+    // But we should now be positioned at least as far back as allowed
+    // by the rewind window (relative to our farthest read position, 40).
+    BOOST_CHECK(bf.GetPos() <= 30);
+
+    // We can explicitly close the file, or the destructor will do it.
+    bf.fclose();
+
+    fs::remove("streams_test_tmp");
+}
+
+BOOST_AUTO_TEST_CASE(streams_buffered_file_rand)
+{
+    // Make this test deterministic.
+    seed_insecure_rand(true);
+
+    for (int rep = 0; rep < 500; ++rep) {
+        FILE* file = fopen("streams_test_tmp", "w+b");
+        size_t fileSize = GetRandInt(256);
+        for (uint8_t i = 0; i < fileSize; ++i) {
+            fwrite(&i, 1, 1, file);
+        }
+        rewind(file);
+
+        size_t bufSize = GetRandInt(300) + 1;
+        size_t rewindSize = GetRandInt(bufSize);
+        CBufferedFile bf(file, bufSize, rewindSize, 222, 333);
+        size_t currentPos = 0;
+        size_t maxPos = 0;
+        for (int step = 0; step < 100; ++step) {
+            if (currentPos >= fileSize)
+                break;
+
+            // We haven't read to the end of the file yet.
+            BOOST_CHECK(!bf.eof());
+            BOOST_CHECK_EQUAL(bf.GetPos(), currentPos);
+
+            // Pretend the file consists of a series of objects of varying
+            // sizes; the boundaries of the objects can interact arbitrarily
+            // with the CBufferFile's internal buffer. These first three
+            // cases simulate objects of various sizes (1, 2, 5 bytes).
+            switch (GetRandInt(5)) {
+            case 0: {
+                uint8_t a[1];
+                if (currentPos + 1 > fileSize)
+                    continue;
+                bf.SetLimit(currentPos + 1);
+                bf >> FLATDATA(a);
+                for (uint8_t i = 0; i < 1; ++i) {
+                    BOOST_CHECK_EQUAL(a[i], currentPos);
+                    currentPos++;
+                }
+                break;
+            }
+            case 1: {
+                uint8_t a[2];
+                if (currentPos + 2 > fileSize)
+                    continue;
+                bf.SetLimit(currentPos + 2);
+                bf >> FLATDATA(a);
+                for (uint8_t i = 0; i < 2; ++i) {
+                    BOOST_CHECK_EQUAL(a[i], currentPos);
+                    currentPos++;
+                }
+                break;
+            }
+            case 2: {
+                uint8_t a[5];
+                if (currentPos + 5 > fileSize)
+                    continue;
+                bf.SetLimit(currentPos + 5);
+                bf >> FLATDATA(a);
+                for (uint8_t i = 0; i < 5; ++i) {
+                    BOOST_CHECK_EQUAL(a[i], currentPos);
+                    currentPos++;
+                }
+                break;
+            }
+            case 3: {
+                // Find a byte value (that is at or ahead of the current position).
+                size_t find = currentPos + GetRandInt(8);
+                if (find >= fileSize)
+                    find = fileSize - 1;
+                bf.FindByte(static_cast<char>(find));
+                // The value at each offset is the offset.
+                BOOST_CHECK_EQUAL(bf.GetPos(), find);
+                currentPos = find;
+
+                bf.SetLimit(currentPos + 1);
+                uint8_t i;
+                bf >> i;
+                BOOST_CHECK_EQUAL(i, currentPos);
+                currentPos++;
+                break;
+            }
+            case 4: {
+                size_t requestPos = GetRandInt(maxPos + 4);
+                bool okay = bf.SetPos(requestPos);
+                // The new position may differ from the requested position
+                // because we may not be able to rewind beyond the rewind
+                // window, and we may not be able to move forward beyond the
+                // farthest position we've reached so far.
+                currentPos = bf.GetPos();
+                BOOST_CHECK_EQUAL(okay, currentPos == requestPos);
+                // Check that we can position within the rewind window.
+                if (requestPos <= maxPos &&
+                    maxPos > rewindSize &&
+                    requestPos >= maxPos - rewindSize) {
+                    // We requested a position within the rewind window.
+                    BOOST_CHECK(okay);
+                }
+                break;
+            }
+            }
+            if (maxPos < currentPos)
+                maxPos = currentPos;
+        }
+    }
+    fs::remove("streams_test_tmp");
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/test_bitcoin.cpp b/depend/zcash/src/test/test_bitcoin.cpp
new file mode 100644
index 000000000..82ff0e314
--- /dev/null
+++ b/depend/zcash/src/test/test_bitcoin.cpp
@@ -0,0 +1,217 @@
+// Copyright (c) 2011-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#define BOOST_TEST_MODULE Bitcoin Test Suite
+
+#include "test_bitcoin.h"
+
+#include "chainparams.h"
+#include "consensus/consensus.h"
+#include "consensus/validation.h"
+#ifdef ENABLE_MINING
+#include "crypto/equihash.h"
+#endif
+#include "fs.h"
+#include "key.h"
+#include "main.h"
+#include "miner.h"
+#include "pubkey.h"
+#include "random.h"
+#include "txdb.h"
+#include "txmempool.h"
+#include "ui_interface.h"
+#include "rpc/server.h"
+#include "rpc/register.h"
+
+#include <boost/test/unit_test.hpp>
+#include <boost/thread.hpp>
+#include <sodium.h>
+#include <tracing.h>
+
+#include "librustzcash.h"
+
+const std::function<std::string(const char*)> G_TRANSLATION_FUN = nullptr;
+
+CClientUIInterface uiInterface; // Declared but not defined in ui_interface.h
+
+TracingHandle* pTracingHandle = nullptr;
+uint256 insecure_rand_seed = GetRandHash();
+FastRandomContext insecure_rand_ctx(insecure_rand_seed);
+
+extern bool fPrintToConsole;
+extern void noui_connect();
+
+BasicTestingSetup::BasicTestingSetup(const std::string& chainName)
+{
+    assert(sodium_init() != -1);
+    ECC_Start();
+    SetupEnvironment();
+    SetupNetworking();
+
+    // Uncomment this to log all errors to stdout so we see them in test output.
+    // We don't enable this by default because several tests intentionally cause
+    // verbose error output (while exercising failure cases).
+    // if (pTracingHandle == nullptr) {
+    //     std::string initialFilter = "error";
+    //     pTracingHandle = tracing_init(
+    //         nullptr, 0,
+    //         initialFilter.c_str(),
+    //         false);
+    // }
+
+    fCheckBlockIndex = true;
+    SelectParams(chainName);
+    noui_connect();
+    TestSetIBD(false);
+}
+
+BasicTestingSetup::~BasicTestingSetup()
+{
+    ECC_Stop();
+}
+
+TestingSetup::TestingSetup(const std::string& chainName) : BasicTestingSetup(chainName)
+{
+    const CChainParams& chainparams = Params();
+        // Ideally we'd move all the RPC tests to the functional testing framework
+        // instead of unit tests, but for now we need these here.
+        RegisterAllCoreRPCCommands(tableRPC);
+
+        // Save current path, in case a test changes it
+        orig_current_path = fs::current_path();
+
+        ClearDatadirCache();
+        pathTemp = fs::temp_directory_path() / strprintf("test_bitcoin_%lu_%i", (unsigned long)GetTime(), (int)(GetRand(100000)));
+        fs::create_directories(pathTemp);
+        mapArgs["-datadir"] = pathTemp.string();
+        pblocktree = new CBlockTreeDB(1 << 20, true);
+        pcoinsdbview = new CCoinsViewDB(1 << 23, true);
+        pcoinsTip = new CCoinsViewCache(pcoinsdbview);
+        InitBlockIndex(chainparams);
+        nScriptCheckThreads = 3;
+        for (int i=0; i < nScriptCheckThreads-1; i++)
+            threadGroup.create_thread(&ThreadScriptCheck);
+        RegisterNodeSignals(GetNodeSignals());
+}
+
+TestingSetup::~TestingSetup()
+{
+        UnregisterNodeSignals(GetNodeSignals());
+        threadGroup.interrupt_all();
+        threadGroup.join_all();
+        UnloadBlockIndex();
+        delete pcoinsTip;
+        delete pcoinsdbview;
+        delete pblocktree;
+
+        // Restore the previous current path so temporary directory can be deleted
+        fs::current_path(orig_current_path);
+
+        fs::remove_all(pathTemp);
+}
+
+#ifdef ENABLE_MINING
+TestChain100Setup::TestChain100Setup() : TestingSetup(CBaseChainParams::REGTEST)
+{
+    // Generate a 100-block chain:
+    coinbaseKey = CKey::TestOnlyRandomKey(true);
+    CScript scriptPubKey = CScript() <<  ToByteVector(coinbaseKey.GetPubKey()) << OP_CHECKSIG;
+    for (int i = 0; i < COINBASE_MATURITY; i++)
+    {
+        std::vector<CMutableTransaction> noTxns;
+        CBlock b = CreateAndProcessBlock(noTxns, scriptPubKey);
+        coinbaseTxns.push_back(b.vtx[0]);
+    }
+}
+
+//
+// Create a new block with just given transactions, coinbase paying to
+// scriptPubKey, and try to add it to the current chain.
+//
+CBlock
+TestChain100Setup::CreateAndProcessBlock(const std::vector<CMutableTransaction>& txns, const CScript& scriptPubKey)
+{
+    const CChainParams& chainparams = Params();
+    unsigned int n = chainparams.GetConsensus().nEquihashN;
+    unsigned int k = chainparams.GetConsensus().nEquihashK;
+
+    boost::shared_ptr<CReserveScript> mAddr(new CReserveScript());
+    mAddr->reserveScript = scriptPubKey;
+
+    CBlockTemplate *pblocktemplate = CreateNewBlock(chainparams, mAddr);
+    CBlock& block = pblocktemplate->block;
+
+    // Replace mempool-selected txns with just coinbase plus passed-in txns:
+    block.vtx.resize(1);
+    for (const CMutableTransaction& tx : txns)
+        block.vtx.push_back(tx);
+    // IncrementExtraNonce creates a valid coinbase and merkleRoot
+    unsigned int extraNonce = 0;
+    IncrementExtraNonce(pblocktemplate, chainActive.Tip(), extraNonce, chainparams.GetConsensus());
+
+    // Hash state
+    eh_HashState eh_state;
+    EhInitialiseState(n, k, eh_state);
+
+    // I = the block header minus nonce and solution.
+    CEquihashInput I{block};
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << I;
+
+    // H(I||...
+    eh_state.Update((unsigned char*)&ss[0], ss.size());
+
+    bool found = false;
+    do {
+        block.nNonce = ArithToUint256(UintToArith256(block.nNonce) + 1);
+
+        // H(I||V||...
+        eh_HashState curr_state(eh_state);
+        curr_state.Update(block.nNonce.begin(), block.nNonce.size());
+
+        // (x_1, x_2, ...) = A(I, V, n, k)
+        std::function<bool(std::vector<unsigned char>)> validBlock =
+                [&block, &chainparams](std::vector<unsigned char> soln) {
+            block.nSolution = soln;
+            return CheckProofOfWork(block.GetHash(), block.nBits, chainparams.GetConsensus());
+        };
+        found = EhBasicSolveUncancellable(n, k, curr_state, validBlock);
+    } while (!found);
+
+    CValidationState state;
+    ProcessNewBlock(state, chainparams, NULL, &block, true, NULL);
+
+    CBlock result = block;
+    delete pblocktemplate;
+    return result;
+}
+
+TestChain100Setup::~TestChain100Setup()
+{
+}
+#endif // ENABLE_MINING
+
+
+CTxMemPoolEntry TestMemPoolEntryHelper::FromTx(CMutableTransaction &tx, CTxMemPool *pool) {
+    CTransaction txn(tx);
+    bool hasNoDependencies = pool ? pool->HasNoInputsOf(tx) : hadNoDependencies;
+
+    return CTxMemPoolEntry(txn, nFee, nTime, dPriority, nHeight,
+                           hasNoDependencies, spendsCoinbase, sigOpCount, nBranchId);
+}
+
+void Shutdown(void* parg)
+{
+  exit(0);
+}
+
+void StartShutdown()
+{
+  exit(0);
+}
+
+bool ShutdownRequested()
+{
+  return false;
+}
diff --git a/depend/zcash/src/test/test_bitcoin.h b/depend/zcash/src/test/test_bitcoin.h
new file mode 100644
index 000000000..1f42927a7
--- /dev/null
+++ b/depend/zcash/src/test/test_bitcoin.h
@@ -0,0 +1,95 @@
+#ifndef BITCOIN_TEST_TEST_BITCOIN_H
+#define BITCOIN_TEST_TEST_BITCOIN_H
+
+#include "chainparamsbase.h"
+#include "consensus/upgrades.h"
+#include "fs.h"
+#include "key.h"
+#include "pubkey.h"
+#include "txdb.h"
+
+#include <boost/thread.hpp>
+
+/** Basic testing setup.
+ * This just configures logging and chain parameters.
+ */
+struct BasicTestingSetup {
+    ECCVerifyHandle globalVerifyHandle;
+
+    BasicTestingSetup(const std::string& chainName = CBaseChainParams::MAIN);
+    ~BasicTestingSetup();
+};
+
+/** Testing setup that configures a complete environment.
+ * Included are data directory, coins database, script check threads setup.
+ */
+struct TestingSetup: public BasicTestingSetup {
+    CCoinsViewDB *pcoinsdbview;
+    fs::path orig_current_path;
+    fs::path pathTemp;
+    boost::thread_group threadGroup;
+
+    TestingSetup(const std::string& chainName = CBaseChainParams::MAIN);
+    ~TestingSetup();
+};
+
+class CBlock;
+struct CMutableTransaction;
+class CScript;
+
+#ifdef ENABLE_MINING
+//
+// Testing fixture that pre-creates a
+// 100-block REGTEST-mode block chain
+//
+struct TestChain100Setup : public TestingSetup {
+    TestChain100Setup();
+
+    // Create a new block with just given transactions, coinbase paying to
+    // scriptPubKey, and try to add it to the current chain.
+    CBlock CreateAndProcessBlock(const std::vector<CMutableTransaction>& txns,
+                                 const CScript& scriptPubKey);
+
+    ~TestChain100Setup();
+
+    std::vector<CTransaction> coinbaseTxns; // For convenience, coinbase transactions
+    CKey coinbaseKey; // private/public key needed to spend coinbase transactions
+};
+#endif // ENABLE_MINING
+
+class CTxMemPoolEntry;
+class CTxMemPool;
+
+struct TestMemPoolEntryHelper
+{
+    // Default values
+    CAmount nFee;
+    int64_t nTime;
+    double dPriority;
+    unsigned int nHeight;
+    bool hadNoDependencies;
+    bool spendsCoinbase;
+    unsigned int sigOpCount;
+    uint32_t nBranchId;
+
+    TestMemPoolEntryHelper() :
+        nFee(0), nTime(0), dPriority(0.0), nHeight(1),
+        hadNoDependencies(false), spendsCoinbase(false), sigOpCount(1),
+        nBranchId(SPROUT_BRANCH_ID) { }
+
+    CTxMemPoolEntry FromTx(CMutableTransaction &tx, CTxMemPool *pool = NULL);
+
+    // Change the default value
+    TestMemPoolEntryHelper &Fee(CAmount _fee) { nFee = _fee; return *this; }
+    TestMemPoolEntryHelper &Time(int64_t _time) { nTime = _time; return *this; }
+    TestMemPoolEntryHelper &Priority(double _priority) { dPriority = _priority; return *this; }
+    TestMemPoolEntryHelper &Height(unsigned int _height) { nHeight = _height; return *this; }
+    TestMemPoolEntryHelper &HadNoDependencies(bool _hnd) { hadNoDependencies = _hnd; return *this; }
+    TestMemPoolEntryHelper &SpendsCoinbase(bool _flag) { spendsCoinbase = _flag; return *this; }
+    TestMemPoolEntryHelper &SigOps(unsigned int _sigops) { sigOpCount = _sigops; return *this; }
+    TestMemPoolEntryHelper &BranchId(uint32_t _branchId) { nBranchId = _branchId; return *this; }
+};
+
+void CheckRPCThrows(std::string rpcString, std::string expectedErrorMessage);
+
+#endif
diff --git a/depend/zcash/src/test/test_random.h b/depend/zcash/src/test/test_random.h
new file mode 100644
index 000000000..9d9bd7bbb
--- /dev/null
+++ b/depend/zcash/src/test/test_random.h
@@ -0,0 +1,29 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_TEST_TEST_RANDOM_H
+#define BITCOIN_TEST_TEST_RANDOM_H
+
+#include "random.h"
+
+extern uint256 insecure_rand_seed;
+extern FastRandomContext insecure_rand_ctx;
+
+static inline void seed_insecure_rand(bool fDeterministic = false)
+{
+    if (fDeterministic) {
+        insecure_rand_seed = uint256();
+    } else {
+        insecure_rand_seed = GetRandHash();
+    }
+    insecure_rand_ctx = FastRandomContext(insecure_rand_seed);
+}
+
+static inline uint32_t insecure_rand(void)
+{
+    return insecure_rand_ctx.rand32();
+}
+
+#endif
diff --git a/depend/zcash/src/test/test_util.cpp b/depend/zcash/src/test/test_util.cpp
new file mode 100644
index 000000000..1636ab6b0
--- /dev/null
+++ b/depend/zcash/src/test/test_util.cpp
@@ -0,0 +1,120 @@
+#include "test_util.h"
+
+#include <boost/algorithm/string/classification.hpp>
+#include <boost/algorithm/string/split.hpp>
+#include <boost/assign/list_of.hpp>
+#include <boost/test/unit_test.hpp>
+#include <map>
+#include <vector>
+
+#include "script/interpreter.h"
+#include "rpc/client.h"
+#include "rpc/server.h"
+
+static std::map<std::string, unsigned int> mapFlagNames = boost::assign::map_list_of
+    (std::string("NONE"), (unsigned int)SCRIPT_VERIFY_NONE)
+    (std::string("P2SH"), (unsigned int)SCRIPT_VERIFY_P2SH)
+    (std::string("STRICTENC"), (unsigned int)SCRIPT_VERIFY_STRICTENC)
+    (std::string("LOW_S"), (unsigned int)SCRIPT_VERIFY_LOW_S)
+    (std::string("SIGPUSHONLY"), (unsigned int)SCRIPT_VERIFY_SIGPUSHONLY)
+    (std::string("MINIMALDATA"), (unsigned int)SCRIPT_VERIFY_MINIMALDATA)
+    (std::string("NULLDUMMY"), (unsigned int)SCRIPT_VERIFY_NULLDUMMY)
+    (std::string("DISCOURAGE_UPGRADABLE_NOPS"), (unsigned int)SCRIPT_VERIFY_DISCOURAGE_UPGRADABLE_NOPS)
+    (std::string("CLEANSTACK"), (unsigned int)SCRIPT_VERIFY_CLEANSTACK)
+    (std::string("CHECKLOCKTIMEVERIFY"), (unsigned int)SCRIPT_VERIFY_CHECKLOCKTIMEVERIFY);
+
+UniValue
+read_json(const std::string& jsondata)
+{
+    UniValue v;
+
+    if (!v.read(jsondata) || !v.isArray())
+    {
+        BOOST_ERROR("Parse error.");
+        return UniValue(UniValue::VARR);
+    }
+    return v.get_array();
+}
+
+unsigned int ParseScriptFlags(std::string strFlags)
+{
+    if (strFlags.empty()) {
+        return 0;
+    }
+    unsigned int flags = 0;
+    std::vector<std::string> words;
+    boost::algorithm::split(words, strFlags, boost::algorithm::is_any_of(","));
+
+    for (std::string word : words)
+    {
+        if (!mapFlagNames.count(word))
+            BOOST_ERROR("Bad test: unknown verification flag '" << word << "'");
+        flags |= mapFlagNames[word];
+    }
+
+    return flags;
+}
+
+std::string FormatScriptFlags(unsigned int flags)
+{
+    if (flags == 0) {
+        return "";
+    }
+    std::string ret;
+    std::map<std::string, unsigned int>::const_iterator it = mapFlagNames.begin();
+    while (it != mapFlagNames.end()) {
+        if (flags & it->second) {
+            ret += it->first + ",";
+        }
+        it++;
+    }
+    return ret.substr(0, ret.size() - 1);
+}
+
+UniValue createArgs(int nRequired, const char* address1, const char* address2)
+{
+    UniValue result(UniValue::VARR);
+    result.push_back(nRequired);
+    UniValue addresses(UniValue::VARR);
+    if (address1) addresses.push_back(address1);
+    if (address2) addresses.push_back(address2);
+    result.push_back(addresses);
+    return result;
+}
+
+UniValue CallRPC(std::string args)
+{
+    std::vector<std::string> vArgs;
+    boost::split(vArgs, args, boost::is_any_of(" \t"));
+    std::string strMethod = vArgs[0];
+    vArgs.erase(vArgs.begin());
+    // Handle empty strings the same way as CLI
+    for (auto i = 0; i < vArgs.size(); i++) {
+        if (vArgs[i] == "\"\"") {
+            vArgs[i] = "";
+        }
+    }
+    UniValue params = RPCConvertValues(strMethod, vArgs);
+
+    rpcfn_type method = tableRPC[strMethod]->actor;
+    try {
+        UniValue result = (*method)(params, false);
+        return result;
+    }
+    catch (const UniValue& objError) {
+        throw std::runtime_error(find_value(objError, "message").get_str());
+    }
+}
+
+void CheckRPCThrows(std::string rpcString, std::string expectedErrorMessage) {
+    try {
+        CallRPC(rpcString);
+        // Note: CallRPC catches (const UniValue& objError) and rethrows a runtime_error
+        BOOST_FAIL("Should have caused an error");
+    } catch (const std::runtime_error& e) {
+        BOOST_CHECK_EQUAL(expectedErrorMessage, e.what());
+    } catch(const std::exception& e) {
+        BOOST_FAIL(std::string("Unexpected exception: ") + typeid(e).name() + ", message=\"" + e.what() + "\"");
+    }
+}
+
diff --git a/depend/zcash/src/test/test_util.h b/depend/zcash/src/test/test_util.h
new file mode 100644
index 000000000..acad077bf
--- /dev/null
+++ b/depend/zcash/src/test/test_util.h
@@ -0,0 +1,15 @@
+#ifndef BITCOIN_TEST_TEST_UTIL_H
+#define BITCOIN_TEST_TEST_UTIL_H
+
+#include <string>
+
+#include <univalue.h>
+
+UniValue read_json(const std::string& jsondata);
+unsigned int ParseScriptFlags(std::string strFlags);
+std::string FormatScriptFlags(unsigned int flags);
+UniValue createArgs(int nRequired, const char* address1 = NULL, const char* address2 = NULL);
+UniValue CallRPC(std::string args);
+
+
+#endif
diff --git a/depend/zcash/src/test/torcontrol_tests.cpp b/depend/zcash/src/test/torcontrol_tests.cpp
new file mode 100644
index 000000000..0e9ff78de
--- /dev/null
+++ b/depend/zcash/src/test/torcontrol_tests.cpp
@@ -0,0 +1,199 @@
+// Copyright (c) 2017 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+//
+#include "test/test_bitcoin.h"
+#include "torcontrol.cpp"
+
+#include <boost/test/unit_test.hpp>
+
+
+BOOST_FIXTURE_TEST_SUITE(torcontrol_tests, BasicTestingSetup)
+
+void CheckSplitTorReplyLine(std::string input, std::string command, std::string args)
+{
+    BOOST_TEST_MESSAGE(std::string("CheckSplitTorReplyLine(") + input + ")");
+    auto ret = SplitTorReplyLine(input);
+    BOOST_CHECK_EQUAL(ret.first, command);
+    BOOST_CHECK_EQUAL(ret.second, args);
+}
+
+BOOST_AUTO_TEST_CASE(util_SplitTorReplyLine)
+{
+    // Data we should receive during normal usage
+    CheckSplitTorReplyLine(
+        "PROTOCOLINFO PIVERSION",
+        "PROTOCOLINFO", "PIVERSION");
+    CheckSplitTorReplyLine(
+        "AUTH METHODS=COOKIE,SAFECOOKIE COOKIEFILE=\"/home/x/.tor/control_auth_cookie\"",
+        "AUTH", "METHODS=COOKIE,SAFECOOKIE COOKIEFILE=\"/home/x/.tor/control_auth_cookie\"");
+    CheckSplitTorReplyLine(
+        "AUTH METHODS=NULL",
+        "AUTH", "METHODS=NULL");
+    CheckSplitTorReplyLine(
+        "AUTH METHODS=HASHEDPASSWORD",
+        "AUTH", "METHODS=HASHEDPASSWORD");
+    CheckSplitTorReplyLine(
+        "VERSION Tor=\"0.2.9.8 (git-a0df013ea241b026)\"",
+        "VERSION", "Tor=\"0.2.9.8 (git-a0df013ea241b026)\"");
+    CheckSplitTorReplyLine(
+        "AUTHCHALLENGE SERVERHASH=aaaa SERVERNONCE=bbbb",
+        "AUTHCHALLENGE", "SERVERHASH=aaaa SERVERNONCE=bbbb");
+
+    // Other valid inputs
+    CheckSplitTorReplyLine("COMMAND", "COMMAND", "");
+    CheckSplitTorReplyLine("COMMAND SOME  ARGS", "COMMAND", "SOME  ARGS");
+
+    // These inputs are valid because PROTOCOLINFO accepts an OtherLine that is
+    // just an OptArguments, which enables multiple spaces to be present
+    // between the command and arguments.
+    CheckSplitTorReplyLine("COMMAND  ARGS", "COMMAND", " ARGS");
+    CheckSplitTorReplyLine("COMMAND   EVEN+more  ARGS", "COMMAND", "  EVEN+more  ARGS");
+}
+
+void CheckParseTorReplyMapping(std::string input, std::map<std::string,std::string> expected)
+{
+    BOOST_TEST_MESSAGE(std::string("CheckParseTorReplyMapping(") + input + ")");
+    auto ret = ParseTorReplyMapping(input);
+    BOOST_CHECK_EQUAL(ret.size(), expected.size());
+    auto r_it = ret.begin();
+    auto e_it = expected.begin();
+    while (r_it != ret.end() && e_it != expected.end()) {
+        BOOST_CHECK_EQUAL(r_it->first, e_it->first);
+        BOOST_CHECK_EQUAL(r_it->second, e_it->second);
+        r_it++;
+        e_it++;
+    }
+}
+
+BOOST_AUTO_TEST_CASE(util_ParseTorReplyMapping)
+{
+    // Data we should receive during normal usage
+    CheckParseTorReplyMapping(
+        "METHODS=COOKIE,SAFECOOKIE COOKIEFILE=\"/home/x/.tor/control_auth_cookie\"", {
+            {"METHODS", "COOKIE,SAFECOOKIE"},
+            {"COOKIEFILE", "/home/x/.tor/control_auth_cookie"},
+        });
+    CheckParseTorReplyMapping(
+        "METHODS=NULL", {
+            {"METHODS", "NULL"},
+        });
+    CheckParseTorReplyMapping(
+        "METHODS=HASHEDPASSWORD", {
+            {"METHODS", "HASHEDPASSWORD"},
+        });
+    CheckParseTorReplyMapping(
+        "Tor=\"0.2.9.8 (git-a0df013ea241b026)\"", {
+            {"Tor", "0.2.9.8 (git-a0df013ea241b026)"},
+        });
+    CheckParseTorReplyMapping(
+        "SERVERHASH=aaaa SERVERNONCE=bbbb", {
+            {"SERVERHASH", "aaaa"},
+            {"SERVERNONCE", "bbbb"},
+        });
+    CheckParseTorReplyMapping(
+        "ServiceID=exampleonion1234", {
+            {"ServiceID", "exampleonion1234"},
+        });
+    CheckParseTorReplyMapping(
+        "PrivateKey=RSA1024:BLOB", {
+            {"PrivateKey", "RSA1024:BLOB"},
+        });
+    CheckParseTorReplyMapping(
+        "ClientAuth=bob:BLOB", {
+            {"ClientAuth", "bob:BLOB"},
+        });
+
+    // Other valid inputs
+    CheckParseTorReplyMapping(
+        "Foo=Bar=Baz Spam=Eggs", {
+            {"Foo", "Bar=Baz"},
+            {"Spam", "Eggs"},
+        });
+    CheckParseTorReplyMapping(
+        "Foo=\"Bar=Baz\"", {
+            {"Foo", "Bar=Baz"},
+        });
+    CheckParseTorReplyMapping(
+        "Foo=\"Bar Baz\"", {
+            {"Foo", "Bar Baz"},
+        });
+
+    // Escapes
+    CheckParseTorReplyMapping(
+        "Foo=\"Bar\\ Baz\"", {
+            {"Foo", "Bar Baz"},
+        });
+    CheckParseTorReplyMapping(
+        "Foo=\"Bar\\Baz\"", {
+            {"Foo", "BarBaz"},
+        });
+    CheckParseTorReplyMapping(
+        "Foo=\"Bar\\@Baz\"", {
+            {"Foo", "Bar@Baz"},
+        });
+    CheckParseTorReplyMapping(
+        "Foo=\"Bar\\\"Baz\" Spam=\"\\\"Eggs\\\"\"", {
+            {"Foo", "Bar\"Baz"},
+            {"Spam", "\"Eggs\""},
+        });
+    CheckParseTorReplyMapping(
+        "Foo=\"Bar\\\\Baz\"", {
+            {"Foo", "Bar\\Baz"},
+        });
+
+    // C escapes
+    CheckParseTorReplyMapping(
+        "Foo=\"Bar\\nBaz\\t\" Spam=\"\\rEggs\" Octals=\"\\1a\\11\\17\\18\\81\\377\\378\\400\\2222\" Final=Check", {
+            {"Foo", "Bar\nBaz\t"},
+            {"Spam", "\rEggs"},
+            {"Octals", "\1a\11\17\1" "881\377\37" "8\40" "0\222" "2"},
+            {"Final", "Check"},
+        });
+    CheckParseTorReplyMapping(
+        "Valid=Mapping Escaped=\"Escape\\\\\"", {
+            {"Valid", "Mapping"},
+            {"Escaped", "Escape\\"},
+        });
+    CheckParseTorReplyMapping(
+        "Valid=Mapping Bare=\"Escape\\\"", {});
+    CheckParseTorReplyMapping(
+        "OneOctal=\"OneEnd\\1\" TwoOctal=\"TwoEnd\\11\"", {
+            {"OneOctal", "OneEnd\1"},
+            {"TwoOctal", "TwoEnd\11"},
+        });
+
+    // Special handling for null case
+    // (needed because string comparison reads the null as end-of-string)
+    BOOST_TEST_MESSAGE(std::string("CheckParseTorReplyMapping(Null=\"\\0\")"));
+    auto ret = ParseTorReplyMapping("Null=\"\\0\"");
+    BOOST_CHECK_EQUAL(ret.size(), 1);
+    auto r_it = ret.begin();
+    BOOST_CHECK_EQUAL(r_it->first, "Null");
+    BOOST_CHECK_EQUAL(r_it->second.size(), 1);
+    BOOST_CHECK_EQUAL(r_it->second[0], '\0');
+
+    // A more complex valid grammar. PROTOCOLINFO accepts a VersionLine that
+    // takes a key=value pair followed by an OptArguments, making this valid.
+    // Because an OptArguments contains no semantic data, there is no point in
+    // parsing it.
+    CheckParseTorReplyMapping(
+        "SOME=args,here MORE optional=arguments  here", {
+            {"SOME", "args,here"},
+        });
+
+    // Inputs that are effectively invalid under the target grammar.
+    // PROTOCOLINFO accepts an OtherLine that is just an OptArguments, which
+    // would make these inputs valid. However,
+    // - This parser is never used in that situation, because the
+    //   SplitTorReplyLine parser enables OtherLine to be skipped.
+    // - Even if these were valid, an OptArguments contains no semantic data,
+    //   so there is no point in parsing it.
+    CheckParseTorReplyMapping("ARGS", {});
+    CheckParseTorReplyMapping("MORE ARGS", {});
+    CheckParseTorReplyMapping("MORE  ARGS", {});
+    CheckParseTorReplyMapping("EVEN more=ARGS", {});
+    CheckParseTorReplyMapping("EVEN+more ARGS", {});
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/transaction_tests.cpp b/depend/zcash/src/test/transaction_tests.cpp
new file mode 100644
index 000000000..8be1ea016
--- /dev/null
+++ b/depend/zcash/src/test/transaction_tests.cpp
@@ -0,0 +1,947 @@
+// Copyright (c) 2011-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "test/data/tx_invalid.json.h"
+#include "test/data/tx_valid.json.h"
+#include "test/data/zip0244.json.h"
+#include "test/test_bitcoin.h"
+
+#include "init.h"
+#include "clientversion.h"
+#include "checkqueue.h"
+#include "consensus/upgrades.h"
+#include "consensus/validation.h"
+#include "core_io.h"
+#include "key.h"
+#include "keystore.h"
+#include "main.h"
+#include "policy/policy.h"
+#include "proof_verifier.h"
+#include "script/script.h"
+#include "script/script_error.h"
+#include "script/sign.h"
+#include "test/test_util.h"
+#include "primitives/transaction.h"
+#include "transaction_builder.h"
+#include "utiltest.h"
+
+#include <array>
+#include <map>
+#include <string>
+
+#include <boost/assign/list_of.hpp>
+#include <boost/test/unit_test.hpp>
+#include <boost/test/data/test_case.hpp>
+
+#include <rust/ed25519.h>
+#include <rust/orchard.h>
+
+#include <univalue.h>
+
+#include "zcash/Note.hpp"
+#include "zcash/Address.hpp"
+#include "zcash/Proof.hpp"
+
+using namespace std;
+
+// Subclass of CTransaction which doesn't call UpdateHash when constructing
+// from a CMutableTransaction.  This enables us to create a CTransaction
+// with bad values which normally trigger an exception during construction.
+class UNSAFE_CTransaction : public CTransaction {
+    public:
+        UNSAFE_CTransaction(const CMutableTransaction &tx) : CTransaction(tx, true) {}
+};
+
+BOOST_FIXTURE_TEST_SUITE(transaction_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(tx_valid)
+{
+    uint32_t consensusBranchId = SPROUT_BRANCH_ID;
+
+    // Read tests from test/data/tx_valid.json
+    // Format is an array of arrays
+    // Inner arrays are either [ "comment" ]
+    // or [[[prevout hash, prevout index, prevout scriptPubKey], [input 2], ...],"], serializedTransaction, verifyFlags
+    // ... where all scripts are stringified scripts.
+    //
+    // verifyFlags is a comma separated list of script verification flags to apply, or "NONE"
+    UniValue tests = read_json(std::string(json_tests::tx_valid, json_tests::tx_valid + sizeof(json_tests::tx_valid)));
+    std::string comment("");
+
+    auto verifier = ProofVerifier::Strict();
+    ScriptError err;
+    for (size_t idx = 0; idx < tests.size(); idx++) {
+        UniValue test = tests[idx];
+        string strTest = test.write();
+        if (test[0].isArray())
+        {
+            if (test.size() != 3 || !test[1].isStr() || !test[2].isStr())
+            {
+                BOOST_ERROR("Bad test: " << strTest << comment);
+                continue;
+            }
+
+            map<COutPoint, CScript> mapprevOutScriptPubKeys;
+            UniValue inputs = test[0].get_array();
+            bool fValid = true;
+            for (size_t inpIdx = 0; inpIdx < inputs.size(); inpIdx++) {
+	        const UniValue& input = inputs[inpIdx];
+                if (!input.isArray())
+                {
+                    fValid = false;
+                    break;
+                }
+                UniValue vinput = input.get_array();
+                if (vinput.size() != 3)
+                {
+                    fValid = false;
+                    break;
+                }
+
+                mapprevOutScriptPubKeys[COutPoint(uint256S(vinput[0].get_str()), vinput[1].get_int())] = ParseScript(vinput[2].get_str());
+            }
+            if (!fValid)
+            {
+                BOOST_ERROR("Bad test: " << strTest << comment);
+                continue;
+            }
+
+            string transaction = test[1].get_str();
+            CDataStream stream(ParseHex(transaction), SER_NETWORK, PROTOCOL_VERSION);
+            CTransaction tx;
+            stream >> tx;
+
+            CValidationState state;
+            BOOST_CHECK_MESSAGE(CheckTransaction(tx, state, verifier), strTest + comment);
+            BOOST_CHECK_MESSAGE(state.IsValid(), comment);
+
+            // None of these test vectors use ZIP 244.
+            assert(tx.nVersion < ZIP225_TX_VERSION);
+            PrecomputedTransactionData txdata(tx, {});
+            for (unsigned int i = 0; i < tx.vin.size(); i++)
+            {
+                if (!mapprevOutScriptPubKeys.count(tx.vin[i].prevout))
+                {
+                    BOOST_ERROR("Bad test: " << strTest << comment);
+                    break;
+                }
+
+                CAmount amount = 0;
+                unsigned int verify_flags = ParseScriptFlags(test[2].get_str());
+                BOOST_CHECK_MESSAGE(VerifyScript(tx.vin[i].scriptSig, mapprevOutScriptPubKeys[tx.vin[i].prevout],
+                                                 verify_flags, TransactionSignatureChecker(&tx, txdata, i, amount), consensusBranchId, &err),
+                                    strTest + comment);
+                BOOST_CHECK_MESSAGE(err == SCRIPT_ERR_OK, ScriptErrorString(err) + comment);
+            }
+
+            comment = "";
+        }
+        else if (test.size() == 1)
+        {
+            comment += "\n# ";
+            comment += test[0].write();
+        }
+    }
+}
+
+BOOST_AUTO_TEST_CASE(tx_invalid)
+{
+    uint32_t consensusBranchId = SPROUT_BRANCH_ID;
+
+    // Read tests from test/data/tx_invalid.json
+    // Format is an array of arrays
+    // Inner arrays are either [ "comment" ]
+    // or [[[prevout hash, prevout index, prevout scriptPubKey], [input 2], ...],"], serializedTransaction, verifyFlags
+    // ... where all scripts are stringified scripts.
+    //
+    // verifyFlags is a comma separated list of script verification flags to apply, or "NONE"
+    UniValue tests = read_json(std::string(json_tests::tx_invalid, json_tests::tx_invalid + sizeof(json_tests::tx_invalid)));
+    std::string comment("");
+
+    auto verifier = ProofVerifier::Strict();
+    ScriptError err;
+    for (size_t idx = 0; idx < tests.size(); idx++) {
+        UniValue test = tests[idx];
+        string strTest = test.write();
+        if (test[0].isArray())
+        {
+            if (test.size() != 3 || !test[1].isStr() || !test[2].isStr())
+            {
+                BOOST_ERROR("Bad test: " << strTest << comment);
+                continue;
+            }
+
+            map<COutPoint, CScript> mapprevOutScriptPubKeys;
+            UniValue inputs = test[0].get_array();
+            bool fValid = true;
+	    for (size_t inpIdx = 0; inpIdx < inputs.size(); inpIdx++) {
+	        const UniValue& input = inputs[inpIdx];
+                if (!input.isArray())
+                {
+                    fValid = false;
+                    break;
+                }
+                UniValue vinput = input.get_array();
+                if (vinput.size() != 3)
+                {
+                    fValid = false;
+                    break;
+                }
+
+                mapprevOutScriptPubKeys[COutPoint(uint256S(vinput[0].get_str()), vinput[1].get_int())] = ParseScript(vinput[2].get_str());
+            }
+            if (!fValid)
+            {
+                BOOST_ERROR("Bad test: " << strTest << comment);
+                continue;
+            }
+
+            string transaction = test[1].get_str();
+            CDataStream stream(ParseHex(transaction), SER_NETWORK, PROTOCOL_VERSION);
+            CTransaction tx;
+            try {
+                stream >> tx;
+            } catch (std::ios_base::failure) {
+                // Invalid transaction was caught at parse time by the Rust logic.
+                continue;
+            }
+
+            CValidationState state;
+            fValid = CheckTransaction(tx, state, verifier) && state.IsValid();
+
+            // None of these test vectors use ZIP 244.
+            assert(tx.nVersion < ZIP225_TX_VERSION);
+            PrecomputedTransactionData txdata(tx, {});
+            for (unsigned int i = 0; i < tx.vin.size() && fValid; i++)
+            {
+                if (!mapprevOutScriptPubKeys.count(tx.vin[i].prevout))
+                {
+                    BOOST_ERROR("Bad test: " << strTest << comment);
+                    break;
+                }
+
+                unsigned int verify_flags = ParseScriptFlags(test[2].get_str());
+                CAmount amount = 0;
+                fValid = VerifyScript(tx.vin[i].scriptSig, mapprevOutScriptPubKeys[tx.vin[i].prevout],
+                                      verify_flags, TransactionSignatureChecker(&tx, txdata, i, amount), consensusBranchId, &err);
+            }
+            BOOST_CHECK_MESSAGE(!fValid, strTest + comment);
+            BOOST_CHECK_MESSAGE(err != SCRIPT_ERR_OK, ScriptErrorString(err) + comment);
+
+            comment = "";
+        }
+        else if (test.size() == 1)
+        {
+            comment += "\n# ";
+            comment += test[0].write();
+        }
+    }
+}
+
+BOOST_AUTO_TEST_CASE(basic_transaction_tests)
+{
+    // Random real transaction (e2769b09e784f32f62ef849763d4f45b98e07ba658647343b915ff832b110436)
+    unsigned char ch[] = {0x01, 0x00, 0x00, 0x00, 0x01, 0x6b, 0xff, 0x7f, 0xcd, 0x4f, 0x85, 0x65, 0xef, 0x40, 0x6d, 0xd5, 0xd6, 0x3d, 0x4f, 0xf9, 0x4f, 0x31, 0x8f, 0xe8, 0x20, 0x27, 0xfd, 0x4d, 0xc4, 0x51, 0xb0, 0x44, 0x74, 0x01, 0x9f, 0x74, 0xb4, 0x00, 0x00, 0x00, 0x00, 0x8c, 0x49, 0x30, 0x46, 0x02, 0x21, 0x00, 0xda, 0x0d, 0xc6, 0xae, 0xce, 0xfe, 0x1e, 0x06, 0xef, 0xdf, 0x05, 0x77, 0x37, 0x57, 0xde, 0xb1, 0x68, 0x82, 0x09, 0x30, 0xe3, 0xb0, 0xd0, 0x3f, 0x46, 0xf5, 0xfc, 0xf1, 0x50, 0xbf, 0x99, 0x0c, 0x02, 0x21, 0x00, 0xd2, 0x5b, 0x5c, 0x87, 0x04, 0x00, 0x76, 0xe4, 0xf2, 0x53, 0xf8, 0x26, 0x2e, 0x76, 0x3e, 0x2d, 0xd5, 0x1e, 0x7f, 0xf0, 0xbe, 0x15, 0x77, 0x27, 0xc4, 0xbc, 0x42, 0x80, 0x7f, 0x17, 0xbd, 0x39, 0x01, 0x41, 0x04, 0xe6, 0xc2, 0x6e, 0xf6, 0x7d, 0xc6, 0x10, 0xd2, 0xcd, 0x19, 0x24, 0x84, 0x78, 0x9a, 0x6c, 0xf9, 0xae, 0xa9, 0x93, 0x0b, 0x94, 0x4b, 0x7e, 0x2d, 0xb5, 0x34, 0x2b, 0x9d, 0x9e, 0x5b, 0x9f, 0xf7, 0x9a, 0xff, 0x9a, 0x2e, 0xe1, 0x97, 0x8d, 0xd7, 0xfd, 0x01, 0xdf, 0xc5, 0x22, 0xee, 0x02, 0x28, 0x3d, 0x3b, 0x06, 0xa9, 0xd0, 0x3a, 0xcf, 0x80, 0x96, 0x96, 0x8d, 0x7d, 0xbb, 0x0f, 0x91, 0x78, 0xff, 0xff, 0xff, 0xff, 0x02, 0x8b, 0xa7, 0x94, 0x0e, 0x00, 0x00, 0x00, 0x00, 0x19, 0x76, 0xa9, 0x14, 0xba, 0xde, 0xec, 0xfd, 0xef, 0x05, 0x07, 0x24, 0x7f, 0xc8, 0xf7, 0x42, 0x41, 0xd7, 0x3b, 0xc0, 0x39, 0x97, 0x2d, 0x7b, 0x88, 0xac, 0x40, 0x94, 0xa8, 0x02, 0x00, 0x00, 0x00, 0x00, 0x19, 0x76, 0xa9, 0x14, 0xc1, 0x09, 0x32, 0x48, 0x3f, 0xec, 0x93, 0xed, 0x51, 0xf5, 0xfe, 0x95, 0xe7, 0x25, 0x59, 0xf2, 0xcc, 0x70, 0x43, 0xf9, 0x88, 0xac, 0x00, 0x00, 0x00, 0x00, 0x00};
+    vector<unsigned char> vch(ch, ch + sizeof(ch) -1);
+    CDataStream stream(vch, SER_DISK, CLIENT_VERSION);
+    CMutableTransaction tx;
+    stream >> tx;
+    CValidationState state;
+    auto verifier = ProofVerifier::Strict();
+    BOOST_CHECK_MESSAGE(CheckTransaction(tx, state, verifier) && state.IsValid(), "Simple deserialized transaction should be valid.");
+
+    // Check that duplicate txins fail
+    tx.vin.push_back(tx.vin[0]);
+    BOOST_CHECK_MESSAGE(!CheckTransaction(tx, state, verifier) || !state.IsValid(), "Transaction with duplicate txins should be invalid.");
+}
+
+//
+// Helper: create two dummy transactions, each with
+// two outputs.  The first has 11 and 50 CENT outputs
+// paid to a TX_PUBKEY, the second 21 and 22 CENT outputs
+// paid to a TX_PUBKEYHASH.
+//
+static std::vector<CMutableTransaction>
+SetupDummyInputs(CBasicKeyStore& keystoreRet, CCoinsViewCache& coinsRet)
+{
+    std::vector<CMutableTransaction> dummyTransactions;
+    dummyTransactions.resize(2);
+
+    // Add some keys to the keystore:
+    CKey key[4];
+    for (int i = 0; i < 4; i++)
+    {
+        key[i] = CKey::TestOnlyRandomKey(i % 2);
+        keystoreRet.AddKey(key[i]);
+    }
+
+    // Create some dummy input transactions
+    dummyTransactions[0].vout.resize(2);
+    dummyTransactions[0].vout[0].nValue = 11*CENT;
+    dummyTransactions[0].vout[0].scriptPubKey << ToByteVector(key[0].GetPubKey()) << OP_CHECKSIG;
+    dummyTransactions[0].vout[1].nValue = 50*CENT;
+    dummyTransactions[0].vout[1].scriptPubKey << ToByteVector(key[1].GetPubKey()) << OP_CHECKSIG;
+    coinsRet.ModifyCoins(dummyTransactions[0].GetHash())->FromTx(dummyTransactions[0], 0);
+
+    dummyTransactions[1].vout.resize(2);
+    dummyTransactions[1].vout[0].nValue = 21*CENT;
+    dummyTransactions[1].vout[0].scriptPubKey = GetScriptForDestination(key[2].GetPubKey().GetID());
+    dummyTransactions[1].vout[1].nValue = 22*CENT;
+    dummyTransactions[1].vout[1].scriptPubKey = GetScriptForDestination(key[3].GetPubKey().GetID());
+    coinsRet.ModifyCoins(dummyTransactions[1].GetHash())->FromTx(dummyTransactions[1], 0);
+
+    return dummyTransactions;
+}
+
+void test_simple_sapling_invalidity(uint32_t consensusBranchId, CMutableTransaction tx)
+{
+    {
+        CMutableTransaction newTx(tx);
+        CValidationState state;
+
+        BOOST_CHECK(!CheckTransactionWithoutProofVerification(newTx, state));
+        BOOST_CHECK(state.GetRejectReason() == "bad-txns-no-source-of-funds");
+    }
+    {
+        CMutableTransaction newTx(tx);
+        CValidationState state;
+
+        newTx.vShieldedSpend.push_back(SpendDescription());
+        newTx.vShieldedSpend[0].nullifier = GetRandHash();
+
+        BOOST_CHECK(!CheckTransactionWithoutProofVerification(newTx, state));
+        BOOST_CHECK(state.GetRejectReason() == "bad-txns-no-sink-of-funds");
+    }
+    {
+        // Ensure that nullifiers are never duplicated within a transaction.
+        CMutableTransaction newTx(tx);
+        CValidationState state;
+
+        newTx.vShieldedSpend.push_back(SpendDescription());
+        newTx.vShieldedSpend[0].nullifier = GetRandHash();
+
+        newTx.vShieldedOutput.push_back(OutputDescription());
+
+        newTx.vShieldedSpend.push_back(SpendDescription());
+        newTx.vShieldedSpend[1].nullifier = newTx.vShieldedSpend[0].nullifier;
+
+        BOOST_CHECK(!CheckTransactionWithoutProofVerification(newTx, state));
+        BOOST_CHECK(state.GetRejectReason() == "bad-spend-description-nullifiers-duplicate");
+
+        newTx.vShieldedSpend[1].nullifier = GetRandHash();
+
+        BOOST_CHECK(CheckTransactionWithoutProofVerification(newTx, state));
+    }
+    {
+        CMutableTransaction newTx(tx);
+        CValidationState state;
+
+        // Create a coinbase transaction
+        CTxIn vin;
+        vin.prevout = COutPoint();
+        newTx.vin.push_back(vin);
+        CTxOut vout;
+        vout.nValue = 1;
+        newTx.vout.push_back(vout);
+
+        newTx.vShieldedSpend.push_back(SpendDescription());
+
+        BOOST_CHECK(!CheckTransactionWithoutProofVerification(newTx, state));
+        BOOST_CHECK(state.GetRejectReason() == "bad-cb-has-spend-description");
+    }
+}
+
+void test_simple_joinsplit_invalidity(uint32_t consensusBranchId, CMutableTransaction tx)
+{
+    auto verifier = ProofVerifier::Strict();
+    auto orchardAuth = orchard::AuthValidator::Disabled();
+    {
+        // Ensure that empty vin/vout remain invalid without
+        // joinsplits.
+        CMutableTransaction newTx(tx);
+        CValidationState state;
+        AssumeShieldedInputsExistAndAreSpendable baseView;
+        CCoinsViewCache view(&baseView);
+
+        Ed25519SigningKey joinSplitPrivKey;
+        ed25519_generate_keypair(&joinSplitPrivKey, &newTx.joinSplitPubKey);
+
+        // No joinsplits, vin and vout, means it should be invalid.
+        BOOST_CHECK(!CheckTransactionWithoutProofVerification(newTx, state));
+        BOOST_CHECK(state.GetRejectReason() == "bad-txns-no-source-of-funds");
+
+        newTx.vin.push_back(CTxIn(uint256S("0000000000000000000000000000000000000000000000000000000000000001"), 0));
+
+        BOOST_CHECK(!CheckTransactionWithoutProofVerification(newTx, state));
+        BOOST_CHECK(state.GetRejectReason() == "bad-txns-no-sink-of-funds");
+
+        newTx.vJoinSplit.push_back(JSDescription());
+        JSDescription *jsdesc = &newTx.vJoinSplit[0];
+
+        jsdesc->nullifiers[0] = GetRandHash();
+        jsdesc->nullifiers[1] = GetRandHash();
+
+        // Fake coins being spent.
+        std::vector<CTxOut> allPrevOutputs;
+        allPrevOutputs.resize(newTx.vin.size());
+        const PrecomputedTransactionData txdata(newTx, allPrevOutputs);
+
+        BOOST_CHECK(CheckTransactionWithoutProofVerification(newTx, state));
+        BOOST_CHECK(ContextualCheckTransaction(newTx, state, Params(), 0, true));
+        BOOST_CHECK(!ContextualCheckShieldedInputs(newTx, txdata, state, view, orchardAuth, Params().GetConsensus(), consensusBranchId, false, true));
+        BOOST_CHECK(state.GetRejectReason() == "bad-txns-invalid-joinsplit-signature");
+
+        // Empty output script.
+        CScript scriptCode;
+        CTransaction signTx(newTx);
+        uint256 dataToBeSigned = SignatureHash(scriptCode, signTx, NOT_AN_INPUT, SIGHASH_ALL, 0, consensusBranchId, txdata);
+
+        assert(ed25519_sign(
+            &joinSplitPrivKey,
+            dataToBeSigned.begin(), 32,
+            &newTx.joinSplitSig));
+
+        state = CValidationState();
+        BOOST_CHECK(CheckTransactionWithoutProofVerification(newTx, state));
+        BOOST_CHECK(ContextualCheckTransaction(newTx, state, Params(), 0, true));
+        BOOST_CHECK(ContextualCheckShieldedInputs(newTx, txdata, state, view, orchardAuth, Params().GetConsensus(), consensusBranchId, false, true));
+        BOOST_CHECK_EQUAL(state.GetRejectReason(), "");
+    }
+    {
+        // Ensure that values within the joinsplit are well-formed.
+        CMutableTransaction newTx(tx);
+        CValidationState state;
+
+        newTx.vJoinSplit.push_back(JSDescription());
+
+        JSDescription *jsdesc = &newTx.vJoinSplit[0];
+        jsdesc->vpub_old = -1;
+
+        BOOST_CHECK_THROW((CTransaction(newTx)), std::ios_base::failure);
+        BOOST_CHECK(!CheckTransaction(UNSAFE_CTransaction(newTx), state, verifier));
+        BOOST_CHECK(state.GetRejectReason() == "bad-txns-vpub_old-negative");
+
+        jsdesc->vpub_old = MAX_MONEY + 1;
+
+        BOOST_CHECK_THROW((CTransaction(newTx)), std::ios_base::failure);
+        BOOST_CHECK(!CheckTransaction(UNSAFE_CTransaction(newTx), state, verifier));
+        BOOST_CHECK(state.GetRejectReason() == "bad-txns-vpub_old-toolarge");
+
+        jsdesc->vpub_old = 0;
+        jsdesc->vpub_new = -1;
+
+        BOOST_CHECK_THROW((CTransaction(newTx)), std::ios_base::failure);
+        BOOST_CHECK(!CheckTransaction(UNSAFE_CTransaction(newTx), state, verifier));
+        BOOST_CHECK(state.GetRejectReason() == "bad-txns-vpub_new-negative");
+
+        jsdesc->vpub_new = MAX_MONEY + 1;
+
+        BOOST_CHECK_THROW((CTransaction(newTx)), std::ios_base::failure);
+        BOOST_CHECK(!CheckTransaction(UNSAFE_CTransaction(newTx), state, verifier));
+        BOOST_CHECK(state.GetRejectReason() == "bad-txns-vpub_new-toolarge");
+
+        jsdesc->vpub_new = (MAX_MONEY / 2) + 10;
+
+        newTx.vJoinSplit.push_back(JSDescription());
+
+        JSDescription *jsdesc2 = &newTx.vJoinSplit[1];
+        jsdesc2->vpub_new = (MAX_MONEY / 2) + 10;
+
+        BOOST_CHECK(!CheckTransaction(newTx, state, verifier));
+        BOOST_CHECK(state.GetRejectReason() == "bad-txns-txintotal-toolarge");
+    }
+    {
+        // Ensure that nullifiers are never duplicated within a transaction.
+        CMutableTransaction newTx(tx);
+        CValidationState state;
+
+        newTx.vJoinSplit.push_back(JSDescription());
+        JSDescription *jsdesc = &newTx.vJoinSplit[0];
+
+        jsdesc->nullifiers[0] = GetRandHash();
+        jsdesc->nullifiers[1] = jsdesc->nullifiers[0];
+
+        BOOST_CHECK(!CheckTransaction(newTx, state, verifier));
+        BOOST_CHECK(state.GetRejectReason() == "bad-joinsplits-nullifiers-duplicate");
+
+        jsdesc->nullifiers[1] = GetRandHash();
+
+        newTx.vJoinSplit.push_back(JSDescription());
+        jsdesc = &newTx.vJoinSplit[0]; // Fixes #2026. Related PR #2078.
+        JSDescription *jsdesc2 = &newTx.vJoinSplit[1];
+
+        jsdesc2->nullifiers[0] = GetRandHash();
+        jsdesc2->nullifiers[1] = jsdesc->nullifiers[0];
+
+        BOOST_CHECK(!CheckTransaction(newTx, state, verifier));
+        BOOST_CHECK(state.GetRejectReason() == "bad-joinsplits-nullifiers-duplicate");
+    }
+    {
+        // Ensure that coinbase transactions do not have joinsplits.
+        CMutableTransaction newTx(tx);
+        CValidationState state;
+
+        newTx.vJoinSplit.push_back(JSDescription());
+        JSDescription *jsdesc = &newTx.vJoinSplit[0];
+        jsdesc->nullifiers[0] = GetRandHash();
+        jsdesc->nullifiers[1] = GetRandHash();
+
+        newTx.vin.push_back(CTxIn(uint256(), -1));
+
+        {
+            CTransaction finalNewTx(newTx);
+            BOOST_CHECK(finalNewTx.IsCoinBase());
+        }
+        BOOST_CHECK(!CheckTransaction(newTx, state, verifier));
+        BOOST_CHECK(state.GetRejectReason() == "bad-cb-has-joinsplits");
+    }
+}
+
+BOOST_AUTO_TEST_CASE(test_simple_joinsplit_invalidity_driver) {
+    {
+        CMutableTransaction mtx;
+        mtx.nVersion = 2;
+        test_simple_joinsplit_invalidity(SPROUT_BRANCH_ID, mtx);
+    }
+    {
+        // Switch to regtest parameters so we can activate Overwinter
+        SelectParams(CBaseChainParams::REGTEST);
+
+        CMutableTransaction mtx;
+        mtx.fOverwintered = true;
+        mtx.nVersionGroupId = OVERWINTER_VERSION_GROUP_ID;
+        mtx.nVersion = OVERWINTER_TX_VERSION;
+
+        UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+        test_simple_joinsplit_invalidity(NetworkUpgradeInfo[Consensus::UPGRADE_OVERWINTER].nBranchId, mtx);
+        UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+
+        // Test Sapling things
+        mtx.nVersionGroupId = SAPLING_VERSION_GROUP_ID;
+        mtx.nVersion = SAPLING_TX_VERSION;
+
+        UpdateNetworkUpgradeParameters(Consensus::UPGRADE_SAPLING, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+        test_simple_sapling_invalidity(NetworkUpgradeInfo[Consensus::UPGRADE_SAPLING].nBranchId, mtx);
+        UpdateNetworkUpgradeParameters(Consensus::UPGRADE_SAPLING, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+
+        // Switch back to mainnet parameters as originally selected in test fixture
+        SelectParams(CBaseChainParams::MAIN);
+    }
+}
+
+// Parameterized testing over consensus branch ids
+BOOST_DATA_TEST_CASE(test_Get, boost::unit_test::data::xrange(static_cast<int>(Consensus::MAX_NETWORK_UPGRADES)))
+{
+    uint32_t consensusBranchId = NetworkUpgradeInfo[sample].nBranchId;
+
+    CBasicKeyStore keystore;
+    CCoinsView coinsDummy;
+    CCoinsViewCache coins(&coinsDummy);
+    std::vector<CMutableTransaction> dummyTransactions = SetupDummyInputs(keystore, coins);
+
+    CMutableTransaction t1;
+    t1.vin.resize(3);
+    t1.vin[0].prevout.hash = dummyTransactions[0].GetHash();
+    t1.vin[0].prevout.n = 1;
+    t1.vin[0].scriptSig << std::vector<unsigned char>(65, 0);
+    t1.vin[1].prevout.hash = dummyTransactions[1].GetHash();
+    t1.vin[1].prevout.n = 0;
+    t1.vin[1].scriptSig << std::vector<unsigned char>(65, 0) << std::vector<unsigned char>(33, 4);
+    t1.vin[2].prevout.hash = dummyTransactions[1].GetHash();
+    t1.vin[2].prevout.n = 1;
+    t1.vin[2].scriptSig << std::vector<unsigned char>(65, 0) << std::vector<unsigned char>(33, 4);
+    t1.vout.resize(2);
+    t1.vout[0].nValue = 90*CENT;
+    t1.vout[0].scriptPubKey << OP_1;
+    // Meaningless value, but we need it for the Rust code to parse this.
+    t1.vout[1].nValue = CENT;
+
+    BOOST_CHECK(AreInputsStandard(t1, coins, consensusBranchId));
+    BOOST_CHECK_EQUAL(coins.GetValueIn(t1), (50+21+22)*CENT);
+
+    // Adding extra junk to the scriptSig should make it non-standard:
+    t1.vin[0].scriptSig << OP_11;
+    BOOST_CHECK(!AreInputsStandard(t1, coins, consensusBranchId));
+
+    // ... as should not having enough:
+    t1.vin[0].scriptSig = CScript();
+    BOOST_CHECK(!AreInputsStandard(t1, coins, consensusBranchId));
+}
+
+BOOST_AUTO_TEST_CASE(test_big_overwinter_transaction) {
+    uint32_t consensusBranchId = NetworkUpgradeInfo[Consensus::UPGRADE_OVERWINTER].nBranchId;
+    CMutableTransaction mtx;
+    mtx.fOverwintered = true;
+    mtx.nVersion = OVERWINTER_TX_VERSION;
+    mtx.nVersionGroupId = OVERWINTER_VERSION_GROUP_ID;
+
+    CKey key = CKey::TestOnlyRandomKey(false);
+    CBasicKeyStore keystore;
+    keystore.AddKeyPubKey(key, key.GetPubKey());
+    CKeyID hash = key.GetPubKey().GetID();
+    CScript scriptPubKey = GetScriptForDestination(hash);
+
+    vector<int> sigHashes;
+    sigHashes.push_back(SIGHASH_NONE | SIGHASH_ANYONECANPAY);
+    sigHashes.push_back(SIGHASH_SINGLE | SIGHASH_ANYONECANPAY);
+    sigHashes.push_back(SIGHASH_ALL | SIGHASH_ANYONECANPAY);
+    sigHashes.push_back(SIGHASH_NONE);
+    sigHashes.push_back(SIGHASH_SINGLE);
+    sigHashes.push_back(SIGHASH_ALL);
+
+    // create a big transaction of 4500 inputs signed by the same key
+    for(uint32_t ij = 0; ij < 4500; ij++) {
+        uint32_t i = mtx.vin.size();
+        uint256 prevId;
+        prevId.SetHex("0000000000000000000000000000000000000000000000000000000000000100");
+        COutPoint outpoint(prevId, i);
+
+        mtx.vin.resize(mtx.vin.size() + 1);
+        mtx.vin[i].prevout = outpoint;
+        mtx.vin[i].scriptSig = CScript();
+
+        mtx.vout.resize(mtx.vout.size() + 1);
+        mtx.vout[i].nValue = 1000;
+        mtx.vout[i].scriptPubKey = CScript() << OP_1;
+    }
+
+    // Fake coins being spent.
+    std::vector<CTxOut> allPrevOutputs;
+    allPrevOutputs.resize(mtx.vin.size());
+    PrecomputedTransactionData txdata(mtx, allPrevOutputs);
+
+    // sign all inputs
+    for(uint32_t i = 0; i < mtx.vin.size(); i++) {
+        bool hashSigned = SignSignature(keystore, scriptPubKey, mtx, txdata, i, 1000, sigHashes.at(i % sigHashes.size()), consensusBranchId);
+        assert(hashSigned);
+    }
+
+    CTransaction tx;
+    CDataStream ssout(SER_NETWORK, PROTOCOL_VERSION);
+    ssout << mtx;
+    ssout >> tx;
+
+    // check all inputs concurrently, with the cache
+    boost::thread_group threadGroup;
+    CCheckQueue<CScriptCheck> scriptcheckqueue(128);
+    CCheckQueueControl<CScriptCheck> control(&scriptcheckqueue);
+
+    for (int i=0; i<20; i++)
+        threadGroup.create_thread(boost::bind(&CCheckQueue<CScriptCheck>::Thread, boost::ref(scriptcheckqueue)));
+
+    CCoins coins;
+    coins.nVersion = 1;
+    coins.fCoinBase = false;
+    for(uint32_t i = 0; i < mtx.vin.size(); i++) {
+        CTxOut txout;
+        txout.nValue = 1000;
+        txout.scriptPubKey = scriptPubKey;
+        coins.vout.push_back(txout);
+    }
+
+    for(uint32_t i = 0; i < mtx.vin.size(); i++) {
+        std::vector<CScriptCheck> vChecks;
+        CScriptCheck check(coins, tx, i, SCRIPT_VERIFY_P2SH, false, consensusBranchId, &txdata);
+        vChecks.push_back(CScriptCheck());
+        check.swap(vChecks.back());
+        control.Add(vChecks);
+    }
+
+    bool controlCheck = control.Wait();
+    assert(controlCheck);
+
+    threadGroup.interrupt_all();
+    threadGroup.join_all();
+}
+
+BOOST_AUTO_TEST_CASE(test_IsStandard)
+{
+    LOCK(cs_main);
+    auto chainparams = Params();
+    CBasicKeyStore keystore;
+    CCoinsView coinsDummy;
+    CCoinsViewCache coins(&coinsDummy);
+    std::vector<CMutableTransaction> dummyTransactions = SetupDummyInputs(keystore, coins);
+
+    CMutableTransaction t;
+    t.vin.resize(1);
+    t.vin[0].prevout.hash = dummyTransactions[0].GetHash();
+    t.vin[0].prevout.n = 1;
+    t.vin[0].scriptSig << std::vector<unsigned char>(65, 0);
+    t.vout.resize(1);
+    t.vout[0].nValue = 90*CENT;
+    CKey key = CKey::TestOnlyRandomKey(true);
+    t.vout[0].scriptPubKey = GetScriptForDestination(key.GetPubKey().GetID());
+
+    string reason;
+    BOOST_CHECK(IsStandardTx(t, reason, chainparams));
+
+    // Check dust with default relay fee:
+    CAmount nDustThreshold = 182 * minRelayTxFee.GetFeePerK()/1000 * 3;
+    BOOST_CHECK_EQUAL(nDustThreshold, 54);
+    // dust:
+    t.vout[0].nValue = nDustThreshold - 1;
+    BOOST_CHECK(!IsStandardTx(t, reason, chainparams));
+    // not dust:
+    t.vout[0].nValue = nDustThreshold;
+    BOOST_CHECK(IsStandardTx(t, reason, chainparams));
+
+    // Check dust with odd relay fee to verify rounding:
+    // nDustThreshold = 182 * 1234 / 1000 * 3
+    minRelayTxFee = CFeeRate(1234);
+    // dust:
+    t.vout[0].nValue = 672 - 1;
+    BOOST_CHECK(!IsStandardTx(t, reason, chainparams));
+    // not dust:
+    t.vout[0].nValue = 672;
+    BOOST_CHECK(IsStandardTx(t, reason, chainparams));
+    minRelayTxFee = CFeeRate(DEFAULT_MIN_RELAY_TX_FEE);
+
+    t.vout[0].scriptPubKey = CScript() << OP_1;
+    BOOST_CHECK(!IsStandardTx(t, reason, chainparams));
+
+    // MAX_OP_RETURN_RELAY-byte TX_NULL_DATA (standard)
+    t.vout[0].scriptPubKey = CScript() << OP_RETURN << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef3804678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38");
+    BOOST_CHECK_EQUAL(MAX_OP_RETURN_RELAY, t.vout[0].scriptPubKey.size());
+    BOOST_CHECK(IsStandardTx(t, reason, chainparams));
+
+    // MAX_OP_RETURN_RELAY+1-byte TX_NULL_DATA (non-standard)
+    t.vout[0].scriptPubKey = CScript() << OP_RETURN << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef3804678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef3800");
+    BOOST_CHECK_EQUAL(MAX_OP_RETURN_RELAY + 1, t.vout[0].scriptPubKey.size());
+    BOOST_CHECK(!IsStandardTx(t, reason, chainparams));
+
+    // Data payload can be encoded in any way...
+    t.vout[0].scriptPubKey = CScript() << OP_RETURN << ParseHex("");
+    BOOST_CHECK(IsStandardTx(t, reason, chainparams));
+    t.vout[0].scriptPubKey = CScript() << OP_RETURN << ParseHex("00") << ParseHex("01");
+    BOOST_CHECK(IsStandardTx(t, reason, chainparams));
+    // OP_RESERVED *is* considered to be a PUSHDATA type opcode by IsPushOnly()!
+    t.vout[0].scriptPubKey = CScript() << OP_RETURN << OP_RESERVED << -1 << 0 << ParseHex("01") << 2 << 3 << 4 << 5 << 6 << 7 << 8 << 9 << 10 << 11 << 12 << 13 << 14 << 15 << 16;
+    BOOST_CHECK(IsStandardTx(t, reason, chainparams));
+    t.vout[0].scriptPubKey = CScript() << OP_RETURN << 0 << ParseHex("01") << 2 << ParseHex("ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff");
+    BOOST_CHECK(IsStandardTx(t, reason, chainparams));
+
+    // ...so long as it only contains PUSHDATA's
+    t.vout[0].scriptPubKey = CScript() << OP_RETURN << OP_RETURN;
+    BOOST_CHECK(!IsStandardTx(t, reason, chainparams));
+
+    // TX_NULL_DATA w/o PUSHDATA
+    t.vout.resize(1);
+    t.vout[0].nValue = 0; // Needed for Rust parser
+    t.vout[0].scriptPubKey = CScript() << OP_RETURN;
+    BOOST_CHECK(IsStandardTx(t, reason, chainparams));
+
+    // Only one TX_NULL_DATA permitted in all cases
+    t.vout.resize(2);
+    t.vout[0].nValue = 0; // Needed for Rust parser
+    t.vout[1].nValue = 0; // Needed for Rust parser
+    t.vout[0].scriptPubKey = CScript() << OP_RETURN << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38");
+    t.vout[1].scriptPubKey = CScript() << OP_RETURN << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38");
+    BOOST_CHECK(!IsStandardTx(t, reason, chainparams));
+
+    t.vout[0].scriptPubKey = CScript() << OP_RETURN << ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38");
+    t.vout[1].scriptPubKey = CScript() << OP_RETURN;
+    BOOST_CHECK(!IsStandardTx(t, reason, chainparams));
+
+    t.vout[0].scriptPubKey = CScript() << OP_RETURN;
+    t.vout[1].scriptPubKey = CScript() << OP_RETURN;
+    BOOST_CHECK(!IsStandardTx(t, reason, chainparams));
+}
+
+BOOST_AUTO_TEST_CASE(test_IsStandardV2)
+{
+    LOCK(cs_main);
+    auto chainparams = Params();
+    CBasicKeyStore keystore;
+    CCoinsView coinsDummy;
+    CCoinsViewCache coins(&coinsDummy);
+    std::vector<CMutableTransaction> dummyTransactions = SetupDummyInputs(keystore, coins);
+
+    CMutableTransaction t;
+    t.vin.resize(1);
+    t.vin[0].prevout.hash = dummyTransactions[0].GetHash();
+    t.vin[0].prevout.n = 1;
+    t.vin[0].scriptSig << std::vector<unsigned char>(65, 0);
+    t.vout.resize(1);
+    t.vout[0].nValue = 90*CENT;
+    CKey key = CKey::TestOnlyRandomKey(true);
+    t.vout[0].scriptPubKey = GetScriptForDestination(key.GetPubKey().GetID());
+
+    string reason;
+    // A v2 transaction with no JoinSplits is still standard.
+    t.nVersion = 2;
+    BOOST_CHECK(IsStandardTx(t, reason, chainparams));
+
+    // ... and with one JoinSplit.
+    t.vJoinSplit.push_back(JSDescription());
+    BOOST_CHECK(IsStandardTx(t, reason, chainparams));
+
+    // ... and when that JoinSplit takes from a transparent input.
+    JSDescription *jsdesc = &t.vJoinSplit[0];
+    jsdesc->vpub_old = 10*CENT;
+    t.vout[0].nValue -= 10*CENT;
+    BOOST_CHECK(IsStandardTx(t, reason, chainparams));
+
+    // A v2 transaction with JoinSplits but no transparent inputs is standard.
+    jsdesc->vpub_old = 0;
+    jsdesc->vpub_new = 100*CENT;
+    t.vout[0].nValue = 90*CENT;
+    t.vin.resize(0);
+    BOOST_CHECK(IsStandardTx(t, reason, chainparams));
+
+    // v2 transactions can still be non-standard for the same reasons as v1.
+    t.vout[0].nValue = 53; // dust
+    BOOST_CHECK(!IsStandardTx(t, reason, chainparams));
+
+    // v3 is not standard.
+    t.nVersion = 3;
+    t.vout[0].nValue = 90*CENT;
+    BOOST_CHECK(!IsStandardTx(t, reason, chainparams));
+}
+
+BOOST_AUTO_TEST_CASE(TxV5)
+{
+    // [
+    //     tx,
+    //     txid,
+    //     auth_digest,
+    //     amounts,
+    //     script_pubkeys,
+    //     Option<transparent_input>,
+    //     sighash_shielded,
+    //     Option<sighash_all>,
+    //     Option<sighash_none>,
+    //     Option<sighash_single>,
+    //     Option<sighash_all_anyone>,
+    //     Option<sighash_none_anyone>,
+    //     Option<sighash_single_anyone>,
+    // ]
+    //
+    // The optional values are all set together.
+    UniValue tests = read_json(std::string(json_tests::zip0244, json_tests::zip0244 + sizeof(json_tests::zip0244)));
+
+    // Skipping over comments in zip0244.json file
+    for (size_t idx = 2; idx < tests.size(); idx++) {
+        UniValue test = tests[idx];
+
+        std::string transaction = test[0].get_str();
+        CDataStream stream(ParseHex(transaction), SER_NETWORK, PROTOCOL_VERSION);
+        CTransaction tx;
+        stream >> tx;
+
+        // Check that re-serializing the transaction gives the same encoding.
+        CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+        ss << tx;
+        BOOST_CHECK_EQUAL(HexStr(ss.begin(), ss.end()), transaction);
+
+        // ZIP 244: Check the transaction digests.
+        BOOST_CHECK_EQUAL(tx.GetHash().GetHex(), test[1].getValStr());
+        BOOST_CHECK_EQUAL(tx.GetAuthDigest().GetHex(), test[2].getValStr());
+
+        UniValue amountsArr = test[3].get_array();
+        UniValue scriptCodesArr = test[4].get_array();
+        std::vector<CAmount> amounts;
+        std::vector<CScript> scriptCodes;
+        std::vector<CTxOut> allPrevOutputs;
+        if (tx.IsCoinBase()) {
+            BOOST_CHECK(amountsArr.empty());
+            BOOST_CHECK(scriptCodesArr.empty());
+        } else {
+            BOOST_CHECK_EQUAL(amountsArr.size(), tx.vin.size());
+            BOOST_CHECK_EQUAL(scriptCodesArr.size(), tx.vin.size());
+
+            for (size_t inpIdx = 0; inpIdx < tx.vin.size(); inpIdx++) {
+                amounts.push_back(amountsArr[inpIdx].get_int64());
+                auto scriptCodeBytes = ParseHex(scriptCodesArr[inpIdx].get_str());
+                scriptCodes.push_back(CScript(scriptCodeBytes.begin(), scriptCodeBytes.end()));
+                allPrevOutputs.emplace_back(amounts[inpIdx], scriptCodes[inpIdx]);
+            }
+        }
+
+        // ZIP 244: Check the signature digests.
+        unsigned int nIn = NOT_AN_INPUT;
+        if (!test[5].isNull()) {
+            nIn = test[5].get_int();
+        }
+
+        CScript scriptCode;
+        CAmount amount;
+        if (nIn != NOT_AN_INPUT) {
+            scriptCode = scriptCodes[nIn];
+            amount = amounts[nIn];
+        }
+
+        const PrecomputedTransactionData txdata(tx, allPrevOutputs);
+
+        BOOST_CHECK_EQUAL(
+            SignatureHash(
+                scriptCode, tx, NOT_AN_INPUT,
+                SIGHASH_ALL,
+                amount, *tx.GetConsensusBranchId(), txdata
+            ).GetHex(),
+            test[6].getValStr());
+
+        if (!test[7].isNull()) {
+            BOOST_CHECK_EQUAL(
+                SignatureHash(
+                    scriptCode, tx, nIn,
+                    SIGHASH_ALL,
+                    amount, *tx.GetConsensusBranchId(), txdata
+                ).GetHex(),
+                test[7].getValStr());
+        }
+
+        if (!test[8].isNull()) {
+            BOOST_CHECK_EQUAL(
+                SignatureHash(
+                    scriptCode, tx, nIn,
+                    SIGHASH_NONE,
+                    amount, *tx.GetConsensusBranchId(), txdata
+                ).GetHex(),
+                test[8].getValStr());
+        }
+
+        if (!test[9].isNull()) {
+            BOOST_CHECK_EQUAL(
+                SignatureHash(
+                    scriptCode, tx, nIn,
+                    SIGHASH_SINGLE,
+                    amount, *tx.GetConsensusBranchId(), txdata
+                ).GetHex(),
+                test[9].getValStr());
+        }
+
+        if (!test[10].isNull()) {
+            BOOST_CHECK_EQUAL(
+                SignatureHash(
+                    scriptCode, tx, nIn,
+                    SIGHASH_ALL | SIGHASH_ANYONECANPAY,
+                    amount, *tx.GetConsensusBranchId(), txdata
+                ).GetHex(),
+                test[10].getValStr());
+        }
+
+        if (!test[11].isNull()) {
+            BOOST_CHECK_EQUAL(
+                SignatureHash(
+                    scriptCode, tx, nIn,
+                    SIGHASH_NONE | SIGHASH_ANYONECANPAY,
+                    amount, *tx.GetConsensusBranchId(), txdata
+                ).GetHex(),
+                test[11].getValStr());
+        }
+
+        if (!test[12].isNull()) {
+            BOOST_CHECK_EQUAL(
+                SignatureHash(
+                    scriptCode, tx, nIn,
+                    SIGHASH_SINGLE | SIGHASH_ANYONECANPAY,
+                    amount, *tx.GetConsensusBranchId(), txdata
+                ).GetHex(),
+                test[12].getValStr());
+        }
+    }
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/txvalidationcache_tests.cpp b/depend/zcash/src/test/txvalidationcache_tests.cpp
new file mode 100644
index 000000000..ef5862f65
--- /dev/null
+++ b/depend/zcash/src/test/txvalidationcache_tests.cpp
@@ -0,0 +1,89 @@
+// Copyright (c) 2011-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "consensus/validation.h"
+#include "key.h"
+#include "main.h"
+#include "miner.h"
+#include "pubkey.h"
+#include "txmempool.h"
+#include "random.h"
+#include "script/standard.h"
+#include "test/test_bitcoin.h"
+#include "utiltime.h"
+
+#include <boost/test/unit_test.hpp>
+
+BOOST_AUTO_TEST_SUITE(tx_validationcache_tests)
+
+static bool
+ToMemPool(CMutableTransaction& tx)
+{
+    LOCK(cs_main);
+
+    CValidationState state;
+    return AcceptToMemoryPool(Params(), mempool, state, tx, false, NULL, false);
+}
+
+#ifdef ENABLE_MINING
+BOOST_FIXTURE_TEST_CASE(tx_mempool_block_doublespend, TestChain100Setup)
+{
+    // Make sure skipping validation of transactions that were
+    // validated going into the memory pool does not allow
+    // double-spends in blocks to pass validation when they should not.
+
+    CScript scriptPubKey = CScript() <<  ToByteVector(coinbaseKey.GetPubKey()) << OP_CHECKSIG;
+
+    // Create a double-spend of mature coinbase txn:
+    std::vector<CMutableTransaction> spends;
+    spends.resize(2);
+    for (int i = 0; i < 2; i++)
+    {
+        spends[i].vin.resize(1);
+        spends[i].vin[0].prevout.hash = coinbaseTxns[0].GetHash();
+        spends[i].vin[0].prevout.n = 0;
+        spends[i].vout.resize(1);
+        spends[i].vout[0].nValue = 11*CENT;
+        spends[i].vout[0].scriptPubKey = scriptPubKey;
+
+        // Sign:
+        const PrecomputedTransactionData txdata(spends[i], {coinbaseTxns[0].vout[0]});
+        std::vector<unsigned char> vchSig;
+        uint256 hash = SignatureHash(scriptPubKey, spends[i], 0, SIGHASH_ALL, coinbaseTxns[0].vout[0].nValue, SPROUT_BRANCH_ID, txdata);
+        BOOST_CHECK(coinbaseKey.Sign(hash, vchSig));
+        vchSig.push_back((unsigned char)SIGHASH_ALL);
+        spends[i].vin[0].scriptSig << vchSig;
+    }
+
+    CBlock block;
+
+    // Test 1: block with both of those transactions should be rejected.
+    block = CreateAndProcessBlock(spends, scriptPubKey);
+    BOOST_CHECK(chainActive.Tip()->GetBlockHash() != block.GetHash());
+
+    // Test 2: ... and should be rejected if spend1 is in the memory pool
+    BOOST_CHECK(ToMemPool(spends[0]));
+    block = CreateAndProcessBlock(spends, scriptPubKey);
+    BOOST_CHECK(chainActive.Tip()->GetBlockHash() != block.GetHash());
+    mempool.clear();
+
+    // Test 3: ... and should be rejected if spend2 is in the memory pool
+    BOOST_CHECK(ToMemPool(spends[1]));
+    block = CreateAndProcessBlock(spends, scriptPubKey);
+    BOOST_CHECK(chainActive.Tip()->GetBlockHash() != block.GetHash());
+    mempool.clear();
+
+    // Final sanity test: first spend in mempool, second in block, that's OK:
+    std::vector<CMutableTransaction> oneSpend;
+    oneSpend.push_back(spends[0]);
+    BOOST_CHECK(ToMemPool(spends[1]));
+    block = CreateAndProcessBlock(oneSpend, scriptPubKey);
+    BOOST_CHECK(chainActive.Tip()->GetBlockHash() == block.GetHash());
+    // spends[1] should have been removed from the mempool when the
+    // block with spends[0] is accepted:
+    BOOST_CHECK_EQUAL(mempool.size(), 0);
+}
+#endif // ENABLE_MINING
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/uint256_tests.cpp b/depend/zcash/src/test/uint256_tests.cpp
new file mode 100644
index 000000000..7034ccfeb
--- /dev/null
+++ b/depend/zcash/src/test/uint256_tests.cpp
@@ -0,0 +1,269 @@
+// Copyright (c) 2011-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+#include "arith_uint256.h"
+#include "uint256.h"
+#include "version.h"
+#include "test/test_bitcoin.h"
+
+#include <boost/test/unit_test.hpp>
+#include <stdint.h>
+#include <sstream>
+#include <iomanip>
+#include <limits>
+#include <cmath>
+#include <string>
+#include <stdio.h>
+
+BOOST_FIXTURE_TEST_SUITE(uint256_tests, BasicTestingSetup)
+
+const unsigned char R1Array[] =
+    "\x9c\x52\x4a\xdb\xcf\x56\x11\x12\x2b\x29\x12\x5e\x5d\x35\xd2\xd2"
+    "\x22\x81\xaa\xb5\x33\xf0\x08\x32\xd5\x56\xb1\xf9\xea\xe5\x1d\x7d";
+const char R1ArrayHex[] = "7D1DE5EAF9B156D53208F033B5AA8122D2d2355d5e12292b121156cfdb4a529c";
+const uint256 R1L = uint256(std::vector<unsigned char>(R1Array,R1Array+32));
+const uint160 R1S = uint160(std::vector<unsigned char>(R1Array,R1Array+20));
+
+const unsigned char R2Array[] =
+    "\x70\x32\x1d\x7c\x47\xa5\x6b\x40\x26\x7e\x0a\xc3\xa6\x9c\xb6\xbf"
+    "\x13\x30\x47\xa3\x19\x2d\xda\x71\x49\x13\x72\xf0\xb4\xca\x81\xd7";
+const uint256 R2L = uint256(std::vector<unsigned char>(R2Array,R2Array+32));
+const uint160 R2S = uint160(std::vector<unsigned char>(R2Array,R2Array+20));
+
+const unsigned char ZeroArray[] =
+    "\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"
+    "\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00";
+const uint256 ZeroL = uint256(std::vector<unsigned char>(ZeroArray,ZeroArray+32));
+const uint160 ZeroS = uint160(std::vector<unsigned char>(ZeroArray,ZeroArray+20));
+
+const unsigned char OneArray[] =
+    "\x01\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"
+    "\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00";
+const uint256 OneL = uint256(std::vector<unsigned char>(OneArray,OneArray+32));
+const uint160 OneS = uint160(std::vector<unsigned char>(OneArray,OneArray+20));
+
+const unsigned char MaxArray[] =
+    "\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff"
+    "\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff";
+const uint256 MaxL = uint256(std::vector<unsigned char>(MaxArray,MaxArray+32));
+const uint160 MaxS = uint160(std::vector<unsigned char>(MaxArray,MaxArray+20));
+
+std::string ArrayToString(const unsigned char A[], unsigned int width)
+{
+    std::stringstream Stream;
+    Stream << std::hex;
+    for (unsigned int i = 0; i < width; ++i)
+    {
+        Stream<<std::setw(2)<<std::setfill('0')<<(unsigned int)A[width-i-1];
+    }
+    return Stream.str();
+}
+
+inline uint160 uint160S(const char *str)
+{
+    uint160 rv;
+    rv.SetHex(str);
+    return rv;
+}
+inline uint160 uint160S(const std::string& str)
+{
+    uint160 rv;
+    rv.SetHex(str);
+    return rv;
+}
+
+BOOST_AUTO_TEST_CASE( basics ) // constructors, equality, inequality
+{
+    BOOST_CHECK(1 == 0+1);
+    // constructor uint256(vector<char>):
+    BOOST_CHECK(R1L.ToString() == ArrayToString(R1Array,32));
+    BOOST_CHECK(R1S.ToString() == ArrayToString(R1Array,20));
+    BOOST_CHECK(R2L.ToString() == ArrayToString(R2Array,32));
+    BOOST_CHECK(R2S.ToString() == ArrayToString(R2Array,20));
+    BOOST_CHECK(ZeroL.ToString() == ArrayToString(ZeroArray,32));
+    BOOST_CHECK(ZeroS.ToString() == ArrayToString(ZeroArray,20));
+    BOOST_CHECK(OneL.ToString() == ArrayToString(OneArray,32));
+    BOOST_CHECK(OneS.ToString() == ArrayToString(OneArray,20));
+    BOOST_CHECK(MaxL.ToString() == ArrayToString(MaxArray,32));
+    BOOST_CHECK(MaxS.ToString() == ArrayToString(MaxArray,20));
+    BOOST_CHECK(OneL.ToString() != ArrayToString(ZeroArray,32));
+    BOOST_CHECK(OneS.ToString() != ArrayToString(ZeroArray,20));
+
+    // == and !=
+    BOOST_CHECK(R1L != R2L && R1S != R2S);
+    BOOST_CHECK(ZeroL != OneL && ZeroS != OneS);
+    BOOST_CHECK(OneL != ZeroL && OneS != ZeroS);
+    BOOST_CHECK(MaxL != ZeroL && MaxS != ZeroS);
+
+    // String Constructor and Copy Constructor
+    BOOST_CHECK(uint256S("0x"+R1L.ToString()) == R1L);
+    BOOST_CHECK(uint256S("0x"+R2L.ToString()) == R2L);
+    BOOST_CHECK(uint256S("0x"+ZeroL.ToString()) == ZeroL);
+    BOOST_CHECK(uint256S("0x"+OneL.ToString()) == OneL);
+    BOOST_CHECK(uint256S("0x"+MaxL.ToString()) == MaxL);
+    BOOST_CHECK(uint256S(R1L.ToString()) == R1L);
+    BOOST_CHECK(uint256S("   0x"+R1L.ToString()+"   ") == R1L);
+    BOOST_CHECK(uint256S("") == ZeroL);
+    BOOST_CHECK(R1L == uint256S(R1ArrayHex));
+    BOOST_CHECK(uint256(R1L) == R1L);
+    BOOST_CHECK(uint256(ZeroL) == ZeroL);
+    BOOST_CHECK(uint256(OneL) == OneL);
+
+    BOOST_CHECK(uint160S("0x"+R1S.ToString()) == R1S);
+    BOOST_CHECK(uint160S("0x"+R2S.ToString()) == R2S);
+    BOOST_CHECK(uint160S("0x"+ZeroS.ToString()) == ZeroS);
+    BOOST_CHECK(uint160S("0x"+OneS.ToString()) == OneS);
+    BOOST_CHECK(uint160S("0x"+MaxS.ToString()) == MaxS);
+    BOOST_CHECK(uint160S(R1S.ToString()) == R1S);
+    BOOST_CHECK(uint160S("   0x"+R1S.ToString()+"   ") == R1S);
+    BOOST_CHECK(uint160S("") == ZeroS);
+    BOOST_CHECK(R1S == uint160S(R1ArrayHex));
+
+    BOOST_CHECK(uint160(R1S) == R1S);
+    BOOST_CHECK(uint160(ZeroS) == ZeroS);
+    BOOST_CHECK(uint160(OneS) == OneS);
+}
+
+BOOST_AUTO_TEST_CASE( comparison ) // <= >= < >
+{
+    uint256 LastL;
+    for (int i = 255; i >= 0; --i) {
+        uint256 TmpL;
+        *(TmpL.begin() + (i>>3)) |= 1<<(7-(i&7));
+        BOOST_CHECK( LastL < TmpL );
+        LastL = TmpL;
+    }
+
+    BOOST_CHECK( ZeroL < R1L );
+    BOOST_CHECK( R2L < R1L );
+    BOOST_CHECK( ZeroL < OneL );
+    BOOST_CHECK( OneL < MaxL );
+    BOOST_CHECK( R1L < MaxL );
+    BOOST_CHECK( R2L < MaxL );
+
+    uint160 LastS;
+    for (int i = 159; i >= 0; --i) {
+        uint160 TmpS;
+        *(TmpS.begin() + (i>>3)) |= 1<<(7-(i&7));
+        BOOST_CHECK( LastS < TmpS );
+        LastS = TmpS;
+    }
+    BOOST_CHECK( ZeroS < R1S );
+    BOOST_CHECK( R2S < R1S );
+    BOOST_CHECK( ZeroS < OneS );
+    BOOST_CHECK( OneS < MaxS );
+    BOOST_CHECK( R1S < MaxS );
+    BOOST_CHECK( R2S < MaxS );
+}
+
+BOOST_AUTO_TEST_CASE( methods ) // GetHex SetHex begin() end() size() GetLow64 GetSerializeSize, Serialize, Unserialize
+{
+    BOOST_CHECK(R1L.GetHex() == R1L.ToString());
+    BOOST_CHECK(R2L.GetHex() == R2L.ToString());
+    BOOST_CHECK(OneL.GetHex() == OneL.ToString());
+    BOOST_CHECK(MaxL.GetHex() == MaxL.ToString());
+    uint256 TmpL(R1L);
+    BOOST_CHECK(TmpL == R1L);
+    TmpL.SetHex(R2L.ToString());   BOOST_CHECK(TmpL == R2L);
+    TmpL.SetHex(ZeroL.ToString()); BOOST_CHECK(TmpL == uint256());
+
+    TmpL.SetHex(R1L.ToString());
+    BOOST_CHECK(memcmp(R1L.begin(), R1Array, 32)==0);
+    BOOST_CHECK(memcmp(TmpL.begin(), R1Array, 32)==0);
+    BOOST_CHECK(memcmp(R2L.begin(), R2Array, 32)==0);
+    BOOST_CHECK(memcmp(ZeroL.begin(), ZeroArray, 32)==0);
+    BOOST_CHECK(memcmp(OneL.begin(), OneArray, 32)==0);
+    BOOST_CHECK(R1L.size() == sizeof(R1L));
+    BOOST_CHECK(sizeof(R1L) == 32);
+    BOOST_CHECK(R1L.size() == 32);
+    BOOST_CHECK(R2L.size() == 32);
+    BOOST_CHECK(ZeroL.size() == 32);
+    BOOST_CHECK(MaxL.size() == 32);
+    BOOST_CHECK(R1L.begin() + 32 == R1L.end());
+    BOOST_CHECK(R2L.begin() + 32 == R2L.end());
+    BOOST_CHECK(OneL.begin() + 32 == OneL.end());
+    BOOST_CHECK(MaxL.begin() + 32 == MaxL.end());
+    BOOST_CHECK(TmpL.begin() + 32 == TmpL.end());
+    BOOST_CHECK(GetSerializeSize(R1L, 0, PROTOCOL_VERSION) == 32);
+    BOOST_CHECK(GetSerializeSize(ZeroL, 0, PROTOCOL_VERSION) == 32);
+
+    CDataStream ss(0, PROTOCOL_VERSION);
+    ss << R1L;
+    BOOST_CHECK(ss.str() == std::string(R1Array,R1Array+32));
+    ss >> TmpL;
+    BOOST_CHECK(R1L == TmpL);
+    ss.clear();
+    ss << ZeroL;
+    BOOST_CHECK(ss.str() == std::string(ZeroArray,ZeroArray+32));
+    ss >> TmpL;
+    BOOST_CHECK(ZeroL == TmpL);
+    ss.clear();
+    ss << MaxL;
+    BOOST_CHECK(ss.str() == std::string(MaxArray,MaxArray+32));
+    ss >> TmpL;
+    BOOST_CHECK(MaxL == TmpL);
+    ss.clear();
+
+    BOOST_CHECK(R1S.GetHex() == R1S.ToString());
+    BOOST_CHECK(R2S.GetHex() == R2S.ToString());
+    BOOST_CHECK(OneS.GetHex() == OneS.ToString());
+    BOOST_CHECK(MaxS.GetHex() == MaxS.ToString());
+    uint160 TmpS(R1S);
+    BOOST_CHECK(TmpS == R1S);
+    TmpS.SetHex(R2S.ToString());   BOOST_CHECK(TmpS == R2S);
+    TmpS.SetHex(ZeroS.ToString()); BOOST_CHECK(TmpS == uint160());
+
+    TmpS.SetHex(R1S.ToString());
+    BOOST_CHECK(memcmp(R1S.begin(), R1Array, 20)==0);
+    BOOST_CHECK(memcmp(TmpS.begin(), R1Array, 20)==0);
+    BOOST_CHECK(memcmp(R2S.begin(), R2Array, 20)==0);
+    BOOST_CHECK(memcmp(ZeroS.begin(), ZeroArray, 20)==0);
+    BOOST_CHECK(memcmp(OneS.begin(), OneArray, 20)==0);
+    BOOST_CHECK(R1S.size() == sizeof(R1S));
+    BOOST_CHECK(sizeof(R1S) == 20);
+    BOOST_CHECK(R1S.size() == 20);
+    BOOST_CHECK(R2S.size() == 20);
+    BOOST_CHECK(ZeroS.size() == 20);
+    BOOST_CHECK(MaxS.size() == 20);
+    BOOST_CHECK(R1S.begin() + 20 == R1S.end());
+    BOOST_CHECK(R2S.begin() + 20 == R2S.end());
+    BOOST_CHECK(OneS.begin() + 20 == OneS.end());
+    BOOST_CHECK(MaxS.begin() + 20 == MaxS.end());
+    BOOST_CHECK(TmpS.begin() + 20 == TmpS.end());
+    BOOST_CHECK(GetSerializeSize(R1S, 0, PROTOCOL_VERSION) == 20);
+    BOOST_CHECK(GetSerializeSize(ZeroS, 0, PROTOCOL_VERSION) == 20);
+
+    ss << R1S;
+    BOOST_CHECK(ss.str() == std::string(R1Array,R1Array+20));
+    ss >> TmpS;
+    BOOST_CHECK(R1S == TmpS);
+    ss.clear();
+    ss << ZeroS;
+    BOOST_CHECK(ss.str() == std::string(ZeroArray,ZeroArray+20));
+    ss >> TmpS;
+    BOOST_CHECK(ZeroS == TmpS);
+    ss.clear();
+    ss << MaxS;
+    BOOST_CHECK(ss.str() == std::string(MaxArray,MaxArray+20));
+    ss >> TmpS;
+    BOOST_CHECK(MaxS == TmpS);
+    ss.clear();
+}
+
+BOOST_AUTO_TEST_CASE( conversion )
+{
+    BOOST_CHECK(ArithToUint256(UintToArith256(ZeroL)) == ZeroL);
+    BOOST_CHECK(ArithToUint256(UintToArith256(OneL)) == OneL);
+    BOOST_CHECK(ArithToUint256(UintToArith256(R1L)) == R1L);
+    BOOST_CHECK(ArithToUint256(UintToArith256(R2L)) == R2L);
+    BOOST_CHECK(UintToArith256(ZeroL) == 0);
+    BOOST_CHECK(UintToArith256(OneL) == 1);
+    BOOST_CHECK(ArithToUint256(0) == ZeroL);
+    BOOST_CHECK(ArithToUint256(1) == OneL);
+    BOOST_CHECK(arith_uint256(R1L.GetHex()) == UintToArith256(R1L));
+    BOOST_CHECK(arith_uint256(R2L.GetHex()) == UintToArith256(R2L));
+    BOOST_CHECK(R1L.GetHex() == UintToArith256(R1L).GetHex());
+    BOOST_CHECK(R2L.GetHex() == UintToArith256(R2L).GetHex());
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/test/univalue_tests.cpp b/depend/zcash/src/test/univalue_tests.cpp
new file mode 100644
index 000000000..51db25e8b
--- /dev/null
+++ b/depend/zcash/src/test/univalue_tests.cpp
@@ -0,0 +1,320 @@
+// Copyright 2014 BitPay, Inc.
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include <stdint.h>
+#include <vector>
+#include <string>
+#include <map>
+#include <univalue.h>
+#include "test/test_bitcoin.h"
+
+#include <boost/test/unit_test.hpp>
+
+using namespace std;
+
+BOOST_FIXTURE_TEST_SUITE(univalue_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(univalue_constructor)
+{
+    UniValue v1;
+    BOOST_CHECK(v1.isNull());
+
+    UniValue v2(UniValue::VSTR);
+    BOOST_CHECK(v2.isStr());
+
+    UniValue v3(UniValue::VSTR, "foo");
+    BOOST_CHECK(v3.isStr());
+    BOOST_CHECK_EQUAL(v3.getValStr(), "foo");
+
+    UniValue numTest;
+    BOOST_CHECK(numTest.setNumStr("82"));
+    BOOST_CHECK(numTest.isNum());
+    BOOST_CHECK_EQUAL(numTest.getValStr(), "82");
+
+    uint64_t vu64 = 82;
+    UniValue v4(vu64);
+    BOOST_CHECK(v4.isNum());
+    BOOST_CHECK_EQUAL(v4.getValStr(), "82");
+
+    int64_t vi64 = -82;
+    UniValue v5(vi64);
+    BOOST_CHECK(v5.isNum());
+    BOOST_CHECK_EQUAL(v5.getValStr(), "-82");
+
+    int vi = -688;
+    UniValue v6(vi);
+    BOOST_CHECK(v6.isNum());
+    BOOST_CHECK_EQUAL(v6.getValStr(), "-688");
+
+    double vd = -7.21;
+    UniValue v7(vd);
+    BOOST_CHECK(v7.isNum());
+    BOOST_CHECK_EQUAL(v7.getValStr(), "-7.21");
+
+    string vs("yawn");
+    UniValue v8(vs);
+    BOOST_CHECK(v8.isStr());
+    BOOST_CHECK_EQUAL(v8.getValStr(), "yawn");
+
+    const char *vcs = "zappa";
+    UniValue v9(vcs);
+    BOOST_CHECK(v9.isStr());
+    BOOST_CHECK_EQUAL(v9.getValStr(), "zappa");
+}
+
+BOOST_AUTO_TEST_CASE(univalue_typecheck)
+{
+    UniValue v1;
+    BOOST_CHECK(v1.setNumStr("1"));
+    BOOST_CHECK(v1.isNum());
+    BOOST_CHECK_THROW(v1.get_bool(), runtime_error);
+
+    UniValue v2;
+    BOOST_CHECK(v2.setBool(true));
+    BOOST_CHECK_EQUAL(v2.get_bool(), true);
+    BOOST_CHECK_THROW(v2.get_int(), runtime_error);
+
+    UniValue v3;
+    BOOST_CHECK(v3.setNumStr("32482348723847471234"));
+    BOOST_CHECK_THROW(v3.get_int64(), runtime_error);
+    BOOST_CHECK(v3.setNumStr("1000"));
+    BOOST_CHECK_EQUAL(v3.get_int64(), 1000);
+
+    UniValue v4;
+    BOOST_CHECK(v4.setNumStr("2147483648"));
+    BOOST_CHECK_EQUAL(v4.get_int64(), 2147483648);
+    BOOST_CHECK_THROW(v4.get_int(), runtime_error);
+    BOOST_CHECK(v4.setNumStr("1000"));
+    BOOST_CHECK_EQUAL(v4.get_int(), 1000);
+    BOOST_CHECK_THROW(v4.get_str(), runtime_error);
+    BOOST_CHECK_EQUAL(v4.get_real(), 1000);
+    BOOST_CHECK_THROW(v4.get_array(), runtime_error);
+    BOOST_CHECK_THROW(v4.getKeys(), runtime_error);
+    BOOST_CHECK_THROW(v4.getValues(), runtime_error);
+    BOOST_CHECK_THROW(v4.get_obj(), runtime_error);
+
+    UniValue v5;
+    BOOST_CHECK(v5.read("[true, 10]"));
+    BOOST_CHECK_NO_THROW(v5.get_array());
+    std::vector<UniValue> vals = v5.getValues();
+    BOOST_CHECK_THROW(vals[0].get_int(), runtime_error);
+    BOOST_CHECK_EQUAL(vals[0].get_bool(), true);
+
+    BOOST_CHECK_EQUAL(vals[1].get_int(), 10);
+    BOOST_CHECK_THROW(vals[1].get_bool(), runtime_error);
+}
+
+BOOST_AUTO_TEST_CASE(univalue_set)
+{
+    UniValue v(UniValue::VSTR, "foo");
+    v.clear();
+    BOOST_CHECK(v.isNull());
+    BOOST_CHECK_EQUAL(v.getValStr(), "");
+
+    BOOST_CHECK(v.setObject());
+    BOOST_CHECK(v.isObject());
+    BOOST_CHECK_EQUAL(v.size(), 0);
+    BOOST_CHECK_EQUAL(v.getType(), UniValue::VOBJ);
+    BOOST_CHECK(v.empty());
+
+    BOOST_CHECK(v.setArray());
+    BOOST_CHECK(v.isArray());
+    BOOST_CHECK_EQUAL(v.size(), 0);
+
+    BOOST_CHECK(v.setStr("zum"));
+    BOOST_CHECK(v.isStr());
+    BOOST_CHECK_EQUAL(v.getValStr(), "zum");
+
+    BOOST_CHECK(v.setFloat(-1.01));
+    BOOST_CHECK(v.isNum());
+    BOOST_CHECK_EQUAL(v.getValStr(), "-1.01");
+
+    BOOST_CHECK(v.setInt((int)1023));
+    BOOST_CHECK(v.isNum());
+    BOOST_CHECK_EQUAL(v.getValStr(), "1023");
+
+    BOOST_CHECK(v.setInt((int64_t)-1023LL));
+    BOOST_CHECK(v.isNum());
+    BOOST_CHECK_EQUAL(v.getValStr(), "-1023");
+
+    BOOST_CHECK(v.setInt((uint64_t)1023ULL));
+    BOOST_CHECK(v.isNum());
+    BOOST_CHECK_EQUAL(v.getValStr(), "1023");
+
+    BOOST_CHECK(v.setNumStr("-688"));
+    BOOST_CHECK(v.isNum());
+    BOOST_CHECK_EQUAL(v.getValStr(), "-688");
+
+    BOOST_CHECK(v.setBool(false));
+    BOOST_CHECK_EQUAL(v.isBool(), true);
+    BOOST_CHECK_EQUAL(v.isTrue(), false);
+    BOOST_CHECK_EQUAL(v.isFalse(), true);
+    BOOST_CHECK_EQUAL(v.getBool(), false);
+
+    BOOST_CHECK(v.setBool(true));
+    BOOST_CHECK_EQUAL(v.isBool(), true);
+    BOOST_CHECK_EQUAL(v.isTrue(), true);
+    BOOST_CHECK_EQUAL(v.isFalse(), false);
+    BOOST_CHECK_EQUAL(v.getBool(), true);
+
+    BOOST_CHECK(!v.setNumStr("zombocom"));
+
+    BOOST_CHECK(v.setNull());
+    BOOST_CHECK(v.isNull());
+}
+
+BOOST_AUTO_TEST_CASE(univalue_array)
+{
+    UniValue arr(UniValue::VARR);
+
+    UniValue v((int64_t)1023LL);
+    BOOST_CHECK(arr.push_back(v));
+
+    string vStr("zippy");
+    BOOST_CHECK(arr.push_back(vStr));
+
+    const char *s = "pippy";
+    BOOST_CHECK(arr.push_back(s));
+
+    vector<UniValue> vec;
+    v.setStr("boing");
+    vec.push_back(v);
+
+    v.setStr("going");
+    vec.push_back(v);
+
+    BOOST_CHECK(arr.push_backV(vec));
+
+    BOOST_CHECK_EQUAL(arr.empty(), false);
+    BOOST_CHECK_EQUAL(arr.size(), 5);
+
+    BOOST_CHECK_EQUAL(arr[0].getValStr(), "1023");
+    BOOST_CHECK_EQUAL(arr[1].getValStr(), "zippy");
+    BOOST_CHECK_EQUAL(arr[2].getValStr(), "pippy");
+    BOOST_CHECK_EQUAL(arr[3].getValStr(), "boing");
+    BOOST_CHECK_EQUAL(arr[4].getValStr(), "going");
+
+    BOOST_CHECK_EQUAL(arr[999].getValStr(), "");
+
+    arr.clear();
+    BOOST_CHECK(arr.empty());
+    BOOST_CHECK_EQUAL(arr.size(), 0);
+}
+
+BOOST_AUTO_TEST_CASE(univalue_object)
+{
+    UniValue obj(UniValue::VOBJ);
+    string strKey, strVal;
+    UniValue v;
+
+    strKey = "age";
+    v.setInt(100);
+    BOOST_CHECK(obj.pushKV(strKey, v));
+
+    strKey = "first";
+    strVal = "John";
+    BOOST_CHECK(obj.pushKV(strKey, strVal));
+
+    strKey = "last";
+    const char *cVal = "Smith";
+    BOOST_CHECK(obj.pushKV(strKey, cVal));
+
+    strKey = "distance";
+    BOOST_CHECK(obj.pushKV(strKey, (int64_t) 25));
+
+    strKey = "time";
+    BOOST_CHECK(obj.pushKV(strKey, (uint64_t) 3600));
+
+    strKey = "calories";
+    BOOST_CHECK(obj.pushKV(strKey, (int) 12));
+
+    strKey = "temperature";
+    BOOST_CHECK(obj.pushKV(strKey, (double) 90.012));
+
+    UniValue obj2(UniValue::VOBJ);
+    BOOST_CHECK(obj2.pushKV("cat1", 9000));
+    BOOST_CHECK(obj2.pushKV("cat2", 12345));
+
+    BOOST_CHECK(obj.pushKVs(obj2));
+
+    BOOST_CHECK_EQUAL(obj.empty(), false);
+    BOOST_CHECK_EQUAL(obj.size(), 9);
+
+    BOOST_CHECK_EQUAL(obj["age"].getValStr(), "100");
+    BOOST_CHECK_EQUAL(obj["first"].getValStr(), "John");
+    BOOST_CHECK_EQUAL(obj["last"].getValStr(), "Smith");
+    BOOST_CHECK_EQUAL(obj["distance"].getValStr(), "25");
+    BOOST_CHECK_EQUAL(obj["time"].getValStr(), "3600");
+    BOOST_CHECK_EQUAL(obj["calories"].getValStr(), "12");
+    BOOST_CHECK_EQUAL(obj["temperature"].getValStr(), "90.012");
+    BOOST_CHECK_EQUAL(obj["cat1"].getValStr(), "9000");
+    BOOST_CHECK_EQUAL(obj["cat2"].getValStr(), "12345");
+
+    BOOST_CHECK_EQUAL(obj["nyuknyuknyuk"].getValStr(), "");
+
+    BOOST_CHECK(obj.exists("age"));
+    BOOST_CHECK(obj.exists("first"));
+    BOOST_CHECK(obj.exists("last"));
+    BOOST_CHECK(obj.exists("distance"));
+    BOOST_CHECK(obj.exists("time"));
+    BOOST_CHECK(obj.exists("calories"));
+    BOOST_CHECK(obj.exists("temperature"));
+    BOOST_CHECK(obj.exists("cat1"));
+    BOOST_CHECK(obj.exists("cat2"));
+
+    BOOST_CHECK(!obj.exists("nyuknyuknyuk"));
+
+    map<string, UniValue::VType> objTypes;
+    objTypes["age"] = UniValue::VNUM;
+    objTypes["first"] = UniValue::VSTR;
+    objTypes["last"] = UniValue::VSTR;
+    objTypes["distance"] = UniValue::VNUM;
+    objTypes["time"] = UniValue::VNUM;
+    objTypes["calories"] = UniValue::VNUM;
+    objTypes["temperature"] = UniValue::VNUM;
+    objTypes["cat1"] = UniValue::VNUM;
+    objTypes["cat2"] = UniValue::VNUM;
+    BOOST_CHECK(obj.checkObject(objTypes));
+
+    objTypes["cat2"] = UniValue::VSTR;
+    BOOST_CHECK(!obj.checkObject(objTypes));
+
+    obj.clear();
+    BOOST_CHECK(obj.empty());
+    BOOST_CHECK_EQUAL(obj.size(), 0);
+}
+
+static const char *json1 =
+"[1.10000000,{\"key1\":\"str\\u0000\",\"key2\":800,\"key3\":{\"name\":\"martian http://test.com\"}}]";
+
+BOOST_AUTO_TEST_CASE(univalue_readwrite)
+{
+    UniValue v;
+    BOOST_CHECK(v.read(json1));
+
+    string strJson1(json1);
+    BOOST_CHECK(v.read(strJson1));
+
+    BOOST_CHECK(v.isArray());
+    BOOST_CHECK_EQUAL(v.size(), 2);
+
+    BOOST_CHECK_EQUAL(v[0].getValStr(), "1.10000000");
+
+    UniValue obj = v[1];
+    BOOST_CHECK(obj.isObject());
+    BOOST_CHECK_EQUAL(obj.size(), 3);
+
+    BOOST_CHECK(obj["key1"].isStr());
+    std::string correctValue("str");
+    correctValue.push_back('\0');
+    BOOST_CHECK_EQUAL(obj["key1"].getValStr(), correctValue);
+    BOOST_CHECK(obj["key2"].isNum());
+    BOOST_CHECK_EQUAL(obj["key2"].getValStr(), "800");
+    BOOST_CHECK(obj["key3"].isObject());
+
+    BOOST_CHECK_EQUAL(strJson1, v.write());
+}
+
+BOOST_AUTO_TEST_SUITE_END()
+
diff --git a/depend/zcash/src/test/util_tests.cpp b/depend/zcash/src/test/util_tests.cpp
new file mode 100644
index 000000000..28ee6b97d
--- /dev/null
+++ b/depend/zcash/src/test/util_tests.cpp
@@ -0,0 +1,624 @@
+// Copyright (c) 2011-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "util.h"
+
+#include "clientversion.h"
+#include "primitives/transaction.h"
+#include "test_random.h"
+#include "sync.h"
+#include "utilstrencodings.h"
+#include "utilmoneystr.h"
+#include "test/test_bitcoin.h"
+
+#include <stdint.h>
+#include <vector>
+
+#include <boost/test/unit_test.hpp>
+
+using namespace std;
+
+BOOST_FIXTURE_TEST_SUITE(util_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(util_criticalsection)
+{
+    CCriticalSection cs;
+
+    do {
+        LOCK(cs);
+        break;
+
+        BOOST_ERROR("break was swallowed!");
+    } while(0);
+
+    do {
+        TRY_LOCK(cs, lockTest);
+        if (lockTest)
+            break;
+
+        BOOST_ERROR("break was swallowed!");
+    } while(0);
+}
+
+static const unsigned char ParseHex_expected[65] = {
+    0x04, 0x67, 0x8a, 0xfd, 0xb0, 0xfe, 0x55, 0x48, 0x27, 0x19, 0x67, 0xf1, 0xa6, 0x71, 0x30, 0xb7,
+    0x10, 0x5c, 0xd6, 0xa8, 0x28, 0xe0, 0x39, 0x09, 0xa6, 0x79, 0x62, 0xe0, 0xea, 0x1f, 0x61, 0xde,
+    0xb6, 0x49, 0xf6, 0xbc, 0x3f, 0x4c, 0xef, 0x38, 0xc4, 0xf3, 0x55, 0x04, 0xe5, 0x1e, 0xc1, 0x12,
+    0xde, 0x5c, 0x38, 0x4d, 0xf7, 0xba, 0x0b, 0x8d, 0x57, 0x8a, 0x4c, 0x70, 0x2b, 0x6b, 0xf1, 0x1d,
+    0x5f
+};
+BOOST_AUTO_TEST_CASE(util_ParseHex)
+{
+    std::vector<unsigned char> result;
+    std::vector<unsigned char> expected(ParseHex_expected, ParseHex_expected + sizeof(ParseHex_expected));
+    // Basic test vector
+    result = ParseHex("04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f");
+    BOOST_CHECK_EQUAL_COLLECTIONS(result.begin(), result.end(), expected.begin(), expected.end());
+
+    // Spaces between bytes must be supported
+    result = ParseHex("12 34 56 78");
+    BOOST_CHECK(result.size() == 4 && result[0] == 0x12 && result[1] == 0x34 && result[2] == 0x56 && result[3] == 0x78);
+
+    // Stop parsing at invalid value
+    result = ParseHex("1234 invalid 1234");
+    BOOST_CHECK(result.size() == 2 && result[0] == 0x12 && result[1] == 0x34);
+}
+
+BOOST_AUTO_TEST_CASE(util_HexStr)
+{
+    BOOST_CHECK_EQUAL(
+        HexStr(ParseHex_expected, ParseHex_expected + sizeof(ParseHex_expected)),
+        "04678afdb0fe5548271967f1a67130b7105cd6a828e03909a67962e0ea1f61deb649f6bc3f4cef38c4f35504e51ec112de5c384df7ba0b8d578a4c702b6bf11d5f");
+
+    BOOST_CHECK_EQUAL(
+        HexStr(ParseHex_expected, ParseHex_expected + 5, true),
+        "04 67 8a fd b0");
+
+    BOOST_CHECK_EQUAL(
+        HexStr(ParseHex_expected, ParseHex_expected, true),
+        "");
+
+    std::vector<unsigned char> ParseHex_vec(ParseHex_expected, ParseHex_expected + 5);
+
+    BOOST_CHECK_EQUAL(
+        HexStr(ParseHex_vec, true),
+        "04 67 8a fd b0");
+}
+
+
+BOOST_AUTO_TEST_CASE(util_DateTimeStrFormat)
+{
+    BOOST_CHECK_EQUAL(DateTimeStrFormat("%Y-%m-%d %H:%M:%S", 0), "1970-01-01 00:00:00");
+    BOOST_CHECK_EQUAL(DateTimeStrFormat("%Y-%m-%d %H:%M:%S", 0x7FFFFFFF), "2038-01-19 03:14:07");
+    BOOST_CHECK_EQUAL(DateTimeStrFormat("%Y-%m-%d %H:%M:%S", 1317425777), "2011-09-30 23:36:17");
+    BOOST_CHECK_EQUAL(DateTimeStrFormat("%Y-%m-%d %H:%M", 1317425777), "2011-09-30 23:36");
+    BOOST_CHECK_EQUAL(DateTimeStrFormat("%a, %d %b %Y %H:%M:%S +0000", 1317425777), "Fri, 30 Sep 2011 23:36:17 +0000");
+}
+
+BOOST_AUTO_TEST_CASE(util_ParseParameters)
+{
+    const char *argv_test[] = {"-ignored", "-a", "-b", "-ccc=argument", "-ccc=multiple", "f", "-d=e"};
+
+    ParseParameters(0, (char**)argv_test);
+    BOOST_CHECK(mapArgs.empty() && mapMultiArgs.empty());
+
+    ParseParameters(1, (char**)argv_test);
+    BOOST_CHECK(mapArgs.empty() && mapMultiArgs.empty());
+
+    ParseParameters(5, (char**)argv_test);
+    // expectation: -ignored is ignored (program name argument),
+    // -a, -b and -ccc end up in map, -d ignored because it is after
+    // a non-option argument (non-GNU option parsing)
+    BOOST_CHECK(mapArgs.size() == 3 && mapMultiArgs.size() == 3);
+    BOOST_CHECK(mapArgs.count("-a") && mapArgs.count("-b") && mapArgs.count("-ccc")
+                && !mapArgs.count("f") && !mapArgs.count("-d"));
+    BOOST_CHECK(mapMultiArgs.count("-a") && mapMultiArgs.count("-b") && mapMultiArgs.count("-ccc")
+                && !mapMultiArgs.count("f") && !mapMultiArgs.count("-d"));
+
+    BOOST_CHECK(mapArgs["-a"] == "" && mapArgs["-ccc"] == "multiple");
+    BOOST_CHECK(mapMultiArgs["-ccc"].size() == 2);
+}
+
+BOOST_AUTO_TEST_CASE(util_GetArg)
+{
+    mapArgs.clear();
+    mapArgs["strtest1"] = "string...";
+    // strtest2 undefined on purpose
+    mapArgs["inttest1"] = "12345";
+    mapArgs["inttest2"] = "81985529216486895";
+    // inttest3 undefined on purpose
+    mapArgs["booltest1"] = "";
+    // booltest2 undefined on purpose
+    mapArgs["booltest3"] = "0";
+    mapArgs["booltest4"] = "1";
+
+    BOOST_CHECK_EQUAL(GetArg("strtest1", "default"), "string...");
+    BOOST_CHECK_EQUAL(GetArg("strtest2", "default"), "default");
+    BOOST_CHECK_EQUAL(GetArg("inttest1", -1), 12345);
+    BOOST_CHECK_EQUAL(GetArg("inttest2", -1), 81985529216486895LL);
+    BOOST_CHECK_EQUAL(GetArg("inttest3", -1), -1);
+    BOOST_CHECK_EQUAL(GetBoolArg("booltest1", false), true);
+    BOOST_CHECK_EQUAL(GetBoolArg("booltest2", false), false);
+    BOOST_CHECK_EQUAL(GetBoolArg("booltest3", false), false);
+    BOOST_CHECK_EQUAL(GetBoolArg("booltest4", false), true);
+}
+
+BOOST_AUTO_TEST_CASE(util_FormatMoney)
+{
+    BOOST_CHECK_EQUAL(FormatMoney(0), "0.00");
+    BOOST_CHECK_EQUAL(FormatMoney((COIN/10000)*123456789), "12345.6789");
+    BOOST_CHECK_EQUAL(FormatMoney(-COIN), "-1.00");
+
+    BOOST_CHECK_EQUAL(FormatMoney(COIN*100000000), "100000000.00");
+    BOOST_CHECK_EQUAL(FormatMoney(COIN*10000000), "10000000.00");
+    BOOST_CHECK_EQUAL(FormatMoney(COIN*1000000), "1000000.00");
+    BOOST_CHECK_EQUAL(FormatMoney(COIN*100000), "100000.00");
+    BOOST_CHECK_EQUAL(FormatMoney(COIN*10000), "10000.00");
+    BOOST_CHECK_EQUAL(FormatMoney(COIN*1000), "1000.00");
+    BOOST_CHECK_EQUAL(FormatMoney(COIN*100), "100.00");
+    BOOST_CHECK_EQUAL(FormatMoney(COIN*10), "10.00");
+    BOOST_CHECK_EQUAL(FormatMoney(COIN), "1.00");
+    BOOST_CHECK_EQUAL(FormatMoney(COIN/10), "0.10");
+    BOOST_CHECK_EQUAL(FormatMoney(COIN/100), "0.01");
+    BOOST_CHECK_EQUAL(FormatMoney(COIN/1000), "0.001");
+    BOOST_CHECK_EQUAL(FormatMoney(COIN/10000), "0.0001");
+    BOOST_CHECK_EQUAL(FormatMoney(COIN/100000), "0.00001");
+    BOOST_CHECK_EQUAL(FormatMoney(COIN/1000000), "0.000001");
+    BOOST_CHECK_EQUAL(FormatMoney(COIN/10000000), "0.0000001");
+    BOOST_CHECK_EQUAL(FormatMoney(COIN/100000000), "0.00000001");
+}
+
+BOOST_AUTO_TEST_CASE(util_ParseMoney)
+{
+    CAmount ret = 0;
+    BOOST_CHECK(ParseMoney("0.0", ret));
+    BOOST_CHECK_EQUAL(ret, 0);
+
+    BOOST_CHECK(ParseMoney("12345.6789", ret));
+    BOOST_CHECK_EQUAL(ret, (COIN/10000)*123456789);
+
+    BOOST_CHECK(ParseMoney("100000000.00", ret));
+    BOOST_CHECK_EQUAL(ret, COIN*100000000);
+    BOOST_CHECK(ParseMoney("10000000.00", ret));
+    BOOST_CHECK_EQUAL(ret, COIN*10000000);
+    BOOST_CHECK(ParseMoney("1000000.00", ret));
+    BOOST_CHECK_EQUAL(ret, COIN*1000000);
+    BOOST_CHECK(ParseMoney("100000.00", ret));
+    BOOST_CHECK_EQUAL(ret, COIN*100000);
+    BOOST_CHECK(ParseMoney("10000.00", ret));
+    BOOST_CHECK_EQUAL(ret, COIN*10000);
+    BOOST_CHECK(ParseMoney("1000.00", ret));
+    BOOST_CHECK_EQUAL(ret, COIN*1000);
+    BOOST_CHECK(ParseMoney("100.00", ret));
+    BOOST_CHECK_EQUAL(ret, COIN*100);
+    BOOST_CHECK(ParseMoney("10.00", ret));
+    BOOST_CHECK_EQUAL(ret, COIN*10);
+    BOOST_CHECK(ParseMoney("1.00", ret));
+    BOOST_CHECK_EQUAL(ret, COIN);
+    BOOST_CHECK(ParseMoney("0.1", ret));
+    BOOST_CHECK_EQUAL(ret, COIN/10);
+    BOOST_CHECK(ParseMoney("0.01", ret));
+    BOOST_CHECK_EQUAL(ret, COIN/100);
+    BOOST_CHECK(ParseMoney("0.001", ret));
+    BOOST_CHECK_EQUAL(ret, COIN/1000);
+    BOOST_CHECK(ParseMoney("0.0001", ret));
+    BOOST_CHECK_EQUAL(ret, COIN/10000);
+    BOOST_CHECK(ParseMoney("0.00001", ret));
+    BOOST_CHECK_EQUAL(ret, COIN/100000);
+    BOOST_CHECK(ParseMoney("0.000001", ret));
+    BOOST_CHECK_EQUAL(ret, COIN/1000000);
+    BOOST_CHECK(ParseMoney("0.0000001", ret));
+    BOOST_CHECK_EQUAL(ret, COIN/10000000);
+    BOOST_CHECK(ParseMoney("0.00000001", ret));
+    BOOST_CHECK_EQUAL(ret, COIN/100000000);
+
+    // Attempted 63 bit overflow should fail
+    BOOST_CHECK(!ParseMoney("92233720368.54775808", ret));
+}
+
+BOOST_AUTO_TEST_CASE(util_IsHex)
+{
+    BOOST_CHECK(IsHex("00"));
+    BOOST_CHECK(IsHex("00112233445566778899aabbccddeeffAABBCCDDEEFF"));
+    BOOST_CHECK(IsHex("ff"));
+    BOOST_CHECK(IsHex("FF"));
+
+    BOOST_CHECK(!IsHex(""));
+    BOOST_CHECK(!IsHex("0"));
+    BOOST_CHECK(!IsHex("a"));
+    BOOST_CHECK(!IsHex("eleven"));
+    BOOST_CHECK(!IsHex("00xx00"));
+    BOOST_CHECK(!IsHex("0x0000"));
+}
+
+BOOST_AUTO_TEST_CASE(util_seed_insecure_rand)
+{
+    seed_insecure_rand(true);
+    for (int mod=2;mod<11;mod++)
+    {
+        int mask = 1;
+        // Really rough binomal confidence approximation.
+        int err = 30*10000./mod*sqrt((1./mod*(1-1./mod))/10000.);
+        //mask is 2^ceil(log2(mod))-1
+        while(mask<mod-1)mask=(mask<<1)+1;
+
+        int count = 0;
+        //How often does it get a zero from the uniform range [0,mod)?
+        for (int i = 0; i < 10000; i++) {
+            uint32_t rval;
+            do{
+                rval=insecure_rand()&mask;
+            }while(rval>=(uint32_t)mod);
+            count += rval==0;
+        }
+        BOOST_CHECK(count<=10000/mod+err);
+        BOOST_CHECK(count>=10000/mod-err);
+    }
+}
+
+BOOST_AUTO_TEST_CASE(util_TimingResistantEqual)
+{
+    BOOST_CHECK(TimingResistantEqual(std::string(""), std::string("")));
+    BOOST_CHECK(!TimingResistantEqual(std::string("abc"), std::string("")));
+    BOOST_CHECK(!TimingResistantEqual(std::string(""), std::string("abc")));
+    BOOST_CHECK(!TimingResistantEqual(std::string("a"), std::string("aa")));
+    BOOST_CHECK(!TimingResistantEqual(std::string("aa"), std::string("a")));
+    BOOST_CHECK(TimingResistantEqual(std::string("abc"), std::string("abc")));
+    BOOST_CHECK(!TimingResistantEqual(std::string("abc"), std::string("aba")));
+}
+
+/* Test strprintf formatting directives.
+ * Put a string before and after to ensure sanity of element sizes on stack. */
+#define B "check_prefix"
+#define E "check_postfix"
+BOOST_AUTO_TEST_CASE(strprintf_numbers)
+{
+    int64_t s64t = -9223372036854775807LL; /* signed 64 bit test value */
+    uint64_t u64t = 18446744073709551615ULL; /* unsigned 64 bit test value */
+    BOOST_CHECK(strprintf("%s %d %s", B, s64t, E) == B" -9223372036854775807 " E);
+    BOOST_CHECK(strprintf("%s %u %s", B, u64t, E) == B" 18446744073709551615 " E);
+    BOOST_CHECK(strprintf("%s %x %s", B, u64t, E) == B" ffffffffffffffff " E);
+
+    size_t st = 12345678; /* unsigned size_t test value */
+    ssize_t sst = -12345678; /* signed size_t test value */
+    BOOST_CHECK(strprintf("%s %d %s", B, sst, E) == B" -12345678 " E);
+    BOOST_CHECK(strprintf("%s %u %s", B, st, E) == B" 12345678 " E);
+    BOOST_CHECK(strprintf("%s %x %s", B, st, E) == B" bc614e " E);
+
+    ptrdiff_t pt = 87654321; /* positive ptrdiff_t test value */
+    ptrdiff_t spt = -87654321; /* negative ptrdiff_t test value */
+    BOOST_CHECK(strprintf("%s %d %s", B, spt, E) == B" -87654321 " E);
+    BOOST_CHECK(strprintf("%s %u %s", B, pt, E) == B" 87654321 " E);
+    BOOST_CHECK(strprintf("%s %x %s", B, pt, E) == B" 5397fb1 " E);
+}
+#undef B
+#undef E
+
+/* Check for mingw/wine issue #3494
+ * Remove this test before time.ctime(0xffffffff) == 'Sun Feb  7 07:28:15 2106'
+ */
+BOOST_AUTO_TEST_CASE(gettime)
+{
+    BOOST_CHECK((GetTime() & ~0xFFFFFFFFLL) == 0);
+}
+
+BOOST_AUTO_TEST_CASE(test_ParseInt32)
+{
+    int32_t n;
+    // Valid values
+    BOOST_CHECK(ParseInt32("1234", NULL));
+    BOOST_CHECK(ParseInt32("0", &n) && n == 0);
+    BOOST_CHECK(ParseInt32("1234", &n) && n == 1234);
+    BOOST_CHECK(ParseInt32("01234", &n) && n == 1234); // no octal
+    BOOST_CHECK(ParseInt32("2147483647", &n) && n == 2147483647);
+    BOOST_CHECK(ParseInt32("-2147483648", &n) && n == (-2147483647 - 1)); // (-2147483647 - 1) equals INT_MIN
+    BOOST_CHECK(ParseInt32("-1234", &n) && n == -1234);
+    // Invalid values
+    BOOST_CHECK(!ParseInt32("", &n));
+    BOOST_CHECK(!ParseInt32(" 1", &n)); // no padding inside
+    BOOST_CHECK(!ParseInt32("1 ", &n));
+    BOOST_CHECK(!ParseInt32("1a", &n));
+    BOOST_CHECK(!ParseInt32("aap", &n));
+    BOOST_CHECK(!ParseInt32("0x1", &n)); // no hex
+    BOOST_CHECK(!ParseInt32("0x1", &n)); // no hex
+    const char test_bytes[] = {'1', 0, '1'};
+    std::string teststr(test_bytes, sizeof(test_bytes));
+    BOOST_CHECK(!ParseInt32(teststr, &n)); // no embedded NULs
+    // Overflow and underflow
+    BOOST_CHECK(!ParseInt32("-2147483649", NULL));
+    BOOST_CHECK(!ParseInt32("2147483648", NULL));
+    BOOST_CHECK(!ParseInt32("-32482348723847471234", NULL));
+    BOOST_CHECK(!ParseInt32("32482348723847471234", NULL));
+}
+
+BOOST_AUTO_TEST_CASE(test_ParseInt64)
+{
+    int64_t n;
+    // Valid values
+    BOOST_CHECK(ParseInt64("1234", NULL));
+    BOOST_CHECK(ParseInt64("0", &n) && n == 0LL);
+    BOOST_CHECK(ParseInt64("1234", &n) && n == 1234LL);
+    BOOST_CHECK(ParseInt64("01234", &n) && n == 1234LL); // no octal
+    BOOST_CHECK(ParseInt64("2147483647", &n) && n == 2147483647LL);
+    BOOST_CHECK(ParseInt64("-2147483648", &n) && n == -2147483648LL);
+    BOOST_CHECK(ParseInt64("9223372036854775807", &n) && n == (int64_t)9223372036854775807);
+    BOOST_CHECK(ParseInt64("-9223372036854775808", &n) && n == (int64_t)-9223372036854775807-1);
+    BOOST_CHECK(ParseInt64("-1234", &n) && n == -1234LL);
+    // Invalid values
+    BOOST_CHECK(!ParseInt64("", &n));
+    BOOST_CHECK(!ParseInt64(" 1", &n)); // no padding inside
+    BOOST_CHECK(!ParseInt64("1 ", &n));
+    BOOST_CHECK(!ParseInt64("1a", &n));
+    BOOST_CHECK(!ParseInt64("aap", &n));
+    BOOST_CHECK(!ParseInt64("0x1", &n)); // no hex
+    const char test_bytes[] = {'1', 0, '1'};
+    std::string teststr(test_bytes, sizeof(test_bytes));
+    BOOST_CHECK(!ParseInt64(teststr, &n)); // no embedded NULs
+    // Overflow and underflow
+    BOOST_CHECK(!ParseInt64("-9223372036854775809", NULL));
+    BOOST_CHECK(!ParseInt64("9223372036854775808", NULL));
+    BOOST_CHECK(!ParseInt64("-32482348723847471234", NULL));
+    BOOST_CHECK(!ParseInt64("32482348723847471234", NULL));
+}
+
+BOOST_AUTO_TEST_CASE(test_ParseDouble)
+{
+    double n;
+    // Valid values
+    BOOST_CHECK(ParseDouble("1234", NULL));
+    BOOST_CHECK(ParseDouble("0", &n) && n == 0.0);
+    BOOST_CHECK(ParseDouble("1234", &n) && n == 1234.0);
+    BOOST_CHECK(ParseDouble("01234", &n) && n == 1234.0); // no octal
+    BOOST_CHECK(ParseDouble("2147483647", &n) && n == 2147483647.0);
+    BOOST_CHECK(ParseDouble("-2147483648", &n) && n == -2147483648.0);
+    BOOST_CHECK(ParseDouble("-1234", &n) && n == -1234.0);
+    BOOST_CHECK(ParseDouble("1e6", &n) && n == 1e6);
+    BOOST_CHECK(ParseDouble("-1e6", &n) && n == -1e6);
+    // Invalid values
+    BOOST_CHECK(!ParseDouble("", &n));
+    BOOST_CHECK(!ParseDouble(" 1", &n)); // no padding inside
+    BOOST_CHECK(!ParseDouble("1 ", &n));
+    BOOST_CHECK(!ParseDouble("1a", &n));
+    BOOST_CHECK(!ParseDouble("aap", &n));
+    BOOST_CHECK(!ParseDouble("0x1", &n)); // no hex
+    const char test_bytes[] = {'1', 0, '1'};
+    std::string teststr(test_bytes, sizeof(test_bytes));
+    BOOST_CHECK(!ParseDouble(teststr, &n)); // no embedded NULs
+    // Overflow and underflow
+    BOOST_CHECK(!ParseDouble("-1e10000", NULL));
+    BOOST_CHECK(!ParseDouble("1e10000", NULL));
+}
+
+BOOST_AUTO_TEST_CASE(test_FormatParagraph)
+{
+    BOOST_CHECK_EQUAL(FormatParagraph("", 79, 0), "");
+    BOOST_CHECK_EQUAL(FormatParagraph("test", 79, 0), "test");
+    BOOST_CHECK_EQUAL(FormatParagraph(" test", 79, 0), "test");
+    BOOST_CHECK_EQUAL(FormatParagraph("test test", 79, 0), "test test");
+    BOOST_CHECK_EQUAL(FormatParagraph("test test", 4, 0), "test\ntest");
+    BOOST_CHECK_EQUAL(FormatParagraph("testerde test ", 4, 0), "testerde\ntest");
+    BOOST_CHECK_EQUAL(FormatParagraph("test test", 4, 4), "test\n    test");
+    BOOST_CHECK_EQUAL(FormatParagraph("This is a very long test string. This is a second sentence in the very long test string."), "This is a very long test string. This is a second sentence in the very long\ntest string.");
+}
+
+BOOST_AUTO_TEST_CASE(test_FormatSubVersion)
+{
+    std::vector<std::string> comments;
+    comments.push_back(std::string("comment1"));
+    std::vector<std::string> comments2;
+    comments2.push_back(std::string("comment1"));
+    comments2.push_back(SanitizeString(std::string("Comment2; .,_?@; !\"#$%&'()*+-/<=>[]\\^`{|}~"), SAFE_CHARS_UA_COMMENT)); // Semicolon is discouraged but not forbidden by BIP-0014
+    BOOST_CHECK_EQUAL(FormatSubVersion("Test", 99900, std::vector<std::string>()), std::string("/Test:0.9.99-beta1/"));
+    BOOST_CHECK_EQUAL(FormatSubVersion("Test", 99924, std::vector<std::string>()), std::string("/Test:0.9.99-beta25/"));
+    BOOST_CHECK_EQUAL(FormatSubVersion("Test", 99925, std::vector<std::string>()), std::string("/Test:0.9.99-rc1/"));
+    BOOST_CHECK_EQUAL(FormatSubVersion("Test", 99949, std::vector<std::string>()), std::string("/Test:0.9.99-rc25/"));
+    BOOST_CHECK_EQUAL(FormatSubVersion("Test", 99950, std::vector<std::string>()), std::string("/Test:0.9.99/"));
+    BOOST_CHECK_EQUAL(FormatSubVersion("Test", 99951, std::vector<std::string>()), std::string("/Test:0.9.99-1/"));
+    BOOST_CHECK_EQUAL(FormatSubVersion("Test", 99999, std::vector<std::string>()), std::string("/Test:0.9.99-49/"));
+    BOOST_CHECK_EQUAL(FormatSubVersion("Test", 99900, comments),  std::string("/Test:0.9.99-beta1(comment1)/"));
+    BOOST_CHECK_EQUAL(FormatSubVersion("Test", 99950, comments),  std::string("/Test:0.9.99(comment1)/"));
+    BOOST_CHECK_EQUAL(FormatSubVersion("Test", 99900, comments2), std::string("/Test:0.9.99-beta1(comment1; Comment2; .,_?@; )/"));
+    BOOST_CHECK_EQUAL(FormatSubVersion("Test", 99950, comments2), std::string("/Test:0.9.99(comment1; Comment2; .,_?@; )/"));
+
+    // bug https://github.com/zcash/zcash/issues/4375
+    BOOST_CHECK_EQUAL(SanitizeString(std::string("MagicBean:2.1.1-1")), "MagicBean:2.1.11");
+    // fixed by adding new rule https://github.com/zcash/zcash/pull/4444
+    BOOST_CHECK_EQUAL(SanitizeString(std::string("MagicBean:2.1.1-1"), SAFE_CHARS_SUBVERSION), "MagicBean:2.1.1-1");
+}
+
+BOOST_AUTO_TEST_CASE(test_ParseFixedPoint)
+{
+    int64_t amount = 0;
+    BOOST_CHECK(ParseFixedPoint("0", 8, &amount));
+    BOOST_CHECK_EQUAL(amount, 0LL);
+    BOOST_CHECK(ParseFixedPoint("1", 8, &amount));
+    BOOST_CHECK_EQUAL(amount, 100000000LL);
+    BOOST_CHECK(ParseFixedPoint("0.0", 8, &amount));
+    BOOST_CHECK_EQUAL(amount, 0LL);
+    BOOST_CHECK(ParseFixedPoint("-0.1", 8, &amount));
+    BOOST_CHECK_EQUAL(amount, -10000000LL);
+    BOOST_CHECK(ParseFixedPoint("1.1", 8, &amount));
+    BOOST_CHECK_EQUAL(amount, 110000000LL);
+    BOOST_CHECK(ParseFixedPoint("1.10000000000000000", 8, &amount));
+    BOOST_CHECK_EQUAL(amount, 110000000LL);
+    BOOST_CHECK(ParseFixedPoint("1.1e1", 8, &amount));
+    BOOST_CHECK_EQUAL(amount, 1100000000LL);
+    BOOST_CHECK(ParseFixedPoint("1.1e-1", 8, &amount));
+    BOOST_CHECK_EQUAL(amount, 11000000LL);
+    BOOST_CHECK(ParseFixedPoint("1000", 8, &amount));
+    BOOST_CHECK_EQUAL(amount, 100000000000LL);
+    BOOST_CHECK(ParseFixedPoint("-1000", 8, &amount));
+    BOOST_CHECK_EQUAL(amount, -100000000000LL);
+    BOOST_CHECK(ParseFixedPoint("0.00000001", 8, &amount));
+    BOOST_CHECK_EQUAL(amount, 1LL);
+    BOOST_CHECK(ParseFixedPoint("0.0000000100000000", 8, &amount));
+    BOOST_CHECK_EQUAL(amount, 1LL);
+    BOOST_CHECK(ParseFixedPoint("-0.00000001", 8, &amount));
+    BOOST_CHECK_EQUAL(amount, -1LL);
+    BOOST_CHECK(ParseFixedPoint("1000000000.00000001", 8, &amount));
+    BOOST_CHECK_EQUAL(amount, 100000000000000001LL);
+    BOOST_CHECK(ParseFixedPoint("9999999999.99999999", 8, &amount));
+    BOOST_CHECK_EQUAL(amount, 999999999999999999LL);
+    BOOST_CHECK(ParseFixedPoint("-9999999999.99999999", 8, &amount));
+    BOOST_CHECK_EQUAL(amount, -999999999999999999LL);
+
+    BOOST_CHECK(!ParseFixedPoint("", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("-", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("a-1000", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("-a1000", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("-1000a", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("-01000", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("00.1", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint(".1", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("--0.1", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("0.000000001", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("-0.000000001", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("0.00000001000000001", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("-10000000000.00000000", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("10000000000.00000000", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("-10000000000.00000001", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("10000000000.00000001", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("-10000000000.00000009", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("10000000000.00000009", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("-99999999999.99999999", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("99999909999.09999999", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("92233720368.54775807", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("92233720368.54775808", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("-92233720368.54775808", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("-92233720368.54775809", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("1.1e", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("1.1e-", 8, &amount));
+    BOOST_CHECK(!ParseFixedPoint("1.", 8, &amount));
+}
+
+BOOST_AUTO_TEST_CASE(test_ParseArbitraryInt)
+{
+    // Negation not allowed.
+    BOOST_CHECK(!ParseArbitraryInt("-1"));
+
+    // no legal digits
+    BOOST_CHECK(!ParseArbitraryInt(""));
+    BOOST_CHECK(!ParseArbitraryInt(" "));
+
+    // Hex not allowed (only decimal).
+    BOOST_CHECK(!ParseArbitraryInt("ab"));
+    BOOST_CHECK(!ParseArbitraryInt("0xab"));
+
+    // Decimal point not allowed.
+    BOOST_CHECK(!ParseArbitraryInt("1."));
+
+    std::optional<std::vector<unsigned char>> v;
+
+    // simple success case
+    v = ParseArbitraryInt("1");
+    BOOST_CHECK(v.has_value());
+    BOOST_CHECK_EQUAL(v->size(), 1);
+    BOOST_CHECK_EQUAL((*v)[0], 1);
+
+    // Leading and trailing whitespace (spaces and tabs) is allowed.
+    v = ParseArbitraryInt(" 1");
+    BOOST_CHECK(v.has_value());
+    BOOST_CHECK_EQUAL(v->size(), 1);
+    BOOST_CHECK_EQUAL((*v)[0], 1);
+    v = ParseArbitraryInt("2 ");
+    BOOST_CHECK(v.has_value());
+    BOOST_CHECK_EQUAL(v->size(), 1);
+    BOOST_CHECK_EQUAL((*v)[0], 2);
+    v = ParseArbitraryInt(" \t3 ");
+    BOOST_CHECK(v.has_value());
+    BOOST_CHECK_EQUAL(v->size(), 1);
+    BOOST_CHECK_EQUAL((*v)[0], 3);
+
+    // Leading zeros have no effect, does not mean octal
+    v = ParseArbitraryInt("010\t");
+    BOOST_CHECK(v.has_value());
+    BOOST_CHECK_EQUAL(v->size(), 1);
+    BOOST_CHECK_EQUAL((*v)[0], 10);
+
+    v = ParseArbitraryInt("                 255\t");
+    BOOST_CHECK(v.has_value());
+    BOOST_CHECK_EQUAL(v->size(), 1);
+    BOOST_CHECK_EQUAL((*v)[0], 255);
+
+    v = ParseArbitraryInt("\t 256");
+    BOOST_CHECK(v.has_value());
+    BOOST_CHECK_EQUAL(v->size(), 2);
+    BOOST_CHECK_EQUAL((*v)[0], 0);
+    BOOST_CHECK_EQUAL((*v)[1], 1);
+
+    v = ParseArbitraryInt("257 \t");
+    BOOST_CHECK(v.has_value());
+    BOOST_CHECK_EQUAL(v->size(), 2);
+    BOOST_CHECK_EQUAL((*v)[0], 1);
+    BOOST_CHECK_EQUAL((*v)[1], 1);
+
+    v = ParseArbitraryInt("65535");
+    BOOST_CHECK(v.has_value());
+    BOOST_CHECK_EQUAL(v->size(), 2);
+    BOOST_CHECK_EQUAL((*v)[0], 255);
+    BOOST_CHECK_EQUAL((*v)[1], 255);
+
+    v = ParseArbitraryInt("65536");
+    BOOST_CHECK(v.has_value());
+    BOOST_CHECK_EQUAL(v->size(), 3);
+    BOOST_CHECK_EQUAL((*v)[0], 0);
+    BOOST_CHECK_EQUAL((*v)[1], 0);
+    BOOST_CHECK_EQUAL((*v)[2], 1);
+
+    // This decimal string came from:
+    // $ echo 16i 102030405060708090A0B0C0D0E0F0F1F2F3F4F5F6F7 p | dc
+    v = ParseArbitraryInt("6033354224708459019450009057293028077350189222196983");
+    BOOST_CHECK(v.has_value());
+    BOOST_CHECK_EQUAL(v->size(), 22);
+    BOOST_CHECK_EQUAL((*v)[0], 0xf7);
+    BOOST_CHECK_EQUAL((*v)[1], 0xf6);
+    BOOST_CHECK_EQUAL((*v)[2], 0xf5);
+    BOOST_CHECK_EQUAL((*v)[3], 0xf4);
+    BOOST_CHECK_EQUAL((*v)[4], 0xf3);
+    BOOST_CHECK_EQUAL((*v)[5], 0xf2);
+    BOOST_CHECK_EQUAL((*v)[6], 0xf1);
+    BOOST_CHECK_EQUAL((*v)[7], 0xf0);
+    BOOST_CHECK_EQUAL((*v)[8], 0xe0);
+    BOOST_CHECK_EQUAL((*v)[9], 0xd0);
+    BOOST_CHECK_EQUAL((*v)[10], 0xc0);
+    BOOST_CHECK_EQUAL((*v)[11], 0xb0);
+    BOOST_CHECK_EQUAL((*v)[12], 0xa0);
+    BOOST_CHECK_EQUAL((*v)[13], 0x90);
+    BOOST_CHECK_EQUAL((*v)[14], 0x80);
+    BOOST_CHECK_EQUAL((*v)[15], 0x70);
+    BOOST_CHECK_EQUAL((*v)[16], 0x60);
+    BOOST_CHECK_EQUAL((*v)[17], 0x50);
+    BOOST_CHECK_EQUAL((*v)[18], 0x40);
+    BOOST_CHECK_EQUAL((*v)[19], 0x30);
+    BOOST_CHECK_EQUAL((*v)[20], 0x20);
+    BOOST_CHECK_EQUAL((*v)[21], 0x10);
+}
+
+BOOST_AUTO_TEST_CASE(test_ArbitraryIntStr)
+{
+    BOOST_CHECK_EQUAL(ArbitraryIntStr({}), "0");
+    BOOST_CHECK_EQUAL(ArbitraryIntStr({0}), "0");
+    BOOST_CHECK_EQUAL(ArbitraryIntStr({0, 0}), "0");
+    BOOST_CHECK_EQUAL(ArbitraryIntStr({0, 0, 0}), "0");
+    BOOST_CHECK_EQUAL(ArbitraryIntStr({0, 0, 0, 0}), "0");
+
+    BOOST_CHECK_EQUAL(ArbitraryIntStr({1}), "1");
+    BOOST_CHECK_EQUAL(ArbitraryIntStr({2}), "2");
+    BOOST_CHECK_EQUAL(ArbitraryIntStr({10}), "10");
+    BOOST_CHECK_EQUAL(ArbitraryIntStr({100}), "100");
+
+    BOOST_CHECK_EQUAL(ArbitraryIntStr({0xff}), "255");
+    BOOST_CHECK_EQUAL(ArbitraryIntStr({0x00, 0x01}), "256");
+    BOOST_CHECK_EQUAL(ArbitraryIntStr({0xff, 0x01}), "511");
+    BOOST_CHECK_EQUAL(ArbitraryIntStr({0x00, 0x02}), "512");
+
+    BOOST_CHECK_EQUAL(
+        ArbitraryIntStr({0xff, 0xff, 0xff, 0xff}),
+        "4294967295");
+    BOOST_CHECK_EQUAL(
+        ArbitraryIntStr({0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff}),
+        "309485009821345068724781055");
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/threadsafety.h b/depend/zcash/src/threadsafety.h
new file mode 100644
index 000000000..4d4a3fc60
--- /dev/null
+++ b/depend/zcash/src/threadsafety.h
@@ -0,0 +1,55 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2012 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_THREADSAFETY_H
+#define BITCOIN_THREADSAFETY_H
+
+#ifdef __clang__
+// TL;DR Add GUARDED_BY(mutex) to member variables. The others are
+// rarely necessary. Ex: int nFoo GUARDED_BY(cs_foo);
+//
+// See https://clang.llvm.org/docs/LanguageExtensions.html#threadsafety
+// for documentation.  The clang compiler can do advanced static analysis
+// of locking when given the -Wthread-safety option.
+#define LOCKABLE __attribute__((lockable))
+#define SCOPED_LOCKABLE __attribute__((scoped_lockable))
+#define GUARDED_BY(x) __attribute__((guarded_by(x)))
+#define GUARDED_VAR __attribute__((guarded_var))
+#define PT_GUARDED_BY(x) __attribute__((pt_guarded_by(x)))
+#define PT_GUARDED_VAR __attribute__((pt_guarded_var))
+#define ACQUIRED_AFTER(...) __attribute__((acquired_after(__VA_ARGS__)))
+#define ACQUIRED_BEFORE(...) __attribute__((acquired_before(__VA_ARGS__)))
+#define EXCLUSIVE_LOCK_FUNCTION(...) __attribute__((exclusive_lock_function(__VA_ARGS__)))
+#define SHARED_LOCK_FUNCTION(...) __attribute__((shared_lock_function(__VA_ARGS__)))
+#define EXCLUSIVE_TRYLOCK_FUNCTION(...) __attribute__((exclusive_trylock_function(__VA_ARGS__)))
+#define SHARED_TRYLOCK_FUNCTION(...) __attribute__((shared_trylock_function(__VA_ARGS__)))
+#define UNLOCK_FUNCTION(...) __attribute__((unlock_function(__VA_ARGS__)))
+#define LOCK_RETURNED(x) __attribute__((lock_returned(x)))
+#define LOCKS_EXCLUDED(...) __attribute__((locks_excluded(__VA_ARGS__)))
+#define EXCLUSIVE_LOCKS_REQUIRED(...) __attribute__((exclusive_locks_required(__VA_ARGS__)))
+#define SHARED_LOCKS_REQUIRED(...) __attribute__((shared_locks_required(__VA_ARGS__)))
+#define NO_THREAD_SAFETY_ANALYSIS __attribute__((no_thread_safety_analysis))
+#else
+#define LOCKABLE
+#define SCOPED_LOCKABLE
+#define GUARDED_BY(x)
+#define GUARDED_VAR
+#define PT_GUARDED_BY(x)
+#define PT_GUARDED_VAR
+#define ACQUIRED_AFTER(...)
+#define ACQUIRED_BEFORE(...)
+#define EXCLUSIVE_LOCK_FUNCTION(...)
+#define SHARED_LOCK_FUNCTION(...)
+#define EXCLUSIVE_TRYLOCK_FUNCTION(...)
+#define SHARED_TRYLOCK_FUNCTION(...)
+#define UNLOCK_FUNCTION(...)
+#define LOCK_RETURNED(x)
+#define LOCKS_EXCLUDED(...)
+#define EXCLUSIVE_LOCKS_REQUIRED(...)
+#define SHARED_LOCKS_REQUIRED(...)
+#define NO_THREAD_SAFETY_ANALYSIS
+#endif // __GNUC__
+
+#endif // BITCOIN_THREADSAFETY_H
diff --git a/depend/zcash/src/timedata.cpp b/depend/zcash/src/timedata.cpp
new file mode 100644
index 000000000..edebc633d
--- /dev/null
+++ b/depend/zcash/src/timedata.cpp
@@ -0,0 +1,70 @@
+// Copyright (c) 2014 The Bitcoin Core developers
+// Copyright (c) 2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "timedata.h"
+
+#include "netbase.h"
+#include "sync.h"
+#include "ui_interface.h"
+#include "util.h"
+#include "utilstrencodings.h"
+#include "warnings.h"
+
+
+CTimeWarning timeWarning;
+
+/**
+ * Warn if we have seen TIMEDATA_WARNING_SAMPLES peer times, in the version messages of the
+ * first TIMEDATA_MAX_SAMPLES unique (by IP address) peers that connect, that are more than
+ * TIMEDATA_WARNING_THRESHOLD seconds but less than TIMEDATA_IGNORE_THRESHOLD seconds away
+ * from local time.
+ */
+
+int64_t CTimeWarning::AddTimeData(const CNetAddr& ip, int64_t nTime, int64_t now)
+{
+    assert(now >= 0 && now <= INT64_MAX - TIMEDATA_IGNORE_THRESHOLD);
+
+    if (nTime <= now - TIMEDATA_IGNORE_THRESHOLD || nTime >= now + TIMEDATA_IGNORE_THRESHOLD) {
+        return 0;
+    }
+
+    int64_t nTimeOffset = nTime - now;
+
+    LOCK(cs);
+    // Ignore duplicate IPs.
+    if (setKnown.size() == TIMEDATA_MAX_SAMPLES || !setKnown.insert(ip).second) {
+        return nTimeOffset;
+    }
+
+    LogPrint("net","added time data, samples %d, offset %+d (%+d minutes)\n", setKnown.size(), nTimeOffset, nTimeOffset/60);
+
+    if (nPeersBehind + nPeersAhead < TIMEDATA_WARNING_SAMPLES) {
+        if (nTimeOffset < -TIMEDATA_WARNING_THRESHOLD) {
+            nPeersBehind++;
+        } else if (nTimeOffset > TIMEDATA_WARNING_THRESHOLD) {
+            nPeersAhead++;
+        }
+
+        if (nPeersBehind + nPeersAhead == TIMEDATA_WARNING_SAMPLES) {
+            Warn(nPeersAhead, nPeersBehind);
+        }
+    }
+    return nTimeOffset;
+}
+
+void CTimeWarning::Warn(size_t peersAhead, size_t peersBehind)
+{
+    std::string strMessage;
+    if (peersBehind >= TIMEDATA_WARNING_MAJORITY) {
+        strMessage = _("Your computer's date and time may be ahead of the rest of the network! If your clock is wrong Zcash will not work properly.");
+    } else if (peersAhead >= TIMEDATA_WARNING_MAJORITY) {
+        strMessage = _("Your computer's date and time may be behind the rest of the network! If your clock is wrong Zcash will not work properly.");
+    } else {
+        strMessage = _("Please check that your computer's date and time are correct! If your clock is wrong Zcash will not work properly.");
+    }
+    SetMiscWarning(strMessage, GetTime());
+    uiInterface.ThreadSafeMessageBox(strMessage, "", CClientUIInterface::MSG_WARNING);
+}
+
diff --git a/depend/zcash/src/timedata.h b/depend/zcash/src/timedata.h
new file mode 100644
index 000000000..7c7afd495
--- /dev/null
+++ b/depend/zcash/src/timedata.h
@@ -0,0 +1,40 @@
+// Copyright (c) 2014 The Bitcoin Core developers
+// Copyright (c) 2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_TIMEDATA_H
+#define BITCOIN_TIMEDATA_H
+
+#include <set>
+#include <stdint.h>
+
+#include "netbase.h"
+#include "sync.h"
+
+
+class CTimeWarning
+{
+private:
+    CCriticalSection cs;
+    std::set<CNetAddr> setKnown;
+    size_t nPeersAhead;
+    size_t nPeersBehind;
+
+public:
+    static const size_t TIMEDATA_WARNING_SAMPLES = 8;
+    static const size_t TIMEDATA_WARNING_MAJORITY = 6;
+    static const size_t TIMEDATA_MAX_SAMPLES = 20;
+    static const int64_t TIMEDATA_WARNING_THRESHOLD = 10 * 60;
+    static const int64_t TIMEDATA_IGNORE_THRESHOLD = 10 * 24 * 60 * 60;
+
+    CTimeWarning() : nPeersBehind(0), nPeersAhead(0) {}
+    virtual ~CTimeWarning() {}
+
+    int64_t AddTimeData(const CNetAddr& ip, int64_t nTime, int64_t now);
+    virtual void Warn(size_t peersAhead, size_t peersBehind);
+};
+
+extern CTimeWarning timeWarning;
+
+#endif // BITCOIN_TIMEDATA_H
diff --git a/depend/zcash/src/timestampindex.h b/depend/zcash/src/timestampindex.h
new file mode 100644
index 000000000..fe72669d7
--- /dev/null
+++ b/depend/zcash/src/timestampindex.h
@@ -0,0 +1,131 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_TIMESTAMPINDEX_H
+#define BITCOIN_TIMESTAMPINDEX_H
+
+#include "uint256.h"
+
+struct CTimestampIndexIteratorKey {
+    unsigned int timestamp;
+
+    size_t GetSerializeSize(int nType, int nVersion) const {
+        return 4;
+    }
+    template<typename Stream>
+    void Serialize(Stream& s) const {
+        ser_writedata32be(s, timestamp);
+    }
+    template<typename Stream>
+    void Unserialize(Stream& s) {
+        timestamp = ser_readdata32be(s);
+    }
+
+    CTimestampIndexIteratorKey(unsigned int time) {
+        timestamp = time;
+    }
+
+    CTimestampIndexIteratorKey() {
+        SetNull();
+    }
+
+    void SetNull() {
+        timestamp = 0;
+    }
+};
+
+struct CTimestampIndexKey {
+    unsigned int timestamp;
+    uint256 blockHash;
+
+    size_t GetSerializeSize(int nType, int nVersion) const {
+        return 36;
+    }
+    template<typename Stream>
+    void Serialize(Stream& s) const {
+        ser_writedata32be(s, timestamp);
+        blockHash.Serialize(s);
+    }
+    template<typename Stream>
+    void Unserialize(Stream& s) {
+        timestamp = ser_readdata32be(s);
+        blockHash.Unserialize(s);
+    }
+
+    CTimestampIndexKey(unsigned int time, uint256 hash) {
+        timestamp = time;
+        blockHash = hash;
+    }
+
+    CTimestampIndexKey() {
+        SetNull();
+    }
+
+    void SetNull() {
+        timestamp = 0;
+        blockHash.SetNull();
+    }
+};
+
+struct CTimestampBlockIndexKey {
+    uint256 blockHash;
+
+    size_t GetSerializeSize(int nType, int nVersion) const {
+        return 32;
+    }
+
+    template<typename Stream>
+    void Serialize(Stream& s) const {
+        blockHash.Serialize(s);
+    }
+
+    template<typename Stream>
+    void Unserialize(Stream& s) {
+        blockHash.Unserialize(s);
+    }
+
+    CTimestampBlockIndexKey(uint256 hash) {
+        blockHash = hash;
+    }
+
+    CTimestampBlockIndexKey() {
+        SetNull();
+    }
+
+    void SetNull() {
+        blockHash.SetNull();
+    }
+};
+
+struct CTimestampBlockIndexValue {
+    unsigned int ltimestamp;
+    size_t GetSerializeSize(int nType, int nVersion) const {
+        return 4;
+    }
+
+    template<typename Stream>
+    void Serialize(Stream& s) const {
+        ser_writedata32be(s, ltimestamp);
+    }
+
+    template<typename Stream>
+    void Unserialize(Stream& s) {
+        ltimestamp = ser_readdata32be(s);
+    }
+
+    CTimestampBlockIndexValue (unsigned int time) {
+        ltimestamp = time;
+    }
+
+    CTimestampBlockIndexValue() {
+        SetNull();
+    }
+
+    void SetNull() {
+        ltimestamp = 0;
+    }
+};
+
+#endif // BITCOIN_TIMESTAMPINDEX_H
diff --git a/depend/zcash/src/tinyformat.h b/depend/zcash/src/tinyformat.h
new file mode 100644
index 000000000..7c607d7f0
--- /dev/null
+++ b/depend/zcash/src/tinyformat.h
@@ -0,0 +1,1049 @@
+// tinyformat.h
+// Copyright (C) 2011, Chris Foster [chris42f (at) gmail (d0t) com]
+//
+// Boost Software License - Version 1.0
+//
+// Permission is hereby granted, free of charge, to any person or organization
+// obtaining a copy of the software and accompanying documentation covered by
+// this license (the "Software") to use, reproduce, display, distribute,
+// execute, and transmit the Software, and to prepare derivative works of the
+// Software, and to permit third-parties to whom the Software is furnished to
+// do so, all subject to the following:
+//
+// The copyright notices in the Software and this entire statement, including
+// the above license grant, this restriction and the following disclaimer,
+// must be included in all copies of the Software, in whole or in part, and
+// all derivative works of the Software, unless such copies or derivative
+// works are solely in the form of machine-executable object code generated by
+// a source language processor.
+//
+// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+// FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
+// SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
+// FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
+// ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+// DEALINGS IN THE SOFTWARE.
+
+//------------------------------------------------------------------------------
+// Tinyformat: A minimal type safe printf replacement
+//
+// tinyformat.h is a type safe printf replacement library in a single C++
+// header file.  Design goals include:
+//
+// * Type safety and extensibility for user defined types.
+// * C99 printf() compatibility, to the extent possible using std::ostream
+// * Simplicity and minimalism.  A single header file to include and distribute
+//   with your projects.
+// * Augment rather than replace the standard stream formatting mechanism
+// * C++98 support, with optional C++11 niceties
+//
+//
+// Main interface example usage
+// ----------------------------
+//
+// To print a date to std::cout:
+//
+//   std::string weekday = "Wednesday";
+//   const char* month = "July";
+//   size_t day = 27;
+//   long hour = 14;
+//   int min = 44;
+//
+//   tfm::printf("%s, %s %d, %.2d:%.2d\n", weekday, month, day, hour, min);
+//
+// The strange types here emphasize the type safety of the interface; it is
+// possible to print a std::string using the "%s" conversion, and a
+// size_t using the "%d" conversion.  A similar result could be achieved
+// using either of the tfm::format() functions.  One prints on a user provided
+// stream:
+//
+//   tfm::format(std::cerr, "%s, %s %d, %.2d:%.2d\n",
+//               weekday, month, day, hour, min);
+//
+// The other returns a std::string:
+//
+//   std::string date = tfm::format("%s, %s %d, %.2d:%.2d\n",
+//                                  weekday, month, day, hour, min);
+//   std::cout << date;
+//
+// These are the three primary interface functions.  There is also a
+// convenience function printfln() which appends a newline to the usual result
+// of printf() for super simple logging.
+//
+//
+// User defined format functions
+// -----------------------------
+//
+// Simulating variadic templates in C++98 is pretty painful since it requires
+// writing out the same function for each desired number of arguments.  To make
+// this bearable tinyformat comes with a set of macros which are used
+// internally to generate the API, but which may also be used in user code.
+//
+// The three macros TINYFORMAT_ARGTYPES(n), TINYFORMAT_VARARGS(n) and
+// TINYFORMAT_PASSARGS(n) will generate a list of n argument types,
+// type/name pairs and argument names respectively when called with an integer
+// n between 1 and 16.  We can use these to define a macro which generates the
+// desired user defined function with n arguments.  To generate all 16 user
+// defined function bodies, use the macro TINYFORMAT_FOREACH_ARGNUM.  For an
+// example, see the implementation of printf() at the end of the source file.
+//
+// Sometimes it's useful to be able to pass a list of format arguments through
+// to a non-template function.  The FormatList class is provided as a way to do
+// this by storing the argument list in a type-opaque way.  Continuing the
+// example from above, we construct a FormatList using makeFormatList():
+//
+//   FormatListRef formatList = tfm::makeFormatList(weekday, month, day, hour, min);
+//
+// The format list can now be passed into any non-template function and used
+// via a call to the vformat() function:
+//
+//   tfm::vformat(std::cout, "%s, %s %d, %.2d:%.2d\n", formatList);
+//
+//
+// Additional API information
+// --------------------------
+//
+// Error handling: Define TINYFORMAT_ERROR to customize the error handling for
+// format strings which are unsupported or have the wrong number of format
+// specifiers (calls assert() by default).
+//
+// User defined types: Uses operator<< for user defined types by default.
+// Overload formatValue() for more control.
+
+
+#ifndef TINYFORMAT_H_INCLUDED
+#define TINYFORMAT_H_INCLUDED
+
+namespace tinyformat {}
+//------------------------------------------------------------------------------
+// Config section.  Customize to your liking!
+
+// Namespace alias to encourage brevity
+namespace tfm = tinyformat;
+
+// Error handling; calls assert() by default.
+#define TINYFORMAT_ERROR(reasonString) throw std::runtime_error(reasonString)
+
+// Define for C++11 variadic templates which make the code shorter & more
+// general.  If you don't define this, C++11 support is autodetected below.
+// #define TINYFORMAT_USE_VARIADIC_TEMPLATES
+
+
+//------------------------------------------------------------------------------
+// Implementation details.
+#include <algorithm>
+#include <cassert>
+#include <iostream>
+#include <sstream>
+#include <stdexcept>
+
+#ifndef TINYFORMAT_ERROR
+#   define TINYFORMAT_ERROR(reason) assert(0 && reason)
+#endif
+
+#if !defined(TINYFORMAT_USE_VARIADIC_TEMPLATES) && !defined(TINYFORMAT_NO_VARIADIC_TEMPLATES)
+#   ifdef __GXX_EXPERIMENTAL_CXX0X__
+#       define TINYFORMAT_USE_VARIADIC_TEMPLATES
+#   endif
+#endif
+
+#if defined(__GLIBCXX__) && __GLIBCXX__ < 20080201
+//  std::showpos is broken on old libstdc++ as provided with OSX.  See
+//  https://gcc.gnu.org/legacy-ml/libstdc++/2007-11/msg00075.html
+#   define TINYFORMAT_OLD_LIBSTDCPLUSPLUS_WORKAROUND
+#endif
+
+#ifdef __APPLE__
+// Workaround macOS linker warning: Xcode uses different default symbol
+// visibilities for static libs vs executables (see issue #25)
+#   define TINYFORMAT_HIDDEN __attribute__((visibility("hidden")))
+#else
+#   define TINYFORMAT_HIDDEN
+#endif
+
+namespace tinyformat {
+
+//------------------------------------------------------------------------------
+namespace detail {
+
+// Test whether type T1 is convertible to type T2
+template <typename T1, typename T2>
+struct is_convertible
+{
+    private:
+        // two types of different size
+        struct fail { char dummy[2]; };
+        struct succeed { char dummy; };
+        // Try to convert a T1 to a T2 by plugging into tryConvert
+        static fail tryConvert(...);
+        static succeed tryConvert(const T2&);
+        static const T1& makeT1();
+    public:
+#       ifdef _MSC_VER
+        // Disable spurious loss of precision warnings in tryConvert(makeT1())
+#       pragma warning(push)
+#       pragma warning(disable:4244)
+#       pragma warning(disable:4267)
+#       endif
+        // Standard trick: the (...) version of tryConvert will be chosen from
+        // the overload set only if the version taking a T2 doesn't match.
+        // Then we compare the sizes of the return types to check which
+        // function matched.  Very neat, in a disgusting kind of way :)
+        static const bool value =
+            sizeof(tryConvert(makeT1())) == sizeof(succeed);
+#       ifdef _MSC_VER
+#       pragma warning(pop)
+#       endif
+};
+
+
+// Detect when a type is not a wchar_t string
+template<typename T> struct is_wchar { typedef int tinyformat_wchar_is_not_supported; };
+template<> struct is_wchar<wchar_t*> {};
+template<> struct is_wchar<const wchar_t*> {};
+template<int n> struct is_wchar<const wchar_t[n]> {};
+template<int n> struct is_wchar<wchar_t[n]> {};
+
+
+// Format the value by casting to type fmtT.  This default implementation
+// should never be called.
+template<typename T, typename fmtT, bool convertible = is_convertible<T, fmtT>::value>
+struct formatValueAsType
+{
+    static void invoke(std::ostream& /*out*/, const T& /*value*/) { assert(0); }
+};
+// Specialized version for types that can actually be converted to fmtT, as
+// indicated by the "convertible" template parameter.
+template<typename T, typename fmtT>
+struct formatValueAsType<T,fmtT,true>
+{
+    static void invoke(std::ostream& out, const T& value)
+        { out << static_cast<fmtT>(value); }
+};
+
+#ifdef TINYFORMAT_OLD_LIBSTDCPLUSPLUS_WORKAROUND
+template<typename T, bool convertible = is_convertible<T, int>::value>
+struct formatZeroIntegerWorkaround
+{
+    static bool invoke(std::ostream& /**/, const T& /**/) { return false; }
+};
+template<typename T>
+struct formatZeroIntegerWorkaround<T,true>
+{
+    static bool invoke(std::ostream& out, const T& value)
+    {
+        if (static_cast<int>(value) == 0 && out.flags() & std::ios::showpos)
+        {
+            out << "+0";
+            return true;
+        }
+        return false;
+    }
+};
+#endif // TINYFORMAT_OLD_LIBSTDCPLUSPLUS_WORKAROUND
+
+// Convert an arbitrary type to integer.  The version with convertible=false
+// throws an error.
+template<typename T, bool convertible = is_convertible<T,int>::value>
+struct convertToInt
+{
+    static int invoke(const T& /*value*/)
+    {
+        TINYFORMAT_ERROR("tinyformat: Cannot convert from argument type to "
+                         "integer for use as variable width or precision");
+        return 0;
+    }
+};
+// Specialization for convertToInt when conversion is possible
+template<typename T>
+struct convertToInt<T,true>
+{
+    static int invoke(const T& value) { return static_cast<int>(value); }
+};
+
+// Format at most ntrunc characters to the given stream.
+template<typename T>
+inline void formatTruncated(std::ostream& out, const T& value, int ntrunc)
+{
+    std::ostringstream tmp;
+    tmp << value;
+    std::string result = tmp.str();
+    out.write(result.c_str(), (std::min)(ntrunc, static_cast<int>(result.size())));
+}
+#define TINYFORMAT_DEFINE_FORMAT_TRUNCATED_CSTR(type)       \
+inline void formatTruncated(std::ostream& out, type* value, int ntrunc) \
+{                                                           \
+    std::streamsize len = 0;                                \
+    while(len < ntrunc && value[len] != 0)                  \
+        ++len;                                              \
+    out.write(value, len);                                  \
+}
+// Overload for const char* and char*.  Could overload for signed & unsigned
+// char too, but these are technically unneeded for printf compatibility.
+TINYFORMAT_DEFINE_FORMAT_TRUNCATED_CSTR(const char)
+TINYFORMAT_DEFINE_FORMAT_TRUNCATED_CSTR(char)
+#undef TINYFORMAT_DEFINE_FORMAT_TRUNCATED_CSTR
+
+} // namespace detail
+
+
+//------------------------------------------------------------------------------
+// Variable formatting functions.  May be overridden for user-defined types if
+// desired.
+
+
+/// Format a value into a stream, delegating to operator<< by default.
+///
+/// Users may override this for their own types.  When this function is called,
+/// the stream flags will have been modified according to the format string.
+/// The format specification is provided in the range [fmtBegin, fmtEnd).  For
+/// truncating conversions, ntrunc is set to the desired maximum number of
+/// characters, for example "%.7s" calls formatValue with ntrunc = 7.
+///
+/// By default, formatValue() uses the usual stream insertion operator
+/// operator<< to format the type T, with special cases for the %c and %p
+/// conversions.
+template<typename T>
+inline void formatValue(std::ostream& out, const char* /*fmtBegin*/,
+                        const char* fmtEnd, int ntrunc, const T& value)
+{
+#ifndef TINYFORMAT_ALLOW_WCHAR_STRINGS
+    // Since we don't support printing of wchar_t using "%ls", make it fail at
+    // compile time in preference to printing as a void* at runtime.
+    typedef typename detail::is_wchar<T>::tinyformat_wchar_is_not_supported DummyType;
+    (void) DummyType(); // avoid unused type warning with gcc-4.8
+#endif
+    // The mess here is to support the %c and %p conversions: if these
+    // conversions are active we try to convert the type to a char or const
+    // void* respectively and format that instead of the value itself.  For the
+    // %p conversion it's important to avoid dereferencing the pointer, which
+    // could otherwise lead to a crash when printing a dangling (const char*).
+    const bool canConvertToChar = detail::is_convertible<T,char>::value;
+    const bool canConvertToVoidPtr = detail::is_convertible<T, const void*>::value;
+    if(canConvertToChar && *(fmtEnd-1) == 'c')
+        detail::formatValueAsType<T, char>::invoke(out, value);
+    else if(canConvertToVoidPtr && *(fmtEnd-1) == 'p')
+        detail::formatValueAsType<T, const void*>::invoke(out, value);
+#ifdef TINYFORMAT_OLD_LIBSTDCPLUSPLUS_WORKAROUND
+    else if(detail::formatZeroIntegerWorkaround<T>::invoke(out, value)) /**/;
+#endif
+    else if(ntrunc >= 0)
+    {
+        // Take care not to overread C strings in truncating conversions like
+        // "%.4s" where at most 4 characters may be read.
+        detail::formatTruncated(out, value, ntrunc);
+    }
+    else
+        out << value;
+}
+
+
+// Overloaded version for char types to support printing as an integer
+#define TINYFORMAT_DEFINE_FORMATVALUE_CHAR(charType)                  \
+inline void formatValue(std::ostream& out, const char* /*fmtBegin*/,  \
+                        const char* fmtEnd, int /**/, charType value) \
+{                                                                     \
+    switch(*(fmtEnd-1))                                               \
+    {                                                                 \
+        case 'u': case 'd': case 'i': case 'o': case 'X': case 'x':   \
+            out << static_cast<int>(value); break;                    \
+        default:                                                      \
+            out << value;                   break;                    \
+    }                                                                 \
+}
+// per 3.9.1: char, signed char and unsigned char are all distinct types
+TINYFORMAT_DEFINE_FORMATVALUE_CHAR(char)
+TINYFORMAT_DEFINE_FORMATVALUE_CHAR(signed char)
+TINYFORMAT_DEFINE_FORMATVALUE_CHAR(unsigned char)
+#undef TINYFORMAT_DEFINE_FORMATVALUE_CHAR
+
+
+//------------------------------------------------------------------------------
+// Tools for emulating variadic templates in C++98.  The basic idea here is
+// stolen from the boost preprocessor metaprogramming library and cut down to
+// be just general enough for what we need.
+
+#define TINYFORMAT_ARGTYPES(n) TINYFORMAT_ARGTYPES_ ## n
+#define TINYFORMAT_VARARGS(n) TINYFORMAT_VARARGS_ ## n
+#define TINYFORMAT_PASSARGS(n) TINYFORMAT_PASSARGS_ ## n
+#define TINYFORMAT_PASSARGS_TAIL(n) TINYFORMAT_PASSARGS_TAIL_ ## n
+
+// To keep it as transparent as possible, the macros below have been generated
+// using python via the excellent cog.py code generation script.  This avoids
+// the need for a bunch of complex (but more general) preprocessor tricks as
+// used in boost.preprocessor.
+//
+// To rerun the code generation in place, use `cog.py -r tinyformat.h`
+// (see https://nedbatchelder.com/code/cog/).  Alternatively you can just create
+// extra versions by hand.
+
+/*[[[cog
+maxParams = 16
+
+def makeCommaSepLists(lineTemplate, elemTemplate, startInd=1):
+    for j in range(startInd,maxParams+1):
+        list = ', '.join([elemTemplate % {'i':i} for i in range(startInd,j+1)])
+        cog.outl(lineTemplate % {'j':j, 'list':list})
+
+makeCommaSepLists('#define TINYFORMAT_ARGTYPES_%(j)d %(list)s',
+                  'class T%(i)d')
+
+cog.outl()
+makeCommaSepLists('#define TINYFORMAT_VARARGS_%(j)d %(list)s',
+                  'const T%(i)d& v%(i)d')
+
+cog.outl()
+makeCommaSepLists('#define TINYFORMAT_PASSARGS_%(j)d %(list)s', 'v%(i)d')
+
+cog.outl()
+cog.outl('#define TINYFORMAT_PASSARGS_TAIL_1')
+makeCommaSepLists('#define TINYFORMAT_PASSARGS_TAIL_%(j)d , %(list)s',
+                  'v%(i)d', startInd = 2)
+
+cog.outl()
+cog.outl('#define TINYFORMAT_FOREACH_ARGNUM(m) \\\n    ' +
+         ' '.join(['m(%d)' % (j,) for j in range(1,maxParams+1)]))
+]]]*/
+#define TINYFORMAT_ARGTYPES_1 class T1
+#define TINYFORMAT_ARGTYPES_2 class T1, class T2
+#define TINYFORMAT_ARGTYPES_3 class T1, class T2, class T3
+#define TINYFORMAT_ARGTYPES_4 class T1, class T2, class T3, class T4
+#define TINYFORMAT_ARGTYPES_5 class T1, class T2, class T3, class T4, class T5
+#define TINYFORMAT_ARGTYPES_6 class T1, class T2, class T3, class T4, class T5, class T6
+#define TINYFORMAT_ARGTYPES_7 class T1, class T2, class T3, class T4, class T5, class T6, class T7
+#define TINYFORMAT_ARGTYPES_8 class T1, class T2, class T3, class T4, class T5, class T6, class T7, class T8
+#define TINYFORMAT_ARGTYPES_9 class T1, class T2, class T3, class T4, class T5, class T6, class T7, class T8, class T9
+#define TINYFORMAT_ARGTYPES_10 class T1, class T2, class T3, class T4, class T5, class T6, class T7, class T8, class T9, class T10
+#define TINYFORMAT_ARGTYPES_11 class T1, class T2, class T3, class T4, class T5, class T6, class T7, class T8, class T9, class T10, class T11
+#define TINYFORMAT_ARGTYPES_12 class T1, class T2, class T3, class T4, class T5, class T6, class T7, class T8, class T9, class T10, class T11, class T12
+#define TINYFORMAT_ARGTYPES_13 class T1, class T2, class T3, class T4, class T5, class T6, class T7, class T8, class T9, class T10, class T11, class T12, class T13
+#define TINYFORMAT_ARGTYPES_14 class T1, class T2, class T3, class T4, class T5, class T6, class T7, class T8, class T9, class T10, class T11, class T12, class T13, class T14
+#define TINYFORMAT_ARGTYPES_15 class T1, class T2, class T3, class T4, class T5, class T6, class T7, class T8, class T9, class T10, class T11, class T12, class T13, class T14, class T15
+#define TINYFORMAT_ARGTYPES_16 class T1, class T2, class T3, class T4, class T5, class T6, class T7, class T8, class T9, class T10, class T11, class T12, class T13, class T14, class T15, class T16
+
+#define TINYFORMAT_VARARGS_1 const T1& v1
+#define TINYFORMAT_VARARGS_2 const T1& v1, const T2& v2
+#define TINYFORMAT_VARARGS_3 const T1& v1, const T2& v2, const T3& v3
+#define TINYFORMAT_VARARGS_4 const T1& v1, const T2& v2, const T3& v3, const T4& v4
+#define TINYFORMAT_VARARGS_5 const T1& v1, const T2& v2, const T3& v3, const T4& v4, const T5& v5
+#define TINYFORMAT_VARARGS_6 const T1& v1, const T2& v2, const T3& v3, const T4& v4, const T5& v5, const T6& v6
+#define TINYFORMAT_VARARGS_7 const T1& v1, const T2& v2, const T3& v3, const T4& v4, const T5& v5, const T6& v6, const T7& v7
+#define TINYFORMAT_VARARGS_8 const T1& v1, const T2& v2, const T3& v3, const T4& v4, const T5& v5, const T6& v6, const T7& v7, const T8& v8
+#define TINYFORMAT_VARARGS_9 const T1& v1, const T2& v2, const T3& v3, const T4& v4, const T5& v5, const T6& v6, const T7& v7, const T8& v8, const T9& v9
+#define TINYFORMAT_VARARGS_10 const T1& v1, const T2& v2, const T3& v3, const T4& v4, const T5& v5, const T6& v6, const T7& v7, const T8& v8, const T9& v9, const T10& v10
+#define TINYFORMAT_VARARGS_11 const T1& v1, const T2& v2, const T3& v3, const T4& v4, const T5& v5, const T6& v6, const T7& v7, const T8& v8, const T9& v9, const T10& v10, const T11& v11
+#define TINYFORMAT_VARARGS_12 const T1& v1, const T2& v2, const T3& v3, const T4& v4, const T5& v5, const T6& v6, const T7& v7, const T8& v8, const T9& v9, const T10& v10, const T11& v11, const T12& v12
+#define TINYFORMAT_VARARGS_13 const T1& v1, const T2& v2, const T3& v3, const T4& v4, const T5& v5, const T6& v6, const T7& v7, const T8& v8, const T9& v9, const T10& v10, const T11& v11, const T12& v12, const T13& v13
+#define TINYFORMAT_VARARGS_14 const T1& v1, const T2& v2, const T3& v3, const T4& v4, const T5& v5, const T6& v6, const T7& v7, const T8& v8, const T9& v9, const T10& v10, const T11& v11, const T12& v12, const T13& v13, const T14& v14
+#define TINYFORMAT_VARARGS_15 const T1& v1, const T2& v2, const T3& v3, const T4& v4, const T5& v5, const T6& v6, const T7& v7, const T8& v8, const T9& v9, const T10& v10, const T11& v11, const T12& v12, const T13& v13, const T14& v14, const T15& v15
+#define TINYFORMAT_VARARGS_16 const T1& v1, const T2& v2, const T3& v3, const T4& v4, const T5& v5, const T6& v6, const T7& v7, const T8& v8, const T9& v9, const T10& v10, const T11& v11, const T12& v12, const T13& v13, const T14& v14, const T15& v15, const T16& v16
+
+#define TINYFORMAT_PASSARGS_1 v1
+#define TINYFORMAT_PASSARGS_2 v1, v2
+#define TINYFORMAT_PASSARGS_3 v1, v2, v3
+#define TINYFORMAT_PASSARGS_4 v1, v2, v3, v4
+#define TINYFORMAT_PASSARGS_5 v1, v2, v3, v4, v5
+#define TINYFORMAT_PASSARGS_6 v1, v2, v3, v4, v5, v6
+#define TINYFORMAT_PASSARGS_7 v1, v2, v3, v4, v5, v6, v7
+#define TINYFORMAT_PASSARGS_8 v1, v2, v3, v4, v5, v6, v7, v8
+#define TINYFORMAT_PASSARGS_9 v1, v2, v3, v4, v5, v6, v7, v8, v9
+#define TINYFORMAT_PASSARGS_10 v1, v2, v3, v4, v5, v6, v7, v8, v9, v10
+#define TINYFORMAT_PASSARGS_11 v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11
+#define TINYFORMAT_PASSARGS_12 v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12
+#define TINYFORMAT_PASSARGS_13 v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13
+#define TINYFORMAT_PASSARGS_14 v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14
+#define TINYFORMAT_PASSARGS_15 v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15
+#define TINYFORMAT_PASSARGS_16 v1, v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16
+
+#define TINYFORMAT_PASSARGS_TAIL_1
+#define TINYFORMAT_PASSARGS_TAIL_2 , v2
+#define TINYFORMAT_PASSARGS_TAIL_3 , v2, v3
+#define TINYFORMAT_PASSARGS_TAIL_4 , v2, v3, v4
+#define TINYFORMAT_PASSARGS_TAIL_5 , v2, v3, v4, v5
+#define TINYFORMAT_PASSARGS_TAIL_6 , v2, v3, v4, v5, v6
+#define TINYFORMAT_PASSARGS_TAIL_7 , v2, v3, v4, v5, v6, v7
+#define TINYFORMAT_PASSARGS_TAIL_8 , v2, v3, v4, v5, v6, v7, v8
+#define TINYFORMAT_PASSARGS_TAIL_9 , v2, v3, v4, v5, v6, v7, v8, v9
+#define TINYFORMAT_PASSARGS_TAIL_10 , v2, v3, v4, v5, v6, v7, v8, v9, v10
+#define TINYFORMAT_PASSARGS_TAIL_11 , v2, v3, v4, v5, v6, v7, v8, v9, v10, v11
+#define TINYFORMAT_PASSARGS_TAIL_12 , v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12
+#define TINYFORMAT_PASSARGS_TAIL_13 , v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13
+#define TINYFORMAT_PASSARGS_TAIL_14 , v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14
+#define TINYFORMAT_PASSARGS_TAIL_15 , v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15
+#define TINYFORMAT_PASSARGS_TAIL_16 , v2, v3, v4, v5, v6, v7, v8, v9, v10, v11, v12, v13, v14, v15, v16
+
+#define TINYFORMAT_FOREACH_ARGNUM(m) \
+    m(1) m(2) m(3) m(4) m(5) m(6) m(7) m(8) m(9) m(10) m(11) m(12) m(13) m(14) m(15) m(16)
+//[[[end]]]
+
+
+
+namespace detail {
+
+// Type-opaque holder for an argument to format(), with associated actions on
+// the type held as explicit function pointers.  This allows FormatArg's for
+// each argument to be allocated as a homogenous array inside FormatList
+// whereas a naive implementation based on inheritance does not.
+class FormatArg
+{
+    public:
+        FormatArg() {}
+
+        template<typename T>
+        FormatArg(const T& value)
+            : m_value(static_cast<const void*>(&value)),
+            m_formatImpl(&formatImpl<T>),
+            m_toIntImpl(&toIntImpl<T>)
+        { }
+
+        void format(std::ostream& out, const char* fmtBegin,
+                    const char* fmtEnd, int ntrunc) const
+        {
+            m_formatImpl(out, fmtBegin, fmtEnd, ntrunc, m_value);
+        }
+
+        int toInt() const
+        {
+            return m_toIntImpl(m_value);
+        }
+
+    private:
+        template<typename T>
+        TINYFORMAT_HIDDEN static void formatImpl(std::ostream& out, const char* fmtBegin,
+                        const char* fmtEnd, int ntrunc, const void* value)
+        {
+            formatValue(out, fmtBegin, fmtEnd, ntrunc, *static_cast<const T*>(value));
+        }
+
+        template<typename T>
+        TINYFORMAT_HIDDEN static int toIntImpl(const void* value)
+        {
+            return convertToInt<T>::invoke(*static_cast<const T*>(value));
+        }
+
+        const void* m_value;
+        void (*m_formatImpl)(std::ostream& out, const char* fmtBegin,
+                             const char* fmtEnd, int ntrunc, const void* value);
+        int (*m_toIntImpl)(const void* value);
+};
+
+
+// Parse and return an integer from the string c, as atoi()
+// On return, c is set to one past the end of the integer.
+inline int parseIntAndAdvance(const char*& c)
+{
+    int i = 0;
+    for(;*c >= '0' && *c <= '9'; ++c)
+        i = 10*i + (*c - '0');
+    return i;
+}
+
+// Print literal part of format string and return next format spec
+// position.
+//
+// Skips over any occurrences of '%%', printing a literal '%' to the
+// output.  The position of the first % character of the next
+// nontrivial format spec is returned, or the end of string.
+inline const char* printFormatStringLiteral(std::ostream& out, const char* fmt)
+{
+    const char* c = fmt;
+    for(;; ++c)
+    {
+        switch(*c)
+        {
+            case '\0':
+                out.write(fmt, c - fmt);
+                return c;
+            case '%':
+                out.write(fmt, c - fmt);
+                if(*(c+1) != '%')
+                    return c;
+                // for "%%", tack trailing % onto next literal section.
+                fmt = ++c;
+                break;
+            default:
+                break;
+        }
+    }
+}
+
+
+// Parse a format string and set the stream state accordingly.
+//
+// The format mini-language recognized here is meant to be the one from C99,
+// with the form "%[flags][width][.precision][length]type".
+//
+// Formatting options which can't be natively represented using the ostream
+// state are returned in spacePadPositive (for space padded positive numbers)
+// and ntrunc (for truncating conversions).  argIndex is incremented if
+// necessary to pull out variable width and precision.  The function returns a
+// pointer to the character after the end of the current format spec.
+inline const char* streamStateFromFormat(std::ostream& out, bool& spacePadPositive,
+                                         int& ntrunc, const char* fmtStart,
+                                         const detail::FormatArg* formatters,
+                                         int& argIndex, int numFormatters)
+{
+    if(*fmtStart != '%')
+    {
+        TINYFORMAT_ERROR("tinyformat: Not enough conversion specifiers in format string");
+        return fmtStart;
+    }
+    // Reset stream state to defaults.
+    out.width(0);
+    out.precision(6);
+    out.fill(' ');
+    // Reset most flags; ignore irrelevant unitbuf & skipws.
+    out.unsetf(std::ios::adjustfield | std::ios::basefield |
+               std::ios::floatfield | std::ios::showbase | std::ios::boolalpha |
+               std::ios::showpoint | std::ios::showpos | std::ios::uppercase);
+    bool precisionSet = false;
+    bool widthSet = false;
+    int widthExtra = 0;
+    const char* c = fmtStart + 1;
+    // 1) Parse flags
+    for(;; ++c)
+    {
+        switch(*c)
+        {
+            case '#':
+                out.setf(std::ios::showpoint | std::ios::showbase);
+                continue;
+            case '0':
+                // overridden by left alignment ('-' flag)
+                if(!(out.flags() & std::ios::left))
+                {
+                    // Use internal padding so that numeric values are
+                    // formatted correctly, eg -00010 rather than 000-10
+                    out.fill('0');
+                    out.setf(std::ios::internal, std::ios::adjustfield);
+                }
+                continue;
+            case '-':
+                out.fill(' ');
+                out.setf(std::ios::left, std::ios::adjustfield);
+                continue;
+            case ' ':
+                // overridden by show positive sign, '+' flag.
+                if(!(out.flags() & std::ios::showpos))
+                    spacePadPositive = true;
+                continue;
+            case '+':
+                out.setf(std::ios::showpos);
+                spacePadPositive = false;
+                widthExtra = 1;
+                continue;
+            default:
+                break;
+        }
+        break;
+    }
+    // 2) Parse width
+    if(*c >= '0' && *c <= '9')
+    {
+        widthSet = true;
+        out.width(parseIntAndAdvance(c));
+    }
+    if(*c == '*')
+    {
+        widthSet = true;
+        int width = 0;
+        if(argIndex < numFormatters)
+            width = formatters[argIndex++].toInt();
+        else
+            TINYFORMAT_ERROR("tinyformat: Not enough arguments to read variable width");
+        if(width < 0)
+        {
+            // negative widths correspond to '-' flag set
+            out.fill(' ');
+            out.setf(std::ios::left, std::ios::adjustfield);
+            width = -width;
+        }
+        out.width(width);
+        ++c;
+    }
+    // 3) Parse precision
+    if(*c == '.')
+    {
+        ++c;
+        int precision = 0;
+        if(*c == '*')
+        {
+            ++c;
+            if(argIndex < numFormatters)
+                precision = formatters[argIndex++].toInt();
+            else
+                TINYFORMAT_ERROR("tinyformat: Not enough arguments to read variable precision");
+        }
+        else
+        {
+            if(*c >= '0' && *c <= '9')
+                precision = parseIntAndAdvance(c);
+            else if(*c == '-') // negative precisions ignored, treated as zero.
+                parseIntAndAdvance(++c);
+        }
+        out.precision(precision);
+        precisionSet = true;
+    }
+    // 4) Ignore any C99 length modifier
+    while(*c == 'l' || *c == 'h' || *c == 'L' ||
+          *c == 'j' || *c == 'z' || *c == 't')
+        ++c;
+    // 5) We're up to the conversion specifier character.
+    // Set stream flags based on conversion specifier (thanks to the
+    // boost::format class for forging the way here).
+    bool intConversion = false;
+    switch(*c)
+    {
+        case 'u': case 'd': case 'i':
+            out.setf(std::ios::dec, std::ios::basefield);
+            intConversion = true;
+            break;
+        case 'o':
+            out.setf(std::ios::oct, std::ios::basefield);
+            intConversion = true;
+            break;
+        case 'X':
+            out.setf(std::ios::uppercase);
+        case 'x': case 'p':
+            out.setf(std::ios::hex, std::ios::basefield);
+            intConversion = true;
+            break;
+        case 'E':
+            out.setf(std::ios::uppercase);
+        case 'e':
+            out.setf(std::ios::scientific, std::ios::floatfield);
+            out.setf(std::ios::dec, std::ios::basefield);
+            break;
+        case 'F':
+            out.setf(std::ios::uppercase);
+        case 'f':
+            out.setf(std::ios::fixed, std::ios::floatfield);
+            break;
+        case 'G':
+            out.setf(std::ios::uppercase);
+        case 'g':
+            out.setf(std::ios::dec, std::ios::basefield);
+            // As in boost::format, let stream decide float format.
+            out.flags(out.flags() & ~std::ios::floatfield);
+            break;
+        case 'a': case 'A':
+            TINYFORMAT_ERROR("tinyformat: the %a and %A conversion specs "
+                             "are not supported");
+            break;
+        case 'c':
+            // Handled as special case inside formatValue()
+            break;
+        case 's':
+            if(precisionSet)
+                ntrunc = static_cast<int>(out.precision());
+            // Make %s print booleans as "true" and "false"
+            out.setf(std::ios::boolalpha);
+            break;
+        case 'n':
+            // Not supported - will cause problems!
+            TINYFORMAT_ERROR("tinyformat: %n conversion spec not supported");
+            break;
+        case '\0':
+            TINYFORMAT_ERROR("tinyformat: Conversion spec incorrectly "
+                             "terminated by end of string");
+            return c;
+        default:
+            break;
+    }
+    if(intConversion && precisionSet && !widthSet)
+    {
+        // "precision" for integers gives the minimum number of digits (to be
+        // padded with zeros on the left).  This isn't really supported by the
+        // iostreams, but we can approximately simulate it with the width if
+        // the width isn't otherwise used.
+        out.width(out.precision() + widthExtra);
+        out.setf(std::ios::internal, std::ios::adjustfield);
+        out.fill('0');
+    }
+    return c+1;
+}
+
+
+//------------------------------------------------------------------------------
+inline void formatImpl(std::ostream& out, const char* fmt,
+                       const detail::FormatArg* formatters,
+                       int numFormatters)
+{
+    // Saved stream state
+    std::streamsize origWidth = out.width();
+    std::streamsize origPrecision = out.precision();
+    std::ios::fmtflags origFlags = out.flags();
+    char origFill = out.fill();
+
+    for (int argIndex = 0; argIndex < numFormatters; ++argIndex)
+    {
+        // Parse the format string
+        fmt = printFormatStringLiteral(out, fmt);
+        bool spacePadPositive = false;
+        int ntrunc = -1;
+        const char* fmtEnd = streamStateFromFormat(out, spacePadPositive, ntrunc, fmt,
+                                                   formatters, argIndex, numFormatters);
+        if (argIndex >= numFormatters)
+        {
+            // Check args remain after reading any variable width/precision
+            TINYFORMAT_ERROR("tinyformat: Not enough format arguments");
+            return;
+        }
+        const FormatArg& arg = formatters[argIndex];
+        // Format the arg into the stream.
+        if(!spacePadPositive)
+            arg.format(out, fmt, fmtEnd, ntrunc);
+        else
+        {
+            // The following is a special case with no direct correspondence
+            // between stream formatting and the printf() behaviour.  Simulate
+            // it crudely by formatting into a temporary string stream and
+            // munging the resulting string.
+            std::ostringstream tmpStream;
+            tmpStream.copyfmt(out);
+            tmpStream.setf(std::ios::showpos);
+            arg.format(tmpStream, fmt, fmtEnd, ntrunc);
+            std::string result = tmpStream.str(); // allocates... yuck.
+            for(size_t i = 0, iend = result.size(); i < iend; ++i)
+                if(result[i] == '+') result[i] = ' ';
+            out << result;
+        }
+        fmt = fmtEnd;
+    }
+
+    // Print remaining part of format string.
+    fmt = printFormatStringLiteral(out, fmt);
+    if(*fmt != '\0')
+        TINYFORMAT_ERROR("tinyformat: Too many conversion specifiers in format string");
+
+    // Restore stream state
+    out.width(origWidth);
+    out.precision(origPrecision);
+    out.flags(origFlags);
+    out.fill(origFill);
+}
+
+} // namespace detail
+
+
+/// List of template arguments format(), held in a type-opaque way.
+///
+/// A const reference to FormatList (typedef'd as FormatListRef) may be
+/// conveniently used to pass arguments to non-template functions: All type
+/// information has been stripped from the arguments, leaving just enough of a
+/// common interface to perform formatting as required.
+class FormatList
+{
+    public:
+        FormatList(detail::FormatArg* formatters, int N)
+            : m_formatters(formatters), m_N(N) { }
+
+        friend void vformat(std::ostream& out, const char* fmt,
+                            const FormatList& list);
+
+    private:
+        const detail::FormatArg* m_formatters;
+        int m_N;
+};
+
+/// Reference to type-opaque format list for passing to vformat()
+typedef const FormatList& FormatListRef;
+
+
+namespace detail {
+
+// Format list subclass with fixed storage to avoid dynamic allocation
+template<int N>
+class FormatListN : public FormatList
+{
+    public:
+#ifdef TINYFORMAT_USE_VARIADIC_TEMPLATES
+        template<typename... Args>
+        FormatListN(const Args&... args)
+            : FormatList(&m_formatterStore[0], N),
+            m_formatterStore { FormatArg(args)... }
+        { static_assert(sizeof...(args) == N, "Number of args must be N"); }
+#else // C++98 version
+        void init(int) {}
+#       define TINYFORMAT_MAKE_FORMATLIST_CONSTRUCTOR(n)       \
+                                                               \
+        template<TINYFORMAT_ARGTYPES(n)>                       \
+        FormatListN(TINYFORMAT_VARARGS(n))                     \
+            : FormatList(&m_formatterStore[0], n)              \
+        { assert(n == N); init(0, TINYFORMAT_PASSARGS(n)); }   \
+                                                               \
+        template<TINYFORMAT_ARGTYPES(n)>                       \
+        void init(int i, TINYFORMAT_VARARGS(n))                \
+        {                                                      \
+            m_formatterStore[i] = FormatArg(v1);               \
+            init(i+1 TINYFORMAT_PASSARGS_TAIL(n));             \
+        }
+
+        TINYFORMAT_FOREACH_ARGNUM(TINYFORMAT_MAKE_FORMATLIST_CONSTRUCTOR)
+#       undef TINYFORMAT_MAKE_FORMATLIST_CONSTRUCTOR
+#endif
+
+    private:
+        FormatArg m_formatterStore[N];
+};
+
+// Special 0-arg version - MSVC says zero-sized C array in struct is nonstandard
+template<> class FormatListN<0> : public FormatList
+{
+    public: FormatListN() : FormatList(0, 0) {}
+};
+
+} // namespace detail
+
+
+//------------------------------------------------------------------------------
+// Primary API functions
+
+#ifdef TINYFORMAT_USE_VARIADIC_TEMPLATES
+
+/// Make type-agnostic format list from list of template arguments.
+///
+/// The exact return type of this function is an implementation detail and
+/// shouldn't be relied upon.  Instead it should be stored as a FormatListRef:
+///
+///   FormatListRef formatList = makeFormatList( /*...*/ );
+template<typename... Args>
+detail::FormatListN<sizeof...(Args)> makeFormatList(const Args&... args)
+{
+    return detail::FormatListN<sizeof...(args)>(args...);
+}
+
+#else // C++98 version
+
+inline detail::FormatListN<0> makeFormatList()
+{
+    return detail::FormatListN<0>();
+}
+#define TINYFORMAT_MAKE_MAKEFORMATLIST(n)                     \
+template<TINYFORMAT_ARGTYPES(n)>                              \
+detail::FormatListN<n> makeFormatList(TINYFORMAT_VARARGS(n))  \
+{                                                             \
+    return detail::FormatListN<n>(TINYFORMAT_PASSARGS(n));    \
+}
+TINYFORMAT_FOREACH_ARGNUM(TINYFORMAT_MAKE_MAKEFORMATLIST)
+#undef TINYFORMAT_MAKE_MAKEFORMATLIST
+
+#endif
+
+/// Format list of arguments to the stream according to the given format string.
+///
+/// The name vformat() is chosen for the semantic similarity to vprintf(): the
+/// list of format arguments is held in a single function argument.
+inline void vformat(std::ostream& out, const char* fmt, FormatListRef list)
+{
+    detail::formatImpl(out, fmt, list.m_formatters, list.m_N);
+}
+
+
+#ifdef TINYFORMAT_USE_VARIADIC_TEMPLATES
+
+/// Format list of arguments to the stream according to given format string.
+template<typename... Args>
+void format(std::ostream& out, const char* fmt, const Args&... args)
+{
+    vformat(out, fmt, makeFormatList(args...));
+}
+
+/// Format list of arguments according to the given format string and return
+/// the result as a string.
+template<typename... Args>
+std::string format(const char* fmt, const Args&... args)
+{
+    std::ostringstream oss;
+    format(oss, fmt, args...);
+    return oss.str();
+}
+
+/// Format list of arguments to std::cout, according to the given format string
+template<typename... Args>
+void printf(const char* fmt, const Args&... args)
+{
+    format(std::cout, fmt, args...);
+}
+
+template<typename... Args>
+void printfln(const char* fmt, const Args&... args)
+{
+    format(std::cout, fmt, args...);
+    std::cout << '\n';
+}
+
+#else // C++98 version
+
+inline void format(std::ostream& out, const char* fmt)
+{
+    vformat(out, fmt, makeFormatList());
+}
+
+inline std::string format(const char* fmt)
+{
+    std::ostringstream oss;
+    format(oss, fmt);
+    return oss.str();
+}
+
+inline void printf(const char* fmt)
+{
+    format(std::cout, fmt);
+}
+
+inline void printfln(const char* fmt)
+{
+    format(std::cout, fmt);
+    std::cout << '\n';
+}
+
+#define TINYFORMAT_MAKE_FORMAT_FUNCS(n)                                   \
+                                                                          \
+template<TINYFORMAT_ARGTYPES(n)>                                          \
+void format(std::ostream& out, const char* fmt, TINYFORMAT_VARARGS(n))    \
+{                                                                         \
+    vformat(out, fmt, makeFormatList(TINYFORMAT_PASSARGS(n)));            \
+}                                                                         \
+                                                                          \
+template<TINYFORMAT_ARGTYPES(n)>                                          \
+std::string format(const char* fmt, TINYFORMAT_VARARGS(n))                \
+{                                                                         \
+    std::ostringstream oss;                                               \
+    format(oss, fmt, TINYFORMAT_PASSARGS(n));                             \
+    return oss.str();                                                     \
+}                                                                         \
+                                                                          \
+template<TINYFORMAT_ARGTYPES(n)>                                          \
+void printf(const char* fmt, TINYFORMAT_VARARGS(n))                       \
+{                                                                         \
+    format(std::cout, fmt, TINYFORMAT_PASSARGS(n));                       \
+}                                                                         \
+                                                                          \
+template<TINYFORMAT_ARGTYPES(n)>                                          \
+void printfln(const char* fmt, TINYFORMAT_VARARGS(n))                     \
+{                                                                         \
+    format(std::cout, fmt, TINYFORMAT_PASSARGS(n));                       \
+    std::cout << '\n';                                                    \
+}
+
+TINYFORMAT_FOREACH_ARGNUM(TINYFORMAT_MAKE_FORMAT_FUNCS)
+#undef TINYFORMAT_MAKE_FORMAT_FUNCS
+
+#endif
+
+// Added for Bitcoin Core
+template<typename... Args>
+std::string format(const std::string &fmt, const Args&... args)
+{
+    std::ostringstream oss;
+    format(oss, fmt.c_str(), args...);
+    return oss.str();
+}
+
+} // namespace tinyformat
+
+#define strprintf tfm::format
+
+#endif // TINYFORMAT_H_INCLUDED
diff --git a/depend/zcash/src/torcontrol.cpp b/depend/zcash/src/torcontrol.cpp
new file mode 100644
index 000000000..21f746765
--- /dev/null
+++ b/depend/zcash/src/torcontrol.cpp
@@ -0,0 +1,777 @@
+// Copyright (c) 2015-2017 The Bitcoin Core developers
+// Copyright (c) 2017 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "torcontrol.h"
+#include "utilstrencodings.h"
+#include "net.h"
+#include "util.h"
+#include "crypto/hmac_sha256.h"
+
+#include <vector>
+#include <deque>
+#include <set>
+#include <stdlib.h>
+
+#include <boost/bind/bind.hpp>
+#include <boost/signals2/signal.hpp>
+#include <boost/algorithm/string/predicate.hpp>
+#include <boost/algorithm/string/split.hpp>
+#include <boost/algorithm/string/classification.hpp>
+#include <boost/algorithm/string/replace.hpp>
+
+#include <event2/bufferevent.h>
+#include <event2/buffer.h>
+#include <event2/util.h>
+#include <event2/event.h>
+#include <event2/thread.h>
+
+using namespace boost::placeholders;
+
+/** Default control port */
+const std::string DEFAULT_TOR_CONTROL = "127.0.0.1:9051";
+/** Tor cookie size (from control-spec.txt) */
+static const int TOR_COOKIE_SIZE = 32;
+/** Size of client/server nonce for SAFECOOKIE */
+static const int TOR_NONCE_SIZE = 32;
+/** For computing serverHash in SAFECOOKIE */
+static const std::string TOR_SAFE_SERVERKEY = "Tor safe cookie authentication server-to-controller hash";
+/** For computing clientHash in SAFECOOKIE */
+static const std::string TOR_SAFE_CLIENTKEY = "Tor safe cookie authentication controller-to-server hash";
+/** Exponential backoff configuration - initial timeout in seconds */
+static const float RECONNECT_TIMEOUT_START = 1.0;
+/** Exponential backoff configuration - growth factor */
+static const float RECONNECT_TIMEOUT_EXP = 1.5;
+/** Maximum length for lines received on TorControlConnection.
+ * tor-control-spec.txt mentions that there is explicitly no limit defined to line length,
+ * this is belt-and-suspenders sanity limit to prevent memory exhaustion.
+ */
+static const int MAX_LINE_LENGTH = 100000;
+
+/****** Low-level TorControlConnection ********/
+
+/** Reply from Tor, can be single or multi-line */
+class TorControlReply
+{
+public:
+    TorControlReply() { Clear(); }
+
+    int code;
+    std::vector<std::string> lines;
+
+    void Clear()
+    {
+        code = 0;
+        lines.clear();
+    }
+};
+
+/** Low-level handling for Tor control connection.
+ * Speaks the SMTP-like protocol as defined in torspec/control-spec.txt
+ */
+class TorControlConnection
+{
+public:
+    typedef std::function<void(TorControlConnection&)> ConnectionCB;
+    typedef std::function<void(TorControlConnection &,const TorControlReply &)> ReplyHandlerCB;
+
+    /** Create a new TorControlConnection.
+     */
+    TorControlConnection(struct event_base *base);
+    ~TorControlConnection();
+
+    /**
+     * Connect to a Tor control port.
+     * target is address of the form host:port.
+     * connected is the handler that is called when connection is successfully established.
+     * disconnected is a handler that is called when the connection is broken.
+     * Return true on success.
+     */
+    bool Connect(const std::string &target, const ConnectionCB& connected, const ConnectionCB& disconnected);
+
+    /**
+     * Disconnect from Tor control port.
+     */
+    bool Disconnect();
+
+    /** Send a command, register a handler for the reply.
+     * A trailing CRLF is automatically added.
+     * Return true on success.
+     */
+    bool Command(const std::string &cmd, const ReplyHandlerCB& reply_handler);
+
+    /** Response handlers for async replies */
+    boost::signals2::signal<void(TorControlConnection &,const TorControlReply &)> async_handler;
+private:
+    /** Callback when ready for use */
+    std::function<void(TorControlConnection&)> connected;
+    /** Callback when connection lost */
+    std::function<void(TorControlConnection&)> disconnected;
+    /** Libevent event base */
+    struct event_base *base;
+    /** Connection to control socket */
+    struct bufferevent *b_conn;
+    /** Message being received */
+    TorControlReply message;
+    /** Response handlers */
+    std::deque<ReplyHandlerCB> reply_handlers;
+
+    /** Libevent handlers: internal */
+    static void readcb(struct bufferevent *bev, void *ctx);
+    static void eventcb(struct bufferevent *bev, short what, void *ctx);
+};
+
+TorControlConnection::TorControlConnection(struct event_base *_base):
+    base(_base), b_conn(0)
+{
+}
+
+TorControlConnection::~TorControlConnection()
+{
+    if (b_conn)
+        bufferevent_free(b_conn);
+}
+
+void TorControlConnection::readcb(struct bufferevent *bev, void *ctx)
+{
+    TorControlConnection *self = (TorControlConnection*)ctx;
+    struct evbuffer *input = bufferevent_get_input(bev);
+    size_t n_read_out = 0;
+    char *line;
+    assert(input);
+    //  If there is not a whole line to read, evbuffer_readln returns NULL
+    while((line = evbuffer_readln(input, &n_read_out, EVBUFFER_EOL_CRLF)) != NULL)
+    {
+        std::string s(line, n_read_out);
+        free(line);
+        if (s.size() < 4) // Short line
+            continue;
+        // <status>(-|+| )<data><CRLF>
+        self->message.code = atoi(s.substr(0,3));
+        self->message.lines.push_back(s.substr(4));
+        char ch = s[3]; // '-','+' or ' '
+        if (ch == ' ') {
+            // Final line, dispatch reply and clean up
+            if (self->message.code >= 600) {
+                // Dispatch async notifications to async handler
+                // Synchronous and asynchronous messages are never interleaved
+                self->async_handler(*self, self->message);
+            } else {
+                if (!self->reply_handlers.empty()) {
+                    // Invoke reply handler with message
+                    self->reply_handlers.front()(*self, self->message);
+                    self->reply_handlers.pop_front();
+                } else {
+                    LogPrint("tor", "tor: Received unexpected sync reply %i\n", self->message.code);
+                }
+            }
+            self->message.Clear();
+        }
+    }
+    //  Check for size of buffer - protect against memory exhaustion with very long lines
+    //  Do this after evbuffer_readln to make sure all full lines have been
+    //  removed from the buffer. Everything left is an incomplete line.
+    if (evbuffer_get_length(input) > MAX_LINE_LENGTH) {
+        LogPrintf("tor: Disconnecting because MAX_LINE_LENGTH exceeded\n");
+        self->Disconnect();
+    }
+}
+
+void TorControlConnection::eventcb(struct bufferevent *bev, short what, void *ctx)
+{
+    TorControlConnection *self = (TorControlConnection*)ctx;
+    if (what & BEV_EVENT_CONNECTED) {
+        LogPrint("tor", "tor: Successfully connected!\n");
+        self->connected(*self);
+    } else if (what & (BEV_EVENT_EOF|BEV_EVENT_ERROR)) {
+        if (what & BEV_EVENT_ERROR)
+            LogPrint("tor", "tor: Error connecting to Tor control socket\n");
+        else
+            LogPrint("tor", "tor: End of stream\n");
+        self->Disconnect();
+        self->disconnected(*self);
+    }
+}
+
+bool TorControlConnection::Connect(const std::string &target, const ConnectionCB& _connected, const ConnectionCB&  _disconnected)
+{
+    if (b_conn)
+        Disconnect();
+    // Parse target address:port
+    struct sockaddr_storage connect_to_addr;
+    int connect_to_addrlen = sizeof(connect_to_addr);
+    if (evutil_parse_sockaddr_port(target.c_str(),
+        (struct sockaddr*)&connect_to_addr, &connect_to_addrlen)<0) {
+        LogPrintf("tor: Error parsing socket address %s\n", target);
+        return false;
+    }
+
+    // Create a new socket, set up callbacks and enable notification bits
+    b_conn = bufferevent_socket_new(base, -1, BEV_OPT_CLOSE_ON_FREE);
+    if (!b_conn)
+        return false;
+    bufferevent_setcb(b_conn, TorControlConnection::readcb, NULL, TorControlConnection::eventcb, this);
+    bufferevent_enable(b_conn, EV_READ|EV_WRITE);
+    this->connected = _connected;
+    this->disconnected = _disconnected;
+
+    // Finally, connect to target
+    if (bufferevent_socket_connect(b_conn, (struct sockaddr*)&connect_to_addr, connect_to_addrlen) < 0) {
+        LogPrintf("tor: Error connecting to address %s\n", target);
+        return false;
+    }
+    return true;
+}
+
+bool TorControlConnection::Disconnect()
+{
+    if (b_conn)
+        bufferevent_free(b_conn);
+    b_conn = 0;
+    return true;
+}
+
+bool TorControlConnection::Command(const std::string &cmd, const ReplyHandlerCB& reply_handler)
+{
+    if (!b_conn)
+        return false;
+    struct evbuffer *buf = bufferevent_get_output(b_conn);
+    if (!buf)
+        return false;
+    evbuffer_add(buf, cmd.data(), cmd.size());
+    evbuffer_add(buf, "\r\n", 2);
+    reply_handlers.push_back(reply_handler);
+    return true;
+}
+
+/****** General parsing utilities ********/
+
+/* Split reply line in the form 'AUTH METHODS=...' into a type
+ * 'AUTH' and arguments 'METHODS=...'.
+ * Grammar is implicitly defined in https://spec.torproject.org/control-spec by
+ * the server reply formats for PROTOCOLINFO (S3.21) and AUTHCHALLENGE (S3.24).
+ */
+static std::pair<std::string,std::string> SplitTorReplyLine(const std::string &s)
+{
+    size_t ptr=0;
+    std::string type;
+    while (ptr < s.size() && s[ptr] != ' ') {
+        type.push_back(s[ptr]);
+        ++ptr;
+    }
+    if (ptr < s.size())
+        ++ptr; // skip ' '
+    return make_pair(type, s.substr(ptr));
+}
+
+/** Parse reply arguments in the form 'METHODS=COOKIE,SAFECOOKIE COOKIEFILE=".../control_auth_cookie"'.
+ * Returns a map of keys to values, or an empty map if there was an error.
+ * Grammar is implicitly defined in https://spec.torproject.org/control-spec by
+ * the server reply formats for PROTOCOLINFO (S3.21), AUTHCHALLENGE (S3.24),
+ * and ADD_ONION (S3.27). See also sections 2.1 and 2.3.
+ */
+static std::map<std::string,std::string> ParseTorReplyMapping(const std::string &s)
+{
+    std::map<std::string,std::string> mapping;
+    size_t ptr=0;
+    while (ptr < s.size()) {
+        std::string key, value;
+        while (ptr < s.size() && s[ptr] != '=' && s[ptr] != ' ') {
+            key.push_back(s[ptr]);
+            ++ptr;
+        }
+        if (ptr == s.size()) // unexpected end of line
+            return std::map<std::string,std::string>();
+        if (s[ptr] == ' ') // The remaining string is an OptArguments
+            break;
+        ++ptr; // skip '='
+        if (ptr < s.size() && s[ptr] == '"') { // Quoted string
+            ++ptr; // skip opening '"'
+            bool escape_next = false;
+            while (ptr < s.size() && (escape_next || s[ptr] != '"')) {
+                // Repeated backslashes must be interpreted as pairs
+                escape_next = (s[ptr] == '\\' && !escape_next);
+                value.push_back(s[ptr]);
+                ++ptr;
+            }
+            if (ptr == s.size()) // unexpected end of line
+                return std::map<std::string,std::string>();
+            ++ptr; // skip closing '"'
+            /**
+             * Unescape value. Per https://spec.torproject.org/control-spec section 2.1.1:
+             *
+             *   For future-proofing, controller implementors MAY use the following
+             *   rules to be compatible with buggy Tor implementations and with
+             *   future ones that implement the spec as intended:
+             *
+             *     Read \n \t \r and \0 ... \377 as C escapes.
+             *     Treat a backslash followed by any other character as that character.
+             */
+            std::string escaped_value;
+            for (size_t i = 0; i < value.size(); ++i) {
+                if (value[i] == '\\') {
+                    // This will always be valid, because if the QuotedString
+                    // ended in an odd number of backslashes, then the parser
+                    // would already have returned above, due to a missing
+                    // terminating double-quote.
+                    ++i;
+                    if (value[i] == 'n') {
+                        escaped_value.push_back('\n');
+                    } else if (value[i] == 't') {
+                        escaped_value.push_back('\t');
+                    } else if (value[i] == 'r') {
+                        escaped_value.push_back('\r');
+                    } else if ('0' <= value[i] && value[i] <= '7') {
+                        size_t j;
+                        // Octal escape sequences have a limit of three octal digits,
+                        // but terminate at the first character that is not a valid
+                        // octal digit if encountered sooner.
+                        for (j = 1; j < 3 && (i+j) < value.size() && '0' <= value[i+j] && value[i+j] <= '7'; ++j) {}
+                        // Tor restricts first digit to 0-3 for three-digit octals.
+                        // A leading digit of 4-7 would therefore be interpreted as
+                        // a two-digit octal.
+                        if (j == 3 && value[i] > '3') {
+                            j--;
+                        }
+                        escaped_value.push_back(strtol(value.substr(i, j).c_str(), NULL, 8));
+                        // Account for automatic incrementing at loop end
+                        i += j - 1;
+                    } else {
+                        escaped_value.push_back(value[i]);
+                    }
+                } else {
+                    escaped_value.push_back(value[i]);
+                }
+            }
+            value = escaped_value;
+        } else { // Unquoted value. Note that values can contain '=' at will, just no spaces
+            while (ptr < s.size() && s[ptr] != ' ') {
+                value.push_back(s[ptr]);
+                ++ptr;
+            }
+        }
+        if (ptr < s.size() && s[ptr] == ' ')
+            ++ptr; // skip ' ' after key=value
+        mapping[key] = value;
+    }
+    return mapping;
+}
+
+/** Read full contents of a file and return them in a std::string.
+ * Returns a pair <status, string>.
+ * If an error occurred, status will be false, otherwise status will be true and the data will be returned in string.
+ *
+ * @param maxsize Puts a maximum size limit on the file that is read. If the file is larger than this, truncated data
+ *         (with len > maxsize) will be returned.
+ */
+static std::pair<bool,std::string> ReadBinaryFile(const fs::path &filename, size_t maxsize=std::numeric_limits<size_t>::max())
+{
+    FILE *f = fsbridge::fopen(filename, "rb");
+    if (f == NULL)
+        return std::make_pair(false,"");
+    std::string retval;
+    char buffer[128];
+    size_t n;
+    while ((n=fread(buffer, 1, sizeof(buffer), f)) > 0) {
+        // Check for reading errors so we don't return any data if we couldn't
+        // read the entire file (or up to maxsize)
+        if (ferror(f)) {
+            fclose(f);
+            return std::make_pair(false,"");
+        }
+        retval.append(buffer, buffer+n);
+        if (retval.size() > maxsize)
+            break;
+    }
+    fclose(f);
+    return std::make_pair(true,retval);
+}
+
+/** Write contents of std::string to a file.
+ * @return true on success.
+ */
+static bool WriteBinaryFile(const fs::path &filename, const std::string &data)
+{
+    FILE *f = fsbridge::fopen(filename, "wb");
+    if (f == NULL)
+        return false;
+    if (fwrite(data.data(), 1, data.size(), f) != data.size()) {
+        fclose(f);
+        return false;
+    }
+    fclose(f);
+    return true;
+}
+
+/****** Bitcoin specific TorController implementation ********/
+
+/** Controller that connects to Tor control socket, authenticate, then create
+ * and maintain an ephemeral hidden service.
+ */
+class TorController
+{
+public:
+    TorController(struct event_base* base, const std::string& target);
+    ~TorController();
+
+    /** Get name for file to store private key in */
+    fs::path GetPrivateKeyFile();
+
+    /** Reconnect, after getting disconnected */
+    void Reconnect();
+private:
+    struct event_base* base;
+    std::string target;
+    TorControlConnection conn;
+    std::string private_key;
+    std::string service_id;
+    bool reconnect;
+    struct event *reconnect_ev;
+    float reconnect_timeout;
+    CService service;
+    /** Cooie for SAFECOOKIE auth */
+    std::vector<uint8_t> cookie;
+    /** ClientNonce for SAFECOOKIE auth */
+    std::vector<uint8_t> clientNonce;
+
+    /** Callback for ADD_ONION result */
+    void add_onion_cb(TorControlConnection& conn, const TorControlReply& reply);
+    /** Callback for AUTHENTICATE result */
+    void auth_cb(TorControlConnection& conn, const TorControlReply& reply);
+    /** Callback for AUTHCHALLENGE result */
+    void authchallenge_cb(TorControlConnection& conn, const TorControlReply& reply);
+    /** Callback for PROTOCOLINFO result */
+    void protocolinfo_cb(TorControlConnection& conn, const TorControlReply& reply);
+    /** Callback after successful connection */
+    void connected_cb(TorControlConnection& conn);
+    /** Callback after connection lost or failed connection attempt */
+    void disconnected_cb(TorControlConnection& conn);
+
+    /** Callback for reconnect timer */
+    static void reconnect_cb(evutil_socket_t fd, short what, void *arg);
+};
+
+TorController::TorController(struct event_base* _base, const std::string& _target):
+    base(_base),
+    target(_target), conn(base), reconnect(true), reconnect_ev(0),
+    reconnect_timeout(RECONNECT_TIMEOUT_START)
+{
+    reconnect_ev = event_new(base, -1, 0, reconnect_cb, this);
+    if (!reconnect_ev)
+        LogPrintf("tor: Failed to create event for reconnection: out of memory?\n");
+    // Start connection attempts immediately
+    if (!conn.Connect(_target, boost::bind(&TorController::connected_cb, this, _1),
+         boost::bind(&TorController::disconnected_cb, this, _1) )) {
+        LogPrintf("tor: Initiating connection to Tor control port %s failed\n", _target);
+    }
+    // Read service private key if cached
+    std::pair<bool,std::string> pkf = ReadBinaryFile(GetPrivateKeyFile());
+    if (pkf.first) {
+        LogPrint("tor", "tor: Reading cached private key from %s\n", GetPrivateKeyFile().string());
+        private_key = pkf.second;
+    }
+}
+
+TorController::~TorController()
+{
+    if (reconnect_ev) {
+        event_free(reconnect_ev);
+        reconnect_ev = 0;
+    }
+    if (service.IsValid()) {
+        RemoveLocal(service);
+    }
+}
+
+void TorController::add_onion_cb(TorControlConnection& _conn, const TorControlReply& reply)
+{
+    if (reply.code == 250) {
+        LogPrint("tor", "tor: ADD_ONION successful\n");
+        for (const std::string &s : reply.lines) {
+            std::map<std::string,std::string> m = ParseTorReplyMapping(s);
+            std::map<std::string,std::string>::iterator i;
+            if ((i = m.find("ServiceID")) != m.end())
+                service_id = i->second;
+            if ((i = m.find("PrivateKey")) != m.end())
+                private_key = i->second;
+        }
+        if (service_id.empty()) {
+            LogPrintf("tor: Error parsing ADD_ONION parameters:\n");
+            for (const std::string &s : reply.lines) {
+                LogPrintf("    %s\n", SanitizeString(s));
+            }
+            return;
+        }
+
+        service = CService(service_id+".onion", GetListenPort(), false);
+        LogPrintf("tor: Got service ID %s, advertizing service %s\n", service_id, service.ToString());
+        if (WriteBinaryFile(GetPrivateKeyFile(), private_key)) {
+            LogPrint("tor", "tor: Cached service private key to %s\n", GetPrivateKeyFile().string());
+        } else {
+            LogPrintf("tor: Error writing service private key to %s\n", GetPrivateKeyFile().string());
+        }
+        AddLocal(service, LOCAL_MANUAL);
+        // ... onion requested - keep connection open
+    } else if (reply.code == 510) { // 510 Unrecognized command
+        LogPrintf("tor: Add onion failed with unrecognized command (You probably need to upgrade Tor)\n");
+    } else {
+        LogPrintf("tor: Add onion failed; error code %d\n", reply.code);
+    }
+}
+
+void TorController::auth_cb(TorControlConnection& _conn, const TorControlReply& reply)
+{
+    if (reply.code == 250) {
+        LogPrint("tor", "tor: Authentication successful\n");
+
+        // Now that we know Tor is running setup the proxy for onion addresses
+        // if -onion isn't set to something else.
+        if (GetArg("-onion", "") == "") {
+            proxyType addrOnion = proxyType(CService("127.0.0.1", 9050), true);
+            SetProxy(NET_TOR, addrOnion);
+            SetLimited(NET_TOR, false);
+        }
+
+        // Finally - now create the service
+        if (private_key.empty()) // No private key, generate one
+            private_key = "NEW:RSA1024"; // Explicitly request RSA1024 - see issue #9214
+        // Request hidden service, redirect port.
+        // Note that the 'virtual' port doesn't have to be the same as our internal port, but this is just a convenient
+        // choice.  TODO; refactor the shutdown sequence some day.
+        _conn.Command(strprintf("ADD_ONION %s Port=%i,127.0.0.1:%i", private_key, GetListenPort(), GetListenPort()),
+            boost::bind(&TorController::add_onion_cb, this, _1, _2));
+    } else {
+        LogPrintf("tor: Authentication failed\n");
+    }
+}
+
+/** Compute Tor SAFECOOKIE response.
+ *
+ *    ServerHash is computed as:
+ *      HMAC-SHA256("Tor safe cookie authentication server-to-controller hash",
+ *                  CookieString | ClientNonce | ServerNonce)
+ *    (with the HMAC key as its first argument)
+ *
+ *    After a controller sends a successful AUTHCHALLENGE command, the
+ *    next command sent on the connection must be an AUTHENTICATE command,
+ *    and the only authentication string which that AUTHENTICATE command
+ *    will accept is:
+ *
+ *      HMAC-SHA256("Tor safe cookie authentication controller-to-server hash",
+ *                  CookieString | ClientNonce | ServerNonce)
+ *
+ */
+static std::vector<uint8_t> ComputeResponse(const std::string &key, const std::vector<uint8_t> &cookie,  const std::vector<uint8_t> &clientNonce, const std::vector<uint8_t> &serverNonce)
+{
+    CHMAC_SHA256 computeHash((const uint8_t*)key.data(), key.size());
+    std::vector<uint8_t> computedHash(CHMAC_SHA256::OUTPUT_SIZE, 0);
+    computeHash.Write(begin_ptr(cookie), cookie.size());
+    computeHash.Write(begin_ptr(clientNonce), clientNonce.size());
+    computeHash.Write(begin_ptr(serverNonce), serverNonce.size());
+    computeHash.Finalize(begin_ptr(computedHash));
+    return computedHash;
+}
+
+void TorController::authchallenge_cb(TorControlConnection& _conn, const TorControlReply& reply)
+{
+    if (reply.code == 250) {
+        LogPrint("tor", "tor: SAFECOOKIE authentication challenge successful\n");
+        std::pair<std::string,std::string> l = SplitTorReplyLine(reply.lines[0]);
+        if (l.first == "AUTHCHALLENGE") {
+            std::map<std::string,std::string> m = ParseTorReplyMapping(l.second);
+            if (m.empty()) {
+                LogPrintf("tor: Error parsing AUTHCHALLENGE parameters: %s\n", SanitizeString(l.second));
+                return;
+            }
+            std::vector<uint8_t> serverHash = ParseHex(m["SERVERHASH"]);
+            std::vector<uint8_t> serverNonce = ParseHex(m["SERVERNONCE"]);
+            LogPrint("tor", "tor: AUTHCHALLENGE ServerHash %s ServerNonce %s\n", HexStr(serverHash), HexStr(serverNonce));
+            if (serverNonce.size() != 32) {
+                LogPrintf("tor: ServerNonce is not 32 bytes, as required by spec\n");
+                return;
+            }
+
+            std::vector<uint8_t> computedServerHash = ComputeResponse(TOR_SAFE_SERVERKEY, cookie, clientNonce, serverNonce);
+            if (computedServerHash != serverHash) {
+                LogPrintf("tor: ServerHash %s does not match expected ServerHash %s\n", HexStr(serverHash), HexStr(computedServerHash));
+                return;
+            }
+
+            std::vector<uint8_t> computedClientHash = ComputeResponse(TOR_SAFE_CLIENTKEY, cookie, clientNonce, serverNonce);
+            _conn.Command("AUTHENTICATE " + HexStr(computedClientHash), boost::bind(&TorController::auth_cb, this, _1, _2));
+        } else {
+            LogPrintf("tor: Invalid reply to AUTHCHALLENGE\n");
+        }
+    } else {
+        LogPrintf("tor: SAFECOOKIE authentication challenge failed\n");
+    }
+}
+
+void TorController::protocolinfo_cb(TorControlConnection& _conn, const TorControlReply& reply)
+{
+    if (reply.code == 250) {
+        std::set<std::string> methods;
+        std::string cookiefile;
+        /*
+         * 250-AUTH METHODS=COOKIE,SAFECOOKIE COOKIEFILE="/home/x/.tor/control_auth_cookie"
+         * 250-AUTH METHODS=NULL
+         * 250-AUTH METHODS=HASHEDPASSWORD
+         */
+        for (const std::string &s : reply.lines) {
+            std::pair<std::string,std::string> l = SplitTorReplyLine(s);
+            if (l.first == "AUTH") {
+                std::map<std::string,std::string> m = ParseTorReplyMapping(l.second);
+                std::map<std::string,std::string>::iterator i;
+                if ((i = m.find("METHODS")) != m.end())
+                    boost::split(methods, i->second, boost::is_any_of(","));
+                if ((i = m.find("COOKIEFILE")) != m.end())
+                    cookiefile = i->second;
+            } else if (l.first == "VERSION") {
+                std::map<std::string,std::string> m = ParseTorReplyMapping(l.second);
+                std::map<std::string,std::string>::iterator i;
+                if ((i = m.find("Tor")) != m.end()) {
+                    LogPrint("tor", "tor: Connected to Tor version %s\n", i->second);
+                }
+            }
+        }
+        for (const std::string &s : methods) {
+            LogPrint("tor", "tor: Supported authentication method: %s\n", s);
+        }
+        // Prefer NULL, otherwise SAFECOOKIE. If a password is provided, use HASHEDPASSWORD
+        /* Authentication:
+         *   cookie:   hex-encoded ~/.tor/control_auth_cookie
+         *   password: "password"
+         */
+        std::string torpassword = GetArg("-torpassword", "");
+        if (!torpassword.empty()) {
+            if (methods.count("HASHEDPASSWORD")) {
+                LogPrint("tor", "tor: Using HASHEDPASSWORD authentication\n");
+                boost::replace_all(torpassword, "\"", "\\\"");
+                _conn.Command("AUTHENTICATE \"" + torpassword + "\"", boost::bind(&TorController::auth_cb, this, _1, _2));
+            } else {
+                LogPrintf("tor: Password provided with -torpassword, but HASHEDPASSWORD authentication is not available\n");
+            }
+        } else if (methods.count("NULL")) {
+            LogPrint("tor", "tor: Using NULL authentication\n");
+            _conn.Command("AUTHENTICATE", boost::bind(&TorController::auth_cb, this, _1, _2));
+        } else if (methods.count("SAFECOOKIE")) {
+            // Cookie: hexdump -e '32/1 "%02x""\n"'  ~/.tor/control_auth_cookie
+            LogPrint("tor", "tor: Using SAFECOOKIE authentication, reading cookie authentication from %s\n", cookiefile);
+            std::pair<bool,std::string> status_cookie = ReadBinaryFile(cookiefile, TOR_COOKIE_SIZE);
+            if (status_cookie.first && status_cookie.second.size() == TOR_COOKIE_SIZE) {
+                // _conn.Command("AUTHENTICATE " + HexStr(status_cookie.second), boost::bind(&TorController::auth_cb, this, _1, _2));
+                cookie = std::vector<uint8_t>(status_cookie.second.begin(), status_cookie.second.end());
+                clientNonce = std::vector<uint8_t>(TOR_NONCE_SIZE, 0);
+                GetRandBytes(&clientNonce[0], TOR_NONCE_SIZE);
+                _conn.Command("AUTHCHALLENGE SAFECOOKIE " + HexStr(clientNonce), boost::bind(&TorController::authchallenge_cb, this, _1, _2));
+            } else {
+                if (status_cookie.first) {
+                    LogPrintf("tor: Authentication cookie %s is not exactly %i bytes, as is required by the spec\n", cookiefile, TOR_COOKIE_SIZE);
+                } else {
+                    LogPrintf("tor: Authentication cookie %s could not be opened (check permissions)\n", cookiefile);
+                }
+            }
+        } else if (methods.count("HASHEDPASSWORD")) {
+            LogPrintf("tor: The only supported authentication mechanism left is password, but no password provided with -torpassword\n");
+        } else {
+            LogPrintf("tor: No supported authentication method\n");
+        }
+    } else {
+        LogPrintf("tor: Requesting protocol info failed\n");
+    }
+}
+
+void TorController::connected_cb(TorControlConnection& _conn)
+{
+    reconnect_timeout = RECONNECT_TIMEOUT_START;
+    // First send a PROTOCOLINFO command to figure out what authentication is expected
+    if (!_conn.Command("PROTOCOLINFO 1", boost::bind(&TorController::protocolinfo_cb, this, _1, _2)))
+        LogPrintf("tor: Error sending initial protocolinfo command\n");
+}
+
+void TorController::disconnected_cb(TorControlConnection& _conn)
+{
+    // Stop advertizing service when disconnected
+    if (service.IsValid())
+        RemoveLocal(service);
+    service = CService();
+    if (!reconnect)
+        return;
+
+    LogPrint("tor", "tor: Not connected to Tor control port %s, trying to reconnect\n", target);
+
+    // Single-shot timer for reconnect. Use exponential backoff.
+    struct timeval time = MillisToTimeval(int64_t(reconnect_timeout * 1000.0));
+    if (reconnect_ev)
+        event_add(reconnect_ev, &time);
+    reconnect_timeout *= RECONNECT_TIMEOUT_EXP;
+}
+
+void TorController::Reconnect()
+{
+    /* Try to reconnect and reestablish if we get booted - for example, Tor
+     * may be restarting.
+     */
+    if (!conn.Connect(target, boost::bind(&TorController::connected_cb, this, _1),
+         boost::bind(&TorController::disconnected_cb, this, _1) )) {
+        LogPrintf("tor: Re-initiating connection to Tor control port %s failed\n", target);
+    }
+}
+
+fs::path TorController::GetPrivateKeyFile()
+{
+    return GetDataDir() / "onion_private_key";
+}
+
+void TorController::reconnect_cb(evutil_socket_t fd, short what, void *arg)
+{
+    TorController *self = (TorController*)arg;
+    self->Reconnect();
+}
+
+/****** Thread ********/
+static struct event_base *gBase;
+static boost::thread torControlThread;
+
+static void TorControlThread()
+{
+    TorController ctrl(gBase, GetArg("-torcontrol", DEFAULT_TOR_CONTROL));
+
+    event_base_dispatch(gBase);
+}
+
+void StartTorControl(boost::thread_group& threadGroup, CScheduler& scheduler)
+{
+    assert(!gBase);
+#ifdef WIN32
+    evthread_use_windows_threads();
+#else
+    evthread_use_pthreads();
+#endif
+    gBase = event_base_new();
+    if (!gBase) {
+        LogPrintf("tor: Unable to create event_base\n");
+        return;
+    }
+
+    torControlThread = boost::thread(boost::bind(&TraceThread<void (*)()>, "torcontrol", &TorControlThread));
+}
+
+void InterruptTorControl()
+{
+    if (gBase) {
+        LogPrintf("tor: Thread interrupt\n");
+        event_base_loopbreak(gBase);
+    }
+}
+
+void StopTorControl()
+{
+    if (gBase) {
+        torControlThread.join();
+        event_base_free(gBase);
+        gBase = 0;
+    }
+}
+
diff --git a/depend/zcash/src/torcontrol.h b/depend/zcash/src/torcontrol.h
new file mode 100644
index 000000000..c3edaee05
--- /dev/null
+++ b/depend/zcash/src/torcontrol.h
@@ -0,0 +1,20 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+/**
+ * Functionality for communicating with Tor.
+ */
+#ifndef BITCOIN_TORCONTROL_H
+#define BITCOIN_TORCONTROL_H
+
+#include "scheduler.h"
+
+extern const std::string DEFAULT_TOR_CONTROL;
+static const bool DEFAULT_LISTEN_ONION = true;
+
+void StartTorControl(boost::thread_group& threadGroup, CScheduler& scheduler);
+void InterruptTorControl();
+void StopTorControl();
+
+#endif /* BITCOIN_TORCONTROL_H */
diff --git a/depend/zcash/src/transaction_builder.cpp b/depend/zcash/src/transaction_builder.cpp
new file mode 100644
index 000000000..a308c88b0
--- /dev/null
+++ b/depend/zcash/src/transaction_builder.cpp
@@ -0,0 +1,1022 @@
+// Copyright (c) 2018 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "transaction_builder.h"
+
+#include "main.h"
+#include "proof_verifier.h"
+#include "pubkey.h"
+#include "rpc/protocol.h"
+#include "script/sign.h"
+#include "utilmoneystr.h"
+#include "zcash/Note.hpp"
+
+#include <librustzcash.h>
+#include <rust/ed25519.h>
+
+uint256 ProduceZip244SignatureHash(
+    const CTransaction& tx,
+    const std::vector<CTxOut>& allPrevOutputs,
+    const orchard::UnauthorizedBundle& orchardBundle)
+{
+    uint256 dataToBeSigned;
+    PrecomputedTransactionData local(tx, allPrevOutputs);
+    if (!zcash_builder_zip244_shielded_signature_digest(
+        local.preTx.release(),
+        orchardBundle.inner.get(),
+        dataToBeSigned.begin()))
+    {
+        throw std::logic_error("ZIP 225 signature hash failed");
+    }
+    return dataToBeSigned;
+}
+
+namespace orchard {
+
+Builder::Builder(
+    bool spendsEnabled,
+    bool outputsEnabled,
+    uint256 anchor) : inner(nullptr, orchard_builder_free)
+{
+    inner.reset(orchard_builder_new(spendsEnabled, outputsEnabled, anchor.IsNull() ? nullptr : anchor.begin()));
+}
+
+bool Builder::AddSpend(orchard::SpendInfo spendInfo)
+{
+    if (!inner) {
+        throw std::logic_error("orchard::Builder has already been used");
+    }
+
+    if (orchard_builder_add_spend(
+        inner.get(),
+        spendInfo.inner.release()))
+    {
+        hasActions = true;
+        return true;
+    } else {
+        return false;
+    }
+}
+
+void Builder::AddOutput(
+    const std::optional<uint256>& ovk,
+    const libzcash::OrchardRawAddress& to,
+    CAmount value,
+    const std::optional<std::array<unsigned char, ZC_MEMO_SIZE>>& memo)
+{
+    if (!inner) {
+        throw std::logic_error("orchard::Builder has already been used");
+    }
+
+    orchard_builder_add_recipient(
+        inner.get(),
+        ovk.has_value() ? ovk->begin() : nullptr,
+        to.inner.get(),
+        value,
+        memo.has_value() ? memo->data() : nullptr);
+
+    hasActions = true;
+}
+
+std::optional<UnauthorizedBundle> Builder::Build() {
+    if (!inner) {
+        throw std::logic_error("orchard::Builder has already been used");
+    }
+
+    auto bundle = orchard_builder_build(inner.release());
+    if (bundle == nullptr) {
+        return std::nullopt;
+    } else {
+        return UnauthorizedBundle(bundle);
+    }
+}
+
+std::optional<OrchardBundle> UnauthorizedBundle::ProveAndSign(
+    const std::vector<libzcash::OrchardSpendingKey>& keys,
+    uint256 sighash)
+{
+    if (!inner) {
+        throw std::logic_error("orchard::UnauthorizedBundle has already been used");
+    }
+
+    std::vector<const OrchardSpendingKeyPtr*> pKeys;
+    for (const auto& key : keys) {
+        pKeys.push_back(key.inner.get());
+    }
+
+    auto authorizedBundle = orchard_unauthorized_bundle_prove_and_sign(
+        inner.release(), pKeys.data(), pKeys.size(), sighash.begin());
+    if (authorizedBundle == nullptr) {
+        return std::nullopt;
+    } else {
+        return OrchardBundle(authorizedBundle);
+    }
+}
+
+} // namespace orchard
+
+SpendDescriptionInfo::SpendDescriptionInfo(
+    libzcash::SaplingExpandedSpendingKey expsk,
+    libzcash::SaplingNote note,
+    uint256 anchor,
+    SaplingWitness witness) : expsk(expsk), note(note), anchor(anchor), witness(witness)
+{
+    librustzcash_sapling_generate_r(alpha.begin());
+}
+
+std::optional<OutputDescription> OutputDescriptionInfo::Build(void* ctx) {
+    auto cmu = this->note.cmu();
+    if (!cmu) {
+        return std::nullopt;
+    }
+
+    libzcash::SaplingNotePlaintext notePlaintext(this->note, this->memo);
+
+    auto res = notePlaintext.encrypt(this->note.pk_d);
+    if (!res) {
+        return std::nullopt;
+    }
+    auto enc = res.value();
+    auto encryptor = enc.second;
+
+    libzcash::SaplingPaymentAddress address(this->note.d, this->note.pk_d);
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << address;
+    std::vector<unsigned char> addressBytes(ss.begin(), ss.end());
+
+    OutputDescription odesc;
+    uint256 rcm = this->note.rcm();
+    if (!librustzcash_sapling_output_proof(
+            ctx,
+            encryptor.get_esk().begin(),
+            addressBytes.data(),
+            rcm.begin(),
+            this->note.value(),
+            odesc.cv.begin(),
+            odesc.zkproof.begin())) {
+        return std::nullopt;
+    }
+
+    odesc.cmu = *cmu;
+    odesc.ephemeralKey = encryptor.get_epk();
+    odesc.encCiphertext = enc.first;
+
+    libzcash::SaplingOutgoingPlaintext outPlaintext(this->note.pk_d, encryptor.get_esk());
+    odesc.outCiphertext = outPlaintext.encrypt(
+        this->ovk,
+        odesc.cv,
+        odesc.cmu,
+        encryptor);
+
+    return odesc;
+}
+
+JSDescription JSDescriptionInfo::BuildDeterministic(
+    bool computeProof,
+    uint256 *esk // payment disclosure
+) {
+    JSDescription jsdesc;
+    jsdesc.vpub_old = vpub_old;
+    jsdesc.vpub_new = vpub_new;
+    jsdesc.anchor = anchor;
+
+    std::array<libzcash::SproutNote, ZC_NUM_JS_OUTPUTS> notes;
+    jsdesc.proof = ZCJoinSplit::prove(
+        inputs,
+        outputs,
+        notes,
+        jsdesc.ciphertexts,
+        jsdesc.ephemeralKey,
+        joinSplitPubKey,
+        jsdesc.randomSeed,
+        jsdesc.macs,
+        jsdesc.nullifiers,
+        jsdesc.commitments,
+        vpub_old,
+        vpub_new,
+        anchor,
+        computeProof,
+        esk // payment disclosure
+    );
+
+    return jsdesc;
+}
+
+JSDescription JSDescriptionInfo::BuildRandomized(
+    std::array<size_t, ZC_NUM_JS_INPUTS>& inputMap,
+    std::array<size_t, ZC_NUM_JS_OUTPUTS>& outputMap,
+    bool computeProof,
+    uint256 *esk, // payment disclosure
+    std::function<int(int)> gen
+)
+{
+    // Randomize the order of the inputs and outputs
+    inputMap = {0, 1};
+    outputMap = {0, 1};
+
+    assert(gen);
+
+    MappedShuffle(inputs.begin(), inputMap.begin(), ZC_NUM_JS_INPUTS, gen);
+    MappedShuffle(outputs.begin(), outputMap.begin(), ZC_NUM_JS_OUTPUTS, gen);
+
+    return BuildDeterministic(computeProof, esk);
+}
+
+TransactionBuilderResult::TransactionBuilderResult(const CTransaction& tx) : maybeTx(tx) {}
+
+TransactionBuilderResult::TransactionBuilderResult(const std::string& error) : maybeError(error) {}
+
+bool TransactionBuilderResult::IsTx() { return maybeTx.has_value(); }
+
+bool TransactionBuilderResult::IsError() { return maybeError.has_value(); }
+
+CTransaction TransactionBuilderResult::GetTxOrThrow() {
+    if (maybeTx.has_value()) {
+        return maybeTx.value();
+    } else {
+        throw JSONRPCError(RPC_WALLET_ERROR, "Failed to build transaction: " + GetError());
+    }
+}
+
+std::string TransactionBuilderResult::GetError() {
+    if (maybeError.has_value()) {
+        return maybeError.value();
+    } else {
+        // This can only happen if isTx() is true in which case we should not call getError()
+        throw std::runtime_error("getError() was called in TransactionBuilderResult, but the result was not initialized as an error.");
+    }
+}
+
+TransactionBuilder::TransactionBuilder(
+    const Consensus::Params& consensusParams,
+    int nHeight,
+    std::optional<uint256> orchardAnchor,
+    CKeyStore* keystore,
+    CCoinsViewCache* coinsView,
+    CCriticalSection* cs_coinsView) :
+    consensusParams(consensusParams),
+    nHeight(nHeight),
+    keystore(keystore),
+    coinsView(coinsView),
+    cs_coinsView(cs_coinsView),
+    orchardAnchor(orchardAnchor)
+{
+    mtx = CreateNewContextualCMutableTransaction(consensusParams, nHeight);
+
+    // Ignore the Orchard anchor if we can't use it yet.
+    if (orchardAnchor.has_value() && mtx.nVersion >= ZIP225_MIN_TX_VERSION) {
+        orchardBuilder = orchard::Builder(true, true, orchardAnchor.value());
+    }
+}
+
+// This exception is thrown in certain scenarios when building JoinSplits fails.
+struct JSDescException : public std::exception
+{
+    JSDescException (const std::string msg_) : msg(msg_) {}
+
+    const char* what() { return msg.c_str(); }
+
+private:
+    std::string msg;
+};
+
+void TransactionBuilder::SetExpiryHeight(uint32_t nExpiryHeight)
+{
+    if (nExpiryHeight < nHeight || nExpiryHeight <= 0 || nExpiryHeight >= TX_EXPIRY_HEIGHT_THRESHOLD) {
+        throw new std::runtime_error("TransactionBuilder::SetExpiryHeight: invalid expiry height");
+    }
+    mtx.nExpiryHeight = nExpiryHeight;
+}
+
+bool TransactionBuilder::SupportsOrchard() const {
+    return orchardBuilder.has_value();
+}
+
+std::optional<uint256> TransactionBuilder::GetOrchardAnchor() const {
+    return orchardAnchor;
+}
+
+
+bool TransactionBuilder::AddOrchardSpend(
+    libzcash::OrchardSpendingKey sk,
+    orchard::SpendInfo spendInfo)
+{
+    if (!orchardBuilder.has_value()) {
+        // Try to give a useful error.
+        if (!(jsInputs.empty() && jsOutputs.empty())) {
+            throw std::runtime_error("TransactionBuilder cannot spend Orchard notes in a Sprout transaction");
+        } else if (mtx.nVersion < ZIP225_MIN_TX_VERSION) {
+            throw std::runtime_error("TransactionBuilder cannot spend Orchard notes before NU5 activation");
+        } else {
+            throw std::runtime_error("TransactionBuilder cannot spend Orchard notes without Orchard anchor");
+        }
+    }
+
+    auto fromAddr = spendInfo.FromAddress();
+    auto value = spendInfo.Value();
+    auto res = orchardBuilder.value().AddSpend(std::move(spendInfo));
+    if (res) {
+        orchardSpendingKeys.push_back(sk);
+        if (!firstOrchardSpendAddr.has_value()) {
+            firstOrchardSpendAddr = fromAddr;
+        }
+        valueBalanceOrchard += value;
+    }
+    return res;
+}
+
+void TransactionBuilder::AddOrchardOutput(
+    const std::optional<uint256>& ovk,
+    const libzcash::OrchardRawAddress& to,
+    CAmount value,
+    const std::optional<std::array<unsigned char, ZC_MEMO_SIZE>>& memo)
+{
+    if (!orchardBuilder.has_value()) {
+        // Try to give a useful error.
+        if (!(jsInputs.empty() && jsOutputs.empty())) {
+            throw std::runtime_error("TransactionBuilder cannot add Orchard output to Sprout transaction");
+        } else if (mtx.nVersion < ZIP225_MIN_TX_VERSION) {
+            throw std::runtime_error("TransactionBuilder cannot add Orchard output before NU5 activation");
+        } else {
+            throw std::runtime_error("TransactionBuilder cannot add Orchard output without Orchard anchor");
+        }
+    }
+
+    orchardBuilder.value().AddOutput(ovk, to, value, memo);
+    valueBalanceOrchard -= value;
+}
+
+void TransactionBuilder::AddSaplingSpend(
+    libzcash::SaplingExpandedSpendingKey expsk,
+    libzcash::SaplingNote note,
+    uint256 anchor,
+    SaplingWitness witness)
+{
+    // Sanity check: cannot add Sapling spend to pre-Sapling transaction
+    if (mtx.nVersion < SAPLING_TX_VERSION) {
+        throw std::runtime_error("TransactionBuilder cannot add Sapling spend to pre-Sapling transaction");
+    }
+
+    // Consistency check: all anchors must equal the first one
+    if (spends.size() > 0 && spends[0].anchor != anchor) {
+        throw JSONRPCError(RPC_WALLET_ERROR, "Anchor does not match previously-added Sapling spends.");
+    }
+
+    spends.emplace_back(expsk, note, anchor, witness);
+    mtx.valueBalanceSapling += note.value();
+}
+
+void TransactionBuilder::AddSaplingOutput(
+    uint256 ovk,
+    libzcash::SaplingPaymentAddress to,
+    CAmount value,
+    std::array<unsigned char, ZC_MEMO_SIZE> memo)
+{
+    // Sanity check: cannot add Sapling output to pre-Sapling transaction
+    if (mtx.nVersion < SAPLING_TX_VERSION) {
+        throw std::runtime_error("TransactionBuilder cannot add Sapling output to pre-Sapling transaction");
+    }
+
+    libzcash::Zip212Enabled zip_212_enabled = libzcash::Zip212Enabled::BeforeZip212;
+    // We use nHeight = chainActive.Height() + 1 since the output will be included in the next block
+    if (consensusParams.NetworkUpgradeActive(nHeight, Consensus::UPGRADE_CANOPY)) {
+        zip_212_enabled = libzcash::Zip212Enabled::AfterZip212;
+    }
+
+    auto note = libzcash::SaplingNote(to, value, zip_212_enabled);
+    outputs.emplace_back(ovk, note, memo);
+    mtx.valueBalanceSapling -= value;
+}
+
+void TransactionBuilder::AddSproutInput(
+    libzcash::SproutSpendingKey sk,
+    libzcash::SproutNote note,
+    SproutWitness witness)
+{
+    CheckOrSetUsingSprout();
+
+    // Consistency check: all anchors must equal the first one
+    if (!jsInputs.empty()) {
+        if (jsInputs[0].witness.root() != witness.root()) {
+            throw JSONRPCError(RPC_WALLET_ERROR, "Anchor does not match previously-added Sprout spends.");
+        }
+    }
+
+    jsInputs.emplace_back(witness, note, sk);
+}
+
+void TransactionBuilder::AddSproutOutput(
+    libzcash::SproutPaymentAddress to,
+    CAmount value,
+    std::array<unsigned char, ZC_MEMO_SIZE> memo)
+{
+    CheckOrSetUsingSprout();
+
+    libzcash::JSOutput jsOutput(to, value);
+    jsOutput.memo = memo;
+    jsOutputs.push_back(jsOutput);
+}
+
+void TransactionBuilder::AddTransparentInput(COutPoint utxo, CScript scriptPubKey, CAmount value)
+{
+    if (keystore == nullptr) {
+        throw std::runtime_error("Cannot add transparent inputs to a TransactionBuilder without a keystore");
+    }
+
+    mtx.vin.emplace_back(utxo);
+    tIns.emplace_back(value, scriptPubKey);
+}
+
+void TransactionBuilder::AddTransparentOutput(const CTxDestination& to, CAmount value)
+{
+    if (!IsValidDestination(to)) {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid output address, not a valid taddr.");
+    }
+
+    CScript scriptPubKey = GetScriptForDestination(to);
+    CTxOut out(value, scriptPubKey);
+    mtx.vout.push_back(out);
+}
+
+void TransactionBuilder::SetFee(CAmount fee)
+{
+    this->fee = fee;
+}
+
+// TODO: remove support for transparent change?
+void TransactionBuilder::SendChangeTo(
+        const libzcash::RecipientAddress& changeAddr,
+        const uint256& ovk) {
+    tChangeAddr = std::nullopt;
+    orchardChangeAddr = std::nullopt;
+    saplingChangeAddr = std::nullopt;
+    sproutChangeAddr = std::nullopt;
+
+    std::visit(match {
+        [&](const CKeyID& keyId) {
+            tChangeAddr = keyId;
+        },
+        [&](const CScriptID& scriptId) {
+            tChangeAddr = scriptId;
+        },
+        [&](const libzcash::SaplingPaymentAddress& changeDest) {
+            saplingChangeAddr = std::make_pair(ovk, changeDest);
+        },
+        [&](const libzcash::OrchardRawAddress& changeDest) {
+            orchardChangeAddr = std::make_pair(ovk, changeDest);
+        }
+    }, changeAddr);
+}
+
+void TransactionBuilder::SendChangeToSprout(const libzcash::SproutPaymentAddress& zaddr) {
+    tChangeAddr = std::nullopt;
+    orchardChangeAddr = std::nullopt;
+    saplingChangeAddr = std::nullopt;
+    sproutChangeAddr = zaddr;
+}
+
+TransactionBuilderResult TransactionBuilder::Build()
+{
+    //
+    // Consistency checks
+    //
+
+    // Valid change
+    CAmount change = mtx.valueBalanceSapling + valueBalanceOrchard - fee;
+    for (auto jsInput : jsInputs) {
+        change += jsInput.note.value();
+    }
+    for (auto jsOutput : jsOutputs) {
+        change -= jsOutput.value;
+    }
+    for (auto tIn : tIns) {
+        change += tIn.nValue;
+    }
+    for (auto tOut : mtx.vout) {
+        change -= tOut.nValue;
+    }
+    if (change < 0) {
+        return TransactionBuilderResult("Change cannot be negative");
+    }
+
+    //
+    // Change output
+    //
+
+    if (change > 0) {
+        // Send change to the specified change address. If no change address
+        // was set, send change to the first Sapling address given as input
+        // if any; otherwise the first Sprout address given as input.
+        // (A t-address can only be used as the change address if explicitly set.)
+        if (orchardChangeAddr) {
+            AddOrchardOutput(orchardChangeAddr->first, orchardChangeAddr->second, change, std::nullopt);
+        } else if (saplingChangeAddr) {
+            AddSaplingOutput(saplingChangeAddr->first, saplingChangeAddr->second, change);
+        } else if (sproutChangeAddr) {
+            AddSproutOutput(sproutChangeAddr.value(), change);
+        } else if (tChangeAddr) {
+            // tChangeAddr has already been validated.
+            AddTransparentOutput(tChangeAddr.value(), change);
+        } else if (firstOrchardSpendAddr.has_value()) {
+            auto ovk = orchardSpendingKeys[0].ToFullViewingKey().ToInternalOutgoingViewingKey();
+            AddOrchardOutput(ovk, firstOrchardSpendAddr.value(), change, std::nullopt);
+        } else if (!spends.empty()) {
+            auto fvk = spends[0].expsk.full_viewing_key();
+            auto note = spends[0].note;
+            libzcash::SaplingPaymentAddress changeAddr(note.d, note.pk_d);
+            AddSaplingOutput(fvk.ovk, changeAddr, change);
+        } else if (!jsInputs.empty()) {
+            auto changeAddr = jsInputs[0].key.address();
+            AddSproutOutput(changeAddr, change);
+        } else {
+            return TransactionBuilderResult("Could not determine change address");
+        }
+    }
+
+    //
+    // Orchard
+    //
+
+    std::optional<orchard::UnauthorizedBundle> orchardBundle;
+    if (orchardBuilder.has_value() && orchardBuilder->HasActions()) {
+        auto bundle = orchardBuilder->Build();
+        if (bundle.has_value()) {
+            orchardBundle = std::move(bundle);
+        } else {
+            return TransactionBuilderResult("Failed to build Orchard bundle");
+        }
+    }
+
+    //
+    // Sapling spends and outputs
+    //
+
+    auto ctx = librustzcash_sapling_proving_ctx_init();
+
+    // Create Sapling SpendDescriptions
+    for (auto spend : spends) {
+        auto cm = spend.note.cmu();
+        auto nf = spend.note.nullifier(
+            spend.expsk.full_viewing_key(), spend.witness.position());
+        if (!cm || !nf) {
+            librustzcash_sapling_proving_ctx_free(ctx);
+            return TransactionBuilderResult("Spend is invalid");
+        }
+
+        CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+        ss << spend.witness.path();
+        std::vector<unsigned char> witness(ss.begin(), ss.end());
+
+        SpendDescription sdesc;
+        uint256 rcm = spend.note.rcm();
+        if (!librustzcash_sapling_spend_proof(
+                ctx,
+                spend.expsk.full_viewing_key().ak.begin(),
+                spend.expsk.nsk.begin(),
+                spend.note.d.data(),
+                rcm.begin(),
+                spend.alpha.begin(),
+                spend.note.value(),
+                spend.anchor.begin(),
+                witness.data(),
+                sdesc.cv.begin(),
+                sdesc.rk.begin(),
+                sdesc.zkproof.data())) {
+            librustzcash_sapling_proving_ctx_free(ctx);
+            return TransactionBuilderResult("Spend proof failed");
+        }
+
+        sdesc.anchor = spend.anchor;
+        sdesc.nullifier = *nf;
+        mtx.vShieldedSpend.push_back(sdesc);
+    }
+
+    // Create Sapling OutputDescriptions
+    for (auto output : outputs) {
+        // Check this out here as well to provide better logging.
+        if (!output.note.cmu()) {
+            librustzcash_sapling_proving_ctx_free(ctx);
+            return TransactionBuilderResult("Output is invalid");
+        }
+
+        auto odesc = output.Build(ctx);
+        if (!odesc) {
+            librustzcash_sapling_proving_ctx_free(ctx);
+            return TransactionBuilderResult("Failed to create output description");
+        }
+
+        mtx.vShieldedOutput.push_back(odesc.value());
+    }
+
+    //
+    // Sprout JoinSplits
+    //
+
+    Ed25519SigningKey joinSplitPrivKey;
+    ed25519_generate_keypair(&joinSplitPrivKey, &mtx.joinSplitPubKey);
+
+    // Create Sprout JSDescriptions
+    if (!jsInputs.empty() || !jsOutputs.empty()) {
+        try {
+            CreateJSDescriptions();
+        } catch (JSDescException e) {
+            librustzcash_sapling_proving_ctx_free(ctx);
+            return TransactionBuilderResult(e.what());
+        } catch (std::runtime_error e) {
+            librustzcash_sapling_proving_ctx_free(ctx);
+            throw e;
+        }
+    }
+
+    //
+    // Signatures
+    //
+
+    auto consensusBranchId = CurrentEpochBranchId(nHeight, consensusParams);
+
+    // Empty output script.
+    uint256 dataToBeSigned;
+    try {
+        if (orchardBundle.has_value()) {
+            // Orchard is only usable with v5+ transactions.
+            dataToBeSigned = ProduceZip244SignatureHash(mtx, tIns, orchardBundle.value());
+        } else {
+            CScript scriptCode;
+            const PrecomputedTransactionData txdata(mtx, tIns);
+            dataToBeSigned = SignatureHash(scriptCode, mtx, NOT_AN_INPUT, SIGHASH_ALL, 0, consensusBranchId, txdata);
+        }
+    } catch (std::ios_base::failure ex) {
+        librustzcash_sapling_proving_ctx_free(ctx);
+        return TransactionBuilderResult("Could not construct signature hash: " + std::string(ex.what()));
+    } catch (std::logic_error ex) {
+        librustzcash_sapling_proving_ctx_free(ctx);
+        return TransactionBuilderResult("Could not construct signature hash: " + std::string(ex.what()));
+    }
+
+    if (orchardBundle.has_value()) {
+        auto authorizedBundle = orchardBundle.value().ProveAndSign(
+            orchardSpendingKeys, dataToBeSigned);
+        if (authorizedBundle.has_value()) {
+            mtx.orchardBundle = authorizedBundle.value();
+        } else {
+            return TransactionBuilderResult("Failed to create Orchard proof or signatures");
+        }
+    }
+
+    // Create Sapling spendAuth and binding signatures
+    for (size_t i = 0; i < spends.size(); i++) {
+        librustzcash_sapling_spend_sig(
+            spends[i].expsk.ask.begin(),
+            spends[i].alpha.begin(),
+            dataToBeSigned.begin(),
+            mtx.vShieldedSpend[i].spendAuthSig.data());
+    }
+    librustzcash_sapling_binding_sig(
+        ctx,
+        mtx.valueBalanceSapling,
+        dataToBeSigned.begin(),
+        mtx.bindingSig.data());
+
+    librustzcash_sapling_proving_ctx_free(ctx);
+
+    // Create Sprout joinSplitSig
+    if (!ed25519_sign(
+        &joinSplitPrivKey,
+        dataToBeSigned.begin(), 32,
+        &mtx.joinSplitSig))
+    {
+        return TransactionBuilderResult("Failed to create Sprout joinSplitSig");
+    }
+
+    // Sanity check Sprout joinSplitSig
+    if (!ed25519_verify(
+        &mtx.joinSplitPubKey,
+        &mtx.joinSplitSig,
+        dataToBeSigned.begin(), 32))
+    {
+        return TransactionBuilderResult("Sprout joinSplitSig sanity check failed");
+    }
+
+    // Transparent signatures
+    CTransaction txNewConst(mtx);
+    const PrecomputedTransactionData txdata(txNewConst, tIns);
+    for (int nIn = 0; nIn < mtx.vin.size(); nIn++) {
+        auto tIn = tIns[nIn];
+        SignatureData sigdata;
+        bool signSuccess = ProduceSignature(
+            TransactionSignatureCreator(
+                keystore, &txNewConst, txdata, nIn, tIn.nValue, SIGHASH_ALL),
+            tIn.scriptPubKey, sigdata, consensusBranchId);
+
+        if (!signSuccess) {
+            return TransactionBuilderResult("Failed to sign transaction");
+        } else {
+            UpdateTransaction(mtx, nIn, sigdata);
+        }
+    }
+
+    return TransactionBuilderResult(CTransaction(mtx));
+}
+
+void TransactionBuilder::CheckOrSetUsingSprout()
+{
+    if (orchardBuilder.has_value()) {
+        throw JSONRPCError(RPC_WALLET_ERROR, "Can't use Sprout with a v5 transaction.");
+    } else {
+        // Switch if necessary to a Sprout-supporting transaction format.
+        auto txVersionInfo = CurrentTxVersionInfo(consensusParams, nHeight, true);
+        mtx.nVersionGroupId = txVersionInfo.nVersionGroupId;
+        mtx.nVersion        = txVersionInfo.nVersion;
+        mtx.nConsensusBranchId = std::nullopt;
+    }
+}
+
+void TransactionBuilder::CreateJSDescriptions()
+{
+    // Copy jsInputs and jsOutputs to more flexible containers
+    std::deque<libzcash::JSInput> jsInputsDeque;
+    for (auto jsInput : jsInputs) {
+        jsInputsDeque.push_back(jsInput);
+    }
+    std::deque<libzcash::JSOutput> jsOutputsDeque;
+    for (auto jsOutput : jsOutputs) {
+        jsOutputsDeque.push_back(jsOutput);
+    }
+
+    // If we have no Sprout shielded inputs, then we do the simpler more-leaky
+    // process where we just create outputs directly. We save the chaining logic,
+    // at the expense of leaking the sums of pairs of output values in vpub_old.
+    if (jsInputs.empty()) {
+        // Create joinsplits, where each output represents a zaddr recipient.
+        while (jsOutputsDeque.size() > 0) {
+            // Default array entries are dummy inputs and outputs
+            std::array<libzcash::JSInput, ZC_NUM_JS_INPUTS> vjsin;
+            std::array<libzcash::JSOutput, ZC_NUM_JS_OUTPUTS> vjsout;
+            uint64_t vpub_old = 0;
+
+            for (int n = 0; n < ZC_NUM_JS_OUTPUTS && jsOutputsDeque.size() > 0; n++) {
+                vjsout[n] = jsOutputsDeque.front();
+                jsOutputsDeque.pop_front();
+
+                // Funds are removed from the value pool and enter the private pool
+                vpub_old += vjsout[n].value;
+            }
+
+            std::array<size_t, ZC_NUM_JS_INPUTS> inputMap;
+            std::array<size_t, ZC_NUM_JS_OUTPUTS> outputMap;
+            CreateJSDescription(vpub_old, 0, vjsin, vjsout, inputMap, outputMap);
+        }
+        return;
+    }
+
+    // At this point, we are guaranteed to have at least one input note.
+    // Use address of first input note as the temporary change address.
+    auto changeKey = jsInputsDeque.front().key;
+    auto changeAddress = changeKey.address();
+
+    CAmount jsChange = 0;          // this is updated after each joinsplit
+    int changeOutputIndex = -1;    // this is updated after each joinsplit if jsChange > 0
+    bool vpubOldProcessed = false; // updated when vpub_old for taddr inputs is set in first joinsplit
+    bool vpubNewProcessed = false; // updated when vpub_new for miner fee and taddr outputs is set in last joinsplit
+
+    CAmount valueOut = 0;
+    for (auto jsInput : jsInputs) {
+        valueOut += jsInput.note.value();
+    }
+    for (auto jsOutput : jsOutputs) {
+        valueOut -= jsOutput.value;
+    }
+    CAmount vpubOldTarget = valueOut < 0 ? -valueOut : 0;
+    CAmount vpubNewTarget = valueOut > 0 ? valueOut : 0;
+
+    // Keep track of treestate within this transaction
+    boost::unordered_map<uint256, SproutMerkleTree, SaltedTxidHasher> intermediates;
+    std::vector<uint256> previousCommitments;
+
+    while (!vpubNewProcessed) {
+        // Default array entries are dummy inputs and outputs
+        std::array<libzcash::JSInput, ZC_NUM_JS_INPUTS> vjsin;
+        std::array<libzcash::JSOutput, ZC_NUM_JS_OUTPUTS> vjsout;
+        uint64_t vpub_old = 0;
+        uint64_t vpub_new = 0;
+
+        // Set vpub_old in the first joinsplit
+        if (!vpubOldProcessed) {
+            vpub_old += vpubOldTarget; // funds flowing from public pool
+            vpubOldProcessed = true;
+        }
+
+        CAmount jsInputValue = 0;
+        uint256 jsAnchor;
+
+        JSDescription prevJoinSplit;
+
+        // Keep track of previous JoinSplit and its commitments
+        if (mtx.vJoinSplit.size() > 0) {
+            prevJoinSplit = mtx.vJoinSplit.back();
+        }
+
+        // If there is no change, the chain has terminated so we can reset the tracked treestate.
+        if (jsChange == 0 && mtx.vJoinSplit.size() > 0) {
+            intermediates.clear();
+            previousCommitments.clear();
+        }
+
+        //
+        // Consume change as the first input of the JoinSplit.
+        //
+        if (jsChange > 0) {
+            // Update tree state with previous joinsplit
+            SproutMerkleTree tree;
+            {
+                // assert that coinsView is not null
+                assert(coinsView);
+                // We do not check cs_coinView because we do not set this in testing
+                // assert(cs_coinsView);
+                LOCK(cs_coinsView);
+                auto it = intermediates.find(prevJoinSplit.anchor);
+                if (it != intermediates.end()) {
+                    tree = it->second;
+                } else if (!coinsView->GetSproutAnchorAt(prevJoinSplit.anchor, tree)) {
+                    throw JSDescException("Could not find previous JoinSplit anchor");
+                }
+            }
+
+            assert(changeOutputIndex != -1);
+            assert(changeOutputIndex < prevJoinSplit.commitments.size());
+            std::optional<SproutWitness> changeWitness;
+            int n = 0;
+            for (const uint256& commitment : prevJoinSplit.commitments) {
+                tree.append(commitment);
+                previousCommitments.push_back(commitment);
+                if (!changeWitness && changeOutputIndex == n++) {
+                    changeWitness = tree.witness();
+                } else if (changeWitness) {
+                    changeWitness.value().append(commitment);
+                }
+            }
+            assert(changeWitness.has_value());
+            jsAnchor = tree.root();
+            intermediates.insert(std::make_pair(tree.root(), tree)); // chained js are interstitial (found in between block boundaries)
+
+            // Decrypt the change note's ciphertext to retrieve some data we need
+            ZCNoteDecryption decryptor(changeKey.receiving_key());
+            auto hSig = ZCJoinSplit::h_sig(
+                prevJoinSplit.randomSeed,
+                prevJoinSplit.nullifiers,
+                mtx.joinSplitPubKey);
+            try {
+                auto plaintext = libzcash::SproutNotePlaintext::decrypt(
+                    decryptor,
+                    prevJoinSplit.ciphertexts[changeOutputIndex],
+                    prevJoinSplit.ephemeralKey,
+                    hSig,
+                    (unsigned char)changeOutputIndex);
+
+                auto note = plaintext.note(changeAddress);
+                vjsin[0] = libzcash::JSInput(changeWitness.value(), note, changeKey);
+
+                jsInputValue += plaintext.value();
+
+                LogPrint("zrpcunsafe", "spending change (amount=%s)\n", FormatMoney(plaintext.value()));
+
+            } catch (const std::exception& e) {
+                throw JSDescException("Error decrypting output note of previous JoinSplit");
+            }
+        }
+
+        //
+        // Consume spendable non-change notes
+        //
+        for (int n = (jsChange > 0) ? 1 : 0; n < ZC_NUM_JS_INPUTS && jsInputsDeque.size() > 0; n++) {
+            auto jsInput = jsInputsDeque.front();
+            jsInputsDeque.pop_front();
+
+            // Add history of previous commitments to witness
+            if (jsChange > 0) {
+                for (const uint256& commitment : previousCommitments) {
+                    jsInput.witness.append(commitment);
+                }
+                if (jsAnchor != jsInput.witness.root()) {
+                    throw JSDescException("Witness for spendable note does not have same anchor as change input");
+                }
+            }
+
+            // The jsAnchor is null if this JoinSplit is at the start of a new chain
+            if (jsAnchor.IsNull()) {
+                jsAnchor = jsInput.witness.root();
+            }
+
+            jsInputValue += jsInput.note.value();
+            vjsin[n] = jsInput;
+        }
+
+        // Find recipient to transfer funds to
+        libzcash::JSOutput recipient;
+        if (jsOutputsDeque.size() > 0) {
+            recipient = jsOutputsDeque.front();
+            jsOutputsDeque.pop_front();
+        }
+        // `recipient` is now either a valid recipient, or a dummy output with value = 0
+
+        // Reset change
+        jsChange = 0;
+        CAmount outAmount = recipient.value;
+
+        // Set vpub_new in the last joinsplit (when there are no more notes to spend or zaddr outputs to satisfy)
+        if (jsOutputsDeque.empty() && jsInputsDeque.empty()) {
+            assert(!vpubNewProcessed);
+            if (jsInputValue < vpubNewTarget) {
+                throw JSDescException(strprintf("Insufficient funds for vpub_new %s", FormatMoney(vpubNewTarget)));
+            }
+            outAmount += vpubNewTarget;
+            vpub_new += vpubNewTarget; // funds flowing back to public pool
+            vpubNewProcessed = true;
+            jsChange = jsInputValue - outAmount;
+            assert(jsChange >= 0);
+        } else {
+            // This is not the last joinsplit, so compute change and any amount still due to the recipient
+            if (jsInputValue > outAmount) {
+                jsChange = jsInputValue - outAmount;
+            } else if (outAmount > jsInputValue) {
+                // Any amount due is owed to the recipient.  Let the miners fee get paid first.
+                CAmount due = outAmount - jsInputValue;
+                libzcash::JSOutput recipientDue(recipient.addr, due);
+                recipientDue.memo = recipient.memo;
+                jsOutputsDeque.push_front(recipientDue);
+
+                // reduce the amount being sent right now to the value of all inputs
+                recipient.value = jsInputValue;
+            }
+        }
+
+        // create output for recipient
+        assert(ZC_NUM_JS_OUTPUTS == 2); // If this changes, the logic here will need to be adjusted
+        vjsout[0] = recipient;
+
+        // create output for any change
+        if (jsChange > 0) {
+            vjsout[1] = libzcash::JSOutput(changeAddress, jsChange);
+
+            LogPrint("zrpcunsafe", "generating note for change (amount=%s)\n", FormatMoney(jsChange));
+        }
+
+        std::array<size_t, ZC_NUM_JS_INPUTS> inputMap;
+        std::array<size_t, ZC_NUM_JS_OUTPUTS> outputMap;
+        CreateJSDescription(vpub_old, vpub_new, vjsin, vjsout, inputMap, outputMap);
+
+        if (jsChange > 0) {
+            changeOutputIndex = -1;
+            for (size_t i = 0; i < outputMap.size(); i++) {
+                if (outputMap[i] == 1) {
+                    changeOutputIndex = i;
+                }
+            }
+            assert(changeOutputIndex != -1);
+        }
+    }
+}
+
+void TransactionBuilder::CreateJSDescription(
+    uint64_t vpub_old,
+    uint64_t vpub_new,
+    std::array<libzcash::JSInput, ZC_NUM_JS_INPUTS> vjsin,
+    std::array<libzcash::JSOutput, ZC_NUM_JS_OUTPUTS> vjsout,
+    std::array<size_t, ZC_NUM_JS_INPUTS>& inputMap,
+    std::array<size_t, ZC_NUM_JS_OUTPUTS>& outputMap)
+{
+    LogPrint("zrpcunsafe", "CreateJSDescription: creating joinsplit at index %d (vpub_old=%s, vpub_new=%s, in[0]=%s, in[1]=%s, out[0]=%s, out[1]=%s)\n",
+        mtx.vJoinSplit.size(),
+        FormatMoney(vpub_old), FormatMoney(vpub_new),
+        FormatMoney(vjsin[0].note.value()), FormatMoney(vjsin[1].note.value()),
+        FormatMoney(vjsout[0].value), FormatMoney(vjsout[1].value));
+
+    uint256 esk; // payment disclosure - secret
+
+    // Generate the proof, this can take over a minute.
+    assert(mtx.fOverwintered && (mtx.nVersion >= SAPLING_TX_VERSION));
+    JSDescription jsdesc = JSDescriptionInfo(
+            mtx.joinSplitPubKey,
+            vjsin[0].witness.root(),
+            vjsin,
+            vjsout,
+            vpub_old,
+            vpub_new
+    ).BuildRandomized(
+            inputMap,
+            outputMap,
+            true, //!this->testmode,
+            &esk); // parameter expects pointer to esk, so pass in address
+
+    {
+        auto verifier = ProofVerifier::Strict();
+        if (!verifier.VerifySprout(jsdesc, mtx.joinSplitPubKey)) {
+            throw std::runtime_error("error verifying joinsplit");
+        }
+    }
+
+    mtx.vJoinSplit.push_back(jsdesc);
+
+    // TODO: Sprout payment disclosure
+}
diff --git a/depend/zcash/src/transaction_builder.h b/depend/zcash/src/transaction_builder.h
new file mode 100644
index 000000000..b8e8bdf75
--- /dev/null
+++ b/depend/zcash/src/transaction_builder.h
@@ -0,0 +1,404 @@
+// Copyright (c) 2018 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_TRANSACTION_BUILDER_H
+#define ZCASH_TRANSACTION_BUILDER_H
+
+#include "coins.h"
+#include "consensus/params.h"
+#include "keystore.h"
+#include "primitives/transaction.h"
+#include "random.h"
+#include "script/script.h"
+#include "script/standard.h"
+#include "uint256.h"
+#include "zcash/Address.hpp"
+#include "zcash/IncrementalMerkleTree.hpp"
+#include "zcash/JoinSplit.hpp"
+#include "zcash/Note.hpp"
+#include "zcash/NoteEncryption.hpp"
+
+#include <optional>
+
+#include <rust/builder.h>
+
+#define NO_MEMO {{0xF6}}
+
+class OrchardWallet;
+namespace orchard { class UnauthorizedBundle; }
+
+uint256 ProduceZip244SignatureHash(
+    const CTransaction& tx,
+    const std::vector<CTxOut>& allPrevOutputs,
+    const orchard::UnauthorizedBundle& orchardBundle);
+
+namespace orchard {
+
+/// The information necessary to spend an Orchard note.
+class SpendInfo
+{
+private:
+    /// Memory is allocated by Rust.
+    std::unique_ptr<OrchardSpendInfoPtr, decltype(&orchard_spend_info_free)> inner;
+    libzcash::OrchardRawAddress from;
+    uint64_t noteValue;
+
+    // SpendInfo() : inner(nullptr, orchard_spend_info_free) {}
+    SpendInfo(
+        OrchardSpendInfoPtr* spendInfo,
+        libzcash::OrchardRawAddress fromIn,
+        uint64_t noteValueIn
+    ) : inner(spendInfo, orchard_spend_info_free), from(fromIn), noteValue(noteValueIn) {}
+
+    friend class Builder;
+    friend class ::OrchardWallet;
+
+public:
+    // SpendInfo should never be copied
+    SpendInfo(const SpendInfo&) = delete;
+    SpendInfo& operator=(const SpendInfo&) = delete;
+    SpendInfo(SpendInfo&& spendInfo) :
+        inner(std::move(spendInfo.inner)), from(std::move(spendInfo.from)), noteValue(std::move(spendInfo.noteValue)) {}
+    SpendInfo& operator=(SpendInfo&& spendInfo)
+    {
+        if (this != &spendInfo) {
+            inner = std::move(spendInfo.inner);
+            from = std::move(spendInfo.from);
+            noteValue = std::move(spendInfo.noteValue);
+        }
+        return *this;
+    }
+
+    inline libzcash::OrchardRawAddress FromAddress() const { return from; };
+    inline uint64_t Value() const { return noteValue; };
+};
+
+/// A builder that constructs an `UnauthorizedBundle` from a set of notes to be spent,
+/// and recipients to receive funds.
+class Builder {
+private:
+    /// The Orchard builder. Memory is allocated by Rust. If this is `nullptr` then
+    /// `Builder::Build` has been called, and all subsequent operations will throw an
+    /// exception.
+    std::unique_ptr<OrchardBuilderPtr, decltype(&orchard_builder_free)> inner;
+    bool hasActions{false};
+
+    Builder() : inner(nullptr, orchard_builder_free), hasActions(false) { }
+
+public:
+    Builder(bool spendsEnabled, bool outputsEnabled, uint256 anchor);
+
+    // Builder should never be copied
+    Builder(const Builder&) = delete;
+    Builder& operator=(const Builder&) = delete;
+    Builder(Builder&& builder) : inner(std::move(builder.inner)) {}
+    Builder& operator=(Builder&& builder)
+    {
+        if (this != &builder) {
+            inner = std::move(builder.inner);
+        }
+        return *this;
+    }
+
+    /// Adds a note to be spent in this bundle.
+    ///
+    /// Returns `false` if the given Merkle path does not have the required anchor
+    /// for the given note.
+    bool AddSpend(orchard::SpendInfo spendInfo);
+
+    /// Adds an address which will receive funds in this bundle.
+    void AddOutput(
+        const std::optional<uint256>& ovk,
+        const libzcash::OrchardRawAddress& to,
+        CAmount value,
+        const std::optional<std::array<unsigned char, ZC_MEMO_SIZE>>& memo);
+
+    /// Returns `true` if any spends or outputs have been added to this builder. This can
+    /// be used to avoid calling `Build()` and creating a dummy Orchard bundle.
+    bool HasActions() {
+        return hasActions;
+    }
+
+    /// Builds a bundle containing the given spent notes and recipients.
+    ///
+    /// Returns `std::nullopt` if an error occurs.
+    ///
+    /// Calling this method invalidates this object; in particular, if an error occurs
+    /// this builder must be discarded and a new builder created. Subsequent usage of this
+    /// object in any way will cause an exception. This emulates Rust's compile-time move
+    /// semantics at runtime.
+    std::optional<UnauthorizedBundle> Build();
+};
+
+/// An unauthorized Orchard bundle, ready for its proof to be created and signatures
+/// applied.
+class UnauthorizedBundle {
+private:
+    /// An optional Orchard bundle (with `nullptr` corresponding to `None`).
+    /// Memory is allocated by Rust.
+    std::unique_ptr<OrchardUnauthorizedBundlePtr, decltype(&orchard_unauthorized_bundle_free)> inner;
+
+    UnauthorizedBundle() : inner(nullptr, orchard_unauthorized_bundle_free) {}
+    UnauthorizedBundle(OrchardUnauthorizedBundlePtr* bundle) : inner(bundle, orchard_unauthorized_bundle_free) {}
+    friend class Builder;
+    // The parentheses here are necessary to avoid the following compilation error:
+    //     error: C++ requires a type specifier for all declarations
+    //             friend uint256 ::ProduceZip244SignatureHash(
+    //             ~~~~~~           ^
+    friend uint256 (::ProduceZip244SignatureHash(
+        const CTransaction& tx,
+        const std::vector<CTxOut>& allPrevOutputs,
+        const UnauthorizedBundle& orchardBundle));
+
+public:
+    // UnauthorizedBundle should never be copied
+    UnauthorizedBundle(const UnauthorizedBundle&) = delete;
+    UnauthorizedBundle& operator=(const UnauthorizedBundle&) = delete;
+    UnauthorizedBundle(UnauthorizedBundle&& bundle) : inner(std::move(bundle.inner)) {}
+    UnauthorizedBundle& operator=(UnauthorizedBundle&& bundle)
+    {
+        if (this != &bundle) {
+            inner = std::move(bundle.inner);
+        }
+        return *this;
+    }
+
+    /// Adds proofs and signatures to this bundle.
+    ///
+    /// Returns `std::nullopt` if an error occurs.
+    ///
+    /// Calling this method invalidates this object; in particular, if an error occurs
+    /// this bundle must be discarded and a new bundle built. Subsequent usage of this
+    /// object in any way will cause an exception. This emulates Rust's compile-time
+    /// move semantics at runtime.
+    std::optional<OrchardBundle> ProveAndSign(
+        const std::vector<libzcash::OrchardSpendingKey>& keys, uint256 sighash);
+};
+
+} // namespace orchard
+
+struct SpendDescriptionInfo {
+    libzcash::SaplingExpandedSpendingKey expsk;
+    libzcash::SaplingNote note;
+    uint256 alpha;
+    uint256 anchor;
+    SaplingWitness witness;
+
+    SpendDescriptionInfo(
+        libzcash::SaplingExpandedSpendingKey expsk,
+        libzcash::SaplingNote note,
+        uint256 anchor,
+        SaplingWitness witness);
+};
+
+struct OutputDescriptionInfo {
+    uint256 ovk;
+    libzcash::SaplingNote note;
+    std::array<unsigned char, ZC_MEMO_SIZE> memo;
+
+    OutputDescriptionInfo(
+        uint256 ovk,
+        libzcash::SaplingNote note,
+        std::array<unsigned char, ZC_MEMO_SIZE> memo) : ovk(ovk), note(note), memo(memo) {}
+
+    std::optional<OutputDescription> Build(void* ctx);
+};
+
+struct JSDescriptionInfo {
+    Ed25519VerificationKey joinSplitPubKey;
+    uint256 anchor;
+    // We store references to these so they are correctly randomised for the caller.
+    std::array<libzcash::JSInput, ZC_NUM_JS_INPUTS>& inputs;
+    std::array<libzcash::JSOutput, ZC_NUM_JS_OUTPUTS>& outputs;
+    CAmount vpub_old;
+    CAmount vpub_new;
+
+    JSDescriptionInfo(
+        Ed25519VerificationKey joinSplitPubKey,
+        uint256 anchor,
+        std::array<libzcash::JSInput, ZC_NUM_JS_INPUTS>& inputs,
+        std::array<libzcash::JSOutput, ZC_NUM_JS_OUTPUTS>& outputs,
+        CAmount vpub_old,
+        CAmount vpub_new) : joinSplitPubKey(joinSplitPubKey), anchor(anchor), inputs(inputs), outputs(outputs), vpub_old(vpub_old), vpub_new(vpub_new) {}
+
+    JSDescription BuildDeterministic(
+        bool computeProof = true, // Set to false in some tests
+        uint256* esk = nullptr    // payment disclosure
+    );
+
+    JSDescription BuildRandomized(
+        std::array<size_t, ZC_NUM_JS_INPUTS>& inputMap,
+        std::array<size_t, ZC_NUM_JS_OUTPUTS>& outputMap,
+        bool computeProof = true, // Set to false in some tests
+        uint256* esk = nullptr,   // payment disclosure
+        std::function<int(int)> gen = GetRandInt
+    );
+};
+
+class TransactionBuilderResult {
+private:
+    std::optional<CTransaction> maybeTx;
+    std::optional<std::string> maybeError;
+public:
+    TransactionBuilderResult() = delete;
+    TransactionBuilderResult(const CTransaction& tx);
+    TransactionBuilderResult(const std::string& error);
+    bool IsTx();
+    bool IsError();
+    CTransaction GetTxOrThrow();
+    std::string GetError();
+};
+
+class TransactionBuilder
+{
+private:
+    Consensus::Params consensusParams;
+    int nHeight;
+    const CKeyStore* keystore;
+    const CCoinsViewCache* coinsView;
+    CCriticalSection* cs_coinsView;
+    CMutableTransaction mtx;
+    CAmount fee = 10000;
+    std::optional<uint256> orchardAnchor;
+    std::optional<orchard::Builder> orchardBuilder;
+    CAmount valueBalanceOrchard = 0;
+
+    std::vector<libzcash::OrchardSpendingKey> orchardSpendingKeys;
+    std::optional<libzcash::OrchardRawAddress> firstOrchardSpendAddr;
+    std::vector<SpendDescriptionInfo> spends;
+    std::vector<OutputDescriptionInfo> outputs;
+    std::vector<libzcash::JSInput> jsInputs;
+    std::vector<libzcash::JSOutput> jsOutputs;
+    std::vector<CTxOut> tIns;
+
+    std::optional<std::pair<uint256, libzcash::SaplingPaymentAddress>> saplingChangeAddr;
+    std::optional<std::pair<uint256, libzcash::OrchardRawAddress>> orchardChangeAddr;
+    std::optional<libzcash::SproutPaymentAddress> sproutChangeAddr;
+    std::optional<CTxDestination> tChangeAddr;
+
+public:
+    TransactionBuilder() {}
+    TransactionBuilder(
+        const Consensus::Params& consensusParams,
+        int nHeight,
+        std::optional<uint256> orchardAnchor,
+        CKeyStore* keyStore = nullptr,
+        CCoinsViewCache* coinsView = nullptr,
+        CCriticalSection* cs_coinsView = nullptr);
+
+    // TransactionBuilder should never be copied
+    TransactionBuilder(const TransactionBuilder&) = delete;
+    TransactionBuilder& operator=(const TransactionBuilder&) = delete;
+    TransactionBuilder(TransactionBuilder&& builder) :
+        consensusParams(std::move(builder.consensusParams)),
+        nHeight(std::move(builder.nHeight)),
+        keystore(std::move(builder.keystore)),
+        coinsView(std::move(builder.coinsView)),
+        cs_coinsView(std::move(builder.cs_coinsView)),
+        mtx(std::move(builder.mtx)),
+        fee(std::move(builder.fee)),
+        orchardAnchor(std::move(builder.orchardAnchor)),
+        orchardBuilder(std::move(builder.orchardBuilder)),
+        valueBalanceOrchard(std::move(builder.valueBalanceOrchard)),
+        spends(std::move(builder.spends)),
+        outputs(std::move(builder.outputs)),
+        jsInputs(std::move(builder.jsInputs)),
+        jsOutputs(std::move(builder.jsOutputs)),
+        tIns(std::move(builder.tIns)),
+        saplingChangeAddr(std::move(builder.saplingChangeAddr)),
+        sproutChangeAddr(std::move(builder.sproutChangeAddr)),
+        tChangeAddr(std::move(builder.tChangeAddr)) {}
+    TransactionBuilder& operator=(TransactionBuilder&& builder)
+    {
+        if (this != &builder) {
+            consensusParams = std::move(builder.consensusParams);
+            nHeight = std::move(builder.nHeight);
+            keystore = std::move(builder.keystore);
+            coinsView = std::move(builder.coinsView);
+            cs_coinsView = std::move(builder.cs_coinsView);
+            mtx = std::move(builder.mtx);
+            fee = std::move(builder.fee);
+            orchardBuilder = std::move(builder.orchardBuilder);
+            valueBalanceOrchard = std::move(builder.valueBalanceOrchard);
+            spends = std::move(builder.spends);
+            outputs = std::move(builder.outputs);
+            jsInputs = std::move(builder.jsInputs);
+            jsOutputs = std::move(builder.jsOutputs);
+            tIns = std::move(builder.tIns);
+            saplingChangeAddr = std::move(builder.saplingChangeAddr);
+            sproutChangeAddr = std::move(builder.sproutChangeAddr);
+            tChangeAddr = std::move(builder.tChangeAddr);
+        }
+        return *this;
+    }
+
+    void SetExpiryHeight(uint32_t nExpiryHeight);
+
+    void SetFee(CAmount fee);
+
+    bool SupportsOrchard() const;
+
+    std::optional<uint256> GetOrchardAnchor() const;
+
+    bool AddOrchardSpend(
+        libzcash::OrchardSpendingKey sk,
+        orchard::SpendInfo spendInfo);
+
+    void AddOrchardOutput(
+        const std::optional<uint256>& ovk,
+        const libzcash::OrchardRawAddress& to,
+        CAmount value,
+        const std::optional<std::array<unsigned char, ZC_MEMO_SIZE>>& memo);
+
+    // Throws if the anchor does not match the anchor used by
+    // previously-added Sapling spends.
+    void AddSaplingSpend(
+        libzcash::SaplingExpandedSpendingKey expsk,
+        libzcash::SaplingNote note,
+        uint256 anchor,
+        SaplingWitness witness);
+
+    void AddSaplingOutput(
+        uint256 ovk,
+        libzcash::SaplingPaymentAddress to,
+        CAmount value,
+        std::array<unsigned char, ZC_MEMO_SIZE> memo = NO_MEMO);
+
+    // Throws if the anchor does not match the anchor used by
+    // previously-added Sprout inputs.
+    void AddSproutInput(
+        libzcash::SproutSpendingKey sk,
+        libzcash::SproutNote note,
+        SproutWitness witness);
+
+    void AddSproutOutput(
+        libzcash::SproutPaymentAddress to,
+        CAmount value,
+        std::array<unsigned char, ZC_MEMO_SIZE> memo = NO_MEMO);
+
+    // Assumes that the value correctly corresponds to the provided UTXO.
+    void AddTransparentInput(COutPoint utxo, CScript scriptPubKey, CAmount value);
+
+    void AddTransparentOutput(const CTxDestination& to, CAmount value);
+
+    void SendChangeTo(const libzcash::RecipientAddress& changeAddr, const uint256& ovk);
+    void SendChangeToSprout(const libzcash::SproutPaymentAddress& changeAddr);
+
+    TransactionBuilderResult Build();
+
+private:
+    void CheckOrSetUsingSprout();
+
+    void CreateJSDescriptions();
+
+    void CreateJSDescription(
+        uint64_t vpub_old,
+        uint64_t vpub_new,
+        std::array<libzcash::JSInput, ZC_NUM_JS_INPUTS> vjsin,
+        std::array<libzcash::JSOutput, ZC_NUM_JS_OUTPUTS> vjsout,
+        std::array<size_t, ZC_NUM_JS_INPUTS>& inputMap,
+        std::array<size_t, ZC_NUM_JS_OUTPUTS>& outputMap);
+};
+
+#endif // ZCASH_TRANSACTION_BUILDER_H
diff --git a/depend/zcash/src/txdb.cpp b/depend/zcash/src/txdb.cpp
new file mode 100644
index 000000000..965a9adf4
--- /dev/null
+++ b/depend/zcash/src/txdb.cpp
@@ -0,0 +1,670 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "txdb.h"
+
+#include "chainparams.h"
+#include "hash.h"
+#include "main.h"
+#include "pow.h"
+#include "uint256.h"
+#include "zcash/History.hpp"
+
+#include <stdint.h>
+
+#include <boost/thread.hpp>
+
+using namespace std;
+
+// NOTE: Per issue #3277, do not use the prefix 'X' or 'x' as they were
+// previously used by DB_SAPLING_ANCHOR and DB_BEST_SAPLING_ANCHOR.
+static const char DB_SPROUT_ANCHOR = 'A';
+static const char DB_SAPLING_ANCHOR = 'Z';
+static const char DB_ORCHARD_ANCHOR = 'Y';
+static const char DB_NULLIFIER = 's';
+static const char DB_SAPLING_NULLIFIER = 'S';
+static const char DB_ORCHARD_NULLIFIER = 'O';
+static const char DB_COINS = 'c';
+static const char DB_BLOCK_FILES = 'f';
+static const char DB_TXINDEX = 't';
+static const char DB_BLOCK_INDEX = 'b';
+
+static const char DB_BEST_BLOCK = 'B';
+static const char DB_BEST_SPROUT_ANCHOR = 'a';
+static const char DB_BEST_SAPLING_ANCHOR = 'z';
+static const char DB_BEST_ORCHARD_ANCHOR = 'y';
+static const char DB_FLAG = 'F';
+static const char DB_REINDEX_FLAG = 'R';
+static const char DB_LAST_BLOCK = 'l';
+
+static const char DB_MMR_LENGTH = 'M';
+static const char DB_MMR_NODE = 'm';
+static const char DB_MMR_ROOT = 'r';
+
+// insightexplorer
+static const char DB_ADDRESSINDEX = 'd';
+static const char DB_ADDRESSUNSPENTINDEX = 'u';
+static const char DB_SPENTINDEX = 'p';
+static const char DB_TIMESTAMPINDEX = 'T';
+static const char DB_BLOCKHASHINDEX = 'h';
+
+CCoinsViewDB::CCoinsViewDB(std::string dbName, size_t nCacheSize, bool fMemory, bool fWipe) : db(GetDataDir() / dbName, nCacheSize, fMemory, fWipe) {
+}
+
+CCoinsViewDB::CCoinsViewDB(size_t nCacheSize, bool fMemory, bool fWipe) : db(GetDataDir() / "chainstate", nCacheSize, fMemory, fWipe)
+{
+}
+
+bool CCoinsViewDB::GetSproutAnchorAt(const uint256 &rt, SproutMerkleTree &tree) const {
+    if (rt == SproutMerkleTree::empty_root()) {
+        SproutMerkleTree new_tree;
+        tree = new_tree;
+        return true;
+    }
+
+    bool read = db.Read(make_pair(DB_SPROUT_ANCHOR, rt), tree);
+
+    return read;
+}
+
+bool CCoinsViewDB::GetSaplingAnchorAt(const uint256 &rt, SaplingMerkleTree &tree) const {
+    if (rt == SaplingMerkleTree::empty_root()) {
+        SaplingMerkleTree new_tree;
+        tree = new_tree;
+        return true;
+    }
+
+    bool read = db.Read(make_pair(DB_SAPLING_ANCHOR, rt), tree);
+
+    return read;
+}
+
+bool CCoinsViewDB::GetOrchardAnchorAt(const uint256 &rt, OrchardMerkleFrontier &tree) const {
+    if (rt == OrchardMerkleFrontier::empty_root()) {
+        OrchardMerkleFrontier new_tree;
+        tree = new_tree;
+        return true;
+    }
+
+    bool read = db.Read(make_pair(DB_ORCHARD_ANCHOR, rt), tree);
+
+    return read;
+}
+
+bool CCoinsViewDB::GetNullifier(const uint256 &nf, ShieldedType type) const {
+    bool spent = false;
+    char dbChar;
+    switch (type) {
+        case SPROUT:
+            dbChar = DB_NULLIFIER;
+            break;
+        case SAPLING:
+            dbChar = DB_SAPLING_NULLIFIER;
+            break;
+        case ORCHARD:
+            dbChar = DB_ORCHARD_NULLIFIER;
+            break;
+        default:
+            throw runtime_error("Unknown shielded type");
+    }
+    return db.Read(make_pair(dbChar, nf), spent);
+}
+
+bool CCoinsViewDB::GetCoins(const uint256 &txid, CCoins &coins) const {
+    return db.Read(make_pair(DB_COINS, txid), coins);
+}
+
+bool CCoinsViewDB::HaveCoins(const uint256 &txid) const {
+    return db.Exists(make_pair(DB_COINS, txid));
+}
+
+uint256 CCoinsViewDB::GetBestBlock() const {
+    uint256 hashBestChain;
+    if (!db.Read(DB_BEST_BLOCK, hashBestChain))
+        return uint256();
+    return hashBestChain;
+}
+
+uint256 CCoinsViewDB::GetBestAnchor(ShieldedType type) const {
+    uint256 hashBestAnchor;
+
+    switch (type) {
+        case SPROUT:
+            if (!db.Read(DB_BEST_SPROUT_ANCHOR, hashBestAnchor))
+                return SproutMerkleTree::empty_root();
+            break;
+        case SAPLING:
+            if (!db.Read(DB_BEST_SAPLING_ANCHOR, hashBestAnchor))
+                return SaplingMerkleTree::empty_root();
+            break;
+        case ORCHARD:
+            if (!db.Read(DB_BEST_ORCHARD_ANCHOR, hashBestAnchor))
+                return OrchardMerkleFrontier::empty_root();
+            break;
+        default:
+            throw runtime_error("Unknown shielded type");
+    }
+
+    return hashBestAnchor;
+}
+
+HistoryIndex CCoinsViewDB::GetHistoryLength(uint32_t epochId) const {
+    HistoryIndex historyLength;
+    if (!db.Read(make_pair(DB_MMR_LENGTH, epochId), historyLength)) {
+        // Starting new history
+        historyLength = 0;
+    }
+
+    return historyLength;
+}
+
+HistoryNode CCoinsViewDB::GetHistoryAt(uint32_t epochId, HistoryIndex index) const {
+    HistoryNode mmrNode = {};
+
+    if (index >= GetHistoryLength(epochId)) {
+        throw runtime_error("History data inconsistent - reindex?");
+    }
+
+    if (libzcash::IsV1HistoryTree(epochId)) {
+        // History nodes serialized by `zcashd` versions that were unaware of NU5, used
+        // the previous shorter maximum serialized length. Because we stored this as an
+        // array, we can't just read the current (longer) maximum serialized length, as
+        // it will result in an exception for those older nodes.
+        //
+        // Instead, we always read an array of the older length. This works as expected
+        // for V1 nodes serialized by older clients, while for V1 nodes serialized by
+        // NU5-aware clients this is guaranteed to ignore only trailing zero bytes.
+        std::array<unsigned char, NODE_V1_SERIALIZED_LENGTH> tmpMmrNode;
+        if (!db.Read(make_pair(DB_MMR_NODE, make_pair(epochId, index)), tmpMmrNode)) {
+            throw runtime_error("History data inconsistent (expected node not found) - reindex?");
+        }
+        std::copy(std::begin(tmpMmrNode), std::end(tmpMmrNode), mmrNode.bytes);
+    } else {
+        // Read mmrNode into tmp std::array
+        std::array<unsigned char, NODE_SERIALIZED_LENGTH> tmpMmrNode;
+
+        if (!db.Read(make_pair(DB_MMR_NODE, make_pair(epochId, index)), tmpMmrNode)) {
+            throw runtime_error("History data inconsistent (expected node not found) - reindex?");
+        }
+
+        std::copy(std::begin(tmpMmrNode), std::end(tmpMmrNode), mmrNode.bytes);
+    }
+
+    return mmrNode;
+}
+
+uint256 CCoinsViewDB::GetHistoryRoot(uint32_t epochId) const {
+    uint256 root;
+    if (!db.Read(make_pair(DB_MMR_ROOT, epochId), root))
+    {
+        root = uint256();
+    }
+    return root;
+}
+
+void BatchWriteNullifiers(CDBBatch& batch, CNullifiersMap& mapToUse, const char& dbChar)
+{
+    for (CNullifiersMap::iterator it = mapToUse.begin(); it != mapToUse.end();) {
+        if (it->second.flags & CNullifiersCacheEntry::DIRTY) {
+            if (!it->second.entered)
+                batch.Erase(make_pair(dbChar, it->first));
+            else
+                batch.Write(make_pair(dbChar, it->first), true);
+            // TODO: changed++? ... See comment in CCoinsViewDB::BatchWrite. If this is needed we could return an int
+        }
+        it = mapToUse.erase(it);
+    }
+}
+
+template<typename Map, typename MapIterator, typename MapEntry, typename Tree>
+void BatchWriteAnchors(CDBBatch& batch, Map& mapToUse, const char& dbChar)
+{
+    for (MapIterator it = mapToUse.begin(); it != mapToUse.end();) {
+        if (it->second.flags & MapEntry::DIRTY) {
+            if (!it->second.entered)
+                batch.Erase(make_pair(dbChar, it->first));
+            else {
+                if (it->first != Tree::empty_root()) {
+                    batch.Write(make_pair(dbChar, it->first), it->second.tree);
+                }
+            }
+            // TODO: changed++?
+        }
+        it = mapToUse.erase(it);
+    }
+}
+
+void BatchWriteHistory(CDBBatch& batch, CHistoryCacheMap& historyCacheMap) {
+    for (auto nextHistoryCache = historyCacheMap.begin(); nextHistoryCache != historyCacheMap.end(); nextHistoryCache++) {
+        auto historyCache = nextHistoryCache->second;
+        auto epochId = nextHistoryCache->first;
+
+        // delete old entries since updateDepth
+        for (int i = historyCache.updateDepth + 1; i <= historyCache.length; i++) {
+            batch.Erase(make_pair(DB_MMR_NODE, make_pair(epochId, i)));
+        }
+
+        // replace/append new/updated entries
+        for (auto it = historyCache.appends.begin(); it != historyCache.appends.end(); it++) {
+            // Write mmrNode into tmp std::array
+            std::array<unsigned char, NODE_SERIALIZED_LENGTH> tmpMmrNode;
+            std::copy((it->second).bytes, (it->second).bytes + NODE_SERIALIZED_LENGTH, std::begin(tmpMmrNode));
+            batch.Write(make_pair(DB_MMR_NODE, make_pair(epochId, it->first)), tmpMmrNode);
+        }
+
+        // write new length
+        batch.Write(make_pair(DB_MMR_LENGTH, epochId), historyCache.length);
+
+        // write current root
+        batch.Write(make_pair(DB_MMR_ROOT, epochId), historyCache.root);
+    }
+}
+
+bool CCoinsViewDB::BatchWrite(CCoinsMap &mapCoins,
+                              const uint256 &hashBlock,
+                              const uint256 &hashSproutAnchor,
+                              const uint256 &hashSaplingAnchor,
+                              const uint256 &hashOrchardAnchor,
+                              CAnchorsSproutMap &mapSproutAnchors,
+                              CAnchorsSaplingMap &mapSaplingAnchors,
+                              CAnchorsOrchardMap &mapOrchardAnchors,
+                              CNullifiersMap &mapSproutNullifiers,
+                              CNullifiersMap &mapSaplingNullifiers,
+                              CNullifiersMap &mapOrchardNullifiers,
+                              CHistoryCacheMap &historyCacheMap) {
+    CDBBatch batch(db);
+    size_t count = 0;
+    size_t changed = 0;
+    for (CCoinsMap::iterator it = mapCoins.begin(); it != mapCoins.end();) {
+        if (it->second.flags & CCoinsCacheEntry::DIRTY) {
+            if (it->second.coins.IsPruned())
+                batch.Erase(make_pair(DB_COINS, it->first));
+            else
+                batch.Write(make_pair(DB_COINS, it->first), it->second.coins);
+            changed++;
+        }
+        count++;
+        it = mapCoins.erase(it);
+    }
+
+    ::BatchWriteAnchors<CAnchorsSproutMap, CAnchorsSproutMap::iterator, CAnchorsSproutCacheEntry, SproutMerkleTree>(batch, mapSproutAnchors, DB_SPROUT_ANCHOR);
+    ::BatchWriteAnchors<CAnchorsSaplingMap, CAnchorsSaplingMap::iterator, CAnchorsSaplingCacheEntry, SaplingMerkleTree>(batch, mapSaplingAnchors, DB_SAPLING_ANCHOR);
+    ::BatchWriteAnchors<CAnchorsOrchardMap, CAnchorsOrchardMap::iterator, CAnchorsOrchardCacheEntry, OrchardMerkleFrontier>(batch, mapOrchardAnchors, DB_ORCHARD_ANCHOR);
+
+    ::BatchWriteNullifiers(batch, mapSproutNullifiers, DB_NULLIFIER);
+    ::BatchWriteNullifiers(batch, mapSaplingNullifiers, DB_SAPLING_NULLIFIER);
+    ::BatchWriteNullifiers(batch, mapOrchardNullifiers, DB_ORCHARD_NULLIFIER);
+
+    ::BatchWriteHistory(batch, historyCacheMap);
+
+    if (!hashBlock.IsNull())
+        batch.Write(DB_BEST_BLOCK, hashBlock);
+    if (!hashSproutAnchor.IsNull())
+        batch.Write(DB_BEST_SPROUT_ANCHOR, hashSproutAnchor);
+    if (!hashSaplingAnchor.IsNull())
+        batch.Write(DB_BEST_SAPLING_ANCHOR, hashSaplingAnchor);
+    if (!hashOrchardAnchor.IsNull())
+        batch.Write(DB_BEST_ORCHARD_ANCHOR, hashOrchardAnchor);
+
+    LogPrint("coindb", "Committing %u changed transactions (out of %u) to coin database...\n", (unsigned int)changed, (unsigned int)count);
+    return db.WriteBatch(batch);
+}
+
+CBlockTreeDB::CBlockTreeDB(size_t nCacheSize, bool fMemory, bool fWipe) : CDBWrapper(GetDataDir() / "blocks" / "index", nCacheSize, fMemory, fWipe) {
+}
+
+bool CBlockTreeDB::ReadBlockFileInfo(int nFile, CBlockFileInfo &info) {
+    return Read(make_pair(DB_BLOCK_FILES, nFile), info);
+}
+
+bool CBlockTreeDB::WriteReindexing(bool fReindexing) {
+    if (fReindexing)
+        return Write(DB_REINDEX_FLAG, '1');
+    else
+        return Erase(DB_REINDEX_FLAG);
+}
+
+bool CBlockTreeDB::ReadReindexing(bool &fReindexing) {
+    fReindexing = Exists(DB_REINDEX_FLAG);
+    return true;
+}
+
+bool CBlockTreeDB::ReadLastBlockFile(int &nFile) {
+    return Read(DB_LAST_BLOCK, nFile);
+}
+
+bool CCoinsViewDB::GetStats(CCoinsStats &stats) const {
+    /* It seems that there are no "const iterators" for LevelDB.  Since we
+       only need read operations on it, use a const-cast to get around
+       that restriction.  */
+    boost::scoped_ptr<CDBIterator> pcursor(const_cast<CDBWrapper*>(&db)->NewIterator());
+    pcursor->Seek(DB_COINS);
+
+    CHashWriter ss(SER_GETHASH, PROTOCOL_VERSION);
+    stats.hashBlock = GetBestBlock();
+    ss << stats.hashBlock;
+    CAmount nTotalAmount = 0;
+    while (pcursor->Valid()) {
+        boost::this_thread::interruption_point();
+        std::pair<char, uint256> key;
+        CCoins coins;
+        if (pcursor->GetKey(key) && key.first == DB_COINS) {
+            if (pcursor->GetValue(coins)) {
+                stats.nTransactions++;
+                for (unsigned int i=0; i<coins.vout.size(); i++) {
+                    const CTxOut &out = coins.vout[i];
+                    if (!out.IsNull()) {
+                        stats.nTransactionOutputs++;
+                        ss << VARINT(i+1);
+                        ss << out;
+                        nTotalAmount += out.nValue;
+                    }
+                }
+                stats.nSerializedSize += 32 + pcursor->GetValueSize();
+                ss << VARINT(0);
+            } else {
+                return error("CCoinsViewDB::GetStats() : unable to read value");
+            }
+        } else {
+            break;
+        }
+        pcursor->Next();
+    }
+    {
+        LOCK(cs_main);
+        stats.nHeight = mapBlockIndex.find(stats.hashBlock)->second->nHeight;
+    }
+    stats.hashSerialized = ss.GetHash();
+    stats.nTotalAmount = nTotalAmount;
+    return true;
+}
+
+bool CBlockTreeDB::WriteBatchSync(const std::vector<std::pair<int, const CBlockFileInfo*> >& fileInfo, int nLastFile, const std::vector<const CBlockIndex*>& blockinfo) {
+    CDBBatch batch(*this);
+    for (std::vector<std::pair<int, const CBlockFileInfo*> >::const_iterator it=fileInfo.begin(); it != fileInfo.end(); it++) {
+        batch.Write(make_pair(DB_BLOCK_FILES, it->first), *it->second);
+    }
+    batch.Write(DB_LAST_BLOCK, nLastFile);
+    for (std::vector<const CBlockIndex*>::const_iterator it=blockinfo.begin(); it != blockinfo.end(); it++) {
+        batch.Write(make_pair(DB_BLOCK_INDEX, (*it)->GetBlockHash()), CDiskBlockIndex(*it));
+    }
+    return WriteBatch(batch, true);
+}
+
+bool CBlockTreeDB::EraseBatchSync(const std::vector<const CBlockIndex*>& blockinfo) {
+    CDBBatch batch(*this);
+    for (std::vector<const CBlockIndex*>::const_iterator it=blockinfo.begin(); it != blockinfo.end(); it++) {
+        batch.Erase(make_pair(DB_BLOCK_INDEX, (*it)->GetBlockHash()));
+    }
+    return WriteBatch(batch, true);
+}
+
+bool CBlockTreeDB::ReadTxIndex(const uint256 &txid, CDiskTxPos &pos) {
+    return Read(make_pair(DB_TXINDEX, txid), pos);
+}
+
+bool CBlockTreeDB::WriteTxIndex(const std::vector<std::pair<uint256, CDiskTxPos> >&vect) {
+    CDBBatch batch(*this);
+    for (std::vector<std::pair<uint256,CDiskTxPos> >::const_iterator it=vect.begin(); it!=vect.end(); it++)
+        batch.Write(make_pair(DB_TXINDEX, it->first), it->second);
+    return WriteBatch(batch);
+}
+
+// START insightexplorer
+// https://github.com/bitpay/bitcoin/commit/017f548ea6d89423ef568117447e61dd5707ec42#diff-81e4f16a1b5d5b7ca25351a63d07cb80R183
+bool CBlockTreeDB::UpdateAddressUnspentIndex(const std::vector<CAddressUnspentDbEntry> &vect)
+{
+    CDBBatch batch(*this);
+    for (std::vector<CAddressUnspentDbEntry>::const_iterator it=vect.begin(); it!=vect.end(); it++) {
+        if (it->second.IsNull()) {
+            batch.Erase(make_pair(DB_ADDRESSUNSPENTINDEX, it->first));
+        } else {
+            batch.Write(make_pair(DB_ADDRESSUNSPENTINDEX, it->first), it->second);
+        }
+    }
+    return WriteBatch(batch);
+}
+
+bool CBlockTreeDB::ReadAddressUnspentIndex(uint160 addressHash, int type, std::vector<CAddressUnspentDbEntry> &unspentOutputs)
+{
+    boost::scoped_ptr<CDBIterator> pcursor(NewIterator());
+
+    pcursor->Seek(make_pair(DB_ADDRESSUNSPENTINDEX, CAddressIndexIteratorKey(type, addressHash)));
+
+    while (pcursor->Valid()) {
+        boost::this_thread::interruption_point();
+        std::pair<char,CAddressUnspentKey> key;
+        if (!(pcursor->GetKey(key) && key.first == DB_ADDRESSUNSPENTINDEX && key.second.hashBytes == addressHash))
+            break;
+        CAddressUnspentValue nValue;
+        if (!pcursor->GetValue(nValue))
+            return error("failed to get address unspent value");
+        unspentOutputs.push_back(make_pair(key.second, nValue));
+        pcursor->Next();
+    }
+    return true;
+}
+
+bool CBlockTreeDB::WriteAddressIndex(const std::vector<CAddressIndexDbEntry> &vect) {
+    CDBBatch batch(*this);
+    for (std::vector<CAddressIndexDbEntry>::const_iterator it=vect.begin(); it!=vect.end(); it++)
+        batch.Write(make_pair(DB_ADDRESSINDEX, it->first), it->second);
+    return WriteBatch(batch);
+}
+
+bool CBlockTreeDB::EraseAddressIndex(const std::vector<CAddressIndexDbEntry> &vect) {
+    CDBBatch batch(*this);
+    for (std::vector<CAddressIndexDbEntry>::const_iterator it=vect.begin(); it!=vect.end(); it++)
+        batch.Erase(make_pair(DB_ADDRESSINDEX, it->first));
+    return WriteBatch(batch);
+}
+
+bool CBlockTreeDB::ReadAddressIndex(
+        uint160 addressHash, int type,
+        std::vector<CAddressIndexDbEntry> &addressIndex,
+        int start, int end)
+{
+    boost::scoped_ptr<CDBIterator> pcursor(NewIterator());
+
+    if (start > 0 && end > 0) {
+        pcursor->Seek(make_pair(DB_ADDRESSINDEX, CAddressIndexIteratorHeightKey(type, addressHash, start)));
+    } else {
+        pcursor->Seek(make_pair(DB_ADDRESSINDEX, CAddressIndexIteratorKey(type, addressHash)));
+    }
+
+    while (pcursor->Valid()) {
+        boost::this_thread::interruption_point();
+        std::pair<char,CAddressIndexKey> key;
+        if (!(pcursor->GetKey(key) && key.first == DB_ADDRESSINDEX && key.second.hashBytes == addressHash))
+            break;
+        if (end > 0 && key.second.blockHeight > end)
+            break;
+        CAmount nValue;
+        if (!pcursor->GetValue(nValue))
+            return error("failed to get address index value");
+        addressIndex.push_back(make_pair(key.second, nValue));
+        pcursor->Next();
+    }
+    return true;
+}
+
+bool CBlockTreeDB::ReadSpentIndex(CSpentIndexKey &key, CSpentIndexValue &value) {
+    return Read(make_pair(DB_SPENTINDEX, key), value);
+}
+
+bool CBlockTreeDB::UpdateSpentIndex(const std::vector<CSpentIndexDbEntry> &vect) {
+    CDBBatch batch(*this);
+    for (std::vector<CSpentIndexDbEntry>::const_iterator it=vect.begin(); it!=vect.end(); it++) {
+        if (it->second.IsNull()) {
+            batch.Erase(make_pair(DB_SPENTINDEX, it->first));
+        } else {
+            batch.Write(make_pair(DB_SPENTINDEX, it->first), it->second);
+        }
+    }
+    return WriteBatch(batch);
+}
+
+bool CBlockTreeDB::WriteTimestampIndex(const CTimestampIndexKey &timestampIndex) {
+    CDBBatch batch(*this);
+    batch.Write(make_pair(DB_TIMESTAMPINDEX, timestampIndex), 0);
+    return WriteBatch(batch);
+}
+
+bool CBlockTreeDB::ReadTimestampIndex(unsigned int high, unsigned int low,
+    const bool fActiveOnly, std::vector<std::pair<uint256, unsigned int> > &hashes)
+{
+    boost::scoped_ptr<CDBIterator> pcursor(NewIterator());
+
+    pcursor->Seek(make_pair(DB_TIMESTAMPINDEX, CTimestampIndexIteratorKey(low)));
+
+    while (pcursor->Valid()) {
+        boost::this_thread::interruption_point();
+        std::pair<char, CTimestampIndexKey> key;
+        if (!(pcursor->GetKey(key) && key.first == DB_TIMESTAMPINDEX && key.second.timestamp < high)) {
+            break;
+        }
+        if (fActiveOnly) {
+            CBlockIndex* pblockindex = mapBlockIndex[key.second.blockHash];
+            if (chainActive.Contains(pblockindex)) {
+                hashes.push_back(std::make_pair(key.second.blockHash, key.second.timestamp));
+            }
+        } else {
+            hashes.push_back(std::make_pair(key.second.blockHash, key.second.timestamp));
+        }
+        pcursor->Next();
+    }
+    return true;
+}
+
+bool CBlockTreeDB::WriteTimestampBlockIndex(const CTimestampBlockIndexKey &blockhashIndex,
+    const CTimestampBlockIndexValue &logicalts)
+{
+    CDBBatch batch(*this);
+    batch.Write(make_pair(DB_BLOCKHASHINDEX, blockhashIndex), logicalts);
+    return WriteBatch(batch);
+}
+
+bool CBlockTreeDB::ReadTimestampBlockIndex(const uint256 &hash, unsigned int &ltimestamp)
+{
+    CTimestampBlockIndexValue(lts);
+    if (!Read(std::make_pair(DB_BLOCKHASHINDEX, hash), lts))
+        return false;
+
+    ltimestamp = lts.ltimestamp;
+    return true;
+}
+// END insightexplorer
+
+bool CBlockTreeDB::WriteFlag(const std::string &name, bool fValue) {
+    return Write(std::make_pair(DB_FLAG, name), fValue ? '1' : '0');
+}
+
+bool CBlockTreeDB::ReadFlag(const std::string &name, bool &fValue) {
+    char ch;
+    if (!Read(std::make_pair(DB_FLAG, name), ch))
+        return false;
+    fValue = ch == '1';
+    return true;
+}
+
+bool CBlockTreeDB::LoadBlockIndexGuts(
+    std::function<CBlockIndex*(const uint256&)> insertBlockIndex,
+    const CChainParams& chainParams)
+{
+    boost::scoped_ptr<CDBIterator> pcursor(NewIterator());
+
+    pcursor->Seek(make_pair(DB_BLOCK_INDEX, uint256()));
+
+    // Load mapBlockIndex
+    while (pcursor->Valid()) {
+        boost::this_thread::interruption_point();
+        std::pair<char, uint256> key;
+        if (pcursor->GetKey(key) && key.first == DB_BLOCK_INDEX) {
+            CDiskBlockIndex diskindex;
+            if (pcursor->GetValue(diskindex)) {
+                // Construct block index object
+                CBlockIndex* pindexNew = insertBlockIndex(diskindex.GetBlockHash());
+                pindexNew->pprev          = insertBlockIndex(diskindex.hashPrev);
+                pindexNew->nHeight        = diskindex.nHeight;
+                pindexNew->nFile          = diskindex.nFile;
+                pindexNew->nDataPos       = diskindex.nDataPos;
+                pindexNew->nUndoPos       = diskindex.nUndoPos;
+                pindexNew->hashSproutAnchor     = diskindex.hashSproutAnchor;
+                pindexNew->nVersion       = diskindex.nVersion;
+                pindexNew->hashMerkleRoot = diskindex.hashMerkleRoot;
+                pindexNew->hashBlockCommitments  = diskindex.hashBlockCommitments;
+                pindexNew->nTime          = diskindex.nTime;
+                pindexNew->nBits          = diskindex.nBits;
+                pindexNew->nNonce         = diskindex.nNonce;
+                pindexNew->nSolution      = diskindex.nSolution;
+                pindexNew->nStatus        = diskindex.nStatus;
+                pindexNew->nCachedBranchId = diskindex.nCachedBranchId;
+                pindexNew->nTx            = diskindex.nTx;
+                pindexNew->nSproutValue   = diskindex.nSproutValue;
+                pindexNew->nSaplingValue  = diskindex.nSaplingValue;
+                pindexNew->nOrchardValue  = diskindex.nOrchardValue;
+                pindexNew->hashFinalSaplingRoot = diskindex.hashFinalSaplingRoot;
+                pindexNew->hashFinalOrchardRoot = diskindex.hashFinalOrchardRoot;
+                pindexNew->hashChainHistoryRoot = diskindex.hashChainHistoryRoot;
+                pindexNew->hashAuthDataRoot = diskindex.hashAuthDataRoot;
+
+                // Consistency checks
+                auto header = pindexNew->GetBlockHeader();
+                if (header.GetHash() != pindexNew->GetBlockHash())
+                    return error("LoadBlockIndex(): block header inconsistency detected: on-disk = %s, in-memory = %s",
+                       diskindex.ToString(),  pindexNew->ToString());
+                if (!CheckProofOfWork(pindexNew->GetBlockHash(), pindexNew->nBits, Params().GetConsensus()))
+                    return error("LoadBlockIndex(): CheckProofOfWork failed: %s", pindexNew->ToString());
+
+                // ZIP 221 consistency checks
+                // These checks should only be performed for block index entries marked
+                // as consensus-valid (at the time they were written).
+                //
+                if (pindexNew->IsValid(BLOCK_VALID_CONSENSUS)) {
+                    // We assume block index entries on disk that are not at least
+                    // CHAIN_HISTORY_ROOT_VERSION were created by nodes that were
+                    // not Heartwood aware. Such a node would not see Heartwood block
+                    // headers as valid, and so this must *either* be an index entry
+                    // for a block header on a non-Heartwood chain, or be marked as
+                    // consensus-invalid.
+                    //
+                    // It can also happen that the block index entry was written
+                    // by this node when it was Heartwood-aware (so its version
+                    // will be >= CHAIN_HISTORY_ROOT_VERSION), but received from
+                    // a non-upgraded peer. However that case the entry will be
+                    // marked as consensus-invalid.
+                    //
+                    if (diskindex.nClientVersion >= NU5_DATA_VERSION &&
+                        chainParams.GetConsensus().NetworkUpgradeActive(pindexNew->nHeight, Consensus::UPGRADE_NU5)) {
+                        // From NU5 onwards we don't enforce a consistency check, because
+                        // after ZIP 244, hashBlockCommitments will not match any stored
+                        // commitment.
+                    } else if (diskindex.nClientVersion >= CHAIN_HISTORY_ROOT_VERSION &&
+                        chainParams.GetConsensus().NetworkUpgradeActive(pindexNew->nHeight, Consensus::UPGRADE_HEARTWOOD)) {
+                        if (pindexNew->hashBlockCommitments != pindexNew->hashChainHistoryRoot) {
+                            return error(
+                                "LoadBlockIndex(): block index inconsistency detected (post-Heartwood; hashBlockCommitments %s != hashChainHistoryRoot %s): %s",
+                                pindexNew->hashBlockCommitments.ToString(), pindexNew->hashChainHistoryRoot.ToString(), pindexNew->ToString());
+                        }
+                    } else {
+                        if (pindexNew->hashBlockCommitments != pindexNew->hashFinalSaplingRoot) {
+                            return error(
+                                "LoadBlockIndex(): block index inconsistency detected (pre-Heartwood; hashBlockCommitments %s != hashFinalSaplingRoot %s): %s",
+                                pindexNew->hashBlockCommitments.ToString(), pindexNew->hashFinalSaplingRoot.ToString(), pindexNew->ToString());
+                        }
+                    }
+                }
+
+                pcursor->Next();
+            } else {
+                return error("LoadBlockIndex() : failed to read value");
+            }
+        } else {
+            break;
+        }
+    }
+
+    return true;
+}
diff --git a/depend/zcash/src/txdb.h b/depend/zcash/src/txdb.h
new file mode 100644
index 000000000..7d51c0a75
--- /dev/null
+++ b/depend/zcash/src/txdb.h
@@ -0,0 +1,151 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_TXDB_H
+#define BITCOIN_TXDB_H
+
+#include "coins.h"
+#include "dbwrapper.h"
+#include "chain.h"
+
+#include <map>
+#include <string>
+#include <utility>
+#include <vector>
+
+#include <boost/function.hpp>
+#include "zcash/History.hpp"
+
+class CBlockIndex;
+
+// START insightexplorer
+struct CAddressUnspentKey;
+struct CAddressUnspentValue;
+struct CAddressIndexKey;
+struct CAddressIndexIteratorKey;
+struct CAddressIndexIteratorHeightKey;
+struct CSpentIndexKey;
+struct CSpentIndexValue;
+struct CTimestampIndexKey;
+struct CTimestampIndexIteratorKey;
+struct CTimestampBlockIndexKey;
+struct CTimestampBlockIndexValue;
+
+typedef std::pair<CAddressUnspentKey, CAddressUnspentValue> CAddressUnspentDbEntry;
+typedef std::pair<CAddressIndexKey, CAmount> CAddressIndexDbEntry;
+typedef std::pair<CSpentIndexKey, CSpentIndexValue> CSpentIndexDbEntry;
+// END insightexplorer
+
+class uint256;
+
+//! -dbcache default (MiB)
+static const int64_t nDefaultDbCache = 450;
+//! max. -dbcache (MiB)
+static const int64_t nMaxDbCache = sizeof(void*) > 4 ? 16384 : 1024;
+//! min. -dbcache in (MiB)
+static const int64_t nMinDbCache = 4;
+
+struct CDiskTxPos : public CDiskBlockPos
+{
+    unsigned int nTxOffset; // after header
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(*(CDiskBlockPos*)this);
+        READWRITE(VARINT(nTxOffset));
+    }
+
+    CDiskTxPos(const CDiskBlockPos &blockIn, unsigned int nTxOffsetIn) : CDiskBlockPos(blockIn.nFile, blockIn.nPos), nTxOffset(nTxOffsetIn) {
+    }
+
+    CDiskTxPos() {
+        SetNull();
+    }
+
+    void SetNull() {
+        CDiskBlockPos::SetNull();
+        nTxOffset = 0;
+    }
+};
+
+/** CCoinsView backed by the coin database (chainstate/) */
+class CCoinsViewDB : public CCoinsView
+{
+protected:
+    CDBWrapper db;
+    CCoinsViewDB(std::string dbName, size_t nCacheSize, bool fMemory = false, bool fWipe = false);
+public:
+    CCoinsViewDB(size_t nCacheSize, bool fMemory = false, bool fWipe = false);
+
+    bool GetSproutAnchorAt(const uint256 &rt, SproutMerkleTree &tree) const;
+    bool GetSaplingAnchorAt(const uint256 &rt, SaplingMerkleTree &tree) const;
+    bool GetOrchardAnchorAt(const uint256 &rt, OrchardMerkleFrontier &tree) const;
+    bool GetNullifier(const uint256 &nf, ShieldedType type) const;
+    bool GetCoins(const uint256 &txid, CCoins &coins) const;
+    bool HaveCoins(const uint256 &txid) const;
+    uint256 GetBestBlock() const;
+    uint256 GetBestAnchor(ShieldedType type) const;
+    HistoryIndex GetHistoryLength(uint32_t epochId) const;
+    HistoryNode GetHistoryAt(uint32_t epochId, HistoryIndex index) const;
+    uint256 GetHistoryRoot(uint32_t epochId) const;
+    bool BatchWrite(CCoinsMap &mapCoins,
+                    const uint256 &hashBlock,
+                    const uint256 &hashSproutAnchor,
+                    const uint256 &hashSaplingAnchor,
+                    const uint256 &hashOrchardAnchor,
+                    CAnchorsSproutMap &mapSproutAnchors,
+                    CAnchorsSaplingMap &mapSaplingAnchors,
+                    CAnchorsOrchardMap &mapOrchardAnchors,
+                    CNullifiersMap &mapSproutNullifiers,
+                    CNullifiersMap &mapSaplingNullifiers,
+                    CNullifiersMap &mapOrchardNullifiers,
+                    CHistoryCacheMap &historyCacheMap);
+    bool GetStats(CCoinsStats &stats) const;
+};
+
+/** Access to the block database (blocks/index/) */
+class CBlockTreeDB : public CDBWrapper
+{
+public:
+    CBlockTreeDB(size_t nCacheSize, bool fMemory = false, bool fWipe = false);
+private:
+    CBlockTreeDB(const CBlockTreeDB&);
+    void operator=(const CBlockTreeDB&);
+public:
+    bool WriteBatchSync(const std::vector<std::pair<int, const CBlockFileInfo*> >& fileInfo, int nLastFile, const std::vector<const CBlockIndex*>& blockinfo);
+    bool EraseBatchSync(const std::vector<const CBlockIndex*>& blockinfo);
+    bool ReadBlockFileInfo(int nFile, CBlockFileInfo &info);
+    bool ReadLastBlockFile(int &nFile);
+    bool WriteReindexing(bool fReindexing);
+    bool ReadReindexing(bool &fReindexing);
+    bool ReadTxIndex(const uint256 &txid, CDiskTxPos &pos);
+    bool WriteTxIndex(const std::vector<std::pair<uint256, CDiskTxPos> > &vect);
+
+    // START insightexplorer
+    bool UpdateAddressUnspentIndex(const std::vector<CAddressUnspentDbEntry> &vect);
+    bool ReadAddressUnspentIndex(uint160 addressHash, int type, std::vector<CAddressUnspentDbEntry> &vect);
+    bool WriteAddressIndex(const std::vector<CAddressIndexDbEntry> &vect);
+    bool EraseAddressIndex(const std::vector<CAddressIndexDbEntry> &vect);
+    bool ReadAddressIndex(uint160 addressHash, int type, std::vector<CAddressIndexDbEntry> &addressIndex, int start = 0, int end = 0);
+    bool ReadSpentIndex(CSpentIndexKey &key, CSpentIndexValue &value);
+    bool UpdateSpentIndex(const std::vector<CSpentIndexDbEntry> &vect);
+    bool WriteTimestampIndex(const CTimestampIndexKey &timestampIndex);
+    bool ReadTimestampIndex(unsigned int high, unsigned int low,
+            const bool fActiveOnly, std::vector<std::pair<uint256, unsigned int> > &vect);
+    bool WriteTimestampBlockIndex(const CTimestampBlockIndexKey &blockhashIndex,
+            const CTimestampBlockIndexValue &logicalts);
+    bool ReadTimestampBlockIndex(const uint256 &hash, unsigned int &logicalTS);
+    // END insightexplorer
+
+    bool WriteFlag(const std::string &name, bool fValue);
+    bool ReadFlag(const std::string &name, bool &fValue);
+    bool LoadBlockIndexGuts(
+        std::function<CBlockIndex*(const uint256&)> insertBlockIndex,
+        const CChainParams& chainParams);
+};
+
+#endif // BITCOIN_TXDB_H
diff --git a/depend/zcash/src/txmempool.cpp b/depend/zcash/src/txmempool.cpp
new file mode 100644
index 000000000..823d476a4
--- /dev/null
+++ b/depend/zcash/src/txmempool.cpp
@@ -0,0 +1,958 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "txmempool.h"
+
+#include "clientversion.h"
+#include "consensus/consensus.h"
+#include "consensus/validation.h"
+#include "main.h"
+#include "policy/fees.h"
+#include "streams.h"
+#include "timedata.h"
+#include "util.h"
+#include "utilmoneystr.h"
+#include "validationinterface.h"
+#include "version.h"
+
+#include <optional>
+
+using namespace std;
+
+CTxMemPoolEntry::CTxMemPoolEntry():
+    nFee(0), nTxSize(0), nModSize(0), nUsageSize(0), nTime(0), dPriority(0.0),
+    hadNoDependencies(false), spendsCoinbase(false)
+{
+    nHeight = MEMPOOL_HEIGHT;
+}
+
+CTxMemPoolEntry::CTxMemPoolEntry(const CTransaction& _tx, const CAmount& _nFee,
+                                 int64_t _nTime, double _dPriority,
+                                 unsigned int _nHeight, bool poolHasNoInputsOf,
+                                 bool _spendsCoinbase, unsigned int _sigOps, uint32_t _nBranchId):
+    tx(std::make_shared<CTransaction>(_tx)), nFee(_nFee), nTime(_nTime), dPriority(_dPriority), nHeight(_nHeight),
+    hadNoDependencies(poolHasNoInputsOf),
+    spendsCoinbase(_spendsCoinbase), sigOpCount(_sigOps), nBranchId(_nBranchId)
+{
+    nTxSize = ::GetSerializeSize(_tx, SER_NETWORK, PROTOCOL_VERSION);
+    nModSize = _tx.CalculateModifiedSize(nTxSize);
+    nUsageSize = RecursiveDynamicUsage(*tx) + memusage::DynamicUsage(tx);
+    feeRate = CFeeRate(nFee, nTxSize);
+
+    feeDelta = 0;
+}
+
+CTxMemPoolEntry::CTxMemPoolEntry(const CTxMemPoolEntry& other)
+{
+    *this = other;
+}
+
+double
+CTxMemPoolEntry::GetPriority(unsigned int currentHeight) const
+{
+    CAmount nValueIn = tx->GetValueOut()+nFee;
+    double deltaPriority = ((double)(currentHeight-nHeight)*nValueIn)/nModSize;
+    double dResult = dPriority + deltaPriority;
+    return dResult;
+}
+
+void CTxMemPoolEntry::UpdateFeeDelta(int64_t newFeeDelta)
+{
+    feeDelta = newFeeDelta;
+}
+
+CTxMemPool::CTxMemPool(const CFeeRate& _minReasonableRelayFee) :
+    nTransactionsUpdated(0)
+{
+    _clear(); // unlocked clear
+
+    // Sanity checks off by default for performance, because otherwise
+    // accepting transactions becomes O(N^2) where N is the number
+    // of transactions in the pool
+    nCheckFrequency = 0;
+
+    minerPolicyEstimator = new CBlockPolicyEstimator(_minReasonableRelayFee);
+    minReasonableRelayFee = _minReasonableRelayFee;
+}
+
+CTxMemPool::~CTxMemPool()
+{
+    delete minerPolicyEstimator;
+    delete recentlyEvicted;
+    delete weightedTxTree;
+}
+
+void CTxMemPool::pruneSpent(const uint256 &hashTx, CCoins &coins)
+{
+    LOCK(cs);
+
+    std::map<COutPoint, CInPoint>::iterator it = mapNextTx.lower_bound(COutPoint(hashTx, 0));
+
+    // iterate over all COutPoints in mapNextTx whose hash equals the provided hashTx
+    while (it != mapNextTx.end() && it->first.hash == hashTx) {
+        coins.Spend(it->first.n); // and remove those outputs from coins
+        it++;
+    }
+}
+
+unsigned int CTxMemPool::GetTransactionsUpdated() const
+{
+    LOCK(cs);
+    return nTransactionsUpdated;
+}
+
+void CTxMemPool::AddTransactionsUpdated(unsigned int n)
+{
+    LOCK(cs);
+    nTransactionsUpdated += n;
+}
+
+
+bool CTxMemPool::addUnchecked(const uint256& hash, const CTxMemPoolEntry &entry, bool fCurrentEstimate)
+{
+    // Add to memory pool without checking anything.
+    // Used by main.cpp AcceptToMemoryPool(), which DOES do
+    // all the appropriate checks.
+    LOCK(cs);
+    weightedTxTree->add(WeightedTxInfo::from(entry.GetTx(), entry.GetFee()));
+    indexed_transaction_set::iterator newit = mapTx.insert(entry).first;
+
+    // Update cachedInnerUsage to include contained transaction's usage.
+    cachedInnerUsage += entry.DynamicMemoryUsage();
+
+    const CTransaction& tx = newit->GetTx();
+    mapRecentlyAddedTx[tx.GetHash()] = &tx;
+    nRecentlyAddedSequence += 1;
+    for (unsigned int i = 0; i < tx.vin.size(); i++)
+        mapNextTx[tx.vin[i].prevout] = CInPoint(&tx, i);
+    for (const JSDescription &joinsplit : tx.vJoinSplit) {
+        for (const uint256 &nf : joinsplit.nullifiers) {
+            mapSproutNullifiers[nf] = &tx;
+        }
+    }
+    for (const SpendDescription &spendDescription : tx.vShieldedSpend) {
+        mapSaplingNullifiers[spendDescription.nullifier] = &tx;
+    }
+    for (const uint256 &orchardNullifier : tx.GetOrchardBundle().GetNullifiers()) {
+        mapOrchardNullifiers[orchardNullifier] = &tx;
+    }
+
+    // Update transaction's score for any feeDelta created by PrioritiseTransaction
+    std::map<uint256, std::pair<double, CAmount> >::const_iterator pos = mapDeltas.find(hash);
+    if (pos != mapDeltas.end()) {
+        const std::pair<double, CAmount> &deltas = pos->second;
+        if (deltas.second) {
+            mapTx.modify(newit, update_fee_delta(deltas.second));
+        }
+    }
+
+    nTransactionsUpdated++;
+    totalTxSize += entry.GetTxSize();
+    minerPolicyEstimator->processTransaction(entry, fCurrentEstimate);
+
+    return true;
+}
+
+void CTxMemPool::addAddressIndex(const CTxMemPoolEntry &entry, const CCoinsViewCache &view)
+{
+    LOCK(cs);
+    const CTransaction& tx = entry.GetTx();
+    std::vector<CMempoolAddressDeltaKey> inserted;
+
+    uint256 txhash = tx.GetHash();
+    for (unsigned int j = 0; j < tx.vin.size(); j++) {
+        const CTxIn input = tx.vin[j];
+        const CTxOut &prevout = view.GetOutputFor(input);
+        CScript::ScriptType type = prevout.scriptPubKey.GetType();
+        if (type == CScript::UNKNOWN)
+            continue;
+        CMempoolAddressDeltaKey key(type, prevout.scriptPubKey.AddressHash(), txhash, j, 1);
+        CMempoolAddressDelta delta(entry.GetTime(), prevout.nValue * -1, input.prevout.hash, input.prevout.n);
+        mapAddress.insert(make_pair(key, delta));
+        inserted.push_back(key);
+    }
+
+    for (unsigned int j = 0; j < tx.vout.size(); j++) {
+        const CTxOut &out = tx.vout[j];
+        CScript::ScriptType type = out.scriptPubKey.GetType();
+        if (type == CScript::UNKNOWN)
+            continue;
+        CMempoolAddressDeltaKey key(type, out.scriptPubKey.AddressHash(), txhash, j, 0);
+        mapAddress.insert(make_pair(key, CMempoolAddressDelta(entry.GetTime(), out.nValue)));
+        inserted.push_back(key);
+    }
+
+    mapAddressInserted.insert(make_pair(txhash, inserted));
+}
+
+// START insightexplorer
+void CTxMemPool::getAddressIndex(
+    const std::vector<std::pair<uint160, int>>& addresses,
+    std::vector<std::pair<CMempoolAddressDeltaKey, CMempoolAddressDelta>>& results)
+{
+    LOCK(cs);
+    for (const auto& it : addresses) {
+        auto ait = mapAddress.lower_bound(CMempoolAddressDeltaKey(it.second, it.first));
+        while (ait != mapAddress.end() && (*ait).first.addressBytes == it.first && (*ait).first.type == it.second) {
+            results.push_back(*ait);
+            ait++;
+        }
+    }
+}
+
+void CTxMemPool::removeAddressIndex(const uint256& txhash)
+{
+    LOCK(cs);
+    auto it = mapAddressInserted.find(txhash);
+
+    if (it != mapAddressInserted.end()) {
+        std::vector<CMempoolAddressDeltaKey> keys = it->second;
+        for (const auto& mit : keys) {
+            mapAddress.erase(mit);
+        }
+        mapAddressInserted.erase(it);
+    }
+}
+
+void CTxMemPool::addSpentIndex(const CTxMemPoolEntry &entry, const CCoinsViewCache &view)
+{
+    LOCK(cs);
+    const CTransaction& tx = entry.GetTx();
+    uint256 txhash = tx.GetHash();
+    std::vector<CSpentIndexKey> inserted;
+
+    for (unsigned int j = 0; j < tx.vin.size(); j++) {
+        const CTxIn input = tx.vin[j];
+        const CTxOut &prevout = view.GetOutputFor(input);
+        CSpentIndexKey key = CSpentIndexKey(input.prevout.hash, input.prevout.n);
+        CSpentIndexValue value = CSpentIndexValue(txhash, j, -1, prevout.nValue,
+            prevout.scriptPubKey.GetType(),
+            prevout.scriptPubKey.AddressHash());
+        mapSpent.insert(make_pair(key, value));
+        inserted.push_back(key);
+    }
+    mapSpentInserted.insert(make_pair(txhash, inserted));
+}
+
+bool CTxMemPool::getSpentIndex(const CSpentIndexKey &key, CSpentIndexValue &value)
+{
+    LOCK(cs);
+    std::map<CSpentIndexKey, CSpentIndexValue, CSpentIndexKeyCompare>::iterator it = mapSpent.find(key);
+    if (it != mapSpent.end()) {
+        value = it->second;
+        return true;
+    }
+    return false;
+}
+
+void CTxMemPool::removeSpentIndex(const uint256 txhash)
+{
+    LOCK(cs);
+    auto it = mapSpentInserted.find(txhash);
+
+    if (it != mapSpentInserted.end()) {
+        std::vector<CSpentIndexKey> keys = (*it).second;
+        for (std::vector<CSpentIndexKey>::iterator mit = keys.begin(); mit != keys.end(); mit++) {
+            mapSpent.erase(*mit);
+        }
+        mapSpentInserted.erase(it);
+    }
+}
+// END insightexplorer
+
+void CTxMemPool::remove(const CTransaction &origTx, std::list<CTransaction>& removed, bool fRecursive)
+{
+    // Remove transaction from memory pool
+    {
+        LOCK(cs);
+        std::deque<uint256> txToRemove;
+        txToRemove.push_back(origTx.GetHash());
+        if (fRecursive && !mapTx.count(origTx.GetHash())) {
+            // If recursively removing but origTx isn't in the mempool
+            // be sure to remove any children that are in the pool. This can
+            // happen during chain re-orgs if origTx isn't re-accepted into
+            // the mempool for any reason.
+            for (unsigned int i = 0; i < origTx.vout.size(); i++) {
+                std::map<COutPoint, CInPoint>::iterator it = mapNextTx.find(COutPoint(origTx.GetHash(), i));
+                if (it == mapNextTx.end())
+                    continue;
+                txToRemove.push_back(it->second.ptx->GetHash());
+            }
+        }
+        while (!txToRemove.empty())
+        {
+            uint256 hash = txToRemove.front();
+            txToRemove.pop_front();
+            if (!mapTx.count(hash))
+                continue;
+            const CTransaction& tx = mapTx.find(hash)->GetTx();
+            if (fRecursive) {
+                for (unsigned int i = 0; i < tx.vout.size(); i++) {
+                    std::map<COutPoint, CInPoint>::iterator it = mapNextTx.find(COutPoint(hash, i));
+                    if (it == mapNextTx.end())
+                        continue;
+                    txToRemove.push_back(it->second.ptx->GetHash());
+                }
+            }
+            mapRecentlyAddedTx.erase(hash);
+            for (const CTxIn& txin : tx.vin)
+                mapNextTx.erase(txin.prevout);
+            for (const JSDescription& joinsplit : tx.vJoinSplit) {
+                for (const uint256& nf : joinsplit.nullifiers) {
+                    mapSproutNullifiers.erase(nf);
+                }
+            }
+            for (const SpendDescription &spendDescription : tx.vShieldedSpend) {
+                mapSaplingNullifiers.erase(spendDescription.nullifier);
+            }
+            for (const uint256 &orchardNullifier : tx.GetOrchardBundle().GetNullifiers()) {
+                mapOrchardNullifiers.erase(orchardNullifier);
+            }
+            removed.push_back(tx);
+            totalTxSize -= mapTx.find(hash)->GetTxSize();
+            cachedInnerUsage -= mapTx.find(hash)->DynamicMemoryUsage();
+            mapTx.erase(hash);
+            nTransactionsUpdated++;
+            minerPolicyEstimator->removeTx(hash);
+
+            // insightexplorer
+            if (fAddressIndex)
+                removeAddressIndex(hash);
+            if (fSpentIndex)
+                removeSpentIndex(hash);
+        }
+        for (CTransaction tx : removed) {
+            weightedTxTree->remove(tx.GetHash());
+        }
+    }
+}
+
+void CTxMemPool::removeForReorg(const CCoinsViewCache *pcoins, unsigned int nMemPoolHeight, int flags)
+{
+    // Remove transactions spending a coinbase which are now immature and no-longer-final transactions
+    LOCK(cs);
+    list<CTransaction> transactionsToRemove;
+    for (indexed_transaction_set::const_iterator it = mapTx.begin(); it != mapTx.end(); it++) {
+        const CTransaction& tx = it->GetTx();
+        if (!CheckFinalTx(tx, flags)) {
+            transactionsToRemove.push_back(tx);
+        } else if (it->GetSpendsCoinbase()) {
+            for (const CTxIn& txin : tx.vin) {
+                indexed_transaction_set::const_iterator it2 = mapTx.find(txin.prevout.hash);
+                if (it2 != mapTx.end())
+                    continue;
+                const CCoins *coins = pcoins->AccessCoins(txin.prevout.hash);
+		if (nCheckFrequency != 0) assert(coins);
+                if (!coins || (coins->IsCoinBase() && ((signed long)nMemPoolHeight) - coins->nHeight < COINBASE_MATURITY)) {
+                    transactionsToRemove.push_back(tx);
+                    break;
+                }
+            }
+        }
+    }
+    for (const CTransaction& tx : transactionsToRemove) {
+        list<CTransaction> removed;
+        remove(tx, removed, true);
+    }
+}
+
+
+void CTxMemPool::removeWithAnchor(const uint256 &invalidRoot, ShieldedType type)
+{
+    // If a block is disconnected from the tip, and the root changed,
+    // we must invalidate transactions from the mempool which spend
+    // from that root -- almost as though they were spending coinbases
+    // which are no longer valid to spend due to coinbase maturity.
+    LOCK(cs);
+    list<CTransaction> transactionsToRemove;
+
+    for (indexed_transaction_set::const_iterator it = mapTx.begin(); it != mapTx.end(); it++) {
+        const CTransaction& tx = it->GetTx();
+        switch (type) {
+            case SPROUT:
+                for (const JSDescription& joinsplit : tx.vJoinSplit) {
+                    if (joinsplit.anchor == invalidRoot) {
+                        transactionsToRemove.push_back(tx);
+                        break;
+                    }
+                }
+            break;
+            case SAPLING:
+                for (const SpendDescription& spendDescription : tx.vShieldedSpend) {
+                    if (spendDescription.anchor == invalidRoot) {
+                        transactionsToRemove.push_back(tx);
+                        break;
+                    }
+                }
+            break;
+            case ORCHARD:
+            {
+                auto anchor = tx.GetOrchardBundle().GetAnchor();
+                if (anchor == invalidRoot) {
+                    transactionsToRemove.push_back(tx);
+                }
+                break;
+            }
+            default:
+                throw runtime_error("Unknown shielded type");
+            break;
+        }
+    }
+
+    for (const CTransaction& tx : transactionsToRemove) {
+        list<CTransaction> removed;
+        remove(tx, removed, true);
+    }
+}
+
+void CTxMemPool::removeConflicts(const CTransaction &tx, std::list<CTransaction>& removed)
+{
+    // Remove transactions which depend on inputs of tx, recursively
+    list<CTransaction> result;
+    LOCK(cs);
+    for (const CTxIn &txin : tx.vin) {
+        std::map<COutPoint, CInPoint>::iterator it = mapNextTx.find(txin.prevout);
+        if (it != mapNextTx.end()) {
+            const CTransaction &txConflict = *it->second.ptx;
+            if (txConflict != tx)
+            {
+                remove(txConflict, removed, true);
+            }
+        }
+    }
+
+    for (const JSDescription &joinsplit : tx.vJoinSplit) {
+        for (const uint256 &nf : joinsplit.nullifiers) {
+            std::map<uint256, const CTransaction*>::iterator it = mapSproutNullifiers.find(nf);
+            if (it != mapSproutNullifiers.end()) {
+                const CTransaction &txConflict = *it->second;
+                if (txConflict != tx) {
+                    remove(txConflict, removed, true);
+                }
+            }
+        }
+    }
+    for (const SpendDescription &spendDescription : tx.vShieldedSpend) {
+        std::map<uint256, const CTransaction*>::iterator it = mapSaplingNullifiers.find(spendDescription.nullifier);
+        if (it != mapSaplingNullifiers.end()) {
+            const CTransaction &txConflict = *it->second;
+            if (txConflict != tx) {
+                remove(txConflict, removed, true);
+            }
+        }
+    }
+    for (const uint256 &orchardNullifier : tx.GetOrchardBundle().GetNullifiers()) {
+        std::map<uint256, const CTransaction*>::iterator it = mapOrchardNullifiers.find(orchardNullifier);
+        if (it != mapOrchardNullifiers.end()) {
+            const CTransaction &txConflict = *it->second;
+            if (txConflict != tx) {
+                remove(txConflict, removed, true);
+            }
+        }
+    }
+}
+
+std::vector<uint256> CTxMemPool::removeExpired(unsigned int nBlockHeight)
+{
+    // Remove expired txs from the mempool
+    LOCK(cs);
+    list<CTransaction> transactionsToRemove;
+    for (indexed_transaction_set::const_iterator it = mapTx.begin(); it != mapTx.end(); it++)
+    {
+        const CTransaction& tx = it->GetTx();
+        if (IsExpiredTx(tx, nBlockHeight)) {
+            transactionsToRemove.push_back(tx);
+        }
+    }
+    std::vector<uint256> ids;
+    for (const CTransaction& tx : transactionsToRemove) {
+        list<CTransaction> removed;
+        remove(tx, removed, true);
+        ids.push_back(tx.GetHash());
+        LogPrint("mempool", "Removing expired txid: %s\n", tx.GetHash().ToString());
+    }
+    return ids;
+}
+
+/**
+ * Called when a block is connected. Removes from mempool and updates the miner fee estimator.
+ */
+void CTxMemPool::removeForBlock(const std::vector<CTransaction>& vtx, unsigned int nBlockHeight,
+                                std::list<CTransaction>& conflicts, bool fCurrentEstimate)
+{
+    LOCK(cs);
+    std::vector<CTxMemPoolEntry> entries;
+    for (const CTransaction& tx : vtx)
+    {
+        uint256 hash = tx.GetHash();
+
+        indexed_transaction_set::iterator i = mapTx.find(hash);
+        if (i != mapTx.end())
+            entries.push_back(*i);
+    }
+    for (const CTransaction& tx : vtx)
+    {
+        std::list<CTransaction> dummy;
+        remove(tx, dummy, false);
+        removeConflicts(tx, conflicts);
+        ClearPrioritisation(tx.GetHash());
+    }
+    // After the txs in the new block have been removed from the mempool, update policy estimates
+    minerPolicyEstimator->processBlock(nBlockHeight, entries, fCurrentEstimate);
+}
+
+/**
+ * Called whenever the tip changes. Removes transactions which don't commit to
+ * the given branch ID from the mempool.
+ */
+void CTxMemPool::removeWithoutBranchId(uint32_t nMemPoolBranchId)
+{
+    LOCK(cs);
+    std::list<CTransaction> transactionsToRemove;
+
+    for (indexed_transaction_set::const_iterator it = mapTx.begin(); it != mapTx.end(); it++) {
+        const CTransaction& tx = it->GetTx();
+        if (it->GetValidatedBranchId() != nMemPoolBranchId) {
+            transactionsToRemove.push_back(tx);
+        }
+    }
+
+    for (const CTransaction& tx : transactionsToRemove) {
+        std::list<CTransaction> removed;
+        remove(tx, removed, true);
+    }
+}
+
+void CTxMemPool::_clear()
+{
+    mapTx.clear();
+    mapNextTx.clear();
+    totalTxSize = 0;
+    cachedInnerUsage = 0;
+    ++nTransactionsUpdated;
+}
+
+void CTxMemPool::clear()
+{
+    LOCK(cs);
+    _clear();
+}
+
+void CTxMemPool::check(const CCoinsViewCache *pcoins) const
+{
+    if (nCheckFrequency == 0)
+        return;
+
+    if (GetRand(std::numeric_limits<uint32_t>::max()) >= nCheckFrequency)
+        return;
+
+    LogPrint("mempool", "Checking mempool with %u transactions and %u inputs\n", (unsigned int)mapTx.size(), (unsigned int)mapNextTx.size());
+
+    uint64_t checkTotal = 0;
+    uint64_t innerUsage = 0;
+
+    CCoinsViewCache mempoolDuplicate(const_cast<CCoinsViewCache*>(pcoins));
+    const int64_t nSpendHeight = GetSpendHeight(mempoolDuplicate);
+
+    LOCK(cs);
+    std::list<const CTxMemPoolEntry*> waitingOnDependants;
+    for (indexed_transaction_set::const_iterator it = mapTx.begin(); it != mapTx.end(); it++) {
+        unsigned int i = 0;
+        checkTotal += it->GetTxSize();
+        innerUsage += it->DynamicMemoryUsage();
+        const CTransaction& tx = it->GetTx();
+        bool fDependsWait = false;
+        for (const CTxIn &txin : tx.vin) {
+            // Check that every mempool transaction's inputs refer to available coins, or other mempool tx's.
+            indexed_transaction_set::const_iterator it2 = mapTx.find(txin.prevout.hash);
+            if (it2 != mapTx.end()) {
+                const CTransaction& tx2 = it2->GetTx();
+                assert(tx2.vout.size() > txin.prevout.n && !tx2.vout[txin.prevout.n].IsNull());
+                fDependsWait = true;
+            } else {
+                const CCoins* coins = pcoins->AccessCoins(txin.prevout.hash);
+                assert(coins && coins->IsAvailable(txin.prevout.n));
+            }
+            // Check whether its inputs are marked in mapNextTx.
+            std::map<COutPoint, CInPoint>::const_iterator it3 = mapNextTx.find(txin.prevout);
+            assert(it3 != mapNextTx.end());
+            assert(it3->second.ptx == &tx);
+            assert(it3->second.n == i);
+            i++;
+        }
+
+        if (fDependsWait)
+            waitingOnDependants.push_back(&(*it));
+        else {
+            CValidationState state;
+            bool fCheckResult = tx.IsCoinBase() ||
+                Consensus::CheckTxInputs(tx, state, mempoolDuplicate, nSpendHeight, Params().GetConsensus());
+            fCheckResult &= Consensus::CheckTxShieldedInputs(tx, state, mempoolDuplicate, 0);
+            assert(fCheckResult);
+            UpdateCoins(tx, mempoolDuplicate, 1000000);
+        }
+    }
+    unsigned int stepsSinceLastRemove = 0;
+    while (!waitingOnDependants.empty()) {
+        const CTxMemPoolEntry* entry = waitingOnDependants.front();
+        waitingOnDependants.pop_front();
+        CValidationState state;
+        if (!mempoolDuplicate.HaveInputs(entry->GetTx())) {
+            waitingOnDependants.push_back(entry);
+            stepsSinceLastRemove++;
+            assert(stepsSinceLastRemove < waitingOnDependants.size());
+        } else {
+            bool fCheckResult = entry->GetTx().IsCoinBase() ||
+                Consensus::CheckTxInputs(entry->GetTx(), state, mempoolDuplicate, nSpendHeight, Params().GetConsensus());
+            fCheckResult &= Consensus::CheckTxShieldedInputs(entry->GetTx(), state, mempoolDuplicate, 0);
+            assert(fCheckResult);
+            UpdateCoins(entry->GetTx(), mempoolDuplicate, 1000000);
+            stepsSinceLastRemove = 0;
+        }
+    }
+    for (std::map<COutPoint, CInPoint>::const_iterator it = mapNextTx.begin(); it != mapNextTx.end(); it++) {
+        uint256 hash = it->second.ptx->GetHash();
+        indexed_transaction_set::const_iterator it2 = mapTx.find(hash);
+        const CTransaction& tx = it2->GetTx();
+        assert(it2 != mapTx.end());
+        assert(&tx == it->second.ptx);
+        assert(tx.vin.size() > it->second.n);
+        assert(it->first == it->second.ptx->vin[it->second.n].prevout);
+    }
+
+    checkNullifiers(SPROUT);
+    checkNullifiers(SAPLING);
+    checkNullifiers(ORCHARD);
+
+    assert(totalTxSize == checkTotal);
+    assert(innerUsage == cachedInnerUsage);
+}
+
+void CTxMemPool::checkNullifiers(ShieldedType type) const
+{
+    const std::map<uint256, const CTransaction*>* mapToUse;
+    switch (type) {
+        case SPROUT:
+            mapToUse = &mapSproutNullifiers;
+            break;
+        case SAPLING:
+            mapToUse = &mapSaplingNullifiers;
+            break;
+        case ORCHARD:
+            mapToUse = &mapOrchardNullifiers;
+            break;
+        default:
+            throw runtime_error("Unknown nullifier type");
+    }
+    for (const auto& entry : *mapToUse) {
+        uint256 hash = entry.second->GetHash();
+        CTxMemPool::indexed_transaction_set::const_iterator findTx = mapTx.find(hash);
+        const CTransaction& tx = findTx->GetTx();
+        assert(findTx != mapTx.end());
+        assert(&tx == entry.second);
+    }
+}
+
+bool CTxMemPool::CompareDepthAndScore(const uint256& hasha, const uint256& hashb)
+{
+    LOCK(cs);
+    indexed_transaction_set::const_iterator i = mapTx.find(hasha);
+    if (i == mapTx.end()) return false;
+    indexed_transaction_set::const_iterator j = mapTx.find(hashb);
+    if (j == mapTx.end()) return true;
+    // We don't actually compare by depth here because we haven't backported
+    // https://github.com/bitcoin/bitcoin/pull/6654
+    //
+    // But the method name is left as-is because renaming it is not worth the
+    // merge conflicts.
+    return CompareTxMemPoolEntryByScore()(*i, *j);
+}
+
+namespace {
+class DepthAndScoreComparator
+{
+public:
+    bool operator()(const CTxMemPool::indexed_transaction_set::const_iterator& a, const CTxMemPool::indexed_transaction_set::const_iterator& b)
+    {
+        // Same logic applies here as to CTxMemPool::CompareDepthAndScore().
+        // As of https://github.com/bitcoin/bitcoin/pull/8126 this comparator
+        // duplicates that function (as it doesn't need to hold a dependency
+        // on the mempool).
+        return CompareTxMemPoolEntryByScore()(*a, *b);
+    }
+};
+}
+
+std::vector<CTxMemPool::indexed_transaction_set::const_iterator> CTxMemPool::GetSortedDepthAndScore() const
+{
+    std::vector<indexed_transaction_set::const_iterator> iters;
+    AssertLockHeld(cs);
+
+    iters.reserve(mapTx.size());
+
+    for (indexed_transaction_set::iterator mi = mapTx.begin(); mi != mapTx.end(); ++mi) {
+        iters.push_back(mi);
+    }
+    std::sort(iters.begin(), iters.end(), DepthAndScoreComparator());
+    return iters;
+}
+
+void CTxMemPool::queryHashes(std::vector<uint256>& vtxid)
+{
+    LOCK(cs);
+    auto iters = GetSortedDepthAndScore();
+
+    vtxid.clear();
+    vtxid.reserve(mapTx.size());
+
+    for (auto it : iters) {
+        vtxid.push_back(it->GetTx().GetHash());
+    }
+}
+
+std::vector<TxMempoolInfo> CTxMemPool::infoAll() const
+{
+    LOCK(cs);
+    auto iters = GetSortedDepthAndScore();
+
+    std::vector<TxMempoolInfo> ret;
+    ret.reserve(mapTx.size());
+    for (auto it : iters) {
+        ret.push_back(TxMempoolInfo{it->GetSharedTx(), it->GetTime(), CFeeRate(it->GetFee(), it->GetTxSize())});
+    }
+
+    return ret;
+}
+
+std::shared_ptr<const CTransaction> CTxMemPool::get(const uint256& hash) const
+{
+    LOCK(cs);
+    indexed_transaction_set::const_iterator i = mapTx.find(hash);
+    if (i == mapTx.end())
+        return nullptr;
+    return i->GetSharedTx();
+}
+
+TxMempoolInfo CTxMemPool::info(const uint256& hash) const
+{
+    LOCK(cs);
+    indexed_transaction_set::const_iterator i = mapTx.find(hash);
+    if (i == mapTx.end())
+        return TxMempoolInfo();
+    return TxMempoolInfo{i->GetSharedTx(), i->GetTime(), CFeeRate(i->GetFee(), i->GetTxSize())};
+}
+
+CFeeRate CTxMemPool::estimateFee(int nBlocks) const
+{
+    LOCK(cs);
+    return minerPolicyEstimator->estimateFee(nBlocks);
+}
+double CTxMemPool::estimatePriority(int nBlocks) const
+{
+    LOCK(cs);
+    return minerPolicyEstimator->estimatePriority(nBlocks);
+}
+
+bool
+CTxMemPool::WriteFeeEstimates(CAutoFile& fileout) const
+{
+    try {
+        LOCK(cs);
+        fileout << 109900; // version required to read: 0.10.99 or later
+        fileout << CLIENT_VERSION; // version that wrote the file
+        minerPolicyEstimator->Write(fileout);
+    }
+    catch (const std::exception&) {
+        LogPrintf("CTxMemPool::WriteFeeEstimates(): unable to write policy estimator data (non-fatal)\n");
+        return false;
+    }
+    return true;
+}
+
+bool
+CTxMemPool::ReadFeeEstimates(CAutoFile& filein)
+{
+    try {
+        int nVersionRequired, nVersionThatWrote;
+        filein >> nVersionRequired >> nVersionThatWrote;
+        if (nVersionRequired > CLIENT_VERSION)
+            return error("CTxMemPool::ReadFeeEstimates(): up-version (%d) fee estimate file", nVersionRequired);
+
+        LOCK(cs);
+        minerPolicyEstimator->Read(filein);
+    }
+    catch (const std::exception&) {
+        LogPrintf("CTxMemPool::ReadFeeEstimates(): unable to read policy estimator data (non-fatal)\n");
+        return false;
+    }
+    return true;
+}
+
+void CTxMemPool::PrioritiseTransaction(const uint256 hash, const std::string strHash, double dPriorityDelta, const CAmount& nFeeDelta)
+{
+    {
+        LOCK(cs);
+        std::pair<double, CAmount> &deltas = mapDeltas[hash];
+        deltas.first += dPriorityDelta;
+        deltas.second += nFeeDelta;
+        txiter it = mapTx.find(hash);
+        if (it != mapTx.end()) {
+            mapTx.modify(it, update_fee_delta(deltas.second));
+        }
+    }
+    LogPrintf("PrioritiseTransaction: %s priority += %f, fee += %d\n", strHash, dPriorityDelta, FormatMoney(nFeeDelta));
+}
+
+void CTxMemPool::ApplyDeltas(const uint256 hash, double &dPriorityDelta, CAmount &nFeeDelta) const
+{
+    LOCK(cs);
+    std::map<uint256, std::pair<double, CAmount> >::const_iterator pos = mapDeltas.find(hash);
+    if (pos == mapDeltas.end())
+        return;
+    const std::pair<double, CAmount> &deltas = pos->second;
+    dPriorityDelta += deltas.first;
+    nFeeDelta += deltas.second;
+}
+
+void CTxMemPool::ClearPrioritisation(const uint256 hash)
+{
+    LOCK(cs);
+    mapDeltas.erase(hash);
+}
+
+bool CTxMemPool::HasNoInputsOf(const CTransaction &tx) const
+{
+    for (unsigned int i = 0; i < tx.vin.size(); i++)
+        if (exists(tx.vin[i].prevout.hash))
+            return false;
+    return true;
+}
+
+bool CTxMemPool::nullifierExists(const uint256& nullifier, ShieldedType type) const
+{
+    switch (type) {
+        case SPROUT:
+            return mapSproutNullifiers.count(nullifier);
+        case SAPLING:
+            return mapSaplingNullifiers.count(nullifier);
+        case ORCHARD:
+            return mapOrchardNullifiers.count(nullifier);
+        default:
+            throw runtime_error("Unknown nullifier type");
+    }
+}
+
+std::pair<std::vector<CTransaction>, uint64_t> CTxMemPool::DrainRecentlyAdded()
+{
+    uint64_t recentlyAddedSequence;
+    std::vector<CTransaction> txs;
+    {
+        LOCK(cs);
+        recentlyAddedSequence = nRecentlyAddedSequence;
+        for (const auto& kv : mapRecentlyAddedTx) {
+            txs.push_back(*(kv.second));
+        }
+        mapRecentlyAddedTx.clear();
+    }
+
+    return std::make_pair(txs, recentlyAddedSequence);
+}
+
+void CTxMemPool::SetNotifiedSequence(uint64_t recentlyAddedSequence) {
+    assert(Params().NetworkIDString() == "regtest");
+    LOCK(cs);
+    nNotifiedSequence = recentlyAddedSequence;
+}
+
+bool CTxMemPool::IsFullyNotified() {
+    assert(Params().NetworkIDString() == "regtest");
+    LOCK(cs);
+    return nRecentlyAddedSequence == nNotifiedSequence;
+}
+
+CCoinsViewMemPool::CCoinsViewMemPool(CCoinsView *baseIn, CTxMemPool &mempoolIn) : CCoinsViewBacked(baseIn), mempool(mempoolIn) { }
+
+bool CCoinsViewMemPool::GetNullifier(const uint256 &nf, ShieldedType type) const
+{
+    return mempool.nullifierExists(nf, type) || base->GetNullifier(nf, type);
+}
+
+bool CCoinsViewMemPool::GetCoins(const uint256 &txid, CCoins &coins) const {
+    // If an entry in the mempool exists, always return that one, as it's guaranteed to never
+    // conflict with the underlying cache, and it cannot have pruned entries (as it contains full)
+    // transactions. First checking the underlying cache risks returning a pruned entry instead.
+    shared_ptr<const CTransaction> ptx = mempool.get(txid);
+    if (ptx) {
+        coins = CCoins(*ptx, MEMPOOL_HEIGHT);
+        return true;
+    }
+    return (base->GetCoins(txid, coins) && !coins.IsPruned());
+}
+
+bool CCoinsViewMemPool::HaveCoins(const uint256 &txid) const {
+    return mempool.exists(txid) || base->HaveCoins(txid);
+}
+
+size_t CTxMemPool::DynamicMemoryUsage() const {
+    LOCK(cs);
+
+    size_t total = 0;
+
+    // Estimate the overhead of mapTx to be 9 pointers + an allocation, as no exact formula for
+    // boost::multi_index_contained is implemented.
+    total += memusage::MallocUsage(sizeof(CTxMemPoolEntry) + 9 * sizeof(void*)) * mapTx.size();
+
+    // Two metadata maps inherited from Bitcoin Core
+    total += memusage::DynamicUsage(mapNextTx) + memusage::DynamicUsage(mapDeltas);
+
+    // Saves iterating over the full map
+    total += cachedInnerUsage;
+
+    // Wallet notification
+    total += memusage::DynamicUsage(mapRecentlyAddedTx);
+
+    // Nullifier set tracking
+    total += memusage::DynamicUsage(mapSproutNullifiers) +
+             memusage::DynamicUsage(mapSaplingNullifiers) +
+             memusage::DynamicUsage(mapOrchardNullifiers);
+
+    // DoS mitigation
+    total += memusage::DynamicUsage(recentlyEvicted) + memusage::DynamicUsage(weightedTxTree);
+
+    // Insight-related structures
+    size_t insight = 0;
+    insight += memusage::DynamicUsage(mapAddress);
+    insight += memusage::DynamicUsage(mapAddressInserted);
+    insight += memusage::DynamicUsage(mapSpent);
+    insight += memusage::DynamicUsage(mapSpentInserted);
+    total += insight;
+
+    return total;
+}
+
+void CTxMemPool::SetMempoolCostLimit(int64_t totalCostLimit, int64_t evictionMemorySeconds) {
+    LOCK(cs);
+    LogPrint("mempool", "Setting mempool cost limit: (limit=%d, time=%d)\n", totalCostLimit, evictionMemorySeconds);
+    delete recentlyEvicted;
+    delete weightedTxTree;
+    recentlyEvicted = new RecentlyEvictedList(evictionMemorySeconds);
+    weightedTxTree = new WeightedTxTree(totalCostLimit);
+}
+
+bool CTxMemPool::IsRecentlyEvicted(const uint256& txId) {
+    LOCK(cs);
+    return recentlyEvicted->contains(txId);
+}
+
+void CTxMemPool::EnsureSizeLimit() {
+    AssertLockHeld(cs);
+    std::optional<uint256> maybeDropTxId;
+    while ((maybeDropTxId = weightedTxTree->maybeDropRandom()).has_value()) {
+        uint256 txId = maybeDropTxId.value();
+        recentlyEvicted->add(txId);
+        std::list<CTransaction> removed;
+        remove(mapTx.find(txId)->GetTx(), removed, true);
+    }
+}
diff --git a/depend/zcash/src/txmempool.h b/depend/zcash/src/txmempool.h
new file mode 100644
index 000000000..2337bff4b
--- /dev/null
+++ b/depend/zcash/src/txmempool.h
@@ -0,0 +1,391 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_TXMEMPOOL_H
+#define BITCOIN_TXMEMPOOL_H
+
+#include <list>
+#include <memory>
+
+#include "amount.h"
+#include "coins.h"
+#include "mempool_limit.h"
+#include "primitives/transaction.h"
+#include "sync.h"
+#include "random.h"
+#include "addressindex.h"
+#include "spentindex.h"
+
+#undef foreach
+#include "boost/multi_index_container.hpp"
+#include "boost/multi_index/ordered_index.hpp"
+#include "boost/multi_index/hashed_index.hpp"
+
+class CAutoFile;
+
+inline double AllowFreeThreshold()
+{
+    // 144 is the number of Bitcoin blocks per day. This has not been updated for Zcash,
+    // as it would make it harder to get shielded transactions into blocks by lowering the
+    // threshold at which we switch from priority-based selection of transactions into
+    // blocks to fee-based selection.
+    return COIN * 144 / 250;
+}
+
+inline bool AllowFree(double dPriority)
+{
+    // Large (in bytes) low-priority (new, small-coin) transactions
+    // need a fee.
+    return dPriority > AllowFreeThreshold();
+}
+
+/** Fake height value used in CCoins to signify they are only in the memory pool (since 0.8) */
+static const unsigned int MEMPOOL_HEIGHT = 0x7FFFFFFF;
+
+/**
+ * CTxMemPool stores these:
+ */
+class CTxMemPoolEntry
+{
+private:
+    std::shared_ptr<const CTransaction> tx;
+    CAmount nFee;              //!< Cached to avoid expensive parent-transaction lookups
+    size_t nTxSize;            //!< ... and avoid recomputing tx size
+    size_t nModSize;           //!< ... and modified size for priority
+    size_t nUsageSize;         //!< ... and total memory usage
+    CFeeRate feeRate;          //!< ... and fee per kB
+    int64_t nTime;             //!< Local time when entering the mempool
+    double dPriority;          //!< Priority when entering the mempool
+    unsigned int nHeight;      //!< Chain height when entering the mempool
+    bool hadNoDependencies;    //!< Not dependent on any other txs when it entered the mempool
+    bool spendsCoinbase;       //!< keep track of transactions that spend a coinbase
+    unsigned int sigOpCount;   //!< Legacy sig ops plus P2SH sig op count
+    int64_t feeDelta;          //!< Used for determining the priority of the transaction for mining in a block
+    uint32_t nBranchId;        //!< Branch ID this transaction is known to commit to, cached for efficiency
+
+public:
+    CTxMemPoolEntry(const CTransaction& _tx, const CAmount& _nFee,
+                    int64_t _nTime, double _dPriority, unsigned int _nHeight,
+                    bool poolHasNoInputsOf, bool spendsCoinbase,
+                    unsigned int nSigOps, uint32_t nBranchId);
+    CTxMemPoolEntry();
+    CTxMemPoolEntry(const CTxMemPoolEntry& other);
+
+    const CTransaction& GetTx() const { return *this->tx; }
+    std::shared_ptr<const CTransaction> GetSharedTx() const { return this->tx; }
+    double GetPriority(unsigned int currentHeight) const;
+    const CAmount& GetFee() const { return nFee; }
+    CFeeRate GetFeeRate() const { return feeRate; }
+    size_t GetTxSize() const { return nTxSize; }
+    int64_t GetTime() const { return nTime; }
+    unsigned int GetHeight() const { return nHeight; }
+    bool WasClearAtEntry() const { return hadNoDependencies; }
+    unsigned int GetSigOpCount() const { return sigOpCount; }
+    int64_t GetModifiedFee() const { return nFee + feeDelta; }
+    size_t DynamicMemoryUsage() const { return nUsageSize; }
+
+    // Updates the fee delta used for mining priority score
+    void UpdateFeeDelta(int64_t feeDelta);
+
+    bool GetSpendsCoinbase() const { return spendsCoinbase; }
+    uint32_t GetValidatedBranchId() const { return nBranchId; }
+};
+
+struct update_fee_delta
+{
+    update_fee_delta(int64_t _feeDelta) : feeDelta(_feeDelta) { }
+
+    void operator() (CTxMemPoolEntry &e) { e.UpdateFeeDelta(feeDelta); }
+
+private:
+    int64_t feeDelta;
+};
+
+// extracts a TxMemPoolEntry's transaction hash
+struct mempoolentry_txid
+{
+    typedef uint256 result_type;
+    result_type operator() (const CTxMemPoolEntry &entry) const
+    {
+        return entry.GetTx().GetHash();
+    }
+};
+
+class CompareTxMemPoolEntryByFee
+{
+public:
+    bool operator()(const CTxMemPoolEntry& a, const CTxMemPoolEntry& b) const
+    {
+        if (a.GetFeeRate() == b.GetFeeRate())
+            return a.GetTime() >= b.GetTime();
+        return a.GetFeeRate() < b.GetFeeRate();
+    }
+};
+
+/** \class CompareTxMemPoolEntryByScore
+ *
+ *  Sort by score of entry ((fee+delta)/size) in descending order
+ */
+class CompareTxMemPoolEntryByScore
+{
+public:
+    bool operator()(const CTxMemPoolEntry& a, const CTxMemPoolEntry& b) const
+    {
+        double f1 = (double)a.GetModifiedFee() * b.GetTxSize();
+        double f2 = (double)b.GetModifiedFee() * a.GetTxSize();
+        if (f1 == f2) {
+            return b.GetTx().GetHash() < a.GetTx().GetHash();
+        }
+        return f1 > f2;
+    }
+};
+
+class CBlockPolicyEstimator;
+
+/** An inpoint - a combination of a transaction and an index n into its vin */
+class CInPoint
+{
+public:
+    const CTransaction* ptx;
+    uint32_t n;
+
+    CInPoint() { SetNull(); }
+    CInPoint(const CTransaction* ptxIn, uint32_t nIn) { ptx = ptxIn; n = nIn; }
+    void SetNull() { ptx = NULL; n = (uint32_t) -1; }
+    bool IsNull() const { return (ptx == NULL && n == (uint32_t) -1); }
+    size_t DynamicMemoryUsage() const { return 0; }
+};
+
+/**
+ * Information about a mempool transaction.
+ */
+struct TxMempoolInfo
+{
+    /** The transaction itself */
+    std::shared_ptr<const CTransaction> tx;
+
+    /** Time the transaction entered the mempool. */
+    int64_t nTime;
+
+    /** Feerate of the transaction. */
+    CFeeRate feeRate;
+};
+
+/**
+ * CTxMemPool stores valid-according-to-the-current-best-chain
+ * transactions that may be included in the next block.
+ *
+ * Transactions are added when they are seen on the network
+ * (or created by the local node), but not all transactions seen
+ * are added to the pool: if a new transaction double-spends
+ * an input of a transaction in the pool, it is dropped,
+ * as are non-standard transactions.
+ *
+ * CTxMemPool::mapTx, and CTxMemPoolEntry bookkeeping:
+ *
+ * mapTx is a boost::multi_index that sorts the mempool on 3 criteria:
+ * - transaction hash
+ * - feerate
+ * - mining score (feerate modified by any fee deltas from PrioritiseTransaction)
+ *
+ */
+class CTxMemPool
+{
+private:
+    uint32_t nCheckFrequency; //!< Value n means that n times in 2^32 we check.
+    unsigned int nTransactionsUpdated;
+    CBlockPolicyEstimator* minerPolicyEstimator;
+
+    uint64_t totalTxSize = 0;  //!< sum of all mempool tx' byte sizes
+    uint64_t cachedInnerUsage; //!< sum of dynamic memory usage of all the map elements (NOT the maps themselves)
+
+    std::map<uint256, const CTransaction*> mapRecentlyAddedTx;
+    uint64_t nRecentlyAddedSequence = 0;
+    uint64_t nNotifiedSequence = 0;
+
+    std::map<uint256, const CTransaction*> mapSproutNullifiers;
+    std::map<uint256, const CTransaction*> mapSaplingNullifiers;
+    std::map<uint256, const CTransaction*> mapOrchardNullifiers;
+    RecentlyEvictedList* recentlyEvicted = new RecentlyEvictedList(DEFAULT_MEMPOOL_EVICTION_MEMORY_MINUTES * 60);
+    WeightedTxTree* weightedTxTree = new WeightedTxTree(DEFAULT_MEMPOOL_TOTAL_COST_LIMIT);
+
+    void checkNullifiers(ShieldedType type) const;
+
+    CFeeRate minReasonableRelayFee;
+
+public:
+    typedef boost::multi_index_container<
+        CTxMemPoolEntry,
+        boost::multi_index::indexed_by<
+            // sorted by txid
+            boost::multi_index::hashed_unique<mempoolentry_txid, SaltedTxidHasher>,
+            // sorted by fee rate
+            boost::multi_index::ordered_non_unique<
+                boost::multi_index::identity<CTxMemPoolEntry>,
+                CompareTxMemPoolEntryByFee
+            >,
+            // sorted by score (for mining prioritization)
+            boost::multi_index::ordered_unique<
+                boost::multi_index::identity<CTxMemPoolEntry>,
+                CompareTxMemPoolEntryByScore
+            >
+        >
+    > indexed_transaction_set;
+
+    mutable CCriticalSection cs;
+    indexed_transaction_set mapTx;
+    typedef indexed_transaction_set::nth_index<0>::type::iterator txiter;
+
+private:
+    // insightexplorer
+    std::map<CMempoolAddressDeltaKey, CMempoolAddressDelta, CMempoolAddressDeltaKeyCompare> mapAddress;
+    std::map<uint256, std::vector<CMempoolAddressDeltaKey> > mapAddressInserted;
+    std::map<CSpentIndexKey, CSpentIndexValue, CSpentIndexKeyCompare> mapSpent;
+    std::map<uint256, std::vector<CSpentIndexKey>> mapSpentInserted;
+
+    std::vector<indexed_transaction_set::const_iterator> GetSortedDepthAndScore() const;
+
+public:
+    std::map<COutPoint, CInPoint> mapNextTx;
+    std::map<uint256, std::pair<double, CAmount> > mapDeltas;
+
+    /** Create a new CTxMemPool.
+     *  minReasonableRelayFee should be a feerate which is, roughly, somewhere
+     *  around what it "costs" to relay a transaction around the network and
+     *  below which we would reasonably say a transaction has 0-effective-fee.
+     */
+    CTxMemPool(const CFeeRate& _minReasonableRelayFee);
+    ~CTxMemPool();
+
+    /**
+     * If sanity-checking is turned on, check makes sure the pool is
+     * consistent (does not contain two transactions that spend the same inputs,
+     * all inputs are in the mapNextTx array). If sanity-checking is turned off,
+     * check does nothing.
+     */
+    void check(const CCoinsViewCache *pcoins) const;
+    void setSanityCheck(double dFrequency = 1.0) { nCheckFrequency = static_cast<uint32_t>(dFrequency * 4294967295.0); }
+
+    bool addUnchecked(const uint256& hash, const CTxMemPoolEntry &entry, bool fCurrentEstimate = true);
+
+    // START insightexplorer
+    void addAddressIndex(const CTxMemPoolEntry &entry, const CCoinsViewCache &view);
+    void getAddressIndex(const std::vector<std::pair<uint160, int>>& addresses,
+                         std::vector<std::pair<CMempoolAddressDeltaKey, CMempoolAddressDelta>>& results);
+    void removeAddressIndex(const uint256& txhash);
+
+    void addSpentIndex(const CTxMemPoolEntry &entry, const CCoinsViewCache &view);
+    bool getSpentIndex(const CSpentIndexKey &key, CSpentIndexValue &value);
+    void removeSpentIndex(const uint256 txhash);
+    // END insightexplorer
+
+    void remove(const CTransaction &tx, std::list<CTransaction>& removed, bool fRecursive = false);
+    void removeWithAnchor(const uint256 &invalidRoot, ShieldedType type);
+    void removeForReorg(const CCoinsViewCache *pcoins, unsigned int nMemPoolHeight, int flags);
+    void removeConflicts(const CTransaction &tx, std::list<CTransaction>& removed);
+    std::vector<uint256> removeExpired(unsigned int nBlockHeight);
+    void removeForBlock(const std::vector<CTransaction>& vtx, unsigned int nBlockHeight,
+                        std::list<CTransaction>& conflicts, bool fCurrentEstimate = true);
+    void removeWithoutBranchId(uint32_t nMemPoolBranchId);
+    void clear();
+    void _clear(); // unlocked
+    bool CompareDepthAndScore(const uint256& hasha, const uint256& hashb);
+    void queryHashes(std::vector<uint256>& vtxid);
+    void pruneSpent(const uint256& hash, CCoins &coins);
+    unsigned int GetTransactionsUpdated() const;
+    void AddTransactionsUpdated(unsigned int n);
+    /**
+     * Check that none of this transactions inputs are in the mempool, and thus
+     * the tx is not dependent on other mempool transactions to be included in a block.
+     */
+    bool HasNoInputsOf(const CTransaction& tx) const;
+
+    /** Affect CreateNewBlock prioritisation of transactions */
+    void PrioritiseTransaction(const uint256 hash, const std::string strHash, double dPriorityDelta, const CAmount& nFeeDelta);
+    void ApplyDeltas(const uint256 hash, double &dPriorityDelta, CAmount &nFeeDelta) const;
+    void ClearPrioritisation(const uint256 hash);
+
+    bool nullifierExists(const uint256& nullifier, ShieldedType type) const;
+
+    std::pair<std::vector<CTransaction>, uint64_t> DrainRecentlyAdded();
+    void SetNotifiedSequence(uint64_t recentlyAddedSequence);
+    bool IsFullyNotified();
+
+    unsigned long size()
+    {
+        LOCK(cs);
+        return mapTx.size();
+    }
+
+    uint64_t GetTotalTxSize()
+    {
+        LOCK(cs);
+        return totalTxSize;
+    }
+
+    bool exists(uint256 hash) const
+    {
+        LOCK(cs);
+        return (mapTx.count(hash) != 0);
+    }
+
+    std::shared_ptr<const CTransaction> get(const uint256& hash) const;
+    TxMempoolInfo info(const uint256& hash) const;
+    std::vector<TxMempoolInfo> infoAll() const;
+
+    /** Estimate fee rate needed to get into the next nBlocks */
+    CFeeRate estimateFee(int nBlocks) const;
+
+    /** Estimate priority needed to get into the next nBlocks */
+    double estimatePriority(int nBlocks) const;
+
+    /** Write/Read estimates to disk */
+    bool WriteFeeEstimates(CAutoFile& fileout) const;
+    bool ReadFeeEstimates(CAutoFile& filein);
+
+    size_t DynamicMemoryUsage() const;
+
+    /** Return nCheckFrequency */
+    uint32_t GetCheckFrequency() const {
+        return nCheckFrequency;
+    }
+
+    void SetMempoolCostLimit(int64_t totalCostLimit, int64_t evictionMemorySeconds);
+    // Returns true if a transaction has been recently evicted
+    bool IsRecentlyEvicted(const uint256& txId);
+    // If the mempool size limit is exceeded, this evicts transactions from the mempool until it is below capacity
+    void EnsureSizeLimit();
+};
+
+/**
+ * CCoinsView that brings transactions from a memorypool into view.
+ * It does not check for spendings by memory pool transactions.
+ */
+class CCoinsViewMemPool : public CCoinsViewBacked
+{
+protected:
+    CTxMemPool &mempool;
+
+public:
+    CCoinsViewMemPool(CCoinsView *baseIn, CTxMemPool &mempoolIn);
+    bool GetNullifier(const uint256 &txid, ShieldedType type) const;
+    bool GetCoins(const uint256 &txid, CCoins &coins) const;
+    bool HaveCoins(const uint256 &txid) const;
+};
+
+// We want to sort transactions by coin age priority
+typedef std::pair<double, CTxMemPool::txiter> TxCoinAgePriority;
+
+struct TxCoinAgePriorityCompare
+{
+    bool operator()(const TxCoinAgePriority& a, const TxCoinAgePriority& b)
+    {
+        if (a.first == b.first)
+            return CompareTxMemPoolEntryByScore()(*(b.second), *(a.second)); //Reverse order to make sort less than
+        return a.first < b.first;
+    }
+};
+
+#endif // BITCOIN_TXMEMPOOL_H
diff --git a/depend/zcash/src/ui_interface.h b/depend/zcash/src/ui_interface.h
new file mode 100644
index 000000000..b94a65fa8
--- /dev/null
+++ b/depend/zcash/src/ui_interface.h
@@ -0,0 +1,115 @@
+// Copyright (c) 2010 Satoshi Nakamoto
+// Copyright (c) 2012 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_UI_INTERFACE_H
+#define BITCOIN_UI_INTERFACE_H
+
+#include <stdint.h>
+#include <string>
+
+#include <boost/signals2/last_value.hpp>
+#include <boost/signals2/signal.hpp>
+
+class CBasicKeyStore;
+class CWallet;
+class uint256;
+class CBlockIndex;
+
+/** General change type (added, updated, removed). */
+enum ChangeType
+{
+    CT_NEW,
+    CT_UPDATED,
+    CT_DELETED
+};
+
+/** Signals for UI communication. */
+class CClientUIInterface
+{
+public:
+    /** Flags for CClientUIInterface::ThreadSafeMessageBox */
+    enum MessageBoxFlags
+    {
+        ICON_INFORMATION    = 0,
+        ICON_WARNING        = (1U << 0),
+        ICON_ERROR          = (1U << 1),
+        /**
+         * Mask of all available icons in CClientUIInterface::MessageBoxFlags
+         * This needs to be updated, when icons are changed there!
+         */
+        ICON_MASK = (ICON_INFORMATION | ICON_WARNING | ICON_ERROR),
+
+        /** These values are taken from qmessagebox.h "enum StandardButton" to be directly usable */
+        BTN_OK      = 0x00000400U, // QMessageBox::Ok
+        BTN_YES     = 0x00004000U, // QMessageBox::Yes
+        BTN_NO      = 0x00010000U, // QMessageBox::No
+        BTN_ABORT   = 0x00040000U, // QMessageBox::Abort
+        BTN_RETRY   = 0x00080000U, // QMessageBox::Retry
+        BTN_IGNORE  = 0x00100000U, // QMessageBox::Ignore
+        BTN_CLOSE   = 0x00200000U, // QMessageBox::Close
+        BTN_CANCEL  = 0x00400000U, // QMessageBox::Cancel
+        BTN_DISCARD = 0x00800000U, // QMessageBox::Discard
+        BTN_HELP    = 0x01000000U, // QMessageBox::Help
+        BTN_APPLY   = 0x02000000U, // QMessageBox::Apply
+        BTN_RESET   = 0x04000000U, // QMessageBox::Reset
+        /**
+         * Mask of all available buttons in CClientUIInterface::MessageBoxFlags
+         * This needs to be updated, when buttons are changed there!
+         */
+        BTN_MASK = (BTN_OK | BTN_YES | BTN_NO | BTN_ABORT | BTN_RETRY | BTN_IGNORE |
+                    BTN_CLOSE | BTN_CANCEL | BTN_DISCARD | BTN_HELP | BTN_APPLY | BTN_RESET),
+
+        /** Force blocking, modal message box dialog (not just OS notification) */
+        MODAL               = 0x10000000U,
+
+        /** Do not print contents of message to debug log */
+        SECURE              = 0x40000000U,
+
+        /** Predefined combinations for certain default usage cases */
+        MSG_INFORMATION = ICON_INFORMATION,
+        MSG_WARNING = (ICON_WARNING | BTN_OK | MODAL),
+        MSG_ERROR = (ICON_ERROR | BTN_OK | MODAL)
+    };
+
+    /** Show message box. */
+    boost::signals2::signal<bool (const std::string& message, const std::string& caption, unsigned int style), boost::signals2::last_value<bool> > ThreadSafeMessageBox;
+
+    /** If possible, ask the user a question. If not, falls back to ThreadSafeMessageBox(noninteractive_message, caption, style) and returns false. */
+    boost::signals2::signal<bool (const std::string& message, const std::string& noninteractive_message, const std::string& caption, unsigned int style), boost::signals2::last_value<bool> > ThreadSafeQuestion;
+
+    /** Progress message during initialization. */
+    boost::signals2::signal<void (const std::string &message)> InitMessage;
+
+    /** Number of network connections changed. */
+    boost::signals2::signal<void (int newNumConnections)> NotifyNumConnectionsChanged;
+
+    /**
+     * New, updated or cancelled alert.
+     * @note called with lock cs_mapAlerts held.
+     */
+    boost::signals2::signal<void (const uint256 &hash, ChangeType status)> NotifyAlertChanged;
+
+    /** A wallet has been loaded. */
+    boost::signals2::signal<void (CWallet* wallet)> LoadWallet;
+
+    /** Show progress e.g. for verifychain */
+    boost::signals2::signal<void (const std::string &title, int nProgress)> ShowProgress;
+
+    /** New block has been accepted */
+    boost::signals2::signal<void (bool, const CBlockIndex *)> NotifyBlockTip;
+
+    /** Best header has changed */
+    boost::signals2::signal<void (bool, const CBlockIndex *)> NotifyHeaderTip;
+
+    /** Banlist did change. */
+    boost::signals2::signal<void (void)> BannedListChanged;
+
+    /** Transaction expired */
+    boost::signals2::signal<void (const uint256& txid)> NotifyTxExpiration;
+};
+
+extern CClientUIInterface uiInterface;
+
+#endif // BITCOIN_UI_INTERFACE_H
diff --git a/depend/zcash/src/uint252.h b/depend/zcash/src/uint252.h
new file mode 100644
index 000000000..381f6f42e
--- /dev/null
+++ b/depend/zcash/src/uint252.h
@@ -0,0 +1,50 @@
+#ifndef ZCASH_UINT252_H
+#define ZCASH_UINT252_H
+
+#include <vector>
+#include "uint256.h"
+#include "serialize.h"
+
+// Wrapper of uint256 with guarantee that first
+// four bits are zero.
+class uint252 {
+private:
+    uint256 contents;
+
+public:
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(contents);
+
+        if ((*contents.begin()) & 0xF0) {
+            throw std::ios_base::failure("spending key has invalid leading bits");
+        }
+    }
+
+    const unsigned char* begin() const
+    {
+        return contents.begin();
+    }
+
+    const unsigned char* end() const
+    {
+        return contents.end();
+    }
+
+    uint252() : contents() {};
+    explicit uint252(const uint256& in) : contents(in) {
+        if (*contents.begin() & 0xF0) {
+            throw std::domain_error("leading bits are set in argument given to uint252 constructor");
+        }
+    }
+
+    uint256 inner() const {
+        return contents;
+    }
+
+    friend inline bool operator==(const uint252& a, const uint252& b) { return a.contents == b.contents; }
+};
+
+#endif // ZCASH_UINT252_H
diff --git a/depend/zcash/src/uint256.cpp b/depend/zcash/src/uint256.cpp
new file mode 100644
index 000000000..1e9558ac8
--- /dev/null
+++ b/depend/zcash/src/uint256.cpp
@@ -0,0 +1,86 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "uint256.h"
+
+#include "utilstrencodings.h"
+
+#include <stdio.h>
+#include <string.h>
+
+template <unsigned int BITS>
+base_blob<BITS>::base_blob(const std::vector<unsigned char>& vch)
+{
+    assert(vch.size() == sizeof(data));
+    memcpy(data, &vch[0], sizeof(data));
+}
+
+template <unsigned int BITS>
+std::string base_blob<BITS>::GetHex() const
+{
+    return HexStr(std::reverse_iterator<const uint8_t*>(data + sizeof(data)), std::reverse_iterator<const uint8_t*>(data));
+}
+
+template <unsigned int BITS>
+void base_blob<BITS>::SetHex(const char* psz)
+{
+    memset(data, 0, sizeof(data));
+
+    // skip leading spaces
+    while (isspace(*psz))
+        psz++;
+
+    // skip 0x
+    if (psz[0] == '0' && tolower(psz[1]) == 'x')
+        psz += 2;
+
+    // hex string to uint
+    const char* pbegin = psz;
+    while (::HexDigit(*psz) != -1)
+        psz++;
+    psz--;
+    unsigned char* p1 = (unsigned char*)data;
+    unsigned char* pend = p1 + WIDTH;
+    while (psz >= pbegin && p1 < pend) {
+        *p1 = ::HexDigit(*psz--);
+        if (psz >= pbegin) {
+            *p1 |= ((unsigned char)::HexDigit(*psz--) << 4);
+            p1++;
+        }
+    }
+}
+
+template <unsigned int BITS>
+void base_blob<BITS>::SetHex(const std::string& str)
+{
+    SetHex(str.c_str());
+}
+
+template <unsigned int BITS>
+std::string base_blob<BITS>::ToString() const
+{
+    return (GetHex());
+}
+
+// Explicit instantiations for base_blob<88>
+template base_blob<88>::base_blob(const std::vector<unsigned char>&);
+template std::string base_blob<88>::GetHex() const;
+template std::string base_blob<88>::ToString() const;
+template void base_blob<88>::SetHex(const char*);
+template void base_blob<88>::SetHex(const std::string&);
+
+// Explicit instantiations for base_blob<160>
+template base_blob<160>::base_blob(const std::vector<unsigned char>&);
+template std::string base_blob<160>::GetHex() const;
+template std::string base_blob<160>::ToString() const;
+template void base_blob<160>::SetHex(const char*);
+template void base_blob<160>::SetHex(const std::string&);
+
+// Explicit instantiations for base_blob<256>
+template base_blob<256>::base_blob(const std::vector<unsigned char>&);
+template std::string base_blob<256>::GetHex() const;
+template std::string base_blob<256>::ToString() const;
+template void base_blob<256>::SetHex(const char*);
+template void base_blob<256>::SetHex(const std::string&);
diff --git a/depend/zcash/src/uint256.h b/depend/zcash/src/uint256.h
new file mode 100644
index 000000000..cf150f2c5
--- /dev/null
+++ b/depend/zcash/src/uint256.h
@@ -0,0 +1,164 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_UINT256_H
+#define BITCOIN_UINT256_H
+
+#include <assert.h>
+#include <cstring>
+#include <stdexcept>
+#include <stdint.h>
+#include <string>
+#include <vector>
+
+/** Template base class for fixed-sized opaque blobs. */
+template<unsigned int BITS>
+class base_blob
+{
+protected:
+    enum { WIDTH=BITS/8 };
+    alignas(uint32_t) uint8_t data[WIDTH];
+public:
+    base_blob()
+    {
+        memset(data, 0, sizeof(data));
+    }
+
+    explicit base_blob(const std::vector<unsigned char>& vch);
+
+    bool IsNull() const
+    {
+        for (int i = 0; i < WIDTH; i++)
+            if (data[i] != 0)
+                return false;
+        return true;
+    }
+
+    void SetNull()
+    {
+        memset(data, 0, sizeof(data));
+    }
+
+    friend inline bool operator==(const base_blob& a, const base_blob& b) { return memcmp(a.data, b.data, sizeof(a.data)) == 0; }
+    friend inline bool operator!=(const base_blob& a, const base_blob& b) { return memcmp(a.data, b.data, sizeof(a.data)) != 0; }
+    friend inline bool operator<(const base_blob& a, const base_blob& b) { return memcmp(a.data, b.data, sizeof(a.data)) < 0; }
+
+    std::string GetHex() const;
+    void SetHex(const char* psz);
+    void SetHex(const std::string& str);
+    std::string ToString() const;
+
+    unsigned char* begin()
+    {
+        return &data[0];
+    }
+
+    unsigned char* end()
+    {
+        return &data[WIDTH];
+    }
+
+    const unsigned char* begin() const
+    {
+        return &data[0];
+    }
+
+    const unsigned char* end() const
+    {
+        return &data[WIDTH];
+    }
+
+    unsigned int size() const
+    {
+        return sizeof(data);
+    }
+
+    uint64_t GetUint64(int pos) const
+    {
+        const uint8_t* ptr = data + pos * 8;
+        return ((uint64_t)ptr[0]) | \
+               ((uint64_t)ptr[1]) << 8 | \
+               ((uint64_t)ptr[2]) << 16 | \
+               ((uint64_t)ptr[3]) << 24 | \
+               ((uint64_t)ptr[4]) << 32 | \
+               ((uint64_t)ptr[5]) << 40 | \
+               ((uint64_t)ptr[6]) << 48 | \
+               ((uint64_t)ptr[7]) << 56;
+    }
+
+    template<typename Stream>
+    void Serialize(Stream& s) const
+    {
+        s.write((char*)data, sizeof(data));
+    }
+
+    template<typename Stream>
+    void Unserialize(Stream& s)
+    {
+        s.read((char*)data, sizeof(data));
+    }
+};
+
+/** 160-bit opaque blob.
+ * @note This type is called uint160 for historical reasons only. It is an opaque
+ * blob of 160 bits and has no integer operations.
+ */
+class uint160 : public base_blob<160> {
+public:
+    uint160() {}
+    explicit uint160(const std::vector<unsigned char>& vch) : base_blob<160>(vch) {}
+};
+
+/** 256-bit opaque blob.
+ * @note This type is called uint256 for historical reasons only. It is an
+ * opaque blob of 256 bits and has no integer operations. Use arith_uint256 if
+ * those are required.
+ */
+class uint256 : public base_blob<256> {
+public:
+    uint256() {}
+    explicit uint256(const std::vector<unsigned char>& vch) : base_blob<256>(vch) {}
+
+    /** A cheap hash function that just returns 64 bits from the result, it can be
+     * used when the contents are considered uniformly random. It is not appropriate
+     * when the value can easily be influenced from outside as e.g. a network adversary could
+     * provide values to trigger worst-case behavior.
+     * @note The result of this function is not stable between little and big endian.
+     */
+    uint64_t GetCheapHash() const
+    {
+        uint64_t result;
+        memcpy((void*)&result, (void*)data, 8);
+        return result;
+    }
+};
+
+/* uint256 from const char *.
+ * This is a separate function because the constructor uint256(const char*) can result
+ * in dangerously catching uint256(0).
+ */
+inline uint256 uint256S(const char *str)
+{
+    uint256 rv;
+    rv.SetHex(str);
+    return rv;
+}
+/* uint256 from std::string.
+ * This is a separate function because the constructor uint256(const std::string &str) can result
+ * in dangerously catching uint256(0) via std::string(const char*).
+ */
+inline uint256 uint256S(const std::string& str)
+{
+    uint256 rv;
+    rv.SetHex(str);
+    return rv;
+}
+
+// Defined here so we have access to it in both primitives/transaction.h and protocol.h.
+/* The placeholder value used for the auth digest of pre-v5 transactions. */
+static const uint256 LEGACY_TX_AUTH_DIGEST =
+    uint256S("0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff");
+
+#endif // BITCOIN_UINT256_H
diff --git a/depend/zcash/src/undo.h b/depend/zcash/src/undo.h
new file mode 100644
index 000000000..6bf96a79f
--- /dev/null
+++ b/depend/zcash/src/undo.h
@@ -0,0 +1,81 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_UNDO_H
+#define BITCOIN_UNDO_H
+
+#include "compressor.h" 
+#include "primitives/transaction.h"
+#include "serialize.h"
+
+/** Undo information for a CTxIn
+ *
+ *  Contains the prevout's CTxOut being spent, and if this was the
+ *  last output of the affected transaction, its metadata as well
+ *  (coinbase or not, height, transaction version)
+ */
+class CTxInUndo
+{
+public:
+    CTxOut txout;         // the txout data before being spent
+    bool fCoinBase;       // if the outpoint was the last unspent: whether it belonged to a coinbase
+    unsigned int nHeight; // if the outpoint was the last unspent: its height
+    int nVersion;         // if the outpoint was the last unspent: its version
+
+    CTxInUndo() : txout(), fCoinBase(false), nHeight(0), nVersion(0) {}
+    CTxInUndo(const CTxOut &txoutIn, bool fCoinBaseIn = false, unsigned int nHeightIn = 0, int nVersionIn = 0) : txout(txoutIn), fCoinBase(fCoinBaseIn), nHeight(nHeightIn), nVersion(nVersionIn) { }
+
+    template<typename Stream>
+    void Serialize(Stream &s) const {
+        ::Serialize(s, VARINT(nHeight*2+(fCoinBase ? 1 : 0)));
+        if (nHeight > 0)
+            ::Serialize(s, VARINT(this->nVersion));
+        ::Serialize(s, CTxOutCompressor(REF(txout)));
+    }
+
+    template<typename Stream>
+    void Unserialize(Stream &s) {
+        unsigned int nCode = 0;
+        ::Unserialize(s, VARINT(nCode));
+        nHeight = nCode / 2;
+        fCoinBase = nCode & 1;
+        if (nHeight > 0)
+            ::Unserialize(s, VARINT(this->nVersion));
+        ::Unserialize(s, REF(CTxOutCompressor(REF(txout))));
+    }
+};
+
+/** Undo information for a CTransaction */
+class CTxUndo
+{
+public:
+    // undo information for all txins
+    std::vector<CTxInUndo> vprevout;
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(vprevout);
+    }
+};
+
+/** Undo information for a CBlock */
+class CBlockUndo
+{
+public:
+    std::vector<CTxUndo> vtxundo; // for all but the coinbase
+    uint256 old_sprout_tree_root;
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(vtxundo);
+        READWRITE(old_sprout_tree_root);
+    }
+};
+
+#endif // BITCOIN_UNDO_H
diff --git a/depend/zcash/src/univalue/.gitignore b/depend/zcash/src/univalue/.gitignore
new file mode 100644
index 000000000..19e42f814
--- /dev/null
+++ b/depend/zcash/src/univalue/.gitignore
@@ -0,0 +1,32 @@
+.deps/
+INSTALL
+Makefile
+Makefile.in
+aclocal.m4
+autom4te.cache/
+compile
+config.log
+config.status
+config.guess
+config.sub
+configure
+depcomp
+install-sh
+missing
+stamp-h1
+univalue-config.h*
+test-driver
+libtool
+ltmain.sh
+test-suite.log
+
+*.a
+*.la
+*.lo
+*.logs
+*.o
+*.pc
+*.trs
+
+.dirstamp
+.libs
diff --git a/depend/zcash/src/univalue/.travis.yml b/depend/zcash/src/univalue/.travis.yml
new file mode 100644
index 000000000..43a1ed362
--- /dev/null
+++ b/depend/zcash/src/univalue/.travis.yml
@@ -0,0 +1,51 @@
+language: cpp
+
+compiler:
+  - clang
+  - gcc
+
+os:
+  - linux
+  - osx
+
+sudo: false
+
+env:
+  global:
+    - MAKEJOBS=-j3
+    - RUN_TESTS=true
+    - BASE_OUTDIR=$TRAVIS_BUILD_DIR/out
+
+cache:
+  apt: true
+
+addons:
+  apt:
+    packages:
+      - pkg-config
+
+before_script:
+  - if [ -n "$USE_SHELL" ]; then export CONFIG_SHELL="$USE_SHELL"; fi
+  - test -n "$USE_SHELL" && eval '"$USE_SHELL" -c "./autogen.sh"' || ./autogen.sh
+
+script:
+  - if [ -n "$UNIVALUE_CONFIG" ]; then unset CC; unset CXX; fi
+  - OUTDIR=$BASE_OUTDIR/$TRAVIS_PULL_REQUEST/$TRAVIS_JOB_NUMBER-$HOST
+  - UNIVALUE_CONFIG_ALL="--prefix=$TRAVIS_BUILD_DIR/depends/$HOST --bindir=$OUTDIR/bin --libdir=$OUTDIR/lib"
+  - ./configure --cache-file=config.cache $UNIVALUE_CONFIG_ALL $UNIVALUE_CONFIG || ( cat config.log && false)
+  - make -s $MAKEJOBS $GOAL || ( echo "Build failure. Verbose build follows." && make $GOAL ; false )
+  - export LD_LIBRARY_PATH=$TRAVIS_BUILD_DIR/depends/$HOST/lib
+  - if [ "$RUN_TESTS" = "true" ]; then make $MAKEJOBS distcheck; fi
+
+matrix:
+  fast_finish: true
+  include:
+    - os: linux
+      compiler: gcc
+      env: UNIVALUE_CONFIG=--host=x86_64-w64-mingw32 RUN_TESTS=false
+      addons:
+        apt:
+          packages:
+            - g++-mingw-w64-x86-64
+            - gcc-mingw-w64-x86-64
+            - binutils-mingw-w64-x86-64
diff --git a/depend/zcash/src/univalue/COPYING b/depend/zcash/src/univalue/COPYING
new file mode 100644
index 000000000..1fb429f35
--- /dev/null
+++ b/depend/zcash/src/univalue/COPYING
@@ -0,0 +1,19 @@
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+
diff --git a/depend/zcash/src/univalue/Makefile.am b/depend/zcash/src/univalue/Makefile.am
new file mode 100644
index 000000000..49c4e7c6f
--- /dev/null
+++ b/depend/zcash/src/univalue/Makefile.am
@@ -0,0 +1,118 @@
+ACLOCAL_AMFLAGS = -I build-aux/m4
+.PHONY: gen
+.INTERMEDIATE: $(GENBIN)
+
+include_HEADERS = include/univalue.h
+noinst_HEADERS = lib/univalue_escapes.h lib/univalue_utffilter.h
+
+lib_LTLIBRARIES = libunivalue.la
+
+pkgconfigdir = $(libdir)/pkgconfig
+pkgconfig_DATA = pc/libunivalue.pc
+
+libunivalue_la_SOURCES = \
+	lib/univalue.cpp \
+	lib/univalue_get.cpp \
+	lib/univalue_read.cpp \
+	lib/univalue_write.cpp
+
+libunivalue_la_LDFLAGS = \
+	-version-info $(LIBUNIVALUE_CURRENT):$(LIBUNIVALUE_REVISION):$(LIBUNIVALUE_AGE) \
+	-no-undefined
+libunivalue_la_CXXFLAGS = -I$(top_srcdir)/include
+
+TESTS = test/object test/unitester test/no_nul
+
+GENBIN = gen/gen$(BUILD_EXEEXT)
+GEN_SRCS = gen/gen.cpp
+
+$(GENBIN): $(GEN_SRCS)
+	@echo Building $@
+	$(AM_V_at)c++ -I$(top_srcdir)/include -o $@ $<
+
+gen: lib/univalue_escapes.h $(GENBIN)
+	@echo Updating $<
+	$(AM_V_at)$(GENBIN) > lib/univalue_escapes.h
+
+noinst_PROGRAMS = $(TESTS) test/test_json
+
+TEST_DATA_DIR=test
+
+test_unitester_SOURCES = test/unitester.cpp
+test_unitester_LDADD = libunivalue.la
+test_unitester_CXXFLAGS = -I$(top_srcdir)/include -DJSON_TEST_SRC=\"$(srcdir)/$(TEST_DATA_DIR)\"
+test_unitester_LDFLAGS = -static $(LIBTOOL_APP_LDFLAGS) -lpthread
+
+test_test_json_SOURCES = test/test_json.cpp
+test_test_json_LDADD = libunivalue.la
+test_test_json_CXXFLAGS = -I$(top_srcdir)/include
+test_test_json_LDFLAGS = -static $(LIBTOOL_APP_LDFLAGS) -lpthread
+
+test_no_nul_SOURCES = test/no_nul.cpp
+test_no_nul_LDADD = libunivalue.la
+test_no_nul_CXXFLAGS = -I$(top_srcdir)/include
+test_no_nul_LDFLAGS = -static $(LIBTOOL_APP_LDFLAGS) -lpthread
+
+test_object_SOURCES = test/object.cpp
+test_object_LDADD = libunivalue.la
+test_object_CXXFLAGS = -I$(top_srcdir)/include
+test_object_LDFLAGS = -static $(LIBTOOL_APP_LDFLAGS) -lpthread
+
+TEST_FILES = \
+	$(TEST_DATA_DIR)/fail10.json \
+	$(TEST_DATA_DIR)/fail11.json \
+	$(TEST_DATA_DIR)/fail12.json \
+	$(TEST_DATA_DIR)/fail13.json \
+	$(TEST_DATA_DIR)/fail14.json \
+	$(TEST_DATA_DIR)/fail15.json \
+	$(TEST_DATA_DIR)/fail16.json \
+	$(TEST_DATA_DIR)/fail17.json \
+	$(TEST_DATA_DIR)/fail18.json \
+	$(TEST_DATA_DIR)/fail19.json \
+	$(TEST_DATA_DIR)/fail1.json \
+	$(TEST_DATA_DIR)/fail20.json \
+	$(TEST_DATA_DIR)/fail21.json \
+	$(TEST_DATA_DIR)/fail22.json \
+	$(TEST_DATA_DIR)/fail23.json \
+	$(TEST_DATA_DIR)/fail24.json \
+	$(TEST_DATA_DIR)/fail25.json \
+	$(TEST_DATA_DIR)/fail26.json \
+	$(TEST_DATA_DIR)/fail27.json \
+	$(TEST_DATA_DIR)/fail28.json \
+	$(TEST_DATA_DIR)/fail29.json \
+	$(TEST_DATA_DIR)/fail2.json \
+	$(TEST_DATA_DIR)/fail30.json \
+	$(TEST_DATA_DIR)/fail31.json \
+	$(TEST_DATA_DIR)/fail32.json \
+	$(TEST_DATA_DIR)/fail33.json \
+	$(TEST_DATA_DIR)/fail34.json \
+	$(TEST_DATA_DIR)/fail35.json \
+	$(TEST_DATA_DIR)/fail36.json \
+	$(TEST_DATA_DIR)/fail37.json \
+	$(TEST_DATA_DIR)/fail38.json \
+	$(TEST_DATA_DIR)/fail39.json \
+	$(TEST_DATA_DIR)/fail40.json \
+	$(TEST_DATA_DIR)/fail41.json \
+	$(TEST_DATA_DIR)/fail42.json \
+	$(TEST_DATA_DIR)/fail44.json \
+	$(TEST_DATA_DIR)/fail45.json \
+	$(TEST_DATA_DIR)/fail3.json \
+	$(TEST_DATA_DIR)/fail4.json \
+	$(TEST_DATA_DIR)/fail5.json \
+	$(TEST_DATA_DIR)/fail6.json \
+	$(TEST_DATA_DIR)/fail7.json \
+	$(TEST_DATA_DIR)/fail8.json \
+	$(TEST_DATA_DIR)/fail9.json \
+	$(TEST_DATA_DIR)/pass1.json \
+	$(TEST_DATA_DIR)/pass2.json \
+	$(TEST_DATA_DIR)/pass3.json \
+	$(TEST_DATA_DIR)/pass4.json \
+	$(TEST_DATA_DIR)/round1.json \
+	$(TEST_DATA_DIR)/round2.json \
+	$(TEST_DATA_DIR)/round3.json \
+	$(TEST_DATA_DIR)/round4.json \
+	$(TEST_DATA_DIR)/round5.json \
+	$(TEST_DATA_DIR)/round6.json \
+	$(TEST_DATA_DIR)/round7.json
+
+EXTRA_DIST=$(TEST_FILES) $(GEN_SRCS)
diff --git a/depend/zcash/src/univalue/README.md b/depend/zcash/src/univalue/README.md
new file mode 100644
index 000000000..7c62c3397
--- /dev/null
+++ b/depend/zcash/src/univalue/README.md
@@ -0,0 +1,21 @@
+
+# UniValue
+
+## Summary
+
+A universal value class, with JSON encoding and decoding.
+
+UniValue is an abstract data type that may be a null, boolean, string,
+number, array container, or a key/value dictionary container, nested to
+an arbitrary depth.
+
+This class is aligned with the JSON standard, [RFC
+7159](https://tools.ietf.org/html/rfc7159.html).
+
+## Library usage
+
+This is a fork of univalue used by Bitcoin Core. It is not maintained for usage
+by other projects. Notably, the API may break in non-backward-compatible ways.
+
+Other projects looking for a maintained library should use the upstream
+univalue at https://github.com/jgarzik/univalue.
diff --git a/depend/zcash/src/univalue/TODO b/depend/zcash/src/univalue/TODO
new file mode 100644
index 000000000..5530048e9
--- /dev/null
+++ b/depend/zcash/src/univalue/TODO
@@ -0,0 +1,10 @@
+
+Rearrange tree for easier 'git subtree' style use
+
+Move towards C++11 etc.
+
+Namespace support - must come up with useful shorthand, avoiding
+long Univalue::Univalue::Univalue usages forced upon library users.
+
+Improve test suite
+
diff --git a/depend/zcash/src/univalue/autogen.sh b/depend/zcash/src/univalue/autogen.sh
new file mode 100755
index 000000000..4b38721fa
--- /dev/null
+++ b/depend/zcash/src/univalue/autogen.sh
@@ -0,0 +1,9 @@
+#!/bin/sh
+set -e
+srcdir="$(dirname $0)"
+cd "$srcdir"
+if [ -z ${LIBTOOLIZE} ] && GLIBTOOLIZE="`which glibtoolize 2>/dev/null`"; then
+  LIBTOOLIZE="${GLIBTOOLIZE}"
+  export LIBTOOLIZE
+fi
+autoreconf --install --force
diff --git a/depend/zcash/src/univalue/build-aux/m4/.gitignore b/depend/zcash/src/univalue/build-aux/m4/.gitignore
new file mode 100644
index 000000000..f06368652
--- /dev/null
+++ b/depend/zcash/src/univalue/build-aux/m4/.gitignore
@@ -0,0 +1 @@
+/*.m4
diff --git a/depend/zcash/src/univalue/configure.ac b/depend/zcash/src/univalue/configure.ac
new file mode 100644
index 000000000..39cd00621
--- /dev/null
+++ b/depend/zcash/src/univalue/configure.ac
@@ -0,0 +1,69 @@
+m4_define([libunivalue_major_version], [1])
+m4_define([libunivalue_minor_version], [1])
+m4_define([libunivalue_micro_version], [3])
+m4_define([libunivalue_interface_age], [3])
+# If you need a modifier for the version number. 
+# Normally empty, but can be used to make "fixup" releases.
+m4_define([libunivalue_extraversion], [])
+
+dnl libtool versioning from libunivalue
+m4_define([libunivalue_current], [m4_eval(100 * libunivalue_minor_version + libunivalue_micro_version - libunivalue_interface_age)])
+m4_define([libunivalue_binary_age], [m4_eval(100 * libunivalue_minor_version + libunivalue_micro_version)])
+m4_define([libunivalue_revision], [libunivalue_interface_age])
+m4_define([libunivalue_age], [m4_eval(libunivalue_binary_age - libunivalue_interface_age)])
+m4_define([libunivalue_version], [libunivalue_major_version().libunivalue_minor_version().libunivalue_micro_version()libunivalue_extraversion()])
+
+
+AC_INIT([univalue], [1.0.3],
+        [https://github.com/jgarzik/univalue/])
+
+dnl make the compilation flags quiet unless V=1 is used
+m4_ifdef([AM_SILENT_RULES], [AM_SILENT_RULES([yes])])
+
+AC_PREREQ(2.60)
+AC_CONFIG_SRCDIR([lib/univalue.cpp])
+AC_CONFIG_AUX_DIR([build-aux])
+AC_CONFIG_MACRO_DIR([build-aux/m4])
+AC_CONFIG_HEADERS([univalue-config.h])
+AM_INIT_AUTOMAKE([subdir-objects foreign])
+
+LIBUNIVALUE_MAJOR_VERSION=libunivalue_major_version
+LIBUNIVALUE_MINOR_VERSION=libunivalue_minor_version
+LIBUNIVALUE_MICRO_VERSION=libunivalue_micro_version
+LIBUNIVALUE_INTERFACE_AGE=libunivalue_interface_age
+
+# ABI version
+# https://www.gnu.org/software/libtool/manual/html_node/Updating-version-info.html
+LIBUNIVALUE_CURRENT=libunivalue_current
+LIBUNIVALUE_REVISION=libunivalue_revision
+LIBUNIVALUE_AGE=libunivalue_age
+
+AC_SUBST(LIBUNIVALUE_CURRENT)
+AC_SUBST(LIBUNIVALUE_REVISION)
+AC_SUBST(LIBUNIVALUE_AGE)
+
+LT_INIT
+LT_LANG([C++])
+
+case $host in
+  *mingw*)
+    LIBTOOL_APP_LDFLAGS="$LIBTOOL_APP_LDFLAGS -all-static"
+  ;;
+esac
+
+BUILD_EXEEXT=
+case $build in
+  *mingw*)
+    BUILD_EXEEXT=".exe"
+  ;;
+esac
+
+AC_CONFIG_FILES([
+    Makefile
+    pc/libunivalue.pc
+    pc/libunivalue-uninstalled.pc])
+
+AC_SUBST(LIBTOOL_APP_LDFLAGS)
+AC_SUBST(BUILD_EXEEXT)
+AC_OUTPUT
+
diff --git a/depend/zcash/src/univalue/gen/gen.cpp b/depend/zcash/src/univalue/gen/gen.cpp
new file mode 100644
index 000000000..be3d4ccf7
--- /dev/null
+++ b/depend/zcash/src/univalue/gen/gen.cpp
@@ -0,0 +1,82 @@
+// Copyright 2014 BitPay Inc.
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://opensource.org/licenses/mit-license.php.
+
+//
+// To re-create univalue_escapes.h:
+// $ g++ -o gen gen.cpp
+// $ ./gen > univalue_escapes.h
+//
+
+#include <stdio.h>
+#include <string.h>
+#include "univalue.h"
+
+static bool initEscapes;
+static std::string escapes[256];
+
+static void initJsonEscape()
+{
+    // Escape all lower control characters (some get overridden with smaller sequences below)
+    for (int ch=0x00; ch<0x20; ++ch) {
+        char tmpbuf[20];
+        snprintf(tmpbuf, sizeof(tmpbuf), "\\u%04x", ch);
+        escapes[ch] = std::string(tmpbuf);
+    }
+
+    escapes[(int)'"'] = "\\\"";
+    escapes[(int)'\\'] = "\\\\";
+    escapes[(int)'\b'] = "\\b";
+    escapes[(int)'\f'] = "\\f";
+    escapes[(int)'\n'] = "\\n";
+    escapes[(int)'\r'] = "\\r";
+    escapes[(int)'\t'] = "\\t";
+    escapes[(int)'\x7f'] = "\\u007f"; // U+007F DELETE
+
+    initEscapes = true;
+}
+
+static void outputEscape()
+{
+	printf(	"// Automatically generated file. Do not modify.\n"
+		"#ifndef BITCOIN_UNIVALUE_UNIVALUE_ESCAPES_H\n"
+		"#define BITCOIN_UNIVALUE_UNIVALUE_ESCAPES_H\n"
+		"static const char *escapes[256] = {\n");
+
+	for (unsigned int i = 0; i < 256; i++) {
+		if (escapes[i].empty()) {
+			printf("\tNULL,\n");
+		} else {
+			printf("\t\"");
+
+			unsigned int si;
+			for (si = 0; si < escapes[i].size(); si++) {
+				char ch = escapes[i][si];
+				switch (ch) {
+				case '"':
+					printf("\\\"");
+					break;
+				case '\\':
+					printf("\\\\");
+					break;
+				default:
+					printf("%c", escapes[i][si]);
+					break;
+				}
+			}
+
+			printf("\",\n");
+		}
+	}
+
+	printf(	"};\n"
+		"#endif // BITCOIN_UNIVALUE_UNIVALUE_ESCAPES_H\n");
+}
+
+int main (int argc, char *argv[])
+{
+	initJsonEscape();
+	outputEscape();
+	return 0;
+}
+
diff --git a/depend/zcash/src/univalue/include/univalue.h b/depend/zcash/src/univalue/include/univalue.h
new file mode 100644
index 000000000..ff81e26a4
--- /dev/null
+++ b/depend/zcash/src/univalue/include/univalue.h
@@ -0,0 +1,242 @@
+// Copyright 2014 BitPay Inc.
+// Copyright 2015 Bitcoin Core Developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://opensource.org/licenses/mit-license.php.
+
+#ifndef UNIVALUE_H__
+#define UNIVALUE_H__
+
+#include <stdint.h>
+#include <string.h>
+
+#include <string>
+#include <vector>
+#include <map>
+#include <cassert>
+
+#include <sstream>        // .get_int64()
+
+class UniValue {
+public:
+    enum VType { VNULL, VOBJ, VARR, VSTR, VNUM, VBOOL, };
+
+    UniValue() { typ = VNULL; }
+    UniValue(UniValue::VType initialType, const std::string& initialStr = "") {
+        typ = initialType;
+        val = initialStr;
+    }
+    UniValue(uint64_t val_) {
+        setInt(val_);
+    }
+    UniValue(int64_t val_) {
+        setInt(val_);
+    }
+    UniValue(bool val_) {
+        setBool(val_);
+    }
+    UniValue(int val_) {
+        setInt(val_);
+    }
+    UniValue(double val_) {
+        setFloat(val_);
+    }
+    UniValue(const std::string& val_) {
+        setStr(val_);
+    }
+    UniValue(const char *val_) {
+        std::string s(val_);
+        setStr(s);
+    }
+
+    void clear();
+
+    bool setNull();
+    bool setBool(bool val);
+    bool setNumStr(const std::string& val);
+    bool setInt(uint64_t val);
+    bool setInt(int64_t val);
+    bool setInt(int val_) { return setInt((int64_t)val_); }
+    bool setFloat(double val);
+    bool setStr(const std::string& val);
+    bool setArray();
+    bool setObject();
+
+    enum VType getType() const { return typ; }
+    const std::string& getValStr() const { return val; }
+    bool empty() const { return (values.size() == 0); }
+
+    size_t size() const { return values.size(); }
+
+    bool getBool() const { return isTrue(); }
+    void getObjMap(std::map<std::string,UniValue>& kv) const;
+    bool checkObject(const std::map<std::string,UniValue::VType>& memberTypes) const;
+    const UniValue& operator[](const std::string& key) const;
+    const UniValue& operator[](size_t index) const;
+    bool exists(const std::string& key) const { size_t i; return findKey(key, i); }
+
+    bool isNull() const { return (typ == VNULL); }
+    bool isTrue() const { return (typ == VBOOL) && (val == "1"); }
+    bool isFalse() const { return (typ == VBOOL) && (val != "1"); }
+    bool isBool() const { return (typ == VBOOL); }
+    bool isStr() const { return (typ == VSTR); }
+    bool isNum() const { return (typ == VNUM); }
+    bool isArray() const { return (typ == VARR); }
+    bool isObject() const { return (typ == VOBJ); }
+
+    bool push_back(const UniValue& val);
+    bool push_back(const std::string& val_) {
+        UniValue tmpVal(VSTR, val_);
+        return push_back(tmpVal);
+    }
+    bool push_back(const char *val_) {
+        std::string s(val_);
+        return push_back(s);
+    }
+    bool push_back(uint64_t val_) {
+        UniValue tmpVal(val_);
+        return push_back(tmpVal);
+    }
+    bool push_back(int64_t val_) {
+        UniValue tmpVal(val_);
+        return push_back(tmpVal);
+    }
+    bool push_back(bool val_) {
+        UniValue tmpVal(val_);
+        return push_back(tmpVal);
+    }
+    bool push_back(int val_) {
+        UniValue tmpVal(val_);
+        return push_back(tmpVal);
+    }
+    bool push_back(double val_) {
+        UniValue tmpVal(val_);
+        return push_back(tmpVal);
+    }
+    bool push_backV(const std::vector<UniValue>& vec);
+
+    void _pushKV(const std::string& key, const UniValue& val);
+    bool pushKV(const std::string& key, const UniValue& val);
+    bool pushKV(const std::string& key, const std::string& val_) {
+        UniValue tmpVal(VSTR, val_);
+        return pushKV(key, tmpVal);
+    }
+    bool pushKV(const std::string& key, const char *val_) {
+        std::string _val(val_);
+        return pushKV(key, _val);
+    }
+    bool pushKV(const std::string& key, int64_t val_) {
+        UniValue tmpVal(val_);
+        return pushKV(key, tmpVal);
+    }
+    bool pushKV(const std::string& key, uint64_t val_) {
+        UniValue tmpVal(val_);
+        return pushKV(key, tmpVal);
+    }
+    bool pushKV(const std::string& key, bool val_) {
+        UniValue tmpVal(val_);
+        return pushKV(key, tmpVal);
+    }
+    bool pushKV(const std::string& key, int val_) {
+        UniValue tmpVal((int64_t)val_);
+        return pushKV(key, tmpVal);
+    }
+    bool pushKV(const std::string& key, double val_) {
+        UniValue tmpVal(val_);
+        return pushKV(key, tmpVal);
+    }
+    bool pushKVs(const UniValue& obj);
+
+    std::string write(unsigned int prettyIndent = 0,
+                      unsigned int indentLevel = 0) const;
+
+    bool read(const char *raw, size_t len);
+    bool read(const char *raw) { return read(raw, strlen(raw)); }
+    bool read(const std::string& rawStr) {
+        return read(rawStr.data(), rawStr.size());
+    }
+
+private:
+    UniValue::VType typ;
+    std::string val;                       // numbers are stored as C++ strings
+    std::vector<std::string> keys;
+    std::vector<UniValue> values;
+
+    bool findKey(const std::string& key, size_t& retIdx) const;
+    void writeArray(unsigned int prettyIndent, unsigned int indentLevel, std::string& s) const;
+    void writeObject(unsigned int prettyIndent, unsigned int indentLevel, std::string& s) const;
+
+public:
+    // Strict type-specific getters, these throw std::runtime_error if the
+    // value is of unexpected type
+    const std::vector<std::string>& getKeys() const;
+    const std::vector<UniValue>& getValues() const;
+    bool get_bool() const;
+    const std::string& get_str() const;
+    int get_int() const;
+    int64_t get_int64() const;
+    double get_real() const;
+    const UniValue& get_obj() const;
+    const UniValue& get_array() const;
+
+    enum VType type() const { return getType(); }
+    friend const UniValue& find_value( const UniValue& obj, const std::string& name);
+};
+
+enum jtokentype {
+    JTOK_ERR        = -1,
+    JTOK_NONE       = 0,                           // eof
+    JTOK_OBJ_OPEN,
+    JTOK_OBJ_CLOSE,
+    JTOK_ARR_OPEN,
+    JTOK_ARR_CLOSE,
+    JTOK_COLON,
+    JTOK_COMMA,
+    JTOK_KW_NULL,
+    JTOK_KW_TRUE,
+    JTOK_KW_FALSE,
+    JTOK_NUMBER,
+    JTOK_STRING,
+};
+
+extern enum jtokentype getJsonToken(std::string& tokenVal,
+                                    unsigned int& consumed, const char *raw, const char *end);
+extern const char *uvTypeName(UniValue::VType t);
+
+static inline bool jsonTokenIsValue(enum jtokentype jtt)
+{
+    switch (jtt) {
+    case JTOK_KW_NULL:
+    case JTOK_KW_TRUE:
+    case JTOK_KW_FALSE:
+    case JTOK_NUMBER:
+    case JTOK_STRING:
+        return true;
+
+    default:
+        return false;
+    }
+
+    // not reached
+}
+
+static inline bool json_isspace(int ch)
+{
+    switch (ch) {
+    case 0x20:
+    case 0x09:
+    case 0x0a:
+    case 0x0d:
+        return true;
+
+    default:
+        return false;
+    }
+
+    // not reached
+}
+
+extern const UniValue NullUniValue;
+
+const UniValue& find_value( const UniValue& obj, const std::string& name);
+
+#endif // UNIVALUE_H__
diff --git a/depend/zcash/src/univalue/lib/.gitignore b/depend/zcash/src/univalue/lib/.gitignore
new file mode 100644
index 000000000..ee7fc2851
--- /dev/null
+++ b/depend/zcash/src/univalue/lib/.gitignore
@@ -0,0 +1,2 @@
+gen
+.libs
diff --git a/depend/zcash/src/univalue/lib/univalue.cpp b/depend/zcash/src/univalue/lib/univalue.cpp
new file mode 100644
index 000000000..4607fcbb0
--- /dev/null
+++ b/depend/zcash/src/univalue/lib/univalue.cpp
@@ -0,0 +1,242 @@
+// Copyright 2014 BitPay Inc.
+// Copyright 2015 Bitcoin Core Developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://opensource.org/licenses/mit-license.php.
+
+#include <stdint.h>
+#include <iomanip>
+#include <sstream>
+#include <stdlib.h>
+
+#include "univalue.h"
+
+const UniValue NullUniValue;
+
+void UniValue::clear()
+{
+    typ = VNULL;
+    val.clear();
+    keys.clear();
+    values.clear();
+}
+
+bool UniValue::setNull()
+{
+    clear();
+    return true;
+}
+
+bool UniValue::setBool(bool val_)
+{
+    clear();
+    typ = VBOOL;
+    if (val_)
+        val = "1";
+    return true;
+}
+
+static bool validNumStr(const std::string& s)
+{
+    std::string tokenVal;
+    unsigned int consumed;
+    enum jtokentype tt = getJsonToken(tokenVal, consumed, s.data(), s.data() + s.size());
+    return (tt == JTOK_NUMBER);
+}
+
+bool UniValue::setNumStr(const std::string& val_)
+{
+    if (!validNumStr(val_))
+        return false;
+
+    clear();
+    typ = VNUM;
+    val = val_;
+    return true;
+}
+
+bool UniValue::setInt(uint64_t val_)
+{
+    std::ostringstream oss;
+
+    oss << val_;
+
+    return setNumStr(oss.str());
+}
+
+bool UniValue::setInt(int64_t val_)
+{
+    std::ostringstream oss;
+
+    oss << val_;
+
+    return setNumStr(oss.str());
+}
+
+bool UniValue::setFloat(double val_)
+{
+    std::ostringstream oss;
+
+    oss << std::setprecision(16) << val_;
+
+    bool ret = setNumStr(oss.str());
+    typ = VNUM;
+    return ret;
+}
+
+bool UniValue::setStr(const std::string& val_)
+{
+    clear();
+    typ = VSTR;
+    val = val_;
+    return true;
+}
+
+bool UniValue::setArray()
+{
+    clear();
+    typ = VARR;
+    return true;
+}
+
+bool UniValue::setObject()
+{
+    clear();
+    typ = VOBJ;
+    return true;
+}
+
+bool UniValue::push_back(const UniValue& val_)
+{
+    if (typ != VARR)
+        return false;
+
+    values.push_back(val_);
+    return true;
+}
+
+bool UniValue::push_backV(const std::vector<UniValue>& vec)
+{
+    if (typ != VARR)
+        return false;
+
+    values.insert(values.end(), vec.begin(), vec.end());
+
+    return true;
+}
+
+void UniValue::_pushKV(const std::string& key, const UniValue& val_)
+{
+    keys.push_back(key);
+    values.push_back(val_);
+}
+
+bool UniValue::pushKV(const std::string& key, const UniValue& val_)
+{
+    if (typ != VOBJ)
+        return false;
+
+    size_t idx;
+    if (findKey(key, idx))
+        values[idx] = val_;
+    else
+        _pushKV(key, val_);
+    return true;
+}
+
+bool UniValue::pushKVs(const UniValue& obj)
+{
+    if (typ != VOBJ || obj.typ != VOBJ)
+        return false;
+
+    for (size_t i = 0; i < obj.keys.size(); i++)
+        _pushKV(obj.keys[i], obj.values.at(i));
+
+    return true;
+}
+
+void UniValue::getObjMap(std::map<std::string,UniValue>& kv) const
+{
+    if (typ != VOBJ)
+        return;
+
+    kv.clear();
+    for (size_t i = 0; i < keys.size(); i++)
+        kv[keys[i]] = values[i];
+}
+
+bool UniValue::findKey(const std::string& key, size_t& retIdx) const
+{
+    for (size_t i = 0; i < keys.size(); i++) {
+        if (keys[i] == key) {
+            retIdx = i;
+            return true;
+        }
+    }
+
+    return false;
+}
+
+bool UniValue::checkObject(const std::map<std::string,UniValue::VType>& t) const
+{
+    if (typ != VOBJ)
+        return false;
+
+    for (std::map<std::string,UniValue::VType>::const_iterator it = t.begin();
+         it != t.end(); ++it) {
+        size_t idx = 0;
+        if (!findKey(it->first, idx))
+            return false;
+
+        if (values.at(idx).getType() != it->second)
+            return false;
+    }
+
+    return true;
+}
+
+const UniValue& UniValue::operator[](const std::string& key) const
+{
+    if (typ != VOBJ)
+        return NullUniValue;
+
+    size_t index = 0;
+    if (!findKey(key, index))
+        return NullUniValue;
+
+    return values.at(index);
+}
+
+const UniValue& UniValue::operator[](size_t index) const
+{
+    if (typ != VOBJ && typ != VARR)
+        return NullUniValue;
+    if (index >= values.size())
+        return NullUniValue;
+
+    return values.at(index);
+}
+
+const char *uvTypeName(UniValue::VType t)
+{
+    switch (t) {
+    case UniValue::VNULL: return "null";
+    case UniValue::VBOOL: return "bool";
+    case UniValue::VOBJ: return "object";
+    case UniValue::VARR: return "array";
+    case UniValue::VSTR: return "string";
+    case UniValue::VNUM: return "number";
+    }
+
+    // not reached
+    return NULL;
+}
+
+const UniValue& find_value(const UniValue& obj, const std::string& name)
+{
+    for (unsigned int i = 0; i < obj.keys.size(); i++)
+        if (obj.keys[i] == name)
+            return obj.values.at(i);
+
+    return NullUniValue;
+}
+
diff --git a/depend/zcash/src/univalue/lib/univalue_escapes.h b/depend/zcash/src/univalue/lib/univalue_escapes.h
new file mode 100644
index 000000000..74596aab6
--- /dev/null
+++ b/depend/zcash/src/univalue/lib/univalue_escapes.h
@@ -0,0 +1,262 @@
+// Automatically generated file. Do not modify.
+#ifndef BITCOIN_UNIVALUE_UNIVALUE_ESCAPES_H
+#define BITCOIN_UNIVALUE_UNIVALUE_ESCAPES_H
+static const char *escapes[256] = {
+	"\\u0000",
+	"\\u0001",
+	"\\u0002",
+	"\\u0003",
+	"\\u0004",
+	"\\u0005",
+	"\\u0006",
+	"\\u0007",
+	"\\b",
+	"\\t",
+	"\\n",
+	"\\u000b",
+	"\\f",
+	"\\r",
+	"\\u000e",
+	"\\u000f",
+	"\\u0010",
+	"\\u0011",
+	"\\u0012",
+	"\\u0013",
+	"\\u0014",
+	"\\u0015",
+	"\\u0016",
+	"\\u0017",
+	"\\u0018",
+	"\\u0019",
+	"\\u001a",
+	"\\u001b",
+	"\\u001c",
+	"\\u001d",
+	"\\u001e",
+	"\\u001f",
+	NULL,
+	NULL,
+	"\\\"",
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	"\\\\",
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	"\\u007f",
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+	NULL,
+};
+#endif // BITCOIN_UNIVALUE_UNIVALUE_ESCAPES_H
diff --git a/depend/zcash/src/univalue/lib/univalue_get.cpp b/depend/zcash/src/univalue/lib/univalue_get.cpp
new file mode 100644
index 000000000..293a49487
--- /dev/null
+++ b/depend/zcash/src/univalue/lib/univalue_get.cpp
@@ -0,0 +1,147 @@
+// Copyright 2014 BitPay Inc.
+// Copyright 2015 Bitcoin Core Developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://opensource.org/licenses/mit-license.php.
+
+#include <stdint.h>
+#include <errno.h>
+#include <string.h>
+#include <stdlib.h>
+#include <stdexcept>
+#include <vector>
+#include <limits>
+#include <string>
+
+#include "univalue.h"
+
+namespace
+{
+static bool ParsePrechecks(const std::string& str)
+{
+    if (str.empty()) // No empty string allowed
+        return false;
+    if (str.size() >= 1 && (json_isspace(str[0]) || json_isspace(str[str.size()-1]))) // No padding allowed
+        return false;
+    if (str.size() != strlen(str.c_str())) // No embedded NUL characters allowed
+        return false;
+    return true;
+}
+
+bool ParseInt32(const std::string& str, int32_t *out)
+{
+    if (!ParsePrechecks(str))
+        return false;
+    char *endp = NULL;
+    errno = 0; // strtol will not set errno if valid
+    long int n = strtol(str.c_str(), &endp, 10);
+    if(out) *out = (int32_t)n;
+    // Note that strtol returns a *long int*, so even if strtol doesn't report an over/underflow
+    // we still have to check that the returned value is within the range of an *int32_t*. On 64-bit
+    // platforms the size of these types may be different.
+    return endp && *endp == 0 && !errno &&
+        n >= std::numeric_limits<int32_t>::min() &&
+        n <= std::numeric_limits<int32_t>::max();
+}
+
+bool ParseInt64(const std::string& str, int64_t *out)
+{
+    if (!ParsePrechecks(str))
+        return false;
+    char *endp = NULL;
+    errno = 0; // strtoll will not set errno if valid
+    long long int n = strtoll(str.c_str(), &endp, 10);
+    if(out) *out = (int64_t)n;
+    // Note that strtoll returns a *long long int*, so even if strtol doesn't report a over/underflow
+    // we still have to check that the returned value is within the range of an *int64_t*.
+    return endp && *endp == 0 && !errno &&
+        n >= std::numeric_limits<int64_t>::min() &&
+        n <= std::numeric_limits<int64_t>::max();
+}
+
+bool ParseDouble(const std::string& str, double *out)
+{
+    if (!ParsePrechecks(str))
+        return false;
+    if (str.size() >= 2 && str[0] == '0' && str[1] == 'x') // No hexadecimal floats allowed
+        return false;
+    std::istringstream text(str);
+    text.imbue(std::locale::classic());
+    double result;
+    text >> result;
+    if(out) *out = result;
+    return text.eof() && !text.fail();
+}
+}
+
+const std::vector<std::string>& UniValue::getKeys() const
+{
+    if (typ != VOBJ)
+        throw std::runtime_error("JSON value is not an object as expected");
+    return keys;
+}
+
+const std::vector<UniValue>& UniValue::getValues() const
+{
+    if (typ != VOBJ && typ != VARR)
+        throw std::runtime_error("JSON value is not an object or array as expected");
+    return values;
+}
+
+bool UniValue::get_bool() const
+{
+    if (typ != VBOOL)
+        throw std::runtime_error("JSON value is not a boolean as expected");
+    return getBool();
+}
+
+const std::string& UniValue::get_str() const
+{
+    if (typ != VSTR)
+        throw std::runtime_error("JSON value is not a string as expected");
+    return getValStr();
+}
+
+int UniValue::get_int() const
+{
+    if (typ != VNUM)
+        throw std::runtime_error("JSON value is not an integer as expected");
+    int32_t retval;
+    if (!ParseInt32(getValStr(), &retval))
+        throw std::runtime_error("JSON integer out of range");
+    return retval;
+}
+
+int64_t UniValue::get_int64() const
+{
+    if (typ != VNUM)
+        throw std::runtime_error("JSON value is not an integer as expected");
+    int64_t retval;
+    if (!ParseInt64(getValStr(), &retval))
+        throw std::runtime_error("JSON integer out of range");
+    return retval;
+}
+
+double UniValue::get_real() const
+{
+    if (typ != VNUM)
+        throw std::runtime_error("JSON value is not a number as expected");
+    double retval;
+    if (!ParseDouble(getValStr(), &retval))
+        throw std::runtime_error("JSON double out of range");
+    return retval;
+}
+
+const UniValue& UniValue::get_obj() const
+{
+    if (typ != VOBJ)
+        throw std::runtime_error("JSON value is not an object as expected");
+    return *this;
+}
+
+const UniValue& UniValue::get_array() const
+{
+    if (typ != VARR)
+        throw std::runtime_error("JSON value is not an array as expected");
+    return *this;
+}
+
diff --git a/depend/zcash/src/univalue/lib/univalue_read.cpp b/depend/zcash/src/univalue/lib/univalue_read.cpp
new file mode 100644
index 000000000..f8a5d4d76
--- /dev/null
+++ b/depend/zcash/src/univalue/lib/univalue_read.cpp
@@ -0,0 +1,460 @@
+// Copyright 2014 BitPay Inc.
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://opensource.org/licenses/mit-license.php.
+
+#include <string.h>
+#include <vector>
+#include <stdio.h>
+#include "univalue.h"
+#include "univalue_utffilter.h"
+
+/*
+ * According to stackexchange, the original json test suite wanted
+ * to limit depth to 22.  Widely-deployed PHP bails at depth 512,
+ * so we will follow PHP's lead, which should be more than sufficient
+ * (further stackexchange comments indicate depth > 32 rarely occurs).
+ */
+static const size_t MAX_JSON_DEPTH = 512;
+
+static bool json_isdigit(int ch)
+{
+    return ((ch >= '0') && (ch <= '9'));
+}
+
+// convert hexadecimal string to unsigned integer
+static const char *hatoui(const char *first, const char *last,
+                          unsigned int& out)
+{
+    unsigned int result = 0;
+    for (; first != last; ++first)
+    {
+        int digit;
+        if (json_isdigit(*first))
+            digit = *first - '0';
+
+        else if (*first >= 'a' && *first <= 'f')
+            digit = *first - 'a' + 10;
+
+        else if (*first >= 'A' && *first <= 'F')
+            digit = *first - 'A' + 10;
+
+        else
+            break;
+
+        result = 16 * result + digit;
+    }
+    out = result;
+
+    return first;
+}
+
+enum jtokentype getJsonToken(std::string& tokenVal, unsigned int& consumed,
+                            const char *raw, const char *end)
+{
+    tokenVal.clear();
+    consumed = 0;
+
+    const char *rawStart = raw;
+
+    while (raw < end && (json_isspace(*raw)))          // skip whitespace
+        raw++;
+
+    if (raw >= end)
+        return JTOK_NONE;
+
+    switch (*raw) {
+
+    case '{':
+        raw++;
+        consumed = (raw - rawStart);
+        return JTOK_OBJ_OPEN;
+    case '}':
+        raw++;
+        consumed = (raw - rawStart);
+        return JTOK_OBJ_CLOSE;
+    case '[':
+        raw++;
+        consumed = (raw - rawStart);
+        return JTOK_ARR_OPEN;
+    case ']':
+        raw++;
+        consumed = (raw - rawStart);
+        return JTOK_ARR_CLOSE;
+
+    case ':':
+        raw++;
+        consumed = (raw - rawStart);
+        return JTOK_COLON;
+    case ',':
+        raw++;
+        consumed = (raw - rawStart);
+        return JTOK_COMMA;
+
+    case 'n':
+    case 't':
+    case 'f':
+        if (!strncmp(raw, "null", 4)) {
+            raw += 4;
+            consumed = (raw - rawStart);
+            return JTOK_KW_NULL;
+        } else if (!strncmp(raw, "true", 4)) {
+            raw += 4;
+            consumed = (raw - rawStart);
+            return JTOK_KW_TRUE;
+        } else if (!strncmp(raw, "false", 5)) {
+            raw += 5;
+            consumed = (raw - rawStart);
+            return JTOK_KW_FALSE;
+        } else
+            return JTOK_ERR;
+
+    case '-':
+    case '0':
+    case '1':
+    case '2':
+    case '3':
+    case '4':
+    case '5':
+    case '6':
+    case '7':
+    case '8':
+    case '9': {
+        // part 1: int
+        std::string numStr;
+
+        const char *first = raw;
+
+        const char *firstDigit = first;
+        if (!json_isdigit(*firstDigit))
+            firstDigit++;
+        if ((*firstDigit == '0') && json_isdigit(firstDigit[1]))
+            return JTOK_ERR;
+
+        numStr += *raw;                       // copy first char
+        raw++;
+
+        if ((*first == '-') && (raw < end) && (!json_isdigit(*raw)))
+            return JTOK_ERR;
+
+        while (raw < end && json_isdigit(*raw)) {  // copy digits
+            numStr += *raw;
+            raw++;
+        }
+
+        // part 2: frac
+        if (raw < end && *raw == '.') {
+            numStr += *raw;                   // copy .
+            raw++;
+
+            if (raw >= end || !json_isdigit(*raw))
+                return JTOK_ERR;
+            while (raw < end && json_isdigit(*raw)) { // copy digits
+                numStr += *raw;
+                raw++;
+            }
+        }
+
+        // part 3: exp
+        if (raw < end && (*raw == 'e' || *raw == 'E')) {
+            numStr += *raw;                   // copy E
+            raw++;
+
+            if (raw < end && (*raw == '-' || *raw == '+')) { // copy +/-
+                numStr += *raw;
+                raw++;
+            }
+
+            if (raw >= end || !json_isdigit(*raw))
+                return JTOK_ERR;
+            while (raw < end && json_isdigit(*raw)) { // copy digits
+                numStr += *raw;
+                raw++;
+            }
+        }
+
+        tokenVal = numStr;
+        consumed = (raw - rawStart);
+        return JTOK_NUMBER;
+        }
+
+    case '"': {
+        raw++;                                // skip "
+
+        std::string valStr;
+        JSONUTF8StringFilter writer(valStr);
+
+        while (true) {
+            if (raw >= end || (unsigned char)*raw < 0x20)
+                return JTOK_ERR;
+
+            else if (*raw == '\\') {
+                raw++;                        // skip backslash
+
+                if (raw >= end)
+                    return JTOK_ERR;
+
+                switch (*raw) {
+                case '"':  writer.push_back('\"'); break;
+                case '\\': writer.push_back('\\'); break;
+                case '/':  writer.push_back('/'); break;
+                case 'b':  writer.push_back('\b'); break;
+                case 'f':  writer.push_back('\f'); break;
+                case 'n':  writer.push_back('\n'); break;
+                case 'r':  writer.push_back('\r'); break;
+                case 't':  writer.push_back('\t'); break;
+
+                case 'u': {
+                    unsigned int codepoint;
+                    if (raw + 1 + 4 >= end ||
+                        hatoui(raw + 1, raw + 1 + 4, codepoint) !=
+                               raw + 1 + 4)
+                        return JTOK_ERR;
+                    writer.push_back_u(codepoint);
+                    raw += 4;
+                    break;
+                    }
+                default:
+                    return JTOK_ERR;
+
+                }
+
+                raw++;                        // skip esc'd char
+            }
+
+            else if (*raw == '"') {
+                raw++;                        // skip "
+                break;                        // stop scanning
+            }
+
+            else {
+                writer.push_back(*raw);
+                raw++;
+            }
+        }
+
+        if (!writer.finalize())
+            return JTOK_ERR;
+        tokenVal = valStr;
+        consumed = (raw - rawStart);
+        return JTOK_STRING;
+        }
+
+    default:
+        return JTOK_ERR;
+    }
+}
+
+enum expect_bits {
+    EXP_OBJ_NAME = (1U << 0),
+    EXP_COLON = (1U << 1),
+    EXP_ARR_VALUE = (1U << 2),
+    EXP_VALUE = (1U << 3),
+    EXP_NOT_VALUE = (1U << 4),
+};
+
+#define expect(bit) (expectMask & (EXP_##bit))
+#define setExpect(bit) (expectMask |= EXP_##bit)
+#define clearExpect(bit) (expectMask &= ~EXP_##bit)
+
+bool UniValue::read(const char *raw, size_t size)
+{
+    clear();
+
+    uint32_t expectMask = 0;
+    std::vector<UniValue*> stack;
+
+    std::string tokenVal;
+    unsigned int consumed;
+    enum jtokentype tok = JTOK_NONE;
+    enum jtokentype last_tok = JTOK_NONE;
+    const char* end = raw + size;
+    do {
+        last_tok = tok;
+
+        tok = getJsonToken(tokenVal, consumed, raw, end);
+        if (tok == JTOK_NONE || tok == JTOK_ERR)
+            return false;
+        raw += consumed;
+
+        bool isValueOpen = jsonTokenIsValue(tok) ||
+            tok == JTOK_OBJ_OPEN || tok == JTOK_ARR_OPEN;
+
+        if (expect(VALUE)) {
+            if (!isValueOpen)
+                return false;
+            clearExpect(VALUE);
+
+        } else if (expect(ARR_VALUE)) {
+            bool isArrValue = isValueOpen || (tok == JTOK_ARR_CLOSE);
+            if (!isArrValue)
+                return false;
+
+            clearExpect(ARR_VALUE);
+
+        } else if (expect(OBJ_NAME)) {
+            bool isObjName = (tok == JTOK_OBJ_CLOSE || tok == JTOK_STRING);
+            if (!isObjName)
+                return false;
+
+        } else if (expect(COLON)) {
+            if (tok != JTOK_COLON)
+                return false;
+            clearExpect(COLON);
+
+        } else if (!expect(COLON) && (tok == JTOK_COLON)) {
+            return false;
+        }
+
+        if (expect(NOT_VALUE)) {
+            if (isValueOpen)
+                return false;
+            clearExpect(NOT_VALUE);
+        }
+
+        switch (tok) {
+
+        case JTOK_OBJ_OPEN:
+        case JTOK_ARR_OPEN: {
+            VType utyp = (tok == JTOK_OBJ_OPEN ? VOBJ : VARR);
+            if (!stack.size()) {
+                if (utyp == VOBJ)
+                    setObject();
+                else
+                    setArray();
+                stack.push_back(this);
+            } else {
+                UniValue tmpVal(utyp);
+                UniValue *top = stack.back();
+                top->values.push_back(tmpVal);
+
+                UniValue *newTop = &(top->values.back());
+                stack.push_back(newTop);
+            }
+
+            if (stack.size() > MAX_JSON_DEPTH)
+                return false;
+
+            if (utyp == VOBJ)
+                setExpect(OBJ_NAME);
+            else
+                setExpect(ARR_VALUE);
+            break;
+            }
+
+        case JTOK_OBJ_CLOSE:
+        case JTOK_ARR_CLOSE: {
+            if (!stack.size() || (last_tok == JTOK_COMMA))
+                return false;
+
+            VType utyp = (tok == JTOK_OBJ_CLOSE ? VOBJ : VARR);
+            UniValue *top = stack.back();
+            if (utyp != top->getType())
+                return false;
+
+            stack.pop_back();
+            clearExpect(OBJ_NAME);
+            setExpect(NOT_VALUE);
+            break;
+            }
+
+        case JTOK_COLON: {
+            if (!stack.size())
+                return false;
+
+            UniValue *top = stack.back();
+            if (top->getType() != VOBJ)
+                return false;
+
+            setExpect(VALUE);
+            break;
+            }
+
+        case JTOK_COMMA: {
+            if (!stack.size() ||
+                (last_tok == JTOK_COMMA) || (last_tok == JTOK_ARR_OPEN))
+                return false;
+
+            UniValue *top = stack.back();
+            if (top->getType() == VOBJ)
+                setExpect(OBJ_NAME);
+            else
+                setExpect(ARR_VALUE);
+            break;
+            }
+
+        case JTOK_KW_NULL:
+        case JTOK_KW_TRUE:
+        case JTOK_KW_FALSE: {
+            UniValue tmpVal;
+            switch (tok) {
+            case JTOK_KW_NULL:
+                // do nothing more
+                break;
+            case JTOK_KW_TRUE:
+                tmpVal.setBool(true);
+                break;
+            case JTOK_KW_FALSE:
+                tmpVal.setBool(false);
+                break;
+            default: /* impossible */ break;
+            }
+
+            if (!stack.size()) {
+                *this = tmpVal;
+                break;
+            }
+
+            UniValue *top = stack.back();
+            top->values.push_back(tmpVal);
+
+            setExpect(NOT_VALUE);
+            break;
+            }
+
+        case JTOK_NUMBER: {
+            UniValue tmpVal(VNUM, tokenVal);
+            if (!stack.size()) {
+                *this = tmpVal;
+                break;
+            }
+
+            UniValue *top = stack.back();
+            top->values.push_back(tmpVal);
+
+            setExpect(NOT_VALUE);
+            break;
+            }
+
+        case JTOK_STRING: {
+            if (expect(OBJ_NAME)) {
+                UniValue *top = stack.back();
+                top->keys.push_back(tokenVal);
+                clearExpect(OBJ_NAME);
+                setExpect(COLON);
+            } else {
+                UniValue tmpVal(VSTR, tokenVal);
+                if (!stack.size()) {
+                    *this = tmpVal;
+                    break;
+                }
+                UniValue *top = stack.back();
+                top->values.push_back(tmpVal);
+            }
+
+            setExpect(NOT_VALUE);
+            break;
+            }
+
+        default:
+            return false;
+        }
+    } while (!stack.empty ());
+
+    /* Check that nothing follows the initial construct (parsed above).  */
+    tok = getJsonToken(tokenVal, consumed, raw, end);
+    if (tok != JTOK_NONE)
+        return false;
+
+    return true;
+}
+
diff --git a/depend/zcash/src/univalue/lib/univalue_utffilter.h b/depend/zcash/src/univalue/lib/univalue_utffilter.h
new file mode 100644
index 000000000..c24ac58ea
--- /dev/null
+++ b/depend/zcash/src/univalue/lib/univalue_utffilter.h
@@ -0,0 +1,119 @@
+// Copyright 2016 Wladimir J. van der Laan
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://opensource.org/licenses/mit-license.php.
+#ifndef UNIVALUE_UTFFILTER_H
+#define UNIVALUE_UTFFILTER_H
+
+#include <string>
+
+/**
+ * Filter that generates and validates UTF-8, as well as collates UTF-16
+ * surrogate pairs as specified in RFC4627.
+ */
+class JSONUTF8StringFilter
+{
+public:
+    explicit JSONUTF8StringFilter(std::string &s):
+        str(s), is_valid(true), codepoint(0), state(0), surpair(0)
+    {
+    }
+    // Write single 8-bit char (may be part of UTF-8 sequence)
+    void push_back(unsigned char ch)
+    {
+        if (state == 0) {
+            if (ch < 0x80) // 7-bit ASCII, fast direct pass-through
+                str.push_back(ch);
+            else if (ch < 0xc0) // Mid-sequence character, invalid in this state
+                is_valid = false;
+            else if (ch < 0xe0) { // Start of 2-byte sequence
+                codepoint = (ch & 0x1f) << 6;
+                state = 6;
+            } else if (ch < 0xf0) { // Start of 3-byte sequence
+                codepoint = (ch & 0x0f) << 12;
+                state = 12;
+            } else if (ch < 0xf8) { // Start of 4-byte sequence
+                codepoint = (ch & 0x07) << 18;
+                state = 18;
+            } else // Reserved, invalid
+                is_valid = false;
+        } else {
+            if ((ch & 0xc0) != 0x80) // Not a continuation, invalid
+                is_valid = false;
+            state -= 6;
+            codepoint |= (ch & 0x3f) << state;
+            if (state == 0)
+                push_back_u(codepoint);
+        }
+    }
+    // Write codepoint directly, possibly collating surrogate pairs
+    void push_back_u(unsigned int codepoint_)
+    {
+        if (state) // Only accept full codepoints in open state
+            is_valid = false;
+        if (codepoint_ >= 0xD800 && codepoint_ < 0xDC00) { // First half of surrogate pair
+            if (surpair) // Two subsequent surrogate pair openers - fail
+                is_valid = false;
+            else
+                surpair = codepoint_;
+        } else if (codepoint_ >= 0xDC00 && codepoint_ < 0xE000) { // Second half of surrogate pair
+            if (surpair) { // Open surrogate pair, expect second half
+                // Compute code point from UTF-16 surrogate pair
+                append_codepoint(0x10000 | ((surpair - 0xD800)<<10) | (codepoint_ - 0xDC00));
+                surpair = 0;
+            } else // Second half doesn't follow a first half - fail
+                is_valid = false;
+        } else {
+            if (surpair) // First half of surrogate pair not followed by second - fail
+                is_valid = false;
+            else
+                append_codepoint(codepoint_);
+        }
+    }
+    // Check that we're in a state where the string can be ended
+    // No open sequences, no open surrogate pairs, etc
+    bool finalize()
+    {
+        if (state || surpair)
+            is_valid = false;
+        return is_valid;
+    }
+private:
+    std::string &str;
+    bool is_valid;
+    // Current UTF-8 decoding state
+    unsigned int codepoint;
+    int state; // Top bit to be filled in for next UTF-8 byte, or 0
+
+    // Keep track of the following state to handle the following section of
+    // RFC4627:
+    //
+    //    To escape an extended character that is not in the Basic Multilingual
+    //    Plane, the character is represented as a twelve-character sequence,
+    //    encoding the UTF-16 surrogate pair.  So, for example, a string
+    //    containing only the G clef character (U+1D11E) may be represented as
+    //    "\uD834\uDD1E".
+    //
+    //  Two subsequent \u.... may have to be replaced with one actual codepoint.
+    unsigned int surpair; // First half of open UTF-16 surrogate pair, or 0
+
+    void append_codepoint(unsigned int codepoint_)
+    {
+        if (codepoint_ <= 0x7f)
+            str.push_back((char)codepoint_);
+        else if (codepoint_ <= 0x7FF) {
+            str.push_back((char)(0xC0 | (codepoint_ >> 6)));
+            str.push_back((char)(0x80 | (codepoint_ & 0x3F)));
+        } else if (codepoint_ <= 0xFFFF) {
+            str.push_back((char)(0xE0 | (codepoint_ >> 12)));
+            str.push_back((char)(0x80 | ((codepoint_ >> 6) & 0x3F)));
+            str.push_back((char)(0x80 | (codepoint_ & 0x3F)));
+        } else if (codepoint_ <= 0x1FFFFF) {
+            str.push_back((char)(0xF0 | (codepoint_ >> 18)));
+            str.push_back((char)(0x80 | ((codepoint_ >> 12) & 0x3F)));
+            str.push_back((char)(0x80 | ((codepoint_ >> 6) & 0x3F)));
+            str.push_back((char)(0x80 | (codepoint_ & 0x3F)));
+        }
+    }
+};
+
+#endif
diff --git a/depend/zcash/src/univalue/lib/univalue_write.cpp b/depend/zcash/src/univalue/lib/univalue_write.cpp
new file mode 100644
index 000000000..d31414edd
--- /dev/null
+++ b/depend/zcash/src/univalue/lib/univalue_write.cpp
@@ -0,0 +1,113 @@
+// Copyright 2014 BitPay Inc.
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://opensource.org/licenses/mit-license.php.
+
+#include <iomanip>
+#include <sstream>
+#include <stdio.h>
+#include "univalue.h"
+#include "univalue_escapes.h"
+
+static std::string json_escape(const std::string& inS)
+{
+    std::string outS;
+    outS.reserve(inS.size() * 2);
+
+    for (unsigned int i = 0; i < inS.size(); i++) {
+        unsigned char ch = inS[i];
+        const char *escStr = escapes[ch];
+
+        if (escStr)
+            outS += escStr;
+        else
+            outS += ch;
+    }
+
+    return outS;
+}
+
+std::string UniValue::write(unsigned int prettyIndent,
+                            unsigned int indentLevel) const
+{
+    std::string s;
+    s.reserve(1024);
+
+    unsigned int modIndent = indentLevel;
+    if (modIndent == 0)
+        modIndent = 1;
+
+    switch (typ) {
+    case VNULL:
+        s += "null";
+        break;
+    case VOBJ:
+        writeObject(prettyIndent, modIndent, s);
+        break;
+    case VARR:
+        writeArray(prettyIndent, modIndent, s);
+        break;
+    case VSTR:
+        s += "\"" + json_escape(val) + "\"";
+        break;
+    case VNUM:
+        s += val;
+        break;
+    case VBOOL:
+        s += (val == "1" ? "true" : "false");
+        break;
+    }
+
+    return s;
+}
+
+static void indentStr(unsigned int prettyIndent, unsigned int indentLevel, std::string& s)
+{
+    s.append(prettyIndent * indentLevel, ' ');
+}
+
+void UniValue::writeArray(unsigned int prettyIndent, unsigned int indentLevel, std::string& s) const
+{
+    s += "[";
+    if (prettyIndent)
+        s += "\n";
+
+    for (unsigned int i = 0; i < values.size(); i++) {
+        if (prettyIndent)
+            indentStr(prettyIndent, indentLevel, s);
+        s += values[i].write(prettyIndent, indentLevel + 1);
+        if (i != (values.size() - 1)) {
+            s += ",";
+        }
+        if (prettyIndent)
+            s += "\n";
+    }
+
+    if (prettyIndent)
+        indentStr(prettyIndent, indentLevel - 1, s);
+    s += "]";
+}
+
+void UniValue::writeObject(unsigned int prettyIndent, unsigned int indentLevel, std::string& s) const
+{
+    s += "{";
+    if (prettyIndent)
+        s += "\n";
+
+    for (unsigned int i = 0; i < keys.size(); i++) {
+        if (prettyIndent)
+            indentStr(prettyIndent, indentLevel, s);
+        s += "\"" + json_escape(keys[i]) + "\":";
+        if (prettyIndent)
+            s += " ";
+        s += values.at(i).write(prettyIndent, indentLevel + 1);
+        if (i != (values.size() - 1))
+            s += ",";
+        if (prettyIndent)
+            s += "\n";
+    }
+
+    if (prettyIndent)
+        indentStr(prettyIndent, indentLevel - 1, s);
+    s += "}";
+}
+
diff --git a/depend/zcash/src/univalue/pc/libunivalue-uninstalled.pc.in b/depend/zcash/src/univalue/pc/libunivalue-uninstalled.pc.in
new file mode 100644
index 000000000..b7f53e875
--- /dev/null
+++ b/depend/zcash/src/univalue/pc/libunivalue-uninstalled.pc.in
@@ -0,0 +1,9 @@
+prefix=@prefix@
+exec_prefix=@exec_prefix@
+libdir=@libdir@
+includedir=@includedir@
+
+Name: libunivalue
+Description: libunivalue, C++ universal value object and JSON library
+Version: @VERSION@
+Libs: ${pc_top_builddir}/${pcfiledir}/libunivalue.la
diff --git a/depend/zcash/src/univalue/pc/libunivalue.pc.in b/depend/zcash/src/univalue/pc/libunivalue.pc.in
new file mode 100644
index 000000000..358a2d5f7
--- /dev/null
+++ b/depend/zcash/src/univalue/pc/libunivalue.pc.in
@@ -0,0 +1,10 @@
+prefix=@prefix@
+exec_prefix=@exec_prefix@
+libdir=@libdir@
+includedir=@includedir@
+
+Name: libunivalue
+Description: libunivalue, C++ universal value object and JSON library
+Version: @VERSION@
+Libs: -L${libdir} -lunivalue
+Cflags: -I${includedir}
diff --git a/depend/zcash/src/univalue/test/.gitignore b/depend/zcash/src/univalue/test/.gitignore
new file mode 100644
index 000000000..7b27cf0da
--- /dev/null
+++ b/depend/zcash/src/univalue/test/.gitignore
@@ -0,0 +1,8 @@
+
+object
+unitester
+test_json
+no_nul
+
+*.trs
+*.log
diff --git a/depend/zcash/src/univalue/test/fail1.json b/depend/zcash/src/univalue/test/fail1.json
new file mode 100644
index 000000000..8feb01a6d
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail1.json
@@ -0,0 +1 @@
+"This is a string that never ends, yes it goes on and on, my friends.
diff --git a/depend/zcash/src/univalue/test/fail10.json b/depend/zcash/src/univalue/test/fail10.json
new file mode 100644
index 000000000..5d8c0047b
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail10.json
@@ -0,0 +1 @@
+{"Extra value after close": true} "misplaced quoted value"
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail11.json b/depend/zcash/src/univalue/test/fail11.json
new file mode 100644
index 000000000..76eb95b45
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail11.json
@@ -0,0 +1 @@
+{"Illegal expression": 1 + 2}
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail12.json b/depend/zcash/src/univalue/test/fail12.json
new file mode 100644
index 000000000..77580a452
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail12.json
@@ -0,0 +1 @@
+{"Illegal invocation": alert()}
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail13.json b/depend/zcash/src/univalue/test/fail13.json
new file mode 100644
index 000000000..379406b59
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail13.json
@@ -0,0 +1 @@
+{"Numbers cannot have leading zeroes": 013}
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail14.json b/depend/zcash/src/univalue/test/fail14.json
new file mode 100644
index 000000000..0ed366b38
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail14.json
@@ -0,0 +1 @@
+{"Numbers cannot be hex": 0x14}
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail15.json b/depend/zcash/src/univalue/test/fail15.json
new file mode 100644
index 000000000..fc8376b60
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail15.json
@@ -0,0 +1 @@
+["Illegal backslash escape: \x15"]
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail16.json b/depend/zcash/src/univalue/test/fail16.json
new file mode 100644
index 000000000..3fe21d4b5
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail16.json
@@ -0,0 +1 @@
+[\naked]
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail17.json b/depend/zcash/src/univalue/test/fail17.json
new file mode 100644
index 000000000..62b9214ae
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail17.json
@@ -0,0 +1 @@
+["Illegal backslash escape: \017"]
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail18.json b/depend/zcash/src/univalue/test/fail18.json
new file mode 100644
index 000000000..edac92716
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail18.json
@@ -0,0 +1 @@
+[[[[[[[[[[[[[[[[[[[["Too deep"]]]]]]]]]]]]]]]]]]]]
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail19.json b/depend/zcash/src/univalue/test/fail19.json
new file mode 100644
index 000000000..3b9c46fa9
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail19.json
@@ -0,0 +1 @@
+{"Missing colon" null}
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail2.json b/depend/zcash/src/univalue/test/fail2.json
new file mode 100644
index 000000000..6b7c11e5a
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail2.json
@@ -0,0 +1 @@
+["Unclosed array"
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail20.json b/depend/zcash/src/univalue/test/fail20.json
new file mode 100644
index 000000000..27c1af3e7
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail20.json
@@ -0,0 +1 @@
+{"Double colon":: null}
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail21.json b/depend/zcash/src/univalue/test/fail21.json
new file mode 100644
index 000000000..62474573b
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail21.json
@@ -0,0 +1 @@
+{"Comma instead of colon", null}
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail22.json b/depend/zcash/src/univalue/test/fail22.json
new file mode 100644
index 000000000..a7752581b
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail22.json
@@ -0,0 +1 @@
+["Colon instead of comma": false]
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail23.json b/depend/zcash/src/univalue/test/fail23.json
new file mode 100644
index 000000000..494add1ca
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail23.json
@@ -0,0 +1 @@
+["Bad value", truth]
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail24.json b/depend/zcash/src/univalue/test/fail24.json
new file mode 100644
index 000000000..caff239bf
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail24.json
@@ -0,0 +1 @@
+['single quote']
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail25.json b/depend/zcash/src/univalue/test/fail25.json
new file mode 100644
index 000000000..8b7ad23e0
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail25.json
@@ -0,0 +1 @@
+["	tab	character	in	string	"]
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail26.json b/depend/zcash/src/univalue/test/fail26.json
new file mode 100644
index 000000000..845d26a6a
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail26.json
@@ -0,0 +1 @@
+["tab\   character\   in\  string\  "]
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail27.json b/depend/zcash/src/univalue/test/fail27.json
new file mode 100644
index 000000000..6b01a2ca4
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail27.json
@@ -0,0 +1,2 @@
+["line
+break"]
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail28.json b/depend/zcash/src/univalue/test/fail28.json
new file mode 100644
index 000000000..621a0101c
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail28.json
@@ -0,0 +1,2 @@
+["line\
+break"]
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail29.json b/depend/zcash/src/univalue/test/fail29.json
new file mode 100644
index 000000000..47ec421bb
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail29.json
@@ -0,0 +1 @@
+[0e]
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail3.json b/depend/zcash/src/univalue/test/fail3.json
new file mode 100644
index 000000000..168c81eb7
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail3.json
@@ -0,0 +1 @@
+{unquoted_key: "keys must be quoted"}
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail30.json b/depend/zcash/src/univalue/test/fail30.json
new file mode 100644
index 000000000..8ab0bc4b8
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail30.json
@@ -0,0 +1 @@
+[0e+]
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail31.json b/depend/zcash/src/univalue/test/fail31.json
new file mode 100644
index 000000000..1cce602b5
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail31.json
@@ -0,0 +1 @@
+[0e+-1]
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail32.json b/depend/zcash/src/univalue/test/fail32.json
new file mode 100644
index 000000000..45cba7396
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail32.json
@@ -0,0 +1 @@
+{"Comma instead if closing brace": true,
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail33.json b/depend/zcash/src/univalue/test/fail33.json
new file mode 100644
index 000000000..ca5eb19dc
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail33.json
@@ -0,0 +1 @@
+["mismatch"}
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail34.json b/depend/zcash/src/univalue/test/fail34.json
new file mode 100644
index 000000000..3f8be1728
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail34.json
@@ -0,0 +1 @@
+{} garbage
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail35.json b/depend/zcash/src/univalue/test/fail35.json
new file mode 100644
index 000000000..de30ca5c4
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail35.json
@@ -0,0 +1 @@
+[ true true true [] [] [] ]
diff --git a/depend/zcash/src/univalue/test/fail36.json b/depend/zcash/src/univalue/test/fail36.json
new file mode 100644
index 000000000..f82eb8e1f
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail36.json
@@ -0,0 +1 @@
+{"a":}
diff --git a/depend/zcash/src/univalue/test/fail37.json b/depend/zcash/src/univalue/test/fail37.json
new file mode 100644
index 000000000..3294dc3a4
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail37.json
@@ -0,0 +1 @@
+{"a":1 "b":2}
diff --git a/depend/zcash/src/univalue/test/fail38.json b/depend/zcash/src/univalue/test/fail38.json
new file mode 100644
index 000000000..b245e2e46
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail38.json
@@ -0,0 +1 @@
+["\ud834"]
diff --git a/depend/zcash/src/univalue/test/fail39.json b/depend/zcash/src/univalue/test/fail39.json
new file mode 100644
index 000000000..7c9e263f2
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail39.json
@@ -0,0 +1 @@
+["\udd61"]
diff --git a/depend/zcash/src/univalue/test/fail4.json b/depend/zcash/src/univalue/test/fail4.json
new file mode 100644
index 000000000..9de168bf3
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail4.json
@@ -0,0 +1 @@
+["extra comma",]
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail40.json b/depend/zcash/src/univalue/test/fail40.json
new file mode 100644
index 000000000..664dc9e24
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail40.json
@@ -0,0 +1 @@
+["�…¡"]
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail41.json b/depend/zcash/src/univalue/test/fail41.json
new file mode 100644
index 000000000..0de342a2b
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail41.json
@@ -0,0 +1 @@
+["ð�…"]
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail42.json b/depend/zcash/src/univalue/test/fail42.json
new file mode 100644
index 000000000..9c7565adb
Binary files /dev/null and b/depend/zcash/src/univalue/test/fail42.json differ
diff --git a/depend/zcash/src/univalue/test/fail44.json b/depend/zcash/src/univalue/test/fail44.json
new file mode 100644
index 000000000..80edceddf
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail44.json
@@ -0,0 +1 @@
+"This file ends without a newline or close-quote.
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail45.json b/depend/zcash/src/univalue/test/fail45.json
new file mode 100644
index 000000000..03a30d880
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail45.json
@@ -0,0 +1 @@
+[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]
diff --git a/depend/zcash/src/univalue/test/fail5.json b/depend/zcash/src/univalue/test/fail5.json
new file mode 100644
index 000000000..ddf3ce3d2
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail5.json
@@ -0,0 +1 @@
+["double extra comma",,]
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail6.json b/depend/zcash/src/univalue/test/fail6.json
new file mode 100644
index 000000000..ed91580e1
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail6.json
@@ -0,0 +1 @@
+[   , "<-- missing value"]
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail7.json b/depend/zcash/src/univalue/test/fail7.json
new file mode 100644
index 000000000..8a96af3e4
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail7.json
@@ -0,0 +1 @@
+["Comma after the close"],
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail8.json b/depend/zcash/src/univalue/test/fail8.json
new file mode 100644
index 000000000..b28479c6e
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail8.json
@@ -0,0 +1 @@
+["Extra close"]]
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/fail9.json b/depend/zcash/src/univalue/test/fail9.json
new file mode 100644
index 000000000..5815574f3
--- /dev/null
+++ b/depend/zcash/src/univalue/test/fail9.json
@@ -0,0 +1 @@
+{"Extra comma": true,}
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/no_nul.cpp b/depend/zcash/src/univalue/test/no_nul.cpp
new file mode 100644
index 000000000..83d292200
--- /dev/null
+++ b/depend/zcash/src/univalue/test/no_nul.cpp
@@ -0,0 +1,8 @@
+#include "univalue.h"
+
+int main (int argc, char *argv[])
+{
+    char buf[] = "___[1,2,3]___";
+    UniValue val;
+    return val.read(buf + 3, 7) ? 0 : 1;
+}
diff --git a/depend/zcash/src/univalue/test/object.cpp b/depend/zcash/src/univalue/test/object.cpp
new file mode 100644
index 000000000..042acfe45
--- /dev/null
+++ b/depend/zcash/src/univalue/test/object.cpp
@@ -0,0 +1,420 @@
+// Copyright (c) 2014 BitPay Inc.
+// Copyright (c) 2014-2016 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://opensource.org/licenses/mit-license.php.
+
+#include <stdint.h>
+#include <vector>
+#include <string>
+#include <map>
+#include <cassert>
+#include <stdexcept>
+#include <univalue.h>
+
+#define BOOST_FIXTURE_TEST_SUITE(a, b)
+#define BOOST_AUTO_TEST_CASE(funcName) void funcName()
+#define BOOST_AUTO_TEST_SUITE_END()
+#define BOOST_CHECK(expr) assert(expr)
+#define BOOST_CHECK_EQUAL(v1, v2) assert((v1) == (v2))
+#define BOOST_CHECK_THROW(stmt, excMatch) { \
+        try { \
+            (stmt); \
+            assert(0 && "No exception caught"); \
+        } catch (excMatch & e) { \
+	} catch (...) { \
+	    assert(0 && "Wrong exception caught"); \
+	} \
+    }
+#define BOOST_CHECK_NO_THROW(stmt) { \
+        try { \
+            (stmt); \
+	} catch (...) { \
+	    assert(0); \
+	} \
+    }
+
+BOOST_FIXTURE_TEST_SUITE(univalue_tests, BasicTestingSetup)
+
+BOOST_AUTO_TEST_CASE(univalue_constructor)
+{
+    UniValue v1;
+    BOOST_CHECK(v1.isNull());
+
+    UniValue v2(UniValue::VSTR);
+    BOOST_CHECK(v2.isStr());
+
+    UniValue v3(UniValue::VSTR, "foo");
+    BOOST_CHECK(v3.isStr());
+    BOOST_CHECK_EQUAL(v3.getValStr(), "foo");
+
+    UniValue numTest;
+    BOOST_CHECK(numTest.setNumStr("82"));
+    BOOST_CHECK(numTest.isNum());
+    BOOST_CHECK_EQUAL(numTest.getValStr(), "82");
+
+    uint64_t vu64 = 82;
+    UniValue v4(vu64);
+    BOOST_CHECK(v4.isNum());
+    BOOST_CHECK_EQUAL(v4.getValStr(), "82");
+
+    int64_t vi64 = -82;
+    UniValue v5(vi64);
+    BOOST_CHECK(v5.isNum());
+    BOOST_CHECK_EQUAL(v5.getValStr(), "-82");
+
+    int vi = -688;
+    UniValue v6(vi);
+    BOOST_CHECK(v6.isNum());
+    BOOST_CHECK_EQUAL(v6.getValStr(), "-688");
+
+    double vd = -7.21;
+    UniValue v7(vd);
+    BOOST_CHECK(v7.isNum());
+    BOOST_CHECK_EQUAL(v7.getValStr(), "-7.21");
+
+    std::string vs("yawn");
+    UniValue v8(vs);
+    BOOST_CHECK(v8.isStr());
+    BOOST_CHECK_EQUAL(v8.getValStr(), "yawn");
+
+    const char *vcs = "zappa";
+    UniValue v9(vcs);
+    BOOST_CHECK(v9.isStr());
+    BOOST_CHECK_EQUAL(v9.getValStr(), "zappa");
+}
+
+BOOST_AUTO_TEST_CASE(univalue_typecheck)
+{
+    UniValue v1;
+    BOOST_CHECK(v1.setNumStr("1"));
+    BOOST_CHECK(v1.isNum());
+    BOOST_CHECK_THROW(v1.get_bool(), std::runtime_error);
+
+    UniValue v2;
+    BOOST_CHECK(v2.setBool(true));
+    BOOST_CHECK_EQUAL(v2.get_bool(), true);
+    BOOST_CHECK_THROW(v2.get_int(), std::runtime_error);
+
+    UniValue v3;
+    BOOST_CHECK(v3.setNumStr("32482348723847471234"));
+    BOOST_CHECK_THROW(v3.get_int64(), std::runtime_error);
+    BOOST_CHECK(v3.setNumStr("1000"));
+    BOOST_CHECK_EQUAL(v3.get_int64(), 1000);
+
+    UniValue v4;
+    BOOST_CHECK(v4.setNumStr("2147483648"));
+    BOOST_CHECK_EQUAL(v4.get_int64(), 2147483648);
+    BOOST_CHECK_THROW(v4.get_int(), std::runtime_error);
+    BOOST_CHECK(v4.setNumStr("1000"));
+    BOOST_CHECK_EQUAL(v4.get_int(), 1000);
+    BOOST_CHECK_THROW(v4.get_str(), std::runtime_error);
+    BOOST_CHECK_EQUAL(v4.get_real(), 1000);
+    BOOST_CHECK_THROW(v4.get_array(), std::runtime_error);
+    BOOST_CHECK_THROW(v4.getKeys(), std::runtime_error);
+    BOOST_CHECK_THROW(v4.getValues(), std::runtime_error);
+    BOOST_CHECK_THROW(v4.get_obj(), std::runtime_error);
+
+    UniValue v5;
+    BOOST_CHECK(v5.read("[true, 10]"));
+    BOOST_CHECK_NO_THROW(v5.get_array());
+    std::vector<UniValue> vals = v5.getValues();
+    BOOST_CHECK_THROW(vals[0].get_int(), std::runtime_error);
+    BOOST_CHECK_EQUAL(vals[0].get_bool(), true);
+
+    BOOST_CHECK_EQUAL(vals[1].get_int(), 10);
+    BOOST_CHECK_THROW(vals[1].get_bool(), std::runtime_error);
+}
+
+BOOST_AUTO_TEST_CASE(univalue_set)
+{
+    UniValue v(UniValue::VSTR, "foo");
+    v.clear();
+    BOOST_CHECK(v.isNull());
+    BOOST_CHECK_EQUAL(v.getValStr(), "");
+
+    BOOST_CHECK(v.setObject());
+    BOOST_CHECK(v.isObject());
+    BOOST_CHECK_EQUAL(v.size(), 0);
+    BOOST_CHECK_EQUAL(v.getType(), UniValue::VOBJ);
+    BOOST_CHECK(v.empty());
+
+    BOOST_CHECK(v.setArray());
+    BOOST_CHECK(v.isArray());
+    BOOST_CHECK_EQUAL(v.size(), 0);
+
+    BOOST_CHECK(v.setStr("zum"));
+    BOOST_CHECK(v.isStr());
+    BOOST_CHECK_EQUAL(v.getValStr(), "zum");
+
+    BOOST_CHECK(v.setFloat(-1.01));
+    BOOST_CHECK(v.isNum());
+    BOOST_CHECK_EQUAL(v.getValStr(), "-1.01");
+
+    BOOST_CHECK(v.setInt((int)1023));
+    BOOST_CHECK(v.isNum());
+    BOOST_CHECK_EQUAL(v.getValStr(), "1023");
+
+    BOOST_CHECK(v.setInt((int64_t)-1023LL));
+    BOOST_CHECK(v.isNum());
+    BOOST_CHECK_EQUAL(v.getValStr(), "-1023");
+
+    BOOST_CHECK(v.setInt((uint64_t)1023ULL));
+    BOOST_CHECK(v.isNum());
+    BOOST_CHECK_EQUAL(v.getValStr(), "1023");
+
+    BOOST_CHECK(v.setNumStr("-688"));
+    BOOST_CHECK(v.isNum());
+    BOOST_CHECK_EQUAL(v.getValStr(), "-688");
+
+    BOOST_CHECK(v.setBool(false));
+    BOOST_CHECK_EQUAL(v.isBool(), true);
+    BOOST_CHECK_EQUAL(v.isTrue(), false);
+    BOOST_CHECK_EQUAL(v.isFalse(), true);
+    BOOST_CHECK_EQUAL(v.getBool(), false);
+
+    BOOST_CHECK(v.setBool(true));
+    BOOST_CHECK_EQUAL(v.isBool(), true);
+    BOOST_CHECK_EQUAL(v.isTrue(), true);
+    BOOST_CHECK_EQUAL(v.isFalse(), false);
+    BOOST_CHECK_EQUAL(v.getBool(), true);
+
+    BOOST_CHECK(!v.setNumStr("zombocom"));
+
+    BOOST_CHECK(v.setNull());
+    BOOST_CHECK(v.isNull());
+}
+
+BOOST_AUTO_TEST_CASE(univalue_array)
+{
+    UniValue arr(UniValue::VARR);
+
+    UniValue v((int64_t)1023LL);
+    BOOST_CHECK(arr.push_back(v));
+
+    std::string vStr("zippy");
+    BOOST_CHECK(arr.push_back(vStr));
+
+    const char *s = "pippy";
+    BOOST_CHECK(arr.push_back(s));
+
+    std::vector<UniValue> vec;
+    v.setStr("boing");
+    vec.push_back(v);
+
+    v.setStr("going");
+    vec.push_back(v);
+
+    BOOST_CHECK(arr.push_backV(vec));
+
+    BOOST_CHECK(arr.push_back((uint64_t) 400ULL));
+    BOOST_CHECK(arr.push_back((int64_t) -400LL));
+    BOOST_CHECK(arr.push_back((int) -401));
+    BOOST_CHECK(arr.push_back(-40.1));
+    BOOST_CHECK(arr.push_back(true));
+
+    BOOST_CHECK_EQUAL(arr.empty(), false);
+    BOOST_CHECK_EQUAL(arr.size(), 10);
+
+    BOOST_CHECK_EQUAL(arr[0].getValStr(), "1023");
+    BOOST_CHECK_EQUAL(arr[0].getType(), UniValue::VNUM);
+    BOOST_CHECK_EQUAL(arr[1].getValStr(), "zippy");
+    BOOST_CHECK_EQUAL(arr[1].getType(), UniValue::VSTR);
+    BOOST_CHECK_EQUAL(arr[2].getValStr(), "pippy");
+    BOOST_CHECK_EQUAL(arr[2].getType(), UniValue::VSTR);
+    BOOST_CHECK_EQUAL(arr[3].getValStr(), "boing");
+    BOOST_CHECK_EQUAL(arr[3].getType(), UniValue::VSTR);
+    BOOST_CHECK_EQUAL(arr[4].getValStr(), "going");
+    BOOST_CHECK_EQUAL(arr[4].getType(), UniValue::VSTR);
+    BOOST_CHECK_EQUAL(arr[5].getValStr(), "400");
+    BOOST_CHECK_EQUAL(arr[5].getType(), UniValue::VNUM);
+    BOOST_CHECK_EQUAL(arr[6].getValStr(), "-400");
+    BOOST_CHECK_EQUAL(arr[6].getType(), UniValue::VNUM);
+    BOOST_CHECK_EQUAL(arr[7].getValStr(), "-401");
+    BOOST_CHECK_EQUAL(arr[7].getType(), UniValue::VNUM);
+    BOOST_CHECK_EQUAL(arr[8].getValStr(), "-40.1");
+    BOOST_CHECK_EQUAL(arr[8].getType(), UniValue::VNUM);
+    BOOST_CHECK_EQUAL(arr[9].getValStr(), "1");
+    BOOST_CHECK_EQUAL(arr[9].getType(), UniValue::VBOOL);
+
+    BOOST_CHECK_EQUAL(arr[999].getValStr(), "");
+
+    arr.clear();
+    BOOST_CHECK(arr.empty());
+    BOOST_CHECK_EQUAL(arr.size(), 0);
+}
+
+BOOST_AUTO_TEST_CASE(univalue_object)
+{
+    UniValue obj(UniValue::VOBJ);
+    std::string strKey, strVal;
+    UniValue v;
+
+    strKey = "age";
+    v.setInt(100);
+    BOOST_CHECK(obj.pushKV(strKey, v));
+
+    strKey = "first";
+    strVal = "John";
+    BOOST_CHECK(obj.pushKV(strKey, strVal));
+
+    strKey = "last";
+    const char *cVal = "Smith";
+    BOOST_CHECK(obj.pushKV(strKey, cVal));
+
+    strKey = "distance";
+    BOOST_CHECK(obj.pushKV(strKey, (int64_t) 25));
+
+    strKey = "time";
+    BOOST_CHECK(obj.pushKV(strKey, (uint64_t) 3600));
+
+    strKey = "calories";
+    BOOST_CHECK(obj.pushKV(strKey, (int) 12));
+
+    strKey = "temperature";
+    BOOST_CHECK(obj.pushKV(strKey, (double) 90.012));
+
+    strKey = "moon";
+    BOOST_CHECK(obj.pushKV(strKey, true));
+
+    strKey = "spoon";
+    BOOST_CHECK(obj.pushKV(strKey, false));
+
+    UniValue obj2(UniValue::VOBJ);
+    BOOST_CHECK(obj2.pushKV("cat1", 9000));
+    BOOST_CHECK(obj2.pushKV("cat2", 12345));
+
+    BOOST_CHECK(obj.pushKVs(obj2));
+
+    BOOST_CHECK_EQUAL(obj.empty(), false);
+    BOOST_CHECK_EQUAL(obj.size(), 11);
+
+    BOOST_CHECK_EQUAL(obj["age"].getValStr(), "100");
+    BOOST_CHECK_EQUAL(obj["first"].getValStr(), "John");
+    BOOST_CHECK_EQUAL(obj["last"].getValStr(), "Smith");
+    BOOST_CHECK_EQUAL(obj["distance"].getValStr(), "25");
+    BOOST_CHECK_EQUAL(obj["time"].getValStr(), "3600");
+    BOOST_CHECK_EQUAL(obj["calories"].getValStr(), "12");
+    BOOST_CHECK_EQUAL(obj["temperature"].getValStr(), "90.012");
+    BOOST_CHECK_EQUAL(obj["moon"].getValStr(), "1");
+    BOOST_CHECK_EQUAL(obj["spoon"].getValStr(), "");
+    BOOST_CHECK_EQUAL(obj["cat1"].getValStr(), "9000");
+    BOOST_CHECK_EQUAL(obj["cat2"].getValStr(), "12345");
+
+    BOOST_CHECK_EQUAL(obj["nyuknyuknyuk"].getValStr(), "");
+
+    BOOST_CHECK(obj.exists("age"));
+    BOOST_CHECK(obj.exists("first"));
+    BOOST_CHECK(obj.exists("last"));
+    BOOST_CHECK(obj.exists("distance"));
+    BOOST_CHECK(obj.exists("time"));
+    BOOST_CHECK(obj.exists("calories"));
+    BOOST_CHECK(obj.exists("temperature"));
+    BOOST_CHECK(obj.exists("moon"));
+    BOOST_CHECK(obj.exists("spoon"));
+    BOOST_CHECK(obj.exists("cat1"));
+    BOOST_CHECK(obj.exists("cat2"));
+
+    BOOST_CHECK(!obj.exists("nyuknyuknyuk"));
+
+    std::map<std::string, UniValue::VType> objTypes;
+    objTypes["age"] = UniValue::VNUM;
+    objTypes["first"] = UniValue::VSTR;
+    objTypes["last"] = UniValue::VSTR;
+    objTypes["distance"] = UniValue::VNUM;
+    objTypes["time"] = UniValue::VNUM;
+    objTypes["calories"] = UniValue::VNUM;
+    objTypes["temperature"] = UniValue::VNUM;
+    objTypes["moon"] = UniValue::VBOOL;
+    objTypes["spoon"] = UniValue::VBOOL;
+    objTypes["cat1"] = UniValue::VNUM;
+    objTypes["cat2"] = UniValue::VNUM;
+    BOOST_CHECK(obj.checkObject(objTypes));
+
+    objTypes["cat2"] = UniValue::VSTR;
+    BOOST_CHECK(!obj.checkObject(objTypes));
+
+    obj.clear();
+    BOOST_CHECK(obj.empty());
+    BOOST_CHECK_EQUAL(obj.size(), 0);
+    BOOST_CHECK_EQUAL(obj.getType(), UniValue::VNULL);
+
+    BOOST_CHECK_EQUAL(obj.setObject(), true);
+    UniValue uv;
+    uv.setInt(42);
+    obj._pushKV("age", uv);
+    BOOST_CHECK_EQUAL(obj.size(), 1);
+    BOOST_CHECK_EQUAL(obj["age"].getValStr(), "42");
+
+    uv.setInt(43);
+    obj.pushKV("age", uv);
+    BOOST_CHECK_EQUAL(obj.size(), 1);
+    BOOST_CHECK_EQUAL(obj["age"].getValStr(), "43");
+
+    obj.pushKV("name", "foo bar");
+
+    std::map<std::string,UniValue> kv;
+    obj.getObjMap(kv);
+    BOOST_CHECK_EQUAL(kv["age"].getValStr(), "43");
+    BOOST_CHECK_EQUAL(kv["name"].getValStr(), "foo bar");
+
+}
+
+static const char *json1 =
+"[1.10000000,{\"key1\":\"str\\u0000\",\"key2\":800,\"key3\":{\"name\":\"martian http://test.com\"}}]";
+
+BOOST_AUTO_TEST_CASE(univalue_readwrite)
+{
+    UniValue v;
+    BOOST_CHECK(v.read(json1));
+
+    std::string strJson1(json1);
+    BOOST_CHECK(v.read(strJson1));
+
+    BOOST_CHECK(v.isArray());
+    BOOST_CHECK_EQUAL(v.size(), 2);
+
+    BOOST_CHECK_EQUAL(v[0].getValStr(), "1.10000000");
+
+    UniValue obj = v[1];
+    BOOST_CHECK(obj.isObject());
+    BOOST_CHECK_EQUAL(obj.size(), 3);
+
+    BOOST_CHECK(obj["key1"].isStr());
+    std::string correctValue("str");
+    correctValue.push_back('\0');
+    BOOST_CHECK_EQUAL(obj["key1"].getValStr(), correctValue);
+    BOOST_CHECK(obj["key2"].isNum());
+    BOOST_CHECK_EQUAL(obj["key2"].getValStr(), "800");
+    BOOST_CHECK(obj["key3"].isObject());
+
+    BOOST_CHECK_EQUAL(strJson1, v.write());
+
+    /* Check for (correctly reporting) a parsing error if the initial
+       JSON construct is followed by more stuff.  Note that whitespace
+       is, of course, exempt.  */
+
+    BOOST_CHECK(v.read("  {}\n  "));
+    BOOST_CHECK(v.isObject());
+    BOOST_CHECK(v.read("  []\n  "));
+    BOOST_CHECK(v.isArray());
+
+    BOOST_CHECK(!v.read("@{}"));
+    BOOST_CHECK(!v.read("{} garbage"));
+    BOOST_CHECK(!v.read("[]{}"));
+    BOOST_CHECK(!v.read("{}[]"));
+    BOOST_CHECK(!v.read("{} 42"));
+}
+
+BOOST_AUTO_TEST_SUITE_END()
+
+int main (int argc, char *argv[])
+{
+    univalue_constructor();
+    univalue_typecheck();
+    univalue_set();
+    univalue_array();
+    univalue_object();
+    univalue_readwrite();
+    return 0;
+}
+
diff --git a/depend/zcash/src/univalue/test/pass1.json b/depend/zcash/src/univalue/test/pass1.json
new file mode 100644
index 000000000..70e268543
--- /dev/null
+++ b/depend/zcash/src/univalue/test/pass1.json
@@ -0,0 +1,58 @@
+[
+    "JSON Test Pattern pass1",
+    {"object with 1 member":["array with 1 element"]},
+    {},
+    [],
+    -42,
+    true,
+    false,
+    null,
+    {
+        "integer": 1234567890,
+        "real": -9876.543210,
+        "e": 0.123456789e-12,
+        "E": 1.234567890E+34,
+        "":  23456789012E66,
+        "zero": 0,
+        "one": 1,
+        "space": " ",
+        "quote": "\"",
+        "backslash": "\\",
+        "controls": "\b\f\n\r\t",
+        "slash": "/ & \/",
+        "alpha": "abcdefghijklmnopqrstuvwyz",
+        "ALPHA": "ABCDEFGHIJKLMNOPQRSTUVWYZ",
+        "digit": "0123456789",
+        "0123456789": "digit",
+        "special": "`1~!@#$%^&*()_+-={':[,]}|;.</>?",
+        "hex": "\u0123\u4567\u89AB\uCDEF\uabcd\uef4A",
+        "true": true,
+        "false": false,
+        "null": null,
+        "array":[  ],
+        "object":{  },
+        "address": "50 St. James Street",
+        "url": "http://www.JSON.org/",
+        "comment": "// /* <!-- --",
+        "# -- --> */": " ",
+        " s p a c e d " :[1,2 , 3
+
+,
+
+4 , 5        ,          6           ,7        ],"compact":[1,2,3,4,5,6,7],
+        "jsontext": "{\"object with 1 member\":[\"array with 1 element\"]}",
+        "quotes": "&#34; \u0022 %22 0x22 034 &#x22;",
+        "\/\\\"\uCAFE\uBABE\uAB98\uFCDE\ubcda\uef4A\b\f\n\r\t`1~!@#$%^&*()_+-=[]{}|;:',./<>?"
+: "A key can be any string"
+    },
+    0.5 ,98.6
+,
+99.44
+,
+
+1066,
+1e1,
+0.1e1,
+1e-1,
+1e00,2e+00,2e-00
+,"rosebud"]
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/pass2.json b/depend/zcash/src/univalue/test/pass2.json
new file mode 100644
index 000000000..d3c63c7ad
--- /dev/null
+++ b/depend/zcash/src/univalue/test/pass2.json
@@ -0,0 +1 @@
+[[[[[[[[[[[[[[[[[[["Not too deep"]]]]]]]]]]]]]]]]]]]
\ No newline at end of file
diff --git a/depend/zcash/src/univalue/test/pass3.json b/depend/zcash/src/univalue/test/pass3.json
new file mode 100644
index 000000000..4528d51f1
--- /dev/null
+++ b/depend/zcash/src/univalue/test/pass3.json
@@ -0,0 +1,6 @@
+{
+    "JSON Test Pattern pass3": {
+        "The outermost value": "must be an object or array.",
+        "In this test": "It is an object."
+    }
+}
diff --git a/depend/zcash/src/univalue/test/pass4.json b/depend/zcash/src/univalue/test/pass4.json
new file mode 100644
index 000000000..f5a680b31
--- /dev/null
+++ b/depend/zcash/src/univalue/test/pass4.json
@@ -0,0 +1 @@
+[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[[]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]]
diff --git a/depend/zcash/src/univalue/test/round1.json b/depend/zcash/src/univalue/test/round1.json
new file mode 100644
index 000000000..a711e7308
--- /dev/null
+++ b/depend/zcash/src/univalue/test/round1.json
@@ -0,0 +1 @@
+["\u0000\u0001\u0002\u0003\u0004\u0005\u0006\u0007\b\t\n\u000b\f\r\u000e\u000f\u0010\u0011\u0012\u0013\u0014\u0015\u0016\u0017\u0018\u0019\u001a\u001b\u001c\u001d\u001e\u001f !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~\u007f"]
diff --git a/depend/zcash/src/univalue/test/round2.json b/depend/zcash/src/univalue/test/round2.json
new file mode 100644
index 000000000..b766cccc6
--- /dev/null
+++ b/depend/zcash/src/univalue/test/round2.json
@@ -0,0 +1 @@
+["a§■��"]
diff --git a/depend/zcash/src/univalue/test/round3.json b/depend/zcash/src/univalue/test/round3.json
new file mode 100644
index 000000000..7182dc2f9
--- /dev/null
+++ b/depend/zcash/src/univalue/test/round3.json
@@ -0,0 +1 @@
+"abcdefghijklmnopqrstuvwxyz"
diff --git a/depend/zcash/src/univalue/test/round4.json b/depend/zcash/src/univalue/test/round4.json
new file mode 100644
index 000000000..7f8f011eb
--- /dev/null
+++ b/depend/zcash/src/univalue/test/round4.json
@@ -0,0 +1 @@
+7
diff --git a/depend/zcash/src/univalue/test/round5.json b/depend/zcash/src/univalue/test/round5.json
new file mode 100644
index 000000000..27ba77dda
--- /dev/null
+++ b/depend/zcash/src/univalue/test/round5.json
@@ -0,0 +1 @@
+true
diff --git a/depend/zcash/src/univalue/test/round6.json b/depend/zcash/src/univalue/test/round6.json
new file mode 100644
index 000000000..c508d5366
--- /dev/null
+++ b/depend/zcash/src/univalue/test/round6.json
@@ -0,0 +1 @@
+false
diff --git a/depend/zcash/src/univalue/test/round7.json b/depend/zcash/src/univalue/test/round7.json
new file mode 100644
index 000000000..19765bd50
--- /dev/null
+++ b/depend/zcash/src/univalue/test/round7.json
@@ -0,0 +1 @@
+null
diff --git a/depend/zcash/src/univalue/test/test_json.cpp b/depend/zcash/src/univalue/test/test_json.cpp
new file mode 100644
index 000000000..2943bae2b
--- /dev/null
+++ b/depend/zcash/src/univalue/test/test_json.cpp
@@ -0,0 +1,24 @@
+// Test program that can be called by the JSON test suite at
+// https://github.com/nst/JSONTestSuite.
+//
+// It reads JSON input from stdin and exits with code 0 if it can be parsed
+// successfully. It also pretty prints the parsed JSON value to stdout.
+
+#include <iostream>
+#include <string>
+#include "univalue.h"
+
+using namespace std;
+
+int main (int argc, char *argv[])
+{
+    UniValue val;
+    if (val.read(string(istreambuf_iterator<char>(cin),
+                        istreambuf_iterator<char>()))) {
+        cout << val.write(1 /* prettyIndent */, 4 /* indentLevel */) << endl;
+        return 0;
+    } else {
+        cerr << "JSON Parse Error." << endl;
+        return 1;
+    }
+}
diff --git a/depend/zcash/src/univalue/test/unitester.cpp b/depend/zcash/src/univalue/test/unitester.cpp
new file mode 100644
index 000000000..1a6c9ef69
--- /dev/null
+++ b/depend/zcash/src/univalue/test/unitester.cpp
@@ -0,0 +1,171 @@
+// Copyright 2014 BitPay Inc.
+// Distributed under the MIT/X11 software license, see the accompanying
+// file COPYING or https://opensource.org/licenses/mit-license.php.
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <string.h>
+#include <cassert>
+#include <string>
+#include "univalue.h"
+
+#ifndef JSON_TEST_SRC
+#error JSON_TEST_SRC must point to test source directory
+#endif
+
+#ifndef ARRAY_SIZE
+#define ARRAY_SIZE(arr) (sizeof(arr) / sizeof((arr)[0]))
+#endif
+
+std::string srcdir(JSON_TEST_SRC);
+static bool test_failed = false;
+
+#define d_assert(expr) { if (!(expr)) { test_failed = true; fprintf(stderr, "%s failed\n", filename.c_str()); } }
+#define f_assert(expr) { if (!(expr)) { test_failed = true; fprintf(stderr, "%s failed\n", __func__); } }
+
+static std::string rtrim(std::string s)
+{
+    s.erase(s.find_last_not_of(" \n\r\t")+1);
+    return s;
+}
+
+static void runtest(std::string filename, const std::string& jdata)
+{
+        std::string prefix = filename.substr(0, 4);
+
+        bool wantPass = (prefix == "pass") || (prefix == "roun");
+        bool wantFail = (prefix == "fail");
+        bool wantRoundTrip = (prefix == "roun");
+        assert(wantPass || wantFail);
+
+        UniValue val;
+        bool testResult = val.read(jdata);
+
+        if (wantPass) {
+            d_assert(testResult == true);
+        } else {
+            d_assert(testResult == false);
+        }
+
+        if (wantRoundTrip) {
+            std::string odata = val.write(0, 0);
+            assert(odata == rtrim(jdata));
+        }
+}
+
+static void runtest_file(const char *filename_)
+{
+        std::string basename(filename_);
+        std::string filename = srcdir + "/" + basename;
+        FILE *f = fopen(filename.c_str(), "r");
+        assert(f != NULL);
+
+        std::string jdata;
+
+        char buf[4096];
+        while (!feof(f)) {
+                int bread = fread(buf, 1, sizeof(buf), f);
+                assert(!ferror(f));
+
+                std::string s(buf, bread);
+                jdata += s;
+        }
+
+        assert(!ferror(f));
+        fclose(f);
+
+        runtest(basename, jdata);
+}
+
+static const char *filenames[] = {
+        "fail10.json",
+        "fail11.json",
+        "fail12.json",
+        "fail13.json",
+        "fail14.json",
+        "fail15.json",
+        "fail16.json",
+        "fail17.json",
+        //"fail18.json",             // investigate
+        "fail19.json",
+        "fail1.json",
+        "fail20.json",
+        "fail21.json",
+        "fail22.json",
+        "fail23.json",
+        "fail24.json",
+        "fail25.json",
+        "fail26.json",
+        "fail27.json",
+        "fail28.json",
+        "fail29.json",
+        "fail2.json",
+        "fail30.json",
+        "fail31.json",
+        "fail32.json",
+        "fail33.json",
+        "fail34.json",
+        "fail35.json",
+        "fail36.json",
+        "fail37.json",
+        "fail38.json",               // invalid unicode: only first half of surrogate pair
+        "fail39.json",               // invalid unicode: only second half of surrogate pair
+        "fail40.json",               // invalid unicode: broken UTF-8
+        "fail41.json",               // invalid unicode: unfinished UTF-8
+        "fail42.json",               // valid json with garbage following a nul byte
+        "fail44.json",               // unterminated string
+        "fail45.json",               // nested beyond max depth
+        "fail3.json",
+        "fail4.json",                // extra comma
+        "fail5.json",
+        "fail6.json",
+        "fail7.json",
+        "fail8.json",
+        "fail9.json",               // extra comma
+        "pass1.json",
+        "pass2.json",
+        "pass3.json",
+        "pass4.json",
+        "round1.json",              // round-trip test
+        "round2.json",              // unicode
+        "round3.json",              // bare string
+        "round4.json",              // bare number
+        "round5.json",              // bare true
+        "round6.json",              // bare false
+        "round7.json",              // bare null
+};
+
+// Test \u handling
+void unescape_unicode_test()
+{
+    UniValue val;
+    bool testResult;
+    // Escaped ASCII (quote)
+    testResult = val.read("[\"\\u0022\"]");
+    f_assert(testResult);
+    f_assert(val[0].get_str() == "\"");
+    // Escaped Basic Plane character, two-byte UTF-8
+    testResult = val.read("[\"\\u0191\"]");
+    f_assert(testResult);
+    f_assert(val[0].get_str() == "\xc6\x91");
+    // Escaped Basic Plane character, three-byte UTF-8
+    testResult = val.read("[\"\\u2191\"]");
+    f_assert(testResult);
+    f_assert(val[0].get_str() == "\xe2\x86\x91");
+    // Escaped Supplementary Plane character U+1d161
+    testResult = val.read("[\"\\ud834\\udd61\"]");
+    f_assert(testResult);
+    f_assert(val[0].get_str() == "\xf0\x9d\x85\xa1");
+}
+
+int main (int argc, char *argv[])
+{
+    for (unsigned int fidx = 0; fidx < ARRAY_SIZE(filenames); fidx++) {
+        runtest_file(filenames[fidx]);
+    }
+
+    unescape_unicode_test();
+
+    return test_failed ? 1 : 0;
+}
+
diff --git a/depend/zcash/src/util.cpp b/depend/zcash/src/util.cpp
new file mode 100644
index 000000000..88953011d
--- /dev/null
+++ b/depend/zcash/src/util.cpp
@@ -0,0 +1,682 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Copyright (c) 2015-2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#if defined(HAVE_CONFIG_H)
+#include "config/bitcoin-config.h"
+#endif
+
+#include "util.h"
+
+#include "chainparamsbase.h"
+#include "fs.h"
+#include "random.h"
+#include "serialize.h"
+#include "sync.h"
+#include "utilstrencodings.h"
+#include "utiltime.h"
+
+#include <stdarg.h>
+#include <stdio.h>
+
+#if (defined(__FreeBSD__) || defined(__OpenBSD__) || defined(__DragonFly__))
+#include <pthread.h>
+#include <pthread_np.h>
+#endif
+
+#ifndef WIN32
+// for posix_fallocate
+#ifdef __linux__
+
+#ifdef _POSIX_C_SOURCE
+#undef _POSIX_C_SOURCE
+#endif
+
+#define _POSIX_C_SOURCE 200112L
+
+#endif // __linux__
+
+#include <algorithm>
+#include <fcntl.h>
+#include <sys/resource.h>
+#include <sys/stat.h>
+
+#else
+
+#ifdef _MSC_VER
+#pragma warning(disable:4786)
+#pragma warning(disable:4804)
+#pragma warning(disable:4805)
+#pragma warning(disable:4717)
+#endif
+
+#ifndef NOMINMAX
+#define NOMINMAX
+#endif
+
+#include <io.h> /* for _commit */
+#include <shlobj.h>
+#endif
+
+#ifdef HAVE_SYS_PRCTL_H
+#include <sys/prctl.h>
+#endif
+
+#include <boost/algorithm/string/case_conv.hpp> // for to_lower()
+#include <boost/algorithm/string/join.hpp>
+#include <boost/algorithm/string/predicate.hpp> // for startswith() and endswith()
+#include <boost/program_options/detail/config_file.hpp>
+#include <boost/program_options/parsers.hpp>
+#include <boost/thread.hpp>
+
+using namespace std;
+
+const char * const BITCOIN_CONF_FILENAME = "zcash.conf";
+const char * const BITCOIN_PID_FILENAME = "zcashd.pid";
+
+CCriticalSection cs_args;
+map<string, string> mapArgs;
+map<string, vector<string>> mapMultiArgs;
+bool fDebug = false;
+bool fDaemon = false;
+bool fServer = false;
+
+/** Interpret string as boolean, for argument parsing */
+static bool InterpretBool(const std::string& strValue)
+{
+    if (strValue.empty())
+        return true;
+    return (atoi(strValue) != 0);
+}
+
+/** Turn -noX into -X=0 (and -noX=0 into -X=1) */
+static void InterpretNegativeSetting(std::string& strKey, std::string& strValue)
+{
+    if (strKey.length()>3 && strKey[0]=='-' && strKey[1]=='n' && strKey[2]=='o')
+    {
+        strKey = "-" + strKey.substr(3);
+        strValue = InterpretBool(strValue) ? "0" : "1";
+    }
+}
+
+void ParseParameters(int argc, const char* const argv[])
+{
+    LOCK(cs_args);
+    mapArgs.clear();
+    mapMultiArgs.clear();
+
+    for (int i = 1; i < argc; i++)
+    {
+        std::string str(argv[i]);
+        std::string strValue;
+        size_t is_index = str.find('=');
+        if (is_index != std::string::npos)
+        {
+            strValue = str.substr(is_index+1);
+            str = str.substr(0, is_index);
+        }
+#ifdef WIN32
+        boost::to_lower(str);
+        if (boost::algorithm::starts_with(str, "/"))
+            str = "-" + str.substr(1);
+#endif
+
+        if (str[0] != '-')
+            break;
+
+        // Interpret --foo as -foo.
+        // If both --foo and -foo are set, the last takes effect.
+        if (str.length() > 1 && str[1] == '-')
+            str = str.substr(1);
+        InterpretNegativeSetting(str, strValue);
+
+        mapArgs[str] = strValue;
+        mapMultiArgs[str].push_back(strValue);
+    }
+}
+
+std::string GetArg(const std::string& strArg, const std::string& strDefault)
+{
+    LOCK(cs_args);
+    if (mapArgs.count(strArg))
+        return mapArgs[strArg];
+    return strDefault;
+}
+
+int64_t GetArg(const std::string& strArg, int64_t nDefault)
+{
+    LOCK(cs_args);
+    if (mapArgs.count(strArg))
+        return atoi64(mapArgs[strArg]);
+    return nDefault;
+}
+
+bool GetBoolArg(const std::string& strArg, bool fDefault)
+{
+    LOCK(cs_args);
+    if (mapArgs.count(strArg))
+        return InterpretBool(mapArgs[strArg]);
+    return fDefault;
+}
+
+std::vector<std::string> GetMultiArg(const std::string& strArg)
+{
+    if (mapMultiArgs.count(strArg)) {
+        return mapMultiArgs[strArg];
+    } else {
+        return {};
+    }
+}
+
+bool SoftSetArg(const std::string& strArg, const std::string& strValue)
+{
+    LOCK(cs_args);
+    if (mapArgs.count(strArg))
+        return false;
+    mapArgs[strArg] = strValue;
+    return true;
+}
+
+bool SoftSetBoolArg(const std::string& strArg, bool fValue)
+{
+    if (fValue)
+        return SoftSetArg(strArg, std::string("1"));
+    else
+        return SoftSetArg(strArg, std::string("0"));
+}
+
+static const int screenWidth = 79;
+static const int optIndent = 2;
+static const int msgIndent = 7;
+
+std::string HelpMessageGroup(const std::string &message) {
+    return std::string(message) + std::string("\n\n");
+}
+
+std::string HelpMessageOpt(const std::string &option, const std::string &message) {
+    return std::string(optIndent,' ') + std::string(option) +
+           std::string("\n") + std::string(msgIndent,' ') +
+           FormatParagraph(message, screenWidth - msgIndent, msgIndent) +
+           std::string("\n\n");
+}
+
+static std::string FormatException(const std::exception* pex, const char* pszThread)
+{
+#ifdef WIN32
+    char pszModule[MAX_PATH] = "";
+    GetModuleFileNameA(NULL, pszModule, sizeof(pszModule));
+#else
+    const char* pszModule = "Zcash";
+#endif
+    if (pex)
+        return strprintf(
+            "EXCEPTION: %s       \n%s       \n%s in %s       \n", typeid(*pex).name(), pex->what(), pszModule, pszThread);
+    else
+        return strprintf(
+            "UNKNOWN EXCEPTION       \n%s in %s       \n", pszModule, pszThread);
+}
+
+void PrintExceptionContinue(const std::exception* pex, const char* pszThread)
+{
+    std::string message = FormatException(pex, pszThread);
+    LogPrintf("\n\n************************\n%s\n", message);
+}
+
+fs::path GetDefaultDataDir()
+{
+    // Windows < Vista: C:\Documents and Settings\Username\Application Data\Zcash
+    // Windows >= Vista: C:\Users\Username\AppData\Roaming\Zcash
+    // Mac: ~/Library/Application Support/Zcash
+    // Unix: ~/.zcash
+#ifdef WIN32
+    // Windows
+    return GetSpecialFolderPath(CSIDL_APPDATA) / "Zcash";
+#else
+    fs::path pathRet;
+    char* pszHome = getenv("HOME");
+    if (pszHome == NULL || strlen(pszHome) == 0)
+        pathRet = fs::path("/");
+    else
+        pathRet = fs::path(pszHome);
+#ifdef MAC_OSX
+    // Mac
+    pathRet /= "Library/Application Support";
+    TryCreateDirectory(pathRet);
+    return pathRet / "Zcash";
+#else
+    // Unix
+    return pathRet / ".zcash";
+#endif
+#endif
+}
+
+static fs::path pathCached;
+static fs::path pathCachedNetSpecific;
+static fs::path zc_paramsPathCached;
+static CCriticalSection csPathCached;
+
+static fs::path ZC_GetDefaultBaseParamsDir()
+{
+    // Copied from GetDefaultDataDir and adapter for zcash params.
+
+    // Windows < Vista: C:\Documents and Settings\Username\Application Data\ZcashParams
+    // Windows >= Vista: C:\Users\Username\AppData\Roaming\ZcashParams
+    // Mac: ~/Library/Application Support/ZcashParams
+    // Unix: ~/.zcash-params
+#ifdef WIN32
+    // Windows
+    return GetSpecialFolderPath(CSIDL_APPDATA) / "ZcashParams";
+#else
+    fs::path pathRet;
+    char* pszHome = getenv("HOME");
+    if (pszHome == NULL || strlen(pszHome) == 0)
+        pathRet = fs::path("/");
+    else
+        pathRet = fs::path(pszHome);
+#ifdef MAC_OSX
+    // Mac
+    pathRet /= "Library/Application Support";
+    TryCreateDirectory(pathRet);
+    return pathRet / "ZcashParams";
+#else
+    // Unix
+    return pathRet / ".zcash-params";
+#endif
+#endif
+}
+
+const fs::path &ZC_GetParamsDir()
+{
+    LOCK2(cs_args, csPathCached);
+
+    fs::path &path = zc_paramsPathCached;
+
+    // This can be called during exceptions by LogPrintf(), so we cache the
+    // value so we don't have to do memory allocations after that.
+    if (!path.empty())
+        return path;
+
+    if (mapArgs.count("-paramsdir")) {
+        path = fs::system_complete(mapArgs["-paramsdir"]);
+        if (!fs::is_directory(path)) {
+            throw std::runtime_error(strprintf("The -paramsdir '%s' does not exist or is not a directory", path.string()));
+        }
+    } else {
+        path = ZC_GetDefaultBaseParamsDir();
+    }
+
+    return path;
+}
+
+// Return the user specified export directory.  Create directory if it doesn't exist.
+// If user did not set option, return an empty path.
+// If there is a filesystem problem, throw an exception.
+const fs::path GetExportDir()
+{
+    fs::path path;
+    LOCK(cs_args);
+    if (mapArgs.count("-exportdir")) {
+        path = fs::system_complete(mapArgs["-exportdir"]);
+        if (fs::exists(path) && !fs::is_directory(path)) {
+            throw std::runtime_error(strprintf("The -exportdir '%s' already exists and is not a directory", path.string()));
+        }
+        if (!fs::exists(path) && !fs::create_directories(path)) {
+            throw std::runtime_error(strprintf("Failed to create directory at -exportdir '%s'", path.string()));
+        }
+    }
+    return path;
+}
+
+
+const fs::path &GetDataDir(bool fNetSpecific)
+{
+    LOCK2(cs_args, csPathCached);
+
+    fs::path &path = fNetSpecific ? pathCachedNetSpecific : pathCached;
+
+    // This can be called during exceptions by LogPrintf(), so we cache the
+    // value so we don't have to do memory allocations after that.
+    if (!path.empty())
+        return path;
+
+    if (mapArgs.count("-datadir")) {
+        path = fs::system_complete(mapArgs["-datadir"]);
+        if (!fs::is_directory(path)) {
+            path = "";
+            return path;
+        }
+    } else {
+        path = GetDefaultDataDir();
+    }
+    if (fNetSpecific)
+        path /= BaseParams().DataDir();
+
+    fs::create_directories(path);
+
+    return path;
+}
+
+void ClearDatadirCache()
+{
+    LOCK(csPathCached);
+    pathCached = fs::path();
+    pathCachedNetSpecific = fs::path();
+}
+
+fs::path GetConfigFile(const std::string& confPath)
+{
+    fs::path pathConfigFile(confPath);
+    if (!pathConfigFile.is_complete())
+        pathConfigFile = GetDataDir(false) / pathConfigFile;
+
+    return pathConfigFile;
+}
+
+void ReadConfigFile(const std::string& confPath,
+                    map<string, string>& mapSettingsRet,
+                    map<string, vector<string> >& mapMultiSettingsRet)
+{
+    fs::ifstream streamConfig(GetConfigFile(confPath));
+    if (!streamConfig.good())
+        throw missing_zcash_conf();
+
+    set<string> setOptions;
+    setOptions.insert("*");
+
+    const vector<string> allowed_duplicates = {
+        "addnode",
+        "allowdeprecated",
+        "bind",
+        "connect",
+        "debug",
+        "externalip",
+        "fundingstream",
+        "loadblock",
+        "metricsallowip",
+        "nuparams",
+        "onlynet",
+        "rpcallowip",
+        "rpcauth",
+        "rpcbind",
+        "seednode",
+        "uacomment",
+        "whitebind",
+        "whitelist"
+    };
+    set<string> unique_options;
+
+    {
+        LOCK(cs_args);
+        for (boost::program_options::detail::config_file_iterator it(streamConfig, setOptions), end; it != end; ++it)
+        {
+            string strKey = string("-") + it->string_key;
+            string strValue = it->value[0];
+
+            if (find(allowed_duplicates.begin(), allowed_duplicates.end(), it->string_key) == allowed_duplicates.end())
+            {
+                if (!unique_options.insert(strKey).second) {
+                    throw std::runtime_error(strprintf("Option '%s' is duplicated, which is not allowed.", strKey));
+                }
+            }
+
+            InterpretNegativeSetting(strKey, strValue);
+            // Don't overwrite existing settings so command line settings override zcash.conf
+            if (mapSettingsRet.count(strKey) == 0)
+                mapSettingsRet[strKey] = strValue;
+            mapMultiSettingsRet[strKey].push_back(strValue);
+        }
+    }
+    // If datadir is changed in .conf file:
+    ClearDatadirCache();
+}
+
+#ifndef WIN32
+fs::path GetPidFile()
+{
+    fs::path pathPidFile(GetArg("-pid", BITCOIN_PID_FILENAME));
+    if (!pathPidFile.is_complete()) pathPidFile = GetDataDir() / pathPidFile;
+    return pathPidFile;
+}
+
+void CreatePidFile(const fs::path &path, pid_t pid)
+{
+    FILE* file = fsbridge::fopen(path, "w");
+    if (file)
+    {
+        fprintf(file, "%d\n", pid);
+        fclose(file);
+    }
+}
+#endif
+
+bool RenameOver(fs::path src, fs::path dest)
+{
+#ifdef WIN32
+    return MoveFileExA(src.string().c_str(), dest.string().c_str(),
+                       MOVEFILE_REPLACE_EXISTING) != 0;
+#else
+    int rc = std::rename(src.string().c_str(), dest.string().c_str());
+    return (rc == 0);
+#endif /* WIN32 */
+}
+
+/**
+ * Ignores exceptions thrown by Boost's create_directory if the requested directory exists.
+ * Specifically handles case where path p exists, but it wasn't possible for the user to
+ * write to the parent directory.
+ */
+bool TryCreateDirectory(const fs::path& p)
+{
+    try
+    {
+        return fs::create_directory(p);
+    } catch (const fs::filesystem_error&) {
+        if (!fs::exists(p) || !fs::is_directory(p))
+            throw;
+    }
+
+    // create_directory didn't create the directory, it had to have existed already
+    return false;
+}
+
+void FileCommit(FILE *fileout)
+{
+    fflush(fileout); // harmless if redundantly called
+#ifdef WIN32
+    HANDLE hFile = (HANDLE)_get_osfhandle(_fileno(fileout));
+    FlushFileBuffers(hFile);
+#else
+    #if defined(__linux__) || defined(__NetBSD__)
+    fdatasync(fileno(fileout));
+    #elif defined(MAC_OSX) && defined(F_FULLFSYNC)
+    fcntl(fileno(fileout), F_FULLFSYNC, 0);
+    #else
+    fsync(fileno(fileout));
+    #endif
+#endif
+}
+
+bool TruncateFile(FILE *file, unsigned int length) {
+#if defined(WIN32)
+    return _chsize(_fileno(file), length) == 0;
+#else
+    return ftruncate(fileno(file), length) == 0;
+#endif
+}
+
+/**
+ * this function tries to raise the file descriptor limit to the requested number.
+ * It returns the actual file descriptor limit (which may be more or less than nMinFD)
+ */
+int RaiseFileDescriptorLimit(int nMinFD) {
+#if defined(WIN32)
+    return 2048;
+#else
+    struct rlimit limitFD;
+    if (getrlimit(RLIMIT_NOFILE, &limitFD) != -1) {
+        if (limitFD.rlim_cur < (rlim_t)nMinFD) {
+            limitFD.rlim_cur = nMinFD;
+            if (limitFD.rlim_cur > limitFD.rlim_max)
+                limitFD.rlim_cur = limitFD.rlim_max;
+            setrlimit(RLIMIT_NOFILE, &limitFD);
+            getrlimit(RLIMIT_NOFILE, &limitFD);
+        }
+        return limitFD.rlim_cur;
+    }
+    return nMinFD; // getrlimit failed, assume it's fine
+#endif
+}
+
+/**
+ * this function tries to make a particular range of a file allocated (corresponding to disk space)
+ * it is advisory, and the range specified in the arguments will never contain live data
+ */
+void AllocateFileRange(FILE *file, unsigned int offset, unsigned int length) {
+#if defined(WIN32)
+    // Windows-specific version
+    HANDLE hFile = (HANDLE)_get_osfhandle(_fileno(file));
+    LARGE_INTEGER nFileSize;
+    int64_t nEndPos = (int64_t)offset + length;
+    nFileSize.u.LowPart = nEndPos & 0xFFFFFFFF;
+    nFileSize.u.HighPart = nEndPos >> 32;
+    SetFilePointerEx(hFile, nFileSize, 0, FILE_BEGIN);
+    SetEndOfFile(hFile);
+#elif defined(MAC_OSX)
+    // OSX specific version
+    fstore_t fst;
+    fst.fst_flags = F_ALLOCATECONTIG;
+    fst.fst_posmode = F_PEOFPOSMODE;
+    fst.fst_offset = 0;
+    fst.fst_length = (off_t)offset + length;
+    fst.fst_bytesalloc = 0;
+    if (fcntl(fileno(file), F_PREALLOCATE, &fst) == -1) {
+        fst.fst_flags = F_ALLOCATEALL;
+        fcntl(fileno(file), F_PREALLOCATE, &fst);
+    }
+    ftruncate(fileno(file), fst.fst_length);
+#elif defined(__linux__)
+    // Version using posix_fallocate
+    off_t nEndPos = (off_t)offset + length;
+    posix_fallocate(fileno(file), 0, nEndPos);
+#else
+    // Fallback version
+    // TODO: just write one byte per block
+    static const char buf[65536] = {};
+    fseek(file, offset, SEEK_SET);
+    while (length > 0) {
+        unsigned int now = 65536;
+        if (length < now)
+            now = length;
+        fwrite(buf, 1, now, file); // allowed to fail; this function is advisory anyway
+        length -= now;
+    }
+#endif
+}
+
+#ifdef WIN32
+fs::path GetSpecialFolderPath(int nFolder, bool fCreate)
+{
+    WCHAR pwszPath[MAX_PATH] = L"";
+
+    if(SHGetSpecialFolderPathW(nullptr, pwszPath, nFolder, fCreate))
+    {
+        return fs::path(pwszPath);
+    }
+
+    LogPrintf("SHGetSpecialFolderPathW() failed, could not obtain requested path.\n");
+    return fs::path("");
+}
+#endif
+
+void runCommand(const std::string& strCommand)
+{
+    int nErr = ::system(strCommand.c_str());
+    if (nErr)
+        LogPrintf("runCommand error: system(%s) returned %d\n", strCommand, nErr);
+}
+
+void RenameThread(const char* name)
+{
+#if defined(PR_SET_NAME)
+    // Only the first 15 characters are used (16 - NUL terminator)
+    ::prctl(PR_SET_NAME, name, 0, 0, 0);
+#elif (defined(__FreeBSD__) || defined(__OpenBSD__) || defined(__DragonFly__))
+    pthread_set_name_np(pthread_self(), name);
+
+#elif defined(MAC_OSX)
+    pthread_setname_np(name);
+#else
+    // Prevent warnings for unused parameters...
+    (void)name;
+#endif
+}
+
+void SetupEnvironment()
+{
+    // On most POSIX systems (e.g. Linux, but not BSD) the environment's locale
+    // may be invalid, in which case the "C" locale is used as fallback.
+#if !defined(WIN32) && !defined(MAC_OSX) && !defined(__FreeBSD__) && !defined(__OpenBSD__)
+    try {
+        std::locale(""); // Raises a runtime error if current locale is invalid
+    } catch (const std::runtime_error&) {
+        setenv("LC_ALL", "C", 1);
+    }
+#endif
+    // The path locale is lazy initialized and to avoid deinitialization errors
+    // in multithreading environments, it is set explicitly by the main thread.
+    // A dummy locale is used to extract the internal default locale, used by
+    // fs::path, which is then used to explicitly imbue the path.
+    std::locale loc = fs::path::imbue(std::locale::classic());
+    fs::path::imbue(loc);
+}
+
+bool SetupNetworking()
+{
+#ifdef WIN32
+    // Initialize Windows Sockets
+    WSADATA wsadata;
+    int ret = WSAStartup(MAKEWORD(2,2), &wsadata);
+    if (ret != NO_ERROR || LOBYTE(wsadata.wVersion ) != 2 || HIBYTE(wsadata.wVersion) != 2)
+        return false;
+#endif
+    return true;
+}
+
+void SetThreadPriority(int nPriority)
+{
+#ifdef WIN32
+    SetThreadPriority(GetCurrentThread(), nPriority);
+#else // WIN32
+#ifdef PRIO_THREAD
+    setpriority(PRIO_THREAD, 0, nPriority);
+#else // PRIO_THREAD
+    setpriority(PRIO_PROCESS, 0, nPriority);
+#endif // PRIO_THREAD
+#endif // WIN32
+}
+
+std::string PrivacyInfo()
+{
+    return "\n" +
+           FormatParagraph(strprintf(_("In order to ensure you are adequately protecting your privacy when using Zcash, please see <%s>."),
+                                     "https://z.cash/support/security/")) + "\n";
+}
+
+std::string LicenseInfo()
+{
+    return "\n" +
+           FormatParagraph(strprintf(_("Copyright (C) 2009-%i The Bitcoin Core Developers"), COPYRIGHT_YEAR)) + "\n" +
+           FormatParagraph(strprintf(_("Copyright (C) 2015-%i The Zcash Developers"), COPYRIGHT_YEAR)) + "\n" +
+           "\n" +
+           FormatParagraph(_("This is experimental software.")) + "\n" +
+           "\n" +
+           FormatParagraph(_("Distributed under the MIT software license, see the accompanying file COPYING or <https://www.opensource.org/licenses/mit-license.php>.")) +
+           "\n";
+}
+
+int GetNumCores()
+{
+    return boost::thread::physical_concurrency();
+}
diff --git a/depend/zcash/src/util.h b/depend/zcash/src/util.h
new file mode 100644
index 000000000..736e79851
--- /dev/null
+++ b/depend/zcash/src/util.h
@@ -0,0 +1,217 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+/**
+ * Server/client environment: argument handling, config file parsing,
+ * thread wrappers
+ */
+#ifndef BITCOIN_UTIL_H
+#define BITCOIN_UTIL_H
+
+#if defined(HAVE_CONFIG_H)
+#include "config/bitcoin-config.h"
+#endif
+
+#include "compat.h"
+#include "fs.h"
+#include "logging.h"
+#include "tinyformat.h"
+#include "utiltime.h"
+
+#include <atomic>
+#include <exception>
+#include <map>
+#include <stdint.h>
+#include <string>
+#include <vector>
+
+#include <boost/thread/exceptions.hpp>
+
+extern std::map<std::string, std::string> mapArgs;
+extern std::map<std::string, std::vector<std::string> > mapMultiArgs;
+extern bool fDebug;
+extern bool fServer;
+
+extern const char * const BITCOIN_CONF_FILENAME;
+extern const char * const BITCOIN_PID_FILENAME;
+
+/** Translate a message to the native language of the user. */
+const extern std::function<std::string(const char*)> G_TRANSLATION_FUN;
+
+/**
+ * Translation function.
+ * If no translation function is set, simply return the input.
+ */
+inline std::string _(const char* psz)
+{
+    return G_TRANSLATION_FUN ? (G_TRANSLATION_FUN)(psz) : psz;
+}
+
+void SetupEnvironment();
+bool SetupNetworking();
+
+template<typename... Args>
+static inline bool error(const char* format, const Args&... args)
+{
+    return LogError("main", format, args...);
+}
+
+const fs::path &ZC_GetParamsDir();
+
+void PrintExceptionContinue(const std::exception *pex, const char* pszThread);
+void ParseParameters(int argc, const char*const argv[]);
+void FileCommit(FILE *fileout);
+bool TruncateFile(FILE *file, unsigned int length);
+int RaiseFileDescriptorLimit(int nMinFD);
+void AllocateFileRange(FILE *file, unsigned int offset, unsigned int length);
+bool RenameOver(fs::path src, fs::path dest);
+bool TryCreateDirectory(const fs::path& p);
+fs::path GetDefaultDataDir();
+const fs::path &GetDataDir(bool fNetSpecific = true);
+void ClearDatadirCache();
+fs::path GetConfigFile(const std::string& confPath);
+#ifndef WIN32
+fs::path GetPidFile();
+void CreatePidFile(const fs::path &path, pid_t pid);
+#endif
+class missing_zcash_conf : public std::runtime_error {
+public:
+    missing_zcash_conf() : std::runtime_error("Missing zcash.conf") { }
+};
+void ReadConfigFile(const std::string& confPath, std::map<std::string, std::string>& mapSettingsRet, std::map<std::string, std::vector<std::string> >& mapMultiSettingsRet);
+#ifdef WIN32
+fs::path GetSpecialFolderPath(int nFolder, bool fCreate = true);
+#endif
+void runCommand(const std::string& strCommand);
+const fs::path GetExportDir();
+
+/** Returns privacy notice (for -version, -help and metrics screen) */
+std::string PrivacyInfo();
+
+/** Returns licensing information (for -version) */
+std::string LicenseInfo();
+
+inline bool IsSwitchChar(char c)
+{
+#ifdef WIN32
+    return c == '-' || c == '/';
+#else
+    return c == '-';
+#endif
+}
+
+/**
+ * Return string argument or default value
+ *
+ * @param strArg Argument to get (e.g. "-foo")
+ * @param default (e.g. "1")
+ * @return command-line argument or default value
+ */
+std::string GetArg(const std::string& strArg, const std::string& strDefault);
+
+/**
+ * Return integer argument or default value
+ *
+ * @param strArg Argument to get (e.g. "-foo")
+ * @param default (e.g. 1)
+ * @return command-line argument (0 if invalid number) or default value
+ */
+int64_t GetArg(const std::string& strArg, int64_t nDefault);
+
+/**
+ * Return boolean argument or default value
+ *
+ * @param strArg Argument to get (e.g. "-foo")
+ * @param default (true or false)
+ * @return command-line argument or default value
+ */
+bool GetBoolArg(const std::string& strArg, bool fDefault);
+
+/**
+ * Return the values provided for a multiargument parameter.
+ * Multiargument parameters are provided via repetition of
+ * single-argument parameters, e.g. "-foo=value1 -foo=value2"
+ * will result in the vector `{"value1", "value2"}` returned
+ * for `GetMultiArg("-foo")`.
+ *
+ * @param strArg Argument to get values for (e.g. "-foo")
+ * @return each value provided for the parameter.
+ */
+std::vector<std::string> GetMultiArg(const std::string& strArg);
+
+/**
+ * Set an argument if it doesn't already have a value
+ *
+ * @param strArg Argument to set (e.g. "-foo")
+ * @param strValue Value (e.g. "1")
+ * @return true if argument gets set, false if it already had a value
+ */
+bool SoftSetArg(const std::string& strArg, const std::string& strValue);
+
+/**
+ * Set a boolean argument if it doesn't already have a value
+ *
+ * @param strArg Argument to set (e.g. "-foo")
+ * @param fValue Value (e.g. false)
+ * @return true if argument gets set, false if it already had a value
+ */
+bool SoftSetBoolArg(const std::string& strArg, bool fValue);
+
+/**
+ * Format a string to be used as group of options in help messages
+ *
+ * @param message Group name (e.g. "RPC server options:")
+ * @return the formatted string
+ */
+std::string HelpMessageGroup(const std::string& message);
+
+/**
+ * Format a string to be used as option description in help messages
+ *
+ * @param option Option message (e.g. "-rpcuser=<user>")
+ * @param message Option description (e.g. "Username for JSON-RPC connections")
+ * @return the formatted string
+ */
+std::string HelpMessageOpt(const std::string& option, const std::string& message);
+
+/**
+ * Return the number of physical cores available on the current system.
+ * @note This does not count virtual cores, such as those provided by HyperThreading
+ * when boost is newer than 1.56.
+ */
+int GetNumCores();
+
+void SetThreadPriority(int nPriority);
+void RenameThread(const char* name);
+
+/**
+ * .. and a wrapper that just calls func once
+ */
+template <typename Callable> void TraceThread(const char* name,  Callable func)
+{
+    std::string s = strprintf("zcash-%s", name);
+    RenameThread(s.c_str());
+    try
+    {
+        LogPrintf("%s thread start\n", name);
+        func();
+        LogPrintf("%s thread exit\n", name);
+    }
+    catch (const boost::thread_interrupted&)
+    {
+        LogPrintf("%s thread interrupt\n", name);
+        throw;
+    }
+    catch (const std::exception& e) {
+        PrintExceptionContinue(&e, name);
+        throw;
+    }
+    catch (...) {
+        PrintExceptionContinue(NULL, name);
+        throw;
+    }
+}
+
+#endif // BITCOIN_UTIL_H
diff --git a/depend/zcash/src/util/match.h b/depend/zcash/src/util/match.h
new file mode 100644
index 000000000..d966ae4da
--- /dev/null
+++ b/depend/zcash/src/util/match.h
@@ -0,0 +1,24 @@
+// Copyright (c) 2021 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_UTIL_MATCH_H
+#define ZCASH_UTIL_MATCH_H
+
+// Helper for using `std::visit` with Rust-style match syntax.
+//
+// This can be used in place of defining an explicit visitor. `std::visit` requires an
+// exhaustive match; to emulate Rust's catch-all binding, use an `(auto arg)` template
+// operator().
+//
+// Care must be taken that implicit conversions are handled correctly. For instance, a
+// `(double arg)` operator() *will also* bind to `int` and `long`, if there isn't an
+// earlier satisfying match.
+//
+// This corresponds to visitor example #4 in the `std::visit` documentation:
+// https://en.cppreference.com/w/cpp/utility/variant/visit
+template<class... Ts> struct match : Ts... { using Ts::operator()...; };
+// explicit deduction guide (not needed as of C++20)
+template<class... Ts> match(Ts...) -> match<Ts...>;
+
+#endif // ZCASH_UTIL_MATCH_H
diff --git a/depend/zcash/src/utilmoneystr.cpp b/depend/zcash/src/utilmoneystr.cpp
new file mode 100644
index 000000000..0a47765ec
--- /dev/null
+++ b/depend/zcash/src/utilmoneystr.cpp
@@ -0,0 +1,79 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "utilmoneystr.h"
+
+#include "primitives/transaction.h"
+#include "tinyformat.h"
+#include "utilstrencodings.h"
+
+using namespace std;
+
+std::string FormatMoney(const CAmount& n)
+{
+    // Note: not using straight sprintf here because we do NOT want
+    // localized number formatting.
+    int64_t n_abs = (n > 0 ? n : -n);
+    int64_t quotient = n_abs/COIN;
+    int64_t remainder = n_abs%COIN;
+    string str = strprintf("%d.%08d", quotient, remainder);
+
+    // Right-trim excess zeros before the decimal point:
+    int nTrim = 0;
+    for (int i = str.size()-1; (str[i] == '0' && isdigit(str[i-2])); --i)
+        ++nTrim;
+    if (nTrim)
+        str.erase(str.size()-nTrim, nTrim);
+
+    if (n < 0)
+        str.insert((unsigned int)0, 1, '-');
+    return str;
+}
+
+
+bool ParseMoney(const string& str, CAmount& nRet)
+{
+    return ParseMoney(str.c_str(), nRet);
+}
+
+bool ParseMoney(const char* pszIn, CAmount& nRet)
+{
+    string strWhole;
+    int64_t nUnits = 0;
+    const char* p = pszIn;
+    while (isspace(*p))
+        p++;
+    for (; *p; p++)
+    {
+        if (*p == '.')
+        {
+            p++;
+            int64_t nMult = CENT*10;
+            while (isdigit(*p) && (nMult > 0))
+            {
+                nUnits += nMult * (*p++ - '0');
+                nMult /= 10;
+            }
+            break;
+        }
+        if (isspace(*p))
+            break;
+        if (!isdigit(*p))
+            return false;
+        strWhole.insert(strWhole.end(), *p);
+    }
+    for (; *p; p++)
+        if (!isspace(*p))
+            return false;
+    if (strWhole.size() > 10) // guard against 63 bit overflow
+        return false;
+    if (nUnits < 0 || nUnits > COIN)
+        return false;
+    int64_t nWhole = atoi64(strWhole);
+    CAmount nValue = nWhole*COIN + nUnits;
+
+    nRet = nValue;
+    return true;
+}
diff --git a/depend/zcash/src/utilmoneystr.h b/depend/zcash/src/utilmoneystr.h
new file mode 100644
index 000000000..d3bb1bb62
--- /dev/null
+++ b/depend/zcash/src/utilmoneystr.h
@@ -0,0 +1,21 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+/**
+ * Money parsing/formatting utilities.
+ */
+#ifndef BITCOIN_UTILMONEYSTR_H
+#define BITCOIN_UTILMONEYSTR_H
+
+#include <stdint.h>
+#include <string>
+
+#include "amount.h"
+
+std::string FormatMoney(const CAmount& n);
+bool ParseMoney(const std::string& str, CAmount& nRet);
+bool ParseMoney(const char* pszIn, CAmount& nRet);
+
+#endif // BITCOIN_UTILMONEYSTR_H
diff --git a/depend/zcash/src/utilstrencodings.cpp b/depend/zcash/src/utilstrencodings.cpp
new file mode 100644
index 000000000..215e2aa37
--- /dev/null
+++ b/depend/zcash/src/utilstrencodings.cpp
@@ -0,0 +1,565 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "utilstrencodings.h"
+
+#include "tinyformat.h"
+
+#include <cstdlib>
+#include <cstring>
+#include <errno.h>
+#include <iomanip>
+#include <limits>
+
+using namespace std;
+
+static const string CHARS_ALPHA_NUM = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
+
+static const string SAFE_CHARS[] =
+{
+    CHARS_ALPHA_NUM + " .,;_/:?@()", // SAFE_CHARS_DEFAULT
+    CHARS_ALPHA_NUM + " .,;_?@", // SAFE_CHARS_UA_COMMENT
+    CHARS_ALPHA_NUM + " .-/:" // SAFE_CHARS_SUBVERSION
+
+};
+
+string SanitizeString(const string& str, int rule)
+{
+    string strResult;
+    for (std::string::size_type i = 0; i < str.size(); i++)
+    {
+        if (SAFE_CHARS[rule].find(str[i]) != std::string::npos)
+            strResult.push_back(str[i]);
+    }
+    return strResult;
+}
+
+string SanitizeFilename(const string& str)
+{
+    /**
+     * safeChars chosen to restrict filename, keeping it simple to avoid cross-platform issues.
+     * https://stackoverflow.com/a/2306003
+     */
+    static string safeChars("abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ01234567890");
+    string strResult;
+    for (std::string::size_type i = 0; i < str.size(); i++)
+    {
+        if (safeChars.find(str[i]) != std::string::npos)
+            strResult.push_back(str[i]);
+    }
+    return strResult;
+}
+
+std::string HexInt(uint32_t val)
+{
+    std::stringstream ss;
+    ss << std::setfill('0') << std::setw(sizeof(uint32_t) * 2) << std::hex << val;
+    return ss.str();
+}
+
+uint32_t ParseHexToUInt32(const std::string& str) {
+    std::istringstream converter(str);
+    uint32_t value;
+    converter >> std::hex >> value;
+    return value;
+}
+
+const signed char p_util_hexdigit[256] =
+{ -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
+  -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
+  -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
+  0,1,2,3,4,5,6,7,8,9,-1,-1,-1,-1,-1,-1,
+  -1,0xa,0xb,0xc,0xd,0xe,0xf,-1,-1,-1,-1,-1,-1,-1,-1,-1,
+  -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
+  -1,0xa,0xb,0xc,0xd,0xe,0xf,-1,-1,-1,-1,-1,-1,-1,-1,-1,
+  -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
+  -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
+  -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
+  -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
+  -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
+  -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
+  -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
+  -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
+  -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1, };
+
+signed char HexDigit(char c)
+{
+    return p_util_hexdigit[(unsigned char)c];
+}
+
+bool IsHex(const string& str)
+{
+    for(std::string::const_iterator it(str.begin()); it != str.end(); ++it)
+    {
+        if (HexDigit(*it) < 0)
+            return false;
+    }
+    return (str.size() > 0) && (str.size()%2 == 0);
+}
+
+vector<unsigned char> ParseHex(const char* psz)
+{
+    // convert hex dump to vector
+    vector<unsigned char> vch;
+    while (true)
+    {
+        while (isspace(*psz))
+            psz++;
+        signed char c = HexDigit(*psz++);
+        if (c == (signed char)-1)
+            break;
+        unsigned char n = (c << 4);
+        c = HexDigit(*psz++);
+        if (c == (signed char)-1)
+            break;
+        n |= c;
+        vch.push_back(n);
+    }
+    return vch;
+}
+
+vector<unsigned char> ParseHex(const string& str)
+{
+    return ParseHex(str.c_str());
+}
+
+string EncodeBase64(const unsigned char* pch, size_t len)
+{
+    static const char *pbase64 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+
+    std::string str;
+    str.reserve(((len + 2) / 3) * 4);
+    ConvertBits<8, 6, true>([&](int v) { str += pbase64[v]; }, pch, pch + len);
+    while (str.size() % 4) str += '=';
+    return str;
+}
+
+string EncodeBase64(const string& str)
+{
+    return EncodeBase64((const unsigned char*)str.c_str(), str.size());
+}
+
+vector<unsigned char> DecodeBase64(const char* p, bool* pfInvalid)
+{
+    static const int decode64_table[256] =
+    {
+        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+        -1, -1, -1, 62, -1, -1, -1, 63, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, -1, -1,
+        -1, -1, -1, -1, -1,  0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14,
+        15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, -1, -1, 26, 27, 28,
+        29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48,
+        49, 50, 51, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1
+    };
+
+    const char* e = p;
+    std::vector<uint8_t> val;
+    val.reserve(strlen(p));
+    while (*p != 0) {
+        int x = decode64_table[(unsigned char)*p];
+        if (x == -1) break;
+        val.push_back(x);
+        ++p;
+    }
+
+    std::vector<unsigned char> ret;
+    ret.reserve((val.size() * 3) / 4);
+    bool valid = ConvertBits<6, 8, false>([&](unsigned char c) { ret.push_back(c); }, val.begin(), val.end());
+
+    const char* q = p;
+    while (valid && *p != 0) {
+        if (*p != '=') {
+            valid = false;
+            break;
+        }
+        ++p;
+    }
+    valid = valid && (p - e) % 4 == 0 && p - q < 4;
+    if (pfInvalid) *pfInvalid = !valid;
+
+    return ret;
+}
+
+string DecodeBase64(const string& str)
+{
+    vector<unsigned char> vchRet = DecodeBase64(str.c_str());
+    return (vchRet.size() == 0) ? string() : string((const char*)&vchRet[0], vchRet.size());
+}
+
+string EncodeBase32(const unsigned char* pch, size_t len)
+{
+    static const char *pbase32 = "abcdefghijklmnopqrstuvwxyz234567";
+
+    std::string str;
+    str.reserve(((len + 4) / 5) * 8);
+    ConvertBits<8, 5, true>([&](int v) { str += pbase32[v]; }, pch, pch + len);
+    while (str.size() % 8) str += '=';
+    return str;
+}
+
+string EncodeBase32(const string& str)
+{
+    return EncodeBase32((const unsigned char*)str.c_str(), str.size());
+}
+
+vector<unsigned char> DecodeBase32(const char* p, bool* pfInvalid)
+{
+    static const int decode32_table[256] =
+    {
+        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 26, 27, 28, 29, 30, 31, -1, -1, -1, -1,
+        -1, -1, -1, -1, -1,  0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14,
+        15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, -1, -1, -1, -1, -1, -1,  0,  1,  2,
+         3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22,
+        23, 24, 25, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
+        -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1
+    };
+
+    const char* e = p;
+    std::vector<uint8_t> val;
+    val.reserve(strlen(p));
+    while (*p != 0) {
+        int x = decode32_table[(unsigned char)*p];
+        if (x == -1) break;
+        val.push_back(x);
+        ++p;
+    }
+
+    std::vector<unsigned char> ret;
+    ret.reserve((val.size() * 5) / 8);
+    bool valid = ConvertBits<5, 8, false>([&](unsigned char c) { ret.push_back(c); }, val.begin(), val.end());
+
+    const char* q = p;
+    while (valid && *p != 0) {
+        if (*p != '=') {
+            valid = false;
+            break;
+        }
+        ++p;
+    }
+    valid = valid && (p - e) % 8 == 0 && p - q < 8;
+    if (pfInvalid) *pfInvalid = !valid;
+
+    return ret;
+}
+
+string DecodeBase32(const string& str)
+{
+    vector<unsigned char> vchRet = DecodeBase32(str.c_str());
+    return (vchRet.size() == 0) ? string() : string((const char*)&vchRet[0], vchRet.size());
+}
+
+static bool ParsePrechecks(const std::string& str)
+{
+    if (str.empty()) // No empty string allowed
+        return false;
+    if (str.size() >= 1 && (isspace(str[0]) || isspace(str[str.size()-1]))) // No padding allowed
+        return false;
+    if (str.size() != strlen(str.c_str())) // No embedded NUL characters allowed
+        return false;
+    return true;
+}
+
+bool ParseInt32(const std::string& str, int32_t *out)
+{
+    if (!ParsePrechecks(str))
+        return false;
+    char *endp = NULL;
+    errno = 0; // strtol will not set errno if valid
+    long int n = strtol(str.c_str(), &endp, 10);
+    if(out) *out = (int32_t)n;
+    // Note that strtol returns a *long int*, so even if strtol doesn't report an over/underflow
+    // we still have to check that the returned value is within the range of an *int32_t*. On 64-bit
+    // platforms the size of these types may be different.
+    return endp && *endp == 0 && !errno &&
+        n >= std::numeric_limits<int32_t>::min() &&
+        n <= std::numeric_limits<int32_t>::max();
+}
+
+bool ParseInt64(const std::string& str, int64_t *out)
+{
+    if (!ParsePrechecks(str))
+        return false;
+    char *endp = NULL;
+    errno = 0; // strtoll will not set errno if valid
+    long long int n = strtoll(str.c_str(), &endp, 10);
+    if(out) *out = (int64_t)n;
+    // Note that strtoll returns a *long long int*, so even if strtol doesn't report an over/underflow
+    // we still have to check that the returned value is within the range of an *int64_t*.
+    return endp && *endp == 0 && !errno &&
+        n >= std::numeric_limits<int64_t>::min() &&
+        n <= std::numeric_limits<int64_t>::max();
+}
+
+bool ParseDouble(const std::string& str, double *out)
+{
+    if (!ParsePrechecks(str))
+        return false;
+    if (str.size() >= 2 && str[0] == '0' && str[1] == 'x') // No hexadecimal floats allowed
+        return false;
+    std::istringstream text(str);
+    text.imbue(std::locale::classic());
+    double result;
+    text >> result;
+    if(out) *out = result;
+    return text.eof() && !text.fail();
+}
+
+std::string FormatParagraph(const std::string& in, size_t width, size_t indent)
+{
+    std::stringstream out;
+    size_t col = 0;
+    size_t ptr = 0;
+    while(ptr < in.size())
+    {
+        // Find beginning of next word
+        ptr = in.find_first_not_of(' ', ptr);
+        if (ptr == std::string::npos)
+            break;
+        // Find end of next word
+        size_t endword = in.find_first_of(' ', ptr);
+        if (endword == std::string::npos)
+            endword = in.size();
+        // Add newline and indentation if this wraps over the allowed width
+        if (col > 0)
+        {
+            if ((col + endword - ptr) > width)
+            {
+                out << '\n';
+                for(size_t i=0; i<indent; ++i)
+                    out << ' ';
+                col = 0;
+            } else
+                out << ' ';
+        }
+        // Append word
+        out << in.substr(ptr, endword - ptr);
+        col += endword - ptr + 1;
+        ptr = endword;
+    }
+    return out.str();
+}
+
+std::string i64tostr(int64_t n)
+{
+    return strprintf("%d", n);
+}
+
+std::string itostr(int n)
+{
+    return strprintf("%d", n);
+}
+
+int64_t atoi64(const char* psz)
+{
+#ifdef _MSC_VER
+    return _atoi64(psz);
+#else
+    return strtoll(psz, NULL, 10);
+#endif
+}
+
+int64_t atoi64(const std::string& str)
+{
+#ifdef _MSC_VER
+    return _atoi64(str.c_str());
+#else
+    return strtoll(str.c_str(), NULL, 10);
+#endif
+}
+
+int atoi(const std::string& str)
+{
+    return atoi(str.c_str());
+}
+
+/** Upper bound for mantissa.
+ * 10^18-1 is the largest arbitrary decimal that will fit in a signed 64-bit integer.
+ * Larger integers cannot consist of arbitrary combinations of 0-9:
+ *
+ *   999999999999999999  1^18-1
+ *  9223372036854775807  (1<<63)-1  (max int64_t)
+ *  9999999999999999999  1^19-1     (would overflow)
+ */
+static const int64_t UPPER_BOUND = 1000000000000000000LL - 1LL;
+
+/** Helper function for ParseFixedPoint */
+static inline bool ProcessMantissaDigit(char ch, int64_t &mantissa, int &mantissa_tzeros)
+{
+    if(ch == '0')
+        ++mantissa_tzeros;
+    else {
+        for (int i=0; i<=mantissa_tzeros; ++i) {
+            if (mantissa > (UPPER_BOUND / 10LL))
+                return false; /* overflow */
+            mantissa *= 10;
+        }
+        mantissa += ch - '0';
+        mantissa_tzeros = 0;
+    }
+    return true;
+}
+
+bool ParseFixedPoint(const std::string &val, int decimals, int64_t *amount_out)
+{
+    int64_t mantissa = 0;
+    int64_t exponent = 0;
+    int mantissa_tzeros = 0;
+    bool mantissa_sign = false;
+    bool exponent_sign = false;
+    int ptr = 0;
+    int end = val.size();
+    int point_ofs = 0;
+
+    if (ptr < end && val[ptr] == '-') {
+        mantissa_sign = true;
+        ++ptr;
+    }
+    if (ptr < end)
+    {
+        if (val[ptr] == '0') {
+            /* pass single 0 */
+            ++ptr;
+        } else if (val[ptr] >= '1' && val[ptr] <= '9') {
+            while (ptr < end && val[ptr] >= '0' && val[ptr] <= '9') {
+                if (!ProcessMantissaDigit(val[ptr], mantissa, mantissa_tzeros))
+                    return false; /* overflow */
+                ++ptr;
+            }
+        } else return false; /* missing expected digit */
+    } else return false; /* empty string or loose '-' */
+    if (ptr < end && val[ptr] == '.')
+    {
+        ++ptr;
+        if (ptr < end && val[ptr] >= '0' && val[ptr] <= '9')
+        {
+            while (ptr < end && val[ptr] >= '0' && val[ptr] <= '9') {
+                if (!ProcessMantissaDigit(val[ptr], mantissa, mantissa_tzeros))
+                    return false; /* overflow */
+                ++ptr;
+                ++point_ofs;
+            }
+        } else return false; /* missing expected digit */
+    }
+    if (ptr < end && (val[ptr] == 'e' || val[ptr] == 'E'))
+    {
+        ++ptr;
+        if (ptr < end && val[ptr] == '+')
+            ++ptr;
+        else if (ptr < end && val[ptr] == '-') {
+            exponent_sign = true;
+            ++ptr;
+        }
+        if (ptr < end && val[ptr] >= '0' && val[ptr] <= '9') {
+            while (ptr < end && val[ptr] >= '0' && val[ptr] <= '9') {
+                if (exponent > (UPPER_BOUND / 10LL))
+                    return false; /* overflow */
+                exponent = exponent * 10 + val[ptr] - '0';
+                ++ptr;
+            }
+        } else return false; /* missing expected digit */
+    }
+    if (ptr != end)
+        return false; /* trailing garbage */
+
+    /* finalize exponent */
+    if (exponent_sign)
+        exponent = -exponent;
+    exponent = exponent - point_ofs + mantissa_tzeros;
+
+    /* finalize mantissa */
+    if (mantissa_sign)
+        mantissa = -mantissa;
+
+    /* convert to one 64-bit fixed-point value */
+    exponent += decimals;
+    if (exponent < 0)
+        return false; /* cannot represent values smaller than 10^-decimals */
+    if (exponent >= 18)
+        return false; /* cannot represent values larger than or equal to 10^(18-decimals) */
+
+    for (int i=0; i < exponent; ++i) {
+        if (mantissa > (UPPER_BOUND / 10LL) || mantissa < -(UPPER_BOUND / 10LL))
+            return false; /* overflow */
+        mantissa *= 10;
+    }
+    if (mantissa > UPPER_BOUND || mantissa < -UPPER_BOUND)
+        return false; /* overflow */
+
+    if (amount_out)
+        *amount_out = mantissa;
+
+    return true;
+}
+
+/// Parse the decimal string into a little-endian byte vector.
+std::optional<std::vector<uint8_t>> ParseArbitraryInt(const std::string& num_string)
+{
+    std::vector<unsigned char> result;
+    const size_t start = num_string.find_first_not_of(WHITESPACE);
+    if (start == std::string::npos) return std::nullopt;
+    const size_t end = num_string.find_last_not_of(WHITESPACE);
+    assert(end != std::string::npos);
+    for (char c : num_string.substr(start, end-start+1)) {
+        if (c < '0' || c > '9') {
+            return std::nullopt;
+        }
+        uint16_t v = c - '0';
+        for (auto& r : result) {
+            v += r * 10;
+            r = v & 0xFF;   // store low byte of the value
+            v >>= 8;        // carry to the next result position
+        }
+        if (v > 0) result.push_back(v);
+    }
+    return result;
+}
+
+std::string ArbitraryIntStr(std::vector<uint8_t> bytes)
+{
+    // Only serialize up to the most significant non-zero byte.
+    size_t end = bytes.size();
+    for (; end > 0  && bytes[end - 1] == 0; --end) {}
+
+    std::string result;
+    while (end > 0) {
+        // "Divide" bytes by 10.
+        uint16_t rem = 0;
+        for (int i = end - 1; i >= 0; --i) {
+            uint16_t tmp = rem * 256 + bytes[i];
+            rem = tmp % 10;
+            auto b = tmp / 10;
+            assert(b < 256);
+            bytes[i] = b;
+        }
+
+        // Write out the remainder as the next lowest digit.
+        result = tfm::format("%d%s", rem, result);
+
+        // If we've moved all the bits out of the MSB, drop it.
+        if (bytes[end - 1] == 0) {
+            end--;
+        }
+    }
+
+    // Handle the all-zero bytes case.
+    if (result.empty()) {
+        return "0";
+    } else {
+        return result;
+    }
+}
diff --git a/depend/zcash/src/utilstrencodings.h b/depend/zcash/src/utilstrencodings.h
new file mode 100644
index 000000000..22cd6b67f
--- /dev/null
+++ b/depend/zcash/src/utilstrencodings.h
@@ -0,0 +1,176 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+/**
+ * Utilities for converting data from/to strings.
+ */
+#ifndef BITCOIN_UTILSTRENCODINGS_H
+#define BITCOIN_UTILSTRENCODINGS_H
+
+#include <stdint.h>
+#include <string>
+#include <vector>
+#include <optional>
+
+constexpr char WHITESPACE[] = " \t";
+
+#define BEGIN(a)            ((char*)&(a))
+#define END(a)              ((char*)&((&(a))[1]))
+#define UBEGIN(a)           ((unsigned char*)&(a))
+#define UEND(a)             ((unsigned char*)&((&(a))[1]))
+#define ARRAYLEN(array)     (sizeof(array)/sizeof((array)[0]))
+
+/** Used by SanitizeString() */
+enum SafeChars
+{
+    SAFE_CHARS_DEFAULT, //!< The full set of allowed chars
+    SAFE_CHARS_UA_COMMENT, //!< BIP-0014 subset
+    SAFE_CHARS_SUBVERSION //!< Peer subversion string subset
+};
+
+std::string SanitizeFilename(const std::string& str);
+/**
+* Remove unsafe chars. Safe chars chosen to allow simple messages/URLs/email
+* addresses, but avoid anything even possibly remotely dangerous like & or >
+* @param[in] str    The string to sanitize
+* @param[in] rule   The set of safe chars to choose (default: least restrictive)
+* @return           A new string without unsafe chars
+*/
+std::string SanitizeString(const std::string& str, int rule = SAFE_CHARS_DEFAULT);
+std::string HexInt(uint32_t val);
+uint32_t ParseHexToUInt32(const std::string& str);
+std::vector<unsigned char> ParseHex(const char* psz);
+std::vector<unsigned char> ParseHex(const std::string& str);
+signed char HexDigit(char c);
+bool IsHex(const std::string& str);
+std::vector<unsigned char> DecodeBase64(const char* p, bool* pfInvalid = NULL);
+std::string DecodeBase64(const std::string& str);
+std::string EncodeBase64(const unsigned char* pch, size_t len);
+std::string EncodeBase64(const std::string& str);
+std::vector<unsigned char> DecodeBase32(const char* p, bool* pfInvalid = NULL);
+std::string DecodeBase32(const std::string& str);
+std::string EncodeBase32(const unsigned char* pch, size_t len);
+std::string EncodeBase32(const std::string& str);
+
+std::string i64tostr(int64_t n);
+std::string itostr(int n);
+int64_t atoi64(const char* psz);
+int64_t atoi64(const std::string& str);
+int atoi(const std::string& str);
+
+/**
+ * Convert string to signed 32-bit integer with strict parse error feedback.
+ * @returns true if the entire string could be parsed as valid integer,
+ *   false if not the entire string could be parsed or when overflow or underflow occurred.
+ */
+bool ParseInt32(const std::string& str, int32_t *out);
+
+/**
+ * Convert string to signed 64-bit integer with strict parse error feedback.
+ * @returns true if the entire string could be parsed as valid integer,
+ *   false if not the entire string could be parsed or when overflow or underflow occurred.
+ */
+bool ParseInt64(const std::string& str, int64_t *out);
+
+/**
+ * Convert string to double with strict parse error feedback.
+ * @returns true if the entire string could be parsed as valid double,
+ *   false if not the entire string could be parsed or when overflow or underflow occurred.
+ */
+bool ParseDouble(const std::string& str, double *out);
+
+template<typename T>
+std::string HexStr(const T itbegin, const T itend, bool fSpaces=false)
+{
+    std::string rv;
+    static const char hexmap[16] = { '0', '1', '2', '3', '4', '5', '6', '7',
+                                     '8', '9', 'a', 'b', 'c', 'd', 'e', 'f' };
+    rv.reserve((itend-itbegin)*3);
+    for(T it = itbegin; it < itend; ++it)
+    {
+        unsigned char val = (unsigned char)(*it);
+        if(fSpaces && it != itbegin)
+            rv.push_back(' ');
+        rv.push_back(hexmap[val>>4]);
+        rv.push_back(hexmap[val&15]);
+    }
+
+    return rv;
+}
+
+template<typename T>
+inline std::string HexStr(const T& vch, bool fSpaces=false)
+{
+    return HexStr(vch.begin(), vch.end(), fSpaces);
+}
+
+/**
+ * Format a paragraph of text to a fixed width, adding spaces for
+ * indentation to any added line.
+ */
+std::string FormatParagraph(const std::string& in, size_t width = 79, size_t indent = 0);
+
+/**
+ * Timing-attack-resistant comparison.
+ * Takes time proportional to length
+ * of first argument.
+ */
+template <typename T>
+bool TimingResistantEqual(const T& a, const T& b)
+{
+    if (b.size() == 0) return a.size() == 0;
+    size_t accumulator = a.size() ^ b.size();
+    for (size_t i = 0; i < a.size(); i++)
+        accumulator |= a[i] ^ b[i%b.size()];
+    return accumulator == 0;
+}
+
+/** Parse number as fixed point according to JSON number syntax.
+ * See https://web.archive.org/web/20190804092921/https://www.json.org/number.gif
+ * @returns true on success, false on error.
+ * @note The result must be in the range (-10^18,10^18), otherwise an overflow error will trigger.
+ */
+bool ParseFixedPoint(const std::string &val, int decimals, int64_t *amount_out);
+
+/**
+ * Convert from one power-of-2 number base to another.
+ *
+ * Examples using ConvertBits<8, 5, true>():
+ * 000000 -> 0000000000
+ * 202020 -> 0400100200
+ * 757575 -> 0e151a170a
+ * abcdef -> 150f061e1e
+ * ffffff -> 1f1f1f1f1e
+ */
+template<int frombits, int tobits, bool pad, typename O, typename I>
+bool ConvertBits(const O& outfn, I it, I end) {
+    size_t acc = 0;
+    size_t bits = 0;
+    constexpr size_t maxv = (1 << tobits) - 1;
+    constexpr size_t max_acc = (1 << (frombits + tobits - 1)) - 1;
+    while (it != end) {
+        acc = ((acc << frombits) | *it) & max_acc;
+        bits += frombits;
+        while (bits >= tobits) {
+            bits -= tobits;
+            outfn((acc >> bits) & maxv);
+        }
+        ++it;
+    }
+    if (pad) {
+        if (bits) outfn((acc << (tobits - bits)) & maxv);
+    } else if (bits >= frombits || ((acc << (tobits - bits)) & maxv)) {
+        return false;
+    }
+    return true;
+}
+
+std::optional<std::vector<uint8_t>> ParseArbitraryInt(const std::string& s);
+/**
+ * Serializes the given little-endian byte iterator to a decimal string.
+ */
+std::string ArbitraryIntStr(std::vector<uint8_t> i);
+
+#endif // BITCOIN_UTILSTRENCODINGS_H
diff --git a/depend/zcash/src/utiltest.cpp b/depend/zcash/src/utiltest.cpp
new file mode 100644
index 000000000..36d1846d3
--- /dev/null
+++ b/depend/zcash/src/utiltest.cpp
@@ -0,0 +1,365 @@
+// Copyright (c) 2016 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "utiltest.h"
+
+#include "consensus/upgrades.h"
+#include "transaction_builder.h"
+
+#include <array>
+#include <optional>
+
+#include <rust/ed25519.h>
+
+// Sprout
+CMutableTransaction GetValidSproutReceiveTransaction(
+                                const libzcash::SproutSpendingKey& sk,
+                                CAmount value,
+                                bool randomInputs,
+                                uint32_t versionGroupId, /* = SAPLING_VERSION_GROUP_ID */
+                                int32_t version /* = SAPLING_TX_VERSION */) {
+    // We removed the ability to create pre-Sapling Sprout transactions
+    assert(version >= SAPLING_TX_VERSION);
+
+    CMutableTransaction mtx;
+    mtx.fOverwintered = true;
+    mtx.nVersionGroupId = versionGroupId;
+    mtx.nVersion = version;
+    mtx.vin.resize(2);
+    if (randomInputs) {
+        mtx.vin[0].prevout.hash = GetRandHash();
+        mtx.vin[1].prevout.hash = GetRandHash();
+    } else {
+        mtx.vin[0].prevout.hash = uint256S("0000000000000000000000000000000000000000000000000000000000000001");
+        mtx.vin[1].prevout.hash = uint256S("0000000000000000000000000000000000000000000000000000000000000002");
+    }
+    mtx.vin[0].prevout.n = 0;
+    mtx.vin[1].prevout.n = 0;
+    std::vector<CTxOut> allPrevOutputs;
+    allPrevOutputs.resize(mtx.vin.size());
+
+    // Generate an ephemeral keypair.
+    Ed25519SigningKey joinSplitPrivKey;
+    ed25519_generate_keypair(&joinSplitPrivKey, &mtx.joinSplitPubKey);
+
+    std::array<libzcash::JSInput, 2> inputs = {
+        libzcash::JSInput(), // dummy input
+        libzcash::JSInput() // dummy input
+    };
+
+    std::array<libzcash::JSOutput, 2> outputs = {
+        libzcash::JSOutput(sk.address(), value),
+        libzcash::JSOutput(sk.address(), value)
+    };
+
+    // Prepare JoinSplits
+    uint256 rt;
+    auto jsdesc = JSDescriptionInfo(mtx.joinSplitPubKey, rt,
+                          inputs, outputs, 2*value, 0).BuildDeterministic(false);
+    mtx.vJoinSplit.push_back(jsdesc);
+
+    // Consider: The following is a bit misleading (given the name of this function)
+    // and should perhaps be changed, but currently a few tests in test_wallet.cpp
+    // depend on this happening.
+    if (version >= 4) {
+        // Shielded Output
+        OutputDescription od;
+        mtx.vShieldedOutput.push_back(od);
+    }
+
+    // Empty output script.
+    uint32_t consensusBranchId = SPROUT_BRANCH_ID;
+    CScript scriptCode;
+    CTransaction signTx(mtx);
+    const PrecomputedTransactionData txdata(signTx, allPrevOutputs);
+    uint256 dataToBeSigned = SignatureHash(scriptCode, signTx, NOT_AN_INPUT, SIGHASH_ALL, 0, consensusBranchId, txdata);
+
+    // Add the signature
+    assert(ed25519_sign(
+        &joinSplitPrivKey,
+        dataToBeSigned.begin(), 32,
+        &mtx.joinSplitSig));
+
+    return mtx;
+}
+
+CWalletTx GetValidSproutReceive(const libzcash::SproutSpendingKey& sk,
+                                CAmount value,
+                                bool randomInputs,
+                                uint32_t versionGroupId, /* = SAPLING_VERSION_GROUP_ID */
+                                int32_t version /* = SAPLING_TX_VERSION */)
+{
+    CMutableTransaction mtx = GetValidSproutReceiveTransaction(
+        sk, value, randomInputs, versionGroupId, version
+    );
+    CTransaction tx {mtx};
+    CWalletTx wtx {NULL, tx};
+    return wtx;
+}
+
+CWalletTx GetInvalidCommitmentSproutReceive(
+                                const libzcash::SproutSpendingKey& sk,
+                                CAmount value,
+                                bool randomInputs,
+                                uint32_t versionGroupId, /* = SAPLING_VERSION_GROUP_ID */
+                                int32_t version /* = SAPLING_TX_VERSION */)
+{
+    CMutableTransaction mtx = GetValidSproutReceiveTransaction(
+        sk, value, randomInputs, versionGroupId, version
+    );
+    mtx.vJoinSplit[0].commitments[0] = uint256();
+    mtx.vJoinSplit[0].commitments[1] = uint256();
+    CTransaction tx {mtx};
+    CWalletTx wtx {NULL, tx};
+    return wtx;
+}
+
+libzcash::SproutNote GetSproutNote(const libzcash::SproutSpendingKey& sk,
+                                   const CTransaction& tx, size_t js, size_t n) {
+    ZCNoteDecryption decryptor {sk.receiving_key()};
+    auto hSig = ZCJoinSplit::h_sig(
+        tx.vJoinSplit[js].randomSeed,
+        tx.vJoinSplit[js].nullifiers,
+        tx.joinSplitPubKey);
+    auto note_pt = libzcash::SproutNotePlaintext::decrypt(
+        decryptor,
+        tx.vJoinSplit[js].ciphertexts[n],
+        tx.vJoinSplit[js].ephemeralKey,
+        hSig,
+        (unsigned char) n);
+    return note_pt.note(sk.address());
+}
+
+CWalletTx GetValidSproutSpend(const libzcash::SproutSpendingKey& sk,
+                              const libzcash::SproutNote& note,
+                              CAmount value) {
+    CMutableTransaction mtx;
+    mtx.fOverwintered = true;
+    mtx.nVersionGroupId = SAPLING_VERSION_GROUP_ID;
+    mtx.nVersion = SAPLING_TX_VERSION;
+    mtx.vout.resize(2);
+    mtx.vout[0].nValue = value;
+    mtx.vout[1].nValue = 0;
+
+    // Generate an ephemeral keypair.
+    Ed25519SigningKey joinSplitPrivKey;
+    ed25519_generate_keypair(&joinSplitPrivKey, &mtx.joinSplitPubKey);
+
+    // Fake tree for the unused witness
+    SproutMerkleTree tree;
+
+    libzcash::JSOutput dummyout;
+    libzcash::JSInput dummyin;
+
+    {
+        if (note.value() > value) {
+            libzcash::SproutSpendingKey dummykey = libzcash::SproutSpendingKey::random();
+            libzcash::SproutPaymentAddress dummyaddr = dummykey.address();
+            dummyout = libzcash::JSOutput(dummyaddr, note.value() - value);
+        } else if (note.value() < value) {
+            libzcash::SproutSpendingKey dummykey = libzcash::SproutSpendingKey::random();
+            libzcash::SproutPaymentAddress dummyaddr = dummykey.address();
+            libzcash::SproutNote dummynote(dummyaddr.a_pk, (value - note.value()), uint256(), uint256());
+            tree.append(dummynote.cm());
+            dummyin = libzcash::JSInput(tree.witness(), dummynote, dummykey);
+        }
+    }
+
+    tree.append(note.cm());
+
+    std::array<libzcash::JSInput, 2> inputs = {
+        libzcash::JSInput(tree.witness(), note, sk),
+        dummyin
+    };
+
+    std::array<libzcash::JSOutput, 2> outputs = {
+        dummyout, // dummy output
+        libzcash::JSOutput() // dummy output
+    };
+
+    // Prepare JoinSplits
+    uint256 rt = tree.root();
+    auto jsdesc = JSDescriptionInfo(mtx.joinSplitPubKey, rt,
+                          inputs, outputs, 0, value).BuildDeterministic(false);
+    mtx.vJoinSplit.push_back(jsdesc);
+
+    // Empty output script.
+    uint32_t consensusBranchId = SPROUT_BRANCH_ID;
+    CScript scriptCode;
+    CTransaction signTx(mtx);
+    assert(signTx.vin.size() == 0);
+    const PrecomputedTransactionData txdata(signTx, {});
+    uint256 dataToBeSigned = SignatureHash(scriptCode, signTx, NOT_AN_INPUT, SIGHASH_ALL, 0, consensusBranchId, txdata);
+
+    // Add the signature
+    assert(ed25519_sign(
+        &joinSplitPrivKey,
+        dataToBeSigned.begin(), 32,
+        &mtx.joinSplitSig));
+    CTransaction tx {mtx};
+    CWalletTx wtx {NULL, tx};
+    return wtx;
+}
+
+const CChainParams& RegtestActivateOverwinter() {
+    SelectParams(CBaseChainParams::REGTEST);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+    return Params();
+}
+
+void RegtestDeactivateOverwinter() {
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+}
+
+// Sapling
+const Consensus::Params& RegtestActivateSapling() {
+    SelectParams(CBaseChainParams::REGTEST);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_SAPLING, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+    return Params().GetConsensus();
+}
+
+void RegtestDeactivateSapling() {
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_SAPLING, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+}
+
+const CChainParams& RegtestActivateBlossom(bool updatePow, int blossomActivationHeight) {
+    SelectParams(CBaseChainParams::REGTEST);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_SAPLING, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_BLOSSOM, blossomActivationHeight);
+    if (updatePow) {
+        UpdateRegtestPow(32, 16, uint256S("0007ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff"), false);
+    }
+    return Params();
+}
+
+void RegtestDeactivateBlossom() {
+    UpdateRegtestPow(0, 0, uint256S("0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f"), true);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_BLOSSOM, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_SAPLING, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+    SelectParams(CBaseChainParams::MAIN);
+}
+
+const Consensus::Params& RegtestActivateHeartwood(bool updatePow, int heartwoodActivationHeight) {
+    SelectParams(CBaseChainParams::REGTEST);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_SAPLING, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_BLOSSOM, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_HEARTWOOD, heartwoodActivationHeight);
+    if (updatePow) {
+        UpdateRegtestPow(32, 16, uint256S("0007ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff"), false);
+    }
+    return Params().GetConsensus();
+}
+
+void RegtestDeactivateHeartwood() {
+    UpdateRegtestPow(0, 0, uint256S("0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f"), true);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_HEARTWOOD, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_BLOSSOM, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_SAPLING, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+    SelectParams(CBaseChainParams::MAIN);
+}
+
+const Consensus::Params& RegtestActivateCanopy(bool updatePow, int canopyActivationHeight) {
+    SelectParams(CBaseChainParams::REGTEST);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_SAPLING, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_BLOSSOM, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_HEARTWOOD, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_CANOPY, canopyActivationHeight);
+    if (updatePow) {
+        UpdateRegtestPow(32, 16, uint256S("0007ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff"), false);
+    }
+    return Params().GetConsensus();
+}
+
+const Consensus::Params& RegtestActivateCanopy() {
+    return RegtestActivateCanopy(false, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+}
+
+void RegtestDeactivateCanopy() {
+    UpdateRegtestPow(0, 0, uint256S("0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f"), true);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_CANOPY, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_HEARTWOOD, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_BLOSSOM, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_SAPLING, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+    SelectParams(CBaseChainParams::MAIN);
+}
+
+const Consensus::Params& RegtestActivateNU5(bool updatePow, int nu5ActivationHeight) {
+    SelectParams(CBaseChainParams::REGTEST);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_SAPLING, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_BLOSSOM, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_HEARTWOOD, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_CANOPY, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_NU5, nu5ActivationHeight);
+    if (updatePow) {
+        UpdateRegtestPow(32, 16, uint256S("0007ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff"), false);
+    }
+    return Params().GetConsensus();
+}
+
+const Consensus::Params& RegtestActivateNU5() {
+    return RegtestActivateNU5(false, Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+}
+
+void RegtestDeactivateNU5() {
+    UpdateRegtestPow(0, 0, uint256S("0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f0f"), true);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_NU5, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_CANOPY, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_HEARTWOOD, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_BLOSSOM, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_SAPLING, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+    UpdateNetworkUpgradeParameters(Consensus::UPGRADE_OVERWINTER, Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT);
+    SelectParams(CBaseChainParams::MAIN);
+}
+
+libzcash::SaplingExtendedSpendingKey GetTestMasterSaplingSpendingKey() {
+    SecureString mnemonic("abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon art");
+    auto seed{MnemonicSeed::ForPhrase(English, mnemonic).value()};
+    return libzcash::SaplingExtendedSpendingKey::Master(seed);
+}
+
+CKey AddTestCKeyToKeyStore(CBasicKeyStore& keyStore) {
+    KeyIO keyIO(Params());
+    CKey tsk = keyIO.DecodeSecret(T_SECRET_REGTEST);
+    keyStore.AddKey(tsk);
+    return tsk;
+}
+
+TestSaplingNote GetTestSaplingNote(const libzcash::SaplingPaymentAddress& pa, CAmount value) {
+    // Generate dummy Sapling note
+    libzcash::SaplingNote note(pa, value, libzcash::Zip212Enabled::BeforeZip212);
+    uint256 cm = note.cmu().value();
+    SaplingMerkleTree tree;
+    tree.append(cm);
+    return { note, tree };
+}
+
+CWalletTx GetValidSaplingReceive(const Consensus::Params& consensusParams,
+                                 CBasicKeyStore& keyStore,
+                                 const libzcash::SaplingExtendedSpendingKey &sk,
+                                 CAmount value) {
+    // From taddr
+    CKey tsk = AddTestCKeyToKeyStore(keyStore);
+    auto scriptPubKey = GetScriptForDestination(tsk.GetPubKey().GetID());
+    // To zaddr
+    auto fvk = sk.expsk.full_viewing_key();
+    auto pa = sk.ToXFVK().DefaultAddress();
+
+    auto builder = TransactionBuilder(consensusParams, 1, std::nullopt, &keyStore);
+    builder.SetFee(0);
+    builder.AddTransparentInput(COutPoint(), scriptPubKey, value);
+    builder.AddSaplingOutput(fvk.ovk, pa, value, {});
+
+    CTransaction tx = builder.Build().GetTxOrThrow();
+    CWalletTx wtx {NULL, tx};
+    return wtx;
+}
diff --git a/depend/zcash/src/utiltest.h b/depend/zcash/src/utiltest.h
new file mode 100644
index 000000000..5c89c3a29
--- /dev/null
+++ b/depend/zcash/src/utiltest.h
@@ -0,0 +1,103 @@
+// Copyright (c) 2016 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_UTILTEST_H
+#define ZCASH_UTILTEST_H
+
+#include "coins.h"
+#include "key_io.h"
+#include "wallet/wallet.h"
+#include "zcash/Address.hpp"
+#include "zcash/Note.hpp"
+#include "zcash/NoteEncryption.hpp"
+
+// A fake chain state view where anchors and nullifiers are assumed to exist.
+class AssumeShieldedInputsExistAndAreSpendable : public CCoinsView {
+public:
+    AssumeShieldedInputsExistAndAreSpendable() {}
+
+    bool GetSproutAnchorAt(const uint256 &rt, SproutMerkleTree &tree) const {
+        return true;
+    }
+
+    bool GetSaplingAnchorAt(const uint256 &rt, SaplingMerkleTree &tree) const {
+        return true;
+    }
+
+    bool GetOrchardAnchorAt(const uint256 &rt, OrchardMerkleFrontier &tree) const {
+        return true;
+    }
+
+    bool GetNullifier(const uint256 &nf, ShieldedType type) const {
+        // Always return false so we treat every nullifier as being unspent.
+        return false;
+    }
+};
+
+// Sprout
+CWalletTx GetValidSproutReceive(const libzcash::SproutSpendingKey& sk,
+                                CAmount value,
+                                bool randomInputs,
+                                uint32_t versionGroupId = SAPLING_VERSION_GROUP_ID,
+                                int32_t version = SAPLING_TX_VERSION);
+CWalletTx GetInvalidCommitmentSproutReceive(
+                                const libzcash::SproutSpendingKey& sk,
+                                CAmount value,
+                                bool randomInputs,
+                                uint32_t versionGroupId = SAPLING_VERSION_GROUP_ID,
+                                int32_t version = SAPLING_TX_VERSION);
+libzcash::SproutNote GetSproutNote(const libzcash::SproutSpendingKey& sk,
+                                   const CTransaction& tx, size_t js, size_t n);
+CWalletTx GetValidSproutSpend(const libzcash::SproutSpendingKey& sk,
+                              const libzcash::SproutNote& note,
+                              CAmount value);
+
+// Sapling
+static const std::string T_SECRET_REGTEST = "cND2ZvtabDbJ1gucx9GWH6XT9kgTAqfb6cotPt5Q5CyxVDhid2EN";
+
+struct TestSaplingNote {
+    libzcash::SaplingNote note;
+    SaplingMerkleTree tree;
+};
+
+const CChainParams& RegtestActivateOverwinter();
+void RegtestDeactivateOverwinter();
+
+const Consensus::Params& RegtestActivateSapling();
+
+void RegtestDeactivateSapling();
+
+const CChainParams& RegtestActivateBlossom(bool updatePow, int blossomActivationHeight = Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+
+void RegtestDeactivateBlossom();
+
+const Consensus::Params& RegtestActivateHeartwood(bool updatePow, int heartwoodActivationHeight = Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+
+void RegtestDeactivateHeartwood();
+
+const Consensus::Params& RegtestActivateCanopy(bool updatePow, int canopyActivationHeight = Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+const Consensus::Params& RegtestActivateCanopy();
+
+void RegtestDeactivateCanopy();
+
+const Consensus::Params& RegtestActivateNU5(bool updatePow, int nu5ActivationHeight = Consensus::NetworkUpgrade::ALWAYS_ACTIVE);
+const Consensus::Params& RegtestActivateNU5();
+
+void RegtestDeactivateNU5();
+
+libzcash::SaplingExtendedSpendingKey GetTestMasterSaplingSpendingKey();
+
+CKey AddTestCKeyToKeyStore(CBasicKeyStore& keyStore);
+
+/**
+ * Generate a dummy SaplingNote and a SaplingMerkleTree with that note's commitment.
+ */
+TestSaplingNote GetTestSaplingNote(const libzcash::SaplingPaymentAddress& pa, CAmount value);
+
+CWalletTx GetValidSaplingReceive(const Consensus::Params& consensusParams,
+                                 CBasicKeyStore& keyStore,
+                                 const libzcash::SaplingExtendedSpendingKey &sk,
+                                 CAmount value);
+
+#endif // ZCASH_UTILTEST_H
diff --git a/depend/zcash/src/utiltime.cpp b/depend/zcash/src/utiltime.cpp
new file mode 100644
index 000000000..17d51a2d6
--- /dev/null
+++ b/depend/zcash/src/utiltime.cpp
@@ -0,0 +1,60 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#if defined(HAVE_CONFIG_H)
+#include "config/bitcoin-config.h"
+#endif
+
+#include "utiltime.h"
+
+#include <chrono>
+#include <boost/date_time/posix_time/posix_time.hpp>
+#include <boost/thread.hpp>
+
+using namespace std;
+
+static int64_t nMockTime = 0; //!< For unit testing
+
+int64_t GetTime()
+{
+    if (nMockTime) return nMockTime;
+
+    return time(NULL);
+}
+
+void SetMockTime(int64_t nMockTimeIn)
+{
+    nMockTime = nMockTimeIn;
+}
+
+int64_t GetTimeMillis()
+{
+    return std::chrono::duration_cast<std::chrono::milliseconds>(
+            std::chrono::system_clock::now().time_since_epoch()).count();
+}
+
+int64_t GetTimeMicros()
+{
+    return std::chrono::duration_cast<std::chrono::microseconds>(
+            std::chrono::system_clock::now().time_since_epoch()).count();
+}
+
+void MilliSleep(int64_t n)
+{
+    // This is defined to be an interruption point.
+    // <https://www.boost.org/doc/libs/1_70_0/doc/html/thread/thread_management.html#interruption_points>
+    boost::this_thread::sleep_for(boost::chrono::milliseconds(n));
+}
+
+std::string DateTimeStrFormat(const char* pszFormat, int64_t nTime)
+{
+    static std::locale classic(std::locale::classic());
+    // std::locale takes ownership of the pointer
+    std::locale loc(classic, new boost::posix_time::time_facet(pszFormat));
+    std::stringstream ss;
+    ss.imbue(loc);
+    ss << boost::posix_time::from_time_t(nTime);
+    return ss.str();
+}
diff --git a/depend/zcash/src/utiltime.h b/depend/zcash/src/utiltime.h
new file mode 100644
index 000000000..b1267112e
--- /dev/null
+++ b/depend/zcash/src/utiltime.h
@@ -0,0 +1,20 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_UTILTIME_H
+#define BITCOIN_UTILTIME_H
+
+#include <stdint.h>
+#include <string>
+
+int64_t GetTime();
+int64_t GetTimeMillis();
+int64_t GetTimeMicros();
+void SetMockTime(int64_t nMockTimeIn);
+void MilliSleep(int64_t n);
+
+std::string DateTimeStrFormat(const char* pszFormat, int64_t nTime);
+
+#endif // BITCOIN_UTILTIME_H
diff --git a/depend/zcash/src/validationinterface.cpp b/depend/zcash/src/validationinterface.cpp
new file mode 100644
index 000000000..afd50bc6b
--- /dev/null
+++ b/depend/zcash/src/validationinterface.cpp
@@ -0,0 +1,276 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "validationinterface.h"
+
+#include "chainparams.h"
+#include "init.h"
+#include "main.h"
+#include "txmempool.h"
+#include "ui_interface.h"
+
+#include <boost/thread.hpp>
+
+#include <chrono>
+#include <thread>
+
+using namespace boost::placeholders;
+
+static CMainSignals g_signals;
+
+CMainSignals& GetMainSignals()
+{
+    return g_signals;
+}
+
+void RegisterValidationInterface(CValidationInterface* pwalletIn) {
+    g_signals.UpdatedBlockTip.connect(boost::bind(&CValidationInterface::UpdatedBlockTip, pwalletIn, _1));
+    g_signals.SyncTransaction.connect(boost::bind(&CValidationInterface::SyncTransaction, pwalletIn, _1, _2, _3));
+    g_signals.EraseTransaction.connect(boost::bind(&CValidationInterface::EraseFromWallet, pwalletIn, _1));
+    g_signals.UpdatedTransaction.connect(boost::bind(&CValidationInterface::UpdatedTransaction, pwalletIn, _1));
+    g_signals.ChainTip.connect(boost::bind(&CValidationInterface::ChainTip, pwalletIn, _1, _2, _3));
+    g_signals.Inventory.connect(boost::bind(&CValidationInterface::Inventory, pwalletIn, _1));
+    g_signals.Broadcast.connect(boost::bind(&CValidationInterface::ResendWalletTransactions, pwalletIn, _1));
+    g_signals.BlockChecked.connect(boost::bind(&CValidationInterface::BlockChecked, pwalletIn, _1, _2));
+    g_signals.AddressForMining.connect(boost::bind(&CValidationInterface::GetAddressForMining, pwalletIn, _1));
+    g_signals.BlockFound.connect(boost::bind(&CValidationInterface::ResetRequestCount, pwalletIn, _1));
+}
+
+void UnregisterValidationInterface(CValidationInterface* pwalletIn) {
+    g_signals.BlockFound.disconnect(boost::bind(&CValidationInterface::ResetRequestCount, pwalletIn, _1));
+    g_signals.AddressForMining.disconnect(boost::bind(&CValidationInterface::GetAddressForMining, pwalletIn, _1));
+    g_signals.BlockChecked.disconnect(boost::bind(&CValidationInterface::BlockChecked, pwalletIn, _1, _2));
+    g_signals.Broadcast.disconnect(boost::bind(&CValidationInterface::ResendWalletTransactions, pwalletIn, _1));
+    g_signals.Inventory.disconnect(boost::bind(&CValidationInterface::Inventory, pwalletIn, _1));
+    g_signals.ChainTip.disconnect(boost::bind(&CValidationInterface::ChainTip, pwalletIn, _1, _2, _3));
+    g_signals.UpdatedTransaction.disconnect(boost::bind(&CValidationInterface::UpdatedTransaction, pwalletIn, _1));
+    g_signals.EraseTransaction.disconnect(boost::bind(&CValidationInterface::EraseFromWallet, pwalletIn, _1));
+    g_signals.SyncTransaction.disconnect(boost::bind(&CValidationInterface::SyncTransaction, pwalletIn, _1, _2, _3));
+    g_signals.UpdatedBlockTip.disconnect(boost::bind(&CValidationInterface::UpdatedBlockTip, pwalletIn, _1));
+}
+
+void UnregisterAllValidationInterfaces() {
+    g_signals.BlockFound.disconnect_all_slots();
+    g_signals.AddressForMining.disconnect_all_slots();
+    g_signals.BlockChecked.disconnect_all_slots();
+    g_signals.Broadcast.disconnect_all_slots();
+    g_signals.Inventory.disconnect_all_slots();
+    g_signals.ChainTip.disconnect_all_slots();
+    g_signals.UpdatedTransaction.disconnect_all_slots();
+    g_signals.EraseTransaction.disconnect_all_slots();
+    g_signals.SyncTransaction.disconnect_all_slots();
+    g_signals.UpdatedBlockTip.disconnect_all_slots();
+}
+
+void SyncWithWallets(const CTransaction &tx, const CBlock *pblock, const int nHeight) {
+    g_signals.SyncTransaction(tx, pblock, nHeight);
+}
+
+struct CachedBlockData {
+    CBlockIndex *pindex;
+    MerkleFrontiers oldTrees;
+    std::list<CTransaction> txConflicted;
+
+    CachedBlockData(
+        CBlockIndex *pindex,
+        MerkleFrontiers oldTrees,
+        std::list<CTransaction> txConflicted):
+        pindex(pindex), oldTrees(oldTrees), txConflicted(txConflicted) {}
+};
+
+void ThreadNotifyWallets(CBlockIndex *pindexLastTip)
+{
+    // If pindexLastTip == nullptr, the wallet is at genesis.
+    // However, the genesis block is not loaded synchronously.
+    // We need to wait for ThreadImport to finish.
+    while (pindexLastTip == nullptr) {
+        {
+            LOCK(cs_main);
+            pindexLastTip = chainActive.Genesis();
+        }
+        MilliSleep(50);
+    }
+
+    while (true) {
+        // Run the notifier on an integer second in the steady clock.
+        auto now = std::chrono::steady_clock::now().time_since_epoch();
+        auto nextFire = std::chrono::duration_cast<std::chrono::seconds>(
+            now + std::chrono::seconds(1));
+        std::this_thread::sleep_until(
+            std::chrono::time_point<std::chrono::steady_clock>(nextFire));
+
+        boost::this_thread::interruption_point();
+
+        auto chainParams = Params();
+
+        //
+        // Collect all the state we require
+        //
+
+        // The common ancestor between the last chain tip we notified and the
+        // current chain tip.
+        const CBlockIndex *pindexFork;
+        // The stack of blocks we will notify as having been connected.
+        // Pushed in reverse, popped in order.
+        std::vector<CachedBlockData> blockStack;
+        // Transactions that have been recently conflicted out of the mempool.
+        std::pair<std::map<CBlockIndex*, std::list<CTransaction>>, uint64_t> recentlyConflicted;
+        // Transactions that have been recently added to the mempool.
+        std::pair<std::vector<CTransaction>, uint64_t> recentlyAdded;
+
+        {
+            LOCK(cs_main);
+
+            // Figure out the path from the last block we notified to the
+            // current chain tip.
+            CBlockIndex *pindex = chainActive.Tip();
+            pindexFork = chainActive.FindFork(pindexLastTip);
+
+            // Fetch recently-conflicted transactions. These will include any
+            // block that has been connected since the last cycle, but we only
+            // notify for the conflicts created by the current active chain.
+            recentlyConflicted = DrainRecentlyConflicted();
+
+            // Iterate backwards over the connected blocks we need to notify.
+            while (pindex && pindex != pindexFork) {
+                MerkleFrontiers oldFrontiers;
+                // Get the Sprout commitment tree as of the start of this block.
+                assert(pcoinsTip->GetSproutAnchorAt(pindex->hashSproutAnchor, oldFrontiers.sprout));
+
+                // Get the Sapling commitment tree as of the start of this block.
+                // We can get this from the `hashFinalSaplingRoot` of the last block
+                // However, this is only reliable if the last block was on or after
+                // the Sapling activation height. Otherwise, the last anchor was the
+                // empty root.
+                if (chainParams.GetConsensus().NetworkUpgradeActive(
+                    pindex->pprev->nHeight, Consensus::UPGRADE_SAPLING)) {
+                    assert(pcoinsTip->GetSaplingAnchorAt(
+                        pindex->pprev->hashFinalSaplingRoot, oldFrontiers.sapling));
+                } else {
+                    assert(pcoinsTip->GetSaplingAnchorAt(SaplingMerkleTree::empty_root(), oldFrontiers.sapling));
+                }
+
+                // Get the Orchard Merkle frontier as of the start of this block.
+                // We can get this from the `hashFinalOrchardRoot` of the last block
+                // However, this is only reliable if the last block was on or after
+                // the Orchard activation height. Otherwise, the last anchor was the
+                // empty root.
+                if (chainParams.GetConsensus().NetworkUpgradeActive(
+                    pindex->pprev->nHeight, Consensus::UPGRADE_NU5)) {
+                    assert(pcoinsTip->GetOrchardAnchorAt(
+                        pindex->pprev->hashFinalOrchardRoot, oldFrontiers.orchard));
+                } else {
+                    assert(pcoinsTip->GetOrchardAnchorAt(
+                        OrchardMerkleFrontier::empty_root(), oldFrontiers.orchard));
+                }
+
+                blockStack.emplace_back(
+                    pindex,
+                    oldFrontiers,
+                    recentlyConflicted.first.at(pindex));
+
+                pindex = pindex->pprev;
+            }
+
+            recentlyAdded = mempool.DrainRecentlyAdded();
+        }
+
+        //
+        // Execute wallet logic based on the collected state. We MUST NOT take
+        // the cs_main or mempool.cs locks again until after the next sleep;
+        // doing so introduces a locking side-channel between this code and the
+        // network message processing thread.
+        //
+
+        // Notify block disconnects
+        while (pindexLastTip && pindexLastTip != pindexFork) {
+            // Read block from disk.
+            CBlock block;
+            if (!ReadBlockFromDisk(block, pindexLastTip, chainParams.GetConsensus())) {
+                LogPrintf(
+                        "*** %s: Failed to read block %s while notifying wallets of block disconnects",
+                        __func__, pindexLastTip->GetBlockHash().GetHex());
+                uiInterface.ThreadSafeMessageBox(
+                    _("Error: A fatal internal error occurred, see debug.log for details"),
+                    "", CClientUIInterface::MSG_ERROR);
+                StartShutdown();
+                return;
+            }
+
+            // Let wallets know transactions went from 1-confirmed to
+            // 0-confirmed or conflicted:
+            for (const CTransaction &tx : block.vtx) {
+                SyncWithWallets(tx, NULL, pindexLastTip->nHeight);
+            }
+            // Update cached incremental witnesses
+            // This will take the cs_main lock in order to obtain the CBlockLocator
+            // used by `SetBestChain`, but as that write only occurs once every
+            // WRITE_WITNESS_INTERVAL * 1000000 microseconds this should not be
+            // exploitable as a timing channel.
+            GetMainSignals().ChainTip(pindexLastTip, &block, std::nullopt);
+
+            // On to the next block!
+            pindexLastTip = pindexLastTip->pprev;
+        }
+
+        // Notify block connections
+        while (!blockStack.empty()) {
+            auto blockData = blockStack.back();
+            blockStack.pop_back();
+
+            // Read block from disk.
+            CBlock block;
+            if (!ReadBlockFromDisk(block, blockData.pindex, chainParams.GetConsensus())) {
+                LogPrintf(
+                        "*** %s: Failed to read block %s while notifying wallets of block connects",
+                        __func__, blockData.pindex->GetBlockHash().GetHex());
+                uiInterface.ThreadSafeMessageBox(
+                    _("Error: A fatal internal error occurred, see debug.log for details"),
+                    "", CClientUIInterface::MSG_ERROR);
+                StartShutdown();
+                return;
+            }
+
+            // Tell wallet about transactions that went from mempool
+            // to conflicted:
+            for (const CTransaction &tx : blockData.txConflicted) {
+                SyncWithWallets(tx, NULL, blockData.pindex->nHeight + 1);
+            }
+            // ... and about transactions that got confirmed:
+            for (const CTransaction &tx : block.vtx) {
+                SyncWithWallets(tx, &block, blockData.pindex->nHeight);
+            }
+            // Update cached incremental witnesses
+            // This will take the cs_main lock in order to obtain the CBlockLocator
+            // used by `SetBestChain`, but as that write only occurs once every
+            // WRITE_WITNESS_INTERVAL * 1000000 microseconds this should not be
+            // exploitable as a timing channel.
+            GetMainSignals().ChainTip(blockData.pindex, &block, blockData.oldTrees);
+
+            // This block is done!
+            pindexLastTip = blockData.pindex;
+        }
+
+        // Notify transactions in the mempool
+        for (auto tx : recentlyAdded.first) {
+            try {
+                SyncWithWallets(tx, NULL, pindexLastTip->nHeight + 1);
+            } catch (const boost::thread_interrupted&) {
+                throw;
+            } catch (const std::exception& e) {
+                PrintExceptionContinue(&e, "ThreadNotifyWallets()");
+            } catch (...) {
+                PrintExceptionContinue(NULL, "ThreadNotifyWallets()");
+            }
+        }
+
+        // Update the notified sequence numbers. We only need this in regtest mode,
+        // and should not lock on cs or cs_main here otherwise.
+        if (chainParams.NetworkIDString() == "regtest") {
+            SetChainNotifiedSequence(chainParams, recentlyConflicted.second);
+            mempool.SetNotifiedSequence(recentlyAdded.second);
+        }
+    }
+}
diff --git a/depend/zcash/src/validationinterface.h b/depend/zcash/src/validationinterface.h
new file mode 100644
index 000000000..ca5757c97
--- /dev/null
+++ b/depend/zcash/src/validationinterface.h
@@ -0,0 +1,85 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_VALIDATIONINTERFACE_H
+#define BITCOIN_VALIDATIONINTERFACE_H
+
+#include <optional>
+
+#include <boost/signals2/signal.hpp>
+#include <boost/shared_ptr.hpp>
+
+#include "miner.h"
+#include "zcash/IncrementalMerkleTree.hpp"
+
+class CBlock;
+class CBlockIndex;
+struct CBlockLocator;
+class CReserveScript;
+class CTransaction;
+class CValidationInterface;
+class CValidationState;
+class uint256;
+
+struct MerkleFrontiers {
+    SproutMerkleTree sprout;
+    SaplingMerkleTree sapling;
+    OrchardMerkleFrontier orchard;
+};
+
+// These functions dispatch to one or all registered wallets
+
+/** Register a wallet to receive updates from core */
+void RegisterValidationInterface(CValidationInterface* pwalletIn);
+/** Unregister a wallet from core */
+void UnregisterValidationInterface(CValidationInterface* pwalletIn);
+/** Unregister all wallets from core */
+void UnregisterAllValidationInterfaces();
+
+class CValidationInterface {
+protected:
+    virtual void UpdatedBlockTip(const CBlockIndex *pindex) {}
+    virtual void SyncTransaction(const CTransaction &tx, const CBlock *pblock, const int nHeight) {}
+    virtual void EraseFromWallet(const uint256 &hash) {}
+    virtual void ChainTip(const CBlockIndex *pindex, const CBlock *pblock, std::optional<MerkleFrontiers> added) {}
+    virtual void UpdatedTransaction(const uint256 &hash) {}
+    virtual void Inventory(const uint256 &hash) {}
+    virtual void ResendWalletTransactions(int64_t nBestBlockTime) {}
+    virtual void BlockChecked(const CBlock&, const CValidationState&) {}
+    virtual void GetAddressForMining(std::optional<MinerAddress>&) {};
+    virtual void ResetRequestCount(const uint256 &hash) {};
+    friend void ::RegisterValidationInterface(CValidationInterface*);
+    friend void ::UnregisterValidationInterface(CValidationInterface*);
+    friend void ::UnregisterAllValidationInterfaces();
+};
+
+struct CMainSignals {
+    /** Notifies listeners of updated block chain tip */
+    boost::signals2::signal<void (const CBlockIndex *)> UpdatedBlockTip;
+    /** Notifies listeners of updated transaction data (transaction, and optionally the block it is found in. */
+    boost::signals2::signal<void (const CTransaction &, const CBlock *, const int nHeight)> SyncTransaction;
+    /** Notifies listeners of an erased transaction (currently disabled, requires transaction replacement). */
+    boost::signals2::signal<void (const uint256 &)> EraseTransaction;
+    /** Notifies listeners of an updated transaction without new data (for now: a coinbase potentially becoming visible). */
+    boost::signals2::signal<void (const uint256 &)> UpdatedTransaction;
+    /** Notifies listeners of a change to the tip of the active block chain. */
+    boost::signals2::signal<void (const CBlockIndex *, const CBlock *, std::optional<MerkleFrontiers>)> ChainTip;
+    /** Notifies listeners about an inventory item being seen on the network. */
+    boost::signals2::signal<void (const uint256 &)> Inventory;
+    /** Tells listeners to broadcast their data. */
+    boost::signals2::signal<void (int64_t nBestBlockTime)> Broadcast;
+    /** Notifies listeners of a block validation result */
+    boost::signals2::signal<void (const CBlock&, const CValidationState&)> BlockChecked;
+    /** Notifies listeners that an address for mining is required (coinbase) */
+    boost::signals2::signal<void (std::optional<MinerAddress>&)> AddressForMining;
+    /** Notifies listeners that a block has been successfully mined */
+    boost::signals2::signal<void (const uint256 &)> BlockFound;
+};
+
+CMainSignals& GetMainSignals();
+
+void ThreadNotifyWallets(CBlockIndex *pindexLastTip);
+
+#endif // BITCOIN_VALIDATIONINTERFACE_H
diff --git a/depend/zcash/src/version.h b/depend/zcash/src/version.h
new file mode 100644
index 000000000..9c83e079a
--- /dev/null
+++ b/depend/zcash/src/version.h
@@ -0,0 +1,43 @@
+// Copyright (c) 2012-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_VERSION_H
+#define BITCOIN_VERSION_H
+
+/**
+ * network protocol versioning
+ */
+
+static const int PROTOCOL_VERSION = 170100;
+
+//! initial proto version, to be increased after version/verack negotiation
+static const int INIT_PROTO_VERSION = 209;
+
+//! In this version, 'getheaders' was introduced.
+static const int GETHEADERS_VERSION = 31800;
+
+//! disconnect from peers older than this proto version
+static const int MIN_PEER_PROTO_VERSION = 170002;
+
+//! nTime field added to CAddress, starting with this version;
+//! if possible, avoid requesting addresses nodes older than this
+static const int CADDR_TIME_VERSION = 31402;
+
+//! BIP 0031, pong message, is enabled for all versions AFTER this one
+static const int BIP0031_VERSION = 60000;
+
+//! "mempool" command, enhanced "getdata" behavior starts with this version
+static const int MEMPOOL_GD_VERSION = 60002;
+
+//! "filter*" commands are disabled without NODE_BLOOM after and including this version
+static const int NO_BLOOM_VERSION = 170004;
+
+//! Changes to CInv parsing, starting with this version:
+//! - MSG_WTX type defined, which contains two 32-byte hashes.
+static const int CINV_WTX_VERSION = 170014;
+
+//! disconnect from testnet peers older than this proto version
+static const int MIN_TESTNET_PEER_PROTO_VERSION = 170040;
+
+#endif // BITCOIN_VERSION_H
diff --git a/depend/zcash/src/wallet/asyncrpcoperation_common.cpp b/depend/zcash/src/wallet/asyncrpcoperation_common.cpp
new file mode 100644
index 000000000..6ca224977
--- /dev/null
+++ b/depend/zcash/src/wallet/asyncrpcoperation_common.cpp
@@ -0,0 +1,42 @@
+#include "asyncrpcoperation_common.h"
+
+#include "core_io.h"
+#include "init.h"
+#include "rpc/protocol.h"
+
+extern UniValue signrawtransaction(const UniValue& params, bool fHelp);
+
+std::pair<CTransaction, UniValue> SignSendRawTransaction(UniValue obj, std::optional<std::reference_wrapper<CReserveKey>> reservekey, bool testmode) {
+    // Sign the raw transaction
+    UniValue rawtxnValue = find_value(obj, "rawtxn");
+    if (rawtxnValue.isNull()) {
+        throw JSONRPCError(RPC_WALLET_ERROR, "Missing hex data for raw transaction");
+    }
+    std::string rawtxn = rawtxnValue.get_str();
+
+    UniValue params = UniValue(UniValue::VARR);
+    params.push_back(rawtxn);
+    UniValue signResultValue = signrawtransaction(params, false);
+    UniValue signResultObject = signResultValue.get_obj();
+    UniValue completeValue = find_value(signResultObject, "complete");
+    bool complete = completeValue.get_bool();
+    if (!complete) {
+        // TODO: #1366 Maybe get "errors" and print array vErrors into a string
+        throw JSONRPCError(RPC_WALLET_ENCRYPTION_FAILED, "Failed to sign transaction");
+    }
+
+    UniValue hexValue = find_value(signResultObject, "hex");
+    if (hexValue.isNull()) {
+        throw JSONRPCError(RPC_WALLET_ERROR, "Missing hex data for signed transaction");
+    }
+    std::string signedtxn = hexValue.get_str();
+    CDataStream stream(ParseHex(signedtxn), SER_NETWORK, PROTOCOL_VERSION);
+    CTransaction tx;
+    stream >> tx;
+
+    // Recipient mappings are not available when sending a raw transaction.
+    std::vector<RecipientMapping> recipientMappings;
+    UniValue sendResult = SendTransaction(tx, recipientMappings, reservekey, testmode);
+
+    return std::make_pair(tx, sendResult);
+}
diff --git a/depend/zcash/src/wallet/asyncrpcoperation_common.h b/depend/zcash/src/wallet/asyncrpcoperation_common.h
new file mode 100644
index 000000000..b24b6d8b0
--- /dev/null
+++ b/depend/zcash/src/wallet/asyncrpcoperation_common.h
@@ -0,0 +1,64 @@
+// Copyright (c) 2019 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_WALLET_ASYNCRPCOPERATION_COMMON_H
+#define ZCASH_WALLET_ASYNCRPCOPERATION_COMMON_H
+
+#include "core_io.h"
+#include "primitives/transaction.h"
+#include "rpc/protocol.h"
+#include "univalue.h"
+#include "wallet.h"
+
+#include <optional>
+
+/**
+ * Sends a given transaction.
+ *
+ * If testmode is false, commit the transaction to the wallet,
+ * return {"txid": tx.GetHash().ToString()}
+ *
+ * If testmode is true, do not commit the transaction,
+ * return {"test": 1, "txid": tx.GetHash().ToString(), "hex": EncodeHexTx(tx)}
+ */
+template <typename RecipientMapping>
+UniValue SendTransaction(
+        const CTransaction& tx,
+        const std::vector<RecipientMapping>& recipients,
+        std::optional<std::reference_wrapper<CReserveKey>> reservekey,
+        bool testmode)
+{
+    UniValue o(UniValue::VOBJ);
+    // Send the transaction
+    if (!testmode) {
+        CWalletTx wtx(pwalletMain, tx);
+        // save the mapping from (receiver, txid) to UA
+        if (!pwalletMain->SaveRecipientMappings(tx.GetHash(), recipients)) {
+            // More details in debug.log
+            throw JSONRPCError(RPC_WALLET_ERROR, "SendTransaction: SaveRecipientMappings failed");
+        }
+        if (!pwalletMain->CommitTransaction(wtx, reservekey)) {
+            // More details in debug.log
+            throw JSONRPCError(RPC_WALLET_ERROR, "SendTransaction: CommitTransaction failed");
+        }
+        o.pushKV("txid", tx.GetHash().ToString());
+    } else {
+        // Test mode does not send the transaction to the network nor save the recipient mappings.
+        o.pushKV("test", 1);
+        o.pushKV("txid", tx.GetHash().ToString());
+        o.pushKV("hex", EncodeHexTx(tx));
+    }
+    return o;
+}
+
+
+/**
+ * Sign and send a raw transaction.
+ * Raw transaction as hex string should be in object field "rawtxn"
+ *
+ * Returns a pair of (the parsed transaction, and the result of sending)
+ */
+std::pair<CTransaction, UniValue> SignSendRawTransaction(UniValue obj, std::optional<std::reference_wrapper<CReserveKey>> reservekey, bool testmode);
+
+#endif // ZCASH_WALLET_ASYNCRPCOPERATION_COMMON_H
diff --git a/depend/zcash/src/wallet/asyncrpcoperation_mergetoaddress.cpp b/depend/zcash/src/wallet/asyncrpcoperation_mergetoaddress.cpp
new file mode 100644
index 000000000..68a554ab4
--- /dev/null
+++ b/depend/zcash/src/wallet/asyncrpcoperation_mergetoaddress.cpp
@@ -0,0 +1,1024 @@
+// Copyright (c) 2017 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "asyncrpcoperation_mergetoaddress.h"
+
+#include "amount.h"
+#include "asyncrpcoperation_common.h"
+#include "asyncrpcqueue.h"
+#include "core_io.h"
+#include "experimental_features.h"
+#include "init.h"
+#include "key_io.h"
+#include "main.h"
+#include "miner.h"
+#include "net.h"
+#include "netbase.h"
+#include "proof_verifier.h"
+#include "rpc/protocol.h"
+#include "rpc/server.h"
+#include "script/interpreter.h"
+#include "timedata.h"
+#include "transaction_builder.h"
+#include "util.h"
+#include "util/match.h"
+#include "utilmoneystr.h"
+#include "utiltime.h"
+#include "wallet.h"
+#include "walletdb.h"
+#include "wallet/paymentdisclosuredb.h"
+#include "zcash/IncrementalMerkleTree.hpp"
+
+#include <chrono>
+#include <iostream>
+#include <string>
+#include <thread>
+#include <variant>
+
+#include <rust/ed25519.h>
+
+using namespace libzcash;
+
+int mta_find_output(UniValue obj, int n)
+{
+    UniValue outputMapValue = find_value(obj, "outputmap");
+    if (!outputMapValue.isArray()) {
+        throw JSONRPCError(RPC_WALLET_ERROR, "Missing outputmap for JoinSplit operation");
+    }
+
+    UniValue outputMap = outputMapValue.get_array();
+    assert(outputMap.size() == ZC_NUM_JS_OUTPUTS);
+    for (size_t i = 0; i < outputMap.size(); i++) {
+        if (outputMap[i].get_int() == n) {
+            return i;
+        }
+    }
+
+    throw std::logic_error("n is not present in outputmap");
+}
+
+AsyncRPCOperation_mergetoaddress::AsyncRPCOperation_mergetoaddress(
+    std::optional<TransactionBuilder> builder,
+    CMutableTransaction contextualTx,
+    std::vector<MergeToAddressInputUTXO> utxoInputs,
+    std::vector<MergeToAddressInputSproutNote> sproutNoteInputs,
+    std::vector<MergeToAddressInputSaplingNote> saplingNoteInputs,
+    MergeToAddressRecipient recipient,
+    CAmount fee,
+    UniValue contextInfo) :
+    tx_(contextualTx), utxoInputs_(utxoInputs), sproutNoteInputs_(sproutNoteInputs),
+    saplingNoteInputs_(saplingNoteInputs), memo_(recipient.second), fee_(fee), contextinfo_(contextInfo)
+{
+    if (fee < 0 || fee > MAX_MONEY) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Fee is out of range");
+    }
+
+    if (utxoInputs.empty() && sproutNoteInputs.empty() && saplingNoteInputs.empty()) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "No inputs");
+    }
+
+    if (sproutNoteInputs.size() > 0 && saplingNoteInputs.size() > 0) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Cannot send from both Sprout and Sapling addresses using z_mergetoaddress");
+    }
+
+    if (sproutNoteInputs.size() > 0 && builder) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Sprout notes are not supported by the TransactionBuilder");
+    }
+
+    isUsingBuilder_ = false;
+    if (builder) {
+        isUsingBuilder_ = true;
+        builder_ = std::move(builder.value());
+    }
+
+    KeyIO keyIO(Params());
+    isToTaddr_ = false;
+    isToZaddr_ = false;
+
+    std::visit(match {
+        [&](const CKeyID& keyId) {
+            toTaddr_ = keyId;
+            isToTaddr_ = true;
+        },
+        [&](const CScriptID& scriptId) {
+            toTaddr_ = scriptId;
+            isToTaddr_ = true;
+        },
+        [&](const libzcash::SproutPaymentAddress& addr) {
+            toPaymentAddress_ = addr;
+            isToZaddr_ = true;
+        },
+        [&](const libzcash::SaplingPaymentAddress& addr) {
+            toPaymentAddress_ = addr;
+            isToZaddr_ = true;
+        },
+        [&](const libzcash::UnifiedAddress& addr) {
+            throw JSONRPCError(
+                    RPC_INVALID_ADDRESS_OR_KEY,
+                    "z_mergetoaddress does not yet support sending to unified addresses");
+        },
+    }, recipient.first);
+
+    // Log the context info i.e. the call parameters to z_mergetoaddress
+    if (LogAcceptCategory("zrpcunsafe")) {
+        LogPrint("zrpcunsafe", "%s: z_mergetoaddress initialized (params=%s)\n", getId(), contextInfo.write());
+    } else {
+        LogPrint("zrpc", "%s: z_mergetoaddress initialized\n", getId());
+    }
+
+    // Lock UTXOs
+    lock_utxos();
+    lock_notes();
+
+    // Enable payment disclosure if requested
+    paymentDisclosureMode = fExperimentalPaymentDisclosure;
+}
+
+AsyncRPCOperation_mergetoaddress::~AsyncRPCOperation_mergetoaddress()
+{
+}
+
+void AsyncRPCOperation_mergetoaddress::main()
+{
+    if (isCancelled()) {
+        unlock_utxos(); // clean up
+        unlock_notes();
+        return;
+    }
+
+    set_state(OperationStatus::EXECUTING);
+    start_execution_clock();
+
+    bool success = false;
+
+#ifdef ENABLE_MINING
+    GenerateBitcoins(false, 0, Params());
+#endif
+
+    try {
+        success = main_impl();
+    } catch (const UniValue& objError) {
+        int code = find_value(objError, "code").get_int();
+        std::string message = find_value(objError, "message").get_str();
+        set_error_code(code);
+        set_error_message(message);
+    } catch (const runtime_error& e) {
+        set_error_code(-1);
+        set_error_message("runtime error: " + string(e.what()));
+    } catch (const logic_error& e) {
+        set_error_code(-1);
+        set_error_message("logic error: " + string(e.what()));
+    } catch (const exception& e) {
+        set_error_code(-1);
+        set_error_message("general exception: " + string(e.what()));
+    } catch (...) {
+        set_error_code(-2);
+        set_error_message("unknown error");
+    }
+
+#ifdef ENABLE_MINING
+    GenerateBitcoins(GetBoolArg("-gen", false), GetArg("-genproclimit", 1), Params());
+#endif
+
+    stop_execution_clock();
+
+    if (success) {
+        set_state(OperationStatus::SUCCESS);
+    } else {
+        set_state(OperationStatus::FAILED);
+    }
+
+    std::string s = strprintf("%s: z_mergetoaddress finished (status=%s", getId(), getStateAsString());
+    if (success) {
+        s += strprintf(", txid=%s)\n", tx_.GetHash().ToString());
+    } else {
+        s += strprintf(", error=%s)\n", getErrorMessage());
+    }
+    LogPrintf("%s", s);
+
+    unlock_utxos(); // clean up
+    unlock_notes(); // clean up
+
+    // !!! Payment disclosure START
+    if (success && paymentDisclosureMode && paymentDisclosureData_.size() > 0) {
+        uint256 txidhash = tx_.GetHash();
+        std::shared_ptr<PaymentDisclosureDB> db = PaymentDisclosureDB::sharedInstance();
+        for (PaymentDisclosureKeyInfo p : paymentDisclosureData_) {
+            p.first.hash = txidhash;
+            if (!db->Put(p.first, p.second)) {
+                LogPrint("paymentdisclosure", "%s: Payment Disclosure: Error writing entry to database for key %s\n", getId(), p.first.ToString());
+            } else {
+                LogPrint("paymentdisclosure", "%s: Payment Disclosure: Successfully added entry to database for key %s\n", getId(), p.first.ToString());
+            }
+        }
+    }
+    // !!! Payment disclosure END
+}
+
+// Notes:
+// 1. #1359 Currently there is no limit set on the number of joinsplits, so size of tx could be invalid.
+// 2. #1277 Spendable notes are not locked, so an operation running in parallel could also try to use them.
+bool AsyncRPCOperation_mergetoaddress::main_impl()
+{
+    assert(isToTaddr_ != isToZaddr_);
+
+    bool isPureTaddrOnlyTx = (sproutNoteInputs_.empty() && saplingNoteInputs_.empty() && isToTaddr_);
+    CAmount minersFee = fee_;
+
+    size_t numInputs = utxoInputs_.size();
+
+    CAmount t_inputs_total = 0;
+    for (MergeToAddressInputUTXO& t : utxoInputs_) {
+        t_inputs_total += std::get<1>(t);
+    }
+
+    CAmount z_inputs_total = 0;
+    for (const MergeToAddressInputSproutNote& t : sproutNoteInputs_) {
+        z_inputs_total += std::get<2>(t);
+    }
+
+    for (const MergeToAddressInputSaplingNote& t : saplingNoteInputs_) {
+        z_inputs_total += std::get<2>(t);
+    }
+
+    CAmount targetAmount = z_inputs_total + t_inputs_total;
+
+    if (targetAmount <= minersFee) {
+        throw JSONRPCError(RPC_WALLET_INSUFFICIENT_FUNDS,
+                           strprintf("Insufficient funds, have %s and miners fee is %s",
+                                     FormatMoney(targetAmount), FormatMoney(minersFee)));
+    }
+
+    CAmount sendAmount = targetAmount - minersFee;
+
+    // update the transaction with the UTXO inputs and output (if any)
+    if (!isUsingBuilder_) {
+        CMutableTransaction rawTx(tx_);
+        for (const MergeToAddressInputUTXO& t : utxoInputs_) {
+            CTxIn in(std::get<0>(t));
+            rawTx.vin.push_back(in);
+        }
+        if (isToTaddr_) {
+            CScript scriptPubKey = GetScriptForDestination(toTaddr_);
+            CTxOut out(sendAmount, scriptPubKey);
+            rawTx.vout.push_back(out);
+        }
+        tx_ = CTransaction(rawTx);
+    }
+
+    if (isPureTaddrOnlyTx) {
+        LogPrint("zrpc", "%s: spending %s to send %s with fee %s\n",
+             getId(), FormatMoney(targetAmount), FormatMoney(sendAmount), FormatMoney(minersFee));
+    } else {
+        LogPrint("zrpcunsafe", "%s: spending %s to send %s with fee %s\n",
+             getId(), FormatMoney(targetAmount), FormatMoney(sendAmount), FormatMoney(minersFee));
+    }
+    LogPrint("zrpc", "%s: transparent input: %s\n", getId(), FormatMoney(t_inputs_total));
+    LogPrint("zrpcunsafe", "%s: private input: %s\n", getId(), FormatMoney(z_inputs_total));
+    if (isToTaddr_) {
+        LogPrint("zrpc", "%s: transparent output: %s\n", getId(), FormatMoney(sendAmount));
+    } else {
+        LogPrint("zrpcunsafe", "%s: private output: %s\n", getId(), FormatMoney(sendAmount));
+    }
+    LogPrint("zrpc", "%s: fee: %s\n", getId(), FormatMoney(minersFee));
+
+    // Grab the current consensus branch ID
+    {
+        LOCK(cs_main);
+        consensusBranchId_ = CurrentEpochBranchId(chainActive.Height() + 1, Params().GetConsensus());
+    }
+
+    /**
+     * SCENARIO #0
+     *
+     * Sprout not involved, so we just use the TransactionBuilder and we're done.
+     *
+     * This is based on code from AsyncRPCOperation_sendmany::main_impl() and should be refactored.
+     */
+    if (isUsingBuilder_) {
+        builder_.SetFee(minersFee);
+
+
+        for (const MergeToAddressInputUTXO& t : utxoInputs_) {
+            COutPoint outPoint = std::get<0>(t);
+            CAmount amount = std::get<1>(t);
+            CScript scriptPubKey = std::get<2>(t);
+            builder_.AddTransparentInput(outPoint, scriptPubKey, amount);
+        }
+
+        std::optional<uint256> ovk;
+        // Select Sapling notes
+        std::vector<SaplingOutPoint> saplingOPs;
+        std::vector<SaplingNote> saplingNotes;
+        std::vector<SaplingExpandedSpendingKey> expsks;
+        for (const MergeToAddressInputSaplingNote& saplingNoteInput: saplingNoteInputs_) {
+            saplingOPs.push_back(std::get<0>(saplingNoteInput));
+            saplingNotes.push_back(std::get<1>(saplingNoteInput));
+            auto expsk = std::get<3>(saplingNoteInput);
+            expsks.push_back(expsk);
+            if (!ovk) {
+                ovk = expsk.full_viewing_key().ovk;
+            }
+        }
+
+        // Fetch Sapling anchor and witnesses
+        uint256 anchor;
+        std::vector<std::optional<SaplingWitness>> witnesses;
+        {
+            LOCK2(cs_main, pwalletMain->cs_wallet);
+            if (!pwalletMain->GetSaplingNoteWitnesses(saplingOPs, nAnchorConfirmations, witnesses, anchor)) {
+                // This error should not appear once we're nAnchorConfirmations blocks past
+                // Sapling activation.
+                throw JSONRPCError(RPC_WALLET_ERROR, "Insufficient Sapling witnesses.");
+            };
+        }
+
+        // Add Sapling spends
+        for (size_t i = 0; i < saplingNotes.size(); i++) {
+            if (!witnesses[i]) {
+                throw JSONRPCError(RPC_WALLET_ERROR, "Missing witness for Sapling note");
+            }
+            builder_.AddSaplingSpend(expsks[i], saplingNotes[i], anchor, witnesses[i].value());
+        }
+
+        if (isToTaddr_) {
+            builder_.AddTransparentOutput(toTaddr_, sendAmount);
+        } else {
+            std::array<unsigned char, ZC_MEMO_SIZE> hexMemo = get_memo_from_hex_string(memo_);
+            auto saplingPaymentAddress = std::get_if<libzcash::SaplingPaymentAddress>(&toPaymentAddress_);
+            if (saplingPaymentAddress == nullptr) {
+                // This should never happen as we have already determined that the payment is to sapling
+                throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Could not get Sapling payment address.");
+            }
+            if (saplingNoteInputs_.size() == 0 && utxoInputs_.size() > 0) {
+                // Sending from t-addresses, which we don't have ovks for. Instead,
+                // generate a common one from the HD seed. This ensures the data is
+                // recoverable, while keeping it logically separate from the ZIP 32
+                // Sapling key hierarchy, which the user might not be using.
+                HDSeed seed = pwalletMain->GetHDSeedForRPC();
+                ovk = ovkForShieldingFromTaddr(seed);
+            }
+            if (!ovk) {
+                throw JSONRPCError(RPC_WALLET_ERROR, "Sending to a Sapling address requires an ovk.");
+            }
+            builder_.AddSaplingOutput(ovk.value(), *saplingPaymentAddress, sendAmount, hexMemo);
+        }
+
+        // Build the transaction
+        tx_ = builder_.Build().GetTxOrThrow();
+
+        // TODO: update this when unified address support is added
+        std::vector<RecipientMapping> recipientMappings;
+        UniValue sendResult = SendTransaction(tx_, recipientMappings, std::nullopt, testmode);
+        set_result(sendResult);
+
+        return true;
+    }
+    /**
+     * END SCENARIO #0
+     */
+
+
+    /**
+     * SCENARIO #1
+     *
+     * taddrs -> taddr
+     *
+     * There are no zaddrs or joinsplits involved.
+     */
+    if (isPureTaddrOnlyTx) {
+        UniValue obj(UniValue::VOBJ);
+        obj.pushKV("rawtxn", EncodeHexTx(tx_));
+        auto txAndResult = SignSendRawTransaction(obj, std::nullopt, testmode);
+        tx_ = txAndResult.first;
+        set_result(txAndResult.second);
+        return true;
+    }
+    /**
+     * END SCENARIO #1
+     */
+
+    // Prepare raw transaction to handle JoinSplits
+    CMutableTransaction mtx(tx_);
+    ed25519_generate_keypair(&joinSplitPrivKey_, &joinSplitPubKey_);
+    mtx.joinSplitPubKey = joinSplitPubKey_;
+    tx_ = CTransaction(mtx);
+
+    /**
+     * SCENARIO #2
+     *
+     * taddrs -> zaddr
+     *
+     * We only need a single JoinSplit.
+     */
+    if (sproutNoteInputs_.empty() && isToZaddr_) {
+        // Create JoinSplit to target z-addr.
+        MergeToAddressJSInfo info;
+        info.vpub_old = sendAmount;
+        info.vpub_new = 0;
+
+        JSOutput jso = JSOutput(std::get<libzcash::SproutPaymentAddress>(toPaymentAddress_), sendAmount);
+        if (memo_.size() > 0) {
+            jso.memo = get_memo_from_hex_string(memo_);
+        }
+        info.vjsout.push_back(jso);
+
+        UniValue obj = perform_joinsplit(info);
+        auto txAndResult = SignSendRawTransaction(obj, std::nullopt, testmode);
+        tx_ = txAndResult.first;
+        set_result(txAndResult.second);
+        return true;
+    }
+    /**
+     * END SCENARIO #2
+     */
+
+
+    // Copy zinputs to more flexible containers
+    std::deque<MergeToAddressInputSproutNote> zInputsDeque;
+    for (const auto& o : sproutNoteInputs_) {
+        zInputsDeque.push_back(o);
+    }
+
+    // When spending notes, take a snapshot of note witnesses and anchors as the treestate will
+    // change upon arrival of new blocks which contain joinsplit transactions.  This is likely
+    // to happen as creating a chained joinsplit transaction can take longer than the block interval.
+    {
+        LOCK2(cs_main, pwalletMain->cs_wallet);
+        for (auto t : sproutNoteInputs_) {
+            JSOutPoint jso = std::get<0>(t);
+            std::vector<JSOutPoint> vOutPoints = {jso};
+            uint256 inputAnchor;
+            std::vector<std::optional<SproutWitness>> vInputWitnesses;
+            if (!pwalletMain->GetSproutNoteWitnesses(vOutPoints, nAnchorConfirmations, vInputWitnesses, inputAnchor)) {
+                // This error should not appear once we're nAnchorConfirmations blocks past
+                // Sprout activation.
+                throw JSONRPCError(RPC_WALLET_ERROR, "Insufficient Sprout witnesses.");
+            };
+            jsopWitnessAnchorMap[jso.ToString()] = MergeToAddressWitnessAnchorData{vInputWitnesses[0], inputAnchor};
+        }
+    }
+
+    /**
+     * SCENARIO #3
+     *
+     * zaddrs -> zaddr
+     * taddrs ->
+     *
+     * zaddrs ->
+     * taddrs -> taddr
+     *
+     * Send to zaddr by chaining JoinSplits together and immediately consuming any change
+     * Send to taddr by creating dummy z outputs and accumulating value in a change note
+     * which is used to set vpub_new in the last chained joinsplit.
+     */
+    UniValue obj(UniValue::VOBJ);
+    CAmount jsChange = 0;          // this is updated after each joinsplit
+    int changeOutputIndex = -1;    // this is updated after each joinsplit if jsChange > 0
+    bool vpubOldProcessed = false; // updated when vpub_old for taddr inputs is set in first joinsplit
+    bool vpubNewProcessed = false; // updated when vpub_new for miner fee and taddr outputs is set in last joinsplit
+
+    // At this point, we are guaranteed to have at least one input note.
+    // Use address of first input note as the temporary change address.
+    SproutSpendingKey changeKey = std::get<3>(zInputsDeque.front());
+    SproutPaymentAddress changeAddress = changeKey.address();
+
+    CAmount vpubOldTarget = 0;
+    CAmount vpubNewTarget = 0;
+    if (isToTaddr_) {
+        vpubNewTarget = z_inputs_total;
+    } else {
+        if (utxoInputs_.empty()) {
+            vpubNewTarget = minersFee;
+        } else {
+            vpubOldTarget = t_inputs_total - minersFee;
+        }
+    }
+
+    // Keep track of treestate within this transaction
+    // The SaltedTxidHasher is fine to use here; it salts the map keys automatically
+    // with randomness generated on construction.
+    boost::unordered_map<uint256, SproutMerkleTree, SaltedTxidHasher> intermediates;
+    std::vector<uint256> previousCommitments;
+
+    while (!vpubNewProcessed) {
+        MergeToAddressJSInfo info;
+        info.vpub_old = 0;
+        info.vpub_new = 0;
+
+        // Set vpub_old in the first joinsplit
+        if (!vpubOldProcessed) {
+            if (t_inputs_total < vpubOldTarget) {
+                throw JSONRPCError(RPC_WALLET_ERROR,
+                                   strprintf("Insufficient transparent funds for vpub_old %s (miners fee %s, taddr inputs %s)",
+                                             FormatMoney(vpubOldTarget), FormatMoney(minersFee), FormatMoney(t_inputs_total)));
+            }
+            info.vpub_old += vpubOldTarget; // funds flowing from public pool
+            vpubOldProcessed = true;
+        }
+
+        CAmount jsInputValue = 0;
+        uint256 jsAnchor;
+        std::vector<std::optional<SproutWitness>> witnesses;
+
+        JSDescription prevJoinSplit;
+
+        // Keep track of previous JoinSplit and its commitments
+        if (tx_.vJoinSplit.size() > 0) {
+            prevJoinSplit = tx_.vJoinSplit.back();
+        }
+
+        // If there is no change, the chain has terminated so we can reset the tracked treestate.
+        if (jsChange == 0 && tx_.vJoinSplit.size() > 0) {
+            intermediates.clear();
+            previousCommitments.clear();
+        }
+
+        //
+        // Consume change as the first input of the JoinSplit.
+        //
+        if (jsChange > 0) {
+            LOCK2(cs_main, pwalletMain->cs_wallet);
+
+            // Update tree state with previous joinsplit
+            SproutMerkleTree tree;
+            auto it = intermediates.find(prevJoinSplit.anchor);
+            if (it != intermediates.end()) {
+                tree = it->second;
+            } else if (!pcoinsTip->GetSproutAnchorAt(prevJoinSplit.anchor, tree)) {
+                throw JSONRPCError(RPC_WALLET_ERROR, "Could not find previous JoinSplit anchor");
+            }
+
+            assert(changeOutputIndex != -1);
+            std::optional<SproutWitness> changeWitness;
+            int n = 0;
+            for (const uint256& commitment : prevJoinSplit.commitments) {
+                tree.append(commitment);
+                previousCommitments.push_back(commitment);
+                if (!changeWitness && changeOutputIndex == n++) {
+                    changeWitness = tree.witness();
+                } else if (changeWitness) {
+                    changeWitness.value().append(commitment);
+                }
+            }
+            if (changeWitness) {
+                witnesses.push_back(changeWitness);
+            }
+            jsAnchor = tree.root();
+            intermediates.insert(std::make_pair(tree.root(), tree)); // chained js are interstitial (found in between block boundaries)
+
+            // Decrypt the change note's ciphertext to retrieve some data we need
+            ZCNoteDecryption decryptor(changeKey.receiving_key());
+            auto hSig = ZCJoinSplit::h_sig(
+                prevJoinSplit.randomSeed,
+                prevJoinSplit.nullifiers,
+                tx_.joinSplitPubKey);
+            try {
+                SproutNotePlaintext plaintext = SproutNotePlaintext::decrypt(
+                    decryptor,
+                    prevJoinSplit.ciphertexts[changeOutputIndex],
+                    prevJoinSplit.ephemeralKey,
+                    hSig,
+                    (unsigned char)changeOutputIndex);
+
+                SproutNote note = plaintext.note(changeAddress);
+                info.notes.push_back(note);
+                info.zkeys.push_back(changeKey);
+
+                jsInputValue += plaintext.value();
+
+                LogPrint("zrpcunsafe", "%s: spending change (amount=%s)\n",
+                         getId(),
+                         FormatMoney(plaintext.value()));
+
+            } catch (const std::exception& e) {
+                throw JSONRPCError(RPC_WALLET_ERROR, strprintf("Error decrypting output note of previous JoinSplit: %s", e.what()));
+            }
+        }
+
+
+        //
+        // Consume spendable non-change notes
+        //
+        std::vector<SproutNote> vInputNotes;
+        std::vector<SproutSpendingKey> vInputZKeys;
+        std::vector<JSOutPoint> vOutPoints;
+        std::vector<std::optional<SproutWitness>> vInputWitnesses;
+        uint256 inputAnchor;
+        int numInputsNeeded = (jsChange > 0) ? 1 : 0;
+        while (numInputsNeeded++ < ZC_NUM_JS_INPUTS && zInputsDeque.size() > 0) {
+            MergeToAddressInputSproutNote t = zInputsDeque.front();
+            JSOutPoint jso = std::get<0>(t);
+            SproutNote note = std::get<1>(t);
+            CAmount noteFunds = std::get<2>(t);
+            SproutSpendingKey zkey = std::get<3>(t);
+            zInputsDeque.pop_front();
+
+            MergeToAddressWitnessAnchorData wad = jsopWitnessAnchorMap[jso.ToString()];
+            vInputWitnesses.push_back(wad.witness);
+            if (inputAnchor.IsNull()) {
+                inputAnchor = wad.anchor;
+            } else if (inputAnchor != wad.anchor) {
+                throw JSONRPCError(RPC_WALLET_ERROR, "Selected input notes do not share the same anchor");
+            }
+
+            vOutPoints.push_back(jso);
+            vInputNotes.push_back(note);
+            vInputZKeys.push_back(zkey);
+
+            jsInputValue += noteFunds;
+
+            int wtxHeight = -1;
+            int wtxDepth = -1;
+            {
+                LOCK2(cs_main, pwalletMain->cs_wallet);
+                const CWalletTx& wtx = pwalletMain->mapWallet[jso.hash];
+                // Zero confirmation notes belong to transactions which have not yet been mined
+                if (mapBlockIndex.find(wtx.hashBlock) == mapBlockIndex.end()) {
+                    throw JSONRPCError(RPC_WALLET_ERROR, strprintf("mapBlockIndex does not contain block hash %s", wtx.hashBlock.ToString()));
+                }
+                wtxHeight = mapBlockIndex[wtx.hashBlock]->nHeight;
+                wtxDepth = wtx.GetDepthInMainChain();
+            }
+            LogPrint("zrpcunsafe", "%s: spending note (txid=%s, vJoinSplit=%d, jsoutindex=%d, amount=%s, height=%d, confirmations=%d)\n",
+                     getId(),
+                     jso.hash.ToString().substr(0, 10),
+                     jso.js,
+                     int(jso.n), // uint8_t
+                     FormatMoney(noteFunds),
+                     wtxHeight,
+                     wtxDepth);
+        }
+
+        // Add history of previous commitments to witness
+        if (vInputNotes.size() > 0) {
+            if (vInputWitnesses.size() == 0) {
+                throw JSONRPCError(RPC_WALLET_ERROR, "Could not find witness for note commitment");
+            }
+
+            for (auto& optionalWitness : vInputWitnesses) {
+                if (!optionalWitness) {
+                    throw JSONRPCError(RPC_WALLET_ERROR, "Witness for note commitment is null");
+                }
+                SproutWitness w = *optionalWitness; // could use .value();
+                if (jsChange > 0) {
+                    for (const uint256& commitment : previousCommitments) {
+                        w.append(commitment);
+                    }
+                    if (jsAnchor != w.root()) {
+                        throw JSONRPCError(RPC_WALLET_ERROR, "Witness for spendable note does not have same anchor as change input");
+                    }
+                }
+                witnesses.push_back(w);
+            }
+
+            // The jsAnchor is null if this JoinSplit is at the start of a new chain
+            if (jsAnchor.IsNull()) {
+                jsAnchor = inputAnchor;
+            }
+
+            // Add spendable notes as inputs
+            std::copy(vInputNotes.begin(), vInputNotes.end(), std::back_inserter(info.notes));
+            std::copy(vInputZKeys.begin(), vInputZKeys.end(), std::back_inserter(info.zkeys));
+        }
+
+        // Accumulate change
+        jsChange = jsInputValue + info.vpub_old;
+
+        // Set vpub_new in the last joinsplit (when there are no more notes to spend)
+        if (zInputsDeque.empty()) {
+            assert(!vpubNewProcessed);
+            if (jsInputValue < vpubNewTarget) {
+                throw JSONRPCError(RPC_WALLET_ERROR,
+                                   strprintf("Insufficient funds for vpub_new %s (miners fee %s, taddr inputs %s)",
+                                             FormatMoney(vpubNewTarget), FormatMoney(minersFee), FormatMoney(t_inputs_total)));
+            }
+            info.vpub_new += vpubNewTarget; // funds flowing back to public pool
+            vpubNewProcessed = true;
+            jsChange -= vpubNewTarget;
+            // If we are merging to a t-addr, there should be no change
+            if (isToTaddr_) assert(jsChange == 0);
+        }
+
+        // create dummy output
+        info.vjsout.push_back(JSOutput()); // dummy output while we accumulate funds into a change note for vpub_new
+
+        // create output for any change
+        if (jsChange > 0) {
+            std::string outputType = "change";
+            auto jso = JSOutput(changeAddress, jsChange);
+            // If this is the final output, set the target and memo
+            if (isToZaddr_ && vpubNewProcessed) {
+                outputType = "target";
+                jso.addr = std::get<libzcash::SproutPaymentAddress>(toPaymentAddress_);
+                if (!memo_.empty()) {
+                    jso.memo = get_memo_from_hex_string(memo_);
+                }
+            }
+            info.vjsout.push_back(jso);
+
+            LogPrint("zrpcunsafe", "%s: generating note for %s (amount=%s)\n",
+                     getId(),
+                     outputType,
+                     FormatMoney(jsChange));
+        }
+
+        obj = perform_joinsplit(info, witnesses, jsAnchor);
+
+        if (jsChange > 0) {
+            changeOutputIndex = mta_find_output(obj, 1);
+        }
+    }
+
+    // Sanity check in case changes to code block above exits loop by invoking 'break'
+    assert(zInputsDeque.size() == 0);
+    assert(vpubNewProcessed);
+
+    auto txAndResult = SignSendRawTransaction(obj, std::nullopt, testmode);
+    tx_ = txAndResult.first;
+    set_result(txAndResult.second);
+    return true;
+}
+
+
+UniValue AsyncRPCOperation_mergetoaddress::perform_joinsplit(MergeToAddressJSInfo& info)
+{
+    std::vector<std::optional<SproutWitness>> witnesses;
+    uint256 anchor;
+    {
+        LOCK(cs_main);
+        anchor = pcoinsTip->GetBestAnchor(SPROUT); // As there are no inputs, ask the wallet for the best anchor
+    }
+    return perform_joinsplit(info, witnesses, anchor);
+}
+
+
+UniValue AsyncRPCOperation_mergetoaddress::perform_joinsplit(MergeToAddressJSInfo& info, std::vector<JSOutPoint>& outPoints)
+{
+    std::vector<std::optional<SproutWitness>> witnesses;
+    uint256 anchor;
+    {
+        LOCK(cs_main);
+        if (!pwalletMain->GetSproutNoteWitnesses(outPoints, nAnchorConfirmations, witnesses, anchor)) {
+            // This error should not appear once we're nAnchorConfirmations blocks past
+            // Sprout activation.
+            throw JSONRPCError(RPC_WALLET_ERROR, "Insufficient Sprout witnesses.");
+        }
+    }
+    return perform_joinsplit(info, witnesses, anchor);
+}
+
+UniValue AsyncRPCOperation_mergetoaddress::perform_joinsplit(
+    MergeToAddressJSInfo& info,
+    std::vector<std::optional<SproutWitness>> witnesses,
+    uint256 anchor)
+{
+    if (anchor.IsNull()) {
+        throw std::runtime_error("anchor is null");
+    }
+
+    if (witnesses.size() != info.notes.size()) {
+        throw runtime_error("number of notes and witnesses do not match");
+    }
+
+    if (info.notes.size() != info.zkeys.size()) {
+        throw runtime_error("number of notes and spending keys do not match");
+    }
+
+    for (size_t i = 0; i < witnesses.size(); i++) {
+        if (!witnesses[i]) {
+            throw runtime_error("joinsplit input could not be found in tree");
+        }
+        info.vjsin.push_back(JSInput(*witnesses[i], info.notes[i], info.zkeys[i]));
+    }
+
+    // Make sure there are two inputs and two outputs
+    while (info.vjsin.size() < ZC_NUM_JS_INPUTS) {
+        info.vjsin.push_back(JSInput());
+    }
+
+    while (info.vjsout.size() < ZC_NUM_JS_OUTPUTS) {
+        info.vjsout.push_back(JSOutput());
+    }
+
+    if (info.vjsout.size() != ZC_NUM_JS_INPUTS || info.vjsin.size() != ZC_NUM_JS_OUTPUTS) {
+        throw runtime_error("unsupported joinsplit input/output counts");
+    }
+
+    CMutableTransaction mtx(tx_);
+
+    LogPrint("zrpcunsafe", "%s: creating joinsplit at index %d (vpub_old=%s, vpub_new=%s, in[0]=%s, in[1]=%s, out[0]=%s, out[1]=%s)\n",
+             getId(),
+             tx_.vJoinSplit.size(),
+             FormatMoney(info.vpub_old), FormatMoney(info.vpub_new),
+             FormatMoney(info.vjsin[0].note.value()), FormatMoney(info.vjsin[1].note.value()),
+             FormatMoney(info.vjsout[0].value), FormatMoney(info.vjsout[1].value));
+
+    // Generate the proof, this can take over a minute.
+    std::array<libzcash::JSInput, ZC_NUM_JS_INPUTS> inputs{info.vjsin[0], info.vjsin[1]};
+    std::array<libzcash::JSOutput, ZC_NUM_JS_OUTPUTS> outputs{info.vjsout[0], info.vjsout[1]};
+    std::array<size_t, ZC_NUM_JS_INPUTS> inputMap;
+    std::array<size_t, ZC_NUM_JS_OUTPUTS> outputMap;
+
+    uint256 esk; // payment disclosure - secret
+
+    assert(mtx.fOverwintered && (mtx.nVersion >= SAPLING_TX_VERSION));
+    JSDescription jsdesc = JSDescriptionInfo(
+        joinSplitPubKey_,
+        anchor,
+        inputs,
+        outputs,
+        info.vpub_old,
+        info.vpub_new
+    ).BuildRandomized(
+        inputMap,
+        outputMap,
+        !this->testmode,
+        &esk); // parameter expects pointer to esk, so pass in address
+    {
+        auto verifier = ProofVerifier::Strict();
+        if (!(verifier.VerifySprout(jsdesc, joinSplitPubKey_))) {
+            throw std::runtime_error("error verifying joinsplit");
+        }
+    }
+
+    mtx.vJoinSplit.push_back(jsdesc);
+
+    // Empty output script.
+    CScript scriptCode;
+    CTransaction signTx(mtx);
+    std::vector<CTxOut> allPrevOutputs;
+    for (const MergeToAddressInputUTXO& t : utxoInputs_) {
+        allPrevOutputs.emplace_back(std::get<1>(t), std::get<2>(t));
+    }
+    PrecomputedTransactionData txdata(signTx, allPrevOutputs);
+    uint256 dataToBeSigned = SignatureHash(scriptCode, signTx, NOT_AN_INPUT, SIGHASH_ALL, 0, consensusBranchId_, txdata);
+
+    // Add the signature
+    if (!ed25519_sign(
+        &joinSplitPrivKey_,
+        dataToBeSigned.begin(), 32,
+        &mtx.joinSplitSig))
+    {
+        throw std::runtime_error("ed25519_sign failed");
+    }
+
+    // Sanity check
+    if (!ed25519_verify(
+        &mtx.joinSplitPubKey,
+        &mtx.joinSplitSig,
+        dataToBeSigned.begin(), 32))
+    {
+        throw std::runtime_error("ed25519_verify failed");
+    }
+
+    CTransaction rawTx(mtx);
+    tx_ = rawTx;
+
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << rawTx;
+
+    std::string encryptedNote1;
+    std::string encryptedNote2;
+    {
+        CDataStream ss2(SER_NETWORK, PROTOCOL_VERSION);
+        ss2 << ((unsigned char)0x00);
+        ss2 << jsdesc.ephemeralKey;
+        ss2 << jsdesc.ciphertexts[0];
+        ss2 << ZCJoinSplit::h_sig(jsdesc.randomSeed, jsdesc.nullifiers, joinSplitPubKey_);
+
+        encryptedNote1 = HexStr(ss2.begin(), ss2.end());
+    }
+    {
+        CDataStream ss2(SER_NETWORK, PROTOCOL_VERSION);
+        ss2 << ((unsigned char)0x01);
+        ss2 << jsdesc.ephemeralKey;
+        ss2 << jsdesc.ciphertexts[1];
+        ss2 << ZCJoinSplit::h_sig(jsdesc.randomSeed, jsdesc.nullifiers, joinSplitPubKey_);
+
+        encryptedNote2 = HexStr(ss2.begin(), ss2.end());
+    }
+
+    UniValue arrInputMap(UniValue::VARR);
+    UniValue arrOutputMap(UniValue::VARR);
+    for (size_t i = 0; i < ZC_NUM_JS_INPUTS; i++) {
+        arrInputMap.push_back(static_cast<uint64_t>(inputMap[i]));
+    }
+    for (size_t i = 0; i < ZC_NUM_JS_OUTPUTS; i++) {
+        arrOutputMap.push_back(static_cast<uint64_t>(outputMap[i]));
+    }
+
+    KeyIO keyIO(Params());
+
+    // !!! Payment disclosure START
+    size_t js_index = tx_.vJoinSplit.size() - 1;
+    uint256 placeholder;
+    for (int i = 0; i < ZC_NUM_JS_OUTPUTS; i++) {
+        uint8_t mapped_index = outputMap[i];
+        // placeholder for txid will be filled in later when tx has been finalized and signed.
+        PaymentDisclosureKey pdKey = {placeholder, js_index, mapped_index};
+        JSOutput output = outputs[mapped_index];
+        libzcash::SproutPaymentAddress zaddr = output.addr; // randomized output
+        PaymentDisclosureInfo pdInfo = {PAYMENT_DISCLOSURE_VERSION_EXPERIMENTAL, esk, joinSplitPrivKey_, zaddr};
+        paymentDisclosureData_.push_back(PaymentDisclosureKeyInfo(pdKey, pdInfo));
+
+        LogPrint("paymentdisclosure", "%s: Payment Disclosure: js=%d, n=%d, zaddr=%s\n", getId(), js_index, int(mapped_index), keyIO.EncodePaymentAddress(zaddr));
+    }
+    // !!! Payment disclosure END
+
+    UniValue obj(UniValue::VOBJ);
+    obj.pushKV("encryptednote1", encryptedNote1);
+    obj.pushKV("encryptednote2", encryptedNote2);
+    obj.pushKV("rawtxn", HexStr(ss.begin(), ss.end()));
+    obj.pushKV("inputmap", arrInputMap);
+    obj.pushKV("outputmap", arrOutputMap);
+    return obj;
+}
+
+std::array<unsigned char, ZC_MEMO_SIZE> AsyncRPCOperation_mergetoaddress::get_memo_from_hex_string(std::string s)
+{
+    std::array<unsigned char, ZC_MEMO_SIZE> memo = {{0x00}};
+
+    std::vector<unsigned char> rawMemo = ParseHex(s.c_str());
+
+    // If ParseHex comes across a non-hex char, it will stop but still return results so far.
+    size_t slen = s.length();
+    if (slen % 2 != 0 || (slen > 0 && rawMemo.size() != slen / 2)) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Memo must be in hexadecimal format");
+    }
+
+    if (rawMemo.size() > ZC_MEMO_SIZE) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, strprintf("Memo size of %d is too big, maximum allowed is %d", rawMemo.size(), ZC_MEMO_SIZE));
+    }
+
+    // copy vector into boost array
+    int lenMemo = rawMemo.size();
+    for (int i = 0; i < ZC_MEMO_SIZE && i < lenMemo; i++) {
+        memo[i] = rawMemo[i];
+    }
+    return memo;
+}
+
+/**
+ * Override getStatus() to append the operation's input parameters to the default status object.
+ */
+UniValue AsyncRPCOperation_mergetoaddress::getStatus() const
+{
+    UniValue v = AsyncRPCOperation::getStatus();
+    if (contextinfo_.isNull()) {
+        return v;
+    }
+
+    UniValue obj = v.get_obj();
+    obj.pushKV("method", "z_mergetoaddress");
+    obj.pushKV("params", contextinfo_);
+    return obj;
+}
+
+/**
+ * Lock input utxos
+ */
+ void AsyncRPCOperation_mergetoaddress::lock_utxos() {
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+    for (auto utxo : utxoInputs_) {
+        pwalletMain->LockCoin(std::get<0>(utxo));
+    }
+}
+
+/**
+ * Unlock input utxos
+ */
+void AsyncRPCOperation_mergetoaddress::unlock_utxos() {
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+    for (auto utxo : utxoInputs_) {
+        pwalletMain->UnlockCoin(std::get<0>(utxo));
+    }
+}
+
+
+/**
+ * Lock input notes
+ */
+ void AsyncRPCOperation_mergetoaddress::lock_notes() {
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+    for (auto note : sproutNoteInputs_) {
+        pwalletMain->LockNote(std::get<0>(note));
+    }
+    for (auto note : saplingNoteInputs_) {
+        pwalletMain->LockNote(std::get<0>(note));
+    }
+}
+
+/**
+ * Unlock input notes
+ */
+void AsyncRPCOperation_mergetoaddress::unlock_notes() {
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+    for (auto note : sproutNoteInputs_) {
+        pwalletMain->UnlockNote(std::get<0>(note));
+    }
+    for (auto note : saplingNoteInputs_) {
+        pwalletMain->UnlockNote(std::get<0>(note));
+    }
+}
diff --git a/depend/zcash/src/wallet/asyncrpcoperation_mergetoaddress.h b/depend/zcash/src/wallet/asyncrpcoperation_mergetoaddress.h
new file mode 100644
index 000000000..044eb855a
--- /dev/null
+++ b/depend/zcash/src/wallet/asyncrpcoperation_mergetoaddress.h
@@ -0,0 +1,194 @@
+// Copyright (c) 2017 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_WALLET_ASYNCRPCOPERATION_MERGETOADDRESS_H
+#define ZCASH_WALLET_ASYNCRPCOPERATION_MERGETOADDRESS_H
+
+#include "amount.h"
+#include "asyncrpcoperation.h"
+#include "primitives/transaction.h"
+#include "transaction_builder.h"
+#include "wallet.h"
+#include "wallet/paymentdisclosure.h"
+#include "zcash/Address.hpp"
+#include "zcash/JoinSplit.hpp"
+
+#include <array>
+#include <optional>
+#include <tuple>
+#include <unordered_map>
+
+#include <univalue.h>
+
+#include <rust/ed25519/types.h>
+
+using namespace libzcash;
+
+// Input UTXO is a tuple of txid, vout, amount, script
+typedef std::tuple<COutPoint, CAmount, CScript> MergeToAddressInputUTXO;
+
+// Input JSOP is a tuple of JSOutpoint, note, amount, spending key
+typedef std::tuple<JSOutPoint, SproutNote, CAmount, SproutSpendingKey> MergeToAddressInputSproutNote;
+
+typedef std::tuple<SaplingOutPoint, SaplingNote, CAmount, SaplingExpandedSpendingKey> MergeToAddressInputSaplingNote;
+
+// A recipient is a tuple of address, memo (optional if zaddr)
+typedef std::pair<libzcash::PaymentAddress, std::string> MergeToAddressRecipient;
+
+// Package of info which is passed to perform_joinsplit methods.
+struct MergeToAddressJSInfo {
+    std::vector<JSInput> vjsin;
+    std::vector<JSOutput> vjsout;
+    std::vector<SproutNote> notes;
+    std::vector<SproutSpendingKey> zkeys;
+    CAmount vpub_old = 0;
+    CAmount vpub_new = 0;
+};
+
+// A struct to help us track the witness and anchor for a given JSOutPoint
+struct MergeToAddressWitnessAnchorData {
+    std::optional<SproutWitness> witness;
+    uint256 anchor;
+};
+
+class AsyncRPCOperation_mergetoaddress : public AsyncRPCOperation
+{
+public:
+    AsyncRPCOperation_mergetoaddress(
+        std::optional<TransactionBuilder> builder,
+        CMutableTransaction contextualTx,
+        std::vector<MergeToAddressInputUTXO> utxoInputs,
+        std::vector<MergeToAddressInputSproutNote> sproutNoteInputs,
+        std::vector<MergeToAddressInputSaplingNote> saplingNoteInputs,
+        MergeToAddressRecipient recipient,
+        CAmount fee = DEFAULT_FEE,
+        UniValue contextInfo = NullUniValue);
+    virtual ~AsyncRPCOperation_mergetoaddress();
+
+    // We don't want to be copied or moved around
+    AsyncRPCOperation_mergetoaddress(AsyncRPCOperation_mergetoaddress const&) = delete;            // Copy construct
+    AsyncRPCOperation_mergetoaddress(AsyncRPCOperation_mergetoaddress&&) = delete;                 // Move construct
+    AsyncRPCOperation_mergetoaddress& operator=(AsyncRPCOperation_mergetoaddress const&) = delete; // Copy assign
+    AsyncRPCOperation_mergetoaddress& operator=(AsyncRPCOperation_mergetoaddress&&) = delete;      // Move assign
+
+    virtual void main();
+
+    virtual UniValue getStatus() const;
+
+    bool testmode = false; // Set to true to disable sending txs and generating proofs
+
+    bool paymentDisclosureMode = false; // Set to true to save esk for encrypted notes in payment disclosure database.
+
+private:
+    friend class TEST_FRIEND_AsyncRPCOperation_mergetoaddress; // class for unit testing
+
+    UniValue contextinfo_; // optional data to include in return value from getStatus()
+
+    bool isUsingBuilder_; // Indicates that no Sprout addresses are involved
+    uint32_t consensusBranchId_;
+    CAmount fee_;
+    int mindepth_;
+    bool isToTaddr_;
+    bool isToZaddr_;
+    CTxDestination toTaddr_;
+    PaymentAddress toPaymentAddress_;
+    std::string memo_;
+
+    Ed25519VerificationKey joinSplitPubKey_;
+    Ed25519SigningKey joinSplitPrivKey_;
+
+    // The key is the result string from calling JSOutPoint::ToString()
+    std::unordered_map<std::string, MergeToAddressWitnessAnchorData> jsopWitnessAnchorMap;
+
+    std::vector<MergeToAddressInputUTXO> utxoInputs_;
+    std::vector<MergeToAddressInputSproutNote> sproutNoteInputs_;
+    std::vector<MergeToAddressInputSaplingNote> saplingNoteInputs_;
+
+    TransactionBuilder builder_;
+    CTransaction tx_;
+
+    std::array<unsigned char, ZC_MEMO_SIZE> get_memo_from_hex_string(std::string s);
+    bool main_impl();
+
+    // JoinSplit without any input notes to spend
+    UniValue perform_joinsplit(MergeToAddressJSInfo&);
+
+    // JoinSplit with input notes to spend (JSOutPoints))
+    UniValue perform_joinsplit(MergeToAddressJSInfo&, std::vector<JSOutPoint>&);
+
+    // JoinSplit where you have the witnesses and anchor
+    UniValue perform_joinsplit(
+        MergeToAddressJSInfo& info,
+        std::vector<std::optional<SproutWitness>> witnesses,
+        uint256 anchor);
+
+    void lock_utxos();
+
+    void unlock_utxos();
+
+    void lock_notes();
+
+    void unlock_notes();
+
+    // payment disclosure!
+    std::vector<PaymentDisclosureKeyInfo> paymentDisclosureData_;
+};
+
+
+// To test private methods, a friend class can act as a proxy
+class TEST_FRIEND_AsyncRPCOperation_mergetoaddress
+{
+public:
+    std::shared_ptr<AsyncRPCOperation_mergetoaddress> delegate;
+
+    TEST_FRIEND_AsyncRPCOperation_mergetoaddress(std::shared_ptr<AsyncRPCOperation_mergetoaddress> ptr) : delegate(ptr) {}
+
+    CTransaction getTx()
+    {
+        return delegate->tx_;
+    }
+
+    void setTx(CTransaction tx)
+    {
+        delegate->tx_ = tx;
+    }
+
+    // Delegated methods
+
+    std::array<unsigned char, ZC_MEMO_SIZE> get_memo_from_hex_string(std::string s)
+    {
+        return delegate->get_memo_from_hex_string(s);
+    }
+
+    bool main_impl()
+    {
+        return delegate->main_impl();
+    }
+
+    UniValue perform_joinsplit(MergeToAddressJSInfo& info)
+    {
+        return delegate->perform_joinsplit(info);
+    }
+
+    UniValue perform_joinsplit(MergeToAddressJSInfo& info, std::vector<JSOutPoint>& v)
+    {
+        return delegate->perform_joinsplit(info, v);
+    }
+
+    UniValue perform_joinsplit(
+        MergeToAddressJSInfo& info,
+        std::vector<std::optional<SproutWitness>> witnesses,
+        uint256 anchor)
+    {
+        return delegate->perform_joinsplit(info, witnesses, anchor);
+    }
+
+    void set_state(OperationStatus state)
+    {
+        delegate->state_.store(state);
+    }
+};
+
+
+#endif // ZCASH_WALLET_ASYNCRPCOPERATION_MERGETOADDRESS_H
diff --git a/depend/zcash/src/wallet/asyncrpcoperation_saplingmigration.cpp b/depend/zcash/src/wallet/asyncrpcoperation_saplingmigration.cpp
new file mode 100644
index 000000000..b2dadb5da
--- /dev/null
+++ b/depend/zcash/src/wallet/asyncrpcoperation_saplingmigration.cpp
@@ -0,0 +1,233 @@
+#include "assert.h"
+#include "asyncrpcoperation_saplingmigration.h"
+#include "init.h"
+#include "key_io.h"
+#include "rpc/protocol.h"
+#include "random.h"
+#include "sync.h"
+#include "tinyformat.h"
+#include "transaction_builder.h"
+#include "util.h"
+#include "utilmoneystr.h"
+#include "wallet.h"
+
+#include <optional>
+#include <variant>
+
+const int MIGRATION_EXPIRY_DELTA = 450;
+
+AsyncRPCOperation_saplingmigration::AsyncRPCOperation_saplingmigration(int targetHeight) : targetHeight_(targetHeight) {}
+
+AsyncRPCOperation_saplingmigration::~AsyncRPCOperation_saplingmigration() {}
+
+void AsyncRPCOperation_saplingmigration::main() {
+    if (isCancelled())
+        return;
+
+    set_state(OperationStatus::EXECUTING);
+    start_execution_clock();
+
+    bool success = false;
+
+    try {
+        success = main_impl();
+    } catch (const UniValue& objError) {
+        int code = find_value(objError, "code").get_int();
+        std::string message = find_value(objError, "message").get_str();
+        set_error_code(code);
+        set_error_message(message);
+    } catch (const runtime_error& e) {
+        set_error_code(-1);
+        set_error_message("runtime error: " + string(e.what()));
+    } catch (const logic_error& e) {
+        set_error_code(-1);
+        set_error_message("logic error: " + string(e.what()));
+    } catch (const exception& e) {
+        set_error_code(-1);
+        set_error_message("general exception: " + string(e.what()));
+    } catch (...) {
+        set_error_code(-2);
+        set_error_message("unknown error");
+    }
+
+    stop_execution_clock();
+
+    if (success) {
+        set_state(OperationStatus::SUCCESS);
+    } else {
+        set_state(OperationStatus::FAILED);
+    }
+
+    std::string s = strprintf("%s: Sprout->Sapling transactions created. (status=%s", getId(), getStateAsString());
+    if (success) {
+        s += strprintf(", success)\n");
+    } else {
+        s += strprintf(", error=%s)\n", getErrorMessage());
+    }
+
+    LogPrintf("%s", s);
+}
+
+bool AsyncRPCOperation_saplingmigration::main_impl() {
+    LogPrint("zrpcunsafe", "%s: Beginning AsyncRPCOperation_saplingmigration.\n", getId());
+    const Consensus::Params& consensusParams = Params().GetConsensus();
+    auto nextActivationHeight = NextActivationHeight(targetHeight_, consensusParams);
+    if (nextActivationHeight && targetHeight_ + MIGRATION_EXPIRY_DELTA >= nextActivationHeight.value()) {
+        LogPrint("zrpcunsafe", "%s: Migration txs would be created before a NU activation but may expire after. Skipping this round.\n", getId());
+        setMigrationResult(0, 0, std::vector<std::string>());
+        return true;
+    }
+
+    std::vector<SproutNoteEntry> sproutEntries;
+    std::vector<SaplingNoteEntry> saplingEntries;
+    std::vector<OrchardNoteMetadata> orchardEntries;
+    {
+        LOCK2(cs_main, pwalletMain->cs_wallet);
+        // We set minDepth to 11 to avoid unconfirmed notes and in anticipation of specifying
+        // an anchor at height N-10 for each Sprout JoinSplit description
+        // Consider, should notes be sorted?
+        pwalletMain->GetFilteredNotes(sproutEntries, saplingEntries, orchardEntries, std::nullopt, 11);
+    }
+    CAmount availableFunds = 0;
+    for (const SproutNoteEntry& sproutEntry : sproutEntries) {
+        availableFunds += sproutEntry.note.value();
+    }
+    // If the remaining amount to be migrated is less than 0.01 ZEC, end the migration.
+    if (availableFunds < CENT) {
+        LogPrint("zrpcunsafe", "%s: Available Sprout balance (%s) less than required minimum (%s). Stopping.\n",
+            getId(), FormatMoney(availableFunds), FormatMoney(CENT));
+        setMigrationResult(0, 0, std::vector<std::string>());
+        return true;
+    }
+
+    HDSeed seed = pwalletMain->GetHDSeedForRPC();
+    libzcash::SaplingPaymentAddress migrationDestAddress = getMigrationDestAddress(seed);
+
+
+    // Up to the limit of 5, as many transactions are sent as are needed to migrate the remaining funds
+    int numTxCreated = 0;
+    CAmount amountMigrated = 0;
+    std::vector<std::string> migrationTxIds;
+    int noteIndex = 0;
+    CCoinsViewCache coinsView(pcoinsTip);
+    do {
+        CAmount amountToSend = chooseAmount(availableFunds);
+        auto builder = TransactionBuilder(consensusParams, targetHeight_, std::nullopt, pwalletMain, &coinsView, &cs_main);
+        builder.SetExpiryHeight(targetHeight_ + MIGRATION_EXPIRY_DELTA);
+        LogPrint("zrpcunsafe", "%s: Beginning creating transaction with Sapling output amount=%s\n", getId(), FormatMoney(amountToSend - DEFAULT_FEE));
+        std::vector<SproutNoteEntry> fromNotes;
+        CAmount fromNoteAmount = 0;
+        while (fromNoteAmount < amountToSend) {
+            auto sproutEntry = sproutEntries[noteIndex++];
+            fromNotes.push_back(sproutEntry);
+            fromNoteAmount += sproutEntry.note.value();
+        }
+        availableFunds -= fromNoteAmount;
+        std::optional<libzcash::SproutPaymentAddress> changeAddr;
+        for (const SproutNoteEntry& sproutEntry : fromNotes) {
+            std::string data(sproutEntry.memo.begin(), sproutEntry.memo.end());
+            LogPrint("zrpcunsafe", "%s: Adding Sprout note input (txid=%s, vJoinSplit=%d, jsoutindex=%d, amount=%s, memo=%s)\n",
+                getId(),
+                sproutEntry.jsop.hash.ToString().substr(0, 10),
+                sproutEntry.jsop.js,
+                int(sproutEntry.jsop.n),  // uint8_t
+                FormatMoney(sproutEntry.note.value()),
+                HexStr(data).substr(0, 10)
+                );
+            libzcash::SproutSpendingKey sproutSk;
+            pwalletMain->GetSproutSpendingKey(sproutEntry.address, sproutSk);
+            std::vector<JSOutPoint> vOutPoints = {sproutEntry.jsop};
+            // Each migration transaction uses the anchor at height N-nAnchorConfirmations
+            // for each Sprout JoinSplit description
+            uint256 inputAnchor;
+            std::vector<std::optional<SproutWitness>> vInputWitnesses;
+            if (!pwalletMain->GetSproutNoteWitnesses(vOutPoints, nAnchorConfirmations, vInputWitnesses, inputAnchor)) {
+                // This error should not appear once we're nAnchorConfirmations blocks past
+                // Sprout activation.
+                throw JSONRPCError(RPC_WALLET_ERROR, "Insufficient Sprout witnesses.");
+            }
+            builder.AddSproutInput(sproutSk, sproutEntry.note, vInputWitnesses[0].value());
+            // Send change to the address of the first input
+            if (!changeAddr.has_value()) {
+                changeAddr = sproutSk.address();
+            }
+        }
+        assert(changeAddr.has_value());
+        // The amount chosen *includes* the default fee for this transaction, i.e.
+        // the value of the Sapling output will be 0.00001 ZEC less.
+        builder.SetFee(DEFAULT_FEE);
+        builder.AddSaplingOutput(ovkForShieldingFromTaddr(seed), migrationDestAddress, amountToSend - DEFAULT_FEE);
+        builder.SendChangeToSprout(changeAddr.value());
+        CTransaction tx = builder.Build().GetTxOrThrow();
+        if (isCancelled()) {
+            LogPrint("zrpcunsafe", "%s: Canceled. Stopping.\n", getId());
+            break;
+        }
+        pwalletMain->AddPendingSaplingMigrationTx(tx);
+        LogPrint("zrpcunsafe", "%s: Added pending migration transaction with txid=%s\n", getId(), tx.GetHash().ToString());
+        ++numTxCreated;
+        amountMigrated += amountToSend - DEFAULT_FEE;
+        migrationTxIds.push_back(tx.GetHash().ToString());
+    } while (numTxCreated < 5 && availableFunds > CENT);
+
+    LogPrint("zrpcunsafe", "%s: Created %d transactions with total Sapling output amount=%s\n", getId(), numTxCreated, FormatMoney(amountMigrated));
+    setMigrationResult(numTxCreated, amountMigrated, migrationTxIds);
+    return true;
+}
+
+void AsyncRPCOperation_saplingmigration::setMigrationResult(int numTxCreated, const CAmount& amountMigrated, const std::vector<std::string>& migrationTxIds) {
+    UniValue res(UniValue::VOBJ);
+    res.pushKV("num_tx_created", numTxCreated);
+    res.pushKV("amount_migrated", FormatMoney(amountMigrated));
+    UniValue txIds(UniValue::VARR);
+    for (const std::string& txId : migrationTxIds) {
+        txIds.push_back(txId);
+    }
+    res.pushKV("migration_txids", txIds);
+    set_result(res);
+}
+
+CAmount AsyncRPCOperation_saplingmigration::chooseAmount(const CAmount& availableFunds) {
+    CAmount amount = 0;
+    do {
+        // 1. Choose an integer exponent uniformly in the range 6 to 8 inclusive.
+        int exponent = GetRand(3) + 6;
+        // 2. Choose an integer mantissa uniformly in the range 1 to 99 inclusive.
+        uint64_t mantissa = GetRand(99) + 1;
+        // 3. Calculate amount := (mantissa * 10^exponent) zatoshi.
+        int pow = std::pow(10, exponent);
+        amount = mantissa * pow;
+        // 4. If amount is greater than the amount remaining to send, repeat from step 1.
+    } while (amount > availableFunds);
+    return amount;
+}
+
+// Unless otherwise specified, the migration destination address is the
+// default address for the key at m/32'/coin_type'/0x7FFFFFFF'/0'
+libzcash::SaplingPaymentAddress AsyncRPCOperation_saplingmigration::getMigrationDestAddress(const HDSeed& seed) {
+    KeyIO keyIO(Params());
+    if (mapArgs.count("-migrationdestaddress")) {
+        std::string migrationDestAddress = mapArgs["-migrationdestaddress"];
+        auto address = keyIO.DecodePaymentAddress(migrationDestAddress);
+        assert(address.has_value()); // This is checked in init.cpp
+        auto saplingAddress = std::get_if<libzcash::SaplingPaymentAddress>(&address.value());
+        assert(saplingAddress != nullptr); // This is also checked in init.cpp
+        return *saplingAddress;
+    }
+
+    // TODO: move off of legacy addresses.
+    auto generated = pwalletMain->GenerateLegacySaplingZKey(0);
+    return generated.first;
+}
+
+void AsyncRPCOperation_saplingmigration::cancel() {
+    set_state(OperationStatus::CANCELLED);
+}
+
+UniValue AsyncRPCOperation_saplingmigration::getStatus() const {
+    UniValue v = AsyncRPCOperation::getStatus();
+    UniValue obj = v.get_obj();
+    obj.pushKV("method", "saplingmigration");
+    obj.pushKV("target_height", targetHeight_);
+    return obj;
+}
diff --git a/depend/zcash/src/wallet/asyncrpcoperation_saplingmigration.h b/depend/zcash/src/wallet/asyncrpcoperation_saplingmigration.h
new file mode 100644
index 000000000..7d1d085ef
--- /dev/null
+++ b/depend/zcash/src/wallet/asyncrpcoperation_saplingmigration.h
@@ -0,0 +1,39 @@
+#ifndef ZCASH_WALLET_ASYNCRPCOPERATION_SAPLINGMIGRATION_H
+#define ZCASH_WALLET_ASYNCRPCOPERATION_SAPLINGMIGRATION_H
+
+#include "amount.h"
+#include "asyncrpcoperation.h"
+#include "univalue.h"
+#include "zcash/Address.hpp"
+
+class AsyncRPCOperation_saplingmigration : public AsyncRPCOperation
+{
+public:
+    AsyncRPCOperation_saplingmigration(int targetHeight);
+    virtual ~AsyncRPCOperation_saplingmigration();
+
+    // We don't want to be copied or moved around
+    AsyncRPCOperation_saplingmigration(AsyncRPCOperation_saplingmigration const&) = delete;            // Copy construct
+    AsyncRPCOperation_saplingmigration(AsyncRPCOperation_saplingmigration&&) = delete;                 // Move construct
+    AsyncRPCOperation_saplingmigration& operator=(AsyncRPCOperation_saplingmigration const&) = delete; // Copy assign
+    AsyncRPCOperation_saplingmigration& operator=(AsyncRPCOperation_saplingmigration&&) = delete;      // Move assign
+
+    static libzcash::SaplingPaymentAddress getMigrationDestAddress(const HDSeed& seed);
+
+    virtual void main();
+
+    virtual void cancel();
+
+    virtual UniValue getStatus() const;
+
+private:
+    int targetHeight_;
+
+    bool main_impl();
+
+    void setMigrationResult(int numTxCreated, const CAmount& amountMigrated, const std::vector<std::string>& migrationTxIds);
+
+    CAmount chooseAmount(const CAmount& availableFunds);
+};
+
+#endif // ZCASH_WALLET_ASYNCRPCOPERATION_SAPLINGMIGRATION_H
diff --git a/depend/zcash/src/wallet/asyncrpcoperation_sendmany.cpp b/depend/zcash/src/wallet/asyncrpcoperation_sendmany.cpp
new file mode 100644
index 000000000..8d708b21b
--- /dev/null
+++ b/depend/zcash/src/wallet/asyncrpcoperation_sendmany.cpp
@@ -0,0 +1,812 @@
+// Copyright (c) 2016 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "asyncrpcoperation_sendmany.h"
+
+#include "amount.h"
+#include "asyncrpcoperation_common.h"
+#include "asyncrpcqueue.h"
+#include "consensus/upgrades.h"
+#include "core_io.h"
+#include "experimental_features.h"
+#include "init.h"
+#include "key_io.h"
+#include "main.h"
+#include "net.h"
+#include "netbase.h"
+#include "proof_verifier.h"
+#include "rpc/protocol.h"
+#include "rpc/server.h"
+#include "transaction_builder.h"
+#include "timedata.h"
+#include "util.h"
+#include "util/match.h"
+#include "utilmoneystr.h"
+#include "wallet.h"
+#include "walletdb.h"
+#include "script/interpreter.h"
+#include "utiltime.h"
+#include "zcash/IncrementalMerkleTree.hpp"
+#include "miner.h"
+#include "wallet/paymentdisclosuredb.h"
+
+#include <array>
+#include <iostream>
+#include <chrono>
+#include <thread>
+#include <string>
+#include <utility>
+#include <variant>
+
+#include <rust/ed25519.h>
+
+using namespace libzcash;
+
+AsyncRPCOperation_sendmany::AsyncRPCOperation_sendmany(
+        TransactionBuilder builder,
+        ZTXOSelector ztxoSelector,
+        std::vector<SendManyRecipient> recipients,
+        int minDepth,
+        unsigned int anchorDepth,
+        TransactionStrategy strategy,
+        CAmount fee,
+        UniValue contextInfo) :
+        builder_(std::move(builder)), ztxoSelector_(ztxoSelector), recipients_(recipients),
+        mindepth_(minDepth), anchordepth_(anchorDepth), strategy_(strategy), fee_(fee),
+        contextinfo_(contextInfo)
+{
+    assert(fee_ >= 0);
+    assert(mindepth_ >= 0);
+    assert(!recipients_.empty());
+    assert(ztxoSelector.RequireSpendingKeys());
+
+    sendFromAccount_ = pwalletMain->FindAccountForSelector(ztxoSelector_).value_or(ZCASH_LEGACY_ACCOUNT);
+
+    // Determine the target totals and recipient pools
+    for (const SendManyRecipient& recipient : recipients_) {
+        std::visit(match {
+            [&](const CKeyID& addr) {
+                transparentRecipients_ += 1;
+                txOutputAmounts_.t_outputs_total += recipient.amount;
+                recipientPools_.insert(OutputPool::Transparent);
+            },
+            [&](const CScriptID& addr) {
+                transparentRecipients_ += 1;
+                txOutputAmounts_.t_outputs_total += recipient.amount;
+                recipientPools_.insert(OutputPool::Transparent);
+            },
+            [&](const libzcash::SaplingPaymentAddress& addr) {
+                txOutputAmounts_.sapling_outputs_total += recipient.amount;
+                recipientPools_.insert(OutputPool::Sapling);
+            },
+            [&](const libzcash::OrchardRawAddress& addr) {
+                txOutputAmounts_.orchard_outputs_total += recipient.amount;
+                recipientPools_.insert(OutputPool::Orchard);
+                // No transaction allows sends from Sprout to Orchard.
+                assert(!ztxoSelector_.SelectsSprout());
+            }
+        }, recipient.address);
+    }
+
+    // Log the context info i.e. the call parameters to z_sendmany
+    if (LogAcceptCategory("zrpcunsafe")) {
+        LogPrint("zrpcunsafe", "%s: z_sendmany initialized (params=%s)\n", getId(), contextInfo.write());
+    } else {
+        LogPrint("zrpc", "%s: z_sendmany initialized\n", getId());
+    }
+}
+
+AsyncRPCOperation_sendmany::~AsyncRPCOperation_sendmany() {
+}
+
+void AsyncRPCOperation_sendmany::main() {
+    if (isCancelled())
+        return;
+
+    set_state(OperationStatus::EXECUTING);
+    start_execution_clock();
+
+    bool success = false;
+
+#ifdef ENABLE_MINING
+    GenerateBitcoins(false, 0, Params());
+#endif
+
+    std::optional<uint256> txid;
+    try {
+        txid = main_impl();
+    } catch (const UniValue& objError) {
+        int code = find_value(objError, "code").get_int();
+        std::string message = find_value(objError, "message").get_str();
+        set_error_code(code);
+        set_error_message(message);
+    } catch (const runtime_error& e) {
+        set_error_code(-1);
+        set_error_message("runtime error: " + string(e.what()));
+    } catch (const logic_error& e) {
+        set_error_code(-1);
+        set_error_message("logic error: " + string(e.what()));
+    } catch (const exception& e) {
+        set_error_code(-1);
+        set_error_message("general exception: " + string(e.what()));
+    } catch (...) {
+        set_error_code(-2);
+        set_error_message("unknown error");
+    }
+
+#ifdef ENABLE_MINING
+    GenerateBitcoins(GetBoolArg("-gen", false), GetArg("-genproclimit", 1), Params());
+#endif
+
+    stop_execution_clock();
+
+    if (txid.has_value()) {
+        set_state(OperationStatus::SUCCESS);
+    } else {
+        set_state(OperationStatus::FAILED);
+    }
+
+    std::string s = strprintf("%s: z_sendmany finished (status=%s", getId(), getStateAsString());
+    if (txid.has_value()) {
+        s += strprintf(", txid=%s)\n", txid.value().ToString());
+    } else {
+        s += strprintf(", error=%s)\n", getErrorMessage());
+    }
+    LogPrintf("%s",s);
+}
+
+// Construct and send the transaction, returning the resulting txid.
+// Errors in transaction construction will throw.
+//
+// Notes:
+// 1. #1159 Currently there is no limit set on the number of elements, which could
+//     make the tx too large.
+// 2. #1360 Note selection is not optimal.
+// 3. #1277 Spendable notes are not locked, so an operation running in parallel
+//    could also try to use them.
+// 4. #1614 Anchors are chosen at the most recent block; this is unreliable and leaks
+//    information in case of rollback.
+// 5. #3615 There is no padding of inputs or outputs, which may leak information.
+//
+// At least 4. and 5. differ from the Rust transaction builder.
+uint256 AsyncRPCOperation_sendmany::main_impl() {
+    CAmount sendAmount = (
+        txOutputAmounts_.orchard_outputs_total +
+        txOutputAmounts_.sapling_outputs_total +
+        txOutputAmounts_.t_outputs_total);
+    CAmount targetAmount = sendAmount + fee_;
+
+    builder_.SetFee(fee_);
+
+    // Allow transparent coinbase inputs if there are no transparent
+    // recipients.
+    bool allowTransparentCoinbase = transparentRecipients_ == 0;
+
+    // Set the dust threshold so that we can select enough inputs to avoid
+    // creating dust change amounts.
+    CAmount dustThreshold{DefaultDustThreshold()};
+
+    // Find spendable inputs, and select a minimal set of them that
+    // can supply the required target amount.
+    SpendableInputs spendable;
+    {
+        LOCK2(cs_main, pwalletMain->cs_wallet);
+        spendable = pwalletMain->FindSpendableInputs(ztxoSelector_, allowTransparentCoinbase, mindepth_);
+    }
+    if (!spendable.LimitToAmount(targetAmount, dustThreshold, recipientPools_)) {
+        CAmount changeAmount{spendable.Total() - targetAmount};
+        if (changeAmount > 0 && changeAmount < dustThreshold) {
+            // TODO: we should provide the option for the caller to explicitly
+            // forego change (definitionally an amount below the dust amount)
+            // and send the extra to the recipient or the miner fee to avoid
+            // creating dust change, rather than prohibit them from sending
+            // entirely in this circumstance.
+            // (Daira disagrees, as this could leak information to the recipient)
+            throw JSONRPCError(
+                    RPC_WALLET_INSUFFICIENT_FUNDS,
+                    strprintf(
+                        "Insufficient funds: have %s, need %s more to avoid creating invalid change output %s "
+                        "(dust threshold is %s)",
+                        FormatMoney(spendable.Total()),
+                        FormatMoney(dustThreshold - changeAmount),
+                        FormatMoney(changeAmount),
+                        FormatMoney(dustThreshold)));
+        } else {
+            bool isFromUa = std::holds_alternative<libzcash::UnifiedAddress>(ztxoSelector_.GetPattern());
+            throw JSONRPCError(
+                    RPC_WALLET_INSUFFICIENT_FUNDS,
+                    strprintf(
+                        "Insufficient funds: have %s, need %s",
+                        FormatMoney(spendable.Total()), FormatMoney(targetAmount))
+                        + (allowTransparentCoinbase ? "" :
+                            "; note that coinbase outputs will not be selected if you specify "
+                            "ANY_TADDR or if any transparent recipients are included.")
+                        + ((!isFromUa || strategy_.AllowLinkingAccountAddresses()) ? "" :
+                            " (This transaction may require selecting transparent coins that were sent "
+                            "to multiple Unified Addresses, which is not enabled by default because "
+                            "it would create a public link between the transparent receivers of these "
+                            "addresses. THIS MAY AFFECT YOUR PRIVACY. Resubmit with the `privacyPolicy` "
+                            "parameter set to `AllowLinkingAccountAddresses` or weaker if you wish to "
+                            "allow this transaction to proceed anyway.)")
+                    );
+        }
+    }
+
+    if (!(spendable.utxos.empty() || strategy_.AllowRevealedSenders())) {
+        throw JSONRPCError(
+            RPC_INVALID_PARAMETER,
+            "This transaction requires selecting transparent coins, which is "
+            "not enabled by default because it will publicly reveal transaction "
+            "senders and amounts. THIS MAY AFFECT YOUR PRIVACY. Resubmit "
+            "with the `privacyPolicy` parameter set to `AllowRevealedSenders` "
+            "or weaker if you wish to allow this transaction to proceed anyway.");
+    }
+
+    if (recipientPools_.count(OutputPool::Transparent) && !strategy_.AllowRevealedRecipients()) {
+        throw JSONRPCError(
+            RPC_INVALID_PARAMETER,
+            "This transaction would have transparent recipients, which is not "
+            "enabled by default because it will publicly reveal transaction "
+            "recipients and amounts. THIS MAY AFFECT YOUR PRIVACY. Resubmit "
+            "with the `privacyPolicy` parameter set to `AllowRevealedRecipients` "
+            "or weaker if you wish to allow this transaction to proceed anyway.");
+    }
+
+    if (!spendable.sproutNoteEntries.empty()) {
+        if (recipientPools_.count(OutputPool::Sapling) && !strategy_.AllowRevealedAmounts()) {
+            throw JSONRPCError(
+                RPC_INVALID_PARAMETER,
+                "Sending from the Sprout shielded pool to the Sapling "
+                "shielded pool is not enabled by default because it will "
+                "publicly reveal the transaction amount. THIS MAY AFFECT YOUR PRIVACY. "
+                "Resubmit with the `privacyPolicy` parameter set to `AllowRevealedAmounts` "
+                "or weaker if you wish to allow this transaction to proceed anyway.");
+        }
+    }
+
+    if (!spendable.saplingNoteEntries.empty()) {
+        if (recipientPools_.count(OutputPool::Orchard) && !strategy_.AllowRevealedAmounts()) {
+            throw JSONRPCError(
+                RPC_INVALID_PARAMETER,
+                "Sending from the Sapling shielded pool to the Orchard "
+                "shielded pool is not enabled by default because it will "
+                "publicly reveal the transaction amount. THIS MAY AFFECT YOUR PRIVACY. "
+                "Resubmit with the `privacyPolicy` parameter set to `AllowRevealedAmounts` "
+                "or weaker if you wish to allow this transaction to proceed anyway.");
+        }
+        // Sending from Sapling to transparent will be caught above in the
+        // AllowRevealedRecipients check; sending to Sprout is disallowed
+        // entirely.
+    }
+
+    if (!spendable.orchardNoteMetadata.empty()) {
+        if (recipientPools_.count(OutputPool::Sapling) && !strategy_.AllowRevealedAmounts()) {
+            throw JSONRPCError(
+                RPC_INVALID_PARAMETER,
+                "Sending from the Orchard shielded pool to the Sapling "
+                "shielded pool is not enabled by default because it will "
+                "publicly reveal the transaction amount. THIS MAY AFFECT YOUR PRIVACY. "
+                "Resubmit with the `privacyPolicy` parameter set to `AllowRevealedAmounts` "
+                "or weaker if you wish to allow this transaction to proceed anyway.");
+        }
+
+        // Sending from Orchard to transparent will be caught above in the
+        // AllowRevealedRecipients check; sending to Sprout is disallowed
+        // entirely.
+
+        if (spendable.orchardNoteMetadata.size() > nOrchardActionLimit) {
+            throw JSONRPCError(
+                RPC_INVALID_PARAMETER,
+                strprintf(
+                    "Attempting to spend %u Orchard notes would exceed the current limit "
+                    "of %u notes, which exists to prevent memory exhaustion. Restart with "
+                    "`-orchardactionlimit=N` where N >= %u to allow the wallet to attempt "
+                    "to construct this transaction.",
+                    spendable.orchardNoteMetadata.size(),
+                    nOrchardActionLimit,
+                    spendable.orchardNoteMetadata.size()));
+        }
+    }
+
+    spendable.LogInputs(getId());
+
+    CAmount t_inputs_total{0};
+    CAmount z_inputs_total{0};
+    for (const auto& t : spendable.utxos) {
+        t_inputs_total += t.Value();
+    }
+    for (const auto& t : spendable.sproutNoteEntries) {
+        z_inputs_total += t.note.value();
+    }
+    for (const auto& t : spendable.saplingNoteEntries) {
+        z_inputs_total += t.note.value();
+    }
+    for (const auto& t : spendable.orchardNoteMetadata) {
+        z_inputs_total += t.GetNoteValue();
+    }
+
+    if (z_inputs_total > 0 && mindepth_ == 0) {
+        throw JSONRPCError(
+                RPC_INVALID_PARAMETER,
+                "Minconf cannot be zero when sending from a shielded address");
+    }
+
+    // When spending transparent coinbase outputs, all inputs must be fully
+    // consumed, and they may only be sent to shielded recipients.
+    if (spendable.HasTransparentCoinbase()) {
+        if (t_inputs_total + z_inputs_total != targetAmount) {
+            throw JSONRPCError(
+                    RPC_WALLET_ERROR,
+                    strprintf(
+                        "When shielding coinbase funds, the wallet does not allow any change. "
+                        "The proposed transaction would result in %s in change.",
+                        FormatMoney(t_inputs_total - targetAmount)
+                        ));
+        }
+        if (txOutputAmounts_.t_outputs_total != 0) {
+            throw JSONRPCError(
+                    RPC_WALLET_ERROR,
+                    "Coinbase funds may only be sent to shielded recipients.");
+        }
+    }
+
+    LogPrint("zrpcunsafe", "%s: spending %s to send %s with fee %s\n",
+        getId(), FormatMoney(targetAmount), FormatMoney(sendAmount), FormatMoney(fee_));
+    LogPrint("zrpc", "%s: total transparent input: %s (to choose from)\n", getId(), FormatMoney(t_inputs_total));
+    LogPrint("zrpcunsafe", "%s: total shielded input: %s (to choose from)\n", getId(), FormatMoney(z_inputs_total));
+    LogPrint("zrpc", "%s: total transparent output: %s\n", getId(), FormatMoney(txOutputAmounts_.t_outputs_total));
+    LogPrint("zrpcunsafe", "%s: total shielded Sapling output: %s\n", getId(), FormatMoney(txOutputAmounts_.sapling_outputs_total));
+    LogPrint("zrpcunsafe", "%s: total shielded Orchard output: %s\n", getId(), FormatMoney(txOutputAmounts_.orchard_outputs_total));
+    LogPrint("zrpc", "%s: fee: %s\n", getId(), FormatMoney(fee_));
+
+    // Allow change to go to any pool for which we have recipients.
+    std::set<OutputPool> allowedChangeTypes = recipientPools_;
+
+    // We always allow shielded change when not sending from the legacy account.
+    if (sendFromAccount_ != ZCASH_LEGACY_ACCOUNT) {
+        allowedChangeTypes.insert(OutputPool::Sapling);
+    }
+
+    auto ovks = this->SelectOVKs(spendable);
+    auto allowChangeTypes = [&](const std::set<ReceiverType>& receiverTypes) {
+        for (ReceiverType rtype : receiverTypes) {
+            switch (rtype) {
+                case ReceiverType::P2PKH:
+                case ReceiverType::P2SH:
+                    if (!spendable.utxos.empty() || strategy_.AllowRevealedRecipients()) {
+                        allowedChangeTypes.insert(OutputPool::Transparent);
+                    }
+                    break;
+                case ReceiverType::Sapling:
+                    if (!spendable.saplingNoteEntries.empty() || strategy_.AllowRevealedAmounts()) {
+                        allowedChangeTypes.insert(OutputPool::Sapling);
+                    }
+                    break;
+                case ReceiverType::Orchard:
+                    if (builder_.SupportsOrchard() &&
+                            (!spendable.orchardNoteMetadata.empty() || strategy_.AllowRevealedAmounts())) {
+                        allowedChangeTypes.insert(OutputPool::Orchard);
+                    }
+                    break;
+            }
+        }
+    };
+
+    std::visit(match {
+        [&](const CKeyID& keyId) {
+            allowedChangeTypes.insert(OutputPool::Transparent);
+            auto changeAddr = pwalletMain->GenerateChangeAddressForAccount(
+                    sendFromAccount_, allowedChangeTypes);
+            assert(changeAddr.has_value());
+            builder_.SendChangeTo(changeAddr.value(), ovks.first);
+        },
+        [&](const CScriptID& scriptId) {
+            allowedChangeTypes.insert(OutputPool::Transparent);
+            auto changeAddr = pwalletMain->GenerateChangeAddressForAccount(
+                    sendFromAccount_, allowedChangeTypes);
+            assert(changeAddr.has_value());
+            builder_.SendChangeTo(changeAddr.value(), ovks.first);
+        },
+        [&](const libzcash::SproutPaymentAddress& addr) {
+            // for Sprout, we return change to the originating address.
+            builder_.SendChangeToSprout(addr);
+        },
+        [&](const libzcash::SproutViewingKey& vk) {
+            // for Sprout, we return change to the originating address.
+            builder_.SendChangeToSprout(vk.address());
+        },
+        [&](const libzcash::SaplingPaymentAddress& addr) {
+            // for Sapling, if using a legacy address, return change to the
+            // originating address; otherwise return it to the Sapling internal
+            // address corresponding to the UFVK.
+            if (sendFromAccount_ == ZCASH_LEGACY_ACCOUNT) {
+                builder_.SendChangeTo(addr, ovks.first);
+            } else {
+                auto changeAddr = pwalletMain->GenerateChangeAddressForAccount(
+                        sendFromAccount_, allowedChangeTypes);
+                assert(changeAddr.has_value());
+                builder_.SendChangeTo(changeAddr.value(), ovks.first);
+            }
+        },
+        [&](const libzcash::SaplingExtendedFullViewingKey& fvk) {
+            // for Sapling, if using a legacy address, return change to the
+            // originating address; otherwise return it to the Sapling internal
+            // address corresponding to the UFVK.
+            if (sendFromAccount_ == ZCASH_LEGACY_ACCOUNT) {
+                builder_.SendChangeTo(fvk.DefaultAddress(), ovks.first);
+            } else {
+                auto changeAddr = pwalletMain->GenerateChangeAddressForAccount(
+                        sendFromAccount_, allowedChangeTypes);
+                assert(changeAddr.has_value());
+                builder_.SendChangeTo(changeAddr.value(), ovks.first);
+            }
+        },
+        [&](const libzcash::UnifiedAddress& ua) {
+            allowChangeTypes(ua.GetKnownReceiverTypes());
+
+            auto zufvk = pwalletMain->GetUFVKForAddress(ua);
+            if (!zufvk.has_value()) {
+                throw JSONRPCError(
+                        RPC_WALLET_ERROR,
+                        "Could not determine full viewing key for unified address.");
+            }
+
+            auto changeAddr = zufvk.value().GetChangeAddress(allowedChangeTypes);
+            if (!changeAddr.has_value()) {
+                throw JSONRPCError(
+                        RPC_WALLET_ERROR,
+                        "Could not generate a change address from the inferred full viewing key.");
+            }
+            builder_.SendChangeTo(changeAddr.value(), ovks.first);
+        },
+        [&](const libzcash::UnifiedFullViewingKey& fvk) {
+            allowChangeTypes(fvk.GetKnownReceiverTypes());
+            auto zufvk = ZcashdUnifiedFullViewingKey::FromUnifiedFullViewingKey(Params(), fvk);
+            auto changeAddr = zufvk.GetChangeAddress(allowedChangeTypes);
+            if (!changeAddr.has_value()) {
+                throw JSONRPCError(
+                        RPC_WALLET_ERROR,
+                        "Could not generate a change address from the specified full viewing key.");
+            }
+            builder_.SendChangeTo(changeAddr.value(), ovks.first);
+        },
+        [&](const AccountZTXOPattern& acct) {
+            allowChangeTypes(acct.GetReceiverTypes());
+            auto changeAddr = pwalletMain->GenerateChangeAddressForAccount(
+                        acct.GetAccountId(),
+                        allowedChangeTypes);
+
+            assert(changeAddr.has_value());
+            builder_.SendChangeTo(changeAddr.value(), ovks.first);
+        }
+    }, ztxoSelector_.GetPattern());
+
+    // Track the total of notes that we've added to the builder. This
+    // shouldn't strictly be necessary, given `spendable.LimitToAmount`
+    CAmount sum = 0;
+
+    // Create Sapling outpoints
+    std::vector<SaplingOutPoint> saplingOutPoints;
+    std::vector<SaplingNote> saplingNotes;
+    std::vector<SaplingExtendedSpendingKey> saplingKeys;
+
+    for (const auto& t : spendable.saplingNoteEntries) {
+        saplingOutPoints.push_back(t.op);
+        saplingNotes.push_back(t.note);
+
+        libzcash::SaplingExtendedSpendingKey saplingKey;
+        assert(pwalletMain->GetSaplingExtendedSpendingKey(t.address, saplingKey));
+        saplingKeys.push_back(saplingKey);
+
+        sum += t.note.value();
+        if (sum >= targetAmount) {
+            break;
+        }
+    }
+
+    // Fetch Sapling anchor and witnesses, and Orchard Merkle paths.
+    uint256 anchor;
+    std::vector<std::optional<SaplingWitness>> witnesses;
+    std::vector<std::pair<libzcash::OrchardSpendingKey, orchard::SpendInfo>> orchardSpendInfo;
+    {
+        LOCK2(cs_main, pwalletMain->cs_wallet);
+        if (!pwalletMain->GetSaplingNoteWitnesses(saplingOutPoints, anchordepth_, witnesses, anchor)) {
+            // This error should not appear once we're nAnchorConfirmations blocks past
+            // Sapling activation.
+            throw JSONRPCError(RPC_WALLET_ERROR, "Insufficient Sapling witnesses.");
+        }
+        if (builder_.GetOrchardAnchor().has_value()) {
+            orchardSpendInfo = pwalletMain->GetOrchardSpendInfo(spendable.orchardNoteMetadata, builder_.GetOrchardAnchor().value());
+        }
+    }
+
+    // Add Orchard spends
+    for (size_t i = 0; i < orchardSpendInfo.size(); i++) {
+        auto spendInfo = std::move(orchardSpendInfo[i]);
+        if (!builder_.AddOrchardSpend(
+            std::move(spendInfo.first),
+            std::move(spendInfo.second)))
+        {
+            throw JSONRPCError(
+                RPC_WALLET_ERROR,
+                "Failed to add Orchard note to transaction (check debug.log for details)"
+            );
+        }
+    }
+
+    // Add Sapling spends
+    for (size_t i = 0; i < saplingNotes.size(); i++) {
+        if (!witnesses[i]) {
+            throw JSONRPCError(
+                    RPC_WALLET_ERROR,
+                    strprintf(
+                        "Missing witness for Sapling note at outpoint %s",
+                        spendable.saplingNoteEntries[i].op.ToString())
+                    );
+        }
+
+        builder_.AddSaplingSpend(saplingKeys[i].expsk, saplingNotes[i], anchor, witnesses[i].value());
+    }
+
+    // Add outputs
+    for (const auto& r : recipients_) {
+        std::visit(match {
+            [&](const CKeyID& keyId) {
+                builder_.AddTransparentOutput(keyId, r.amount);
+            },
+            [&](const CScriptID& scriptId) {
+                builder_.AddTransparentOutput(scriptId, r.amount);
+            },
+            [&](const libzcash::SaplingPaymentAddress& addr) {
+                auto value = r.amount;
+                auto memo = get_memo_from_hex_string(r.memo.value_or(""));
+
+                builder_.AddSaplingOutput(ovks.second, addr, value, memo);
+            },
+            [&](const libzcash::OrchardRawAddress& addr) {
+                auto value = r.amount;
+                auto memo = r.memo.has_value() ? std::optional(get_memo_from_hex_string(r.memo.value())) : std::nullopt;
+                builder_.AddOrchardOutput(ovks.second, addr, value, memo);
+            }
+        }, r.address);
+    }
+
+    // Add transparent utxos
+    for (const auto& out : spendable.utxos) {
+        const CTxOut& txOut = out.tx->vout[out.i];
+        builder_.AddTransparentInput(COutPoint(out.tx->GetHash(), out.i), txOut.scriptPubKey, txOut.nValue);
+
+        sum += txOut.nValue;
+        if (sum >= targetAmount) {
+            break;
+        }
+    }
+
+    // Find Sprout witnesses
+    // When spending notes, take a snapshot of note witnesses and anchors as the treestate will
+    // change upon arrival of new blocks which contain joinsplit transactions.  This is likely
+    // to happen as creating a chained joinsplit transaction can take longer than the block interval.
+    // So, we need to take locks on cs_main and pwalletMain->cs_wallet so that the witnesses aren't
+    // updated.
+    //
+    // TODO: these locks would ideally be shared for selection of Sapling anchors and witnesses
+    // as well.
+    std::vector<std::optional<SproutWitness>> vSproutWitnesses;
+    {
+        LOCK2(cs_main, pwalletMain->cs_wallet);
+        std::vector<JSOutPoint> vOutPoints;
+        for (const auto& t : spendable.sproutNoteEntries) {
+            vOutPoints.push_back(t.jsop);
+        }
+
+        // inputAnchor is not needed by builder_.AddSproutInput as it is for Sapling.
+        uint256 inputAnchor;
+        if (!pwalletMain->GetSproutNoteWitnesses(vOutPoints, anchordepth_, vSproutWitnesses, inputAnchor)) {
+            // This error should not appear once we're nAnchorConfirmations blocks past
+            // Sprout activation.
+            throw JSONRPCError(RPC_WALLET_ERROR, "Insufficient Sprout witnesses.");
+        }
+    }
+
+    // Add Sprout spends
+    for (int i = 0; i < spendable.sproutNoteEntries.size(); i++) {
+        const auto& t = spendable.sproutNoteEntries[i];
+        libzcash::SproutSpendingKey sk;
+        assert(pwalletMain->GetSproutSpendingKey(t.address, sk));
+
+        builder_.AddSproutInput(sk, t.note, vSproutWitnesses[i].value());
+
+        sum += t.note.value();
+        if (sum >= targetAmount) {
+            break;
+        }
+    }
+
+    // Build the transaction
+    auto buildResult = builder_.Build();
+    auto tx = buildResult.GetTxOrThrow();
+
+    UniValue sendResult = SendTransaction(tx, recipients_, std::nullopt, testmode);
+    set_result(sendResult);
+
+    return tx.GetHash();
+}
+
+std::pair<uint256, uint256> AsyncRPCOperation_sendmany::SelectOVKs(const SpendableInputs& spendable) const {
+    uint256 internalOVK;
+    uint256 externalOVK;
+    if (!spendable.orchardNoteMetadata.empty()) {
+        std::optional<OrchardFullViewingKey> fvk;
+        std::visit(match {
+            [&](const UnifiedAddress& addr) {
+                auto ufvk = pwalletMain->GetUFVKForAddress(addr);
+                // This is safe because spending key checks will have ensured that we
+                // have a UFVK corresponding to this address, and Orchard notes will
+                // not have been selected if the UFVK does not contain an Orchard key.
+                fvk = ufvk.value().GetOrchardKey().value();
+            },
+            [&](const UnifiedFullViewingKey& ufvk) {
+                // Orchard notes will not have been selected if the UFVK does not contain
+                // an Orchard key.
+                fvk = ufvk.GetOrchardKey().value();
+            },
+            [&](const AccountZTXOPattern& acct) {
+                // By definition, we have a UFVK for every known account.
+                auto ufvk = pwalletMain->GetUnifiedFullViewingKeyByAccount(acct.GetAccountId());
+                // Orchard notes will not have been selected if the UFVK does not contain
+                // an Orchard key.
+                fvk = ufvk.value().GetOrchardKey().value();
+            },
+            [&](const auto& other) {
+                throw std::runtime_error("SelectOVKs: Selector cannot select Orchard notes.");
+            }
+        }, this->ztxoSelector_.GetPattern());
+        assert(fvk.has_value());
+
+        internalOVK = fvk.value().ToInternalOutgoingViewingKey();
+        externalOVK = fvk.value().ToExternalOutgoingViewingKey();
+    } else if (!spendable.saplingNoteEntries.empty()) {
+        std::optional<SaplingDiversifiableFullViewingKey> dfvk;
+        std::visit(match {
+            [&](const libzcash::SaplingPaymentAddress& addr) {
+                libzcash::SaplingExtendedSpendingKey extsk;
+                assert(pwalletMain->GetSaplingExtendedSpendingKey(addr, extsk));
+                dfvk = extsk.ToXFVK();
+            },
+            [&](const UnifiedAddress& addr) {
+                auto ufvk = pwalletMain->GetUFVKForAddress(addr);
+                // This is safe because spending key checks will have ensured that we
+                // have a UFVK corresponding to this address, and Sapling notes will
+                // not have been selected if the UFVK does not contain a Sapling key.
+                dfvk = ufvk.value().GetSaplingKey().value();
+            },
+            [&](const UnifiedFullViewingKey& ufvk) {
+                // Sapling notes will not have been selected if the UFVK does not contain
+                // a Sapling key.
+                dfvk = ufvk.GetSaplingKey().value();
+            },
+            [&](const AccountZTXOPattern& acct) {
+                // By definition, we have a UFVK for every known account.
+                auto ufvk = pwalletMain->GetUnifiedFullViewingKeyByAccount(acct.GetAccountId());
+                // Sapling notes will not have been selected if the UFVK does not contain
+                // a Sapling key.
+                dfvk = ufvk.value().GetSaplingKey().value();
+            },
+            [&](const auto& other) {
+                throw std::runtime_error("SelectOVKs: Selector cannot select Sapling notes.");
+            }
+        }, this->ztxoSelector_.GetPattern());
+        assert(dfvk.has_value());
+
+        auto ovks = dfvk.value().GetOVKs();
+        internalOVK = ovks.first;
+        externalOVK = ovks.second;
+    } else if (!spendable.utxos.empty()) {
+        std::optional<transparent::AccountPubKey> tfvk;
+        std::visit(match {
+            [&](const CKeyID& keyId) {
+                tfvk = pwalletMain->GetLegacyAccountKey().ToAccountPubKey();
+            },
+            [&](const CScriptID& keyId) {
+                tfvk = pwalletMain->GetLegacyAccountKey().ToAccountPubKey();
+            },
+            [&](const UnifiedAddress& addr) {
+                // This is safe because spending key checks will have ensured that we
+                // have a UFVK corresponding to this address, and transparent UTXOs will
+                // not have been selected if the UFVK does not contain a transparent key.
+                auto ufvk = pwalletMain->GetUFVKForAddress(addr);
+                tfvk = ufvk.value().GetTransparentKey().value();
+            },
+            [&](const UnifiedFullViewingKey& ufvk) {
+                // Transparent UTXOs will not have been selected if the UFVK does not contain
+                // a transparent key.
+                tfvk = ufvk.GetTransparentKey().value();
+            },
+            [&](const AccountZTXOPattern& acct) {
+                if (acct.GetAccountId() == ZCASH_LEGACY_ACCOUNT) {
+                    tfvk = pwalletMain->GetLegacyAccountKey().ToAccountPubKey();
+                } else {
+                    // By definition, we have a UFVK for every known account.
+                    auto ufvk = pwalletMain->GetUnifiedFullViewingKeyByAccount(acct.GetAccountId()).value();
+                    // Transparent UTXOs will not have been selected if the UFVK does not contain
+                    // a transparent key.
+                    tfvk = ufvk.GetTransparentKey().value();
+                }
+            },
+            [&](const auto& other) {
+                throw std::runtime_error("SelectOVKs: Selector cannot select transparent UTXOs.");
+            }
+        }, this->ztxoSelector_.GetPattern());
+        assert(tfvk.has_value());
+
+        auto ovks = tfvk.value().GetOVKsForShielding();
+        internalOVK = ovks.first;
+        externalOVK = ovks.second;
+    } else if (!spendable.sproutNoteEntries.empty()) {
+        // use the legacy transparent account OVKs when sending from Sprout
+        auto tfvk = pwalletMain->GetLegacyAccountKey().ToAccountPubKey();
+        auto ovks = tfvk.GetOVKsForShielding();
+        internalOVK = ovks.first;
+        externalOVK = ovks.second;
+    } else {
+        // This should be unreachable; it is left in place as a guard to ensure
+        // that when new input types are added to SpendableInputs in the future
+        // that we do not accidentally return the all-zeros OVK.
+        throw std::runtime_error("No spendable inputs.");
+    }
+
+    return std::make_pair(internalOVK, externalOVK);
+}
+
+/**
+ * Compute a dust threshold based upon a standard p2pkh txout.
+ */
+CAmount AsyncRPCOperation_sendmany::DefaultDustThreshold() {
+    CKey secret{CKey::TestOnlyRandomKey(true)};
+    CScript scriptPubKey = GetScriptForDestination(secret.GetPubKey().GetID());
+    CTxOut txout(CAmount(1), scriptPubKey);
+    // TODO: use a local for minRelayTxFee rather than a global
+    return txout.GetDustThreshold(minRelayTxFee);
+}
+
+std::array<unsigned char, ZC_MEMO_SIZE> AsyncRPCOperation_sendmany::get_memo_from_hex_string(std::string s) {
+    // initialize to default memo (no_memo), see section 5.5 of the protocol spec
+    std::array<unsigned char, ZC_MEMO_SIZE> memo = {{0xF6}};
+
+    std::vector<unsigned char> rawMemo = ParseHex(s.c_str());
+
+    // If ParseHex comes across a non-hex char, it will stop but still return results so far.
+    size_t slen = s.length();
+    if (slen % 2 !=0 || (slen>0 && rawMemo.size()!=slen/2)) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Memo must be in hexadecimal format");
+    }
+
+    if (rawMemo.size() > ZC_MEMO_SIZE) {
+        throw JSONRPCError(
+                RPC_INVALID_PARAMETER,
+                strprintf("Memo size of %d bytes is too big, maximum allowed is %d bytes", rawMemo.size(), ZC_MEMO_SIZE));
+    }
+
+    // copy vector into boost array
+    int lenMemo = rawMemo.size();
+    for (int i = 0; i < ZC_MEMO_SIZE && i < lenMemo; i++) {
+        memo[i] = rawMemo[i];
+    }
+    return memo;
+}
+
+/**
+ * Override getStatus() to append the operation's input parameters to the default status object.
+ */
+UniValue AsyncRPCOperation_sendmany::getStatus() const {
+    UniValue v = AsyncRPCOperation::getStatus();
+    if (contextinfo_.isNull()) {
+        return v;
+    }
+
+    UniValue obj = v.get_obj();
+    obj.pushKV("method", "z_sendmany");
+    obj.pushKV("params", contextinfo_ );
+    return obj;
+}
diff --git a/depend/zcash/src/wallet/asyncrpcoperation_sendmany.h b/depend/zcash/src/wallet/asyncrpcoperation_sendmany.h
new file mode 100644
index 000000000..67ac52c26
--- /dev/null
+++ b/depend/zcash/src/wallet/asyncrpcoperation_sendmany.h
@@ -0,0 +1,122 @@
+// Copyright (c) 2016 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_WALLET_ASYNCRPCOPERATION_SENDMANY_H
+#define ZCASH_WALLET_ASYNCRPCOPERATION_SENDMANY_H
+
+#include "asyncrpcoperation.h"
+#include "amount.h"
+#include "primitives/transaction.h"
+#include "transaction_builder.h"
+#include "zcash/JoinSplit.hpp"
+#include "zcash/Address.hpp"
+#include "wallet.h"
+#include "wallet/paymentdisclosure.h"
+
+#include <array>
+#include <optional>
+#include <unordered_map>
+#include <tuple>
+
+#include <univalue.h>
+
+#include <rust/ed25519/types.h>
+
+using namespace libzcash;
+
+class SendManyRecipient : public RecipientMapping {
+public:
+    CAmount amount;
+    std::optional<std::string> memo;
+
+    SendManyRecipient(std::optional<libzcash::UnifiedAddress> ua_, libzcash::RecipientAddress address_, CAmount amount_, std::optional<std::string> memo_) :
+        RecipientMapping(ua_, address_), amount(amount_), memo(memo_) {}
+};
+
+class TxOutputAmounts {
+public:
+    CAmount t_outputs_total{0};
+    CAmount sapling_outputs_total{0};
+    CAmount orchard_outputs_total{0};
+};
+
+class AsyncRPCOperation_sendmany : public AsyncRPCOperation {
+public:
+    AsyncRPCOperation_sendmany(
+        TransactionBuilder builder,
+        ZTXOSelector ztxoSelector,
+        std::vector<SendManyRecipient> recipients,
+        int minDepth,
+        unsigned int anchorDepth,
+        TransactionStrategy strategy,
+        CAmount fee = DEFAULT_FEE,
+        UniValue contextInfo = NullUniValue);
+    virtual ~AsyncRPCOperation_sendmany();
+
+    // We don't want to be copied or moved around
+    AsyncRPCOperation_sendmany(AsyncRPCOperation_sendmany const&) = delete;             // Copy construct
+    AsyncRPCOperation_sendmany(AsyncRPCOperation_sendmany&&) = delete;                  // Move construct
+    AsyncRPCOperation_sendmany& operator=(AsyncRPCOperation_sendmany const&) = delete;  // Copy assign
+    AsyncRPCOperation_sendmany& operator=(AsyncRPCOperation_sendmany &&) = delete;      // Move assign
+
+    virtual void main();
+
+    virtual UniValue getStatus() const;
+
+    bool testmode{false};  // Set to true to disable sending txs and generating proofs
+
+private:
+    friend class TEST_FRIEND_AsyncRPCOperation_sendmany;    // class for unit testing
+
+    TransactionBuilder builder_;
+    ZTXOSelector ztxoSelector_;
+    std::vector<SendManyRecipient> recipients_;
+    int mindepth_{1};
+    unsigned int anchordepth_{nAnchorConfirmations};
+    CAmount fee_;
+    UniValue contextinfo_;     // optional data to include in return value from getStatus()
+
+    bool isfromsprout_{false};
+    bool isfromsapling_{false};
+    TransactionStrategy strategy_;
+    uint32_t transparentRecipients_{0};
+    AccountId sendFromAccount_;
+    std::set<OutputPool> recipientPools_;
+    TxOutputAmounts txOutputAmounts_;
+
+    /**
+     * Compute the internal and external OVKs to use in transaction construction, given
+     * the spendable inputs.
+     */
+    std::pair<uint256, uint256> SelectOVKs(const SpendableInputs& spendable) const;
+
+    static CAmount DefaultDustThreshold();
+
+    static std::array<unsigned char, ZC_MEMO_SIZE> get_memo_from_hex_string(std::string s);
+
+    uint256 main_impl();
+};
+
+// To test private methods, a friend class can act as a proxy
+class TEST_FRIEND_AsyncRPCOperation_sendmany {
+public:
+    std::shared_ptr<AsyncRPCOperation_sendmany> delegate;
+
+    TEST_FRIEND_AsyncRPCOperation_sendmany(std::shared_ptr<AsyncRPCOperation_sendmany> ptr) : delegate(ptr) {}
+
+    std::array<unsigned char, ZC_MEMO_SIZE> get_memo_from_hex_string(std::string s) {
+        return delegate->get_memo_from_hex_string(s);
+    }
+
+    uint256 main_impl() {
+        return delegate->main_impl();
+    }
+
+    void set_state(OperationStatus state) {
+        delegate->state_.store(state);
+    }
+};
+
+
+#endif // ZCASH_WALLET_ASYNCRPCOPERATION_SENDMANY_H
diff --git a/depend/zcash/src/wallet/asyncrpcoperation_shieldcoinbase.cpp b/depend/zcash/src/wallet/asyncrpcoperation_shieldcoinbase.cpp
new file mode 100644
index 000000000..627877d87
--- /dev/null
+++ b/depend/zcash/src/wallet/asyncrpcoperation_shieldcoinbase.cpp
@@ -0,0 +1,497 @@
+// Copyright (c) 2017 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "asyncrpcoperation_shieldcoinbase.h"
+
+#include "amount.h"
+#include "asyncrpcoperation_common.h"
+#include "asyncrpcqueue.h"
+#include "consensus/upgrades.h"
+#include "core_io.h"
+#include "experimental_features.h"
+#include "init.h"
+#include "key_io.h"
+#include "main.h"
+#include "net.h"
+#include "netbase.h"
+#include "proof_verifier.h"
+#include "rpc/protocol.h"
+#include "rpc/server.h"
+#include "transaction_builder.h"
+#include "timedata.h"
+#include "util.h"
+#include "utilmoneystr.h"
+#include "wallet.h"
+#include "walletdb.h"
+#include "script/interpreter.h"
+#include "utiltime.h"
+#include "util/match.h"
+#include "zcash/IncrementalMerkleTree.hpp"
+#include "miner.h"
+#include "wallet/paymentdisclosuredb.h"
+
+#include <array>
+#include <iostream>
+#include <chrono>
+#include <optional>
+#include <thread>
+#include <string>
+#include <variant>
+
+#include <rust/ed25519.h>
+
+using namespace libzcash;
+
+static int find_output(UniValue obj, int n) {
+    UniValue outputMapValue = find_value(obj, "outputmap");
+    if (!outputMapValue.isArray()) {
+        throw JSONRPCError(RPC_WALLET_ERROR, "Missing outputmap for JoinSplit operation");
+    }
+
+    UniValue outputMap = outputMapValue.get_array();
+    assert(outputMap.size() == ZC_NUM_JS_OUTPUTS);
+    for (size_t i = 0; i < outputMap.size(); i++) {
+        if (outputMap[i].get_int() == n) {
+            return i;
+        }
+    }
+
+    throw std::logic_error("n is not present in outputmap");
+}
+
+AsyncRPCOperation_shieldcoinbase::AsyncRPCOperation_shieldcoinbase(
+        TransactionBuilder builder,
+        CMutableTransaction contextualTx,
+        std::vector<ShieldCoinbaseUTXO> inputs,
+        PaymentAddress toAddress,
+        CAmount fee,
+        UniValue contextInfo) :
+        builder_(std::move(builder)), tx_(contextualTx), inputs_(inputs), fee_(fee), contextinfo_(contextInfo)
+{
+    assert(contextualTx.nVersion >= 2);  // transaction format version must support vJoinSplit
+
+    if (fee < 0 || fee > MAX_MONEY) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Fee is out of range");
+    }
+
+    if (inputs.size() == 0) {
+        throw JSONRPCError(RPC_WALLET_INSUFFICIENT_FUNDS, "Empty inputs");
+    }
+
+    //  Check the destination address is valid for this network i.e. not testnet being used on mainnet
+    std::visit(match {
+        [&](CKeyID addr) {
+            throw JSONRPCError(RPC_VERIFY_REJECTED, "Cannot shield coinbase output to a p2pkh address.");
+        },
+        [&](CScriptID addr) {
+            throw JSONRPCError(RPC_VERIFY_REJECTED, "Cannot shield coinbase output to a p2sh address.");
+        },
+        [&](libzcash::SaplingPaymentAddress addr) {
+            tozaddr_ = addr;
+        },
+        [&](libzcash::SproutPaymentAddress addr) {
+            tozaddr_ = addr;
+        },
+        [&](libzcash::UnifiedAddress addr) {
+            tozaddr_ = addr;
+        }
+    }, toAddress);
+
+    // Log the context info
+    if (LogAcceptCategory("zrpcunsafe")) {
+        LogPrint("zrpcunsafe", "%s: z_shieldcoinbase initialized (context=%s)\n", getId(), contextInfo.write());
+    } else {
+        LogPrint("zrpc", "%s: z_shieldcoinbase initialized\n", getId());
+    }
+
+    // Lock UTXOs
+    lock_utxos();
+
+    // Enable payment disclosure if requested
+    paymentDisclosureMode = fExperimentalPaymentDisclosure;
+}
+
+AsyncRPCOperation_shieldcoinbase::~AsyncRPCOperation_shieldcoinbase() {
+}
+
+void AsyncRPCOperation_shieldcoinbase::main() {
+    if (isCancelled()) {
+        unlock_utxos(); // clean up
+        return;
+    }
+
+    set_state(OperationStatus::EXECUTING);
+    start_execution_clock();
+
+    bool success = false;
+
+#ifdef ENABLE_MINING
+    GenerateBitcoins(false, 0, Params());
+#endif
+
+    try {
+        success = main_impl();
+    } catch (const UniValue& objError) {
+        int code = find_value(objError, "code").get_int();
+        std::string message = find_value(objError, "message").get_str();
+        set_error_code(code);
+        set_error_message(message);
+    } catch (const runtime_error& e) {
+        set_error_code(-1);
+        set_error_message("runtime error: " + string(e.what()));
+    } catch (const logic_error& e) {
+        set_error_code(-1);
+        set_error_message("logic error: " + string(e.what()));
+    } catch (const exception& e) {
+        set_error_code(-1);
+        set_error_message("general exception: " + string(e.what()));
+    } catch (...) {
+        set_error_code(-2);
+        set_error_message("unknown error");
+    }
+
+#ifdef ENABLE_MINING
+    GenerateBitcoins(GetBoolArg("-gen",false), GetArg("-genproclimit", 1), Params());
+#endif
+
+    stop_execution_clock();
+
+    if (success) {
+        set_state(OperationStatus::SUCCESS);
+    } else {
+        set_state(OperationStatus::FAILED);
+    }
+
+    std::string s = strprintf("%s: z_shieldcoinbase finished (status=%s", getId(), getStateAsString());
+    if (success) {
+        s += strprintf(", txid=%s)\n", tx_.GetHash().ToString());
+    } else {
+        s += strprintf(", error=%s)\n", getErrorMessage());
+    }
+    LogPrintf("%s",s);
+
+    unlock_utxos(); // clean up
+
+    // !!! Payment disclosure START
+    if (success && paymentDisclosureMode && paymentDisclosureData_.size()>0) {
+        uint256 txidhash = tx_.GetHash();
+        std::shared_ptr<PaymentDisclosureDB> db = PaymentDisclosureDB::sharedInstance();
+        for (PaymentDisclosureKeyInfo p : paymentDisclosureData_) {
+            p.first.hash = txidhash;
+            if (!db->Put(p.first, p.second)) {
+                LogPrint("paymentdisclosure", "%s: Payment Disclosure: Error writing entry to database for key %s\n", getId(), p.first.ToString());
+            } else {
+                LogPrint("paymentdisclosure", "%s: Payment Disclosure: Successfully added entry to database for key %s\n", getId(), p.first.ToString());
+            }
+        }
+    }
+    // !!! Payment disclosure END
+}
+
+bool AsyncRPCOperation_shieldcoinbase::main_impl() {
+
+    CAmount minersFee = fee_;
+
+    size_t numInputs = inputs_.size();
+
+    CAmount targetAmount = 0;
+    for (ShieldCoinbaseUTXO & utxo : inputs_) {
+        targetAmount += utxo.amount;
+    }
+
+    if (targetAmount <= minersFee) {
+        throw JSONRPCError(RPC_WALLET_INSUFFICIENT_FUNDS,
+            strprintf("Insufficient coinbase funds, have %s and miners fee is %s",
+            FormatMoney(targetAmount), FormatMoney(minersFee)));
+    }
+
+    CAmount sendAmount = targetAmount - minersFee;
+    LogPrint("zrpc", "%s: spending %s to shield %s with fee %s\n",
+            getId(), FormatMoney(targetAmount), FormatMoney(sendAmount), FormatMoney(minersFee));
+
+    return std::visit(ShieldToAddress(this, sendAmount), tozaddr_);
+}
+
+void ShieldToAddress::shieldToAddress(const libzcash::RecipientAddress& recipient, AsyncRPCOperation_shieldcoinbase *m_op) {
+    m_op->builder_.SetFee(m_op->fee_);
+
+    // Sending from a t-address, which we don't have an ovk for. Instead,
+    // generate a common one from the HD seed. This ensures the data is
+    // recoverable, while keeping it logically separate from the ZIP 32
+    // Sapling key hierarchy, which the user might not be using.
+    // FIXME: update to use the ZIP-316 OVK (#5511)
+    HDSeed seed = pwalletMain->GetHDSeedForRPC();
+    uint256 ovk = ovkForShieldingFromTaddr(seed);
+
+    // Add transparent inputs
+    for (auto t : m_op->inputs_) {
+        m_op->builder_.AddTransparentInput(COutPoint(t.txid, t.vout), t.scriptPubKey, t.amount);
+    }
+
+    // Send all value to the target recipient
+    m_op->builder_.SendChangeTo(recipient, ovk);
+
+    // Build the transaction
+    m_op->tx_ = m_op->builder_.Build().GetTxOrThrow();
+}
+
+bool ShieldToAddress::operator()(const CKeyID &addr) const {
+    return false;
+}
+
+bool ShieldToAddress::operator()(const CScriptID &addr) const {
+    return false;
+}
+
+bool ShieldToAddress::operator()(const libzcash::SproutPaymentAddress &zaddr) const {
+    // update the transaction with these inputs
+    CMutableTransaction rawTx(m_op->tx_);
+    for (ShieldCoinbaseUTXO & t : m_op->inputs_) {
+        CTxIn in(COutPoint(t.txid, t.vout));
+        rawTx.vin.push_back(in);
+    }
+    m_op->tx_ = CTransaction(rawTx);
+
+    // Prepare raw transaction to handle JoinSplits
+    CMutableTransaction mtx(m_op->tx_);
+    ed25519_generate_keypair(&m_op->joinSplitPrivKey_, &m_op->joinSplitPubKey_);
+    mtx.joinSplitPubKey = m_op->joinSplitPubKey_;
+    m_op->tx_ = CTransaction(mtx);
+
+    // Create joinsplit
+    ShieldCoinbaseJSInfo info;
+    info.vpub_old = sendAmount;
+    info.vpub_new = 0;
+    JSOutput jso = JSOutput(zaddr, sendAmount);
+    info.vjsout.push_back(jso);
+    UniValue obj = m_op->perform_joinsplit(info);
+
+    auto txAndResult = SignSendRawTransaction(obj, std::nullopt, m_op->testmode);
+    m_op->tx_ = txAndResult.first;
+    m_op->set_result(txAndResult.second);
+    return true;
+}
+
+bool ShieldToAddress::operator()(const libzcash::SaplingPaymentAddress &zaddr) const {
+    ShieldToAddress::shieldToAddress(zaddr, m_op);
+
+    std::vector<RecipientMapping> recipientMappings;
+    UniValue sendResult = SendTransaction(m_op->tx_, recipientMappings, std::nullopt, m_op->testmode);
+    m_op->set_result(sendResult);
+
+    return true;
+}
+
+bool ShieldToAddress::operator()(const libzcash::UnifiedAddress &uaddr) const {
+    // TODO check if an Orchard address is present, send to it if so.
+    const auto receiver{uaddr.GetSaplingReceiver()};
+    if (receiver.has_value()) {
+        ShieldToAddress::shieldToAddress(receiver.value(), m_op);
+
+        std::vector<RecipientMapping> recipientMappings = {RecipientMapping(uaddr, receiver.value())};
+        UniValue sendResult = SendTransaction(m_op->tx_, recipientMappings, std::nullopt, m_op->testmode);
+        m_op->set_result(sendResult);
+
+        return true;
+    }
+    // This UA must contain a transparent address, which can't be the destination of coinbase shielding.
+    return false;
+}
+
+UniValue AsyncRPCOperation_shieldcoinbase::perform_joinsplit(ShieldCoinbaseJSInfo & info) {
+    uint32_t consensusBranchId;
+    uint256 anchor;
+    {
+        LOCK(cs_main);
+        consensusBranchId = CurrentEpochBranchId(chainActive.Height() + 1, Params().GetConsensus());
+        anchor = pcoinsTip->GetBestAnchor(SPROUT);
+    }
+
+
+    if (anchor.IsNull()) {
+        throw std::runtime_error("anchor is null");
+    }
+
+    // Make sure there are two inputs and two outputs
+    while (info.vjsin.size() < ZC_NUM_JS_INPUTS) {
+        info.vjsin.push_back(JSInput());
+    }
+
+    while (info.vjsout.size() < ZC_NUM_JS_OUTPUTS) {
+        info.vjsout.push_back(JSOutput());
+    }
+
+    if (info.vjsout.size() != ZC_NUM_JS_INPUTS || info.vjsin.size() != ZC_NUM_JS_OUTPUTS) {
+        throw runtime_error("unsupported joinsplit input/output counts");
+    }
+
+    CMutableTransaction mtx(tx_);
+
+    LogPrint("zrpcunsafe", "%s: creating joinsplit at index %d (vpub_old=%s, vpub_new=%s, in[0]=%s, in[1]=%s, out[0]=%s, out[1]=%s)\n",
+            getId(),
+            tx_.vJoinSplit.size(),
+            FormatMoney(info.vpub_old), FormatMoney(info.vpub_new),
+            FormatMoney(info.vjsin[0].note.value()), FormatMoney(info.vjsin[1].note.value()),
+            FormatMoney(info.vjsout[0].value), FormatMoney(info.vjsout[1].value)
+            );
+
+    // Generate the proof, this can take over a minute.
+    std::array<libzcash::JSInput, ZC_NUM_JS_INPUTS> inputs
+            {info.vjsin[0], info.vjsin[1]};
+    std::array<libzcash::JSOutput, ZC_NUM_JS_OUTPUTS> outputs
+            {info.vjsout[0], info.vjsout[1]};
+    std::array<size_t, ZC_NUM_JS_INPUTS> inputMap;
+    std::array<size_t, ZC_NUM_JS_OUTPUTS> outputMap;
+
+    uint256 esk; // payment disclosure - secret
+
+    assert(mtx.fOverwintered && (mtx.nVersion >= SAPLING_TX_VERSION));
+    JSDescription jsdesc = JSDescriptionInfo(
+            joinSplitPubKey_,
+            anchor,
+            inputs,
+            outputs,
+            info.vpub_old,
+            info.vpub_new
+    ).BuildRandomized(
+            inputMap,
+            outputMap,
+            !this->testmode,
+            &esk); // parameter expects pointer to esk, so pass in address
+    {
+        auto verifier = ProofVerifier::Strict();
+        if (!(verifier.VerifySprout(jsdesc, joinSplitPubKey_))) {
+            throw std::runtime_error("error verifying joinsplit");
+        }
+    }
+
+    mtx.vJoinSplit.push_back(jsdesc);
+
+    // Empty output script.
+    CScript scriptCode;
+    CTransaction signTx(mtx);
+    std::vector<CTxOut> allPrevOutputs;
+    for (ShieldCoinbaseUTXO & t : inputs_) {
+        allPrevOutputs.emplace_back(t.amount, t.scriptPubKey);
+    }
+    PrecomputedTransactionData txdata(signTx, allPrevOutputs);
+    uint256 dataToBeSigned = SignatureHash(scriptCode, signTx, NOT_AN_INPUT, SIGHASH_ALL, 0, consensusBranchId, txdata);
+
+    // Add the signature
+    if (!ed25519_sign(
+        &joinSplitPrivKey_,
+        dataToBeSigned.begin(), 32,
+        &mtx.joinSplitSig))
+    {
+        throw std::runtime_error("ed25519_sign failed");
+    }
+
+    // Sanity check
+    if (!ed25519_verify(
+        &mtx.joinSplitPubKey,
+        &mtx.joinSplitSig,
+        dataToBeSigned.begin(), 32))
+    {
+        throw std::runtime_error("ed25519_verify failed");
+    }
+
+    CTransaction rawTx(mtx);
+    tx_ = rawTx;
+
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << rawTx;
+
+    std::string encryptedNote1;
+    std::string encryptedNote2;
+    {
+        CDataStream ss2(SER_NETWORK, PROTOCOL_VERSION);
+        ss2 << ((unsigned char) 0x00);
+        ss2 << jsdesc.ephemeralKey;
+        ss2 << jsdesc.ciphertexts[0];
+        ss2 << ZCJoinSplit::h_sig(jsdesc.randomSeed, jsdesc.nullifiers, joinSplitPubKey_);
+
+        encryptedNote1 = HexStr(ss2.begin(), ss2.end());
+    }
+    {
+        CDataStream ss2(SER_NETWORK, PROTOCOL_VERSION);
+        ss2 << ((unsigned char) 0x01);
+        ss2 << jsdesc.ephemeralKey;
+        ss2 << jsdesc.ciphertexts[1];
+        ss2 << ZCJoinSplit::h_sig(jsdesc.randomSeed, jsdesc.nullifiers, joinSplitPubKey_);
+
+        encryptedNote2 = HexStr(ss2.begin(), ss2.end());
+    }
+
+    UniValue arrInputMap(UniValue::VARR);
+    UniValue arrOutputMap(UniValue::VARR);
+    for (size_t i = 0; i < ZC_NUM_JS_INPUTS; i++) {
+        arrInputMap.push_back(static_cast<uint64_t>(inputMap[i]));
+    }
+    for (size_t i = 0; i < ZC_NUM_JS_OUTPUTS; i++) {
+        arrOutputMap.push_back(static_cast<uint64_t>(outputMap[i]));
+    }
+
+    KeyIO keyIO(Params());
+
+    // !!! Payment disclosure START
+    size_t js_index = tx_.vJoinSplit.size() - 1;
+    uint256 placeholder;
+    for (int i = 0; i < ZC_NUM_JS_OUTPUTS; i++) {
+        uint8_t mapped_index = outputMap[i];
+        // placeholder for txid will be filled in later when tx has been finalized and signed.
+        PaymentDisclosureKey pdKey = {placeholder, js_index, mapped_index};
+        JSOutput output = outputs[mapped_index];
+        libzcash::SproutPaymentAddress zaddr = output.addr;  // randomized output
+        PaymentDisclosureInfo pdInfo = {PAYMENT_DISCLOSURE_VERSION_EXPERIMENTAL, esk, joinSplitPrivKey_, zaddr};
+        paymentDisclosureData_.push_back(PaymentDisclosureKeyInfo(pdKey, pdInfo));
+
+        LogPrint("paymentdisclosure", "%s: Payment Disclosure: js=%d, n=%d, zaddr=%s\n", getId(), js_index, int(mapped_index), keyIO.EncodePaymentAddress(zaddr));
+    }
+    // !!! Payment disclosure END
+
+    UniValue obj(UniValue::VOBJ);
+    obj.pushKV("encryptednote1", encryptedNote1);
+    obj.pushKV("encryptednote2", encryptedNote2);
+    obj.pushKV("rawtxn", HexStr(ss.begin(), ss.end()));
+    obj.pushKV("inputmap", arrInputMap);
+    obj.pushKV("outputmap", arrOutputMap);
+    return obj;
+}
+
+/**
+ * Override getStatus() to append the operation's context object to the default status object.
+ */
+UniValue AsyncRPCOperation_shieldcoinbase::getStatus() const {
+    UniValue v = AsyncRPCOperation::getStatus();
+    if (contextinfo_.isNull()) {
+        return v;
+    }
+
+    UniValue obj = v.get_obj();
+    obj.pushKV("method", "z_shieldcoinbase");
+    obj.pushKV("params", contextinfo_ );
+    return obj;
+}
+
+/**
+ * Lock input utxos
+ */
+ void AsyncRPCOperation_shieldcoinbase::lock_utxos() {
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+    for (auto utxo : inputs_) {
+        COutPoint outpt(utxo.txid, utxo.vout);
+        pwalletMain->LockCoin(outpt);
+    }
+}
+
+/**
+ * Unlock input utxos
+ */
+void AsyncRPCOperation_shieldcoinbase::unlock_utxos() {
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+    for (auto utxo : inputs_) {
+        COutPoint outpt(utxo.txid, utxo.vout);
+        pwalletMain->UnlockCoin(outpt);
+    }
+}
diff --git a/depend/zcash/src/wallet/asyncrpcoperation_shieldcoinbase.h b/depend/zcash/src/wallet/asyncrpcoperation_shieldcoinbase.h
new file mode 100644
index 000000000..9decdcb47
--- /dev/null
+++ b/depend/zcash/src/wallet/asyncrpcoperation_shieldcoinbase.h
@@ -0,0 +1,148 @@
+// Copyright (c) 2017 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_WALLET_ASYNCRPCOPERATION_SHIELDCOINBASE_H
+#define ZCASH_WALLET_ASYNCRPCOPERATION_SHIELDCOINBASE_H
+
+#include "asyncrpcoperation.h"
+#include "amount.h"
+#include "primitives/transaction.h"
+#include "transaction_builder.h"
+#include "zcash/JoinSplit.hpp"
+#include "zcash/Address.hpp"
+#include "wallet.h"
+#include "wallet/paymentdisclosure.h"
+
+#include <unordered_map>
+#include <tuple>
+
+#include <univalue.h>
+
+#include <rust/ed25519/types.h>
+
+using namespace libzcash;
+
+struct ShieldCoinbaseUTXO {
+    uint256 txid;
+    int vout;
+    CScript scriptPubKey;
+    CAmount amount;
+};
+
+// Package of info which is passed to perform_joinsplit methods.
+struct ShieldCoinbaseJSInfo
+{
+    std::vector<JSInput> vjsin;
+    std::vector<JSOutput> vjsout;
+    CAmount vpub_old = 0;
+    CAmount vpub_new = 0;
+};
+
+class AsyncRPCOperation_shieldcoinbase : public AsyncRPCOperation {
+public:
+    AsyncRPCOperation_shieldcoinbase(
+        TransactionBuilder builder,
+        CMutableTransaction contextualTx,
+        std::vector<ShieldCoinbaseUTXO> inputs,
+        PaymentAddress toAddress,
+        CAmount fee = DEFAULT_FEE,
+        UniValue contextInfo = NullUniValue);
+    virtual ~AsyncRPCOperation_shieldcoinbase();
+
+    // We don't want to be copied or moved around
+    AsyncRPCOperation_shieldcoinbase(AsyncRPCOperation_shieldcoinbase const&) = delete;             // Copy construct
+    AsyncRPCOperation_shieldcoinbase(AsyncRPCOperation_shieldcoinbase&&) = delete;                  // Move construct
+    AsyncRPCOperation_shieldcoinbase& operator=(AsyncRPCOperation_shieldcoinbase const&) = delete;  // Copy assign
+    AsyncRPCOperation_shieldcoinbase& operator=(AsyncRPCOperation_shieldcoinbase &&) = delete;      // Move assign
+
+    virtual void main();
+
+    virtual UniValue getStatus() const;
+
+    bool testmode = false;  // Set to true to disable sending txs and generating proofs
+
+    bool paymentDisclosureMode = false; // Set to true to save esk for encrypted notes in payment disclosure database.
+
+private:
+    friend class ShieldToAddress;
+    friend class TEST_FRIEND_AsyncRPCOperation_shieldcoinbase;    // class for unit testing
+
+    UniValue contextinfo_;     // optional data to include in return value from getStatus()
+
+    CAmount fee_;
+    PaymentAddress tozaddr_;
+
+    Ed25519VerificationKey joinSplitPubKey_;
+    Ed25519SigningKey joinSplitPrivKey_;
+
+    std::vector<ShieldCoinbaseUTXO> inputs_;
+
+    TransactionBuilder builder_;
+    CTransaction tx_;
+
+    bool main_impl();
+
+    // JoinSplit without any input notes to spend
+    UniValue perform_joinsplit(ShieldCoinbaseJSInfo &);
+
+    void lock_utxos();
+
+    void unlock_utxos();
+
+    // payment disclosure!
+    std::vector<PaymentDisclosureKeyInfo> paymentDisclosureData_;
+};
+
+class ShieldToAddress
+{
+private:
+    AsyncRPCOperation_shieldcoinbase *m_op;
+    CAmount sendAmount;
+
+    static void shieldToAddress(const libzcash::RecipientAddress& recipient, AsyncRPCOperation_shieldcoinbase *m_op);
+public:
+    ShieldToAddress(AsyncRPCOperation_shieldcoinbase *op, CAmount sendAmount) :
+        m_op(op), sendAmount(sendAmount) {}
+
+    bool operator()(const CKeyID &zaddr) const;
+    bool operator()(const CScriptID &zaddr) const;
+    bool operator()(const libzcash::SproutPaymentAddress &zaddr) const;
+    bool operator()(const libzcash::SaplingPaymentAddress &zaddr) const;
+    bool operator()(const libzcash::UnifiedAddress &uaddr) const;
+};
+
+
+// To test private methods, a friend class can act as a proxy
+class TEST_FRIEND_AsyncRPCOperation_shieldcoinbase {
+public:
+    std::shared_ptr<AsyncRPCOperation_shieldcoinbase> delegate;
+
+    TEST_FRIEND_AsyncRPCOperation_shieldcoinbase(std::shared_ptr<AsyncRPCOperation_shieldcoinbase> ptr) : delegate(ptr) {}
+
+    CTransaction getTx() {
+        return delegate->tx_;
+    }
+
+    void setTx(CTransaction tx) {
+        delegate->tx_ = tx;
+    }
+
+    // Delegated methods
+
+    bool main_impl() {
+        return delegate->main_impl();
+    }
+
+    UniValue perform_joinsplit(ShieldCoinbaseJSInfo &info) {
+        return delegate->perform_joinsplit(info);
+    }
+
+    void set_state(OperationStatus state) {
+        delegate->state_.store(state);
+    }
+};
+
+
+#endif // ZCASH_WALLET_ASYNCRPCOPERATION_SHIELDCOINBASE_H
+
diff --git a/depend/zcash/src/wallet/crypter.cpp b/depend/zcash/src/wallet/crypter.cpp
new file mode 100644
index 000000000..5ef7cabf3
--- /dev/null
+++ b/depend/zcash/src/wallet/crypter.cpp
@@ -0,0 +1,732 @@
+// Copyright (c) 2009-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "crypter.h"
+
+#include "crypto/aes.h"
+#include "crypto/sha512.h"
+#include "script/script.h"
+#include "script/standard.h"
+#include "streams.h"
+#include "util.h"
+
+#include <string>
+#include <vector>
+
+int CCrypter::BytesToKeySHA512AES(const std::vector<unsigned char>& chSalt, const SecureString& strKeyData, int count, unsigned char *key,unsigned char *iv) const
+{
+    // This mimics the behavior of openssl's EVP_BytesToKey with an aes256cbc
+    // cipher and sha512 message digest. Because sha512's output size (64b) is
+    // greater than the aes256 block size (16b) + aes256 key size (32b),
+    // there's no need to process more than once (D_0).
+
+    if(!count || !key || !iv)
+        return 0;
+
+    unsigned char buf[CSHA512::OUTPUT_SIZE];
+    CSHA512 di;
+
+    di.Write((const unsigned char*)strKeyData.c_str(), strKeyData.size());
+    if(chSalt.size())
+        di.Write(&chSalt[0], chSalt.size());
+    di.Finalize(buf);
+
+    for(int i = 0; i != count - 1; i++)
+        di.Reset().Write(buf, sizeof(buf)).Finalize(buf);
+
+    memcpy(key, buf, WALLET_CRYPTO_KEY_SIZE);
+    memcpy(iv, buf + WALLET_CRYPTO_KEY_SIZE, WALLET_CRYPTO_IV_SIZE);
+    memory_cleanse(buf, sizeof(buf));
+    return WALLET_CRYPTO_KEY_SIZE;
+}
+
+bool CCrypter::SetKeyFromPassphrase(const SecureString& strKeyData, const std::vector<unsigned char>& chSalt, const unsigned int nRounds, const unsigned int nDerivationMethod)
+{
+    if (nRounds < 1 || chSalt.size() != WALLET_CRYPTO_SALT_SIZE)
+        return false;
+
+    int i = 0;
+    if (nDerivationMethod == 0)
+        i = BytesToKeySHA512AES(chSalt, strKeyData, nRounds, vchKey.data(), vchIV.data());
+
+    if (i != (int)WALLET_CRYPTO_KEY_SIZE)
+    {
+        memory_cleanse(vchKey.data(), vchKey.size());
+        memory_cleanse(vchIV.data(), vchIV.size());
+        return false;
+    }
+
+    fKeySet = true;
+    return true;
+}
+
+bool CCrypter::SetKey(const CKeyingMaterial& chNewKey, const std::vector<unsigned char>& chNewIV)
+{
+    if (chNewKey.size() != WALLET_CRYPTO_KEY_SIZE || chNewIV.size() != WALLET_CRYPTO_IV_SIZE)
+        return false;
+
+    memcpy(vchKey.data(), chNewKey.data(), chNewKey.size());
+    memcpy(vchIV.data(), chNewIV.data(), chNewIV.size());
+
+    fKeySet = true;
+    return true;
+}
+
+bool CCrypter::Encrypt(const CKeyingMaterial& vchPlaintext, std::vector<unsigned char> &vchCiphertext) const
+{
+    if (!fKeySet)
+        return false;
+
+    // max ciphertext len for a n bytes of plaintext is
+    // n + AES_BLOCKSIZE bytes
+    vchCiphertext.resize(vchPlaintext.size() + AES_BLOCKSIZE);
+
+    AES256CBCEncrypt enc(vchKey.data(), vchIV.data(), true);
+    size_t nLen = enc.Encrypt(&vchPlaintext[0], vchPlaintext.size(), &vchCiphertext[0]);
+    if(nLen < vchPlaintext.size())
+        return false;
+    vchCiphertext.resize(nLen);
+
+    return true;
+}
+
+bool CCrypter::Decrypt(const std::vector<unsigned char>& vchCiphertext, CKeyingMaterial& vchPlaintext) const
+{
+    if (!fKeySet)
+        return false;
+
+    // plaintext will always be equal to or lesser than length of ciphertext
+    int nLen = vchCiphertext.size();
+
+    vchPlaintext.resize(nLen);
+
+    AES256CBCDecrypt dec(vchKey.data(), vchIV.data(), true);
+    nLen = dec.Decrypt(&vchCiphertext[0], vchCiphertext.size(), &vchPlaintext[0]);
+    if(nLen == 0)
+        return false;
+    vchPlaintext.resize(nLen);
+    return true;
+}
+
+
+static bool EncryptSecret(const CKeyingMaterial& vMasterKey, const CKeyingMaterial &vchPlaintext, const uint256& nIV, std::vector<unsigned char> &vchCiphertext)
+{
+    CCrypter cKeyCrypter;
+    std::vector<unsigned char> chIV(WALLET_CRYPTO_IV_SIZE);
+    memcpy(&chIV[0], &nIV, WALLET_CRYPTO_IV_SIZE);
+    if (!cKeyCrypter.SetKey(vMasterKey, chIV))
+        return false;
+    return cKeyCrypter.Encrypt(*((const CKeyingMaterial*)&vchPlaintext), vchCiphertext);
+}
+
+static bool DecryptSecret(const CKeyingMaterial& vMasterKey, const std::vector<unsigned char>& vchCiphertext, const uint256& nIV, CKeyingMaterial& vchPlaintext)
+{
+    CCrypter cKeyCrypter;
+    std::vector<unsigned char> chIV(WALLET_CRYPTO_IV_SIZE);
+    memcpy(&chIV[0], &nIV, WALLET_CRYPTO_IV_SIZE);
+    if (!cKeyCrypter.SetKey(vMasterKey, chIV))
+        return false;
+    return cKeyCrypter.Decrypt(vchCiphertext, *((CKeyingMaterial*)&vchPlaintext));
+}
+
+static CKeyingMaterial EncryptMnemonicSeed(const MnemonicSeed& seed)
+{
+    CSecureDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << seed;
+    CKeyingMaterial vchSecret(ss.begin(), ss.end());
+
+    return vchSecret;
+}
+
+static std::optional<MnemonicSeed> DecryptMnemonicSeed(
+    const CKeyingMaterial& vMasterKey,
+    const std::vector<unsigned char>& vchCryptedSecret,
+    const uint256& seedFp)
+{
+    CKeyingMaterial vchSecret;
+
+    // Use seed's fingerprint as IV
+    // TODO: Handle IV properly when we make encryption a supported feature
+    if (DecryptSecret(vMasterKey, vchCryptedSecret, seedFp, vchSecret)) {
+        CSecureDataStream ss(vchSecret, SER_NETWORK, PROTOCOL_VERSION);
+        auto seed = MnemonicSeed::Read(ss);
+        if (seed.Fingerprint() == seedFp) {
+            return seed;
+        }
+    }
+    return std::nullopt;
+}
+
+static std::optional<HDSeed> DecryptLegacyHDSeed(
+    const CKeyingMaterial& vMasterKey,
+    const std::vector<unsigned char>& vchCryptedSecret,
+    const uint256& seedFp)
+{
+    CKeyingMaterial vchSecret;
+
+    // Use seed's fingerprint as IV
+    // TODO: Handle IV properly when we make encryption a supported feature
+    if (DecryptSecret(vMasterKey, vchCryptedSecret, seedFp, vchSecret)) {
+        auto seed = HDSeed(vchSecret);
+        if (seed.Fingerprint() == seedFp) {
+            return seed;
+        }
+    }
+    return std::nullopt;
+}
+
+static bool DecryptKey(const CKeyingMaterial& vMasterKey, const std::vector<unsigned char>& vchCryptedSecret, const CPubKey& vchPubKey, CKey& key)
+{
+    CKeyingMaterial vchSecret;
+    if (!DecryptSecret(vMasterKey, vchCryptedSecret, vchPubKey.GetHash(), vchSecret))
+        return false;
+
+    if (vchSecret.size() != 32)
+        return false;
+
+    key.Set(vchSecret.begin(), vchSecret.end(), vchPubKey.IsCompressed());
+    return key.VerifyPubKey(vchPubKey);
+}
+
+static bool DecryptSproutSpendingKey(const CKeyingMaterial& vMasterKey,
+                               const std::vector<unsigned char>& vchCryptedSecret,
+                               const libzcash::SproutPaymentAddress& address,
+                               libzcash::SproutSpendingKey& sk)
+{
+    CKeyingMaterial vchSecret;
+    if (!DecryptSecret(vMasterKey, vchCryptedSecret, address.GetHash(), vchSecret))
+        return false;
+
+    if (vchSecret.size() != libzcash::SerializedSproutSpendingKeySize)
+        return false;
+
+    CSecureDataStream ss(vchSecret, SER_NETWORK, PROTOCOL_VERSION);
+    ss >> sk;
+    return sk.address() == address;
+}
+
+static bool DecryptSaplingSpendingKey(const CKeyingMaterial& vMasterKey,
+                               const std::vector<unsigned char>& vchCryptedSecret,
+                               const libzcash::SaplingExtendedFullViewingKey& extfvk,
+                               libzcash::SaplingExtendedSpendingKey& sk)
+{
+    CKeyingMaterial vchSecret;
+    if (!DecryptSecret(vMasterKey, vchCryptedSecret, extfvk.fvk.GetFingerprint(), vchSecret))
+        return false;
+
+    if (vchSecret.size() != ZIP32_XSK_SIZE)
+        return false;
+
+    CSecureDataStream ss(vchSecret, SER_NETWORK, PROTOCOL_VERSION);
+    ss >> sk;
+    return sk.expsk.full_viewing_key() == extfvk.fvk;
+}
+
+// cs_KeyStore lock must be held by caller
+bool CCryptoKeyStore::SetCrypted()
+{
+    if (fUseCrypto)
+        return true;
+    if (!(mapKeys.empty() && mapSproutSpendingKeys.empty() && mapSaplingSpendingKeys.empty()))
+        return false;
+    fUseCrypto = true;
+    return true;
+}
+
+bool CCryptoKeyStore::Lock()
+{
+    {
+        LOCK(cs_KeyStore);
+        if (!SetCrypted())
+            return false;
+        vMasterKey.clear();
+    }
+
+    NotifyStatusChanged(this);
+    return true;
+}
+
+bool CCryptoKeyStore::Unlock(const CKeyingMaterial& vMasterKeyIn)
+{
+    {
+        LOCK(cs_KeyStore);
+        if (!SetCrypted())
+            return false;
+
+        bool keyPass = false;
+        bool keyFail = false;
+        if (!cryptedMnemonicSeed.first.IsNull()) {
+            // Check that we can successfully decrypt the mnemonic seed, if present
+            auto seed = DecryptMnemonicSeed(vMasterKeyIn, cryptedMnemonicSeed.second, cryptedMnemonicSeed.first);
+            if (!seed.has_value()) {
+                keyFail = true;
+            } else {
+                keyPass = true;
+            }
+        }
+        if (cryptedLegacySeed.has_value()) {
+            // Check that we can successfully decrypt the legacy seed, if present
+            auto seed = DecryptLegacyHDSeed(vMasterKeyIn,
+                                            cryptedLegacySeed.value().second,
+                                            cryptedLegacySeed.value().first);
+            if (!seed.has_value()) {
+                keyFail = true;
+            } else {
+                keyPass = true;
+            }
+        }
+        CryptedKeyMap::const_iterator mi = mapCryptedKeys.begin();
+        for (; mi != mapCryptedKeys.end(); ++mi)
+        {
+            const CPubKey &vchPubKey = (*mi).second.first;
+            const std::vector<unsigned char> &vchCryptedSecret = (*mi).second.second;
+            CKey key;
+            if (!DecryptKey(vMasterKeyIn, vchCryptedSecret, vchPubKey, key))
+            {
+                keyFail = true;
+                break;
+            }
+            keyPass = true;
+            if (fDecryptionThoroughlyChecked)
+                break;
+        }
+        CryptedSproutSpendingKeyMap::const_iterator miSprout = mapCryptedSproutSpendingKeys.begin();
+        for (; miSprout != mapCryptedSproutSpendingKeys.end(); ++miSprout)
+        {
+            const libzcash::SproutPaymentAddress &address = (*miSprout).first;
+            const std::vector<unsigned char> &vchCryptedSecret = (*miSprout).second;
+            libzcash::SproutSpendingKey sk;
+            if (!DecryptSproutSpendingKey(vMasterKeyIn, vchCryptedSecret, address, sk))
+            {
+                keyFail = true;
+                break;
+            }
+            keyPass = true;
+            if (fDecryptionThoroughlyChecked)
+                break;
+        }
+        CryptedSaplingSpendingKeyMap::const_iterator miSapling = mapCryptedSaplingSpendingKeys.begin();
+        for (; miSapling != mapCryptedSaplingSpendingKeys.end(); ++miSapling)
+        {
+            const libzcash::SaplingExtendedFullViewingKey &extfvk = (*miSapling).first;
+            const std::vector<unsigned char> &vchCryptedSecret = (*miSapling).second;
+            libzcash::SaplingExtendedSpendingKey sk;
+            if (!DecryptSaplingSpendingKey(vMasterKeyIn, vchCryptedSecret, extfvk, sk))
+            {
+                keyFail = true;
+                break;
+            }
+            keyPass = true;
+            if (fDecryptionThoroughlyChecked)
+                break;
+        }
+        if (keyPass && keyFail)
+        {
+            LogPrintf("The wallet is probably corrupted: Some keys decrypt but not all.\n");
+            assert(false);
+        }
+        if (keyFail || !keyPass)
+            return false;
+        vMasterKey = vMasterKeyIn;
+        fDecryptionThoroughlyChecked = true;
+    }
+    NotifyStatusChanged(this);
+    return true;
+}
+
+//
+// Mnemonic HD seeds
+//
+
+bool CCryptoKeyStore::SetMnemonicSeed(const MnemonicSeed& seed)
+{
+    {
+        LOCK(cs_KeyStore);
+        if (!fUseCrypto) {
+            return CBasicKeyStore::SetMnemonicSeed(seed);
+        }
+
+        if (IsLocked())
+            return false;
+
+        // Use seed's fingerprint as IV
+        // TODO: Handle this properly when we make encryption a supported feature
+        auto seedFp = seed.Fingerprint();
+        CKeyingMaterial vchSecret = EncryptMnemonicSeed(seed);
+
+        std::vector<unsigned char> vchCryptedSecret;
+        if (!EncryptSecret(vMasterKey, vchSecret, seedFp, vchCryptedSecret))
+            return false;
+
+        // This will call into CWallet to store the crypted seed to disk
+        if (!SetCryptedMnemonicSeed(seedFp, vchCryptedSecret))
+            return false;
+    }
+    return true;
+}
+
+bool CCryptoKeyStore::SetCryptedMnemonicSeed(
+    const uint256& seedFp,
+    const std::vector<unsigned char>& vchCryptedSecret)
+{
+    LOCK(cs_KeyStore);
+    if (!fUseCrypto || !cryptedMnemonicSeed.first.IsNull()) {
+        // Either wallet encryption is disabled, or the wallet already has an
+        // existing mnemonic. In either case, don't allow a new mnemonic.
+        return false;
+    } else {
+        cryptedMnemonicSeed = std::make_pair(seedFp, vchCryptedSecret);
+        return true;
+    }
+}
+
+bool CCryptoKeyStore::HaveMnemonicSeed() const
+{
+    LOCK(cs_KeyStore);
+    if (fUseCrypto) {
+        return !cryptedMnemonicSeed.second.empty();
+    } else {
+        return CBasicKeyStore::HaveMnemonicSeed();
+    }
+}
+
+std::optional<MnemonicSeed> CCryptoKeyStore::GetMnemonicSeed() const
+{
+    LOCK(cs_KeyStore);
+    if (fUseCrypto) {
+        if (cryptedMnemonicSeed.second.empty()) {
+            return std::nullopt;
+        } else {
+            return DecryptMnemonicSeed(vMasterKey, cryptedMnemonicSeed.second, cryptedMnemonicSeed.first);
+        }
+    } else {
+        return CBasicKeyStore::GetMnemonicSeed();
+    }
+}
+
+//
+// Legacy HD seeds
+//
+
+bool CCryptoKeyStore::SetLegacyHDSeed(const HDSeed& seed)
+{
+    {
+        LOCK(cs_KeyStore);
+        if (!fUseCrypto) {
+            return CBasicKeyStore::SetLegacyHDSeed(seed);
+        }
+
+        if (IsLocked())
+            return false;
+
+        // Use seed's fingerprint as IV
+        // TODO: Handle this properly when we make encryption a supported feature
+        auto seedFp = seed.Fingerprint();
+        std::vector<unsigned char> vchCryptedSecret;
+        if (!EncryptSecret(vMasterKey, seed.RawSeed(), seedFp, vchCryptedSecret))
+            return false;
+
+        // This will call into CWallet to store the crypted seed to disk
+        if (!SetCryptedLegacyHDSeed(seedFp, vchCryptedSecret))
+            return false;
+    }
+    return true;
+}
+
+bool CCryptoKeyStore::SetCryptedLegacyHDSeed(
+    const uint256& seedFp,
+    const std::vector<unsigned char>& vchCryptedSecret)
+{
+    LOCK(cs_KeyStore);
+    if (!fUseCrypto || cryptedLegacySeed.has_value()) {
+        // Either wallet encryption is disabled, or the wallet already has an
+        // existing legacy seed. In either case, don't allow a new seed.
+        return false;
+    } else {
+        cryptedLegacySeed = std::make_pair(seedFp, vchCryptedSecret);
+        return true;
+    }
+}
+
+std::optional<HDSeed> CCryptoKeyStore::GetLegacyHDSeed() const {
+    LOCK(cs_KeyStore);
+    if (fUseCrypto) {
+        if (cryptedLegacySeed.has_value()) {
+            const auto cryptedPair = cryptedLegacySeed.value();
+            return DecryptLegacyHDSeed(vMasterKey, cryptedPair.second, cryptedPair.first);
+        } else {
+            return std::nullopt;
+        }
+    } else {
+        return CBasicKeyStore::GetLegacyHDSeed();
+    }
+}
+
+//
+// Transparent public keys
+//
+
+bool CCryptoKeyStore::AddKeyPubKey(const CKey& key, const CPubKey &pubkey)
+{
+    LOCK(cs_KeyStore);
+    if (!fUseCrypto)
+        return CBasicKeyStore::AddKeyPubKey(key, pubkey);
+
+    if (IsLocked())
+        return false;
+
+    std::vector<unsigned char> vchCryptedSecret;
+    CKeyingMaterial vchSecret(key.begin(), key.end());
+    if (!EncryptSecret(vMasterKey, vchSecret, pubkey.GetHash(), vchCryptedSecret))
+        return false;
+
+    return AddCryptedKey(pubkey, vchCryptedSecret);
+}
+
+
+bool CCryptoKeyStore::AddCryptedKey(const CPubKey &vchPubKey, const std::vector<unsigned char> &vchCryptedSecret)
+{
+    LOCK(cs_KeyStore);
+    if (!SetCrypted())
+        return false;
+
+    mapCryptedKeys[vchPubKey.GetID()] = make_pair(vchPubKey, vchCryptedSecret);
+    return true;
+}
+
+bool CCryptoKeyStore::GetKey(const CKeyID &address, CKey& keyOut) const
+{
+    LOCK(cs_KeyStore);
+    if (!fUseCrypto)
+        return CBasicKeyStore::GetKey(address, keyOut);
+
+    CryptedKeyMap::const_iterator mi = mapCryptedKeys.find(address);
+    if (mi != mapCryptedKeys.end())
+    {
+        const CPubKey &vchPubKey = (*mi).second.first;
+        const std::vector<unsigned char> &vchCryptedSecret = (*mi).second.second;
+        return DecryptKey(vMasterKey, vchCryptedSecret, vchPubKey, keyOut);
+    }
+    return false;
+}
+
+bool CCryptoKeyStore::GetPubKey(const CKeyID &address, CPubKey& vchPubKeyOut) const
+{
+    LOCK(cs_KeyStore);
+    if (!fUseCrypto)
+        return CBasicKeyStore::GetPubKey(address, vchPubKeyOut);
+
+    CryptedKeyMap::const_iterator mi = mapCryptedKeys.find(address);
+    if (mi != mapCryptedKeys.end())
+    {
+        vchPubKeyOut = (*mi).second.first;
+        return true;
+    }
+    // Check for watch-only pubkeys
+    return CBasicKeyStore::GetPubKey(address, vchPubKeyOut);
+}
+
+//
+// Sprout & Sapling keys
+//
+
+bool CCryptoKeyStore::AddSproutSpendingKey(const libzcash::SproutSpendingKey &sk)
+{
+    LOCK(cs_KeyStore);
+    if (!fUseCrypto)
+        return CBasicKeyStore::AddSproutSpendingKey(sk);
+
+    if (IsLocked())
+        return false;
+
+    std::vector<unsigned char> vchCryptedSecret;
+    CSecureDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << sk;
+    CKeyingMaterial vchSecret(ss.begin(), ss.end());
+    auto address = sk.address();
+    if (!EncryptSecret(vMasterKey, vchSecret, address.GetHash(), vchCryptedSecret))
+        return false;
+
+    return AddCryptedSproutSpendingKey(address, sk.receiving_key(), vchCryptedSecret);
+}
+
+bool CCryptoKeyStore::AddSaplingSpendingKey(
+    const libzcash::SaplingExtendedSpendingKey &sk)
+{
+    LOCK(cs_KeyStore);
+    if (!fUseCrypto) {
+        return CBasicKeyStore::AddSaplingSpendingKey(sk);
+    }
+
+    if (IsLocked()) {
+        return false;
+    }
+
+    std::vector<unsigned char> vchCryptedSecret;
+    CSecureDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << sk;
+    CKeyingMaterial vchSecret(ss.begin(), ss.end());
+    auto extfvk = sk.ToXFVK();
+    if (!EncryptSecret(vMasterKey, vchSecret, extfvk.fvk.GetFingerprint(), vchCryptedSecret)) {
+        return false;
+    }
+
+    return AddCryptedSaplingSpendingKey(extfvk, vchCryptedSecret);
+}
+
+bool CCryptoKeyStore::AddCryptedSproutSpendingKey(
+    const libzcash::SproutPaymentAddress &address,
+    const libzcash::ReceivingKey &rk,
+    const std::vector<unsigned char> &vchCryptedSecret)
+{
+    LOCK(cs_KeyStore);
+    if (!SetCrypted())
+        return false;
+
+    mapCryptedSproutSpendingKeys[address] = vchCryptedSecret;
+    mapNoteDecryptors.insert(std::make_pair(address, ZCNoteDecryption(rk)));
+    return true;
+}
+
+bool CCryptoKeyStore::AddCryptedSaplingSpendingKey(
+    const libzcash::SaplingExtendedFullViewingKey &extfvk,
+    const std::vector<unsigned char> &vchCryptedSecret)
+{
+    LOCK(cs_KeyStore);
+    if (!SetCrypted()) {
+        return false;
+    }
+
+    // if extfvk is not in SaplingFullViewingKeyMap, add it
+    if (!CBasicKeyStore::AddSaplingFullViewingKey(extfvk)) {
+        return false;
+    }
+
+    mapCryptedSaplingSpendingKeys[extfvk] = vchCryptedSecret;
+    return true;
+}
+
+bool CCryptoKeyStore::GetSproutSpendingKey(const libzcash::SproutPaymentAddress &address, libzcash::SproutSpendingKey &skOut) const
+{
+    LOCK(cs_KeyStore);
+    if (!fUseCrypto)
+        return CBasicKeyStore::GetSproutSpendingKey(address, skOut);
+
+    CryptedSproutSpendingKeyMap::const_iterator mi = mapCryptedSproutSpendingKeys.find(address);
+    if (mi != mapCryptedSproutSpendingKeys.end())
+    {
+        const std::vector<unsigned char> &vchCryptedSecret = (*mi).second;
+        return DecryptSproutSpendingKey(vMasterKey, vchCryptedSecret, address, skOut);
+    }
+    return false;
+}
+
+bool CCryptoKeyStore::GetSaplingSpendingKey(
+    const libzcash::SaplingExtendedFullViewingKey &extfvk,
+    libzcash::SaplingExtendedSpendingKey &skOut) const
+{
+    LOCK(cs_KeyStore);
+    if (!fUseCrypto)
+        return CBasicKeyStore::GetSaplingSpendingKey(extfvk, skOut);
+
+    for (auto entry : mapCryptedSaplingSpendingKeys) {
+        if (entry.first == extfvk) {
+            const std::vector<unsigned char> &vchCryptedSecret = entry.second;
+            return DecryptSaplingSpendingKey(vMasterKey, vchCryptedSecret, entry.first, skOut);
+        }
+    }
+    return false;
+}
+
+bool CCryptoKeyStore::EncryptKeys(CKeyingMaterial& vMasterKeyIn)
+{
+    {
+        LOCK(cs_KeyStore);
+        if (!mapCryptedKeys.empty() || fUseCrypto)
+            return false;
+
+        fUseCrypto = true;
+        if (mnemonicSeed.has_value()) {
+            {
+                std::vector<unsigned char> vchCryptedSecret;
+                // Use seed's fingerprint as IV
+                // TODO: Handle this properly when we make encryption a supported feature
+                auto seedFp = mnemonicSeed.value().Fingerprint();
+                auto seedData = EncryptMnemonicSeed(mnemonicSeed.value());
+                if (!EncryptSecret(vMasterKeyIn, seedData, seedFp, vchCryptedSecret)) {
+                    return false;
+                }
+                // This will call into CWallet to store the crypted seed to disk
+                if (!SetCryptedMnemonicSeed(seedFp, vchCryptedSecret)) {
+                    return false;
+                }
+            }
+            mnemonicSeed = std::nullopt;
+        }
+        if (legacySeed.has_value()) {
+            {
+                std::vector<unsigned char> vchCryptedSecret;
+                // Use seed's fingerprint as IV
+                // TODO: Handle this properly when we make encryption a supported feature
+                auto seedFp = legacySeed.value().Fingerprint();
+                if (!EncryptSecret(vMasterKeyIn, legacySeed.value().RawSeed(), seedFp, vchCryptedSecret)) {
+                    return false;
+                }
+                // This will call into CWallet to store the crypted seed to disk
+                if (!SetCryptedLegacyHDSeed(seedFp, vchCryptedSecret)) {
+                    return false;
+                }
+            }
+            legacySeed = std::nullopt;
+        }
+        for (KeyMap::value_type& mKey : mapKeys)
+        {
+            const CKey &key = mKey.second;
+            CPubKey vchPubKey = key.GetPubKey();
+            CKeyingMaterial vchSecret(key.begin(), key.end());
+            std::vector<unsigned char> vchCryptedSecret;
+            if (!EncryptSecret(vMasterKeyIn, vchSecret, vchPubKey.GetHash(), vchCryptedSecret)) {
+                return false;
+            }
+            if (!AddCryptedKey(vchPubKey, vchCryptedSecret)) {
+                return false;
+            }
+        }
+        mapKeys.clear();
+        for (SproutSpendingKeyMap::value_type& mSproutSpendingKey : mapSproutSpendingKeys)
+        {
+            const libzcash::SproutSpendingKey &sk = mSproutSpendingKey.second;
+            CSecureDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+            ss << sk;
+            CKeyingMaterial vchSecret(ss.begin(), ss.end());
+            libzcash::SproutPaymentAddress address = sk.address();
+            std::vector<unsigned char> vchCryptedSecret;
+            if (!EncryptSecret(vMasterKeyIn, vchSecret, address.GetHash(), vchCryptedSecret)) {
+                return false;
+            }
+            if (!AddCryptedSproutSpendingKey(address, sk.receiving_key(), vchCryptedSecret)) {
+                return false;
+            }
+        }
+        mapSproutSpendingKeys.clear();
+        //! Sapling key support
+        for (SaplingSpendingKeyMap::value_type& mSaplingSpendingKey : mapSaplingSpendingKeys)
+        {
+            const auto &sk = mSaplingSpendingKey.second;
+            CSecureDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+            ss << sk;
+            CKeyingMaterial vchSecret(ss.begin(), ss.end());
+            auto extfvk = sk.ToXFVK();
+            std::vector<unsigned char> vchCryptedSecret;
+            if (!EncryptSecret(vMasterKeyIn, vchSecret, extfvk.fvk.GetFingerprint(), vchCryptedSecret)) {
+                return false;
+            }
+            if (!AddCryptedSaplingSpendingKey(extfvk, vchCryptedSecret)) {
+                return false;
+            }
+        }
+        mapSaplingSpendingKeys.clear();
+    }
+    return true;
+}
diff --git a/depend/zcash/src/wallet/crypter.h b/depend/zcash/src/wallet/crypter.h
new file mode 100644
index 000000000..434e97cbe
--- /dev/null
+++ b/depend/zcash/src/wallet/crypter.h
@@ -0,0 +1,267 @@
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_WALLET_CRYPTER_H
+#define BITCOIN_WALLET_CRYPTER_H
+
+#include "keystore.h"
+#include "serialize.h"
+#include "streams.h"
+#include "support/allocators/secure.h"
+#include "zcash/Address.hpp"
+
+class uint256;
+
+#include <atomic>
+
+const unsigned int WALLET_CRYPTO_KEY_SIZE = 32;
+const unsigned int WALLET_CRYPTO_SALT_SIZE = 8;
+const unsigned int WALLET_CRYPTO_IV_SIZE = 16;
+
+/**
+ * Private key encryption is done based on a CMasterKey,
+ * which holds a salt and random encryption key.
+ *
+ * CMasterKeys are encrypted using AES-256-CBC using a key
+ * derived using derivation method nDerivationMethod
+ * (0 == EVP_sha512()) and derivation iterations nDeriveIterations.
+ * vchOtherDerivationParameters is provided for alternative algorithms
+ * which may require more parameters (such as scrypt).
+ *
+ * Wallet Private Keys are then encrypted using AES-256-CBC
+ * with the double-sha256 of the public key as the IV, and the
+ * master key's key as the encryption key (see keystore.[ch]).
+ */
+
+/** Master key for wallet encryption */
+class CMasterKey
+{
+public:
+    std::vector<unsigned char> vchCryptedKey;
+    std::vector<unsigned char> vchSalt;
+    //! 0 = EVP_sha512()
+    //! 1 = scrypt()
+    unsigned int nDerivationMethod;
+    unsigned int nDeriveIterations;
+    //! Use this for more parameters to key derivation,
+    //! such as the various parameters to scrypt
+    std::vector<unsigned char> vchOtherDerivationParameters;
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(vchCryptedKey);
+        READWRITE(vchSalt);
+        READWRITE(nDerivationMethod);
+        READWRITE(nDeriveIterations);
+        READWRITE(vchOtherDerivationParameters);
+    }
+
+    CMasterKey()
+    {
+        // 25000 rounds is just under 0.1 seconds on a 1.86 GHz Pentium M
+        // ie slightly lower than the lowest hardware we need bother supporting
+        nDeriveIterations = 25000;
+        nDerivationMethod = 0;
+        vchOtherDerivationParameters = std::vector<unsigned char>(0);
+    }
+};
+
+typedef std::vector<unsigned char, secure_allocator<unsigned char> > CKeyingMaterial;
+
+class CSecureDataStream : public CBaseDataStream<CKeyingMaterial>
+{
+public:
+    explicit CSecureDataStream(int nTypeIn, int nVersionIn) : CBaseDataStream(nTypeIn, nVersionIn) { }
+
+    CSecureDataStream(const_iterator pbegin, const_iterator pend, int nTypeIn, int nVersionIn) :
+            CBaseDataStream(pbegin, pend, nTypeIn, nVersionIn) { }
+
+    CSecureDataStream(const vector_type& vchIn, int nTypeIn, int nVersionIn) :
+            CBaseDataStream(vchIn, nTypeIn, nVersionIn) { }
+};
+
+namespace wallet_crypto
+{
+    class TestCrypter;
+}
+
+/** Encryption/decryption context with key information */
+class CCrypter
+{
+friend class wallet_crypto::TestCrypter; // for test access to chKey/chIV
+private:
+    std::vector<unsigned char, secure_allocator<unsigned char>> vchKey;
+    std::vector<unsigned char, secure_allocator<unsigned char>> vchIV;
+    bool fKeySet;
+
+    int BytesToKeySHA512AES(const std::vector<unsigned char>& chSalt, const SecureString& strKeyData, int count, unsigned char *key,unsigned char *iv) const;
+
+public:
+    bool SetKeyFromPassphrase(const SecureString &strKeyData, const std::vector<unsigned char>& chSalt, const unsigned int nRounds, const unsigned int nDerivationMethod);
+    bool Encrypt(const CKeyingMaterial& vchPlaintext, std::vector<unsigned char> &vchCiphertext) const;
+    bool Decrypt(const std::vector<unsigned char>& vchCiphertext, CKeyingMaterial& vchPlaintext) const;
+    bool SetKey(const CKeyingMaterial& chNewKey, const std::vector<unsigned char>& chNewIV);
+
+    void CleanKey()
+    {
+        memory_cleanse(vchKey.data(), vchKey.size());
+        memory_cleanse(vchIV.data(), vchIV.size());
+        fKeySet = false;
+    }
+
+    CCrypter()
+    {
+        fKeySet = false;
+        vchKey.resize(WALLET_CRYPTO_KEY_SIZE);
+        vchIV.resize(WALLET_CRYPTO_IV_SIZE);
+    }
+
+    ~CCrypter()
+    {
+        CleanKey();
+    }
+};
+
+/** Keystore which keeps the private keys encrypted.
+ * It derives from the basic key store, which is used if no encryption is active.
+ */
+class CCryptoKeyStore : public CBasicKeyStore
+{
+private:
+    std::pair<uint256, std::vector<unsigned char>> cryptedMnemonicSeed;
+    std::optional<std::pair<uint256, std::vector<unsigned char>>> cryptedLegacySeed;
+    CryptedKeyMap mapCryptedKeys;
+    CryptedSproutSpendingKeyMap mapCryptedSproutSpendingKeys;
+    CryptedSaplingSpendingKeyMap mapCryptedSaplingSpendingKeys;
+
+    CKeyingMaterial vMasterKey;
+
+    //! if fUseCrypto is true, mapKeys, mapSproutSpendingKeys, and mapSaplingSpendingKeys must be empty
+    //! if fUseCrypto is false, vMasterKey must be empty
+    std::atomic<bool> fUseCrypto;
+
+    //! keeps track of whether Unlock has run a thorough check before
+    bool fDecryptionThoroughlyChecked;
+
+protected:
+    bool SetCrypted();
+
+    //! will encrypt previously unencrypted keys
+    bool EncryptKeys(CKeyingMaterial& vMasterKeyIn);
+
+    bool Unlock(const CKeyingMaterial& vMasterKeyIn);
+
+public:
+    CCryptoKeyStore() : fUseCrypto(false), fDecryptionThoroughlyChecked(false)
+    {
+    }
+
+    bool IsCrypted() const
+    {
+        LOCK(cs_KeyStore);
+        return fUseCrypto;
+    }
+
+    bool IsLocked() const
+    {
+        LOCK(cs_KeyStore);
+        return fUseCrypto && vMasterKey.empty();
+    }
+
+    bool Lock();
+
+    bool SetMnemonicSeed(const MnemonicSeed& seed);
+    virtual bool SetCryptedMnemonicSeed(const uint256& seedFp, const std::vector<unsigned char> &vchCryptedSecret);
+    bool HaveMnemonicSeed() const;
+    std::optional<MnemonicSeed> GetMnemonicSeed() const;
+
+    bool SetLegacyHDSeed(const HDSeed& seed);
+    virtual bool SetCryptedLegacyHDSeed(const uint256& seedFp, const std::vector<unsigned char> &vchCryptedSecret);
+    std::optional<HDSeed> GetLegacyHDSeed() const;
+
+    virtual bool AddCryptedKey(const CPubKey &vchPubKey, const std::vector<unsigned char> &vchCryptedSecret);
+    bool AddKeyPubKey(const CKey& key, const CPubKey &pubkey);
+    bool HaveKey(const CKeyID &address) const
+    {
+        LOCK(cs_KeyStore);
+        if (!fUseCrypto)
+            return CBasicKeyStore::HaveKey(address);
+        return mapCryptedKeys.count(address) > 0;
+    }
+    bool GetKey(const CKeyID &address, CKey& keyOut) const;
+    bool GetPubKey(const CKeyID &address, CPubKey& vchPubKeyOut) const;
+    std::set<CKeyID> GetKeys() const
+    {
+        LOCK(cs_KeyStore);
+        if (!fUseCrypto)
+        {
+            return CBasicKeyStore::GetKeys();
+        }
+        std::set<CKeyID> set_address;
+        for (const auto& mi : mapCryptedKeys) {
+            set_address.insert(mi.first);
+        }
+        return set_address;
+    }
+    virtual bool AddCryptedSproutSpendingKey(
+        const libzcash::SproutPaymentAddress &address,
+        const libzcash::ReceivingKey &rk,
+        const std::vector<unsigned char> &vchCryptedSecret);
+    bool AddSproutSpendingKey(const libzcash::SproutSpendingKey &sk);
+    bool HaveSproutSpendingKey(const libzcash::SproutPaymentAddress &address) const
+    {
+        LOCK(cs_KeyStore);
+        if (!fUseCrypto)
+            return CBasicKeyStore::HaveSproutSpendingKey(address);
+        return mapCryptedSproutSpendingKeys.count(address) > 0;
+    }
+    bool GetSproutSpendingKey(const libzcash::SproutPaymentAddress &address, libzcash::SproutSpendingKey &skOut) const;
+    void GetSproutPaymentAddresses(std::set<libzcash::SproutPaymentAddress> &setAddress) const
+    {
+        LOCK(cs_KeyStore);
+        if (!fUseCrypto)
+        {
+            CBasicKeyStore::GetSproutPaymentAddresses(setAddress);
+            return;
+        }
+        setAddress.clear();
+        CryptedSproutSpendingKeyMap::const_iterator mi = mapCryptedSproutSpendingKeys.begin();
+        while (mi != mapCryptedSproutSpendingKeys.end())
+        {
+            setAddress.insert((*mi).first);
+            mi++;
+        }
+    }
+    //! Sapling
+    virtual bool AddCryptedSaplingSpendingKey(
+        const libzcash::SaplingExtendedFullViewingKey &extfvk,
+        const std::vector<unsigned char> &vchCryptedSecret);
+    bool AddSaplingSpendingKey(const libzcash::SaplingExtendedSpendingKey &sk);
+    bool HaveSaplingSpendingKey(const libzcash::SaplingExtendedFullViewingKey &extfvk) const
+    {
+        LOCK(cs_KeyStore);
+        if (!fUseCrypto)
+            return CBasicKeyStore::HaveSaplingSpendingKey(extfvk);
+        for (auto entry : mapCryptedSaplingSpendingKeys) {
+            if (entry.first == extfvk) {
+                return true;
+            }
+        }
+        return false;
+    }
+    bool GetSaplingSpendingKey(
+        const libzcash::SaplingExtendedFullViewingKey &extfvk,
+        libzcash::SaplingExtendedSpendingKey &skOut) const;
+
+
+    /**
+     * Wallet status (encrypted, locked) changed.
+     * Note: Called without locks held.
+     */
+    boost::signals2::signal<void (CCryptoKeyStore* wallet)> NotifyStatusChanged;
+};
+
+#endif // BITCOIN_WALLET_CRYPTER_H
diff --git a/depend/zcash/src/wallet/db.cpp b/depend/zcash/src/wallet/db.cpp
new file mode 100644
index 000000000..a374e751c
--- /dev/null
+++ b/depend/zcash/src/wallet/db.cpp
@@ -0,0 +1,459 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "db.h"
+
+#include "addrman.h"
+#include "fs.h"
+#include "hash.h"
+#include "protocol.h"
+#include "util.h"
+#include "utilstrencodings.h"
+
+#include <stdint.h>
+
+#ifndef WIN32
+#include <sys/stat.h>
+#endif
+
+#include <boost/thread.hpp>
+#include <boost/version.hpp>
+
+using namespace std;
+
+
+//
+// CDB
+//
+
+CDBEnv bitdb;
+
+void CDBEnv::EnvShutdown()
+{
+    if (!fDbEnvInit)
+        return;
+
+    fDbEnvInit = false;
+    int ret = dbenv->close(0);
+    if (ret != 0)
+        LogPrintf("CDBEnv::EnvShutdown: Error %d shutting down database environment: %s\n", ret, DbEnv::strerror(ret));
+    if (!fMockDb)
+        DbEnv(u_int32_t{0}).remove(strPath.c_str(), 0);
+}
+
+void CDBEnv::Reset()
+{
+    delete dbenv;
+    dbenv = new DbEnv(DB_CXX_NO_EXCEPTIONS);
+    fDbEnvInit = false;
+    fMockDb = false;
+}
+
+CDBEnv::CDBEnv() : dbenv(NULL)
+{
+    Reset();
+}
+
+CDBEnv::~CDBEnv()
+{
+    EnvShutdown();
+    delete dbenv;
+    dbenv = NULL;
+}
+
+void CDBEnv::Close()
+{
+    EnvShutdown();
+}
+
+bool CDBEnv::Open(const fs::path& pathIn)
+{
+    if (fDbEnvInit)
+        return true;
+
+    boost::this_thread::interruption_point();
+
+    strPath = pathIn.string();
+    fs::path pathLogDir = pathIn / "database";
+    TryCreateDirectory(pathLogDir);
+    fs::path pathErrorFile = pathIn / "db.log";
+    LogPrintf("CDBEnv::Open: LogDir=%s ErrorFile=%s\n", pathLogDir.string(), pathErrorFile.string());
+
+    unsigned int nEnvFlags = 0;
+    if (GetBoolArg("-privdb", DEFAULT_WALLET_PRIVDB))
+        nEnvFlags |= DB_PRIVATE;
+
+    dbenv->set_lg_dir(pathLogDir.string().c_str());
+    dbenv->set_cachesize(0, 0x100000, 1); // 1 MiB should be enough for just the wallet
+    dbenv->set_lg_bsize(0x10000);
+    dbenv->set_lg_max(1048576);
+    dbenv->set_lk_max_locks(40000);
+    dbenv->set_lk_max_objects(40000);
+    dbenv->set_errfile(fsbridge::fopen(pathErrorFile, "a")); /// debug
+    dbenv->set_flags(DB_AUTO_COMMIT, 1);
+    dbenv->set_flags(DB_TXN_WRITE_NOSYNC, 1);
+    dbenv->log_set_config(DB_LOG_AUTO_REMOVE, 1);
+    int ret = dbenv->open(strPath.c_str(),
+                         DB_CREATE |
+                             DB_INIT_LOCK |
+                             DB_INIT_LOG |
+                             DB_INIT_MPOOL |
+                             DB_INIT_TXN |
+                             DB_THREAD |
+                             DB_RECOVER |
+                             nEnvFlags,
+                         S_IRUSR | S_IWUSR);
+    if (ret != 0)
+        return error("CDBEnv::Open: Error %d opening database environment: %s\n", ret, DbEnv::strerror(ret));
+
+    fDbEnvInit = true;
+    fMockDb = false;
+    return true;
+}
+
+void CDBEnv::MakeMock()
+{
+    if (fDbEnvInit)
+        throw runtime_error("CDBEnv::MakeMock: Already initialized");
+
+    boost::this_thread::interruption_point();
+
+    LogPrint("db", "CDBEnv::MakeMock\n");
+
+    dbenv->set_cachesize(1, 0, 1);
+    dbenv->set_lg_bsize(10485760 * 4);
+    dbenv->set_lg_max(10485760);
+    dbenv->set_lk_max_locks(10000);
+    dbenv->set_lk_max_objects(10000);
+    dbenv->set_flags(DB_AUTO_COMMIT, 1);
+    dbenv->log_set_config(DB_LOG_IN_MEMORY, 1);
+    int ret = dbenv->open(NULL,
+                         DB_CREATE |
+                             DB_INIT_LOCK |
+                             DB_INIT_LOG |
+                             DB_INIT_MPOOL |
+                             DB_INIT_TXN |
+                             DB_THREAD |
+                             DB_PRIVATE,
+                         S_IRUSR | S_IWUSR);
+    if (ret > 0)
+        throw runtime_error(strprintf("CDBEnv::MakeMock: Error %d opening database environment.", ret));
+
+    fDbEnvInit = true;
+    fMockDb = true;
+}
+
+CDBEnv::VerifyResult CDBEnv::Verify(const std::string& strFile, bool (*recoverFunc)(CDBEnv& dbenv, const std::string& strFile))
+{
+    LOCK(cs_db);
+    assert(mapFileUseCount.count(strFile) == 0);
+
+    Db db(dbenv, 0);
+    int result = db.verify(strFile.c_str(), NULL, NULL, 0);
+    if (result == 0)
+        return VERIFY_OK;
+    else if (recoverFunc == NULL)
+        return RECOVER_FAIL;
+
+    // Try to recover:
+    bool fRecovered = (*recoverFunc)(*this, strFile);
+    return (fRecovered ? RECOVER_OK : RECOVER_FAIL);
+}
+
+bool CDBEnv::Salvage(const std::string& strFile, bool fAggressive, std::vector<CDBEnv::KeyValPair>& vResult)
+{
+    LOCK(cs_db);
+    assert(mapFileUseCount.count(strFile) == 0);
+
+    u_int32_t flags = DB_SALVAGE;
+    if (fAggressive)
+        flags |= DB_AGGRESSIVE;
+
+    stringstream strDump;
+
+    Db db(dbenv, 0);
+    int result = db.verify(strFile.c_str(), NULL, &strDump, flags);
+    if (result == DB_VERIFY_BAD) {
+        LogPrintf("CDBEnv::Salvage: Database salvage found errors, all data may not be recoverable.\n");
+        if (!fAggressive) {
+            LogPrintf("CDBEnv::Salvage: Rerun with aggressive mode to ignore errors and continue.\n");
+            return false;
+        }
+    }
+    if (result != 0 && result != DB_VERIFY_BAD) {
+        LogPrintf("CDBEnv::Salvage: Database salvage failed with result %d.\n", result);
+        return false;
+    }
+
+    // Format of bdb dump is ascii lines:
+    // header lines...
+    // HEADER=END
+    // hexadecimal key
+    // hexadecimal value
+    // ... repeated
+    // DATA=END
+
+    string strLine;
+    while (!strDump.eof() && strLine != "HEADER=END")
+        getline(strDump, strLine); // Skip past header
+
+    std::string keyHex, valueHex;
+    while (!strDump.eof() && keyHex != "DATA=END") {
+        getline(strDump, keyHex);
+        if (keyHex != "DATA_END") {
+            getline(strDump, valueHex);
+            vResult.push_back(make_pair(ParseHex(keyHex), ParseHex(valueHex)));
+        }
+    }
+
+    return (result == 0);
+}
+
+
+void CDBEnv::CheckpointLSN(const std::string& strFile)
+{
+    dbenv->txn_checkpoint(0, 0, 0);
+    if (fMockDb)
+        return;
+    dbenv->lsn_reset(strFile.c_str(), 0);
+}
+
+
+CDB::CDB(const std::string& strFilename, const char* pszMode, bool fFlushOnCloseIn) : pdb(NULL), activeTxn(NULL)
+{
+    int ret;
+    fReadOnly = (!strchr(pszMode, '+') && !strchr(pszMode, 'w'));
+    fFlushOnClose = fFlushOnCloseIn;
+    if (strFilename.empty())
+        return;
+
+    bool fCreate = strchr(pszMode, 'c') != NULL;
+    unsigned int nFlags = DB_THREAD;
+    if (fCreate)
+        nFlags |= DB_CREATE;
+
+    {
+        LOCK(bitdb.cs_db);
+        if (!bitdb.Open(GetDataDir()))
+            throw runtime_error("CDB: Failed to open database environment.");
+
+        strFile = strFilename;
+        ++bitdb.mapFileUseCount[strFile];
+        pdb = bitdb.mapDb[strFile];
+        if (pdb == NULL) {
+            pdb = new Db(bitdb.dbenv, 0);
+
+            bool fMockDb = bitdb.IsMock();
+            if (fMockDb) {
+                DbMpoolFile* mpf = pdb->get_mpf();
+                ret = mpf->set_flags(DB_MPOOL_NOFILE, 1);
+                if (ret != 0)
+                    throw runtime_error(strprintf("CDB: Failed to configure for no temp file backing for database %s", strFile));
+            }
+
+            ret = pdb->open(NULL,                               // Txn pointer
+                            fMockDb ? NULL : strFile.c_str(),   // Filename
+                            fMockDb ? strFile.c_str() : "main", // Logical db name
+                            DB_BTREE,                           // Database type
+                            nFlags,                             // Flags
+                            0);
+
+            if (ret != 0) {
+                delete pdb;
+                pdb = NULL;
+                --bitdb.mapFileUseCount[strFile];
+                strFile = "";
+                throw runtime_error(strprintf("CDB: Error %d, can't open database %s", ret, strFile));
+            }
+
+            if (fCreate && !Exists(string("version"))) {
+                bool fTmp = fReadOnly;
+                fReadOnly = false;
+                WriteVersion(CLIENT_VERSION);
+                fReadOnly = fTmp;
+            }
+
+            bitdb.mapDb[strFile] = pdb;
+        }
+    }
+}
+
+void CDB::Flush()
+{
+    if (activeTxn)
+        return;
+
+    // Flush database activity from memory pool to disk log
+    unsigned int nMinutes = 0;
+    if (fReadOnly)
+        nMinutes = 1;
+
+    bitdb.dbenv->txn_checkpoint(nMinutes ? GetArg("-dblogsize", DEFAULT_WALLET_DBLOGSIZE) * 1024 : 0, nMinutes, 0);
+}
+
+void CDB::Close()
+{
+    if (!pdb)
+        return;
+    if (activeTxn)
+        activeTxn->abort();
+    activeTxn = NULL;
+    pdb = NULL;
+
+    if (fFlushOnClose)
+        Flush();
+
+    {
+        LOCK(bitdb.cs_db);
+        --bitdb.mapFileUseCount[strFile];
+    }
+}
+
+void CDBEnv::CloseDb(const string& strFile)
+{
+    {
+        LOCK(cs_db);
+        if (mapDb[strFile] != NULL) {
+            // Close the database handle
+            Db* pdb = mapDb[strFile];
+            pdb->close(0);
+            delete pdb;
+            mapDb[strFile] = NULL;
+        }
+    }
+}
+
+bool CDBEnv::RemoveDb(const string& strFile)
+{
+    this->CloseDb(strFile);
+
+    LOCK(cs_db);
+    int rc = dbenv->dbremove(NULL, strFile.c_str(), NULL, DB_AUTO_COMMIT);
+    return (rc == 0);
+}
+
+bool CDB::Rewrite(const string& strFile, const char* pszSkip)
+{
+    while (true) {
+        {
+            LOCK(bitdb.cs_db);
+            if (!bitdb.mapFileUseCount.count(strFile) || bitdb.mapFileUseCount[strFile] == 0) {
+                // Flush log data to the dat file
+                bitdb.CloseDb(strFile);
+                bitdb.CheckpointLSN(strFile);
+                bitdb.mapFileUseCount.erase(strFile);
+
+                bool fSuccess = true;
+                LogPrintf("CDB::Rewrite: Rewriting %s...\n", strFile);
+                string strFileRes = strFile + ".rewrite";
+                { // surround usage of db with extra {}
+                    CDB db(strFile.c_str(), "r");
+                    Db* pdbCopy = new Db(bitdb.dbenv, 0);
+
+                    int ret = pdbCopy->open(NULL,               // Txn pointer
+                                            strFileRes.c_str(), // Filename
+                                            "main",             // Logical db name
+                                            DB_BTREE,           // Database type
+                                            DB_CREATE,          // Flags
+                                            0);
+                    if (ret > 0) {
+                        LogPrintf("CDB::Rewrite: Can't create database file %s\n", strFileRes);
+                        fSuccess = false;
+                    }
+
+                    Dbc* pcursor = db.GetCursor();
+                    if (pcursor)
+                        while (fSuccess) {
+                            CDataStream ssKey(SER_DISK, CLIENT_VERSION);
+                            CDataStream ssValue(SER_DISK, CLIENT_VERSION);
+                            int ret = db.ReadAtCursor(pcursor, ssKey, ssValue, DB_NEXT);
+                            if (ret == DB_NOTFOUND) {
+                                pcursor->close();
+                                break;
+                            } else if (ret != 0) {
+                                pcursor->close();
+                                fSuccess = false;
+                                break;
+                            }
+                            if (pszSkip &&
+                                strncmp(ssKey.data(), pszSkip, std::min(ssKey.size(), strlen(pszSkip))) == 0)
+                                continue;
+                            if (strncmp(ssKey.data(), "\x07version", 8) == 0) {
+                                // Update version:
+                                ssValue.clear();
+                                ssValue << CLIENT_VERSION;
+                            }
+                            Dbt datKey(ssKey.data(), ssKey.size());
+                            Dbt datValue(ssValue.data(), ssValue.size());
+                            int ret2 = pdbCopy->put(NULL, &datKey, &datValue, DB_NOOVERWRITE);
+                            if (ret2 > 0)
+                                fSuccess = false;
+                        }
+                    if (fSuccess) {
+                        db.Close();
+                        bitdb.CloseDb(strFile);
+                        if (pdbCopy->close(0))
+                            fSuccess = false;
+                        delete pdbCopy;
+                    }
+                }
+                if (fSuccess) {
+                    Db dbA(bitdb.dbenv, 0);
+                    if (dbA.remove(strFile.c_str(), NULL, 0))
+                        fSuccess = false;
+                    Db dbB(bitdb.dbenv, 0);
+                    if (dbB.rename(strFileRes.c_str(), NULL, strFile.c_str(), 0))
+                        fSuccess = false;
+                }
+                if (!fSuccess)
+                    LogPrintf("CDB::Rewrite: Failed to rewrite database file %s\n", strFileRes);
+                return fSuccess;
+            }
+        }
+        MilliSleep(100);
+    }
+    return false;
+}
+
+
+void CDBEnv::Flush(bool fShutdown)
+{
+    int64_t nStart = GetTimeMillis();
+    // Flush log data to the actual data file on all files that are not in use
+    LogPrint("db", "CDBEnv::Flush: Flush(%s)%s\n", fShutdown ? "true" : "false", fDbEnvInit ? "" : " database not started");
+    if (!fDbEnvInit)
+        return;
+    {
+        LOCK(cs_db);
+        map<string, int>::iterator mi = mapFileUseCount.begin();
+        while (mi != mapFileUseCount.end()) {
+            string strFile = (*mi).first;
+            int nRefCount = (*mi).second;
+            LogPrint("db", "CDBEnv::Flush: Flushing %s (refcount = %d)...\n", strFile, nRefCount);
+            if (nRefCount == 0) {
+                // Move log data to the dat file
+                CloseDb(strFile);
+                LogPrint("db", "CDBEnv::Flush: %s checkpoint\n", strFile);
+                dbenv->txn_checkpoint(0, 0, 0);
+                LogPrint("db", "CDBEnv::Flush: %s detach\n", strFile);
+                if (!fMockDb)
+                    dbenv->lsn_reset(strFile.c_str(), 0);
+                LogPrint("db", "CDBEnv::Flush: %s closed\n", strFile);
+                mi = mapFileUseCount.erase(mi);
+            } else
+                mi++;
+        }
+        LogPrint("db", "CDBEnv::Flush: Flush(%s)%s took %15dms\n", fShutdown ? "true" : "false", fDbEnvInit ? "" : " database not started", GetTimeMillis() - nStart);
+        if (fShutdown) {
+            char** listp;
+            if (mapFileUseCount.empty()) {
+                dbenv->log_archive(&listp, DB_ARCH_REMOVE);
+                Close();
+                if (!fMockDb)
+                    fs::remove_all(fs::path(strPath) / "database");
+            }
+        }
+    }
+}
diff --git a/depend/zcash/src/wallet/db.h b/depend/zcash/src/wallet/db.h
new file mode 100644
index 000000000..76e315aa0
--- /dev/null
+++ b/depend/zcash/src/wallet/db.h
@@ -0,0 +1,312 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_WALLET_DB_H
+#define BITCOIN_WALLET_DB_H
+
+#include "clientversion.h"
+#include "fs.h"
+#include "serialize.h"
+#include "streams.h"
+#include "sync.h"
+#include "version.h"
+
+#include <map>
+#include <string>
+#include <vector>
+
+#include <boost/scope_exit.hpp>
+
+#include <db_cxx.h>
+
+static const unsigned int DEFAULT_WALLET_DBLOGSIZE = 100;
+static const bool DEFAULT_WALLET_PRIVDB = true;
+
+class CDBEnv
+{
+private:
+    bool fDbEnvInit;
+    bool fMockDb;
+    // Don't change into fs::path, as that can result in
+    // shutdown problems/crashes caused by a static initialized internal pointer.
+    std::string strPath;
+
+    void EnvShutdown();
+
+public:
+    mutable CCriticalSection cs_db;
+    DbEnv *dbenv;
+    std::map<std::string, int> mapFileUseCount;
+    std::map<std::string, Db*> mapDb;
+
+    CDBEnv();
+    ~CDBEnv();
+    void Reset();
+
+    void MakeMock();
+    bool IsMock() { return fMockDb; }
+
+    /**
+     * Verify that database file strFile is OK. If it is not,
+     * call the callback to try to recover.
+     * This must be called BEFORE strFile is opened.
+     * Returns true if strFile is OK.
+     */
+    enum VerifyResult { VERIFY_OK,
+                        RECOVER_OK,
+                        RECOVER_FAIL };
+    VerifyResult Verify(const std::string& strFile, bool (*recoverFunc)(CDBEnv& dbenv, const std::string& strFile));
+    /**
+     * Salvage data from a file that Verify says is bad.
+     * fAggressive sets the DB_AGGRESSIVE flag (see berkeley DB->verify() method documentation).
+     * Appends binary key/value pairs to vResult, returns true if successful.
+     * NOTE: reads the entire database into memory, so cannot be used
+     * for huge databases.
+     */
+    typedef std::pair<std::vector<unsigned char>, std::vector<unsigned char> > KeyValPair;
+    bool Salvage(const std::string& strFile, bool fAggressive, std::vector<KeyValPair>& vResult);
+
+    bool Open(const fs::path& path);
+    void Close();
+    void Flush(bool fShutdown);
+    void CheckpointLSN(const std::string& strFile);
+
+    void CloseDb(const std::string& strFile);
+    bool RemoveDb(const std::string& strFile);
+
+    DbTxn* TxnBegin(int flags = DB_TXN_WRITE_NOSYNC)
+    {
+        DbTxn* ptxn = NULL;
+        int ret = dbenv->txn_begin(NULL, &ptxn, flags);
+        if (!ptxn || ret != 0)
+            return NULL;
+        return ptxn;
+    }
+};
+
+extern CDBEnv bitdb;
+
+
+/** RAII class that provides access to a Berkeley database */
+class CDB
+{
+protected:
+    Db* pdb;
+    std::string strFile;
+    DbTxn* activeTxn;
+    bool fReadOnly;
+    bool fFlushOnClose;
+
+    explicit CDB(const std::string& strFilename, const char* pszMode = "r+", bool fFlushOnCloseIn=true);
+    ~CDB() { Close(); }
+
+public:
+    void Flush();
+    void Close();
+
+private:
+    CDB(const CDB&);
+    void operator=(const CDB&);
+
+protected:
+    template <typename K, typename T>
+    bool Read(const K& key, T& value)
+    {
+        if (!pdb)
+            return false;
+
+        // Key
+        CDataStream ssKey(SER_DISK, CLIENT_VERSION);
+        ssKey.reserve(1000);
+        ssKey << key;
+        Dbt datKey(ssKey.data(), ssKey.size());
+
+        // Read
+        Dbt datValue;
+        datValue.set_flags(DB_DBT_MALLOC);
+        int ret = pdb->get(activeTxn, &datKey, &datValue, 0);
+        memory_cleanse(datKey.get_data(), datKey.get_size());
+        if (datValue.get_data() != NULL) {
+            BOOST_SCOPE_EXIT_TPL(&datValue) {
+                // Clear and free memory
+                memory_cleanse(datValue.get_data(), datValue.get_size());
+                free(datValue.get_data());
+            } BOOST_SCOPE_EXIT_END
+
+            // Unserialize value
+            try {
+                CDataStream ssValue((char*)datValue.get_data(), (char*)datValue.get_data() + datValue.get_size(), SER_DISK, CLIENT_VERSION);
+                ssValue >> value;
+            } catch (const std::exception&) {
+                return false;
+            }
+        }
+        return (ret == 0);
+    }
+
+    template <typename K, typename T>
+    bool Write(const K& key, const T& value, bool fOverwrite = true)
+    {
+        if (!pdb)
+            return false;
+        if (fReadOnly)
+            assert(!"Write called on database in read-only mode");
+
+        // Key
+        CDataStream ssKey(SER_DISK, CLIENT_VERSION);
+        ssKey.reserve(1000);
+        ssKey << key;
+        Dbt datKey(ssKey.data(), ssKey.size());
+
+        // Value
+        CDataStream ssValue(SER_DISK, CLIENT_VERSION);
+        ssValue.reserve(10000);
+        ssValue << value;
+        Dbt datValue(ssValue.data(), ssValue.size());
+
+        // Write
+        int ret = pdb->put(activeTxn, &datKey, &datValue, (fOverwrite ? 0 : DB_NOOVERWRITE));
+
+        // Clear memory in case it was a private key
+        memory_cleanse(datKey.get_data(), datKey.get_size());
+        memory_cleanse(datValue.get_data(), datValue.get_size());
+        return (ret == 0);
+    }
+
+    template <typename K>
+    bool Erase(const K& key)
+    {
+        if (!pdb)
+            return false;
+        if (fReadOnly)
+            assert(!"Erase called on database in read-only mode");
+
+        // Key
+        CDataStream ssKey(SER_DISK, CLIENT_VERSION);
+        ssKey.reserve(1000);
+        ssKey << key;
+        Dbt datKey(ssKey.data(), ssKey.size());
+
+        // Erase
+        int ret = pdb->del(activeTxn, &datKey, 0);
+
+        // Clear memory
+        memory_cleanse(datKey.get_data(), datKey.get_size());
+        return (ret == 0 || ret == DB_NOTFOUND);
+    }
+
+    template <typename K>
+    bool Exists(const K& key)
+    {
+        if (!pdb)
+            return false;
+
+        // Key
+        CDataStream ssKey(SER_DISK, CLIENT_VERSION);
+        ssKey.reserve(1000);
+        ssKey << key;
+        Dbt datKey(ssKey.data(), ssKey.size());
+
+        // Exists
+        int ret = pdb->exists(activeTxn, &datKey, 0);
+
+        // Clear memory
+        memory_cleanse(datKey.get_data(), datKey.get_size());
+        return (ret == 0);
+    }
+
+    Dbc* GetCursor()
+    {
+        if (!pdb)
+            return NULL;
+        Dbc* pcursor = NULL;
+        int ret = pdb->cursor(NULL, &pcursor, 0);
+        if (ret != 0)
+            return NULL;
+        return pcursor;
+    }
+
+    int ReadAtCursor(Dbc* pcursor, CDataStream& ssKey, CDataStream& ssValue, unsigned int fFlags = DB_NEXT)
+    {
+        // Read at cursor
+        Dbt datKey;
+        if (fFlags == DB_SET || fFlags == DB_SET_RANGE || fFlags == DB_GET_BOTH || fFlags == DB_GET_BOTH_RANGE) {
+            datKey.set_data(ssKey.data());
+            datKey.set_size(ssKey.size());
+        }
+        Dbt datValue;
+        if (fFlags == DB_GET_BOTH || fFlags == DB_GET_BOTH_RANGE) {
+            datValue.set_data(&ssValue[0]);
+            datValue.set_size(ssValue.size());
+        }
+        datKey.set_flags(DB_DBT_MALLOC);
+        datValue.set_flags(DB_DBT_MALLOC);
+        int ret = pcursor->get(&datKey, &datValue, fFlags);
+        if (ret != 0)
+            return ret;
+        else if (datKey.get_data() == NULL || datValue.get_data() == NULL)
+            return 99999;
+
+        // Convert to streams
+        ssKey.SetType(SER_DISK);
+        ssKey.clear();
+        ssKey.write((char*)datKey.get_data(), datKey.get_size());
+        ssValue.SetType(SER_DISK);
+        ssValue.clear();
+        ssValue.write((char*)datValue.get_data(), datValue.get_size());
+
+        // Clear and free memory
+        memory_cleanse(datKey.get_data(), datKey.get_size());
+        memory_cleanse(datValue.get_data(), datValue.get_size());
+        free(datKey.get_data());
+        free(datValue.get_data());
+        return 0;
+    }
+
+public:
+    bool TxnBegin()
+    {
+        if (!pdb || activeTxn)
+            return false;
+        DbTxn* ptxn = bitdb.TxnBegin();
+        if (!ptxn)
+            return false;
+        activeTxn = ptxn;
+        return true;
+    }
+
+    bool TxnCommit()
+    {
+        if (!pdb || !activeTxn)
+            return false;
+        int ret = activeTxn->commit(0);
+        activeTxn = NULL;
+        return (ret == 0);
+    }
+
+    bool TxnAbort()
+    {
+        if (!pdb || !activeTxn)
+            return false;
+        int ret = activeTxn->abort();
+        activeTxn = NULL;
+        return (ret == 0);
+    }
+
+    bool ReadVersion(int& nVersion)
+    {
+        nVersion = 0;
+        return Read(std::string("version"), nVersion);
+    }
+
+    bool WriteVersion(int nVersion)
+    {
+        return Write(std::string("version"), nVersion);
+    }
+
+    bool static Rewrite(const std::string& strFile, const char* pszSkip = NULL);
+};
+
+#endif // BITCOIN_WALLET_DB_H
diff --git a/depend/zcash/src/wallet/gtest/test_note_selection.cpp b/depend/zcash/src/wallet/gtest/test_note_selection.cpp
new file mode 100644
index 000000000..4ed7bf843
--- /dev/null
+++ b/depend/zcash/src/wallet/gtest/test_note_selection.cpp
@@ -0,0 +1,503 @@
+#include <gtest/gtest.h>
+
+#include "primitives/transaction.h"
+#include "wallet/wallet.h"
+#include "zcash/Note.hpp"
+#include "zcash/address/sapling.hpp"
+#include "zcash/address/sprout.hpp"
+
+using namespace libzcash;
+
+void PrintTo(const OutputPool& pool, std::ostream* os) {
+    switch (pool) {
+        case OutputPool::Orchard: *os << "Orchard"; break;
+        case OutputPool::Sapling: *os << "Sapling"; break;
+        case OutputPool::Transparent: *os << "Transparent"; break;
+    }
+}
+
+CWalletTx FakeWalletTx()
+{
+    CMutableTransaction mtx;
+    mtx.vout.resize(1);
+    mtx.vout[0].nValue = 1;
+    return CWalletTx(nullptr, mtx);
+}
+
+SpendableInputs FakeSpendableInputs(
+    std::set<OutputPool> available,
+    bool includeSprout,
+    const CWalletTx* wtx)
+{
+    SpendableInputs inputs;
+
+    if (available.count(OutputPool::Orchard)) {
+        auto seed = MnemonicSeed::Random(0);
+        auto sk = libzcash::OrchardSpendingKey::ForAccount(seed, 0, 0);
+        libzcash::diversifier_index_t j(0);
+        auto address = sk.ToFullViewingKey().ToIncomingViewingKey().Address(j);
+        for (int i = 0; i < 10; i++) {
+            OrchardOutPoint op;
+            inputs.orchardNoteMetadata.push_back(OrchardNoteMetadata{
+                op, address, 1, {}});
+        }
+    }
+
+    if (available.count(OutputPool::Sapling)) {
+        for (int i = 0; i < 10; i++) {
+            SaplingOutPoint op;
+            libzcash::SaplingPaymentAddress address;
+            libzcash::SaplingNote note(address, 1, libzcash::Zip212Enabled::AfterZip212);
+            inputs.saplingNoteEntries.push_back(SaplingNoteEntry{
+                op, address, note, {}, 100});
+        }
+    }
+
+    if (available.count(OutputPool::Transparent)) {
+        for (int i = 0; i < 10; i++) {
+            COutput utxo(wtx, 0, 100, true);
+            inputs.utxos.push_back(utxo);
+        }
+    }
+
+    if (includeSprout) {
+        for (int i = 0; i < 10; i++) {
+            JSOutPoint jsop;
+            libzcash::SproutPaymentAddress address;
+            libzcash::SproutNote note(uint256(), 1, uint256(), uint256());
+            inputs.sproutNoteEntries.push_back(SproutNoteEntry{
+                jsop, address, note, {}, 100});
+        }
+    }
+
+    return inputs;
+}
+
+class SpendableInputsTest :
+    public ::testing::TestWithParam<std::tuple<
+        // Pools with available inputs
+        std::set<OutputPool>,
+        // Recipient pools
+        std::set<OutputPool>,
+        // List of expected pool selection orders
+        std::vector<std::vector<OutputPool>>>> {
+};
+
+TEST_P(SpendableInputsTest, OrderListIsSequentiallyIncreasing)
+{
+    // The list of selection orders encodes the "failover" as we exceed the
+    // funds available in the selected pools. For simplicity, we require these
+    // to be sequentially increasing in length.
+    auto order = std::get<2>(GetParam());
+    for (int i = 0; i < order.size(); i++) {
+        EXPECT_EQ(order[i].size(), i + 1);
+    }
+}
+
+TEST_P(SpendableInputsTest, SelectsSproutBeforeFirst)
+{
+    auto available = std::get<0>(GetParam());
+    auto recipientPools = std::get<1>(GetParam());
+    auto order = std::get<2>(GetParam());
+    auto wtx = FakeWalletTx();
+
+    bool canSelectSprout = !(recipientPools.count(OutputPool::Orchard));
+
+    // Create a set of inputs from Sprout and the available pools.
+    auto inputs = FakeSpendableInputs(available, true, &wtx);
+    EXPECT_EQ(inputs.Total(), 10 * (available.size() + 1));
+
+    // We have Sprout notes along with the expected notes.
+    EXPECT_EQ(inputs.sproutNoteEntries.size(), 10);
+    for (auto pool : available) {
+        switch (pool) {
+            case OutputPool::Orchard: EXPECT_EQ(inputs.orchardNoteMetadata.size(), 10); break;
+            case OutputPool::Sapling: EXPECT_EQ(inputs.saplingNoteEntries.size(), 10); break;
+            case OutputPool::Transparent: EXPECT_EQ(inputs.utxos.size(), 10); break;
+        }
+    }
+
+    // Limit to 5 zatoshis (which can be satisfied by any pool).
+    EXPECT_TRUE(inputs.LimitToAmount(5, 1, recipientPools));
+    EXPECT_EQ(inputs.Total(), 5);
+
+    if (canSelectSprout) {
+        // We only have Sprout notes.
+        EXPECT_EQ(inputs.sproutNoteEntries.size(), 5);
+        for (auto pool : order[0]) {
+            switch (pool) {
+                case OutputPool::Orchard: EXPECT_EQ(inputs.orchardNoteMetadata.size(), 0); break;
+                case OutputPool::Sapling: EXPECT_EQ(inputs.saplingNoteEntries.size(), 0); break;
+                case OutputPool::Transparent: EXPECT_EQ(inputs.utxos.size(), 0); break;
+            }
+        }
+    } else {
+        // We never have Sprout notes.
+        EXPECT_EQ(inputs.sproutNoteEntries.size(), 0);
+        for (auto pool : order[0]) {
+            switch (pool) {
+                case OutputPool::Orchard: EXPECT_EQ(inputs.orchardNoteMetadata.size(), 5); break;
+                case OutputPool::Sapling: EXPECT_EQ(inputs.saplingNoteEntries.size(), 5); break;
+                case OutputPool::Transparent: EXPECT_EQ(inputs.utxos.size(), 5); break;
+            }
+        }
+    }
+}
+
+TEST_P(SpendableInputsTest, SelectsSproutThenFirst)
+{
+    auto available = std::get<0>(GetParam());
+    auto recipientPools = std::get<1>(GetParam());
+    auto order = std::get<2>(GetParam());
+    auto wtx = FakeWalletTx();
+
+    bool canSelectSprout = !(recipientPools.count(OutputPool::Orchard));
+
+    // Create a set of inputs from Sprout and the available pools.
+    auto inputs = FakeSpendableInputs(available, true, &wtx);
+    EXPECT_EQ(inputs.Total(), 10 * (available.size() + 1));
+
+    // We have Sprout notes along with the expected notes.
+    EXPECT_EQ(inputs.sproutNoteEntries.size(), 10);
+    for (auto pool : available) {
+        switch (pool) {
+            case OutputPool::Orchard: EXPECT_EQ(inputs.orchardNoteMetadata.size(), 10); break;
+            case OutputPool::Sapling: EXPECT_EQ(inputs.saplingNoteEntries.size(), 10); break;
+            case OutputPool::Transparent: EXPECT_EQ(inputs.utxos.size(), 10); break;
+        }
+    }
+
+    // Limit to 14 zatoshis (which requires two pools). If we only have one pool
+    // available and can't select Sprout, we won't have sufficient funds.
+    auto sufficientFunds = inputs.LimitToAmount(14, 1, std::get<1>(GetParam()));
+    if (available.size() == 1 && !canSelectSprout) {
+        EXPECT_FALSE(sufficientFunds);
+        EXPECT_EQ(inputs.Total(), 10);
+
+        // We have no Sprout notes and all from the first pool in the first order.
+        EXPECT_EQ(inputs.sproutNoteEntries.size(), 0);
+        for (int i = 0; i < order[0].size(); i++) {
+            auto expected = i == 0 ? 10 : 0;
+            switch (order[0][i]) {
+                case OutputPool::Orchard: EXPECT_EQ(inputs.orchardNoteMetadata.size(), expected); break;
+                case OutputPool::Sapling: EXPECT_EQ(inputs.saplingNoteEntries.size(), expected); break;
+                case OutputPool::Transparent: EXPECT_EQ(inputs.utxos.size(), expected); break;
+            }
+        }
+    } else {
+        EXPECT_TRUE(sufficientFunds);
+        EXPECT_EQ(inputs.Total(), 14);
+
+        if (canSelectSprout) {
+            // We have all Sprout notes and some from the first pool in the
+            // first order.
+            EXPECT_EQ(inputs.sproutNoteEntries.size(), 10);
+            for (int i = 0; i < order[0].size(); i++) {
+                auto expected = i == 0 ? 4 : 0;
+                switch (order[0][i]) {
+                    case OutputPool::Orchard: EXPECT_EQ(inputs.orchardNoteMetadata.size(), expected); break;
+                    case OutputPool::Sapling: EXPECT_EQ(inputs.saplingNoteEntries.size(), expected); break;
+                    case OutputPool::Transparent: EXPECT_EQ(inputs.utxos.size(), expected); break;
+                }
+            }
+        } else {
+            // We have all notes from the first pool and some from the second,
+            // in the second order.
+            EXPECT_EQ(inputs.sproutNoteEntries.size(), 0);
+            for (int i = 0; i < order[1].size(); i++) {
+                auto expected = i == 0 ? 10 : i == 1 ? 4 : 0;
+                switch (order[1][i]) {
+                    case OutputPool::Orchard: EXPECT_EQ(inputs.orchardNoteMetadata.size(), expected); break;
+                    case OutputPool::Sapling: EXPECT_EQ(inputs.saplingNoteEntries.size(), expected); break;
+                    case OutputPool::Transparent: EXPECT_EQ(inputs.utxos.size(), expected); break;
+                }
+            }
+        }
+    }
+}
+
+TEST_P(SpendableInputsTest, SelectsFirstBeforeSecond)
+{
+    auto available = std::get<0>(GetParam());
+    auto recipientPools = std::get<1>(GetParam());
+    auto order = std::get<2>(GetParam());
+    auto wtx = FakeWalletTx();
+
+    // Create a set of inputs from the available pools.
+    auto inputs = FakeSpendableInputs(available, false, &wtx);
+    EXPECT_EQ(inputs.Total(), 10 * available.size());
+
+    // We have the expected notes.
+    EXPECT_EQ(inputs.sproutNoteEntries.size(), 0);
+    for (auto pool : available) {
+        switch (pool) {
+            case OutputPool::Orchard: EXPECT_EQ(inputs.orchardNoteMetadata.size(), 10); break;
+            case OutputPool::Sapling: EXPECT_EQ(inputs.saplingNoteEntries.size(), 10); break;
+            case OutputPool::Transparent: EXPECT_EQ(inputs.utxos.size(), 10); break;
+        }
+    }
+
+    // Limit to 8 zatoshis (which can be satisfied by any pool).
+    EXPECT_TRUE(inputs.LimitToAmount(8, 1, std::get<1>(GetParam())));
+    EXPECT_EQ(inputs.Total(), 8);
+
+    // We use the first order and only have the first pool selected.
+    EXPECT_EQ(inputs.sproutNoteEntries.size(), 0);
+    for (int i = 0; i < order[0].size(); i++) {
+        auto expected = i == 0 ? 8 : 0;
+        switch (order[0][i]) {
+            case OutputPool::Orchard: EXPECT_EQ(inputs.orchardNoteMetadata.size(), expected); break;
+            case OutputPool::Sapling: EXPECT_EQ(inputs.saplingNoteEntries.size(), expected); break;
+            case OutputPool::Transparent: EXPECT_EQ(inputs.utxos.size(), expected); break;
+        }
+    }
+}
+
+TEST_P(SpendableInputsTest, SelectsFirstThenSecond)
+{
+    auto available = std::get<0>(GetParam());
+    auto recipientPools = std::get<1>(GetParam());
+    auto order = std::get<2>(GetParam());
+    auto wtx = FakeWalletTx();
+
+    // Create a set of inputs from the available pools.
+    auto inputs = FakeSpendableInputs(available, false, &wtx);
+    EXPECT_EQ(inputs.Total(), 10 * available.size());
+
+    // We have the expected notes.
+    EXPECT_EQ(inputs.sproutNoteEntries.size(), 0);
+    for (auto pool : available) {
+        switch (pool) {
+            case OutputPool::Orchard: EXPECT_EQ(inputs.orchardNoteMetadata.size(), 10); break;
+            case OutputPool::Sapling: EXPECT_EQ(inputs.saplingNoteEntries.size(), 10); break;
+            case OutputPool::Transparent: EXPECT_EQ(inputs.utxos.size(), 10); break;
+        }
+    }
+
+    // Limit to 13 zatoshis (which requires two pools).
+    // If we only have one pool available, we won't have sufficient funds.
+    auto sufficientFunds = inputs.LimitToAmount(13, 1, std::get<1>(GetParam()));
+    if (available.size() == 1) {
+        EXPECT_FALSE(sufficientFunds);
+        EXPECT_EQ(inputs.Total(), 10);
+
+        // We have selected all of the available pool.
+        EXPECT_EQ(inputs.sproutNoteEntries.size(), 0);
+        for (int i = 0; i < order[0].size(); i++) {
+            switch (order[0][i]) {
+                case OutputPool::Orchard: EXPECT_EQ(inputs.orchardNoteMetadata.size(), 10); break;
+                case OutputPool::Sapling: EXPECT_EQ(inputs.saplingNoteEntries.size(), 10); break;
+                case OutputPool::Transparent: EXPECT_EQ(inputs.utxos.size(), 10); break;
+            }
+        }
+    } else {
+        EXPECT_TRUE(sufficientFunds);
+        EXPECT_EQ(inputs.Total(), 13);
+
+        // We have all of the first pool and some of the second.
+        EXPECT_EQ(inputs.sproutNoteEntries.size(), 0);
+        for (int i = 0; i < order[1].size(); i++) {
+            auto expected = i == 0 ? 10 : i == 1 ? 3 : 0;
+            switch (order[1][i]) {
+                case OutputPool::Orchard: EXPECT_EQ(inputs.orchardNoteMetadata.size(), expected); break;
+                case OutputPool::Sapling: EXPECT_EQ(inputs.saplingNoteEntries.size(), expected); break;
+                case OutputPool::Transparent: EXPECT_EQ(inputs.utxos.size(), expected); break;
+            }
+        }
+    }
+}
+
+TEST_P(SpendableInputsTest, SelectsSproutAndFirstThenSecond)
+{
+    auto available = std::get<0>(GetParam());
+    auto recipientPools = std::get<1>(GetParam());
+    auto order = std::get<2>(GetParam());
+    auto wtx = FakeWalletTx();
+
+    bool canSelectSprout = !(recipientPools.count(OutputPool::Orchard));
+
+    // Create a set of inputs from Sprout and the available pools.
+    auto inputs = FakeSpendableInputs(available, true, &wtx);
+    EXPECT_EQ(inputs.Total(), 10 * (available.size() + 1));
+
+    // We have Sprout notes along with the expected notes.
+    EXPECT_EQ(inputs.sproutNoteEntries.size(), 10);
+    for (auto pool : available) {
+        switch (pool) {
+            case OutputPool::Orchard: EXPECT_EQ(inputs.orchardNoteMetadata.size(), 10); break;
+            case OutputPool::Sapling: EXPECT_EQ(inputs.saplingNoteEntries.size(), 10); break;
+            case OutputPool::Transparent: EXPECT_EQ(inputs.utxos.size(), 10); break;
+        }
+    }
+
+    // Limit to 24 zatoshis. If we only have one pool available, or we have two
+    // pools but can't select Sprout, we won't have sufficient funds.
+    auto sufficientFunds = inputs.LimitToAmount(24, 1, std::get<1>(GetParam()));
+    if (available.size() == 1 || (available.size() == 2 && !canSelectSprout)) {
+        EXPECT_FALSE(sufficientFunds);
+        EXPECT_EQ(inputs.Total(), (canSelectSprout || available.size() == 2) ? 20 : 10);
+
+        // We have selected all of the available pool.
+        EXPECT_EQ(inputs.sproutNoteEntries.size(), canSelectSprout ? 10 : 0);
+        for (int i = 0; i < order[0].size(); i++) {
+            switch (order[0][i]) {
+                case OutputPool::Orchard: EXPECT_EQ(inputs.orchardNoteMetadata.size(), 10); break;
+                case OutputPool::Sapling: EXPECT_EQ(inputs.saplingNoteEntries.size(), 10); break;
+                case OutputPool::Transparent: EXPECT_EQ(inputs.utxos.size(), 10); break;
+            }
+        }
+    } else {
+        EXPECT_TRUE(sufficientFunds);
+        EXPECT_EQ(inputs.Total(), 24);
+
+        if (canSelectSprout) {
+            // We have all of Sprout and the first pool, and some of the second,
+            // in the second order.
+            EXPECT_EQ(inputs.sproutNoteEntries.size(), 10);
+            for (int i = 0; i < order[1].size(); i++) {
+                auto expected = i == 0 ? 10 : i == 1 ? 4 : 0;
+                switch (order[1][i]) {
+                    case OutputPool::Orchard: EXPECT_EQ(inputs.orchardNoteMetadata.size(), expected); break;
+                    case OutputPool::Sapling: EXPECT_EQ(inputs.saplingNoteEntries.size(), expected); break;
+                    case OutputPool::Transparent: EXPECT_EQ(inputs.utxos.size(), expected); break;
+                }
+            }
+        } else {
+            // We have all notes from the first and second pools and some from
+            // the third, in the third order.
+            EXPECT_EQ(inputs.sproutNoteEntries.size(), 0);
+            for (int i = 0; i < order[2].size(); i++) {
+                auto expected = i <= 1 ? 10 : i == 2 ? 4 : 0;
+                switch (order[2][i]) {
+                    case OutputPool::Orchard: EXPECT_EQ(inputs.orchardNoteMetadata.size(), expected); break;
+                    case OutputPool::Sapling: EXPECT_EQ(inputs.saplingNoteEntries.size(), expected); break;
+                    case OutputPool::Transparent: EXPECT_EQ(inputs.utxos.size(), expected); break;
+                }
+            }
+        }
+    }
+}
+
+TEST_P(SpendableInputsTest, OpportunisticShielding)
+{
+    auto available = std::get<0>(GetParam());
+    auto recipientPools = std::get<1>(GetParam());
+    auto order = std::get<2>(GetParam());
+    auto wtx = FakeWalletTx();
+
+    // If we don't have multiple pools of which one is transparent, this test
+    // doesn't apply.
+    if (!(available.size() > 1 && available.count(OutputPool::Transparent))) {
+        return;
+    }
+
+    // Create a set of inputs from the available pools.
+    auto inputs = FakeSpendableInputs(available, false, &wtx);
+    EXPECT_EQ(inputs.Total(), 10 * available.size());
+
+    // Remove notes from the shielded pools, so we have more transparent funds.
+    EXPECT_EQ(inputs.sproutNoteEntries.size(), 0);
+    for (auto pool : available) {
+        switch (pool) {
+            case OutputPool::Orchard:
+                while (inputs.orchardNoteMetadata.size() > 3) {
+                    inputs.orchardNoteMetadata.pop_back();
+                }
+                EXPECT_EQ(inputs.orchardNoteMetadata.size(), 3);
+                break;
+            case OutputPool::Sapling:
+                while (inputs.saplingNoteEntries.size() > 3) {
+                    inputs.saplingNoteEntries.pop_back();
+                }
+                EXPECT_EQ(inputs.saplingNoteEntries.size(), 3);
+                break;
+            case OutputPool::Transparent: EXPECT_EQ(inputs.utxos.size(), 10); break;
+        }
+    }
+
+    // Limit to 7 zatoshis. We can't satisfy this with two shielded pools, so we
+    // will trigger the opportunistic shielding logic, which causes us to select
+    // all transparent notes. Because transparent is sufficient to reach the
+    // target amount, we don't select any shielded notes.
+    EXPECT_TRUE(inputs.LimitToAmount(7, 1, std::get<1>(GetParam())));
+    EXPECT_EQ(inputs.Total(), 10);
+
+    EXPECT_EQ(inputs.orchardNoteMetadata.size(), 0);
+    EXPECT_EQ(inputs.saplingNoteEntries.size(), 0);
+    EXPECT_EQ(inputs.sproutNoteEntries.size(), 0);
+    EXPECT_EQ(inputs.utxos.size(), 10);
+}
+
+const std::set<OutputPool> SET_T({OutputPool::Transparent});
+const std::set<OutputPool> SET_S({OutputPool::Sapling});
+const std::set<OutputPool> SET_O({OutputPool::Orchard});
+const std::set<OutputPool> SET_TS({OutputPool::Transparent, OutputPool::Sapling});
+const std::set<OutputPool> SET_TO({OutputPool::Transparent, OutputPool::Orchard});
+const std::set<OutputPool> SET_SO({OutputPool::Sapling, OutputPool::Orchard});
+const std::set<OutputPool> SET_TSO({OutputPool::Transparent, OutputPool::Sapling, OutputPool::Orchard});
+
+const std::vector<OutputPool> VEC_T({OutputPool::Transparent});
+const std::vector<OutputPool> VEC_S({OutputPool::Sapling});
+const std::vector<OutputPool> VEC_O({OutputPool::Orchard});
+const std::vector<OutputPool> VEC_TS({OutputPool::Transparent, OutputPool::Sapling});
+const std::vector<OutputPool> VEC_TO({OutputPool::Transparent, OutputPool::Orchard});
+const std::vector<OutputPool> VEC_SO({OutputPool::Sapling, OutputPool::Orchard});
+const std::vector<OutputPool> VEC_TSO({OutputPool::Transparent, OutputPool::Sapling, OutputPool::Orchard});
+
+INSTANTIATE_TEST_CASE_P(
+    ExhaustiveCases,
+    SpendableInputsTest,
+    ::testing::Values(
+        //              Available | Recipients          | Order             // Rationale
+        //              ----------|---------------------|-------------------//----------
+        std::make_tuple(SET_T,      SET_T,   std::vector({VEC_T})),         // N/A
+        std::make_tuple(SET_T,      SET_S,   std::vector({VEC_T})),         // N/A
+        std::make_tuple(SET_T,      SET_O,   std::vector({VEC_T})),         // N/A
+        std::make_tuple(SET_T,      SET_TS,  std::vector({VEC_T})),         // N/A
+        std::make_tuple(SET_T,      SET_TO,  std::vector({VEC_T})),         // N/A
+        std::make_tuple(SET_T,      SET_SO,  std::vector({VEC_T})),         // N/A
+        std::make_tuple(SET_T,      SET_TSO, std::vector({VEC_T})),         // N/A
+        std::make_tuple(SET_S,      SET_T,   std::vector({VEC_S})),         // N/A
+        std::make_tuple(SET_S,      SET_S,   std::vector({VEC_S})),         // N/A
+        std::make_tuple(SET_S,      SET_O,   std::vector({VEC_S})),         // N/A
+        std::make_tuple(SET_S,      SET_TS,  std::vector({VEC_S})),         // N/A
+        std::make_tuple(SET_S,      SET_TO,  std::vector({VEC_S})),         // N/A
+        std::make_tuple(SET_S,      SET_SO,  std::vector({VEC_S})),         // N/A
+        std::make_tuple(SET_S,      SET_TSO, std::vector({VEC_S})),         // N/A
+        std::make_tuple(SET_O,      SET_T,   std::vector({VEC_O})),         // N/A
+        std::make_tuple(SET_O,      SET_S,   std::vector({VEC_O})),         // N/A
+        std::make_tuple(SET_O,      SET_O,   std::vector({VEC_O})),         // N/A
+        std::make_tuple(SET_O,      SET_TS,  std::vector({VEC_O})),         // N/A
+        std::make_tuple(SET_O,      SET_TO,  std::vector({VEC_O})),         // N/A
+        std::make_tuple(SET_O,      SET_SO,  std::vector({VEC_O})),         // N/A
+        std::make_tuple(SET_O,      SET_TSO, std::vector({VEC_O})),         // N/A
+        std::make_tuple(SET_TS,     SET_T,   std::vector({VEC_S, VEC_TS})), // Hide sender,    opportunistic shielding
+        std::make_tuple(SET_TS,     SET_S,   std::vector({VEC_S, VEC_TS})), // Fully shielded, opportunistic shielding
+        std::make_tuple(SET_TS,     SET_O,   std::vector({VEC_S, VEC_TS})), // Hide sender,    opportunistic shielding
+        std::make_tuple(SET_TS,     SET_TS,  std::vector({VEC_S, VEC_TS})), // Hide sender,    opportunistic shielding
+        std::make_tuple(SET_TS,     SET_TO,  std::vector({VEC_S, VEC_TS})), // Hide sender,    opportunistic shielding
+        std::make_tuple(SET_TS,     SET_SO,  std::vector({VEC_S, VEC_TS})), // Hide sender,    opportunistic shielding
+        std::make_tuple(SET_TS,     SET_TSO, std::vector({VEC_S, VEC_TS})), // Hide sender,    opportunistic shielding
+        std::make_tuple(SET_TO,     SET_T,   std::vector({VEC_O, VEC_TO})), // Hide sender,    opportunistic shielding
+        std::make_tuple(SET_TO,     SET_S,   std::vector({VEC_O, VEC_TO})), // Hide sender,    opportunistic shielding
+        std::make_tuple(SET_TO,     SET_O,   std::vector({VEC_O, VEC_TO})), // Fully shielded, opportunistic shielding
+        std::make_tuple(SET_TO,     SET_TS,  std::vector({VEC_O, VEC_TO})), // Hide sender,    opportunistic shielding
+        std::make_tuple(SET_TO,     SET_TO,  std::vector({VEC_O, VEC_TO})), // Hide sender,    opportunistic shielding
+        std::make_tuple(SET_TO,     SET_SO,  std::vector({VEC_O, VEC_TO})), // Hide sender,    opportunistic shielding
+        std::make_tuple(SET_TO,     SET_TSO, std::vector({VEC_O, VEC_TO})), // Hide sender,    opportunistic shielding
+        std::make_tuple(SET_SO,     SET_T,   std::vector({VEC_O, VEC_SO})), // Fewer pools,    opportunistic migration
+        std::make_tuple(SET_SO,     SET_S,   std::vector({VEC_S, VEC_SO})), // Fully shielded
+        std::make_tuple(SET_SO,     SET_O,   std::vector({VEC_O, VEC_SO})), // Fully shielded, opportunistic migration
+        std::make_tuple(SET_SO,     SET_TS,  std::vector({VEC_S, VEC_SO})), // Fewer pools
+        std::make_tuple(SET_SO,     SET_TO,  std::vector({VEC_O, VEC_SO})), // Fewer pools,    opportunistic migration
+        std::make_tuple(SET_SO,     SET_SO,  std::vector({VEC_S, VEC_SO})), // Opportunistic migration
+        std::make_tuple(SET_SO,     SET_TSO, std::vector({VEC_S, VEC_SO})), // Opportunistic migration
+        std::make_tuple(SET_TSO,    SET_T,   std::vector({VEC_O, VEC_SO, VEC_TSO})), // Fewer pools,             hide sender, opportunistic shielding
+        std::make_tuple(SET_TSO,    SET_S,   std::vector({VEC_S, VEC_SO, VEC_TSO})), // Fully shielded,          hide sender, opportunistic shielding
+        std::make_tuple(SET_TSO,    SET_O,   std::vector({VEC_O, VEC_SO, VEC_TSO})), // Fully shielded,          hide sender, opportunistic shielding
+        std::make_tuple(SET_TSO,    SET_TS,  std::vector({VEC_S, VEC_SO, VEC_TSO})), // Fewer pools,             hide sender, opportunistic shielding
+        std::make_tuple(SET_TSO,    SET_TO,  std::vector({VEC_O, VEC_SO, VEC_TSO})), // Fewer pools,             hide sender, opportunistic shielding
+        std::make_tuple(SET_TSO,    SET_SO,  std::vector({VEC_S, VEC_SO, VEC_TSO})), // Opportunistic migration, hide sender, opportunistic shielding
+        std::make_tuple(SET_TSO,    SET_TSO, std::vector({VEC_S, VEC_SO, VEC_TSO}))  // Opportunistic migration, hide sender, opportunistic shielding
+    )
+);
diff --git a/depend/zcash/src/wallet/gtest/test_orchard_wallet.cpp b/depend/zcash/src/wallet/gtest/test_orchard_wallet.cpp
new file mode 100644
index 000000000..c07a43ec1
--- /dev/null
+++ b/depend/zcash/src/wallet/gtest/test_orchard_wallet.cpp
@@ -0,0 +1,157 @@
+#include <gmock/gmock.h>
+#include <gtest/gtest.h>
+
+#include "consensus/validation.h"
+#include "random.h"
+#include "transaction_builder.h"
+#include "utiltest.h"
+#include "wallet/orchard.h"
+#include "zcash/Address.hpp"
+
+#include "gtest/test_transaction_builder.h"
+
+#include <optional>
+
+using namespace libzcash;
+
+OrchardSpendingKey RandomOrchardSpendingKey() {
+    auto coinType = Params().BIP44CoinType() ;
+
+    auto seed = MnemonicSeed::Random(coinType);
+    return OrchardSpendingKey::ForAccount(seed, coinType, 0);
+}
+
+CTransaction FakeOrchardTx(const OrchardSpendingKey& sk, libzcash::diversifier_index_t j) {
+    CBasicKeyStore keystore;
+    CKey tsk = AddTestCKeyToKeyStore(keystore);
+    auto scriptPubKey = GetScriptForDestination(tsk.GetPubKey().GetID());
+
+    auto fvk = sk.ToFullViewingKey();
+    auto ivk = fvk.ToIncomingViewingKey();
+    auto recipient = ivk.Address(j);
+
+    TransactionBuilderCoinsViewDB fakeDB;
+    auto orchardAnchor = fakeDB.GetBestAnchor(ShieldedType::ORCHARD);
+
+    // Create a shielding transaction from transparent to Orchard
+    // 0.0005 t-ZEC in, 0.0004 z-ZEC out, default fee
+    auto builder = TransactionBuilder(Params().GetConsensus(), 1, orchardAnchor, &keystore);
+    builder.AddTransparentInput(COutPoint(uint256S("1234"), 0), scriptPubKey, 50000);
+    builder.AddOrchardOutput(std::nullopt, recipient, 40000, std::nullopt);
+
+    auto maybeTx = builder.Build();
+    EXPECT_TRUE(maybeTx.IsTx());
+    return maybeTx.GetTxOrThrow();
+}
+
+TEST(OrchardWalletTests, TxInvolvesMyNotes) {
+    auto consensusParams = RegtestActivateNU5();
+    OrchardWallet wallet;
+
+    // Add a new spending key to the wallet
+    auto sk = RandomOrchardSpendingKey();
+    wallet.AddSpendingKey(sk);
+
+    // Create a transaction sending to the default address for that
+    // spending key and add it to the wallet.
+    auto tx = FakeOrchardTx(sk, libzcash::diversifier_index_t(0));
+    wallet.AddNotesIfInvolvingMe(tx);
+
+    // Check that we detect the transaction as ours
+    EXPECT_TRUE(wallet.TxInvolvesMyNotes(tx.GetHash()));
+
+    // Create a transaction sending to a different diversified address
+    auto tx1 = FakeOrchardTx(sk, libzcash::diversifier_index_t(0xffffffffffffffff));
+    wallet.AddNotesIfInvolvingMe(tx1);
+
+    // Check that we also detect this transaction as ours
+    EXPECT_TRUE(wallet.TxInvolvesMyNotes(tx1.GetHash()));
+
+    // Now generate a new key, and send a transaction to it without adding
+    // the key to the wallet; it should not be detected as ours.
+    auto skNotOurs = RandomOrchardSpendingKey();
+    auto tx2 = FakeOrchardTx(skNotOurs, libzcash::diversifier_index_t(0));
+    wallet.AddNotesIfInvolvingMe(tx2);
+    EXPECT_FALSE(wallet.TxInvolvesMyNotes(tx2.GetHash()));
+
+    RegtestDeactivateNU5();
+}
+
+// This test is here instead of test_transaction_builder.cpp because it depends
+// on OrchardWallet, which only exists if the wallet is compiled in.
+TEST(TransactionBuilder, OrchardToOrchard) {
+    auto consensusParams = RegtestActivateNU5();
+    OrchardWallet wallet;
+
+    CBasicKeyStore keystore;
+    CKey tsk = AddTestCKeyToKeyStore(keystore);
+    auto scriptPubKey = GetScriptForDestination(tsk.GetPubKey().GetID());
+
+    auto sk = RandomOrchardSpendingKey();
+    wallet.AddSpendingKey(sk);
+
+    // Create a transaction sending to the default address for that
+    // spending key and add it to the wallet.
+    libzcash::diversifier_index_t j(0);
+    auto txRecv = FakeOrchardTx(sk, j);
+    wallet.AddNotesIfInvolvingMe(txRecv);
+
+    // Generate a recipient.
+    auto recipient = RandomOrchardSpendingKey()
+        .ToFullViewingKey()
+        .ToIncomingViewingKey()
+        .Address(j);
+
+    // Select the one note in the wallet for spending.
+    std::vector<OrchardNoteMetadata> notes;
+    wallet.GetFilteredNotes(
+        notes, sk.ToFullViewingKey().ToIncomingViewingKey(), true, true);
+    ASSERT_EQ(notes.size(), 1);
+
+    // If we attempt to get spend info now, it will fail because the note hasn't
+    // been witnessed in the Orchard commitment tree.
+    EXPECT_THROW(wallet.GetSpendInfo(notes, wallet.GetLatestAnchor()), std::logic_error);
+
+    // Append the bundle to the wallet's commitment tree.
+    CBlock fakeBlock;
+    fakeBlock.vtx.resize(2);
+    fakeBlock.vtx[1] = txRecv;
+    ASSERT_TRUE(wallet.AppendNoteCommitments(2, fakeBlock));
+
+    // Now we can get spend info for the note.
+    auto spendInfo = wallet.GetSpendInfo(notes, wallet.GetLatestAnchor());
+    EXPECT_EQ(spendInfo[0].second.Value(), 40000);
+
+    // Get the root of the commitment tree.
+    OrchardMerkleFrontier tree;
+    tree.AppendBundle(txRecv.GetOrchardBundle());
+    auto orchardAnchor = tree.root();
+
+    // Create an Orchard-only transaction
+    // 0.0004 z-ZEC in, 0.00025 z-ZEC out, default fee, 0.00005 z-ZEC change
+    auto builder = TransactionBuilder(consensusParams, 2, orchardAnchor);
+    EXPECT_TRUE(builder.AddOrchardSpend(sk, std::move(spendInfo[0].second)));
+    builder.AddOrchardOutput(std::nullopt, recipient, 25000, std::nullopt);
+    auto maybeTx = builder.Build();
+    EXPECT_TRUE(maybeTx.IsTx());
+    if (maybeTx.IsError()) {
+        std::cerr << "Failed to build transaction: " << maybeTx.GetError() << std::endl;
+        GTEST_FAIL();
+    }
+    auto tx = maybeTx.GetTxOrThrow();
+
+    EXPECT_EQ(tx.vin.size(), 0);
+    EXPECT_EQ(tx.vout.size(), 0);
+    EXPECT_EQ(tx.vJoinSplit.size(), 0);
+    EXPECT_EQ(tx.vShieldedSpend.size(), 0);
+    EXPECT_EQ(tx.vShieldedOutput.size(), 0);
+    EXPECT_TRUE(tx.GetOrchardBundle().IsPresent());
+    EXPECT_EQ(tx.GetOrchardBundle().GetValueBalance(), 10000);
+
+    CValidationState state;
+    EXPECT_TRUE(ContextualCheckTransaction(tx, state, Params(), 3, true));
+    EXPECT_EQ(state.GetRejectReason(), "");
+
+    // Revert to default
+    RegtestDeactivateNU5();
+}
diff --git a/depend/zcash/src/wallet/gtest/test_orchard_zkeys.cpp b/depend/zcash/src/wallet/gtest/test_orchard_zkeys.cpp
new file mode 100644
index 000000000..d8e910269
--- /dev/null
+++ b/depend/zcash/src/wallet/gtest/test_orchard_zkeys.cpp
@@ -0,0 +1,35 @@
+// Copyright (c) 2021 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include <gtest/gtest.h>
+
+#include "zcash/address/mnemonic.h"
+#include "zcash/address/orchard.hpp"
+
+TEST(OrchardZkeysTest, IVKSerializationRoundtrip) {
+    auto seed = MnemonicSeed::Random(1); //testnet coin type
+    auto sk = libzcash::OrchardSpendingKey::ForAccount(seed, 1, 0);
+    auto fvk = sk.ToFullViewingKey();
+    auto ivk = fvk.ToIncomingViewingKey();
+
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << ivk;
+
+    auto ivk0 = libzcash::OrchardIncomingViewingKey::Read(ss);
+
+    ASSERT_EQ(ivk, ivk0);
+}
+
+TEST(OrchardZkeysTest, FVKSerializationRoundtrip) {
+    auto seed = MnemonicSeed::Random(1); //testnet coin type
+    auto sk = libzcash::OrchardSpendingKey::ForAccount(seed, 1, 0);
+    auto fvk = sk.ToFullViewingKey();
+
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << fvk;
+
+    auto fvk0 = libzcash::OrchardFullViewingKey::Read(ss);
+
+    ASSERT_EQ(fvk, fvk0);
+}
diff --git a/depend/zcash/src/wallet/gtest/test_paymentdisclosure.cpp b/depend/zcash/src/wallet/gtest/test_paymentdisclosure.cpp
new file mode 100644
index 000000000..c60546a97
--- /dev/null
+++ b/depend/zcash/src/wallet/gtest/test_paymentdisclosure.cpp
@@ -0,0 +1,194 @@
+#include <gtest/gtest.h>
+
+#include "fs.h"
+#include "main.h"
+#include "random.h"
+#include "utilmoneystr.h"
+#include "chainparams.h"
+#include "utilstrencodings.h"
+#include "zcash/Address.hpp"
+#include "wallet/wallet.h"
+#include "amount.h"
+
+#include <array>
+#include <memory>
+#include <string>
+#include <set>
+#include <vector>
+#include <iostream>
+#include "util.h"
+
+#include "wallet/paymentdisclosure.h"
+#include "wallet/paymentdisclosuredb.h"
+
+#include <boost/uuid/uuid.hpp>
+#include <boost/uuid/uuid_generators.hpp>
+#include <boost/uuid/uuid_io.hpp>
+
+#include <rust/ed25519.h>
+
+using namespace std;
+
+/*
+    To run tests:
+    ./zcash-gtest --gtest_filter="paymentdisclosure.*"
+
+    Note: As an experimental feature, writing your own tests may require option flags to be set.
+    mapArgs["-experimentalfeatures"] = true;
+    mapArgs["-paymentdisclosure"] = true;
+*/
+
+#define NUM_TRIES 10000
+
+#define DUMP_DATABASE_TO_STDOUT false
+
+static boost::uuids::random_generator uuidgen;
+
+// Subclass of PaymentDisclosureDB to add debugging methods
+class PaymentDisclosureDBTest : public PaymentDisclosureDB {
+public:
+    PaymentDisclosureDBTest(const fs::path& dbPath) : PaymentDisclosureDB(dbPath) {}
+
+    void DebugDumpAllStdout() {
+        ASSERT_NE(db, nullptr);
+        std::lock_guard<std::mutex> guard(lock_);
+
+        // Iterate over each item in the database and print them
+        leveldb::Iterator* it = db->NewIterator(leveldb::ReadOptions());
+
+        for (it->SeekToFirst(); it->Valid(); it->Next()) {
+            cout << it->key().ToString() << " : ";
+            // << it->value().ToString() << endl;
+            try {
+                std::string strValue = it->value().ToString();
+                PaymentDisclosureInfo info;
+                CDataStream ssValue(strValue.data(), strValue.data() + strValue.size(), SER_DISK, CLIENT_VERSION);
+                ssValue >> info;
+                cout << info.ToString() << std::endl;
+            } catch (const std::exception& e) {
+                cout << e.what() << std::endl;
+            }
+        }
+
+        if (false == it->status().ok()) {
+            cerr << "An error was found iterating over the database" << endl;
+            cerr << it->status().ToString() << endl;
+        }
+
+        delete it;
+    }
+};
+
+
+
+// This test creates random payment disclosure blobs and checks that they can be
+// 1. inserted and retrieved from a database
+// 2. serialized and deserialized without corruption
+// Note that the zpd: prefix is not part of the payment disclosure blob itself.  It is only
+// used as convention to improve the user experience when sharing payment disclosure blobs.
+TEST(paymentdisclosure, mainnet) {
+    SelectParams(CBaseChainParams::MAIN);
+
+    fs::path pathTemp = fs::temp_directory_path() / fs::unique_path();
+    fs::create_directories(pathTemp);
+    mapArgs["-datadir"] = pathTemp.string();
+
+    PaymentDisclosureDBTest mydb(pathTemp);
+
+    for (int i=0; i<NUM_TRIES; i++) {
+        // Generate an ephemeral keypair for joinsplit sig.
+        Ed25519SigningKey joinSplitPrivKey;
+        Ed25519VerificationKey joinSplitPubKey;
+        ed25519_generate_keypair(&joinSplitPrivKey, &joinSplitPubKey);
+
+        // Create payment disclosure key and info data to store in test database
+        size_t js = GetRandHash().GetCheapHash() % std::numeric_limits<size_t>::max();
+        uint8_t n = GetRandHash().GetCheapHash() % std::numeric_limits<uint8_t>::max();
+        PaymentDisclosureKey key { GetRandHash(), js, n};
+        PaymentDisclosureInfo info;
+        info.esk = GetRandHash();
+        info.joinSplitPrivKey = joinSplitPrivKey;
+        info.zaddr = libzcash::SproutSpendingKey::random().address();
+        ASSERT_TRUE(mydb.Put(key, info));
+
+        // Retrieve info from test database into new local variable and test it matches
+        PaymentDisclosureInfo info2;
+        ASSERT_TRUE(mydb.Get(key, info2));
+        ASSERT_EQ(info, info2);
+
+        // Modify this local variable and confirm it no longer matches
+        info2.esk = GetRandHash();
+        GetRandBytes(info2.joinSplitPrivKey.bytes, ED25519_VERIFICATION_KEY_LEN);
+        info2.zaddr = libzcash::SproutSpendingKey::random().address();        
+        ASSERT_NE(info, info2);
+
+        // Using the payment info object, let's create a dummy payload
+        PaymentDisclosurePayload payload;
+        payload.version = PAYMENT_DISCLOSURE_VERSION_EXPERIMENTAL;
+        payload.esk = info.esk;
+        payload.txid = key.hash;
+        payload.js = key.js;
+        payload.n = key.n;
+        payload.message = "random-" + boost::uuids::to_string(uuidgen());   // random message
+        payload.zaddr = info.zaddr;
+
+        // Serialize and hash the payload to generate a signature
+        uint256 dataToBeSigned = SerializeHash(payload, SER_GETHASH, 0);
+
+        // Compute the payload signature
+        Ed25519Signature payloadSig;
+        if (!ed25519_sign(
+            &joinSplitPrivKey,
+            dataToBeSigned.begin(), 32,
+            &payloadSig))
+        {
+            throw std::runtime_error("ed25519_sign failed");
+        }
+
+        // Sanity check
+        if (!ed25519_verify(
+            &joinSplitPubKey,
+            &payloadSig,
+            dataToBeSigned.begin(), 32))
+        {
+            throw std::runtime_error("ed25519_verify failed");
+        }
+
+        // Payment disclosure blob to pass around
+        PaymentDisclosure pd = {payload, payloadSig};
+
+        // Test payment disclosure constructors
+        PaymentDisclosure pd2(payload, payloadSig);
+        ASSERT_EQ(pd, pd2);
+        PaymentDisclosure pd3(joinSplitPubKey, key, info, payload.message);
+        ASSERT_EQ(pd, pd3);
+
+        // Verify serialization and deserialization works
+        CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+        ss << pd;
+        std::string ssHexString = HexStr(ss.begin(), ss.end());
+
+        PaymentDisclosure pdTmp;
+        CDataStream ssTmp(ParseHex(ssHexString), SER_NETWORK, PROTOCOL_VERSION);
+        ssTmp >> pdTmp;
+        ASSERT_EQ(pd, pdTmp);
+
+        CDataStream ss2(SER_NETWORK, PROTOCOL_VERSION);
+        ss2 << pdTmp;
+        std::string ss2HexString = HexStr(ss2.begin(), ss2.end());
+        ASSERT_EQ(ssHexString, ss2HexString);
+
+        // Verify marker
+        ASSERT_EQ(pd.payload.marker, PAYMENT_DISCLOSURE_PAYLOAD_MAGIC_BYTES);
+        ASSERT_EQ(pdTmp.payload.marker, PAYMENT_DISCLOSURE_PAYLOAD_MAGIC_BYTES);
+        ASSERT_EQ(0, ssHexString.find("706462ff")); // Little endian encoding of PAYMENT_DISCLOSURE_PAYLOAD_MAGIC_BYTES value
+
+        // Sanity check
+        PaymentDisclosure pdDummy;
+        ASSERT_NE(pd, pdDummy);
+    }
+
+#if DUMP_DATABASE_TO_STDOUT == true
+    mydb.DebugDumpAllStdout();
+#endif
+}
diff --git a/depend/zcash/src/wallet/gtest/test_rpc_wallet.cpp b/depend/zcash/src/wallet/gtest/test_rpc_wallet.cpp
new file mode 100644
index 000000000..90517f4e2
--- /dev/null
+++ b/depend/zcash/src/wallet/gtest/test_rpc_wallet.cpp
@@ -0,0 +1,353 @@
+#include <gtest/gtest.h>
+#include <gmock/gmock.h>
+
+#include "main.h"
+#include "primitives/transaction.h"
+#include "consensus/validation.h"
+#include "transaction_builder.h"
+#include "utiltest.h"
+#include "gtest/utils.h"
+#include "wallet/asyncrpcoperation_mergetoaddress.h"
+#include "wallet/asyncrpcoperation_shieldcoinbase.h"
+#include "wallet/asyncrpcoperation_sendmany.h"
+#include "zcash/JoinSplit.hpp"
+
+#include <librustzcash.h>
+#include <rust/ed25519.h>
+
+bool find_error(const UniValue& objError, const std::string& expected) {
+    return find_value(objError, "message").get_str().find(expected) != string::npos;
+}
+
+TEST(WalletRPCTests,ZShieldCoinbaseInternals)
+{
+    LoadProofParameters();
+
+    SelectParams(CBaseChainParams::TESTNET);
+    const Consensus::Params& consensusParams = Params().GetConsensus();
+
+    // we need to use pwalletMain because of AsyncRPCOperation_shieldcoinbase
+    LoadGlobalWallet();
+    {
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    // Mutable tx containing contextual information we need to build tx
+    // We removed the ability to create pre-Sapling Sprout proofs, so we can
+    // only create Sapling-onwards transactions.
+    int nHeight = consensusParams.vUpgrades[Consensus::UPGRADE_SAPLING].nActivationHeight;
+    CMutableTransaction mtx = CreateNewContextualCMutableTransaction(consensusParams, nHeight + 1);
+
+    // Add keys manually
+    auto pa = pwalletMain->GenerateNewSproutZKey();
+
+    // Insufficient funds
+    {
+        std::vector<ShieldCoinbaseUTXO> inputs = { ShieldCoinbaseUTXO{uint256(),0,0} };
+        std::shared_ptr<AsyncRPCOperation> operation(new AsyncRPCOperation_shieldcoinbase(TransactionBuilder(), mtx, inputs, pa) );
+        operation->main();
+        EXPECT_TRUE(operation->isFailed());
+        std::string msg = operation->getErrorMessage();
+        EXPECT_TRUE(msg.find("Insufficient coinbase funds") != string::npos);
+    }
+
+    // Test the perform_joinsplit methods.
+    {
+        // Dummy input so the operation object can be instantiated.
+        std::vector<ShieldCoinbaseUTXO> inputs = { ShieldCoinbaseUTXO{uint256(),0,100000} };
+        std::shared_ptr<AsyncRPCOperation> operation(new AsyncRPCOperation_shieldcoinbase(TransactionBuilder(), mtx, inputs, pa) );
+        std::shared_ptr<AsyncRPCOperation_shieldcoinbase> ptr = std::dynamic_pointer_cast<AsyncRPCOperation_shieldcoinbase> (operation);
+        TEST_FRIEND_AsyncRPCOperation_shieldcoinbase proxy(ptr);
+        static_cast<AsyncRPCOperation_shieldcoinbase *>(operation.get())->testmode = true;
+
+        ShieldCoinbaseJSInfo info;
+        info.vjsin.push_back(JSInput());
+        info.vjsin.push_back(JSInput());
+        info.vjsin.push_back(JSInput());
+        try {
+            proxy.perform_joinsplit(info);
+        } catch (const std::runtime_error & e) {
+            EXPECT_TRUE(string(e.what()).find("unsupported joinsplit input") != string::npos);
+        }
+
+        info.vjsin.clear();
+        try {
+            proxy.perform_joinsplit(info);
+        } catch (const std::runtime_error & e) {
+            EXPECT_TRUE(string(e.what()).find("error verifying joinsplit") != string::npos);
+        }
+    }
+
+    }
+    UnloadGlobalWallet();
+}
+
+
+// TODO: test private methods
+TEST(WalletRPCTests, RPCZMergeToAddressInternals)
+{
+    LoadProofParameters();
+
+    SelectParams(CBaseChainParams::TESTNET);
+    LoadGlobalWallet();
+
+    const Consensus::Params& consensusParams = Params().GetConsensus();
+    KeyIO keyIO(Params());
+    {
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    UniValue retValue;
+
+    // Mutable tx containing contextual information we need to build tx
+    // We removed the ability to create pre-Sapling Sprout proofs, so we can
+    // only create Sapling-onwards transactions.
+    int nHeight = consensusParams.vUpgrades[Consensus::UPGRADE_SAPLING].nActivationHeight;
+    CMutableTransaction mtx = CreateNewContextualCMutableTransaction(consensusParams, nHeight + 1);
+
+    // Add keys manually
+    auto taddr = pwalletMain->GenerateNewKey(true).GetID();
+    std::string taddr_string = keyIO.EncodeDestination(taddr);
+
+    MergeToAddressRecipient taddr1(keyIO.DecodePaymentAddress(taddr_string).value(), "");
+    auto pa = pwalletMain->GenerateNewSproutZKey();
+    MergeToAddressRecipient zaddr1(pa, "DEADBEEF");
+
+    // Insufficient funds
+    {
+        std::vector<MergeToAddressInputUTXO> inputs = { MergeToAddressInputUTXO{COutPoint{uint256(),0},0, CScript()} };
+        std::shared_ptr<AsyncRPCOperation> operation(new AsyncRPCOperation_mergetoaddress(std::nullopt, mtx, inputs, {}, {}, zaddr1) );
+        operation->main();
+        EXPECT_TRUE(operation->isFailed());
+        std::string msg = operation->getErrorMessage();
+        EXPECT_TRUE(msg.find("Insufficient funds, have 0.00 and miners fee is 0.00001") != string::npos);
+    }
+
+    // get_memo_from_hex_string())
+    {
+        std::vector<MergeToAddressInputUTXO> inputs = { MergeToAddressInputUTXO{COutPoint{uint256(),0},100000, CScript()} };
+        std::shared_ptr<AsyncRPCOperation> operation(new AsyncRPCOperation_mergetoaddress(std::nullopt, mtx, inputs, {}, {}, zaddr1) );
+        std::shared_ptr<AsyncRPCOperation_mergetoaddress> ptr = std::dynamic_pointer_cast<AsyncRPCOperation_mergetoaddress> (operation);
+        TEST_FRIEND_AsyncRPCOperation_mergetoaddress proxy(ptr);
+
+        std::string memo = "DEADBEEF";
+        std::array<unsigned char, ZC_MEMO_SIZE> array = proxy.get_memo_from_hex_string(memo);
+        EXPECT_EQ(array[0], 0xDE);
+        EXPECT_EQ(array[1], 0xAD);
+        EXPECT_EQ(array[2], 0xBE);
+        EXPECT_EQ(array[3], 0xEF);
+        for (int i=4; i<ZC_MEMO_SIZE; i++) {
+            EXPECT_EQ(array[i], 0x00);  // zero padding
+        }
+
+        // memo is longer than allowed
+        std::vector<char> v (2 * (ZC_MEMO_SIZE+1));
+        std::fill(v.begin(), v.end(), 'A');
+        std::string bigmemo(v.begin(), v.end());
+
+        try {
+            proxy.get_memo_from_hex_string(bigmemo);
+            FAIL() << "Should have caused an error";
+        } catch (const UniValue& objError) {
+            EXPECT_TRUE(find_error(objError, "too big"));
+        }
+
+        // invalid hexadecimal string
+        std::fill(v.begin(), v.end(), '@'); // not a hex character
+        std::string badmemo(v.begin(), v.end());
+
+        try {
+            proxy.get_memo_from_hex_string(badmemo);
+            FAIL() << "Should have caused an error";
+        } catch (const UniValue& objError) {
+            EXPECT_TRUE(find_error(objError, "hexadecimal format"));
+        }
+
+        // odd length hexadecimal string
+        std::fill(v.begin(), v.end(), 'A');
+        v.resize(v.size() - 1);
+        assert(v.size() % 2 == 1); // odd length
+        std::string oddmemo(v.begin(), v.end());
+        try {
+            proxy.get_memo_from_hex_string(oddmemo);
+            FAIL() << "Should have caused an error";
+        } catch (const UniValue& objError) {
+            EXPECT_TRUE(find_error(objError, "hexadecimal format"));
+        }
+    }
+
+    // Test the perform_joinsplit methods.
+    {
+        // Dummy input so the operation object can be instantiated.
+        std::vector<MergeToAddressInputUTXO> inputs = { MergeToAddressInputUTXO{COutPoint{uint256(),0},100000, CScript()} };
+        std::shared_ptr<AsyncRPCOperation> operation(new AsyncRPCOperation_mergetoaddress(std::nullopt, mtx, inputs, {}, {}, zaddr1) );
+        std::shared_ptr<AsyncRPCOperation_mergetoaddress> ptr = std::dynamic_pointer_cast<AsyncRPCOperation_mergetoaddress> (operation);
+        TEST_FRIEND_AsyncRPCOperation_mergetoaddress proxy(ptr);
+
+        // Enable test mode so tx is not sent and proofs are not generated
+        static_cast<AsyncRPCOperation_mergetoaddress *>(operation.get())->testmode = true;
+
+        MergeToAddressJSInfo info;
+        std::vector<std::optional < SproutWitness>> witnesses;
+        uint256 anchor;
+        try {
+            proxy.perform_joinsplit(info, witnesses, anchor);
+            FAIL() << "Should have caused an error";
+        } catch (const std::runtime_error & e) {
+            EXPECT_TRUE(string(e.what()).find("anchor is null") != string::npos);
+        }
+
+        try {
+            std::vector<JSOutPoint> v;
+            proxy.perform_joinsplit(info, v);
+            FAIL() << "Should have caused an error";
+        } catch (const std::runtime_error & e) {
+            EXPECT_TRUE(string(e.what()).find("anchor is null") != string::npos);
+        }
+
+        info.notes.push_back(SproutNote());
+        try {
+            proxy.perform_joinsplit(info);
+            FAIL() << "Should have caused an error";
+        } catch (const std::runtime_error & e) {
+            EXPECT_TRUE(string(e.what()).find("number of notes") != string::npos);
+        }
+
+        info.notes.clear();
+        info.vjsin.push_back(JSInput());
+        info.vjsin.push_back(JSInput());
+        info.vjsin.push_back(JSInput());
+        try {
+            proxy.perform_joinsplit(info);
+            FAIL() << "Should have caused an error";
+        } catch (const std::runtime_error & e) {
+            EXPECT_TRUE(string(e.what()).find("unsupported joinsplit input") != string::npos);
+        }
+
+        info.vjsin.clear();
+        try {
+            proxy.perform_joinsplit(info);
+            FAIL() << "Should have caused an error";
+        } catch (const std::runtime_error & e) {
+            EXPECT_TRUE(string(e.what()).find("error verifying joinsplit") != string::npos);
+        }
+    }
+    }
+    UnloadGlobalWallet();
+}
+
+TEST(WalletRPCTests, RPCZsendmanyTaddrToSapling)
+{
+    LoadProofParameters();
+    SelectParams(CBaseChainParams::TESTNET);
+
+    LoadGlobalWallet();
+
+    RegtestActivateSapling();
+    {
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    if (!pwalletMain->HaveMnemonicSeed()) {
+        pwalletMain->GenerateNewSeed();
+    }
+
+    UniValue retValue;
+
+    KeyIO keyIO(Params());
+    // add keys manually
+    auto taddr = pwalletMain->GenerateNewKey(true).GetID();
+    auto pa = pwalletMain->GenerateNewLegacySaplingZKey();
+
+    const Consensus::Params& consensusParams = Params().GetConsensus();
+
+    int nextBlockHeight = chainActive.Height() + 1;
+
+    // Add a fake transaction to the wallet
+    CMutableTransaction mtx = CreateNewContextualCMutableTransaction(consensusParams, nextBlockHeight);
+    CScript scriptPubKey = CScript() << OP_DUP << OP_HASH160 << ToByteVector(taddr) << OP_EQUALVERIFY << OP_CHECKSIG;
+    mtx.vout.push_back(CTxOut(5 * COIN, scriptPubKey));
+    CWalletTx wtx(pwalletMain, mtx);
+    pwalletMain->LoadWalletTx(wtx);
+
+    // Fake-mine the transaction
+    EXPECT_EQ(-1, chainActive.Height());
+    CBlock block;
+    block.vtx.push_back(wtx);
+    block.hashMerkleRoot = block.BuildMerkleTree();
+    auto blockHash = block.GetHash();
+    CBlockIndex fakeIndex {block};
+    mapBlockIndex.insert(std::make_pair(blockHash, &fakeIndex));
+    chainActive.SetTip(&fakeIndex);
+    EXPECT_TRUE(chainActive.Contains(&fakeIndex));
+    EXPECT_EQ(0, chainActive.Height());
+    wtx.SetMerkleBranch(block);
+    pwalletMain->LoadWalletTx(wtx);
+
+    // Context that z_sendmany requires
+    auto builder = TransactionBuilder(consensusParams, nextBlockHeight, std::nullopt, pwalletMain);
+    mtx = CreateNewContextualCMutableTransaction(consensusParams, nextBlockHeight);
+
+    auto selector = pwalletMain->ZTXOSelectorForAddress(taddr, true, false).value();
+    std::vector<SendManyRecipient> recipients = { SendManyRecipient(std::nullopt, pa, 1*COIN, "ABCD") };
+    TransactionStrategy strategy(PrivacyPolicy::AllowRevealedSenders);
+    std::shared_ptr<AsyncRPCOperation> operation(new AsyncRPCOperation_sendmany(std::move(builder), selector, recipients, 0, 0, strategy));
+    std::shared_ptr<AsyncRPCOperation_sendmany> ptr = std::dynamic_pointer_cast<AsyncRPCOperation_sendmany> (operation);
+
+    // Enable test mode so tx is not sent
+    static_cast<AsyncRPCOperation_sendmany *>(operation.get())->testmode = true;
+
+    // Generate the Sapling shielding transaction
+    operation->main();
+    if (!operation->isSuccess()) {
+        FAIL() << operation->getErrorMessage();
+    }
+
+    // Get the transaction
+    auto result = operation->getResult();
+    ASSERT_TRUE(result.isObject());
+    auto hexTx = result["hex"].getValStr();
+    CDataStream ss(ParseHex(hexTx), SER_NETWORK, PROTOCOL_VERSION);
+    CTransaction tx;
+    ss >> tx;
+    ASSERT_FALSE(tx.vShieldedOutput.empty());
+
+    // We shouldn't be able to decrypt with the empty ovk
+    EXPECT_FALSE(AttemptSaplingOutDecryption(
+        tx.vShieldedOutput[0].outCiphertext,
+        uint256(),
+        tx.vShieldedOutput[0].cv,
+        tx.vShieldedOutput[0].cmu,
+        tx.vShieldedOutput[0].ephemeralKey));
+
+    // We shouldn't be able to decrypt with a random ovk
+    EXPECT_FALSE(AttemptSaplingOutDecryption(
+        tx.vShieldedOutput[0].outCiphertext,
+        random_uint256(),
+        tx.vShieldedOutput[0].cv,
+        tx.vShieldedOutput[0].cmu,
+        tx.vShieldedOutput[0].ephemeralKey));
+
+    auto accountKey = pwalletMain->GetLegacyAccountKey().ToAccountPubKey();
+    auto ovks = accountKey.GetOVKsForShielding();
+    // We should not be able to decrypt with the internal change OVK for shielding
+    EXPECT_FALSE(AttemptSaplingOutDecryption(
+        tx.vShieldedOutput[0].outCiphertext,
+        ovks.first,
+        tx.vShieldedOutput[0].cv,
+        tx.vShieldedOutput[0].cmu,
+        tx.vShieldedOutput[0].ephemeralKey));
+    // We should be able to decrypt with the external OVK for shielding
+    EXPECT_TRUE(AttemptSaplingOutDecryption(
+        tx.vShieldedOutput[0].outCiphertext,
+        ovks.second,
+        tx.vShieldedOutput[0].cv,
+        tx.vShieldedOutput[0].cmu,
+        tx.vShieldedOutput[0].ephemeralKey));
+
+    // Tear down
+    chainActive.SetTip(NULL);
+    mapBlockIndex.erase(blockHash);
+
+    }
+    // Revert to default
+    RegtestDeactivateSapling();
+    UnloadGlobalWallet();
+}
diff --git a/depend/zcash/src/wallet/gtest/test_wallet.cpp b/depend/zcash/src/wallet/gtest/test_wallet.cpp
new file mode 100644
index 000000000..857345ee7
--- /dev/null
+++ b/depend/zcash/src/wallet/gtest/test_wallet.cpp
@@ -0,0 +1,2505 @@
+#include <gmock/gmock.h>
+#include <gtest/gtest.h>
+
+#include "base58.h"
+#include "chainparams.h"
+#include "fs.h"
+#include "key_io.h"
+#include "main.h"
+#include "primitives/block.h"
+#include "random.h"
+#include "transaction_builder.h"
+#include "gtest/utils.h"
+#include "utiltest.h"
+#include "wallet/wallet.h"
+#include "zcash/JoinSplit.hpp"
+#include "zcash/Note.hpp"
+#include "zcash/NoteEncryption.hpp"
+
+#include <rust/test_harness.h>
+
+#include <optional>
+
+using ::testing::Return;
+using namespace libzcash;
+
+ACTION(ThrowLogicError) {
+    throw std::logic_error("Boom");
+}
+
+class MockWalletDB {
+public:
+    MOCK_METHOD0(TxnBegin, bool());
+    MOCK_METHOD0(TxnCommit, bool());
+    MOCK_METHOD0(TxnAbort, bool());
+
+    MOCK_METHOD1(WriteTx, bool(const CWalletTx& wtx));
+    MOCK_METHOD1(WriteOrchardWitnesses, bool(const OrchardWallet& wallet));
+    MOCK_METHOD1(WriteWitnessCacheSize, bool(int64_t nWitnessCacheSize));
+    MOCK_METHOD1(WriteBestBlock, bool(const CBlockLocator& loc));
+};
+
+template void CWallet::SetBestChainINTERNAL<MockWalletDB>(
+        MockWalletDB& walletdb, const CBlockLocator& loc);
+
+class TestWallet : public CWallet {
+public:
+    TestWallet(const CChainParams& params) : CWallet(params) { }
+
+    OrchardWallet& GetOrchardWallet() {
+        return orchardWallet;
+    }
+
+    bool EncryptKeys(CKeyingMaterial& vMasterKeyIn) {
+        return CCryptoKeyStore::EncryptKeys(vMasterKeyIn);
+    }
+
+    bool Unlock(const CKeyingMaterial& vMasterKeyIn) {
+        return CCryptoKeyStore::Unlock(vMasterKeyIn);
+    }
+
+    void IncrementNoteWitnesses(const Consensus::Params& consensus,
+                                const CBlockIndex* pindex,
+                                const CBlock* pblock,
+                                MerkleFrontiers& frontiers,
+                                bool performOrchardWalletUpdates) {
+        CWallet::IncrementNoteWitnesses(
+                consensus, pindex, pblock, frontiers, performOrchardWalletUpdates);
+    }
+
+
+    void DecrementNoteWitnesses(const Consensus::Params& consensus, const CBlockIndex* pindex) {
+        CWallet::DecrementNoteWitnesses(consensus, pindex);
+    }
+    void SetBestChain(MockWalletDB& walletdb, const CBlockLocator& loc) {
+        CWallet::SetBestChainINTERNAL(walletdb, loc);
+    }
+    bool UpdatedNoteData(const CWalletTx& wtxIn, CWalletTx& wtx) {
+        return CWallet::UpdatedNoteData(wtxIn, wtx);
+    }
+    void MarkAffectedTransactionsDirty(const CTransaction& tx) {
+        CWallet::MarkAffectedTransactionsDirty(tx);
+    }
+};
+
+std::vector<SaplingOutPoint> SetSaplingNoteData(CWalletTx& wtx) {
+    mapSaplingNoteData_t saplingNoteData;
+    SaplingOutPoint saplingOutPoint = {wtx.GetHash(), 0};
+    SaplingNoteData saplingNd;
+    saplingNoteData[saplingOutPoint] = saplingNd;
+    wtx.SetSaplingNoteData(saplingNoteData);
+    std::vector<SaplingOutPoint> saplingNotes {saplingOutPoint};
+    return saplingNotes;
+}
+
+std::pair<JSOutPoint, SaplingOutPoint> CreateValidBlock(TestWallet& wallet,
+                            const libzcash::SproutSpendingKey& sk,
+                            const CBlockIndex& index,
+                            CBlock& block,
+                            MerkleFrontiers& frontiers) {
+    auto wtx = GetValidSproutReceive(sk, 50, true);
+    auto note = GetSproutNote(sk, wtx, 0, 1);
+    auto nullifier = note.nullifier(sk);
+
+    mapSproutNoteData_t noteData;
+    JSOutPoint jsoutpt {wtx.GetHash(), 0, 1};
+    SproutNoteData nd {sk.address(), nullifier};
+    noteData[jsoutpt] = nd;
+    wtx.SetSproutNoteData(noteData);
+    auto saplingNotes = SetSaplingNoteData(wtx);
+    wallet.LoadWalletTx(wtx);
+
+    block.vtx.push_back(wtx);
+    wallet.IncrementNoteWitnesses(Params().GetConsensus(), &index, &block, frontiers, true);
+
+    return std::make_pair(jsoutpt, saplingNotes[0]);
+}
+
+std::pair<uint256, uint256> GetWitnessesAndAnchors(
+                                const TestWallet& wallet,
+                                const std::vector<JSOutPoint>& sproutNotes,
+                                const std::vector<SaplingOutPoint>& saplingNotes,
+                                const unsigned int anchorDepth,
+                                std::vector<std::optional<SproutWitness>>& sproutWitnesses,
+                                std::vector<std::optional<SaplingWitness>>& saplingWitnesses) {
+    sproutWitnesses.clear();
+    saplingWitnesses.clear();
+    uint256 sproutAnchor;
+    uint256 saplingAnchor;
+    assert(wallet.GetSproutNoteWitnesses(sproutNotes, anchorDepth, sproutWitnesses, sproutAnchor));
+    assert(wallet.GetSaplingNoteWitnesses(saplingNotes, anchorDepth, saplingWitnesses, saplingAnchor));
+    return std::make_pair(sproutAnchor, saplingAnchor);
+}
+
+TEST(WalletTests, SetupDatadirLocationRunAsFirstTest) {
+    // Get temporary and unique path for file.
+    fs::path pathTemp = fs::temp_directory_path() / fs::unique_path();
+    fs::create_directories(pathTemp);
+    mapArgs["-datadir"] = pathTemp.string();
+}
+
+TEST(WalletTests, WalletNetworkSerialization) {
+    SelectParams(CBaseChainParams::TESTNET);
+
+    // Get temporary and unique path for file.
+    // Note: / operator to append paths
+    fs::path pathTemp = fs::temp_directory_path() / fs::unique_path();
+    fs::create_directories(pathTemp);
+    mapArgs["-datadir"] = pathTemp.string();
+
+    // create a new testnet wallet and generate a seed
+    CWallet wallet(Params(), "wallet.dat");
+    wallet.InitLoadWallet(Params(), true);
+    wallet.Flush();
+
+    // Stay on TESTNET, make sure wallet can be successfully loaded.
+    {
+        CWallet restored(Params(), "wallet.dat");
+        bool fFirstRunRet;
+        EXPECT_EQ(restored.LoadWallet(fFirstRunRet), DB_LOAD_OK);
+    }
+
+    // now, switch to mainnet and attempt to restore the wallet
+    // using the same wallet.dat
+    SelectParams(CBaseChainParams::MAIN);
+    CWallet restored(Params(), "wallet.dat");
+
+    // load should fail due to being associated with the wrong network
+    bool fFirstRunRet;
+    EXPECT_EQ(restored.LoadWallet(fFirstRunRet), DB_WRONG_NETWORK);
+}
+
+TEST(WalletTests, SproutNoteDataSerialisation) {
+    auto sk = libzcash::SproutSpendingKey::random();
+    auto wtx = GetValidSproutReceive(sk, 10, true);
+    auto note = GetSproutNote(sk, wtx, 0, 1);
+    auto nullifier = note.nullifier(sk);
+
+    mapSproutNoteData_t noteData;
+    JSOutPoint jsoutpt {wtx.GetHash(), 0, 1};
+    SproutNoteData nd {sk.address(), nullifier};
+    SproutMerkleTree tree;
+    nd.witnesses.push_front(tree.witness());
+    noteData[jsoutpt] = nd;
+
+    CDataStream ss(SER_DISK, CLIENT_VERSION);
+    auto os = WithVersion(&ss, SAPLING_TX_VERSION | 1 << 31);
+    os << noteData;
+
+    mapSproutNoteData_t noteData2;
+    os >> noteData2;
+
+    EXPECT_EQ(noteData, noteData2);
+    EXPECT_EQ(noteData[jsoutpt].witnesses, noteData2[jsoutpt].witnesses);
+}
+
+TEST(WalletTests, FindUnspentSproutNotes) {
+    SelectParams(CBaseChainParams::TESTNET);
+
+    CWallet wallet(Params());
+    LOCK2(cs_main, wallet.cs_wallet);
+
+    auto sk = libzcash::SproutSpendingKey::random();
+    wallet.AddSproutSpendingKey(sk);
+
+    auto wtx = GetValidSproutReceive(sk, 10, true);
+    auto note = GetSproutNote(sk, wtx, 0, 1);
+    auto nullifier = note.nullifier(sk);
+
+    mapSproutNoteData_t noteData;
+    JSOutPoint jsoutpt {wtx.GetHash(), 0, 1};
+    SproutNoteData nd {sk.address(), nullifier};
+    noteData[jsoutpt] = nd;
+
+    wtx.SetSproutNoteData(noteData);
+    wallet.LoadWalletTx(wtx);
+    EXPECT_FALSE(wallet.IsSproutSpent(nullifier));
+
+    // We currently have an unspent and unconfirmed note in the wallet (depth of -1)
+    std::vector<SproutNoteEntry> sproutEntries;
+    std::vector<SaplingNoteEntry> saplingEntries;
+    std::vector<OrchardNoteMetadata> orchardEntries;
+    wallet.GetFilteredNotes(sproutEntries, saplingEntries, orchardEntries, std::nullopt, 0);
+    EXPECT_EQ(0, sproutEntries.size());
+    sproutEntries.clear();
+    saplingEntries.clear();
+    orchardEntries.clear();
+    wallet.GetFilteredNotes(sproutEntries, saplingEntries, orchardEntries, std::nullopt, -1);
+    EXPECT_EQ(1, sproutEntries.size());
+    sproutEntries.clear();
+    saplingEntries.clear();
+
+    // Fake-mine the transaction
+    EXPECT_EQ(-1, chainActive.Height());
+    CBlock block;
+    block.vtx.push_back(wtx);
+    block.hashMerkleRoot = block.BuildMerkleTree();
+    auto blockHash = block.GetHash();
+    CBlockIndex fakeIndex {block};
+    mapBlockIndex.insert(std::make_pair(blockHash, &fakeIndex));
+    chainActive.SetTip(&fakeIndex);
+    EXPECT_TRUE(chainActive.Contains(&fakeIndex));
+    EXPECT_EQ(0, chainActive.Height());
+
+    wtx.SetMerkleBranch(block);
+    wallet.LoadWalletTx(wtx);
+    EXPECT_FALSE(wallet.IsSproutSpent(nullifier));
+
+
+    // We now have an unspent and confirmed note in the wallet (depth of 1)
+    wallet.GetFilteredNotes(sproutEntries, saplingEntries, orchardEntries, std::nullopt, 0);
+    EXPECT_EQ(1, sproutEntries.size());
+    sproutEntries.clear();
+    saplingEntries.clear();
+    orchardEntries.clear();
+    wallet.GetFilteredNotes(sproutEntries, saplingEntries, orchardEntries, std::nullopt, 1);
+    EXPECT_EQ(1, sproutEntries.size());
+    sproutEntries.clear();
+    saplingEntries.clear();
+    orchardEntries.clear();
+    wallet.GetFilteredNotes(sproutEntries, saplingEntries, orchardEntries, std::nullopt, 2);
+    EXPECT_EQ(0, sproutEntries.size());
+    sproutEntries.clear();
+    saplingEntries.clear();
+    orchardEntries.clear();
+
+
+    // Let's spend the note.
+    auto wtx2 = GetValidSproutSpend(sk, note, 5);
+    wallet.LoadWalletTx(wtx2);
+    EXPECT_FALSE(wallet.IsSproutSpent(nullifier));
+
+    // Fake-mine a spend transaction
+    EXPECT_EQ(0, chainActive.Height());
+    CBlock block2;
+    block2.vtx.push_back(wtx2);
+    block2.hashMerkleRoot = block2.BuildMerkleTree();
+    block2.hashPrevBlock = blockHash;
+    auto blockHash2 = block2.GetHash();
+    CBlockIndex fakeIndex2 {block2};
+    mapBlockIndex.insert(std::make_pair(blockHash2, &fakeIndex2));
+    fakeIndex2.nHeight = 1;
+    chainActive.SetTip(&fakeIndex2);
+    EXPECT_TRUE(chainActive.Contains(&fakeIndex2));
+    EXPECT_EQ(1, chainActive.Height());
+
+    wtx2.SetMerkleBranch(block2);
+    wallet.LoadWalletTx(wtx2);
+    EXPECT_TRUE(wallet.IsSproutSpent(nullifier));
+
+    // The note has been spent.  By default, GetFilteredNotes() ignores spent notes.
+    wallet.GetFilteredNotes(sproutEntries, saplingEntries, orchardEntries, std::nullopt, 0);
+    EXPECT_EQ(0, sproutEntries.size());
+    sproutEntries.clear();
+    saplingEntries.clear();
+    orchardEntries.clear();
+    // Let's include spent notes to retrieve it.
+    wallet.GetFilteredNotes(sproutEntries, saplingEntries, orchardEntries, std::nullopt, 0, INT_MAX, false);
+    EXPECT_EQ(1, sproutEntries.size());
+    sproutEntries.clear();
+    saplingEntries.clear();
+    orchardEntries.clear();
+    // The spent note has two confirmations.
+    wallet.GetFilteredNotes(sproutEntries, saplingEntries, orchardEntries, std::nullopt, 2, INT_MAX, false);
+    EXPECT_EQ(1, sproutEntries.size());
+    sproutEntries.clear();
+    saplingEntries.clear();
+    orchardEntries.clear();
+    // It does not have 3 confirmations.
+    wallet.GetFilteredNotes(sproutEntries, saplingEntries, orchardEntries, std::nullopt, 3, INT_MAX, false);
+    EXPECT_EQ(0, sproutEntries.size());
+    sproutEntries.clear();
+    saplingEntries.clear();
+    orchardEntries.clear();
+
+
+    // Let's receive a new note
+    CWalletTx wtx3;
+    {
+        auto wtx = GetValidSproutReceive(sk, 20, true);
+        auto note = GetSproutNote(sk, wtx, 0, 1);
+        auto nullifier = note.nullifier(sk);
+
+        mapSproutNoteData_t noteData;
+        JSOutPoint jsoutpt {wtx.GetHash(), 0, 1};
+        SproutNoteData nd {sk.address(), nullifier};
+        noteData[jsoutpt] = nd;
+
+        wtx.SetSproutNoteData(noteData);
+        wallet.LoadWalletTx(wtx);
+        EXPECT_FALSE(wallet.IsSproutSpent(nullifier));
+
+        wtx3 = wtx;
+    }
+
+    // Fake-mine the new transaction
+    EXPECT_EQ(1, chainActive.Height());
+    CBlock block3;
+    block3.vtx.push_back(wtx3);
+    block3.hashMerkleRoot = block3.BuildMerkleTree();
+    block3.hashPrevBlock = blockHash2;
+    auto blockHash3 = block3.GetHash();
+    CBlockIndex fakeIndex3 {block3};
+    mapBlockIndex.insert(std::make_pair(blockHash3, &fakeIndex3));
+    fakeIndex3.nHeight = 2;
+    chainActive.SetTip(&fakeIndex3);
+    EXPECT_TRUE(chainActive.Contains(&fakeIndex3));
+    EXPECT_EQ(2, chainActive.Height());
+
+    wtx3.SetMerkleBranch(block3);
+    wallet.LoadWalletTx(wtx3);
+
+    // We now have an unspent note which has one confirmation, in addition to our spent note.
+    wallet.GetFilteredNotes(sproutEntries, saplingEntries, orchardEntries, std::nullopt, 1);
+    EXPECT_EQ(1, sproutEntries.size());
+    sproutEntries.clear();
+    saplingEntries.clear();
+    orchardEntries.clear();
+    // Let's return the spent note too.
+    wallet.GetFilteredNotes(sproutEntries, saplingEntries, orchardEntries, std::nullopt, 1, INT_MAX, false);
+    EXPECT_EQ(2, sproutEntries.size());
+    sproutEntries.clear();
+    saplingEntries.clear();
+    orchardEntries.clear();
+    // Increasing number of confirmations will exclude our new unspent note.
+    wallet.GetFilteredNotes(sproutEntries, saplingEntries, orchardEntries, std::nullopt, 2, INT_MAX, false);
+    EXPECT_EQ(1, sproutEntries.size());
+    sproutEntries.clear();
+    saplingEntries.clear();
+    orchardEntries.clear();
+    // If we also ignore spent notes at this depth, we won't find any notes.
+    wallet.GetFilteredNotes(sproutEntries, saplingEntries, orchardEntries, std::nullopt, 2, INT_MAX, true);
+    EXPECT_EQ(0, sproutEntries.size());
+    sproutEntries.clear();
+    saplingEntries.clear();
+    orchardEntries.clear();
+
+    // Tear down
+    chainActive.SetTip(NULL);
+    mapBlockIndex.erase(blockHash);
+    mapBlockIndex.erase(blockHash2);
+    mapBlockIndex.erase(blockHash3);
+}
+
+
+TEST(WalletTests, SetSproutNoteAddrsInCWalletTx) {
+    auto sk = libzcash::SproutSpendingKey::random();
+    auto wtx = GetValidSproutReceive(sk, 10, true);
+    auto note = GetSproutNote(sk, wtx, 0, 1);
+    auto nullifier = note.nullifier(sk);
+    EXPECT_EQ(0, wtx.mapSproutNoteData.size());
+
+    mapSproutNoteData_t noteData;
+    JSOutPoint jsoutpt {wtx.GetHash(), 0, 1};
+    SproutNoteData nd {sk.address(), nullifier};
+    noteData[jsoutpt] = nd;
+
+    wtx.SetSproutNoteData(noteData);
+    EXPECT_EQ(noteData, wtx.mapSproutNoteData);
+}
+
+TEST(WalletTests, SetSaplingNoteAddrsInCWalletTx) {
+    LoadProofParameters();
+
+    std::vector<libzcash::Zip212Enabled> zip_212_enabled = {libzcash::Zip212Enabled::BeforeZip212, libzcash::Zip212Enabled::AfterZip212};
+    const Consensus::Params& (*activations [])() = {RegtestActivateSapling, RegtestActivateCanopy};
+    void (*deactivations [])() = {RegtestDeactivateSapling, RegtestDeactivateCanopy};
+
+    for (int ver = 0; ver < zip_212_enabled.size(); ver++) {
+        auto consensusParams = (*activations[ver])();
+
+        TestWallet wallet(Params());
+        LOCK(wallet.cs_wallet);
+
+        auto sk = GetTestMasterSaplingSpendingKey();
+        auto expsk = sk.expsk;
+        auto fvk = expsk.full_viewing_key();
+        auto ivk = fvk.in_viewing_key();
+        auto pk = sk.ToXFVK().DefaultAddress();
+
+        libzcash::SaplingNote note(pk, 50000, zip_212_enabled[ver]);
+        auto cm = note.cmu().value();
+        SaplingMerkleTree tree;
+        tree.append(cm);
+        auto anchor = tree.root();
+        auto witness = tree.witness();
+
+        auto nf = note.nullifier(fvk, witness.position());
+        ASSERT_TRUE(nf);
+        uint256 nullifier = nf.value();
+
+        auto builder = TransactionBuilder(consensusParams, 1, std::nullopt);
+        builder.AddSaplingSpend(expsk, note, anchor, witness);
+        builder.AddSaplingOutput(fvk.ovk, pk, 50000, {});
+        builder.SetFee(0);
+        auto tx = builder.Build().GetTxOrThrow();
+
+        CWalletTx wtx {&wallet, tx};
+
+        EXPECT_EQ(0, wtx.mapSaplingNoteData.size());
+        mapSaplingNoteData_t noteData;
+
+        SaplingOutPoint op {wtx.GetHash(), 0};
+        SaplingNoteData nd;
+        nd.nullifier = nullifier;
+        nd.ivk = ivk;
+        nd.witnesses.push_front(witness);
+        nd.witnessHeight = 123;
+        noteData.insert(std::make_pair(op, nd));
+
+        wtx.SetSaplingNoteData(noteData);
+        EXPECT_EQ(noteData, wtx.mapSaplingNoteData);
+
+        // Test individual fields in case equality operator is defined/changed.
+        EXPECT_EQ(ivk, wtx.mapSaplingNoteData[op].ivk);
+        EXPECT_EQ(nullifier, wtx.mapSaplingNoteData[op].nullifier);
+        EXPECT_EQ(nd.witnessHeight, wtx.mapSaplingNoteData[op].witnessHeight);
+        EXPECT_TRUE(witness == wtx.mapSaplingNoteData[op].witnesses.front());
+
+        (*deactivations[ver])();
+    }
+}
+
+TEST(WalletTests, SetSproutInvalidNoteAddrsInCWalletTx) {
+    CWalletTx wtx;
+    EXPECT_EQ(0, wtx.mapSproutNoteData.size());
+
+    mapSproutNoteData_t noteData;
+    auto sk = libzcash::SproutSpendingKey::random();
+    JSOutPoint jsoutpt {wtx.GetHash(), 0, 1};
+    SproutNoteData nd {sk.address(), uint256()};
+    noteData[jsoutpt] = nd;
+
+    EXPECT_THROW(wtx.SetSproutNoteData(noteData), std::logic_error);
+}
+
+// The following test is the same as SetInvalidSaplingNoteDataInCWalletTx
+// TEST(WalletTests, SetSaplingInvalidNoteAddrsInCWalletTx)
+
+// Cannot add note data for an index which does not exist in tx.vShieldedOutput
+TEST(WalletTests, SetInvalidSaplingNoteDataInCWalletTx) {
+    CWalletTx wtx;
+    EXPECT_EQ(0, wtx.mapSaplingNoteData.size());
+
+    mapSaplingNoteData_t noteData;
+    SaplingOutPoint op {uint256(), 1};
+    SaplingNoteData nd;
+    noteData.insert(std::make_pair(op, nd));
+
+    EXPECT_THROW(wtx.SetSaplingNoteData(noteData), std::logic_error);
+}
+
+TEST(WalletTests, CheckSproutNoteCommitmentAgainstNotePlaintext) {
+    SelectParams(CBaseChainParams::REGTEST);
+    CWallet wallet(Params());
+    LOCK(wallet.cs_wallet);
+
+    auto sk = libzcash::SproutSpendingKey::random();
+    auto address = sk.address();
+    auto dec = ZCNoteDecryption(sk.receiving_key());
+
+    auto wtx = GetInvalidCommitmentSproutReceive(sk, 10, true);
+    auto note = GetSproutNote(sk, wtx, 0, 1);
+    auto nullifier = note.nullifier(sk);
+
+    auto hSig = ZCJoinSplit::h_sig(
+        wtx.vJoinSplit[0].randomSeed,
+        wtx.vJoinSplit[0].nullifiers,
+        wtx.joinSplitPubKey);
+
+    ASSERT_THROW(wallet.GetSproutNoteNullifier(
+        wtx.vJoinSplit[0],
+        address,
+        dec,
+        hSig, 1), libzcash::note_decryption_failed);
+}
+
+TEST(WalletTests, GetSproutNoteNullifier) {
+    SelectParams(CBaseChainParams::REGTEST);
+    CWallet wallet(Params());
+    LOCK(wallet.cs_wallet);
+
+    auto sk = libzcash::SproutSpendingKey::random();
+    auto address = sk.address();
+    auto dec = ZCNoteDecryption(sk.receiving_key());
+
+    auto wtx = GetValidSproutReceive(sk, 10, true);
+    auto note = GetSproutNote(sk, wtx, 0, 1);
+    auto nullifier = note.nullifier(sk);
+
+    auto hSig = ZCJoinSplit::h_sig(
+        wtx.vJoinSplit[0].randomSeed,
+        wtx.vJoinSplit[0].nullifiers,
+        wtx.joinSplitPubKey);
+
+    auto ret = wallet.GetSproutNoteNullifier(
+        wtx.vJoinSplit[0],
+        address,
+        dec,
+        hSig, 1);
+    EXPECT_NE(nullifier, ret);
+
+    wallet.AddSproutSpendingKey(sk);
+
+    ret = wallet.GetSproutNoteNullifier(
+        wtx.vJoinSplit[0],
+        address,
+        dec,
+        hSig, 1);
+    EXPECT_EQ(nullifier, ret);
+}
+
+TEST(WalletTests, FindMySaplingNotes) {
+    LoadProofParameters();
+
+    auto consensusParams = RegtestActivateSapling();
+    TestWallet wallet(Params());
+    LOCK(wallet.cs_wallet);
+
+    // Generate dummy Sapling address
+    auto sk = GetTestMasterSaplingSpendingKey();
+    auto expsk = sk.expsk;
+    auto extfvk = sk.ToXFVK();
+    auto pa = extfvk.DefaultAddress();
+
+    auto testNote = GetTestSaplingNote(pa, 50000);
+
+    // Generate transaction
+    auto builder = TransactionBuilder(consensusParams, 1, std::nullopt);
+    builder.AddSaplingSpend(expsk, testNote.note, testNote.tree.root(), testNote.tree.witness());
+    builder.AddSaplingOutput(extfvk.fvk.ovk, pa, 25000, {});
+    auto tx = builder.Build().GetTxOrThrow();
+
+    // No Sapling notes can be found in tx which does not belong to the wallet
+    CWalletTx wtx {&wallet, tx};
+    ASSERT_FALSE(wallet.HaveSaplingSpendingKey(extfvk));
+    auto noteMap = wallet.FindMySaplingNotes(wtx, 1).first;
+    EXPECT_EQ(0, noteMap.size());
+
+    // Add spending key to wallet, so Sapling notes can be found
+    ASSERT_TRUE(wallet.AddSaplingZKey(sk));
+    ASSERT_TRUE(wallet.HaveSaplingSpendingKey(extfvk));
+    noteMap = wallet.FindMySaplingNotes(wtx, 1).first;
+    EXPECT_EQ(2, noteMap.size());
+
+    // Revert to default
+    RegtestDeactivateSapling();
+}
+
+TEST(WalletTests, FindMySproutNotes) {
+    SelectParams(CBaseChainParams::REGTEST);
+    CWallet wallet(Params());
+    LOCK(wallet.cs_wallet);
+
+    auto sk = libzcash::SproutSpendingKey::random();
+    auto sk2 = libzcash::SproutSpendingKey::random();
+    wallet.AddSproutSpendingKey(sk2);
+
+    auto wtx = GetValidSproutReceive(sk, 10, true);
+    auto note = GetSproutNote(sk, wtx, 0, 1);
+    auto nullifier = note.nullifier(sk);
+
+    auto noteMap = wallet.FindMySproutNotes(wtx);
+    EXPECT_EQ(0, noteMap.size());
+
+    wallet.AddSproutSpendingKey(sk);
+
+    noteMap = wallet.FindMySproutNotes(wtx);
+    EXPECT_EQ(2, noteMap.size());
+
+    JSOutPoint jsoutpt {wtx.GetHash(), 0, 1};
+    SproutNoteData nd {sk.address(), nullifier};
+    EXPECT_EQ(1, noteMap.count(jsoutpt));
+    EXPECT_EQ(nd, noteMap[jsoutpt]);
+}
+
+TEST(WalletTests, FindMySproutNotesInEncryptedWallet) {
+    SelectParams(CBaseChainParams::REGTEST);
+    TestWallet wallet(Params());
+    LOCK(wallet.cs_wallet);
+
+    uint256 r {GetRandHash()};
+    CKeyingMaterial vMasterKey (r.begin(), r.end());
+
+    auto sk = libzcash::SproutSpendingKey::random();
+    wallet.AddSproutSpendingKey(sk);
+
+    ASSERT_TRUE(wallet.EncryptKeys(vMasterKey));
+
+    auto wtx = GetValidSproutReceive(sk, 10, true);
+    auto note = GetSproutNote(sk, wtx, 0, 1);
+    auto nullifier = note.nullifier(sk);
+
+    auto noteMap = wallet.FindMySproutNotes(wtx);
+    EXPECT_EQ(2, noteMap.size());
+
+    JSOutPoint jsoutpt {wtx.GetHash(), 0, 1};
+    SproutNoteData nd {sk.address(), nullifier};
+    EXPECT_EQ(1, noteMap.count(jsoutpt));
+    EXPECT_NE(nd, noteMap[jsoutpt]);
+
+    ASSERT_TRUE(wallet.Unlock(vMasterKey));
+
+    noteMap = wallet.FindMySproutNotes(wtx);
+    EXPECT_EQ(2, noteMap.size());
+    EXPECT_EQ(1, noteMap.count(jsoutpt));
+    EXPECT_EQ(nd, noteMap[jsoutpt]);
+}
+
+TEST(WalletTests, GetConflictedSproutNotes) {
+    SelectParams(CBaseChainParams::REGTEST);
+    CWallet wallet(Params());
+    LOCK(wallet.cs_wallet);
+
+    auto sk = libzcash::SproutSpendingKey::random();
+    wallet.AddSproutSpendingKey(sk);
+
+    auto wtx = GetValidSproutReceive(sk, 10, true);
+    auto note = GetSproutNote(sk, wtx, 0, 1);
+    auto nullifier = note.nullifier(sk);
+
+    auto wtx2 = GetValidSproutSpend(sk, note, 5);
+    auto wtx3 = GetValidSproutSpend(sk, note, 10);
+    auto hash2 = wtx2.GetHash();
+    auto hash3 = wtx3.GetHash();
+
+    // No conflicts for no spends
+    EXPECT_EQ(0, wallet.GetConflicts(hash2).size());
+    wallet.LoadWalletTx(wtx);
+    EXPECT_EQ(0, wallet.GetConflicts(hash2).size());
+
+    // No conflicts for one spend
+    wallet.LoadWalletTx(wtx2);
+    EXPECT_EQ(0, wallet.GetConflicts(hash2).size());
+
+    // Conflicts for two spends
+    wallet.LoadWalletTx(wtx3);
+    auto c3 = wallet.GetConflicts(hash2);
+    EXPECT_EQ(2, c3.size());
+    EXPECT_EQ(std::set<uint256>({hash2, hash3}), c3);
+}
+
+// Generate note A and spend to create note B, from which we spend to create two conflicting transactions
+TEST(WalletTests, GetConflictedSaplingNotes) {
+    LoadProofParameters();
+
+    std::vector<libzcash::Zip212Enabled> zip_212_enabled = {libzcash::Zip212Enabled::BeforeZip212, libzcash::Zip212Enabled::AfterZip212};
+    const Consensus::Params& (*activations [])() = {RegtestActivateSapling, RegtestActivateCanopy};
+    void (*deactivations [])() = {RegtestDeactivateSapling, RegtestDeactivateCanopy};
+
+    for (int ver = 0; ver < zip_212_enabled.size(); ver++) {
+        auto consensusParams = (*activations[ver])();
+
+        TestWallet wallet(Params());
+        LOCK2(cs_main, wallet.cs_wallet);
+
+        // Generate Sapling address
+        auto sk = GetTestMasterSaplingSpendingKey();
+        auto expsk = sk.expsk;
+        auto extfvk = sk.ToXFVK();
+        auto ivk = extfvk.ToIncomingViewingKey();
+        auto pk = extfvk.DefaultAddress();
+
+        ASSERT_TRUE(wallet.AddSaplingZKey(sk));
+        ASSERT_TRUE(wallet.HaveSaplingSpendingKey(extfvk));
+
+        // Generate note A
+        libzcash::SaplingNote note(pk, 50000, zip_212_enabled[ver]);
+        auto cm = note.cmu().value();
+
+        MerkleFrontiers frontiers;
+        frontiers.sapling.append(cm);
+        auto anchor = frontiers.sapling.root();
+        auto witness = frontiers.sapling.witness();
+
+        // Generate tx to create output note B
+        auto builder = TransactionBuilder(consensusParams, 1, std::nullopt);
+        builder.AddSaplingSpend(expsk, note, anchor, witness);
+        builder.AddSaplingOutput(extfvk.fvk.ovk, pk, 35000, {});
+        auto tx = builder.Build().GetTxOrThrow();
+        CWalletTx wtx {&wallet, tx};
+
+        // Fake-mine the transaction
+        EXPECT_EQ(-1, chainActive.Height());
+        CBlock block;
+        block.vtx.push_back(wtx);
+        block.hashMerkleRoot = block.BuildMerkleTree();
+        auto blockHash = block.GetHash();
+        CBlockIndex fakeIndex {block};
+        mapBlockIndex.insert(std::make_pair(blockHash, &fakeIndex));
+        chainActive.SetTip(&fakeIndex);
+        EXPECT_TRUE(chainActive.Contains(&fakeIndex));
+        EXPECT_EQ(0, chainActive.Height());
+
+        // Simulate SyncTransaction which calls AddToWalletIfInvolvingMe
+        auto saplingNoteData = wallet.FindMySaplingNotes(wtx,  1).first;
+        ASSERT_TRUE(saplingNoteData.size() > 0);
+        wtx.SetSaplingNoteData(saplingNoteData);
+        wtx.SetMerkleBranch(block);
+        wallet.LoadWalletTx(wtx);
+
+        // Simulate receiving new block and ChainTip signal
+        wallet.IncrementNoteWitnesses(Params().GetConsensus(),&fakeIndex, &block, frontiers, true);
+        wallet.UpdateSaplingNullifierNoteMapForBlock(&block);
+
+        // Retrieve the updated wtx from wallet
+        uint256 hash = wtx.GetHash();
+        wtx = wallet.mapWallet[hash];
+
+        // Decrypt output note B
+        auto maybe_pt = libzcash::SaplingNotePlaintext::decrypt(
+                consensusParams,
+                wtx.nExpiryHeight,
+                wtx.vShieldedOutput[0].encCiphertext,
+                ivk,
+                wtx.vShieldedOutput[0].ephemeralKey,
+                wtx.vShieldedOutput[0].cmu);
+        ASSERT_EQ(static_cast<bool>(maybe_pt), true);
+        auto maybe_note = maybe_pt.value().note(ivk);
+        ASSERT_EQ(static_cast<bool>(maybe_note), true);
+        auto note2 = maybe_note.value();
+
+        SaplingOutPoint sop0(wtx.GetHash(), 0);
+        auto spend_note_witness =  wtx.mapSaplingNoteData[sop0].witnesses.front();
+        auto maybe_nf = note2.nullifier(extfvk.fvk, spend_note_witness.position());
+        ASSERT_EQ(static_cast<bool>(maybe_nf), true);
+        auto nullifier2 = maybe_nf.value();
+
+        anchor = frontiers.sapling.root();
+
+        // Create transaction to spend note B
+        auto builder2 = TransactionBuilder(consensusParams, 2, std::nullopt);
+        builder2.AddSaplingSpend(expsk, note2, anchor, spend_note_witness);
+        builder2.AddSaplingOutput(extfvk.fvk.ovk, pk, 20000, {});
+        auto tx2 = builder2.Build().GetTxOrThrow();
+
+        // Create conflicting transaction which also spends note B
+        auto builder3 = TransactionBuilder(consensusParams, 2, std::nullopt);
+        builder3.AddSaplingSpend(expsk, note2, anchor, spend_note_witness);
+        builder3.AddSaplingOutput(extfvk.fvk.ovk, pk, 19999, {});
+        auto tx3 = builder3.Build().GetTxOrThrow();
+
+        CWalletTx wtx2 {&wallet, tx2};
+        CWalletTx wtx3 {&wallet, tx3};
+
+        auto hash2 = wtx2.GetHash();
+        auto hash3 = wtx3.GetHash();
+
+        // No conflicts for no spends (wtx is currently the only transaction in the wallet)
+        EXPECT_EQ(0, wallet.GetConflicts(hash2).size());
+        EXPECT_EQ(0, wallet.GetConflicts(hash3).size());
+
+        // No conflicts for one spend
+        wallet.LoadWalletTx(wtx2);
+        EXPECT_EQ(0, wallet.GetConflicts(hash2).size());
+
+        // Conflicts for two spends
+        wallet.LoadWalletTx(wtx3);
+        auto c3 = wallet.GetConflicts(hash2);
+        EXPECT_EQ(2, c3.size());
+        EXPECT_EQ(std::set<uint256>({hash2, hash3}), c3);
+
+        // Tear down
+        chainActive.SetTip(NULL);
+        mapBlockIndex.erase(blockHash);
+
+        (*deactivations[ver])();
+    }
+}
+
+TEST(WalletTests, GetConflictedOrchardNotes) {
+    LoadProofParameters();
+
+    auto consensusParams = RegtestActivateNU5();
+    TestWallet wallet(Params());
+    wallet.GenerateNewSeed();
+
+    LOCK2(cs_main, wallet.cs_wallet);
+
+    // Create an account.
+    auto ufvk = wallet.GenerateNewUnifiedSpendingKey().first;
+    auto fvk = ufvk.GetOrchardKey().value();
+    auto ivk = fvk.ToIncomingViewingKey();
+    libzcash::diversifier_index_t j(0);
+    auto recipient = ivk.Address(j);
+
+    uint256 orchardAnchor;
+
+    // Generate transparent funds
+    CBasicKeyStore keystore;
+    CKey tsk = AddTestCKeyToKeyStore(keystore);
+    auto tkeyid = tsk.GetPubKey().GetID();
+    auto scriptPubKey = GetScriptForDestination(tkeyid);
+
+    // Generate a bundle containing output note A.
+    auto builder = TransactionBuilder(consensusParams, 1, orchardAnchor, &keystore);
+    builder.AddTransparentInput(COutPoint(uint256(), 0), scriptPubKey, 50000);
+    builder.AddOrchardOutput(std::nullopt, recipient, 40000, {});
+    auto maybeTx = builder.Build();
+    EXPECT_TRUE(maybeTx.IsTx());
+    if (maybeTx.IsError()) {
+        std::cerr << "Failed to build transaction: " << maybeTx.GetError() << std::endl;
+        GTEST_FAIL();
+    }
+    auto tx = maybeTx.GetTxOrThrow();
+    CWalletTx wtx {&wallet, tx};
+
+    // Fake-mine the transaction
+    MerkleFrontiers frontiers;
+    OrchardMerkleFrontier orchardTree;
+    orchardTree.AppendBundle(wtx.GetOrchardBundle());
+
+    EXPECT_EQ(-1, chainActive.Height());
+    CBlock block;
+    block.vtx.push_back(wtx);
+    block.hashMerkleRoot = block.BuildMerkleTree();
+    auto blockHash = block.GetHash();
+    CBlockIndex fakeIndex {block};
+    fakeIndex.hashFinalOrchardRoot = orchardTree.root();
+    mapBlockIndex.insert(std::make_pair(blockHash, &fakeIndex));
+    chainActive.SetTip(&fakeIndex);
+    EXPECT_TRUE(chainActive.Contains(&fakeIndex));
+    EXPECT_EQ(0, chainActive.Height());
+
+    // Simulate SyncTransaction which calls AddToWalletIfInvolvingMe
+    auto orchardTxMeta = wallet.GetOrchardWallet().AddNotesIfInvolvingMe(wtx);
+    ASSERT_TRUE(orchardTxMeta.has_value());
+    EXPECT_FALSE(orchardTxMeta.value().empty());
+    wtx.SetOrchardTxMeta(orchardTxMeta.value());
+    wtx.SetMerkleBranch(block);
+    wallet.LoadWalletTx(wtx);
+
+    // Simulate receiving new block and ChainTip signal
+    wallet.IncrementNoteWitnesses(Params().GetConsensus(),&fakeIndex, &block, frontiers, true);
+
+    // Fetch the Orchard note so we can spend it.
+    std::vector<SproutNoteEntry> sproutEntries;
+    std::vector<SaplingNoteEntry> saplingEntries;
+    std::vector<OrchardNoteMetadata> orchardEntries;
+    wallet.GetFilteredNotes(sproutEntries, saplingEntries, orchardEntries, std::nullopt, -1);
+    EXPECT_EQ(0, sproutEntries.size());
+    EXPECT_EQ(0, saplingEntries.size());
+    EXPECT_EQ(1, orchardEntries.size());
+
+    // Generate another recipient
+    libzcash::diversifier_index_t j2(1);
+    auto recipient2 = ivk.Address(j2);
+
+    // Generate tx to spend note A
+    auto builder2 = TransactionBuilder(consensusParams, 2, orchardTree.root());
+    auto noteToSpend = std::move(wallet.GetOrchardSpendInfo(orchardEntries, orchardTree.root())[0]);
+    builder2.AddOrchardSpend(std::move(noteToSpend.first), std::move(noteToSpend.second));
+    auto maybeTx2 = builder2.Build();
+    EXPECT_TRUE(maybeTx2.IsTx());
+    if (maybeTx2.IsError()) {
+        std::cerr << "Failed to build transaction: " << maybeTx2.GetError() << std::endl;
+        GTEST_FAIL();
+    }
+    auto tx2 = maybeTx2.GetTxOrThrow();
+    CWalletTx wtx2 {&wallet, tx2};
+
+    // Generate conflicting tx to spend note A
+    auto noteToSpend2 = std::move(wallet.GetOrchardSpendInfo(orchardEntries, orchardTree.root())[0]);
+    auto builder3 = TransactionBuilder(consensusParams, 2, orchardTree.root());
+    builder3.AddOrchardSpend(std::move(noteToSpend2.first), std::move(noteToSpend2.second));
+    auto maybeTx3 = builder3.Build();
+    EXPECT_TRUE(maybeTx3.IsTx());
+    if (maybeTx3.IsError()) {
+        std::cerr << "Failed to build transaction: " << maybeTx3.GetError() << std::endl;
+        GTEST_FAIL();
+    }
+    auto tx3 = maybeTx3.GetTxOrThrow();
+    CWalletTx wtx3 {&wallet, tx3};
+
+    auto hash2 = wtx2.GetHash();
+    auto hash3 = wtx3.GetHash();
+
+    // No conflicts for no spends (wtx is currently the only transaction in the wallet)
+    EXPECT_EQ(0, wallet.GetConflicts(hash2).size());
+    EXPECT_EQ(0, wallet.GetConflicts(hash3).size());
+
+    // No conflicts for one spend
+    auto orchardTxMeta2 = wallet.GetOrchardWallet().AddNotesIfInvolvingMe(wtx2);
+    ASSERT_TRUE(orchardTxMeta2.has_value());
+    EXPECT_FALSE(orchardTxMeta2.value().empty());
+    wtx2.SetOrchardTxMeta(orchardTxMeta2.value());
+    wallet.LoadWalletTx(wtx2);
+    EXPECT_EQ(0, wallet.GetConflicts(hash2).size());
+    EXPECT_EQ(0, wallet.GetConflicts(hash3).size());
+
+    // Conflicts for two spends
+    auto orchardTxMeta3 = wallet.GetOrchardWallet().AddNotesIfInvolvingMe(wtx3);
+    ASSERT_TRUE(orchardTxMeta3.has_value());
+    EXPECT_FALSE(orchardTxMeta3.value().empty());
+    wtx3.SetOrchardTxMeta(orchardTxMeta3.value());
+    wallet.LoadWalletTx(wtx3);
+    auto c3 = wallet.GetConflicts(hash2);
+    EXPECT_EQ(2, c3.size());
+    EXPECT_EQ(std::set<uint256>({hash2, hash3}), c3);
+
+    // Tear down
+    chainActive.SetTip(NULL);
+    mapBlockIndex.erase(blockHash);
+
+    RegtestDeactivateNU5();
+}
+
+TEST(WalletTests, SproutNullifierIsSpent) {
+    SelectParams(CBaseChainParams::REGTEST);
+    CWallet wallet(Params());
+    LOCK2(cs_main, wallet.cs_wallet);
+
+    auto sk = libzcash::SproutSpendingKey::random();
+    wallet.AddSproutSpendingKey(sk);
+
+    auto wtx = GetValidSproutReceive(sk, 10, true);
+    auto note = GetSproutNote(sk, wtx, 0, 1);
+    auto nullifier = note.nullifier(sk);
+
+    EXPECT_FALSE(wallet.IsSproutSpent(nullifier));
+
+    wallet.LoadWalletTx(wtx);
+    EXPECT_FALSE(wallet.IsSproutSpent(nullifier));
+
+    auto wtx2 = GetValidSproutSpend(sk, note, 5);
+    wallet.LoadWalletTx(wtx2);
+    EXPECT_FALSE(wallet.IsSproutSpent(nullifier));
+
+    // Fake-mine the transaction
+    EXPECT_EQ(-1, chainActive.Height());
+    CBlock block;
+    block.vtx.push_back(wtx2);
+    block.hashMerkleRoot = block.BuildMerkleTree();
+    auto blockHash = block.GetHash();
+    CBlockIndex fakeIndex {block};
+    mapBlockIndex.insert(std::make_pair(blockHash, &fakeIndex));
+    chainActive.SetTip(&fakeIndex);
+    EXPECT_TRUE(chainActive.Contains(&fakeIndex));
+    EXPECT_EQ(0, chainActive.Height());
+
+    wtx2.SetMerkleBranch(block);
+    wallet.LoadWalletTx(wtx2);
+    EXPECT_TRUE(wallet.IsSproutSpent(nullifier));
+
+    // Tear down
+    chainActive.SetTip(NULL);
+    mapBlockIndex.erase(blockHash);
+}
+
+TEST(WalletTests, SaplingNullifierIsSpent) {
+    LoadProofParameters();
+
+    auto consensusParams = RegtestActivateSapling();
+    TestWallet wallet(Params());
+    LOCK2(cs_main, wallet.cs_wallet);
+
+    // Generate dummy Sapling address
+    auto sk = GetTestMasterSaplingSpendingKey();
+    auto expsk = sk.expsk;
+    auto extfvk = sk.ToXFVK();
+    auto pa = extfvk.DefaultAddress();
+
+    auto testNote = GetTestSaplingNote(pa, 50000);
+
+    // Generate transaction
+    auto builder = TransactionBuilder(consensusParams, 1, std::nullopt);
+    builder.AddSaplingSpend(expsk,  testNote.note, testNote.tree.root(), testNote.tree.witness());
+    builder.AddSaplingOutput(extfvk.fvk.ovk, pa, 25000, {});
+    auto tx = builder.Build().GetTxOrThrow();
+
+    CWalletTx wtx {&wallet, tx};
+    ASSERT_TRUE(wallet.AddSaplingZKey(sk));
+    ASSERT_TRUE(wallet.HaveSaplingSpendingKey(extfvk));
+
+    // Manually compute the nullifier based on the known position
+    auto nf = testNote.note.nullifier(extfvk.fvk, testNote.tree.witness().position());
+    ASSERT_TRUE(nf);
+    uint256 nullifier = nf.value();
+
+    // Verify note has not been spent
+    EXPECT_FALSE(wallet.IsSaplingSpent(nullifier));
+
+    // Fake-mine the transaction
+    EXPECT_EQ(-1, chainActive.Height());
+    CBlock block;
+    block.vtx.push_back(wtx);
+    block.hashMerkleRoot = block.BuildMerkleTree();
+    auto blockHash = block.GetHash();
+    CBlockIndex fakeIndex {block};
+    mapBlockIndex.insert(std::make_pair(blockHash, &fakeIndex));
+    chainActive.SetTip(&fakeIndex);
+    EXPECT_TRUE(chainActive.Contains(&fakeIndex));
+    EXPECT_EQ(0, chainActive.Height());
+
+    wtx.SetMerkleBranch(block);
+    wallet.LoadWalletTx(wtx);
+
+    // Verify note has been spent
+    EXPECT_TRUE(wallet.IsSaplingSpent(nullifier));
+
+    // Tear down
+    chainActive.SetTip(NULL);
+    mapBlockIndex.erase(blockHash);
+
+    // Revert to default
+    RegtestDeactivateSapling();
+}
+
+TEST(WalletTests, NavigateFromSproutNullifierToNote) {
+    SelectParams(CBaseChainParams::REGTEST);
+    CWallet wallet(Params());
+    LOCK(wallet.cs_wallet);
+
+    auto sk = libzcash::SproutSpendingKey::random();
+    wallet.AddSproutSpendingKey(sk);
+
+    auto wtx = GetValidSproutReceive(sk, 10, true);
+    auto note = GetSproutNote(sk, wtx, 0, 1);
+    auto nullifier = note.nullifier(sk);
+
+    mapSproutNoteData_t noteData;
+    JSOutPoint jsoutpt {wtx.GetHash(), 0, 1};
+    SproutNoteData nd {sk.address(), nullifier};
+    noteData[jsoutpt] = nd;
+
+    wtx.SetSproutNoteData(noteData);
+
+    EXPECT_EQ(0, wallet.mapSproutNullifiersToNotes.count(nullifier));
+
+    wallet.LoadWalletTx(wtx);
+    EXPECT_EQ(1, wallet.mapSproutNullifiersToNotes.count(nullifier));
+    EXPECT_EQ(wtx.GetHash(), wallet.mapSproutNullifiersToNotes[nullifier].hash);
+    EXPECT_EQ(0, wallet.mapSproutNullifiersToNotes[nullifier].js);
+    EXPECT_EQ(1, wallet.mapSproutNullifiersToNotes[nullifier].n);
+}
+
+TEST(WalletTests, NavigateFromSaplingNullifierToNote) {
+    LoadProofParameters();
+
+    auto consensusParams = RegtestActivateSapling();
+    TestWallet wallet(Params());
+    LOCK2(cs_main, wallet.cs_wallet);
+
+    // Generate dummy Sapling address
+    auto sk = GetTestMasterSaplingSpendingKey();
+    auto expsk = sk.expsk;
+    auto extfvk = sk.ToXFVK();
+    auto pa = extfvk.DefaultAddress();
+
+    auto testNote = GetTestSaplingNote(pa, 50000);
+
+    // Generate transaction
+    auto builder = TransactionBuilder(consensusParams, 1, std::nullopt);
+    builder.AddSaplingSpend(expsk, testNote.note, testNote.tree.root(), testNote.tree.witness());
+    builder.AddSaplingOutput(extfvk.fvk.ovk, pa, 25000, {});
+    auto tx = builder.Build().GetTxOrThrow();
+
+    CWalletTx wtx {&wallet, tx};
+    ASSERT_TRUE(wallet.AddSaplingZKey(sk));
+    ASSERT_TRUE(wallet.HaveSaplingSpendingKey(extfvk));
+
+    // Manually compute the nullifier based on the expected position
+    auto nf = testNote.note.nullifier(extfvk.fvk, testNote.tree.witness().position());
+    ASSERT_TRUE(nf);
+    uint256 nullifier = nf.value();
+
+    MerkleFrontiers frontiers = { .sapling = testNote.tree };
+
+    // Verify dummy note is unspent
+    EXPECT_FALSE(wallet.IsSaplingSpent(nullifier));
+
+    // Fake-mine the transaction
+    EXPECT_EQ(-1, chainActive.Height());
+    CBlock block;
+    block.vtx.push_back(wtx);
+    block.hashMerkleRoot = block.BuildMerkleTree();
+    auto blockHash = block.GetHash();
+    CBlockIndex fakeIndex {block};
+    mapBlockIndex.insert(std::make_pair(blockHash, &fakeIndex));
+    chainActive.SetTip(&fakeIndex);
+    EXPECT_TRUE(chainActive.Contains(&fakeIndex));
+    EXPECT_EQ(0, chainActive.Height());
+
+    // Simulate SyncTransaction which calls AddToWalletIfInvolvingMe
+    wtx.SetMerkleBranch(block);
+    auto saplingNoteData = wallet.FindMySaplingNotes(wtx, chainActive.Height()).first;
+    ASSERT_TRUE(saplingNoteData.size() > 0);
+    wtx.SetSaplingNoteData(saplingNoteData);
+    wallet.LoadWalletTx(wtx);
+
+    // Verify dummy note is now spent, as AddToWallet invokes AddToSpends()
+    EXPECT_TRUE(wallet.IsSaplingSpent(nullifier));
+
+    // Test invariant: no witnesses means no nullifier.
+    EXPECT_EQ(0, wallet.mapSaplingNullifiersToNotes.size());
+    for (mapSaplingNoteData_t::value_type &item : wtx.mapSaplingNoteData) {
+        SaplingNoteData nd = item.second;
+        ASSERT_TRUE(nd.witnesses.empty());
+        ASSERT_FALSE(nd.nullifier);
+    }
+
+    // Simulate receiving new block and ChainTip signal
+    wallet.IncrementNoteWitnesses(Params().GetConsensus(), &fakeIndex, &block, frontiers, true);
+    wallet.UpdateSaplingNullifierNoteMapForBlock(&block);
+
+    // Retrieve the updated wtx from wallet
+    uint256 hash = wtx.GetHash();
+    wtx = wallet.mapWallet[hash];
+
+    // Verify Sapling nullifiers map to SaplingOutPoints
+    EXPECT_EQ(2, wallet.mapSaplingNullifiersToNotes.size());
+    for (mapSaplingNoteData_t::value_type &item : wtx.mapSaplingNoteData) {
+        SaplingOutPoint op = item.first;
+        SaplingNoteData nd = item.second;
+        EXPECT_EQ(hash, op.hash);
+        EXPECT_EQ(1, nd.witnesses.size());
+        ASSERT_TRUE(nd.nullifier);
+        auto nf = nd.nullifier.value();
+        EXPECT_EQ(1, wallet.mapSaplingNullifiersToNotes.count(nf));
+        EXPECT_EQ(op.hash, wallet.mapSaplingNullifiersToNotes[nf].hash);
+        EXPECT_EQ(op.n, wallet.mapSaplingNullifiersToNotes[nf].n);
+    }
+
+    // Tear down
+    chainActive.SetTip(NULL);
+    mapBlockIndex.erase(blockHash);
+
+    // Revert to default
+    RegtestDeactivateSapling();
+}
+
+TEST(WalletTests, SpentSproutNoteIsFromMe) {
+    SelectParams(CBaseChainParams::REGTEST);
+    CWallet wallet(Params());
+    LOCK(wallet.cs_wallet);
+
+    auto sk = libzcash::SproutSpendingKey::random();
+    wallet.AddSproutSpendingKey(sk);
+
+    auto wtx = GetValidSproutReceive(sk, 10, true);
+    auto note = GetSproutNote(sk, wtx, 0, 1);
+    auto nullifier = note.nullifier(sk);
+    auto wtx2 = GetValidSproutSpend(sk, note, 5);
+
+    EXPECT_FALSE(wallet.IsFromMe(wtx));
+    EXPECT_FALSE(wallet.IsFromMe(wtx2));
+
+    mapSproutNoteData_t noteData;
+    JSOutPoint jsoutpt {wtx.GetHash(), 0, 1};
+    SproutNoteData nd {sk.address(), nullifier};
+    noteData[jsoutpt] = nd;
+
+    wtx.SetSproutNoteData(noteData);
+    EXPECT_FALSE(wallet.IsFromMe(wtx));
+    EXPECT_FALSE(wallet.IsFromMe(wtx2));
+
+    wallet.LoadWalletTx(wtx);
+    EXPECT_FALSE(wallet.IsFromMe(wtx));
+    EXPECT_TRUE(wallet.IsFromMe(wtx2));
+}
+
+// Create note A, spend A to create note B, spend and verify note B is from me.
+TEST(WalletTests, SpentSaplingNoteIsFromMe) {
+    LoadProofParameters();
+
+    std::vector<libzcash::Zip212Enabled> zip_212_enabled = {libzcash::Zip212Enabled::BeforeZip212, libzcash::Zip212Enabled::AfterZip212};
+    const Consensus::Params& (*activations [])() = {RegtestActivateSapling, RegtestActivateCanopy};
+    void (*deactivations [])() = {RegtestDeactivateSapling, RegtestDeactivateCanopy};
+
+    for (int ver = 0; ver < zip_212_enabled.size(); ver++) {
+        auto consensusParams = (*activations[ver])();
+
+        TestWallet wallet(Params());
+        LOCK2(cs_main, wallet.cs_wallet);
+
+        // Generate Sapling address
+        auto sk = GetTestMasterSaplingSpendingKey();
+        auto expsk = sk.expsk;
+        auto extfvk = sk.ToXFVK();
+        auto ivk = extfvk.ToIncomingViewingKey();
+        auto pk = extfvk.DefaultAddress();
+
+        // Generate Sapling note A
+        libzcash::SaplingNote note(pk, 50000, zip_212_enabled[ver]);
+        auto cm = note.cmu().value();
+        MerkleFrontiers frontiers;
+        frontiers.sapling.append(cm);
+        auto anchor = frontiers.sapling.root();
+        auto witness = frontiers.sapling.witness();
+
+        // Generate transaction, which sends funds to note B
+        auto builder = TransactionBuilder(consensusParams, 1, std::nullopt);
+        builder.AddSaplingSpend(expsk, note, anchor, witness);
+        builder.AddSaplingOutput(extfvk.fvk.ovk, pk, 25000, {});
+        auto tx = builder.Build().GetTxOrThrow();
+
+        CWalletTx wtx {&wallet, tx};
+        ASSERT_TRUE(wallet.AddSaplingZKey(sk));
+        ASSERT_TRUE(wallet.HaveSaplingSpendingKey(extfvk));
+
+        // Fake-mine the transaction
+        EXPECT_EQ(-1, chainActive.Height());
+        CBlock block;
+        block.vtx.push_back(wtx);
+        block.hashMerkleRoot = block.BuildMerkleTree();
+        auto blockHash = block.GetHash();
+        CBlockIndex fakeIndex {block};
+        mapBlockIndex.insert(std::make_pair(blockHash, &fakeIndex));
+        chainActive.SetTip(&fakeIndex);
+        EXPECT_TRUE(chainActive.Contains(&fakeIndex));
+        EXPECT_EQ(0, chainActive.Height());
+
+        auto saplingNoteData = wallet.FindMySaplingNotes(wtx, 1).first;
+        ASSERT_TRUE(saplingNoteData.size() > 0);
+        wtx.SetSaplingNoteData(saplingNoteData);
+        wtx.SetMerkleBranch(block);
+        wallet.LoadWalletTx(wtx);
+
+        // Simulate receiving new block and ChainTip signal.
+        // This triggers calculation of nullifiers for notes belonging to this wallet
+        // in the output descriptions of wtx.
+        wallet.IncrementNoteWitnesses(Params().GetConsensus(), &fakeIndex, &block, frontiers, true);
+        wallet.UpdateSaplingNullifierNoteMapForBlock(&block);
+
+        // Retrieve the updated wtx from wallet
+        wtx = wallet.mapWallet[wtx.GetHash()];
+
+        // The test wallet never received the fake note which is being spent, so there
+        // is no mapping from nullifier to notedata stored in mapSaplingNullifiersToNotes.
+        // Therefore the wallet does not know the tx belongs to the wallet.
+        EXPECT_FALSE(wallet.IsFromMe(wtx));
+
+        // Manually compute the nullifier and check map entry does not exist
+        auto nf = note.nullifier(extfvk.fvk, witness.position());
+        ASSERT_TRUE(nf);
+        ASSERT_FALSE(wallet.mapSaplingNullifiersToNotes.count(nf.value()));
+
+        // Decrypt note B
+        auto maybe_pt = libzcash::SaplingNotePlaintext::decrypt(
+            consensusParams,
+            wtx.nExpiryHeight,
+            wtx.vShieldedOutput[0].encCiphertext,
+            ivk,
+            wtx.vShieldedOutput[0].ephemeralKey,
+            wtx.vShieldedOutput[0].cmu);
+        ASSERT_EQ(static_cast<bool>(maybe_pt), true);
+        auto maybe_note = maybe_pt.value().note(ivk);
+        ASSERT_EQ(static_cast<bool>(maybe_note), true);
+        auto note2 = maybe_note.value();
+
+        // Get witness to retrieve position of note B we want to spend
+        SaplingOutPoint sop0(wtx.GetHash(), 0);
+        auto spend_note_witness =  wtx.mapSaplingNoteData[sop0].witnesses.front();
+        auto maybe_nf = note2.nullifier(extfvk.fvk, spend_note_witness.position());
+        ASSERT_EQ(static_cast<bool>(maybe_nf), true);
+        auto nullifier2 = maybe_nf.value();
+
+        // NOTE: Not updating the anchor results in a core dump.  Shouldn't builder just return error?
+        // *** Error in `./zcash-gtest': double free or corruption (out): 0x00007ffd8755d990 ***
+        anchor = frontiers.sapling.root();
+
+        // Create transaction to spend note B
+        auto builder2 = TransactionBuilder(consensusParams, 2, std::nullopt);
+        builder2.AddSaplingSpend(expsk, note2, anchor, spend_note_witness);
+        builder2.AddSaplingOutput(extfvk.fvk.ovk, pk, 12500, {});
+        auto tx2 = builder2.Build().GetTxOrThrow();
+        EXPECT_EQ(tx2.vin.size(), 0);
+        EXPECT_EQ(tx2.vout.size(), 0);
+        EXPECT_EQ(tx2.vJoinSplit.size(), 0);
+        EXPECT_EQ(tx2.vShieldedSpend.size(), 1);
+        EXPECT_EQ(tx2.vShieldedOutput.size(), 2);
+        EXPECT_EQ(tx2.GetValueBalanceSapling(), 10000);
+
+        CWalletTx wtx2 {&wallet, tx2};
+
+        // Fake-mine this tx into the next block
+        EXPECT_EQ(0, chainActive.Height());
+        CBlock block2;
+        block2.vtx.push_back(wtx2);
+        block2.hashMerkleRoot = block2.BuildMerkleTree();
+        block2.hashPrevBlock = blockHash;
+        auto blockHash2 = block2.GetHash();
+        CBlockIndex fakeIndex2 {block2};
+        mapBlockIndex.insert(std::make_pair(blockHash2, &fakeIndex2));
+        fakeIndex2.nHeight = 1;
+        chainActive.SetTip(&fakeIndex2);
+        EXPECT_TRUE(chainActive.Contains(&fakeIndex2));
+        EXPECT_EQ(1, chainActive.Height());
+
+        auto saplingNoteData2 = wallet.FindMySaplingNotes(wtx2, 2).first;
+        ASSERT_TRUE(saplingNoteData2.size() > 0);
+        wtx2.SetSaplingNoteData(saplingNoteData2);
+        wtx2.SetMerkleBranch(block2);
+        wallet.LoadWalletTx(wtx2);
+
+        // Verify note B is spent. LoadWalletTx invokes AddToSpends which updates mapTxSaplingNullifiers
+        EXPECT_TRUE(wallet.IsSaplingSpent(nullifier2));
+
+        // Verify note B belongs to wallet.
+        EXPECT_TRUE(wallet.IsFromMe(wtx2));
+        ASSERT_TRUE(wallet.mapSaplingNullifiersToNotes.count(nullifier2));
+
+        // Tear down
+        chainActive.SetTip(NULL);
+        mapBlockIndex.erase(blockHash);
+        mapBlockIndex.erase(blockHash2);
+
+        (*deactivations[ver])();
+    }
+}
+
+TEST(WalletTests, CachedWitnessesEmptyChain) {
+    SelectParams(CBaseChainParams::REGTEST);
+    TestWallet wallet(Params());
+
+    auto sk = libzcash::SproutSpendingKey::random();
+    wallet.AddSproutSpendingKey(sk);
+
+    auto wtx = GetValidSproutReceive(sk, 10, true);
+    auto note = GetSproutNote(sk, wtx, 0, 0);
+    auto note2 = GetSproutNote(sk, wtx, 0, 1);
+    auto nullifier = note.nullifier(sk);
+    auto nullifier2 = note2.nullifier(sk);
+
+    mapSproutNoteData_t sproutNoteData;
+    JSOutPoint jsoutpt {wtx.GetHash(), 0, 0};
+    JSOutPoint jsoutpt2 {wtx.GetHash(), 0, 1};
+    SproutNoteData nd {sk.address(), nullifier};
+    SproutNoteData nd2 {sk.address(), nullifier2};
+    sproutNoteData[jsoutpt] = nd;
+    sproutNoteData[jsoutpt2] = nd2;
+    wtx.SetSproutNoteData(sproutNoteData);
+
+    std::vector<JSOutPoint> sproutNotes {jsoutpt, jsoutpt2};
+    std::vector<SaplingOutPoint> saplingNotes = SetSaplingNoteData(wtx);
+
+    std::vector<std::optional<SproutWitness>> sproutWitnesses;
+    std::vector<std::optional<SaplingWitness>> saplingWitnesses;
+
+    ::GetWitnessesAndAnchors(wallet, sproutNotes, saplingNotes, nAnchorConfirmations, sproutWitnesses, saplingWitnesses);
+
+    EXPECT_FALSE((bool) sproutWitnesses[0]);
+    EXPECT_FALSE((bool) sproutWitnesses[1]);
+    EXPECT_FALSE((bool) saplingWitnesses[0]);
+
+    wallet.LoadWalletTx(wtx);
+
+    ::GetWitnessesAndAnchors(wallet, sproutNotes, saplingNotes, nAnchorConfirmations, sproutWitnesses, saplingWitnesses);
+
+    EXPECT_FALSE((bool) sproutWitnesses[0]);
+    EXPECT_FALSE((bool) sproutWitnesses[1]);
+    EXPECT_FALSE((bool) saplingWitnesses[0]);
+
+    CBlock block;
+    block.vtx.push_back(wtx);
+    CBlockIndex index(block);
+    MerkleFrontiers frontiers;
+    const auto& params = Params().GetConsensus();
+    wallet.IncrementNoteWitnesses(params, &index, &block, frontiers, true);
+
+    // this death will occur because there will not be sufficient Sprout witnesses to reach the
+    // default anchor depth
+    EXPECT_DEATH(::GetWitnessesAndAnchors(wallet, sproutNotes, saplingNotes, nAnchorConfirmations, sproutWitnesses, saplingWitnesses),
+                 "GetSproutNoteWitnesses");
+
+    // add another block; we still don't have enough witnesses
+    {
+        CBlock another_block;
+        CBlockIndex another_index(another_block);
+        another_index.nHeight = 1;
+        wallet.IncrementNoteWitnesses(params, &another_index, &another_block, frontiers, true);
+    }
+
+    EXPECT_DEATH(::GetWitnessesAndAnchors(wallet, sproutNotes, saplingNotes, nAnchorConfirmations, sproutWitnesses, saplingWitnesses),
+                 "GetSproutNoteWitnesses");
+
+    for (int i = 2; i <= 8; i++) {
+        CBlock another_block;
+        CBlockIndex another_index(another_block);
+        another_index.nHeight = i;
+        wallet.IncrementNoteWitnesses(params, &another_index, &another_block, frontiers, true);
+    }
+
+    CBlock last_block;
+    CBlockIndex last_index(last_block);
+    last_index.nHeight = 9;
+    wallet.IncrementNoteWitnesses(params, &last_index, &last_block, frontiers, true);
+
+    ::GetWitnessesAndAnchors(wallet, sproutNotes, saplingNotes, nAnchorConfirmations, sproutWitnesses, saplingWitnesses);
+
+    EXPECT_TRUE((bool) sproutWitnesses[0]);
+    EXPECT_TRUE((bool) sproutWitnesses[1]);
+    EXPECT_TRUE((bool) saplingWitnesses[0]);
+
+    for (int i = 9; i >= 1; i--) {
+        CBlock another_block;
+        CBlockIndex another_index(another_block);
+        another_index.nHeight = i;
+        wallet.DecrementNoteWitnesses(params, &another_index);
+    }
+
+    // Until #1302 is implemented, this should trigger an assertion
+    EXPECT_DEATH(wallet.DecrementNoteWitnesses(params, &index),
+                 ".*nWitnessCacheSize > 0.*");
+}
+
+TEST(WalletTests, CachedWitnessesChainTip) {
+    SelectParams(CBaseChainParams::REGTEST);
+    TestWallet wallet(Params());
+    LOCK(wallet.cs_wallet);
+
+    std::pair<uint256, uint256> anchors1;
+    CBlock block1;
+    MerkleFrontiers frontiers;
+
+    auto sk = libzcash::SproutSpendingKey::random();
+    wallet.AddSproutSpendingKey(sk);
+
+    {
+        // First block (case tested in _empty_chain)
+        CBlockIndex index1(block1);
+        index1.nHeight = 1;
+        auto outpts = CreateValidBlock(wallet, sk, index1, block1, frontiers);
+
+        // Called to fetch anchor
+        std::vector<JSOutPoint> sproutNotes {outpts.first};
+        std::vector<SaplingOutPoint> saplingNotes {outpts.second};
+        std::vector<std::optional<SproutWitness>> sproutWitnesses;
+        std::vector<std::optional<SaplingWitness>> saplingWitnesses;
+
+        anchors1 = GetWitnessesAndAnchors(wallet, sproutNotes, saplingNotes, 1, sproutWitnesses, saplingWitnesses);
+        EXPECT_NE(anchors1.first, anchors1.second);
+    }
+
+    {
+        // Second transaction
+        auto wtx = GetValidSproutReceive(sk, 50, true);
+        auto note = GetSproutNote(sk, wtx, 0, 1);
+        auto nullifier = note.nullifier(sk);
+
+        mapSproutNoteData_t sproutNoteData;
+        JSOutPoint jsoutpt {wtx.GetHash(), 0, 1};
+        SproutNoteData nd {sk.address(), nullifier};
+        sproutNoteData[jsoutpt] = nd;
+        wtx.SetSproutNoteData(sproutNoteData);
+        std::vector<SaplingOutPoint> saplingNotes = SetSaplingNoteData(wtx);
+        wallet.LoadWalletTx(wtx);
+
+        std::vector<JSOutPoint> sproutNotes {jsoutpt};
+        std::vector<std::optional<SproutWitness>> sproutWitnesses;
+        std::vector<std::optional<SaplingWitness>> saplingWitnesses;
+
+        GetWitnessesAndAnchors(wallet, sproutNotes, saplingNotes, 1, sproutWitnesses, saplingWitnesses);
+
+        EXPECT_FALSE((bool) sproutWitnesses[0]);
+        EXPECT_FALSE((bool) saplingWitnesses[0]);
+
+        // Second block
+        CBlock block2;
+        block2.hashPrevBlock = block1.GetHash();
+        block2.vtx.push_back(wtx);
+        CBlockIndex index2(block2);
+        index2.nHeight = 2;
+        MerkleFrontiers frontiers2 = { .sprout = frontiers.sprout, .sapling = frontiers.sapling };
+        wallet.IncrementNoteWitnesses(Params().GetConsensus(), &index2, &block2, frontiers2, true);
+
+        auto anchors2 = GetWitnessesAndAnchors(wallet, sproutNotes, saplingNotes, 1, sproutWitnesses, saplingWitnesses);
+        EXPECT_NE(anchors2.first, anchors2.second);
+
+        EXPECT_TRUE((bool) sproutWitnesses[0]);
+        EXPECT_TRUE((bool) saplingWitnesses[0]);
+        EXPECT_NE(anchors1.first, anchors2.first);
+        EXPECT_NE(anchors1.second, anchors2.second);
+
+        // Decrementing should give us the previous anchor
+        wallet.DecrementNoteWitnesses(Params().GetConsensus(), &index2);
+        auto anchors3 = GetWitnessesAndAnchors(wallet, sproutNotes, saplingNotes, 1, sproutWitnesses, saplingWitnesses);
+
+        EXPECT_FALSE((bool) sproutWitnesses[0]);
+        EXPECT_FALSE((bool) saplingWitnesses[0]);
+        // Should not equal first anchor because none of these notes had witnesses
+        EXPECT_NE(anchors1.first, anchors3.first);
+        EXPECT_NE(anchors1.second, anchors3.second);
+
+        // Re-incrementing with the same block should give the same result
+        wallet.IncrementNoteWitnesses(Params().GetConsensus(), &index2, &block2, frontiers, true);
+        auto anchors4 = GetWitnessesAndAnchors(wallet, sproutNotes, saplingNotes, 1, sproutWitnesses, saplingWitnesses);
+        EXPECT_NE(anchors4.first, anchors4.second);
+
+        EXPECT_TRUE((bool) sproutWitnesses[0]);
+        EXPECT_TRUE((bool) saplingWitnesses[0]);
+        EXPECT_EQ(anchors2.first, anchors4.first);
+        EXPECT_EQ(anchors2.second, anchors4.second);
+
+        // Incrementing with the same block again should not change the cache
+        wallet.IncrementNoteWitnesses(Params().GetConsensus(), &index2, &block2, frontiers, true);
+        std::vector<std::optional<SproutWitness>> sproutWitnesses5;
+        std::vector<std::optional<SaplingWitness>> saplingWitnesses5;
+
+        auto anchors5 = GetWitnessesAndAnchors(wallet, sproutNotes, saplingNotes, 1, sproutWitnesses5, saplingWitnesses5);
+        EXPECT_NE(anchors5.first, anchors5.second);
+
+        EXPECT_EQ(sproutWitnesses, sproutWitnesses5);
+        EXPECT_EQ(saplingWitnesses, saplingWitnesses5);
+        EXPECT_EQ(anchors4.first, anchors5.first);
+        EXPECT_EQ(anchors4.second, anchors5.second);
+    }
+}
+
+TEST(WalletTests, CachedWitnessesDecrementFirst) {
+    SelectParams(CBaseChainParams::REGTEST);
+    TestWallet wallet(Params());
+    LOCK(wallet.cs_wallet);
+
+    MerkleFrontiers frontiers;
+
+    auto sk = libzcash::SproutSpendingKey::random();
+    wallet.AddSproutSpendingKey(sk);
+
+    {
+        // First block (case tested in _empty_chain)
+        CBlock block1;
+        CBlockIndex index1(block1);
+        index1.nHeight = 1;
+        CreateValidBlock(wallet, sk, index1, block1, frontiers);
+    }
+
+    std::pair<uint256, uint256> anchors2;
+    CBlock block2;
+    CBlockIndex index2(block2);
+
+    {
+        // Second block (case tested in _chain_tip)
+        index2.nHeight = 2;
+        auto outpts = CreateValidBlock(wallet, sk, index2, block2, frontiers);
+
+        // Called to fetch anchor
+        std::vector<JSOutPoint> sproutNotes {outpts.first};
+        std::vector<SaplingOutPoint> saplingNotes {outpts.second};
+        std::vector<std::optional<SproutWitness>> sproutWitnesses;
+        std::vector<std::optional<SaplingWitness>> saplingWitnesses;
+        anchors2 = GetWitnessesAndAnchors(wallet, sproutNotes, saplingNotes, 1, sproutWitnesses, saplingWitnesses);
+    }
+
+{
+        // Third transaction - never mined
+        auto wtx = GetValidSproutReceive(sk, 20, true);
+        auto note = GetSproutNote(sk, wtx, 0, 1);
+        auto nullifier = note.nullifier(sk);
+
+        mapSproutNoteData_t noteData;
+        JSOutPoint jsoutpt {wtx.GetHash(), 0, 1};
+        SproutNoteData nd {sk.address(), nullifier};
+        noteData[jsoutpt] = nd;
+        wtx.SetSproutNoteData(noteData);
+        std::vector<SaplingOutPoint> saplingNotes = SetSaplingNoteData(wtx);
+        wallet.LoadWalletTx(wtx);
+
+        std::vector<JSOutPoint> sproutNotes {jsoutpt};
+        std::vector<std::optional<SproutWitness>> sproutWitnesses;
+        std::vector<std::optional<SaplingWitness>> saplingWitnesses;
+
+        auto anchors3 = GetWitnessesAndAnchors(wallet, sproutNotes, saplingNotes, 1, sproutWitnesses, saplingWitnesses);
+
+        EXPECT_FALSE((bool) sproutWitnesses[0]);
+        EXPECT_FALSE((bool) saplingWitnesses[0]);
+
+        // Decrementing (before the transaction has ever seen an increment)
+        // should give us the previous anchor
+        wallet.DecrementNoteWitnesses(Params().GetConsensus(), &index2);
+
+        auto anchors4 = GetWitnessesAndAnchors(wallet, sproutNotes, saplingNotes, 1, sproutWitnesses, saplingWitnesses);
+
+        EXPECT_FALSE((bool) sproutWitnesses[0]);
+        EXPECT_FALSE((bool) saplingWitnesses[0]);
+        // Should not equal second anchor because none of these notes had witnesses
+        EXPECT_NE(anchors2.first, anchors4.first);
+        EXPECT_NE(anchors2.second, anchors4.second);
+
+        // Re-incrementing with the same block should give the same result
+        wallet.IncrementNoteWitnesses(Params().GetConsensus(), &index2, &block2, frontiers, true);
+
+        auto anchors5 = GetWitnessesAndAnchors(wallet, sproutNotes, saplingNotes, 1, sproutWitnesses, saplingWitnesses);
+
+        EXPECT_FALSE((bool) sproutWitnesses[0]);
+        EXPECT_FALSE((bool) saplingWitnesses[0]);
+        EXPECT_EQ(anchors3.first, anchors5.first);
+        EXPECT_EQ(anchors3.second, anchors5.second);
+    }
+}
+
+TEST(WalletTests, CachedWitnessesCleanIndex) {
+    SelectParams(CBaseChainParams::REGTEST);
+    TestWallet wallet(Params());
+    LOCK(wallet.cs_wallet);
+
+    std::vector<CBlock> blocks;
+    std::vector<CBlockIndex> indices;
+    std::vector<JSOutPoint> sproutNotes;
+    std::vector<SaplingOutPoint> saplingNotes;
+    std::vector<uint256> sproutAnchors;
+    std::vector<uint256> saplingAnchors;
+    MerkleFrontiers frontiers;
+    MerkleFrontiers riFrontiers = { .sprout = frontiers.sprout, .sapling = frontiers.sapling };
+    std::vector<std::optional<SproutWitness>> sproutWitnesses;
+    std::vector<std::optional<SaplingWitness>> saplingWitnesses;
+
+    auto sk = libzcash::SproutSpendingKey::random();
+    wallet.AddSproutSpendingKey(sk);
+
+    // Generate a chain
+    size_t numBlocks = WITNESS_CACHE_SIZE + 10;
+    blocks.resize(numBlocks);
+    indices.resize(numBlocks);
+    for (size_t i = 0; i < numBlocks; i++) {
+        indices[i].nHeight = i;
+        auto oldSproutRoot = frontiers.sprout.root();
+        auto oldSaplingRoot = frontiers.sapling.root();
+        auto outpts = CreateValidBlock(wallet, sk, indices[i], blocks[i], frontiers);
+        EXPECT_NE(oldSproutRoot, frontiers.sprout.root());
+        EXPECT_NE(oldSaplingRoot, frontiers.sapling.root());
+        sproutNotes.push_back(outpts.first);
+        saplingNotes.push_back(outpts.second);
+
+        auto anchors = GetWitnessesAndAnchors(wallet, sproutNotes, saplingNotes, 1, sproutWitnesses, saplingWitnesses);
+        for (size_t j = 0; j <= i; j++) {
+            EXPECT_TRUE((bool) sproutWitnesses[j]);
+            EXPECT_TRUE((bool) saplingWitnesses[j]);
+        }
+        sproutAnchors.push_back(anchors.first);
+        saplingAnchors.push_back(anchors.second);
+    }
+
+    // Now pretend we are reindexing: the chain is cleared, and each block is
+    // used to increment witnesses again.
+    for (size_t i = 0; i < numBlocks; i++) {
+        MerkleFrontiers riPrevFrontiers{riFrontiers};
+        wallet.IncrementNoteWitnesses(Params().GetConsensus(), &(indices[i]), &(blocks[i]), riFrontiers, true);
+
+        auto anchors = GetWitnessesAndAnchors(wallet, sproutNotes, saplingNotes, 1, sproutWitnesses, saplingWitnesses);
+        for (size_t j = 0; j < numBlocks; j++) {
+            EXPECT_TRUE((bool) sproutWitnesses[j]);
+            EXPECT_TRUE((bool) saplingWitnesses[j]);
+        }
+        // Should equal final anchor because witness cache unaffected
+        EXPECT_EQ(sproutAnchors.back(), anchors.first);
+        EXPECT_EQ(saplingAnchors.back(), anchors.second);
+
+        if ((i == 5) || (i == 50)) {
+            // Pretend a reorg happened that was recorded in the block files
+            {
+                wallet.DecrementNoteWitnesses(Params().GetConsensus(), &(indices[i]));
+
+                auto anchors = GetWitnessesAndAnchors(wallet, sproutNotes, saplingNotes, 1, sproutWitnesses, saplingWitnesses);
+                for (size_t j = 0; j < numBlocks; j++) {
+                    EXPECT_TRUE((bool) sproutWitnesses[j]);
+                    EXPECT_TRUE((bool) saplingWitnesses[j]);
+                }
+                // Should equal final anchor because witness cache unaffected
+                EXPECT_EQ(sproutAnchors.back(), anchors.first);
+                EXPECT_EQ(saplingAnchors.back(), anchors.second);
+            }
+
+            {
+                wallet.IncrementNoteWitnesses(Params().GetConsensus(), &(indices[i]), &(blocks[i]), riPrevFrontiers, true);
+                auto anchors = GetWitnessesAndAnchors(wallet, sproutNotes, saplingNotes, 1, sproutWitnesses, saplingWitnesses);
+                for (size_t j = 0; j < numBlocks; j++) {
+                    EXPECT_TRUE((bool) sproutWitnesses[j]);
+                    EXPECT_TRUE((bool) saplingWitnesses[j]);
+                }
+                // Should equal final anchor because witness cache unaffected
+                EXPECT_EQ(sproutAnchors.back(), anchors.first);
+                EXPECT_EQ(saplingAnchors.back(), anchors.second);
+            }
+        }
+    }
+}
+
+TEST(WalletTests, ClearNoteWitnessCache) {
+    SelectParams(CBaseChainParams::REGTEST);
+    TestWallet wallet(Params());
+    LOCK(wallet.cs_wallet);
+
+    auto sk = libzcash::SproutSpendingKey::random();
+    wallet.AddSproutSpendingKey(sk);
+
+    auto wtx = GetValidSproutReceive(sk, 10, true);
+    auto hash = wtx.GetHash();
+    auto note = GetSproutNote(sk, wtx, 0, 0);
+    auto nullifier = note.nullifier(sk);
+
+    mapSproutNoteData_t noteData;
+    JSOutPoint jsoutpt {wtx.GetHash(), 0, 0};
+    JSOutPoint jsoutpt2 {wtx.GetHash(), 0, 1};
+    SproutNoteData nd {sk.address(), nullifier};
+    noteData[jsoutpt] = nd;
+    wtx.SetSproutNoteData(noteData);
+    auto saplingNotes = SetSaplingNoteData(wtx);
+
+    // Pretend we mined the tx by adding a fake witness
+    SproutMerkleTree sproutTree;
+    wtx.mapSproutNoteData[jsoutpt].witnesses.push_front(sproutTree.witness());
+    wtx.mapSproutNoteData[jsoutpt].witnessHeight = 1;
+    wallet.nWitnessCacheSize = 1;
+
+    SaplingMerkleTree saplingTree;
+    wtx.mapSaplingNoteData[saplingNotes[0]].witnesses.push_front(saplingTree.witness());
+    wtx.mapSaplingNoteData[saplingNotes[0]].witnessHeight = 1;
+    wallet.nWitnessCacheSize = 2;
+
+    wallet.LoadWalletTx(wtx);
+
+    // For Sprout, we have two outputs in the one JSDescription, only one of
+    // which is in the wallet.
+    std::vector<JSOutPoint> sproutNotes {jsoutpt, jsoutpt2};
+    // For Sapling, SetSaplingNoteData() only created a single Sapling output
+    // which is in the wallet, so we add a second SaplingOutPoint here to
+    // exercise the "note not in wallet" case.
+    saplingNotes.emplace_back(wtx.GetHash(), 1);
+    ASSERT_EQ(saplingNotes.size(), 2);
+
+    std::vector<std::optional<SproutWitness>> sproutWitnesses;
+    std::vector<std::optional<SaplingWitness>> saplingWitnesses;
+
+    // Before clearing, we should have a witness for one note
+    GetWitnessesAndAnchors(wallet, sproutNotes, saplingNotes, 1, sproutWitnesses, saplingWitnesses);
+    EXPECT_TRUE((bool) sproutWitnesses[0]);
+    EXPECT_FALSE((bool) sproutWitnesses[1]);
+    EXPECT_TRUE((bool) saplingWitnesses[0]);
+    EXPECT_FALSE((bool) saplingWitnesses[1]);
+    EXPECT_EQ(1, wallet.mapWallet[hash].mapSproutNoteData[jsoutpt].witnessHeight);
+    EXPECT_EQ(1, wallet.mapWallet[hash].mapSaplingNoteData[saplingNotes[0]].witnessHeight);
+    EXPECT_EQ(2, wallet.nWitnessCacheSize);
+
+    // After clearing, we should not have a witness for either note
+    wallet.ClearNoteWitnessCache();
+    auto anchors2 = GetWitnessesAndAnchors(wallet, sproutNotes, saplingNotes, 1, sproutWitnesses, saplingWitnesses);
+    EXPECT_FALSE((bool) sproutWitnesses[0]);
+    EXPECT_FALSE((bool) sproutWitnesses[1]);
+    EXPECT_FALSE((bool) saplingWitnesses[0]);
+    EXPECT_FALSE((bool) saplingWitnesses[1]);
+    EXPECT_EQ(-1, wallet.mapWallet[hash].mapSproutNoteData[jsoutpt].witnessHeight);
+    EXPECT_EQ(-1, wallet.mapWallet[hash].mapSaplingNoteData[saplingNotes[0]].witnessHeight);
+    EXPECT_EQ(0, wallet.nWitnessCacheSize);
+}
+
+TEST(WalletTests, WriteWitnessCache) {
+    SelectParams(CBaseChainParams::REGTEST);
+    TestWallet wallet(Params());
+    LOCK(wallet.cs_wallet);
+
+    MockWalletDB walletdb;
+    CBlockLocator loc;
+
+    auto sk = libzcash::SproutSpendingKey::random();
+    wallet.AddSproutSpendingKey(sk);
+
+    auto wtx = GetValidSproutReceive(sk, 10, true);
+    auto note = GetSproutNote(sk, wtx, 0, 1);
+    auto nullifier = note.nullifier(sk);
+
+    mapSproutNoteData_t noteData;
+    JSOutPoint jsoutpt {wtx.GetHash(), 0, 1};
+    SproutNoteData nd {sk.address(), nullifier};
+    noteData[jsoutpt] = nd;
+    wtx.SetSproutNoteData(noteData);
+    wallet.LoadWalletTx(wtx);
+
+    // TxnBegin fails
+    EXPECT_CALL(walletdb, TxnBegin())
+        .WillOnce(Return(false));
+    wallet.SetBestChain(walletdb, loc);
+    EXPECT_CALL(walletdb, TxnBegin())
+        .WillRepeatedly(Return(true));
+
+    // WriteTx fails
+    EXPECT_CALL(walletdb, WriteTx(wtx))
+        .WillOnce(Return(false));
+    EXPECT_CALL(walletdb, TxnAbort())
+        .Times(1);
+    wallet.SetBestChain(walletdb, loc);
+
+    // WriteTx throws
+    EXPECT_CALL(walletdb, WriteTx(wtx))
+        .WillOnce(ThrowLogicError());
+    EXPECT_CALL(walletdb, TxnAbort())
+        .Times(1);
+    wallet.SetBestChain(walletdb, loc);
+    EXPECT_CALL(walletdb, WriteTx(wtx))
+        .WillRepeatedly(Return(true));
+
+    // WriteOrchardWitnesses fails
+    EXPECT_CALL(walletdb, WriteOrchardWitnesses)
+        .WillOnce(Return(false));
+    EXPECT_CALL(walletdb, TxnAbort())
+        .Times(1);
+    wallet.SetBestChain(walletdb, loc);
+
+    // WriteOrchardWitnesses throws
+    EXPECT_CALL(walletdb, WriteOrchardWitnesses)
+        .WillOnce(ThrowLogicError());
+    EXPECT_CALL(walletdb, TxnAbort())
+        .Times(1);
+    wallet.SetBestChain(walletdb, loc);
+    EXPECT_CALL(walletdb, WriteOrchardWitnesses)
+        .WillRepeatedly(Return(true));
+
+    // WriteWitnessCacheSize fails
+    EXPECT_CALL(walletdb, WriteWitnessCacheSize(0))
+        .WillOnce(Return(false));
+    EXPECT_CALL(walletdb, TxnAbort())
+        .Times(1);
+    wallet.SetBestChain(walletdb, loc);
+
+    // WriteWitnessCacheSize throws
+    EXPECT_CALL(walletdb, WriteWitnessCacheSize(0))
+        .WillOnce(ThrowLogicError());
+    EXPECT_CALL(walletdb, TxnAbort())
+        .Times(1);
+    wallet.SetBestChain(walletdb, loc);
+    EXPECT_CALL(walletdb, WriteWitnessCacheSize(0))
+        .WillRepeatedly(Return(true));
+
+    // WriteBestBlock fails
+    EXPECT_CALL(walletdb, WriteBestBlock(loc))
+        .WillOnce(Return(false));
+    EXPECT_CALL(walletdb, TxnAbort())
+        .Times(1);
+    wallet.SetBestChain(walletdb, loc);
+
+    // WriteBestBlock throws
+    EXPECT_CALL(walletdb, WriteBestBlock(loc))
+        .WillOnce(ThrowLogicError());
+    EXPECT_CALL(walletdb, TxnAbort())
+        .Times(1);
+    wallet.SetBestChain(walletdb, loc);
+    EXPECT_CALL(walletdb, WriteBestBlock(loc))
+        .WillRepeatedly(Return(true));
+
+    // TxCommit fails
+    EXPECT_CALL(walletdb, TxnCommit())
+        .WillOnce(Return(false));
+    wallet.SetBestChain(walletdb, loc);
+    EXPECT_CALL(walletdb, TxnCommit())
+        .WillRepeatedly(Return(true));
+
+    // Everything succeeds
+    wallet.SetBestChain(walletdb, loc);
+}
+
+TEST(WalletTests, SetBestChainIgnoresTxsWithoutShieldedData) {
+    SelectParams(CBaseChainParams::REGTEST);
+    TestWallet wallet(Params());
+    LOCK(wallet.cs_wallet);
+
+    MockWalletDB walletdb;
+    CBlockLocator loc;
+
+    // Set up transparent address
+    CKey tsk = AddTestCKeyToKeyStore(wallet);
+    auto scriptPubKey = GetScriptForDestination(tsk.GetPubKey().GetID());
+
+    // Set up a Sprout address
+    auto sk = libzcash::SproutSpendingKey::random();
+    wallet.AddSproutSpendingKey(sk);
+
+    // Generate a transparent transaction that is ours
+    CMutableTransaction t;
+    t.vout.resize(1);
+    t.vout[0].nValue = 90*CENT;
+    t.vout[0].scriptPubKey = scriptPubKey;
+    CWalletTx wtxTransparent {nullptr, t};
+    wallet.LoadWalletTx(wtxTransparent);
+
+    // Generate a Sprout transaction that is ours
+    auto wtxSprout = GetValidSproutReceive(sk, 10, true);
+    auto noteMap = wallet.FindMySproutNotes(wtxSprout);
+    wtxSprout.SetSproutNoteData(noteMap);
+    wallet.LoadWalletTx(wtxSprout);
+
+    // Generate a Sprout transaction that only involves our transparent address
+    auto sk2 = libzcash::SproutSpendingKey::random();
+    auto wtxInput = GetValidSproutReceive(sk2, 10, true);
+    auto note = GetSproutNote(sk2, wtxInput, 0, 0);
+    auto wtxTmp = GetValidSproutSpend(sk2, note, 5);
+    CMutableTransaction mtx {wtxTmp};
+    mtx.vout[0].scriptPubKey = scriptPubKey;
+    mtx.vout[0].nValue = CENT;
+    CWalletTx wtxSproutTransparent {nullptr, mtx};
+    wallet.LoadWalletTx(wtxSproutTransparent);
+
+    // Generate a fake Sapling transaction
+    CMutableTransaction mtxSapling;
+    mtxSapling.fOverwintered = true;
+    mtxSapling.nVersion = SAPLING_TX_VERSION;
+    mtxSapling.nVersionGroupId = SAPLING_VERSION_GROUP_ID;
+    mtxSapling.vShieldedOutput.resize(1);
+    zcash_test_harness_random_jubjub_point(mtxSapling.vShieldedOutput[0].cv.begin());
+    CWalletTx wtxSapling {nullptr, mtxSapling};
+    SetSaplingNoteData(wtxSapling);
+    wallet.LoadWalletTx(wtxSapling);
+
+    // Generate a fake Sapling transaction that would only involve our transparent addresses
+    CMutableTransaction mtxSaplingTransparent;
+    mtxSaplingTransparent.fOverwintered = true;
+    mtxSaplingTransparent.nVersion = SAPLING_TX_VERSION;
+    mtxSaplingTransparent.nVersionGroupId = SAPLING_VERSION_GROUP_ID;
+    mtxSaplingTransparent.vShieldedOutput.resize(1);
+    zcash_test_harness_random_jubjub_point(mtxSaplingTransparent.vShieldedOutput[0].cv.begin());
+    CWalletTx wtxSaplingTransparent {nullptr, mtxSaplingTransparent};
+    wallet.LoadWalletTx(wtxSaplingTransparent);
+
+    EXPECT_CALL(walletdb, TxnBegin())
+        .WillOnce(Return(true));
+    EXPECT_CALL(walletdb, WriteTx(wtxTransparent))
+        .Times(0);
+    EXPECT_CALL(walletdb, WriteTx(wtxSprout))
+        .Times(1).WillOnce(Return(true));
+    EXPECT_CALL(walletdb, WriteTx(wtxSproutTransparent))
+        .Times(0);
+    EXPECT_CALL(walletdb, WriteTx(wtxSapling))
+        .Times(1).WillOnce(Return(true));
+    EXPECT_CALL(walletdb, WriteTx(wtxSaplingTransparent))
+        .Times(0);
+    EXPECT_CALL(walletdb, WriteOrchardWitnesses)
+        .WillOnce(Return(true));
+    EXPECT_CALL(walletdb, WriteWitnessCacheSize(0))
+        .WillOnce(Return(true));
+    EXPECT_CALL(walletdb, WriteBestBlock(loc))
+        .WillOnce(Return(true));
+    EXPECT_CALL(walletdb, TxnCommit())
+        .WillOnce(Return(true));
+    wallet.SetBestChain(walletdb, loc);
+}
+
+TEST(WalletTests, UpdateSproutNullifierNoteMap) {
+    SelectParams(CBaseChainParams::REGTEST);
+    TestWallet wallet(Params());
+    LOCK(wallet.cs_wallet);
+
+    uint256 r {GetRandHash()};
+    CKeyingMaterial vMasterKey (r.begin(), r.end());
+
+    auto sk = libzcash::SproutSpendingKey::random();
+    wallet.AddSproutSpendingKey(sk);
+
+    ASSERT_TRUE(wallet.EncryptKeys(vMasterKey));
+
+    auto wtx = GetValidSproutReceive(sk, 10, true);
+    auto note = GetSproutNote(sk, wtx, 0, 1);
+    auto nullifier = note.nullifier(sk);
+
+    // Pretend that we called FindMySproutNotes while the wallet was locked
+    mapSproutNoteData_t noteData;
+    JSOutPoint jsoutpt {wtx.GetHash(), 0, 1};
+    SproutNoteData nd {sk.address()};
+    noteData[jsoutpt] = nd;
+    wtx.SetSproutNoteData(noteData);
+
+    wallet.LoadWalletTx(wtx);
+    EXPECT_EQ(0, wallet.mapSproutNullifiersToNotes.count(nullifier));
+
+    EXPECT_FALSE(wallet.UpdateNullifierNoteMap());
+
+    ASSERT_TRUE(wallet.Unlock(vMasterKey));
+
+    EXPECT_TRUE(wallet.UpdateNullifierNoteMap());
+    EXPECT_EQ(1, wallet.mapSproutNullifiersToNotes.count(nullifier));
+    EXPECT_EQ(wtx.GetHash(), wallet.mapSproutNullifiersToNotes[nullifier].hash);
+    EXPECT_EQ(0, wallet.mapSproutNullifiersToNotes[nullifier].js);
+    EXPECT_EQ(1, wallet.mapSproutNullifiersToNotes[nullifier].n);
+}
+
+TEST(WalletTests, UpdatedSproutNoteData) {
+    SelectParams(CBaseChainParams::REGTEST);
+    TestWallet wallet(Params());
+    LOCK(wallet.cs_wallet);
+
+    auto sk = libzcash::SproutSpendingKey::random();
+    wallet.AddSproutSpendingKey(sk);
+
+    auto wtx = GetValidSproutReceive(sk, 10, true);
+    auto note = GetSproutNote(sk, wtx, 0, 0);
+    auto note2 = GetSproutNote(sk, wtx, 0, 1);
+    auto nullifier = note.nullifier(sk);
+    auto nullifier2 = note2.nullifier(sk);
+    auto wtx2 = wtx;
+
+    // First pretend we added the tx to the wallet and
+    // we don't have the key for the second note
+    mapSproutNoteData_t noteData;
+    JSOutPoint jsoutpt {wtx.GetHash(), 0, 0};
+    SproutNoteData nd {sk.address(), nullifier};
+    noteData[jsoutpt] = nd;
+    wtx.SetSproutNoteData(noteData);
+
+    // Pretend we mined the tx by adding a fake witness
+    SproutMerkleTree tree;
+    wtx.mapSproutNoteData[jsoutpt].witnesses.push_front(tree.witness());
+    wtx.mapSproutNoteData[jsoutpt].witnessHeight = 100;
+
+    // Now pretend we added the key for the second note, and
+    // the tx was "added" to the wallet again to update it.
+    // This happens via the 'z_importkey' RPC method.
+    JSOutPoint jsoutpt2 {wtx2.GetHash(), 0, 1};
+    SproutNoteData nd2 {sk.address(), nullifier2};
+    noteData[jsoutpt2] = nd2;
+    wtx2.SetSproutNoteData(noteData);
+
+    // The txs should initially be different
+    EXPECT_NE(wtx.mapSproutNoteData, wtx2.mapSproutNoteData);
+    EXPECT_EQ(1, wtx.mapSproutNoteData[jsoutpt].witnesses.size());
+    EXPECT_EQ(100, wtx.mapSproutNoteData[jsoutpt].witnessHeight);
+
+    // After updating, they should be the same
+    EXPECT_TRUE(wallet.UpdatedNoteData(wtx2, wtx));
+    EXPECT_EQ(wtx.mapSproutNoteData, wtx2.mapSproutNoteData);
+    EXPECT_EQ(1, wtx.mapSproutNoteData[jsoutpt].witnesses.size());
+    EXPECT_EQ(100, wtx.mapSproutNoteData[jsoutpt].witnessHeight);
+    // TODO: The new note should get witnessed (but maybe not here) (#1350)
+}
+
+TEST(WalletTests, UpdatedSaplingNoteData) {
+    LoadProofParameters();
+
+    auto consensusParams = RegtestActivateSapling();
+    TestWallet wallet(Params());
+    LOCK2(cs_main, wallet.cs_wallet);
+
+    auto m = GetTestMasterSaplingSpendingKey();
+
+    // Generate dummy Sapling address
+    auto sk = m.Derive(0);
+    auto expsk = sk.expsk;
+    auto extfvk = sk.ToXFVK();
+    auto pa = extfvk.DefaultAddress();
+
+    // Generate dummy recipient Sapling address
+    auto sk2 = m.Derive(1);
+    auto expsk2 = sk2.expsk;
+    auto extfvk2 = sk2.ToXFVK();
+    auto pa2 = extfvk2.DefaultAddress();
+
+    auto testNote = GetTestSaplingNote(pa, 50000);
+
+    // Generate transaction
+    auto builder = TransactionBuilder(consensusParams, 1, std::nullopt);
+    builder.AddSaplingSpend(expsk, testNote.note, testNote.tree.root(), testNote.tree.witness());
+    builder.AddSaplingOutput(extfvk.fvk.ovk, pa2, 25000, {});
+    auto tx = builder.Build().GetTxOrThrow();
+
+    MerkleFrontiers frontiers =  { .sapling = testNote.tree };
+
+    // Wallet contains extfvk1 but not extfvk2
+    CWalletTx wtx {&wallet, tx};
+    ASSERT_TRUE(wallet.AddSaplingZKey(sk));
+    ASSERT_TRUE(wallet.HaveSaplingSpendingKey(extfvk));
+    ASSERT_FALSE(wallet.HaveSaplingSpendingKey(extfvk2));
+
+    // Fake-mine the transaction
+    EXPECT_EQ(-1, chainActive.Height());
+    CBlock block;
+    block.vtx.push_back(wtx);
+    block.hashMerkleRoot = block.BuildMerkleTree();
+    auto blockHash = block.GetHash();
+    CBlockIndex fakeIndex {block};
+    mapBlockIndex.insert(std::make_pair(blockHash, &fakeIndex));
+    chainActive.SetTip(&fakeIndex);
+    EXPECT_TRUE(chainActive.Contains(&fakeIndex));
+    EXPECT_EQ(0, chainActive.Height());
+
+    // Simulate SyncTransaction which calls AddToWalletIfInvolvingMe
+    auto saplingNoteData = wallet.FindMySaplingNotes(wtx, chainActive.Height()).first;
+    ASSERT_TRUE(saplingNoteData.size() == 1); // wallet only has key for change output
+    wtx.SetSaplingNoteData(saplingNoteData);
+    wtx.SetMerkleBranch(block);
+    wallet.LoadWalletTx(wtx);
+
+    // Simulate receiving new block and ChainTip signal
+    wallet.IncrementNoteWitnesses(Params().GetConsensus(), &fakeIndex, &block, frontiers, true);
+    wallet.UpdateSaplingNullifierNoteMapForBlock(&block);
+
+    // Retrieve the updated wtx from wallet
+    uint256 hash = wtx.GetHash();
+    wtx = wallet.mapWallet[hash];
+
+    // Now lets add key extfvk2 so wallet can find the payment note sent to pa2
+    ASSERT_TRUE(wallet.AddSaplingZKey(sk2));
+    ASSERT_TRUE(wallet.HaveSaplingSpendingKey(extfvk2));
+    CWalletTx wtx2 = wtx;
+    auto saplingNoteData2 = wallet.FindMySaplingNotes(wtx2, chainActive.Height()).first;
+    ASSERT_TRUE(saplingNoteData2.size() == 2);
+    wtx2.SetSaplingNoteData(saplingNoteData2);
+
+    // The payment note has not been witnessed yet, so let's fake the witness.
+    SaplingOutPoint sop0(wtx2.GetHash(), 0);
+    SaplingOutPoint sop1(wtx2.GetHash(), 1);
+    wtx2.mapSaplingNoteData[sop0].witnesses.push_front(frontiers.sapling.witness());
+    wtx2.mapSaplingNoteData[sop0].witnessHeight = 0;
+
+    // The txs are different as wtx is aware of just the change output,
+    // whereas wtx2 is aware of both payment and change outputs.
+    EXPECT_NE(wtx.mapSaplingNoteData, wtx2.mapSaplingNoteData);
+    EXPECT_EQ(1, wtx.mapSaplingNoteData.size());
+    EXPECT_EQ(1, wtx.mapSaplingNoteData[sop1].witnesses.size());    // wtx has witness for change
+
+    EXPECT_EQ(2, wtx2.mapSaplingNoteData.size());
+    EXPECT_EQ(1, wtx2.mapSaplingNoteData[sop0].witnesses.size());    // wtx2 has fake witness for payment output
+    EXPECT_EQ(0, wtx2.mapSaplingNoteData[sop1].witnesses.size());    // wtx2 never had incrementnotewitness called
+
+    // After updating, they should be the same
+    EXPECT_TRUE(wallet.UpdatedNoteData(wtx2, wtx));
+
+    // We can't do this:
+    // EXPECT_EQ(wtx.mapSaplingNoteData, wtx2.mapSaplingNoteData);
+    // because nullifiers (if part of == comparator) have not all been computed
+    // Also note that mapwallet[hash] is not updated with the updated wtx.
+   // wtx = wallet.mapWallet[hash];
+
+    EXPECT_EQ(2, wtx.mapSaplingNoteData.size());
+    EXPECT_EQ(2, wtx2.mapSaplingNoteData.size());
+    // wtx copied over the fake witness from wtx2 for the payment output
+    EXPECT_EQ(wtx.mapSaplingNoteData[sop0].witnesses.front(), wtx2.mapSaplingNoteData[sop0].witnesses.front());
+    // wtx2 never had its change output witnessed even though it has been in wtx
+    EXPECT_EQ(0, wtx2.mapSaplingNoteData[sop1].witnesses.size());
+    EXPECT_EQ(wtx.mapSaplingNoteData[sop1].witnesses.front(), frontiers.sapling.witness());
+
+    // Tear down
+    chainActive.SetTip(NULL);
+    mapBlockIndex.erase(blockHash);
+
+    // Revert to default
+    RegtestDeactivateSapling();
+}
+
+TEST(WalletTests, MarkAffectedSproutTransactionsDirty) {
+    SelectParams(CBaseChainParams::REGTEST);
+    TestWallet wallet(Params());
+    LOCK(wallet.cs_wallet);
+
+    auto sk = libzcash::SproutSpendingKey::random();
+    wallet.AddSproutSpendingKey(sk);
+
+    auto wtx = GetValidSproutReceive(sk, 10, true);
+    auto hash = wtx.GetHash();
+    auto note = GetSproutNote(sk, wtx, 0, 1);
+    auto nullifier = note.nullifier(sk);
+    auto wtx2 = GetValidSproutSpend(sk, note, 5);
+
+    mapSproutNoteData_t noteData;
+    JSOutPoint jsoutpt {hash, 0, 1};
+    SproutNoteData nd {sk.address(), nullifier};
+    noteData[jsoutpt] = nd;
+
+    wtx.SetSproutNoteData(noteData);
+    wallet.LoadWalletTx(wtx);
+    wallet.MarkAffectedTransactionsDirty(wtx);
+
+    // After getting a cached value, the first tx should be clean
+    wallet.mapWallet[hash].GetDebit(ISMINE_ALL);
+    EXPECT_TRUE(wallet.mapWallet[hash].fDebitCached);
+
+    // After adding the note spend, the first tx should be dirty
+    wallet.LoadWalletTx(wtx2);
+    wallet.MarkAffectedTransactionsDirty(wtx2);
+    EXPECT_FALSE(wallet.mapWallet[hash].fDebitCached);
+}
+
+TEST(WalletTests, MarkAffectedSaplingTransactionsDirty) {
+    LoadProofParameters();
+
+    auto consensusParams = RegtestActivateSapling();
+    TestWallet wallet(Params());
+    LOCK2(cs_main, wallet.cs_wallet);
+
+    // Generate Sapling address
+    auto sk = GetTestMasterSaplingSpendingKey();
+    auto expsk = sk.expsk;
+    auto extfvk = sk.ToXFVK();
+    auto ivk = extfvk.ToIncomingViewingKey();
+    auto pk = extfvk.DefaultAddress();
+
+    ASSERT_TRUE(wallet.AddSaplingZKey(sk));
+    ASSERT_TRUE(wallet.HaveSaplingSpendingKey(extfvk));
+
+    // Set up transparent address
+    CBasicKeyStore keystore;
+    CKey tsk = AddTestCKeyToKeyStore(keystore);
+    auto scriptPubKey = GetScriptForDestination(tsk.GetPubKey().GetID());
+
+    // Generate shielding tx from transparent to Sapling
+    // 0.0005 t-ZEC in, 0.0004 z-ZEC out, default fee
+    auto builder = TransactionBuilder(consensusParams, 1, std::nullopt, &keystore);
+    builder.AddTransparentInput(COutPoint(), scriptPubKey, 50000);
+    builder.AddSaplingOutput(extfvk.fvk.ovk, pk, 40000, {});
+    auto tx1 = builder.Build().GetTxOrThrow();
+
+    EXPECT_EQ(tx1.vin.size(), 1);
+    EXPECT_EQ(tx1.vout.size(), 0);
+    EXPECT_EQ(tx1.vJoinSplit.size(), 0);
+    EXPECT_EQ(tx1.vShieldedSpend.size(), 0);
+    EXPECT_EQ(tx1.vShieldedOutput.size(), 1);
+    EXPECT_EQ(tx1.GetValueBalanceSapling(), -40000);
+
+    CWalletTx wtx {&wallet, tx1};
+
+    // Fake-mine the transaction
+    EXPECT_EQ(-1, chainActive.Height());
+    MerkleFrontiers frontiers;
+    SproutMerkleTree sproutTree;
+    CBlock block;
+    block.vtx.push_back(wtx);
+    block.hashMerkleRoot = block.BuildMerkleTree();
+    auto blockHash = block.GetHash();
+    CBlockIndex fakeIndex {block};
+    mapBlockIndex.insert(std::make_pair(blockHash, &fakeIndex));
+    chainActive.SetTip(&fakeIndex);
+    EXPECT_TRUE(chainActive.Contains(&fakeIndex));
+    EXPECT_EQ(0, chainActive.Height());
+
+    // Simulate SyncTransaction which calls AddToWalletIfInvolvingMe
+    auto saplingNoteData = wallet.FindMySaplingNotes(wtx, chainActive.Height()).first;
+    ASSERT_TRUE(saplingNoteData.size() > 0);
+    wtx.SetSaplingNoteData(saplingNoteData);
+    wtx.SetMerkleBranch(block);
+    wallet.LoadWalletTx(wtx);
+
+    // Simulate receiving new block and ChainTip signal
+    wallet.IncrementNoteWitnesses(Params().GetConsensus(), &fakeIndex, &block, frontiers, true);
+    wallet.UpdateSaplingNullifierNoteMapForBlock(&block);
+
+    // Retrieve the updated wtx from wallet
+    uint256 hash = wtx.GetHash();
+    wtx = wallet.mapWallet[hash];
+
+    // Prepare to spend the note that was just created
+    auto maybe_pt = libzcash::SaplingNotePlaintext::decrypt(consensusParams, fakeIndex.nHeight, tx1.vShieldedOutput[0].encCiphertext, ivk, tx1.vShieldedOutput[0].ephemeralKey, tx1.vShieldedOutput[0].cmu);
+    ASSERT_EQ(static_cast<bool>(maybe_pt), true);
+    auto maybe_note = maybe_pt.value().note(ivk);
+    ASSERT_EQ(static_cast<bool>(maybe_note), true);
+    auto note = maybe_note.value();
+    auto anchor = frontiers.sapling.root();
+    auto witness = frontiers.sapling.witness();
+
+    // Create a Sapling-only transaction
+    // 0.0004 z-ZEC in, 0.00025 z-ZEC out, default fee, 0.00005 z-ZEC change
+    auto builder2 = TransactionBuilder(consensusParams, 2, std::nullopt);
+    builder2.AddSaplingSpend(expsk, note, anchor, witness);
+    builder2.AddSaplingOutput(extfvk.fvk.ovk, pk, 25000, {});
+    auto tx2 = builder2.Build().GetTxOrThrow();
+
+    EXPECT_EQ(tx2.vin.size(), 0);
+    EXPECT_EQ(tx2.vout.size(), 0);
+    EXPECT_EQ(tx2.vJoinSplit.size(), 0);
+    EXPECT_EQ(tx2.vShieldedSpend.size(), 1);
+    EXPECT_EQ(tx2.vShieldedOutput.size(), 2);
+    EXPECT_EQ(tx2.GetValueBalanceSapling(), 10000);
+
+    CWalletTx wtx2 {&wallet, tx2};
+    auto hash2 = wtx2.GetHash();
+
+    wallet.MarkAffectedTransactionsDirty(wtx);
+
+    // After getting a cached value, the first tx should be clean
+    wallet.mapWallet[hash].GetDebit(ISMINE_ALL);
+    EXPECT_TRUE(wallet.mapWallet[hash].fDebitCached);
+
+    // After adding the note spend, the first tx should be dirty
+    wallet.LoadWalletTx(wtx2);
+    wallet.MarkAffectedTransactionsDirty(wtx2);
+    EXPECT_FALSE(wallet.mapWallet[hash].fDebitCached);
+
+    // Tear down
+    chainActive.SetTip(NULL);
+    mapBlockIndex.erase(blockHash);
+
+    // Revert to default
+    RegtestDeactivateSapling();
+}
+
+TEST(WalletTests, SproutNoteLocking) {
+    SelectParams(CBaseChainParams::REGTEST);
+    TestWallet wallet(Params());
+    LOCK(wallet.cs_wallet);
+
+    auto sk = libzcash::SproutSpendingKey::random();
+    wallet.AddSproutSpendingKey(sk);
+
+    auto wtx = GetValidSproutReceive(sk, 10, true);
+    auto wtx2 = GetValidSproutReceive(sk, 10, true);
+
+    JSOutPoint jsoutpt {wtx.GetHash(), 0, 0};
+    JSOutPoint jsoutpt2 {wtx2.GetHash(),0, 0};
+
+    // Test selective locking
+    wallet.LockNote(jsoutpt);
+    EXPECT_TRUE(wallet.IsLockedNote(jsoutpt));
+    EXPECT_FALSE(wallet.IsLockedNote(jsoutpt2));
+
+    // Test selective unlocking
+    wallet.UnlockNote(jsoutpt);
+    EXPECT_FALSE(wallet.IsLockedNote(jsoutpt));
+
+    // Test multiple locking
+    wallet.LockNote(jsoutpt);
+    wallet.LockNote(jsoutpt2);
+    EXPECT_TRUE(wallet.IsLockedNote(jsoutpt));
+    EXPECT_TRUE(wallet.IsLockedNote(jsoutpt2));
+
+    // Test unlock all
+    wallet.UnlockAllSproutNotes();
+    EXPECT_FALSE(wallet.IsLockedNote(jsoutpt));
+    EXPECT_FALSE(wallet.IsLockedNote(jsoutpt2));
+}
+
+TEST(WalletTests, SaplingNoteLocking) {
+    SelectParams(CBaseChainParams::REGTEST);
+    TestWallet wallet(Params());
+    LOCK(wallet.cs_wallet);
+
+    SaplingOutPoint sop1 {uint256(), 1};
+    SaplingOutPoint sop2 {uint256(), 2};
+
+    // Test selective locking
+    wallet.LockNote(sop1);
+    EXPECT_TRUE(wallet.IsLockedNote(sop1));
+    EXPECT_FALSE(wallet.IsLockedNote(sop2));
+
+    // Test selective unlocking
+    wallet.UnlockNote(sop1);
+    EXPECT_FALSE(wallet.IsLockedNote(sop1));
+
+    // Test multiple locking
+    wallet.LockNote(sop1);
+    wallet.LockNote(sop2);
+    EXPECT_TRUE(wallet.IsLockedNote(sop1));
+    EXPECT_TRUE(wallet.IsLockedNote(sop2));
+
+    // Test list
+    auto v = wallet.ListLockedSaplingNotes();
+    EXPECT_EQ(v.size(), 2);
+    EXPECT_TRUE(std::find(v.begin(), v.end(), sop1) != v.end());
+    EXPECT_TRUE(std::find(v.begin(), v.end(), sop2) != v.end());
+
+    // Test unlock all
+    wallet.UnlockAllSaplingNotes();
+    EXPECT_FALSE(wallet.IsLockedNote(sop1));
+    EXPECT_FALSE(wallet.IsLockedNote(sop2));
+}
+
+TEST(WalletTests, GenerateUnifiedAddress) {
+    (void) RegtestActivateSapling();
+    TestWallet wallet(Params());
+
+    auto uaResult = wallet.GenerateUnifiedAddress(0, {ReceiverType::P2PKH, ReceiverType::Sapling});
+
+    // If the wallet does not have a mnemonic seed available, it is
+    // treated as if the wallet is encrypted.
+    EXPECT_FALSE(wallet.IsCrypted());
+    EXPECT_FALSE(wallet.GetMnemonicSeed().has_value());
+    WalletUAGenerationResult expected = WalletUAGenerationError::WalletEncrypted;
+    EXPECT_EQ(uaResult, expected);
+
+    wallet.GenerateNewSeed();
+    EXPECT_FALSE(wallet.IsCrypted());
+    EXPECT_TRUE(wallet.GetMnemonicSeed().has_value());
+
+    // If the user has not generated a unified spending key,
+    // we cannot create an address for the account corresponding
+    // to that spending key.
+    uaResult = wallet.GenerateUnifiedAddress(0, {ReceiverType::P2PKH, ReceiverType::Sapling});
+    expected = WalletUAGenerationError::NoSuchAccount;
+    EXPECT_EQ(uaResult, expected);
+
+    // lock required by GenerateNewUnifiedSpendingKey
+    LOCK(wallet.cs_wallet);
+
+    // Create an account, then generate an address for that account.
+    auto ufvkpair = wallet.GenerateNewUnifiedSpendingKey();
+    auto ufvk = ufvkpair.first;
+    auto account = ufvkpair.second;
+    uaResult = wallet.GenerateUnifiedAddress(account, {ReceiverType::P2PKH, ReceiverType::Sapling});
+    auto ua = std::get_if<std::pair<libzcash::UnifiedAddress, libzcash::diversifier_index_t>>(&uaResult);
+    EXPECT_NE(ua, nullptr);
+
+    auto uaSaplingReceiver = ua->first.GetSaplingReceiver();
+    EXPECT_TRUE(uaSaplingReceiver.has_value());
+    EXPECT_EQ(uaSaplingReceiver.value(), ufvk.GetSaplingKey().value().Address(ua->second));
+
+    auto u4r = wallet.FindUnifiedAddressByReceiver(uaSaplingReceiver.value());
+    EXPECT_TRUE(u4r.has_value());
+    EXPECT_EQ(u4r.value(), ua->first);
+
+    // Explicitly trigger the invalid transparent child index failure
+    uaResult = wallet.GenerateUnifiedAddress(
+            0,
+            {ReceiverType::P2PKH, ReceiverType::Sapling},
+            MAX_TRANSPARENT_CHILD_IDX.succ().value());
+    expected = UnifiedAddressGenerationError::InvalidTransparentChildIndex;
+    EXPECT_EQ(uaResult, expected);
+
+    // Attempt to generate a UA at the maximum transparent child index. This might fail
+    // due to this index being invalid for Sapling; if so, it will return an error that
+    // the diversifier index is out of range. If it succeeds, we'll attempt to generate
+    // the next available diversifier, and this should always fail
+    uaResult = wallet.GenerateUnifiedAddress(
+            0,
+            {ReceiverType::P2PKH, ReceiverType::Sapling},
+            MAX_TRANSPARENT_CHILD_IDX);
+    ua = std::get_if<std::pair<libzcash::UnifiedAddress, libzcash::diversifier_index_t>>(&uaResult);
+    if (ua == nullptr) {
+        expected = UnifiedAddressGenerationError::NoAddressForDiversifier;
+        EXPECT_EQ(uaResult, expected);
+    } else {
+        // the previous generation attempt succeeded, so this one should definitely fail.
+        uaResult = wallet.GenerateUnifiedAddress(0, {ReceiverType::P2PKH, ReceiverType::Sapling});
+        expected = UnifiedAddressGenerationError::InvalidTransparentChildIndex;
+        EXPECT_EQ(uaResult, expected);
+    }
+
+    // Revert to default
+    RegtestDeactivateSapling();
+}
+
+TEST(WalletTests, GenerateUnifiedSpendingKeyAddsOrchardAddresses) {
+    (void) RegtestActivateSapling();
+    TestWallet wallet(Params());
+    wallet.GenerateNewSeed();
+
+    // lock required by GenerateNewUnifiedSpendingKey
+    LOCK(wallet.cs_wallet);
+
+    // Create an account.
+    auto ufvkpair = wallet.GenerateNewUnifiedSpendingKey();
+    auto ufvk = ufvkpair.first;
+    auto account = ufvkpair.second;
+    auto fvk = ufvk.GetOrchardKey();
+    EXPECT_TRUE(fvk.has_value());
+
+    // At this point the Orchard wallet should contain the change address, but
+    // no other addresses. We detect this by trying to look up their IVKs.
+    auto changeAddr = fvk->ToInternalIncomingViewingKey().Address(libzcash::diversifier_index_t{0});
+    auto internalIvk = wallet.GetOrchardWallet().GetIncomingViewingKeyForAddress(changeAddr);
+    EXPECT_TRUE(internalIvk.has_value());
+    EXPECT_EQ(internalIvk.value(), fvk->ToInternalIncomingViewingKey());
+    auto externalAddr = fvk->ToIncomingViewingKey().Address(libzcash::diversifier_index_t{0});
+    auto externalIvk = wallet.GetOrchardWallet().GetIncomingViewingKeyForAddress(externalAddr);
+    EXPECT_FALSE(externalIvk.has_value());
+
+    // Generate an address.
+    auto uaResult = wallet.GenerateUnifiedAddress(account, {ReceiverType::Orchard});
+    auto ua = std::get_if<std::pair<libzcash::UnifiedAddress, libzcash::diversifier_index_t>>(&uaResult);
+    EXPECT_NE(ua, nullptr);
+
+    auto uaOrchardReceiver = ua->first.GetOrchardReceiver();
+    EXPECT_TRUE(uaOrchardReceiver.has_value());
+    EXPECT_EQ(uaOrchardReceiver.value(), externalAddr);
+
+    // Now we can look up the external IVK.
+    externalIvk = wallet.GetOrchardWallet().GetIncomingViewingKeyForAddress(externalAddr);
+    EXPECT_TRUE(externalIvk.has_value());
+    EXPECT_EQ(externalIvk.value(), fvk->ToIncomingViewingKey());
+
+    // Revert to default
+    RegtestDeactivateSapling();
+}
diff --git a/depend/zcash/src/wallet/gtest/test_wallet_zkeys.cpp b/depend/zcash/src/wallet/gtest/test_wallet_zkeys.cpp
new file mode 100644
index 000000000..5a2ce53da
--- /dev/null
+++ b/depend/zcash/src/wallet/gtest/test_wallet_zkeys.cpp
@@ -0,0 +1,531 @@
+#include <gtest/gtest.h>
+
+#include "fs.h"
+#include "db.h"
+#include "zcash/Address.hpp"
+#include "wallet/wallet.h"
+#include "wallet/walletdb.h"
+#include "util.h"
+
+/**
+ * This test covers Sapling methods on CWallet
+ * GenerateNewLegacySaplingZKey()
+ * AddSaplingZKey()
+ * AddSaplingPaymentAddress()
+ * LoadSaplingZKey()
+ * LoadSaplingIncomingViewingKey()
+ * LoadSaplingZKeyMetadata()
+ */
+
+TEST(WalletZkeysTest, StoreAndLoadSaplingZkeys) {
+
+    SelectParams(CBaseChainParams::MAIN);
+
+    CWallet wallet(Params());
+    LOCK(wallet.cs_wallet);
+
+    // wallet should be empty
+    std::set<libzcash::SaplingPaymentAddress> addrs;
+    wallet.GetSaplingPaymentAddresses(addrs);
+    ASSERT_EQ(0, addrs.size());
+
+    // No HD seed in the wallet
+    EXPECT_ANY_THROW(wallet.GenerateNewLegacySaplingZKey());
+
+    // Add a random seed to the wallet.
+    wallet.GenerateNewSeed();
+    auto seed = wallet.GetMnemonicSeed().value();
+
+    // Now this call succeeds
+    auto address = wallet.GenerateNewLegacySaplingZKey();
+
+    // wallet should have one key
+    wallet.GetSaplingPaymentAddresses(addrs);
+    ASSERT_EQ(1, addrs.size());
+
+    // verify wallet has incoming viewing key for the address
+    ASSERT_TRUE(wallet.HaveSaplingIncomingViewingKey(address));
+
+    // manually add new spending key to wallet
+    auto m = libzcash::SaplingExtendedSpendingKey::Master(seed);
+    auto sk = m.Derive(0);
+    ASSERT_TRUE(wallet.AddSaplingZKey(sk));
+
+    // verify wallet did add it
+    auto extfvk = sk.ToXFVK();
+    ASSERT_TRUE(wallet.HaveSaplingSpendingKey(extfvk));
+
+    // verify spending key stored correctly
+    libzcash::SaplingExtendedSpendingKey keyOut;
+    wallet.GetSaplingSpendingKey(extfvk, keyOut);
+    ASSERT_EQ(sk, keyOut);
+
+    // verify there is still only one address; adding the spending
+    // key no longer adds the default address
+    wallet.GetSaplingPaymentAddresses(addrs);
+    EXPECT_EQ(1, addrs.size());
+    EXPECT_EQ(1, addrs.count(address));
+
+    // Find a diversified address that does not use the same diversifier as the default address.
+    // By starting our search at `128` we ensure there's no more than a 2^-128 chance that we
+    // collide with the default diversifier.
+    libzcash::diversifier_index_t j(128);
+    auto dpa = sk.ToXFVK().FindAddress(j).first;
+
+    // add the default address
+    EXPECT_TRUE(wallet.AddSaplingPaymentAddress(sk.ToXFVK().ToIncomingViewingKey(), sk.ToXFVK().DefaultAddress()));
+
+    // verify wallet only has the default address
+    EXPECT_TRUE(wallet.HaveSaplingIncomingViewingKey(sk.ToXFVK().DefaultAddress()));
+    EXPECT_FALSE(wallet.HaveSaplingIncomingViewingKey(dpa));
+
+    // manually add a diversified address
+    auto ivk = extfvk.ToIncomingViewingKey();
+    EXPECT_TRUE(wallet.AddSaplingPaymentAddress(ivk, dpa));
+
+    // verify wallet did add it
+    EXPECT_TRUE(wallet.HaveSaplingIncomingViewingKey(sk.ToXFVK().DefaultAddress()));
+    EXPECT_TRUE(wallet.HaveSaplingIncomingViewingKey(dpa));
+
+    // Load a third key into the wallet
+    auto sk2 = m.Derive(1);
+    ASSERT_TRUE(wallet.LoadSaplingZKey(sk2));
+
+    // attach metadata to this third key
+    auto ivk2 = sk2.expsk.full_viewing_key().in_viewing_key();
+    int64_t now = GetTime();
+    CKeyMetadata meta(now);
+    wallet.LoadSaplingZKeyMetadata(ivk2, meta);
+
+    // check metadata is the same
+    ASSERT_EQ(wallet.mapSaplingZKeyMetadata[ivk2].nCreateTime, now);
+
+    // Load a diversified address for the third key into the wallet
+    auto dpa2 = sk2.ToXFVK().FindAddress(j).first;
+    EXPECT_FALSE(wallet.HaveSaplingIncomingViewingKey(sk2.ToXFVK().DefaultAddress()));
+    EXPECT_FALSE(wallet.HaveSaplingIncomingViewingKey(dpa2));
+    EXPECT_TRUE(wallet.LoadSaplingPaymentAddress(dpa2, ivk2));
+    EXPECT_TRUE(wallet.HaveSaplingIncomingViewingKey(dpa2));
+}
+
+/**
+ * This test covers methods on CWallet
+ * GenerateNewSproutZKey()
+ * AddSproutZKey()
+ * LoadZKey()
+ * LoadZKeyMetadata()
+ */
+TEST(WalletZkeysTest, StoreAndLoadZkeys) {
+    SelectParams(CBaseChainParams::MAIN);
+
+    CWallet wallet(Params());
+    LOCK(wallet.cs_wallet);
+
+    // wallet should be empty
+    std::set<libzcash::SproutPaymentAddress> addrs;
+    wallet.GetSproutPaymentAddresses(addrs);
+    ASSERT_EQ(0, addrs.size());
+
+    // wallet should have one key
+    auto addr = wallet.GenerateNewSproutZKey();
+    wallet.GetSproutPaymentAddresses(addrs);
+    ASSERT_EQ(1, addrs.size());
+
+    // verify wallet has spending key for the address
+    ASSERT_TRUE(wallet.HaveSproutSpendingKey(addr));
+
+    // manually add new spending key to wallet
+    auto sk = libzcash::SproutSpendingKey::random();
+    ASSERT_TRUE(wallet.AddSproutZKey(sk));
+
+    // verify wallet did add it
+    addr = sk.address();
+    ASSERT_TRUE(wallet.HaveSproutSpendingKey(addr));
+
+    // verify spending key stored correctly
+    libzcash::SproutSpendingKey keyOut;
+    wallet.GetSproutSpendingKey(addr, keyOut);
+    ASSERT_EQ(sk, keyOut);
+
+    // verify there are two keys
+    wallet.GetSproutPaymentAddresses(addrs);
+    ASSERT_EQ(2, addrs.size());
+    ASSERT_EQ(1, addrs.count(addr));
+
+    // Load a third key into the wallet
+    sk = libzcash::SproutSpendingKey::random();
+    ASSERT_TRUE(wallet.LoadZKey(sk));
+
+    // attach metadata to this third key
+    addr = sk.address();
+    int64_t now = GetTime();
+    CKeyMetadata meta(now);
+    wallet.LoadZKeyMetadata(addr, meta);
+
+    // check metadata is the same
+    CKeyMetadata m= wallet.mapSproutZKeyMetadata[addr];
+    ASSERT_EQ(m.nCreateTime, now);
+}
+
+/**
+ * This test covers methods on CWallet
+ * AddSproutViewingKey()
+ * RemoveSproutViewingKey()
+ * LoadSproutViewingKey()
+ */
+TEST(WalletZkeysTest, StoreAndLoadViewingKeys) {
+    SelectParams(CBaseChainParams::MAIN);
+
+    CWallet wallet(Params());
+    LOCK(wallet.cs_wallet);
+
+    // wallet should be empty
+    std::set<libzcash::SproutPaymentAddress> addrs;
+    wallet.GetSproutPaymentAddresses(addrs);
+    ASSERT_EQ(0, addrs.size());
+
+    // manually add new viewing key to wallet
+    auto sk = libzcash::SproutSpendingKey::random();
+    auto vk = sk.viewing_key();
+    ASSERT_TRUE(wallet.AddSproutViewingKey(vk));
+
+    // verify wallet did add it
+    auto addr = sk.address();
+    ASSERT_TRUE(wallet.HaveSproutViewingKey(addr));
+    // and that we don't have the corresponding spending key
+    ASSERT_FALSE(wallet.HaveSproutSpendingKey(addr));
+
+    // verify viewing key stored correctly
+    libzcash::SproutViewingKey vkOut;
+    wallet.GetSproutViewingKey(addr, vkOut);
+    ASSERT_EQ(vk, vkOut);
+
+    // Load a second viewing key into the wallet
+    auto sk2 = libzcash::SproutSpendingKey::random();
+    ASSERT_TRUE(wallet.LoadSproutViewingKey(sk2.viewing_key()));
+
+    // verify wallet did add it
+    auto addr2 = sk2.address();
+    ASSERT_TRUE(wallet.HaveSproutViewingKey(addr2));
+    ASSERT_FALSE(wallet.HaveSproutSpendingKey(addr2));
+
+    // Remove the first viewing key
+    ASSERT_TRUE(wallet.RemoveSproutViewingKey(vk));
+    ASSERT_FALSE(wallet.HaveSproutViewingKey(addr));
+    ASSERT_TRUE(wallet.HaveSproutViewingKey(addr2));
+}
+
+/**
+ * This test covers methods on CWalletDB
+ * WriteZKey()
+ */
+TEST(WalletZkeysTest, WriteZkeyDirectToDb) {
+    SelectParams(CBaseChainParams::TESTNET);
+
+    // Get temporary and unique path for file.
+    // Note: / operator to append paths
+    fs::path pathTemp = fs::temp_directory_path() / fs::unique_path();
+    fs::create_directories(pathTemp);
+    mapArgs["-datadir"] = pathTemp.string();
+
+    bool fFirstRun, fFirstRunDummy;
+    CWallet dummyWallet(Params(), "wallet_direct_zkey_test.dat");
+    dummyWallet.LoadWallet(fFirstRunDummy);
+    bitdb.RemoveDb("wallet_direct_zkey_test.dat");
+    CWallet wallet(Params(), "wallet_direct_zkey_test.dat");
+    LOCK(wallet.cs_wallet);
+    ASSERT_EQ(DB_LOAD_OK, wallet.LoadWallet(fFirstRun));
+
+    // No default CPubKey set
+    ASSERT_TRUE(fFirstRun);
+
+    // wallet should be empty
+    std::set<libzcash::SproutPaymentAddress> addrs;
+    wallet.GetSproutPaymentAddresses(addrs);
+    ASSERT_EQ(0, addrs.size());
+
+    // Add random key to the wallet
+    auto paymentAddress = wallet.GenerateNewSproutZKey();
+
+    // wallet should have one key
+    wallet.GetSproutPaymentAddresses(addrs);
+    ASSERT_EQ(1, addrs.size());
+
+    // create random key and add it to database directly, bypassing wallet
+    auto sk = libzcash::SproutSpendingKey::random();
+    auto addr = sk.address();
+    int64_t now = GetTime();
+    CKeyMetadata meta(now);
+    CWalletDB db("wallet_direct_zkey_test.dat");
+    db.WriteZKey(addr, sk, meta);
+
+    // wallet should not be aware of key
+    ASSERT_FALSE(wallet.HaveSproutSpendingKey(addr));
+
+    // wallet sees one key
+    wallet.GetSproutPaymentAddresses(addrs);
+    ASSERT_EQ(1, addrs.size());
+
+    // wallet should have default metadata for addr with null createtime
+    CKeyMetadata m = wallet.mapSproutZKeyMetadata[addr];
+    ASSERT_EQ(m.nCreateTime, 0);
+    ASSERT_NE(m.nCreateTime, now);
+
+    // load the wallet again
+    ASSERT_EQ(DB_LOAD_OK, wallet.LoadWallet(fFirstRun));
+
+    // wallet can now see the spending key
+    ASSERT_TRUE(wallet.HaveSproutSpendingKey(addr));
+
+    // check key is the same
+    libzcash::SproutSpendingKey keyOut;
+    wallet.GetSproutSpendingKey(addr, keyOut);
+    ASSERT_EQ(sk, keyOut);
+
+    // wallet should have two keys
+    wallet.GetSproutPaymentAddresses(addrs);
+    ASSERT_EQ(2, addrs.size());
+
+    // check metadata is now the same
+    m = wallet.mapSproutZKeyMetadata[addr];
+    ASSERT_EQ(m.nCreateTime, now);
+}
+
+/**
+ * This test covers methods on CWalletDB
+ * WriteSproutViewingKey()
+ */
+TEST(WalletZkeysTest, WriteViewingKeyDirectToDB) {
+    SelectParams(CBaseChainParams::TESTNET);
+
+    // Get temporary and unique path for file.
+    // Note: / operator to append paths
+    fs::path pathTemp = fs::temp_directory_path() / fs::unique_path();
+    fs::create_directories(pathTemp);
+    mapArgs["-datadir"] = pathTemp.string();
+
+    bool fFirstRun, fFirstRunDummy;
+    CWallet dummyWallet(Params(), "wallet-vkey.dat");
+    dummyWallet.LoadWallet(fFirstRunDummy);
+    bitdb.RemoveDb("wallet-vkey.dat");
+    CWallet wallet(Params(), "wallet-vkey.dat");
+    LOCK(wallet.cs_wallet);
+    ASSERT_EQ(DB_LOAD_OK, wallet.LoadWallet(fFirstRun));
+
+    // No default CPubKey set
+    ASSERT_TRUE(fFirstRun);
+
+    // create random viewing key and add it to database directly, bypassing wallet
+    auto sk = libzcash::SproutSpendingKey::random();
+    auto vk = sk.viewing_key();
+    auto addr = sk.address();
+    int64_t now = GetTime();
+    CKeyMetadata meta(now);
+    CWalletDB db("wallet-vkey.dat");
+    db.WriteSproutViewingKey(vk);
+
+    // wallet should not be aware of viewing key
+    ASSERT_FALSE(wallet.HaveSproutViewingKey(addr));
+
+    // load the wallet again
+    ASSERT_EQ(DB_LOAD_OK, wallet.LoadWallet(fFirstRun));
+
+    // wallet can now see the viewing key
+    ASSERT_TRUE(wallet.HaveSproutViewingKey(addr));
+
+    // check key is the same
+    libzcash::SproutViewingKey vkOut;
+    wallet.GetSproutViewingKey(addr, vkOut);
+    ASSERT_EQ(vk, vkOut);
+}
+
+
+
+/**
+ * This test covers methods on CWalletDB to load/save crypted z keys.
+ */
+TEST(WalletZkeysTest, WriteCryptedzkeyDirectToDb) {
+
+    SelectParams(CBaseChainParams::TESTNET);
+
+    // Get temporary and unique path for file.
+    // Note: / operator to append paths
+    fs::path pathTemp = fs::temp_directory_path() / fs::unique_path();
+    fs::create_directories(pathTemp);
+    mapArgs["-datadir"] = pathTemp.string();
+
+    bool fFirstRun, fFirstRunDummy;
+    CWallet dummyWallet(Params(), "wallet_crypted.dat");
+    dummyWallet.LoadWallet(fFirstRunDummy);
+    bitdb.RemoveDb("wallet_crypted.dat");
+    CWallet wallet(Params(), "wallet_crypted.dat");
+    LOCK(wallet.cs_wallet);
+    ASSERT_EQ(DB_LOAD_OK, wallet.LoadWallet(fFirstRun));
+
+    // No default CPubKey set
+    ASSERT_TRUE(fFirstRun);
+
+    // wallet should be empty
+    std::set<libzcash::SproutPaymentAddress> addrs;
+    wallet.GetSproutPaymentAddresses(addrs);
+    ASSERT_EQ(0, addrs.size());
+
+    // Add random key to the wallet
+    auto paymentAddress = wallet.GenerateNewSproutZKey();
+
+    // wallet should have one key
+    wallet.GetSproutPaymentAddresses(addrs);
+    ASSERT_EQ(1, addrs.size());
+
+    // encrypt wallet
+    SecureString strWalletPass;
+    strWalletPass.reserve(100);
+    strWalletPass = "hello";
+    ASSERT_TRUE(wallet.EncryptWallet(strWalletPass));
+
+    // adding a new key will fail as the wallet is locked
+    EXPECT_ANY_THROW(wallet.GenerateNewSproutZKey());
+
+    // unlock wallet and then add
+    wallet.Unlock(strWalletPass);
+    auto paymentAddress2 = wallet.GenerateNewSproutZKey();
+
+    // Create a new wallet from the existing wallet path
+    CWallet wallet2(Params(), "wallet_crypted.dat");
+    ASSERT_EQ(DB_LOAD_OK, wallet2.LoadWallet(fFirstRun));
+
+    // Confirm it's not the same as the other wallet
+    ASSERT_TRUE(&wallet != &wallet2);
+
+    // wallet should have two keys
+    wallet2.GetSproutPaymentAddresses(addrs);
+    ASSERT_EQ(2, addrs.size());
+
+    // check we have entries for our payment addresses
+    ASSERT_TRUE(addrs.count(paymentAddress));
+    ASSERT_TRUE(addrs.count(paymentAddress2));
+
+    // spending key is crypted, so we can't extract valid payment address
+    libzcash::SproutSpendingKey keyOut;
+    wallet2.GetSproutSpendingKey(paymentAddress, keyOut);
+    ASSERT_FALSE(paymentAddress == keyOut.address());
+
+    // unlock wallet to get spending keys and verify payment addresses
+    wallet2.Unlock(strWalletPass);
+
+    wallet2.GetSproutSpendingKey(paymentAddress, keyOut);
+    ASSERT_EQ(paymentAddress, keyOut.address());
+
+    wallet2.GetSproutSpendingKey(paymentAddress2, keyOut);
+    ASSERT_EQ(paymentAddress2, keyOut.address());
+}
+
+/**
+ * This test covers methods on CWalletDB to load/save crypted sapling z keys.
+ */
+TEST(WalletZkeysTest, WriteCryptedSaplingZkeyDirectToDb) {
+    SelectParams(CBaseChainParams::TESTNET);
+
+    // Get temporary and unique path for file.
+    // Note: / operator to append paths
+    fs::path pathTemp = fs::temp_directory_path() / fs::unique_path();
+    fs::create_directories(pathTemp);
+    mapArgs["-datadir"] = pathTemp.string();
+
+    bool fFirstRun, fFirstRunDummy;
+    CWallet dummyWallet(Params(), "wallet_crypted_sapling.dat");
+    dummyWallet.LoadWallet(fFirstRunDummy);
+    bitdb.RemoveDb("wallet_crypted_sapling.dat");
+    CWallet wallet(Params(), "wallet_crypted_sapling.dat");
+    LOCK(wallet.cs_wallet);
+    ASSERT_EQ(DB_LOAD_OK, wallet.LoadWallet(fFirstRun));
+
+     // No default CPubKey set
+    ASSERT_TRUE(fFirstRun);
+
+    ASSERT_FALSE(wallet.HaveMnemonicSeed());
+
+    // Add a mnemonic seed to the wallet.
+    wallet.GenerateNewSeed();
+    ASSERT_TRUE(wallet.HaveMnemonicSeed());
+
+    // wallet should be empty
+    std::set<libzcash::SaplingPaymentAddress> addrs;
+    wallet.GetSaplingPaymentAddresses(addrs);
+    ASSERT_EQ(0, addrs.size());
+
+    // Add random key to the wallet
+    auto address = wallet.GenerateNewLegacySaplingZKey();
+
+    // wallet should have one key
+    wallet.GetSaplingPaymentAddresses(addrs);
+    ASSERT_EQ(1, addrs.size());
+
+    // Find a diversified address that does not use the same diversifier as the default address.
+    // By starting our search at `128` we ensure there's no more than a 2^-128 chance that we
+    // collide with the default diversifier.
+    libzcash::SaplingExtendedSpendingKey extsk;
+    EXPECT_TRUE(wallet.GetSaplingExtendedSpendingKey(address, extsk));
+    libzcash::diversifier_index_t j(128);
+    auto dpa = extsk.ToXFVK().FindAddress(j).first;
+
+    // Add diversified address to the wallet
+    auto ivk = extsk.expsk.full_viewing_key().in_viewing_key();
+    EXPECT_TRUE(wallet.AddSaplingPaymentAddress(ivk, dpa));
+
+    // encrypt wallet
+    SecureString strWalletPass;
+    strWalletPass.reserve(100);
+    strWalletPass = "hello";
+    ASSERT_TRUE(wallet.EncryptWallet(strWalletPass));
+
+    // adding a new key will fail as the wallet is locked
+    EXPECT_ANY_THROW(wallet.GenerateNewLegacySaplingZKey());
+
+    // unlock wallet and then add
+    wallet.Unlock(strWalletPass);
+    auto address2 = wallet.GenerateNewLegacySaplingZKey();
+
+    // wallet should have three addresses: the default addresses for the two
+    // generated keys, and the added diversified address.
+    wallet.GetSaplingPaymentAddresses(addrs);
+    ASSERT_EQ(3, addrs.size());
+
+    // flush the wallet to prevent race conditions
+    wallet.Flush();
+
+    // Create a new wallet from the existing wallet path
+    CWallet wallet2(Params(), "wallet_crypted_sapling.dat");
+    ASSERT_EQ(DB_LOAD_OK, wallet2.LoadWallet(fFirstRun));
+
+    // Confirm it's not the same as the other wallet
+    ASSERT_TRUE(&wallet != &wallet2);
+    ASSERT_TRUE(wallet2.HaveMnemonicSeed());
+
+    // wallet should have three addresses
+    wallet2.GetSaplingPaymentAddresses(addrs);
+    ASSERT_EQ(3, addrs.size());
+
+    //check we have entries for our payment addresses
+    ASSERT_TRUE(addrs.count(address));
+    ASSERT_TRUE(addrs.count(address2));
+    ASSERT_TRUE(addrs.count(dpa));
+
+    // spending key is crypted, so we can't extract valid payment address
+    libzcash::SaplingExtendedSpendingKey keyOut;
+    EXPECT_FALSE(wallet2.GetSaplingExtendedSpendingKey(address, keyOut));
+
+    // address -> ivk mapping is not crypted
+    libzcash::SaplingIncomingViewingKey ivkOut;
+    EXPECT_TRUE(wallet2.GetSaplingIncomingViewingKey(dpa, ivkOut));
+    EXPECT_EQ(ivk, ivkOut);
+
+    // unlock wallet to get spending keys and verify payment addresses
+    wallet2.Unlock(strWalletPass);
+
+    EXPECT_TRUE(wallet2.GetSaplingExtendedSpendingKey(address, keyOut));
+    ASSERT_EQ(address, keyOut.ToXFVK().DefaultAddress());
+
+    EXPECT_TRUE(wallet2.GetSaplingExtendedSpendingKey(address2, keyOut));
+    ASSERT_EQ(address2, keyOut.ToXFVK().DefaultAddress());
+}
diff --git a/depend/zcash/src/wallet/orchard.cpp b/depend/zcash/src/wallet/orchard.cpp
new file mode 100644
index 000000000..75413ca24
--- /dev/null
+++ b/depend/zcash/src/wallet/orchard.cpp
@@ -0,0 +1,43 @@
+// Copyright (c) 2022 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "wallet/orchard.h"
+
+std::optional<libzcash::OrchardSpendingKey> OrchardWallet::GetSpendingKeyForAddress(
+    const libzcash::OrchardRawAddress& addr) const
+{
+    auto skPtr = orchard_wallet_get_spending_key_for_address(inner.get(), addr.inner.get());
+    if (skPtr == nullptr) return std::nullopt;
+    return libzcash::OrchardSpendingKey(skPtr);
+}
+
+std::vector<std::pair<libzcash::OrchardSpendingKey, orchard::SpendInfo>> OrchardWallet::GetSpendInfo(
+    const std::vector<OrchardNoteMetadata>& noteMetadata,
+    uint256 anchor) const
+{
+    std::vector<std::pair<libzcash::OrchardSpendingKey, orchard::SpendInfo>> result;
+    for (const auto& note : noteMetadata) {
+        auto pSpendInfo = orchard_wallet_get_spend_info(
+            inner.get(),
+            note.GetOutPoint().hash.begin(),
+            note.GetOutPoint().n,
+            anchor.begin());
+        if (pSpendInfo == nullptr) {
+            throw std::logic_error("Called OrchardWallet::GetSpendInfo with unknown outpoint");
+        } else {
+            auto spendInfo = orchard::SpendInfo(
+                pSpendInfo,
+                note.GetAddress(),
+                note.GetNoteValue());
+
+            auto sk = GetSpendingKeyForAddress(note.GetAddress());
+            if (sk.has_value()) {
+                result.push_back(std::pair(std::move(sk.value()), std::move(spendInfo)));
+            } else {
+                throw std::logic_error("Unknown spending key for given outpoint");
+            }
+        }
+    }
+    return result;
+}
diff --git a/depend/zcash/src/wallet/orchard.h b/depend/zcash/src/wallet/orchard.h
new file mode 100644
index 000000000..a48129b4f
--- /dev/null
+++ b/depend/zcash/src/wallet/orchard.h
@@ -0,0 +1,532 @@
+// Copyright (c) 2021 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_WALLET_ORCHARD_H
+#define ZCASH_WALLET_ORCHARD_H
+
+#include <array>
+
+#include "primitives/transaction.h"
+#include "transaction_builder.h"
+
+#include "rust/orchard/keys.h"
+#include "rust/orchard/wallet.h"
+#include "zcash/address/orchard.hpp"
+#include "zcash/IncrementalMerkleTree.hpp"
+
+class OrchardWallet;
+class OrchardWalletNoteCommitmentTreeWriter;
+class OrchardWalletNoteCommitmentTreeLoader;
+
+class OrchardNoteMetadata
+{
+private:
+    OrchardOutPoint op;
+    libzcash::OrchardRawAddress address;
+    CAmount noteValue;
+    std::array<uint8_t, ZC_MEMO_SIZE> memo;
+    int confirmations;
+public:
+    OrchardNoteMetadata(
+        OrchardOutPoint op,
+        const libzcash::OrchardRawAddress& address,
+        CAmount noteValue,
+        const std::array<unsigned char, ZC_MEMO_SIZE>& memo):
+        op(op), address(address), noteValue(noteValue), memo(memo), confirmations(0) {}
+
+    const OrchardOutPoint& GetOutPoint() const {
+        return op;
+    }
+
+    const libzcash::OrchardRawAddress& GetAddress() const {
+        return address;
+    }
+
+    void SetConfirmations(int c) {
+        confirmations = c;
+    }
+
+    int GetConfirmations() const {
+        return confirmations;
+    }
+
+    CAmount GetNoteValue() const {
+        return noteValue;
+    }
+
+    const std::array<uint8_t, ZC_MEMO_SIZE>& GetMemo() const {
+        return memo;
+    }
+};
+
+/**
+ * A container and serialization wrapper for storing information derived from
+ * a transaction that is relevant to restoring Orchard wallet caches.
+ */
+class OrchardWalletTxMeta
+{
+private:
+    // A map from action index to the IVK belonging to our wallet that decrypts
+    // that action
+    std::map<uint32_t, libzcash::OrchardIncomingViewingKey> mapOrchardActionData;
+    // A vector of the action indices that spend notes belonging to our wallet
+    std::vector<uint32_t> vActionsSpendingMyNotes;
+
+    friend class OrchardWallet;
+public:
+    OrchardWalletTxMeta() {}
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        int nVersion = s.GetVersion();
+        if (!(s.GetType() & SER_GETHASH)) {
+            READWRITE(nVersion);
+        }
+        READWRITE(mapOrchardActionData);
+        READWRITE(vActionsSpendingMyNotes);
+    }
+
+    const std::map<uint32_t, libzcash::OrchardIncomingViewingKey>& GetMyActionIVKs() const {
+        return mapOrchardActionData;
+    }
+
+    const std::vector<uint32_t>& GetActionsSpendingMyNotes() const {
+        return vActionsSpendingMyNotes;
+    }
+
+    bool empty() const {
+        return (mapOrchardActionData.empty() && vActionsSpendingMyNotes.empty());
+    }
+
+    friend bool operator==(const OrchardWalletTxMeta& a, const OrchardWalletTxMeta& b) {
+        return (a.mapOrchardActionData == b.mapOrchardActionData &&
+                a.vActionsSpendingMyNotes == b.vActionsSpendingMyNotes);
+    }
+
+    friend bool operator!=(const OrchardWalletTxMeta& a, const OrchardWalletTxMeta& b) {
+        return !(a == b);
+    }
+};
+
+class OrchardActionSpend {
+private:
+    OrchardOutPoint outPoint;
+    libzcash::OrchardRawAddress receivedAt;
+    CAmount noteValue;
+public:
+    OrchardActionSpend(OrchardOutPoint outPoint, libzcash::OrchardRawAddress receivedAt, CAmount noteValue):
+        outPoint(outPoint), receivedAt(receivedAt), noteValue(noteValue) { }
+
+    OrchardOutPoint GetOutPoint() const {
+        return outPoint;
+    }
+
+    const libzcash::OrchardRawAddress& GetReceivedAt() const {
+        return receivedAt;
+    }
+
+    CAmount GetNoteValue() const {
+        return noteValue;
+    }
+};
+
+class OrchardActionOutput {
+private:
+    libzcash::OrchardRawAddress recipient;
+    CAmount noteValue;
+    std::array<unsigned char, 512> memo;
+    bool isOutgoing;
+public:
+    OrchardActionOutput(
+            libzcash::OrchardRawAddress recipient, CAmount noteValue, std::array<unsigned char, 512> memo, bool isOutgoing):
+            recipient(recipient), noteValue(noteValue), memo(memo), isOutgoing(isOutgoing) { }
+
+    const libzcash::OrchardRawAddress& GetRecipient() const {
+        return recipient;
+    }
+
+    CAmount GetNoteValue() const {
+        return noteValue;
+    }
+
+    const std::array<unsigned char, 512>& GetMemo() const {
+        return memo;
+    }
+
+    bool IsOutgoing() const {
+        return isOutgoing;
+    }
+};
+
+class OrchardActions {
+private:
+    std::map<uint32_t, OrchardActionSpend> spends;
+    std::map<uint32_t, OrchardActionOutput> outputs;
+public:
+    OrchardActions() {}
+
+    void AddSpend(uint32_t actionIdx, OrchardActionSpend spend) {
+        spends.insert({actionIdx, spend});
+    }
+
+    void AddOutput(uint32_t actionIdx, OrchardActionOutput output) {
+        outputs.insert({actionIdx, output});
+    }
+
+    const std::map<uint32_t, OrchardActionSpend>& GetSpends() {
+        return spends;
+    }
+
+    const std::map<uint32_t, OrchardActionOutput>& GetOutputs() {
+        return outputs;
+    }
+};
+
+class OrchardWallet
+{
+private:
+    std::unique_ptr<OrchardWalletPtr, decltype(&orchard_wallet_free)> inner;
+
+    friend class ::orchard::UnauthorizedBundle;
+    friend class OrchardWalletNoteCommitmentTreeWriter;
+    friend class OrchardWalletNoteCommitmentTreeLoader;
+public:
+    OrchardWallet() : inner(orchard_wallet_new(), orchard_wallet_free) {}
+    OrchardWallet(OrchardWallet&& wallet_data) : inner(std::move(wallet_data.inner)) {}
+    OrchardWallet& operator=(OrchardWallet&& wallet)
+    {
+        if (this != &wallet) {
+            inner = std::move(wallet.inner);
+        }
+        return *this;
+    }
+
+    // OrchardWallet should never be copied
+    OrchardWallet(const OrchardWallet&) = delete;
+    OrchardWallet& operator=(const OrchardWallet&) = delete;
+
+    /**
+     * Reset the state of the wallet to be suitable for rescan from the NU5 activation
+     * height.  This removes all witness and spentness information from the wallet. The
+     * keystore is unmodified and decrypted note, nullifier, and conflict data are left
+     * in place with the expectation that they will be overwritten and/or updated in the
+     * rescan process.
+     */
+    bool Reset() {
+        return orchard_wallet_reset(inner.get());
+    }
+
+    /**
+     * Overwrite the first bridge of the Orchard note commitment tree to have the
+     * provided frontier as its latest state. This will fail with an assertion error
+     * if any checkpoints exist in the tree.
+     */
+    void InitNoteCommitmentTree(const OrchardMerkleFrontier& frontier) {
+        assert(!GetLastCheckpointHeight().has_value());
+        assert(orchard_wallet_init_from_frontier(inner.get(), frontier.inner.get()));
+    }
+
+    /**
+     * Checkpoint the note commitment tree. This returns `false` and leaves the note
+     * commitment tree unmodified if the block height specified is not the successor
+     * to the last block height checkpointed.
+     */
+    bool CheckpointNoteCommitmentTree(int nBlockHeight) {
+        assert(nBlockHeight >= 0);
+        return orchard_wallet_checkpoint(inner.get(), (uint32_t) nBlockHeight);
+    }
+
+    /**
+     * Return whether the orchard note commitment tree contains any checkpoints.
+     */
+    std::optional<int> GetLastCheckpointHeight() const {
+        uint32_t lastHeight{0};
+        if (orchard_wallet_get_last_checkpoint(inner.get(), &lastHeight)) {
+            return (int) lastHeight;
+        } else {
+            return std::nullopt;
+        }
+    }
+
+    /**
+     * Rewinds to the most recent checkpoint, and marks as unspent any notes
+     * previously identified as having been spent by transactions in the
+     * latest block.
+     */
+    bool Rewind(int nBlockHeight, uint32_t& uResultHeight) {
+        assert(nBlockHeight >= 0);
+        return orchard_wallet_rewind(inner.get(), (uint32_t) nBlockHeight, &uResultHeight);
+    }
+
+    static void PushOrchardActionIVK(void* rec, RawOrchardActionIVK actionIVK) {
+        reinterpret_cast<OrchardWalletTxMeta*>(rec)->mapOrchardActionData.insert_or_assign(
+                actionIVK.actionIdx, libzcash::OrchardIncomingViewingKey(actionIVK.ivk)
+                );
+    }
+
+    static void PushSpendActionIdx(void* rec, uint32_t actionIdx) {
+        reinterpret_cast<OrchardWalletTxMeta*>(rec)->vActionsSpendingMyNotes.push_back(actionIdx);
+    }
+
+    /**
+     * Add notes that are decryptable with IVKs for which the wallet
+     * contains the full viewing key to the wallet, and return the
+     * metadata describing the wallet's involvement with this action,
+     * or std::nullopt if the transaction does not involve the wallet.
+     */
+    std::optional<OrchardWalletTxMeta> AddNotesIfInvolvingMe(const CTransaction& tx) {
+        OrchardWalletTxMeta txMeta;
+        if (orchard_wallet_add_notes_from_bundle(
+                inner.get(),
+                tx.GetHash().begin(),
+                tx.GetOrchardBundle().inner.get(),
+                &txMeta,
+                PushOrchardActionIVK,
+                PushSpendActionIdx
+                )) {
+            return txMeta;
+        } else {
+            return std::nullopt;
+        }
+    }
+
+    /**
+     * Decrypts a selection of notes from the specified transaction's
+     * Orchard bundle with provided incoming viewing keys, and adds those
+     * notes to the wallet.
+     */
+    bool LoadWalletTx(
+            const CTransaction& tx,
+            const OrchardWalletTxMeta& txMeta
+            ) {
+        std::vector<RawOrchardActionIVK> rawHints;
+        for (const auto& [action_idx, ivk] : txMeta.mapOrchardActionData) {
+            rawHints.push_back({ action_idx, ivk.inner.get() });
+        }
+        return orchard_wallet_load_bundle(
+                inner.get(),
+                tx.GetHash().begin(),
+                tx.GetOrchardBundle().inner.get(),
+                rawHints.data(),
+                rawHints.size(),
+                txMeta.vActionsSpendingMyNotes.data(),
+                txMeta.vActionsSpendingMyNotes.size());
+    }
+
+    /**
+     * Append each Orchard note commitment from the specified block to the
+     * wallet's note commitment tree.
+     *
+     * Returns `false` if the caller attempts to insert a block out-of-order.
+     */
+    bool AppendNoteCommitments(const int nBlockHeight, const CBlock& block) {
+        assert(nBlockHeight >= 0);
+        for (int txidx = 0; txidx < block.vtx.size(); txidx++) {
+            const CTransaction& tx = block.vtx[txidx];
+            if (!orchard_wallet_append_bundle_commitments(
+                    inner.get(),
+                    (uint32_t) nBlockHeight,
+                    txidx,
+                    tx.GetHash().begin(),
+                    tx.GetOrchardBundle().inner.get()
+                    )) {
+                return false;
+            }
+        }
+
+        return true;
+    }
+
+    uint256 GetLatestAnchor() const {
+        uint256 value;
+        orchard_wallet_commitment_tree_root(inner.get(), value.begin());
+        return value;
+    }
+
+    bool TxInvolvesMyNotes(const uint256& txid) {
+        return orchard_wallet_tx_involves_my_notes(
+                inner.get(),
+                txid.begin());
+    }
+
+    void AddSpendingKey(const libzcash::OrchardSpendingKey& sk) {
+        orchard_wallet_add_spending_key(inner.get(), sk.inner.get());
+    }
+
+    void AddFullViewingKey(const libzcash::OrchardFullViewingKey& fvk) {
+        orchard_wallet_add_full_viewing_key(inner.get(), fvk.inner.get());
+    }
+
+    std::optional<libzcash::OrchardSpendingKey> GetSpendingKeyForAddress(
+            const libzcash::OrchardRawAddress& addr) const;
+
+    std::optional<libzcash::OrchardIncomingViewingKey> GetIncomingViewingKeyForAddress(
+            const libzcash::OrchardRawAddress& addr) const {
+        auto ivkPtr = orchard_wallet_get_ivk_for_address(inner.get(), addr.inner.get());
+        if (ivkPtr == nullptr) return std::nullopt;
+        return libzcash::OrchardIncomingViewingKey(ivkPtr);
+    }
+
+    /**
+     * Adds an address/IVK pair to the wallet, and returns `true` if the
+     * IVK corresponds to a full viewing key known to the wallet, `false`
+     * otherwise.
+     */
+    bool AddRawAddress(
+            const libzcash::OrchardRawAddress& addr,
+            const libzcash::OrchardIncomingViewingKey& ivk) {
+        return orchard_wallet_add_raw_address(inner.get(), addr.inner.get(), ivk.inner.get());
+    }
+
+    static void PushOrchardNoteMeta(void* orchardNotesRet, RawOrchardNoteMetadata rawNoteMeta) {
+        uint256 txid;
+        std::move(std::begin(rawNoteMeta.txid), std::end(rawNoteMeta.txid), txid.begin());
+        OrchardOutPoint op(txid, rawNoteMeta.actionIdx);
+        std::array<uint8_t, ZC_MEMO_SIZE> memo;
+        std::move(std::begin(rawNoteMeta.memo), std::end(rawNoteMeta.memo), memo.begin());
+        OrchardNoteMetadata noteMeta(
+                op,
+                libzcash::OrchardRawAddress(rawNoteMeta.addr),
+                rawNoteMeta.noteValue,
+                memo);
+
+        reinterpret_cast<std::vector<OrchardNoteMetadata>*>(orchardNotesRet)->push_back(noteMeta);
+    }
+
+    void GetFilteredNotes(
+        std::vector<OrchardNoteMetadata>& orchardNotesRet,
+        const std::optional<libzcash::OrchardIncomingViewingKey>& ivk,
+        bool ignoreMined,
+        bool requireSpendingKey) const {
+
+        orchard_wallet_get_filtered_notes(
+            inner.get(),
+            ivk.has_value() ? ivk.value().inner.get() : nullptr,
+            ignoreMined,
+            requireSpendingKey,
+            &orchardNotesRet,
+            PushOrchardNoteMeta
+            );
+    }
+
+    static void PushTxId(void* txidsRet, unsigned char txid[32]) {
+        uint256 txid_out;
+        std::copy(txid, txid + 32, txid_out.begin());
+        reinterpret_cast<std::vector<uint256>*>(txidsRet)->push_back(txid_out);
+    }
+
+    std::vector<uint256> GetPotentialSpendsFromNullifier(const uint256& nullifier) const {
+        std::vector<uint256> result;
+        orchard_wallet_get_potential_spends_from_nullifier(
+            inner.get(),
+            nullifier.begin(),
+            &result,
+            PushTxId
+            );
+        return result;
+    }
+
+    std::vector<uint256> GetPotentialSpends(const OrchardOutPoint& outPoint) const {
+        std::vector<uint256> result;
+        orchard_wallet_get_potential_spends(
+            inner.get(),
+            outPoint.hash.begin(),
+            outPoint.n,
+            &result,
+            PushTxId
+            );
+        return result;
+    }
+
+    std::vector<std::pair<libzcash::OrchardSpendingKey, orchard::SpendInfo>> GetSpendInfo(
+        const std::vector<OrchardNoteMetadata>& noteMetadata,
+        uint256 anchor) const;
+
+    void GarbageCollect() {
+        orchard_wallet_gc_note_commitment_tree(inner.get());
+    }
+
+    static void PushSpendAction(void* receiver, RawOrchardActionSpend rawSpend) {
+        uint256 txid;
+        std::move(std::begin(rawSpend.outpointTxId), std::end(rawSpend.outpointTxId), txid.begin());
+        auto spend = OrchardActionSpend(
+                OrchardOutPoint(txid, rawSpend.outpointActionIdx),
+                libzcash::OrchardRawAddress(rawSpend.receivedAt),
+                rawSpend.noteValue);
+        reinterpret_cast<OrchardActions*>(receiver)->AddSpend(rawSpend.spendActionIdx, spend);
+    }
+
+    static void PushOutputAction(void* receiver, RawOrchardActionOutput rawOutput) {
+        std::array<unsigned char, 512> memo;
+        std::move(std::begin(rawOutput.memo), std::end(rawOutput.memo), memo.begin());
+        auto output = OrchardActionOutput(
+                libzcash::OrchardRawAddress(rawOutput.recipient),
+                rawOutput.noteValue,
+                memo,
+                rawOutput.isOutgoing);
+
+        reinterpret_cast<OrchardActions*>(receiver)->AddOutput(rawOutput.outputActionIdx, output);
+    }
+
+    OrchardActions GetTxActions(const CTransaction& tx, const std::vector<uint256>& ovks) const {
+        OrchardActions result;
+        orchard_wallet_get_txdata(
+                inner.get(),
+                tx.GetOrchardBundle().inner.get(),
+                reinterpret_cast<const unsigned char*>(ovks.data()),
+                ovks.size(),
+                &result,
+                PushSpendAction,
+                PushOutputAction);
+        return result;
+    }
+};
+
+class OrchardWalletNoteCommitmentTreeWriter
+{
+private:
+    const OrchardWallet& wallet;
+public:
+    OrchardWalletNoteCommitmentTreeWriter(const OrchardWallet& wallet): wallet(wallet) {}
+
+    template<typename Stream>
+    void Serialize(Stream& s) const {
+        int nVersion = s.GetVersion();
+        if (!(s.GetType() & SER_GETHASH)) {
+            ::Serialize(s, nVersion);
+        }
+        RustStream rs(s);
+        if (!orchard_wallet_write_note_commitment_tree(
+                    wallet.inner.get(),
+                    &rs, RustStream<Stream>::write_callback)) {
+            throw std::ios_base::failure("Failed to serialize Orchard note commitment tree.");
+        }
+    }
+};
+
+class OrchardWalletNoteCommitmentTreeLoader
+{
+private:
+    OrchardWallet& wallet;
+public:
+    OrchardWalletNoteCommitmentTreeLoader(OrchardWallet& wallet): wallet(wallet) {}
+
+    template<typename Stream>
+    void Unserialize(Stream& s) {
+        int nVersion = s.GetVersion();
+        if (!(s.GetType() & SER_GETHASH)) {
+            ::Unserialize(s, nVersion);
+        }
+        RustStream rs(s);
+        if (!orchard_wallet_load_note_commitment_tree(
+                    wallet.inner.get(),
+                    &rs, RustStream<Stream>::read_callback)) {
+            throw std::ios_base::failure("Failed to load Orchard note commitment tree.");
+        }
+    }
+};
+
+#endif // ZCASH_ORCHARD_WALLET_H
diff --git a/depend/zcash/src/wallet/paymentdisclosure.cpp b/depend/zcash/src/wallet/paymentdisclosure.cpp
new file mode 100644
index 000000000..7c1e77be8
--- /dev/null
+++ b/depend/zcash/src/wallet/paymentdisclosure.cpp
@@ -0,0 +1,69 @@
+// Copyright (c) 2017 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "wallet/paymentdisclosure.h"
+
+#include "key_io.h"
+#include "util.h"
+
+#include <rust/ed25519.h>
+
+std::string PaymentDisclosureInfo::ToString() const {
+    KeyIO keyIO(Params());
+    return strprintf("PaymentDisclosureInfo(version=%d, esk=%s, joinSplitPrivKey=<omitted>, address=%s)",
+        version, esk.ToString(), keyIO.EncodePaymentAddress(zaddr));
+}
+
+std::string PaymentDisclosure::ToString() const {
+    std::string s = HexStr(payloadSig.bytes, payloadSig.bytes + ED25519_SIGNATURE_LEN);
+    return strprintf("PaymentDisclosure(payload=%s, payloadSig=%s)", payload.ToString(), s);
+}
+
+std::string PaymentDisclosurePayload::ToString() const {
+    KeyIO keyIO(Params());
+    return strprintf("PaymentDisclosurePayload(version=%d, esk=%s, txid=%s, js=%d, n=%d, address=%s, message=%s)",
+        version, esk.ToString(), txid.ToString(), js, n, keyIO.EncodePaymentAddress(zaddr), message);
+}
+
+PaymentDisclosure::PaymentDisclosure(
+    const Ed25519VerificationKey& joinSplitPubKey,
+    const PaymentDisclosureKey& key,
+    const PaymentDisclosureInfo& info,
+    const std::string& message)
+{
+    // Populate payload member variable
+    payload.version = info.version; // experimental = 0, production = 1 etc.
+    payload.esk = info.esk;
+    payload.txid = key.hash;
+    payload.js = key.js;
+    payload.n = key.n;
+    payload.zaddr = info.zaddr;
+    payload.message = message;
+
+    // Serialize and hash the payload to generate a signature
+    uint256 dataToBeSigned = SerializeHash(payload, SER_GETHASH, 0);
+
+    LogPrint("paymentdisclosure", "Payment Disclosure: signing raw payload = %s\n", dataToBeSigned.ToString());
+
+    // Compute payload signature member variable
+    if (!ed25519_sign(
+        &info.joinSplitPrivKey,
+        dataToBeSigned.begin(), 32,
+        &payloadSig))
+    {
+        throw std::runtime_error("ed25519_sign failed");
+    }
+
+    // Sanity check
+    if (!ed25519_verify(
+        &joinSplitPubKey,
+        &payloadSig,
+        dataToBeSigned.begin(), 32))
+    {
+        throw std::runtime_error("ed25519_verify failed");
+    }
+
+    std::string sigString = HexStr(payloadSig.bytes, payloadSig.bytes + ED25519_SIGNATURE_LEN);
+    LogPrint("paymentdisclosure", "Payment Disclosure: signature = %s\n", sigString);
+}
diff --git a/depend/zcash/src/wallet/paymentdisclosure.h b/depend/zcash/src/wallet/paymentdisclosure.h
new file mode 100644
index 000000000..999363134
--- /dev/null
+++ b/depend/zcash/src/wallet/paymentdisclosure.h
@@ -0,0 +1,167 @@
+// Copyright (c) 2017 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_WALLET_PAYMENTDISCLOSURE_H
+#define ZCASH_WALLET_PAYMENTDISCLOSURE_H
+
+#include "uint256.h"
+#include "clientversion.h"
+#include "serialize.h"
+#include "streams.h"
+#include "version.h"
+
+// For JSOutPoint
+#include "wallet/wallet.h"
+
+#include <array>
+#include <cstdint>
+#include <string>
+
+#include <rust/ed25519/types.h>
+
+
+// Ensure that the two different protocol messages, payment disclosure blobs and transactions,
+// which are signed with the same key, joinSplitPrivKey, have disjoint encodings such that an
+// encoding from one context will be rejected in the other.  We know that the set of valid
+// transaction versions is currently ({1..INT32_MAX}) so we will use a negative value for
+// payment disclosure of -10328976 which in hex is 0xFF626470.  Serialization is in little endian
+// format, so a payment disclosure hex string begins 706462FF, which in ISO-8859-1 is "pdbÿ".
+#define PAYMENT_DISCLOSURE_PAYLOAD_MAGIC_BYTES    -10328976
+
+#define PAYMENT_DISCLOSURE_VERSION_EXPERIMENTAL 0
+
+#define PAYMENT_DISCLOSURE_BLOB_STRING_PREFIX    "zpd:"
+
+typedef JSOutPoint PaymentDisclosureKey;
+
+struct PaymentDisclosureInfo {
+    uint8_t version;          // 0 = experimental, 1 = first production version, etc.
+    uint256 esk;              // zcash/NoteEncryption.cpp
+    Ed25519SigningKey joinSplitPrivKey; // primitives/transaction.h
+    // ed25519 - not tied to implementation e.g. libsodium, see ed25519 rfc
+
+    libzcash::SproutPaymentAddress zaddr;
+
+    PaymentDisclosureInfo() : version(PAYMENT_DISCLOSURE_VERSION_EXPERIMENTAL) {
+    }
+
+    PaymentDisclosureInfo(uint8_t v, uint256 esk, Ed25519SigningKey key, libzcash::SproutPaymentAddress zaddr) : version(v), esk(esk), joinSplitPrivKey(key), zaddr(zaddr) { }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(version);
+        READWRITE(esk);
+        READWRITE(joinSplitPrivKey);
+        READWRITE(zaddr);
+    }
+
+    std::string ToString() const;
+
+    friend bool operator==(const PaymentDisclosureInfo& a, const PaymentDisclosureInfo& b) {
+        return (
+            a.version == b.version &&
+            a.esk == b.esk &&
+            std::equal(
+                a.joinSplitPrivKey.bytes,
+                a.joinSplitPrivKey.bytes + ED25519_SIGNING_KEY_LEN,
+                b.joinSplitPrivKey.bytes) &&
+            a.zaddr == b.zaddr);
+    }
+
+    friend bool operator!=(const PaymentDisclosureInfo& a, const PaymentDisclosureInfo& b) {
+        return !(a == b);
+    }
+
+};
+
+
+struct PaymentDisclosurePayload {
+    int32_t marker = PAYMENT_DISCLOSURE_PAYLOAD_MAGIC_BYTES;  // to be disjoint from transaction encoding
+    uint8_t version;        // 0 = experimental, 1 = first production version, etc.
+    uint256 esk;            // zcash/NoteEncryption.cpp
+    uint256 txid;           // primitives/transaction.h
+    uint64_t js;            // Index into CTransaction.vJoinSplit
+    uint8_t n;              // Index into JSDescription fields of length ZC_NUM_JS_OUTPUTS
+    libzcash::SproutPaymentAddress zaddr; // zcash/Address.hpp
+    std::string message;     // parameter to RPC call
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(marker);
+        READWRITE(version);
+        READWRITE(esk);
+        READWRITE(txid);
+        READWRITE(js);
+        READWRITE(n);
+        READWRITE(zaddr);
+        READWRITE(message);
+    }
+
+    std::string ToString() const;
+
+    friend bool operator==(const PaymentDisclosurePayload& a, const PaymentDisclosurePayload& b) {
+        return (
+            a.version == b.version &&
+            a.esk == b.esk &&
+            a.txid == b.txid &&
+            a.js == b.js &&
+            a.n == b.n &&
+            a.zaddr == b.zaddr &&
+            a.message == b.message
+            );
+    }
+
+    friend bool operator!=(const PaymentDisclosurePayload& a, const PaymentDisclosurePayload& b) {
+        return !(a == b);
+    }
+};
+
+struct PaymentDisclosure {
+    PaymentDisclosurePayload payload;
+    Ed25519Signature payloadSig;
+    // We use boost array because serialize doesn't like char buffer, otherwise we could do: unsigned char payloadSig[64];
+
+    PaymentDisclosure() {};
+    PaymentDisclosure(const PaymentDisclosurePayload payload, const Ed25519Signature sig) : payload(payload), payloadSig(sig) {};
+    PaymentDisclosure(
+        const Ed25519VerificationKey& joinSplitPubKey,
+        const PaymentDisclosureKey& key,
+        const PaymentDisclosureInfo& info,
+        const std::string& message);
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(payload);
+        READWRITE(payloadSig);
+    }
+
+    std::string ToString() const;
+
+    friend bool operator==(const PaymentDisclosure& a, const PaymentDisclosure& b) {
+        return (
+            a.payload == b.payload &&
+            std::equal(
+                a.payloadSig.bytes,
+                a.payloadSig.bytes + ED25519_SIGNATURE_LEN,
+                b.payloadSig.bytes)
+        );
+    }
+
+    friend bool operator!=(const PaymentDisclosure& a, const PaymentDisclosure& b) {
+        return !(a == b);
+    }
+};
+
+
+
+typedef std::pair<PaymentDisclosureKey, PaymentDisclosureInfo> PaymentDisclosureKeyInfo;
+
+
+#endif // ZCASH_WALLET_PAYMENTDISCLOSURE_H
diff --git a/depend/zcash/src/wallet/paymentdisclosuredb.cpp b/depend/zcash/src/wallet/paymentdisclosuredb.cpp
new file mode 100644
index 000000000..b6b12c43f
--- /dev/null
+++ b/depend/zcash/src/wallet/paymentdisclosuredb.cpp
@@ -0,0 +1,92 @@
+// Copyright (c) 2017 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "wallet/paymentdisclosuredb.h"
+
+#include "fs.h"
+#include "util.h"
+#include "dbwrapper.h"
+
+using namespace std;
+
+static fs::path emptyPath;
+
+/**
+ * Static method to return the shared/default payment disclosure database.
+ */
+shared_ptr<PaymentDisclosureDB> PaymentDisclosureDB::sharedInstance() {
+    // Thread-safe in C++11 and gcc 4.3
+    static shared_ptr<PaymentDisclosureDB> ptr = std::make_shared<PaymentDisclosureDB>();
+    return ptr;
+}
+
+// C++11 delegated constructor
+PaymentDisclosureDB::PaymentDisclosureDB() : PaymentDisclosureDB(emptyPath) {
+}
+
+PaymentDisclosureDB::PaymentDisclosureDB(const fs::path& dbPath) {
+    fs::path path(dbPath);
+    if (path.empty()) {
+        path = GetDataDir() / "paymentdisclosure";
+        LogPrintf("PaymentDisclosure: using default path for database: %s\n", path.string());
+    } else {
+        LogPrintf("PaymentDisclosure: using custom path for database: %s\n", path.string());
+    }
+
+    TryCreateDirectory(path);
+    options.create_if_missing = true;
+    leveldb::Status status = leveldb::DB::Open(options, path.string(), &db);
+    dbwrapper_private::HandleError(status); // throws exception
+    LogPrintf("PaymentDisclosure: Opened LevelDB successfully\n");
+}
+
+PaymentDisclosureDB::~PaymentDisclosureDB() {
+    if (db != nullptr) {
+        delete db;
+    }
+}
+
+bool PaymentDisclosureDB::Put(const PaymentDisclosureKey& key, const PaymentDisclosureInfo& info)
+{
+    if (db == nullptr) {
+        return false;
+    }
+
+    std::lock_guard<std::mutex> guard(lock_);
+
+    CDataStream ssValue(SER_DISK, CLIENT_VERSION);
+    ssValue.reserve(GetSerializeSize(ssValue, info));
+    ssValue << info;
+    leveldb::Slice slice(&ssValue[0], ssValue.size());
+
+    leveldb::Status status = db->Put(writeOptions, key.ToString(), slice);
+    dbwrapper_private::HandleError(status);
+    return true;
+}
+
+bool PaymentDisclosureDB::Get(const PaymentDisclosureKey& key, PaymentDisclosureInfo& info)
+{
+    if (db == nullptr) {
+        return false;
+    }
+
+    std::lock_guard<std::mutex> guard(lock_);
+
+    std::string strValue;
+    leveldb::Status status = db->Get(readOptions, key.ToString(), &strValue);
+    if (!status.ok()) {
+        if (status.IsNotFound())
+            return false;
+        LogPrintf("PaymentDisclosure: LevelDB read failure: %s\n", status.ToString());
+        dbwrapper_private::HandleError(status);
+    }
+
+    try {
+        CDataStream ssValue(strValue.data(), strValue.data() + strValue.size(), SER_DISK, CLIENT_VERSION);
+        ssValue >> info;
+    } catch (const std::exception&) {
+        return false;
+    }
+    return true;
+}
diff --git a/depend/zcash/src/wallet/paymentdisclosuredb.h b/depend/zcash/src/wallet/paymentdisclosuredb.h
new file mode 100644
index 000000000..8f93f1f73
--- /dev/null
+++ b/depend/zcash/src/wallet/paymentdisclosuredb.h
@@ -0,0 +1,41 @@
+// Copyright (c) 2017 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_WALLET_PAYMENTDISCLOSUREDB_H
+#define ZCASH_WALLET_PAYMENTDISCLOSUREDB_H
+
+#include <wallet/paymentdisclosure.h>
+
+#include <cstdint>
+#include <string>
+#include <mutex>
+#include <future>
+#include <memory>
+
+
+#include <leveldb/db.h>
+
+
+class PaymentDisclosureDB
+{
+protected:
+    leveldb::DB* db = nullptr;
+    leveldb::Options options;
+    leveldb::ReadOptions readOptions;
+    leveldb::WriteOptions writeOptions;
+    mutable std::mutex lock_;
+
+public:
+    static std::shared_ptr<PaymentDisclosureDB> sharedInstance();
+
+    PaymentDisclosureDB();
+    PaymentDisclosureDB(const fs::path& dbPath);
+    ~PaymentDisclosureDB();
+
+    bool Put(const PaymentDisclosureKey& key, const PaymentDisclosureInfo& info);
+    bool Get(const PaymentDisclosureKey& key, PaymentDisclosureInfo& info);
+};
+
+
+#endif // ZCASH_WALLET_PAYMENTDISCLOSUREDB_H
diff --git a/depend/zcash/src/wallet/rpcdisclosure.cpp b/depend/zcash/src/wallet/rpcdisclosure.cpp
new file mode 100644
index 000000000..dc30181cc
--- /dev/null
+++ b/depend/zcash/src/wallet/rpcdisclosure.cpp
@@ -0,0 +1,314 @@
+// Copyright (c) 2017 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "experimental_features.h"
+#include "init.h"
+#include "key_io.h"
+#include "main.h"
+#include "rpc/server.h"
+#include "script/script.h"
+#include "script/standard.h"
+#include "sync.h"
+#include "util.h"
+#include "utiltime.h"
+#include "wallet.h"
+#include "wallet/paymentdisclosure.h"
+#include "wallet/paymentdisclosuredb.h"
+#include "zcash/JoinSplit.hpp"
+
+#include <fstream>
+#include <stdint.h>
+
+#include <boost/algorithm/string.hpp>
+#include <boost/date_time/posix_time/posix_time.hpp>
+
+#include <univalue.h>
+
+#include "zcash/Note.hpp"
+#include "zcash/NoteEncryption.hpp"
+
+#include <rust/ed25519.h>
+
+using namespace std;
+using namespace libzcash;
+
+// Function declaration for function implemented in wallet/rpcwallet.cpp
+bool EnsureWalletIsAvailable(bool avoidException);
+
+/**
+ * RPC call to generate a payment disclosure
+ */
+UniValue z_getpaymentdisclosure(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    string disabledMsg = "";
+    if (!fExperimentalPaymentDisclosure) {
+        disabledMsg = experimentalDisabledHelpMsg("z_getpaymentdisclosure", {"paymentdisclosure"});
+    }
+
+    if (fHelp || params.size() < 3 || params.size() > 4 )
+        throw runtime_error(
+            "z_getpaymentdisclosure \"txid\" \"js_index\" \"output_index\" (\"message\") \n"
+            "\nGenerate a payment disclosure for a given joinsplit output.\n"
+            "\nEXPERIMENTAL FEATURE\n"
+            + disabledMsg +
+            "\nArguments:\n"
+            "1. \"txid\"            (string, required) \n"
+            "2. \"js_index\"        (string, required) \n"
+            "3. \"output_index\"    (string, required) \n"
+            "4. \"message\"         (string, optional) \n"
+            "\nResult:\n"
+            "\"paymentdisclosure\"  (string) Hex data string, with \"zpd:\" prefix.\n"
+            "\nExamples:\n"
+            + HelpExampleCli("z_getpaymentdisclosure", "96f12882450429324d5f3b48630e3168220e49ab7b0f066e5c2935a6b88bb0f2 0 0 \"refund\"")
+            + HelpExampleRpc("z_getpaymentdisclosure", "\"96f12882450429324d5f3b48630e3168220e49ab7b0f066e5c2935a6b88bb0f2\", 0, 0, \"refund\"")
+        );
+
+    if (!fExperimentalPaymentDisclosure) {
+        throw JSONRPCError(RPC_WALLET_ERROR, "Error: payment disclosure is disabled.");
+    }
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    EnsureWalletIsUnlocked();
+
+    // Check wallet knows about txid
+    string txid = params[0].get_str();
+    uint256 hash;
+    hash.SetHex(txid);
+
+    CTransaction tx;
+    uint256 hashBlock;
+
+    // Check txid has been seen
+    if (!GetTransaction(hash, tx, Params().GetConsensus(), hashBlock, true)) {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "No information available about transaction");
+    }
+
+    // Check tx has been confirmed
+    if (hashBlock.IsNull()) {
+        throw JSONRPCError(RPC_MISC_ERROR, "Transaction has not been confirmed yet");
+    }
+
+    // Check is mine
+    if (!pwalletMain->mapWallet.count(hash)) {
+        throw JSONRPCError(RPC_MISC_ERROR, "Transaction does not belong to the wallet");
+    }
+    const CWalletTx& wtx = pwalletMain->mapWallet[hash];
+
+    // Check if shielded tx
+    if (wtx.vJoinSplit.empty()) {
+        throw JSONRPCError(RPC_MISC_ERROR, "Transaction is not a shielded transaction");        
+    }
+
+    // Check js_index
+    int js_index = params[1].get_int();
+    if (js_index < 0 || js_index >= wtx.vJoinSplit.size()) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid js_index");
+    }
+
+    // Check output_index
+    int output_index = params[2].get_int();
+    if (output_index < 0 || output_index >= ZC_NUM_JS_OUTPUTS) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid output_index");
+    }
+
+    // Get message if it exists
+    string msg;
+    if (params.size() == 4) {
+        msg = params[3].get_str();
+    }
+
+    // Create PaymentDisclosureKey
+    PaymentDisclosureKey key = {hash, (size_t)js_index, (uint8_t)output_index };
+
+    // TODO: In future, perhaps init the DB in init.cpp
+    shared_ptr<PaymentDisclosureDB> db = PaymentDisclosureDB::sharedInstance();
+    PaymentDisclosureInfo info;
+    if (!db->Get(key, info)) {
+        throw JSONRPCError(RPC_DATABASE_ERROR, "Could not find payment disclosure info for the given joinsplit output");
+    }
+
+    PaymentDisclosure pd( wtx.joinSplitPubKey, key, info, msg );
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << pd;
+    string strHex = HexStr(ss.begin(), ss.end());
+    return PAYMENT_DISCLOSURE_BLOB_STRING_PREFIX + strHex;
+}
+
+
+
+/**
+ * RPC call to validate a payment disclosure data blob.
+ */
+UniValue z_validatepaymentdisclosure(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    string disabledMsg = "";
+    if (!fExperimentalPaymentDisclosure) {
+        disabledMsg = experimentalDisabledHelpMsg("z_validatepaymentdisclosure", {"paymentdisclosure"});
+    }
+
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "z_validatepaymentdisclosure \"paymentdisclosure\"\n"
+            "\nValidates a payment disclosure.\n"
+            "\nEXPERIMENTAL FEATURE\n"
+            + disabledMsg +
+            "\nArguments:\n"
+            "1. \"paymentdisclosure\"     (string, required) Hex data string, with \"zpd:\" prefix.\n"
+            "\nExamples:\n"
+            + HelpExampleCli("z_validatepaymentdisclosure", "\"zpd:706462ff004c561a0447ba2ec51184e6c204...\"")
+            + HelpExampleRpc("z_validatepaymentdisclosure", "\"zpd:706462ff004c561a0447ba2ec51184e6c204...\"")
+        );
+
+    if (!fExperimentalPaymentDisclosure) {
+        throw JSONRPCError(RPC_WALLET_ERROR, "Error: payment disclosure is disabled.");
+    }
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    EnsureWalletIsUnlocked();
+
+    // Verify the payment disclosure input begins with "zpd:" prefix.
+    string strInput = params[0].get_str();
+    size_t pos = strInput.find(PAYMENT_DISCLOSURE_BLOB_STRING_PREFIX);
+    if (pos != 0) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, payment disclosure prefix not found.");
+    }
+    string hexInput = strInput.substr(strlen(PAYMENT_DISCLOSURE_BLOB_STRING_PREFIX));
+    if (!IsHex(hexInput))
+    {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, expected payment disclosure data in hexadecimal format.");
+    }
+
+    // Unserialize the payment disclosure data into an object
+    PaymentDisclosure pd;
+    CDataStream ss(ParseHex(hexInput), SER_NETWORK, PROTOCOL_VERSION);
+    try {
+        ss >> pd;
+        // too much data is ignored, but if not enough data, exception of type ios_base::failure is thrown,
+        // CBaseDataStream::read(): end of data: iostream error
+    } catch (const std::exception &e) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, payment disclosure data is malformed.");        
+    }
+
+    if (pd.payload.marker != PAYMENT_DISCLOSURE_PAYLOAD_MAGIC_BYTES) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, payment disclosure marker not found.");
+    }
+
+    if (pd.payload.version != PAYMENT_DISCLOSURE_VERSION_EXPERIMENTAL) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Payment disclosure version is unsupported.");
+    }
+
+    uint256 hash = pd.payload.txid;
+    CTransaction tx;
+    uint256 hashBlock;
+    // Check if we have seen the transaction
+    if (!GetTransaction(hash, tx, Params().GetConsensus(), hashBlock, true)) {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "No information available about transaction");
+    }
+
+    // Check if the transaction has been confirmed
+    if (hashBlock.IsNull()) {
+        throw JSONRPCError(RPC_MISC_ERROR, "Transaction has not been confirmed yet");
+    }
+
+    // Check if shielded tx
+    if (tx.vJoinSplit.empty()) {
+        throw JSONRPCError(RPC_MISC_ERROR, "Transaction is not a shielded transaction");        
+    }
+
+    UniValue errs(UniValue::VARR);
+    UniValue o(UniValue::VOBJ);
+    o.pushKV("txid", pd.payload.txid.ToString());
+
+    // Check js_index
+    if (pd.payload.js >= tx.vJoinSplit.size()) {
+        errs.push_back("Payment disclosure refers to an invalid joinsplit index");
+    }
+    o.pushKV("jsIndex", pd.payload.js);
+
+    if (pd.payload.n < 0 || pd.payload.n >= ZC_NUM_JS_OUTPUTS) {
+        errs.push_back("Payment disclosure refers to an invalid output index");
+    }
+    o.pushKV("outputIndex", pd.payload.n);
+    o.pushKV("version", pd.payload.version);
+    o.pushKV("onetimePrivKey", pd.payload.esk.ToString());
+    o.pushKV("message", pd.payload.message);
+
+    // Copy joinSplitPubKey into a uint256 so that
+    // it is byte-flipped in the RPC output.
+    uint256 joinSplitPubKey;
+    std::copy(
+        tx.joinSplitPubKey.bytes,
+        tx.joinSplitPubKey.bytes + ED25519_VERIFICATION_KEY_LEN,
+        joinSplitPubKey.begin());
+    o.pushKV("joinSplitPubKey", joinSplitPubKey.ToString());
+
+    // Verify the payment disclosure was signed using the same key as the transaction i.e. the joinSplitPrivKey.
+    uint256 dataToBeSigned = SerializeHash(pd.payload, SER_GETHASH, 0);
+    bool sigVerified = ed25519_verify(
+        &tx.joinSplitPubKey,
+        &pd.payloadSig,
+        dataToBeSigned.begin(), 32);
+    o.pushKV("signatureVerified", sigVerified);
+    if (!sigVerified) {
+        errs.push_back("Payment disclosure signature does not match transaction signature");        
+    }
+   
+    KeyIO keyIO(Params());
+
+    // Check the payment address is valid
+    SproutPaymentAddress zaddr = pd.payload.zaddr;
+    {
+        o.pushKV("paymentAddress", keyIO.EncodePaymentAddress(zaddr));
+
+        try {
+            // Decrypt the note to get value and memo field
+            JSDescription jsdesc = tx.vJoinSplit[pd.payload.js];
+            uint256 h_sig = ZCJoinSplit::h_sig(jsdesc.randomSeed, jsdesc.nullifiers, tx.joinSplitPubKey);
+
+            ZCPaymentDisclosureNoteDecryption decrypter;
+
+            ZCNoteEncryption::Ciphertext ciphertext = jsdesc.ciphertexts[pd.payload.n];
+
+            uint256 pk_enc = zaddr.pk_enc;
+            auto plaintext = decrypter.decryptWithEsk(ciphertext, pk_enc, pd.payload.esk, h_sig, pd.payload.n);
+
+            CDataStream ssPlain(SER_NETWORK, PROTOCOL_VERSION);
+            ssPlain << plaintext;
+            SproutNotePlaintext npt;
+            ssPlain >> npt;
+
+            string memoHexString = HexStr(npt.memo().data(), npt.memo().data() + npt.memo().size());
+            o.pushKV("memo", memoHexString);
+            o.pushKV("value", ValueFromAmount(npt.value()));
+            
+            // Check the blockchain commitment matches decrypted note commitment
+            uint256 cm_blockchain =  jsdesc.commitments[pd.payload.n];
+            SproutNote note = npt.note(zaddr);
+            uint256 cm_decrypted = note.cm();
+            bool cm_match = (cm_decrypted == cm_blockchain);
+            o.pushKV("commitmentMatch", cm_match);
+            if (!cm_match) {
+                errs.push_back("Commitment derived from payment disclosure does not match blockchain commitment");
+            }
+        } catch (const std::exception &e) {
+            errs.push_back(string("Error while decrypting payment disclosure note: ") + string(e.what()) );
+        }
+    }
+
+    bool isValid = errs.empty();
+    o.pushKV("valid", isValid);
+    if (!isValid) {
+        o.pushKV("errors", errs);
+    }
+
+    return o;
+}
diff --git a/depend/zcash/src/wallet/rpcdump.cpp b/depend/zcash/src/wallet/rpcdump.cpp
new file mode 100644
index 000000000..a52f7bbcf
--- /dev/null
+++ b/depend/zcash/src/wallet/rpcdump.cpp
@@ -0,0 +1,1040 @@
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "chain.h"
+#include "core_io.h"
+#include "deprecation.h"
+#include "key_io.h"
+#include "rpc/server.h"
+#include "init.h"
+#include "main.h"
+#include "script/script.h"
+#include "script/standard.h"
+#include "sync.h"
+#include "util.h"
+#include "util/match.h"
+#include "utiltime.h"
+#include "wallet.h"
+
+#include <fstream>
+#include <optional>
+#include <stdint.h>
+#include <variant>
+
+#include <boost/algorithm/string.hpp>
+#include <boost/date_time/posix_time/posix_time.hpp>
+
+#include <univalue.h>
+
+using namespace std;
+
+void EnsureWalletIsUnlocked();
+bool EnsureWalletIsAvailable(bool avoidException);
+
+UniValue dumpwallet_impl(const UniValue& params, bool fDumpZKeys);
+UniValue importwallet_impl(const UniValue& params, bool fImportZKeys);
+
+
+std::string static EncodeDumpTime(int64_t nTime) {
+    return DateTimeStrFormat("%Y-%m-%dT%H:%M:%SZ", nTime);
+}
+
+int64_t static DecodeDumpTime(const std::string &str) {
+    static const boost::posix_time::ptime epoch = boost::posix_time::from_time_t(0);
+    static const std::locale loc(std::locale::classic(),
+        new boost::posix_time::time_input_facet("%Y-%m-%dT%H:%M:%SZ"));
+    std::istringstream iss(str);
+    iss.imbue(loc);
+    boost::posix_time::ptime ptime(boost::date_time::not_a_date_time);
+    iss >> ptime;
+    if (ptime.is_not_a_date_time())
+        return 0;
+    return (ptime - epoch).total_seconds();
+}
+
+std::string static EncodeDumpString(const std::string &str) {
+    std::stringstream ret;
+    for (unsigned char c : str) {
+        if (c <= 32 || c >= 128 || c == '%') {
+            ret << '%' << HexStr(&c, &c + 1);
+        } else {
+            ret << c;
+        }
+    }
+    return ret.str();
+}
+
+std::string DecodeDumpString(const std::string &str) {
+    std::stringstream ret;
+    for (unsigned int pos = 0; pos < str.length(); pos++) {
+        unsigned char c = str[pos];
+        if (c == '%' && pos+2 < str.length()) {
+            c = (((str[pos+1]>>6)*9+((str[pos+1]-'0')&15)) << 4) |
+                ((str[pos+2]>>6)*9+((str[pos+2]-'0')&15));
+            pos += 2;
+        }
+        ret << c;
+    }
+    return ret.str();
+}
+
+UniValue importprivkey(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() < 1 || params.size() > 3)
+        throw runtime_error(
+            "importprivkey \"zcashprivkey\" ( \"label\" rescan )\n"
+            "\nAdds a private key (as returned by dumpprivkey) to your wallet.\n"
+            "\nArguments:\n"
+            "1. \"zcashprivkey\"   (string, required) The private key (see dumpprivkey)\n"
+            "2. \"label\"            (string, optional, default=\"\") An optional label\n"
+            "3. rescan               (boolean, optional, default=true) Rescan the wallet for transactions\n"
+            "\nNote: This call can take a long time to complete if rescan is true.\n"
+            "\nExamples:\n"
+            "\nDump a private key\n"
+            + HelpExampleCli("dumpprivkey", "\"myaddress\"") +
+            "\nImport the private key with rescan\n"
+            + HelpExampleCli("importprivkey", "\"mykey\"") +
+            "\nImport using a label and without rescan\n"
+            + HelpExampleCli("importprivkey", "\"mykey\" \"testing\" false") +
+            "\nAs a JSON-RPC call\n"
+            + HelpExampleRpc("importprivkey", "\"mykey\", \"testing\", false")
+        );
+
+    if (fPruneMode)
+        throw JSONRPCError(RPC_WALLET_ERROR, "Importing keys is disabled in pruned mode");
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    EnsureWalletIsUnlocked();
+
+    string strSecret = params[0].get_str();
+    string strLabel = "";
+    if (params.size() > 1)
+        strLabel = params[1].get_str();
+
+    // Whether to perform rescan after import
+    bool fRescan = true;
+    if (params.size() > 2)
+        fRescan = params[2].get_bool();
+
+    const auto& chainparams = Params();
+    KeyIO keyIO(chainparams);
+
+    CKey key = keyIO.DecodeSecret(strSecret);
+    if (!key.IsValid()) throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid private key encoding");
+
+    CPubKey pubkey = key.GetPubKey();
+    assert(key.VerifyPubKey(pubkey));
+    CKeyID vchAddress = pubkey.GetID();
+    {
+        pwalletMain->MarkDirty();
+        pwalletMain->SetAddressBook(vchAddress, strLabel, "receive");
+
+        // Don't throw error in case a key is already there
+        if (pwalletMain->HaveKey(vchAddress)) {
+            return keyIO.EncodeDestination(vchAddress);
+        }
+
+        pwalletMain->mapKeyMetadata[vchAddress].nCreateTime = 1;
+
+        if (!pwalletMain->AddKeyPubKey(key, pubkey))
+            throw JSONRPCError(RPC_WALLET_ERROR, "Error adding key to wallet");
+
+        // whenever a key is imported, we need to scan the whole chain
+        pwalletMain->nTimeFirstKey = 1; // 0 would be considered 'no value'
+
+        if (fRescan) {
+            pwalletMain->ScanForWalletTransactions(chainActive.Genesis(), true, false);
+        }
+    }
+
+    return keyIO.EncodeDestination(vchAddress);
+}
+
+void ImportAddress(const CTxDestination& dest, const string& strLabel);
+void ImportScript(const CScript& script, const string& strLabel, bool isRedeemScript)
+{
+    if (!isRedeemScript && ::IsMine(*pwalletMain, script) == ISMINE_SPENDABLE)
+        throw JSONRPCError(RPC_WALLET_ERROR, "The wallet already contains the private key for this address or script");
+
+    pwalletMain->MarkDirty();
+
+    if (!pwalletMain->HaveWatchOnly(script) && !pwalletMain->AddWatchOnly(script))
+        throw JSONRPCError(RPC_WALLET_ERROR, "Error adding address to wallet");
+
+    if (isRedeemScript) {
+        const CScriptID id(script);
+        if (!pwalletMain->HaveCScript(id) && !pwalletMain->AddCScript(script)) {
+            throw JSONRPCError(RPC_WALLET_ERROR, "Error adding p2sh redeemScript to wallet");
+        }
+        ImportAddress(id, strLabel);
+    } else {
+        CTxDestination destination;
+        if (ExtractDestination(script, destination)) {
+            pwalletMain->SetAddressBook(destination, strLabel, "receive");
+        }
+    }
+}
+
+void ImportAddress(const CTxDestination& dest, const string& strLabel)
+{
+    CScript script = GetScriptForDestination(dest);
+    ImportScript(script, strLabel, false);
+    // add to address book or update label
+    if (IsValidDestination(dest))
+        pwalletMain->SetAddressBook(dest, strLabel, "receive");
+}
+
+UniValue importaddress(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() < 1 || params.size() > 4)
+        throw runtime_error(
+            "importaddress \"address\" ( \"label\" rescan p2sh )\n"
+            "\nAdds a script (in hex) or address that can be watched as if it were in your wallet but cannot be used to spend.\n"
+            "\nArguments:\n"
+            "1. \"script\"           (string, required) The hex-encoded script (or address)\n"
+            "2. \"label\"            (string, optional, default=\"\") An optional label\n"
+            "3. rescan               (boolean, optional, default=true) Rescan the wallet for transactions\n"
+            "4. p2sh                 (boolean, optional, default=false) Add the P2SH version of the script as well\n"
+            "\nNote: This call can take a long time to complete if rescan is true.\n"
+            "If you have the full public key, you should call importpubkey instead of this.\n"
+            "\nNote: If you import a non-standard raw script in hex form, outputs sending to it will be treated\n"
+            "as change, and not show up in many RPCs.\n"
+            "\nExamples:\n"
+            "\nImport a script with rescan\n"
+            + HelpExampleCli("importaddress", "\"myscript\"") +
+            "\nImport using a label without rescan\n"
+            + HelpExampleCli("importaddress", "\"myscript\" \"testing\" false") +
+            "\nAs a JSON-RPC call\n"
+            + HelpExampleRpc("importaddress", "\"myscript\", \"testing\", false")
+        );
+
+    if (fPruneMode)
+        throw JSONRPCError(RPC_WALLET_ERROR, "Importing addresses is disabled in pruned mode");
+
+    string strLabel = "";
+    if (params.size() > 1)
+        strLabel = params[1].get_str();
+
+    // Whether to perform rescan after import
+    bool fRescan = true;
+    if (params.size() > 2)
+        fRescan = params[2].get_bool();
+
+    // Whether to import a p2sh version, too
+    bool fP2SH = false;
+    if (params.size() > 3)
+        fP2SH = params[3].get_bool();
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    const auto& chainparams = Params();
+    KeyIO keyIO(chainparams);
+    CTxDestination dest = keyIO.DecodeDestination(params[0].get_str());
+    if (IsValidDestination(dest)) {
+        if (fP2SH) {
+            throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Cannot use the p2sh flag with an address - use a script instead");
+        }
+        ImportAddress(dest, strLabel);
+    } else if (IsHex(params[0].get_str())) {
+        std::vector<unsigned char> data(ParseHex(params[0].get_str()));
+        ImportScript(CScript(data.begin(), data.end()), strLabel, fP2SH);
+    } else {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid Zcash address or script");
+    }
+
+    if (fRescan)
+    {
+        pwalletMain->ScanForWalletTransactions(chainActive.Genesis(), true, false);
+        pwalletMain->ReacceptWalletTransactions();
+    }
+
+    return NullUniValue;
+}
+
+UniValue importpubkey(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() < 1 || params.size() > 4)
+        throw runtime_error(
+            "importpubkey \"pubkey\" ( \"label\" rescan )\n"
+            "\nAdds a public key (in hex) that can be watched as if it were in your wallet but cannot be used to spend.\n"
+            "\nArguments:\n"
+            "1. \"pubkey\"           (string, required) The hex-encoded public key\n"
+            "2. \"label\"            (string, optional, default=\"\") An optional label\n"
+            "3. rescan               (boolean, optional, default=true) Rescan the wallet for transactions\n"
+            "\nNote: This call can take a long time to complete if rescan is true.\n"
+            "\nExamples:\n"
+            "\nImport a public key with rescan\n"
+            + HelpExampleCli("importpubkey", "\"mypubkey\"") +
+            "\nImport using a label without rescan\n"
+            + HelpExampleCli("importpubkey", "\"mypubkey\" \"testing\" false") +
+            "\nAs a JSON-RPC call\n"
+            + HelpExampleRpc("importpubkey", "\"mypubkey\", \"testing\", false")
+        );
+
+    if (fPruneMode)
+        throw JSONRPCError(RPC_WALLET_ERROR, "Importing public keys is disabled in pruned mode");
+
+    string strLabel = "";
+    if (params.size() > 1)
+        strLabel = params[1].get_str();
+
+    // Whether to perform rescan after import
+    bool fRescan = true;
+    if (params.size() > 2)
+        fRescan = params[2].get_bool();
+
+    if (!IsHex(params[0].get_str()))
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Pubkey must be a hex string");
+    std::vector<unsigned char> data(ParseHex(params[0].get_str()));
+    CPubKey pubKey(data.begin(), data.end());
+    if (!pubKey.IsFullyValid())
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Pubkey is not a valid public key");
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    ImportAddress(pubKey.GetID(), strLabel);
+    ImportScript(GetScriptForRawPubKey(pubKey), strLabel, false);
+
+    if (fRescan)
+    {
+        pwalletMain->ScanForWalletTransactions(chainActive.Genesis(), true, false);
+        pwalletMain->ReacceptWalletTransactions();
+    }
+
+    return NullUniValue;
+}
+
+
+UniValue z_importwallet(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "z_importwallet \"filename\"\n"
+            "\nImports taddr and zaddr keys from a wallet export file (see z_exportwallet).\n"
+            "\nArguments:\n"
+            "1. \"filename\"    (string, required) The wallet file\n"
+            "\nExamples:\n"
+            "\nDump the wallet\n"
+            + HelpExampleCli("z_exportwallet", "\"nameofbackup\"") +
+            "\nImport the wallet\n"
+            + HelpExampleCli("z_importwallet", "\"path/to/exportdir/nameofbackup\"") +
+            "\nImport using the json rpc call\n"
+            + HelpExampleRpc("z_importwallet", "\"path/to/exportdir/nameofbackup\"")
+        );
+
+	return importwallet_impl(params, true);
+}
+
+UniValue importwallet(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "importwallet \"filename\"\n"
+            "\nImports taddr keys from a wallet dump file (see dumpwallet).\n"
+            "\nArguments:\n"
+            "1. \"filename\"    (string, required) The wallet file\n"
+            "\nExamples:\n"
+            "\nDump the wallet\n"
+            + HelpExampleCli("dumpwallet", "\"nameofbackup\"") +
+            "\nImport the wallet\n"
+            + HelpExampleCli("importwallet", "\"path/to/exportdir/nameofbackup\"") +
+            "\nImport using the json rpc call\n"
+            + HelpExampleRpc("importwallet", "\"path/to/exportdir/nameofbackup\"")
+        );
+
+	return importwallet_impl(params, false);
+}
+
+UniValue importwallet_impl(const UniValue& params, bool fImportZKeys)
+{
+    if (fPruneMode)
+        throw JSONRPCError(RPC_WALLET_ERROR, "Importing wallets is disabled in pruned mode");
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    EnsureWalletIsUnlocked();
+
+    ifstream file;
+    file.open(params[0].get_str().c_str(), std::ios::in | std::ios::ate);
+    if (!file.is_open())
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Cannot open wallet dump file");
+
+    int64_t nTimeBegin = chainActive.Tip()->GetBlockTime();
+
+    bool fGood = true;
+
+    int64_t nFilesize = std::max((int64_t)1, (int64_t)file.tellg());
+    file.seekg(0, file.beg);
+
+    const auto& chainparams = Params();
+    KeyIO keyIO(chainparams);
+
+    pwalletMain->ShowProgress(_("Importing..."), 0); // show progress dialog in GUI
+    while (file.good()) {
+        pwalletMain->ShowProgress("", std::max(1, std::min(99, (int)(((double)file.tellg() / (double)nFilesize) * 100))));
+        std::string line;
+        std::getline(file, line);
+        if (line.empty() || line[0] == '#')
+            continue;
+
+        std::vector<std::string> vstr;
+        boost::split(vstr, line, boost::is_any_of(" "));
+        if (vstr.size() < 2)
+            continue;
+
+        // Let's see if the address is a valid Zcash spending key
+        if (fImportZKeys) {
+            auto spendingkey = keyIO.DecodeSpendingKey(vstr[0]);
+            int64_t nTime = DecodeDumpTime(vstr[1]);
+            // Only include hdKeypath and seedFpStr if we have both
+            std::optional<std::string> hdKeypath = (vstr.size() > 3) ? std::optional<std::string>(vstr[2]) : std::nullopt;
+            std::optional<std::string> seedFpStr = (vstr.size() > 3) ? std::optional<std::string>(vstr[3]) : std::nullopt;
+            if (spendingkey.has_value()) {
+                auto addResult = std::visit(
+                    AddSpendingKeyToWallet(pwalletMain, chainparams.GetConsensus(), nTime, hdKeypath, seedFpStr, true, true), spendingkey.value());
+                if (addResult == KeyAlreadyExists){
+                    LogPrint("zrpc", "Skipping import of zaddr (key already present)\n");
+                } else if (addResult == KeyNotAdded) {
+                    // Something went wrong
+                    fGood = false;
+                }
+                continue;
+            } else {
+                LogPrint("zrpc", "Importing detected an error: invalid spending key. Trying as a transparent key...\n");
+                // Not a valid spending key, so carry on and see if it's a Zcash style t-address.
+            }
+        }
+
+        CKey key = keyIO.DecodeSecret(vstr[0]);
+        if (!key.IsValid())
+            continue;
+        CPubKey pubkey = key.GetPubKey();
+        assert(key.VerifyPubKey(pubkey));
+        CKeyID keyid = pubkey.GetID();
+        if (pwalletMain->HaveKey(keyid)) {
+            LogPrintf("Skipping import of %s (key already present)\n", keyIO.EncodeDestination(keyid));
+            continue;
+        }
+        int64_t nTime = DecodeDumpTime(vstr[1]);
+        std::string strLabel;
+        bool fLabel = true;
+        for (unsigned int nStr = 2; nStr < vstr.size(); nStr++) {
+            if (boost::algorithm::starts_with(vstr[nStr], "#"))
+                break;
+            if (vstr[nStr] == "change=1")
+                fLabel = false;
+            if (vstr[nStr] == "reserve=1")
+                fLabel = false;
+            if (boost::algorithm::starts_with(vstr[nStr], "label=")) {
+                strLabel = DecodeDumpString(vstr[nStr].substr(6));
+                fLabel = true;
+            }
+        }
+        LogPrintf("Importing %s...\n", keyIO.EncodeDestination(keyid));
+        if (!pwalletMain->AddKeyPubKey(key, pubkey)) {
+            fGood = false;
+            continue;
+        }
+        pwalletMain->mapKeyMetadata[keyid].nCreateTime = nTime;
+        if (fLabel)
+            pwalletMain->SetAddressBook(keyid, strLabel, "receive");
+        nTimeBegin = std::min(nTimeBegin, nTime);
+    }
+    file.close();
+    pwalletMain->ShowProgress("", 100); // hide progress dialog in GUI
+
+    CBlockIndex *pindex = chainActive.Tip();
+    while (pindex && pindex->pprev && pindex->GetBlockTime() > nTimeBegin - TIMESTAMP_WINDOW) {
+        pindex = pindex->pprev;
+    }
+
+    if (!pwalletMain->nTimeFirstKey || nTimeBegin < pwalletMain->nTimeFirstKey)
+        pwalletMain->nTimeFirstKey = nTimeBegin;
+
+    LogPrintf("Rescanning last %i blocks\n", chainActive.Height() - pindex->nHeight + 1);
+    pwalletMain->ScanForWalletTransactions(pindex, false, false);
+    pwalletMain->MarkDirty();
+
+    if (!fGood)
+        throw JSONRPCError(RPC_WALLET_ERROR, "Error adding some keys to wallet");
+
+    return NullUniValue;
+}
+
+UniValue dumpprivkey(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "dumpprivkey \"t-addr\"\n"
+            "\nReveals the private key corresponding to 't-addr'.\n"
+            "Then the importprivkey can be used with this output\n"
+            "\nArguments:\n"
+            "1. \"t-addr\"   (string, required) The transparent address for the private key\n"
+            "\nResult:\n"
+            "\"key\"         (string) The private key\n"
+            "\nExamples:\n"
+            + HelpExampleCli("dumpprivkey", "\"myaddress\"")
+            + HelpExampleCli("importprivkey", "\"mykey\"")
+            + HelpExampleRpc("dumpprivkey", "\"myaddress\"")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    EnsureWalletIsUnlocked();
+
+    KeyIO keyIO(Params());
+
+    std::string strAddress = params[0].get_str();
+    CTxDestination dest = keyIO.DecodeDestination(strAddress);
+    if (!IsValidDestination(dest)) {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid Zcash address");
+    }
+    const CKeyID *keyID = std::get_if<CKeyID>(&dest);
+    if (!keyID) {
+        throw JSONRPCError(RPC_TYPE_ERROR, "Address does not refer to a key");
+    }
+    CKey vchSecret;
+    if (!pwalletMain->GetKey(*keyID, vchSecret)) {
+        throw JSONRPCError(RPC_WALLET_ERROR, "Private key for address " + strAddress + " is not known");
+    }
+    return keyIO.EncodeSecret(vchSecret);
+}
+
+
+
+UniValue z_exportwallet(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "z_exportwallet \"filename\"\n"
+            "\nExports all wallet keys, for taddr and zaddr, in a human-readable format.  Overwriting an existing file is not permitted.\n"
+            "\nArguments:\n"
+            "1. \"filename\"    (string, required) The filename, saved in folder set by zcashd -exportdir option\n"
+            "\nResult:\n"
+            "\"path\"           (string) The full path of the destination file\n"
+            "\nExamples:\n"
+            + HelpExampleCli("z_exportwallet", "\"test\"")
+            + HelpExampleRpc("z_exportwallet", "\"test\"")
+        );
+
+	return dumpwallet_impl(params, true);
+}
+
+UniValue dumpwallet(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "dumpwallet \"filename\"\n"
+            "\nDEPRECATED. Please use the z_exportwallet RPC instead.\n"
+            "\nDumps taddr wallet keys in a human-readable format.  Overwriting an existing file is not permitted.\n"
+            "\nArguments:\n"
+            "1. \"filename\"    (string, required) The filename, saved in folder set by zcashd -exportdir option\n"
+            "\nResult:\n"
+            "\"path\"           (string) The full path of the destination file\n"
+            "\nExamples:\n"
+            + HelpExampleCli("dumpwallet", "\"test\"")
+            + HelpExampleRpc("dumpwallet", "\"test\"")
+        );
+
+	return dumpwallet_impl(params, false);
+}
+
+UniValue dumpwallet_impl(const UniValue& params, bool fDumpZKeys)
+{
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    EnsureWalletIsUnlocked();
+
+    fs::path exportdir;
+    try {
+        exportdir = GetExportDir();
+    } catch (const std::runtime_error& e) {
+        throw JSONRPCError(RPC_INTERNAL_ERROR, e.what());
+    }
+    if (exportdir.empty()) {
+        throw JSONRPCError(RPC_WALLET_ERROR, "Cannot export wallet until the zcashd -exportdir option has been set");
+    }
+    std::string unclean = params[0].get_str();
+    std::string clean = SanitizeFilename(unclean);
+    if (clean.compare(unclean) != 0) {
+        throw JSONRPCError(RPC_WALLET_ERROR, strprintf("Filename is invalid as only alphanumeric characters are allowed.  Try '%s' instead.", clean));
+    }
+    fs::path exportfilepath = exportdir / clean;
+
+    if (fs::exists(exportfilepath)) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Cannot overwrite existing file " + exportfilepath.string());
+    }
+
+    ofstream file;
+    file.open(exportfilepath.string().c_str());
+    if (!file.is_open())
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Cannot open wallet dump file");
+
+    std::map<CKeyID, int64_t> mapKeyBirth;
+    std::set<CKeyID> setKeyPool;
+    pwalletMain->GetKeyBirthTimes(mapKeyBirth);
+    pwalletMain->GetAllReserveKeys(setKeyPool);
+
+    // sort time/key pairs
+    std::vector<std::pair<int64_t, CKeyID> > vKeyBirth;
+    for (std::map<CKeyID, int64_t>::const_iterator it = mapKeyBirth.begin(); it != mapKeyBirth.end(); it++) {
+        vKeyBirth.push_back(std::make_pair(it->second, it->first));
+    }
+    mapKeyBirth.clear();
+    std::sort(vKeyBirth.begin(), vKeyBirth.end());
+
+    KeyIO keyIO(Params());
+
+    // produce output
+    file << strprintf("# Wallet dump created by Zcash %s (%s)\n", CLIENT_BUILD, CLIENT_DATE);
+    file << strprintf("# * Created on %s\n", EncodeDumpTime(GetTime()));
+    file << strprintf("# * Best block at time of backup was %i (%s),\n", chainActive.Height(), chainActive.Tip()->GetBlockHash().ToString());
+    file << strprintf("#   mined on %s\n", EncodeDumpTime(chainActive.Tip()->GetBlockTime()));
+
+    std::optional<MnemonicSeed> hdSeed = pwalletMain->GetMnemonicSeed();
+    if (hdSeed.has_value()) {
+        auto mSeed = hdSeed.value();
+        file << strprintf(
+                "# Emergency Recovery Information:\n"
+                "# - recovery_phrase=\"%s\"\n"
+                "# - language=%s\n"
+                "# - fingerprint=%s\n",
+                mSeed.GetMnemonic(),
+                MnemonicSeed::LanguageName(mSeed.GetLanguage()),
+                mSeed.Fingerprint().GetHex()
+                );
+    }
+
+    std::optional<HDSeed> legacySeed = pwalletMain->GetLegacyHDSeed();
+    if (legacySeed.has_value()) {
+        auto rawSeed = legacySeed.value().RawSeed();
+        file << strprintf(
+                "# Legacy HD Seed:\n"
+                "# - seed=%s\n"
+                "# - fingerprint=%s\n",
+                HexStr(rawSeed.begin(), rawSeed.end()),
+                legacySeed.value().Fingerprint().GetHex()
+                );
+    }
+
+    file << "\n";
+    for (std::vector<std::pair<int64_t, CKeyID> >::const_iterator it = vKeyBirth.begin(); it != vKeyBirth.end(); it++) {
+        const CKeyID &keyid = it->second;
+        std::string strTime = EncodeDumpTime(it->first);
+        std::string strAddr = keyIO.EncodeDestination(keyid);
+        CKey key;
+        if (pwalletMain->GetKey(keyid, key)) {
+            CKeyMetadata keyMeta = pwalletMain->mapKeyMetadata[keyid];
+            file << strprintf("%s %s ", keyIO.EncodeSecret(key), strTime);
+            if (pwalletMain->mapAddressBook.count(keyid)) {
+                file << strprintf("label=%s", EncodeDumpString(pwalletMain->mapAddressBook[keyid].name));
+            } else if (setKeyPool.count(keyid)) {
+                file << "reserve=1";
+            } else {
+                file << "change=1";
+            }
+            file << strprintf(" # addr=%s", strAddr);
+            if (!(keyMeta.hdKeypath.empty() || keyMeta.seedFp.IsNull())) {
+                file << strprintf(" hdkeypath=%s seedfp=%s", keyMeta.hdKeypath, keyMeta.seedFp.GetHex());
+            }
+            file << "\n";
+        }
+    }
+    file << "\n";
+
+    if (fDumpZKeys) {
+        std::set<libzcash::SproutPaymentAddress> sproutAddresses;
+        pwalletMain->GetSproutPaymentAddresses(sproutAddresses);
+        file << "\n";
+        file << "# Zkeys\n";
+        file << "\n";
+        for (auto addr : sproutAddresses) {
+            libzcash::SproutSpendingKey key;
+            if (pwalletMain->GetSproutSpendingKey(addr, key)) {
+                std::string strTime = EncodeDumpTime(pwalletMain->mapSproutZKeyMetadata[addr].nCreateTime);
+                file << strprintf("%s %s # zaddr=%s\n", keyIO.EncodeSpendingKey(key), strTime, keyIO.EncodePaymentAddress(addr));
+            }
+        }
+        std::set<libzcash::SaplingPaymentAddress> saplingAddresses;
+        pwalletMain->GetSaplingPaymentAddresses(saplingAddresses);
+        file << "\n";
+        file << "# Sapling keys\n";
+        file << "\n";
+        for (auto addr : saplingAddresses) {
+            libzcash::SaplingExtendedSpendingKey extsk;
+            if (pwalletMain->GetSaplingExtendedSpendingKey(addr, extsk)) {
+                auto ivk = extsk.expsk.full_viewing_key().in_viewing_key();
+                CKeyMetadata keyMeta = pwalletMain->mapSaplingZKeyMetadata[ivk];
+                std::string strTime = EncodeDumpTime(keyMeta.nCreateTime);
+                file << strprintf("%s %s", keyIO.EncodeSpendingKey(extsk), strTime);
+                // Keys imported with z_importkey do not have zip32 metadata
+                if (!(keyMeta.hdKeypath.empty() || keyMeta.seedFp.IsNull())) {
+                    file << strprintf(" %s %s", keyMeta.hdKeypath, keyMeta.seedFp.GetHex());
+                }
+                file << strprintf(" # zaddr=%s\n", keyIO.EncodePaymentAddress(addr));
+            }
+        }
+        file << "\n";
+    }
+
+    file << "# End of dump\n";
+    file.close();
+
+    return exportfilepath.string();
+}
+
+
+UniValue z_importkey(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() < 1 || params.size() > 3)
+        throw runtime_error(
+            "z_importkey \"zkey\" ( rescan startHeight )\n"
+            "\nAdds a zkey (as returned by z_exportkey) to your wallet."
+            "\nImport of Orchard keys is not supported.\n"
+            "\nArguments:\n"
+            "1. \"zkey\"             (string, required) The zkey (see z_exportkey)\n"
+            "2. rescan             (string, optional, default=\"whenkeyisnew\") Rescan the wallet for transactions - can be \"yes\", \"no\" or \"whenkeyisnew\"\n"
+            "3. startHeight        (numeric, optional, default=0) Block height to start rescan from\n"
+            "\nNote: This call can take a long time to complete if rescan is true.\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"address_type\" : \"xxxx\",                 (string) \"sprout\" or \"sapling\"\n"
+            "  \"type\" : \"xxxx\",                         (string) \"sprout\" or \"sapling\" (DEPRECATED, legacy attribute)\n"
+            "  \"address\" : \"address|DefaultAddress\",    (string) The address corresponding to the spending key (for Sapling, this is the default address).\n"
+            "}\n"
+            "\nExamples:\n"
+            "\nExport a zkey\n"
+            + HelpExampleCli("z_exportkey", "\"myaddress\"") +
+            "\nImport the zkey with rescan\n"
+            + HelpExampleCli("z_importkey", "\"mykey\"") +
+            "\nImport the zkey with partial rescan\n"
+            + HelpExampleCli("z_importkey", "\"mykey\" whenkeyisnew 30000") +
+            "\nRe-import the zkey with longer partial rescan\n"
+            + HelpExampleCli("z_importkey", "\"mykey\" yes 20000") +
+            "\nAs a JSON-RPC call\n"
+            + HelpExampleRpc("z_importkey", "\"mykey\", \"no\"")
+        );
+
+    if (fPruneMode)
+        throw JSONRPCError(RPC_WALLET_ERROR, "Importing keys is disabled in pruned mode");
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    EnsureWalletIsUnlocked();
+
+    // Whether to perform rescan after import
+    bool fRescan = true;
+    bool fIgnoreExistingKey = true;
+    if (params.size() > 1) {
+        auto rescan = params[1].get_str();
+        if (rescan.compare("whenkeyisnew") != 0) {
+            fIgnoreExistingKey = false;
+            if (rescan.compare("yes") == 0) {
+                fRescan = true;
+            } else if (rescan.compare("no") == 0) {
+                fRescan = false;
+            } else {
+                // Handle older API
+                UniValue jVal;
+                if (!jVal.read(std::string("[")+rescan+std::string("]")) ||
+                    !jVal.isArray() || jVal.size()!=1 || !jVal[0].isBool()) {
+                    throw JSONRPCError(
+                        RPC_INVALID_PARAMETER,
+                        "rescan must be \"yes\", \"no\" or \"whenkeyisnew\"");
+                }
+                fRescan = jVal[0].getBool();
+            }
+        }
+    }
+
+    // Height to rescan from
+    int nRescanHeight = 0;
+    if (params.size() > 2)
+        nRescanHeight = params[2].get_int();
+    if (nRescanHeight < 0 || nRescanHeight > chainActive.Height()) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Block height out of range");
+    }
+
+    const auto& chainparams = Params();
+    KeyIO keyIO(chainparams);
+    string strSecret = params[0].get_str();
+    auto spendingkey = keyIO.DecodeSpendingKey(strSecret);
+    if (!spendingkey.has_value()) {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid spending key");
+    }
+
+    auto addrInfo = std::visit(libzcash::AddressInfoFromSpendingKey{}, spendingkey.value());
+    UniValue result(UniValue::VOBJ);
+    result.pushKV("address_type", addrInfo.first);
+    if (fEnableAddrTypeField) {
+        result.pushKV("type", addrInfo.first); //deprecated
+    }
+    result.pushKV("address", keyIO.EncodePaymentAddress(addrInfo.second));
+
+    // Sapling support
+    auto addResult = std::visit(AddSpendingKeyToWallet(pwalletMain, chainparams.GetConsensus()), spendingkey.value());
+    if (addResult == KeyAlreadyExists && fIgnoreExistingKey) {
+        return result;
+    }
+    pwalletMain->MarkDirty();
+    if (addResult == KeyNotAdded) {
+        throw JSONRPCError(RPC_WALLET_ERROR, "Error adding spending key to wallet");
+    }
+
+    // whenever a key is imported, we need to scan the whole chain
+    pwalletMain->nTimeFirstKey = 1; // 0 would be considered 'no value'
+
+    // We want to scan for transactions and notes
+    if (fRescan) {
+        pwalletMain->ScanForWalletTransactions(chainActive[nRescanHeight], true, false);
+    }
+
+    return result;
+}
+
+UniValue z_importviewingkey(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() < 1 || params.size() > 3)
+        throw runtime_error(
+            "z_importviewingkey \"vkey\" ( rescan startHeight )\n"
+            "\nAdds a viewing key (as returned by z_exportviewingkey) to your wallet.\n"
+            "\nArguments:\n"
+            "1. \"vkey\"             (string, required) The viewing key (see z_exportviewingkey)\n"
+            "2. rescan             (string, optional, default=\"whenkeyisnew\") Rescan the wallet for transactions - can be \"yes\", \"no\" or \"whenkeyisnew\"\n"
+            "3. startHeight        (numeric, optional, default=0) Block height to start rescan from\n"
+            "\nNote: This call can take a long time to complete if rescan is true. Import of Unified viewing keys is not yet supported.\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"address_type\" : \"xxxx\",                 (string) \"sprout\" or \"sapling\"\n"
+            "  \"type\" : \"xxxx\",                         (string) \"sprout\" or \"sapling\" (DEPRECATED, legacy attribute)\n"
+            "  \"address\" : \"address|DefaultAddress\",    (string) The address corresponding to the viewing key (for Sapling, this is the default address).\n"
+            "}\n"
+            "\nExamples:\n"
+            "\nImport a viewing key\n"
+            + HelpExampleCli("z_importviewingkey", "\"vkey\"") +
+            "\nImport the viewing key without rescan\n"
+            + HelpExampleCli("z_importviewingkey", "\"vkey\", no") +
+            "\nImport the viewing key with partial rescan\n"
+            + HelpExampleCli("z_importviewingkey", "\"vkey\" whenkeyisnew 30000") +
+            "\nRe-import the viewing key with longer partial rescan\n"
+            + HelpExampleCli("z_importviewingkey", "\"vkey\" yes 20000") +
+            "\nAs a JSON-RPC call\n"
+            + HelpExampleRpc("z_importviewingkey", "\"vkey\", \"no\"")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    EnsureWalletIsUnlocked();
+
+    // Whether to perform rescan after import
+    bool fRescan = true;
+    bool fIgnoreExistingKey = true;
+    if (params.size() > 1) {
+        auto rescan = params[1].get_str();
+        if (rescan.compare("whenkeyisnew") != 0) {
+            fIgnoreExistingKey = false;
+            if (rescan.compare("no") == 0) {
+                fRescan = false;
+            } else if (rescan.compare("yes") != 0) {
+                throw JSONRPCError(
+                    RPC_INVALID_PARAMETER,
+                    "rescan must be \"yes\", \"no\" or \"whenkeyisnew\"");
+            }
+        }
+    }
+
+    // Height to rescan from
+    int nRescanHeight = 0;
+    if (params.size() > 2) {
+        nRescanHeight = params[2].get_int();
+    }
+    if (nRescanHeight < 0 || nRescanHeight > chainActive.Height()) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Block height out of range");
+    }
+
+    const auto& chainparams = Params();
+    KeyIO keyIO(chainparams);
+    string strVKey = params[0].get_str();
+    auto viewingkey = keyIO.DecodeViewingKey(strVKey);
+    if (!viewingkey.has_value()) {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid viewing key");
+    }
+
+    auto addrInfo = std::visit(libzcash::AddressInfoFromViewingKey(chainparams), viewingkey.value());
+    UniValue result(UniValue::VOBJ);
+    const string strAddress = keyIO.EncodePaymentAddress(addrInfo.second);
+    result.pushKV("address_type", addrInfo.first);
+    if (fEnableAddrTypeField) {
+        result.pushKV("type", addrInfo.first); //deprecated
+    }
+    result.pushKV("address", strAddress);
+
+    auto addResult = std::visit(AddViewingKeyToWallet(pwalletMain, true), viewingkey.value());
+    if (addResult == SpendingKeyExists) {
+        throw JSONRPCError(
+            RPC_WALLET_ERROR,
+            "The wallet already contains the private key for this viewing key (address: " + strAddress + ")");
+    } else if (addResult == KeyAlreadyExists && fIgnoreExistingKey) {
+        return result;
+    }
+    pwalletMain->MarkDirty();
+    if (addResult == KeyNotAdded) {
+        throw JSONRPCError(RPC_WALLET_ERROR, "Error adding viewing key to wallet");
+    }
+
+    // We want to scan for transactions and notes
+    if (fRescan) {
+        pwalletMain->ScanForWalletTransactions(chainActive[nRescanHeight], true, false);
+    }
+
+    return result;
+}
+
+UniValue z_exportkey(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "z_exportkey \"zaddr\"\n"
+            "\nReveals the zkey corresponding to 'zaddr'.\n"
+            "Then the z_importkey can be used with this output\n"
+            "\nArguments:\n"
+            "1. \"zaddr\"   (string, required) The zaddr for the private key\n"
+            "\nResult:\n"
+            "\"key\"                  (string) The private key\n"
+            "\nExamples:\n"
+            + HelpExampleCli("z_exportkey", "\"myaddress\"")
+            + HelpExampleCli("z_importkey", "\"mykey\"")
+            + HelpExampleRpc("z_exportkey", "\"myaddress\"")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    EnsureWalletIsUnlocked();
+
+    string strAddress = params[0].get_str();
+
+    KeyIO keyIO(Params());
+    auto address = keyIO.DecodePaymentAddress(strAddress);
+    if (!address.has_value()) {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid zaddr");
+    }
+
+    std::string result = std::visit(match {
+        [&](const CKeyID& addr) {
+            CKey key;
+            if (pwalletMain->GetKey(addr, key)) {
+                return keyIO.EncodeSecret(key);
+            } else {
+                throw JSONRPCError(RPC_WALLET_ERROR, "Wallet does not hold the private key for this address.");
+            }
+        },
+        [&](const CScriptID& addr) {
+            CScript redeemScript;
+            if (pwalletMain->GetCScript(addr, redeemScript)) {
+                return FormatScript(redeemScript);
+            } else {
+                throw JSONRPCError(RPC_WALLET_ERROR, "Wallet does not hold the redeem script for this P2SH address.");
+            }
+        },
+        [&](const libzcash::SproutPaymentAddress& addr) {
+            libzcash::SproutSpendingKey key;
+            if (pwalletMain->GetSproutSpendingKey(addr, key)) {
+                return keyIO.EncodeSpendingKey(key);
+            } else {
+                throw JSONRPCError(RPC_WALLET_ERROR, "Wallet does not hold the private spending key for this Sprout address");
+            }
+        },
+        [&](const libzcash::SaplingPaymentAddress& addr) {
+            libzcash::SaplingExtendedSpendingKey extsk;
+            if (pwalletMain->GetSaplingExtendedSpendingKey(addr, extsk)) {
+                return keyIO.EncodeSpendingKey(extsk);
+            } else {
+                throw JSONRPCError(RPC_WALLET_ERROR, "Wallet does not hold the private spending key for this Sapling address");
+            }
+        },
+        [&](const libzcash::UnifiedAddress& ua) {
+            throw JSONRPCError(
+                    RPC_WALLET_ERROR,
+                    "No serialized form is defined for unified spending keys. "
+                    "Use the emergency recovery phrase for this wallet for backup purposes instead.");
+            return std::string(); //unreachable, here to make the compiler happy
+        }
+    }, address.value());
+    return result;
+}
+
+UniValue z_exportviewingkey(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "z_exportviewingkey \"zaddr\"\n"
+            "\nReturns the full viewing key corresponding to 'zaddr' in the format specified by\n"
+            "https://zips.z.cash/protocol/protocol.pdf#addressandkeyencoding.\n"
+            "z_importviewingkey can be used to import Sprout and Sapling exported in this format;\n"
+            "import of unified viewing keys is not yet supported.\n"
+            "\nArguments:\n"
+            "1. \"zaddr\"   (string, required) The zaddr for the viewing key\n"
+            "\nResult:\n"
+            "\"vkey\"                  (string) The viewing key\n"
+            "\nExamples:\n"
+            + HelpExampleCli("z_exportviewingkey", "\"myaddress\"")
+            + HelpExampleRpc("z_exportviewingkey", "\"myaddress\"")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    EnsureWalletIsUnlocked();
+
+    string strAddress = params[0].get_str();
+
+    KeyIO keyIO(Params());
+    auto address = keyIO.DecodePaymentAddress(strAddress);
+    if (!address.has_value()) {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid zaddr");
+    }
+
+    auto vk = std::visit(GetViewingKeyForPaymentAddress(pwalletMain), address.value());
+    if (vk) {
+        return keyIO.EncodeViewingKey(vk.value());
+    } else {
+        throw JSONRPCError(RPC_WALLET_ERROR, "Wallet does not hold private key or viewing key for this zaddr");
+    }
+}
diff --git a/depend/zcash/src/wallet/rpcwallet.cpp b/depend/zcash/src/wallet/rpcwallet.cpp
new file mode 100644
index 000000000..44594765c
--- /dev/null
+++ b/depend/zcash/src/wallet/rpcwallet.cpp
@@ -0,0 +1,6344 @@
+// Copyright (c) 2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "amount.h"
+#include "consensus/upgrades.h"
+#include "consensus/params.h"
+#include "core_io.h"
+#include "deprecation.h"
+#include "experimental_features.h"
+#include "init.h"
+#include "key_io.h"
+#include "main.h"
+#include "net.h"
+#include "netbase.h"
+#include "proof_verifier.h"
+#include "rpc/server.h"
+#include "timedata.h"
+#include "tinyformat.h"
+#include "transaction_builder.h"
+#include "util.h"
+#include "util/match.h"
+#include "utilmoneystr.h"
+#include "utilstrencodings.h"
+#include "wallet.h"
+#include "walletdb.h"
+#include "primitives/transaction.h"
+#include "zcbenchmarks.h"
+#include "script/interpreter.h"
+#include "zcash/Zcash.h"
+#include "zcash/Address.hpp"
+#include "zcash/address/zip32.h"
+
+#include "utiltime.h"
+#include "asyncrpcoperation.h"
+#include "asyncrpcqueue.h"
+#include "wallet/asyncrpcoperation_mergetoaddress.h"
+#include "wallet/asyncrpcoperation_saplingmigration.h"
+#include "wallet/asyncrpcoperation_sendmany.h"
+#include "wallet/asyncrpcoperation_shieldcoinbase.h"
+
+#include <stdint.h>
+
+#include <boost/assign/list_of.hpp>
+#include <boost/algorithm/string/trim.hpp>
+#include <utf8.h>
+
+#include <univalue.h>
+
+#include <algorithm>
+#include <numeric>
+#include <optional>
+#include <variant>
+
+#include <rust/ed25519.h>
+
+using namespace std;
+
+using namespace libzcash;
+
+const std::string ADDR_TYPE_SPROUT = "sprout";
+const std::string ADDR_TYPE_SAPLING = "sapling";
+const std::string ADDR_TYPE_ORCHARD = "orchard";
+
+extern UniValue TxJoinSplitToJSON(const CTransaction& tx);
+
+int64_t nWalletUnlockTime;
+static CCriticalSection cs_nWalletUnlockTime;
+
+// Private method:
+UniValue z_getoperationstatus_IMPL(const UniValue&, bool);
+
+std::string HelpRequiringPassphrase()
+{
+    return pwalletMain && pwalletMain->IsCrypted()
+        ? "\nRequires wallet passphrase to be set with walletpassphrase call."
+        : "";
+}
+
+bool EnsureWalletIsAvailable(bool avoidException)
+{
+    if (!pwalletMain)
+    {
+        if (!avoidException)
+            throw JSONRPCError(RPC_METHOD_NOT_FOUND, "Method not found (disabled)");
+        else
+            return false;
+    }
+    return true;
+}
+
+void EnsureWalletIsBackedUp(const CChainParams& params)
+{
+    if (GetBoolArg("-walletrequirebackup", params.RequireWalletBackup()) && !pwalletMain->MnemonicVerified())
+        throw JSONRPCError(
+                RPC_WALLET_BACKUP_REQUIRED,
+                "Error: Please acknowledge that you have backed up the wallet's emergency recovery phrase "
+                "by using zcashd-wallet-tool first."
+                );
+}
+
+void EnsureWalletIsUnlocked()
+{
+    if (pwalletMain->IsLocked())
+        throw JSONRPCError(RPC_WALLET_UNLOCK_NEEDED, "Error: Please enter the wallet passphrase with walletpassphrase first.");
+}
+
+void ThrowIfInitialBlockDownload()
+{
+    if (IsInitialBlockDownload(Params().GetConsensus())) {
+        throw JSONRPCError(RPC_CLIENT_IN_INITIAL_DOWNLOAD, "Error: Sending transactions is not supported during initial block download.");
+    }
+}
+
+void WalletTxToJSON(const CWalletTx& wtx, UniValue& entry)
+{
+    int confirms = wtx.GetDepthInMainChain();
+    std::string status = "waiting";
+
+    entry.pushKV("confirmations", confirms);
+    if (wtx.IsCoinBase())
+        entry.pushKV("generated", true);
+    if (confirms > 0)
+    {
+        entry.pushKV("blockhash", wtx.hashBlock.GetHex());
+        entry.pushKV("blockindex", wtx.nIndex);
+        entry.pushKV("blocktime", mapBlockIndex[wtx.hashBlock]->GetBlockTime());
+        entry.pushKV("expiryheight", (int64_t)wtx.nExpiryHeight);
+        status = "mined";
+    }
+    else
+    {
+        const int height = chainActive.Height();
+        if (!IsExpiredTx(wtx, height) && IsExpiringSoonTx(wtx, height + 1))
+            status = "expiringsoon";
+        else if (IsExpiredTx(wtx, height))
+            status = "expired";
+    }
+    entry.pushKV("status", status);
+
+    uint256 hash = wtx.GetHash();
+    entry.pushKV("txid", hash.GetHex());
+    UniValue conflicts(UniValue::VARR);
+    for (const uint256& conflict : wtx.GetConflicts())
+        conflicts.push_back(conflict.GetHex());
+    entry.pushKV("walletconflicts", conflicts);
+    entry.pushKV("time", wtx.GetTxTime());
+    entry.pushKV("timereceived", (int64_t)wtx.nTimeReceived);
+    for (const std::pair<string, string>& item : wtx.mapValue)
+        entry.pushKV(item.first, item.second);
+
+    entry.pushKV("vjoinsplit", TxJoinSplitToJSON(wtx));
+}
+
+UniValue getnewaddress(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (!fEnableGetNewAddress)
+        throw runtime_error(
+            "getnewaddress is DEPRECATED and will be removed in a future release\n"
+            "\nUse z_getnewaccount and z_getaddressforaccount instead, or restart \n"
+            "with `-allowdeprecated=getnewaddress` if you require backward compatibility.\n"
+            "See https://zcash.github.io/zcash/user/deprecation.html for more information.");
+
+    if (fHelp || params.size() > 1)
+        throw runtime_error(
+            "getnewaddress ( \"\" )\n"
+            "\nDEPRECATED. Use z_getnewaccount and z_getaddressforaccount instead.\n"
+            "\nReturns a new transparent Zcash address.\n"
+            "Payments received by this API are visible on-chain and do not otherwise\n"
+            "provide privacy protections; they should only be used in circumstances \n"
+            "where it is necessary to interoperate with legacy Bitcoin infrastructure.\n"
+
+            "\nArguments:\n"
+            "1. (dummy)       (string, optional) DEPRECATED. If provided, it MUST be set to the empty string \"\". Passing any other string will result in an error.\n"
+
+            "\nResult:\n"
+            "\"zcashaddress\"    (string) The new transparent Zcash address\n"
+
+            "\nExamples:\n"
+            + HelpExampleCli("getnewaddress", "")
+            + HelpExampleRpc("getnewaddress", "")
+        );
+
+    const UniValue& dummy_value = params[0];
+    if (!dummy_value.isNull() && dummy_value.get_str() != "") {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "dummy first argument must be excluded or set to \"\".");
+    }
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    const CChainParams& chainparams = Params();
+    EnsureWalletIsBackedUp(chainparams);
+
+    EnsureWalletIsUnlocked();
+
+    // Generate a new key that is added to wallet
+    CPubKey newKey = pwalletMain->GenerateNewKey(true);
+    CKeyID keyID = newKey.GetID();
+
+    std::string dummy_account;
+    pwalletMain->SetAddressBook(keyID, dummy_account, "receive");
+
+    KeyIO keyIO(chainparams);
+    return keyIO.EncodeDestination(keyID);
+}
+
+UniValue getrawchangeaddress(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (!fEnableGetRawChangeAddress)
+        throw runtime_error(
+            "getrawchangeaddress is DEPRECATED and will be removed in a future release\n"
+            "\nChange addresses are a wallet-internal feature. Use a unified address for\n"
+            "a dedicated change account instead, or restart with `-allowdeprecated=getrawchangeaddress` \n"
+            "if you require backward compatibility.\n"
+            "See https://zcash.github.io/zcash/user/deprecation.html for more information.");
+
+    if (fHelp || params.size() > 1)
+        throw runtime_error(
+            "getrawchangeaddress\n"
+            "\nDEPRECATED. Change addresses are a wallet-internal feature. Use a unified"
+            "\naddress for a dedicated change account instead.\n"
+            "\nReturns a new transparent Zcash address for receiving change.\n"
+            "This is for use with raw transactions, NOT normal use. Additionally,\n"
+            "the resulting address does not correspond to the \"change\" HD derivation\n"
+            "path.\n"
+            "\nResult:\n"
+            "\"address\"    (string) The transparent address\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getrawchangeaddress", "")
+            + HelpExampleRpc("getrawchangeaddress", "")
+       );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    const CChainParams& chainparams = Params();
+    EnsureWalletIsBackedUp(chainparams);
+
+    if (!pwalletMain->IsLocked())
+        pwalletMain->TopUpKeyPool();
+
+    CReserveKey reservekey(pwalletMain);
+    CPubKey vchPubKey;
+    if (!reservekey.GetReservedKey(vchPubKey))
+        throw JSONRPCError(RPC_WALLET_KEYPOOL_RAN_OUT, "Error: Keypool ran out, please call keypoolrefill first");
+
+    reservekey.KeepKey();
+
+    CKeyID keyID = vchPubKey.GetID();
+
+    KeyIO keyIO(chainparams);
+    return keyIO.EncodeDestination(keyID);
+}
+
+static void SendMoney(const CTxDestination &address, CAmount nValue, bool fSubtractFeeFromAmount, CWalletTx& wtxNew)
+{
+    CAmount curBalance = pwalletMain->GetBalance();
+
+    // Check amount
+    if (nValue <= 0)
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid amount");
+
+    if (nValue > curBalance)
+        throw JSONRPCError(RPC_WALLET_INSUFFICIENT_FUNDS, "Insufficient funds");
+
+    // Parse Zcash address
+    CScript scriptPubKey = GetScriptForDestination(address);
+
+    // Create and send the transaction
+    CReserveKey reservekey(pwalletMain);
+    CAmount nFeeRequired;
+    std::string strError;
+    vector<CRecipient> vecSend;
+    int nChangePosRet = -1;
+    CRecipient recipient = {scriptPubKey, nValue, fSubtractFeeFromAmount};
+    vecSend.push_back(recipient);
+    if (!pwalletMain->CreateTransaction(vecSend, wtxNew, reservekey, nFeeRequired, nChangePosRet, strError)) {
+        if (!fSubtractFeeFromAmount && nValue + nFeeRequired > pwalletMain->GetBalance())
+            strError = strprintf("Error: This transaction requires a transaction fee of at least %s because of its amount, complexity, or use of recently received funds!", FormatMoney(nFeeRequired));
+        throw JSONRPCError(RPC_WALLET_ERROR, strError);
+    }
+    if (!pwalletMain->CommitTransaction(wtxNew, reservekey))
+        throw JSONRPCError(RPC_WALLET_ERROR, "Error: The transaction was rejected! This might happen if some of the coins in your wallet were already spent, such as if you used a copy of the wallet and coins were spent in the copy but not marked as spent here.");
+}
+
+UniValue sendtoaddress(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() < 2 || params.size() > 5)
+        throw runtime_error(
+            "sendtoaddress \"zcashaddress\" amount ( \"comment\" \"comment-to\" subtractfeefromamount )\n"
+            "\nSend an amount to a given transparent address. The amount is interpreted as a real number\n"
+            "and is rounded to the nearest 0.00000001. This API will only select funds from the transparent\n"
+            "pool, and all the details of the transaction, including sender, recipient, and amount will be\n"
+            "permanently visible on the public chain. THIS API PROVIDES NO PRIVACY, and should only be\n"
+            "used when interoperability with legacy Bitcoin infrastructure is required.\n"
+            + HelpRequiringPassphrase() +
+            "\nArguments:\n"
+            "1. \"zcashaddress\"  (string, required) The transparent Zcash address to send to.\n"
+            "2. \"amount\"      (numeric, required) The amount in " + CURRENCY_UNIT + " to send. eg 0.1\n"
+            "3. \"comment\"     (string, optional) A comment used to store what the transaction is for. \n"
+            "                             This is not part of the transaction, just kept in your wallet.\n"
+            "4. \"comment-to\"  (string, optional) A comment to store the name of the person or organization \n"
+            "                             to which you're sending the transaction. This is not part of the \n"
+            "                             transaction, just kept in your wallet.\n"
+            "5. subtractfeefromamount  (boolean, optional, default=false) The fee will be deducted from the amount being sent.\n"
+            "                             The recipient will receive less Zcash than you enter in the amount field.\n"
+            "\nResult:\n"
+            "\"transactionid\"  (string) The transaction id.\n"
+            "\nExamples:\n"
+            + HelpExampleCli("sendtoaddress", "\"t1M72Sfpbz1BPpXFHz9m3CdqATR44Jvaydd\" 0.1")
+            + HelpExampleCli("sendtoaddress", "\"t1M72Sfpbz1BPpXFHz9m3CdqATR44Jvaydd\" 0.1 \"donation\" \"seans outpost\"")
+            + HelpExampleCli("sendtoaddress", "\"t1M72Sfpbz1BPpXFHz9m3CdqATR44Jvaydd\" 0.1 \"\" \"\" true")
+            + HelpExampleRpc("sendtoaddress", "\"t1M72Sfpbz1BPpXFHz9m3CdqATR44Jvaydd\", 0.1, \"donation\", \"seans outpost\"")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    KeyIO keyIO(Params());
+    auto destStr = params[0].get_str();
+    CTxDestination dest = keyIO.DecodeDestination(destStr);
+    if (!IsValidDestination(dest)) {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, std::string("Invalid " PACKAGE_NAME " transparent address: ") + destStr);
+    }
+
+    // Amount
+    CAmount nAmount = AmountFromValue(params[1]);
+    if (nAmount <= 0)
+        throw JSONRPCError(RPC_TYPE_ERROR, "Invalid amount for send");
+
+    // Wallet comments
+    CWalletTx wtx;
+    if (params.size() > 2 && !params[2].isNull() && !params[2].get_str().empty())
+        wtx.mapValue["comment"] = params[2].get_str();
+    if (params.size() > 3 && !params[3].isNull() && !params[3].get_str().empty())
+        wtx.mapValue["to"]      = params[3].get_str();
+
+    bool fSubtractFeeFromAmount = false;
+    if (params.size() > 4)
+        fSubtractFeeFromAmount = params[4].get_bool();
+
+    EnsureWalletIsUnlocked();
+
+    SendMoney(dest, nAmount, fSubtractFeeFromAmount, wtx);
+
+    return wtx.GetHash().GetHex();
+}
+
+UniValue listaddresses(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp)
+        throw runtime_error(
+            "listaddresses\n"
+            "\nLists the addresses managed by this wallet by source, including \n"
+            "those generated from randomness by this wallet, Sapling addresses \n"
+            "generated from the legacy HD seed, imported watchonly transparent \n"
+            "addresses, shielded addresses tracked using imported viewing keys, \n"
+            "and addresses derived from the wallet's mnemonic seed for releases \n"
+            "version 4.7.0 and above. \n"
+            "\nREMINDER: It is recommended that you back up your wallet.dat file \n"
+            "regularly. If your wallet was created using zcashd version 4.7.0 \n"
+            "or later and you have not imported externally produced keys, it only \n"
+            "necessary to have backed up the wallet's emergency recovery phrase.\n"
+            "\nResult:\n"
+            "[\n"
+            "  {\n"
+            "    \"source\": \"imported|imported_watchonly|legacy_random|legacy_seed|mnemonic_seed\"\n"
+            "    \"transparent\": {\n"
+            "      \"addresses\": [\"t14oHp2v54vfmdgQ3v3SNuQga8JKHTNi2a1\", ...],\n"
+            "      \"changeAddresses\": [\"t14oHp2v54vfmdgQ3v3SNuQga8JKHTNi2a1\", ...]\n"
+            "    },\n"
+            "    \"sprout\": {\n"
+            "      \"addresses\": [\"ztbx5DLDxa5ZLFTchHhoPNkKs57QzSyib6UqXpEdy76T1aUdFxJt1w9318Z8DJ73XzbnWHKEZP9Yjg712N5kMmP4QzS9iC9\", ...]\n"
+            "    },\n"
+            "    \"sapling\": [ -- each element in this list represents a set of diversified addresses derived from a single IVK. \n"
+            "      {\n"
+            "        \"zip32KeyPath\": \"m/32'/133'/0'\", -- optional field, not present for imported/watchonly sources,\n"
+            "        \"addresses\": [\n"
+            "          \"zs1z7rejlpsa98s2rrrfkwmaxu53e4ue0ulcrw0h4x5g8jl04tak0d3mm47vdtahatqrlkngh9slya\",\n"
+            "          ...\n"
+            "        ]\n"
+            "      },\n"
+            "      ...\n"
+            "    ],\n"
+            "    \"unified\": [ -- each element in this list represents a set of diversified Unified Addresses derived from a single UFVK.\n"
+            "      {\n"
+            "        \"account\": 0,\n"
+            "        \"seedfp\": \"hexstring\",\n"
+            "        \"addresses\": [\n"
+            "          {\n"
+            "            \"diversifier_index\": 0,\n"
+            "            \"receiver_types\": [\n"
+            "              \"sapling\",\n"
+            "               ...\n"
+            "            ],\n"
+            "            \"address\": \"...\"\n"
+            "          },\n"
+            "          ...\n"
+            "        ]\n"
+            "      },\n"
+            "      ...\n"
+            "    ],\n"
+            "    ...\n"
+            "  },\n"
+            "  ...\n"
+            "]"
+            "\nIn the case that a source does not have addresses for a value pool, the key\n"
+            "associated with that pool will be absent.\n"
+            "\nExamples:\n"
+            + HelpExampleCli("listaddresses", "")
+            + HelpExampleRpc("listaddresses", "")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    KeyIO keyIO(Params());
+
+    UniValue ret(UniValue::VARR);
+
+    // Split transparent addresses into several categories:
+    // - Generated randomly.
+    // - Imported
+    // - Imported watchonly.
+    // - Derived from mnemonic seed.
+    std::set<CTxDestination> t_generated_dests;
+    std::set<CTxDestination> t_generated_change_dests;
+    std::set<CTxDestination> t_mnemonic_dests;
+    std::set<CTxDestination> t_mnemonic_change_dests;
+    std::set<CTxDestination> t_imported_dests;
+    std::set<CTxDestination> t_watchonly_dests;
+    // Get the CTxDestination values for all the entries in the transparent address book.
+    // This will include any address that has been generated by this wallet.
+    for (const std::pair<CTxDestination, CAddressBookData>& item : pwalletMain->mapAddressBook) {
+        std::optional<PaymentAddressSource> source;
+        std::visit(match {
+            [&](const CKeyID& addr) {
+                source = GetSourceForPaymentAddress(pwalletMain)(addr);
+            },
+            [&](const CScriptID& addr) {
+                source = GetSourceForPaymentAddress(pwalletMain)(addr);
+            },
+            [&](const CNoDestination& addr) {}
+        }, item.first);
+        if (source.has_value()) {
+            switch (source.value()) {
+                case PaymentAddressSource::Random:
+                    t_generated_dests.insert(item.first);
+                    break;
+                case PaymentAddressSource::Imported:
+                    t_imported_dests.insert(item.first);
+                    break;
+                case PaymentAddressSource::ImportedWatchOnly:
+                    t_watchonly_dests.insert(item.first);
+                    break;
+                case PaymentAddressSource::MnemonicHDSeed:
+                    t_mnemonic_dests.insert(item.first);
+                    break;
+                default:
+                    // Not going to be in the address book.
+                    assert(false);
+            }
+        }
+    }
+
+    // Ensure we have every address that holds a balance. While this is likely to be redundant
+    // with respect to the entries in the address book for addresses generated by this wallet,
+    // there is not a guarantee that an externally generated address (such as one associated with
+    // a future unified incoming viewing key) will have been added to the address book.
+    for (const std::pair<CTxDestination, CAmount>& item : pwalletMain->GetAddressBalances()) {
+        if (t_generated_dests.count(item.first) == 0 &&
+            t_mnemonic_dests.count(item.first) == 0 &&
+            t_imported_dests.count(item.first) == 0 &&
+            t_watchonly_dests.count(item.first) == 0)
+        {
+            std::optional<PaymentAddressSource> source;
+            std::visit(match {
+                [&](const CKeyID& addr) {
+                    source = GetSourceForPaymentAddress(pwalletMain)(addr);
+                },
+                [&](const CScriptID& addr) {
+                    source = GetSourceForPaymentAddress(pwalletMain)(addr);
+                },
+                [&](const CNoDestination& addr) {}
+            }, item.first);
+            if (source.has_value()) {
+                switch (source.value()) {
+                    case PaymentAddressSource::Random:
+                        t_generated_change_dests.insert(item.first);
+                        break;
+                    case PaymentAddressSource::MnemonicHDSeed:
+                        t_mnemonic_change_dests.insert(item.first);
+                        break;
+                    default:
+                        // assume that if we didn't add the address to the addrbook
+                        // that it's a change address. Ideally we'd have a better way
+                        // of checking this by exploring the transaction graph;
+                        break;
+                }
+            }
+        }
+    }
+
+    /// sprout addresses
+    std::set<libzcash::SproutPaymentAddress> sproutAddresses;
+    pwalletMain->GetSproutPaymentAddresses(sproutAddresses);
+
+    /// sapling addresses
+    std::set<libzcash::SaplingPaymentAddress> saplingAddresses;
+    pwalletMain->GetSaplingPaymentAddresses(saplingAddresses);
+
+    // legacy_random source
+    {
+        // Add legacy randomly generated address records to the result.
+        // This includes transparent addresses generated by the wallet via
+        // the keypool and Sprout addresses for which we have the
+        // spending key.
+        UniValue entry(UniValue::VOBJ);
+        entry.pushKV("source", "legacy_random");
+        bool hasData = false;
+
+        UniValue random_t(UniValue::VOBJ);
+
+        if (!t_generated_dests.empty()) {
+            UniValue random_t_addrs(UniValue::VARR);
+            for (const CTxDestination& dest : t_generated_dests) {
+                random_t_addrs.push_back(keyIO.EncodeDestination(dest));
+            }
+            random_t.pushKV("addresses", random_t_addrs);
+            hasData = true;
+        }
+
+        if (!t_generated_change_dests.empty()) {
+            UniValue random_t_change_addrs(UniValue::VARR);
+            for (const CTxDestination& dest : t_generated_change_dests) {
+                random_t_change_addrs.push_back(keyIO.EncodeDestination(dest));
+            }
+            random_t.pushKV("changeAddresses", random_t_change_addrs);
+            hasData = true;
+        }
+
+        if (!t_generated_dests.empty() || !t_generated_change_dests.empty()) {
+            entry.pushKV("transparent", random_t);
+        }
+
+        if (!sproutAddresses.empty()) {
+            UniValue random_sprout_addrs(UniValue::VARR);
+            for (const SproutPaymentAddress& addr : sproutAddresses) {
+                if (pwalletMain->HaveSproutSpendingKey(addr)) {
+                    random_sprout_addrs.push_back(keyIO.EncodePaymentAddress(addr));
+                }
+            }
+
+            UniValue random_sprout(UniValue::VOBJ);
+            random_sprout.pushKV("addresses", random_sprout_addrs);
+
+            entry.pushKV("sprout", random_sprout);
+            hasData = true;
+        }
+
+        if (hasData) {
+            ret.push_back(entry);
+        }
+    }
+
+    // Inner function that groups Sapling addresses by IVK for use in all sources
+    // that can contain Sapling addresses. Sapling components of unified addresses,
+    // i.e. those that are associated with account IDs that are not the legacy account,
+    // will not be included in the entry.
+    auto add_sapling = [&](
+            const std::set<SaplingPaymentAddress>& addrs,
+            const PaymentAddressSource source,
+            UniValue& entry
+            ) {
+        bool hasData = false;
+
+        std::map<SaplingIncomingViewingKey, std::vector<SaplingPaymentAddress>> ivkAddrs;
+        for (const SaplingPaymentAddress& addr : addrs) {
+            if (GetSourceForPaymentAddress(pwalletMain)(addr) == source) {
+                SaplingIncomingViewingKey ivkRet;
+                if (pwalletMain->GetSaplingIncomingViewingKey(addr, ivkRet)) {
+                    // Do not include any address that is associated with a unified key.
+                    if (!pwalletMain->GetUFVKMetadataForReceiver(addr).has_value()) {
+                        ivkAddrs[ivkRet].push_back(addr);
+                    }
+                }
+            }
+        }
+
+        {
+            UniValue ivk_groups(UniValue::VARR);
+            for (const auto& [ivk, addrs] : ivkAddrs) {
+                UniValue sapling_addrs(UniValue::VARR);
+                for (const SaplingPaymentAddress& addr : addrs) {
+                    sapling_addrs.push_back(keyIO.EncodePaymentAddress(addr));
+                }
+
+                UniValue sapling_obj(UniValue::VOBJ);
+
+                if (source == PaymentAddressSource::LegacyHDSeed || source == PaymentAddressSource::MnemonicHDSeed) {
+                    std::string hdKeyPath = pwalletMain->mapSaplingZKeyMetadata[ivk].hdKeypath;
+                    if (hdKeyPath != "") {
+                        sapling_obj.pushKV("zip32KeyPath", hdKeyPath);
+                    }
+                }
+
+                sapling_obj.pushKV("addresses", sapling_addrs);
+
+                ivk_groups.push_back(sapling_obj);
+            }
+
+            if (!ivk_groups.empty()) {
+                entry.pushKV("sapling", ivk_groups);
+                hasData = true;
+            }
+        }
+
+        return hasData;
+    };
+
+    /// imported source
+    {
+        UniValue entry(UniValue::VOBJ);
+        entry.pushKV("source", "imported");
+
+        bool hasData = false;
+
+        if (!t_imported_dests.empty()) {
+            UniValue t_imported_addrs(UniValue::VARR);
+            for (const CTxDestination& dest: t_imported_dests) {
+                t_imported_addrs.push_back(keyIO.EncodeDestination(dest));
+            }
+
+            UniValue imported_t(UniValue::VOBJ);
+            imported_t.pushKV("addresses", t_imported_addrs);
+
+            entry.pushKV("transparent", imported_t);
+            hasData = true;
+        }
+
+        {
+            UniValue imported_sprout_addrs(UniValue::VARR);
+            for (const SproutPaymentAddress& addr : sproutAddresses) {
+                if (GetSourceForPaymentAddress(pwalletMain)(addr) == PaymentAddressSource::Imported) {
+                    imported_sprout_addrs.push_back(keyIO.EncodePaymentAddress(addr));
+                }
+            }
+
+            if (!imported_sprout_addrs.empty()) {
+                UniValue imported_sprout(UniValue::VOBJ);
+                imported_sprout.pushKV("addresses", imported_sprout_addrs);
+                entry.pushKV("sprout", imported_sprout);
+                hasData = true;
+            }
+        }
+
+        hasData |= add_sapling(saplingAddresses, PaymentAddressSource::Imported, entry);
+
+        if (hasData) {
+            ret.push_back(entry);
+        }
+    }
+
+    /// imported_watchonly source
+    {
+        UniValue entry(UniValue::VOBJ);
+        entry.pushKV("source", "imported_watchonly");
+        bool hasData = false;
+
+        if (!t_watchonly_dests.empty()) {
+            UniValue watchonly_t_addrs(UniValue::VARR);
+            for (const CTxDestination& dest: t_watchonly_dests) {
+                watchonly_t_addrs.push_back(keyIO.EncodeDestination(dest));
+            }
+
+            UniValue watchonly_t(UniValue::VOBJ);
+            watchonly_t.pushKV("addresses", watchonly_t_addrs);
+
+            entry.pushKV("transparent", watchonly_t);
+            hasData = true;
+        }
+
+        {
+            UniValue watchonly_sprout_addrs(UniValue::VARR);
+            for (const SproutPaymentAddress& addr : sproutAddresses) {
+                if (GetSourceForPaymentAddress(pwalletMain)(addr) == PaymentAddressSource::ImportedWatchOnly) {
+                    watchonly_sprout_addrs.push_back(keyIO.EncodePaymentAddress(addr));
+                }
+            }
+
+            if (!watchonly_sprout_addrs.empty()) {
+                UniValue watchonly_sprout(UniValue::VOBJ);
+                watchonly_sprout.pushKV("addresses", watchonly_sprout_addrs);
+                entry.pushKV("sprout", watchonly_sprout);
+                hasData = true;
+            }
+        }
+
+        hasData |= add_sapling(saplingAddresses, PaymentAddressSource::ImportedWatchOnly, entry);
+
+        if (hasData) {
+            ret.push_back(entry);
+        }
+    }
+
+    /// legacy_hdseed source
+    {
+        UniValue entry(UniValue::VOBJ);
+        entry.pushKV("source", "legacy_hdseed");
+
+        bool hasData = add_sapling(saplingAddresses, PaymentAddressSource::LegacyHDSeed, entry);
+        if (hasData) {
+            ret.push_back(entry);
+        }
+    }
+
+    // mnemonic seed source
+    {
+        UniValue entry(UniValue::VOBJ);
+        entry.pushKV("source", "mnemonic_seed");
+        bool hasData = false;
+
+        UniValue mnemonic_transparent(UniValue::VOBJ);
+
+        if (!t_mnemonic_dests.empty()) {
+            UniValue mnemonic_taddrs(UniValue::VARR);
+            for (const CTxDestination& dest : t_mnemonic_dests) {
+                mnemonic_taddrs.push_back(keyIO.EncodeDestination(dest));
+            }
+            mnemonic_transparent.pushKV("addresses", mnemonic_taddrs);
+            hasData = true;
+        }
+
+        if (!t_mnemonic_change_dests.empty()) {
+            UniValue mnemonic_change_taddrs(UniValue::VARR);
+            for (const CTxDestination& dest : t_mnemonic_change_dests) {
+                mnemonic_change_taddrs.push_back(keyIO.EncodeDestination(dest));
+            }
+            mnemonic_transparent.pushKV("changeAddresses", mnemonic_change_taddrs);
+            hasData = true;
+        }
+
+        if (!t_mnemonic_dests.empty() || !t_mnemonic_change_dests.empty()) {
+            entry.pushKV("transparent", mnemonic_transparent);
+        }
+
+        // sapling
+        hasData |= add_sapling(saplingAddresses, PaymentAddressSource::MnemonicHDSeed, entry);
+
+        // unified
+        // here, we want to use the information in mapUfvkAddressMetadata to report all the unified addresses
+        UniValue unified_groups(UniValue::VARR);
+        auto hdChain = pwalletMain->GetMnemonicHDChain();
+        for (const auto& [ufvkid, addrmeta] : pwalletMain->mapUfvkAddressMetadata) {
+            auto account = pwalletMain->GetUnifiedAccountId(ufvkid);
+            if (account.has_value() && hdChain.has_value()) {
+                // double-check that the ufvkid we get from address metadata is actually
+                // associated with the mnemonic HD chain
+                auto ufvkCheck = pwalletMain->mapUnifiedAccountKeys.find(
+                    std::make_pair(hdChain.value().GetSeedFingerprint(), account.value())
+                );
+                if (ufvkCheck != pwalletMain->mapUnifiedAccountKeys.end() && ufvkCheck->second == ufvkid) {
+                    UniValue unified_group(UniValue::VOBJ);
+                    unified_group.pushKV("account", uint64_t(account.value()));
+                    unified_group.pushKV("seedfp", hdChain.value().GetSeedFingerprint().GetHex());
+
+                    UniValue unified_addrs(UniValue::VARR);
+                    auto ufvk = pwalletMain->GetUnifiedFullViewingKey(ufvkid).value();
+                    for (const auto& [j, receiverTypes] : addrmeta.GetKnownReceiverSetsByDiversifierIndex()) {
+                        // We know we can use std::get here safely because we previously
+                        // generated a valid address for this diversifier & set of
+                        // receiver types.
+                        UniValue addrEntry(UniValue::VOBJ);
+                        auto addr = std::get<std::pair<libzcash::UnifiedAddress, diversifier_index_t>>(
+                            ufvk.Address(j, receiverTypes)
+                        );
+                        UniValue receiverTypesEntry(UniValue::VARR);
+                        for (auto t : receiverTypes) {
+                            switch(t) {
+                                case ReceiverType::P2PKH:
+                                    receiverTypesEntry.push_back("p2pkh");
+                                    break;
+                                case ReceiverType::P2SH:
+                                    receiverTypesEntry.push_back("p2sh");
+                                    break;
+                                case ReceiverType::Sapling:
+                                    receiverTypesEntry.push_back("sapling");
+                                    break;
+                                case ReceiverType::Orchard:
+                                    receiverTypesEntry.push_back("orchard");
+                                    break;
+                            }
+                        }
+                        {
+                            UniValue jVal;
+                            jVal.setNumStr(ArbitraryIntStr(std::vector(j.begin(), j.end())));
+                            addrEntry.pushKV("diversifier_index", jVal);
+                        }
+                        addrEntry.pushKV("receiver_types", receiverTypesEntry);
+                        addrEntry.pushKV("address", keyIO.EncodePaymentAddress(addr.first));
+                        unified_addrs.push_back(addrEntry);
+                    }
+                    unified_group.pushKV("addresses", unified_addrs);
+                    unified_groups.push_back(unified_group);
+                }
+            }
+        }
+
+        if (!unified_groups.empty()) {
+            entry.pushKV("unified", unified_groups);
+            hasData = true;
+        }
+
+        if (hasData) {
+            ret.push_back(entry);
+        };
+    }
+
+    return ret;
+}
+
+UniValue listaddressgroupings(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp)
+        throw runtime_error(
+            "listaddressgroupings\n"
+            "\nLists groups of transparent addresses which have had their common ownership\n"
+            "made public by common use as inputs or as the resulting change in past transactions.\n"
+            "\nResult:\n"
+            "[\n"
+            "  [\n"
+            "    [\n"
+            "      \"zcashaddress\",     (string) The zcash address\n"
+            "      amount,                 (numeric) The amount in " + CURRENCY_UNIT + "\n"
+            "    ]\n"
+            "    ,...\n"
+            "  ]\n"
+            "  ,...\n"
+            "]\n"
+            "\nExamples:\n"
+            + HelpExampleCli("listaddressgroupings", "")
+            + HelpExampleRpc("listaddressgroupings", "")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    KeyIO keyIO(Params());
+    UniValue jsonGroupings(UniValue::VARR);
+    std::map<CTxDestination, CAmount> balances = pwalletMain->GetAddressBalances();
+    for (const std::set<CTxDestination>& grouping : pwalletMain->GetAddressGroupings()) {
+        UniValue jsonGrouping(UniValue::VARR);
+        for (const CTxDestination& address : grouping)
+        {
+            UniValue addressInfo(UniValue::VARR);
+            addressInfo.push_back(keyIO.EncodeDestination(address));
+            addressInfo.push_back(ValueFromAmount(balances[address]));
+            {
+                if (pwalletMain->mapAddressBook.find(address) != pwalletMain->mapAddressBook.end()) {
+                    addressInfo.push_back(pwalletMain->mapAddressBook.find(address)->second.name);
+                }
+            }
+            jsonGrouping.push_back(addressInfo);
+        }
+        jsonGroupings.push_back(jsonGrouping);
+    }
+    return jsonGroupings;
+}
+
+UniValue signmessage(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() != 2)
+        throw runtime_error(
+            "signmessage \"t-addr\" \"message\"\n"
+            "\nSign a message with the private key of a t-addr"
+            + HelpRequiringPassphrase() + "\n"
+            "\nArguments:\n"
+            "1. \"t-addr\"  (string, required) The transparent address to use to look up the private key.\n"
+            "   that will be used to sign the message.\n"
+            "2. \"message\" (string, required) The message to create a signature of.\n"
+            "\nResult:\n"
+            "\"signature\"  (string) The signature of the message encoded in base 64\n"
+            "\nExamples:\n"
+            "\nUnlock the wallet for 30 seconds\n"
+            + HelpExampleCli("walletpassphrase", "\"mypassphrase\" 30") +
+            "\nCreate the signature\n"
+            + HelpExampleCli("signmessage", "\"t14oHp2v54vfmdgQ3v3SNuQga8JKHTNi2a1\" \"my message\"") +
+            "\nVerify the signature\n"
+            + HelpExampleCli("verifymessage", "\"t14oHp2v54vfmdgQ3v3SNuQga8JKHTNi2a1\" \"signature\" \"my message\"") +
+            "\nAs json rpc\n"
+            + HelpExampleRpc("signmessage", "\"t14oHp2v54vfmdgQ3v3SNuQga8JKHTNi2a1\", \"my message\"")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    EnsureWalletIsUnlocked();
+
+    string strAddress = params[0].get_str();
+    string strMessage = params[1].get_str();
+
+    KeyIO keyIO(Params());
+    CTxDestination dest = keyIO.DecodeDestination(strAddress);
+    if (!IsValidDestination(dest)) {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, std::string("Invalid " PACKAGE_NAME " transparent address: ") + strAddress);
+    }
+
+    const CKeyID *keyID = std::get_if<CKeyID>(&dest);
+    if (!keyID) {
+        throw JSONRPCError(RPC_TYPE_ERROR, "Address does not refer to key");
+    }
+
+    CKey key;
+    if (!pwalletMain->GetKey(*keyID, key)) {
+        throw JSONRPCError(RPC_WALLET_ERROR, "Private key not available");
+    }
+
+    CHashWriter ss(SER_GETHASH, 0);
+    ss << strMessageMagic;
+    ss << strMessage;
+
+    vector<unsigned char> vchSig;
+    if (!key.SignCompact(ss.GetHash(), vchSig))
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Sign failed");
+
+    return EncodeBase64(&vchSig[0], vchSig.size());
+}
+
+UniValue getreceivedbyaddress(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() < 1 || params.size() > 3)
+        throw runtime_error(
+            "getreceivedbyaddress \"zcashaddress\" ( minconf ) ( inZat )\n"
+            "\nReturns the total amount received by the given transparent Zcash address in transactions with at least minconf confirmations.\n"
+            "\nArguments:\n"
+            "1. \"zcashaddress\"  (string, required) The Zcash address for transactions.\n"
+            "2. minconf         (numeric, optional, default=1) Only include transactions confirmed at least this many times.\n"
+            "3. inZat           (bool, optional, default=false) Get the result amount in " + MINOR_CURRENCY_UNIT + " (as an integer).\n"
+            "\nResult:\n"
+            "amount   (numeric) The total amount in " + CURRENCY_UNIT + "(or " + MINOR_CURRENCY_UNIT + " if inZat is true) received at this address.\n"
+            "\nExamples:\n"
+            "\nThe amount from transactions with at least 1 confirmation\n"
+            + HelpExampleCli("getreceivedbyaddress", "\"t14oHp2v54vfmdgQ3v3SNuQga8JKHTNi2a1\"") +
+            "\nThe amount including unconfirmed transactions, zero confirmations\n"
+            + HelpExampleCli("getreceivedbyaddress", "\"t14oHp2v54vfmdgQ3v3SNuQga8JKHTNi2a1\" 0") +
+            "\nThe amount with at least 6 confirmations, very safe\n"
+            + HelpExampleCli("getreceivedbyaddress", "\"t14oHp2v54vfmdgQ3v3SNuQga8JKHTNi2a1\" 6") +
+            "\nAs a JSON RPC call\n"
+            + HelpExampleRpc("getreceivedbyaddress", "\"t14oHp2v54vfmdgQ3v3SNuQga8JKHTNi2a1\", 6")
+       );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    KeyIO keyIO(Params());
+    // Bitcoin address
+    auto destStr = params[0].get_str();
+    CTxDestination dest = keyIO.DecodeDestination(destStr);
+    if (!IsValidDestination(dest)) {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, std::string("Invalid " PACKAGE_NAME " transparent address: ") + destStr);
+    }
+    CScript scriptPubKey = GetScriptForDestination(dest);
+    if (!IsMine(*pwalletMain, scriptPubKey)) {
+        return ValueFromAmount(0);
+    }
+
+    // Minimum confirmations
+    int nMinDepth = 1;
+    if (params.size() > 1)
+        nMinDepth = params[1].get_int();
+
+    // Tally
+    CAmount nAmount = 0;
+    for (map<uint256, CWalletTx>::iterator it = pwalletMain->mapWallet.begin(); it != pwalletMain->mapWallet.end(); ++it)
+    {
+        const CWalletTx& wtx = (*it).second;
+        if (wtx.IsCoinBase() || !CheckFinalTx(wtx))
+            continue;
+
+        for (const CTxOut& txout : wtx.vout)
+            if (txout.scriptPubKey == scriptPubKey)
+                if (wtx.GetDepthInMainChain() >= nMinDepth)
+                    nAmount += txout.nValue;
+    }
+
+    // inZat
+    if (params.size() > 2 && params[2].get_bool()) {
+        return nAmount;
+    }
+
+    return ValueFromAmount(nAmount);
+}
+
+UniValue getbalance(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() > 4)
+        throw runtime_error(
+            "getbalance ( \"(dummy)\" minconf includeWatchonly inZat )\n"
+            "\nReturns the wallet's available transparent balance. This total\n"
+            "currently includes transparent balances associated with unified\n"
+            "accounts. Prefer to use `z_getbalanceforaccount` instead.\n"
+            "\nArguments:\n"
+            "1. (dummy)          (string, optional) Remains for backward compatibility. Must be excluded or set to \"*\" or \"\".\n"
+            "2. minconf          (numeric, optional, default=1) Only include transactions confirmed at least this many times.\n"
+            "3. includeWatchonly (bool, optional, default=false) Also include balance in watchonly addresses (see 'importaddress')\n"
+            "4. inZat            (bool, optional, default=false) Get the result amount in " + MINOR_CURRENCY_UNIT + " (as an integer).\n"
+            "\nResult:\n"
+            "amount              (numeric) The total amount in " + CURRENCY_UNIT + "(or " + MINOR_CURRENCY_UNIT + " if inZat is true) received.\n"
+            "\nExamples:\n"
+            "\nThe total amount in the wallet\n"
+            + HelpExampleCli("getbalance", "*") +
+            "\nThe total amount in the wallet at least 5 blocks confirmed\n"
+            + HelpExampleCli("getbalance", "\"*\" 6") +
+            "\nAs a JSON RPC call\n"
+            + HelpExampleRpc("getbalance", "\"*\", 6")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    const UniValue& dummy_value = params[0];
+    if (!dummy_value.isNull() && dummy_value.get_str() != "*" && dummy_value.get_str() != "") {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "dummy first argument must be excluded or set to \"*\" or \"\".");
+    }
+
+    int min_depth = 0;
+    if (!params[1].isNull()) {
+        min_depth = params[1].get_int();
+    }
+
+    isminefilter filter = ISMINE_SPENDABLE;
+    if (!params[2].isNull() && params[2].get_bool()) {
+        filter = filter | ISMINE_WATCH_ONLY;
+    }
+
+    CAmount nBalance = pwalletMain->GetBalance(filter, min_depth);
+    if (!params[3].isNull() && params[3].get_bool()) {
+        return nBalance;
+    } else {
+        return ValueFromAmount(nBalance);
+    }
+}
+
+UniValue getunconfirmedbalance(const UniValue &params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() > 0)
+        throw runtime_error(
+                "getunconfirmedbalance\n"
+                "Returns the server's total unconfirmed transparent balance\n");
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    return ValueFromAmount(pwalletMain->GetUnconfirmedBalance());
+}
+
+
+UniValue sendmany(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() < 2 || params.size() > 5)
+        throw runtime_error(
+            "sendmany \"\" {\"address\":amount,...} ( minconf \"comment\" [\"address\",...] )\n"
+            "\nSend to multiple transparent recipients, using funds from the legacy transparent\n"
+            "value pool. Amounts are decimal numbers with at most 8 digits of precision.\n"
+            "Payments sent using this API are visible on-chain and do not otherwise\n"
+            "provide privacy protections; it should only be used in circumstances \n"
+            "where it is necessary to interoperate with legacy Bitcoin infrastructure.\n"
+            "Prefer to use `z_sendmany` instead.\n"
+            + HelpRequiringPassphrase() + "\n"
+            "\nArguments:\n"
+            "1. \"dummy\"               (string, required) Must be set to \"\" for backwards compatibility.\n"
+            "2. \"amounts\"             (string, required) A json object with addresses and amounts\n"
+            "    {\n"
+            "      \"address\":amount   (numeric) The Zcash address is the key, the numeric amount in " + CURRENCY_UNIT + " is the value\n"
+            "      ,...\n"
+            "    }\n"
+            "3. minconf                 (numeric, optional, default=1) Only use the balance confirmed at least this many times.\n"
+            "4. \"comment\"             (string, optional) A comment\n"
+            "5. subtractfeefromamount   (string, optional) A json array with addresses.\n"
+            "                           The fee will be equally deducted from the amount of each selected address.\n"
+            "                           Those recipients will receive less Zcash than you enter in their corresponding amount field.\n"
+            "                           If no addresses are specified here, the sender pays the fee.\n"
+            "    [\n"
+            "      \"address\"            (string) Subtract fee from this address\n"
+            "      ,...\n"
+            "    ]\n"
+            "\nResult:\n"
+            "\"transactionid\"          (string) The transaction id for the send. Only 1 transaction is created regardless of \n"
+            "                                    the number of addresses.\n"
+            "\nExamples:\n"
+            "\nSend two amounts to two different addresses:\n"
+            + HelpExampleCli("sendmany", "\"\" \"{\\\"t14oHp2v54vfmdgQ3v3SNuQga8JKHTNi2a1\\\":0.01,\\\"t1353tsE8YMTA4EuV7dgUXGjNFf9KpVvKHz\\\":0.02}\"") +
+            "\nSend two amounts to two different addresses setting the confirmation and comment:\n"
+            + HelpExampleCli("sendmany", "\"\" \"{\\\"t14oHp2v54vfmdgQ3v3SNuQga8JKHTNi2a1\\\":0.01,\\\"t1353tsE8YMTA4EuV7dgUXGjNFf9KpVvKHz\\\":0.02}\" 6 \"testing\"") +
+            "\nSend two amounts to two different addresses, subtract fee from amount:\n"
+            + HelpExampleCli("sendmany", "\"\" \"{\\\"t14oHp2v54vfmdgQ3v3SNuQga8JKHTNi2a1\\\":0.01,\\\"t1353tsE8YMTA4EuV7dgUXGjNFf9KpVvKHz\\\":0.02}\" 1 \"\" \"[\\\"t14oHp2v54vfmdgQ3v3SNuQga8JKHTNi2a1\\\",\\\"t1353tsE8YMTA4EuV7dgUXGjNFf9KpVvKHz\\\"]\"") +
+            "\nAs a JSON RPC call\n"
+            + HelpExampleRpc("sendmany", "\"\", \"{\\\"t14oHp2v54vfmdgQ3v3SNuQga8JKHTNi2a1\\\":0.01,\\\"t1353tsE8YMTA4EuV7dgUXGjNFf9KpVvKHz\\\":0.02}\", 6, \"testing\"")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    if (!params[0].isNull() && !params[0].get_str().empty()) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Dummy value must be set to \"\"");
+    }
+    UniValue sendTo = params[1].get_obj();
+    int nMinDepth = 1;
+    if (params.size() > 2)
+        nMinDepth = params[2].get_int();
+
+    CWalletTx wtx;
+    if (params.size() > 3 && !params[3].isNull() && !params[3].get_str().empty())
+        wtx.mapValue["comment"] = params[3].get_str();
+
+    UniValue subtractFeeFromAmount(UniValue::VARR);
+    if (params.size() > 4)
+        subtractFeeFromAmount = params[4].get_array();
+
+    std::set<CTxDestination> destinations;
+    std::vector<CRecipient> vecSend;
+
+    KeyIO keyIO(Params());
+    CAmount totalAmount = 0;
+    std::vector<std::string> keys = sendTo.getKeys();
+    for (const std::string& name_ : keys) {
+        CTxDestination dest = keyIO.DecodeDestination(name_);
+        if (!IsValidDestination(dest)) {
+            throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, std::string("Invalid " PACKAGE_NAME " transparent address: ") + name_);
+        }
+
+        if (destinations.count(dest)) {
+            throw JSONRPCError(RPC_INVALID_PARAMETER, std::string("Invalid parameter, duplicated address: ") + name_);
+        }
+        destinations.insert(dest);
+
+        CScript scriptPubKey = GetScriptForDestination(dest);
+        CAmount nAmount = AmountFromValue(sendTo[name_]);
+        if (nAmount <= 0)
+            throw JSONRPCError(RPC_TYPE_ERROR, "Invalid amount for send");
+        totalAmount += nAmount;
+
+        bool fSubtractFeeFromAmount = false;
+        for (size_t idx = 0; idx < subtractFeeFromAmount.size(); idx++) {
+            const UniValue& addr = subtractFeeFromAmount[idx];
+            if (addr.get_str() == name_)
+                fSubtractFeeFromAmount = true;
+        }
+
+        CRecipient recipient = {scriptPubKey, nAmount, fSubtractFeeFromAmount};
+        vecSend.push_back(recipient);
+    }
+
+    EnsureWalletIsUnlocked();
+
+    // Check funds
+    if (totalAmount > pwalletMain->GetLegacyBalance(ISMINE_SPENDABLE, nMinDepth)) {
+        throw JSONRPCError(RPC_WALLET_INSUFFICIENT_FUNDS, "Wallet has insufficient funds");
+    }
+
+    // Send
+    CReserveKey keyChange(pwalletMain);
+    CAmount nFeeRequired = 0;
+    int nChangePosRet = -1;
+    string strFailReason;
+    bool fCreated = pwalletMain->CreateTransaction(vecSend, wtx, keyChange, nFeeRequired, nChangePosRet, strFailReason);
+    if (!fCreated)
+        throw JSONRPCError(RPC_WALLET_INSUFFICIENT_FUNDS, strFailReason);
+    if (!pwalletMain->CommitTransaction(wtx, keyChange))
+        throw JSONRPCError(RPC_WALLET_ERROR, "Transaction commit failed");
+
+    return wtx.GetHash().GetHex();
+}
+
+// Defined in rpc/misc.cpp
+extern CScript _createmultisig_redeemScript(const UniValue& params);
+
+UniValue addmultisigaddress(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() < 2 || params.size() > 3)
+    {
+        string msg = "addmultisigaddress nrequired [\"key\",...] ( \"\" )\n"
+            "\nAdd a nrequired-to-sign transparent multisignature address to the wallet.\n"
+            "Each key is a transparent Zcash address or hex-encoded secp256k1 public key.\n"
+
+            "\nArguments:\n"
+            "1. nrequired        (numeric, required) The number of required signatures out of the n keys or addresses.\n"
+            "2. \"keysobject\"   (string, required) A json array of Zcash addresses or hex-encoded public keys\n"
+            "     [\n"
+            "       \"address\"  (string) Zcash address or hex-encoded public key\n"
+            "       ...,\n"
+            "     ]\n"
+            "3. (dummy)        (string, optional) DEPRECATED. If provided, MUST be set to the empty string \"\"."
+
+            "\nResult:\n"
+            "\"zcashaddress\"  (string) A Zcash address associated with the keys.\n"
+
+            "\nExamples:\n"
+            "\nAdd a multisig address from 2 addresses\n"
+            + HelpExampleCli("addmultisigaddress", "2 \"[\\\"t16sSauSf5pF2UkUwvKGq4qjNRzBZYqgEL5\\\",\\\"t171sgjn4YtPu27adkKGrdDwzRTxnRkBfKV\\\"]\"") +
+            "\nAs json rpc call\n"
+            + HelpExampleRpc("addmultisigaddress", "2, \"[\\\"t16sSauSf5pF2UkUwvKGq4qjNRzBZYqgEL5\\\",\\\"t171sgjn4YtPu27adkKGrdDwzRTxnRkBfKV\\\"]\"")
+        ;
+        throw runtime_error(msg);
+    }
+
+    const UniValue& dummy_value = params[2];
+    if (!dummy_value.isNull() && dummy_value.get_str() != "") {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "dummy argument must be excluded or set to \"\".");
+    }
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    // Construct using pay-to-script-hash:
+    CScript inner = _createmultisig_redeemScript(params);
+    CScriptID innerID(inner);
+    pwalletMain->AddCScript(inner);
+
+    std::string dummy_account;
+    pwalletMain->SetAddressBook(innerID, dummy_account, "send");
+    KeyIO keyIO(Params());
+    return keyIO.EncodeDestination(innerID);
+}
+
+
+struct tallyitem
+{
+    CAmount nAmount;
+    int nConf;
+    vector<uint256> txids;
+    bool fIsWatchonly;
+    tallyitem()
+    {
+        nAmount = 0;
+        nConf = std::numeric_limits<int>::max();
+        fIsWatchonly = false;
+    }
+};
+
+UniValue ListReceived(const UniValue& params)
+{
+    // Minimum confirmations
+    int nMinDepth = 1;
+    if (params.size() > 0)
+        nMinDepth = params[0].get_int();
+
+    // Whether to include empty accounts
+    bool fIncludeEmpty = false;
+    if (params.size() > 1)
+        fIncludeEmpty = params[1].get_bool();
+
+    isminefilter filter = ISMINE_SPENDABLE;
+    if(params.size() > 2)
+        if(params[2].get_bool())
+            filter = filter | ISMINE_WATCH_ONLY;
+
+    // Tally
+    std::map<CTxDestination, tallyitem> mapTally;
+    for (const std::pair<uint256, CWalletTx>& pairWtx : pwalletMain->mapWallet) {
+        const CWalletTx& wtx = pairWtx.second;
+
+        if (wtx.IsCoinBase() || !CheckFinalTx(wtx))
+            continue;
+
+        int nDepth = wtx.GetDepthInMainChain();
+        if (nDepth < nMinDepth)
+            continue;
+
+        for (const CTxOut& txout : wtx.vout)
+        {
+            CTxDestination address;
+            if (!ExtractDestination(txout.scriptPubKey, address))
+                continue;
+
+            isminefilter mine = IsMine(*pwalletMain, address);
+            if(!(mine & filter))
+                continue;
+
+            tallyitem& item = mapTally[address];
+            item.nAmount += txout.nValue;
+            item.nConf = min(item.nConf, nDepth);
+            item.txids.push_back(wtx.GetHash());
+            if (mine & ISMINE_WATCH_ONLY)
+                item.fIsWatchonly = true;
+        }
+    }
+
+    KeyIO keyIO(Params());
+
+    // Reply
+    UniValue ret(UniValue::VARR);
+    for (const std::pair<CTxDestination, CAddressBookData>& item : pwalletMain->mapAddressBook) {
+        const CTxDestination& dest = item.first;
+        std::map<CTxDestination, tallyitem>::iterator it = mapTally.find(dest);
+        if (it == mapTally.end() && !fIncludeEmpty)
+            continue;
+
+        CAmount nAmount = 0;
+        int nConf = std::numeric_limits<int>::max();
+        bool fIsWatchonly = false;
+        if (it != mapTally.end())
+        {
+            nAmount = (*it).second.nAmount;
+            nConf = (*it).second.nConf;
+            fIsWatchonly = (*it).second.fIsWatchonly;
+        }
+
+        UniValue obj(UniValue::VOBJ);
+        if(fIsWatchonly)
+            obj.pushKV("involvesWatchonly", true);
+        obj.pushKV("address",       keyIO.EncodeDestination(dest));
+        obj.pushKV("amount",        ValueFromAmount(nAmount));
+        obj.pushKV("amountZat",     nAmount);
+        obj.pushKV("confirmations", (nConf == std::numeric_limits<int>::max() ? 0 : nConf));
+        UniValue transactions(UniValue::VARR);
+        if (it != mapTally.end())
+        {
+            for (const uint256& item : (*it).second.txids)
+            {
+                transactions.push_back(item.GetHex());
+            }
+        }
+        obj.pushKV("txids", transactions);
+        ret.push_back(obj);
+    }
+
+    return ret;
+}
+
+UniValue listreceivedbyaddress(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() > 3)
+        throw runtime_error(
+            "listreceivedbyaddress ( minconf includeempty includeWatchonly)\n"
+            "\nList balances by transparent receiving address. This API does not provide\n"
+            "any information for associated with shielded addresses and should only be used\n"
+            "in circumstances where it is necessary to interoperate with legacy Bitcoin\n"
+            "infrastructure.\n"
+            "\nArguments:\n"
+            "1. minconf       (numeric, optional, default=1) The minimum number of confirmations before payments are included.\n"
+            "2. includeempty  (numeric, optional, default=false) Whether to include addresses that haven't received any payments.\n"
+            "3. includeWatchonly (bool, optional, default=false) Whether to include watchonly addresses (see 'importaddress').\n"
+
+            "\nResult:\n"
+            "[\n"
+            "  {\n"
+            "    \"involvesWatchonly\" : true,        (bool) Only returned if imported addresses were involved in transaction\n"
+            "    \"address\" : \"receivingaddress\",  (string) The receiving transparent address\n"
+            "    \"amount\" : x.xxx,                  (numeric) The total amount in " + CURRENCY_UNIT + " received by the address\n"
+            "    \"amountZat\" : xxxx                 (numeric) The amount in " + MINOR_CURRENCY_UNIT + "\n"
+            "    \"confirmations\" : n                (numeric) The number of confirmations of the most recent transaction included\n"
+            "  }\n"
+            "  ,...\n"
+            "]\n"
+
+            "\nExamples:\n"
+            + HelpExampleCli("listreceivedbyaddress", "")
+            + HelpExampleCli("listreceivedbyaddress", "6 true")
+            + HelpExampleRpc("listreceivedbyaddress", "6, true, true")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    return ListReceived(params);
+}
+
+static void MaybePushAddress(UniValue & entry, const CTxDestination &dest)
+{
+    if (IsValidDestination(dest)) {
+        KeyIO keyIO(Params());
+        entry.pushKV("address", keyIO.EncodeDestination(dest));
+    }
+}
+
+/**
+ * List transactions based on the given criteria.
+ *
+ * @param  wtx        The wallet transaction.
+ * @param  nMinDepth  The minimum confirmation depth.
+ * @param  fLong      Whether to include the JSON version of the transaction.
+ * @param  ret        The UniValue into which the result is stored.
+ * @param  filter     The "is mine" filter flags.
+ */
+void ListTransactions(const CWalletTx& wtx, int nMinDepth, bool fLong, UniValue& ret, const isminefilter& filter)
+{
+    CAmount nFee;
+    std::list<COutputEntry> listReceived;
+    std::list<COutputEntry> listSent;
+
+    wtx.GetAmounts(listReceived, listSent, nFee, filter);
+
+    bool involvesWatchonly = wtx.IsFromMe(ISMINE_WATCH_ONLY);
+
+    // Sent
+    if ((!listSent.empty() || nFee != 0))
+    {
+        for (const COutputEntry& s : listSent)
+        {
+            UniValue entry(UniValue::VOBJ);
+            if(involvesWatchonly || (::IsMine(*pwalletMain, s.destination) & ISMINE_WATCH_ONLY)) {
+                entry.pushKV("involvesWatchonly", true);
+            }
+            MaybePushAddress(entry, s.destination);
+            entry.pushKV("category", "send");
+            entry.pushKV("amount", ValueFromAmount(-s.amount));
+            entry.pushKV("amountZat", -s.amount);
+            entry.pushKV("vout", s.vout);
+            entry.pushKV("fee", ValueFromAmount(-nFee));
+            if (fLong)
+                WalletTxToJSON(wtx, entry);
+            entry.pushKV("size", static_cast<uint64_t>(GetSerializeSize(static_cast<CTransaction>(wtx), SER_NETWORK, PROTOCOL_VERSION)));
+            ret.push_back(entry);
+        }
+    }
+
+    // Received
+    if (listReceived.size() > 0 && wtx.GetDepthInMainChain() >= nMinDepth)
+    {
+        for (const COutputEntry& r : listReceived)
+        {
+            std::string label;
+            if (pwalletMain->mapAddressBook.count(r.destination)) {
+                label = pwalletMain->mapAddressBook[r.destination].name;
+            }
+            UniValue entry(UniValue::VOBJ);
+            if (involvesWatchonly || (::IsMine(*pwalletMain, r.destination) & ISMINE_WATCH_ONLY)) {
+                entry.pushKV("involvesWatchonly", true);
+            }
+            MaybePushAddress(entry, r.destination);
+            if (wtx.IsCoinBase())
+            {
+                if (wtx.GetDepthInMainChain() < 1)
+                    entry.pushKV("category", "orphan");
+                else if (wtx.GetBlocksToMaturity() > 0)
+                    entry.pushKV("category", "immature");
+                else
+                    entry.pushKV("category", "generate");
+            }
+            else
+            {
+                entry.pushKV("category", "receive");
+            }
+            entry.pushKV("amount", ValueFromAmount(r.amount));
+            entry.pushKV("amountZat", r.amount);
+            entry.pushKV("vout", r.vout);
+            if (fLong)
+                WalletTxToJSON(wtx, entry);
+            entry.pushKV("size", static_cast<uint64_t>(GetSerializeSize(static_cast<CTransaction>(wtx), SER_NETWORK, PROTOCOL_VERSION)));
+            ret.push_back(entry);
+        }
+    }
+}
+
+UniValue listtransactions(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() > 4)
+        throw runtime_error(
+            "listtransactions ( \"dummy\" count from includeWatchonly)\n"
+            "\nReturns up to 'count' of the most recent transactions associated with legacy transparent\n"
+            "addresses of this wallet, skipping the first 'from' transactions.\n"
+            "\nThis API does not provide any information about transactions containing shielded inputs\n"
+            "or outputs, and should only be used in circumstances where it is necessary to interoperate\n"
+            "with legacy Bitcoin infrastructure. Use z_listreceivedbyaddress to obtain information about\n"
+            "the wallet's shielded transactions.\n"
+            "\nArguments:\n"
+            "1. (dummy)        (string, optional) If set, should be \"*\" for backwards compatibility.\n"
+            "2. count          (numeric, optional, default=10) The number of transactions to return\n"
+            "3. from           (numeric, optional, default=0) The number of transactions to skip\n"
+            "4. includeWatchonly (bool, optional, default=false) Include transactions to watchonly addresses (see 'importaddress')\n"
+            "\nResult:\n"
+            "[\n"
+            "  {\n"
+            "    \"address\":\"zcashaddress\",    (string) The Zcash address of the transaction. Not present for \n"
+            "                                                move transactions (category = move).\n"
+            "    \"category\":\"send|receive\",   (string) The transaction category. 'send' and 'receive' transactions are \n"
+            "                                              associated with an address, transaction id and block details\n"
+            "    \"status\" : \"mined|waiting|expiringsoon|expired\",    (string) The transaction status, can be 'mined', 'waiting', 'expiringsoon' \n"
+            "                                                                    or 'expired'. Available for 'send' and 'receive' category of transactions.\n"
+            "    \"amount\": x.xxx,          (numeric) The amount in " + CURRENCY_UNIT + ". This is negative for the 'send' category, and for the\n"
+            "                                         'move' category for moves outbound. It is positive for the 'receive' category,\n"
+            "                                         and for the 'move' category for inbound funds.\n"
+            "    \"amountZat\": x.xxx,       (numeric) The amount in " + MINOR_CURRENCY_UNIT + ". Negative and positive are the same as 'amount' field.\n"
+            "    \"vout\" : n,               (numeric) the vout value\n"
+            "    \"fee\": x.xxx,             (numeric) The amount of the fee in " + CURRENCY_UNIT + ". This is negative and only available for the \n"
+            "                                         'send' category of transactions.\n"
+            "    \"confirmations\": n,       (numeric) The number of confirmations for the transaction. Available for 'send' and \n"
+            "                                         'receive' category of transactions.\n"
+            "    \"blockhash\": \"hashvalue\", (string) The block hash containing the transaction. Available for 'send' and 'receive'\n"
+            "                                          category of transactions.\n"
+            "    \"blockindex\": n,          (numeric) The block index containing the transaction. Available for 'send' and 'receive'\n"
+            "                                          category of transactions.\n"
+            "    \"txid\": \"transactionid\", (string) The transaction id. Available for 'send' and 'receive' category of transactions.\n"
+            "    \"time\": xxx,              (numeric) The transaction time in seconds since epoch (midnight Jan 1 1970 GMT).\n"
+            "    \"timereceived\": xxx,      (numeric) The time received in seconds since epoch (midnight Jan 1 1970 GMT). Available \n"
+            "                                          for 'send' and 'receive' category of transactions.\n"
+            "    \"comment\": \"...\",       (string) If a comment is associated with the transaction.\n"
+            "    \"size\": n,                (numeric) Transaction size in bytes\n"
+            "  }\n"
+            "]\n"
+            "\nExamples:\n"
+            "\nList the most recent 10 transactions in the systems\n"
+            + HelpExampleCli("listtransactions", "") +
+            "\nList transactions 100 to 120\n"
+            + HelpExampleCli("listtransactions", "\"*\" 20 100") +
+            "\nAs a JSON RPC call\n"
+            + HelpExampleRpc("listtransactions", "\"*\", 20, 100")
+        );
+
+    if (!params[0].isNull() && params[0].get_str() != "*") {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Dummy value must be set to \"*\"");
+    }
+
+    int nCount = 10;
+    if (params.size() > 1)
+        nCount = params[1].get_int();
+    int nFrom = 0;
+    if (params.size() > 2)
+        nFrom = params[2].get_int();
+    isminefilter filter = ISMINE_SPENDABLE;
+    if(params.size() > 3)
+        if(params[3].get_bool())
+            filter = filter | ISMINE_WATCH_ONLY;
+
+    if (nCount < 0)
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Negative count");
+    if (nFrom < 0)
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Negative from");
+
+    UniValue ret(UniValue::VARR);
+
+    {
+        LOCK2(cs_main, pwalletMain->cs_wallet);
+        const CWallet::TxItems & txOrdered = pwalletMain->wtxOrdered;
+
+        // iterate backwards until we have nCount items to return:
+        for (CWallet::TxItems::const_reverse_iterator it = txOrdered.rbegin(); it != txOrdered.rend(); ++it)
+        {
+            CWalletTx *const pwtx = (*it).second;
+            ListTransactions(*pwtx, 0, true, ret, filter);
+            if ((int)ret.size() >= (nCount+nFrom)) break;
+        }
+    }
+
+    // ret is newest to oldest
+
+    if (nFrom > (int)ret.size())
+        nFrom = ret.size();
+    if ((nFrom + nCount) > (int)ret.size())
+        nCount = ret.size() - nFrom;
+
+    vector<UniValue> arrTmp = ret.getValues();
+
+    vector<UniValue>::iterator first = arrTmp.begin();
+    std::advance(first, nFrom);
+    vector<UniValue>::iterator last = arrTmp.begin();
+    std::advance(last, nFrom+nCount);
+
+    if (last != arrTmp.end()) arrTmp.erase(last, arrTmp.end());
+    if (first != arrTmp.begin()) arrTmp.erase(arrTmp.begin(), first);
+
+    std::reverse(arrTmp.begin(), arrTmp.end()); // Return oldest to newest
+
+    ret.clear();
+    ret.setArray();
+    ret.push_backV(arrTmp);
+
+    return ret;
+}
+
+
+UniValue listsinceblock(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp)
+        throw runtime_error(
+            "listsinceblock ( \"blockhash\" target-confirmations includeWatchonly)\n"
+            "\nGet all transactions in blocks since block [blockhash], or all transactions if omitted\n"
+            "\nArguments:\n"
+            "1. \"blockhash\"   (string, optional) The block hash to list transactions since\n"
+            "2. target-confirmations:    (numeric, optional) The confirmations required, must be 1 or more\n"
+            "3. includeWatchonly:        (bool, optional, default=false) Include transactions to watchonly addresses (see 'importaddress')"
+            "\nResult:\n"
+            "{\n"
+            "  \"transactions\": [\n"
+            "    \"address\":\"zcashaddress\",    (string) The Zcash address of the transaction. Not present for move transactions (category = move).\n"
+            "    \"category\":\"send|receive\",     (string) The transaction category. 'send' has negative amounts, 'receive' has positive amounts.\n"
+            "    \"status\" : \"mined|waiting|expiringsoon|expired\",    (string) The transaction status, can be 'mined', 'waiting', 'expiringsoon' \n"
+            "                                                                    or 'expired'. Available for 'send' and 'receive' category of transactions.\n"
+            "    \"amount\": x.xxx,          (numeric) The amount in " + CURRENCY_UNIT + ". This is negative for the 'send' category, and for the 'move' category for moves \n"
+            "                                          outbound. It is positive for the 'receive' category, and for the 'move' category for inbound funds.\n"
+            "    \"amountZat\": x.xxx,       (numeric) The amount in " + MINOR_CURRENCY_UNIT + ". Negative and positive are the same as for the 'amount' field.\n"
+            "    \"vout\" : n,               (numeric) the vout value\n"
+            "    \"fee\": x.xxx,             (numeric) The amount of the fee in " + CURRENCY_UNIT + ". This is negative and only available for the 'send' category of transactions.\n"
+            "    \"confirmations\": n,       (numeric) The number of confirmations for the transaction. Available for 'send' and 'receive' category of transactions.\n"
+            "    \"blockhash\": \"hashvalue\",     (string) The block hash containing the transaction. Available for 'send' and 'receive' category of transactions.\n"
+            "    \"blockindex\": n,          (numeric) The block index containing the transaction. Available for 'send' and 'receive' category of transactions.\n"
+            "    \"blocktime\": xxx,         (numeric) The block time in seconds since epoch (1 Jan 1970 GMT).\n"
+            "    \"txid\": \"transactionid\",  (string) The transaction id. Available for 'send' and 'receive' category of transactions.\n"
+            "    \"time\": xxx,              (numeric) The transaction time in seconds since epoch (Jan 1 1970 GMT).\n"
+            "    \"timereceived\": xxx,      (numeric) The time received in seconds since epoch (Jan 1 1970 GMT). Available for 'send' and 'receive' category of transactions.\n"
+            "    \"comment\": \"...\",       (string) If a comment is associated with the transaction.\n"
+            "    \"to\": \"...\",            (string) If a comment to is associated with the transaction.\n"
+             "  ],\n"
+            "  \"lastblock\": \"lastblockhash\"     (string) The hash of the last block\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("listsinceblock", "")
+            + HelpExampleCli("listsinceblock", "\"000000000000000bacf66f7497b7dc45ef753ee9a7d38571037cdb1a57f663ad\" 6")
+            + HelpExampleRpc("listsinceblock", "\"000000000000000bacf66f7497b7dc45ef753ee9a7d38571037cdb1a57f663ad\", 6")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    CBlockIndex *pindex = NULL;
+    int target_confirms = 1;
+    isminefilter filter = ISMINE_SPENDABLE;
+
+    if (params.size() > 0)
+    {
+        uint256 blockId;
+
+        blockId.SetHex(params[0].get_str());
+        BlockMap::iterator it = mapBlockIndex.find(blockId);
+        if (it != mapBlockIndex.end())
+            pindex = it->second;
+    }
+
+    if (params.size() > 1)
+    {
+        target_confirms = params[1].get_int();
+
+        if (target_confirms < 1)
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter");
+    }
+
+    if(params.size() > 2)
+        if(params[2].get_bool())
+            filter = filter | ISMINE_WATCH_ONLY;
+
+    int depth = pindex ? (1 + chainActive.Height() - pindex->nHeight) : -1;
+
+    UniValue transactions(UniValue::VARR);
+
+    for (const std::pair<const uint256, CWalletTx>& pairWtx : pwalletMain->mapWallet) {
+        CWalletTx tx = pairWtx.second;
+
+        if (depth == -1 || tx.GetDepthInMainChain() < depth) {
+            ListTransactions(tx, 0, true, transactions, filter);
+        }
+    }
+
+    CBlockIndex *pblockLast = chainActive[chainActive.Height() + 1 - target_confirms];
+    uint256 lastblock = pblockLast ? pblockLast->GetBlockHash() : uint256();
+
+    UniValue ret(UniValue::VOBJ);
+    ret.pushKV("transactions", transactions);
+    ret.pushKV("lastblock", lastblock.GetHex());
+
+    return ret;
+}
+
+UniValue gettransaction(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() < 1 || params.size() > 2)
+        throw runtime_error(
+            "gettransaction \"txid\" ( includeWatchonly )\n"
+            "\nReturns detailed information about in-wallet transaction <txid>.\n"
+            "\nArguments:\n"
+            "1. \"txid\"    (string, required) The transaction id\n"
+            "2. \"includeWatchonly\"    (bool, optional, default=false) Whether to include watchonly addresses in balance calculation and details[]\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"status\" : \"mined|waiting|expiringsoon|expired\",    (string) The transaction status, can be 'mined', 'waiting', 'expiringsoon' or 'expired'\n"
+            "  \"amount\" : x.xxx,        (numeric) The transaction amount in " + CURRENCY_UNIT + "\n"
+            "  \"amountZat\" : x          (numeric) The amount in " + MINOR_CURRENCY_UNIT + "\n"
+            "  \"confirmations\" : n,     (numeric) The number of confirmations\n"
+            "  \"blockhash\" : \"hash\",  (string) The block hash\n"
+            "  \"blockindex\" : xx,       (numeric) The block index\n"
+            "  \"blocktime\" : ttt,       (numeric) The time in seconds since epoch (1 Jan 1970 GMT)\n"
+            "  \"txid\" : \"transactionid\",   (string) The transaction id.\n"
+            "  \"time\" : ttt,            (numeric) The transaction time in seconds since epoch (1 Jan 1970 GMT)\n"
+            "  \"timereceived\" : ttt,    (numeric) The time received in seconds since epoch (1 Jan 1970 GMT)\n"
+            "  \"details\" : [\n"
+            "    {\n"
+            "      \"address\" : \"zcashaddress\",   (string) The Zcash address involved in the transaction\n"
+            "      \"category\" : \"send|receive\",    (string) The category, either 'send' or 'receive'\n"
+            "      \"amount\" : x.xxx                  (numeric) The amount in " + CURRENCY_UNIT + "\n"
+            "      \"amountZat\" : x                   (numeric) The amount in " + MINOR_CURRENCY_UNIT + "\n"
+            "      \"vout\" : n,                       (numeric) the vout value\n"
+            "    }\n"
+            "    ,...\n"
+            "  ],\n"
+            "  \"vjoinsplit\" : [\n"
+            "    {\n"
+            "      \"anchor\" : \"treestateref\",          (string) Merkle root of note commitment tree\n"
+            "      \"nullifiers\" : [ string, ... ]      (string) Nullifiers of input notes\n"
+            "      \"commitments\" : [ string, ... ]     (string) Note commitments for note outputs\n"
+            "      \"macs\" : [ string, ... ]            (string) Message authentication tags\n"
+            "      \"vpub_old\" : x.xxx                  (numeric) The amount removed from the transparent value pool\n"
+            "      \"vpub_new\" : x.xxx,                 (numeric) The amount added to the transparent value pool\n"
+            "    }\n"
+            "    ,...\n"
+            "  ],\n"
+            "  \"hex\" : \"data\"         (string) Raw data for transaction\n"
+            "}\n"
+
+            "\nExamples:\n"
+            + HelpExampleCli("gettransaction", "\"1075db55d416d3ca199f55b6084e2115b9345e16c5cf302fc80e9d5fbf5d48d\"")
+            + HelpExampleCli("gettransaction", "\"1075db55d416d3ca199f55b6084e2115b9345e16c5cf302fc80e9d5fbf5d48d\" true")
+            + HelpExampleRpc("gettransaction", "\"1075db55d416d3ca199f55b6084e2115b9345e16c5cf302fc80e9d5fbf5d48d\"")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    uint256 hash;
+    hash.SetHex(params[0].get_str());
+
+    isminefilter filter = ISMINE_SPENDABLE;
+    if(params.size() > 1)
+        if(params[1].get_bool())
+            filter = filter | ISMINE_WATCH_ONLY;
+
+    UniValue entry(UniValue::VOBJ);
+    if (!pwalletMain->mapWallet.count(hash))
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid or non-wallet transaction id");
+    const CWalletTx& wtx = pwalletMain->mapWallet[hash];
+
+    CAmount nCredit = wtx.GetCredit(filter);
+    CAmount nDebit = wtx.GetDebit(filter);
+    CAmount nNet = nCredit - nDebit;
+    CAmount nFee = (wtx.IsFromMe(filter) ? wtx.GetValueOut() - nDebit : 0);
+
+    entry.pushKV("amount", ValueFromAmount(nNet - nFee));
+    entry.pushKV("amountZat", nNet - nFee);
+    if (wtx.IsFromMe(filter))
+        entry.pushKV("fee", ValueFromAmount(nFee));
+
+    WalletTxToJSON(wtx, entry);
+
+    UniValue details(UniValue::VARR);
+    ListTransactions(wtx, 0, false, details, filter);
+    entry.pushKV("details", details);
+
+    string strHex = EncodeHexTx(static_cast<CTransaction>(wtx));
+    entry.pushKV("hex", strHex);
+
+    return entry;
+}
+
+
+UniValue backupwallet(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "backupwallet \"destination\"\n"
+            "\nSafely copies current wallet file to destination filename\n"
+            "\nArguments:\n"
+            "1. \"destination\"   (string, required) The destination filename, saved in the directory set by -exportdir option.\n"
+            "\nResult:\n"
+            "\"path\"             (string) The full path of the destination file\n"
+            "\nExamples:\n"
+            + HelpExampleCli("backupwallet", "\"backupdata\"")
+            + HelpExampleRpc("backupwallet", "\"backupdata\"")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    fs::path exportdir;
+    try {
+        exportdir = GetExportDir();
+    } catch (const std::runtime_error& e) {
+        throw JSONRPCError(RPC_INTERNAL_ERROR, e.what());
+    }
+    if (exportdir.empty()) {
+        throw JSONRPCError(RPC_WALLET_ERROR, "Cannot backup wallet until the -exportdir option has been set");
+    }
+    std::string unclean = params[0].get_str();
+    std::string clean = SanitizeFilename(unclean);
+    if (clean.compare(unclean) != 0) {
+        throw JSONRPCError(RPC_WALLET_ERROR, strprintf("Filename is invalid as only alphanumeric characters are allowed.  Try '%s' instead.", clean));
+    }
+    fs::path exportfilepath = exportdir / clean;
+
+    if (!BackupWallet(*pwalletMain, exportfilepath.string()))
+        throw JSONRPCError(RPC_WALLET_ERROR, "Error: Wallet backup failed!");
+
+    return exportfilepath.string();
+}
+
+
+UniValue keypoolrefill(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() > 1)
+        throw runtime_error(
+            "keypoolrefill ( newsize )\n"
+            "\nFills the keypool associated with the legacy transparent value pool. This should only be\n"
+            "used when interoperability with legacy Bitcoin infrastructure is required.\n"
+            + HelpRequiringPassphrase() + "\n"
+            "\nArguments\n"
+            "1. newsize     (numeric, optional, default=100) The new keypool size\n"
+            "\nExamples:\n"
+            + HelpExampleCli("keypoolrefill", "")
+            + HelpExampleRpc("keypoolrefill", "")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    EnsureWalletIsBackedUp(Params());
+
+    // 0 is interpreted by TopUpKeyPool() as the default keypool size given by -keypool
+    unsigned int kpSize = 0;
+    if (params.size() > 0) {
+        if (params[0].get_int() < 0)
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, expected valid size.");
+        kpSize = (unsigned int)params[0].get_int();
+    }
+
+    EnsureWalletIsUnlocked();
+    pwalletMain->TopUpKeyPool(kpSize);
+
+    if (pwalletMain->GetKeyPoolSize() < kpSize)
+        throw JSONRPCError(RPC_WALLET_ERROR, "Error refreshing keypool.");
+
+    return NullUniValue;
+}
+
+
+static void LockWallet(CWallet* pWallet)
+{
+    LOCK(cs_nWalletUnlockTime);
+    nWalletUnlockTime = 0;
+    pWallet->Lock();
+}
+
+UniValue walletpassphrase(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (pwalletMain->IsCrypted() && (fHelp || params.size() != 2))
+        throw runtime_error(
+            "walletpassphrase \"passphrase\" timeout\n"
+            "\nStores the wallet decryption key in memory for 'timeout' seconds.\n"
+            "If the wallet is locked, this API must be invoked prior to performing operations\n"
+            "that require the availability of private keys, such as sending Zcash.\n"
+            "zcashd wallet encryption is experimental, and should be used with caution.\n"
+            "\nArguments:\n"
+            "1. \"passphrase\"     (string, required) The wallet passphrase\n"
+            "2. timeout            (numeric, required) The time to keep the decryption key in seconds.\n"
+            "\nNotes:\n"
+            "Issuing the walletpassphrase command while the wallet is already unlocked will set a new unlock\n"
+            "time that overrides the old one.\n"
+            "\nExamples:\n"
+            "\nunlock the wallet for 60 seconds\n"
+            + HelpExampleCli("walletpassphrase", "\"my pass phrase\" 60") +
+            "\nLock the wallet again (before 60 seconds)\n"
+            + HelpExampleCli("walletlock", "") +
+            "\nAs json rpc call\n"
+            + HelpExampleRpc("walletpassphrase", "\"my pass phrase\", 60")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    if (fHelp)
+        return true;
+    if (!pwalletMain->IsCrypted())
+        throw JSONRPCError(RPC_WALLET_WRONG_ENC_STATE, "Error: running with an unencrypted wallet, but walletpassphrase was called.");
+
+    // Note that the walletpassphrase is stored in params[0] which is not mlock()ed
+    SecureString strWalletPass;
+    strWalletPass.reserve(100);
+    // TODO: get rid of this .c_str() by implementing SecureString::operator=(std::string)
+    // Alternately, find a way to make params[0] mlock()'d to begin with.
+    strWalletPass = params[0].get_str().c_str();
+
+    if (strWalletPass.length() > 0)
+    {
+        if (!pwalletMain->Unlock(strWalletPass))
+            throw JSONRPCError(RPC_WALLET_PASSPHRASE_INCORRECT, "Error: The wallet passphrase entered was incorrect.");
+    }
+    else
+        throw runtime_error(
+            "walletpassphrase <passphrase> <timeout>\n"
+            "Stores the wallet decryption key in memory for <timeout> seconds.");
+
+    // No need to check return values, because the wallet was unlocked above
+    pwalletMain->UpdateNullifierNoteMap();
+    pwalletMain->TopUpKeyPool();
+
+    int64_t nSleepTime = params[1].get_int64();
+    LOCK(cs_nWalletUnlockTime);
+    nWalletUnlockTime = GetTime() + nSleepTime;
+    RPCRunLater("lockwallet", boost::bind(LockWallet, pwalletMain), nSleepTime);
+
+    return NullUniValue;
+}
+
+
+UniValue walletpassphrasechange(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (pwalletMain->IsCrypted() && (fHelp || params.size() != 2))
+        throw runtime_error(
+            "walletpassphrasechange \"oldpassphrase\" \"newpassphrase\"\n"
+            "\nChanges the wallet passphrase from 'oldpassphrase' to 'newpassphrase'.\n"
+            "\nArguments:\n"
+            "1. \"oldpassphrase\"      (string) The current passphrase\n"
+            "2. \"newpassphrase\"      (string) The new passphrase\n"
+            "\nExamples:\n"
+            + HelpExampleCli("walletpassphrasechange", "\"old one\" \"new one\"")
+            + HelpExampleRpc("walletpassphrasechange", "\"old one\", \"new one\"")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    if (fHelp)
+        return true;
+    if (!pwalletMain->IsCrypted())
+        throw JSONRPCError(RPC_WALLET_WRONG_ENC_STATE, "Error: running with an unencrypted wallet, but walletpassphrasechange was called.");
+
+    // TODO: get rid of these .c_str() calls by implementing SecureString::operator=(std::string)
+    // Alternately, find a way to make params[0] mlock()'d to begin with.
+    SecureString strOldWalletPass;
+    strOldWalletPass.reserve(100);
+    strOldWalletPass = params[0].get_str().c_str();
+
+    SecureString strNewWalletPass;
+    strNewWalletPass.reserve(100);
+    strNewWalletPass = params[1].get_str().c_str();
+
+    if (strOldWalletPass.length() < 1 || strNewWalletPass.length() < 1)
+        throw runtime_error(
+            "walletpassphrasechange <oldpassphrase> <newpassphrase>\n"
+            "Changes the wallet passphrase from <oldpassphrase> to <newpassphrase>.");
+
+    if (!pwalletMain->ChangeWalletPassphrase(strOldWalletPass, strNewWalletPass))
+        throw JSONRPCError(RPC_WALLET_PASSPHRASE_INCORRECT, "Error: The wallet passphrase entered was incorrect.");
+
+    return NullUniValue;
+}
+
+UniValue walletconfirmbackup(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "walletconfirmbackup \"emergency recovery phrase\"\n"
+            "\nCAUTION: This is an internal method that is not intended to be called directly by\n"
+            "users. Please use the zcashd-wallet-tool utility (built or installed in the same directory\n"
+            "as zcashd) instead. In particular, this method should not be used from zcash-cli, in order\n"
+            "to avoid exposing the recovery phrase on the command line.\n\n"
+            "Notify the wallet that the user has backed up the emergency recovery phrase,\n"
+            "which can be obtained by making a call to z_exportwallet. The zcashd embedded wallet\n"
+            "requires confirmation that the emergency recovery phrase has been backed up before it\n"
+            "will permit new spending keys or addresses to be generated.\n"
+            "\nArguments:\n"
+            "1. \"emergency recovery phrase\" (string, required) The full recovery phrase returned as part\n"
+            "   of the data returned by z_exportwallet. An error will be returned if the value provided\n"
+            "   does not match the wallet's existing emergency recovery phrase.\n"
+            "\nExamples:\n"
+            + HelpExampleRpc("walletconfirmbackup", "\"abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon abandon art\"")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    EnsureWalletIsUnlocked();
+
+    SecureString strMnemonicPhrase(params[0].get_str());
+    boost::trim(strMnemonicPhrase);
+    if (pwalletMain->VerifyMnemonicSeed(strMnemonicPhrase)) {
+        return NullUniValue;
+    } else {
+        throw JSONRPCError(
+                RPC_WALLET_PASSPHRASE_INCORRECT,
+                "Error: The emergency recovery phrase entered was incorrect.");
+    }
+}
+
+
+UniValue walletlock(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (pwalletMain->IsCrypted() && (fHelp || params.size() != 0))
+        throw runtime_error(
+            "walletlock\n"
+            "\nRemoves the wallet encryption key from memory, locking the wallet.\n"
+            "After calling this method, you will need to call walletpassphrase again\n"
+            "before being able to call any methods which require the wallet to be unlocked.\n"
+            "\nExamples:\n"
+            "\nSet the passphrase for 2 minutes to perform a transaction\n"
+            + HelpExampleCli("walletpassphrase", "\"my pass phrase\" 120") +
+            "\nPerform a send (requires passphrase set)\n"
+            + HelpExampleCli("sendtoaddress", "\"t1M72Sfpbz1BPpXFHz9m3CdqATR44Jvaydd\" 1.0") +
+            "\nClear the passphrase since we are done before 2 minutes is up\n"
+            + HelpExampleCli("walletlock", "") +
+            "\nAs json rpc call\n"
+            + HelpExampleRpc("walletlock", "")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    if (fHelp)
+        return true;
+    if (!pwalletMain->IsCrypted())
+        throw JSONRPCError(RPC_WALLET_WRONG_ENC_STATE, "Error: running with an unencrypted wallet, but walletlock was called.");
+
+    {
+        LOCK(cs_nWalletUnlockTime);
+        pwalletMain->Lock();
+        nWalletUnlockTime = 0;
+    }
+
+    return NullUniValue;
+}
+
+
+UniValue encryptwallet(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    std::string disabledMsg = "";
+    if (!fExperimentalDeveloperEncryptWallet) {
+        disabledMsg = experimentalDisabledHelpMsg("encryptwallet", {"developerencryptwallet"});
+    }
+
+    if (!pwalletMain->IsCrypted() && (fHelp || params.size() != 1))
+        throw runtime_error(
+            "encryptwallet \"passphrase\"\n"
+            + disabledMsg +
+            "\nEncrypts the wallet with 'passphrase'. This is for first time encryption.\n"
+            "After this, any calls that interact with private keys such as sending or signing \n"
+            "will require the passphrase to be set prior the making these calls.\n"
+            "Use the walletpassphrase call for this, and then walletlock call.\n"
+            "If the wallet is already encrypted, use the walletpassphrasechange call.\n"
+            "Note that this will shutdown the server.\n"
+            "Wallet encryption is experimental, and this API should be used with caution.\n"
+            "\nArguments:\n"
+            "1. \"passphrase\"    (string) The pass phrase to encrypt the wallet with. It must be at least 1 character, but should be long.\n"
+            "\nExamples:\n"
+            "\nEncrypt you wallet\n"
+            + HelpExampleCli("encryptwallet", "\"my pass phrase\"") +
+            "\nNow set the passphrase to use the wallet, such as for signing or sending Zcash\n"
+            + HelpExampleCli("walletpassphrase", "\"my pass phrase\"") +
+            "\nNow we can so something like sign\n"
+            + HelpExampleCli("signmessage", "\"zcashaddress\" \"test message\"") +
+            "\nNow lock the wallet again by removing the passphrase\n"
+            + HelpExampleCli("walletlock", "") +
+            "\nAs a JSON RPC call\n"
+            + HelpExampleRpc("encryptwallet", "\"my pass phrase\"")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    if (fHelp)
+        return true;
+    if (!fExperimentalDeveloperEncryptWallet) {
+        throw JSONRPCError(RPC_WALLET_ENCRYPTION_FAILED, "Error: wallet encryption is disabled.");
+    }
+    if (pwalletMain->IsCrypted())
+        throw JSONRPCError(RPC_WALLET_WRONG_ENC_STATE, "Error: running with an encrypted wallet, but encryptwallet was called.");
+
+    // TODO: get rid of this .c_str() by implementing SecureString::operator=(std::string)
+    // Alternately, find a way to make params[0] mlock()'d to begin with.
+    SecureString strWalletPass;
+    strWalletPass.reserve(100);
+    strWalletPass = params[0].get_str().c_str();
+
+    if (strWalletPass.length() < 1)
+        throw runtime_error(
+            "encryptwallet <passphrase>\n"
+            "Encrypts the wallet with <passphrase>.");
+
+    if (!pwalletMain->EncryptWallet(strWalletPass))
+        throw JSONRPCError(RPC_WALLET_ENCRYPTION_FAILED, "Error: Failed to encrypt the wallet.");
+
+    // BDB seems to have a bad habit of writing old data into
+    // slack space in .dat files; that is bad if the old data is
+    // unencrypted private keys. So:
+    StartShutdown();
+    return "wallet encrypted; Zcash server stopping, restart to run with encrypted wallet. The keypool has been flushed, you need to make a new backup.";
+}
+
+UniValue lockunspent(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() < 1 || params.size() > 2)
+        throw runtime_error(
+            "lockunspent unlock [{\"txid\":\"txid\",\"vout\":n},...]\n"
+            "\nUpdates list of temporarily unspendable outputs.\n"
+            "Temporarily lock (unlock=false) or unlock (unlock=true) specified transparent transaction outputs.\n"
+            "A locked transaction output will not be chosen by automatic coin selection, when spending Zcash.\n"
+            "Locks are stored in memory only. Nodes start with zero locked outputs, and the locked output list\n"
+            "is always cleared (by virtue of process exit) when a node stops or fails.\n"
+            "Also see the listunspent call\n"
+            "\nArguments:\n"
+            "1. unlock            (boolean, required) Whether to unlock (true) or lock (false) the specified transactions\n"
+            "2. \"transactions\"  (string, required) A json array of objects. Each object the txid (string) vout (numeric)\n"
+            "     [           (json array of json objects)\n"
+            "       {\n"
+            "         \"txid\":\"id\",    (string) The transaction id\n"
+            "         \"vout\": n         (numeric) The output number\n"
+            "       }\n"
+            "       ,...\n"
+            "     ]\n"
+
+            "\nResult:\n"
+            "true|false    (boolean) Whether the command was successful or not\n"
+
+            "\nExamples:\n"
+            "\nList the unspent transactions\n"
+            + HelpExampleCli("listunspent", "") +
+            "\nLock an unspent transaction\n"
+            + HelpExampleCli("lockunspent", "false \"[{\\\"txid\\\":\\\"a08e6907dbbd3d809776dbfc5d82e371b764ed838b5655e72f463568df1aadf0\\\",\\\"vout\\\":1}]\"") +
+            "\nList the locked transactions\n"
+            + HelpExampleCli("listlockunspent", "") +
+            "\nUnlock the transaction again\n"
+            + HelpExampleCli("lockunspent", "true \"[{\\\"txid\\\":\\\"a08e6907dbbd3d809776dbfc5d82e371b764ed838b5655e72f463568df1aadf0\\\",\\\"vout\\\":1}]\"") +
+            "\nAs a JSON RPC call\n"
+            + HelpExampleRpc("lockunspent", "false, \"[{\\\"txid\\\":\\\"a08e6907dbbd3d809776dbfc5d82e371b764ed838b5655e72f463568df1aadf0\\\",\\\"vout\\\":1}]\"")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    if (params.size() == 1)
+        RPCTypeCheck(params, boost::assign::list_of(UniValue::VBOOL));
+    else
+        RPCTypeCheck(params, boost::assign::list_of(UniValue::VBOOL)(UniValue::VARR));
+
+    bool fUnlock = params[0].get_bool();
+
+    if (params.size() == 1) {
+        if (fUnlock)
+            pwalletMain->UnlockAllCoins();
+        return true;
+    }
+
+    UniValue outputs = params[1].get_array();
+    for (size_t idx = 0; idx < outputs.size(); idx++) {
+        const UniValue& output = outputs[idx];
+        if (!output.isObject())
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, expected object");
+        const UniValue& o = output.get_obj();
+
+        RPCTypeCheckObj(o, boost::assign::map_list_of("txid", UniValue::VSTR)("vout", UniValue::VNUM));
+
+        string txid = find_value(o, "txid").get_str();
+        if (!IsHex(txid))
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, expected hex txid");
+
+        int nOutput = find_value(o, "vout").get_int();
+        if (nOutput < 0)
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, vout must be positive");
+
+        COutPoint outpt(uint256S(txid), nOutput);
+
+        if (fUnlock)
+            pwalletMain->UnlockCoin(outpt);
+        else
+            pwalletMain->LockCoin(outpt);
+    }
+
+    return true;
+}
+
+UniValue listlockunspent(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() > 0)
+        throw runtime_error(
+            "listlockunspent\n"
+            "\nReturns list of temporarily unspendable transparent outputs.\n"
+            "See the lockunspent call to lock and unlock transactions for spending.\n"
+            "\nResult:\n"
+            "[\n"
+            "  {\n"
+            "    \"txid\" : \"transactionid\",     (string) The transaction id locked\n"
+            "    \"vout\" : n                      (numeric) The vout value\n"
+            "  }\n"
+            "  ,...\n"
+            "]\n"
+            "\nExamples:\n"
+            "\nList the unspent transactions\n"
+            + HelpExampleCli("listunspent", "") +
+            "\nLock an unspent transaction\n"
+            + HelpExampleCli("lockunspent", "false \"[{\\\"txid\\\":\\\"a08e6907dbbd3d809776dbfc5d82e371b764ed838b5655e72f463568df1aadf0\\\",\\\"vout\\\":1}]\"") +
+            "\nList the locked transactions\n"
+            + HelpExampleCli("listlockunspent", "") +
+            "\nUnlock the transaction again\n"
+            + HelpExampleCli("lockunspent", "true \"[{\\\"txid\\\":\\\"a08e6907dbbd3d809776dbfc5d82e371b764ed838b5655e72f463568df1aadf0\\\",\\\"vout\\\":1}]\"") +
+            "\nAs a JSON RPC call\n"
+            + HelpExampleRpc("listlockunspent", "")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    vector<COutPoint> vOutpts;
+    pwalletMain->ListLockedCoins(vOutpts);
+
+    UniValue ret(UniValue::VARR);
+
+    for (COutPoint &outpt : vOutpts) {
+        UniValue o(UniValue::VOBJ);
+
+        o.pushKV("txid", outpt.hash.GetHex());
+        o.pushKV("vout", (int)outpt.n);
+        ret.push_back(o);
+    }
+
+    return ret;
+}
+
+UniValue settxfee(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() < 1 || params.size() > 1)
+        throw runtime_error(
+            "settxfee amount\n"
+            "\nSet the transaction fee per kB. Overwrites the paytxfee parameter.\n"
+            "\nArguments:\n"
+            "1. amount         (numeric, required) The transaction fee in " + CURRENCY_UNIT + "/kB rounded to the nearest 0.00000001\n"
+            "\nResult\n"
+            "true|false        (boolean) Returns true if successful\n"
+            "\nExamples:\n"
+            + HelpExampleCli("settxfee", "0.00001")
+            + HelpExampleRpc("settxfee", "0.00001")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    // Amount
+    CAmount nAmount = AmountFromValue(params[0]);
+
+    payTxFee = CFeeRate(nAmount, 1000);
+    return true;
+}
+
+CAmount getBalanceZaddr(std::optional<libzcash::PaymentAddress> address, int minDepth = 1, int maxDepth = INT_MAX, bool ignoreUnspendable=true);
+
+UniValue getwalletinfo(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() != 0)
+        throw runtime_error(
+            "getwalletinfo\n"
+            "Returns wallet state information.\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"walletversion\": xxxxx,     (numeric) the wallet version\n"
+            "  \"balance\": xxxxxxx,         (numeric) the total confirmed transparent balance of the wallet in " + CURRENCY_UNIT + "\n"
+            "  \"unconfirmed_balance\": xxx, (numeric) the total unconfirmed transparent balance of the wallet in " + CURRENCY_UNIT + "\n"
+            "  \"immature_balance\": xxxxxx, (numeric) the total immature transparent balance of the wallet in " + CURRENCY_UNIT + "\n"
+            "  \"shielded_balance\": xxxxxxx,  (numeric) the total confirmed shielded balance of the wallet in " + CURRENCY_UNIT + "\n"
+            "  \"shielded_unconfirmed_balance\": xxx, (numeric) the total unconfirmed shielded balance of the wallet in " + CURRENCY_UNIT + "\n"
+            "  \"txcount\": xxxxxxx,         (numeric) the total number of transactions in the wallet\n"
+            "  \"keypoololdest\": xxxxxx,    (numeric) the timestamp (seconds since GMT epoch) of the oldest pre-generated key in the key pool\n"
+            "  \"keypoolsize\": xxxx,        (numeric) how many new keys are pre-generated\n"
+            "  \"unlocked_until\": ttt,      (numeric) the timestamp in seconds since epoch (midnight Jan 1 1970 GMT) that the wallet is unlocked for transfers, or 0 if the wallet is locked\n"
+            "  \"paytxfee\": x.xxxx,         (numeric) the transaction fee configuration, set in " + CURRENCY_UNIT + "/kB\n"
+            "  \"mnemonic_seedfp\": \"uint256\", (string) the BLAKE2b-256 hash of the HD seed derived from the wallet's emergency recovery phrase\n"
+            "  \"legacy_seedfp\": \"uint256\",   (string, optional) if this wallet was created prior to release 4.5.2, this will contain the BLAKE2b-256\n"
+            "                                    hash of the legacy HD seed that was used to derive Sapling addresses prior to the 4.5.2 upgrade to mnemonic\n"
+            "                                    emergency recovery phrases. This field was previously named \"seedfp\".\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("getwalletinfo", "")
+            + HelpExampleRpc("getwalletinfo", "")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    UniValue obj(UniValue::VOBJ);
+    obj.pushKV("walletversion", pwalletMain->GetVersion());
+    obj.pushKV("balance",       ValueFromAmount(pwalletMain->GetBalance()));
+    obj.pushKV("unconfirmed_balance", ValueFromAmount(pwalletMain->GetUnconfirmedBalance()));
+    obj.pushKV("immature_balance",    ValueFromAmount(pwalletMain->GetImmatureBalance()));
+    obj.pushKV("shielded_balance",    FormatMoney(getBalanceZaddr(std::nullopt, 1, INT_MAX)));
+    obj.pushKV("shielded_unconfirmed_balance", FormatMoney(getBalanceZaddr(std::nullopt, 0, 0)));
+    obj.pushKV("txcount",       (int)pwalletMain->mapWallet.size());
+    obj.pushKV("keypoololdest", pwalletMain->GetOldestKeyPoolTime());
+    obj.pushKV("keypoolsize",   (int)pwalletMain->GetKeyPoolSize());
+    if (pwalletMain->IsCrypted())
+        obj.pushKV("unlocked_until", nWalletUnlockTime);
+    obj.pushKV("paytxfee",      ValueFromAmount(payTxFee.GetFeePerK()));
+    auto mnemonicChain = pwalletMain->GetMnemonicHDChain();
+    if (mnemonicChain.has_value())
+         obj.pushKV("mnemonic_seedfp", mnemonicChain.value().GetSeedFingerprint().GetHex());
+    // TODO: do we really need to return the legacy seed fingerprint if we're
+    // no longer using it to generate any new keys? What do people actually use
+    // the fingerprint for?
+    auto legacySeed = pwalletMain->GetLegacyHDSeed();
+    if (legacySeed.has_value())
+        obj.pushKV("legacy_seedfp", legacySeed.value().Fingerprint().GetHex());
+    return obj;
+}
+
+UniValue resendwallettransactions(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() != 0)
+        throw runtime_error(
+            "resendwallettransactions\n"
+            "Immediately re-broadcast unconfirmed wallet transactions to all peers.\n"
+            "Intended only for testing; the wallet code periodically re-broadcasts\n"
+            "automatically.\n"
+            "Returns array of transaction ids that were re-broadcast.\n"
+            );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    std::vector<uint256> txids = pwalletMain->ResendWalletTransactionsBefore(GetTime());
+    UniValue result(UniValue::VARR);
+    for (const uint256& txid : txids)
+    {
+        result.push_back(txid.ToString());
+    }
+    return result;
+}
+
+UniValue listunspent(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() > 3)
+        throw runtime_error(
+            "listunspent ( minconf maxconf  [\"address\",...] )\n"
+            "\nReturns array of unspent transparent transaction outputs with between minconf and\n"
+            "maxconf (inclusive) confirmations. Use `z_listunspent` instead to see information\n"
+            "related to unspent shielded notes. Results may be optionally filtered to only include\n"
+            "txouts paid to specified addresses.\n"
+            "\nArguments:\n"
+            "1. minconf          (numeric, optional, default=1) The minimum confirmations to filter\n"
+            "2. maxconf          (numeric, optional, default=9999999) The maximum confirmations to filter\n"
+            "3. \"addresses\"    (string) A json array of Zcash addresses to filter\n"
+            "    [\n"
+            "      \"address\"   (string) Zcash address\n"
+            "      ,...\n"
+            "    ]\n"
+            "\nResult\n"
+            "[                   (array of json object)\n"
+            "  {\n"
+            "    \"txid\" : \"txid\",          (string) the transaction id \n"
+            "    \"vout\" : n,               (numeric) the vout value\n"
+            "    \"generated\" : true|false  (boolean) true if txout is a coinbase transaction output\n"
+            "    \"address\" : \"address\",    (string) the Zcash address\n"
+            "    \"scriptPubKey\" : \"key\",   (string) the script key\n"
+            "    \"amount\" : x.xxx,         (numeric) the transaction amount in " + CURRENCY_UNIT + "\n"
+            "    \"amountZat\" : xxxx        (numeric) the transaction amount in " + MINOR_CURRENCY_UNIT + "\n"
+            "    \"confirmations\" : n,      (numeric) The number of confirmations\n"
+            "    \"redeemScript\" : n        (string) The redeemScript if scriptPubKey is P2SH\n"
+            "    \"spendable\" : xxx         (bool) Whether we have the private keys to spend this output\n"
+            "  }\n"
+            "  ,...\n"
+            "]\n"
+
+            "\nExamples\n"
+            + HelpExampleCli("listunspent", "")
+            + HelpExampleCli("listunspent", "6 9999999 \"[\\\"t1PGFqEzfmQch1gKD3ra4k18PNj3tTUUSqg\\\",\\\"t1LtvqCaApEdUGFkpKMM4MstjcaL4dKg8SP\\\"]\"")
+            + HelpExampleRpc("listunspent", "6, 9999999 \"[\\\"t1PGFqEzfmQch1gKD3ra4k18PNj3tTUUSqg\\\",\\\"t1LtvqCaApEdUGFkpKMM4MstjcaL4dKg8SP\\\"]\"")
+        );
+
+    RPCTypeCheck(params, boost::assign::list_of(UniValue::VNUM)(UniValue::VNUM)(UniValue::VARR));
+
+    int nMinDepth = 1;
+    if (params.size() > 0)
+        nMinDepth = params[0].get_int();
+
+    int nMaxDepth = 9999999;
+    if (params.size() > 1)
+        nMaxDepth = params[1].get_int();
+
+    KeyIO keyIO(Params());
+    std::set<CTxDestination> destinations;
+    if (params.size() > 2) {
+        UniValue inputs = params[2].get_array();
+        for (size_t idx = 0; idx < inputs.size(); idx++) {
+            auto destStr = inputs[idx].get_str();
+            CTxDestination dest = keyIO.DecodeDestination(destStr);
+            if (!IsValidDestination(dest)) {
+                throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, std::string("Invalid Zcash transparent address: ") + destStr);
+            }
+            if (!destinations.insert(dest).second) {
+                throw JSONRPCError(RPC_INVALID_PARAMETER, std::string("Invalid parameter, duplicated address: ") + destStr);
+            }
+        }
+    }
+
+    UniValue results(UniValue::VARR);
+    vector<COutput> vecOutputs;
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+    pwalletMain->AvailableCoins(vecOutputs, false, NULL, true);
+    for (const COutput& out : vecOutputs) {
+        if (out.nDepth < nMinDepth || out.nDepth > nMaxDepth)
+            continue;
+
+        CTxDestination address;
+        const CScript& scriptPubKey = out.tx->vout[out.i].scriptPubKey;
+        bool fValidAddress = ExtractDestination(scriptPubKey, address);
+
+        if (destinations.size() && (!fValidAddress || !destinations.count(address)))
+            continue;
+
+        UniValue entry(UniValue::VOBJ);
+        entry.pushKV("txid", out.tx->GetHash().GetHex());
+        entry.pushKV("vout", out.i);
+        entry.pushKV("generated", out.tx->IsCoinBase());
+
+        if (fValidAddress) {
+            entry.pushKV("address", keyIO.EncodeDestination(address));
+
+            if (scriptPubKey.IsPayToScriptHash()) {
+                const CScriptID& hash = std::get<CScriptID>(address);
+                CScript redeemScript;
+                if (pwalletMain->GetCScript(hash, redeemScript))
+                    entry.pushKV("redeemScript", HexStr(redeemScript.begin(), redeemScript.end()));
+            }
+        }
+
+        entry.pushKV("scriptPubKey", HexStr(scriptPubKey.begin(), scriptPubKey.end()));
+        entry.pushKV("amount", ValueFromAmount(out.tx->vout[out.i].nValue));
+        entry.pushKV("amountZat", out.tx->vout[out.i].nValue);
+        entry.pushKV("confirmations", out.nDepth);
+        entry.pushKV("spendable", out.fSpendable);
+        results.push_back(entry);
+    }
+
+    return results;
+}
+
+
+UniValue z_listunspent(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() > 4)
+        throw runtime_error(
+            "z_listunspent ( minconf maxconf includeWatchonly [\"zaddr\",...] )\n"
+            "\nReturns an array of unspent shielded notes with between minconf and maxconf (inclusive)\n"
+            "confirmations. Results may be optionally filtered to only include notes sent to specified\n"
+            "addresses.\n"
+            "When minconf is 0, unspent notes with zero confirmations are returned, even though they are\n"
+            "not immediately spendable.\n"
+            "\nArguments:\n"
+            "1. minconf          (numeric, optional, default=1) The minimum confirmations to filter\n"
+            "2. maxconf          (numeric, optional, default=9999999) The maximum confirmations to filter\n"
+            "3. includeWatchonly (bool, optional, default=false) Also include watchonly addresses (see 'z_importviewingkey')\n"
+            "4. \"addresses\"      (string) A json array of shielded addresses to filter on.  Duplicate addresses not allowed.\n"
+            "    [\n"
+            "      \"address\"     (string) Sprout, Sapling, or Unified address\n"
+            "      ,...\n"
+            "    ]\n"
+            "\nResult (output indices for only one value pool will be present):\n"
+            "[                             (array of json object)\n"
+            "  {\n"
+            "    \"txid\" : \"txid\",                   (string) the transaction id \n"
+            "    \"pool\" : \"sprout|sapling|orchard\",   (string) The shielded value pool\n"
+            "    \"jsindex\" (sprout) : n,            (numeric) the joinsplit index\n"
+            "    \"jsoutindex\" (sprout) : n,         (numeric) the output index of the joinsplit\n"
+            "    \"outindex\" (sapling, orchard) : n, (numeric) the Sapling output or Orchard action index\n"
+            "    \"confirmations\" : n,               (numeric) the number of confirmations\n"
+            "    \"spendable\" : true|false,          (boolean) true if note can be spent by wallet, false if address is watchonly\n"
+            "    \"account\" : n,                     (numeric, optional) the unified account ID, if applicable\n"
+            "    \"address\" : \"address\",             (string, optional) the shielded address, omitted if this note was sent to an internal receiver\n"
+            "    \"amount\": xxxxx,                   (numeric) the amount of value in the note\n"
+            "    \"memo\": xxxxx,                     (string) hexadecimal string representation of memo field\n"
+            "    \"change\": true|false,              (boolean) true if the address that received the note is also one of the sending addresses\n"
+            "  }\n"
+            "  ,...\n"
+            "]\n"
+
+            "\nExamples\n"
+            + HelpExampleCli("z_listunspent", "")
+            + HelpExampleCli("z_listunspent", "6 9999999 false \"[\\\"ztbx5DLDxa5ZLFTchHhoPNkKs57QzSyib6UqXpEdy76T1aUdFxJt1w9318Z8DJ73XzbnWHKEZP9Yjg712N5kMmP4QzS9iC9\\\",\\\"ztfaW34Gj9FrnGUEf833ywDVL62NWXBM81u6EQnM6VR45eYnXhwztecW1SjxA7JrmAXKJhxhj3vDNEpVCQoSvVoSpmbhtjf\\\"]\"")
+            + HelpExampleRpc("z_listunspent", "6 9999999 false \"[\\\"ztbx5DLDxa5ZLFTchHhoPNkKs57QzSyib6UqXpEdy76T1aUdFxJt1w9318Z8DJ73XzbnWHKEZP9Yjg712N5kMmP4QzS9iC9\\\",\\\"ztfaW34Gj9FrnGUEf833ywDVL62NWXBM81u6EQnM6VR45eYnXhwztecW1SjxA7JrmAXKJhxhj3vDNEpVCQoSvVoSpmbhtjf\\\"]\"")
+        );
+
+    RPCTypeCheck(params, boost::assign::list_of(UniValue::VNUM)(UniValue::VNUM)(UniValue::VBOOL)(UniValue::VARR));
+
+    int nMinDepth = 1;
+    if (params.size() > 0) {
+        nMinDepth = params[0].get_int();
+    }
+    if (nMinDepth < 0) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Minimum number of confirmations cannot be less than 0");
+    }
+
+    int nMaxDepth = 9999999;
+    if (params.size() > 1) {
+        nMaxDepth = params[1].get_int();
+    }
+    if (nMaxDepth < nMinDepth) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Maximum number of confirmations must be greater or equal to the minimum number of confirmations");
+    }
+
+    bool fIncludeWatchonly = false;
+    if (params.size() > 2) {
+        fIncludeWatchonly = params[2].get_bool();
+    }
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    std::optional<NoteFilter> noteFilter = std::nullopt;
+    std::set<std::pair<libzcash::SproutPaymentAddress, uint256>> sproutNullifiers;
+    std::set<std::pair<libzcash::SaplingPaymentAddress, uint256>> saplingNullifiers;
+
+    KeyIO keyIO(Params());
+    // User has supplied zaddrs to filter on
+    if (params.size() > 3) {
+        UniValue addresses = params[3].get_array();
+        if (addresses.size() == 0) {
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, addresses array is empty.");
+        }
+
+        // Sources
+        std::vector<libzcash::PaymentAddress> sourceAddrs;
+        for (const UniValue& o : addresses.getValues()) {
+            if (!o.isStr()) {
+                throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, expected string");
+            }
+
+            auto zaddr = keyIO.DecodePaymentAddress(o.get_str());
+            if (!zaddr.has_value()) {
+                throw JSONRPCError(RPC_INVALID_PARAMETER, string("Invalid parameter, not a valid Zcash address: ") + o.get_str());
+            }
+
+            sourceAddrs.push_back(zaddr.value());
+        }
+
+        noteFilter = NoteFilter::ForPaymentAddresses(sourceAddrs);
+        sproutNullifiers = pwalletMain->GetSproutNullifiers(noteFilter.value().GetSproutAddresses());
+        saplingNullifiers = pwalletMain->GetSaplingNullifiers(noteFilter.value().GetSaplingAddresses());
+
+        // If we don't include watchonly addresses, we must reject any address
+        // for which we do not have the spending key.
+        if (!fIncludeWatchonly && !pwalletMain->HasSpendingKeys(noteFilter.value())) {
+            throw JSONRPCError(RPC_INVALID_PARAMETER, string("Invalid parameter, spending key for an address does not belong to the wallet."));
+        }
+    } else {
+        // User did not provide zaddrs, so use default i.e. all addresses
+        std::set<libzcash::SproutPaymentAddress> sproutzaddrs = {};
+        pwalletMain->GetSproutPaymentAddresses(sproutzaddrs);
+        sproutNullifiers = pwalletMain->GetSproutNullifiers(sproutzaddrs);
+
+        // Sapling support
+        std::set<libzcash::SaplingPaymentAddress> saplingzaddrs = {};
+        pwalletMain->GetSaplingPaymentAddresses(saplingzaddrs);
+        saplingNullifiers = pwalletMain->GetSaplingNullifiers(saplingzaddrs);
+    }
+
+    UniValue results(UniValue::VARR);
+
+    std::vector<SproutNoteEntry> sproutEntries;
+    std::vector<SaplingNoteEntry> saplingEntries;
+    std::vector<OrchardNoteMetadata> orchardEntries;
+    pwalletMain->GetFilteredNotes(sproutEntries, saplingEntries, orchardEntries, noteFilter, nMinDepth, nMaxDepth, true, !fIncludeWatchonly, false);
+
+    for (auto & entry : sproutEntries) {
+        UniValue obj(UniValue::VOBJ);
+        obj.pushKV("txid", entry.jsop.hash.ToString());
+        obj.pushKV("pool", ADDR_TYPE_SPROUT);
+        obj.pushKV("jsindex", (int)entry.jsop.js );
+        obj.pushKV("jsoutindex", (int)entry.jsop.n);
+        obj.pushKV("confirmations", entry.confirmations);
+        bool hasSproutSpendingKey = pwalletMain->HaveSproutSpendingKey(entry.address);
+        obj.pushKV("spendable", hasSproutSpendingKey);
+        obj.pushKV("address", keyIO.EncodePaymentAddress(entry.address));
+        obj.pushKV("amount", ValueFromAmount(CAmount(entry.note.value())));
+        std::string data(entry.memo.begin(), entry.memo.end());
+        obj.pushKV("memo", HexStr(data));
+        if (hasSproutSpendingKey) {
+            obj.pushKV("change", pwalletMain->IsNoteSproutChange(sproutNullifiers, entry.address, entry.jsop));
+        }
+        results.push_back(obj);
+    }
+
+    for (auto & entry : saplingEntries) {
+        UniValue obj(UniValue::VOBJ);
+        obj.pushKV("txid", entry.op.hash.ToString());
+        obj.pushKV("pool", ADDR_TYPE_SAPLING);
+        if (fEnableAddrTypeField) {
+            obj.pushKV("type", ADDR_TYPE_SAPLING); //deprecated
+        }
+        obj.pushKV("outindex", (int)entry.op.n);
+        obj.pushKV("confirmations", entry.confirmations);
+        bool hasSaplingSpendingKey = pwalletMain->HaveSaplingSpendingKeyForAddress(entry.address);
+        obj.pushKV("spendable", hasSaplingSpendingKey);
+        auto account = pwalletMain->FindUnifiedAccountByReceiver(entry.address);
+        if (account.has_value()) {
+            obj.pushKV("account", (uint64_t) account.value());
+        }
+        auto addr = pwalletMain->GetPaymentAddressForRecipient(entry.op.hash, entry.address);
+        if (addr.second != RecipientType::WalletInternalAddress) {
+            obj.pushKV("address", keyIO.EncodePaymentAddress(addr.first));
+        }
+        obj.pushKV("amount", ValueFromAmount(CAmount(entry.note.value()))); // note.value() is equivalent to plaintext.value()
+        obj.pushKV("memo", HexStr(entry.memo));
+        if (hasSaplingSpendingKey) {
+            obj.pushKV(
+                    "change",
+                    pwalletMain->IsNoteSaplingChange(saplingNullifiers, entry.address, entry.op));
+        }
+        results.push_back(obj);
+    }
+
+    for (auto & entry : orchardEntries) {
+        UniValue obj(UniValue::VOBJ);
+        obj.pushKV("txid", entry.GetOutPoint().hash.ToString());
+        obj.pushKV("pool", ADDR_TYPE_ORCHARD);
+        obj.pushKV("outindex", (int)entry.GetOutPoint().n);
+        obj.pushKV("confirmations", entry.GetConfirmations());
+
+        // TODO: add a better mechanism for checking whether we have the
+        // spending key for an Orchard receiver.
+        auto ufvkMeta = pwalletMain->GetUFVKMetadataForReceiver(entry.GetAddress());
+        auto account = pwalletMain->GetUnifiedAccountId(ufvkMeta.value().GetUFVKId());
+        bool haveSpendingKey = ufvkMeta.has_value() && account.has_value();
+        bool isInternal = pwalletMain->IsInternalRecipient(entry.GetAddress());
+
+        std::optional<std::string> addrStr;
+        obj.pushKV("spendable", haveSpendingKey);
+        if (account.has_value()) {
+            obj.pushKV("account", (uint64_t) account.value());
+        }
+        auto addr = pwalletMain->GetPaymentAddressForRecipient(entry.GetOutPoint().hash, entry.GetAddress());
+        if (addr.second != RecipientType::WalletInternalAddress) {
+            obj.pushKV("address", keyIO.EncodePaymentAddress(addr.first));
+        }
+        obj.pushKV("amount", ValueFromAmount(entry.GetNoteValue()));
+        obj.pushKV("memo", HexStr(entry.GetMemo()));
+        if (haveSpendingKey) {
+            obj.pushKV("change", isInternal);
+        }
+        results.push_back(obj);
+    }
+
+    return results;
+}
+
+
+UniValue fundrawtransaction(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() < 1 || params.size() > 2)
+        throw runtime_error(
+            "fundrawtransaction \"hexstring\" includeWatching\n"
+            "\nAdd transparent inputs to a transaction until it has enough in value to meet its out value.\n"
+            "This will not modify existing inputs, and will add one change output to the outputs.\n"
+            "Note that inputs which were signed may need to be resigned after completion since in/outputs have been added.\n"
+            "The inputs added will not be signed, use signrawtransaction for that.\n"
+            "Note that all existing inputs must have their previous output transaction be in the wallet.\n"
+            "Note that all inputs selected must be of standard form and P2SH scripts must be"
+            "in the wallet using importaddress or addmultisigaddress (to calculate fees).\n"
+            "Only pay-to-pubkey, multisig, and P2SH versions thereof are currently supported for watch-only\n"
+            "\nArguments:\n"
+            "1. \"hexstring\"     (string, required) The hex string of the raw transaction\n"
+            "2. includeWatching (boolean, optional, default false) Also select inputs which are watch only\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"hex\":       \"value\", (string)  The resulting raw transaction (hex-encoded string)\n"
+            "  \"fee\":       n,         (numeric) The fee added to the transaction\n"
+            "  \"changepos\": n          (numeric) The position of the added change output, or -1\n"
+            "}\n"
+            "\"hex\"             \n"
+            "\nExamples:\n"
+            "\nCreate a transaction with no inputs\n"
+            + HelpExampleCli("createrawtransaction", "\"[]\" \"{\\\"myaddress\\\":0.01}\"") +
+            "\nAdd sufficient unsigned inputs to meet the output value\n"
+            + HelpExampleCli("fundrawtransaction", "\"rawtransactionhex\"") +
+            "\nSign the transaction\n"
+            + HelpExampleCli("signrawtransaction", "\"fundedtransactionhex\"") +
+            "\nSend the transaction\n"
+            + HelpExampleCli("sendrawtransaction", "\"signedtransactionhex\"")
+            );
+
+    RPCTypeCheck(params, boost::assign::list_of(UniValue::VSTR)(UniValue::VBOOL));
+
+    // parse hex string from parameter
+    CTransaction origTx;
+    if (!DecodeHexTx(origTx, params[0].get_str()))
+        throw JSONRPCError(RPC_DESERIALIZATION_ERROR, "TX decode failed");
+
+    bool includeWatching = false;
+    if (params.size() > 1)
+        includeWatching = true;
+
+    CMutableTransaction tx(origTx);
+    CAmount nFee;
+    string strFailReason;
+    int nChangePos = -1;
+    if(!pwalletMain->FundTransaction(tx, nFee, nChangePos, strFailReason, includeWatching))
+        throw JSONRPCError(RPC_INTERNAL_ERROR, strFailReason);
+
+    UniValue result(UniValue::VOBJ);
+    result.pushKV("hex", EncodeHexTx(tx));
+    result.pushKV("changepos", nChangePos);
+    result.pushKV("fee", ValueFromAmount(nFee));
+
+    return result;
+}
+
+UniValue zc_sample_joinsplit(const UniValue& params, bool fHelp)
+{
+    if (fHelp) {
+        throw runtime_error(
+            "zcsamplejoinsplit\n"
+            "\n"
+            "Perform a joinsplit and return the JSDescription.\n"
+            );
+    }
+
+    LOCK(cs_main);
+
+    Ed25519VerificationKey joinSplitPubKey;
+    uint256 anchor = SproutMerkleTree().root();
+    std::array<libzcash::JSInput, ZC_NUM_JS_INPUTS> inputs({JSInput(), JSInput()});
+    std::array<libzcash::JSOutput, ZC_NUM_JS_OUTPUTS> outputs({JSOutput(), JSOutput()});
+    auto samplejoinsplit = JSDescriptionInfo(joinSplitPubKey,
+                                  anchor,
+                                  inputs,
+                                  outputs,
+                                  0,
+                                  0).BuildDeterministic();
+
+    CDataStream ss(SER_NETWORK, SAPLING_TX_VERSION | (1 << 31));
+    ss << samplejoinsplit;
+
+    return HexStr(ss.begin(), ss.end());
+}
+
+UniValue zc_benchmark(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp)) {
+        return NullUniValue;
+    }
+
+    if (fHelp || params.size() < 2) {
+        throw runtime_error(
+            "zcbenchmark benchmarktype samplecount\n"
+            "\n"
+            "Runs a benchmark of the selected benchmark type samplecount times,\n"
+            "returning the running times of each sample.\n"
+            "\n"
+            "Output: [\n"
+            "  {\n"
+            "    \"runningtime\": runningtime\n"
+            "  },\n"
+            "  {\n"
+            "    \"runningtime\": runningtime\n"
+            "  }\n"
+            "  ...\n"
+            "]\n"
+            );
+    }
+
+    LOCK(cs_main);
+
+    std::string benchmarktype = params[0].get_str();
+    int samplecount = params[1].get_int();
+
+    if (samplecount <= 0) {
+        throw JSONRPCError(RPC_TYPE_ERROR, "Invalid samplecount");
+    }
+
+    std::vector<double> sample_times;
+
+    JSDescription samplejoinsplit;
+
+    if (benchmarktype == "verifyjoinsplit") {
+        CDataStream ss(ParseHexV(params[2].get_str(), "js"), SER_NETWORK, SAPLING_TX_VERSION | (1 << 31));
+        ss >> samplejoinsplit;
+    }
+
+    for (int i = 0; i < samplecount; i++) {
+        if (benchmarktype == "sleep") {
+            sample_times.push_back(benchmark_sleep());
+        } else if (benchmarktype == "parameterloading") {
+            throw JSONRPCError(RPC_TYPE_ERROR, "Pre-Sapling Sprout parameters have been removed");
+        } else if (benchmarktype == "createjoinsplit") {
+            if (params.size() < 3) {
+                sample_times.push_back(benchmark_create_joinsplit());
+            } else {
+                int nThreads = params[2].get_int();
+                std::vector<double> vals = benchmark_create_joinsplit_threaded(nThreads);
+                // Divide by nThreads^2 to get average seconds per JoinSplit because
+                // we are running one JoinSplit per thread.
+                sample_times.push_back(std::accumulate(vals.begin(), vals.end(), 0.0) / (nThreads*nThreads));
+            }
+        } else if (benchmarktype == "verifyjoinsplit") {
+            sample_times.push_back(benchmark_verify_joinsplit(samplejoinsplit));
+#ifdef ENABLE_MINING
+        } else if (benchmarktype == "solveequihash") {
+            if (params.size() < 3) {
+                sample_times.push_back(benchmark_solve_equihash());
+            } else {
+                int nThreads = params[2].get_int();
+                std::vector<double> vals = benchmark_solve_equihash_threaded(nThreads);
+                sample_times.insert(sample_times.end(), vals.begin(), vals.end());
+            }
+#endif
+        } else if (benchmarktype == "verifyequihash") {
+            sample_times.push_back(benchmark_verify_equihash());
+        } else if (benchmarktype == "validatelargetx") {
+            // Number of inputs in the spending transaction that we will simulate
+            int nInputs = 11130;
+            if (params.size() >= 3) {
+                nInputs = params[2].get_int();
+            }
+            sample_times.push_back(benchmark_large_tx(nInputs));
+        } else if (benchmarktype == "trydecryptnotes") {
+            int nKeys = params[2].get_int();
+            sample_times.push_back(benchmark_try_decrypt_sprout_notes(nKeys));
+        } else if (benchmarktype == "trydecryptsaplingnotes") {
+            int nKeys = params[2].get_int();
+            sample_times.push_back(benchmark_try_decrypt_sapling_notes(nKeys));
+        } else if (benchmarktype == "incnotewitnesses") {
+            int nTxs = params[2].get_int();
+            sample_times.push_back(benchmark_increment_sprout_note_witnesses(nTxs));
+        } else if (benchmarktype == "incsaplingnotewitnesses") {
+            int nTxs = params[2].get_int();
+            sample_times.push_back(benchmark_increment_sapling_note_witnesses(nTxs));
+        } else if (benchmarktype == "connectblockslow") {
+            if (Params().NetworkIDString() != "regtest") {
+                throw JSONRPCError(RPC_TYPE_ERROR, "Benchmark must be run in regtest mode");
+            }
+            sample_times.push_back(benchmark_connectblock_slow());
+        } else if (benchmarktype == "sendtoaddress") {
+            if (Params().NetworkIDString() != "regtest") {
+                throw JSONRPCError(RPC_TYPE_ERROR, "Benchmark must be run in regtest mode");
+            }
+            auto amount = AmountFromValue(params[2]);
+            sample_times.push_back(benchmark_sendtoaddress(amount));
+        } else if (benchmarktype == "loadwallet") {
+            if (Params().NetworkIDString() != "regtest") {
+                throw JSONRPCError(RPC_TYPE_ERROR, "Benchmark must be run in regtest mode");
+            }
+            sample_times.push_back(benchmark_loadwallet());
+        } else if (benchmarktype == "listunspent") {
+            sample_times.push_back(benchmark_listunspent());
+        } else if (benchmarktype == "createsaplingspend") {
+            sample_times.push_back(benchmark_create_sapling_spend());
+        } else if (benchmarktype == "createsaplingoutput") {
+            sample_times.push_back(benchmark_create_sapling_output());
+        } else if (benchmarktype == "verifysaplingspend") {
+            sample_times.push_back(benchmark_verify_sapling_spend());
+        } else if (benchmarktype == "verifysaplingoutput") {
+            sample_times.push_back(benchmark_verify_sapling_output());
+        } else {
+            throw JSONRPCError(RPC_TYPE_ERROR, "Invalid benchmarktype");
+        }
+    }
+
+    UniValue results(UniValue::VARR);
+    for (auto time : sample_times) {
+        UniValue result(UniValue::VOBJ);
+        result.pushKV("runningtime", time);
+        results.push_back(result);
+    }
+
+    return results;
+}
+
+UniValue zc_raw_receive(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp)) {
+        return NullUniValue;
+    }
+
+    if (!fEnableZCRawReceive)
+        throw runtime_error(
+            "zcrawreceive is DEPRECATED and will be removed in a future release\n"
+            "\nrestart with `-allowdeprecated=zcrawreceive` if you require backward compatibility.\n"
+            "See https://zcash.github.io/zcash/user/deprecation.html for more information.");
+
+    if (fHelp || params.size() != 2) {
+        throw runtime_error(
+            "zcrawreceive zcsecretkey encryptednote\n"
+            "\n"
+            "DEPRECATED. Decrypts encryptednote and checks if the coin commitments\n"
+            "are in the blockchain as indicated by the \"exists\" result.\n"
+            "\n"
+            "Output: {\n"
+            "  \"amount\": value,\n"
+            "  \"note\": noteplaintext,\n"
+            "  \"exists\": exists\n"
+            "}\n"
+            );
+    }
+
+    RPCTypeCheck(params, boost::assign::list_of(UniValue::VSTR)(UniValue::VSTR));
+
+    LOCK(cs_main);
+
+    KeyIO keyIO(Params());
+    auto spendingkey = keyIO.DecodeSpendingKey(params[0].get_str());
+    if (!spendingkey.has_value()) {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid spending key");
+    }
+    if (std::get_if<libzcash::SproutSpendingKey>(&spendingkey.value()) == nullptr) {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Only works with Sprout spending keys");
+    }
+    SproutSpendingKey k = std::get<libzcash::SproutSpendingKey>(spendingkey.value());
+
+    uint256 epk;
+    unsigned char nonce;
+    ZCNoteEncryption::Ciphertext ct;
+    uint256 h_sig;
+
+    {
+        CDataStream ssData(ParseHexV(params[1], "encrypted_note"), SER_NETWORK, PROTOCOL_VERSION);
+        try {
+            ssData >> nonce;
+            ssData >> epk;
+            ssData >> ct;
+            ssData >> h_sig;
+        } catch(const std::exception &) {
+            throw runtime_error(
+                "encrypted_note could not be decoded"
+            );
+        }
+    }
+
+    ZCNoteDecryption decryptor(k.receiving_key());
+
+    SproutNotePlaintext npt = SproutNotePlaintext::decrypt(
+        decryptor,
+        ct,
+        epk,
+        h_sig,
+        nonce
+    );
+    SproutPaymentAddress payment_addr = k.address();
+    SproutNote decrypted_note = npt.note(payment_addr);
+
+    assert(pwalletMain != NULL);
+    std::vector<std::optional<SproutWitness>> witnesses;
+    uint256 anchor;
+    uint256 commitment = decrypted_note.cm();
+    pwalletMain->WitnessNoteCommitment(
+        {commitment},
+        witnesses,
+        anchor
+    );
+
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << npt;
+
+    UniValue result(UniValue::VOBJ);
+    result.pushKV("amount", ValueFromAmount(decrypted_note.value()));
+    result.pushKV("note", HexStr(ss.begin(), ss.end()));
+    result.pushKV("exists", (bool) witnesses[0]);
+    return result;
+}
+
+
+
+UniValue zc_raw_joinsplit(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp)) {
+        return NullUniValue;
+    }
+
+    if (!fEnableZCRawJoinSplit)
+        throw runtime_error(
+            "zcrawjoinsplit is DEPRECATED and will be removed in a future release\n"
+            "\nrestart with `-allowdeprecated=zcrawjoinsplit` if you require backward compatibility.\n"
+            "See https://zcash.github.io/zcash/user/deprecation.html for more information.");
+
+    if (fHelp || params.size() != 5) {
+        throw runtime_error(
+            "zcrawjoinsplit rawtx inputs outputs vpub_old vpub_new\n"
+            "  inputs: a JSON object mapping {note: zcsecretkey, ...}\n"
+            "  outputs: a JSON object mapping {zcaddr: value, ...}\n"
+            "\n"
+            "DEPRECATED. Splices a joinsplit into rawtx. Inputs are unilaterally confidential.\n"
+            "Outputs are confidential between sender/receiver. The vpub_old and\n"
+            "vpub_new values are globally public and move transparent value into\n"
+            "or out of the confidential value store, respectively.\n"
+            "\n"
+            "Note: The caller is responsible for delivering the output enc1 and\n"
+            "enc2 to the appropriate recipients, as well as signing rawtxout and\n"
+            "ensuring it is mined. (A future RPC call will deliver the confidential\n"
+            "payments in-band on the blockchain.)\n"
+            "\n"
+            "Output: {\n"
+            "  \"encryptednote1\": enc1,\n"
+            "  \"encryptednote2\": enc2,\n"
+            "  \"rawtxn\": rawtxout\n"
+            "}\n"
+            );
+    }
+
+    LOCK(cs_main);
+
+    CTransaction tx;
+    if (!DecodeHexTx(tx, params[0].get_str()))
+        throw JSONRPCError(RPC_DESERIALIZATION_ERROR, "TX decode failed");
+    if (tx.nVersion >= ZIP225_TX_VERSION) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "v5+ transactions do not support Sprout");
+    }
+
+    UniValue inputs = params[1].get_obj();
+    UniValue outputs = params[2].get_obj();
+
+    CAmount vpub_old(0);
+    CAmount vpub_new(0);
+
+    int nextBlockHeight = chainActive.Height() + 1;
+
+    const bool canopyActive = Params().GetConsensus().NetworkUpgradeActive(nextBlockHeight, Consensus::UPGRADE_CANOPY);
+
+    if (params[3].get_real() != 0.0) {
+        if (canopyActive) {
+            throw JSONRPCError(RPC_VERIFY_REJECTED, "Sprout shielding is not supported after Canopy");
+        }
+        vpub_old = AmountFromValue(params[3]);
+    }
+
+    if (params[4].get_real() != 0.0)
+        vpub_new = AmountFromValue(params[4]);
+
+    std::vector<JSInput> vjsin;
+    std::vector<JSOutput> vjsout;
+    std::vector<SproutNote> notes;
+    std::vector<SproutSpendingKey> keys;
+    std::vector<uint256> commitments;
+
+    KeyIO keyIO(Params());
+    for (const string& name_ : inputs.getKeys()) {
+        auto spendingkey = keyIO.DecodeSpendingKey(inputs[name_].get_str());
+        if (!spendingkey.has_value()) {
+            throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid spending key");
+        }
+        if (std::get_if<libzcash::SproutSpendingKey>(&spendingkey.value()) == nullptr) {
+            throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Only works with Sprout spending keys");
+        }
+        SproutSpendingKey k = std::get<libzcash::SproutSpendingKey>(spendingkey.value());
+
+        keys.push_back(k);
+
+        SproutNotePlaintext npt;
+
+        {
+            CDataStream ssData(ParseHexV(name_, "note"), SER_NETWORK, PROTOCOL_VERSION);
+            ssData >> npt;
+        }
+
+        SproutPaymentAddress addr = k.address();
+        SproutNote note = npt.note(addr);
+        notes.push_back(note);
+        commitments.push_back(note.cm());
+    }
+
+    uint256 anchor;
+    std::vector<std::optional<SproutWitness>> witnesses;
+    pwalletMain->WitnessNoteCommitment(commitments, witnesses, anchor);
+
+    assert(witnesses.size() == notes.size());
+    assert(notes.size() == keys.size());
+
+    {
+        for (size_t i = 0; i < witnesses.size(); i++) {
+            if (!witnesses[i]) {
+                throw runtime_error(
+                    "joinsplit input could not be found in tree"
+                );
+            }
+
+            vjsin.push_back(JSInput(*witnesses[i], notes[i], keys[i]));
+        }
+    }
+
+    while (vjsin.size() < ZC_NUM_JS_INPUTS) {
+        vjsin.push_back(JSInput());
+    }
+
+    for (const string& name_ : outputs.getKeys()) {
+        auto addrToDecoded = keyIO.DecodePaymentAddress(name_);
+        if (!addrToDecoded.has_value()) {
+            throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid recipient address.");
+        }
+
+        libzcash::PaymentAddress addrTo(addrToDecoded.value());
+        if (!std::holds_alternative<libzcash::SproutPaymentAddress>(addrTo)) {
+            throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Only works with Sprout payment addresses");
+        }
+        CAmount nAmount = AmountFromValue(outputs[name_]);
+
+        vjsout.push_back(JSOutput(std::get<libzcash::SproutPaymentAddress>(addrTo), nAmount));
+    }
+
+    while (vjsout.size() < ZC_NUM_JS_OUTPUTS) {
+        vjsout.push_back(JSOutput());
+    }
+
+    // TODO
+    if (vjsout.size() != ZC_NUM_JS_INPUTS || vjsin.size() != ZC_NUM_JS_OUTPUTS) {
+        throw runtime_error("unsupported joinsplit input/output counts");
+    }
+
+    Ed25519VerificationKey joinSplitPubKey;
+    Ed25519SigningKey joinSplitPrivKey;
+    ed25519_generate_keypair(&joinSplitPrivKey, &joinSplitPubKey);
+
+    CMutableTransaction mtx(tx);
+    mtx.nVersion = 4;
+    mtx.nVersionGroupId = SAPLING_VERSION_GROUP_ID;
+    mtx.joinSplitPubKey = joinSplitPubKey;
+
+    std::array<libzcash::JSInput, ZC_NUM_JS_INPUTS> jsInputs({vjsin[0], vjsin[1]});
+    std::array<libzcash::JSOutput, ZC_NUM_JS_OUTPUTS> jsIutputs({vjsout[0], vjsout[1]});
+    auto jsdesc = JSDescriptionInfo(joinSplitPubKey,
+                         anchor,
+                         jsInputs,
+                         jsIutputs,
+                         vpub_old,
+                         vpub_new).BuildDeterministic();
+
+    {
+        auto verifier = ProofVerifier::Strict();
+        assert(verifier.VerifySprout(jsdesc, joinSplitPubKey));
+    }
+
+    mtx.vJoinSplit.push_back(jsdesc);
+
+    // Empty output script.
+    CScript scriptCode;
+    CTransaction signTx(mtx);
+    // This API will never support v5+ transactions, and can ignore ZIP 244.
+    PrecomputedTransactionData txdata(signTx, {});
+    auto consensusBranchId = CurrentEpochBranchId(chainActive.Height() + 1, Params().GetConsensus());
+    uint256 dataToBeSigned = SignatureHash(scriptCode, signTx, NOT_AN_INPUT, SIGHASH_ALL, 0, consensusBranchId, txdata);
+
+    // Add the signature
+    assert(ed25519_sign(
+        &joinSplitPrivKey,
+        dataToBeSigned.begin(), 32,
+        &mtx.joinSplitSig));
+
+    // Sanity check
+    assert(ed25519_verify(
+        &mtx.joinSplitPubKey,
+        &mtx.joinSplitSig,
+        dataToBeSigned.begin(), 32));
+
+    CTransaction rawTx(mtx);
+
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << rawTx;
+
+    std::string encryptedNote1;
+    std::string encryptedNote2;
+    {
+        CDataStream ss2(SER_NETWORK, PROTOCOL_VERSION);
+        ss2 << ((unsigned char) 0x00);
+        ss2 << jsdesc.ephemeralKey;
+        ss2 << jsdesc.ciphertexts[0];
+        ss2 << ZCJoinSplit::h_sig(jsdesc.randomSeed, jsdesc.nullifiers, joinSplitPubKey);
+
+        encryptedNote1 = HexStr(ss2.begin(), ss2.end());
+    }
+    {
+        CDataStream ss2(SER_NETWORK, PROTOCOL_VERSION);
+        ss2 << ((unsigned char) 0x01);
+        ss2 << jsdesc.ephemeralKey;
+        ss2 << jsdesc.ciphertexts[1];
+        ss2 << ZCJoinSplit::h_sig(jsdesc.randomSeed, jsdesc.nullifiers, joinSplitPubKey);
+
+        encryptedNote2 = HexStr(ss2.begin(), ss2.end());
+    }
+
+    UniValue result(UniValue::VOBJ);
+    result.pushKV("encryptednote1", encryptedNote1);
+    result.pushKV("encryptednote2", encryptedNote2);
+    result.pushKV("rawtxn", HexStr(ss.begin(), ss.end()));
+    return result;
+}
+
+UniValue zc_raw_keygen(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp)) {
+        return NullUniValue;
+    }
+
+    if (!fEnableZCRawKeygen)
+        throw runtime_error(
+            "zcrawkeygen is DEPRECATED and will be removed in a future release\n"
+            "\nrestart with `-allowdeprecated=zcrawkeygen` if you require backward compatibility.\n"
+            "See https://zcash.github.io/zcash/user/deprecation.html for more information.");
+
+    if (fHelp || params.size() != 0) {
+        throw runtime_error(
+            "zcrawkeygen\n"
+            "\n"
+            "DEPRECATED. Generate a zcaddr which can send and receive confidential values.\n"
+            "\n"
+            "Output: {\n"
+            "  \"zcaddress\": zcaddr,\n"
+            "  \"zcsecretkey\": zcsecretkey,\n"
+            "  \"zcviewingkey\": zcviewingkey,\n"
+            "}\n"
+            );
+    }
+
+    auto k = SproutSpendingKey::random();
+    auto addr = k.address();
+    auto viewing_key = k.viewing_key();
+
+    KeyIO keyIO(Params());
+    UniValue result(UniValue::VOBJ);
+    result.pushKV("zcaddress", keyIO.EncodePaymentAddress(addr));
+    result.pushKV("zcsecretkey", keyIO.EncodeSpendingKey(k));
+    result.pushKV("zcviewingkey", keyIO.EncodeViewingKey(viewing_key));
+    return result;
+}
+
+
+UniValue z_getnewaddress(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (!fEnableZGetNewAddress)
+        throw runtime_error(
+            "z_getnewaddress is DEPRECATED and will be removed in a future release\n"
+            "\nUse z_getnewaccount and z_getaddressforaccount instead, or restart \n"
+            "with `-allowdeprecated=z_getnewaddress` if you require backward compatibility.\n"
+            "See https://zcash.github.io/zcash/user/deprecation.html for more information.");
+
+    std::string defaultType = ADDR_TYPE_SAPLING;
+
+    if (fHelp || params.size() > 1)
+        throw runtime_error(
+            "z_getnewaddress ( type )\n"
+            "\nDEPRECATED. Use z_getnewaccount and z_getaddressforaccount instead.\n"
+            "\nReturns a new shielded address for receiving payments.\n"
+            "\nWith no arguments, returns a Sapling address.\n"
+            "Generating a Sprout address is not allowed after Canopy has activated.\n"
+            "\nArguments:\n"
+            "1. \"type\"         (string, optional, default=\"" + defaultType + "\") The type of address. One of [\""
+            + ADDR_TYPE_SPROUT + "\", \"" + ADDR_TYPE_SAPLING + "\"].\n"
+            "\nResult:\n"
+            "\"zcashaddress\"    (string) The new shielded address.\n"
+            "\nExamples:\n"
+            + HelpExampleCli("z_getnewaddress", "")
+            + HelpExampleCli("z_getnewaddress", ADDR_TYPE_SAPLING)
+            + HelpExampleRpc("z_getnewaddress", "")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    const CChainParams& chainparams = Params();
+
+    EnsureWalletIsUnlocked();
+    EnsureWalletIsBackedUp(chainparams);
+
+    auto addrType = defaultType;
+    if (params.size() > 0) {
+        addrType = params[0].get_str();
+    }
+
+    KeyIO keyIO(chainparams);
+    if (addrType == ADDR_TYPE_SPROUT) {
+        if (chainparams.GetConsensus().NetworkUpgradeActive(chainActive.Height(), Consensus::UPGRADE_CANOPY)) {
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid address type, \""
+                               + ADDR_TYPE_SPROUT + "\" is not allowed after Canopy");
+        }
+        if (IsInitialBlockDownload(Params().GetConsensus())) {
+            throw JSONRPCError(RPC_CLIENT_IN_INITIAL_DOWNLOAD, "Error: Creating a Sprout address during initial block download is not supported.");
+        }
+        return keyIO.EncodePaymentAddress(pwalletMain->GenerateNewSproutZKey());
+    } else if (addrType == ADDR_TYPE_SAPLING) {
+        auto saplingAddress = pwalletMain->GenerateNewLegacySaplingZKey();
+        return keyIO.EncodePaymentAddress(saplingAddress);
+    } else {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid address type");
+    }
+}
+
+UniValue z_getnewaccount(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+    if (fHelp || params.size() > 0)
+        throw runtime_error(
+            "z_getnewaccount\n"
+            "\nPrepares and returns a new account.\n"
+            "\nAccounts are numbered starting from zero; this RPC method selects the next"
+            "\navailable sequential account number within the UA-compatible HD seed phrase.\n"
+            "\nEach new account is a separate group of funds within the wallet, and adds an"
+            "\nadditional performance cost to wallet scanning.\n"
+            "\nUse the z_getaddressforaccount RPC method to obtain addresses for an account.\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"account\": n,       (numeric) the new account number\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("z_getnewaccount", "")
+            + HelpExampleRpc("z_getnewaccount", "")
+        );
+
+    LOCK(pwalletMain->cs_wallet);
+
+    EnsureWalletIsUnlocked();
+    EnsureWalletIsBackedUp(Params());
+
+    // Generate the new account.
+    auto ufvkNew = pwalletMain->GenerateNewUnifiedSpendingKey();
+    const auto& account = ufvkNew.second;
+
+    UniValue result(UniValue::VOBJ);
+    result.pushKV("account", (uint64_t)account);
+    return result;
+}
+
+UniValue z_getaddressforaccount(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+    if (fHelp || params.size() < 1 || params.size() > 3)
+        throw runtime_error(
+            "z_getaddressforaccount account ( [\"receiver_type\", ...] diversifier_index )\n"
+            "\nFor the given account number, derives a Unified Address in accordance"
+            "\nwith the remaining arguments:\n"
+            "\n- If no list of receiver types is given (or the empty list \"[]\"), the best"
+            "\n  and second-best shielded receiver types, along with the \"p2pkh\" (i.e. transparent) receiver"
+            "\n  type, will be used."
+            "\n- If no diversifier index is given, the next unused index (that is valid"
+            "\n  for the list of receiver types) will be selected.\n"
+            "\nThe account number must have been previously generated by a call to the"
+            "\nz_getnewaccount RPC method.\n"
+            "\nOnce a Unified Address has been derived at a specific diversifier index,"
+            "\nre-deriving it (via a subsequent call to z_getaddressforaccount with the"
+            "\nsame account and index) will produce the same address with the same list"
+            "\nof receiver types. An error will be returned if a different list of receiver"
+            "\ntypes is requested.\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"account\": n,                          (numeric) the specified account number\n"
+            "  \"diversifier_index\": n,                (numeric) the index specified or chosen\n"
+            "  \"receiver_types\": [\"orchard\",...]\",   (json array of string) the receiver types that the UA contains (valid values are \"p2pkh\", \"sapling\", \"orchard\")\n"
+            "  \"address\"                              (string) The corresponding address\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("z_getaddressforaccount", "4")
+            + HelpExampleCli("z_getaddressforaccount", "4 '[]' 1")
+            + HelpExampleCli("z_getaddressforaccount", "4 '[\"transparent\",\"sapling\",\"orchard\"]' 1")
+            + HelpExampleRpc("z_getaddressforaccount", "4")
+        );
+
+    // cs_main is required for obtaining the current height, for
+    // CWallet::DefaultReceiverTypes
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    int64_t accountInt = params[0].get_int64();
+    if (accountInt < 0 || accountInt >= ZCASH_LEGACY_ACCOUNT) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid account number, must be 0 <= account <= (2^31)-2.");
+    }
+    libzcash::AccountId account = accountInt;
+
+    std::set<libzcash::ReceiverType> receiverTypes;
+    if (params.size() >= 2) {
+        const auto& parsed = params[1].get_array();
+        for (size_t i = 0; i < parsed.size(); i++) {
+            const std::string& p = parsed[i].get_str();
+            if (p == "p2pkh") {
+                receiverTypes.insert(ReceiverType::P2PKH);
+            } else if (p == "sapling") {
+                receiverTypes.insert(ReceiverType::Sapling);
+            } else if (p == "orchard") {
+                receiverTypes.insert(ReceiverType::Orchard);
+            } else {
+                throw JSONRPCError(RPC_INVALID_PARAMETER, "receiver type arguments must be \"p2pkh\", \"sapling\", or \"orchard\"");
+            }
+        }
+    }
+    if (receiverTypes.empty()) {
+        // Default is the best and second-best shielded receiver types, and the transparent (P2PKH) receiver type.
+        receiverTypes = CWallet::DefaultReceiverTypes(chainActive.Height());
+    }
+
+    std::optional<libzcash::diversifier_index_t> j = std::nullopt;
+    if (params.size() >= 3) {
+        if (params[2].getType() != UniValue::VNUM) {
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid diversifier index, must be an unsigned integer.");
+        }
+        auto parsed_diversifier_index_opt = ParseArbitraryInt(params[2].getValStr());
+        if (!parsed_diversifier_index_opt.has_value()) {
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "diversifier index must be a decimal integer.");
+        }
+        auto parsed_diversifier_index = parsed_diversifier_index_opt.value();
+        if (parsed_diversifier_index.size() > ZC_DIVERSIFIER_SIZE) {
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "diversifier index is too large.");
+        }
+        // Extend the byte array to the correct length for diversifier_index_t.
+        parsed_diversifier_index.resize(ZC_DIVERSIFIER_SIZE);
+        j = libzcash::diversifier_index_t(parsed_diversifier_index);
+    }
+
+    EnsureWalletIsUnlocked();
+    EnsureWalletIsBackedUp(Params());
+
+    auto res = pwalletMain->GenerateUnifiedAddress(account, receiverTypes, j);
+
+    UniValue result(UniValue::VOBJ);
+    result.pushKV("account", (uint64_t)account);
+
+    std::visit(match {
+        [&](std::pair<libzcash::UnifiedAddress, libzcash::diversifier_index_t> addr) {
+            result.pushKV("address", KeyIO(Params()).EncodePaymentAddress(addr.first));
+            UniValue j;
+            j.setNumStr(ArbitraryIntStr(std::vector(addr.second.begin(), addr.second.end())));
+            result.pushKV("diversifier_index", j);
+        },
+        [&](WalletUAGenerationError err) {
+            std::string strErr;
+            switch (err) {
+                case WalletUAGenerationError::NoSuchAccount:
+                    strErr = tfm::format("Error: account %d has not been generated by z_getnewaccount.", account);
+                    break;
+                case WalletUAGenerationError::ExistingAddressMismatch:
+                    strErr = tfm::format(
+                        "Error: address at diversifier index %s was already generated with different receiver types.",
+                        params[2].getValStr());
+                    break;
+                case WalletUAGenerationError::WalletEncrypted:
+                    // By construction, we should never see this error; this case is included
+                    // only for future-proofing.
+                    strErr = tfm::format("Error: wallet is encrypted.");
+            }
+            throw JSONRPCError(RPC_WALLET_ERROR, strErr);
+        },
+        [&](UnifiedAddressGenerationError err) {
+            std::string strErr;
+            switch (err) {
+                case UnifiedAddressGenerationError::NoAddressForDiversifier:
+                    strErr = tfm::format(
+                        "Error: no address at diversifier index %s.",
+                        ArbitraryIntStr(std::vector(j.value().begin(), j.value().end())));
+                    break;
+                case UnifiedAddressGenerationError::InvalidTransparentChildIndex:
+                    strErr = tfm::format(
+                        "Error: diversifier index %s cannot generate an address with a transparent receiver.",
+                        ArbitraryIntStr(std::vector(j.value().begin(), j.value().end())));
+                    break;
+                case UnifiedAddressGenerationError::ShieldedReceiverNotFound:
+                    strErr = tfm::format(
+                        "Error: cannot generate an address containing no shielded receivers.");
+                    break;
+                case UnifiedAddressGenerationError::ReceiverTypeNotAvailable:
+                    strErr = tfm::format(
+                        "Error: one or more of the requested receiver types does not have a corresponding spending key in this account.");
+                    break;
+                case UnifiedAddressGenerationError::DiversifierSpaceExhausted:
+                    strErr = tfm::format(
+                        "Error: ran out of diversifier indices. Generate a new account with z_getnewaccount");
+                    break;
+            }
+            throw JSONRPCError(RPC_WALLET_ERROR, strErr);
+        },
+    }, res);
+
+    UniValue receiver_types(UniValue::VARR);
+    for (const auto& receiverType : receiverTypes) {
+        switch (receiverType) {
+            case ReceiverType::P2PKH:
+                receiver_types.push_back("p2pkh");
+                break;
+            case ReceiverType::Sapling:
+                receiver_types.push_back("sapling");
+                break;
+            case ReceiverType::Orchard:
+                receiver_types.push_back("orchard");
+                break;
+            default:
+                // Unreachable
+                assert(false);
+        }
+    }
+    result.pushKV("receiver_types", receiver_types);
+
+    return result;
+}
+
+UniValue z_listaccounts(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() > 1)
+        throw runtime_error(
+            "z_listaccounts\n"
+            "\nReturns the list of accounts created with z_getnewaccount.\n"
+            "\nResult:\n"
+            "[\n"
+            "   {\n"
+            "     \"account\": \"uint\",           (uint) The account id\n"
+            "     \"addresses\": [\n"
+            "        {\n"
+            "           \"diversifier\":  \"uint\",        (string) A diversifier used in the account\n"
+            "           \"ua\":  \"address\",              (string) The unified address corresponding to the diversifier.\n"
+            "        }\n"
+            "     ]\n"
+            "   }\n"
+            "]\n"
+            "\nExamples:\n"
+            + HelpExampleCli("z_listaccounts", "")
+        );
+
+    LOCK(pwalletMain->cs_wallet);
+
+    KeyIO keyIO(Params());
+    UniValue ret(UniValue::VARR);
+
+    auto hdChain = pwalletMain->GetMnemonicHDChain();
+
+    for (const auto& [acctKey, ufvkId] : pwalletMain->mapUnifiedAccountKeys) {
+        UniValue account(UniValue::VOBJ);
+
+        account.pushKV("account", (int)acctKey.second);
+
+        // Get the receivers for this account.
+        auto ufvkMetadataPair = pwalletMain->mapUfvkAddressMetadata.find(ufvkId);
+        auto ufvkMetadata = ufvkMetadataPair->second;
+        auto diversifiersMap = ufvkMetadata.GetKnownReceiverSetsByDiversifierIndex();
+
+        auto ufvk = pwalletMain->GetUnifiedFullViewingKey(ufvkId).value();
+
+        UniValue addresses(UniValue::VARR);
+        for (const auto& [j, receiverTypes] : diversifiersMap) {
+            UniValue addrEntry(UniValue::VOBJ);
+
+            UniValue jVal;
+            jVal.setNumStr(ArbitraryIntStr(std::vector(j.begin(), j.end())));
+            addrEntry.pushKV("diversifier_index", jVal);
+
+            auto uaPair = std::get<std::pair<UnifiedAddress, diversifier_index_t>>(ufvk.Address(j, receiverTypes));
+            auto ua = uaPair.first;
+            addrEntry.pushKV("ua", keyIO.EncodePaymentAddress(ua));
+
+            addresses.push_back(addrEntry);
+        }
+        account.pushKV("addresses", addresses);
+
+        ret.push_back(account);
+    }
+
+    return ret;
+}
+
+UniValue z_listaddresses(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (!fEnableZListAddresses)
+        throw runtime_error(
+            "z_listaddresses is DEPRECATED and will be removed in a future release\n"
+            "\nUse listaddresses or restart with `-allowdeprecated=z_listaddresses`\n"
+            "if you require backward compatibility.\n"
+            "See https://zcash.github.io/zcash/user/deprecation.html for more information.");
+
+    if (fHelp || params.size() > 1)
+        throw runtime_error(
+            "z_listaddresses ( includeWatchonly )\n"
+            "\nDEPRECATED. Use `listaddresses` instead.\n"
+            "\nReturns the list of shielded addresses belonging to the wallet.\n"
+            "\nThis never returns Unified Addresses; see 'listaddresses' for them.\n"
+            "\nArguments:\n"
+            "1. includeWatchonly (bool, optional, default=false) Also include watchonly addresses (see 'z_importviewingkey')\n"
+            "\nResult:\n"
+            "[                     (json array of string)\n"
+            "  \"zaddr\"           (string) a zaddr belonging to the wallet\n"
+            "  ,...\n"
+            "]\n"
+            "\nExamples:\n"
+            + HelpExampleCli("z_listaddresses", "")
+            + HelpExampleRpc("z_listaddresses", "")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    bool fIncludeWatchonly = false;
+    if (params.size() > 0) {
+        fIncludeWatchonly = params[0].get_bool();
+    }
+
+    KeyIO keyIO(Params());
+    UniValue ret(UniValue::VARR);
+    {
+        std::set<libzcash::SproutPaymentAddress> addresses;
+        pwalletMain->GetSproutPaymentAddresses(addresses);
+        for (auto addr : addresses) {
+            if (fIncludeWatchonly || pwalletMain->HaveSproutSpendingKey(addr)) {
+                ret.push_back(keyIO.EncodePaymentAddress(addr));
+            }
+        }
+    }
+    {
+        std::set<libzcash::SaplingPaymentAddress> addresses;
+        pwalletMain->GetSaplingPaymentAddresses(addresses);
+        for (auto addr : addresses) {
+            // Don't show Sapling receivers that are part of an account in the wallet.
+            if (pwalletMain->FindUnifiedAddressByReceiver(addr).has_value()
+                    || pwalletMain->IsInternalRecipient(addr)) {
+                continue;
+            }
+            if (fIncludeWatchonly || pwalletMain->HaveSaplingSpendingKeyForAddress(addr)) {
+                ret.push_back(keyIO.EncodePaymentAddress(addr));
+            }
+        }
+    }
+    return ret;
+}
+
+UniValue z_listunifiedreceivers(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() < 1 || params.size() > 1)
+        throw runtime_error(
+            "z_listunifiedreceivers unified_address\n"
+            "\nReturns a record of the individual receivers contained within the provided UA,"
+            "\nkeyed by receiver type. The UA may not have receivers for some receiver types,"
+            "\nin which case those keys will be absent.\n"
+            "\nTransactions that send funds to any of the receivers returned by this RPC"
+            "\nmethod will be detected by the wallet as having been sent to the unified"
+            "\naddress.\n"
+            "\nArguments:\n"
+            "1. unified_address (string) The unified address\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"TRANSPARENT_TYPE\": \"address\", (string) The legacy transparent address (\"p2pkh\" or \"p2sh\", never both)\n"
+            "  \"sapling\": \"address\",          (string) The legacy Sapling address\n"
+            "  \"orchard\": \"address\"           (string) A single-receiver Unified Address containing the Orchard receiver\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("z_listunifiedreceivers", "")
+            + HelpExampleRpc("z_listunifiedreceivers", "")
+        );
+
+    KeyIO keyIO(Params());
+    auto decoded = keyIO.DecodePaymentAddress(params[0].get_str());
+    if (!decoded.has_value()) {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid address");
+    }
+    if (!std::holds_alternative<libzcash::UnifiedAddress>(decoded.value())) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Address is not a unified address");
+    }
+    auto ua = std::get<libzcash::UnifiedAddress>(decoded.value());
+
+    UniValue result(UniValue::VOBJ);
+    for (const auto& receiver : ua) {
+        std::visit(match {
+            [&](const libzcash::OrchardRawAddress& addr) {
+                // Create a single-receiver UA that just contains this Orchard receiver.
+                UnifiedAddress singleReceiver;
+                singleReceiver.AddReceiver(addr);
+                result.pushKV("orchard", keyIO.EncodePaymentAddress(singleReceiver));
+            },
+            [&](const libzcash::SaplingPaymentAddress& addr) {
+                result.pushKV("sapling", keyIO.EncodePaymentAddress(addr));
+            },
+            [&](const CScriptID& addr) {
+                result.pushKV("p2sh", keyIO.EncodePaymentAddress(addr));
+            },
+            [&](const CKeyID& addr) {
+                result.pushKV("p2pkh", keyIO.EncodePaymentAddress(addr));
+            },
+            [](auto rest) {},
+        }, receiver);
+    }
+    return result;
+}
+
+CAmount getBalanceTaddr(const std::optional<CTxDestination>& taddr, int minDepth=1, bool ignoreUnspendable=true) {
+    vector<COutput> vecOutputs;
+    CAmount balance = 0;
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    pwalletMain->AvailableCoins(vecOutputs, false, NULL, true);
+    for (const COutput& out : vecOutputs) {
+        if (out.nDepth < minDepth) {
+            continue;
+        }
+
+        if (ignoreUnspendable && !out.fSpendable) {
+            continue;
+        }
+
+        if (taddr.has_value()) {
+            CTxDestination address;
+            if (!ExtractDestination(out.tx->vout[out.i].scriptPubKey, address)) {
+                continue;
+            }
+
+            if (address != taddr.value()) {
+                continue;
+            }
+        }
+
+        CAmount nValue = out.tx->vout[out.i].nValue;
+        balance += nValue;
+    }
+    return balance;
+}
+
+CAmount getBalanceZaddr(std::optional<libzcash::PaymentAddress> address, int minDepth, int maxDepth, bool ignoreUnspendable) {
+    CAmount balance = 0;
+    std::vector<SproutNoteEntry> sproutEntries;
+    std::vector<SaplingNoteEntry> saplingEntries;
+    std::vector<OrchardNoteMetadata> orchardEntries;
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    std::optional<NoteFilter> noteFilter = std::nullopt;
+    if (address.has_value()) {
+        noteFilter = NoteFilter::ForPaymentAddresses(std::vector({address.value()}));
+    }
+
+    pwalletMain->GetFilteredNotes(sproutEntries, saplingEntries, orchardEntries, noteFilter, minDepth, maxDepth, true, ignoreUnspendable);
+    for (auto & entry : sproutEntries) {
+        balance += CAmount(entry.note.value());
+    }
+    for (auto & entry : saplingEntries) {
+        balance += CAmount(entry.note.value());
+    }
+    for (auto & entry : orchardEntries) {
+        balance += entry.GetNoteValue();
+    }
+    return balance;
+}
+
+struct txblock
+{
+    int height = 0;
+    int index = -1;
+    int64_t time = 0;
+
+    txblock(uint256 hash)
+    {
+        if (pwalletMain->mapWallet.count(hash)) {
+            const CWalletTx& wtx = pwalletMain->mapWallet[hash];
+            if (!wtx.hashBlock.IsNull())
+                height = mapBlockIndex[wtx.hashBlock]->nHeight;
+            index = wtx.nIndex;
+            time = wtx.GetTxTime();
+        }
+    }
+};
+
+UniValue z_listreceivedbyaddress(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size()==0 || params.size() >2)
+        throw runtime_error(
+            "z_listreceivedbyaddress \"address\" ( minconf )\n"
+            "\nReturn a list of amounts received by a zaddr belonging to the node's wallet.\n"
+            "\nArguments:\n"
+            "1. \"address\"      (string) The shielded address.\n"
+            "2. minconf        (numeric, optional, default=1) Only include transactions confirmed at least this many times.\n"
+            "\nResult (output indices for only one value pool will be present):\n"
+            "[\n"
+            "  {\n"
+            "    \"pool\": \"pool\"                (string) one of (\"transparent\", \"sprout\", \"sapling\", \"orchard\")\n"
+            "    \"txid\": \"txid\",               (string) the transaction id\n"
+            "    \"amount\": xxxxx,              (numeric) the amount of value in the note\n"
+            "    \"amountZat\" : xxxx            (numeric) The amount in " + MINOR_CURRENCY_UNIT + "\n"
+            "    \"memo\": xxxxx,                (string) hexadecimal string representation of memo field\n"
+            "    \"confirmations\" : n,          (numeric) the number of confirmations\n"
+            "    \"blockheight\": n,             (numeric) The block height containing the transaction\n"
+            "    \"blockindex\": n,              (numeric) The block index containing the transaction.\n"
+            "    \"blocktime\": xxx,             (numeric) The transaction time in seconds since epoch (midnight Jan 1 1970 GMT).\n"
+            "    \"jsindex\" (sprout) : n,       (numeric) the joinsplit index\n"
+            "    \"jsoutindex\" (sprout) : n,    (numeric) the output index of the joinsplit\n"
+            "    \"outindex\" (sapling, orchard) : n, (numeric) the Sapling output index, or the Orchard action index\n"
+            "    \"change\": true|false,         (boolean) true if the output was received to a change address\n"
+            "  },\n"
+            "...\n"
+            "]\n"
+            "\nExamples:\n"
+            + HelpExampleCli("z_listreceivedbyaddress", "\"ztfaW34Gj9FrnGUEf833ywDVL62NWXBM81u6EQnM6VR45eYnXhwztecW1SjxA7JrmAXKJhxhj3vDNEpVCQoSvVoSpmbhtjf\"")
+            + HelpExampleRpc("z_listreceivedbyaddress", "\"ztfaW34Gj9FrnGUEf833ywDVL62NWXBM81u6EQnM6VR45eYnXhwztecW1SjxA7JrmAXKJhxhj3vDNEpVCQoSvVoSpmbhtjf\"")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    int nMinDepth = 1;
+    if (params.size() > 1) {
+        nMinDepth = params[1].get_int();
+    }
+    if (nMinDepth < 0) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Minimum number of confirmations cannot be less than 0");
+    }
+    UniValue result(UniValue::VARR);
+
+    // Check that the from address is valid.
+    auto fromaddress = params[0].get_str();
+
+    KeyIO keyIO(Params());
+    auto decoded = keyIO.DecodePaymentAddress(fromaddress);
+    if (!decoded.has_value()) {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid zaddr.");
+    }
+
+    // A non-unified address argument that is a receiver within a
+    // unified address known to this wallet is not allowed.
+    if (std::visit(match {
+        [&](const CKeyID& addr) {
+            return pwalletMain->FindUnifiedAddressByReceiver(addr).has_value();
+         },
+        [&](const CScriptID& addr) {
+            return pwalletMain->FindUnifiedAddressByReceiver(addr).has_value();
+        },
+        [&](const libzcash::SaplingPaymentAddress& addr) {
+            return pwalletMain->FindUnifiedAddressByReceiver(addr).has_value();
+        },
+        [&](const libzcash::SproutPaymentAddress& addr) {
+            // A unified address can't contain a Sprout receiver.
+            return false;
+        },
+        [&](const libzcash::UnifiedAddress& addr) {
+            // We allow unified addresses themselves, which cannot recurse.
+            return false;
+        }
+    }, decoded.value())) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "The provided address is a bare receiver from a Unified Address in this wallet. Provide the full UA instead.");
+    }
+
+    // Visitor to support Sprout and Sapling addrs
+    if (!std::visit(PaymentAddressBelongsToWallet(pwalletMain), decoded.value())) {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "From address does not belong to this node, zaddr spending key or viewing key not found.");
+    }
+
+    std::vector<SproutNoteEntry> sproutEntries;
+    std::vector<SaplingNoteEntry> saplingEntries;
+    std::vector<OrchardNoteMetadata> orchardEntries;
+
+    auto noteFilter = NoteFilter::ForPaymentAddresses(std::vector({decoded.value()}));
+    pwalletMain->GetFilteredNotes(sproutEntries, saplingEntries, orchardEntries, noteFilter, nMinDepth, INT_MAX, false, false);
+
+    auto push_transparent_result = [&](const CTxDestination& dest) -> void {
+        const CScript scriptPubKey{GetScriptForDestination(dest)};
+        for (const auto& [_txid, wtx] : pwalletMain->mapWallet) {
+            if (!CheckFinalTx(wtx))
+                continue;
+
+            int nDepth = wtx.GetDepthInMainChain();
+            if (nDepth < nMinDepth) continue;
+            for (size_t i = 0; i < wtx.vout.size(); ++i) {
+                const CTxOut& txout{wtx.vout[i]};
+                if (txout.scriptPubKey == scriptPubKey) {
+                    UniValue obj(UniValue::VOBJ);
+                    auto txid{wtx.GetHash()};
+                    obj.pushKV("pool", "transparent");
+                    obj.pushKV("txid", txid.ToString());
+                    obj.pushKV("amount", ValueFromAmount(txout.nValue));
+                    obj.pushKV("amountZat", txout.nValue);
+                    obj.pushKV("outindex", int(i));
+                    obj.pushKV("confirmations", nDepth);
+                    obj.pushKV("change", pwalletMain->IsChange(txout));
+
+                    txblock BlockData(txid);
+                    obj.pushKV("blockheight", BlockData.height);
+                    obj.pushKV("blockindex", BlockData.index);
+                    obj.pushKV("blocktime", BlockData.time);
+
+                    result.push_back(obj);
+                }
+            }
+        }
+    };
+
+    auto push_sapling_result = [&](const libzcash::SaplingPaymentAddress& addr) -> void {
+        bool hasSpendingKey = pwalletMain->HaveSaplingSpendingKeyForAddress(addr);
+        std::set<std::pair<libzcash::SaplingPaymentAddress, uint256>> nullifierSet;
+        if (hasSpendingKey) {
+            nullifierSet = pwalletMain->GetSaplingNullifiers({addr});
+        }
+        for (const SaplingNoteEntry& entry : saplingEntries) {
+            UniValue obj(UniValue::VOBJ);
+            obj.pushKV("pool", "sapling");
+            obj.pushKV("txid", entry.op.hash.ToString());
+            obj.pushKV("amount", ValueFromAmount(CAmount(entry.note.value())));
+            obj.pushKV("amountZat", CAmount(entry.note.value()));
+            obj.pushKV("memo", HexStr(entry.memo));
+            obj.pushKV("outindex", (int)entry.op.n);
+            obj.pushKV("confirmations", entry.confirmations);
+
+            txblock BlockData(entry.op.hash);
+            obj.pushKV("blockheight", BlockData.height);
+            obj.pushKV("blockindex", BlockData.index);
+            obj.pushKV("blocktime", BlockData.time);
+
+            if (hasSpendingKey) {
+                obj.pushKV("change", pwalletMain->IsNoteSaplingChange(nullifierSet, entry.address, entry.op));
+            }
+            result.push_back(obj);
+        }
+    };
+
+    auto push_orchard_result = [&](const libzcash::OrchardRawAddress &addr) -> void {
+        bool hasSpendingKey = pwalletMain->HaveOrchardSpendingKeyForAddress(addr);
+
+        for (const OrchardNoteMetadata& entry: orchardEntries) {
+            auto op = entry.GetOutPoint();
+
+            UniValue obj(UniValue::VOBJ);
+            obj.pushKV("pool", "orchard");
+            obj.pushKV("txid", op.hash.ToString());
+            obj.pushKV("amount", ValueFromAmount(entry.GetNoteValue()));
+            obj.pushKV("amountZat", CAmount(entry.GetNoteValue()));
+            obj.pushKV("memo", HexStr(entry.GetMemo()));
+            obj.pushKV("outindex", (int)op.n);
+            obj.pushKV("confirmations", entry.GetConfirmations());
+
+            txblock BlockData(op.hash);
+            obj.pushKV("blockheight", BlockData.height);
+            obj.pushKV("blockindex", BlockData.index);
+            obj.pushKV("blocktime", BlockData.time);
+
+            if (hasSpendingKey) {
+                bool isInternal = pwalletMain->IsInternalRecipient(addr);
+                obj.pushKV("change", isInternal);
+            }
+
+            result.push_back(obj);
+        }
+    };
+
+    std::visit(match {
+        [&](const CKeyID& addr) { push_transparent_result(addr); },
+        [&](const CScriptID& addr) { push_transparent_result(addr); },
+        [&](const libzcash::SproutPaymentAddress& addr) {
+            bool hasSpendingKey = pwalletMain->HaveSproutSpendingKey(addr);
+            std::set<std::pair<libzcash::SproutPaymentAddress, uint256>> nullifierSet;
+            if (hasSpendingKey) {
+                nullifierSet = pwalletMain->GetSproutNullifiers({addr});
+            }
+            for (const SproutNoteEntry& entry : sproutEntries) {
+                UniValue obj(UniValue::VOBJ);
+                obj.pushKV("pool", "sprout");
+                obj.pushKV("txid", entry.jsop.hash.ToString());
+                obj.pushKV("amount", ValueFromAmount(CAmount(entry.note.value())));
+                obj.pushKV("amountZat", CAmount(entry.note.value()));
+                std::string data(entry.memo.begin(), entry.memo.end());
+                obj.pushKV("memo", HexStr(data));
+                obj.pushKV("jsindex", entry.jsop.js);
+                obj.pushKV("jsoutindex", entry.jsop.n);
+                obj.pushKV("confirmations", entry.confirmations);
+
+                txblock BlockData(entry.jsop.hash);
+                obj.pushKV("blockheight", BlockData.height);
+                obj.pushKV("blockindex", BlockData.index);
+                obj.pushKV("blocktime", BlockData.time);
+
+                if (hasSpendingKey) {
+                    obj.pushKV("change", pwalletMain->IsNoteSproutChange(nullifierSet, entry.address, entry.jsop));
+                }
+                result.push_back(obj);
+            }
+        },
+        [&](const libzcash::SaplingPaymentAddress& addr) {
+            push_sapling_result(addr);
+        },
+        [&](const libzcash::UnifiedAddress& addr) {
+            for (const auto& receiver : addr) {
+                std::visit(match {
+                    [&](const libzcash::SaplingPaymentAddress& addr) {
+                        push_sapling_result(addr);
+                    },
+                    [&](const CScriptID& addr) {
+                        CTxDestination dest = addr;
+                        push_transparent_result(dest);
+                    },
+                    [&](const CKeyID& addr) {
+                        CTxDestination dest = addr;
+                        push_transparent_result(dest);
+                    },
+                    [&](const libzcash::OrchardRawAddress& addr) {
+                        push_orchard_result(addr);
+                    },
+                    [&](const UnknownReceiver& unknown) {}
+
+                }, receiver);
+            }
+        }
+    }, decoded.value());
+    return result;
+}
+
+UniValue z_getbalance(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (!fEnableZGetBalance)
+        throw runtime_error(
+            "z_getbalance is DEPRECATED and will be removed in a future release\n\n"
+            "Use z_getbalanceforaccount, z_getbalanceforviewingkey, or getbalance (for\n"
+            "legacy transparent balance) instead, or restart with `-allowdeprecated=z_getbalance`\n"
+            "if you require backward compatibility.\n"
+            "See https://zcash.github.io/zcash/user/deprecation.html for more information.");
+
+    if (fHelp || params.size() == 0 || params.size() > 3)
+        throw runtime_error(
+            "z_getbalance \"address\" ( minconf inZat )\n"
+            "\nDEPRECATED; please use z_getbalanceforaccount, z_getbalanceforviewingkey,\n"
+            "or getbalance (for legacy transparent balance) instead.\n"
+            "\nReturns the balance of a taddr or zaddr belonging to the node's wallet.\n"
+            "\nCAUTION: If the wallet has only an incoming viewing key for this address, then spends cannot be"
+            "\ndetected, and so the returned balance may be larger than the actual balance."
+            "\nArguments:\n"
+            "1. \"address\"        (string) The selected address. It may be a transparent or shielded address.\n"
+            "2. minconf          (numeric, optional, default=1) Only include transactions confirmed at least this many times.\n"
+            "3. inZat            (bool, optional, default=false) Get the result amount in " + MINOR_CURRENCY_UNIT + " (as an integer).\n"
+            "\nResult:\n"
+            "amount              (numeric) The total amount in " + CURRENCY_UNIT + "(or " + MINOR_CURRENCY_UNIT + " if inZat is true) received at this address.\n"
+            "\nExamples:\n"
+            "\nThe total amount received by address \"myaddress\"\n"
+            + HelpExampleCli("z_getbalance", "\"myaddress\"") +
+            "\nThe total amount received by address \"myaddress\" at least 5 blocks confirmed\n"
+            + HelpExampleCli("z_getbalance", "\"myaddress\" 5") +
+            "\nAs a JSON RPC call\n"
+            + HelpExampleRpc("z_getbalance", "\"myaddress\", 5")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    int nMinDepth = 1;
+    if (params.size() > 1) {
+        nMinDepth = params[1].get_int();
+    }
+    if (nMinDepth < 0) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Minimum number of confirmations cannot be less than 0");
+    }
+
+    KeyIO keyIO(Params());
+    // Check that the from address is valid.
+    auto fromaddress = params[0].get_str();
+    auto pa = keyIO.DecodePaymentAddress(fromaddress);
+
+    if (!pa.has_value()) {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid from address, should be a taddr or zaddr.");
+    }
+    if (!std::visit(PaymentAddressBelongsToWallet(pwalletMain), pa.value())) {
+         throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "From address does not belong to this node.");
+    }
+
+    CAmount nBalance = 0;
+    std::visit(match {
+        [&](const CKeyID& addr) {
+            nBalance = getBalanceTaddr(addr, nMinDepth, false);
+        },
+        [&](const CScriptID& addr) {
+            nBalance = getBalanceTaddr(addr, nMinDepth, false);
+        },
+        [&](const libzcash::SproutPaymentAddress& addr) {
+            nBalance = getBalanceZaddr(addr, nMinDepth, INT_MAX, false);
+        },
+        [&](const libzcash::SaplingPaymentAddress& addr) {
+            nBalance = getBalanceZaddr(addr, nMinDepth, INT_MAX, false);
+        },
+        [&](const libzcash::UnifiedAddress& addr) {
+            auto selector = pwalletMain->ZTXOSelectorForAddress(addr, true, false);
+            if (!selector.has_value()) {
+                throw JSONRPCError(
+                    RPC_INVALID_ADDRESS_OR_KEY,
+                    "Unified address does not correspond to an account in the wallet");
+            }
+            auto spendableInputs = pwalletMain->FindSpendableInputs(selector.value(), true, nMinDepth);
+
+            for (const auto& t : spendableInputs.utxos) {
+                nBalance += t.Value();
+            }
+            for (const auto& t : spendableInputs.saplingNoteEntries) {
+                nBalance += t.note.value();
+            }
+            for (const auto& t : spendableInputs.orchardNoteMetadata) {
+                nBalance += t.GetNoteValue();
+            }
+        },
+    }, pa.value());
+
+    // inZat
+    if (params.size() > 2 && params[2].get_bool()) {
+        return nBalance;
+    }
+
+    return ValueFromAmount(nBalance);
+}
+
+UniValue z_getbalanceforviewingkey(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() < 1 || params.size() > 2)
+        throw runtime_error(
+            "z_getbalanceforviewingkey \"fvk\" ( minconf )\n"
+            "\nReturns the balance viewable by a full viewing key known to the node's wallet"
+            "\nfor each value pool. Sprout viewing keys may be used only if the wallet controls"
+            "\nthe corresponding spending key."
+            "\nArguments:\n"
+            "1. \"fvk\"        (string) The selected full viewing key.\n"
+            "2. minconf      (numeric, optional, default=1) Only include transactions confirmed at least this many times.\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"pools\": {\n"
+            "    \"transparent\": {\n"
+            "        \"valueZat\": amount   (numeric) The amount viewable by this FVK held in the transparent value pool\n"
+            "    \"},\n"
+            "    \"sprout\": {\n"
+            "        \"valueZat\": amount   (numeric) The amount viewable by this FVK held in the Sprout value pool\n"
+            "    \"},\n"
+            "    \"sapling\": {\n"
+            "        \"valueZat\": amount   (numeric) The amount viewable by this FVK held in the Sapling value pool\n"
+            "    \"},\n"
+            "    \"orchard\": {\n"
+            "        \"valueZat\": amount   (numeric) The amount viewable by this FVK held in the Orchard value pool\n"
+            "    \"}\n"
+            "  \"},\n"
+            "  \"minimum_confirmations\": n (numeric) The given minconf argument\n"
+            "}\n"
+            "Result amounts are in units of " + MINOR_CURRENCY_UNIT + ".\n"
+            "Pools for which the balance is zero are not shown.\n"
+            "\nExamples:\n"
+            "\nThe per-pool amount viewable by key \"myfvk\" with at least 1 block confirmed\n"
+            + HelpExampleCli("z_getbalanceforviewingkey", "\"myfvk\"") +
+            "\nThe per-pool amount viewable by key \"myfvk\" with at least 5 blocks confirmed\n"
+            + HelpExampleCli("z_getbalanceforviewingkey", "\"myfvk\" 5") +
+            "\nAs a JSON RPC call\n"
+            + HelpExampleRpc("z_getbalanceforviewingkey", "\"myfvk\", 5")
+        );
+
+    KeyIO keyIO(Params());
+    auto decoded = keyIO.DecodeViewingKey(params[0].get_str());
+    if (!decoded.has_value()) {
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid full viewing key");
+    }
+    auto fvk = decoded.value();
+
+    int minconf = 1;
+    if (params.size() > 1) {
+        minconf = params[1].get_int();
+        if (minconf < 0) {
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Minimum number of confirmations cannot be less than 0");
+        }
+    }
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    // Sprout viewing keys cannot provide accurate balance information because they
+    // cannot detect spends, so we require that the wallet control the spending key
+    // in the case that a Sprout viewing key is provided. Sapling and unified
+    // FVKs make it possible to correctly determine balance without having the
+    // spending key, so we permit that here.
+    bool requireSpendingKey = std::holds_alternative<libzcash::SproutViewingKey>(fvk);
+    auto selector = pwalletMain->ZTXOSelectorForViewingKey(fvk, requireSpendingKey);
+    if (!selector.has_value()) {
+        throw JSONRPCError(
+            RPC_INVALID_PARAMETER,
+            "Error: the wallet does not recognize the specified viewing key.");
+    }
+
+    auto spendableInputs = pwalletMain->FindSpendableInputs(selector.value(), true, minconf);
+
+    CAmount transparentBalance = 0;
+    CAmount sproutBalance = 0;
+    CAmount saplingBalance = 0;
+    CAmount orchardBalance = 0;
+    for (const auto& t : spendableInputs.utxos) {
+        transparentBalance += t.Value();
+    }
+    for (const auto& t : spendableInputs.sproutNoteEntries) {
+        sproutBalance += t.note.value();
+    }
+    for (const auto& t : spendableInputs.saplingNoteEntries) {
+        saplingBalance += t.note.value();
+    }
+    for (const auto& t : spendableInputs.orchardNoteMetadata) {
+        orchardBalance += t.GetNoteValue();
+    }
+
+    UniValue pools(UniValue::VOBJ);
+    auto renderBalance = [&](std::string poolName, CAmount balance) {
+        if (balance > 0) {
+            UniValue pool(UniValue::VOBJ);
+            pool.pushKV("valueZat", balance);
+            pools.pushKV(poolName, pool);
+        }
+    };
+    renderBalance("transparent", transparentBalance);
+    renderBalance("sprout", sproutBalance);
+    renderBalance("sapling", saplingBalance);
+    renderBalance("orchard", orchardBalance);
+
+    UniValue result(UniValue::VOBJ);
+    result.pushKV("pools", pools);
+    result.pushKV("minimum_confirmations", minconf);
+
+    return result;
+}
+
+UniValue z_getbalanceforaccount(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() < 1 || params.size() > 2)
+        throw runtime_error(
+            "z_getbalanceforaccount account ( minconf )\n"
+            "\nReturns the account's spendable balance for each value pool (\"transparent\", \"sapling\", and \"orchard\")."
+            "\nArguments:\n"
+            "1. account      (numeric) The account number.\n"
+            "2. minconf      (numeric, optional, default=1) Only include transactions confirmed at least this many times.\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"pools\": {\n"
+            "    \"transparent\": {\n"
+            "        \"valueZat\": amount   (numeric) The amount held by this account in the transparent value pool\n"
+            "    \"},\n"
+            "    \"sapling\": {\n"
+            "        \"valueZat\": amount   (numeric) The amount held by this account in the Sapling value pool\n"
+            "    \"},\n"
+            "    \"orchard\": {\n"
+            "        \"valueZat\": amount   (numeric) The amount held by this account in the Orchard value pool\n"
+            "    \"}\n"
+            "  \"},\n"
+            "  \"minimum_confirmations\": n (numeric) The given minconf argument\n"
+            "}\n"
+            "Result amounts are in units of " + MINOR_CURRENCY_UNIT + ".\n"
+            "Pools for which the balance is zero are not shown.\n"
+            "\nExamples:\n"
+            "\nThe per-pool amount received by account 4 with at least 1 block confirmed\n"
+            + HelpExampleCli("z_getbalanceforaccount", "4") +
+            "\nThe per-pool amount received by account 4 with at least 5 block confirmations\n"
+            + HelpExampleCli("z_getbalanceforaccount", "4 5") +
+            "\nAs a JSON RPC call\n"
+            + HelpExampleRpc("z_getbalanceforaccount", "4 5")
+        );
+
+    int64_t accountInt = params[0].get_int64();
+    if (accountInt < 0 || accountInt >= ZCASH_LEGACY_ACCOUNT) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid account number, must be 0 <= account <= (2^31)-2.");
+    }
+    libzcash::AccountId account = accountInt;
+
+    int minconf = 1;
+    if (params.size() > 1) {
+        minconf = params[1].get_int();
+        if (minconf < 0) {
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Minimum number of confirmations cannot be less than 0");
+        }
+    }
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    // Get the receivers for this account.
+    auto selector = pwalletMain->ZTXOSelectorForAccount(account, false);
+    if (!selector.has_value()) {
+        throw JSONRPCError(
+            RPC_INVALID_PARAMETER,
+            tfm::format("Error: account %d has not been generated by z_getnewaccount.", account));
+    }
+
+    auto spendableInputs = pwalletMain->FindSpendableInputs(selector.value(), true, minconf);
+    // Accounts never contain Sprout notes.
+    assert(spendableInputs.sproutNoteEntries.empty());
+
+    CAmount transparentBalance = 0;
+    CAmount saplingBalance = 0;
+    CAmount orchardBalance = 0;
+    for (const auto& t : spendableInputs.utxos) {
+        transparentBalance += t.Value();
+    }
+    for (const auto& t : spendableInputs.saplingNoteEntries) {
+        saplingBalance += t.note.value();
+    }
+    for (const auto& t : spendableInputs.orchardNoteMetadata) {
+        orchardBalance += t.GetNoteValue();
+    }
+
+    UniValue pools(UniValue::VOBJ);
+    auto renderBalance = [&](std::string poolName, CAmount balance) {
+        if (balance > 0) {
+            UniValue pool(UniValue::VOBJ);
+            pool.pushKV("valueZat", balance);
+            pools.pushKV(poolName, pool);
+        }
+    };
+    renderBalance("transparent", transparentBalance);
+    renderBalance("sapling", saplingBalance);
+    renderBalance("orchard", orchardBalance);
+
+    UniValue result(UniValue::VOBJ);
+    result.pushKV("pools", pools);
+    result.pushKV("minimum_confirmations", minconf);
+
+    return result;
+}
+
+UniValue z_gettotalbalance(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (!fEnableZGetTotalBalance)
+        throw runtime_error(
+            "z_gettotalbalance is DEPRECATED and will be removed in a future release\n\n"
+            "Use z_getbalanceforaccount, or getbalance (for legacy transparent balance) instead, or\n"
+            "restart with `-allowdeprecated=z_gettotalbalance if you require backward compatibility.\n"
+            "See https://zcash.github.io/zcash/user/deprecation.html for more information.");
+
+    if (fHelp || params.size() > 2)
+        throw runtime_error(
+            "z_gettotalbalance ( minconf includeWatchonly )\n"
+            "\nDEPRECATED. Please use z_getbalanceforaccount or getbalance (for legacy transparent balance) instead.\n"
+            "\nReturn the total value of funds stored in the node's wallet.\n"
+            "\nCAUTION: If the wallet contains any addresses for which it only has incoming viewing keys,"
+            "\nthe returned private balance may be larger than the actual balance, because spends cannot"
+            "\nbe detected with incoming viewing keys.\n"
+            "\nArguments:\n"
+            "1. minconf          (numeric, optional, default=1) Only include private and transparent transactions confirmed at least this many times.\n"
+            "2. includeWatchonly (bool, optional, default=false) Also include balance in watchonly addresses (see 'importaddress' and 'z_importviewingkey')\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"transparent\": xxxxx,     (numeric) the total balance of transparent funds\n"
+            "  \"private\": xxxxx,         (numeric) the total balance of shielded funds (in all shielded addresses)\n"
+            "  \"total\": xxxxx,           (numeric) the total balance of both transparent and shielded funds\n"
+            "}\n"
+            "\nExamples:\n"
+            "\nThe total amount in the wallet\n"
+            + HelpExampleCli("z_gettotalbalance", "") +
+            "\nThe total amount in the wallet at least 5 blocks confirmed\n"
+            + HelpExampleCli("z_gettotalbalance", "5") +
+            "\nAs a JSON RPC call\n"
+            + HelpExampleRpc("z_gettotalbalance", "5")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    int nMinDepth = 1;
+    if (params.size() > 0) {
+        nMinDepth = params[0].get_int();
+    }
+    if (nMinDepth < 0) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Minimum number of confirmations cannot be less than 0");
+    }
+
+    bool fIncludeWatchonly = false;
+    if (params.size() > 1) {
+        fIncludeWatchonly = params[1].get_bool();
+    }
+
+    // getbalance and "getbalance * 1 true" should return the same number
+    // but they don't because wtx.GetAmounts() does not handle tx where there are no outputs
+    // pwalletMain->GetBalance() does not accept min depth parameter
+    // so we use our own method to get balance of utxos.
+    CAmount nBalance = getBalanceTaddr(std::nullopt, nMinDepth, !fIncludeWatchonly);
+    CAmount nPrivateBalance = getBalanceZaddr(std::nullopt, nMinDepth, INT_MAX, !fIncludeWatchonly);
+    CAmount nTotalBalance = nBalance + nPrivateBalance;
+    UniValue result(UniValue::VOBJ);
+    result.pushKV("transparent", FormatMoney(nBalance));
+    result.pushKV("private", FormatMoney(nPrivateBalance));
+    result.pushKV("total", FormatMoney(nTotalBalance));
+    return result;
+}
+
+UniValue z_viewtransaction(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "z_viewtransaction \"txid\"\n"
+            "\nGet detailed shielded information about in-wallet transaction <txid>\n"
+            "\nArguments:\n"
+            "1. \"txid\"    (string, required) The transaction id\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"txid\" : \"transactionid\",   (string) The transaction id\n"
+            "  \"spends\" : [\n"
+            "    {\n"
+            "      \"pool\" : \"sprout|sapling|orchard\",      (string) The shielded value pool\n"
+            "      \"type\" : \"sprout|sapling|orchard\",      (string) The shielded value pool (DEPRECATED legacy attribute)"
+            "      \"js\" : n,                       (numeric, sprout) the index of the JSDescription within vJoinSplit\n"
+            "      \"jsSpend\" : n,                  (numeric, sprout) the index of the spend within the JSDescription\n"
+            "      \"spend\" : n,                    (numeric, sapling) the index of the spend within vShieldedSpend\n"
+            "      \"action\" : n,                   (numeric, orchard) the index of the action within orchard bundle\n"
+            "      \"txidPrev\" : \"transactionid\",   (string) The id for the transaction this note was created in\n"
+            "      \"jsPrev\" : n,                   (numeric, sprout) the index of the JSDescription within vJoinSplit\n"
+            "      \"jsOutputPrev\" : n,             (numeric, sprout) the index of the output within the JSDescription\n"
+            "      \"outputPrev\" : n,               (numeric, sapling) the index of the output within the vShieldedOutput\n"
+            "      \"actionPrev\" : n,               (numeric, orchard) the index of the action within the orchard bundle\n"
+            "      \"address\" : \"zcashaddress\",     (string) The Zcash address involved in the transaction\n"
+            "      \"value\" : x.xxx                 (numeric) The amount in " + CURRENCY_UNIT + "\n"
+            "      \"valueZat\" : xxxx               (numeric) The amount in zatoshis\n"
+            "    }\n"
+            "    ,...\n"
+            "  ],\n"
+            "  \"outputs\" : [\n"
+            "    {\n"
+            "      \"pool\" : \"sprout|sapling|orchard\",      (string) The shielded value pool\n"
+            "      \"type\" : \"sprout|sapling|orchard\",      (string) The shielded value pool (DEPRECATED legacy attribute)\n"
+            "      \"js\" : n,                       (numeric, sprout) the index of the JSDescription within vJoinSplit\n"
+            "      \"jsOutput\" : n,                 (numeric, sprout) the index of the output within the JSDescription\n"
+            "      \"output\" : n,                   (numeric, sapling) the index of the output within the vShieldedOutput\n"
+            "      \"action\" : n,                   (numeric, orchard) the index of the action within the orchard bundle\n"
+            "      \"address\" : \"zcashaddress\",     (string) The Zcash address involved in the transaction. Not included for change outputs.\n"
+            "      \"outgoing\" : true|false         (boolean) True if the output is not for an address in the wallet\n"
+            "      \"walletInternal\" : true|false   (boolean) True if this is a change output.\n"
+            "      \"value\" : x.xxx                 (numeric) The amount in " + CURRENCY_UNIT + "\n"
+            "      \"valueZat\" : xxxx               (numeric) The amount in zatoshis\n"
+            "      \"memo\" : \"hexmemo\",             (string) hexadecimal string representation of the memo field\n"
+            "      \"memoStr\" : \"memo\",             (string) Only returned if memo contains valid UTF-8 text.\n"
+            "    }\n"
+            "    ,...\n"
+            "  ],\n"
+            "}\n"
+
+            "\nExamples:\n"
+            + HelpExampleCli("z_viewtransaction", "\"1075db55d416d3ca199f55b6084e2115b9345e16c5cf302fc80e9d5fbf5d48d\"")
+            + HelpExampleRpc("z_viewtransaction", "\"1075db55d416d3ca199f55b6084e2115b9345e16c5cf302fc80e9d5fbf5d48d\"")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    uint256 txid;
+    txid.SetHex(params[0].get_str());
+
+    UniValue entry(UniValue::VOBJ);
+    if (!pwalletMain->mapWallet.count(txid))
+        throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid or non-wallet transaction id");
+    const CWalletTx& wtx = pwalletMain->mapWallet[txid];
+
+    entry.pushKV("txid", txid.GetHex());
+
+    UniValue spends(UniValue::VARR);
+    UniValue outputs(UniValue::VARR);
+
+    auto addMemo = [](UniValue &entry, std::array<unsigned char, ZC_MEMO_SIZE> &memo) {
+        entry.pushKV("memo", HexStr(memo));
+
+        // If the leading byte is 0xF4 or lower, the memo field should be interpreted as a
+        // UTF-8-encoded text string.
+        if (memo[0] <= 0xf4) {
+            // Trim off trailing zeroes
+            auto end = std::find_if(
+                memo.rbegin(),
+                memo.rend(),
+                [](unsigned char v) { return v != 0; });
+            std::string memoStr(memo.begin(), end.base());
+            if (utf8::is_valid(memoStr)) {
+                entry.pushKV("memoStr", memoStr);
+            }
+        }
+    };
+
+    KeyIO keyIO(Params());
+    // Sprout spends
+    for (size_t i = 0; i < wtx.vJoinSplit.size(); ++i) {
+        for (size_t j = 0; j < wtx.vJoinSplit[i].nullifiers.size(); ++j) {
+            auto nullifier = wtx.vJoinSplit[i].nullifiers[j];
+
+            // Fetch the note that is being spent, if ours
+            auto res = pwalletMain->mapSproutNullifiersToNotes.find(nullifier);
+            if (res == pwalletMain->mapSproutNullifiersToNotes.end()) {
+                continue;
+            }
+            auto jsop = res->second;
+            auto wtxPrev = pwalletMain->mapWallet.at(jsop.hash);
+
+            auto decrypted = wtxPrev.DecryptSproutNote(jsop);
+            auto notePt = decrypted.first;
+            auto pa = decrypted.second;
+
+            UniValue entry(UniValue::VOBJ);
+            entry.pushKV("pool", ADDR_TYPE_SPROUT);
+            if (fEnableAddrTypeField) {
+                entry.pushKV("type", ADDR_TYPE_SPROUT); //deprecated
+            }
+            entry.pushKV("js", (int)i);
+            entry.pushKV("jsSpend", (int)j);
+            entry.pushKV("txidPrev", jsop.hash.GetHex());
+            entry.pushKV("jsPrev", (int)jsop.js);
+            entry.pushKV("jsOutputPrev", (int)jsop.n);
+            entry.pushKV("address", keyIO.EncodePaymentAddress(pa));
+            entry.pushKV("value", ValueFromAmount(notePt.value()));
+            entry.pushKV("valueZat", notePt.value());
+            spends.push_back(entry);
+        }
+    }
+
+    // Sprout outputs
+    for (auto & pair : wtx.mapSproutNoteData) {
+        JSOutPoint jsop = pair.first;
+
+        auto decrypted = wtx.DecryptSproutNote(jsop);
+        auto notePt = decrypted.first;
+        auto pa = decrypted.second;
+        auto memo = notePt.memo();
+
+        UniValue entry(UniValue::VOBJ);
+        entry.pushKV("pool", ADDR_TYPE_SPROUT);
+        if (fEnableAddrTypeField) {
+            entry.pushKV("type", ADDR_TYPE_SPROUT); //deprecated
+        }
+        entry.pushKV("js", (int)jsop.js);
+        entry.pushKV("jsOutput", (int)jsop.n);
+        entry.pushKV("address", keyIO.EncodePaymentAddress(pa));
+        entry.pushKV("value", ValueFromAmount(notePt.value()));
+        entry.pushKV("valueZat", notePt.value());
+        addMemo(entry, memo);
+        outputs.push_back(entry);
+    }
+
+    // Collect OutgoingViewingKeys for recovering output information
+    std::set<uint256> ovks;
+    {
+        // Generate the old, pre-UA accounts OVK for recovering t->z outputs.
+        HDSeed seed = pwalletMain->GetHDSeedForRPC();
+        ovks.insert(ovkForShieldingFromTaddr(seed));
+
+        // Generate the OVKs for shielding from the legacy UA account
+        auto legacyKey = pwalletMain->GetLegacyAccountKey().ToAccountPubKey();
+        auto legacyAcctOVKs = legacyKey.GetOVKsForShielding();
+        ovks.insert(legacyAcctOVKs.first);
+        ovks.insert(legacyAcctOVKs.second);
+
+        // Generate the OVKs for shielding for all unified key components
+        for (const auto& [_, ufvkid] : pwalletMain->mapUnifiedAccountKeys) {
+            auto ufvk = pwalletMain->GetUnifiedFullViewingKey(ufvkid);
+            if (ufvk.has_value()) {
+                auto tkey = ufvk.value().GetTransparentKey();
+                if (tkey.has_value()) {
+                    auto tovks = tkey.value().GetOVKsForShielding();
+                    ovks.insert(tovks.first);
+                    ovks.insert(tovks.second);
+                }
+                auto skey = ufvk.value().GetSaplingKey();
+                if (skey.has_value()) {
+                    auto sovks = skey.value().GetOVKs();
+                    ovks.insert(sovks.first);
+                    ovks.insert(sovks.second);
+                }
+                auto okey = ufvk.value().GetOrchardKey();
+                if (okey.has_value()) {
+                    ovks.insert(okey.value().ToExternalOutgoingViewingKey());
+                    ovks.insert(okey.value().ToInternalOutgoingViewingKey());
+                }
+            }
+        }
+    }
+
+    // Sapling spends
+    for (size_t i = 0; i < wtx.vShieldedSpend.size(); ++i) {
+        auto spend = wtx.vShieldedSpend[i];
+
+        // Fetch the note that is being spent
+        auto res = pwalletMain->mapSaplingNullifiersToNotes.find(spend.nullifier);
+        if (res == pwalletMain->mapSaplingNullifiersToNotes.end()) {
+            continue;
+        }
+        auto op = res->second;
+        auto wtxPrev = pwalletMain->mapWallet.at(op.hash);
+
+        // We don't need to check the leadbyte here: if wtx exists in
+        // the wallet, it must have been successfully decrypted. This
+        // means the plaintext leadbyte was valid at the block height
+        // where the note was received.
+        // https://zips.z.cash/zip-0212#changes-to-the-process-of-receiving-sapling-notes
+        auto decrypted = wtxPrev.DecryptSaplingNoteWithoutLeadByteCheck(op).value();
+        auto notePt = decrypted.first;
+        auto pa = decrypted.second;
+
+        // Store the OutgoingViewingKey for recovering outputs
+        libzcash::SaplingExtendedFullViewingKey extfvk;
+        assert(pwalletMain->GetSaplingFullViewingKey(wtxPrev.mapSaplingNoteData.at(op).ivk, extfvk));
+        ovks.insert(extfvk.fvk.ovk);
+
+        // Show the address that was cached at transaction construction as the
+        // recipient.
+        std::optional<std::string> addrStr;
+        auto addr = pwalletMain->GetPaymentAddressForRecipient(txid, pa);
+        if (addr.second != RecipientType::WalletInternalAddress) {
+            addrStr = keyIO.EncodePaymentAddress(addr.first);
+        }
+
+        UniValue entry(UniValue::VOBJ);
+        entry.pushKV("pool", ADDR_TYPE_SAPLING);
+        if (fEnableAddrTypeField) {
+            entry.pushKV("type", ADDR_TYPE_SAPLING); //deprecated
+        }
+        entry.pushKV("spend", (int)i);
+        entry.pushKV("txidPrev", op.hash.GetHex());
+        entry.pushKV("outputPrev", (int)op.n);
+        if (addrStr.has_value()) {
+            entry.pushKV("address", addrStr.value());
+        }
+        entry.pushKV("value", ValueFromAmount(notePt.value()));
+        entry.pushKV("valueZat", notePt.value());
+        spends.push_back(entry);
+    }
+
+    // Sapling outputs
+    for (uint32_t i = 0; i < wtx.vShieldedOutput.size(); ++i) {
+        auto op = SaplingOutPoint(txid, i);
+
+        SaplingNotePlaintext notePt;
+        SaplingPaymentAddress pa;
+        bool isOutgoing;
+
+        // We don't need to check the leadbyte here: if wtx exists in
+        // the wallet, it must have been successfully decrypted. This
+        // means the plaintext leadbyte was valid at the block height
+        // where the note was received.
+        // https://zips.z.cash/zip-0212#changes-to-the-process-of-receiving-sapling-notes
+        auto decrypted = wtx.DecryptSaplingNoteWithoutLeadByteCheck(op);
+        if (decrypted) {
+            notePt = decrypted->first;
+            pa = decrypted->second;
+            isOutgoing = false;
+        } else {
+            // Try recovering the output
+            auto recovered = wtx.RecoverSaplingNoteWithoutLeadByteCheck(op, ovks);
+            if (recovered) {
+                notePt = recovered->first;
+                pa = recovered->second;
+                isOutgoing = true;
+            } else {
+                // Unreadable
+                continue;
+            }
+        }
+        auto memo = notePt.memo();
+
+        // Show the address that was cached at transaction construction as the
+        // recipient.
+        std::optional<std::string> addrStr;
+        auto addr = pwalletMain->GetPaymentAddressForRecipient(txid, pa);
+        if (addr.second != RecipientType::WalletInternalAddress) {
+            addrStr = keyIO.EncodePaymentAddress(addr.first);
+        }
+
+        UniValue entry(UniValue::VOBJ);
+        entry.pushKV("pool", ADDR_TYPE_SAPLING);
+        if (fEnableAddrTypeField) {
+            entry.pushKV("type", ADDR_TYPE_SAPLING); //deprecated
+        }
+        entry.pushKV("output", (int)op.n);
+        entry.pushKV("outgoing", isOutgoing);
+        entry.pushKV("walletInternal", addr.second == RecipientType::WalletInternalAddress);
+        if (addrStr.has_value()) {
+            entry.pushKV("address", addrStr.value());
+        }
+        entry.pushKV("value", ValueFromAmount(notePt.value()));
+        entry.pushKV("valueZat", notePt.value());
+        addMemo(entry, memo);
+        outputs.push_back(entry);
+    }
+
+    std::vector<uint256> ovksVector(ovks.begin(), ovks.end());
+    OrchardActions orchardActions = wtx.RecoverOrchardActions(ovksVector);
+
+    // Orchard spends
+    for (auto & pair  : orchardActions.GetSpends()) {
+        auto actionIdx = pair.first;
+        OrchardActionSpend orchardActionSpend = pair.second;
+        auto outpoint = orchardActionSpend.GetOutPoint();
+        auto receivedAt = orchardActionSpend.GetReceivedAt();
+        auto noteValue = orchardActionSpend.GetNoteValue();
+
+        std::optional<std::string> addrStr;
+        auto addr = pwalletMain->GetPaymentAddressForRecipient(txid, receivedAt);
+        if (addr.second != RecipientType::WalletInternalAddress) {
+            addrStr = keyIO.EncodePaymentAddress(addr.first);
+        }
+
+        UniValue entry(UniValue::VOBJ);
+        entry.pushKV("pool", ADDR_TYPE_ORCHARD);
+        if (fEnableAddrTypeField) {
+            entry.pushKV("type", ADDR_TYPE_ORCHARD); //deprecated
+        }
+        entry.pushKV("action", (int) actionIdx);
+        entry.pushKV("txidPrev", outpoint.hash.GetHex());
+        entry.pushKV("actionPrev", (int) outpoint.n);
+        if (addrStr.has_value()) {
+            entry.pushKV("address", addrStr.value());
+        }
+        entry.pushKV("value", ValueFromAmount(noteValue));
+        entry.pushKV("valueZat", noteValue);
+        spends.push_back(entry);
+    }
+
+    // Orchard outputs
+    for (const auto& [actionIdx, orchardActionOutput]  : orchardActions.GetOutputs()) {
+        auto noteValue = orchardActionOutput.GetNoteValue();
+        auto recipient = orchardActionOutput.GetRecipient();
+        auto memo = orchardActionOutput.GetMemo();
+
+        // Show the address that was cached at transaction construction as the
+        // recipient.
+        std::optional<std::string> addrStr;
+        auto addr = pwalletMain->GetPaymentAddressForRecipient(txid, recipient);
+        if (addr.second != RecipientType::WalletInternalAddress) {
+            addrStr = keyIO.EncodePaymentAddress(addr.first);
+        }
+
+        UniValue entry(UniValue::VOBJ);
+        entry.pushKV("pool", ADDR_TYPE_ORCHARD);
+        if (fEnableAddrTypeField) {
+            entry.pushKV("type", ADDR_TYPE_ORCHARD); //deprecated
+        }
+        entry.pushKV("action", (int) actionIdx);
+        entry.pushKV("outgoing", orchardActionOutput.IsOutgoing());
+        entry.pushKV("walletInternal", addr.second == RecipientType::WalletInternalAddress);
+        if (addrStr.has_value()) {
+            entry.pushKV("address", addrStr.value());
+        }
+        entry.pushKV("value", ValueFromAmount(noteValue));
+        entry.pushKV("valueZat", noteValue);
+        addMemo(entry, memo);
+        outputs.push_back(entry);
+    }
+
+    entry.pushKV("spends", spends);
+    entry.pushKV("outputs", outputs);
+
+    return entry;
+}
+
+UniValue z_getoperationresult(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() > 1)
+        throw runtime_error(
+            "z_getoperationresult ([\"operationid\", ... ]) \n"
+            "\nRetrieve the result and status of an operation which has finished, and then remove the operation from memory."
+            + HelpRequiringPassphrase() + "\n"
+            "\nArguments:\n"
+            "1. \"operationid\"         (array, optional) A list of operation ids we are interested in.  If not provided, examine all operations known to the node.\n"
+            "\nResult:\n"
+            "\"    [object, ...]\"      (array) A list of JSON objects\n"
+            "\nExamples:\n"
+            + HelpExampleCli("z_getoperationresult", "'[\"operationid\", ... ]'")
+            + HelpExampleRpc("z_getoperationresult", "'[\"operationid\", ... ]'")
+        );
+
+    // This call will remove finished operations
+    return z_getoperationstatus_IMPL(params, true);
+}
+
+UniValue z_getoperationstatus(const UniValue& params, bool fHelp)
+{
+   if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() > 1)
+        throw runtime_error(
+            "z_getoperationstatus ([\"operationid\", ... ]) \n"
+            "\nGet operation status and any associated result or error data.  The operation will remain in memory."
+            + HelpRequiringPassphrase() + "\n"
+            "\nArguments:\n"
+            "1. \"operationid\"         (array, optional) A list of operation ids we are interested in.  If not provided, examine all operations known to the node.\n"
+            "\nResult:\n"
+            "\"    [object, ...]\"      (array) A list of JSON objects\n"
+            "\nExamples:\n"
+            + HelpExampleCli("z_getoperationstatus", "'[\"operationid\", ... ]'")
+            + HelpExampleRpc("z_getoperationstatus", "'[\"operationid\", ... ]'")
+        );
+
+   // This call is idempotent so we don't want to remove finished operations
+   return z_getoperationstatus_IMPL(params, false);
+}
+
+UniValue z_getoperationstatus_IMPL(const UniValue& params, bool fRemoveFinishedOperations=false)
+{
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    std::set<AsyncRPCOperationId> filter;
+    if (params.size()==1) {
+        UniValue ids = params[0].get_array();
+        for (const UniValue & v : ids.getValues()) {
+            filter.insert(v.get_str());
+        }
+    }
+    bool useFilter = (filter.size()>0);
+
+    UniValue ret(UniValue::VARR);
+    std::shared_ptr<AsyncRPCQueue> q = getAsyncRPCQueue();
+    std::vector<AsyncRPCOperationId> ids = q->getAllOperationIds();
+
+    for (auto id : ids) {
+        if (useFilter && !filter.count(id))
+            continue;
+
+        std::shared_ptr<AsyncRPCOperation> operation = q->getOperationForId(id);
+        if (!operation) {
+            continue;
+            // It's possible that the operation was removed from the internal queue and map during this loop
+            // throw JSONRPCError(RPC_INVALID_PARAMETER, "No operation exists for that id.");
+        }
+
+        UniValue obj = operation->getStatus();
+        std::string s = obj["status"].get_str();
+        if (fRemoveFinishedOperations) {
+            // Caller is only interested in retrieving finished results
+            if ("success"==s || "failed"==s || "cancelled"==s) {
+                ret.push_back(obj);
+                q->popOperationForId(id);
+            }
+        } else {
+            ret.push_back(obj);
+        }
+    }
+
+    std::vector<UniValue> arrTmp = ret.getValues();
+
+    // sort results chronologically by creation_time
+    std::sort(arrTmp.begin(), arrTmp.end(), [](UniValue a, UniValue b) -> bool {
+        const int64_t t1 = find_value(a.get_obj(), "creation_time").get_int64();
+        const int64_t t2 = find_value(b.get_obj(), "creation_time").get_int64();
+        return t1 < t2;
+    });
+
+    ret.clear();
+    ret.setArray();
+    ret.push_backV(arrTmp);
+
+    return ret;
+}
+
+// JSDescription size depends on the transaction version
+#define V3_JS_DESCRIPTION_SIZE    (GetSerializeSize(JSDescription(), SER_NETWORK, (OVERWINTER_TX_VERSION | (1 << 31))))
+// Here we define the maximum number of zaddr outputs that can be included in a transaction.
+// If input notes are small, we might actually require more than one joinsplit per zaddr output.
+// For now though, we assume we use one joinsplit per zaddr output (and the second output note is change).
+// We reduce the result by 1 to ensure there is room for non-joinsplit CTransaction data.
+#define Z_SENDMANY_MAX_ZADDR_OUTPUTS_BEFORE_SAPLING    ((MAX_TX_SIZE_BEFORE_SAPLING / V3_JS_DESCRIPTION_SIZE) - 1)
+
+// transaction.h comment: spending taddr output requires CTxIn >= 148 bytes and typical taddr txout is 34 bytes
+#define CTXIN_SPEND_DUST_SIZE   148
+#define CTXOUT_REGULAR_SIZE     34
+
+size_t EstimateTxSize(
+        const ZTXOSelector& ztxoSelector,
+        const std::vector<SendManyRecipient>& recipients,
+        int nextBlockHeight) {
+    CMutableTransaction mtx;
+    mtx.fOverwintered = true;
+    mtx.nConsensusBranchId = CurrentEpochBranchId(nextBlockHeight, Params().GetConsensus());
+
+    bool fromSprout = ztxoSelector.SelectsSprout();
+    bool fromTaddr = ztxoSelector.SelectsTransparent();
+
+    // As a sanity check, estimate and verify that the size of the transaction will be valid.
+    // Depending on the input notes, the actual tx size may turn out to be larger and perhaps invalid.
+    size_t txsize = 0;
+    size_t taddrRecipientCount = 0;
+    size_t orchardRecipientCount = 0;
+    for (const SendManyRecipient& recipient : recipients) {
+        std::visit(match {
+            [&](const CKeyID&) {
+                taddrRecipientCount += 1;
+            },
+            [&](const CScriptID&) {
+                taddrRecipientCount += 1;
+            },
+            [&](const libzcash::SaplingPaymentAddress& addr) {
+                mtx.vShieldedOutput.push_back(OutputDescription());
+            },
+            [&](const libzcash::SproutPaymentAddress& addr) {
+                JSDescription jsdesc;
+                jsdesc.proof = GrothProof();
+                mtx.vJoinSplit.push_back(jsdesc);
+            },
+            [&](const libzcash::OrchardRawAddress& addr) {
+                if (fromSprout) {
+                    throw JSONRPCError(
+                        RPC_INVALID_PARAMETER,
+                        "Sending funds from a Sprout address to a Unified Address is not supported by z_sendmany");
+                }
+                orchardRecipientCount += 1;
+            }
+        }, recipient.address);
+    }
+
+    bool nu5Active = Params().GetConsensus().NetworkUpgradeActive(nextBlockHeight, Consensus::UPGRADE_NU5);
+
+    if (fromSprout || !nu5Active) {
+        mtx.nVersionGroupId = SAPLING_VERSION_GROUP_ID;
+        mtx.nVersion = SAPLING_TX_VERSION;
+    } else {
+        mtx.nVersionGroupId = ZIP225_VERSION_GROUP_ID;
+        mtx.nVersion = ZIP225_TX_VERSION;
+    }
+
+    CTransaction tx(mtx);
+    txsize += GetSerializeSize(tx, SER_NETWORK, tx.nVersion);
+    if (fromTaddr) {
+        txsize += CTXIN_SPEND_DUST_SIZE;
+        txsize += CTXOUT_REGULAR_SIZE; // There will probably be taddr change
+    }
+    txsize += CTXOUT_REGULAR_SIZE * taddrRecipientCount;
+
+    if (orchardRecipientCount > 0) {
+        // - The Orchard transaction builder pads to a minimum of 2 actions.
+        // - We subtract 1 because `GetSerializeSize(tx, ...)` already counts
+        //   `ZC_ZIP225_ORCHARD_NUM_ACTIONS_BASE_SIZE`.
+        txsize += ZC_ZIP225_ORCHARD_BASE_SIZE - 1 + ZC_ZIP225_ORCHARD_MARGINAL_SIZE * std::max(2, (int) orchardRecipientCount);
+    }
+    return txsize;
+}
+
+UniValue z_sendmany(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() < 2 || params.size() > 5)
+        throw runtime_error(
+            "z_sendmany \"fromaddress\" [{\"address\":... ,\"amount\":...},...] ( minconf ) ( fee ) ( privacyPolicy )\n"
+            "\nSend multiple times. Amounts are decimal numbers with at most 8 digits of precision."
+            "\nChange generated from one or more transparent addresses flows to a new transparent"
+            "\naddress, while change generated from a shielded address returns to itself."
+            "\nWhen sending coinbase UTXOs to a shielded address, change is not allowed."
+            "\nThe entire value of the UTXO(s) must be consumed."
+            + strprintf("\nBefore Sapling activates, the maximum number of zaddr outputs is %d due to transaction size limits.\n", Z_SENDMANY_MAX_ZADDR_OUTPUTS_BEFORE_SAPLING)
+            + HelpRequiringPassphrase() + "\n"
+            "\nArguments:\n"
+            "1. \"fromaddress\"         (string, required) The transparent or shielded address to send the funds from.\n"
+            "                           The following special strings are also accepted:\n"
+            "                               - \"ANY_TADDR\": Select non-coinbase UTXOs from any transparent addresses belonging to the wallet.\n"
+            "                                              Use z_shieldcoinbase to shield coinbase UTXOs from multiple transparent addresses.\n"
+            "                           If the address is a UA, transfer from the most recent value pool with sufficient funds\n"
+            "2. \"amounts\"             (array, required) An array of json objects representing the amounts to send.\n"
+            "    [{\n"
+            "      \"address\":address  (string, required) The address is a taddr, zaddr, or Unified Address\n"
+            "      \"amount\":amount    (numeric, required) The numeric amount in " + CURRENCY_UNIT + " is the value\n"
+            "      \"memo\":memo        (string, optional) If the address is a zaddr, raw data represented in hexadecimal string format\n"
+            "    }, ... ]\n"
+            "3. minconf               (numeric, optional, default=" + strprintf("%u", DEFAULT_NOTE_CONFIRMATIONS) + ") Only use funds confirmed at least this many times.\n"
+            "4. fee                   (numeric, optional, default=" + strprintf("%s", FormatMoney(DEFAULT_FEE)) + ") The fee amount to attach to this transaction.\n"
+            "5. privacyPolicy         (string, optional, default=\"LegacyCompat\") Policy for what information leakage is acceptable.\n"
+            "                         One of the following strings:\n"
+            "                               - \"FullPrivacy\": Only allow fully-shielded transactions (involving a single shielded value pool).\n"
+            "                               - \"LegacyCompat\": If the transaction involves any Unified Addresses, this is equivalent to\n"
+            "                                 \"FullPrivacy\". Otherwise, this is equivalent to \"AllowFullyTransparent\".\n"
+            "                               - \"AllowRevealedAmounts\": Allow funds to cross between shielded value pools, revealing the amount\n"
+            "                                 that crosses pools.\n"
+            "                               - \"AllowRevealedRecipients\": Allow transparent recipients. This also implies revealing\n"
+            "                                 information described under \"AllowRevealedAmounts\".\n"
+            "                               - \"AllowRevealedSenders\": Allow transparent funds to be spent, revealing the sending\n"
+            "                                 addresses and amounts. This implies revealing information described under \"AllowRevealedAmounts\".\n"
+            "                               - \"AllowFullyTransparent\": Allow transaction to both spend transparent funds and have\n"
+            "                                 transparent recipients. This implies revealing information described under \"AllowRevealedSenders\"\n"
+            "                                 and \"AllowRevealedRecipients\".\n"
+            "                               - \"AllowLinkingAccountAddresses\": Allow selecting transparent coins from the full account,\n"
+            "                                 rather than just the funds sent to the transparent receiver in the provided Unified Address.\n"
+            "                                 This implies revealing information described under \"AllowRevealedSenders\".\n"
+            "                               - \"NoPrivacy\": Allow the transaction to reveal any information necessary to create it.\n"
+            "                                 This implies revealing information described under \"AllowFullyTransparent\" and\n"
+            "                                 \"AllowLinkingAccountAddresses\".\n"
+            "\nResult:\n"
+            "\"operationid\"          (string) An operationid to pass to z_getoperationstatus to get the result of the operation.\n"
+            "\nExamples:\n"
+            + HelpExampleCli("z_sendmany", "\"t1M72Sfpbz1BPpXFHz9m3CdqATR44Jvaydd\" '[{\"address\": \"ztfaW34Gj9FrnGUEf833ywDVL62NWXBM81u6EQnM6VR45eYnXhwztecW1SjxA7JrmAXKJhxhj3vDNEpVCQoSvVoSpmbhtjf\", \"amount\": 5.0}]'")
+            + HelpExampleCli("z_sendmany", "\"ANY_TADDR\" '[{\"address\": \"t1M72Sfpbz1BPpXFHz9m3CdqATR44Jvaydd\", \"amount\": 2.0}]'")
+            + HelpExampleRpc("z_sendmany", "\"t1M72Sfpbz1BPpXFHz9m3CdqATR44Jvaydd\", [{\"address\": \"ztfaW34Gj9FrnGUEf833ywDVL62NWXBM81u6EQnM6VR45eYnXhwztecW1SjxA7JrmAXKJhxhj3vDNEpVCQoSvVoSpmbhtjf\", \"amount\": 5.0}]")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    const auto& chainparams = Params();
+    int nextBlockHeight = chainActive.Height() + 1;
+
+    ThrowIfInitialBlockDownload();
+    if (!chainparams.GetConsensus().NetworkUpgradeActive(nextBlockHeight, Consensus::UPGRADE_SAPLING)) {
+        throw JSONRPCError(
+            RPC_INVALID_PARAMETER, "Cannot create shielded transactions before Sapling has activated");
+    }
+
+    KeyIO keyIO(chainparams);
+
+    // We need to know the privacy policy before we construct the ZTXOSelector,
+    // but we can't determine the default privacy policy without knowing whether
+    // any UAs are involved. We break this cycle by parsing the privacy policy
+    // argument first, and then resolving it to the default after parsing the
+    // rest of the arguments. This works because all possible defaults for the
+    // privacy policy have the same effect on ZTXOSelector construction (in that
+    // they don't include AllowLinkingAccountAddresses).
+    std::optional<TransactionStrategy> maybeStrategy;
+    if (params.size() > 4) {
+        auto strategyName = params[4].get_str();
+        if (strategyName != "LegacyCompat") {
+            maybeStrategy = TransactionStrategy::FromString(strategyName);
+            if (!maybeStrategy.has_value()) {
+                throw JSONRPCError(
+                    RPC_INVALID_PARAMETER,
+                    strprintf("Unknown privacy policy name '%s'", strategyName));
+            }
+        }
+    }
+
+    bool involvesUnifiedAddress = false;
+
+    // Check that the from address is valid.
+    // Unified address (UA) allowed here (#5185)
+    auto fromaddress = params[0].get_str();
+    ZTXOSelector ztxoSelector = [&]() {
+        if (fromaddress == "ANY_TADDR") {
+            return CWallet::LegacyTransparentZTXOSelector(true);
+        } else {
+            auto decoded = keyIO.DecodePaymentAddress(fromaddress);
+            if (!decoded.has_value()) {
+                throw JSONRPCError(
+                        RPC_INVALID_ADDRESS_OR_KEY,
+                        "Invalid from address: should be a taddr, zaddr, UA, or the string 'ANY_TADDR'.");
+            }
+
+            auto ztxoSelectorOpt = pwalletMain->ZTXOSelectorForAddress(
+                decoded.value(),
+                true,
+                // LegacyCompat does not include AllowLinkingAccountAddresses.
+                maybeStrategy.has_value() ? maybeStrategy.value().AllowLinkingAccountAddresses() : false);
+            if (!ztxoSelectorOpt.has_value()) {
+                throw JSONRPCError(
+                        RPC_INVALID_ADDRESS_OR_KEY,
+                        "Invalid from address, no payment source found for address.");
+            }
+
+            auto selectorAccount = pwalletMain->FindAccountForSelector(ztxoSelectorOpt.value());
+            std::visit(match {
+                [&](const libzcash::UnifiedAddress& ua) {
+                    if (!selectorAccount.has_value() || selectorAccount.value() == ZCASH_LEGACY_ACCOUNT) {
+                        throw JSONRPCError(
+                                RPC_INVALID_ADDRESS_OR_KEY,
+                                "Invalid from address, UA does not correspond to a known account.");
+                    }
+                    involvesUnifiedAddress = true;
+                },
+                [&](const auto& other) {
+                    if (selectorAccount.has_value() && selectorAccount.value() != ZCASH_LEGACY_ACCOUNT) {
+                        throw JSONRPCError(
+                                RPC_INVALID_ADDRESS_OR_KEY,
+                                "Invalid from address: is a bare receiver from a Unified Address in this wallet. Provide the UA as returned by z_getaddressforaccount instead.");
+                    }
+                }
+            }, decoded.value());
+
+            return ztxoSelectorOpt.value();
+        }
+    }();
+
+    UniValue outputs = params[1].get_array();
+    if (outputs.size() == 0) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, amounts array is empty.");
+    }
+
+    std::set<RecipientAddress> recipientAddrs;
+    std::vector<SendManyRecipient> recipients;
+    CAmount nTotalOut = 0;
+    size_t nOrchardOutputs = 0;
+    for (const UniValue& o : outputs.getValues()) {
+        if (!o.isObject())
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, expected object");
+
+        // sanity check, report error if unknown key-value pairs
+        for (const std::string& s : o.getKeys()) {
+            if (s != "address" && s != "amount" && s != "memo")
+                throw JSONRPCError(RPC_INVALID_PARAMETER, string("Invalid parameter, unknown key: ") + s);
+        }
+
+        std::string addrStr = find_value(o, "address").get_str();
+        auto decoded = keyIO.DecodePaymentAddress(addrStr);
+        if (!decoded.has_value()) {
+            throw JSONRPCError(
+                    RPC_INVALID_PARAMETER,
+                    std::string("Invalid parameter, unknown address format: ") + addrStr);
+        }
+
+        std::optional<RecipientAddress> addr = std::visit(
+            SelectRecipientAddress(chainparams.GetConsensus(), nextBlockHeight),
+            decoded.value());
+        if (!addr.has_value()) {
+            bool toSprout = std::holds_alternative<libzcash::SproutPaymentAddress>(decoded.value());
+            if (toSprout) {
+                throw JSONRPCError(
+                    RPC_INVALID_PARAMETER,
+                    "Sending funds into the Sprout value pool is not supported by z_sendmany");
+            } else {
+                throw JSONRPCError(
+                    RPC_INVALID_PARAMETER,
+                    "Unified address contained only receiver types that are unrecognized or for which the required consensus feature is not yet active.");
+            }
+        }
+
+        if (!recipientAddrs.insert(addr.value()).second) {
+            throw JSONRPCError(RPC_INVALID_PARAMETER, string("Invalid parameter, duplicated recipient address: ") + addrStr);
+        }
+
+        UniValue memoValue = find_value(o, "memo");
+        std::optional<std::string> memo;
+        if (!memoValue.isNull()) {
+            memo = memoValue.get_str();
+            if (!std::visit(libzcash::IsShieldedRecipient(), addr.value())) {
+                throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, memos cannot be sent to transparent addresses.");
+            } else if (!IsHex(memo.value())) {
+                throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, expected memo data in hexadecimal format.");
+            }
+
+            if (memo.value().length() > ZC_MEMO_SIZE*2) {
+                throw JSONRPCError(RPC_INVALID_PARAMETER,  strprintf("Invalid parameter, size of memo is larger than maximum allowed %d", ZC_MEMO_SIZE ));
+            }
+        }
+
+        UniValue av = find_value(o, "amount");
+        CAmount nAmount = AmountFromValue( av );
+        if (nAmount < 0) {
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, amount must be positive");
+        }
+
+        std::optional<libzcash::UnifiedAddress> ua = std::nullopt;
+        if (std::holds_alternative<libzcash::UnifiedAddress>(decoded.value())) {
+            ua = std::get<libzcash::UnifiedAddress>(decoded.value());
+            involvesUnifiedAddress = true;
+        }
+
+        if (std::holds_alternative<libzcash::OrchardRawAddress>(addr.value())) {
+            nOrchardOutputs += 1;
+            if (nOrchardOutputs > nOrchardActionLimit) {
+                throw JSONRPCError(
+                    RPC_INVALID_PARAMETER,
+                    strprintf(
+                        "Attempting to create %u Orchard outputs would exceed the current limit "
+                        "of %u notes, which exists to prevent memory exhaustion. Restart with "
+                        "`-orchardactionlimit=N` where N >= %u to allow the wallet to attempt "
+                        "to construct this transaction.",
+                        nOrchardOutputs,
+                        nOrchardActionLimit,
+                        nOrchardOutputs));
+            }
+        }
+
+        recipients.push_back(SendManyRecipient(ua, addr.value(), nAmount, memo));
+        nTotalOut += nAmount;
+    }
+    if (recipients.empty()) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "No recipients");
+    }
+
+    // Now that we've set involvesUnifiedAddress correctly, we can finish
+    // evaluating the strategy.
+    TransactionStrategy strategy = maybeStrategy.value_or(
+        // Default privacy policy is "LegacyCompat".
+        (involvesUnifiedAddress || !fEnableLegacyPrivacyStrategy) ?
+            TransactionStrategy(PrivacyPolicy::FullPrivacy) :
+            TransactionStrategy(PrivacyPolicy::AllowFullyTransparent)
+    );
+
+    // Sanity check for transaction size
+    // TODO: move this to the builder?
+    auto txsize = EstimateTxSize(ztxoSelector, recipients, nextBlockHeight);
+    if (txsize > MAX_TX_SIZE_AFTER_SAPLING) {
+        throw JSONRPCError(
+                RPC_INVALID_PARAMETER,
+                strprintf("Too many outputs, size of raw transaction would be larger than limit of %d bytes", MAX_TX_SIZE_AFTER_SAPLING));
+    }
+
+    // Minimum confirmations
+    int nMinDepth = DEFAULT_NOTE_CONFIRMATIONS;
+    if (params.size() > 2) {
+        nMinDepth = params[2].get_int();
+    }
+    if (nMinDepth < 0) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Minimum number of confirmations cannot be less than 0");
+    }
+
+    // Fee in Zatoshis, not currency format)
+    CAmount nFee = DEFAULT_FEE;
+    if (params.size() > 3) {
+        if (params[3].get_real() == 0.0) {
+            nFee = 0;
+        } else {
+            nFee = AmountFromValue( params[3] );
+        }
+
+        // Check that the user specified fee is not absurd.
+        // This allows amount=0 (and all amount < DEFAULT_FEE) transactions to use the default network fee
+        // or anything less than DEFAULT_FEE instead of being forced to use a custom fee and leak metadata
+        if (nTotalOut < DEFAULT_FEE) {
+            if (nFee > DEFAULT_FEE) {
+                throw JSONRPCError(
+                        RPC_INVALID_PARAMETER,
+                        strprintf("Small transaction amount %s has fee %s that is greater than the default fee %s", FormatMoney(nTotalOut), FormatMoney(nFee), FormatMoney(DEFAULT_FEE)));
+            }
+        } else {
+            // Check that the user specified fee is not absurd.
+            if (nFee > nTotalOut) {
+                throw JSONRPCError(
+                        RPC_INVALID_PARAMETER,
+                        strprintf("Fee %s is greater than the sum of outputs %s and also greater than the default fee", FormatMoney(nFee), FormatMoney(nTotalOut)));
+            }
+        }
+    }
+
+    // Use input parameters as the optional context info to be returned by z_getoperationstatus and z_getoperationresult.
+    UniValue o(UniValue::VOBJ);
+    o.pushKV("fromaddress", params[0]);
+    o.pushKV("amounts", params[1]);
+    o.pushKV("minconf", nMinDepth);
+    o.pushKV("fee", std::stod(FormatMoney(nFee)));
+    UniValue contextInfo = o;
+
+    std::optional<uint256> orchardAnchor;
+    auto nAnchorDepth = std::min((unsigned int) nMinDepth, nAnchorConfirmations);
+    if (!ztxoSelector.SelectsSprout() && nAnchorDepth > 0) {
+        auto orchardAnchorHeight = nextBlockHeight - nAnchorDepth;
+        if (chainparams.GetConsensus().NetworkUpgradeActive(orchardAnchorHeight, Consensus::UPGRADE_NU5)) {
+            orchardAnchor = chainActive[orchardAnchorHeight]->hashFinalOrchardRoot;
+        }
+    }
+    TransactionBuilder builder(chainparams.GetConsensus(), nextBlockHeight, orchardAnchor, pwalletMain);
+
+    // Create operation and add to global queue
+    std::shared_ptr<AsyncRPCQueue> q = getAsyncRPCQueue();
+    std::shared_ptr<AsyncRPCOperation> operation(
+            new AsyncRPCOperation_sendmany(
+                std::move(builder), ztxoSelector, recipients, nMinDepth, nAnchorDepth, strategy, nFee, contextInfo)
+            );
+    q->addOperation(operation);
+    AsyncRPCOperationId operationId = operation->getId();
+    return operationId;
+}
+
+UniValue z_setmigration(const UniValue& params, bool fHelp) {
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+    if (fHelp || params.size() != 1)
+        throw runtime_error(
+            "z_setmigration enabled\n"
+            "When enabled the Sprout to Sapling migration will attempt to migrate all funds from this wallet’s\n"
+            "Sprout addresses to either the address for Sapling account 0 or the address specified by the parameter\n"
+            "'-migrationdestaddress'.\n"
+            "\n"
+            "This migration is designed to minimize information leakage. As a result for wallets with a significant\n"
+            "Sprout balance, this process may take several weeks. The migration works by sending, up to 5, as many\n"
+            "transactions as possible whenever the blockchain reaches a height equal to 499 modulo 500. The transaction\n"
+            "amounts are picked according to the random distribution specified in ZIP 308. The migration will end once\n"
+            "the wallet’s Sprout balance is below " + strprintf("%s %s", FormatMoney(CENT), CURRENCY_UNIT) + ".\n"
+            "\nArguments:\n"
+            "1. enabled  (boolean, required) 'true' or 'false' to enable or disable respectively.\n"
+        );
+    LOCK(pwalletMain->cs_wallet);
+    pwalletMain->fSaplingMigrationEnabled = params[0].get_bool();
+    return NullUniValue;
+}
+
+UniValue z_getmigrationstatus(const UniValue& params, bool fHelp) {
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+    if (fHelp || params.size() != 0)
+        throw runtime_error(
+            "z_getmigrationstatus\n"
+            "Returns information about the status of the Sprout to Sapling migration.\n"
+            "Note: A transaction is defined as finalized if it has at least ten confirmations.\n"
+            "Also, it is possible that manually created transactions involving this wallet\n"
+            "will be included in the result.\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"enabled\": true|false,                    (boolean) Whether or not migration is enabled\n"
+            "  \"destination_address\": \"zaddr\",           (string) The Sapling address that will receive Sprout funds\n"
+            "  \"unmigrated_amount\": nnn.n,               (numeric) The total amount of unmigrated " + CURRENCY_UNIT +" \n"
+            "  \"unfinalized_migrated_amount\": nnn.n,     (numeric) The total amount of unfinalized " + CURRENCY_UNIT + " \n"
+            "  \"finalized_migrated_amount\": nnn.n,       (numeric) The total amount of finalized " + CURRENCY_UNIT + " \n"
+            "  \"finalized_migration_transactions\": nnn,  (numeric) The number of migration transactions involving this wallet\n"
+            "  \"time_started\": ttt,                      (numeric, optional) The block time of the first migration transaction as a Unix timestamp\n"
+            "  \"migration_txids\": [txids]                (json array of strings) An array of all migration txids involving this wallet\n"
+            "}\n"
+        );
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+    UniValue migrationStatus(UniValue::VOBJ);
+    migrationStatus.pushKV("enabled", pwalletMain->fSaplingMigrationEnabled);
+    //  The "destination_address" field MAY be omitted if the "-migrationdestaddress"
+    // parameter is not set and no default address has yet been generated.
+    // Note: The following function may return the default address even if it has not been added to the wallet
+    auto destinationAddress = AsyncRPCOperation_saplingmigration::getMigrationDestAddress(pwalletMain->GetHDSeedForRPC());
+    KeyIO keyIO(Params());
+    migrationStatus.pushKV("destination_address", keyIO.EncodePaymentAddress(destinationAddress));
+    //  The values of "unmigrated_amount" and "migrated_amount" MUST take into
+    // account failed transactions, that were not mined within their expiration
+    // height.
+    {
+        std::vector<SproutNoteEntry> sproutEntries;
+        std::vector<SaplingNoteEntry> saplingEntries;
+        std::vector<OrchardNoteMetadata> orchardEntries;
+        // Here we are looking for any and all Sprout notes for which we have the spending key, including those
+        // which are locked and/or only exist in the mempool, as they should be included in the unmigrated amount.
+        pwalletMain->GetFilteredNotes(sproutEntries, saplingEntries, orchardEntries, std::nullopt, 0, INT_MAX, true, true, false);
+        CAmount unmigratedAmount = 0;
+        for (const auto& sproutEntry : sproutEntries) {
+            unmigratedAmount += sproutEntry.note.value();
+        }
+        migrationStatus.pushKV("unmigrated_amount", FormatMoney(unmigratedAmount));
+    }
+    //  "migration_txids" is a list of strings representing transaction IDs of all
+    // known migration transactions involving this wallet, as lowercase hexadecimal
+    // in RPC byte order.
+    UniValue migrationTxids(UniValue::VARR);
+    CAmount unfinalizedMigratedAmount = 0;
+    CAmount finalizedMigratedAmount = 0;
+    int numFinalizedMigrationTxs = 0;
+    uint64_t timeStarted = 0;
+    for (const auto& txPair : pwalletMain->mapWallet) {
+        CWalletTx tx = txPair.second;
+        // A given transaction is defined as a migration transaction iff it has:
+        // * one or more Sprout JoinSplits with nonzero vpub_new field; and
+        // * no Sapling Spends, and;
+        // * one or more Sapling Outputs.
+        if (tx.vJoinSplit.size() > 0 && tx.vShieldedSpend.empty() && tx.vShieldedOutput.size() > 0) {
+            bool nonZeroVPubNew = false;
+            for (const auto& js : tx.vJoinSplit) {
+                if (js.vpub_new > 0) {
+                    nonZeroVPubNew = true;
+                    break;
+                }
+            }
+            if (!nonZeroVPubNew) {
+                continue;
+            }
+            migrationTxids.push_back(txPair.first.ToString());
+            //  A transaction is "finalized" iff it has at least 10 confirmations.
+            // TODO: subject to change, if the recommended number of confirmations changes.
+            if (tx.GetDepthInMainChain() >= 10) {
+                finalizedMigratedAmount -= tx.GetValueBalanceSapling();
+                ++numFinalizedMigrationTxs;
+            } else {
+                unfinalizedMigratedAmount -= tx.GetValueBalanceSapling();
+            }
+            // If the transaction is in the mempool it will not be associated with a block yet
+            if (tx.hashBlock.IsNull() || mapBlockIndex[tx.hashBlock] == nullptr) {
+                continue;
+            }
+            CBlockIndex* blockIndex = mapBlockIndex[tx.hashBlock];
+            //  The value of "time_started" is the earliest Unix timestamp of any known
+            // migration transaction involving this wallet; if there is no such transaction,
+            // then the field is absent.
+            if (timeStarted == 0 || timeStarted > blockIndex->GetBlockTime()) {
+                timeStarted = blockIndex->GetBlockTime();
+            }
+        }
+    }
+    migrationStatus.pushKV("unfinalized_migrated_amount", FormatMoney(unfinalizedMigratedAmount));
+    migrationStatus.pushKV("finalized_migrated_amount", FormatMoney(finalizedMigratedAmount));
+    migrationStatus.pushKV("finalized_migration_transactions", numFinalizedMigrationTxs);
+    if (timeStarted > 0) {
+        migrationStatus.pushKV("time_started", timeStarted);
+    }
+    migrationStatus.pushKV("migration_txids", migrationTxids);
+    return migrationStatus;
+}
+
+/**
+When estimating the number of coinbase utxos we can shield in a single transaction:
+1. Joinsplit description is 1802 bytes.
+2. Transaction overhead ~ 100 bytes
+3. Spending a typical P2PKH is >=148 bytes, as defined in CTXIN_SPEND_DUST_SIZE.
+4. Spending a multi-sig P2SH address can vary greatly:
+   https://github.com/bitcoin/bitcoin/blob/c3ad56f4e0b587d8d763af03d743fdfc2d180c9b/src/main.cpp#L517
+   In real-world coinbase utxos, we consider a 3-of-3 multisig, where the size is roughly:
+    (3*(33+1))+3 = 105 byte redeem script
+    105 + 1 + 3*(73+1) = 328 bytes of scriptSig, rounded up to 400 based on testnet experiments.
+*/
+#define CTXIN_SPEND_P2SH_SIZE 400
+
+#define SHIELD_COINBASE_DEFAULT_LIMIT 50
+
+UniValue z_shieldcoinbase(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() < 2 || params.size() > 4)
+        throw runtime_error(
+            "z_shieldcoinbase \"fromaddress\" \"tozaddress\" ( fee ) ( limit )\n"
+            "\nShield transparent coinbase funds by sending to a shielded zaddr.  This is an asynchronous operation and utxos"
+            "\nselected for shielding will be locked.  If there is an error, they are unlocked.  The RPC call `listlockunspent`"
+            "\ncan be used to return a list of locked utxos.  The number of coinbase utxos selected for shielding can be limited"
+            "\nby the caller. Any limit is constrained by the consensus rule defining a maximum"
+            "\ntransaction size of "
+            + strprintf("%d bytes before Sapling, and %d bytes once Sapling activates.", MAX_TX_SIZE_BEFORE_SAPLING, MAX_TX_SIZE_AFTER_SAPLING)
+            + HelpRequiringPassphrase() + "\n"
+            "\nArguments:\n"
+            "1. \"fromaddress\"         (string, required) The address is a taddr or \"*\" for all taddrs belonging to the wallet.\n"
+            "2. \"toaddress\"           (string, required) The address is a zaddr.\n"
+            "3. fee                   (numeric, optional, default="
+            + strprintf("%s", FormatMoney(DEFAULT_FEE)) + ") The fee amount to attach to this transaction.\n"
+            "4. limit                 (numeric, optional, default="
+            + strprintf("%d", SHIELD_COINBASE_DEFAULT_LIMIT) + ") Limit on the maximum number of utxos to shield.  Set to 0 to use as many as will fit in the transaction.\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"remainingUTXOs\": xxx       (numeric) Number of coinbase utxos still available for shielding.\n"
+            "  \"remainingValue\": xxx       (numeric) Value of coinbase utxos still available for shielding.\n"
+            "  \"shieldingUTXOs\": xxx        (numeric) Number of coinbase utxos being shielded.\n"
+            "  \"shieldingValue\": xxx        (numeric) Value of coinbase utxos being shielded.\n"
+            "  \"opid\": xxx          (string) An operationid to pass to z_getoperationstatus to get the result of the operation.\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("z_shieldcoinbase", "\"t1M72Sfpbz1BPpXFHz9m3CdqATR44Jvaydd\" \"ztfaW34Gj9FrnGUEf833ywDVL62NWXBM81u6EQnM6VR45eYnXhwztecW1SjxA7JrmAXKJhxhj3vDNEpVCQoSvVoSpmbhtjf\"")
+            + HelpExampleRpc("z_shieldcoinbase", "\"t1M72Sfpbz1BPpXFHz9m3CdqATR44Jvaydd\", \"ztfaW34Gj9FrnGUEf833ywDVL62NWXBM81u6EQnM6VR45eYnXhwztecW1SjxA7JrmAXKJhxhj3vDNEpVCQoSvVoSpmbhtjf\"")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    ThrowIfInitialBlockDownload();
+
+    // Validate the from address
+    auto fromaddress = params[0].get_str();
+    bool isFromWildcard = fromaddress == "*";
+    KeyIO keyIO(Params());
+
+    // Set of source addresses to filter utxos by
+    std::set<CTxDestination> sources = {};
+    if (!isFromWildcard) {
+        CTxDestination taddr = keyIO.DecodeDestination(fromaddress);
+        if (IsValidDestination(taddr)) {
+            sources.insert(taddr);
+        } else {
+            throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Invalid from address, should be a taddr or \"*\".");
+        }
+    }
+
+    int nextBlockHeight = chainActive.Height() + 1;
+    const bool canopyActive = Params().GetConsensus().NetworkUpgradeActive(nextBlockHeight, Consensus::UPGRADE_CANOPY);
+
+    // Validate the destination address
+    auto destStr = params[1].get_str();
+    auto destaddress = keyIO.DecodePaymentAddress(destStr);
+    if (destaddress.has_value()) {
+        std::visit(match {
+            [&](const CKeyID& addr) {
+                throw JSONRPCError(RPC_VERIFY_REJECTED, "Cannot shield coinbase output to a p2pkh address.");
+            },
+            [&](const CScriptID&) {
+                throw JSONRPCError(RPC_VERIFY_REJECTED, "Cannot shield coinbase output to a p2sh address.");
+            },
+            [&](const libzcash::SaplingPaymentAddress& addr) {
+                // OK
+            },
+            [&](const libzcash::SproutPaymentAddress& addr) {
+                if (canopyActive) {
+                    throw JSONRPCError(RPC_VERIFY_REJECTED, "Sprout shielding is not supported after Canopy activation");
+                }
+            },
+            [&](const libzcash::UnifiedAddress& ua) {
+                // OK
+            }
+        }, destaddress.value());
+    } else {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, string("Invalid parameter, unknown address format: ") + destStr);
+    }
+
+    // Convert fee from currency format to zatoshis
+    CAmount nFee = DEFAULT_FEE;
+    if (params.size() > 2) {
+        if (params[2].get_real() == 0.0) {
+            nFee = 0;
+        } else {
+            nFee = AmountFromValue( params[2] );
+        }
+    }
+
+    int nLimit = SHIELD_COINBASE_DEFAULT_LIMIT;
+    if (params.size() > 3) {
+        nLimit = params[3].get_int();
+        if (nLimit < 0) {
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Limit on maximum number of utxos cannot be negative");
+        }
+    }
+
+    const bool saplingActive =  Params().GetConsensus().NetworkUpgradeActive(nextBlockHeight, Consensus::UPGRADE_SAPLING);
+
+    // We cannot create shielded transactions before Sapling activates.
+    if (!saplingActive) {
+        throw JSONRPCError(
+            RPC_INVALID_PARAMETER, "Cannot create shielded transactions before Sapling has activated");
+    }
+
+    bool overwinterActive = Params().GetConsensus().NetworkUpgradeActive(nextBlockHeight, Consensus::UPGRADE_OVERWINTER);
+    assert(overwinterActive);
+    unsigned int max_tx_size = MAX_TX_SIZE_AFTER_SAPLING;
+
+    // Prepare to get coinbase utxos
+    std::vector<ShieldCoinbaseUTXO> inputs;
+    CAmount shieldedValue = 0;
+    CAmount remainingValue = 0;
+    size_t estimatedTxSize = 2000;  // 1802 joinsplit description + tx overhead + wiggle room
+    size_t utxoCounter = 0;
+    bool maxedOutFlag = false;
+    const size_t mempoolLimit = nLimit;
+
+    // Get available utxos
+    vector<COutput> vecOutputs;
+    pwalletMain->AvailableCoins(vecOutputs, true, NULL, false, true);
+
+    // Find unspent coinbase utxos and update estimated size
+    for (const COutput& out : vecOutputs) {
+        if (!out.fSpendable) {
+            continue;
+        }
+
+        CTxDestination address;
+        if (!ExtractDestination(out.tx->vout[out.i].scriptPubKey, address)) {
+            continue;
+        }
+
+        // If from address was not the wildcard "*", filter utxos
+        if (sources.size() > 0 && !sources.count(address)) {
+            continue;
+        }
+
+        if (!out.tx->IsCoinBase()) {
+            continue;
+        }
+
+        utxoCounter++;
+        auto scriptPubKey = out.tx->vout[out.i].scriptPubKey;
+        CAmount nValue = out.tx->vout[out.i].nValue;
+
+        if (!maxedOutFlag) {
+            size_t increase = (std::get_if<CScriptID>(&address) != nullptr) ? CTXIN_SPEND_P2SH_SIZE : CTXIN_SPEND_DUST_SIZE;
+            if (estimatedTxSize + increase >= max_tx_size ||
+                (mempoolLimit > 0 && utxoCounter > mempoolLimit))
+            {
+                maxedOutFlag = true;
+            } else {
+                estimatedTxSize += increase;
+                ShieldCoinbaseUTXO utxo = {out.tx->GetHash(), out.i, scriptPubKey, nValue};
+                inputs.push_back(utxo);
+                shieldedValue += nValue;
+            }
+        }
+
+        if (maxedOutFlag) {
+            remainingValue += nValue;
+        }
+    }
+
+    size_t numUtxos = inputs.size();
+
+    if (numUtxos == 0) {
+        throw JSONRPCError(RPC_WALLET_INSUFFICIENT_FUNDS, "Could not find any coinbase funds to shield.");
+    }
+
+    if (shieldedValue < nFee) {
+        throw JSONRPCError(RPC_WALLET_INSUFFICIENT_FUNDS,
+            strprintf("Insufficient coinbase funds, have %s, which is less than miners fee %s",
+            FormatMoney(shieldedValue), FormatMoney(nFee)));
+    }
+
+    // Check that the user specified fee is sane (if too high, it can result in error -25 absurd fee)
+    CAmount netAmount = shieldedValue - nFee;
+    if (nFee > netAmount) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, strprintf("Fee %s is greater than the net amount to be shielded %s", FormatMoney(nFee), FormatMoney(netAmount)));
+    }
+
+    // Keep record of parameters in context object
+    UniValue contextInfo(UniValue::VOBJ);
+    contextInfo.pushKV("fromaddress", params[0]);
+    contextInfo.pushKV("toaddress", params[1]);
+    contextInfo.pushKV("fee", ValueFromAmount(nFee));
+
+    // Builder (used if Sapling addresses are involved)
+    std::optional<uint256> orchardAnchor;
+    if (canopyActive) {
+        // Allow Orchard recipients by setting an Orchard anchor.
+        auto orchardAnchorHeight = nextBlockHeight - nAnchorConfirmations;
+        if (Params().GetConsensus().NetworkUpgradeActive(orchardAnchorHeight, Consensus::UPGRADE_NU5)) {
+            orchardAnchor = chainActive[orchardAnchorHeight]->hashFinalOrchardRoot;
+        }
+    }
+    TransactionBuilder builder = TransactionBuilder(
+        Params().GetConsensus(), nextBlockHeight, orchardAnchor, pwalletMain);
+
+    // Contextual transaction we will build on
+    // (used if no Sapling addresses are involved)
+    CMutableTransaction contextualTx = CreateNewContextualCMutableTransaction(
+        Params().GetConsensus(), nextBlockHeight);
+    if (contextualTx.nVersion == 1) {
+        contextualTx.nVersion = 2; // Tx format should support vJoinSplit
+    }
+
+    // Create operation and add to global queue
+    std::shared_ptr<AsyncRPCQueue> q = getAsyncRPCQueue();
+    std::shared_ptr<AsyncRPCOperation> operation( new AsyncRPCOperation_shieldcoinbase(
+        std::move(builder), contextualTx, inputs, destaddress.value(), nFee, contextInfo) );
+    q->addOperation(operation);
+    AsyncRPCOperationId operationId = operation->getId();
+
+    // Return continuation information
+    UniValue o(UniValue::VOBJ);
+    o.pushKV("remainingUTXOs", static_cast<uint64_t>(utxoCounter - numUtxos));
+    o.pushKV("remainingValue", ValueFromAmount(remainingValue));
+    o.pushKV("shieldingUTXOs", static_cast<uint64_t>(numUtxos));
+    o.pushKV("shieldingValue", ValueFromAmount(shieldedValue));
+    o.pushKV("opid", operationId);
+    return o;
+}
+
+
+#define MERGE_TO_ADDRESS_DEFAULT_TRANSPARENT_LIMIT 50
+#define MERGE_TO_ADDRESS_DEFAULT_SPROUT_LIMIT 20
+#define MERGE_TO_ADDRESS_DEFAULT_SAPLING_LIMIT 200
+
+UniValue z_mergetoaddress(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() < 2 || params.size() > 6)
+        throw runtime_error(
+            "z_mergetoaddress [\"fromaddress\", ... ] \"toaddress\" ( fee ) ( transparent_limit ) ( shielded_limit ) ( memo )\n"
+            "\nMerge multiple UTXOs and notes into a single UTXO or note.  Coinbase UTXOs are ignored; use `z_shieldcoinbase`"
+            "\nto combine those into a single note."
+            "\n\nThis is an asynchronous operation, and UTXOs selected for merging will be locked.  If there is an error, they"
+            "\nare unlocked.  The RPC call `listlockunspent` can be used to return a list of locked UTXOs."
+            "\n\nThe number of UTXOs and notes selected for merging can be limited by the caller.  If the transparent limit"
+            "\nparameter is set to zero will mean limit the number of UTXOs based on the size of the transaction.  Any limit is"
+            "\nconstrained by the consensus rule defining a maximum transaction size of "
+            + strprintf("%d bytes before Sapling, and %d", MAX_TX_SIZE_BEFORE_SAPLING, MAX_TX_SIZE_AFTER_SAPLING)
+            + "\nbytes once Sapling activates."
+            + HelpRequiringPassphrase() + "\n"
+            "\nArguments:\n"
+            "1. fromaddresses         (array, required) A JSON array with addresses.\n"
+            "                         The following special strings are accepted inside the array:\n"
+            "                             - \"ANY_TADDR\":   Merge UTXOs from any taddrs belonging to the wallet.\n"
+            "                             - \"ANY_SPROUT\":  Merge notes from any Sprout zaddrs belonging to the wallet.\n"
+            "                             - \"ANY_SAPLING\": Merge notes from any Sapling zaddrs belonging to the wallet.\n"
+            "                         While it is possible to use a variety of different combinations of addresses and the above values,\n"
+            "                         it is not possible to send funds from both sprout and sapling addresses simultaneously. If a special\n"
+            "                         string is given, any given addresses of that address type will be counted as duplicates and cause an error.\n"
+            "    [\n"
+            "      \"address\"          (string) Can be a taddr or a zaddr\n"
+            "      ,...\n"
+            "    ]\n"
+            "2. \"toaddress\"           (string, required) The taddr or zaddr to send the funds to.\n"
+            "3. fee                   (numeric, optional, default="
+            + strprintf("%s", FormatMoney(DEFAULT_FEE)) + ") The fee amount to attach to this transaction.\n"
+            "4. transparent_limit     (numeric, optional, default="
+            + strprintf("%d", MERGE_TO_ADDRESS_DEFAULT_TRANSPARENT_LIMIT) + ") Limit on the maximum number of UTXOs to merge.  Set to 0 to use as many as will fit in the transaction.\n"
+            "5. shielded_limit        (numeric, optional, default="
+            + strprintf("%d Sprout or %d Sapling Notes", MERGE_TO_ADDRESS_DEFAULT_SPROUT_LIMIT, MERGE_TO_ADDRESS_DEFAULT_SAPLING_LIMIT) + ") Limit on the maximum number of notes to merge.  Set to 0 to merge as many as will fit in the transaction.\n"
+            "6. \"memo\"                (string, optional) Encoded as hex. When toaddress is a zaddr, this will be stored in the memo field of the new note.\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"remainingUTXOs\": xxx               (numeric) Number of UTXOs still available for merging.\n"
+            "  \"remainingTransparentValue\": xxx    (numeric) Value of UTXOs still available for merging.\n"
+            "  \"remainingNotes\": xxx               (numeric) Number of notes still available for merging.\n"
+            "  \"remainingShieldedValue\": xxx       (numeric) Value of notes still available for merging.\n"
+            "  \"mergingUTXOs\": xxx                 (numeric) Number of UTXOs being merged.\n"
+            "  \"mergingTransparentValue\": xxx      (numeric) Value of UTXOs being merged.\n"
+            "  \"mergingNotes\": xxx                 (numeric) Number of notes being merged.\n"
+            "  \"mergingShieldedValue\": xxx         (numeric) Value of notes being merged.\n"
+            "  \"opid\": xxx                         (string) An operationid to pass to z_getoperationstatus to get the result of the operation.\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("z_mergetoaddress", "'[\"ANY_SAPLING\", \"t1M72Sfpbz1BPpXFHz9m3CdqATR44Jvaydd\"]' ztestsapling19rnyu293v44f0kvtmszhx35lpdug574twc0lwyf4s7w0umtkrdq5nfcauxrxcyfmh3m7slemqsj")
+            + HelpExampleRpc("z_mergetoaddress", "[\"ANY_SAPLING\", \"t1M72Sfpbz1BPpXFHz9m3CdqATR44Jvaydd\"], \"ztestsapling19rnyu293v44f0kvtmszhx35lpdug574twc0lwyf4s7w0umtkrdq5nfcauxrxcyfmh3m7slemqsj\"")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    ThrowIfInitialBlockDownload();
+
+    bool useAnyUTXO = false;
+    bool useAnySprout = false;
+    bool useAnySapling = false;
+    std::set<CTxDestination> taddrs;
+    std::vector<libzcash::PaymentAddress> zaddrs;
+
+    UniValue addresses = params[0].get_array();
+    if (addresses.size()==0)
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, fromaddresses array is empty.");
+
+    // Keep track of addresses to spot duplicates
+    std::set<std::string> setAddress;
+
+    bool isFromNonSprout = false;
+
+    KeyIO keyIO(Params());
+    // Sources
+    for (const UniValue& o : addresses.getValues()) {
+        if (!o.isStr())
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, expected string");
+
+        std::string address = o.get_str();
+
+        if (address == "ANY_TADDR") {
+            useAnyUTXO = true;
+            isFromNonSprout = true;
+        } else if (address == "ANY_SPROUT") {
+            useAnySprout = true;
+        } else if (address == "ANY_SAPLING") {
+            useAnySapling = true;
+            isFromNonSprout = true;
+        } else {
+            auto addr = keyIO.DecodePaymentAddress(address);
+            if (addr.has_value()) {
+                std::visit(match {
+                    [&](const CKeyID& taddr) {
+                        taddrs.insert(taddr);
+                        isFromNonSprout = true;
+                    },
+                    [&](const CScriptID& taddr) {
+                        taddrs.insert(taddr);
+                        isFromNonSprout = true;
+                    },
+                    [&](const libzcash::SaplingPaymentAddress& zaddr) {
+                        zaddrs.push_back(zaddr);
+                        isFromNonSprout = true;
+                    },
+                    [&](const libzcash::SproutPaymentAddress& zaddr) {
+                        zaddrs.push_back(zaddr);
+                    },
+                    [&](libzcash::UnifiedAddress) {
+                        throw JSONRPCError(
+                                RPC_INVALID_PARAMETER,
+                                "Unified addresses are not supported in z_mergetoaddress");
+                    }
+                }, addr.value());
+            } else {
+                throw JSONRPCError(RPC_INVALID_PARAMETER, string("Unknown address format: ") + address);
+            }
+        }
+
+        if (setAddress.count(address))
+            throw JSONRPCError(RPC_INVALID_PARAMETER, string("Invalid parameter, duplicated address: ") + address);
+        setAddress.insert(address);
+    }
+
+    if (useAnyUTXO && taddrs.size() > 0) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Cannot specify specific taddrs when using \"ANY_TADDR\"");
+    }
+    if ((useAnySprout || useAnySapling) && zaddrs.size() > 0) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Cannot specify specific zaddrs when using \"ANY_SPROUT\" or \"ANY_SAPLING\"");
+    }
+
+    const int nextBlockHeight = chainActive.Height() + 1;
+    const bool overwinterActive = Params().GetConsensus().NetworkUpgradeActive(nextBlockHeight, Consensus::UPGRADE_OVERWINTER);
+    const bool saplingActive =  Params().GetConsensus().NetworkUpgradeActive(nextBlockHeight, Consensus::UPGRADE_SAPLING);
+    const bool canopyActive = Params().GetConsensus().NetworkUpgradeActive(nextBlockHeight, Consensus::UPGRADE_CANOPY);
+
+    // Validate the destination address
+    auto destStr = params[1].get_str();
+    auto destaddress = keyIO.DecodePaymentAddress(destStr);
+    bool isToTaddr = false;
+    bool isToSproutZaddr = false;
+    bool isToSaplingZaddr = false;
+    if (destaddress.has_value()) {
+        std::visit(match {
+            [&](CKeyID addr) {
+                isToTaddr = true;
+            },
+            [&](CScriptID addr) {
+                isToTaddr = true;
+            },
+            [&](libzcash::SaplingPaymentAddress addr) {
+                isToSaplingZaddr = true;
+                // If Sapling is not active, do not allow sending to a sapling addresses.
+                if (!saplingActive) {
+                    throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, Sapling has not activated");
+                }
+            },
+            [&](libzcash::SproutPaymentAddress addr) {
+                isToSproutZaddr = true;
+            },
+            [&](libzcash::UnifiedAddress) {
+                throw JSONRPCError(
+                        RPC_INVALID_PARAMETER,
+                        "Invalid parameter, unified addresses are not yet supported.");
+            }
+        }, destaddress.value());
+    } else {
+        throw JSONRPCError(
+                RPC_INVALID_PARAMETER,
+                string("Invalid parameter, unknown address format: ") + destStr);
+    }
+
+    if (canopyActive && isFromNonSprout && isToSproutZaddr) {
+        // Value can be moved  within Sprout, but not into Sprout.
+        throw JSONRPCError(RPC_VERIFY_REJECTED, "Sprout shielding is not supported after Canopy");
+    }
+
+    // Convert fee from currency format to zatoshis
+    CAmount nFee = DEFAULT_FEE;
+    if (params.size() > 2) {
+        if (params[2].get_real() == 0.0) {
+            nFee = 0;
+        } else {
+            nFee = AmountFromValue( params[2] );
+        }
+    }
+
+    int nUTXOLimit = MERGE_TO_ADDRESS_DEFAULT_TRANSPARENT_LIMIT;
+    if (params.size() > 3) {
+        nUTXOLimit = params[3].get_int();
+        if (nUTXOLimit < 0) {
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Limit on maximum number of UTXOs cannot be negative");
+        }
+    }
+
+    int sproutNoteLimit = MERGE_TO_ADDRESS_DEFAULT_SPROUT_LIMIT;
+    int saplingNoteLimit = MERGE_TO_ADDRESS_DEFAULT_SAPLING_LIMIT;
+    if (params.size() > 4) {
+        int nNoteLimit = params[4].get_int();
+        if (nNoteLimit < 0) {
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Limit on maximum number of notes cannot be negative");
+        }
+        sproutNoteLimit = nNoteLimit;
+        saplingNoteLimit = nNoteLimit;
+    }
+
+    std::string memo;
+    if (params.size() > 5) {
+        memo = params[5].get_str();
+        if (!(isToSproutZaddr || isToSaplingZaddr)) {
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Memo can not be used with a taddr.  It can only be used with a zaddr.");
+        } else if (!IsHex(memo)) {
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, expected memo data in hexadecimal format.");
+        }
+        if (memo.length() > ZC_MEMO_SIZE*2) {
+            throw JSONRPCError(RPC_INVALID_PARAMETER,  strprintf("Invalid parameter, size of memo is larger than maximum allowed %d", ZC_MEMO_SIZE ));
+        }
+    }
+
+    MergeToAddressRecipient recipient(destaddress.value(), memo);
+
+    // Prepare to get UTXOs and notes
+    std::vector<MergeToAddressInputUTXO> utxoInputs;
+    std::vector<MergeToAddressInputSproutNote> sproutNoteInputs;
+    std::vector<MergeToAddressInputSaplingNote> saplingNoteInputs;
+    CAmount mergedUTXOValue = 0;
+    CAmount mergedNoteValue = 0;
+    CAmount remainingUTXOValue = 0;
+    CAmount remainingNoteValue = 0;
+    size_t utxoCounter = 0;
+    size_t noteCounter = 0;
+    bool maxedOutUTXOsFlag = false;
+    bool maxedOutNotesFlag = false;
+    const size_t mempoolLimit = nUTXOLimit;
+
+    unsigned int max_tx_size = saplingActive ? MAX_TX_SIZE_AFTER_SAPLING : MAX_TX_SIZE_BEFORE_SAPLING;
+    size_t estimatedTxSize = 200;  // tx overhead + wiggle room
+    if (isToSproutZaddr) {
+        estimatedTxSize += JOINSPLIT_SIZE(SAPLING_TX_VERSION); // We assume that sapling has activated
+    } else if (isToSaplingZaddr) {
+        estimatedTxSize += OUTPUTDESCRIPTION_SIZE;
+    }
+
+    if (useAnyUTXO || taddrs.size() > 0) {
+        // Get available utxos
+        vector<COutput> vecOutputs;
+        pwalletMain->AvailableCoins(vecOutputs, true, NULL, false, false);
+
+        // Find unspent utxos and update estimated size
+        for (const COutput& out : vecOutputs) {
+            if (!out.fSpendable) {
+                continue;
+            }
+
+            CScript scriptPubKey = out.tx->vout[out.i].scriptPubKey;
+
+            CTxDestination address;
+            if (!ExtractDestination(scriptPubKey, address)) {
+                continue;
+            }
+            // If taddr is not wildcard "*", filter utxos
+            if (taddrs.size() > 0 && !taddrs.count(address)) {
+                continue;
+            }
+
+            utxoCounter++;
+            CAmount nValue = out.tx->vout[out.i].nValue;
+
+            if (!maxedOutUTXOsFlag) {
+                size_t increase = (std::get_if<CScriptID>(&address) != nullptr) ? CTXIN_SPEND_P2SH_SIZE : CTXIN_SPEND_DUST_SIZE;
+                if (estimatedTxSize + increase >= max_tx_size ||
+                    (mempoolLimit > 0 && utxoCounter > mempoolLimit))
+                {
+                    maxedOutUTXOsFlag = true;
+                } else {
+                    estimatedTxSize += increase;
+                    COutPoint utxo(out.tx->GetHash(), out.i);
+                    utxoInputs.emplace_back(utxo, nValue, scriptPubKey);
+                    mergedUTXOValue += nValue;
+                }
+            }
+
+            if (maxedOutUTXOsFlag) {
+                remainingUTXOValue += nValue;
+            }
+        }
+    }
+
+    if (useAnySprout || useAnySapling || zaddrs.size() > 0) {
+        // Get available notes
+        std::vector<SproutNoteEntry> sproutEntries;
+        std::vector<SaplingNoteEntry> saplingEntries;
+        std::vector<OrchardNoteMetadata> orchardEntries;
+        std::optional<NoteFilter> noteFilter =
+            useAnySprout || useAnySapling ?
+                std::nullopt :
+                std::optional(NoteFilter::ForPaymentAddresses(zaddrs));
+        pwalletMain->GetFilteredNotes(sproutEntries, saplingEntries, orchardEntries, noteFilter, nAnchorConfirmations);
+
+        // If Sapling is not active, do not allow sending from a sapling addresses.
+        if (!saplingActive && saplingEntries.size() > 0) {
+            throw JSONRPCError(RPC_INVALID_PARAMETER, "Invalid parameter, Sapling has not activated");
+        }
+        // Do not include Sprout/Sapling notes if using "ANY_SAPLING"/"ANY_SPROUT" respectively
+        if (useAnySprout) {
+            saplingEntries.clear();
+        }
+        if (useAnySapling) {
+            sproutEntries.clear();
+        }
+        // Sending from both Sprout and Sapling is currently unsupported using z_mergetoaddress
+        if ((sproutEntries.size() > 0 && saplingEntries.size() > 0) || (useAnySprout && useAnySapling)) {
+            throw JSONRPCError(
+                RPC_INVALID_PARAMETER,
+                "Cannot send from both Sprout and Sapling addresses using z_mergetoaddress");
+        }
+        // If sending between shielded addresses, they must be within the same value pool
+        if ((saplingEntries.size() > 0 && isToSproutZaddr) || (sproutEntries.size() > 0 && isToSaplingZaddr)) {
+            throw JSONRPCError(
+                RPC_INVALID_PARAMETER,
+                "Cannot send between Sprout and Sapling addresses using z_mergetoaddress");
+        }
+
+        // Find unspent notes and update estimated size
+        for (const SproutNoteEntry& entry : sproutEntries) {
+            noteCounter++;
+            CAmount nValue = entry.note.value();
+
+            if (!maxedOutNotesFlag) {
+                // If we haven't added any notes yet and the merge is to a
+                // z-address, we have already accounted for the first JoinSplit.
+                size_t increase = (sproutNoteInputs.empty() && !isToSproutZaddr) || (sproutNoteInputs.size() % 2 == 0) ?
+                    JOINSPLIT_SIZE(SAPLING_TX_VERSION) : 0;
+                if (estimatedTxSize + increase >= max_tx_size ||
+                    (sproutNoteLimit > 0 && noteCounter > sproutNoteLimit))
+                {
+                    maxedOutNotesFlag = true;
+                } else {
+                    estimatedTxSize += increase;
+                    auto zaddr = entry.address;
+                    SproutSpendingKey zkey;
+                    pwalletMain->GetSproutSpendingKey(zaddr, zkey);
+                    sproutNoteInputs.emplace_back(entry.jsop, entry.note, nValue, zkey);
+                    mergedNoteValue += nValue;
+                }
+            }
+
+            if (maxedOutNotesFlag) {
+                remainingNoteValue += nValue;
+            }
+        }
+
+        for (const SaplingNoteEntry& entry : saplingEntries) {
+            noteCounter++;
+            CAmount nValue = entry.note.value();
+            if (!maxedOutNotesFlag) {
+                size_t increase = SPENDDESCRIPTION_SIZE;
+                if (estimatedTxSize + increase >= max_tx_size ||
+                    (saplingNoteLimit > 0 && noteCounter > saplingNoteLimit))
+                {
+                    maxedOutNotesFlag = true;
+                } else {
+                    estimatedTxSize += increase;
+                    libzcash::SaplingExtendedSpendingKey extsk;
+                    if (!pwalletMain->GetSaplingExtendedSpendingKey(entry.address, extsk)) {
+                        throw JSONRPCError(RPC_INVALID_PARAMETER, "Could not find spending key for payment address.");
+                    }
+                    saplingNoteInputs.emplace_back(entry.op, entry.note, nValue, extsk.expsk);
+                    mergedNoteValue += nValue;
+                }
+            }
+
+            if (maxedOutNotesFlag) {
+                remainingNoteValue += nValue;
+            }
+        }
+    }
+
+    size_t numUtxos = utxoInputs.size();
+    size_t numNotes = sproutNoteInputs.size() + saplingNoteInputs.size();
+
+    if (numUtxos == 0 && numNotes == 0) {
+        throw JSONRPCError(RPC_WALLET_INSUFFICIENT_FUNDS, "Could not find any funds to merge.");
+    }
+
+    // Sanity check: Don't do anything if:
+    // - We only have one from address
+    // - It's equal to toaddress
+    // - The address only contains a single UTXO or note
+    if (setAddress.size() == 1 && setAddress.count(destStr) && (numUtxos + numNotes) == 1) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, "Destination address is also the only source address, and all its funds are already merged.");
+    }
+
+    CAmount mergedValue = mergedUTXOValue + mergedNoteValue;
+    if (mergedValue < nFee) {
+        throw JSONRPCError(RPC_WALLET_INSUFFICIENT_FUNDS,
+            strprintf("Insufficient funds, have %s, which is less than miners fee %s",
+            FormatMoney(mergedValue), FormatMoney(nFee)));
+    }
+
+    // Check that the user specified fee is sane (if too high, it can result in error -25 absurd fee)
+    CAmount netAmount = mergedValue - nFee;
+    if (nFee > netAmount) {
+        throw JSONRPCError(RPC_INVALID_PARAMETER, strprintf("Fee %s is greater than the net amount to be shielded %s", FormatMoney(nFee), FormatMoney(netAmount)));
+    }
+
+    // Keep record of parameters in context object
+    UniValue contextInfo(UniValue::VOBJ);
+    contextInfo.pushKV("fromaddresses", params[0]);
+    contextInfo.pushKV("toaddress", params[1]);
+    contextInfo.pushKV("fee", ValueFromAmount(nFee));
+
+    if (!sproutNoteInputs.empty() || !saplingNoteInputs.empty() || !isToTaddr) {
+        // We have shielded inputs or the recipient is a shielded address, and
+        // therefore we cannot create transactions before Sapling activates.
+        if (!saplingActive) {
+            throw JSONRPCError(
+                RPC_INVALID_PARAMETER, "Cannot create shielded transactions before Sapling has activated");
+        }
+    }
+
+    bool isSproutShielded = sproutNoteInputs.size() > 0 || isToSproutZaddr;
+    // Contextual transaction we will build on
+    CMutableTransaction contextualTx = CreateNewContextualCMutableTransaction(
+        Params().GetConsensus(),
+        nextBlockHeight,
+        isSproutShielded);
+    if (contextualTx.nVersion == 1 && isSproutShielded) {
+        contextualTx.nVersion = 2; // Tx format should support vJoinSplit
+    }
+
+    // Builder (used if Sapling addresses are involved)
+    std::optional<TransactionBuilder> builder;
+    if (isToSaplingZaddr || saplingNoteInputs.size() > 0) {
+        std::optional<uint256> orchardAnchor;
+        if (!isSproutShielded) {
+            // Allow Orchard recipients by setting an Orchard anchor.
+            // TODO: Add an orchardAnchorHeight field to ZTXOSelector so we can ensure the
+            // same anchor is used for witnesses of any selected Orchard note.
+            auto orchardAnchorHeight = nextBlockHeight - nAnchorConfirmations;
+            if (Params().GetConsensus().NetworkUpgradeActive(orchardAnchorHeight, Consensus::UPGRADE_NU5)) {
+                orchardAnchor = chainActive[orchardAnchorHeight]->hashFinalOrchardRoot;
+            }
+        }
+        builder = TransactionBuilder(Params().GetConsensus(), nextBlockHeight, orchardAnchor, pwalletMain);
+    }
+    // Create operation and add to global queue
+    std::shared_ptr<AsyncRPCQueue> q = getAsyncRPCQueue();
+    std::shared_ptr<AsyncRPCOperation> operation(
+        new AsyncRPCOperation_mergetoaddress(
+            std::move(builder), contextualTx, utxoInputs, sproutNoteInputs, saplingNoteInputs, recipient, nFee, contextInfo) );
+    q->addOperation(operation);
+    AsyncRPCOperationId operationId = operation->getId();
+
+    // Return continuation information
+    UniValue o(UniValue::VOBJ);
+    o.pushKV("remainingUTXOs", static_cast<uint64_t>(utxoCounter - numUtxos));
+    o.pushKV("remainingTransparentValue", ValueFromAmount(remainingUTXOValue));
+    o.pushKV("remainingNotes", static_cast<uint64_t>(noteCounter - numNotes));
+    o.pushKV("remainingShieldedValue", ValueFromAmount(remainingNoteValue));
+    o.pushKV("mergingUTXOs", static_cast<uint64_t>(numUtxos));
+    o.pushKV("mergingTransparentValue", ValueFromAmount(mergedUTXOValue));
+    o.pushKV("mergingNotes", static_cast<uint64_t>(numNotes));
+    o.pushKV("mergingShieldedValue", ValueFromAmount(mergedNoteValue));
+    o.pushKV("opid", operationId);
+    return o;
+}
+
+
+UniValue z_listoperationids(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() > 1)
+        throw runtime_error(
+            "z_listoperationids\n"
+            "\nReturns the list of operation ids currently known to the wallet.\n"
+            "\nArguments:\n"
+            "1. \"status\"         (string, optional) Filter result by the operation's state e.g. \"success\".\n"
+            "\nResult:\n"
+            "[                     (json array of string)\n"
+            "  \"operationid\"       (string) an operation id belonging to the wallet\n"
+            "  ,...\n"
+            "]\n"
+            "\nExamples:\n"
+            + HelpExampleCli("z_listoperationids", "")
+            + HelpExampleRpc("z_listoperationids", "")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    std::string filter;
+    bool useFilter = false;
+    if (params.size()==1) {
+        filter = params[0].get_str();
+        useFilter = true;
+    }
+
+    UniValue ret(UniValue::VARR);
+    std::shared_ptr<AsyncRPCQueue> q = getAsyncRPCQueue();
+    std::vector<AsyncRPCOperationId> ids = q->getAllOperationIds();
+    for (auto id : ids) {
+        std::shared_ptr<AsyncRPCOperation> operation = q->getOperationForId(id);
+        if (!operation) {
+            continue;
+        }
+        std::string state = operation->getStateAsString();
+        if (useFilter && filter.compare(state)!=0)
+            continue;
+        ret.push_back(id);
+    }
+
+    return ret;
+}
+
+
+UniValue z_getnotescount(const UniValue& params, bool fHelp)
+{
+    if (!EnsureWalletIsAvailable(fHelp))
+        return NullUniValue;
+
+    if (fHelp || params.size() > 1)
+        throw runtime_error(
+            "z_getnotescount\n"
+            "\nArguments:\n"
+            "1. minconf      (numeric, optional, default=1) Only include notes in transactions confirmed at least this many times.\n"
+            "\nReturns the number of notes available in the wallet for each shielded value pool.\n"
+            "\nResult:\n"
+            "{\n"
+            "  \"sprout\"      (numeric) the number of Sprout notes in the wallet\n"
+            "  \"sapling\"     (numeric) the number of Sapling notes in the wallet\n"
+            "  \"orchard\"     (numeric) the number of Orchard notes in the wallet\n"
+            "}\n"
+            "\nExamples:\n"
+            + HelpExampleCli("z_getnotescount", "0")
+            + HelpExampleRpc("z_getnotescount", "0")
+        );
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    int nMinDepth = 1;
+    if (params.size() > 0)
+        nMinDepth = params[0].get_int();
+
+    int sprout = 0;
+    int sapling = 0;
+    int orchard = 0;
+    for (auto& wtx : pwalletMain->mapWallet) {
+        if (wtx.second.GetDepthInMainChain() >= nMinDepth) {
+            sprout += wtx.second.mapSproutNoteData.size();
+            sapling += wtx.second.mapSaplingNoteData.size();
+            orchard += wtx.second.orchardTxMeta.GetMyActionIVKs().size();
+        }
+    }
+    UniValue ret(UniValue::VOBJ);
+    ret.pushKV("sprout", sprout);
+    ret.pushKV("sapling", sapling);
+    ret.pushKV("orchard", orchard);
+
+    return ret;
+}
+
+extern UniValue dumpprivkey(const UniValue& params, bool fHelp); // in rpcdump.cpp
+extern UniValue importprivkey(const UniValue& params, bool fHelp);
+extern UniValue importaddress(const UniValue& params, bool fHelp);
+extern UniValue importpubkey(const UniValue& params, bool fHelp);
+extern UniValue dumpwallet(const UniValue& params, bool fHelp);
+extern UniValue importwallet(const UniValue& params, bool fHelp);
+extern UniValue z_exportkey(const UniValue& params, bool fHelp);
+extern UniValue z_importkey(const UniValue& params, bool fHelp);
+extern UniValue z_exportviewingkey(const UniValue& params, bool fHelp);
+extern UniValue z_importviewingkey(const UniValue& params, bool fHelp);
+extern UniValue z_exportwallet(const UniValue& params, bool fHelp);
+extern UniValue z_importwallet(const UniValue& params, bool fHelp);
+
+extern UniValue z_getpaymentdisclosure(const UniValue& params, bool fHelp); // in rpcdisclosure.cpp
+extern UniValue z_validatepaymentdisclosure(const UniValue &params, bool fHelp);
+
+static const CRPCCommand commands[] =
+{ //  category              name                        actor (function)           okSafeMode
+    //  --------------------- ------------------------    -----------------------    ----------
+    { "rawtransactions",    "fundrawtransaction",       &fundrawtransaction,       false },
+    { "hidden",             "resendwallettransactions", &resendwallettransactions, true  },
+    { "wallet",             "addmultisigaddress",       &addmultisigaddress,       true  },
+    { "wallet",             "backupwallet",             &backupwallet,             true  },
+    { "wallet",             "dumpprivkey",              &dumpprivkey,              true  },
+    { "wallet",             "dumpwallet",               &dumpwallet,               true  },
+    { "wallet",             "encryptwallet",            &encryptwallet,            true  },
+    { "wallet",             "getbalance",               &getbalance,               false },
+    { "wallet",             "getnewaddress",            &getnewaddress,            true  },
+    { "wallet",             "getrawchangeaddress",      &getrawchangeaddress,      true  },
+    { "wallet",             "getreceivedbyaddress",     &getreceivedbyaddress,     false },
+    { "wallet",             "gettransaction",           &gettransaction,           false },
+    { "wallet",             "getunconfirmedbalance",    &getunconfirmedbalance,    false },
+    { "wallet",             "getwalletinfo",            &getwalletinfo,            false },
+    { "wallet",             "importprivkey",            &importprivkey,            true  },
+    { "wallet",             "importwallet",             &importwallet,             true  },
+    { "wallet",             "importaddress",            &importaddress,            true  },
+    { "wallet",             "importpubkey",             &importpubkey,             true  },
+    { "wallet",             "keypoolrefill",            &keypoolrefill,            true  },
+    { "wallet",             "listaddresses",            &listaddresses,            true  },
+    { "wallet",             "listaddressgroupings",     &listaddressgroupings,     false },
+    { "wallet",             "listlockunspent",          &listlockunspent,          false },
+    { "wallet",             "listreceivedbyaddress",    &listreceivedbyaddress,    false },
+    { "wallet",             "listsinceblock",           &listsinceblock,           false },
+    { "wallet",             "listtransactions",         &listtransactions,         false },
+    { "wallet",             "listunspent",              &listunspent,              false },
+    { "wallet",             "lockunspent",              &lockunspent,              true  },
+    { "wallet",             "sendmany",                 &sendmany,                 false },
+    { "wallet",             "sendtoaddress",            &sendtoaddress,            false },
+    { "wallet",             "settxfee",                 &settxfee,                 true  },
+    { "wallet",             "signmessage",              &signmessage,              true  },
+    { "wallet",             "walletlock",               &walletlock,               true  },
+    { "wallet",             "walletpassphrasechange",   &walletpassphrasechange,   true  },
+    { "wallet",             "walletpassphrase",         &walletpassphrase,         true  },
+    { "wallet",             "walletconfirmbackup",      &walletconfirmbackup,      true  },
+    { "wallet",             "zcbenchmark",              &zc_benchmark,             true  },
+    { "wallet",             "zcrawkeygen",              &zc_raw_keygen,            true  },
+    { "wallet",             "zcrawjoinsplit",           &zc_raw_joinsplit,         true  },
+    { "wallet",             "zcrawreceive",             &zc_raw_receive,           true  },
+    { "wallet",             "zcsamplejoinsplit",        &zc_sample_joinsplit,      true  },
+    { "wallet",             "z_listreceivedbyaddress",  &z_listreceivedbyaddress,  false },
+    { "wallet",             "z_listunspent",            &z_listunspent,            false },
+    { "wallet",             "z_getbalance",             &z_getbalance,             false },
+    { "wallet",             "z_gettotalbalance",        &z_gettotalbalance,        false },
+    { "wallet",             "z_getbalanceforviewingkey",&z_getbalanceforviewingkey,false },
+    { "wallet",             "z_getbalanceforaccount",   &z_getbalanceforaccount,   false },
+    { "wallet",             "z_mergetoaddress",         &z_mergetoaddress,         false },
+    { "wallet",             "z_sendmany",               &z_sendmany,               false },
+    { "wallet",             "z_setmigration",           &z_setmigration,           false },
+    { "wallet",             "z_getmigrationstatus",     &z_getmigrationstatus,     false },
+    { "wallet",             "z_shieldcoinbase",         &z_shieldcoinbase,         false },
+    { "wallet",             "z_getoperationstatus",     &z_getoperationstatus,     true  },
+    { "wallet",             "z_getoperationresult",     &z_getoperationresult,     true  },
+    { "wallet",             "z_listoperationids",       &z_listoperationids,       true  },
+    { "wallet",             "z_getnewaddress",          &z_getnewaddress,          true  },
+    { "wallet",             "z_getnewaccount",          &z_getnewaccount,          true  },
+    { "wallet",             "z_listaccounts",           &z_listaccounts,           true  },
+    { "wallet",             "z_listaddresses",          &z_listaddresses,          true  },
+    { "wallet",             "z_listunifiedreceivers",   &z_listunifiedreceivers,   true  },
+    { "wallet",             "z_getaddressforaccount",   &z_getaddressforaccount,   true  },
+    { "wallet",             "z_exportkey",              &z_exportkey,              true  },
+    { "wallet",             "z_importkey",              &z_importkey,              true  },
+    { "wallet",             "z_exportviewingkey",       &z_exportviewingkey,       true  },
+    { "wallet",             "z_importviewingkey",       &z_importviewingkey,       true  },
+    { "wallet",             "z_exportwallet",           &z_exportwallet,           true  },
+    { "wallet",             "z_importwallet",           &z_importwallet,           true  },
+    { "wallet",             "z_viewtransaction",        &z_viewtransaction,        false },
+    { "wallet",             "z_getnotescount",          &z_getnotescount,          false },
+    // TODO: rearrange into another category
+    { "disclosure",         "z_getpaymentdisclosure",   &z_getpaymentdisclosure,   true  },
+    { "disclosure",         "z_validatepaymentdisclosure", &z_validatepaymentdisclosure, true }
+};
+
+void RegisterWalletRPCCommands(CRPCTable &tableRPC)
+{
+    for (unsigned int vcidx = 0; vcidx < ARRAYLEN(commands); vcidx++)
+        tableRPC.appendCommand(commands[vcidx].name, &commands[vcidx]);
+}
diff --git a/depend/zcash/src/wallet/rpcwallet.h b/depend/zcash/src/wallet/rpcwallet.h
new file mode 100644
index 000000000..3eb5ffb77
--- /dev/null
+++ b/depend/zcash/src/wallet/rpcwallet.h
@@ -0,0 +1,14 @@
+// Copyright (c) 2016 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_WALLET_RPCWALLET_H
+#define BITCOIN_WALLET_RPCWALLET_H
+
+#include "policy/fees.h"  // for DEFAULT_FEE
+
+class CRPCTable;
+
+void RegisterWalletRPCCommands(CRPCTable &tableRPC);
+
+#endif //BITCOIN_WALLET_RPCWALLET_H
diff --git a/depend/zcash/src/wallet/test/crypto_tests.cpp b/depend/zcash/src/wallet/test/crypto_tests.cpp
new file mode 100644
index 000000000..0c0844e67
--- /dev/null
+++ b/depend/zcash/src/wallet/test/crypto_tests.cpp
@@ -0,0 +1,127 @@
+// Copyright (c) 2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "test/test_random.h"
+#include "utilstrencodings.h"
+#include "test/test_bitcoin.h"
+#include "wallet/crypter.h"
+
+#include <vector>
+
+#include <boost/test/unit_test.hpp>
+
+BOOST_FIXTURE_TEST_SUITE(wallet_crypto, BasicTestingSetup)
+
+class TestCrypter
+{
+public:
+static void TestPassphraseSingle(const std::vector<unsigned char>& vchSalt, const SecureString& passphrase, uint32_t rounds,
+                 const std::vector<unsigned char>& correctKey = std::vector<unsigned char>(),
+                 const std::vector<unsigned char>& correctIV=std::vector<unsigned char>())
+{
+    CCrypter crypt;
+    crypt.SetKeyFromPassphrase(passphrase, vchSalt, rounds, 0);
+
+    if(!correctKey.empty())
+        BOOST_CHECK_MESSAGE(memcmp(crypt.vchKey.data(), correctKey.data(), crypt.vchKey.size()) == 0, \
+            HexStr(crypt.vchKey.begin(), crypt.vchKey.end()) + std::string(" != ") + HexStr(correctKey.begin(), correctKey.end()));
+    if(!correctIV.empty())
+        BOOST_CHECK_MESSAGE(memcmp(crypt.vchIV.data(), correctIV.data(), crypt.vchIV.size()) == 0,
+            HexStr(crypt.vchIV.begin(), crypt.vchIV.end()) + std::string(" != ") + HexStr(correctIV.begin(), correctIV.end()));
+}
+
+static void TestPassphrase(const std::vector<unsigned char>& vchSalt, const SecureString& passphrase, uint32_t rounds,
+                 const std::vector<unsigned char>& correctKey = std::vector<unsigned char>(),
+                 const std::vector<unsigned char>& correctIV=std::vector<unsigned char>())
+{
+    TestPassphraseSingle(vchSalt, passphrase, rounds, correctKey, correctIV);
+    for(SecureString::const_iterator i(passphrase.begin()); i != passphrase.end(); ++i)
+        TestPassphraseSingle(vchSalt, SecureString(i, passphrase.end()), rounds);
+}
+
+static void TestDecrypt(const CCrypter& crypt, const std::vector<unsigned char>& vchCiphertext, \
+                        const std::vector<unsigned char>& vchPlaintext = std::vector<unsigned char>())
+{
+    CKeyingMaterial vchDecrypted;
+    crypt.Decrypt(vchCiphertext, vchDecrypted);
+    if (vchPlaintext.size())
+        BOOST_CHECK(CKeyingMaterial(vchPlaintext.begin(), vchPlaintext.end()) == vchDecrypted);
+}
+
+static void TestEncryptSingle(const CCrypter& crypt, const CKeyingMaterial& vchPlaintext,
+                       const std::vector<unsigned char>& vchCiphertextCorrect = std::vector<unsigned char>())
+{
+    std::vector<unsigned char> vchCiphertext;
+    crypt.Encrypt(vchPlaintext, vchCiphertext);
+
+    if (!vchCiphertextCorrect.empty())
+        BOOST_CHECK(vchCiphertext == vchCiphertextCorrect);
+
+    const std::vector<unsigned char> vchPlaintext2(vchPlaintext.begin(), vchPlaintext.end());
+    TestDecrypt(crypt, vchCiphertext, vchPlaintext2);
+}
+
+static void TestEncrypt(const CCrypter& crypt, const std::vector<unsigned char>& vchPlaintextIn, \
+                       const std::vector<unsigned char>& vchCiphertextCorrect = std::vector<unsigned char>())
+{
+    TestEncryptSingle(crypt, CKeyingMaterial(vchPlaintextIn.begin(), vchPlaintextIn.end()), vchCiphertextCorrect);
+    for(std::vector<unsigned char>::const_iterator i(vchPlaintextIn.begin()); i != vchPlaintextIn.end(); ++i)
+        TestEncryptSingle(crypt, CKeyingMaterial(i, vchPlaintextIn.end()));
+}
+
+};
+
+BOOST_AUTO_TEST_CASE(passphrase) {
+    // These are expensive.
+
+    TestCrypter::TestPassphrase(ParseHex("0000deadbeef0000"), "test", 25000, \
+                                ParseHex("fc7aba077ad5f4c3a0988d8daa4810d0d4a0e3bcb53af662998898f33df0556a"), \
+                                ParseHex("cf2f2691526dd1aa220896fb8bf7c369"));
+
+    std::string hash(GetRandHash().ToString());
+    std::vector<unsigned char> vchSalt(8);
+    GetRandBytes(&vchSalt[0], vchSalt.size());
+    uint32_t rounds = insecure_rand();
+    if (rounds > 30000)
+        rounds = 30000;
+    TestCrypter::TestPassphrase(vchSalt, SecureString(hash.begin(), hash.end()), rounds);
+}
+
+BOOST_AUTO_TEST_CASE(encrypt) {
+    std::vector<unsigned char> vchSalt = ParseHex("0000deadbeef0000");
+    BOOST_CHECK(vchSalt.size() == WALLET_CRYPTO_SALT_SIZE);
+    CCrypter crypt;
+    crypt.SetKeyFromPassphrase("passphrase", vchSalt, 25000, 0);
+    TestCrypter::TestEncrypt(crypt, ParseHex("22bcade09ac03ff6386914359cfe885cfeb5f77ff0d670f102f619687453b29d"));
+
+    for (int i = 0; i != 100; i++)
+    {
+        uint256 hash(GetRandHash());
+        TestCrypter::TestEncrypt(crypt, std::vector<unsigned char>(hash.begin(), hash.end()));
+    }
+
+}
+
+BOOST_AUTO_TEST_CASE(decrypt) {
+    std::vector<unsigned char> vchSalt = ParseHex("0000deadbeef0000");
+    BOOST_CHECK(vchSalt.size() == WALLET_CRYPTO_SALT_SIZE);
+    CCrypter crypt;
+    crypt.SetKeyFromPassphrase("passphrase", vchSalt, 25000, 0);
+
+    // Some corner cases the came up while testing
+    TestCrypter::TestDecrypt(crypt,ParseHex("795643ce39d736088367822cdc50535ec6f103715e3e48f4f3b1a60a08ef59ca"));
+    TestCrypter::TestDecrypt(crypt,ParseHex("de096f4a8f9bd97db012aa9d90d74de8cdea779c3ee8bc7633d8b5d6da703486"));
+    TestCrypter::TestDecrypt(crypt,ParseHex("32d0a8974e3afd9c6c3ebf4d66aa4e6419f8c173de25947f98cf8b7ace49449c"));
+    TestCrypter::TestDecrypt(crypt,ParseHex("e7c055cca2faa78cb9ac22c9357a90b4778ded9b2cc220a14cea49f931e596ea"));
+    TestCrypter::TestDecrypt(crypt,ParseHex("b88efddd668a6801d19516d6830da4ae9811988ccbaf40df8fbb72f3f4d335fd"));
+    TestCrypter::TestDecrypt(crypt,ParseHex("8cae76aa6a43694e961ebcb28c8ca8f8540b84153d72865e8561ddd93fa7bfa9"));
+
+    for (int i = 0; i != 100; i++)
+    {
+        uint256 hash(GetRandHash());
+        TestCrypter::TestDecrypt(crypt, std::vector<unsigned char>(hash.begin(), hash.end()));
+    }
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/wallet/test/rpc_wallet_tests.cpp b/depend/zcash/src/wallet/test/rpc_wallet_tests.cpp
new file mode 100644
index 000000000..374eafec2
--- /dev/null
+++ b/depend/zcash/src/wallet/test/rpc_wallet_tests.cpp
@@ -0,0 +1,1766 @@
+// Copyright (c) 2013-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "rpc/server.h"
+#include "rpc/client.h"
+
+#include "fs.h"
+#include "key_io.h"
+#include "main.h"
+#include "wallet/wallet.h"
+
+#include "zcash/Address.hpp"
+
+#include "asyncrpcqueue.h"
+#include "asyncrpcoperation.h"
+#include "wallet/asyncrpcoperation_common.h"
+#include "wallet/asyncrpcoperation_mergetoaddress.h"
+#include "wallet/asyncrpcoperation_sendmany.h"
+#include "wallet/asyncrpcoperation_shieldcoinbase.h"
+
+#include "init.h"
+#include "utiltest.h"
+
+#include "test/test_bitcoin.h"
+#include "test/test_util.h"
+#include "wallet/test/wallet_test_fixture.h"
+
+#include <array>
+#include <chrono>
+#include <optional>
+#include <thread>
+#include <variant>
+
+#include <fstream>
+#include <unordered_set>
+
+#include <boost/algorithm/string.hpp>
+#include <boost/test/unit_test.hpp>
+#include <boost/format.hpp>
+
+#include <univalue.h>
+
+using namespace std;
+
+extern CWallet* pwalletMain;
+
+namespace {
+
+bool find_error(const UniValue& objError, const std::string& expected) {
+    return find_value(objError, "message").get_str().find(expected) != string::npos;
+}
+
+/** Set the working directory for the duration of the scope. */
+class PushCurrentDirectory {
+public:
+    PushCurrentDirectory(const std::string &new_cwd)
+        : old_cwd(fs::current_path()) {
+        fs::current_path(new_cwd);
+    }
+
+    ~PushCurrentDirectory() {
+        fs::current_path(old_cwd);
+    }
+private:
+    fs::path old_cwd;
+};
+
+}
+
+static UniValue ValueFromString(const std::string &str)
+{
+    UniValue value;
+    BOOST_CHECK(value.setNumStr(str));
+    return value;
+}
+
+static SaplingPaymentAddress DefaultSaplingAddress(CWallet* pwallet) {
+    auto usk = pwallet->GenerateUnifiedSpendingKeyForAccount(0);
+
+    return usk.value()
+        .ToFullViewingKey()
+        .GetSaplingKey().value()
+        .FindAddress(libzcash::diversifier_index_t(0)).first;
+}
+
+BOOST_FIXTURE_TEST_SUITE(rpc_wallet_tests, WalletTestingSetup)
+
+BOOST_AUTO_TEST_CASE(rpc_addmultisig)
+{
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    rpcfn_type addmultisig = tableRPC["addmultisigaddress"]->actor;
+
+    // old, 65-byte-long:
+    const char address1Hex[] = "0434e3e09f49ea168c5bbf53f877ff4206923858aab7c7e1df25bc263978107c95e35065a27ef6f1b27222db0ec97e0e895eaca603d3ee0d4c060ce3d8a00286c8";
+    // new, compressed:
+    const char address2Hex[] = "0388c2037017c62240b6b72ac1a2a5f94da790596ebd06177c8572752922165cb4";
+
+    KeyIO keyIO(Params());
+    UniValue v;
+    CTxDestination address;
+    BOOST_CHECK_NO_THROW(v = addmultisig(createArgs(1, address1Hex), false));
+    address = keyIO.DecodeDestination(v.get_str());
+    BOOST_CHECK(IsValidDestination(address) && IsScriptDestination(address));
+
+    BOOST_CHECK_NO_THROW(v = addmultisig(createArgs(1, address1Hex, address2Hex), false));
+    address = keyIO.DecodeDestination(v.get_str());
+    BOOST_CHECK(IsValidDestination(address) && IsScriptDestination(address));
+
+    BOOST_CHECK_NO_THROW(v = addmultisig(createArgs(2, address1Hex, address2Hex), false));
+    address = keyIO.DecodeDestination(v.get_str());
+    BOOST_CHECK(IsValidDestination(address) && IsScriptDestination(address));
+
+    BOOST_CHECK_THROW(addmultisig(createArgs(0), false), runtime_error);
+    BOOST_CHECK_THROW(addmultisig(createArgs(1), false), runtime_error);
+    BOOST_CHECK_THROW(addmultisig(createArgs(2, address1Hex), false), runtime_error);
+
+    BOOST_CHECK_THROW(addmultisig(createArgs(1, ""), false), runtime_error);
+    BOOST_CHECK_THROW(addmultisig(createArgs(1, "NotAValidPubkey"), false), runtime_error);
+
+    string short1(address1Hex, address1Hex + sizeof(address1Hex) - 2); // last byte missing
+    BOOST_CHECK_THROW(addmultisig(createArgs(2, short1.c_str()), false), runtime_error);
+
+    string short2(address1Hex + 1, address1Hex + sizeof(address1Hex)); // first byte missing
+    BOOST_CHECK_THROW(addmultisig(createArgs(2, short2.c_str()), false), runtime_error);
+}
+
+BOOST_AUTO_TEST_CASE(rpc_wallet)
+{
+    // Test RPC calls for various wallet statistics
+    KeyIO keyIO(Params());
+    UniValue r;
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    CPubKey demoPubkey = pwalletMain->GenerateNewKey(true);
+    CTxDestination demoAddress(CTxDestination(demoPubkey.GetID()));
+    UniValue retValue;
+    string strPurpose = "receive";
+    BOOST_CHECK_NO_THROW({ /*Initialize Wallet with the demo pubkey*/
+        CWalletDB walletdb(pwalletMain->strWalletFile);
+        pwalletMain->SetAddressBook(demoPubkey.GetID(), "", strPurpose);
+    });
+
+    CPubKey setaccountDemoPubkey = pwalletMain->GenerateNewKey(true);
+    CTxDestination setaccountDemoAddress(CTxDestination(setaccountDemoPubkey.GetID()));
+
+    /*********************************
+     *                  getbalance
+     *********************************/
+    BOOST_CHECK_NO_THROW(CallRPC("getbalance"));
+    BOOST_CHECK_THROW(CallRPC("getbalance " + keyIO.EncodeDestination(demoAddress)), runtime_error);
+
+    /*********************************
+     * 			listunspent
+     *********************************/
+    BOOST_CHECK_NO_THROW(CallRPC("listunspent"));
+    BOOST_CHECK_THROW(CallRPC("listunspent string"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("listunspent 0 string"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("listunspent 0 1 not_array"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("listunspent 0 1 [] extra"), runtime_error);
+    BOOST_CHECK_NO_THROW(r = CallRPC("listunspent 0 1 []"));
+    BOOST_CHECK(r.get_array().empty());
+
+    /*********************************
+     * 		listreceivedbyaddress
+     *********************************/
+    BOOST_CHECK_NO_THROW(CallRPC("listreceivedbyaddress"));
+    BOOST_CHECK_NO_THROW(CallRPC("listreceivedbyaddress 0"));
+    BOOST_CHECK_THROW(CallRPC("listreceivedbyaddress not_int"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("listreceivedbyaddress 0 not_bool"), runtime_error);
+    BOOST_CHECK_NO_THROW(CallRPC("listreceivedbyaddress 0 true"));
+    BOOST_CHECK_THROW(CallRPC("listreceivedbyaddress 0 true extra"), runtime_error);
+
+    /*********************************
+     *          listsinceblock
+     *********************************/
+    BOOST_CHECK_NO_THROW(CallRPC("listsinceblock"));
+
+    /*********************************
+     *          listtransactions
+     *********************************/
+    BOOST_CHECK_NO_THROW(CallRPC("listtransactions"));
+    BOOST_CHECK_NO_THROW(CallRPC("listtransactions *"));
+    BOOST_CHECK_NO_THROW(CallRPC("listtransactions * 20"));
+    BOOST_CHECK_NO_THROW(CallRPC("listtransactions * 20 0"));
+    BOOST_CHECK_THROW(CallRPC("listtransactions " + keyIO.EncodeDestination(demoAddress) + " not_int"), runtime_error);
+
+    /*********************************
+     *          listlockunspent
+     *********************************/
+    BOOST_CHECK_NO_THROW(CallRPC("listlockunspent"));
+
+    /*********************************
+     *          listaddressgroupings
+     *********************************/
+    BOOST_CHECK_NO_THROW(CallRPC("listaddressgroupings"));
+
+    /*********************************
+     * 		walletconfirmbackup
+     *********************************/
+    BOOST_CHECK_THROW(CallRPC(string("walletconfirmbackup \"badmnemonic\"")), runtime_error);
+
+    /*********************************
+     * 		getrawchangeaddress
+     *********************************/
+    BOOST_CHECK_NO_THROW(CallRPC("getrawchangeaddress"));
+
+    /*********************************
+     * 		getnewaddress
+     *********************************/
+    BOOST_CHECK_NO_THROW(CallRPC("getnewaddress"));
+
+    /*********************************
+     * 	signmessage + verifymessage
+     *********************************/
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("signmessage " + keyIO.EncodeDestination(demoAddress) + " mymessage"));
+    BOOST_CHECK_THROW(CallRPC("signmessage"), runtime_error);
+    /* Should throw error because this address is not loaded in the wallet */
+    BOOST_CHECK_THROW(CallRPC("signmessage t1h8SqgtM3QM5e2M8EzhhT1yL2PXXtA6oqe mymessage"), runtime_error);
+
+    /* missing arguments */
+    BOOST_CHECK_THROW(CallRPC("verifymessage " + keyIO.EncodeDestination(demoAddress)), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("verifymessage " + keyIO.EncodeDestination(demoAddress) + " " + retValue.get_str()), runtime_error);
+    /* Illegal address */
+    BOOST_CHECK_THROW(CallRPC("verifymessage t1VtArtnn1dGPiD2WFfMXYXW5mHM3q1Gpg " + retValue.get_str() + " mymessage"), runtime_error);
+    /* wrong address */
+    BOOST_CHECK(CallRPC("verifymessage t1VtArtnn1dGPiD2WFfMXYXW5mHM3q1GpgV " + retValue.get_str() + " mymessage").get_bool() == false);
+    /* Correct address and signature but wrong message */
+    BOOST_CHECK(CallRPC("verifymessage " + keyIO.EncodeDestination(demoAddress) + " " + retValue.get_str() + " wrongmessage").get_bool() == false);
+    /* Correct address, message and signature*/
+    BOOST_CHECK(CallRPC("verifymessage " + keyIO.EncodeDestination(demoAddress) + " " + retValue.get_str() + " mymessage").get_bool() == true);
+
+    /*********************************
+     * 		listaddresses
+     *********************************/
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("listaddresses"));
+    UniValue arr = retValue.get_array();
+    {
+        BOOST_CHECK_EQUAL(1, arr.size());
+        bool notFound = true;
+        for (auto a : arr.getValues()) {
+            auto source = find_value(a.get_obj(), "source");
+            if (source.get_str() == "mnemonic_seed") {
+                auto t_obj = find_value(a.get_obj(), "transparent");
+                auto addrs = find_value(t_obj, "addresses").get_array();
+                BOOST_CHECK_EQUAL(2, addrs.size());
+                for (auto addr : addrs.getValues()) {
+                    notFound &= keyIO.DecodeDestination(addr.get_str()) != demoAddress;
+                }
+            }
+        }
+        BOOST_CHECK(!notFound);
+    }
+
+    /*********************************
+     * 	     fundrawtransaction
+     *********************************/
+    BOOST_CHECK_THROW(CallRPC("fundrawtransaction 28z"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("fundrawtransaction 01000000000180969800000000001976a91450ce0a4b0ee0ddeb633da85199728b940ac3fe9488ac00000000"), runtime_error);
+
+    /*
+     * getblocksubsidy
+     */
+    BOOST_CHECK_THROW(CallRPC("getblocksubsidy too many args"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("getblocksubsidy -1"), runtime_error);
+
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("getblocksubsidy 50000"));
+    UniValue obj = retValue.get_obj();
+    BOOST_CHECK_EQUAL(find_value(obj, "miner").get_real(), 10.0);
+    BOOST_CHECK_EQUAL(find_value(obj, "founders").get_real(), 2.5);
+    BOOST_CHECK(!obj.exists("fundingstreams"));
+
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("getblocksubsidy 653599")); // Blossom activation - 1
+    obj = retValue.get_obj();
+    BOOST_CHECK_EQUAL(find_value(obj, "miner").get_real(), 10.0);
+    BOOST_CHECK_EQUAL(find_value(obj, "founders").get_real(), 2.5);
+    BOOST_CHECK(!obj.exists("fundingstreams"));
+
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("getblocksubsidy 653600")); // Blossom activation
+    obj = retValue.get_obj();
+    BOOST_CHECK_EQUAL(find_value(obj, "miner").get_real(), 5.0);
+    BOOST_CHECK_EQUAL(find_value(obj, "founders").get_real(), 1.25);
+    BOOST_CHECK(!obj.exists("fundingstreams"));
+
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("getblocksubsidy 1046399"));
+    obj = retValue.get_obj();
+    BOOST_CHECK_EQUAL(find_value(obj, "miner").get_real(), 5.0);
+    BOOST_CHECK_EQUAL(find_value(obj, "founders").get_real(), 1.25);
+    BOOST_CHECK(!obj.exists("fundingstreams"));
+
+    auto check_funding_streams = [](UniValue obj, std::vector<std::string> recipients, std::vector<double> amounts, std::vector<std::string> addresses) {
+        size_t n = recipients.size();
+        BOOST_REQUIRE_EQUAL(amounts.size(), n);
+        UniValue fundingstreams = find_value(obj, "fundingstreams");
+        BOOST_CHECK_EQUAL(fundingstreams.size(), n);
+        if (fundingstreams.size() != n) return;
+
+        for (int i = 0; i < n; i++) {
+            UniValue fsobj = fundingstreams[i];
+            BOOST_CHECK_EQUAL(find_value(fsobj, "recipient").get_str(), recipients[i]);
+            BOOST_CHECK_EQUAL(find_value(fsobj, "specification").get_str(), "https://zips.z.cash/zip-0214");
+            BOOST_CHECK_EQUAL(find_value(fsobj, "value").get_real(), amounts[i]);
+            BOOST_CHECK_EQUAL(find_value(fsobj, "address").get_str(), addresses[i]);
+        }
+    };
+
+    bool canopyEnabled =
+        Params().GetConsensus().vUpgrades[Consensus::UPGRADE_CANOPY].nActivationHeight != Consensus::NetworkUpgrade::NO_ACTIVATION_HEIGHT;
+
+    // slow start + blossom activation + (pre blossom halving - blossom activation) * 2
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("getblocksubsidy 1046400"));
+    obj = retValue.get_obj();
+    BOOST_CHECK_EQUAL(find_value(obj, "miner").get_real(), canopyEnabled ? 2.5 : 3.125);
+    BOOST_CHECK_EQUAL(find_value(obj, "founders").get_real(), 0.0);
+    if (canopyEnabled) {
+        check_funding_streams(obj, {"Electric Coin Company", "Zcash Foundation", "Major Grants" },
+                                   { 0.21875,                 0.15625,            0.25          },
+                                   {
+                                       "t3LmX1cxWPPPqL4TZHx42HU3U5ghbFjRiif",
+                                       "t3dvVE3SQEi7kqNzwrfNePxZ1d4hUyztBA1",
+                                       "t3XyYW8yBFRuMnfvm5KLGFbEVz25kckZXym"
+                                   });
+    }
+
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("getblocksubsidy 2726399"));
+    obj = retValue.get_obj();
+    BOOST_CHECK_EQUAL(find_value(obj, "miner").get_real(), canopyEnabled ? 2.5 : 3.125);
+    BOOST_CHECK_EQUAL(find_value(obj, "founders").get_real(), 0.0);
+    if (canopyEnabled) {
+        check_funding_streams(obj, {"Electric Coin Company", "Zcash Foundation", "Major Grants" },
+                                   { 0.21875,                 0.15625,            0.25          },
+                                   {
+                                       "t3XHAGxRP2FNfhAjxGjxbrQPYtQQjc3RCQD",
+                                       "t3dvVE3SQEi7kqNzwrfNePxZ1d4hUyztBA1",
+                                       "t3XyYW8yBFRuMnfvm5KLGFbEVz25kckZXym"
+                                   });
+    }
+
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("getblocksubsidy 2726400"));
+    obj = retValue.get_obj();
+    BOOST_CHECK_EQUAL(find_value(obj, "miner").get_real(), 1.5625);
+    BOOST_CHECK_EQUAL(find_value(obj, "founders").get_real(), 0.0);
+    BOOST_CHECK(find_value(obj, "fundingstreams").empty());
+
+    /*
+     * getblock
+     */
+    BOOST_CHECK_THROW(CallRPC("getblock too many args"), runtime_error);
+    BOOST_CHECK_NO_THROW(CallRPC("getblock -1")); // negative heights relative are allowed
+    BOOST_CHECK_THROW(CallRPC("getblock -2147483647"), runtime_error); // allowed, but chain tip - height < 0
+    BOOST_CHECK_THROW(CallRPC("getblock 2147483647"), runtime_error); // allowed, but > height of active chain tip
+    BOOST_CHECK_THROW(CallRPC("getblock 2147483648"), runtime_error); // not allowed, > int32 used for nHeight
+    BOOST_CHECK_THROW(CallRPC("getblock 100badchars"), runtime_error);
+    BOOST_CHECK_NO_THROW(CallRPC("getblock 0"));
+    BOOST_CHECK_NO_THROW(CallRPC("getblock 0 0"));
+    BOOST_CHECK_NO_THROW(CallRPC("getblock 0 1"));
+    BOOST_CHECK_NO_THROW(CallRPC("getblock 0 2"));
+    BOOST_CHECK_THROW(CallRPC("getblock 0 -1"), runtime_error); // bad verbosity
+    BOOST_CHECK_THROW(CallRPC("getblock 0 3"), runtime_error); // bad verbosity
+
+    /*
+     * migration (sprout to sapling)
+     */
+    BOOST_CHECK_NO_THROW(CallRPC("z_setmigration true"));
+    BOOST_CHECK_NO_THROW(CallRPC("z_setmigration false"));
+    BOOST_CHECK_THROW(CallRPC("z_setmigration"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("z_setmigration nonboolean"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("z_setmigration 1"), runtime_error);
+}
+
+BOOST_AUTO_TEST_CASE(rpc_wallet_getbalance)
+{
+    SelectParams(CBaseChainParams::TESTNET);
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    UniValue retValue;
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("getnewaddress"));
+    std::string taddr1 = retValue.get_str();
+
+    BOOST_CHECK_THROW(CallRPC("z_getbalance too many args"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("z_getbalance invalidaddress"), runtime_error);
+    // address does not belong to wallet
+    BOOST_CHECK_THROW(CallRPC("z_getbalance tmC6YZnCUhm19dEXxh3Jb7srdBJxDawaCab"), runtime_error);
+    BOOST_CHECK_NO_THROW(CallRPC(std::string("z_getbalance ") + taddr1));
+    // negative minconf not allowed
+    BOOST_CHECK_THROW(CallRPC(std::string("z_getbalance ") + taddr1 + " -1"), runtime_error);
+    BOOST_CHECK_NO_THROW(CallRPC(std::string("z_getbalance ") + taddr1 + std::string(" 0")));
+    // don't have the spending key
+    BOOST_CHECK_THROW(CallRPC("z_getbalance tnRZ8bPq2pff3xBWhTJhNkVUkm2uhzksDeW5PvEa7aFKGT9Qi3YgTALZfjaY4jU3HLVKBtHdSXxoPoLA3naMPcHBcY88FcF 1"), runtime_error);
+
+    BOOST_CHECK_THROW(CallRPC("z_gettotalbalance too manyargs"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("z_gettotalbalance -1"), runtime_error);
+    BOOST_CHECK_NO_THROW(CallRPC("z_gettotalbalance 0"));
+
+    BOOST_CHECK_THROW(CallRPC("z_listreceivedbyaddress too many args"), runtime_error);
+    // negative minconf not allowed
+    BOOST_CHECK_THROW(CallRPC("z_listreceivedbyaddress tmC6YZnCUhm19dEXxh3Jb7srdBJxDawaCab -1"), runtime_error);
+    // don't have the spending key
+    BOOST_CHECK_THROW(CallRPC("z_listreceivedbyaddress tnRZ8bPq2pff3xBWhTJhNkVUkm2uhzksDeW5PvEa7aFKGT9Qi3YgTALZfjaY4jU3HLVKBtHdSXxoPoLA3naMPcHBcY88FcF 1"), runtime_error);
+}
+
+/**
+ * This test covers RPC command z_validateaddress
+ */
+BOOST_AUTO_TEST_CASE(rpc_wallet_z_validateaddress)
+{
+    SelectParams(CBaseChainParams::MAIN);
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    UniValue retValue;
+
+    // Check number of args
+    BOOST_CHECK_THROW(CallRPC("z_validateaddress"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("z_validateaddress toomany args"), runtime_error);
+
+    // Wallet should be empty
+    std::set<libzcash::SproutPaymentAddress> addrs;
+    pwalletMain->GetSproutPaymentAddresses(addrs);
+    BOOST_CHECK(addrs.size()==0);
+
+    // This address is not valid, it belongs to another network
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("z_validateaddress ztaaga95QAPyp1kSQ1hD2kguCpzyMHjxWZqaYDEkzbvo7uYQYAw2S8X4Kx98AvhhofMtQL8PAXKHuZsmhRcanavKRKmdCzk"));
+    UniValue resultObj = retValue.get_obj();
+    bool b = find_value(resultObj, "isvalid").get_bool();
+    BOOST_CHECK_EQUAL(b, false);
+
+    // This address is valid, but the spending key is not in this wallet
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("z_validateaddress zcfA19SDAKRYHLoRDoShcoz4nPohqWxuHcqg8WAxsiB2jFrrs6k7oSvst3UZvMYqpMNSRBkxBsnyjjngX5L55FxMzLKach8"));
+    resultObj = retValue.get_obj();
+    b = find_value(resultObj, "isvalid").get_bool();
+    BOOST_CHECK_EQUAL(b, true);
+    BOOST_CHECK_EQUAL(find_value(resultObj, "type").get_str(), "sprout");
+    b = find_value(resultObj, "ismine").get_bool();
+    BOOST_CHECK_EQUAL(b, false);
+
+    // Let's import a spending key to the wallet and validate its payment address
+    BOOST_CHECK_NO_THROW(CallRPC("z_importkey SKxoWv77WGwFnUJitQKNEcD636bL4X5Gd6wWmgaA4Q9x8jZBPJXT"));
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("z_validateaddress zcWsmqT4X2V4jgxbgiCzyrAfRT1vi1F4sn7M5Pkh66izzw8Uk7LBGAH3DtcSMJeUb2pi3W4SQF8LMKkU2cUuVP68yAGcomL"));
+    resultObj = retValue.get_obj();
+    b = find_value(resultObj, "isvalid").get_bool();
+    BOOST_CHECK_EQUAL(b, true);
+    BOOST_CHECK_EQUAL(find_value(resultObj, "type").get_str(), "sprout");
+    b = find_value(resultObj, "ismine").get_bool();
+    BOOST_CHECK_EQUAL(b, true);
+    BOOST_CHECK_EQUAL(find_value(resultObj, "payingkey").get_str(), "f5bb3c888ccc9831e3f6ba06e7528e26a312eec3acc1823be8918b6a3a5e20ad");
+    BOOST_CHECK_EQUAL(find_value(resultObj, "transmissionkey").get_str(), "7a58c7132446564e6b810cf895c20537b3528357dc00150a8e201f491efa9c1a");
+
+    // This Sapling address is not valid, it belongs to another network
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("z_validateaddress ztestsapling1knww2nyjc62njkard0jmx7hlsj6twxmxwprn7anvrv4dc2zxanl3nemc0qx2hvplxmd2uau8gyw"));
+    resultObj = retValue.get_obj();
+    b = find_value(resultObj, "isvalid").get_bool();
+    BOOST_CHECK_EQUAL(b, false);
+
+    // This Sapling address is valid, but the spending key is not in this wallet
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("z_validateaddress zs1z7rejlpsa98s2rrrfkwmaxu53e4ue0ulcrw0h4x5g8jl04tak0d3mm47vdtahatqrlkngh9slya"));
+    resultObj = retValue.get_obj();
+    b = find_value(resultObj, "isvalid").get_bool();
+    BOOST_CHECK_EQUAL(b, true);
+    BOOST_CHECK_EQUAL(find_value(resultObj, "type").get_str(), "sapling");
+    b = find_value(resultObj, "ismine").get_bool();
+    BOOST_CHECK_EQUAL(b, false);
+    BOOST_CHECK_EQUAL(find_value(resultObj, "diversifier").get_str(), "1787997c30e94f050c634d");
+    BOOST_CHECK_EQUAL(find_value(resultObj, "diversifiedtransmissionkey").get_str(), "34ed1f60f5db5763beee1ddbb37dd5f7e541d4d4fbdcc09fbfcc6b8e949bbe9d");
+}
+
+BOOST_AUTO_TEST_CASE(rpc_wallet_z_importkey_paymentaddress) {
+    SelectParams(CBaseChainParams::MAIN);
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    auto testAddress = [](const std::string& type, const std::string& key) {
+        UniValue ret;
+        BOOST_CHECK_NO_THROW(ret = CallRPC("z_importkey " + key));
+        auto defaultAddr = find_value(ret, "address").get_str();
+        BOOST_CHECK_EQUAL(type, find_value(ret, "type").get_str());
+        BOOST_CHECK_NO_THROW(ret = CallRPC("z_validateaddress " + defaultAddr));
+        ret = ret.get_obj();
+        BOOST_CHECK_EQUAL(true, find_value(ret, "isvalid").get_bool());
+        BOOST_CHECK_EQUAL(true, find_value(ret, "ismine").get_bool());
+        BOOST_CHECK_EQUAL(type, find_value(ret, "type").get_str());
+    };
+
+    testAddress("sapling", "secret-extended-key-main1qya4wae0qqqqqqpxfq3ukywunn"
+            "dtr8xf39hktp3w4z94smuu3l8wr6h4cwxklzzemtg9sk5c7tamfqs48ml6rvuvyup8"
+            "ne6jz9g7l0asew0htdpjgfss29et84uvqhynjayl3laphks2wxy3c8vhqr4wrca3wl"
+            "ft2fhcacqtvfwsht4t33l8ckpyr8djmzj7swlvhdhepvc3ehycf9cja335ex6rlpka"
+            "8z2gzkul3mztga2ups55c3xvn9j6vpdfm5a5v60g9v3sztcpvxqhm");
+
+    testAddress("sprout",
+            "SKxoWv77WGwFnUJitQKNEcD636bL4X5Gd6wWmgaA4Q9x8jZBPJXT");
+}
+
+/*
+ * This test covers RPC command z_exportwallet
+ */
+BOOST_AUTO_TEST_CASE(rpc_wallet_z_exportwallet)
+{
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    // wallet should be empty
+    std::set<libzcash::SproutPaymentAddress> addrs;
+    pwalletMain->GetSproutPaymentAddresses(addrs);
+    BOOST_CHECK(addrs.size()==0);
+
+    // wallet should have one key
+    libzcash::SproutPaymentAddress addr = pwalletMain->GenerateNewSproutZKey();
+    pwalletMain->GetSproutPaymentAddresses(addrs);
+    BOOST_CHECK(addrs.size()==1);
+
+    // Set up paths
+    fs::path tmppath = fs::temp_directory_path();
+    fs::path tmpfilename = fs::unique_path("%%%%%%%%");
+    fs::path exportfilepath = tmppath / tmpfilename;
+
+    // export will fail since exportdir is not set
+    BOOST_CHECK_THROW(CallRPC(string("z_exportwallet ") + tmpfilename.string()), runtime_error);
+
+    // set exportdir
+    mapArgs["-exportdir"] = tmppath.string();
+
+    // run some tests
+    BOOST_CHECK_THROW(CallRPC("z_exportwallet"), runtime_error);
+
+    BOOST_CHECK_THROW(CallRPC("z_exportwallet toomany args"), runtime_error);
+
+    BOOST_CHECK_THROW(CallRPC(string("z_exportwallet invalid!*/_chars.txt")), runtime_error);
+
+    BOOST_CHECK_NO_THROW(CallRPC(string("z_exportwallet ") + tmpfilename.string()));
+
+
+    libzcash::SproutSpendingKey key;
+    BOOST_CHECK(pwalletMain->GetSproutSpendingKey(addr, key));
+
+    KeyIO keyIO(Params());
+    std::string s1 = keyIO.EncodePaymentAddress(addr);
+    std::string s2 = keyIO.EncodeSpendingKey(key);
+
+    // There's no way to really delete a private key so we will read in the
+    // exported wallet file and search for the spending key and payment address.
+
+    EnsureWalletIsUnlocked();
+
+    ifstream file;
+    file.open(exportfilepath.string().c_str(), std::ios::in | std::ios::ate);
+    BOOST_CHECK(file.is_open());
+    bool fVerified = false;
+    int64_t nFilesize = std::max((int64_t)1, (int64_t)file.tellg());
+    file.seekg(0, file.beg);
+    while (file.good()) {
+        std::string line;
+        std::getline(file, line);
+        if (line.empty() || line[0] == '#')
+            continue;
+        if (line.find(s1) != std::string::npos && line.find(s2) != std::string::npos) {
+            fVerified = true;
+            break;
+        }
+    }
+    BOOST_CHECK(fVerified);
+}
+
+
+/*
+ * This test covers RPC command z_importwallet
+ */
+BOOST_AUTO_TEST_CASE(rpc_wallet_z_importwallet)
+{
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    // error if no args
+    BOOST_CHECK_THROW(CallRPC("z_importwallet"), runtime_error);
+
+    // error if too many args
+    BOOST_CHECK_THROW(CallRPC("z_importwallet toomany args"), runtime_error);
+
+    KeyIO keyIO(Params());
+    // create a random key locally
+    auto testSpendingKey = libzcash::SproutSpendingKey::random();
+    auto testPaymentAddress = testSpendingKey.address();
+    std::string testAddr = keyIO.EncodePaymentAddress(testPaymentAddress);
+    std::string testKey = keyIO.EncodeSpendingKey(testSpendingKey);
+
+    // create test data using the random key
+    std::string format_str = "# Wallet dump created by Zcash v0.11.2.0.z8-9155cc6-dirty (2016-08-11 11:37:00 -0700)\n"
+            "# * Created on 2016-08-12T21:55:36Z\n"
+            "# * Best block at time of backup was 0 (0de0a3851fef2d433b9b4f51d4342bdd24c5ddd793eb8fba57189f07e9235d52),\n"
+            "#   mined on 2009-01-03T18:15:05Z\n"
+            "\n"
+            "# Zkeys\n"
+            "\n"
+            "%s 2016-08-12T21:55:36Z # zaddr=%s\n"
+            "\n"
+            "\n# End of dump";
+
+    boost::format formatobject(format_str);
+    std::string testWalletDump = (formatobject % testKey % testAddr).str();
+
+    // write test data to file
+    fs::path temp = fs::temp_directory_path() /
+            fs::unique_path();
+    const std::string path = temp.string();
+    std::ofstream file(path);
+    file << testWalletDump;
+    file << std::flush;
+
+    // wallet should currently be empty
+    std::set<libzcash::SproutPaymentAddress> addrs;
+    pwalletMain->GetSproutPaymentAddresses(addrs);
+    BOOST_CHECK(addrs.size()==0);
+
+    // import test data from file into wallet
+    BOOST_CHECK_NO_THROW(CallRPC(string("z_importwallet ") + path));
+
+    // wallet should now have one zkey
+    pwalletMain->GetSproutPaymentAddresses(addrs);
+    BOOST_CHECK(addrs.size()==1);
+
+    // check that we have the spending key for the address
+    auto decoded = keyIO.DecodePaymentAddress(testAddr);
+    BOOST_CHECK(decoded.has_value());
+    libzcash::PaymentAddress address(decoded.value());
+    BOOST_ASSERT(std::holds_alternative<libzcash::SproutPaymentAddress>(address));
+    auto sprout_addr = std::get<libzcash::SproutPaymentAddress>(address);
+    BOOST_CHECK(pwalletMain->HaveSproutSpendingKey(sprout_addr));
+
+    // Verify the spending key is the same as the test data
+    libzcash::SproutSpendingKey k;
+    BOOST_CHECK(pwalletMain->GetSproutSpendingKey(sprout_addr, k));
+    BOOST_CHECK_EQUAL(testKey, keyIO.EncodeSpendingKey(k));
+}
+
+/*
+ * This test covers RPC commands z_listaddresses, z_importkey, z_exportkey,
+ * listaddresses, z_importviewingkey, z_exportviewingkey
+ */
+BOOST_AUTO_TEST_CASE(rpc_wallet_z_importexport)
+{
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+    UniValue retValue;
+    int n1 = 1000; // number of times to import/export
+    int n2 = 1000; // number of addresses to create and list
+
+    // error if no args
+    BOOST_CHECK_THROW(CallRPC("z_importkey"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("z_exportkey"), runtime_error);
+
+    // error if too many args
+    BOOST_CHECK_THROW(CallRPC("z_importkey way too many args"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("z_exportkey toomany args"), runtime_error);
+
+    // error if invalid args
+    KeyIO keyIO(Params());
+    auto sk = libzcash::SproutSpendingKey::random();
+    std::string prefix = std::string("z_importkey ") + keyIO.EncodeSpendingKey(sk) + " yes ";
+    BOOST_CHECK_THROW(CallRPC(prefix + "-1"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC(prefix + "2147483647"), runtime_error); // allowed, but > height of active chain tip
+    BOOST_CHECK_THROW(CallRPC(prefix + "2147483648"), runtime_error); // not allowed, > int32 used for nHeight
+    BOOST_CHECK_THROW(CallRPC(prefix + "100badchars"), runtime_error);
+
+    // wallet should currently be empty
+    std::set<libzcash::SproutPaymentAddress> sproutAddrs;
+    pwalletMain->GetSproutPaymentAddresses(sproutAddrs);
+    BOOST_CHECK(sproutAddrs.size()==0);
+    std::set<libzcash::SaplingPaymentAddress> saplingAddrs;
+    pwalletMain->GetSaplingPaymentAddresses(saplingAddrs);
+    BOOST_CHECK(saplingAddrs.empty());
+
+    auto m = GetTestMasterSaplingSpendingKey();
+
+    // verify import and export key
+    for (int i = 0; i < n1; i++) {
+        // create a random Sprout key locally
+        auto testSpendingKey = libzcash::SproutSpendingKey::random();
+        auto testPaymentAddress = testSpendingKey.address();
+        std::string testAddr = keyIO.EncodePaymentAddress(testPaymentAddress);
+        std::string testKey = keyIO.EncodeSpendingKey(testSpendingKey);
+        BOOST_CHECK_NO_THROW(CallRPC(string("z_importkey ") + testKey));
+        BOOST_CHECK_NO_THROW(retValue = CallRPC(string("z_exportkey ") + testAddr));
+        BOOST_CHECK_EQUAL(retValue.get_str(), testKey);
+
+        // create a random Sapling key locally; split between IVKs and spending keys.
+        auto testSaplingSpendingKey = m.Derive(i);
+        auto testSaplingPaymentAddress = testSaplingSpendingKey.ToXFVK().DefaultAddress();
+        if (i % 2 == 0) {
+            std::string testSaplingAddr = keyIO.EncodePaymentAddress(testSaplingPaymentAddress);
+            std::string testSaplingKey = keyIO.EncodeSpendingKey(testSaplingSpendingKey);
+            BOOST_CHECK_NO_THROW(CallRPC(string("z_importkey ") + testSaplingKey));
+            BOOST_CHECK_NO_THROW(retValue = CallRPC(string("z_exportkey ") + testSaplingAddr));
+            BOOST_CHECK_EQUAL(retValue.get_str(), testSaplingKey);
+        } else {
+            std::string testSaplingAddr = keyIO.EncodePaymentAddress(testSaplingPaymentAddress);
+            std::string testSaplingKey = keyIO.EncodeViewingKey(testSaplingSpendingKey.ToXFVK());
+            BOOST_CHECK_NO_THROW(CallRPC(string("z_importviewingkey ") + testSaplingKey));
+            BOOST_CHECK_NO_THROW(retValue = CallRPC(string("z_exportviewingkey ") + testSaplingAddr));
+            BOOST_CHECK_EQUAL(retValue.get_str(), testSaplingKey);
+        }
+    }
+
+    // Verify we can list the keys imported
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("z_listaddresses"));
+    UniValue arr = retValue.get_array();
+    BOOST_CHECK(arr.size() == n1 + (n1 / 2));
+
+    // Verify that the keys imported are also available from listaddresses
+    {
+        BOOST_CHECK_NO_THROW(retValue = CallRPC("listaddresses"));
+        auto listarr = retValue.get_array();
+        bool sproutCountMatch = false;
+        bool saplingSpendingKeyMatch = false;
+        bool saplingIVKMatch = false;
+        for (auto a : listarr.getValues()) {
+            auto source = find_value(a.get_obj(), "source");
+            if (source.get_str() == "legacy_random") {
+                auto sprout_obj = find_value(a.get_obj(), "sprout").get_obj();
+                auto sprout_addrs = find_value(sprout_obj, "addresses").get_array();
+                sproutCountMatch = (sprout_addrs.size() == n1);
+            }
+            if (source.get_str() == "imported") {
+                int addr_count = 0;
+                for (auto sapling_obj : find_value(a.get_obj(), "sapling").get_array().getValues()) {
+                    auto sapling_addrs = find_value(sapling_obj, "addresses").get_array();
+                    addr_count += sapling_addrs.size();
+                }
+                saplingSpendingKeyMatch = (addr_count == n1 / 2);
+            }
+            if (source.get_str() == "imported_watchonly") {
+                int addr_count = 0;
+                for (auto sapling_obj : find_value(a.get_obj(), "sapling").get_array().getValues()) {
+                    auto sapling_addrs = find_value(sapling_obj, "addresses").get_array();
+                    addr_count += sapling_addrs.size();
+                }
+                saplingIVKMatch = (addr_count == n1 / 2);
+            }
+        }
+        BOOST_CHECK(sproutCountMatch);
+        BOOST_CHECK(saplingSpendingKeyMatch);
+        BOOST_CHECK(saplingIVKMatch);
+    }
+
+    // Put addresses into a set
+    std::unordered_set<std::string> myaddrs;
+    for (UniValue element : arr.getValues()) {
+        myaddrs.insert(element.get_str());
+    }
+
+    // Make new addresses for the set
+    for (int i=0; i<n2; i++) {
+        myaddrs.insert(keyIO.EncodePaymentAddress(pwalletMain->GenerateNewSproutZKey()));
+    }
+
+    // Verify number of addresses stored in wallet is correct
+    int numAddrs = myaddrs.size();
+    // sprout_addrs + sapling addrs with spend authority + new sprout addrs
+    BOOST_CHECK(numAddrs == (n1 + (n1 / 2) + n2));
+    pwalletMain->GetSproutPaymentAddresses(sproutAddrs);
+    pwalletMain->GetSaplingPaymentAddresses(saplingAddrs);
+    // here we also include the watchonly sapling addresses
+    BOOST_CHECK(sproutAddrs.size() + saplingAddrs.size() == numAddrs + (n1 / 2));
+
+    // Ask wallet to list addresses
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("z_listaddresses"));
+    arr = retValue.get_array();
+    BOOST_CHECK(arr.size() == numAddrs);
+
+    // Create a set from them
+    std::unordered_set<std::string> listaddrs;
+    for (UniValue element : arr.getValues()) {
+        listaddrs.insert(element.get_str());
+    }
+
+    // Verify that the newly added sprout keys imported are also available from listaddresses
+    {
+        BOOST_CHECK_NO_THROW(retValue = CallRPC("listaddresses"));
+        auto listarr = retValue.get_array();
+        bool sproutCountMatch = false;
+        for (auto a : listarr.getValues()) {
+            auto source = find_value(a.get_obj(), "source");
+            if (source.get_str() == "legacy_random") {
+                auto sprout_obj = find_value(a.get_obj(), "sprout").get_obj();
+                auto sprout_addrs = find_value(sprout_obj, "addresses").get_array();
+                sproutCountMatch = (sprout_addrs.size() == n1 + n2);
+            }
+        }
+        BOOST_CHECK(sproutCountMatch);
+    }
+
+    // Verify the two sets of addresses are the same
+    BOOST_CHECK(listaddrs.size() == numAddrs);
+    BOOST_CHECK(myaddrs == listaddrs);
+}
+
+// Check if address is of given type and spendable from our wallet.
+template <typename ADDR_TYPE>
+void CheckHaveAddr(const std::optional<libzcash::PaymentAddress>& addr) {
+    BOOST_CHECK(addr.has_value());
+    auto addr_of_type = std::get_if<ADDR_TYPE>(&(addr.value()));
+    BOOST_ASSERT(addr_of_type != nullptr);
+
+    BOOST_CHECK(pwalletMain->ZTXOSelectorForAddress(*addr_of_type, true, false).has_value());
+}
+
+BOOST_AUTO_TEST_CASE(rpc_wallet_z_getnewaddress) {
+    using namespace libzcash;
+
+    UniValue addr;
+
+    KeyIO keyIO(Params());
+    // No parameter defaults to sapling address
+    addr = CallRPC("z_getnewaddress");
+    CheckHaveAddr<SaplingPaymentAddress>(keyIO.DecodePaymentAddress(addr.get_str()));
+
+    // Passing 'sapling' should also work
+    addr = CallRPC("z_getnewaddress sapling");
+    CheckHaveAddr<SaplingPaymentAddress>(keyIO.DecodePaymentAddress(addr.get_str()));
+
+    // Should also support sprout
+    addr = CallRPC("z_getnewaddress sprout");
+    CheckHaveAddr<SproutPaymentAddress>(keyIO.DecodePaymentAddress(addr.get_str()));
+
+    // Requesting a sprout address during IBD should fail
+    bool ibd = TestSetIBD(true);
+    CheckRPCThrows("z_getnewaddress sprout", "Error: Creating a Sprout address during initial block download is not supported.");
+    TestSetIBD(ibd);
+
+    // Should throw on invalid argument
+    CheckRPCThrows("z_getnewaddress garbage", "Invalid address type");
+
+    // Too many arguments will throw with the help
+    BOOST_CHECK_THROW(CallRPC("z_getnewaddress many args"), runtime_error);
+
+    {
+        UniValue list;
+        BOOST_CHECK_NO_THROW(list = CallRPC("listaddresses"));
+        auto listarr = list.get_array();
+        bool sproutCountMatch = false;
+        bool saplingExtfvksMatch = false;
+        bool saplingSpendAuth0 = false;
+        bool saplingSpendAuth1 = false;
+        bool saplingCountMismatch = true;
+        for (auto a : listarr.getValues()) {
+            auto source = find_value(a.get_obj(), "source");
+            if (source.get_str() == "legacy_random") {
+                auto sproutObj = find_value(a.get_obj(), "sprout").get_obj();
+                auto sproutAddrs = find_value(sproutObj, "addresses").get_array();
+                sproutCountMatch = (sproutAddrs.size() == 1);
+            }
+            if (source.get_str() == "mnemonic_seed") {
+                auto sapling_addr_sets = find_value(a.get_obj(), "sapling").get_array();
+                saplingExtfvksMatch = (sapling_addr_sets.size() == 2);
+
+                for (auto saplingObj : sapling_addr_sets.getValues()) {
+                    auto keypath = find_value(saplingObj, "zip32KeyPath").get_str();
+                    saplingSpendAuth0 |= (keypath == "m/32'/133'/2147483647'/0'");
+                    saplingSpendAuth1 |= (keypath == "m/32'/133'/2147483647'/1'");
+                    auto saplingAddrs = find_value(saplingObj, "addresses").get_array();
+                    saplingCountMismatch &= (saplingAddrs.size() != 1);
+                }
+            }
+        }
+        BOOST_CHECK(sproutCountMatch);
+        BOOST_CHECK(saplingExtfvksMatch);
+        BOOST_CHECK(!saplingCountMismatch);
+        BOOST_CHECK(saplingSpendAuth0);
+        BOOST_CHECK(saplingSpendAuth1);
+    }
+}
+
+/**
+ * Test Async RPC operations.
+ * Tip: Create mock operations by subclassing AsyncRPCOperation.
+ */
+
+class MockSleepOperation : public AsyncRPCOperation {
+public:
+    std::chrono::milliseconds naptime;
+    MockSleepOperation(int t=1000) {
+        this->naptime = std::chrono::milliseconds(t);
+    }
+    virtual ~MockSleepOperation() {
+    }
+    virtual void main() {
+        set_state(OperationStatus::EXECUTING);
+        start_execution_clock();
+        std::this_thread::sleep_for(std::chrono::milliseconds(naptime));
+        stop_execution_clock();
+        set_result(UniValue(UniValue::VSTR, "done"));
+        set_state(OperationStatus::SUCCESS);
+    }
+};
+
+
+/*
+ * Test Async RPC queue and operations.
+ */
+BOOST_AUTO_TEST_CASE(rpc_wallet_async_operations)
+{
+    std::shared_ptr<AsyncRPCQueue> q = std::make_shared<AsyncRPCQueue>();
+    BOOST_CHECK(q->getNumberOfWorkers() == 0);
+    std::vector<AsyncRPCOperationId> ids = q->getAllOperationIds();
+    BOOST_CHECK(ids.size()==0);
+
+    std::shared_ptr<AsyncRPCOperation> op1 = std::make_shared<AsyncRPCOperation>();
+    q->addOperation(op1);
+    BOOST_CHECK(q->getOperationCount() == 1);
+
+    OperationStatus status = op1->getState();
+    BOOST_CHECK(status == OperationStatus::READY);
+
+    AsyncRPCOperationId id1 = op1->getId();
+    int64_t creationTime1 = op1->getCreationTime();
+
+    q->addWorker();
+    BOOST_CHECK(q->getNumberOfWorkers() == 1);
+
+    // an AsyncRPCOperation doesn't do anything so will finish immediately
+    std::this_thread::sleep_for(std::chrono::seconds(1));
+    BOOST_CHECK(q->getOperationCount() == 0);
+
+    // operation should be a success
+    BOOST_CHECK_EQUAL(op1->isCancelled(), false);
+    BOOST_CHECK_EQUAL(op1->isExecuting(), false);
+    BOOST_CHECK_EQUAL(op1->isReady(), false);
+    BOOST_CHECK_EQUAL(op1->isFailed(), false);
+    BOOST_CHECK_EQUAL(op1->isSuccess(), true);
+    BOOST_CHECK_EQUAL(op1->getError().isNull(), true);
+    BOOST_CHECK_EQUAL(op1->getResult().isNull(), false);
+    BOOST_CHECK_EQUAL(op1->getStateAsString(), "success");
+    BOOST_CHECK_NE(op1->getStateAsString(), "executing");
+
+    // Create a second operation which just sleeps
+    std::shared_ptr<AsyncRPCOperation> op2(new MockSleepOperation(2500));
+    AsyncRPCOperationId id2 = op2->getId();
+    int64_t creationTime2 = op2->getCreationTime();
+
+    // it's different from the previous operation
+    BOOST_CHECK_NE(op1.get(), op2.get());
+    BOOST_CHECK_NE(id1, id2);
+    BOOST_CHECK_NE(creationTime1, creationTime2);
+
+    // Only the first operation has been added to the queue
+    std::vector<AsyncRPCOperationId> v = q->getAllOperationIds();
+    std::set<AsyncRPCOperationId> opids(v.begin(), v.end());
+    BOOST_CHECK(opids.size() == 1);
+    BOOST_CHECK(opids.count(id1)==1);
+    BOOST_CHECK(opids.count(id2)==0);
+    std::shared_ptr<AsyncRPCOperation> p1 = q->getOperationForId(id1);
+    BOOST_CHECK_EQUAL(p1.get(), op1.get());
+    std::shared_ptr<AsyncRPCOperation> p2 = q->getOperationForId(id2);
+    BOOST_CHECK(!p2); // null ptr as not added to queue yet
+
+    // Add operation 2 and 3 to the queue
+    q->addOperation(op2);
+    std::shared_ptr<AsyncRPCOperation> op3(new MockSleepOperation(1000));
+    q->addOperation(op3);
+    std::this_thread::sleep_for(std::chrono::milliseconds(500));
+    BOOST_CHECK_EQUAL(op2->isExecuting(), true);
+    op2->cancel();  // too late, already executing
+    op3->cancel();
+    std::this_thread::sleep_for(std::chrono::milliseconds(3000));
+    BOOST_CHECK_EQUAL(op2->isSuccess(), true);
+    BOOST_CHECK_EQUAL(op2->isCancelled(), false);
+    BOOST_CHECK_EQUAL(op3->isCancelled(), true);
+
+
+    v = q->getAllOperationIds();
+    std::copy( v.begin(), v.end(), std::inserter( opids, opids.end() ) );
+    BOOST_CHECK(opids.size() == 3);
+    BOOST_CHECK(opids.count(id1)==1);
+    BOOST_CHECK(opids.count(id2)==1);
+    BOOST_CHECK(opids.count(op3->getId())==1);
+    q->finishAndWait();
+}
+
+
+// The CountOperation will increment this global
+std::atomic<int64_t> gCounter(0);
+
+class CountOperation : public AsyncRPCOperation {
+public:
+    CountOperation() {}
+    virtual ~CountOperation() {}
+    virtual void main() {
+        set_state(OperationStatus::EXECUTING);
+        gCounter++;
+        std::this_thread::sleep_for(std::chrono::milliseconds(1000));
+        set_state(OperationStatus::SUCCESS);
+    }
+};
+
+// This tests the queue waiting for multiple workers to finish
+BOOST_AUTO_TEST_CASE(rpc_wallet_async_operations_parallel_wait)
+{
+    gCounter = 0;
+
+    std::shared_ptr<AsyncRPCQueue> q = std::make_shared<AsyncRPCQueue>();
+    q->addWorker();
+    q->addWorker();
+    q->addWorker();
+    q->addWorker();
+    BOOST_CHECK(q->getNumberOfWorkers() == 4);
+
+    int64_t numOperations = 10;     // 10 * 1000ms / 4 = 2.5 secs to finish
+    for (int i=0; i<numOperations; i++) {
+        std::shared_ptr<AsyncRPCOperation> op(new CountOperation());
+        q->addOperation(op);
+    }
+
+    std::vector<AsyncRPCOperationId> ids = q->getAllOperationIds();
+    BOOST_CHECK(ids.size()==numOperations);
+    q->finishAndWait();
+    BOOST_CHECK_EQUAL(q->isFinishing(), true);
+    BOOST_CHECK_EQUAL(numOperations, gCounter.load());
+}
+
+// This tests the queue shutting down immediately
+BOOST_AUTO_TEST_CASE(rpc_wallet_async_operations_parallel_cancel)
+{
+    gCounter = 0;
+
+    std::shared_ptr<AsyncRPCQueue> q = std::make_shared<AsyncRPCQueue>();
+    q->addWorker();
+    q->addWorker();
+    BOOST_CHECK(q->getNumberOfWorkers() == 2);
+
+    int numOperations = 10000;  // 10000 seconds to complete
+    for (int i=0; i<numOperations; i++) {
+        std::shared_ptr<AsyncRPCOperation> op(new CountOperation());
+        q->addOperation(op);
+    }
+    std::vector<AsyncRPCOperationId> ids = q->getAllOperationIds();
+    BOOST_CHECK(ids.size()==numOperations);
+    q->closeAndWait();
+
+    int numSuccess = 0;
+    int numCancelled = 0;
+    for (auto & id : ids) {
+        std::shared_ptr<AsyncRPCOperation> ptr = q->popOperationForId(id);
+        if (ptr->isCancelled()) {
+            numCancelled++;
+        } else if (ptr->isSuccess()) {
+            numSuccess++;
+        }
+    }
+
+    BOOST_CHECK_EQUAL(numOperations, numSuccess+numCancelled);
+    BOOST_CHECK_EQUAL(gCounter.load(), numSuccess);
+    BOOST_CHECK(q->getOperationCount() == 0);
+    ids = q->getAllOperationIds();
+    BOOST_CHECK(ids.size()==0);
+}
+
+// This tests z_getoperationstatus, z_getoperationresult, z_listoperationids
+BOOST_AUTO_TEST_CASE(rpc_z_getoperations)
+{
+    std::shared_ptr<AsyncRPCQueue> q = getAsyncRPCQueue();
+    std::shared_ptr<AsyncRPCQueue> sharedInstance = AsyncRPCQueue::sharedInstance();
+    BOOST_CHECK(q == sharedInstance);
+
+    BOOST_CHECK_NO_THROW(CallRPC("z_getoperationstatus"));
+    BOOST_CHECK_NO_THROW(CallRPC("z_getoperationstatus []"));
+    BOOST_CHECK_NO_THROW(CallRPC("z_getoperationstatus [\"opid-1234\"]"));
+    BOOST_CHECK_THROW(CallRPC("z_getoperationstatus [] toomanyargs"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("z_getoperationstatus not_an_array"), runtime_error);
+
+    BOOST_CHECK_NO_THROW(CallRPC("z_getoperationresult"));
+    BOOST_CHECK_NO_THROW(CallRPC("z_getoperationresult []"));
+    BOOST_CHECK_NO_THROW(CallRPC("z_getoperationresult [\"opid-1234\"]"));
+    BOOST_CHECK_THROW(CallRPC("z_getoperationresult [] toomanyargs"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("z_getoperationresult not_an_array"), runtime_error);
+
+    std::shared_ptr<AsyncRPCOperation> op1 = std::make_shared<AsyncRPCOperation>();
+    q->addOperation(op1);
+    std::shared_ptr<AsyncRPCOperation> op2 = std::make_shared<AsyncRPCOperation>();
+    q->addOperation(op2);
+
+    BOOST_CHECK(q->getOperationCount() == 2);
+    BOOST_CHECK(q->getNumberOfWorkers() == 0);
+    q->addWorker();
+    BOOST_CHECK(q->getNumberOfWorkers() == 1);
+    std::this_thread::sleep_for(std::chrono::milliseconds(1000));
+    BOOST_CHECK(q->getOperationCount() == 0);
+
+    // Check if too many args
+    BOOST_CHECK_THROW(CallRPC("z_listoperationids toomany args"), runtime_error);
+
+    UniValue retValue;
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("z_listoperationids"));
+    BOOST_CHECK(retValue.get_array().size() == 2);
+
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("z_getoperationstatus"));
+    UniValue array = retValue.get_array();
+    BOOST_CHECK(array.size() == 2);
+
+    // idempotent
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("z_getoperationstatus"));
+    array = retValue.get_array();
+    BOOST_CHECK(array.size() == 2);
+
+    for (UniValue v : array.getValues()) {
+        UniValue obj = v.get_obj();
+        UniValue id = find_value(obj, "id");
+
+        UniValue result;
+        // removes result from internal storage
+        BOOST_CHECK_NO_THROW(result = CallRPC("z_getoperationresult [\"" + id.get_str() + "\"]"));
+        UniValue resultArray = result.get_array();
+        BOOST_CHECK(resultArray.size() == 1);
+
+        UniValue resultObj = resultArray[0].get_obj();
+        UniValue resultId = find_value(resultObj, "id");
+        BOOST_CHECK_EQUAL(id.get_str(), resultId.get_str());
+
+        // verify the operation has been removed
+        BOOST_CHECK_NO_THROW(result = CallRPC("z_getoperationresult [\"" + id.get_str() + "\"]"));
+        resultArray = result.get_array();
+        BOOST_CHECK(resultArray.size() == 0);
+    }
+
+    // operations removed
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("z_getoperationstatus"));
+    array = retValue.get_array();
+    BOOST_CHECK(array.size() == 0);
+
+    q->close();
+}
+
+BOOST_AUTO_TEST_CASE(rpc_z_sendmany_parameters)
+{
+    SelectParams(CBaseChainParams::TESTNET);
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    BOOST_CHECK_THROW(CallRPC("z_sendmany"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("z_sendmany toofewargs"), runtime_error);
+    // too many arguments:
+    BOOST_CHECK_THROW(CallRPC("z_sendmany addr [] 1 0.001 true true"), runtime_error);
+
+    // bad from address
+    BOOST_CHECK_THROW(CallRPC("z_sendmany "
+            "INVALIDtmRr6yJonqGK23UVhrKuyvTpF8qxQQjKigJ []"), runtime_error);
+    // empty amounts
+    BOOST_CHECK_THROW(CallRPC("z_sendmany "
+            "tmRr6yJonqGK23UVhrKuyvTpF8qxQQjKigJ []"), runtime_error);
+
+    // don't have the spending key for this address
+    BOOST_CHECK_THROW(CallRPC("z_sendmany "
+            "tnpoQJVnYBZZqkFadj2bJJLThNCxbADGB5gSGeYTAGGrT5tejsxY9Zc1BtY8nnHmZkB"
+            "UkJ1oSfbhTJhm72WiZizvkZz5aH1 []"), runtime_error);
+
+    // duplicate address
+    BOOST_CHECK_THROW(CallRPC("z_sendmany "
+            "tmRr6yJonqGK23UVhrKuyvTpF8qxQQjKigJ "
+            "[{\"address\":\"tmQP9L3s31cLsghVYf2Jb5MhKj1jRBPoeQn\",\"amount\":50.0},"
+            "{\"address\":\"tmQP9L3s31cLsghVYf2Jb5MhKj1jRBPoeQn\",\"amount\":12.0}]"
+            ), runtime_error);
+
+    // invalid fee amount, cannot be negative
+    BOOST_CHECK_THROW(CallRPC("z_sendmany "
+            "tmRr6yJonqGK23UVhrKuyvTpF8qxQQjKigJ "
+            "[{\"address\":\"tmQP9L3s31cLsghVYf2Jb5MhKj1jRBPoeQn\",\"amount\":50.0}] "
+            "1 -0.00001"
+            ), runtime_error);
+
+    // invalid fee amount, bigger than MAX_MONEY
+    BOOST_CHECK_THROW(CallRPC("z_sendmany "
+            "tmRr6yJonqGK23UVhrKuyvTpF8qxQQjKigJ "
+            "[{\"address\":\"tmQP9L3s31cLsghVYf2Jb5MhKj1jRBPoeQn\",\"amount\":50.0}] "
+            "1 21000001"
+            ), runtime_error);
+
+    // fee amount is bigger than sum of outputs
+    BOOST_CHECK_THROW(CallRPC("z_sendmany "
+            "tmRr6yJonqGK23UVhrKuyvTpF8qxQQjKigJ "
+            "[{\"address\":\"tmQP9L3s31cLsghVYf2Jb5MhKj1jRBPoeQn\",\"amount\":50.0}] "
+            "1 50.00000001"
+            ), runtime_error);
+
+    // memo bigger than allowed length of ZC_MEMO_SIZE
+    std::vector<char> v (2 * (ZC_MEMO_SIZE+1));     // x2 for hexadecimal string format
+    std::fill(v.begin(),v.end(), 'A');
+    std::string badmemo(v.begin(), v.end());
+    auto pa = pwalletMain->GenerateNewSproutZKey();
+    KeyIO keyIO(Params());
+    std::string zaddr1 = keyIO.EncodePaymentAddress(pa);
+    BOOST_CHECK_THROW(CallRPC(string("z_sendmany tmRr6yJonqGK23UVhrKuyvTpF8qxQQjKigJ ")
+            + "[{\"address\":\"" + zaddr1 + "\",\"amount\":123.456}]"), runtime_error);
+
+    // Mutable tx containing contextual information we need to build tx
+    UniValue retValue = CallRPC("getblockcount");
+    int nHeight = retValue.get_int();
+    TransactionBuilder builder(Params().GetConsensus(), nHeight + 1, std::nullopt, pwalletMain);
+}
+
+BOOST_AUTO_TEST_CASE(asyncrpcoperation_sign_send_raw_transaction) {
+    // Raw joinsplit is a zaddr->zaddr
+    std::string raw = "020000000000000000000100000000000000001027000000000000183a0d4c46c369078705e39bcfebee59a978dbd210ce8de3efc9555a03fbabfd3cea16693d730c63850d7e48ccde79854c19adcb7e9dcd7b7d18805ee09083f6b16e1860729d2d4a90e2f2acd009cf78b5eb0f4a6ee4bdb64b1262d7ce9eb910c460b02022991e968d0c50ee44908e4ccccbc591d0053bcca154dd6d6fc400a29fa686af4682339832ccea362a62aeb9df0d5aa74f86a1e75ac0f48a8ccc41e0a940643c6c33e1d09223b0a46eaf47a1bb4407cfc12b1dcf83a29c0cef51e45c7876ca5b9e5bae86d92976eb3ef68f29cd29386a8be8451b50f82bf9da10c04651868655194da8f6ed3d241bb5b5ff93a3e2bbe44644544d88bcde5cc35978032ee92699c7a61fcbb395e7583f47e698c4d53ede54f956629400bf510fb5e22d03158cc10bdcaaf29e418ef18eb6480dd9c8b9e2a377809f9f32a556ef872febd0021d4ad013aa9f0b7255e98e408d302abefd33a71180b720271835b487ab309e160b06dfe51932120fb84a7ede16b20c53599a11071592109e10260f265ee60d48c62bfe24074020e9b586ce9e9356e68f2ad1a9538258234afe4b83a209f178f45202270eaeaeecaf2ce3100b2c5a714f75f35777a9ebff5ebf47059d2bbf6f3726190216468f2b152673b766225b093f3a2f827c86d6b48b42117fec1d0ac38dd7af700308dcfb02eba821612b16a2c164c47715b9b0c93900893b1aba2ea03765c94d87022db5be06ab338d1912e0936dfe87586d0a8ee49144a6cd2e306abdcb652faa3e0222739deb23154d778b50de75069a4a2cce1208cd1ced3cb4744c9888ce1c2fcd2e66dc31e62d3aa9e423d7275882525e9981f92e84ac85975b8660739407efbe1e34c2249420fde7e17db3096d5b22e83d051d01f0e6e7690dca7d168db338aadf0897fedac10de310db2b1bff762d322935dddbb60c2efb8b15d231fa17b84630371cb275c209f0c4c7d0c68b150ea5cd514122215e3f7fcfb351d69514788d67c2f3c8922581946e3a04bdf1f07f15696ca76eb95b10698bf1188fd882945c57657515889d042a6fc45d38cbc943540c4f0f6d1c45a1574c81f3e42d1eb8702328b729909adee8a5cfed7c79d54627d1fd389af941d878376f7927b9830ca659bf9ab18c5ca5192d52d02723008728d03701b8ab3e1c4a3109409ec0b13df334c7deec3523eeef4c97b5603e643de3a647b873f4c1b47fbfc6586ba66724f112e51fc93839648005043620aa3ce458e246d77977b19c53d98e3e812de006afc1a79744df236582943631d04cc02941ac4be500e4ed9fb9e3e7cc187b1c4050fad1d9d09d5fd70d5d01d615b439d8c0015d2eb10398bcdbf8c4b2bd559dbe4c288a186aed3f86f608da4d582e120c4a896e015e2241900d1daeccd05db968852677c71d752bec46de9962174b46f980e8cc603654daf8b98a3ee92dac066033954164a89568b70b1780c2ce2410b2f816dbeddb2cd463e0c8f21a52cf6427d9647a6fd4bafa8fb4cd4d47ac057b0160bee86c6b2fb8adce214c2bcdda277512200adf0eaa5d2114a2c077b009836a68ec254bfe56f51d147b9afe2ddd9cb917c0c2de19d81b7b8fd9f4574f51fa1207630dc13976f4d7587c962f761af267de71f3909a576e6bedaf6311633910d291ac292c467cc8331ef577aef7646a5d949322fa0367a49f20597a13def53136ee31610395e3e48d291fd8f58504374031fe9dcfba5e06086ebcf01a9106f6a4d6e16e19e4c5bb893f7da79419c94eca31a384be6fa1747284dee0fc3bbc8b1b860172c10b29c1594bb8c747d7fe05827358ff2160f49050001625ffe2e880bd7fc26cd0ffd89750745379a8e862816e08a5a2008043921ab6a4976064ac18f7ee37b6628bc0127d8d5ebd3548e41d8881a082d86f20b32e33094f15a0e6ea6074b08c6cd28142de94713451640a55985051f5577eb54572699d838cb34a79c8939e981c0c277d06a6e2ce69ccb74f8a691ff08f81d8b99e6a86223d29a2b7c8e7b041aba44ea678ae654277f7e91cbfa79158b989164a3d549d9f4feb0cc43169699c13e321fe3f4b94258c75d198ff9184269cd6986c55409e07528c93f64942c6c283ce3917b4bf4c3be2fe3173c8c38cccb35f1fbda0ca88b35a599c0678cb22aa8eabea8249dbd2e4f849fffe69803d299e435ebcd7df95854003d8eda17a74d98b4be0e62d45d7fe48c06a6f464a14f8e0570077cc631279092802a89823f031eef5e1028a6d6fdbd502869a731ee7d28b4d6c71b419462a30d31442d3ee444ffbcbd16d558c9000c97e949c2b1f9d6f6d8db7b9131ebd963620d3fc8595278d6f8fdf49084325373196d53e64142fa5a23eccd6ef908c4d80b8b3e6cc334b7f7012103a3682e4678e9b518163d262a39a2c1a69bf88514c52b7ccd7cc8dc80e71f7c2ec0701cff982573eb0c2c4daeb47fa0b586f4451c10d1da2e5d182b03dd067a5e971b3a6138ca6667aaf853d2ac03b80a1d5870905f2cfb6c78ec3c3719c02f973d638a0f973424a2b0f2b0023f136d60092fe15fba4bc180b9176bd0ff576e053f1af6939fe9ca256203ffaeb3e569f09774d2a6cbf91873e56651f4d6ff77e0b5374b0a1a201d7e523604e0247644544cc571d48c458a4f96f45580b";
+    UniValue obj(UniValue::VOBJ);
+    obj.pushKV("rawtxn", raw);
+    // Verify test mode is returning output (since no input taddrs, signed and unsigned are the same).
+    std::pair<CTransaction, UniValue> txAndResult = SignSendRawTransaction(obj, std::nullopt, true);
+    UniValue resultObj = txAndResult.second.get_obj();
+    std::string hex = find_value(resultObj, "hex").get_str();
+    BOOST_CHECK_EQUAL(hex, raw);
+}
+
+// TODO: test private methods
+BOOST_AUTO_TEST_CASE(rpc_z_sendmany_internals)
+{
+    SelectParams(CBaseChainParams::TESTNET);
+    const Consensus::Params& consensusParams = Params().GetConsensus();
+    KeyIO keyIO(Params());
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    UniValue retValue;
+
+    // Mutable tx containing contextual information we need to build tx
+    // We removed the ability to create pre-Sapling Sprout proofs, so we can
+    // only create Sapling-onwards transactions.
+    int nHeight = consensusParams.vUpgrades[Consensus::UPGRADE_SAPLING].nActivationHeight;
+
+    // add keys manually
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("getnewaddress"));
+    auto taddr1 = std::get<CKeyID>(keyIO.DecodePaymentAddress(retValue.get_str()).value());
+
+    if (!pwalletMain->HaveMnemonicSeed()) {
+        pwalletMain->GenerateNewSeed();
+    }
+    auto zaddr1 = pwalletMain->GenerateNewLegacySaplingZKey();
+
+    // there are no utxos to spend
+    {
+        auto selector = pwalletMain->ZTXOSelectorForAddress(taddr1, true, false).value();
+        TransactionBuilder builder(consensusParams, nHeight + 1, std::nullopt, pwalletMain);
+        std::vector<SendManyRecipient> recipients = { SendManyRecipient(std::nullopt, zaddr1, 100*COIN, "DEADBEEF") };
+        TransactionStrategy strategy;
+        std::shared_ptr<AsyncRPCOperation> operation(new AsyncRPCOperation_sendmany(std::move(builder), selector, recipients, 1, 1, strategy));
+        operation->main();
+        BOOST_CHECK(operation->isFailed());
+        std::string msg = operation->getErrorMessage();
+        BOOST_CHECK( msg.find("Insufficient funds") != string::npos);
+    }
+
+    // there are no unspent notes to spend
+    {
+        auto selector = pwalletMain->ZTXOSelectorForAddress(zaddr1, true, false).value();
+        TransactionBuilder builder(consensusParams, nHeight + 1, std::nullopt, pwalletMain);
+        std::vector<SendManyRecipient> recipients = { SendManyRecipient(std::nullopt, taddr1, 100*COIN, "DEADBEEF") };
+        TransactionStrategy strategy(PrivacyPolicy::AllowRevealedRecipients);
+        std::shared_ptr<AsyncRPCOperation> operation(new AsyncRPCOperation_sendmany(std::move(builder), selector, recipients, 1, 1, strategy));
+        operation->main();
+        BOOST_CHECK(operation->isFailed());
+        std::string msg = operation->getErrorMessage();
+        BOOST_CHECK(msg.find("Insufficient funds: have 0.00") != string::npos);
+    }
+
+    // get_memo_from_hex_string())
+    {
+        auto selector = pwalletMain->ZTXOSelectorForAddress(zaddr1, true, false).value();
+        TransactionBuilder builder(consensusParams, nHeight + 1, std::nullopt, pwalletMain);
+        std::vector<SendManyRecipient> recipients = { SendManyRecipient(std::nullopt, zaddr1, 100*COIN, "DEADBEEF") };
+        TransactionStrategy strategy;
+        std::shared_ptr<AsyncRPCOperation> operation(new AsyncRPCOperation_sendmany(std::move(builder), selector, recipients, 1, 1, strategy));
+        std::shared_ptr<AsyncRPCOperation_sendmany> ptr = std::dynamic_pointer_cast<AsyncRPCOperation_sendmany> (operation);
+        TEST_FRIEND_AsyncRPCOperation_sendmany proxy(ptr);
+
+        std::string memo = "DEADBEEF";
+        std::array<unsigned char, ZC_MEMO_SIZE> array = proxy.get_memo_from_hex_string(memo);
+        BOOST_CHECK_EQUAL(array[0], 0xDE);
+        BOOST_CHECK_EQUAL(array[1], 0xAD);
+        BOOST_CHECK_EQUAL(array[2], 0xBE);
+        BOOST_CHECK_EQUAL(array[3], 0xEF);
+        for (int i=4; i<ZC_MEMO_SIZE; i++) {
+            BOOST_CHECK_EQUAL(array[i], 0x00);  // zero padding
+        }
+
+        // memo is longer than allowed
+        std::vector<char> v (2 * (ZC_MEMO_SIZE+1));
+        std::fill(v.begin(),v.end(), 'A');
+        std::string bigmemo(v.begin(), v.end());
+
+        try {
+            proxy.get_memo_from_hex_string(bigmemo);
+        } catch (const UniValue& objError) {
+            BOOST_CHECK( find_error(objError, "too big"));
+        }
+
+        // invalid hexadecimal string
+        std::fill(v.begin(),v.end(), '@'); // not a hex character
+        std::string badmemo(v.begin(), v.end());
+
+        try {
+            proxy.get_memo_from_hex_string(badmemo);
+        } catch (const UniValue& objError) {
+            BOOST_CHECK( find_error(objError, "hexadecimal format"));
+        }
+
+        // odd length hexadecimal string
+        std::fill(v.begin(),v.end(), 'A');
+        v.resize(v.size() - 1);
+        assert(v.size() %2 == 1); // odd length
+        std::string oddmemo(v.begin(), v.end());
+        try {
+            proxy.get_memo_from_hex_string(oddmemo);
+        } catch (const UniValue& objError) {
+            BOOST_CHECK( find_error(objError, "hexadecimal format"));
+        }
+    }
+}
+
+/*
+ * This test covers storing encrypted zkeys in the wallet.
+ */
+BOOST_AUTO_TEST_CASE(rpc_wallet_encrypted_wallet_zkeys)
+{
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    UniValue retValue;
+    int n = 100;
+
+    // wallet should currently be empty
+    std::set<libzcash::SproutPaymentAddress> addrs;
+    pwalletMain->GetSproutPaymentAddresses(addrs);
+    BOOST_CHECK(addrs.size()==0);
+
+    // create keys
+    for (int i = 0; i < n; i++) {
+        CallRPC("z_getnewaddress sprout");
+    }
+
+    // Verify we can list the keys imported
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("z_listaddresses"));
+    UniValue arr = retValue.get_array();
+    BOOST_CHECK(arr.size() == n);
+
+    // Verify that the wallet encryption RPC is disabled
+    BOOST_CHECK_THROW(CallRPC("encryptwallet passphrase"), runtime_error);
+
+    // Encrypt the wallet (we can't call RPC encryptwallet as that shuts down node)
+    SecureString strWalletPass;
+    strWalletPass.reserve(100);
+    strWalletPass = "hello";
+
+    PushCurrentDirectory push_dir(GetArg("-datadir","/tmp/thisshouldnothappen"));
+    BOOST_CHECK(pwalletMain->EncryptWallet(strWalletPass));
+
+    // Verify we can still list the keys imported
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("z_listaddresses"));
+    arr = retValue.get_array();
+    BOOST_CHECK(arr.size() == n);
+
+    // Try to add a new key, but we can't as the wallet is locked
+    BOOST_CHECK_THROW(CallRPC("z_getnewaddress sprout"), runtime_error);
+
+    // We can't call RPC walletpassphrase as that invokes RPCRunLater which breaks tests.
+    // So we manually unlock.
+    BOOST_CHECK(pwalletMain->Unlock(strWalletPass));
+
+    // Now add a key
+    BOOST_CHECK_NO_THROW(CallRPC("z_getnewaddress sprout"));
+
+    // Verify the key has been added
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("z_listaddresses"));
+    arr = retValue.get_array();
+    BOOST_CHECK(arr.size() == n+1);
+
+    // We can't simulate over RPC the wallet closing and being reloaded
+    // but there are tests for this in gtest.
+}
+
+BOOST_AUTO_TEST_CASE(rpc_wallet_encrypted_wallet_sapzkeys)
+{
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    UniValue retValue;
+    int n = 100;
+
+    if(!pwalletMain->HaveMnemonicSeed())
+    {
+        pwalletMain->GenerateNewSeed();
+    }
+
+    // wallet should currently be empty
+    std::set<libzcash::SaplingPaymentAddress> addrs;
+    pwalletMain->GetSaplingPaymentAddresses(addrs);
+    BOOST_CHECK(addrs.size()==0);
+
+    // create keys
+    for (int i = 0; i < n; i++) {
+        CallRPC("z_getnewaddress sapling");
+    }
+
+    // Verify we can list the keys imported
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("z_listaddresses"));
+    UniValue arr = retValue.get_array();
+    BOOST_CHECK(arr.size() == n);
+
+    // Verify that the wallet encryption RPC is disabled
+    BOOST_CHECK_THROW(CallRPC("encryptwallet passphrase"), runtime_error);
+
+    // Encrypt the wallet (we can't call RPC encryptwallet as that shuts down node)
+    SecureString strWalletPass;
+    strWalletPass.reserve(100);
+    strWalletPass = "hello";
+
+    PushCurrentDirectory push_dir(GetArg("-datadir","/tmp/thisshouldnothappen"));
+    BOOST_CHECK(pwalletMain->EncryptWallet(strWalletPass));
+
+    // Verify we can still list the keys imported
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("z_listaddresses"));
+    arr = retValue.get_array();
+    BOOST_CHECK(arr.size() == n);
+
+    // Try to add a new key, but we can't as the wallet is locked
+    BOOST_CHECK_THROW(CallRPC("z_getnewaddress sapling"), runtime_error);
+
+    // We can't call RPC walletpassphrase as that invokes RPCRunLater which breaks tests.
+    // So we manually unlock.
+    BOOST_CHECK(pwalletMain->Unlock(strWalletPass));
+
+    // Now add a key
+    BOOST_CHECK_NO_THROW(CallRPC("z_getnewaddress sapling"));
+
+    // Verify the key has been added
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("z_listaddresses"));
+    arr = retValue.get_array();
+    BOOST_CHECK_EQUAL(arr.size(), n+1);
+
+    // We can't simulate over RPC the wallet closing and being reloaded
+    // but there are tests for this in gtest.
+}
+
+
+BOOST_AUTO_TEST_CASE(rpc_z_listunspent_parameters)
+{
+    SelectParams(CBaseChainParams::TESTNET);
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    UniValue retValue;
+
+    // too many args
+    BOOST_CHECK_THROW(CallRPC("z_listunspent 1 2 3 4 5"), runtime_error);
+
+    // minconf must be >= 0
+    BOOST_CHECK_THROW(CallRPC("z_listunspent -1"), runtime_error);
+
+    // maxconf must be > minconf
+    BOOST_CHECK_THROW(CallRPC("z_listunspent 2 1"), runtime_error);
+
+    // maxconf must not be out of range
+    BOOST_CHECK_THROW(CallRPC("z_listunspent 1 9999999999"), runtime_error);
+
+    // must be an array of addresses
+    BOOST_CHECK_THROW(CallRPC("z_listunspent 1 999 false ztjiDe569DPNbyTE6TSdJTaSDhoXEHLGvYoUnBU1wfVNU52TEyT6berYtySkd21njAeEoh8fFJUT42kua9r8EnhBaEKqCpP"), runtime_error);
+
+    // address must be string
+    BOOST_CHECK_THROW(CallRPC("z_listunspent 1 999 false [123456]"), runtime_error);
+
+    // no spending key
+    BOOST_CHECK_THROW(CallRPC("z_listunspent 1 999 false [\"ztjiDe569DPNbyTE6TSdJTaSDhoXEHLGvYoUnBU1wfVNU52TEyT6berYtySkd21njAeEoh8fFJUT42kua9r8EnhBaEKqCpP\"]"), runtime_error);
+
+    // allow watch only
+    BOOST_CHECK_NO_THROW(CallRPC("z_listunspent 1 999 true [\"ztjiDe569DPNbyTE6TSdJTaSDhoXEHLGvYoUnBU1wfVNU52TEyT6berYtySkd21njAeEoh8fFJUT42kua9r8EnhBaEKqCpP\"]"));
+
+    // wrong network, mainnet instead of testnet
+    BOOST_CHECK_THROW(CallRPC("z_listunspent 1 999 true [\"zcMuhvq8sEkHALuSU2i4NbNQxshSAYrpCExec45ZjtivYPbuiFPwk6WHy4SvsbeZ4siy1WheuRGjtaJmoD1J8bFqNXhsG6U\"]"), runtime_error);
+
+    // create shielded address so we have the spending key
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("z_getnewaddress sprout"));
+    std::string myzaddr = retValue.get_str();
+
+    // return empty array for this address
+    BOOST_CHECK_NO_THROW(retValue = CallRPC("z_listunspent 1 999 false [\"" + myzaddr + "\"]"));
+    UniValue arr = retValue.get_array();
+    BOOST_CHECK_EQUAL(0, arr.size());
+
+    // duplicate address error
+    BOOST_CHECK_THROW(CallRPC("z_listunspent 1 999 false [\"" + myzaddr + "\", \"" + myzaddr + "\"]"), runtime_error);
+}
+
+
+BOOST_AUTO_TEST_CASE(rpc_z_shieldcoinbase_parameters)
+{
+    SelectParams(CBaseChainParams::TESTNET);
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    BOOST_CHECK_THROW(CallRPC("z_shieldcoinbase"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("z_shieldcoinbase toofewargs"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("z_shieldcoinbase too many args shown here"), runtime_error);
+
+    // bad from address
+    BOOST_CHECK_THROW(CallRPC("z_shieldcoinbase "
+            "INVALIDtmRr6yJonqGK23UVhrKuyvTpF8qxQQjKigJ tnpoQJVnYBZZqkFadj2bJJLThNCxbADGB5gSGeYTAGGrT5tejsxY9Zc1BtY8nnHmZkB"), runtime_error);
+
+    // bad from address
+    BOOST_CHECK_THROW(CallRPC("z_shieldcoinbase "
+    "** tnpoQJVnYBZZqkFadj2bJJLThNCxbADGB5gSGeYTAGGrT5tejsxY9Zc1BtY8nnHmZkB"), runtime_error);
+
+    // bad to address
+    BOOST_CHECK_THROW(CallRPC("z_shieldcoinbase "
+    "tmRr6yJonqGK23UVhrKuyvTpF8qxQQjKigJ INVALIDtnpoQJVnYBZZqkFadj2bJJLThNCxbADGB5gSGeYTAGGrT5tejsxY9Zc1BtY8nnHmZkB"), runtime_error);
+
+    // invalid fee amount, cannot be negative
+    BOOST_CHECK_THROW(CallRPC("z_shieldcoinbase "
+            "tmRr6yJonqGK23UVhrKuyvTpF8qxQQjKigJ "
+            "tnpoQJVnYBZZqkFadj2bJJLThNCxbADGB5gSGeYTAGGrT5tejsxY9Zc1BtY8nnHmZkB "
+            "-0.00001"
+            ), runtime_error);
+
+    // invalid fee amount, bigger than MAX_MONEY
+    BOOST_CHECK_THROW(CallRPC("z_shieldcoinbase "
+            "tmRr6yJonqGK23UVhrKuyvTpF8qxQQjKigJ "
+            "tnpoQJVnYBZZqkFadj2bJJLThNCxbADGB5gSGeYTAGGrT5tejsxY9Zc1BtY8nnHmZkB "
+            "21000001"
+            ), runtime_error);
+
+    // invalid limit, must be at least 0
+    BOOST_CHECK_THROW(CallRPC("z_shieldcoinbase "
+    "tmRr6yJonqGK23UVhrKuyvTpF8qxQQjKigJ "
+    "tnpoQJVnYBZZqkFadj2bJJLThNCxbADGB5gSGeYTAGGrT5tejsxY9Zc1BtY8nnHmZkB "
+    "100 -1"
+    ), runtime_error);
+
+    // Mutable tx containing contextual information we need to build tx
+    UniValue retValue = CallRPC("getblockcount");
+    int nHeight = retValue.get_int();
+    CMutableTransaction mtx = CreateNewContextualCMutableTransaction(Params().GetConsensus(), nHeight + 1);
+    if (mtx.nVersion == 1) {
+        mtx.nVersion = 2;
+    }
+
+    // Test constructor of AsyncRPCOperation_shieldcoinbase
+    KeyIO keyIO(Params());
+    auto testnetzaddr = std::get<libzcash::SproutPaymentAddress>(keyIO.DecodePaymentAddress("ztjiDe569DPNbyTE6TSdJTaSDhoXEHLGvYoUnBU1wfVNU52TEyT6berYtySkd21njAeEoh8fFJUT42kua9r8EnhBaEKqCpP").value());
+
+    try {
+        std::shared_ptr<AsyncRPCOperation> operation(new AsyncRPCOperation_shieldcoinbase(TransactionBuilder(), mtx, {}, testnetzaddr, -1 ));
+    } catch (const UniValue& objError) {
+        BOOST_CHECK( find_error(objError, "Fee is out of range"));
+    }
+
+    try {
+        std::shared_ptr<AsyncRPCOperation> operation(new AsyncRPCOperation_shieldcoinbase(TransactionBuilder(), mtx, {}, testnetzaddr, 1));
+    } catch (const UniValue& objError) {
+        BOOST_CHECK( find_error(objError, "Empty inputs"));
+    }
+}
+
+BOOST_AUTO_TEST_CASE(rpc_z_mergetoaddress_parameters)
+{
+    SelectParams(CBaseChainParams::TESTNET);
+
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    BOOST_CHECK_THROW(CallRPC("z_mergetoaddress"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("z_mergetoaddress toofewargs"), runtime_error);
+    BOOST_CHECK_THROW(CallRPC("z_mergetoaddress just too many args present for this method"), runtime_error);
+
+    std::string taddr1 = "tmRr6yJonqGK23UVhrKuyvTpF8qxQQjKigJ";
+    std::string taddr2 = "tmYmhvdKqEte49iohoB9utgL1kPbGgWSdNc";
+    std::string aSproutAddr = "ztVtBC7vJFXPsZC8S3hXRu51rZysoJkSe6r1t9wk56bELrV9xTK6dx5TgSCH6RTw1dRD7HuApmcY1nhuQW9QfvE4MQXRRYU";
+    std::string aSaplingAddr = "ztestsapling19rnyu293v44f0kvtmszhx35lpdug574twc0lwyf4s7w0umtkrdq5nfcauxrxcyfmh3m7slemqsj";
+
+    CheckRPCThrows("z_mergetoaddress [] " + taddr1,
+        "Invalid parameter, fromaddresses array is empty.");
+
+    // bad from address
+    CheckRPCThrows("z_mergetoaddress [\"INVALID" + taddr1 + "\"] " + taddr2,
+        "Unknown address format: INVALID" + taddr1);
+
+    // bad from address
+    CheckRPCThrows("z_mergetoaddress ** " + taddr2,
+        "Error parsing JSON:**");
+
+    // bad from address
+    CheckRPCThrows("z_mergetoaddress [\"**\"] " + taddr2,
+        "Unknown address format: **");
+
+    // bad from address
+    CheckRPCThrows("z_mergetoaddress " + taddr1 + " " + taddr2,
+        "Error parsing JSON:" + taddr1);
+
+    // bad from address
+    CheckRPCThrows("z_mergetoaddress [" + taddr1 + "] " + taddr2,
+        "Error parsing JSON:[" + taddr1 + "]");
+
+    // bad to address
+    CheckRPCThrows("z_mergetoaddress [\"" + taddr1 + "\"] INVALID" + taddr2,
+        "Invalid parameter, unknown address format: INVALID" + taddr2);
+
+    // duplicate address
+    CheckRPCThrows("z_mergetoaddress [\"" + taddr1 + "\",\"" + taddr1 + "\"] " + taddr2,
+        "Invalid parameter, duplicated address: " + taddr1);
+
+    // invalid fee amount, cannot be negative
+    CheckRPCThrows("z_mergetoaddress [\"" + taddr1 + "\"] " + taddr2 + " -0.00001",
+        "Amount out of range");
+
+    // invalid fee amount, bigger than MAX_MONEY
+    CheckRPCThrows("z_mergetoaddress [\"" + taddr1 + "\"] "  + taddr2 + " 21000001",
+        "Amount out of range");
+
+    // invalid transparent limit, must be at least 0
+    CheckRPCThrows("z_mergetoaddress [\"" + taddr1 + "\"] " + taddr2 + " 0.00001 -1",
+        "Limit on maximum number of UTXOs cannot be negative");
+
+    // invalid shielded limit, must be at least 0
+    CheckRPCThrows("z_mergetoaddress [\"" + taddr1 + "\"] " + taddr2 + " 0.00001 100 -1",
+        "Limit on maximum number of notes cannot be negative");
+
+    CheckRPCThrows("z_mergetoaddress [\"ANY_TADDR\",\"" + taddr1 + "\"] " + taddr2,
+        "Cannot specify specific taddrs when using \"ANY_TADDR\"");
+
+    CheckRPCThrows("z_mergetoaddress [\"ANY_SPROUT\",\"" + aSproutAddr + "\"] " + taddr2,
+        "Cannot specify specific zaddrs when using \"ANY_SPROUT\" or \"ANY_SAPLING\"");
+
+    CheckRPCThrows("z_mergetoaddress [\"ANY_SAPLING\",\"" + aSaplingAddr + "\"] " + taddr2,
+        "Cannot specify specific zaddrs when using \"ANY_SPROUT\" or \"ANY_SAPLING\"");
+
+    // memo bigger than allowed length of ZC_MEMO_SIZE
+    std::vector<char> v (2 * (ZC_MEMO_SIZE+1));     // x2 for hexadecimal string format
+    std::fill(v.begin(),v.end(), 'A');
+    std::string badmemo(v.begin(), v.end());
+    CheckRPCThrows("z_mergetoaddress [\"" + taddr1 + "\"] " + aSproutAddr + " 0.00001 100 100 " + badmemo,
+        "Invalid parameter, size of memo is larger than maximum allowed 512");
+
+    // Mutable tx containing contextual information we need to build tx
+    UniValue retValue = CallRPC("getblockcount");
+    int nHeight = retValue.get_int();
+    CMutableTransaction mtx = CreateNewContextualCMutableTransaction(Params().GetConsensus(), nHeight + 1);
+
+    // Test constructor of AsyncRPCOperation_mergetoaddress
+    KeyIO keyIO(Params());
+    MergeToAddressRecipient testnetzaddr(
+        keyIO.DecodePaymentAddress("ztjiDe569DPNbyTE6TSdJTaSDhoXEHLGvYoUnBU1wfVNU52TEyT6berYtySkd21njAeEoh8fFJUT42kua9r8EnhBaEKqCpP").value(),
+        "testnet memo");
+
+    try {
+        std::shared_ptr<AsyncRPCOperation> operation(new AsyncRPCOperation_mergetoaddress(std::nullopt,  mtx, {}, {}, {}, testnetzaddr, -1 ));
+        BOOST_FAIL("Should have caused an error");
+    } catch (const UniValue& objError) {
+        BOOST_CHECK( find_error(objError, "Fee is out of range"));
+    }
+
+    try {
+        std::shared_ptr<AsyncRPCOperation> operation(new AsyncRPCOperation_mergetoaddress(std::nullopt, mtx, {}, {}, {}, testnetzaddr, 1));
+        BOOST_FAIL("Should have caused an error");
+    } catch (const UniValue& objError) {
+        BOOST_CHECK( find_error(objError, "No inputs"));
+    }
+
+    std::vector<MergeToAddressInputUTXO> inputs = { MergeToAddressInputUTXO{ COutPoint{uint256(), 0}, 0, CScript()} };
+
+    std::vector<MergeToAddressInputSproutNote> sproutNoteInputs =
+        {MergeToAddressInputSproutNote{JSOutPoint(), SproutNote(), 0, SproutSpendingKey()}};
+    std::vector<MergeToAddressInputSaplingNote> saplingNoteInputs =
+        {MergeToAddressInputSaplingNote{SaplingOutPoint(), SaplingNote({}, uint256(), 0, uint256(), Zip212Enabled::BeforeZip212), 0, SaplingExpandedSpendingKey()}};
+
+    // Sprout and Sapling inputs -> throw
+    try {
+        auto operation = new AsyncRPCOperation_mergetoaddress(std::nullopt, mtx, inputs, sproutNoteInputs, saplingNoteInputs, testnetzaddr, 1);
+        BOOST_FAIL("Should have caused an error");
+    } catch (const UniValue& objError) {
+        BOOST_CHECK(find_error(objError, "Cannot send from both Sprout and Sapling addresses using z_mergetoaddress"));
+    }
+    // Sprout inputs and TransactionBuilder -> throw
+    try {
+        auto operation = new AsyncRPCOperation_mergetoaddress(TransactionBuilder(), mtx, inputs, sproutNoteInputs, {}, testnetzaddr, 1);
+        BOOST_FAIL("Should have caused an error");
+    } catch (const UniValue& objError) {
+        BOOST_CHECK(find_error(objError, "Sprout notes are not supported by the TransactionBuilder"));
+    }
+}
+
+void TestWTxStatus(const Consensus::Params consensusParams, const int delta) {
+
+    auto AddTrx = [&consensusParams]() {
+        auto taddr = pwalletMain->GenerateNewKey(true).GetID();
+        CMutableTransaction mtx = CreateNewContextualCMutableTransaction(consensusParams, 1);
+        CScript scriptPubKey = CScript() << OP_DUP << OP_HASH160 << ToByteVector(taddr) << OP_EQUALVERIFY << OP_CHECKSIG;
+        mtx.vout.push_back(CTxOut(5 * COIN, scriptPubKey));
+        CWalletTx wtx(pwalletMain, mtx);
+        pwalletMain->LoadWalletTx(wtx);
+        return wtx;
+    };
+
+    vector<uint256> hashes;
+    CWalletTx wtx;
+    auto FakeMine = [&](const int height, bool has_trx) {
+        BOOST_CHECK_EQUAL(height, chainActive.Height());
+        CBlock block;
+        if (has_trx) block.vtx.push_back(wtx);
+        block.hashMerkleRoot = block.BuildMerkleTree();
+        auto blockHash = block.GetHash();
+        CBlockIndex fakeIndex {block};
+        fakeIndex.nHeight = height+1;
+        mapBlockIndex.insert(std::make_pair(blockHash, &fakeIndex));
+        chainActive.SetTip(&fakeIndex);
+        BOOST_CHECK(chainActive.Contains(&fakeIndex));
+        BOOST_CHECK_EQUAL(height+1, chainActive.Height());
+
+        if (has_trx) {
+            wtx.SetMerkleBranch(block);
+            pwalletMain->LoadWalletTx(wtx);
+        }
+
+        hashes.push_back(blockHash);
+        UniValue retValue = CallRPC("gettransaction " + wtx.GetHash().GetHex());
+        return retValue.get_obj();
+    };
+
+    // Add a transaction to the wallet
+    wtx = AddTrx();
+
+    // Mine blocks but never include the transaction, check status of wallet trx
+    for(int i=0; i<=delta + 1; i++) {
+        auto retObj = FakeMine(i, false);
+
+        BOOST_CHECK_EQUAL(find_value(retObj, "confirmations").get_real(), -1);
+        auto status = find_value(retObj, "status").get_str();
+        if (i >= delta - TX_EXPIRING_SOON_THRESHOLD && i <= delta)
+            BOOST_CHECK_EQUAL(status, "expiringsoon");
+        else if (i >= delta - TX_EXPIRING_SOON_THRESHOLD)
+            BOOST_CHECK_EQUAL(status, "expired");
+        else
+            BOOST_CHECK_EQUAL(status, "waiting");
+    }
+
+    // Now mine including the transaction, check status
+    auto retObj = FakeMine(delta + 2, true);
+
+    BOOST_CHECK_EQUAL(find_value(retObj, "confirmations").get_real(), 1);
+    BOOST_CHECK_EQUAL(find_value(retObj, "status").get_str(), "mined");
+
+    // Cleanup
+    chainActive.SetTip(NULL);
+    for (auto hash : hashes)
+        mapBlockIndex.erase(hash);
+}
+
+BOOST_AUTO_TEST_CASE(rpc_gettransaction_status_sapling)
+{
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+
+    TestWTxStatus(RegtestActivateSapling(), DEFAULT_PRE_BLOSSOM_TX_EXPIRY_DELTA);
+
+    RegtestDeactivateSapling();
+}
+
+BOOST_AUTO_TEST_CASE(rpc_gettransaction_status_blossom)
+{
+    LOCK2(cs_main, pwalletMain->cs_wallet);
+    auto params = RegtestActivateBlossom(true).GetConsensus();
+
+    TestWTxStatus(params, DEFAULT_POST_BLOSSOM_TX_EXPIRY_DELTA);
+
+    RegtestDeactivateBlossom();
+}
+
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/wallet/test/wallet_test_fixture.cpp b/depend/zcash/src/wallet/test/wallet_test_fixture.cpp
new file mode 100644
index 000000000..0b5694f47
--- /dev/null
+++ b/depend/zcash/src/wallet/test/wallet_test_fixture.cpp
@@ -0,0 +1,31 @@
+#include "wallet/test/wallet_test_fixture.h"
+
+#include "rpc/server.h"
+#include "wallet/db.h"
+#include "wallet/wallet.h"
+
+WalletTestingSetup::WalletTestingSetup(): TestingSetup()
+{
+    bitdb.MakeMock();
+
+    bool fFirstRun;
+    pwalletMain = new CWallet(Params(), "wallet_test.dat");
+    pwalletMain->LoadWallet(fFirstRun);
+    if (!pwalletMain->HaveMnemonicSeed()) {
+        pwalletMain->GenerateNewSeed();
+        pwalletMain->VerifyMnemonicSeed(pwalletMain->GetMnemonicSeed().value().GetMnemonic());
+    }
+
+    RegisterValidationInterface(pwalletMain);
+    RegisterWalletRPCCommands(tableRPC);
+}
+
+WalletTestingSetup::~WalletTestingSetup()
+{
+    UnregisterValidationInterface(pwalletMain);
+    delete pwalletMain;
+    pwalletMain = NULL;
+
+    bitdb.Flush(true);
+    bitdb.Reset();
+}
diff --git a/depend/zcash/src/wallet/test/wallet_test_fixture.h b/depend/zcash/src/wallet/test/wallet_test_fixture.h
new file mode 100644
index 000000000..a32dc69b1
--- /dev/null
+++ b/depend/zcash/src/wallet/test/wallet_test_fixture.h
@@ -0,0 +1,17 @@
+// Copyright (c) 2016 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_WALLET_TEST_WALLET_TEST_FIXTURE_H
+#define BITCOIN_WALLET_TEST_WALLET_TEST_FIXTURE_H
+
+#include "test/test_bitcoin.h"
+
+/** Testing setup and teardown for wallet.
+ */
+struct WalletTestingSetup: public TestingSetup {
+    WalletTestingSetup();
+    ~WalletTestingSetup();
+};
+
+#endif // BITCOIN_WALLET_TEST_WALLET_TEST_FIXTURE_H
diff --git a/depend/zcash/src/wallet/test/wallet_tests.cpp b/depend/zcash/src/wallet/test/wallet_tests.cpp
new file mode 100644
index 000000000..09a7aadb7
--- /dev/null
+++ b/depend/zcash/src/wallet/test/wallet_tests.cpp
@@ -0,0 +1,327 @@
+// Copyright (c) 2012-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "wallet/wallet.h"
+
+#include <set>
+#include <stdint.h>
+#include <utility>
+#include <vector>
+
+#include "wallet/test/wallet_test_fixture.h"
+
+#include <boost/test/unit_test.hpp>
+
+// how many times to run all the tests to have a chance to catch errors that only show up with particular random shuffles
+#define RUN_TESTS 100
+
+// some tests fail 1% of the time due to bad luck.
+// we repeat those tests this many times and only complain if all iterations of the test fail
+#define RANDOM_REPEATS 5
+
+using namespace std;
+
+typedef set<pair<const CWalletTx*,unsigned int> > CoinSet;
+
+BOOST_FIXTURE_TEST_SUITE(wallet_tests, WalletTestingSetup)
+
+static vector<COutput> vCoins;
+
+static void add_coin(const CAmount& nValue, int nAge = 6*24, bool fIsFromMe = false, int nInput=0)
+{
+    static int nextLockTime = 0;
+    CMutableTransaction tx;
+    tx.nLockTime = nextLockTime++;        // so all transactions get different hashes
+    tx.vout.resize(nInput+1);
+    tx.vout[nInput].nValue = nValue;
+    if (fIsFromMe) {
+        // IsFromMe() returns (GetDebit() > 0), and GetDebit() is 0 if vin.empty(),
+        // so stop vin being empty, and cache a non-zero Debit to fake out IsFromMe()
+        tx.vin.resize(1);
+    }
+    CWalletTx* wtx = new CWalletTx(pwalletMain, tx);
+    if (fIsFromMe)
+    {
+        wtx->fDebitCached = true;
+        wtx->nDebitCached = 1;
+    }
+    COutput output(wtx, nInput, nAge, true);
+    vCoins.push_back(output);
+}
+
+static void empty_wallet(void)
+{
+    for (COutput output : vCoins)
+        delete output.tx;
+    vCoins.clear();
+}
+
+static bool equal_sets(CoinSet a, CoinSet b)
+{
+    pair<CoinSet::iterator, CoinSet::iterator> ret = mismatch(a.begin(), a.end(), b.begin());
+    return ret.first == a.end() && ret.second == b.end();
+}
+
+BOOST_AUTO_TEST_CASE(coin_selection_tests)
+{
+    CoinSet setCoinsRet, setCoinsRet2;
+    CAmount nValueRet;
+
+    // test multiple times to allow for differences in the shuffle order
+    for (int i = 0; i < RUN_TESTS; i++)
+    {
+        empty_wallet();
+
+        // with an empty wallet we can't even pay one cent
+        BOOST_CHECK(!CWallet::SelectCoinsMinConf( 1 * CENT, 1, 6, vCoins, setCoinsRet, nValueRet));
+
+        add_coin(1*CENT, 4);        // add a new 1 cent coin
+
+        // with a new 1 cent coin, we still can't find a mature 1 cent
+        BOOST_CHECK(!CWallet::SelectCoinsMinConf( 1 * CENT, 1, 6, vCoins, setCoinsRet, nValueRet));
+
+        // but we can find a new 1 cent
+        BOOST_CHECK( CWallet::SelectCoinsMinConf( 1 * CENT, 1, 1, vCoins, setCoinsRet, nValueRet));
+        BOOST_CHECK_EQUAL(nValueRet, 1 * CENT);
+
+        add_coin(2*CENT);           // add a mature 2 cent coin
+
+        // we can't make 3 cents of mature coins
+        BOOST_CHECK(!CWallet::SelectCoinsMinConf( 3 * CENT, 1, 6, vCoins, setCoinsRet, nValueRet));
+
+        // we can make 3 cents of new  coins
+        BOOST_CHECK( CWallet::SelectCoinsMinConf( 3 * CENT, 1, 1, vCoins, setCoinsRet, nValueRet));
+        BOOST_CHECK_EQUAL(nValueRet, 3 * CENT);
+
+        add_coin(5*CENT);           // add a mature 5 cent coin,
+        add_coin(10*CENT, 3, true); // a new 10 cent coin sent from one of our own addresses
+        add_coin(20*CENT);          // and a mature 20 cent coin
+
+        // now we have new: 1+10=11 (of which 10 was self-sent), and mature: 2+5+20=27.  total = 38
+
+        // we can't make 38 cents only if we disallow new coins:
+        BOOST_CHECK(!CWallet::SelectCoinsMinConf(38 * CENT, 1, 6, vCoins, setCoinsRet, nValueRet));
+        // we can't even make 37 cents if we don't allow new coins even if they're from us
+        BOOST_CHECK(!CWallet::SelectCoinsMinConf(38 * CENT, 6, 6, vCoins, setCoinsRet, nValueRet));
+        // but we can make 37 cents if we accept new coins from ourself
+        BOOST_CHECK( CWallet::SelectCoinsMinConf(37 * CENT, 1, 6, vCoins, setCoinsRet, nValueRet));
+        BOOST_CHECK_EQUAL(nValueRet, 37 * CENT);
+        // and we can make 38 cents if we accept all new coins
+        BOOST_CHECK( CWallet::SelectCoinsMinConf(38 * CENT, 1, 1, vCoins, setCoinsRet, nValueRet));
+        BOOST_CHECK_EQUAL(nValueRet, 38 * CENT);
+
+        // try making 34 cents from 1,2,5,10,20 - we can't do it exactly
+        BOOST_CHECK( CWallet::SelectCoinsMinConf(34 * CENT, 1, 1, vCoins, setCoinsRet, nValueRet));
+        BOOST_CHECK_EQUAL(nValueRet, 35 * CENT);       // but 35 cents is closest
+        BOOST_CHECK_EQUAL(setCoinsRet.size(), 3U);     // the best should be 20+10+5.  it's incredibly unlikely the 1 or 2 got included (but possible)
+
+        // when we try making 7 cents, the smaller coins (1,2,5) are enough.  We should see just 2+5
+        BOOST_CHECK( CWallet::SelectCoinsMinConf( 7 * CENT, 1, 1, vCoins, setCoinsRet, nValueRet));
+        BOOST_CHECK_EQUAL(nValueRet, 7 * CENT);
+        BOOST_CHECK_EQUAL(setCoinsRet.size(), 2U);
+
+        // when we try making 8 cents, the smaller coins (1,2,5) are exactly enough.
+        BOOST_CHECK( CWallet::SelectCoinsMinConf( 8 * CENT, 1, 1, vCoins, setCoinsRet, nValueRet));
+        BOOST_CHECK(nValueRet == 8 * CENT);
+        BOOST_CHECK_EQUAL(setCoinsRet.size(), 3U);
+
+        // when we try making 9 cents, no subset of smaller coins is enough, and we get the next bigger coin (10)
+        BOOST_CHECK( CWallet::SelectCoinsMinConf( 9 * CENT, 1, 1, vCoins, setCoinsRet, nValueRet));
+        BOOST_CHECK_EQUAL(nValueRet, 10 * CENT);
+        BOOST_CHECK_EQUAL(setCoinsRet.size(), 1U);
+
+        // now clear out the wallet and start again to test choosing between subsets of smaller coins and the next biggest coin
+        empty_wallet();
+
+        add_coin( 6*CENT);
+        add_coin( 7*CENT);
+        add_coin( 8*CENT);
+        add_coin(20*CENT);
+        add_coin(30*CENT); // now we have 6+7+8+20+30 = 71 cents total
+
+        // check that we have 71 and not 72
+        BOOST_CHECK( CWallet::SelectCoinsMinConf(71 * CENT, 1, 1, vCoins, setCoinsRet, nValueRet));
+        BOOST_CHECK(!CWallet::SelectCoinsMinConf(72 * CENT, 1, 1, vCoins, setCoinsRet, nValueRet));
+
+        // now try making 16 cents.  the best smaller coins can do is 6+7+8 = 21; not as good at the next biggest coin, 20
+        BOOST_CHECK( CWallet::SelectCoinsMinConf(16 * CENT, 1, 1, vCoins, setCoinsRet, nValueRet));
+        BOOST_CHECK_EQUAL(nValueRet, 20 * CENT); // we should get 20 in one coin
+        BOOST_CHECK_EQUAL(setCoinsRet.size(), 1U);
+
+        add_coin( 5*CENT); // now we have 5+6+7+8+20+30 = 75 cents total
+
+        // now if we try making 16 cents again, the smaller coins can make 5+6+7 = 18 cents, better than the next biggest coin, 20
+        BOOST_CHECK( CWallet::SelectCoinsMinConf(16 * CENT, 1, 1, vCoins, setCoinsRet, nValueRet));
+        BOOST_CHECK_EQUAL(nValueRet, 18 * CENT); // we should get 18 in 3 coins
+        BOOST_CHECK_EQUAL(setCoinsRet.size(), 3U);
+
+        add_coin( 18*CENT); // now we have 5+6+7+8+18+20+30
+
+        // and now if we try making 16 cents again, the smaller coins can make 5+6+7 = 18 cents, the same as the next biggest coin, 18
+        BOOST_CHECK( CWallet::SelectCoinsMinConf(16 * CENT, 1, 1, vCoins, setCoinsRet, nValueRet));
+        BOOST_CHECK_EQUAL(nValueRet, 18 * CENT);  // we should get 18 in 1 coin
+        BOOST_CHECK_EQUAL(setCoinsRet.size(), 1U); // because in the event of a tie, the biggest coin wins
+
+        // now try making 11 cents.  we should get 5+6
+        BOOST_CHECK( CWallet::SelectCoinsMinConf(11 * CENT, 1, 1, vCoins, setCoinsRet, nValueRet));
+        BOOST_CHECK_EQUAL(nValueRet, 11 * CENT);
+        BOOST_CHECK_EQUAL(setCoinsRet.size(), 2U);
+
+        // check that the smallest bigger coin is used
+        add_coin( 1*COIN);
+        add_coin( 2*COIN);
+        add_coin( 3*COIN);
+        add_coin( 4*COIN); // now we have 5+6+7+8+18+20+30+100+200+300+400 = 1094 cents
+        BOOST_CHECK( CWallet::SelectCoinsMinConf(95 * CENT, 1, 1, vCoins, setCoinsRet, nValueRet));
+        BOOST_CHECK_EQUAL(nValueRet, 1 * COIN);  // we should get 1 BTC in 1 coin
+        BOOST_CHECK_EQUAL(setCoinsRet.size(), 1U);
+
+        BOOST_CHECK( CWallet::SelectCoinsMinConf(195 * CENT, 1, 1, vCoins, setCoinsRet, nValueRet));
+        BOOST_CHECK_EQUAL(nValueRet, 2 * COIN);  // we should get 2 BTC in 1 coin
+        BOOST_CHECK_EQUAL(setCoinsRet.size(), 1U);
+
+        // empty the wallet and start again, now with fractions of a cent, to test small change avoidance
+
+        empty_wallet();
+        add_coin(0.1*MIN_CHANGE);
+        add_coin(0.2*MIN_CHANGE);
+        add_coin(0.3*MIN_CHANGE);
+        add_coin(0.4*MIN_CHANGE);
+        add_coin(0.5*MIN_CHANGE);
+
+        // try making 1 * MIN_CHANGE from the 1.5 * MIN_CHANGE
+        // we'll get change smaller than MIN_CHANGE whatever happens, so can expect MIN_CHANGE exactly
+        BOOST_CHECK( CWallet::SelectCoinsMinConf(MIN_CHANGE, 1, 1, vCoins, setCoinsRet, nValueRet));
+        BOOST_CHECK_EQUAL(nValueRet, MIN_CHANGE);
+
+        // but if we add a bigger coin, small change is avoided
+        add_coin(1111*MIN_CHANGE);
+
+        // try making 1 from 0.1 + 0.2 + 0.3 + 0.4 + 0.5 + 1111 = 1112.5
+        BOOST_CHECK( CWallet::SelectCoinsMinConf(1 * MIN_CHANGE, 1, 1, vCoins, setCoinsRet, nValueRet));
+        BOOST_CHECK_EQUAL(nValueRet, 1 * MIN_CHANGE); // we should get the exact amount
+
+        // if we add more small coins:
+        add_coin(0.6*MIN_CHANGE);
+        add_coin(0.7*MIN_CHANGE);
+
+        // and try again to make 1.0 * MIN_CHANGE
+        BOOST_CHECK( CWallet::SelectCoinsMinConf(1 * MIN_CHANGE, 1, 1, vCoins, setCoinsRet, nValueRet));
+        BOOST_CHECK_EQUAL(nValueRet, 1 * MIN_CHANGE); // we should get the exact amount
+
+        // run the 'mtgox' test (see https://blockchair.com/bitcoin/transaction/29a3efd3ef04f9153d47a990bd7b048a4b2d213daaa5fb8ed670fb85f13bdbcf)
+        // they tried to consolidate 10 50k coins into one 500k coin, and ended up with 50k in change
+        empty_wallet();
+        for (int i = 0; i < 20; i++)
+            add_coin(50000 * COIN);
+
+        BOOST_CHECK( CWallet::SelectCoinsMinConf(500000 * COIN, 1, 1, vCoins, setCoinsRet, nValueRet));
+        BOOST_CHECK_EQUAL(nValueRet, 500000 * COIN); // we should get the exact amount
+        BOOST_CHECK_EQUAL(setCoinsRet.size(), 10U); // in ten coins
+
+        // if there's not enough in the smaller coins to make at least 1 * MIN_CHANGE change (0.5+0.6+0.7 < 1.0+1.0),
+        // we need to try finding an exact subset anyway
+
+        // sometimes it will fail, and so we use the next biggest coin:
+        empty_wallet();
+        add_coin(0.5 * MIN_CHANGE);
+        add_coin(0.6 * MIN_CHANGE);
+        add_coin(0.7 * MIN_CHANGE);
+        add_coin(1111 * MIN_CHANGE);
+        BOOST_CHECK( CWallet::SelectCoinsMinConf(1 * MIN_CHANGE, 1, 1, vCoins, setCoinsRet, nValueRet));
+        BOOST_CHECK_EQUAL(nValueRet, 1111 * MIN_CHANGE); // we get the bigger coin
+        BOOST_CHECK_EQUAL(setCoinsRet.size(), 1U);
+
+        // but sometimes it's possible, and we use an exact subset (0.4 + 0.6 = 1.0)
+        empty_wallet();
+        add_coin(0.4 * MIN_CHANGE);
+        add_coin(0.6 * MIN_CHANGE);
+        add_coin(0.8 * MIN_CHANGE);
+        add_coin(1111 * MIN_CHANGE);
+        BOOST_CHECK( CWallet::SelectCoinsMinConf(MIN_CHANGE, 1, 1, vCoins, setCoinsRet, nValueRet));
+        BOOST_CHECK_EQUAL(nValueRet, MIN_CHANGE);   // we should get the exact amount
+        BOOST_CHECK_EQUAL(setCoinsRet.size(), 2U); // in two coins 0.4+0.6
+
+        // test avoiding small change
+        empty_wallet();
+        add_coin(0.05 * MIN_CHANGE);
+        add_coin(1    * MIN_CHANGE);
+        add_coin(100  * MIN_CHANGE);
+
+        // trying to make 100.01 from these three coins
+        BOOST_CHECK( CWallet::SelectCoinsMinConf(100.01 * MIN_CHANGE, 1, 1, vCoins, setCoinsRet, nValueRet));
+        BOOST_CHECK_EQUAL(nValueRet, 101.05 * MIN_CHANGE);   // we should get all coins
+        BOOST_CHECK_EQUAL(setCoinsRet.size(), 3U);
+
+        // but if we try to make 99.9, we should take the bigger of the two small coins to avoid small change
+        BOOST_CHECK( CWallet::SelectCoinsMinConf(99.9 * MIN_CHANGE, 1, 1, vCoins, setCoinsRet, nValueRet));
+        BOOST_CHECK_EQUAL(nValueRet, 101 * MIN_CHANGE);
+        BOOST_CHECK_EQUAL(setCoinsRet.size(), 2U);
+
+        // test with many inputs
+        for (CAmount amt=1500; amt < COIN; amt*=10) {
+             empty_wallet();
+             // Create 676 inputs (= MAX_STANDARD_TX_SIZE / 148 bytes per input)
+             for (uint16_t j = 0; j < 676; j++)
+                 add_coin(amt);
+             BOOST_CHECK(CWallet::SelectCoinsMinConf(2000, 1, 1, vCoins, setCoinsRet, nValueRet));
+             if (amt - 2000 < MIN_CHANGE) {
+                 // needs more than one input:
+                 uint16_t returnSize = std::ceil((2000.0 + MIN_CHANGE)/amt);
+                 CAmount returnValue = amt * returnSize;
+                 BOOST_CHECK_EQUAL(nValueRet, returnValue);
+                 BOOST_CHECK_EQUAL(setCoinsRet.size(), returnSize);
+             } else {
+                 // one input is sufficient:
+                 BOOST_CHECK_EQUAL(nValueRet, amt);
+                 BOOST_CHECK_EQUAL(setCoinsRet.size(), 1U);
+             }
+        }
+
+        // test randomness
+        {
+            empty_wallet();
+            for (int i2 = 0; i2 < 100; i2++)
+                add_coin(COIN);
+
+            // picking 50 from 100 coins doesn't depend on the shuffle,
+            // but does depend on randomness in the stochastic approximation code
+            BOOST_CHECK(CWallet::SelectCoinsMinConf(50 * COIN, 1, 6, vCoins, setCoinsRet , nValueRet));
+            BOOST_CHECK(CWallet::SelectCoinsMinConf(50 * COIN, 1, 6, vCoins, setCoinsRet2, nValueRet));
+            BOOST_CHECK(!equal_sets(setCoinsRet, setCoinsRet2));
+
+            int fails = 0;
+            for (int i = 0; i < RANDOM_REPEATS; i++)
+            {
+                // selecting 1 from 100 identical coins depends on the shuffle; this test will fail 1% of the time
+                // run the test RANDOM_REPEATS times and only complain if all of them fail
+                BOOST_CHECK(CWallet::SelectCoinsMinConf(COIN, 1, 6, vCoins, setCoinsRet , nValueRet));
+                BOOST_CHECK(CWallet::SelectCoinsMinConf(COIN, 1, 6, vCoins, setCoinsRet2, nValueRet));
+                if (equal_sets(setCoinsRet, setCoinsRet2))
+                    fails++;
+            }
+            BOOST_CHECK_NE(fails, RANDOM_REPEATS);
+
+            // add 75 cents in small change.  not enough to make 90 cents,
+            // then try making 90 cents.  there are multiple competing "smallest bigger" coins,
+            // one of which should be picked at random
+            add_coin( 5*CENT); add_coin(10*CENT); add_coin(15*CENT); add_coin(20*CENT); add_coin(25*CENT);
+
+            fails = 0;
+            for (int i = 0; i < RANDOM_REPEATS; i++)
+            {
+                // selecting 1 from 100 identical coins depends on the shuffle; this test will fail 1% of the time
+                // run the test RANDOM_REPEATS times and only complain if all of them fail
+                BOOST_CHECK(CWallet::SelectCoinsMinConf(90*CENT, 1, 6, vCoins, setCoinsRet , nValueRet));
+                BOOST_CHECK(CWallet::SelectCoinsMinConf(90*CENT, 1, 6, vCoins, setCoinsRet2, nValueRet));
+                if (equal_sets(setCoinsRet, setCoinsRet2))
+                    fails++;
+            }
+            BOOST_CHECK_NE(fails, RANDOM_REPEATS);
+        }
+    }
+    empty_wallet();
+}
+
+BOOST_AUTO_TEST_SUITE_END()
diff --git a/depend/zcash/src/wallet/wallet.cpp b/depend/zcash/src/wallet/wallet.cpp
new file mode 100644
index 000000000..203f42da3
--- /dev/null
+++ b/depend/zcash/src/wallet/wallet.cpp
@@ -0,0 +1,7858 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Copyright (c) 2016-2022 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "wallet/wallet.h"
+
+#include "asyncrpcqueue.h"
+#include "checkpoints.h"
+#include "coincontrol.h"
+#include "core_io.h"
+#include "consensus/upgrades.h"
+#include "consensus/validation.h"
+#include "consensus/consensus.h"
+#include "fs.h"
+#include "init.h"
+#include "key_io.h"
+#include "main.h"
+#include "net.h"
+#include "policy/policy.h"
+#include "random.h"
+#include "rpc/protocol.h"
+#include "rpc/server.h"
+#include "script/script.h"
+#include "script/sign.h"
+#include "timedata.h"
+#include "utilmoneystr.h"
+#include "util/match.h"
+#include "zcash/Address.hpp"
+#include "zcash/JoinSplit.hpp"
+#include "zcash/Note.hpp"
+#include "crypter.h"
+#include "wallet/asyncrpcoperation_saplingmigration.h"
+
+#include <algorithm>
+#include <assert.h>
+#include <numeric>
+#include <variant>
+
+#include <boost/algorithm/string/replace.hpp>
+#include <boost/thread.hpp>
+
+using namespace std;
+using namespace libzcash;
+
+CWallet* pwalletMain = NULL;
+/** Transaction fee set by the user */
+CFeeRate payTxFee(DEFAULT_TRANSACTION_FEE);
+unsigned int nTxConfirmTarget = DEFAULT_TX_CONFIRM_TARGET;
+bool bSpendZeroConfChange = DEFAULT_SPEND_ZEROCONF_CHANGE;
+bool fSendFreeTransactions = DEFAULT_SEND_FREE_TRANSACTIONS;
+bool fPayAtLeastCustomFee = true;
+unsigned int nAnchorConfirmations = DEFAULT_ANCHOR_CONFIRMATIONS;
+unsigned int nOrchardActionLimit = DEFAULT_ORCHARD_ACTION_LIMIT;
+
+const char * DEFAULT_WALLET_DAT = "wallet.dat";
+
+/**
+ * Fees smaller than this (in satoshi) are considered zero fee (for transaction creation)
+ * Override with -mintxfee
+ */
+CFeeRate CWallet::minTxFee = CFeeRate(DEFAULT_TRANSACTION_MINFEE);
+
+std::set<ReceiverType> CWallet::DefaultReceiverTypes(int nHeight) {
+    // For now, just ignore the height information because the default
+    // is always the same.
+    return {ReceiverType::P2PKH, ReceiverType::Sapling, ReceiverType::Orchard};
+}
+
+/** @defgroup mapWallet
+ *
+ * @{
+ */
+
+struct CompareValueOnly
+{
+    bool operator()(const pair<CAmount, pair<const CWalletTx*, unsigned int> >& t1,
+                    const pair<CAmount, pair<const CWalletTx*, unsigned int> >& t2) const
+    {
+        return t1.first < t2.first;
+    }
+};
+
+std::string JSOutPoint::ToString() const
+{
+    return strprintf("JSOutPoint(%s, %d, %d)", hash.ToString().substr(0,10), js, n);
+}
+
+std::string COutput::ToString() const
+{
+    return strprintf("COutput(%s, %d, %d) [%s]", tx->GetHash().ToString(), i, nDepth, FormatMoney(tx->vout[i].nValue));
+}
+
+const CWalletTx* CWallet::GetWalletTx(const uint256& hash) const
+{
+    LOCK(cs_wallet);
+    std::map<uint256, CWalletTx>::const_iterator it = mapWallet.find(hash);
+    if (it == mapWallet.end())
+        return NULL;
+    return &(it->second);
+}
+
+// Generate a new spending key and return its public payment address
+libzcash::SproutPaymentAddress CWallet::GenerateNewSproutZKey()
+{
+    AssertLockHeld(cs_wallet); // mapSproutZKeyMetadata
+
+    auto k = SproutSpendingKey::random();
+    auto addr = k.address();
+
+    // Check for collision, even though it is unlikely to ever occur
+    if (CCryptoKeyStore::HaveSproutSpendingKey(addr))
+        throw std::runtime_error("CWallet::GenerateNewSproutZKey(): Collision detected");
+
+    // Create new metadata
+    int64_t nCreationTime = GetTime();
+    mapSproutZKeyMetadata[addr] = CKeyMetadata(nCreationTime);
+
+    if (!AddSproutZKey(k))
+        throw std::runtime_error("CWallet::GenerateNewSproutZKey(): AddSproutZKey failed");
+    return addr;
+}
+
+// Generates a new Sapling spending key as a child of the legacy Sapling account,
+// and returns its public payment address.
+//
+// The z_getnewaddress API must use the mnemonic HD seed, and fail if that seed
+// is not present. The account index is determined by trial of values of
+// mnemonicHDChain.GetLegacySaplingKeyCounter() until one is found that produces
+// a valid Sapling key.
+SaplingPaymentAddress CWallet::GenerateNewLegacySaplingZKey() {
+    AssertLockHeld(cs_wallet);
+
+    if (!mnemonicHDChain.has_value()) {
+        throw std::runtime_error(
+                "CWallet::GenerateNewLegacySaplingZKey(): Wallet is missing mnemonic seed metadata.");
+    }
+    CHDChain& hdChain = mnemonicHDChain.value();
+
+    // loop until we find an unused address index
+    while (true) {
+        auto generated = GenerateLegacySaplingZKey(hdChain.GetLegacySaplingKeyCounter());
+
+        // advance the address index counter so that the next time we need to generate
+        // a key we're pointing at a free index.
+        hdChain.IncrementLegacySaplingKeyCounter();
+        if (!generated.second) {
+            // the key already existed, so try the next one
+            continue;
+        } else {
+            // Update the persisted chain information
+            if (fFileBacked && !CWalletDB(strWalletFile).WriteMnemonicHDChain(hdChain)) {
+                throw std::runtime_error(
+                        "CWallet::GenerateNewLegacySaplingZKey(): Writing HD chain model failed");
+            }
+
+            return generated.first;
+        }
+    }
+}
+
+std::pair<SaplingPaymentAddress, bool> CWallet::GenerateLegacySaplingZKey(uint32_t addrIndex) {
+    auto seedOpt = GetMnemonicSeed();
+    if (!seedOpt.has_value()) {
+        throw std::runtime_error(
+                "CWallet::GenerateLegacySaplingZKey(): Wallet does not have a mnemonic seed.");
+    }
+    auto seed = seedOpt.value();
+
+    auto xsk = libzcash::SaplingExtendedSpendingKey::Legacy(seed, BIP44CoinType(), addrIndex);
+    auto extfvk = xsk.first.ToXFVK();
+    if (!HaveSaplingSpendingKey(extfvk)) {
+        auto ivk = extfvk.ToIncomingViewingKey();
+        CKeyMetadata keyMeta(GetTime());
+        keyMeta.hdKeypath = xsk.second;
+        keyMeta.seedFp = seed.Fingerprint();
+        mapSaplingZKeyMetadata[ivk] = keyMeta;
+
+        if (!AddSaplingZKey(xsk.first)) {
+            throw std::runtime_error("CWallet::GenerateLegacySaplingZKey(): AddSaplingZKey failed.");
+        }
+
+        auto addr = extfvk.DefaultAddress();
+        if (!AddSaplingPaymentAddress(ivk, addr)) {
+            throw std::runtime_error("CWallet::GenerateLegacySaplingZKey(): AddSaplingPaymentAddress failed.");
+        };
+
+        return std::make_pair(addr, true) ;
+    } else {
+        return std::make_pair(extfvk.DefaultAddress(), false);
+    }
+}
+
+// Add spending key to keystore
+bool CWallet::AddSaplingZKey(const libzcash::SaplingExtendedSpendingKey &sk)
+{
+    AssertLockHeld(cs_wallet); // mapSaplingZKeyMetadata
+
+    if (!CCryptoKeyStore::AddSaplingSpendingKey(sk)) {
+        return false;
+    }
+
+    if (!fFileBacked) {
+        return true;
+    }
+
+    if (!IsCrypted()) {
+        auto ivk = sk.expsk.full_viewing_key().in_viewing_key();
+        return CWalletDB(strWalletFile).WriteSaplingZKey(ivk, sk, mapSaplingZKeyMetadata[ivk]);
+    }
+
+    return true;
+}
+
+bool CWallet::AddSaplingFullViewingKey(const libzcash::SaplingExtendedFullViewingKey &extfvk)
+{
+    AssertLockHeld(cs_wallet);
+
+    if (!CCryptoKeyStore::AddSaplingFullViewingKey(extfvk)) {
+        return false;
+    }
+
+    if (!fFileBacked) {
+        return true;
+    }
+
+    return CWalletDB(strWalletFile).WriteSaplingExtendedFullViewingKey(extfvk);
+}
+
+// Add payment address -> incoming viewing key map entry
+bool CWallet::AddSaplingPaymentAddress(
+    const libzcash::SaplingIncomingViewingKey &ivk,
+    const libzcash::SaplingPaymentAddress &addr)
+{
+    AssertLockHeld(cs_wallet); // mapSaplingZKeyMetadata
+
+    if (!CCryptoKeyStore::AddSaplingPaymentAddress(ivk, addr)) {
+        return false;
+    }
+
+    if (!fFileBacked) {
+        return true;
+    }
+
+    return CWalletDB(strWalletFile).WriteSaplingPaymentAddress(addr, ivk);
+}
+
+// Add spending key to keystore
+bool CWallet::AddOrchardZKey(const libzcash::OrchardSpendingKey &sk)
+{
+    AssertLockHeld(cs_wallet); // orchardWallet
+
+    if (IsCrypted()) {
+        // encrypted storage of Orchard spending keys is not supported
+        return false;
+    }
+
+    orchardWallet.AddSpendingKey(sk);
+
+    if (!fFileBacked) {
+        return true;
+    }
+
+    return true; // TODO ORCHARD: persist spending key
+}
+
+bool CWallet::AddOrchardFullViewingKey(const libzcash::OrchardFullViewingKey &fvk)
+{
+    AssertLockHeld(cs_wallet); // orchardWallet
+    orchardWallet.AddFullViewingKey(fvk);
+
+    if (!fFileBacked) {
+        return true;
+    }
+
+    return true; // TODO ORCHARD: persist fvk
+}
+
+// Add Orchard payment address -> incoming viewing key map entry
+bool CWallet::AddOrchardRawAddress(
+    const libzcash::OrchardIncomingViewingKey &ivk,
+    const libzcash::OrchardRawAddress &addr)
+{
+    AssertLockHeld(cs_wallet); // orchardWallet
+    if (!orchardWallet.AddRawAddress(addr, ivk)) {
+        // We should never add an Orchard raw address for which we don't know
+        // the corresponding FVK.
+        return false;
+    };
+
+    if (!fFileBacked) {
+        return true;
+    }
+
+    return true; // TODO ORCHARD: ensure mapping will be recreated on wallet load
+}
+
+// Loads a payment address -> incoming viewing key map entry
+// to the in-memory wallet's keystore.
+bool CWallet::LoadOrchardRawAddress(
+    const libzcash::OrchardRawAddress &addr,
+    const libzcash::OrchardIncomingViewingKey &ivk)
+{
+    AssertLockHeld(cs_wallet); // orchardWallet
+    return orchardWallet.AddRawAddress(addr, ivk);
+}
+
+// Returns a loader that can be used to read an Orchard note commitment
+// tree from a stream into the Orchard wallet.
+OrchardWalletNoteCommitmentTreeLoader CWallet::GetOrchardNoteCommitmentTreeLoader() {
+    return OrchardWalletNoteCommitmentTreeLoader(orchardWallet);
+}
+
+// Add spending key to keystore and persist to disk
+bool CWallet::AddSproutZKey(const libzcash::SproutSpendingKey &key)
+{
+    AssertLockHeld(cs_wallet); // mapSproutZKeyMetadata
+    auto addr = key.address();
+
+    if (!CCryptoKeyStore::AddSproutSpendingKey(key))
+        return false;
+
+    // check if we need to remove from viewing keys
+    if (HaveSproutViewingKey(addr))
+        RemoveSproutViewingKey(key.viewing_key());
+
+    if (!fFileBacked)
+        return true;
+
+    if (!IsCrypted()) {
+        return CWalletDB(strWalletFile).WriteZKey(addr, key, mapSproutZKeyMetadata[addr]);
+    }
+    return true;
+}
+
+CPubKey CWallet::GenerateNewKey(bool external)
+{
+    AssertLockHeld(cs_wallet); // mapKeyMetadata
+
+    if (!mnemonicHDChain.has_value()) {
+        throw std::runtime_error(
+                "CWallet::GenerateNewKey(): Wallet is missing mnemonic seed metadata.");
+    }
+    CHDChain& hdChain = mnemonicHDChain.value();
+
+    transparent::AccountKey accountKey = this->GetLegacyAccountKey();
+    std::optional<CPubKey> pubkey = std::nullopt;
+    do {
+        auto index = hdChain.GetLegacyTKeyCounter(external);
+        auto key = external ?
+            accountKey.DeriveExternalSpendingKey(index) :
+            accountKey.DeriveInternalSpendingKey(index);
+
+        hdChain.IncrementLegacyTKeyCounter(external);
+        if (key.has_value()) {
+            pubkey = AddTransparentSecretKey(
+                hdChain.GetSeedFingerprint(),
+                key.value(),
+                transparent::AccountKey::KeyPath(BIP44CoinType(), ZCASH_LEGACY_ACCOUNT, external, index)
+            );
+        }
+        // if we did not successfully generate a key, try again.
+    } while (!pubkey.has_value());
+
+    // Update the persisted chain information
+    if (fFileBacked && !CWalletDB(strWalletFile).WriteMnemonicHDChain(hdChain)) {
+        throw std::runtime_error("CWallet::GenerateNewKey(): Writing HD chain model failed");
+    }
+
+    return pubkey.value();
+}
+
+CPubKey CWallet::AddTransparentSecretKey(
+        const uint256& seedFingerprint,
+        const CKey& secret,
+        const HDKeyPath& keyPath)
+{
+    CPubKey pubkey = secret.GetPubKey();
+    assert(secret.VerifyPubKey(pubkey));
+
+    // Create new metadata
+    CKeyMetadata keyMeta(GetTime());
+    keyMeta.hdKeypath = keyPath;
+    keyMeta.seedFp = seedFingerprint;
+    mapKeyMetadata[pubkey.GetID()] = keyMeta;
+    if (nTimeFirstKey == 0 || keyMeta.nCreateTime < nTimeFirstKey)
+        nTimeFirstKey = keyMeta.nCreateTime;
+
+    if (!AddKeyPubKey(secret, pubkey))
+        throw std::runtime_error("CWallet::GenerateNewKey(): AddKeyPubKey failed");
+
+    return pubkey;
+}
+
+bool CWallet::AddKeyPubKey(
+        const CKey& secret,
+        const CPubKey &pubkey)
+{
+    AssertLockHeld(cs_wallet); // mapKeyMetadata
+    if (!CCryptoKeyStore::AddKeyPubKey(secret, pubkey))
+        return false;
+
+    // check if we need to remove from watch-only
+    CScript script;
+    script = GetScriptForDestination(pubkey.GetID());
+    if (HaveWatchOnly(script))
+        RemoveWatchOnly(script);
+    script = GetScriptForRawPubKey(pubkey);
+    if (HaveWatchOnly(script))
+        RemoveWatchOnly(script);
+
+    if (!fFileBacked)
+        return true;
+
+    if (!IsCrypted()) {
+        return CWalletDB(strWalletFile).WriteKey(pubkey,
+                                                 secret.GetPrivKey(),
+                                                 mapKeyMetadata[pubkey.GetID()]);
+    }
+
+    return true;
+}
+
+bool CWallet::AddCryptedKey(const CPubKey &vchPubKey,
+                            const vector<unsigned char> &vchCryptedSecret)
+{
+
+    if (!CCryptoKeyStore::AddCryptedKey(vchPubKey, vchCryptedSecret))
+        return false;
+    if (!fFileBacked)
+        return true;
+    {
+        LOCK(cs_wallet);
+        if (pwalletdbEncryption)
+            return pwalletdbEncryption->WriteCryptedKey(vchPubKey,
+                                                        vchCryptedSecret,
+                                                        mapKeyMetadata[vchPubKey.GetID()]);
+        else
+            return CWalletDB(strWalletFile).WriteCryptedKey(vchPubKey,
+                                                            vchCryptedSecret,
+                                                            mapKeyMetadata[vchPubKey.GetID()]);
+    }
+    return false;
+}
+
+
+bool CWallet::AddCryptedSproutSpendingKey(
+    const libzcash::SproutPaymentAddress &address,
+    const libzcash::ReceivingKey &rk,
+    const std::vector<unsigned char> &vchCryptedSecret)
+{
+    if (!CCryptoKeyStore::AddCryptedSproutSpendingKey(address, rk, vchCryptedSecret))
+        return false;
+    if (!fFileBacked)
+        return true;
+    {
+        LOCK(cs_wallet);
+        if (pwalletdbEncryption) {
+            return pwalletdbEncryption->WriteCryptedZKey(address,
+                                                         rk,
+                                                         vchCryptedSecret,
+                                                         mapSproutZKeyMetadata[address]);
+        } else {
+            return CWalletDB(strWalletFile).WriteCryptedZKey(address,
+                                                             rk,
+                                                             vchCryptedSecret,
+                                                             mapSproutZKeyMetadata[address]);
+        }
+    }
+    return false;
+}
+
+bool CWallet::AddCryptedSaplingSpendingKey(const libzcash::SaplingExtendedFullViewingKey &extfvk,
+                                           const std::vector<unsigned char> &vchCryptedSecret)
+{
+    if (!CCryptoKeyStore::AddCryptedSaplingSpendingKey(extfvk, vchCryptedSecret))
+        return false;
+    if (!fFileBacked)
+        return true;
+    {
+        LOCK(cs_wallet);
+        if (pwalletdbEncryption) {
+            return pwalletdbEncryption->WriteCryptedSaplingZKey(extfvk,
+                                                         vchCryptedSecret,
+                                                         mapSaplingZKeyMetadata[extfvk.ToIncomingViewingKey()]);
+        } else {
+            return CWalletDB(strWalletFile).WriteCryptedSaplingZKey(extfvk,
+                                                         vchCryptedSecret,
+                                                         mapSaplingZKeyMetadata[extfvk.ToIncomingViewingKey()]);
+        }
+    }
+    return false;
+}
+
+libzcash::transparent::AccountKey CWallet::GetLegacyAccountKey() const {
+    auto seedOpt = GetMnemonicSeed();
+    if (!seedOpt.has_value()) {
+        throw std::runtime_error(
+                "CWallet::GenerateNewKey(): Wallet does not have a mnemonic seed.");
+    }
+    auto seed = seedOpt.value();
+
+    // All mnemonic seeds are checked at construction to ensure that we can obtain
+    // a valid spending key for the account ZCASH_LEGACY_ACCOUNT;
+    // therefore, the `value()` call here is safe.
+    return transparent::AccountKey::ForAccount(
+            seed,
+            BIP44CoinType(),
+            ZCASH_LEGACY_ACCOUNT).value();
+}
+
+
+std::pair<UnifiedFullViewingKey, libzcash::AccountId> CWallet::GenerateNewUnifiedSpendingKey() {
+    AssertLockHeld(cs_wallet);
+
+    if (!mnemonicHDChain.has_value()) {
+        throw std::runtime_error(
+                "CWallet::GenerateNewUnifiedSpendingKey(): Wallet is missing mnemonic seed metadata.");
+    }
+
+    CHDChain& hdChain = mnemonicHDChain.value();
+    while (true) {
+        auto accountId = hdChain.GetAccountCounter();
+        auto generated = GenerateUnifiedSpendingKeyForAccount(accountId);
+        auto account = hdChain.IncrementAccountCounter();
+        if (!account.has_value()) {
+            throw std::runtime_error(
+                    "CWallet::GenerateNewUnifiedSpendingKey(): Already generated the maximum number of accounts (2^31 - 2) for this wallet's mnemonic phrase. Congratulations, you need to create a new wallet!");
+        }
+
+        if (generated.has_value()) {
+            // Update the persisted chain information
+            if (fFileBacked && !CWalletDB(strWalletFile).WriteMnemonicHDChain(hdChain)) {
+                throw std::runtime_error(
+                        "CWallet::GenerateNewUnifiedSpendingKey(): Writing HD chain model failed");
+            }
+
+            return std::make_pair(generated.value().ToFullViewingKey(), accountId);
+        }
+    }
+}
+
+std::optional<libzcash::ZcashdUnifiedSpendingKey>
+        CWallet::GenerateUnifiedSpendingKeyForAccount(libzcash::AccountId accountId) {
+    AssertLockHeld(cs_wallet); // mapUnifiedAccountKeys
+
+    auto seed = GetMnemonicSeed();
+    if (!seed.has_value()) {
+        throw std::runtime_error(std::string(__func__) + ": Wallet has no mnemonic HD seed.");
+    }
+
+    auto usk = ZcashdUnifiedSpendingKey::ForAccount(seed.value(), BIP44CoinType(), accountId);
+    if (usk.has_value()) {
+        auto ufvk = usk.value().ToFullViewingKey();
+        auto ufvkid = ufvk.GetKeyID(Params());
+
+        ZcashdUnifiedAccountMetadata skmeta(seed.value().Fingerprint(), BIP44CoinType(), accountId, ufvkid);
+
+        // We don't store the spending key directly; instead, we store each of
+        // the spending key's components, in order to not violate invariants
+        // with respect to the encryption of the wallet. We store each
+        // component in the appropriate wallet subsystem, and store the
+        // metadata that can be used to re-derive the spending key along with
+        // the fingerprint of the associated full viewing key.
+
+        // Set up the bidirectional maps between the account ID and the UFVK ID.
+        auto metaKey = std::make_pair(skmeta.GetSeedFingerprint(), skmeta.GetAccountId());
+        const auto [it, is_new_key] = mapUnifiedAccountKeys.insert({metaKey, skmeta.GetKeyID()});
+        if (!is_new_key) {
+            // key was already present, so just return the USK.
+            return usk.value();
+        }
+
+        // We set up the UFVKAddressMetadata with the correct account ID (so we identify
+        // the UFVK as corresponding to this account) and empty receivers data (as we
+        // haven't generated any addresses yet). We don't need to persist this directly,
+        // because we persist skmeta below, and mapUfvkAddressMetadata is populated in
+        // LoadUnifiedAccountMetadata().
+        mapUfvkAddressMetadata.insert({ufvkid, UFVKAddressMetadata(accountId)});
+
+        // We do not explicitly add any transparent component to the keystore;
+        // the secret keys that we need to store are the child spending keys
+        // that are produced whenever we create a transparent address.
+
+        // Create the function that we'll use to add Sapling keys
+        // to the wallet.
+        auto addSaplingKey = AddSpendingKeyToWallet(
+            this, Params().GetConsensus(), GetTime(),
+            libzcash::Zip32AccountKeyPath(BIP44CoinType(), accountId),
+            skmeta.GetSeedFingerprint().GetHex(), true, false
+        );
+
+        // Add the Sapling spending key to the wallet
+        auto saplingEsk = usk.value().GetSaplingKey();
+        if (addSaplingKey(saplingEsk) == KeyNotAdded) {
+            // If adding the Sapling key to the wallet failed, abort the process.
+            throw std::runtime_error("CWalletDB::GenerateUnifiedSpendingKeyForAccount(): Unable to add Sapling spending key to the wallet.");
+        }
+
+        // Add the Sapling change spending key to the wallet
+        auto saplingChangeEsk = saplingEsk.DeriveInternalKey();
+        if (addSaplingKey(saplingChangeEsk) == KeyNotAdded) {
+            // If adding the Sapling change key to the wallet failed, abort the process.
+            throw std::runtime_error("CWalletDB::GenerateUnifiedSpendingKeyForAccount(): Unable to add Sapling change key to the wallet.");
+        }
+
+        // Associate the Sapling default change address with its IVK. We do this
+        // here because there is only ever a single Sapling change receiver, and
+        // it is never exposed to the user. External Sapling receivers are added
+        // when the user calls z_getaddressforaccount.
+        auto saplingXFVK = saplingEsk.ToXFVK();
+        if (!AddSaplingPaymentAddress(saplingXFVK.GetChangeIVK(), saplingXFVK.GetChangeAddress())) {
+            throw std::runtime_error("CWallet::GenerateUnifiedSpendingKeyForAccount(): Failed to add Sapling change address to the wallet.");
+        };
+
+        // Add Orchard spending key to the wallet
+        auto orchardSk = usk.value().GetOrchardKey();
+        orchardWallet.AddSpendingKey(orchardSk);
+
+        // Associate the Orchard default change address with its IVK. We do this
+        // here because there is only ever a single Orchard change receiver, and
+        // it is never exposed to the user. External Orchard receivers are added
+        // when the user calls z_getaddressforaccount.
+        auto orchardInternalFvk = orchardSk.ToFullViewingKey().ToInternalIncomingViewingKey();
+        if (!AddOrchardRawAddress(orchardInternalFvk, orchardInternalFvk.Address(0))) {
+            throw std::runtime_error("CWallet::GenerateUnifiedSpendingKeyForAccount(): Failed to add Orchard change address to the wallet.");
+        };
+
+        auto zufvk = ZcashdUnifiedFullViewingKey::FromUnifiedFullViewingKey(Params(), ufvk);
+        if (!CCryptoKeyStore::AddUnifiedFullViewingKey(zufvk)) {
+            throw std::runtime_error("CWalletDB::GenerateUnifiedSpendingKeyForAccount(): Failed to add UFVK to the keystore.");
+        }
+
+        if (fFileBacked) {
+            auto walletdb = CWalletDB(strWalletFile);
+            if (!( walletdb.WriteUnifiedFullViewingKey(ufvk) &&
+                   walletdb.WriteUnifiedAccountMetadata(skmeta)
+                 )) {
+                throw std::runtime_error("CWalletDB::GenerateUnifiedSpendingKeyForAccount(): walletdb write failed.");
+            }
+        }
+
+        return usk;
+    } else {
+        return std::nullopt;
+    }
+}
+
+bool CWallet::AddUnifiedFullViewingKey(const libzcash::UnifiedFullViewingKey &ufvk)
+{
+    AssertLockHeld(cs_wallet);
+
+    auto zufvk = ZcashdUnifiedFullViewingKey::FromUnifiedFullViewingKey(Params(), ufvk);
+    auto keyId = ufvk.GetKeyID(Params());
+    if (!CCryptoKeyStore::AddUnifiedFullViewingKey(zufvk)) {
+        return false;
+    }
+
+    if (!fFileBacked) {
+        return true;
+    }
+
+    return CWalletDB(strWalletFile).WriteUnifiedFullViewingKey(ufvk);
+}
+
+std::optional<ZcashdUnifiedFullViewingKey> CWallet::GetUnifiedFullViewingKeyByAccount(libzcash::AccountId accountId) const {
+    if (!mnemonicHDChain.has_value()) {
+        throw std::runtime_error(
+                "CWallet::GetUnifiedFullViewingKeyByAccount(): Wallet is missing mnemonic seed metadata.");
+    }
+
+    auto seedfp = mnemonicHDChain.value().GetSeedFingerprint();
+    auto entry = mapUnifiedAccountKeys.find(std::make_pair(seedfp, accountId));
+    if (entry != mapUnifiedAccountKeys.end()) {
+        return CCryptoKeyStore::GetUnifiedFullViewingKey(entry->second);
+    } else {
+        return std::nullopt;
+    }
+}
+
+WalletUAGenerationResult ToWalletUAGenerationResult(UnifiedAddressGenerationResult result) {
+    return std::visit(match {
+        [](const UnifiedAddressGenerationError& err) {
+            return WalletUAGenerationResult(err);
+        },
+        [](const std::pair<UnifiedAddress, diversifier_index_t>& addrPair) {
+            return WalletUAGenerationResult(addrPair);
+        }
+    }, result);
+}
+
+WalletUAGenerationResult CWallet::GenerateUnifiedAddress(
+    const libzcash::AccountId& accountId,
+    const std::set<libzcash::ReceiverType>& receiverTypes,
+    std::optional<libzcash::diversifier_index_t> j)
+{
+    bool searchDiversifiers = !j.has_value();
+    if (!libzcash::HasShielded(receiverTypes)) {
+        return UnifiedAddressGenerationError::ShieldedReceiverNotFound;
+    }
+
+    // The wallet must be unlocked in order to generate new transparent UA
+    // receivers, because we need to be able to add the secret key for the
+    // external child address at the diversifier index to the wallet's
+    // transparent backend in order to be able to detect transactions as
+    // ours rather than considering them as watch-only.
+    bool hasTransparent = receiverTypes.find(ReceiverType::P2PKH) != receiverTypes.end();
+    if (hasTransparent) {
+        // A preemptive check to ensure that the user has not specified an
+        // invalid transparent child index. If we search from a valid transparent
+        // child index into invalid child index space.
+        if (j.has_value() && !j.value().ToTransparentChildIndex().has_value()) {
+            return UnifiedAddressGenerationError::InvalidTransparentChildIndex;
+        }
+
+        if (IsCrypted() || !GetMnemonicSeed().has_value()) {
+            return WalletUAGenerationError::WalletEncrypted;
+        }
+    }
+
+    auto ufvk = GetUnifiedFullViewingKeyByAccount(accountId);
+    if (ufvk.has_value()) {
+        auto ufvkid = ufvk.value().GetKeyID();
+
+        // Check whether an address has already been generated for any provided
+        // diversifier index. Return that address, or set the diversifier index
+        // at which we'll begin searching for the next available diversified
+        // address.
+        auto metadata = mapUfvkAddressMetadata.find(ufvkid);
+        if (metadata != mapUfvkAddressMetadata.end()) {
+            if (j.has_value()) {
+                auto receivers = metadata->second.GetReceivers(j.value());
+                if (receivers.has_value()) {
+                    // Ensure that the set of receiver types being requested is
+                    // the same as the set of receiver types that was previously
+                    // generated. If they match, simply return that address.
+                    if (receivers.value() == receiverTypes) {
+                        return ToWalletUAGenerationResult(ufvk.value().Address(j.value(), receiverTypes));
+                    } else {
+                        return WalletUAGenerationError::ExistingAddressMismatch;
+                    }
+                }
+            } else {
+                // Set the diversifier index to one greater than the last used
+                // diversifier
+                j = metadata->second.GetNextDiversifierIndex();
+                if (!j.has_value()) {
+                    return UnifiedAddressGenerationError::DiversifierSpaceExhausted;
+                }
+            }
+        } else {
+            // Begin searching from the zero diversifier index if we haven't
+            // yet generated an address from the specified UFVK and no
+            // diversifier index has been specified.
+            if (!j.has_value()) {
+                j = libzcash::diversifier_index_t(0);
+            }
+        }
+
+        // Find a working diversifier and construct the associated address.
+        // At this point, we know that `j` will contain a value.
+        auto addressGenerationResult = searchDiversifiers ?
+            ufvk.value().FindAddress(j.value(), receiverTypes) :
+            ufvk.value().Address(j.value(), receiverTypes);
+
+        if (std::holds_alternative<UnifiedAddressGenerationError>(addressGenerationResult)) {
+            return std::get<UnifiedAddressGenerationError>(addressGenerationResult);
+        }
+
+        auto address = std::get<std::pair<UnifiedAddress, diversifier_index_t>>(addressGenerationResult);
+
+        assert(mapUfvkAddressMetadata[ufvkid].SetReceivers(address.second, receiverTypes));
+        if (hasTransparent) {
+            // We must construct and add the transparent spending key associated
+            // with the external and internal transparent child addresses to the
+            // transparent keystore. This call to `value` will succeed because
+            // this key must have been previously generated.
+            auto usk = GenerateUnifiedSpendingKeyForAccount(accountId).value();
+            auto accountKey = usk.GetTransparentKey();
+            // this .value is known to be safe from the earlier check
+            auto childIndex = address.second.ToTransparentChildIndex().value();
+            auto externalKey = accountKey.DeriveExternalSpendingKey(childIndex);
+
+            if (!externalKey.has_value()) {
+                return UnifiedAddressGenerationError::NoAddressForDiversifier;
+            }
+
+            AddTransparentSecretKey(
+                mnemonicHDChain.value().GetSeedFingerprint(),
+                externalKey.value(),
+                transparent::AccountKey::KeyPath(BIP44CoinType(), accountId, true, childIndex)
+            );
+
+            // We do not add the change address for the transparent key, because
+            // we do not send transparent change when using unified accounts.
+
+            // Writing this data is handled by `CWalletDB::WriteUnifiedAddressMetadata` below.
+            assert(
+                CCryptoKeyStore::AddTransparentReceiverForUnifiedAddress(
+                    ufvkid, address.second, address.first
+                )
+            );
+        }
+
+        // If the address has a Sapling component, add an association between
+        // that address and the Sapling IVK corresponding to the ufvk
+        auto hasSapling = receiverTypes.find(ReceiverType::Sapling) != receiverTypes.end();
+        if (hasSapling) {
+            auto dfvk = ufvk.value().GetSaplingKey();
+            auto saplingAddress = address.first.GetSaplingReceiver();
+            assert (dfvk.has_value() && saplingAddress.has_value());
+
+            AddSaplingPaymentAddress(dfvk.value().ToIncomingViewingKey(), saplingAddress.value());
+        }
+
+        // If the address has an Orchard component, add an association between
+        // that address and the Orchard IVK corresponding to the ufvk
+        auto hasOrchard = receiverTypes.find(ReceiverType::Orchard) != receiverTypes.end();
+        if (hasOrchard) {
+            auto fvk = ufvk.value().GetOrchardKey();
+            auto orchardReceiver = address.first.GetOrchardReceiver();
+            assert (fvk.has_value() && orchardReceiver.has_value());
+
+            AddOrchardRawAddress(fvk.value().ToIncomingViewingKey(), orchardReceiver.value());
+        }
+
+        // Save the metadata for the generated address so that we can re-derive
+        // it in the future.
+        ZcashdUnifiedAddressMetadata addrmeta(ufvkid, address.second, receiverTypes);
+        if (fFileBacked && !CWalletDB(strWalletFile).WriteUnifiedAddressMetadata(addrmeta)) {
+            throw std::runtime_error(
+                    "CWallet::AddUnifiedAddress(): Writing unified address metadata failed");
+        }
+
+        return address;
+    } else {
+        return WalletUAGenerationError::NoSuchAccount;
+    }
+}
+
+bool CWallet::LoadUnifiedFullViewingKey(const libzcash::UnifiedFullViewingKey &key)
+{
+    return CCryptoKeyStore::AddUnifiedFullViewingKey(
+        ZcashdUnifiedFullViewingKey::FromUnifiedFullViewingKey(Params(), key)
+    );
+}
+
+bool CWallet::LoadUnifiedAccountMetadata(const ZcashdUnifiedAccountMetadata &skmeta)
+{
+    AssertLockHeld(cs_wallet); // mapUnifiedAccountKeys
+    auto metaKey = std::make_pair(skmeta.GetSeedFingerprint(), skmeta.GetAccountId());
+    mapUnifiedAccountKeys.insert({metaKey, skmeta.GetKeyID()});
+    return mapUfvkAddressMetadata[skmeta.GetKeyID()].SetAccountId(skmeta.GetAccountId());
+}
+
+bool CWallet::LoadUnifiedAddressMetadata(const ZcashdUnifiedAddressMetadata &addrmeta)
+{
+    AssertLockHeld(cs_wallet);
+
+    return mapUfvkAddressMetadata[addrmeta.GetKeyID()].SetReceivers(
+                addrmeta.GetDiversifierIndex(),
+                addrmeta.GetReceiverTypes());
+}
+
+std::pair<PaymentAddress, RecipientType> CWallet::GetPaymentAddressForRecipient(
+        const uint256& txid,
+        const libzcash::RecipientAddress& recipient) const
+{
+    AssertLockHeld(cs_main);
+    AssertLockHeld(cs_wallet);
+
+    auto self = this;
+
+    int nHeight = chainActive.Height();
+    auto wtxPtr = mapWallet.find(txid);
+    if (wtxPtr != mapWallet.end()) {
+        const CBlockIndex* pTxIndex{nullptr};
+        if (wtxPtr->second.GetDepthInMainChain(pTxIndex) > 0) {
+            nHeight = pTxIndex->nHeight;
+        }
+    }
+
+    auto ufvk = self->GetUFVKForReceiver(RecipientAddressToReceiver(recipient));
+    std::pair<PaymentAddress, RecipientType> defaultAddress = std::visit(match {
+        [&](const CKeyID& addr) {
+            auto ua = self->FindUnifiedAddressByReceiver(addr);
+            if (ua.has_value()) {
+                // we do not generate unified addresses for change keys
+                return std::make_pair(PaymentAddress{ua.value()}, RecipientType::WalletExternalAddress);
+            }
+
+            // If it's in the address book, it's a legacy external address
+            if (mapAddressBook.count(addr)) {
+                return std::make_pair(PaymentAddress{addr}, RecipientType::WalletExternalAddress);
+            }
+
+            if (::IsMine(*this, addr)) {
+                // For keys that are ours, check if they are legacy change keys. Anything that has an
+                // internal BIP-44 keypath is a post-mnemonic internal address.
+                auto keyMeta = mapKeyMetadata.find(addr);
+                if (keyMeta == mapKeyMetadata.end() || keyMeta->second.hdKeypath == "") {
+                    return std::make_pair(PaymentAddress{addr}, RecipientType::LegacyChangeAddress);
+                } else if (IsInternalKeyPath(44, BIP44CoinType(), keyMeta->second.hdKeypath)) {
+                    return std::make_pair(PaymentAddress{addr}, RecipientType::WalletInternalAddress);
+                } else {
+                    return std::make_pair(PaymentAddress{addr}, RecipientType::WalletExternalAddress);
+                }
+            }
+
+            // It really doesn't appear to be ours, so treat it as a counterparty address.
+            return std::make_pair(PaymentAddress{addr}, RecipientType::CounterpartyAddress);
+        },
+        [&](const CScriptID& addr) {
+            auto ua = self->FindUnifiedAddressByReceiver(addr);
+            if (ua.has_value()) {
+                return std::make_pair(PaymentAddress{ua.value()}, RecipientType::WalletExternalAddress);
+            } else if (HaveCScript(addr)) {
+                // we never generate internal p2sh addresses, so all are wallet external
+                return std::make_pair(PaymentAddress{addr}, RecipientType::WalletExternalAddress);
+            }
+
+            return std::make_pair(PaymentAddress{addr}, RecipientType::CounterpartyAddress);
+        },
+        [&](const SaplingPaymentAddress& addr) {
+            auto ua = self->FindUnifiedAddressByReceiver(addr);
+            if (ua.has_value()) {
+                // UAs are always external addresses
+                return std::make_pair(PaymentAddress{ua.value()}, RecipientType::WalletExternalAddress);
+            }
+
+            if (ufvk.has_value() && ufvk->GetSaplingKey().has_value()) {
+                auto saplingKey = ufvk->GetSaplingKey().value();
+                auto j = saplingKey.DecryptDiversifier(addr);
+                if (j.has_value()) {
+                    // external addresses correspond to UAs.
+                    if (j.value().second) {
+                        // std::get is safe here because we know we have a valid Sapling diversifier index
+                        auto defaultUA = std::get<std::pair<UnifiedAddress, diversifier_index_t>>(
+                                ufvk->Address(j.value().first, CWallet::DefaultReceiverTypes(nHeight)));
+                        return std::make_pair(PaymentAddress{defaultUA.first}, RecipientType::WalletExternalAddress);
+                    } else {
+                        return std::make_pair(PaymentAddress{addr}, RecipientType::WalletInternalAddress);
+                    }
+                }
+            }
+
+            // legacy Sapling keys that we recognize are all external addresses
+            libzcash::SaplingIncomingViewingKey ivk;
+            if (GetSaplingIncomingViewingKey(addr, ivk)) {
+                return std::make_pair(PaymentAddress{addr}, RecipientType::WalletExternalAddress);
+            }
+
+            // We don't produce internal change addresses for legacy Sapling
+            // addresses, so this must be a counterparty address
+            return std::make_pair(PaymentAddress{addr}, RecipientType::CounterpartyAddress);
+        },
+        [&](const OrchardRawAddress& addr) {
+            auto ua = self->FindUnifiedAddressByReceiver(addr);
+            if (ua.has_value()) {
+                // UAs are always external addresses
+                return std::make_pair(PaymentAddress{ua.value()}, RecipientType::WalletExternalAddress);
+            } else if (ufvk.has_value() && ufvk->GetOrchardKey().has_value()) {
+                auto orchardKey = ufvk->GetOrchardKey().value();
+                auto j = orchardKey.DecryptDiversifier(addr);
+                if (j.has_value()) {
+                    if (j.value().second) {
+                        // Attempt to reproduce the original unified address
+                        auto genResult = ufvk->Address(j.value().first, CWallet::DefaultReceiverTypes(nHeight));
+                        auto defaultUA = std::get_if<std::pair<UnifiedAddress, diversifier_index_t>>(&genResult);
+                        if (defaultUA != nullptr) {
+                            return std::make_pair(PaymentAddress{defaultUA->first}, RecipientType::WalletExternalAddress);
+                        }
+                    } else {
+                        return std::make_pair(PaymentAddress{UnifiedAddress::ForSingleReceiver(addr)}, RecipientType::WalletInternalAddress);
+                    }
+                }
+            }
+
+            return std::make_pair(PaymentAddress{UnifiedAddress::ForSingleReceiver(addr)}, RecipientType::CounterpartyAddress);
+        }
+    }, recipient);
+
+    auto recipientsPtr = sendRecipients.find(txid);
+    if (recipientsPtr == sendRecipients.end()) {
+        // we haven't sent to this address, so look up internally what kind
+        // it is & attempt to reproduce the address as the user originally
+        // saw it.
+        return defaultAddress;
+    } else {
+        // search the list of recipient mappings for one corresponding to
+        // our recipient, and return the known UA if it exists; otherwise
+        // just use the default.
+        for (const auto& mapping : recipientsPtr->second) {
+            if (mapping.address == recipient && mapping.ua.has_value()) {
+                // use the recipient type from the default address, but ensure that we use
+                // the cached address value to which we actually sent the funds
+                return std::make_pair(PaymentAddress{mapping.ua.value()}, defaultAddress.second);
+            }
+        }
+        return defaultAddress;
+    }
+}
+
+bool CWallet::IsInternalRecipient(const libzcash::RecipientAddress& recipient) const
+{
+    auto self = this;
+    return std::visit(match {
+        [&](const CKeyID& addr) {
+            // we never send transparent change when sending to or from a
+            // unified address
+            return false;
+        },
+        [&](const CScriptID& addr) {
+            // we never use P2SH for change or shielding
+            return false;
+        },
+        [&](const SaplingPaymentAddress& addr) {
+            auto ufvk = self->GetUFVKForReceiver(addr);
+            if (ufvk.has_value()) {
+                auto changeAddr = ufvk->GetChangeAddress(SaplingChangeRequest());
+                if (changeAddr.has_value()) {
+                    return changeAddr.value() == recipient;
+                }
+            }
+            return false;
+        },
+        [&](const OrchardRawAddress& addr) {
+            auto ufvk = self->GetUFVKForReceiver(addr);
+            if (ufvk.has_value()) {
+                auto changeAddr = ufvk->GetChangeAddress(OrchardChangeRequest());
+                if (changeAddr.has_value()) {
+                    return changeAddr.value() == recipient;
+                }
+            }
+            return false;
+        }
+    }, recipient);
+}
+
+void CWallet::LoadRecipientMapping(const uint256& txid, const RecipientMapping& mapping) {
+    sendRecipients[txid].push_back(mapping);
+}
+
+bool CWallet::LoadCaches()
+{
+    AssertLockHeld(cs_wallet);
+
+    auto seed = GetMnemonicSeed();
+
+    // Restore unified key metadata
+    for (auto account = mapUnifiedAccountKeys.begin(); account != mapUnifiedAccountKeys.end(); ++account) {
+        auto ufvkId = account->second;
+        auto ufvk = GetUnifiedFullViewingKey(ufvkId);
+
+        if (!seed.has_value()) {
+            LogPrintf("%s: Error: Mnemonic seed was not loaded despite an account existing in the wallet.\n",
+                __func__);
+            return false;
+        }
+
+        if (ufvk.has_value()) {
+            auto metadata = mapUfvkAddressMetadata.find(ufvkId);
+            if (metadata != mapUfvkAddressMetadata.end()) {
+                auto accountId = metadata->second.GetAccountId();
+                if (!accountId.has_value()) {
+                    LogPrintf("%s: Error: Address records exist for an account that was not loaded in the wallet.\n",
+                        __func__);
+                    return false;
+                }
+                auto usk = ZcashdUnifiedSpendingKey::ForAccount(seed.value(), BIP44CoinType(), accountId.value());
+                if (!usk.has_value()) {
+                    LogPrintf("%s: Error: Unable to generate a unified spending key for an account.\n",
+                        __func__);
+                    return false;
+                }
+
+                // add Orchard spending key to the orchard wallet
+                {
+                    auto orchardSk = usk.value().GetOrchardKey();
+                    orchardWallet.AddSpendingKey(orchardSk);
+
+                    // Associate the Orchard default change address with its IVK
+                    auto orchardInternalIvk = orchardSk.ToFullViewingKey().ToInternalIncomingViewingKey();
+                    if (!AddOrchardRawAddress(orchardInternalIvk, orchardInternalIvk.Address(0))) {
+                        LogPrintf("%s: Error: Unable to generate a default internal address.\n",
+                            __func__);
+                        return false;
+                    }
+                }
+
+                // restore unified addresses that have been previously generated to the
+                // keystore
+                for (const auto &[j, receiverTypes] : metadata->second.GetKnownReceiverSetsByDiversifierIndex()) {
+                    bool restored = std::visit(match {
+                        [&](const UnifiedAddressGenerationError& err) {
+                            LogPrintf("%s: Error: Unable to generate a unified address.\n",
+                                __func__);
+                            return false;
+                        },
+                        [&](const std::pair<UnifiedAddress, diversifier_index_t>& addr) {
+                            // Associate the orchard address with our IVK, if there's
+                            // an orchard receiver present in this address.
+                            auto orchardFvk = ufvk.value().GetOrchardKey();
+                            auto orchardReceiver = addr.first.GetOrchardReceiver();
+
+                            if (orchardFvk.has_value() && orchardReceiver.has_value()) {
+                                if (!AddOrchardRawAddress(orchardFvk.value().ToIncomingViewingKey(), orchardReceiver.value())) {
+                                    LogPrintf("%s: Error: Unable to add Orchard address -> IVK mapping.\n",
+                                        __func__);
+                                    return false;
+                                }
+                            }
+
+                            return CCryptoKeyStore::AddTransparentReceiverForUnifiedAddress(
+                                    ufvkId, addr.second, addr.first);
+                        }
+                    }, ufvk.value().Address(j, receiverTypes));
+
+                    // failure to restore the generated address is an error
+                    if (!restored) return false;
+                }
+            } else {
+                // Loaded an account, but didn't initialize
+                // `mapUfvkAddressMetadata` for the corresponding viewing key.
+                LogPrintf("%s: Error: UFVK address map not initialized despite an account existing.\n",
+                    __func__);
+                return false;
+            }
+        } else {
+            LogPrintf("%s: Error: Unified viewing key missing for an account.\n",
+                __func__);
+            return false;
+        }
+    }
+
+    // Sapling legacy addresses were not directly added to the keystore; instead,
+    // the default address for each key was automatically added to the in-memory
+    // keystore, but not persisted. Following the addition of unified addresses,
+    // all addresses must be written to the wallet database explicitly.
+    auto mnemonicSeed = GetMnemonicSeed();
+    for (const auto& [saplingIvk, keyMeta] : mapSaplingZKeyMetadata) {
+        // This condition only applies for keys derived from the legacy seed
+        // or from imported keys.
+        if (!mnemonicSeed.has_value() || keyMeta.seedFp != mnemonicSeed.value().Fingerprint()) {
+            SaplingExtendedFullViewingKey extfvk;
+            if (GetSaplingFullViewingKey(saplingIvk, extfvk)) {
+                // only add the association with the default address if it
+                // does not already exist
+                auto defaultAddress = extfvk.DefaultAddress();
+                if (!HaveSaplingIncomingViewingKey(defaultAddress)) {
+                    // restore the address to the keystore and persist it so that
+                    // the database state is consistent.
+                    if (!AddSaplingPaymentAddress(saplingIvk, defaultAddress)) {
+                        LogPrintf("%s: Error: Failed to write legacy Sapling payment address to the wallet database.\n",
+                            __func__);
+                        return false;
+                    }
+                }
+            }
+        }
+    }
+
+    // Restore decrypted Orchard notes.
+    for (const auto& [_, walletTx] : mapWallet) {
+        if (!walletTx.orchardTxMeta.empty()) {
+            if (!orchardWallet.LoadWalletTx(walletTx, walletTx.orchardTxMeta)) {
+                LogPrintf("%s: Error: Failed to decrypt previously decrypted notes for txid %s.\n",
+                    __func__, walletTx.GetHash().GetHex());
+                return false;
+            }
+        }
+    }
+
+    return true;
+}
+
+void CWallet::LoadKeyMetadata(const CPubKey &pubkey, const CKeyMetadata &meta)
+{
+    AssertLockHeld(cs_wallet); // mapKeyMetadata
+    if (meta.nCreateTime && (!nTimeFirstKey || meta.nCreateTime < nTimeFirstKey))
+        nTimeFirstKey = meta.nCreateTime;
+
+    mapKeyMetadata[pubkey.GetID()] = meta;
+}
+
+void CWallet::LoadZKeyMetadata(const SproutPaymentAddress &addr, const CKeyMetadata &meta)
+{
+    AssertLockHeld(cs_wallet); // mapSproutZKeyMetadata
+    mapSproutZKeyMetadata[addr] = meta;
+}
+
+bool CWallet::LoadCryptedKey(const CPubKey &vchPubKey, const std::vector<unsigned char> &vchCryptedSecret)
+{
+    return CCryptoKeyStore::AddCryptedKey(vchPubKey, vchCryptedSecret);
+}
+
+bool CWallet::LoadCryptedZKey(const libzcash::SproutPaymentAddress &addr, const libzcash::ReceivingKey &rk, const std::vector<unsigned char> &vchCryptedSecret)
+{
+    return CCryptoKeyStore::AddCryptedSproutSpendingKey(addr, rk, vchCryptedSecret);
+}
+
+bool CWallet::LoadCryptedSaplingZKey(
+    const libzcash::SaplingExtendedFullViewingKey &extfvk,
+    const std::vector<unsigned char> &vchCryptedSecret)
+{
+     return CCryptoKeyStore::AddCryptedSaplingSpendingKey(extfvk, vchCryptedSecret);
+}
+
+void CWallet::LoadSaplingZKeyMetadata(const libzcash::SaplingIncomingViewingKey &ivk, const CKeyMetadata &meta)
+{
+    AssertLockHeld(cs_wallet); // mapSaplingZKeyMetadata
+    mapSaplingZKeyMetadata[ivk] = meta;
+}
+
+bool CWallet::LoadSaplingZKey(const libzcash::SaplingExtendedSpendingKey &key)
+{
+    return CCryptoKeyStore::AddSaplingSpendingKey(key);
+}
+
+bool CWallet::LoadSaplingFullViewingKey(const libzcash::SaplingExtendedFullViewingKey &extfvk)
+{
+    return CCryptoKeyStore::AddSaplingFullViewingKey(extfvk);
+}
+
+bool CWallet::LoadSaplingPaymentAddress(
+    const libzcash::SaplingPaymentAddress &addr,
+    const libzcash::SaplingIncomingViewingKey &ivk)
+{
+    return CCryptoKeyStore::AddSaplingPaymentAddress(ivk, addr);
+}
+
+bool CWallet::LoadZKey(const libzcash::SproutSpendingKey &key)
+{
+    return CCryptoKeyStore::AddSproutSpendingKey(key);
+}
+
+bool CWallet::AddSproutViewingKey(const libzcash::SproutViewingKey &vk)
+{
+    if (!CCryptoKeyStore::AddSproutViewingKey(vk)) {
+        return false;
+    }
+    nTimeFirstKey = 1; // No birthday information for viewing keys.
+    if (!fFileBacked) {
+        return true;
+    }
+    return CWalletDB(strWalletFile).WriteSproutViewingKey(vk);
+}
+
+bool CWallet::RemoveSproutViewingKey(const libzcash::SproutViewingKey &vk)
+{
+    AssertLockHeld(cs_wallet);
+    if (!CCryptoKeyStore::RemoveSproutViewingKey(vk)) {
+        return false;
+    }
+    if (fFileBacked) {
+        if (!CWalletDB(strWalletFile).EraseSproutViewingKey(vk)) {
+            return false;
+        }
+    }
+
+    return true;
+}
+
+bool CWallet::LoadSproutViewingKey(const libzcash::SproutViewingKey &vk)
+{
+    return CCryptoKeyStore::AddSproutViewingKey(vk);
+}
+
+bool CWallet::AddCScript(const CScript& redeemScript)
+{
+    if (!CCryptoKeyStore::AddCScript(redeemScript))
+        return false;
+    if (!fFileBacked)
+        return true;
+    return CWalletDB(strWalletFile).WriteCScript(Hash160(redeemScript), redeemScript);
+}
+
+bool CWallet::LoadCScript(const CScript& redeemScript)
+{
+    /* A sanity check was added in pull #3843 to avoid adding redeemScripts
+     * that never can be redeemed. However, old wallets may still contain
+     * these. Do not add them to the wallet and warn. */
+    KeyIO keyIO(Params());
+    if (redeemScript.size() > MAX_SCRIPT_ELEMENT_SIZE)
+    {
+        std::string strAddr = keyIO.EncodeDestination(CScriptID(redeemScript));
+        LogPrintf("%s: Warning: This wallet contains a redeemScript of size %i which exceeds maximum size %i thus can never be redeemed. Do not use address %s.\n",
+            __func__, redeemScript.size(), MAX_SCRIPT_ELEMENT_SIZE, strAddr);
+        return true;
+    }
+
+    return CCryptoKeyStore::AddCScript(redeemScript);
+}
+
+bool CWallet::AddWatchOnly(const CScript &dest)
+{
+    if (!CCryptoKeyStore::AddWatchOnly(dest))
+        return false;
+    nTimeFirstKey = 1; // No birthday information for watch-only keys.
+    NotifyWatchonlyChanged(true);
+    if (!fFileBacked)
+        return true;
+    return CWalletDB(strWalletFile).WriteWatchOnly(dest);
+}
+
+bool CWallet::RemoveWatchOnly(const CScript &dest)
+{
+    AssertLockHeld(cs_wallet);
+    if (!CCryptoKeyStore::RemoveWatchOnly(dest))
+        return false;
+    if (!HaveWatchOnly())
+        NotifyWatchonlyChanged(false);
+    if (fFileBacked)
+        if (!CWalletDB(strWalletFile).EraseWatchOnly(dest))
+            return false;
+
+    return true;
+}
+
+bool CWallet::LoadWatchOnly(const CScript &dest)
+{
+    return CCryptoKeyStore::AddWatchOnly(dest);
+}
+
+bool CWallet::Unlock(const SecureString& strWalletPassphrase)
+{
+    CCrypter crypter;
+    CKeyingMaterial vMasterKey;
+
+    {
+        LOCK(cs_wallet);
+        for (const MasterKeyMap::value_type& pMasterKey : mapMasterKeys)
+        {
+            if(!crypter.SetKeyFromPassphrase(strWalletPassphrase, pMasterKey.second.vchSalt, pMasterKey.second.nDeriveIterations, pMasterKey.second.nDerivationMethod))
+                return false;
+            if (!crypter.Decrypt(pMasterKey.second.vchCryptedKey, vMasterKey))
+                continue; // try another master key
+            if (CCryptoKeyStore::Unlock(vMasterKey)) {
+                // Now that the wallet is decrypted, ensure we have an HD seed.
+                // https://github.com/zcash/zcash/issues/3607
+                if (!this->HaveMnemonicSeed()) {
+                    this->GenerateNewSeed();
+                }
+                return true;
+            }
+        }
+    }
+    return false;
+}
+
+bool CWallet::ChangeWalletPassphrase(const SecureString& strOldWalletPassphrase, const SecureString& strNewWalletPassphrase)
+{
+    bool fWasLocked = IsLocked();
+
+    {
+        LOCK(cs_wallet);
+        Lock();
+
+        CCrypter crypter;
+        CKeyingMaterial vMasterKey;
+        for (MasterKeyMap::value_type& pMasterKey : mapMasterKeys)
+        {
+            if(!crypter.SetKeyFromPassphrase(strOldWalletPassphrase, pMasterKey.second.vchSalt, pMasterKey.second.nDeriveIterations, pMasterKey.second.nDerivationMethod))
+                return false;
+            if (!crypter.Decrypt(pMasterKey.second.vchCryptedKey, vMasterKey))
+                return false;
+            if (CCryptoKeyStore::Unlock(vMasterKey))
+            {
+                int64_t nStartTime = GetTimeMillis();
+                crypter.SetKeyFromPassphrase(strNewWalletPassphrase, pMasterKey.second.vchSalt, pMasterKey.second.nDeriveIterations, pMasterKey.second.nDerivationMethod);
+                pMasterKey.second.nDeriveIterations = pMasterKey.second.nDeriveIterations * (100 / ((double)(GetTimeMillis() - nStartTime)));
+
+                nStartTime = GetTimeMillis();
+                crypter.SetKeyFromPassphrase(strNewWalletPassphrase, pMasterKey.second.vchSalt, pMasterKey.second.nDeriveIterations, pMasterKey.second.nDerivationMethod);
+                pMasterKey.second.nDeriveIterations = (pMasterKey.second.nDeriveIterations + pMasterKey.second.nDeriveIterations * 100 / ((double)(GetTimeMillis() - nStartTime))) / 2;
+
+                if (pMasterKey.second.nDeriveIterations < 25000)
+                    pMasterKey.second.nDeriveIterations = 25000;
+
+                LogPrintf("Wallet passphrase changed to an nDeriveIterations of %i\n", pMasterKey.second.nDeriveIterations);
+
+                if (!crypter.SetKeyFromPassphrase(strNewWalletPassphrase, pMasterKey.second.vchSalt, pMasterKey.second.nDeriveIterations, pMasterKey.second.nDerivationMethod))
+                    return false;
+                if (!crypter.Encrypt(vMasterKey, pMasterKey.second.vchCryptedKey))
+                    return false;
+                CWalletDB(strWalletFile).WriteMasterKey(pMasterKey.first, pMasterKey.second);
+                if (fWasLocked)
+                    Lock();
+                return true;
+            }
+        }
+    }
+
+    return false;
+}
+
+void CWallet::ChainTipAdded(const CBlockIndex *pindex,
+                            const CBlock *pblock,
+                            MerkleFrontiers frontiers,
+                            bool performOrchardWalletUpdates)
+{
+    const auto chainParams = Params();
+    IncrementNoteWitnesses(
+            chainParams.GetConsensus(),
+            pindex, pblock,
+            frontiers, performOrchardWalletUpdates);
+    UpdateSaplingNullifierNoteMapForBlock(pblock);
+
+    // SetBestChain() can be expensive for large wallets, so do only
+    // this sometimes; the wallet state will be brought up to date
+    // during rescanning on startup.
+    int64_t nNow = GetTimeMicros();
+    if (nLastSetChain == 0) {
+        // Don't flush during startup.
+        nLastSetChain = nNow;
+    }
+    if (++nSetChainUpdates >= WITNESS_WRITE_UPDATES ||
+        nLastSetChain + (int64_t)WITNESS_WRITE_INTERVAL * 1000000 < nNow ||
+        (chainParams.NetworkIDString() == CBaseChainParams::REGTEST && mapArgs.count("-regtestwalletsetbestchaineveryblock")))
+    {
+        nLastSetChain = nNow;
+        nSetChainUpdates = 0;
+        CBlockLocator loc;
+        {
+            // The locator must be derived from the pindex used to increment
+            // the witnesses above; pindex can be behind chainActive.Tip().
+            LOCK(cs_main);
+            loc = chainActive.GetLocator(pindex);
+        }
+        SetBestChain(loc);
+    }
+}
+
+void CWallet::ChainTip(const CBlockIndex *pindex,
+                       const CBlock *pblock,
+                       // If this is None, it indicates a rollback and we will decrement the
+                       // witnesses / rewind the tree
+                       std::optional<MerkleFrontiers> added)
+{
+    const auto& consensus = Params().GetConsensus();
+    if (added.has_value()) {
+        ChainTipAdded(pindex, pblock, added.value(), true);
+        // Prevent migration transactions from being created when node is syncing after launch,
+        // and also when node wakes up from suspension/hibernation and incoming blocks are old.
+        if (!IsInitialBlockDownload(consensus) &&
+            pblock->GetBlockTime() > GetTime() - 3 * 60 * 60)
+        {
+            RunSaplingMigration(pindex->nHeight);
+        }
+    } else {
+        DecrementNoteWitnesses(consensus, pindex);
+        UpdateSaplingNullifierNoteMapForBlock(pblock);
+    }
+}
+
+void CWallet::RunSaplingMigration(int blockHeight) {
+    if (!Params().GetConsensus().NetworkUpgradeActive(blockHeight, Consensus::UPGRADE_SAPLING)) {
+        return;
+    }
+    // need cs_wallet to call CommitTransaction()
+    LOCK2(cs_main, cs_wallet);
+    if (!fSaplingMigrationEnabled) {
+        return;
+    }
+    // The migration transactions to be sent in a particular batch can take
+    // significant time to generate, and this time depends on the speed of the user's
+    // computer. If they were generated only after a block is seen at the target
+    // height minus 1, then this could leak information. Therefore, for target
+    // height N, implementations SHOULD start generating the transactions at around
+    // height N-5
+    if (blockHeight % 500 == 495) {
+        std::shared_ptr<AsyncRPCQueue> q = getAsyncRPCQueue();
+        std::shared_ptr<AsyncRPCOperation> lastOperation = q->getOperationForId(saplingMigrationOperationId);
+        if (lastOperation != nullptr) {
+            lastOperation->cancel();
+        }
+        pendingSaplingMigrationTxs.clear();
+        std::shared_ptr<AsyncRPCOperation> operation(new AsyncRPCOperation_saplingmigration(blockHeight + 5));
+        saplingMigrationOperationId = operation->getId();
+        q->addOperation(operation);
+    } else if (blockHeight % 500 == 499) {
+        std::shared_ptr<AsyncRPCQueue> q = getAsyncRPCQueue();
+        std::shared_ptr<AsyncRPCOperation> lastOperation = q->getOperationForId(saplingMigrationOperationId);
+        if (lastOperation != nullptr) {
+            lastOperation->cancel();
+        }
+        for (const CTransaction& transaction : pendingSaplingMigrationTxs) {
+            // Send the transaction
+            CWalletTx wtx(this, transaction);
+            CommitTransaction(wtx, std::nullopt);
+        }
+        pendingSaplingMigrationTxs.clear();
+    }
+}
+
+void CWallet::AddPendingSaplingMigrationTx(const CTransaction& tx) {
+    LOCK(cs_wallet);
+    pendingSaplingMigrationTxs.push_back(tx);
+}
+
+void CWallet::SetBestChain(const CBlockLocator& loc)
+{
+    CWalletDB walletdb(strWalletFile);
+    SetBestChainINTERNAL(walletdb, loc);
+}
+
+std::optional<uint256> CWallet::GetPersistedBestBlock()
+{
+    AssertLockHeld(cs_wallet);
+
+    CWalletDB walletdb(strWalletFile);
+    CBlockLocator locator;
+    if (walletdb.ReadBestBlock(locator)) {
+        if (!locator.vHave.empty()) {
+            return locator.vHave[0];
+        }
+    }
+
+    // The wallet has never persisted a best block to disk.
+    return std::nullopt;
+}
+
+std::set<std::pair<libzcash::SproutPaymentAddress, uint256>> CWallet::GetSproutNullifiers(
+        const std::set<libzcash::SproutPaymentAddress>& addresses) {
+    std::set<std::pair<libzcash::SproutPaymentAddress, uint256>> nullifierSet;
+    if (!addresses.empty()) {
+        for (const auto& txPair : mapWallet) {
+            for (const auto & noteDataPair : txPair.second.mapSproutNoteData) {
+                auto & noteData = noteDataPair.second;
+                auto & nullifier = noteData.nullifier;
+                auto & address = noteData.address;
+                if (nullifier && addresses.count(address) > 0) {
+                    nullifierSet.insert(std::make_pair(address, nullifier.value()));
+                }
+            }
+        }
+    }
+
+    return nullifierSet;
+}
+
+std::set<std::pair<libzcash::SaplingPaymentAddress, uint256>> CWallet::GetSaplingNullifiers(
+        const std::set<libzcash::SaplingPaymentAddress>& addresses) {
+    std::set<std::pair<libzcash::SaplingPaymentAddress, uint256>> nullifierSet;
+    if (!addresses.empty()) {
+        // Sapling ivk -> list of addrs map
+        // (There may be more than one diversified address for a given ivk.)
+        std::map<libzcash::SaplingIncomingViewingKey, std::vector<libzcash::SaplingPaymentAddress>> ivkMap;
+        for (const auto & addr : addresses) {
+            libzcash::SaplingIncomingViewingKey ivk;
+            this->GetSaplingIncomingViewingKey(addr, ivk);
+            ivkMap[ivk].push_back(addr);
+        }
+
+        for (const auto& txPair : mapWallet) {
+            for (const auto& noteDataPair : txPair.second.mapSaplingNoteData) {
+                auto & noteData = noteDataPair.second;
+                auto & nullifier = noteData.nullifier;
+                auto & ivk = noteData.ivk;
+                if (nullifier && ivkMap.count(ivk) > 0) {
+                    for (const auto & addr : ivkMap[ivk]) {
+                        nullifierSet.insert(std::make_pair(addr, nullifier.value()));
+                    }
+                }
+            }
+        }
+    }
+
+    return nullifierSet;
+}
+
+bool CWallet::IsNoteSproutChange(
+        const std::set<std::pair<libzcash::SproutPaymentAddress, uint256>> & nullifierSet,
+        const libzcash::SproutPaymentAddress& address,
+        const JSOutPoint & jsop)
+{
+    // A Note is marked as "change" if the address that received it
+    // also spent Notes in the same transaction. This will catch,
+    // for instance:
+    // - Change created by spending fractions of Notes (because
+    //   z_sendmany sends change to the originating z-address).
+    // - "Chaining Notes" used to connect JoinSplits together.
+    // - Notes created by consolidation transactions (e.g. using
+    //   z_mergetoaddress).
+    // - Notes sent from one address to itself.
+    for (const JSDescription & jsd : mapWallet[jsop.hash].vJoinSplit) {
+        for (const uint256 & nullifier : jsd.nullifiers) {
+            if (nullifierSet.count(std::make_pair(address, nullifier))) {
+                return true;
+            }
+        }
+    }
+    return false;
+}
+
+bool CWallet::IsNoteSaplingChange(
+        const std::set<std::pair<libzcash::SaplingPaymentAddress, uint256>> & nullifierSet,
+        const libzcash::SaplingPaymentAddress& address,
+        const SaplingOutPoint & op)
+{
+    // Check against the wallet's change address for the associated unified account.
+    if (this->IsInternalRecipient(address)) {
+        return true;
+    }
+
+    // A Note is marked as "change" if the address that received it
+    // also spent Notes in the same transaction. This will catch,
+    // for instance:
+    // - Change created by spending fractions of Notes (because
+    //   z_sendmany sends change to the originating z-address).
+    // - Notes created by consolidation transactions (e.g. using
+    //   z_mergetoaddress).
+    // - Notes sent from one address to itself.
+    for (const SpendDescription &spend : mapWallet[op.hash].vShieldedSpend) {
+        if (nullifierSet.count(std::make_pair(address, spend.nullifier))) {
+            return true;
+        }
+    }
+    return false;
+}
+
+bool CWallet::SetMinVersion(enum WalletFeature nVersion, CWalletDB* pwalletdbIn, bool fExplicit)
+{
+    LOCK(cs_wallet); // nWalletVersion
+    if (nWalletVersion >= nVersion)
+        return true;
+
+    // when doing an explicit upgrade, if we pass the max version permitted, upgrade all the way
+    if (fExplicit && nVersion > nWalletMaxVersion)
+            nVersion = FEATURE_LATEST;
+
+    nWalletVersion = nVersion;
+
+    if (nVersion > nWalletMaxVersion)
+        nWalletMaxVersion = nVersion;
+
+    if (fFileBacked)
+    {
+        CWalletDB* pwalletdb = pwalletdbIn ? pwalletdbIn : new CWalletDB(strWalletFile);
+        if (nWalletVersion > 40000)
+            pwalletdb->WriteMinVersion(nWalletVersion);
+        if (!pwalletdbIn)
+            delete pwalletdb;
+    }
+
+    return true;
+}
+
+bool CWallet::SetMaxVersion(int nVersion)
+{
+    LOCK(cs_wallet); // nWalletVersion, nWalletMaxVersion
+    // cannot downgrade below current version
+    if (nWalletVersion > nVersion)
+        return false;
+
+    nWalletMaxVersion = nVersion;
+
+    return true;
+}
+
+set<uint256> CWallet::GetConflicts(const uint256& txid) const
+{
+    set<uint256> result;
+    AssertLockHeld(cs_wallet);
+
+    std::map<uint256, CWalletTx>::const_iterator it = mapWallet.find(txid);
+    if (it == mapWallet.end())
+        return result;
+    const CWalletTx& wtx = it->second;
+
+    std::pair<TxSpends::const_iterator, TxSpends::const_iterator> range;
+
+    for (const CTxIn& txin : wtx.vin)
+    {
+        if (mapTxSpends.count(txin.prevout) <= 1)
+            continue;  // No conflict if zero or one spends
+        range = mapTxSpends.equal_range(txin.prevout);
+        for (TxSpends::const_iterator _it = range.first; _it != range.second; ++_it)
+            result.insert(_it->second);
+    }
+
+    std::pair<TxNullifiers::const_iterator, TxNullifiers::const_iterator> range_n;
+
+    for (const JSDescription& jsdesc : wtx.vJoinSplit) {
+        for (const uint256& nullifier : jsdesc.nullifiers) {
+            if (mapTxSproutNullifiers.count(nullifier) <= 1) {
+                continue;  // No conflict if zero or one spends
+            }
+            range_n = mapTxSproutNullifiers.equal_range(nullifier);
+            for (TxNullifiers::const_iterator it = range_n.first; it != range_n.second; ++it) {
+                // TODO: Take into account transaction expiry for v4 transactions; see #5585
+                result.insert(it->second);
+            }
+        }
+    }
+
+    std::pair<TxNullifiers::const_iterator, TxNullifiers::const_iterator> range_o;
+
+    for (const SpendDescription &spend : wtx.vShieldedSpend) {
+        uint256 nullifier = spend.nullifier;
+        if (mapTxSaplingNullifiers.count(nullifier) <= 1) {
+            continue;  // No conflict if zero or one spends
+        }
+        range_o = mapTxSaplingNullifiers.equal_range(nullifier);
+        for (TxNullifiers::const_iterator it = range_o.first; it != range_o.second; ++it) {
+            // TODO: Take into account transaction expiry; see #5585
+            result.insert(it->second);
+        }
+    }
+
+    for (const uint256& nullifier : wtx.GetOrchardBundle().GetNullifiers()) {
+        auto potential_spends = orchardWallet.GetPotentialSpendsFromNullifier(nullifier);
+
+        if (potential_spends.size() <= 1) {
+            continue;  // No conflict if zero or one spends
+        }
+        for (const uint256 txid : potential_spends) {
+            // TODO: Take into account transaction expiry; see #5585
+            result.insert(txid);
+        }
+    }
+
+    return result;
+}
+
+void CWallet::Flush(bool shutdown)
+{
+    bitdb.Flush(shutdown);
+}
+
+bool static UIError(const std::string &str)
+{
+    uiInterface.ThreadSafeMessageBox(str, "", CClientUIInterface::MSG_ERROR);
+    return false;
+}
+
+void static UIWarning(const std::string &str)
+{
+    uiInterface.ThreadSafeMessageBox(str, "", CClientUIInterface::MSG_WARNING);
+}
+
+static std::string AmountErrMsg(const char * const optname, const std::string& strValue)
+{
+    return strprintf(_("Invalid amount for -%s=<amount>: '%s'"), optname, strValue);
+}
+
+bool CWallet::Verify()
+{
+    std::string walletFile = GetArg("-wallet", DEFAULT_WALLET_DAT);
+
+    LogPrintf("Using wallet %s\n", walletFile);
+    uiInterface.InitMessage(_("Verifying wallet..."));
+
+    if (walletFile != fs::basename(walletFile) + fs::extension(walletFile)) {
+        fs::path path(walletFile);
+        if (path.is_absolute()) {
+            if (!fs::exists(path.parent_path())) {
+                return UIError(strprintf(_("Absolute path %s does not exist"), walletFile));
+            }
+        } else {
+            fs::path full_path = GetDataDir() / path;
+            if (!fs::exists(full_path.parent_path())) {
+                return UIError(strprintf(_("Relative path %s does not exist"), walletFile));
+            }
+        }
+    }
+
+    if (!bitdb.Open(GetDataDir()))
+    {
+        // try moving the database env out of the way
+        fs::path pathDatabase = GetDataDir() / "database";
+        fs::path pathDatabaseBak = GetDataDir() / strprintf("database.%d.bak", GetTime());
+        try {
+            fs::rename(pathDatabase, pathDatabaseBak);
+            LogPrintf("Moved old %s to %s. Retrying.\n", pathDatabase.string(), pathDatabaseBak.string());
+        } catch (const fs::filesystem_error&) {
+            // failure is ok (well, not really, but it's not worse than what we started with)
+        }
+
+        // try again
+        if (!bitdb.Open(GetDataDir())) {
+            // if it still fails, it probably means we can't even create the database env
+            return UIError(strprintf(_("Error initializing wallet database environment %s!"), GetDataDir()));
+        }
+    }
+
+    if (GetBoolArg("-salvagewallet", false))
+    {
+        // Recover readable keypairs:
+        if (!CWalletDB::Recover(bitdb, walletFile, true))
+            return false;
+    }
+
+    if (fs::exists(GetDataDir() / walletFile))
+    {
+        CDBEnv::VerifyResult r = bitdb.Verify(walletFile, CWalletDB::Recover);
+        if (r == CDBEnv::RECOVER_OK)
+        {
+            UIWarning(strprintf(_("Warning: Wallet file corrupt, data salvaged!"
+                                         " Original %s saved as %s in %s; if"
+                                         " your balance or transactions are incorrect you should"
+                                         " restore from a backup."),
+                walletFile, "wallet.{timestamp}.bak", GetDataDir()));
+        }
+        if (r == CDBEnv::RECOVER_FAIL)
+            return UIError(strprintf(_("%s corrupt, salvage failed"), walletFile));
+    }
+
+    return true;
+}
+
+template <class T>
+void CWallet::SyncMetaData(pair<typename TxSpendMap<T>::iterator, typename TxSpendMap<T>::iterator> range)
+{
+    // We want all the wallet transactions in range to have the same metadata as
+    // the oldest (smallest nOrderPos).
+    // So: find smallest nOrderPos:
+
+    int nMinOrderPos = std::numeric_limits<int>::max();
+    const CWalletTx* copyFrom = NULL;
+    for (typename TxSpendMap<T>::iterator it = range.first; it != range.second; ++it)
+    {
+        const uint256& hash = it->second;
+        int n = mapWallet[hash].nOrderPos;
+        if (n < nMinOrderPos)
+        {
+            nMinOrderPos = n;
+            copyFrom = &mapWallet[hash];
+        }
+    }
+    // Now copy data from copyFrom to rest:
+    for (typename TxSpendMap<T>::iterator it = range.first; it != range.second; ++it)
+    {
+        const uint256& hash = it->second;
+        CWalletTx* copyTo = &mapWallet[hash];
+        if (copyFrom == copyTo) continue;
+        copyTo->mapValue = copyFrom->mapValue;
+        // mapSproutNoteData and mapSaplingNoteData not copied on purpose
+        // (it is always set correctly for each CWalletTx)
+        copyTo->vOrderForm = copyFrom->vOrderForm;
+        // fTimeReceivedIsTxTime not copied on purpose
+        // nTimeReceived not copied on purpose
+        copyTo->nTimeSmart = copyFrom->nTimeSmart;
+        copyTo->fFromMe = copyFrom->fFromMe;
+        // nOrderPos not copied on purpose
+        // cached members not copied on purpose
+    }
+}
+
+//
+// Zcash transaction output selectors
+//
+
+std::optional<ZTXOSelector> CWallet::ZTXOSelectorForAccount(
+    libzcash::AccountId account,
+    bool requireSpendingKey,
+    std::set<libzcash::ReceiverType> receiverTypes) const
+{
+    if (mnemonicHDChain.has_value() &&
+        mapUnifiedAccountKeys.count(
+            std::make_pair(mnemonicHDChain.value().GetSeedFingerprint(), account)
+        ) > 0)
+    {
+        return ZTXOSelector(AccountZTXOPattern(account, receiverTypes), requireSpendingKey);
+    } else {
+        return std::nullopt;
+    }
+}
+
+std::optional<ZTXOSelector> CWallet::ZTXOSelectorForAddress(
+        const libzcash::PaymentAddress& addr,
+        bool requireSpendingKey,
+        bool allowAddressLinkability) const
+{
+    auto self = this;
+    std::optional<ZTXOPattern> pattern = std::nullopt;
+    std::visit(match {
+        [&](const CKeyID& addr) {
+            if (!requireSpendingKey || self->HaveKey(addr)) {
+                pattern = addr;
+            }
+        },
+        [&](const CScriptID& addr) {
+            if (!requireSpendingKey || self->HaveCScript(addr)) {
+                pattern = addr;
+            }
+        },
+        [&](const libzcash::SaplingPaymentAddress& addr) {
+            if (!requireSpendingKey || self->HaveSaplingSpendingKeyForAddress(addr)) {
+                pattern = addr;
+            }
+        },
+        [&](const libzcash::SproutPaymentAddress& addr) {
+            if (!requireSpendingKey || self->HaveSproutSpendingKey(addr)) {
+                pattern = addr;
+            }
+        },
+        [&](const libzcash::UnifiedAddress& ua) {
+            auto ufvkMeta = GetUFVKMetadataForAddress(ua);
+            if (ufvkMeta.has_value()) {
+                // TODO: at present, the `false` value for the `requireSpendingKey` argument
+                // is not respected for unified addresses, because we have no notion of
+                // an account for which we do not control the spending key. An alternate
+                // approach would be to use the UFVK directly in the case that we cannot
+                // determine a local account.
+                auto accountId = this->GetUnifiedAccountId(ufvkMeta.value().GetUFVKId());
+                if (accountId.has_value()) {
+                    if (allowAddressLinkability) {
+                        pattern = AccountZTXOPattern(accountId.value(), ua.GetKnownReceiverTypes());
+                    } else {
+                        pattern = ua;
+                    }
+                }
+            } else {
+                pattern = ua;
+            }
+        }
+    }, addr);
+
+    if (pattern.has_value()) {
+        return ZTXOSelector(pattern.value(), requireSpendingKey);
+    } else {
+        return std::nullopt;
+    }
+}
+
+std::optional<ZTXOSelector> CWallet::ZTXOSelectorForViewingKey(
+        const libzcash::ViewingKey& vk,
+        bool requireSpendingKey) const
+{
+    auto self = this;
+    std::optional<ZTXOPattern> pattern = std::nullopt;
+    std::visit(match {
+        [&](const libzcash::SaplingExtendedFullViewingKey& vk) {
+            if (!requireSpendingKey || self->HaveSaplingSpendingKey(vk)) {
+                pattern = vk;
+            }
+        },
+        [&](const libzcash::SproutViewingKey& vk) {
+            if (!requireSpendingKey || self->HaveSproutSpendingKey(vk.address())) {
+                pattern = vk;
+            }
+        },
+        [&](const libzcash::UnifiedFullViewingKey& ufvk) {
+            auto ufvkId = ufvk.GetKeyID(Params());
+            auto accountId = this->GetUnifiedAccountId(ufvkId);
+            if (accountId.has_value()) {
+                pattern = AccountZTXOPattern(accountId.value(), ufvk.GetKnownReceiverTypes());
+            } else {
+                pattern = ufvk;
+            }
+        }
+    }, vk);
+
+    if (pattern.has_value()) {
+        return ZTXOSelector(pattern.value(), requireSpendingKey);
+    } else {
+        return std::nullopt;
+    }
+}
+
+ZTXOSelector CWallet::LegacyTransparentZTXOSelector(bool requireSpendingKey) {
+    return ZTXOSelector(
+            AccountZTXOPattern(ZCASH_LEGACY_ACCOUNT, {ReceiverType::P2PKH, ReceiverType::P2SH}),
+            requireSpendingKey);
+}
+
+std::optional<libzcash::AccountId> CWallet::FindAccountForSelector(const ZTXOSelector& selector) const {
+    auto self = this;
+    std::optional<libzcash::AccountId> result{};
+    std::visit(match {
+        [&](const CKeyID& addr) {
+            auto meta = self->GetUFVKMetadataForReceiver(addr);
+            if (meta.has_value()) {
+                result = self->GetUnifiedAccountId(meta.value().GetUFVKId());
+            }
+        },
+        [&](const CScriptID& addr) {
+            auto meta = self->GetUFVKMetadataForReceiver(addr);
+            if (meta.has_value()) {
+                result = self->GetUnifiedAccountId(meta.value().GetUFVKId());
+            }
+        },
+        [&](const libzcash::SproutPaymentAddress& addr) { },
+        [&](const libzcash::SproutViewingKey& vk) { },
+        [&](const libzcash::SaplingPaymentAddress& addr) {
+            auto meta = GetUFVKMetadataForReceiver(addr);
+            if (meta.has_value()) {
+                result = self->GetUnifiedAccountId(meta.value().GetUFVKId());
+            }
+        },
+        [&](const libzcash::SaplingExtendedFullViewingKey& vk) {
+            auto ufvkid = GetUFVKIdForViewingKey(vk);
+            if (ufvkid.has_value()) {
+                result = self->GetUnifiedAccountId(ufvkid.value());
+            }
+        },
+        [&](const libzcash::UnifiedAddress& addr) {
+            auto meta = GetUFVKMetadataForAddress(addr);
+            if (meta.has_value()) {
+                result = self->GetUnifiedAccountId(meta.value().GetUFVKId());
+            }
+        },
+        [&](const libzcash::UnifiedFullViewingKey& vk) {
+            result = self->GetUnifiedAccountId(vk.GetKeyID(Params()));
+        },
+        [&](const AccountZTXOPattern& acct) {
+            if (self->mnemonicHDChain.has_value() &&
+                self->mapUnifiedAccountKeys.count(
+                    std::make_pair(self->mnemonicHDChain.value().GetSeedFingerprint(), acct.GetAccountId())
+                ) > 0) {
+                result = acct.GetAccountId();
+            }
+        }
+    }, selector.GetPattern());
+    return result;
+}
+
+// SelectorMatchesAddress is overloaded for:
+// Transparent
+bool CWallet::SelectorMatchesAddress(
+        const ZTXOSelector& selector,
+        const CTxDestination& address) const {
+    auto self = this;
+    return std::visit(match {
+        [&](const CKeyID& keyId) {
+            CTxDestination keyIdDest = keyId;
+            return address == keyIdDest;
+        },
+        [&](const CScriptID& scriptId) {
+            CTxDestination scriptIdDest = scriptId;
+            return address == scriptIdDest;
+        },
+        [&](const libzcash::SproutPaymentAddress& addr) { return false; },
+        [&](const libzcash::SproutViewingKey& vk) { return false; },
+        [&](const libzcash::SaplingPaymentAddress& addr) { return false; },
+        [&](const libzcash::SaplingExtendedFullViewingKey& extfvk) { return false; },
+        [&](const libzcash::UnifiedAddress& uaSelector) {
+            // for a UA selector when matching transparent addresses, we only match addresses
+            // that explicitly appear as receivers in the UA.
+            for (const auto& receiver : uaSelector) {
+                bool matches = std::visit(match {
+                    [&](const libzcash::OrchardRawAddress& orchardAddr) { return false; },
+                    [&](const libzcash::SaplingPaymentAddress& saplingAddr) { return false; },
+                    [&](const libzcash::UnknownReceiver& receiver) { return false; },
+                    [&](const CScriptID& scriptId) {
+                        CTxDestination scriptIdDest = scriptId;
+                        return address == scriptIdDest;
+                    },
+                    [&](const CKeyID& keyId) {
+                        CTxDestination keyIdDest = keyId;
+                        return address == keyIdDest;
+                    }
+                }, receiver);
+                if (matches) return true;
+            }
+            return false;
+        },
+        [&](const libzcash::UnifiedFullViewingKey& ufvk) {
+            std::optional<AddressUFVKMetadata> meta;
+            std::visit(match {
+                [&](const CNoDestination& none) { meta = std::nullopt; },
+                [&](const auto& addr) { meta = self->GetUFVKMetadataForReceiver(addr); }
+            }, address);
+            return (meta.has_value() && meta.value().GetUFVKId() == ufvk.GetKeyID(Params()));
+        },
+        [&](const AccountZTXOPattern& acct) {
+            if (acct.IncludesP2PKH() || acct.IncludesP2SH()) {
+                std::optional<AddressUFVKMetadata> meta;
+                std::visit(match {
+                    [&](const CNoDestination& none) { meta = std::nullopt; },
+                    [&](const auto& addr) { meta = self->GetUFVKMetadataForReceiver(addr); }
+                }, address);
+                if (meta.has_value()) {
+                    // use the coin if the account id corresponding to the UFVK is
+                    // the payment source account.
+                    return self->GetUnifiedAccountId(meta.value().GetUFVKId()) == std::optional(acct.GetAccountId());
+                } else {
+                    // The legacy account is treated as a single pool of
+                    // transparent funds, reproducing wallet behavior prior to
+                    // the advent of unified addresses.
+                    return acct.GetAccountId() == ZCASH_LEGACY_ACCOUNT;
+                }
+            }
+            return false;
+        }
+    }, selector.GetPattern());
+}
+// Sprout
+bool CWallet::SelectorMatchesAddress(
+        const ZTXOSelector& selector,
+        const libzcash::SproutPaymentAddress& a0) const {
+    return std::visit(match {
+        [&](const libzcash::SproutPaymentAddress& a1) { return a0 == a1; },
+        [&](const libzcash::SproutViewingKey& vk) { return a0 == vk.address(); },
+        [&](const auto& addr) { return false; },
+    }, selector.GetPattern());
+}
+// Sapling
+bool CWallet::SelectorMatchesAddress(
+        const ZTXOSelector& selector,
+        const libzcash::SaplingPaymentAddress& a0) const {
+    auto self = this;
+    return std::visit(match {
+        [&](const CKeyID& keyId) { return false; },
+        [&](const CScriptID& scriptId) { return false; },
+        [&](const libzcash::SproutPaymentAddress& addr) { return false; },
+        [&](const libzcash::SproutViewingKey& vk) { return false; },
+        [&](const libzcash::SaplingPaymentAddress& a1) {
+            return a0 == a1;
+        },
+        [&](const libzcash::SaplingExtendedFullViewingKey& extfvk) {
+            auto j = extfvk.DecryptDiversifier(a0);
+            return j.has_value();
+        },
+        [&](const libzcash::UnifiedAddress& ua) {
+            const auto a0Meta = self->GetUFVKMetadataForReceiver(a0);
+            auto saplingReceiver = ua.GetSaplingReceiver();
+            if (saplingReceiver.has_value()) {
+                const auto uaMeta = self->GetUFVKMetadataForReceiver(saplingReceiver.value());
+                // if the Sapling address is derived from any UFVK corresponding to
+                // the Sapling component of the unified address, we consider that a
+                // match
+                return  a0Meta.has_value() && uaMeta.has_value() &&
+                        a0Meta.value().GetUFVKId() == uaMeta.value().GetUFVKId();
+            }
+            return false;
+        },
+        [&](const libzcash::UnifiedFullViewingKey& ufvk) {
+            auto saplingKey = ufvk.GetSaplingKey();
+            if (saplingKey.has_value()) {
+                auto j = saplingKey.value().DecryptDiversifier(a0);
+                return j.has_value();
+            } else {
+                return false;
+            }
+        },
+        [&](const AccountZTXOPattern& acct) {
+            if (acct.IncludesSapling()) {
+                const auto meta = self->GetUFVKMetadataForReceiver(a0);
+                if (meta.has_value()) {
+                    // use the coin if the account id corresponding to the UFVK is
+                    // the payment source account.
+                    return self->GetUnifiedAccountId(meta.value().GetUFVKId()) == std::optional(acct.GetAccountId());
+                } else {
+                    return false;
+                }
+            }
+            return false;
+        }
+    }, selector.GetPattern());
+}
+
+std::optional<RecipientAddress> CWallet::GenerateChangeAddressForAccount(
+        libzcash::AccountId accountId,
+        std::set<OutputPool> changeOptions) {
+    AssertLockHeld(cs_wallet);
+
+    if (accountId == ZCASH_LEGACY_ACCOUNT) {
+        // We only call this method with this account ID for legacy transparent addresses.
+        for (OutputPool t : changeOptions) {
+            if (t == OutputPool::Transparent) {
+                return GenerateNewKey(false).GetID();
+            }
+        }
+    } else {
+        auto ufvk = this->GetUnifiedFullViewingKeyByAccount(accountId);
+        if (ufvk.has_value()) {
+            // changeOptions is sorted in preference order, so return
+            // the first (and therefore most preferred) change address that
+            // we're able to generate.
+            for (OutputPool t : changeOptions) {
+                std::optional<RecipientAddress> changeAddr;
+                switch (t) {
+                case OutputPool::Orchard:
+                    changeAddr = ufvk.value().GetChangeAddress(OrchardChangeRequest());
+                    break;
+                case OutputPool::Sapling:
+                    changeAddr = ufvk.value().GetChangeAddress(SaplingChangeRequest());
+                    break;
+                case OutputPool::Transparent:
+                    // UFVKs must have a shielded component, so we would only
+                    // reach this point if changeOptions contained no shielded
+                    // options. But we prefer to opportunistically shield funds
+                    // where possible, so we don't produce transparent change
+                    // addresses for accounts.
+                    break;
+                }
+                if (changeAddr.has_value()) {
+                    return changeAddr.value();
+                }
+            }
+        }
+    }
+
+    return std::nullopt;
+}
+
+SpendableInputs CWallet::FindSpendableInputs(
+        ZTXOSelector selector,
+        bool allowTransparentCoinbase,
+        uint32_t minDepth) const {
+    AssertLockHeld(cs_main);
+    AssertLockHeld(cs_wallet);
+
+    KeyIO keyIO(Params());
+
+    bool selectTransparent{selector.SelectsTransparent()};
+    bool selectSprout{selector.SelectsSprout()};
+    bool selectSapling{selector.SelectsSapling()};
+    bool selectOrchard{selector.SelectsOrchard()};
+
+    SpendableInputs unspent;
+    for (auto const& [wtxid, wtx] : mapWallet) {
+        bool isCoinbase = wtx.IsCoinBase();
+        auto nDepth = wtx.GetDepthInMainChain();
+
+        // Filter the transactions before checking for coins
+        if (!CheckFinalTx(wtx)) continue;
+        if (nDepth < 0 || nDepth < minDepth) continue;
+
+        if (selectTransparent &&
+            // skip transparent utxo selection if coinbase spend restrictions are not met
+            (!isCoinbase || (allowTransparentCoinbase && wtx.GetBlocksToMaturity() <= 0))) {
+
+            for (int i = 0; i < wtx.vout.size(); i++) {
+                const auto& output = wtx.vout[i];
+                isminetype mine = IsMine(output);
+
+                // skip spent utxos
+                if (IsSpent(wtxid, i)) continue;
+                // skip utxos that don't belong to the wallet
+                if (mine == ISMINE_NO) continue;
+                // skip utxos that for which we don't have the spending keys, if
+                // spending keys are required
+                bool isSpendable = (mine & ISMINE_SPENDABLE) != ISMINE_NO || (mine & ISMINE_WATCH_SOLVABLE) != ISMINE_NO;
+                if (selector.RequireSpendingKeys() && !isSpendable) continue;
+                // skip locked utxos
+                if (IsLockedCoin(wtxid, i)) continue;
+                // skip zero-valued utxos
+                if (output.nValue == 0) continue;
+
+                // check to see if the coin conforms to the payment source
+                CTxDestination address;
+                bool isSelectable =
+                    ExtractDestination(output.scriptPubKey, address) &&
+                    this->SelectorMatchesAddress(selector, address);
+                if (isSelectable) {
+                    unspent.utxos.push_back(COutput(&wtx, i, nDepth, true, isCoinbase));
+                }
+            }
+        }
+
+        if (selectSprout) {
+            for (auto const& [jsop, nd] : wtx.mapSproutNoteData) {
+                SproutPaymentAddress pa = nd.address;
+
+                // skip note which has been spent
+                if (nd.nullifier.has_value() && IsSproutSpent(nd.nullifier.value())) continue;
+                // skip notes which don't match the source
+                if (!this->SelectorMatchesAddress(selector, pa)) continue;
+                // skip notes for which we don't have the spending key
+                if (selector.RequireSpendingKeys() && !this->HaveSproutSpendingKey(pa)) continue;
+                // skip locked notes
+                if (IsLockedNote(jsop)) continue;
+
+                // Get cached decryptor
+                ZCNoteDecryption decryptor;
+                if (!GetNoteDecryptor(pa, decryptor)) {
+                    // Note decryptors are created when the wallet is loaded, so it should always exist
+                    throw std::runtime_error(strprintf(
+                                "Could not find note decryptor for payment address %s",
+                                keyIO.EncodePaymentAddress(pa)));
+                }
+
+                // determine amount of funds in the note
+                int i = jsop.js; // Index into CTransaction.vJoinSplit
+                auto hSig = ZCJoinSplit::h_sig(
+                    wtx.vJoinSplit[i].randomSeed,
+                    wtx.vJoinSplit[i].nullifiers,
+                    wtx.joinSplitPubKey);
+
+                try {
+                    int j = jsop.n; // Index into JSDescription.ciphertexts
+                    SproutNotePlaintext plaintext = SproutNotePlaintext::decrypt(
+                            decryptor,
+                            wtx.vJoinSplit[i].ciphertexts[j],
+                            wtx.vJoinSplit[i].ephemeralKey,
+                            hSig,
+                            (unsigned char) j);
+
+                    unspent.sproutNoteEntries.push_back(SproutNoteEntry {
+                        jsop, pa, plaintext.note(pa), plaintext.memo(), wtx.GetDepthInMainChain() });
+
+                } catch (const note_decryption_failed &err) {
+                    // Couldn't decrypt with this spending key
+                    throw std::runtime_error(strprintf(
+                            "Could not decrypt note for payment address %s",
+                            keyIO.EncodePaymentAddress(pa)));
+                } catch (const std::exception &exc) {
+                    // Unexpected failure
+                    throw std::runtime_error(strprintf(
+                            "Error while decrypting note for payment address %s: %s",
+                            keyIO.EncodePaymentAddress(pa), exc.what()));
+                }
+            }
+        }
+
+        if (selectSapling) {
+            for (auto const& [op, nd] : wtx.mapSaplingNoteData) {
+                auto optDeserialized = SaplingNotePlaintext::attempt_sapling_enc_decryption_deserialization(wtx.vShieldedOutput[op.n].encCiphertext, nd.ivk, wtx.vShieldedOutput[op.n].ephemeralKey);
+
+                // The transaction would not have entered the wallet unless
+                // its plaintext had been successfully decrypted previously.
+                assert(optDeserialized != std::nullopt);
+
+                auto notePt = optDeserialized.value();
+                auto maybe_pa = nd.ivk.address(notePt.d);
+                assert(maybe_pa.has_value());
+                auto pa = maybe_pa.value();
+
+                // skip notes which have been spent
+                if (nd.nullifier.has_value() && IsSaplingSpent(nd.nullifier.value())) continue;
+                // skip notes which do not match the source
+                if (!this->SelectorMatchesAddress(selector, pa)) continue;
+                // skip notes if we don't have the spending key
+                if (selector.RequireSpendingKeys() && !this->HaveSaplingSpendingKeyForAddress(pa)) continue;
+                // skip locked notes
+                if (IsLockedNote(op)) continue;
+
+                auto note = notePt.note(nd.ivk).value();
+                unspent.saplingNoteEntries.push_back(SaplingNoteEntry {
+                    op, pa, note, notePt.memo(), wtx.GetDepthInMainChain() });
+            }
+        }
+    }
+
+    if (selectOrchard) {
+        // for Orchard, we select both the internal and external IVKs.
+        auto orchardIvks = std::visit(match {
+            [&](const libzcash::UnifiedAddress& selectorUA) -> std::vector<OrchardIncomingViewingKey> {
+                auto orchardReceiver = selectorUA.GetOrchardReceiver();
+                if (orchardReceiver.has_value()) {
+                    auto meta = GetUFVKMetadataForReceiver(orchardReceiver.value());
+                    if (meta.has_value()) {
+                        auto ufvk = GetUnifiedFullViewingKey(meta.value().GetUFVKId());
+                        if (ufvk.has_value()) {
+                            auto fvk = ufvk->GetOrchardKey();
+                            if (fvk.has_value()) {
+                                return {fvk->ToIncomingViewingKey(), fvk->ToInternalIncomingViewingKey()};
+                            }
+                        }
+                    }
+                }
+                return {};
+            },
+            [&](const libzcash::UnifiedFullViewingKey& ufvk) -> std::vector<OrchardIncomingViewingKey> {
+                auto fvk = ufvk.GetOrchardKey();
+                if (fvk.has_value()) {
+                    return {fvk->ToIncomingViewingKey(), fvk->ToInternalIncomingViewingKey()};
+                }
+                return {};
+            },
+            [&](const AccountZTXOPattern& acct) -> std::vector<OrchardIncomingViewingKey> {
+                auto ufvk = GetUnifiedFullViewingKeyByAccount(acct.GetAccountId());
+                if (ufvk.has_value()) {
+                    auto fvk = ufvk->GetOrchardKey();
+                    if (fvk.has_value()) {
+                        return {fvk->ToIncomingViewingKey(), fvk->ToInternalIncomingViewingKey()};
+                    }
+                }
+                return {};
+            },
+            [&](const auto& addr) -> std::vector<OrchardIncomingViewingKey> { return {}; }
+        }, selector.GetPattern());
+
+        for (const auto& ivk : orchardIvks) {
+            std::vector<OrchardNoteMetadata> incomingNotes;
+            orchardWallet.GetFilteredNotes(incomingNotes, ivk, true, true);
+
+            for (auto& noteMeta : incomingNotes) {
+                if (IsOrchardSpent(noteMeta.GetOutPoint())) {
+                    continue;
+                }
+
+                auto mit = mapWallet.find(noteMeta.GetOutPoint().hash);
+
+                // We should never get an outpoint from the Orchard wallet where
+                // the transaction does not exist in the main wallet.
+                assert(mit != mapWallet.end());
+
+                int confirmations = mit->second.GetDepthInMainChain();
+                if (confirmations < 0) continue;
+                if (confirmations >= minDepth) {
+                    noteMeta.SetConfirmations(confirmations);
+                    unspent.orchardNoteMetadata.push_back(noteMeta);
+                }
+            }
+        }
+    }
+
+    return unspent;
+}
+
+/**
+ * Outpoint is spent if any non-conflicted transaction
+ * spends it:
+ */
+bool CWallet::IsSpent(const uint256& hash, unsigned int n) const
+{
+    const COutPoint outpoint(hash, n);
+    pair<TxSpends::const_iterator, TxSpends::const_iterator> range;
+    range = mapTxSpends.equal_range(outpoint);
+
+    for (TxSpends::const_iterator it = range.first; it != range.second; ++it)
+    {
+        const uint256& wtxid = it->second;
+        std::map<uint256, CWalletTx>::const_iterator mit = mapWallet.find(wtxid);
+        if (mit != mapWallet.end() && mit->second.GetDepthInMainChain() >= 0)
+            return true; // Spent
+    }
+    return false;
+}
+
+/**
+ * Note is spent if any non-conflicted transaction
+ * spends it:
+ */
+bool CWallet::IsSproutSpent(const uint256& nullifier) const {
+    LOCK(cs_main);
+    pair<TxNullifiers::const_iterator, TxNullifiers::const_iterator> range;
+    range = mapTxSproutNullifiers.equal_range(nullifier);
+
+    for (TxNullifiers::const_iterator it = range.first; it != range.second; ++it) {
+        const uint256& wtxid = it->second;
+        std::map<uint256, CWalletTx>::const_iterator mit = mapWallet.find(wtxid);
+        if (mit != mapWallet.end() && mit->second.GetDepthInMainChain() >= 0) {
+            return true; // Spent
+        }
+    }
+    return false;
+}
+
+bool CWallet::IsSaplingSpent(const uint256& nullifier) const {
+    LOCK(cs_main);
+    pair<TxNullifiers::const_iterator, TxNullifiers::const_iterator> range;
+    range = mapTxSaplingNullifiers.equal_range(nullifier);
+
+    for (TxNullifiers::const_iterator it = range.first; it != range.second; ++it) {
+        const uint256& wtxid = it->second;
+        std::map<uint256, CWalletTx>::const_iterator mit = mapWallet.find(wtxid);
+        if (mit != mapWallet.end() && mit->second.GetDepthInMainChain() >= 0) {
+            return true; // Spent
+        }
+    }
+    return false;
+}
+
+bool CWallet::IsOrchardSpent(const OrchardOutPoint& outpoint) const {
+    for (const auto& txid : orchardWallet.GetPotentialSpends(outpoint)) {
+        std::map<uint256, CWalletTx>::const_iterator mit = mapWallet.find(txid);
+        if (mit != mapWallet.end() && mit->second.GetDepthInMainChain() >= 0) {
+            return true; // Spent
+        }
+    }
+    return false;
+}
+
+void CWallet::AddToTransparentSpends(const COutPoint& outpoint, const uint256& wtxid)
+{
+    mapTxSpends.insert(make_pair(outpoint, wtxid));
+
+    pair<TxSpends::iterator, TxSpends::iterator> range;
+    range = mapTxSpends.equal_range(outpoint);
+    SyncMetaData<COutPoint>(range);
+}
+
+void CWallet::AddToSproutSpends(const uint256& nullifier, const uint256& wtxid)
+{
+    mapTxSproutNullifiers.insert(make_pair(nullifier, wtxid));
+
+    pair<TxNullifiers::iterator, TxNullifiers::iterator> range;
+    range = mapTxSproutNullifiers.equal_range(nullifier);
+    SyncMetaData<uint256>(range);
+}
+
+void CWallet::AddToSaplingSpends(const uint256& nullifier, const uint256& wtxid)
+{
+    mapTxSaplingNullifiers.insert(make_pair(nullifier, wtxid));
+
+    pair<TxNullifiers::iterator, TxNullifiers::iterator> range;
+    range = mapTxSaplingNullifiers.equal_range(nullifier);
+    SyncMetaData<uint256>(range);
+}
+
+void CWallet::AddToSpends(const uint256& wtxid)
+{
+    assert(mapWallet.count(wtxid));
+    CWalletTx& thisTx = mapWallet[wtxid];
+    if (thisTx.IsCoinBase()) // Coinbases don't spend anything!
+        return;
+
+    for (const CTxIn& txin : thisTx.vin) {
+        AddToTransparentSpends(txin.prevout, wtxid);
+    }
+    for (const JSDescription& jsdesc : thisTx.vJoinSplit) {
+        for (const uint256& nullifier : jsdesc.nullifiers) {
+            AddToSproutSpends(nullifier, wtxid);
+        }
+    }
+    for (const SpendDescription &spend : thisTx.vShieldedSpend) {
+        AddToSaplingSpends(spend.nullifier, wtxid);
+    }
+
+    // for Orchard, the effects of this operation are performed by
+    // AddNotesIfInvolvingMe and LoadCaches
+}
+
+void CWallet::ClearNoteWitnessCache()
+{
+    LOCK(cs_wallet);
+    for (std::pair<const uint256, CWalletTx>& wtxItem : mapWallet) {
+        for (mapSproutNoteData_t::value_type& item : wtxItem.second.mapSproutNoteData) {
+            item.second.witnesses.clear();
+            item.second.witnessHeight = -1;
+        }
+        for (mapSaplingNoteData_t::value_type& item : wtxItem.second.mapSaplingNoteData) {
+            item.second.witnesses.clear();
+            item.second.witnessHeight = -1;
+        }
+    }
+    nWitnessCacheSize = 0;
+}
+
+template<typename NoteDataMap>
+void CopyPreviousWitnesses(NoteDataMap& noteDataMap, int indexHeight, int64_t nWitnessCacheSize)
+{
+    for (auto& item : noteDataMap) {
+        auto* nd = &(item.second);
+        // Only increment witnesses that are behind the current height
+        if (nd->witnessHeight < indexHeight) {
+            // Check the validity of the cache
+            // The only time a note witnessed above the current height
+            // would be invalid here is during a reindex when blocks
+            // have been decremented, and we are incrementing the blocks
+            // immediately after.
+            assert(nWitnessCacheSize >= nd->witnesses.size());
+            // Witnesses being incremented should always be either -1
+            // (never incremented or decremented) or one below indexHeight
+            assert((nd->witnessHeight == -1) || (nd->witnessHeight == indexHeight - 1));
+            // Copy the witness for the previous block if we have one
+            if (nd->witnesses.size() > 0) {
+                nd->witnesses.push_front(nd->witnesses.front());
+            }
+            if (nd->witnesses.size() > WITNESS_CACHE_SIZE) {
+                nd->witnesses.pop_back();
+            }
+        }
+    }
+}
+
+template<typename NoteDataMap>
+void AppendNoteCommitment(NoteDataMap& noteDataMap, int indexHeight, int64_t nWitnessCacheSize, const uint256& note_commitment)
+{
+    for (auto& item : noteDataMap) {
+        auto* nd = &(item.second);
+        if (nd->witnessHeight < indexHeight && nd->witnesses.size() > 0) {
+            // Check the validity of the cache
+            // See comment in CopyPreviousWitnesses about validity.
+            assert(nWitnessCacheSize >= nd->witnesses.size());
+            nd->witnesses.front().append(note_commitment);
+        }
+    }
+}
+
+template<typename OutPoint, typename NoteData, typename Witness>
+void WitnessNoteIfMine(std::map<OutPoint, NoteData>& noteDataMap, int indexHeight, int64_t nWitnessCacheSize, const OutPoint& key, const Witness& witness)
+{
+    if (noteDataMap.count(key) && noteDataMap[key].witnessHeight < indexHeight) {
+        auto* nd = &(noteDataMap[key]);
+        if (nd->witnesses.size() > 0) {
+            // We think this can happen because we write out the
+            // witness cache state after every block increment or
+            // decrement, but the block index itself is written in
+            // batches. So if the node crashes in between these two
+            // operations, it is possible for IncrementNoteWitnesses
+            // to be called again on previously-cached blocks. This
+            // doesn't affect existing cached notes because of the
+            // NoteData::witnessHeight checks. See #1378 for details.
+            LogPrintf("Inconsistent witness cache state found for %s\n- Cache size: %d\n- Top (height %d): %s\n- New (height %d): %s\n",
+                        key.ToString(), nd->witnesses.size(),
+                        nd->witnessHeight,
+                        nd->witnesses.front().root().GetHex(),
+                        indexHeight,
+                        witness.root().GetHex());
+            nd->witnesses.clear();
+        }
+        nd->witnesses.push_front(witness);
+        // Set height to one less than pindex so it gets incremented
+        nd->witnessHeight = indexHeight - 1;
+        // Check the validity of the cache
+        assert(nWitnessCacheSize >= nd->witnesses.size());
+    }
+}
+
+
+template<typename NoteDataMap>
+void UpdateWitnessHeights(NoteDataMap& noteDataMap, int indexHeight, int64_t nWitnessCacheSize)
+{
+    for (auto& item : noteDataMap) {
+        auto* nd = &(item.second);
+        if (nd->witnessHeight < indexHeight) {
+            nd->witnessHeight = indexHeight;
+            // Check the validity of the cache
+            // See comment in CopyPreviousWitnesses about validity.
+            assert(nWitnessCacheSize >= nd->witnesses.size());
+        }
+    }
+}
+
+void CWallet::IncrementNoteWitnesses(
+        const Consensus::Params& consensus,
+        const CBlockIndex* pindex,
+        const CBlock* pblockIn,
+        MerkleFrontiers& frontiers,
+        bool performOrchardWalletUpdates)
+{
+    LOCK(cs_wallet);
+    for (std::pair<const uint256, CWalletTx>& wtxItem : mapWallet) {
+       ::CopyPreviousWitnesses(wtxItem.second.mapSproutNoteData, pindex->nHeight, nWitnessCacheSize);
+       ::CopyPreviousWitnesses(wtxItem.second.mapSaplingNoteData, pindex->nHeight, nWitnessCacheSize);
+    }
+
+    if (performOrchardWalletUpdates && consensus.NetworkUpgradeActive(pindex->nHeight, Consensus::UPGRADE_NU5)) {
+        if (!orchardWallet.GetLastCheckpointHeight().has_value()) {
+            orchardWallet.InitNoteCommitmentTree(frontiers.orchard);
+        }
+        assert(orchardWallet.CheckpointNoteCommitmentTree(pindex->nHeight));
+    }
+
+    if (nWitnessCacheSize < WITNESS_CACHE_SIZE) {
+        nWitnessCacheSize += 1;
+    }
+
+    const CBlock* pblock {pblockIn};
+    CBlock block;
+    if (!pblock) {
+        ReadBlockFromDisk(block, pindex, consensus);
+        pblock = &block;
+    }
+
+    for (const CTransaction& tx : pblock->vtx) {
+        auto hash = tx.GetHash();
+        bool txIsOurs = mapWallet.count(hash);
+        // Sprout
+        for (size_t i = 0; i < tx.vJoinSplit.size(); i++) {
+            const JSDescription& jsdesc = tx.vJoinSplit[i];
+            for (uint8_t j = 0; j < jsdesc.commitments.size(); j++) {
+                const uint256& note_commitment = jsdesc.commitments[j];
+                frontiers.sprout.append(note_commitment);
+
+                // Increment existing witnesses
+                for (std::pair<const uint256, CWalletTx>& wtxItem : mapWallet) {
+                    ::AppendNoteCommitment(wtxItem.second.mapSproutNoteData, pindex->nHeight, nWitnessCacheSize, note_commitment);
+                }
+
+                // If this is our note, witness it
+                if (txIsOurs) {
+                    JSOutPoint jsoutpt {hash, i, j};
+                    ::WitnessNoteIfMine(mapWallet[hash].mapSproutNoteData, pindex->nHeight, nWitnessCacheSize, jsoutpt, frontiers.sprout.witness());
+                }
+            }
+        }
+        // Sapling
+        for (uint32_t i = 0; i < tx.vShieldedOutput.size(); i++) {
+            const uint256& note_commitment = tx.vShieldedOutput[i].cmu;
+            frontiers.sapling.append(note_commitment);
+
+            // Increment existing witnesses
+            for (std::pair<const uint256, CWalletTx>& wtxItem : mapWallet) {
+                ::AppendNoteCommitment(wtxItem.second.mapSaplingNoteData, pindex->nHeight, nWitnessCacheSize, note_commitment);
+            }
+
+            // If this is our note, witness it
+            if (txIsOurs) {
+                SaplingOutPoint outPoint {hash, i};
+                ::WitnessNoteIfMine(mapWallet[hash].mapSaplingNoteData, pindex->nHeight, nWitnessCacheSize, outPoint, frontiers.sapling.witness());
+            }
+        }
+    }
+
+    // If we're at or beyond NU5 activation, update the Orchard note commitment tree.
+    if (performOrchardWalletUpdates && consensus.NetworkUpgradeActive(pindex->nHeight, Consensus::UPGRADE_NU5)) {
+        assert(orchardWallet.AppendNoteCommitments(pindex->nHeight, *pblock));
+        assert(pindex->hashFinalOrchardRoot == orchardWallet.GetLatestAnchor());
+    }
+
+    // Update witness heights
+    for (std::pair<const uint256, CWalletTx>& wtxItem : mapWallet) {
+        ::UpdateWitnessHeights(wtxItem.second.mapSproutNoteData, pindex->nHeight, nWitnessCacheSize);
+        ::UpdateWitnessHeights(wtxItem.second.mapSaplingNoteData, pindex->nHeight, nWitnessCacheSize);
+    }
+
+    // For performance reasons, we write out the witness cache in
+    // CWallet::SetBestChain() (which also ensures that overall consistency
+    // of the wallet.dat is maintained).
+}
+
+template<typename NoteDataMap>
+void DecrementNoteWitnesses(NoteDataMap& noteDataMap, int indexHeight, int64_t nWitnessCacheSize)
+{
+    for (auto& item : noteDataMap) {
+        auto* nd = &(item.second);
+        // Only decrement witnesses that are not above the current height
+        if (nd->witnessHeight <= indexHeight) {
+            // Check the validity of the cache
+            // See comment below (this would be invalid if there were a
+            // prior decrement).
+            assert(nWitnessCacheSize >= nd->witnesses.size());
+            // Witnesses being decremented should always be either -1
+            // (never incremented or decremented) or equal to the height
+            // of the block being removed (indexHeight)
+            assert((nd->witnessHeight == -1) || (nd->witnessHeight == indexHeight));
+            if (nd->witnesses.size() > 0) {
+                nd->witnesses.pop_front();
+            }
+            // indexHeight is the height of the block being removed, so
+            // the new witness cache height is one below it.
+            nd->witnessHeight = indexHeight - 1;
+        }
+        // Check the validity of the cache
+        // Technically if there are notes witnessed above the current
+        // height, their cache will now be invalid (relative to the new
+        // value of nWitnessCacheSize). However, this would only occur
+        // during a reindex, and by the time the reindex reaches the tip
+        // of the chain again, the existing witness caches will be valid
+        // again.
+        // We don't set nWitnessCacheSize to zero at the start of the
+        // reindex because the on-disk blocks had already resulted in a
+        // chain that didn't trigger the assertion below.
+        if (nd->witnessHeight < indexHeight) {
+            // Subtract 1 to compare to what nWitnessCacheSize will be after
+            // decrementing.
+            assert((nWitnessCacheSize - 1) >= nd->witnesses.size());
+        }
+    }
+}
+
+void CWallet::DecrementNoteWitnesses(const Consensus::Params& consensus, const CBlockIndex* pindex)
+{
+    LOCK(cs_wallet);
+    bool hasSprout = false;
+    bool hasSapling = false;
+    for (std::pair<const uint256, CWalletTx>& wtxItem : mapWallet) {
+        hasSprout |= !wtxItem.second.mapSproutNoteData.empty();
+        ::DecrementNoteWitnesses(wtxItem.second.mapSproutNoteData, pindex->nHeight, nWitnessCacheSize);
+        hasSapling |= !wtxItem.second.mapSaplingNoteData.empty();
+        ::DecrementNoteWitnesses(wtxItem.second.mapSaplingNoteData, pindex->nHeight, nWitnessCacheSize);
+    }
+    if (nWitnessCacheSize > 0) {
+        nWitnessCacheSize -= 1;
+    }
+    // TODO: If nWitnessCache is zero, we need to regenerate the caches (#1302);
+    // however, if we have never observed Sprout or Sapling notes, this is okay
+    // because then the witness cache size can remain at 0.
+    assert(!(hasSprout || hasSapling) || nWitnessCacheSize > 0);
+
+    // ORCHARD: rewind to the last checkpoint.
+    if (consensus.NetworkUpgradeActive(pindex->nHeight, Consensus::UPGRADE_NU5)) {
+        // pindex->nHeight is the height of the block being removed, so we rewind
+        // to the previous block height
+        uint32_t uResultHeight{0};
+        assert(pindex->nHeight >= 1);
+        assert(orchardWallet.Rewind(pindex->nHeight - 1, uResultHeight));
+        assert(uResultHeight == pindex->nHeight - 1);
+        // If we have no checkpoints after the rewind, then the latest anchor of the
+        // wallet's Orchard note commitment tree will be in an indeterminate state and it
+        // will be overwritten in the next `IncrementNoteWitnesses` call, so we can skip
+        // the check against `hashFinalOrchardRoot`.
+        if (orchardWallet.GetLastCheckpointHeight().has_value()) {
+            assert(pindex->pprev->hashFinalOrchardRoot == orchardWallet.GetLatestAnchor());
+        }
+    }
+
+    // For performance reasons, we write out the witness cache in
+    // CWallet::SetBestChain() (which also ensures that overall consistency
+    // of the wallet.dat is maintained).
+}
+
+bool CWallet::EncryptWallet(const SecureString& strWalletPassphrase)
+{
+    if (IsCrypted())
+        return false;
+
+    CKeyingMaterial vMasterKey;
+
+    vMasterKey.resize(WALLET_CRYPTO_KEY_SIZE);
+    GetRandBytes(&vMasterKey[0], WALLET_CRYPTO_KEY_SIZE);
+
+    CMasterKey kMasterKey;
+
+    kMasterKey.vchSalt.resize(WALLET_CRYPTO_SALT_SIZE);
+    GetRandBytes(&kMasterKey.vchSalt[0], WALLET_CRYPTO_SALT_SIZE);
+
+    CCrypter crypter;
+    int64_t nStartTime = GetTimeMillis();
+    crypter.SetKeyFromPassphrase(strWalletPassphrase, kMasterKey.vchSalt, 25000, kMasterKey.nDerivationMethod);
+    kMasterKey.nDeriveIterations = 2500000 / ((double)(GetTimeMillis() - nStartTime));
+
+    nStartTime = GetTimeMillis();
+    crypter.SetKeyFromPassphrase(strWalletPassphrase, kMasterKey.vchSalt, kMasterKey.nDeriveIterations, kMasterKey.nDerivationMethod);
+    kMasterKey.nDeriveIterations = (kMasterKey.nDeriveIterations + kMasterKey.nDeriveIterations * 100 / ((double)(GetTimeMillis() - nStartTime))) / 2;
+
+    if (kMasterKey.nDeriveIterations < 25000)
+        kMasterKey.nDeriveIterations = 25000;
+
+    LogPrintf("Encrypting Wallet with an nDeriveIterations of %i\n", kMasterKey.nDeriveIterations);
+
+    if (!crypter.SetKeyFromPassphrase(strWalletPassphrase, kMasterKey.vchSalt, kMasterKey.nDeriveIterations, kMasterKey.nDerivationMethod))
+        return false;
+    if (!crypter.Encrypt(vMasterKey, kMasterKey.vchCryptedKey))
+        return false;
+
+    {
+        LOCK(cs_wallet);
+        mapMasterKeys[++nMasterKeyMaxID] = kMasterKey;
+        if (fFileBacked)
+        {
+            assert(!pwalletdbEncryption);
+            pwalletdbEncryption = new CWalletDB(strWalletFile);
+            if (!pwalletdbEncryption->TxnBegin()) {
+                delete pwalletdbEncryption;
+                pwalletdbEncryption = NULL;
+                return false;
+            }
+            pwalletdbEncryption->WriteMasterKey(nMasterKeyMaxID, kMasterKey);
+        }
+
+        if (!EncryptKeys(vMasterKey))
+        {
+            if (fFileBacked) {
+                pwalletdbEncryption->TxnAbort();
+                delete pwalletdbEncryption;
+            }
+            // We now probably have half of our keys encrypted in memory, and half not...
+            // die and let the user reload the unencrypted wallet.
+            assert(false);
+        }
+
+        // Encryption was introduced in version 0.4.0
+        SetMinVersion(FEATURE_WALLETCRYPT, pwalletdbEncryption, true);
+
+        if (fFileBacked)
+        {
+            if (!pwalletdbEncryption->TxnCommit()) {
+                delete pwalletdbEncryption;
+                // We now have keys encrypted in memory, but not on disk...
+                // die to avoid confusion and let the user reload the unencrypted wallet.
+                assert(false);
+            }
+
+            delete pwalletdbEncryption;
+            pwalletdbEncryption = NULL;
+        }
+
+        Lock();
+        Unlock(strWalletPassphrase);
+        // TODO: migrate to a new mnemonic when encrypting an unencrypted wallet?
+        Lock();
+
+        // Need to completely rewrite the wallet file; if we don't, bdb might keep
+        // bits of the unencrypted private key in slack space in the database file.
+        CDB::Rewrite(strWalletFile);
+
+    }
+    NotifyStatusChanged(this);
+
+    return true;
+}
+
+DBErrors CWallet::ReorderTransactions()
+{
+    LOCK(cs_wallet);
+    CWalletDB walletdb(strWalletFile);
+
+    // Old wallets didn't have any defined order for transactions
+    // Probably a bad idea to change the output of this
+
+    // First: get all CWalletTx into a sorted-by-time multimap.
+    typedef std::multimap<int64_t, CWalletTx*> TxItems;
+    TxItems txByTime;
+
+    for (auto &entry : mapWallet)
+    {
+        CWalletTx *wtx = &entry.second;
+        txByTime.insert(std::make_pair(wtx->nTimeReceived, wtx));
+    }
+
+    nOrderPosNext = 0;
+    std::vector<int64_t> nOrderPosOffsets;
+    for (TxItems::iterator it = txByTime.begin(); it != txByTime.end(); ++it)
+    {
+        CWalletTx *const pwtx = (*it).second;
+        int64_t& nOrderPos = pwtx->nOrderPos;
+
+        if (nOrderPos == -1)
+        {
+            nOrderPos = nOrderPosNext++;
+            nOrderPosOffsets.push_back(nOrderPos);
+
+            if (!walletdb.WriteTx(*pwtx))
+                return DB_LOAD_FAIL;
+        }
+        else
+        {
+            int64_t nOrderPosOff = 0;
+            for(const int64_t& nOffsetStart : nOrderPosOffsets)
+            {
+                if (nOrderPos >= nOffsetStart)
+                    ++nOrderPosOff;
+            }
+            nOrderPos += nOrderPosOff;
+            nOrderPosNext = std::max(nOrderPosNext, nOrderPos + 1);
+
+            if (!nOrderPosOff)
+                continue;
+
+            // Since we're changing the order, write it back
+            if (!walletdb.WriteTx(*pwtx))
+                return DB_LOAD_FAIL;
+        }
+    }
+    walletdb.WriteOrderPosNext(nOrderPosNext);
+
+    return DB_LOAD_OK;
+}
+
+int64_t CWallet::IncOrderPosNext(CWalletDB *pwalletdb)
+{
+    AssertLockHeld(cs_wallet); // nOrderPosNext
+    int64_t nRet = nOrderPosNext++;
+    if (pwalletdb) {
+        pwalletdb->WriteOrderPosNext(nOrderPosNext);
+    } else {
+        CWalletDB(strWalletFile).WriteOrderPosNext(nOrderPosNext);
+    }
+    return nRet;
+}
+
+void CWallet::MarkDirty()
+{
+    {
+        LOCK(cs_wallet);
+        for (std::pair<const uint256, CWalletTx>& item : mapWallet)
+            item.second.MarkDirty();
+    }
+}
+
+/**
+ * Ensure that every note in the wallet (for which we possess a spending key)
+ * has a cached nullifier.
+ */
+bool CWallet::UpdateNullifierNoteMap()
+{
+    {
+        LOCK(cs_wallet);
+
+        if (IsLocked())
+            return false;
+
+        ZCNoteDecryption dec;
+        for (std::pair<const uint256, CWalletTx>& wtxItem : mapWallet) {
+            for (mapSproutNoteData_t::value_type& item : wtxItem.second.mapSproutNoteData) {
+                if (!item.second.nullifier) {
+                    if (GetNoteDecryptor(item.second.address, dec)) {
+                        auto i = item.first.js;
+                        auto hSig = ZCJoinSplit::h_sig(
+                            wtxItem.second.vJoinSplit[i].randomSeed,
+                            wtxItem.second.vJoinSplit[i].nullifiers,
+                            wtxItem.second.joinSplitPubKey);
+                        item.second.nullifier = GetSproutNoteNullifier(
+                            wtxItem.second.vJoinSplit[i],
+                            item.second.address,
+                            dec,
+                            hSig,
+                            item.first.n);
+                    }
+                }
+            }
+
+            // TODO: Sapling.  This method is only called from RPC walletpassphrase, which is currently unsupported
+            // as RPC encryptwallet is hidden behind two flags: -developerencryptwallet -experimentalfeatures
+
+            UpdateNullifierNoteMapWithTx(wtxItem.second);
+        }
+    }
+    return true;
+}
+
+/**
+ * Update mapSproutNullifiersToNotes and mapSaplingNullifiersToNotes
+ * with the cached nullifiers in this tx.
+ */
+void CWallet::UpdateNullifierNoteMapWithTx(const CWalletTx& wtx)
+{
+    {
+        LOCK(cs_wallet);
+        for (const mapSproutNoteData_t::value_type& item : wtx.mapSproutNoteData) {
+            if (item.second.nullifier) {
+                mapSproutNullifiersToNotes[*item.second.nullifier] = item.first;
+            }
+        }
+
+        for (const mapSaplingNoteData_t::value_type& item : wtx.mapSaplingNoteData) {
+            if (item.second.nullifier) {
+                mapSaplingNullifiersToNotes[*item.second.nullifier] = item.first;
+            }
+        }
+    }
+}
+
+/**
+ * Update mapSaplingNullifiersToNotes, computing the nullifier from a cached witness if necessary.
+ */
+void CWallet::UpdateSaplingNullifierNoteMapWithTx(CWalletTx& wtx) {
+    LOCK(cs_wallet);
+
+    for (mapSaplingNoteData_t::value_type &item : wtx.mapSaplingNoteData) {
+        SaplingOutPoint op = item.first;
+        SaplingNoteData nd = item.second;
+
+        if (nd.witnesses.empty()) {
+            // The Sapling nullifier depends upon the position of the note in the
+            // note commitment tree.
+            //
+            // If there are no witnesses, erase the nullifier and associated mapping.
+            if (item.second.nullifier) {
+                mapSaplingNullifiersToNotes.erase(item.second.nullifier.value());
+            }
+            item.second.nullifier = std::nullopt;
+        }
+        else {
+            uint64_t position = nd.witnesses.front().position();
+            auto extfvk = mapSaplingFullViewingKeys.at(nd.ivk);
+            OutputDescription output = wtx.vShieldedOutput[op.n];
+
+            auto optDeserialized = SaplingNotePlaintext::attempt_sapling_enc_decryption_deserialization(output.encCiphertext, nd.ivk, output.ephemeralKey);
+
+            // The transaction would not have entered the wallet unless
+            // its plaintext had been successfully decrypted previously.
+            assert(optDeserialized != std::nullopt);
+
+            auto optPlaintext = SaplingNotePlaintext::plaintext_checks_without_height(*optDeserialized, nd.ivk, output.ephemeralKey, output.cmu);
+
+            // An item in mapSaplingNoteData must have already been successfully decrypted,
+            // otherwise the item would not exist in the first place.
+            assert(optPlaintext != std::nullopt);
+
+            auto optNote = optPlaintext.value().note(nd.ivk);
+            assert(optNote != std::nullopt);
+
+            auto optNullifier = optNote.value().nullifier(extfvk.fvk, position);
+            // This should not happen.  If it does, maybe the position has been corrupted or miscalculated?
+            assert(optNullifier != std::nullopt);
+            uint256 nullifier = optNullifier.value();
+            mapSaplingNullifiersToNotes[nullifier] = op;
+            item.second.nullifier = nullifier;
+        }
+    }
+}
+
+/**
+ * Iterate over transactions in a block and update the cached Sapling nullifiers
+ * for transactions which belong to the wallet.
+ */
+void CWallet::UpdateSaplingNullifierNoteMapForBlock(const CBlock *pblock) {
+    LOCK(cs_wallet);
+
+    for (const CTransaction& tx : pblock->vtx) {
+        auto hash = tx.GetHash();
+        bool txIsOurs = mapWallet.count(hash);
+        if (txIsOurs) {
+            UpdateSaplingNullifierNoteMapWithTx(mapWallet[hash]);
+        }
+    }
+}
+
+void CWallet::LoadWalletTx(const CWalletTx& wtxIn) {
+    uint256 hash = wtxIn.GetHash();
+    mapWallet[hash] = wtxIn;
+    CWalletTx& wtx = mapWallet[hash];
+    wtx.BindWallet(this);
+    wtxOrdered.insert(make_pair(wtx.nOrderPos, &wtx));
+    UpdateNullifierNoteMapWithTx(mapWallet[hash]);
+    AddToSpends(hash);
+}
+
+bool CWallet::AddToWallet(const CWalletTx& wtxIn, CWalletDB* pwalletdb)
+{
+    { // additional scope left in place for backport whitespace compatibility
+        uint256 hash = wtxIn.GetHash();
+
+        LOCK(cs_wallet);
+        // Inserts only if not already there, returns tx inserted or tx found
+        pair<map<uint256, CWalletTx>::iterator, bool> ret = mapWallet.insert(make_pair(hash, wtxIn));
+        CWalletTx& wtx = (*ret.first).second;
+        wtx.BindWallet(this);
+        UpdateNullifierNoteMapWithTx(wtx);
+        bool fInsertedNew = ret.second;
+        if (fInsertedNew)
+        {
+            wtx.nTimeReceived = GetTime();
+            wtx.nOrderPos = IncOrderPosNext(pwalletdb);
+            wtxOrdered.insert(make_pair(wtx.nOrderPos, &wtx));
+
+            wtx.nTimeSmart = wtx.nTimeReceived;
+            if (!wtxIn.hashBlock.IsNull())
+            {
+                if (mapBlockIndex.count(wtxIn.hashBlock))
+                {
+                    int64_t latestNow = wtx.nTimeReceived;
+                    int64_t latestEntry = 0;
+                    {
+                        // Tolerate times up to the last timestamp in the wallet not more than 5 minutes into the future
+                        int64_t latestTolerated = latestNow + 300;
+                        const TxItems & txOrdered = wtxOrdered;
+                        for (TxItems::const_reverse_iterator it = txOrdered.rbegin(); it != txOrdered.rend(); ++it)
+                        {
+                            CWalletTx *const pwtx = (*it).second;
+                            if (pwtx == &wtx)
+                                continue;
+                            int64_t nSmartTime;
+                            nSmartTime = pwtx->nTimeSmart;
+                            if (!nSmartTime)
+                                nSmartTime = pwtx->nTimeReceived;
+                            if (nSmartTime <= latestTolerated)
+                            {
+                                latestEntry = nSmartTime;
+                                if (nSmartTime > latestNow)
+                                    latestNow = nSmartTime;
+                                break;
+                            }
+                        }
+                    }
+
+                    int64_t blocktime = mapBlockIndex[wtxIn.hashBlock]->GetBlockTime();
+                    wtx.nTimeSmart = std::max(latestEntry, std::min(blocktime, latestNow));
+                }
+                else
+                    LogPrintf("AddToWallet(): found %s in block %s not in index\n",
+                             wtxIn.GetHash().ToString(),
+                             wtxIn.hashBlock.ToString());
+            }
+            AddToSpends(hash);
+        }
+
+        bool fUpdated = false;
+        if (!fInsertedNew)
+        {
+            // Merge
+            if (!wtxIn.hashBlock.IsNull() && wtxIn.hashBlock != wtx.hashBlock)
+            {
+                wtx.hashBlock = wtxIn.hashBlock;
+                fUpdated = true;
+            }
+            if (wtxIn.nIndex != -1 && (wtxIn.vMerkleBranch != wtx.vMerkleBranch || wtxIn.nIndex != wtx.nIndex))
+            {
+                wtx.vMerkleBranch = wtxIn.vMerkleBranch;
+                wtx.nIndex = wtxIn.nIndex;
+                fUpdated = true;
+            }
+            if (UpdatedNoteData(wtxIn, wtx)) {
+                fUpdated = true;
+            }
+            if (wtxIn.fFromMe && wtxIn.fFromMe != wtx.fFromMe)
+            {
+                wtx.fFromMe = wtxIn.fFromMe;
+                fUpdated = true;
+            }
+        }
+
+        //// debug print
+        LogPrintf("AddToWallet %s  %s%s\n", wtxIn.GetHash().ToString(), (fInsertedNew ? "new" : ""), (fUpdated ? "update" : ""));
+
+        // Write to disk
+        if (fInsertedNew || fUpdated)
+            if (!pwalletdb->WriteTx(wtx))
+                return false;
+
+        // Break debit/credit balance caches:
+        wtx.MarkDirty();
+
+        // Notify UI of new or updated transaction
+        NotifyTransactionChanged(this, hash, fInsertedNew ? CT_NEW : CT_UPDATED);
+
+        // notify an external script when a wallet transaction comes in or is updated
+        std::string strCmd = GetArg("-walletnotify", "");
+
+        if ( !strCmd.empty())
+        {
+            boost::replace_all(strCmd, "%s", wtxIn.GetHash().GetHex());
+            boost::thread t(runCommand, strCmd); // thread runs free
+        }
+    }
+    return true;
+}
+
+bool CWallet::UpdatedNoteData(const CWalletTx& wtxIn, CWalletTx& wtx)
+{
+    bool unchangedSproutFlag = (wtxIn.mapSproutNoteData.empty() || wtxIn.mapSproutNoteData == wtx.mapSproutNoteData);
+    if (!unchangedSproutFlag) {
+        auto tmp = wtxIn.mapSproutNoteData;
+        // Ensure we keep any cached witnesses we may already have
+        for (const std::pair <JSOutPoint, SproutNoteData> nd : wtx.mapSproutNoteData) {
+            if (tmp.count(nd.first) && nd.second.witnesses.size() > 0) {
+                tmp.at(nd.first).witnesses.assign(
+                        nd.second.witnesses.cbegin(), nd.second.witnesses.cend());
+            }
+            tmp.at(nd.first).witnessHeight = nd.second.witnessHeight;
+        }
+        // Now copy over the updated note data
+        wtx.mapSproutNoteData = tmp;
+    }
+
+    bool unchangedSaplingFlag = (wtxIn.mapSaplingNoteData.empty() || wtxIn.mapSaplingNoteData == wtx.mapSaplingNoteData);
+    if (!unchangedSaplingFlag) {
+        auto tmp = wtxIn.mapSaplingNoteData;
+        // Ensure we keep any cached witnesses we may already have
+
+        for (const std::pair <SaplingOutPoint, SaplingNoteData> nd : wtx.mapSaplingNoteData) {
+            if (tmp.count(nd.first) && nd.second.witnesses.size() > 0) {
+                tmp.at(nd.first).witnesses.assign(
+                        nd.second.witnesses.cbegin(), nd.second.witnesses.cend());
+            }
+            tmp.at(nd.first).witnessHeight = nd.second.witnessHeight;
+        }
+
+        // Now copy over the updated note data
+        wtx.mapSaplingNoteData = tmp;
+    }
+
+    bool unchangedOrchardFlag = (wtxIn.orchardTxMeta.empty() || wtxIn.orchardTxMeta == wtx.orchardTxMeta);
+    if (!unchangedOrchardFlag) {
+        wtx.orchardTxMeta = wtxIn.orchardTxMeta;
+    }
+
+    return !unchangedSproutFlag || !unchangedSaplingFlag || !unchangedOrchardFlag;
+}
+
+/**
+ * Add a transaction to the wallet, or update it.
+ * pblock is optional, but should be provided if the transaction is known to be in a block.
+ * If fUpdate is true, existing transactions will be updated.
+ *
+ * If pblock is null, this transaction has either recently entered the mempool from the
+ * network, is re-entering the mempool after a block was disconnected, or is exiting the
+ * mempool because it conflicts with another transaction. In all these cases, if there is
+ * an existing wallet transaction, the wallet transaction's Merkle branch data is _not_
+ * updated; instead, the transaction being in the mempool or conflicted is determined on
+ * the fly in CMerkleTx::GetDepthInMainChain().
+ */
+bool CWallet::AddToWalletIfInvolvingMe(
+        const Consensus::Params& consensus,
+        const CTransaction& tx,
+        const CBlock* pblock,
+        const int nHeight,
+        bool fUpdate)
+{
+    { // extra scope left in place for backport whitespace compatibility
+        AssertLockHeld(cs_wallet);
+
+        // Check whether the transaction is already known by the wallet.
+        bool fExisted = mapWallet.count(tx.GetHash()) != 0;
+        if (fExisted && !fUpdate) return false;
+
+        // Sprout
+        auto sproutNoteData = FindMySproutNotes(tx);
+
+        // Sapling
+        auto saplingNoteDataAndAddressesToAdd = FindMySaplingNotes(tx, nHeight);
+        auto saplingNoteData = saplingNoteDataAndAddressesToAdd.first;
+        auto saplingAddressesToAdd = saplingNoteDataAndAddressesToAdd.second;
+        for (const auto &addressToAdd : saplingAddressesToAdd) {
+            // Add mapping between address and IVK for easy future lookup.
+            if (!AddSaplingPaymentAddress(addressToAdd.second, addressToAdd.first)) {
+                return false;
+            }
+        }
+
+        // Orchard
+        std::optional<OrchardWalletTxMeta> orchardTxMeta;
+        if (consensus.NetworkUpgradeActive(nHeight, Consensus::UPGRADE_NU5)) {
+            orchardTxMeta = orchardWallet.AddNotesIfInvolvingMe(tx);
+        }
+
+        if (fExisted || IsMine(tx) || IsFromMe(tx) ||
+            sproutNoteData.size() > 0 ||
+            saplingNoteData.size() > 0 ||
+            orchardTxMeta.has_value())
+        {
+            CWalletTx wtx(this, tx);
+
+            if (sproutNoteData.size() > 0) {
+                wtx.SetSproutNoteData(sproutNoteData);
+            }
+
+            if (saplingNoteData.size() > 0) {
+                wtx.SetSaplingNoteData(saplingNoteData);
+            }
+
+            if (orchardTxMeta.has_value()) {
+                wtx.SetOrchardTxMeta(orchardTxMeta.value());
+            }
+
+            // Get merkle branch if transaction was found in a block
+            if (pblock)
+                wtx.SetMerkleBranch(*pblock);
+
+            // Do not flush the wallet here for performance reasons; this is
+            // safe, as in case of a crash, we rescan the necessary blocks on
+            // startup through our SetBestChain-mechanism
+            CWalletDB walletdb(strWalletFile, "r+", false);
+
+            return AddToWallet(wtx, &walletdb);
+        }
+        return false;
+    }
+}
+
+void CWallet::SyncTransaction(const CTransaction& tx, const CBlock* pblock, const int nHeight)
+{
+    LOCK(cs_wallet);
+    if (!AddToWalletIfInvolvingMe(Params().GetConsensus(), tx, pblock, nHeight, true))
+        return; // Not one of ours
+
+    MarkAffectedTransactionsDirty(tx);
+}
+
+void CWallet::MarkAffectedTransactionsDirty(const CTransaction& tx)
+{
+    // If a transaction changes 'conflicted' state, that changes the balance
+    // available of the outputs it spends. So force those to be
+    // recomputed, also:
+    for (const CTxIn& txin : tx.vin)
+    {
+        if (mapWallet.count(txin.prevout.hash))
+            mapWallet[txin.prevout.hash].MarkDirty();
+    }
+    for (const JSDescription& jsdesc : tx.vJoinSplit) {
+        for (const uint256& nullifier : jsdesc.nullifiers) {
+            if (mapSproutNullifiersToNotes.count(nullifier) &&
+                mapWallet.count(mapSproutNullifiersToNotes[nullifier].hash)) {
+                mapWallet[mapSproutNullifiersToNotes[nullifier].hash].MarkDirty();
+            }
+        }
+    }
+
+    for (const SpendDescription &spend : tx.vShieldedSpend) {
+        uint256 nullifier = spend.nullifier;
+        if (mapSaplingNullifiersToNotes.count(nullifier) &&
+            mapWallet.count(mapSaplingNullifiersToNotes[nullifier].hash)) {
+            mapWallet[mapSaplingNullifiersToNotes[nullifier].hash].MarkDirty();
+        }
+    }
+}
+
+void CWallet::EraseFromWallet(const uint256 &hash)
+{
+    if (!fFileBacked)
+        return;
+    {
+        LOCK(cs_wallet);
+        if (mapWallet.erase(hash))
+            CWalletDB(strWalletFile).EraseTx(hash);
+    }
+    return;
+}
+
+
+/**
+ * Returns a nullifier if the SpendingKey is available
+ * Throws std::runtime_error if the decryptor doesn't match this note
+ */
+std::optional<uint256> CWallet::GetSproutNoteNullifier(const JSDescription &jsdesc,
+                                                         const libzcash::SproutPaymentAddress &address,
+                                                         const ZCNoteDecryption &dec,
+                                                         const uint256 &hSig,
+                                                         uint8_t n) const
+{
+    std::optional<uint256> ret;
+    auto note_pt = libzcash::SproutNotePlaintext::decrypt(
+        dec,
+        jsdesc.ciphertexts[n],
+        jsdesc.ephemeralKey,
+        hSig,
+        (unsigned char) n);
+    auto note = note_pt.note(address);
+
+    // Check note plaintext against note commitment
+    if (note.cm() != jsdesc.commitments[n]) {
+        throw libzcash::note_decryption_failed();
+    }
+
+    // SpendingKeys are only available if:
+    // - We have them (this isn't a viewing key)
+    // - The wallet is unlocked
+    libzcash::SproutSpendingKey key;
+    if (GetSproutSpendingKey(address, key)) {
+        ret = note.nullifier(key);
+    }
+    return ret;
+}
+
+/**
+ * Finds all output notes in the given transaction that have been sent to
+ * PaymentAddresses in this wallet.
+ *
+ * It should never be necessary to call this method with a CWalletTx, because
+ * the result of FindMySproutNotes (for the addresses available at the time) will
+ * already have been cached in CWalletTx.mapSproutNoteData.
+ */
+mapSproutNoteData_t CWallet::FindMySproutNotes(const CTransaction &tx) const
+{
+    LOCK(cs_KeyStore);
+    uint256 hash = tx.GetHash();
+
+    mapSproutNoteData_t noteData;
+    for (size_t i = 0; i < tx.vJoinSplit.size(); i++) {
+        auto hSig = ZCJoinSplit::h_sig(
+            tx.vJoinSplit[i].randomSeed,
+            tx.vJoinSplit[i].nullifiers,
+            tx.joinSplitPubKey);
+        for (uint8_t j = 0; j < tx.vJoinSplit[i].ciphertexts.size(); j++) {
+            for (const NoteDecryptorMap::value_type& item : mapNoteDecryptors) {
+                try {
+                    auto address = item.first;
+                    JSOutPoint jsoutpt {hash, i, j};
+                    auto nullifier = GetSproutNoteNullifier(
+                        tx.vJoinSplit[i],
+                        address,
+                        item.second,
+                        hSig, j);
+                    if (nullifier) {
+                        SproutNoteData nd {address, *nullifier};
+                        noteData.insert(std::make_pair(jsoutpt, nd));
+                    } else {
+                        SproutNoteData nd {address};
+                        noteData.insert(std::make_pair(jsoutpt, nd));
+                    }
+                    break;
+                } catch (const note_decryption_failed &err) {
+                    // Couldn't decrypt with this decryptor
+                } catch (const std::exception &exc) {
+                    // Unexpected failure
+                    LogPrintf("FindMySproutNotes(): Unexpected error while testing decrypt:\n");
+                    LogPrintf("%s\n", exc.what());
+                }
+            }
+        }
+    }
+    return noteData;
+}
+
+
+/**
+ * Finds all output notes in the given transaction that have been sent to
+ * SaplingPaymentAddresses in this wallet.
+ *
+ * It should never be necessary to call this method with a CWalletTx, because
+ * the result of FindMySaplingNotes (for the addresses available at the time) will
+ * already have been cached in CWalletTx.mapSaplingNoteData.
+ */
+std::pair<mapSaplingNoteData_t, SaplingIncomingViewingKeyMap> CWallet::FindMySaplingNotes(const CTransaction &tx, int height) const
+{
+    LOCK(cs_KeyStore);
+    uint256 hash = tx.GetHash();
+
+    mapSaplingNoteData_t noteData;
+    SaplingIncomingViewingKeyMap viewingKeysToAdd;
+
+    // Protocol Spec: 4.19 Block Chain Scanning (Sapling)
+    for (uint32_t i = 0; i < tx.vShieldedOutput.size(); ++i) {
+        const OutputDescription output = tx.vShieldedOutput[i];
+        for (auto it = mapSaplingFullViewingKeys.begin(); it != mapSaplingFullViewingKeys.end(); ++it) {
+            SaplingIncomingViewingKey ivk = it->first;
+
+            auto result = SaplingNotePlaintext::decrypt(Params().GetConsensus(), height, output.encCiphertext, ivk, output.ephemeralKey, output.cmu);
+            if (!result) {
+                continue;
+            }
+            auto address = ivk.address(result.value().d);
+            if (address && mapSaplingIncomingViewingKeys.count(address.value()) == 0) {
+                viewingKeysToAdd[address.value()] = ivk;
+            }
+            // We don't cache the nullifier here as computing it requires knowledge of the note position
+            // in the commitment tree, which can only be determined when the transaction has been mined.
+            SaplingOutPoint op {hash, i};
+            SaplingNoteData nd;
+            nd.ivk = ivk;
+            noteData.insert(std::make_pair(op, nd));
+            break;
+        }
+    }
+
+    return std::make_pair(noteData, viewingKeysToAdd);
+}
+
+bool CWallet::IsSproutNullifierFromMe(const uint256& nullifier) const
+{
+    {
+        LOCK(cs_wallet);
+        if (mapSproutNullifiersToNotes.count(nullifier) &&
+                mapWallet.count(mapSproutNullifiersToNotes.at(nullifier).hash)) {
+            return true;
+        }
+    }
+    return false;
+}
+
+bool CWallet::IsSaplingNullifierFromMe(const uint256& nullifier) const
+{
+    {
+        LOCK(cs_wallet);
+        if (mapSaplingNullifiersToNotes.count(nullifier) &&
+                mapWallet.count(mapSaplingNullifiersToNotes.at(nullifier).hash)) {
+            return true;
+        }
+    }
+    return false;
+}
+
+bool CWallet::GetSproutNoteWitnesses(const std::vector<JSOutPoint>& notes,
+                                     unsigned int confirmations,
+                                     std::vector<std::optional<SproutWitness>>& witnesses,
+                                     uint256 &final_anchor) const
+{
+    LOCK(cs_wallet);
+    witnesses.resize(notes.size());
+    std::optional<uint256> rt;
+    int i = 0;
+    for (JSOutPoint note : notes) {
+        if (mapWallet.count(note.hash) &&
+                mapWallet.at(note.hash).mapSproutNoteData.count(note) &&
+                mapWallet.at(note.hash).mapSproutNoteData.at(note).witnesses.size() > 0) {
+            auto noteWitnesses = mapWallet.at(note.hash).mapSproutNoteData.at(note).witnesses;
+            auto it = noteWitnesses.cbegin(), end = noteWitnesses.cend();
+            for (int i = 1; i < confirmations; i++) {
+                if (it == end) return false;
+                ++it;
+            }
+            if (it == end) return false;
+            witnesses[i] = *it;
+            if (!rt) {
+                rt = witnesses[i]->root();
+            } else {
+                assert(*rt == witnesses[i]->root());
+            }
+        }
+        i++;
+    }
+    // All returned witnesses have the same anchor
+    if (rt) {
+        final_anchor = *rt;
+    }
+    return true;
+}
+
+bool CWallet::GetSaplingNoteWitnesses(const std::vector<SaplingOutPoint>& notes,
+                                      unsigned int confirmations,
+                                      std::vector<std::optional<SaplingWitness>>& witnesses,
+                                      uint256 &final_anchor) const
+{
+    LOCK(cs_wallet);
+    witnesses.resize(notes.size());
+    std::optional<uint256> rt;
+    int i = 0;
+    for (SaplingOutPoint note : notes) {
+        if (mapWallet.count(note.hash) &&
+                mapWallet.at(note.hash).mapSaplingNoteData.count(note) &&
+                mapWallet.at(note.hash).mapSaplingNoteData.at(note).witnesses.size() > 0) {
+            auto noteWitnesses = mapWallet.at(note.hash).mapSaplingNoteData.at(note).witnesses;
+            auto it = noteWitnesses.cbegin(), end = noteWitnesses.cend();
+            for (int i = 1; i < confirmations; i++) {
+                if (it == end) return false;
+                ++it;
+            }
+            if (it == end) return false;
+            witnesses[i] = *it;
+            if (!rt) {
+                rt = witnesses[i]->root();
+            } else {
+                assert(*rt == witnesses[i]->root());
+            }
+        }
+        i++;
+    }
+    // All returned witnesses have the same anchor
+    if (rt) {
+        final_anchor = *rt;
+    }
+    return true;
+}
+
+std::vector<std::pair<libzcash::OrchardSpendingKey, orchard::SpendInfo>> CWallet::GetOrchardSpendInfo(
+    const std::vector<OrchardNoteMetadata>& orchardNoteMetadata,
+    uint256 anchor) const
+{
+    AssertLockHeld(cs_wallet);
+    return orchardWallet.GetSpendInfo(orchardNoteMetadata, anchor);
+}
+
+isminetype CWallet::IsMine(const CTxIn &txin) const
+{
+    {
+        LOCK(cs_wallet);
+        map<uint256, CWalletTx>::const_iterator mi = mapWallet.find(txin.prevout.hash);
+        if (mi != mapWallet.end())
+        {
+            const CWalletTx& prev = (*mi).second;
+            if (txin.prevout.n < prev.vout.size())
+                return IsMine(prev.vout[txin.prevout.n]);
+        }
+    }
+    return ISMINE_NO;
+}
+
+CAmount CWallet::GetDebit(const CTxIn &txin, const isminefilter& filter) const
+{
+    {
+        LOCK(cs_wallet);
+        map<uint256, CWalletTx>::const_iterator mi = mapWallet.find(txin.prevout.hash);
+        if (mi != mapWallet.end())
+        {
+            const CWalletTx& prev = (*mi).second;
+            if (txin.prevout.n < prev.vout.size())
+                if (IsMine(prev.vout[txin.prevout.n]) & filter)
+                    return prev.vout[txin.prevout.n].nValue;
+        }
+    }
+    return 0;
+}
+
+isminetype CWallet::IsMine(const CTxOut& txout) const
+{
+    return ::IsMine(*this, txout.scriptPubKey);
+}
+
+CAmount CWallet::GetCredit(const CTxOut& txout, const isminefilter& filter) const
+{
+    if (!MoneyRange(txout.nValue))
+        throw std::runtime_error("CWallet::GetCredit(): value out of range");
+    return ((IsMine(txout) & filter) ? txout.nValue : 0);
+}
+
+bool CWallet::IsChange(const CTxOut& txout) const
+{
+    // Addresses must be ours to be change
+    if (!::IsMine(*this, txout.scriptPubKey))
+        return false;
+
+    // Only p2pkh addresses are used for change
+    CTxDestination address;
+    if (!ExtractDestination(txout.scriptPubKey, address))
+        return true;
+
+    LOCK(cs_wallet);
+    // Any payment to a script that is in the address book is not change.
+    if (mapAddressBook.count(address))
+        return false;
+
+    // We look to key metadata to determine whether the address was generated
+    // using an internal key path. This could fail to identify some legacy
+    // change addresses as change outputs.
+    return std::visit(match {
+        [&](const CKeyID& key) {
+            auto keyMetaIt = mapKeyMetadata.find(key);
+            return
+                // If we don't have key metadata, it's a legacy address that is not
+                // in the address book, so we judge it to be change.
+                keyMetaIt == mapKeyMetadata.end() ||
+                keyMetaIt->second.hdKeypath == "" ||
+                // If we do have non-null key metadata, we inspect the metadata to
+                // make our determination
+                IsInternalKeyPath(44, BIP44CoinType(), keyMetaIt->second.hdKeypath);
+        },
+        [&](const auto& other) { return false; }
+    }, address);
+}
+
+CAmount CWallet::GetChange(const CTxOut& txout) const
+{
+    if (!MoneyRange(txout.nValue))
+        throw std::runtime_error("CWallet::GetChange(): value out of range");
+    return (IsChange(txout) ? txout.nValue : 0);
+}
+
+bool CWallet::IsMine(const CTransaction& tx) const
+{
+    for (const CTxOut& txout : tx.vout)
+        if (IsMine(txout))
+            return true;
+    return false;
+}
+
+bool CWallet::IsFromMe(const CTransaction& tx) const
+{
+    if (GetDebit(tx, ISMINE_ALL) > 0) {
+        return true;
+    }
+    for (const JSDescription& jsdesc : tx.vJoinSplit) {
+        for (const uint256& nullifier : jsdesc.nullifiers) {
+            if (IsSproutNullifierFromMe(nullifier)) {
+                return true;
+            }
+        }
+    }
+    for (const SpendDescription &spend : tx.vShieldedSpend) {
+        if (IsSaplingNullifierFromMe(spend.nullifier)) {
+            return true;
+        }
+    }
+    return false;
+}
+
+CAmount CWallet::GetDebit(const CTransaction& tx, const isminefilter& filter) const
+{
+    CAmount nDebit = 0;
+    for (const CTxIn& txin : tx.vin)
+    {
+        nDebit += GetDebit(txin, filter);
+        if (!MoneyRange(nDebit))
+            throw std::runtime_error("CWallet::GetDebit(): value out of range");
+    }
+    return nDebit;
+}
+
+CAmount CWallet::GetCredit(const CTransaction& tx, const isminefilter& filter) const
+{
+    CAmount nCredit = 0;
+    for (const CTxOut& txout : tx.vout)
+    {
+        nCredit += GetCredit(txout, filter);
+        if (!MoneyRange(nCredit))
+            throw std::runtime_error("CWallet::GetCredit(): value out of range");
+    }
+    return nCredit;
+}
+
+CAmount CWallet::GetChange(const CTransaction& tx) const
+{
+    CAmount nChange = 0;
+    for (const CTxOut& txout : tx.vout)
+    {
+        nChange += GetChange(txout);
+        if (!MoneyRange(nChange))
+            throw std::runtime_error("CWallet::GetChange(): value out of range");
+    }
+    return nChange;
+}
+
+bool CWallet::IsHDFullyEnabled() const
+{
+    // Only Sapling addresses are HD for now
+    return false;
+}
+
+void CWallet::GenerateNewSeed(Language language)
+{
+    LOCK(cs_wallet);
+
+    auto legacySeed = GetLegacyHDSeed();
+    auto seed = legacySeed.has_value() ?
+        MnemonicSeed::FromLegacySeed(legacySeed.value(), BIP44CoinType(), language) :
+        MnemonicSeed::Random(BIP44CoinType(), language, WALLET_MNEMONIC_ENTROPY_LENGTH);
+
+    int64_t nCreationTime = GetTime();
+
+    // If the wallet is encrypted and locked, this will fail.
+    if (!SetMnemonicSeed(seed))
+        throw std::runtime_error(std::string(__func__) + ": SetHDSeed failed");
+
+    // store the key creation time together with
+    // the child index counter in the database
+    // as a hdchain object
+    CHDChain newHdChain(seed.Fingerprint(), nCreationTime);
+    SetMnemonicHDChain(newHdChain, false);
+
+    // Now that we can derive keys deterministically, clear out the legacy
+    // transparent keypool of all randomly-generated keys, and fill it with
+    // internal keys (for use as change addresses or miner outputs).
+    NewKeyPool();
+}
+
+bool CWallet::SetMnemonicSeed(const MnemonicSeed& seed)
+{
+    if (!CCryptoKeyStore::SetMnemonicSeed(seed)) {
+        return false;
+    }
+
+    if (!fFileBacked) {
+        return true;
+    }
+
+    {
+        LOCK(cs_wallet);
+        CWalletDB(strWalletFile).WriteNetworkInfo(networkIdString);
+        if (!IsCrypted()) {
+            return CWalletDB(strWalletFile).WriteMnemonicSeed(seed);
+        }
+    }
+    return true;
+}
+
+bool CWallet::SetCryptedMnemonicSeed(const uint256& seedFp, const std::vector<unsigned char> &vchCryptedSecret)
+{
+    if (!CCryptoKeyStore::SetCryptedMnemonicSeed(seedFp, vchCryptedSecret)) {
+        return false;
+    }
+
+    if (!fFileBacked) {
+        return true;
+    }
+
+    {
+        LOCK(cs_wallet);
+        if (pwalletdbEncryption)
+            return pwalletdbEncryption->WriteCryptedMnemonicSeed(seedFp, vchCryptedSecret);
+        else
+            return CWalletDB(strWalletFile).WriteCryptedMnemonicSeed(seedFp, vchCryptedSecret);
+    }
+    return false;
+}
+
+bool CWallet::VerifyMnemonicSeed(const SecureString& mnemonic) {
+    LOCK(cs_wallet);
+
+    auto seed = GetMnemonicSeed();
+    if (seed.has_value() && mnemonicHDChain.has_value() && seed.value().GetMnemonic() == mnemonic) {
+        CHDChain& hdChain = mnemonicHDChain.value();
+        hdChain.SetMnemonicSeedBackupConfirmed();
+        // Update the persisted chain information
+        if (fFileBacked && !CWalletDB(strWalletFile).WriteMnemonicHDChain(hdChain)) {
+            throw std::runtime_error(
+                    "CWallet::VerifyMnemonicSeed(): Writing HD chain model failed");
+        }
+        return true;
+    } else {
+        return false;
+    }
+}
+
+bool CWallet::MnemonicVerified() {
+    return mnemonicHDChain.has_value() && mnemonicHDChain.value().IsMnemonicSeedBackupConfirmed();
+}
+
+HDSeed CWallet::GetHDSeedForRPC() const {
+    auto seed = GetMnemonicSeed();
+    if (!seed.has_value()) {
+        throw JSONRPCError(RPC_WALLET_ERROR, "HD seed not found");
+    }
+    return seed.value();
+}
+
+// TODO: make private
+void CWallet::SetMnemonicHDChain(const CHDChain& chain, bool memonly)
+{
+    LOCK(cs_wallet);
+    if (!memonly && fFileBacked && !CWalletDB(strWalletFile).WriteMnemonicHDChain(chain))
+        throw std::runtime_error(std::string(__func__) + ": writing chain failed");
+
+    mnemonicHDChain = chain;
+}
+
+bool CWallet::CheckNetworkInfo(std::pair<std::string, std::string> readNetworkInfo) const
+{
+    LOCK(cs_wallet);
+    std::pair<string, string> networkInfo(PACKAGE_NAME, networkIdString);
+    return readNetworkInfo == networkInfo;
+}
+
+uint32_t CWallet::BIP44CoinType() const {
+    return Params(networkIdString).BIP44CoinType();
+}
+
+
+bool CWallet::LoadMnemonicSeed(const MnemonicSeed& seed)
+{
+    return CBasicKeyStore::SetMnemonicSeed(seed);
+}
+
+bool CWallet::LoadLegacyHDSeed(const HDSeed& seed)
+{
+    return CBasicKeyStore::SetLegacyHDSeed(seed);
+}
+
+bool CWallet::LoadCryptedMnemonicSeed(const uint256& seedFp, const std::vector<unsigned char>& seed)
+{
+    return CCryptoKeyStore::SetCryptedMnemonicSeed(seedFp, seed);
+}
+
+bool CWallet::LoadCryptedLegacyHDSeed(const uint256& seedFp, const std::vector<unsigned char>& seed)
+{
+    return CCryptoKeyStore::SetCryptedLegacyHDSeed(seedFp, seed);
+}
+
+void CWalletTx::SetSproutNoteData(const mapSproutNoteData_t& noteData)
+{
+    mapSproutNoteData.clear();
+    for (const std::pair<JSOutPoint, SproutNoteData> nd : noteData) {
+        if (nd.first.js < vJoinSplit.size() &&
+                nd.first.n < vJoinSplit[nd.first.js].ciphertexts.size()) {
+            // Store the address and nullifier for the Note
+            mapSproutNoteData[nd.first] = nd.second;
+        } else {
+            // If FindMySproutNotes() was used to obtain noteData,
+            // this should never happen
+            throw std::logic_error("CWalletTx::SetSproutNoteData(): Invalid note");
+        }
+    }
+}
+
+void CWalletTx::SetSaplingNoteData(const mapSaplingNoteData_t& noteData)
+{
+    mapSaplingNoteData.clear();
+    for (const std::pair<SaplingOutPoint, SaplingNoteData> nd : noteData) {
+        if (nd.first.n < vShieldedOutput.size()) {
+            mapSaplingNoteData[nd.first] = nd.second;
+        } else {
+            throw std::logic_error("CWalletTx::SetSaplingNoteData(): Invalid note");
+        }
+    }
+}
+
+void CWalletTx::SetOrchardTxMeta(OrchardWalletTxMeta txMeta)
+{
+    auto numActions = GetOrchardBundle().GetNumActions();
+    for (const auto& [action_idx, ivk] : txMeta.GetMyActionIVKs()) {
+        if (action_idx >= numActions) {
+            throw std::logic_error("CWalletTx::SetOrchardTxMeta(): Invalid action index");
+        }
+    }
+    for (uint32_t action_idx : txMeta.GetActionsSpendingMyNotes()) {
+        if (action_idx >= numActions) {
+            throw std::logic_error("CWalletTx::SetOrchardTxMeta(): Invalid action index");
+        }
+    }
+    orchardTxMeta = txMeta;
+}
+
+std::pair<SproutNotePlaintext, SproutPaymentAddress> CWalletTx::DecryptSproutNote(
+    JSOutPoint jsop) const
+{
+    LOCK(pwallet->cs_wallet);
+
+    auto nd = this->mapSproutNoteData.at(jsop);
+    SproutPaymentAddress pa = nd.address;
+
+    KeyIO keyIO(Params());
+    // Get cached decryptor
+    ZCNoteDecryption decryptor;
+    if (!pwallet->GetNoteDecryptor(pa, decryptor)) {
+        // Note decryptors are created when the wallet is loaded, so it should always exist
+        throw std::runtime_error(strprintf(
+            "Could not find note decryptor for payment address %s",
+            keyIO.EncodePaymentAddress(pa)));
+    }
+
+    auto hSig = ZCJoinSplit::h_sig(
+        this->vJoinSplit[jsop.js].randomSeed,
+        this->vJoinSplit[jsop.js].nullifiers,
+        this->joinSplitPubKey);
+    try {
+        SproutNotePlaintext plaintext = SproutNotePlaintext::decrypt(
+                decryptor,
+                this->vJoinSplit[jsop.js].ciphertexts[jsop.n],
+                this->vJoinSplit[jsop.js].ephemeralKey,
+                hSig,
+                (unsigned char) jsop.n);
+
+        return std::make_pair(plaintext, pa);
+    } catch (const note_decryption_failed &err) {
+        // Couldn't decrypt with this spending key
+        throw std::runtime_error(strprintf(
+            "Could not decrypt note for payment address %s",
+            keyIO.EncodePaymentAddress(pa)));
+    } catch (const std::exception &exc) {
+        // Unexpected failure
+        throw std::runtime_error(strprintf(
+            "Error while decrypting note for payment address %s: %s",
+            keyIO.EncodePaymentAddress(pa), exc.what()));
+    }
+}
+
+std::optional<std::pair<
+    SaplingNotePlaintext,
+    SaplingPaymentAddress>> CWalletTx::DecryptSaplingNote(const Consensus::Params& params, int height, SaplingOutPoint op) const
+{
+    // Check whether we can decrypt this SaplingOutPoint
+    if (this->mapSaplingNoteData.count(op) == 0) {
+        return std::nullopt;
+    }
+
+    auto output = this->vShieldedOutput[op.n];
+    auto nd = this->mapSaplingNoteData.at(op);
+
+    auto maybe_pt = SaplingNotePlaintext::decrypt(
+        params,
+        height,
+        output.encCiphertext,
+        nd.ivk,
+        output.ephemeralKey,
+        output.cmu);
+    assert(maybe_pt != std::nullopt);
+    auto notePt = maybe_pt.value();
+
+    auto maybe_pa = nd.ivk.address(notePt.d);
+    assert(maybe_pa != std::nullopt);
+    auto pa = maybe_pa.value();
+
+    return std::make_pair(notePt, pa);
+}
+
+std::optional<std::pair<
+    SaplingNotePlaintext,
+    SaplingPaymentAddress>> CWalletTx::DecryptSaplingNoteWithoutLeadByteCheck(SaplingOutPoint op) const
+{
+    // Check whether we can decrypt this SaplingOutPoint
+    if (this->mapSaplingNoteData.count(op) == 0) {
+        return std::nullopt;
+    }
+
+    auto output = this->vShieldedOutput[op.n];
+    auto nd = this->mapSaplingNoteData.at(op);
+
+    auto optDeserialized = SaplingNotePlaintext::attempt_sapling_enc_decryption_deserialization(output.encCiphertext, nd.ivk, output.ephemeralKey);
+
+    // The transaction would not have entered the wallet unless
+    // its plaintext had been successfully decrypted previously.
+    assert(optDeserialized != std::nullopt);
+
+    auto maybe_pt = SaplingNotePlaintext::plaintext_checks_without_height(
+        *optDeserialized,
+        nd.ivk,
+        output.ephemeralKey,
+        output.cmu);
+    assert(maybe_pt != std::nullopt);
+    auto notePt = maybe_pt.value();
+
+    auto maybe_pa = nd.ivk.address(notePt.d);
+    assert(static_cast<bool>(maybe_pa));
+    auto pa = maybe_pa.value();
+
+    return std::make_pair(notePt, pa);
+}
+
+std::optional<std::pair<
+    SaplingNotePlaintext,
+    SaplingPaymentAddress>> CWalletTx::RecoverSaplingNote(const Consensus::Params& params, int height, SaplingOutPoint op, std::set<uint256>& ovks) const
+{
+    auto output = this->vShieldedOutput[op.n];
+
+    for (auto ovk : ovks) {
+        auto outPt = SaplingOutgoingPlaintext::decrypt(
+            output.outCiphertext,
+            ovk,
+            output.cv,
+            output.cmu,
+            output.ephemeralKey);
+        if (!outPt) {
+            // Try decrypting with the next ovk
+            continue;
+        }
+
+        auto maybe_pt = SaplingNotePlaintext::decrypt(
+            params,
+            height,
+            output.encCiphertext,
+            output.ephemeralKey,
+            outPt->esk,
+            outPt->pk_d,
+            output.cmu);
+        assert(static_cast<bool>(maybe_pt));
+        auto notePt = maybe_pt.value();
+
+        return std::make_pair(notePt, SaplingPaymentAddress(notePt.d, outPt->pk_d));
+    }
+
+    // Couldn't recover with any of the provided OutgoingViewingKeys
+    return std::nullopt;
+}
+
+std::optional<std::pair<
+    SaplingNotePlaintext,
+    SaplingPaymentAddress>> CWalletTx::RecoverSaplingNoteWithoutLeadByteCheck(SaplingOutPoint op, std::set<uint256>& ovks) const
+{
+    auto output = this->vShieldedOutput[op.n];
+    // ZIP 216: This wallet method is not called from consensus rules.
+    bool zip216Enabled = true;
+
+    for (auto ovk : ovks) {
+        auto outPt = SaplingOutgoingPlaintext::decrypt(
+            output.outCiphertext,
+            ovk,
+            output.cv,
+            output.cmu,
+            output.ephemeralKey);
+        if (!outPt) {
+            // Try decrypting with the next ovk
+            continue;
+        }
+
+        auto optDeserialized = SaplingNotePlaintext::attempt_sapling_enc_decryption_deserialization(
+            zip216Enabled, output.encCiphertext, output.ephemeralKey, outPt->esk, outPt->pk_d);
+
+        // The transaction would not have entered the wallet unless
+        // its plaintext had been successfully decrypted previously.
+        assert(optDeserialized != std::nullopt);
+
+        auto maybe_pt = SaplingNotePlaintext::plaintext_checks_without_height(
+            zip216Enabled,
+            *optDeserialized,
+            output.ephemeralKey,
+            outPt->esk,
+            outPt->pk_d,
+            output.cmu);
+        assert(static_cast<bool>(maybe_pt));
+        auto notePt = maybe_pt.value();
+
+        return std::make_pair(notePt, SaplingPaymentAddress(notePt.d, outPt->pk_d));
+    }
+
+    // Couldn't recover with any of the provided OutgoingViewingKeys
+    return std::nullopt;
+}
+
+OrchardActions CWalletTx::RecoverOrchardActions(const std::vector<uint256>& ovks) const
+{
+    return pwallet->orchardWallet.GetTxActions(*this, ovks);
+}
+
+
+int64_t CWalletTx::GetTxTime() const
+{
+    int64_t n = nTimeSmart;
+    return n ? n : nTimeReceived;
+}
+
+int CWalletTx::GetRequestCount() const
+{
+    // Returns -1 if it wasn't being tracked
+    int nRequests = -1;
+    {
+        LOCK(pwallet->cs_wallet);
+        if (IsCoinBase())
+        {
+            // Generated block
+            if (!hashBlock.IsNull())
+            {
+                map<uint256, int>::const_iterator mi = pwallet->mapRequestCount.find(hashBlock);
+                if (mi != pwallet->mapRequestCount.end())
+                    nRequests = (*mi).second;
+            }
+        }
+        else
+        {
+            // Did anyone request this transaction?
+            map<uint256, int>::const_iterator mi = pwallet->mapRequestCount.find(GetHash());
+            if (mi != pwallet->mapRequestCount.end())
+            {
+                nRequests = (*mi).second;
+
+                // How about the block it's in?
+                if (nRequests == 0 && !hashBlock.IsNull())
+                {
+                    map<uint256, int>::const_iterator _mi = pwallet->mapRequestCount.find(hashBlock);
+                    if (_mi != pwallet->mapRequestCount.end())
+                        nRequests = (*_mi).second;
+                    else
+                        nRequests = 1; // If it's in someone else's block it must have got out
+                }
+            }
+        }
+    }
+    return nRequests;
+}
+
+// GetAmounts will determine the transparent debits and credits for a given wallet tx.
+void CWalletTx::GetAmounts(std::list<COutputEntry>& listReceived,
+                           std::list<COutputEntry>& listSent, CAmount& nFee, const isminefilter& filter) const
+{
+    nFee = 0;
+    listReceived.clear();
+    listSent.clear();
+
+    // Is this tx sent/signed by me?
+    CAmount nDebit = GetDebit(filter);
+    bool isFromMyTaddr = nDebit > 0; // debit>0 means we signed/sent this transaction
+
+    // Compute fee if we sent this transaction.
+    if (isFromMyTaddr) {
+        CAmount nValueOut = GetValueOut();  // transparent outputs plus all Sprout vpub_old and negative Sapling valueBalance
+        CAmount nValueIn = GetShieldedValueIn();
+        nFee = nDebit - nValueOut + nValueIn;
+    }
+
+    // Create output entry for vpub_old/new, if we sent utxos from this transaction
+    if (isFromMyTaddr) {
+        CAmount myVpubOld = 0;
+        CAmount myVpubNew = 0;
+        for (const JSDescription& js : vJoinSplit) {
+            bool fMyJSDesc = false;
+
+            // Check input side
+            for (const uint256& nullifier : js.nullifiers) {
+                if (pwallet->IsSproutNullifierFromMe(nullifier)) {
+                    fMyJSDesc = true;
+                    break;
+                }
+            }
+
+            // Check output side
+            if (!fMyJSDesc) {
+                for (const std::pair<JSOutPoint, SproutNoteData> nd : this->mapSproutNoteData) {
+                    if (nd.first.js < vJoinSplit.size() && nd.first.n < vJoinSplit[nd.first.js].ciphertexts.size()) {
+                        fMyJSDesc = true;
+                        break;
+                    }
+                }
+            }
+
+            if (fMyJSDesc) {
+                myVpubOld += js.vpub_old;
+                myVpubNew += js.vpub_new;
+            }
+
+            if (!MoneyRange(js.vpub_old) || !MoneyRange(js.vpub_new) || !MoneyRange(myVpubOld) || !MoneyRange(myVpubNew)) {
+                 throw std::runtime_error("CWalletTx::GetAmounts: value out of range");
+            }
+        }
+
+        // Create an output for the value taken from or added to the transparent value pool by JoinSplits
+        if (myVpubOld > myVpubNew) {
+            COutputEntry output = {CNoDestination(), myVpubOld - myVpubNew, (int)vout.size()};
+            listSent.push_back(output);
+        } else if (myVpubNew > myVpubOld) {
+            COutputEntry output = {CNoDestination(), myVpubNew - myVpubOld, (int)vout.size()};
+            listReceived.push_back(output);
+        }
+    }
+
+    // If we sent utxos from this transaction, create output for value taken from (negative valueBalanceSapling)
+    // or added (positive valueBalanceSapling) to the transparent value pool by Sapling shielding and unshielding.
+    if (isFromMyTaddr) {
+        if (GetValueBalanceSapling() < 0) {
+            COutputEntry output = {CNoDestination(), -GetValueBalanceSapling(), (int) vout.size()};
+            listSent.push_back(output);
+        } else if (GetValueBalanceSapling() > 0) {
+            COutputEntry output = {CNoDestination(), GetValueBalanceSapling(), (int) vout.size()};
+            listReceived.push_back(output);
+        }
+    }
+
+    // Sent/received.
+    for (unsigned int i = 0; i < vout.size(); ++i)
+    {
+        const CTxOut& txout = vout[i];
+        isminetype fIsMine = pwallet->IsMine(txout);
+        // Only need to handle txouts if AT LEAST one of these is true:
+        //   1) they debit from us (sent)
+        //   2) the output is to us (received)
+        if (nDebit > 0)
+        {
+            // Don't report 'change' txouts
+            if (pwallet->IsChange(txout))
+                continue;
+        }
+        else if (!(fIsMine & filter))
+            continue;
+
+        // In either case, we need to get the destination address
+        CTxDestination address;
+        if (!ExtractDestination(txout.scriptPubKey, address))
+        {
+            LogPrintf("CWalletTx::GetAmounts: Unknown transaction type found, txid %s\n",
+                     this->GetHash().ToString());
+            address = CNoDestination();
+        }
+
+        COutputEntry output = {address, txout.nValue, (int)i};
+
+        // If we are debited by the transaction, add the output as a "sent" entry
+        if (nDebit > 0)
+            listSent.push_back(output);
+
+        // If we are receiving the output, add it as a "received" entry
+        if (fIsMine & filter)
+            listReceived.push_back(output);
+    }
+
+}
+
+void CWallet::WitnessNoteCommitment(std::vector<uint256> commitments,
+                                    std::vector<std::optional<SproutWitness>>& witnesses,
+                                    uint256 &final_anchor)
+{
+    witnesses.resize(commitments.size());
+    SproutMerkleTree tree;
+    AssertLockHeld(cs_main);
+    CBlockIndex* pindex = chainActive.Genesis();
+
+    while (pindex) {
+        CBlock block;
+        ReadBlockFromDisk(block, pindex, Params().GetConsensus());
+
+        for (const CTransaction& tx : block.vtx)
+        {
+            for (const JSDescription& jsdesc : tx.vJoinSplit)
+            {
+                for (const uint256 &note_commitment : jsdesc.commitments)
+                {
+                    tree.append(note_commitment);
+
+                    for (std::optional<SproutWitness>& wit : witnesses) {
+                        if (wit) {
+                            wit->append(note_commitment);
+                        }
+                    }
+
+                    size_t i = 0;
+                    for (uint256& commitment : commitments) {
+                        if (note_commitment == commitment) {
+                            witnesses.at(i) = tree.witness();
+                        }
+                        i++;
+                    }
+                }
+            }
+        }
+
+        uint256 current_anchor = tree.root();
+
+        // Consistency check: we should be able to find the current tree
+        // in our CCoins view.
+        SproutMerkleTree dummy_tree;
+        assert(pcoinsTip->GetSproutAnchorAt(current_anchor, dummy_tree));
+
+        pindex = chainActive.Next(pindex);
+    }
+
+    // TODO: #93; Select a root via some heuristic.
+    final_anchor = tree.root();
+
+    for (std::optional<SproutWitness>& wit : witnesses) {
+        if (wit) {
+            assert(final_anchor == wit->root());
+        }
+    }
+}
+
+/**
+ * Scan the block chain (starting in pindexStart) for transactions
+ * from or to us. If fUpdate is true, found transactions that already
+ * exist in the wallet will be updated.
+ */
+int CWallet::ScanForWalletTransactions(
+        CBlockIndex* pindexStart,
+        bool fUpdate,
+        bool isInitScan)
+{
+    assert(pindexStart != nullptr);
+    int ret = 0;
+    int64_t nNow = GetTime();
+    const CChainParams& chainParams = Params();
+    const auto& consensus = chainParams.GetConsensus();
+
+    CBlockIndex* pindex = pindexStart;
+
+    std::vector<uint256> myTxHashes;
+
+    {
+        LOCK2(cs_main, cs_wallet);
+
+        // no need to read and scan block, if block was created before
+        // our wallet birthday (as adjusted for block time variability)
+        while (chainActive.Next(pindex) != NULL && nTimeFirstKey && pindex->GetBlockTime() < nTimeFirstKey - TIMESTAMP_WINDOW) {
+            pindex = chainActive.Next(pindex);
+        }
+
+        // Attempt to rewind the orchard wallet to the rescan point if the wallet has any
+        // checkpoints. Note data will be restored by the calls to AddToWalletIfInvolvingMe,
+        // and then the call to `ChainTipAdded` that later occurs for each block will restore
+        // the witness data that is being removed in the rewind here.
+        auto nu5_height = chainParams.GetConsensus().GetActivationHeight(Consensus::UPGRADE_NU5);
+        bool performOrchardWalletUpdates{false};
+        if (orchardWallet.GetLastCheckpointHeight().has_value()) {
+            // We have a checkpoint, so attempt to rewind the Orchard wallet at most as
+            // far as the NU5 activation block.
+            // If there's no activation height, we shouldn't have a checkpoint already,
+            // and this is a programming error.
+            assert(nu5_height.has_value());
+            // Only attempt to perform scans for Orchard during wallet initialization,
+            // since we do not support Orchard key import.
+            if (isInitScan) {
+                int rewindHeight = std::max(nu5_height.value(), pindex->nHeight - 1);
+                LogPrintf(
+                        "CWallet::ScanForWalletTransactions(): Rewinding Orchard wallet to height %d; current is %d",
+                        rewindHeight,
+                        orchardWallet.GetLastCheckpointHeight().value());
+                uint32_t uResultHeight{0};
+                if (orchardWallet.Rewind(rewindHeight, uResultHeight)) {
+                    // rewind was successful or a no-op, so perform Orchard wallet updates
+                    assert(uResultHeight == rewindHeight);
+                    performOrchardWalletUpdates = true;
+                } else {
+                    // Orchard witnesses will not be able to be correctly updated, because we
+                    // can't rewind far enough. This is an unrecoverable failure; it means that we
+                    // can't get back to a valid wallet state without resetting the wallet all
+                    // the way back to NU5 activation.
+
+                    throw std::runtime_error("CWallet::ScanForWalletTransactions(): Orchard wallet is out of sync. Please restart your node with -rescan.");
+                }
+            }
+        } else if (isInitScan && pindexStart->nHeight < nu5_height) {
+            // If it's the initial scan and we're starting below the nu5 activation
+            // height, we're effectively rescanning from genesis and so it's safe
+            // to update the note commitment tree as we progress.
+            performOrchardWalletUpdates = true;
+        }
+
+        ShowProgress(_("Rescanning..."), 0); // show rescan progress in GUI as dialog or on splashscreen, if -rescan on startup
+        double dProgressStart = Checkpoints::GuessVerificationProgress(chainParams.Checkpoints(), pindex, false);
+        double dProgressTip = Checkpoints::GuessVerificationProgress(chainParams.Checkpoints(), chainActive.Tip(), false);
+        while (pindex)
+        {
+            if (pindex->nHeight % 100 == 0 && dProgressTip - dProgressStart > 0.0)
+                ShowProgress(_("Rescanning..."), std::max(1, std::min(99, (int)((Checkpoints::GuessVerificationProgress(chainParams.Checkpoints(), pindex, false) - dProgressStart) / (dProgressTip - dProgressStart) * 100))));
+
+            CBlock block;
+            ReadBlockFromDisk(block, pindex, consensus);
+            for (CTransaction& tx : block.vtx)
+            {
+                if (AddToWalletIfInvolvingMe(consensus, tx, &block, pindex->nHeight, fUpdate)) {
+                    myTxHashes.push_back(tx.GetHash());
+                    ret++;
+                }
+            }
+
+            MerkleFrontiers frontiers;
+            // This should never fail: we should always be able to get the tree
+            // state on the path to the tip of our chain
+            assert(pcoinsTip->GetSproutAnchorAt(pindex->hashSproutAnchor, frontiers.sprout));
+            if (pindex->pprev) {
+                if (consensus.NetworkUpgradeActive(pindex->pprev->nHeight,  Consensus::UPGRADE_SAPLING)) {
+                    assert(pcoinsTip->GetSaplingAnchorAt(pindex->pprev->hashFinalSaplingRoot, frontiers.sapling));
+                }
+                if (consensus.NetworkUpgradeActive(pindex->pprev->nHeight,  Consensus::UPGRADE_NU5)) {
+                    assert(pcoinsTip->GetOrchardAnchorAt(pindex->pprev->hashFinalOrchardRoot, frontiers.orchard));
+                }
+            }
+            // Increment note witness caches
+            ChainTipAdded(pindex, &block, frontiers, performOrchardWalletUpdates);
+
+            pindex = chainActive.Next(pindex);
+            if (GetTime() >= nNow + 60) {
+                nNow = GetTime();
+                LogPrintf(
+                        "Still rescanning. At block %d. Progress=%f\n",
+                        pindex->nHeight,
+                        Checkpoints::GuessVerificationProgress(chainParams.Checkpoints(), pindex));
+            }
+        }
+
+        // After rescanning, persist Sapling & Orchard note data that might have changed,
+        // e.g. nullifiers. Do not flush the wallet here for performance reasons.
+        CWalletDB walletdb(strWalletFile, "r+", false);
+        for (auto hash : myTxHashes) {
+            CWalletTx wtx = mapWallet[hash];
+            if (!wtx.mapSaplingNoteData.empty() || !wtx.orchardTxMeta.empty()) {
+                if (!walletdb.WriteTx(wtx)) {
+                    LogPrintf(
+                            "Rescanning... WriteToDisk failed to update Sapling/Orchard note data for tx: %s\n",
+                            hash.ToString());
+                }
+            }
+        }
+
+        ShowProgress(_("Rescanning..."), 100); // hide progress dialog in GUI
+    }
+    return ret;
+}
+
+void CWallet::ReacceptWalletTransactions()
+{
+    // If transactions aren't being broadcasted, don't let them into local mempool either
+    if (!fBroadcastTransactions)
+        return;
+    LOCK2(cs_main, cs_wallet);
+    std::map<int64_t, CWalletTx*> mapSorted;
+
+    // Sort pending wallet transactions based on their initial wallet insertion order
+    for (std::pair<const uint256, CWalletTx>& item : mapWallet)
+    {
+        const uint256& wtxid = item.first;
+        CWalletTx& wtx = item.second;
+        assert(wtx.GetHash() == wtxid);
+
+        int nDepth = wtx.GetDepthInMainChain();
+
+        if (!wtx.IsCoinBase() && nDepth < 0) {
+            mapSorted.insert(std::make_pair(wtx.nOrderPos, &wtx));
+        }
+    }
+
+    // Try to add wallet transactions to memory pool
+    for (std::pair<const int64_t, CWalletTx*>& item : mapSorted) {
+        CWalletTx& wtx = *(item.second);
+        wtx.AcceptToMemoryPool(false);
+    }
+}
+
+bool CWalletTx::RelayWalletTransaction()
+{
+    assert(pwallet->GetBroadcastTransactions());
+    if (!IsCoinBase())
+    {
+        if (GetDepthInMainChain() == 0) {
+            LogPrintf("Relaying wtx %s\n", GetHash().ToString());
+            RelayTransaction((CTransaction)*this);
+            return true;
+        }
+    }
+    return false;
+}
+
+set<uint256> CWalletTx::GetConflicts() const
+{
+    set<uint256> result;
+    if (pwallet != NULL)
+    {
+        uint256 myHash = GetHash();
+        result = pwallet->GetConflicts(myHash);
+        result.erase(myHash);
+    }
+    return result;
+}
+
+CAmount CWalletTx::GetDebit(const isminefilter& filter) const
+{
+    if (vin.empty())
+        return 0;
+
+    CAmount debit = 0;
+    if(filter & ISMINE_SPENDABLE)
+    {
+        if (fDebitCached)
+            debit += nDebitCached;
+        else
+        {
+            nDebitCached = pwallet->GetDebit(*this, ISMINE_SPENDABLE);
+            fDebitCached = true;
+            debit += nDebitCached;
+        }
+    }
+    if(filter & ISMINE_WATCH_ONLY)
+    {
+        if(fWatchDebitCached)
+            debit += nWatchDebitCached;
+        else
+        {
+            nWatchDebitCached = pwallet->GetDebit(*this, ISMINE_WATCH_ONLY);
+            fWatchDebitCached = true;
+            debit += nWatchDebitCached;
+        }
+    }
+    return debit;
+}
+
+CAmount CWalletTx::GetCredit(const isminefilter& filter) const
+{
+    // Must wait until coinbase is safely deep enough in the chain before valuing it
+    if (IsCoinBase() && GetBlocksToMaturity() > 0)
+        return 0;
+
+    int64_t credit = 0;
+    if (filter & ISMINE_SPENDABLE)
+    {
+        // GetBalance can assume transactions in mapWallet won't change
+        if (fCreditCached)
+            credit += nCreditCached;
+        else
+        {
+            nCreditCached = pwallet->GetCredit(*this, ISMINE_SPENDABLE);
+            fCreditCached = true;
+            credit += nCreditCached;
+        }
+    }
+    if (filter & ISMINE_WATCH_ONLY)
+    {
+        if (fWatchCreditCached)
+            credit += nWatchCreditCached;
+        else
+        {
+            nWatchCreditCached = pwallet->GetCredit(*this, ISMINE_WATCH_ONLY);
+            fWatchCreditCached = true;
+            credit += nWatchCreditCached;
+        }
+    }
+    return credit;
+}
+
+CAmount CWalletTx::GetImmatureCredit(bool fUseCache) const
+{
+    if (IsCoinBase() && GetBlocksToMaturity() > 0 && IsInMainChain())
+    {
+        if (fUseCache && fImmatureCreditCached)
+            return nImmatureCreditCached;
+        nImmatureCreditCached = pwallet->GetCredit(*this, ISMINE_SPENDABLE);
+        fImmatureCreditCached = true;
+        return nImmatureCreditCached;
+    }
+
+    return 0;
+}
+
+CAmount CWalletTx::GetAvailableCredit(bool fUseCache, const isminefilter& filter) const
+{
+    if (pwallet == nullptr)
+        return 0;
+
+    // Must wait until coinbase is safely deep enough in the chain before valuing it
+    if (IsCoinBase() && GetBlocksToMaturity() > 0)
+        return 0;
+
+    CAmount* cache = nullptr;
+    bool* cache_used = nullptr;
+
+    if (filter == ISMINE_SPENDABLE) {
+        cache = &nAvailableCreditCached;
+        cache_used = &fAvailableCreditCached;
+    } else if (filter == ISMINE_WATCH_ONLY) {
+        cache = &nAvailableWatchCreditCached;
+        cache_used = &fAvailableWatchCreditCached;
+    }
+
+    if (fUseCache && cache_used && *cache_used) {
+        return *cache;
+    }
+
+    CAmount nCredit = 0;
+    uint256 hashTx = GetHash();
+    for (unsigned int i = 0; i < vout.size(); i++)
+    {
+        if (!pwallet->IsSpent(hashTx, i))
+        {
+            const CTxOut &txout = vout[i];
+            nCredit += pwallet->GetCredit(txout, filter);
+            if (!MoneyRange(nCredit))
+                throw std::runtime_error("CWalletTx::GetAvailableCredit() : value out of range");
+        }
+    }
+
+    if (cache) {
+        *cache = nCredit;
+        *cache_used = true;
+    }
+    return nCredit;
+}
+
+CAmount CWalletTx::GetImmatureWatchOnlyCredit(const bool fUseCache) const
+{
+    if (IsCoinBase() && GetBlocksToMaturity() > 0 && IsInMainChain())
+    {
+        if (fUseCache && fImmatureWatchCreditCached)
+            return nImmatureWatchCreditCached;
+        nImmatureWatchCreditCached = pwallet->GetCredit(*this, ISMINE_WATCH_ONLY);
+        fImmatureWatchCreditCached = true;
+        return nImmatureWatchCreditCached;
+    }
+
+    return 0;
+}
+
+CAmount CWalletTx::GetChange() const
+{
+    if (fChangeCached)
+        return nChangeCached;
+    nChangeCached = pwallet->GetChange(*this);
+    fChangeCached = true;
+    return nChangeCached;
+}
+
+bool CWalletTx::IsFromMe(const isminefilter& filter) const
+{
+    if (GetDebit(filter) > 0) {
+        return true;
+    }
+    for (const JSDescription& jsdesc : vJoinSplit) {
+        for (const uint256& nullifier : jsdesc.nullifiers) {
+            if (pwallet->IsSproutNullifierFromMe(nullifier)) {
+                return true;
+            }
+        }
+    }
+    for (const SpendDescription &spend : vShieldedSpend) {
+        if (pwallet->IsSaplingNullifierFromMe(spend.nullifier)) {
+            return true;
+        }
+    }
+    return false;
+}
+
+bool CWalletTx::IsTrusted() const
+{
+    // Quick answer in most cases
+    if (!CheckFinalTx(*this))
+        return false;
+    int nDepth = GetDepthInMainChain();
+    if (nDepth >= 1)
+        return true;
+    if (nDepth < 0)
+        return false;
+    if (!bSpendZeroConfChange || !IsFromMe(ISMINE_ALL)) // using wtx's cached debit
+        return false;
+
+    // Trusted if all inputs are from us and are in the mempool:
+    for (const CTxIn& txin : vin)
+    {
+        // Transactions not sent by us: not trusted
+        const CWalletTx* parent = pwallet->GetWalletTx(txin.prevout.hash);
+        if (parent == NULL)
+            return false;
+        const CTxOut& parentOut = parent->vout[txin.prevout.n];
+        if (pwallet->IsMine(parentOut) != ISMINE_SPENDABLE)
+            return false;
+    }
+    return true;
+}
+
+std::vector<uint256> CWallet::ResendWalletTransactionsBefore(int64_t nTime)
+{
+    std::vector<uint256> result;
+
+    LOCK(cs_wallet);
+    // Sort them in chronological order
+    multimap<unsigned int, CWalletTx*> mapSorted;
+    for (std::pair<const uint256, CWalletTx>& item : mapWallet)
+    {
+        CWalletTx& wtx = item.second;
+        // Don't rebroadcast if newer than nTime:
+        if (wtx.nTimeReceived > nTime)
+            continue;
+        mapSorted.insert(make_pair(wtx.nTimeReceived, &wtx));
+    }
+    for (std::pair<const unsigned int, CWalletTx*>& item : mapSorted)
+    {
+        CWalletTx& wtx = *item.second;
+        if (wtx.RelayWalletTransaction())
+            result.push_back(wtx.GetHash());
+    }
+    return result;
+}
+
+void CWallet::ResendWalletTransactions(int64_t nBestBlockTime)
+{
+    // Do this infrequently and randomly to avoid giving away
+    // that these are our transactions.
+    if (GetTime() < nNextResend || !fBroadcastTransactions)
+        return;
+    bool fFirst = (nNextResend == 0);
+    nNextResend = GetTime() + GetRand(30 * 60);
+    if (fFirst)
+        return;
+
+    // Only do it if there's been a new block since last time
+    if (nBestBlockTime < nLastResend)
+        return;
+    nLastResend = GetTime();
+
+    // Rebroadcast unconfirmed txes older than 5 minutes before the last
+    // block was found:
+    std::vector<uint256> relayed = ResendWalletTransactionsBefore(nBestBlockTime-5*60);
+    if (!relayed.empty())
+        LogPrintf("%s: rebroadcast %u unconfirmed transactions\n", __func__, relayed.size());
+}
+
+/** @} */ // end of mapWallet
+
+
+
+
+/** @defgroup Actions
+ *
+ * @{
+ */
+
+
+CAmount CWallet::GetBalance(const isminefilter& filter, const int min_depth) const
+{
+    CAmount nTotal = 0;
+    {
+        LOCK2(cs_main, cs_wallet);
+        for (const auto& entry : mapWallet)
+        {
+            const CWalletTx* pcoin = &entry.second;
+            if (pcoin->IsTrusted() && pcoin->GetDepthInMainChain() >= min_depth) {
+                nTotal += pcoin->GetAvailableCredit(true, filter);
+            }
+        }
+    }
+
+    return nTotal;
+}
+
+CAmount CWallet::GetUnconfirmedBalance() const
+{
+    CAmount nTotal = 0;
+    {
+        LOCK2(cs_main, cs_wallet);
+        for (const auto& entry : mapWallet)
+        {
+            const CWalletTx* pcoin = &entry.second;
+            if (!CheckFinalTx(*pcoin) || (!pcoin->IsTrusted() && pcoin->GetDepthInMainChain() == 0))
+                nTotal += pcoin->GetAvailableCredit();
+        }
+    }
+    return nTotal;
+}
+
+CAmount CWallet::GetImmatureBalance() const
+{
+    CAmount nTotal = 0;
+    {
+        LOCK2(cs_main, cs_wallet);
+        for (const auto& entry : mapWallet)
+        {
+            const CWalletTx* pcoin = &entry.second;
+            nTotal += pcoin->GetImmatureCredit();
+        }
+    }
+    return nTotal;
+}
+
+CAmount CWallet::GetUnconfirmedWatchOnlyBalance() const
+{
+    CAmount nTotal = 0;
+    {
+        LOCK2(cs_main, cs_wallet);
+        for (const auto& entry : mapWallet)
+        {
+            const CWalletTx* pcoin = &entry.second;
+            if (!CheckFinalTx(*pcoin) || (!pcoin->IsTrusted() && pcoin->GetDepthInMainChain() == 0))
+                nTotal += pcoin->GetAvailableCredit(true, ISMINE_WATCH_ONLY);
+        }
+    }
+    return nTotal;
+}
+
+CAmount CWallet::GetImmatureWatchOnlyBalance() const
+{
+    CAmount nTotal = 0;
+    {
+        LOCK2(cs_main, cs_wallet);
+        for (const auto& entry : mapWallet)
+        {
+            const CWalletTx* pcoin = &entry.second;
+            nTotal += pcoin->GetImmatureWatchOnlyCredit();
+        }
+    }
+    return nTotal;
+}
+
+// Calculate total balance in a different way from GetBalance. The biggest
+// difference is that GetBalance sums up all unspent TxOuts paying to the
+// wallet, while this sums up both spent and unspent TxOuts paying to the
+// wallet, and then subtracts the values of TxIns spending from the wallet. This
+// also has fewer restrictions on which unconfirmed transactions are considered
+// trusted.
+CAmount CWallet::GetLegacyBalance(const isminefilter& filter, int minDepth) const
+{
+    LOCK2(cs_main, cs_wallet);
+
+    CAmount balance = 0;
+    for (const auto& entry : mapWallet) {
+        const CWalletTx& wtx = entry.second;
+        const int depth = wtx.GetDepthInMainChain();
+        if (depth < 0 || !CheckFinalTx(wtx) || wtx.GetBlocksToMaturity() > 0) {
+            continue;
+        }
+
+        // Loop through tx outputs and add incoming payments. For outgoing txs,
+        // treat change outputs specially, as part of the amount debited.
+        CAmount debit = wtx.GetDebit(filter);
+        const bool outgoing = debit > 0;
+        for (const CTxOut& out : wtx.vout) {
+            if (outgoing && IsChange(out)) {
+                debit -= out.nValue;
+            } else if (IsMine(out) & filter && depth >= minDepth) {
+                balance += out.nValue;
+            }
+        }
+
+        // For outgoing txs, subtract amount debited.
+        if (outgoing) {
+            balance -= debit;
+        }
+    }
+
+    return balance;
+}
+
+void CWallet::AvailableCoins(vector<COutput>& vCoins,
+                             bool fOnlyConfirmed,
+                             const CCoinControl *coinControl,
+                             bool fIncludeZeroValue,
+                             bool fIncludeCoinBase,
+                             bool fOnlySpendable,
+                             int nMinDepth,
+                             std::set<CTxDestination>* onlyFilterByDests) const
+{
+    assert(nMinDepth >= 0);
+    AssertLockHeld(cs_main);
+    AssertLockHeld(cs_wallet);
+
+    vCoins.clear();
+
+    {
+        for (map<uint256, CWalletTx>::const_iterator it = mapWallet.begin(); it != mapWallet.end(); ++it)
+        {
+            const uint256& wtxid = it->first;
+            const CWalletTx* pcoin = &(*it).second;
+
+            if (!CheckFinalTx(*pcoin))
+                continue;
+
+            if (fOnlyConfirmed && !pcoin->IsTrusted())
+                continue;
+
+            if (pcoin->IsCoinBase() && !fIncludeCoinBase)
+                continue;
+
+            bool isCoinbase = pcoin->IsCoinBase();
+            if (isCoinbase && pcoin->GetBlocksToMaturity() > 0)
+                continue;
+
+            int nDepth = pcoin->GetDepthInMainChain();
+            if (nDepth < nMinDepth)
+                continue;
+
+            for (unsigned int i = 0; i < pcoin->vout.size(); i++) {
+                const auto& output = pcoin->vout[i];
+                isminetype mine = IsMine(output);
+
+                bool isSpendable = ((mine & ISMINE_SPENDABLE) != ISMINE_NO) ||
+                                    (coinControl && coinControl->fAllowWatchOnly && (mine & ISMINE_WATCH_SOLVABLE) != ISMINE_NO);
+
+                if (fOnlySpendable && !isSpendable)
+                    continue;
+
+                // Filter by specific destinations if needed
+                if (onlyFilterByDests && !onlyFilterByDests->empty()) {
+                    CTxDestination address;
+                    if (!ExtractDestination(output.scriptPubKey, address) || onlyFilterByDests->count(address) == 0) {
+                        continue;
+                    }
+                }
+
+                if (!(IsSpent(wtxid, i)) && mine != ISMINE_NO &&
+                    !IsLockedCoin((*it).first, i) && (pcoin->vout[i].nValue > 0 || fIncludeZeroValue) &&
+                    (!coinControl || !coinControl->HasSelected() || coinControl->fAllowOtherInputs || coinControl->IsSelected((*it).first, i)))
+                        vCoins.push_back(COutput(pcoin, i, nDepth, isSpendable, isCoinbase));
+            }
+        }
+    }
+}
+
+static void ApproximateBestSubset(vector<pair<CAmount, pair<const CWalletTx*,unsigned int> > >vValue, const CAmount& nTotalLower, const CAmount& nTargetValue,
+                                  vector<char>& vfBest, CAmount& nBest, int iterations = 1000)
+{
+    vector<char> vfIncluded;
+
+    vfBest.assign(vValue.size(), true);
+    nBest = nTotalLower;
+
+    FastRandomContext insecure_rand;
+
+    for (int nRep = 0; nRep < iterations && nBest != nTargetValue; nRep++)
+    {
+        vfIncluded.assign(vValue.size(), false);
+        CAmount nTotal = 0;
+        bool fReachedTarget = false;
+        for (int nPass = 0; nPass < 2 && !fReachedTarget; nPass++)
+        {
+            for (unsigned int i = 0; i < vValue.size(); i++)
+            {
+                //The solver here uses a randomized algorithm,
+                //the randomness serves no real security purpose but is just
+                //needed to prevent degenerate behavior and it is important
+                //that the rng is fast. We do not use a constant random sequence,
+                //because there may be some privacy improvement by making
+                //the selection random.
+                if (nPass == 0 ? insecure_rand.randbool() : !vfIncluded[i])
+                {
+                    nTotal += vValue[i].first;
+                    vfIncluded[i] = true;
+                    if (nTotal >= nTargetValue)
+                    {
+                        fReachedTarget = true;
+                        if (nTotal < nBest)
+                        {
+                            nBest = nTotal;
+                            vfBest = vfIncluded;
+                        }
+                        nTotal -= vValue[i].first;
+                        vfIncluded[i] = false;
+                    }
+                }
+            }
+        }
+    }
+}
+
+bool CWallet::SelectCoinsMinConf(const CAmount& nTargetValue, int nConfMine, int nConfTheirs, vector<COutput> vCoins,
+                                 set<pair<const CWalletTx*,unsigned int> >& setCoinsRet, CAmount& nValueRet)
+{
+    setCoinsRet.clear();
+    nValueRet = 0;
+
+    // List of values less than target
+    pair<CAmount, pair<const CWalletTx*,unsigned int> > coinLowestLarger;
+    coinLowestLarger.first = std::numeric_limits<CAmount>::max();
+    coinLowestLarger.second.first = NULL;
+    vector<pair<CAmount, pair<const CWalletTx*,unsigned int> > > vValue;
+    CAmount nTotalLower = 0;
+
+    std::shuffle(vCoins.begin(), vCoins.end(), ZcashRandomEngine());
+
+    for (const COutput &output : vCoins)
+    {
+        if (!output.fSpendable)
+            continue;
+
+        const CWalletTx *pcoin = output.tx;
+
+        if (output.nDepth < (pcoin->IsFromMe(ISMINE_ALL) ? nConfMine : nConfTheirs))
+            continue;
+
+        int i = output.i;
+        CAmount n = pcoin->vout[i].nValue;
+
+        pair<CAmount,pair<const CWalletTx*,unsigned int> > coin = make_pair(n,make_pair(pcoin, i));
+
+        if (n == nTargetValue)
+        {
+            setCoinsRet.insert(coin.second);
+            nValueRet += coin.first;
+            return true;
+        }
+        else if (n < nTargetValue + MIN_CHANGE)
+        {
+            vValue.push_back(coin);
+            nTotalLower += n;
+        }
+        else if (n < coinLowestLarger.first)
+        {
+            coinLowestLarger = coin;
+        }
+    }
+
+    if (nTotalLower == nTargetValue)
+    {
+        for (unsigned int i = 0; i < vValue.size(); ++i)
+        {
+            setCoinsRet.insert(vValue[i].second);
+            nValueRet += vValue[i].first;
+        }
+        return true;
+    }
+
+    if (nTotalLower < nTargetValue)
+    {
+        if (coinLowestLarger.second.first == NULL)
+            return false;
+        setCoinsRet.insert(coinLowestLarger.second);
+        nValueRet += coinLowestLarger.first;
+        return true;
+    }
+
+    // Solve subset sum by stochastic approximation
+    sort(vValue.rbegin(), vValue.rend(), CompareValueOnly());
+    vector<char> vfBest;
+    CAmount nBest;
+
+    ApproximateBestSubset(vValue, nTotalLower, nTargetValue, vfBest, nBest);
+    if (nBest != nTargetValue && nTotalLower >= nTargetValue + MIN_CHANGE)
+        ApproximateBestSubset(vValue, nTotalLower, nTargetValue + MIN_CHANGE, vfBest, nBest);
+
+    // If we have a bigger coin and (either the stochastic approximation didn't find a good solution,
+    //                                   or the next bigger coin is closer), return the bigger coin
+    if (coinLowestLarger.second.first &&
+        ((nBest != nTargetValue && nBest < nTargetValue + MIN_CHANGE) || coinLowestLarger.first <= nBest))
+    {
+        setCoinsRet.insert(coinLowestLarger.second);
+        nValueRet += coinLowestLarger.first;
+    }
+    else {
+        for (unsigned int i = 0; i < vValue.size(); i++)
+            if (vfBest[i])
+            {
+                setCoinsRet.insert(vValue[i].second);
+                nValueRet += vValue[i].first;
+            }
+
+        LogPrint("selectcoins", "SelectCoins() best subset: ");
+        for (unsigned int i = 0; i < vValue.size(); i++)
+            if (vfBest[i])
+                LogPrint("selectcoins", "%s ", FormatMoney(vValue[i].first));
+        LogPrint("selectcoins", "total %s\n", FormatMoney(nBest));
+    }
+
+    return true;
+}
+
+bool CWallet::SelectCoins(const CAmount& nTargetValue, set<pair<const CWalletTx*,unsigned int> >& setCoinsRet, CAmount& nValueRet,  bool& fOnlyCoinbaseCoinsRet, bool& fNeedCoinbaseCoinsRet, const CCoinControl* coinControl) const
+{
+    // Output parameter fOnlyCoinbaseCoinsRet is set to true when the only available coins are coinbase utxos.
+    vector<COutput> vCoinsNoCoinbase, vCoinsWithCoinbase;
+    AvailableCoins(vCoinsNoCoinbase, true, coinControl, false, false);
+    AvailableCoins(vCoinsWithCoinbase, true, coinControl, false, true);
+    fOnlyCoinbaseCoinsRet = vCoinsNoCoinbase.size() == 0 && vCoinsWithCoinbase.size() > 0;
+
+    // If coinbase utxos can only be sent to zaddrs, exclude any coinbase utxos from coin selection.
+    bool fShieldCoinbase = Params().GetConsensus().fCoinbaseMustBeShielded;
+    vector<COutput> vCoins = (fShieldCoinbase) ? vCoinsNoCoinbase : vCoinsWithCoinbase;
+
+    // Output parameter fNeedCoinbaseCoinsRet is set to true if coinbase utxos need to be spent to meet target amount
+    if (fShieldCoinbase && vCoinsWithCoinbase.size() > vCoinsNoCoinbase.size()) {
+        CAmount value = 0;
+        for (const COutput& out : vCoinsNoCoinbase) {
+            if (!out.fSpendable) {
+                continue;
+            }
+            value += out.tx->vout[out.i].nValue;
+        }
+        if (value <= nTargetValue) {
+            CAmount valueWithCoinbase = 0;
+            for (const COutput& out : vCoinsWithCoinbase) {
+                if (!out.fSpendable) {
+                    continue;
+                }
+                valueWithCoinbase += out.tx->vout[out.i].nValue;
+            }
+            fNeedCoinbaseCoinsRet = (valueWithCoinbase >= nTargetValue);
+        }
+    }
+
+    // coin control -> return all selected outputs (we want all selected to go into the transaction for sure)
+    if (coinControl && coinControl->HasSelected() && !coinControl->fAllowOtherInputs)
+    {
+        for (const COutput& out : vCoins)
+        {
+            if (!out.fSpendable)
+                 continue;
+            nValueRet += out.tx->vout[out.i].nValue;
+            setCoinsRet.insert(make_pair(out.tx, out.i));
+        }
+        return (nValueRet >= nTargetValue);
+    }
+
+    // calculate value from preset inputs and store them
+    set<pair<const CWalletTx*, uint32_t> > setPresetCoins;
+    CAmount nValueFromPresetInputs = 0;
+
+    std::vector<COutPoint> vPresetInputs;
+    if (coinControl)
+        coinControl->ListSelected(vPresetInputs);
+    for (const COutPoint& outpoint : vPresetInputs)
+    {
+        map<uint256, CWalletTx>::const_iterator it = mapWallet.find(outpoint.hash);
+        if (it != mapWallet.end())
+        {
+            const CWalletTx* pcoin = &it->second;
+            // Clearly invalid input, fail
+            if (pcoin->vout.size() <= outpoint.n)
+                return false;
+            nValueFromPresetInputs += pcoin->vout[outpoint.n].nValue;
+            setPresetCoins.insert(make_pair(pcoin, outpoint.n));
+        } else
+            return false; // TODO: Allow non-wallet inputs
+    }
+
+    // remove preset inputs from vCoins
+    for (vector<COutput>::iterator it = vCoins.begin(); it != vCoins.end() && coinControl && coinControl->HasSelected();)
+    {
+        if (setPresetCoins.count(make_pair(it->tx, it->i)))
+            it = vCoins.erase(it);
+        else
+            ++it;
+    }
+
+    bool res = nTargetValue <= nValueFromPresetInputs ||
+        SelectCoinsMinConf(nTargetValue - nValueFromPresetInputs, 1, 6, vCoins, setCoinsRet, nValueRet) ||
+        SelectCoinsMinConf(nTargetValue - nValueFromPresetInputs, 1, 1, vCoins, setCoinsRet, nValueRet) ||
+        (bSpendZeroConfChange && SelectCoinsMinConf(nTargetValue - nValueFromPresetInputs, 0, 1, vCoins, setCoinsRet, nValueRet));
+
+    // because SelectCoinsMinConf clears the setCoinsRet, we now add the possible inputs to the coinset
+    setCoinsRet.insert(setPresetCoins.begin(), setPresetCoins.end());
+
+    // add preset inputs to the total value selected
+    nValueRet += nValueFromPresetInputs;
+
+    return res;
+}
+
+bool CWallet::FundTransaction(CMutableTransaction& tx, CAmount &nFeeRet, int& nChangePosRet, std::string& strFailReason, bool includeWatching)
+{
+    vector<CRecipient> vecSend;
+
+    // Turn the txout set into a CRecipient vector
+    for (const CTxOut& txOut : tx.vout)
+    {
+        CRecipient recipient = {txOut.scriptPubKey, txOut.nValue, false};
+        vecSend.push_back(recipient);
+    }
+
+    CCoinControl coinControl;
+    coinControl.fAllowOtherInputs = true;
+    coinControl.fAllowWatchOnly = includeWatching;
+    for (const CTxIn& txin : tx.vin)
+        coinControl.Select(txin.prevout);
+
+    CReserveKey reservekey(this);
+    CWalletTx wtx;
+
+    if (!CreateTransaction(vecSend, wtx, reservekey, nFeeRet, nChangePosRet, strFailReason, &coinControl, false))
+        return false;
+
+    if (nChangePosRet != -1)
+        tx.vout.insert(tx.vout.begin() + nChangePosRet, wtx.vout[nChangePosRet]);
+
+    // Add new txins (keeping original txin scriptSig/order)
+    for (const CTxIn& txin : wtx.vin)
+    {
+        bool found = false;
+        for (const CTxIn& origTxIn : tx.vin)
+        {
+            if (txin.prevout.hash == origTxIn.prevout.hash && txin.prevout.n == origTxIn.prevout.n)
+            {
+                found = true;
+                break;
+            }
+        }
+        if (!found)
+            tx.vin.push_back(txin);
+    }
+
+    return true;
+}
+
+bool CWallet::CreateTransaction(const vector<CRecipient>& vecSend, CWalletTx& wtxNew, CReserveKey& reservekey, CAmount& nFeeRet,
+                                int& nChangePosRet, std::string& strFailReason, const CCoinControl* coinControl, bool sign)
+{
+    CAmount nValue = 0;
+    unsigned int nSubtractFeeFromAmount = 0;
+    for (const CRecipient& recipient : vecSend)
+    {
+        if (nValue < 0 || recipient.nAmount < 0)
+        {
+            strFailReason = _("Transaction amounts must be positive");
+            return false;
+        }
+        nValue += recipient.nAmount;
+
+        if (recipient.fSubtractFeeFromAmount)
+            nSubtractFeeFromAmount++;
+    }
+    if (vecSend.empty() || nValue < 0)
+    {
+        strFailReason = _("Transaction amounts must be positive");
+        return false;
+    }
+
+    wtxNew.fTimeReceivedIsTxTime = true;
+    wtxNew.BindWallet(this);
+    LOCK(cs_main);
+    int nextBlockHeight = chainActive.Height() + 1;
+    CMutableTransaction txNew = CreateNewContextualCMutableTransaction(
+        Params().GetConsensus(), nextBlockHeight);
+
+    // Activates after Overwinter network upgrade
+    if (Params().GetConsensus().NetworkUpgradeActive(nextBlockHeight, Consensus::UPGRADE_OVERWINTER)) {
+        if (txNew.nExpiryHeight >= TX_EXPIRY_HEIGHT_THRESHOLD){
+            strFailReason = _("nExpiryHeight must be less than TX_EXPIRY_HEIGHT_THRESHOLD.");
+            return false;
+        }
+    }
+
+    unsigned int max_tx_size = MAX_TX_SIZE_AFTER_SAPLING;
+    if (!Params().GetConsensus().NetworkUpgradeActive(nextBlockHeight, Consensus::UPGRADE_SAPLING)) {
+        max_tx_size = MAX_TX_SIZE_BEFORE_SAPLING;
+    }
+
+    // Discourage fee sniping.
+    //
+    // However because of a off-by-one-error in previous versions we need to
+    // neuter it by setting nLockTime to at least one less than nBestHeight.
+    // Secondly currently propagation of transactions created for block heights
+    // corresponding to blocks that were just mined may be iffy - transactions
+    // aren't re-accepted into the mempool - we additionally neuter the code by
+    // going ten blocks back. Doesn't yet do anything for sniping, but does act
+    // to shake out wallet bugs like not showing nLockTime'd transactions at
+    // all.
+    txNew.nLockTime = std::max(0, chainActive.Height() - 10);
+
+    // Secondly occasionally randomly pick a nLockTime even further back, so
+    // that transactions that are delayed after signing for whatever reason,
+    // e.g. high-latency mix networks and some CoinJoin implementations, have
+    // better privacy.
+    if (GetRandInt(10) == 0)
+        txNew.nLockTime = std::max(0, (int)txNew.nLockTime - GetRandInt(100));
+
+    assert(txNew.nLockTime <= (unsigned int)chainActive.Height());
+    assert(txNew.nLockTime < LOCKTIME_THRESHOLD);
+
+    {
+        // cs_main already taken above
+        LOCK(cs_wallet);
+        {
+            nFeeRet = 0;
+            // Start with no fee and loop until there is enough fee
+            while (true)
+            {
+                txNew.vin.clear();
+                txNew.vout.clear();
+                wtxNew.fFromMe = true;
+                nChangePosRet = -1;
+                bool fFirst = true;
+
+                CAmount nTotalValue = nValue;
+                if (nSubtractFeeFromAmount == 0)
+                    nTotalValue += nFeeRet;
+                double dPriority = 0;
+                // vouts to the payees
+                for (const CRecipient& recipient : vecSend)
+                {
+                    CTxOut txout(recipient.nAmount, recipient.scriptPubKey);
+
+                    if (recipient.fSubtractFeeFromAmount)
+                    {
+                        txout.nValue -= nFeeRet / nSubtractFeeFromAmount; // Subtract fee equally from each selected recipient
+
+                        if (fFirst) // first receiver pays the remainder not divisible by output count
+                        {
+                            fFirst = false;
+                            txout.nValue -= nFeeRet % nSubtractFeeFromAmount;
+                        }
+                    }
+
+                    if (txout.IsDust(::minRelayTxFee))
+                    {
+                        if (recipient.fSubtractFeeFromAmount && nFeeRet > 0)
+                        {
+                            if (txout.nValue < 0)
+                                strFailReason = _("The transaction amount is too small to pay the fee");
+                            else
+                                strFailReason = _("The transaction amount is too small to send after the fee has been deducted");
+                        }
+                        else
+                            strFailReason = _("Transaction amount too small");
+                        return false;
+                    }
+                    txNew.vout.push_back(txout);
+                }
+
+                // Choose coins to use
+                set<pair<const CWalletTx*,unsigned int> > setCoins;
+                CAmount nValueIn = 0;
+                bool fOnlyCoinbaseCoins = false;
+                bool fNeedCoinbaseCoins = false;
+                if (!SelectCoins(nTotalValue, setCoins, nValueIn, fOnlyCoinbaseCoins, fNeedCoinbaseCoins, coinControl))
+                {
+                    if (fOnlyCoinbaseCoins && Params().GetConsensus().fCoinbaseMustBeShielded) {
+                        strFailReason = _("Coinbase funds can only be sent to a zaddr");
+                    } else if (fNeedCoinbaseCoins) {
+                        strFailReason = _("Insufficient funds, coinbase funds can only be spent after they have been sent to a zaddr");
+                    } else {
+                        strFailReason = _("Insufficient funds");
+                    }
+                    return false;
+                }
+                for (std::pair<const CWalletTx*, unsigned int> pcoin : setCoins)
+                {
+                    CAmount nCredit = pcoin.first->vout[pcoin.second].nValue;
+                    //The coin age after the next block (depth+1) is used instead of the current,
+                    //reflecting an assumption the user would accept a bit more delay for
+                    //a chance at a free transaction.
+                    //But mempool inputs might still be in the mempool, so their age stays 0
+                    int age = pcoin.first->GetDepthInMainChain();
+                    if (age != 0)
+                        age += 1;
+                    dPriority += (double)nCredit * age;
+                }
+
+                CAmount nChange = nValueIn - nValue;
+                if (nSubtractFeeFromAmount == 0)
+                    nChange -= nFeeRet;
+
+                if (nChange > 0)
+                {
+                    // Fill a vout to ourself
+                    // TODO: pass in scriptChange instead of reservekey so
+                    // change transaction isn't always pay-to-bitcoin-address
+                    CScript scriptChange;
+
+                    // coin control: send change to custom address
+                    if (coinControl && !std::get_if<CNoDestination>(&coinControl->destChange))
+                        scriptChange = GetScriptForDestination(coinControl->destChange);
+
+                    // no coin control: send change to newly generated address
+                    else
+                    {
+                        // Note: We use a new key here to keep it from being obvious which side is the change.
+                        //  The drawback is that by not reusing a previous key, the change may be lost if a
+                        //  backup is restored, if the backup doesn't have the new private key for the change.
+                        //  If we reused the old key, it would be possible to add code to look for and
+                        //  rediscover unknown transactions that were written with keys of ours to recover
+                        //  post-backup change.
+
+                        // Reserve a new key pair from key pool
+                        CPubKey vchPubKey;
+                        bool ret;
+                        ret = reservekey.GetReservedKey(vchPubKey);
+                        assert(ret); // should never fail, as we just unlocked
+
+                        scriptChange = GetScriptForDestination(vchPubKey.GetID());
+                    }
+
+                    CTxOut newTxOut(nChange, scriptChange);
+
+                    // We do not move dust-change to fees, because the sender would end up paying more than requested.
+                    // This would be against the purpose of the all-inclusive feature.
+                    // So instead we raise the change and deduct from the recipient.
+                    if (nSubtractFeeFromAmount > 0 && newTxOut.IsDust(::minRelayTxFee))
+                    {
+                        CAmount nDust = newTxOut.GetDustThreshold(::minRelayTxFee) - newTxOut.nValue;
+                        newTxOut.nValue += nDust; // raise change until no more dust
+                        for (unsigned int i = 0; i < vecSend.size(); i++) // subtract from first recipient
+                        {
+                            if (vecSend[i].fSubtractFeeFromAmount)
+                            {
+                                txNew.vout[i].nValue -= nDust;
+                                if (txNew.vout[i].IsDust(::minRelayTxFee))
+                                {
+                                    strFailReason = _("The transaction amount is too small to send after the fee has been deducted");
+                                    return false;
+                                }
+                                break;
+                            }
+                        }
+                    }
+
+                    // Never create dust outputs; if we would, just
+                    // add the dust to the fee.
+                    if (newTxOut.IsDust(::minRelayTxFee))
+                    {
+                        nFeeRet += nChange;
+                        reservekey.ReturnKey();
+                    }
+                    else
+                    {
+                        // Insert change txn at random position:
+                        nChangePosRet = GetRandInt(txNew.vout.size()+1);
+                        vector<CTxOut>::iterator position = txNew.vout.begin()+nChangePosRet;
+                        txNew.vout.insert(position, newTxOut);
+                    }
+                }
+                else
+                    reservekey.ReturnKey();
+
+                // Fill vin
+                //
+                // Note how the sequence number is set to max()-1 so that the
+                // nLockTime set above actually works.
+                for (const std::pair<const CWalletTx*, unsigned int>& coin : setCoins)
+                    txNew.vin.push_back(CTxIn(coin.first->GetHash(),coin.second,CScript(),
+                                              std::numeric_limits<unsigned int>::max()-1));
+
+                // Grab the current consensus branch ID
+                auto consensusBranchId = CurrentEpochBranchId(chainActive.Height() + 1, Params().GetConsensus());
+
+                // Sign
+                int nIn = 0;
+                CTransaction txNewConst(txNew);
+                std::vector<CTxOut> allPrevOutputs;
+                for (const std::pair<const CWalletTx*, unsigned int>& coin : setCoins) {
+                    allPrevOutputs.push_back(coin.first->vout[coin.second]);
+                }
+                const PrecomputedTransactionData txdata(txNewConst, allPrevOutputs);
+                for (const std::pair<const CWalletTx*, unsigned int>& coin : setCoins)
+                {
+                    bool signSuccess;
+                    const CScript& scriptPubKey = coin.first->vout[coin.second].scriptPubKey;
+                    SignatureData sigdata;
+                    if (sign)
+                        signSuccess = ProduceSignature(TransactionSignatureCreator(this, &txNewConst, txdata, nIn, coin.first->vout[coin.second].nValue, SIGHASH_ALL), scriptPubKey, sigdata, consensusBranchId);
+                    else
+                        signSuccess = ProduceSignature(DummySignatureCreator(this), scriptPubKey, sigdata, consensusBranchId);
+
+                    if (!signSuccess)
+                    {
+                        strFailReason = _("Signing transaction failed");
+                        return false;
+                    } else {
+                        UpdateTransaction(txNew, nIn, sigdata);
+                    }
+
+                    nIn++;
+                }
+
+                unsigned int nBytes = ::GetSerializeSize(txNew, SER_NETWORK, PROTOCOL_VERSION);
+
+                // Remove scriptSigs if we used dummy signatures for fee calculation
+                if (!sign) {
+                    for (CTxIn& vin : txNew.vin)
+                        vin.scriptSig = CScript();
+                }
+
+                // Embed the constructed transaction data in wtxNew.
+                *static_cast<CTransaction*>(&wtxNew) = CTransaction(txNew);
+
+                // Limit size
+                if (nBytes >= max_tx_size)
+                {
+                    strFailReason = _("Transaction too large");
+                    return false;
+                }
+
+                dPriority = wtxNew.ComputePriority(dPriority, nBytes);
+
+                // Can we complete this as a free transaction?
+                if (fSendFreeTransactions && nBytes <= MAX_FREE_TRANSACTION_CREATE_SIZE)
+                {
+                    // Not enough fee: enough priority?
+                    double dPriorityNeeded = mempool.estimatePriority(nTxConfirmTarget);
+                    // Not enough mempool history to estimate: use hard-coded AllowFree.
+                    if (dPriorityNeeded <= 0 && AllowFree(dPriority))
+                        break;
+
+                    // Small enough, and priority high enough, to send for free
+                    if (dPriorityNeeded > 0 && dPriority >= dPriorityNeeded)
+                        break;
+                }
+
+                CAmount nFeeNeeded = GetMinimumFee(nBytes, nTxConfirmTarget, mempool);
+
+                // If we made it here and we aren't even able to meet the relay fee on the next pass, give up
+                // because we must be at the maximum allowed fee.
+                if (nFeeNeeded < ::minRelayTxFee.GetFeeForRelay(nBytes))
+                {
+                    strFailReason = _("Transaction too large for fee policy");
+                    return false;
+                }
+
+                if (nFeeRet >= nFeeNeeded)
+                    break; // Done, enough fee included.
+
+                // Include more fee and try again.
+                nFeeRet = nFeeNeeded;
+                continue;
+            }
+        }
+    }
+
+    return true;
+}
+
+/**
+ * Call after CreateTransaction unless you want to abort
+ */
+bool CWallet::CommitTransaction(CWalletTx& wtxNew, std::optional<std::reference_wrapper<CReserveKey>> reservekey)
+{
+    {
+        LOCK2(cs_main, cs_wallet);
+        LogPrintf("CommitTransaction:\n%s", wtxNew.ToString());
+        {
+            // This is only to keep the database open to defeat the auto-flush for the
+            // duration of this scope.  This is the only place where this optimization
+            // maybe makes sense; please don't do it anywhere else.
+            CWalletDB* pwalletdb = fFileBacked ? new CWalletDB(strWalletFile,"r+") : NULL;
+
+            if (reservekey) {
+                // Take key pair from key pool so it won't be used again
+                reservekey.value().get().KeepKey();
+            }
+
+            // Add tx to wallet, because if it has change it's also ours,
+            // otherwise just for transaction history.
+            AddToWallet(wtxNew, pwalletdb);
+
+            // Notify that old coins are spent
+            set<CWalletTx*> setCoins;
+            for (const CTxIn& txin : wtxNew.vin)
+            {
+                CWalletTx &coin = mapWallet[txin.prevout.hash];
+                coin.BindWallet(this);
+                NotifyTransactionChanged(this, coin.GetHash(), CT_UPDATED);
+            }
+
+            if (fFileBacked)
+                delete pwalletdb;
+        }
+
+        // Track how many getdata requests our transaction gets
+        mapRequestCount[wtxNew.GetHash()] = 0;
+
+        if (fBroadcastTransactions)
+        {
+            // Broadcast
+            if (!wtxNew.AcceptToMemoryPool(false))
+            {
+                // This must not fail. The transaction has already been signed and recorded.
+                LogPrintf("CommitTransaction(): Error: Transaction not valid\n");
+                return false;
+            }
+            wtxNew.RelayWalletTransaction();
+        }
+    }
+    return true;
+}
+
+CAmount CWallet::GetRequiredFee(unsigned int nTxBytes)
+{
+    return std::max(minTxFee.GetFee(nTxBytes), ::minRelayTxFee.GetFeeForRelay(nTxBytes));
+}
+
+CAmount CWallet::GetMinimumFee(unsigned int nTxBytes, unsigned int nConfirmTarget, const CTxMemPool& pool)
+{
+    // payTxFee is user-set "I want to pay this much"
+    CAmount nFeeNeeded = payTxFee.GetFee(nTxBytes);
+    // user selected total at least (default=true)
+    if (fPayAtLeastCustomFee && nFeeNeeded > 0 && nFeeNeeded < payTxFee.GetFeePerK())
+        nFeeNeeded = payTxFee.GetFeePerK();
+    // User didn't set: use -txconfirmtarget to estimate...
+    if (nFeeNeeded == 0)
+        nFeeNeeded = pool.estimateFee(nConfirmTarget).GetFee(nTxBytes);
+    // ... unless we don't have enough mempool data, in which case fall
+    // back to the required fee
+    if (nFeeNeeded == 0)
+        nFeeNeeded = GetRequiredFee(nTxBytes);
+    // prevent user from paying a non-sense fee (like 1 satoshi): 0 < fee < minRelayFee
+    if (nFeeNeeded < ::minRelayTxFee.GetFeeForRelay(nTxBytes))
+        nFeeNeeded = ::minRelayTxFee.GetFeeForRelay(nTxBytes);
+    // But always obey the maximum
+    if (nFeeNeeded > maxTxFee)
+        nFeeNeeded = maxTxFee;
+    return nFeeNeeded;
+}
+
+
+
+
+DBErrors CWallet::LoadWallet(bool& fFirstRunRet)
+{
+    if (!fFileBacked)
+        return DB_LOAD_OK;
+
+    LOCK2(cs_main, cs_wallet);
+
+    fFirstRunRet = false;
+    DBErrors nLoadWalletRet = CWalletDB(strWalletFile,"cr+").LoadWallet(this);
+    if (nLoadWalletRet == DB_NEED_REWRITE)
+    {
+        if (CDB::Rewrite(strWalletFile, "\x04pool"))
+        {
+            setKeyPool.clear();
+            // Note: can't top-up keypool here, because wallet is locked.
+            // User will be prompted to unlock wallet the next operation
+            // that requires a new key.
+        }
+    }
+
+    if (nLoadWalletRet != DB_LOAD_OK)
+        return nLoadWalletRet;
+    fFirstRunRet = !vchDefaultKey.IsValid();
+
+    uiInterface.LoadWallet(this);
+
+    return DB_LOAD_OK;
+}
+
+
+DBErrors CWallet::ZapWalletTx(std::vector<CWalletTx>& vWtx)
+{
+    if (!fFileBacked)
+        return DB_LOAD_OK;
+    DBErrors nZapWalletTxRet = CWalletDB(strWalletFile,"cr+").ZapWalletTx(this, vWtx);
+    if (nZapWalletTxRet == DB_NEED_REWRITE)
+    {
+        if (CDB::Rewrite(strWalletFile, "\x04pool"))
+        {
+            LOCK(cs_wallet);
+            setKeyPool.clear();
+            // Note: can't top-up keypool here, because wallet is locked.
+            // User will be prompted to unlock wallet the next operation
+            // that requires a new key.
+        }
+    }
+
+    if (nZapWalletTxRet != DB_LOAD_OK)
+        return nZapWalletTxRet;
+
+    return DB_LOAD_OK;
+}
+
+
+bool CWallet::SetAddressBook(const CTxDestination& address, const string& strName, const string& strPurpose)
+{
+    bool fUpdated = false;
+    {
+        LOCK(cs_wallet); // mapAddressBook
+        std::map<CTxDestination, CAddressBookData>::iterator mi = mapAddressBook.find(address);
+        fUpdated = mi != mapAddressBook.end();
+        mapAddressBook[address].name = strName;
+        if (!strPurpose.empty()) /* update purpose only if requested */
+            mapAddressBook[address].purpose = strPurpose;
+    }
+    NotifyAddressBookChanged(this, address, strName, ::IsMine(*this, address) != ISMINE_NO,
+                             strPurpose, (fUpdated ? CT_UPDATED : CT_NEW) );
+    KeyIO keyIO(Params());
+    if (!fFileBacked)
+        return false;
+    if (!strPurpose.empty() && !CWalletDB(strWalletFile).WritePurpose(keyIO.EncodeDestination(address), strPurpose))
+        return false;
+    return CWalletDB(strWalletFile).WriteName(keyIO.EncodeDestination(address), strName);
+}
+
+bool CWallet::DelAddressBook(const CTxDestination& address)
+{
+    KeyIO keyIO(Params());
+    {
+        LOCK(cs_wallet); // mapAddressBook
+
+        if(fFileBacked)
+        {
+            // Delete destdata tuples associated with address
+            std::string strAddress = keyIO.EncodeDestination(address);
+            for (const std::pair<string, string> &item : mapAddressBook[address].destdata)
+            {
+                CWalletDB(strWalletFile).EraseDestData(strAddress, item.first);
+            }
+        }
+        mapAddressBook.erase(address);
+    }
+
+    NotifyAddressBookChanged(this, address, "", ::IsMine(*this, address) != ISMINE_NO, "", CT_DELETED);
+
+    if (!fFileBacked)
+        return false;
+    CWalletDB(strWalletFile).ErasePurpose(keyIO.EncodeDestination(address));
+    return CWalletDB(strWalletFile).EraseName(keyIO.EncodeDestination(address));
+}
+
+bool CWallet::SetDefaultKey(const CPubKey &vchPubKey)
+{
+    if (fFileBacked)
+    {
+        if (!CWalletDB(strWalletFile).WriteDefaultKey(vchPubKey))
+            return false;
+    }
+    vchDefaultKey = vchPubKey;
+    return true;
+}
+
+/**
+ * Mark old keypool keys as used, and derive new internal keys.
+ *
+ * This is only used when first migrating to HD-derived transparent keys.
+ */
+bool CWallet::NewKeyPool()
+{
+    {
+        LOCK(cs_wallet);
+        CWalletDB walletdb(strWalletFile);
+        for (int64_t nIndex : setKeyPool)
+            walletdb.ErasePool(nIndex);
+        setKeyPool.clear();
+
+        if (IsLocked())
+            return false;
+
+        int64_t nKeys = max(GetArg("-keypool", DEFAULT_KEYPOOL_SIZE), (int64_t)0);
+        for (int i = 0; i < nKeys; i++)
+        {
+            int64_t nIndex = i+1;
+            walletdb.WritePool(nIndex, CKeyPool(GenerateNewKey(false)));
+            setKeyPool.insert(nIndex);
+        }
+        LogPrintf("CWallet::NewKeyPool wrote %d new keys\n", nKeys);
+    }
+    return true;
+}
+
+bool CWallet::TopUpKeyPool(unsigned int kpSize)
+{
+    {
+        LOCK(cs_wallet);
+
+        if (IsLocked())
+            return false;
+
+        CWalletDB walletdb(strWalletFile);
+
+        // Top up key pool
+        unsigned int nTargetSize;
+        if (kpSize > 0)
+            nTargetSize = kpSize;
+        else
+            nTargetSize = max(GetArg("-keypool", DEFAULT_KEYPOOL_SIZE), (int64_t) 0);
+
+        while (setKeyPool.size() < (nTargetSize + 1))
+        {
+            int64_t nEnd = 1;
+            if (!setKeyPool.empty())
+                nEnd = *(--setKeyPool.end()) + 1;
+            if (!walletdb.WritePool(nEnd, CKeyPool(GenerateNewKey(false))))
+                throw runtime_error("TopUpKeyPool(): writing generated key failed");
+            setKeyPool.insert(nEnd);
+            LogPrintf("keypool added key %d, size=%u\n", nEnd, setKeyPool.size());
+        }
+    }
+    return true;
+}
+
+void CWallet::ReserveKeyFromKeyPool(int64_t& nIndex, CKeyPool& keypool)
+{
+    nIndex = -1;
+    keypool.vchPubKey = CPubKey();
+    {
+        LOCK(cs_wallet);
+
+        if (!IsLocked())
+            TopUpKeyPool();
+
+        // Get the oldest key
+        if(setKeyPool.empty())
+            return;
+
+        CWalletDB walletdb(strWalletFile);
+
+        nIndex = *(setKeyPool.begin());
+        setKeyPool.erase(setKeyPool.begin());
+        if (!walletdb.ReadPool(nIndex, keypool))
+            throw runtime_error("ReserveKeyFromKeyPool(): read failed");
+        if (!HaveKey(keypool.vchPubKey.GetID()))
+            throw runtime_error("ReserveKeyFromKeyPool(): unknown key in key pool");
+        assert(keypool.vchPubKey.IsValid());
+        LogPrintf("keypool reserve %d\n", nIndex);
+    }
+}
+
+void CWallet::KeepKey(int64_t nIndex)
+{
+    // Remove from key pool
+    if (fFileBacked)
+    {
+        CWalletDB walletdb(strWalletFile);
+        walletdb.ErasePool(nIndex);
+    }
+    LogPrintf("keypool keep %d\n", nIndex);
+}
+
+void CWallet::ReturnKey(int64_t nIndex)
+{
+    // Return to key pool
+    {
+        LOCK(cs_wallet);
+        setKeyPool.insert(nIndex);
+    }
+    LogPrintf("keypool return %d\n", nIndex);
+}
+
+int64_t CWallet::GetOldestKeyPoolTime()
+{
+    int64_t nIndex = 0;
+    CKeyPool keypool;
+    ReserveKeyFromKeyPool(nIndex, keypool);
+    if (nIndex == -1)
+        return GetTime();
+    ReturnKey(nIndex);
+    return keypool.nTime;
+}
+
+std::map<CTxDestination, CAmount> CWallet::GetAddressBalances()
+{
+    map<CTxDestination, CAmount> balances;
+
+    {
+        LOCK(cs_wallet);
+        for (std::pair<uint256, CWalletTx> walletEntry : mapWallet)
+        {
+            CWalletTx *pcoin = &walletEntry.second;
+
+            if (!CheckFinalTx(*pcoin) || !pcoin->IsTrusted())
+                continue;
+
+            if (pcoin->IsCoinBase() && pcoin->GetBlocksToMaturity() > 0)
+                continue;
+
+            int nDepth = pcoin->GetDepthInMainChain();
+            if (nDepth < (pcoin->IsFromMe(ISMINE_ALL) ? 0 : 1))
+                continue;
+
+            for (unsigned int i = 0; i < pcoin->vout.size(); i++)
+            {
+                CTxDestination addr;
+                if (!IsMine(pcoin->vout[i]))
+                    continue;
+                if(!ExtractDestination(pcoin->vout[i].scriptPubKey, addr))
+                    continue;
+
+                CAmount n = IsSpent(walletEntry.first, i) ? 0 : pcoin->vout[i].nValue;
+
+                if (!balances.count(addr))
+                    balances[addr] = 0;
+                balances[addr] += n;
+            }
+        }
+    }
+
+    return balances;
+}
+
+set< set<CTxDestination> > CWallet::GetAddressGroupings()
+{
+    AssertLockHeld(cs_wallet); // mapWallet
+    set< set<CTxDestination> > groupings;
+    set<CTxDestination> grouping;
+
+    for (std::pair<uint256, CWalletTx> walletEntry : mapWallet)
+    {
+        CWalletTx *pcoin = &walletEntry.second;
+
+        if (pcoin->vin.size() > 0)
+        {
+            bool any_mine = false;
+            // group all input addresses with each other
+            for (CTxIn txin : pcoin->vin)
+            {
+                CTxDestination address;
+                if(!IsMine(txin)) /* If this input isn't mine, ignore it */
+                    continue;
+                if(!ExtractDestination(mapWallet[txin.prevout.hash].vout[txin.prevout.n].scriptPubKey, address))
+                    continue;
+                grouping.insert(address);
+                any_mine = true;
+            }
+
+            // group change with input addresses
+            if (any_mine)
+            {
+               for (CTxOut txout : pcoin->vout)
+                   if (IsChange(txout))
+                   {
+                       CTxDestination txoutAddr;
+                       if(!ExtractDestination(txout.scriptPubKey, txoutAddr))
+                           continue;
+                       grouping.insert(txoutAddr);
+                   }
+            }
+            if (grouping.size() > 0)
+            {
+                groupings.insert(grouping);
+                grouping.clear();
+            }
+        }
+
+        // group lone addrs by themselves
+        for (unsigned int i = 0; i < pcoin->vout.size(); i++)
+            if (IsMine(pcoin->vout[i]))
+            {
+                CTxDestination address;
+                if(!ExtractDestination(pcoin->vout[i].scriptPubKey, address))
+                    continue;
+                grouping.insert(address);
+                groupings.insert(grouping);
+                grouping.clear();
+            }
+    }
+
+    set< set<CTxDestination>* > uniqueGroupings; // a set of pointers to groups of addresses
+    map< CTxDestination, set<CTxDestination>* > setmap;  // map addresses to the unique group containing it
+    for (set<CTxDestination> _grouping : groupings)
+    {
+        // make a set of all the groups hit by this new group
+        set< set<CTxDestination>* > hits;
+        map< CTxDestination, set<CTxDestination>* >::iterator it;
+        for (CTxDestination address : _grouping)
+            if ((it = setmap.find(address)) != setmap.end())
+                hits.insert((*it).second);
+
+        // merge all hit groups into a new single group and delete old groups
+        set<CTxDestination>* merged = new set<CTxDestination>(_grouping);
+        for (set<CTxDestination>* hit : hits)
+        {
+            merged->insert(hit->begin(), hit->end());
+            uniqueGroupings.erase(hit);
+            delete hit;
+        }
+        uniqueGroupings.insert(merged);
+
+        // update setmap
+        for (CTxDestination element : *merged)
+            setmap[element] = merged;
+    }
+
+    set< set<CTxDestination> > ret;
+    for (set<CTxDestination>* uniqueGrouping : uniqueGroupings)
+    {
+        ret.insert(*uniqueGrouping);
+        delete uniqueGrouping;
+    }
+
+    return ret;
+}
+
+bool CReserveKey::GetReservedKey(CPubKey& pubkey)
+{
+    if (nIndex == -1)
+    {
+        CKeyPool keypool;
+        pwallet->ReserveKeyFromKeyPool(nIndex, keypool);
+        if (nIndex != -1)
+            vchPubKey = keypool.vchPubKey;
+        else {
+            return false;
+        }
+    }
+    assert(vchPubKey.IsValid());
+    pubkey = vchPubKey;
+    return true;
+}
+
+void CReserveKey::KeepKey()
+{
+    if (nIndex != -1)
+        pwallet->KeepKey(nIndex);
+    nIndex = -1;
+    vchPubKey = CPubKey();
+}
+
+void CReserveKey::ReturnKey()
+{
+    if (nIndex != -1)
+        pwallet->ReturnKey(nIndex);
+    nIndex = -1;
+    vchPubKey = CPubKey();
+}
+
+void CWallet::GetAllReserveKeys(set<CKeyID>& setAddress) const
+{
+    setAddress.clear();
+
+    CWalletDB walletdb(strWalletFile);
+
+    LOCK2(cs_main, cs_wallet);
+    for (const int64_t& id : setKeyPool)
+    {
+        CKeyPool keypool;
+        if (!walletdb.ReadPool(id, keypool))
+            throw runtime_error("GetAllReserveKeyHashes(): read failed");
+        assert(keypool.vchPubKey.IsValid());
+        CKeyID keyID = keypool.vchPubKey.GetID();
+        if (!HaveKey(keyID))
+            throw runtime_error("GetAllReserveKeyHashes(): unknown key in key pool");
+        setAddress.insert(keyID);
+    }
+}
+
+void CWallet::UpdatedTransaction(const uint256 &hashTx)
+{
+    {
+        LOCK(cs_wallet);
+        // Only notify UI if this transaction is in this wallet
+        map<uint256, CWalletTx>::const_iterator mi = mapWallet.find(hashTx);
+        if (mi != mapWallet.end())
+            NotifyTransactionChanged(this, hashTx, CT_UPDATED);
+    }
+}
+
+void CWallet::GetAddressForMining(std::optional<MinerAddress> &minerAddress)
+{
+    if (!GetArg("-mineraddress", "").empty()) {
+        return;
+    }
+
+    boost::shared_ptr<CReserveKey> rKey(new CReserveKey(this));
+    CPubKey pubkey;
+    if (!rKey->GetReservedKey(pubkey)) {
+        // Explicitly return nullptr to indicate that the keypool is empty.
+        rKey = nullptr;
+        minerAddress = rKey;
+        return;
+    }
+
+    rKey->reserveScript = CScript() << OP_DUP << OP_HASH160 << ToByteVector(pubkey.GetID()) << OP_EQUALVERIFY << OP_CHECKSIG;
+    minerAddress = rKey;
+}
+
+void CWallet::LockCoin(COutPoint& output)
+{
+    AssertLockHeld(cs_wallet); // setLockedCoins
+    setLockedCoins.insert(output);
+}
+
+void CWallet::UnlockCoin(COutPoint& output)
+{
+    AssertLockHeld(cs_wallet); // setLockedCoins
+    setLockedCoins.erase(output);
+}
+
+void CWallet::UnlockAllCoins()
+{
+    AssertLockHeld(cs_wallet); // setLockedCoins
+    setLockedCoins.clear();
+}
+
+bool CWallet::IsLockedCoin(uint256 hash, unsigned int n) const
+{
+    AssertLockHeld(cs_wallet); // setLockedCoins
+    COutPoint outpt(hash, n);
+
+    return (setLockedCoins.count(outpt) > 0);
+}
+
+void CWallet::ListLockedCoins(std::vector<COutPoint>& vOutpts)
+{
+    AssertLockHeld(cs_wallet); // setLockedCoins
+    for (std::set<COutPoint>::iterator it = setLockedCoins.begin();
+         it != setLockedCoins.end(); it++) {
+        COutPoint outpt = (*it);
+        vOutpts.push_back(outpt);
+    }
+}
+
+
+// Note Locking Operations
+
+void CWallet::LockNote(const JSOutPoint& output)
+{
+    AssertLockHeld(cs_wallet); // setLockedSproutNotes
+    setLockedSproutNotes.insert(output);
+}
+
+void CWallet::UnlockNote(const JSOutPoint& output)
+{
+    AssertLockHeld(cs_wallet); // setLockedSproutNotes
+    setLockedSproutNotes.erase(output);
+}
+
+void CWallet::UnlockAllSproutNotes()
+{
+    AssertLockHeld(cs_wallet); // setLockedSproutNotes
+    setLockedSproutNotes.clear();
+}
+
+bool CWallet::IsLockedNote(const JSOutPoint& outpt) const
+{
+    AssertLockHeld(cs_wallet); // setLockedSproutNotes
+
+    return (setLockedSproutNotes.count(outpt) > 0);
+}
+
+std::vector<JSOutPoint> CWallet::ListLockedSproutNotes()
+{
+    AssertLockHeld(cs_wallet); // setLockedSproutNotes
+    std::vector<JSOutPoint> vOutpts(setLockedSproutNotes.begin(), setLockedSproutNotes.end());
+    return vOutpts;
+}
+
+void CWallet::LockNote(const SaplingOutPoint& output)
+{
+    AssertLockHeld(cs_wallet);
+    setLockedSaplingNotes.insert(output);
+}
+
+void CWallet::UnlockNote(const SaplingOutPoint& output)
+{
+    AssertLockHeld(cs_wallet);
+    setLockedSaplingNotes.erase(output);
+}
+
+void CWallet::UnlockAllSaplingNotes()
+{
+    AssertLockHeld(cs_wallet);
+    setLockedSaplingNotes.clear();
+}
+
+bool CWallet::IsLockedNote(const SaplingOutPoint& output) const
+{
+    AssertLockHeld(cs_wallet);
+    return (setLockedSaplingNotes.count(output) > 0);
+}
+
+std::vector<SaplingOutPoint> CWallet::ListLockedSaplingNotes()
+{
+    AssertLockHeld(cs_wallet);
+    std::vector<SaplingOutPoint> vOutputs(setLockedSaplingNotes.begin(), setLockedSaplingNotes.end());
+    return vOutputs;
+}
+
+/** @} */ // end of Actions
+
+class CAffectedKeysVisitor {
+private:
+    const CKeyStore &keystore;
+    std::vector<CKeyID> &vKeys;
+
+public:
+    CAffectedKeysVisitor(const CKeyStore &keystoreIn, std::vector<CKeyID> &vKeysIn) : keystore(keystoreIn), vKeys(vKeysIn) {}
+
+    void Process(const CScript &script) {
+        txnouttype type;
+        std::vector<CTxDestination> vDest;
+        int nRequired;
+        if (ExtractDestinations(script, type, vDest, nRequired)) {
+            for (const CTxDestination &dest : vDest)
+                std::visit(*this, dest);
+        }
+    }
+
+    void operator()(const CKeyID &keyId) {
+        if (keystore.HaveKey(keyId))
+            vKeys.push_back(keyId);
+    }
+
+    void operator()(const CScriptID &scriptId) {
+        CScript script;
+        if (keystore.GetCScript(scriptId, script))
+            Process(script);
+    }
+
+    void operator()(const CNoDestination &none) {}
+};
+
+void CWallet::GetKeyBirthTimes(std::map<CKeyID, int64_t> &mapKeyBirth) const {
+    AssertLockHeld(cs_main); // chainActive
+    AssertLockHeld(cs_wallet); // mapKeyMetadata
+    mapKeyBirth.clear();
+
+    // get birth times for keys with metadata
+    for (std::map<CKeyID, CKeyMetadata>::const_iterator it = mapKeyMetadata.begin(); it != mapKeyMetadata.end(); it++)
+        if (it->second.nCreateTime)
+            mapKeyBirth[it->first] = it->second.nCreateTime;
+
+    // map in which we'll infer heights of other keys
+    CBlockIndex *pindexMax = chainActive[std::max(0, chainActive.Height() - 144)]; // the tip can be reorganised; use a 144-block safety margin
+    std::map<CKeyID, CBlockIndex*> mapKeyFirstBlock;
+    for (const CKeyID &keyid : GetKeys()) {
+        if (mapKeyBirth.count(keyid) == 0)
+            mapKeyFirstBlock[keyid] = pindexMax;
+    }
+
+    // if there are no such keys, we're done
+    if (mapKeyFirstBlock.empty())
+        return;
+
+    // find first block that affects those keys, if there are any left
+    std::vector<CKeyID> vAffected;
+    for (std::map<uint256, CWalletTx>::const_iterator it = mapWallet.begin(); it != mapWallet.end(); it++) {
+        // iterate over all wallet transactions...
+        const CWalletTx &wtx = (*it).second;
+        BlockMap::const_iterator blit = mapBlockIndex.find(wtx.hashBlock);
+        if (blit != mapBlockIndex.end() && chainActive.Contains(blit->second)) {
+            // ... which are already in a block
+            int nHeight = blit->second->nHeight;
+            for (const CTxOut &txout : wtx.vout) {
+                // iterate over all their outputs
+                CAffectedKeysVisitor(*this, vAffected).Process(txout.scriptPubKey);
+                for (const CKeyID &keyid : vAffected) {
+                    // ... and all their affected keys
+                    std::map<CKeyID, CBlockIndex*>::iterator rit = mapKeyFirstBlock.find(keyid);
+                    if (rit != mapKeyFirstBlock.end() && nHeight < rit->second->nHeight)
+                        rit->second = blit->second;
+                }
+                vAffected.clear();
+            }
+        }
+    }
+
+    // Extract block timestamps for those keys
+    for (const auto& entry : mapKeyFirstBlock) {
+        mapKeyBirth[entry.first] = entry.second->GetBlockTime() - TIMESTAMP_WINDOW; // block times can be 2h off
+    }
+}
+
+bool CWallet::EraseDestData(const CTxDestination &dest, const std::string &key)
+{
+    if (!mapAddressBook[dest].destdata.erase(key))
+        return false;
+    if (!fFileBacked)
+        return true;
+    KeyIO keyIO(Params());
+    return CWalletDB(strWalletFile).EraseDestData(keyIO.EncodeDestination(dest), key);
+}
+
+bool CWallet::LoadDestData(const CTxDestination &dest, const std::string &key, const std::string &value)
+{
+    mapAddressBook[dest].destdata.insert(std::make_pair(key, value));
+    return true;
+}
+
+bool CWallet::GetDestData(const CTxDestination &dest, const std::string &key, std::string *value) const
+{
+    std::map<CTxDestination, CAddressBookData>::const_iterator i = mapAddressBook.find(dest);
+    if(i != mapAddressBook.end())
+    {
+        CAddressBookData::StringMap::const_iterator j = i->second.destdata.find(key);
+        if(j != i->second.destdata.end())
+        {
+            if(value)
+                *value = j->second;
+            return true;
+        }
+    }
+    return false;
+}
+
+std::string CWallet::GetWalletHelpString(bool showDebug)
+{
+    std::string strUsage = HelpMessageGroup(_("Wallet options:"));
+    strUsage += HelpMessageOpt("-disablewallet", _("Do not load the wallet and disable wallet RPC calls"));
+    strUsage += HelpMessageOpt("-keypool=<n>", strprintf(_("Set key pool size to <n> (default: %u)"), DEFAULT_KEYPOOL_SIZE));
+    strUsage += HelpMessageOpt("-migration", _("Enable the Sprout to Sapling migration"));
+    strUsage += HelpMessageOpt("-migrationdestaddress=<zaddr>", _("Set the Sapling migration address"));
+    strUsage += HelpMessageOpt("-mintxfee=<amt>", strprintf(_("Fees (in %s/kB) smaller than this are considered zero fee for transaction creation (default: %s)"),
+                                                            CURRENCY_UNIT, FormatMoney(DEFAULT_TRANSACTION_MINFEE)));
+    strUsage += HelpMessageOpt("-orchardactionlimit=<n>", strprintf(_("Set the maximum number of Orchard actions permitted in a transaction (default %u)"), DEFAULT_ORCHARD_ACTION_LIMIT));
+    strUsage += HelpMessageOpt("-paytxfee=<amt>", strprintf(_("Fee (in %s/kB) to add to transactions you send (default: %s)"),
+                                                            CURRENCY_UNIT, FormatMoney(payTxFee.GetFeePerK())));
+    strUsage += HelpMessageOpt("-rescan", _("Rescan the block chain for missing wallet transactions on startup"));
+    strUsage += HelpMessageOpt("-salvagewallet", _("Attempt to recover private keys from a corrupt wallet on startup (implies -rescan)"));
+    strUsage += HelpMessageOpt("-sendfreetransactions", strprintf(_("Send transactions as zero-fee transactions if possible (default: %u)"), DEFAULT_SEND_FREE_TRANSACTIONS));
+    strUsage += HelpMessageOpt("-spendzeroconfchange", strprintf(_("Spend unconfirmed change when sending transactions (default: %u)"), DEFAULT_SPEND_ZEROCONF_CHANGE));
+    strUsage += HelpMessageOpt("-txconfirmtarget=<n>", strprintf(_("If paytxfee is not set, include enough fee so transactions begin confirmation on average within n blocks (default: %u)"), DEFAULT_TX_CONFIRM_TARGET));
+    strUsage += HelpMessageOpt("-txexpirydelta", strprintf(_("Set the number of blocks after which a transaction that has not been mined will become invalid (min: %u, default: %u (pre-Blossom) or %u (post-Blossom))"), TX_EXPIRING_SOON_THRESHOLD + 1, DEFAULT_PRE_BLOSSOM_TX_EXPIRY_DELTA, DEFAULT_POST_BLOSSOM_TX_EXPIRY_DELTA));
+    strUsage += HelpMessageOpt("-upgradewallet", _("Upgrade wallet to latest format on startup"));
+    strUsage += HelpMessageOpt("-wallet=<file>", _("Specify wallet file absolute path or a path relative to the data directory") + " " + strprintf(_("(default: %s)"), DEFAULT_WALLET_DAT));
+    strUsage += HelpMessageOpt("-walletbroadcast", _("Make the wallet broadcast transactions") + " " + strprintf(_("(default: %u)"), DEFAULT_WALLETBROADCAST));
+    strUsage += HelpMessageOpt("-walletnotify=<cmd>", _("Execute command when a wallet transaction changes (%s in cmd is replaced by TxID)"));
+    strUsage += HelpMessageOpt("-zapwallettxes=<mode>", _("Delete all wallet transactions and only recover those parts of the blockchain through -rescan on startup") +
+                               " " + _("(1 = keep tx meta data e.g. account owner and payment request information, 2 = drop tx meta data)"));
+    strUsage += HelpMessageOpt("-walletrequirebackup=<bool>", _("By default, the wallet will not allow generation of new spending keys & addresses from the mnemonic seed until the backup of that seed has been confirmed with the `zcashd-wallet-tool` utility. A user may start zcashd with `-walletrequirebackup=false` to allow generation of spending keys even if the backup has not yet been confirmed."));
+
+    if (showDebug)
+    {
+        strUsage += HelpMessageGroup(_("Wallet debugging/testing options:"));
+
+        strUsage += HelpMessageOpt("-dblogsize=<n>", strprintf("Flush wallet database activity from memory to disk log every <n> megabytes (default: %u)", DEFAULT_WALLET_DBLOGSIZE));
+        strUsage += HelpMessageOpt("-flushwallet", strprintf("Run a thread to flush wallet periodically (default: %u)", DEFAULT_FLUSHWALLET));
+        strUsage += HelpMessageOpt("-privdb", strprintf("Sets the DB_PRIVATE flag in the wallet db environment (default: %u)", DEFAULT_WALLET_PRIVDB));
+    }
+
+    return strUsage;
+}
+
+bool CWallet::InitLoadWallet(const CChainParams& params, bool clearWitnessCaches)
+{
+    std::string walletFile = GetArg("-wallet", DEFAULT_WALLET_DAT);
+
+    // needed to restore wallet transaction meta data after -zapwallettxes
+    std::vector<CWalletTx> vWtx;
+
+    if (GetBoolArg("-zapwallettxes", false)) {
+        uiInterface.InitMessage(_("Zapping all transactions from wallet..."));
+
+        CWallet *tempWallet = new CWallet(params, walletFile);
+        DBErrors nZapWalletRet = tempWallet->ZapWalletTx(vWtx);
+        if (nZapWalletRet != DB_LOAD_OK) {
+            return UIError(strprintf(_("Error loading %s: Wallet corrupted"), walletFile));
+        }
+
+        delete tempWallet;
+        tempWallet = NULL;
+    }
+
+    uiInterface.InitMessage(_("Loading wallet..."));
+
+    int64_t nStart = GetTimeMillis();
+    bool fFirstRun = true;
+    CWallet *walletInstance = new CWallet(params, walletFile);
+    DBErrors nLoadWalletRet = walletInstance->LoadWallet(fFirstRun);
+    if (nLoadWalletRet != DB_LOAD_OK)
+    {
+        if (nLoadWalletRet == DB_CORRUPT)
+            return UIError(strprintf(_("Error loading %s: Wallet corrupted"), walletFile));
+        else if (nLoadWalletRet == DB_NONCRITICAL_ERROR)
+        {
+            UIWarning(strprintf(_("Error reading %s! All keys read correctly, but transaction data"
+                                         " or address book entries might be missing or incorrect."),
+                walletFile));
+        }
+        else if (nLoadWalletRet == DB_TOO_NEW)
+            return UIError(strprintf(_("Error loading %s: Wallet requires newer version of %s"),
+                               walletFile, _(PACKAGE_NAME)));
+        else if (nLoadWalletRet == DB_NEED_REWRITE)
+        {
+            return UIError(strprintf(_("Wallet needed to be rewritten: restart %s to complete"), _(PACKAGE_NAME)));
+        }
+        else if (nLoadWalletRet == DB_WRONG_NETWORK)
+        {
+            return UIError(strprintf(_("Wallet %s is not for %s %s network"), walletFile, _(PACKAGE_NAME), params.NetworkIDString()));
+        }
+        else
+            return UIError(strprintf(_("Error loading %s"), walletFile));
+    }
+
+    if (GetBoolArg("-upgradewallet", fFirstRun))
+    {
+        int nMaxVersion = GetArg("-upgradewallet", 0);
+        if (nMaxVersion == 0) // the -upgradewallet without argument case
+        {
+            LogPrintf("Performing wallet upgrade to %i\n", FEATURE_LATEST);
+            nMaxVersion = CLIENT_VERSION;
+            walletInstance->SetMinVersion(FEATURE_LATEST); // permanently upgrade the wallet immediately
+        }
+        else
+            LogPrintf("Allowing wallet upgrade up to %i\n", nMaxVersion);
+        if (nMaxVersion < walletInstance->GetVersion())
+        {
+            return UIError(_("Cannot downgrade wallet"));
+        }
+        walletInstance->SetMaxVersion(nMaxVersion);
+    }
+
+    if (!walletInstance->HaveMnemonicSeed())
+    {
+        // We can't set the new HD seed until the wallet is decrypted.
+        // https://github.com/zcash/zcash/issues/3607
+        if (!walletInstance->IsCrypted()) {
+            // generate a new HD seed
+            walletInstance->GenerateNewSeed();
+        }
+    }
+
+    // Set sapling migration status
+    walletInstance->fSaplingMigrationEnabled = GetBoolArg("-migration", false);
+
+    if (fFirstRun)
+    {
+        // Create new keyUser and set as default key
+        if (!walletInstance->IsCrypted()) {
+            LOCK(walletInstance->cs_wallet);
+
+            CPubKey newDefaultKey = walletInstance->GenerateNewKey(true);
+            walletInstance->SetDefaultKey(newDefaultKey);
+            if (!walletInstance->SetAddressBook(walletInstance->vchDefaultKey.GetID(), "", "receive"))
+                return UIError(_("Cannot write default address") += "\n");
+        }
+
+        walletInstance->SetBestChain(chainActive.GetLocator());
+    }
+
+    LogPrintf(" wallet      %15dms\n", GetTimeMillis() - nStart);
+
+    RegisterValidationInterface(walletInstance);
+
+    CBlockIndex *pindexRescan = chainActive.Genesis();
+    if (clearWitnessCaches || GetBoolArg("-rescan", false)) {
+        walletInstance->ClearNoteWitnessCache();
+    } else {
+        CWalletDB walletdb(walletFile);
+        CBlockLocator locator;
+        if (walletdb.ReadBestBlock(locator))
+            pindexRescan = FindForkInGlobalIndex(chainActive, locator);
+    }
+
+    if (chainActive.Tip() && chainActive.Tip() != pindexRescan)
+    {
+        // We can't rescan beyond non-pruned blocks, stop and throw an error.
+        // This might happen if a user uses an old wallet within a pruned node,
+        // or if they ran -disablewallet for a longer time, then decided to re-enable.
+        if (fPruneMode)
+        {
+            CBlockIndex *block = chainActive.Tip();
+            while (block && block->pprev && (block->pprev->nStatus & BLOCK_HAVE_DATA) && block->pprev->nTx > 0 && pindexRescan != block)
+                block = block->pprev;
+
+            if (pindexRescan != block)
+                return UIError(_("Prune: last wallet synchronisation goes beyond pruned data. You need to -reindex (download the whole blockchain again in case of pruned node)"));
+        }
+
+        // If a rescan would begin at a point before NU5 activation height, reset
+        // the Orchard wallet state to empty.
+        if (pindexRescan->nHeight <= Params().GetConsensus().GetActivationHeight(Consensus::UPGRADE_NU5)) {
+            walletInstance->orchardWallet.Reset();
+        }
+
+        uiInterface.InitMessage(_("Rescanning..."));
+        LogPrintf(
+                "CWallet::InitLoadWallet(): Rescanning last %i blocks (from block %i)...\n",
+                chainActive.Height() - pindexRescan->nHeight,
+                pindexRescan->nHeight);
+        nStart = GetTimeMillis();
+        walletInstance->ScanForWalletTransactions(pindexRescan, true, true);
+        LogPrintf(" rescan      %15dms\n", GetTimeMillis() - nStart);
+        walletInstance->SetBestChain(chainActive.GetLocator());
+        CWalletDB::IncrementUpdateCounter();
+
+        // Restore wallet transaction metadata after -zapwallettxes=1
+        if (GetBoolArg("-zapwallettxes", false) && GetArg("-zapwallettxes", "1") != "2")
+        {
+            CWalletDB walletdb(walletFile);
+
+            for (const CWalletTx& wtxOld : vWtx)
+            {
+                uint256 hash = wtxOld.GetHash();
+                std::map<uint256, CWalletTx>::iterator mi = walletInstance->mapWallet.find(hash);
+                if (mi != walletInstance->mapWallet.end())
+                {
+                    const CWalletTx* copyFrom = &wtxOld;
+                    CWalletTx* copyTo = &mi->second;
+                    copyTo->mapValue = copyFrom->mapValue;
+                    copyTo->vOrderForm = copyFrom->vOrderForm;
+                    copyTo->nTimeReceived = copyFrom->nTimeReceived;
+                    copyTo->nTimeSmart = copyFrom->nTimeSmart;
+                    copyTo->fFromMe = copyFrom->fFromMe;
+                    copyTo->nOrderPos = copyFrom->nOrderPos;
+                    walletdb.WriteTx(*copyTo);
+                }
+            }
+        }
+    }
+    walletInstance->SetBroadcastTransactions(GetBoolArg("-walletbroadcast", DEFAULT_WALLETBROADCAST));
+
+    pwalletMain = walletInstance;
+    return true;
+}
+
+bool CWallet::ParameterInteraction(const CChainParams& params)
+{
+    if (mapArgs.count("-mintxfee"))
+    {
+        CAmount n = 0;
+        if (ParseMoney(mapArgs["-mintxfee"], n) && n > 0)
+            CWallet::minTxFee = CFeeRate(n);
+        else
+            return UIError(AmountErrMsg("mintxfee", mapArgs["-mintxfee"]));
+    }
+    if (mapArgs.count("-paytxfee"))
+    {
+        CAmount nFeePerK = 0;
+        if (!ParseMoney(mapArgs["-paytxfee"], nFeePerK))
+            return UIError(AmountErrMsg("paytxfee", mapArgs["-paytxfee"]));
+        if (nFeePerK > HIGH_TX_FEE_PER_KB)
+            UIWarning(_("-paytxfee is set very high! This is the transaction fee you will pay if you send a transaction."));
+        payTxFee = CFeeRate(nFeePerK, 1000);
+        if (payTxFee < ::minRelayTxFee)
+        {
+            return UIError(strprintf(_("Invalid amount for -paytxfee=<amount>: '%s' (must be at least %s)"),
+                                       mapArgs["-paytxfee"], ::minRelayTxFee.ToString()));
+        }
+    }
+    if (mapArgs.count("-maxtxfee"))
+    {
+        CAmount nMaxFee = 0;
+        if (!ParseMoney(mapArgs["-maxtxfee"], nMaxFee))
+            return UIError(AmountErrMsg("maxtxfee", mapArgs["-maxtxfee"]));
+        if (nMaxFee > HIGH_MAX_TX_FEE)
+            UIWarning(_("-maxtxfee is set very high! Fees this large could be paid on a single transaction."));
+        maxTxFee = nMaxFee;
+        if (CFeeRate(maxTxFee, 1000) < ::minRelayTxFee)
+        {
+            return UIError(strprintf(_("Invalid amount for -maxtxfee=<amount>: '%s' (must be at least the minrelay fee of %s to prevent stuck transactions)"),
+                                       mapArgs["-maxtxfee"], ::minRelayTxFee.ToString()));
+        }
+    }
+    nTxConfirmTarget = GetArg("-txconfirmtarget", DEFAULT_TX_CONFIRM_TARGET);
+    if (mapArgs.count("-txexpirydelta")) {
+        int64_t expiryDelta = atoi64(mapArgs["-txexpirydelta"]);
+        uint32_t minExpiryDelta = TX_EXPIRING_SOON_THRESHOLD + 1;
+        if (expiryDelta < minExpiryDelta) {
+            return UIError(strprintf(_("Invalid value for -txexpirydelta='%u' (must be least %u)"), expiryDelta, minExpiryDelta));
+        }
+        expiryDeltaArg = expiryDelta;
+    }
+    bSpendZeroConfChange = GetBoolArg("-spendzeroconfchange", DEFAULT_SPEND_ZEROCONF_CHANGE);
+    fSendFreeTransactions = GetBoolArg("-sendfreetransactions", DEFAULT_SEND_FREE_TRANSACTIONS);
+
+    KeyIO keyIO(params);
+    // Check Sapling migration address if set and is a valid Sapling address
+    if (mapArgs.count("-migrationdestaddress")) {
+        std::string migrationDestAddress = mapArgs["-migrationdestaddress"];
+        std::optional<libzcash::PaymentAddress> address = keyIO.DecodePaymentAddress(migrationDestAddress);
+        if (!address.has_value() || std::get_if<libzcash::SaplingPaymentAddress>(&address.value()) == nullptr) {
+            return UIError(_("-migrationdestaddress must be a valid Sapling address."));
+        }
+    }
+    if (mapArgs.count("-anchorconfirmations")) {
+        int64_t confirmations = atoi64(mapArgs["-anchorconfirmations"]);
+        if (confirmations < 1) {
+            return UIError(strprintf(_("Invalid value for -anchorconfirmations='%u' (must be least 1)"), confirmations));
+        }
+        if (confirmations > 100) {
+            return UIError(strprintf(_("Invalid value for -anchorconfirmations='%u' (must be at most 100)"), confirmations));
+        }
+        nAnchorConfirmations = confirmations;
+    }
+    if (mapArgs.count("-orchardactionlimit")) {
+        int64_t limit = atoi64(mapArgs["-orchardactionlimit"]);
+        if (limit < 1) {
+            return UIError(strprintf(_("Invalid value for -orchardactionlimit='%u' (must be least 1)"), limit));
+        }
+        nOrchardActionLimit = limit;
+    }
+
+    return true;
+}
+
+CKeyPool::CKeyPool()
+{
+    nTime = GetTime();
+}
+
+CKeyPool::CKeyPool(const CPubKey& vchPubKeyIn)
+{
+    nTime = GetTime();
+    vchPubKey = vchPubKeyIn;
+}
+
+CWalletKey::CWalletKey(int64_t nExpires)
+{
+    nTimeCreated = (nExpires ? GetTime() : 0);
+    nTimeExpires = nExpires;
+}
+
+void CMerkleTx::SetMerkleBranch(const CBlock& block)
+{
+    CBlock blockTmp;
+
+    // Update the tx's hashBlock
+    hashBlock = block.GetHash();
+
+    // Locate the transaction
+    for (nIndex = 0; nIndex < (int)block.vtx.size(); nIndex++)
+        if (block.vtx[nIndex] == *(CTransaction*)this)
+            break;
+    if (nIndex == (int)block.vtx.size())
+    {
+        vMerkleBranch.clear();
+        nIndex = -1;
+        LogPrintf("ERROR: SetMerkleBranch(): couldn't find tx in block\n");
+    }
+
+    // Fill in merkle branch
+    vMerkleBranch = block.GetMerkleBranch(nIndex);
+}
+
+int CMerkleTx::GetDepthInMainChainINTERNAL(const CBlockIndex* &pindexRet) const
+{
+    if (hashBlock.IsNull() || nIndex == -1)
+        return 0;
+    AssertLockHeld(cs_main);
+
+    // Find the block it claims to be in
+    BlockMap::iterator mi = mapBlockIndex.find(hashBlock);
+    if (mi == mapBlockIndex.end())
+        return 0;
+    CBlockIndex* pindex = (*mi).second;
+    if (!pindex || !chainActive.Contains(pindex))
+        return 0;
+
+    // Make sure the merkle branch connects to this block
+    if (!fMerkleVerified)
+    {
+        if (CBlock::CheckMerkleBranch(GetHash(), vMerkleBranch, nIndex) != pindex->hashMerkleRoot)
+            return 0;
+        fMerkleVerified = true;
+    }
+
+    pindexRet = pindex;
+    return chainActive.Height() - pindex->nHeight + 1;
+}
+
+int CMerkleTx::GetDepthInMainChain(const CBlockIndex* &pindexRet) const
+{
+    AssertLockHeld(cs_main);
+    int nResult = GetDepthInMainChainINTERNAL(pindexRet);
+    if (nResult == 0 && !mempool.exists(GetHash()))
+        return -1; // Not in chain, not in mempool
+
+    return nResult;
+}
+
+int CMerkleTx::GetBlocksToMaturity() const
+{
+    if (!IsCoinBase())
+        return 0;
+    return max(0, (COINBASE_MATURITY+1) - GetDepthInMainChain());
+}
+
+
+bool CMerkleTx::AcceptToMemoryPool(bool fLimitFree, bool fRejectAbsurdFee)
+{
+    CValidationState state;
+    return ::AcceptToMemoryPool(Params(), mempool, state, *this, fLimitFree, NULL, fRejectAbsurdFee);
+}
+
+NoteFilter NoteFilter::ForPaymentAddresses(const std::vector<libzcash::PaymentAddress>& paymentAddrs) {
+    NoteFilter addrs;
+    for (const auto& addr: paymentAddrs) {
+        std::visit(match {
+            [&](const CKeyID& keyId) { },
+            [&](const CScriptID& scriptId) { },
+            [&](const libzcash::SproutPaymentAddress& addr) {
+                addrs.sproutAddresses.insert(addr);
+            },
+            [&](const libzcash::SaplingPaymentAddress& addr) {
+                addrs.saplingAddresses.insert(addr);
+            },
+            [&](const libzcash::UnifiedAddress& uaddr) {
+                for (auto& receiver : uaddr) {
+                    std::visit(match {
+                        [&](const libzcash::OrchardRawAddress& addr) {
+                            addrs.orchardAddresses.insert(addr);
+                        },
+                        [&](const libzcash::SaplingPaymentAddress& addr) {
+                            addrs.saplingAddresses.insert(addr);
+                        },
+                        [&](const auto& other) { }
+                    }, receiver);
+                }
+            },
+        }, addr);
+    }
+    return addrs;
+}
+
+bool CWallet::HasSpendingKeys(const NoteFilter& addrSet) const {
+    for (const auto& zaddr : addrSet.GetSproutAddresses()) {
+        if (!HaveSproutSpendingKey(zaddr)) {
+            return false;
+        }
+    }
+
+    for (const auto& zaddr : addrSet.GetSaplingAddresses()) {
+        if (!HaveSaplingSpendingKeyForAddress(zaddr)) {
+            return false;
+        }
+    }
+
+    for (const auto& addr : addrSet.GetOrchardAddresses()) {
+        if (!HaveOrchardSpendingKeyForAddress(addr)) {
+            return false;
+        }
+    }
+
+    return true;
+}
+
+bool CWallet::HaveOrchardSpendingKeyForAddress(
+        const OrchardRawAddress &addr) const {
+    return orchardWallet.GetSpendingKeyForAddress(addr).has_value();
+}
+
+/**
+ * Find notes in the wallet filtered by payment addresses, min depth, max depth,
+ * if the note is spent, if a spending key is required, and if the notes are locked.
+ * These notes are decrypted and added to the output parameter vector, outEntries.
+ *
+ * For the `noteFilter` argument, `std::nullopt` will return every address; if a
+ * value is provided, all returned notes will correspond to the addresses in
+ * that address set. If the empty address set is provided, this function will
+ * return early and the return arguments `sproutEntries` and `saplingEntries`
+ * will be unmodified.
+ */
+void CWallet::GetFilteredNotes(
+    std::vector<SproutNoteEntry>& sproutEntriesRet,
+    std::vector<SaplingNoteEntry>& saplingEntriesRet,
+    std::vector<OrchardNoteMetadata>& orchardNotesRet,
+    const std::optional<NoteFilter>& noteFilter,
+    int minDepth,
+    int maxDepth,
+    bool ignoreSpent,
+    bool requireSpendingKey,
+    bool ignoreLocked) const
+{
+    // Don't bother to do anything if the note filter would reject all notes
+    if (noteFilter.has_value() && noteFilter.value().IsEmpty())
+        return;
+
+    LOCK2(cs_main, cs_wallet);
+
+    KeyIO keyIO(Params());
+    for (auto & p : mapWallet) {
+        CWalletTx wtx = p.second;
+
+        // Filter the transactions before checking for notes
+        if (!CheckFinalTx(wtx) ||
+            wtx.GetDepthInMainChain() < minDepth ||
+            wtx.GetDepthInMainChain() > maxDepth) {
+            continue;
+        }
+
+        // Filter coinbase transactions that don't have Sapling outputs
+        if (wtx.IsCoinBase() && wtx.mapSaplingNoteData.empty() && true/* TODO ORCHARD */) {
+            continue;
+        }
+
+        for (auto & pair : wtx.mapSproutNoteData) {
+            JSOutPoint jsop = pair.first;
+            SproutNoteData nd = pair.second;
+            SproutPaymentAddress pa = nd.address;
+
+            // skip notes which do not conform to the filter, if supplied
+            if (noteFilter.has_value() && !noteFilter.value().HasSproutAddress(pa)) {
+                continue;
+            }
+
+            // skip note which has been spent
+            if (ignoreSpent && nd.nullifier && IsSproutSpent(*nd.nullifier)) {
+                continue;
+            }
+
+            // skip notes which cannot be spent
+            if (requireSpendingKey && !HaveSproutSpendingKey(pa)) {
+                continue;
+            }
+
+            // skip locked notes
+            if (ignoreLocked && IsLockedNote(jsop)) {
+                continue;
+            }
+
+            int i = jsop.js; // Index into CTransaction.vJoinSplit
+            int j = jsop.n; // Index into JSDescription.ciphertexts
+
+            // Get cached decryptor
+            ZCNoteDecryption decryptor;
+            if (!GetNoteDecryptor(pa, decryptor)) {
+                // Note decryptors are created when the wallet is loaded, so it should always exist
+                throw std::runtime_error(strprintf("Could not find note decryptor for payment address %s", keyIO.EncodePaymentAddress(pa)));
+            }
+
+            // determine amount of funds in the note
+            auto hSig = ZCJoinSplit::h_sig(
+                wtx.vJoinSplit[i].randomSeed,
+                wtx.vJoinSplit[i].nullifiers,
+                wtx.joinSplitPubKey);
+            try {
+                SproutNotePlaintext plaintext = SproutNotePlaintext::decrypt(
+                        decryptor,
+                        wtx.vJoinSplit[i].ciphertexts[j],
+                        wtx.vJoinSplit[i].ephemeralKey,
+                        hSig,
+                        (unsigned char) j);
+
+                sproutEntriesRet.push_back(SproutNoteEntry {
+                    jsop, pa, plaintext.note(pa), plaintext.memo(), wtx.GetDepthInMainChain() });
+
+            } catch (const note_decryption_failed &err) {
+                // Couldn't decrypt with this spending key
+                throw std::runtime_error(strprintf("Could not decrypt note for payment address %s", keyIO.EncodePaymentAddress(pa)));
+            } catch (const std::exception &exc) {
+                // Unexpected failure
+                throw std::runtime_error(strprintf("Error while decrypting note for payment address %s: %s", keyIO.EncodePaymentAddress(pa), exc.what()));
+            }
+        }
+
+        for (auto & pair : wtx.mapSaplingNoteData) {
+            SaplingOutPoint op = pair.first;
+            SaplingNoteData nd = pair.second;
+
+            auto optDeserialized = SaplingNotePlaintext::attempt_sapling_enc_decryption_deserialization(wtx.vShieldedOutput[op.n].encCiphertext, nd.ivk, wtx.vShieldedOutput[op.n].ephemeralKey);
+
+            // The transaction would not have entered the wallet unless
+            // its plaintext had been successfully decrypted previously.
+            assert(optDeserialized != std::nullopt);
+
+            auto notePt = optDeserialized.value();
+            auto maybe_pa = nd.ivk.address(notePt.d);
+            assert(static_cast<bool>(maybe_pa));
+            auto pa = maybe_pa.value();
+
+            // skip notes which do not conform to the filter, if supplied
+            if (noteFilter.has_value() && !noteFilter.value().HasSaplingAddress(pa)) {
+                continue;
+            }
+
+            if (ignoreSpent && nd.nullifier.has_value() && IsSaplingSpent(nd.nullifier.value())) {
+                continue;
+            }
+
+            // skip notes which cannot be spent
+            if (requireSpendingKey && !HaveSaplingSpendingKeyForAddress(pa)) {
+                continue;
+            }
+
+            // skip locked notes
+            if (ignoreLocked && IsLockedNote(op)) {
+                continue;
+            }
+
+            auto note = notePt.note(nd.ivk).value();
+            saplingEntriesRet.push_back(SaplingNoteEntry {
+                op, pa, note, notePt.memo(), wtx.GetDepthInMainChain() });
+        }
+    }
+
+    std::vector<OrchardNoteMetadata> orchardNotes;
+    if (noteFilter.has_value()) {
+        for (const OrchardRawAddress& addr: noteFilter.value().GetOrchardAddresses()) {
+            auto ivk = orchardWallet.GetIncomingViewingKeyForAddress(addr);
+            if (ivk.has_value()) {
+                orchardWallet.GetFilteredNotes(
+                        orchardNotes,
+                        ivk.value(),
+                        ignoreSpent,
+                        requireSpendingKey);
+            }
+        }
+    } else {
+        // return all Orchard notes
+        orchardWallet.GetFilteredNotes(
+                orchardNotes,
+                std::nullopt,
+                ignoreSpent,
+                requireSpendingKey);
+    }
+
+    for (auto& noteMeta : orchardNotes) {
+        if (ignoreSpent && IsOrchardSpent(noteMeta.GetOutPoint())) {
+            continue;
+        }
+
+        auto wtx = GetWalletTx(noteMeta.GetOutPoint().hash);
+        if (wtx) {
+            auto confirmations = wtx->GetDepthInMainChain();
+            if (confirmations >= minDepth && confirmations <= maxDepth) {
+                noteMeta.SetConfirmations(confirmations);
+                orchardNotesRet.push_back(noteMeta);
+            }
+        } else {
+            throw std::runtime_error("Wallet inconsistency: We have an Orchard WalletTx without a corresponding CWalletTx");
+        }
+    }
+}
+
+std::optional<libzcash::AccountId> CWallet::GetUnifiedAccountId(const libzcash::UFVKId& ufvkId) const {
+    auto addrMetaIt = mapUfvkAddressMetadata.find(ufvkId);
+    if (addrMetaIt != mapUfvkAddressMetadata.end()) {
+        return addrMetaIt->second.GetAccountId();
+    } else {
+        return std::nullopt;
+    }
+}
+
+std::optional<UnifiedAddress> CWallet::FindUnifiedAddressByReceiver(const Receiver& receiver) const {
+    return std::visit(UnifiedAddressForReceiver(*this), receiver);
+}
+
+std::optional<libzcash::AccountId> CWallet::FindUnifiedAccountByReceiver(const Receiver& receiver) const {
+    auto ufvkMeta = GetUFVKMetadataForReceiver(receiver);
+    if (ufvkMeta.has_value()) {
+        return GetUnifiedAccountId(ufvkMeta.value().GetUFVKId());
+    } else {
+        return std::nullopt;
+    }
+}
+
+//
+// Payment address operations
+//
+
+// PaymentAddressBelongsToWallet
+
+bool PaymentAddressBelongsToWallet::operator()(const CKeyID &addr) const
+{
+    CScript script = GetScriptForDestination(addr);
+    return m_wallet->HaveKey(addr) || m_wallet->HaveWatchOnly(script);
+}
+bool PaymentAddressBelongsToWallet::operator()(const CScriptID &addr) const
+{
+    CScript script = GetScriptForDestination(addr);
+    return m_wallet->HaveCScript(addr) || m_wallet->HaveWatchOnly(script);
+}
+bool PaymentAddressBelongsToWallet::operator()(const libzcash::SproutPaymentAddress &zaddr) const
+{
+    return m_wallet->HaveSproutSpendingKey(zaddr) || m_wallet->HaveSproutViewingKey(zaddr);
+}
+bool PaymentAddressBelongsToWallet::operator()(const libzcash::SaplingPaymentAddress &zaddr) const
+{
+    libzcash::SaplingIncomingViewingKey ivk;
+    return
+        m_wallet->GetSaplingIncomingViewingKey(zaddr, ivk) &&
+        m_wallet->HaveSaplingFullViewingKey(ivk);
+}
+bool PaymentAddressBelongsToWallet::operator()(const libzcash::UnifiedAddress &uaddr) const
+{
+    return m_wallet->GetUFVKForAddress(uaddr).has_value();
+}
+
+// GetSourceForPaymentAddress
+
+PaymentAddressSource GetSourceForPaymentAddress::GetUnifiedSource(const libzcash::Receiver& receiver) const
+{
+    auto hdChain = m_wallet->GetMnemonicHDChain();
+    auto ufvkMeta = m_wallet->GetUFVKMetadataForReceiver(receiver);
+    if (ufvkMeta.has_value()) {
+        auto ufvkid = ufvkMeta.value().GetUFVKId();
+        // Look through the UFVKs that we have generated, and confirm that the
+        // seed fingerprint for the key we find for the ufvkid corresponds to
+        // the wallet's mnemonic seed.
+        for (const auto& [k, v] : m_wallet->mapUnifiedAccountKeys) {
+            if (v == ufvkid && hdChain.has_value() && k.first == hdChain.value().GetSeedFingerprint()) {
+                return PaymentAddressSource::MnemonicHDSeed;
+            }
+        }
+        return PaymentAddressSource::ImportedWatchOnly;
+    } else {
+        return PaymentAddressSource::AddressNotFound;
+    }
+}
+
+PaymentAddressSource GetSourceForPaymentAddress::operator()(const CKeyID &addr) const
+{
+    auto ufvkSource = this->GetUnifiedSource(addr);
+    if (ufvkSource == PaymentAddressSource::AddressNotFound) {
+        auto keyMeta = pwalletMain->mapKeyMetadata[addr];
+        auto account = libzcash::ParseHDKeypathAccount(44, Params().BIP44CoinType(), keyMeta.hdKeypath);
+        if (account.has_value() && account.value() == ZCASH_LEGACY_ACCOUNT) {
+            return PaymentAddressSource::MnemonicHDSeed;
+        } else if (m_wallet->HaveKey(addr)) {
+            return PaymentAddressSource::Random;
+        } else if (m_wallet->HaveWatchOnly(GetScriptForDestination(addr))) {
+            return PaymentAddressSource::ImportedWatchOnly;
+        }
+    }
+
+    return ufvkSource;
+}
+PaymentAddressSource GetSourceForPaymentAddress::operator()(const CScriptID &addr) const
+{
+    auto ufvkSource = this->GetUnifiedSource(addr);
+    if (ufvkSource == PaymentAddressSource::AddressNotFound) {
+        if (m_wallet->HaveCScript(addr)) {
+            return PaymentAddressSource::Imported;
+        } else if (m_wallet->HaveWatchOnly(GetScriptForDestination(addr))) {
+            return PaymentAddressSource::ImportedWatchOnly;
+        }
+    }
+
+    return ufvkSource;
+}
+PaymentAddressSource GetSourceForPaymentAddress::operator()(const libzcash::SproutPaymentAddress &zaddr) const
+{
+    if (m_wallet->HaveSproutSpendingKey(zaddr)) {
+        return PaymentAddressSource::Random;
+    } else if (m_wallet->HaveSproutViewingKey(zaddr)) {
+        return PaymentAddressSource::ImportedWatchOnly;
+    } else {
+        return PaymentAddressSource::AddressNotFound;
+    }
+}
+PaymentAddressSource GetSourceForPaymentAddress::operator()(const libzcash::SaplingPaymentAddress &zaddr) const
+{
+    auto ufvkSource = this->GetUnifiedSource(zaddr);
+    if (ufvkSource == PaymentAddressSource::AddressNotFound) {
+        libzcash::SaplingIncomingViewingKey ivk;
+
+        // If we have a SaplingExtendedSpendingKey in the wallet, then we will
+        // also have the corresponding SaplingExtendedFullViewingKey.
+        if (m_wallet->GetSaplingIncomingViewingKey(zaddr, ivk)) {
+            if (m_wallet->HaveSaplingFullViewingKey(ivk)) {
+                // If we have the HD keypath, it's related to a seed.
+                if (m_wallet->mapSaplingZKeyMetadata.count(ivk) > 0 &&
+                        m_wallet->mapSaplingZKeyMetadata[ivk].hdKeypath != "") {
+                    // The following keypaths have been used in zcashd:
+                    // - Legacy seed:     m/32'/coin_type'/account_counter'
+                    // - Mnemonic phrase: m/32'/coin_type'/ZCASH_LEGACY_ACCOUNT'/account_counter'
+                    //
+                    // Thus if the keypath uses account ZCASH_LEGACY_ACCOUNT and
+                    // is longer than "m/32'/coin_type'/ZCASH_LEGACY_ACCOUNT'",
+                    // it is derived from the mnemonic.
+                    auto account = libzcash::ParseHDKeypathAccount(
+                        32, Params().BIP44CoinType(), m_wallet->mapSaplingZKeyMetadata[ivk].hdKeypath);
+                    if (account.has_value() &&
+                        account.value() == ZCASH_LEGACY_ACCOUNT && (
+                            libzcash::Zip32AccountKeyPath(Params().BIP44CoinType(), ZCASH_LEGACY_ACCOUNT).size()
+                            < m_wallet->mapSaplingZKeyMetadata[ivk].hdKeypath.size()
+                        ))
+                    {
+                        return PaymentAddressSource::MnemonicHDSeed;
+                    } else {
+                        return PaymentAddressSource::LegacyHDSeed;
+                    }
+                } else if (m_wallet->HaveSaplingSpendingKeyForAddress(zaddr)) {
+                    return PaymentAddressSource::Imported;
+                } else {
+                    return PaymentAddressSource::ImportedWatchOnly;
+                }
+            } else {
+                return PaymentAddressSource::ImportedWatchOnly;
+            }
+        }
+    }
+
+    return ufvkSource;
+}
+PaymentAddressSource GetSourceForPaymentAddress::operator()(const libzcash::UnifiedAddress &uaddr) const
+{
+    auto hdChain = m_wallet->GetMnemonicHDChain();
+    auto ufvkMeta = m_wallet->GetUFVKMetadataForAddress(uaddr);
+    if (ufvkMeta.has_value()) {
+        // Look through the UFVKs that we have generated, and confirm that the
+        // seed fingerprint for the key we find for the ufvkMeta corresponds to
+        // the wallet's mnemonic seed.
+        for (const auto& [k, v] : m_wallet->mapUnifiedAccountKeys) {
+            if (v == ufvkMeta.value().GetUFVKId() && hdChain.has_value() && k.first == hdChain.value().GetSeedFingerprint()) {
+                return PaymentAddressSource::MnemonicHDSeed;
+            }
+        }
+        return PaymentAddressSource::ImportedWatchOnly;
+    } else {
+        return PaymentAddressSource::AddressNotFound;
+    }
+}
+
+// GetViewingKeyForPaymentAddress
+
+std::optional<libzcash::ViewingKey> GetViewingKeyForPaymentAddress::operator()(
+    const CKeyID &zaddr) const
+{
+    return std::nullopt;
+}
+std::optional<libzcash::ViewingKey> GetViewingKeyForPaymentAddress::operator()(
+    const CScriptID &zaddr) const
+{
+    return std::nullopt;
+}
+
+// GetViewingKeyForPaymentAddress visitor
+
+std::optional<libzcash::ViewingKey> GetViewingKeyForPaymentAddress::operator()(
+    const libzcash::SproutPaymentAddress &zaddr) const
+{
+    libzcash::SproutViewingKey vk;
+    if (!m_wallet->GetSproutViewingKey(zaddr, vk)) {
+        libzcash::SproutSpendingKey k;
+        if (!m_wallet->GetSproutSpendingKey(zaddr, k)) {
+            return std::nullopt;
+        }
+        vk = k.viewing_key();
+    }
+    return libzcash::ViewingKey(vk);
+}
+std::optional<libzcash::ViewingKey> GetViewingKeyForPaymentAddress::operator()(
+    const libzcash::SaplingPaymentAddress &zaddr) const
+{
+    libzcash::SaplingIncomingViewingKey ivk;
+    libzcash::SaplingExtendedFullViewingKey extfvk;
+
+    if (m_wallet->GetSaplingIncomingViewingKey(zaddr, ivk) &&
+        m_wallet->GetSaplingFullViewingKey(ivk, extfvk))
+    {
+        return libzcash::ViewingKey(extfvk);
+    } else {
+        return std::nullopt;
+    }
+}
+std::optional<libzcash::ViewingKey> GetViewingKeyForPaymentAddress::operator()(
+    const libzcash::UnifiedAddress &uaddr) const
+{
+    auto zufvk = m_wallet->GetUFVKForAddress(uaddr);
+    if (!zufvk.has_value()) return std::nullopt;
+    return zufvk.value().ToFullViewingKey();
+}
+
+// AddViewingKeyToWallet
+
+KeyAddResult AddViewingKeyToWallet::operator()(const libzcash::SproutViewingKey &vkey) const {
+    auto addr = vkey.address();
+
+    if (m_wallet->HaveSproutSpendingKey(addr)) {
+        return SpendingKeyExists;
+    } else if (m_wallet->HaveSproutViewingKey(addr)) {
+        return KeyAlreadyExists;
+    } else if (m_wallet->AddSproutViewingKey(vkey)) {
+        return KeyAdded;
+    } else {
+        return KeyNotAdded;
+    }
+}
+KeyAddResult AddViewingKeyToWallet::operator()(const libzcash::SaplingExtendedFullViewingKey &extfvk) const {
+    if (m_wallet->HaveSaplingSpendingKey(extfvk)) {
+        return SpendingKeyExists;
+    } else if (m_wallet->HaveSaplingFullViewingKey(extfvk.ToIncomingViewingKey())) {
+        return KeyAlreadyExists;
+    } else if (
+            m_wallet->AddSaplingFullViewingKey(extfvk) &&
+            (!addDefaultAddress || m_wallet->AddSaplingPaymentAddress(extfvk.ToIncomingViewingKey(), extfvk.DefaultAddress()))) {
+        return KeyAdded;
+    } else {
+        return KeyNotAdded;
+    }
+}
+KeyAddResult AddViewingKeyToWallet::operator()(const libzcash::UnifiedFullViewingKey& no) const {
+    throw JSONRPCError(RPC_INVALID_ADDRESS_OR_KEY, "Unified full viewing key import is not yet supported.");
+}
+
+// AddSpendingKeyToWallet
+
+KeyAddResult AddSpendingKeyToWallet::operator()(const libzcash::SproutSpendingKey &sk) const {
+    auto addr = sk.address();
+    KeyIO keyIO(Params());
+    if (log){
+        LogPrint("zrpc", "Importing zaddr %s...\n", keyIO.EncodePaymentAddress(addr));
+    }
+    if (m_wallet->HaveSproutSpendingKey(addr)) {
+        return KeyAlreadyExists;
+    } else if (m_wallet-> AddSproutZKey(sk)) {
+        m_wallet->mapSproutZKeyMetadata[addr].nCreateTime = nTime;
+        return KeyAdded;
+    } else {
+        return KeyNotAdded;
+    }
+}
+KeyAddResult AddSpendingKeyToWallet::operator()(const libzcash::SaplingExtendedSpendingKey &sk) const {
+    auto extfvk = sk.ToXFVK();
+    auto ivk = extfvk.ToIncomingViewingKey();
+    auto addr = extfvk.DefaultAddress();
+    KeyIO keyIO(Params());
+    if (log){
+        LogPrint("zrpc", "Importing zaddr %s...\n", keyIO.EncodePaymentAddress(addr));
+    }
+    // Don't throw error in case a key is already there
+    if (m_wallet->HaveSaplingSpendingKey(extfvk)) {
+        return KeyAlreadyExists;
+    } else {
+        if (!(
+            m_wallet->AddSaplingZKey(sk) &&
+            (!addDefaultAddress || m_wallet->AddSaplingPaymentAddress(ivk, addr))
+        )) {
+            return KeyNotAdded;
+        }
+
+        // Sapling addresses can't have been used in transactions prior to activation.
+        if (params.vUpgrades[Consensus::UPGRADE_SAPLING].nActivationHeight == Consensus::NetworkUpgrade::ALWAYS_ACTIVE) {
+            m_wallet->mapSaplingZKeyMetadata[ivk].nCreateTime = nTime;
+        } else {
+            // 154051200 seconds from epoch is Friday, 26 October 2018 00:00:00 GMT - definitely before Sapling activates
+            m_wallet->mapSaplingZKeyMetadata[ivk].nCreateTime = std::max((int64_t) 154051200, nTime);
+        }
+        if (hdKeypath.has_value()) {
+            m_wallet->mapSaplingZKeyMetadata[ivk].hdKeypath = hdKeypath.value();
+        }
+        if (seedFpStr.has_value()) {
+            uint256 seedFp;
+            seedFp.SetHex(seedFpStr.value());
+            m_wallet->mapSaplingZKeyMetadata[ivk].seedFp = seedFp;
+        }
+        return KeyAdded;
+    }
+}
+
+// UFVKForReceiver :: (CWallet&, Receiver) -> std::optional<ZcashdUnifiedFullViewingKey>
+
+std::optional<libzcash::ZcashdUnifiedFullViewingKey> UFVKForReceiver::operator()(const libzcash::OrchardRawAddress& orchardAddr) const {
+    auto ufvkMeta = wallet.GetUFVKMetadataForReceiver(orchardAddr);
+    if (ufvkMeta.has_value()) {
+        auto ufvkid = ufvkMeta.value().GetUFVKId();
+        auto ufvk = wallet.GetUnifiedFullViewingKey(ufvkid);
+        // If we have UFVK metadata, `GetUnifiedFullViewingKey` should always
+        // return a non-nullopt value, and since we obtained that metadata by
+        // lookup from an Orchard address, it should have a Orchard key component.
+        assert(ufvk.has_value() && ufvk.value().GetOrchardKey().has_value());
+        return ufvk.value();
+    } else {
+        return std::nullopt;
+    }
+}
+std::optional<libzcash::ZcashdUnifiedFullViewingKey> UFVKForReceiver::operator()(const libzcash::SaplingPaymentAddress& saplingAddr) const {
+    auto ufvkMeta = wallet.GetUFVKMetadataForReceiver(saplingAddr);
+    if (ufvkMeta.has_value()) {
+        auto ufvkid = ufvkMeta.value().GetUFVKId();
+        auto ufvk = wallet.GetUnifiedFullViewingKey(ufvkid);
+        // If we have UFVK metadata, `GetUnifiedFullViewingKey` should always
+        // return a non-nullopt value, and since we obtained that metadata by
+        // lookup from as Sapling address, it should have a Sapling key component.
+        assert(ufvk.has_value() && ufvk.value().GetSaplingKey().has_value());
+        return ufvk.value();
+    } else {
+        return std::nullopt;
+    }
+}
+std::optional<libzcash::ZcashdUnifiedFullViewingKey> UFVKForReceiver::operator()(const CScriptID& scriptId) const {
+    // We do not currently generate unified addresses containing P2SH components,
+    // so there's nothing to look up here.
+    return std::nullopt;
+}
+std::optional<libzcash::ZcashdUnifiedFullViewingKey> UFVKForReceiver::operator()(const CKeyID& keyId) const {
+    auto ufvkMeta = wallet.GetUFVKMetadataForReceiver(keyId);
+    if (ufvkMeta.has_value()) {
+        auto ufvkid = ufvkMeta.value().GetUFVKId();
+        // transparent address UFVK metadata is always accompanied by the child
+        // index at which the address was produced
+        assert(ufvkMeta.value().GetDiversifierIndex().has_value());
+        auto ufvk = wallet.GetUnifiedFullViewingKey(ufvkid);
+        assert(ufvk.has_value() && ufvk.value().GetTransparentKey().has_value());
+        return ufvk.value();
+    } else {
+        return std::nullopt;
+    }
+}
+std::optional<libzcash::ZcashdUnifiedFullViewingKey> UFVKForReceiver::operator()(const libzcash::UnknownReceiver& receiver) const {
+    return std::nullopt;
+}
+
+// UnifiedAddressForReceiver :: (CWallet&, Receiver) -> std::optional<UnifiedAddress>
+
+std::optional<libzcash::UnifiedAddress> UnifiedAddressForReceiver::operator()(
+        const libzcash::OrchardRawAddress& orchardAddr) const {
+    auto ufvkMeta = wallet.GetUFVKMetadataForReceiver(orchardAddr);
+    if (ufvkMeta.has_value()) {
+        auto ufvkid = ufvkMeta.value().GetUFVKId();
+        auto ufvk = wallet.GetUnifiedFullViewingKey(ufvkid);
+        assert(ufvk.has_value());
+
+        // If the wallet is missing metadata at this UFVK id, it is probably
+        // corrupt and the node should shut down.
+        const auto& metadata = wallet.mapUfvkAddressMetadata.at(ufvkid);
+        auto orchardKey = ufvk.value().GetOrchardKey();
+        if (orchardKey.has_value()) {
+            auto j = orchardKey.value().ToIncomingViewingKey().DecryptDiversifier(orchardAddr);
+            if (j.has_value()) {
+                auto receivers = metadata.GetReceivers(j.value());
+                if (receivers.has_value()) {
+                    auto addr = ufvk.value().Address(j.value(), receivers.value());
+                    auto addrPtr = std::get_if<std::pair<UnifiedAddress, diversifier_index_t>>(&addr);
+                    if (addrPtr != nullptr) {
+                        return addrPtr->first;
+                    }
+                }
+            }
+        }
+    }
+    return std::nullopt;
+}
+
+std::optional<libzcash::UnifiedAddress> UnifiedAddressForReceiver::operator()(const libzcash::SaplingPaymentAddress& saplingAddr) const {
+    auto ufvkMeta = wallet.GetUFVKMetadataForReceiver(saplingAddr);
+    if (ufvkMeta.has_value()) {
+        auto ufvkid = ufvkMeta.value().GetUFVKId();
+        auto ufvk = wallet.GetUnifiedFullViewingKey(ufvkid);
+        assert(ufvk.has_value());
+
+        // If the wallet is missing metadata at this UFVK id, it is probably
+        // corrupt and the node should shut down.
+        const auto& metadata = wallet.mapUfvkAddressMetadata.at(ufvkid);
+        auto saplingKey = ufvk.value().GetSaplingKey();
+        if (saplingKey.has_value()) {
+            auto j = saplingKey.value().DecryptDiversifier(saplingAddr);
+            if (j.has_value()) {
+                auto receivers = metadata.GetReceivers(j.value().first);
+                // Only return a unified address for external addresses
+                if (receivers.has_value() && j.value().second) {
+                    auto addr = ufvk.value().Address(j.value().first, receivers.value());
+                    auto addrPtr = std::get_if<std::pair<UnifiedAddress, diversifier_index_t>>(&addr);
+                    if (addrPtr != nullptr) {
+                        return addrPtr->first;
+                    }
+                }
+            }
+        }
+    }
+    return std::nullopt;
+}
+std::optional<libzcash::UnifiedAddress> UnifiedAddressForReceiver::operator()(const CScriptID& scriptId) const {
+    // We do not currently generate unified addresses containing P2SH components,
+    // so there's nothing to look up here.
+    return std::nullopt;
+}
+std::optional<libzcash::UnifiedAddress> UnifiedAddressForReceiver::operator()(const CKeyID& keyId) const {
+    auto ufvkMeta = wallet.GetUFVKMetadataForReceiver(keyId);
+    if (ufvkMeta.has_value()) {
+        auto ufvkid = ufvkMeta.value().GetUFVKId();
+        // transparent address UFVK metadata is always accompanied by the child
+        // index at which the address was produced
+        assert(ufvkMeta.value().GetDiversifierIndex().has_value());
+        diversifier_index_t j = ufvkMeta.value().GetDiversifierIndex().value();
+        auto ufvk = wallet.GetUnifiedFullViewingKey(ufvkid);
+        if (!(ufvk.has_value() && ufvk.value().GetTransparentKey().has_value())) {
+            throw std::runtime_error("CWallet::UnifiedAddressForReceiver(): UFVK has no P2PKH key part.");
+        }
+
+        // If the wallet is missing metadata at this UFVK id, it is probably
+        // corrupt and the node should shut down.
+        const auto& metadata = wallet.mapUfvkAddressMetadata.at(ufvkid);
+
+        // Find the set of receivers at the diversifier index. If we do not
+        // know the receiver types for the address produced at this
+        // diversifier, we cannot reconstruct the address.
+        auto receivers = metadata.GetReceivers(j);
+        if (receivers.has_value()) {
+            auto addr = ufvk.value().Address(j, receivers.value());
+            auto addrPtr = std::get_if<std::pair<UnifiedAddress, diversifier_index_t>>(&addr);
+            if (addrPtr != nullptr) {
+                return addrPtr->first;
+            }
+        }
+    }
+
+    return std::nullopt;
+}
+std::optional<libzcash::UnifiedAddress> UnifiedAddressForReceiver::operator()(const libzcash::UnknownReceiver& receiver) const {
+    return std::nullopt;
+}
+
+std::optional<TransactionStrategy> TransactionStrategy::FromString(std::string privacyPolicy) {
+    TransactionStrategy strategy;
+
+    if (privacyPolicy == "FullPrivacy") {
+        strategy.privacy = PrivacyPolicy::FullPrivacy;
+    } else if (privacyPolicy == "AllowRevealedAmounts") {
+        strategy.privacy = PrivacyPolicy::AllowRevealedAmounts;
+    } else if (privacyPolicy == "AllowRevealedRecipients") {
+        strategy.privacy = PrivacyPolicy::AllowRevealedRecipients;
+    } else if (privacyPolicy == "AllowRevealedSenders") {
+        strategy.privacy = PrivacyPolicy::AllowRevealedSenders;
+    } else if (privacyPolicy == "AllowFullyTransparent") {
+        strategy.privacy = PrivacyPolicy::AllowFullyTransparent;
+    } else if (privacyPolicy == "AllowLinkingAccountAddresses") {
+        strategy.privacy = PrivacyPolicy::AllowLinkingAccountAddresses;
+    } else if (privacyPolicy == "NoPrivacy") {
+        strategy.privacy = PrivacyPolicy::NoPrivacy;
+    } else {
+        // Unknown privacy policy.
+        return std::nullopt;
+    }
+
+    return strategy;
+}
+
+bool TransactionStrategy::AllowRevealedAmounts() {
+    switch (privacy) {
+        case PrivacyPolicy::FullPrivacy:
+            return false;
+        case PrivacyPolicy::AllowRevealedAmounts:
+        case PrivacyPolicy::AllowRevealedRecipients:
+        case PrivacyPolicy::AllowRevealedSenders:
+        case PrivacyPolicy::AllowFullyTransparent:
+        case PrivacyPolicy::AllowLinkingAccountAddresses:
+        case PrivacyPolicy::NoPrivacy:
+            return true;
+        default:
+            // Fail closed.
+            return false;
+    }
+}
+
+bool TransactionStrategy::AllowRevealedRecipients() {
+    switch (privacy) {
+        case PrivacyPolicy::FullPrivacy:
+        case PrivacyPolicy::AllowRevealedAmounts:
+        case PrivacyPolicy::AllowRevealedSenders:
+        case PrivacyPolicy::AllowLinkingAccountAddresses:
+            return false;
+        case PrivacyPolicy::AllowRevealedRecipients:
+        case PrivacyPolicy::AllowFullyTransparent:
+        case PrivacyPolicy::NoPrivacy:
+            return true;
+        default:
+            // Fail closed.
+            return false;
+    }
+}
+
+bool TransactionStrategy::AllowRevealedSenders() {
+    switch (privacy) {
+        case PrivacyPolicy::FullPrivacy:
+        case PrivacyPolicy::AllowRevealedAmounts:
+        case PrivacyPolicy::AllowRevealedRecipients:
+            return false;
+        case PrivacyPolicy::AllowRevealedSenders:
+        case PrivacyPolicy::AllowFullyTransparent:
+        case PrivacyPolicy::AllowLinkingAccountAddresses:
+        case PrivacyPolicy::NoPrivacy:
+            return true;
+        default:
+            // Fail closed.
+            return false;
+    }
+}
+
+bool TransactionStrategy::AllowLinkingAccountAddresses() {
+    switch (privacy) {
+        case PrivacyPolicy::FullPrivacy:
+        case PrivacyPolicy::AllowRevealedAmounts:
+        case PrivacyPolicy::AllowRevealedRecipients:
+        case PrivacyPolicy::AllowRevealedSenders:
+        case PrivacyPolicy::AllowFullyTransparent:
+            return false;
+        case PrivacyPolicy::AllowLinkingAccountAddresses:
+        case PrivacyPolicy::NoPrivacy:
+            return true;
+        default:
+            // Fail closed.
+            return false;
+    }
+}
+
+bool ZTXOSelector::SelectsTransparent() const {
+    return std::visit(match {
+        [](const CKeyID& keyId) { return true; },
+        [](const CScriptID& scriptId) { return true; },
+        [](const libzcash::SproutPaymentAddress& addr) { return false; },
+        [](const libzcash::SproutViewingKey& vk) { return false; },
+        [](const libzcash::SaplingPaymentAddress& addr) { return false; },
+        [](const libzcash::SaplingExtendedFullViewingKey& vk) { return false; },
+        [](const libzcash::UnifiedAddress& ua) {
+            return ua.GetP2PKHReceiver().has_value() || ua.GetP2SHReceiver().has_value();
+        },
+        [](const libzcash::UnifiedFullViewingKey& ufvk) { return ufvk.GetTransparentKey().has_value(); },
+        [](const AccountZTXOPattern& acct) { return acct.IncludesP2PKH() || acct.IncludesP2SH(); }
+    }, this->pattern);
+}
+bool ZTXOSelector::SelectsSprout() const {
+    return std::visit(match {
+        [](const libzcash::SproutViewingKey& addr) { return true; },
+        [](const libzcash::SproutPaymentAddress& extfvk) { return true; },
+        [](const auto& addr) { return false; }
+    }, this->pattern);
+}
+bool ZTXOSelector::SelectsSapling() const {
+    return std::visit(match {
+        [](const libzcash::SaplingPaymentAddress& addr) { return true; },
+        [](const libzcash::SaplingExtendedSpendingKey& extfvk) { return true; },
+        [](const libzcash::UnifiedAddress& ua) { return ua.GetSaplingReceiver().has_value(); },
+        [](const libzcash::UnifiedFullViewingKey& ufvk) { return ufvk.GetSaplingKey().has_value(); },
+        [](const AccountZTXOPattern& acct) { return acct.IncludesSapling(); },
+        [](const auto& addr) { return false; }
+    }, this->pattern);
+}
+bool ZTXOSelector::SelectsOrchard() const {
+    return std::visit(match {
+        [](const libzcash::UnifiedAddress& ua) { return ua.GetOrchardReceiver().has_value(); },
+        [](const libzcash::UnifiedFullViewingKey& ufvk) { return ufvk.GetOrchardKey().has_value(); },
+        [](const AccountZTXOPattern& acct) { return acct.IncludesOrchard(); },
+        [](const auto& addr) { return false; }
+    }, this->pattern);
+}
+
+bool SpendableInputs::LimitToAmount(
+    const CAmount amountRequired,
+    const CAmount dustThreshold,
+    std::set<OutputPool> recipientPools)
+{
+    assert(amountRequired >= 0 && dustThreshold > 0);
+    // Calling this method twice is a programming error.
+    assert(!limited);
+
+    CAmount totalSelected{0};
+    auto haveSufficientFunds = [&]() {
+        // if the total would result in change below the dust threshold,
+        // we do not yet have sufficient funds
+        return totalSelected == amountRequired || totalSelected - amountRequired > dustThreshold;
+    };
+    auto wouldSuffice = [&](CAmount extra) {
+        auto totalWithExtra = totalSelected + extra;
+        return totalWithExtra == amountRequired || totalWithExtra - amountRequired > dustThreshold;
+    };
+
+    if (recipientPools.count(OutputPool::Orchard)) {
+        // We cannot select Sprout notes with Orchard recipients.
+        sproutNoteEntries.clear();
+    } else {
+        // Select Sprout notes for spending first - if possible, we want users to
+        // spend any notes that they still have in the Sprout pool.
+        std::sort(sproutNoteEntries.begin(), sproutNoteEntries.end(),
+            [](SproutNoteEntry i, SproutNoteEntry j) -> bool {
+                return i.note.value() > j.note.value();
+            });
+        auto sproutIt = sproutNoteEntries.begin();
+        while (sproutIt != sproutNoteEntries.end() && !haveSufficientFunds()) {
+            totalSelected += sproutIt->note.value();
+            ++sproutIt;
+        }
+        sproutNoteEntries.erase(sproutIt, sproutNoteEntries.end());
+    }
+
+    // Check what input pools we have available.
+    CAmount availableTransparent = std::accumulate(
+        utxos.begin(), utxos.end(), CAmount(0), [](CAmount acc, const COutput& utxo) {
+            return acc + utxo.Value();
+        });
+    CAmount availableSapling = std::accumulate(
+        saplingNoteEntries.begin(),
+        saplingNoteEntries.end(),
+        CAmount(0),
+        [](CAmount acc, const SaplingNoteEntry& entry) {
+            return acc + entry.note.value();
+        });
+    CAmount availableOrchard = std::accumulate(
+        orchardNoteMetadata.begin(),
+        orchardNoteMetadata.end(),
+        CAmount(0),
+        [](CAmount acc, const OrchardNoteMetadata& entry) {
+            return acc + entry.GetNoteValue();
+        });
+    assert(availableTransparent >= 0);
+    assert(availableSapling >= 0);
+    assert(availableOrchard >= 0);
+    bool haveTransparent = availableTransparent > 0;
+    bool haveSapling = availableSapling > 0;
+    bool haveOrchard = availableOrchard > 0;
+    std::set<OutputPool> available;
+    if (haveTransparent) {
+        available.insert(OutputPool::Transparent);
+    }
+    if (haveSapling) {
+        available.insert(OutputPool::Sapling);
+    }
+    if (haveOrchard) {
+        available.insert(OutputPool::Orchard);
+    }
+
+    // Now determine the order in which to select the remaining notes and coins.
+    // We do this in a way that minimizes information leakage while moving funds
+    // into the shielded pool where possible. The rules below follow several
+    // general principles:
+    //
+    // - If we have sufficient funds in a single shielded pool, we prefer to
+    //   select funds from that pool (especially if the pool matches a recipient
+    //   pool).
+    // - If we don't have sufficient funds in a single shielded pool, we prefer
+    //   to select funds from older shielded pools first, to generally migrate
+    //   funds towards newer shielded pools. We do not perform opportunistic
+    //   migration however (at this time).
+    // - If we have transparent recipients, we prefer to select funds across all
+    //   shielded pools before the transparent pool. The address and amount for
+    //   these recipients is necessarily revealed, but we can hide the sender.
+    // - If we don't have suffient funds in shielded pools and are required to
+    //   select transparent coins, we always select all transparent coins first.
+    //   Given that the transaction will necessarily reveal sender information,
+    //   we use it to opportunistically shield transparent coins.
+    //
+    // In the following table:
+    // - "Available" denotes the pools in which we have selectable notes.
+    // - "Recipients" lists the pools in which we are required to create outputs.
+    // - "Order" is a comma-separated list of pool selection orders. The order
+    //   used is the first order in the list that can select sufficient funds.
+    // - T: transparent pool
+    // - S: Sapling pool
+    // - O: Orchard pool
+    //
+    // Available | Recipients | Order  | Rationale
+    // ----------|------------|--------|----------
+    //    T      |    ***     |  T     | N/A
+    //     S     |    ***     |  S     | N/A
+    //      O    |    ***     |  O     | N/A
+    //    TS     |    T       |  S, TS | Hide sender,    opportunistic shielding
+    //    TS     |     S      |  S, TS | Fully shielded, opportunistic shielding
+    //    TS     |      O     |  S, TS | Hide sender,    opportunistic shielding
+    //    TS     |    TS      |  S, TS | Hide sender,    opportunistic shielding
+    //    TS     |    T O     |  S, TS | Hide sender,    opportunistic shielding
+    //    TS     |     SO     |  S, TS | Hide sender,    opportunistic shielding
+    //    TS     |    TSO     |  S, TS | Hide sender,    opportunistic shielding
+    //    T O    |    T       |  O, TO | Hide sender,    opportunistic shielding
+    //    T O    |     S      |  O, TO | Hide sender,    opportunistic shielding
+    //    T O    |      O     |  O, TO | Fully shielded, opportunistic shielding
+    //    T O    |    TS      |  O, TO | Hide sender,    opportunistic shielding
+    //    T O    |    T O     |  O, TO | Hide sender,    opportunistic shielding
+    //    T O    |     SO     |  O, TO | Hide sender,    opportunistic shielding
+    //    T O    |    TSO     |  O, TO | Hide sender,    opportunistic shielding
+    //     SO    |    T       |  O, SO | Fewer pools,    opportunistic migration
+    //     SO    |     S      |  S, SO | Fully shielded
+    //     SO    |      O     |  O, SO | Fully shielded, opportunistic migration
+    //     SO    |    TS      |  S, SO | Fewer pools
+    //     SO    |    T O     |  O, SO | Fewer pools,    opportunistic migration
+    //     SO    |     SO     |  S, SO | Opportunistic migration
+    //     SO    |    TSO     |  S, SO | Opportunistic migration
+    //    TSO    |    T       |  O, SO, TSO | Fewer pools,             hide sender, opportunistic shielding
+    //    TSO    |     S      |  S, SO, TSO | Fully shielded,          hide sender, opportunistic shielding
+    //    TSO    |      O     |  O, SO, TSO | Fully shielded,          hide sender, opportunistic shielding
+    //    TSO    |    TS      |  S, SO, TSO | Fewer pools,             hide sender, opportunistic shielding
+    //    TSO    |    T O     |  O, SO, TSO | Fewer pools,             hide sender, opportunistic shielding
+    //    TSO    |     SO     |  S, SO, TSO | Opportunistic migration, hide sender, opportunistic shielding
+    //    TSO    |    TSO     |  S, SO, TSO | Opportunistic migration, hide sender, opportunistic shielding
+    std::vector<OutputPool> selectionOrder;
+    bool opportunisticShielding = false;
+    if (available.size() <= 1) {
+        // We have at most one input pool, so we don't need selection logic.
+        selectionOrder.assign(available.begin(), available.end());
+    } else if (
+        recipientPools == std::set({OutputPool::Orchard}) &&
+        wouldSuffice(availableOrchard))
+    {
+        // Fully shielded.
+        selectionOrder = {
+            OutputPool::Orchard,
+            // Pools below here are erased.
+            OutputPool::Transparent,
+            OutputPool::Sapling,
+        };
+    } else if (
+        recipientPools.count(OutputPool::Transparent) &&
+        !recipientPools.count(OutputPool::Sapling) &&
+        wouldSuffice(availableOrchard))
+    {
+        // Fewer pools.
+        selectionOrder = {
+            OutputPool::Orchard,
+            // Pools below here are erased.
+            OutputPool::Transparent,
+            OutputPool::Sapling,
+        };
+    } else if (wouldSuffice(availableSapling + availableOrchard)) {
+        // Hide sender.
+        // This case also handles two other cases:
+        // - Fully shielded (recipientPools == S && wouldSuffice(S))
+        // - Fewer pools    (S in recipientPools && O not in recipientPools && wouldSuffice(S))
+        selectionOrder = {
+            OutputPool::Sapling,
+            OutputPool::Orchard,
+            // Pools below here are erased.
+            OutputPool::Transparent,
+        };
+    } else {
+        // Opportunistic shielding.
+        selectionOrder = {
+            OutputPool::Transparent,
+            OutputPool::Sapling,
+            OutputPool::Orchard,
+        };
+        opportunisticShielding = true;
+    }
+
+    // Ensure we provided a total selection order (so that all unselected notes
+    // and coins are erased).
+    for (auto pool : available) {
+        bool poolIsPresent = false;
+        for (auto entry : selectionOrder) {
+            poolIsPresent |= entry == pool;
+        }
+        assert(poolIsPresent);
+    }
+
+    // Finally, select the remaining notes and coins based on this order.
+    for (auto pool : selectionOrder) {
+        switch (pool) {
+            case OutputPool::Transparent:
+            {
+                std::sort(utxos.begin(), utxos.end(),
+                    [](COutput i, COutput j) -> bool {
+                        return i.Value() > j.Value();
+                    });
+                if (opportunisticShielding) {
+                    // Select all transparent coins.
+                    totalSelected += availableTransparent;
+                } else {
+                    // Only select as many as we need.
+                    auto utxoIt = utxos.begin();
+                    while (utxoIt != utxos.end() && !haveSufficientFunds()) {
+                        totalSelected += utxoIt->Value();
+                        ++utxoIt;
+                    }
+                    utxos.erase(utxoIt, utxos.end());
+                }
+                break;
+            }
+
+            case OutputPool::Sapling:
+            {
+                std::sort(saplingNoteEntries.begin(), saplingNoteEntries.end(),
+                    [](SaplingNoteEntry i, SaplingNoteEntry j) -> bool {
+                        return i.note.value() > j.note.value();
+                    });
+                auto saplingIt = saplingNoteEntries.begin();
+                while (saplingIt != saplingNoteEntries.end() && !haveSufficientFunds()) {
+                    totalSelected += saplingIt->note.value();
+                    ++saplingIt;
+                }
+                saplingNoteEntries.erase(saplingIt, saplingNoteEntries.end());
+                break;
+            }
+
+            case OutputPool::Orchard:
+            {
+                std::sort(orchardNoteMetadata.begin(), orchardNoteMetadata.end(),
+                    [](OrchardNoteMetadata i, OrchardNoteMetadata j) -> bool {
+                        return i.GetNoteValue() > j.GetNoteValue();
+                    });
+                auto orchardIt = orchardNoteMetadata.begin();
+                while (orchardIt != orchardNoteMetadata.end() && !haveSufficientFunds()) {
+                    totalSelected += orchardIt->GetNoteValue();
+                    ++orchardIt;
+                }
+                orchardNoteMetadata.erase(orchardIt, orchardNoteMetadata.end());
+                break;
+            }
+        }
+    }
+
+    limited = true;
+    return haveSufficientFunds();
+}
+
+bool SpendableInputs::HasTransparentCoinbase() const {
+    for (const auto& out : utxos) {
+        if (out.fIsCoinbase) {
+            return true;
+        }
+    }
+
+    return false;
+}
+
+void SpendableInputs::LogInputs(const AsyncRPCOperationId& id) const {
+    for (const auto& utxo : utxos) {
+        LogPrint("zrpcunsafe", "%s: found unspent transparent UTXO (txid=%s, index=%d, amount=%s, isCoinbase=%s)\n",
+            id,
+            utxo.tx->GetHash().ToString(),
+            utxo.i,
+            FormatMoney(utxo.Value()),
+            utxo.fIsCoinbase);
+    }
+
+    for (const auto& entry : sproutNoteEntries) {
+        std::string data(entry.memo.begin(), entry.memo.end());
+        LogPrint("zrpcunsafe", "%s: found unspent Sprout note (txid=%s, vJoinSplit=%d, jsoutindex=%d, amount=%s, memo=%s)\n",
+            id,
+            entry.jsop.hash.ToString().substr(0, 10),
+            entry.jsop.js,
+            int(entry.jsop.n),  // uint8_t
+            FormatMoney(entry.note.value()),
+            HexStr(data).substr(0, 10)
+            );
+    }
+
+    for (const auto& entry : saplingNoteEntries) {
+        std::string data(entry.memo.begin(), entry.memo.end());
+        LogPrint("zrpcunsafe", "%s: found unspent Sapling note (txid=%s, vShieldedSpend=%d, amount=%s, memo=%s)\n",
+            id,
+            entry.op.hash.ToString().substr(0, 10),
+            entry.op.n,
+            FormatMoney(entry.note.value()),
+            HexStr(data).substr(0, 10));
+    }
+
+    for (const auto& entry : orchardNoteMetadata) {
+        std::string data(entry.GetMemo().begin(), entry.GetMemo().end());
+        LogPrint("zrpcunsafe", "%s: found unspent Orchard note (txid=%s, vActionsOrchard=%d, amount=%s, memo=%s)\n",
+            id,
+            entry.GetOutPoint().hash.ToString().substr(0, 10),
+            entry.GetOutPoint().n,
+            FormatMoney(entry.GetNoteValue()),
+            HexStr(data).substr(0, 10));
+    }
+}
diff --git a/depend/zcash/src/wallet/wallet.h b/depend/zcash/src/wallet/wallet.h
new file mode 100644
index 000000000..0da133126
--- /dev/null
+++ b/depend/zcash/src/wallet/wallet.h
@@ -0,0 +1,2166 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_WALLET_WALLET_H
+#define BITCOIN_WALLET_WALLET_H
+
+#include "amount.h"
+#include "asyncrpcoperation.h"
+#include "coins.h"
+#include "key.h"
+#include "keystore.h"
+#include "main.h"
+#include "primitives/block.h"
+#include "primitives/transaction.h"
+#include "tinyformat.h"
+#include "transaction_builder.h"
+#include "ui_interface.h"
+#include "util.h"
+#include "utilstrencodings.h"
+#include "validationinterface.h"
+#include "script/ismine.h"
+#include "wallet/crypter.h"
+#include "wallet/orchard.h"
+#include "wallet/walletdb.h"
+#include "wallet/rpcwallet.h"
+#include "zcash/address/unified.h"
+#include "zcash/address/mnemonic.h"
+#include "zcash/Address.hpp"
+#include "zcash/Note.hpp"
+#include "base58.h"
+
+#include <algorithm>
+#include <map>
+#include <optional>
+#include <set>
+#include <stdexcept>
+#include <stdint.h>
+#include <string>
+#include <utility>
+#include <vector>
+
+#include <boost/shared_ptr.hpp>
+
+extern CWallet* pwalletMain;
+
+/**
+ * Settings
+ */
+extern CFeeRate payTxFee;
+extern unsigned int nTxConfirmTarget;
+extern bool bSpendZeroConfChange;
+extern bool fSendFreeTransactions;
+extern bool fPayAtLeastCustomFee;
+extern unsigned int nAnchorConfirmations;
+// The maximum number of Orchard actions permitted within a single transaction.
+// This can be overridden with the -orchardactionlimit config option
+extern unsigned int nOrchardActionLimit;
+
+static const unsigned int DEFAULT_KEYPOOL_SIZE = 100;
+//! -paytxfee default
+static const CAmount DEFAULT_TRANSACTION_FEE = 0;
+//! -mintxfee default
+static const CAmount DEFAULT_TRANSACTION_MINFEE = 1000;
+//! minimum change amount
+static const CAmount MIN_CHANGE = CENT;
+//! Default for -spendzeroconfchange
+static const bool DEFAULT_SPEND_ZEROCONF_CHANGE = true;
+//! Default for -sendfreetransactions
+static const bool DEFAULT_SEND_FREE_TRANSACTIONS = false;
+//! -txconfirmtarget default
+static const unsigned int DEFAULT_TX_CONFIRM_TARGET = 2;
+//! Largest (in bytes) free transaction we're willing to create
+static const unsigned int MAX_FREE_TRANSACTION_CREATE_SIZE = 1000;
+static const bool DEFAULT_WALLETBROADCAST = true;
+//! Size of witness cache
+//  Should be large enough that we can expect not to reorg beyond our cache
+//  unless there is some exceptional network disruption.
+static const unsigned int WITNESS_CACHE_SIZE = MAX_REORG_LENGTH + 1;
+
+//! Amount of entropy used in generation of the mnemonic seed, in bytes.
+static const size_t WALLET_MNEMONIC_ENTROPY_LENGTH = 32;
+//! -anchorconfirmations default
+static const unsigned int DEFAULT_ANCHOR_CONFIRMATIONS = 3;
+// Default minimum number of confirmations for note selection
+static const unsigned int DEFAULT_NOTE_CONFIRMATIONS = 10;
+//! -orchardactionlimit default
+static const unsigned int DEFAULT_ORCHARD_ACTION_LIMIT = 50;
+
+extern const char * DEFAULT_WALLET_DAT;
+
+class CBlockIndex;
+class CCoinControl;
+class COutput;
+class CReserveKey;
+class CScript;
+class CTxMemPool;
+class CWalletTx;
+
+/** (client) version numbers for particular wallet features */
+enum WalletFeature
+{
+    FEATURE_BASE = 10500, // the earliest version new wallets supports (only useful for getinfo's clientversion output)
+
+    FEATURE_WALLETCRYPT = 40000, // wallet encryption
+    FEATURE_COMPRPUBKEY = 60000, // compressed public keys
+
+    FEATURE_LATEST = 60000
+};
+
+
+/** A key pool entry */
+class CKeyPool
+{
+public:
+    int64_t nTime;
+    CPubKey vchPubKey;
+
+    CKeyPool();
+    CKeyPool(const CPubKey& vchPubKeyIn);
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        int nVersion = s.GetVersion();
+        if (!(s.GetType() & SER_GETHASH))
+            READWRITE(nVersion);
+        READWRITE(nTime);
+        READWRITE(vchPubKey);
+    }
+};
+
+/** Address book data */
+class CAddressBookData
+{
+public:
+    std::string name;
+    std::string purpose;
+
+    CAddressBookData()
+    {
+        purpose = "unknown";
+    }
+
+    typedef std::map<std::string, std::string> StringMap;
+    StringMap destdata;
+};
+
+struct CRecipient
+{
+    CScript scriptPubKey;
+    CAmount nAmount;
+    bool fSubtractFeeFromAmount;
+};
+
+class RecipientMapping {
+public:
+    std::optional<libzcash::UnifiedAddress> ua;
+    libzcash::RecipientAddress address;
+
+    RecipientMapping(std::optional<libzcash::UnifiedAddress> ua_, libzcash::RecipientAddress address_) :
+        ua(ua_), address(address_) {}
+};
+
+typedef std::map<std::string, std::string> mapValue_t;
+
+
+static void ReadOrderPos(int64_t& nOrderPos, mapValue_t& mapValue)
+{
+    if (!mapValue.count("n"))
+    {
+        nOrderPos = -1; // TODO: calculate elsewhere
+        return;
+    }
+    nOrderPos = atoi64(mapValue["n"].c_str());
+}
+
+
+static void WriteOrderPos(const int64_t& nOrderPos, mapValue_t& mapValue)
+{
+    if (nOrderPos == -1)
+        return;
+    mapValue["n"] = i64tostr(nOrderPos);
+}
+
+struct COutputEntry
+{
+    CTxDestination destination;
+    CAmount amount;
+    int vout;
+};
+
+/** A note outpoint */
+class JSOutPoint
+{
+public:
+    // Transaction hash
+    uint256 hash;
+    // Index into CTransaction.vJoinSplit
+    uint64_t js;
+    // Index into JSDescription fields of length ZC_NUM_JS_OUTPUTS
+    uint8_t n;
+
+    JSOutPoint() { SetNull(); }
+    JSOutPoint(uint256 h, uint64_t js, uint8_t n) : hash {h}, js {js}, n {n} { }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(hash);
+        READWRITE(js);
+        READWRITE(n);
+    }
+
+    void SetNull() { hash.SetNull(); }
+    bool IsNull() const { return hash.IsNull(); }
+
+    friend bool operator<(const JSOutPoint& a, const JSOutPoint& b) {
+        return (a.hash < b.hash ||
+                (a.hash == b.hash && a.js < b.js) ||
+                (a.hash == b.hash && a.js == b.js && a.n < b.n));
+    }
+
+    friend bool operator==(const JSOutPoint& a, const JSOutPoint& b) {
+        return (a.hash == b.hash && a.js == b.js && a.n == b.n);
+    }
+
+    friend bool operator!=(const JSOutPoint& a, const JSOutPoint& b) {
+        return !(a == b);
+    }
+
+    std::string ToString() const;
+};
+
+class SproutNoteData
+{
+public:
+    libzcash::SproutPaymentAddress address;
+
+    /**
+     * Cached note nullifier. May not be set if the wallet was not unlocked when
+     * this was SproutNoteData was created. If not set, we always assume that the
+     * note has not been spent.
+     *
+     * It's okay to cache the nullifier in the wallet, because we are storing
+     * the spending key there too, which could be used to derive this.
+     * If the wallet is encrypted, this means that someone with access to the
+     * locked wallet cannot spend notes, but can connect received notes to the
+     * transactions they are spent in. This is the same security semantics as
+     * for transparent addresses.
+     */
+    std::optional<uint256> nullifier;
+
+    /**
+     * Cached incremental witnesses for spendable Notes.
+     * Beginning of the list is the most recent witness.
+     */
+    std::list<SproutWitness> witnesses;
+
+    /**
+     * Block height corresponding to the most current witness.
+     *
+     * When we first create a SproutNoteData in CWallet::FindMySproutNotes, this is set to
+     * -1 as a placeholder. The next time CWallet::ChainTip is called, we can
+     * determine what height the witness cache for this note is valid for (even
+     * if no witnesses were cached), and so can set the correct value in
+     * CWallet::IncrementNoteWitnesses and CWallet::DecrementNoteWitnesses.
+     */
+    int witnessHeight;
+
+    SproutNoteData() : address(), nullifier(), witnessHeight {-1} { }
+    SproutNoteData(libzcash::SproutPaymentAddress a) :
+            address {a}, nullifier(), witnessHeight {-1} { }
+    SproutNoteData(libzcash::SproutPaymentAddress a, uint256 n) :
+            address {a}, nullifier {n}, witnessHeight {-1} { }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(address);
+        READWRITE(nullifier);
+        READWRITE(witnesses);
+        READWRITE(witnessHeight);
+    }
+
+    friend bool operator<(const SproutNoteData& a, const SproutNoteData& b) {
+        return (a.address < b.address ||
+                (a.address == b.address && a.nullifier < b.nullifier));
+    }
+
+    friend bool operator==(const SproutNoteData& a, const SproutNoteData& b) {
+        return (a.address == b.address && a.nullifier == b.nullifier);
+    }
+
+    friend bool operator!=(const SproutNoteData& a, const SproutNoteData& b) {
+        return !(a == b);
+    }
+};
+
+class SaplingNoteData
+{
+public:
+    /**
+     * We initialize the height to -1 for the same reason as we do in SproutNoteData.
+     * See the comment in that class for a full description.
+     */
+    SaplingNoteData() : witnessHeight {-1}, nullifier() { }
+    SaplingNoteData(libzcash::SaplingIncomingViewingKey ivk) : ivk {ivk}, witnessHeight {-1}, nullifier() { }
+    SaplingNoteData(libzcash::SaplingIncomingViewingKey ivk, uint256 n) : ivk {ivk}, witnessHeight {-1}, nullifier(n) { }
+
+    std::list<SaplingWitness> witnesses;
+    int witnessHeight;
+    libzcash::SaplingIncomingViewingKey ivk;
+    std::optional<uint256> nullifier;
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        int nVersion = s.GetVersion();
+        if (!(s.GetType() & SER_GETHASH)) {
+            READWRITE(nVersion);
+        }
+        READWRITE(ivk);
+        READWRITE(nullifier);
+        READWRITE(witnesses);
+        READWRITE(witnessHeight);
+    }
+
+    friend bool operator==(const SaplingNoteData& a, const SaplingNoteData& b) {
+        return (a.ivk == b.ivk && a.nullifier == b.nullifier && a.witnessHeight == b.witnessHeight);
+    }
+
+    friend bool operator!=(const SaplingNoteData& a, const SaplingNoteData& b) {
+        return !(a == b);
+    }
+};
+
+typedef std::map<JSOutPoint, SproutNoteData> mapSproutNoteData_t;
+typedef std::map<SaplingOutPoint, SaplingNoteData> mapSaplingNoteData_t;
+
+/** Sprout note, its location in a transaction, and number of confirmations. */
+struct SproutNoteEntry
+{
+    JSOutPoint jsop;
+    libzcash::SproutPaymentAddress address;
+    libzcash::SproutNote note;
+    std::array<unsigned char, ZC_MEMO_SIZE> memo;
+    int confirmations;
+};
+
+/** Sapling note, its location in a transaction, and number of confirmations. */
+struct SaplingNoteEntry
+{
+    SaplingOutPoint op;
+    libzcash::SaplingPaymentAddress address;
+    libzcash::SaplingNote note;
+    std::array<unsigned char, ZC_MEMO_SIZE> memo;
+    int confirmations;
+};
+
+/** A transaction with a merkle branch linking it to the block chain. */
+class CMerkleTx : public CTransaction
+{
+private:
+    int GetDepthInMainChainINTERNAL(const CBlockIndex* &pindexRet) const;
+
+public:
+    uint256 hashBlock;
+    std::vector<uint256> vMerkleBranch;
+    int nIndex;
+
+    // memory only
+    mutable bool fMerkleVerified;
+
+
+    CMerkleTx()
+    {
+        Init();
+    }
+
+    CMerkleTx(const CTransaction& txIn) : CTransaction(txIn)
+    {
+        Init();
+    }
+
+    void Init()
+    {
+        hashBlock = uint256();
+        nIndex = -1;
+        fMerkleVerified = false;
+    }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(*(CTransaction*)this);
+        READWRITE(hashBlock);
+        READWRITE(vMerkleBranch);
+        READWRITE(nIndex);
+    }
+
+    void SetMerkleBranch(const CBlock& block);
+
+
+    /**
+     * Return depth of transaction in blockchain:
+     * -1  : not in blockchain, and not in memory pool (conflicted transaction)
+     *  0  : in memory pool, waiting to be included in a block
+     * >=1 : this many blocks deep in the main chain
+     */
+    int GetDepthInMainChain(const CBlockIndex* &pindexRet) const;
+    int GetDepthInMainChain() const { const CBlockIndex *pindexRet; return GetDepthInMainChain(pindexRet); }
+    bool IsInMainChain() const { const CBlockIndex *pindexRet; return GetDepthInMainChainINTERNAL(pindexRet) > 0; }
+    int GetBlocksToMaturity() const;
+    /** Pass this transaction to the mempool. Fails if absolute fee exceeds maxTxFee. */
+    bool AcceptToMemoryPool(bool fLimitFree=true, bool fRejectAbsurdFee=true);
+};
+
+enum class WalletUAGenerationError {
+    NoSuchAccount,
+    ExistingAddressMismatch,
+    WalletEncrypted
+};
+
+typedef std::variant<
+    std::pair<libzcash::UnifiedAddress, libzcash::diversifier_index_t>,
+    libzcash::UnifiedAddressGenerationError,
+    WalletUAGenerationError> WalletUAGenerationResult;
+
+/**
+ * A transaction with a bunch of additional info that only the owner cares about.
+ * It includes any unrecorded transactions needed to link it back to the block chain.
+ */
+class CWalletTx : public CMerkleTx
+{
+private:
+    const CWallet* pwallet;
+
+public:
+    /**
+     * Key/value map with information about the transaction.
+     *
+     * The following keys can be read and written through the map and are
+     * serialized in the wallet database:
+     *
+     *     "comment", "to"   - comment strings provided to sendtoaddress,
+     *                         and sendmany wallet RPCs
+     *     "replaces_txid"   - txid (as HexStr) of transaction replaced by
+     *                         bumpfee on transaction created by bumpfee
+     *     "replaced_by_txid" - txid (as HexStr) of transaction created by
+     *                         bumpfee on transaction replaced by bumpfee
+     *     "from", "message" - obsolete fields that could be set in UI prior to
+     *                         2011 (removed in commit 4d9b223)
+     *
+     * The following keys are serialized in the wallet database, but shouldn't
+     * be read or written through the map (they will be temporarily added and
+     * removed from the map during serialization):
+     *
+     *     "n"               - serialized nOrderPos value
+     *     "timesmart"       - serialized nTimeSmart value
+     *     "spent"           - serialized vfSpent value that existed prior to
+     *                         2014 (removed in commit 93a18a3)
+     */
+    mapValue_t mapValue;
+    mapSproutNoteData_t mapSproutNoteData;
+    mapSaplingNoteData_t mapSaplingNoteData;
+    OrchardWalletTxMeta orchardTxMeta;
+
+    std::vector<std::pair<std::string, std::string> > vOrderForm;
+    unsigned int fTimeReceivedIsTxTime;
+    unsigned int nTimeReceived; //!< time received by this node
+    unsigned int nTimeSmart;
+    char fFromMe;
+    int64_t nOrderPos; //!< position in ordered transaction list
+
+    // memory only
+    mutable bool fDebitCached;
+    mutable bool fCreditCached;
+    mutable bool fImmatureCreditCached;
+    mutable bool fAvailableCreditCached;
+    mutable bool fWatchDebitCached;
+    mutable bool fWatchCreditCached;
+    mutable bool fImmatureWatchCreditCached;
+    mutable bool fAvailableWatchCreditCached;
+    mutable bool fChangeCached;
+    mutable CAmount nDebitCached;
+    mutable CAmount nCreditCached;
+    mutable CAmount nImmatureCreditCached;
+    mutable CAmount nAvailableCreditCached;
+    mutable CAmount nWatchDebitCached;
+    mutable CAmount nWatchCreditCached;
+    mutable CAmount nImmatureWatchCreditCached;
+    mutable CAmount nAvailableWatchCreditCached;
+    mutable CAmount nChangeCached;
+
+    CWalletTx()
+    {
+        Init(NULL);
+    }
+
+    CWalletTx(const CWallet* pwalletIn)
+    {
+        Init(pwalletIn);
+    }
+
+    CWalletTx(const CWallet* pwalletIn, const CMerkleTx& txIn) : CMerkleTx(txIn)
+    {
+        Init(pwalletIn);
+    }
+
+    CWalletTx(const CWallet* pwalletIn, const CTransaction& txIn) : CMerkleTx(txIn)
+    {
+        Init(pwalletIn);
+    }
+
+    void Init(const CWallet* pwalletIn)
+    {
+        pwallet = pwalletIn;
+        mapValue.clear();
+        mapSproutNoteData.clear();
+        mapSaplingNoteData.clear();
+        vOrderForm.clear();
+        fTimeReceivedIsTxTime = false;
+        nTimeReceived = 0;
+        nTimeSmart = 0;
+        fFromMe = false;
+        fDebitCached = false;
+        fCreditCached = false;
+        fImmatureCreditCached = false;
+        fAvailableCreditCached = false;
+        fWatchDebitCached = false;
+        fWatchCreditCached = false;
+        fImmatureWatchCreditCached = false;
+        fAvailableWatchCreditCached = false;
+        fChangeCached = false;
+        nDebitCached = 0;
+        nCreditCached = 0;
+        nImmatureCreditCached = 0;
+        nAvailableCreditCached = 0;
+        nWatchDebitCached = 0;
+        nWatchCreditCached = 0;
+        nAvailableWatchCreditCached = 0;
+        nImmatureWatchCreditCached = 0;
+        nChangeCached = 0;
+        nOrderPos = -1;
+    }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        if (ser_action.ForRead())
+            Init(NULL);
+        char fSpent = false;
+
+        if (!ser_action.ForRead())
+        {
+            mapValue["fromaccount"] = "";
+
+            WriteOrderPos(nOrderPos, mapValue);
+
+            if (nTimeSmart)
+                mapValue["timesmart"] = strprintf("%u", nTimeSmart);
+        }
+
+        READWRITE(*(CMerkleTx*)this);
+        std::vector<CMerkleTx> vUnused; //!< Used to be vtxPrev
+        READWRITE(vUnused);
+        READWRITE(mapValue);
+        READWRITE(mapSproutNoteData);
+        READWRITE(vOrderForm);
+        READWRITE(fTimeReceivedIsTxTime);
+        READWRITE(nTimeReceived);
+        READWRITE(fFromMe);
+        READWRITE(fSpent);
+
+        if (fOverwintered && nVersion >= SAPLING_TX_VERSION) {
+            READWRITE(mapSaplingNoteData);
+        }
+
+        if (fOverwintered && nVersion >= ZIP225_TX_VERSION) {
+            READWRITE(orchardTxMeta);
+        }
+
+        if (ser_action.ForRead())
+        {
+            ReadOrderPos(nOrderPos, mapValue);
+            nTimeSmart = mapValue.count("timesmart") ? (unsigned int)atoi64(mapValue["timesmart"]) : 0;
+        }
+
+        mapValue.erase("fromaccount");
+        mapValue.erase("version");
+        mapValue.erase("spent");
+        mapValue.erase("n");
+        mapValue.erase("timesmart");
+    }
+
+    //! make sure balances are recalculated
+    void MarkDirty()
+    {
+        fCreditCached = false;
+        fAvailableCreditCached = false;
+        fWatchDebitCached = false;
+        fWatchCreditCached = false;
+        fAvailableWatchCreditCached = false;
+        fImmatureWatchCreditCached = false;
+        fDebitCached = false;
+        fChangeCached = false;
+    }
+
+    void BindWallet(CWallet *pwalletIn)
+    {
+        pwallet = pwalletIn;
+        MarkDirty();
+    }
+
+    void SetSproutNoteData(const mapSproutNoteData_t& noteData);
+    void SetSaplingNoteData(const mapSaplingNoteData_t& noteData);
+    void SetOrchardTxMeta(OrchardWalletTxMeta actionData);
+
+    std::pair<libzcash::SproutNotePlaintext, libzcash::SproutPaymentAddress> DecryptSproutNote(
+        JSOutPoint jsop) const;
+    std::optional<std::pair<
+        libzcash::SaplingNotePlaintext,
+        libzcash::SaplingPaymentAddress>> DecryptSaplingNote(const Consensus::Params& params, int height, SaplingOutPoint op) const;
+    std::optional<std::pair<
+        libzcash::SaplingNotePlaintext,
+        libzcash::SaplingPaymentAddress>> DecryptSaplingNoteWithoutLeadByteCheck(SaplingOutPoint op) const;
+    std::optional<std::pair<
+        libzcash::SaplingNotePlaintext,
+        libzcash::SaplingPaymentAddress>> RecoverSaplingNote(const Consensus::Params& params, int height,
+            SaplingOutPoint op, std::set<uint256>& ovks) const;
+    std::optional<std::pair<
+        libzcash::SaplingNotePlaintext,
+        libzcash::SaplingPaymentAddress>> RecoverSaplingNoteWithoutLeadByteCheck(SaplingOutPoint op, std::set<uint256>& ovks) const;
+    OrchardActions RecoverOrchardActions(const std::vector<uint256>& ovks) const;
+
+    //! filter decides which addresses will count towards the debit
+    CAmount GetDebit(const isminefilter& filter) const;
+    CAmount GetCredit(const isminefilter& filter) const;
+    CAmount GetImmatureCredit(bool fUseCache=true) const;
+    CAmount GetAvailableCredit(bool fUseCache=true, const isminefilter& filter=ISMINE_SPENDABLE) const;
+    CAmount GetImmatureWatchOnlyCredit(const bool fUseCache=true) const;
+    CAmount GetChange() const;
+
+    void GetAmounts(std::list<COutputEntry>& listReceived,
+                    std::list<COutputEntry>& listSent, CAmount& nFee, const isminefilter& filter) const;
+
+    bool IsFromMe(const isminefilter& filter) const;
+
+    bool IsTrusted() const;
+
+    int64_t GetTxTime() const;
+    int GetRequestCount() const;
+
+    bool RelayWalletTransaction();
+
+    std::set<uint256> GetConflicts() const;
+};
+
+class NoteFilter {
+private:
+    std::set<libzcash::SproutPaymentAddress> sproutAddresses;
+    std::set<libzcash::SaplingPaymentAddress> saplingAddresses;
+    std::set<libzcash::OrchardRawAddress> orchardAddresses;
+
+    NoteFilter() {}
+public:
+    static NoteFilter Empty() { return NoteFilter(); }
+    static NoteFilter ForPaymentAddresses(const std::vector<libzcash::PaymentAddress>& addrs);
+
+    const std::set<libzcash::SproutPaymentAddress>& GetSproutAddresses() const {
+        return sproutAddresses;
+    }
+
+    const std::set<libzcash::SaplingPaymentAddress>& GetSaplingAddresses() const {
+        return saplingAddresses;
+    }
+
+    const std::set<libzcash::OrchardRawAddress>& GetOrchardAddresses() const {
+        return orchardAddresses;
+    }
+
+    bool IsEmpty() const {
+        return
+            sproutAddresses.empty() &&
+            saplingAddresses.empty() &&
+            orchardAddresses.empty();
+    }
+
+    bool HasSproutAddress(libzcash::SproutPaymentAddress addr) const {
+        return sproutAddresses.count(addr) > 0;
+    }
+
+    bool HasSaplingAddress(libzcash::SaplingPaymentAddress addr) const {
+        return saplingAddresses.count(addr) > 0;
+    }
+
+    bool HasOrchardAddress(libzcash::OrchardRawAddress addr) const {
+        return orchardAddresses.count(addr) > 0;
+    }
+};
+
+class COutput
+{
+public:
+    const CWalletTx *tx;
+    int i;
+    int nDepth;
+    bool fSpendable;
+    bool fIsCoinbase;
+
+    COutput(const CWalletTx *txIn, int iIn, int nDepthIn, bool fSpendableIn, bool fIsCoinbaseIn = false) :
+            tx(txIn), i(iIn), nDepth(nDepthIn), fSpendable(fSpendableIn), fIsCoinbase(fIsCoinbaseIn){ }
+
+    CAmount Value() const { return tx->vout[i].nValue; }
+    std::string ToString() const;
+};
+
+/**
+ * A strategy to use for managing privacy when constructing a transaction.
+ */
+enum class PrivacyPolicy {
+    FullPrivacy,
+    AllowRevealedAmounts,
+    AllowRevealedRecipients,
+    AllowRevealedSenders,
+    AllowFullyTransparent,
+    AllowLinkingAccountAddresses,
+    NoPrivacy,
+};
+
+class TransactionStrategy {
+    PrivacyPolicy privacy;
+
+public:
+    TransactionStrategy() : privacy(PrivacyPolicy::FullPrivacy) {}
+    TransactionStrategy(const TransactionStrategy& strategy) : privacy(strategy.privacy) {}
+    TransactionStrategy(PrivacyPolicy privacyPolicy) : privacy(privacyPolicy) {}
+
+    static std::optional<TransactionStrategy> FromString(std::string privacyPolicy);
+
+    bool AllowRevealedAmounts();
+    bool AllowRevealedRecipients();
+    bool AllowRevealedSenders();
+    bool AllowLinkingAccountAddresses();
+};
+
+/**
+ * A class representing the ZIP 316 unified spending authority associated with
+ * a ZIP 32 account and this wallet's mnemonic seed. This is intended to be
+ * used as a ZTXOPattern value to choose prior Zcash transaction outputs,
+ * including both transparent UTXOs and shielded notes.
+ *
+ * If the account ID is set to `ZCASH_LEGACY_ACCOUNT`, the instance instead
+ * represents the collective spend authorities of all legacy transparent addresses
+ * generated via the `getnewaddress` RPC method. Shielded notes will never be
+ * selected for this account ID.
+ *
+ * If the set of receiver types provided is non-empty, only outputs for
+ * protocols corresponding to the provided set of receiver types may be used.
+ * If the set of receiver types is empty, no restrictions are placed upon what
+ * protocols outputs are selected for.
+ */
+class AccountZTXOPattern {
+    libzcash::AccountId accountId;
+    std::set<libzcash::ReceiverType> receiverTypes;
+public:
+    AccountZTXOPattern(libzcash::AccountId accountIdIn, std::set<libzcash::ReceiverType> receiverTypesIn):
+        accountId(accountIdIn), receiverTypes(receiverTypesIn) {}
+
+    libzcash::AccountId GetAccountId() const {
+        return accountId;
+    }
+
+    const std::set<libzcash::ReceiverType>& GetReceiverTypes() const {
+        return receiverTypes;
+    }
+
+    bool IncludesP2PKH() const {
+        return receiverTypes.empty() || receiverTypes.count(libzcash::ReceiverType::P2PKH) > 0;
+    }
+
+    bool IncludesP2SH() const {
+        return receiverTypes.empty() || receiverTypes.count(libzcash::ReceiverType::P2SH) > 0;
+    }
+
+    bool IncludesSapling() const {
+        return receiverTypes.empty() || receiverTypes.count(libzcash::ReceiverType::Sapling) > 0;
+    }
+
+    bool IncludesOrchard() const {
+        return receiverTypes.empty() || receiverTypes.count(libzcash::ReceiverType::Orchard) > 0;
+    }
+
+    friend bool operator==(const AccountZTXOPattern &a, const AccountZTXOPattern &b) {
+        return a.accountId == b.accountId && a.receiverTypes == b.receiverTypes;
+    }
+};
+
+/**
+ * A selector which can be used to choose prior Zcash transaction outputs,
+ * including both transparent UTXOs and shielded notes.
+ */
+typedef std::variant<
+    CKeyID,
+    CScriptID,
+    libzcash::SproutPaymentAddress,
+    libzcash::SproutViewingKey,
+    libzcash::SaplingPaymentAddress,
+    libzcash::SaplingExtendedFullViewingKey,
+    libzcash::UnifiedAddress,
+    libzcash::UnifiedFullViewingKey,
+    AccountZTXOPattern> ZTXOPattern;
+
+class ZTXOSelector {
+private:
+    ZTXOPattern pattern;
+    bool requireSpendingKeys;
+
+    ZTXOSelector(ZTXOPattern patternIn, bool requireSpendingKeysIn):
+        pattern(patternIn), requireSpendingKeys(requireSpendingKeysIn) {}
+
+    friend class CWallet;
+public:
+    const ZTXOPattern& GetPattern() const {
+        return pattern;
+    }
+
+    bool RequireSpendingKeys() const {
+        return requireSpendingKeys;
+    }
+
+    bool SelectsTransparent() const;
+    bool SelectsSprout() const;
+    bool SelectsSapling() const;
+    bool SelectsOrchard() const;
+};
+
+enum class RecipientType {
+    WalletExternalAddress,
+    WalletInternalAddress,
+    LegacyChangeAddress,
+    CounterpartyAddress
+};
+
+class SpendableInputs {
+private:
+    bool limited = false;
+
+public:
+    std::vector<COutput> utxos;
+    std::vector<SproutNoteEntry> sproutNoteEntries;
+    std::vector<SaplingNoteEntry> saplingNoteEntries;
+    std::vector<OrchardNoteMetadata> orchardNoteMetadata;
+
+    /**
+     * Selectively discard notes that are not required to obtain the desired
+     * amount. Returns `false` if the available inputs do not add up to the
+     * desired amount.
+     *
+     * `recipientPools` is the set of `OutputPool`s to which the caller intends
+     * to send funds. This is used during note selection to minimise information
+     * leakage. The empty set is short-hand for "all pools".
+     *
+     * This method must only be called once.
+     */
+    bool LimitToAmount(
+        CAmount amount,
+        CAmount dustThreshold,
+        std::set<libzcash::OutputPool> recipientPools);
+
+    /**
+     * Compute the total ZEC amount of spendable inputs.
+     */
+    CAmount Total() const {
+        CAmount result = 0;
+        for (const auto& t : utxos) {
+            result += t.Value();
+        }
+        for (const auto& t : sproutNoteEntries) {
+            result += t.note.value();
+        }
+        for (const auto& t : saplingNoteEntries) {
+            result += t.note.value();
+        }
+        for (const auto& t : orchardNoteMetadata) {
+            result += t.GetNoteValue();
+        }
+        return result;
+    }
+
+    /**
+     * Return whether or not the set of selected UTXOs contains
+     * coinbase outputs.
+     */
+    bool HasTransparentCoinbase() const;
+
+    /**
+     * List spendable inputs in zrpcunsafe log entries.
+     */
+    void LogInputs(const AsyncRPCOperationId& id) const;
+};
+
+/** Private key that includes an expiration date in case it never gets used. */
+class CWalletKey
+{
+public:
+    CPrivKey vchPrivKey;
+    int64_t nTimeCreated;
+    int64_t nTimeExpires;
+    std::string strComment;
+    //! todo: add something to note what created it (user, getnewaddress, change)
+    //!   maybe should have a map<string, string> property map
+
+    CWalletKey(int64_t nExpires=0);
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        int nVersion = s.GetVersion();
+        if (!(s.GetType() & SER_GETHASH))
+            READWRITE(nVersion);
+        READWRITE(vchPrivKey);
+        READWRITE(nTimeCreated);
+        READWRITE(nTimeExpires);
+        READWRITE(LIMITED_STRING(strComment, 65536));
+    }
+};
+
+class UFVKAddressMetadata
+{
+private:
+    // The account ID may be absent for imported UFVKs, and also may temporarily
+    // be absent when this data structure is in a partially-reconstructed state
+    // during the wallet load process.
+    std::optional<libzcash::AccountId> accountId;
+    std::map<libzcash::diversifier_index_t, std::set<libzcash::ReceiverType>> addressReceivers;
+public:
+    UFVKAddressMetadata() {}
+    UFVKAddressMetadata(libzcash::AccountId accountId): accountId(accountId) {}
+
+    /**
+     * Return all currently known diversifier indices for which addresses
+     * have been generated, each accompanied by the associated set of receiver
+     * types that were used when generating that address.
+     */
+    const std::map<libzcash::diversifier_index_t, std::set<libzcash::ReceiverType>>& GetKnownReceiverSetsByDiversifierIndex() const {
+        return addressReceivers;
+    }
+
+    std::optional<std::set<libzcash::ReceiverType>> GetReceivers(
+            const libzcash::diversifier_index_t& j) const {
+        auto receivers = addressReceivers.find(j);
+        if (receivers != addressReceivers.end()) {
+            return receivers->second;
+        } else {
+            return std::nullopt;
+        }
+    }
+
+    /**
+     * Add the specified set of receivers at the provided diversifier index.
+     *
+     * Returns `true` if this is a new entry or if the operation would not
+     * alter the existing set of receiver types at this index, `false`
+     * otherwise.
+     */
+    bool SetReceivers(
+            const libzcash::diversifier_index_t& j,
+            const std::set<libzcash::ReceiverType>& receivers) {
+        const auto [it, success] = addressReceivers.insert(std::make_pair(j, receivers));
+        if (success) {
+            return true;
+        } else {
+            return it->second == receivers;
+        }
+    }
+
+    std::optional<libzcash::AccountId> GetAccountId() const {
+        return accountId;
+    }
+
+    bool SetAccountId(libzcash::AccountId accountIdIn) {
+        if (accountId.has_value()) {
+            return (accountIdIn == accountId.value());
+        } else {
+            accountId = accountIdIn;
+            return true;
+        }
+    }
+
+    /**
+     * Search the for the maximum diversifier that has already been used to
+     * generate a new address, and return the next diversifier. Returns the
+     * zero diversifier index if no addresses have yet been generated,
+     * and returns std::nullopt if the increment operation would cause an
+     * overflow.
+     */
+    std::optional<libzcash::diversifier_index_t> GetNextDiversifierIndex() {
+        if (addressReceivers.empty()) {
+            return libzcash::diversifier_index_t(0);
+        } else {
+            return addressReceivers.rbegin()->first.succ();
+        }
+    }
+};
+
+/**
+ * A CWallet is an extension of a keystore, which also maintains a set of transactions and balances,
+ * and provides the ability to create new transactions.
+ */
+class CWallet : public CCryptoKeyStore, public CValidationInterface
+{
+private:
+    friend class CWalletTx;
+
+    /**
+     * Select a set of coins such that nValueRet >= nTargetValue and at least
+     * all coins from coinControl are selected; Never select unconfirmed coins
+     * if they are not ours
+     */
+    bool SelectCoins(const CAmount& nTargetValue, std::set<std::pair<const CWalletTx*,unsigned int> >& setCoinsRet, CAmount& nValueRet, bool& fOnlyCoinbaseCoinsRet, bool& fNeedCoinbaseCoinsRet, const CCoinControl *coinControl = NULL) const;
+
+    CWalletDB *pwalletdbEncryption;
+
+    //! the current wallet version: clients below this version are not able to load the wallet
+    int nWalletVersion;
+
+    //! the maximum wallet format version: memory-only variable that specifies to what version this wallet may be upgraded
+    int nWalletMaxVersion;
+
+    int64_t nNextResend;
+    int64_t nLastResend;
+    int64_t nLastSetChain;
+    int nSetChainUpdates;
+    bool fBroadcastTransactions;
+
+    /**
+     * A map from a protocol-specific transaction output identifier to
+     * a txid.
+     */
+    template <class T>
+    using TxSpendMap = std::multimap<T, uint256>;
+
+    /**
+     * Used to keep track of spent outpoints, and
+     * detect and report conflicts (double-spends or
+     * mutated transactions where the mutant gets mined).
+     */
+    typedef TxSpendMap<COutPoint> TxSpends;
+    TxSpends mapTxSpends;
+
+    /**
+     * Used to keep track of spent Notes, and
+     * detect and report conflicts (double-spends).
+     */
+    typedef TxSpendMap<uint256> TxNullifiers;
+    TxNullifiers mapTxSproutNullifiers;
+    TxNullifiers mapTxSaplingNullifiers;
+
+    std::vector<CTransaction> pendingSaplingMigrationTxs;
+    AsyncRPCOperationId saplingMigrationOperationId;
+
+    void AddToTransparentSpends(const COutPoint& outpoint, const uint256& wtxid);
+    void AddToSproutSpends(const uint256& nullifier, const uint256& wtxid);
+    void AddToSaplingSpends(const uint256& nullifier, const uint256& wtxid);
+    void AddToSpends(const uint256& wtxid);
+
+public:
+    /*
+     * Size of the incremental witness cache for the notes in our wallet.
+     * This will always be greater than or equal to the size of the largest
+     * incremental witness cache in any transaction in mapWallet.
+     */
+    int64_t nWitnessCacheSize;
+    bool fSaplingMigrationEnabled = false;
+
+    void ClearNoteWitnessCache();
+
+protected:
+    /**
+     * pindex is the new tip being connected.
+     */
+    void IncrementNoteWitnesses(
+            const Consensus::Params& consensus,
+            const CBlockIndex* pindex,
+            const CBlock* pblock,
+            MerkleFrontiers& frontiers,
+            bool performOrchardWalletUpdates
+            );
+    /**
+     * pindex is the old tip being disconnected.
+     */
+    void DecrementNoteWitnesses(
+            const Consensus::Params& consensus,
+            const CBlockIndex* pindex
+            );
+
+    template <typename WalletDB>
+    void SetBestChainINTERNAL(WalletDB& walletdb, const CBlockLocator& loc) {
+        if (!walletdb.TxnBegin()) {
+            // This needs to be done atomically, so don't do it at all
+            LogPrintf("SetBestChain(): Couldn't start atomic write\n");
+            return;
+        }
+        try {
+            LOCK(cs_wallet);
+            for (std::pair<const uint256, CWalletTx>& wtxItem : mapWallet) {
+                auto wtx = wtxItem.second;
+                // We skip transactions for which mapSproutNoteData and mapSaplingNoteData
+                // are empty. This covers transactions that have no Sprout or Sapling data
+                // (i.e. are purely transparent), as well as shielding and unshielding
+                // transactions in which we only have transparent addresses involved.
+                if (!(wtx.mapSproutNoteData.empty() && wtx.mapSaplingNoteData.empty())) {
+                    if (!walletdb.WriteTx(wtx)) {
+                        LogPrintf("SetBestChain(): Failed to write CWalletTx, aborting atomic write\n");
+                        walletdb.TxnAbort();
+                        return;
+                    }
+                }
+            }
+            // Add persistence of Orchard incremental witness tree
+            orchardWallet.GarbageCollect();
+            if (!walletdb.WriteOrchardWitnesses(orchardWallet)) {
+                LogPrintf("SetBestChain(): Failed to write Orchard witnesses, aborting atomic write\n");
+                walletdb.TxnAbort();
+                return;
+            }
+            if (!walletdb.WriteWitnessCacheSize(nWitnessCacheSize)) {
+                LogPrintf("SetBestChain(): Failed to write nWitnessCacheSize, aborting atomic write\n");
+                walletdb.TxnAbort();
+                return;
+            }
+            if (!walletdb.WriteBestBlock(loc)) {
+                LogPrintf("SetBestChain(): Failed to write best block, aborting atomic write\n");
+                walletdb.TxnAbort();
+                return;
+            }
+        } catch (const std::exception &exc) {
+            // Unexpected failure
+            LogPrintf("SetBestChain(): Unexpected error during atomic write:\n");
+            LogPrintf("%s\n", exc.what());
+            walletdb.TxnAbort();
+            return;
+        }
+        if (!walletdb.TxnCommit()) {
+            // Couldn't commit all to db, but in-memory state is fine
+            LogPrintf("SetBestChain(): Couldn't commit atomic write\n");
+            return;
+        }
+    }
+
+private:
+    template <class T>
+    void SyncMetaData(std::pair<typename TxSpendMap<T>::iterator, typename TxSpendMap<T>::iterator>);
+    void ChainTipAdded(
+            const CBlockIndex *pindex,
+            const CBlock *pblock,
+            MerkleFrontiers frontiers,
+            bool performOrchardWalletUpdates);
+
+    /* Add a transparent secret key to the wallet. Internal use only. */
+    CPubKey AddTransparentSecretKey(
+            const uint256& seedFingerprint,
+            const CKey& secret,
+            const HDKeyPath& keyPath);
+
+    std::map<libzcash::OrchardIncomingViewingKey, CKeyMetadata> mapOrchardZKeyMetadata;
+
+protected:
+    bool UpdatedNoteData(const CWalletTx& wtxIn, CWalletTx& wtx);
+    void MarkAffectedTransactionsDirty(const CTransaction& tx);
+
+    /* the hd chain metadata for keys derived from the mnemonic seed */
+    std::optional<CHDChain> mnemonicHDChain;
+
+    /* the network ID string for the network for which this wallet was created */
+    std::string networkIdString;
+
+    /* The Orchard subset of wallet data. As many operations as possible are
+     * delegated to the Orchard wallet.
+     */
+    OrchardWallet orchardWallet;
+
+public:
+    /*
+     * Main wallet lock.
+     * This lock protects all the fields added by CWallet
+     *   except for:
+     *      fFileBacked (immutable after instantiation)
+     *      strWalletFile (immutable after instantiation)
+     */
+    mutable CCriticalSection cs_wallet;
+
+    bool fFileBacked;
+    std::string strWalletFile;
+
+    std::set<int64_t> setKeyPool;
+    std::map<CKeyID, CKeyMetadata> mapKeyMetadata;
+
+    std::map<libzcash::SproutPaymentAddress, CKeyMetadata> mapSproutZKeyMetadata;
+    std::map<libzcash::SaplingIncomingViewingKey, CKeyMetadata> mapSaplingZKeyMetadata;
+    std::map<std::pair<libzcash::SeedFingerprint, libzcash::AccountId>, libzcash::UFVKId> mapUnifiedAccountKeys;
+    std::map<libzcash::UFVKId, UFVKAddressMetadata> mapUfvkAddressMetadata;
+
+    typedef std::map<unsigned int, CMasterKey> MasterKeyMap;
+    MasterKeyMap mapMasterKeys;
+    unsigned int nMasterKeyMaxID;
+
+    CWallet(const CChainParams& params)
+    {
+        SetNull(params);
+    }
+
+    CWallet(const CChainParams& params, const std::string& strWalletFileIn)
+    {
+        SetNull(params);
+
+        strWalletFile = strWalletFileIn;
+        fFileBacked = true;
+    }
+
+    ~CWallet()
+    {
+        delete pwalletdbEncryption;
+        pwalletdbEncryption = NULL;
+    }
+
+    void SetNull(const CChainParams& params)
+    {
+        nWalletVersion = FEATURE_BASE;
+        nWalletMaxVersion = FEATURE_BASE;
+        fFileBacked = false;
+        nMasterKeyMaxID = 0;
+        pwalletdbEncryption = NULL;
+        nOrderPosNext = 0;
+        nNextResend = 0;
+        nLastResend = 0;
+        nLastSetChain = 0;
+        nSetChainUpdates = 0;
+        nTimeFirstKey = 0;
+        fBroadcastTransactions = false;
+        nWitnessCacheSize = 0;
+        networkIdString = params.NetworkIDString();
+    }
+
+    /**
+     * The reverse mapping of nullifiers to notes.
+     *
+     * The mapping cannot be updated while an encrypted wallet is locked,
+     * because we need the SpendingKey to create the nullifier (#1502). This has
+     * several implications for transactions added to the wallet while locked:
+     *
+     * - Parent transactions can't be marked dirty when a child transaction that
+     *   spends their output notes is updated.
+     *
+     *   - We currently don't cache any note values, so this is not a problem,
+     *     yet.
+     *
+     * - GetFilteredNotes can't filter out spent notes.
+     *
+     *   - Per the comment in SproutNoteData, we assume that if we don't have a
+     *     cached nullifier, the note is not spent.
+     *
+     * Another more problematic implication is that the wallet can fail to
+     * detect transactions on the blockchain that spend our notes. There are two
+     * possible cases in which this could happen:
+     *
+     * - We receive a note when the wallet is locked, and then spend it using a
+     *   different wallet client.
+     *
+     * - We spend from a PaymentAddress we control, then we export the
+     *   SpendingKey and import it into a new wallet, and reindex/rescan to find
+     *   the old transactions.
+     *
+     * The wallet will only miss "pure" spends - transactions that are only
+     * linked to us by the fact that they contain notes we spent. If it also
+     * sends notes to us, or interacts with our transparent addresses, we will
+     * detect the transaction and add it to the wallet (again without caching
+     * nullifiers for new notes). As by default JoinSplits send change back to
+     * the origin PaymentAddress, the wallet should rarely miss transactions.
+     *
+     * To work around these issues, whenever the wallet is unlocked, we scan all
+     * cached notes, and cache any missing nullifiers. Since the wallet must be
+     * unlocked in order to spend notes, this means that GetFilteredNotes will
+     * always behave correctly within that context (and any other uses will give
+     * correct responses afterwards), for the transactions that the wallet was
+     * able to detect. Any missing transactions can be rediscovered by:
+     *
+     * - Unlocking the wallet (to fill all nullifier caches).
+     *
+     * - Restarting the node with -reindex (which operates on a locked wallet
+     *   but with the now-cached nullifiers).
+     */
+    std::map<uint256, JSOutPoint> mapSproutNullifiersToNotes;
+
+    std::map<uint256, SaplingOutPoint> mapSaplingNullifiersToNotes;
+
+    std::map<uint256, CWalletTx> mapWallet;
+
+    std::map<uint256, std::vector<RecipientMapping>> sendRecipients;
+
+    typedef std::multimap<int64_t, CWalletTx*> TxItems;
+    TxItems wtxOrdered;
+
+    int64_t nOrderPosNext;
+    std::map<uint256, int> mapRequestCount;
+
+    std::map<CTxDestination, CAddressBookData> mapAddressBook;
+
+    CPubKey vchDefaultKey;
+
+    std::set<COutPoint> setLockedCoins;
+    std::set<JSOutPoint> setLockedSproutNotes;
+    std::set<SaplingOutPoint> setLockedSaplingNotes;
+
+    int64_t nTimeFirstKey;
+
+    const CWalletTx* GetWalletTx(const uint256& hash) const;
+
+    //! check whether we are allowed to upgrade (or already support) to the named feature
+    bool CanSupportFeature(enum WalletFeature wf) { AssertLockHeld(cs_wallet); return nWalletMaxVersion >= wf; }
+
+    /**
+     * populate vCoins with vector of available COutputs.
+     */
+    void AvailableCoins(std::vector<COutput>& vCoins,
+                        bool fOnlyConfirmed=true,
+                        const CCoinControl *coinControl = NULL,
+                        bool fIncludeZeroValue=false,
+                        bool fIncludeCoinBase=true,
+                        bool fOnlySpendable=false,
+                        int nMinDepth = 0,
+                        std::set<CTxDestination>* onlyFilterByDests = nullptr) const;
+
+    /**
+     * Shuffle and select coins until nTargetValue is reached while avoiding
+     * small change; This method is stochastic for some inputs and upon
+     * completion the coin set and corresponding actual target value is
+     * assembled
+     */
+    static bool SelectCoinsMinConf(const CAmount& nTargetValue, int nConfMine, int nConfTheirs, std::vector<COutput> vCoins, std::set<std::pair<const CWalletTx*,unsigned int> >& setCoinsRet, CAmount& nValueRet);
+
+    /**
+     * Returns the ZTXO selector for the specified account ID.
+     *
+     * Returns `std::nullopt` if the account ID has not been generated yet by
+     * the wallet.
+     *
+     * If the `requireSpendingKey` flag is set, this will only return a selector
+     * that will choose outputs for which this wallet holds the spending keys.
+     */
+    std::optional<ZTXOSelector> ZTXOSelectorForAccount(
+            libzcash::AccountId account,
+            bool requireSpendingKey,
+            std::set<libzcash::ReceiverType> receiverTypes={}) const;
+
+    /**
+     * Returns the ZTXO selector for the specified payment address, if the
+     * address is known to the wallet. If the `requireSpendingKey` flag is set,
+     * this will only return a selector that will choose outputs for which this
+     * wallet holds the spending keys.
+     */
+    std::optional<ZTXOSelector> ZTXOSelectorForAddress(
+            const libzcash::PaymentAddress& addr,
+            bool requireSpendingKey,
+            bool allowAddressLinkability) const;
+
+    /**
+     * Returns the ZTXO selector for the specified viewing key, if that key
+     * is known to the wallet. If the `requireSpendingKey` flag is set, this
+     * will only return a selector that will choose outputs for which this
+     * wallet holds the spending keys.
+     */
+    std::optional<ZTXOSelector> ZTXOSelectorForViewingKey(
+            const libzcash::ViewingKey& vk,
+            bool requireSpendingKey) const;
+
+    /**
+     * Returns the ZTXO selector that will select UTXOs sent to legacy
+     * transparent addresses managed by this wallet.
+     */
+    static ZTXOSelector LegacyTransparentZTXOSelector(bool requireSpendingKey);
+
+    /**
+     * Look up the account for a given selector. This resolves the account ID
+     * even in the in that a bare transparent or Sapling address that
+     * corresponds to a non-legacy account is provided as a selector.  This is
+     * used in z_sendmany to ensure that we always correctly determine change
+     * addresses and OVKs on the basis of account UFVKs when possible.
+     */
+    std::optional<libzcash::AccountId> FindAccountForSelector(const ZTXOSelector& paymentSource) const;
+
+    /**
+     * Generate a change address for the specified account.
+     *
+     * If a shielded change address is requested, this will return the default
+     * unified address for the internal unified full viewing key.
+     *
+     * If a transparent change address is requested, this will generate a fresh
+     * diversified unified address from the internal unified full viewing key,
+     * and return the associated transparent change address.
+     *
+     * Returns `std::nullopt` if the account does not have an internal spending
+     * key matching the requested `OutputPool`.
+     */
+    std::optional<libzcash::RecipientAddress> GenerateChangeAddressForAccount(
+            libzcash::AccountId accountId,
+            std::set<libzcash::OutputPool> changeOptions);
+
+    SpendableInputs FindSpendableInputs(
+            ZTXOSelector paymentSource,
+            bool allowTransparentCoinbase,
+            uint32_t minDepth) const;
+
+    bool SelectorMatchesAddress(const ZTXOSelector& source, const CTxDestination& a0) const;
+    bool SelectorMatchesAddress(const ZTXOSelector& source, const libzcash::SproutPaymentAddress& a0) const;
+    bool SelectorMatchesAddress(const ZTXOSelector& source, const libzcash::SaplingPaymentAddress& a0) const;
+
+    bool IsSpent(const uint256& hash, unsigned int n) const;
+    bool IsSproutSpent(const uint256& nullifier) const;
+    bool IsSaplingSpent(const uint256& nullifier) const;
+    bool IsOrchardSpent(const OrchardOutPoint& outpoint) const;
+
+    bool IsLockedCoin(uint256 hash, unsigned int n) const;
+    void LockCoin(COutPoint& output);
+    void UnlockCoin(COutPoint& output);
+    void UnlockAllCoins();
+    void ListLockedCoins(std::vector<COutPoint>& vOutpts);
+
+    bool IsLockedNote(const JSOutPoint& outpt) const;
+    void LockNote(const JSOutPoint& output);
+    void UnlockNote(const JSOutPoint& output);
+    void UnlockAllSproutNotes();
+    std::vector<JSOutPoint> ListLockedSproutNotes();
+
+    bool IsLockedNote(const SaplingOutPoint& output) const;
+    void LockNote(const SaplingOutPoint& output);
+    void UnlockNote(const SaplingOutPoint& output);
+    void UnlockAllSaplingNotes();
+    std::vector<SaplingOutPoint> ListLockedSaplingNotes();
+
+    /**
+     * keystore implementation
+     * Generate a new key
+     */
+    CPubKey GenerateNewKey(bool external);
+    //! Adds a key to the store, and saves it to disk.
+    bool AddKeyPubKey(const CKey& key, const CPubKey &pubkey);
+    //! Adds a key to the store, without saving it to disk (used by LoadWallet)
+    bool LoadKey(const CKey& key, const CPubKey &pubkey) { return CCryptoKeyStore::AddKeyPubKey(key, pubkey); }
+    //! Load metadata (used by LoadWallet)
+    void LoadKeyMetadata(const CPubKey &pubkey, const CKeyMetadata &metadata);
+
+    bool LoadMinVersion(int nVersion) { AssertLockHeld(cs_wallet); nWalletVersion = nVersion; nWalletMaxVersion = std::max(nWalletMaxVersion, nVersion); return true; }
+
+    //! Adds an encrypted key to the store, and saves it to disk.
+    bool AddCryptedKey(const CPubKey &vchPubKey, const std::vector<unsigned char> &vchCryptedSecret);
+    //! Adds an encrypted key to the store, without saving it to disk (used by LoadWallet)
+    bool LoadCryptedKey(const CPubKey &vchPubKey, const std::vector<unsigned char> &vchCryptedSecret);
+    bool AddCScript(const CScript& redeemScript);
+    bool LoadCScript(const CScript& redeemScript);
+
+    //! Erases a destination data tuple in the store and on disk
+    bool EraseDestData(const CTxDestination &dest, const std::string &key);
+    //! Adds a destination data tuple to the store, without saving it to disk
+    bool LoadDestData(const CTxDestination &dest, const std::string &key, const std::string &value);
+    //! Look up a destination data tuple in the store, return true if found false otherwise
+    bool GetDestData(const CTxDestination &dest, const std::string &key, std::string *value) const;
+
+    //! Adds a watch-only address to the store, and saves it to disk.
+    bool AddWatchOnly(const CScript &dest);
+    bool RemoveWatchOnly(const CScript &dest);
+    //! Adds a watch-only address to the store, without saving it to disk (used by LoadWallet)
+    bool LoadWatchOnly(const CScript &dest);
+
+    bool Unlock(const SecureString& strWalletPassphrase);
+    bool ChangeWalletPassphrase(const SecureString& strOldWalletPassphrase, const SecureString& strNewWalletPassphrase);
+    bool EncryptWallet(const SecureString& strWalletPassphrase);
+
+    void GetKeyBirthTimes(std::map<CKeyID, int64_t> &mapKeyBirth) const;
+
+    /**
+      * Sprout ZKeys
+      */
+    //! Generates a new Sprout zaddr
+    libzcash::SproutPaymentAddress GenerateNewSproutZKey();
+    //! Adds spending key to the store, and saves it to disk
+    bool AddSproutZKey(const libzcash::SproutSpendingKey &key);
+    //! Adds spending key to the store, without saving it to disk (used by LoadWallet)
+    bool LoadZKey(const libzcash::SproutSpendingKey &key);
+    //! Load spending key metadata (used by LoadWallet)
+    void LoadZKeyMetadata(const libzcash::SproutPaymentAddress &addr, const CKeyMetadata &meta);
+    //! Adds an encrypted spending key to the store, without saving it to disk (used by LoadWallet)
+    bool LoadCryptedZKey(const libzcash::SproutPaymentAddress &addr, const libzcash::ReceivingKey &rk, const std::vector<unsigned char> &vchCryptedSecret);
+    //! Adds an encrypted spending key to the store, and saves it to disk (virtual method, declared in crypter.h)
+    bool AddCryptedSproutSpendingKey(
+        const libzcash::SproutPaymentAddress &address,
+        const libzcash::ReceivingKey &rk,
+        const std::vector<unsigned char> &vchCryptedSecret);
+
+    //! Adds a Sprout viewing key to the store, and saves it to disk.
+    bool AddSproutViewingKey(const libzcash::SproutViewingKey &vk);
+    bool RemoveSproutViewingKey(const libzcash::SproutViewingKey &vk);
+    //! Adds a Sprout viewing key to the store, without saving it to disk (used by LoadWallet)
+    bool LoadSproutViewingKey(const libzcash::SproutViewingKey &dest);
+
+    /**
+      * Sapling ZKeys
+      */
+
+    //! Generates new Sapling key, stores the newly generated spending
+    //! key to the wallet, and returns the default address for the newly generated key.
+    libzcash::SaplingPaymentAddress GenerateNewLegacySaplingZKey();
+    //! Generates Sapling key at the specified address index, and stores that
+    //! key to the wallet if it has not already been persisted. Returns the
+    //! default address for the key, and a flag that is true when the key
+    //! was newly generated (not already in the wallet).
+    std::pair<libzcash::SaplingPaymentAddress, bool> GenerateLegacySaplingZKey(uint32_t addrIndex);
+    //! Adds Sapling spending key to the store, and saves it to disk
+    bool AddSaplingZKey(const libzcash::SaplingExtendedSpendingKey &key);
+    //! Add Sapling full viewing key to the wallet.
+    //!
+    //! This overrides CBasicKeyStore::AddSaplingFullViewingKey to persist the
+    //! full viewing key to disk. Inside CCryptoKeyStore and CBasicKeyStore,
+    //! CBasicKeyStore::AddSaplingFullViewingKey is called directly when adding a
+    //! full viewing key to the keystore, to avoid this override.
+    bool AddSaplingFullViewingKey(
+            const libzcash::SaplingExtendedFullViewingKey &extfvk);
+    bool AddSaplingPaymentAddress(
+        const libzcash::SaplingIncomingViewingKey &ivk,
+        const libzcash::SaplingPaymentAddress &addr);
+    bool AddCryptedSaplingSpendingKey(
+        const libzcash::SaplingExtendedFullViewingKey &extfvk,
+        const std::vector<unsigned char> &vchCryptedSecret);
+    //! Adds spending key to the store, without saving it to disk (used by LoadWallet)
+    bool LoadSaplingZKey(const libzcash::SaplingExtendedSpendingKey &key);
+    //! Load spending key metadata (used by LoadWallet)
+    void LoadSaplingZKeyMetadata(const libzcash::SaplingIncomingViewingKey &ivk, const CKeyMetadata &meta);
+    //! Add Sapling full viewing key to the store, without saving it to disk (used by LoadWallet)
+    bool LoadSaplingFullViewingKey(const libzcash::SaplingExtendedFullViewingKey &extfvk);
+    //! Adds a Sapling payment address -> incoming viewing key map entry,
+    //! without saving it to disk (used by LoadWallet)
+    bool LoadSaplingPaymentAddress(
+        const libzcash::SaplingPaymentAddress &addr,
+        const libzcash::SaplingIncomingViewingKey &ivk);
+    //! Adds an encrypted spending key to the store, without saving it to disk (used by LoadWallet)
+    bool LoadCryptedSaplingZKey(const libzcash::SaplingExtendedFullViewingKey &extfvk,
+                                const std::vector<unsigned char> &vchCryptedSecret);
+
+    //
+    // Orchard Support
+    //
+
+    bool AddOrchardZKey(const libzcash::OrchardSpendingKey &sk);
+    bool AddOrchardFullViewingKey(const libzcash::OrchardFullViewingKey &fvk);
+    /**
+     * Adds an address/ivk mapping to the in-memory wallet. Returns `false` if
+     * the mapping could not be persisted, or the IVK does not correspond to an
+     * FVK known by the wallet.
+     */
+    bool AddOrchardRawAddress(
+        const libzcash::OrchardIncomingViewingKey &ivk,
+        const libzcash::OrchardRawAddress &addr);
+    /**
+     * Loads an address/ivk mapping to the in-memory wallet. Returns `true`
+     * if the provided IVK corresponds to an FVK known by the wallet.
+     */
+    bool LoadOrchardRawAddress(
+        const libzcash::OrchardRawAddress &addr,
+        const libzcash::OrchardIncomingViewingKey &ivk);
+
+    /**
+     * Returns a loader that can be used to read an Orchard note commitment
+     * tree from a stream into the Orchard wallet.
+     */
+    OrchardWalletNoteCommitmentTreeLoader GetOrchardNoteCommitmentTreeLoader();
+
+    //
+    // Unified keys, addresses, and accounts
+    //
+
+    //! Obtain the account key for the legacy account by deriving it from
+    //! the wallet's mnemonic seed.
+    libzcash::transparent::AccountKey GetLegacyAccountKey() const;
+
+    //! Generate the unified spending key from the wallet's mnemonic seed
+    //! for the next unused account identifier.
+    std::pair<libzcash::UnifiedFullViewingKey, libzcash::AccountId>
+        GenerateNewUnifiedSpendingKey();
+
+    //! Generate the unified spending key for the specified ZIP-32/BIP-44
+    //! account identifier from the wallet's mnemonic seed, or returns
+    //! std::nullopt if the account identifier does not produce a valid
+    //! spending key for all receiver types.
+    std::optional<libzcash::ZcashdUnifiedSpendingKey>
+        GenerateUnifiedSpendingKeyForAccount(libzcash::AccountId accountId);
+
+    //! Retrieves the UFVK derived from the wallet's mnemonic seed for the specified account.
+    std::optional<libzcash::ZcashdUnifiedFullViewingKey>
+        GetUnifiedFullViewingKeyByAccount(libzcash::AccountId account) const;
+
+    //! Generate a new unified address for the specified account, diversifier, and
+    //! set of receiver types.
+    //!
+    //! If no diversifier index is provided, the next unused diversifier index
+    //! will be selected.
+    WalletUAGenerationResult GenerateUnifiedAddress(
+        const libzcash::AccountId& accountId,
+        const std::set<libzcash::ReceiverType>& receivers,
+        std::optional<libzcash::diversifier_index_t> j = std::nullopt);
+
+    bool AddUnifiedFullViewingKey(const libzcash::UnifiedFullViewingKey &ufvk);
+
+    bool LoadUnifiedFullViewingKey(const libzcash::UnifiedFullViewingKey &ufvk);
+    bool LoadUnifiedAccountMetadata(const ZcashdUnifiedAccountMetadata &skmeta);
+    bool LoadUnifiedAddressMetadata(const ZcashdUnifiedAddressMetadata &addrmeta);
+
+    std::pair<libzcash::PaymentAddress, RecipientType> GetPaymentAddressForRecipient(
+            const uint256& txid,
+            const libzcash::RecipientAddress& recipient) const;
+
+    bool IsInternalRecipient(
+            const libzcash::RecipientAddress& recipient) const;
+
+    void LoadRecipientMapping(const uint256& txid, const RecipientMapping& mapping);
+
+    //! Reconstructs (in memory) caches and mappings for unified accounts,
+    //! addresses and keying material. This should be called once, after the
+    //! remainder of the on-disk wallet data has been loaded.
+    //!
+    //! Returns true if and only if there were no detected inconsistencies or
+    //! failures in reconstructing the cache.
+    bool LoadCaches();
+
+    std::optional<libzcash::AccountId> GetUnifiedAccountId(const libzcash::UFVKId& ufvkId) const;
+
+    /**
+     * Reconstructs a unified address by determining the UFVK that the receiver
+     * is associated with, combined with the set of receiver types that were
+     * associated with the diversifier index that the provided receiver
+     * corresponds to.
+     */
+    std::optional<libzcash::UnifiedAddress> FindUnifiedAddressByReceiver(
+            const libzcash::Receiver& receiver) const;
+
+    /**
+     * Finds a unified account ID for a given receiver.
+     */
+    std::optional<libzcash::AccountId> FindUnifiedAccountByReceiver(
+            const libzcash::Receiver& receiver) const;
+
+    /**
+     * Increment the next transaction order id
+     * @return next transaction order id
+     */
+    int64_t IncOrderPosNext(CWalletDB *pwalletdb = NULL);
+
+    DBErrors ReorderTransactions();
+
+    void MarkDirty();
+    bool UpdateNullifierNoteMap();
+    void UpdateNullifierNoteMapWithTx(const CWalletTx& wtx);
+    void UpdateSaplingNullifierNoteMapWithTx(CWalletTx& wtx);
+    void UpdateSaplingNullifierNoteMapForBlock(const CBlock* pblock);
+    void LoadWalletTx(const CWalletTx& wtxIn);
+    bool AddToWallet(const CWalletTx& wtxIn, CWalletDB* pwalletdb);
+    void SyncTransaction(const CTransaction& tx, const CBlock* pblock, const int nHeight);
+    bool AddToWalletIfInvolvingMe(
+            const Consensus::Params& consensus,
+            const CTransaction& tx,
+            const CBlock* pblock,
+            const int nHeight,
+            bool fUpdate
+            );
+    void EraseFromWallet(const uint256 &hash);
+    void WitnessNoteCommitment(
+         std::vector<uint256> commitments,
+         std::vector<std::optional<SproutWitness>>& witnesses,
+         uint256 &final_anchor);
+    int ScanForWalletTransactions(
+        CBlockIndex* pindexStart,
+        bool fUpdate,
+        bool isInitScan);
+    void ReacceptWalletTransactions();
+    void ResendWalletTransactions(int64_t nBestBlockTime);
+    std::vector<uint256> ResendWalletTransactionsBefore(int64_t nTime);
+    CAmount GetBalance(const isminefilter& filter=ISMINE_SPENDABLE, const int min_depth=0) const;
+    CAmount GetUnconfirmedBalance() const;
+    CAmount GetImmatureBalance() const;
+    CAmount GetUnconfirmedWatchOnlyBalance() const;
+    CAmount GetImmatureWatchOnlyBalance() const;
+    CAmount GetLegacyBalance(const isminefilter& filter, int minDepth) const;
+
+    /**
+     * Insert additional inputs into the transaction by
+     * calling CreateTransaction();
+     */
+    bool FundTransaction(CMutableTransaction& tx, CAmount& nFeeRet, int& nChangePosRet, std::string& strFailReason, bool includeWatching);
+
+    /**
+     * Create a new transaction paying the recipients with a set of coins
+     * selected by SelectCoins(); Also create the change output, when needed
+     */
+    bool CreateTransaction(const std::vector<CRecipient>& vecSend, CWalletTx& wtxNew, CReserveKey& reservekey, CAmount& nFeeRet, int& nChangePosRet,
+                           std::string& strFailReason, const CCoinControl *coinControl = NULL, bool sign = true);
+
+    /**
+     * Save a set of (txid, RecipientAddress, std::optional<UnifiedAddress>) mappings to the wallet.
+     * This information is persisted so that it's possible to correctly display the unified
+     * address to which a payment was sent.
+     */
+    template <typename RecipientMapping>
+    bool SaveRecipientMappings(const uint256& txid, const std::vector<RecipientMapping>& recipients)
+    {
+        LOCK2(cs_main, cs_wallet);
+
+        for (const auto& recipient : recipients)
+        {
+            sendRecipients[txid].push_back(recipient);
+            if (recipient.ua.has_value()) {
+                if (!CWalletDB(strWalletFile).WriteRecipientMapping(
+                    txid,
+                    recipient.address,
+                    recipient.ua.value()
+                )) {
+                    LogPrintf("SaveRecipientMappings: Failed to write recipient mappings to the wallet database.");
+                    return false;
+                };
+            }
+        }
+
+        return true;
+    }
+
+    bool CommitTransaction(CWalletTx& wtxNew, std::optional<std::reference_wrapper<CReserveKey>> reservekey);
+
+    static CFeeRate minTxFee;
+    /**
+     * Estimate the minimum fee considering user set parameters
+     * and the required fee
+     */
+    static CAmount GetMinimumFee(unsigned int nTxBytes, unsigned int nConfirmTarget, const CTxMemPool& pool);
+    /**
+     * Return the minimum required fee taking into account the
+     * floating relay fee and user set minimum transaction fee
+     */
+    static CAmount GetRequiredFee(unsigned int nTxBytes);
+
+    /**
+     * The set of default receiver types used when the wallet generates
+     * unified addresses, as of the specified chain height.
+     */
+    static std::set<libzcash::ReceiverType> DefaultReceiverTypes(int nHeight);
+
+private:
+    bool NewKeyPool();
+public:
+    bool TopUpKeyPool(unsigned int kpSize = 0);
+    void ReserveKeyFromKeyPool(int64_t& nIndex, CKeyPool& keypool);
+    void KeepKey(int64_t nIndex);
+    void ReturnKey(int64_t nIndex);
+    int64_t GetOldestKeyPoolTime();
+    void GetAllReserveKeys(std::set<CKeyID>& setAddress) const;
+
+    std::set< std::set<CTxDestination> > GetAddressGroupings();
+    std::map<CTxDestination, CAmount> GetAddressBalances();
+
+    std::optional<uint256> GetSproutNoteNullifier(
+        const JSDescription& jsdesc,
+        const libzcash::SproutPaymentAddress& address,
+        const ZCNoteDecryption& dec,
+        const uint256& hSig,
+        uint8_t n) const;
+    mapSproutNoteData_t FindMySproutNotes(const CTransaction& tx) const;
+    std::pair<mapSaplingNoteData_t, SaplingIncomingViewingKeyMap> FindMySaplingNotes(const CTransaction& tx, int height) const;
+    bool IsSproutNullifierFromMe(const uint256& nullifier) const;
+    bool IsSaplingNullifierFromMe(const uint256& nullifier) const;
+
+    bool GetSproutNoteWitnesses(
+         const std::vector<JSOutPoint>& notes,
+         unsigned int confirmations,
+         std::vector<std::optional<SproutWitness>>& witnesses,
+         uint256 &final_anchor) const;
+    bool GetSaplingNoteWitnesses(
+         const std::vector<SaplingOutPoint>& notes,
+         unsigned int confirmations,
+         std::vector<std::optional<SaplingWitness>>& witnesses,
+         uint256 &final_anchor) const;
+    std::vector<std::pair<libzcash::OrchardSpendingKey, orchard::SpendInfo>> GetOrchardSpendInfo(
+        const std::vector<OrchardNoteMetadata>& orchardNoteMetadata,
+        uint256 anchor) const;
+
+    isminetype IsMine(const CTxIn& txin) const;
+    CAmount GetDebit(const CTxIn& txin, const isminefilter& filter) const;
+    isminetype IsMine(const CTxOut& txout) const;
+    CAmount GetCredit(const CTxOut& txout, const isminefilter& filter) const;
+    bool IsChange(const CTxOut& txout) const;
+    CAmount GetChange(const CTxOut& txout) const;
+    bool IsMine(const CTransaction& tx) const;
+    /** should probably be renamed to IsRelevantToMe */
+    bool IsFromMe(const CTransaction& tx) const;
+    CAmount GetDebit(const CTransaction& tx, const isminefilter& filter) const;
+    CAmount GetCredit(const CTransaction& tx, const isminefilter& filter) const;
+    CAmount GetChange(const CTransaction& tx) const;
+    void ChainTip(
+        const CBlockIndex *pindex,
+        const CBlock *pblock,
+        std::optional<MerkleFrontiers> added);
+    void RunSaplingMigration(int blockHeight);
+    void AddPendingSaplingMigrationTx(const CTransaction& tx);
+    /** Saves witness caches and best block locator to disk. */
+    void SetBestChain(const CBlockLocator& loc);
+    /**
+     * Returns the block hash corresponding to the wallet's most recently
+     * persisted best block. This is the state to which the wallet will revert
+     * if restarted immediately, and does not necessarily match the current
+     * in-memory state.
+     *
+     * Returns std::nullopt if the wallet has never written a best block,
+     * i.e. this is a brand new wallet, or the node was shut down before
+     * SetBestChain was ever called to persist wallet state.
+     */
+    std::optional<uint256> GetPersistedBestBlock();
+
+    std::set<std::pair<libzcash::SproutPaymentAddress, uint256>> GetSproutNullifiers(
+            const std::set<libzcash::SproutPaymentAddress>& addresses);
+    bool IsNoteSproutChange(
+            const std::set<std::pair<libzcash::SproutPaymentAddress, uint256>> & nullifierSet,
+            const libzcash::SproutPaymentAddress& address,
+            const JSOutPoint & entry);
+
+    std::set<std::pair<libzcash::SaplingPaymentAddress, uint256>> GetSaplingNullifiers(
+            const std::set<libzcash::SaplingPaymentAddress>& addresses);
+    bool IsNoteSaplingChange(
+            const std::set<std::pair<libzcash::SaplingPaymentAddress, uint256>> & nullifierSet,
+            const libzcash::SaplingPaymentAddress& address,
+            const SaplingOutPoint & entry);
+
+    DBErrors LoadWallet(bool& fFirstRunRet);
+    DBErrors ZapWalletTx(std::vector<CWalletTx>& vWtx);
+
+    bool SetAddressBook(const CTxDestination& address, const std::string& strName, const std::string& purpose);
+
+    bool DelAddressBook(const CTxDestination& address);
+
+    void UpdatedTransaction(const uint256 &hashTx);
+
+    void Inventory(const uint256 &hash)
+    {
+        {
+            LOCK(cs_wallet);
+            std::map<uint256, int>::iterator mi = mapRequestCount.find(hash);
+            if (mi != mapRequestCount.end())
+                (*mi).second++;
+        }
+    }
+
+    void GetAddressForMining(std::optional<MinerAddress> &minerAddress);
+    void ResetRequestCount(const uint256 &hash)
+    {
+        LOCK(cs_wallet);
+        mapRequestCount[hash] = 0;
+    };
+
+    unsigned int GetKeyPoolSize()
+    {
+        AssertLockHeld(cs_wallet); // setKeyPool
+        return setKeyPool.size();
+    }
+
+    bool SetDefaultKey(const CPubKey &vchPubKey);
+
+    //! signify that a particular wallet feature is now used. this may change nWalletVersion and nWalletMaxVersion if those are lower
+    bool SetMinVersion(enum WalletFeature, CWalletDB* pwalletdbIn = NULL, bool fExplicit = false);
+
+    //! change which version we're allowed to upgrade to (note that this does not immediately imply upgrading to that format)
+    bool SetMaxVersion(int nVersion);
+
+    //! get the current wallet format (the oldest client version guaranteed to understand this wallet)
+    int GetVersion() { LOCK(cs_wallet); return nWalletVersion; }
+
+    //! Get wallet transactions that conflict with given transaction (spend same outputs)
+    std::set<uint256> GetConflicts(const uint256& txid) const;
+
+    //! Flush wallet (bitdb flush)
+    void Flush(bool shutdown=false);
+
+    //! Verify the wallet database and perform salvage if required
+    static bool Verify();
+
+    /**
+     * Address book entry changed.
+     * @note called with lock cs_wallet held.
+     */
+    boost::signals2::signal<void (CWallet *wallet, const CTxDestination
+            &address, const std::string &label, bool isMine,
+            const std::string &purpose,
+            ChangeType status)> NotifyAddressBookChanged;
+
+    /**
+     * Wallet transaction added, removed or updated.
+     * @note called with lock cs_wallet held.
+     */
+    boost::signals2::signal<void (CWallet *wallet, const uint256 &hashTx,
+            ChangeType status)> NotifyTransactionChanged;
+
+    /** Show progress e.g. for rescan */
+    boost::signals2::signal<void (const std::string &title, int nProgress)> ShowProgress;
+
+    /** Watch-only address added */
+    boost::signals2::signal<void (bool fHaveWatchOnly)> NotifyWatchonlyChanged;
+
+    /** Inquire whether this wallet broadcasts transactions. */
+    bool GetBroadcastTransactions() const { return fBroadcastTransactions; }
+    /** Set whether this wallet broadcasts transactions. */
+    void SetBroadcastTransactions(bool broadcast) { fBroadcastTransactions = broadcast; }
+
+    /* Returns true if HD is enabled for all address types, false if only for Sapling */
+    bool IsHDFullyEnabled() const;
+
+    /* Generates a new HD seed (will reset the chain child index counters)
+     * by randomly generating a mnemonic phrase that can be used for wallet
+     * recovery, and deriving the HD seed from that phrase in accordance with
+     * BIP 39 / ZIP 339. Sets the seed's version based on the current wallet
+     * version (the caller must ensure the current wallet version is correct
+     * before calling this function). */
+    void GenerateNewSeed(Language language = English);
+
+    bool SetMnemonicSeed(const MnemonicSeed& seed);
+    bool SetCryptedMnemonicSeed(const uint256& seedFp, const std::vector<unsigned char> &vchCryptedSecret);
+    /* Checks the wallet's seed against the specified mnemonic, and marks the
+     * wallet's seed as having been backed up if the phrases match. */
+    bool VerifyMnemonicSeed(const SecureString& mnemonic);
+    bool MnemonicVerified();
+
+    /* Set the current mnemonic phrase, without saving it to disk (used by LoadWallet) */
+    bool LoadMnemonicSeed(const MnemonicSeed& seed);
+    /* Set the legacy HD seed, without saving it to disk (used by LoadWallet) */
+    bool LoadLegacyHDSeed(const HDSeed& seed);
+
+    /* Set the current encrypted mnemonic phrase, without saving it to disk (used by LoadWallet) */
+    bool LoadCryptedMnemonicSeed(const uint256& seedFp, const std::vector<unsigned char>& seed);
+    /* Set the legacy encrypted HD seed, without saving it to disk (used by LoadWallet) */
+    bool LoadCryptedLegacyHDSeed(const uint256& seedFp, const std::vector<unsigned char>& seed);
+
+    /* Returns the wallet's HD seed or throw JSONRPCError(...) */
+    HDSeed GetHDSeedForRPC() const;
+
+    /* Set the metadata for the mnemonic HD seed (chain child index counters) */
+    void SetMnemonicHDChain(const CHDChain& chain, bool memonly);
+    const std::optional<CHDChain>& GetMnemonicHDChain() const { return mnemonicHDChain; }
+
+    bool CheckNetworkInfo(std::pair<std::string, std::string> networkInfo) const;
+    uint32_t BIP44CoinType() const;
+
+    /**
+     * Check whether the wallet contains spending keys for all the addresses
+     * contained in the given address set.
+     */
+    bool HasSpendingKeys(const NoteFilter& noteFilter) const;
+
+    bool HaveOrchardSpendingKeyForAddress(const libzcash::OrchardRawAddress &addr) const;
+
+    /* Find notes filtered by payment addresses, min depth, max depth, if they are spent,
+       if a spending key is required, and if they are locked */
+    void GetFilteredNotes(std::vector<SproutNoteEntry>& sproutEntriesRet,
+                          std::vector<SaplingNoteEntry>& saplingEntriesRet,
+                          std::vector<OrchardNoteMetadata>& orchardNotesRet,
+                          const std::optional<NoteFilter>& noteFilter,
+                          int minDepth,
+                          int maxDepth=INT_MAX,
+                          bool ignoreSpent=true,
+                          bool requireSpendingKey=true,
+                          bool ignoreLocked=true) const;
+
+    /* Returns the wallets help message */
+    static std::string GetWalletHelpString(bool showDebug);
+
+    /* Initializes the wallet, returns a new CWallet instance or a null pointer in case of an error */
+    static bool InitLoadWallet(const CChainParams& params, bool clearWitnessCaches);
+
+    /* Wallets parameter interaction */
+    static bool ParameterInteraction(const CChainParams& params);
+};
+
+/** A key allocated from the key pool. */
+class CReserveKey : public CReserveScript
+{
+protected:
+    CWallet* pwallet;
+    int64_t nIndex;
+    CPubKey vchPubKey;
+public:
+    CReserveKey(CWallet* pwalletIn)
+    {
+        nIndex = -1;
+        pwallet = pwalletIn;
+    }
+
+    ~CReserveKey()
+    {
+        ReturnKey();
+    }
+
+    void ReturnKey();
+    virtual bool GetReservedKey(CPubKey &pubkey);
+    void KeepKey();
+    void KeepScript() { KeepKey(); }
+};
+
+//
+// Shielded key and address generalizations
+//
+
+// PaymentAddressBelongsToWallet visitor :: (CWallet&, PaymentAddress) -> bool
+class PaymentAddressBelongsToWallet
+{
+private:
+    CWallet *m_wallet;
+public:
+    PaymentAddressBelongsToWallet(CWallet *wallet) : m_wallet(wallet) {}
+
+    bool operator()(const CKeyID &zaddr) const;
+    bool operator()(const CScriptID &zaddr) const;
+    bool operator()(const libzcash::SproutPaymentAddress &zaddr) const;
+    bool operator()(const libzcash::SaplingPaymentAddress &zaddr) const;
+    bool operator()(const libzcash::UnifiedAddress &uaddr) const;
+};
+
+// GetViewingKeyForPaymentAddress visitor :: (CWallet&, PaymentAddress) -> std::optional<ViewingKey>
+class GetViewingKeyForPaymentAddress
+{
+private:
+    CWallet *m_wallet;
+public:
+    GetViewingKeyForPaymentAddress(CWallet *wallet) : m_wallet(wallet) {}
+
+    std::optional<libzcash::ViewingKey> operator()(const CKeyID &zaddr) const;
+    std::optional<libzcash::ViewingKey> operator()(const CScriptID &zaddr) const;
+    std::optional<libzcash::ViewingKey> operator()(const libzcash::SproutPaymentAddress &zaddr) const;
+    std::optional<libzcash::ViewingKey> operator()(const libzcash::SaplingPaymentAddress &zaddr) const;
+    std::optional<libzcash::ViewingKey> operator()(const libzcash::UnifiedAddress &uaddr) const;
+};
+
+enum class PaymentAddressSource {
+    Random,
+    LegacyHDSeed,
+    MnemonicHDSeed,
+    Imported,
+    ImportedWatchOnly,
+    AddressNotFound
+};
+
+// GetSourceForPaymentAddress visitor :: (CWallet&, PaymentAddress) -> PaymentAddressSource
+class GetSourceForPaymentAddress
+{
+private:
+    CWallet *m_wallet;
+public:
+    GetSourceForPaymentAddress(CWallet *wallet) : m_wallet(wallet) {}
+
+    PaymentAddressSource GetUnifiedSource(const libzcash::Receiver& receiver) const;
+
+    PaymentAddressSource operator()(const CKeyID &zaddr) const;
+    PaymentAddressSource operator()(const CScriptID &zaddr) const;
+    PaymentAddressSource operator()(const libzcash::SproutPaymentAddress &zaddr) const;
+    PaymentAddressSource operator()(const libzcash::SaplingPaymentAddress &zaddr) const;
+    PaymentAddressSource operator()(const libzcash::UnifiedAddress &uaddr) const;
+};
+
+enum KeyAddResult {
+    SpendingKeyExists,
+    KeyAlreadyExists,
+    KeyAdded,
+    KeyNotAdded,
+};
+
+// AddViewingKeyToWallet visitor :: (CWallet&, ViewingKey) -> KeyAddResult
+class AddViewingKeyToWallet
+{
+private:
+    CWallet *m_wallet;
+    bool addDefaultAddress;
+public:
+    AddViewingKeyToWallet(CWallet *wallet, bool addDefaultAddressIn) : m_wallet(wallet), addDefaultAddress(addDefaultAddressIn) {}
+
+    KeyAddResult operator()(const libzcash::SproutViewingKey &sk) const;
+    KeyAddResult operator()(const libzcash::SaplingExtendedFullViewingKey &sk) const;
+    KeyAddResult operator()(const libzcash::UnifiedFullViewingKey &sk) const;
+};
+
+// AddSpendingKeyToWallet visitor ::
+// (CWallet&, Consensus::Params, ..., ViewingKey) -> KeyAddResult
+class AddSpendingKeyToWallet
+{
+private:
+    CWallet *m_wallet;
+    const Consensus::Params &params;
+    int64_t nTime;
+    std::optional<std::string> hdKeypath; // currently sapling only
+    std::optional<std::string> seedFpStr; // currently sapling only
+    bool log;
+    bool addDefaultAddress;
+public:
+    AddSpendingKeyToWallet(CWallet *wallet, const Consensus::Params &params) :
+        m_wallet(wallet), params(params), nTime(1), hdKeypath(std::nullopt), seedFpStr(std::nullopt), log(false), addDefaultAddress(true) {}
+    AddSpendingKeyToWallet(
+        CWallet *wallet,
+        const Consensus::Params &params,
+        int64_t _nTime,
+        std::optional<std::string> _hdKeypath,
+        std::optional<std::string> _seedFp,
+        bool _log,
+        bool _addDefaultAddress
+    ) : m_wallet(wallet), params(params), nTime(_nTime), hdKeypath(_hdKeypath), seedFpStr(_seedFp), log(_log), addDefaultAddress(_addDefaultAddress) {}
+
+
+    KeyAddResult operator()(const libzcash::SproutSpendingKey &sk) const;
+    KeyAddResult operator()(const libzcash::SaplingExtendedSpendingKey &sk) const;
+};
+
+// UFVKForReceiver :: (CWallet&, Receiver) -> std::optional<ZcashdUnifiedFullViewingKey>
+class UFVKForReceiver {
+private:
+    const CWallet& wallet;
+
+public:
+    UFVKForReceiver(const CWallet& wallet): wallet(wallet) {}
+
+    std::optional<libzcash::ZcashdUnifiedFullViewingKey> operator()(const libzcash::OrchardRawAddress& orchardAddr) const;
+    std::optional<libzcash::ZcashdUnifiedFullViewingKey> operator()(const libzcash::SaplingPaymentAddress& saplingAddr) const;
+    std::optional<libzcash::ZcashdUnifiedFullViewingKey> operator()(const CScriptID& scriptId) const;
+    std::optional<libzcash::ZcashdUnifiedFullViewingKey> operator()(const CKeyID& keyId) const;
+    std::optional<libzcash::ZcashdUnifiedFullViewingKey> operator()(const libzcash::UnknownReceiver& receiver) const;
+};
+
+// UnifiedAddressForReceiver :: (CWallet&, Receiver) -> std::optional<UnifiedAddress>
+//
+// When this visitor returns `std::nullopt` it means that either the receiver is not
+// recognized as belonging to any key known to the wallet, or that the receiver
+// is an internal change receiver for which it is not permitted to generate a
+// unified address per ZIP 315.
+class UnifiedAddressForReceiver {
+private:
+    const CWallet& wallet;
+
+public:
+    UnifiedAddressForReceiver(const CWallet& wallet): wallet(wallet) {}
+
+    std::optional<libzcash::UnifiedAddress> operator()(const libzcash::OrchardRawAddress& orchardAddr) const;
+    std::optional<libzcash::UnifiedAddress> operator()(const libzcash::SaplingPaymentAddress& saplingAddr) const;
+    std::optional<libzcash::UnifiedAddress> operator()(const CScriptID& scriptId) const;
+    std::optional<libzcash::UnifiedAddress> operator()(const CKeyID& keyId) const;
+    std::optional<libzcash::UnifiedAddress> operator()(const libzcash::UnknownReceiver& receiver) const;
+};
+
+#endif // BITCOIN_WALLET_WALLET_H
diff --git a/depend/zcash/src/wallet/walletdb.cpp b/depend/zcash/src/wallet/walletdb.cpp
new file mode 100644
index 000000000..2055b3f57
--- /dev/null
+++ b/depend/zcash/src/wallet/walletdb.cpp
@@ -0,0 +1,1372 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2014 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "wallet/walletdb.h"
+
+#include "consensus/validation.h"
+#include "fs.h"
+#include "key_io.h"
+#include "main.h"
+#include "proof_verifier.h"
+#include "protocol.h"
+#include "serialize.h"
+#include "script/standard.h"
+#include "sync.h"
+#include "util.h"
+#include "utiltime.h"
+#include "wallet/wallet.h"
+#include "zcash/Proof.hpp"
+
+#include <boost/scoped_ptr.hpp>
+#include <boost/thread.hpp>
+#include <atomic>
+#include <string>
+
+using namespace std;
+
+static uint64_t nAccountingEntryNumber = 0;
+
+static std::atomic<unsigned int> nWalletDBUpdateCounter;
+
+//
+// CWalletDB
+//
+
+bool CWalletDB::WriteName(const string& strAddress, const string& strName)
+{
+    nWalletDBUpdateCounter++;
+    return Write(make_pair(string("name"), strAddress), strName);
+}
+
+bool CWalletDB::EraseName(const string& strAddress)
+{
+    // This should only be used for sending addresses, never for receiving addresses,
+    // receiving addresses must always have an address book entry if they're not change return.
+    nWalletDBUpdateCounter++;
+    return Erase(make_pair(string("name"), strAddress));
+}
+
+bool CWalletDB::WritePurpose(const string& strAddress, const string& strPurpose)
+{
+    nWalletDBUpdateCounter++;
+    return Write(make_pair(string("purpose"), strAddress), strPurpose);
+}
+
+bool CWalletDB::ErasePurpose(const string& strPurpose)
+{
+    nWalletDBUpdateCounter++;
+    return Erase(make_pair(string("purpose"), strPurpose));
+}
+
+bool CWalletDB::WriteTx(const CWalletTx& wtx)
+{
+    nWalletDBUpdateCounter++;
+    return Write(std::make_pair(std::string("tx"), wtx.GetHash()), wtx);
+}
+
+bool CWalletDB::EraseTx(uint256 hash)
+{
+    nWalletDBUpdateCounter++;
+    return Erase(std::make_pair(std::string("tx"), hash));
+}
+
+bool CWalletDB::WriteKey(const CPubKey& vchPubKey, const CPrivKey& vchPrivKey, const CKeyMetadata& keyMeta)
+{
+    nWalletDBUpdateCounter++;
+
+    if (!Write(std::make_pair(std::string("keymeta"), vchPubKey),
+               keyMeta, false))
+        return false;
+
+    // hash pubkey/privkey to accelerate wallet load
+    std::vector<unsigned char> vchKey;
+    vchKey.reserve(vchPubKey.size() + vchPrivKey.size());
+    vchKey.insert(vchKey.end(), vchPubKey.begin(), vchPubKey.end());
+    vchKey.insert(vchKey.end(), vchPrivKey.begin(), vchPrivKey.end());
+
+    return Write(std::make_pair(std::string("key"), vchPubKey), std::make_pair(vchPrivKey, Hash(vchKey.begin(), vchKey.end())), false);
+}
+
+bool CWalletDB::WriteCryptedKey(const CPubKey& vchPubKey,
+                                const std::vector<unsigned char>& vchCryptedSecret,
+                                const CKeyMetadata &keyMeta)
+{
+    const bool fEraseUnencryptedKey = true;
+    nWalletDBUpdateCounter++;
+
+    if (!Write(std::make_pair(std::string("keymeta"), vchPubKey),
+            keyMeta))
+        return false;
+
+    if (!Write(std::make_pair(std::string("ckey"), vchPubKey), vchCryptedSecret, false))
+        return false;
+    if (fEraseUnencryptedKey)
+    {
+        Erase(std::make_pair(std::string("key"), vchPubKey));
+        Erase(std::make_pair(std::string("wkey"), vchPubKey));
+    }
+    return true;
+}
+
+bool CWalletDB::WriteCryptedZKey(const libzcash::SproutPaymentAddress & addr,
+                                 const libzcash::ReceivingKey &rk,
+                                 const std::vector<unsigned char>& vchCryptedSecret,
+                                 const CKeyMetadata &keyMeta)
+{
+    const bool fEraseUnencryptedKey = true;
+    nWalletDBUpdateCounter++;
+
+    if (!Write(std::make_pair(std::string("zkeymeta"), addr), keyMeta))
+        return false;
+
+    if (!Write(std::make_pair(std::string("czkey"), addr), std::make_pair(rk, vchCryptedSecret), false))
+        return false;
+    if (fEraseUnencryptedKey)
+    {
+        Erase(std::make_pair(std::string("zkey"), addr));
+    }
+    return true;
+}
+
+bool CWalletDB::WriteCryptedSaplingZKey(
+    const libzcash::SaplingExtendedFullViewingKey &extfvk,
+    const std::vector<unsigned char>& vchCryptedSecret,
+    const CKeyMetadata &keyMeta)
+{
+    const bool fEraseUnencryptedKey = true;
+    nWalletDBUpdateCounter++;
+    auto ivk = extfvk.ToIncomingViewingKey();
+
+    if (!Write(std::make_pair(std::string("sapzkeymeta"), ivk), keyMeta))
+        return false;
+
+    if (!Write(std::make_pair(std::string("csapzkey"), ivk), std::make_pair(extfvk, vchCryptedSecret), false))
+        return false;
+
+    if (fEraseUnencryptedKey)
+    {
+        Erase(std::make_pair(std::string("sapzkey"), ivk));
+    }
+    return true;
+}
+
+bool CWalletDB::WriteMasterKey(unsigned int nID, const CMasterKey& kMasterKey)
+{
+    nWalletDBUpdateCounter++;
+    return Write(std::make_pair(std::string("mkey"), nID), kMasterKey, true);
+}
+
+bool CWalletDB::WriteZKey(const libzcash::SproutPaymentAddress& addr, const libzcash::SproutSpendingKey& key, const CKeyMetadata &keyMeta)
+{
+    nWalletDBUpdateCounter++;
+
+    if (!Write(std::make_pair(std::string("zkeymeta"), addr), keyMeta))
+        return false;
+
+    // pair is: tuple_key("zkey", paymentaddress) --> secretkey
+    return Write(std::make_pair(std::string("zkey"), addr), key, false);
+}
+
+bool CWalletDB::WriteSaplingZKey(const libzcash::SaplingIncomingViewingKey &ivk,
+                const libzcash::SaplingExtendedSpendingKey &key,
+                const CKeyMetadata &keyMeta)
+{
+    nWalletDBUpdateCounter++;
+
+    if (!Write(std::make_pair(std::string("sapzkeymeta"), ivk), keyMeta))
+        return false;
+
+    return Write(std::make_pair(std::string("sapzkey"), ivk), key, false);
+}
+
+bool CWalletDB::WriteSaplingPaymentAddress(
+    const libzcash::SaplingPaymentAddress &addr,
+    const libzcash::SaplingIncomingViewingKey &ivk)
+{
+    nWalletDBUpdateCounter++;
+
+    return Write(std::make_pair(std::string("sapzaddr"), addr), ivk, false);
+}
+
+bool CWalletDB::WriteSproutViewingKey(const libzcash::SproutViewingKey &vk)
+{
+    nWalletDBUpdateCounter++;
+    return Write(std::make_pair(std::string("vkey"), vk), '1');
+}
+
+bool CWalletDB::EraseSproutViewingKey(const libzcash::SproutViewingKey &vk)
+{
+    nWalletDBUpdateCounter++;
+    return Erase(std::make_pair(std::string("vkey"), vk));
+}
+
+bool CWalletDB::WriteSaplingExtendedFullViewingKey(
+    const libzcash::SaplingExtendedFullViewingKey &extfvk)
+{
+    nWalletDBUpdateCounter++;
+    return Write(std::make_pair(std::string("sapextfvk"), extfvk), '1');
+}
+
+bool CWalletDB::EraseSaplingExtendedFullViewingKey(
+    const libzcash::SaplingExtendedFullViewingKey &extfvk)
+{
+    nWalletDBUpdateCounter++;
+    return Erase(std::make_pair(std::string("sapextfvk"), extfvk));
+}
+
+//
+// Orchard wallet persistence
+//
+
+bool CWalletDB::WriteOrchardWitnesses(const OrchardWallet& wallet) {
+    nWalletDBUpdateCounter++;
+    return Write(
+            std::string("orchard_note_commitment_tree"),
+            OrchardWalletNoteCommitmentTreeWriter(wallet));
+}
+
+//
+// Unified address & key storage
+//
+
+bool CWalletDB::WriteUnifiedAccountMetadata(const ZcashdUnifiedAccountMetadata& keymeta)
+{
+    nWalletDBUpdateCounter++;
+    return Write(std::make_pair(std::string("unifiedaccount"), keymeta), 0x00);
+}
+
+bool CWalletDB::WriteUnifiedFullViewingKey(const libzcash::UnifiedFullViewingKey& ufvk)
+{
+    nWalletDBUpdateCounter++;
+    auto ufvkId = ufvk.GetKeyID(Params());
+    return Write(std::make_pair(std::string("unifiedfvk"), ufvkId), ufvk.Encode(Params()));
+}
+
+bool CWalletDB::WriteUnifiedAddressMetadata(const ZcashdUnifiedAddressMetadata& addrmeta)
+{
+    nWalletDBUpdateCounter++;
+    return Write(std::make_pair(std::string("unifiedaddrmeta"), addrmeta), 0x00);
+}
+
+//
+//
+//
+
+bool CWalletDB::WriteCScript(const uint160& hash, const CScript& redeemScript)
+{
+    nWalletDBUpdateCounter++;
+    return Write(std::make_pair(std::string("cscript"), hash), *(const CScriptBase*)(&redeemScript), false);
+}
+
+bool CWalletDB::WriteWatchOnly(const CScript &dest)
+{
+    nWalletDBUpdateCounter++;
+    return Write(std::make_pair(std::string("watchs"), *(const CScriptBase*)(&dest)), '1');
+}
+
+bool CWalletDB::EraseWatchOnly(const CScript &dest)
+{
+    nWalletDBUpdateCounter++;
+    return Erase(std::make_pair(std::string("watchs"), *(const CScriptBase*)(&dest)));
+}
+
+bool CWalletDB::WriteBestBlock(const CBlockLocator& locator)
+{
+    nWalletDBUpdateCounter++;
+    return Write(std::string("bestblock"), locator);
+}
+
+bool CWalletDB::ReadBestBlock(CBlockLocator& locator)
+{
+    return Read(std::string("bestblock"), locator);
+}
+
+bool CWalletDB::WriteOrderPosNext(int64_t nOrderPosNext)
+{
+    nWalletDBUpdateCounter++;
+    return Write(std::string("orderposnext"), nOrderPosNext);
+}
+
+bool CWalletDB::WriteDefaultKey(const CPubKey& vchPubKey)
+{
+    nWalletDBUpdateCounter++;
+    return Write(std::string("defaultkey"), vchPubKey);
+}
+
+bool CWalletDB::WriteWitnessCacheSize(int64_t nWitnessCacheSize)
+{
+    nWalletDBUpdateCounter++;
+    return Write(std::string("witnesscachesize"), nWitnessCacheSize);
+}
+
+bool CWalletDB::ReadPool(int64_t nPool, CKeyPool& keypool)
+{
+    return Read(std::make_pair(std::string("pool"), nPool), keypool);
+}
+
+bool CWalletDB::WritePool(int64_t nPool, const CKeyPool& keypool)
+{
+    nWalletDBUpdateCounter++;
+    return Write(std::make_pair(std::string("pool"), nPool), keypool);
+}
+
+bool CWalletDB::ErasePool(int64_t nPool)
+{
+    nWalletDBUpdateCounter++;
+    return Erase(std::make_pair(std::string("pool"), nPool));
+}
+
+bool CWalletDB::WriteMinVersion(int nVersion)
+{
+    return Write(std::string("minversion"), nVersion);
+}
+
+bool CWalletDB::WriteRecipientMapping(const uint256& txid, const libzcash::RecipientAddress& address, const libzcash::UnifiedAddress& ua)
+{
+    auto recipientReceiver = libzcash::RecipientAddressToReceiver(address);
+    // Check that recipient address exists in given UA.
+    if (!ua.ContainsReceiver(recipientReceiver)) {
+        return false;
+    }
+
+    std::pair<uint256, CSerializeRecipientAddress> key = std::make_pair(txid, CSerializeRecipientAddress(address));
+    std::string uaString = KeyIO(Params()).EncodePaymentAddress(ua);
+    return Write(std::make_pair(std::string("recipientmapping"), key), uaString);
+}
+
+class CWalletScanState {
+public:
+    unsigned int nKeys;
+    unsigned int nCKeys;
+    unsigned int nKeyMeta;
+    unsigned int nZKeys;
+    unsigned int nCZKeys;
+    unsigned int nZKeyMeta;
+    unsigned int nSapZAddrs;
+    bool fIsEncrypted;
+    bool fAnyUnordered;
+    int nFileVersion;
+    vector<uint256> vWalletUpgrade;
+
+    CWalletScanState() {
+        nKeys = nCKeys = nKeyMeta = nZKeys = nCZKeys = nZKeyMeta = nSapZAddrs = 0;
+        fIsEncrypted = false;
+        fAnyUnordered = false;
+        nFileVersion = 0;
+    }
+};
+
+bool
+ReadKeyValue(CWallet* pwallet, CDataStream& ssKey, CDataStream& ssValue,
+             CWalletScanState &wss, string& strType, string& strErr)
+{
+    try {
+        KeyIO keyIO(Params());
+
+        // Unserialize
+        // Taking advantage of the fact that pair serialization
+        // is just the two items serialized one after the other
+        ssKey >> strType;
+        if (strType == "name")
+        {
+            string strAddress;
+            ssKey >> strAddress;
+            ssValue >> pwallet->mapAddressBook[keyIO.DecodeDestination(strAddress)].name;
+        }
+        else if (strType == "purpose")
+        {
+            string strAddress;
+            ssKey >> strAddress;
+            ssValue >> pwallet->mapAddressBook[keyIO.DecodeDestination(strAddress)].purpose;
+        }
+        else if (strType == "tx")
+        {
+            uint256 hash;
+            ssKey >> hash;
+            CWalletTx wtx;
+            ssValue >> wtx;
+            CValidationState state;
+            auto verifier = ProofVerifier::Strict();
+            if (!(
+                CheckTransaction(wtx, state, verifier) &&
+                (wtx.GetHash() == hash) &&
+                state.IsValid())
+            ) {
+                return false;
+            }
+
+            // Undo serialize changes in 31600
+            if (31404 <= wtx.fTimeReceivedIsTxTime && wtx.fTimeReceivedIsTxTime <= 31703)
+            {
+                if (!ssValue.empty())
+                {
+                    char fTmp;
+                    char fUnused;
+                    std::string unused_string;
+                    ssValue >> fTmp >> fUnused >> unused_string;
+                    strErr = strprintf("LoadWallet() upgrading tx ver=%d %d %s",
+                                       wtx.fTimeReceivedIsTxTime, fTmp, hash.ToString());
+                    wtx.fTimeReceivedIsTxTime = fTmp;
+                }
+                else
+                {
+                    strErr = strprintf("LoadWallet() repairing tx ver=%d %s", wtx.fTimeReceivedIsTxTime, hash.ToString());
+                    wtx.fTimeReceivedIsTxTime = 0;
+                }
+                wss.vWalletUpgrade.push_back(hash);
+            }
+
+            if (wtx.nOrderPos == -1)
+                wss.fAnyUnordered = true;
+
+            pwallet->LoadWalletTx(wtx);
+        }
+        else if (strType == "watchs")
+        {
+            CScript script;
+            ssKey >> *(CScriptBase*)(&script);
+            char fYes;
+            ssValue >> fYes;
+            if (fYes == '1')
+                pwallet->LoadWatchOnly(script);
+
+            // Watch-only addresses have no birthday information for now,
+            // so set the wallet birthday to the beginning of time.
+            pwallet->nTimeFirstKey = 1;
+        }
+        else if (strType == "vkey")
+        {
+            libzcash::SproutViewingKey vk;
+            ssKey >> vk;
+            char fYes;
+            ssValue >> fYes;
+            if (fYes == '1')
+                pwallet->LoadSproutViewingKey(vk);
+
+            // Viewing keys have no birthday information for now,
+            // so set the wallet birthday to the beginning of time.
+            pwallet->nTimeFirstKey = 1;
+        }
+        else if (strType == "zkey")
+        {
+            libzcash::SproutPaymentAddress addr;
+            ssKey >> addr;
+            libzcash::SproutSpendingKey key;
+            ssValue >> key;
+
+            if (!pwallet->LoadZKey(key))
+            {
+                strErr = "Error reading wallet database: LoadZKey failed";
+                return false;
+            }
+
+            wss.nZKeys++;
+        }
+        else if (strType == "sapzkey")
+        {
+            libzcash::SaplingIncomingViewingKey ivk;
+            ssKey >> ivk;
+            libzcash::SaplingExtendedSpendingKey key;
+            ssValue >> key;
+
+            if (!pwallet->LoadSaplingZKey(key))
+            {
+                strErr = "Error reading wallet database: LoadSaplingZKey failed";
+                return false;
+            }
+
+            //add checks for integrity
+            wss.nZKeys++;
+        }
+        else if (strType == "sapextfvk")
+        {
+            libzcash::SaplingExtendedFullViewingKey extfvk;
+            ssKey >> extfvk;
+            char fYes;
+            ssValue >> fYes;
+            if (fYes == '1') {
+                pwallet->LoadSaplingFullViewingKey(extfvk);
+            }
+
+            // Viewing keys have no birthday information for now,
+            // so set the wallet birthday to the beginning of time.
+            pwallet->nTimeFirstKey = 1;
+        }
+
+        else if (strType == "key" || strType == "wkey")
+        {
+            CPubKey vchPubKey;
+            ssKey >> vchPubKey;
+            if (!vchPubKey.IsValid())
+            {
+                strErr = "Error reading wallet database: CPubKey corrupt";
+                return false;
+            }
+            CKey key;
+            CPrivKey pkey;
+            uint256 hash;
+
+            if (strType == "key")
+            {
+                wss.nKeys++;
+                ssValue >> pkey;
+            } else {
+                CWalletKey wkey;
+                ssValue >> wkey;
+                pkey = wkey.vchPrivKey;
+            }
+
+            // Old wallets store keys as "key" [pubkey] => [privkey]
+            // ... which was slow for wallets with lots of keys, because the public key is re-derived from the private key
+            // using EC operations as a checksum.
+            // Newer wallets store keys as "key"[pubkey] => [privkey][hash(pubkey,privkey)], which is much faster while
+            // remaining backwards-compatible.
+            try
+            {
+                ssValue >> hash;
+            }
+            catch (...) {}
+
+            bool fSkipCheck = false;
+
+            if (!hash.IsNull())
+            {
+                // hash pubkey/privkey to accelerate wallet load
+                std::vector<unsigned char> vchKey;
+                vchKey.reserve(vchPubKey.size() + pkey.size());
+                vchKey.insert(vchKey.end(), vchPubKey.begin(), vchPubKey.end());
+                vchKey.insert(vchKey.end(), pkey.begin(), pkey.end());
+
+                if (Hash(vchKey.begin(), vchKey.end()) != hash)
+                {
+                    strErr = "Error reading wallet database: CPubKey/CPrivKey corrupt";
+                    return false;
+                }
+
+                fSkipCheck = true;
+            }
+
+            if (!key.Load(pkey, vchPubKey, fSkipCheck))
+            {
+                strErr = "Error reading wallet database: CPrivKey corrupt";
+                return false;
+            }
+            if (!pwallet->LoadKey(key, vchPubKey))
+            {
+                strErr = "Error reading wallet database: LoadKey failed";
+                return false;
+            }
+        }
+        else if (strType == "mkey")
+        {
+            unsigned int nID;
+            ssKey >> nID;
+            CMasterKey kMasterKey;
+            ssValue >> kMasterKey;
+            if(pwallet->mapMasterKeys.count(nID) != 0)
+            {
+                strErr = strprintf("Error reading wallet database: duplicate CMasterKey id %u", nID);
+                return false;
+            }
+            pwallet->mapMasterKeys[nID] = kMasterKey;
+            if (pwallet->nMasterKeyMaxID < nID)
+                pwallet->nMasterKeyMaxID = nID;
+        }
+        else if (strType == "ckey")
+        {
+            vector<unsigned char> vchPubKey;
+            ssKey >> vchPubKey;
+            vector<unsigned char> vchPrivKey;
+            ssValue >> vchPrivKey;
+            wss.nCKeys++;
+
+            if (!pwallet->LoadCryptedKey(vchPubKey, vchPrivKey))
+            {
+                strErr = "Error reading wallet database: LoadCryptedKey failed";
+                return false;
+            }
+            wss.fIsEncrypted = true;
+        }
+        else if (strType == "czkey")
+        {
+            libzcash::SproutPaymentAddress addr;
+            ssKey >> addr;
+            // Deserialization of a pair is just one item after another
+            uint256 rkValue;
+            ssValue >> rkValue;
+            libzcash::ReceivingKey rk(rkValue);
+            vector<unsigned char> vchCryptedSecret;
+            ssValue >> vchCryptedSecret;
+            wss.nCKeys++;
+
+            if (!pwallet->LoadCryptedZKey(addr, rk, vchCryptedSecret))
+            {
+                strErr = "Error reading wallet database: LoadCryptedZKey failed";
+                return false;
+            }
+            wss.fIsEncrypted = true;
+        }
+        else if (strType == "csapzkey")
+        {
+            libzcash::SaplingIncomingViewingKey ivk;
+            ssKey >> ivk;
+            libzcash::SaplingExtendedFullViewingKey extfvk;
+            ssValue >> extfvk;
+            vector<unsigned char> vchCryptedSecret;
+            ssValue >> vchCryptedSecret;
+            wss.nCKeys++;
+
+            if (!pwallet->LoadCryptedSaplingZKey(extfvk, vchCryptedSecret))
+            {
+                strErr = "Error reading wallet database: LoadCryptedSaplingZKey failed";
+                return false;
+            }
+            wss.fIsEncrypted = true;
+        }
+        else if (strType == "keymeta")
+        {
+            CPubKey vchPubKey;
+            ssKey >> vchPubKey;
+            CKeyMetadata keyMeta;
+            ssValue >> keyMeta;
+            wss.nKeyMeta++;
+
+            pwallet->LoadKeyMetadata(vchPubKey, keyMeta);
+
+            // find earliest key creation time, as wallet birthday
+            if (!pwallet->nTimeFirstKey ||
+                (keyMeta.nCreateTime < pwallet->nTimeFirstKey))
+                pwallet->nTimeFirstKey = keyMeta.nCreateTime;
+        }
+        else if (strType == "zkeymeta")
+        {
+            libzcash::SproutPaymentAddress addr;
+            ssKey >> addr;
+            CKeyMetadata keyMeta;
+            ssValue >> keyMeta;
+            wss.nZKeyMeta++;
+
+            pwallet->LoadZKeyMetadata(addr, keyMeta);
+
+            // ignore earliest key creation time as taddr will exist before any zaddr
+        }
+        else if (strType == "sapzkeymeta")
+        {
+            libzcash::SaplingIncomingViewingKey ivk;
+            ssKey >> ivk;
+            CKeyMetadata keyMeta;
+            ssValue >> keyMeta;
+
+            wss.nZKeyMeta++;
+
+            pwallet->LoadSaplingZKeyMetadata(ivk, keyMeta);
+        }
+        else if (strType == "sapzaddr")
+        {
+            libzcash::SaplingPaymentAddress addr;
+            ssKey >> addr;
+            libzcash::SaplingIncomingViewingKey ivk;
+            ssValue >> ivk;
+
+            wss.nSapZAddrs++;
+
+            if (!pwallet->LoadSaplingPaymentAddress(addr, ivk))
+            {
+                strErr = "Error reading wallet database: LoadSaplingPaymentAddress failed";
+                return false;
+            }
+        }
+        else if (strType == "defaultkey")
+        {
+            ssValue >> pwallet->vchDefaultKey;
+        }
+        else if (strType == "unifiedfvk")
+        {
+            libzcash::UFVKId fp;
+            ssKey >> fp;
+
+            std::string ufvkenc;
+            ssValue >> ufvkenc;
+
+            auto ufvkopt = libzcash::UnifiedFullViewingKey::Decode(ufvkenc, Params());
+            if (ufvkopt.has_value()) {
+                auto ufvk = ufvkopt.value();
+                if (fp != ufvk.GetKeyID(Params())) {
+                    strErr = "Error reading wallet database: key fingerprint did not match decoded key";
+                    return false;
+                }
+                if (!pwallet->LoadUnifiedFullViewingKey(ufvk)) {
+                    strErr = "Error reading wallet database: LoadUnifiedFullViewingKey failed.";
+                    return false;
+                }
+            } else {
+                strErr = "Error reading wallet database: failed to decode unified full viewing key.";
+                return false;
+            }
+        }
+        else if (strType == "unifiedaccount")
+        {
+            auto acct = ZcashdUnifiedAccountMetadata::Read(ssKey);
+
+            uint8_t value;
+            ssValue >> value;
+            if (value != 0x00) {
+                strErr = "Error reading wallet database: invalid unified account metadata.";
+                return false;
+            }
+
+            if (!pwallet->LoadUnifiedAccountMetadata(acct)) {
+                strErr = "Error reading wallet database: account ID mismatch for unified spending key.";
+                return false;
+            };
+        }
+        else if (strType == "unifiedaddrmeta")
+        {
+            auto keymeta = ZcashdUnifiedAddressMetadata::Read(ssKey);
+
+            uint8_t value;
+            ssValue >> value;
+            if (value != 0x00) {
+                strErr = "Error reading wallet database: invalid unified address metadata.";
+                return false;
+            }
+
+            if (!pwallet->LoadUnifiedAddressMetadata(keymeta)) {
+                strErr = "Error reading wallet database: cannot reproduce previously generated unified address.";
+                return false;
+            }
+        }
+        else if (strType == "pool")
+        {
+            int64_t nIndex;
+            ssKey >> nIndex;
+            CKeyPool keypool;
+            ssValue >> keypool;
+            pwallet->setKeyPool.insert(nIndex);
+
+            // If no metadata exists yet, create a default with the pool key's
+            // creation time. Note that this may be overwritten by actually
+            // stored metadata for that key later, which is fine.
+            CKeyID keyid = keypool.vchPubKey.GetID();
+            if (pwallet->mapKeyMetadata.count(keyid) == 0)
+                pwallet->mapKeyMetadata[keyid] = CKeyMetadata(keypool.nTime);
+        }
+        else if (strType == "version")
+        {
+            ssValue >> wss.nFileVersion;
+            if (wss.nFileVersion == 10300)
+                wss.nFileVersion = 300;
+        }
+        else if (strType == "cscript")
+        {
+            uint160 hash;
+            ssKey >> hash;
+            CScript script;
+            ssValue >> *(CScriptBase*)(&script);
+            if (!pwallet->LoadCScript(script))
+            {
+                strErr = "Error reading wallet database: LoadCScript failed";
+                return false;
+            }
+        }
+        else if (strType == "orderposnext")
+        {
+            ssValue >> pwallet->nOrderPosNext;
+        }
+        else if (strType == "destdata")
+        {
+            std::string strAddress, strKey, strValue;
+            ssKey >> strAddress;
+            ssKey >> strKey;
+            ssValue >> strValue;
+            if (!pwallet->LoadDestData(keyIO.DecodeDestination(strAddress), strKey, strValue))
+            {
+                strErr = "Error reading wallet database: LoadDestData failed";
+                return false;
+            }
+        }
+        else if (strType == "witnesscachesize")
+        {
+            ssValue >> pwallet->nWitnessCacheSize;
+        }
+        else if (strType == "mnemonicphrase")
+        {
+            uint256 seedFp;
+            ssKey >> seedFp;
+            auto seed = MnemonicSeed::Read(ssValue);
+
+            if (seed.Fingerprint() != seedFp)
+            {
+                strErr = "Error reading wallet database: mnemonic phrase corrupt";
+                return false;
+            }
+
+            if (!pwallet->LoadMnemonicSeed(seed))
+            {
+                strErr = "Error reading wallet database: LoadMnemonicSeed failed";
+                return false;
+            }
+        }
+        else if (strType == "cmnemonicphrase")
+        {
+            uint256 seedFp;
+            vector<unsigned char> vchCryptedSecret;
+            ssKey >> seedFp;
+            ssValue >> vchCryptedSecret;
+            if (!pwallet->LoadCryptedMnemonicSeed(seedFp, vchCryptedSecret))
+            {
+                strErr = "Error reading wallet database: LoadCryptedMnemonicSeed failed";
+                return false;
+            }
+            wss.fIsEncrypted = true;
+        }
+        else if (strType == "hdseed")
+        {
+            uint256 seedFp;
+            RawHDSeed rawSeed;
+            ssKey >> seedFp;
+            ssValue >> rawSeed;
+            HDSeed seed(rawSeed);
+
+            if (seed.Fingerprint() != seedFp)
+            {
+                strErr = "Error reading wallet database: HDSeed corrupt";
+                return false;
+            }
+
+            if (!pwallet->LoadLegacyHDSeed(seed))
+            {
+                strErr = "Error reading wallet database: LoadHDSeed failed";
+                return false;
+            }
+        }
+        else if (strType == "chdseed")
+        {
+            uint256 seedFp;
+            vector<unsigned char> vchCryptedSecret;
+            ssKey >> seedFp;
+            ssValue >> vchCryptedSecret;
+            if (!pwallet->LoadCryptedLegacyHDSeed(seedFp, vchCryptedSecret))
+            {
+                strErr = "Error reading wallet database: LoadCryptedHDSeed failed";
+                return false;
+            }
+            wss.fIsEncrypted = true;
+        }
+        else if (strType == "mnemonichdchain")
+        {
+            auto chain = CHDChain::Read(ssValue);
+            pwallet->SetMnemonicHDChain(chain, true);
+        }
+        else if (strType == "networkinfo")
+        {
+            std::pair<std::string, std::string> networkInfo;
+            ssValue >> networkInfo;
+            if (!pwallet->CheckNetworkInfo(networkInfo)) {
+                strErr = "Error in wallet database: unexpected network";
+                return false;
+            }
+        }
+        else if (strType == "recipientmapping")
+        {
+            uint256 txid;
+            std::string rawUa;
+            ssKey >> txid;
+            auto recipient = CSerializeRecipientAddress::Read(ssKey);
+            ssValue >> rawUa;
+
+            auto ua = libzcash::UnifiedAddress::Parse(Params(), rawUa);
+            if (!ua.has_value()) {
+                strErr = "Error in wallet database: non-UnifiedAddress in recipientmapping";
+                return false;
+            }
+
+            auto recipientReceiver = libzcash::RecipientAddressToReceiver(recipient);
+
+            if (!ua.value().ContainsReceiver(recipientReceiver)) {
+                strErr = "Error in wallet database: recipientmapping UA does not contain recipient";
+                return false;
+            }
+
+            pwallet->LoadRecipientMapping(txid, RecipientMapping(ua.value(), recipient));
+        }
+        else if (strType == "orchard_note_commitment_tree")
+        {
+            auto loader = pwallet->GetOrchardNoteCommitmentTreeLoader();
+            ssValue >> loader;
+        }
+    } catch (...)
+    {
+        return false;
+    }
+    return true;
+}
+
+static bool IsKeyType(string strType)
+{
+    return (strType== "key" || strType == "wkey" ||
+            strType == "hdseed" || strType == "chdseed" ||
+            strType == "mnemonicphrase" || strType == "cmnemonicphrase" ||
+            strType == "mnemonichdchain" ||
+            strType == "zkey" || strType == "czkey" ||
+            strType == "sapzkey" || strType == "csapzkey" ||
+            strType == "vkey" || strType == "sapextfvk" ||
+            strType == "mkey" || strType == "ckey");
+}
+
+DBErrors CWalletDB::LoadWallet(CWallet* pwallet)
+{
+    pwallet->vchDefaultKey = CPubKey();
+    CWalletScanState wss;
+    bool fNoncriticalErrors = false;
+    DBErrors result = DB_LOAD_OK;
+
+    LOCK(pwallet->cs_wallet);
+    try {
+        int nMinVersion = 0;
+        if (Read((string)"minversion", nMinVersion))
+        {
+            if (nMinVersion > CLIENT_VERSION)
+                return DB_TOO_NEW;
+            pwallet->LoadMinVersion(nMinVersion);
+        }
+
+        // Get cursor
+        Dbc* pcursor = GetCursor();
+        if (!pcursor)
+        {
+            LogPrintf("LoadWallet: Error getting wallet database cursor.");
+            return DB_CORRUPT;
+        }
+
+        while (true)
+        {
+            // Read next record
+            CDataStream ssKey(SER_DISK, CLIENT_VERSION);
+            CDataStream ssValue(SER_DISK, CLIENT_VERSION);
+            int ret = ReadAtCursor(pcursor, ssKey, ssValue);
+            if (ret == DB_NOTFOUND)
+                break;
+            else if (ret != 0)
+            {
+                LogPrintf("LoadWallet: Error reading next record from wallet database.");
+                return DB_CORRUPT;
+            }
+
+            // Try to be tolerant of single corrupt records:
+            string strType, strErr;
+            if (!ReadKeyValue(pwallet, ssKey, ssValue, wss, strType, strErr))
+            {
+                if (strType == "networkinfo") {
+                    // example: running mainnet, but this wallet.dat is from testnet
+                    result = DB_WRONG_NETWORK;
+                } else if (result != DB_WRONG_NETWORK && IsKeyType(strType)) {
+                    // losing keys is considered a catastrophic error
+                    LogPrintf("LoadWallet: Unable to read key/value for key type %s (%d)", strType, result);
+                    result = DB_CORRUPT;
+                } else {
+                    // Leave other errors alone, if we try to fix them we might make things worse.
+                    fNoncriticalErrors = true; // ... but do warn the user there is something wrong.
+                    if (strType == "tx") {
+                        // Rescan if there is a bad transaction record:
+                        SoftSetBoolArg("-rescan", true);
+                    }
+                }
+            }
+            if (!strErr.empty())
+                LogPrintf("LoadWallet: %s", strErr);
+        }
+        pcursor->close();
+
+        // Load unified address/account/key caches based on what was loaded
+        if (!pwallet->LoadCaches()) {
+            // We can be more permissive of certain kinds of failures during
+            // loading; for now we'll interpret failure to reconstruct the
+            // caches to be "as bad" as losing keys.
+            LogPrintf("LoadWallet: Failed to restore cached wallet data from chain state.");
+            result = DB_CORRUPT;
+        }
+    }
+    catch (const boost::thread_interrupted&) {
+        throw;
+    }
+    catch (const std::exception& e) {
+        LogPrintf("LoadWallet: Caught exception: %s", e.what());
+        result = DB_CORRUPT;
+    }
+    catch (...) {
+        LogPrintf("LoadWallet: Caught something that wasn't a std::exception.");
+        result = DB_CORRUPT;
+    }
+
+
+    if (fNoncriticalErrors && result == DB_LOAD_OK)
+        result = DB_NONCRITICAL_ERROR;
+
+    // Any wallet corruption at all: skip any rewriting or
+    // upgrading, we don't want to make it worse.
+    if (result != DB_LOAD_OK)
+        return result;
+
+    LogPrintf("nFileVersion = %d\n", wss.nFileVersion);
+
+    LogPrintf("Keys: %u plaintext, %u encrypted, %u w/ metadata, %u total\n",
+           wss.nKeys, wss.nCKeys, wss.nKeyMeta, wss.nKeys + wss.nCKeys);
+
+    LogPrintf("ZKeys: %u plaintext, %u encrypted, %u w/metadata, %u total\n",
+           wss.nZKeys, wss.nCZKeys, wss.nZKeyMeta, wss.nZKeys + wss.nCZKeys);
+
+    // nTimeFirstKey is only reliable if all keys have metadata
+    if ((wss.nKeys + wss.nCKeys) != wss.nKeyMeta)
+        pwallet->nTimeFirstKey = 1; // 0 would be considered 'no value'
+
+    for (uint256 hash : wss.vWalletUpgrade)
+        WriteTx(pwallet->mapWallet[hash]);
+
+    // Rewrite encrypted wallets of versions 0.4.0 and 0.5.0rc:
+    if (wss.fIsEncrypted && (wss.nFileVersion == 40000 || wss.nFileVersion == 50000))
+        return DB_NEED_REWRITE;
+
+    if (wss.nFileVersion < CLIENT_VERSION) // Update
+        WriteVersion(CLIENT_VERSION);
+
+    if (wss.fAnyUnordered)
+        result = pwallet->ReorderTransactions();
+
+    return result;
+}
+
+DBErrors CWalletDB::FindWalletTxToZap(CWallet* pwallet, vector<uint256>& vTxHash, vector<CWalletTx>& vWtx)
+{
+    pwallet->vchDefaultKey = CPubKey();
+    bool fNoncriticalErrors = false;
+    DBErrors result = DB_LOAD_OK;
+
+    try {
+        LOCK(pwallet->cs_wallet);
+        int nMinVersion = 0;
+        if (Read((string)"minversion", nMinVersion))
+        {
+            if (nMinVersion > CLIENT_VERSION)
+                return DB_TOO_NEW;
+            pwallet->LoadMinVersion(nMinVersion);
+        }
+
+        // Get cursor
+        Dbc* pcursor = GetCursor();
+        if (!pcursor)
+        {
+            LogPrintf("Error getting wallet database cursor\n");
+            return DB_CORRUPT;
+        }
+
+        while (true)
+        {
+            // Read next record
+            CDataStream ssKey(SER_DISK, CLIENT_VERSION);
+            CDataStream ssValue(SER_DISK, CLIENT_VERSION);
+            int ret = ReadAtCursor(pcursor, ssKey, ssValue);
+            if (ret == DB_NOTFOUND)
+                break;
+            else if (ret != 0)
+            {
+                LogPrintf("Error reading next record from wallet database\n");
+                return DB_CORRUPT;
+            }
+
+            string strType;
+            ssKey >> strType;
+            if (strType == "tx") {
+                uint256 hash;
+                ssKey >> hash;
+
+                std::vector<unsigned char> txData(ssValue.begin(), ssValue.end());
+                try {
+                    CWalletTx wtx;
+                    ssValue >> wtx;
+                    vWtx.push_back(wtx);
+                } catch (...) {
+                    // Decode failure likely due to Sapling v4 transaction format change
+                    // between 2.0.0 and 2.0.1. As user is requesting deletion, log the
+                    // transaction entry and then mark it for deletion anyway.
+                    LogPrintf("Failed to decode wallet transaction; logging it here before deletion:\n");
+                    LogPrintf("txid: %s\n%s\n", hash.GetHex(), HexStr(txData));
+                }
+
+                vTxHash.push_back(hash);
+            }
+        }
+        pcursor->close();
+    }
+    catch (const boost::thread_interrupted&) {
+        throw;
+    }
+    catch (...) {
+        result = DB_CORRUPT;
+    }
+
+    if (fNoncriticalErrors && result == DB_LOAD_OK)
+        result = DB_NONCRITICAL_ERROR;
+
+    return result;
+}
+
+DBErrors CWalletDB::ZapWalletTx(CWallet* pwallet, vector<CWalletTx>& vWtx)
+{
+    // build list of wallet TXs
+    vector<uint256> vTxHash;
+    DBErrors err = FindWalletTxToZap(pwallet, vTxHash, vWtx);
+    if (err != DB_LOAD_OK)
+        return err;
+
+    // erase each wallet TX
+    for (uint256& hash : vTxHash) {
+        if (!EraseTx(hash))
+            return DB_CORRUPT;
+    }
+
+    return DB_LOAD_OK;
+}
+
+void ThreadFlushWalletDB(const string& strFile)
+{
+    // Make this thread recognisable as the wallet flushing thread
+    RenameThread("zcash-wallet");
+
+    static bool fOneThread;
+    if (fOneThread)
+        return;
+    fOneThread = true;
+    if (!GetBoolArg("-flushwallet", DEFAULT_FLUSHWALLET))
+        return;
+
+    unsigned int nLastSeen = CWalletDB::GetUpdateCounter();
+    unsigned int nLastFlushed = CWalletDB::GetUpdateCounter();
+    int64_t nLastWalletUpdate = GetTime();
+    while (true)
+    {
+        MilliSleep(500);
+
+        if (nLastSeen != CWalletDB::GetUpdateCounter())
+        {
+            nLastSeen = CWalletDB::GetUpdateCounter();
+            nLastWalletUpdate = GetTime();
+        }
+
+        if (nLastFlushed != CWalletDB::GetUpdateCounter() && GetTime() - nLastWalletUpdate >= 2)
+        {
+            TRY_LOCK(bitdb.cs_db,lockDb);
+            if (lockDb)
+            {
+                // Don't do this if any databases are in use
+                int nRefCount = 0;
+                map<string, int>::iterator mi = bitdb.mapFileUseCount.begin();
+                while (mi != bitdb.mapFileUseCount.end())
+                {
+                    nRefCount += (*mi).second;
+                    mi++;
+                }
+
+                if (nRefCount == 0)
+                {
+                    boost::this_thread::interruption_point();
+                    map<string, int>::iterator mi = bitdb.mapFileUseCount.find(strFile);
+                    if (mi != bitdb.mapFileUseCount.end())
+                    {
+                        LogPrint("db", "Flushing %s\n", strFile);
+                        nLastFlushed = CWalletDB::GetUpdateCounter();
+                        int64_t nStart = GetTimeMillis();
+
+                        // Flush wallet file so it's self contained
+                        bitdb.CloseDb(strFile);
+                        bitdb.CheckpointLSN(strFile);
+
+                        bitdb.mapFileUseCount.erase(mi);
+                        LogPrint("db", "Flushed %s %dms\n", strFile, GetTimeMillis() - nStart);
+                    }
+                }
+            }
+        }
+    }
+}
+
+bool BackupWallet(const CWallet& wallet, const string& strDest)
+{
+    if (!wallet.fFileBacked)
+        return false;
+    while (true)
+    {
+        {
+            LOCK(bitdb.cs_db);
+            if (!bitdb.mapFileUseCount.count(wallet.strWalletFile) || bitdb.mapFileUseCount[wallet.strWalletFile] == 0)
+            {
+                // Flush log data to the dat file
+                bitdb.CloseDb(wallet.strWalletFile);
+                bitdb.CheckpointLSN(wallet.strWalletFile);
+                bitdb.mapFileUseCount.erase(wallet.strWalletFile);
+
+                // Copy wallet file
+                fs::path pathSrc = GetDataDir() / wallet.strWalletFile;
+                fs::path pathDest(strDest);
+                if (fs::is_directory(pathDest))
+                    pathDest /= wallet.strWalletFile;
+
+                try {
+                    fs::copy_file(pathSrc, pathDest, fs::copy_option::overwrite_if_exists);
+                    LogPrintf("copied %s to %s\n", wallet.strWalletFile, pathDest.string());
+                    return true;
+                } catch (const fs::filesystem_error& e) {
+                    LogPrintf("error copying %s to %s - %s\n", wallet.strWalletFile, pathDest.string(), e.what());
+                    return false;
+                }
+            }
+        }
+        MilliSleep(100);
+    }
+    return false;
+}
+
+//
+// Try to (very carefully!) recover wallet file if there is a problem.
+//
+bool CWalletDB::Recover(CDBEnv& dbenv, const std::string& filename, bool fOnlyKeys)
+{
+    // Recovery procedure:
+    // move wallet file to wallet.timestamp.bak
+    // Call Salvage with fAggressive=true to
+    // get as much data as possible.
+    // Rewrite salvaged data to fresh wallet file
+    // Set -rescan so any missing transactions will be
+    // found.
+    int64_t now = GetTime();
+    std::string newFilename = strprintf("wallet.%d.bak", now);
+
+    int result = dbenv.dbenv->dbrename(NULL, filename.c_str(), NULL,
+                                       newFilename.c_str(), DB_AUTO_COMMIT);
+    if (result == 0)
+        LogPrintf("Renamed %s to %s\n", filename, newFilename);
+    else
+    {
+        LogPrintf("Failed to rename %s to %s\n", filename, newFilename);
+        return false;
+    }
+
+    std::vector<CDBEnv::KeyValPair> salvagedData;
+    bool fSuccess = dbenv.Salvage(newFilename, true, salvagedData);
+    if (salvagedData.empty())
+    {
+        LogPrintf("Salvage(aggressive) found no records in %s.\n", newFilename);
+        return false;
+    }
+    LogPrintf("Salvage(aggressive) found %u records\n", salvagedData.size());
+
+    boost::scoped_ptr<Db> pdbCopy(new Db(dbenv.dbenv, 0));
+    int ret = pdbCopy->open(NULL,               // Txn pointer
+                            filename.c_str(),   // Filename
+                            "main",             // Logical db name
+                            DB_BTREE,           // Database type
+                            DB_CREATE,          // Flags
+                            0);
+    if (ret > 0)
+    {
+        LogPrintf("Cannot create database file %s\n", filename);
+        return false;
+    }
+    CWallet dummyWallet(Params());
+    CWalletScanState wss;
+
+    DbTxn* ptxn = dbenv.TxnBegin();
+    for (CDBEnv::KeyValPair& row : salvagedData)
+    {
+        if (fOnlyKeys)
+        {
+            CDataStream ssKey(row.first, SER_DISK, CLIENT_VERSION);
+            CDataStream ssValue(row.second, SER_DISK, CLIENT_VERSION);
+            string strType, strErr;
+            bool fReadOK;
+            {
+                // Required in LoadKeyMetadata():
+                LOCK(dummyWallet.cs_wallet);
+                fReadOK = ReadKeyValue(&dummyWallet, ssKey, ssValue,
+                                        wss, strType, strErr);
+            }
+            if (!IsKeyType(strType))
+                continue;
+            if (!fReadOK)
+            {
+                LogPrintf("WARNING: CWalletDB::Recover skipping %s: %s\n", strType, strErr);
+                continue;
+            }
+        }
+        Dbt datKey(&row.first[0], row.first.size());
+        Dbt datValue(&row.second[0], row.second.size());
+        int ret2 = pdbCopy->put(ptxn, &datKey, &datValue, DB_NOOVERWRITE);
+        if (ret2 > 0)
+            fSuccess = false;
+    }
+    ptxn->commit(0);
+    pdbCopy->close(0);
+
+    // Try to load the wallet's caches, uncovering inconsistencies in wallet
+    // records like missing viewing key records despite existing account
+    // records.
+    if (!dummyWallet.LoadCaches()) {
+        LogPrintf("WARNING: wallet caches could not be reconstructed; salvaged wallet file may have omissions");
+    }
+
+    return fSuccess;
+}
+
+bool CWalletDB::Recover(CDBEnv& dbenv, const std::string& filename)
+{
+    return CWalletDB::Recover(dbenv, filename, false);
+}
+
+bool CWalletDB::WriteDestData(const std::string &address, const std::string &key, const std::string &value)
+{
+    nWalletDBUpdateCounter++;
+    return Write(std::make_pair(std::string("destdata"), std::make_pair(address, key)), value);
+}
+
+bool CWalletDB::EraseDestData(const std::string &address, const std::string &key)
+{
+    nWalletDBUpdateCounter++;
+    return Erase(std::make_pair(std::string("destdata"), std::make_pair(address, key)));
+}
+
+bool CWalletDB::WriteNetworkInfo(const std::string& networkId)
+{
+    nWalletDBUpdateCounter++;
+    std::pair<std::string, std::string> networkInfo(PACKAGE_NAME, networkId);
+    return Write(std::string("networkinfo"), networkInfo);
+}
+
+bool CWalletDB::WriteMnemonicSeed(const MnemonicSeed& seed)
+{
+    nWalletDBUpdateCounter++;
+    return Write(std::make_pair(std::string("mnemonicphrase"), seed.Fingerprint()), seed);
+}
+
+bool CWalletDB::WriteCryptedMnemonicSeed(const uint256& seedFp, const std::vector<unsigned char>& vchCryptedSecret)
+{
+    nWalletDBUpdateCounter++;
+    return Write(std::make_pair(std::string("cmnemonicphrase"), seedFp), vchCryptedSecret);
+}
+
+bool CWalletDB::WriteMnemonicHDChain(const CHDChain& chain)
+{
+    nWalletDBUpdateCounter++;
+    return Write(std::string("mnemonichdchain"), chain);
+}
+
+void CWalletDB::IncrementUpdateCounter()
+{
+    nWalletDBUpdateCounter++;
+}
+
+unsigned int CWalletDB::GetUpdateCounter()
+{
+    return nWalletDBUpdateCounter;
+}
diff --git a/depend/zcash/src/wallet/walletdb.h b/depend/zcash/src/wallet/walletdb.h
new file mode 100644
index 000000000..9bec37536
--- /dev/null
+++ b/depend/zcash/src/wallet/walletdb.h
@@ -0,0 +1,497 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2013 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_WALLET_WALLETDB_H
+#define BITCOIN_WALLET_WALLETDB_H
+
+#include "amount.h"
+#include "wallet/db.h"
+#include "key.h"
+#include "keystore.h"
+#include "zcash/Address.hpp"
+#include "zcash/address/zip32.h"
+
+#include <list>
+#include <stdint.h>
+#include <string>
+#include <utility>
+#include <vector>
+
+static const bool DEFAULT_FLUSHWALLET = true;
+
+struct CBlockLocator;
+class CKeyPool;
+class CMasterKey;
+class CScript;
+class CWallet;
+class CWalletTx;
+class uint160;
+class uint256;
+
+/** Error statuses for the wallet database */
+enum DBErrors
+{
+    DB_LOAD_OK,
+    DB_CORRUPT,
+    DB_NONCRITICAL_ERROR,
+    DB_TOO_NEW,
+    DB_LOAD_FAIL,
+    DB_NEED_REWRITE,
+    DB_WRONG_NETWORK,
+};
+
+/* hd chain metadata */
+class CHDChain
+{
+private:
+    int nVersion;
+    uint256 seedFp;
+    int64_t nCreateTime; // 0 means unknown
+    uint32_t accountCounter;
+    uint32_t legacyTKeyExternalCounter;
+    uint32_t legacyTKeyInternalCounter;
+    uint32_t legacySaplingKeyCounter;
+    bool mnemonicSeedBackupConfirmed;
+
+    CHDChain() { SetNull(); }
+
+    void SetNull()
+    {
+        nVersion = CHDChain::CURRENT_VERSION;
+        seedFp.SetNull();
+        nCreateTime = 0;
+        accountCounter = 0;
+        legacyTKeyExternalCounter = 0;
+        legacyTKeyInternalCounter = 0;
+        legacySaplingKeyCounter = 0;
+        mnemonicSeedBackupConfirmed = false;
+    }
+public:
+    static const int VERSION_HD_BASE = 1;
+    static const int CURRENT_VERSION = VERSION_HD_BASE;
+
+    CHDChain(uint256 seedFpIn, int64_t nCreateTimeIn): nVersion(CHDChain::CURRENT_VERSION), seedFp(seedFpIn), nCreateTime(nCreateTimeIn), accountCounter(0), legacyTKeyExternalCounter(0), legacyTKeyInternalCounter(0), legacySaplingKeyCounter(0), mnemonicSeedBackupConfirmed(false) {}
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action)
+    {
+        READWRITE(nVersion);
+        READWRITE(seedFp);
+        READWRITE(nCreateTime);
+        READWRITE(accountCounter);
+        READWRITE(legacyTKeyExternalCounter);
+        READWRITE(legacyTKeyInternalCounter);
+        READWRITE(legacySaplingKeyCounter);
+        READWRITE(mnemonicSeedBackupConfirmed);
+    }
+
+    template <typename Stream>
+    static CHDChain Read(Stream& stream) {
+        CHDChain chain;
+        stream >> chain;
+        return chain;
+    }
+
+    const uint256 GetSeedFingerprint() const {
+        return seedFp;
+    }
+
+    uint32_t GetAccountCounter() const {
+        return accountCounter;
+    }
+
+    /** Increments the account counter by 1 and returns it. Returns std::nullopt
+     *  if the increment operation would cause an overflow. */
+    std::optional<uint32_t> IncrementAccountCounter() {
+        auto newAccountCounter = accountCounter + 1;
+        if (newAccountCounter >= libzcash::ZCASH_LEGACY_ACCOUNT) {
+            return std::nullopt;
+        } else {
+            accountCounter = newAccountCounter;
+            return newAccountCounter;
+        }
+    }
+
+    uint32_t GetLegacyTKeyCounter(bool external) {
+        return external ? legacyTKeyExternalCounter : legacyTKeyInternalCounter;
+    }
+
+    void IncrementLegacyTKeyCounter(bool external) {
+        if (external) {
+            legacyTKeyExternalCounter += 1;
+        } else {
+            legacyTKeyInternalCounter += 1;
+        }
+    }
+
+    uint32_t GetLegacySaplingKeyCounter() const {
+        return legacySaplingKeyCounter;
+    }
+
+    void IncrementLegacySaplingKeyCounter() {
+        legacySaplingKeyCounter += 1;
+    }
+
+    void SetMnemonicSeedBackupConfirmed() {
+        mnemonicSeedBackupConfirmed = true;
+    }
+
+    bool IsMnemonicSeedBackupConfirmed() {
+        return mnemonicSeedBackupConfirmed;
+    }
+};
+
+class CKeyMetadata
+{
+public:
+    static const int VERSION_BASIC=1;
+    static const int VERSION_WITH_HDDATA=10;
+    static const int CURRENT_VERSION=VERSION_WITH_HDDATA;
+    int nVersion;
+    int64_t nCreateTime; // 0 means unknown
+    std::string hdKeypath; //optional HD/zip32 keypath
+    uint256 seedFp;
+
+    CKeyMetadata()
+    {
+        SetNull();
+    }
+    CKeyMetadata(int64_t nCreateTime_)
+    {
+        SetNull();
+        nCreateTime = nCreateTime_;
+    }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(this->nVersion);
+        READWRITE(nCreateTime);
+        if (this->nVersion >= VERSION_WITH_HDDATA)
+        {
+            READWRITE(hdKeypath);
+            READWRITE(seedFp);
+        }
+    }
+
+    void SetNull()
+    {
+        nVersion = CKeyMetadata::CURRENT_VERSION;
+        nCreateTime = 0;
+        hdKeypath.clear();
+        seedFp.SetNull();
+    }
+};
+
+class ZcashdUnifiedAccountMetadata {
+private:
+    libzcash::SeedFingerprint seedFp;
+    uint32_t bip44CoinType;
+    libzcash::AccountId accountId;
+    libzcash::UFVKId ufvkId;
+
+    ZcashdUnifiedAccountMetadata() {}
+public:
+    ZcashdUnifiedAccountMetadata(
+            libzcash::SeedFingerprint seedFp,
+            uint32_t bip44CoinType,
+            libzcash::AccountId accountId,
+            libzcash::UFVKId ufvkId):
+            seedFp(seedFp), bip44CoinType(bip44CoinType), accountId(accountId), ufvkId(ufvkId) {}
+
+    /** Returns the fingerprint of the HD seed used to generate this key. */
+    const libzcash::SeedFingerprint& GetSeedFingerprint() const {
+        return seedFp;
+    }
+    /** Returns the ZIP 32 account id for which this key was generated. */
+    uint32_t GetBip44CoinType() const {
+        return bip44CoinType;
+    }
+    /** Returns the ZIP 32 account id for which this key was generated. */
+    libzcash::AccountId GetAccountId() const {
+        return accountId;
+    }
+    /** Returns the fingerprint of the ufvk this key was generated. */
+    const libzcash::UFVKId& GetKeyID() const {
+        return ufvkId;
+    }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(seedFp);
+        READWRITE(bip44CoinType);
+        READWRITE(accountId);
+        READWRITE(ufvkId);
+    }
+
+    template <typename Stream>
+    static ZcashdUnifiedAccountMetadata Read(Stream& stream) {
+        ZcashdUnifiedAccountMetadata meta;
+        stream >> meta;
+        return meta;
+    }
+};
+
+class ZcashdUnifiedAddressMetadata;
+
+// Serialization wrapper for reading and writing ReceiverType
+// in CompactSize format.
+class ReceiverTypeSer {
+private:
+    libzcash::ReceiverType t;
+
+    friend class ZcashdUnifiedAddressMetadata;
+public:
+    ReceiverTypeSer() {} // for serialization only
+    ReceiverTypeSer(libzcash::ReceiverType t): t(t) {}
+
+    template<typename Stream>
+    void Serialize(Stream &s) const {
+        WriteCompactSize<Stream>(s, (uint64_t) t);
+    }
+
+    template<typename Stream>
+    void Unserialize(Stream& s) {
+        t = (libzcash::ReceiverType) ReadCompactSize<Stream>(s);
+    }
+};
+
+class ZcashdUnifiedAddressMetadata {
+private:
+    libzcash::UFVKId ufvkId;
+    libzcash::diversifier_index_t diversifierIndex;
+    std::set<libzcash::ReceiverType> receiverTypes;
+
+    ZcashdUnifiedAddressMetadata() {}
+public:
+    ZcashdUnifiedAddressMetadata(
+            libzcash::UFVKId ufvkId,
+            libzcash::diversifier_index_t diversifierIndex,
+            std::set<libzcash::ReceiverType> receiverTypes):
+            ufvkId(ufvkId), diversifierIndex(diversifierIndex), receiverTypes(receiverTypes) {}
+
+    libzcash::UFVKId GetKeyID() const {
+        return ufvkId;
+    }
+    libzcash::diversifier_index_t GetDiversifierIndex() const {
+        return diversifierIndex;
+    }
+    const std::set<libzcash::ReceiverType>& GetReceiverTypes() const {
+        return receiverTypes;
+    }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(ufvkId);
+        READWRITE(diversifierIndex);
+        if (ser_action.ForRead()) {
+            std::vector<ReceiverTypeSer> serReceiverTypes;
+            READWRITE(serReceiverTypes);
+            receiverTypes.clear();
+            for (ReceiverTypeSer r : serReceiverTypes)
+                receiverTypes.insert(r.t);
+        } else {
+            std::vector<ReceiverTypeSer> serReceiverTypes;
+            for (libzcash::ReceiverType r : receiverTypes)
+                serReceiverTypes.push_back(ReceiverTypeSer(r));
+            READWRITE(serReceiverTypes);
+        }
+    }
+
+    template <typename Stream>
+    static ZcashdUnifiedAddressMetadata Read(Stream& stream) {
+        ZcashdUnifiedAddressMetadata meta;
+        stream >> meta;
+        return meta;
+    }
+
+    friend inline bool operator==(const ZcashdUnifiedAddressMetadata& a, const ZcashdUnifiedAddressMetadata& b) {
+        return
+            a.ufvkId == b.ufvkId &&
+            a.diversifierIndex == b.diversifierIndex &&
+            a.receiverTypes == b.receiverTypes;
+    }
+};
+
+// Serialization wrapper for reading and writing RecipientAddress
+// as a pair of typecode and address bytes, similar to how unified address
+// receivers are written (but excluding the unknown receiver case)
+class CSerializeRecipientAddress {
+    libzcash::RecipientAddress recipient;
+    libzcash::ReceiverType typecode;
+    CSerializeRecipientAddress() {} // for serialization only
+
+    public:
+        CSerializeRecipientAddress(libzcash::RecipientAddress recipient): recipient(recipient) {}
+
+        template<typename Stream>
+        void Serialize(Stream& s) const {
+            std::visit(match {
+                [&](const CKeyID& keyId) {
+                    ReceiverTypeSer(libzcash::ReceiverType::P2PKH).Serialize(s);
+                    s << keyId;
+                },
+                [&](const CScriptID& scriptId) {
+                    ReceiverTypeSer(libzcash::ReceiverType::P2SH).Serialize(s);
+                    s << scriptId;
+                },
+                [&](const libzcash::SaplingPaymentAddress& saplingAddr) {
+                    ReceiverTypeSer(libzcash::ReceiverType::Sapling).Serialize(s);
+                    s << saplingAddr;
+                },
+                [&](const libzcash::OrchardRawAddress& orchardAddr) {
+                    ReceiverTypeSer(libzcash::ReceiverType::Orchard).Serialize(s);
+                    s << orchardAddr;
+                }
+            }, recipient);
+        }
+
+        template<typename Stream>
+        void Unserialize(Stream& s) {
+            // This cast is fine because ZIP 316 uses CompactSize serialization including the
+            // size limit, which means it is at most a uint32_t.
+            typecode = (libzcash::ReceiverType) ReadCompactSize(s);
+            switch (typecode) {
+                case libzcash::ReceiverType::P2PKH: {
+                    CKeyID key;
+                    s >> key;
+                    recipient = key;
+                    break;
+                }
+                case libzcash::ReceiverType::P2SH: {
+                    CScriptID script;
+                    s >> script;
+                    recipient = script;
+                    break;
+                }
+                case libzcash::ReceiverType::Sapling: {
+                    libzcash::SaplingPaymentAddress saplingAddr;
+                    s >> saplingAddr;
+                    recipient = saplingAddr;
+                    break;
+                }
+                case libzcash::ReceiverType::Orchard: {
+                    auto orchardAddr = libzcash::OrchardRawAddress::Read(s);
+                    recipient = orchardAddr;
+                    break;
+                }
+            }
+        }
+
+        template <typename Stream>
+        static libzcash::RecipientAddress Read(Stream& stream) {
+            CSerializeRecipientAddress csr;
+            stream >> csr;
+            return csr.recipient;
+        }
+};
+
+/** Access to the wallet database */
+class CWalletDB : public CDB
+{
+public:
+    CWalletDB(const std::string& strFilename, const char* pszMode = "r+", bool fFlushOnClose = true) : CDB(strFilename, pszMode, fFlushOnClose)
+    {
+    }
+
+    bool WriteName(const std::string& strAddress, const std::string& strName);
+    bool EraseName(const std::string& strAddress);
+
+    bool WritePurpose(const std::string& strAddress, const std::string& purpose);
+    bool ErasePurpose(const std::string& strAddress);
+
+    bool WriteTx(const CWalletTx& wtx);
+    bool EraseTx(uint256 hash);
+
+    bool WriteKey(const CPubKey& vchPubKey, const CPrivKey& vchPrivKey, const CKeyMetadata &keyMeta);
+    bool WriteCryptedKey(const CPubKey& vchPubKey, const std::vector<unsigned char>& vchCryptedSecret, const CKeyMetadata &keyMeta);
+    bool WriteMasterKey(unsigned int nID, const CMasterKey& kMasterKey);
+
+    bool WriteCScript(const uint160& hash, const CScript& redeemScript);
+
+    bool WriteWatchOnly(const CScript &script);
+    bool EraseWatchOnly(const CScript &script);
+
+    bool WriteBestBlock(const CBlockLocator& locator);
+    bool ReadBestBlock(CBlockLocator& locator);
+
+    bool WriteOrderPosNext(int64_t nOrderPosNext);
+
+    bool WriteDefaultKey(const CPubKey& vchPubKey);
+
+    bool WriteWitnessCacheSize(int64_t nWitnessCacheSize);
+
+    bool ReadPool(int64_t nPool, CKeyPool& keypool);
+    bool WritePool(int64_t nPool, const CKeyPool& keypool);
+    bool ErasePool(int64_t nPool);
+
+    bool WriteMinVersion(int nVersion);
+
+    bool WriteRecipientMapping(const uint256& txid, const libzcash::RecipientAddress& address, const libzcash::UnifiedAddress& ua);
+
+    /// Write destination data key,value tuple to database
+    bool WriteDestData(const std::string &address, const std::string &key, const std::string &value);
+    /// Erase destination data tuple from wallet database
+    bool EraseDestData(const std::string &address, const std::string &key);
+
+    DBErrors LoadWallet(CWallet* pwallet);
+    DBErrors FindWalletTxToZap(CWallet* pwallet, std::vector<uint256>& vTxHash, std::vector<CWalletTx>& vWtx);
+    DBErrors ZapWalletTx(CWallet* pwallet, std::vector<CWalletTx>& vWtx);
+    static bool Recover(CDBEnv& dbenv, const std::string& filename, bool fOnlyKeys);
+    static bool Recover(CDBEnv& dbenv, const std::string& filename);
+
+    bool WriteNetworkInfo(const std::string& networkId);
+    bool WriteMnemonicSeed(const MnemonicSeed& seed);
+    bool WriteCryptedMnemonicSeed(const uint256& seedFp, const std::vector<unsigned char>& vchCryptedSecret);
+    bool WriteMnemonicHDChain(const CHDChain& chain);
+
+    /// Write spending key to wallet database, where key is payment address and value is spending key.
+    bool WriteZKey(const libzcash::SproutPaymentAddress& addr, const libzcash::SproutSpendingKey& key, const CKeyMetadata &keyMeta);
+    bool WriteSaplingZKey(const libzcash::SaplingIncomingViewingKey &ivk,
+                          const libzcash::SaplingExtendedSpendingKey &key,
+                          const CKeyMetadata  &keyMeta);
+    bool WriteSaplingPaymentAddress(const libzcash::SaplingPaymentAddress &addr,
+                                    const libzcash::SaplingIncomingViewingKey &ivk);
+    bool WriteCryptedZKey(const libzcash::SproutPaymentAddress & addr,
+                          const libzcash::ReceivingKey & rk,
+                          const std::vector<unsigned char>& vchCryptedSecret,
+                          const CKeyMetadata &keyMeta);
+    bool WriteCryptedSaplingZKey(const libzcash::SaplingExtendedFullViewingKey &extfvk,
+                          const std::vector<unsigned char>& vchCryptedSecret,
+                          const CKeyMetadata &keyMeta);
+
+    bool WriteSproutViewingKey(const libzcash::SproutViewingKey &vk);
+    bool EraseSproutViewingKey(const libzcash::SproutViewingKey &vk);
+    bool WriteSaplingExtendedFullViewingKey(const libzcash::SaplingExtendedFullViewingKey &extfvk);
+    bool EraseSaplingExtendedFullViewingKey(const libzcash::SaplingExtendedFullViewingKey &extfvk);
+
+    /// Orchard support.
+    bool WriteOrchardWitnesses(const OrchardWallet& wallet);
+
+    /// Unified key support.
+
+    bool WriteUnifiedAccountMetadata(const ZcashdUnifiedAccountMetadata& keymeta);
+    bool WriteUnifiedFullViewingKey(const libzcash::UnifiedFullViewingKey& ufvk);
+    bool WriteUnifiedAddressMetadata(const ZcashdUnifiedAddressMetadata& addrmeta);
+
+    static void IncrementUpdateCounter();
+    static unsigned int GetUpdateCounter();
+private:
+    CWalletDB(const CWalletDB&);
+    void operator=(const CWalletDB&);
+
+};
+
+bool BackupWallet(const CWallet& wallet, const std::string& strDest);
+void ThreadFlushWalletDB(const std::string& strFile);
+
+#endif // BITCOIN_WALLET_WALLETDB_H
diff --git a/depend/zcash/src/warnings.cpp b/depend/zcash/src/warnings.cpp
new file mode 100644
index 000000000..6f4e448bf
--- /dev/null
+++ b/depend/zcash/src/warnings.cpp
@@ -0,0 +1,117 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2016 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "sync.h"
+#include "clientversion.h"
+#include "util.h"
+#include "warnings.h"
+#include "alert.h"
+#include "uint256.h"
+
+CCriticalSection cs_warnings;
+std::string strMiscWarning;
+int64_t timestampWarning;
+bool fLargeWorkForkFound = false;
+bool fLargeWorkInvalidChainFound = false;
+
+void SetMiscWarning(const std::string& strWarning, int64_t timestamp)
+{
+    LOCK(cs_warnings);
+    strMiscWarning = strWarning;
+    timestampWarning = timestamp;
+}
+
+std::pair<std::string, int64_t> GetMiscWarning()
+{
+    LOCK(cs_warnings);
+    return std::make_pair(strMiscWarning, timestampWarning);
+}
+
+void SetfLargeWorkForkFound(bool flag)
+{
+    LOCK(cs_warnings);
+    fLargeWorkForkFound = flag;
+}
+
+bool GetfLargeWorkForkFound()
+{
+    LOCK(cs_warnings);
+    return fLargeWorkForkFound;
+}
+
+void SetfLargeWorkInvalidChainFound(bool flag)
+{
+    LOCK(cs_warnings);
+    fLargeWorkInvalidChainFound = flag;
+}
+
+bool GetfLargeWorkInvalidChainFound()
+{
+    LOCK(cs_warnings);
+    return fLargeWorkInvalidChainFound;
+}
+
+std::pair<std::string, int64_t> GetWarnings(const std::string& strFor)
+{
+    std::pair<std::string, int64_t> rpc;
+    std::pair<std::string, int64_t> statusbar;
+    statusbar.second = rpc.second = GetTime();
+    int nPriority = 0;
+
+    LOCK(cs_warnings);
+
+    if (!CLIENT_VERSION_IS_RELEASE)
+        statusbar.first = _("This is a pre-release test build - use at your own risk - do not use for mining or merchant applications");
+
+    if (GetBoolArg("-testsafemode", DEFAULT_TESTSAFEMODE))
+        statusbar.first = rpc.first = "testsafemode enabled";
+
+    // Misc warnings like out of disk space and clock is wrong
+    if (strMiscWarning != "")
+    {
+        nPriority = 1000;
+        statusbar.first = strMiscWarning;
+        statusbar.second = timestampWarning;
+    }
+
+    if (fLargeWorkForkFound)
+    {
+        nPriority = 2000;
+        statusbar.first = rpc.first = _("Warning: The network does not appear to fully agree! Some miners appear to be experiencing issues.");
+        statusbar.second = rpc.second = GetTime();
+    }
+    else if (fLargeWorkInvalidChainFound)
+    {
+        nPriority = 2000;
+        statusbar.first = rpc.first = _("Warning: We do not appear to fully agree with our peers! You may need to upgrade, or other nodes may need to upgrade.");
+        statusbar.second = rpc.second = GetTime();
+    }
+
+    // Alerts
+    {
+        LOCK(cs_mapAlerts);
+        for (const std::pair<uint256, CAlert>& item : mapAlerts)
+        {
+            const CAlert& alert = item.second;
+            if (alert.AppliesToMe() && alert.nPriority > nPriority)
+            {
+                nPriority = alert.nPriority;
+                statusbar.first = alert.strStatusBar;
+                statusbar.second = GetTime();
+                if (alert.nPriority >= ALERT_PRIORITY_SAFE_MODE) {
+                    rpc.first = alert.strRPCError;
+                    rpc.second = statusbar.second;
+                }
+            }
+        }
+    }
+
+    if (strFor == "statusbar")
+        return statusbar;
+    else if (strFor == "rpc")
+        return rpc;
+    assert(!"GetWarnings(): invalid parameter");
+    return std::make_pair("error", GetTime());
+}
diff --git a/depend/zcash/src/warnings.h b/depend/zcash/src/warnings.h
new file mode 100644
index 000000000..f3b6f58e4
--- /dev/null
+++ b/depend/zcash/src/warnings.h
@@ -0,0 +1,22 @@
+// Copyright (c) 2009-2010 Satoshi Nakamoto
+// Copyright (c) 2009-2016 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_WARNINGS_H
+#define BITCOIN_WARNINGS_H
+
+#include <stdlib.h>
+#include <string>
+
+void SetMiscWarning(const std::string& strWarning, int64_t timestamp);
+std::pair<std::string, int64_t> GetMiscWarning();
+void SetfLargeWorkForkFound(bool flag);
+bool GetfLargeWorkForkFound();
+void SetfLargeWorkInvalidChainFound(bool flag);
+bool GetfLargeWorkInvalidChainFound();
+std::pair<std::string, int64_t> GetWarnings(const std::string& strFor);
+
+static const bool DEFAULT_TESTSAFEMODE = false;
+
+#endif //  BITCOIN_WARNINGS_H
diff --git a/depend/zcash/src/zcash/Address.cpp b/depend/zcash/src/zcash/Address.cpp
new file mode 100644
index 000000000..bef337ea7
--- /dev/null
+++ b/depend/zcash/src/zcash/Address.cpp
@@ -0,0 +1,381 @@
+#include "Address.hpp"
+#include "zcash/address/unified.h"
+#include "utilstrencodings.h"
+
+#include <algorithm>
+#include <iostream>
+#include <rust/address.h>
+
+const uint8_t ZCASH_UA_TYPECODE_P2PKH = 0x00;
+const uint8_t ZCASH_UA_TYPECODE_P2SH = 0x01;
+const uint8_t ZCASH_UA_TYPECODE_SAPLING = 0x02;
+
+namespace libzcash {
+
+//
+// Unified Addresses
+//
+
+static bool AddOrchardReceiver(void* ua, OrchardRawAddressPtr* ptr)
+{
+    return reinterpret_cast<libzcash::UnifiedAddress*>(ua)->AddReceiver(
+        libzcash::OrchardRawAddress::KeyIoOnlyFromReceiver(ptr));
+}
+
+/**
+ * `raw` MUST be 43 bytes.
+ */
+static bool AddSaplingReceiver(void* ua, const unsigned char* raw)
+{
+    CDataStream ss(
+        reinterpret_cast<const char*>(raw),
+        reinterpret_cast<const char*>(raw + 43),
+        SER_NETWORK,
+        PROTOCOL_VERSION);
+    libzcash::SaplingPaymentAddress receiver;
+    ss >> receiver;
+    return reinterpret_cast<libzcash::UnifiedAddress*>(ua)->AddReceiver(receiver);
+}
+
+/**
+ * `raw` MUST be 20 bytes.
+ */
+static bool AddP2SHReceiver(void* ua, const unsigned char* raw)
+{
+    CDataStream ss(
+        reinterpret_cast<const char*>(raw),
+        reinterpret_cast<const char*>(raw + 20),
+        SER_NETWORK,
+        PROTOCOL_VERSION);
+    CScriptID receiver;
+    ss >> receiver;
+    return reinterpret_cast<libzcash::UnifiedAddress*>(ua)->AddReceiver(receiver);
+}
+
+/**
+ * `raw` MUST be 20 bytes.
+ */
+static bool AddP2PKHReceiver(void* ua, const unsigned char* raw)
+{
+    CDataStream ss(
+        reinterpret_cast<const char*>(raw),
+        reinterpret_cast<const char*>(raw + 20),
+        SER_NETWORK,
+        PROTOCOL_VERSION);
+    CKeyID receiver;
+    ss >> receiver;
+    return reinterpret_cast<libzcash::UnifiedAddress*>(ua)->AddReceiver(receiver);
+}
+
+static bool AddUnknownReceiver(void* ua, uint32_t typecode, const unsigned char* data, size_t len)
+{
+    libzcash::UnknownReceiver receiver(typecode, std::vector(data, data + len));
+    return reinterpret_cast<libzcash::UnifiedAddress*>(ua)->AddReceiver(receiver);
+}
+
+std::optional<UnifiedAddress> UnifiedAddress::Parse(const KeyConstants& keyConstants, const std::string& str) {
+    libzcash::UnifiedAddress ua;
+    if (zcash_address_parse_unified(
+        str.c_str(),
+        keyConstants.NetworkIDString().c_str(),
+        &ua,
+        AddOrchardReceiver,
+        AddSaplingReceiver,
+        AddP2SHReceiver,
+        AddP2PKHReceiver,
+        AddUnknownReceiver)
+    ) {
+        return ua;
+    } else {
+        return std::nullopt;
+    }
+}
+
+std::vector<const Receiver*> UnifiedAddress::GetSorted() const {
+    std::vector<const libzcash::Receiver*> sorted;
+    for (const auto& receiver : receivers) {
+        sorted.push_back(&receiver);
+    }
+    // TODO: Check how pointers to variants are compared.
+    std::sort(sorted.begin(), sorted.end());
+    return sorted;
+}
+
+bool UnifiedAddress::AddReceiver(Receiver receiver) {
+    auto typecode = std::visit(TypecodeForReceiver(), receiver);
+    for (const auto& r : receivers) {
+        auto t = std::visit(TypecodeForReceiver(), r);
+        if (
+            (t == typecode) ||
+            (std::holds_alternative<CKeyID>(r) && std::holds_alternative<CScriptID>(receiver)) ||
+            (std::holds_alternative<CScriptID>(r) && std::holds_alternative<CKeyID>(receiver))
+        ) {
+            return false;
+        }
+    }
+
+    receivers.push_back(receiver);
+    return true;
+}
+
+bool UnifiedAddress::ContainsReceiver(const Receiver& receiver) const {
+    for (const auto& r : GetReceiversAsParsed()) {
+        if (r == receiver) {
+            return true;
+        }
+    }
+    return false;
+}
+
+std::optional<CKeyID> UnifiedAddress::GetP2PKHReceiver() const {
+    for (const auto& r : receivers) {
+        if (std::holds_alternative<CKeyID>(r)) {
+            return std::get<CKeyID>(r);
+        }
+    }
+
+    return std::nullopt;
+}
+
+std::optional<CScriptID> UnifiedAddress::GetP2SHReceiver() const {
+    for (const auto& r : receivers) {
+        if (std::holds_alternative<CScriptID>(r)) {
+            return std::get<CScriptID>(r);
+        }
+    }
+
+    return std::nullopt;
+}
+
+std::optional<SaplingPaymentAddress> UnifiedAddress::GetSaplingReceiver() const {
+    for (const auto& r : receivers) {
+        if (std::holds_alternative<SaplingPaymentAddress>(r)) {
+            return std::get<SaplingPaymentAddress>(r);
+        }
+    }
+
+    return std::nullopt;
+}
+
+std::optional<OrchardRawAddress> UnifiedAddress::GetOrchardReceiver() const {
+    for (const auto& r : receivers) {
+        if (std::holds_alternative<OrchardRawAddress>(r)) {
+            return std::get<OrchardRawAddress>(r);
+        }
+    }
+
+    return std::nullopt;
+}
+
+std::optional<RecipientAddress> UnifiedAddress::GetPreferredRecipientAddress(
+    const Consensus::Params& consensus, int height) const
+{
+    bool nu5Active = consensus.NetworkUpgradeActive(height, Consensus::UPGRADE_NU5);
+
+    // Return the first receiver type we recognize; receivers are sorted in
+    // order from most-preferred to least.
+    std::optional<RecipientAddress> result;
+    for (const auto& receiver : *this) {
+        std::visit(match {
+            [&](const OrchardRawAddress& addr) { if (nu5Active) result = addr; },
+            [&](const SaplingPaymentAddress& addr) { result = addr; },
+            [&](const CScriptID& addr) { result = addr; },
+            [&](const CKeyID& addr) { result = addr; },
+            [&](const UnknownReceiver& addr) { }
+        }, receiver);
+
+        if (result.has_value()) {
+            return result;
+        }
+    }
+    return std::nullopt;
+}
+
+bool HasKnownReceiverType(const Receiver& receiver) {
+    return std::visit(match {
+        [](const OrchardRawAddress& addr) { return true; },
+        [](const SaplingPaymentAddress& addr) { return true; },
+        [](const CScriptID& addr) { return true; },
+        [](const CKeyID& addr) { return true; },
+        [](const UnknownReceiver& addr) { return false; }
+    }, receiver);
+}
+
+std::pair<std::string, PaymentAddress> AddressInfoFromSpendingKey::operator()(const SproutSpendingKey &sk) const {
+    return std::make_pair("sprout", sk.address());
+}
+std::pair<std::string, PaymentAddress> AddressInfoFromSpendingKey::operator()(const SaplingExtendedSpendingKey &sk) const {
+    return std::make_pair("sapling", sk.ToXFVK().DefaultAddress());
+}
+
+std::pair<std::string, PaymentAddress> AddressInfoFromViewingKey::operator()(const SproutViewingKey &sk) const {
+    return std::make_pair("sprout", sk.address());
+}
+std::pair<std::string, PaymentAddress> AddressInfoFromViewingKey::operator()(const SaplingExtendedFullViewingKey &xfvk) const {
+    return std::make_pair("sapling", xfvk.DefaultAddress());
+}
+std::pair<std::string, PaymentAddress> AddressInfoFromViewingKey::operator()(const UnifiedFullViewingKey &ufvk) const {
+    // using std::get here is safe because we're searching from 0
+    auto addr = std::get<std::pair<UnifiedAddress, diversifier_index_t>>(
+        ZcashdUnifiedFullViewingKey::FromUnifiedFullViewingKey(keyConstants, ufvk)
+            .FindAddress(diversifier_index_t(0))
+    );
+    return std::make_pair("unified", addr.first);
+}
+
+} // namespace libzcash
+
+uint32_t TypecodeForReceiver::operator()(
+    const libzcash::OrchardRawAddress &zaddr) const
+{
+    return static_cast<uint32_t>(libzcash::ReceiverType::Orchard);
+}
+
+uint32_t TypecodeForReceiver::operator()(
+    const libzcash::SaplingPaymentAddress &zaddr) const
+{
+    return ZCASH_UA_TYPECODE_SAPLING;
+}
+uint32_t TypecodeForReceiver::operator()(
+    const CScriptID &p2sh) const
+{
+    return ZCASH_UA_TYPECODE_P2SH;
+}
+uint32_t TypecodeForReceiver::operator()(
+    const CKeyID &p2sh) const
+{
+    return ZCASH_UA_TYPECODE_P2PKH;
+}
+uint32_t TypecodeForReceiver::operator()(
+    const libzcash::UnknownReceiver &unknown) const
+{
+    return unknown.typecode;
+}
+
+//
+// Unified full viewing keys
+//
+
+std::optional<libzcash::UnifiedFullViewingKey> libzcash::UnifiedFullViewingKey::Decode(
+        const std::string& str,
+        const KeyConstants& keyConstants) {
+    UnifiedFullViewingKeyPtr* ptr = unified_full_viewing_key_parse(
+        keyConstants.NetworkIDString().c_str(),
+        str.c_str());
+    if (ptr == nullptr) {
+        return std::nullopt;
+    } else {
+        return UnifiedFullViewingKey(ptr);
+    }
+}
+
+std::string libzcash::UnifiedFullViewingKey::Encode(const KeyConstants& keyConstants) const {
+    auto encoded = unified_full_viewing_key_serialize(
+                        keyConstants.NetworkIDString().c_str(),
+                        inner.get());
+    // Copy the C-string into C++.
+    std::string res(encoded);
+    // Free the C-string.
+    zcash_address_string_free(encoded);
+    return res;
+}
+
+std::optional<libzcash::OrchardFullViewingKey> libzcash::UnifiedFullViewingKey::GetOrchardKey() const {
+    std::vector<uint8_t> buffer(96);
+    if (unified_full_viewing_key_read_orchard(inner.get(), buffer.data())) {
+        CDataStream ss(buffer, SER_NETWORK, PROTOCOL_VERSION);
+        return OrchardFullViewingKey::Read(ss);
+    } else {
+        return std::nullopt;
+    }
+}
+
+std::optional<libzcash::SaplingDiversifiableFullViewingKey> libzcash::UnifiedFullViewingKey::GetSaplingKey() const {
+    std::vector<uint8_t> buffer(128);
+    if (unified_full_viewing_key_read_sapling(inner.get(), buffer.data())) {
+        CDataStream ss(buffer, SER_NETWORK, PROTOCOL_VERSION);
+        return SaplingDiversifiableFullViewingKey::Read(ss);
+    } else {
+        return std::nullopt;
+    }
+}
+
+std::optional<libzcash::transparent::AccountPubKey> libzcash::UnifiedFullViewingKey::GetTransparentKey() const {
+    std::vector<uint8_t> buffer(65);
+    if (unified_full_viewing_key_read_transparent(inner.get(), buffer.data())) {
+        CDataStream ss(buffer, SER_NETWORK, PROTOCOL_VERSION);
+        return libzcash::transparent::AccountPubKey(CChainablePubKey::Read(ss));
+    } else {
+        return std::nullopt;
+    }
+}
+
+bool libzcash::UnifiedFullViewingKeyBuilder::AddTransparentKey(const transparent::AccountPubKey& key) {
+    if (t_bytes.has_value()) return false;
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << key.GetChainablePubKey();
+    assert(ss.size() == 65);
+    std::vector<uint8_t> ss_bytes(ss.begin(), ss.end());
+    t_bytes = ss_bytes;
+    return true;
+}
+
+bool libzcash::UnifiedFullViewingKeyBuilder::AddSaplingKey(const SaplingDiversifiableFullViewingKey& key) {
+    if (sapling_bytes.has_value()) return false;
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << key;
+    assert(ss.size() == 128);
+    std::vector<uint8_t> ss_bytes(ss.begin(), ss.end());
+    sapling_bytes = ss_bytes;
+    return true;
+}
+
+bool libzcash::UnifiedFullViewingKeyBuilder::AddOrchardKey(const OrchardFullViewingKey& key) {
+    if (orchard_bytes.has_value()) return false;
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << key;
+    assert(ss.size() == 96);
+    std::vector<uint8_t> ss_bytes(ss.begin(), ss.end());
+    orchard_bytes = ss_bytes;
+    return true;
+}
+
+std::optional<libzcash::UnifiedFullViewingKey> libzcash::UnifiedFullViewingKeyBuilder::build() const {
+    UnifiedFullViewingKeyPtr* ptr = unified_full_viewing_key_from_components(
+            t_bytes.has_value() ? t_bytes.value().data() : nullptr,
+            sapling_bytes.has_value() ? sapling_bytes.value().data() : nullptr,
+            orchard_bytes.has_value() ? orchard_bytes.value().data() : nullptr);
+
+    if (ptr == nullptr) {
+        return std::nullopt;
+    } else {
+        return UnifiedFullViewingKey(ptr);
+    }
+}
+
+libzcash::UnifiedFullViewingKey libzcash::UnifiedFullViewingKey::FromZcashdUFVK(const ZcashdUnifiedFullViewingKey& key) {
+    UnifiedFullViewingKeyBuilder builder;
+    if (key.GetTransparentKey().has_value()) {
+        builder.AddTransparentKey(key.GetTransparentKey().value());
+    }
+    if (key.GetSaplingKey().has_value()) {
+        builder.AddSaplingKey(key.GetSaplingKey().value());
+    }
+    if (key.GetOrchardKey().has_value()) {
+        builder.AddOrchardKey(key.GetOrchardKey().value());
+    }
+
+    auto result = builder.build();
+    if (!result.has_value()) {
+        throw std::invalid_argument("Cannot convert from invalid viewing key.");
+    }
+    return result.value();
+}
+
+libzcash::UFVKId libzcash::UnifiedFullViewingKey::GetKeyID(const KeyConstants& keyConstants) const {
+    // The ID of a ufvk is the blake2b hash of the serialized form of the
+    // ufvk with the receivers sorted in typecode order.
+    CBLAKE2bWriter h(SER_GETHASH, 0, ZCASH_UFVK_ID_PERSONAL);
+    h << Encode(keyConstants);
+    return libzcash::UFVKId(h.GetHash());
+}
diff --git a/depend/zcash/src/zcash/Address.hpp b/depend/zcash/src/zcash/Address.hpp
new file mode 100644
index 000000000..c4d230daa
--- /dev/null
+++ b/depend/zcash/src/zcash/Address.hpp
@@ -0,0 +1,331 @@
+#ifndef ZC_ADDRESS_H_
+#define ZC_ADDRESS_H_
+
+#include "consensus/params.h"
+#include "key_constants.h"
+#include "pubkey.h"
+#include "key_constants.h"
+#include "script/script.h"
+#include "uint256.h"
+#include "pubkey.h"
+#include "script/script.h"
+#include "util/match.h"
+#include "zcash/address/orchard.hpp"
+#include "zcash/address/sapling.hpp"
+#include "zcash/address/sprout.hpp"
+#include "zcash/address/unified.h"
+#include "zcash/address/zip32.h"
+
+#include <variant>
+#include <rust/unified_keys.h>
+
+const unsigned char ZCASH_UFVK_ID_PERSONAL[BLAKE2bPersonalBytes] =
+    {'Z', 'c', 'a', 's', 'h', '_', 'U', 'F', 'V', 'K', '_', 'I', 'd', '_', 'F', 'P'};
+
+namespace libzcash {
+
+bool HasKnownReceiverType(const Receiver& receiver);
+
+struct ReceiverIterator {
+    using iterator_category = std::random_access_iterator_tag;
+    using difference_type   = std::ptrdiff_t;
+    using value_type        = const Receiver;
+    using pointer           = const Receiver*;
+    using reference         = const Receiver&;
+
+    ReceiverIterator(std::vector<const Receiver*> sorted, size_t cur) :
+        sortedReceivers(sorted), cur(cur) {}
+
+    reference operator*() const { return *sortedReceivers[cur]; }
+    pointer operator->() { return sortedReceivers[cur]; }
+
+    ReceiverIterator& operator++() { cur++; return *this; }
+    ReceiverIterator operator++(int) {
+        ReceiverIterator tmp = *this;
+        ++(*this);
+        return tmp;
+    }
+
+    friend bool operator==(const ReceiverIterator& a, const ReceiverIterator& b) {
+        return a.sortedReceivers == b.sortedReceivers && a.cur == b.cur;
+    }
+    friend bool operator!=(const ReceiverIterator& a, const ReceiverIterator& b) {
+        return !(a == b);
+    }
+
+private:
+    std::vector<const Receiver*> sortedReceivers;
+    size_t cur;
+};
+
+
+class UnifiedAddress {
+    std::vector<Receiver> receivers;
+
+    std::vector<const Receiver*> GetSorted() const;
+
+public:
+    UnifiedAddress() {}
+
+    static UnifiedAddress ForSingleReceiver(Receiver receiver) {
+        UnifiedAddress ua;
+        ua.AddReceiver(receiver);
+        return ua;
+    }
+
+    static std::optional<UnifiedAddress> Parse(const KeyConstants& keyConstants, const std::string& str);
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(receivers);
+    }
+
+    /**
+     * Adds the given receiver to this unified address.
+     *
+     * Receivers are stored in the unified address (and its encoding) in the order they
+     * are added. When generating a new UA, call this method in preference order.
+     *
+     * Returns false if adding this receiver would result in an invalid unified address:
+     * - The UA already contains this receiver type.
+     * - The UA would contain both P2PKH and P2SH receivers.
+     */
+    bool AddReceiver(Receiver receiver);
+
+    bool ContainsReceiver(const Receiver& receiver) const;
+
+    const std::vector<Receiver>& GetReceiversAsParsed() const { return receivers; }
+
+    std::set<ReceiverType> GetKnownReceiverTypes() const {
+        std::set<ReceiverType> result;
+        for (const auto& receiver : receivers) {
+            std::visit(match {
+                [&](const libzcash::OrchardRawAddress &zaddr) {
+                    result.insert(ReceiverType::Orchard);
+                },
+                [&](const libzcash::SaplingPaymentAddress &zaddr) {
+                    result.insert(ReceiverType::Sapling);
+                },
+                [&](const CScriptID &zaddr) {
+                    result.insert(ReceiverType::P2SH);
+                },
+                [&](const CKeyID &zaddr) {
+                    result.insert(ReceiverType::P2PKH);
+                },
+                [&](const libzcash::UnknownReceiver &uaddr) {
+                }
+            }, receiver);
+        }
+        return result;
+    }
+
+    ReceiverIterator begin() const {
+        return ReceiverIterator(GetSorted(), 0);
+    }
+    ReceiverIterator end() const {
+        return ReceiverIterator(GetSorted(), receivers.size());
+    }
+    size_t size() const {
+        return receivers.size();
+    }
+
+    std::optional<CKeyID> GetP2PKHReceiver() const;
+
+    std::optional<CScriptID> GetP2SHReceiver() const;
+
+    std::optional<SaplingPaymentAddress> GetSaplingReceiver() const;
+
+    std::optional<OrchardRawAddress> GetOrchardReceiver() const;
+
+    /**
+     * Return the most-preferred receiver from among the receiver types
+     * that we recognize and can use at the given block height.
+     */
+    std::optional<RecipientAddress> GetPreferredRecipientAddress(
+        const Consensus::Params& consensus, int height) const;
+
+    friend inline bool operator==(const UnifiedAddress& a, const UnifiedAddress& b) {
+        return a.receivers == b.receivers;
+    }
+    friend inline bool operator!=(const UnifiedAddress& a, const UnifiedAddress& b) {
+        return a.receivers != b.receivers;
+    }
+    friend inline bool operator<(const UnifiedAddress& a, const UnifiedAddress& b) {
+        return a.receivers < b.receivers;
+    }
+};
+
+class UnifiedFullViewingKeyBuilder;
+
+/**
+ * Wrapper for a zcash_address::unified::Ufvk.
+ */
+class UnifiedFullViewingKey {
+private:
+    std::unique_ptr<UnifiedFullViewingKeyPtr, decltype(&unified_full_viewing_key_free)> inner;
+
+    UnifiedFullViewingKey() :
+        inner(nullptr, unified_full_viewing_key_free) {}
+
+    UnifiedFullViewingKey(UnifiedFullViewingKeyPtr* ptr) :
+        inner(ptr, unified_full_viewing_key_free) {}
+
+    friend class UnifiedFullViewingKeyBuilder;
+public:
+    UnifiedFullViewingKey(UnifiedFullViewingKey&& key) : inner(std::move(key.inner)) {}
+
+    UnifiedFullViewingKey(const UnifiedFullViewingKey& key) :
+        inner(unified_full_viewing_key_clone(key.inner.get()), unified_full_viewing_key_free) {}
+
+    /**
+     * This method should only be used for serialization of unified full
+     * viewing keys that have been generated internally from unified spending
+     * keys by Zcashd.  It is not suitable for use in any case where the
+     * ZcashdUnifiedFullViewingKey value may have been produced by a
+     * potentially-lossy conversion from a UnifiedFullViewingKey value that
+     * originated outside of zcashd.
+     */
+    static UnifiedFullViewingKey FromZcashdUFVK(const ZcashdUnifiedFullViewingKey&);
+
+    static std::optional<UnifiedFullViewingKey> Decode(
+            const std::string& str,
+            const KeyConstants& keyConstants);
+
+    std::string Encode(const KeyConstants& keyConstants) const;
+
+    std::optional<OrchardFullViewingKey> GetOrchardKey() const;
+
+    std::optional<SaplingDiversifiableFullViewingKey> GetSaplingKey() const;
+
+    std::optional<transparent::AccountPubKey> GetTransparentKey() const;
+
+    UFVKId GetKeyID(const KeyConstants& keyConstants) const;
+
+    std::set<ReceiverType> GetKnownReceiverTypes() const {
+        std::set<ReceiverType> result;
+        if (GetTransparentKey().has_value()) {
+            result.insert(ReceiverType::P2PKH);
+        }
+        if (GetSaplingKey().has_value()) {
+            result.insert(ReceiverType::Sapling);
+        }
+        if (GetOrchardKey().has_value()) {
+            result.insert(ReceiverType::Orchard);
+        }
+        return result;
+    }
+
+    UnifiedFullViewingKey& operator=(UnifiedFullViewingKey&& key)
+    {
+        if (this != &key) {
+            inner = std::move(key.inner);
+        }
+        return *this;
+    }
+
+    UnifiedFullViewingKey& operator=(const UnifiedFullViewingKey& key)
+    {
+        if (this != &key) {
+            inner.reset(unified_full_viewing_key_clone(key.inner.get()));
+        }
+        return *this;
+    }
+};
+
+class UnifiedFullViewingKeyBuilder {
+private:
+    std::optional<std::vector<uint8_t>> t_bytes;
+    std::optional<std::vector<uint8_t>> sapling_bytes;
+    std::optional<std::vector<uint8_t>> orchard_bytes;
+public:
+    UnifiedFullViewingKeyBuilder():
+        t_bytes(std::nullopt),
+        sapling_bytes(std::nullopt),
+        orchard_bytes(std::nullopt) {}
+
+    bool AddTransparentKey(const transparent::AccountPubKey&);
+    bool AddSaplingKey(const SaplingDiversifiableFullViewingKey&);
+    bool AddOrchardKey(const OrchardFullViewingKey&);
+
+    std::optional<UnifiedFullViewingKey> build() const;
+};
+
+/** Addresses that can appear in a string encoding. */
+typedef std::variant<
+    CKeyID,
+    CScriptID,
+    SproutPaymentAddress,
+    SaplingPaymentAddress,
+    UnifiedAddress> PaymentAddress;
+/** Viewing keys that can have a string encoding. */
+typedef std::variant<
+    SproutViewingKey,
+    SaplingExtendedFullViewingKey,
+    UnifiedFullViewingKey> ViewingKey;
+/** Spending keys that can have a string encoding. */
+typedef std::variant<
+    SproutSpendingKey,
+    SaplingExtendedSpendingKey> SpendingKey;
+
+class IsShieldedRecipient {
+public:
+    bool operator()(const CKeyID& p2pkh) { return false; }
+    bool operator()(const CScriptID& p2sh) { return false; }
+    bool operator()(const SproutPaymentAddress& addr) { return true; }
+    bool operator()(const SaplingPaymentAddress& addr) { return true; }
+    bool operator()(const OrchardRawAddress& addr) { return true; }
+};
+
+class SelectRecipientAddress {
+    const Consensus::Params& consensus;
+    int height;
+
+public:
+    SelectRecipientAddress(const Consensus::Params& consensus, int height) :
+        consensus(consensus), height(height) {}
+
+    std::optional<RecipientAddress> operator()(const CKeyID& p2pkh) { return p2pkh; }
+    std::optional<RecipientAddress> operator()(const CScriptID& p2sh) { return p2sh; }
+    std::optional<RecipientAddress> operator()(const SproutPaymentAddress& addr) { return std::nullopt; }
+    std::optional<RecipientAddress> operator()(const SaplingPaymentAddress& addr) { return addr; }
+    std::optional<RecipientAddress> operator()(const UnifiedAddress& addr) {
+        return addr.GetPreferredRecipientAddress(consensus, height);
+    }
+};
+
+class AddressInfoFromSpendingKey {
+public:
+    std::pair<std::string, PaymentAddress> operator()(const SproutSpendingKey&) const;
+    std::pair<std::string, PaymentAddress> operator()(const struct SaplingExtendedSpendingKey&) const;
+};
+
+class AddressInfoFromViewingKey {
+private:
+    const KeyConstants& keyConstants;
+
+public:
+    AddressInfoFromViewingKey(const KeyConstants& keyConstants): keyConstants(keyConstants) {}
+    std::pair<std::string, PaymentAddress> operator()(const SproutViewingKey&) const;
+    std::pair<std::string, PaymentAddress> operator()(const struct SaplingExtendedFullViewingKey&) const;
+    std::pair<std::string, PaymentAddress> operator()(const UnifiedFullViewingKey&) const;
+};
+
+} //namespace libzcash
+
+/**
+ * Gets the typecode for the given UA receiver.
+ */
+class TypecodeForReceiver {
+public:
+    TypecodeForReceiver() {}
+
+    uint32_t operator()(const libzcash::OrchardRawAddress &zaddr) const;
+    uint32_t operator()(const libzcash::SaplingPaymentAddress &zaddr) const;
+    uint32_t operator()(const CScriptID &p2sh) const;
+    uint32_t operator()(const CKeyID &p2pkh) const;
+    uint32_t operator()(const libzcash::UnknownReceiver &p2pkh) const;
+};
+
+#endif // ZC_ADDRESS_H_
diff --git a/depend/zcash/src/zcash/History.cpp b/depend/zcash/src/zcash/History.cpp
new file mode 100644
index 000000000..05cd44cb5
--- /dev/null
+++ b/depend/zcash/src/zcash/History.cpp
@@ -0,0 +1,190 @@
+#include "zcash/History.hpp"
+
+#include <stdexcept>
+
+
+#include "consensus/upgrades.h"
+#include "serialize.h"
+#include "streams.h"
+#include "uint256.h"
+#include "librustzcash.h"
+
+namespace libzcash {
+
+void HistoryCache::Extend(const HistoryNode &leaf) {
+    appends[length++] = leaf;
+}
+
+void HistoryCache::Truncate(HistoryIndex newLength) {
+    // Remove any to-be-appended nodes beyond the new length. The array representation is
+    // zero-indexed, and HistoryIndex is unsigned, so we handle the truncate-to-zero case
+    // separately.
+    if (newLength > 0) {
+        for (HistoryIndex idx = length; idx >= newLength; idx--) {
+            appends.erase(idx);
+        }
+    } else {
+        appends.clear();
+    }
+
+    length = newLength;
+    // we track how deep updates go back in the tree, so we could later
+    // update everything starting from `updateDepth`
+    //
+    // imagine we rolled two blocks back and then put another 3 blocks on top
+    // of the rolled back state. In that case `updateDepth` will be H-3, while length
+    // will be H (where H is a final chain height after such operation). So we know that
+    // history entries in the range of H-3..H are expected to be pushed into the database
+    // to replace/append to the persistent nodes there.
+    if (updateDepth > length) updateDepth = length;
+}
+
+HistoryNode NewNode(
+        uint256 subtreeCommitment,
+        uint32_t startTime,
+        uint32_t endTime,
+        uint32_t startTarget,
+        uint32_t endTarget,
+        uint256 startSaplingRoot,
+        uint256 endSaplingRoot,
+        std::optional<uint256> startOrchardRoot,
+        std::optional<uint256> endOrchardRoot,
+        uint256 subtreeTotalWork,
+        uint64_t startHeight,
+        uint64_t endHeight,
+        uint64_t saplingTxCount,
+        std::optional<uint64_t> orchardTxCount
+    )
+{
+    CDataStream buf(SER_DISK, 0);
+    HistoryNode result = {};
+
+    buf << subtreeCommitment;
+    buf << startTime;
+    buf << endTime;
+    buf << startTarget;
+    buf << endTarget;
+    buf << startSaplingRoot;
+    buf << endSaplingRoot;
+    buf << subtreeTotalWork;
+    buf << COMPACTSIZE(startHeight);
+    buf << COMPACTSIZE(endHeight);
+    buf << COMPACTSIZE(saplingTxCount);
+    if (startOrchardRoot) {
+        // If startOrchardRoot is provided, assume all V2 fields are.
+        buf << startOrchardRoot.value();
+        buf << endOrchardRoot.value();
+        buf << COMPACTSIZE(orchardTxCount.value());
+    }
+
+    assert(buf.size() <= NODE_SERIALIZED_LENGTH);
+    std::copy(std::begin(buf), std::end(buf), result.bytes);
+    return result;
+}
+
+HistoryNode NewV1Leaf(
+    uint256 commitment,
+    uint32_t time,
+    uint32_t target,
+    uint256 saplingRoot,
+    uint256 totalWork,
+    uint64_t height,
+    uint64_t saplingTxCount
+) {
+    return NewNode(
+        commitment,
+        time,
+        time,
+        target,
+        target,
+        saplingRoot,
+        saplingRoot,
+        std::nullopt,
+        std::nullopt,
+        totalWork,
+        height,
+        height,
+        saplingTxCount,
+        std::nullopt
+    );
+}
+
+HistoryNode NewV2Leaf(
+    uint256 commitment,
+    uint32_t time,
+    uint32_t target,
+    uint256 saplingRoot,
+    uint256 orchardRoot,
+    uint256 totalWork,
+    uint64_t height,
+    uint64_t saplingTxCount,
+    uint64_t orchardTxCount
+) {
+    return NewNode(
+        commitment,
+        time,
+        time,
+        target,
+        target,
+        saplingRoot,
+        saplingRoot,
+        orchardRoot,
+        orchardRoot,
+        totalWork,
+        height,
+        height,
+        saplingTxCount,
+        orchardTxCount
+    );
+}
+
+HistoryEntry NodeToEntry(const HistoryNode node, uint32_t left, uint32_t right) {
+    CDataStream buf(SER_DISK, 0);
+    HistoryEntry result;
+
+    uint8_t code = 0;
+    buf << code;
+    buf << left;
+    buf << right;
+
+    std::array<unsigned char, NODE_SERIALIZED_LENGTH> tmpMmrNode;
+    std::copy(node.bytes, node.bytes + NODE_SERIALIZED_LENGTH, std::begin(tmpMmrNode));
+
+    buf << tmpMmrNode;
+
+    assert(buf.size() <= ENTRY_SERIALIZED_LENGTH);
+    std::copy(std::begin(buf), std::end(buf), result.bytes);
+
+    return result;
+}
+
+HistoryEntry LeafToEntry(const HistoryNode node) {
+    CDataStream buf(SER_DISK, 0);
+    HistoryEntry result;
+
+    uint8_t code = 1;
+    buf << code;
+
+    std::array<unsigned char, NODE_SERIALIZED_LENGTH> tmpMmrNode;
+    std::copy(node.bytes, node.bytes + NODE_SERIALIZED_LENGTH, std::begin(tmpMmrNode));
+
+    buf << tmpMmrNode;
+
+    assert(buf.size() <= ENTRY_SERIALIZED_LENGTH);
+    std::copy(std::begin(buf), std::end(buf), result.bytes);
+
+    return result;
+}
+
+bool IsV1HistoryTree(uint32_t epochId) {
+    return (
+        epochId == NetworkUpgradeInfo[Consensus::BASE_SPROUT].nBranchId ||
+        epochId == NetworkUpgradeInfo[Consensus::UPGRADE_OVERWINTER].nBranchId ||
+        epochId == NetworkUpgradeInfo[Consensus::UPGRADE_SAPLING].nBranchId ||
+        epochId == NetworkUpgradeInfo[Consensus::UPGRADE_BLOSSOM].nBranchId ||
+        epochId == NetworkUpgradeInfo[Consensus::UPGRADE_HEARTWOOD].nBranchId ||
+        epochId == NetworkUpgradeInfo[Consensus::UPGRADE_CANOPY].nBranchId
+    );
+}
+
+}
diff --git a/depend/zcash/src/zcash/History.hpp b/depend/zcash/src/zcash/History.hpp
new file mode 100644
index 000000000..abfbf7956
--- /dev/null
+++ b/depend/zcash/src/zcash/History.hpp
@@ -0,0 +1,84 @@
+#ifndef ZC_HISTORY_H_
+#define ZC_HISTORY_H_
+
+#include <stdexcept>
+#include <unordered_map>
+#include <boost/foreach.hpp>
+
+#include "serialize.h"
+#include "streams.h"
+#include "uint256.h"
+
+#include <rust/history.h>
+
+#include "librustzcash.h"
+
+namespace libzcash {
+
+typedef uint64_t HistoryIndex;
+
+class HistoryCache {
+public:
+    // updates to the persistent(db) layer
+    std::unordered_map<HistoryIndex, HistoryNode> appends;
+    // current length of the history
+    HistoryIndex length;
+    // how much back into the old state current update state
+    // goes
+    HistoryIndex updateDepth;
+    // current root of the history
+    uint256 root;
+    // current epoch of this history state
+    uint32_t epoch;
+
+    HistoryCache(HistoryIndex initialLength, uint256 initialRoot, uint32_t initialEpoch) :
+        length(initialLength), updateDepth(initialLength), root(initialRoot), epoch(initialEpoch) { };
+
+    HistoryCache() { }
+
+    // Extends current history update by one history node.
+    void Extend(const HistoryNode &leaf);
+
+    // Truncates current history to the new length.
+    void Truncate(HistoryIndex newLength);
+};
+
+// New V1 history node with metadata based on block state.
+HistoryNode NewV1Leaf(
+    uint256 commitment,
+    uint32_t time,
+    uint32_t target,
+    uint256 saplingRoot,
+    uint256 totalWork,
+    uint64_t height,
+    uint64_t saplingTxCount
+);
+
+// New V2 history node with metadata based on block state.
+HistoryNode NewV2Leaf(
+    uint256 commitment,
+    uint32_t time,
+    uint32_t target,
+    uint256 saplingRoot,
+    uint256 orchardRoot,
+    uint256 totalWork,
+    uint64_t height,
+    uint64_t saplingTxCount,
+    uint64_t orchardTxCount
+);
+
+// Convert history node to tree node (with children references)
+HistoryEntry NodeToEntry(const HistoryNode node, uint32_t left, uint32_t right);
+
+// Convert history node to leaf node (end nodes without children)
+HistoryEntry LeafToEntry(const HistoryNode node);
+
+// Returns true if this epoch used the V1 history tree format.
+bool IsV1HistoryTree(uint32_t epochId);
+
+}
+
+typedef libzcash::HistoryCache HistoryCache;
+typedef libzcash::HistoryIndex HistoryIndex;
+
+#endif /* ZC_HISTORY_H_ */
\ No newline at end of file
diff --git a/depend/zcash/src/zcash/IncrementalMerkleTree.cpp b/depend/zcash/src/zcash/IncrementalMerkleTree.cpp
new file mode 100644
index 000000000..4f5c23635
--- /dev/null
+++ b/depend/zcash/src/zcash/IncrementalMerkleTree.cpp
@@ -0,0 +1,1150 @@
+#include <stdexcept>
+
+
+#include "zcash/IncrementalMerkleTree.hpp"
+#include "crypto/sha256.h"
+#include "zcash/util.h"
+#include "librustzcash.h"
+
+namespace libzcash {
+
+PedersenHash PedersenHash::combine(
+    const PedersenHash& a,
+    const PedersenHash& b,
+    size_t depth
+)
+{
+    PedersenHash res = PedersenHash();
+
+    librustzcash_merkle_hash(
+        depth,
+        a.begin(),
+        b.begin(),
+        res.begin()
+    );
+
+    return res;
+}
+
+PedersenHash PedersenHash::uncommitted() {
+    PedersenHash res = PedersenHash();
+
+    librustzcash_tree_uncommitted(res.begin());
+
+    return res;
+}
+
+static const std::array<PedersenHash, 65> pedersen_empty_roots = {
+    uint256(std::vector<unsigned char>{
+        0x01, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x81, 0x7d, 0xe3, 0x6a, 0xb2, 0xd5, 0x7f, 0xeb,
+        0x07, 0x76, 0x34, 0xbc, 0xa7, 0x78, 0x19, 0xc8,
+        0xe0, 0xbd, 0x29, 0x8c, 0x04, 0xf6, 0xfe, 0xd0,
+        0xe6, 0xa8, 0x3c, 0xc1, 0x35, 0x6c, 0xa1, 0x55,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xff, 0xe9, 0xfc, 0x03, 0xf1, 0x8b, 0x17, 0x6c,
+        0x99, 0x88, 0x06, 0x43, 0x9f, 0xf0, 0xbb, 0x8a,
+        0xd1, 0x93, 0xaf, 0xdb, 0x27, 0xb2, 0xcc, 0xbc,
+        0x88, 0x85, 0x69, 0x16, 0xdd, 0x80, 0x4e, 0x34,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xd8, 0x28, 0x33, 0x86, 0xef, 0x2e, 0xf0, 0x7e,
+        0xbd, 0xbb, 0x43, 0x83, 0xc1, 0x2a, 0x73, 0x9a,
+        0x95, 0x3a, 0x4d, 0x6e, 0x0d, 0x6f, 0xb1, 0x13,
+        0x9a, 0x40, 0x36, 0xd6, 0x93, 0xbf, 0xbb, 0x6c,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xe1, 0x10, 0xde, 0x65, 0xc9, 0x07, 0xb9, 0xde,
+        0xa4, 0xae, 0x0b, 0xd8, 0x3a, 0x4b, 0x0a, 0x51,
+        0xbe, 0xa1, 0x75, 0x64, 0x6a, 0x64, 0xc1, 0x2b,
+        0x4c, 0x9f, 0x93, 0x1b, 0x2c, 0xb3, 0x1b, 0x49,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x91, 0x2d, 0x82, 0xb2, 0xc2, 0xbc, 0xa2, 0x31,
+        0xf7, 0x1e, 0xfc, 0xf6, 0x17, 0x37, 0xfb, 0xf0,
+        0xa0, 0x8b, 0xef, 0xa0, 0x41, 0x62, 0x15, 0xae,
+        0xef, 0x53, 0xe8, 0xbb, 0x6d, 0x23, 0x39, 0x0a,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x8a, 0xc9, 0xcf, 0x9c, 0x39, 0x1e, 0x3f, 0xd4,
+        0x28, 0x91, 0xd2, 0x72, 0x38, 0xa8, 0x1a, 0x8a,
+        0x5c, 0x1d, 0x3a, 0x72, 0xb1, 0xbc, 0xbe, 0xa8,
+        0xcf, 0x44, 0xa5, 0x8c, 0xe7, 0x38, 0x96, 0x13,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xd6, 0xc6, 0x39, 0xac, 0x24, 0xb4, 0x6b, 0xd1,
+        0x93, 0x41, 0xc9, 0x1b, 0x13, 0xfd, 0xca, 0xb3,
+        0x15, 0x81, 0xdd, 0xaf, 0x7f, 0x14, 0x11, 0x33,
+        0x6a, 0x27, 0x1f, 0x3d, 0x0a, 0xa5, 0x28, 0x13,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x7b, 0x99, 0xab, 0xdc, 0x37, 0x30, 0x99, 0x1c,
+        0xc9, 0x27, 0x47, 0x27, 0xd7, 0xd8, 0x2d, 0x28,
+        0xcb, 0x79, 0x4e, 0xdb, 0xc7, 0x03, 0x4b, 0x4f,
+        0x00, 0x53, 0xff, 0x7c, 0x4b, 0x68, 0x04, 0x44,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x43, 0xff, 0x54, 0x57, 0xf1, 0x3b, 0x92, 0x6b,
+        0x61, 0xdf, 0x55, 0x2d, 0x4e, 0x40, 0x2e, 0xe6,
+        0xdc, 0x14, 0x63, 0xf9, 0x9a, 0x53, 0x5f, 0x9a,
+        0x71, 0x34, 0x39, 0x26, 0x4d, 0x5b, 0x61, 0x6b,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xba, 0x49, 0xb6, 0x59, 0xfb, 0xd0, 0xb7, 0x33,
+        0x42, 0x11, 0xea, 0x6a, 0x9d, 0x9d, 0xf1, 0x85,
+        0xc7, 0x57, 0xe7, 0x0a, 0xa8, 0x1d, 0xa5, 0x62,
+        0xfb, 0x91, 0x2b, 0x84, 0xf4, 0x9b, 0xce, 0x72,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x47, 0x77, 0xc8, 0x77, 0x6a, 0x3b, 0x1e, 0x69,
+        0xb7, 0x3a, 0x62, 0xfa, 0x70, 0x1f, 0xa4, 0xf7,
+        0xa6, 0x28, 0x2d, 0x9a, 0xee, 0x2c, 0x7a, 0x6b,
+        0x82, 0xe7, 0x93, 0x7d, 0x70, 0x81, 0xc2, 0x3c,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xec, 0x67, 0x71, 0x14, 0xc2, 0x72, 0x06, 0xf5,
+        0xde, 0xbc, 0x1c, 0x1e, 0xd6, 0x6f, 0x95, 0xe2,
+        0xb1, 0x88, 0x5d, 0xa5, 0xb7, 0xbe, 0x3d, 0x73,
+        0x6b, 0x1d, 0xe9, 0x85, 0x79, 0x47, 0x30, 0x48,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x1b, 0x77, 0xda, 0xc4, 0xd2, 0x4f, 0xb7, 0x25,
+        0x8c, 0x3c, 0x52, 0x87, 0x04, 0xc5, 0x94, 0x30,
+        0xb6, 0x30, 0x71, 0x8b, 0xec, 0x48, 0x64, 0x21,
+        0x83, 0x70, 0x21, 0xcf, 0x75, 0xda, 0xb6, 0x51,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xbd, 0x74, 0xb2, 0x5a, 0xac, 0xb9, 0x23, 0x78,
+        0xa8, 0x71, 0xbf, 0x27, 0xd2, 0x25, 0xcf, 0xc2,
+        0x6b, 0xac, 0xa3, 0x44, 0xa1, 0xea, 0x35, 0xfd,
+        0xd9, 0x45, 0x10, 0xf3, 0xd1, 0x57, 0x08, 0x2c,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xd6, 0xac, 0xde, 0xdf, 0x95, 0xf6, 0x08, 0xe0,
+        0x9f, 0xa5, 0x3f, 0xb4, 0x3d, 0xcd, 0x09, 0x90,
+        0x47, 0x57, 0x26, 0xc5, 0x13, 0x12, 0x10, 0xc9,
+        0xe5, 0xca, 0xea, 0xb9, 0x7f, 0x0e, 0x64, 0x2f,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x1e, 0xa6, 0x67, 0x5f, 0x95, 0x51, 0xee, 0xb9,
+        0xdf, 0xaa, 0xa9, 0x24, 0x7b, 0xc9, 0x85, 0x82,
+        0x70, 0xd3, 0xd3, 0xa4, 0xc5, 0xaf, 0xa7, 0x17,
+        0x7a, 0x98, 0x4d, 0x5e, 0xd1, 0xbe, 0x24, 0x51,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x6e, 0xdb, 0x16, 0xd0, 0x19, 0x07, 0xb7, 0x59,
+        0x97, 0x7d, 0x76, 0x50, 0xda, 0xd7, 0xe3, 0xec,
+        0x04, 0x9a, 0xf1, 0xa3, 0xd8, 0x75, 0x38, 0x0b,
+        0x69, 0x7c, 0x86, 0x2c, 0x9e, 0xc5, 0xd5, 0x1c,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xcd, 0x1c, 0x8d, 0xbf, 0x6e, 0x3a, 0xcc, 0x7a,
+        0x80, 0x43, 0x9b, 0xc4, 0x96, 0x2c, 0xf2, 0x5b,
+        0x9d, 0xce, 0x7c, 0x89, 0x6f, 0x3a, 0x5b, 0xd7,
+        0x08, 0x03, 0xfc, 0x5a, 0x0e, 0x33, 0xcf, 0x00,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x6a, 0xca, 0x84, 0x48, 0xd8, 0x26, 0x3e, 0x54,
+        0x7d, 0x5f, 0xf2, 0x95, 0x0e, 0x2e, 0xd3, 0x83,
+        0x9e, 0x99, 0x8d, 0x31, 0xcb, 0xc6, 0xac, 0x9f,
+        0xd5, 0x7b, 0xc6, 0x00, 0x2b, 0x15, 0x92, 0x16,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x8d, 0x5f, 0xa4, 0x3e, 0x5a, 0x10, 0xd1, 0x16,
+        0x05, 0xac, 0x74, 0x30, 0xba, 0x1f, 0x5d, 0x81,
+        0xfb, 0x1b, 0x68, 0xd2, 0x9a, 0x64, 0x04, 0x05,
+        0x76, 0x77, 0x49, 0xe8, 0x41, 0x52, 0x76, 0x73,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x08, 0xee, 0xab, 0x0c, 0x13, 0xab, 0xd6, 0x06,
+        0x9e, 0x63, 0x10, 0x19, 0x7b, 0xf8, 0x0f, 0x9c,
+        0x1e, 0xa6, 0xde, 0x78, 0xfd, 0x19, 0xcb, 0xae,
+        0x24, 0xd4, 0xa5, 0x20, 0xe6, 0xcf, 0x30, 0x23,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x07, 0x69, 0x55, 0x7b, 0xc6, 0x82, 0xb1, 0xbf,
+        0x30, 0x86, 0x46, 0xfd, 0x0b, 0x22, 0xe6, 0x48,
+        0xe8, 0xb9, 0xe9, 0x8f, 0x57, 0xe2, 0x9f, 0x5a,
+        0xf4, 0x0f, 0x6e, 0xdb, 0x83, 0x3e, 0x2c, 0x49,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x4c, 0x69, 0x37, 0xd7, 0x8f, 0x42, 0x68, 0x5f,
+        0x84, 0xb4, 0x3a, 0xd3, 0xb7, 0xb0, 0x0f, 0x81,
+        0x28, 0x56, 0x62, 0xf8, 0x5c, 0x6a, 0x68, 0xef,
+        0x11, 0xd6, 0x2a, 0xd1, 0xa3, 0xee, 0x08, 0x50,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xfe, 0xe0, 0xe5, 0x28, 0x02, 0xcb, 0x0c, 0x46,
+        0xb1, 0xeb, 0x4d, 0x37, 0x6c, 0x62, 0x69, 0x7f,
+        0x47, 0x59, 0xf6, 0xc8, 0x91, 0x7f, 0xa3, 0x52,
+        0x57, 0x12, 0x02, 0xfd, 0x77, 0x8f, 0xd7, 0x12,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x16, 0xd6, 0x25, 0x29, 0x68, 0x97, 0x1a, 0x83,
+        0xda, 0x85, 0x21, 0xd6, 0x53, 0x82, 0xe6, 0x1f,
+        0x01, 0x76, 0x64, 0x6d, 0x77, 0x1c, 0x91, 0x52,
+        0x8e, 0x32, 0x76, 0xee, 0x45, 0x38, 0x3e, 0x4a,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xd2, 0xe1, 0x64, 0x2c, 0x9a, 0x46, 0x22, 0x29,
+        0x28, 0x9e, 0x5b, 0x0e, 0x3b, 0x7f, 0x90, 0x08,
+        0xe0, 0x30, 0x1c, 0xbb, 0x93, 0x38, 0x5e, 0xe0,
+        0xe2, 0x1d, 0xa2, 0x54, 0x50, 0x73, 0xcb, 0x58,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xa5, 0x12, 0x2c, 0x08, 0xff, 0x9c, 0x16, 0x1d,
+        0x9c, 0xa6, 0xfc, 0x46, 0x20, 0x73, 0x39, 0x6c,
+        0x7d, 0x7d, 0x38, 0xe8, 0xee, 0x48, 0xcd, 0xb3,
+        0xbe, 0xa7, 0xe2, 0x23, 0x01, 0x34, 0xed, 0x6a,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x28, 0xe7, 0xb8, 0x41, 0xdc, 0xbc, 0x47, 0xcc,
+        0xeb, 0x69, 0xd7, 0xcb, 0x8d, 0x94, 0x24, 0x5f,
+        0xb7, 0xcb, 0x2b, 0xa3, 0xa7, 0xa6, 0xbc, 0x18,
+        0xf1, 0x3f, 0x94, 0x5f, 0x7d, 0xbd, 0x6e, 0x2a,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xe1, 0xf3, 0x4b, 0x03, 0x4d, 0x4a, 0x3c, 0xd2,
+        0x85, 0x57, 0xe2, 0x90, 0x7e, 0xbf, 0x99, 0x0c,
+        0x91, 0x8f, 0x64, 0xec, 0xb5, 0x0a, 0x94, 0xf0,
+        0x1d, 0x6f, 0xda, 0x5c, 0xa5, 0xc7, 0xef, 0x72,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x12, 0x93, 0x5f, 0x14, 0xb6, 0x76, 0x50, 0x9b,
+        0x81, 0xeb, 0x49, 0xef, 0x25, 0xf3, 0x92, 0x69,
+        0xed, 0x72, 0x30, 0x92, 0x38, 0xb4, 0xc1, 0x45,
+        0x80, 0x35, 0x44, 0xb6, 0x46, 0xdc, 0xa6, 0x2d,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xb2, 0xee, 0xd0, 0x31, 0xd4, 0xd6, 0xa4, 0xf0,
+        0x2a, 0x09, 0x7f, 0x80, 0xb5, 0x4c, 0xc1, 0x54,
+        0x1d, 0x41, 0x63, 0xc6, 0xb6, 0xf5, 0x97, 0x1f,
+        0x88, 0xb6, 0xe4, 0x1d, 0x35, 0xc5, 0x38, 0x14,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xfb, 0xc2, 0xf4, 0x30, 0x0c, 0x01, 0xf0, 0xb7,
+        0x82, 0x0d, 0x00, 0xe3, 0x34, 0x7c, 0x8d, 0xa4,
+        0xee, 0x61, 0x46, 0x74, 0x37, 0x6c, 0xbc, 0x45,
+        0x35, 0x9d, 0xaa, 0x54, 0xf9, 0xb5, 0x49, 0x3e,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x25, 0x2e, 0x67, 0x98, 0x64, 0x5f, 0x5b, 0xf1,
+        0x14, 0xe4, 0xb4, 0xe9, 0x0e, 0x96, 0x18, 0x28,
+        0x61, 0x48, 0x98, 0x40, 0xd9, 0xb4, 0xcc, 0xc4,
+        0xc1, 0xfb, 0x5a, 0x46, 0x99, 0x7c, 0xee, 0x14,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x98, 0xb1, 0x90, 0x42, 0xf1, 0xf7, 0xc7, 0xdd,
+        0x11, 0xec, 0x25, 0xea, 0x66, 0xb6, 0xff, 0x74,
+        0xe0, 0x8c, 0xe1, 0x1d, 0x44, 0x7e, 0xd6, 0xf1,
+        0xbf, 0xe8, 0x7e, 0x11, 0x0e, 0x33, 0x1e, 0x11,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xd4, 0x51, 0x30, 0x47, 0x99, 0x57, 0x2b, 0xa9,
+        0xf4, 0x2c, 0x4d, 0xab, 0x6b, 0x07, 0xc7, 0x03,
+        0xbd, 0x2c, 0x12, 0x3a, 0xb9, 0xd6, 0x0f, 0x2a,
+        0x60, 0xf9, 0x95, 0x58, 0x54, 0x91, 0x0b, 0x6a,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x3e, 0xcd, 0x5f, 0x27, 0xac, 0xf0, 0x1b, 0xd3,
+        0x7a, 0x33, 0xe4, 0x51, 0x78, 0x67, 0xef, 0x76,
+        0x47, 0x4c, 0xd8, 0x3f, 0xb3, 0x1c, 0x92, 0x08,
+        0xdc, 0xef, 0x2e, 0xed, 0xce, 0xf3, 0x6c, 0x72,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x26, 0xc3, 0x7d, 0xa6, 0x78, 0x94, 0xa1, 0x3d,
+        0xf8, 0xaa, 0x48, 0x78, 0xd2, 0x51, 0x4a, 0x42,
+        0x12, 0x57, 0x3b, 0x73, 0xec, 0xca, 0xab, 0x16,
+        0xfe, 0x4f, 0xa6, 0x60, 0xe8, 0xfe, 0x27, 0x07,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xb5, 0x45, 0xef, 0x34, 0x48, 0x5e, 0xed, 0x30,
+        0xd4, 0x2b, 0x2c, 0x29, 0x5a, 0x4a, 0x5b, 0x68,
+        0x0d, 0xe8, 0xa9, 0xd5, 0xe3, 0x83, 0x45, 0x78,
+        0x24, 0x62, 0xc0, 0x4f, 0x09, 0xdc, 0x68, 0x51,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x77, 0xfd, 0x20, 0xb3, 0x00, 0x94, 0x67, 0x65,
+        0xa8, 0x7f, 0x24, 0xbd, 0x04, 0x50, 0x73, 0x72,
+        0x9c, 0xbd, 0x7b, 0x66, 0xeb, 0x8f, 0xa1, 0x40,
+        0xb5, 0x83, 0xfa, 0xa9, 0xd1, 0x42, 0x58, 0x01,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xcb, 0xaa, 0x57, 0x6b, 0x17, 0x99, 0xb5, 0x8f,
+        0xf3, 0xa6, 0xde, 0xcb, 0xba, 0x91, 0x9b, 0x0b,
+        0x68, 0xd7, 0xc8, 0x93, 0xe4, 0x6f, 0xde, 0x99,
+        0x87, 0x68, 0xe8, 0x7e, 0x35, 0x0a, 0x07, 0x25,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x45, 0xfe, 0x81, 0xb1, 0x8c, 0xa3, 0x00, 0x74,
+        0xd0, 0x12, 0x0d, 0x2b, 0x1a, 0x0d, 0x10, 0xb3,
+        0xa0, 0x50, 0x93, 0x35, 0x12, 0xdb, 0x8e, 0xe3,
+        0x4e, 0x52, 0x47, 0x3d, 0x4f, 0x08, 0xa2, 0x67,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x0e, 0x60, 0xa1, 0xf0, 0x12, 0x1f, 0x59, 0x1e,
+        0x55, 0x1d, 0x3e, 0xd1, 0x86, 0x5b, 0x50, 0xa7,
+        0x5d, 0x7c, 0xcf, 0xf1, 0x28, 0x9d, 0xf7, 0xc4,
+        0x4d, 0xd4, 0x65, 0xa5, 0x43, 0x17, 0xf5, 0x6a,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xce, 0xdf, 0xb1, 0x84, 0xdd, 0x92, 0xa0, 0xcb,
+        0xfc, 0x11, 0xe8, 0xbe, 0x69, 0x7b, 0x47, 0x69,
+        0x88, 0xed, 0x5f, 0x39, 0x36, 0x9a, 0xbd, 0xd9,
+        0x0c, 0x61, 0x54, 0x49, 0x88, 0x60, 0x1c, 0x0d,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xf3, 0x62, 0x68, 0x66, 0x12, 0x64, 0x9a, 0x31,
+        0x3b, 0xa4, 0x64, 0x43, 0x7a, 0x0c, 0xad, 0x0e,
+        0x7e, 0x3d, 0x7e, 0x1b, 0x4b, 0x37, 0x43, 0xf9,
+        0x0e, 0x05, 0xa2, 0x10, 0x0a, 0x49, 0x5f, 0x42,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x7d, 0xea, 0xe5, 0xf3, 0xbb, 0xde, 0xff, 0xd3,
+        0xf8, 0x52, 0x71, 0xa0, 0x8b, 0x5e, 0xc3, 0x1f,
+        0x16, 0xf9, 0x37, 0x96, 0x4a, 0xe7, 0x08, 0xfd,
+        0xff, 0x7c, 0x13, 0xe5, 0xa4, 0xf3, 0xdf, 0x6b,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x40, 0xcc, 0xf0, 0xfc, 0x1e, 0xab, 0x6d, 0x85,
+        0x02, 0xbd, 0x93, 0xdc, 0x31, 0x34, 0x2d, 0xfd,
+        0x57, 0xdf, 0x5b, 0xbb, 0x5d, 0x70, 0xa1, 0xbf,
+        0x6b, 0x92, 0xef, 0xc6, 0x1e, 0xc9, 0xa2, 0x58,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xd7, 0x80, 0x25, 0x49, 0x1f, 0x1b, 0xca, 0x85,
+        0x07, 0xf6, 0x4f, 0x25, 0x87, 0x2d, 0xd0, 0x23,
+        0x88, 0x47, 0x9a, 0x1a, 0x22, 0x51, 0x26, 0xe4,
+        0x0d, 0x2f, 0xe4, 0x18, 0xb9, 0x8e, 0x0e, 0x2c,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x0d, 0xb7, 0x29, 0x46, 0x85, 0xc8, 0xa0, 0x72,
+        0x5f, 0x15, 0x84, 0x6e, 0xa5, 0x89, 0x9e, 0xa0,
+        0xe9, 0x86, 0xc2, 0x70, 0x7b, 0xd7, 0xb4, 0x12,
+        0x95, 0x44, 0x12, 0xf2, 0x6a, 0xbf, 0x55, 0x0a,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xb7, 0xe2, 0x90, 0xbe, 0x95, 0x55, 0xcf, 0x75,
+        0x54, 0x86, 0x50, 0xda, 0x6d, 0x47, 0xc8, 0x93,
+        0xae, 0xf7, 0xf8, 0xc6, 0xdd, 0x27, 0x35, 0x49,
+        0x94, 0x95, 0xf6, 0x36, 0x59, 0x0d, 0xae, 0x0a,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x2d, 0xd2, 0x53, 0x2a, 0x85, 0x8c, 0x30, 0x01,
+        0x45, 0xa6, 0x5e, 0x35, 0x1f, 0x91, 0xbe, 0x6a,
+        0xfe, 0xab, 0x59, 0x7c, 0x41, 0xef, 0x07, 0x3f,
+        0x50, 0xb6, 0x22, 0xd5, 0x86, 0xff, 0x59, 0x27,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x97, 0x2f, 0x0c, 0x5c, 0x6f, 0x9a, 0xeb, 0x0e,
+        0x38, 0xbf, 0x83, 0x19, 0xf3, 0xa5, 0xfc, 0xdc,
+        0x8f, 0xd8, 0x78, 0x2e, 0x41, 0x88, 0x73, 0x0c,
+        0xd0, 0x82, 0xd9, 0xba, 0xbc, 0x58, 0x98, 0x51,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x00, 0x1e, 0x57, 0x7b, 0x0f, 0x43, 0x90, 0x18,
+        0x2b, 0x4a, 0xe4, 0x3d, 0x32, 0x9b, 0x3a, 0xa8,
+        0x83, 0x5d, 0xae, 0x1b, 0xb7, 0x9e, 0x60, 0x4b,
+        0x7d, 0x2d, 0xa0, 0xe9, 0x0d, 0x06, 0x09, 0x29,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xaa, 0x6e, 0x70, 0xa9, 0x1e, 0xbc, 0x54, 0xee,
+        0xfc, 0xe5, 0xff, 0xd5, 0xb6, 0x75, 0xda, 0xf3,
+        0xf1, 0xd9, 0x40, 0xa8, 0x45, 0x1f, 0xcb, 0x01,
+        0x08, 0x1f, 0xa9, 0xd4, 0xf2, 0x62, 0x43, 0x6f,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xd7, 0x70, 0x38, 0xbf, 0x67, 0xe6, 0x31, 0x75,
+        0x29, 0x40, 0x23, 0x12, 0x51, 0xd7, 0xfe, 0x85,
+        0xaf, 0x52, 0xdb, 0xdd, 0x6a, 0xab, 0x37, 0xc7,
+        0xa5, 0xec, 0x32, 0xb6, 0x5f, 0xe6, 0xde, 0x03,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xd2, 0x27, 0xa1, 0x7a, 0x7e, 0x0c, 0xf9, 0x6d,
+        0xce, 0xdd, 0x9f, 0xc7, 0xbc, 0xe4, 0x3c, 0x6c,
+        0x1d, 0x66, 0xba, 0xdd, 0x75, 0x43, 0xa8, 0x87,
+        0xc8, 0x65, 0x6c, 0x54, 0x7e, 0xcf, 0xb2, 0x4f,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x70, 0xe8, 0xa5, 0x21, 0x95, 0x15, 0x83, 0xe5,
+        0x3f, 0xc0, 0x58, 0x5c, 0x70, 0x7e, 0xce, 0xda,
+        0x89, 0xb7, 0xa7, 0xd1, 0xaf, 0x41, 0xd1, 0xa0,
+        0x15, 0xd7, 0x97, 0xfa, 0x76, 0xc0, 0xf5, 0x69,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xe4, 0x85, 0xa9, 0x68, 0x55, 0xe8, 0x72, 0xfc,
+        0x50, 0x90, 0x15, 0x0e, 0x2c, 0xd2, 0x4e, 0x10,
+        0x59, 0x1d, 0x35, 0x16, 0x6e, 0xb0, 0xeb, 0x30,
+        0xfc, 0xdf, 0xac, 0x93, 0xb0, 0x1d, 0x28, 0x1c,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xe4, 0xa1, 0x9f, 0xeb, 0xdf, 0x2a, 0x86, 0x89,
+        0x6e, 0x41, 0xf2, 0xce, 0xdc, 0xf2, 0xae, 0x58,
+        0x46, 0x71, 0x80, 0x2e, 0x6a, 0x46, 0x7e, 0x84,
+        0x39, 0xca, 0xb5, 0xd6, 0x18, 0x43, 0x41, 0x6b,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xe9, 0x27, 0x83, 0x88, 0x47, 0x80, 0x6a, 0x43,
+        0xbd, 0x6c, 0x60, 0x88, 0xe3, 0x9f, 0x65, 0xb8,
+        0xb3, 0xe5, 0x8b, 0x2d, 0xb5, 0xf7, 0xad, 0x56,
+        0x43, 0xd9, 0x1e, 0x06, 0x59, 0xa2, 0x8a, 0x2a,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x0b, 0xd3, 0xa8, 0x18, 0xe8, 0x3f, 0x9c, 0xd2,
+        0xff, 0x4f, 0x62, 0x01, 0x1a, 0x51, 0x01, 0x76,
+        0xac, 0x32, 0xf5, 0x44, 0x8e, 0x6e, 0x15, 0x45,
+        0x15, 0x04, 0x3c, 0x59, 0x26, 0xd5, 0x1c, 0x6f,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xce, 0x41, 0x34, 0x45, 0xe0, 0x37, 0x90, 0x49,
+        0x8f, 0xe7, 0x2d, 0x8e, 0x01, 0x91, 0x5e, 0x7f,
+        0xf1, 0x20, 0xae, 0x35, 0xb3, 0xb5, 0x90, 0xd2,
+        0x1b, 0x7f, 0x74, 0xde, 0xe1, 0x83, 0x0f, 0x0d,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x60, 0x0e, 0x6f, 0x93, 0xe7, 0x3d, 0x7a, 0xbd,
+        0x4e, 0xe0, 0xa6, 0x5c, 0xb1, 0xb1, 0x9a, 0xa3,
+        0xec, 0xc5, 0x25, 0x68, 0x9d, 0xbf, 0x17, 0x77,
+        0x96, 0x58, 0x74, 0x1b, 0x95, 0xc1, 0x5a, 0x55,
+    }),
+};
+
+PedersenHash PedersenHash::EmptyRoot(size_t depth) {
+    return pedersen_empty_roots.at(depth);
+}
+
+SHA256Compress SHA256Compress::combine(
+    const SHA256Compress& a,
+    const SHA256Compress& b,
+    size_t depth
+)
+{
+    SHA256Compress res = SHA256Compress();
+
+    CSHA256 hasher;
+    hasher.Write(a.begin(), 32);
+    hasher.Write(b.begin(), 32);
+    hasher.FinalizeNoPadding(res.begin());
+
+    return res;
+}
+
+static const std::array<SHA256Compress, 66> sha256_empty_roots = {
+    uint256(std::vector<unsigned char>{
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+        0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xda, 0x56, 0x98, 0xbe, 0x17, 0xb9, 0xb4, 0x69,
+        0x62, 0x33, 0x57, 0x99, 0x77, 0x9f, 0xbe, 0xca,
+        0x8c, 0xe5, 0xd4, 0x91, 0xc0, 0xd2, 0x62, 0x43,
+        0xba, 0xfe, 0xf9, 0xea, 0x18, 0x37, 0xa9, 0xd8,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xdc, 0x76, 0x6f, 0xab, 0x49, 0x2c, 0xcf, 0x3d,
+        0x1e, 0x49, 0xd4, 0xf3, 0x74, 0xb5, 0x23, 0x5f,
+        0xa5, 0x65, 0x06, 0xaa, 0xc2, 0x22, 0x4d, 0x39,
+        0xf9, 0x43, 0xfc, 0xd4, 0x92, 0x02, 0x97, 0x4c,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x3f, 0x0a, 0x40, 0x61, 0x81, 0x10, 0x59, 0x68,
+        0xfd, 0xae, 0xe3, 0x06, 0x79, 0xe3, 0x27, 0x3c,
+        0x66, 0xb7, 0x2b, 0xf9, 0xa7, 0xf5, 0xde, 0xbb,
+        0xf3, 0xb5, 0xa0, 0xa2, 0x6e, 0x35, 0x9f, 0x92,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x26, 0xb0, 0x05, 0x26, 0x94, 0xfc, 0x42, 0xfd,
+        0xff, 0x93, 0xe6, 0xfb, 0x5a, 0x71, 0xd3, 0x8c,
+        0x3d, 0xd7, 0xdc, 0x5b, 0x6a, 0xd7, 0x10, 0xeb,
+        0x04, 0x8c, 0x66, 0x02, 0x33, 0x13, 0x7f, 0xab,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x01, 0x09, 0xec, 0xc0, 0x72, 0x26, 0x59, 0xff,
+        0x83, 0x45, 0x0b, 0x8f, 0x7b, 0x88, 0x46, 0xe6,
+        0x7b, 0x28, 0x59, 0xf3, 0x3c, 0x30, 0xd9, 0xb7,
+        0xac, 0xd5, 0xbf, 0x39, 0xca, 0xe5, 0x4e, 0x31,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x3f, 0x90, 0x9b, 0x8c, 0xe3, 0xd7, 0xff, 0xd8,
+        0xa5, 0xb3, 0x09, 0x08, 0xf6, 0x05, 0xa0, 0x3b,
+        0x0d, 0xb8, 0x51, 0x69, 0x55, 0x8d, 0xdc, 0x1d,
+        0xa7, 0xbb, 0xbc, 0xc9, 0xb0, 0x9f, 0xd3, 0x25,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x40, 0x46, 0x0f, 0xa6, 0xbc, 0x69, 0x2a, 0x06,
+        0xf4, 0x75, 0x21, 0xa6, 0x72, 0x5a, 0x54, 0x7c,
+        0x02, 0x8a, 0x6a, 0x24, 0x0d, 0x84, 0x09, 0xf1,
+        0x65, 0xe6, 0x3c, 0xb5, 0x4d, 0xa2, 0xd2, 0x3f,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x8c, 0x08, 0x56, 0x74, 0x24, 0x9b, 0x43, 0xda,
+        0x1b, 0x9a, 0x31, 0xa0, 0xe8, 0x20, 0xe8, 0x1e,
+        0x75, 0xf3, 0x42, 0x80, 0x7b, 0x03, 0xb6, 0xb9,
+        0xe6, 0x49, 0x83, 0x21, 0x7b, 0xc2, 0xb3, 0x8e,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xa0, 0x83, 0x45, 0x0c, 0x1b, 0xa2, 0xa3, 0xa7,
+        0xbe, 0x76, 0xfa, 0xd9, 0xd1, 0x3b, 0xc3, 0x7b,
+        0xe4, 0xbf, 0x83, 0xbd, 0x3e, 0x59, 0xfc, 0x37,
+        0x5a, 0x36, 0xba, 0x62, 0xdc, 0x62, 0x02, 0x98,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x1d, 0xdd, 0xda, 0xbc, 0x2c, 0xaa, 0x2d, 0xe9,
+        0xef, 0xf9, 0xe1, 0x8c, 0x8c, 0x5a, 0x39, 0x40,
+        0x6d, 0x79, 0x36, 0xe8, 0x89, 0xbc, 0x16, 0xcf,
+        0xab, 0xb1, 0x44, 0xf5, 0xc0, 0x02, 0x26, 0x82,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xc2, 0x2d, 0x8f, 0x0b, 0x5e, 0x40, 0x56, 0xe5,
+        0xf3, 0x18, 0xba, 0x22, 0x09, 0x1c, 0xc0, 0x7d,
+        0xb5, 0x69, 0x4f, 0xbe, 0xb5, 0xe8, 0x7e, 0xf0,
+        0xd7, 0xe2, 0xc5, 0x7c, 0xa3, 0x52, 0x35, 0x9e,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x89, 0xa4, 0x34, 0xae, 0x1f, 0xeb, 0xd7, 0x68,
+        0x7e, 0xce, 0xea, 0x21, 0xd0, 0x7f, 0x20, 0xa2,
+        0x51, 0x24, 0x49, 0xd0, 0x8c, 0xe2, 0xee, 0xe5,
+        0x58, 0x71, 0xcd, 0xb9, 0xd4, 0x6c, 0x12, 0x33,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x73, 0x33, 0xdb, 0xff, 0xbd, 0x11, 0xf0, 0x92,
+        0x47, 0xa2, 0xb3, 0x3a, 0x01, 0x3e, 0xc4, 0xc4,
+        0x34, 0x20, 0x29, 0xd8, 0x51, 0xe2, 0x2b, 0xa4,
+        0x85, 0xd4, 0x46, 0x18, 0x51, 0x37, 0x0c, 0x15,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x5d, 0xad, 0x84, 0x4a, 0xb9, 0x46, 0x6b, 0x70,
+        0xf7, 0x45, 0x13, 0x71, 0x95, 0xca, 0x22, 0x1b,
+        0x48, 0xf3, 0x46, 0xab, 0xd1, 0x45, 0xfb, 0x5e,
+        0xfc, 0x23, 0xa8, 0xb4, 0xba, 0x50, 0x80, 0x22,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x50, 0x7e, 0x0d, 0xae, 0x81, 0xcb, 0xfb, 0xe4,
+        0x57, 0xfd, 0x37, 0x0e, 0xf1, 0xca, 0x42, 0x01,
+        0xc2, 0xb6, 0x40, 0x10, 0x83, 0xdd, 0xab, 0x44,
+        0x0e, 0x4a, 0x03, 0x8d, 0xc1, 0xe3, 0x58, 0xc4,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xbd, 0xcd, 0xb3, 0x29, 0x31, 0x88, 0xc9, 0x80,
+        0x7d, 0x80, 0x82, 0x67, 0x01, 0x86, 0x84, 0xcf,
+        0xec, 0xe0, 0x7a, 0xc3, 0x5a, 0x42, 0xc0, 0x0f,
+        0x2c, 0x79, 0xb4, 0x00, 0x38, 0x25, 0x30, 0x5d,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xba, 0xb5, 0x80, 0x09, 0x72, 0xa1, 0x6c, 0x2c,
+        0x22, 0x53, 0x0c, 0x66, 0x06, 0x6d, 0x0a, 0x58,
+        0x67, 0xe9, 0x87, 0xbe, 0xd2, 0x1a, 0x6d, 0x5a,
+        0x45, 0x0b, 0x68, 0x3c, 0xf1, 0xcf, 0xd7, 0x09,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x11, 0xaa, 0x0b, 0x4a, 0xd2, 0x9b, 0x13, 0xb0,
+        0x57, 0xa3, 0x16, 0x19, 0xd6, 0x50, 0x0d, 0x63,
+        0x6c, 0xd7, 0x35, 0xcd, 0xd0, 0x7d, 0x81, 0x1e,
+        0xa2, 0x65, 0xec, 0x4b, 0xcb, 0xbb, 0xd0, 0x58,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x51, 0x45, 0xb1, 0xb0, 0x55, 0xc2, 0xdf, 0x02,
+        0xb9, 0x56, 0x75, 0xe3, 0x79, 0x7b, 0x91, 0xde,
+        0x1b, 0x84, 0x6d, 0x25, 0x00, 0x3c, 0x0a, 0x80,
+        0x3d, 0x08, 0x90, 0x07, 0x28, 0xf2, 0xcd, 0x6a,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x03, 0x23, 0xf2, 0x85, 0x0b, 0xf3, 0x44, 0x4f,
+        0x4b, 0x4c, 0x5c, 0x09, 0xa6, 0x05, 0x7e, 0xc7,
+        0x16, 0x91, 0x90, 0xf4, 0x5a, 0xcb, 0x9e, 0x46,
+        0x98, 0x4a, 0xb3, 0xdf, 0xce, 0xc4, 0xf0, 0x6a,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x67, 0x15, 0x46, 0xe2, 0x6b, 0x1d, 0xa1, 0xaf,
+        0x75, 0x45, 0x31, 0xe2, 0x6d, 0x8a, 0x6a, 0x51,
+        0x07, 0x3a, 0x57, 0xdd, 0xd7, 0x2d, 0xc4, 0x72,
+        0xef, 0xb4, 0x3f, 0xcb, 0x25, 0x7c, 0xff, 0xff,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xbb, 0x23, 0xa9, 0xbb, 0xa5, 0x6d, 0xe5, 0x7c,
+        0xb2, 0x84, 0xb0, 0xd2, 0xb0, 0x1c, 0x64, 0x2c,
+        0xf7, 0x9c, 0x9a, 0x55, 0x63, 0xf0, 0x06, 0x7a,
+        0x21, 0x29, 0x24, 0x12, 0x14, 0x5b, 0xd7, 0x8a,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xf3, 0x0c, 0xc8, 0x36, 0xb9, 0xf7, 0x1b, 0x4e,
+        0x7e, 0xe3, 0xc7, 0x2b, 0x1f, 0xd2, 0x53, 0x26,
+        0x8a, 0xf9, 0xa2, 0x7e, 0x9d, 0x72, 0x91, 0xa2,
+        0x3d, 0x02, 0x82, 0x1b, 0x21, 0xdd, 0xfd, 0x16,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x58, 0xa2, 0x75, 0x3d, 0xad, 0xe1, 0x03, 0xce,
+        0xcb, 0xcd, 0xa5, 0x0b, 0x5e, 0xbf, 0xce, 0x31,
+        0xe1, 0x2d, 0x41, 0xd5, 0x84, 0x1d, 0xcc, 0x95,
+        0x62, 0x0f, 0x7b, 0x3d, 0x50, 0xa1, 0xb9, 0xa1,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x92, 0x5e, 0x6d, 0x47, 0x4a, 0x5d, 0x8d, 0x30,
+        0x04, 0xf2, 0x9d, 0xa0, 0xdd, 0x78, 0xd3, 0x0a,
+        0xe3, 0x82, 0x4c, 0xe7, 0x9d, 0xfe, 0x49, 0x34,
+        0xbb, 0x29, 0xec, 0x3a, 0xfa, 0xf3, 0xd5, 0x21,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x08, 0xf2, 0x79, 0x61, 0x86, 0x16, 0xbc, 0xdd,
+        0x4e, 0xad, 0xc9, 0xc7, 0xa9, 0x06, 0x26, 0x91,
+        0xa5, 0x9b, 0x43, 0xb0, 0x7e, 0x2c, 0x1e, 0x23,
+        0x7f, 0x17, 0xbd, 0x18, 0x9c, 0xd6, 0xa8, 0xfe,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xc9, 0x2b, 0x32, 0xdb, 0x42, 0xf4, 0x2e, 0x2b,
+        0xf0, 0xa5, 0x9d, 0xf9, 0x05, 0x5b, 0xe5, 0xc6,
+        0x69, 0xd3, 0x24, 0x2d, 0xf4, 0x53, 0x57, 0x65,
+        0x9b, 0x75, 0xae, 0x2c, 0x27, 0xa7, 0x6f, 0x50,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xc0, 0xdb, 0x2a, 0x74, 0x99, 0x8c, 0x50, 0xeb,
+        0x7b, 0xa6, 0x53, 0x4f, 0x6d, 0x41, 0x0e, 0xfc,
+        0x27, 0xc4, 0xbb, 0x88, 0xac, 0xb0, 0x22, 0x2c,
+        0x79, 0x06, 0xea, 0x28, 0xa3, 0x27, 0xb5, 0x11,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xd7, 0xc6, 0x12, 0xc8, 0x17, 0x79, 0x31, 0x91,
+        0xa1, 0xe6, 0x86, 0x52, 0x12, 0x18, 0x76, 0xd6,
+        0xb3, 0xbd, 0xe4, 0x0f, 0x4f, 0xa5, 0x2b, 0xc3,
+        0x14, 0x14, 0x5c, 0xe6, 0xe5, 0xcd, 0xd2, 0x59,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xb2, 0x23, 0x70, 0x10, 0x6c, 0x67, 0xa1, 0x72,
+        0x09, 0xf6, 0x13, 0x0b, 0xc0, 0x9f, 0x73, 0x5d,
+        0x83, 0xaa, 0x2c, 0x04, 0xfc, 0x4f, 0xe7, 0x2e,
+        0xa5, 0xd8, 0x0b, 0x21, 0x67, 0x23, 0xe7, 0xce,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x9f, 0x67, 0xd5, 0xf6, 0x64, 0x66, 0x4c, 0x90,
+        0x19, 0x40, 0xee, 0xe3, 0xd0, 0x2d, 0xd5, 0xb3,
+        0xe4, 0xb9, 0x2e, 0x7b, 0x42, 0x82, 0x0c, 0x42,
+        0xfc, 0x51, 0x59, 0xe9, 0x1b, 0x41, 0x17, 0x2a,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xac, 0x58, 0xcd, 0x13, 0x88, 0xfe, 0xc2, 0x90,
+        0xd3, 0x98, 0xf1, 0x94, 0x4b, 0x56, 0x44, 0x49,
+        0xa6, 0x3c, 0x81, 0x58, 0x80, 0x56, 0x6b, 0xd1,
+        0xd1, 0x89, 0xf7, 0x83, 0x9e, 0x3b, 0x0c, 0x8c,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x56, 0x98, 0xea, 0xe7, 0xc8, 0x51, 0x5e, 0xd0,
+        0x5a, 0x70, 0x33, 0x9b, 0xdf, 0x7c, 0x10, 0x28,
+        0xe7, 0xac, 0xca, 0x13, 0xa4, 0xfa, 0x97, 0xd9,
+        0x53, 0x8f, 0x01, 0xac, 0x8d, 0x88, 0x9a, 0xe3,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x2d, 0x49, 0x95, 0x77, 0x0a, 0x76, 0xfb, 0x93,
+        0x31, 0x4c, 0xa7, 0x4b, 0x35, 0x24, 0xea, 0x1d,
+        0xb5, 0x68, 0x8a, 0xd0, 0xa7, 0x61, 0x83, 0xea,
+        0x17, 0x20, 0x4a, 0x8f, 0x02, 0x4a, 0x9f, 0x3b,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x5e, 0x89, 0x92, 0xc1, 0xb0, 0x72, 0xc1, 0x6e,
+        0x9e, 0x28, 0xa8, 0x53, 0x58, 0xfb, 0x5f, 0xb6,
+        0x90, 0x1a, 0x81, 0x58, 0x77, 0x66, 0xda, 0xdb,
+        0x7a, 0xa0, 0xb9, 0x73, 0xde, 0xd2, 0xf2, 0x64,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xe9, 0x5d, 0xb7, 0x1e, 0x1f, 0x72, 0x91, 0xba,
+        0x54, 0x99, 0x46, 0x1b, 0xc7, 0x15, 0x20, 0x3e,
+        0x29, 0xb8, 0x4b, 0xfa, 0x42, 0x83, 0xe3, 0xbb,
+        0x7f, 0x47, 0x0a, 0x15, 0xd0, 0xe1, 0x58, 0x4e,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x41, 0xf0, 0x78, 0xbd, 0x18, 0x24, 0xc8, 0xa4,
+        0xb7, 0x19, 0x64, 0xf3, 0x94, 0xaa, 0x59, 0x50,
+        0x84, 0xd8, 0xeb, 0x17, 0xb9, 0x7a, 0x36, 0x30,
+        0x43, 0x3a, 0xf7, 0x0d, 0x10, 0xe0, 0xef, 0xf6,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xa1, 0x91, 0x3f, 0xe6, 0xb2, 0x01, 0x32, 0x31,
+        0x2f, 0x8c, 0x1f, 0x00, 0xdd, 0xd6, 0x3c, 0xec,
+        0x7a, 0x03, 0xf5, 0xf1, 0xd7, 0xd8, 0x34, 0x92,
+        0xfa, 0x28, 0x4c, 0x0b, 0x5d, 0x63, 0x20, 0xb0,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xba, 0x94, 0x40, 0xc4, 0xdb, 0xfc, 0xf5, 0x5c,
+        0xeb, 0x60, 0x5a, 0x5b, 0x89, 0x90, 0xfc, 0x11,
+        0xf8, 0xef, 0x22, 0x87, 0x0d, 0x8d, 0x12, 0xe1,
+        0x30, 0xf9, 0x86, 0x49, 0x1e, 0xae, 0x84, 0xb3,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x49, 0xdb, 0x2d, 0x5e, 0x22, 0xb8, 0x01, 0x5c,
+        0xae, 0x48, 0x10, 0xd7, 0x5e, 0x54, 0x01, 0x4c,
+        0x54, 0x69, 0x86, 0x27, 0x38, 0xe1, 0x61, 0xec,
+        0x96, 0xec, 0x20, 0x21, 0x87, 0x18, 0x82, 0x8a,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xd4, 0x85, 0x1f, 0xb8, 0x43, 0x1e, 0xdf, 0xbb,
+        0x8b, 0x1e, 0x85, 0xad, 0xa6, 0x89, 0x59, 0x67,
+        0xc2, 0xda, 0xc8, 0x7d, 0xf3, 0x44, 0x99, 0x2a,
+        0x05, 0xfa, 0xf1, 0xec, 0xf8, 0x36, 0xee, 0xc9,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xe4, 0xab, 0x9f, 0x44, 0x70, 0xf0, 0x0c, 0xd1,
+        0x96, 0xd4, 0x7c, 0x75, 0xc8, 0x2e, 0x7a, 0xda,
+        0xf0, 0x6f, 0xe1, 0x7e, 0x04, 0x2e, 0x39, 0x53,
+        0xd9, 0x3b, 0xb5, 0xd5, 0x6d, 0x8c, 0xd8, 0xfb,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x7e, 0x43, 0x20, 0x43, 0x48, 0x49, 0xec, 0xb3,
+        0x57, 0xf1, 0xaf, 0xaa, 0xba, 0x21, 0xa5, 0x44,
+        0x00, 0xef, 0x2d, 0x11, 0xcf, 0xf8, 0x3b, 0x93,
+        0x7d, 0x87, 0xfd, 0xaf, 0xa4, 0x9f, 0x81, 0x99,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x02, 0x0a, 0xdc, 0x98, 0xd9, 0x6c, 0xfb, 0xbc,
+        0xca, 0x15, 0xfc, 0x3a, 0xa0, 0x37, 0x60, 0xed,
+        0x28, 0x66, 0x86, 0xc3, 0x5b, 0x5d, 0x92, 0xc7,
+        0xcb, 0x64, 0xa9, 0x99, 0xb3, 0x94, 0xa8, 0x54,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x3a, 0x26, 0xb2, 0x9f, 0xe1, 0xac, 0xfd, 0xd6,
+        0xc6, 0xa1, 0x51, 0xbc, 0xc3, 0xdb, 0xcb, 0x95,
+        0xa1, 0x0e, 0xbe, 0x2f, 0x05, 0x53, 0xf8, 0x07,
+        0x79, 0x56, 0x9b, 0x67, 0xb7, 0x24, 0x4e, 0x77,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xec, 0x2d, 0x09, 0x86, 0xe6, 0xa0, 0xdd, 0xf4,
+        0x38, 0x97, 0xb2, 0xd4, 0xf2, 0x3b, 0xb0, 0x34,
+        0xf5, 0x38, 0xff, 0xe0, 0x08, 0x27, 0xf3, 0x10,
+        0xdc, 0x49, 0x63, 0xf3, 0x26, 0x7f, 0x0b, 0xfb,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xd4, 0x80, 0x73, 0xf8, 0x81, 0x9f, 0x81, 0xf0,
+        0x35, 0x8e, 0x3f, 0xc3, 0x5a, 0x04, 0x7c, 0xc7,
+        0x40, 0x82, 0xae, 0x1c, 0xb7, 0xee, 0x22, 0xfb,
+        0x60, 0x9c, 0x01, 0x64, 0x93, 0x42, 0xd0, 0xe6,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xad, 0x80, 0x37, 0x60, 0x17, 0x93, 0xf1, 0x72,
+        0x44, 0x1e, 0xcb, 0x00, 0xdc, 0x13, 0x8d, 0x9f,
+        0xc5, 0x95, 0x71, 0x25, 0xec, 0xc3, 0x82, 0xec,
+        0x65, 0xe3, 0x6f, 0x81, 0x7d, 0xc7, 0x99, 0xfb,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xca, 0x50, 0x0a, 0x54, 0x41, 0xf3, 0x6f, 0x4d,
+        0xf6, 0x73, 0xd6, 0xb8, 0xed, 0x07, 0x5d, 0x36,
+        0xda, 0xe2, 0xc7, 0xe6, 0x48, 0x14, 0x28, 0xc7,
+        0x0a, 0x5a, 0x76, 0xb7, 0xa9, 0xbe, 0xbc, 0xe8,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x42, 0x2b, 0x6d, 0xdd, 0x47, 0x32, 0x31, 0xdc,
+        0x4d, 0x56, 0xfe, 0x91, 0x34, 0x44, 0xcc, 0xd5,
+        0x6f, 0x7c, 0x61, 0xf7, 0x47, 0xba, 0x57, 0xca,
+        0x94, 0x6d, 0x5f, 0xef, 0x72, 0xd8, 0x40, 0xa0,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xab, 0x41, 0xf4, 0xec, 0xb7, 0xd7, 0x08, 0x96,
+        0x15, 0x80, 0x0e, 0x19, 0xfc, 0xc5, 0x3b, 0x83,
+        0x79, 0xed, 0x05, 0xee, 0x35, 0xc8, 0x25, 0x67,
+        0x09, 0x55, 0x83, 0xfd, 0x90, 0xff, 0x30, 0x35,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xbb, 0xf7, 0x61, 0x82, 0x48, 0x35, 0x4c, 0xeb,
+        0x1b, 0xc1, 0xfc, 0x9d, 0xbc, 0x42, 0xc4, 0x26,
+        0xa4, 0xe2, 0xc1, 0xe0, 0xd4, 0x43, 0xc5, 0x68,
+        0x3a, 0x92, 0x56, 0xc6, 0x2e, 0xcd, 0xc2, 0x6f,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xe5, 0x0a, 0xe7, 0x14, 0x79, 0xfc, 0x8e, 0xc5,
+        0x69, 0x19, 0x2a, 0x13, 0x07, 0x2e, 0x01, 0x1a,
+        0xfc, 0x24, 0x9f, 0x47, 0x1a, 0xf0, 0x95, 0x00,
+        0xea, 0x39, 0xf7, 0x5d, 0x0a, 0xf8, 0x56, 0xbf,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xe7, 0x4c, 0x0b, 0x92, 0x20, 0x14, 0x7d, 0xb2,
+        0xd5, 0x0a, 0x3b, 0x58, 0xd4, 0x13, 0x77, 0x5d,
+        0x16, 0xc9, 0x84, 0x69, 0x0b, 0xe7, 0xd9, 0x0f,
+        0x0b, 0xc4, 0x3d, 0x99, 0xdb, 0xa1, 0xb6, 0x89,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x29, 0x32, 0x4a, 0x0a, 0x48, 0xd1, 0x16, 0x57,
+        0xa5, 0x1b, 0xa0, 0x8b, 0x00, 0x48, 0x79, 0xbf,
+        0xcf, 0xc6, 0x6a, 0x1a, 0xcb, 0x7c, 0xe3, 0x6d,
+        0xfe, 0x47, 0x8d, 0x26, 0x55, 0x48, 0x4b, 0x48,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x88, 0x95, 0x2e, 0x3d, 0x0a, 0xc0, 0x6c, 0xb1,
+        0x6b, 0x66, 0x52, 0x01, 0x12, 0x22, 0x49, 0x65,
+        0x9a, 0x22, 0x32, 0x5e, 0x01, 0xc8, 0x70, 0xf4,
+        0x9e, 0x29, 0xda, 0x6b, 0x17, 0x57, 0xe0, 0x82,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xcd, 0xf8, 0x79, 0xf2, 0x43, 0x5b, 0x95, 0xaf,
+        0x04, 0x2a, 0x3b, 0xf7, 0xb8, 0x50, 0xf7, 0x81,
+        0x92, 0x46, 0xc8, 0x05, 0x28, 0x58, 0x03, 0xd6,
+        0x7f, 0xfb, 0xf4, 0xf2, 0x95, 0xbe, 0xd0, 0x04,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xe0, 0x05, 0xe3, 0x24, 0x20, 0x0b, 0x4f, 0x42,
+        0x8c, 0x62, 0xbc, 0x33, 0x31, 0xe6, 0x95, 0xc3,
+        0x73, 0x60, 0x7c, 0xd0, 0xfa, 0xa9, 0x79, 0x03,
+        0x41, 0xfa, 0x3b, 0xa1, 0xed, 0x22, 0x8b, 0xc5,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x35, 0x44, 0x47, 0x72, 0x7a, 0xa9, 0xa5, 0x3d,
+        0xd8, 0x34, 0x5b, 0x6b, 0x6c, 0x69, 0x34, 0x43,
+        0xe5, 0x6e, 0xf4, 0xae, 0xba, 0x13, 0xc4, 0x10,
+        0x17, 0x9f, 0xc8, 0x58, 0x9e, 0x77, 0x33, 0xd5,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xda, 0x52, 0xdd, 0xa9, 0x1f, 0x28, 0x29, 0xc1,
+        0x5c, 0x0e, 0x58, 0xd2, 0x9a, 0x95, 0x36, 0x0b,
+        0x86, 0xab, 0x30, 0xcf, 0x0c, 0xac, 0x81, 0x01,
+        0x83, 0x2a, 0x29, 0xf3, 0x8c, 0x31, 0x85, 0xf1,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xc7, 0xda, 0x78, 0x14, 0xe2, 0x28, 0xe1, 0x14,
+        0x44, 0x11, 0xd7, 0x8b, 0x53, 0x60, 0x92, 0xfe,
+        0x92, 0x0b, 0xcd, 0xfc, 0xc3, 0x6c, 0xf1, 0x9d,
+        0x12, 0x59, 0x04, 0x7b, 0x26, 0x7d, 0x58, 0xb5,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xab, 0xa1, 0xf6, 0x8b, 0x6c, 0x2b, 0x4d, 0xb6,
+        0xcc, 0x06, 0xa7, 0x34, 0x0e, 0x12, 0x31, 0x3c,
+        0x4b, 0x4a, 0x4e, 0xa6, 0xde, 0xb1, 0x7d, 0xeb,
+        0x3e, 0x1e, 0x66, 0xcd, 0x8e, 0xac, 0xf3, 0x2b,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xc1, 0x60, 0xae, 0x4f, 0x64, 0xab, 0x76, 0x4d,
+        0x86, 0x4a, 0x52, 0xad, 0x5e, 0x33, 0x12, 0x6c,
+        0x4b, 0x5c, 0xe1, 0x05, 0xa4, 0x7d, 0xee, 0xdd,
+        0x75, 0xbc, 0x70, 0x19, 0x9a, 0x52, 0x47, 0xef,
+    }),
+    uint256(std::vector<unsigned char>{
+        0xea, 0xdf, 0x23, 0xfc, 0x99, 0xd5, 0x14, 0xdd,
+        0x8e, 0xa2, 0x04, 0xd2, 0x23, 0xe9, 0x8d, 0xa9,
+        0x88, 0x83, 0x1f, 0x9b, 0x5d, 0x19, 0x40, 0x27,
+        0x4c, 0xa5, 0x20, 0xb7, 0xfb, 0x17, 0x3d, 0x8a,
+    }),
+    uint256(std::vector<unsigned char>{
+        0x5b, 0x8e, 0x14, 0xfa, 0xca, 0xc8, 0xa7, 0xc7,
+        0xa3, 0xbf, 0xee, 0x8b, 0xae, 0x71, 0xf2, 0xf7,
+        0x79, 0x3d, 0x3a, 0xd5, 0xfe, 0x33, 0x83, 0xf9,
+        0x3a, 0xb6, 0x06, 0x1f, 0x2a, 0x11, 0xbb, 0x02
+    }),
+};
+
+SHA256Compress SHA256Compress::EmptyRoot(size_t depth) {
+    return sha256_empty_roots.at(depth);
+}
+
+template <size_t Depth, typename Hash>
+class PathFiller {
+private:
+    std::deque<Hash> queue;
+    static EmptyMerkleRoots<Depth, Hash> emptyroots;
+public:
+    PathFiller() : queue() { }
+    PathFiller(std::deque<Hash> queue) : queue(queue) { }
+
+    Hash next(size_t depth) {
+        if (queue.size() > 0) {
+            Hash h = queue.front();
+            queue.pop_front();
+
+            return h;
+        } else {
+            return emptyroots.empty_root(depth);
+        }
+    }
+
+};
+
+template<size_t Depth, typename Hash>
+EmptyMerkleRoots<Depth, Hash> PathFiller<Depth, Hash>::emptyroots;
+
+template<size_t Depth, typename Hash>
+void IncrementalMerkleTree<Depth, Hash>::wfcheck() const {
+    if (parents.size() >= Depth) {
+        throw std::ios_base::failure("tree has too many parents");
+    }
+
+    // The last parent cannot be null.
+    if (!(parents.empty()) && !(parents.back())) {
+        throw std::ios_base::failure("tree has non-canonical representation of parent");
+    }
+
+    // Left cannot be empty when right exists.
+    if (!left && right) {
+        throw std::ios_base::failure("tree has non-canonical representation; right should not exist");
+    }
+
+    // Left cannot be empty when parents is nonempty.
+    if (!left && parents.size() > 0) {
+        throw std::ios_base::failure("tree has non-canonical representation; parents should not be unempty");
+    }
+}
+
+template<size_t Depth, typename Hash>
+Hash IncrementalMerkleTree<Depth, Hash>::last() const {
+    if (right) {
+        return *right;
+    } else if (left) {
+        return *left;
+    } else {
+        throw std::runtime_error("tree has no cursor");
+    }
+}
+
+template<size_t Depth, typename Hash>
+size_t IncrementalMerkleTree<Depth, Hash>::size() const {
+    size_t ret = 0;
+    if (left) {
+        ret++;
+    }
+    if (right) {
+        ret++;
+    }
+    // Treat occupation of parents array as a binary number
+    // (right-shifted by 1)
+    for (size_t i = 0; i < parents.size(); i++) {
+        if (parents[i]) {
+            ret += (1 << (i+1));
+        }
+    }
+    return ret;
+}
+
+template<size_t Depth, typename Hash>
+void IncrementalMerkleTree<Depth, Hash>::append(Hash obj) {
+    if (is_complete(Depth)) {
+        throw std::runtime_error("tree is full");
+    }
+
+    if (!left) {
+        // Set the left leaf
+        left = obj;
+    } else if (!right) {
+        // Set the right leaf
+        right = obj;
+    } else {
+        // Combine the leaves and propagate it up the tree
+        std::optional<Hash> combined = Hash::combine(*left, *right, 0);
+
+        // Set the "left" leaf to the object and make the "right" leaf none
+        left = obj;
+        right = std::nullopt;
+
+        for (size_t i = 0; i < Depth; i++) {
+            if (i < parents.size()) {
+                if (parents[i]) {
+                    combined = Hash::combine(*parents[i], *combined, i+1);
+                    parents[i] = std::nullopt;
+                } else {
+                    parents[i] = *combined;
+                    break;
+                }
+            } else {
+                parents.push_back(combined);
+                break;
+            }
+        }
+    }
+}
+
+// This is for allowing the witness to determine if a subtree has filled
+// to a particular depth, or for append() to ensure we're not appending
+// to a full tree.
+template<size_t Depth, typename Hash>
+bool IncrementalMerkleTree<Depth, Hash>::is_complete(size_t depth) const {
+    if (!left || !right) {
+        return false;
+    }
+
+    if (parents.size() != (depth - 1)) {
+        return false;
+    }
+
+    for (const std::optional<Hash>& parent : parents) {
+        if (!parent) {
+            return false;
+        }
+    }
+
+    return true;
+}
+
+// This finds the next "depth" of an unfilled subtree, given that we've filled
+// `skip` uncles/subtrees.
+template<size_t Depth, typename Hash>
+size_t IncrementalMerkleTree<Depth, Hash>::next_depth(size_t skip) const {
+    if (!left) {
+        if (skip) {
+            skip--;
+        } else {
+            return 0;
+        }
+    }
+
+    if (!right) {
+        if (skip) {
+            skip--;
+        } else {
+            return 0;
+        }
+    }
+
+    size_t d = 1;
+
+    for (const std::optional<Hash>& parent : parents) {
+        if (!parent) {
+            if (skip) {
+                skip--;
+            } else {
+                return d;
+            }
+        }
+
+        d++;
+    }
+
+    return d + skip;
+}
+
+// This calculates the root of the tree.
+template<size_t Depth, typename Hash>
+Hash IncrementalMerkleTree<Depth, Hash>::root(size_t depth,
+                                              std::deque<Hash> filler_hashes) const {
+    PathFiller<Depth, Hash> filler(filler_hashes);
+
+    Hash combine_left =  left  ? *left  : filler.next(0);
+    Hash combine_right = right ? *right : filler.next(0);
+
+    Hash root = Hash::combine(combine_left, combine_right, 0);
+
+    size_t d = 1;
+
+    for (const std::optional<Hash>& parent : parents) {
+        if (parent) {
+            root = Hash::combine(*parent, root, d);
+        } else {
+            root = Hash::combine(root, filler.next(d), d);
+        }
+
+        d++;
+    }
+
+    // We may not have parents for ancestor trees, so we fill
+    // the rest in here.
+    while (d < depth) {
+        root = Hash::combine(root, filler.next(d), d);
+        d++;
+    }
+
+    return root;
+}
+
+// This constructs an authentication path into the tree in the format that the circuit
+// wants. The caller provides `filler_hashes` to fill in the uncle subtrees.
+template<size_t Depth, typename Hash>
+MerklePath IncrementalMerkleTree<Depth, Hash>::path(std::deque<Hash> filler_hashes) const {
+    if (!left) {
+        throw std::runtime_error("can't create an authentication path for the beginning of the tree");
+    }
+
+    PathFiller<Depth, Hash> filler(filler_hashes);
+
+    std::vector<Hash> path;
+    std::vector<bool> index;
+
+    if (right) {
+        index.push_back(true);
+        path.push_back(*left);
+    } else {
+        index.push_back(false);
+        path.push_back(filler.next(0));
+    }
+
+    size_t d = 1;
+
+    for (const std::optional<Hash>& parent : parents) {
+        if (parent) {
+            index.push_back(true);
+            path.push_back(*parent);
+        } else {
+            index.push_back(false);
+            path.push_back(filler.next(d));
+        }
+
+        d++;
+    }
+
+    while (d < Depth) {
+        index.push_back(false);
+        path.push_back(filler.next(d));
+        d++;
+    }
+
+    std::vector<std::vector<bool>> merkle_path;
+    for (Hash b : path)
+    {
+        std::vector<unsigned char> hashv(b.begin(), b.end());
+
+        merkle_path.push_back(convertBytesVectorToVector(hashv));
+    }
+
+    std::reverse(merkle_path.begin(), merkle_path.end());
+    std::reverse(index.begin(), index.end());
+
+    return MerklePath(merkle_path, index);
+}
+
+template<size_t Depth, typename Hash>
+std::deque<Hash> IncrementalWitness<Depth, Hash>::partial_path() const {
+    std::deque<Hash> uncles(filled.begin(), filled.end());
+
+    if (cursor) {
+        uncles.push_back(cursor->root(cursor_depth));
+    }
+
+    return uncles;
+}
+
+template<size_t Depth, typename Hash>
+void IncrementalWitness<Depth, Hash>::append(Hash obj) {
+    if (cursor) {
+        cursor->append(obj);
+
+        if (cursor->is_complete(cursor_depth)) {
+            filled.push_back(cursor->root(cursor_depth));
+            cursor = std::nullopt;
+        }
+    } else {
+        cursor_depth = tree.next_depth(filled.size());
+
+        if (cursor_depth >= Depth) {
+            throw std::runtime_error("tree is full");
+        }
+
+        if (cursor_depth == 0) {
+            filled.push_back(obj);
+        } else {
+            cursor = IncrementalMerkleTree<Depth, Hash>();
+            cursor->append(obj);
+        }
+    }
+}
+
+template class IncrementalMerkleTree<INCREMENTAL_MERKLE_TREE_DEPTH, SHA256Compress>;
+template class IncrementalMerkleTree<INCREMENTAL_MERKLE_TREE_DEPTH_TESTING, SHA256Compress>;
+
+template class IncrementalWitness<INCREMENTAL_MERKLE_TREE_DEPTH, SHA256Compress>;
+template class IncrementalWitness<INCREMENTAL_MERKLE_TREE_DEPTH_TESTING, SHA256Compress>;
+
+template class IncrementalMerkleTree<SAPLING_INCREMENTAL_MERKLE_TREE_DEPTH, PedersenHash>;
+template class IncrementalMerkleTree<INCREMENTAL_MERKLE_TREE_DEPTH_TESTING, PedersenHash>;
+
+template class IncrementalWitness<SAPLING_INCREMENTAL_MERKLE_TREE_DEPTH, PedersenHash>;
+template class IncrementalWitness<INCREMENTAL_MERKLE_TREE_DEPTH_TESTING, PedersenHash>;
+
+} // end namespace `libzcash`
diff --git a/depend/zcash/src/zcash/IncrementalMerkleTree.hpp b/depend/zcash/src/zcash/IncrementalMerkleTree.hpp
new file mode 100644
index 000000000..23471f017
--- /dev/null
+++ b/depend/zcash/src/zcash/IncrementalMerkleTree.hpp
@@ -0,0 +1,356 @@
+#ifndef ZC_INCREMENTALMERKLETREE_H_
+#define ZC_INCREMENTALMERKLETREE_H_
+
+#include <array>
+#include <deque>
+#include <optional>
+
+#include "uint256.h"
+#include "serialize.h"
+
+#include "Zcash.h"
+#include "zcash/util.h"
+
+#include <primitives/orchard.h>
+#include <rust/orchard/incremental_merkle_tree.h>
+
+namespace libzcash {
+
+class MerklePath {
+public:
+    std::vector<std::vector<bool>> authentication_path;
+    std::vector<bool> index;
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        std::vector<std::vector<unsigned char>> pathBytes;
+        uint64_t indexInt;
+        if (ser_action.ForRead()) {
+            READWRITE(pathBytes);
+            READWRITE(indexInt);
+            MerklePath &us = *(const_cast<MerklePath*>(this));
+            for (size_t i = 0; i < pathBytes.size(); i++) {
+                us.authentication_path.push_back(convertBytesVectorToVector(pathBytes[i]));
+                us.index.push_back((indexInt >> ((pathBytes.size() - 1) - i)) & 1);
+            }
+        } else {
+            assert(authentication_path.size() == index.size());
+            pathBytes.resize(authentication_path.size());
+            for (size_t i = 0; i < authentication_path.size(); i++) {
+                pathBytes[i].resize((authentication_path[i].size()+7)/8);
+                for (unsigned int p = 0; p < authentication_path[i].size(); p++) {
+                    pathBytes[i][p / 8] |= authentication_path[i][p] << (7-(p % 8));
+                }
+            }
+            indexInt = convertVectorToInt(index);
+            READWRITE(pathBytes);
+            READWRITE(indexInt);
+        }
+    }
+
+    MerklePath() { }
+
+    MerklePath(std::vector<std::vector<bool>> authentication_path, std::vector<bool> index)
+    : authentication_path(authentication_path), index(index) { }
+};
+
+template<size_t Depth, typename Hash>
+class EmptyMerkleRoots {
+public:
+    EmptyMerkleRoots() { }
+    Hash empty_root(size_t depth) const {
+        return Hash::EmptyRoot(depth);
+    }
+    template <size_t D, typename H>
+    friend bool operator==(const EmptyMerkleRoots<D, H>& a,
+                           const EmptyMerkleRoots<D, H>& b);
+private:
+    std::array<Hash, Depth+1> empty_roots;
+};
+
+template<size_t Depth, typename Hash>
+bool operator==(const EmptyMerkleRoots<Depth, Hash>& a,
+                const EmptyMerkleRoots<Depth, Hash>& b) {
+    return a.empty_roots == b.empty_roots;
+}
+
+template<size_t Depth, typename Hash>
+class IncrementalWitness;
+
+template<size_t Depth, typename Hash>
+class IncrementalMerkleTree {
+
+friend class IncrementalWitness<Depth, Hash>;
+
+public:
+    static_assert(Depth >= 1);
+
+    IncrementalMerkleTree() { }
+
+    size_t DynamicMemoryUsage() const {
+        return 32 + // left
+               32 + // right
+               parents.size() * 32; // parents
+    }
+
+    size_t size() const;
+
+    void append(Hash obj);
+    Hash root() const {
+        return root(Depth, std::deque<Hash>());
+    }
+    Hash last() const;
+
+    IncrementalWitness<Depth, Hash> witness() const {
+        return IncrementalWitness<Depth, Hash>(*this);
+    }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(left);
+        READWRITE(right);
+        READWRITE(parents);
+
+        wfcheck();
+    }
+
+    static Hash empty_root() {
+        return emptyroots.empty_root(Depth);
+    }
+
+    template <size_t D, typename H>
+    friend bool operator==(const IncrementalMerkleTree<D, H>& a,
+                           const IncrementalMerkleTree<D, H>& b);
+
+private:
+    static EmptyMerkleRoots<Depth, Hash> emptyroots;
+    std::optional<Hash> left;
+    std::optional<Hash> right;
+
+    // Collapsed "left" subtrees ordered toward the root of the tree.
+    std::vector<std::optional<Hash>> parents;
+    MerklePath path(std::deque<Hash> filler_hashes = std::deque<Hash>()) const;
+    Hash root(size_t depth, std::deque<Hash> filler_hashes = std::deque<Hash>()) const;
+    bool is_complete(size_t depth = Depth) const;
+    size_t next_depth(size_t skip) const;
+    void wfcheck() const;
+};
+
+template<size_t Depth, typename Hash>
+bool operator==(const IncrementalMerkleTree<Depth, Hash>& a,
+                const IncrementalMerkleTree<Depth, Hash>& b) {
+    return (a.emptyroots == b.emptyroots &&
+            a.left == b.left &&
+            a.right == b.right &&
+            a.parents == b.parents);
+}
+
+template <size_t Depth, typename Hash>
+class IncrementalWitness {
+friend class IncrementalMerkleTree<Depth, Hash>;
+
+public:
+    // Required for Unserialize()
+    IncrementalWitness() {}
+
+    MerklePath path() const {
+        return tree.path(partial_path());
+    }
+
+    // Return the element being witnessed (should be a note
+    // commitment!)
+    Hash element() const {
+        return tree.last();
+    }
+
+    uint64_t position() const {
+        return tree.size() - 1;
+    }
+
+    Hash root() const {
+        return tree.root(Depth, partial_path());
+    }
+
+    void append(Hash obj);
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(tree);
+        READWRITE(filled);
+        READWRITE(cursor);
+
+        cursor_depth = tree.next_depth(filled.size());
+    }
+
+    template <size_t D, typename H>
+    friend bool operator==(const IncrementalWitness<D, H>& a,
+                           const IncrementalWitness<D, H>& b);
+
+private:
+    IncrementalMerkleTree<Depth, Hash> tree;
+    std::vector<Hash> filled;
+    std::optional<IncrementalMerkleTree<Depth, Hash>> cursor;
+    size_t cursor_depth = 0;
+    std::deque<Hash> partial_path() const;
+    IncrementalWitness(IncrementalMerkleTree<Depth, Hash> tree) : tree(tree) {}
+};
+
+template<size_t Depth, typename Hash>
+bool operator==(const IncrementalWitness<Depth, Hash>& a,
+                const IncrementalWitness<Depth, Hash>& b) {
+    return (a.tree == b.tree &&
+            a.filled == b.filled &&
+            a.cursor == b.cursor &&
+            a.cursor_depth == b.cursor_depth);
+}
+
+class SHA256Compress : public uint256 {
+public:
+    SHA256Compress() : uint256() {}
+    SHA256Compress(uint256 contents) : uint256(contents) { }
+
+    static SHA256Compress combine(
+        const SHA256Compress& a,
+        const SHA256Compress& b,
+        size_t depth
+    );
+
+    static SHA256Compress uncommitted() {
+        return SHA256Compress();
+    }
+    static SHA256Compress EmptyRoot(size_t);
+};
+
+class PedersenHash : public uint256 {
+public:
+    PedersenHash() : uint256() {}
+    PedersenHash(uint256 contents) : uint256(contents) { }
+
+    static PedersenHash combine(
+        const PedersenHash& a,
+        const PedersenHash& b,
+        size_t depth
+    );
+
+    static PedersenHash uncommitted();
+    static PedersenHash EmptyRoot(size_t);
+};
+
+template<size_t Depth, typename Hash>
+EmptyMerkleRoots<Depth, Hash> IncrementalMerkleTree<Depth, Hash>::emptyroots;
+
+} // end namespace `libzcash`
+
+typedef libzcash::IncrementalMerkleTree<INCREMENTAL_MERKLE_TREE_DEPTH, libzcash::SHA256Compress> SproutMerkleTree;
+typedef libzcash::IncrementalMerkleTree<INCREMENTAL_MERKLE_TREE_DEPTH_TESTING, libzcash::SHA256Compress> SproutTestingMerkleTree;
+
+typedef libzcash::IncrementalWitness<INCREMENTAL_MERKLE_TREE_DEPTH, libzcash::SHA256Compress> SproutWitness;
+typedef libzcash::IncrementalWitness<INCREMENTAL_MERKLE_TREE_DEPTH_TESTING, libzcash::SHA256Compress> SproutTestingWitness;
+
+typedef libzcash::IncrementalMerkleTree<SAPLING_INCREMENTAL_MERKLE_TREE_DEPTH, libzcash::PedersenHash> SaplingMerkleTree;
+typedef libzcash::IncrementalMerkleTree<INCREMENTAL_MERKLE_TREE_DEPTH_TESTING, libzcash::PedersenHash> SaplingTestingMerkleTree;
+
+typedef libzcash::IncrementalWitness<SAPLING_INCREMENTAL_MERKLE_TREE_DEPTH, libzcash::PedersenHash> SaplingWitness;
+typedef libzcash::IncrementalWitness<INCREMENTAL_MERKLE_TREE_DEPTH_TESTING, libzcash::PedersenHash> SaplingTestingWitness;
+
+class OrchardWallet;
+class OrchardMerkleFrontierLegacySer;
+
+class OrchardMerkleFrontier
+{
+private:
+    /// An incremental Sinsemilla tree; this pointer may never be null.
+    /// Memory is allocated by Rust.
+    std::unique_ptr<OrchardMerkleFrontierPtr, decltype(&orchard_merkle_frontier_free)> inner;
+
+    friend class OrchardWallet;
+    friend class OrchardMerkleFrontierLegacySer;
+public:
+    OrchardMerkleFrontier() : inner(orchard_merkle_frontier_empty(), orchard_merkle_frontier_free) {}
+
+    OrchardMerkleFrontier(OrchardMerkleFrontier&& frontier) : inner(std::move(frontier.inner)) {}
+
+    OrchardMerkleFrontier(const OrchardMerkleFrontier& frontier) :
+        inner(orchard_merkle_frontier_clone(frontier.inner.get()), orchard_merkle_frontier_free) {}
+
+    OrchardMerkleFrontier& operator=(OrchardMerkleFrontier&& frontier)
+    {
+        if (this != &frontier) {
+            inner = std::move(frontier.inner);
+        }
+        return *this;
+    }
+    OrchardMerkleFrontier& operator=(const OrchardMerkleFrontier& frontier)
+    {
+        if (this != &frontier) {
+            inner.reset(orchard_merkle_frontier_clone(frontier.inner.get()));
+        }
+        return *this;
+    }
+
+    template<typename Stream>
+    void Serialize(Stream& s) const {
+        RustStream rs(s);
+        if (!orchard_merkle_frontier_serialize(inner.get(), &rs, RustStream<Stream>::write_callback)) {
+            throw std::ios_base::failure("Failed to serialize v5 Orchard tree");
+        }
+    }
+
+    template<typename Stream>
+    void Unserialize(Stream& s) {
+        RustStream rs(s);
+        OrchardMerkleFrontierPtr* tree = orchard_merkle_frontier_parse(
+                &rs, RustStream<Stream>::read_callback);
+        if (tree == nullptr) {
+            throw std::ios_base::failure("Failed to parse v5 Orchard tree");
+        }
+        inner.reset(tree);
+    }
+
+    size_t DynamicMemoryUsage() const {
+        return orchard_merkle_frontier_dynamic_mem_usage(inner.get());
+    }
+
+    bool AppendBundle(const OrchardBundle& bundle) {
+       return orchard_merkle_frontier_append_bundle(inner.get(), bundle.inner.get());
+    }
+
+    const uint256 root() const {
+        uint256 value;
+        orchard_merkle_frontier_root(inner.get(), value.begin());
+        return value;
+    }
+
+    static uint256 empty_root() {
+        uint256 value;
+        orchard_merkle_tree_empty_root(value.begin());
+        return value;
+    }
+
+    size_t size() const {
+        return orchard_merkle_frontier_num_leaves(inner.get());
+    }
+};
+
+class OrchardMerkleFrontierLegacySer {
+private:
+    const OrchardMerkleFrontier& frontier;
+public:
+    OrchardMerkleFrontierLegacySer(const OrchardMerkleFrontier& frontier): frontier(frontier) {}
+
+    template<typename Stream>
+    void Serialize(Stream& s) const {
+        RustStream rs(s);
+        if (!orchard_merkle_frontier_serialize_legacy(frontier.inner.get(), &rs, RustStream<Stream>::write_callback)) {
+            throw std::ios_base::failure("Failed to serialize Orchard merkle frontier in legacy format.");
+        }
+    }
+};
+
+#endif /* ZC_INCREMENTALMERKLETREE_H_ */
diff --git a/depend/zcash/src/zcash/JoinSplit.cpp b/depend/zcash/src/zcash/JoinSplit.cpp
new file mode 100644
index 000000000..db35c6e5a
--- /dev/null
+++ b/depend/zcash/src/zcash/JoinSplit.cpp
@@ -0,0 +1,252 @@
+#include "JoinSplit.hpp"
+#include "prf.h"
+
+#include "zcash/util.h"
+
+#include <memory>
+
+#include <boost/format.hpp>
+#include <fstream>
+#include "tinyformat.h"
+#include "sync.h"
+#include "amount.h"
+
+#include "librustzcash.h"
+#include "streams.h"
+#include "version.h"
+
+#include <rust/blake2b.h>
+
+namespace libzcash {
+
+    template<size_t NumInputs, size_t NumOutputs>
+    SproutProof JoinSplit<NumInputs, NumOutputs>::prove(
+        const std::array<JSInput, NumInputs>& inputs,
+        const std::array<JSOutput, NumOutputs>& outputs,
+        std::array<SproutNote, NumOutputs>& out_notes,
+        std::array<ZCNoteEncryption::Ciphertext, NumOutputs>& out_ciphertexts,
+        uint256& out_ephemeralKey,
+        const Ed25519VerificationKey& joinSplitPubKey,
+        uint256& out_randomSeed,
+        std::array<uint256, NumInputs>& out_macs,
+        std::array<uint256, NumInputs>& out_nullifiers,
+        std::array<uint256, NumOutputs>& out_commitments,
+        uint64_t vpub_old,
+        uint64_t vpub_new,
+        const uint256& rt,
+        bool computeProof,
+        uint256 *out_esk // Payment disclosure
+    ) {
+        if (vpub_old > MAX_MONEY) {
+            throw std::invalid_argument("nonsensical vpub_old value");
+        }
+
+        if (vpub_new > MAX_MONEY) {
+            throw std::invalid_argument("nonsensical vpub_new value");
+        }
+
+        uint64_t lhs_value = vpub_old;
+        uint64_t rhs_value = vpub_new;
+
+        for (size_t i = 0; i < NumInputs; i++) {
+            // Sanity checks of input
+            {
+                // If note has nonzero value
+                if (inputs[i].note.value() != 0) {
+                    // The witness root must equal the input root.
+                    if (inputs[i].witness.root() != rt) {
+                        throw std::invalid_argument("joinsplit not anchored to the correct root");
+                    }
+
+                    // The tree must witness the correct element
+                    if (inputs[i].note.cm() != inputs[i].witness.element()) {
+                        throw std::invalid_argument("witness of wrong element for joinsplit input");
+                    }
+                }
+
+                // Ensure we have the key to this note.
+                if (inputs[i].note.a_pk != inputs[i].key.address().a_pk) {
+                    throw std::invalid_argument("input note not authorized to spend with given key");
+                }
+
+                // Balance must be sensical
+                if (inputs[i].note.value() > MAX_MONEY) {
+                    throw std::invalid_argument("nonsensical input note value");
+                }
+
+                lhs_value += inputs[i].note.value();
+
+                if (lhs_value > MAX_MONEY) {
+                    throw std::invalid_argument("nonsensical left hand size of joinsplit balance");
+                }
+            }
+
+            // Compute nullifier of input
+            out_nullifiers[i] = inputs[i].nullifier();
+        }
+
+        // Sample randomSeed
+        out_randomSeed = random_uint256();
+
+        // Compute h_sig
+        uint256 h_sig = JoinSplit<NumInputs, NumOutputs>::h_sig(
+            out_randomSeed, out_nullifiers, joinSplitPubKey);
+
+        // Sample phi
+        uint252 phi = random_uint252();
+
+        // Compute notes for outputs
+        for (size_t i = 0; i < NumOutputs; i++) {
+            // Sanity checks of output
+            {
+                if (outputs[i].value > MAX_MONEY) {
+                    throw std::invalid_argument("nonsensical output value");
+                }
+
+                rhs_value += outputs[i].value;
+
+                if (rhs_value > MAX_MONEY) {
+                    throw std::invalid_argument("nonsensical right hand side of joinsplit balance");
+                }
+            }
+
+            // Sample r
+            uint256 r = random_uint256();
+
+            out_notes[i] = outputs[i].note(phi, r, i, h_sig);
+        }
+
+        if (lhs_value != rhs_value) {
+            throw std::invalid_argument("invalid joinsplit balance");
+        }
+
+        // Compute the output commitments
+        for (size_t i = 0; i < NumOutputs; i++) {
+            out_commitments[i] = out_notes[i].cm();
+        }
+
+        // Encrypt the ciphertexts containing the note
+        // plaintexts to the recipients of the value.
+        {
+            ZCNoteEncryption encryptor(h_sig);
+
+            for (size_t i = 0; i < NumOutputs; i++) {
+                SproutNotePlaintext pt(out_notes[i], outputs[i].memo);
+
+                out_ciphertexts[i] = pt.encrypt(encryptor, outputs[i].addr.pk_enc);
+            }
+
+            out_ephemeralKey = encryptor.get_epk();
+
+            // !!! Payment disclosure START
+            if (out_esk != nullptr) {
+                *out_esk = encryptor.get_esk();
+            }
+            // !!! Payment disclosure END
+        }
+
+        // Authenticate h_sig with each of the input
+        // spending keys, producing macs which protect
+        // against malleability.
+        for (size_t i = 0; i < NumInputs; i++) {
+            out_macs[i] = PRF_pk(inputs[i].key, i, h_sig);
+        }
+
+        if (!computeProof) {
+            return GrothProof();
+        }
+
+        GrothProof proof;
+
+        CDataStream ss1(SER_NETWORK, PROTOCOL_VERSION);
+        ss1 << inputs[0].witness.path();
+        std::vector<unsigned char> auth1(ss1.begin(), ss1.end());
+
+        CDataStream ss2(SER_NETWORK, PROTOCOL_VERSION);
+        ss2 << inputs[1].witness.path();
+        std::vector<unsigned char> auth2(ss2.begin(), ss2.end());
+
+        librustzcash_sprout_prove(
+            proof.begin(),
+
+            phi.begin(),
+            rt.begin(),
+            h_sig.begin(),
+
+            inputs[0].key.begin(),
+            inputs[0].note.value(),
+            inputs[0].note.rho.begin(),
+            inputs[0].note.r.begin(),
+            auth1.data(),
+
+            inputs[1].key.begin(),
+            inputs[1].note.value(),
+            inputs[1].note.rho.begin(),
+            inputs[1].note.r.begin(),
+            auth2.data(),
+
+            out_notes[0].a_pk.begin(),
+            out_notes[0].value(),
+            out_notes[0].r.begin(),
+
+            out_notes[1].a_pk.begin(),
+            out_notes[1].value(),
+            out_notes[1].r.begin(),
+
+            vpub_old,
+            vpub_new
+        );
+
+        return proof;
+    }
+
+template<size_t NumInputs, size_t NumOutputs>
+uint256 JoinSplit<NumInputs, NumOutputs>::h_sig(
+    const uint256& randomSeed,
+    const std::array<uint256, NumInputs>& nullifiers,
+    const Ed25519VerificationKey& joinSplitPubKey
+) {
+    const unsigned char personalization[BLAKE2bPersonalBytes]
+        = {'Z','c','a','s','h','C','o','m','p','u','t','e','h','S','i','g'};
+
+    std::vector<unsigned char> block(randomSeed.begin(), randomSeed.end());
+
+    for (size_t i = 0; i < NumInputs; i++) {
+        block.insert(block.end(), nullifiers[i].begin(), nullifiers[i].end());
+    }
+
+    block.insert(block.end(), joinSplitPubKey.bytes, joinSplitPubKey.bytes + ED25519_VERIFICATION_KEY_LEN);
+
+    uint256 output;
+
+    auto state = blake2b_init(32, personalization);
+    blake2b_update(state, &block[0], block.size());
+    blake2b_finalize(state, output.begin(), 32);
+    blake2b_free(state);
+
+    return output;
+}
+
+SproutNote JSOutput::note(const uint252& phi, const uint256& r, size_t i, const uint256& h_sig) const {
+    uint256 rho = PRF_rho(phi, i, h_sig);
+
+    return SproutNote(addr.a_pk, value, rho, r);
+}
+
+JSOutput::JSOutput() : addr(uint256(), uint256()), value(0) {
+    SproutSpendingKey a_sk = SproutSpendingKey::random();
+    addr = a_sk.address();
+}
+
+JSInput::JSInput() : witness(SproutMerkleTree().witness()),
+                     key(SproutSpendingKey::random()) {
+    note = SproutNote(key.address().a_pk, 0, random_uint256(), random_uint256());
+    SproutMerkleTree dummy_tree;
+    dummy_tree.append(note.cm());
+    witness = dummy_tree.witness();
+}
+
+template class JoinSplit<ZC_NUM_JS_INPUTS,
+                         ZC_NUM_JS_OUTPUTS>;
+
+}
diff --git a/depend/zcash/src/zcash/JoinSplit.hpp b/depend/zcash/src/zcash/JoinSplit.hpp
new file mode 100644
index 000000000..9bee708d9
--- /dev/null
+++ b/depend/zcash/src/zcash/JoinSplit.hpp
@@ -0,0 +1,84 @@
+#ifndef ZC_JOINSPLIT_H_
+#define ZC_JOINSPLIT_H_
+
+#include "Zcash.h"
+#include "Proof.hpp"
+#include "Address.hpp"
+#include "Note.hpp"
+#include "IncrementalMerkleTree.hpp"
+#include "NoteEncryption.hpp"
+
+#include "uint256.h"
+#include "uint252.h"
+
+#include <array>
+
+#include <rust/ed25519/types.h>
+
+namespace libzcash {
+
+class JSInput {
+public:
+    SproutWitness witness;
+    SproutNote note;
+    SproutSpendingKey key;
+
+    JSInput();
+    JSInput(SproutWitness witness,
+            SproutNote note,
+            SproutSpendingKey key) : witness(witness), note(note), key(key) { }
+
+    uint256 nullifier() const {
+        return note.nullifier(key);
+    }
+};
+
+class JSOutput {
+public:
+    SproutPaymentAddress addr;
+    uint64_t value;
+    std::array<unsigned char, ZC_MEMO_SIZE> memo = {{0xF6}};  // 0xF6 is invalid UTF8 as per spec, rest of array is 0x00
+
+    JSOutput();
+    JSOutput(SproutPaymentAddress addr, uint64_t value) : addr(addr), value(value) { }
+
+    SproutNote note(const uint252& phi, const uint256& r, size_t i, const uint256& h_sig) const;
+};
+
+template<size_t NumInputs, size_t NumOutputs>
+class JoinSplit {
+public:
+    static uint256 h_sig(const uint256& randomSeed,
+                         const std::array<uint256, NumInputs>& nullifiers,
+                         const Ed25519VerificationKey& joinSplitPubKey
+                        );
+
+    // Compute nullifiers, macs, note commitments & encryptions, and SNARK proof
+    static SproutProof prove(
+        const std::array<JSInput, NumInputs>& inputs,
+        const std::array<JSOutput, NumOutputs>& outputs,
+        std::array<SproutNote, NumOutputs>& out_notes,
+        std::array<ZCNoteEncryption::Ciphertext, NumOutputs>& out_ciphertexts,
+        uint256& out_ephemeralKey,
+        const Ed25519VerificationKey& joinSplitPubKey,
+        uint256& out_randomSeed,
+        std::array<uint256, NumInputs>& out_hmacs,
+        std::array<uint256, NumInputs>& out_nullifiers,
+        std::array<uint256, NumOutputs>& out_commitments,
+        uint64_t vpub_old,
+        uint64_t vpub_new,
+        const uint256& rt,
+        bool computeProof = true,
+        // For paymentdisclosure, we need to retrieve the esk.
+        // Reference as non-const parameter with default value leads to compile error.
+        // So use pointer for simplicity.
+        uint256 *out_esk = nullptr
+    );
+};
+
+}
+
+typedef libzcash::JoinSplit<ZC_NUM_JS_INPUTS,
+                            ZC_NUM_JS_OUTPUTS> ZCJoinSplit;
+
+#endif // ZC_JOINSPLIT_H_
diff --git a/depend/zcash/src/zcash/Note.cpp b/depend/zcash/src/zcash/Note.cpp
new file mode 100644
index 000000000..0871a2141
--- /dev/null
+++ b/depend/zcash/src/zcash/Note.cpp
@@ -0,0 +1,503 @@
+#include "Note.hpp"
+
+#include "prf.h"
+#include "crypto/sha256.h"
+#include "consensus/consensus.h"
+#include "logging.h"
+
+#include "random.h"
+#include "version.h"
+#include "streams.h"
+
+#include "zcash/util.h"
+#include "librustzcash.h"
+
+#include <boost/thread/exceptions.hpp>
+
+using namespace libzcash;
+
+SproutNote::SproutNote() {
+    a_pk = random_uint256();
+    rho = random_uint256();
+    r = random_uint256();
+}
+
+uint256 SproutNote::cm() const {
+    unsigned char discriminant = 0xb0;
+
+    CSHA256 hasher;
+    hasher.Write(&discriminant, 1);
+    hasher.Write(a_pk.begin(), 32);
+
+    auto value_vec = convertIntToVectorLE(value_);
+
+    hasher.Write(&value_vec[0], value_vec.size());
+    hasher.Write(rho.begin(), 32);
+    hasher.Write(r.begin(), 32);
+
+    uint256 result;
+    hasher.Finalize(result.begin());
+
+    return result;
+}
+
+uint256 SproutNote::nullifier(const SproutSpendingKey& a_sk) const {
+    return PRF_nf(a_sk, rho);
+}
+
+// Construct and populate Sapling note for a given payment address and value.
+SaplingNote::SaplingNote(
+    const SaplingPaymentAddress& address,
+    const uint64_t value,
+    Zip212Enabled zip212Enabled
+) : BaseNote(value) {
+    d = address.d;
+    pk_d = address.pk_d;
+    zip_212_enabled = zip212Enabled;
+    if (zip_212_enabled == Zip212Enabled::AfterZip212) {
+        // Per ZIP 212, the rseed field is 32 random bytes.
+        rseed = random_uint256();
+    } else {
+        librustzcash_sapling_generate_r(rseed.begin());
+    }
+}
+
+// Call librustzcash to compute the commitment
+std::optional<uint256> SaplingNote::cmu() const {
+    uint256 result;
+    uint256 rcm_tmp = rcm();
+    // ZIP 216: This method is only called from test code.
+    if (!librustzcash_sapling_compute_cmu(
+            true,
+            d.data(),
+            pk_d.begin(),
+            value(),
+            rcm_tmp.begin(),
+            result.begin()
+        ))
+    {
+        return std::nullopt;
+    }
+
+    return result;
+}
+
+// Call librustzcash to compute the nullifier
+std::optional<uint256> SaplingNote::nullifier(const SaplingFullViewingKey& vk, const uint64_t position) const
+{
+    auto ak = vk.ak;
+    auto nk = vk.nk;
+
+    uint256 result;
+    uint256 rcm_tmp = rcm();
+    if (!librustzcash_sapling_compute_nf(
+            d.data(),
+            pk_d.begin(),
+            value(),
+            rcm_tmp.begin(),
+            ak.begin(),
+            nk.begin(),
+            position,
+            result.begin()
+    ))
+    {
+        return std::nullopt;
+    }
+
+    return result;
+}
+
+SproutNotePlaintext::SproutNotePlaintext(
+    const SproutNote& note,
+    std::array<unsigned char, ZC_MEMO_SIZE> memo) : BaseNotePlaintext(note, memo)
+{
+    rho = note.rho;
+    r = note.r;
+}
+
+SproutNote SproutNotePlaintext::note(const SproutPaymentAddress& addr) const
+{
+    return SproutNote(addr.a_pk, value_, rho, r);
+}
+
+SproutNotePlaintext SproutNotePlaintext::decrypt(const ZCNoteDecryption& decryptor,
+                                     const ZCNoteDecryption::Ciphertext& ciphertext,
+                                     const uint256& ephemeralKey,
+                                     const uint256& h_sig,
+                                     unsigned char nonce
+                                    )
+{
+    auto plaintext = decryptor.decrypt(ciphertext, ephemeralKey, h_sig, nonce);
+
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << plaintext;
+
+    SproutNotePlaintext ret;
+    ss >> ret;
+
+    assert(ss.size() == 0);
+
+    return ret;
+}
+
+ZCNoteEncryption::Ciphertext SproutNotePlaintext::encrypt(ZCNoteEncryption& encryptor,
+                                                    const uint256& pk_enc
+                                                   ) const
+{
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << (*this);
+
+    ZCNoteEncryption::Plaintext pt;
+
+    assert(pt.size() == ss.size());
+
+    memcpy(&pt[0], &ss[0], pt.size());
+
+    return encryptor.encrypt(pk_enc, pt);
+}
+
+
+
+// Construct and populate SaplingNotePlaintext for a given note and memo.
+SaplingNotePlaintext::SaplingNotePlaintext(
+    const SaplingNote& note,
+    std::array<unsigned char, ZC_MEMO_SIZE> memo) : BaseNotePlaintext(note, memo)
+{
+    d = note.d;
+    rseed = note.rseed;
+    if (note.get_zip_212_enabled() == libzcash::Zip212Enabled::AfterZip212) {
+        leadbyte = 0x02;
+    } else {
+        leadbyte = 0x01;
+    }
+}
+
+
+std::optional<SaplingNote> SaplingNotePlaintext::note(const SaplingIncomingViewingKey& ivk) const
+{
+    auto addr = ivk.address(d);
+    if (addr) {
+        Zip212Enabled zip_212_enabled = Zip212Enabled::BeforeZip212;
+        if (leadbyte != 0x01) {
+            assert(leadbyte == 0x02);
+            zip_212_enabled = Zip212Enabled::AfterZip212;
+        };
+        auto tmp = SaplingNote(d, addr.value().pk_d, value_, rseed, zip_212_enabled);
+        return tmp;
+    } else {
+        return std::nullopt;
+    }
+}
+
+std::optional<SaplingOutgoingPlaintext> SaplingOutgoingPlaintext::decrypt(
+    const SaplingOutCiphertext &ciphertext,
+    const uint256& ovk,
+    const uint256& cv,
+    const uint256& cm,
+    const uint256& epk
+)
+{
+    auto pt = AttemptSaplingOutDecryption(ciphertext, ovk, cv, cm, epk);
+    if (!pt) {
+        return std::nullopt;
+    }
+
+    // Deserialize from the plaintext
+    try {
+        CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+        ss << pt.value();
+        SaplingOutgoingPlaintext ret;
+        ss >> ret;
+        assert(ss.size() == 0);
+        return ret;
+    } catch (const boost::thread_interrupted&) {
+        throw;
+    } catch (...) {
+        return std::nullopt;
+    }
+}
+
+std::optional<SaplingNotePlaintext> SaplingNotePlaintext::decrypt(
+    const Consensus::Params& params,
+    int height,
+    const SaplingEncCiphertext &ciphertext,
+    const uint256 &ivk,
+    const uint256 &epk,
+    const uint256 &cmu
+)
+{
+    auto ret = attempt_sapling_enc_decryption_deserialization(ciphertext, ivk, epk);
+
+    if (!ret) {
+        return std::nullopt;
+    } else {
+        const SaplingNotePlaintext plaintext = *ret;
+
+        // Check leadbyte is allowed at block height
+        if (!plaintext_version_is_valid(params, height, plaintext.get_leadbyte())) {
+            LogPrint("receiveunsafe", "Received note plaintext with invalid lead byte %d at height %d",
+                     plaintext.get_leadbyte(), height);
+            return std::nullopt;
+        }
+
+        return plaintext_checks_without_height(plaintext, ivk, epk, cmu);
+    }
+}
+
+std::optional<SaplingNotePlaintext> SaplingNotePlaintext::attempt_sapling_enc_decryption_deserialization(
+    const SaplingEncCiphertext &ciphertext,
+    const uint256 &ivk,
+    const uint256 &epk
+)
+{
+    auto encPlaintext = AttemptSaplingEncDecryption(ciphertext, ivk, epk);
+
+    if (!encPlaintext) {
+        return std::nullopt;
+    }
+
+    // Deserialize from the plaintext
+    SaplingNotePlaintext ret;
+    try {
+        CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+        ss << encPlaintext.value();
+        ss >> ret;
+        assert(ss.size() == 0);
+        return ret;
+    } catch (const boost::thread_interrupted&) {
+        throw;
+    } catch (...) {
+        return std::nullopt;
+    }
+}
+
+std::optional<SaplingNotePlaintext> SaplingNotePlaintext::plaintext_checks_without_height(
+    const SaplingNotePlaintext &plaintext,
+    const uint256 &ivk,
+    const uint256 &epk,
+    const uint256 &cmu
+)
+{
+    // ZIP 216: pk_d here is serialized from Rust,
+    // and thus has always used the canonical encoding.
+    uint256 pk_d;
+    if (!librustzcash_ivk_to_pkd(ivk.begin(), plaintext.d.data(), pk_d.begin())) {
+        return std::nullopt;
+    }
+
+    uint256 cmu_expected;
+    uint256 rcm = plaintext.rcm();
+    if (!librustzcash_sapling_compute_cmu(
+        true,
+        plaintext.d.data(),
+        pk_d.begin(),
+        plaintext.value(),
+        rcm.begin(),
+        cmu_expected.begin()
+    ))
+    {
+        return std::nullopt;
+    }
+
+    if (cmu_expected != cmu) {
+        return std::nullopt;
+    }
+
+    if (plaintext.get_leadbyte() != 0x01) {
+        assert(plaintext.get_leadbyte() == 0x02);
+        // ZIP 212: Check that epk is consistent to guard against linkability
+        // attacks without relying on the soundness of the SNARK.
+        uint256 expected_epk;
+        uint256 esk = plaintext.generate_or_derive_esk();
+        if (!librustzcash_sapling_ka_derivepublic(plaintext.d.data(), esk.begin(), expected_epk.begin())) {
+            return std::nullopt;
+        }
+        if (expected_epk != epk) {
+            return std::nullopt;
+        }
+    }
+
+    return plaintext;
+}
+
+std::optional<SaplingNotePlaintext> SaplingNotePlaintext::decrypt(
+    const Consensus::Params& params,
+    int height,
+    const SaplingEncCiphertext &ciphertext,
+    const uint256 &epk,
+    const uint256 &esk,
+    const uint256 &pk_d,
+    const uint256 &cmu
+)
+{
+    // The nu5Active flag passed in here enables the new consensus rules from ZIP 216
+    // (https://zips.z.cash/zip-0216#specification) on the following fields:
+    //
+    // - pk_d in the outCiphertext field of Sapling coinbase outputs.
+    bool nu5Active = params.NetworkUpgradeActive(height, Consensus::UPGRADE_NU5);
+    auto ret = attempt_sapling_enc_decryption_deserialization(nu5Active, ciphertext, epk, esk, pk_d);
+
+    if (!ret) {
+        return std::nullopt;
+    } else {
+        SaplingNotePlaintext plaintext = *ret;
+
+        // Check leadbyte is allowed at block height
+        if (!plaintext_version_is_valid(params, height, plaintext.get_leadbyte())) {
+            LogPrint("receiveunsafe", "Received note plaintext with invalid lead byte %d at height %d",
+                     plaintext.get_leadbyte(), height);
+            return std::nullopt;
+        }
+
+        return plaintext_checks_without_height(nu5Active, plaintext, epk, esk, pk_d, cmu);
+    }
+}
+
+std::optional<SaplingNotePlaintext> SaplingNotePlaintext::attempt_sapling_enc_decryption_deserialization(
+    bool zip216Enabled,
+    const SaplingEncCiphertext &ciphertext,
+    const uint256 &epk,
+    const uint256 &esk,
+    const uint256 &pk_d
+)
+{
+    auto encPlaintext = AttemptSaplingEncDecryption(zip216Enabled, ciphertext, epk, esk, pk_d);
+
+    if (!encPlaintext) {
+        return std::nullopt;
+    };
+
+    // Deserialize from the plaintext
+    SaplingNotePlaintext ret;
+    try {
+        CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+        ss << encPlaintext.value();
+        ss >> ret;
+        assert(ss.size() == 0);
+        return ret;
+    } catch (const boost::thread_interrupted&) {
+        throw;
+    } catch (...) {
+        return std::nullopt;
+    }
+}
+
+std::optional<SaplingNotePlaintext> SaplingNotePlaintext::plaintext_checks_without_height(
+    bool zip216Enabled,
+    const SaplingNotePlaintext &plaintext,
+    const uint256 &epk,
+    const uint256 &esk,
+    const uint256 &pk_d,
+    const uint256 &cmu
+)
+{
+    if (plaintext.get_leadbyte() != 0x01) {
+        assert(plaintext.get_leadbyte() == 0x02);
+        // ZIP 212: Additionally check that the esk provided to this function
+        // is consistent with the esk we can derive
+        if (esk != plaintext.generate_or_derive_esk()) {
+            return std::nullopt;
+        }
+    }
+
+    // ZIP 212: The recipient MUST derive esk and check that epk is consistent with it.
+    // https://zips.z.cash/zip-0212#changes-to-the-process-of-receiving-sapling-notes
+    uint256 expected_epk;
+    if (!librustzcash_sapling_ka_derivepublic(plaintext.d.data(), esk.begin(), expected_epk.begin())) {
+        return std::nullopt;
+    }
+    if (expected_epk != epk) {
+        return std::nullopt;
+    }
+
+    uint256 cmu_expected;
+    uint256 rcm = plaintext.rcm();
+    if (!librustzcash_sapling_compute_cmu(
+        zip216Enabled,
+        plaintext.d.data(),
+        pk_d.begin(),
+        plaintext.value(),
+        rcm.begin(),
+        cmu_expected.begin()
+    ))
+    {
+        return std::nullopt;
+    }
+
+    if (cmu_expected != cmu) {
+        return std::nullopt;
+    }
+
+    return plaintext;
+}
+
+std::optional<SaplingNotePlaintextEncryptionResult> SaplingNotePlaintext::encrypt(const uint256& pk_d) const
+{
+    // Get the encryptor
+    auto sne = SaplingNoteEncryption::FromDiversifier(d, generate_or_derive_esk());
+    if (!sne) {
+        return std::nullopt;
+    }
+    auto enc = sne.value();
+
+    // Create the plaintext
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << (*this);
+    SaplingEncPlaintext pt;
+    assert(pt.size() == ss.size());
+    memcpy(&pt[0], &ss[0], pt.size());
+
+    // Encrypt the plaintext
+    auto encciphertext = enc.encrypt_to_recipient(pk_d, pt);
+    if (!encciphertext) {
+        return std::nullopt;
+    }
+    return SaplingNotePlaintextEncryptionResult(encciphertext.value(), enc);
+}
+
+
+SaplingOutCiphertext SaplingOutgoingPlaintext::encrypt(
+        const uint256& ovk,
+        const uint256& cv,
+        const uint256& cm,
+        SaplingNoteEncryption& enc
+    ) const
+{
+    // Create the plaintext
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << (*this);
+    SaplingOutPlaintext pt;
+    assert(pt.size() == ss.size());
+    memcpy(&pt[0], &ss[0], pt.size());
+
+    return enc.encrypt_to_ourselves(ovk, cv, cm, pt);
+}
+
+uint256 SaplingNotePlaintext::rcm() const {
+    if (leadbyte != 0x01) {
+        assert(leadbyte == 0x02);
+        return PRF_rcm(rseed);
+    } else {
+        return rseed;
+    }
+}
+
+uint256 SaplingNote::rcm() const {
+    if (SaplingNote::get_zip_212_enabled() == libzcash::Zip212Enabled::AfterZip212) {
+        return PRF_rcm(rseed);
+    } else {
+        return rseed;
+    }
+}
+
+uint256 SaplingNotePlaintext::generate_or_derive_esk() const {
+    if (leadbyte != 0x01) {
+        assert(leadbyte == 0x02);
+        return PRF_esk(rseed);
+    } else {
+        uint256 esk;
+        // Pick random esk
+        librustzcash_sapling_generate_r(esk.begin());
+        return esk;
+    }
+}
diff --git a/depend/zcash/src/zcash/Note.hpp b/depend/zcash/src/zcash/Note.hpp
new file mode 100644
index 000000000..4b3f4e972
--- /dev/null
+++ b/depend/zcash/src/zcash/Note.hpp
@@ -0,0 +1,278 @@
+#ifndef ZC_NOTE_H_
+#define ZC_NOTE_H_
+
+#include "uint256.h"
+#include "Zcash.h"
+#include "Address.hpp"
+#include "NoteEncryption.hpp"
+#include "consensus/params.h"
+#include "consensus/consensus.h"
+
+#include <array>
+#include <optional>
+
+namespace libzcash {
+
+class BaseNote {
+protected:
+    uint64_t value_ = 0;
+public:
+    BaseNote() {}
+    BaseNote(uint64_t value) : value_(value) {};
+    virtual ~BaseNote() {};
+
+    inline uint64_t value() const { return value_; };
+};
+
+class SproutNote : public BaseNote {
+public:
+    uint256 a_pk;
+    uint256 rho;
+    uint256 r;
+
+    SproutNote(uint256 a_pk, uint64_t value, uint256 rho, uint256 r)
+        : BaseNote(value), a_pk(a_pk), rho(rho), r(r) {}
+
+    SproutNote();
+
+    virtual ~SproutNote() {};
+
+    uint256 cm() const;
+
+    uint256 nullifier(const SproutSpendingKey& a_sk) const;
+};
+
+inline bool plaintext_version_is_valid(const Consensus::Params& params, int height, unsigned char leadbyte) {
+    if (params.NetworkUpgradeActive(height, Consensus::UPGRADE_CANOPY)) {
+        int gracePeriodEndHeight = params.vUpgrades[Consensus::UPGRADE_CANOPY].nActivationHeight + ZIP212_GRACE_PERIOD;
+
+        if (height < gracePeriodEndHeight && leadbyte != 0x01 && leadbyte != 0x02) {
+            // non-{0x01,0x02} received after Canopy activation and before grace period has elapsed
+            return false;
+        }
+        if (height >= gracePeriodEndHeight && leadbyte != 0x02) {
+            // non-0x02 received past (Canopy activation height + grace period)
+            return false;
+        }
+        return true;
+    } else {
+        // return false if non-0x01 received when Canopy is not active
+        return leadbyte == 0x01;
+    }
+};
+
+enum class Zip212Enabled {
+    BeforeZip212,
+    AfterZip212
+};
+
+class SaplingNote : public BaseNote {
+private:
+    uint256 rseed;
+    friend class SaplingNotePlaintext;
+    Zip212Enabled zip_212_enabled;
+public:
+    diversifier_t d;
+    uint256 pk_d;
+
+    SaplingNote(diversifier_t d, uint256 pk_d, uint64_t value, uint256 rseed, Zip212Enabled zip_212_enabled)
+            : BaseNote(value), d(d), pk_d(pk_d), rseed(rseed), zip_212_enabled(zip_212_enabled) {}
+
+    SaplingNote(const SaplingPaymentAddress &address, uint64_t value, Zip212Enabled zip_212_enabled);
+
+    virtual ~SaplingNote() {};
+
+    std::optional<uint256> cmu() const;
+    std::optional<uint256> nullifier(const SaplingFullViewingKey &vk, const uint64_t position) const;
+    uint256 rcm() const;
+
+    Zip212Enabled get_zip_212_enabled() const {
+        return zip_212_enabled;
+    }
+};
+
+class BaseNotePlaintext {
+protected:
+    uint64_t value_ = 0;
+    std::array<unsigned char, ZC_MEMO_SIZE> memo_;
+public:
+    BaseNotePlaintext() {}
+    BaseNotePlaintext(const BaseNote& note, std::array<unsigned char, ZC_MEMO_SIZE> memo)
+        : value_(note.value()), memo_(memo) {}
+    virtual ~BaseNotePlaintext() {}
+
+    inline uint64_t value() const { return value_; }
+    inline const std::array<unsigned char, ZC_MEMO_SIZE> & memo() const { return memo_; }
+};
+
+class SproutNotePlaintext : public BaseNotePlaintext {
+public:
+    uint256 rho;
+    uint256 r;
+
+    SproutNotePlaintext() {}
+
+    SproutNotePlaintext(const SproutNote& note, std::array<unsigned char, ZC_MEMO_SIZE> memo);
+
+    SproutNote note(const SproutPaymentAddress& addr) const;
+
+    virtual ~SproutNotePlaintext() {}
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        unsigned char leadbyte = 0x00;
+        READWRITE(leadbyte);
+
+        if (leadbyte != 0x00) {
+            throw std::ios_base::failure("lead byte of SproutNotePlaintext is not recognized");
+        }
+
+        READWRITE(value_);
+        READWRITE(rho);
+        READWRITE(r);
+        READWRITE(memo_);
+    }
+
+    static SproutNotePlaintext decrypt(const ZCNoteDecryption& decryptor,
+                                 const ZCNoteDecryption::Ciphertext& ciphertext,
+                                 const uint256& ephemeralKey,
+                                 const uint256& h_sig,
+                                 unsigned char nonce
+                                );
+
+    ZCNoteEncryption::Ciphertext encrypt(ZCNoteEncryption& encryptor,
+                                         const uint256& pk_enc
+                                        ) const;
+};
+
+typedef std::pair<SaplingEncCiphertext, SaplingNoteEncryption> SaplingNotePlaintextEncryptionResult;
+
+class SaplingNotePlaintext : public BaseNotePlaintext {
+private:
+    uint256 rseed;
+    unsigned char leadbyte;
+public:
+    diversifier_t d;
+
+    SaplingNotePlaintext() {}
+
+    SaplingNotePlaintext(const SaplingNote& note, std::array<unsigned char, ZC_MEMO_SIZE> memo);
+
+    static std::optional<SaplingNotePlaintext> decrypt(
+        const Consensus::Params& params,
+        int height,
+        const SaplingEncCiphertext &ciphertext,
+        const uint256 &ivk,
+        const uint256 &epk,
+        const uint256 &cmu
+    );
+
+    static std::optional<SaplingNotePlaintext> plaintext_checks_without_height(
+        const SaplingNotePlaintext &plaintext,
+        const uint256 &ivk,
+        const uint256 &epk,
+        const uint256 &cmu
+    );
+
+    static std::optional<SaplingNotePlaintext> attempt_sapling_enc_decryption_deserialization(
+        const SaplingEncCiphertext &ciphertext,
+        const uint256 &ivk,
+        const uint256 &epk
+    );
+
+    static std::optional<SaplingNotePlaintext> decrypt(
+        const Consensus::Params& params,
+        int height,
+        const SaplingEncCiphertext &ciphertext,
+        const uint256 &epk,
+        const uint256 &esk,
+        const uint256 &pk_d,
+        const uint256 &cmu
+    );
+
+    static std::optional<SaplingNotePlaintext> plaintext_checks_without_height(
+        bool zip216Enabled,
+        const SaplingNotePlaintext &plaintext,
+        const uint256 &epk,
+        const uint256 &esk,
+        const uint256 &pk_d,
+        const uint256 &cmu
+    );
+
+    static std::optional<SaplingNotePlaintext> attempt_sapling_enc_decryption_deserialization(
+        bool zip216Enabled,
+        const SaplingEncCiphertext &ciphertext,
+        const uint256 &epk,
+        const uint256 &esk,
+        const uint256 &pk_d
+    );
+
+    std::optional<SaplingNote> note(const SaplingIncomingViewingKey& ivk) const;
+
+    virtual ~SaplingNotePlaintext() {}
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(leadbyte);
+
+        if (leadbyte != 0x01 && leadbyte != 0x02) {
+            throw std::ios_base::failure("lead byte of SaplingNotePlaintext is not recognized");
+        }
+
+        READWRITE(d);           // 11 bytes
+        READWRITE(value_);      // 8 bytes
+        READWRITE(rseed);       // 32 bytes
+        READWRITE(memo_);       // 512 bytes
+    }
+
+    std::optional<SaplingNotePlaintextEncryptionResult> encrypt(const uint256& pk_d) const;
+
+    uint256 rcm() const;
+    uint256 generate_or_derive_esk() const;
+    unsigned char get_leadbyte() const {
+        return leadbyte;
+    }
+};
+
+class SaplingOutgoingPlaintext
+{
+public:
+    uint256 pk_d;
+    uint256 esk;
+
+    SaplingOutgoingPlaintext() {};
+
+    SaplingOutgoingPlaintext(uint256 pk_d, uint256 esk) : pk_d(pk_d), esk(esk) {}
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(pk_d);        // 8 bytes
+        READWRITE(esk);         // 8 bytes
+    }
+
+    static std::optional<SaplingOutgoingPlaintext> decrypt(
+        const SaplingOutCiphertext &ciphertext,
+        const uint256& ovk,
+        const uint256& cv,
+        const uint256& cm,
+        const uint256& epk
+    );
+
+    SaplingOutCiphertext encrypt(
+        const uint256& ovk,
+        const uint256& cv,
+        const uint256& cm,
+        SaplingNoteEncryption& enc
+    ) const;
+};
+
+
+}
+
+#endif // ZC_NOTE_H_
diff --git a/depend/zcash/src/zcash/NoteEncryption.cpp b/depend/zcash/src/zcash/NoteEncryption.cpp
new file mode 100644
index 000000000..44132732b
--- /dev/null
+++ b/depend/zcash/src/zcash/NoteEncryption.cpp
@@ -0,0 +1,458 @@
+#include "NoteEncryption.hpp"
+
+#include "random.h"
+
+#include <stdexcept>
+#include "sodium.h"
+#include "prf.h"
+#include "librustzcash.h"
+
+#include <rust/blake2b.h>
+
+#define NOTEENCRYPTION_CIPHER_KEYSIZE 32
+
+void clamp_curve25519(unsigned char key[crypto_scalarmult_SCALARBYTES])
+{
+    key[0] &= 248;
+    key[31] &= 127;
+    key[31] |= 64;
+}
+
+void PRF_ock(
+    unsigned char K[NOTEENCRYPTION_CIPHER_KEYSIZE],
+    const uint256 &ovk,
+    const uint256 &cv,
+    const uint256 &cm,
+    const uint256 &epk
+)
+{
+    unsigned char block[128] = {};
+    memcpy(block+0, ovk.begin(), 32);
+    memcpy(block+32, cv.begin(), 32);
+    memcpy(block+64, cm.begin(), 32);
+    memcpy(block+96, epk.begin(), 32);
+
+    unsigned char personalization[BLAKE2bPersonalBytes] = {};
+    memcpy(personalization, "Zcash_Derive_ock", 16);
+
+    auto state = blake2b_init(NOTEENCRYPTION_CIPHER_KEYSIZE, personalization);
+    blake2b_update(state, block, 128);
+    blake2b_finalize(state, K, NOTEENCRYPTION_CIPHER_KEYSIZE);
+    blake2b_free(state);
+}
+
+void KDF_Sapling(
+    unsigned char K[NOTEENCRYPTION_CIPHER_KEYSIZE],
+    const uint256 &dhsecret,
+    const uint256 &epk
+)
+{
+    unsigned char block[64] = {};
+    memcpy(block+0, dhsecret.begin(), 32);
+    memcpy(block+32, epk.begin(), 32);
+
+    unsigned char personalization[BLAKE2bPersonalBytes] = {};
+    memcpy(personalization, "Zcash_SaplingKDF", 16);
+
+    auto state = blake2b_init(NOTEENCRYPTION_CIPHER_KEYSIZE, personalization);
+    blake2b_update(state, block, 64);
+    blake2b_finalize(state, K, NOTEENCRYPTION_CIPHER_KEYSIZE);
+    blake2b_free(state);
+}
+
+void KDF(unsigned char K[NOTEENCRYPTION_CIPHER_KEYSIZE],
+    const uint256 &dhsecret,
+    const uint256 &epk,
+    const uint256 &pk_enc,
+    const uint256 &hSig,
+    unsigned char nonce
+   )
+{
+    if (nonce == 0xff) {
+        throw std::logic_error("no additional nonce space for KDF");
+    }
+
+    unsigned char block[128] = {};
+    memcpy(block+0, hSig.begin(), 32);
+    memcpy(block+32, dhsecret.begin(), 32);
+    memcpy(block+64, epk.begin(), 32);
+    memcpy(block+96, pk_enc.begin(), 32);
+
+    unsigned char personalization[BLAKE2bPersonalBytes] = {};
+    memcpy(personalization, "ZcashKDF", 8);
+    memcpy(personalization+8, &nonce, 1);
+
+    auto state = blake2b_init(NOTEENCRYPTION_CIPHER_KEYSIZE, personalization);
+    blake2b_update(state, block, 128);
+    blake2b_finalize(state, K, NOTEENCRYPTION_CIPHER_KEYSIZE);
+    blake2b_free(state);
+}
+
+namespace libzcash {
+
+std::optional<SaplingNoteEncryption> SaplingNoteEncryption::FromDiversifier(
+    diversifier_t d,
+    uint256 esk
+)
+{
+    uint256 epk;
+
+    // Compute epk given the diversifier
+    if (!librustzcash_sapling_ka_derivepublic(d.begin(), esk.begin(), epk.begin())) {
+        return std::nullopt;
+    }
+
+    return SaplingNoteEncryption(epk, esk);
+}
+
+std::optional<SaplingEncCiphertext> SaplingNoteEncryption::encrypt_to_recipient(
+    const uint256 &pk_d,
+    const SaplingEncPlaintext &message
+)
+{
+    if (already_encrypted_enc) {
+        throw std::logic_error("already encrypted to the recipient using this key");
+    }
+
+    uint256 dhsecret;
+
+    // The new consensus rules from ZIP 216 (https://zips.z.cash/zip-0216#specification)
+    // on pk_d are enabled unconditionally, as they MAY be enforced in advance of NU5
+    // activation.
+    if (!librustzcash_sapling_ka_agree(true, pk_d.begin(), esk.begin(), dhsecret.begin())) {
+        return std::nullopt;
+    }
+
+    // Construct the symmetric key
+    unsigned char K[NOTEENCRYPTION_CIPHER_KEYSIZE];
+    KDF_Sapling(K, dhsecret, epk);
+
+    // The nonce is zero because we never reuse keys
+    unsigned char cipher_nonce[crypto_aead_chacha20poly1305_IETF_NPUBBYTES] = {};
+
+    SaplingEncCiphertext ciphertext;
+
+    crypto_aead_chacha20poly1305_ietf_encrypt(
+        ciphertext.begin(), NULL,
+        message.begin(), ZC_SAPLING_ENCPLAINTEXT_SIZE,
+        NULL, 0, // no "additional data"
+        NULL, cipher_nonce, K
+    );
+
+    already_encrypted_enc = true;
+
+    return ciphertext;
+}
+
+std::optional<SaplingEncPlaintext> AttemptSaplingEncDecryption(
+    const SaplingEncCiphertext &ciphertext,
+    const uint256 &ivk,
+    const uint256 &epk
+)
+{
+    uint256 dhsecret;
+
+    // ZIP 216: We can enable the rules unconditionally, because ephemeralKey has always
+    // been required to not be small-order (https://zips.z.cash/zip-0216#specification).
+    if (!librustzcash_sapling_ka_agree(true, epk.begin(), ivk.begin(), dhsecret.begin())) {
+        return std::nullopt;
+    }
+
+    // Construct the symmetric key
+    unsigned char K[NOTEENCRYPTION_CIPHER_KEYSIZE];
+    KDF_Sapling(K, dhsecret, epk);
+
+    // The nonce is zero because we never reuse keys
+    unsigned char cipher_nonce[crypto_aead_chacha20poly1305_IETF_NPUBBYTES] = {};
+
+    SaplingEncPlaintext plaintext;
+
+    if (crypto_aead_chacha20poly1305_ietf_decrypt(
+        plaintext.begin(), NULL,
+        NULL,
+        ciphertext.begin(), ZC_SAPLING_ENCCIPHERTEXT_SIZE,
+        NULL,
+        0,
+        cipher_nonce, K) != 0)
+    {
+        return std::nullopt;
+    }
+
+    return plaintext;
+}
+
+std::optional<SaplingEncPlaintext> AttemptSaplingEncDecryption (
+    bool zip216Enabled,
+    const SaplingEncCiphertext &ciphertext,
+    const uint256 &epk,
+    const uint256 &esk,
+    const uint256 &pk_d
+)
+{
+    uint256 dhsecret;
+
+    if (!librustzcash_sapling_ka_agree(zip216Enabled, pk_d.begin(), esk.begin(), dhsecret.begin())) {
+        return std::nullopt;
+    }
+
+    // Construct the symmetric key
+    unsigned char K[NOTEENCRYPTION_CIPHER_KEYSIZE];
+    KDF_Sapling(K, dhsecret, epk);
+
+    // The nonce is zero because we never reuse keys
+    unsigned char cipher_nonce[crypto_aead_chacha20poly1305_IETF_NPUBBYTES] = {};
+
+    SaplingEncPlaintext plaintext;
+
+    if (crypto_aead_chacha20poly1305_ietf_decrypt(
+        plaintext.begin(), NULL,
+        NULL,
+        ciphertext.begin(), ZC_SAPLING_ENCCIPHERTEXT_SIZE,
+        NULL,
+        0,
+        cipher_nonce, K) != 0)
+    {
+        return std::nullopt;
+    }
+
+    return plaintext;
+}
+
+
+SaplingOutCiphertext SaplingNoteEncryption::encrypt_to_ourselves(
+    const uint256 &ovk,
+    const uint256 &cv,
+    const uint256 &cm,
+    const SaplingOutPlaintext &message
+)
+{
+    if (already_encrypted_out) {
+        throw std::logic_error("already encrypted to the recipient using this key");
+    }
+
+    // Construct the symmetric key
+    unsigned char K[NOTEENCRYPTION_CIPHER_KEYSIZE];
+    PRF_ock(K, ovk, cv, cm, epk);
+
+    // The nonce is zero because we never reuse keys
+    unsigned char cipher_nonce[crypto_aead_chacha20poly1305_IETF_NPUBBYTES] = {};
+
+    SaplingOutCiphertext ciphertext;
+
+    crypto_aead_chacha20poly1305_ietf_encrypt(
+        ciphertext.begin(), NULL,
+        message.begin(), ZC_SAPLING_OUTPLAINTEXT_SIZE,
+        NULL, 0, // no "additional data"
+        NULL, cipher_nonce, K
+    );
+
+    already_encrypted_out = true;
+
+    return ciphertext;
+}
+
+std::optional<SaplingOutPlaintext> AttemptSaplingOutDecryption(
+    const SaplingOutCiphertext &ciphertext,
+    const uint256 &ovk,
+    const uint256 &cv,
+    const uint256 &cm,
+    const uint256 &epk
+)
+{
+    // Construct the symmetric key
+    unsigned char K[NOTEENCRYPTION_CIPHER_KEYSIZE];
+    PRF_ock(K, ovk, cv, cm, epk);
+
+    // The nonce is zero because we never reuse keys
+    unsigned char cipher_nonce[crypto_aead_chacha20poly1305_IETF_NPUBBYTES] = {};
+
+    SaplingOutPlaintext plaintext;
+
+    if (crypto_aead_chacha20poly1305_ietf_decrypt(
+        plaintext.begin(), NULL,
+        NULL,
+        ciphertext.begin(), ZC_SAPLING_OUTCIPHERTEXT_SIZE,
+        NULL,
+        0,
+        cipher_nonce, K) != 0)
+    {
+        return std::nullopt;
+    }
+
+    return plaintext;
+}
+
+template<size_t MLEN>
+NoteEncryption<MLEN>::NoteEncryption(uint256 hSig) : nonce(0), hSig(hSig) {
+    // All of this code assumes crypto_scalarmult_BYTES is 32
+    // There's no reason that will _ever_ change, but for
+    // completeness purposes, let's check anyway.
+    static_assert(32 == crypto_scalarmult_BYTES);
+    static_assert(32 == crypto_scalarmult_SCALARBYTES);
+    static_assert(NOTEENCRYPTION_AUTH_BYTES == crypto_aead_chacha20poly1305_ABYTES);
+
+    // Create the ephemeral keypair
+    esk = random_uint256();
+    epk = generate_pubkey(esk);
+}
+
+template<size_t MLEN>
+NoteDecryption<MLEN>::NoteDecryption(uint256 sk_enc) : sk_enc(sk_enc) {
+    this->pk_enc = NoteEncryption<MLEN>::generate_pubkey(sk_enc);
+}
+
+template<size_t MLEN>
+typename NoteEncryption<MLEN>::Ciphertext NoteEncryption<MLEN>::encrypt
+                                          (const uint256 &pk_enc,
+                                           const NoteEncryption<MLEN>::Plaintext &message
+                                          )
+{
+    uint256 dhsecret;
+
+    if (crypto_scalarmult(dhsecret.begin(), esk.begin(), pk_enc.begin()) != 0) {
+        throw std::logic_error("Could not create DH secret");
+    }
+
+    // Construct the symmetric key
+    unsigned char K[NOTEENCRYPTION_CIPHER_KEYSIZE];
+    KDF(K, dhsecret, epk, pk_enc, hSig, nonce);
+
+    // Increment the number of encryptions we've performed
+    nonce++;
+
+    // The nonce is zero because we never reuse keys
+    unsigned char cipher_nonce[crypto_aead_chacha20poly1305_IETF_NPUBBYTES] = {};
+
+    NoteEncryption<MLEN>::Ciphertext ciphertext;
+
+    crypto_aead_chacha20poly1305_ietf_encrypt(ciphertext.begin(), NULL,
+                                         message.begin(), MLEN,
+                                         NULL, 0, // no "additional data"
+                                         NULL, cipher_nonce, K);
+
+    return ciphertext;
+}
+
+template<size_t MLEN>
+typename NoteDecryption<MLEN>::Plaintext NoteDecryption<MLEN>::decrypt
+                                         (const NoteDecryption<MLEN>::Ciphertext &ciphertext,
+                                          const uint256 &epk,
+                                          const uint256 &hSig,
+                                          unsigned char nonce
+                                         ) const
+{
+    uint256 dhsecret;
+
+    if (crypto_scalarmult(dhsecret.begin(), sk_enc.begin(), epk.begin()) != 0) {
+        throw std::logic_error("Could not create DH secret");
+    }
+
+    unsigned char K[NOTEENCRYPTION_CIPHER_KEYSIZE];
+    KDF(K, dhsecret, epk, pk_enc, hSig, nonce);
+
+    // The nonce is zero because we never reuse keys
+    unsigned char cipher_nonce[crypto_aead_chacha20poly1305_IETF_NPUBBYTES] = {};
+
+    NoteDecryption<MLEN>::Plaintext plaintext;
+
+    // Message length is always NOTEENCRYPTION_AUTH_BYTES less than
+    // the ciphertext length.
+    if (crypto_aead_chacha20poly1305_ietf_decrypt(plaintext.begin(), NULL,
+                                             NULL,
+                                             ciphertext.begin(), NoteDecryption<MLEN>::CLEN,
+                                             NULL,
+                                             0,
+                                             cipher_nonce, K) != 0) {
+        throw note_decryption_failed();
+    }
+
+    return plaintext;
+}
+
+//
+// Payment disclosure - decrypt with esk
+//
+template<size_t MLEN>
+typename PaymentDisclosureNoteDecryption<MLEN>::Plaintext PaymentDisclosureNoteDecryption<MLEN>::decryptWithEsk
+                                         (const PaymentDisclosureNoteDecryption<MLEN>::Ciphertext &ciphertext,
+                                          const uint256 &pk_enc,
+                                          const uint256 &esk,
+                                          const uint256 &hSig,
+                                          unsigned char nonce
+                                         ) const
+{
+    uint256 dhsecret;
+
+    if (crypto_scalarmult(dhsecret.begin(), esk.begin(), pk_enc.begin()) != 0) {
+        throw std::logic_error("Could not create DH secret");
+    }
+
+    // Regenerate keypair
+    uint256 epk = NoteEncryption<MLEN>::generate_pubkey(esk);
+
+    unsigned char K[NOTEENCRYPTION_CIPHER_KEYSIZE];
+    KDF(K, dhsecret, epk, pk_enc, hSig, nonce);
+
+    // The nonce is zero because we never reuse keys
+    unsigned char cipher_nonce[crypto_aead_chacha20poly1305_IETF_NPUBBYTES] = {};
+
+    PaymentDisclosureNoteDecryption<MLEN>::Plaintext plaintext;
+
+    // Message length is always NOTEENCRYPTION_AUTH_BYTES less than
+    // the ciphertext length.
+    if (crypto_aead_chacha20poly1305_ietf_decrypt(plaintext.begin(), NULL,
+                                             NULL,
+                                             ciphertext.begin(), PaymentDisclosureNoteDecryption<MLEN>::CLEN,
+                                             NULL,
+                                             0,
+                                             cipher_nonce, K) != 0) {
+        throw note_decryption_failed();
+    }
+
+    return plaintext;
+}
+
+
+
+
+template<size_t MLEN>
+uint256 NoteEncryption<MLEN>::generate_privkey(const uint252 &a_sk)
+{
+    uint256 sk = PRF_addr_sk_enc(a_sk);
+
+    clamp_curve25519(sk.begin());
+
+    return sk;
+}
+
+template<size_t MLEN>
+uint256 NoteEncryption<MLEN>::generate_pubkey(const uint256 &sk_enc)
+{
+    uint256 pk;
+
+    if (crypto_scalarmult_base(pk.begin(), sk_enc.begin()) != 0) {
+        throw std::logic_error("Could not create public key");
+    }
+
+    return pk;
+}
+
+uint256 random_uint256()
+{
+    return GetRandHash();
+}
+
+uint252 random_uint252()
+{
+    uint256 rand = random_uint256();
+    (*rand.begin()) &= 0x0F;
+
+    return uint252(rand);
+}
+
+template class NoteEncryption<ZC_NOTEPLAINTEXT_SIZE>;
+template class NoteDecryption<ZC_NOTEPLAINTEXT_SIZE>;
+
+template class PaymentDisclosureNoteDecryption<ZC_NOTEPLAINTEXT_SIZE>;
+
+}
diff --git a/depend/zcash/src/zcash/NoteEncryption.hpp b/depend/zcash/src/zcash/NoteEncryption.hpp
new file mode 100644
index 000000000..91d3adb79
--- /dev/null
+++ b/depend/zcash/src/zcash/NoteEncryption.hpp
@@ -0,0 +1,203 @@
+/*
+See the Zcash protocol specification for more information.
+https://github.com/zcash/zips/blob/master/protocol/protocol.pdf
+*/
+
+#ifndef ZC_NOTE_ENCRYPTION_H_
+#define ZC_NOTE_ENCRYPTION_H_
+
+#include "uint256.h"
+#include "uint252.h"
+
+#include "zcash/Zcash.h"
+#include "zcash/Address.hpp"
+
+#include <array>
+#include <optional>
+
+namespace libzcash {
+
+// Ciphertext for the recipient to decrypt
+typedef std::array<unsigned char, ZC_SAPLING_ENCCIPHERTEXT_SIZE> SaplingEncCiphertext;
+typedef std::array<unsigned char, ZC_SAPLING_ENCPLAINTEXT_SIZE> SaplingEncPlaintext;
+
+// Ciphertext for outgoing viewing key to decrypt
+typedef std::array<unsigned char, ZC_SAPLING_OUTCIPHERTEXT_SIZE> SaplingOutCiphertext;
+typedef std::array<unsigned char, ZC_SAPLING_OUTPLAINTEXT_SIZE> SaplingOutPlaintext;
+
+//! This is not a thread-safe API.
+class SaplingNoteEncryption {
+protected:
+    // Ephemeral public key
+    uint256 epk;
+
+    // Ephemeral secret key
+    uint256 esk;
+
+    bool already_encrypted_enc;
+    bool already_encrypted_out;
+
+    SaplingNoteEncryption(uint256 epk, uint256 esk) : epk(epk), esk(esk), already_encrypted_enc(false), already_encrypted_out(false) {
+
+    }
+
+public:
+
+    static std::optional<SaplingNoteEncryption> FromDiversifier(diversifier_t d, uint256 esk);
+
+    std::optional<SaplingEncCiphertext> encrypt_to_recipient(
+        const uint256 &pk_d,
+        const SaplingEncPlaintext &message
+    );
+
+    SaplingOutCiphertext encrypt_to_ourselves(
+        const uint256 &ovk,
+        const uint256 &cv,
+        const uint256 &cm,
+        const SaplingOutPlaintext &message
+    );
+
+    uint256 get_epk() const {
+        return epk;
+    }
+
+    uint256 get_esk() const {
+        return esk;
+    }
+};
+
+// Attempts to decrypt a Sapling note. This will not check that the contents
+// of the ciphertext are correct.
+std::optional<SaplingEncPlaintext> AttemptSaplingEncDecryption(
+    const SaplingEncCiphertext &ciphertext,
+    const uint256 &ivk,
+    const uint256 &epk
+);
+
+// Attempts to decrypt a Sapling note using outgoing plaintext.
+// This will not check that the contents of the ciphertext are correct.
+std::optional<SaplingEncPlaintext> AttemptSaplingEncDecryption (
+    bool zip216Enabled,
+    const SaplingEncCiphertext &ciphertext,
+    const uint256 &epk,
+    const uint256 &esk,
+    const uint256 &pk_d
+);
+
+// Attempts to decrypt a Sapling note. This will not check that the contents
+// of the ciphertext are correct.
+std::optional<SaplingOutPlaintext> AttemptSaplingOutDecryption(
+    const SaplingOutCiphertext &ciphertext,
+    const uint256 &ovk,
+    const uint256 &cv,
+    const uint256 &cm,
+    const uint256 &epk
+);
+
+template<size_t MLEN>
+class NoteEncryption {
+protected:
+    enum { CLEN=MLEN+NOTEENCRYPTION_AUTH_BYTES };
+    uint256 epk;
+    uint256 esk;
+    unsigned char nonce;
+    uint256 hSig;
+
+public:
+    typedef std::array<unsigned char, CLEN> Ciphertext;
+    typedef std::array<unsigned char, MLEN> Plaintext;
+
+    NoteEncryption(uint256 hSig);
+
+    // Gets the ephemeral secret key
+    uint256 get_esk() {
+        return esk;
+    }
+
+    // Gets the ephemeral public key
+    uint256 get_epk() {
+        return epk;
+    }
+
+    // Encrypts `message` with `pk_enc` and returns the ciphertext.
+    // This is only called ZC_NUM_JS_OUTPUTS times for a given instantiation; 
+    // but can be called 255 times before the nonce-space runs out.
+    Ciphertext encrypt(const uint256 &pk_enc,
+                       const Plaintext &message
+                      );
+
+    // Creates a NoteEncryption private key
+    static uint256 generate_privkey(const uint252 &a_sk);
+
+    // Creates a NoteEncryption public key from a private key
+    static uint256 generate_pubkey(const uint256 &sk_enc);
+};
+
+template<size_t MLEN>
+class NoteDecryption {
+protected:
+    enum { CLEN=MLEN+NOTEENCRYPTION_AUTH_BYTES };
+    uint256 sk_enc;
+    uint256 pk_enc;
+
+public:
+    typedef std::array<unsigned char, CLEN> Ciphertext;
+    typedef std::array<unsigned char, MLEN> Plaintext;
+
+    NoteDecryption() { }
+    NoteDecryption(uint256 sk_enc);
+
+    Plaintext decrypt(const Ciphertext &ciphertext,
+                      const uint256 &epk,
+                      const uint256 &hSig,
+                      unsigned char nonce
+                     ) const;
+
+    friend inline bool operator==(const NoteDecryption& a, const NoteDecryption& b) {
+        return a.sk_enc == b.sk_enc && a.pk_enc == b.pk_enc;
+    }
+    friend inline bool operator<(const NoteDecryption& a, const NoteDecryption& b) {
+        return (a.sk_enc < b.sk_enc ||
+                (a.sk_enc == b.sk_enc && a.pk_enc < b.pk_enc));
+    }
+};
+
+uint256 random_uint256();
+uint252 random_uint252();
+
+class note_decryption_failed : public std::runtime_error {
+public:
+    note_decryption_failed() : std::runtime_error("Could not decrypt message") { }
+};
+
+
+
+// Subclass PaymentDisclosureNoteDecryption provides a method to decrypt a note with esk.
+template<size_t MLEN>
+class PaymentDisclosureNoteDecryption : public NoteDecryption<MLEN> {
+protected:
+public:
+    enum { CLEN=MLEN+NOTEENCRYPTION_AUTH_BYTES };
+    typedef std::array<unsigned char, CLEN> Ciphertext;
+    typedef std::array<unsigned char, MLEN> Plaintext;
+
+    PaymentDisclosureNoteDecryption() : NoteDecryption<MLEN>() {}
+    PaymentDisclosureNoteDecryption(uint256 sk_enc) : NoteDecryption<MLEN>(sk_enc) {}
+
+    Plaintext decryptWithEsk(
+        const Ciphertext &ciphertext,
+        const uint256 &pk_enc,
+        const uint256 &esk,
+        const uint256 &hSig,
+        unsigned char nonce
+        ) const;
+};
+
+}
+
+typedef libzcash::NoteEncryption<ZC_NOTEPLAINTEXT_SIZE> ZCNoteEncryption;
+typedef libzcash::NoteDecryption<ZC_NOTEPLAINTEXT_SIZE> ZCNoteDecryption;
+
+typedef libzcash::PaymentDisclosureNoteDecryption<ZC_NOTEPLAINTEXT_SIZE> ZCPaymentDisclosureNoteDecryption;
+
+#endif /* ZC_NOTE_ENCRYPTION_H_ */
diff --git a/depend/zcash/src/zcash/Proof.hpp b/depend/zcash/src/zcash/Proof.hpp
new file mode 100644
index 000000000..fa6069581
--- /dev/null
+++ b/depend/zcash/src/zcash/Proof.hpp
@@ -0,0 +1,218 @@
+#ifndef ZC_PROOF_H_
+#define ZC_PROOF_H_
+
+#include "serialize.h"
+#include "uint256.h"
+
+#include <variant>
+
+namespace libzcash {
+
+const unsigned char G1_PREFIX_MASK = 0x02;
+const unsigned char G2_PREFIX_MASK = 0x0a;
+
+// Element in the base field
+class Fq {
+private:
+    base_blob<256> data;
+public:
+    Fq() : data() { }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(data);
+    }
+
+    friend bool operator==(const Fq& a, const Fq& b)
+    {
+        return (
+            a.data == b.data
+        );
+    }
+
+    friend bool operator!=(const Fq& a, const Fq& b)
+    {
+        return !(a == b);
+    }
+};
+
+// Element in the extension field
+class Fq2 {
+private:
+    base_blob<512> data;
+public:
+    Fq2() : data() { }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(data);
+    }
+
+    friend bool operator==(const Fq2& a, const Fq2& b)
+    {
+        return (
+            a.data == b.data
+        );
+    }
+
+    friend bool operator!=(const Fq2& a, const Fq2& b)
+    {
+        return !(a == b);
+    }
+};
+
+// Compressed point in G1
+class CompressedG1 {
+private:
+    bool y_lsb;
+    Fq x;
+
+public:
+    CompressedG1() : y_lsb(false), x() { }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        unsigned char leadingByte = G1_PREFIX_MASK;
+
+        if (y_lsb) {
+            leadingByte |= 1;
+        }
+
+        READWRITE(leadingByte);
+
+        if ((leadingByte & (~1)) != G1_PREFIX_MASK) {
+            throw std::ios_base::failure("lead byte of G1 point not recognized");
+        }
+
+        y_lsb = leadingByte & 1;
+
+        READWRITE(x);
+    }
+
+    friend bool operator==(const CompressedG1& a, const CompressedG1& b)
+    {
+        return (
+            a.y_lsb == b.y_lsb &&
+            a.x == b.x
+        );
+    }
+
+    friend bool operator!=(const CompressedG1& a, const CompressedG1& b)
+    {
+        return !(a == b);
+    }
+};
+
+// Compressed point in G2
+class CompressedG2 {
+private:
+    bool y_gt;
+    Fq2 x;
+
+public:
+    CompressedG2() : y_gt(false), x() { }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        unsigned char leadingByte = G2_PREFIX_MASK;
+
+        if (y_gt) {
+            leadingByte |= 1;
+        }
+
+        READWRITE(leadingByte);
+
+        if ((leadingByte & (~1)) != G2_PREFIX_MASK) {
+            throw std::ios_base::failure("lead byte of G2 point not recognized");
+        }
+
+        y_gt = leadingByte & 1;
+
+        READWRITE(x);
+    }
+
+    friend bool operator==(const CompressedG2& a, const CompressedG2& b)
+    {
+        return (
+            a.y_gt == b.y_gt &&
+            a.x == b.x
+        );
+    }
+
+    friend bool operator!=(const CompressedG2& a, const CompressedG2& b)
+    {
+        return !(a == b);
+    }
+};
+
+// Compressed zkSNARK proof
+class PHGRProof {
+private:
+    CompressedG1 g_A;
+    CompressedG1 g_A_prime;
+    CompressedG2 g_B;
+    CompressedG1 g_B_prime;
+    CompressedG1 g_C;
+    CompressedG1 g_C_prime;
+    CompressedG1 g_K;
+    CompressedG1 g_H;
+
+public:
+    PHGRProof() : g_A(), g_A_prime(), g_B(), g_B_prime(), g_C(), g_C_prime(), g_K(), g_H() { }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(g_A);
+        READWRITE(g_A_prime);
+        READWRITE(g_B);
+        READWRITE(g_B_prime);
+        READWRITE(g_C);
+        READWRITE(g_C_prime);
+        READWRITE(g_K);
+        READWRITE(g_H);
+    }
+
+    friend bool operator==(const PHGRProof& a, const PHGRProof& b)
+    {
+        return (
+            a.g_A == b.g_A &&
+            a.g_A_prime == b.g_A_prime &&
+            a.g_B == b.g_B &&
+            a.g_B_prime == b.g_B_prime &&
+            a.g_C == b.g_C &&
+            a.g_C_prime == b.g_C_prime &&
+            a.g_K == b.g_K &&
+            a.g_H == b.g_H
+        );
+    }
+
+    friend bool operator!=(const PHGRProof& a, const PHGRProof& b)
+    {
+        return !(a == b);
+    }
+};
+
+static constexpr size_t GROTH_PROOF_SIZE = (
+    48 + // π_A
+    96 + // π_B
+    48); // π_C
+
+typedef std::array<unsigned char, GROTH_PROOF_SIZE> GrothProof;
+// TODO: Because PHGRProof is listed first, using the default
+// constructor for JSDescription() will create a JSDescription
+// with a PHGRProof. The default however should be GrothProof.
+typedef std::variant<PHGRProof, GrothProof> SproutProof;
+
+}
+
+#endif // ZC_PROOF_H_
diff --git a/depend/zcash/src/zcash/Zcash.h b/depend/zcash/src/zcash/Zcash.h
new file mode 100644
index 000000000..aecef6f66
--- /dev/null
+++ b/depend/zcash/src/zcash/Zcash.h
@@ -0,0 +1,47 @@
+#ifndef ZCASH_ZCASH_ZCASH_H
+#define ZCASH_ZCASH_ZCASH_H
+
+#define ZC_NUM_JS_INPUTS 2
+#define ZC_NUM_JS_OUTPUTS 2
+#define INCREMENTAL_MERKLE_TREE_DEPTH 29
+#define INCREMENTAL_MERKLE_TREE_DEPTH_TESTING 4
+
+#define SAPLING_INCREMENTAL_MERKLE_TREE_DEPTH 32
+#define ORCHARD_INCREMENTAL_MERKLE_TREE_DEPTH 32
+
+#define NOTEENCRYPTION_AUTH_BYTES 16
+
+#define ZC_NOTEPLAINTEXT_LEADING 1
+#define ZC_V_SIZE 8
+#define ZC_RHO_SIZE 32
+#define ZC_R_SIZE 32
+#define ZC_MEMO_SIZE 512
+#define ZC_DIVERSIFIER_SIZE 11
+#define ZC_JUBJUB_POINT_SIZE 32
+#define ZC_JUBJUB_SCALAR_SIZE 32
+
+#define ZC_NOTEPLAINTEXT_SIZE (ZC_NOTEPLAINTEXT_LEADING + ZC_V_SIZE + ZC_RHO_SIZE + ZC_R_SIZE + ZC_MEMO_SIZE)
+
+#define ZC_SAPLING_ENCPLAINTEXT_SIZE (ZC_NOTEPLAINTEXT_LEADING + ZC_DIVERSIFIER_SIZE + ZC_V_SIZE + ZC_R_SIZE + ZC_MEMO_SIZE)
+#define ZC_SAPLING_OUTPLAINTEXT_SIZE (ZC_JUBJUB_POINT_SIZE + ZC_JUBJUB_SCALAR_SIZE)
+
+#define ZC_SAPLING_ENCCIPHERTEXT_SIZE (ZC_SAPLING_ENCPLAINTEXT_SIZE + NOTEENCRYPTION_AUTH_BYTES)
+#define ZC_SAPLING_OUTCIPHERTEXT_SIZE (ZC_SAPLING_OUTPLAINTEXT_SIZE + NOTEENCRYPTION_AUTH_BYTES)
+
+// - CompactSize is at least 1 byte
+#define ZC_ZIP225_ORCHARD_NUM_ACTIONS_SIZE 1
+#define ZC_ZIP225_ORCHARD_FLAGS_SIZE 1
+#define ZC_ZIP225_ORCHARD_VALUE_BALANCE_SIZE 8
+#define ZC_ZIP225_ORCHARD_ANCHOR_SIZE 32
+// - CompactSize is at least 3 bytes because sizeProofsOrchard >= 253
+#define ZC_ZIP225_ORCHARD_SIZE_PROOFS_BASE_SIZE 3
+#define ZC_ZIP225_ORCHARD_PROOF_BASE_SIZE 2720
+#define ZC_ZIP225_ORCHARD_BINDING_SIG_SIZE 64
+#define ZC_ZIP225_ORCHARD_BASE_SIZE (ZC_ZIP225_ORCHARD_NUM_ACTIONS_SIZE + ZC_ZIP225_ORCHARD_FLAGS_SIZE + ZC_ZIP225_ORCHARD_VALUE_BALANCE_SIZE + ZC_ZIP225_ORCHARD_ANCHOR_SIZE + ZC_ZIP225_ORCHARD_SIZE_PROOFS_BASE_SIZE + ZC_ZIP225_ORCHARD_PROOF_BASE_SIZE + ZC_ZIP225_ORCHARD_BINDING_SIG_SIZE)
+// Marginal transaction size per Orchard Action
+#define ZC_ZIP225_ORCHARD_ACTION_SIZE 820
+#define ZC_ZIP225_ORCHARD_SPEND_AUTH_SIG_SIZE 64
+#define ZC_ZIP225_ORCHARD_PROOF_MARGINAL_SIZE 2272
+#define ZC_ZIP225_ORCHARD_MARGINAL_SIZE (ZC_ZIP225_ORCHARD_ACTION_SIZE + ZC_ZIP225_ORCHARD_SPEND_AUTH_SIG_SIZE + ZC_ZIP225_ORCHARD_PROOF_MARGINAL_SIZE)
+
+#endif // ZCASH_ZCASH_ZCASH_H
diff --git a/depend/zcash/src/zcash/address/mnemonic.cpp b/depend/zcash/src/zcash/address/mnemonic.cpp
new file mode 100644
index 000000000..9321975b5
--- /dev/null
+++ b/depend/zcash/src/zcash/address/mnemonic.cpp
@@ -0,0 +1,68 @@
+// Copyright (c) 2018-2021 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "random.h"
+
+#include "mnemonic.h"
+#include "unified.h"
+
+using namespace libzcash;
+
+std::optional<MnemonicSeed> MnemonicSeed::FromEntropy(const RawHDSeed& entropy, uint32_t bip44CoinType, Language language) {
+    const char* phrase = zip339_entropy_to_phrase(language, entropy.data(), entropy.size());
+    SecureString mnemonic(phrase);
+    zip339_free_phrase(phrase);
+
+    // The phrase returned from zip339_entropy_to_phrase should always be a
+    // valid UTF-8 string; this `.value()` unwrap will correctly throw a
+    // `std::bad_optional_access` exception if that invariant does not hold.
+    auto seed = MnemonicSeed::ForPhrase(language, mnemonic).value();
+
+    // Verify that the seed data is valid entropy for unified spending keys at
+    // account 0 and at both the public & private chain levels for account 0x7FFFFFFF.
+    // It is not necessary to check for a valid diversified Sapling address at
+    // account 0x7FFFFFFF because derivation via the legacy path can simply search
+    // for a valid diversifier; unlike in the unified spending key case, diversifier
+    // indices don't need to line up with anything.
+    if (ZcashdUnifiedSpendingKey::ForAccount(seed, bip44CoinType, 0).has_value() &&
+        transparent::AccountKey::ForAccount(seed, bip44CoinType, ZCASH_LEGACY_ACCOUNT).has_value())  {
+        return seed;
+    } else {
+        return std::nullopt;
+    }
+}
+
+MnemonicSeed MnemonicSeed::Random(uint32_t bip44CoinType, Language language, size_t entropyLen)
+{
+    assert(entropyLen >= 32);
+    while (true) { // loop until we find usable entropy
+        RawHDSeed entropy(entropyLen, 0);
+        GetRandBytes(entropy.data(), entropyLen);
+
+        auto seed = MnemonicSeed::FromEntropy(entropy, bip44CoinType, language);
+        if (seed.has_value()) {
+            return seed.value();
+        }
+    }
+}
+
+MnemonicSeed MnemonicSeed::FromLegacySeed(const HDSeed& legacySeed, uint32_t bip44CoinType, Language language)
+{
+    auto rawSeed = legacySeed.RawSeed();
+    if (rawSeed.size() != 32) {
+        throw std::runtime_error("Mnemonic seed derivation is only supported for 32-byte legacy seeds.");
+    }
+
+    for (int nonce = 0; nonce < 256; nonce++) {
+        auto seed = MnemonicSeed::FromEntropy(rawSeed, bip44CoinType, language);
+        if (seed.has_value()) {
+            return seed.value();
+        } else {
+            rawSeed[0]++;
+        }
+    }
+
+    throw std::runtime_error("Failed to find a valid mnemonic seed that could be derived from the legacy seed.");
+}
+
diff --git a/depend/zcash/src/zcash/address/mnemonic.h b/depend/zcash/src/zcash/address/mnemonic.h
new file mode 100644
index 000000000..3b5ed7ed3
--- /dev/null
+++ b/depend/zcash/src/zcash/address/mnemonic.h
@@ -0,0 +1,119 @@
+// Copyright (c) 2021 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_ZCASH_ADDRESS_MNEMONIC_H
+#define ZCASH_ZCASH_ADDRESS_MNEMONIC_H
+
+#include "zip32.h"
+
+class MnemonicSeed: public HDSeed {
+private:
+    Language language;
+    SecureString mnemonic;
+
+    bool SetSeedFromMnemonic() {
+        seed.resize(64);
+        return zip339_phrase_to_seed(language, mnemonic.c_str(), (uint8_t (*)[64])seed.data());
+    }
+
+    MnemonicSeed() {}
+public:
+    static std::optional<MnemonicSeed> ForPhrase(Language languageIn, SecureString mnemonicIn) {
+        MnemonicSeed seed;
+        seed.language = languageIn;
+        seed.mnemonic = mnemonicIn;
+        if (seed.SetSeedFromMnemonic()) {
+            return seed;
+        } else {
+            return std::nullopt;
+        }
+    }
+
+    /**
+     * Randomly generate a new mnemonic seed. A SLIP-44 coin type is required to make it possible
+     * to check that the generated seed can produce valid transparent and unified addresses at account
+     * numbers 0x7FFFFFFF and 0x00 respectively.
+     */
+    static MnemonicSeed Random(uint32_t bip44CoinType, Language language = English, size_t entropyLen = 32);
+
+    static MnemonicSeed FromLegacySeed(const HDSeed& legacySeed, uint32_t bip44CoinType, Language language = English);
+
+    static std::optional<MnemonicSeed> FromEntropy(const RawHDSeed& entropy, uint32_t bip44CoinType, Language language = English);
+
+    static std::string LanguageName(Language language) {
+        switch (language) {
+            case English:
+                return "English";
+            case SimplifiedChinese:
+                return "Simplified Chinese";
+            case TraditionalChinese:
+                return "Traditional Chinese";
+            case Czech:
+                return "Czech";
+            case French:
+                return "French";
+            case Italian:
+                return "Italian";
+            case Japanese:
+                return "Japanese";
+            case Korean:
+                return "Korean";
+            case Portuguese:
+                return "Portuguese";
+            case Spanish:
+                return "Spanish";
+            default:
+                return "INVALID";
+        }
+    }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        if (ser_action.ForRead()) {
+            uint32_t language0;
+
+            READWRITE(language0);
+            READWRITE(mnemonic);
+            language = (Language) language0;
+            if (!SetSeedFromMnemonic()) {
+                throw std::ios_base::failure("Invalid mnemonic phrase or language code.");
+            }
+        } else {
+            uint32_t language0 = (uint32_t) language;
+
+            READWRITE(language0);
+            READWRITE(mnemonic);
+        }
+   }
+
+    template <typename Stream>
+    static MnemonicSeed Read(Stream& stream) {
+        MnemonicSeed seed;
+        stream >> seed;
+        return seed;
+    }
+
+    const Language GetLanguage() const {
+        return language;
+    }
+
+    const SecureString& GetMnemonic() const {
+        return mnemonic;
+    }
+
+    friend bool operator==(const MnemonicSeed& a, const MnemonicSeed& b)
+    {
+        return a.seed == b.seed;
+    }
+
+    friend bool operator!=(const MnemonicSeed& a, const MnemonicSeed& b)
+    {
+        return !(a == b);
+    }
+};
+
+#endif // ZCASH_ZCASH_ADDRESS_MNEMONIC_H
+
diff --git a/depend/zcash/src/zcash/address/orchard.cpp b/depend/zcash/src/zcash/address/orchard.cpp
new file mode 100644
index 000000000..95d32e26d
--- /dev/null
+++ b/depend/zcash/src/zcash/address/orchard.cpp
@@ -0,0 +1,73 @@
+// Copyright (c) 2021 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "zcash/address/orchard.hpp"
+
+namespace libzcash {
+
+OrchardRawAddress OrchardIncomingViewingKey::Address(const diversifier_index_t& j) const {
+    assert(inner.get() != nullptr);
+    return OrchardRawAddress(orchard_incoming_viewing_key_to_address(inner.get(), j.begin()));
+}
+
+std::optional<diversifier_index_t> OrchardIncomingViewingKey::DecryptDiversifier(const OrchardRawAddress& addr) const {
+    assert(inner.get() != nullptr);
+    diversifier_index_t j_ret;
+    if (orchard_incoming_viewing_key_decrypt_diversifier(inner.get(), addr.inner.get(), j_ret.begin())) {
+        return j_ret;
+    } else {
+        return std::nullopt;
+    }
+}
+
+OrchardIncomingViewingKey OrchardFullViewingKey::ToIncomingViewingKey() const {
+    assert(inner.get() != nullptr);
+    return OrchardIncomingViewingKey(orchard_full_viewing_key_to_incoming_viewing_key(inner.get()));
+}
+
+OrchardIncomingViewingKey OrchardFullViewingKey::ToInternalIncomingViewingKey() const {
+    assert(inner.get() != nullptr);
+    return OrchardIncomingViewingKey(orchard_full_viewing_key_to_internal_incoming_viewing_key(inner.get()));
+}
+
+uint256 OrchardFullViewingKey::ToExternalOutgoingViewingKey() const {
+    uint256 ovk;
+    orchard_full_viewing_key_to_external_outgoing_viewing_key(inner.get(), ovk.begin());
+    return ovk;
+}
+
+uint256 OrchardFullViewingKey::ToInternalOutgoingViewingKey() const {
+    uint256 ovk;
+    orchard_full_viewing_key_to_internal_outgoing_viewing_key(inner.get(), ovk.begin());
+    return ovk;
+}
+
+OrchardRawAddress OrchardFullViewingKey::GetChangeAddress() const {
+    return ToInternalIncomingViewingKey().Address(0);
+}
+
+OrchardSpendingKey OrchardSpendingKey::ForAccount(
+        const HDSeed& seed,
+        uint32_t bip44CoinType,
+        libzcash::AccountId accountId) {
+
+    auto ptr = orchard_spending_key_for_account(
+            seed.RawSeed().data(),
+            seed.RawSeed().size(),
+            bip44CoinType,
+            accountId);
+
+    if (ptr == nullptr) {
+        throw std::ios_base::failure("Unable to generate Orchard extended spending key.");
+    }
+
+    return OrchardSpendingKey(ptr);
+}
+
+OrchardFullViewingKey OrchardSpendingKey::ToFullViewingKey() const {
+    return OrchardFullViewingKey(orchard_spending_key_to_full_viewing_key(inner.get()));
+}
+
+} //namespace libzcash
+
diff --git a/depend/zcash/src/zcash/address/orchard.hpp b/depend/zcash/src/zcash/address/orchard.hpp
new file mode 100644
index 000000000..79788236c
--- /dev/null
+++ b/depend/zcash/src/zcash/address/orchard.hpp
@@ -0,0 +1,325 @@
+// Copyright (c) 2021 The Zcash Developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_ADDRESS_ORCHARD_H
+#define ZCASH_ADDRESS_ORCHARD_H
+
+#include "streams.h"
+#include "zcash/address/zip32.h"
+#include <rust/orchard/keys.h>
+
+#include <optional>
+
+class OrchardWallet;
+namespace orchard {
+    class Builder;
+    class UnauthorizedBundle;
+}
+
+namespace libzcash {
+
+class OrchardFullViewingKey;
+class OrchardIncomingViewingKey;
+class OrchardSpendingKey;
+
+class OrchardRawAddress
+{
+private:
+    std::unique_ptr<OrchardRawAddressPtr, decltype(&orchard_address_free)> inner;
+
+    OrchardRawAddress() : inner(nullptr, orchard_address_free) {}
+
+    OrchardRawAddress(OrchardRawAddressPtr* ptr) : inner(ptr, orchard_address_free) {}
+
+    friend class OrchardIncomingViewingKey;
+    friend class ::OrchardWallet;
+    friend class ::orchard::Builder;
+public:
+    static OrchardRawAddress KeyIoOnlyFromReceiver(OrchardRawAddressPtr* ptr) {
+        return OrchardRawAddress(ptr);
+    }
+
+    OrchardRawAddress(OrchardRawAddress&& key) : inner(std::move(key.inner)) {}
+
+    OrchardRawAddress(const OrchardRawAddress& key) :
+        inner(orchard_address_clone(key.inner.get()), orchard_address_free) {}
+
+    OrchardRawAddress& operator=(OrchardRawAddress&& key)
+    {
+        if (this != &key) {
+            inner = std::move(key.inner);
+        }
+        return *this;
+    }
+
+    OrchardRawAddress& operator=(const OrchardRawAddress& key)
+    {
+        if (this != &key) {
+            inner.reset(orchard_address_clone(key.inner.get()));
+        }
+        return *this;
+    }
+
+    friend bool operator==(const OrchardRawAddress& c1, const OrchardRawAddress& c2) {
+        return orchard_address_eq(c1.inner.get(), c2.inner.get());
+    }
+
+    friend bool operator<(const OrchardRawAddress& c1, const OrchardRawAddress& c2) {
+        return orchard_address_lt(c1.inner.get(), c2.inner.get());
+    }
+
+    template<typename Stream>
+    void Serialize(Stream& s) const {
+        RustStream rs(s);
+        if (!orchard_raw_address_serialize(inner.get(), &rs, RustStream<Stream>::write_callback)) {
+            throw std::ios_base::failure("Failed to serialize Orchard raw address to bytes");
+        }
+    }
+
+    template<typename Stream>
+    void Unserialize(Stream& s) {
+        RustStream rs(s);
+        OrchardRawAddressPtr* addr = orchard_raw_address_parse(&rs, RustStream<Stream>::read_callback);
+        if (addr == nullptr) {
+            throw std::ios_base::failure("Failed to parse Orchard raw address bytes");
+        }
+        inner.reset(addr);
+    }
+
+    template<typename Stream>
+    static OrchardRawAddress Read(Stream& stream) {
+        OrchardRawAddress key;
+        stream >> key;
+        return key;
+    }
+};
+
+class OrchardIncomingViewingKey
+{
+private:
+    std::unique_ptr<OrchardIncomingViewingKeyPtr, decltype(&orchard_incoming_viewing_key_free)> inner;
+
+    OrchardIncomingViewingKey(OrchardIncomingViewingKeyPtr* key) :
+        inner(key, orchard_incoming_viewing_key_free) {}
+
+    friend class OrchardFullViewingKey;
+    friend class OrchardSpendingKey;
+    friend class ::OrchardWallet;
+public:
+    // DO NOT USE - this is exposed for serialization purposes only.
+    OrchardIncomingViewingKey() :
+        inner(nullptr, orchard_incoming_viewing_key_free) {}
+
+    OrchardIncomingViewingKey(OrchardIncomingViewingKey&& key) : inner(std::move(key.inner)) {}
+
+    OrchardIncomingViewingKey(const OrchardIncomingViewingKey& key) :
+        inner(orchard_incoming_viewing_key_clone(key.inner.get()), orchard_incoming_viewing_key_free) {}
+
+    OrchardRawAddress Address(const diversifier_index_t& j) const;
+
+    /**
+     * Decrypts the diversifier for the given raw address, and returns it if that
+     * address was derived from this IVK; otherwise returns std::nullopt;
+     */
+    std::optional<diversifier_index_t> DecryptDiversifier(const OrchardRawAddress& addr) const;
+
+    OrchardIncomingViewingKey& operator=(OrchardIncomingViewingKey&& key)
+    {
+        if (this != &key) {
+            inner = std::move(key.inner);
+        }
+        return *this;
+    }
+
+    OrchardIncomingViewingKey& operator=(const OrchardIncomingViewingKey& key)
+    {
+        if (this != &key) {
+            inner.reset(orchard_incoming_viewing_key_clone(key.inner.get()));
+        }
+        return *this;
+    }
+
+    friend bool operator==(const OrchardIncomingViewingKey& a, const OrchardIncomingViewingKey& b)
+    {
+        assert(a.inner.get() != nullptr);
+        assert(b.inner.get() != nullptr);
+        return orchard_incoming_viewing_key_eq(a.inner.get(), b.inner.get());
+    }
+
+    friend bool operator<(const OrchardIncomingViewingKey& c1, const OrchardIncomingViewingKey& c2) {
+        assert(c1.inner.get() != nullptr);
+        assert(c2.inner.get() != nullptr);
+        return orchard_incoming_viewing_key_lt(c1.inner.get(), c2.inner.get());
+    }
+
+    template<typename Stream>
+    void Serialize(Stream& s) const {
+        assert(inner.get() != nullptr);
+        RustStream rs(s);
+        if (!orchard_incoming_viewing_key_serialize(inner.get(), &rs, RustStream<Stream>::write_callback)) {
+            throw std::ios_base::failure("Failed to serialize Orchard incoming viewing key");
+        }
+    }
+
+    template<typename Stream>
+    void Unserialize(Stream& s) {
+        RustStream rs(s);
+        OrchardIncomingViewingKeyPtr* key = orchard_incoming_viewing_key_parse(&rs, RustStream<Stream>::read_callback);
+        if (key == nullptr) {
+            throw std::ios_base::failure("Failed to parse Orchard incoming viewing key");
+        }
+        inner.reset(key);
+    }
+
+    template<typename Stream>
+    static OrchardIncomingViewingKey Read(Stream& stream) {
+        OrchardIncomingViewingKey key;
+        stream >> key;
+        return key;
+    }
+};
+
+class OrchardFullViewingKey
+{
+private:
+    std::unique_ptr<OrchardFullViewingKeyPtr, decltype(&orchard_full_viewing_key_free)> inner;
+
+    OrchardFullViewingKey() : inner(nullptr, orchard_full_viewing_key_free) {}
+
+    OrchardFullViewingKey(OrchardFullViewingKeyPtr* ptr) :
+        inner(ptr, orchard_full_viewing_key_free) {}
+
+    friend class OrchardSpendingKey;
+    friend class ::OrchardWallet;
+public:
+    OrchardFullViewingKey(OrchardFullViewingKey&& key) : inner(std::move(key.inner)) {}
+
+    OrchardFullViewingKey(const OrchardFullViewingKey& key) :
+        inner(orchard_full_viewing_key_clone(key.inner.get()), orchard_full_viewing_key_free) {}
+
+    OrchardIncomingViewingKey ToIncomingViewingKey() const;
+
+    OrchardIncomingViewingKey ToInternalIncomingViewingKey() const;
+
+    uint256 ToExternalOutgoingViewingKey() const;
+
+    uint256 ToInternalOutgoingViewingKey() const;
+
+    libzcash::OrchardRawAddress GetChangeAddress() const;
+
+    /**
+     * Extracts the diversifier from the specified address and decrypts it as
+     * a diversifier index, then verifies that this diversifier index produces
+     * the same address. This method attempts decryption using both the internal
+     * and external parts of the full viewing key.
+     *
+     * Returns a pair consisting of the diversifier index and a flag indicating
+     * whether the address is external (set to true in the case this is an external
+     * address), or std::nullopt if the address was not generated from this key.
+     */
+    std::optional<std::pair<diversifier_index_t, bool>> DecryptDiversifier(const OrchardRawAddress& addr) const {
+        auto j_external = ToIncomingViewingKey().DecryptDiversifier(addr);
+        if (j_external.has_value()) {
+            return std::make_pair(j_external.value(), true);
+        }
+        auto j_internal = ToInternalIncomingViewingKey().DecryptDiversifier(addr);
+        if (j_internal.has_value()) {
+            return std::make_pair(j_internal.value(), false);
+        }
+        return std::nullopt;
+    }
+
+    OrchardFullViewingKey& operator=(OrchardFullViewingKey&& key)
+    {
+        if (this != &key) {
+            inner = std::move(key.inner);
+        }
+        return *this;
+    }
+
+    OrchardFullViewingKey& operator=(const OrchardFullViewingKey& key)
+    {
+        if (this != &key) {
+            inner.reset(orchard_full_viewing_key_clone(key.inner.get()));
+        }
+        return *this;
+    }
+
+    friend bool operator==(const OrchardFullViewingKey& a, const OrchardFullViewingKey& b)
+    {
+        return orchard_full_viewing_key_eq(a.inner.get(), b.inner.get());
+    }
+
+    template<typename Stream>
+    void Serialize(Stream& s) const {
+        RustStream rs(s);
+        if (!orchard_full_viewing_key_serialize(inner.get(), &rs, RustStream<Stream>::write_callback)) {
+            throw std::ios_base::failure("Failed to serialize Orchard full viewing key");
+        }
+    }
+
+    template<typename Stream>
+    void Unserialize(Stream& s) {
+        RustStream rs(s);
+        OrchardFullViewingKeyPtr* key = orchard_full_viewing_key_parse(&rs, RustStream<Stream>::read_callback);
+        if (key == nullptr) {
+            throw std::ios_base::failure("Failed to parse Orchard full viewing key");
+        }
+        inner.reset(key);
+    }
+
+    template<typename Stream>
+    static OrchardFullViewingKey Read(Stream& stream) {
+        OrchardFullViewingKey key;
+        stream >> key;
+        return key;
+    }
+};
+
+class OrchardSpendingKey
+{
+private:
+    std::unique_ptr<OrchardSpendingKeyPtr, decltype(&orchard_spending_key_free)> inner;
+
+    OrchardSpendingKey() : inner(nullptr, orchard_spending_key_free) {}
+
+    OrchardSpendingKey(OrchardSpendingKeyPtr* ptr) :
+        inner(ptr, orchard_spending_key_free) {}
+
+    friend class orchard::UnauthorizedBundle;
+    friend class ::OrchardWallet;
+public:
+    OrchardSpendingKey(OrchardSpendingKey&& key) : inner(std::move(key.inner)) {}
+
+    OrchardSpendingKey(const OrchardSpendingKey& key) :
+        inner(orchard_spending_key_clone(key.inner.get()), orchard_spending_key_free) {}
+
+    static OrchardSpendingKey ForAccount(
+            const HDSeed& seed,
+            uint32_t bip44CoinType,
+            libzcash::AccountId accountId);
+
+    OrchardFullViewingKey ToFullViewingKey() const;
+
+    OrchardSpendingKey& operator=(OrchardSpendingKey&& key)
+    {
+        if (this != &key) {
+            inner = std::move(key.inner);
+        }
+        return *this;
+    }
+
+    OrchardSpendingKey& operator=(const OrchardSpendingKey& key)
+    {
+        if (this != &key) {
+            inner.reset(orchard_spending_key_clone(key.inner.get()));
+        }
+        return *this;
+    }
+};
+
+} // namespace libzcash
+
+#endif // ZCASH_ADDRESS_ORCHARD_H
+
diff --git a/depend/zcash/src/zcash/address/sapling.cpp b/depend/zcash/src/zcash/address/sapling.cpp
new file mode 100644
index 000000000..2a49f0461
--- /dev/null
+++ b/depend/zcash/src/zcash/address/sapling.cpp
@@ -0,0 +1,86 @@
+// Copyright (c) 2016-2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "zcash/address/sapling.hpp"
+
+#include "hash.h"
+#include "streams.h"
+#include "zcash/NoteEncryption.hpp"
+#include "zcash/prf.h"
+
+#include <librustzcash.h>
+
+namespace libzcash {
+
+const unsigned char ZCASH_SAPLING_FVFP_PERSONALIZATION[BLAKE2bPersonalBytes] =
+    {'Z', 'c', 'a', 's', 'h', 'S', 'a', 'p', 'l', 'i', 'n', 'g', 'F', 'V', 'F', 'P'};
+
+//! Sapling
+uint256 SaplingPaymentAddress::GetHash() const {
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << *this;
+    return Hash(ss.begin(), ss.end());
+}
+
+std::optional<SaplingPaymentAddress> SaplingIncomingViewingKey::address(diversifier_t d) const {
+    uint256 pk_d;
+    if (librustzcash_check_diversifier(d.data())) {
+        librustzcash_ivk_to_pkd(this->begin(), d.data(), pk_d.begin());
+        return SaplingPaymentAddress(d, pk_d);
+    } else {
+        return std::nullopt;
+    }
+}
+
+uint256 SaplingFullViewingKey::GetFingerprint() const {
+    CBLAKE2bWriter ss(SER_GETHASH, 0, ZCASH_SAPLING_FVFP_PERSONALIZATION);
+    ss << *this;
+    return ss.GetHash();
+}
+
+SaplingIncomingViewingKey SaplingFullViewingKey::in_viewing_key() const {
+    uint256 ivk;
+    librustzcash_crh_ivk(ak.begin(), nk.begin(), ivk.begin());
+    return SaplingIncomingViewingKey(ivk);
+}
+
+bool SaplingFullViewingKey::is_valid() const {
+    uint256 ivk;
+    librustzcash_crh_ivk(ak.begin(), nk.begin(), ivk.begin());
+    return !ivk.IsNull();
+}
+
+SaplingFullViewingKey SaplingExpandedSpendingKey::full_viewing_key() const {
+    uint256 ak;
+    uint256 nk;
+    librustzcash_ask_to_ak(ask.begin(), ak.begin());
+    librustzcash_nsk_to_nk(nsk.begin(), nk.begin());
+    return SaplingFullViewingKey(ak, nk, ovk);
+}
+
+SaplingSpendingKey SaplingSpendingKey::random() {
+    while (true) {
+        auto sk = SaplingSpendingKey(random_uint256());
+        if (sk.full_viewing_key().is_valid()) {
+            return sk;
+        }
+    }
+}
+
+SaplingExpandedSpendingKey SaplingSpendingKey::expanded_spending_key() const {
+    return SaplingExpandedSpendingKey(PRF_ask(*this), PRF_nsk(*this), PRF_ovk(*this));
+}
+
+SaplingFullViewingKey SaplingSpendingKey::full_viewing_key() const {
+    return expanded_spending_key().full_viewing_key();
+}
+
+SaplingPaymentAddress SaplingSpendingKey::default_address() const {
+    // Iterates within default_diversifier to ensure a valid address is returned
+    auto addrOpt = full_viewing_key().in_viewing_key().address(default_diversifier(*this));
+    assert(addrOpt != std::nullopt);
+    return addrOpt.value();
+}
+
+}
diff --git a/depend/zcash/src/zcash/address/sapling.hpp b/depend/zcash/src/zcash/address/sapling.hpp
new file mode 100644
index 000000000..9db3a605d
--- /dev/null
+++ b/depend/zcash/src/zcash/address/sapling.hpp
@@ -0,0 +1,142 @@
+// Copyright (c) 2016-2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZC_ADDRESS_SAPLING_H_
+#define ZC_ADDRESS_SAPLING_H_
+
+#include "serialize.h"
+#include "uint256.h"
+#include "zcash/Zcash.h"
+
+#include <optional>
+
+namespace libzcash {
+
+const size_t SerializedSaplingPaymentAddressSize = 43;
+const size_t SerializedSaplingFullViewingKeySize = 96;
+const size_t SerializedSaplingExpandedSpendingKeySize = 96;
+const size_t SerializedSaplingSpendingKeySize = 32;
+
+typedef std::array<unsigned char, ZC_DIVERSIFIER_SIZE> diversifier_t;
+
+//! Sapling functions.
+class SaplingPaymentAddress {
+public:
+    diversifier_t d;
+    uint256 pk_d;
+
+    SaplingPaymentAddress() : d(), pk_d() { }
+    SaplingPaymentAddress(diversifier_t d, uint256 pk_d) : d(d), pk_d(pk_d) { }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(d);
+        READWRITE(pk_d);
+    }
+
+    //! Get the 256-bit SHA256d hash of this payment address.
+    uint256 GetHash() const;
+
+    friend inline bool operator==(const SaplingPaymentAddress& a, const SaplingPaymentAddress& b) {
+        return a.d == b.d && a.pk_d == b.pk_d;
+    }
+    friend inline bool operator<(const SaplingPaymentAddress& a, const SaplingPaymentAddress& b) {
+        return (a.d < b.d ||
+                (a.d == b.d && a.pk_d < b.pk_d));
+    }
+};
+
+class SaplingIncomingViewingKey : public uint256 {
+public:
+    SaplingIncomingViewingKey() : uint256() { }
+    SaplingIncomingViewingKey(uint256 ivk) : uint256(ivk) { }
+
+    // Can pass in diversifier for Sapling addr
+    std::optional<SaplingPaymentAddress> address(diversifier_t d) const;
+};
+
+class SaplingFullViewingKey {
+public:
+    uint256 ak;
+    uint256 nk;
+    uint256 ovk;
+
+    SaplingFullViewingKey() : ak(), nk(), ovk() { }
+    SaplingFullViewingKey(uint256 ak, uint256 nk, uint256 ovk) : ak(ak), nk(nk), ovk(ovk) { }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(ak);
+        READWRITE(nk);
+        READWRITE(ovk);
+    }
+
+    //! Get the fingerprint of this full viewing key (as defined in ZIP 32).
+    uint256 GetFingerprint() const;
+
+    SaplingIncomingViewingKey in_viewing_key() const;
+    bool is_valid() const;
+
+    friend inline bool operator==(const SaplingFullViewingKey& a, const SaplingFullViewingKey& b) {
+        return a.ak == b.ak && a.nk == b.nk && a.ovk == b.ovk;
+    }
+    friend inline bool operator<(const SaplingFullViewingKey& a, const SaplingFullViewingKey& b) {
+        return (a.ak < b.ak ||
+            (a.ak == b.ak && a.nk < b.nk) ||
+            (a.ak == b.ak && a.nk == b.nk && a.ovk < b.ovk));
+    }
+};
+
+
+class SaplingExpandedSpendingKey {
+public:
+    uint256 ask;
+    uint256 nsk;
+    uint256 ovk;
+
+    SaplingExpandedSpendingKey() : ask(), nsk(), ovk() { }
+    SaplingExpandedSpendingKey(uint256 ask, uint256 nsk, uint256 ovk) : ask(ask), nsk(nsk), ovk(ovk) { }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(ask);
+        READWRITE(nsk);
+        READWRITE(ovk);
+    }
+
+    SaplingFullViewingKey full_viewing_key() const;
+
+    friend inline bool operator==(const SaplingExpandedSpendingKey& a, const SaplingExpandedSpendingKey& b) {
+        return a.ask == b.ask && a.nsk == b.nsk && a.ovk == b.ovk;
+    }
+    friend inline bool operator<(const SaplingExpandedSpendingKey& a, const SaplingExpandedSpendingKey& b) {
+        return (a.ask < b.ask ||
+            (a.ask == b.ask && a.nsk < b.nsk) ||
+            (a.ask == b.ask && a.nsk == b.nsk && a.ovk < b.ovk));
+    }
+};
+
+class SaplingSpendingKey : public uint256 {
+public:
+    SaplingSpendingKey() : uint256() { }
+    SaplingSpendingKey(uint256 sk) : uint256(sk) { }
+
+    static SaplingSpendingKey random();
+
+    SaplingExpandedSpendingKey expanded_spending_key() const;
+    SaplingFullViewingKey full_viewing_key() const;
+
+    // Can derive Sapling addr from default diversifier
+    SaplingPaymentAddress default_address() const;
+};
+
+} // namespace libzcash
+
+#endif // ZC_ADDRESS_SAPLING_H_
diff --git a/depend/zcash/src/zcash/address/sprout.cpp b/depend/zcash/src/zcash/address/sprout.cpp
new file mode 100644
index 000000000..468c9f21e
--- /dev/null
+++ b/depend/zcash/src/zcash/address/sprout.cpp
@@ -0,0 +1,44 @@
+// Copyright (c) 2016-2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "zcash/address/sprout.hpp"
+
+#include "hash.h"
+#include "streams.h"
+#include "zcash/NoteEncryption.hpp"
+#include "zcash/prf.h"
+
+namespace libzcash {
+
+uint256 SproutPaymentAddress::GetHash() const {
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << *this;
+    return Hash(ss.begin(), ss.end());
+}
+
+uint256 ReceivingKey::pk_enc() const {
+    return ZCNoteEncryption::generate_pubkey(*this);
+}
+
+SproutPaymentAddress SproutViewingKey::address() const {
+    return SproutPaymentAddress(a_pk, sk_enc.pk_enc());
+}
+
+ReceivingKey SproutSpendingKey::receiving_key() const {
+    return ReceivingKey(ZCNoteEncryption::generate_privkey(*this));
+}
+
+SproutViewingKey SproutSpendingKey::viewing_key() const {
+    return SproutViewingKey(PRF_addr_a_pk(*this), receiving_key());
+}
+
+SproutSpendingKey SproutSpendingKey::random() {
+    return SproutSpendingKey(random_uint252());
+}
+
+SproutPaymentAddress SproutSpendingKey::address() const {
+    return viewing_key().address();
+}
+
+} // namespace libzcash
diff --git a/depend/zcash/src/zcash/address/sprout.hpp b/depend/zcash/src/zcash/address/sprout.hpp
new file mode 100644
index 000000000..58be00d66
--- /dev/null
+++ b/depend/zcash/src/zcash/address/sprout.hpp
@@ -0,0 +1,95 @@
+// Copyright (c) 2016-2020 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZC_ADDRESS_SPROUT_H_
+#define ZC_ADDRESS_SPROUT_H_
+
+#include "serialize.h"
+#include "uint252.h"
+#include "uint256.h"
+
+namespace libzcash {
+
+const size_t SerializedSproutPaymentAddressSize = 64;
+const size_t SerializedSproutViewingKeySize = 64;
+const size_t SerializedSproutSpendingKeySize = 32;
+
+class SproutPaymentAddress {
+public:
+    uint256 a_pk;
+    uint256 pk_enc;
+
+    SproutPaymentAddress() : a_pk(), pk_enc() { }
+    SproutPaymentAddress(uint256 a_pk, uint256 pk_enc) : a_pk(a_pk), pk_enc(pk_enc) { }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(a_pk);
+        READWRITE(pk_enc);
+    }
+
+    //! Get the 256-bit SHA256d hash of this payment address.
+    uint256 GetHash() const;
+
+    friend inline bool operator==(const SproutPaymentAddress& a, const SproutPaymentAddress& b) {
+        return a.a_pk == b.a_pk && a.pk_enc == b.pk_enc;
+    }
+    friend inline bool operator<(const SproutPaymentAddress& a, const SproutPaymentAddress& b) {
+        return (a.a_pk < b.a_pk ||
+                (a.a_pk == b.a_pk && a.pk_enc < b.pk_enc));
+    }
+};
+
+class ReceivingKey : public uint256 {
+public:
+    ReceivingKey() { }
+    ReceivingKey(uint256 sk_enc) : uint256(sk_enc) { }
+
+    uint256 pk_enc() const;
+};
+
+class SproutViewingKey {
+public:
+    uint256 a_pk;
+    ReceivingKey sk_enc;
+
+    SproutViewingKey() : a_pk(), sk_enc() { }
+    SproutViewingKey(uint256 a_pk, ReceivingKey sk_enc) : a_pk(a_pk), sk_enc(sk_enc) { }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(a_pk);
+        READWRITE(sk_enc);
+    }
+
+    SproutPaymentAddress address() const;
+
+    friend inline bool operator==(const SproutViewingKey& a, const SproutViewingKey& b) {
+        return a.a_pk == b.a_pk && a.sk_enc == b.sk_enc;
+    }
+    friend inline bool operator<(const SproutViewingKey& a, const SproutViewingKey& b) {
+        return (a.a_pk < b.a_pk ||
+                (a.a_pk == b.a_pk && a.sk_enc < b.sk_enc));
+    }
+};
+
+class SproutSpendingKey : public uint252 {
+public:
+    SproutSpendingKey() : uint252() { }
+    SproutSpendingKey(uint252 a_sk) : uint252(a_sk) { }
+
+    static SproutSpendingKey random();
+
+    ReceivingKey receiving_key() const;
+    SproutViewingKey viewing_key() const;
+    SproutPaymentAddress address() const;
+};
+
+} // namespace libzcash
+
+#endif // ZC_ADDRESS_SPROUT_H_
diff --git a/depend/zcash/src/zcash/address/transparent.cpp b/depend/zcash/src/zcash/address/transparent.cpp
new file mode 100644
index 000000000..824debfe8
--- /dev/null
+++ b/depend/zcash/src/zcash/address/transparent.cpp
@@ -0,0 +1,122 @@
+// Copyright (c) 2021 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include <rust/unified_keys.h>
+
+#include "streams.h"
+#include "transparent.h"
+
+namespace libzcash {
+namespace transparent {
+
+std::optional<CPubKey> AccountPubKey::DeriveExternal(uint32_t addrIndex) const {
+    auto externalKey = pubkey.Derive(0);
+    if (!externalKey.has_value()) return std::nullopt;
+    auto childKey = externalKey.value().Derive(addrIndex);
+    if (!childKey.has_value()) return std::nullopt;
+    return childKey.value().GetPubKey();
+}
+
+std::optional<CPubKey> AccountPubKey::DeriveInternal(uint32_t addrIndex) const {
+    auto internalKey = pubkey.Derive(1);
+    if (!internalKey.has_value()) return std::nullopt;
+    auto childKey = internalKey.value().Derive(addrIndex);
+    if (!childKey.has_value()) return std::nullopt;
+    return childKey.value().GetPubKey();
+}
+
+std::optional<CKeyID> AccountPubKey::GetChangeAddress(const diversifier_index_t& j) const {
+    auto childIndex = j.ToTransparentChildIndex();
+    if (!childIndex.has_value()) return std::nullopt;
+
+    auto changeKey = this->DeriveInternal(childIndex.value());
+    if (!changeKey.has_value())  return std::nullopt;
+
+    return changeKey.value().GetID();
+}
+
+std::pair<uint256, uint256> AccountPubKey::GetOVKsForShielding() const {
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << pubkey;
+    assert(ss.size() == 65);
+    CSerializeData ss_bytes(ss.begin(), ss.end());
+
+    uint256 internalOVK;
+    uint256 externalOVK;
+
+    assert(transparent_key_ovks(
+        reinterpret_cast<unsigned char*>(ss_bytes.data()),
+        internalOVK.begin(),
+        externalOVK.begin()));
+
+    return std::make_pair(internalOVK, externalOVK);
+}
+
+std::optional<std::pair<CKeyID, diversifier_index_t>> AccountPubKey::FindChangeAddress(diversifier_index_t j) const {
+    while (true) {
+        auto childIndex = j.ToTransparentChildIndex();
+        if (!childIndex.has_value()) return std::nullopt;
+
+        auto changeKey = this->DeriveInternal(childIndex.value());
+        if (changeKey.has_value()) {
+            return std::make_pair(changeKey.value().GetID(), j);
+        } else {
+            j.increment();
+        }
+    }
+    return std::nullopt;
+}
+
+std::optional<AccountKey> AccountKey::ForAccount(
+        const HDSeed& seed,
+        uint32_t bip44CoinType,
+        AccountId accountId) {
+    auto rawSeed = seed.RawSeed();
+    auto m = CExtKey::Master(rawSeed.data(), rawSeed.size());
+    if (!m.has_value()) return std::nullopt;
+
+    // We use a fixed keypath scheme of m/44'/coin_type'/account'
+    // Derive m/44'
+    auto m_44h = m.value().Derive(44 | HARDENED_KEY_LIMIT);
+    if (!m_44h.has_value()) return std::nullopt;
+
+    // Derive m/44'/coin_type'
+    auto m_44h_cth = m_44h.value().Derive(bip44CoinType | HARDENED_KEY_LIMIT);
+    if (!m_44h_cth.has_value()) return std::nullopt;
+
+    // Derive m/44'/coin_type'/account_id'
+    auto accountKeyOpt = m_44h_cth.value().Derive(accountId | HARDENED_KEY_LIMIT);
+    if (!accountKeyOpt.has_value()) return std::nullopt;
+
+    auto accountKey = accountKeyOpt.value();
+    auto external = accountKey.Derive(0);
+    auto internal = accountKey.Derive(1);
+
+    if (!(external.has_value() && internal.has_value())) return std::nullopt;
+
+    return AccountKey(accountKey, external.value(), internal.value());
+}
+
+std::optional<CKey> AccountKey::DeriveExternalSpendingKey(uint32_t addrIndex) const {
+    auto childKey = external.Derive(addrIndex);
+    if (!childKey.has_value()) return std::nullopt;
+
+    return childKey.value().key;
+}
+
+std::optional<CKey> AccountKey::DeriveInternalSpendingKey(uint32_t addrIndex) const {
+    auto childKey = internal.Derive(addrIndex);
+    if (!childKey.has_value()) return std::nullopt;
+
+    return childKey.value().key;
+}
+
+AccountPubKey AccountKey::ToAccountPubKey() const {
+    // The .value() call is safe here because we never derive
+    // non-compressed public keys.
+    return accountKey.Neuter().ToChainablePubKey().value();
+}
+
+} //namespace transparent
+} //namespace libzcash
diff --git a/depend/zcash/src/zcash/address/transparent.h b/depend/zcash/src/zcash/address/transparent.h
new file mode 100644
index 000000000..dd8fd579d
--- /dev/null
+++ b/depend/zcash/src/zcash/address/transparent.h
@@ -0,0 +1,112 @@
+// Copyright (c) 2021 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_ZCASH_ADDRESS_TRANSPARENT_H
+#define ZCASH_ZCASH_ADDRESS_TRANSPARENT_H
+
+#include "zip32.h"
+
+namespace libzcash {
+namespace transparent {
+
+class AccountPubKey {
+private:
+    CChainablePubKey pubkey;
+public:
+    AccountPubKey(CChainablePubKey pubkey): pubkey(pubkey) {};
+
+    const CChainablePubKey& GetChainablePubKey() const {
+        return pubkey;
+    }
+
+    std::optional<CPubKey> DeriveExternal(uint32_t addrIndex) const;
+
+    std::optional<CPubKey> DeriveInternal(uint32_t addrIndex) const;
+
+    /**
+     * Return the transparent change address for this key a the given diversifier
+     * index, if that index is valid for a transparent address and if key
+     * derivation is successful.
+     */
+    std::optional<CKeyID> GetChangeAddress(const diversifier_index_t& j) const;
+
+    /**
+     * Search the space of valid child indices starting at the given index, and
+     * return the change address corresponding to the first index at which a
+     * valid address is derived, along with that index. This will always return
+     * a valid address unless the space of valid transparent child indices is
+     * exhausted or the provided diversifier index exceeds the maximum allowed
+     * non-hardened transparent child index.
+     */
+    std::optional<std::pair<CKeyID, diversifier_index_t>> FindChangeAddress(diversifier_index_t j) const;
+
+    /**
+     * Return the internal and external OVKs for shielding from transparent
+     * addresses derived from this key.
+     */
+    std::pair<uint256, uint256> GetOVKsForShielding() const;
+
+    friend bool operator==(const AccountPubKey& a, const AccountPubKey& b)
+    {
+        return a.pubkey == b.pubkey;
+    }
+};
+
+class AccountKey {
+private:
+    CExtKey accountKey;
+    CExtKey external;
+    CExtKey internal;
+
+    AccountKey(CExtKey accountKeyIn, CExtKey externalIn, CExtKey internalIn):
+        accountKey(accountKeyIn), external(externalIn), internal(internalIn) {}
+public:
+    static std::optional<AccountKey> ForAccount(
+            const HDSeed& mnemonic,
+            uint32_t bip44CoinType,
+            libzcash::AccountId accountId);
+
+    static HDKeyPath KeyPath(uint32_t bip44CoinType, libzcash::AccountId accountId) {
+        return
+            "m/44'/" +
+            std::to_string(bip44CoinType) + "'/" +
+            std::to_string(accountId) + "'";
+    }
+
+    static HDKeyPath KeyPath(uint32_t bip44CoinType, libzcash::AccountId accountId, bool external, uint32_t childIndex) {
+        return
+            AccountKey::KeyPath(bip44CoinType, accountId) + "/" +
+            (external ? "0/" : "1/") +
+            std::to_string(childIndex);
+    }
+
+    /**
+     * Generate the key corresponding to the specified index at the "external child"
+     * level of the TRANSPARENT path for the account.
+     */
+    std::optional<CKey> DeriveExternalSpendingKey(uint32_t addrIndex) const;
+
+    /**
+     * Generate the key corresponding to the specified index at the "internal child"
+     * level of the TRANSPARENT path for the account. This should probably only usually be
+     * used at address index 0, but ordinarily it won't need to be used at all since
+     * all change should be shielded by default.
+     */
+    std::optional<CKey> DeriveInternalSpendingKey(uint32_t addrIndex = 0) const;
+
+    /**
+     * Return the public key associated with this spending key.
+     */
+    AccountPubKey ToAccountPubKey() const;
+
+    friend bool operator==(const AccountKey& a, const AccountKey& b)
+    {
+        return a.accountKey == b.accountKey;
+    }
+};
+
+} //namespace transparent
+} //namespace libzcash
+
+#endif // ZCASH_ZCASH_ADDRESS_TRANSPARENT_H
diff --git a/depend/zcash/src/zcash/address/unified.cpp b/depend/zcash/src/zcash/address/unified.cpp
new file mode 100644
index 000000000..dd82feb51
--- /dev/null
+++ b/depend/zcash/src/zcash/address/unified.cpp
@@ -0,0 +1,257 @@
+// Copyright (c) 2021 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "tinyformat.h"
+#include "zcash/Address.hpp"
+#include "unified.h"
+#include "util/match.h"
+#include "utilstrencodings.h"
+
+#include <rust/unified_keys.h>
+
+using namespace libzcash;
+
+//
+// Unified Keys
+//
+
+bool libzcash::HasShielded(const std::set<ReceiverType>& receiverTypes) {
+    auto has_shielded = [](ReceiverType r) {
+        // TODO: update this as support for new shielded protocols is added.
+        return r == ReceiverType::Sapling || r == ReceiverType::Orchard;
+    };
+    return std::find_if(receiverTypes.begin(), receiverTypes.end(), has_shielded) != receiverTypes.end();
+}
+
+bool libzcash::HasTransparent(const std::set<ReceiverType>& receiverTypes) {
+    auto has_transparent = [](ReceiverType r) {
+        // TODO: update this as support for new transparent protocols is added.
+        return r == ReceiverType::P2PKH || r == ReceiverType::P2SH;
+    };
+    return std::find_if(receiverTypes.begin(), receiverTypes.end(), has_transparent) != receiverTypes.end();
+}
+
+Receiver libzcash::RecipientAddressToReceiver(const RecipientAddress& recipient) {
+    return std::visit(match {
+        [](const CKeyID& key) { return Receiver(key); },
+        [](const CScriptID& scriptId) { return Receiver(scriptId); },
+        [](const libzcash::OrchardRawAddress& addr) { return Receiver(addr); },
+        [](const libzcash::SaplingPaymentAddress& addr) { return Receiver(addr); }
+    }, recipient);
+}
+
+std::string libzcash::DebugPrintReceiver(const Receiver& receiver) {
+    return std::visit(match {
+        [&](const OrchardRawAddress &zaddr) {
+            CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+            ss << zaddr;
+            return tfm::format("Orchard(%s)", HexStr(ss.begin(), ss.end()));
+        },
+        [&](const SaplingPaymentAddress &zaddr) {
+            CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+            ss << zaddr;
+            return tfm::format("Sapling(%s)", HexStr(ss.begin(), ss.end()));
+        },
+        [&](const CScriptID &p2sh) {
+            return tfm::format("P2SH(%s)", p2sh.GetHex());
+        },
+        [&](const CKeyID &p2pkh) {
+            return tfm::format("P2PKH(%s)", p2pkh.GetHex());
+        },
+        [&](const UnknownReceiver &unknown) {
+            return tfm::format(
+                "Unknown(%x, %s)",
+                unknown.typecode,
+                HexStr(unknown.data.begin(), unknown.data.end()));
+        }
+    }, receiver);
+};
+
+std::string libzcash::DebugPrintRecipientAddress(const RecipientAddress& addr) {
+    return DebugPrintReceiver(RecipientAddressToReceiver(addr));
+}
+
+std::optional<ZcashdUnifiedSpendingKey> ZcashdUnifiedSpendingKey::ForAccount(
+        const HDSeed& seed,
+        uint32_t bip44CoinType,
+        AccountId accountId) {
+
+    auto transparentKey = transparent::AccountKey::ForAccount(seed, bip44CoinType, accountId);
+    if (!transparentKey.has_value()) return std::nullopt;
+
+    auto saplingKey = SaplingExtendedSpendingKey::ForAccount(seed, bip44CoinType, accountId);
+
+    auto orchardKey = OrchardSpendingKey::ForAccount(seed, bip44CoinType, accountId);
+
+    return ZcashdUnifiedSpendingKey(transparentKey.value(), saplingKey.first, orchardKey);
+}
+
+UnifiedFullViewingKey ZcashdUnifiedSpendingKey::ToFullViewingKey() const {
+    UnifiedFullViewingKeyBuilder builder;
+
+    builder.AddTransparentKey(transparentKey.ToAccountPubKey());
+    builder.AddSaplingKey(saplingKey.ToXFVK());
+    builder.AddOrchardKey(orchardKey.ToFullViewingKey());
+
+    // This call to .value() is safe as ZcashdUnifiedSpendingKey values are always
+    // constructed to contain all required components.
+    return builder.build().value();
+}
+
+ZcashdUnifiedFullViewingKey ZcashdUnifiedFullViewingKey::FromUnifiedFullViewingKey(
+        const KeyConstants& keyConstants,
+        const UnifiedFullViewingKey& ufvk) {
+    ZcashdUnifiedFullViewingKey result;
+    result.keyId = ufvk.GetKeyID(keyConstants);
+
+    auto transparentKey = ufvk.GetTransparentKey();
+    if (transparentKey.has_value()) {
+        result.transparentKey = transparentKey.value();
+    }
+
+    auto saplingKey = ufvk.GetSaplingKey();
+    if (saplingKey.has_value()) {
+        result.saplingKey = saplingKey.value();
+    }
+
+    auto orchardKey = ufvk.GetOrchardKey();
+    if (orchardKey.has_value()) {
+        result.orchardKey = orchardKey.value();
+    }
+
+    return result;
+}
+
+UnifiedAddressGenerationResult ZcashdUnifiedFullViewingKey::Address(
+        const diversifier_index_t& j,
+        const std::set<ReceiverType>& receiverTypes) const
+{
+    if (!HasShielded(receiverTypes)) {
+        return UnifiedAddressGenerationError::ShieldedReceiverNotFound;
+    }
+
+    if (receiverTypes.count(ReceiverType::P2SH) > 0) {
+        return UnifiedAddressGenerationError::ReceiverTypeNotAvailable;
+    }
+
+    UnifiedAddress ua;
+    if (receiverTypes.count(ReceiverType::Orchard) > 0) {
+        if (orchardKey.has_value()) {
+            ua.AddReceiver(orchardKey.value().ToIncomingViewingKey().Address(j));
+        } else {
+            return UnifiedAddressGenerationError::ReceiverTypeNotAvailable;
+        }
+    }
+
+    if (receiverTypes.count(ReceiverType::Sapling) > 0) {
+        if (saplingKey.has_value()) {
+            auto saplingAddress = saplingKey.value().Address(j);
+            if (saplingAddress.has_value()) {
+                ua.AddReceiver(saplingAddress.value());
+            } else {
+                return UnifiedAddressGenerationError::NoAddressForDiversifier;
+            }
+        } else {
+            return UnifiedAddressGenerationError::ReceiverTypeNotAvailable;
+        }
+    }
+
+    if (receiverTypes.count(ReceiverType::P2PKH) > 0) {
+        if (transparentKey.has_value()) {
+            const auto& tkey = transparentKey.value();
+
+            auto childIndex = j.ToTransparentChildIndex();
+            if (!childIndex.has_value()) return UnifiedAddressGenerationError::InvalidTransparentChildIndex;
+
+            auto externalPubkey = tkey.DeriveExternal(childIndex.value());
+            if (!externalPubkey.has_value()) return UnifiedAddressGenerationError::NoAddressForDiversifier;
+
+            ua.AddReceiver(externalPubkey.value().GetID());
+        } else {
+            return UnifiedAddressGenerationError::ReceiverTypeNotAvailable;
+        }
+    }
+
+    return std::make_pair(ua, j);
+}
+
+UnifiedAddressGenerationResult ZcashdUnifiedFullViewingKey::FindAddress(
+        const diversifier_index_t& j,
+        const std::set<ReceiverType>& receiverTypes) const {
+    diversifier_index_t j0(j);
+    bool hasTransparent = HasTransparent(receiverTypes);
+    do {
+        auto addr = Address(j0, receiverTypes);
+        if (addr != UnifiedAddressGenerationResult(UnifiedAddressGenerationError::NoAddressForDiversifier)) {
+            return addr;
+        }
+    } while (j0.increment());
+
+    return UnifiedAddressGenerationError::DiversifierSpaceExhausted;
+}
+
+UnifiedAddressGenerationResult ZcashdUnifiedFullViewingKey::FindAddress(
+        const diversifier_index_t& j) const {
+    return FindAddress(j, {ReceiverType::P2PKH, ReceiverType::Sapling, ReceiverType::Orchard});
+}
+
+std::optional<RecipientAddress> ZcashdUnifiedFullViewingKey::GetChangeAddress(const ChangeRequest& req) const {
+    std::optional<RecipientAddress> addr;
+    std::visit(match {
+        [&](const TransparentChangeRequest& req) {
+            if (transparentKey.has_value()) {
+                auto changeAddr = transparentKey.value().GetChangeAddress(req.GetIndex());
+                if (changeAddr.has_value()) {
+                    addr = changeAddr.value();
+                }
+            }
+        },
+        [&](const SaplingChangeRequest& req) {
+            if (saplingKey.has_value()) {
+                addr = saplingKey.value().GetChangeAddress();
+            }
+        },
+        [&](const OrchardChangeRequest& req) {
+            if (orchardKey.has_value()) {
+                addr = orchardKey.value().GetChangeAddress();
+            }
+        }
+    }, req);
+    return addr;
+}
+
+std::optional<RecipientAddress> ZcashdUnifiedFullViewingKey::GetChangeAddress(
+        const std::set<OutputPool>& allowedPools) const {
+    if (orchardKey.has_value() && allowedPools.count(OutputPool::Orchard) > 0) {
+        return orchardKey.value().GetChangeAddress();
+    }
+    if (saplingKey.has_value() && allowedPools.count(OutputPool::Sapling) > 0) {
+        return saplingKey.value().GetChangeAddress();
+    }
+    if (transparentKey.has_value() && allowedPools.count(OutputPool::Transparent) > 0) {
+        auto changeAddr = transparentKey.value().GetChangeAddress(diversifier_index_t(0));
+        if (changeAddr.has_value()) {
+            return changeAddr.value();
+        }
+    }
+    return std::nullopt;
+}
+
+UnifiedFullViewingKey ZcashdUnifiedFullViewingKey::ToFullViewingKey() const {
+    UnifiedFullViewingKeyBuilder builder;
+
+    if (transparentKey.has_value()) {
+        builder.AddTransparentKey(transparentKey.value());
+    }
+    if (saplingKey.has_value()) {
+        builder.AddSaplingKey(saplingKey.value());
+    }
+    if (orchardKey.has_value()) {
+        builder.AddOrchardKey(orchardKey.value());
+    }
+
+    // This call to .value() is safe as ZcashdUnifiedFullViewingKey values are always
+    // constructed to contain all required components.
+    return builder.build().value();
+}
diff --git a/depend/zcash/src/zcash/address/unified.h b/depend/zcash/src/zcash/address/unified.h
new file mode 100644
index 000000000..b9e648e61
--- /dev/null
+++ b/depend/zcash/src/zcash/address/unified.h
@@ -0,0 +1,291 @@
+// Copyright (c) 2021 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_ZCASH_ADDRESS_UNIFIED_H
+#define ZCASH_ZCASH_ADDRESS_UNIFIED_H
+
+#include "transparent.h"
+#include "key_constants.h"
+#include "script/script.h"
+#include "zcash/address/orchard.hpp"
+#include "zip32.h"
+
+#include <variant>
+
+namespace libzcash {
+
+// prototypes for the classes handling ZIP-316 encoding (in Address.hpp)
+// TODO: ZIP-316 encoding should probably be moved here
+class UnifiedAddress;
+class UnifiedFullViewingKey;
+
+enum class ReceiverType: uint32_t {
+    P2PKH = 0x00,
+    P2SH = 0x01,
+    Sapling = 0x02,
+    Orchard = 0x03
+};
+
+/**
+ * An enumeration of the fund pools for which a transaction may produce outputs.
+ * It is sorted in descending preference order, so that when iterating over a
+ * set of output pools the most-preferred pool is selected first.
+ */
+enum class OutputPool {
+    Orchard,
+    Sapling,
+    Transparent,
+};
+
+enum class UnifiedAddressGenerationError {
+    ShieldedReceiverNotFound,
+    ReceiverTypeNotAvailable,
+    NoAddressForDiversifier,
+    DiversifierSpaceExhausted,
+    InvalidTransparentChildIndex
+};
+
+typedef std::variant<
+    std::pair<UnifiedAddress, diversifier_index_t>,
+    UnifiedAddressGenerationError> UnifiedAddressGenerationResult;
+
+/** A recipient address to which a unified address can be resolved */
+typedef std::variant<
+    CKeyID,
+    CScriptID,
+    libzcash::SaplingPaymentAddress,
+    libzcash::OrchardRawAddress> RecipientAddress;
+
+std::string DebugPrintRecipientAddress(const RecipientAddress& add);
+
+class TransparentChangeRequest {
+private:
+    const diversifier_index_t& index;
+public:
+    TransparentChangeRequest(const diversifier_index_t& indexIn): index(indexIn) {}
+
+    const diversifier_index_t& GetIndex() const {
+        return index;
+    }
+};
+
+class SaplingChangeRequest {};
+class OrchardChangeRequest {};
+
+typedef std::variant<
+    TransparentChangeRequest,
+    SaplingChangeRequest,
+    OrchardChangeRequest> ChangeRequest;
+
+/**
+ * Test whether the specified list of receiver types contains a
+ * shielded receiver type
+ */
+bool HasShielded(const std::set<ReceiverType>& receiverTypes);
+
+/**
+ * Test whether the specified list of receiver types contains a
+ * shielded receiver type
+ */
+bool HasTransparent(const std::set<ReceiverType>& receiverTypes);
+
+class ZcashdUnifiedSpendingKey;
+
+class UnknownReceiver {
+public:
+    uint32_t typecode;
+    std::vector<uint8_t> data;
+
+    UnknownReceiver(uint32_t typecode, std::vector<uint8_t> data) :
+        typecode(typecode), data(data) {}
+
+    friend inline bool operator==(const UnknownReceiver& a, const UnknownReceiver& b) {
+        return a.typecode == b.typecode && a.data == b.data;
+    }
+    friend inline bool operator<(const UnknownReceiver& a, const UnknownReceiver& b) {
+        // We don't know for certain the preference order of unknown receivers, but it is
+        // _likely_ that the higher typecode has higher preference. The exact sort order
+        // doesn't really matter, as unknown receivers have lower preference than known
+        // receivers.
+        return (a.typecode > b.typecode ||
+                (a.typecode == b.typecode && a.data < b.data));
+    }
+};
+
+/**
+ * Receivers that can appear in a Unified Address.
+ *
+ * These types are given in order of preference (as defined in ZIP 316), so that sorting
+ * variants by `operator<` is equivalent to sorting by preference.
+ */
+typedef std::variant<
+    OrchardRawAddress,
+    SaplingPaymentAddress,
+    CScriptID,
+    CKeyID,
+    UnknownReceiver> Receiver;
+
+Receiver RecipientAddressToReceiver(const RecipientAddress& recipient);
+
+std::string DebugPrintReceiver(const Receiver& receiver);
+
+/**
+ * An internal identifier for a unified full viewing key, derived as a
+ * blake2b hash of the serialized form of the UFVK.
+ */
+class UFVKId: public uint256 {
+public:
+    UFVKId() : uint256() {}
+    UFVKId(const uint256& in) : uint256(in) {}
+};
+
+/**
+ * An internal-only type for unified full viewing keys that represents only the
+ * set of receiver types that are supported by zcashd. This type does not
+ * support round-trip serialization to and from the UnifiedFullViewingKey type,
+ * which should be used in most cases.
+ */
+class ZcashdUnifiedFullViewingKey {
+private:
+    UFVKId keyId;
+    std::optional<transparent::AccountPubKey> transparentKey;
+    std::optional<SaplingDiversifiableFullViewingKey> saplingKey;
+    std::optional<OrchardFullViewingKey> orchardKey;
+
+    ZcashdUnifiedFullViewingKey() {}
+
+    friend class ZcashdUnifiedSpendingKey;
+public:
+    /**
+     * This constructor is lossy; it ignores unknown receiver types
+     * and therefore does not support round-trip transformations.
+     */
+    static ZcashdUnifiedFullViewingKey FromUnifiedFullViewingKey(
+            const KeyConstants& keyConstants,
+            const UnifiedFullViewingKey& ufvk);
+
+    const UFVKId& GetKeyID() const {
+        return keyId;
+    }
+
+    /**
+     * Return the transparent key at the account level;
+     */
+    const std::optional<transparent::AccountPubKey>& GetTransparentKey() const {
+        return transparentKey;
+    }
+
+    const std::optional<SaplingDiversifiableFullViewingKey>& GetSaplingKey() const {
+        return saplingKey;
+    }
+
+    const std::optional<OrchardFullViewingKey>& GetOrchardKey() const {
+        return orchardKey;
+    }
+
+    /**
+     * Creates a new unified address having the specified receiver types, at the specified
+     * diversifier index, unless the diversifer index would generate an invalid receiver.
+     * Returns UnifiedAddressGenerationError::NoAddressForDiversifier if the diversifier
+     * index does not produce a valid receiver for one or more of the specified receiver
+     * types; under this circumstance, the caller should usually try successive diversifier
+     * indices until the operation returns a valid address. Returns
+     * `UnifiedAddressGenerationError::InvalidTransparentChildIndex` if a transparent
+     * receiver was requested but the specified diversifier was out of range.
+     *
+     * If successful in deriving an address, this method returns a `UnifiedAddressGenerationResult`
+     * holding a pair consisting of the newly derived address and the provided value `j`.
+     */
+    UnifiedAddressGenerationResult Address(
+            const diversifier_index_t& j,
+            const std::set<ReceiverType>& receiverTypes) const;
+
+    /**
+     * Find the smallest diversifier index >= `j` such that it generates a valid
+     * unified address according to the conditions specified in the documentation
+     * for the `Address` method above, and returns the newly created address along
+     * with the diversifier index used to produce it.
+     *
+     * Returns UnifiedAddressGenerationError::NoAddressForDiversifier if the
+     * diversifier space is exhausted, or if the set of receiver types contains a
+     * transparent receiver and the diversifier exceeds the maximum transparent
+     * child index.
+     */
+    UnifiedAddressGenerationResult FindAddress(
+            const diversifier_index_t& j,
+            const std::set<ReceiverType>& receiverTypes) const;
+
+    /**
+     * Find the next available address that contains all supported receiver types.
+     */
+    UnifiedAddressGenerationResult FindAddress(const diversifier_index_t& j) const;
+
+    /**
+     * Return the change address for this UFVK, given the provided
+     * set of receiver types for pools involved in this transaction.
+     * If the provided set is empty, return the change address
+     * corresponding to the most-preferred pool. Returns `std::nullopt`
+     * if the request cannot be satisfied; for example, if a transparent
+     * change address is requested but derivation fails for the requested
+     * child index, or if the set of requested protocols does not intersect
+     * with those supported by the this UFVKs constituent keys.
+     */
+    std::optional<RecipientAddress> GetChangeAddress(const ChangeRequest& req) const;
+
+    /**
+     * Return the "best available" change address. This returns `std::nullopt`
+     * only in the case of derivation failure for all key types. This will only
+     * return a transparent change address under highly exceptional
+     * circumstances, (i.e. it was not possible to derive a change address for
+     * *any* shielded pool) in which case the change address returned will be
+     * associated with diversifier index 0.
+     */
+    std::optional<RecipientAddress> GetChangeAddress(const std::set<OutputPool>& allowedPools) const;
+
+    UnifiedFullViewingKey ToFullViewingKey() const;
+
+    friend bool operator==(const ZcashdUnifiedFullViewingKey& a, const ZcashdUnifiedFullViewingKey& b)
+    {
+        return a.transparentKey == b.transparentKey && a.saplingKey == b.saplingKey;
+    }
+};
+
+/**
+ * The type of unified spending keys supported by zcashd.
+ */
+class ZcashdUnifiedSpendingKey {
+private:
+    transparent::AccountKey transparentKey;
+    SaplingExtendedSpendingKey saplingKey;
+    OrchardSpendingKey orchardKey;
+
+    ZcashdUnifiedSpendingKey(
+            transparent::AccountKey tkey,
+            SaplingExtendedSpendingKey skey,
+            OrchardSpendingKey okey): transparentKey(tkey), saplingKey(skey), orchardKey(okey) {}
+public:
+    static std::optional<ZcashdUnifiedSpendingKey> ForAccount(
+            const HDSeed& seed,
+            uint32_t bip44CoinType,
+            libzcash::AccountId accountId);
+
+    const transparent::AccountKey& GetTransparentKey() const {
+        return transparentKey;
+    }
+
+    const SaplingExtendedSpendingKey& GetSaplingKey() const {
+        return saplingKey;
+    }
+
+    const OrchardSpendingKey& GetOrchardKey() const {
+        return orchardKey;
+    }
+
+    UnifiedFullViewingKey ToFullViewingKey() const;
+};
+
+} //namespace libzcash
+
+#endif // ZCASH_ZCASH_ADDRESS_UNIFIED_H
+
diff --git a/depend/zcash/src/zcash/address/zip32.cpp b/depend/zcash/src/zcash/address/zip32.cpp
new file mode 100644
index 000000000..026dfc389
--- /dev/null
+++ b/depend/zcash/src/zcash/address/zip32.cpp
@@ -0,0 +1,298 @@
+// Copyright (c) 2018-2021 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "zip32.h"
+
+#include "hash.h"
+#include "random.h"
+#include "streams.h"
+#include "version.h"
+#include "zcash/prf.h"
+
+#include <librustzcash.h>
+#include <rust/blake2b.h>
+
+const unsigned char ZCASH_HD_SEED_FP_PERSONAL[BLAKE2bPersonalBytes] =
+    {'Z', 'c', 'a', 's', 'h', '_', 'H', 'D', '_', 'S', 'e', 'e', 'd', '_', 'F', 'P'};
+
+const unsigned char ZCASH_TADDR_OVK_PERSONAL[BLAKE2bPersonalBytes] =
+    {'Z', 'c', 'T', 'a', 'd', 'd', 'r', 'T', 'o', 'S', 'a', 'p', 'l', 'i', 'n', 'g'};
+
+uint256 HDSeed::Fingerprint() const
+{
+    CBLAKE2bWriter h(SER_GETHASH, 0, ZCASH_HD_SEED_FP_PERSONAL);
+    h << seed;
+    return h.GetHash();
+}
+
+uint256 ovkForShieldingFromTaddr(HDSeed& seed) {
+    auto rawSeed = seed.RawSeed();
+
+    // I = BLAKE2b-512("ZcTaddrToSapling", seed)
+    auto state = blake2b_init(64, ZCASH_TADDR_OVK_PERSONAL);
+    blake2b_update(state, rawSeed.data(), rawSeed.size());
+    auto intermediate = std::array<unsigned char, 64>();
+    blake2b_finalize(state, intermediate.data(), 64);
+    blake2b_free(state);
+
+    // I_L = I[0..32]
+    uint256 intermediate_L;
+    memcpy(intermediate_L.begin(), intermediate.data(), 32);
+
+    // ovk = truncate_32(PRF^expand(I_L, [0x02]))
+    return PRF_ovk(intermediate_L);
+}
+
+namespace libzcash {
+
+std::optional<uint32_t> diversifier_index_t::ToTransparentChildIndex() const {
+    // ensure that the diversifier index is small enough for a t-addr
+    if (MAX_TRANSPARENT_CHILD_IDX < *this) {
+        return std::nullopt;
+    } else {
+        return (uint32_t) GetUint64(0);
+    }
+}
+
+//
+// SaplingExtendedFullViewingKey
+//
+
+std::optional<SaplingExtendedFullViewingKey> SaplingExtendedFullViewingKey::Derive(uint32_t i) const
+{
+    CDataStream ss_p(SER_NETWORK, PROTOCOL_VERSION);
+    ss_p << *this;
+    CSerializeData p_bytes(ss_p.begin(), ss_p.end());
+
+    CSerializeData i_bytes(ZIP32_XFVK_SIZE);
+    if (librustzcash_zip32_sapling_xfvk_derive(
+        reinterpret_cast<unsigned char*>(p_bytes.data()),
+        i,
+        reinterpret_cast<unsigned char*>(i_bytes.data())
+    )) {
+        CDataStream ss_i(i_bytes, SER_NETWORK, PROTOCOL_VERSION);
+        SaplingExtendedFullViewingKey xfvk_i;
+        ss_i >> xfvk_i;
+        return xfvk_i;
+    } else {
+        return std::nullopt;
+    }
+}
+
+//
+// SaplingDiversifiableFullViewingKey
+//
+
+std::optional<libzcash::SaplingPaymentAddress>
+    SaplingDiversifiableFullViewingKey::Address(diversifier_index_t j) const
+{
+    CDataStream ss_fvk(SER_NETWORK, PROTOCOL_VERSION);
+    ss_fvk << fvk;
+    CSerializeData fvk_bytes(ss_fvk.begin(), ss_fvk.end());
+
+    CSerializeData addr_bytes(libzcash::SerializedSaplingPaymentAddressSize);
+    if (librustzcash_zip32_sapling_address(
+        reinterpret_cast<unsigned char*>(fvk_bytes.data()),
+        dk.begin(),
+        j.begin(),
+        reinterpret_cast<unsigned char*>(addr_bytes.data()))) {
+        CDataStream ss_addr(addr_bytes, SER_NETWORK, PROTOCOL_VERSION);
+        libzcash::SaplingPaymentAddress addr;
+        ss_addr >> addr;
+        return addr;
+    } else {
+        return std::nullopt;
+    }
+}
+
+libzcash::SaplingPaymentAddress SaplingDiversifiableFullViewingKey::DefaultAddress() const
+{
+    CDataStream ss_fvk(SER_NETWORK, PROTOCOL_VERSION);
+    ss_fvk << fvk;
+    CSerializeData fvk_bytes(ss_fvk.begin(), ss_fvk.end());
+
+    diversifier_index_t j_default;
+    diversifier_index_t j_ret;
+    CSerializeData addr_bytes_ret(libzcash::SerializedSaplingPaymentAddressSize);
+    if (librustzcash_zip32_find_sapling_address(
+        reinterpret_cast<unsigned char*>(fvk_bytes.data()),
+        dk.begin(),
+        j_default.begin(), j_ret.begin(),
+        reinterpret_cast<unsigned char*>(addr_bytes_ret.data()))) {
+        CDataStream ss_addr(addr_bytes_ret, SER_NETWORK, PROTOCOL_VERSION);
+        libzcash::SaplingPaymentAddress addr;
+        ss_addr >> addr;
+        return addr;
+    } else {
+        // If we can't obtain a default address, we are *very* unlucky...
+        throw std::runtime_error("SaplingDiversifiableFullViewingKey::DefaultAddress(): No valid diversifiers out of 2^88!");
+    }
+}
+
+libzcash::SaplingDiversifiableFullViewingKey SaplingDiversifiableFullViewingKey::GetInternalDFVK() const {
+    CDataStream ss_fvk(SER_NETWORK, PROTOCOL_VERSION);
+    ss_fvk << fvk;
+    CSerializeData fvk_bytes(ss_fvk.begin(), ss_fvk.end());
+
+    SaplingDiversifiableFullViewingKey internalDFVK;
+    CSerializeData fvk_bytes_ret(libzcash::SerializedSaplingFullViewingKeySize);
+    librustzcash_zip32_sapling_derive_internal_fvk(
+        reinterpret_cast<unsigned char*>(fvk_bytes.data()),
+        dk.begin(),
+        reinterpret_cast<unsigned char*>(fvk_bytes_ret.data()),
+        internalDFVK.dk.begin());
+
+    CDataStream ss_fvk_ret(fvk_bytes_ret, SER_NETWORK, PROTOCOL_VERSION);
+    ss_fvk_ret >> internalDFVK.fvk;
+    return internalDFVK;
+}
+
+libzcash::SaplingIncomingViewingKey SaplingDiversifiableFullViewingKey::GetChangeIVK() const {
+    auto internalDFVK = this->GetInternalDFVK();
+    return internalDFVK.fvk.in_viewing_key();
+}
+
+libzcash::SaplingPaymentAddress SaplingDiversifiableFullViewingKey::GetChangeAddress() const {
+    auto internalDFVK = this->GetInternalDFVK();
+    return internalDFVK.DefaultAddress();
+}
+
+std::pair<uint256, uint256> SaplingDiversifiableFullViewingKey::GetOVKs() const {
+    return std::make_pair(this->GetInternalDFVK().fvk.ovk, fvk.ovk);
+}
+
+//
+// SaplingExtendedSpendingKey
+//
+
+SaplingExtendedSpendingKey SaplingExtendedSpendingKey::Master(const HDSeed& seed)
+{
+    auto rawSeed = seed.RawSeed();
+    CSerializeData m_bytes(ZIP32_XSK_SIZE);
+    librustzcash_zip32_sapling_xsk_master(
+        rawSeed.data(),
+        rawSeed.size(),
+        reinterpret_cast<unsigned char*>(m_bytes.data()));
+
+    CDataStream ss(m_bytes, SER_NETWORK, PROTOCOL_VERSION);
+    SaplingExtendedSpendingKey xsk_m;
+    ss >> xsk_m;
+    return xsk_m;
+}
+
+SaplingExtendedSpendingKey SaplingExtendedSpendingKey::Derive(uint32_t i) const
+{
+    CDataStream ss_p(SER_NETWORK, PROTOCOL_VERSION);
+    ss_p << *this;
+    CSerializeData p_bytes(ss_p.begin(), ss_p.end());
+
+    CSerializeData i_bytes(ZIP32_XSK_SIZE);
+    librustzcash_zip32_sapling_xsk_derive(
+        reinterpret_cast<unsigned char*>(p_bytes.data()),
+        i,
+        reinterpret_cast<unsigned char*>(i_bytes.data()));
+
+    CDataStream ss_i(i_bytes, SER_NETWORK, PROTOCOL_VERSION);
+    SaplingExtendedSpendingKey xsk_i;
+    ss_i >> xsk_i;
+    return xsk_i;
+}
+
+std::pair<SaplingExtendedSpendingKey, HDKeyPath> SaplingExtendedSpendingKey::ForAccount(const HDSeed& seed, uint32_t bip44CoinType, libzcash::AccountId accountId) {
+    auto m = Master(seed);
+
+    // We use a fixed keypath scheme of m/32'/coin_type'/account'
+    // Derive m/32'
+    auto m_32h = m.Derive(32 | HARDENED_KEY_LIMIT);
+    // Derive m/32'/coin_type'
+    auto m_32h_cth = m_32h.Derive(bip44CoinType | HARDENED_KEY_LIMIT);
+
+    // Derive account key at the given account index
+    auto xsk = m_32h_cth.Derive(accountId | HARDENED_KEY_LIMIT);
+
+    return std::make_pair(xsk, libzcash::Zip32AccountKeyPath(bip44CoinType, accountId));
+}
+
+std::pair<SaplingExtendedSpendingKey, HDKeyPath> SaplingExtendedSpendingKey::Legacy(const HDSeed& seed, uint32_t bip44CoinType, uint32_t addressIndex) {
+    auto m = Master(seed);
+
+    // We use a fixed keypath scheme of m/32'/coin_type'/0x7FFFFFFF'/addressIndex'
+    // This is not a "standard" path, but instead is a predictable location for
+    // legacy zcashd-derived keys that is minimally different from the UA account
+    // path, while unlikely to collide with normal UA account usage.
+
+    // Derive m/32'
+    auto m_32h = m.Derive(32 | HARDENED_KEY_LIMIT);
+    // Derive m/32'/coin_type'
+    auto m_32h_cth = m_32h.Derive(bip44CoinType | HARDENED_KEY_LIMIT);
+
+    // Derive account key at the legacy account index
+    auto m_32h_cth_l = m_32h_cth.Derive(ZCASH_LEGACY_ACCOUNT | HARDENED_KEY_LIMIT);
+
+    // Derive key at the specified address index
+    auto xsk = m_32h_cth_l.Derive(addressIndex | HARDENED_KEY_LIMIT);
+
+    return std::make_pair(xsk, libzcash::Zip32AccountKeyPath(bip44CoinType, ZCASH_LEGACY_ACCOUNT, addressIndex));
+}
+
+SaplingExtendedFullViewingKey SaplingExtendedSpendingKey::ToXFVK() const
+{
+    SaplingExtendedFullViewingKey ret;
+    ret.depth = depth;
+    ret.parentFVKTag = parentFVKTag;
+    ret.childIndex = childIndex;
+    ret.chaincode = chaincode;
+    ret.fvk = expsk.full_viewing_key();
+    ret.dk = dk;
+    return ret;
+}
+
+SaplingExtendedSpendingKey SaplingExtendedSpendingKey::DeriveInternalKey() const {
+    CDataStream ss_p(SER_NETWORK, PROTOCOL_VERSION);
+    ss_p << *this;
+    CSerializeData external_key_bytes(ss_p.begin(), ss_p.end());
+
+    CSerializeData internal_key_bytes(ZIP32_XSK_SIZE);
+    librustzcash_zip32_sapling_xsk_derive_internal(
+        reinterpret_cast<unsigned char*>(external_key_bytes.data()),
+        reinterpret_cast<unsigned char*>(internal_key_bytes.data()));
+
+    CDataStream ss_i(internal_key_bytes, SER_NETWORK, PROTOCOL_VERSION);
+    SaplingExtendedSpendingKey xsk_internal;
+    ss_i >> xsk_internal;
+    return xsk_internal;
+}
+
+HDKeyPath Zip32AccountKeyPath(
+        uint32_t bip44CoinType,
+        libzcash::AccountId accountId,
+        std::optional<uint32_t> legacyAddressIndex) {
+    HDKeyPath addrSuffix = "";
+    if (legacyAddressIndex.has_value()) {
+        addrSuffix = "/" + std::to_string(legacyAddressIndex.value()) + "'";
+    }
+    return "m/32'/" + std::to_string(bip44CoinType) + "'/" + std::to_string(accountId) + "'" + addrSuffix;
+}
+
+std::optional<unsigned long> ParseHDKeypathAccount(uint32_t purpose, uint32_t coinType, const std::string& keyPath) {
+    std::regex pattern("m/" + std::to_string(purpose)  + "'/" + std::to_string(coinType) + "'/([0-9]+)'.*");
+    std::smatch matches;
+    if (std::regex_match(keyPath, matches, pattern)) {
+        return stoul(matches[1]);
+    } else {
+        return std::nullopt;
+    }
+}
+
+bool IsInternalKeyPath(uint32_t purpose, uint32_t coinType, const std::string& keyPath) {
+    std::regex pattern("m/" + std::to_string(purpose)  + "'/" + std::to_string(coinType) + "'/[0-9]+'/([01])/.*");
+    std::smatch matches;
+    if (std::regex_match(keyPath, matches, pattern)) {
+        return stoul(matches[1]) == 1;
+    } else {
+        return false;
+    }
+}
+
+} //namespace libzcash
diff --git a/depend/zcash/src/zcash/address/zip32.h b/depend/zcash/src/zcash/address/zip32.h
new file mode 100644
index 000000000..cbb0fe399
--- /dev/null
+++ b/depend/zcash/src/zcash/address/zip32.h
@@ -0,0 +1,329 @@
+// Copyright (c) 2018-2021 The Zcash developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef ZCASH_ZCASH_ADDRESS_ZIP32_H
+#define ZCASH_ZCASH_ADDRESS_ZIP32_H
+
+#include "serialize.h"
+#include "key.h"
+#include "support/allocators/secure.h"
+#include "uint256.h"
+#include "utiltime.h"
+#include "zcash/address/sapling.hpp"
+#include <librustzcash.h>
+#include <rust/zip339.h>
+
+#include <optional>
+#include <string>
+#include <regex>
+
+// The minimum value for BIP-32 or ZIP-32 hardened key path element
+const uint32_t HARDENED_KEY_LIMIT = 0x80000000;
+const size_t ZIP32_XFVK_SIZE = 169;
+const size_t ZIP32_XSK_SIZE = 169;
+
+typedef std::vector<unsigned char, secure_allocator<unsigned char>> RawHDSeed;
+
+typedef std::string HDKeyPath;
+
+class HDSeed {
+protected:
+    RawHDSeed seed;
+
+    HDSeed() {}
+public:
+    HDSeed(RawHDSeed& seedIn) : seed(seedIn) {}
+
+    template <typename Stream>
+    static HDSeed ReadLegacy(Stream& stream) {
+        RawHDSeed rawSeed;
+        stream >> rawSeed;
+        HDSeed seed(rawSeed);
+        return seed;
+    }
+
+    uint256 Fingerprint() const;
+    RawHDSeed RawSeed() const { return seed; }
+
+    friend bool operator==(const HDSeed& a, const HDSeed& b)
+    {
+        return a.seed == b.seed;
+    }
+
+    friend bool operator!=(const HDSeed& a, const HDSeed& b)
+    {
+        return !(a == b);
+    }
+};
+
+
+// This is not part of ZIP 32, but is here because it's linked to the HD seed.
+uint256 ovkForShieldingFromTaddr(HDSeed& seed);
+
+namespace libzcash {
+
+typedef uint256 SeedFingerprint;
+typedef uint32_t AccountId;
+
+/**
+ * The account identifier used for HD derivation of
+ * transparent and Sapling addresses via the legacy
+ * `getnewaddress` and `z_getnewaddress` code paths,
+ */
+const AccountId ZCASH_LEGACY_ACCOUNT = HARDENED_KEY_LIMIT - 1;
+
+/**
+ * 88-bit diversifier index. This would ideally derive from base_uint
+ * but those values must have bit widths that are multiples of 32.
+ */
+class diversifier_index_t : public base_blob<88> {
+public:
+    diversifier_index_t() {}
+    diversifier_index_t(const base_blob<88>& b) : base_blob<88>(b) {}
+    diversifier_index_t(uint64_t i): base_blob<88>() {
+        data[0] = i & 0xFF;
+        data[1] = (i >> 8) & 0xFF;
+        data[2] = (i >> 16) & 0xFF;
+        data[3] = (i >> 24) & 0xFF;
+        data[4] = (i >> 32) & 0xFF;
+        data[5] = (i >> 40) & 0xFF;
+        data[6] = (i >> 48) & 0xFF;
+        data[7] = (i >> 56) & 0xFF;
+    }
+    explicit diversifier_index_t(const std::vector<unsigned char>& vch) : base_blob<88>(vch) {}
+
+    bool increment() {
+        for (int i = 0; i < 11; i++) {
+            this->data[i] += 1;
+            if (this->data[i] != 0) {
+                return true; // no overflow
+            }
+        }
+
+        return false; //overflow
+    }
+
+    std::optional<diversifier_index_t> succ() const {
+        diversifier_index_t next(*this);
+        if (next.increment()) {
+            return next;
+        } else {
+            return std::nullopt;
+        }
+    }
+
+    std::optional<uint32_t> ToTransparentChildIndex() const;
+
+    friend bool operator<(const diversifier_index_t& a, const diversifier_index_t& b) {
+        for (int i = 10; i >= 0; i--) {
+            if (a.data[i] == b.data[i]) {
+                continue;
+            } else {
+                return a.data[i] < b.data[i];
+            }
+        }
+
+        return false;
+    }
+};
+
+// The maximum allowed transparent child index according to BIP-44
+const libzcash::diversifier_index_t MAX_TRANSPARENT_CHILD_IDX(0x7FFFFFFF);
+
+class SaplingDiversifiableFullViewingKey {
+protected:
+    SaplingDiversifiableFullViewingKey GetInternalDFVK() const;
+
+    diversifier_index_t DecryptDiversifier(const diversifier_t& d) const {
+        diversifier_index_t j;
+        librustzcash_sapling_diversifier_index(dk.begin(), d.begin(), j.begin());
+        return j;
+    }
+public:
+    libzcash::SaplingFullViewingKey fvk;
+    uint256 dk;
+
+    // Attempts to construct a valid payment address with diversifier index
+    // `j`; returns std::nullopt if `j` does not result in a valid diversifier
+    // given this xfvk.
+    std::optional<libzcash::SaplingPaymentAddress> Address(diversifier_index_t j) const;
+
+    // Returns the first index starting from j that generates a valid
+    // payment address, along with the corresponding address. Throws
+    // a runtime error if the diversifier space is exhausted.
+    std::pair<SaplingPaymentAddress, diversifier_index_t> FindAddress(diversifier_index_t j) const {
+        auto addr = Address(j);
+        while (!addr.has_value()) {
+            if (!j.increment())
+                throw std::runtime_error(std::string(__func__) + ": diversifier index overflow.");;
+            addr = Address(j);
+        }
+        return std::make_pair(addr.value(), j);
+    }
+
+    libzcash::SaplingIncomingViewingKey ToIncomingViewingKey() const {
+        return fvk.in_viewing_key();
+    }
+
+    libzcash::SaplingPaymentAddress DefaultAddress() const;
+
+    libzcash::SaplingIncomingViewingKey GetChangeIVK() const;
+    libzcash::SaplingPaymentAddress GetChangeAddress() const;
+
+    /**
+     * Returns the (internal, external) OVKs for shielded spends
+     * from the associated spend authority.
+     */
+    std::pair<uint256, uint256> GetOVKs() const;
+
+    // Attempts to construct a valid internal payment address with diversifier
+    // index `j`; returns std::nullopt if `j` does not result in a valid diversifier
+    // given this xfvk.
+    std::optional<libzcash::SaplingPaymentAddress> InternalAddress(diversifier_index_t j) const {
+        return GetInternalDFVK().Address(j);
+    }
+
+    /**
+     * Extracts the diversifier from the specified address and decrypts it as
+     * a diversifier index, then verifies that this diversifier index produces
+     * the same address. This method attempts decryption using both the internal
+     * and external parts of the full viewing key.
+     *
+     * Returns a pair consisting of the diversifier index and a flag indicating
+     * whether the address is external (set to true in the case this is an external
+     * address), or std::nullopt if the address was not generated from this key.
+     */
+    std::optional<std::pair<diversifier_index_t, bool>> DecryptDiversifier(const SaplingPaymentAddress& addr) const {
+        auto j_external = DecryptDiversifier(addr.d);
+        auto addr_external = Address(j_external);
+        if (addr_external.has_value() && addr_external.value() == addr) {
+            return std::make_pair(j_external, true);
+        }
+
+        auto dfvk_internal = GetInternalDFVK();
+        auto j_internal = dfvk_internal.DecryptDiversifier(addr.d);
+        auto addr_internal = dfvk_internal.Address(j_internal);
+        if (addr_internal.has_value() && addr_internal.value() == addr) {
+            return std::make_pair(j_internal, false);
+        }
+        return std::nullopt;
+    }
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(fvk);
+        READWRITE(dk);
+    }
+
+    template <typename Stream>
+    static SaplingDiversifiableFullViewingKey Read(Stream& stream) {
+        SaplingDiversifiableFullViewingKey key;
+        stream >> key;
+        return key;
+    }
+
+    friend inline bool operator==(const SaplingDiversifiableFullViewingKey& a, const SaplingDiversifiableFullViewingKey& b) {
+        return (a.fvk == b.fvk && a.dk == b.dk);
+    }
+
+};
+
+class SaplingExtendedFullViewingKey: public SaplingDiversifiableFullViewingKey {
+public:
+    uint8_t depth;
+    uint32_t parentFVKTag;
+    uint32_t childIndex;
+    uint256 chaincode;
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(depth);
+        READWRITE(parentFVKTag);
+        READWRITE(childIndex);
+        READWRITE(chaincode);
+        READWRITE(fvk);
+        READWRITE(dk);
+    }
+
+    std::optional<SaplingExtendedFullViewingKey> Derive(uint32_t i) const;
+
+    friend inline bool operator==(const SaplingExtendedFullViewingKey& a, const SaplingExtendedFullViewingKey& b) {
+        return (
+            a.depth == b.depth &&
+            a.parentFVKTag == b.parentFVKTag &&
+            a.childIndex == b.childIndex &&
+            a.chaincode == b.chaincode &&
+            a.fvk == b.fvk &&
+            a.dk == b.dk);
+    }
+    friend inline bool operator<(const SaplingExtendedFullViewingKey& a, const SaplingExtendedFullViewingKey& b) {
+        return (a.depth < b.depth ||
+            (a.depth == b.depth && a.childIndex < b.childIndex) ||
+            (a.depth == b.depth && a.childIndex == b.childIndex && a.fvk < b.fvk));
+    }
+};
+
+struct SaplingExtendedSpendingKey {
+    uint8_t depth;
+    uint32_t parentFVKTag;
+    uint32_t childIndex;
+    uint256 chaincode;
+    libzcash::SaplingExpandedSpendingKey expsk;
+    uint256 dk;
+
+    ADD_SERIALIZE_METHODS;
+
+    template <typename Stream, typename Operation>
+    inline void SerializationOp(Stream& s, Operation ser_action) {
+        READWRITE(depth);
+        READWRITE(parentFVKTag);
+        READWRITE(childIndex);
+        READWRITE(chaincode);
+        READWRITE(expsk);
+        READWRITE(dk);
+    }
+
+    static SaplingExtendedSpendingKey Master(const HDSeed& seed);
+    static std::pair<SaplingExtendedSpendingKey, HDKeyPath> ForAccount(const HDSeed& seed, uint32_t bip44CoinType, libzcash::AccountId accountId);
+    static std::pair<SaplingExtendedSpendingKey, HDKeyPath> Legacy(const HDSeed& seed, uint32_t bip44CoinType, uint32_t addressIndex);
+
+    SaplingExtendedSpendingKey Derive(uint32_t i) const;
+
+    SaplingExtendedFullViewingKey ToXFVK() const;
+
+    SaplingExtendedSpendingKey DeriveInternalKey() const;
+
+    friend bool operator==(const SaplingExtendedSpendingKey& a, const SaplingExtendedSpendingKey& b)
+    {
+        return a.depth == b.depth &&
+            a.parentFVKTag == b.parentFVKTag &&
+            a.childIndex == b.childIndex &&
+            a.chaincode == b.chaincode &&
+            a.expsk == b.expsk &&
+            a.dk == b.dk;
+    }
+};
+
+HDKeyPath Zip32AccountKeyPath(
+        uint32_t bip44CoinType,
+        libzcash::AccountId accountId,
+        std::optional<uint32_t> legacyAddressIndex = std::nullopt);
+
+std::optional<unsigned long> ParseHDKeypathAccount(
+        uint32_t purpose,
+        uint32_t coinType,
+        const std::string& keyPath);
+
+bool IsInternalKeyPath(
+        uint32_t purpose,
+        uint32_t coinType,
+        const std::string& keyPath);
+
+} //namespace libzcash
+
+#endif // ZCASH_ZCASH_ADDRESS_ZIP32_H
diff --git a/depend/zcash/src/zcash/prf.cpp b/depend/zcash/src/zcash/prf.cpp
new file mode 100644
index 000000000..49c178e59
--- /dev/null
+++ b/depend/zcash/src/zcash/prf.cpp
@@ -0,0 +1,154 @@
+#include "prf.h"
+#include "crypto/sha256.h"
+#include "hash.h"
+
+#include <array>
+#include <librustzcash.h>
+#include <rust/blake2b.h>
+
+const unsigned char ZCASH_EXPANDSEED_PERSONALIZATION[BLAKE2bPersonalBytes] = {'Z','c','a','s','h','_','E','x','p','a','n','d','S','e','e','d'};
+
+// Sapling 
+std::array<unsigned char, 64> PRF_expand(const uint256& sk, unsigned char t)
+{
+    std::array<unsigned char, 64> res;   
+    unsigned char blob[33];
+
+    memcpy(&blob[0], sk.begin(), 32);
+    blob[32] = t;
+
+    auto state = blake2b_init(64, ZCASH_EXPANDSEED_PERSONALIZATION);
+    blake2b_update(state, blob, 33);
+    blake2b_finalize(state, res.data(), 64);
+    blake2b_free(state);
+
+    return res;
+}
+
+uint256 PRF_rcm(const uint256& rseed)
+{
+    uint256 rcm;
+    auto tmp = PRF_expand(rseed, PRF_RCM_TAG);
+    librustzcash_to_scalar(tmp.data(), rcm.begin());
+    return rcm;
+}
+
+uint256 PRF_esk(const uint256& rseed)
+{
+    uint256 esk;
+    auto tmp = PRF_expand(rseed, PRF_ESK_TAG);
+    librustzcash_to_scalar(tmp.data(), esk.begin());
+    return esk;
+}
+
+uint256 PRF_ask(const uint256& sk)
+{
+    uint256 ask;
+    auto tmp = PRF_expand(sk, PRF_ASK_TAG);
+    librustzcash_to_scalar(tmp.data(), ask.begin());
+    return ask;
+}
+
+uint256 PRF_nsk(const uint256& sk)
+{
+    uint256 nsk;
+    auto tmp = PRF_expand(sk, PRF_NSK_TAG);
+    librustzcash_to_scalar(tmp.data(), nsk.begin());
+    return nsk;
+}
+
+uint256 PRF_ovk(const uint256& sk)
+{
+    uint256 ovk;
+    auto tmp = PRF_expand(sk, PRF_OVK_TAG);
+    memcpy(ovk.begin(), tmp.data(), 32);
+    return ovk;
+}
+
+std::array<unsigned char, 11> default_diversifier(const uint256& sk)
+{
+    std::array<unsigned char, 11> res;   
+    unsigned char blob[34];
+
+    memcpy(&blob[0], sk.begin(), 32);
+    blob[32] = 3;
+    
+    blob[33] = 0;
+    while (true) {
+        auto state = blake2b_init(64, ZCASH_EXPANDSEED_PERSONALIZATION);
+        blake2b_update(state, blob, 34);
+        blake2b_finalize(state, res.data(), 11);
+        blake2b_free(state);
+
+        if (librustzcash_check_diversifier(res.data())) {
+            break;
+        } else if (blob[33] == 255) {
+            throw std::runtime_error("librustzcash_check_diversifier did not return valid diversifier");
+        }
+        blob[33] += 1;
+    }
+        
+    return res;
+}
+
+// Sprout
+uint256 PRF(bool a, bool b, bool c, bool d,
+            const uint252& x,
+            const uint256& y)
+{
+    uint256 res;
+    unsigned char blob[64];
+
+    memcpy(&blob[0], x.begin(), 32);
+    memcpy(&blob[32], y.begin(), 32);
+
+    blob[0] &= 0x0F;
+    blob[0] |= (a ? 1 << 7 : 0) | (b ? 1 << 6 : 0) | (c ? 1 << 5 : 0) | (d ? 1 << 4 : 0);
+
+    CSHA256 hasher;
+    hasher.Write(blob, 64);
+    hasher.FinalizeNoPadding(res.begin());
+
+    return res;
+}
+
+uint256 PRF_addr(const uint252& a_sk, unsigned char t)
+{
+    uint256 y;
+    *(y.begin()) = t;
+
+    return PRF(1, 1, 0, 0, a_sk, y);
+}
+
+uint256 PRF_addr_a_pk(const uint252& a_sk)
+{
+    return PRF_addr(a_sk, 0);
+}
+
+uint256 PRF_addr_sk_enc(const uint252& a_sk)
+{
+    return PRF_addr(a_sk, 1);
+}
+
+uint256 PRF_nf(const uint252& a_sk, const uint256& rho)
+{
+    return PRF(1, 1, 1, 0, a_sk, rho);
+}
+
+uint256 PRF_pk(const uint252& a_sk, size_t i0, const uint256& h_sig)
+{
+    if ((i0 != 0) && (i0 != 1)) {
+        throw std::domain_error("PRF_pk invoked with index out of bounds");
+    }
+
+    return PRF(0, i0, 0, 0, a_sk, h_sig);
+}
+
+uint256 PRF_rho(const uint252& phi, size_t i0, const uint256& h_sig)
+{
+    if ((i0 != 0) && (i0 != 1)) {
+        throw std::domain_error("PRF_rho invoked with index out of bounds");
+    }
+
+    return PRF(0, i0, 1, 0, phi, h_sig);
+}
diff --git a/depend/zcash/src/zcash/prf.h b/depend/zcash/src/zcash/prf.h
new file mode 100644
index 000000000..63b379e45
--- /dev/null
+++ b/depend/zcash/src/zcash/prf.h
@@ -0,0 +1,36 @@
+/*
+Zcash uses SHA256Compress as a PRF for various components
+within the zkSNARK circuit.
+*/
+
+#ifndef ZCASH_ZCASH_PRF_H
+#define ZCASH_ZCASH_PRF_H
+
+#include "uint256.h"
+#include "uint252.h"
+
+#include <array>
+
+//! Sprout functions
+uint256 PRF_addr_a_pk(const uint252& a_sk);
+uint256 PRF_addr_sk_enc(const uint252& a_sk);
+uint256 PRF_nf(const uint252& a_sk, const uint256& rho);
+uint256 PRF_pk(const uint252& a_sk, size_t i0, const uint256& h_sig);
+uint256 PRF_rho(const uint252& phi, size_t i0, const uint256& h_sig);
+
+//! Sapling functions
+uint256 PRF_ask(const uint256& sk);
+uint256 PRF_nsk(const uint256& sk);
+uint256 PRF_ovk(const uint256& sk);
+uint256 PRF_rcm(const uint256& rseed);
+uint256 PRF_esk(const uint256& rseed);
+
+const char PRF_ASK_TAG = 0;
+const char PRF_NSK_TAG = 1;
+const char PRF_OVK_TAG = 2;
+const char PRF_RCM_TAG = 4;
+const char PRF_ESK_TAG = 5;
+
+std::array<unsigned char, 11> default_diversifier(const uint256& sk);
+
+#endif // ZCASH_ZCASH_PRF_H
diff --git a/depend/zcash/src/zcash/util.cpp b/depend/zcash/src/zcash/util.cpp
new file mode 100644
index 000000000..d4e6dbe49
--- /dev/null
+++ b/depend/zcash/src/zcash/util.cpp
@@ -0,0 +1,45 @@
+#include "zcash/util.h"
+#include <algorithm>
+#include <stdexcept>
+
+std::vector<unsigned char> convertIntToVectorLE(const uint64_t val_int) {
+    std::vector<unsigned char> bytes;
+
+    for(size_t i = 0; i < 8; i++) {
+        bytes.push_back((unsigned char) (val_int >> (i * 8)));
+    }
+
+    return bytes;
+}
+
+// Convert bytes into boolean vector. (MSB to LSB)
+std::vector<bool> convertBytesVectorToVector(const std::vector<unsigned char>& bytes) {
+    std::vector<bool> ret;
+    ret.resize(bytes.size() * 8);
+
+    unsigned char c;
+    for (size_t i = 0; i < bytes.size(); i++) {
+        c = bytes.at(i);
+        for (size_t j = 0; j < 8; j++) {
+            ret.at((i*8)+j) = (c >> (7-j)) & 1;
+        }
+    }
+
+    return ret;
+}
+
+// Convert boolean vector (big endian) to integer
+uint64_t convertVectorToInt(const std::vector<bool>& v) {
+    if (v.size() > 64) {
+        throw std::length_error ("boolean vector can't be larger than 64 bits");
+    }
+
+    uint64_t result = 0;
+    for (size_t i=0; i<v.size();i++) {
+        if (v.at(i)) {
+            result |= (uint64_t)1 << ((v.size() - 1) - i);
+        }
+    }
+
+    return result;
+}
diff --git a/depend/zcash/src/zcash/util.h b/depend/zcash/src/zcash/util.h
new file mode 100644
index 000000000..e2f094455
--- /dev/null
+++ b/depend/zcash/src/zcash/util.h
@@ -0,0 +1,11 @@
+#ifndef ZCASH_ZCASH_UTIL_H
+#define ZCASH_ZCASH_UTIL_H
+
+#include <vector>
+#include <cstdint>
+
+std::vector<unsigned char> convertIntToVectorLE(const uint64_t val_int);
+std::vector<bool> convertBytesVectorToVector(const std::vector<unsigned char>& bytes);
+uint64_t convertVectorToInt(const std::vector<bool>& v);
+
+#endif // ZCASH_ZCASH_UTIL_H
diff --git a/depend/zcash/src/zcbenchmarks.cpp b/depend/zcash/src/zcbenchmarks.cpp
new file mode 100644
index 000000000..65dfec8ad
--- /dev/null
+++ b/depend/zcash/src/zcbenchmarks.cpp
@@ -0,0 +1,767 @@
+#include <cstdio>
+#include <future>
+#include <map>
+#include <thread>
+#include <unistd.h>
+
+#include "coins.h"
+#include "util.h"
+#include "init.h"
+#include "primitives/transaction.h"
+#include "base58.h"
+#include "crypto/equihash.h"
+#include "chain.h"
+#include "chainparams.h"
+#include "consensus/upgrades.h"
+#include "consensus/validation.h"
+#include "main.h"
+#include "miner.h"
+#include "policy/policy.h"
+#include "pow.h"
+#include "proof_verifier.h"
+#include "random.h"
+#include "rpc/server.h"
+#include "script/sign.h"
+#include "streams.h"
+#include "transaction_builder.h"
+#include "txdb.h"
+#include "utiltest.h"
+#include "wallet/wallet.h"
+
+#include "zcbenchmarks.h"
+
+#include "zcash/Zcash.h"
+#include "zcash/IncrementalMerkleTree.hpp"
+#include "zcash/Note.hpp"
+#include "librustzcash.h"
+
+#include <rust/ed25519/types.h>
+
+using namespace libzcash;
+// This method is based on Shutdown from init.cpp
+void pre_wallet_load()
+{
+    LogPrintf("%s: In progress...\n", __func__);
+    if (ShutdownRequested())
+        throw new std::runtime_error("The node is shutting down");
+
+    if (pwalletMain)
+        pwalletMain->Flush(false);
+#ifdef ENABLE_MINING
+    GenerateBitcoins(false, 0, Params());
+#endif
+    UnregisterNodeSignals(GetNodeSignals());
+    if (pwalletMain)
+        pwalletMain->Flush(true);
+
+    UnregisterValidationInterface(pwalletMain);
+    delete pwalletMain;
+    pwalletMain = NULL;
+    bitdb.Reset();
+    RegisterNodeSignals(GetNodeSignals());
+    LogPrintf("%s: done\n", __func__);
+}
+
+void post_wallet_load(){
+    RegisterValidationInterface(pwalletMain);
+#ifdef ENABLE_MINING
+    // Generate coins in the background
+    if (pwalletMain || !GetArg("-mineraddress", "").empty())
+        GenerateBitcoins(GetBoolArg("-gen", false), GetArg("-genproclimit", 1), Params());
+#endif
+}
+
+
+void timer_start(timeval &tv_start)
+{
+    gettimeofday(&tv_start, 0);
+}
+
+double timer_stop(timeval &tv_start)
+{
+    double elapsed;
+    struct timeval tv_end;
+    gettimeofday(&tv_end, 0);
+    elapsed = double(tv_end.tv_sec-tv_start.tv_sec) +
+        (tv_end.tv_usec-tv_start.tv_usec)/double(1000000);
+    return elapsed;
+}
+
+double benchmark_sleep()
+{
+    struct timeval tv_start;
+    timer_start(tv_start);
+    sleep(1);
+    return timer_stop(tv_start);
+}
+
+double benchmark_create_joinsplit()
+{
+    Ed25519VerificationKey joinSplitPubKey;
+
+    /* Get the anchor of an empty commitment tree. */
+    uint256 anchor = SproutMerkleTree().root();
+    std::array<libzcash::JSInput, ZC_NUM_JS_INPUTS> inputs({JSInput(), JSInput()});
+    std::array<libzcash::JSOutput, ZC_NUM_JS_OUTPUTS> outputs({JSOutput(), JSOutput()});
+
+    struct timeval tv_start;
+    timer_start(tv_start);
+    auto jsdesc = JSDescriptionInfo(joinSplitPubKey,
+                         anchor,
+                         inputs,
+                         outputs,
+                         0,
+                         0).BuildDeterministic();
+    double ret = timer_stop(tv_start);
+
+    auto verifier = ProofVerifier::Strict();
+    assert(verifier.VerifySprout(jsdesc, joinSplitPubKey));
+    return ret;
+}
+
+std::vector<double> benchmark_create_joinsplit_threaded(int nThreads)
+{
+    std::vector<double> ret;
+    std::vector<std::future<double>> tasks;
+    std::vector<std::thread> threads;
+    for (int i = 0; i < nThreads; i++) {
+        std::packaged_task<double(void)> task(&benchmark_create_joinsplit);
+        tasks.emplace_back(task.get_future());
+        threads.emplace_back(std::move(task));
+    }
+    std::future_status status;
+    for (auto it = tasks.begin(); it != tasks.end(); it++) {
+        it->wait();
+        ret.push_back(it->get());
+    }
+    for (auto it = threads.begin(); it != threads.end(); it++) {
+        it->join();
+    }
+    return ret;
+}
+
+double benchmark_verify_joinsplit(const JSDescription &joinsplit)
+{
+    struct timeval tv_start;
+    timer_start(tv_start);
+    Ed25519VerificationKey joinSplitPubKey;
+    auto verifier = ProofVerifier::Strict();
+    verifier.VerifySprout(joinsplit, joinSplitPubKey);
+    return timer_stop(tv_start);
+}
+
+#ifdef ENABLE_MINING
+double benchmark_solve_equihash()
+{
+    CBlock pblock;
+    CEquihashInput I{pblock};
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << I;
+
+    const Consensus::Params& params = Params(CBaseChainParams::MAIN).GetConsensus();
+    unsigned int n = params.nEquihashN;
+    unsigned int k = params.nEquihashK;
+    eh_HashState eh_state;
+    EhInitialiseState(n, k, eh_state);
+    eh_state.Update((unsigned char*)&ss[0], ss.size());
+
+    uint256 nonce = GetRandHash();
+    eh_state.Update(nonce.begin(), nonce.size());
+
+    struct timeval tv_start;
+    timer_start(tv_start);
+    std::set<std::vector<unsigned int>> solns;
+    EhOptimisedSolveUncancellable(n, k, eh_state,
+                                  [](std::vector<unsigned char> soln) { return false; });
+    return timer_stop(tv_start);
+}
+
+std::vector<double> benchmark_solve_equihash_threaded(int nThreads)
+{
+    std::vector<double> ret;
+    std::vector<std::future<double>> tasks;
+    std::vector<std::thread> threads;
+    for (int i = 0; i < nThreads; i++) {
+        std::packaged_task<double(void)> task(&benchmark_solve_equihash);
+        tasks.emplace_back(task.get_future());
+        threads.emplace_back(std::move(task));
+    }
+    std::future_status status;
+    for (auto it = tasks.begin(); it != tasks.end(); it++) {
+        it->wait();
+        ret.push_back(it->get());
+    }
+    for (auto it = threads.begin(); it != threads.end(); it++) {
+        it->join();
+    }
+    return ret;
+}
+#endif // ENABLE_MINING
+
+double benchmark_verify_equihash()
+{
+    CChainParams params = Params(CBaseChainParams::MAIN);
+    CBlock genesis = params.GenesisBlock();
+    CBlockHeader genesis_header = genesis.GetBlockHeader();
+    struct timeval tv_start;
+    timer_start(tv_start);
+    CheckEquihashSolution(&genesis_header, params.GetConsensus());
+    return timer_stop(tv_start);
+}
+
+double benchmark_large_tx(size_t nInputs)
+{
+    // Create priv/pub key
+    CKey priv = CKey::TestOnlyRandomKey(true);
+    auto pub = priv.GetPubKey();
+    CBasicKeyStore tempKeystore;
+    tempKeystore.AddKey(priv);
+
+    // The "original" transaction that the spending transaction will spend
+    // from.
+    CMutableTransaction m_orig_tx;
+    m_orig_tx.vout.resize(1);
+    m_orig_tx.vout[0].nValue = 1000000;
+    CScript prevPubKey = GetScriptForDestination(pub.GetID());
+    m_orig_tx.vout[0].scriptPubKey = prevPubKey;
+
+    auto orig_tx = CTransaction(m_orig_tx);
+
+    CMutableTransaction spending_tx;
+    spending_tx.fOverwintered = true;
+    spending_tx.nVersionGroupId = SAPLING_VERSION_GROUP_ID;
+    spending_tx.nVersion = SAPLING_TX_VERSION;
+
+    auto input_hash = orig_tx.GetHash();
+    std::vector<CTxOut> allPrevOutputs;
+    // Add nInputs inputs
+    for (size_t i = 0; i < nInputs; i++) {
+        spending_tx.vin.emplace_back(input_hash, 0);
+        allPrevOutputs.push_back(orig_tx.vout[0]);
+    }
+
+    PrecomputedTransactionData txdata(spending_tx, allPrevOutputs);
+
+    // Sign for all the inputs
+    auto consensusBranchId = NetworkUpgradeInfo[Consensus::UPGRADE_SAPLING].nBranchId;
+    for (size_t i = 0; i < nInputs; i++) {
+        SignSignature(tempKeystore, prevPubKey, spending_tx, txdata, i, 1000000, SIGHASH_ALL, consensusBranchId);
+    }
+
+    // Spending tx has all its inputs signed and does not need to be mutated anymore
+    CTransaction final_spending_tx(spending_tx);
+
+    // Benchmark signature verification costs:
+    struct timeval tv_start;
+    timer_start(tv_start);
+    for (size_t i = 0; i < nInputs; i++) {
+        ScriptError serror = SCRIPT_ERR_OK;
+        assert(VerifyScript(final_spending_tx.vin[i].scriptSig,
+                            prevPubKey,
+                            STANDARD_SCRIPT_VERIFY_FLAGS,
+                            TransactionSignatureChecker(&final_spending_tx, txdata, i, 1000000),
+                            consensusBranchId,
+                            &serror));
+    }
+    return timer_stop(tv_start);
+}
+
+// The two benchmarks, try_decrypt_sprout_notes and try_decrypt_sapling_notes,
+// are checking worst-case scenarios. In both we add n keys to a wallet,
+// create a transaction using a key not in our original list of n, and then
+// check that the transaction is not associated with any of the keys in our
+// wallet. We call assert(...) to ensure that this is true.
+double benchmark_try_decrypt_sprout_notes(size_t nKeys)
+{
+    CWallet wallet(Params());
+    for (int i = 0; i < nKeys; i++) {
+        auto sk = libzcash::SproutSpendingKey::random();
+        wallet.AddSproutSpendingKey(sk);
+    }
+
+    auto sk = libzcash::SproutSpendingKey::random();
+    auto tx = GetValidSproutReceive(sk, 10, true);
+
+    struct timeval tv_start;
+    timer_start(tv_start);
+    auto noteDataMap = wallet.FindMySproutNotes(tx);
+
+    assert(noteDataMap.empty());
+    return timer_stop(tv_start);
+}
+
+double benchmark_try_decrypt_sapling_notes(size_t nKeys)
+{
+    // Set params
+    const Consensus::Params& consensusParams = Params().GetConsensus();
+
+    auto masterKey = GetTestMasterSaplingSpendingKey();
+
+    CWallet wallet(Params());
+
+    for (int i = 0; i < nKeys; i++) {
+        auto sk = masterKey.Derive(i);
+        wallet.AddSaplingSpendingKey(sk);
+    }
+
+    // Generate a key that has not been added to the wallet
+    auto sk = masterKey.Derive(nKeys);
+    auto tx = GetValidSaplingReceive(consensusParams, wallet, sk, 10);
+
+    struct timeval tv_start;
+    timer_start(tv_start);
+    auto noteDataMapAndAddressesToAdd = wallet.FindMySaplingNotes(tx, 1);
+    assert(noteDataMapAndAddressesToAdd.first.empty());
+    return timer_stop(tv_start);
+}
+
+CWalletTx CreateSproutTxWithNoteData(const libzcash::SproutSpendingKey& sk) {
+    auto wtx = GetValidSproutReceive(sk, 10, true);
+    auto note = GetSproutNote(sk, wtx, 0, 1);
+    auto nullifier = note.nullifier(sk);
+
+    mapSproutNoteData_t noteDataMap;
+    JSOutPoint jsoutpt {wtx.GetHash(), 0, 1};
+    SproutNoteData nd {sk.address(), nullifier};
+    noteDataMap[jsoutpt] = nd;
+
+    wtx.SetSproutNoteData(noteDataMap);
+
+    return wtx;
+}
+
+double benchmark_increment_sprout_note_witnesses(size_t nTxs)
+{
+    const Consensus::Params& consensusParams = Params().GetConsensus();
+
+    CWallet wallet(Params());
+    MerkleFrontiers frontiers;
+
+    auto sproutSpendingKey = libzcash::SproutSpendingKey::random();
+    wallet.AddSproutSpendingKey(sproutSpendingKey);
+
+    // First block
+    CBlock block1;
+    for (int i = 0; i < nTxs; ++i) {
+        auto wtx = CreateSproutTxWithNoteData(sproutSpendingKey);
+        wallet.LoadWalletTx(wtx);
+        block1.vtx.push_back(wtx);
+    }
+
+    CBlockIndex index1(block1);
+    index1.nHeight = 1;
+
+    // Increment to get transactions witnessed
+    wallet.ChainTip(&index1, &block1, frontiers);
+
+    // Second block
+    CBlock block2;
+    block2.hashPrevBlock = block1.GetHash();
+    {
+        auto sproutTx = CreateSproutTxWithNoteData(sproutSpendingKey);
+        wallet.LoadWalletTx(sproutTx);
+        block2.vtx.push_back(sproutTx);
+    }
+
+    CBlockIndex index2(block2);
+    index2.nHeight = 2;
+
+    struct timeval tv_start;
+    timer_start(tv_start);
+    wallet.ChainTip(&index2, &block2, frontiers);
+    return timer_stop(tv_start);
+}
+
+CWalletTx CreateSaplingTxWithNoteData(const Consensus::Params& consensusParams,
+                                      CBasicKeyStore& keyStore,
+                                      const libzcash::SaplingExtendedSpendingKey &sk) {
+    auto wtx = GetValidSaplingReceive(consensusParams, keyStore, sk, 10);
+    auto testNote = GetTestSaplingNote(sk.ToXFVK().DefaultAddress(), 10);
+    auto fvk = sk.expsk.full_viewing_key();
+    auto nullifier = testNote.note.nullifier(fvk, testNote.tree.witness().position()).value();
+
+    mapSaplingNoteData_t noteDataMap;
+    SaplingOutPoint outPoint {wtx.GetHash(), 0};
+    auto ivk = fvk.in_viewing_key();
+    SaplingNoteData noteData {ivk, nullifier};
+    noteDataMap[outPoint] = noteData;
+
+    wtx.SetSaplingNoteData(noteDataMap);
+
+    return wtx;
+}
+
+double benchmark_increment_sapling_note_witnesses(size_t nTxs)
+{
+    const Consensus::Params& consensusParams = Params().GetConsensus();
+
+    CWallet wallet(Params());
+    MerkleFrontiers frontiers;
+
+    auto saplingSpendingKey = GetTestMasterSaplingSpendingKey();
+    wallet.AddSaplingSpendingKey(saplingSpendingKey);
+
+    // First block
+    CBlock block1;
+    for (int i = 0; i < nTxs; ++i) {
+        auto wtx = CreateSaplingTxWithNoteData(consensusParams, wallet, saplingSpendingKey);
+        wallet.LoadWalletTx(wtx);
+        block1.vtx.push_back(wtx);
+    }
+
+    CBlockIndex index1(block1);
+    index1.nHeight = 1;
+
+    // Increment to get transactions witnessed
+    wallet.ChainTip(&index1, &block1, frontiers);
+
+    // Second block
+    CBlock block2;
+    block2.hashPrevBlock = block1.GetHash();
+    {
+        auto saplingTx = CreateSaplingTxWithNoteData(consensusParams, wallet, saplingSpendingKey);
+        wallet.LoadWalletTx(saplingTx);
+        block1.vtx.push_back(saplingTx);
+    }
+
+    CBlockIndex index2(block2);
+    index2.nHeight = 2;
+
+    struct timeval tv_start;
+    timer_start(tv_start);
+    wallet.ChainTip(&index2, &block2, frontiers);
+    return timer_stop(tv_start);
+}
+
+// Fake the input of a given block
+// This class is based on the class CCoinsViewDB, but with limited functionality.
+// The constructor and the functions `GetCoins` and `HaveCoins` come directly from
+// CCoinsViewDB, but the rest are either mocks and/or don't really do anything.
+
+// The following constant is a duplicate of the one found in txdb.cpp
+static const char DB_COINS = 'c';
+
+class FakeCoinsViewDB : public CCoinsView {
+
+    CDBWrapper db;
+
+    uint256 hash;
+    SproutMerkleTree sproutTree;
+    SaplingMerkleTree saplingTree;
+    OrchardMerkleFrontier orchardTree;
+
+public:
+    FakeCoinsViewDB(std::string dbName, uint256& hash) : db(GetDataDir() / dbName, 100, false, false), hash(hash) {}
+
+    bool GetSproutAnchorAt(const uint256 &rt, SproutMerkleTree &tree) const {
+        if (rt == sproutTree.root()) {
+            tree = sproutTree;
+            return true;
+        }
+        return false;
+    }
+
+    bool GetSaplingAnchorAt(const uint256 &rt, SaplingMerkleTree &tree) const {
+        if (rt == saplingTree.root()) {
+            tree = saplingTree;
+            return true;
+        }
+        return false;
+    }
+
+    bool GetOrchardAnchorAt(const uint256 &rt, OrchardMerkleFrontier &tree) const {
+        if (rt == orchardTree.root()) {
+            tree = orchardTree;
+            return true;
+        }
+        return false;
+    }
+
+    bool GetNullifier(const uint256 &nf, ShieldedType type) const {
+        return false;
+    }
+
+    bool GetCoins(const uint256 &txid, CCoins &coins) const {
+        return db.Read(std::make_pair(DB_COINS, txid), coins);
+    }
+
+    bool HaveCoins(const uint256 &txid) const {
+        return db.Exists(std::make_pair(DB_COINS, txid));
+    }
+
+    uint256 GetBestBlock() const {
+        return hash;
+    }
+
+    uint256 GetBestAnchor(ShieldedType type) const {
+        switch (type) {
+            case SPROUT:
+                return sproutTree.root();
+            case SAPLING:
+                return saplingTree.root();
+            case ORCHARD:
+                return orchardTree.root();
+            default:
+                throw new std::runtime_error("Unknown shielded type");
+        }
+    }
+
+    bool BatchWrite(CCoinsMap &mapCoins,
+                    const uint256 &hashBlock,
+                    const uint256 &hashSproutAnchor,
+                    const uint256 &hashSaplingAnchor,
+                    const uint256 &hashOrchardAnchor,
+                    CAnchorsSproutMap &mapSproutAnchors,
+                    CAnchorsSaplingMap &mapSaplingAnchors,
+                    CAnchorsOrchardMap &mapOrchardAnchors,
+                    CNullifiersMap &mapSproutNullifiers,
+                    CNullifiersMap &mapSaplingNullifiers,
+                    CNullifiersMap &mapOrchardNullifiers,
+                    CHistoryCacheMap &historyCacheMap) {
+        return false;
+    }
+
+    bool GetStats(CCoinsStats &stats) const {
+        return false;
+    }
+};
+
+double benchmark_connectblock_slow()
+{
+    // Test for issue 2017-05-01.a
+    SelectParams(CBaseChainParams::MAIN);
+    CBlock block;
+    FILE* fp = fsbridge::fopen(GetDataDir() / "benchmark/block-107134.dat", "rb");
+    if (!fp) throw new std::runtime_error("Failed to open block data file");
+    CAutoFile blkFile(fp, SER_DISK, CLIENT_VERSION);
+    blkFile >> block;
+    blkFile.fclose();
+
+    // Fake its inputs
+    auto hashPrev = uint256S("00000000159a41f468e22135942a567781c3f3dc7ad62257993eb3c69c3f95ef");
+    FakeCoinsViewDB fakeDB("benchmark/block-107134-inputs", hashPrev);
+    CCoinsViewCache view(&fakeDB);
+
+    // Fake the chain
+    CBlockIndex index(block);
+    index.nHeight = 107134;
+    CBlockIndex indexPrev;
+    indexPrev.phashBlock = &hashPrev;
+    indexPrev.nHeight = index.nHeight - 1;
+    index.pprev = &indexPrev;
+    mapBlockIndex.insert(std::make_pair(hashPrev, &indexPrev));
+
+    CValidationState state;
+    struct timeval tv_start;
+    timer_start(tv_start);
+    assert(ConnectBlock(block, state, &index, view, Params(), true));
+    auto duration = timer_stop(tv_start);
+
+    // Undo alterations to global state
+    mapBlockIndex.erase(hashPrev);
+    SelectParams(ChainNameFromCommandLine());
+
+    return duration;
+}
+
+extern UniValue getnewaddress(const UniValue& params, bool fHelp); // in rpcwallet.cpp
+extern UniValue sendtoaddress(const UniValue& params, bool fHelp);
+
+double benchmark_sendtoaddress(CAmount amount)
+{
+    UniValue params(UniValue::VARR);
+    auto addr = getnewaddress(params, false);
+
+    params.push_back(addr);
+    params.push_back(ValueFromAmount(amount));
+
+    struct timeval tv_start;
+    timer_start(tv_start);
+    auto txid = sendtoaddress(params, false);
+    return timer_stop(tv_start);
+}
+
+double benchmark_loadwallet()
+{
+    pre_wallet_load();
+    struct timeval tv_start;
+    bool fFirstRunRet=true;
+    timer_start(tv_start);
+    pwalletMain = new CWallet(Params(), "wallet.dat");
+    DBErrors nLoadWalletRet = pwalletMain->LoadWallet(fFirstRunRet);
+    auto res = timer_stop(tv_start);
+    post_wallet_load();
+    return res;
+}
+
+extern UniValue listunspent(const UniValue& params, bool fHelp);
+
+double benchmark_listunspent()
+{
+    UniValue params(UniValue::VARR);
+    struct timeval tv_start;
+    timer_start(tv_start);
+    auto unspent = listunspent(params, false);
+    return timer_stop(tv_start);
+}
+
+double benchmark_create_sapling_spend()
+{
+    auto sk = libzcash::SaplingSpendingKey::random();
+    auto expsk = sk.expanded_spending_key();
+    auto address = sk.default_address();
+    SaplingNote note(address, GetRand(MAX_MONEY), libzcash::Zip212Enabled::BeforeZip212);
+    SaplingMerkleTree tree;
+    auto maybe_cmu = note.cmu();
+    tree.append(maybe_cmu.value());
+    auto anchor = tree.root();
+    auto witness = tree.witness();
+    auto maybe_nf = note.nullifier(expsk.full_viewing_key(), witness.position());
+    if (!(maybe_cmu && maybe_nf)) {
+        throw JSONRPCError(RPC_INTERNAL_ERROR, "Could not create note commitment and nullifier");
+    }
+
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << witness.path();
+    std::vector<unsigned char> witnessChars(ss.begin(), ss.end());
+
+    uint256 alpha;
+    librustzcash_sapling_generate_r(alpha.begin());
+
+    auto ctx = librustzcash_sapling_proving_ctx_init();
+
+    struct timeval tv_start;
+    timer_start(tv_start);
+
+    SpendDescription sdesc;
+    uint256 rcm = note.rcm();
+    bool result = librustzcash_sapling_spend_proof(
+        ctx,
+        expsk.full_viewing_key().ak.begin(),
+        expsk.nsk.begin(),
+        note.d.data(),
+        rcm.begin(),
+        alpha.begin(),
+        note.value(),
+        anchor.begin(),
+        witnessChars.data(),
+        sdesc.cv.begin(),
+        sdesc.rk.begin(),
+        sdesc.zkproof.data());
+
+    double t = timer_stop(tv_start);
+    librustzcash_sapling_proving_ctx_free(ctx);
+    if (!result) {
+        throw JSONRPCError(RPC_INTERNAL_ERROR, "librustzcash_sapling_spend_proof() should return true");
+    }
+    return t;
+}
+
+double benchmark_create_sapling_output()
+{
+    auto sk = libzcash::SaplingSpendingKey::random();
+    auto address = sk.default_address();
+
+    std::array<unsigned char, ZC_MEMO_SIZE> memo;
+    SaplingNote note(address, GetRand(MAX_MONEY),  libzcash::Zip212Enabled::BeforeZip212);
+
+    libzcash::SaplingNotePlaintext notePlaintext(note, memo);
+    auto res = notePlaintext.encrypt(note.pk_d);
+    if (!res) {
+        throw JSONRPCError(RPC_INTERNAL_ERROR, "SaplingNotePlaintext::encrypt() failed");
+    }
+
+    auto enc = res.value();
+    auto encryptor = enc.second;
+
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << address;
+    std::vector<unsigned char> addressBytes(ss.begin(), ss.end());
+
+    auto ctx = librustzcash_sapling_proving_ctx_init();
+
+    struct timeval tv_start;
+    timer_start(tv_start);
+
+    OutputDescription odesc;
+    uint256 rcm = note.rcm();
+    bool result = librustzcash_sapling_output_proof(
+        ctx,
+        encryptor.get_esk().begin(),
+        addressBytes.data(),
+        rcm.begin(),
+        note.value(),
+        odesc.cv.begin(),
+        odesc.zkproof.begin());
+
+    double t = timer_stop(tv_start);
+    librustzcash_sapling_proving_ctx_free(ctx);
+    if (!result) {
+        throw JSONRPCError(RPC_INTERNAL_ERROR, "librustzcash_sapling_output_proof() should return true");
+    }
+    return t;
+}
+
+// Verify Sapling spend from testnet
+// txid: abbd823cbd3d4e3b52023599d81a96b74817e95ce5bb58354f979156bd22ecc8
+// position: 0
+double benchmark_verify_sapling_spend()
+{
+    SpendDescription spend;
+    CDataStream ss(ParseHex("8c6cf86bbb83bf0d075e5bd9bb4b5cd56141577be69f032880b11e26aa32aa5ef09fd00899e4b469fb11f38e9d09dc0379f0b11c23b5fe541765f76695120a03f0261d32af5d2a2b1e5c9a04200cd87d574dc42349de9790012ce560406a8a876a1e54cfcdc0eb74998abec2a9778330eeb2a0ac0e41d0c9ed5824fbd0dbf7da930ab299966ce333fd7bc1321dada0817aac5444e02c754069e218746bf879d5f2a20a8b028324fb2c73171e63336686aa5ec2e6e9a08eb18b87c14758c572f4531ccf6b55d09f44beb8b47563be4eff7a52598d80959dd9c9fee5ac4783d8370cb7d55d460053d3e067b5f9fe75ff2722623fb1825fcba5e9593d4205b38d1f502ff03035463043bd393a5ee039ce75a5d54f21b395255df6627ef96751566326f7d4a77d828aa21b1827282829fcbc42aad59cdb521e1a3aaa08b99ea8fe7fff0a04da31a52260fc6daeccd79bb877bdd8506614282258e15b3fe74bf71a93f4be3b770119edf99a317b205eea7d5ab800362b97384273888106c77d633600"), SER_NETWORK, PROTOCOL_VERSION);
+    ss >> spend;
+    uint256 dataToBeSigned = uint256S("0x2dbf83fe7b88a7cbd80fac0c719483906bb9a0c4fc69071e4780d5f2c76e592c");
+
+    auto ctx = librustzcash_sapling_verification_ctx_init(true);
+
+    struct timeval tv_start;
+    timer_start(tv_start);
+
+    bool result = librustzcash_sapling_check_spend(
+                ctx,
+                spend.cv.begin(),
+                spend.anchor.begin(),
+                spend.nullifier.begin(),
+                spend.rk.begin(),
+                spend.zkproof.begin(),
+                spend.spendAuthSig.begin(),
+                dataToBeSigned.begin()
+            );
+
+    double t = timer_stop(tv_start);
+    librustzcash_sapling_verification_ctx_free(ctx);
+    if (!result) {
+        throw JSONRPCError(RPC_INTERNAL_ERROR, "librustzcash_sapling_check_spend() should return true");
+    }
+    return t;
+}
+
+// Verify Sapling output from testnet
+// txid: abbd823cbd3d4e3b52023599d81a96b74817e95ce5bb58354f979156bd22ecc8
+// position: 0
+double benchmark_verify_sapling_output()
+{
+    OutputDescription output;
+    CDataStream ss(ParseHex("edd742af18857e5ec2d71d346a7fe2ac97c137339bd5268eea86d32e0ff4f38f76213fa8cfed3347ac4e8572dd88aff395c0c10a59f8b3f49d2bc539ed6c726667e29d4763f914ddd0abf1cdfa84e44de87c233434c7e69b8b5b8f4623c8aa444163425bae5cef842972fed66046c1c6ce65c866ad894d02e6e6dcaae7a962d9f2ef95757a09c486928e61f0f7aed90ad0a542b0d3dc5fe140dfa7626b9315c77e03b055f19cbacd21a866e46f06c00e0c7792b2a590a611439b510a9aaffcf1073bad23e712a9268b36888e3727033eee2ab4d869f54a843f93b36ef489fb177bf74b41a9644e5d2a0a417c6ac1c8869bc9b83273d453f878ed6fd96b82a5939903f7b64ecaf68ea16e255a7fb7cc0b6d8b5608a1c6b0ed3024cc62c2f0f9c5cfc7b431ae6e9d40815557aa1d010523f9e1960de77b2274cb6710d229d475c87ae900183206ba90cb5bbc8ec0df98341b82726c705e0308ca5dc08db4db609993a1046dfb43dfd8c760be506c0bed799bb2205fc29dc2e654dce731034a23b0aaf6da0199248702ee0523c159f41f4cbfff6c35ace4dd9ae834e44e09c76a0cbdda1d3f6a2c75ad71212daf9575ab5f09ca148718e667f29ddf18c8a330a86ace18a86e89454653902aa393c84c6b694f27d0d42e24e7ac9fe34733de5ec15f5066081ce912c62c1a804a2bb4dedcef7cc80274f6bb9e89e2fce91dc50d6a73c8aefb9872f1cf3524a92626a0b8f39bbf7bf7d96ca2f770fc04d7f457021c536a506a187a93b2245471ddbfb254a71bc4a0d72c8d639a31c7b1920087ffca05c24214157e2e7b28184e91989ef0b14f9b34c3dc3cc0ac64226b9e337095870cb0885737992e120346e630a416a9b217679ce5a778fb15779c136bcecca5efe79012013d77d90b4e99dd22c8f35bc77121716e160d05bd30d288ee8886390ee436f85bdc9029df888a3a3326d9d4ddba5cb5318b3274928829d662e96fea1d601f7a306251ed8c6cc4e5a3a7a98c35a3650482a0eee08f3b4c2da9b22947c96138f1505c2f081f8972d429f3871f32bef4aaa51aa6945df8e9c9760531ac6f627d17c1518202818a91ca304fb4037875c666060597976144fcbbc48a776a2c61beb9515fa8f3ae6d3a041d320a38a8ac75cb47bb9c866ee497fc3cd13299970c4b369c1c2ceb4220af082fbecdd8114492a8e4d713b5a73396fd224b36c1185bd5e20d683e6c8db35346c47ae7401988255da7cfffdced5801067d4d296688ee8fe424b4a8a69309ce257eefb9345ebfda3f6de46bb11ec94133e1f72cd7ac54934d6cf17b3440800e70b80ebc7c7bfc6fb0fc2c"), SER_NETWORK, PROTOCOL_VERSION);
+    ss >> output;
+
+    auto ctx = librustzcash_sapling_verification_ctx_init(true);
+
+    struct timeval tv_start;
+    timer_start(tv_start);
+
+    bool result = librustzcash_sapling_check_output(
+                ctx,
+                output.cv.begin(),
+                output.cmu.begin(),
+                output.ephemeralKey.begin(),
+                output.zkproof.begin()
+            );
+
+    double t = timer_stop(tv_start);
+    librustzcash_sapling_verification_ctx_free(ctx);
+    if (!result) {
+        throw JSONRPCError(RPC_INTERNAL_ERROR, "librustzcash_sapling_check_output() should return true");
+    }
+    return timer_stop(tv_start);
+}
diff --git a/depend/zcash/src/zcbenchmarks.h b/depend/zcash/src/zcbenchmarks.h
new file mode 100644
index 000000000..84dc53857
--- /dev/null
+++ b/depend/zcash/src/zcbenchmarks.h
@@ -0,0 +1,28 @@
+#ifndef ZCASH_ZCBENCHMARKS_H
+#define ZCASH_ZCBENCHMARKS_H
+
+#include <sys/time.h>
+#include <stdlib.h>
+
+extern double benchmark_sleep();
+extern double benchmark_create_joinsplit();
+extern std::vector<double> benchmark_create_joinsplit_threaded(int nThreads);
+extern double benchmark_solve_equihash();
+extern std::vector<double> benchmark_solve_equihash_threaded(int nThreads);
+extern double benchmark_verify_joinsplit(const JSDescription &joinsplit);
+extern double benchmark_verify_equihash();
+extern double benchmark_large_tx(size_t nInputs);
+extern double benchmark_try_decrypt_sprout_notes(size_t nAddrs);
+extern double benchmark_try_decrypt_sapling_notes(size_t nAddrs);
+extern double benchmark_increment_sprout_note_witnesses(size_t nTxs);
+extern double benchmark_increment_sapling_note_witnesses(size_t nTxs);
+extern double benchmark_connectblock_slow();
+extern double benchmark_sendtoaddress(CAmount amount);
+extern double benchmark_loadwallet();
+extern double benchmark_listunspent();
+extern double benchmark_create_sapling_spend();
+extern double benchmark_create_sapling_output();
+extern double benchmark_verify_sapling_spend();
+extern double benchmark_verify_sapling_output();
+
+#endif // ZCASH_ZCBENCHMARKS_H
diff --git a/depend/zcash/src/zmq/zmqabstractnotifier.cpp b/depend/zcash/src/zmq/zmqabstractnotifier.cpp
new file mode 100644
index 000000000..3e9c48672
--- /dev/null
+++ b/depend/zcash/src/zmq/zmqabstractnotifier.cpp
@@ -0,0 +1,27 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "zmqabstractnotifier.h"
+#include "util.h"
+
+
+CZMQAbstractNotifier::~CZMQAbstractNotifier()
+{
+    assert(!psocket);
+}
+
+bool CZMQAbstractNotifier::NotifyBlock(const CBlockIndex * /*CBlockIndex*/)
+{
+    return true;
+}
+
+bool CZMQAbstractNotifier::NotifyBlock(const CBlock &)
+{
+    return true;
+}
+
+bool CZMQAbstractNotifier::NotifyTransaction(const CTransaction &/*transaction*/)
+{
+    return true;
+}
diff --git a/depend/zcash/src/zmq/zmqabstractnotifier.h b/depend/zcash/src/zmq/zmqabstractnotifier.h
new file mode 100644
index 000000000..2ef35bd4f
--- /dev/null
+++ b/depend/zcash/src/zmq/zmqabstractnotifier.h
@@ -0,0 +1,45 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_ZMQ_ZMQABSTRACTNOTIFIER_H
+#define BITCOIN_ZMQ_ZMQABSTRACTNOTIFIER_H
+
+#include "zmqconfig.h"
+
+class CBlockIndex;
+class CZMQAbstractNotifier;
+
+typedef CZMQAbstractNotifier* (*CZMQNotifierFactory)();
+
+class CZMQAbstractNotifier
+{
+public:
+    CZMQAbstractNotifier() : psocket(0) { }
+    virtual ~CZMQAbstractNotifier();
+
+    template <typename T>
+    static CZMQAbstractNotifier* Create()
+    {
+        return new T();
+    }
+
+    std::string GetType() const { return type; }
+    void SetType(const std::string &t) { type = t; }
+    std::string GetAddress() const { return address; }
+    void SetAddress(const std::string &a) { address = a; }
+
+    virtual bool Initialize(void *pcontext) = 0;
+    virtual void Shutdown() = 0;
+
+    virtual bool NotifyBlock(const CBlockIndex *pindex);
+    virtual bool NotifyBlock(const CBlock& pblock);
+    virtual bool NotifyTransaction(const CTransaction &transaction);
+
+protected:
+    void *psocket;
+    std::string type;
+    std::string address;
+};
+
+#endif // BITCOIN_ZMQ_ZMQABSTRACTNOTIFIER_H
diff --git a/depend/zcash/src/zmq/zmqconfig.h b/depend/zcash/src/zmq/zmqconfig.h
new file mode 100644
index 000000000..b88fcc4f4
--- /dev/null
+++ b/depend/zcash/src/zmq/zmqconfig.h
@@ -0,0 +1,24 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_ZMQ_ZMQCONFIG_H
+#define BITCOIN_ZMQ_ZMQCONFIG_H
+
+#if defined(HAVE_CONFIG_H)
+#include "config/bitcoin-config.h"
+#endif
+
+#include <stdarg.h>
+#include <string>
+
+#if ENABLE_ZMQ
+#include <zmq.h>
+#endif
+
+#include "primitives/block.h"
+#include "primitives/transaction.h"
+
+void zmqError(const char *str);
+
+#endif // BITCOIN_ZMQ_ZMQCONFIG_H
diff --git a/depend/zcash/src/zmq/zmqnotificationinterface.cpp b/depend/zcash/src/zmq/zmqnotificationinterface.cpp
new file mode 100644
index 000000000..fa56291c9
--- /dev/null
+++ b/depend/zcash/src/zmq/zmqnotificationinterface.cpp
@@ -0,0 +1,185 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "zmqnotificationinterface.h"
+#include "zmqpublishnotifier.h"
+
+#include "version.h"
+#include "main.h"
+#include "streams.h"
+#include "util.h"
+
+void zmqError(const char *str)
+{
+    LogPrint("zmq", "zmq: Error: %s, errno=%s\n", str, zmq_strerror(errno));
+}
+
+CZMQNotificationInterface::CZMQNotificationInterface() : pcontext(NULL)
+{
+}
+
+CZMQNotificationInterface::~CZMQNotificationInterface()
+{
+    Shutdown();
+
+    for (std::list<CZMQAbstractNotifier*>::iterator i=notifiers.begin(); i!=notifiers.end(); ++i)
+    {
+        delete *i;
+    }
+}
+
+CZMQNotificationInterface* CZMQNotificationInterface::CreateWithArguments(const std::map<std::string, std::string> &args)
+{
+    CZMQNotificationInterface* notificationInterface = NULL;
+    std::map<std::string, CZMQNotifierFactory> factories;
+    std::list<CZMQAbstractNotifier*> notifiers;
+
+    factories["pubhashblock"] = CZMQAbstractNotifier::Create<CZMQPublishHashBlockNotifier>;
+    factories["pubhashtx"] = CZMQAbstractNotifier::Create<CZMQPublishHashTransactionNotifier>;
+    factories["pubrawblock"] = CZMQAbstractNotifier::Create<CZMQPublishRawBlockNotifier>;
+    factories["pubrawtx"] = CZMQAbstractNotifier::Create<CZMQPublishRawTransactionNotifier>;
+    factories["pubcheckedblock"] = CZMQAbstractNotifier::Create<CZMQPublishCheckedBlockNotifier>;
+
+    for (std::map<std::string, CZMQNotifierFactory>::const_iterator i=factories.begin(); i!=factories.end(); ++i)
+    {
+        std::map<std::string, std::string>::const_iterator j = args.find("-zmq" + i->first);
+        if (j!=args.end())
+        {
+            CZMQNotifierFactory factory = i->second;
+            std::string address = j->second;
+            CZMQAbstractNotifier *notifier = factory();
+            notifier->SetType(i->first);
+            notifier->SetAddress(address);
+            notifiers.push_back(notifier);
+        }
+    }
+
+    if (!notifiers.empty())
+    {
+        notificationInterface = new CZMQNotificationInterface();
+        notificationInterface->notifiers = notifiers;
+
+        if (!notificationInterface->Initialize())
+        {
+            delete notificationInterface;
+            notificationInterface = NULL;
+        }
+    }
+
+    return notificationInterface;
+}
+
+// Called at startup to conditionally set up ZMQ socket(s)
+bool CZMQNotificationInterface::Initialize()
+{
+    int major = 0, minor = 0, patch = 0;
+    zmq_version(&major, &minor, &patch);
+    LogPrint("zmq", "zmq: version %d.%d.%d\n", major, minor, patch);
+
+    LogPrint("zmq", "zmq: Initialize notification interface\n");
+    assert(!pcontext);
+
+    pcontext = zmq_ctx_new();
+
+    if (!pcontext)
+    {
+        zmqError("Unable to initialize context");
+        return false;
+    }
+
+    std::list<CZMQAbstractNotifier*>::iterator i=notifiers.begin();
+    for (; i!=notifiers.end(); ++i)
+    {
+        CZMQAbstractNotifier *notifier = *i;
+        if (notifier->Initialize(pcontext))
+        {
+            LogPrint("zmq", "  Notifier %s ready (address = %s)\n", notifier->GetType(), notifier->GetAddress());
+        }
+        else
+        {
+            LogPrint("zmq", "  Notifier %s failed (address = %s)\n", notifier->GetType(), notifier->GetAddress());
+            break;
+        }
+    }
+
+    if (i!=notifiers.end())
+    {
+        return false;
+    }
+
+    return true;
+}
+
+// Called during shutdown sequence
+void CZMQNotificationInterface::Shutdown()
+{
+    LogPrint("zmq", "zmq: Shutdown notification interface\n");
+    if (pcontext)
+    {
+        for (std::list<CZMQAbstractNotifier*>::iterator i=notifiers.begin(); i!=notifiers.end(); ++i)
+        {
+            CZMQAbstractNotifier *notifier = *i;
+            LogPrint("zmq", "   Shutdown notifier %s at %s\n", notifier->GetType(), notifier->GetAddress());
+            notifier->Shutdown();
+        }
+        zmq_ctx_term(pcontext);
+
+        pcontext = 0;
+    }
+}
+
+void CZMQNotificationInterface::UpdatedBlockTip(const CBlockIndex *pindex)
+{
+    for (std::list<CZMQAbstractNotifier*>::iterator i = notifiers.begin(); i!=notifiers.end(); )
+    {
+        CZMQAbstractNotifier *notifier = *i;
+        if (notifier->NotifyBlock(pindex))
+        {
+            i++;
+        }
+        else
+        {
+            notifier->Shutdown();
+            i = notifiers.erase(i);
+        }
+    }
+}
+
+void CZMQNotificationInterface::BlockChecked(const CBlock& block, const CValidationState& state)
+{
+    if (state.IsInvalid()) {
+        return;
+    }
+
+    for (std::list<CZMQAbstractNotifier*>::iterator i = notifiers.begin(); i!=notifiers.end(); )
+    {
+        CZMQAbstractNotifier *notifier = *i;
+        if (notifier->NotifyBlock(block))
+        {
+            i++;
+        }
+        else
+        {
+            notifier->Shutdown();
+            i = notifiers.erase(i);
+        }
+    }
+}
+
+void CZMQNotificationInterface::SyncTransaction(const CTransaction &tx, const CBlock *pblock, const int nHeight)
+{
+    for (std::list<CZMQAbstractNotifier*>::iterator i = notifiers.begin(); i!=notifiers.end(); )
+    {
+        CZMQAbstractNotifier *notifier = *i;
+        if (notifier->NotifyTransaction(tx))
+        {
+            i++;
+        }
+        else
+        {
+            notifier->Shutdown();
+            i = notifiers.erase(i);
+        }
+    }
+}
diff --git a/depend/zcash/src/zmq/zmqnotificationinterface.h b/depend/zcash/src/zmq/zmqnotificationinterface.h
new file mode 100644
index 000000000..fedff60ef
--- /dev/null
+++ b/depend/zcash/src/zmq/zmqnotificationinterface.h
@@ -0,0 +1,39 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_ZMQ_ZMQNOTIFICATIONINTERFACE_H
+#define BITCOIN_ZMQ_ZMQNOTIFICATIONINTERFACE_H
+
+#include "validationinterface.h"
+#include "consensus/validation.h"
+#include <string>
+#include <map>
+
+class CBlockIndex;
+class CZMQAbstractNotifier;
+
+class CZMQNotificationInterface : public CValidationInterface
+{
+public:
+    virtual ~CZMQNotificationInterface();
+
+    static CZMQNotificationInterface* CreateWithArguments(const std::map<std::string, std::string> &args);
+
+protected:
+    bool Initialize();
+    void Shutdown();
+
+    // CValidationInterface
+    void SyncTransaction(const CTransaction &tx, const CBlock *pblock, const int nHeight);
+    void UpdatedBlockTip(const CBlockIndex *pindex);
+    void BlockChecked(const CBlock& block, const CValidationState& state);
+
+private:
+    CZMQNotificationInterface();
+
+    void *pcontext;
+    std::list<CZMQAbstractNotifier*> notifiers;
+};
+
+#endif // BITCOIN_ZMQ_ZMQNOTIFICATIONINTERFACE_H
diff --git a/depend/zcash/src/zmq/zmqpublishnotifier.cpp b/depend/zcash/src/zmq/zmqpublishnotifier.cpp
new file mode 100644
index 000000000..a2a6758ca
--- /dev/null
+++ b/depend/zcash/src/zmq/zmqpublishnotifier.cpp
@@ -0,0 +1,205 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#include "chainparams.h"
+#include "zmqpublishnotifier.h"
+#include "main.h"
+#include "util.h"
+
+static std::multimap<std::string, CZMQAbstractPublishNotifier*> mapPublishNotifiers;
+
+static const char *MSG_HASHBLOCK = "hashblock";
+static const char *MSG_HASHTX    = "hashtx";
+static const char *MSG_RAWBLOCK  = "rawblock";
+static const char *MSG_RAWTX     = "rawtx";
+static const char *MSG_CHECKEDBLOCK = "checkedblock";
+
+// Internal function to send multipart message
+static int zmq_send_multipart(void *sock, const void* data, size_t size, ...)
+{
+    va_list args;
+    va_start(args, size);
+
+    while (1)
+    {
+        zmq_msg_t msg;
+
+        int rc = zmq_msg_init_size(&msg, size);
+        if (rc != 0)
+        {
+            zmqError("Unable to initialize ZMQ msg");
+            return -1;
+        }
+
+        void *buf = zmq_msg_data(&msg);
+        memcpy(buf, data, size);
+
+        data = va_arg(args, const void*);
+
+        rc = zmq_msg_send(&msg, sock, data ? ZMQ_SNDMORE : 0);
+        if (rc == -1)
+        {
+            zmqError("Unable to send ZMQ msg");
+            zmq_msg_close(&msg);
+            return -1;
+        }
+
+        zmq_msg_close(&msg);
+
+        if (!data)
+            break;
+
+        size = va_arg(args, size_t);
+    }
+    return 0;
+}
+
+bool CZMQAbstractPublishNotifier::Initialize(void *pcontext)
+{
+    assert(!psocket);
+
+    // check if address is being used by other publish notifier
+    std::multimap<std::string, CZMQAbstractPublishNotifier*>::iterator i = mapPublishNotifiers.find(address);
+
+    if (i==mapPublishNotifiers.end())
+    {
+        psocket = zmq_socket(pcontext, ZMQ_PUB);
+        if (!psocket)
+        {
+            zmqError("Failed to create socket");
+            return false;
+        }
+
+        int rc = zmq_bind(psocket, address.c_str());
+        if (rc!=0)
+        {
+            zmqError("Failed to bind address");
+            zmq_close(psocket);
+            return false;
+        }
+
+        // register this notifier for the address, so it can be reused for other publish notifier
+        mapPublishNotifiers.insert(std::make_pair(address, this));
+        return true;
+    }
+    else
+    {
+        LogPrint("zmq", "zmq: Reusing socket for address %s\n", address);
+
+        psocket = i->second->psocket;
+        mapPublishNotifiers.insert(std::make_pair(address, this));
+
+        return true;
+    }
+}
+
+void CZMQAbstractPublishNotifier::Shutdown()
+{
+    assert(psocket);
+
+    int count = mapPublishNotifiers.count(address);
+
+    // remove this notifier from the list of publishers using this address
+    typedef std::multimap<std::string, CZMQAbstractPublishNotifier*>::iterator iterator;
+    std::pair<iterator, iterator> iterpair = mapPublishNotifiers.equal_range(address);
+
+    for (iterator it = iterpair.first; it != iterpair.second; ++it)
+    {
+        if (it->second==this)
+        {
+            mapPublishNotifiers.erase(it);
+            break;
+        }
+    }
+
+    if (count == 1)
+    {
+        LogPrint("zmq", "Close socket at address %s\n", address);
+        int linger = 0;
+        zmq_setsockopt(psocket, ZMQ_LINGER, &linger, sizeof(linger));
+        zmq_close(psocket);
+    }
+
+    psocket = 0;
+}
+
+bool CZMQAbstractPublishNotifier::SendMessage(const char *command, const void* data, size_t size)
+{
+    assert(psocket);
+
+    /* send three parts, command & data & a LE 4byte sequence number */
+    unsigned char msgseq[sizeof(uint32_t)];
+    WriteLE32(&msgseq[0], nSequence);
+    int rc = zmq_send_multipart(psocket, command, strlen(command), data, size, msgseq, (size_t)sizeof(uint32_t), (void*)0);
+    if (rc == -1)
+        return false;
+
+    /* increment memory only sequence number after sending */
+    nSequence++;
+
+    return true;
+}
+
+bool CZMQPublishHashBlockNotifier::NotifyBlock(const CBlockIndex *pindex)
+{
+    uint256 hash = pindex->GetBlockHash();
+    LogPrint("zmq", "zmq: Publish hashblock %s\n", hash.GetHex());
+    char data[32];
+    for (unsigned int i = 0; i < 32; i++)
+        data[31 - i] = hash.begin()[i];
+    return SendMessage(MSG_HASHBLOCK, data, 32);
+}
+
+bool CZMQPublishHashTransactionNotifier::NotifyTransaction(const CTransaction &transaction)
+{
+    uint256 hash = transaction.GetHash();
+    LogPrint("zmq", "zmq: Publish hashtx %s\n", hash.GetHex());
+    char data[32];
+    for (unsigned int i = 0; i < 32; i++)
+        data[31 - i] = hash.begin()[i];
+    return SendMessage(MSG_HASHTX, data, 32);
+}
+
+bool CZMQPublishRawBlockNotifier::NotifyBlock(const CBlockIndex *pindex)
+{
+    LogPrint("zmq", "zmq: Publish rawblock %s\n", pindex->GetBlockHash().GetHex());
+
+    const Consensus::Params& consensusParams = Params().GetConsensus();
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    {
+        LOCK(cs_main);
+        CBlock block;
+        if(!ReadBlockFromDisk(block, pindex, consensusParams))
+        {
+            zmqError("Can't read block from disk");
+            return false;
+        }
+
+        ss << block;
+    }
+
+    return SendMessage(MSG_RAWBLOCK, &(*ss.begin()), ss.size());
+}
+
+bool CZMQPublishCheckedBlockNotifier::NotifyBlock(const CBlock& block)
+{
+    LogPrint("zmq", "zmq: Publish checkedblock %s\n", block.GetHash().GetHex());
+
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    {
+        LOCK(cs_main);
+        ss << block;
+    }
+
+    return SendMessage(MSG_CHECKEDBLOCK, &(*ss.begin()), ss.size());
+}
+
+bool CZMQPublishRawTransactionNotifier::NotifyTransaction(const CTransaction &transaction)
+{
+    uint256 hash = transaction.GetHash();
+    LogPrint("zmq", "zmq: Publish rawtx %s\n", hash.GetHex());
+    CDataStream ss(SER_NETWORK, PROTOCOL_VERSION);
+    ss << transaction;
+    return SendMessage(MSG_RAWTX, &(*ss.begin()), ss.size());
+}
diff --git a/depend/zcash/src/zmq/zmqpublishnotifier.h b/depend/zcash/src/zmq/zmqpublishnotifier.h
new file mode 100644
index 000000000..3a5a6986e
--- /dev/null
+++ b/depend/zcash/src/zmq/zmqpublishnotifier.h
@@ -0,0 +1,61 @@
+// Copyright (c) 2015 The Bitcoin Core developers
+// Distributed under the MIT software license, see the accompanying
+// file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+#ifndef BITCOIN_ZMQ_ZMQPUBLISHNOTIFIER_H
+#define BITCOIN_ZMQ_ZMQPUBLISHNOTIFIER_H
+
+#include "zmqabstractnotifier.h"
+
+class CBlockIndex;
+
+class CZMQAbstractPublishNotifier : public CZMQAbstractNotifier
+{
+private:
+    uint32_t nSequence; //! upcounting per message sequence number
+
+public:
+
+    /* send zmq multipart message
+       parts:
+          * command
+          * data
+          * message sequence number
+    */
+    bool SendMessage(const char *command, const void* data, size_t size);
+
+    bool Initialize(void *pcontext);
+    void Shutdown();
+};
+
+class CZMQPublishHashBlockNotifier : public CZMQAbstractPublishNotifier
+{
+public:
+    bool NotifyBlock(const CBlockIndex *pindex);
+};
+
+class CZMQPublishHashTransactionNotifier : public CZMQAbstractPublishNotifier
+{
+public:
+    bool NotifyTransaction(const CTransaction &transaction);
+};
+
+class CZMQPublishRawBlockNotifier : public CZMQAbstractPublishNotifier
+{
+public:
+    bool NotifyBlock(const CBlockIndex *pindex);
+};
+
+class CZMQPublishRawTransactionNotifier : public CZMQAbstractPublishNotifier
+{
+public:
+    bool NotifyTransaction(const CTransaction &transaction);
+};
+
+class CZMQPublishCheckedBlockNotifier : public CZMQAbstractPublishNotifier
+{
+public:
+    bool NotifyBlock(const CBlock &block);
+};
+
+#endif // BITCOIN_ZMQ_ZMQPUBLISHNOTIFIER_H
diff --git a/depend/zcash/test/lint/README.md b/depend/zcash/test/lint/README.md
new file mode 100644
index 000000000..ad90147b4
--- /dev/null
+++ b/depend/zcash/test/lint/README.md
@@ -0,0 +1,31 @@
+This folder contains lint scripts.
+
+commit-script-check.sh
+======================
+Verification of [scripted diffs](/doc/developer-notes.md#scripted-diffs).
+
+git-subtree-check.sh
+====================
+Run this script from the root of the repository to verify that a subtree matches the contents of
+the commit it claims to have been updated to.
+
+To use, make sure that you have fetched the upstream repository branch in which the subtree is
+maintained:
+* for `src/secp256k1`: https://github.com/bitcoin-core/secp256k1.git (branch master)
+* for `src/leveldb`: https://github.com/bitcoin-core/leveldb.git (branch bitcoin-fork)
+* for `src/univalue`: https://github.com/bitcoin-core/univalue.git (branch master)
+* for `src/crypto/ctaes`: https://github.com/bitcoin-core/ctaes.git (branch master)
+
+To do so, add the upstream repository as remote:
+
+```
+git remote add --fetch secp256k1 https://github.com/bitcoin-core/secp256k1.git
+```
+
+Usage: `git-subtree-check.sh DIR (COMMIT)`
+
+`COMMIT` may be omitted, in which case `HEAD` is used.
+
+lint-all.sh
+===========
+Calls other scripts with the `lint-` prefix.
diff --git a/depend/zcash/test/lint/commit-script-check.sh b/depend/zcash/test/lint/commit-script-check.sh
new file mode 100755
index 000000000..bdbc67427
--- /dev/null
+++ b/depend/zcash/test/lint/commit-script-check.sh
@@ -0,0 +1,54 @@
+#!/bin/sh
+# Copyright (c) 2017 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+# This simple script checks for commits beginning with: scripted-diff:
+# If found, looks for a script between the lines -BEGIN VERIFY SCRIPT- and
+# -END VERIFY SCRIPT-. If no ending is found, it reads until the end of the
+# commit message.
+
+# The resulting script should exactly transform the previous commit into the current
+# one. Any remaining diff signals an error.
+
+export LC_ALL=C
+if test "x$1" = "x"; then
+    echo "Usage: $0 <commit>..."
+    exit 1
+fi
+
+# Check that the working tree is clean (as this script performs hard resets).
+TREE_CHANGES=$(git diff HEAD | wc -l)
+if test "x$TREE_CHANGES" != "x0"; then
+    echo "The working tree is not clean."
+    exit 1
+fi
+
+RET=0
+PREV_BRANCH=$(git name-rev --name-only HEAD)
+PREV_HEAD=$(git rev-parse HEAD)
+for commit in $(git rev-list --reverse $1); do
+    if git rev-list -n 1 --pretty="%s" $commit | grep -q "^scripted-diff:"; then
+        git checkout --quiet $commit^ || exit
+        SCRIPT="$(git rev-list --format=%b -n1 $commit | sed '/^-BEGIN VERIFY SCRIPT-$/,/^-END VERIFY SCRIPT-$/{//!b};d')"
+        if test "x$SCRIPT" = "x"; then
+            echo "Error: missing script for: $commit"
+            echo "Failed"
+            RET=1
+        else
+            echo "Running script for: $commit"
+            echo "$SCRIPT"
+            (eval "$SCRIPT")
+            git --no-pager diff --exit-code $commit && echo "OK" || (echo "Failed"; false) || RET=1
+        fi
+        git reset --quiet --hard HEAD
+     else
+        if git rev-list "--format=%b" -n1 $commit | grep -q '^-\(BEGIN\|END\)[ a-zA-Z]*-$'; then
+            echo "Error: script block marker but no scripted-diff in title of commit $commit"
+            echo "Failed"
+            RET=1
+        fi
+    fi
+done
+git checkout --quiet $PREV_BRANCH 2>/dev/null || git checkout --quiet $PREV_HEAD
+exit $RET
diff --git a/depend/zcash/test/lint/git-subtree-check.sh b/depend/zcash/test/lint/git-subtree-check.sh
new file mode 100755
index 000000000..7c78b2efc
--- /dev/null
+++ b/depend/zcash/test/lint/git-subtree-check.sh
@@ -0,0 +1,96 @@
+#!/bin/sh
+# Copyright (c) 2015 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+
+export LC_ALL=C
+# Strip trailing / from directory path (in case it was added by autocomplete)
+DIR="${1%/}"
+COMMIT="$2"
+if [ -z "$COMMIT" ]; then
+    COMMIT=HEAD
+fi
+
+# Taken from git-subtree (Copyright (C) 2009 Avery Pennarun <apenwarr@gmail.com>)
+find_latest_squash()
+{
+	dir="$1"
+	sq=
+	main=
+	sub=
+	git log --grep="^git-subtree-dir: $dir/*\$" \
+		--pretty=format:'START %H%n%s%n%n%b%nEND%n' "$COMMIT" |
+	while read a b _; do
+		case "$a" in
+			START) sq="$b" ;;
+			git-subtree-mainline:) main="$b" ;;
+			git-subtree-split:) sub="$b" ;;
+			END)
+				if [ -n "$sub" ]; then
+					if [ -n "$main" ]; then
+						# a rejoin commit?
+						# Pretend its sub was a squash.
+						sq="$sub"
+					fi
+					echo "$sq" "$sub"
+					break
+				fi
+				sq=
+				main=
+				sub=
+				;;
+		esac
+	done
+}
+
+# find latest subtree update
+latest_squash="$(find_latest_squash "$DIR")"
+if [ -z "$latest_squash" ]; then
+    echo "ERROR: $DIR is not a subtree" >&2
+    exit 2
+fi
+set $latest_squash
+old=$1
+rev=$2
+
+# get the tree in the current commit
+tree_actual=$(git ls-tree -d "$COMMIT" "$DIR" | head -n 1)
+if [ -z "$tree_actual" ]; then
+    echo "FAIL: subtree directory $DIR not found in $COMMIT" >&2
+    exit 1
+fi
+set $tree_actual
+tree_actual_type=$2
+tree_actual_tree=$3
+echo "$DIR in $COMMIT currently refers to $tree_actual_type $tree_actual_tree"
+if [ "d$tree_actual_type" != "dtree" ]; then
+    echo "FAIL: subtree directory $DIR is not a tree in $COMMIT" >&2
+    exit 1
+fi
+
+# get the tree at the time of the last subtree update
+tree_commit=$(git show -s --format="%T" $old)
+echo "$DIR in $COMMIT was last updated in commit $old (tree $tree_commit)"
+
+# ... and compare the actual tree with it
+if [ "$tree_actual_tree" != "$tree_commit" ]; then
+    git diff $tree_commit $tree_actual_tree >&2
+    echo "FAIL: subtree directory was touched without subtree merge" >&2
+    exit 1
+fi
+
+# get the tree in the subtree commit referred to
+if [ "d$(git cat-file -t $rev 2>/dev/null)" != dcommit ]; then
+    echo "subtree commit $rev unavailable: cannot compare. Did you add and fetch the remote?" >&2
+    exit
+fi
+tree_subtree=$(git show -s --format="%T" $rev)
+echo "$DIR in $COMMIT was last updated to upstream commit $rev (tree $tree_subtree)"
+
+# ... and compare the actual tree with it
+if [ "$tree_actual_tree" != "$tree_subtree" ]; then
+    echo "FAIL: subtree update commit differs from upstream tree!" >&2
+    exit 1
+fi
+
+echo "GOOD"
diff --git a/depend/zcash/test/lint/lint-all.sh b/depend/zcash/test/lint/lint-all.sh
new file mode 100755
index 000000000..ed26c6c97
--- /dev/null
+++ b/depend/zcash/test/lint/lint-all.sh
@@ -0,0 +1,30 @@
+#!/usr/bin/env bash
+#
+# Copyright (c) 2017-2019 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+#
+# This script runs all contrib/devtools/lint-*.sh files, and fails if any exit
+# with a non-zero status code.
+
+# This script is intentionally locale-dependent by not setting "export LC_ALL=C".
+# in order to allow for the executed lint scripts to opt in or opt out of locale
+# dependence themselves.
+
+set -u
+
+SCRIPTDIR=$(dirname "${BASH_SOURCE[0]}")
+LINTALL=$(basename "${BASH_SOURCE[0]}")
+
+EXIT_CODE=0
+
+for f in "${SCRIPTDIR}"/lint-*.sh; do
+  if [ "$(basename "$f")" != "$LINTALL" ]; then
+    if ! "$f"; then
+      echo "^---- failure generated from $f"
+      EXIT_CODE=1
+    fi
+  fi
+done
+
+exit ${EXIT_CODE}
diff --git a/depend/zcash/test/lint/lint-cargo-patches.sh b/depend/zcash/test/lint/lint-cargo-patches.sh
new file mode 100755
index 000000000..b340f6f29
--- /dev/null
+++ b/depend/zcash/test/lint/lint-cargo-patches.sh
@@ -0,0 +1,62 @@
+#!/usr/bin/env bash
+#
+# Copyright (c) 2022 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+#
+# Check that any patched Cargo dependencies are correctly configured.
+
+export LC_ALL=C
+
+REPOBASE="$(dirname $0)/../.."
+CARGO_TOML="$REPOBASE/Cargo.toml"
+CONFIG_FILE="$REPOBASE/.cargo/config.offline"
+
+CARGO_TOML_PATCH_PREFIX="[patch.crates-io]"
+let CARGO_TOML_PATCH_START=$(grep -Fn "$CARGO_TOML_PATCH_PREFIX" $CARGO_TOML | cut -d: -f1)+1
+
+REPLACE_LINE="replace-with = \"vendored-sources\""
+
+EXIT_CODE=0
+
+# Check that every patch specifies a revision.
+# TODO: Implement.
+
+# Check that every patch has a matching replacement.
+for PATCH in $(tail -n+$CARGO_TOML_PATCH_START $CARGO_TOML | sed 's/.*git = "\([^"]*\)", rev = "\([^"]*\)".*/\1#\2/' | sort | uniq)
+do
+    PATCH_GIT=$(echo $PATCH | sed 's/#.*//')
+    PATCH_REV=$(echo $PATCH | sed 's/.*#//')
+
+    # Canonicalize the git URL (matching how Cargo treats them, so we don't over-lint).
+    # https://github.com/rust-lang/cargo/blob/master/src/cargo/util/canonical_url.rs
+    CANONICAL_GIT=$(echo $PATCH_GIT | sed 's/\/$//' | sed 's/.git$//')
+    MAYBE_SUFFIX="\(.git\)\?/\?"
+
+    CONFIG_START=$(grep -n "^\[source\.\"$CANONICAL_GIT$MAYBE_SUFFIX\"\]$" $CONFIG_FILE | cut -d: -f1)
+    if [ -n "$CONFIG_START" ]; then
+        HAVE_GIT=$(tail -n+$CONFIG_START $CONFIG_FILE | head -n4 | grep "^git = \"$CANONICAL_GIT$MAYBE_SUFFIX\"$")
+        HAVE_REV=$(tail -n+$CONFIG_START $CONFIG_FILE | head -n4 | grep "^rev = \"$PATCH_REV\"$")
+        HAVE_REPLACE=$(tail -n+$CONFIG_START $CONFIG_FILE | head -n4 | grep "^$REPLACE_LINE$")
+    fi
+
+    if [ -z "$CONFIG_START" ] || [ -z "$HAVE_GIT" ] || [ -z "$HAVE_REV" ] || [ -z "$HAVE_REPLACE" ]; then
+        echo "Missing replacement in .cargo/config.offline:"
+        echo "  [source.\"$PATCH_GIT\"]"
+        echo "  git = \"$PATCH_GIT\""
+        echo "  rev = \"$PATCH_REV\""
+        echo "  $REPLACE_LINE"
+        echo
+        EXIT_CODE=1
+    fi
+
+    # Reset for the next iteration.
+    HAVE_GIT=
+    HAVE_REV=
+    HAVE_REPLACE=
+done
+
+# Check for unused replacements.
+# TODO: Implement.
+
+exit ${EXIT_CODE}
diff --git a/depend/zcash/test/lint/lint-include-guards.sh b/depend/zcash/test/lint/lint-include-guards.sh
new file mode 100755
index 000000000..37b77c5a9
--- /dev/null
+++ b/depend/zcash/test/lint/lint-include-guards.sh
@@ -0,0 +1,35 @@
+#!/usr/bin/env bash
+#
+# Copyright (c) 2018 The Bitcoin Core developers
+# Copyright (c) 2020 The Zcash developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+#
+# Check include guards.
+
+export LC_ALL=C
+HEADER_ID_PREFIX="ZCASH_"
+HEADER_ID_PREFIX_UPSTREAM="BITCOIN_"
+HEADER_ID_SUFFIX="_H"
+
+REGEXP_EXCLUDE_FILES_WITH_PREFIX="src/(crypto/ctaes/|leveldb/|secp256k1/|tinyformat.h|univalue/)"
+
+EXIT_CODE=0
+for HEADER_FILE in $(git ls-files -- "*.h" | grep -vE "^${REGEXP_EXCLUDE_FILES_WITH_PREFIX}")
+do
+    HEADER_ID_BASE=$(cut -f2- -d/ <<< "${HEADER_FILE}" | sed "s/\.h$//g" | tr / _ | tr - _ | tr "[:lower:]" "[:upper:]")
+    HEADER_ID="${HEADER_ID_PREFIX}${HEADER_ID_BASE}${HEADER_ID_SUFFIX}"
+    HEADER_ID_UPSTREAM="${HEADER_ID_PREFIX_UPSTREAM}${HEADER_ID_BASE}${HEADER_ID_SUFFIX}"
+    if [[ $(grep -cE "^#(ifndef|define) ${HEADER_ID}" "${HEADER_FILE}") != 2 ]]; then
+        if [[ $(grep -cE "^#(ifndef|define) ${HEADER_ID_UPSTREAM}" "${HEADER_FILE}") != 2 ]]; then
+            echo "${HEADER_FILE} seems to be missing the expected include guard:"
+            echo "  #ifndef ${HEADER_ID}"
+            echo "  #define ${HEADER_ID}"
+            echo "  ..."
+            echo "  #endif // ${HEADER_ID}"
+            echo
+            EXIT_CODE=1
+        fi
+    fi
+done
+exit ${EXIT_CODE}
diff --git a/depend/zcash/test/lint/lint-includes.sh b/depend/zcash/test/lint/lint-includes.sh
new file mode 100755
index 000000000..ece95d7a5
--- /dev/null
+++ b/depend/zcash/test/lint/lint-includes.sh
@@ -0,0 +1,132 @@
+#!/usr/bin/env bash
+#
+# Copyright (c) 2018 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+#
+# Check for duplicate includes.
+# Guard against accidental introduction of new Boost dependencies.
+
+export LC_ALL=C
+
+# cd to root folder of git repo for git ls-files to work properly
+cd "$(dirname $0)/../.." || exit 1
+
+filter_suffix() {
+    git ls-files | grep -E "^src/.*\.${1}"'$'
+}
+
+EXIT_CODE=0
+
+for HEADER_FILE in $(filter_suffix h); do
+    DUPLICATE_INCLUDES_IN_HEADER_FILE=$(grep -E "^#include " < "${HEADER_FILE}" | sort | uniq -d)
+    if [[ ${DUPLICATE_INCLUDES_IN_HEADER_FILE} != "" ]]; then
+        echo "Duplicate include(s) in ${HEADER_FILE}:"
+        echo "${DUPLICATE_INCLUDES_IN_HEADER_FILE}"
+        echo
+        EXIT_CODE=1
+    fi
+done
+
+for CPP_FILE in $(filter_suffix cpp); do
+    DUPLICATE_INCLUDES_IN_CPP_FILE=$(grep -E "^#include " < "${CPP_FILE}" | sort | uniq -d)
+    if [[ ${DUPLICATE_INCLUDES_IN_CPP_FILE} != "" ]]; then
+        echo "Duplicate include(s) in ${CPP_FILE}:"
+        echo "${DUPLICATE_INCLUDES_IN_CPP_FILE}"
+        echo
+        EXIT_CODE=1
+    fi
+done
+
+EXPECTED_BOOST_INCLUDES=(
+    boost/algorithm/string.hpp
+    boost/algorithm/string/case_conv.hpp
+    boost/algorithm/string/classification.hpp
+    boost/algorithm/string/join.hpp
+    boost/algorithm/string/predicate.hpp
+    boost/algorithm/string/replace.hpp
+    boost/algorithm/string/split.hpp
+    boost/algorithm/string/trim.hpp
+    boost/assert.hpp
+    boost/assign/list_of.hpp
+    boost/assign/std/vector.hpp
+    boost/bind/bind.hpp
+    boost/chrono/chrono.hpp
+    boost/date_time/posix_time/posix_time.hpp
+    boost/date_time/posix_time/posix_time_types.hpp
+    boost/dynamic_bitset.hpp
+    boost/filesystem.hpp
+    boost/filesystem/detail/utf8_codecvt_facet.hpp
+    boost/filesystem/fstream.hpp
+    boost/format.hpp
+    boost/function.hpp
+    boost/interprocess/sync/file_lock.hpp
+    boost/iostreams/concepts.hpp
+    boost/iostreams/stream.hpp
+    boost/math/distributions/poisson.hpp
+    boost/preprocessor/arithmetic/add.hpp
+    boost/preprocessor/arithmetic/sub.hpp
+    boost/preprocessor/cat.hpp
+    boost/preprocessor/comparison/equal.hpp
+    boost/preprocessor/comparison/less.hpp
+    boost/preprocessor/control/if.hpp
+    boost/preprocessor/stringize.hpp
+    boost/program_options/detail/config_file.hpp
+    boost/program_options/parsers.hpp
+    boost/random/mersenne_twister.hpp
+    boost/random/uniform_int_distribution.hpp
+    boost/range/irange.hpp
+    boost/scope_exit.hpp
+    boost/scoped_ptr.hpp
+    boost/shared_ptr.hpp
+    boost/signals2/connection.hpp
+    boost/signals2/last_value.hpp
+    boost/signals2/signal.hpp
+    boost/test/data/test_case.hpp
+    boost/test/unit_test.hpp
+    boost/thread.hpp
+    boost/thread/condition_variable.hpp
+    boost/thread/exceptions.hpp
+    boost/thread/locks.hpp
+    boost/thread/mutex.hpp
+    boost/thread/once.hpp
+    boost/thread/recursive_mutex.hpp
+    boost/thread/synchronized_value.hpp
+    boost/thread/thread.hpp
+    boost/thread/tss.hpp
+    boost/tuple/tuple.hpp
+    boost/unordered_map.hpp
+    boost/unordered_set.hpp
+    boost/uuid/uuid.hpp
+    boost/uuid/uuid_generators.hpp
+    boost/uuid/uuid_io.hpp
+    boost/version.hpp
+)
+
+for BOOST_INCLUDE in $(git grep '^#include <boost/' -- "*.cpp" "*.h" | cut -f2 -d: | cut -f2 -d'<' | cut -f1 -d'>' | sort -u); do
+    IS_EXPECTED_INCLUDE=0
+    for EXPECTED_BOOST_INCLUDE in "${EXPECTED_BOOST_INCLUDES[@]}"; do
+        if [[ "${BOOST_INCLUDE}" == "${EXPECTED_BOOST_INCLUDE}" ]]; then
+            IS_EXPECTED_INCLUDE=1
+            break
+        fi
+    done
+    if [[ ${IS_EXPECTED_INCLUDE} == 0 ]]; then
+        EXIT_CODE=1
+        echo "A new Boost dependency in the form of \"${BOOST_INCLUDE}\" appears to have been introduced:"
+        git grep "${BOOST_INCLUDE}" -- "*.cpp" "*.h"
+        echo
+    fi
+done
+
+for EXPECTED_BOOST_INCLUDE in "${EXPECTED_BOOST_INCLUDES[@]}"; do
+    if ! git grep -q "^#include <${EXPECTED_BOOST_INCLUDE}>" -- "*.cpp" "*.h"; then
+        echo "Good job! The Boost dependency \"${EXPECTED_BOOST_INCLUDE}\" is no longer used."
+        echo "Please remove it from EXPECTED_BOOST_INCLUDES in $0"
+        echo "to make sure this dependency is not accidentally reintroduced."
+        echo
+        EXIT_CODE=1
+    fi
+done
+
+exit ${EXIT_CODE}
diff --git a/depend/zcash/test/lint/lint-locale-dependence.sh b/depend/zcash/test/lint/lint-locale-dependence.sh
new file mode 100755
index 000000000..6265d425c
--- /dev/null
+++ b/depend/zcash/test/lint/lint-locale-dependence.sh
@@ -0,0 +1,231 @@
+#!/usr/bin/env bash
+
+export LC_ALL=C
+KNOWN_VIOLATIONS=(
+    "src/base58.cpp:.*isspace"
+    "src/bitcoin-tx.cpp.*stoul"
+    "src/bitcoin-tx.cpp.*trim_right"
+    "src/bitcoin-tx.cpp:.*atoi"
+    "src/rpc/blockchain.cpp:.*stoi"
+    "src/core_read.cpp.*is_digit"
+    "src/dbwrapper.cpp.*stoul"
+    "src/dbwrapper.cpp:.*vsnprintf"
+    "src/httprpc.cpp.*trim"
+    "src/init.cpp:.*atoi"
+    "src/netbase.cpp.*to_lower"
+    "src/qt/rpcconsole.cpp:.*atoi"
+    "src/qt/rpcconsole.cpp:.*isdigit"
+    "src/rest.cpp:.*strtol"
+    "src/rpc/server.cpp.*to_upper"
+    "src/test/dbwrapper_tests.cpp:.*snprintf"
+    "src/test/getarg_tests.cpp.*split"
+    "src/torcontrol.cpp:.*atoi"
+    "src/torcontrol.cpp:.*strtol"
+    "src/uint256.cpp:.*isspace"
+    "src/uint256.cpp:.*tolower"
+    "src/util.cpp:.*atoi"
+    "src/util.cpp:.*fprintf"
+    "src/util.cpp:.*tolower"
+    "src/utilmoneystr.cpp:.*isdigit"
+    "src/utilmoneystr.cpp:.*isspace"
+    "src/utilstrencodings.cpp:.*atoi"
+    "src/utilstrencodings.cpp:.*isspace"
+    "src/utilstrencodings.cpp:.*strtol"
+    "src/utilstrencodings.cpp:.*strtoll"
+    "src/utilstrencodings.cpp:.*strtoul"
+    "src/utilstrencodings.cpp:.*strtoull"
+    "src/utilstrencodings.h:.*atoi"
+)
+
+REGEXP_IGNORE_EXTERNAL_DEPENDENCIES="^src/(crypto/ctaes/|leveldb/|secp256k1/|tinyformat.h|univalue/)"
+
+LOCALE_DEPENDENT_FUNCTIONS=(
+    alphasort    # LC_COLLATE (via strcoll)
+    asctime      # LC_TIME (directly)
+    asprintf     # (via vasprintf)
+    atof         # LC_NUMERIC (via strtod)
+    atoi         # LC_NUMERIC (via strtol)
+    atol         # LC_NUMERIC (via strtol)
+    atoll        # (via strtoll)
+    atoq
+    btowc        # LC_CTYPE (directly)
+    ctime        # (via asctime or localtime)
+    dprintf      # (via vdprintf)
+    fgetwc
+    fgetws
+    fold_case    # boost::locale::fold_case
+    fprintf      # (via vfprintf)
+    fputwc
+    fputws
+    fscanf       # (via __vfscanf)
+    fwprintf     # (via __vfwprintf)
+    getdate      # via __getdate_r => isspace // __localtime_r
+    getwc
+    getwchar
+    is_digit     # boost::algorithm::is_digit
+    is_space     # boost::algorithm::is_space
+    isalnum      # LC_CTYPE
+    isalpha      # LC_CTYPE
+    isblank      # LC_CTYPE
+    iscntrl      # LC_CTYPE
+    isctype      # LC_CTYPE
+    isdigit      # LC_CTYPE
+    isgraph      # LC_CTYPE
+    islower      # LC_CTYPE
+    isprint      # LC_CTYPE
+    ispunct      # LC_CTYPE
+    isspace      # LC_CTYPE
+    isupper      # LC_CTYPE
+    iswalnum     # LC_CTYPE
+    iswalpha     # LC_CTYPE
+    iswblank     # LC_CTYPE
+    iswcntrl     # LC_CTYPE
+    iswctype     # LC_CTYPE
+    iswdigit     # LC_CTYPE
+    iswgraph     # LC_CTYPE
+    iswlower     # LC_CTYPE
+    iswprint     # LC_CTYPE
+    iswpunct     # LC_CTYPE
+    iswspace     # LC_CTYPE
+    iswupper     # LC_CTYPE
+    iswxdigit    # LC_CTYPE
+    isxdigit     # LC_CTYPE
+    localeconv   # LC_NUMERIC + LC_MONETARY
+    mblen        # LC_CTYPE
+    mbrlen
+    mbrtowc
+    mbsinit
+    mbsnrtowcs
+    mbsrtowcs
+    mbstowcs     # LC_CTYPE
+    mbtowc       # LC_CTYPE
+    mktime
+    normalize    # boost::locale::normalize
+#   printf       # LC_NUMERIC
+    putwc
+    putwchar
+    scanf        # LC_NUMERIC
+    setlocale
+    snprintf
+    sprintf
+    sscanf
+    stod
+    stof
+    stoi
+    stol
+    stold
+    stoll
+    stoul
+    stoull
+    strcasecmp
+    strcasestr
+    strcoll      # LC_COLLATE
+#   strerror
+    strfmon
+    strftime     # LC_TIME
+    strncasecmp
+    strptime
+    strtod       # LC_NUMERIC
+    strtof
+    strtoimax
+    strtol       # LC_NUMERIC
+    strtold
+    strtoll
+    strtoq
+    strtoul      # LC_NUMERIC
+    strtoull
+    strtoumax
+    strtouq
+    strxfrm      # LC_COLLATE
+    swprintf
+    to_lower     # boost::locale::to_lower
+    to_title     # boost::locale::to_title
+    to_upper     # boost::locale::to_upper
+    tolower      # LC_CTYPE
+    toupper      # LC_CTYPE
+    towctrans
+    towlower     # LC_CTYPE
+    towupper     # LC_CTYPE
+    trim         # boost::algorithm::trim
+    trim_left    # boost::algorithm::trim_left
+    trim_right   # boost::algorithm::trim_right
+    ungetwc
+    vasprintf
+    vdprintf
+    versionsort
+    vfprintf
+    vfscanf
+    vfwprintf
+    vprintf
+    vscanf
+    vsnprintf
+    vsprintf
+    vsscanf
+    vswprintf
+    vwprintf
+    wcrtomb
+    wcscasecmp
+    wcscoll      # LC_COLLATE
+    wcsftime     # LC_TIME
+    wcsncasecmp
+    wcsnrtombs
+    wcsrtombs
+    wcstod       # LC_NUMERIC
+    wcstof
+    wcstoimax
+    wcstol       # LC_NUMERIC
+    wcstold
+    wcstoll
+    wcstombs     # LC_CTYPE
+    wcstoul      # LC_NUMERIC
+    wcstoull
+    wcstoumax
+    wcswidth
+    wcsxfrm      # LC_COLLATE
+    wctob
+    wctomb       # LC_CTYPE
+    wctrans
+    wctype
+    wcwidth
+    wprintf
+)
+
+function join_array {
+    local IFS="$1"
+    shift
+    echo "$*"
+}
+
+REGEXP_IGNORE_KNOWN_VIOLATIONS=$(join_array "|" "${KNOWN_VIOLATIONS[@]}")
+
+# Invoke "git grep" only once in order to minimize run-time
+REGEXP_LOCALE_DEPENDENT_FUNCTIONS=$(join_array "|" "${LOCALE_DEPENDENT_FUNCTIONS[@]}")
+GIT_GREP_OUTPUT=$(git grep -E "[^a-zA-Z0-9_\`'\"<>](${REGEXP_LOCALE_DEPENDENT_FUNCTIONS}(_r|_s)?)[^a-zA-Z0-9_\`'\"<>]" -- "*.cpp" "*.h")
+
+EXIT_CODE=0
+for LOCALE_DEPENDENT_FUNCTION in "${LOCALE_DEPENDENT_FUNCTIONS[@]}"; do
+    MATCHES=$(grep -E "[^a-zA-Z0-9_\`'\"<>]${LOCALE_DEPENDENT_FUNCTION}(_r|_s)?[^a-zA-Z0-9_\`'\"<>]" <<< "${GIT_GREP_OUTPUT}" | \
+        grep -vE "\.(c|cpp|h):\s*(//|\*|/\*|\").*${LOCALE_DEPENDENT_FUNCTION}" | \
+        grep -vE 'fprintf\(.*(stdout|stderr)')
+    if [[ ${REGEXP_IGNORE_EXTERNAL_DEPENDENCIES} != "" ]]; then
+        MATCHES=$(grep -vE "${REGEXP_IGNORE_EXTERNAL_DEPENDENCIES}" <<< "${MATCHES}")
+    fi
+    if [[ ${REGEXP_IGNORE_KNOWN_VIOLATIONS} != "" ]]; then
+        MATCHES=$(grep -vE "${REGEXP_IGNORE_KNOWN_VIOLATIONS}" <<< "${MATCHES}")
+    fi
+    if [[ ${MATCHES} != "" ]]; then
+        echo "The locale dependent function ${LOCALE_DEPENDENT_FUNCTION}(...) appears to be used:"
+        echo "${MATCHES}"
+        echo
+        EXIT_CODE=1
+    fi
+done
+if [[ ${EXIT_CODE} != 0 ]]; then
+    echo "Unnecessary locale dependence can cause bugs that are very"
+    echo "tricky to isolate and fix. Please avoid using locale-dependent"
+    echo "functions if possible."
+    echo
+    echo "Advice not applicable in this specific case? Add an exception"
+    echo "by updating the ignore list in $0"
+fi
+exit ${EXIT_CODE}
diff --git a/depend/zcash/test/lint/lint-python-utf8-encoding.sh b/depend/zcash/test/lint/lint-python-utf8-encoding.sh
new file mode 100755
index 000000000..236c652a7
--- /dev/null
+++ b/depend/zcash/test/lint/lint-python-utf8-encoding.sh
@@ -0,0 +1,20 @@
+#!/usr/bin/env bash
+#
+# Copyright (c) 2018 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+#
+# Make sure we explicitly open all text files using UTF-8 (or ASCII) encoding to
+# avoid potential issues on the BSDs where the locale is not always set.
+
+export LC_ALL=C
+EXIT_CODE=0
+OUTPUT=$(git grep " open(" -- "*.py" | grep -vE "encoding=.(ascii|utf8|utf-8)." | grep -vE "open\([^,]*, ['\"][^'\"]*b[^'\"]*['\"]")
+if [[ ${OUTPUT} != "" ]]; then
+    echo "Python's open(...) seems to be used to open text files without explicitly"
+    echo "specifying encoding=\"utf8\":"
+    echo
+    echo "${OUTPUT}"
+    EXIT_CODE=1
+fi
+exit ${EXIT_CODE}
diff --git a/depend/zcash/test/lint/lint-shebang.sh b/depend/zcash/test/lint/lint-shebang.sh
new file mode 100755
index 000000000..e6eb8524c
--- /dev/null
+++ b/depend/zcash/test/lint/lint-shebang.sh
@@ -0,0 +1,25 @@
+#!/usr/bin/env bash
+#
+# Copyright (c) 2018 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+#
+# Assert expected shebang lines
+
+export LC_ALL=C
+EXIT_CODE=0
+for PYTHON_FILE in $(git ls-files -- "*.py"); do
+    if [[ $(head -c 2 "${PYTHON_FILE}") == "#!" &&
+          $(head -n 1 "${PYTHON_FILE}") != "#!/usr/bin/env python3" ]]; then
+        echo "Missing shebang \"#!/usr/bin/env python3\" in ${PYTHON_FILE} (do not use python or python2)"
+        EXIT_CODE=1
+    fi
+done
+for SHELL_FILE in $(git ls-files -- "*.sh"); do
+    if [[ $(head -n 1 "${SHELL_FILE}") != "#!/usr/bin/env bash" &&
+          $(head -n 1 "${SHELL_FILE}") != "#!/bin/sh" ]]; then
+        echo "Missing expected shebang \"#!/usr/bin/env bash\" or \"#!/bin/sh\" in ${SHELL_FILE}"
+        EXIT_CODE=1
+    fi
+done
+exit ${EXIT_CODE}
diff --git a/depend/zcash/test/lint/lint-shell-locale.sh b/depend/zcash/test/lint/lint-shell-locale.sh
new file mode 100755
index 000000000..1a2bc26f0
--- /dev/null
+++ b/depend/zcash/test/lint/lint-shell-locale.sh
@@ -0,0 +1,25 @@
+#!/usr/bin/env bash
+#
+# Copyright (c) 2018 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+#
+# Make sure all shell scripts:
+# a.) explicitly opt out of locale dependence using
+#     "export LC_ALL=C" or "export LC_ALL=C.UTF-8", or
+# b.) explicitly opt in to locale dependence using the annotation below.
+
+export LC_ALL=C
+
+EXIT_CODE=0
+for SHELL_SCRIPT in $(git ls-files -- "*.sh"); do
+    if grep -q "# This script is intentionally locale-dependent by not setting \"export LC_ALL=C\"." "${SHELL_SCRIPT}"; then
+        continue
+    fi
+    FIRST_NON_COMMENT_LINE=$(grep -vE '^(#.*)?$' "${SHELL_SCRIPT}" | head -1)
+    if [[ ${FIRST_NON_COMMENT_LINE} != "export LC_ALL=C" && ${FIRST_NON_COMMENT_LINE} != "export LC_ALL=\"C\"" && ${FIRST_NON_COMMENT_LINE} != "export LC_ALL=C.UTF-8" ]]; then
+        echo "Missing \"export LC_ALL=C\" (to avoid locale dependence) as first non-comment non-empty line in ${SHELL_SCRIPT}"
+        EXIT_CODE=1
+    fi
+done
+exit ${EXIT_CODE}
diff --git a/depend/zcash/test/lint/lint-shell.sh b/depend/zcash/test/lint/lint-shell.sh
new file mode 100755
index 000000000..00523f66e
--- /dev/null
+++ b/depend/zcash/test/lint/lint-shell.sh
@@ -0,0 +1,47 @@
+#!/usr/bin/env bash
+#
+# Copyright (c) 2018 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+#
+# Check for shellcheck warnings in shell scripts.
+
+export LC_ALL=C
+
+# The shellcheck binary segfault/coredumps in Travis with LC_ALL=C
+# It does not do so in Ubuntu 14.04, 16.04, 18.04 in versions 0.3.3, 0.3.7, 0.4.6
+# respectively. So export LC_ALL=C is set as required by lint-shell-locale.sh
+# but unset here in case of running in Travis.
+if [ "$TRAVIS" = "true" ]; then
+    unset LC_ALL
+fi
+
+if ! command -v shellcheck > /dev/null; then
+    echo "Skipping shell linting since shellcheck is not installed."
+    exit 0
+fi
+
+# Disabled warnings:
+disabled=(
+    SC1087 # Use braces when expanding arrays, e.g. ${array[idx]} (or ${var}[.. to quiet).
+    SC2001 # See if you can use ${variable//search/replace} instead.
+    SC2004 # $/${} is unnecessary on arithmetic variables.
+    SC2005 # Useless echo? Instead of 'echo $(cmd)', just use 'cmd'.
+    SC2006 # Use $(..) instead of legacy `..`.
+    SC2016 # Expressions don't expand in single quotes, use double quotes for that.
+    SC2028 # echo won't expand escape sequences. Consider printf.
+    SC2046 # Quote this to prevent word splitting.
+    SC2048 # Use "$@" (with quotes) to prevent whitespace problems.
+    SC2066 # Since you double quoted this, it will not word split, and the loop will only run once.
+    SC2086 # Double quote to prevent globbing and word splitting.
+    SC2116 # Useless echo? Instead of 'cmd $(echo foo)', just use 'cmd foo'.
+    SC2162 # read without -r will mangle backslashes.
+    SC2166 # Prefer [ p ] {&&,||} [ q ] as [ p -{a,o} q ] is not well defined.
+    SC2181 # Check exit code directly with e.g. 'if mycmd;', not indirectly with $?.
+    SC2206 # Quote to prevent word splitting, or split robustly with mapfile or read -a.
+    SC2207 # Prefer mapfile or read -a to split command output (or quote to avoid splitting).
+    SC2230 # which is non-standard. Use builtin 'command -v' instead.
+    SC2236 # Don't force -n instead of ! -z.
+)
+shellcheck -e "$(IFS=","; echo "${disabled[*]}")" \
+    $(git ls-files -- "*.sh")
diff --git a/depend/zcash/test/lint/lint-whitespace.sh b/depend/zcash/test/lint/lint-whitespace.sh
new file mode 100755
index 000000000..83adb094d
--- /dev/null
+++ b/depend/zcash/test/lint/lint-whitespace.sh
@@ -0,0 +1,113 @@
+#!/usr/bin/env bash
+#
+# Copyright (c) 2017 The Bitcoin Core developers
+# Distributed under the MIT software license, see the accompanying
+# file COPYING or https://www.opensource.org/licenses/mit-license.php .
+#
+# Check for new lines in diff that introduce trailing whitespace.
+
+# We can't run this check unless we know the commit range for the PR.
+
+export LC_ALL=C
+while getopts "?" opt; do
+  case $opt in
+    ?)
+      echo "Usage: .lint-whitespace.sh [N]"
+      echo "       TRAVIS_COMMIT_RANGE='<commit range>' .lint-whitespace.sh"
+      echo "       .lint-whitespace.sh -?"
+      echo "Checks unstaged changes, the previous N commits, or a commit range."
+      echo "TRAVIS_COMMIT_RANGE='47ba2c3...ee50c9e' .lint-whitespace.sh"
+      exit 0
+    ;;
+  esac
+done
+
+if [ -z "${TRAVIS_COMMIT_RANGE}" ]; then
+  if [ -n "$1" ]; then
+    TRAVIS_COMMIT_RANGE="HEAD~$1...HEAD"
+  else
+    TRAVIS_COMMIT_RANGE="HEAD"
+  fi
+fi
+
+showdiff() {
+  if ! git diff -U0 "${TRAVIS_COMMIT_RANGE}" -- "." ":(exclude)depends/patches/" ":(exclude)doc/release-notes/"; then
+    echo "Failed to get a diff"
+    exit 1
+  fi
+}
+
+showcodediff() {
+  if ! git diff -U0 "${TRAVIS_COMMIT_RANGE}" -- *.cpp *.h *.md *.py *.sh ":(exclude)doc/release-notes/"; then
+    echo "Failed to get a diff"
+    exit 1
+  fi
+}
+
+RET=0
+
+# Check if trailing whitespace was found in the diff.
+if showdiff | grep -E -q '^\+.*\s+$'; then
+  echo "This diff appears to have added new lines with trailing whitespace."
+  echo "The following changes were suspected:"
+  FILENAME=""
+  SEEN=0
+  SEENLN=0
+  while read -r line; do
+    if [[ "$line" =~ ^diff ]]; then
+      FILENAME="$line"
+      SEEN=0
+    elif [[ "$line" =~ ^@@ ]]; then
+      LINENUMBER="$line"
+      SEENLN=0
+    else
+      if [ "$SEEN" -eq 0 ]; then
+        # The first time a file is seen with trailing whitespace, we print the
+        # filename (preceded by a newline).
+        echo
+        echo "$FILENAME"
+        SEEN=1
+      fi
+      if [ "$SEENLN" -eq 0 ]; then
+        echo "$LINENUMBER"
+        SEENLN=1
+      fi
+      echo "$line"
+    fi
+  done < <(showdiff | grep -E '^(diff --git |@@|\+.*\s+$)')
+  RET=1
+fi
+
+# Check if tab characters were found in the diff.
+if showcodediff | perl -nle '$MATCH++ if m{^\+.*\t}; END{exit 1 unless $MATCH>0}' > /dev/null; then
+  echo "This diff appears to have added new lines with tab characters instead of spaces."
+  echo "The following changes were suspected:"
+  FILENAME=""
+  SEEN=0
+  SEENLN=0
+  while read -r line; do
+    if [[ "$line" =~ ^diff ]]; then
+      FILENAME="$line"
+      SEEN=0
+    elif [[ "$line" =~ ^@@ ]]; then
+      LINENUMBER="$line"
+      SEENLN=0
+    else
+      if [ "$SEEN" -eq 0 ]; then
+        # The first time a file is seen with a tab character, we print the
+        # filename (preceded by a newline).
+        echo
+        echo "$FILENAME"
+        SEEN=1
+      fi
+      if [ "$SEENLN" -eq 0 ]; then
+        echo "$LINENUMBER"
+        SEENLN=1
+      fi
+      echo "$line"
+    fi
+  done < <(showcodediff | perl -nle 'print if m{^(diff --git |@@|\+.*\t)}')
+  RET=1
+fi
+
+exit $RET
diff --git a/depend/zcash/zcutil/afl/afl-build.sh b/depend/zcash/zcutil/afl/afl-build.sh
new file mode 100755
index 000000000..9cf1e7e34
--- /dev/null
+++ b/depend/zcash/zcutil/afl/afl-build.sh
@@ -0,0 +1,105 @@
+#!/usr/bin/env bash
+
+export LC_ALL=C
+set -eu -o pipefail
+
+AFL_HARDEN=1
+CONFIGURE_FLAGS="--enable-tests=no --enable-fuzz-main"
+ZCUTIL=$(realpath "./zcutil")
+export AFL_LOG_DIR="$(pwd)"
+
+for d in src/fuzzing/*/ ; do
+    fuzz_cases+="$(basename "$d"), "
+    fuzz_cases_choices=("${fuzz_cases_choices[@]}" $(basename "$d"))
+done
+
+FUZZ_OPTIONS_STRING="Options are: ${fuzz_cases::-2}"
+
+required_options_count=0
+DEFAULT_BUILD_CC="CC=$ZCUTIL/afl/zcash-wrapper-gcc"
+DEFAULT_BUILD_CXX="CXX=$ZCUTIL/afl/zcash-wrapper-g++"
+
+function help {
+    cat <<EOF
+A wrapper around ./zcutil/build.sh for instrumenting the build with AFL.
+You may obtain a copy of AFL using ./zcutil/afl/afl-get.sh.
+This script must be run from within the top level directory of a zcash clone.
+Additional arguments are passed-through to build.sh.
+
+Usage:
+    $0 --afl-install=AFL_INSTALL_DIR --fuzz-case=FUZZ_CASE [ OPTIONS ... ] [ ARGUMENTS ... ]
+
+    OPTIONS:
+        -a, --disable-harden    Turn off AFL_HARDEN. Default: $AFL_HARDEN
+        -c, --configure-flags   Pass this flags to ./configure. Default: $CONFIGURE_FLAGS
+        -f, --fuzz-case         $FUZZ_OPTIONS_STRING
+        -h, --help              Print this help message
+        -l, --afl-log           Directory to save AFL logs. Default: $AFL_LOG_DIR
+        -i, --afl-install       Directory where AFL is installed
+        -z, --zcutil            The zcutil directory. Default $(realpath "./zcutil")
+    ARGUMENTS:
+        By default we are passing to build.sh the following flags:
+            $DEFAULT_BUILD_CC
+            $DEFAULT_BUILD_CXX
+    EXAMPLE:
+        ./zcutil/afl/afl-build.sh -i /tmp/afl -f DecodeHexTx
+
+EOF
+}
+
+while (( "$#" )); do
+    case "$1" in
+        -a|--disable-harden)
+            AFL_HARDEN=0
+            shift
+        ;;
+        -c|--configure-flags)
+            CONFIGURE_FLAGS=$2
+            shift 2
+        ;;
+        -f|--fuzz-case)
+            FUZZ_CASE=$2
+            ((++required_options_count))
+            shift 2
+        ;;
+        -h|--help)
+            help
+            exit 0
+        ;;
+        -i|--afl-install-dir)
+            AFL_INSTALL_DIR=$(realpath "$2")
+            ((++required_options_count))
+            shift 2
+        ;;
+        -l|--afl-logs)
+            AFL_LOG_DIR=$(realpath "$2")
+            shift 2
+        ;;
+        -z|--zcutil)
+            ZCUTIL=$(realpath "$2")
+            shift 2
+        ;;
+        -*|--*=)
+            echo "Error: Unsupported flag $1" >&2
+            help
+            exit 1
+        ;;
+    esac
+done
+
+if ((required_options_count < 2)); then
+    help
+    exit 1
+fi
+
+if ! [[ "${fuzz_cases_choices[*]} " == *" $FUZZ_CASE "* ]]; then
+    echo "fuzz case option is invalid. ($FUZZ_OPTIONS_STRING)"
+    exit 1
+fi
+
+cp "./src/fuzzing/$FUZZ_CASE/fuzz.cpp" src/fuzz.cpp
+
+CONFIGURE_FLAGS="$CONFIGURE_FLAGS" $ZCUTIL/build.sh $DEFAULT_BUILD_CC $DEFAULT_BUILD_CXX AFL_HARDEN=$AFL_HARDEN -j$(nproc) "$@"
+
+echo "Build finished. You can now run AFL as follows:"
+echo "./zcutil/afl/afl-run.sh -i $AFL_INSTALL_DIR -f $FUZZ_CASE"
diff --git a/depend/zcash/zcutil/afl/afl-get.sh b/depend/zcash/zcutil/afl/afl-get.sh
new file mode 100755
index 000000000..4e349414c
--- /dev/null
+++ b/depend/zcash/zcutil/afl/afl-get.sh
@@ -0,0 +1,81 @@
+#!/usr/bin/env bash
+
+export LC_ALL=C
+set -eu -o pipefail
+
+for d in src/fuzzing/*/ ; do
+    fuzz_cases+="$(basename "$d"), "
+done
+
+FUZZ_OPTIONS_STRING="Where FUZZ_CASE is one of the following: ${fuzz_cases::-2}"
+
+required_options_count=0
+
+function help {
+    cat <<EOF
+Obtains and builds a copy of AFL from source.
+This script must be run from within the top level directory of a zcash clone.
+
+Usage:
+    $0 --afl-install=AFL_INSTALL_DIR
+
+    OPTIONS:
+        -h, --help              Print this help message
+        -i, --afl-install       Directory where AFL is going to be installed
+    EXAMPLE:
+        ./zcutil/afl/afl-get.sh -i /tmp/afl
+
+EOF
+}
+
+while (( "$#" )); do
+    case "$1" in
+        -i|--afl-install)
+            AFL_INSTALL_DIR=$2
+            required_options_count=1
+            break
+        ;;
+        -h|--help)
+            help
+            exit 0
+        ;;
+        -*|--*=)
+            echo "Error: Unsupported flag $1" >&2
+            help
+            exit 1
+        ;;
+    esac
+done
+
+if ((required_options_count == 0)); then
+    help
+    exit 1
+fi
+
+mkdir -p "$AFL_INSTALL_DIR"
+cd "$AFL_INSTALL_DIR"
+
+if [ ! -z "$(ls -A .)" ]; then
+    echo "$1 is not empty. This script will only attempt to build AFL in an empty directory."
+    exit 1
+fi
+
+# Get the AFL source
+rm -f afl-latest.tgz
+wget https://lcamtuf.coredump.cx/afl/releases/afl-latest.tgz
+sha256sum afl-latest.tgz | grep '43614b4b91c014d39ef086c5cc84ff5f068010c264c2c05bf199df60898ce045'
+if [ "$?" != "0" ]
+then
+    echo "Wrong SHA256 hash for afl"
+    exit
+fi
+tar xvf afl-latest.tgz
+mv afl-*/* .
+
+# Build AFL
+make
+
+echo "You can now build zcashd with AFL instrumentation as follows:"
+echo "$ make clean # if you've already built zcashd without AFL instrumentation"
+echo "$ ./zcutil/afl/afl-build.sh -i $(pwd) -f FUZZ_CASE"
+echo $FUZZ_OPTIONS_STRING
diff --git a/depend/zcash/zcutil/afl/afl-getbuildrun.sh b/depend/zcash/zcutil/afl/afl-getbuildrun.sh
new file mode 100755
index 000000000..028ee6419
--- /dev/null
+++ b/depend/zcash/zcutil/afl/afl-getbuildrun.sh
@@ -0,0 +1,69 @@
+#!/usr/bin/env bash
+
+export LC_ALL=C
+set -eu -o pipefail
+
+for d in src/fuzzing/*/ ; do
+    fuzz_cases+="$(basename "$d"), "
+done
+
+FUZZ_OPTIONS_STRING="Options are: ${fuzz_cases::-2}"
+
+required_options_count=0
+
+export AFL_INSTALL_DIR=$(realpath "./afl-temp")
+
+function help {
+    cat <<EOF
+Builds AFL and an instrumented zcashd, then begins fuzzing.
+This script must be run from within the top level directory of a zcash clone.
+Additional arguments are passed-through to AFL.
+
+Usage:
+    $0 --fuzz-case=FUZZ_CASE [ OPTIONS ... ] [ ARGUMENTS... ]
+
+    OPTIONS:
+        -f, --fuzz-case         $FUZZ_OPTIONS_STRING
+        -h, --help              Print this help message
+        -i, --afl-install       Directory where AFL is installed. Default: $AFL_INSTALL_DIR
+    EXAMPLE:
+        ./zcutil/afl/afl-getbuildrun.sh -f DecodeHexTx
+
+EOF
+}
+
+while (( "$#" )); do
+    case "$1" in
+        -f|--fuzz-case)
+            FUZZ_CASE=$2
+            ((++required_options_count))
+            shift 2
+        ;;
+        -i|--afl-install)
+            AFL_INSTALL_DIR=$2
+            shift 2
+        ;;
+        -h|--help)
+            help
+            exit 0
+        ;;
+        -*|--*=)
+            echo "Error: Unsupported flag $1" >&2
+            help
+            exit 1
+        ;;
+    esac
+done
+
+if ((required_options_count < 1)); then
+    help
+    exit 1
+fi
+
+if [ ! -d "$AFL_INSTALL_DIR" ]; then
+    mkdir "$AFL_INSTALL_DIR"
+fi
+
+./zcutil/afl/afl-get.sh -i "$AFL_INSTALL_DIR"
+./zcutil/afl/afl-build.sh -i "$AFL_INSTALL_DIR" -f "$FUZZ_CASE"
+./zcutil/afl/afl-run.sh -i "$AFL_INSTALL_DIR" -f "$FUZZ_CASE" "$@"
diff --git a/depend/zcash/zcutil/afl/afl-run.sh b/depend/zcash/zcutil/afl/afl-run.sh
new file mode 100755
index 000000000..e6872d9c2
--- /dev/null
+++ b/depend/zcash/zcutil/afl/afl-run.sh
@@ -0,0 +1,62 @@
+#!/usr/bin/env bash
+
+export LC_ALL=C
+set -exu -o pipefail
+
+for d in src/fuzzing/*/ ; do
+    fuzz_cases+="$(basename "$d"), "
+done
+
+FUZZ_OPTIONS_STRING="Options are: ${fuzz_cases::-2}"
+
+required_options_count=0
+
+function help {
+    cat <<EOF
+Start fuzzing a case in a previously zcashd built for AFL.
+This script must be run from within the top level directory of a zcash clone.
+Additional arguments are passed-through to AFL.
+
+Usage:
+    $0 --afl-install=AFL_INSTALL_DIR --fuzz-case=FUZZ_CASE [ ARGUMENTS... ]
+
+    OPTIONS:
+        -f, --fuzz-case         $FUZZ_OPTIONS_STRING
+        -h, --help              Print this help message
+        -i, --afl-install       Directory where AFL is installed
+    EXAMPLE:
+        ./zcutil/afl/afl-run.sh -i /tmp/afl -f DecodeHexTx
+
+EOF
+}
+
+while (( "$#" )); do
+    case "$1" in
+        -f|--fuzz-case)
+            FUZZ_CASE=$2
+            ((++required_options_count))
+            shift 2
+        ;;
+        -i|--afl-install)
+            AFL_INSTALL_DIR=$2
+            ((++required_options_count))
+            shift 2
+        ;;
+        -h|--help)
+            help
+            exit 0
+        ;;
+        -*|--*=)
+            echo "Error: Unsupported flag $1" >&2
+            help
+            exit 1
+        ;;
+    esac
+done
+
+if ((required_options_count < 2)); then
+    help
+    exit 1
+fi
+
+"$AFL_INSTALL_DIR/afl-fuzz" -i "./src/fuzzing/$FUZZ_CASE/input" -o "./src/fuzzing/$FUZZ_CASE/output" "$@" ./src/zcashd @@
diff --git a/depend/zcash/zcutil/afl/zcash-wrapper b/depend/zcash/zcutil/afl/zcash-wrapper
new file mode 100755
index 000000000..950c3ea03
--- /dev/null
+++ b/depend/zcash/zcutil/afl/zcash-wrapper
@@ -0,0 +1,59 @@
+#!/usr/bin/env bash
+
+set -ex -o pipefail
+
+
+instrument=(
+"\/src$"
+
+)
+
+if [ "$override_instrument" != "" ]
+then
+  instrument = $override_instrument
+fi
+
+# Store the command line we were given to a file
+
+(echo "$ARGS" ; pwd) >> "$AFL_LOG_DIR/zcash-build-wrapper.log"
+
+# Work out which compiler we were called as 
+
+case $0 in
+*zcash-wrapper-g++)
+  OCOMPILER="g++"
+  ACOMPILER=$OCOMPILER
+  ;;
+*zcash-wrapper-gcc)
+  OCOMPILER="gcc"
+  ACOMPILER=$OCOMPILER
+  ;;
+*zcash-wrapper-clang)
+  OCOMPILER="clang-6.0"
+  ACOMPILER="clang-fast"
+  CFLAGS="-fsanitize=address -static"
+  ;;
+*zcash-wrapper-clang++)
+  OCOMPILER="clang++-6.0"
+  ACOMPILER="clang-fast++"
+  CPPFLAGS="-fsanitize=address -static"
+  ;;
+*zcash-wrapper)
+  echo "Call this script instead of your regular compiler, and if the absolute path of the CWD the wrapper was called from matches a regex in the array 'instrument', it will call AFL to instrument the resulting binary. Otherwise it will call either g++ or gcc depending on how it was invoked. \$AFL_INSTALL_DIR must be set to the path where AFL is installed."
+  exit
+  ;;
+esac
+
+# Check if we should instrument
+
+for i in "${instrument[@]}"
+do
+  if echo -- "`pwd`" | grep "$i"; then
+    # We found a match, let's instrument this one.
+    echo "Matched directory `pwd` to instrument element $i. Instrumenting this call." >> "$AFL_LOG_DIR/zcash-build-wrapper.log"
+    exec -- "$AFL_INSTALL_DIR/afl-$ACOMPILER" "$@"
+  fi
+done
+
+# No match, just pass-through.
+exec -- "$OCOMPILER" "$@"
diff --git a/depend/zcash/zcutil/afl/zcash-wrapper-clang b/depend/zcash/zcutil/afl/zcash-wrapper-clang
new file mode 120000
index 000000000..e640aa6e1
--- /dev/null
+++ b/depend/zcash/zcutil/afl/zcash-wrapper-clang
@@ -0,0 +1 @@
+zcash-wrapper
\ No newline at end of file
diff --git a/depend/zcash/zcutil/afl/zcash-wrapper-clang++ b/depend/zcash/zcutil/afl/zcash-wrapper-clang++
new file mode 120000
index 000000000..e640aa6e1
--- /dev/null
+++ b/depend/zcash/zcutil/afl/zcash-wrapper-clang++
@@ -0,0 +1 @@
+zcash-wrapper
\ No newline at end of file
diff --git a/depend/zcash/zcutil/afl/zcash-wrapper-g++ b/depend/zcash/zcutil/afl/zcash-wrapper-g++
new file mode 120000
index 000000000..e640aa6e1
--- /dev/null
+++ b/depend/zcash/zcutil/afl/zcash-wrapper-g++
@@ -0,0 +1 @@
+zcash-wrapper
\ No newline at end of file
diff --git a/depend/zcash/zcutil/afl/zcash-wrapper-gcc b/depend/zcash/zcutil/afl/zcash-wrapper-gcc
new file mode 120000
index 000000000..e640aa6e1
--- /dev/null
+++ b/depend/zcash/zcutil/afl/zcash-wrapper-gcc
@@ -0,0 +1 @@
+zcash-wrapper
\ No newline at end of file
diff --git a/depend/zcash/zcutil/build-debian-package.sh b/depend/zcash/zcutil/build-debian-package.sh
new file mode 100755
index 000000000..6fadf85f9
--- /dev/null
+++ b/depend/zcash/zcutil/build-debian-package.sh
@@ -0,0 +1,78 @@
+#!/usr/bin/env bash
+## Usage:
+##  ./zcutil/build-debian-package.sh
+
+export LC_ALL=C
+set -e
+set -x
+
+BUILD_PATH="/tmp/zcbuild"
+PACKAGE_NAME="zcash"
+SRC_PATH=`pwd`
+SRC_DEB=$SRC_PATH/contrib/debian
+SRC_DOC=$SRC_PATH/doc
+
+umask 022
+
+if [ ! -d $BUILD_PATH ]; then
+    mkdir $BUILD_PATH
+fi
+
+PACKAGE_VERSION=$($SRC_PATH/src/zcashd --version | grep version | cut -d' ' -f4 | tr -d v)
+DEBVERSION=$(echo $PACKAGE_VERSION | sed 's/-beta/~beta/' | sed 's/-rc/~rc/' | sed 's/-/+/')
+BUILD_DIR="$BUILD_PATH/$PACKAGE_NAME-$PACKAGE_VERSION-amd64"
+
+if [ -d $BUILD_DIR ]; then
+    rm -R $BUILD_DIR
+fi
+
+DEB_BIN=$BUILD_DIR/usr/bin
+DEB_CMP=$BUILD_DIR/usr/share/bash-completion/completions
+DEB_DOC=$BUILD_DIR/usr/share/doc/$PACKAGE_NAME
+DEB_MAN=$BUILD_DIR/usr/share/man/man1
+mkdir -p $BUILD_DIR/DEBIAN $DEB_CMP $DEB_BIN $DEB_DOC $DEB_MAN
+chmod 0755 -R $BUILD_DIR/*
+
+# Package maintainer scripts (currently empty)
+#cp $SRC_DEB/postinst $BUILD_DIR/DEBIAN
+#cp $SRC_DEB/postrm $BUILD_DIR/DEBIAN
+#cp $SRC_DEB/preinst $BUILD_DIR/DEBIAN
+#cp $SRC_DEB/prerm $BUILD_DIR/DEBIAN
+# Copy binaries
+cp $SRC_PATH/src/zcashd $DEB_BIN
+cp $SRC_PATH/src/zcashd-wallet-tool $DEB_BIN
+cp $SRC_PATH/src/zcash-cli $DEB_BIN
+cp $SRC_PATH/zcutil/fetch-params.sh $DEB_BIN/zcash-fetch-params
+# Copy docs
+cp $SRC_PATH/doc/release-notes/release-notes-1.0.0.md $DEB_DOC/changelog
+cp $SRC_DEB/changelog $DEB_DOC/changelog.Debian
+cp $SRC_DEB/copyright $DEB_DOC
+cp -r $SRC_DEB/examples $DEB_DOC
+# Copy manpages
+cp $SRC_DOC/man/zcashd.1 $DEB_MAN
+cp $SRC_DOC/man/zcashd-wallet-tool.1 $DEB_MAN
+cp $SRC_DOC/man/zcash-cli.1 $DEB_MAN
+cp $SRC_DOC/man/zcash-fetch-params.1 $DEB_MAN
+# Copy bash completion files
+cp $SRC_PATH/contrib/zcashd.bash-completion $DEB_CMP/zcashd
+cp $SRC_PATH/contrib/zcash-cli.bash-completion $DEB_CMP/zcash-cli
+# Gzip files
+gzip --best -n $DEB_DOC/changelog
+gzip --best -n $DEB_DOC/changelog.Debian
+gzip --best -n $DEB_MAN/zcashd.1
+gzip --best -n $DEB_MAN/zcashd-wallet-tool.1
+gzip --best -n $DEB_MAN/zcash-cli.1
+gzip --best -n $DEB_MAN/zcash-fetch-params.1
+
+cd $SRC_PATH/contrib
+
+# Create the control file
+dpkg-shlibdeps $DEB_BIN/zcashd $DEB_BIN/zcash-cli
+dpkg-gencontrol -P$BUILD_DIR -v$DEBVERSION
+
+# Create the Debian package
+fakeroot dpkg-deb --build $BUILD_DIR
+cp $BUILD_PATH/$PACKAGE_NAME-$PACKAGE_VERSION-amd64.deb $SRC_PATH
+# Analyze with Lintian, reporting bugs and policy violations
+lintian -i $SRC_PATH/$PACKAGE_NAME-$PACKAGE_VERSION-amd64.deb
+exit 0
diff --git a/depend/zcash/zcutil/build.sh b/depend/zcash/zcutil/build.sh
new file mode 100755
index 000000000..8423a375c
--- /dev/null
+++ b/depend/zcash/zcutil/build.sh
@@ -0,0 +1,90 @@
+#!/bin/sh
+
+export LC_ALL=C
+set -eu
+set +x
+
+cmd_pref() {
+    if command -v "$2" >/dev/null; then
+        eval "$1=$2"
+    else
+        eval "$1=$3"
+    fi
+}
+
+# If a g-prefixed version of the command exists, use it preferentially.
+gprefix() {
+    cmd_pref "$1" "g$2" "$2"
+}
+
+gprefix READLINK readlink
+cd "$(dirname "$("$READLINK" -f "$0")")/.."
+
+# Allow user overrides to $MAKE. Typical usage for users who need it:
+#   MAKE=gmake ./zcutil/build.sh -j$(nproc)
+if [ -z "${MAKE-}" ]; then
+    MAKE=make
+fi
+
+# Allow overrides to $BUILD and $HOST for porters. Most users will not need it.
+#   BUILD=i686-pc-linux-gnu ./zcutil/build.sh
+if [ -z "${BUILD-}" ]; then
+    BUILD="$(./depends/config.guess)"
+fi
+if [ -z "${HOST-}" ]; then
+    HOST="$BUILD"
+fi
+
+# Allow users to set arbitrary compile flags. Most users will not need this.
+if [ -z "${CONFIGURE_FLAGS-}" ]; then
+    CONFIGURE_FLAGS=""
+fi
+
+if [ "x$*" = 'x--help' ]
+then
+    cat <<EOF
+Usage:
+
+$0 --help
+  Show this help message and exit.
+
+$0 [ MAKEARGS... ]
+  Build Zcash and most of its transitive dependencies from
+  source. MAKEARGS are applied to both dependencies and Zcash itself.
+
+  Pass flags to ./configure using the CONFIGURE_FLAGS environment variable.
+  For example, to enable coverage instrumentation (thus enabling "make cov"
+  to work), call:
+
+      CONFIGURE_FLAGS="--enable-lcov --disable-hardening" ./zcutil/build.sh
+
+  For verbose output, use:
+      ./zcutil/build.sh V=1
+EOF
+    exit 0
+fi
+
+set -x
+
+eval "$MAKE" --version
+as --version
+
+case "$CONFIGURE_FLAGS" in
+(*"--enable-debug"*)
+    DEBUG=1
+;;
+(*)
+    DEBUG=
+;;esac
+
+HOST="$HOST" BUILD="$BUILD" "$MAKE" "$@" -C ./depends/ DEBUG="$DEBUG"
+
+if [ "${BUILD_STAGE:-all}" = "depends" ]
+then
+    exit 0
+fi
+
+./zcutil/clean.sh
+./autogen.sh
+CONFIG_SITE="$PWD/depends/$HOST/share/config.site" ./configure $CONFIGURE_FLAGS
+"$MAKE" "$@"
diff --git a/depend/zcash/zcutil/clean.sh b/depend/zcash/zcutil/clean.sh
new file mode 100755
index 000000000..596cb3e09
--- /dev/null
+++ b/depend/zcash/zcutil/clean.sh
@@ -0,0 +1,110 @@
+#!/bin/sh
+# Copyright (c) 2020 The Zcash developers
+
+export LC_ALL=C
+
+rm -f src/Makefile
+rm -f src/Makefile.in
+rm -f doc/man/Makefile
+rm -f doc/man/Makefile.in
+
+rm -f .cargo/config
+rm -f .cargo/.configured-for-online
+rm -f .cargo/.configured-for-offline
+
+rm -f src/config/stamp-h1
+rm -f src/config/bitcoin-config.h
+rm -f src/obj/build.h
+rm -f src/leveldb/build_config.mk
+
+rm -f src/test/buildenv.py
+rm -f src/test/data/*.json.h
+rm -f src/test/data/*.raw.h
+
+rm -f qa/pull-tester/run-bitcoind-for-test.sh
+rm -f qa/pull-tester/tests-config.sh
+
+rm -f src/fuzz.cpp
+
+rm -rf test_bitcoin.coverage/ zcash-gtest.coverage/ total.coverage/
+
+rm -rf cache
+rm -rf target
+rm -rf depends/work
+
+find src -type f -and \( -name '*.Po' -or -name '*.Plo' -or -name '*.o' -or -name '*.a' -or -name '*.lib' -or -name '*.la' -or -name '*.lo' -or -name '*.lai' -or -name '*.pc' -or -name '.dirstamp' -or -name '*.gcda' -or -name '*.gcno' -or -name '*.sage.py' -or -name '*.trs' \) -delete
+
+clean_dirs()
+{
+    find . -depth -path "*/$1/*" -delete
+    find . -type d -name "$1" -delete
+}
+
+clean_exe()
+{
+    rm -f "$1" "$1.exe"
+}
+
+clean_dep()
+{
+    rm -rf "$1/autom4te.cache"
+    rm -f "$1/build-aux/compile"
+    rm -f "$1/build-aux/config.guess"
+    rm -f "$1/build-aux/config.sub"
+    rm -f "$1/build-aux/depcomp"
+    rm -f "$1/build-aux/install-sh"
+    rm -f "$1/build-aux/ltmain.sh"
+    rm -f "$1/build-aux/missing"
+    rm -f "$1/build-aux/test-driver"
+    rm -f "$1/build-aux/m4/libtool.m4"
+    rm -f "$1/build-aux/m4/lt~obsolete.m4"
+    rm -f "$1/build-aux/m4/ltoptions.m4"
+    rm -f "$1/build-aux/m4/ltsugar.m4"
+    rm -f "$1/build-aux/m4/ltversion.m4"
+    rm -f "$1/aclocal.m4"
+    rm -f "$1/config.log"
+    rm -f "$1/config.status"
+    rm -f "$1/gen_context"
+    rm -f "$1/configure"
+    rm -f "$1/libtool"
+    rm -f "$1/Makefile"
+    rm -f "$1/Makefile.in"
+    rm -f "$1/$2"
+    rm -f "$1/$2~"
+}
+
+clean_dirs .deps
+clean_dirs .libs
+clean_dirs __pycache__
+
+clean_exe src/bench/bench_bitcoin
+clean_exe src/zcash-cli
+clean_exe src/zcashd
+clean_exe src/zcashd-wallet-tool
+clean_exe src/zcash-gtest
+clean_exe src/zcash-tx
+clean_exe src/test/test_bitcoin
+
+clean_exe src/leveldb/db_bench
+clean_exe src/leveldb/leveldbutil
+rm -f src/leveldb/*_test src/leveldb/*_test.exe
+rm -f src/leveldb/*.so src/leveldb/*.so.*
+
+clean_dep . src/config/bitcoin-config.h.in
+
+clean_dep src/secp256k1 src/libsecp256k1-config.h.in
+rm -f src/secp256k1/src/ecmult_static_context.h
+rm -f src/secp256k1/src/libsecp256k1-config.h
+rm -f src/secp256k1/src/stamp-h1
+rm -f src/secp256k1/.so_locations
+clean_exe src/secp256k1/tests
+clean_exe src/secp256k1/exhaustive_tests
+rm -f src/secp256k1/tests.log src/secp256k1/exhaustive_tests.log src/secp256k1/test-suite.log
+
+clean_dep src/univalue univalue-config.h.in
+rm -f src/univalue/univalue-config.h
+rm -f src/univalue/stamp-h1
+clean_exe src/univalue/test_json
+clean_exe src/univalue/unitester
+clean_exe src/univalue/no_nul
+rm -f src/univalue/test/*.log
diff --git a/depend/zcash/zcutil/cleanup-tags.sh b/depend/zcash/zcutil/cleanup-tags.sh
new file mode 100755
index 000000000..cc1c970e7
--- /dev/null
+++ b/depend/zcash/zcutil/cleanup-tags.sh
@@ -0,0 +1,27 @@
+#!/usr/bin/env bash
+#
+# Warning: This deletes tags on "origin", so point that at the right target!
+#
+# Note: It doesn't delete any local tags.
+
+export LC_ALL=C
+set -exu -o pipefail
+
+ZCASH_TAG_RGX='^v[0-9]+.[0-9]+.[0-9]+.z[0-9]+'
+MAXJOBS=7
+
+i=0
+
+for nonzctag in $(git ls-remote origin \
+                         | grep refs/tags/ \
+                         | grep -v '\^{}$' \
+                         | sed 's,^.*refs/tags/,,' \
+                         | grep -Ev "$ZCASH_TAG_RGX"
+                 )
+do
+    git push origin ":refs/tags/${nonzctag}" &
+    i="$(expr "$i" + 1)"
+    [ "$i" -ge "$MAXJOBS" ] && wait -n
+done
+
+wait
diff --git a/depend/zcash/zcutil/distclean.sh b/depend/zcash/zcutil/distclean.sh
new file mode 100755
index 000000000..6d08435c3
--- /dev/null
+++ b/depend/zcash/zcutil/distclean.sh
@@ -0,0 +1,17 @@
+#!/bin/sh
+# Copyright (c) 2020 The Zcash developers
+
+export LC_ALL=C
+
+zcutil/clean.sh
+
+rm -rf depends/*-*-*
+rm -rf depends/built
+rm -rf depends/sources
+
+rm -rf afl-temp
+rm -rf src/fuzzing/*/output
+
+# These are not in clean.sh because they are only generated when building dependencies.
+rm -f zcutil/bin/db_*
+rmdir zcutil/bin 2>/dev/null || true
diff --git a/depend/zcash/zcutil/fetch-params.sh b/depend/zcash/zcutil/fetch-params.sh
new file mode 100755
index 000000000..69d2e964d
--- /dev/null
+++ b/depend/zcash/zcutil/fetch-params.sh
@@ -0,0 +1,237 @@
+#!/bin/sh
+
+export LC_ALL=C
+set -eu
+
+uname_S=$(uname -s 2>/dev/null || echo not)
+
+if [ "$uname_S" = "Darwin" ]; then
+    PARAMS_DIR="$HOME/Library/Application Support/ZcashParams"
+else
+    PARAMS_DIR="$HOME/.zcash-params"
+fi
+
+# Commented out because these are unused; see below.
+#SPROUT_PKEY_NAME='sprout-proving.key'
+#SPROUT_VKEY_NAME='sprout-verifying.key'
+SAPLING_SPEND_NAME='sapling-spend.params'
+SAPLING_OUTPUT_NAME='sapling-output.params'
+SAPLING_SPROUT_GROTH16_NAME='sprout-groth16.params'
+DOWNLOAD_URL="https://download.z.cash/downloads"
+IPFS_HASH="/ipfs/QmXRHVGLQBiKwvNq7c2vPxAKz1zRVmMYbmt7G5TQss7tY7"
+
+SHA256CMD="$(command -v sha256sum || echo shasum)"
+SHA256ARGS="$(command -v sha256sum >/dev/null || echo '-a 256')"
+
+WGETCMD="$(command -v wget || echo '')"
+IPFSCMD="$(command -v ipfs || echo '')"
+CURLCMD="$(command -v curl || echo '')"
+
+# fetch methods can be disabled with ZC_DISABLE_SOMETHING=1
+ZC_DISABLE_WGET="${ZC_DISABLE_WGET:-}"
+ZC_DISABLE_IPFS="${ZC_DISABLE_IPFS:-}"
+ZC_DISABLE_CURL="${ZC_DISABLE_CURL:-}"
+
+LOCKFILE=/tmp/fetch_params.lock
+
+fetch_wget() {
+    if [ -z "$WGETCMD" ] || ! [ -z "$ZC_DISABLE_WGET" ]; then
+        return 1
+    fi
+
+    cat <<EOF
+
+Retrieving (wget): $DOWNLOAD_URL/$1
+EOF
+
+    wget \
+        --progress=dot:giga \
+        --output-document="$2" \
+        --continue \
+        --retry-connrefused --waitretry=3 --timeout=30 \
+        "$DOWNLOAD_URL/$1"
+}
+
+fetch_ipfs() {
+    if [ -z "$IPFSCMD" ] || ! [ -z "$ZC_DISABLE_IPFS" ]; then
+        return 1
+    fi
+
+    cat <<EOF
+
+Retrieving (ipfs): $IPFS_HASH/$1
+EOF
+
+    ipfs get --output "$2" "$IPFS_HASH/$1"
+}
+
+fetch_curl() {
+    if [ -z "$CURLCMD" ] || ! [ -z "$ZC_DISABLE_CURL" ]; then
+        return 1
+    fi
+
+    cat <<EOF
+
+Retrieving (curl): $DOWNLOAD_URL/$1
+EOF
+
+    curl \
+        --output "$2" \
+        -# -L -C - \
+        "$DOWNLOAD_URL/$1"
+
+}
+
+fetch_failure() {
+    cat >&2 <<EOF
+
+Failed to fetch the Zcash zkSNARK parameters!
+Try installing one of the following programs and make sure you're online:
+
+ * ipfs
+ * wget
+ * curl
+
+EOF
+    exit 1
+}
+
+fetch_params() {
+    # We only set these variables inside this function,
+    # and unset them at the end of the function.
+    filename="$1"
+    output="$2"
+    dlname="${output}.dl"
+    expectedhash="$3"
+
+    if ! [ -f "$output" ]
+    then
+        for i in 1 2
+        do
+            for method in wget ipfs curl failure; do
+                if "fetch_$method" "${filename}.part.${i}" "${dlname}.part.${i}"; then
+                    echo "Download of part ${i} successful!"
+                    break
+                fi
+            done
+        done
+
+        for i in 1 2
+        do
+            if ! [ -f "${dlname}.part.${i}" ]
+            then
+                fetch_failure
+            fi
+        done
+
+        cat "${dlname}.part.1" "${dlname}.part.2" > "${dlname}"
+        rm "${dlname}.part.1" "${dlname}.part.2"
+
+        "$SHA256CMD" $SHA256ARGS -c <<EOF
+$expectedhash  $dlname
+EOF
+
+        # Check the exit code of the shasum command:
+        CHECKSUM_RESULT=$?
+        if [ $CHECKSUM_RESULT -eq 0 ]; then
+            mv -v "$dlname" "$output"
+        else
+            echo "Failed to verify parameter checksums!" >&2
+            exit 1
+        fi
+    fi
+
+    unset -v filename
+    unset -v output
+    unset -v dlname
+    unset -v expectedhash
+}
+
+# Use flock to prevent parallel execution.
+lock() {
+    if [ "$uname_S" = "Darwin" ]; then
+        if shlock -f ${LOCKFILE} -p $$; then
+            return 0
+        else
+            return 1
+        fi
+    else
+        # create lock file
+        eval "exec 9>$LOCKFILE"
+        # acquire the lock
+        flock -n 9 \
+            && return 0 \
+            || return 1
+    fi
+}
+
+exit_locked_error() {
+    echo "Only one instance of fetch-params.sh can be run at a time." >&2
+    exit 1
+}
+
+main() {
+
+    lock fetch-params.sh \
+    || exit_locked_error
+
+    cat <<EOF
+Zcash - fetch-params.sh
+
+This script will fetch the Zcash zkSNARK parameters and verify their
+integrity with sha256sum.
+
+If they already exist locally, it will exit now and do nothing else.
+EOF
+
+    # Now create PARAMS_DIR and insert a README if necessary:
+    if ! [ -d "$PARAMS_DIR" ]
+    then
+        mkdir -p "$PARAMS_DIR"
+        README_PATH="$PARAMS_DIR/README"
+        cat >> "$README_PATH" <<EOF
+This directory stores common Zcash zkSNARK parameters. Note that it is
+distinct from the daemon's -datadir argument because the parameters are
+large and may be shared across multiple distinct -datadir's such as when
+setting up test networks.
+EOF
+
+        # This may be the first time the user's run this script, so give
+        # them some info, especially about bandwidth usage:
+        cat <<EOF
+The complete parameters are currently just under 1.7GB in size, so plan 
+accordingly for your bandwidth constraints. If the Sprout parameters are
+already present the additional Sapling parameters required are just under 
+800MB in size. If the files are already present and have the correct 
+sha256sum, no networking is used.
+
+Creating params directory. For details about this directory, see:
+$README_PATH
+
+EOF
+    fi
+
+    cd "$PARAMS_DIR"
+
+    # Sprout parameters:
+    # Commented out because they are unneeded, but we will eventually update
+    # this to delete the parameters if possible.
+    #fetch_params "$SPROUT_PKEY_NAME" "$PARAMS_DIR/$SPROUT_PKEY_NAME" "8bc20a7f013b2b58970cddd2e7ea028975c88ae7ceb9259a5344a16bc2c0eef7"
+    #fetch_params "$SPROUT_VKEY_NAME" "$PARAMS_DIR/$SPROUT_VKEY_NAME" "4bd498dae0aacfd8e98dc306338d017d9c08dd0918ead18172bd0aec2fc5df82"
+
+    # Sapling parameters:
+    fetch_params "$SAPLING_SPEND_NAME" "$PARAMS_DIR/$SAPLING_SPEND_NAME" "8e48ffd23abb3a5fd9c5589204f32d9c31285a04b78096ba40a79b75677efc13"
+    fetch_params "$SAPLING_OUTPUT_NAME" "$PARAMS_DIR/$SAPLING_OUTPUT_NAME" "2f0ebbcbb9bb0bcffe95a397e7eba89c29eb4dde6191c339db88570e3f3fb0e4"
+    fetch_params "$SAPLING_SPROUT_GROTH16_NAME" "$PARAMS_DIR/$SAPLING_SPROUT_GROTH16_NAME" "b685d700c60328498fbde589c8c7c484c722b788b265b72af448a5bf0ee55b50"
+}
+
+if [ "x${1:-}" = 'x--testnet' ]
+then
+    echo "NOTE: testnet now uses the mainnet parameters, so the --testnet argument"
+    echo "is no longer needed (ignored)"
+    echo ""
+fi
+
+main
+rm -f $LOCKFILE
+exit 0
diff --git a/depend/zcash/zcutil/libfuzzer/libfuzzer-build.sh b/depend/zcash/zcutil/libfuzzer/libfuzzer-build.sh
new file mode 100755
index 000000000..9ad59b88a
--- /dev/null
+++ b/depend/zcash/zcutil/libfuzzer/libfuzzer-build.sh
@@ -0,0 +1,152 @@
+#!/usr/bin/env bash
+
+export LC_ALL=C
+set -eu -o pipefail
+
+usage() {
+    echo ""
+    echo "$0 <build stage> <options> <passthrough build arguments>"
+    echo ""
+    echo "Build a fuzzer in the local repo using the following options:"
+    echo ""
+    echo "<build stage>:"
+    echo " either \"depends\" or \"fuzzer\""
+    echo ""
+    echo "<options>:"
+    echo " -f,--fuzzer <fuzzername> (ignored if building \"depends\")"
+    echo " [-s,--sanitizers <sanitizers>]"
+    echo " [-i,--instrument <instrument>]"
+    echo " [-l,--logfile <logfile>] # default is ./zcash-build-wrapper.log"
+    echo " [-h,--help]"
+    echo ""
+    echo "Where fuzzer is an entry in ./src/fuzzing/*, the default sanitizer"
+    echo "is \"address\" and default instrument is ( \"^.*/src/$\" )."
+    echo ""
+    exit -1
+}
+
+die() {
+    echo $1
+    exit -1
+}
+
+# parse command line options
+
+POSITIONAL=()
+while [[ $# -gt 0 ]]
+do
+key="$1"
+
+case $key in
+    -f|--fuzzer)
+    FUZZER_NAME="$2"
+    if [ ! -f "./src/fuzzing/$FUZZER_NAME/fuzz.cpp" ]
+    then
+        die "Cannot find source code for fuzzer."
+    fi
+    shift
+    shift
+    ;;
+    -s|--sanitizers)
+    LLVM_SANITIZERS="$2"
+    shift
+    shift
+    ;;
+    -i|--instrument)
+    INSTRUMENT_CODE="$2"
+    shift
+    shift
+    ;;
+    -l|--logfile)
+    LOGFILE="$2"
+    shift
+    shift
+    ;;
+    -h|--help)
+    usage
+    shift
+    ;;
+    *)
+    POSITIONAL+=("$1")
+    shift
+    ;;
+esac
+done
+
+# positional arguments
+
+if [ ${#POSITIONAL[@]} -lt 1 ]
+then
+    usage
+else
+    BUILD_STAGE=${POSITIONAL[0]}
+fi
+
+case "${BUILD_STAGE:-undefined}" in
+    depends)
+    FUZZER_NAME=notused
+    # fine
+    ;;
+    fuzzer)
+    # fine
+    ;;
+    *)
+    # not fine
+    usage
+    ;;
+esac
+
+# required arguments
+
+if [ "${FUZZER_NAME:-undefined}" = "undefined" ]
+then
+    usage
+fi
+
+# default values
+
+if [ "${LLVM_SANITIZERS:-undefined}" = "undefined" ]
+then
+    export LLVM_SANITIZERS="address"
+fi
+if [ "${INSTRUMENT_CODE:-undefined}" = "undefined" ]
+then
+    export INSTRUMENT_CODE=("^.*\/src")
+fi
+if [ "${LOGFILE:-undefined}" = "undefined" ]
+then
+    export LOGFILE=./zcash-build-wrapper.log
+fi
+
+set -x
+
+export ZCUTIL=$(realpath "./zcutil")
+
+# overwrite the Linux make profile to use clang instead of GCC:
+
+cat $ZCUTIL/../depends/hosts/linux.mk | sed -e 's/=gcc/=clang/g' | sed -e 's/=g++/=clang++/g' > x
+mv x $ZCUTIL/../depends/hosts/linux.mk
+
+# the build_stage distinction helps to layer an intermediate docker
+# container for the built dependencies, so we can resume building
+# from there assuming no other build arguments have changed
+
+if [ "$BUILD_STAGE" = "depends" ]
+then
+    # make an empty fuzz file just so we can build dependencies
+    > src/fuzz.cpp
+else
+    cp "./src/fuzzing/$FUZZER_NAME/fuzz.cpp" src/fuzz.cpp || die "Can't copy fuzz.cpp for that fuzzer"
+fi
+
+# sneak the variable into zcashd's build.sh
+
+export BUILD_STAGE
+
+# run build.sh with our compiler wrapper, and BUILD_STAGE environment set:
+
+CONFIGURE_FLAGS="--enable-tests=no --disable-bench" \
+    "$ZCUTIL/build.sh" \
+    -j$(nproc) \
+    "CC=$ZCUTIL/libfuzzer/zcash-wrapper-clang" \
+    "CXX=$ZCUTIL/libfuzzer/zcash-wrapper-clang++" "${POSITIONAL[@]:1}" || die "Build failed at stage $BUILD_STAGE."
diff --git a/depend/zcash/zcutil/libfuzzer/zcash-wrapper b/depend/zcash/zcutil/libfuzzer/zcash-wrapper
new file mode 100755
index 000000000..8577ba764
--- /dev/null
+++ b/depend/zcash/zcutil/libfuzzer/zcash-wrapper
@@ -0,0 +1,123 @@
+#!/usr/bin/env bash
+
+# you shouldn't normally be calling this script directly, it should be called
+# by build.sh, but only when build.sh is invoked from libfuzzer-build.sh.
+
+set -ex -o pipefail
+
+# logging functions
+
+export green="\e[92m"
+export red="\e[95m"
+export normal="\e[0m"
+
+export color=$normal
+
+function log {
+    while read line
+    do
+        (echo ; echo -e "${color}${line}${normal}") >> "$LOGFILE" ;
+    done
+}
+
+# command-line parsing
+
+export FINAL_LINK=0 # by default we using -fsanitize=fuzzer-no-link
+
+for arg do
+    shift
+    if [ "$arg" = "-fPIE" ] # no more pie
+    then
+        set -- "$@" "-fPIC" "-fno-pie"
+        continue
+    fi
+    if [ "$arg" = "-pie" ]
+    then
+        set -- "$@" "-no-pie"
+        continue
+    fi
+    if [ "$arg" = "-o" ] # here an output file is being specified
+    then
+        if [ "$1" = "zcashd" ] # here zcashd is the output file
+        then
+            export FINAL_LINK=1 # we should use -fsanitize=fuzzer because that links libfuzzer
+        fi
+        # note no continue, we fall through to default set
+    fi
+    set -- "$@" "$arg"
+done
+
+# which source dirs to instrument
+
+if [ "$dirs_to_instrument" = "" ]
+then
+    export dirs_to_instrument=("^.*\/src$")
+fi
+
+# Store the command line we were given to a file
+
+echo "`hostname`:`pwd` \$" | log
+echo -- "original command: $0 $@" | log
+
+# decide on a sanitizer option beyond just fuzzing:
+# to link nor not to link libfuzzer we only link on
+# the final call, to the linker.
+
+if [ "$LLVM_SANITIZE" = "" ]
+then
+    export LLVM_SANITIZE="address" # you can override this behavior by setting this environment variable first
+fi
+
+if [ "$FINAL_LINK" = "1" ]
+then
+        export LLVM_SANITIZE="-fsanitize=fuzzer,$LLVM_SANITIZE"
+else
+        export LLVM_SANITIZE="-fsanitize=fuzzer-no-link,$LLVM_SANITIZE"
+fi
+
+
+# Work out which compiler we were called as
+
+case $0 in
+*zcash-wrapper-clang)
+    COMPILER="clang"
+    export DEFINES_FLAGS="${CFLAGS} -DZCASH_FUZZ=1 -DFUZZ_WITH_LIBFUZZER=1 -fPIC"
+    export INSTRUMENT_FLAGS="${DEFINES_FLAGS} ${LLVM_SANITIZE}"
+    ;;
+*zcash-wrapper-clang++)
+    COMPILER="clang++"
+    export DEFINES_FLAGS="${CXXFLAGS} -DZCASH_FUZZ=1 -DFUZZ_WITH_LIBFUZZER=1 -fPIC"
+    export INSTRUMENT_FLAGS="${DEFINES_FLAGS} ${LLVM_SANITIZE}"
+    ;;
+*zcash-wrapper)
+    echo -n "Call this script instead of your regular compiler, and if the absolute "
+    echo -n "path of the CWD the wrapper was called from matches a regex in the "
+    echo -n "array 'dirs_to_instrument', it will instrument the resulting object. "
+    echo -n "Otherwise it will exec directly to the original compiler without "
+    echo    "changing arguments."
+    echo -n "You can also set LLVM_SANITIZE to whatever sanitizers you'd like to use."
+    echo -n "the default is 'address'. You don't need the -fsanitize=fuzzer part, "
+    echo    "this script handles that"
+    exit
+    ;;
+esac
+
+# Check if we should instrument
+
+for i in "${dirs_to_instrument[@]}"
+do
+    if echo -- "`pwd`" | grep "$i"; then
+        # We found a match, let's instrument this one.
+        echo "pwd (`pwd`) matches dirs_to_instrument array element ($i). Adding instrumentation flags..." | log
+        echo "command with defines and instrumentation added:" | color=$green log
+        echo -- "$COMPILER" $INSTRUMENT_FLAGS "$@" | log
+        exec -- "$COMPILER" $INSTRUMENT_FLAGS "$@"
+    fi
+done
+
+# No match, just pass-through.
+
+echo -e -- "${red}command with defines added:${normal}" | color=$red log
+echo -- "$COMPILER" $DEFINES_FLAGS "$@" | log
+exec -- "$COMPILER" $DEFINES_FLAGS "$@"
+
diff --git a/depend/zcash/zcutil/libfuzzer/zcash-wrapper-clang b/depend/zcash/zcutil/libfuzzer/zcash-wrapper-clang
new file mode 120000
index 000000000..e640aa6e1
--- /dev/null
+++ b/depend/zcash/zcutil/libfuzzer/zcash-wrapper-clang
@@ -0,0 +1 @@
+zcash-wrapper
\ No newline at end of file
diff --git a/depend/zcash/zcutil/libfuzzer/zcash-wrapper-clang++ b/depend/zcash/zcutil/libfuzzer/zcash-wrapper-clang++
new file mode 120000
index 000000000..e640aa6e1
--- /dev/null
+++ b/depend/zcash/zcutil/libfuzzer/zcash-wrapper-clang++
@@ -0,0 +1 @@
+zcash-wrapper
\ No newline at end of file
diff --git a/depend/zcash/zcutil/make-release.py b/depend/zcash/zcutil/make-release.py
new file mode 100755
index 000000000..d0082bfa4
--- /dev/null
+++ b/depend/zcash/zcutil/make-release.py
@@ -0,0 +1,740 @@
+#!/usr/bin/env python3
+
+import os
+import re
+import sys
+import logging
+import argparse
+import subprocess
+import traceback
+import unittest
+import random
+from io import StringIO
+from functools import wraps
+
+
+def main(args=sys.argv[1:]):
+    """
+    Perform the final Zcash release process up to the git tag.
+    """
+    opts = parse_args(args)
+    chdir_to_repo(opts.REPO)
+    initialize_logging()
+    logging.debug('argv %r', sys.argv)
+
+    try:
+        main_logged(
+            opts.REVISION,
+            opts.RELEASE_VERSION,
+            opts.RELEASE_PREV,
+            opts.RELEASE_FROM,
+            opts.RELEASE_HEIGHT,
+            opts.HOTFIX,
+        )
+    except SystemExit as e:
+        logging.error(str(e))
+        raise SystemExit(1)
+    except:
+        logging.error(traceback.format_exc())
+        raise SystemExit(2)
+
+
+def parse_args(args):
+    p = argparse.ArgumentParser(description=main.__doc__)
+    p.add_argument(
+        '--repo',
+        dest='REPO',
+        type=str,
+        help='Path to repository root.',
+    )
+    p.add_argument(
+        '--hotfix',
+        action='store_true',
+        dest='HOTFIX',
+        help='Use if this is a hotfix release from a non-master branch.',
+    )
+    p.add_argument(
+        'REVISION',
+        type=GitHash.parse_arg,
+        help='The git commit hash from which to construct the release.',
+    )
+    p.add_argument(
+        'RELEASE_VERSION',
+        type=Version.parse_arg,
+        help='The release version: vX.Y.Z',
+    )
+    p.add_argument(
+        'RELEASE_PREV',
+        type=Version.parse_arg,
+        help='The previously released version.',
+    )
+    p.add_argument(
+        'RELEASE_FROM',
+        type=Version.parse_arg,
+        help='The previously released non-beta non-RC version. May be the same as RELEASE_PREV.',
+    )
+    p.add_argument(
+        'RELEASE_HEIGHT',
+        type=int,
+        help='A block height approximately occurring on release day.',
+    )
+    return p.parse_args(args)
+
+
+# Top-level flow:
+def main_logged(revision, release, releaseprev, releasefrom, releaseheight, hotfix):
+    verify_dependencies([
+        ('help2man', None),
+        ('debchange', 'devscripts'),
+    ])
+
+    verify_tags(revision, releaseprev, releasefrom)
+    verify_version(release, releaseprev, hotfix)
+    verify_dependency_updates()
+    initialize_git(revision, release, hotfix)
+    patch_version_in_files(release, releaseprev)
+    patch_release_height(releaseheight)
+    commit('Versioning changes for {}.'.format(release.novtext))
+
+    build()
+    gen_manpages()
+    commit('Updated manpages for {}.'.format(release.novtext))
+
+    gen_release_notes(release, releasefrom)
+    update_debian_changelog(release)
+    commit(
+        'Updated release notes and changelog for {}.'.format(
+            release.novtext,
+        ),
+    )
+
+
+def phase(message):
+    def deco(f):
+        @wraps(f)
+        def g(*a, **kw):
+            logging.info('%s', message)
+            return f(*a, **kw)
+        return g
+    return deco
+
+
+@phase('Checking release script dependencies.')
+def verify_dependencies(dependencies):
+    for (dependency, pkg) in dependencies:
+        try:
+            sh_log(dependency, '--version')
+        except OSError:
+            raise SystemExit(
+                "Missing dependency {}{}".format(
+                    dependency,
+                    " (part of {} Debian package)".format(pkg) if pkg else "",
+                ),
+            )
+
+@phase('Checking dependency updates.')
+def verify_dependency_updates():
+    try:
+        sh_log('./qa/zcash/updatecheck.py')
+    except SystemExit:
+        raise SystemExit("Dependency update check failed. Either some updates have not been correctly postponed, or the .updatecheck-token file is missing.")
+
+@phase('Checking tags.')
+def verify_tags(revision, releaseprev, releasefrom):
+    candidates = []
+
+    # Any tag beginning with a 'v' followed by [1-9] must be a version
+    # matching our Version parser. Tags beginning with v0 may exist from
+    # upstream and those do not follow our schema and are silently
+    # ignored. Any other tag is silently ignored.
+    candidatergx = re.compile('^v[1-9].*$')
+
+    for tag in sh_out('git', 'tag', '--list', '--merged', revision.value).splitlines():
+        if candidatergx.match(tag):
+            v = Version.parse(tag)
+            if v is not None:
+                candidates.append(v)
+
+    candidates.sort()
+    try:
+        latest = candidates[-1]
+    except IndexError:
+        raise SystemExit(
+            'No previous releases found by `git tag --list --merged {}`.'
+            .format(
+                revision.value
+            ),
+        )
+
+    if releaseprev != latest:
+        raise SystemExit(
+            'The latest candidate in `git tag --list --merged {} is {} not {}'
+            .format(
+                revision.value,
+                latest.vtext,
+                releaseprev.vtext,
+            ),
+        )
+
+    candidates.reverse()
+    prev_tags = []
+    for candidate in candidates:
+        if releasefrom == candidate:
+            break
+        else:
+            prev_tags.append(candidate)
+    else:
+        raise SystemExit(
+            '{} does not appear in `git tag --list --merged {}`'
+            .format(
+                releasefrom.vtext,
+                revision.value,
+            ),
+        )
+
+    for tag in prev_tags:
+        if not tag.betarc:
+            raise SystemExit(
+                '{} appears to be a more recent non-beta non-RC release than {}'
+                .format(
+                    tag.vtext,
+                    releasefrom.vtext,
+                ),
+            )
+
+
+@phase('Checking version.')
+def verify_version(release, releaseprev, hotfix):
+    if not hotfix:
+        return
+
+    expected = Version(
+        releaseprev.major,
+        releaseprev.minor,
+        releaseprev.patch + 1,
+        releaseprev.betarc,
+        None
+    )
+    if release != expected:
+        raise SystemExit(
+            "Expected {!r}, given {!r}".format(
+                expected, release,
+            ),
+        )
+
+
+@phase('Initializing git.')
+def initialize_git(revision, release, hotfix):
+    junk = sh_out('git', 'status', '--porcelain')
+    if junk.strip():
+        raise SystemExit('There are uncommitted changes:\n' + junk)
+
+    branch = 'release-' + release.vtext
+    logging.info(
+        'Creating release branch {} from revision {}.'
+        .format(
+            branch,
+            revision.value
+        )
+    )
+    sh_log('git', 'checkout', '-b', branch, revision.value)
+    return branch
+
+
+@phase('Patching versioning in files.')
+def patch_version_in_files(release, releaseprev):
+    patch_README(release, releaseprev)
+    patch_clientversion_h(release)
+    patch_configure_ac(release)
+    patch_gitian_linux_yml(release, releaseprev)
+
+
+@phase('Patching release height for end-of-support halt.')
+def patch_release_height(releaseheight):
+    rgx = re.compile(
+        r'^(static const int APPROX_RELEASE_HEIGHT = )\d+(;)$',
+    )
+    with PathPatcher('src/deprecation.h') as (inf, outf):
+        for line in inf:
+            m = rgx.match(line)
+            if m is None:
+                outf.write(line)
+            else:
+                [prefix, suffix] = m.groups()
+                outf.write(
+                    '{}{}{}\n'.format(
+                        prefix,
+                        releaseheight,
+                        suffix,
+                    ),
+                )
+
+
+@phase('Building...')
+def build():
+    base_dir = os.getcwd()
+    depends_dir = os.path.join(base_dir, 'depends')
+    src_dir = os.path.join(base_dir, 'src')
+    nproc = sh_out('nproc').strip()
+    sh_progress([
+        'Staging boost...',
+        'Staging libevent...',
+        'Staging zeromq...',
+        'Staging libsodium...',
+        "Leaving directory '%s'" % depends_dir,
+        'config.status: creating libzcash_script.pc',
+        "Entering directory '%s'" % src_dir,
+        'httpserver.cpp',
+        'torcontrol.cpp',
+        'gtest/test_tautology.cpp',
+        'gtest/test_metrics.cpp',
+        'test/equihash_tests.cpp',
+        'test/util_tests.cpp',
+        "Leaving directory '%s'" % src_dir,
+        ], './zcutil/build.sh', '-j', nproc)
+
+
+@phase('Generating manpages.')
+def gen_manpages():
+    sh_log('./contrib/devtools/gen-manpages.sh')
+
+
+@phase('Generating release notes.')
+def gen_release_notes(release, releasefrom):
+    release_notes = [
+        './zcutil/release-notes.py',
+        '--version',
+        release.novtext,
+        '--prev',
+        releasefrom.vtext,
+    ]
+    if not release.betarc:
+        release_notes.append('--clear')
+    sh_log(*release_notes)
+    sh_log(
+        'git',
+        'add',
+        './doc/authors.md',
+        './doc/release-notes/release-notes-{}.md'.format(release.novtext),
+    )
+
+
+@phase('Updating debian changelog.')
+def update_debian_changelog(release):
+    os.environ['DEBEMAIL'] = 'team@electriccoin.co'
+    os.environ['DEBFULLNAME'] = 'Electric Coin Company'
+    sh_log(
+        'debchange',
+        '--newversion', release.debversion,
+        '--distribution', 'stable',
+        '--changelog', './contrib/debian/changelog',
+        '{} release.'.format(release.novtext),
+    )
+
+
+# Helper code:
+def commit(message):
+    logging.info('Committing: %r', message)
+    fullmsg = 'make-release.py: {}'.format(message)
+    sh_log('git', 'commit', '--all', '-m', fullmsg)
+
+
+def chdir_to_repo(repo):
+    if repo is None:
+        dn = os.path.dirname
+        repo = dn(dn(os.path.abspath(sys.argv[0])))
+    os.chdir(repo)
+
+
+def patch_README(release, releaseprev):
+    with PathPatcher('README.md') as (inf, outf):
+        firstline = inf.readline()
+        assert firstline == 'Zcash {}\n'.format(releaseprev.novtext), \
+            repr(firstline)
+
+        outf.write('Zcash {}\n'.format(release.novtext))
+        outf.write(inf.read())
+
+
+def patch_clientversion_h(release):
+    _patch_build_defs(
+        release,
+        'src/clientversion.h',
+        (r'^(#define CLIENT_VERSION_(MAJOR|MINOR|REVISION|BUILD|IS_RELEASE))'
+         r' \d+()$'),
+    )
+
+
+def patch_configure_ac(release):
+    _patch_build_defs(
+        release,
+        'configure.ac',
+        (r'^(define\(_CLIENT_VERSION_(MAJOR|MINOR|REVISION|BUILD|IS_RELEASE),)'
+         r' \d+(\))$'),
+    )
+
+
+def patch_gitian_linux_yml(release, releaseprev):
+    path = 'contrib/gitian-descriptors/gitian-linux.yml'
+    with PathPatcher(path) as (inf, outf):
+        outf.write(inf.readline())
+
+        secondline = inf.readline()
+        assert secondline == 'name: "zcash-{}"\n'.format(
+            releaseprev.novtext
+        ), repr(secondline)
+
+        outf.write('name: "zcash-{}"\n'.format(release.novtext))
+        outf.write(inf.read())
+
+
+def _patch_build_defs(release, path, pattern):
+    rgx = re.compile(pattern)
+    with PathPatcher(path) as (inf, outf):
+        for line in inf:
+            m = rgx.match(line)
+            if m:
+                prefix, label, suffix = m.groups()
+                repl = {
+                    'MAJOR': release.major,
+                    'MINOR': release.minor,
+                    'REVISION': release.patch,
+                    'BUILD': release.build,
+                    'IS_RELEASE': (
+                        'false' if release.build < 50 else 'true'
+                    ),
+                }[label]
+                outf.write('{} {}{}\n'.format(prefix, repl, suffix))
+            else:
+                outf.write(line)
+
+
+def initialize_logging():
+    logname = './zcash-make-release.log'
+    fmtr = logging.Formatter(
+        '%(asctime)s L%(lineno)-4d %(levelname)-5s | %(message)s',
+        '%Y-%m-%d %H:%M:%S'
+    )
+
+    hout = logging.StreamHandler(sys.stdout)
+    hout.setLevel(logging.INFO)
+    hout.setFormatter(fmtr)
+
+    hpath = logging.FileHandler(logname, mode='a')
+    hpath.setLevel(logging.DEBUG)
+    hpath.setFormatter(fmtr)
+
+    root = logging.getLogger()
+    root.setLevel(logging.DEBUG)
+    root.addHandler(hout)
+    root.addHandler(hpath)
+    logging.info('zcash make-release.py debug log: %r', logname)
+
+
+def sh_out(*args):
+    logging.debug('Run (out): %r', args)
+    return subprocess.check_output(args).decode()
+
+
+def sh_log(*args):
+    PIPE = subprocess.PIPE
+    STDOUT = subprocess.STDOUT
+    try:
+        p = subprocess.Popen(args, stdout=PIPE, stderr=STDOUT, stdin=None)
+    except OSError:
+        logging.error('Error launching %r...', args)
+        raise
+
+    logging.debug('Run (log PID %r): %r', p.pid, args)
+    for line in p.stdout:
+        logging.debug('> %s', line.decode().rstrip())
+    status = p.wait()
+    if status != 0:
+        raise SystemExit('Nonzero exit status: {!r}'.format(status))
+
+
+def sh_progress(markers, *args):
+    try:
+        import progressbar
+    except:
+        sh_log(*args)
+        return
+
+    PIPE = subprocess.PIPE
+    STDOUT = subprocess.STDOUT
+    try:
+        p = subprocess.Popen(args, stdout=PIPE, stderr=STDOUT, stdin=None)
+    except OSError:
+        logging.error('Error launching %r...', args)
+        raise
+
+    pbar = progressbar.ProgressBar(max_value=len(markers))
+    marker = 0
+    pbar.update(marker)
+    logging.debug('Run (log PID %r): %r', p.pid, args)
+    for line in p.stdout:
+        line = line.decode()
+        logging.debug('> %s', line.rstrip())
+        for idx, val in enumerate(markers[marker:]):
+            if val in line:
+                marker += idx + 1
+                pbar.update(marker)
+                break
+    pbar.finish()
+    status = p.wait()
+    if status != 0:
+        raise SystemExit('Nonzero exit status: {!r}'.format(status))
+
+class GitHash (object):
+    '''A git commit hash.'''
+    RGX = re.compile(
+        r'^([0-9a-f]{10,40})$',
+    )
+
+    @staticmethod
+    def parse_arg(text):
+        m = GitHash.RGX.match(text)
+        if m is None:
+            raise argparse.ArgumentTypeError(
+                'Could not parse revision {!r} against regex {}'.format(
+                    text,
+                    GitHash.RGX.pattern,
+                ),
+            )
+        else:
+            assert len(m.groups()) == 1
+            [value] = m.groups()
+            return GitHash(value)
+
+    def __init__(self, value):
+        assert GitHash.RGX.match(value) is not None
+        self.value = value
+
+class Version (object):
+    '''A release version.'''
+
+    RGX = re.compile(
+        r'^v(0|[1-9]\d*)\.(0|[1-9]\d*)\.(0|[1-9]\d*)(-(beta|rc)?([1-9]\d*))?$',
+    )
+
+    @staticmethod
+    def parse(text):
+        m = Version.RGX.match(text)
+        if m is None:
+            return None
+        else:
+            [major, minor, patch, _, betarc, hyphen] = m.groups()
+            return Version(
+                int(major),
+                int(minor),
+                int(patch),
+                betarc,
+                int(hyphen) if hyphen is not None else None,
+            )
+
+    @staticmethod
+    def parse_arg(text):
+        v = Version.parse(text)
+        if v is None:
+            raise argparse.ArgumentTypeError(
+                'Could not parse version {!r} against regex {}'.format(
+                    text,
+                    Version.RGX.pattern,
+                ),
+            )
+        else:
+            return v
+
+    def __init__(self, major, minor, patch, betarc, hyphen):
+        for i in [major, minor, patch]:
+            assert type(i) is int, i
+        assert betarc in {None, 'rc', 'beta'}, betarc
+        assert hyphen is None or type(hyphen) is int, hyphen
+        if betarc is not None:
+            assert hyphen is not None, (betarc, hyphen)
+
+        self.major = major
+        self.minor = minor
+        self.patch = patch
+        self.betarc = betarc
+        self.hyphen = hyphen
+
+        if hyphen is None:
+            self.build = 50
+        else:
+            assert hyphen > 0, hyphen
+            if betarc is None:
+                assert hyphen < 50, hyphen
+                self.build = 50 + hyphen
+            else:
+                assert hyphen < 26, hyphen
+                self.build = {'beta': 0, 'rc': 25}[betarc] + hyphen - 1
+
+    @property
+    def novtext(self):
+        return self._novtext(debian=False)
+
+    @property
+    def vtext(self):
+        return 'v' + self.novtext
+
+    @property
+    def debversion(self):
+        return self._novtext(debian=True)
+
+    def _novtext(self, debian):
+        novtext = '{}.{}.{}'.format(self.major, self.minor, self.patch)
+
+        if self.hyphen is None:
+            return novtext
+        else:
+            assert self.hyphen > 0, self.hyphen
+            if self.betarc is None:
+                assert self.hyphen < 50, self.hyphen
+                sep = '+' if debian else '-'
+                return '{}{}{}'.format(novtext, sep, self.hyphen)
+            else:
+                assert self.hyphen < 26, self.hyphen
+                sep = '~' if debian else '-'
+                return '{}{}{}{}'.format(
+                    novtext,
+                    sep,
+                    self.betarc,
+                    self.hyphen,
+                )
+
+    def __repr__(self):
+        return '<Version {}>'.format(self.vtext)
+
+    def _sort_tup(self):
+        if self.hyphen is None:
+            prio = 2
+        else:
+            prio = {'beta': 0, 'rc': 1, None: 3}[self.betarc]
+
+        return (
+            self.major,
+            self.minor,
+            self.patch,
+            prio,
+            self.hyphen,
+        )
+
+    def __lt__(self, other):
+        return self._sort_tup() < other._sort_tup()
+
+    def __eq__(self, other):
+        return self._sort_tup() == other._sort_tup()
+
+
+class PathPatcher (object):
+    def __init__(self, path):
+        self._path = path
+
+    def __enter__(self):
+        logging.debug('Patching %r', self._path)
+        self._inf = open(self._path, 'r', encoding='utf8')
+        self._outf = StringIO()
+        return (self._inf, self._outf)
+
+    def __exit__(self, et, ev, tb):
+        if (et, ev, tb) == (None, None, None):
+            self._inf.close()
+            with open(self._path, 'w', encoding='utf8') as f:
+                f.write(self._outf.getvalue())
+
+
+# Unit Tests
+class TestVersion (unittest.TestCase):
+    ValidVersionsAndBuilds = [
+        # These are taken from: git tag --list | grep '^v1'
+        ('v1.0.0-beta1', 0),
+        ('v1.0.0-beta2', 1),
+        ('v1.0.0-rc1', 25),
+        ('v1.0.0-rc2', 26),
+        ('v1.0.0-rc3', 27),
+        ('v1.0.0-rc4', 28),
+        ('v1.0.0', 50),
+        ('v1.0.1', 50),
+        ('v1.0.2', 50),
+        ('v1.0.3', 50),
+        ('v1.0.4', 50),
+        ('v1.0.5', 50),
+        ('v1.0.6', 50),
+        ('v1.0.7-1', 51),
+        ('v1.0.8', 50),
+        ('v1.0.8-1', 51),
+        ('v1.0.9', 50),
+        ('v1.0.10', 50),
+        ('v7.42.1000', 50),
+    ]
+
+    ValidVersions = [
+        v
+        for (v, _)
+        in ValidVersionsAndBuilds
+    ]
+
+    def test_arg_parse_and_vtext_identity(self):
+        for case in self.ValidVersions:
+            v = Version.parse_arg(case)
+            self.assertEqual(v.vtext, case)
+
+    def test_rev_parse(self):
+        sample = '958bcf2dac6d81d17797c0f58f176262a496cfd4'
+        rev = GitHash.parse_arg(sample)
+        self.assertEqual(rev.value, sample)
+
+    def test_arg_parse_negatives(self):
+        cases = [
+            'v07.0.0',
+            'v1.0.03',
+            'v1.2.3-0',
+            'v1.2.3-foobar',
+            'v1.2.3~0',
+            'v1.2.3+0',
+            '1.2.3',
+        ]
+
+        for case in cases:
+            self.assertRaises(
+                argparse.ArgumentTypeError,
+                Version.parse_arg,
+                case,
+            )
+
+    def test_version_sort(self):
+        expected = [Version.parse_arg(v) for v in self.ValidVersions]
+
+        rng = random.Random()
+        rng.seed(0)
+
+        for _ in range(1024):
+            vec = list(expected)
+            rng.shuffle(vec)
+            vec.sort()
+            self.assertEqual(vec, expected)
+
+    def test_build_nums(self):
+        for (text, expected) in self.ValidVersionsAndBuilds:
+            version = Version.parse_arg(text)
+            self.assertEqual(version.build, expected)
+
+
+if __name__ == '__main__':
+    if len(sys.argv) == 2 and sys.argv[1] == '--help':
+        main()
+    else:
+        actualargs = sys.argv
+        sys.argv = [sys.argv[0], '--verbose']
+
+        print('=== Self Test ===')
+        try:
+            unittest.main(verbosity=2)
+        except SystemExit as e:
+            if e.args[0] != 0:
+                raise
+
+        sys.argv = actualargs
+        print('=== Running ===')
+        main()
diff --git a/depend/zcash/zcutil/release-notes.py b/depend/zcash/zcutil/release-notes.py
new file mode 100755
index 000000000..91b145fb2
--- /dev/null
+++ b/depend/zcash/zcutil/release-notes.py
@@ -0,0 +1,158 @@
+#!/usr/bin/env python3
+# -*- coding: utf-8 -*-
+
+import re, os, os.path
+import subprocess
+import argparse
+from itertools import islice
+from operator import itemgetter
+
+TEMP_RELEASE_NOTES_HEADER = [
+    '(note: this is a temporary file, to be added-to by anybody, and moved to\n',
+    'release-notes at release time)\n',
+    '\n',
+    'Notable changes\n',
+    '===============\n',
+    '\n',
+]
+
+RELEASE_NOTES_CHANGELOG_HEADING = [
+    'Changelog\n',
+    '=========\n',
+    '\n',
+]
+
+author_aliases = {
+    'Ariel': 'Ariel Gabizon',
+    'arielgabizon': 'Ariel Gabizon',
+    'bitcartel': 'Simon Liu',
+    'Charlie OKeefe': 'Charlie O\'Keefe',
+    'Duke Leto': 'Jonathan \"Duke\" Leto',
+    'Eirik0': 'Eirik Ogilvie-Wigley',
+    'EthanHeilman': 'Ethan Heilman',
+    'MarcoFalke': 'Marco Falke',
+    'mdr0id': 'Marshall Gaucher',
+    'paveljanik': 'Pavel Janík',
+    'Simon': 'Simon Liu',
+    'str4d': 'Jack Grigg',
+    'zebambam': 'Benjamin Winston',
+    'therealyingtong': 'Ying Tong Lai',
+    'zancas': 'Zancas Wilcox',
+    'bambam': 'Benjamin Winston'
+}
+
+def apply_author_aliases(name):
+    if name in author_aliases:
+        return author_aliases[name]
+    else:
+        return name
+
+def parse_authors(line):
+    commit_search = re.search('\((\d+)\)', line)
+    if commit_search:
+        commits = commit_search.group(1)
+    else:
+        commits = 0
+    name = re.sub(' \(\d+\)|:|\n|\r\n$', '', line)
+    return name, commits
+
+def alias_authors_in_release_notes(line):
+    for key in author_aliases:
+        if re.match(key, line):
+            line = line.replace(key, author_aliases[key])
+            break
+    return line
+
+## Returns dict of {'author': #_of_commits} from a release note
+def authors_in_release_notes(filename):
+    note = os.path.join(doc_dir, 'release-notes', filename)
+    with open(note, mode='r', encoding="utf-8", errors="replace") as f:
+        authors = {}
+        line = f.readline()
+        first_name, commits = parse_authors(line)
+        authors[apply_author_aliases(first_name)] = commits
+        for line in f:
+            if line in ['\n', '\r\n']:
+                for author in islice(f, 1):
+                    name, commits = parse_authors(author)
+                    authors[apply_author_aliases(name)] = commits
+        return authors
+
+## Sums commits made by contributors in each Zcash release note in ./doc/release-notes and writes to authors.md
+def document_authors():
+    print("Writing contributors documented in release-notes directory to authors.md.")
+    authors_file = os.path.join(doc_dir, 'authors.md')
+    with open(authors_file, mode='w', encoding="utf-8", errors="replace") as f:
+        f.write('Zcash Contributors\n==================\n\n')
+        total_contrib = {}
+        for notes in os.listdir(os.path.join(doc_dir, 'release-notes')):
+            # Commits are duplicated across beta, RC and final release notes,
+            # except for the pre-launch release notes.
+            if ('-beta' in notes or '-rc' in notes) and '1.0.0-' not in notes:
+                continue
+            authors = authors_in_release_notes(notes)
+            for author in authors:
+                commits = int(authors[author])
+                if author in total_contrib:
+                    total_contrib[author] += commits
+                else:
+                    total_contrib[author] = commits
+        sorted_contrib = sorted(total_contrib.items(), key=itemgetter(1, 0), reverse=True)
+        for n, c in sorted_contrib:
+            if c != 0:
+                f.write("{0} ({1})\n".format(n, c))
+
+## Writes release note to ./doc/release-notes based on git shortlog when current version number is specified
+def generate_release_note(version, prev, clear):
+    filename = 'release-notes-{0}.md'.format(version)
+    print("Automatically generating release notes for {0} from git shortlog. Should review {1} for accuracy.".format(version, filename))
+    if prev:
+        latest_tag = prev
+    else:
+        # fetches latest tags, so that latest_tag will be correct
+        subprocess.Popen(['git fetch -t'], shell=True, stdout=subprocess.PIPE).communicate()[0]
+        latest_tag = subprocess.Popen(['git describe --abbrev=0'], shell=True, stdout=subprocess.PIPE).communicate()[0].strip()
+    print("Previous release tag: ", latest_tag)
+    notes = subprocess.Popen(['git shortlog --no-merges {0}..HEAD'.format(latest_tag)], shell=True, stdin=subprocess.PIPE, stdout=subprocess.PIPE).communicate()[0]
+    lines = notes.decode("utf-8", "replace").split('\n')
+    lines = [alias_authors_in_release_notes(line) for line in lines]
+    temp_release_note = os.path.join(doc_dir, 'release-notes.md')
+    with open(temp_release_note, mode='r', encoding="utf-8", errors="replace") as f:
+        notable_changes = f.readlines()
+        # Assumes that all notable changes are appended to the default header
+        if len(notable_changes) > 6:
+            notable_changes = notable_changes[3:] + ['\n']
+        else:
+            notable_changes = []
+    release_note = os.path.join(doc_dir, 'release-notes', filename)
+    with open(release_note, mode='w', encoding="utf-8", errors="replace") as f:
+        f.writelines(notable_changes)
+        f.writelines(RELEASE_NOTES_CHANGELOG_HEADING)
+        f.writelines('\n'.join(lines))
+    if clear:
+        # Clear temporary release notes file
+        with open(temp_release_note, mode='w', encoding="utf-8", errors="replace") as f:
+            f.writelines(TEMP_RELEASE_NOTES_HEADER)
+
+def main(version, prev, clear):
+    if version != None:
+        generate_release_note(version, prev, clear)
+    document_authors()
+
+if __name__ == "__main__":
+    parser = argparse.ArgumentParser()
+    parser.add_argument('--version', help='Upcoming version, without leading v')
+    parser.add_argument('--prev', help='Previous version, with leading v')
+    parser.add_argument('--clear', help='Wipe doc/release-notes.md', action='store_true')
+    args = parser.parse_args()
+
+    root_dir = os.path.dirname(os.path.dirname(os.path.realpath(__file__)))
+    doc_dir = os.path.join(root_dir, 'doc')
+    version = None
+    prev = None
+    clear = False
+    if args.version:
+        version = args.version
+        prev = args.prev
+        clear = args.clear
+    main(version, prev, clear)
diff --git a/src/lib.rs b/src/lib.rs
index 847628fab..bab2dc4a5 100644
--- a/src/lib.rs
+++ b/src/lib.rs
@@ -1,5 +1,5 @@
 #![doc(html_logo_url = "https://www.zfnd.org/images/zebra-icon.png")]
-#![doc(html_root_url = "https://docs.rs/zcash_script/0.1.5")]
+#![doc(html_root_url = "https://docs.rs/zcash_script/0.1.6")]
 #![allow(non_upper_case_globals)]
 #![allow(non_camel_case_types)]
 #![allow(non_snake_case)]